Use the current object as the compaction index

Instead of keeping track of the current bit plane, keep track of the actual slot when compacting. This means we don't need to re-scan objects inside the same bit plane when we continue with movement
author: Aaron Patterson <tenderlove@ruby-lang.org> 2021-06-01 14:34:34 -0700
committer: Aaron Patterson <tenderlove@ruby-lang.org> 2021-06-01 15:25:08 -0700
commit: f9b9d1c58052fa566bddc7fcc902ef123902bdc2 (patch)
tree: 180192122ea28c53af7c6061fe178c6de0c64f83 /test/rubygems/specifications
parent: 9024c7f1bb3ea432a2b52e7c701b06f83aafd4d5 (diff)
0 files changed, 0 insertions, 0 deletions
diff --git a/.cvsignore b/.cvsignore
deleted file mode 100644
index 8fcaffddb2..0000000000
--- a/.cvsignore
+++ /dev/null
@@ -1,19 +0,0 @@
-parse.c
-newver.rb
-ruby
-miniruby
-README.fat-patch
-configure
-config.cache
-config.h
-config.log
-config.status
-Makefile
-ppack
-archive
-extmk.rb
-*.orig
-*.rej
-*.bak
-*.sav
-*~
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
new file mode 100644
index 0000000000..753d6f9892
--- /dev/null
+++ b/.document
@@ -0,0 +1,59 @@
+# This file determines which files in the
+# Ruby hierarchy will be processed by the RDoc
+# tool when it is given the top-level directory
+# as an argument
+
+# Process all the C source files
+*.c
+*.y
+
+# prelude
+prelude.rb
+rbconfig.rb
+
+array.rb
+ast.rb
+dir.rb
+gc.rb
+hash.rb
+io.rb
+kernel.rb
+marshal.rb
+numeric.rb
+nilclass.rb
+pack.rb
+pathname_builtin.rb
+ractor.rb
+string.rb
+symbol.rb
+timev.rb
+thread_sync.rb
+trace_point.rb
+warning.rb
+yjit.rb
+zjit.rb
+
+# Errno::*
+known_errors.inc
+
+# the lib/ directory (which has its own .document file)
+lib
+
+# and some of the ext/ directory (which has its own .document file)
+ext
+
+# For `prism`, ruby code is in lib and c in the prism folder
+prism
+
+# rdoc files
+NEWS.md
+
+README.md
+README.ja.md
+
+COPYING
+COPYING.ja
+
+LEGAL
+
+doc
diff --git a/.editorconfig b/.editorconfig
new file mode 100644
index 0000000000..4633a7acae
--- /dev/null
+++ b/.editorconfig
@@ -0,0 +1,30 @@
+root = true
+
+[*]
+end_of_line = lf
+indent_size = 4
+indent_style = space
+insert_final_newline = true
+tab_width = 8
+trim_trailing_whitespace = true
+
+[*.bat]
+end_of_line = crlf
+
+[*.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
new file mode 100644
index 0000000000..4457f6f12b
--- /dev/null
+++ b/.gdbinit
@@ -0,0 +1,1332 @@
+define ruby_gdb_init
+  init-if-undefined $color_type = "\033[31m"
+  init-if-undefined $color_highlite = "\033[36m"
+  init-if-undefined $color_end = "\033[m"
+end
+
+# set prompt \033[36m(gdb)\033[m\040
+
+define rp
+  ruby_gdb_init
+  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)
+    printf "%sSYMBOL%s: ", $color_type, $color_end
+    rp_id $id
+  else
+  if ($arg0) == RUBY_Qfalse
+    echo false\n
+  else
+  if ($arg0) == RUBY_Qtrue
+    echo true\n
+  else
+  if ($arg0) == RUBY_Qnil
+    echo nil\n
+  else
+  if ($arg0) == RUBY_Qundef
+    echo undef\n
+  else
+  if (VALUE)($arg0) & RUBY_IMMEDIATE_MASK
+    if ((VALUE)($arg0) & RUBY_FLONUM_MASK) == RUBY_FLONUM_FLAG
+      printf "%sFLONUM%s: %g\n", $color_type, $color_end, (double)rb_float_value($arg0)
+    else
+      echo immediate\n
+    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)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_NIL
+    printf "%sT_NIL%s: ", $color_type, $color_end
+    print (struct RBasic *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_OBJECT
+    printf "%sT_OBJECT%s: ", $color_type, $color_end
+    print ((struct RObject *)($arg0))->basic
+    if ($flags & ROBJECT_EMBED)
+      print/x *((VALUE*)((struct RObject*)($arg0))->as.ary) @ (RSHAPE_CAPACITY(rb_obj_shape_id($arg0)))
+    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
+    rp_class $arg0
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_ICLASS
+    printf "%sT_ICLASS%s: ", $color_type, $color_end
+    rp_class $arg0
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_MODULE
+    printf "%sT_MODULE%s: ", $color_type, $color_end
+    rp_class $arg0
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_FLOAT
+    printf "%sT_FLOAT%s: %.16g ", $color_type, $color_end, (((struct RFloat*)($arg0))->float_value)
+    print (struct RFloat *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_STRING
+    printf "%sT_STRING%s: ", $color_type, $color_end
+    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 = ((struct RString*)($arg0))->len
+    set print address off
+    output *(char *)(($rsflags & RUBY_FL_USER1) ? \
+            ((struct RString*)$regsrc)->as.heap.ptr : \
+            ((struct RString*)$regsrc)->as.embed.ary) @ $len
+    set print address on
+    printf " len:%ld ", $len
+    if $flags & RUBY_FL_USER6
+      printf "(none) "
+    end
+    if $flags & RUBY_FL_USER5
+      printf "(literal) "
+    end
+    if $flags & RUBY_FL_USER4
+      printf "(fixed) "
+    end
+    printf "encoding:%d ", ($flags & RUBY_ENCODING_MASK) >> RUBY_ENCODING_SHIFT
+    print (struct RRegexp *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_ARRAY
+    if ($flags & RUBY_FL_USER1)
+      set $len = (($flags & (RUBY_FL_USER3|RUBY_FL_USER4)) >> (RUBY_FL_USHIFT+3))
+      printf "%sT_ARRAY%s: len=%ld ", $color_type, $color_end, $len
+      printf "(embed) "
+      if ($len == 0)
+        printf "{(empty)} "
+      else
+        print/x *((VALUE*)((struct RArray*)($arg0))->as.ary) @ $len
+        printf " "
+      end
+    else
+      set $len = ((struct RArray*)($arg0))->as.heap.len
+      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_root
+        printf " "
+      else
+        printf "(ownership) capa=%ld ", ((struct RArray*)($arg0))->as.heap.aux.capa
+      end
+      if ($len == 0)
+        printf "{(empty)} "
+      else
+        print/x *((VALUE*)((struct RArray*)($arg0))->as.heap.ptr) @ $len
+        printf " "
+      end
+    end
+    print (struct RArray *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_FIXNUM
+    printf "%sT_FIXNUM%s: ", $color_type, $color_end
+    print (struct RBasic *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_HASH
+    printf "%sT_HASH%s: ", $color_type, $color_end,
+    if (((struct RHash *)($arg0))->basic.flags & RHASH_ST_TABLE_FLAG)
+      set $st = (struct st_table *)((uintptr_t)($arg0) + sizeof(struct RHash))
+      printf "st len=%ld ", $st->num_entries
+      print $st
+    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)
+	print (struct ar_table_struct *)((uintptr_t)($arg0) + sizeof(struct RHash))
+    end
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_STRUCT
+    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)
+    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
+    rp_bignum $arg0
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_RATIONAL
+    printf "%sT_RATIONAL%s: ", $color_type, $color_end
+    print (struct RRational *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_COMPLEX
+    printf "%sT_COMPLEX%s: ", $color_type, $color_end
+    print (struct RComplex *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_FILE
+    printf "%sT_FILE%s: ", $color_type, $color_end
+    print (struct RFile *)($arg0)
+    output *((struct RFile *)($arg0))->fptr
+    printf "\n"
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_TRUE
+    printf "%sT_TRUE%s: ", $color_type, $color_end
+    print (struct RBasic *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_FALSE
+    printf "%sT_FALSE%s: ", $color_type, $color_end
+    print (struct RBasic *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_DATA
+    set $data = (struct RTypedData *)($arg0)
+    set $type = (const rb_data_type_t *)($data->type & ~1)
+    printf "%sT_DATA%s(%s): ", $color_type, $color_end, $type->wrap_struct_name
+    print *$type
+    if ($data->type & 1)
+      print (void *)&$data->data
+    else
+      print $data
+    end
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_MATCH
+    printf "%sT_MATCH%s: ", $color_type, $color_end
+    print (struct RMatch *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_SYMBOL
+    printf "%sT_SYMBOL%s: ", $color_type, $color_end
+    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)
+    printf "): "
+    print *(NODE *)($arg0)
+  else
+  if ($flags & RUBY_T_MASK) == RUBY_T_ZOMBIE
+    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
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  end
+  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
+  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 = ((struct RString*)($arg0))->len
+  if $len > 0
+    output *(char *)(($flags & RUBY_FL_USER1) ? \
+            ((struct RString*)($arg0))->as.heap.ptr : \
+            ((struct RString*)($arg0))->as.embed.ary) @ $len
+  else
+    output ""
+  end
+end
+
+define print_string
+  set $flags = ((struct RBasic*)($arg0))->flags
+  set $len = ((struct RString*)($arg0))->len
+  if $len > 0
+    printf "%s", *(char *)(($flags & RUBY_FL_USER1) ? \
+            ((struct RString*)($arg0))->as.heap.ptr : \
+            ((struct RString*)($arg0))->as.embed.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
+  set $class_and_classext = (struct RClass_and_rb_classext_t *)($arg0)
+  printf "(struct RClass *) %p", (void*)$arg0
+  if $class_and_classext->classext->origin_ != (VALUE)$arg0
+    printf " -> %p", $class_and_classext->classext->origin_
+  end
+  printf "\n"
+  rb_classname $arg0
+  print/x *$class_and_classext
+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
+document nd_type
+  Print a Ruby' node type.
+end
+
+define nd_file
+  print ((NODE*)($arg0))->nd_file
+end
+document nd_file
+  Print the source file name of a node.
+end
+
+define nd_line
+  print ((unsigned int)((((NODE*)($arg0))->flags>>RUBY_NODE_LSHIFT)&RUBY_NODE_LMASK))
+end
+document nd_line
+  Print the source line number of a node.
+end
+
+# Print members of ruby node.
+
+define nd_head
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_alen
+  printf "%su2.argc%s: ", $color_highlite, $color_end
+  p ($arg0).u2.argc
+end
+
+define nd_next
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_cond
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_body
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+define nd_else
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_orig
+  printf "%su3.value%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.value
+end
+
+
+define nd_resq
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+define nd_ensr
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_1st
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_2nd
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+
+define nd_stts
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+
+define nd_vid
+  printf "%su1.id%s: ", $color_highlite, $color_end
+  p ($arg0).u1.id
+end
+
+define nd_cflag
+  printf "%su2.id%s: ", $color_highlite, $color_end
+  p ($arg0).u2.id
+end
+
+define nd_cval
+  printf "%su3.value%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.value
+end
+
+define nd_tbl
+  printf "%su1.tbl%s: ", $color_highlite, $color_end
+  p ($arg0).u1.tbl
+end
+
+
+define nd_var
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_ibdy
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+define nd_iter
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_value
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+define nd_aid
+  printf "%su3.id%s: ", $color_highlite, $color_end
+  p ($arg0).u3.id
+end
+
+
+define nd_lit
+  printf "%su1.value%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.value
+end
+
+define nd_rest
+  printf "%su2.argc%s: ", $color_highlite, $color_end
+  p ($arg0).u2.argc
+end
+
+define nd_opt
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+
+define nd_recv
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_mid
+  printf "%su2.id%s: ", $color_highlite, $color_end
+  p ($arg0).u2.id
+end
+
+define nd_args
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+define nd_defn
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_old
+  printf "%su1.id%s: ", $color_highlite, $color_end
+  p ($arg0).u1.id
+end
+
+define nd_new
+  printf "%su2.id%s: ", $color_highlite, $color_end
+  p ($arg0).u2.id
+end
+
+
+define nd_cname
+  printf "%su1.id%s: ", $color_highlite, $color_end
+  p ($arg0).u1.id
+end
+
+define nd_super
+  printf "%su3.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u3.node
+end
+
+
+define nd_modl
+  printf "%su1.id%s: ", $color_highlite, $color_end
+  p ($arg0).u1.id
+end
+
+define nd_clss
+  printf "%su1.value%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.value
+end
+
+
+define nd_beg
+  printf "%su1.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u1.node
+end
+
+define nd_end
+  printf "%su2.node%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.node
+end
+
+define nd_state
+  printf "%su3.state%s: ", $color_highlite, $color_end
+  p ($arg0).u3.state
+end
+
+define nd_rval
+  printf "%su2.value%s: ", $color_highlite, $color_end
+  rp ($arg0).u2.value
+end
+
+
+define nd_nth
+  printf "%su2.argc%s: ", $color_highlite, $color_end
+  p ($arg0).u2.argc
+end
+
+
+define nd_tag
+  printf "%su1.id%s: ", $color_highlite, $color_end
+  p ($arg0).u1.id
+end
+
+define nd_tval
+  printf "%su2.value%s: ", $color_highlite, $color_end
+  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
+
+define rb_numtable_entry
+  set $rb_numtable_tbl = $arg0
+  set $rb_numtable_id = (st_data_t)$arg1
+  set $rb_numtable_key = 0
+  set $rb_numtable_rec = 0
+  if $rb_numtable_tbl->entries_packed
+    set $rb_numtable_p = $rb_numtable_tbl->as.packed.bins
+    while $rb_numtable_p && $rb_numtable_p < $rb_numtable_tbl->as.packed.bins+$rb_numtable_tbl->num_entries
+      if $rb_numtable_p.k == $rb_numtable_id
+        set $rb_numtable_key = $rb_numtable_p.k
+        set $rb_numtable_rec = $rb_numtable_p.v
+        set $rb_numtable_p = 0
+      else
+        set $rb_numtable_p = $rb_numtable_p + 1
+      end
+    end
+  else
+    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
+        set $rb_numtable_rec = $rb_numtable_p->record
+        set $rb_numtable_p = 0
+      else
+        set $rb_numtable_p = $rb_numtable_p->next
+      end
+    end
+  end
+end
+
+define rb_id2name
+  ruby_gdb_init
+  printf "%sID%s: ", $color_type, $color_end
+  rp_id $arg0
+end
+document rb_id2name
+  Print the name of id
+end
+
+define rb_method_entry
+  set $rb_method_entry_klass = (struct RClass *)$arg0
+  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_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 *)RCLASS_SUPER($rb_method_entry_klass)
+    end
+  end
+  if $rb_method_entry_me
+    print *$rb_method_entry_klass
+    print *$rb_method_entry_me
+  else
+    echo method not found\n
+  end
+end
+document rb_method_entry
+  Search method entry by class and id
+end
+
+define rb_classname
+  set $rb_classname = ((struct RClass_and_rb_classext_t*)$arg0)->classext->classpath
+  if $rb_classname != RUBY_Qfalse
+    print_string $rb_classname
+    printf "\n"
+  else
+    echo anonymous class/module\n
+  end
+end
+
+define rb_ancestors
+  set $rb_ancestors_module = $arg0
+  while $rb_ancestors_module
+    rp_class $rb_ancestors_module
+    set $rb_ancestors_module = RCLASS_SUPER($rb_ancestors_module)
+  end
+end
+document rb_ancestors
+  Print ancestors.
+end
+
+define rb_backtrace
+  call rb_backtrace()
+end
+
+define iseq
+  if ruby_dummy_gdb_enums.special_consts
+  end
+  if ($arg0)->type == ISEQ_ELEMENT_NONE
+    echo [none]\n
+  end
+  if ($arg0)->type == ISEQ_ELEMENT_LABEL
+    print *(LABEL*)($arg0)
+  end
+  if ($arg0)->type == ISEQ_ELEMENT_INSN
+    print *(INSN*)($arg0)
+    if ((INSN*)($arg0))->insn_id != YARVINSN_jump
+      set $i = 0
+      set $operand_size = ((INSN*)($arg0))->operand_size
+      set $operands = ((INSN*)($arg0))->operands
+      while $i < $operand_size
+        rp $operands[$i++]
+      end
+    end
+  end
+  if ($arg0)->type == ISEQ_ELEMENT_ADJUST
+    print *(ADJUST*)($arg0)
+  end
+end
+
+define rb_ps
+  rb_ps_vm ruby_current_vm_ptr
+end
+document rb_ps
+Dump all threads and their callstacks
+end
+
+define rb_ps_vm
+  print $ps_vm = (rb_vm_t*)$arg0
+  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 = rb_get_cfp_iseq($cfp)
+  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.next_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) + $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_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->nt
+  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
+      set $iseq = rb_get_cfp_iseq($cfp)
+      if !((VALUE)$iseq & RUBY_IMMEDIATE_MASK) && (((imemo_ifunc << RUBY_FL_USHIFT) | RUBY_T_IMEMO)==$iseq->flags & ((RUBY_IMEMO_MASK << RUBY_FL_USHIFT) | RUBY_T_MASK))
+        printf "%d:ifunc ", $cfpend-$cfp
+        set print symbol-filename on
+        output/a $iseq.body
+        set print symbol-filename off
+        printf "\n"
+      else
+      if $cfp->pc
+        set $location = $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
+
+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://github.com/ruby/ruby/wiki/Machine-Instructions-Trace-with-GDB
+define trace_machine_instructions
+  set logging enabled
+  set height 0
+  set width 0
+  display/i $pc
+  while !$exit_code
+    info line *$pc
+    si
+  end
+end
+
+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.embed.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_PROMOTED    : %s\n", ((struct RBasic*)($arg0))->flags & RUBY_FL_PROMOTED ? "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
+
+source -s misc/gdb.py
+
+# Moved from beginning, since it fails on older gdbs
+set startup-with-shell off
diff --git a/.git-blame-ignore-revs b/.git-blame-ignore-revs
new file mode 100644
index 0000000000..d752612085
--- /dev/null
+++ b/.git-blame-ignore-revs
@@ -0,0 +1,54 @@
+# 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
+c5e9af9c9d890578182a21e7b71b50334cd5579e
+e63a2115f64433b21cb5dd67c5bf8b30f87ef293
+712ac99e4d0384a941c80a9f48f62943ba7d97c0
+d1474affa8e105bece209cc9d594bb0a989859e1
+2da92388b948821269b18d6b178a680f17e41750
+5062c0c621d887367af8a054e5e5d83d7ec57dd3
+
+# Indentation
+0e4bad888e605d424b9222ae0ca43f85c1634e5e
+61aa46c41648c6d1e9b0daa1a292de551fde78df
+
+# 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
+
+# Make prism_compile.c indentation consistent
+40b2c8e5e7e6e5f83cee9276dc9c1922a69292d6
+d2c5867357ed88eccc28c2b3bd4a46e206e7ff85
+
+# Miss-and-revived commits
+a0f7de814ae5c299d6ce99bed5fb308a05d50ba0
+d4e24021d39e1f80f0055b55d91f8d5f22e15084
+7a56c316418980b8a41fcbdc94067b2bda2ad112
+e90282be7ba1bc8e3119f6e1a2c80356ceb3f80a
+26a9e0b4e31f7b5a9cbd755e0a15823a8fa51bae
+2f53985da9ee593fe524d408256835667938c7d7
+bf01f6ae89a95d8f5572e050facfe311c8c28aaf
+7480cd8d37fd71a41ce12b759090051c7e14fb5a
+
+# Win32: EOL code of batch files
+23f9a0d655c4d405bb2397a147a1523436205486
+b839989fd22fef85e2af19de1bc83aa72a5b22bd
+
+# ZJIT cargo-insta snapshot raw string literals
+b78e0a6ddf7df8a7568ea71284f593423c739551
diff --git a/.gitattributes b/.gitattributes
new file mode 100644
index 0000000000..f98c091e3f
--- /dev/null
+++ b/.gitattributes
@@ -0,0 +1,14 @@
+*.gemspec diff=ruby
+*.rb diff=ruby
+*.inc.rs linguist-generated=true
+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
+
+# To strip CR from the batch files, set the `diff.dos.textconv` filter
+# like as `git config diff.dos.textconv $'sed \'s/\r$//\''`.
+*.bat diff=dos
+*.cmd diff=dos
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/actions/capiext/action.yml b/.github/actions/capiext/action.yml
new file mode 100644
index 0000000000..ed69c8ac5e
--- /dev/null
+++ b/.github/actions/capiext/action.yml
@@ -0,0 +1,86 @@
+name: rubyspec C-API extensions
+
+inputs:
+  builddir:
+    required: false
+    default: '.'
+  make:
+    required: false
+    default: 'make -s'
+
+outputs:
+  key:
+    value: >-
+      ${{
+      !steps.restore.outputs.cache-hit &&
+      github.ref == 'refs/heads/master' &&
+      steps.config.outputs.key
+      }}
+
+runs:
+  using: composite
+
+  steps:
+    - id: config
+      shell: bash
+      run: |
+        eval $(grep -e '^arch *=' -e '^ruby_version *=' -e '^DLEXT *=' Makefile |
+            sed 's/ *= */=/')
+        case "${ruby_version}" in
+        *+*) key=capiexts-${arch}-${ruby_version}-${{ hashFiles('src/spec/ruby/optional/capi/ext/*.[ch]') }};;
+        *)   key=;;
+        esac
+        echo version=$ruby_version >> $GITHUB_OUTPUT
+        echo key="$key" >> $GITHUB_OUTPUT
+        echo DLEXT=$DLEXT >> $GITHUB_OUTPUT
+      working-directory: ${{ inputs.builddir }}
+
+    - name: Restore previous CAPI extensions
+      uses: actions/cache/restore@0400d5f644dc74513175e3cd8d07132dd4860809 # v4.2.4
+      id: cache
+      with:
+        path: ${{ inputs.builddir }}/spec/ruby/optional/capi/ext/
+        key: ${{ steps.config.outputs.key }}
+      if: ${{ steps.config.outputs.key }}
+
+    - name: Run test-spec with previous CAPI extension binaries
+      id: check
+      shell: bash
+      run: | # zizmor: ignore[template-injection]
+        touch spec/ruby/optional/capi/ext/*.$DLEXT
+        [ ! -f spec/ruby/optional/capi/ext/\*.$DLEXT ]
+        ${{ inputs.make }} SPECOPTS=optional/capi test-spec
+      env:
+        DLEXT: ${{ steps.config.outputs.DLEXT }}
+      working-directory: ${{ inputs.builddir }}
+      if: ${{ steps.cache.outputs.cache-hit }}
+
+    - name: Strip CAPI extensions
+      id: strip
+      shell: bash
+      run: |
+        rm -f spec/ruby/optional/capi/ext/*.c
+        [ "$DLEXT" = bundle ] || # separated to .dSYM directories
+        strip spec/ruby/optional/capi/ext/*.$DLEXT
+      env:
+        DLEXT: ${{ steps.config.outputs.DLEXT }}
+      working-directory: ${{ inputs.builddir }}
+      if: >-
+        ${{true
+        && ! steps.cache.outputs.cache-hit
+        && github.ref_name == 'master'
+        }}
+
+    - name: Save CAPI extensions
+      uses: actions/cache/save@0400d5f644dc74513175e3cd8d07132dd4860809 # v4.2.4
+      with:
+        path: ${{ inputs.builddir }}/spec/ruby/optional/capi/ext/
+        key: ${{ steps.config.outputs.key }}
+      if: ${{ steps.strip.outcome == 'success' }}
+
+    - shell: bash
+      run: |
+        echo "::error::Change from ${prev} detected; bump up ABI version"
+      env:
+        prev: ${{ steps.config.outputs.version }}
+      if: ${{ always() && steps.check.outcome == 'failure' }}
diff --git a/.github/actions/compilers/action.yml b/.github/actions/compilers/action.yml
new file mode 100644
index 0000000000..c700bbfe9e
--- /dev/null
+++ b/.github/actions/compilers/action.yml
@@ -0,0 +1,164 @@
+name: Compiles ruby in a container
+description: >-
+  Makes ruby using a dedicated container
+
+inputs:
+  tag:
+    required: false
+    default: clang-20
+    description: >-
+      container image tag to use in this run.
+
+  with_gcc:
+    required: false
+    description: >-
+      override compiler path & flags.
+
+  CFLAGS:
+    required: false
+    description: >-
+      C compiler flags to override.
+
+  CXXFLAGS:
+    required: false
+    description: >-
+      C++ compiler flags to override.
+
+  optflags:
+    required: false
+    # -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.
+    default: '-O1'
+    description: >-
+      Compiler flags for optimisations.
+
+  cppflags:
+    required: false
+    description: >-
+      Additional preprocessor flags.
+
+  append_configure:
+    required: false
+    default: >-
+      --without-valgrind
+      --without-jemalloc
+      --without-gmp
+    description: >-
+      flags to append to configure.
+
+  enable_shared:
+    required: false
+    default: true
+    description: >-
+      Whether to build libruby.so.
+
+  check:
+    required: false
+    default: ''
+    description: >-
+      Whether to run `make check`
+
+  test_all:
+    required: false
+    default: ''
+    description: >-
+      Whether to run `make test-all` with options for test-all.
+
+  test_spec:
+    required: false
+    default: ''
+    description: >-
+      Whether to run `make test-spec` with options for mspec.
+
+  static_exts:
+    required: false
+    description: >-
+      whitespace separated list of extensions that need be linked statically.
+
+runs:
+  using: composite
+  steps:
+    - shell: bash
+      run: docker pull --quiet "ghcr.io/ruby/ruby-ci-image:${INPUT_TAG}"
+      env:
+        INPUT_TAG: ${{ inputs.tag }}
+
+    - name: Enable Launchable conditionally
+      id: enable-launchable
+      run: echo "enable-launchable=true" >> $GITHUB_OUTPUT
+      shell: bash
+      if: >-
+        ${{
+        github.repository == 'ruby/ruby' ||
+        (github.repository != 'ruby/ruby' && env.LAUNCHABLE_TOKEN)
+        }}
+
+    - name: compile
+      shell: bash
+      run: >-
+        docker run
+        --rm
+        --user=root
+        --volume "${GITHUB_WORKSPACE}:/github/workspace:ro"
+        --workdir=/github/workspace
+        --entrypoint=/github/workspace/.github/actions/compilers/entrypoint.sh
+        --env CI
+        --env GITHUB_ACTION
+        --env INPUT_WITH_GCC
+        --env INPUT_CFLAGS
+        --env INPUT_CXXFLAGS
+        --env INPUT_OPTFLAGS
+        --env INPUT_CPPFLAGS
+        --env INPUT_APPEND_CONFIGURE
+        --env INPUT_CHECK
+        --env INPUT_TEST_ALL
+        --env INPUT_TEST_SPEC
+        --env INPUT_ENABLE_SHARED
+        --env INPUT_STATIC_EXTS
+        --env LAUNCHABLE_ORGANIZATION
+        --env LAUNCHABLE_WORKSPACE
+        --env LAUNCHABLE_ENABLED
+        --env GITHUB_PR_HEAD_SHA
+        --env GITHUB_PULL_REQUEST_URL
+        --env GITHUB_REF
+        --env GITHUB_ACTIONS
+        --env GITHUB_RUN_ID
+        --env GITHUB_REPOSITORY
+        --env GITHUB_WORKFLOW
+        --env GITHUB_RUN_NUMBER
+        --env GITHUB_EVENT_NAME
+        --env GITHUB_SHA
+        --env GITHUB_HEAD_REF
+        --env GITHUB_SERVER_URL
+        "ghcr.io/ruby/ruby-ci-image:${INPUT_TAG}"
+      env:
+        INPUT_TAG: ${{ inputs.tag }}
+        INPUT_WITH_GCC: ${{ inputs.with_gcc || inputs.tag }}
+        INPUT_CFLAGS: ${{ inputs.CFLAGS }}
+        INPUT_CXXFLAGS: ${{ inputs.CXXFLAGS }}
+        INPUT_OPTFLAGS: ${{ inputs.OPTFLAGS }}
+        INPUT_CPPFLAGS: ${{ inputs.cppflags }}
+        INPUT_APPEND_CONFIGURE: ${{ inputs.append_configure }}
+        INPUT_CHECK: ${{ inputs.check }}
+        INPUT_TEST_ALL: ${{ inputs.test_all }}
+        INPUT_TEST_SPEC: ${{ inputs.test_spec }}
+        INPUT_ENABLE_SHARED: ${{ inputs.enable_shared }}
+        INPUT_STATIC_EXTS: ${{ inputs.static_exts }}
+        LAUNCHABLE_ORGANIZATION: ${{ github.repository_owner }}
+        LAUNCHABLE_WORKSPACE: ${{ github.event.repository.name }}
+        LAUNCHABLE_ENABLED: ${{ steps.enable-launchable.outputs.enable-launchable || false }}
+        GITHUB_PR_HEAD_SHA: ${{ github.event.pull_request.head.sha || github.sha }}
+        GITHUB_PULL_REQUEST_URL: ${{ github.event.pull_request.html_url }}
+        GITHUB_REF: ${{ github.ref }}
+
+    # Clean up non-default docker images to save disk space.
+    # The default image (clang-20) is reused across multiple steps
+    # within the same job, so we keep it to avoid redundant pulls.
+    - name: clean up docker image
+      shell: bash
+      run: docker rmi "ghcr.io/ruby/ruby-ci-image:${INPUT_TAG}" || true
+      if: ${{ always() && inputs.tag != 'clang-20' }}
+      env:
+        INPUT_TAG: ${{ inputs.tag }}
diff --git a/.github/actions/compilers/entrypoint.sh b/.github/actions/compilers/entrypoint.sh
new file mode 100755
index 0000000000..b554151091
--- /dev/null
+++ b/.github/actions/compilers/entrypoint.sh
@@ -0,0 +1,90 @@
+#! /bin/bash
+
+# Copyright (c) 2024 Ruby developers.  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.
+
+grouped()
+{
+    echo "::group::${@}"
+    "${@}"
+    echo "::endgroup::"
+}
+
+set -e
+set -u
+set -o pipefail
+
+srcdir="/github/workspace/src"
+builddir="$(mktemp -dt)"
+
+export GITHUB_WORKFLOW='Compilations'
+export CONFIGURE_TTY='never'
+export RUBY_DEBUG='ci rgengc'
+export RUBY_TESTOPTS='-q --color=always --tty=no'
+export RUBY_DEBUG_COUNTER_DISABLE='1'
+export GNUMAKEFLAGS="-j$((1 + $(nproc)))"
+
+case "x${INPUT_ENABLE_SHARED}" in
+x | xno | xfalse )
+    enable_shared='--disable-shared'
+    ;;
+*)
+    enable_shared='--enable-shared'
+    ;;
+esac
+
+pushd ${builddir}
+
+grouped git config --global --add safe.directory ${srcdir}
+
+grouped ${srcdir}/configure        \
+    -C                             \
+    --with-gcc="${INPUT_WITH_GCC}" \
+    --enable-debug-env             \
+    --disable-install-doc          \
+    --with-ext=-test-/cxxanyargs,+ \
+    --without-git                  \
+    ${enable_shared}               \
+    ${INPUT_APPEND_CONFIGURE}      \
+    CFLAGS="${INPUT_CFLAGS}"       \
+    CXXFLAGS="${INPUT_CXXFLAGS}"   \
+    optflags="${INPUT_OPTFLAGS}"   \
+    cppflags="${INPUT_CPPFLAGS}"   \
+    debugflags='-ggdb3' # -g0 disables backtraces when SEGV.  Do not set that.
+
+popd
+
+if [[ -n "${INPUT_STATIC_EXTS}" ]]; then
+    echo "::group::ext/Setup"
+    set -x
+    mkdir ${builddir}/ext
+    (
+        for ext in ${INPUT_STATIC_EXTS}; do
+            echo "${ext}"
+        done
+    ) >> ${builddir}/ext/Setup
+    set +x
+    echo "::endgroup::"
+fi
+
+if [ -n "$INPUT_TEST_ALL" ]; then
+  tests=" -- $INPUT_TEST_ALL"
+else
+  tests=" -- ruby -ext-"
+fi
+
+pushd ${builddir}
+
+grouped make showflags
+grouped make all
+# grouped make install
+
+# Run only `make test` by default. Run other tests if specified.
+grouped make test
+if [[ -n "$INPUT_CHECK" ]]; then grouped make test-tool; fi
+if [[ -n "$INPUT_CHECK" || -n "$INPUT_TEST_ALL" ]]; then grouped make test-all TESTS="$tests"; fi
+if [[ -n "$INPUT_CHECK" || -n "$INPUT_TEST_SPEC" ]]; then grouped env CHECK_LEAKS=true make test-spec MSPECOPT="$INPUT_TEST_SPEC"; fi
diff --git a/.github/actions/launchable/setup/action.yml b/.github/actions/launchable/setup/action.yml
new file mode 100644
index 0000000000..305878492c
--- /dev/null
+++ b/.github/actions/launchable/setup/action.yml
@@ -0,0 +1,337 @@
+name: Set up Launchable
+description: >-
+  Install the required dependencies and execute the necessary Launchable commands for test recording
+
+inputs:
+  os:
+    required: true
+    description: The operating system that CI runs on. This value is used in Launchable flavor.
+
+  test-opts:
+    default: none
+    required: false
+    description: >-
+      Test options that determine how tests are run.
+      This value is used in the Launchable flavor.
+
+  launchable-token:
+    required: false
+    description: >-
+      Launchable token is needed if you want to run Launchable on your forked repository.
+      See https://github.com/ruby/ruby/wiki/CI-Servers#launchable-ci for details.
+
+  builddir:
+    required: false
+    default: ${{ github.workspace }}
+    description: >-
+      Directory to create Launchable report file.
+
+  srcdir:
+    required: false
+    default: ${{ github.workspace }}
+    description: >-
+      Directory to (re-)checkout source codes. Launchable retrieves the commit information
+      from the directory.
+
+  test-task:
+    required: false
+    default: ${{ matrix.test_task }}
+    description: >-
+      Specifies a single test task to be executed.
+      This value is used in the Launchable flavor.
+      Either 'test-task' or 'multi-test-tasks' must be configured.
+
+  test-tasks:
+    required: false
+    default: '[]'
+    description: >-
+      Specifies an array of multiple test tasks to be executed.
+      For example: '["test", "test-all"]'.
+      If you want to run a single test task, use the 'test-task' input instead.
+
+  is-yjit:
+    required: false
+    default: 'false'
+    description: >-
+      Whether this workflow is executed on YJIT.
+
+  is-zjit:
+    required: false
+    default: 'false'
+    description: >-
+      Whether this workflow is executed on ZJIT.
+
+outputs:
+  stdout_report_path:
+    value: ${{ steps.global.outputs.stdout_report_path }}
+    description: >-
+      Report file path for standard output.
+
+  stderr_report_path:
+    value: ${{ steps.global.outputs.stderr_report_path }}
+    description: >-
+      Report file path for standard error.
+
+runs:
+  using: composite
+
+  steps:
+    - name: Enable Launchable conditionally
+      id: enable-launchable
+      run: echo "enable-launchable=true" >> $GITHUB_OUTPUT
+      shell: bash
+      if: >-
+        ${{
+        (github.repository == 'ruby/ruby'
+          || (github.repository != 'ruby/ruby'
+          && env.LAUNCHABLE_TOKEN))
+        && (inputs.test-task == 'check'
+          || inputs.test-task == 'test-all'
+          || inputs.test-task == 'test'
+          || contains(fromJSON(inputs.test-tasks), 'test-all')
+          || contains(fromJSON(inputs.test-tasks), 'test'))
+        }}
+
+    # Launchable CLI requires Python and Java.
+    # https://www.launchableinc.com/docs/resources/cli-reference/
+    - name: Set up Python
+      uses: actions/setup-python@a26af69be951a213d495a4c3e4e4022e16d87065 # v5.6.0
+      with:
+        python-version: "3.x"
+      if: >-
+        ${{ steps.enable-launchable.outputs.enable-launchable
+        && !endsWith(inputs.os, 'ppc64le') && !endsWith(inputs.os, 's390x') }}
+
+    - name: Set up Java
+      uses: actions/setup-java@c1e323688fd81a25caa38c78aa6df2d33d3e20d9 # v4.8.0
+      with:
+        distribution: 'temurin'
+        java-version: '17'
+      if: >-
+        ${{ steps.enable-launchable.outputs.enable-launchable
+        && !endsWith(inputs.os, 'ppc64le') && !endsWith(inputs.os, 's390x') }}
+
+    - name: Set up Java ppc64le
+      uses: actions/setup-java@c1e323688fd81a25caa38c78aa6df2d33d3e20d9 # v4.8.0
+      with:
+        distribution: 'semeru'
+        architecture: 'ppc64le'
+        java-version: '17'
+      if: >-
+        ${{ steps.enable-launchable.outputs.enable-launchable
+        && endsWith(inputs.os, 'ppc64le') }}
+
+    - name: Set up Java s390x
+      uses: actions/setup-java@c1e323688fd81a25caa38c78aa6df2d33d3e20d9 # v4.8.0
+      with:
+        distribution: 'semeru'
+        architecture: 's390x'
+        java-version: '17'
+      if: >-
+        ${{ steps.enable-launchable.outputs.enable-launchable
+        && endsWith(inputs.os, 's390x') }}
+
+    - name: Set global vars
+      id: global
+      shell: bash
+      run: |
+        test_all_enabled="${{ inputs.test-task == 'check' ||  inputs.test-task == 'test-all' || contains(fromJSON(inputs.test-tasks), 'test-all') }}"
+        btest_enabled="${{ inputs.test-task == 'check' ||  inputs.test-task == 'test' || contains(fromJSON(inputs.test-tasks), 'test') }}"
+        test_spec_enabled="${{ inputs.test-task == 'check' ||  inputs.test-task == 'test-spec' || contains(fromJSON(inputs.test-tasks), 'test-spec') }}"
+        echo test_all_enabled="${test_all_enabled}" >> $GITHUB_OUTPUT
+        echo btest_enabled="${btest_enabled}" >> $GITHUB_OUTPUT
+        echo test_spec_enabled="${test_spec_enabled}" >> $GITHUB_OUTPUT
+        echo test_all_report_file='launchable_test_all_report.json' >> $GITHUB_OUTPUT
+        echo btest_report_file='launchable_btest_report.json' >> $GITHUB_OUTPUT
+        echo test_spec_report_dir='launchable_test_spec_report' >> $GITHUB_OUTPUT
+        echo stdout_report_path="launchable_stdout.log" >> $GITHUB_OUTPUT
+        echo stderr_report_path="launchable_stderr.log" >> $GITHUB_OUTPUT
+      if: steps.enable-launchable.outputs.enable-launchable
+
+    - name: Set environment variables for Launchable
+      shell: bash
+      run: | # zizmor: ignore[github-env]
+        : # GITHUB_PULL_REQUEST_URL are used for commenting test reports in Launchable Github App.
+        : # https://github.com/launchableinc/cli/blob/v1.80.1/launchable/utils/link.py#L42
+        echo "GITHUB_PULL_REQUEST_URL=${INPUT_PR_HTML_URL}" >> $GITHUB_ENV
+        : # The following envs are necessary in Launchable tokenless authentication.
+        : # https://github.com/launchableinc/cli/blob/v1.80.1/launchable/utils/authentication.py#L20
+        echo "LAUNCHABLE_ORGANIZATION=${INPUT_REPOSITORY_OWNER}" >> $GITHUB_ENV
+        echo "LAUNCHABLE_WORKSPACE=${INPUT_REPOSITORY_NAME}" >> $GITHUB_ENV
+        : # https://github.com/launchableinc/cli/blob/v1.80.1/launchable/utils/authentication.py#L71
+        echo "GITHUB_PR_HEAD_SHA=${INPUT_PR_HEAD_SHA}" >> $GITHUB_ENV
+        echo "LAUNCHABLE_TOKEN=${INPUT_LAUNCHABLE_TOKEN}" >> $GITHUB_ENV
+        : # To prevent a slowdown in CI, disable request retries when the Launchable server is unstable.
+        echo "LAUNCHABLE_SKIP_TIMEOUT_RETRY=1" >> $GITHUB_ENV
+        echo "LAUNCHABLE_COMMIT_TIMEOUT=1" >> $GITHUB_ENV
+      env:
+        INPUT_PR_HTML_URL: ${{ github.event.pull_request.html_url }}
+        INPUT_REPOSITORY_OWNER: ${{ github.repository_owner }}
+        INPUT_REPOSITORY_NAME: ${{ github.event.repository.name }}
+        INPUT_PR_HEAD_SHA: ${{ github.event.pull_request.head.sha || github.sha }}
+        INPUT_LAUNCHABLE_TOKEN: ${{ inputs.launchable-token }}
+      if: steps.enable-launchable.outputs.enable-launchable
+
+    - name: Set up path
+      shell: bash
+      working-directory: ${{ inputs.srcdir }}
+      # Since updated PATH variable will be available in only subsequent actions, we need to add the path beforehand.
+      # https://docs.github.com/en/actions/using-workflows/workflow-commands-for-github-actions#adding-a-system-path
+      run: echo "$(python -msite --user-base)/bin" >> $GITHUB_PATH # zizmor: ignore[github-env]
+      if: >-
+        ${{
+        steps.enable-launchable.outputs.enable-launchable
+        && (startsWith(inputs.os, 'macos')
+          || endsWith(inputs.os, 'ppc64le')
+          || endsWith(inputs.os, 's390x'))
+        }}
+
+    - name: Set up Launchable
+      id: setup-launchable
+      shell: bash
+      working-directory: ${{ inputs.srcdir }}
+      run: | # zizmor: ignore[github-env]
+        set -x
+        pip install --user launchable
+        : # The build name cannot include a slash, so we replace the string here.
+        github_ref="${INPUT_GITHUB_REF}"
+        github_ref="${github_ref//\//_}"
+        : # With the --name option, we need to configure a unique identifier for this build.
+        : # To avoid setting the same build name as the CI which runs on other branches, we use the branch name here.
+        build_name="${github_ref}_${GITHUB_PR_HEAD_SHA}"
+        test_opts="${INPUT_TEST_OPTS}"
+        test_opts="${test_opts// /}"
+        test_opts="${test_opts//=/:}"
+        test_all_test_suite='test-all'
+        btest_test_suite='btest'
+        test_spec_test_suite='test-spec'
+        if [ "${INPUT_IS_YJIT}" = "true" ]; then
+          test_all_test_suite="yjit-${test_all_test_suite}"
+          btest_test_suite="yjit-${btest_test_suite}"
+          test_spec_test_suite="yjit-${test_spec_test_suite}"
+        fi
+        if [ "${INPUT_IS_ZJIT}" = "true" ]; then
+          test_all_test_suite="zjit-${test_all_test_suite}"
+          btest_test_suite="zjit-${btest_test_suite}"
+          test_spec_test_suite="zjit-${test_spec_test_suite}"
+        fi
+        # launchable_setup target var -- refers ${target} prefixed variables
+        launchable_setup() {
+          local target=$1 session
+          eval [ "\${${target}_enabled}" = "true" ] || return
+          eval local suite=\${${target}_test_suite}
+          session=$(launchable record session \
+            --build "${build_name}" \
+            --observation \
+            --flavor os="${INPUT_OS}" \
+            --flavor test_task="${INPUT_TEST_TASK}" \
+            --flavor test_opts="${test_opts}" \
+            --flavor workflow="${INPUT_WORKFLOW}" \
+            --test-suite ${suite} \
+            )
+          echo "${target}_session=${session}" >> $GITHUB_OUTPUT
+        }
+
+        launchable record build --name "${build_name}"
+        if launchable_setup test_all; then
+          echo "TESTS=${TESTS:+$TESTS }--launchable-test-reports=${test_all_report_file}" >> $GITHUB_ENV
+        fi
+        if launchable_setup btest; then
+          echo "BTESTS=${BTESTS:+$BTESTS }--launchable-test-reports=${btest_report_file}" >> $GITHUB_ENV
+        fi
+        if launchable_setup test_spec; then
+          echo "SPECOPTS=${SPECOPTS:$SPECOPTS }--launchable-test-reports=${test_spec_report_dir}" >> $GITHUB_ENV
+          echo test_spec_enabled=true >> $GITHUB_OUTPUT
+        fi
+
+        echo launchable_setup_dir=$(pwd) >> $GITHUB_OUTPUT
+      if: steps.enable-launchable.outputs.enable-launchable
+      env:
+        INPUT_GITHUB_REF: ${{ github.ref }}
+        INPUT_TEST_OPTS: ${{ inputs.test-opts }}
+        INPUT_IS_YJIT: ${{ inputs.is-yjit }}
+        INPUT_IS_ZJIT: ${{ inputs.is-zjit }}
+        INPUT_OS: ${{ inputs.os }}
+        INPUT_TEST_TASK: ${{ inputs.test-task }}
+        INPUT_WORKFLOW: ${{ github.workflow }}
+        test_all_enabled: ${{ steps.global.outputs.test_all_enabled }}
+        btest_enabled: ${{ steps.global.outputs.btest_enabled }}
+        test_spec_enabled: ${{ steps.global.outputs.test_spec_enabled }}
+        test_all_report_file: ${{ steps.global.outputs.test_all_report_file }}
+        btest_report_file: ${{ steps.global.outputs.btest_report_file }}
+        test_spec_report_dir: ${{ steps.global.outputs.test_spec_report_dir }}
+
+    - name: make test-spec report directory in build directory
+      shell: bash
+      working-directory: ${{ inputs.builddir }}
+      run: mkdir "${test_spec_report_dir}"
+      if: ${{ steps.setup-launchable.outputs.test_spec_enabled == 'true' }}
+      env:
+        test_spec_report_dir: ${{ steps.global.outputs.test_spec_report_dir }}
+
+    - name: Clean up test results in Launchable
+      uses: gacts/run-and-post-run@81b6ce503cde93862cec047c54652e45c5dca991 # v1.4.3
+      with:
+        shell: bash
+        working-directory: ${{ inputs.builddir }}
+        post: |
+          rm -f "${test_all_report_file}"
+          rm -f "${btest_report_file}"
+          rm -fr "${test_spec_report_dir}"
+          rm -f launchable_stdout.log
+          rm -f launchable_stderr.log
+      if: always() && steps.setup-launchable.outcome == 'success'
+      env:
+        test_all_report_file: ${{ steps.global.outputs.test_all_report_file }}
+        btest_report_file: ${{ steps.global.outputs.btest_report_file }}
+        test_spec_report_dir: ${{ steps.global.outputs.test_spec_report_dir }}
+
+    - name: Record test results in Launchable
+      uses: gacts/run-and-post-run@81b6ce503cde93862cec047c54652e45c5dca991 # v1.4.3
+      with:
+        shell: bash
+        working-directory: ${{ inputs.builddir }}
+        post: |
+          if [[ "${test_all_enabled}" = "true" ]]; then \
+            launchable record attachment \
+              --session "${test_all_session}" \
+              "${stdout_report_path}" \
+              "${stderr_report_path}"; \
+            launchable record tests \
+              --session "${test_all_session}" \
+              raw "${test_all_report_file}" || true; \
+          fi
+
+          if [[ "${btest_enabled}" = "true" ]]; then \
+            launchable record attachment \
+              --session "${btest_session}" \
+              "${stdout_report_path}" \
+              "${stderr_report_path}"; \
+            launchable record tests \
+              --session "${btest_session}" \
+              raw "${btest_report_file}" || true; \
+          fi
+
+          if [[ "${test_spec_enabled}" = "true" ]]; then \
+            launchable record attachment \
+              --session "${test_spec_session}" \
+              "${stdout_report_path}" \
+              "${stderr_report_path}"; \
+            launchable record tests \
+              --session "${test_spec_session}" \
+              raw ${test_spec_report_dir}/* || true; \
+          fi
+      if: ${{ always() && steps.setup-launchable.outcome == 'success' }}
+      env:
+        test_all_report_file: ${{ steps.global.outputs.test_all_report_file }}
+        btest_report_file: ${{ steps.global.outputs.btest_report_file }}
+        test_spec_report_dir: ${{ steps.global.outputs.test_spec_report_dir }}
+        test_all_enabled: ${{ steps.global.outputs.test_all_enabled }}
+        btest_enabled: ${{ steps.global.outputs.btest_enabled }}
+        test_spec_enabled: ${{ steps.global.outputs.test_spec_enabled }}
+        test_all_session: ${{ steps.setup-launchable.outputs.test_all_session }}
+        btest_session: ${{ steps.setup-launchable.outputs.btest_session }}
+        test_spec_session: ${{ steps.setup-launchable.outputs.test_spec_session }}
+        stdout_report_path: ${{ steps.global.outputs.stdout_report_path }}
+        stderr_report_path: ${{ steps.global.outputs.stderr_report_path }}
+        LAUNCHABLE_SETUP_DIR: ${{ steps.setup-launchable.outputs.launchable_setup_dir }}
diff --git a/.github/actions/make-snapshot/action.yml b/.github/actions/make-snapshot/action.yml
new file mode 100644
index 0000000000..4552f0e067
--- /dev/null
+++ b/.github/actions/make-snapshot/action.yml
@@ -0,0 +1,77 @@
+name: 'make-snapshot'
+description: 'Make snapshot tarballs'
+inputs:
+  archname:
+    description: 'archname passed to tool/make-snapshot (e.g. snapshot-master)'
+    required: true
+  version:
+    description: 'Target Version'
+    required: false
+  shallow-since:
+    description: 'git fetch --shallow-since'
+    required: true
+    default: '2018-12-25 00:00:00'
+  fetch-branch:
+    description: 'fetch branch'
+    required: false
+  srcdir:
+    description: 'srcdir for tool/make-snapshot. Empty = clone ruby/ruby into ./ruby.'
+    required: false
+    default: ''
+  upload-artifact:
+    description: 'Upload Packages and Info as workflow artifacts. Pass "false" when callers run in a matrix that would collide on artifact names.'
+    required: false
+    default: 'true'
+
+runs:
+  using: "composite"
+  steps:
+    - name: Install libraries
+      run: |
+        set -x
+        sudo apt-get update -q || :
+        sudo apt-get install --no-install-recommends -q -y build-essential git bison autoconf ruby p7zip-full curl
+      shell: bash
+    - name: Checkout ruby/ruby for tool/make-snapshot
+      if: inputs.srcdir == ''
+      run: git clone --single-branch --depth=1 https://github.com/ruby/ruby ruby
+      shell: bash
+    - name: Fetch branches and notes (clone mode)
+      if: inputs.srcdir == ''
+      env:
+        SHALLOW_SINCE: ${{ inputs.shallow-since }}
+        FETCH_BRANCH: ${{ inputs.fetch-branch }}
+      run: |
+        set -x
+        cd ruby
+        git fetch --shallow-since="$SHALLOW_SINCE"
+        [ -n "$FETCH_BRANCH" ] && git fetch origin "+$FETCH_BRANCH:$FETCH_BRANCH"
+        git fetch origin '+refs/notes/commits:refs/notes/commits'
+        git fetch origin '+refs/notes/log-fix:refs/notes/log-fix'
+      shell: bash
+    - name: Fetch notes (local srcdir mode)
+      if: inputs.srcdir != ''
+      working-directory: ${{ inputs.srcdir }}
+      run: |
+        git fetch origin '+refs/notes/commits:refs/notes/commits' || :
+        git fetch origin '+refs/notes/log-fix:refs/notes/log-fix' || :
+      shell: bash
+    - name: Make snapshot
+      env:
+        ARCHNAME: ${{ inputs.archname }}
+        SRCDIR: ${{ inputs.srcdir }}
+        VERSION: ${{ inputs.version }}
+      run: |
+        [ -z "$SRCDIR" ] && SRCDIR=ruby
+        ruby "$SRCDIR/tool/make-snapshot" "-archname=$ARCHNAME" -srcdir="$SRCDIR" -packages=gzip,xz,zip pkg $VERSION
+      shell: bash
+    - uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+      with:
+        name: Packages
+        path: pkg
+      if: ${{ inputs.upload-artifact == 'true' }}
+    - uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+      with:
+        name: Info
+        path: pkg/info
+      if: ${{ inputs.upload-artifact == 'true' }}
diff --git a/.github/actions/setup/baseruby/action.yml b/.github/actions/setup/baseruby/action.yml
new file mode 100644
index 0000000000..76fe068897
--- /dev/null
+++ b/.github/actions/setup/baseruby/action.yml
@@ -0,0 +1,73 @@
+name: Setup directories etc.
+description: >-
+  Build baseruby for cross-compiling
+
+inputs:
+  srcdir:
+    required: true
+    default: ${{ github.workspace }}
+    description: >-
+      Directory of source codes.
+
+  builddir:
+    required: false
+    default: ${{ github.workspace }}/baseruby
+    description: >-
+      Where baseruby will be built.
+
+  installdir:
+    required: false
+    default: install
+    description: >-
+      The path where the baseruby will be installed to.
+      This is relative from the workspace.
+
+outputs:
+  ruby:
+    value: ${{ steps.build.outputs.installdir }}/bin/ruby
+    description: >-
+      The path of the executable baseruby.
+  dump_ast:
+    value: ${{ steps.build.outputs.installdir }}/bin/dump_ast
+    description: >-
+      The path of the executable dump_ast.
+
+runs:
+  using: composite
+
+  steps:
+    - name: Build baseruby
+      shell: bash
+      id: build
+      run: |
+        case "$installdir" in /*) ;; *) installdir="$PWD/$installdir";; esac
+        mkdir "$builddir"
+        ln -sr "$srcdir" "$builddir/.src"
+        pushd "$builddir"
+        .src/configure "--prefix=${installdir}" --disable-install-doc
+        CONFIGURE_ARGS=--with-out-ext=-test- make install
+        install dump_ast "${installdir}/bin"
+        {
+          echo "${installdir}/bin/dump_ast"
+          echo "${installdir}/.installed.list"
+          echo "${installdir}/"
+        } >> .installed.list
+        cp .installed.list "${installdir}/"
+        make distclean
+        rm .src
+        popd
+        rmdir "$builddir"
+        {
+          echo "installdir=${installdir}"
+        } | tee -a "$GITHUB_OUTPUT"
+      env:
+        srcdir: ${{ inputs.srcdir }}
+        builddir: ${{ inputs.builddir }}
+        installdir: ${{ inputs.installdir }}
+
+    - name: clean
+      uses: gacts/run-and-post-run@598d7a875d5620e0457490555b5e18e46082aa47 # v1.4.4
+      with:
+        working-directory: ${{ inputs.srcdir }}
+        post: |
+          ruby tool/rbuninstall.rb "${{ steps.build.outputs.installdir }}/.installed.list" > /dev/null
diff --git a/.github/actions/setup/directories/action.yml b/.github/actions/setup/directories/action.yml
new file mode 100644
index 0000000000..15dc097b6e
--- /dev/null
+++ b/.github/actions/setup/directories/action.yml
@@ -0,0 +1,205 @@
+name: Setup directories etc.
+description: >-
+  Set up the source code and build directories (plus some
+  environmental tweaks)
+
+inputs:
+  srcdir:
+    required: false
+    default: ${{ github.workspace }}
+    description: >-
+      Directory to (re-)checkout source codes.  This will be created
+      if absent.  If there is no `configure` file that is also
+      generated inside.
+
+  builddir:
+    required: false
+    default: ${{ github.workspace }}
+    description: >-
+      Where binaries and other generated contents go.  This will be
+      created if absent.
+
+  make-command:
+    required: false
+    type: string
+    default: 'make'
+    description: >-
+      The command of `make`.
+
+  makeup:
+    required: false
+    type: boolean
+    # Note that `default: false` evaluates to a string constant
+    # `'false'`, which is a truthy value :sigh:
+    # https://github.com/actions/runner/issues/2238
+    default: ''
+    description: >-
+      If set to true, additionally runs `make up`.
+
+  checkout:
+    required: false
+    type: boolean
+    default: true
+    description: >-
+      If set to '' (false), skip running actions/checkout. This is useful when
+      you don't want to overwrite a GitHub token that is already set up.
+
+  dummy-files:
+    required: false
+    type: boolean
+    default: ''
+    description: >-
+      If set to true, creates dummy files in build dir.
+
+  fetch-depth:
+    required: false
+    default: '1'
+    description: The depth of commit history fetched from the remote repository
+
+  clean:
+    required: false
+    type: boolean
+    default: ''
+    description: >-
+      If set to true, clean build directory.
+
+outputs: {} # nothing?
+
+runs:
+  using: composite
+
+  steps:
+    # Note that `shell: bash` works on both Windows and Linux, but not
+    # `shell: sh`.  This is because GitHub hosted Windows runners have
+    # their bash manually installed.
+    - shell: bash
+      run: |
+        mkdir -p "${INPUT_SRCDIR}"
+        mkdir -p "${INPUT_BUILDDIR}"
+      env:
+        INPUT_SRCDIR: ${{ inputs.srcdir }}
+        INPUT_BUILDDIR: ${{ inputs.builddir }}
+
+    # Did you know that actions/checkout works without git(1)?  We are
+    # checking that here.
+    - id: which
+      shell: bash
+      run: |
+        echo "git=`command -v git`" >> "$GITHUB_OUTPUT"
+        echo "sudo=`sudo true && command -v sudo`" >> "$GITHUB_OUTPUT"
+        echo "autoreconf=`command -v autoreconf`" >> "$GITHUB_OUTPUT"
+
+    - if: steps.which.outputs.git
+      shell: bash
+      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
+
+    - if: inputs.checkout
+      uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+      with:
+        path: ${{ inputs.srcdir }}
+        fetch-depth: ${{ inputs.fetch-depth }}
+        persist-credentials: false
+
+    - uses: actions/cache@27d5ce7f107fe9357f9df03efb73ab90386fccae # v5.0.5
+      with:
+        path: ${{ inputs.srcdir }}/.downloaded-cache
+        key: ${{ runner.os }}-${{ runner.arch }}-downloaded-cache
+
+    - if: steps.which.outputs.autoreconf
+      shell: bash
+      working-directory: ${{ inputs.srcdir }}
+      run: ./autogen.sh --install
+
+    # This is for MinGW.
+    - if: runner.os == 'Windows'
+      shell: bash
+      run: echo "GNUMAKEFLAGS=-j$((2 * NUMBER_OF_PROCESSORS))" >> $GITHUB_ENV # zizmor: ignore[github-env]
+
+    - if: runner.os == 'Linux'
+      shell: bash
+      run: echo "GNUMAKEFLAGS=-sj$((1 + $(nproc)))" >> "$GITHUB_ENV" # zizmor: ignore[github-env]
+
+    # macOS' GNU make is so old that they doesn't understand `GNUMAKEFLAGS`.
+    - if: runner.os == 'macOS'
+      shell: bash
+      run: echo "MAKEFLAGS=-j$((1 + $(sysctl -n hw.activecpu)))" >> "$GITHUB_ENV" # zizmor: ignore[github-env]
+
+    - if: inputs.makeup
+      shell: bash
+      working-directory: ${{ inputs.srcdir }}
+      run: |
+        touch config.status .rbconfig.time
+        for mk in Makefile GNUmakefile; do
+          sed -f tool/prereq.status template/$mk.in > $mk
+        done
+        make up
+
+    # Cleanup, runs even on failure
+    - if: always() && inputs.makeup
+      shell: bash
+      working-directory: ${{ inputs.srcdir }}
+      run: |
+        rm -f config.status .rbconfig.time \
+          Makefile GNUmakefile uncommon.mk enc.mk noarch-fake.rb
+        rm -f prism/.time prism/util/.time
+
+    - if: steps.which.outputs.sudo
+      shell: bash
+      run: |
+        sudo chmod -R go-w /usr/share
+        chmod -v go-w $HOME $HOME/.config || :
+        declare -a dirs # -A is not supported by old bash, e.g. macos
+        SAVE_IFS="$IFS" IFS=:; set $PATH
+        for d do
+          while [ -d "$d" ]; do
+            case "$IFS${dirs[*]}$IFS" in *"$IFS$d$IFS"*) ;; *) dirs+=("$d");; esac
+            d="${d%/*}"
+          done
+        done
+        IFS="$SAVE_IFS"
+        sudo chmod -v go-w "${dirs[@]}" || :
+
+    - if: inputs.dummy-files == 'true'
+      shell: bash
+      id: dummy-files
+      working-directory: ${{ inputs.builddir }}
+      run: |
+        : Create dummy files in build dir
+        set {{a..z},{A..Z},{0..9},foo,bar,test,zzz}.rb
+        for file; do \
+          echo > $file "raise 'do not load $file'"; \
+        done
+        # drop {a..z}.rb if case-insensitive filesystem
+        grep -F A.rb a.rb > /dev/null && set "${@:27}"
+        echo clean="cd ${INPUT_BUILDDIR} && rm $*" >> $GITHUB_OUTPUT
+      env:
+        INPUT_BUILDDIR: ${{ inputs.builddir }}
+
+    - if: inputs.clean == 'true'
+      shell: bash
+      id: clean
+      run: |
+        echo distclean="cd ${INPUT_BUILDDIR} && ${INPUT_MAKE_COMMAND} distclean" >> $GITHUB_OUTPUT
+        echo remained-files="find ${INPUT_BUILDDIR} -ls" >> $GITHUB_OUTPUT
+        [ "${INPUT_BUILDDIR}" = "${INPUT_SRCDIR}" ] ||
+        echo final="rmdir ${INPUT_BUILDDIR}" >> $GITHUB_OUTPUT
+      env:
+        INPUT_BUILDDIR: ${{ inputs.builddir }}
+        INPUT_SRCDIR: ${{ inputs.srcdir }}
+        INPUT_MAKE_COMMAND: ${{ inputs.make-command }}
+
+    - name: clean
+      uses: gacts/run-and-post-run@598d7a875d5620e0457490555b5e18e46082aa47 # v1.4.4
+      with:
+        working-directory:
+        post: |
+          ${{ steps.dummy-files.outputs.clean }}
+          ${{ steps.clean.outputs.distclean }}
+          ${{ steps.clean.outputs.remained-files }}
+          ${{ steps.clean.outputs.final }}
+      # rmdir randomly fails due to launchable files
+      continue-on-error: true
diff --git a/.github/actions/setup/macos/action.yml b/.github/actions/setup/macos/action.yml
new file mode 100644
index 0000000000..9cd37a9b12
--- /dev/null
+++ b/.github/actions/setup/macos/action.yml
@@ -0,0 +1,29 @@
+name: Setup macOS environment
+description: >-
+  Installs necessary packages via Homebrew.
+
+inputs: {} # nothing?
+
+outputs: {} # nothing?
+
+runs:
+  using: composite
+
+  steps:
+    - name: brew
+      shell: bash
+      run: |
+        brew install --quiet jemalloc gmp libffi openssl@3 zlib autoconf automake libtool
+
+    - name: Set ENV
+      shell: bash
+      run: | # zizmor: ignore[github-env]
+        dir_config() {
+          local args=() lib var="$1"; shift
+          for lib in "$@"; do
+            args+=("--with-${lib%@*}-dir=$(brew --prefix $lib)")
+          done
+          echo "$var=${args[*]}" >> $GITHUB_ENV
+        }
+        dir_config ruby_configure_args gmp
+        dir_config CONFIGURE_ARGS openssl@3
diff --git a/.github/actions/setup/ubuntu/action.yml b/.github/actions/setup/ubuntu/action.yml
new file mode 100644
index 0000000000..5209ccc03f
--- /dev/null
+++ b/.github/actions/setup/ubuntu/action.yml
@@ -0,0 +1,72 @@
+name: Setup ubuntu environment
+description: >-
+  At the beginning there was no way but to copy & paste `apt-get`
+  everywhere.  But now that we have composite actions, it seems better
+  merge them into one.
+
+inputs:
+  arch:
+    required: false
+    default: ''
+    description: >-
+      Architecture.  Because we run this on a GitHub-hosted runner
+      acceptable value for this input is very limited.
+
+outputs:
+  arch:
+    value: ${{ steps.uname.outputs.uname }}
+    description: >-
+      Actual architecture.  This could be different from the one
+      passed to the `inputs.arch`.  For instance giving `i386` to this
+      action yields `i686`.
+
+runs:
+  using: composite
+
+  steps:
+    - id: uname
+      name: uname
+      shell: bash
+      env:
+        arch: ${{ inputs.arch }}
+      run: |
+        setarch="${arch:+setarch $arch --}"
+        # normalize `uname`
+        if uname=$(${setarch} uname -m 2> /dev/null); then
+          # `setarch` works, `$arch` is a valid architecture name.
+          echo "setarch=${setarch}" >> "$GITHUB_OUTPUT"
+        else
+          # if `setarch` failed, take the given `arch` as-is.
+          uname="${arch}"
+          setarch=""
+        fi
+        echo "uname=$uname" >> "$GITHUB_OUTPUT"
+        echo "dpkg=${uname/686/386}" >> "$GITHUB_OUTPUT"
+
+    - name: set SETARCH
+      shell: bash
+      run: echo "SETARCH=${setarch}" >> "$GITHUB_ENV" # zizmor: ignore[github-env]
+      env:
+        setarch: ${{ steps.uname.outputs.setarch }} # validated
+
+    - name: dpkg setup
+      shell: bash
+      run: sudo dpkg --add-architecture "${dpkg}"
+      # `dpkg` is valid, also `uname`.
+      if: ${{ inputs.arch }}
+      env:
+        dpkg: ${{ steps.uname.outputs.dpkg }}
+
+    - name: apt-get
+      shell: bash
+      env:
+        arch: ${{ inputs.arch && format(':{0}', steps.uname.outputs.dpkg) || '' }}
+      run: |
+        set -x
+        sudo apt-get update -qq || :
+        sudo apt-get install --no-install-recommends -qq -y -o=Dpkg::Use-Pty=0 \
+        ${arch:+cross}build-essential${arch/:/-} \
+        libssl-dev${arch} libyaml-dev${arch} libreadline6-dev${arch} \
+        zlib1g-dev${arch} libncurses5-dev${arch} libffi-dev${arch} \
+        autoconf ruby
+        sudo apt-get install -qq -y pkg-config${arch} || :
diff --git a/.github/actions/slack/action.yml b/.github/actions/slack/action.yml
new file mode 100644
index 0000000000..6f89bef11a
--- /dev/null
+++ b/.github/actions/slack/action.yml
@@ -0,0 +1,51 @@
+name: Post a message to slack
+description: >-
+  We have our ruby/action-slack webhook.  However its arguments are
+  bit verbose to be listed in every workflow files.  Better merge them
+  into one.
+
+inputs:
+  SLACK_WEBHOOK_URL:
+    required: true
+    description: >-
+      The URL to post the payload.  This is an input because it tends
+      to be stored in a secrets vault and a composite action cannot
+      look into one.
+
+  label:
+    required: false
+    description: >-
+      Human-readable description of the run, something like "DEBUG=1".
+      This need not be unique among runs.
+
+  event_name:
+    required: false
+    default: 'push'
+    description: >-
+      Target event to trigger notification. Notify only push by default.
+
+  extra_channel_id:
+    required: false
+    description: >-
+      Slack channel ID to notify besides #alerts and #alerts-emoji.
+
+outputs: {} # Nothing?
+
+runs:
+  using: composite
+
+  steps:
+    - uses: ruby/action-slack@d260b61aa817726d5bedd22dd6cc305787fa4cdd # v4.0.0
+      with:
+        payload: |
+          {
+            "ci": "GitHub Actions",
+            "env": "${{ github.workflow }}${{ inputs.label && format(' / {0}', inputs.label) }}",
+            "url": "https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}",
+            "commit": "${{ github.sha }}",
+            "branch": "${{ github.ref_name }}"
+            ${{ inputs.extra_channel_id && format(', "extra_channel_id": "{0}"', inputs.extra_channel_id) }}
+          }
+      env:
+        SLACK_WEBHOOK_URL: ${{ inputs.SLACK_WEBHOOK_URL }}
+      if: ${{ github.event_name == inputs.event_name && startsWith(github.repository, 'ruby/') }}
diff --git a/.github/auto_request_review.yml b/.github/auto_request_review.yml
new file mode 100644
index 0000000000..9e20cb7459
--- /dev/null
+++ b/.github/auto_request_review.yml
@@ -0,0 +1,21 @@
+files:
+  'yjit*': [team:jit]
+  'yjit/**/*': [team:jit]
+  'yjit/src/cruby_bindings.inc.rs': []
+  'bootstraptest/test_yjit*': [team:jit]
+  'test/ruby/test_yjit*': [team:jit]
+  'zjit*': [team:jit]
+  'zjit/**/*': [team:jit]
+  'zjit/src/cruby_bindings.inc.rs': []
+  'test/ruby/test_zjit*': [team:jit]
+  'defs/jit.mk': [team:jit]
+  'tool/zjit_bisect.rb': [team:jit]
+  'doc/jit/*': [team:jit]
+  # Skip files updated by dependabot. It's noisy in notifications, and they're auto-merged anyway.
+  'yjit/Cargo.lock': []
+  'zjit/Cargo.lock': []
+  '.github/workflows/yjit-*.yml': []
+  '.github/workflows/zjit-*.yml': []
+options:
+  ignore_draft: true
+  last_files_match_only: true
diff --git a/.github/codeql/codeql-config.yml b/.github/codeql/codeql-config.yml
new file mode 100644
index 0000000000..f5d33545c1
--- /dev/null
+++ b/.github/codeql/codeql-config.yml
@@ -0,0 +1,22 @@
+paths-ignore:
+  - benchmark
+  - sample
+  - spec/ruby/command_line/fixtures
+  - spec/ruby/core/enumerable/shared/inject.rb
+  - spec/ruby/core/exception/fixtures
+  - spec/ruby/core/proc/parameters_spec.rb
+  - spec/ruby/core/proc/ruby2_keywords_spec.rb
+  - spec/ruby/core/range/reverse_each_spec.rb
+  - spec/ruby/language/fixtures
+  - spec/ruby/language/lambda_spec.rb
+  - spec/ruby/language/method_spec.rb
+  - spec/ruby/language/string_spec.rb
+  - test/error_highlight/test_error_highlight.rb
+  - test/prism/result/named_capture_test.rb
+  - test/ruby/test_call.rb
+  - test/ruby/test_signal.rb
+  - test/ruby/test_super.rb
+  - test/ruby/test_syntax.rb
+  - test/ruby/test_unicode_escape.rb
+  - test/rubygems/specifications/foo-0.0.1-x86-mswin32.gemspec
+  - trace_point.rb
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000..57da742e5c
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,29 @@
+version: 2
+updates:
+  - package-ecosystem: 'github-actions'
+    directories:
+      - '/'
+      - '/.github/actions/slack'
+      - '/.github/actions/setup/directories'
+    schedule:
+      interval: 'daily'
+    groups:
+      github-actions:
+        patterns:
+          - "*"
+  - package-ecosystem: 'cargo'
+    directories:
+      - '/yjit'
+      - '/zjit'
+    exclude-paths:
+      - 'gc/mmtk/**'
+    schedule:
+      interval: 'monthly'
+    groups:
+      jit:
+        patterns:
+          - "*"
+  - package-ecosystem: 'vcpkg'
+    directory: '/'
+    schedule:
+      interval: 'daily'
diff --git a/.github/labeler.yml b/.github/labeler.yml
new file mode 100644
index 0000000000..f39fcec386
--- /dev/null
+++ b/.github/labeler.yml
@@ -0,0 +1,7 @@
+Documentation:
+- changed-files:
+  - all-globs-to-all-files: doc/**
+
+Backport:
+- base-branch: 'ruby_3_\d'
+- base-branch: 'ruby_4_\d'
diff --git a/.github/workflows/annocheck.yml b/.github/workflows/annocheck.yml
new file mode 100644
index 0000000000..5991165d43
--- /dev/null
+++ b/.github/workflows/annocheck.yml
@@ -0,0 +1,111 @@
+name: Annocheck
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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:
+  compile:
+    name: test-annocheck
+
+    runs-on: ubuntu-latest
+
+    container:
+      image: ghcr.io/ruby/ruby-ci-image:gcc-11
+      options: --user root
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    env:
+      CONFIGURE_TTY: never
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUBY_DEBUG: ci rgengc
+      RUBY_TESTOPTS: >-
+        -q
+        --color=always
+        --tty=no
+      # FIXME: Drop skipping options
+      # https://bugs.ruby-lang.org/issues/18061
+      # https://sourceware.org/annobin/annobin.html/Test-pie.html
+      TEST_ANNOCHECK_OPTS: '--skip-pie --skip-gaps'
+
+    steps:
+      - run: id
+        working-directory:
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      # Minimal flags to pass the check.
+      # -g0 disables backtraces when SEGV.  Do not set that.
+      - name: Run configure
+        run: >
+          ../src/configure -C
+          --enable-debug-env
+          --disable-install-doc
+          --with-ext=-test-/cxxanyargs,+
+          --without-valgrind
+          --without-jemalloc
+          --without-gmp
+          --with-gcc="gcc-11 -fcf-protection -Wa,--generate-missing-build-notes=yes"
+          --enable-shared
+          debugflags=-ggdb3
+          optflags=-O2
+          LDFLAGS=-Wl,-z,now
+
+      - run: make showflags
+
+      - run: make
+
+      - run: make test-annocheck
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/auto_request_review.yml b/.github/workflows/auto_request_review.yml
new file mode 100644
index 0000000000..80f2517eb5
--- /dev/null
+++ b/.github/workflows/auto_request_review.yml
@@ -0,0 +1,20 @@
+name: Auto Request Review
+on:
+  pull_request_target:
+    types: [opened, ready_for_review, reopened]
+    branches: [master]
+
+permissions:
+  contents: read
+
+jobs:
+  auto-request-review:
+    name: Auto Request Review
+    runs-on: ubuntu-latest
+    if: ${{ github.repository == 'ruby/ruby' && github.base_ref == 'master' }}
+    steps:
+      - name: Request review based on files changes and/or groups the author belongs to
+        uses: necojackarc/auto-request-review@035f049cb68460341ab744f19aa9f31aae685e36 # master
+        with:
+          # scope: public_repo
+          token: ${{ secrets.MATZBOT_AUTO_REQUEST_REVIEW_TOKEN }}
diff --git a/.github/workflows/auto_review_pr.yml b/.github/workflows/auto_review_pr.yml
new file mode 100644
index 0000000000..bb84a51573
--- /dev/null
+++ b/.github/workflows/auto_review_pr.yml
@@ -0,0 +1,41 @@
+name: Auto Review PR
+on:
+  pull_request_target:
+    types: [opened, ready_for_review, reopened]
+    branches: [master]
+  workflow_dispatch:
+    inputs:
+      pr_number:
+        description: 'PR number to review'
+        required: true
+        type: number
+
+permissions:
+  contents: read
+
+jobs:
+  auto-review-pr:
+    name: Auto Review PR
+    runs-on: ubuntu-latest
+    if: ${{ github.repository == 'ruby/ruby' && (github.base_ref == 'master' || github.event_name == 'workflow_dispatch') }}
+
+    permissions:
+      pull-requests: write
+      contents: read
+
+    steps:
+      - name: Checkout repository
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.4'
+          bundler: none
+
+      - name: Auto Review PR
+        run: ruby tool/auto_review_pr.rb "$GITHUB_PR_NUMBER"
+        env:
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
+          GITHUB_PR_NUMBER: ${{ github.event.pull_request.number || github.event.inputs.pr_number }}
diff --git a/.github/workflows/baseruby.yml b/.github/workflows/baseruby.yml
new file mode 100644
index 0000000000..9e7720f659
--- /dev/null
+++ b/.github/workflows/baseruby.yml
@@ -0,0 +1,76 @@
+name: BASERUBY Check
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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:
+  baseruby:
+    name: BASERUBY
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    strategy:
+      matrix:
+        ruby:
+          - ruby-3.1
+          - ruby-3.2
+          - ruby-3.3
+
+    steps:
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler: none
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          makeup: true
+
+      - run: ./configure --disable-install-doc
+
+      - run: make all
+
+      - run: make test
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.ruby }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/bundled_gems.yml b/.github/workflows/bundled_gems.yml
new file mode 100644
index 0000000000..d329ee9b4b
--- /dev/null
+++ b/.github/workflows/bundled_gems.yml
@@ -0,0 +1,186 @@
+name: bundled_gems
+
+env:
+  UPDATE_ENABLED: true
+
+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:
+  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:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          token: ${{ (github.repository == 'ruby/ruby' && !startsWith(github.event_name, 'pull')) && secrets.MATZBOT_AUTO_UPDATE_TOKEN || secrets.GITHUB_TOKEN }}
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: 4.0
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          # Skip overwriting MATZBOT_AUTO_UPDATE_TOKEN
+          checkout: '' # false (ref: https://github.com/actions/runner/issues/2238)
+
+      - name: Set ENV
+        run: |
+          echo "TODAY=$(date +%F)" >> $GITHUB_ENV
+
+      - name: Download previous gems list
+        run: |
+          mkdir -p .downloaded-cache
+          for data in bundled_gems.json default_gems.json; do
+            ln -s .downloaded-cache/$data .
+            curl --retry 5 --retry-connrefused --retry-delay 2 --retry-max-time 60 -O -R -z ./$data https://stdgems.org/$data
+          done
+
+      - name: Update bundled gems list
+        id: bundled_gems
+        run: |
+          ruby -i~ tool/update-bundled_gems.rb gems/bundled_gems >> $GITHUB_OUTPUT
+        if: ${{ env.UPDATE_ENABLED == 'true' }}
+
+      - name: Maintain updated gems list in NEWS
+        run: |
+          ruby tool/update-NEWS-gemlist.rb bundled
+          ruby tool/update-NEWS-github-release.rb --update
+        if: ${{ env.UPDATE_ENABLED == 'true' }}
+
+      - name: Check diffs
+        id: diff
+        run: |
+          news= gems=
+          git diff --color --no-ext-diff --ignore-submodules --exit-code -- NEWS.md ||
+          news=true
+          git diff --color --no-ext-diff --ignore-submodules --exit-code -- gems/bundled_gems ||
+          gems=true
+          git add -- NEWS.md gems/bundled_gems
+          echo news=$news >> $GITHUB_OUTPUT
+          echo gems=$gems >> $GITHUB_OUTPUT
+          echo update=${news:-$gems} >> $GITHUB_OUTPUT
+
+      - name: Commit
+        id: commit
+        run: |
+          git pull --ff-only origin ${GITHUB_REF#refs/heads/}
+          message="Update bundled gems list"
+          if [ -z "${gems}" ]; then
+            git commit --message="[DOC] ${message} at ${GITHUB_SHA:0:30}"
+          else
+            git commit --message="${message} as of ${TODAY}"
+          fi
+        env:
+          TODAY: ${{ steps.bundled_gems.outputs.latest_date || env.TODAY }}
+          EMAIL: svn-admin@ruby-lang.org
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+          gems: ${{ steps.diff.outputs.gems }}
+        if: ${{ steps.diff.outputs.update }}
+
+      - name: Development revision of bundled gems
+        run: |
+          #!ruby
+          file = "gems/bundled_gems"
+
+          SECONDS_IN_DAY = 86400
+          today = Time.new("#{ENV['TODAY']}Z")
+          if !(december = today.month == 12)
+            days = 30
+          elsif (days = 26 - today.day).positive?
+            days += 4
+          else
+            puts "::info:: just after released"
+            exit
+          end
+
+          since = "#{today.year-1}-12-26"
+          ref = ENV['GITHUB_REF']
+          puts "::group::\e[94mfetching \e[1m#{file}\e[22m since \e[1m#{since}\e[22m from \e[1m#{ref}\e[m"
+          system(*%W[git fetch --shallow-since=#{since} --no-tags origin #{ref}], exception: true)
+          puts "::endgroup::"
+
+          puts "\e[94mchecking development version bundled gems older than \e[1m#{days}\e[22m days\e[m"
+          limit = today.to_i - days * SECONDS_IN_DAY
+          old = 0
+          IO.popen(%W"git blame --line-porcelain -- #{file}") do |blame|
+            while head = blame.gets("\n\t") and s = blame.gets
+              next unless (gem = s.split(/\s+|#.*/)).size > 3
+              time = head[/^committer-time \K\d+/].to_i
+              next if (d = limit - time) <= 0
+              d /= SECONDS_IN_DAY
+              line = head[/\A\h+ \d+ \K\d+/].to_i
+              level = if d < days; 'warning'; else old += 1; 'error'; end
+              d += days
+              puts "::#{level} file=#{file},line=#{line},title=Older than #{d} days::#{gem[0]} #{gem[3]}"
+            end
+          end
+          abort "::error title=Too long-standing gems::The release comes soon." if december and old.nonzero?
+        shell: ruby {0}
+        env:
+          file: ${{ steps.logs.outputs.file }}
+          days: ${{ steps.logs.outputs.days }}
+
+      - name: Install libraries
+        uses: ./.github/actions/setup/ubuntu
+        if: ${{ steps.diff.outputs.gems }}
+
+      - name: Build
+        run: |
+          ./autogen.sh
+          ./configure -C --disable-install-doc
+          make
+        if: ${{ steps.diff.outputs.gems }}
+
+      - name: Prepare bundled gems
+        run: |
+          make -s prepare-gems
+        if: ${{ steps.diff.outputs.gems }}
+
+      - name: Test bundled gems
+        run: |
+          make -s test-bundled-gems
+        timeout-minutes: 30
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+        if: ${{ steps.diff.outputs.gems }}
+
+      - name: Push
+        run: |
+          git push origin ${GITHUB_REF#refs/heads/}
+        if: >-
+          ${{
+          github.repository == 'ruby/ruby' &&
+          !startsWith(github.event_name, 'pull') &&
+          steps.commit.outcome == 'success'
+          }}
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/check_dependencies.yml b/.github/workflows/check_dependencies.yml
new file mode 100644
index 0000000000..a120dde7e5
--- /dev/null
+++ b/.github/workflows/check_dependencies.yml
@@ -0,0 +1,61 @@
+name: Check Dependencies
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+  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:
+  update-deps:
+    name: Dependency checks
+
+    strategy:
+      matrix:
+        os: [ubuntu-latest]
+      fail-fast: true
+
+    runs-on: ${{ matrix.os }}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+        if: ${{ contains(matrix.os, 'ubuntu') }}
+
+      - uses: ./.github/actions/setup/macos
+        if: ${{ contains(matrix.os, 'macos') }}
+
+      - uses: ./.github/actions/setup/directories
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      - name: Run configure
+        run: ./configure -C --disable-install-doc --disable-rubygems --with-gcc 'optflags=-O0' 'debugflags=-save-temps=obj -g'
+
+      - run: make fix-depends
+
+      - run: git diff --color --no-ext-diff --ignore-submodules --exit-code
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.os }} / Dependencies need to update
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/check_misc.yml b/.github/workflows/check_misc.yml
new file mode 100644
index 0000000000..cb1642b9e2
--- /dev/null
+++ b/.github/workflows/check_misc.yml
@@ -0,0 +1,151 @@
+name: Misc
+on: [push, pull_request, 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:
+  checks:
+    name: Miscellaneous checks
+
+    permissions:
+      contents: write # for Git to git push
+
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          token: ${{ (github.repository == 'ruby/ruby' && !startsWith(github.event_name, 'pull')) && secrets.MATZBOT_AUTO_UPDATE_TOKEN || secrets.GITHUB_TOKEN }}
+          persist-credentials: false
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: head
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          makeup: true
+          # Skip overwriting MATZBOT_AUTO_UPDATE_TOKEN
+          checkout: '' # false (ref: https://github.com/actions/runner/issues/2238)
+
+      - name: Re-generate Makefiles
+        run: |
+          # config.status needs to run as a shell script
+          { echo ':&&exit'; cat tool/prereq.status; } > config.status
+          : # same as actions/setup/directories/action.yml
+          for mk in Makefile GNUmakefile; do
+            sed -f tool/prereq.status template/$mk.in > $mk
+          done
+
+      - name: Check for code styles
+        run: |
+          set -x
+          ruby tool/auto-style.rb "$GITHUB_OLD_SHA" "$GITHUB_NEW_SHA"
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.pull_request.base.sha }}
+          GITHUB_NEW_SHA: ${{ github.event.pull_request.merge_commit_sha }}
+        # Skip 'push' events because post_push.yml fixes them on push
+        if: ${{ github.repository == 'ruby/ruby' && startsWith(github.event_name, 'pull') }}
+
+      - name: Check if date in man pages is up-to-date
+        run: |
+          git fetch origin --depth=1 "${GITHUB_OLD_SHA}"
+          git diff --exit-code --name-only "${GITHUB_OLD_SHA}" HEAD -- man ||
+          make V=1 GIT=git BASERUBY=ruby update-man-date
+          git diff --color --no-ext-diff --ignore-submodules --exit-code -- man
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.pull_request.base.sha }}
+        if: ${{ startsWith(github.event_name, 'pull') }}
+
+      - name: Check for bash specific substitution in configure.ac
+        run: |
+          git grep -n '\${[A-Za-z_0-9]*/' -- configure.ac && exit 1 || :
+
+      - name: Check for header macros
+        run: |
+          fail=
+          for header in ruby/*.h; do
+            git grep -l -F -e $header -e HAVE_`echo $header | tr a-z./ A-Z__` -- . > /dev/null && continue
+            fail=1
+            echo $header
+          done
+          exit $fail
+        working-directory: include
+
+      - id: now
+        run: |
+          date +"mon=%-m"%n"day=%-d" >> $GITHUB_OUTPUT
+        env:
+          TZ: Asia/Tokyo
+
+      - id: deprecation
+        run: |
+          eval $(sed -n 's/^#define RUBY_API_VERSION_\(MAJOR\|MINOR\) /\1=/p' include/ruby/version.h)
+          if git --no-pager grep --color -o 'rb_warn_deprecated_to_remove_at('$MAJOR'\.'$MINOR',.*' -- '*.c' >&2; then
+              false
+          else
+              true
+          fi
+        continue-on-error: ${{ steps.now.outputs.mon < 12 }}
+
+      - name: Check if to generate documents
+        id: rdoc
+        run: |
+          set -- $(sed 's/#.*//;/^rdoc /!d' gems/bundled_gems)
+          { echo version=$2; echo ref=$4; } >> $GITHUB_OUTPUT
+
+      - name: Checkout rdoc
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          repository: ruby/rdoc
+          ref: ${{ steps.rdoc.outputs.ref }}
+          path: .bundle/gems/rdoc-${{ steps.rdoc.outputs.version }}
+          persist-credentials: false
+        if: ${{ steps.rdoc.outputs.ref != '' }}
+
+      - name: Generate rdoc scripts
+        run: |
+          set -x
+          gempath=$(ruby -e 'print Gem.user_dir, "/bin"')
+          PATH=$gempath:$PATH
+          gem install --user bundler
+          bundle config --local path vendor/bundle
+          bundle install --jobs 4
+          bundle exec rake generate
+        working-directory: .bundle/gems/rdoc-${{ steps.rdoc.outputs.version }}
+        if: ${{ steps.rdoc.outputs.ref != '' }}
+
+      - name: Core docs coverage
+        run: |
+          make XRUBY=ruby RDOC_DEPENDS= RBCONFIG=update-rbconfig rdoc-coverage
+
+      - name: Generate docs
+        id: docs
+        run: |
+          make XRUBY=ruby RDOC_DEPENDS= RBCONFIG=update-rbconfig HTMLOUT=html html
+          echo htmlout=ruby-html-${GITHUB_SHA:0:10} >> $GITHUB_OUTPUT
+        # Generate only when document commit/PR
+        if: >-
+          ${{false
+          || contains(github.event.head_commit.message, '[ruby/rdoc]')
+          || contains(github.event.head_commit.message, '[DOC]')
+          || contains(github.event.pull_request.title, '[DOC]')
+          || contains(github.event.pull_request.labels.*.name, 'Documentation')
+          }}
+
+      - name: Upload docs
+        uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+        with:
+          path: html
+          name: ${{ steps.docs.outputs.htmlout }}
+        if: ${{ steps.docs.outcome == 'success' }}
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/check_sast.yml b/.github/workflows/check_sast.yml
new file mode 100644
index 0000000000..c8db1103ed
--- /dev/null
+++ b/.github/workflows/check_sast.yml
@@ -0,0 +1,133 @@
+name: 'Check SAST tool'
+
+on:
+  push:
+    branches: ['master']
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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:
+  zizmor:
+    name: zizmor
+
+    runs-on: ubuntu-latest
+
+    permissions:
+      contents: read
+      security-events: write
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - name: Run zizmor
+        uses: zizmorcore/zizmor-action@5f14fd08f7cf1cb1609c1e344975f152c7ee938d # v0.5.6
+        continue-on-error: true
+
+  analyze:
+    name: Analyze
+    runs-on: ubuntu-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/upload-sarif to send a status report
+    # CodeQL fails to run pull requests from dependabot due to missing write access to upload results.
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - language: cpp
+          - language: ruby
+
+    steps:
+      - name: Checkout repository
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - name: Initialize CodeQL
+        uses: github/codeql-action/init@8aad20d150bbac5944a9f9d289da16a4b0d87c1e # v4.36.2
+        with:
+          languages: ${{ matrix.language }}
+          build-mode: none
+          config-file: .github/codeql/codeql-config.yml
+
+      - name: Perform CodeQL Analysis
+        uses: github/codeql-action/analyze@8aad20d150bbac5944a9f9d289da16a4b0d87c1e # v4.36.2
+        with:
+          category: '/language:${{ matrix.language }}'
+          upload: False
+          output: sarif-results
+
+      - name: filter-sarif
+        uses: advanced-security/filter-sarif@2da736ff05ef065cb2894ac6892e47b5eac2c3c0 # v1.1
+        with:
+          patterns: |
+            +**/*.rb
+            -lib/uri/mailto.rb:rb/overly-large-range
+            -lib/uri/rfc3986_parser.rb:rb/overly-large-range
+            -lib/bundler/vendor/uri/lib/uri/mailto.rb:rb/overly-large-range
+            -lib/bundler/vendor/uri/lib/uri/rfc3986_parser.rb:rb/overly-large-range
+            -spec/ruby/core/regexp/timeout_spec.rb:rb/redos
+            -test/ruby/test_io.rb:rb/non-constant-kernel-open
+            -test/open-uri/test_open-uri.rb:rb/non-constant-kernel-open
+            -test/open-uri/test_ssl.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/io/binread_spec.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/io/readlines_spec.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/io/foreach_spec.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/io/write_spec.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/io/read_spec.rb:rb/non-constant-kernel-open
+            -spec/ruby/core/kernel/open_spec.rb:rb/non-constant-kernel-open
+          input: sarif-results/${{ matrix.language }}.sarif
+          output: sarif-results/${{ matrix.language }}.sarif
+        if: ${{ matrix.language == 'ruby' }}
+        continue-on-error: true
+
+      - name: filter-sarif
+        uses: advanced-security/filter-sarif@2da736ff05ef065cb2894ac6892e47b5eac2c3c0 # v1.1
+        with:
+          patterns: |
+            +**/*.c
+            +**/*.h
+          input: sarif-results/${{ matrix.language }}.sarif
+          output: sarif-results/${{ matrix.language }}.sarif
+        if: ${{ matrix.language == 'cpp' }}
+        continue-on-error: true
+
+      - name: Upload SARIF
+        uses: github/codeql-action/upload-sarif@8aad20d150bbac5944a9f9d289da16a4b0d87c1e # v4.36.2
+        with:
+          sarif_file: sarif-results/${{ matrix.language }}.sarif
+        continue-on-error: true
diff --git a/.github/workflows/compilers.yml b/.github/workflows/compilers.yml
new file mode 100644
index 0000000000..f747b7fd03
--- /dev/null
+++ b/.github/workflows/compilers.yml
@@ -0,0 +1,333 @@
+# Some tests depending on this name 'Compilations' via $GITHUB_WORKFLOW. Make sure to update such tests when renaming this workflow.
+name: Compilations
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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
+
+# Each job is split so that they roughly take 30min to run through.
+jobs:
+  compile-if:
+    name: 'omnibus compilations, trigger'
+    runs-on: ubuntu-latest
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+    steps:
+      - run: true
+        working-directory:
+
+  compile1:
+    name: 'omnibus compilations, #1'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      # Set fetch-depth: 10 so that Launchable can receive commits information.
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - name: 'clang 22 LTO'
+        uses: './.github/actions/compilers'
+        with:
+          tag: clang-22
+          with_gcc: 'clang-22 -flto=auto'
+          optflags: '-O2'
+          enable_shared: false
+        timeout-minutes: 30
+      - { uses: './.github/actions/compilers', name: '-O0', with: { optflags: '-O0 -march=x86-64 -mtune=generic' }, timeout-minutes: 5 }
+      # - { uses: './.github/actions/compilers', name: '-O3', with: { optflags: '-O3 -march=x86-64 -mtune=generic', check: true } }
+
+  compile2:
+    name: 'omnibus compilations, #2'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - name: 'GCC 15 LTO'
+        uses: './.github/actions/compilers'
+        with:
+          tag: gcc-15
+          with_gcc: 'gcc-15 -flto=auto -ffat-lto-objects -Werror=lto-type-mismatch'
+          optflags: '-O2'
+          enable_shared: false
+        timeout-minutes: 10
+      - { uses: './.github/actions/compilers', name: 'ext/Setup', with: { static_exts: 'etc json/* */escape' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 15', with: { tag: 'gcc-15' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 14', with: { tag: 'gcc-14' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 13', with: { tag: 'gcc-13' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 12', with: { tag: 'gcc-12' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 11', with: { tag: 'gcc-11' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 10', with: { tag: 'gcc-10' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 9',  with: { tag: 'gcc-9'  }, timeout-minutes: 5 }
+
+  compile3:
+    name: 'omnibus compilations, #3'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'clang 20', with: { tag: 'clang-20' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 19', with: { tag: 'clang-19' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 18', with: { tag: 'clang-18' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 17', with: { tag: 'clang-17' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 16', with: { tag: 'clang-16' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 15', with: { tag: 'clang-15' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 14', with: { tag: 'clang-14' }, timeout-minutes: 5 }
+
+  compile4:
+    name: 'omnibus compilations, #4'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'clang 13', with: { tag: 'clang-13' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 12', with: { tag: 'clang-12' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 11', with: { tag: 'clang-11' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 10', with: { tag: 'clang-10' }, timeout-minutes: 5 }
+        # llvm-objcopy<=9 doesn't have --wildcard. It compiles, but leaves Rust symbols in libyjit.o and fail `make test-leaked-globals`.
+      - { uses: './.github/actions/compilers', name: 'clang 9',  with: { tag: 'clang-9',   append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 8',  with: { tag: 'clang-8',   append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 7',  with: { tag: 'clang-7',   append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 6',  with: { tag: 'clang-6.0', append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+
+  compile5:
+    name: 'omnibus compilations, #5'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      # -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
+      - { uses: './.github/actions/compilers', name: 'C99',      with: { CFLAGS: '-std=c99 -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C11',   with: { CFLAGS:   '-std=c11   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C17',   with: { CFLAGS:   '-std=c17   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C23',   with: { CFLAGS:   '-std=c2x   -Werror=pedantic -pedantic-errors -Wno-strict-prototypes' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++98', with: { CXXFLAGS: '-std=c++98 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++11', with: { CXXFLAGS: '-std=c++11 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++14', with: { CXXFLAGS: '-std=c++14 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++17', with: { CXXFLAGS: '-std=c++17 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+
+  compile6:
+    name: 'omnibus compilations, #6'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'C++20', with: { CXXFLAGS: '-std=c++20 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++23', with: { CXXFLAGS: '-std=c++23 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'C++26', with: { CXXFLAGS: '-std=c++26 -Werror=pedantic -pedantic-errors -Wno-c++11-long-long' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'gmp',                 with: { append_configure: '--with-gmp', test_all: 'ruby/test_bignum.rb', test_spec: "/github/workspace/src/spec/ruby/core/integer" }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'jemalloc',            with: { append_configure: '--with-jemalloc' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'valgrind',            with: { append_configure: '--with-valgrind' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'coroutine=ucontext',  with: { append_configure: '--with-coroutine=ucontext' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'coroutine=pthread',   with: { append_configure: '--with-coroutine=pthread' }, timeout-minutes: 5 }
+
+  compile7:
+    name: 'omnibus compilations, #7'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'disable-jit',         with: { append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'disable-yjit',        with: { append_configure: '--disable-yjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'disable-zjit',        with: { append_configure: '--disable-zjit' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'disable-dln',         with: { append_configure: '--disable-dln' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'enable-mkmf-verbose', with: { append_configure: '--enable-mkmf-verbose' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'disable-rubygems',    with: { append_configure: '--disable-rubygems' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RUBY_DEVEL',          with: { append_configure: '--enable-devel' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'OPT_THREADED_CODE=0',            with: { cppflags: '-DOPT_THREADED_CODE=0' }, timeout-minutes: 5 }
+
+  compile8:
+    name: 'omnibus compilations, #8'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'NDEBUG',                         with: { cppflags: '-DNDEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RUBY_DEBUG',                     with: { cppflags: '-DRUBY_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'ARRAY_DEBUG',                    with: { cppflags: '-DARRAY_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'CCAN_LIST_DEBUG',                with: { cppflags: '-DCCAN_LIST_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'CPDEBUG=-1',                     with: { cppflags: '-DCPDEBUG=-1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'ENC_DEBUG',                      with: { cppflags: '-DENC_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GC_DEBUG',                       with: { cppflags: '-DGC_DEBUG' }, timeout-minutes: 5 }
+
+  compile9:
+    name: 'omnibus compilations, #9'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'HASH_DEBUG',                     with: { cppflags: '-DHASH_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'ID_TABLE_DEBUG',                 with: { cppflags: '-DID_TABLE_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RGENGC_DEBUG=-1',                with: { cppflags: '-DRGENGC_DEBUG=-1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'SYMBOL_DEBUG',                   with: { cppflags: '-DSYMBOL_DEBUG' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RGENGC_CHECK_MODE',              with: { cppflags: '-DRGENGC_CHECK_MODE' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'VM_CHECK_MODE',                  with: { cppflags: '-DVM_CHECK_MODE' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'USE_EMBED_CI=0',                 with: { cppflags: '-DUSE_EMBED_CI=0' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'USE_FLONUM=0',                   with: { cppflags: '-DUSE_FLONUM=0', append_configure: '--disable-yjit --disable-zjit' }, timeout-minutes: 5 }
+
+  compileX:
+    name: 'omnibus compilations, #10'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'USE_LAZY_LOAD',                  with: { cppflags: '-DUSE_LAZY_LOAD' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'USE_RUBY_DEBUG_LOG=1',           with: { cppflags: '-DUSE_RUBY_DEBUG_LOG=1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'USE_DEBUG_COUNTER',              with: { cppflags: '-DUSE_DEBUG_COUNTER=1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'SHARABLE_MIDDLE_SUBSTRING',      with: { cppflags: '-DSHARABLE_MIDDLE_SUBSTRING=1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'DEBUG_FIND_TIME_NUMGUESS',       with: { cppflags: '-DDEBUG_FIND_TIME_NUMGUESS' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'DEBUG_INTEGER_PACK',             with: { cppflags: '-DDEBUG_INTEGER_PACK' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'OPT_THREADED_CODE=1',            with: { cppflags: '-DOPT_THREADED_CODE=1' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'OPT_THREADED_CODE=2',            with: { cppflags: '-DOPT_THREADED_CODE=2' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 21', with: { tag: 'clang-21' }, timeout-minutes: 5 }
+
+  compileB:
+    name: 'omnibus compilations, #11'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'GC_DEBUG_STRESS_TO_CLASS',       with: { cppflags: '-DGC_DEBUG_STRESS_TO_CLASS' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GC_ENABLE_LAZY_SWEEP=0',         with: { cppflags: '-DGC_ENABLE_LAZY_SWEEP=0' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GC_PROFILE_DETAIL_MEMORY',       with: { cppflags: '-DGC_PROFILE_DETAIL_MEMORY' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GC_PROFILE_MORE_DETAIL',         with: { cppflags: '-DGC_PROFILE_MORE_DETAIL' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'MALLOC_ALLOCATED_SIZE_CHECK',    with: { cppflags: '-DMALLOC_ALLOCATED_SIZE_CHECK' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RGENGC_ESTIMATE_OLDMALLOC',      with: { cppflags: '-DRGENGC_ESTIMATE_OLDMALLOC' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'RGENGC_PROFILE',                 with: { cppflags: '-DRGENGC_PROFILE' }, timeout-minutes: 5 }
+
+  compileC:
+    name: 'omnibus compilations, #12'
+    runs-on: ubuntu-latest
+    needs: compile-if
+    if: ${{ needs.compile-if.result == 'success' }}
+    timeout-minutes: 60
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - { uses: './.github/actions/setup/directories', with: { srcdir: 'src', builddir: 'build', makeup: true, fetch-depth: 10 } }
+      - { uses: './.github/actions/compilers', name: 'VM_DEBUG_BP_CHECK',              with: { cppflags: '-DVM_DEBUG_BP_CHECK' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'VM_DEBUG_VERIFY_METHOD_CACHE',   with: { cppflags: '-DVM_DEBUG_VERIFY_METHOD_CACHE' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'YJIT_FORCE_ENABLE',              with: { cppflags: '-DYJIT_FORCE_ENABLE' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'UNIVERSAL_PARSER',               with: { cppflags: '-DUNIVERSAL_PARSER' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 23', with: { tag: 'clang-23' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'clang 22', with: { tag: 'clang-22' }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 8',  with: { tag: 'gcc-8'  }, timeout-minutes: 5 }
+      - { uses: './.github/actions/compilers', name: 'GCC 7',  with: { tag: 'gcc-7'  }, timeout-minutes: 5 }
+
+  compilemax:
+    name: 'omnibus compilations, result'
+    runs-on: ubuntu-latest
+    if: ${{ always() }}
+    needs:
+      - 'compile1'
+      - 'compile2'
+      - 'compile3'
+      - 'compile4'
+      - 'compile5'
+      - 'compile6'
+      - 'compile7'
+      - 'compile8'
+      - 'compile9'
+      - 'compileX'
+      - 'compileB'
+      - 'compileC'
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with: { sparse-checkout-cone-mode: false, sparse-checkout: /.github, persist-credentials: false }
+      - uses: ./.github/actions/slack
+        with:
+          label: 'omnibus'
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+      - run: false
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/crosscompile.yml b/.github/workflows/crosscompile.yml
new file mode 100644
index 0000000000..3ed6429a1e
--- /dev/null
+++ b/.github/workflows/crosscompile.yml
@@ -0,0 +1,123 @@
+name: Cross compile
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks
+  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:
+  make:
+    name: make (${{ matrix.host }} host on ${{ matrix.build }})
+    strategy:
+      matrix:
+        include:
+          - host: aarch64-linux-gnu
+            arch: arm64
+            build: x86_64-linux-gnu
+            runs-on: ubuntu-24.04
+            file_arch: ARM aarch64
+          - host: x86_64-linux-gnu
+            arch: amd64
+            build: aarch64-linux-gnu
+            runs-on: ubuntu-24.04-arm
+            file_arch: x86-64
+      fail-fast: false
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+
+    runs-on: ${{ matrix.runs-on }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - name: Setup cross-compilation toolchain sources
+        run: |
+          native_arch=$(dpkg --print-architecture)
+          # Restrict existing sources to native arch
+          sudo sed -i '/^Architectures:/d' /etc/apt/sources.list.d/ubuntu.sources
+          sudo sed -i "/^Types:/a Architectures: ${native_arch}" /etc/apt/sources.list.d/ubuntu.sources
+          # Add cross-arch sources
+          if [ "${{ matrix.arch }}" = "arm64" ]; then
+            cross_uri="http://ports.ubuntu.com/"
+          else
+            cross_uri="http://archive.ubuntu.com/ubuntu/"
+          fi
+          printf '%s\n' \
+            "Types: deb" \
+            "URIs: ${cross_uri}" \
+            "Suites: noble noble-updates noble-security" \
+            "Components: main universe" \
+            "Architectures: ${{ matrix.arch }}" \
+            | sudo tee /etc/apt/sources.list.d/cross-${{ matrix.arch }}.sources
+
+      - uses: ./.github/actions/setup/ubuntu
+        with:
+          arch: ${{ matrix.arch }}
+
+      - uses: ./.github/actions/setup/baseruby
+        id: baseruby
+        with:
+          srcdir: src
+
+      - name: Run configure
+        run: >-
+          ../src/configure -C --disable-install-doc
+          --prefix=/usr
+          --build=${{ matrix.build }}
+          --host=${{ matrix.host }}
+          --with-baseruby="$baseruby"
+        env:
+          baseruby: ${{ steps.baseruby.outputs.ruby }}
+
+      - run: make
+
+      - run: make install DESTDIR=$PWD/install
+
+      - name: Verify cross-compiled binary
+        run: |
+          file install/usr/bin/ruby
+          file install/usr/bin/ruby | grep -q '${{ matrix.file_arch }}'
+
+      - uses: ./.github/actions/slack
+        with:
+          label: cross ${{ matrix.host }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/cygwin.yml b/.github/workflows/cygwin.yml
new file mode 100644
index 0000000000..f1a6f79587
--- /dev/null
+++ b/.github/workflows/cygwin.yml
@@ -0,0 +1,75 @@
+name: Cygwin
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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:
+  make:
+    runs-on: windows-2022
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - run: git config --global core.autocrlf input
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - name: Setup Cygwin
+        uses: cygwin/cygwin-install-action@711d29f3da23c9f4a1798e369a6f01198c13b11a # v6.1
+        with:
+          packages: ruby gcc-core make autoconf libtool libssl-devel libyaml-devel libffi-devel zlib-devel rubygems
+          site: |
+            https://cygwin.osuosl.org/
+
+      - name: configure
+        run: |
+          ./autogen.sh
+          ./configure --disable-install-doc
+        shell: C:\cygwin\bin\bash.EXE --noprofile --norc -e -o igncr -o pipefail {0}
+
+      - name: Extract bundled gems
+        run: |
+          make ruby -j5
+          make extract-gems
+        shell: C:\cygwin\bin\bash.EXE --noprofile --norc -e -o igncr -o pipefail {0}
+
+      - name: make all
+        timeout-minutes: 30
+        run: make -j4 V=1
+        shell: C:\cygwin\bin\bash.EXE --noprofile --norc -e -o igncr -o pipefail {0}
+
+      - uses: ./.github/actions/slack
+        with:
+          label: Cygwin
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/default_gems_list.yml b/.github/workflows/default_gems_list.yml
new file mode 100644
index 0000000000..68f2d18dd6
--- /dev/null
+++ b/.github/workflows/default_gems_list.yml
@@ -0,0 +1,99 @@
+name: Update default gems list
+on: [push, pull_request, merge_group]
+
+env:
+  UPDATE_NEWS_ENABLED: true
+
+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_default_gems_list:
+    name: Update default gems list
+
+    permissions:
+      contents: write # for Git to git push
+
+    runs-on: ubuntu-latest
+
+    if: ${{ github.repository == 'ruby/ruby' }}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          token: ${{ (github.repository == 'ruby/ruby' && !startsWith(github.event_name, 'pull')) && secrets.MATZBOT_AUTO_UPDATE_TOKEN || secrets.GITHUB_TOKEN }}
+
+      - id: gems
+        run: true
+        if: ${{ github.ref == 'refs/heads/master' }}
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          makeup: true
+          # Skip overwriting MATZBOT_AUTO_UPDATE_TOKEN
+          checkout: '' # false (ref: https://github.com/actions/runner/issues/2238)
+        if: ${{ steps.gems.outcome == 'success' }}
+
+      - name: Download previous gems list
+        run: |
+          data=default_gems.json
+          mkdir -p .downloaded-cache
+          ln -s .downloaded-cache/$data .
+          curl --retry 5 --retry-connrefused --retry-delay 2 --retry-max-time 60 -O -R -z ./$data https://stdgems.org/$data
+        if: ${{ steps.gems.outcome == 'success' }}
+
+      - name: Make default gems list
+        run: |
+          #!ruby
+          require 'rubygems'
+          $:.unshift "lib"
+          rgver = File.foreach("lib/rubygems.rb") do |line|
+            break $1 if /^\s*VERSION\s*=\s*"([^"]+)"/ =~ line
+          end
+          gems = Dir.glob("{ext,lib}/**/*.gemspec").map do |f|
+            spec = Gem::Specification.load(f)
+            "#{spec.name} #{spec.version}"
+          end.sort
+          File.open("gems/default_gems", "w") do |f|
+            f.puts "RubyGems #{rgver}"
+            f.puts gems
+          end
+        shell: ruby --disable=gems {0}
+        if: ${{ steps.gems.outcome == 'success' }}
+
+      - name: Maintain updated gems list in NEWS
+        run: |
+          ruby tool/update-NEWS-gemlist.rb default
+        if: ${{ steps.gems.outcome == 'success' && env.UPDATE_NEWS_ENABLED == 'true' }}
+
+      - name: Check diffs
+        id: diff
+        run: |
+          git diff --color --no-ext-diff --ignore-submodules --exit-code NEWS.md ||
+          echo update=true >> $GITHUB_OUTPUT
+        if: ${{ steps.gems.outcome == 'success' }}
+
+      - name: Commit
+        run: |
+          git pull --ff-only origin ${GITHUB_REF#refs/heads/}
+          git commit --message="Update default gems list at ${GITHUB_SHA:0:30} [ci skip]" NEWS.md
+          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.diff.outputs.update
+          }}
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/dependabot_automerge.yml b/.github/workflows/dependabot_automerge.yml
new file mode 100644
index 0000000000..2e4dc8d7a2
--- /dev/null
+++ b/.github/workflows/dependabot_automerge.yml
@@ -0,0 +1,32 @@
+# from https://github.com/gofiber/swagger/blob/main/.github/workflows/dependabot_automerge.yml
+name: Dependabot auto-merge
+on:
+  pull_request:
+
+permissions:
+  contents: write
+  pull-requests: write
+
+jobs:
+  automerge:
+    runs-on: ubuntu-latest
+    if: github.event.pull_request.user.login == 'dependabot[bot]' && github.repository == 'ruby/ruby'
+    steps:
+      - name: Dependabot metadata
+        uses: dependabot/fetch-metadata@25dd0e34f4fe68f24cc83900b1fe3fe149efef98 # v3.1.0
+        id: metadata
+
+      - name: Wait for status checks
+        uses: lewagon/wait-on-check-action@9312864dfbc9fd208e9c0417843430751c042800 # v1.7.0
+        with:
+          repo-token: ${{ secrets.GITHUB_TOKEN }}
+          ref: ${{ github.event.pull_request.head.sha || github.sha }}
+          check-regexp: 'make \(check, .*\)'
+          wait-interval: 30
+
+      - name: Auto-merge for Dependabot PRs
+        if: ${{ steps.metadata.outputs.update-type == 'version-update:semver-minor' || steps.metadata.outputs.update-type == 'version-update:semver-patch' }}
+        run: gh pr merge --auto --rebase "$PR_URL"
+        env:
+          PR_URL: ${{ github.event.pull_request.html_url }}
+          GITHUB_TOKEN: ${{ secrets.MATZBOT_DEPENDABOT_MERGE_TOKEN }}
diff --git a/.github/workflows/labeler.yml b/.github/workflows/labeler.yml
new file mode 100644
index 0000000000..d0a8024b05
--- /dev/null
+++ b/.github/workflows/labeler.yml
@@ -0,0 +1,15 @@
+name: "Pull Request Labeler"
+on:
+- pull_request_target
+
+permissions:
+  contents: read
+
+jobs:
+  labeler:
+    permissions:
+      contents: read
+      pull-requests: write
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/labeler@f27b608878404679385c85cfa523b85ccb86e213 # v6.1.0
diff --git a/.github/workflows/macos.yml b/.github/workflows/macos.yml
new file mode 100644
index 0000000000..4f1807121f
--- /dev/null
+++ b/.github/workflows/macos.yml
@@ -0,0 +1,191 @@
+name: macOS
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  make:
+    strategy:
+      matrix:
+        include:
+          - test_task: check
+            os: macos-26
+          - test_task: check
+            os: macos-15
+            configure_args: '--with-gcc=gcc-14'
+          - test_task: check
+            os: macos-26
+            configure_args: '--with-jemalloc --with-opt-dir=$(brew --prefix jemalloc)'
+          - test_task: check
+            os: macos-26
+            configure_args: '--with-gmp'
+          - test_task: test-all
+            test_opts: --repeat-count=2
+            os: macos-26
+          - test_task: test-bundler-parallel
+            os: macos-26
+          - test_task: test-bundled-gems
+            os: macos-26
+          - test_task: check
+            os: macos-15
+          - test_task: check
+            os: macos-15-intel
+          - test_task: check
+            os: macos-14
+      fail-fast: false
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+
+    runs-on: ${{ matrix.os }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - name: Install libraries
+        uses: ./.github/actions/setup/macos
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          clean: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 0 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: make sure that kern.coredump=1
+        run: |
+          sysctl -n kern.coredump
+          sudo sysctl -w kern.coredump=1
+          sudo chmod -R +rwx /cores/
+
+      - name: Delete unused SDKs
+        # To free up disk space to not run out during the run
+        run: |
+          sudo rm -rf ~/.dotnet
+          sudo rm -rf /Library/Android
+          sudo rm -rf /Library/Developer/CoreSimulator
+        continue-on-error: true
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc ${ruby_configure_args} ${{ matrix.configure_args }}
+
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+
+      - run: make
+
+      - run: make hello
+
+      - name: runirb
+        run: |
+          echo IRB::VERSION | make runirb RUNOPT="-- -f"
+
+      - name: Set test options for skipped tests
+        run: |
+          set -x
+          TESTS="$(echo "${{ matrix.skipped_tests }}" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|')"
+          echo "TESTS=${TESTS}" >> $GITHUB_ENV
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: ${{ matrix.os }}
+          test-opts: ${{ matrix.test_opts }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: Set extra test options
+        run: |
+          echo "TESTS=$TESTS ${{ matrix.test_opts }}" >> $GITHUB_ENV
+          echo "RUBY_TEST_TIMEOUT_SCALE=10" >> $GITHUB_ENV # With --repeat-count=2, flaky test by timeout occurs frequently for some reason
+        if: matrix.test_opts
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          ulimit -c unlimited
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS="$TESTS"}
+        timeout-minutes: 90
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          PRECHECK_BUNDLED_GEMS: 'no'
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+
+      - name: make skipped tests
+        run: |
+          make -s test-all TESTS="${TESTS//-n!\//-n/}"
+        env:
+          GNUMAKEFLAGS: ''
+          RUBY_TESTOPTS: '-v --tty=no'
+          PRECHECK_BUNDLED_GEMS: 'no'
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+
+      - name: CAPI extensions
+        uses: ./.github/actions/capiext
+        with:
+          builddir: build
+        env:
+          RUBY_TESTOPTS: '-v --tty=no'
+        if: ${{ contains(matrix.extra_checks, 'capi') }}
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.os }} / ${{ matrix.test_task }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-latest
+    needs: [make]
+    steps:
+      - run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/mingw.yml b/.github/workflows/mingw.yml
new file mode 100644
index 0000000000..9a47e70f8c
--- /dev/null
+++ b/.github/workflows/mingw.yml
@@ -0,0 +1,246 @@
+name: MinGW
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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
+
+# Notes:
+# Actions console encoding causes issues, see test-all & test-spec steps
+#
+jobs:
+  make:
+    runs-on: windows-${{ matrix.os }}
+
+    name: ${{ github.workflow }} (${{ matrix.msystem }})
+
+    env:
+      MSYSTEM: ${{ matrix.msystem }}
+      MSYS2_ARCH: >-
+        ${{ case(
+        contains(matrix.msystem, 'arm64'), 'aarch64',
+        contains(matrix.msystem, '64'), 'x86_64',
+        'i686'
+        ) }}
+      MINGW_PACKAGE_PREFIX: >-
+        mingw-w${{
+        case(endsWith(matrix.msystem, '64'), '64', '32')
+        }}-${{ case(
+        startsWith(matrix.msystem, 'clang'), 'clang',
+        startsWith(matrix.msystem, 'ucrt'), 'ucrt',
+        'mingw'
+        ) }}-${{ case(
+        contains(matrix.msystem, 'arm64'), 'aarch64',
+        endsWith(matrix.msystem, '64'), 'x86_64',
+        'i686'
+        ) }}
+      CFLAGS: '-mtune=generic -O3 -pipe'
+      CXXFLAGS: '-mtune=generic -O3 -pipe'
+      CPPFLAGS: '-D_FORTIFY_SOURCE=2 -D__USE_MINGW_ANSI_STDIO=1 -DFD_SETSIZE=2048'
+      LDFLAGS: '-pipe'
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+
+    strategy:
+      matrix:
+        include:
+          # To mitigate flakiness of MinGW CI, we test only one runtime that newer MSYS2 uses.
+          # Ruby 3.2 is the first Windows Ruby to use OpenSSL 3.x
+          - msystem: 'UCRT64'
+            os: 2022
+            test_task: 'check'
+            test-all-opts: '--name=!/TestObjSpace#test_reachable_objects_during_iteration/'
+          - msystem: 'CLANGARM64'
+            os: 11-arm
+            test_task: 'check'
+      fail-fast: false
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/vcpkg'))
+      )}}
+
+    steps:
+      - uses: msys2/setup-msys2@e9898307ac31d1a803454791be09ab9973336e1c # v2.31.1
+        id: msys2
+        with:
+          msystem: ${{ matrix.msystem }}
+          update: true
+          install: >-
+            git
+            make
+            ruby
+            autoconf
+            ${{ env.MINGW_PACKAGE_PREFIX }}-gcc
+            ${{ env.MINGW_PACKAGE_PREFIX }}-ragel
+            ${{ env.MINGW_PACKAGE_PREFIX }}-openssl
+            ${{ env.MINGW_PACKAGE_PREFIX }}-libyaml
+            ${{ env.MINGW_PACKAGE_PREFIX }}-libffi
+
+      - name: Set up env
+        id: setup-env
+        working-directory:
+        run: |
+          $msys2 = ${env:MSYS2_LOCATION}
+          $msystem = ${env:MSYSTEM}.ToLower()
+          echo $msys2\usr\bin $msys2\$msystem\bin |
+            Tee-Object ${env:GITHUB_PATH} -Append -Encoding utf-8
+
+          # Use the fast device for the temporary directory.
+          # %TEMP% is inconsistent with %TMP% and test-all expects they are consistent.
+          # https://github.com/actions/virtual-environments/issues/712#issuecomment-613004302
+          $tmp = ${env:RUNNER_TEMP}
+          echo HOME=$home TMP=$tmp TEMP=$tmp TMPDIR=$tmp |
+            Tee-Object ${env:GITHUB_ENV} -Append -Encoding utf-8
+        shell: pwsh             # cmd.exe does not strip spaces before `|`.
+        env:
+          MSYS2_LOCATION: ${{ steps.msys2.outputs.msys2-location }}
+          MSYSTEM: ${{ matrix.msystem }}
+
+      - name: Remove Strawberry Perl pkg-config
+        working-directory:
+        # `pkg-config.bat` included in Strawberry Perl is written in
+        # Perl and doesn't work when another msys2 `perl` precede its
+        # own `perl`.
+        #
+        # ```
+        # Can't find C:\Strawberry\perl\bin\pkg-config.bat on PATH, '.' not in PATH.
+        # ```
+        run: |
+          Get-Command pkg-config.bat | % { ren $_.path ($_.path + "~") }
+        shell: pwsh
+
+      - name: Misc system & package info
+        working-directory:
+        run: |
+          group() { echo ::group::$'\e[94;1m'"$*"$'\e[m'; }
+          endgroup() { echo ::endgroup::; }
+
+          group Path
+          cygpath -wa / . $(type -p cygpath bash sh)
+          endgroup
+
+          I() {
+              group $1
+              run Where type -pa $1 && { [ $# -eq 1 ] || run Version "$@"; } ||
+                  failed+=($1)
+              endgroup
+          }
+          run() { local w m=$1; shift; w="$("$@")" && show "$m" && indent "$w"; }
+          indent() { [ -z "$1" ] || echo "$1" | /bin/sed '/^$/!s/^/  /'; }
+          show() { echo $'\e[96m'"$*"$'\e[m'; }
+
+          failed=()
+
+          I gcc.exe --version
+          I ragel.exe --version
+          I make.exe --version
+          I openssl.exe version
+          I libcrypto-3-x64.dll
+          I libssl-3-x64.dll
+
+          group Packages
+          pacman -Qs $MINGW_PACKAGE_PREFIX-* | /bin/sed -n "s,local/$MINGW_PACKAGE_PREFIX-,,p"
+          endgroup
+
+          [ ${#failed[@]} -eq 0 ]
+        shell: sh
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: configure
+        run: >
+          ../src/configure --disable-install-doc --prefix=/.
+          --build=$CHOST --host=$CHOST --target=$CHOST
+        shell: sh
+        env:
+          CHOST: ${{ env.MSYS2_ARCH }}-w64-mingw32
+
+      - name: make all
+        timeout-minutes: 30
+        run: make -j4
+
+      - name: make install
+        run: make DESTDIR=../install install-nodoc
+
+      - name: Set up Launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: windows-2022
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          test-tasks: '["test", "test-all", "test-spec"]'
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: test
+        timeout-minutes: 30
+        run: make test test-tool
+        env:
+          GNUMAKEFLAGS: ''
+          RUBY_TESTOPTS: '-v --tty=no'
+        if: ${{ matrix.test_task == 'check' || matrix.test_task == 'test' }}
+
+      - name: test-all
+        timeout-minutes: 45
+        run: |
+          make ${{ StartsWith(matrix.test_task, 'test/') && matrix.test_task || 'test-all' }}
+        env:
+          RUBY_TESTOPTS: >-
+            --retry --job-status=normal --show-skip --timeout-scale=1.5 -j4
+            ${{ matrix.test-all-opts }}
+            ${{ env.TESTS }}
+          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: ./src/.github/actions/slack
+        with:
+          label: ${{ matrix.msystem }} / ${{ matrix.test_task }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: cmd
diff --git a/.github/workflows/modgc.yml b/.github/workflows/modgc.yml
new file mode 100644
index 0000000000..218127aad7
--- /dev/null
+++ b/.github/workflows/modgc.yml
@@ -0,0 +1,179 @@
+name: ModGC
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  check:
+    strategy:
+      matrix:
+        gc:
+          - name: default
+          - name: mmtk
+            mmtk_build: release
+        os: [macos-26, ubuntu-latest]
+        include:
+          - test_task: check
+      fail-fast: false
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUBY_DEBUG: ci
+
+    runs-on: ${{ matrix.os }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - name: Install libraries (macOS)
+        uses: ./.github/actions/setup/macos
+        if: ${{ contains(matrix.os, 'macos') }}
+
+      - name: Install libraries (Ubuntu)
+        uses: ./.github/actions/setup/ubuntu
+        if: ${{ contains(matrix.os, 'ubuntu') }}
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+        if: ${{ contains(matrix.os, 'ubuntu') }}
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          clean: true
+          dummy-files: false
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: make sure that kern.coredump=1
+        run: |
+          sysctl -n kern.coredump
+          sudo sysctl -w kern.coredump=1
+          sudo chmod -R +rwx /cores/
+        if: ${{ contains(matrix.os, 'macos') }}
+
+      - name: Delete unused SDKs
+        # To free up disk space to not run out during the run
+        run: |
+          sudo rm -rf ~/.dotnet
+          sudo rm -rf /Library/Android
+          sudo rm -rf /Library/Developer/CoreSimulator
+        continue-on-error: true
+        if: ${{ contains(matrix.os, 'macos') }}
+
+      - name: Setup Ruby GC Directory
+        run: |
+          echo "MODULAR_GC_DIR=$HOME/ruby_gc" >> $GITHUB_ENV
+
+      - name: Run configure
+        env:
+          arch: ${{ matrix.arch }}
+        run: |
+          ${SETARCH} ../src/configure -C --disable-install-doc --with-modular-gc="${MODULAR_GC_DIR}" \
+          ${arch:+--target=$arch-$OSTYPE --host=$arch-$OSTYPE}
+
+      - uses: actions-rust-lang/setup-rust-toolchain@46268bd060767258de96ed93c1251119784f2ab6 # v1.16.1
+        with:
+          cache-bin: false
+      - name: Set MMTk environment variables
+        run: |
+          echo 'EXCLUDES=../src/test/.excludes-mmtk' >> $GITHUB_ENV
+          echo 'MSPECOPT=-B../src/spec/mmtk.mspec' >> $GITHUB_ENV
+        if: ${{ matrix.gc.name == 'mmtk' }}
+
+      - run: ${SETARCH} make
+
+      - name: Build Modular  GC
+        run: |
+          echo "RUBY_GC_LIBRARY=${{ matrix.gc.name }}" >> $GITHUB_ENV
+          make install-modular-gc MODULAR_GC=${{ matrix.gc.name }} MMTK_BUILD=${{ matrix.gc.mmtk_build }}
+          make distclean-modular-gc MODULAR_GC=${{ matrix.gc.name }}
+
+      - run: ${SETARCH} make hello
+
+      - name: Set test options for skipped tests
+        run: |
+          set -x
+          TESTS="$(echo "${{ matrix.skipped_tests }}" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|')"
+          echo "TESTS=${TESTS}" >> $GITHUB_ENV
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: ${{ matrix.os || 'ubuntu-22.04' }}
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          ${SETARCH} make -s ${{ matrix.test_task }} \
+            ${TESTS:+TESTS="$TESTS"} \
+            ${{ !contains(matrix.test_task, 'bundle') && 'RUBYOPT=-w' || '' }}
+        timeout-minutes: ${{ matrix.gc.timeout || 40 }}
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          PRECHECK_BUNDLED_GEMS: 'no'
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+
+      - name: make skipped tests
+        run: |
+          ${SETARCH} make -s test-all TESTS="${TESTS//-n!\//-n/}"
+        env:
+          GNUMAKEFLAGS: ''
+          RUBY_TESTOPTS: '-v --tty=no'
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }}${{ matrix.arch }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/parse_y.yml b/.github/workflows/parse_y.yml
new file mode 100644
index 0000000000..7c26e87e57
--- /dev/null
+++ b/.github/workflows/parse_y.yml
@@ -0,0 +1,101 @@
+name: parse.y
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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:
+  make:
+    strategy:
+      matrix:
+        include:
+          - test_task: check
+          - 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: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          clean: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc cppflags=-DRUBY_DEBUG --with-parser=parse.y
+
+      - run: make
+
+      - run: make TESTRUN_SCRIPT='-renvutil -v -e "exit EnvUtil.current_parser == %[parse.y]"' run
+        env:
+          RUNOPT0: -I$(tooldir)/lib
+
+      - name: make ${{ matrix.test_task }}
+        run: make -s ${{ matrix.test_task }} RUN_OPTS="$RUN_OPTS" SPECOPTS="$SPECOPTS"
+        env:
+          RUBY_TESTOPTS: ${{ matrix.testopts }}
+          EXCLUDES: '../src/test/.excludes-parsey'
+          RUN_OPTS: ${{ matrix.run_opts || '--parser=parse.y' }}
+          SPECOPTS: ${{ matrix.specopts || '-T --parser=parse.y' }}
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.run_opts }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/post_push.yml b/.github/workflows/post_push.yml
new file mode 100644
index 0000000000..e351c8c286
--- /dev/null
+++ b/.github/workflows/post_push.yml
@@ -0,0 +1,97 @@
+name: Post-push
+on:
+  push:
+    branches:
+      - master
+      - 'ruby_*_*'
+
+permissions:
+  contents: read
+
+jobs:
+  hooks:
+    name: Post-push hooks
+    runs-on: ubuntu-latest
+    if: ${{ github.repository == 'ruby/ruby' }}
+    steps:
+      - name: Sync git.ruby-lang.org
+        id: sync-git
+        continue-on-error: true
+        run: |
+          mkdir -p ~/.ssh
+          (umask 066; printenv RUBY_GIT_SYNC_PRIVATE_KEY > ~/.ssh/id_ed25519)
+          ssh-keyscan -t ed25519 git.ruby-lang.org >> ~/.ssh/known_hosts
+          ssh -i ~/.ssh/id_ed25519 git-sync@git.ruby-lang.org "sudo -u git /home/git/git.ruby-lang.org/bin/update-ruby.sh $GITHUB_REF"
+        env:
+          GITHUB_REF: ${{ github.ref }}
+          RUBY_GIT_SYNC_PRIVATE_KEY: ${{ secrets.RUBY_GIT_SYNC_PRIVATE_KEY }}
+        if: ${{ github.ref == 'refs/heads/master' || startsWith(github.ref, 'refs/heads/ruby_') }}
+
+      - name: Fetch changesets on bugs.ruby-lang.org
+        run: |
+          curl "https://bugs.ruby-lang.org/sys/fetch_changesets?key=${REDMINE_SYS_API_KEY}" -s --fail-with-body -w '* status: %{http_code}\n'
+        env:
+          REDMINE_SYS_API_KEY: ${{ secrets.REDMINE_SYS_API_KEY }}
+        if: ${{ github.ref == 'refs/heads/master' || startsWith(github.ref, 'refs/heads/ruby_') }}
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          fetch-depth: 500 # for notify-slack-commits
+          token: ${{ secrets.MATZBOT_AUTO_UPDATE_TOKEN }}
+
+      - name: Notify commit to Slack
+        run: ruby tool/notify-slack-commits.rb "$GITHUB_OLD_SHA" "$GITHUB_NEW_SHA" refs/heads/master
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.before }}
+          GITHUB_NEW_SHA: ${{ github.event.after }}
+          SLACK_WEBHOOK_URL_ALERTS: ${{ secrets.SLACK_WEBHOOK_URL_ALERTS }}
+          SLACK_WEBHOOK_URL_COMMITS: ${{ secrets.SLACK_WEBHOOK_URL_COMMITS }}
+          SLACK_WEBHOOK_URL_RUBY_JP: ${{ secrets.SLACK_WEBHOOK_URL_RUBY_JP }}
+        if: ${{ github.ref == 'refs/heads/master' }}
+
+      - name: Notify commit to ruby-cvs
+        run: |
+          SENDMAIL="ssh -i ${HOME}/.ssh/id_ed25519 git-sync@git.ruby-lang.org /usr/sbin/sendmail" \
+            ruby tool/commit-email.rb . ruby-cvs@g.ruby-lang.org \
+            "$GITHUB_OLD_SHA" "$GITHUB_NEW_SHA" "$GITHUB_REF" \
+            --viewer-uri "https://github.com/ruby/ruby/commit/" \
+            --error-to cvs-admin@ruby-lang.org
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.before }}
+          GITHUB_NEW_SHA: ${{ github.event.after }}
+          GITHUB_REF: ${{ github.ref }}
+        if: ${{ github.ref == 'refs/heads/master' || startsWith(github.ref, 'refs/heads/ruby_') }}
+
+      - name: Auto-correct code styles
+        run: |
+          set -x
+          ruby tool/auto-style.rb "$GITHUB_OLD_SHA" "$GITHUB_NEW_SHA" refs/heads/master
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.before }}
+          GITHUB_NEW_SHA: ${{ github.event.after }}
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+          EMAIL: svn-admin@ruby-lang.org
+        if: ${{ github.ref == 'refs/heads/master' }}
+
+      - name: Push PR notes to GitHub
+        id: pr-notes
+        continue-on-error: true
+        run: ruby tool/notes-github-pr.rb "$(pwd)/.git" "$GITHUB_OLD_SHA" "$GITHUB_NEW_SHA" refs/heads/master
+        env:
+          GITHUB_OLD_SHA: ${{ github.event.before }}
+          GITHUB_NEW_SHA: ${{ github.event.after }}
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+          EMAIL: svn-admin@ruby-lang.org
+        if: ${{ github.ref == 'refs/heads/master' }}
+
+      - name: Check for failures
+        run: exit 1
+        if: ${{ steps.sync-git.outcome == 'failure' || steps.pr-notes.outcome == 'failure' }}
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/pr-playground.yml b/.github/workflows/pr-playground.yml
new file mode 100644
index 0000000000..dc4f075a38
--- /dev/null
+++ b/.github/workflows/pr-playground.yml
@@ -0,0 +1,131 @@
+name: Post Playground link to PR
+on:
+  pull_request_target:
+    types: [labeled]
+  workflow_run:
+    workflows: ["WebAssembly"]
+    types: [completed]
+
+permissions:
+  contents: read
+  actions: read
+
+jobs:
+  post-summary:
+    name: Post Playground link
+    runs-on: ubuntu-latest
+    permissions:
+      pull-requests: write
+    # Post a comment only if the PR status check is passed and the PR is labeled with `Playground`.
+    # Triggered twice: when the PR is labeled and when PR build is passed.
+    if: >-
+      ${{ false
+      || (true
+        && github.event_name == 'pull_request_target'
+        && contains(github.event.pull_request.labels.*.name, 'Playground'))
+      || (true
+        && github.event_name == 'workflow_run'
+        && github.event.workflow_run.conclusion == 'success'
+        && github.event.workflow_run.event == 'pull_request')
+      }}
+    steps:
+      - uses: actions/github-script@3a2844b7e9c422d3c10d287c895573f7108da1b3 # v9.0.0
+        with:
+          github-token: ${{ secrets.GITHUB_TOKEN }}
+          script: |
+            const fs = require('fs/promises');
+
+            const buildWorkflowPath = '.github/workflows/wasm.yml';
+            const findSuccessfuBuildRun = async (pr) => {
+              const opts = github.rest.actions.listWorkflowRunsForRepo.endpoint.merge({
+                owner: context.repo.owner,
+                repo: context.repo.repo,
+                status: 'success',
+                branch: pr.head.ref,
+              });
+              const runs = await github.paginate(opts);
+              const buildRun = runs.find(run => run.path == buildWorkflowPath);
+              return buildRun;
+            }
+
+            const postComment = async (body, pr) => {
+              const { data: comments } = await github.rest.issues.listComments({
+                owner: context.repo.owner,
+                repo: context.repo.repo,
+                issue_number: pr.number,
+              });
+
+              const commentOpts = { owner: context.repo.owner, repo: context.repo.repo, body: comment };
+
+              const existingComment = comments.find(comment => comment.body.startsWith(magicComment));
+              if (existingComment) {
+                core.info(`Updating existing comment: ${existingComment.html_url}`);
+                await github.rest.issues.updateComment({
+                  ...commentOpts, comment_id: existingComment.id
+                });
+              } else {
+                await github.rest.issues.createComment({
+                  ...commentOpts, issue_number: pr.number
+                });
+              }
+            }
+
+            const derivePRNumber = async () => {
+              if (context.payload.pull_request) {
+                return context.payload.pull_request.number;
+              }
+              // Workaround for https://github.com/orgs/community/discussions/25220
+
+              const { data: { artifacts } } = await github.rest.actions.listWorkflowRunArtifacts({
+                owner: context.repo.owner,
+                repo: context.repo.repo,
+                run_id: context.payload.workflow_run.id,
+              });
+              const artifact = artifacts.find(artifact => artifact.name == 'github-pr-info');
+              if (!artifact) {
+                throw new Error('Cannot find github-pr-info.txt artifact');
+              }
+
+              const { data } = await github.rest.actions.downloadArtifact({
+                owner: context.repo.owner,
+                repo: context.repo.repo,
+                artifact_id: artifact.id,
+                archive_format: 'zip',
+              });
+
+              await fs.writeFile('pr-info.zip', Buffer.from(data));
+              await exec.exec('unzip', ['pr-info.zip']);
+              return await fs.readFile('github-pr-info.txt', 'utf8');
+            }
+
+            const prNumber = await derivePRNumber();
+
+            const { data: pr } = await github.rest.pulls.get({
+              owner: context.repo.owner,
+              repo: context.repo.repo,
+              pull_number: prNumber,
+            });
+
+            core.info(`Checking if the PR ${prNumber} is labeled with Playground...`);
+            if (!pr.labels.some(label => label.name == 'Playground')) {
+              core.info(`The PR is not labeled with Playground.`);
+              return;
+            }
+
+            core.info(`Checking if the build is successful for ${pr.head.ref} in ${pr.head.repo.owner.login}/${pr.head.repo.name}...`);
+            const buildRun = await findSuccessfuBuildRun(pr);
+            if (!buildRun) {
+              core.info(`No successful build run found for ${buildWorkflowPath} on ${pr.head.ref} yet.`);
+              return;
+            }
+            core.info(`Found a successful build run: ${buildRun.html_url}`);
+
+            const runLink = `${process.env.GITHUB_SERVER_URL}/${process.env.GITHUB_REPOSITORY}/actions/runs/${process.env.GITHUB_RUN_ID}`;
+            const magicComment = `<!-- AUTO-GENERATED-COMMENT-PR-PLAYGROUND -->`;
+            const comment = `${magicComment}
+            **Try on Playground**: https://ruby.github.io/play-ruby?run=${buildRun.id}
+            This is an automated comment by [\`pr-playground.yml\`](${runLink}) workflow.
+            `;
+            core.info(`Comment: ${comment}`);
+            await postComment(comment, pr);
+
diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml
new file mode 100644
index 0000000000..5d4a31d287
--- /dev/null
+++ b/.github/workflows/publish.yml
@@ -0,0 +1,114 @@
+name: Publish Ruby packages
+
+on:
+  repository_dispatch:
+    types:
+      - release
+  workflow_dispatch:
+    inputs:
+      version:
+        description: 'Version of the Ruby package to release'
+        required: true
+        default: '4.0.0'
+
+permissions:
+  contents: read
+
+jobs:
+  release:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: 3.3.4
+
+      - name: Store Ruby version
+        env:
+          RUBY_VERSION: ${{ github.event.client_payload.version || github.event.inputs.version }}
+        run: |
+          echo "RUBY_VERSION=${RUBY_VERSION}" >> $GITHUB_ENV
+
+      - name: Store ABI version
+        run: echo "ABI_VERSION=$(echo ${RUBY_VERSION} | cut -d '.' -f 1-2)" >> $GITHUB_ENV
+
+      - name: Copy draft package `/tmp` to `/pub` directory
+        run: tool/release.sh ${RUBY_VERSION}
+        env:
+          AWS_ACCESS_KEY_ID: ${{ secrets.FTP_R_L_O_AWS_ACCESS_KEY_ID }}
+          AWS_SECRET_ACCESS_KEY: ${{ secrets.FTP_R_L_O_AWS_SECRET_ACCESS_KEY }}
+          AWS_DEFAULT_REGION: us-west-2
+
+      - name: Purge URLs of release package
+        run: |
+          curl -X POST \
+            -H "Fastly-Key: ${{ secrets.FASTLY_PURGE_TOKEN }}" \
+            https://api.fastly.com/purge/cache.ruby-lang.org/pub/ruby/${ABI_VERSION}/ruby-${RUBY_VERSION}.tar.gz
+          curl -X POST \
+            -H "Fastly-Key: ${{ secrets.FASTLY_PURGE_TOKEN }}" \
+            https://api.fastly.com/purge/cache.ruby-lang.org/pub/ruby/${ABI_VERSION}/ruby-${RUBY_VERSION}.tar.xz
+          curl -X POST \
+            -H "Fastly-Key: ${{ secrets.FASTLY_PURGE_TOKEN }}" \
+            https://api.fastly.com/purge/cache.ruby-lang.org/pub/ruby/${ABI_VERSION}/ruby-${RUBY_VERSION}.zip
+
+      - name: Create a release on GitHub
+        run: |
+          RELEASE_TAG=$(ruby tool/ruby-version.rb tag "${RUBY_VERSION}")
+          echo $RELEASE_TAG
+          PREVIOUS_RELEASE_TAG=$(ruby tool/ruby-version.rb previous-tag "${RUBY_VERSION}")
+          echo $PREVIOUS_RELEASE_TAG
+          tool/gen-github-release.rb $PREVIOUS_RELEASE_TAG $RELEASE_TAG --no-dry-run
+        env:
+          GITHUB_TOKEN: ${{ secrets.MATZBOT_AUTO_UPDATE_TOKEN }}
+
+      - name: Update versions index
+        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": "update_index"}'
+
+      - name: Build and push Docker images
+        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/docker-images/dispatches \
+            -d "{\"event_type\": \"build\", \"client_payload\": {\"ruby_version\": \"${RUBY_VERSION}\"}}"
+
+      - name: Build snapcraft packages
+        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/snap.ruby/dispatches \
+            -d "{\"event_type\": \"build\", \"client_payload\": {\"ruby_version\": \"${RUBY_VERSION}\"}}"
+
+      - name: Store the latest LTS version of OpenSSL
+        run: |
+          echo "OPENSSL_VERSION=`curl -s https://api.github.com/repos/openssl/openssl/releases | jq -r '.[].tag_name | select(startswith("openssl-3.0"))' | sort -Vr | head -n1 | cut -d'-' -f2`" >> $GITHUB_ENV
+
+      - name: Update ruby-build definition
+        run: |
+          curl -L -X POST \
+            -H "Authorization: Bearer ${{ secrets.RUBY_BUILD_WORKFLOW_TOKEN }}" \
+            -H "Accept: application/vnd.github+json" \
+            -H "X-GitHub-Api-Version: 2022-11-28" \
+            https://api.github.com/repos/rbenv/ruby-build/dispatches \
+            -d "{\"event_type\": \"update-ruby\", \"client_payload\": {\"ruby_version\": \"${RUBY_VERSION}\", \"openssl_version\": \"${OPENSSL_VERSION}\"}}"
+
+      - name: Update all-ruby definition
+        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/all-ruby/dispatches \
+            -d '{"event_type": "update"}'
diff --git a/.github/workflows/release.yml b/.github/workflows/release.yml
new file mode 100644
index 0000000000..a35bcff99a
--- /dev/null
+++ b/.github/workflows/release.yml
@@ -0,0 +1,21 @@
+name: Start release workflow
+on:
+  push:
+    tags:
+      - '*'
+
+permissions:
+  contents: read
+
+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/rust-warnings.yml b/.github/workflows/rust-warnings.yml
new file mode 100644
index 0000000000..7ea7d0c950
--- /dev/null
+++ b/.github/workflows/rust-warnings.yml
@@ -0,0 +1,62 @@
+# Surface Rust warnings on PRs that touch any Rust code.
+# Not a required check so we never block people over new warnings
+# that might come from a new Rust version being released.
+name: Rust warnings
+on:
+  pull_request:
+    types:
+      - opened
+      - synchronize
+      - reopened
+    paths:
+      - '**.rs'
+      - '!**.inc.rs'
+  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:
+  rust-warnings:
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+
+    runs-on: ubuntu-24.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - name: Install Rust
+        run: rustup default beta
+
+      - name: Rust warnings
+        shell: bash
+        run: |
+          set -eu
+          cargo check --quiet --all-features --message-format=json \
+            | jq -r 'select(.message.level | IN("warning", "error")) | .message.rendered' \
+            | tee messages.txt
+          (exit "${PIPESTATUS[0]}") && ! grep --quiet '[^[:space:]]' messages.txt
+
+      - name: "📜 `rustdoc` warnings"
+        shell: bash
+        run: |
+          set -eu
+          cargo doc --document-private-items --all --no-deps --message-format=json \
+            | jq -r 'select(.message.level | IN("warning", "error")) | .message.rendered' \
+            | tee messages.txt
+          (exit "${PIPESTATUS[0]}") && ! grep --quiet '[^[:space:]]' messages.txt
diff --git a/.github/workflows/scorecards.yml b/.github/workflows/scorecards.yml
new file mode 100644
index 0000000000..6dc4a7c6ad
--- /dev/null
+++ b/.github/workflows/scorecards.yml
@@ -0,0 +1,78 @@
+# 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: Scorecard 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: '39 3 * * 5'
+  # push:
+  #   branches: [ "master" ]
+
+# Declare default permissions as read only.
+permissions: read-all
+
+jobs:
+  analysis:
+    name: Scorecard analysis
+    runs-on: ubuntu-latest
+    # `publish_results: true` only works when run from the default branch. conditional can be removed if disabled.
+    if: github.event.repository.default_branch == github.ref_name || github.event_name == 'pull_request'
+    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@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - name: "Run analysis"
+        uses: ossf/scorecard-action@4eaacf0543bb3f2c246792bd56e8cdeffafb205a # v2.4.3
+        with:
+          results_file: results.sarif
+          results_format: sarif
+          # (Optional) "write" 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 Scorecard on a *private* repository
+          # To create the PAT, follow the steps in https://github.com/ossf/scorecard-action?tab=readme-ov-file#authentication-with-fine-grained-pat-optional.
+          # repo_token: ${{ secrets.SCORECARD_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
+
+          # (Optional) Uncomment file_mode if you have a .gitattributes with files marked export-ignore
+          # file_mode: git
+
+      # 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@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+        with:
+          name: SARIF file
+          path: results.sarif
+          retention-days: 5
+
+      # Upload the results to GitHub's code scanning dashboard (optional).
+      # Commenting out will disable upload of results to your repo's Code Scanning dashboard
+      - name: "Upload to code-scanning"
+        uses: github/codeql-action/upload-sarif@8aad20d150bbac5944a9f9d289da16a4b0d87c1e # v4.36.2
+        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..39714b13a4
--- /dev/null
+++ b/.github/workflows/spec_guards.yml
@@ -0,0 +1,68 @@
+name: Rubyspec Version Guards Check
+
+on:
+  push:
+    paths:
+      - '.github/workflows/spec_guards.yml'
+      - 'spec/**'
+      - '!spec/*.md'
+  pull_request:
+    paths:
+      - '.github/workflows/spec_guards.yml'
+      - '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.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == '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.3
+          - ruby-3.4
+          - ruby-4.0
+      fail-fast: false
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.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: ./.github/actions/slack
+        with:
+          label: ${{ matrix.ruby }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
diff --git a/.github/workflows/sync_default_gems.yml b/.github/workflows/sync_default_gems.yml
new file mode 100644
index 0000000000..3aaae5864f
--- /dev/null
+++ b/.github/workflows/sync_default_gems.yml
@@ -0,0 +1,80 @@
+name: Sync default gems
+
+env:
+  DEFAULT_GEM_SYNC_ENABLED: true
+
+on:
+  workflow_dispatch:
+    inputs:
+      gem:
+        required: true
+        description: 'Name of the gem to be synchronized'
+        type: string
+      before:
+        required: true
+        description: 'Gem commit SHA before sync'
+        type: string
+      after:
+        required: true
+        description: 'Gem commit SHA after sync'
+        type: string
+
+permissions:
+  contents: read
+
+jobs:
+  sync_default_gems:
+    name: Sync default gem ${{ github.event.inputs.gem }}
+
+    permissions:
+      contents: write # for Git to git push
+
+    runs-on: ubuntu-latest
+
+    if: ${{ github.repository == 'ruby/ruby' }}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        name: Check out ruby/ruby
+        with:
+          token: ${{ github.repository == 'ruby/ruby' && secrets.MATZBOT_AUTO_UPDATE_TOKEN || secrets.GITHUB_TOKEN }}
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.4'
+          bundler: none
+
+      - name: Run tool/sync_default_gems.rb
+        id: sync
+        run: |
+          ruby_before=$(git rev-parse HEAD)
+          set -x
+          ruby tool/sync_default_gems.rb "${gem_name}" "${gem_before}..${gem_after}"
+          if [[ "$(git rev-parse HEAD)" != "$ruby_before" ]]; then
+            echo update=true >> $GITHUB_OUTPUT
+          fi
+        env:
+          gem_name: ${{ github.event.inputs.gem }}
+          gem_before: ${{ github.event.inputs.before }}
+          gem_after: ${{ github.event.inputs.after }}
+          EMAIL: svn-admin@ruby-lang.org
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+
+      - name: Push
+        run: |
+          git pull --rebase origin ${GITHUB_REF#refs/heads/}
+          git push origin ${GITHUB_REF#refs/heads/}
+        if: ${{ steps.sync.outputs.update && env.DEFAULT_GEM_SYNC_ENABLED == 'true' }}
+        env:
+          EMAIL: svn-admin@ruby-lang.org
+          GIT_AUTHOR_NAME: git
+          GIT_COMMITTER_NAME: git
+
+      - uses: ./.github/actions/slack
+        with:
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+          label: "${{ github.event.inputs.gem }} (<https://github.com/${{ github.event.inputs.gem == 'rubygems' && 'rubygems' || 'ruby' }}/${{ github.event.inputs.gem }}/compare/${{ github.event.inputs.before }}...${{ github.event.inputs.after }}|diff>)"
+          event_name: workflow_dispatch
+          extra_channel_id: C05FPKAU743 # alerts-sync
+        if: ${{ failure() }}
diff --git a/.github/workflows/tarball-macos.yml b/.github/workflows/tarball-macos.yml
new file mode 100644
index 0000000000..0d02cf6ae1
--- /dev/null
+++ b/.github/workflows/tarball-macos.yml
@@ -0,0 +1,101 @@
+name: tarball-macos (reusable)
+
+on:
+  workflow_call:
+    inputs:
+      archname:
+        description: 'archname (e.g. snapshot-master, snapshot-ruby_3_3)'
+        required: true
+        type: string
+      notify-release-channel:
+        description: 'Also send failure notifications to SNAPSHOT_SLACK_WEBHOOK_URL (schedule/release builds).'
+        required: false
+        type: boolean
+        default: false
+    secrets:
+      SIMPLER_ALERTS_URL:
+        required: false
+      SNAPSHOT_SLACK_WEBHOOK_URL:
+        required: false
+
+permissions:
+  contents: read
+
+jobs:
+  macos:
+    strategy:
+      matrix:
+        test_task: [check, test-bundled-gems, test-bundler-parallel]
+        os: [macos-26, macos-15, macos-14]
+        include:
+          - os: macos-15-intel
+            test_task: check
+      fail-fast: false
+    runs-on: ${{ matrix.os }}
+    env:
+      ARCHNAME: ${{ inputs.archname }}
+    steps:
+      - uses: actions/download-artifact@3e5f45b2cfb9172054b4087a40e8e0b5a5461e7c # v8.0.1
+        with:
+          name: Packages
+          path: pkg
+      - name: Extract
+        run: tar xf pkg/*.tar.xz
+      - name: Install libraries
+        run: |
+          with_retry () {
+            "$@" || { sleep 5 && "$@"; } || { sleep 60 && "$@"; }
+          }
+          set -x
+          with_retry brew install gmp libffi openssl zlib autoconf automake libtool libyaml
+      - name: Set ENV
+        run: |
+          echo "JOBS=-j$((1 + $(sysctl -n hw.activecpu)))" >> $GITHUB_ENV
+      - name: configure
+        run: cd "$ARCHNAME/" && ./configure --with-openssl-dir=$(brew --prefix openssl) --with-libyaml-dir=$(brew --prefix libyaml)
+      - name: make
+        run: cd "$ARCHNAME/" && make $JOBS
+      - name: Tests
+        run: cd "$ARCHNAME/" && make $JOBS -s ${{ matrix.test_task }}
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+          RUBY_DEBUG_TEST_NO_REMOTE: "1"
+      # leaked-globals since 2.7
+      - name: Leaked Globals
+        run: cd "$ARCHNAME/" && make -s leaked-globals
+        if: matrix.test_task == 'check'
+      - name: make install without root privilege
+        run: cd "$ARCHNAME/" && make $JOBS install DESTDIR="/tmp/destdir"
+        if: matrix.test_task == 'check'
+      - name: make install
+        run: cd "$ARCHNAME/" && sudo make $JOBS install
+        if: matrix.test_task == 'check'
+      - name: Verify installed binaries
+        run: |
+          /usr/local/bin/ruby -v
+          /usr/local/bin/gem -v
+          /usr/local/bin/bundle -v
+        if: matrix.test_task == 'check'
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout: .github/actions/slack
+          sparse-checkout-cone-mode: false
+          persist-credentials: false
+        if: ${{ failure() }}
+      - uses: ./.github/actions/slack
+        with:
+          label: "${{ matrix.os }} / ${{ matrix.test_task }}"
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+      - uses: ruby/action-slack@d260b61aa817726d5bedd22dd6cc305787fa4cdd # v4.0.0
+        with:
+          payload: |
+            {
+              "attachments": [{
+                "text": "${{ job.status }}: ${{ matrix.os }} / ${{ matrix.test_task }} <https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}|${{ inputs.archname }}>",
+                "color": "danger"
+              }]
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+        if: failure() && inputs.notify-release-channel
diff --git a/.github/workflows/tarball-non-development.yml b/.github/workflows/tarball-non-development.yml
new file mode 100644
index 0000000000..db6230b301
--- /dev/null
+++ b/.github/workflows/tarball-non-development.yml
@@ -0,0 +1,87 @@
+name: tarball-non-development (reusable)
+
+on:
+  workflow_call: {}
+
+permissions:
+  contents: read
+
+jobs:
+  non_development:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - { variant: default,     remove_ruby: false, configure_extra: '' }
+          - { variant: no-ruby,     remove_ruby: true,  configure_extra: '' }
+          - { variant: baseruby-no, remove_ruby: false, configure_extra: '--with-baseruby=no' }
+    runs-on: ubuntu-24.04
+    env:
+      ruby_prefix: /tmp/ruby-snapshot
+    steps:
+      - uses: actions/download-artifact@3e5f45b2cfb9172054b4087a40e8e0b5a5461e7c # v8.0.1
+        with:
+          name: Packages
+          path: pkg
+      - name: Extract
+        run: tar xf pkg/*.tar.xz
+      - name: Substitute patchlevel
+        run: |
+          set -x
+          cd snapshot-*/
+          sed -i.orig 's/^\( *# *define  *RUBY_PATCHLEVEL\)  *-.*/\1 0/' version.h
+          diff -u version.h.orig version.h || :
+          rm -f version.h.orig
+      - 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 zlib1g-dev libffi-dev libgmp-dev bison- autoconf-
+      - name: Remove host ruby
+        if: matrix.remove_ruby
+        run: |
+          set -x
+          sudo apt-get purge -y -q 'ruby*' || :
+          sudo rm -rf /opt/hostedtoolcache/Ruby
+          ! command -v ruby
+      - name: Set ENV
+        run: |
+          echo "JOBS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: configure
+        run: cd snapshot-*/ && ./configure --prefix="${ruby_prefix}" ${{ matrix.configure_extra }}
+      - name: make
+        run: cd snapshot-*/ && make $JOBS
+      - name: Leaked Globals
+        run: cd snapshot-*/ && make -s leaked-globals
+      - name: make install
+        run: cd snapshot-*/ && make $JOBS install
+      - name: Set PATH
+        run: echo "PATH=${ruby_prefix}/bin:$PATH" >> $GITHUB_ENV
+      - name: Check patchlevel
+        id: check-patchlevel
+        run: |
+          exec "${ruby_prefix}/bin/ruby" -vx "$0"
+          #!ruby
+          puts "RUBY_PATCHLEVEL=#{RUBY_PATCHLEVEL.inspect}"
+          abort unless RUBY_PATCHLEVEL >= 0
+        working-directory: ${{ env.ruby_prefix }}
+        continue-on-error: true
+      - name: Check LOADPATH
+        id: check-loadpath
+        run: |
+          exec ${ruby_prefix}/bin/ruby -vx "$0"
+          #!ruby
+          paths = $:.grep(/\+/)
+          pp paths
+          abort unless paths.empty?
+        working-directory: ${{ env.ruby_prefix }}
+        continue-on-error: true
+      - name: Check pathnames
+        id: check-pathnames
+        run: |
+          ! find -name '*+*' | grep +
+        working-directory: ${{ env.ruby_prefix }}
+        continue-on-error: true
+      - name: result
+        run: false
+        if: ${{ contains(steps.*.outcome, 'failure') }}
diff --git a/.github/workflows/tarball-test-schedule.yml b/.github/workflows/tarball-test-schedule.yml
new file mode 100644
index 0000000000..6684b09edb
--- /dev/null
+++ b/.github/workflows/tarball-test-schedule.yml
@@ -0,0 +1,26 @@
+name: tarball-test-schedule
+on:
+  schedule:
+    - cron: '30 18 * * *' # Daily at 18:30 UTC
+  workflow_dispatch:
+
+permissions: {}
+
+jobs:
+  dispatch:
+    if: ${{ github.event_name != 'schedule' || github.repository == 'ruby/ruby' }}
+    runs-on: ubuntu-latest
+    strategy:
+      fail-fast: false
+      matrix:
+        branch:
+          - master
+          - ruby_4_0
+          - ruby_3_4
+          - ruby_3_3
+    steps:
+      - name: Trigger tarball-test on ${{ matrix.branch }}
+        run: gh workflow run tarball-test.yml --ref "$BRANCH" --repo "$GITHUB_REPOSITORY" -f notify-release-channel=true
+        env:
+          BRANCH: ${{ matrix.branch }}
+          GH_TOKEN: ${{ secrets.MATZBOT_GITHUB_ACTION_TOKEN }}
diff --git a/.github/workflows/tarball-test.yml b/.github/workflows/tarball-test.yml
new file mode 100644
index 0000000000..f75d76761a
--- /dev/null
+++ b/.github/workflows/tarball-test.yml
@@ -0,0 +1,104 @@
+name: tarball-test
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  merge_group:
+  workflow_dispatch:
+    inputs:
+      notify-release-channel:
+        description: 'Also send failure notifications to SNAPSHOT_SLACK_WEBHOOK_URL (set by tarball-test-schedule).'
+        type: boolean
+        default: false
+
+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:
+  tarball:
+    runs-on: ubuntu-latest
+    # Cherry-pick to maintenance branches by changing only env.BRANCH below;
+    # archname / branch-label / Materialize all derive from it.
+    env:
+      BRANCH: master
+    outputs:
+      branch: ${{ env.BRANCH }}
+      skip: ${{ steps.skipping.outputs.skip }}
+    steps:
+      - id: skipping
+        run: echo 'skip=true' >> $GITHUB_OUTPUT
+        if: >-
+          ${{(false
+          || contains(github.event.head_commit.message, '[DOC]')
+          || contains(github.event.pull_request.title, '[DOC]')
+          || contains(github.event.pull_request.labels.*.name, 'Documentation')
+          || (github.event.pull_request.user.login == 'dependabot[bot]')
+          )}}
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          fetch-depth: 1 # actions/checkout fetches all heads/tags unless > 0
+          persist-credentials: false
+      # tool/make-snapshot derives the branch name from HEAD and looks up
+      # the upstream during ChangeLog generation. Detached checkouts
+      # (pull_request, merge_group) lack a local branch with tracking, so
+      # pin one to HEAD and connect it to the matching origin ref.
+      - name: Materialize local branch
+        run: |
+          git fetch --no-tags --depth=1 origin "+refs/heads/$BASE:refs/remotes/origin/$BASE"
+          git checkout -B "$BRANCH" HEAD
+          git branch --set-upstream-to="origin/$BASE" "$BRANCH"
+        env:
+          BASE: ${{ github.base_ref || env.BRANCH }}
+      - uses: ./.github/actions/make-snapshot
+        with:
+          archname: snapshot-${{ env.BRANCH }}
+          srcdir: '.'
+
+  ubuntu:
+    needs: tarball
+    if: ${{ ! needs.tarball.outputs.skip }}
+    uses: ./.github/workflows/tarball-ubuntu.yml
+    with:
+      archname: snapshot-${{ needs.tarball.outputs.branch }}
+      notify-release-channel: ${{ github.event_name == 'workflow_dispatch' && inputs.notify-release-channel || false }}
+    secrets:
+      SIMPLER_ALERTS_URL: ${{ secrets.SIMPLER_ALERTS_URL }}
+      SNAPSHOT_SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+
+  macos:
+    needs: tarball
+    if: ${{ ! needs.tarball.outputs.skip }}
+    uses: ./.github/workflows/tarball-macos.yml
+    with:
+      archname: snapshot-${{ needs.tarball.outputs.branch }}
+      notify-release-channel: ${{ github.event_name == 'workflow_dispatch' && inputs.notify-release-channel || false }}
+    secrets:
+      SIMPLER_ALERTS_URL: ${{ secrets.SIMPLER_ALERTS_URL }}
+      SNAPSHOT_SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+
+  windows:
+    needs: tarball
+    if: ${{ ! needs.tarball.outputs.skip }}
+    uses: ./.github/workflows/tarball-windows.yml
+    with:
+      archname: snapshot-${{ needs.tarball.outputs.branch }}
+      notify-release-channel: ${{ github.event_name == 'workflow_dispatch' && inputs.notify-release-channel || false }}
+    secrets:
+      SIMPLER_ALERTS_URL: ${{ secrets.SIMPLER_ALERTS_URL }}
+      SNAPSHOT_SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+
+  non_development:
+    needs: tarball
+    uses: ./.github/workflows/tarball-non-development.yml
diff --git a/.github/workflows/tarball-ubuntu.yml b/.github/workflows/tarball-ubuntu.yml
new file mode 100644
index 0000000000..0482db3c7f
--- /dev/null
+++ b/.github/workflows/tarball-ubuntu.yml
@@ -0,0 +1,151 @@
+name: tarball-ubuntu (reusable)
+
+on:
+  workflow_call:
+    inputs:
+      archname:
+        description: 'archname (e.g. snapshot-master, snapshot-ruby_3_3)'
+        required: true
+        type: string
+      notify-release-channel:
+        description: 'Also send failure notifications to SNAPSHOT_SLACK_WEBHOOK_URL (schedule/release builds).'
+        required: false
+        type: boolean
+        default: false
+    secrets:
+      SIMPLER_ALERTS_URL:
+        required: false
+      SNAPSHOT_SLACK_WEBHOOK_URL:
+        required: false
+
+permissions:
+  contents: read
+
+jobs:
+  ubuntu:
+    strategy:
+      matrix:
+        test_task: [check, test-bundler-parallel, test-bundled-gems]
+        os: [ubuntu-24.04, ubuntu-22.04]
+      fail-fast: false
+    runs-on: ${{ matrix.os }}
+    env:
+      ARCHNAME: ${{ inputs.archname }}
+    steps:
+      - uses: actions/download-artifact@3e5f45b2cfb9172054b4087a40e8e0b5a5461e7c # v8.0.1
+        with:
+          name: Packages
+          path: pkg
+      - name: Extract
+        run: tar xf pkg/*.tar.xz
+      - 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 zlib1g-dev libffi-dev libgmp-dev bison- autoconf-
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.2'
+        # test-bundled-gems requires executable host ruby
+        if: matrix.test_task == 'test-bundled-gems'
+      - name: Fixed world writable dirs
+        run: |
+          mkdir -p $HOME/.local/share
+          mkdir -p $HOME/.cache/gem/specs
+          mkdir -p $HOME/.bundle/cache
+          mkdir -p $HOME/.ssh
+          chmod a-w $HOME/.bundle
+          # chmod a-w $HOME
+          # allow to write $HOME and check stats of HOME around tests (see below)
+          chmod -v a-w $HOME/.config
+          sudo chmod -R a-w /usr/share
+          sudo bash -c 'IFS=:; for d in '"$PATH"'; do chmod -v a-w $d; done' || :
+      - name: Set ENV
+        run: |
+          echo "JOBS=-j$((1 + $(nproc --all)))" >> $GITHUB_ENV
+      - name: configure
+        run: cd "$ARCHNAME/" && ./configure
+      - name: make
+        run: cd "$ARCHNAME/" && make $JOBS
+      - name: Save stats of HOME
+        run: |
+          set -euxo pipefail
+          cat >"$ARCHNAME/save-stats.rb" <<'EOF'
+          require 'pathname'
+          require 'digest'
+          out = []
+          [
+            Dir.home,
+          ].each do |dir|
+            Dir.each_child(dir) do |name|
+              pn = File.join(dir, name)
+              st = File.stat(pn)
+              if st.file?
+                content = Digest::SHA1.file(pn).hexdigest
+              elsif st.directory? && st.nlink <= 10
+                content = Dir.children(pn).sort
+              end
+              out << [pn, "%o"%st.mode, st.nlink, st.uid, st.gid, st.size, content].to_s
+            rescue
+              out << [pn, $!.inspect].to_s
+            end
+          end
+          File.open(ARGV.shift, "w") do |io|
+            io.puts out.sort
+          end
+          EOF
+          make -C "$ARCHNAME" TESTRUN_SCRIPT=save-stats.rb RUNOPT=/tmp/stat-before-tests.txt runruby
+      - name: Tests
+        run: cd "$ARCHNAME/" && make $JOBS -s ${{ matrix.test_task }}
+        env:
+          RUBY_TESTOPTS: "-q --tty=no"
+      # test_sync_default_gems triggers gpg, whose agent processes leave
+      # $HOME/.gnupg around even when GNUPGHOME points elsewhere.
+      - name: Forcibly remove ~/.gnupg
+        run: rm -rf $HOME/.gnupg
+      - name: Diff stats of HOME
+        run: |
+          make -C "$ARCHNAME" TESTRUN_SCRIPT=save-stats.rb RUNOPT=/tmp/stat-after-tests.txt runruby
+          rm -f "$ARCHNAME/save-stats.rb"
+          diff -u /tmp/stat-before-tests.txt /tmp/stat-after-tests.txt
+      # leaked-globals since 2.7
+      - name: Leaked Globals
+        run: cd "$ARCHNAME/" && make -s leaked-globals
+        if: matrix.test_task == 'check'
+      - name: make install without root privilege
+        run: cd "$ARCHNAME/" && make $JOBS install DESTDIR="/tmp/destdir"
+        if: matrix.test_task == 'check'
+      - name: make install
+        run: cd "$ARCHNAME/" && sudo make $JOBS install
+        if: matrix.test_task == 'check'
+      - name: Verify installed binaries
+        run: |
+          /usr/local/bin/ruby -v
+          /usr/local/bin/gem -v
+          /usr/local/bin/bundle -v
+        if: matrix.test_task == 'check'
+      - name: Show .local
+        run: find $HOME/.local -ls
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout: .github/actions/slack
+          sparse-checkout-cone-mode: false
+          persist-credentials: false
+        if: ${{ failure() }}
+      - uses: ./.github/actions/slack
+        with:
+          label: "${{ matrix.os }} / ${{ matrix.test_task }}"
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+      - uses: ruby/action-slack@d260b61aa817726d5bedd22dd6cc305787fa4cdd # v4.0.0
+        with:
+          payload: |
+            {
+              "attachments": [{
+                "text": "${{ job.status }}: ${{ matrix.os }} / ${{ matrix.test_task }} <https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}|${{ inputs.archname }}>",
+                "color": "danger"
+              }]
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+        if: failure() && inputs.notify-release-channel
diff --git a/.github/workflows/tarball-windows.yml b/.github/workflows/tarball-windows.yml
new file mode 100644
index 0000000000..a66cdf729d
--- /dev/null
+++ b/.github/workflows/tarball-windows.yml
@@ -0,0 +1,163 @@
+name: tarball-windows (reusable)
+
+on:
+  workflow_call:
+    inputs:
+      archname:
+        description: 'archname (e.g. snapshot-master)'
+        required: true
+        type: string
+      notify-release-channel:
+        description: 'Also send failure notifications to SNAPSHOT_SLACK_WEBHOOK_URL (schedule/release builds).'
+        required: false
+        type: boolean
+        default: false
+    secrets:
+      SIMPLER_ALERTS_URL:
+        required: false
+      SNAPSHOT_SLACK_WEBHOOK_URL:
+        required: false
+
+permissions:
+  contents: read
+
+jobs:
+  windows:
+    strategy:
+      matrix:
+        include:
+          - os: '2022'
+            test_task: check
+          - os: '2025-vs2026'
+            test_task: check
+      fail-fast: false
+    runs-on: windows-${{ matrix.os }}
+    defaults:
+      run:
+        shell: cmd
+        working-directory: build
+    name: Windows ${{ matrix.os }} (${{ matrix.test_task }})
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{github.ref}}
+      PATCH: C:\msys64\usr\bin\patch.exe
+      OS_VER: windows-${{ matrix.os }}
+      # see https://github.com/ruby/ruby/commit/9ff4399decef0036897d3cfb9ac2c710dea913ca
+      OPENSSL_MODULES: C:\vcpkg\installed\x64-windows\bin
+    steps:
+      - run: md build
+        working-directory:
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.2'
+          bundler: none
+          windows-toolchain: none
+
+      - uses: msys2/setup-msys2@e9898307ac31d1a803454791be09ab9973336e1c # v2.31.1
+        id: setup-msys2
+        with:
+          update: true
+          install: >-
+            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@27d5ce7f107fe9357f9df03efb73ab90386fccae # v5.0.5
+        with:
+          path: C:\vcpkg\installed
+          key: ${{ runner.os }}-vcpkg-installed-${{ env.OS_VER }}-${{ github.sha }}
+          restore-keys: |
+            ${{ runner.os }}-vcpkg-installed-${{ env.OS_VER }}-
+            ${{ runner.os }}-vcpkg-installed-
+      - name: Install libraries with vcpkg
+        run: |
+          vcpkg --triplet x64-windows install gmp libffi libyaml openssl zlib
+
+      - uses: actions/download-artifact@3e5f45b2cfb9172054b4087a40e8e0b5a5461e7c # v8.0.1
+        with:
+          name: Packages
+          path: pkg
+      - name: Extract
+        run: 7z x pkg/*.zip
+        working-directory:
+
+      - uses: actions/cache@27d5ce7f107fe9357f9df03efb73ab90386fccae # v5.0.5
+        with:
+          path: snapshot-*/.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
+        env:
+          ARCHNAME: ${{ inputs.archname }}
+        run: |
+          set > old.env
+          call ..\%ARCHNAME%\win32\vssetup.cmd
+          set TMP=%USERPROFILE%\AppData\Local\Temp
+          set TEMP=%USERPROFILE%\AppData\Local\Temp
+          set /a TEST_JOBS=(15 * %NUMBER_OF_PROCESSORS% / 10) > nul
+          set > new.env
+
+      - name: update env
+        shell: pwsh
+        run: |
+          $old = (Get-Content old.env); $new = (Get-Content new.env)
+          del *.env
+          Compare-Object $old $new |
+            Where-Object { $_.SideIndicator -eq '=>' } |
+            Select-Object -ExpandProperty InputObject |
+            Add-Content -Path $env:GITHUB_ENV
+      - name: link libraries
+        run: |
+          for %%I in (C:\vcpkg\installed\x64-windows\bin\*.dll) do (
+            mklink %%~nxI %%I
+          )
+      - name: Configure
+        env:
+          ARCHNAME: ${{ inputs.archname }}
+        run: >-
+          ../%ARCHNAME%/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: win_bison
+
+      - name: ruby -v
+        run: .\ruby -v
+
+      - run: nmake test
+        timeout-minutes: 5
+
+      - run: nmake ${{ matrix.test_task }}
+        env:
+          RUBY_TESTOPTS: -j${{env.TEST_JOBS}}
+        timeout-minutes: 70
+        continue-on-error: ${{ matrix.continue-on-error || false }}
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout: .github/actions/slack
+          sparse-checkout-cone-mode: false
+          persist-credentials: false
+        if: ${{ failure() }}
+      - uses: ./.github/actions/slack
+        with:
+          label: "${{ env.OS_VER }} / ${{ matrix.test_task }}"
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+      - uses: ruby/action-slack@d260b61aa817726d5bedd22dd6cc305787fa4cdd # v4.0.0
+        with:
+          payload: |
+            {
+              "attachments": [{
+                "text": "${{ job.status }}: ${{ env.OS_VER }} / ${{ matrix.test_task }} <https://github.com/${{ github.repository }}/actions/runs/${{ github.run_id }}|${{ inputs.archname }}>",
+                "color": "danger"
+              }]
+            }
+        env:
+          SLACK_WEBHOOK_URL: ${{ secrets.SNAPSHOT_SLACK_WEBHOOK_URL }}
+        if: failure() && inputs.notify-release-channel
diff --git a/.github/workflows/ubuntu.yml b/.github/workflows/ubuntu.yml
new file mode 100644
index 0000000000..c887ae3811
--- /dev/null
+++ b/.github/workflows/ubuntu.yml
@@ -0,0 +1,275 @@
+name: Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  make:
+    strategy:
+      matrix:
+        # We enumerate every job in matrix.include to save build time
+        include:
+          - test_task: check
+            configure: 'cppflags=-DVM_CHECK_MODE'
+          - test_task: check
+            arch: i686
+          - test_task: check
+            configure: '--disable-yjit'
+          - test_task: check
+            configure: '--enable-shared --enable-load-relative'
+          - test_task: test-bundler-parallel
+            timeout: 50
+          - test_task: test-bundled-gems
+          - test_task: check
+            os: ubuntu-24.04
+            extra_checks: [capi]
+          # ubuntu-24.04-arm jobs don't start on ruby/ruby as of 2025-10-29
+          #- test_task: check
+          #  os: ubuntu-24.04-arm
+      fail-fast: false
+
+    env: &make-env
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUBY_DEBUG: ci
+
+    runs-on: ${{ matrix.os || 'ubuntu-22.04' }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps: &make-steps
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+        with:
+          arch: ${{ matrix.arch }}
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+        if: >-
+          ${{ !endsWith(matrix.os, 'arm')
+          && !endsWith(matrix.os, 'ppc64le') && !endsWith(matrix.os, 's390x') }}
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          clean: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: Run configure
+        env:
+          arch: ${{ matrix.arch }}
+          configure: ${{ matrix.configure }}
+        run: >-
+          $SETARCH ../src/configure -C --disable-install-doc ${configure:- --enable-debug-env cppflags=-DRUBY_DEBUG}
+          ${arch:+--target=$arch-$OSTYPE --host=$arch-$OSTYPE}
+
+      - run: $SETARCH make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+
+      - run: $SETARCH make
+
+      - run: $SETARCH make hello
+
+      - name: runirb
+        run: |
+          echo IRB::VERSION | $SETARCH make runirb RUNOPT="-- -f"
+
+      - name: Set test options for skipped tests
+        run: |
+          set -x
+          TESTS="$(echo "${{ matrix.skipped_tests }}" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|')"
+          echo "TESTS=${TESTS}" >> $GITHUB_ENV
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: ${{ matrix.os || 'ubuntu-22.04' }}
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+        continue-on-error: true
+        timeout-minutes: 3
+
+      # Avoid possible test failures with the zlib applying the following patch
+      # on s390x CPU architecture.
+      # https://github.com/madler/zlib/pull/410
+      - name: Disable DFLTCC
+        run: echo "DFLTCC=0" >> $GITHUB_ENV
+        if: ${{ endsWith(matrix.os, 's390x') }}
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          $SETARCH make -s ${{ matrix.test_task }} \
+          ${TESTS:+TESTS="$TESTS"} \
+          ${{ !contains(matrix.test_task, 'bundle') && 'RUBYOPT=-w' || '' }}
+        timeout-minutes: ${{ matrix.timeout || 40 }}
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          PRECHECK_BUNDLED_GEMS: 'no'
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+
+      - name: make skipped tests
+        run: |
+          $SETARCH make -s test-all TESTS="${TESTS//-n!\//-n/}"
+        env:
+          GNUMAKEFLAGS: ''
+          RUBY_TESTOPTS: '-v --tty=no'
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+
+      - name: test-pc
+        run: |
+          DESTDIR=${RUNNER_TEMP-${TMPDIR-/tmp}}/installed
+          $SETARCH make test-pc "DESTDIR=$DESTDIR"
+
+      - name: CAPI extensions
+        uses: ./.github/actions/capiext
+        with:
+          builddir: build
+          make: '$SETARCH make'
+        env:
+          RUBY_TESTOPTS: '-v --tty=no'
+        if: ${{ contains(matrix.extra_checks, 'capi') }}
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }}${{ matrix.arch }}${{ matrix.os }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  make-ibm:
+    strategy:
+      matrix:
+        include:
+          - test_task: check
+            os: ubuntu-24.04-ppc64le
+          - test_task: check
+            os: ubuntu-24.04-s390x
+      fail-fast: false
+
+    env: *make-env
+
+    runs-on: ${{ matrix.os }}
+
+    if: >-
+      ${{github.repository == 'ruby/ruby'
+      && !(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps: *make-steps
+
+  # Separated from `make` job to avoid making it a required status check
+  ruby-bench:
+    strategy:
+      matrix:
+        include:
+          # Using the same setup as ZJIT jobs
+          - bench_opts: '--warmup=1 --bench=1 --excludes=shipit'
+
+    runs-on: ubuntu-24.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix="$(pwd)/install"
+
+      - run: make install
+
+      - name: Checkout ruby-bench
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          repository: ruby/ruby-bench
+          persist-credentials: false
+          path: ruby-bench
+
+      # If you want to skip failing benchmark, consider using `--excludes`.
+      # e.g. `bench_opts: '--warmup=1 --bench=1 --excludes=railsbench,lobsters'`
+      - name: Run ruby-bench
+        run: ruby run_benchmarks.rb -e "ruby::../build/install/bin/ruby" ${{ matrix.bench_opts }}
+        working-directory: ruby-bench
+        env:
+          BUNDLER_VERSION: 0
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ruby-bench ${{ matrix.bench_opts }} ${{ matrix.ruby_opts }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-latest
+    needs: [make]
+    steps:
+      - run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/wasm.yml b/.github/workflows/wasm.yml
new file mode 100644
index 0000000000..f0263de5ef
--- /dev/null
+++ b/.github/workflows/wasm.yml
@@ -0,0 +1,195 @@
+name: WebAssembly
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  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: # 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: 25
+      WASI_SDK_VERSION_MINOR: 0
+      BINARYEN_VERSION: 113
+      WASMTIME_VERSION: v15.0.0
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - name: Install libraries
+        run: |
+          set -ex
+          sudo apt-get update -q || :
+          sudo apt-get install --no-install-recommends -q -y ruby make autoconf git wget
+
+          wasi_sdk_deb="wasi-sdk-${WASI_SDK_VERSION_MAJOR}.${WASI_SDK_VERSION_MINOR}-x86_64-linux.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 "WASI_SDK_PATH=/opt/wasi-sdk" >> $GITHUB_ENV
+
+      - uses: ./.github/actions/setup/baseruby
+        id: baseruby
+        with:
+          srcdir: src
+
+      - 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-baseruby="${{ steps.baseruby.outputs.ruby }}"
+          --with-dump-ast="${{ steps.baseruby.outputs.dump_ast }}"
+          --with-static-linked-ext
+          --with-ext=${EXTS// /,}
+          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 }}"
+        env:
+          EXTS:
+            cgi/escape
+            continuation
+            coverage
+            date
+            digest
+            digest/*
+            erb/escape
+            etc
+            fcntl
+            json
+            json/*
+            objspace
+            rbconfig/sizeof
+            ripper
+            stringio
+            strscan
+
+      # miniruby may not be built when cross-compling
+      - run: make mini ruby
+
+      - run: make install DESTDIR=$PWD/../install
+      - run: tar cfz ../install.tar.gz -C ../install .
+
+      - name: Upload artifacts
+        uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+        with:
+          name: ruby-wasm-install
+          path: ${{ github.workspace }}/install.tar.gz
+      - name: Show Playground URL to try the build
+        run: |
+          echo "Try on Playground: https://ruby.github.io/play-ruby?run=$GITHUB_RUN_ID" >> $GITHUB_STEP_SUMMARY
+
+      - 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: ./.github/actions/slack
+        with:
+          label: ${{ matrix.entry.name }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+      # Workaround for https://github.com/orgs/community/discussions/25220
+      - name: Save Pull Request number
+        if: ${{ github.event_name == 'pull_request' }}
+        run: echo "${{ github.event.pull_request.number }}" >> ${{ github.workspace }}/github-pr-info.txt
+      - uses: actions/upload-artifact@043fb46d1a93c77aae656e7c1c64a875d1fc6a0a # v7.0.1
+        if: ${{ github.event_name == 'pull_request' }}
+        with:
+          name: github-pr-info
+          path: ${{ github.workspace }}/github-pr-info.txt
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/windows.yml b/.github/workflows/windows.yml
new file mode 100644
index 0000000000..03e75ad445
--- /dev/null
+++ b/.github/workflows/windows.yml
@@ -0,0 +1,217 @@
+name: Windows
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  make:
+    strategy:
+      matrix:
+        include:
+          - os: 2022
+            test_task: check
+          - os: 2022
+            test_task: test-bundled-gems
+          - os: 2025-vs2026
+            test_task: check
+          - os: 2025-vs2026
+            test_task: test-bundled-gems
+          - os: 11-arm
+            test_task: 'btest test-basic test-tool' # check and test-spec are broken yet.
+            target: arm64
+      fail-fast: false
+
+    runs-on: windows-${{ matrix.os }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/vcpkg'))
+      )}}
+
+    name: Windows ${{ matrix.os }} (${{ matrix.test_task }})
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      VCPKG_DEFAULT_TRIPLET: ${{ matrix.target || 'x64' }}-windows
+
+    steps:
+      - run: md build
+        working-directory:
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          # windows-11-arm has only 3.4.1, 3.4.2, 3.4.3, head
+          ruby-version: ${{ !endsWith(matrix.os, 'arm') && '3.1' || '3.4' }}
+          bundler: none
+          windows-toolchain: none
+
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          make-command: nmake
+          clean: true
+
+      - name: Install tools with scoop
+        run: |
+          if ((vcpkg.exe help install) -match "manifest") { exit }
+          Set-ExecutionPolicy -ExecutionPolicy RemoteSigned -Scope CurrentUser
+          iwr -useb get.scoop.sh | iex
+          Join-Path (Resolve-Path ~).Path "scoop\shims" >> $Env:GITHUB_PATH
+          scoop install vcpkg
+        shell: pwsh
+
+      - name: Restore vcpkg artifact
+        id: restore-vcpkg
+        uses: actions/cache/restore@27d5ce7f107fe9357f9df03efb73ab90386fccae # v5.0.5
+        with:
+          path: src\vcpkg_installed
+          key: windows-${{ matrix.os }}-vcpkg-${{ hashFiles('src/vcpkg.json') }}
+
+      - name: Install libraries with vcpkg
+        id: build-vcpkg
+        run: |
+          git -C "%VCPKG_INSTALLATION_ROOT%" pull --quiet
+          vcpkg install
+        working-directory: src
+        if: ${{ ! steps.restore-vcpkg.outputs.cache-hit }}
+
+      - name: Save vcpkg artifact
+        uses: actions/cache/save@27d5ce7f107fe9357f9df03efb73ab90386fccae # v5.0.5
+        with:
+          path: src\vcpkg_installed
+          key: windows-${{ matrix.os }}-vcpkg-${{ hashFiles('src/vcpkg.json') }}
+        if: >-
+          steps.build-vcpkg.outcome == 'success' &&
+          (  github.ref_name == 'master'
+          || startsWith(github.ref_name, 'ruby_')
+          || ( github.event.pull_request.user.login == 'dependabot[bot]'
+          &&   startsWith(github.head_ref || github.ref_name, 'dependabot/vcpkg'))
+          )
+
+      - name: setup env
+        # Available Ruby versions: https://github.com/actions/runner-images/blob/main/images/windows/Windows2019-Readme.md#ruby
+        # %TEMP% is inconsistent with %TMP% and test-all expects they are consistent.
+        # https://github.com/actions/virtual-environments/issues/712#issuecomment-613004302
+        run: |
+          set > old.env
+          call ..\src\win32\vssetup.cmd ^
+            -arch=${{ matrix.target || 'amd64' }} ^
+            ${{ matrix.vcvars && '-vcvars_ver=' || '' }}${{ matrix.vcvars }}
+          nmake -f nul
+          set TMP=%RUNNER_TEMP%
+          set TEMP=%RUNNER_TEMP%
+          set MAKEFLAGS=l
+          set /a TEST_JOBS=(15 * %NUMBER_OF_PROCESSORS% / 10) > nul
+          set RUBY_OPT_DIR=%GITHUB_WORKSPACE:\=/%/src/vcpkg_installed/%VCPKG_DEFAULT_TRIPLET%
+          set > new.env
+
+      - name: update env
+        shell: pwsh
+        run: |
+          $old = (Get-Content old.env); $new = (Get-Content new.env)
+          del *.env
+          Compare-Object $old $new |
+            Where-Object { $_.SideIndicator -eq '=>' } |
+            Select-Object -ExpandProperty InputObject |
+            Add-Content -Path $env:GITHUB_ENV
+
+      - name: baseruby version
+        run: ruby -v
+
+      - name: compiler version
+        run: cl
+
+      - name: volume info
+        run: Get-Volume
+        shell: pwsh
+
+      # TODO: We should use `../src` instead of `D:/a/ruby/ruby/src`
+      - name: Configure
+        run: >-
+          ../src/win32/configure.bat --disable-install-doc
+          --with-opt-dir=%RUBY_OPT_DIR%
+          --with-gmp
+
+      - run: nmake prepare-vcpkg
+
+      - run: nmake incs
+
+      - run: nmake extract-extlibs
+
+      # On all other platforms, test-spec depending on extract-gems (in common.mk) is enough.
+      # But not for this Visual Studio workflow. So here we extract gems before building.
+      - run: nmake extract-gems
+
+      # windows-11-arm runner cannot run `ruby tool/file2lastrev.rb --revision.h --output=revision.h`
+      - name: make revision.h
+        run: |
+          win32\lastrev.bat | win32\ifchange.bat --timestamp=.revision.time revision.h -
+          type revision.h
+        working-directory: src
+
+      - run: nmake
+
+      - name: Set up Launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: windows-${{ matrix.os }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          test-task: ${{ matrix.test_task || 'check' }}
+        continue-on-error: true
+        if: ${{ matrix.test_task != 'test-bundled-gems' }}
+        timeout-minutes: 3
+
+      - run: nmake ${{ matrix.test_task || 'check' }}
+        env:
+          RUBY_TESTOPTS: -j${{ env.TEST_JOBS || 4 }}
+        timeout-minutes: 70
+
+      - uses: ./.github/actions/slack
+        with:
+          label: Windows ${{ matrix.os }} / ${{ matrix.test_task || 'check' }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: windows-2025-vs2026
+    needs: [make]
+    steps:
+      - run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
+    shell: cmd
diff --git a/.github/workflows/wsl.yml b/.github/workflows/wsl.yml
new file mode 100644
index 0000000000..470b68fe66
--- /dev/null
+++ b/.github/workflows/wsl.yml
@@ -0,0 +1,73 @@
+name: Ubuntu on WSL
+
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  merge_group:
+
+permissions:
+  contents: read
+
+jobs:
+  wsl:
+    runs-on: windows-2025-vs2026
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]')
+      )}}
+
+    steps:
+      - name: Install or update WSL
+        uses: Ubuntu/WSL/.github/actions/wsl-install@main
+        with:
+          distro: Ubuntu-24.04
+
+      - name: Install dependencies
+        uses: Ubuntu/WSL/.github/actions/wsl-bash@main
+        with:
+         distro: Ubuntu-24.04
+         working-dir: /tmp/github/
+         exec: |
+            DEBIAN_FRONTEND=noninteractive sudo apt update
+            DEBIAN_FRONTEND=noninteractive sudo apt install -y ruby build-essential autoconf libssl-dev libyaml-dev zlib1g-dev libgmp-dev libffi-dev
+
+      - name: Check out the repository
+        uses: Ubuntu/WSL/.github/actions/wsl-checkout@main
+        with:
+          distro: Ubuntu-24.04
+          working-dir: /tmp/github/
+          submodules: true
+
+      - name: Build
+        uses: Ubuntu/WSL/.github/actions/wsl-bash@main
+        with:
+         distro: Ubuntu-24.04
+         working-dir: /tmp/github/
+         exec: |
+            ./autogen.sh
+            ./configure --disable-install-doc
+            make ruby -j4
+            make extract-gems
+            make -j4
+
+      - name: Test
+        uses: Ubuntu/WSL/.github/actions/wsl-bash@main
+        with:
+         distro: Ubuntu-24.04
+         working-dir: /tmp/github/
+         exec: |
+            ./ruby -v
+            # make check TESTS="-j4" MSPECOPT="-j"
diff --git a/.github/workflows/yjit-macos.yml b/.github/workflows/yjit-macos.yml
new file mode 100644
index 0000000000..e11de6bc51
--- /dev/null
+++ b/.github/workflows/yjit-macos.yml
@@ -0,0 +1,201 @@
+name: YJIT macOS
+on:
+  push:
+    branches:
+      - master
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    types:
+      - opened
+      - synchronize
+      - reopened
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  cargo:
+    name: cargo test
+
+    runs-on: macos-26
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - 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:
+      matrix:
+        include:
+          - test_task: 'check'
+            configure: '--enable-yjit'
+            yjit_opts: '--yjit'
+          - test_task: 'check'
+            configure: '--enable-yjit=dev'
+            yjit_opts: '--yjit-call-threshold=1 --yjit-verify-ctx --yjit-code-gc'
+            specopts: '-T --yjit-call-threshold=1 -T --yjit-verify-ctx -T --yjit-code-gc'
+      fail-fast: false
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUN_OPTS: ${{ matrix.yjit_opts }}
+      SPECOPTS: ${{ matrix.specopts }}
+
+    runs-on: macos-26
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - name: Install libraries
+        uses: ./.github/actions/setup/macos
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc ${{ matrix.configure }}
+
+      - run: make prepare-gems
+        if: ${{ matrix.test_task == 'test-bundled-gems' }}
+
+      - run: make
+
+      - name: Verify that --yjit-dump-disasm works
+        run: |
+          ./miniruby --yjit-call-threshold=1 --yjit-dump-disasm -e0 | \
+          wc -l | \
+          ruby -ne 'raise "Disassembly seems broken in dev build (output has too few lines)" unless $_.to_i > 10'
+        if: ${{ contains(matrix.configure, 'jit=dev') }}
+
+      - name: Set ENV for YJIT
+        run: |
+          echo "RUBY_YJIT_ENABLE=1" >> $GITHUB_ENV
+          echo "RUBY_CRASH_REPORT=$(pwd)/rb_crash_%p.txt" >> $GITHUB_ENV
+
+      - name: Set test options for skipped tests
+        run: |
+          set -x
+          TESTS="$(echo "${{ matrix.skipped_tests }}" | sed 's| |$$/ -n!/|g;s|^|-n!/|;s|$|$$/|')"
+          echo "TESTS=${TESTS}" >> $GITHUB_ENV
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: macos-26
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          is-yjit: true
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          set -x
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS="$TESTS"} \
+            RUN_OPTS="$RUN_OPTS" \
+            SPECOPTS="$SPECOPTS"
+        timeout-minutes: 60
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          SYNTAX_SUGGEST_TIMEOUT: '5'
+          PRECHECK_BUNDLED_GEMS: 'no'
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+        continue-on-error: ${{ matrix.continue-on-test_task || false }}
+
+      - name: make skipped tests
+        run: |
+          make -s test-all TESTS="${TESTS//-n!\//-n/}"
+        env:
+          GNUMAKEFLAGS: ''
+          RUBY_TESTOPTS: '-v --tty=no'
+          PRECHECK_BUNDLED_GEMS: 'no'
+        if: ${{ matrix.test_task == 'check' && matrix.skipped_tests }}
+        continue-on-error: ${{ matrix.continue-on-skipped_tests || false }}
+
+      - name: Dump crash logs
+        if: ${{ failure() }}
+        continue-on-error: true
+        run: |
+          tail --verbose --lines=+1 rb_crash_*.txt
+          exit 1
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }} ${{ matrix.yjit_opts }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-latest
+    needs: [make]
+    steps:
+      - name: ${{ github.workflow }} jobs have failed
+        run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/yjit-ubuntu.yml b/.github/workflows/yjit-ubuntu.yml
new file mode 100644
index 0000000000..ab816940f4
--- /dev/null
+++ b/.github/workflows/yjit-ubuntu.yml
@@ -0,0 +1,245 @@
+name: YJIT Ubuntu
+on:
+  push:
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  cargo:
+    name: cargo test
+
+    # GitHub Action's image seems to already contain a Rust 1.58.0.
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      # 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
+
+  lint:
+    name: cargo clippy
+
+    # GitHub Action's image seems to already contain a Rust 1.58.0.
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      # Check that we don't have linting errors in release mode, too
+      - run: cargo clippy --all-targets --all-features
+        working-directory: yjit
+
+  make:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - test_task: 'yjit-bindgen'
+            hint: 'To fix: use patch in logs'
+            # Build with YJIT+ZJIT for output that works in the most number of configurations
+            configure: '--with-gcc=clang-14 --enable-yjit=dev --enable-zjit'
+            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 --yjit-code-gc'
+            specopts: '-T --yjit-call-threshold=1 -T --yjit-verify-ctx -T --yjit-code-gc'
+
+          - test_task: 'test-bundled-gems'
+            configure: '--enable-yjit=dev'
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUN_OPTS: ${{ matrix.yjit_opts }}
+      YJIT_BENCH_OPTS: ${{ matrix.yjit_bench_opts }}
+      SPECOPTS: ${{ matrix.specopts }}
+      RUBY_DEBUG: ci
+      RUST_BACKTRACE: 1
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: Install Rust
+        if: ${{ matrix.rust_version }}
+        run: rustup install ${{ matrix.rust_version }} --profile minimal
+
+      - name: Remove cargo
+        # Since this tests a `rustc` build for release, remove `cargo` to ensure
+        # that only `rustc` is used.
+        if: ${{ contains(matrix.configure, 'rustc') }}
+        run: sudo rm $(which -a cargo | uniq)
+
+      - 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
+
+      - name: Verify that --yjit-dump-disasm works
+        run: |
+          ./miniruby --yjit-call-threshold=1 --yjit-dump-disasm -e0 | \
+          wc -l | \
+          ruby -ne 'raise "Disassembly seems broken in dev build (output has too few lines)" unless $_.to_i > 10'
+        if: ${{ contains(matrix.configure, 'jit=dev') }}
+
+      - name: Set ENV for YJIT
+        run: |
+          echo "RUBY_YJIT_ENABLE=1" >> $GITHUB_ENV
+          echo "RUBY_CRASH_REPORT=$(pwd)/rb_crash_%p.txt" >> $GITHUB_ENV
+
+      # Check that the binary was built with YJIT
+      - name: Check YJIT enabled
+        run: ./miniruby --yjit -v | grep "+YJIT"
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: ubuntu-22.04
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          is-yjit: true
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          set -x
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS="$TESTS"} \
+            RUN_OPTS="$RUN_OPTS" MSPECOPT=--debug SPECOPTS="$SPECOPTS" \
+            YJIT_BENCH_OPTS="$YJIT_BENCH_OPTS" YJIT_BINDGEN_DIFF_OPTS="$YJIT_BINDGEN_DIFF_OPTS"
+        timeout-minutes: 90
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          PRECHECK_BUNDLED_GEMS: 'no'
+          SYNTAX_SUGGEST_TIMEOUT: '5'
+          YJIT_BINDGEN_DIFF_OPTS: '--exit-code'
+          LIBCLANG_PATH: ${{ matrix.libclang_path }}
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+        continue-on-error: ${{ matrix.continue-on-test_task || false }}
+
+      - name: Dump crash logs
+        if: ${{ failure() }}
+        continue-on-error: true
+        run: |
+          tail --verbose --lines=+1 rb_crash_*.txt
+          exit 1
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-latest
+    needs: [make]
+    steps:
+      - run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/zjit-macos.yml b/.github/workflows/zjit-macos.yml
new file mode 100644
index 0000000000..707e50e36b
--- /dev/null
+++ b/.github/workflows/zjit-macos.yml
@@ -0,0 +1,239 @@
+name: ZJIT macOS
+on:
+  push:
+    branches:
+      - master
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    types:
+      - opened
+      - synchronize
+      - reopened
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  make:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - test_task: 'check'
+            run_opts: '--zjit-call-threshold=1'
+            specopts: '-T --zjit-call-threshold=1'
+            configure: '--enable-zjit=dev'
+
+          - test_task: 'check'
+            run_opts: '--zjit-disable-hir-opt --zjit-call-threshold=1'
+            specopts: '-T --zjit-disable-hir-opt -T --zjit-call-threshold=1'
+            configure: '--enable-zjit=dev'
+
+          - test_task: 'zjit-check' # zjit-test + quick feedback of test_zjit.rb
+            configure: '--enable-yjit=dev --enable-zjit'
+            rust_version: "1.85.0"
+
+          - test_task: 'ruby'
+            hint: 'combo build test'
+            configure: '--enable-yjit --enable-zjit'
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUN_OPTS: ${{ matrix.run_opts }}
+      SPECOPTS: ${{ matrix.specopts }}
+      TESTOPTS: ${{ matrix.testopts }}
+      RUST_BACKTRACE: 1
+      ZJIT_RB_BUG: 1
+
+    runs-on: macos-26
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - name: Install libraries
+        uses: ./.github/actions/setup/macos
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: Install Rust
+        if: ${{ matrix.rust_version }}
+        run: |
+          rustup install ${{ matrix.rust_version }} --profile minimal
+          rustup default ${{ matrix.rust_version }}
+
+      - uses: taiki-e/install-action@4bc351f7f2614e48088386e2a0ad917ca3a7e4ba # v2.81.5
+        with:
+          tool: nextest@0.9
+        if: ${{ matrix.test_task == 'zjit-check' }}
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc ${{ matrix.configure }}
+
+      - run: make
+
+      - name: Verify that --zjit-dump-disasm works
+        run: |
+          ./miniruby --zjit-call-threshold=1 --zjit-dump-disasm -e0 | \
+          wc -l | \
+          ruby -ne 'raise "Disassembly seems broken in dev build (output has too few lines)" unless $_.to_i > 10'
+        if: ${{ contains(matrix.configure, 'jit=dev') }}
+
+      - name: Set ENV for ZJIT
+        run: |
+          echo "RUBY_CRASH_REPORT=$(pwd)/rb_crash_%p.txt" >> $GITHUB_ENV
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: macos-26
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          is-zjit: true
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          set -x
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS="$TESTS"} \
+            RUN_OPTS="$RUN_OPTS" \
+            SPECOPTS="$SPECOPTS" \
+            TESTOPTS="$TESTOPTS"
+        timeout-minutes: 60
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          EXCLUDES: '../src/test/.excludes-zjit'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          SYNTAX_SUGGEST_TIMEOUT: '30'
+          PRECHECK_BUNDLED_GEMS: 'no'
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+        continue-on-error: ${{ matrix.continue-on-test_task || false }}
+
+      - name: Dump crash logs
+        if: ${{ failure() }}
+        continue-on-error: true
+        run: |
+          tail --verbose --lines=+1 rb_crash_*.txt
+          exit 1
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-latest
+    needs: [make]
+    steps:
+      - run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+  # Separated from `make` job to avoid making it a required status check for now
+  ruby-bench:
+    strategy:
+      matrix:
+        include:
+          # Test --call-threshold=2 with 2 iterations in total
+          - ruby_opts: '--zjit-call-threshold=2'
+            bench_opts: '--warmup=1 --bench=1 --excludes=shipit'
+            configure: '--enable-zjit=dev_nodebug' # --enable-zjit=dev is too slow
+
+    runs-on: macos-26
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/macos
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix="$(pwd)/install" ${{ matrix.configure }}
+
+      - run: make install
+
+      # setup/directories set MAKEFLAGS=-j4 for macOS, which randomly fails sqlite3.gem builds
+      - name: Unset MAKEFLAGS
+        run: echo "MAKEFLAGS=" >> "$GITHUB_ENV"
+
+      - name: Checkout ruby-bench
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+          repository: ruby/ruby-bench
+          path: ruby-bench
+
+      # If you want to skip failing benchmark, consider using `--excludes`.
+      # e.g. `bench_opts: '--warmup=1 --bench=1 --excludes=railsbench,lobsters'`
+      - name: Run ruby-bench
+        run: ruby run_benchmarks.rb -e "zjit::../build/install/bin/ruby ${{ matrix.ruby_opts }}" ${{ matrix.bench_opts }}
+        working-directory: ruby-bench
+        env:
+          BUNDLER_VERSION: 0
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ruby-bench ${{ matrix.bench_opts }} ${{ matrix.ruby_opts }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/workflows/zjit-ubuntu.yml b/.github/workflows/zjit-ubuntu.yml
new file mode 100644
index 0000000000..1c3e3f6531
--- /dev/null
+++ b/.github/workflows/zjit-ubuntu.yml
@@ -0,0 +1,293 @@
+name: ZJIT Ubuntu
+on:
+  push:
+    branches:
+      - master
+    paths-ignore:
+      - 'doc/**'
+      - '**/man/*'
+      - '**.md'
+      - '**.rdoc'
+      - '**/.document'
+      - '.*.yml'
+  pull_request:
+    types:
+      - opened
+      - synchronize
+      - reopened
+    # Do not use paths-ignore for required status checks
+    # https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/collaborating-on-repositories-with-code-quality-features/troubleshooting-required-status-checks#handling-skipped-but-required-checks
+  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:
+  lint:
+    name: cargo clippy
+
+    runs-on: ubuntu-22.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - run: cargo clippy --all-targets --all-features
+        working-directory: zjit
+
+  make:
+    strategy:
+      fail-fast: false
+      matrix:
+        include:
+          - test_task: 'check'
+            run_opts: '--zjit-call-threshold=1'
+            specopts: '-T --zjit-call-threshold=1'
+            configure: '--enable-zjit=dev'
+
+          - test_task: 'check'
+            run_opts: '--zjit-disable-hir-opt --zjit-call-threshold=1'
+            specopts: '-T --zjit-disable-hir-opt -T --zjit-call-threshold=1'
+            configure: '--enable-zjit=dev'
+
+            # The optimizer benefits from at least 1 iteration of profiling. Also, many
+            # regression tests in bootstraptest/test_yjit.rb assume call-threshold=2.
+          - test_task: 'btest'
+            run_opts: '--zjit-call-threshold=2'
+            configure: '--enable-zjit=dev'
+
+          - test_task: 'zjit-check' # zjit-test + quick feedback of test_zjit.rb
+            configure: '--enable-yjit --enable-zjit=dev'
+            rust_version: '1.85.0'
+
+          - test_task: 'zjit-bindgen'
+            hint: 'To fix: use patch in logs'
+            # Build with YJIT+ZJIT for output that works in the most number of configurations
+            configure: '--enable-zjit=dev --enable-yjit --with-gcc=clang-16'
+            clang_path: '/usr/bin/clang-16'
+            runs-on: 'ubuntu-24.04' # for clang-16
+
+          - test_task: 'test-bundled-gems'
+            configure: '--enable-zjit=dev'
+            run_opts: '--zjit-call-threshold=1'
+
+    env:
+      GITPULLOPTIONS: --no-tags origin ${{ github.ref }}
+      RUN_OPTS: ${{ matrix.run_opts }}
+      YJIT_BENCH_OPTS: ${{ matrix.yjit_bench_opts }}
+      SPECOPTS: ${{ matrix.specopts }}
+      TESTOPTS: ${{ matrix.testopts }}
+      RUBY_DEBUG: ci
+      BUNDLE_JOBS: 8 # for yjit-bench
+      RUST_BACKTRACE: 1
+      ZJIT_RB_BUG: 1
+
+    runs-on: ${{ matrix.runs-on || 'ubuntu-22.04' }}
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          sparse-checkout-cone-mode: false
+          sparse-checkout: /.github
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ruby/setup-ruby@afeafc3d1ab54a631816aba4c914a0081c12ff2f # v1.310.0
+        with:
+          ruby-version: '3.1'
+          bundler: none
+
+      - uses: taiki-e/install-action@4bc351f7f2614e48088386e2a0ad917ca3a7e4ba # v2.81.5
+        with:
+          tool: nextest@0.9
+        if: ${{ matrix.test_task == 'zjit-check' }}
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+          dummy-files: ${{ matrix.test_task == 'check' }}
+          # Set fetch-depth: 10 so that Launchable can receive commits information.
+          fetch-depth: 10
+
+      - name: Install Rust
+        if: ${{ matrix.rust_version }}
+        run: |
+          rustup install ${{ matrix.rust_version }} --profile minimal
+          rustup default ${{ matrix.rust_version }}
+
+      - name: Install rustfmt
+        if: ${{ matrix.test_task == 'zjit-bindgen' }}
+        run: rustup component add rustfmt
+
+      - 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
+
+      - name: Verify that --zjit-dump-disasm works
+        run: |
+          ./miniruby --zjit-call-threshold=1 --zjit-dump-disasm -e0 | \
+          wc -l | \
+          ruby -ne 'raise "Disassembly seems broken in dev build (output has too few lines)" unless $_.to_i > 10'
+        if: ${{ contains(matrix.configure, 'jit=dev') }}
+
+      # Check that the binary was built with ZJIT
+      - name: Check ZJIT enabled
+        run: ./miniruby --zjit -v | grep "+ZJIT"
+        if: ${{ matrix.configure != '--disable-zjit' }}
+
+      - name: Set ENV for ZJIT
+        run: |
+          echo "RUBY_CRASH_REPORT=$(pwd)/rb_crash_%p.txt" >> $GITHUB_ENV
+
+      - name: Set up Launchable
+        id: launchable
+        uses: ./.github/actions/launchable/setup
+        with:
+          os: ${{ matrix.runs-on || 'ubuntu-22.04' }}
+          test-opts: ${{ matrix.configure }}
+          launchable-token: ${{ secrets.LAUNCHABLE_TOKEN }}
+          builddir: build
+          srcdir: src
+          is-zjit: true
+        continue-on-error: true
+        timeout-minutes: 3
+
+      - name: make ${{ matrix.test_task }}
+        run: |
+          test -n "${LAUNCHABLE_STDOUT}" && exec 1> >(tee "${LAUNCHABLE_STDOUT}")
+          test -n "${LAUNCHABLE_STDERR}" && exec 2> >(tee "${LAUNCHABLE_STDERR}")
+
+          set -x
+          make -s ${{ matrix.test_task }} ${TESTS:+TESTS="$TESTS"} \
+            RUN_OPTS="$RUN_OPTS" MSPECOPT=--debug SPECOPTS="$SPECOPTS" \
+            TESTOPTS="$TESTOPTS" \
+            ZJIT_BINDGEN_DIFF_OPTS="$ZJIT_BINDGEN_DIFF_OPTS"
+        timeout-minutes: 90
+        env:
+          RUBY_TESTOPTS: '-q --tty=no'
+          EXCLUDES: '../src/test/.excludes-zjit'
+          TEST_BUNDLED_GEMS_ALLOW_FAILURES: ''
+          PRECHECK_BUNDLED_GEMS: 'no'
+          SYNTAX_SUGGEST_TIMEOUT: '30'
+          ZJIT_BINDGEN_DIFF_OPTS: '--exit-code'
+          CLANG_PATH: ${{ matrix.clang_path }}
+          LAUNCHABLE_STDOUT: ${{ steps.launchable.outputs.stdout_report_path }}
+          LAUNCHABLE_STDERR: ${{ steps.launchable.outputs.stderr_report_path }}
+        continue-on-error: ${{ matrix.continue-on-test_task || false }}
+
+      - name: Dump crash logs
+        if: ${{ failure() }}
+        continue-on-error: true
+        run: |
+          tail --verbose --lines=+1 rb_crash_*.txt
+          exit 1
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ${{ matrix.test_task }} ${{ matrix.configure }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+  result:
+    if: ${{ always() }}
+    name: ${{ github.workflow }} result
+    runs-on: ubuntu-22.04
+    needs: [make]
+    steps:
+      - name: ${{ github.workflow }} jobs have failed
+        run: exit 1
+        working-directory:
+        if: ${{ contains(needs.*.result, 'failure') || contains(needs.*.result, 'cancelled') }}
+
+  # Separated from `make` job to avoid making it a required status check for now
+  ruby-bench:
+    strategy:
+      matrix:
+        include:
+          # Test --call-threshold=2 with 2 iterations in total
+          - ruby_opts: '--zjit-call-threshold=2'
+            bench_opts: '--warmup=1 --bench=1 --excludes=shipit'
+            configure: '--enable-zjit=dev_nodebug' # --enable-zjit=dev is too slow
+
+    runs-on: ubuntu-24.04
+
+    if: >-
+      ${{!(false
+      || contains(github.event.head_commit.message, '[DOC]')
+      || contains(github.event.pull_request.title, '[DOC]')
+      || contains(github.event.pull_request.labels.*.name, 'Documentation')
+      || (github.event.pull_request.user.login == 'dependabot[bot]' && !startsWith(github.head_ref, 'dependabot/cargo'))
+      )}}
+
+    steps:
+      - uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          persist-credentials: false
+
+      - uses: ./.github/actions/setup/ubuntu
+
+      - uses: ./.github/actions/setup/directories
+        with:
+          srcdir: src
+          builddir: build
+          makeup: true
+
+      - name: Run configure
+        run: ../src/configure -C --disable-install-doc --prefix="$(pwd)/install" ${{ matrix.configure }}
+
+      - run: make install
+
+      - name: Checkout ruby-bench
+        uses: actions/checkout@df4cb1c069e1874edd31b4311f1884172cec0e10 # v6.0.3
+        with:
+          repository: ruby/ruby-bench
+          persist-credentials: false
+          path: ruby-bench
+
+      # If you want to skip failing benchmark, consider using `--excludes`.
+      # e.g. `bench_opts: '--warmup=1 --bench=1 --excludes=railsbench,lobsters'`
+      - name: Run ruby-bench
+        run: ruby run_benchmarks.rb -e "zjit::../build/install/bin/ruby ${{ matrix.ruby_opts }}" ${{ matrix.bench_opts }}
+        working-directory: ruby-bench
+        env:
+          BUNDLER_VERSION: 0
+
+      - uses: ./.github/actions/slack
+        with:
+          label: ruby-bench ${{ matrix.bench_opts }} ${{ matrix.ruby_opts }}
+          SLACK_WEBHOOK_URL: ${{ secrets.SIMPLER_ALERTS_URL }} # ruby-lang slack: ruby/simpler-alerts-bot
+        if: ${{ failure() }}
+
+defaults:
+  run:
+    working-directory: build
diff --git a/.github/zizmor.yml b/.github/zizmor.yml
new file mode 100644
index 0000000000..2a8cad1d5c
--- /dev/null
+++ b/.github/zizmor.yml
@@ -0,0 +1,33 @@
+# Ignore existing findings (baseline)
+# Composite action findings are suppressed inline with # zizmor: ignore
+rules:
+  artipacked:
+    # These jobs push back to the repo and need persisted credentials.
+    ignore:
+      - bundled_gems.yml
+      - default_gems_list.yml
+      - post_push.yml
+      - sync_default_gems.yml
+  dangerous-triggers:
+    ignore:
+      - auto_request_review.yml
+      - auto_review_pr.yml
+      - labeler.yml
+      - pr-playground.yml
+  dependabot-cooldown:
+    ignore:
+      - dependabot.yml
+  misfeature:
+    ignore:
+      - mingw.yml
+      - tarball-windows.yml
+      - windows.yml
+  unpinned-images:
+    ignore:
+      - compilers.yml
+  secrets-outside-env:
+    # All committers with write access are trusted; no need for environment-scoped secrets.
+    disable: true
+  unpinned-uses:
+    ignore:
+      - wsl.yml
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000000..7ead3a81f5
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,291 @@
+*-*-*.def
+*-*-*.exp
+*-*-*.lib
+*.a
+*.bak
+*.bc
+*.bundle
+*.dSYM
+*.dmyh
+*.dylib
+*.elc
+*.i
+*.ii
+*.inc
+*.log
+*.o
+*.o.tmp
+*.obj
+*.old
+*.orig
+*.pch
+*.pdb
+*.rbinc
+*.rbbin
+*.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
+!misc/.vscode
+lcov*.info
+
+# /
+/*-fake.rb
+/*.dll
+/*.exe
+/*.res
+/*.pc
+/*.rc
+/*_prelude.c
+/.downloaded-cache
+/.top-enc.mk
+/build*/
+/COPYING.LIB
+/ChangeLog
+/Doxyfile
+/GNUmakefile
+/README.atheos
+/README.fat-patch
+/README.v6
+/TAGS
+/archive
+/autom4te*.cache
+/automake
+/benchmark/benchmark-driver
+/beos
+/bmlog-*
+/breakpoints.gdb
+/config.cache
+/config.h
+/config.h.in
+/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
+/exts.mk
+/gc/*/exts.mk
+/goruby
+/id.[ch]
+/largefile.h
+/lcov-c-out
+/lcov-rb-out
+/lcov-out
+/lex.c
+/libruby*.*
+/miniprelude.c
+/miniruby
+/newdate.rb
+/newline.c
+/newver.rb
+/parse.c
+/parse.h
+/patches
+/patches-master
+/pitest.rb
+/ppack
+/prelude.c
+/preview
+/probes.dmyh
+/probes.h
+/rbconfig.rb
+/rename2.h
+/repack
+/revision.h
+/revision.tmp
+/ripper.tmp.y
+/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
+/vcpkg_installed
+/transdb.h
+/uncommon.mk
+/verconf.h
+/verconf.mk
+/web
+
+# /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
+!/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/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/eventids1.h
+/ext/ripper/.eventids2-check
+/ext/ripper/eventids2table.c
+/ext/ripper/ripper_init.c
+/ext/ripper/ripper.*
+/ext/ripper/ids1
+/ext/ripper/ids2
+
+# /ext/socket/
+/ext/socket/constants.h
+/ext/socket/constdefs.h
+/ext/socket/constdefs.c
+
+# /gems
+/gems/*.gem
+/gems/src
+/gems/*-*
+
+# /lib/
+/lib/ruby/[1-9]*.*
+/lib/ruby/vendor_ruby
+
+# /misc/
+/misc/**/__pycache__
+
+# for `make test-bundler`
+/.rspec_status
+
+# /tool/
+/tool/config.guess
+/tool/config.sub
+
+# /win32/
+/win32/*.ico
+
+
+# YJIT
+/yjit-bench
+/yjit_exit_locations.dump
+
+# Rust
+/target
+
+# /wasm/
+/wasm/tests/*.wasm
+
+# prism
+/lib/prism/compiler.rb
+/lib/prism/dispatcher.rb
+/lib/prism/dot_visitor.rb
+/lib/prism/dsl.rb
+/lib/prism/inspect_visitor.rb
+/lib/prism/mutation_compiler.rb
+/lib/prism/node.rb
+/lib/prism/reflection.rb
+/lib/prism/serialize.rb
+/lib/prism/visitor.rb
+/prism/internal/diagnostic.h
+/prism/api_node.c
+/prism/ast.h
+/prism/diagnostic.c
+/prism/json.c
+/prism/node.c
+/prism/prettyprint.c
+/prism/serialize.c
+/prism/tokens.c
+/prism/srcs.mk
+/dump_ast
+
+# prism (old file)
+/prism/token_type.c
+
+# tool/update-NEWS-gemlist.rb
+/bundled_gems.json
+/default_gems.json
+/gems/default_gems
+
+# AI agents
+/.claude
+/AGENTS.md
+/CLAUDE.md
diff --git a/.indent.pro b/.indent.pro
new file mode 100644
index 0000000000..1d61cbcad1
--- /dev/null
+++ b/.indent.pro
@@ -0,0 +1,32 @@
+-bap
+-nbbb
+-nbc
+-br
+-brs
+-nbs
+-ncdb
+-nce
+-cdw
+-cli2
+-cbi2
+-ndj
+-ncs
+-nfc1
+-i4
+-l120
+-lp
+-npcs
+-psl
+-sc
+-sob
+-sbi4
+-nut
+-par
+
+-TID
+-TVALUE
+-Tst_data_t
+-Tst_index_t
+-Tst_table
+-Trb_data_type_t
+-TFILE
diff --git a/.mailmap b/.mailmap
new file mode 100644
index 0000000000..213a0f4916
--- /dev/null
+++ b/.mailmap
@@ -0,0 +1,431 @@
+git[bot]                                <svn-admin@ruby-lang.org>
+git[bot]                                <svn-admin@ruby-lang.org> git <svn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+svn[bot]                                <svn-admin@ruby-lang.org> svn <svn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# a_matsuda
+Akira Matsuda                           <ronnie@dio.jp>
+Akira Matsuda                           <ronnie@dio.jp> <a_matsuda@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# aamine
+Minero Aoki                             <aamine@loveruby.net>
+Minero Aoki                             <aamine@loveruby.net> <aamine@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# akira
+akira yamada                            <akira@ruby-lang.org>
+## akira yamada                         <akira@ruby-lang.org> <akira@rice.p.arika.org>
+akira yamada                            <akira@ruby-lang.org> <akira@arika.org>
+akira yamada                            <akira@ruby-lang.org> <akira@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# akiyoshi
+AKIYOSHI, Masamichi                     <masamichi.akiyoshi@hp.com>
+AKIYOSHI, Masamichi                     <masamichi.akiyoshi@hp.com> <akiyoshi@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# akr
+Tanaka Akira                            <akr@fsij.org>
+Tanaka Akira                            <akr@fsij.org> <akr@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# arai
+Koji Arai                               <jca02266@nifty.ne.jp>
+Koji Arai                               <jca02266@nifty.ne.jp> <arai@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# arton
+Akio Tajima                             <artonx@yahoo.co.jp>
+Akio Tajima                             <artonx@yahoo.co.jp> <arton@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# aycabta
+aycabta                                 <aycabta@gmail.com>
+aycabta                                 <aycabta@gmail.com> <aycabta@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ayumin
+Ayumu AIZAWA                            <ayumu.aizawa@gmail.com>
+Ayumu AIZAWA                            <ayumu.aizawa@gmail.com> <ayumin@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# azav
+Alexander Zavorine                      <alexandre.zavorine@nokia.com>
+Alexander Zavorine                      <alexandre.zavorine@nokia.com> <azav@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# charliesome
+Charlie Somerville                      <charliesome@ruby-lang.org>
+Charlie Somerville                      <charliesome@ruby-lang.org> <charliesome@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# dave
+Dave Thomas                             <dave@pragprog.com>
+Dave Thomas                             <dave@pragprog.com> <dave@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# davidflanagan
+David Flanagan                          <davidflanagan@ruby-lang.org>
+David Flanagan                          <davidflanagan@ruby-lang.org> <david@think32>
+David Flanagan                          <davidflanagan@ruby-lang.org> <david@davidflanagan.com>
+David Flanagan                          <davidflanagan@ruby-lang.org> <davidflanagan@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# dblack
+David A. Black                          <dblack@rubypal.com>
+David A. Black                          <dblack@rubypal.com> <dblack@wobblini.net>
+David A. Black                          <dblack@rubypal.com> <dblack@superlink.net>
+David A. Black                          <dblack@rubypal.com> <dblack@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# drbrain
+Eric Hodel                              <drbrain@segment7.net>
+Eric Hodel                              <drbrain@segment7.net> <drbrain@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# duerst
+Martin Dürst                            <duerst@it.aoyama.ac.jp>
+Martin Dürst                            <duerst@it.aoyama.ac.jp> <duerst@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# eban
+WATANABE Hirofumi                       <eban@ruby-lang.org>
+WATANABE Hirofumi                       <eban@ruby-lang.org> <eban@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# emboss
+Martin Bosslet                          <Martin.Bosslet@gmail.com>
+Martin Bosslet                          <Martin.Bosslet@gmail.com> <Martin.Bosslet@googlemail.com>
+Martin Bosslet                          <Martin.Bosslet@gmail.com> <emboss@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# eregon
+Benoit Daloze                           <eregontp@gmail.com>
+Benoit Daloze                           <eregontp@gmail.com> <eregon@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# evan
+Evan Phoenix                            <evan@ruby-lang.org>
+Evan Phoenix                            <evan@ruby-lang.org> <evan@fallingsnow.net>
+Evan Phoenix                            <evan@ruby-lang.org> <evan@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# glass
+Masaki Matsushita                       <glass.saga@gmail.com>
+Masaki Matsushita                       <glass.saga@gmail.com> <glass@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# gogotanaka
+Kazuki Tanaka                           <gogotanaka@ruby-lang.org>
+Kazuki Tanaka                           <gogotanaka@ruby-lang.org> <gogotanaka@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# gotoken
+Kentaro Goto                            <gotoken@gmail.com>
+Kentaro Goto                            <gotoken@gmail.com> <gotoken@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# gotoyuzo
+GOTOU Yuuzou                            <gotoyuzo@notwork.org>
+GOTOU Yuuzou                            <gotoyuzo@notwork.org> <gotoyuzo@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# gsinclair
+Gavin Sinclair                          <gsinclair@soyabean.com.au>
+Gavin Sinclair                          <gsinclair@soyabean.com.au> <gsinclair@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# H_Konishi
+KONISHI Hiromasa                        <konishih@fd6.so-net.ne.jp>
+KONISHI Hiromasa                        <konishih@fd6.so-net.ne.jp> <H_Konishi@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# headius
+Charles Oliver Nutter                   <headius@headius.com>
+Charles Oliver Nutter                   <headius@headius.com> <headius@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# hone
+Terence Lee                             <hone@heroku.com>
+Terence Lee                             <hone@heroku.com> <hone@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# hsbt
+Hiroshi SHIBATA                         <hsbt@ruby-lang.org>
+Hiroshi SHIBATA                         <hsbt@ruby-lang.org> <hsbt@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# iwamatsu
+Nobuhiro Iwamatsu                       <iwamatsu@nigauri.org>
+Nobuhiro Iwamatsu                       <iwamatsu@nigauri.org> <iwamatsu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# jeg2
+James Edward Gray II                    <james@graysoftinc.com>
+James Edward Gray II                    <james@graysoftinc.com> <jeg2@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# jim
+Jim Weirich                             <jim@tardis.local>
+Jim Weirich                             <jim@tardis.local> <jim@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# k0kubun
+Takashi Kokubun                         <takashikkbn@gmail.com>
+Takashi Kokubun                         <takashikkbn@gmail.com> <k0kubun@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kanemoto
+Yutaka Kanemoto                         <kanemoto@ruby-lang.org>
+Yutaka Kanemoto                         <kanemoto@ruby-lang.org> <kanemoto@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# katsu
+UENO Katsuhiro                          <katsu@blue.sky.or.jp>
+UENO Katsuhiro                          <katsu@blue.sky.or.jp> <katsu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kazu
+Kazuhiro NISHIYAMA                      <zn@mbf.nifty.com>
+Kazuhiro NISHIYAMA                      <zn@mbf.nifty.com> <kazu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# keiju
+Keiju Ishitsuka                         <keiju@ishitsuka.com>
+Keiju Ishitsuka                         <keiju@ishitsuka.com> <keiju@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# knu
+Akinori MUSHA                           <knu@iDaemons.org>
+Akinori MUSHA                           <knu@iDaemons.org> <knu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ko1
+Koichi Sasada                           <ko1@atdot.net>
+Koichi Sasada                           <ko1@atdot.net> <ko1@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kosaki
+KOSAKI Motohiro                         <kosaki.motohiro@gmail.com>
+KOSAKI Motohiro                         <kosaki.motohiro@gmail.com> <kosaki@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kosako
+K.Kosako                                <sndgk393@ybb.ne.jp>
+K.Kosako                                <sndgk393@ybb.ne.jp> <kosako@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kou
+Sutou Kouhei                            <kou@clear-code.com>
+Sutou Kouhei                            <kou@clear-code.com> <kou@cozmixng.org>
+Sutou Kouhei                            <kou@clear-code.com> <kou@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# kouji
+Kouji Takao                             <kouji.takao@gmail.com>
+Kouji Takao                             <kouji.takao@gmail.com> <kouji@takao7.net>
+Kouji Takao                             <kouji.takao@gmail.com> <kouji@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ksaito
+Kazuo Saito                             <ksaito@uranus.dti.ne.jp>
+Kazuo Saito                             <ksaito@uranus.dti.ne.jp> <ksaito@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ktsj
+Kazuki Tsujimoto                        <kazuki@callcc.net>
+Kazuki Tsujimoto                        <kazuki@callcc.net> <ktsj@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# luislavena
+Luis Lavena                             <luislavena@gmail.com>
+Luis Lavena                             <luislavena@gmail.com> <luislavena@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# mame
+Yusuke Endoh                            <mame@ruby-lang.org>
+## Yusuke Endoh                         <mame@ruby-lang.org> <mame@tsg.ne.jp>
+Yusuke Endoh                            <mame@ruby-lang.org> <mame@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# marcandre
+Marc-Andre Lafortune                    <github@marc-andre.ca>
+Marc-Andre Lafortune                    <ruby-core@marc-andre.ca>
+Marc-Andre Lafortune                    <ruby-core@marc-andre.ca> <marcandre@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# matz
+Yukihiro "Matz" Matsumoto               <matz@ruby.or.jp>
+Yukihiro "Matz" Matsumoto               <matz@ruby.or.jp> <matz@ruby-lang.org>
+Yukihiro "Matz" Matsumoto               <matz@ruby.or.jp> <matz@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# michal
+Michal Rokos                            <michal@ruby-lang.org>
+Michal Rokos                            <michal@ruby-lang.org> <michal@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# mneumann
+Michael Neumann                         <mneumann@ruby-lang.org>
+Michael Neumann                         <mneumann@ruby-lang.org> <mneumann@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# mrkn
+Kenta Murata                            <mrkn@mrkn.jp>
+Kenta Murata                            <mrkn@mrkn.jp> <muraken@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+Kenta Murata                            <mrkn@mrkn.jp> <3959+mrkn@users.noreply.github.com>
+Kenta Murata                            <mrkn@mrkn.jp> <mrkn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# nagachika
+nagachika                               <nagachika@ruby-lang.org>
+nagachika                               <nagachika@ruby-lang.org> <nagachika@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# nagai
+Hidetoshi NAGAI                         <nagai@ai.kyutech.ac.jp>
+Hidetoshi NAGAI                         <nagai@ai.kyutech.ac.jp> <nagai@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# nahi
+Hiroshi Nakamura                        <nahi@ruby-lang.org>
+Hiroshi Nakamura                        <nahi@ruby-lang.org> <nahi@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# nari
+Narihiro Nakamura                       <authornari@gmail.com>
+Narihiro Nakamura                       <authornari@gmail.com> <nari@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# naruse
+NARUSE, Yui                             <naruse@airemix.jp>
+NARUSE, Yui                             <naruse@airemix.jp> <naruse@ruby-lang.org>
+NARUSE, Yui                             <naruse@airemix.jp> <naruse@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ngoto
+Naohisa Goto                            <ngotogenome@gmail.com>
+Naohisa Goto                            <ngotogenome@gmail.com> <ngoto@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# nobu
+Nobuyoshi Nakada                        <nobu@ruby-lang.org>
+Nobuyoshi Nakada                        <nobu@ruby-lang.org> <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# normal
+Eric Wong                               <normal@ruby-lang.org>
+Eric Wong                               <normal@ruby-lang.org> <e@80x24.org>
+Eric Wong                               <normal@ruby-lang.org> <normal@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ntalbott
+Nathaniel Talbott                       <ntalbott@ruby-lang.org>
+Nathaniel Talbott                       <ntalbott@ruby-lang.org> <ntalbott@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ocean
+Hirokazu Yamamoto                       <ocean@m2.ccsnet.ne.jp>
+Hirokazu Yamamoto                       <ocean@m2.ccsnet.ne.jp> <ocean@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# odaira
+Rei Odaira                              <rodaira@us.ibm.com>
+Rei Odaira                              <rodaira@us.ibm.com> <Rei.Odaira@gmail.com>
+Rei Odaira                              <rodaira@us.ibm.com> <odaira@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# okkez
+okkez                                   <okkez000@gmail.com>
+okkez                                   <okkez000@gmail.com> <okkez@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# rhe
+Kazuki Yamaguchi                        <k@rhe.jp>
+Kazuki Yamaguchi                        <k@rhe.jp> <rhe@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ryan
+Ryan Davis                              <ryand-github@zenspider.com>
+Ryan Davis                              <ryand-github@zenspider.com> <ryand-ruby@zenspider.com>
+Ryan Davis                              <ryand-github@zenspider.com> <ryan@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# samuel
+Samuel Williams                         <samuel.williams@oriontransfer.co.nz>
+Samuel Williams                         <samuel.williams@oriontransfer.co.nz> <samuel@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# seki
+Masatoshi SEKI                          <m_seki@mva.biglobe.ne.jp>
+Masatoshi SEKI                          <m_seki@mva.biglobe.ne.jp> <seki@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ser
+Sean Russell                            <ser@germane-software.com>
+Sean Russell                            <ser@germane-software.com> <ser@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# shigek
+Shigeo Kobayashi                        <shigek@ruby-lang.org>
+Shigeo Kobayashi                        <shigek@ruby-lang.org> <shigek@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# shirosaki
+Hiroshi Shirosaki                       <h.shirosaki@gmail.com>
+Hiroshi Shirosaki                       <h.shirosaki@gmail.com> <shirosaki@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# sho-h
+Sho Hashimoto                           <sho-h@ruby-lang.org>
+Sho Hashimoto                           <sho-h@ruby-lang.org> <sho-h@netlab.jp>
+Sho Hashimoto                           <sho-h@ruby-lang.org> <sho.hsmt@gmail.com>
+Sho Hashimoto                           <sho-h@ruby-lang.org> <sho-h@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# shugo
+Shugo Maeda                             <shugo@ruby-lang.org>
+Shugo Maeda                             <shugo@ruby-lang.org> <shugo@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# shyouhei
+卜部昌平                                    <shyouhei@ruby-lang.org>
+卜部昌平                                    <shyouhei@ruby-lang.org> <shyouhei@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# siena
+Siena.                                  <siena@faculty.chiba-u.jp>
+Siena.                                  <siena@faculty.chiba-u.jp> <siena@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# sonots
+sonots                                  <sonots@gmail.com>
+sonots                                  <sonots@gmail.com> <sonots@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# sorah
+Sorah Fukumori                          <her@sorah.jp>
+Sorah Fukumori                          <her@sorah.jp> <sorah@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# stomar
+Marcus Stollsteimer                     <sto.mar@web.de>
+Marcus Stollsteimer                     <sto.mar@web.de> <stomar@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# suke
+Masaki Suketa                           <masaki.suketa@nifty.ne.jp>
+Masaki Suketa                           <masaki.suketa@nifty.ne.jp> <suke@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# tadd
+Tadashi Saito                           <tad.a.digger@gmail.com>
+Tadashi Saito                           <tad.a.digger@gmail.com> <tadd@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# tadf
+Tadayoshi Funaba                        <tadf@dotrb.org>
+Tadayoshi Funaba                        <tadf@dotrb.org> <tadf@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# takano32
+TAKANO Mitsuhiro                        <takano32@gmail.com>
+TAKANO Mitsuhiro                        <takano32@gmail.com> <takano32@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# tarui
+Masaya Tarui                            <tarui@ruby-lang.org>
+Masaya Tarui                            <tarui@ruby-lang.org> <tarui@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# technorama
+Technorama Ltd.                         <oss-ruby@technorama.net>
+Technorama Ltd.                         <oss-ruby@technorama.net> <technorama@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# tenderlove
+Aaron Patterson                         <tenderlove@ruby-lang.org>
+Aaron Patterson                         <tenderlove@ruby-lang.org> <tenderlove@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# tmm1
+Aman Gupta                              <ruby@tmm1.net>
+Aman Gupta                              <ruby@tmm1.net> <tmm1@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ts
+Guy Decoux                              <ts@moulon.inra.fr>
+Guy Decoux                              <ts@moulon.inra.fr> <ts@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# ttate
+Takaaki Tateishi                        <ttate@ttsky.net>
+## Takaaki Tateishi                     <ttate@ttsky.net> <ttate@kt.jaist.ac.jp>
+Takaaki Tateishi                        <ttate@ttsky.net> <ttate@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# uema2
+Takaaki Uematsu                         <uema2x@jcom.home.ne.jp>
+Takaaki Uematsu                         <uema2x@jcom.home.ne.jp> <uema2@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# usa
+U.Nakamura                              <usa@ruby-lang.org>
+U.Nakamura                              <usa@ruby-lang.org> <usa@garbagecollect.jp>
+U.Nakamura                              <usa@ruby-lang.org> <usa@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# wakou
+Wakou Aoyama                            <wakou@ruby-lang.org>
+Wakou Aoyama                            <wakou@ruby-lang.org> <wakou@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# wanabe
+wanabe                                  <s.wanabe@gmail.com>
+wanabe                                  <s.wanabe@gmail.com> <wanabe@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# watson1978
+Watson                                  <watson1978@gmail.com>
+Watson                                  <watson1978@gmail.com> <watson1978@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# wew
+William Webber                          <william@williamwebber.com>
+William Webber                          <william@williamwebber.com> <wew@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# why
+why the lucky stiff                     <why@ruby-lang.org>
+why the lucky stiff                     <why@ruby-lang.org> <why@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# xibbar
+Takeyuki FUJIOKA                        <xibbar@ruby-lang.org>
+Takeyuki FUJIOKA                        <xibbar@ruby-lang.org> <xibbar@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# yugui
+Yuki Yugui Sonoda                       <yugui@yugui.jp>
+Yuki Yugui Sonoda                       <yugui@yugui.jp> <yugui@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# yui-knk
+yui-knk                                 <spiketeika@gmail.com>
+yui-knk                                 <spiketeika@gmail.com> <yui-knk@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# yuki
+Yuki Nishijima                          <yuki24@hey.com>
+Yuki Nishijima                          <yuki24@hey.com> <mail@yukinishijima.net>
+Yuki Nishijima                          <yuki24@hey.com> <yuki@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# zsombor
+Dee Zsombor                             <zsombor@ruby-lang.org>
+Dee Zsombor                             <zsombor@ruby-lang.org> <zsombor@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
+
+# zzak
+zzak                                    <zzakscott@gmail.com>
+zzak                                    <zzakscott@gmail.com> <zzak@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
diff --git a/.rdoc_options b/.rdoc_options
new file mode 100644
index 0000000000..5172911e16
--- /dev/null
+++ b/.rdoc_options
@@ -0,0 +1,37 @@
+---
+page_dir: doc
+main_page: index.md
+title: Documentation for Ruby development version
+visibility: :private
+rdoc_include:
+- doc
+
+exclude:
+- \.gemspec\z
+- lib/set/subclass_compatible.rb
+
+autolink_excluded_words:
+- Box
+- Class
+- Method
+- Module
+- Process
+- RDoc
+- Ruby
+- Set
+- ZJIT
+- YJIT
+
+canonical_root: https://docs.ruby-lang.org/en/master
+
+footer_content:
+  Ruby:
+    Documentation: index.html
+    Official Website: https://www.ruby-lang.org/
+    Playground: https://ruby.github.io/play-ruby/
+  Resources:
+    GitHub: https://github.com/ruby/ruby
+    Issue Tracker: https://bugs.ruby-lang.org/projects/ruby-master/issues
+    RubyGems: https://rubygems.org/
+  Community:
+    X: https://x.com/rubylangorg
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/BSDL b/BSDL
new file mode 100644
index 0000000000..66d93598aa
--- /dev/null
+++ b/BSDL
@@ -0,0 +1,22 @@
+Copyright (C) 1993-2013 Yukihiro Matsumoto. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
new file mode 100644
index 0000000000..35e79dd3b9
--- /dev/null
+++ b/CONTRIBUTING.md
@@ -0,0 +1 @@
+See ["Contributing to Ruby"](https://docs.ruby-lang.org/en/master/contributing/contributing_md.html), which includes setup and build instructions.
diff --git a/COPYING b/COPYING
index eeb586b392..428ce03ed7 100644
--- a/COPYING
+++ b/COPYING
@@ -1,340 +1,58 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
+{日本語}[rdoc-ref:COPYING.ja]
 
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
+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:
 
-			    Preamble
+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.
 
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
+2. You may modify your copy of the software in any way, provided that
+   you do at least ONE of the following:
 
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
+   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.
 
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
+   b. use the modified software only within your corporation or
+      organization.
 
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
+   d. make other distribution arrangements with the author.
 
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
+3. You may distribute the software in object code or binary form,
+   provided that you do at least ONE of the following:
 
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
+   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.
 
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+   b. accompany the distribution with the machine-readable source of
+      the software.
 
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
+   c. give non-standard binaries non-standard names, with
+      instructions on where to get the original software distribution.
 
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
+   d. make other distribution arrangements with the author.
 
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
+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.
 
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
+   For the list of those files and their copying conditions, see the
+   file LEGAL.
 
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
+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.
 
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) 19yy  <name of author>
-
-    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 of the License, 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.
-
-    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
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) 19yy name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
+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
new file mode 100644
index 0000000000..5de2dbcc8f
--- /dev/null
+++ b/COPYING.ja
@@ -0,0 +1,53 @@
+{English}[rdoc-ref:COPYING]
+
+本プログラムはフリーソフトウェアです．2-clause BSDL
+または以下に示す条件で本プログラムを再配布できます
+2-clause BSDLについてはBSDLファイルを参照して下さい．
+
+1. 複製は制限なく自由です．
+
+2. 以下の条件のいずれかを満たす時に本プログラムのソースを
+   自由に変更できます．
+
+   a.  ネットニューズにポストしたり，作者に変更を送付する
+       などの方法で，変更を公開する．
+
+   b.  変更した本プログラムを自分の所属する組織内部だけで
+       使う．
+
+   c.  変更点を明示したうえ，ソフトウェアの名前を変更する．
+       そのソフトウェアを配布する時には変更前の本プログラ
+       ムも同時に配布する．または変更前の本プログラムのソー
+       スの入手法を明示する．
+
+   d.  その他の変更条件を作者と合意する．
+
+3. 以下の条件のいずれかを満たす時に本プログラムをコンパイ
+   ルしたオブジェクトコードや実行形式でも配布できます．
+
+   a.  バイナリを受け取った人がソースを入手できるように，
+       ソースの入手法を明示する．
+
+   b.  機械可読なソースコードを添付する．
+
+   c.  変更を行ったバイナリは名前を変更したうえ，オリジナ
+       ルのソースコードの入手法を明示する．
+
+   d.  その他の配布条件を作者と合意する．
+
+4. 他のプログラムへの引用はいかなる目的であれ自由です．た
+   だし，本プログラムに含まれる他の作者によるコードは，そ
+   れぞれの作者の意向による制限が加えられる場合があります．
+
+   それらファイルの一覧とそれぞれの配布条件などに付いては
+   LEGALファイルを参照してください．
+
+5. 本プログラムへの入力となるスクリプトおよび，本プログラ
+   ムからの出力の権利は本プログラムの作者ではなく，それぞ
+   れの入出力を生成した人に属します．また，本プログラムに
+   組み込まれるための拡張ライブラリについても同様です．
+
+6. 本プログラムは無保証です．作者は本プログラムをサポート
+   する意志はありますが，プログラム自身のバグあるいは本プ
+   ログラムの実行などから発生するいかなる損害に対しても責
+   任を持ちません．
diff --git a/Cargo.lock b/Cargo.lock
new file mode 100644
index 0000000000..2108276e72
--- /dev/null
+++ b/Cargo.lock
@@ -0,0 +1,766 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "anyhow"
+version = "1.0.100"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a23eb6b1614318a8071c9b2521f36b424b2c83db5eb3a0fead4a6c0809af6e61"
+
+[[package]]
+name = "autocfg"
+version = "1.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c08606f8c3cbf4ce6ec8e28fb0014a2c086708fe954eaa885384a6165172e7e8"
+
+[[package]]
+name = "bitflags"
+version = "1.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bef38d45163c2f1dde094a7dfd33ccf595c92905c8f8f4fdc18d06fb1037718a"
+
+[[package]]
+name = "bitflags"
+version = "2.11.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "843867be96c8daad0d758b57df9392b6d8d271134fce549de6ce169ff98a92af"
+
+[[package]]
+name = "capstone"
+version = "0.14.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f442ae0f2f3f1b923334b4a5386c95c69c1cfa072bafa23d6fae6d9682eb1dd4"
+dependencies = [
+ "capstone-sys",
+ "static_assertions",
+]
+
+[[package]]
+name = "capstone-sys"
+version = "0.18.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a4e8087cab6731295f5a2a2bd82989ba4f41d3a428aab2e7c98d8f4db38aac05"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "cc"
+version = "1.0.94"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "17f6e324229dc011159fcc089755d1e2e216a90d43a7dea6853ca740b84f35e7"
+
+[[package]]
+name = "cfg-if"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9330f8b2ff13f34540b44e946ef35111825727b38d33286ef986142615121801"
+
+[[package]]
+name = "chacha20"
+version = "0.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6f8d983286843e49675a4b7a2d174efe136dc93a18d69130dd18198a6c167601"
+dependencies = [
+ "cfg-if",
+ "cpufeatures",
+ "rand_core",
+]
+
+[[package]]
+name = "console"
+version = "0.16.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d64e8af5551369d19cf50138de61f1c42074ab970f74e99be916646777f8fc87"
+dependencies = [
+ "encode_unicode",
+ "libc",
+ "windows-sys 0.61.2",
+]
+
+[[package]]
+name = "cpufeatures"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8b2a41393f66f16b0823bb79094d54ac5fbd34ab292ddafb9a0456ac9f87d201"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "encode_unicode"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "34aa73646ffb006b8f5147f3dc182bd4bcb190227ce861fc4a4844bf8e3cb2c0"
+
+[[package]]
+name = "equivalent"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "877a4ace8713b0bcf2a4e7eec82529c029f1d0619886d18145fea96c3ffe5c0f"
+
+[[package]]
+name = "errno"
+version = "0.3.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "39cab71617ae0d63f51a36d69f866391735b51691dbda63cf6f96d042b63efeb"
+dependencies = [
+ "libc",
+ "windows-sys 0.52.0",
+]
+
+[[package]]
+name = "fastrand"
+version = "1.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e51093e27b0797c359783294ca4f0a911c270184cb10f85783b118614a1501be"
+dependencies = [
+ "instant",
+]
+
+[[package]]
+name = "foldhash"
+version = "0.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a0d2fde1f7b3d48b8395d5f2de76c18a528bd6a9cdde438df747bfcba3e05d6f"
+
+[[package]]
+name = "getrandom"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0de51e6874e94e7bf76d726fc5d13ba782deca734ff60d5bb2fb2607c7406555"
+dependencies = [
+ "cfg-if",
+ "libc",
+ "r-efi",
+ "rand_core",
+ "wasip2",
+ "wasip3",
+]
+
+[[package]]
+name = "hashbrown"
+version = "0.15.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9229cfe53dfd69f0609a49f65461bd93001ea1ef889cd5529dd176593f5338a1"
+dependencies = [
+ "foldhash",
+]
+
+[[package]]
+name = "hashbrown"
+version = "0.16.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "841d1cc9bed7f9236f321df977030373f4a4163ae1a7dbfe1a51a2c1a51d9100"
+
+[[package]]
+name = "heck"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea"
+
+[[package]]
+name = "hermit-abi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d231dfb89cfffdbc30e7fc41579ed6066ad03abda9e567ccafae602b97ec5024"
+
+[[package]]
+name = "id-arena"
+version = "2.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3d3067d79b975e8844ca9eb072e16b31c3c1c36928edf9c6789548c524d0d954"
+
+[[package]]
+name = "indexmap"
+version = "2.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7714e70437a7dc3ac8eb7e6f8df75fd8eb422675fc7678aff7364301092b1017"
+dependencies = [
+ "equivalent",
+ "hashbrown 0.16.1",
+ "serde",
+ "serde_core",
+]
+
+[[package]]
+name = "insta"
+version = "1.47.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7b4a6248eb93a4401ed2f37dfe8ea592d3cf05b7cf4f8efa867b6895af7e094e"
+dependencies = [
+ "console",
+ "once_cell",
+ "similar",
+ "tempfile",
+]
+
+[[package]]
+name = "instant"
+version = "0.1.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e0242819d153cba4b4b05a5a8f2a7e9bbf97b6055b2a002b395c96b5ff3c0222"
+dependencies = [
+ "cfg-if",
+]
+
+[[package]]
+name = "io-lifetimes"
+version = "1.0.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "eae7b9aee968036d54dce06cebaefd919e4472e753296daccd6d344e3e2df0c2"
+dependencies = [
+ "hermit-abi",
+ "libc",
+ "windows-sys 0.48.0",
+]
+
+[[package]]
+name = "itoa"
+version = "1.0.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4a5f13b858c8d314ee3e8f639011f7ccefe71f97f96e50151fb991f267928e2c"
+
+[[package]]
+name = "jit"
+version = "0.1.0"
+
+[[package]]
+name = "leb128fmt"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09edd9e8b54e49e587e4f6295a7d29c3ea94d469cb40ab8ca70b288248a81db2"
+
+[[package]]
+name = "libc"
+version = "0.2.163"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1fdaeca4cf44ed4ac623e86ef41f056e848dbeab7ec043ecb7326ba300b36fd0"
+
+[[package]]
+name = "linux-raw-sys"
+version = "0.3.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ef53942eb7bf7ff43a617b3e2c1c4a5ecf5944a7c1bc12d7ee39bbb15e5c1519"
+
+[[package]]
+name = "log"
+version = "0.4.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "518ef76f2f87365916b142844c16d8fefd85039bc5699050210a7778ee1cd1de"
+
+[[package]]
+name = "memchr"
+version = "2.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "76fc44e2588d5b436dbc3c6cf62aef290f90dab6235744a93dfe1cc18f451e2c"
+
+[[package]]
+name = "once_cell"
+version = "1.21.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9f7c3e4beb33f85d45ae3e3a1792185706c8e16d043238c593331cc7cd313b50"
+
+[[package]]
+name = "prettyplease"
+version = "0.2.37"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "479ca8adacdd7ce8f1fb39ce9ecccbfe93a3f1344b3d0d97f20bc0196208f62b"
+dependencies = [
+ "proc-macro2",
+ "syn",
+]
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "89ae43fd86e4158d6db51ad8e2b80f313af9cc74f5c0e03ccb87de09998732de"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.40"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1885c039570dc00dcb4ff087a89e185fd56bae234ddc7f056a945bf36467248d"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "r-efi"
+version = "6.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f8dcc9c7d52a811697d2151c701e0d08956f92b0e24136cf4cf27b57a6a0d9bf"
+
+[[package]]
+name = "rand"
+version = "0.10.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2e8e8bcc7961af1fdac401278c6a831614941f6164ee3bf4ce61b7edb162207"
+dependencies = [
+ "chacha20",
+ "getrandom",
+ "rand_core",
+]
+
+[[package]]
+name = "rand_core"
+version = "0.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0c8d0fd677905edcbeedbf2edb6494d676f0e98d54d5cf9bda0b061cb8fb8aba"
+
+[[package]]
+name = "redox_syscall"
+version = "0.3.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "567664f262709473930a4bf9e51bf2ebf3348f2e748ccc50dea20646858f8f29"
+dependencies = [
+ "bitflags 1.3.2",
+]
+
+[[package]]
+name = "ruby"
+version = "0.0.0"
+dependencies = [
+ "yjit",
+ "zjit",
+]
+
+[[package]]
+name = "rustix"
+version = "0.37.28"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "519165d378b97752ca44bbe15047d5d3409e875f39327546b42ac81d7e18c1b6"
+dependencies = [
+ "bitflags 1.3.2",
+ "errno",
+ "io-lifetimes",
+ "libc",
+ "linux-raw-sys",
+ "windows-sys 0.48.0",
+]
+
+[[package]]
+name = "ryu"
+version = "1.0.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "28d3b2b1366ec20994f1fd18c3c594f05c5dd4bc44d8bb0c1c632c8d6829481f"
+
+[[package]]
+name = "semver"
+version = "1.0.26"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56e6fa9c48d24d85fb3de5ad847117517440f6beceb7798af16b4a87d616b8d0"
+
+[[package]]
+name = "serde"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a8e94ea7f378bd32cbbd37198a4a91436180c5bb472411e48b5ec2e2124ae9e"
+dependencies = [
+ "serde_core",
+]
+
+[[package]]
+name = "serde_core"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "41d385c7d4ca58e59fc732af25c3983b67ac852c1a25000afe1175de458b67ad"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.228"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d540f220d3187173da220f885ab66608367b6574e925011a9353e4badda91d79"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "serde_json"
+version = "1.0.143"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d401abef1d108fbd9cbaebc3e46611f4b1021f714a0597a71f41ee463f5f4a5a"
+dependencies = [
+ "itoa",
+ "memchr",
+ "ryu",
+ "serde",
+]
+
+[[package]]
+name = "similar"
+version = "2.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "32fea41aca09ee824cc9724996433064c89f7777e60762749a4170a14abbfa21"
+
+[[package]]
+name = "static_assertions"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2eb9349b6444b326872e140eb1cf5e7c522154d69e7a0ffb0fb81c06b37543f"
+
+[[package]]
+name = "syn"
+version = "2.0.117"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e665b8803e7b1d2a727f4023456bbbbe74da67099c585258af0ad9c5013b9b99"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "tempfile"
+version = "3.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "31c0432476357e58790aaa47a8efb0c5138f137343f3b5f23bd36a27e3b0a6d6"
+dependencies = [
+ "autocfg",
+ "cfg-if",
+ "fastrand",
+ "redox_syscall",
+ "rustix",
+ "windows-sys 0.48.0",
+]
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9312f7c4f6ff9069b165498234ce8be658059c6728633667c526e27dc2cf1df5"
+
+[[package]]
+name = "unicode-xid"
+version = "0.2.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ebc1c04c71510c7f702b52b7c350734c9ff1295c464a03335b00bb84fc54f853"
+
+[[package]]
+name = "wasip2"
+version = "1.0.1+wasi-0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0562428422c63773dad2c345a1882263bbf4d65cf3f42e90921f787ef5ad58e7"
+dependencies = [
+ "wit-bindgen 0.46.0",
+]
+
+[[package]]
+name = "wasip3"
+version = "0.4.0+wasi-0.3.0-rc-2026-01-06"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5428f8bf88ea5ddc08faddef2ac4a67e390b88186c703ce6dbd955e1c145aca5"
+dependencies = [
+ "wit-bindgen 0.51.0",
+]
+
+[[package]]
+name = "wasm-encoder"
+version = "0.244.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "990065f2fe63003fe337b932cfb5e3b80e0b4d0f5ff650e6985b1048f62c8319"
+dependencies = [
+ "leb128fmt",
+ "wasmparser",
+]
+
+[[package]]
+name = "wasm-metadata"
+version = "0.244.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bb0e353e6a2fbdc176932bbaab493762eb1255a7900fe0fea1a2f96c296cc909"
+dependencies = [
+ "anyhow",
+ "indexmap",
+ "wasm-encoder",
+ "wasmparser",
+]
+
+[[package]]
+name = "wasmparser"
+version = "0.244.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "47b807c72e1bac69382b3a6fb3dbe8ea4c0ed87ff5629b8685ae6b9a611028fe"
+dependencies = [
+ "bitflags 2.11.0",
+ "hashbrown 0.15.5",
+ "indexmap",
+ "semver",
+]
+
+[[package]]
+name = "windows-link"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f0805222e57f7521d6a62e36fa9163bc891acd422f971defe97d64e70d0a4fe5"
+
+[[package]]
+name = "windows-sys"
+version = "0.48.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "677d2418bec65e3338edb076e806bc1ec15693c5d0104683f2efe857f61056a9"
+dependencies = [
+ "windows-targets 0.48.5",
+]
+
+[[package]]
+name = "windows-sys"
+version = "0.52.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "282be5f36a8ce781fad8c8ae18fa3f9beff57ec1b52cb3de0789201425d9a33d"
+dependencies = [
+ "windows-targets 0.52.6",
+]
+
+[[package]]
+name = "windows-sys"
+version = "0.61.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ae137229bcbd6cdf0f7b80a31df61766145077ddf49416a728b02cb3921ff3fc"
+dependencies = [
+ "windows-link",
+]
+
+[[package]]
+name = "windows-targets"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a2fa6e2155d7247be68c096456083145c183cbbbc2764150dda45a87197940c"
+dependencies = [
+ "windows_aarch64_gnullvm 0.48.5",
+ "windows_aarch64_msvc 0.48.5",
+ "windows_i686_gnu 0.48.5",
+ "windows_i686_msvc 0.48.5",
+ "windows_x86_64_gnu 0.48.5",
+ "windows_x86_64_gnullvm 0.48.5",
+ "windows_x86_64_msvc 0.48.5",
+]
+
+[[package]]
+name = "windows-targets"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9b724f72796e036ab90c1021d4780d4d3d648aca59e491e6b98e725b84e99973"
+dependencies = [
+ "windows_aarch64_gnullvm 0.52.6",
+ "windows_aarch64_msvc 0.52.6",
+ "windows_i686_gnu 0.52.6",
+ "windows_i686_gnullvm",
+ "windows_i686_msvc 0.52.6",
+ "windows_x86_64_gnu 0.52.6",
+ "windows_x86_64_gnullvm 0.52.6",
+ "windows_x86_64_msvc 0.52.6",
+]
+
+[[package]]
+name = "windows_aarch64_gnullvm"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2b38e32f0abccf9987a4e3079dfb67dcd799fb61361e53e2882c3cbaf0d905d8"
+
+[[package]]
+name = "windows_aarch64_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "32a4622180e7a0ec044bb555404c800bc9fd9ec262ec147edd5989ccd0c02cd3"
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dc35310971f3b2dbbf3f0690a219f40e2d9afcf64f9ab7cc1be722937c26b4bc"
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09ec2a7bb152e2252b53fa7803150007879548bc709c039df7627cabbd05d469"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a75915e7def60c94dcef72200b9a8e58e5091744960da64ec734a6c6e9b3743e"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e9b5ad5ab802e97eb8e295ac6720e509ee4c243f69d781394014ebfe8bbfa0b"
+
+[[package]]
+name = "windows_i686_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0eee52d38c090b3caa76c563b86c3a4bd71ef1a819287c19d586d7334ae8ed66"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8f55c233f70c4b27f66c523580f78f1004e8b5a8b659e05a4eb49d4166cca406"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "240948bc05c5e7c6dabba28bf89d89ffce3e303022809e73deaefe4f6ec56c66"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "53d40abd2583d23e4718fddf1ebec84dbff8381c07cae67ff7768bbf19c6718e"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "147a5c80aabfbf0c7d901cb5895d1de30ef2907eb21fbbab29ca94c5b08b1a78"
+
+[[package]]
+name = "windows_x86_64_gnullvm"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b7b52767868a23d5bab768e390dc5f5c55825b6d30b86c844ff2dc7414044cc"
+
+[[package]]
+name = "windows_x86_64_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "24d5b23dc417412679681396f2b49f3de8c1473deb516bd34410872eff51ed0d"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.48.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ed94fce61571a4006852b7389a063ab983c02eb1bb37b47f8272ce92d06d9538"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "589f6da84c646204747d1270a2a5661ea66ed1cced2631d546fdfb155959f9ec"
+
+[[package]]
+name = "wit-bindgen"
+version = "0.46.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f17a85883d4e6d00e8a97c586de764dabcc06133f7f1d55dce5cdc070ad7fe59"
+
+[[package]]
+name = "wit-bindgen"
+version = "0.51.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d7249219f66ced02969388cf2bb044a09756a083d0fab1e566056b04d9fbcaa5"
+dependencies = [
+ "wit-bindgen-rust-macro",
+]
+
+[[package]]
+name = "wit-bindgen-core"
+version = "0.51.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ea61de684c3ea68cb082b7a88508a8b27fcc8b797d738bfc99a82facf1d752dc"
+dependencies = [
+ "anyhow",
+ "heck",
+ "wit-parser",
+]
+
+[[package]]
+name = "wit-bindgen-rust"
+version = "0.51.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b7c566e0f4b284dd6561c786d9cb0142da491f46a9fbed79ea69cdad5db17f21"
+dependencies = [
+ "anyhow",
+ "heck",
+ "indexmap",
+ "prettyplease",
+ "syn",
+ "wasm-metadata",
+ "wit-bindgen-core",
+ "wit-component",
+]
+
+[[package]]
+name = "wit-bindgen-rust-macro"
+version = "0.51.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0c0f9bfd77e6a48eccf51359e3ae77140a7f50b1e2ebfe62422d8afdaffab17a"
+dependencies = [
+ "anyhow",
+ "prettyplease",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wit-bindgen-core",
+ "wit-bindgen-rust",
+]
+
+[[package]]
+name = "wit-component"
+version = "0.244.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9d66ea20e9553b30172b5e831994e35fbde2d165325bec84fc43dbf6f4eb9cb2"
+dependencies = [
+ "anyhow",
+ "bitflags 2.11.0",
+ "indexmap",
+ "log",
+ "serde",
+ "serde_derive",
+ "serde_json",
+ "wasm-encoder",
+ "wasm-metadata",
+ "wasmparser",
+ "wit-parser",
+]
+
+[[package]]
+name = "wit-parser"
+version = "0.244.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ecc8ac4bc1dc3381b7f59c34f00b67e18f910c2c0f50015669dde7def656a736"
+dependencies = [
+ "anyhow",
+ "id-arena",
+ "indexmap",
+ "log",
+ "semver",
+ "serde",
+ "serde_derive",
+ "serde_json",
+ "unicode-xid",
+ "wasmparser",
+]
+
+[[package]]
+name = "yjit"
+version = "0.1.0"
+dependencies = [
+ "capstone",
+ "jit",
+]
+
+[[package]]
+name = "zjit"
+version = "0.0.1"
+dependencies = [
+ "capstone",
+ "insta",
+ "jit",
+ "rand",
+ "yjit",
+]
diff --git a/Cargo.toml b/Cargo.toml
new file mode 100644
index 0000000000..33010e65fb
--- /dev/null
+++ b/Cargo.toml
@@ -0,0 +1,64 @@
+# This is the root Cargo [workspace](https://doc.rust-lang.org/cargo/reference/workspaces.html)
+# and the root package for all the rust code that are statically linked into ruby. Rust tooling
+# limitations means all Rust code need to share a single archive library (staticlib) at the
+# integration point with non-rust code. (See rustlang/rust#44322 and #104707 for a taste of
+# the linking challenges.)
+#
+# Do not add required dependencies. This is a policy that helps downstream consumers and give
+# us tight control over what we ship. All of the optional dependencies are used exclusively
+# during development.
+#
+# Release builds avoid Cargo entirely because offline builds can fail even when none of the
+# optional dependencies are built (rust-lang/cargo#10352).
+
+[workspace]
+members = ["zjit", "yjit", "jit"]
+
+[package]
+name = "ruby"
+version = "0.0.0"
+edition = "2024"
+rust-version = "1.85.0"
+publish = false # Don't publish to crates.io
+
+[dependencies]
+yjit = { path = "yjit", optional = true }
+zjit = { path = "zjit", optional = true }
+
+[lib]
+crate-type = ["staticlib"]
+path = "ruby.rs"
+
+[features]
+disasm = ["yjit?/disasm", "zjit?/disasm"]
+runtime_checks = ["yjit?/runtime_checks", "zjit?/runtime_checks"]
+yjit = [ "dep:yjit" ]
+zjit = [ "dep:zjit" ]
+
+[profile.dev]
+opt-level = 1 # On 0, functions use so much stack space that we get stray `SystemStackError`s
+debug = true
+debug-assertions = true
+overflow-checks = true
+
+[profile.test]
+inherits = "dev"
+opt-level = 0
+
+[profile.dev_nodebug]
+inherits = "dev"
+
+[profile.stats]
+inherits = "release"
+
+[profile.release]
+# NOTE: --enable-yjit and zjit builds use `rustc` without going through Cargo. You
+# might want to update the `rustc` invocation if you change this profile.
+opt-level = 3
+# The extra robustness that comes from checking for arithmetic overflow is
+# worth the performance cost for the compiler.
+overflow-checks = true
+# Generate debug info
+debug = true
+# Use ThinLTO. Much smaller output for a small amount of build time increase.
+lto = "thin"
diff --git a/ChangeLog b/ChangeLog
deleted file mode 100644
index 9a70f640ea..0000000000
--- a/ChangeLog
+++ /dev/null
@@ -1,8102 +0,0 @@
-Fri Aug 25 15:24:39 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* variable.c (rb_cvar_get): should not follow __attached__.
-
-	* variable.c (mod_av_set): second class variable assignment at the
-	  toplevel shoule not give warning.
-
-Fri Aug 25 01:18:36 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* io.c (next_argv): prepare path for open file.
-
-	* string.c (rb_str_setter): moved from io.c.
-
-	* io.c (next_argv): filename should be "-" for refreshed ARGF.
-
-Thu Aug 24 15:27:39 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/socket/socketport.h: use `extern int h_errno' if needed.
-
-Sat Aug 19 01:34:02 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/sdbm/_sdbm.c (sdbm_prep): flags should be or-ed by O_BINARY on
-	  Win32 too.
-
-	* ext/sdbm/_sdbm.c (makroom): fill hole with 0 on Win32 too.
-
-Fri Aug 18 13:23:59 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (rb_eval): should preserve and clear $! value before
-	  compilation. 
-
-	* eval.c (eval): ditto.
-
-Fri Aug 18 11:06:19 2000  Shugo Maeda  <shugo@ruby-lang.org>
-
-	* ext/socket/socket.c (s_accept): start GC on EMFILE/ENFILE.
-
-Thu Aug 17 16:04:48 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (is_defined): should clear ruby_errinfo.
-
-Thu Aug 17 04:26:31 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.27.
-
-	* lib/net/protocol.rb: writing methods returns written byte size.
-
-	* lib/net/smtp.rb: send_mail accepts many destinations.
-
-Wed Aug 16 00:43:47 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* time.c (time_s_times): use CLK_TCK for HZ if it's defined.
-
-Tue Aug 15 17:30:59 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (frame_dup): should set flag FRAME_MALLOC after
-	  argv allocation.
-
-	* eval.c (blk_free): should not free argv if GC was called before
-	  frame_dup.
-
-Tue Aug 15 16:08:40 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: add ac_cv_func_times=yes for mingw32.
-
-	* win32/win32.c (mytimes): typo.
-
-Tue Aug 15 01:45:28 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* io.c (argf_eof): should return true at the end of ARGF without
-	  checking stdout if arguments are given.
-
-Mon Aug 14 10:34:32 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (rb_thread_status): status should return false for normal
-	  termination, nil for termination by exception.
-
-Fri Aug 11 15:43:46 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (rb_undef): give warning for undefining __id__, __send__.
-
-Thu Aug 10 08:05:03 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (rb_callcc): returned current thread instaed of
-	  continuation wrongly.
-
-Thu Aug 10 05:40:28 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/extmk.rb.in: $CPPFLAGS should be initialized.
-
-	* ext/tcltklib/depend: add stubs.o.
-
-	* ext/tcltklib/extconf.rb: use $CPPFLAGS instead of $CFLAGS.
-
-Wed Aug  9 16:31:48 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* eval.c (rb_callcc): thread status for continuations must be
-	  THREAD_KILLED, otherwise thread_free() breaks other threads.
-
-Wed Aug  9 13:24:25 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* win32/win32.[ch]: emulate rename(2).
-
-Tue Aug  8 14:01:46 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/tcltklib/tcltklib.c: support --enable-tcltk_stubs
-
-	* ext/tcltklib/extconf.rb: ditto.
-
-	* ext/tcltklib/stubs.c: created. examine candidate shared libraries.
-
-Mon Aug  7 13:59:12 2000  Yukihiro Matsumoto  <matz@ruby-lang.org>
-
-	* ruby.h (CLONESETUP): should copy flags before any potential
-	  object allocation.
-
-	* regex.c (re_match): check for stack depth was needed.
-
-Sat Aug  5 16:43:43 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* djgpp/*: convert DOS line endings to UNIX style.
-
-	* djgpp/config.status: rename to config.sed for SFN.
-
-	* lib/ftools.rb (compare, safe_unlink, chmod): avoid warnings.
-
-	* lib/ftools.rb (move): typo. not `tpath', but `to'.
-
-Fri Aug  4 23:26:48 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (proc_call): gives warning if a block is supplied.
-
-	* eval.c (rb_eval): no warning for discarding if an alias for the
-	  method is already made.
-
-Fri Aug  4 16:32:29 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_reject_bang): returns nil if no element removed.
-
-	* hash.c (rb_hash_reject_bang): returns nil if no element removed.
-
-Thu Aug  3 19:44:26 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_fd_writable): should return integer value.
-
-	* array.c (rb_ary_assoc): search array element whose length is
-	  longer than 0 (not 1).
-
-Wed Aug  2 18:27:47 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_wait_fd): prohibit thread context switch
-	  during compilation.
-
-	* eval.c (rb_cont_call): prohibit Continuation#call across threads.
-
-Wed Aug  2 08:22:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (rb_gc): clear malloc_memories to zero, to avoid potential
-	  super frequent GC invocation. (ruby-bugs:#PR48)
-
-	* gc.c (rb_gc): only add_heap() if GC trigger condition is
-	  satisfied.
-
-Tue Aug  1 16:41:58 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (proc_options): global load path setting moved from
-	  ruby_prog_init().
-
-	* ruby.c (incpush): renamed.  push path entry at the END of the
-	  load path array.  This makes -I directories sorted in order in
-	  the arguments.
-
-Sat Jul 29 23:42:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (dir_each): should check whether dir is closed during the
-	  block execution. (ruby-bugs:#PR47)
-
-Sat Jul 29 21:57:30 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ruby.c (rubylib_mangle): provide another buffer for the result.
-
-Wed Jul 26 10:09:01 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: set SOLIBS to LIBS on Cygwin.
-
-	* configure.in: LIBRUBY_SO='$(RUBY_INSTALL_NAME)'.$target_os.dll
-	  on cygwin and mingw32. ruby-cygwin.dll is bad. why?
-
-Wed Jul 26 10:04:03 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (gc_sweep): avoid full scan during compilation.
-
-	* gc.c (rb_gc): add heap during no gc period (including
-	  compilation).
-
-Tue Jul 25 19:03:04 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* cygwin/GNUmakefile: use puts instead of print, because
-	  Cygwin DLL's behavior is changed(or bug?).
-
-	* configure.in: LIBRUBY_SO='$(RUBY_INSTALL_NAME)'-$target_os.dll
-	  on cygwin and mingw32.
-
-	* cygwin/GNUmakefile: ditto.
-
-	* Makefile.in: $(SOLIBS) should be put after dmyext.@OBJEXT@.
-
-	* instruby.rb: install $(LIBRUBY) to libdir
-	  if $(LIBRUBY) != $(LIBRUBY_A_).
-
-Tue Jul 25 15:16:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_p): redirect to $defout.
-
-Mon Jul 24 18:52:55 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* win32/win32.c (win32_getenv): should remove `static'.
-
-	* ruby.c (rubylib_mangle): support "/hoge;/foo"
-
-Mon Jul 24 10:28:55 2000  GOTO Kentaro  <gotoken@math.sci.hokudai.ac.jp>
-
-	* string.c (rb_str_count): raise exception if no argument is
-	  given.
-
-Sun Jul 23 12:55:04 2000  Dave Thomas  <Dave@Thomases.com>
-
-	* string.c (rb_str_rindex): Support negative end position.
-
-Fri Jul 21 17:35:01 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (aref_args): command_call now be permitted as
-	  aref_args.
-
-	* process.c (proc_getpriority): getpriority(2) may return valid
-	  negative number.  use errno to detect error.
-
-	* marshal.c (dump_ensure): dumped string should be tainted if
-	  any among target objects is tainted.
-
-	* marshal.c (r_regist): restored object should be tainted if and
-	  only if the source is a file or a tainted string.
-
-Wed Jul 19 15:14:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (bigdivrem): should use rb_int2big(), not rb_uint2big().
-
-Tue Jul 18 14:58:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (ruby_options): should treat SystemExit etc. properly.
-
-	* parse.y (yycompile): should check compile_for_eval, not
-	  ruby_in_eval.
-
-Mon Jul 17 04:29:50 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/mkmf.rb: converts extention of $objs into $OBJEXT.
-
-Sun Jul 16 03:02:34 2000  Dave Thomas <dave@thomases.com>
-
-	* lib/weakref.rb: Change to use new ObjectSpace calls.
-
-Sat Jul 15 21:59:58 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): should not redefine __id__ nor __send__.
-
-	* gc.c (define_final): integrate final.rb features into the
-	  interpreter.  define_finalizer and undefine_finalizer was
-	  added to ObjectSpace.  plus, add_finalizer, remove_finalizer,
-	  and call_finalizer are deprecated now.
-
-Sat Jul 15 01:32:34 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_mod_method): implements unbound method.
-
-	* eval.c (Init_eval): should prohibit `module_function' for class
-	  Class.
-
-Fri Jul 14 17:19:59 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* cygwin/GNUmakefile.in: use miniruby instead of sed.
-
-Fri Jul 14 12:49:50 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (argf_eof): need to check stdin, when next_p == -1.
-
-	* io.c (read_all): use io_fread() instead of fread(3).
-
-	* io.c (io_reopen): should clearerr FILE if fd < 3.
-
-	* re.c (rb_reg_match_m): the result is exported, so it should be
-	  declared as busy.
-
-	* eval.c (rb_eval): should preserve errinfo even if return, break,
-	  etc. is called in rescue clause.
-
-	* instruby.rb: install irb too.
-
-Wed Jul 12 15:32:57 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_const_get): constants for builtin classes must
-	  have higher priority than constants from included modules at
-	  Object class.
-
-	* bignum.c (bigdivrem): small embarrassing typo.
-
-Wed Jul 12 15:06:28 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): use rb_const_get_at().
-
-	* variable.c (top_const_get): retrieve toplevel constants only,
-	  not ones of Object (and its included modules) in general.
-
-Wed Jul 12 15:04:11 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.26.
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb:
-	  add module Net::NetPrivate and its inner classes
-	  {Read,Write}Adapter, Command, Socket,
-	  SMTPCommand, POP3Command, APOPCommand, HTTPCommand
-
-Wed Jul 12 13:10:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (bigdivrem): defer bignorm().
-
-	* bignum.c (bignorm): accepts accidental fixnums.
-
-Tue Jul 11 16:54:17 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): `@<digit>' is no longer a valid instance
-	  variable name.
-
-Tue Jul 11 01:51:50 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (rb_big_divmod): should not use Integer(float) for
-	  the right operand.
-
-	* bignum.c (rb_big_remainder): ditto.
-
-	* bignum.c (rb_big_modulo): ditto.
-
-Mon Jul 10 15:27:16 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c (pipe_finalize): should set rb_last_status when pclose().
-
-Mon Jul 10 09:07:54 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (rb_bug): print version number and such too.
-
-Sat Jul  8 23:08:40 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_start_0): should copy previous scopes to
-	  prevent rb_gc_force_recylce().
-
-Fri Jul  7 23:36:36 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/addrinfo.h: move IN_EXPERIMENTAL and IN_LOOPBACKNET
-	  definitions to ext/socket/sockport.h.
-
-	* ext/socket/extconf.rb: add getservbyport() and arpa/inet.h check.
-
-	* ext/socket/getaddrinfo.c (getaddrinfo): SOCK_RAW may not be
-	  defined (ex. BeOS, Palm OS 2.x or before).
-
-	* ext/socket/getnameinfo.c (getnameinfo): getservbyport() may not
-	  exist (ex. BeOS, Palm OS).
-
-	* ext/socket/sockport.h: add IN_EXPERIMENTAL, IN_CLASSA_NSHIFT,
-	  IN_LOOPBACKNET, AF_UNSPEC, PF_UNSPEC and PF_INET.
-
-Fri Jul  7 03:30:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (aref_args): should allow Hash[:a=>2] etc.
-
-	* numeric.c (fix_aref): convert index by NUM2INT, not FIX2INT. 
-	  (ruby-bugs:#PR37)
-
-	* time.c (time_localtime): should prohibit for frozen time.
-
-	* time.c (time_gmtime): ditto.
-
-Thu Jul  6 19:12:12 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_file_s_open): should not terminate fptr; just clear it.
-
-	* ruby.c (proc_options): should not call require_libraries()
-	  twice.
-
-	* ruby.c (require_libraries): clear req_list_head.next after
-	  execution. 
-
-Thu Jul  6 13:51:57 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* object.c (rb_to_id): name may not be symbol nor fixnum.
-
-	* struct.c (rb_struct_s_def): name may be nil.
-
-Thu Jul  6 02:09:06 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (bigdivrem): new function to return remainder.
-
-	* numeric.c (fixdivmod): now returns modulo, not remainder.
-
-	* numeric.c (flodivmod): ditto.
-
-	* bignum.c (bigdivmod): ditto.
-
-	* numeric.c (num_modulo): new method; alias to '%'.
-
-Thu Jul  6 00:51:43 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* win32/win32.c (NtCmdGlob): patterns should be separated and
-	  NUL terminated.
-
-Wed Jul  5 22:27:56 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* cygwin/GNUmakefile: use ruby.def to make rubycw.dll.
-
-	* ext/extmk.rb.in: create target.def.
-
-	* lib/mkmf.rb: ditto.
-
-Wed Jul  5 09:47:14 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_arg): Time::local, Time::gm now take 7th optional
-	  argument for usec.
-
-	* numeric.c (num_ceil, etc): default ceil, floor, round, trancate
-	  implementation for Numeric, using `to_f'.
-
-	* io.c (rb_io_reopen): clear fptr->path after free() to prevent
-	  potential GC crash.
-
-	* io.c (rb_file_s_open): terminate fptr unless null.
-
-	* io.c (rb_file_initialize): ditto.
-
-	* lib/tempfile.rb: specify FILE::CREAT|File::EXCL to open for
-	  better security.
-
-	* numeric.c (flo_truncate): new method.
-
-Wed Jul  5 01:02:53 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/extmk.rb.in: join ' ' -> join(' ').
-
-	* lib/mkmf.rb: ditto.
-
-Tue Jul  4 13:51:29 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/dbm/dbm.c: add methods added to Hash in 1.5.x.
-
-	* ext/gdbm/gdbm.c: ditto.
-
-	* ext/sdbm/init.c: ditto.
-
-	* eval.c (proc_call): args may be Qundef (means no argument), do
-	  not call TYPE() for args.
-
-Tue Jul  4 13:20:56 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/extmk.rb.in: make command line must be single-quoted.
-	  $(RUBY_INSTALL_NAME) is command substitution in the POSIX sh.
-
-Tue Jul  4 13:16:02 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* util.c (rb_type): should add T_UNDEF.
-
-Tue Jul  4 09:30:35 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (here_document): supports EOF right after terminator.
-
-	* random.c (rb_f_rand): argument is now optional (rand(max=0)). 
-
-Tue Jul  4 01:50:49 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* win32/ruby.def: remove ruby_mktemp.
-
-Tue Jul  4 01:27:13 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_rescue2): new function to rescue arbitrary exception.
-
-	* numeric.c (do_coerce): should catch NameError explicitly.
-
-Tue Jul  4 00:15:23 2000  Dave Thomas  <Dave@thomases.com>
-
-	* numeric.c (Init_Numeric): forgot to register Numeric#remainder.
-
-Mon Jul  3 23:46:56 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (myselect, myaccept): disable interrupt while
-	  executing accept() or select() to avoid Ctrl-C causes
-	  "unknown software exception (0xc0000029)".
-
-Mon Jul  3 18:35:41 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* lib/mkmf.rb: use null device if it exists for cross-compiling.
-
-Mon Jul  3 18:19:51 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.26.
-
-	* lib/net/protocol.rb (finish): do nothing unless active.
-
-	* lib/net/http.rb: HTTP#{get,post}2 again (for new impl).
-
-Mon Jul  3 16:47:22 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* cygwin/GNUmakefile: librubys.a -> lib$(RUBY_INSTALL_NAME)s.a
-
-	* configure.in: use AC_CANONICAL_{HOST,TARGET,BUILD}.
-
-Mon Jul  3 13:15:02 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (fix_divmod): x * d + m = y where d, m = x.divmod(y).
-
-	* bignum.c (rb_big_divmod): ditto.
-
-	* numeric.c (fixdivmod): does not depend C's undifined %
-	  behavior.  adopt to fmod(3m) behavior.
-
-	* numeric.c (flo_mod): modulo now reserves fmod(3m) behavior.
-
-	* numeric.c (num_remainder): 'deprecated' warning.
-
-Mon Jul  3 10:27:28 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: use AC_CANONICAL_SYSTEM.
-
-Sun Jul  2 21:17:37 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: support without --enable-shared for cygwin/mingw32.
-
-	* cygwin/GNUmakefile: ditto.
-
-	* ext/extmk.rb.in: use null device if it exists for cross-compiling.
-
-	* lib/mkmf.rb: ditto.
-
-	* util.c (ruby_mktemp): remove unused ruby_mktemp().
-
-Sun Jul  2 14:18:04 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* eval.c (TMP_PROTECT_END): tmp__protect_tmp may be NULL.
-
-Sun Jul  2 03:37:50 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.25.
-
-	* lib/net/protocol.rb (each_crlf_line): beg = 0 is needed in adding{}
-
-	* lib/net/smtp.rb: allow String for to_addr of SMTP#sendmail
-
-Sat Jul  1 15:22:35 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (fix_rshift): should handle shift value more than
-	  sizeof(long). 
-
-Sat Jul  1 15:22:35 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): the value from RTEST() is not valid Ruby
-	  objct.  result shoule be either true or false.
-
-Sat Jul  1 09:30:06 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* re.c (rb_reg_initialize): was freeing invalid pointer.
-
-Sat Jul  1 03:25:56 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (call_args): command_call can be the last argument of
-	  call_args.  It had to be the only argument.
-
-	* re.c (rb_reg_s_quote): should not dump core even for unsane mbc
-	  string.
-
-Fri Jun 30 01:36:20 2000  Aleksi Niemela  <aleksi.niemela@cinnober.com>
-
-	* parse.y (f_norm_arg): better, nicer error message.
-
-Thu Jun 29 07:45:33 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (udp_send): destination may be packed
-	  struct sockaddr.
-
-	* object.c (rb_Integer): Integer(nil) should be invalid, on the
-	  other hand, nil.to_i is OK.
-
-Wed Jun 28 17:26:06 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (ip_recvfrom): udp_recvfrom and tcp_recvfrom
-	  is merged and moved to IPSocket#recvfrom.
-
-	* ext/socket/socket.c (sock_s_getaddrinfo): family can be a
-	  strings such as "AF_INET" etc.
-
-	* ruby.c (require_libraries): . and RUBYLIB added to $load_path
-	  just before -r procedure.
-
-	* ruby.c (proc_options): -e, - did not exec -r.
-
-Wed Jun 28 14:52:28 2000  Koga Youichirou <y-koga@mms.mt.nec.co.jp>
-
-	* config.sub: NetBSD/hpcmips support.
-
-Wed Jun 28 10:11:06 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c: gc trigger threshold changed; GC_NEWOBJ_LIMIT removed,
-	  FREE_MIN is increased to 4096.
-
-Tue Jun 27 22:39:28 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.24.
-
-	* lib/net/protocol.rb: modified each_crlf_line again.
-
-	* lib/net/protocol.rb: do_write_beg,do_write_end -> writing{}
-	  do_write_do -> do_write
-
-	* lib/net/http.rb: can make proxy connection by passing
-	  addresses to HTTP.new, start.
-
-	* lib/net/http.rb: HTTP.new_implementation, old_implementation:
-	  can use 1.2 implementation of head, get, post, put.
-	  (see document)
-
-Tue Jun 27 12:05:10 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32.c (myfdclr): new function.
-
-	* win32.h: add FD_CLR.
-
-Mon Jun 26 23:41:41 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ruby.h: add cast for ANSI style.
-
-	* gc.c (rb_data_object_alloc): use RUBY_DATA_FUNC.
-
-Mon Jun 26 22:20:03 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (is_socket, extract_file_fd): New function.
-
-	* win32/win32.c (myfdopen): use is_socket().
-
-	* win32/win32.c (myselect): return non socket files immediately
-	  if file and socket handles are mixed.
-
-Mon Jun 26 16:21:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_schedule): wait_for cleared too early.
-
-Mon Jun 26 09:15:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c: remove obsolete 'F', 'D' specifiers.
-
-Sun Jun 25 00:55:03 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/socket.c (sock_s_getnameinfo): `res' would not
-	  be assigned if TYPE(sa) == T_STRING.
-
-Sat Jun 24 14:36:29 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* config*.dj, configure.bat, top.sed: move to djgpp/.
-
-Sat Jun 24 02:34:17 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (load_file): call require_libraries() here to let
-	  debug.rb work properly.
-
-Fri Jun 23 22:34:51 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* bignum.c (rb_big_lshift): reorder xds assignment to avoid
-	  reusing `x' as `len' by VC++ 6.0 SP3 compiler with -Ox switch.
-
-Fri Jun 23 01:11:27 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_substr): should return empty string (""), 
-	  if beg == str.size and len == zero, mostly for convenience and
-	  backward compatibility.
-
-	* parse.y (new_super): should tweak block_pass node for super too.
-
-	* string.c (rb_str_split_m): last split element should not be nil,
-	  but "" when limit is specified.
-
-Thu Jun 22 17:27:46 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_substr): str[n,m] now returns nil when n equals
-	  to str.size.
-
-Thu Jun 22 13:49:02 2000  Uechi Yasumasa <uechi@ryucom.ne.jp>
-
-	* lib/net/ftp.rb: support resuming.
-
-Thu Jun 22 13:37:19 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* eval.c (rb_thread_sleep_forever): merge pause() macro.
-
-Wed Jun 21 08:49:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): should not raise exception just by defining
-	  singleton class.
-
-Wed Jun 21 01:18:03 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h: two macros RUBY_DATA_FUNC and RUBY_METHOD_FUNC are added
-	  to make writing C++ extensions easier.
-
-	* array.c (rb_ary_dup): internal classes should not be shared by dup.
-
-	* hash.c (rb_hash_dup): ditto.
-
-	* object.c (rb_obj_dup): ditto.
-
-	* string.c (rb_str_dup): ditto.
-
-	* error.c (Init_Exception): renamed NotImplementError to
-	  NotImplementedError. 
-
-Tue Jun 20 16:22:38 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (make_time_t): bug in DST boundary.
-
-Tue Jun 20 10:54:19 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: add eval sitedir.
-
-Tue Jun 20 06:14:43 2000  Wakou Aoyama <wakou@fsinet.or.jp>
-
-	* lib/cgi.rb: change: version syntax. old: x.yz, now: x.y.z
-
-	* lib/net/telnet.rb: ditto.
-
-Tue Jun 20 00:37:45 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_kcode_m): Regexp#kcode returns nil for code unfixed
-	  regexp object.
-
-	* bignum.c (bigdivmod): bignum zero check was wrong.
-
-Mon Jun 19 10:48:28 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_cvar_set): forgot to add security check for class
-	  variable assignment.
-
-Sun Jun 18 22:49:13 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: single quoted sitedir.
-
-	* mkconfig.rb: add DESTDIR for cross-compiling.
-
-	* lib/mkmf.rb: add DESTDIR.
-
-	* ruby.c (load_file): force binmode if fname includes ".exe"
-	  on DOSISH.
-
-Sat Jun 17 23:22:17 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (rb_f_sprintf): should ignore negative precision given
-	  by <%.*>.
-
-	* sprintf.c (rb_f_sprintf): should allow zero precision.
-
-Sat Jun 17 03:13:29 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_localtime): avoid unnecessary call of localtime.
-
-	* time.c (time_gmtime): avoid unnecessary call of gmtime.
-
-	* process.c (proc_wait2): new method.
-
-	* process.c (proc_waitpid): second argument made optional.
-
-	* process.c (proc_waitpid2): new method.
-
-Sat Jun 17 00:05:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_clone): should initialize member fields.
-
-Fri Jun 16 22:49:34 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_rewind): set lineno to zero.
-
-Fri Jun 16 22:47:47 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.23.
-
-	* lib/net/protocol.rb: too many CRLF in last line.
-
-Fri Jun 16 21:23:59 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: add pause(2) checking.
-
-	* eval.c: define pause() if missing.
-
-Fri Jun 16 18:41:58 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* process.c (proc_setsid): BSD-style setpgrp() don't return 
-	  process group ID, but 0 or -1.
-
-Fri Jun 16 16:23:35 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* file.c (rb_stat_inspect): gives detailed information;
-	  compatibility with ruby-1.4.x.
-
-Fri Jun 16 05:18:45 2000  Yasuhiro Fukuma  <yasuf@bsdclub.org>
-
-	* configure.in: FreeBSD: do not link dummy libxpg4 which was
-	  merged into libc.
-
-Fri Jun 16 03:17:36 2000  Satoshi Nojo  <nojo@t-samukawa.or.jp>
-
-	* ext/dbm/dbm.c (fdbm_length): use GetDBM. empty?, [] too.
-
-	* ext/gdbm/gdbm.c (fgdbm_length): ditto.
-
-	* ext/sdbm/init.c (fsdbm_length): ditto.
-
-Fri Jun 16 01:57:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_sleep_forever): pause(2) instead of sleep(3).
-
-Thu Jun 15 10:46:36 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_sub_bang): should probagate taintness from
-	  replacement string.
-
-Wed Jun 14 17:01:41 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* rubytest.rb: add CONFIG['EXEEXT'] to the executable file name.
-
-Wed Jun 14 14:50:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_f_sub): assign to $_ only if modification happens.
-
-	* string.c (rb_f_gsub): ditto.
-
-	* string.c (rb_f_chop): ditto.
-
-	* string.c (rb_f_chomp): ditto.
-
-	* io.c (io_reopen): preserve file position by ftell/fseek, if io
-	  is a seekable.
-
-	* eval.c (method_arity): wrong arity number for the methods with
-	  optional arguments.
-
-	* time.c (make_time_t): opposite timezone shift (should be negative).
-
-Wed Jun 14 14:07:38 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c: typo(ig/if).
-
-	* re.c: typo(re/reg). add rb_reg_check().
-
-	* time.c: remove unneeded declare(daylight, timezone).
-
-	* configure.in: add include <time.h> when daylight checking.
-
-Wed Jun 14 11:36:52 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* marshal.c (r_object): modified for symbols.
-
-	* marshal.c (w_object): ditto.
-
-Wed Jun 14 10:04:58 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_memcmp): should compare according to ruby_ignorecase.
-
-	* string.c (rb_str_cmp): use rb_memcmp.
-
-	* string.c (rb_str_index): ditto.
-
-	* string.c (rb_str_rindex): ditto.
-
-	* string.c (rb_str_each_line): ditto.
-
-Wed Jun 14 04:58:53 2000  Dave Thomas  <dave@thomases.com>
-
-	* io.c (rb_io_set_lineno): should have returned VALUE, not
-	  integer.
-
-Wed Jun 14 09:29:42 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_dup): dup should always propagate taintness.
-
-Wed Jun 14 00:50:14 2000  Wakou Aoyama <wakou@fsinet.or.jp>
-
-	* lib/cgi.rb: read_multipart(): if no content body then raise EOFError.
-
-Tue Jun 13 11:46:17 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* process.c (proc_setsid): try implement it using setpgrp() and
-	  ioctl(fd, TIOCNOTTY, NULL).
-
-	* re.c (rb_reg_prepare_re): magic variable $= should affect regex
-	  pattern match. 
-
-	* time.c (make_time_t): use tm.tm_gmtoff if possible.
-
-	* time.c (time_zone): use tm.tm_zone if available.
-
-Tue Jun 13 01:50:57 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.22.
-
-	* lib/net/http.rb: HTTPResponse#body returns body.
-
-Mon Jun 12 23:41:54 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in (daylight): avoid GCC optimization.
-
-Mon Jun 12 19:02:27 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: cygwin has strange timezone.
-
-	* time.c (time_zone): use tzname and daylight.
-
-Sat Jun 10 23:10:32 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_seek): whence is optional, default is SEEK_SET.
-
-Fri Jun  9 17:00:29 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.21.
-
-	* lib/net/http.rb: exception is raised with response object.
-
-Fri Jun  9 15:11:35 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (make_time_t): supports daylight saving time.
-
-	* eval.c (rb_thread_safe_level): should retrieve current $SAFE
-	  value if a thread is the current thread.
-
-Thu Jun  8 14:25:45 2000  Hiroshi Igarashi  <iga@ruby-lang.org>
-
-	* lib/mkmf.rb: add target `distclean' in Makefile for extlib.
-	target `clean' doesn't remove Makefile.
-
-Thu Jun  8 13:34:03 2000  Dave Thomas  <dave@thomases.com>
-
-	* numeric.c: add nan?, infinite?, and finite? to Float
-	
-Thu Jun  8 00:31:04 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* regex.h: export re_mbctab properly on cygwin.
-
-	* dln.c: use dlopen instead of LoadLibrary on cygwin.
-
-Thu Jun  8 13:41:34 2000  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* file.c (rb_file_s_basename): might dump core.
-
-Tue Jun  6 03:29:12 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (dir_foreach): now returns nil for consistency.
-
-	* bignum.c (bigdivmod): modulo by small numbers was wrong.
-
-Mon Jun  5 00:18:08 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* bignum.c: avoid conflict with USHORT on mingw32.
-
-Mon Jun  5 00:13:35 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* eval.c (rb_thread_schedule): =/== typo.
-
-Sun Jun  4 03:17:36 2000  Wakou Aoyama <wakou@fsinet.or.jp>
-
-	* lib/cgi.rb: improve: CGI::pretty()
-
-Sun Jun  4 02:01:10 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* lib/mkmf.rb: do not need to add -L$(topdir) in --enable-shared case.
-
-Sat Jun  3 13:50:06 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (rb_id2name): should support constant attrset
-	  identifiers. 
-
-	* bignum.c (rb_big_eq): Bignum#== should not raise exception.
-
-Fri Jun  2 11:24:48 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_popen): open with a block returns the value from the
-	  block.  old behavior was back.
-
-Fri Jun  2 00:42:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-
-	* eval.c (rb_thread_cleanup): should clear priority for thread
-	  termination.
-
-Thu Jun 01 22:39:41 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.20.
-
-	* lib/net/http.rb: wrongly closed the socket twice
-	  when no Content-Length: was given.
-
-Thu Jun  1 00:59:15 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_yield_0): convert Qundef to [].
-
-Wed May 31 20:45:59 2000  Dave Thomas  <Dave@Thomases.com>
-
-	* string.c (rb_str_slice_bang): wrong argument number.
-
-Wed May 31 12:37:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_exec_end_proc): print error message from END procs.
-
-Wed May 31 04:06:41 2000  Wakou Aoyama <wakou@fsinet.or.jp>
-
-	* lib/cgi.rb: change: CGI#out() if "HEAD" == REQUEST_METHOD then
-	  output only HTTP header.
-
-Wed May 31 01:54:21 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_schedule): set main_thread->status to
-	  THREAD_TO_KILL, before raising deadlock error.
-
-	* eval.c (rb_thread_deadlock): if curr_thread == main_thread, do
-	  not call rb_thread_restore_context()
-
-Tue May 30 23:33:41 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* lib/mkmf.rb (create_makefile): add $(TARGET).ilk and *.pdb
-	  to cleanup files for mswin32.
-
-Mon May 29 10:41:10 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* file.c (rb_file_s_basename): should propagate taintness.
-
-Sun May 28 21:37:13 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* eval.c: bug fix: DLEXT2.
-
-Sun May 28 19:21:43 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* win32/win32.c: use ruby's glob.
-
-	* dir.c: "glob" exported and renamed to "rb_glob".
-
-	* ruby.h: ditto.
-
-	* main.c: turn off command line mingw32's globbing.
-	
-Wed May 25 22:25:13 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-	
-	* ext/extmk.rb.in: use "ftools" instead of "rm -f".
-	
-	* lib/mkmf.rb: ditto.
-
-Thu May 25 22:01:32 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* defines.h: mswin32: remove obsolete USHORT definition.
-
-	* re.h: mswin32: use EXTERN instead of extern.
-
-	* regex.h: mswin32: export re_mbctab properly.
-
-	* win32/ruby.def: add ruby_ignorecase and regex.c's exports.
-
-Thu May 25 21:28:44 2000  Minero Aoki <aamine@dp.u-netsurf.ne.jp>
-
-	* re.c (rb_reg_expr_str): escape un-printable character.
-
-Thu May 25 01:35:15 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (tokadd_escape): forgot to add `\x' to hexadecimal
-	  escape sequences.
-
-	* object.c (rb_obj_dup): dup for normal object (T_OBJECT) copies
-	  instance variables only.
-
-Wed May 24 23:49:47 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_mod_initialize): should provide initialize.
-
-Wed May 24 23:17:50 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/Makefile: remove unnecessary mv and rm command call.
-
-Wed May 24 21:01:04 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/pty/pty.c: use "" instead of <> to include ruby.h and rubyio.h
-	  for BeOS (PowerPC).
-
-	* file.c (rb_find_file): should check dln_find_file() result.
-
-	* win32/ruby.def: add rb_block_given_p.
-
-Wed May 24 16:32:45 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_popen): popen does not take 3rd argument anymore.
-
-	* re.c (rb_reg_desc): re may be zero, check before dereferencing.
-
-Wed May 24 16:03:06 2000  Wakou Aoyama <wakou@fsinet.or.jp>
-
-	* lib/cgi.rb: bug fix: CGI::escape(), CGI::Cookie::new()
-
-	* lib/net/telnet.rb: improve: binmode(), telnetmode() interface
-
-Wed May 24 13:12:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* misc/ruby-mode.el (ruby-parse-region): support `while .. do'
-	  etc. But corresponding keywords must be at the beginning of
-	  line. 
-
-Tue May 23 23:50:12 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_initialize_m): wrong kcode value.
-
-	* re.c (rb_reg_s_new): forgot to initialize re->ptr.
-
-Tue May 23 08:36:24 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): forgot to restore old option
-	  status by (?ix-ix).
-
-	* regex.c (re_compile_fastmap): anychar may match newline if
-	  RE_OPTION_MULTILINE or RE_OPTION_POSIXLINE is set.
-
-Mon May 22 22:45:06 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.19.
-
-	* lib/net/http.rb: do not use Regexp "p" option.
-
-Mon May 22 21:56:43 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* struct.c (rb_struct_getmember): should use ID2SYM, not INT2NUM.
-
-Mon May 22 15:07:37 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (rb_find_file): should check if the file really exists.
-
-Mon May 22 09:08:12 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_popen): _exit(0) after processing block under the
-	  child process.
-
-	* io.c (rb_io_popen): flush stdout/stderr before subprocess
-	  termination.
-
-	* eval.c (rb_check_safe_str): insert rb_secure(4); operation
-	  requires untainted string should be prohibited in level 4.
-
-Sun May 21 21:17:00 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: add Setup.dj for djgpp cross-compiling.
-
-	* Setup.dj: add readline.
-
-	* instruby.rb: copy win32/win32.h to archlibdir on mingw32.
-
-Sun May 21 20:58:08 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* pack.c: fix OFF16 and OFF32 definitions for Alpha and IRIX64.
-
-Sun May 21 17:31:37 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* instruby.rb: support "make install" for cross-compiling.
-
-	* ext/extmk.rb.in: ditto.
-
-Sun May 21 14:22:49 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* Makefile.in: rename prep.rb to fake.rb.
-
-	* configure.in: ditto.
-
-Sat May 20 23:29:14 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (dir_s_new): does not take block; "open" does.
-
-	* io.c (rb_io_s_new): ditto.
-
-Fri May 19 07:44:26 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (dir_s_open): Dir#open does not returns closed Dir if a
-	  block is given to the method.
-
-	* re.c (rb_reg_initialize_m): Regexp::new calls initialize now.
-
-	* string.c (Init_String): String#delete_at removed.
-
-	* string.c (rb_str_aset_m): should have checked argc != 2.
-
-	* eval.c (rb_thread_schedule): select(2) was called too many.
-
-	* regex.c (re_compile_pattern): a bug in (?m) support.  Pointed
-	  out by Dave Thomas <Dave@thomases.com>.
-
-Thu May 18 23:55:26 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* dln.c (search_undef): st_lookup()'s 3rd parameter should be
-	  a pointer of the variable which has the same size and alignment
-	  as `char *'.
-
-	* marshal.c (w_symbol, w_object): ditto.
-
-	* parse.y (rb_intern): ditto.
-
-Thu May 18 18:00:35 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.18.
-
-	* lib/net/protocol.rb: Net::Version was removed.
-
-	* lib/net/smtp.rb: use Socket.gethostname to get local host name.
-
-Thu May 18 13:34:57 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (ruby_connect): should not have replaced
-	  thread_write_select() by rb_thread_fd_writable().
-
-Thu May 18 09:01:25 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* configure.in, ext/extmk.rb.in, lib/mkmf.rb: remove BeOS R3 support.
-	  Make a shared library (libruby.so) only if the --enable-shared
-	  option is specified.
-
-	* instruby.rb: no longer use libruby.so.LIB and import.h.
-
-	* io.c: fix READ_DATA_PENDING definition for BeOS (PowerPC).
-
-Wed May 17 14:14:23 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_new_1): use /m instead of /p.
-
-Wed May 17 02:22:03 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_polling): wait 0.06 second to let other
-	  processes run.
-
-	* process.c (rb_waitpid): avoid busy wait using rb_thread_polling.
-
-	* file.c (rb_thread_flock): ditto.
-
-	* parse.y (expr): avoid calling value_expr() twice.
-
-Wed May 17 00:45:57 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c (rb_io_binmode): should check PLATFORMs, not O_BINARY, sigh...
-
-Wed May 17 00:40:15 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/config.h: add DLEXT2, now DLEXT on mswin32 is "so".
-
-	* win32/config.status: ditto.
-
-	* win32/ruby.def: add symbol "rb_big_divmod".
-
-Tue May 16 19:45:32 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* intern.h: use EXTERN instead of extern.
-
-	* win32/ruby.def: add rb_defout, rb_stdout, ruby_errinfo,
-	  ruby_sourceline, ruby_sourcefile to work with eruby
-	  reported by Hiroshi Saito <HiroshiSaito@pob.org>.
-	  Export both ruby_xmalloc and xmalloc etc.
-
-Tue May 16 17:00:05 2000  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* eval.c (rb_thread_select): should check whether fds are null.
-
-Tue May 16 11:51:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (pipe_open): synchronize subprocess stdout/stderr.
-
-Mon May 15 15:38:09 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h: exported symbols should be for xmalloc etc. are now
-	  prefixed by 'ruby_', e.g. ruby_xmalloc().
-
-	* eval.c (rb_thread_select): remove busy wait for select.
-
-	* dir.c (glob): trailing path may be null, e.g. glob("**").
-
-Mon May 15 14:48:41 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* io.c (rb_io_pid): new method; returns nil if no process attached
-	  to the IO.
-
-Mon May 15 01:18:20 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_s_popen): _exit after Proc execution.
-
-Sun May 14 18:05:59 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* Makefile.in: missing/nt.c -> win32/win32.c
-
-	* configure.in: bug fix; static linking on mingw32.
-
-	* cygwin/GNUmakefile.in: remove VPATH.
-
-	* ext/extmk.rb.in: Makefile set binmode with mingw32 on cygwin32.
-
-	* lib/mkmf.rb: ditto.
-
-	* win32/config.h: undef HAVE_SYS_FILE_H.
-
-Sun May 14 02:02:48 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* lib/irb/ruby-lex.rb: '/' should be escaped in character class.
-
-Sun May 14 00:54:43 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in, ...: support mingw32.
-
-	* defines.h: ditto. undef EXTERN for tcl/tk on cygwin.
-
-	* ext/*/extconf.rb: replace PLATFORM with RUBY_PLATFORM.
-
-	* ext/socket/sockport.h: define IN_MULTICAST for missing IN_MULTICAST.
-
-	* ext/tcltklib/tcltklib.c: remove declaration of rb_argv0.
-
-	* file.c: should check S_IXGRP, S_ISGID, not NT.
-
-	* io.c (rb_io_binmode): should check _IOBIN, O_BINARY, not PLATFORMs.
-
-Sat May 13 14:21:15 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* io.c (rb_io_s_popen): should check whether a block is given.
-
-Fri May 12 17:33:44 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): charset_not should not exclude
-	  newline from matching set.
-
-Thu May 11 22:51:05 2000  Ryunosuke Ohshima  <ryu@jaist.ac.jp>
-
-	* pack.c (pack_pack): Bignum support.
-
-	* pack.c (pack_unpack): ditto.
-
-Thu May 11 21:19:29 2000  Hiroshi Igarashi  <iga@ruby-lang.org>
-
-	* intern.h: add missing declarations of ruby API functions.
-
-	* ruby.h: fix function name in declarations.
-
-Thu May 11 22:29:25 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/md5/depend: add $(topdir)/config.h dependency to md5c.o.
-
-	* ext/md5/extconf.rb: new file to add -DHAVE_CONFIG_H flag for Alpha.
-
-Thu May 11 10:55:52 2000  Ryunosuke Ohshima  <ryu@jaist.ac.jp>
-
-	* pack.c (pack_pack): packing BER compressed integer by `w'.
-
-	* pack.c (pack_unpack): unpacking BER.
-
-Thu May 11 00:37:55 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_regx): remove in_brack.
-
-Wed May 10 12:51:18 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (proc_options): move adding RUBYLIB and "." to the load
-	  path after #! line parsing.
-
-	* parse.y (parse_regx): should parse backslash escape like `\c['
-	  here to avoid causing `unterminated regexp' error.
-
-Wed May 10 00:19:53 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* MANIFEST, beos/GNUmakefile.in, configure.in: no longer need
-	  beos/GNUmakefile.in to support BeOS R4.5.2 (Intel) as a result
-	  of eban's Makefile.in change.
-
-	* io.c: NOFILE is already defined on BeOS R4.5 (Intel) or later.
-
-	* lib/matrix.rb: remove debug print.
-
-	* regex.c: don't use nested comment.
-
-Tue May  9 17:08:43 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (massign): no longer convert nil into empty array.
-
-	* io.c (rb_io_s_popen): optional 3rd argument to give proc, which
-	  will be executed in spawned child process.
-
-Mon May  8 23:47:39 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* eval.c (rb_callcc): prev & next should be initialized to zero.
-
-Mon May  8 23:17:36 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dln.c (dln_init): remove possible buffer overrun.  This is
-	  suggested by Aleksi Niemela <aleksi.niemela@cinnober.com>.
-
-	* dln.c (init_funcname): ditto.
-
-Sat May  6 23:35:47 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (lhs): should allow `obj.Attr = 5' type expression.
-
-Sat May  6 15:46:08 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/socket/extconf.rb: add a new configure option to force use
-	  of the WIDE Project's getaddrinfo(): --enbale-wide-getaddrinfo.
-
-Fri May  5 21:19:22 2000  MOROHOSHI Akihiko  <moro@remus.dti.ne.jp>
-
-	* parse.y (yylex): allow '$1foo' and such.
-
-Fri May  5 17:57:24 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.17.
-
-	* lib/net/http.rb: write also port number in Host: field.
-
-	* lib/net/http.rb: see Proxy-Connection: to decide socket connection.
-
-Fri May  5 03:25:15 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_fastmap): charset_not for multibyte
-	  characters excluded too many characters.
-
-Tue May  2 13:23:43 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_schedule): little bit more impartial context
-	  switching.
-
-Tue May  2 09:50:03 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* configure.in: add DLDLIBS to set platform specific library
-	  for extensions.
-
-	* ext/extmk.rb.in: use @DLDLIBS@ instead of RUBY_PLATFORM choice.
-
-	* lib/mkmf.rb: use CONFIG["DLDLIBS"] instead of RUBY_PLATFORM choice.
-
-	* config_s.dj: add @DLDLIBS@.
-
-	* win32/config.status: ditto.
-
-	* win32/ruby.def: regular maintenance.
-
-Mon May  1 23:42:44 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in, eval.c: add DLEXT2. now DLEXT on Cygwin is "so".
-
-	* defines.h: use dllimport, dllexport for Cygwin 1.1.x.
-
-	* ruby.h: ditto.
-	
-	* cygwin/GNUmakefile.in: ditto.
-
-	* ext/Win32API/Win32API.c: directly "call" in asm statement for
-	  gcc 2.95.x or newer.
-
-Sat Apr 29 04:58:12 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* array.c (rb_ary_unshift_m): performance improvement.
-
-Fri Apr 28 00:19:22 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* array.c (rb_ary_unshift_m): takes items to push.
-
-Wed Apr 26 15:23:02 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_succ): insert carrying character just before
-	  the leftmost alpha numeric character.
-
-	* string.c (rb_str_succ): proper behavior for "".succ and "\377".succ.
-
-	* string.c (rb_str_succ): use realloc and memmove.
-
-Tue Apr 25 18:28:45 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.16.
-
-	* lib/net/smtp.rb: add SMTP AUTH
-
-Tue Apr 25 14:30:13 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_gets_internal): shortcut when rs == rb_default_rs.
-
-Sat Apr 22 23:14:41 2000  SHIROYAMA Takayuki  <psi@fortune.nest.or.jp>
-
-	* configure.in: MacOS X support.
-
-Sat Apr 22 16:37:10 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.15.
-
-	* lib/net/http.rb:  closing socket by watching both
-	  user header and server response
-
-Fri Apr 21 21:44:34 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c (rb_io_s_pipe): should set FMODE_SYNC.
-
-Thu Apr 20 16:59:22 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* eval.c (massign): `*lvalue = false' should assign `[false]' to
-	  lvalue.
-
-Wed Apr 19 08:35:08 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (rb_singleton_class): generate singleton class for
-	  special constants: nil, true, false.
-
-Wed Apr 19 02:09:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (rb_singleton_class): singleton method for nil, true,
-	  false is possible now.
-
-	* eval.c (rb_eval): ditto.
-
-Tue Apr 18 18:54:25 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.14.
-
-	* lib/net/http.rb: new method HTTP#head2.
-
-	* lib/net/http.rb: get2/post2 does not raise exceptions.
-
-Mon Apr 17 15:16:31 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_close): to detect some exceptional status, writable
-	  IO should be flushed before close;
-
-Sat Apr 15 18:29:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_collect_bang): Array#filter renamed.
-
-Fri Apr 14 19:47:11 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.13.
-
-	* lib/net/pop.rb: accept illegal timestamp
-
-	* lib/net/http.rb: when body was chunked, does not set Content-Length:
-
-Tue Apr 11 21:14:42 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* config_s.dj: add @sitedir@.
-	* configure.in: add --with-sitedir=DIR option.
-	* instruby.rb: use CONFIG["sitedir"].
-	* lib/mkmf.rb: support 'make site-install'.
-	* win32/config.status: add @sitedir@.
-
-Tue Apr 11 16:25:15 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (rb_big_2comp): unnecessary lvalue cast removed.
-
-Tue Apr 11 02:25:53 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (env_fetch): new method.
-
-	* marshal.c (marshal_dump): accepts depth = nil for unlimited depth.
-
-Sun Apr  9 20:49:19 2000  Dave Thomas  <Dave@Thomases.com>
-
-	* parse.y (str_extend): Allow class variables to be expanded.
-
-Fri Apr  7 02:03:54 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (rb_sys_fail): escape non-printable characters.
-
-Thu Apr  6 20:10:47 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/extmk.rb.in (create_makefile): BeOS --program-suffix support.
-	* lib/mkmf.rb (create_makefile): ditto.
-
-Thu Apr  6 09:55:26 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* error.c (rb_sys_fail): need rb_exc_new2() call on BeOS.
-
-Mon Apr  3 17:22:27 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_reopen): support tempfile.
-
-	* eval.c (catch_i): should supply argument.
-
-Sat Apr  1 22:50:28 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (r_object): wrong symbol restoration.
-
-Sat Apr  1 21:30:53 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c(rb_io_printf, rb_f_printf): should use rb_io_write.
-
-Sat Apr  1 00:16:05 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (rb_gc_call_finalizer_at_exit): should be clear flags
-	  before calling finalizers.
-
-	* eval.c (specific_eval): can be called without SecurityError, if
-	  $SAFE >= 4.
-
-	* object.c (sym_inspect): inspect gives ":sym", to_s gives "sym".
-
-Fri Mar 31 22:07:04 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.12.
-
-	* lib/net/protocol.rb:  update Net::Protocol::Proxy#connect
-
-	* lib/net/protocol.rb:  ReplyCode is not a class
-
-	* lib/net/http.rb: header value format was change:
-	  values do not include header name
-
-	* lib/net/http.rb: header is not a Hash, but HTTPResponse
-
-Thu Mar 30 12:19:44 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* enum.c (enum_find): rb_eval_cmd() should be called with array.
-
-Tue Mar 28 13:57:05 2000  Clemens Hintze  <c.hintze@gmx.net>
-
-	* ext/dbm/dbm.c (fdbm_invert): should return new hash.
-
-	* ext/gdbm/gdbm.c (fgdbm_invert): ditto.
-
-Tue Mar 28 00:58:03 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.11.
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: does not
-	  dispatch any commands while dispatching command.
-
-	* lib/net/protocol.rb: failed to get error class of
-	  inherited ReplyCode
-
-	* lib/net/http.rb: change feature of "get2", "post2"
-
-Mon Mar 27 01:34:58 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.10.
-
-	* lib/net/http.rb: return value of 'head' was wrong.
-
-Sun Mar 26 17:47:35 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.9.
-
-	* lib/net/smtp.rb: SMTP#do_ready wrongly took no arguments
-
-Sat Mar 25 23:21:10 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (w_object): symbols should be converted to ID before
-	  dumping out.
-
-Fri Mar 24 18:26:51 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (test_check): should have checked exact number of arguments.
-
-Fri Mar 24 21:02:11 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* signal.c (trap): should treat some symbols as the signal.
-
-Fri Mar 24 06:58:03 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.8.
-
-	* lib/net/http.rb:  post, get2, post2, get_body
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: separate
-	  Command/Socket documentation.
-
-Thu Mar 23 02:26:14 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_fptr_finalize): fptr may be null.
-
-	* io.c (rb_io_s_new): now calls `initialize'.
-
-	* io.c (rb_io_initialize): actual open done in this method.
-
-	* io.c (rb_file_initialize): ditto.
-
-	* eval.c (rb_eval): class variables in singleton class definition
-	  is now handled properly (I hope).
-
-Wed Mar 22 21:49:36 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* st.c (st_delete_safe): skip already deleted entry.
-
-	* hash.c (rb_hash_delete): modify brace miss.
-
-Wed Mar 22 08:53:58 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (exec_under): do not push cbase if ruby_cbase == under.
-
-	* node.h (NEW_CREF0): preserve cbase nesting.
-
-Tue Mar 21 12:57:50 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_class_s_new): Class::new should call `inherited'.
-
-Sat Mar 18 12:36:09 2000  Nobuyoshi Nakada  <nobu.nokada@softhome.net>
-
-	* eval.c (rb_backtrace, make_backtrace): removed unused variable
-	  `lev'.
-
-	* eval.c (rb_attr): calls `method_added' at attribute definition.
-
-	* eval.c (rb_mod_modfunc): calls `singleton_method_added' while
-	  `module_function'.
-
-	* eval.c (rb_eval): parameter to `method_added' and
-	  `singleton_method_added' is Symbol.
-
-	* eval.c (Init_eval): caches IDs for `method_added' and
-	  `singleton_method_added'.
-
-Sat Mar 18 11:25:10 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (rescue): allows `rescue Error in foo'.  experimental.
-	  which is better this or preparing alias `exception' for `$!'?
-
-Fri Mar 17 15:02:45 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_autoload_id): defining new autoload should be
-	  prohibited for $SAFE > 4.
-
-	* variable.c (rb_autoload_load): autoload should be possible for
-	  $SAFE > 4.
-
-	* eval.c (call_trace_func): should handle T_ICLASS properly.
-
-Fri Mar 17 14:34:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_gsub): forgot to initialize str->orig.
-
-Fri Mar 17 01:24:59 2000  Dave Thomas  <Dave@thomases.com>
-
-	* string.c (rb_str_clone): forgot to copy str->orig if STR_NO_ORIG
-	  is set by Array#pack.
-
-Wed Mar 15 21:25:04 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* array.c (rb_ary_join): 'result' is always duplicated
-	  before concat string.
-
-Wed Mar 15 17:26:05 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_hash_s_create): unexpected recursive call removed.
-	  this bug was found by Satoshi Nojo <nojo@t-samukawa.or.jp>.
-
-Wed Mar 15 13:12:39 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (Init_Thread): Thread.join removed finally.
-
-	* string.c (rb_str_chomp_bang): forgot to call rb_str_modify().
-
-Mon Mar 13 16:12:13 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (block_pass): distinguish real orphan block and still
-	  on-stack block passed by block argument.
-
-Mon Mar 13 00:20:25 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (f_norm_arg): proper error message when constant comes
-	  in formal argument list.  this message is suggested by Muvaw
-	  Pnazte <bugathlon@yahoo.com>.
-
-	* eval.c (rb_f_raise): proper error message when the first
-	  argument is not an exception class/object.
-
-	* string.c (rb_str_dup): dup now postpone buffer copy as long as
-	  possible.  performance improved by lazy copying.
-
-Sun Mar 12 13:58:52 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* signal.c (rb_f_kill): should treat some symbols as the signal.
-
-Sat Mar 11 22:03:03 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_gsub): performance tune by avoiding buffer copy.
-
-	* eval.c (rb_f_missing): check if argv[0] is ID.
-
-Sat Mar 11 15:49:41 2000  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* struct.c (rb_struct_aref): struct aref by symbol.
-
-Sat Mar 11 05:07:11 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* process.c (proc_setpriority): should return 0, not nil.
-
-	* process.c (proc_setpgid): ditto.
-
-Fri Mar 10 18:14:54 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (path_check_1): confusing buf and path.  this bug found
-	  by <decoux@moulon.inra.fr>.
-
-Fri Mar 10 09:37:49 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* MANIFEST: add beos/GNUmakefile.in.
-	* configure.in: support BeOS R4.5.2 (Intel).
-	* beos/GNUmakefile.in: new file to support BeOS R4.5.2 (Intel).
-
-Thu Mar  9 11:13:32 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_fastmap): fixed embarrassing brace bug.
-
-Thu Mar  9 01:36:32 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* missing/flock.c: emulate missing flock() with fcntl().
-
-Thu Mar  9 00:29:35 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (sym_to_s): returns ":sym".
-
-	* object.c (sym_id2name): separated from to_s; returns "sym".
-
-Wed Mar  8 19:16:19 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.7.
-
-	* lib/net/http.rb (connecting): returns header
-
-Wed Mar  8 02:08:43 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y: escape expansion too early.
-
-	* string.c (rb_f_scan): Kernel#scan added.
-
-	* regex.c (re_compile_pattern): support \cX et al.
-
-Tue Mar  7 01:44:27 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (set_stdin): simplified procedure, allows $stdin = DATA;
-	  experimental.
-
-	* io.c (set_outfile): ditto.
-
-	* re.c (Init_Regexp): new method Regexp#last_match added; it's an
-	  alternative for $~.
-
-	* configure.in (DEFAULT_KCODE): KCODE_NONE should be the default.
-
-	* dir.c (dir_s_rmdir): should return 0 on success.
-
-	* signal.c: remove CWGUSI support.
-
-Mon Mar  6 12:28:37 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (w_symbol): support symbol object.
-
-	* util.c: make symbol as separated class.
-
-	* error.c (Init_Exception): new exception RangeError.
-
-	* ext/socket/socket.c (ip_addrsetup): should check length of hostname.
-
-	* ext/socket/socket.c (ip_addrsetup): check newline at the end of
-	  hostname.  These fixes suggested by Muvaw Pnazte <bugathlon@yahoo.com>.
-
-Sun Mar  5 20:35:45 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/Win32API/Win32API.c (Win32API_initialize): should call
-	  LoadLibrary() everytime and should assign the hdll to Win32API
-	  object(protect the hdll from GC).
-
-Sun Mar  5 18:49:06 2000  Nakada.Nobuyoshi  <nobu.nokada@softhome.net>
-
-	* misc/ruby-mode.el (ruby-parse-region): not treat method `begin'
-	  and `end' as reserved words.
-
-	* misc/ruby-mode.el (ruby-font-lock-docs): ignore after `=begin'
-	  and `=end'.
-
-	* misc/ruby-mode.el (ruby-font-lock-keywords, hilit-set-mode-patterns):
-	  added `yield' to keywords.
-
-	* misc/ruby-mode.el (ruby-font-lock-keywords, hilit-set-mode-patterns):
-	  matches keywords at end of buffer.
-
-Sun Mar  5 18:08:53 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.6.
-
-	* lib/net/http.rb:  allow to omit 'start'
-
-Tue Feb 29 01:08:26 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* range.c (range_initialize): initialization done in `initialize';
-	  `initialize' should not be called more than once.
-
-	* object.c (Init_Object): default `initialize' should take zero
-	  argument.
-
-	* time.c (time_s_new): call `initialize' in Time::new.
-
-Sat Feb 26 22:39:31 2000  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* string.c (rb_str_times): fix String#* with huge string.
-
-Sat Feb 26 00:14:59 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (dir_s_new): call `initialize' in Dir::new.
-
-Fri Feb 25 23:01:49 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ruby.h: export ruby_safe_level by EXTERN for mswin32.
-	* win32/ruby.def: regular maintenance.
-
-Fri Feb 25 22:12:46 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_reopen): IO#reopen should accept path as well.
-
-	* string.c (rb_str_s_new): call `initialize' in String::new.
-
-	* hash.c (rb_hash_s_new): call `initialize' in Hash::new.
-
-	* array.c (rb_ary_s_new): call `initialize' in Array::new.
-
-Fri Feb 25 12:50:20 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_start_timer): interval changed to 10ms from 50ms.
-
-Fri Feb 25 06:42:26 2000  GOTOU YUUZOU  <gotoyuzo@notwork.org>
-
-	* ext/socket/socket.c (ip_addrsetup): hostp should remain NULL if
-	  host is nil.
-
-Thu Feb 24 16:53:47 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_schedule): priority check for sleep expired
-	  threads needed.
-
-Wed Feb 23 14:22:32 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_join): forgot to initialize a local variable
-	  `taint'.
-
-Tue Feb 22 07:40:55 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (Init_Regexp): renamed to MatchData, old name MatchingData
-	  remain as alias.
-
-Tue Feb 22 00:20:21 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/protocol.rb, smtp.rb, pop.rb, http.rb: 1.1.5.
-
-	* lib/net/session.rb: rename to protocol.rb
-
-	* lib/net/protocol.rb: ProtocolSocket -> Net::Socket
-
-	* lib/net/protocol.rb: Net::Socket#write, write_pendstr
-	  can take block
-
-	* lib/net/smtp.rb: new methods SMTP#ready SMTPCommand#write_mail
-
-	* lib/net/pop.rb: POPMail#pop can take block
-
-Sat Feb 19 23:58:51 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): pop_loop should not pop at forward jump.
-
-Fri Feb 18 17:15:40 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (method_clone): method objects are now clonable.
-
-Fri Feb 18 00:27:34 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_shared_variable_declare): shared variable (aka
-	  class/module variable) introduced.  prefix `@@'. experimental.
-
-	* class.c (rb_scan_args): new format char '&'.
-
-Thu Feb 17 19:09:05 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (mypopen): don't close handle if it is not assigned.
-	* win32/win32.c (my_open_osfhandle): support O_NOINHERIT flag.
-	* win32/win32.c (win32_getcwd): rename getcwd to win32_getcwd
-	  in order to avoid using the C/C++ runtime DLL's getcwd.
-	  Use CharNext() to process directory name.
-	* win32/win32.h: map getcwd to win32_getcwd.
-
-Wed Feb 16 00:32:49 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (method_arity): nd_rest is -1 for no rest argument.
-
-	* process.c (proc_waitpid): returns nil when waitpid(2) returns 0.
-
-Tue Feb 15 01:47:00 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* process.c (rb_f_waitpid): pid_t should be signed.
-
-Mon Feb 14 13:59:01 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): yylex yields wrong tokens for `:foo=~expr'.
-
-	* ruby.c (load_file): exit if reading file is empty.
-
-Mon Feb 14 03:34:52 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): `foo.bar=1' should be <foo><.><bar><=><1>,
-	  not <foo><.><bar=><1>.
-
-	* eval.c (rb_thread_restore_context): process according to
-	  RESTORE_* is moved after longjmp().
-
-	* eval.c (thread_switch): new function to process RESTORE_*.
-
-Sun Feb 13 16:19:49 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ruby.c (require_libraries): don't access freed memory.
-
-	* ruby.c (add_modules): ditto.
-
-Fri Feb 11 12:06:22 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_quotedwords): %w() need to split not only by mere
-	  spaces, but by all whitespaces.
-
-Thu Feb 10 02:12:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_index_m): did not support negative offset.
-
-Wed Feb  9 21:54:26 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/getaddrinfo.c: gcc --traditional support.
-	  Rearrange headers to work AC_C_CONST.
-	* ext/socket/getnameinfo.c: ditto.
-	* ext/socket/socket.c: mswin32: use double instead of long long.
-
-Wed Feb  9 16:30:41 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (num_coerce): should return [y, x].
-
-Wed Feb  9 11:07:30 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (ruby_prog_init): loadpath structure changed.
-
-Tue Feb  8 02:07:33 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): optimize for \G at top.
-
-	* regex.c (re_compile_pattern): \G introduced.
-
-	* regex.c (re_match): ditto.
-
-	* string.c (str_sub_bang): old behavior restored: bang method
-	  returns nil if string not changed.
-
-	* regex.c (re_compile_pattern): support independent subexpression
-	  `(?>pattern)'. 
-
-	* regex.c (re_match): ditto.
-
-Mon Feb  7 15:51:08 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): now understands interrupts under Ruby.
-
-Mon Feb  7 07:51:52 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_uniq_bang): always return an Array.
-
-	* array.c (rb_ary_compact_bang): ditto.
-
-	* array.c (rb_ary_flatten_bang): ditto.
-
-	* hash.c (rb_hash_reject): returns a Hash, not an Array.
-
-	* hash.c (env_reject): ditto.
-
-Fri Feb  4 10:20:25 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (scan_once): scan now leaves information about the last
-	  successful pattern match in $&.
-
-	* io.c (rb_io_close): should not check closed IO.
-
-Fri Feb  4 05:44:01 2000  Kentaro Inagaki  <inagaki@tg.rim.or.jp>
-
-	* ext/socket/socket.c (s_recv): TRAP_BEG after retry entry.
-
-Wed Feb  2 22:33:45 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* eval.c (rb_thread_start): receives argument from outside, like
-	  `Thread::start(1,2,3){|a,b,c| ... }'.
-
-Wed Feb  2 22:14:40 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_regsub): should check regs->num_regs.
-
-	* re.c (rb_reg_search): remove matchcache, use static struct
-	  re_register instead. 
-
-	* re.c (match_getter): avoid cloning match data.
-
-Wed Feb  2 17:12:15 2000  Dave Thomas  <Dave@Thomases.com>
-
-	* samples/eval.rb: Rescue new ScriptError exception
-
-Wed Feb  2 02:06:07 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_gsub_bang): gsub! now leaves information about the
-	  last successful pattern match in $&.
-
-Mon Jan 31 15:24:58 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_sub_bang): bang method returns string always.
-	  experimental.
-
-Sun Jan 30 17:58:09 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* eval.c: arrange to use setitimer(2) for BOW, DJGPP
-
-	* defines.h: ditto. use random(3) on cygwin b20.1.
-
-Sun Jan 30 17:20:16 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* eval.c: use getrlimit(2) on DJGPP.
-
-Thu Jan 27 01:27:10 2000  GOTO Kentaro  <gotoken@math.sci.hokudai.ac.jp>
-
-	* dir.c (glob): glob pattern "/*" did not match.
-
-Wed Jan 26 22:30:47 2000  Shigeo Kobayashi  <shigeo@tinyforest.gr.jp>
-
-	* numeric.c (flo_modulo): wrong result for negative modulo.
-
-Wed Jan 26 02:01:57 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (test_c): should use S_ISCHR.
-
-	* file.c (rb_stat_c): ditto.
-
-	* string.c (rb_str_each_line): should propagate tainting.
-
-Tue Jan 25 04:01:34 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_obj_freeze): all objects made freezable.
-
-Tue Jan 25 00:37:01 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: use AC_CHECK_TOOL for cross compiling.
-
-Mon Jan 24 19:01:54 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* array.c (rb_protect_inspect): should be checked by id of
-	  objects; not by object themselves.
-
-Mon Jan 24 18:48:08 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* eval.c (rb_eval): too many warnings;  warned on every method
-	  overriding.  should be on method discarding.
-
-Mon Jan 24 02:56:44 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): -2.abs should be `(-2).abs' to accomplish the
-	  principle of less surprise.  `+2' too.
-
-	* eval.c (rb_eval): when defining class is already there, and
-	  superclass differ, throw away the old class.
-
-	* variable.c (rb_const_set): gives warning again on constant
-	  redefinition.
-
-	* error.c (Init_Exception): SyntaxError, NameError, LoadError and
-	  NotImplementError are subclasses of ScriptError<Exception, not
-	  StandardError.  experimental.
-
-Sat Jan 22 00:00:41 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_quotedwords): no longer use `String#split'.
-	  and enable space escape within quoted word list.
-	  e.g. %w(a\ b\ c abc) => ["a b c", "abc"].
-
-	* string.c (rb_str_slice_bang): new method `slice!'.
-
-Fri Jan 21 21:56:08 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb, http.rb: 1.1.4.
-
-	* lib/net/http.rb: can receive messages which have
-	  no Content-Length:.
-
-Fri Jan 21 16:15:59 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thgroup_s_new): new class ThreadGroup.
-
-Tue Jan 18 12:24:28 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* struct.c (Init_Struct): remove Struct's own hash and eql?.
-
-Sat Jan 15 22:21:08 2000  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* eval.c (search_method): argument klass may be 0.
-
-Sat Jan 15 15:03:46 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* enum.c (enum_index): remove this method.
-
-	* enum.c: remove use of pointers to local variables. find,
-	  find_all, min, max, index, member?, each_with_index, 
-
-	* eval.c (massign): multiple assignment does not use to_a anymore.
-	  experimental.
-
-Fri Jan 14 12:22:04 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_replace): use memmove instead of memcpy for
-	  overwrapping strings (e.g. a[1] = a).
-
-Thu Jan 13 11:12:40 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (arg_add): use new node, ARGSPUSH.
-
-Mon Jan 10 18:32:28 2000  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* marshal.c (w_object): forgot an argument to call w_ivar().
-
-Sun Jan  9 18:13:51 2000  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* random.c: first was not defined unless HAVE_RANDOM.
-
-Sat Jan  8 19:02:49 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_sysread): raise IOError for buffered IO.
-
-	* ext/socket/socket.c (s_recv): ditto.
-
-Fri Jan  7 00:59:29 2000  Masahiro Tomita  <tommy@tmtm.org>
-
-	* io.c (io_fread): TRAP_BEG/TRAP_END added around getc().
-
-Thu Jan  6 00:39:54 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* random.c (rb_f_rand): should be initialized unless srand is
-	  called before.
-
-Wed Jan  5 16:59:34 2000  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb, http.rb: 1.1.3.
-
-	* lib/net/session.rb: Session -> Protocol, ...
-
-	* lib/net/http.rb: HTTPCommand implementation was changed.
-
-Wed Jan  5 02:14:46 2000  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* parse.y: Fix SEGV on empty parens with UMINUS or UPLUS.
-
-Tue Jan  4 22:25:54 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (stmt): `() while cond' dumped core.
-
-Tue Jan  4 06:04:14 2000  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* configure.in: modify for cross-compiling.
-	  use target_* instead of host_*. 
-	  use AC_CANONICAL_TARGET.
-
-	* Makefile.in: ditto.
-
-	* cygwin/GNUmakefile.in: ditto.
-
-Sat Jan  1 13:26:14 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_yield_0): force_recycle ruby_dyna_vars to gain
-	  performance.
-
-	* array.c (rb_ary_delete_at_m): takes same argument pattern with
-	  rb_ary_aref.
-
-Sat Jan  1 10:12:26 2000  Nobuyoshi Nakada  <nobu.nokada@softhome.net>
-
-	* ruby.h,util.c (rb_special_const_p): peep hole optimization.
-
-	* ruby.h,util.c (rb_test_false_or_nil): removed.
-
-	* ruby.h (RTEST, SPECIAL_CONST_P): peep hole optimization.
-
-	* ruby.h (FL_ABLE, FL_SET, FL_UNSET, FL_REVERSE): made expressions
-	  not statements.
-
-	* ruby.h (OBJ_INFECT): newly added macro which copies taint from
-	  `s' to `x'.
-
-Sat Jan  1 02:04:18 2000  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_safe_level): new method.
-
-	* eval.c (rb_yield_0): recycle dyna_var_map to reduce object
-	  allocation. 
-
-Fri Dec 31 00:52:48 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c: thread independent trace_func not needed.
-
-Thu Dec 30 14:47:31 1999  akira yamada  <akira@ruby-lang.org>
-
-	* configure.in: specifies -soname in LIBRUBY_DLDFLAGS on linux
-	  platforms.
-
-Thu Dec 30 10:51:27 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c,io.c,hash,c,re.c,string.c: `_m' suffix instead of
-	  `_method' for wrapper functions to implement method,
-	  e.g. `rb_str_join_m()'.
-
-Thu Dec 30 02:08:02 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (rb_cstr2inum): non-numeric format check added.
-	  currently it works only with base == 0 (i.e. Integer()).
-
-	* bignum.c (rb_str2inum): now takes VALUE to 1st argument.  null
-	  byte check added.
-
-	* array.c (rb_ary_replace): unless replacement is an array,
-	  replacement shall be converted to array by `[replacement]', not
-	  by `replacement.to_a'.
-
-	* array.c (rb_ary_plus): right operand must be an array.
-
-	* array.c (rb_ary_concat): argument must be an array.
-
-Mon Dec 27 12:35:47 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/socket.c (sock_finalize): mswin32: fix socket handle leak.
-
-	* win32/win32.c (myfdclose): ditto.
-
-Sun Dec 26 23:15:13 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (mypopen): raise catchable error instead of rb_fatal.
-	* win32/win32.c (mypclose): fix process handle leak.
-
-Sun Dec 26 16:17:11 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/Win32API/Win32API.c (Win32API_initialize): use UINT2NUM
-	  instead of INT2NUM to set __dll__ and __proc__.
-
-Sat Dec 25 00:08:59 1999  KANEKO Naoshi  <wbs01621@mail.wbs.ne.jp>
-
-	* ext/Win32API/Win32API.c (Win32API_Call): remove 'dword ptr'
-	  from _asm.
-
-Fri Dec 24 10:26:47 1999  Koji Oda  <oda@bsd1.qnes.nec.co.jp>
-
-	* win32/win32.h: use "C++" linkage.
-
-Fri Dec 24 02:00:57 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (THREAD_ALLOC): should initialize th->trace.
-
-Fri Dec 24 00:43:39 1999  KANEKO Naoshi  <wbs01621@mail.wbs.ne.jp>
-
-	* io.c (pipe_open): check for `fptr->f == NULL'.
-	* win32/win32.c (mypopen): STDERR does not work during ` function.
-
-Wed Dec 22 22:50:40 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb, http.rb: 1.1.2.
-
-	* lib/net/http.rb: HTTP support is enhanced a little
-
-	* lib/net/http.rb: support proxy
-
-Tue Dec 21 17:21:28 1999  Koji Oda  <oda@bsd1.qnes.nec.co.jp>
-
-	* ext/socket/socket.c (sock_finalize): mswin32: fix FILE* leak.
-
-Tue Dec 21 05:33:56 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb, http.rb: 1.1.1.
-
-	* lib/net/http.rb: support HTTP chunk
-
-Mon Dec 20 19:08:12 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* file.c (rb_file_s_expand_path): handle dir separator correctly.
-
-Sun Dec 19 22:56:31 1999  KANEKO Naoshi  <wbs01621@mail.wbs.ne.jp>
-
-	* lib/find.rb: support dosish root directory.
-	* win32/Makefile: ditto.
-	* win32/config.status: ditto.
-	* win32/win32.c (opendir): ditto.
-	* win32/win32.c (opendir): use CharPrev() to get last character
-	  of the directory name.
-
-Sat Dec 18 03:00:01 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (path_check_1): check should be done by absolute path. 
-
-	* marshal.c (r_ivar): should restore generic_ivar too.
-
-	* marshal.c (w_ivar): should dump generic_ivar too.
-
-Fri Dec 17 22:46:46 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb, http.rb: 1.1.0.
-
-	* lib/net/http.rb: test release
-
-	* lib/net/session.rb: support class swapping
-
-	* lib/net/session.rb: Socket#flush_rbuf
-
-	* lib/net/session.rb: doquote -> Net.quote
-
-Fri Dec 17 19:27:43 1999  IWAMURO Motonori  <iwa@mmp.fujitsu.co.jp>
-
-	* eval.c (rb_load): should initialize ruby_frame->last_class.
-
-Wed Dec 15 01:35:29 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (proc_options): option to change directory changed to
-	  `-C' like tar.
-
-	* ruby.c (proc_options): argv boundary check for `-X'.
-
-Mon Dec 13 15:15:31 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_adjust_startpos): separate startpos adjustment
-	  because of major performance drawback.
-
-	* class.c (rb_singleton_class): tainted status of the singleton
-	  class must be synchronized with the object.
-
-	* eval.c (rb_thread_schedule): implement thread priority.
-
-Sat Dec 11 03:34:38 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (mark_hashentry): key should be VALUE, not ID.
-
-	* io.c (argf_eof): should check next_p too.
-
-Thu Dec  9 18:09:13 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* error.c (exc_set_backtrace): forgot to declare a VALUE argument.
-
-Thu Dec  9 14:19:31 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_obj_taint): explicit tainting must be prohibited at
-	  level 4 to prevent polluting trusted object by untrusted code.
-
-	* file.c: file operations (stat, lstat, chmod, chown, umask,
-	  truncate, flock) are prohibited in level 2 (was level 4).
-
-Wed Dec  8 11:48:23 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_f_require): prohibiting require() in the secure mode
-	  cause serious autoloading error.
-
-	* variable.c (rb_obj_instance_variables): don't need to prohibit
-	  to get list of instance variable names of untainted objects.
-
-	* variable.c (rb_ivar_get): don't need to prohibit to get instance
-	  variables of untainted objects.
-
-	* variable.c (rb_mod_remove_const): should prohibit constant
-	  removals too. 
-
-Wed Dec  8 09:23:01 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): should try autoloading before defining
-	  class/module at the toplevel.
-
-Tue Dec  7 22:15:30 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* configure.in: Modified rb_cv_rshift_sign detect routine and
-	  more simple/fast RSHIFT() for hpux-10.x.
-
-Tue Dec  7 11:16:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (Init_eval): calculate stack limit from rlimit where
-	  getrlimit(2) is available.
-
-Tue Dec  7 09:57:33 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* file.c (rb_file_ftype): should have removed mode_t.
-
-Mon Dec  6 15:55:30 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* numeric.c (fix_rshift): Fix -1 >> 32 returned 0 (should be -1).
-
-	* numeric.c (fix_rshift): Fix  1 >> -1 returned 0 (should be 2).
-
-Mon Dec  6 11:47:23 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (rb_f_sprintf): formatted string must be tainted if
-	  any of parameters is a tainted string.
-
-	* file.c (rb_file_s_expand_path): expanded file path need not to
-	  be tainted always.
-
-Sun Dec  5 20:25:29 1999  Katsuhiro Ueno  <unnie@blue.sky.or.jp>
-
-	* eval.c (Init_Proc): simple typo.
-
-	* gc.c (add_heap): sizeof(RVALUE*), not sizeof(RVALUE).
-
-Sat Dec  4 01:40:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): adjust startpos for multibyte match unless
-	  the first pattern is forced byte match.
-
-	* bignum.c (rb_big_rand): should not use rand/random where drand48
-	  may be available.  RANDOM_NUMBER should be provided from outside.
-
-Fri Dec  3 09:54:59 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (moreswitches): there may be trailing garbage at #!
-	  line.
-
-	* eval.c (rb_f_require): should check require 'feature.o' too.
-
-Thu Dec  2 11:58:15 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* eval.c (rb_thread_loading): should maintain loading_tbl.
-
-Thu Dec  2 10:21:43 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_loading_done): wrong parameter to st_delete().
-
-Wed Dec  1 11:24:06 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* ruby.c (process_sflag): process -s properly (should not force `--').
-
-Wed Dec  1 09:47:33 1999  Kazunori NISHI  <kazunori@swlab.csce.kyushu-u.ac.jp>
-
-	* string.c (rb_str_split_method): should increment end too.
-
-Tue Nov 30 18:00:45 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c: MARSHAL_MINOR incremented; format version is 4.2.
-
-	* marshal.c (w_object): distinguish class and module.
-
-	* marshal.c (w_object): save hash's default value.
-
-	* marshal.c (r_object): restore hash's default value.
-
-Tue Nov 30 01:46:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_source): generated source string must be tainted if
-	  regex is tainted.
-
-	* file.c (rb_file_s_basename): basename should not be tainted
-	  unless the original path is tainted.
-
-	* file.c (rb_file_s_dirname): ditto.
-
-Mon Nov 29 20:42:13 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* file.c (stat_new): Struct::Stat -> File::Stat; Stat is no longer
-	  a Struct.
-
-Mon Nov 29 15:28:52 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_path2class): evaluated value from path should be
-	  module or class.
-
-Fri Nov 26 18:12:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_exec_end_proc): should remove only end_procs defined
-	  within load wrapper.
-
-	* eval.c (rb_load): save and restore ruby_wrapper around loading.
-
-	* eval.c (rb_mark_end_proc): mark end procs registered by END{} or
-	  at_exit{}. 
-
-	* eval.c (rb_set_end_proc): should not call rb_global_variable()
-	  on heap address;  it crashed mod_ruby.
-
-Mon Nov 22 14:07:24 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ruby.c (proc_options): variable e_script should be visited by
-	  garbage collector.
-
-Sat Nov 20 10:10:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (inspect_i): value may be nil, check revised.
-
-Fri Nov 19 18:06:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (glob): recursive wildcard match by `**' ala zsh.
-
-Fri Nov 19 11:44:26 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* variable.c: was returning void value.
-
-Fri Nov 19 03:57:22 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* file.c: add methods Stat struct class to reduce stat(2).
-
-Thu Nov 18 16:18:27 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/pstore.rb: mutual lock by flock(2).
-
-Thu Nov 18 11:44:13 1999  Masahiro Tomita  <tommy@tmtm.org>
-
-	* io.c (read_all): should check bytes too.
-
-Wed Nov 17 02:40:40 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (Init_IO): $defout (alias of $>) added.
-
-Tue Nov 16 09:47:14 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/pstore.rb: add mutual lock using symlink.
-
-Mon Nov 15 16:50:34 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* enum.c (enum_grep): non matching grep returns an empty array, no
-	  longer returns nil.
-
-	* enum.c (enum_grep): grep with block returns collection of
-	  evaluated values of block over matched elements.
-
-Mon Nov 15 04:50:33 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* re.c (rb_reg_source): should not call rb_reg_expr_str()
-	  everytime.
-
-Sat Nov 13 07:34:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_mod_constants): traverse superclasses to collect
-	  constants.
-
-	* eval.c (assign): modified for shared variables.
-
-	* eval.c (rb_eval): search nested scope, then superclasses to
-	  assign shared variables within methods.
-
-	* eval.c (rb_eval): remove warnings from constants modification,
-	  because they are no longer constants.
-
-	* parse.y (node_assign): modified for shared variables.
-
-	* parse.y (assignable): allow constant assignment in methods;
-	  constants should be called `shared variable'.
-
-Fri Nov 12 23:52:19 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* process.c (rb_f_system): argument check for NT, __EMX__, DJGPP.
-
-Wed Nov 10 21:54:11 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* hash.c (rb_any_cmp): Fixed return without value.
-
-Wed Nov 10 17:57:06 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c: incorporate <yasuf@big.or.jp>'s sprintf patch at
-	  [ruby-dev:7754]. 
-
-Wed Nov 10 08:28:53 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_call0): supply class parameter for each invocation.
-
-Tue Nov  9 13:21:04 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* configure.in: AC_MINIX move to before AC_EXEEXT and AC_OBJEXT.
-
-Mon Nov  8 19:52:29 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* configure.in: Renamed AC_CHAR_UNSIGNED to AC_C_CHAR_UNSIGNED.
-
-	* configure.in: Added default to AC_CHECK_SIZEOF().
-
-Mon Nov  8 14:28:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (stmt): rescue modifier added to the syntax.
-
-	* keywords: kRESCUE_MOD added.
-
-	* eval.c (rb_f_eval): fake outer scope when eval() called without
-	  bindings.
-
-	* eval.c (rb_f_binding): should copy last_class in the outer frame too.
-
-Sun Nov  7 18:31:04 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* eval.c (is_defined): last_class may be 0.
-
-Sat Nov  6 19:26:55 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* Makefile.in: Added depend entry make parse.@OBJEXT@ from parse.c
-	  for UCB make
-
-Thu Nov  4 17:41:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): \< (wordbeg), \> (wordend) disabled.
-
-Wed Nov  3 08:52:57 1999  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* io.c (Init_IO): forgot to use INT2FIX() around SEEK_SET, etc. 
-
-Wed Nov  3 00:25:20 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_split_method): use mbclen2() to handle kcode
-	  option of regexp objects.
-
-Mon Nov  1 14:22:15 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* eval.c (rb_eval): reduce recursive calls to rb_eval()
-	  case of ||= and &&= .
-
-Sun Oct 31 13:12:42 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* regex.c (re_compile_pattern): wrong [\W] match.
-
-Fri Oct 29 16:57:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/nkf/lib/kconv.rb: new String methods (kconv, tojis, toeuc,
-	  tosjis).
-
-	* time.c (time_s_at): now accepts optional second argument to
-	  specify micro second.
-
-Thu Oct 28 13:35:40 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_split_method): should be mbchar aware with
-	  single char separators.
-
-Wed Oct 27 12:57:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* random.c (rb_f_srand): random seed should be unsigned.
-
-Tue Oct 26 23:58:15 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_collect): collect for better performance.
-
-Tue Oct 26 19:20:54 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* marshal.c (r_object): should register class/module objects.
-
-Sat Oct 23 15:59:39 1999  Takaaki Tateishi  <ttate@jaist.ac.jp>
-
-	* process.c (rb_f_system): should require at least one argument.
-
-Sat Oct 23 12:42:44 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* enum.c (enum_collect): collect without block will collect
-	  elements in enumerable.
-
-Thu Oct 21 16:14:19 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (moreswitches): function to process string option;
-	  the name is stolen from perl (not implementation).
-
-	* ruby.c (proc_options): use RUBYOPT environment variable to
-	  retrieve the default options.
-
-	* dir.c (fnmatch): use eban's fnmatch; do not depend on systems's
-	  fnmatch (which may have portability problem) anymore.
-
-Wed Oct 20 15:14:24 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (marshal_load): should protect the generated object
-	  table (arg->data) from GC.
-
-Mon Oct 18 16:15:52 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/nkf/nkf.c (rb_nkf_kconv): output should be NUL terminated.
-
-Mon Oct 18 09:03:01 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb: 1.0.3
-
-	* lib/net/pop.rb: new methods POP3Command#uidl, POPMail#uidl.
-
-Sun Oct 17 03:35:33 1999  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* array.c (rb_ary_pop): forgot some freeze checks.
-
-Sat Oct 16 12:57:53 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* array.c (rb_ary_sort): always returns the copied array.
-
-Fri Oct 15 22:50:41 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* error.c (sys_nerr): on CYGWIN, it is _sys_nerr.
-
-Fri Oct 15 01:32:31 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* io.c (rb_io_ctl) :need to use NUM2ULONG, not NUM2INT.
-
-	* ext/Win32API/Win32API.c (Win32API_Call): need to use NUM2ULONG,
-	  not NUM2INT.
-
-Fri Oct 15 00:22:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (Init_Regexp): super class of the MatchingData, which was
-	  Data, to be Object.
-
-	* eval.c (ruby_run): evaluate required libraries before load &
-	  compiling the script.
-
-	* parse.y (lex_getline): retrieve a line from the stream, saving
-	  lines in the table in debug mode.
-
-	* eval.c (call_trace_func): treat the case ruby_sourcefile is null.
-
-Thu Oct 14 02:00:10 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (string): compile time string concatenation.
-
-Wed Oct 13 07:28:09 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb: 1.0.2
-
-	* lib/net/session.rb: new method Session#set_pipe.
-
-	* lib/net/session.rb, smtp.rb, pop.rb: add RD documentation.
-
-Wed Oct 13 02:17:05 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* array.c (rb_ary_plus): remove recursion.
-
-	* array.c (rb_ary_sort_bang): detect modify attempt.
-
-Wed Oct 13 02:17:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (block_pass): should copy block to prevent modifications.
-	  tag in the structure should be updated from latest prot_tag.
-
-	* eval.c (proc_s_new): tag in struct BLOCK should not point into
-	  unused stack.
-
-	* dir.c (dir_s_glob): iterate over generated matching filenames if
-	  the block is given to the method.
-
-	* array.c (rb_ary_at): new methods; at, first, last.
-
-	* hash.c (rb_hash_fetch): raises exception unless the default
-	  value is supplied.
-
-	* hash.c (rb_hash_s_create): need not remove nil from value.
-
-	* hash.c (rb_hash_aset): setting value to nil does not remove key
-	  anymore.
-
-Tue Oct 12 22:29:04 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_read): length may be 0 or negative.
-
-Tue Oct 12 13:26:27 1999  Jun-ichiro itojun Hagino  <itojun@itojun.org>
-
-	* signal.c (posix_signal): RETSIGTYPE may be void.
-
-Tue Oct 12 03:28:03 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* array.c (rb_ary_delete_at): allows negative position.
-
-Mon Oct 11 17:42:25 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* parse.y (rb_intern): should generate distinct ID_ATTRSET symbols
-	  for the name with multiple `='s at the end.
-
-	* Makefile.in (CPPFLAGS): separate cpp flags from CFLAGS.
-
-Mon Oct 11 07:27:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): should not execute the `else' clause on the
-	  case the exceptions are handled by the `rescue' clause.
-
-	* signal.c (Init_signal): ignore SIGPIPE by default.
-
-Wed Oct  6 17:13:19 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* ruby.c (addpath): rubylib_mangled_path() modified.
-
-Mon Oct  4 12:42:32 1999  Kazuhiko Izawa  <izawa@erec.che.tohoku.ac.jp>
-
-	* pack.c (pack_unpack): % in printf format should be %%.
-
-Mon Oct  4 10:01:40 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_obj_instance_variables): should always return
-	  array for all object can have instance variables now.
-
-Mon Oct  4 00:08:34 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (OFF16): need to adjust pointer address to pack/unpack on
-	  64bit machines.
-
-Sun Oct 03 03:05:59 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* time.c (time_arg): mktime y2k problem.
-
-Sun Sep 26 16:54:45 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* parse.y (here_document): `\r' handling for here documents.
-
-Wed Sep 22 09:20:11 1999  Masahiro Tomita  <tommy@tmtm.org>
-
-	* ext/socket/socket.c: SOCKS5 support.
-
-Wed Sep 22 07:33:23 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb: 1.0.1
-
-	* lib/net/pop.rb: APOP did not work.
-
-	* lib/net/pop.rb: modify the way to make APOP challenge.
-
-Wed Sep 22 00:35:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_include): should return boolean value.
-
-	* regex.c (re_compile_fastmap): wrong comparison with mbc.
-
-	* eval.c (specific_eval): default sourcefile name should be
-	  "(eval)" for module_eval etc.
-
-Wed Sep 22 00:06:07 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/Makefile: update rules.
-
-	* io.c (io_fread): should not assign in char, it maybe -1.
-
-Tue Sep 21 23:57:54 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (call_trace_func): should not propagate retval in
-	  trace_func. 
-
-Mon Sep 20 21:35:39 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (myselect): assume non socket files are always
-	  readable/writable.
-
-Mon Sep 20 01:08:02 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_fread): should not block other threads.
-
-	* io.c (rb_io_synchronized): renamed from rb_io_unbuffered(); do
-	  not call setbuf(NULL) anymore.
-
-Sat Sep 18 13:45:43 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* stable version 1.4.2 released.
-
-Fri Sep 17 23:24:17 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* eval.c (rb_f_missing): dumped core if no argument given.
-
-Fri Sep 17 23:21:06 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* win32/win32.c (myselect): translate WSAEINTR, WSAENOTSOCK into
-	  UNIX errno constants.
-
-Fri Sep 17 00:52:27 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (arg): assignable() may return 0.
-
-Thu Sep 16 20:46:23 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* eval.c (rb_eval): was doubly evaluating the return expression.
-
-Thu Sep 16 18:40:08 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* stable version 1.4.1 released.
-
-Thu Sep 16 11:33:22 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (rb_str_match): should return nil.
-
-Wed Sep 15 22:46:37 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_s_quote): should quote `-' too.
-
-Tue Sep 14 15:23:22 1999  Nobuyoshi Nakada  <nobu.nakada@nifty.ne.jp>
-
-	* parse.y (yylex): no need to ignore `\r' here.
-
-	* parse.y (nextc): strip `\r' from text.
-
-	* parse.y (nextc): support `__END__\r\n' type terminator.
-
-Mon Sep 13 10:49:19 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* eval.c (rb_eval): needless RTEST(ruby_verbose) removed.
-
-Mon Sep 13 09:10:11 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/net/session.rb, smtp.rb, pop.rb: 1.0.0
-
-Wed Sep  8 11:37:38 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* time.c (make_time_t): bit more strict comparison.
-
-Tue Sep  7 00:50:56 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* range.c (range_each): use rb_str_upto() for strings.
-
-	* string.c (rb_str_upto): set upper limit by comparing curr <= end.
-
-	* range.c (range_each): should check equality to handle magic
-	  increment.
-
-Mon Sep  6 22:43:33 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): break/next/redo available within -n/-p loop.
-
-Fri Sep  3 11:14:31 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* compar.c (cmp_equal): should not raise exception; protect by
-	  rb_rescue().
-
-Thu Sep  2 05:23:05 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* file.c (rb_file_s_expand_path): use dirsep, instead of character
-	  literal '/'.
-
-	* file.c (rb_file_s_expand_path): reduce multiple dirsep at the top.
-
-Wed Sep  1 00:28:27 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_call): call rb_undefined() if a method appears not to
-	  be exist explicitly from cache.
-
-	* eval.c (rb_method_boundp): check method cache before calling
-	  rb_get_method_body().
-
-	* eval.c (rb_get_method_body): store method non-existence
-	  information in the cache.
-
-	* random.c (rb_f_srand): use getpid(2) to generate seed.
-
-	* regex.c (re_match): do not apply partial mbc match for
-	  charset_not.
-
-	* regex.c (re_compile_pattern): put extended literal prefix (0xff)
-	  only before numeric literals, not before all >0x80 char.
-
-	* regex.c (re_compile_pattern): put numeric literal in extended
-	  charset region, not normal charset bits.
-
-	* regex.c (re_compile_fastmap): calculate fastmap for charset and
-	  charset_not to treat numeric literal (e.g. \246) specially.
-
-Fri Aug 28 17:32:55 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* eval.c (rb_eval): should set return value (nil) explicitly if a
-	  value is omitted for return statement.
-
-Thu Aug 26 15:06:11 1999  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* gc.c (rb_gc): local variables may be placed beyond stack_end, so
-	  use an address from alloca(1) on non C_ALLOCA platforms.
-
-Thu Aug 26 01:24:17 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (rb_f_sprintf): "%%" is legal, but "%3.14%" is not.
-
-Mon Aug 23 00:00:54 1999  Tsukada Takuya  <tsukada@fminn.nagano.nagano.jp>
-
-	* regex.c (re_compile_fastmap): wrong macro caused memory leak.
-
-Sat Aug 21 11:30:51 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (ADJ): should not adjust addresses to data on heap.
-
-Fri Aug 20 20:50:58 1999  Kenji Nagasawa  <kenn@hma.att.ne.jp>
-
-	* defines.h (PATH_SEP): path separator is ";" for OS/2.
-
-Thu Aug 19 10:50:43 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* gc.c (rb_gc): add volatile to avoid GCC optimize bug(?).
-
-Wed Aug 18 23:48:10 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* due to disk trouble, some change records were lost.  several
-	  modification made to eval.c, gc.c, io.c, pack.c,
-	  ext/extmk.rb.in, and lib/mkmf.rb.
-
-Fri Aug 13 15:41:39 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* stable version 1.4.0 released.
-
-Fri Aug 13 03:16:07 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (argf_forward): since $stdout may be non-IO, ARGF.file is
-	  not guaranteed to be IO.  check and forwarding added to every ARGF
-	  method.
-
-	* io.c (set_outfile): $stdout/$stderr may not be IO now.
-
-	* io.c (set_stdin): $stdin may not be IO now.
-
-	* range.c (rb_range_beg_len): round `end' to length as documented.
-
-	* io.c (Init_IO): preserve original stdin/stdout/stderr.
-
-Thu Aug 12 13:44:33 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (Init_load): require receives 1 argument.
-
-	* eval.c (frame_dup): should clear tmp to avoid dangling
-	  references.
-
-Wed Aug 11 13:33:13 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* eval.c (rb_eval): no automatic aggregate initialization.
-
-	* eval.c (module_setup): ditto.
-
-Wed Aug 11 18:18:41 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* eval.c (yield_under_i): automatic aggregate initialization is an
-	  ANSI feature.
-
-Wed Aug 11 10:10:02 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): parse `[].length==0' as `([].length)==0', not
-	  `([].length=)=0'
-
-	* parse.y (yylex): parse `[].length!=0' as `([].length)!=0', not
-	  `([].length!)=0'
-
-	* parse.y (peek): peek-in lexical buffer.
-
-Wed Aug 11 00:34:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): bug on backward jump adjustment concerning
-	  stop_paren.
-
-Tue Aug 10 14:54:25 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/nkf/nkf.c (rb_nkf_guess): binary detection was wrong.
-
-Tue Aug 10 00:07:36 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_clone): should use CLONESETUP().
-
-Mon Aug  9 23:57:07 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h (CLONESETUP): should have copied generic instance
-	  variables too.
-
-Mon Aug  9 10:46:54 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/extconf.rb: add check for <arpa/nameser.h> and
-	  <resolv.h>.
-
-Sat Aug  7 13:19:06 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* numeric.c (flo_cmp): comparing NaN should not return value.
-	  raises FloatDomainError.
-
-Sat Aug  7 03:09:08 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (blk_free): free copied frames too.
-
-	* eval.c (frame_dup): should copy previous frames from stack to
-	  heap to preserve frame information.
-
-Fri Aug  6 15:01:07 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.7 - version 1.4 beta
-
-	* ext/socket/socket.c (s_recv): UDPsocket#recvfrom now returns
-	  IPsocket#addr information.
-
-	* array.c (rb_ary_subary): ary[-3,3] should not return nil.
-
-Thu Aug  5 10:58:01 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_mark): protect old ruby_frame from GC during it
-	  replaced by eval().
-
-	* eval.c (eval): do not modify frame.prev; binding should preserve
-	  information about calling() too.
-
-	* eval.c (rb_yield_0): no arity check for mere yield; but only for
-	  Proc#call.
-
-Tue Aug  3 22:07:13 1999  Kazuhiro HIWADA  <hiwada@kuee.kyoto-u.ac.jp>
-
-	* object.c (rb_mod_clone): should check if iv_tbl, m_tbl are
-	  initialized.
-
-Tue Aug  3 19:03:02 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_any_cmp): use rb_with_disable_interrupt() to ensure
-	  clearance of rb_prohibit_interrupt even on failure.
-
-	* eval.c (rb_with_disable_interrupt): new function added.
-
-Sat Jul 31 23:23:44 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_create_0): set THREAD_RAISED flag on thread
-	  termination by exception.
-
-	* eval.c (rb_thread_join): `$!' may not be nil for the threads
-	  created in rescue clause.
-
-	* eval.c (rb_thread_status): ditto.
-
-	* eval.c (rb_thread_join): should re-raise exception for already
-	  dead threads too.
-
-Fri Jul 30 17:56:54 1999  GOTO Kentaro  <gotoken@math.sci.hokudai.ac.jp>
-
-	* object.c (rb_mod_ge): wrong comparison.
-
-Fri Jul 30 12:15:44 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/tcltklib/extconf.rb: win32 support.
-
-	* lib/mkmf.rb: use append_library().
-
-	* ext/extmk.rb.in: ditto.
-
-Fri Jul 30 02:11:48 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_delete): should return nil for deleting non
-	  existing item.
-
-	* io.c (rb_io_close): call rb_sys_wait() on explicit close.
-
-	* io.c (rb_io_fptr_close): do not call rb_sys_wait() on finalize.
-
-	* eval.c (yield_under_i): cbase context should be maintained for
-	  Module#module_eval().  suggested by <inaba@st.rim.or.jp>.
-
-Wed Jul 28 01:18:28 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* Makefile.in: add -I$(hdrdir)/lib to install using ftools.
-
-	* util.c: use HAVE_FCNTL_H, not HAVE_FCNTL
-
-Wed Jul 28 18:24:45 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.6 - version 1.4 alpha
-
-Tue Jul 27 09:38:08 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* eval.c (rb_eval): reduce recursive rb_eval() calls by
-	  NODE_BLOCKs. 
-
-Tue Jul 27 01:20:40 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* file.c (rb_file_s_expand_path): drive letter patch.
-
-Mon Jul 26 02:36:31 1999  Shugo Maeda  <shugo@netlab.co.jp>
-
-	* eval.c (rb_load): should clear ruby_nerr.
-
-	* eval.c (rb_thread_join): oldbt should not be empty to unshift.
-
-Sun Jul 25 12:09:16 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* dir.c (push_braces): should treat nested braces.
-
-Fri Jul 23 02:49:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_hash_clear): dummy argument added; suggested by
-	  <eguchi@shizuokanet.ne.jp>.  thanks.
-
-Thu Jul 22 19:37:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_join): get_backtrace() may return Qnil.
-	  typecheck added.
-
-Tue Jul 20 14:36:43 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* range.c (range_each): do not treat String specially (for future
-	  override).
-
-Tue Jul 20 02:28:34 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_gets): $_ should be nil, when get returns nil.
-
-	* io.c (rb_f_gets): ditto.
-
-Mon Jul 19 17:13:09 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_fastmap): should continue fastmap compile
-	  for anychar_repeat, for it's repeat anyway.
-
-Mon Jul 26 13:33:45 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* lib/jcode.rb: replaced by faster code.
-
-Mon Jul 19 01:57:28 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/mkmf.rb: no longer use install program.
-
-	* ext/extmk.rb.in: use miniruby to install programs.
-
-Sat Jul 17 00:06:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (ipaddr): don't do reverse lookup if
-	  attribute do_not_reverse_lookup is set for socket classes.
-	  Experimental.  Note this is a global attribute.
-
-Fri Jul 16 22:18:29 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_eof): use feof() to check EOF already met.
-
-	* io.c (read_all): should return nil at EOF.
-
-Fri Jul 16 13:39:42 1999  Wakou Aoyama  <wakou@fsinet.or.jp>
-
-	* lib/telnet.rb: version 0.231.
-
-Fri Jul 16 10:58:22 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* regex.c (re_match): debug print removed.
-
-Fri Jul 16 09:58:15 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* many files: clean up unused variables found by gcc -Wall.
-
-	* lib/mkmf.rb: better cygwin support etc.
-
-	* ext/extmk.rb.in: ditto.
-
-	* instruby.rb: ditto.
-
-Fri Jul 16 01:37:50 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* string.c (rb_str_squeeze_bang): the type of local variable `c'
-	  should be int, not char.
-
-	* string.c (rb_str_reverse): should always return copy.
-
-Thu Jul 15 23:25:57 1999  NAKAMURA Hiroshi  <nakahiro@sarion.co.jp>
-
-	* lib/debug.rb: better display & frame treatment.
-
-Thu Jul 15 21:16:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_each): returns self for normal termination;
-	  returns nil for break.
-
-	* string.c: non bang methods (e.g. String#sub) should always
-	  return copy of the receiver.
-
-Thu Jul 15 21:09:15 1999  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* eval.c (find_file): do not add empty string to the path.
-
-	* configure.in (with-search-path): should not add empty string if
-	  the option is not supplied.
-
-Thu Jul 15 17:49:08 1999  Ryo HAYASAKA  <hayasaka@univ21.u-aizu.ac.jp>
-
-	* ext/tcltklib/tcltklib.c: move `#include "ruby.h"' forward.
-
-Thu Jul 15 16:54:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.5 - version 1.4 alpha
-
-Wed Jul 14 23:45:33 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* eval.c (ruby_init): initialize for the first time only.
-
-Tue Jul 13 00:15:19 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_hash_index): re-defined; method to retrieve a key
-	  from the value.
-
-	* hash.c (Init_Hash): member? should be re-defined for Hash.
-
-Tue Jul 12 13:54:51 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* io.c (rb_file_sysopen): wrong number of argument.
-
-Mon Jul 12 11:52:35 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_f_missing): class name included in message.
-
-	* eval.c (print_undef): better error message.
-
-Sun Jul 11 05:36:17 1999  NAKAMURA, Hiroshi  <nakahiro@sarion.co.jp>
-
-	* lib/debug.rb: patch to show proper position.
-
-Fri Jul  9 23:56:14 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* dln.c (dln_find_1): path conv. moved to conv_to_posix_path.
-
-	* dln.c (conv_to_posix_path): path conv. should be done.
-
-Fri Jul  9 10:26:47 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* random.c (RANDOM_NUMBER): should place parentheses.
-
-Fri Jul  8 11:00:51 1999  Shugo Maeda  <shugo@netlab.co.jp>
-
-	* numeric.c (fix_div): division may be out of fixnum range.
-
-	* bignum.c (bigdivmod): proper sign calculation to result.
-
-Wed Jul  7 18:27:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* st.c (st_delete_safe): was modifying wrong slot.
-
-Mon Jul  5 13:17:46 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (rb_gc_call_finalizer_at_exit): close all files at exit.
-
-Fri Jul  2 18:00:21 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* lib/Mail/README: Mail-0.3.0 added to the distribution.
-
-Fri Jul  2 01:45:32 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_fastmap): avoid allocation of register
-	  variables for each invocation of re_match().  Suggested by
-	  Zasukhin Ruslan <ruslan@paradigmasoft.com>.  Thanks.
-
-Tue Jun 29 20:39:24 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ext/tk/lib/tk.rb (TkVariable): bug fix; should value type check
-	  be added?
-
-	* string.c (rb_str_each_line): a bug in paragraph mode.
-
-	* ruby.c (load_file): shifted too much to skip #!.
-
-Tue Jun 29 06:50:21 1999  Wakou Aoyama  <wakou@fsinet.or.jp>
-
-	* lib/CGI.rb: 0.30 - cleanup release, incompatible.
-
-	* lib/telnet.rb: 0.22 - timeout added.
-
-Tue Jun 29 10:49:25 1999  SHIROYAMA Takayuki  <psi@fortune.nest.or.jp>
-
-	* configure.in: better Rhapsody support.
-
-	* lib/mkmf.rb: Rhapsody/NEXTSTEP support.
-
-Tue Jun 29 01:42:13 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/pty/pty.c (chld_changed): should use POSIX.1 style wait.
-
-Mon Jun 28 21:07:36 1999  KIMURA Koichi  <kbk@kt.rim.or.jp>
-
-	* ext/extmk.rb.nt: wrong result for have_library().
-
-Mon Jun 28 15:24:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* missing/isinf.c: OSF/1 raises SIGFPE on one()/zero().
-
-	* regex.c (re_search): should search til EOS, for patterns may
-	  match beyond the end of range.
-
-Mon Jun 28 12:49:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_f_select): should not accept Time objects as an
-	  argument for it is time interval.
-
-	* process.c (rb_f_sleep): ditto.
-
-	* file.c (test_s): should return nil for false condition.
-
-Mon Jun 28 12:23:52 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* bignum.c (rb_dbl2big): typo.
-
-	* file.c (rb_f_test): ditto.
-
-	* string.c (rb_str_crypt): wrong message.
-
-Sun Jun 27 19:50:11 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* eval.c (rb_f_exit): should have treat signed integer status, not
-	  VALUE.
-
-	* process.c (rb_f_exit_bang): should work like exit().
-
-Sun Jun 27 16:21:32 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* string.c (rb_str_rindex): wrong position to search.
-
-Sat Jun 26 04:05:30 1999  Takaaki Tateishi  <ttate@jaist.ac.jp>
-
-	* configure.in (configure_args): --with-search-path to specify
-	  additional ruby search path.
-
-	* ruby.c (ruby_prog_init): additional search path.
-
-Fri Jun 25 13:09:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (pack_unpack): needed to initialize natint.
-
-	* regex.c (re_compile_pattern): add start_paren to avoid too much
-	  finalization on maybe_finalize_jump.
-
-Fri Jun 25 13:07:20 1999  Koji Oda  <oda@bsd1.qnes.nec.co.jp>
-
-	* missing/isinf.c: include "config.h" added.
-
-Fri Jun 25 07:25:05 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* lib/mkmf.rb: initialize $(topdir).
-
-	* ext/extmk.rb.in (install_rb): install lib/*.rb properly.
-
-	* configure.in (linux): specifies -rpath on --enable-shared.
-
-	* configure.in (aix): ruby.imp must reside in $(topdir).
-
-Thu Jun 24 19:11:29 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* parse.y (rb_str_extend): multi-byte identifier in expression
-	  interpolation in strings.
-
-	* parse.y (yylex): support multi-byte char identifiers.
-
-Thu Jun 24 15:27:13 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (f_arg): check duplicate argument names.
-
-	* gc.c (rb_gc_mark): marking wrong member for NODE_ARGS.
-
-	* string.c (rb_str_rindex): POSITION specifies start point, not
-	  end point.
-
-Thu Jun 24 13:00:17 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (print_mbc): wrong boundary.
-
-	* pack.c (uv_to_utf8): raises ArgError for too big value.
-
-Thu Jun 24 11:02:51 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* pack.c (uv_to_utf8): mask needed.
-
-Wed Jun 23 21:03:56 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* ruby.h (struct RFile): remove iv_tbl from struct. instance
-	  variables are handled as generic ivs.
-
-Wed Jun 23 22:06:26 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* pack.c (utf8_to_uv): pack to 7 bytes sequence.
-
-	* pack.c (uv_to_utf8): wrong boundary.
-
-	* pack.c (pack_unpack): should treat as unsigned long.
-
-Wed Jun 23 15:10:11 1999  Inaba Hiroto  <inaba@sdd.tokyo-sc.toshiba.co.jp>
-
-	* parse.y (parse_string): failed to parse nested braces.
-
-	* parse.y (parse_regx): nested braces within #{} available.
-
-Wed Jun 23 11:18:38 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (slow_search): wrong shift width for mbcs.
-
-	* eval.c (rb_thread_save_context): should not clear th->locals.
-
-Wed Jun 23 02:06:14 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): UMINUS binds too tight with digits. changed so
-	  that -2**2 => -4.
-
-	* parse.y (close_paren): `do' for expr termination now works it
-	  used to be.
-
-Wed Jun 22 18:26:42 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* pack.c (pack_pack): should initialize local variable `j'.
-
-Wed Jun 22 15:24:59 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* parse.y (here_document): a bug for multiline heredoc.
-
-Tue Jun 22 15:06:36 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/socket/socket.c (ruby_socket): forgot to return fd
-	  explicitly.
-
-Tue Jun 22 13:34:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* rubyio.h (MakeOpenFile): should initialize member `iv_tbl'.
-
-Wed Jun 22 10:35:51 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* io.c (rb_io_gets_internal): getc(3) may not set errno on
-	  interrupt.
-
-Mon Jun 21 22:39:28 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (call_required_libraries): ruby_sourceline should be
-	  cleared before loading libraries.
-
-	* io.c (set_stdin): do not use reopen(), so that we don't need to
-	  dup original stdin before assigning $stdin.
-
-Mon Jun 21 18:04:27 1999  Ryo HAYASAKA  <hayasaka@univ21.u-aizu.ac.jp>
-
-	* ext/dbm/dbm.c: include <cdefs.h> for solaris 2.6.
-
-Mon Jun 21 15:59:47 1999  Nobuyoshi Nakada  <nobu.nokada@softhome.net>
-
-	* ext/socket/socket.c (ip_addrsetup): forgot to put `else'.
-
-Mon Jun 21 15:38:37 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (fptr_finalize): remove rb_syswait() invocation to avoid
-	  wait4(2) within GC.  rb_syswait() moved to rb_io_fptr_close().
-
-Mon Jun 21 12:05:59 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* dir.c (dir_s_glob): remove MAXPATHLEN restriction.
-
-	* ext/md5/md5init.c (md5_hexdigest): should have used "%02x".
-
-Sun Jun 20 19:50:38 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* string.c (rb_str_each_line): should have checked string
-	  boundary.
-
-Sat Jun 19 22:24:12 1999  Kenji Nagasawa  <kenn@hma.att.ne.jp>
-
-	* OS/2 patch improved.
-
-Fri Jun 18 08:30:17 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (r_byte): add data length check.
-
-	* ext/tcltklib/tcltklib.c (_timer_for_tcl): was doing busy-wait.
-
-Tue Jun 15 10:01:21 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* configure.in: remove trailing slash from interpreter embedded
-	  shared library path.
-
-	* configure.in (INSTALL_DLLIB): install shared lib with 0555.
-
-	* instruby.rb: changed mode for shared library into 0555.
-
-Fri Jun 11 23:27:00 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* ext/etc/etc.c (etc_passwd): should return nil, not exception for
-	  call after last passwd entry.
-
-Fri Jun 11 15:21:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (rb_gc_mark_locations): add safety margin 1.
-
-	* eval.c (ruby_run): should protect toplevel node tree.
-
-	* ext/etc/etc.c (etc_group): dumps core if there's no more group.
-
-Fri Jun 11 01:50:25 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (ruby_run): Init_stack() was called too late; local
-	  variables happened to be higher (or lower) than stack_start.
-
-Thu Jun 10 16:41:48 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c: do not call `initialize' for IO objects.  So with Array,
-	  Hash, Range, and Time objects.
-	
-	* ext/curses/curses.c (curses_getch): made thread aware using
-	  rb_read_check().
-
-	* ext/curses/curses.c (window_getch): ditto.
-
-	* ext/curses/curses.c (curses_getstr): made (partially) thread
-	  aware using rb_read_check().
-
-	* ext/curses/curses.c (window_getstr): ditto.
-
-	* io.c (rb_read_check): new function to help making something
-	  (like extension libraries) thread aware.
-
-	* eval.c (is_defined): `defined? super' should be true even for
-	  private superclass methods.
-
-Fri Jun 10 13:42:10 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* pack.c (pack_pack): template `Z' should be allowed.
-
-Wed Jun  9 13:26:38 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_loading): modified to avoid nested race
-	  condition of require().
-
-	* ext/tcltklib/tcltklib.c (ip_invoke): queue invocation on non
-	  main threads.
-
-	* ext/tcltklib/tcltklib.c (lib_mainloop): flush invocation
-	  queues periodically.
-
-	* version.c (ruby_show_version): now print the message to stdout.
-
-	* version.c (ruby_show_copyright): ditto.
-
-Tue Jun  8 00:00:34 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (pack_unpack): append sentinel (NUL) to the string.
-
-	* ext/md5/md5init.c (md5_hexdigest): new method to obtain
-	  printable hash string.
-
-	* ext/md5/md5init.c (md5_update): should return self.
-
-	* pack.c (pack_pack): undocumented template 'U' for UTF8.
-
-	* pack.c (pack_unpack): ditto.
-
-	* marshal.c (r_byte): should replace getc() with rb_getc().
-
-	* io.c (rb_getc): getc() replacement uses READ_DATA_PENDING() and
-	  rb_thread_wait_fd().
-
-Mon Jun  7 23:23:38 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_mod_clone): should call CLOSESETUP().
-
-	* eval.c (bind_clone): should call CLONESETUP() for new clone.
-
-Sat Jun  5 10:32:40 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_oct): binary (e.g. 0b10111) support.
-
-	* variable.c (rb_const_set): raise warning, not exception.
-
-	* parse.y (yycompile): initialize parser internal variables.
-
-	* parse.y (close_paren): set lex_state to EXPR_PAREN after closing
-	  parenthesis.
-
-	* parse.y (yylex): returns kDO for `do' right after method_call.
-
-Thu Jun  3 11:05:30 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* regex.c (read_backslash): should decode \b within class.
-
-Thu Jun  3 01:06:18 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* dln.c (dln_load): AIX improvement (aix_findmain removed).
-
-Wed Jun  2 00:41:31 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (pack_unpack): new undocumented template Z which strips
-	  stuff after first null.
-
-	* pack.c (pack_pack): should preserve specified length of the
-	  resulting string.
-
-Tue Jun  1 15:29:33 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (ruby_socket): retry after GC, if socket(2)
-	  failed on EMFILE or ENFILE.
-
-	* ext/socket/socket.c (sock_s_socketpair): ditto.
-
-	* eval.c (module_setup): need to add PUSH_VAR/POP_VAR to clear
-	  dyna vars link list.
-
-	* version.h (RUBY_RELEASE_CODE): integer macro constant for source
-	  version detection.
-
-Sun May 30 22:19:12 1999  Kenji Nagasawa  <kenn@tcp-ip.or.jp>
-
-	* ext/socket/socket.c: emx/gcc 0.9d now fixes things about
-	  AF_UNIX.
-
-	* process.c: OS/2 EMX kludge.
-
-	* Makefile.in (strncasecmp.o): added dependency.
-
-Mon May 31 16:06:28 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.4 - preliminary release for 1.4
-
-Mon May 31 15:57:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_fptr_close): close on IO which main_thread is
-	  waiting cause serious exception, that vanishes the actual fd
-	  closing.  Invocation of rb_thread_fd_close() is deferred
-	  a little.
-
-Sat May 29 18:27:13 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* regex.c (re_match): stack boundary check needed.
-
-Sat May 29 12:27:00 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/tcltklib/tcltklib.c (ip_invoke): proper ref count management
-	  to avoid leak.  I HATE REF COUNTING!!
-
-	* eval.c (ruby_run): moved ruby_require_libraries() to handle `-r'
-	  from ruby_options() to avoid stack corruption for threads
-	  created in libraries.
-
-Sat May 29 02:22:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_yield_0): when `for' appeared in blocks, it
-	  introduced new scope for local variables.
-
-Fri May 28 17:16:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_squeeze_bang): squeeze AND of the arguments.
-	  UNDOCUMENTED.
-
-	* string.c (rb_str_count): new UNDOCUMENTED method.
-
-	* string.c (rb_str_delete_bang): delete AND of the arg ranges.
-	  UNDOCUMENTED FEATURE for 1.3.x.
-
-	* ext/socket/socket.c (setipaddr): re-wrote using ip_addrsetup().
-
-	* ext/socket/socket.c (ip_addrsetup): decode symbolic address
-	  <broadcast>.
-
-Thu May 27 12:27:42 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (tr_trans): should handle NUL (\0) within strings.
-
-Tue May 25 16:45:11 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_f_syscall): syscall may return values other than zero
-	  on success.
-
-	* regex.c (re_match): handle empty loop properly (hopefully).
-
-	* regex.c (re_match): remove empty group check, because it does
-	  not help non-grouping parentheses (?:..).
-
-	* regex.c (re_compile_fastmap): treating try_next, finalize_push
-	  wrong way.
-
-	* regex.c: remove some obsolete functions such as
-	  group_match_null_string_p().
-
-Mon May 24 14:47:54 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (read_backslash): read backslash by regex.
-
-Sun May 23 19:44:58 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ext/pty/pty.c (getDevice): portability patch.
-
-Fri May 21 23:01:26 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/getaddrinfo.c (GET_AI): should set error code.
-
-Thu May 20 03:43:44 1999  Jun-ichiro itojun Hagino  <itojun@itojun.org>
-
-	* ext/socket/socket.c: you should use sockaddr_storage to handle
-	  IPv6 addresses.
-
-	* ext/socket/getaddrinfo.c (getaddrinfo): prevent retrieving
-	  AF_INET6 address if hints.ai_flags == AI_PASSIVE.
-
-Wed May 19 12:27:07 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (exec_end_proc): should protect exceptions.
-
-	* gc.c (run_final): ditto.
-
-	* parse.y (f_rest_arg): allow just * for rest arg.
-
-	* parse.y (mlhs_basic): allow * without formal argument.
-
-	* regex.c (re_match): the variable `part' should be initialized.
-
-Tue May 18 15:25:45 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): a bug in range adjustment.
-
-Tue May 18 11:35:59 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* dln.c (conv_to_posix_path): path_len argument added.
-
-Mon May 17 12:26:31 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (fix_rev): should treat Fixnum as signed long.
-
-	* eval.c (massign): add strict number check for yield (and call).
-
-	* eval.c (proc_arity): new method to return number of arguments.
-
-	* eval.c (method_arity): new method to return number of arguments.
-
-	* parse.y (read_escape): char may be unsigned.
-
-	* string.c (rb_str_succ): ditto.
-
-	* string.c (tr_trans): ditto.
-
-	* object.c (Init_Object): methods `&', `|', `^' are added to nil.
-
-	* range.c (rb_range_beg_len): it should be OK for [0..-len-1].
-
-	* regex.c (re_search): search for byte literal within mbcs.
-
-	* regex.c (is_in_list): parsh
-
-	* regex.c (re_compile_fastmap): should have not alter the loop
-	  variable `j' if TRASLATE_P().
-
-	* regex.c (re_compile_pattern): escaped characters should be read
-	  by PATFETCH_RAW(c).
-
-Sat May 15 11:23:51 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): endline2 (\Z) should not match at the point
-	  between a newline and end-of-line, like endline ($).
-
-	* class.c (include_class_new): should initialize iv_tbl to share
-	  between module and iclass.
-
-Fri May 14 08:50:27 1999  Akira Endo  <akendo@t3.rim.or.jp>
-
-	* regex.c (re_compile_fastmap): it should be k != 0 to skip.
-
-Fri May 14 12:46:56 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_load): a bug in old marshal format support.
-
-	* instruby.rb: make site_ruby directory.
-
-Fri May 14 10:18:02 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* regex.c (re_match): a bug in inline `.*' etc.
-
-Fri May 14 09:58:46 1999  Minero Aoki  <aamine@dp.u-netsurf.ne.jp>
-
-	* ruby.c (addpath): should have specified string length.
-
-Thu May 13 10:40:44 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval_string_wrap): new function.
-
-	* regex.c (re_compile_pattern): POSIX line match should alter
-	  behavior for `^' and `$' to begbuf and endbuf2 respectively.
-
-	* ext/pty/pty.c: un-ANSI-fy function arguments.
-
-Wed May 12 14:19:38 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* struct.c (iv_get): in case of inheritance of generated struct
-	  class, __member__ and __size__ should also be inherited.
-	  Thanks for Pros Yeboah <yeboah@tu-harburg.de>.
-
-	* io.c (rb_f_gets_internal): should check number of arguments
-	  before checking rb_rs == rb_default_rs.  Thanks for Koji Arai
-	  <JCA02266@nifty.ne.jp>.
-
-Tue May 11 08:29:28 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): .?, .+ did not work.
-
-Mon May 10 00:59:33 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/jcode.rb: forgot to squeeze on reverse (complement) case.
-
-	* string.c (tr_squeeze): should not set modify flag to be honest,
-	  if the string is not modified.
-
-	* signal.c (Init_signal): SIGTERM should not be handled.
-
-	* regex.c (re_match): seeking for longest match is now optional,
-	  which can be set using RE_OPTION_POSIXMATCH.  This satisfies
-	  POSIX longest match as much as Emacs's posix-* functions, which
-	  are known to be incomplete.
-
-Sun May  9 13:04:01 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/socket.c (sock_s_getaddrinfo): conversion from
-	  Fixnums to C integers needed.
-
-Sun May  9 11:51:43 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* range.c (range_eqq): reverse condition.
-
-	* range.c (range_s_new): default should be end inclusive.
-
-Sat May  8 03:27:51 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (thread_connect): replace nasty
-	  rb_thread_fd_writable() with rb_thread_select().
-
-Fri May  7 20:49:00 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* ext/socket/getaddrinfo.c (inet_pton): wrong parameter to
-	  inet_aton().
-
-	* ext/socket/addrinfo.h (__P): silly cut and paste typo.
-
-Fri May  7 17:03:57 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* dir.c (glob): removed GPL'ed glob.c completely.
-
-Fri May  7 08:17:19 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/sdbm/extconf.rb: sdbm extension added to the distribution.
-
-Fri May  7 01:42:20 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (tcp_s_gethostbyname): avoid using struct
-	  sockaddr_storage.
-
-Thu May  6 13:21:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_indexes): should not use rb_ary_concat().
-
-Thu May  4 12:34:18 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* parse.y (parse_string): there should be newline escape by
-	  backslashes in strings.
-
-	* parse.y (parse_qstring): ditto.
-
-Mon May  3 04:37:20 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ext/tcltklib/extconf.rb: better search for libX11.
-
-	* range.c (range_s_new): embarrassing =/== typo.
-
-	* re.c (Init_Regexp): failed to set default kcode.
-
-Mon May  3 02:39:55 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* ext/socket/socket.c (open_inet): typo (res and res0).
-
-Tue May  4 02:07:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* mkconfig.rb: leave undefined $(VARIABLE) unexpanded in the
-	  Config::CONFIG hash table.
-
-Mon May  3 09:37:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): expand exactn{n} at compile time.
-	  handles stop_paren specially.
-
-	* regex.c (re_compile_pattern): expand x{n} at compile time.
-
-	* regex.c (re_search): posix line match should be checked.
-
-	* regex.c (re_search): a bug in anchor condition.
-
-Fri Apr 30 18:57:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.3
-
-	* string.c (rb_str_rindex): position should be END point, not
-	  START point.
-
-	* re.c (rb_reg_search): pos means end point on reverse now.
-
-	* array.c (rb_ary_s_create): should clear ary->ptr to avoid
-	  potential gc crash.
-
-Fri Apr 30 15:24:58 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/addrinfo.h: compatibility hack for ipv4.
-
-	* ext/socket/socket.c: itojun's ipv6 patches applied.
-
-	* ext/socket/extconf.rb: detect ipv6 features based on itojun's
-	  ipv6 patches.
-
-	* ext/extmk.rb.in (enable_config): can handle --enable-xxx now.
-
-	* lib/mkmf.rb (enable_config): ditto.
-
-Fri Apr 30 05:22:23 1999  Shugo Maeda  <shugo@netlab.co.jp>
-
-	* string.c (rb_str_aset): last index should not append.
-
-Thu Apr 29 18:55:31 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* dln.c (conv_to_posix_path): remove const from args.
-
-	* ruby.c (rubylib_mangle): remove Fatal(), the obsolete function.
-
-Tue Apr 27 14:11:45 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (fname): lazy workaround for keywords did not work well.
-
-	* ext/extmk.rb.in: `--with-xxx=yyy' argument configuration.
-
-	* lib/mkmf.rb: ditto.
-
-	* misc/ruby-mode.el: forgot to handle $`.
-
-	* ext/extmk.rb.in: better AIX link support proposed by
-	  <komatsu@sarion.co.jp>.
-
-Mon Apr 26 16:46:59 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/extmk.rb.in: AIX shared library support modified.
-
-	* ext/aix_mksym.rb: ditto.
-
-	* configure.in: ditto.
-
-	* sprintf.c (rb_f_sprintf): should allocate proper sized buffer
-	  for float numbers.
-
-Sat Apr 24 00:00:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (operation): syntax like `a.[]=(1,2)' is allowed.
-
-Fri Apr 23 23:54:09 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (argf_binmode): binmode method added to ARGF.
-
-Fri Apr 23 13:55:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_f_chomp): should assign the result to $_.  or maybe
-	  sub/gsub/chop/chomp should NOT assign $_ altogether.
-
-Thu Apr 22 16:50:54 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_callcc): call scope_dup() for all scopes in
-	  the interpreter stack.
-
-Tue Apr 20 11:24:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_dump): `#' should be escaped.
-
-Tue Apr 20 02:32:42 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_regx): option /p for posix match added.
-
-	* re.c (rb_reg_desc): did not print options properly.
-
-	* io.c (rb_file_s_open): initialize was called twice.
-
-Mon Apr 19 18:56:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* configure.in (DEFAULT_KCODE): can specify default code for
-	  $KCODE by --with-default-kcode=(euc|sjis|utf8|none).
-
-	* regex.c (IS_A_LETTER): a byte sequence shorter than mbc should
-	  not match with \w etc.
-
-Mon Apr 19 13:49:11 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (eval): should restore ruby_dyna_vars.
-
-Fri Apr 16 21:40:43 1999  Nobuyoshi Nakada  <gea02117@nifty.ne.jp>
-
-	* io.c (f_backquote): pipe_open may return nil.
-
-	* io.c (f_open): rb_io_open may return nil.
-
-	* io.c (io_s_foreach): ditto.
-
-	* io.c (io_s_readlines): ditto.
-
-	* io.c (io_defset): wrong message.
-
-Fri Apr 16 15:09:20 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (rb_str2inum): strtoul() returns long, not int.
-
-	* eval.c (rb_load): size of VALUE and ID may be different.
-
-	* util.c (mmprepare): int is too small to cast from pointers.
-
-	* config.guess: avoid 'linux-gnu' for alpha-unknown-linux.
-
-Thu Apr 15 23:46:20 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ruby.c (rubylib_mangle): mangle path by RUBYLIB_PREFIX.
-
-Wed Apr 14 23:52:51 1999  SHIROYAMA Takayuki  <psi@fortune.nest.or.jp>
-
-	* node.h (NODE_LMASK): should be long to avoid overflow.
-
-Wed Apr 14 13:14:35 1999  Katsuyuki Komatsu  <komatsu@sarion.co.jp>
-
-	* dln.c: AIX dynamic link.
-
-	* ext/aix_ld.rb: ditto.
-
-Wed Apr 14 12:19:09 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/thread.rb: Queue#{enq,deq} added.
-
-Tue Apr 13 17:43:56 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_hash_s_create): Hash::[] acts more like casting.
-
-Tue Apr 13 00:33:52 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_stdio_set): warning for assignment to the variables
-	  $std{in,out,err}.
-
-Mon Apr 12 23:12:32 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_reopen): check for reopening same IO.
-
-Fri Apr  9 17:45:11 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (rb_compile_string): bug for nested eval().
-
-	* regex.c (re_match): should pop non-greedy stack items on
-	  failure, after best_regs are fixed.
-
-Thu Apr  8 17:30:40 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (PACK_LENGTH_ADJUST): need to adjust for `*' length.
-
-Tue Apr  6 23:28:44 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (void_check): add void context checks.
-
-Mon Apr  5 12:23:42 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_s_at): should copy gmt-mode.
-
-	* eval.c (eval_node): preserve ruby_eval_tree.
-
-Fri Apr  2 14:00:34 1999  NAKAMURA, Hiroshi  <nakahiro@sarion.co.jp>
-
-	* lib/debug.rb: wrong command interpreting.
-
-Fri Apr  2 11:46:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.3.2
-
-Fri Apr  2 10:40:04 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_s_pipe): forgot to define IO::pipe.
-
-Thu Apr  1 14:40:46 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (assign): modified for rhs change.
-
-	* parse.y (stmt): unparenthesisized method calls can be right hand
-	  side expression of the assignment.
-
-Sat Mar 27 22:42:47 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ext/nkf/nkf.c (rb_nkf_kconv): check size output_ctr before
-	  decrement.
-
-Thu Mar 25 09:11:03 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_s_at): preserve gmt-mode for result.
-
-	* parse.y (rb_compile_string): do not use cur_mid, use
-	  compile_for_eval instead.
-
-	* st.c (PTR_NOT_EQUAL): wrong logical condition.
-
-Wed Mar 24 13:06:43 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yycompile): should clear cur_mid after compilation.
-
-	* io.c (next_argv): need to check type for ARGV.shift.
-
-	* eval.c (blk_copy_prev): need to preserve outer scope as well as
-	  outer frames.
-
-	* parse.y (rb_compile_string): return can appear within eval().
-
-Tue Mar 23 10:15:07 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* configure.in: AC_C_CONST check added.
-
-Tue Mar 23 02:07:35 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_plus): preserve gmt-mode for result.
-
-Mon Mar 22 01:32:37 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): adjust line numbers before expression
-	  interpolation within strings.
-
-	* eval.c (rb_eval): defined? returns nil for false condition.
-
-	* numeric.c (num_nonzero_p): returns nil for false condition.
-
-Sat Mar 20 13:07:43 1999  Keiju Ishitsuka  <keiju@rational.com>
-
-	* lib/weakref.rb: avoid leak for two weakrefs for one object.
-
-Fri Mar 19 11:26:45 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* eval.c (ruby_run): needed to eval END{} on exit.
-
-	* eval.c (rb_exit): ditto.
-
-Fri Mar 19 02:17:27 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* signal.c (Init_signal): handles terminating signals HUP, TERM,
-	  QUIT, PIPE, etc.
-
-Thu Mar 18 15:47:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (rb_big_and): bug in sign calculation.
-
-	* bignum.c (rb_big_or): ditto.
-
-	* io.c (rb_f_select): forgot to use to_io to retrieve IO, after
-	  calling select(2).
-
-Tue Mar 16 19:54:31 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/extmk.rb.in: static linking cause infinite make loop.
-
-Tue Mar 16 18:50:04 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* ext/socket/socket.c (tcp_s_gethostbyname): typo, not NUM2INT(),
-	  but INT2NUM().
-
-	* ext/socket/socket.c (mkhostent): ditto.
-
-Tue Mar 16 12:31:44 1999  Ryo HAYASAKA  <hayasaka@cheer.u-aizu.ac.jp>
-
-	* file.c (utime_internal): suppress warning by const.
-
-	* time.c (time_gmtime): ditto.
-
-Tue Mar 16 10:23:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_clone): Time object can be cloned.
-
-Tue Mar 16 03:13:10 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ruby.c (load_file): argv[argc] should be NULL.
-
-Mon Mar 15 22:12:08 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* sprintf.c (rb_f_sprintf): typo in arg_num check at exit.
-
-Mon Mar 15 16:42:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_dup): dup2 should copy class too.
-
-Mon Mar 15 15:12:53 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* lib/mkmf.rb: install program relative path check.
-
-Mon Mar 15 14:05:25 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_s_new): 2nd argument is now option.
-	  Regexp::EXTENDED can be specified.
-
-Fri Mar 12 10:47:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_index): str.index("") should always match at
-	  offset point.
-
-	* string.c (rb_str_upto): can specify end point exclusion.
-
-	* string.c (rb_str_index): negative offset.
-
-	* regex.c (re_match): begline should not match at the point
-	  between a newline and end-of-string.  endline neither.
-
-	* regex.c (re_compile_pattern): context_indep_anchors .
-
-	* parse.y (parse_regx): need not to push backslashes before
-	  escaped characters.
-
-	* eval.c (rb_thread_join): re-raises exception within target.
-
-Fri Mar 12 01:09:36 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* ext/readline/readline.c (readline_s_vi_editing_mode): wrong
-	  number of arguments.
-
-Fri Mar 12 02:12:50 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (PACK_ITEM_ADJUST): "a".unpack("C3") => [97, nil, nil]
-
-Thu Mar 11 18:23:50 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* ext/socket/socket.c (Init_socket): UDPsocket was omitted.
-
-Thu Mar 11 16:43:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (PACK_LENGTH_ADJUST): push fixed number of items per
-	  template to result array.
-
-	* pack.c (pack_unpack): I/N/C etc. push nil in the array for "".
-
-Tue Mar  9 00:19:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (ruby_unsetenv): use ruby_setenv(name, 0).
-
-	* hash.c (env_delete): ditto.
-
-	* string.c (rb_str_upto): do not check `beg<end' to generate
-	  strings for the pattern like "a".upto("#a").
-
-	* range.c (range_each): treat strings as special case.
-
-	* range.c (range_each): no longer use upto for generic cases.
-
-Sun Mar  7 14:21:32 1999  IKARASHI Akira  <ikarashi@itlb.te.noda.sut.ac.jp>
-
-	* string.c (rb_str_index): wrong end point calculation.
-
-Sat Mar  6 02:19:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (match_index): MatchingData#index(n) added.
-
-	* array.c (rb_ary_subseq): ary[n..-1] returns an sub-array unless
-	  n is too small negative index.
-
-	* re.c (rb_reg_match_method): Regexp#match(str) added.
-
-	* array.c (rb_ary_indexes): understands ranges as indexes.
-
-	* re.c (match_size): MatchingData#size added.
-
-Fri Mar  5 01:04:57 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_fill): modified for range.
-
-	* array.c (rb_ary_aset): a[n..m] revisited.
-
-Thu Mar  4 14:23:29 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_subseq): a[n..m] revisited.
-
-	* parse.y (method_call): allow Const::method{}.
-
-	* array.c (rb_ary_replace_method): should replace original array.
-
-Thu Mar  4 02:30:22 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* configure.in: remove --disable-thread, thread feature is no
-	  longer optional.
-
-Thu Mar  4 00:32:17 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* parse.y (read_escape): wrong arguments for scan_oct,scan_hex.
-
-Wed Mar  3 11:51:53 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (Init_socket): rename class names as
-	  TCPsocket -> TCPSocket etc.
-
-Tue Mar  2 19:46:42 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* configure.in (LDSHARED): use gcc -Wl,-G for solaris with gcc.
-
-Tue Mar  2 17:04:19 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): backslashes do not concatenate comment lines
-	  anymore.
-
-Mon Mar  1 14:05:12 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_call0): adjust argv for optional arguments.  super
-	  without arguments emit superclass method with the value from
-	  optional arguments.  enabled as experiment.
-
-Sun Feb 28 14:04:07 1999  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* parse.y (nextc): backslash at the eof cause infinite loop
-
-Sun Feb 28 11:01:26 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* time.c (make_time_t): month range check added.
-
-Sat Feb 27 02:36:05 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (Init_Regexp): add escape as alias of quote.
-
-	* re.c (rb_reg_s_quote): char-code can be specified now.
-
-Fri Feb 26 18:45:36 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* eval.c (error_print): bug for error message with newlines.
-
-Fri Feb 26 12:00:04 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (make_time_t): future check modified to allow 1969-12-31
-	  at certain timezone.
-
-	* time.c (time_arg): year >= 1000 should be past.
-
-	* version.c (Init_version): constant RELEASE_DATE added.
-
-Fri Feb 26 01:08:30 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_substr): returns nil for out-of-range access.
-
-	* array.c (rb_ary_subseq): returns nil for out-of-range access.
-
-	* array.c (rb_ary_store): negative index message has changed.
-
-	* string.c (rb_str_aset): reallocation needed.
-
-	* string.c (rb_str_aset): allow char append to the string.
-
-Thu Feb 25 23:30:17 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* time.c (time_load): tm_year should be packed in 17 bits, not 18.
-
-Thu Feb 25 12:50:25 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* missing/dup2.c: replaced by public domain version.
-
-	* time.c (make_time_t): add `future check' in loops.
-
-	* object.c (rb_num2dbl): forbid implicit conversion from nil, or
-	  strings.  thus `Time.now + str' should raise error.
-
-	* object.c (rb_Float): convert nil into 0.0.
-
-	* object.c (rb_Integer): conversion method improved.
-
-Thu Feb 25 03:27:50 1999  Shugo Maeda  <shugo@netlab.co.jp>
-
-	* eval.c (rb_call): should handle T_ICLASS properly.
-
-Thu Feb 25 00:04:00 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (Init_Exception): global function Exception() removed.
-
-	* variable.c (rb_class2name): returns "nil"/"true"/"false" for them.
-
-	* time.c (time_dump): time marshaling format compressed size from
-	  11 bytes to 8 bytes.  thanx to tadf@kt.rim.or.jp.
-
-	* eval.c (rb_obj_call_init): should specify arguments explicitly.
-
-Wed Feb 24 15:43:28 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): comment concatenation requires preceding space
-	  before backslash at the end of line.
-
-	* io.c (rb_f_pipe): global pipe is obsolete now.
-
-	* object.c (Init_Object): remove true.to_i, false.to_i.
-
-Tue Feb 23 14:21:41 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): warn if identifier! immediately followed by `='.
-
-Tue Feb 23 12:32:41 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* eval.c (rb_load): tilde expansion moved to find_file.
-
-	* eval.c (find_file): tilde expansion added.
-
-Tue Feb 23 10:50:20 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (require_method): require can handle multiple fnames.
-
-	* hash.c (rb_hash_foreach_iter): hash key may be nil.
-
-Mon Feb 22 17:44:02 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): should not pop failure point on success for
-	  non-greedy matches.
-
-	* io.c (Init_IO): remove global_functions getc, readchar, ungetc,
-	  seek, tell, rewind.
-
-Sat Feb 20 22:54:26 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (rb_num2long): no implicit conversion from boolean.
-
-Sat Feb 20 09:58:42 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* numeric.c (flo_to_s): portable Infinity and NaN support.
-
-Sat Feb 20 07:13:31 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* io.c (rb_file_sysopen): forgot to initialize a local variable.
-
-Fri Feb 19 23:05:07 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_subseq): range check changed.
-
-	* marshal.c: increment MARSHAL_MINOR for Time format change.
-
-	* time.c (time_old_load): support old marshal format.
-
-	* time.c (time_load): changed for new format Y/M/D/h/m/s/usec.
-
-	* time.c (time_dump): marshal dump format has changed.
-
-Fri Feb 19 00:25:57 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_arg): should reject "sep\0" and such.
-
-	* time.c (time_plus): Time#+ should not receive Time object
-	  operand.
-
-	* string.c (rb_str_substr): negative length raises exception now.
-
-	* array.c (beg_len): if end == -1, it points end of the array.
-
-	* array.c (rb_ary_subseq): negative length raises exception now.
-
-Thu Feb 18 20:57:04 1999  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* time.c (rb_strftime): strftime() may return 0 on success too.
-
-	* time.c (time_strftime): `\0' within format string should not be
-	  omitted in the result.
-
-	* time.c (rb_strftime): zero length format.
-
-	* time.c (time_to_a): yday start with 1 now.
-
-	* time.c (time_zone): support for long timezone name.
-
-	* time.c (time_yday): yday start with 1 now.
-
-	* time.c (time_minus): minus calculation was wrong.
-
-	* time.c (time_minus): sec, usec should be at least `long', maybe
-	  they should be `time_t'.
-
-	* time.c (time_plus): addition with float was wrong.
-
-	* time.c (time_to_s): support for long timezone name.
-
-	* time.c (time_gm_or_local): too far future check moved.
-
-	* time.c (time_arg): treat 2 digit year as 69-99 => 1969-1999,
-	  00-68 => 2000-2068
-
-Thu Feb 18 03:56:47 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* missing/fnmatch.c: moved to missing directory.
-
-Wed Feb 17 16:22:26 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* struct.c (rb_struct_alloc): actual initialization now be done in
-	  `initialize'.
-
-Wed Feb 17 09:47:15 1999  okabe katsuyuki  <hgc02147@nifty.ne.jp>
-
-	* regex.c (re_search): use mbclen() instead of ismbchar().
-
-	* re.c (rb_reg_s_quote): should handle mbchars properly.
-
-Wed Feb 17 01:25:26 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): stop comment concatenation by backslash follows
-	  after >= 0x80 char.  may cause problem with Latin chars.
-
-	* eval.c (error_print): exception in rb_obj_as_string() caused
-	  SEGV. protect it by PUSH_TAG/POP_TAG.
-
-	* error.c (exc_exception): `Exception#exception' should return self.
-
-Wed Feb 17 01:12:22 1999  Hirotaka Ichikawa  <hirotaka.ichikawa@tosmec.toshiba.co.jp>
-
-	* configure.in: BeOS patch.
-
-Tue Feb 16 14:25:00 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): should reallocate mbc space for
-	  character class unless current_mbctype is ASCII.
-
-Mon Feb 15 15:48:30 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* configure.in: specify `-Wl,-E' only for GNU ld.
-
-Mon Feb 15 11:43:22 1999  GOTO Kentaro  <gotoken@math.sci.hokudai.ac.jp>
-
-	* array.c (rb_inspecting_p): should return Qfalse.
-
-Sun Feb 14 22:36:40 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* sprintf.c (rb_f_sprintf): `%G' was omitted.
-
-Sun Feb 14 12:47:48 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* numeric.c (Init_Numeric): allow divide by zero on FreeBSD.
-
-	* numeric.c (Init_Numeric): FloatDomainError added.
-
-	* configure.in (AC_REPLACE_FUNCS): add checks for functions
-	  isinf, isnan, and finite.
-
-Sat Feb 13 01:24:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_create_0): should protect th->thread.
-
-Fri Feb 12 16:16:47 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* string.c (rb_str_inspect): wrong mbc position.
-
-Fri Feb 12 16:21:17 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_fd_close): 
-
-	* io.c (rb_io_fptr_close): tell scheduler that fd is closed.
-
-	* io.c (rb_io_reopen): ditto.
-
-	* io.c (READ_CHECK): check if closed after thread context switch.
-
-	* ext/socket/socket.c (bsock_close_read): do not check
-	  the return value from shutdown(2).
-
-	* ext/socket/socket.c (bsock_close_write): ditto.
-
-	* ext/socket/socket.c (sock_new): need to dup(fd) for close_read
-	  and close_write.
-
-	* parse.y (here_document): handle newlines within #{}.
-
-	* regex.h: should replace symbols for ruby.
-
-Fri Feb 12 00:46:28 1999  Shugo Maeda  <shugo@netlab.co.jp>
-
-	* marshal.c (r_object): should update the method name in message.
-
-	* marshal.c (w_object): limit should be converted into Fixnum.
-
-Wed Feb 10 15:20:03 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): empty pattern should not cause infinite
-	  pattern match loop.
-
-	* regex.c (re_compile_pattern): RE_OPTIMIZE_ANCHOR for /.*/, not
-	  for /(.|\n)/.
-
-	* numeric.c (fix_pow): `fixnum**nil' should raise TypeError.
-
-	* bignum.c (rb_big_pow): need to normalize results.
-
-Wed Feb 10 01:42:41 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* numeric.c (fix_pow): `(5**1).type' should be Integer.
-
-Tue Feb  9 01:22:49 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): do not ignore newlines in mbchars.
-
-	* io.c (rb_file_s_open): mode can be specified by flags like
-	  open(2), e.g. File::open(path, File::CREAT|File::WRONLY).
-
-	* io.c (rb_f_open): bit-wise mode flags for pipes
-
-	* io.c (Init_IO): bit flags for open.
-
-Sat Feb  6 22:56:21 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_sub_bang): should not overwrite match data by
-	  regexp match within the block.
-
-	* string.c (rb_str_gsub_bang): ditto.
-
-Sat Feb  6 03:06:17 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (match_getter): accessing $~ without matching caused SEGV.
-
-Fri Feb  5 22:11:08 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* parse.y (yylex): binary literal support, like 0b01001.
-
-	* parse.y (yylex): octal numbers can contain `_'s.
-
-	* parse.y (yylex): warns if non-octal number follows immediately
-	  after octal literal.
-
-	* parse.y (yylex): now need at least one digit after prefix such
-	  as 0x, or 0b.
-
-	* bignum.c (rb_str2inum): recognize binary numbers like 0b0101.
-
-Fri Feb  5 03:26:56 1999  Yasuhiro Fukuma  <yasuf@big.or.jp>
-
-	* ruby.c (proc_options): -e without program prints error.
-
-Fri Feb  5 00:01:50 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (terms): needed to clear heredoc_end.
-
-	* numeric.c (flo_div): allow float division by zero.
-
-Thu Feb  4 11:56:24 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* missing/strtod.c: for compatibility.
-
-	* configure.in (strtod): add strtod compatible check.
-
-	* numeric.c (rb_num2long): missing/vsnprintf.c does not support
-	  floating points.
-
-	* numeric.c (flo_to_s): ditto.
-
-Wed Feb  3 23:02:12 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* regex.c (re_compile_pattern): use ismbchar() to get next char.
-
-	* regex.c (re_search): wrong mbchar shift.
-
-	* re.c (rb_reg_search): needed to reset $KCODE after match.
-
-	* regex.c (re_compile_fastmap): mbchars should match with \w.
-
-Wed Feb  3 22:35:12 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* parse.y (yylex): too big float raise warning, not error.
-
-Tue Feb  2 23:41:42 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* regex.c (re_match): wrong boundary.
-
-	* regex.c (IS_A_LETTER): re_mbctab[c] may not be 1 for mbc.
-
-	* regex.c (re_search): mbchar support for shifting ranges.
-
-	* regex.c (MBC2WC): wrong conversion.
-
-Wed Feb  3 15:03:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_regx): need to escape parens if terminators are
-	  not any kind of parenthesis.
-
-	* parse.y (parse_qstring): ditto.
-
-	* parse.y (parse_string): ditto.
-
-Tue Feb  2 17:11:26 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* string.c (rb_str_gsub_bang): too small realloc condition.
-
-Mon Feb  1 10:01:17 1999  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* parse.y (yylex): range check for the float literal.
-
-Sat Jan 30 18:34:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (usage): -h option to show brief command description.
-
-Sat Jan 30 08:45:16 1999  IKARASHI Akira  <ikarashi@itlb.te.noda.sut.ac.jp>
-
-	* lib/cgi-lib.rb: cookie support added.
-
-Sat Jan 30 13:38:24 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): mbchars should match with \w
-	  within character class.  Was matching with \W.
-
-	* regex.c (re_match): \w should match with multi byte characters,
-	  not its first byte.
-
-Sat Jan 30 10:06:41 1999  Yoshida Masato  <yoshidam@yoshidam.net>
-
-	* re.c (rb_reg_s_new): UTF-8 flag handle (/u, /U).
-
-	* re.c (rb_kcode): $KCODE handle for UTF-8.
-
-Sat Jan 30 01:51:16 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_delete_if): RTEST() missing.
-
-	* hash.c (delete_if_i): ditto.
-
-	* enum.c (Init_Enumerable): select (=find_all), detect (=find)
-	  added as aliases.
-
-Fri Jan 29 21:32:19 1999  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* hash.c (rb_f_setenv): SEGV caused by small typo.
-
-Fri Jan 29 00:15:58 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/parsedate.rb (parsedate): support date format like
-	  23-Feb-93, which is required by HTTP/1.1.
-
-	* variable.c (find_class_path): avoid calling rb_iv_set().
-
-	* eval.c (backtrace): do not need to modify $SAFE internally.
-
-	* variable.c (classname): inline __classid__ access.
-
-	* eval.c (THREAD_ALLOC): needed to initialize wrapper.
-
-	* lib/ftools.rb (makedirs): allows slash at the end of the path.
-
-	* numeric.c (rb_fix_induced_from): ensure result to be Fixnum.
-
-Thu Jan 28 17:31:43 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (flo_to_s): float format changed to "%16.10g".
-
-Thu Jan 28 02:13:11 1999  Yoshinori Toki  <toki@freedom.ne.jp>
-
-	* array.c (rb_ary_store): expand allocated buffer by 3/2.
-
-Wed Jan 27 17:50:02 1999  Kazuhiro HIWADA  <hiwada@kuee.kyoto-u.ac.jp>
-
-	* bignum.c (dbl2big): raised error if double is too big to cast
-	  into long.  check added.
-
-Wed Jan 27 03:16:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_mod_const_at): can't list constants of the
-	  untainted objects in safe mode.
-
-	* class.c (method_list): can't list methods of untainted objects
-	  in safe mode.
-
-Tue Jan 26 02:40:41 1999  GOTO Kentaro  <gotoken@math.sci.hokudai.ac.jp>
-
-	* prec.c: Precision support for numbers.
-
-Thu Jan 21 19:08:14 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_f_raise): calls `exception' method, not `new'.
-
-	* error.c (exc_exception): renamed from `new'.
-
-Wed Jan 20 03:39:48 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yycompile): rb_in_compile renamed to ruby_in_compile.
-
-	* ruby.c (load_file): define DATA if __END__ appeared in script.
-
-Tue Jan 19 14:57:51 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (here_document): need to protect lex_lastline.
-
-	* parse.y (yylex): disable %//, %'', %``.
-
-Tue Jan 19 05:01:16 1999  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* array.c (beg_len): round range value too much.
-
-Mon Jan 18 13:02:27 1999  Kuroda Jun  <jkuro@dwe.co.jp>
-
-	* hash.c (env_keys): strchr() may return NULL.
-
-Mon Jan 18 17:51:47 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* instruby.rb (wdir): install libruby.a in archdir.
-
-	* lib/ftools.rb (install): removes file before installing.
-
-Mon Jan 18 16:55:31 1999  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* eval.c (rb_callcc): experimental continuation support.
-
-Sun Jan 17 19:45:37 1999  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* pack.c (pack_pack): nil packing caused SEGV.
-
-Sat Jan 16 13:18:03 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_concat): character (fixnum) can be append to
-	  strings
-
-	* array.c (rb_ary_unshift): unshift returns array.
-
-Sat Jan 16 01:39:19 1999  Yoshida Masato  <yoshidam@tau.bekkoame.ne.jp>
-
-	* string.c (rb_str_split_method): UTF-8 support.
-
-	* regex.c: UTF-8 support.
-
-Thu Jan 14 00:42:55 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_gsub_bang): forget to add offset for null match.
-
-	* eval.c (rb_thread_local_aset): can't modify in tainted mode.
-
-	* hash.c (env_each_key): avoid generating temporary array.
-
-Wed Jan 13 23:58:50 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_f_setenv): name and value can be tainted.
-
-Wed Jan  6 02:42:08 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (Init_Bignum): forgot to define Bignum#===.
-
-	* gc.c (gc_sweep): if add_heap() is called during GC, objects on
-	  allocated heap page(s) are not marked, should not be recycled.
-
-	* gc.c (gc_sweep): should refer latest freelist.
-
-	* gc.c (id2ref): modified to support performance patch.
-
-	* object.c (rb_obj_id): performance patch (no bignum for id).
-
-Tue Jan  5 01:56:18 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* config.guess: merge up-to-date from autoconf 2.12.
-
-	* array.c (rb_ary_join): avoid calling rb_protect_inspect() till
-	  it is really needed.
-
-	* object.c (rb_obj_inspect): show detailed information for the
-	  instance variables (infinite loop can avoid now).
-
-	* struct.c (rb_struct_inspect): avoid infinite loop.
-
-Sun Jan  3 01:37:58 1999  Takao KAWAMURA  <kawamura@ike.tottori-u.ac.jp>
-
-	* misc/ruby-mode.el (ruby-end-of-defun): moved too much.
-
-	* misc/ruby-mode.el (ruby-mode-variables): set paragraph-separator
-	  for the mode.
-
-	* misc/ruby-mode.el: proper font-lock for `def' and `nil' etc.
-
-Sat Jan  2 17:09:06 1999  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_jump_tag): new api to invoke JUMP_TAG.  tag values
-	  can obtained from rb_eval_string_protect()/rb_load_protect().
-
-	* eval.c (rb_rescue): now catches all exceptions but SystemExit.
-
-	* eval.c (rb_eval_string_protect): eval string with protection.
-
-	* eval.c (rb_load_protect): load file with protection.
-
-	* io.c (rb_io_puts): avoid infinite loop for cyclic arrays.
-
-	* eval.c (rb_thread_local_aref): thread local hash tables.
-
-	* object.c (rb_equal): check exact equal before calling `=='.
-
-Thu Dec 31 22:28:53 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* eval.c (rb_f_require): feature names should be provided with
-	  DLEXT extension.
-
-	* marshal.c (Init_marshal): need to provide `marshal.so'.
-
-Wed Dec 30 02:29:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (classname): do not call rb_ivar_set().
-
-	* eval.c (ruby_run): finalizers were called too early.
-
-Fri Dec 25 12:19:30 1998  Fukuda Masaki  <fukuda@wni.co.jp>
-
-	* gc.c (rb_gc_mark): should not return on FL_EXIVAR.
-
-Fri Dec 25 11:56:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (gc_mark): proper scanning for temporary region.
-
-	* eval.c (TMP_ALLOC): protection for C_ALLOCA was broken.
-
-Thu Dec 24 18:26:04 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* development version 1.3 released.
-
-Thu Dec 24 00:17:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_load): top self should be set properly.
-
-	* variable.c (classname): check __classpath__ if it is defined.
-
-	* variable.c (classname): invalid warning at -v with static linked
-	  ruby interpreter.
-
-	* eval.c (is_defined): modified for expr::Const support.
-
-	* eval.c (rb_eval): invoke method expr::Const if expr is not class
-	  nor module.
-
-	* parse.y (primary): enable expr::identifier as method
-	  invocation.
-
-Wed Dec 23 03:04:36 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): avoid too many loop pops for (?:..).
-
-Tue Dec 22 18:01:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental version 1.1d1 released.
-
-Mon Dec 21 01:33:03 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (TMP_PROTECT): add volatile to ensure GC protection.
-
-	* string.c (rb_str_gsub_bang): calculate buffer size properly.
-
-	* parse.y (lex_get_str): needed to return Qnil at EOS.
-
-	* eval.c (find_file): check policy modified, raise exception
-	  immediately for tainted load_path.
-
-	* hash.c (rb_f_setenv): do not depend on setenv() nor putenv().
-
-Thu Dec 17 06:29:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/tk/tkutil.c (tk_s_new): use rb_obj_instance_eval(), instead
-	  of rb_yield_0().
-
-	* eval.c (rb_f_require): forgot to call find_file in some cases.
-
-	* eval.c (rb_f_require): `require "feature.so"' to load dynamic
-	  libraries.  old `require "feature.o"' is still OK.
-
-	* eval.c (rb_eval): yield without value dumped core.
-
-Wed Dec 16 16:28:31 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental version 1.1d0 (pre1.2) released.
-
-Wed Dec 16 10:43:34 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): bound check before calling re_match().
-
-Tue Dec 15 13:59:01 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (exc_to_s): returns class name for unset mesg.
-
-	* error.c (exc_initialize): do not initialize @mesg by "".
-
-	* parse.y (nextc): __END__ should handle CR+LF newlines.
-
-Wed Dec  9 13:37:12 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* pack.c (encodes): use buffering for B-encoding.
-
-	* pack.c (pack_pack): Q-encoding by 'M'.
-
-Tue Dec  8 14:10:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (generic_ivar_get): any object can have instance
-	  variables now.  great improvement.
-
-	* variable.c (rb_name_class): do not set __classpath__ by default,
-	  use __classid__ instead.
-
-Mon Dec  7 22:08:22 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h (struct RFile): IO objects can have instance variables now.
-
-	* parse.y (primary): allows `def obj::foo; .. end'.
-
-Mon Dec  7 18:24:50 1998  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* ruby.c (set_arg0): $0 support for HP-UX.
-
-Mon Dec  7 01:30:28 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* dln.c (dln_strerror): better error messages on win32.
-
-Sat Dec  5 23:27:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (here_document): indentable here-doc delimiter by
-	  `<<-'.  Proposed by Clemens <c.hintze@gmx.net>.  Thanks.
-
-Thu Dec  3 16:50:17 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/extmk.rb.in (realclean): trouble on install.
-
-Sun Nov 29 22:25:39 1998  Takaaki Tateishi  <ttate@jaist.ac.jp>
-
-	* process.c (f_exec): check number of argument.
-
-Thu Nov 26 17:27:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c9 released.
-
-Wed Nov 25 13:07:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_dup): do not copy additional data (STR_NO_ORIG).
-
-	* parse.y (yycompile): reduce known memory leak (hard to remove).
-
-Wed Nov 25 03:41:21 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* st.c (st_init_table_with_size): round size up to prime number.
-
-Sat Nov 21 23:27:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (rb_hash_aset): reduce copying key strings.
-
-	* gc.c (looks_pointerp): declare as inline function if possible.
-
-	* st.c (PTR_NOT_EQUAL): compare hash values first before calling
-	  comparing function.
-
-	* st.c (ADD_DIRECT): save hash value in entries to reduce hash
-	  calculation.
-
-	* string.c (rb_str_gsub_bang): avoid rb_scan_args() to speed-up.
-
-	* string.c (rb_str_sub_bang): ditto.
-
-Sat Nov 21 18:44:06 1998  Masaki Fukushima  <fukusima@goto.info.waseda.ac.jp>
-
-	* time.c (time_s_now): had memory leak.
-
-	* ext/md5/md5init.c (md5_new): had memory leak.
-
-	* ext/md5/md5init.c (md5_clone): ditto.
-
-Fri Nov 20 23:23:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/delegate.rb: do not propagate hash and eql?.
-
-Thu Nov 19 01:40:52 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sample/ruby-mode.el (ruby-expr-beg): failed to find reserved
-	  word boundary.
-
-	* eval.c (rb_eval): avoid calling `concat' method.  calls
-	  rb_ary_concat() directly for efficiency.
-
-	* eval.c (rb_eval): actual rest arguments extended arrays too much.
-
-Wed Nov 18 14:30:24 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (rb_define_global_function): global functions now be
-	  module function of the Kernel.
-
-Wed Nov 18 10:48:09 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (read_all): SEGV on large files.
-
-Tue Nov 17 18:11:20 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c8 released.
-
-Tue Nov 17 16:58:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (arg): assignment to attribute name start with capital
-	  should be allowed.
-
-	* eval.c (thread_alloc): needed to mark terminated threads too.
-
-Tue Nov 17 12:33:48 1998  Motoyuki Kasahara  <m-kasahr@sra.co.jp>
-
-	* ext/extmk.rb.in (create_makefile): Set `libdir' to `@libdir@',
-	  Set `pkglibdir' to `$libdir/$(RUBY_INSTALL_NAME)'.
-
-Tue Nov 17 10:30:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (f_sprintf): %l%%c -> %%l%c
-
-Tue Nov 17 01:08:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (ret_args): distinguish `a' and `*a' for the arguments
-	  of yield and return.
-
-	* eval.c (rb_eval): flip3 should work like sed.
-
-	* eval.c (rb_eval): flip{2,3} now have independent state for each
-	  scope to work fine with thread.
-
-Mon Nov 16 23:26:29 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (primary): exec else clause if no exception raised.
-
-Sun Nov 15 15:44:07 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* ext/extmk.rb.in (install): bug in target.
-
-Sat Nov 14 11:02:05 1998  Motoyuki Kasahara  <m-kasahr@sra.co.jp>
-
-	* Makefile.in (install): Give the argument `$(DESTDIR)' to
-	`instruby.rb'.
-	* instruby.rb: Recognize ARG[0] as `destdir'.
-	* instruby.rb: Give the argument `destdir' to `extmk.rb'.
-	* ext/extmk.rb.in: Recognize ARG[1] as `$destdir'.
-
-	* instruby.rb: Create the installation directories (bindir, libdir,
-	archdir, pkglibdir, archdir, and mandir) under `destdir', and
-	install all files under there.
-	* ext/extmk.rb.in: Likewise.
-	
-Sat Nov 14 10:56:55 1998  Motoyuki Kasahara  <m-kasahr@sra.co.jp>
-
-	* instruby.rb: Add the variable `pkglibdir'.
-	* instruby.rb: Set the variable `libdir' to `$(libdir)', not
-	`$(libdir)/$(ruby_install_name)'. `libruby.so' and `libruby.so.LIB'
-	are installed at `libdir'.
-	* instruby.rb: Set the variable `archdir' to `$(pkglibdir)/$(arch)'.
-
-Fri Nov 13 19:43:29 1998  KIMURA Koichi  <kbk@kt.rim.or.jp>
-
-	* missing/nt.c (SafeFree): wrong free offset.
-
-Thu Nov 12 20:11:53 1998  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* sample/ruby-mode.el: wrong highlight.
-
-	* parse.y (parse_regx): newline in regexp was ignored.
-
-Wed Nov 11 10:54:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (here_document): <<'FOO' should not escape anything.
-
-	* parse.y (here_document): bare << here-doc available, even though
-	  it's deprecated.
-
-	* file.c (rb_file_s_readlink): return value should be tainted.
-
-	* ext/etc/etc.c (setup_passwd): information (eg. GCOS name) should
-	  be tainted (modified at Perl Conference).
-
-Tue Nov 10 00:22:11 1998  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* configure.in: elf support for FreeBSD 3.x
-
-Tue Nov 10 00:05:43 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): here document available in eval.
-
-Mon Nov  9 17:55:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c7 released.
-
-Fri Nov  6 19:25:27 1998  Takao KAWAMURA  <kawamura@ike.tottori-u.ac.jp>
-
-	* sample/ruby-mode.el: font-lock patch.
-
-Thu Nov  5 15:42:22 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sample/README, lib/README: simple description for each file.
-
-Wed Nov  4 18:14:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (assign): attribute assignment should be called as public.
-
-Tue Nov  3 23:36:39 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_dump): dumps core for negative char value.
-
-	* regex.c (re_compile_pattern): out of boundary access for empty
-	  regexp.
-
-Mon Nov  2 22:54:01 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_aset): `str[str]' replaces first match.
-
-Mon Nov  2 18:24:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_create): was accessing modified status.
-
-Sun Nov  1 01:18:52 1998  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* gc.c (xrealloc): size 0 needs round up to 1.
-
-Sat Oct 31 23:18:34 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_split_method): negative LIMIT means number of
-	  splitted fields are unlimited, as in perl.
-
-	* string.c (rb_str_split_method): if LIMIT is unspecified,
-	  trailing null fields are stripped.
-
-Sat Oct 31 04:16:14 1998  Inaba Hiroto  <inaba@st.rim.or.jp>
-
-	* string.c (str_aref): regexp index SEGVed.
-
-Fri Oct 30 14:33:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_match): returns nil for unmatch.
-
-	* dir.c (dir_entries): new method.
-
-	* eval.c (block_pass): do not push block, substitute it.
-
-Fri Oct 30 01:28:52 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* range.c (range_check): avoid <=> check for Fixnums.
-
-	* array.c (rb_ary_aset): accept negative index.
-
-Wed Oct 28 22:00:54 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): access out of boundary fixed.
-
-Wed Oct 28 11:37:42 1998  TAMITO  <tommy@valley.ne.jp>
-
-	* io.c (f_select): fd number comparison bug.
-
-Tue Oct 27 23:07:11 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sample/ruby-mode.el (ruby-parse-region): forgot to support %w()
-	  style array literal.
-
-	* eval.c (rb_eval): unused block raises warning.
-
-Mon Oct 26 09:37:53 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (dvar_asgn_push): dvar pushed too many times if
-	  variable-in-block first appear in loops.
-
-Sun Oct 25 22:59:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (set_list_bits): was using wrong offset.
-
-Thu Oct 22 00:07:11 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_obj_method): method retrieved from tainted object
-	  should be tainted too.
-
-	* eval.c (method_call): safe_level should be restored during
-	  Method#call.
-
-Wed Oct 21 14:21:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (Init_IO): new constants IO::SEEK_{SET,CUR,END}.
-
-	* io.c (rb_f_ungetc): ungetc pushes a char back into STDIN.
-
-Mon Oct 19 11:50:00 1998  Motoyuki Kasahara  <m-kasahr@sra.co.jp>
-
-	* ext/extmk.rb: Load '@top_srcdir@/lib/find.rb', not
-	'../lib/find.rb'.
-	* ext/extmk.rb: Distinguish between `top_srcdir' and `topdir'.
-	* Makefile.in (CFLAGS): Add `-I.'.
-	* Makefile.in (lex.c): Give `@srcdir@/keywords' to gperf, not
-	`keywords'.
-	* instruby.rb: Use `CONFIG["bindir"]', instead of `prefix + "/bin"'.
-	* instruby.rb: Use `CONFIG["libdir"]', instead of `prefix + "/lib"'.
-	* instruby.rb Use `CONFIG["mandir"]', instead of `prefix + "/man"'.
-	* instruby.rb (wdir): Add the variable to preserve the current
-	working directory.
-	* instruby.rb: Chdir to wdir before install `config.h' and
-	`rbconfig.rb'.
-
-Mon Oct 19 10:07:01 1998  EGUCHI Osamu  <eguchi@shizuokanet.ne.jp>
-
-	* eval.c (rb_eval): reduce recursive calls to rb_eval().
-
-Fri Oct 16 15:31:45 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_new_internal): timeval must be positive.
-
-Thu Oct 15 13:54:48 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (arg): local variables can be accessed within right side
- 	  expression in assignment, notably in blocks.
-
-Wed Oct 14 00:18:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (Init_Array): Array#=== is now for equal check, not
-	  inclusion check.
-
-	* parse.y (when_args): `when a, *b' style new syntax for array
-	  expansion in `case'.
-
-Tue Oct 13 14:30:32 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (rb_obj_untaint): taint marks can be unset.
-
-	* eval.c (rb_eval): taint propagation for embedded strings.
-
-Mon Oct 12 13:27:15 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_call0): check stack depth more frequently.
-
-Mon Oct 12 08:08:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_p): can print even in secure mode.
-
-Sun Oct 11 22:50:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (rb_const_set): taint check for modification.
-
-	* variable.c (rb_ivar_set): taint check for modification.
-
-	* string.c (rb_str_modify): taint check for modification.
-
-	* hash.c (rb_hash_modify): taint check for modification.
-
-	* array.c (rb_ary_modify): taint check for modification.
-
-	* ruby.h (FL_TAINT): taint for all objects, not only strings.
-
-Fri Oct  9 17:01:14 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (read_all): read() returns "" at immediate EOF.
-
-	* io.c (io_read): read(nil) read all until EOF.
-
-Thu Oct  8 13:32:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_dump): marshal can dump Time object now.
-
-	* marshal.c (Init_marshal): rename marshal methods `_dump_to' to
- 	  `_dump', `_load_from' to `_load'.
-
-	* parse.y (rb_intern): "+=".intern generates proper symbol.
-
-Mon Oct  5 18:31:53 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c6 released.
-
-Fri Oct  2 14:22:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): `/\s*(--)$/ =~ "- --"' did not match,
-	  because of wrong optimize condition.
-
-Mon Oct  1 01:55:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (rb_intern): should not raise exceptions.
-
-	* parse.y (yylex): symbol like `:foo?=' should not be allowed.
-
-	* ext/extmk.rb.in: makes *.a for static link modules.
-
-Wed Sep 30 14:13:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_start): supports making a subclass of the
-	  Thread class.
-
-Tue Sep 29 17:46:01 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_thread_join): join is now an instance method.
-
-Fri Sep 25 12:01:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): `@foo!' should be an error.
-
-Thu Sep 24 14:55:06 1998  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* ext/etc/etc.c (Init_etc): wrong field definition.
-
-Thu Sep 17 17:09:05 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_reopen): was creating FILE* for wrong fd.
-
-Tue Sep 15 05:28:11 1998  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* regex.c (re_compile_pattern): forgot to fixup for the pattern
- 	  like (?=(A)|(B)).
-
-Tue Sep 15 01:06:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (rb_io_gets_internal): do not set $_ by default, only
-	  gets/readline set the variable.
-
-	* eval.c (rb_f_load): load toplevel class is set to anonymous
-	  module if safe_level >= 5, to encapsulate modification.
-
-	* eval.c (rb_f_load): set frame properly.
-
-	* string.c (rb_str_each_line): do not set $_.
-
-Mon Sep 14 14:42:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): beginning and end of the string, do not
-	  automatically match `\b'.
-
-	* string.c (scan_once): consume at least on character.
-
-	* regex.c (re_search): wrong behavior for negative range.
-
-Sat Sep 12 21:21:26 1998  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* regex.c (re_search): range value should be maintained.
-
-Thu Sep 10 10:55:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (backref_error): yyerror does not understand formats.
-
-Tue Sep  8 18:05:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c5 released.
-
-Tue Sep  8 10:03:39 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_each_line): wrong line splitting with newline at
- 	  top of the string.
-
-	* string.c: non bang methods return copied string.
-
-	* eval.c (f_END): needed to initialize frame->argc;
-
-Fri Sep  4 11:27:40 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (bigadd): proper sign combination.
-
-	* regex.c (re_search): wrong return value for \A.
-
-Thu Sep  3 14:08:14 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c4 released.
-
-Tue Sep  1 10:47:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (slow_search): do not compare llen and blen.  llen may
-	  be longer than blen, if little contains 0xff.
-
-	* regex.c (mbctab_euc): set 0x8e as multibyte character.
-
-	* string.c (str_inspect): mask character for octal output.
-
-Mon Aug 31 15:32:41 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): use calculated offset if exactn is the
-	  first opcode in the compiled regexp.
-
-	* regex.c (bm_search): use Boyer-Moore search for simple search.
-
-	* regex.c (must_instr): wrong length check if pattern includes
-	  byte escape by 0xff.
-
-	* regex.c (re_compile_pattern): need not to check current_mbctype.
-
-Sat Aug 29 16:31:40 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_check_safe_str): avoid calling rb_id2name() in normal 
-	  cases to speed-up.
-
-	* eval.c (thread_raise): do not save context of terminated thread.
-
-	* regex.c (re_compile_pattern): mask \nnn over 256.
-
-Sat Aug 29 02:09:46 1998  Koji Arai  <JCA02266@nifty.ne.jp>
-
-	* sprintf.c (f_sprintf): wrong buffer size check.
-
-Fri Aug 28 01:57:04 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): accepts (?ix-ix) and (?ix-ix:...).
-
-Fri Aug 28 12:25:33 1998  Hiroshi Igarashi  <igarashi@ueda.info.waseda.ac.jp>
-
-	* ruby.c (ruby_require_modules): load modules in appearing order.
-
-Fri Aug 28 01:57:04 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): accepts (?ix-ix) and (?ix-ix:...).
-
-Thu Aug 27 12:54:28 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c3 released.
-
-Wed Aug 26 14:40:56 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): check whether ruby_class is properly set,
-	  before accessing it.
-
-	* eval.c (rb_obj_instance_eval): ruby_class should be Qnil for
-	  special objects like Fixnums.
-
-	* ext/tkutil/tkutil.c (Init_tkutil): removes calls to
-	  rb_yield_0().  used instance_eval() instead in the tk.rb.
-
-Wed Aug 26 11:47:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): pop non-greedy stack elements on success.
-
-Wed Aug 26 09:25:35 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ruby.h: add #define environ for cygwin32.
-
-Tue Aug 25 08:57:41 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (rb_ary_sort_bang): temporarily freeze sorting array.
-
-Mon Aug 24 18:46:44 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* dln.c (dln_find_1): path check was too strict.
-
-Mon Aug 24 15:28:11 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* parse.y (f_arglist): opt_nl added after f_args.
-
-Fri Aug 21 01:06:01 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c: grand renaming on socket.c.
-
-	* ext/socket/socket.c (inet_aton): supply inet_aton for those
-	  systems that do not have it.
-
-	* ext/socket/socket.c (setipaddr): use inet_aton instead of
-	  inet_addr.
-
-	* ext/socket/socket.c (tcp_s_gethostbyname): new method: works
-	  like Socket.gethostbyname but returning array contains ip-addrs
-	  as octet decimal string format like "127.0.0.1".
-
-	* ext/socket/socket.c (mkhostent): return format changed to
-	  [host, aliases, type, ipaddr..]  as documented.
-
-Wed Aug 19 00:31:09 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_ctl): forgot to place TRAP_END at right position.
-
-Fri Aug 14 11:01:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (call_trace_func): save __FILE__, __LINE__ before
- 	  executing trace_func, since trace function should not corrupt
- 	  line number information.
-
-Thu Aug 13 15:09:02 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_s_new): was marking unallocated region on GC.
-
-Tue Aug 11 11:57:35 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c2 released.
-
-Mon Aug 10 14:05:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* process.c (f_system): removed fflush(stdin).
-
-Fri Aug  7 17:44:44 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (err_snprintf): replace sprintf for fixed sized buffer,
- 	  with snprintf to avoid buffer over-run.  For systems which does
-	  dot provide snprintf, missing/snprintf.c added.
-
-Wed Aug  5 00:47:35 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (rb_reg_search): recycle match object.
-
-Mon Aug  3 09:17:55 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (rb_str_gsub_bang): do not allocate temporary string.
-
-	* string.c (rb_str_sub_bang): use inline replace.
-
-Wed Jul 29 00:36:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (hash_s_new): the default value can be specified.
-
-	* hash.c (hash_default): method to set the default value.
-
-	* hash.c (hash_aref): now returns the default value.
-
-Tue Jul 28 13:03:25 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_s_new): argument to specify initial value is added.
-
-	* array.c (ary_s_new): specifies size, not capacity.
-
-Mon Jul 27 12:39:34 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_replace): zero fill for expansion gap.
-
-	* regex.c (mbctab_euc): set flags on for 0xA1-0xFE.  suggested by
-	  <inaba@st.rim.or.jp>.
-
-	* string.c (str_inspect): consider current_mbctype.
-
-Sun Jul 26 15:37:11 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* array.c (ary_s_new): Array.new(1<<30) dumps core.
-
-Fri Jul 24 13:40:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c1 released.
-
-Fri Jul 24 02:10:22 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (r_bytes2): allocated buffer size was too short.
-
-	* marshal.c (w_object): saves all options, not only casefold flag.
-
-	* re.c (reg_clone): now copies options properly.
-
-	* re.c (reg_get_kcode): code number was wrong.
-
-Thu Jul 23 13:11:32 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_attr): argument should be symbol or string.
-
-Wed Jul 22 11:59:34 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (calculate_must_string): wrong offset added.
-
-Wed Jul 22 11:59:59 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* st.c (rehash): still had a GC problem.  fixed.
-
-Tue Jul 21 13:19:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (gc_mark_threads): crashed on GC before thread allocation.
-
-	* st.c (rehash): GC during rehash caused SEGV.
-
-Tue Jul 21 01:25:10 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (f_sprintf): integer formatter totally re-written.
-
-	* sprintf.c (remove_sign_bits): support uppercase hexadecimal.
-
-Sat Jul 18 00:14:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (f_sprintf): proper sign position for %X and %O.
-
-Fri Jul 17 14:10:20 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1c0 released.
-
-Fri Jul 17 08:01:49 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* process.c (f_exec): Check_SafeStr() added.
-
-	* process.c (f_system): Check_SafeStr() moved before fork().
-
-Thu Jul 16 22:58:48 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (scan_once): substrings to the block should not be
- 	  tainted.  use reg_nth_match(), not str_substr().
-
-	* string.c (str_substr): needed to transfer taint.
-
-Thu Jul 16 16:15:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* gc.c (xmalloc): object allocation count added to GC trigger.
-
-	* eval.c (thread_save_context): avoid marking uninitialized stack
-	  in thread_mark.  GC may be triggered by REALLOC_N().
-
-Wed Jul 15 15:11:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_31.
-
-Wed Jul 15 15:05:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_create): exit() and abort() in threads now
- 	  forwarded to main_thread.
-
-Tue Jul 14 14:03:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (obj_instance_variables): list names that is not
-	  instance variables.
-
-	* gc.c (GC_MALLOC_LIMIT): choose smaller limit value.
-
-Mon Jul 13 12:39:38 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (str2cstr): should not return NULL.
-
-Fri Jul 10 11:51:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (gettable): needed to add dyna_in_block() check.
-
-Thu Jul  9 17:38:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_30.
-
-Thu Jul  9 16:01:48 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sprintf.c (fmt_setup): format specifier for long needed.
-
-	* sprintf.c (f_sprintf): ditto.
-
-	* numeric.c (fix2str): ditto.
-
-	* eval.c (thread_create): no more ITIMER_REAL.
-
-	* eval.c (thread_create): thread finalization needed before
-	  aborting thread if thread_abort is set.
-
-Wed Jul  8 18:17:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (big_pow): abandon power by bignum (too big).
-
-Tue Jul  7 13:58:43 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_catch): add C level catch/throw feature.
-
-Mon Jul  6 15:18:09 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (arg): proper return values for `||=' and `&&='.
-
-Fri Jul  3 16:05:11 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_29.
-
-Fri Jul  3 11:20:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (r_byte): byte should not extend sign bit.
-
-	* numeric.c (fix_mul): use FIX2LONG() instead of FIX2INT() for
-	  64bit architectures.
-
-	* marshal.c (r_bytes): remove weird casting between pointer and int.
-
-	* process.c (proc_setsid): new method Process#setsid().
-
-Thu Jul  2 12:49:21 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* marshal.c (w_object): remove `write_bignum' label for 64bit
- 	  architectures.
-
-	* marshal.c (r_bytes): needs int, not long.
-
-Wed Jul  1 14:21:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (flo_plus): should not allow addition with strings.
-
-Wed Jul  1 13:09:01 1998  Keiju ISHITSUKA  <keiju@rational.com>
-
-	* numeric.c (num_uminus): wrong coerce direction.
-
-Tue Jun 30 10:13:44 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (f_p): accepts arbitrary number of arguments.
-
-	* eval.c (rb_yield_0): there's some case that iterator_p() returns 
-	  true even if the_block was not set.  check added.
-
-Tue Jun 30 01:05:20 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (BEGIN_CALLARGS): adjust the_block before evaluating the
-	  receiver's value and the arguments.
-
-Fri Jun 26 18:02:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_28.
-
-Fri Jun 26 11:01:26 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (str_aset_method): needed to convert to string.
-
-Thu Jun 25 02:05:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): optimize for `.*' at beginning of the
-	  pattern.
-
-	* regex.c (re_search): optimize for character class repeat at
-	  beginning of the pattern.
-
-	* regex.c (re_compile_pattern): detect optimization potential for
-	  the compiled patterns.
-
-Thu Jun 25 00:02:26 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* re.c (reg_s_new): flag value was wrong.
-
-Wed Jun 24 23:45:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_search): wrong anchor handling for reverse search.
-
-Wed Jun 24 02:18:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (mlhs): `((a,b)),c = [[1,2]],3' assigns a=1,b=2,c=3.
-
-Tue Jun 23 11:46:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): `&&=' and `||=' added.
-
-Sat Jun 20 02:53:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (assignable): nesting local variables should have higher
- 	  priority than normal local variables for assignment too.
-
-Fri Jun 19 18:28:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_27.
-
-Fri Jun 19 14:34:49 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (assign): support hack for nested multiple assignment.
-
-	* parse.y (mlhs): nested multiple assignment.
-
-	* eval.c (rb_eval): in-block variables now honors static scope.
-
-	* configure.in: RSHIFT check moved to configure.
-
-Thu Jun 18 16:46:04 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_26.
-
-Thu Jun 18 13:37:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (file_s_ftype): uses lstat(2) instead of stat(2).
-
-	* dir.c (dir_s_glob): there can be buffer overrun, check added.
-
-	* eval.c (f_binding): handles in-block variables declared after
-	  binding's generation.
-
-	* numeric.c (flo_floor): floor, ceil, round added to Float.
-
-Wed Jun 17 11:20:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (gettable): nesting local variables should have higher
- 	  priority than normal local variables.
-
-Tue Jun 16 12:30:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (str2inum): handles `+ddd'.
-
-	* struct.c (make_struct): name parameter can be nil for unnamed
-	  structures.
-
-Mon Jun 15 16:30:10 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (class_s_inherited): prohibiting to make subclass of
-	  class Class.
-
-	* object.c (module_s_new): support for making subclass of Module.
-
-	* parse.y (yycompile): clear eval_tree before compiling.
-
-Fri Jun 12 17:58:18 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (eval): write back the_dyna_var into the block.
-
-Thu Jun 11 18:19:18 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_25.
-
-	* eval.c (dvar_add_compiling): register dyna_var at compile time.
-
-	* regex.c (re_compile_pattern): RE_DUP_MAX iteration is too big.
-
-Wed Jun 10 15:12:04 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_eof): do not block other threads.
-
-	* signal.c (trap): reserve SIGALRM for thread.
-
-	* eval.c (thread_create): use ITIMER_REAL also to avoid system
-	  call blocking.
-
-	* io.c (f_syscall): add TRAP_BEG, TRAP_END around system calls.
-
-	* io.c (io_ctl): add TRAP_BEG, TRAP_END around system calls.
-
-	* enum.c (enum_collect): did not collect false values.
-
-	* array.c (ary_new2): forgot to initialize capa field.
-
-Tue Jun  9 18:36:15 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (str_split_method): split dumped core for "\xff".
-
-Tue Jun  9 16:22:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_24.
-
-Tue Jun  9 16:04:07 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/kconv/kconv.c (kconv_guess): more precise decision for EUC,
-	  using jless algorithm (3 sequential EUC hiragana characters).
-
-Tue Jun  9 15:12:44 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/kconv/kconv.c (kconv_guess): wrong guess for EUC as SJIS in
-	  some cases (0xe0 - 0xef).
-
-	* gc.c (xmalloc): insert size check for big (negative in signed)
-	  allocation size.
-
-Tue Jun  9 02:54:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/parsedate.rb: wday moved to the last in the return values.
-
-Mon Jun  8 10:40:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_split_method): split dumped core for "\0".
-
-Sat Jun  6 22:50:52 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (calculate_must_string): wrong condition for
-	  {start,stop}_nowidth.
-
-	* regex.c (re_match): various features imported from GNU regex.c
- 	  0.12, such as nested grouping, avoiding infinite loop with empty
- 	  match, etc.
-
-	* regex.c (register_info_type): now use union.
-
-	* regex.c (re_search): more precise anchor(^) check.
-
-Wed Jun  3 18:07:54 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_raise): check rb_in_compile, not rb_in_eval.
-
-Mon Jun  1 05:26:06 1998  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* string.c (trnext): casting to signed char* needed.
-
-Tue Jun  2 16:00:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c (udp_addrsetup): error check enhanced.
-
-	* ext/socket/socket.c (sock_s_getservbyaname): use strtoul(), if
-	  possible.
-
-Sat May 30 07:10:02 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_prepare_re): no more needless regular expression
- 	  recompile on casefold conditions.
-
-Thu May 28 18:02:55 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (nil_plus): no more `+' method for nil.
-
-Wed May 27 17:33:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (hash_fetch): new method.
-
-	* regex.c (re_search): check whether translate table is set.
-
-Tue May 26 11:39:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_23.
-
-	* parse.y (yylex): no UPLUS/UMINUS for 1st argument if
-	  parenthesises are omitted.
-
-Tue May 26 01:09:55 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): (?XI) for turns off the
-	  corresponding option.
-
-Mon May 25 12:38:56 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): inline i option (?i).
-
-	* regex.c (re_compile_pattern): inline x option (?x).
-
-	* regex.c (re_compile_pattern): x option for regexp.
-
-	* dir.c (dir_s_open): returns block's evaluated value.
-
-	* io.c (f_open): returns block's evaluated value.
-
-	* ext/curses/curses.c (curses_addstr): nil argument caused SEGV.
-
-Fri May 22 11:52:45 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): push mark on (?:), so that
-	  laststart check for {a,b} can be done.
-
-Thu May 21 17:31:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_match): wrong match (too non-greedy) for `{a,b}?'.
-
-	* io.c (io_lineno): new method IO#lineno, IO#lineno=.
-
-Wed May 20 06:04:43 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* BeOS patch.
-
-Wed May 20 16:32:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (BIGDN): use RSHIFT(), instead of mere `>>'.
-
-Tue May 19 16:36:26 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_22.
-
-Tue May 19 16:31:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (assignable): specification changed for in-block
- 	  variable definition.
-
-	* eval.c (dyna_var_asgn): error in in-block variables' compile
- 	  time definition.
-
-	* parse.y (str_extend): wrong nesting detection.
-
-Tue May 19 09:47:55 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* numeric.c (num2int): re-defined (extensions may use this).
-
-Mon May 18 16:40:50 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* error.c (get_syserr): BeOS support.
-
-	* configure.in: modified for BeOS.
-
-	* string.c (str_dump): do not call isascii().
-
-	* sprintf.c (remove_sign_bits): forgot to initialize end pointer.
-
-	* glob.c: #include <alloca.h> added.
-
-Mon May 18 14:52:21 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-	
-	* experimental release 1.1b9_21.
-
-Mon May 18 03:27:57 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* file.c (file_s_expand_path): optional second argument
-	  `default_directory' added.
-
-Sat May 16 22:06:52 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* error.c (RAISE_ERROR): wrong error message
-
-Fri May 15 14:43:25 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_20.
-
-Thu May 14 14:44:21 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* sun4 cc patches for intern.h and regex.h.
-
-Thu May 14 14:03:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* random.c (RANDOM_MAX): guessing proper maximum value for random
- 	  numbers.
-
-	* random.c (f_rand): use drand48 if possible.
-
-Wed May 13 19:05:20 1998  MAEDA shugo  <shugo@aianet.ne.jp>
-
-	* BeOS patches for io.c, error.c and config.guess.
-
-Wed May 13 14:56:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_19.
-
-	* most of the Mac and BeOS patches merged, except path separators.
-
-	* error.c (err_append): generated SyntaxError was String.
-
-	* ruby.h: xxx2INT, xxx2UINT checks values as int, not long.
-
-	* ruby.h: remove typedef's. INT, UINT, UCHAR, USHORT.
-
-Tue May 12 17:38:00 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_18.
-
-Tue May 12 11:38:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* error.c (syserr_errno): returns errno of the SystemCallError.
-
-	* error.c (rb_sys_fail): saves errno in the Exception.
-
-	* error.c (set_syserr): no need to protect syserr_list.
-
-	* error.c (rb_sys_fail): no more bufsize limit.
-
-	* error.c (set_syserr): integer value of errno can be accessed by
-	  Errno::EXXX::Errno.
-
-Sun May 10 03:10:33 1998  WATANABE Tetsuya  <tetsu@jpn.hp.com>
-
-	* io.c (io_tell etc.): moved from File class to IO class.
-
-Fri May  8 12:26:37 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (pack_unpack): should be unsigned int (was signed int).
-
-Thu May  7 16:34:10 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* pack.c (pack_pack): `V', `N' uses newly created NUM2UINT().
-
-	* ruby.h (NUM2UINT): new macro.
-
-	* bignum.c (big2uint): try to convert bignum into UINT.
-
-	* re.c (reg_match): needed to return false for match with nil.
-
-	* gc.c (obj_free): wrong condition to free string.
-
-Wed May  6 21:08:08 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ruby.c (ruby_process_options): modified for DJGPP.
-
-Wed May  6 15:48:03 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_17.
-
-Wed May  6 01:37:39 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c: remove global variable `errat'.
-
-	* eval.c (rb_longjmp): embed error position information in the
- 	  exception object.
-
-Sat May  2 12:20:02 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_search): supports reverse search.
-
-	* string.c (str_index_method): does update $~ etc.
-
-	* eval.c (f_load): needed to clear the_dyna_vars.
-
-	* eval.c (dyna_var_asgn): do not push dyna_var, which is id == 0.
-
-	* error.c (Init_Exception): NotImplementError is no longer
-	  StandardError, which is not handled by default rescue.
-
-Fri May  1 00:35:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (proc_options): `-d' turns on verbose flag too.
-
-	* error.c (exception): last argument may be the superclass of the
-	  defining exception(s).
-
-	* io.c (Init_IO): EOFError is now subclass of the IOError.
-
-	* io.c (Init_IO): forgot to define IOError.
-
-	* error.c (Init_Exception): old Exception class renamed to
-	  StandardError.  Exception now replaces old GlobalExit.
-
-	* error.c (Init_Exception): Exception is now the root of the
-	  Global Exits.  There's no longer GlobalExit class.
-
-	* util.c (ruby_mktemp): check TMP, TMPDIR first.
-
-Thu Apr 30 01:08:35 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/tk.rb: call 'unknown', if proc not defined.
-
-	* eval.c (handle_rescue): default rescue handles `Exceptional' not 
-	  only the instance of the `Exception's.
-
-	* eval.c (f_raise): exception can be any object.
-
-	* time.c (time_gm_or_local): call time_gmtime or time_localtime.
-
-	* eval.c (f_raise): raises TypeError if the class which is not a
-	  subclass of String is specified (checked in exc_new()).
-
-	* error.c (exc_new): need to check whether invalid class (not a
-	  subclass of String) is specified.
-
-Wed Apr 29 21:05:44 1998  WATANABE Hirofumi  <eban@os.rim.or.jp>
-
-	* ruby.c (proc_options): option '-e' via tempfile.
-
-Tue Apr 28 15:27:58 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_16.
-
-Tue Apr 28 00:07:38 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (obj_is_proc): type check predicate.
-
-	* eval.c (obj_is_block): ditto.
-
-Mon Apr 27 16:59:17 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/gtk/gtk.c (Init_gtk): use timeout, not idle to avoid
-	  consuming CPU too much.
-
-	* lib/tk.rb: use tcltklib#_invoke instead of `_eval'.
-
-Mon Apr 27 16:59:17 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_sort): use dup, not clone.
-
-Mon Apr 27 13:46:27 1998  Tadahiro Maebashi  <maebashi@iij.ad.jp>
-
-	* ext/tcltklib/tcltklib.c (ip_invoke): invoke tcl command
-	  directly.  need not worry about escaping tcl characters.
-
-Mon Apr 27 12:04:43 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* random.c (f_rand): do not call srand() implicitly.
-
-Fri Apr 24 14:35:45 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_15.
-
-	* parse.y (assignable): dyna_var_asgn actually defines nested
-	  local variables in outer context.
-
-	* random.c (f_rand): call srand(), if it has not called yet.
-
-	* random.c (f_srand): use tv_usec as the default seed.
-
-	* eval.c (rb_eval): values of nested local variables should be
- 	  independent.
-
-	* eval.c (rb_yield_0): local variables wrong nested conditions.
-
-Wed Apr 22 23:27:17 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (select_get_io): get IO object by `to_io'.
-
-	* io.c (io_to_io): method to retrieve IO object, from delegating
- 	  object for example.
-
-Wed Apr 22 16:52:37 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_14.
-
-	* string.c (str_modify): check for embedded pointer reference.
-
-	* gc.c (obj_free): ditto.
-
-	* pack.c (pack_pack): p/P template to embed pointers.
-
-Wed Apr 22 00:07:10 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* array.c (ary_rindex): embarrassing typo.
-
-Tue Apr 21 12:31:48 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_13.
-
-	* configure.in (RUBY_LIB): supports --program-{prefix,suffix}.
-
-	* array.c (ary_rindex): new method.
-
-	* io.c (io_binmode): should return self.
-
-Tue Apr 21 08:23:04 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* parse.y (here_document): calling parse_string with wrong
-	  arguments.
-
-	* struct.c (struct_aset): problem member assignment with name.
-
-Mon Apr 20 14:47:49 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_12.
-
-	* time.c (time_arg): args may be string (support for reduced
-	  implicit type conversion).
-
-	* lib/base64.rb: changed to use pack/unpack with `m' template.
-
-Mon Apr 20 06:23:20 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (mod_remove_const): new method.
-
-Sat Apr 18 03:53:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (hash_each_with_index): removed.  use Enumerable's
-	  each_with_index instead.
-
-	* class.c (rb_include_module): check for super modules, since
- 	  module's included modules may be changed.
-
-Fri Apr 17 21:50:47 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* marshal.c (r_long): r_byte() may return signed byte.
-
-Fri Apr 17 11:58:30 1998  NAGAI Hidetoshi  <nagai@dumbo.ai.kyutech.ac.jp>
-
-	* ext/tcltklib/tcltklib.c (lib_mainloop): thread and interrupt check.
-
-Fri Apr 17 11:06:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (find_file): try to fopen() to check whether file exists.
-
-	* ruby.c (load_file): ditto.
-
-	* struct.c (struct_aset): struct member can be set by member name.
-
-Fri Apr 17 00:47:19 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/extmk.rb.in: added m68k-human support
-
-	* file.c (LOCK_SH): defines moved.
-
-	* array.c (ary_flatten_bang): simplified loop.
-
-Thu Apr 16 16:52:01 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_11.
-
-	* lib/tk.rb: thread support (experimental - maybe slow).
-
-	* eval.c (rb_longjmp): trace event on exception in raising
- 	  context, just before raising exception.
-
-	* struct.c (struct_s_members): forgot to check singletons.
-
-	* struct.c (struct_aref): members can be accessed by names too.
-
-	* array.c (ary_flatten): new method.
-
-	* eval.c (rb_longjmp): prints exception information with `-d'.
-
-	* object.c (any_to_s): remove class name restriction.
-
-Thu Apr 16 01:38:02 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (thread_flock): do not block other threads.
-
-	* eval.c (thread_trap_eval): signals are now delivered to the
- 	  current thread again.  In case that the current thread is dead,
- 	  signals are forwarded to the main thread.
-
-	* string.c (str_new4): need not to duplicate frozen strings.
-
-Wed Apr 15 08:33:47 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* struct.c (struct_inspect): remove restriction for struct names.
-
-Wed Apr 15 02:55:02 1998  Kazuya 'Sharl' Masuda  <sharl@www.ufo.co.jp>
-
-	* x68 patches to config.sub, ext/extmk.rb.in
-
-Wed Apr 15 01:22:56 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_dup_frozen): do not duplicate frozen strings.
-
-	* parse.y (yylex): allow nested parenthesises.
-
-	* io.c (obj_displayln): prints newline after `display'ing the
-	  receiver.
-
-	* io.c (io_puts): avoid generating "\n" each time.  use RS_default
- 	  instead.
-
-	* io.c (f_p): ditto.
-
-Tue Apr 14 22:18:17 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* struct.c (struct_aref): should not subtract negative index.
-
-Tue Apr 14 11:34:50 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_10.
-
-	* parse.y: token names prefixed by `t'.
-
-	* struct.c (struct_s_def): supports subclassing of Struct.
-
-	* io.c (io_s_new): supports subclassing of IO.
-
-Mon Apr 13 11:07:39 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (f_binding): need to restore method name.
-
-	* eval.c (rb_call0): raises SystemStackError, not Fatal.
-
-	* io.c (obj_display): same as `print self'.
-
-	* io.c (f_p): can now be called in the method form.
-
-	* re.c (reg_regsub): needed to be mbchar aware.
-
-Mon Apr 13 13:18:32 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_trap_eval): all signals delivered to main_thread.
-
-Mon Apr 13 12:47:03 1998  TAKAHASHI Masayoshi  <maki@inac.co.jp>
-
-	* re.c (kcode_set_option): did not set SJIS on SJIS condition.
-
-Sun Apr 12 22:14:07 1998  Kazunori NISHI  <kazunori@swlab.csce.kyushu-u.ac.jp>
-
-	* array.c (ary_uniq_bang): should be `==', not `='. embarrassing.
-
-Sat Apr 11 02:13:30 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_subseq): SEGVed for `[][1,1]'.
-
-Fri Apr 10 21:29:06 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* array.c (ary_subseq): add check for beg larger than array length.
-
-Wed Apr  8 17:24:11 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* dir.c (dir_s_open): can be called with block (like IO#open).
-
-	* dir.c (dir_s_chdir): print directory path on error.
-
-	* dir.c (dir_s_chroot): ditto
-
-	* dir.c (Init_Dir): needed to override `new'.
-
-Thu Apr  9 18:24:58 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_09.
-
-	* string.c (str_cmp): do not depend on sentinel at the end of the
-	  strings. 
-
-	* string.c (str_chomp_bang): forgot to set the sentinel.
-
-Wed Apr  8 00:59:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* bignum.c (big2int): converted int may be too big to fit in
-	  signed int.
-
-	* parse.y (arg): `foo += 1' should not cause an error.
-
-	* variable.c (rb_const_defined): returned false even if the
-	  constant is defined at the top level.
-
-	* eval.c (f_local_variables): dyna_var->id may be null.  should
-	  have checked before calling str_new2().
-
-Tue Apr  7 01:15:15 1998  Kaneko Naoshi  <wbs01621@mail.wbs.or.jp>
-
-	* re.c (reg_regsub): need to check string boundary.
-
-Tue Apr  7 19:19:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_cmp): returns either 1, 0, -1.
-
-	* array.c (ary_cmp): should check array length, too
-
-Tue Apr  7 18:50:16 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_08.
-
-Tue Apr  7 18:31:27 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* instruby.rb (mandir): dll installation for cygwin32
-
-Tue Apr  7 01:16:45 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* config.sub (maybe_os): TOWNS support?
-
-	* config.guess: too strict check for libc versions on linuxes.
-
-	* experimental release 1.1b9_07.
-
-	* array.c (ary_cmp): compare each element using `<=>'.
-
-	* hash.c (hash_each_with_index): yields [value, key] pair.
-
-	* class.c (class_protected_instance_methods): list protected
-	  method names.
-
-	* class.c (ins_methods_i): exclude protected methods.
-
-	* eval.c (PUSH_BLOCK): dynamic variables can be accessed from
- 	  eval() with bindings.
-
-Mon Apr  6 14:49:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_yield): must return evaluated value.
-
-Fri Apr  3 13:07:29 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_schedule): context switch bypassed on wrong
-	  conditions.
-
-	* variable.c (rb_name_class): set classname by id before String
- 	  class is initialized (1.0 behavior restored).
-
-Fri Apr  3 11:25:45 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (num2int): no implicit conversion from string.
-
-	* numeric.c (num2int): check whether `to_i' returns an Integer.
-
-	* numeric.c (num_zero_p): new method.
-
-	* numeric.c (num_nonzero_p): new method.  returns the receiver if
- 	  it's not zero.
-
-	* eval.c (obj_instance_eval): the_class should be the object's
-	  singleton class.
-
-	* error.c (exc_s_new): message is converted into a string.
-
-Thu Apr  2 18:31:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (obj_call_init): every object call `initialize'.
-
-Wed Apr  1 08:51:53 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* parse.y (stmt): UNTIL_MOD should be for stmt, not only for expr.
-
-Wed Apr  1 01:20:31 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (true_and): boolean operators &, | and ^.
-
-Tue Mar 31 13:23:58 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_compact_bang): returns nil, if it does not modify
-	  the array like String's bang methods.
-
-	* array.c (ary_uniq_bang): new method to remove duplicate items.
-
-	* eval.c (bind_s_new): new method.
-
-	* numeric.c (num2int): raise exception if Fixnums too big to
- 	  convert into `int' in case that sizeof(int) < sizeof(INT).
-
-	* string.c (str_center): SEGV on negative width.
-
-	* eval.c (eval): forgot to set sourcefile.
-
-Mon Mar 30 11:12:29 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (f_test): raises exception for unknown command.
-
-	* eval.c (Init_eval): `class_eval': alias to the module_eval.
-
-Mon Mar 30 18:50:42 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* string.c (str_capitalize_bang): did not check string modification.
-
-	* string.c (str_delete_bang): wrong conversion.
-
-	* string.c (str_intern): typo in error message.
-
-Mon Mar 30 01:44:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (obj_instance_eval): accepts block as evaluation body.
-	  No compilation needed each time.
-
-	* eval.c (mod_module_eval): ditto
-
-	* file.c (file_s_umask): umask did not return old values, if no
- 	  argument given.
-
-Sun Mar 29 00:54:23 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (f_throw): nil returned always.
-
-Sat Mar 28 20:40:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_06.
-
-Sat Mar 28 16:07:11 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* io.c (io_closed): should not cause exception for closed IO.
-
-	* string.c (str_tr): returned nil for success.
-
-Sat Mar 28 00:47:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (f_local_variables): new method to return an array of
- 	  local variable names.
-
-	* variable.c (obj_instance_variables): now returns an array of
-	  variable names, as described in the reference.
-
-	* eval.c (rb_attr): honors default method visibility of the
-	  current scope.
-
-Fri Mar 27 13:49:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_05.
-
-	* ruby.c (ruby_prog_init): `site_ruby' added to load_path.
-
-	* ruby.c (ruby_prog_init): load-path order changed.  Paths in
- 	  the RUBYLIB environment variable comes first in non-tainted
- 	  mode.
-
-Thu Mar 26 11:51:09 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_call): new feature: `protected' methods.
-
-	* string.c (str_dump): new method.
-
-	* eval.c (block_pass): block argument can be nil, which means no
-	  block is supplied for the method.
-
-Wed Mar 25 21:20:13 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* string.c (str_reverse_bang): string copied to wrong place.
-
-Wed Mar 25 08:12:07 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (flo_modulo): caused SEGV if left operand is not a
- 	  float value.
-
-	* eval.c (f_eval): optional third and fourth argument to specify
-	  file-name and line-number.
-
-	* eval.c (eval): file-name and line-number set properly.
-
-	* parse.y (assign_in_cond): literal assignment is now warning, not 
-	  compile error.
-
-	* error.c (Warn): Warn() always print message, OTOH Waring()
-	  prints when verbose flag is set.
-
-Tue Mar 24 12:50:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (ruby_prog_init): `.' should come last in the load-path.
-
-	* eval.c (Init_eval): `__send__', alias for `send'.
-
-Mon Mar 23 12:44:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_chomp_bang): now takes `rs' as an argument.
-
-	* eval.c (thread_free): main_thread should not be freed.
-
-Fri Mar 20 16:40:34 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_chomp_bang): chomp! (and other ! methods) returns
- 	  nil if it does not modify the string.
-
-	* string.c (str_sub_iter_s): should check last pattern since it
- 	  may be matched to null.
-
-Thu Mar 19 13:48:55 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_04.
-
-	* parse.y (yylex): `10e0.9' should cause syntax error.
-
-Wed Mar 18 17:46:31 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (load_file): new file object constant DATA.  Only
-	  available for the script from the file.
-
-	* regex.c (re_match): forwarding failure point popped too much. 
-
-Tue Mar 17 18:23:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* math.c (math_frexp): newly added.
-
-	* math.c (math_ldexp): ditto.
-
-	* bignum.c (bigdivmod): calculates modulo.
-
-	* numeric.c (fix_remainder): returns reminder, formerly introduced
- 	  as modulo.
-
-	* numeric.c (fix_modulo): calculates proper `modulo'.
-
-	* bignum.c (bigdivmod): wrong sign for reminder.
-
-Mon Mar 16 17:07:28 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_03.
-
-Mon Mar 16 16:33:53 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* io.c (pipe_finalize): needed to add pipe_finalize to pipes on
-	  cygwin32.
-
-Mon Mar 16 14:11:06 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (ins_methods_i): needed to consider NOEX_UNDEF.
-
-Mon Mar 16 13:23:53 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* io.c (io_check_closed): check for `fptr->f2 == NULL'.
-
-	* io.c (io_fptr_close): ditto.
-
-Mon Mar 16 11:49:25 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (pipe_atexit): free()ing referencing pipe_list.
-
-	* range.c (range_length): returns zero, if the first is greater
-	  than the last.
-
-	* signal.c (trap_restore_mask): restore signal mask before raising 
-	  exceptions and throws.
-
-Fri Mar 13 13:49:24 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_02.
-
-	* object.c (mod_clone): need to dups constants and instance
-	  variables.
-
-	* eval.c (rb_eval): forgot to initialize body for NODE_DEFS.
-
-	* eval.c (rb_eval): retrieve self from calling frame, since self
-	  changes sometimes.
-
-	* env.h (FRAME): need to save self in the calling frame.
-
-	* io.c (f_gets_method): rs should be initialized by RS.
-
-Thu Mar 12 15:33:57 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* experimental release 1.1b9_01.
-
-	* range.c (range_s_new): check values by `first <= last'.
-
-	* parse.y (lastline_set): fixed offset for $_ and $~ in the local
-	  variable space.
-
-Wed Mar 11 02:14:17 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_gets): handle normal case specially for speed.
-
-	* eval.c (rb_disable_super): function to disable superclass's
-	  method explicitly.
-
-	* eval.c (rb_eval): inherits previous method definition's
-	  NOEX_UNDEF-ness, if exists.
-
-	* class.c (rb_define_method): disables superclass's overriding
- 	  method by default.
-
-Wed Mar 11 01:40:48 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* numeric.c (flo_gt,etc.): do not depend on `<=>', to handle NaN.
-
-Tue Mar 10 00:03:24 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (load_file): understands multiple options in #! line.
-
-	* regex.c (re_compile_pattern): support for [:alpha:] etc.
-
-Mon Mar  9 16:53:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.h (GetOpenFile): embed io_check_closed in GetOpenFile.
-
-	* sprintf.c (f_sprintf): zero padding failed for negative
-	  integers.
-
-	* sprintf.c (remove_sign_bits): failed to remove some bits.
-
-Sat Mar  7 21:51:46 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* class.c (ins_methods_i): body may be NULL for some case.
-
-Fri Mar  6 17:23:07 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (mbcinit): table driven mbchar detection.
-
-	* object.c (obj_alloc): check for allocating instance for the
-	  primitive classes (mostly perfect).
-
-	* ext/curses/curses.c (curses_finalize): restore original state at 
-	  interpreter termination.
-
-	* ext/curses/curses.c (curses_addstr): forgot to check argument
-	  type (caused SEGV).  now uses STR2CSTR() macro.
-
-Thu Mar  5 13:47:39 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (block_pass): accepts method object as block args.
-
-	* eval.c (f_missing): use any_to_s() for stringify.
-
-Wed Mar  4 01:39:52 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (block_arg): new syntax - block argument in the
-	  calling arglist.
-
-	* eval.c (rb_call): no module search. simplified a lot.
-
-	* eval.c (rb_eval): block arg support.
-
-	* parse.y (f_block_arg): new syntax - block argument in the
- 	  formal arglist.
-
-Tue Mar  3 14:20:15 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (obj_method): returns bound method object.
-
-	* eval.c (rb_call): argument check for empty methods.
-
-	* ruby.h (NUM2CHR): new macro, originally from curses module.
-
-Tue Mar  3 13:03:35 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* io.c (io_putc): new method.
-
-Tue Mar  3 11:21:28 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_inspect): more strict charcode detection.
-
-	* eval.c (thread_stop): stopping only thread raises ThreadError
-	  exception.
-
-Tue Mar  3 08:04:56 1998  Tadayoshi Funaba  <tadf@kt.rim.or.jp>
-
-	* struct.c (struct_alloc): incomplete struct initialization made
- 	  GC to access unallocated addresses.
-
-Mon Mar  2 16:28:27 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (thread_stop_method): remove Thread#stop.
-
-Fri Feb 27 18:16:26 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b9 released.
-
-Fri Feb 27 09:36:35 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (hash_delete_nil): needed to compare value to nil, since
-	  nil is the valid key for hashes.
-
-	* hash.c (hash_foreach_iter): rehashing causes IndexError.
-
-	* hash.c (hash_foreach_iter): rehash check by pointer comparison.
-
-Thu Feb 26 17:22:13 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (fname): convert reswords into symbols.
-
-	* parse.y (reswords): reserved words are now embedded in the
- 	  syntax (sigh).
-
-	* parse.y: now reserved words can be method names safely.
-
-Wed Feb 25 15:50:07 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (mod_module_eval): clear the_scope's PRIVATE flag before
-	  calling eval().
-
-	* gc.c (gc_call_finalizer_at_exit): run finalizers before any data 
-	  object being freed.
-
-	* eval.c (rb_eval): needed to keep prot_tag->retval before
-	  evaluating the ensure clause.
-
-Tue Feb 24 11:16:32 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): reserved words can be appear as method names at
- 	  right after 'def' and `.'(dot), like foo.next.
-
-	* eval.c (return_check): checks for return out of thread (formerly
- 	  done in return_value).
-
-	* eval.c (POP_TAG): copy retval to outer level.
-
-	* eval.c (return_value): just set retval, no check, no unwinding.
-
-	* parse.y (nextc): line continuation by backslash at end of line.
-
-	* regex.c (re_compile_pattern): forgot to clear pending_exact on
-	  closing parentheses.
-
-	* parse.y (assignable): should not assign dyna_var to true, if it
- 	  is already defined.
-
-Mon Feb 23 14:35:03 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (obj_is_kind_of): no longer accepts true/false/nil.
-
-	* object.c ({true,false,nil}_to_i): can be converted into integers.
-
-Mon Feb 23 12:11:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_s_quote): needed to be mbchar aware.
-
-	* eval.c (proc_s_new): wrong iter mark.
-
-Sat Feb 21 22:59:30 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* io.c (f_syscall): no argument check.
-
-Fri Feb 20 10:17:51 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b8 released.
-
-	* ext/kconv/kconv.c (kconv_kconv): default output code now be
-	  determined according to the value of $KCODE.
-
-	* re.c (rb_get_kcode): can retrieve $KCODE from C code. 
-
-	* parse.y (stmt): if/unless modifiers returns nil, if condition is 
-	  not established.
-
-Thu Feb 19 11:06:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/kconv/kconv.c (kconv_kconv): charcode can be specified by
-	  code name (JIS, SJIS, EUC like value of $KCODE).
-
-	* regex.c (re_compile_pattern): forgot to fixup_jump for (?:..).
-
-	* regex.c (re_compile_pattern): needed to clear pending_exact on
-	  non-registering grouping (?:...).
-
-Wed Feb 18 19:54:21 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (here_document): needed to set lex_state to EXPR_END.
-
-Wed Feb 18 18:45:10 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* patches for cygwin32 applied.
-
-Wed Feb 18 00:41:31 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_sub_s): needed to be mbchar aware to increment one
- 	  character.
-
-	* regex.c (re_match): \Z matches newline just before the end of
-	  the string.
-
-Tue Feb 17 00:04:32 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_arg): Time.gm and Time.local now understands
- 	  Time#to_a format.
-
-	* string.c (str_sub_s): replace happened twice for null pattern.
-
-	* regex.c (re_search): null pattern should not match after newline 
-	  at the end of string.
-
-	* time.c (time_isdst): now returns boolean value.
-
-	* error.c (rb_check_type): treat special constants in messages.
-
-	* parse.y (yylex): new form `::Const' to see toplevel constants.
-
-	* parse.y (cond): SEGV on `if ()'.
-
-	* gc.c (obj_free): some data needed explicit free().
-
-Mon Feb 16 23:55:40 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (blk_free): release duplicated block informations.
-
-	* eval.c (blk_copy_prev): duplicate outer block information into
- 	  the heap, when proc/binding created.
-
-Mon Feb 16 14:38:25 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_mon): now 1 for January and so on.
-
-	* time.c (time_year): year in 19xx (no + 1900 needed anymore).
-
-Mon Feb 16 13:28:33 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): need to fetch mbchar's second byte
- 	  without translation.
-
-Mon Feb 16 12:29:27 1998  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* eval.c (f_pass_block): pass iterator block to other method.
-
-Fri Feb 13 08:16:11 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (parse_regx): handle \s before read_escape().
-
-	* parse.y (read_escape): `\s' in strings as space.
-
-Tue Feb 10 17:29:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b7 released.
-
-	* string.c (str_aset): string insertion by `str[n] = str2'.
-
-	* string.c (str_oct): does recognize `0x'.
-
- 	* sprintf.c (f_sprintf): use base 10 for conversion from string to
- 	  integer.
-
-Mon Feb  9 14:51:56 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* numeric.c (do_coerce): proper error message.
-
-	* string.c (str_sum): bug - masked by wrong value. (sigh..)
-
-Sat Feb  7 15:11:14 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_empty): new method
-
-Fri Feb  6 01:42:15 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c (time_asctime): use asctime(3), not strftime(3).
-
-Thu Feb  5 18:58:46 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_fptr_close): do not free path on close().
-
-	* array.c (ary_filter): new method.
-
-	* enum.c (enum_each_with_index): new method.
-
-Thu Feb  5 14:10:35 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (primary): singleton class def can be appeared inside
- 	  method bodies.
-
-	* hash.c (hash_replace): replace content.
-
-	* string.c (str_replace_method): replace content.
-
-	* array.c (ary_replace_method): replace elements.
-
-	* string.c (str_succ_bang): String#succ!
-
-Thu Feb  5 18:20:30 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (str_upcase_bang): multi byte character support.
-
-Wed Feb  4 13:55:26 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (ary_reverse): SEGV on empty array reverse.
-
-Tue Feb  3 12:24:07 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (match_to_a): non matching element should be nil.
-
-	* ruby.c (ruby_load_script): load script after all initialization.
-
-	* bignum.c (str2inum): need to interpret prefix `0' of `0x'.
-
-Tue Feb  3 10:00:18 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* numeric.c (fix_rshift): use `sizeof(INT)*8' instead of 32.
-
-Mon Feb  2 14:09:24 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (set_arg0): grab environment region too.
-
-Thu Jan 29 18:36:25 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* process.c (rb_proc_exec): check `sh' to be exist.
-
-Thu Jan 29 18:18:19 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_stdio_set): assignment to $stdin or $stdout does
-	  reopen() as well as $stderr.
-
-Thu Jan 29 14:18:40 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (mod_ancestors): should not include singleton classes.
-
-	* object.c (obj_type): should not return internal class.
-
-	* io.c (io_reopen): unwillingly closes stdio streams.
-
-Thu Jan 29 11:50:35 1998  Toshihiko SHIMOKAWA  <toshi@csce.kyushu-u.ac.jp>
-
-	* ext/socket/socket.c (udp_addrsetup): forgot to use htons().
-
-Tue Jan 27 23:15:24 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* keywords: __FILE__, __LINE__ are available again.
-
-Fri Jan 23 14:19:28 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b6 released.
-
-	* object.c (mod_to_s): need to duplicate classpath.
-
-	* error.c (exc_inspect): need to duplicate classpath.
-
-Thu Jan 22 00:37:47 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h (STR2CSTR): new macro to retrieve char*.
-
-	* class.c (rb_define_method): `initialize' should always be
-	  private, even if it defined by C extensions.
-
-	* eval.c (rb_eval): `initialize' should always be private.
-
-Thu Jan 22 16:21:08 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): some singleton class def cause SEGV.
-
-	* eval.c (TMP_ALLOC): replace ALLOCA_N, where thread context
- 	  switch may happen.
-
-Wed Jan 21 01:43:42 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (PUSH_FRAME): do not use ALLOCA_N().  crash on some
-	  platforms that use missing/alloca.c.
-
-	* regex.c (re_compile_pattern): too many pops for non register
-	  subexpr.
-
-	* parse.y (yylex): open parentheses after identifiers are argument 
-	  list, even if whitespaces have seen.
-
-Tue Jan 20 15:19:59 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (terms): quoted word list by %w(a b c).
-
-	* ext/tcltklib/extconf.rb: more accurate check for tcl/tk libs.
-
-	* file.c (rb_stat): most of the FileTest methods (and function
- 	  `test') accept File objects as the argument.
-
-Tue Jan 19 18:19:24 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/extmk.rb.in (install): there should be no newline after install:
-
-	* re.c (MIN): renamed from min().  there's a local variable named
- 	  min in the file, so that some cpp will raise an error.
-
-Mon Jan 19 16:30:05 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b5 released.
-
-	* process.c (rb_syswait): no exception raised.
-
-Fri Jan 16 00:43:43 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.h (CLONESETUP): copies its singleton classes too.
-
-	* class.c (singleton_class_attached): saves binded object in the
-	  singleton classes.
-
-	* eval.c (rb_eval): calls singleton_method_added even in the
-	  singleton class clauses.
-
-Fri Jan 15 23:22:43 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ruby.c (proc_options): -S does not recognize PATH.
-
-Thu Jan 15 02:03:12 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_clear_cache_by_id): clear only affected cache
-	  entries.
-
-Wed Jan 14 02:14:48 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c: new UDP/IP socket classes.
-
-Tue Jan 13 10:00:18 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_cmp): ignorecase($=) works wrong.
-
-Fri Jan  9 13:19:55 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b4 released.
-
-	* eval.c (f_missing): class name omitted from the error message.
-
-	* error.c (exc_inspect): description changed.
-
-	* string.c (Init_String): GlobalExit's superclass did not filled,
-	  since GlobalExit created earlier than String.
-
-Thu Jan  8 12:10:09 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (aryset): expr in the brackets can be null.
-
-Wed Jan  7 21:13:56 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_reopen): keep stderr unclosed.
-
-	* io.c (io_errset): keep stderr unclosed.
-
-Tue Jan  6 00:27:43 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y: syntax modified for `while expr do .. end' etc.
-
-	* process.c (f_exec,f_system): can supply arbitrary name for the
- 	  new process.
-
-Mon Jan  5 16:59:13 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* file.c (file_s_basename): removes any extension by ".*".
-
-Sun Jan  4 19:36:22 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* parse.y (yylex): needed to update lex_p (reading point).
-
-Sat Jan  3 19:14:14 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* class.c,object.c: duplicate defines mKernel and cFinxnum.
-
-Fri Jan  2 20:38:59 1998  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/curses/curses.c (NUM2CHAR): uses the first character for
- 	  string arguments.
-
-	* array.c (ary_fill): did not extend array for ranges.
-
-	* array.c (beg_len): did not return end pos bigger than size.
-
-Fri Jan  2 02:09:16 1998  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* dir.c (dir_s_chdir): bug in nil check.
-
-	* array.c (ary_fill): bug in nil check.
-
-Tue Dec 30 11:46:23 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* hash.c (env_path_tainted): checks directories in PATH
-	  environment variable are not world writable.
-
-	* ruby.c (load_file): invoke specified interpreter if the #! line
- 	  does not contain the word `ruby'.
-
-Fri Dec 26 03:26:41 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (uscore_get): type information included in the error
- 	  message.
-
-	* variable.c (f_untrace_var): does not free trace-data within
- 	  trace procedure.
-
-Thu Dec 25 02:50:29 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b3 released.
-
-	* ruby.h: inlining some functions on gcc 2.x
-
-Tue Dec 23 02:47:33 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): public/private information kept in the current 
-	  scope, to remove undesired state from the class/module.
-
-	* time.c (time_strftime): remove hidden limit of 100 bytes of
-	  result string, using malloc'ed buffer. 
-
-	* hash.c (hash_update): merges the contents of another hash,
-	  overriding existing keys.
-
-	* regex.c (must_instr): totally re-written.
-
-	* io.c (read_all): try to allocate proper sized buffer using
-	  fstat(2) for speedup.
-
-Sat Dec 20 00:27:28 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (must_instr): need to skip 2 bytes for mbchars.
-
-Fri Dec 19 01:18:29 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b2 released.
-
-	* eval.c (check_errat): check and convert (if necessary) traceback 
-	  information before assigning to the variable $@.
-
-	* eval.c (f_raise): optional third argument to specify traceback
-	  information.
-
-	* io.c (f_open): prevent infinite recursive call.
-
-Thu Dec 18 19:33:47 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_rindex): now accepts regexp as index.
-
-Thu Dec 18 18:42:50 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/socket/extconf.rb: modified to detect win32 socket lib.
-
-Thu Dec 18 00:25:03 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* re.c (reg_equal): checks for source and casefold and kcode matching.
-
-	* marshal.c: became built-in module.
-
-	* ext/marshal/marshal.c (r_object): displays struct name for
-	  non-compatible struct.
-
-	* string.c (str_index_method): now searches character (fixnum) in
-	  the string.
-
-	* string.c (str_include): redefine `include?'.
-
-	* regex.c (re_match): start_nowidth saves current stack position
-	  to stop_nowidth.
-
-	* regex.c (re_compile_pattern): add space to stop_nowidth to save
-	  runtime stack position.
-
-Tue Dec 16 14:57:43 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (scan_once): wrong exception for regexp that match with 
-	  null string (use substr instead of subseq).
-
-Sat Dec 13 00:13:32 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (expr): remove bare assocs from expr rule.
-
-	* rbconfig.rb: renamed from config.rb (it was too generic name).
-
-Fri Dec 12 00:50:25 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (expr): warns if BEGIN or END appear in the method
- 	  bodies.
-
-	* string.c (str_match): calls y =~ x if y is neither String nor
-	  Regexp so that eregex.rb works.  
-
-	* eval.c (f_at_exit): to register end proc.
-
-	* class.c (rb_define_module_function): define 'function' method
-	  for the Module, not private method.
-
-	* class.c (rb_define_function): function to define `function' method.
-
-	* eval.c (rb_eval): inherit visibility from superclass's method
-	  except when it is set to `function'
-
-	* eval.c (rb_eval): new visibility status `function'.
-
-	* parse.y (yycompile): do not clear eval_tree. thus enable multiple 
-	  command line script by option `-e'.
-
-	* eval.c (rb_eval): END execute just once.
-
-	* parse.y (expr): BEGIN/END built in the syntax.
-
-Thu Dec 11 13:14:35 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (mod_le): Module (or Class) comparison.
-
-	* eval.c (rb_remove_method): raises NameError if named method does 
-	  not exist.
-
-	* ext/curses/curses.c: remove CHECK macro for BSD curses.
-	
-Thu Dec 11 12:44:01 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* pack.c: sun4 cc patch
-
-Wed Dec 10 15:21:36 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/marshal/marshal.c (marshal_load): can supply evolution proc
-	  object as optional second argument.
-
-	* re.c (reg_source): get source string of the regular expression.
-
-Tue Dec  9 10:05:17 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b1 released.
-
-	* parse.y (tokadd): token buffer overrun.
-
-	* ruby.c (ruby_prog_init): forgot to protect rb_argv0 from gc.
-
-	* eval.c (ruby_run): call finalizers at process termination.
-
-	* gc.c (gc_call_finalizer_at_exit): call free proc for every Data
- 	  Wrapper, and finalizer for specified objects at termination.
-
-	* version.c (show_version): version format changed.
-
-	* regex.c (re_match): wrong match with non-greedy if they appear
-	  more than once in regular expressions.
-
-	* sample/ruby-mode.el (ruby-expr-beg): forgot to handle modifiers.
-
-Mon Dec  8 19:00:15 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_puts): just put a newline if no argument given.
-
-	* ext/tcltklib/tcltklib.c (lib_mainloop): thread-aware tk handle
- 	  when $tk_thread_safe is set.
-
-	* ext/tcltklib/tcltklib.c (lib_mainloop): use Tcl_DoOneEvent()
-	  instead of Tk_MainLoop().
-
-Mon Dec  6 07:11:16 1997  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* io.c (io_puts): core dumped without any argument.
-
-Fri Dec  5 18:17:17 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (mod_remove_method): remove (not undef) a method from the 
-	  class/module.
-
-	* variable.c (obj_remove_instance_variable): method to remove
-	  instance variables.
-
-Thu Dec  4 13:50:29 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1b0 released.
-
-	* string.c (str_aref): called str_index for regexp.
-
-Mon Dec  1 15:24:41 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* compar.c (cmp_between): wrong comparison made.
-
-Wed Nov 26 18:18:05 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* lib/mkmf.rb: generate Makefile for extension modules out of ruby 
-	  source tree. use like `ruby -r mkmf extconf.rb'.
-
-	* numeric.c (fix2str): enlarge buffer to prevent overflow on some
-	  machines.
-
-	* parse.y (here_document): wrong line number generated after here-doc.
-
-Fri Nov 21 13:17:12 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (yylex): skip multibyte characters in comments.
-
-Wed Nov 19 17:19:20 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (nil_to_a): nil.to_a => [].
-
-	* parse.y (call_args): wrong node generation.
-
-Tue Nov 18 10:13:08 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* array.c (Init_Array): Array#=== works as Array#include?
-
-	* regex.c (re_compile_pattern): insert initialize code for jump_n, 
-	  before entering loops.
-
-	* re.c (reg_search): does not save registers unless $& etc appear
-	  in the script.
-
-Mon Nov 17 13:01:43 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (is_defined): add defined? check for receivers and
- 	  arguments for calls.
-
-	* re.c (reg_search): cache last match object.
-
-	* re.c (match_aref): $[0] etc. are available.
-
-Sat Nov 15 00:11:36 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* io.c (io_s_popen): "rb" detection
-
-Fri Nov 14 18:28:40 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (scan_once): returns whole match if the pattern does
-	  not contain any parentheses.
-
-Thu Nov 13 14:39:06 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (str_sub): returns copy of the receiver string, even if 
-	  any substitution occurred.
-
-	* regex.c (re_compile_pattern): no-width match by (?=..), (?!..).
-
-Wed Nov 12 13:44:47 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* time.c: remove coerce from Time class.
-
-	* regex.c (re_match): non-greedy match by ??, *? +?, {n,m}?.
-
-Mon Nov 10 11:24:51 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): non-resitering parens (?:..).
-
-	* regex.c (re_compile_pattern): new meta character \< (wordbeg)
-	  and \> (wordend).
-
-	* regex.c (re_compile_pattern): embedded comment for regular
-	  expression by (?#...).
-
-Fri Nov  7 16:58:24 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* regex.c (re_compile_pattern): perl5 regxp \A and \Z available.
-
-	* regex.c (re_compile_pattern): can expand compile stack dynamically.
-
-	* regex.c (PUSH_FAILURE_POINT): wrong compare condition.
-
-Wed Nov  2 16:00:00 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (str_sub_s): "".sub! "", "" => "\000"
-
-Fri Oct 31 15:52:10 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (assoc): keyword assoc like {fg->"black"}.
-
-Thu Oct 30 17:33:38 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_println): print with newline, which is not affected by
-	  the values of $/ and $\.
-
-Thu Oct 30 16:54:01 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* string.c (str_chop_bang): "".chop caused SEGV.
-
-	* string.c (str_chomp_bang): method to chop out last newline.
-
-Mon Oct 27 13:49:13 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/extmk.rb.in: library may have pathname contains `.'
-
-	* eval.c (rb_rescue): should not protect SystemError.
-
-Fri Oct 24 10:58:53 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_s_with_open_stream): ensures to close stream.
-
-Thu Oct 23 11:17:44 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_errset): value of $stderr can be changed (to any IO
- 	  object).
-
-	* io.c (next_argv): $< can be anything that responds to `write'.
-
-	* file.c (file_s_with_open_file): ensures to close file.
-
-	* error.c (exception): create error under the current class/module.
-
-	* range.c (range_eqq): fixnum check for last needed too.
-
-Wed Oct 22 12:52:30 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/socket/socket.c: Socket::Constants added.
-
-	* file.c: File::Constants added for inclusion.
-
-	* array.c (ary_join): call ary_join() recursively for the 1st
- 	  array element.
-
-Mon Oct 20 12:18:29 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ruby.c (load_file): wrong condition for #! check with -x.
-
-	* file.c (file_s_dirname): did return "" for "/a".
-
-Fri Oct 17 14:29:09 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c: now works on alpha-linux.
-
-	* bignum.c (bigadd): some undefined side effect order assumed.
-
-Wed Oct 15 17:49:24 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* intern.h: function prototypes added.
-
-Mon Oct 13 16:54:18 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (rb_define_class_id): call superclass's `inherited'
- 	  method when making subclasses.
-
-	* parse.y (nextc): clear lex_lastline at the end of file.
-
-	* object.c (Init_Object): need to undef Class#append_features.
-
-	* eval.c (rb_eval): no warning on extending classes or modules.
-
-Thu Oct  9 11:17:50 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (error_print): the exception name follows after the error 
-	  message.
-
-	* eval.c (compile_error): error message slightly changed.
-
-	* parse.y (nextc): script parsing will be terminated by __END__ at
- 	  beginning of line.
-
-	* eval.c (compile_error): `__END__' is no longer a keyword.
-
-	* parse.y (nextc): protect lastline read from script stream.
-
-Tue Oct  7 14:06:06 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha9 released.
-
-	* eval.c (mod_append_features): renamed from extend_class.
-
-	* eval.c (rb_eval): defining method calls `method_added'.
-
-	* eval.c (ruby_options): exception while processing options must
-	  terminate the interpreter.
-
-	* error.c (Init_Exception): wrong method configuration.  `new'
-	  should have been a singleton method.
-
-Mon Oct  6 18:55:38 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/kconv/kconv.c (kconv_guess): code to guess character code
-	  from string.
-
-Mon Oct  6 18:38:17 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* pack.c: now encode/decode base64 by `m' template.
-
-Fri Oct  3 10:51:10 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* MANIFEST: needed to include lex.c in the distribution.
-
-	* eval.c (ruby_options): f_require() called too early.
-
-	* eval.c (rb_provide): module extensions should always be `.o'.
-
-Thu Oct  2 11:38:31 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha8 released.
-
-	* ext/marshal/marshal.c (r_object): remove temporal regist for
- 	  structs. (caused problem if structs form cycles.)
-
-	* parse.y (match_gen): static binding for match(=~) calls
-	  with regexp literals.
-
-Wed Oct  1 15:26:55 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c: protect retval in struct tag from GC for C_ALLOCA.
-
-	* eval.c: no more pointer value from setjmp/longjmp.
-
-Wed Oct  1 14:01:49 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/marshal/marshal.c (w_byte): argument must be char.
-
-Wed Oct  1 10:30:22 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (mod_const_at): global constants now belongs to the
-	  class Object.
-
-	* object.c (Init_Object): new global constant NIL.
-
-	* ext/marshal/marshal.c (marshal_dump): try to set binmode.
-
-	* ext/marshal/marshal.c (r_object): forgot to re-regist structs in 
-	  the object table.
-
-	* eval.c (ruby_options): call Init_ext() before any require()
- 	  calls by `-r'.
-
-Fri Sep 30 14:29:22 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/marshal/marshal.c (w_object): marshal dumped core.
-
-Tue Sep 30 10:27:39 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sample/test.rb: bignum test suits added.
-
-	* eval.c (rb_eval): new pseudo variable `true' and `false'.
-
-	* parse.y: new keywords `true' and `false' added.
-
-Mon Sep 29 13:37:58 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (forbid_setid): forbid some options in suid mode.
-
-	* ruby.h (NUM2DBL): new macro to convert into doubles.
-
-Mon Sep 27 09:53:48 1997  EGUCHI Osamu  <eguchi@shizuokanet.or.jp>
-
-	* bignum.c: modified for speeding.
-
-Fri Sep 26 18:27:59 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* sample/from.rb: some extensions.
-
-Mon Sep 29 13:15:56 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (lhs): no more syntax error on `obj.CONSTANT = value'.
-
-Fri Sep 26 14:41:46 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (ruby_run): deferred calling Init_ext() just before eval_node.
-
-Fri Sep 26 13:27:24 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* io.c (io_isatty): forgot to return TRUE value.
-
-Fri Sep 25 11:10:58 1997  EGUCHI Osamu  <eguchi@shizuokanet.or.jp>
-
-	* eval.c: use _setjmp/_longjmp instead of setjmp/longjmp on some
-	  platforms.
-
-Wed Sep 24 17:43:13 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* string.c (Init_String): String#taint and String#taint? added.
-
-	* class.c (mod_ancestors): ancestors include the class itself.
-
-Wed Sep 24 00:57:00 1997  Katsuyuki Okabe  <HGC02147@niftyserve.or.jp>
-
-	* X68000 patch.
-
-Tue Sep 23 20:42:30 1997  EGUCHI Osamu  <eguchi@shizuokanet.or.jp>
-
-	* parse.y (node_newnode): SEGV on null node setup.
-
-Mon Sep 22 11:22:46 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (ruby_prog_init): wrong safe condition check.
-
-Sun Sep 21 14:46:02 1997  MAEDA shugo  <shugo@po.aianet.ne.jp>
-
-	* error.c (exc_inspect): garbage added to classpath.
-
-Fri Sep 19 11:49:23 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (newtok): forgot to adjust buffer size when shrinking
-	  the token buffer.
-
-	* enum.c (enum_find): rb_eval_cmd() does not return value.
-
-	* io.c (pipe_open): close fds on pipe exec. fcntl(fd, F_SETFD, 1)
-	  no longer used.
-
-Tue Sep 16 17:54:25 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* file.c (f_test): problem if wrong command specified.
-
-	* ruby.c (ruby_prog_init): close stdaux and stdprn for MSDOS.
-
-	* ruby.c (ruby_prog_init): should not add path from environment
-	  variable, if ruby is running under seuid.
-
-	* process.c (init_ids): check suid check for setuid/seteuid etc.
-
-Mon Sep 15 00:42:04 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* regex.c (re_compile_pattern): \w{3} and \W{3} did not work.
-
-Thu Sep 11 10:31:48 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha7 released.
-
-	* ext/socket/socket.c (sock_new): no setbuf() for NT.
-
-	* io.c (rb_fopen,rb_fdopen): set close-on-exec for every fd.
-
-Wed Sep 10 15:55:31 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ext/marshal/marshal.c (r_bytes0): extra big length check.
-
-Tue Sep  9 16:27:14 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (pipe_fptr_atexit): clean up popen()'ed fptr.
-
-	* error.c (set_syserr): some system has error code that is bigger
-	  than sys_nerr. grrr.
-
-Mon Sep  8 18:33:33 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* io.c (io_s_new): dereferenced nil for optional mode.
-
-Fri Sep  5 10:26:03 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (class_instance_methods): do not include methods which
-	  are changed to private in subclasses.
-
-Thu Sep  4 12:38:53 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* variable.c (f_global_variables): list name of the global
-	  variables.
-
-	* object.c (obj_id): returns unique integer.
-
-Wed Sep  3 14:05:16 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha6 released.
-
-	* eval.c (mod_s_constants): context sensitive constant list.
-
-	* variable.c (mod_constants): no more `all' option.
-
-	* variable.c (mod_const_of): the values for autoload classes are
-	  their name strings.
-
-	* class.c (class_instance_methods): no special treatment for
-	  singleton classes.
-
-	* object.c (obj_singleton_methods): returns list of singleton
-	  method names.
-
-	* parse.y (yylex): no here document after `class' keyword.
-
-	* eval.c (f_load): expand path if fname begins with `~'.
-
-Tue Sep  2 13:19:48 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (ins_methods_i): do not list undef'ed methods.
-
-Mon Sep  1 13:42:48 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha5 released.
-
-	* object.c (mod_attr_reader): create methods to define attribute
- 	  reader/write/accessor.
-
-	* class.c (rb_define_attr): always defines accessors.
-
-	* eval.c (rb_call): alias occurred in the module body caused SEGV.
-
-	* parse.y: did not generate here document strings properly.
-
-Mon Sep  1 11:43:57 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-	
-	* parse.y (yylex): heredoc dropped an extra character.
-
-Fri Aug 29 11:10:21 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* class.c (class_instance_methods): same method names should not
- 	  appear more than once.
-
-	* parse.y (yylex): spaces can follow =begin/=end.
-
-	* variable.c (find_class_path): look for class_tbl also for
-	  unnamed fundamental classes, such as Object, String, etc.
-
-	* variable.c (rb_name_class): can't name class before String class
- 	  is initialized.
-
-	* inits.c (rb_call_inits): unrecognized dependency from GC to
-	  Array.
-
-	* variable.c (find_class_path): could not find class if Object's
- 	  iv_tbl is NULL.
-
-Thu Aug 28 13:12:05 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha4 released.
-
-	* variable.c (mod_constants): wrong condition for singleton
-	  class. 
-
-	* parse.y (yylex): revised `=begin' skip code.
-
-	* parse.y (here_document): forgot to free(eos).
-
-	* parse.y (yylex): spaces after `<<' prohibited for here
- 	  documents to avoid confusing with operator `<<'.
-
-	* eval.c (is_defined): separated from rb_eval().
-
-Wed Aug 27 11:32:42 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha3 released.
-
-	* variable.c (mod_name): returns name of the class/module.
-
-	* parse.y (here_document): finally here document available now.
-
-	* variable.c (fc_i): some classes/modules does not have iv_tbl.
-
-	* variable.c (find_class_path): avoid infinite loop.
-
-Tue Aug 26 13:43:47 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (rb_eval): undef'ing non-existing method will raise
-	  NameError exception.
-
-	* object.c (class_s_new): needed to create metaclass too.
-
-	* eval.c (error_print): no class name print for anonymous class.
-
-	* eval.c (rb_longjmp): proper exception raised if raise() called
- 	  without arguments, with $! or $@ set.
-
-	* object.c (Init_Object): superclass()'s method argument setting
- 	  was wrong again.
-
-	* class.c (mod_ancestors): list superclasses and included modules 
-	  in priority order.
-
-Mon Aug 25 11:53:11 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha2 released.
-
-	* sample/ruby-mode.el (ruby-parse-region): auto-indent now
- 	  supports "\\" in the strings.
-
-	* struct.c (struct_getmember): new API to get member value from C
-	  language side.
-
-Sat Aug 23 21:39:05 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* parse.y (assignable): remove unnecessary local variable
-	  initialize by nil.
-
-Fri Aug 22 14:26:40 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (error_print): modified exception print format.
-
-Thu Aug 21 16:10:58 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* sample/ruby-mode.el (ruby-calculate-indent): wrong indent level
-	  calculated with keyword operators.
-
-Thu Aug 21 11:36:58 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* parse.y (arg): ary[0] += 1 cause SEGV
-
-Wed Aug 20 17:28:50 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* ruby.c (ruby_process_options): require() all modules after
- 	  processing all options
-
-	* process.c (rb_proc_exec): more security checks added.
-
-	* process.c (rb_proc_exec): insecure path on exec.
-
-	* hash.c (f_getenv): PATH modification security check.
-
-Tue Aug 19 00:15:38 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha1 released.
-
-	* eval.c (mod_eval): work as normal eval() if second binding
- 	  argument given.
-
-	* eval.c (rb_call): did not raise ArgumentError if too many
- 	  arguments more than optional arguments (without rest arg).
-
-	* eval.c (rb_eval): did not work well for op_asgn2 (attribute
-	  self assignment).
-
-	* eval.c (Init_Thread): returns main thread.
-
-Mon Aug 18 09:25:56 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* object.c (inspect_i): did not display T_DATA instance variables.
-
-	* parse.y: provides more accurate line number information.
-
-	* eval.c (thread_value): include value's backtrace information in
-	  the variable `$@'. 
-
-	* eval.c (f_abort): print backtrace and exit.
-
-Sat Aug 16 00:17:44 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (class_new_instance): do not make instance from virtual
-	  classes. 
-
-	* object.c (class_s_new): do not make subclass of singleton class.
-
-Fri Aug 15 15:49:46 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* eval.c (call_trace_func): block context switch in the trace
-          function.
-
-	* eval.c (rb_eval): clear method cache at class extension.
-
-	* object.c (obj_type): returns object's class even if it defines
-	  singleton methods.
-
-Fri Aug 15 19:40:43 1997  WATANABE Hirofumi  <watanabe@ase.ptg.sony.co.jp>
-
-	* ext/socket/socket.c (Init_socket): small typo caused SEGV.
-
-Wed Aug 13 17:51:46 1997  Yukihiro Matsumoto  <matz@netlab.co.jp>
-
-	* version 1.1 alpha0 released.
-
diff --git a/GPL b/GPL
new file mode 100644
index 0000000000..d159169d10
--- /dev/null
+++ b/GPL
@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    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 of the License, 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.
+
+    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.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
diff --git a/KNOWNBUGS.rb b/KNOWNBUGS.rb
new file mode 100644
index 0000000000..35a8e75876
--- /dev/null
+++ b/KNOWNBUGS.rb
@@ -0,0 +1,7 @@
+#
+# 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
new file mode 100644
index 0000000000..2777aa2c14
--- /dev/null
+++ b/LEGAL
@@ -0,0 +1,1300 @@
+# -*- 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.
+
+[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-ref:@MIT+License].
+
+[coroutine]
+
+  Unless otherwise specified, these files are licensed under the
+  {MIT License}[rdoc-ref:@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-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]
+
+  As long as you distribute these files with the file configure, they
+  are covered under the Ruby's license.
+
+  >>>
+    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 3 of the License, 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.
+
+    You should have received a copy of the GNU General Public License
+    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.  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-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 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/>.
+
+    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.
+
+[missing/dtoa.c]
+
+  This file is under these licenses.
+
+  >>>
+    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
+    is included in all copies of any software which is or includes a copy
+    or modification of this software and in all copies of the supporting
+    documentation for such software.
+
+    THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+    WARRANTY.  IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY
+    REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+    OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+
+  >>>
+    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
+
+    You may distribute under the terms of either the GNU General Public
+    License or the Artistic License, as specified in the perl README file.
+
+[missing/mt19937.c]
+
+  This file is under the new-style BSD license.
+
+  >>>
+    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)
+    or init_by_array(init_key, key_length).
+
+    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.
+
+    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.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT OWNER 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.
+
+
+    Any feedback is very welcome.
+    http://www.math.keio.ac.jp/matumoto/emt.html
+    email: matumoto@math.keio.ac.jp
+
+  The Wayback Machine url: http://web.archive.org/web/19990429082237/http://www.math.keio.ac.jp/matumoto/emt.html
+
+[missing/procstat_vm.c]
+
+  This file is under the new-style BSD license.
+
+  >>>
+    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
+    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.
+
+    $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-ref:@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]
+
+  This file is under the {old-style BSD license}[rdoc-ref:@Old-style+BSD+license].
+
+  >>>
+    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.
+
+[missing/setproctitle.c]
+
+  This file is under the {old-style BSD license}[rdoc-ref:@Old-style+BSD+license].
+
+  >>>
+    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]
+
+  These files are under an ISC-style license.
+
+  >>>
+    Copyright (c) 1998, 2015:: Todd C. Miller <Todd.Miller@courtesan.com>
+
+    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.
+
+    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.
+
+[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.
+
+[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.
+
+    This software is provided 'as-is', without any express or implied
+    warranty.  In no event will the authors be held liable for any damages
+    arising from the use of this software.
+
+    Permission is granted to anyone to use this software for any purpose,
+    including commercial applications, and to alter it and redistribute it
+    freely, subject to the following restrictions:
+
+    1. The origin of this software must not be misrepresented; you must not
+       claim that you wrote the original software. If you use this software
+       in a product, an acknowledgment in the product documentation would be
+       appreciated but is not required.
+    2. Altered source versions must be plainly marked as such, and must not be
+       misrepresented as being the original software.
+    3. This notice may not be removed or altered from any source distribution.
+
+    L. Peter Deutsch
+    ghost@aladdin.com
+
+[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
+              (Arranged for libc by Todd C. Miller)
+    DATE::    1 March 1996
+
+    Copyright (c):: Katholieke Universiteit Leuven
+    1996, All Rights Reserved
+
+[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.
+
+    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 copyright holder nor the names of contributors
+       may be used to endorse or promote products derived from this software
+       without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``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(S) OR CONTRIBUTOR(S) 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.
+
+[ext/json/vendor/fpconv.c]
+
+  This file is under the {Boost Software License}[rdoc-ref:@Boost+Software+License+1.0].
+
+[ext/json/vendor/jeaiii-ltoa.h]
+
+  >>>
+    Copyright (c) 2024,2025 Enrico Thierbach - https://github.com/radiospiel
+    Copyright (c) 2022 James Edward Anhalt III - https://github.com/jeaiii/itoa
+
+    {MIT License}[rdoc-ref:@MIT+License]
+
+[ext/json/vendor/ryu.h]
+  This file is adapted from the Ryu algorithm by Ulf Adams https://github.com/ulfjack/ryu.
+  It is dual-licensed under {Apache License 2.0}[rdoc-ref:@Apache+License+2.0] OR
+  {Boost Software License 1.0}[rdoc-ref:@Boost+Software+License+1.0].
+
+[ext/psych]
+[test/psych]
+
+  The files under these directories are under the following license.
+
+  >>>
+    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:
+
+    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.
+    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. Neither the name of the project 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 PROJECT 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 PROJECT 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.
+
+[ext/win32ole/win32ole.c]
+
+  You can apply the Artistic License to this file. (or GPL,
+  alternatively)
+
+  >>>
+    (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
+    <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-ref:@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-ref:@MIT+License]
+
+[lib/bundler/vendor/thor]
+
+  Thor is under the following license.
+
+  >>>
+    Copyright (c) 2008 Yehuda Katz, Eric Hodel, et al.
+
+    {MIT License}[rdoc-ref:@MIT+License]
+
+[lib/rubygems/vendor/molinillo]
+
+  molinillo is under the following license.
+
+  >>>
+    Copyright (c) 2014 Samuel E. Giddins segiddins@segiddins.me
+
+    {MIT License}[rdoc-ref:@MIT+License]
+
+[lib/bundler/vendor/pub_grub]
+
+  pub_grub is under the following license.
+
+  >>>
+    Copyright (c) 2018 John Hawthorn
+
+    {MIT License}[rdoc-ref:@MIT+License]
+
+[lib/bundler/vendor/connection_pool]
+
+  connection_pool is under the following license.
+
+  >>>
+    Copyright (c) 2011 Mike Perham
+
+    {MIT License}[rdoc-ref:@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-ref:@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-ref:@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-ref:@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.
+
+== Boost Software License 1.0
+
+>>>
+      Boost Software License - Version 1.0 - August 17th, 2003
+
+      Permission is hereby granted, free of charge, to any person or organization
+      obtaining a copy of the software and accompanying documentation covered by
+      this license (the "Software") to use, reproduce, display, distribute,
+      execute, and transmit the Software, and to prepare derivative works of the
+      Software, and to permit third-parties to whom the Software is furnished to
+      do so, all subject to the following:
+
+      The copyright notices in the Software and this entire statement, including
+      the above license grant, this restriction and the following disclaimer,
+      must be included in all copies of the Software, in whole or in part, and
+      all derivative works of the Software, unless such copies or derivative
+      works are solely in the form of machine-executable object code generated by
+      a source language processor.
+
+      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, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+      SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+      FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+      ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+      DEALINGS IN THE SOFTWARE.
+
+== Apache License 2.0
+
+>>>
+      Apache License
+      Version 2.0, January 2004
+      http://www.apache.org/licenses/
+
+      TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+      1. Definitions.
+
+         "License" shall mean the terms and conditions for use, reproduction,
+         and distribution as defined by Sections 1 through 9 of this document.
+
+         "Licensor" shall mean the copyright owner or entity authorized by
+         the copyright owner that is granting the License.
+
+         "Legal Entity" shall mean the union of the acting entity and all
+         other entities that control, are controlled by, or are under common
+         control with that entity. For the purposes of this definition,
+         "control" means (i) the power, direct or indirect, to cause the
+         direction or management of such entity, whether by contract or
+         otherwise, or (ii) ownership of fifty percent (50%) or more of the
+         outstanding shares, or (iii) beneficial ownership of such entity.
+
+         "You" (or "Your") shall mean an individual or Legal Entity
+         exercising permissions granted by this License.
+
+         "Source" form shall mean the preferred form for making modifications,
+         including but not limited to software source code, documentation
+         source, and configuration files.
+
+         "Object" form shall mean any form resulting from mechanical
+         transformation or translation of a Source form, including but
+         not limited to compiled object code, generated documentation,
+         and conversions to other media types.
+
+         "Work" shall mean the work of authorship, whether in Source or
+         Object form, made available under the License, as indicated by a
+         copyright notice that is included in or attached to the work
+         (an example is provided in the Appendix below).
+
+         "Derivative Works" shall mean any work, whether in Source or Object
+         form, that is based on (or derived from) the Work and for which the
+         editorial revisions, annotations, elaborations, or other modifications
+         represent, as a whole, an original work of authorship. For the purposes
+         of this License, Derivative Works shall not include works that remain
+         separable from, or merely link (or bind by name) to the interfaces of,
+         the Work and Derivative Works thereof.
+
+         "Contribution" shall mean any work of authorship, including
+         the original version of the Work and any modifications or additions
+         to that Work or Derivative Works thereof, that is intentionally
+         submitted to Licensor for inclusion in the Work by the copyright owner
+         or by an individual or Legal Entity authorized to submit on behalf of
+         the copyright owner. For the purposes of this definition, "submitted"
+         means any form of electronic, verbal, or written communication sent
+         to the Licensor or its representatives, including but not limited to
+         communication on electronic mailing lists, source code control systems,
+         and issue tracking systems that are managed by, or on behalf of, the
+         Licensor for the purpose of discussing and improving the Work, but
+         excluding communication that is conspicuously marked or otherwise
+         designated in writing by the copyright owner as "Not a Contribution."
+
+         "Contributor" shall mean Licensor and any individual or Legal Entity
+         on behalf of whom a Contribution has been received by Licensor and
+         subsequently incorporated within the Work.
+
+      2. Grant of Copyright License. Subject to the terms and conditions of
+         this License, each Contributor hereby grants to You a perpetual,
+         worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+         copyright license to reproduce, prepare Derivative Works of,
+         publicly display, publicly perform, sublicense, and distribute the
+         Work and such Derivative Works in Source or Object form.
+
+      3. Grant of Patent License. Subject to the terms and conditions of
+         this License, each Contributor hereby grants to You a perpetual,
+         worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+         (except as stated in this section) patent license to make, have made,
+         use, offer to sell, sell, import, and otherwise transfer the Work,
+         where such license applies only to those patent claims licensable
+         by such Contributor that are necessarily infringed by their
+         Contribution(s) alone or by combination of their Contribution(s)
+         with the Work to which such Contribution(s) was submitted. If You
+         institute patent litigation against any entity (including a
+         cross-claim or counterclaim in a lawsuit) alleging that the Work
+         or a Contribution incorporated within the Work constitutes direct
+         or contributory patent infringement, then any patent licenses
+         granted to You under this License for that Work shall terminate
+         as of the date such litigation is filed.
+
+      4. Redistribution. You may reproduce and distribute copies of the
+         Work or Derivative Works thereof in any medium, with or without
+         modifications, and in Source or Object form, provided that You
+         meet the following conditions:
+
+         a.  You must give any other recipients of the Work or
+             Derivative Works a copy of this License; and
+
+         b.  You must cause any modified files to carry prominent notices
+             stating that You changed the files; and
+
+         c.  You must retain, in the Source form of any Derivative Works
+             that You distribute, all copyright, patent, trademark, and
+             attribution notices from the Source form of the Work,
+             excluding those notices that do not pertain to any part of
+             the Derivative Works; and
+
+         d.  If the Work includes a "NOTICE" text file as part of its
+             distribution, then any Derivative Works that You distribute must
+             include a readable copy of the attribution notices contained
+             within such NOTICE file, excluding those notices that do not
+             pertain to any part of the Derivative Works, in at least one
+             of the following places: within a NOTICE text file distributed
+             as part of the Derivative Works; within the Source form or
+             documentation, if provided along with the Derivative Works; or,
+             within a display generated by the Derivative Works, if and
+             wherever such third-party notices normally appear. The contents
+             of the NOTICE file are for informational purposes only and
+             do not modify the License. You may add Your own attribution
+             notices within Derivative Works that You distribute, alongside
+             or as an addendum to the NOTICE text from the Work, provided
+             that such additional attribution notices cannot be construed
+             as modifying the License.
+
+         You may add Your own copyright statement to Your modifications and
+         may provide additional or different license terms and conditions
+         for use, reproduction, or distribution of Your modifications, or
+         for any such Derivative Works as a whole, provided Your use,
+         reproduction, and distribution of the Work otherwise complies with
+         the conditions stated in this License.
+
+      5. Submission of Contributions. Unless You explicitly state otherwise,
+         any Contribution intentionally submitted for inclusion in the Work
+         by You to the Licensor shall be under the terms and conditions of
+         this License, without any additional terms or conditions.
+         Notwithstanding the above, nothing herein shall supersede or modify
+         the terms of any separate license agreement you may have executed
+         with Licensor regarding such Contributions.
+
+      6. Trademarks. This License does not grant permission to use the trade
+         names, trademarks, service marks, or product names of the Licensor,
+         except as required for reasonable and customary use in describing the
+         origin of the Work and reproducing the content of the NOTICE file.
+
+      7. Disclaimer of Warranty. Unless required by applicable law or
+         agreed to in writing, Licensor provides the Work (and each
+         Contributor provides its Contributions) on an "AS IS" BASIS,
+         WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+         implied, including, without limitation, any warranties or conditions
+         of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+         PARTICULAR PURPOSE. You are solely responsible for determining the
+         appropriateness of using or redistributing the Work and assume any
+         risks associated with Your exercise of permissions under this License.
+
+      8. Limitation of Liability. In no event and under no legal theory,
+         whether in tort (including negligence), contract, or otherwise,
+         unless required by applicable law (such as deliberate and grossly
+         negligent acts) or agreed to in writing, shall any Contributor be
+         liable to You for damages, including any direct, indirect, special,
+         incidental, or consequential damages of any character arising as a
+         result of this License or out of the use or inability to use the
+         Work (including but not limited to damages for loss of goodwill,
+         work stoppage, computer failure or malfunction, or any and all
+         other commercial damages or losses), even if such Contributor
+         has been advised of the possibility of such damages.
+
+      9. Accepting Warranty or Additional Liability. While redistributing
+         the Work or Derivative Works thereof, You may choose to offer,
+         and charge a fee for, acceptance of support, warranty, indemnity,
+         or other liability obligations and/or rights consistent with this
+         License. However, in accepting such obligations, You may act only
+         on Your own behalf and on Your sole responsibility, not on behalf
+         of any other Contributor, and only if You agree to indemnify,
+         defend, and hold each Contributor harmless for any liability
+         incurred by, or claims asserted against, such Contributor by reason
+         of your accepting any such warranty or additional liability.
+
+      END OF TERMS AND CONDITIONS
+
+      APPENDIX: How to apply the Apache License to your work.
+
+      >>>
+         To apply the Apache License to your work, attach the following
+         boilerplate notice, with the fields enclosed by brackets "[]"
+         replaced with your own identifying information. (Don't include
+         the brackets!)  The text should be enclosed in the appropriate
+         comment syntax for the file format. We also recommend that a
+         file or class name and description of purpose be included on the
+         same "printed page" as the copyright notice for easier
+         identification within third-party archives.
+
+      Copyright [yyyy] [name of copyright owner]
+
+      Licensed under the Apache License, Version 2.0 (the "License");
+      you may not use this file except in compliance with the License.
+      You may obtain a copy of the License at
+
+          http://www.apache.org/licenses/LICENSE-2.0
+
+      Unless required by applicable law or agreed to in writing, software
+      distributed under the License is distributed on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+      See the License for the specific language governing permissions and
+      limitations under the License.
diff --git a/MANIFEST b/MANIFEST
deleted file mode 100644
index 558fc59c59..0000000000
--- a/MANIFEST
+++ /dev/null
@@ -1,249 +0,0 @@
-COPYING
-COPYING.LIB
-ChangeLog
-MANIFEST
-Makefile.in
-README
-README.jp
-README.EXT
-README.EXT.jp
-ToDo
-array.c
-bignum.c
-class.c
-compar.c
-configure
-configure.in
-config.guess
-config.sub
-defines.h
-dir.c
-dln.c
-dln.h
-dmyext.c
-enum.c
-env.h
-error.c
-eval.c
-file.c
-gc.c
-hash.c
-inits.c
-install-sh
-instruby.rb
-intern.h
-io.c
-keywords
-lex.c
-main.c
-marshal.c
-math.c
-mkconfig.rb
-node.h
-numeric.c
-object.c
-pack.c
-parse.c
-parse.y
-prec.c
-process.c
-random.c
-range.c
-re.c
-re.h
-regex.c
-regex.h
-ruby.1
-ruby.c
-ruby.h
-rubyio.h
-rubysig.h
-rubytest.rb
-signal.c
-sprintf.c
-st.c
-st.h
-string.c
-struct.c
-time.c
-util.h
-util.c
-variable.c
-version.c
-version.h
-djgpp/README.djgpp
-djgpp/config.hin
-djgpp/config.sed
-djgpp/configure.bat
-djgpp/mkver.sed
-cygwin/GNUmakefile.in
-ext/Setup
-ext/Setup.dj
-ext/Setup.emx
-ext/Setup.x68
-ext/aix_mksym.rb
-ext/configsub.rb
-ext/extmk.rb.in
-lib/English.rb
-lib/Env.rb
-lib/README
-lib/base64.rb
-lib/cgi.rb
-lib/cgi/session.rb
-lib/cgi-lib.rb
-lib/complex.rb
-lib/date.rb
-lib/date2.rb
-lib/debug.rb
-lib/delegate.rb
-lib/e2mmap.rb
-lib/eregex.rb
-lib/find.rb
-lib/final.rb
-lib/finalize.rb
-lib/ftplib.rb
-lib/ftools.rb
-lib/getopts.rb
-lib/getoptlong.rb
-lib/importenv.rb
-lib/irb/completion.rb
-lib/irb/frame.rb
-lib/irb/input-method.rb
-lib/irb/loader.rb
-lib/irb/main.rb
-lib/irb/multi-irb.rb
-lib/irb/ruby-lex.rb
-lib/irb/ruby-token.rb
-lib/irb/slex.rb
-lib/irb/version.rb
-lib/irb/workspace-binding-2.rb
-lib/irb/workspace-binding.rb
-lib/irb/xmp.rb
-lib/jcode.rb
-lib/mailread.rb
-lib/mathn.rb
-lib/matrix.rb
-lib/mkmf.rb
-lib/monitor.rb
-lib/mutex_m.rb
-lib/net/ftp.rb
-lib/net/http.rb
-lib/net/pop.rb
-lib/net/protocol.rb
-lib/net/smtp.rb
-lib/net/telnet.rb
-lib/observer.rb
-lib/open3.rb
-lib/ostruct.rb
-lib/parsearg.rb
-lib/parsedate.rb
-lib/ping.rb
-lib/profile.rb
-lib/pstore.rb
-lib/rational.rb
-lib/readbytes.rb
-lib/shellwords.rb
-lib/singleton.rb
-lib/sync.rb
-lib/telnet.rb
-lib/tempfile.rb
-lib/thread.rb
-lib/thwait.rb
-lib/timeout.rb
-lib/tracer.rb
-lib/weakref.rb
-misc/README
-misc/inf-ruby.el
-misc/ruby-mode.el
-misc/rubydb2x.el
-misc/rubydb3x.el
-missing/alloca.c
-missing/crypt.c
-missing/dir.h
-missing/dup2.c
-missing/file.h
-missing/finite.c
-missing/flock.c
-missing/isinf.c
-missing/isnan.c
-missing/memcmp.c
-missing/memmove.c
-missing/mkdir.c
-missing/os2.c
-missing/strcasecmp.c
-missing/strncasecmp.c
-missing/strchr.c
-missing/strdup.c
-missing/strerror.c
-missing/strftime.c
-missing/strstr.c
-missing/strtod.c
-missing/strtol.c
-missing/strtoul.c
-missing/vsnprintf.c
-missing/x68.c
-sample/README
-sample/biorhythm.rb
-sample/cal.rb
-sample/cbreak.rb
-sample/clnt.rb
-sample/dbmtest.rb
-sample/dir.rb
-sample/dualstack-fetch.rb
-sample/dualstack-httpd.rb
-sample/eval.rb
-sample/export.rb
-sample/exyacc.rb
-sample/fact.rb
-sample/fib.awk
-sample/fib.pl
-sample/fib.py
-sample/fib.rb
-sample/fib.scm
-sample/freq.rb
-sample/from.rb
-sample/fullpath.rb
-sample/getopts.test
-sample/goodfriday.rb
-sample/irb.rb
-sample/less.rb
-sample/list.rb
-sample/list2.rb
-sample/list3.rb
-sample/mine.rb
-sample/mkproto.rb
-sample/mpart.rb
-sample/mrshtest.rb
-sample/observ.rb
-sample/occur.pl
-sample/occur.rb
-sample/occur2.rb
-sample/philos.rb
-sample/pi.rb
-sample/rename.rb
-sample/rcs.awk
-sample/rcs.dat
-sample/rcs.rb
-sample/regx.rb
-sample/sieve.rb
-sample/svr.rb
-sample/test.rb
-sample/time.rb
-sample/trojan.rb
-sample/tsvr.rb
-sample/uumerge.rb
-win32/Makefile.sub
-win32/README.win32
-win32/config.h.in
-win32/config.status.in
-win32/configure.bat
-win32/mkexports.rb
-win32/resource.rb
-win32/setup.mak
-win32/win32.c
-win32/win32.h
-win32/winmain.c
-x68/fconvert.c
-x68/select.c
-x68/_dtos18.c
-x68/_round.c
diff --git a/Makefile.in b/Makefile.in
deleted file mode 100644
index 1d22174a12..0000000000
--- a/Makefile.in
+++ /dev/null
@@ -1,275 +0,0 @@
-SHELL = /bin/sh
-
-#### Start of system configuration section. ####
-
-srcdir = @srcdir@
-VPATH = $(srcdir):$(srcdir)/missing
-
-CC = @CC@
-YACC = @YACC@
-PURIFY =
-AUTOCONF = autoconf
-@SET_MAKE@
-
-prefix = @prefix@
-CFLAGS = @CFLAGS@
-CPPFLAGS = -I. -I$(srcdir) -I@includedir@
-LDFLAGS = @STATIC@ $(CFLAGS) @LDFLAGS@
-XLDFLAGS = @XLDFLAGS@
-EXTLIBS = 
-LIBS = @LIBS@ $(EXTLIBS)
-MISSING = @LIBOBJS@ @ALLOCA@
-LDSHARED = @LIBRUBY_LDSHARED@
-DLDFLAGS = @LIBRUBY_DLDFLAGS@
-SOLIBS = @SOLIBS@
-
-RUBY_INSTALL_NAME=@RUBY_INSTALL_NAME@
-EXEEXT = @EXEEXT@
-PROGRAM=$(RUBY_INSTALL_NAME)$(EXEEXT)
-
-#### 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@
-
-EXTOBJS	      = 
-
-MAINOBJ	      = main.@OBJEXT@
-
-OBJS	      = array.@OBJEXT@ \
-		bignum.@OBJEXT@ \
-		class.@OBJEXT@ \
-		compar.@OBJEXT@ \
-		dir.@OBJEXT@ \
-		dln.@OBJEXT@ \
-		enum.@OBJEXT@ \
-		error.@OBJEXT@ \
-		eval.@OBJEXT@ \
-		file.@OBJEXT@ \
-		gc.@OBJEXT@ \
-		hash.@OBJEXT@ \
-		inits.@OBJEXT@ \
-		io.@OBJEXT@ \
-		marshal.@OBJEXT@ \
-		math.@OBJEXT@ \
-		numeric.@OBJEXT@ \
-		object.@OBJEXT@ \
-		pack.@OBJEXT@ \
-		parse.@OBJEXT@ \
-		process.@OBJEXT@ \
-		prec.@OBJEXT@ \
-		random.@OBJEXT@ \
-		range.@OBJEXT@ \
-		re.@OBJEXT@ \
-		regex.@OBJEXT@ \
-		ruby.@OBJEXT@ \
-		signal.@OBJEXT@ \
-		sprintf.@OBJEXT@ \
-		st.@OBJEXT@ \
-		string.@OBJEXT@ \
-		struct.@OBJEXT@ \
-		time.@OBJEXT@ \
-		util.@OBJEXT@ \
-		variable.@OBJEXT@ \
-		version.@OBJEXT@ \
-		$(MISSING)
-
-all:		miniruby$(EXEEXT) @PREP@ rbconfig.rb $(LIBRUBY)
-		@@MINIRUBY@ -Xext extmk.rb @EXTSTATIC@
-
-miniruby$(EXEEXT):	config.status $(LIBRUBY_A) $(MAINOBJ) dmyext.@OBJEXT@
-		@rm -f $@
-		$(PURIFY) $(CC) $(LDFLAGS) $(MAINOBJ) dmyext.@OBJEXT@ $(LIBRUBY_A) $(LIBS) -o $@
-
-$(PROGRAM):     $(LIBRUBY) $(MAINOBJ) $(EXTOBJS) 
-		@rm -f $@
-		$(PURIFY) $(CC) $(LDFLAGS) $(XLDFLAGS) $(MAINOBJ) $(EXTOBJS) $(LIBRUBYARG) $(LIBS) -o $@
-
-$(LIBRUBY_A):	$(OBJS) dmyext.@OBJEXT@
-		@AR@ rcu $@ $(OBJS) dmyext.@OBJEXT@
-		@-@RANLIB@ $@ 2> /dev/null || true
-
-$(LIBRUBY_SO):	$(OBJS) dmyext.@OBJEXT@
-		$(LDSHARED) $(DLDFLAGS) $(OBJS) dmyext.@OBJEXT@ $(SOLIBS) -o $@
-		@-@MINIRUBY@ -e 'ARGV.each{|link| File.delete link if File.exist? link; \
-						  File.symlink "$(LIBRUBY_SO)", link}' \
-				$(LIBRUBY_ALIASES) || true
-
-install:	rbconfig.rb
-		@MINIRUBY@ $(srcdir)/instruby.rb $(DESTDIR)
-
-clean:;		@rm -f $(OBJS) $(LIBRUBY_A) $(LIBRUBY_SO) $(LIBRUBY_ALIASES) $(MAINOBJ) rbconfig.rb
-		@rm -f ext/extinit.c ext/extinit.@OBJEXT@ dmyext.@OBJEXT@
-		@-@MINIRUBY@ -Xext extmk.rb clean 2> /dev/null || true
-		@rm -f $(PROGRAM) miniruby$(EXEEXT)
-
-distclean:	clean
-		@rm -f Makefile ext/extmk.rb config.h
-		@rm -f ext/config.cache config.cache config.log config.status
-		@rm -f *~ core *.core gmon.out y.tab.c y.output ruby.imp
-
-realclean:	distclean
-		@rm -f parse.c
-		@rm -f lex.c
-
-test:		miniruby$(EXEEXT)
-		@./miniruby$(EXEEXT) $(srcdir)/rubytest.rb
-
-rbconfig.rb:	miniruby$(EXEEXT)
-		@@MINIRUBY@ $(srcdir)/mkconfig.rb rbconfig.rb
-
-fake.rb:	miniruby$(EXEEXT)
-		@echo ' \
-		class Object; \
-		  remove_const :RUBY_PLATFORM; \
-		  RUBY_PLATFORM = "@arch@"; \
-		  if defined? PLATFORM; \
-		    remove_const :PLATFORM; \
-		    PLATFORM = "@arch@"; \
-		  end; \
-		  CROSS_COMPILING = true; \
-		end \
-		' > $@
-
-config.status:	$(srcdir)/configure
-		$(SHELL) ./config.status --recheck
-
-$(srcdir)/configure: $(srcdir)/configure.in
-		cd $(srcdir) && $(AUTOCONF)
-
-.c.@OBJEXT@:
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $<
-
-lex.c: keywords
-	gperf -p -j1 -i 1 -g -o -t -N rb_reserved_word -k1,3,$$ $(srcdir)/keywords > lex.c
-
-parse.c: parse.y
-	$(YACC) $<
-	mv -f y.tab.c parse.c
-
-parse.@OBJEXT@: parse.c
-
-alloca.@OBJEXT@: $(srcdir)/missing/alloca.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/alloca.c
-
-crypt.@OBJEXT@: $(srcdir)/missing/crypt.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/crypt.c
-
-dup2.@OBJEXT@: $(srcdir)/missing/dup2.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/dup2.c
-
-finite.@OBJEXT@: $(srcdir)/missing/finite.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/finite.c
-
-flock.@OBJEXT@: $(srcdir)/missing/flock.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/flock.c
-
-isinf.@OBJEXT@: $(srcdir)/missing/isinf.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/isinf.c
-
-isnan.@OBJEXT@: $(srcdir)/missing/isnan.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/isnan.c
-
-fnmatch.@OBJEXT@: $(srcdir)/missing/fnmatch.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/fnmatch.c
-
-memcmp.@OBJEXT@: $(srcdir)/missing/memcmp.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/memcmp.c
-
-memmove.@OBJEXT@: $(srcdir)/missing/memmove.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/memmove.c
-
-mkdir.@OBJEXT@: $(srcdir)/missing/mkdir.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/mkdir.c
-
-vsnprintf.@OBJEXT@: $(srcdir)/missing/vsnprintf.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/vsnprintf.c
-
-strcasecmp.@OBJEXT@: $(srcdir)/missing/strcasecmp.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strcasecmp.c
-
-strncasecmp.@OBJEXT@: $(srcdir)/missing/strncasecmp.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strncasecmp.c
-
-strchr.@OBJEXT@: $(srcdir)/missing/strchr.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strchr.c
-
-strerror.@OBJEXT@: $(srcdir)/missing/strerror.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strerror.c
-
-strftime.@OBJEXT@: $(srcdir)/missing/strftime.c
-	$(CC) -I. $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strftime.c
-
-strstr.@OBJEXT@: $(srcdir)/missing/strstr.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strstr.c
-
-strtod.@OBJEXT@: $(srcdir)/missing/strtod.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strtod.c
-
-strtol.@OBJEXT@: $(srcdir)/missing/strtol.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strtol.c
-
-strtoul.@OBJEXT@: $(srcdir)/missing/strtoul.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/strtoul.c
-
-x68.@OBJEXT@: $(srcdir)/missing/x68.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/x68.c
-
-os2.@OBJEXT@: $(srcdir)/missing/os2.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/os2.c
-
-dl_os2.@OBJEXT@: $(srcdir)/missing/dl_os2.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/missing/dl_os2.c
-
-win32.@OBJEXT@: $(srcdir)/win32/win32.c
-	$(CC) $(CFLAGS) $(CPPFLAGS) -c $(srcdir)/win32/win32.c
-
-# Prevent GNU make v3 from overflowing arg limit on SysV.
-.NOEXPORT:
-###
-parse.@OBJEXT@: parse.y ruby.h config.h defines.h intern.h env.h node.h st.h regex.h util.h lex.c
-###
-array.@OBJEXT@: array.c ruby.h config.h defines.h intern.h
-bignum.@OBJEXT@: bignum.c ruby.h config.h defines.h intern.h
-class.@OBJEXT@: class.c ruby.h config.h defines.h intern.h node.h st.h
-compar.@OBJEXT@: compar.c ruby.h config.h defines.h intern.h
-dir.@OBJEXT@: dir.c ruby.h config.h defines.h intern.h
-dln.@OBJEXT@: dln.c config.h defines.h dln.h
-dmyext.@OBJEXT@: dmyext.c
-enum.@OBJEXT@: enum.c ruby.h config.h defines.h intern.h
-error.@OBJEXT@: error.c ruby.h config.h defines.h intern.h env.h
-eval.@OBJEXT@: eval.c ruby.h config.h defines.h intern.h node.h env.h rubysig.h st.h dln.h
-file.@OBJEXT@: file.c ruby.h config.h defines.h intern.h rubyio.h rubysig.h
-gc.@OBJEXT@: gc.c ruby.h config.h defines.h intern.h rubysig.h st.h node.h env.h re.h regex.h
-hash.@OBJEXT@: hash.c ruby.h config.h defines.h intern.h st.h rubysig.h util.h
-inits.@OBJEXT@: inits.c ruby.h config.h defines.h intern.h
-io.@OBJEXT@: io.c ruby.h config.h defines.h intern.h rubyio.h rubysig.h env.h
-main.@OBJEXT@: main.c ruby.h config.h defines.h intern.h
-marshal.@OBJEXT@: marshal.c ruby.h config.h defines.h intern.h rubyio.h st.h
-prec.@OBJEXT@: prec.c ruby.h config.h defines.h intern.h
-math.@OBJEXT@: math.c ruby.h config.h defines.h intern.h
-numeric.@OBJEXT@: numeric.c ruby.h config.h defines.h intern.h
-object.@OBJEXT@: object.c ruby.h config.h defines.h intern.h st.h
-pack.@OBJEXT@: pack.c ruby.h config.h defines.h intern.h
-process.@OBJEXT@: process.c ruby.h config.h defines.h intern.h rubysig.h st.h
-random.@OBJEXT@: random.c ruby.h config.h defines.h intern.h
-range.@OBJEXT@: range.c ruby.h config.h defines.h intern.h
-re.@OBJEXT@: re.c ruby.h config.h defines.h intern.h re.h regex.h
-regex.@OBJEXT@: regex.c config.h regex.h util.h
-ruby.@OBJEXT@: ruby.c ruby.h config.h defines.h intern.h dln.h util.h
-signal.@OBJEXT@: signal.c ruby.h config.h defines.h intern.h rubysig.h
-sprintf.@OBJEXT@: sprintf.c ruby.h config.h defines.h intern.h
-st.@OBJEXT@: st.c config.h st.h
-string.@OBJEXT@: string.c ruby.h config.h defines.h intern.h re.h regex.h
-struct.@OBJEXT@: struct.c ruby.h config.h defines.h intern.h
-time.@OBJEXT@: time.c ruby.h config.h defines.h intern.h
-util.@OBJEXT@: util.c ruby.h config.h defines.h intern.h util.h
-variable.@OBJEXT@: variable.c ruby.h config.h defines.h intern.h env.h node.h st.h
-version.@OBJEXT@: version.c ruby.h config.h defines.h intern.h version.h
diff --git a/NEWS.md b/NEWS.md
new file mode 100644
index 0000000000..9ff290ad75
--- /dev/null
+++ b/NEWS.md
@@ -0,0 +1,269 @@
+# NEWS for Ruby 4.1.0
+
+This document is a list of user-visible feature changes
+since the **4.0.0** release, except for bug fixes.
+
+Note that each entry is kept to a minimum, see links for details.
+
+## Language changes
+
+* `Module#clone` and `Module#dup` no longer rewrite the lexical scope of
+  copied methods. Constants and class variables resolve through the
+  original class, consistent with inheritance and mixins.
+  [[Feature #21981]]
+
+## Core classes updates
+
+Note: We're only listing outstanding class updates.
+
+* Array
+
+    * `Array#pack` accepts a new format `R` and `r` for unpacking unsigned
+      and signed LEB128 encoded integers. [[Feature #21785]]
+    * `Array#pack` accepts a new format `^` that returns the current offset.
+      Useful when combined with variable width formats like LEB128. [[Feature #21796]]
+
+* ENV
+
+    * `ENV.fetch_values` is added. It returns an array of values for the
+      given names, raising `KeyError` for missing names unless a block is
+      given. [[Feature #21781]]
+
+* Kernel
+
+    * `Kernel#autoload_relative` and `Module#autoload_relative` are added.
+      These methods work like `autoload`, but resolve the file path relative
+      to the file where the method is called, similar to `require_relative`.
+      This makes it easier to autoload constants from files in the same
+      directory without hardcoding absolute paths or manipulating `$LOAD_PATH`.
+      [[Feature #15330]]
+
+* MatchData
+
+    * `MatchData#integer_at` is added.  It converts the matched substring to
+      integer and return the result.  [[Feature #21932]]
+
+* Regexp
+
+    * All instances of `Regexp` are now frozen, not just literals.
+      Subclasses of `Regexp` are not frozen for compatibility.
+      [[Feature #8948]]
+
+* Set
+
+    * A deprecated behavior, `Set#to_set`, `Range#to_set`, and
+      `Enumerable#to_set` accepting arguments, was removed.  [[Feature #21390]]
+
+## Stdlib updates
+
+### The following bundled gems are added.
+
+
+We only list stdlib changes that are notable feature changes.
+
+Other changes are listed in the following sections. We also listed release
+history from the previous bundled version that is Ruby 3.4.0 if it has GitHub
+releases.
+
+### The following bundled gems are promoted from default gems.
+
+* tsort 0.2.0
+* win32-registry 0.1.2
+
+### The following default gem is added.
+
+### The following default gems are updated.
+
+* RubyGems 4.1.0.dev
+  * 4.0.3 to [v4.0.4][RubyGems-v4.0.4], [v4.0.5][RubyGems-v4.0.5], [v4.0.6][RubyGems-v4.0.6], [v4.0.7][RubyGems-v4.0.7], [v4.0.8][RubyGems-v4.0.8], [v4.0.9][RubyGems-v4.0.9], [v4.0.10][RubyGems-v4.0.10], [v4.0.11][RubyGems-v4.0.11], [v4.0.12][RubyGems-v4.0.12], [v4.0.13][RubyGems-v4.0.13]
+* bundler 4.1.0.dev
+  * 4.0.3 to [v4.0.4][bundler-v4.0.4], [v4.0.5][bundler-v4.0.5], [v4.0.6][bundler-v4.0.6], [v4.0.7][bundler-v4.0.7], [v4.0.8][bundler-v4.0.8], [v4.0.9][bundler-v4.0.9], [v4.0.10][bundler-v4.0.10], [v4.0.11][bundler-v4.0.11], [v4.0.12][bundler-v4.0.12], [v4.0.13][bundler-v4.0.13]
+* erb 6.0.4
+  * 6.0.1 to [v6.0.1.1][erb-v6.0.1.1], [v6.0.2][erb-v6.0.2], [v6.0.3][erb-v6.0.3], [v6.0.4][erb-v6.0.4]
+* ipaddr 1.2.9
+  * 1.2.8 to [v1.2.9][ipaddr-v1.2.9]
+* json 2.19.8
+  * 2.18.0 to [v2.18.1][json-v2.18.1], [v2.19.0][json-v2.19.0], [v2.19.1][json-v2.19.1], [v2.19.2][json-v2.19.2], [v2.19.3][json-v2.19.3], [v2.19.4][json-v2.19.4], [v2.19.5][json-v2.19.5], [v2.19.6][json-v2.19.6], [v2.19.7][json-v2.19.7]
+* openssl 4.0.2
+  * 4.0.0 to [v4.0.1][openssl-v4.0.1], [v4.0.2][openssl-v4.0.2]
+* prism 1.9.0
+  * 1.7.0 to [v1.8.0][prism-v1.8.0], [v1.8.1][prism-v1.8.1], [v1.9.0][prism-v1.9.0]
+* psych 5.4.0
+* resolv 0.7.1
+  * 0.7.0 to [v0.7.1][resolv-v0.7.1]
+* stringio 3.2.1.dev
+* strscan 3.1.9.dev
+  * 3.1.6 to [v3.1.7][strscan-v3.1.7], [v3.1.8][strscan-v3.1.8]
+* syntax_suggest 3.0.0
+* timeout 0.6.1
+  * 0.6.0 to [v0.6.1][timeout-v0.6.1]
+* zlib 3.2.3
+  * 3.2.2 to [v3.2.3][zlib-v3.2.3]
+
+### The following bundled gems are updated.
+
+* minitest 6.0.6
+* rake 13.4.2
+  * 13.3.1 to [v13.4.0][rake-v13.4.0], [v13.4.1][rake-v13.4.1], [v13.4.2][rake-v13.4.2]
+* test-unit 3.7.8
+  * 3.7.5 to [3.7.6][test-unit-3.7.6], [3.7.7][test-unit-3.7.7], [3.7.8][test-unit-3.7.8]
+* net-imap 0.6.4
+  * 0.6.2 to [v0.6.3][net-imap-v0.6.3], [v0.6.4][net-imap-v0.6.4]
+* rbs 4.0.2
+  * 3.10.0 to [v3.10.1][rbs-v3.10.1], [v3.10.2][rbs-v3.10.2], [v3.10.3][rbs-v3.10.3], [v3.10.4][rbs-v3.10.4], [v4.0.0.dev.5][rbs-v4.0.0.dev.5], [v4.0.0][rbs-v4.0.0], [v4.0.2][rbs-v4.0.2]
+* typeprof 0.32.0
+* mutex_m 0.3.0
+* bigdecimal 4.1.2
+  * 4.0.1 to [v4.1.0][bigdecimal-v4.1.0], [v4.1.1][bigdecimal-v4.1.1], [v4.1.2][bigdecimal-v4.1.2]
+* resolv-replace 0.2.0
+  * 0.1.1 to [v0.2.0][resolv-replace-v0.2.0]
+* syslog 0.4.0
+  * 0.3.0 to [v0.4.0][syslog-v0.4.0]
+* repl_type_completor 0.1.15
+  * 0.1.12 to [v0.1.13][repl_type_completor-v0.1.13], [v0.1.14][repl_type_completor-v0.1.14], [v0.1.15][repl_type_completor-v0.1.15]
+* pstore 0.2.1
+  * 0.2.0 to [v0.2.1][pstore-v0.2.1]
+* rdoc 7.2.0
+  * 7.0.3 to [v7.0.4][rdoc-v7.0.4], [v7.1.0][rdoc-v7.1.0], [v7.2.0][rdoc-v7.2.0]
+* win32ole 1.9.3
+  * 1.9.2 to [v1.9.3][win32ole-v1.9.3]
+* irb 1.18.0
+  * 1.16.0 to [v1.17.0][irb-v1.17.0], [v1.18.0][irb-v1.18.0]
+
+### RubyGems and Bundler
+
+Ruby 4.0 bundled RubyGems and Bundler version 4. see the following links for details.
+
+## Supported platforms
+
+## Compatibility issues
+
+## Stdlib compatibility issues
+
+## C API updates
+
+### Embedded TypedData
+
+* The `RUBY_TYPED_EMBEDDABLE` flag is now public and documented and can be used by C extensions.
+  It allows allocating C structs directly into Ruby object slots, which reduces pointer chasing,
+  and in some case memory usage.
+  See the C extension documentation for details. [[Feature #21853]]
+
+* Added new C23 inspired allocator functions, that takes the previous memory size.
+  This allow the Ruby GC to better keep track of memory usage, improving its heuristics.
+  It also improves the performance of system allocators that support C23 `free_sized`.
+
+  However, it is important to note that passing an incorrect size to these function is undefined
+  behavior and may result in crashes or memory leaks.
+
+  - `ruby_xfree_sized(void *ptr, size_t size)`
+  - `ruby_xrealloc_sized(void *ptr, size_t newsiz, size_t oldsiz)`
+  - `ruby_xrealloc2_sized(void *ptr, size_t newelems, size_t newsiz, size_t oldelems)`
+
+  [[Feature #21861]]
+
+### Removed APIs
+
+The following APIs, which have been deprecated for many years, are removed.
+[[Feature #21768]]
+
+* old postponed job functions,
+* untyped data object type/functions,
+* old APIs to allocate a data object,
+* taintedness/trustedness enums/macros,
+* `rb_gc_force_recycle` function,
+* `rb_iterate` function,
+* and some functions and constants for internal use.
+
+## Implementation improvements
+
+### Ractor
+
+A lot of work has gone into making Ractors more stable, performant, and usable. These improvements bring Ractor implementation closer to leaving experimental status.
+
+## JIT
+
+[Feature #8948]: https://bugs.ruby-lang.org/issues/8948
+[Feature #15330]: https://bugs.ruby-lang.org/issues/15330
+[Feature #21390]: https://bugs.ruby-lang.org/issues/21390
+[Feature #21768]: https://bugs.ruby-lang.org/issues/21768
+[Feature #21785]: https://bugs.ruby-lang.org/issues/21785
+[Feature #21796]: https://bugs.ruby-lang.org/issues/21796
+[Feature #21853]: https://bugs.ruby-lang.org/issues/21853
+[Feature #21861]: https://bugs.ruby-lang.org/issues/21861
+[Feature #21932]: https://bugs.ruby-lang.org/issues/21932
+[Feature #21981]: https://bugs.ruby-lang.org/issues/21981
+[RubyGems-v4.0.4]: https://github.com/rubygems/rubygems/releases/tag/v4.0.4
+[RubyGems-v4.0.5]: https://github.com/rubygems/rubygems/releases/tag/v4.0.5
+[RubyGems-v4.0.6]: https://github.com/rubygems/rubygems/releases/tag/v4.0.6
+[RubyGems-v4.0.7]: https://github.com/rubygems/rubygems/releases/tag/v4.0.7
+[RubyGems-v4.0.8]: https://github.com/rubygems/rubygems/releases/tag/v4.0.8
+[RubyGems-v4.0.9]: https://github.com/rubygems/rubygems/releases/tag/v4.0.9
+[RubyGems-v4.0.10]: https://github.com/rubygems/rubygems/releases/tag/v4.0.10
+[RubyGems-v4.0.11]: https://github.com/rubygems/rubygems/releases/tag/v4.0.11
+[RubyGems-v4.0.12]: https://github.com/rubygems/rubygems/releases/tag/v4.0.12
+[RubyGems-v4.0.13]: https://github.com/rubygems/rubygems/releases/tag/v4.0.13
+[bundler-v4.0.4]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.4
+[bundler-v4.0.5]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.5
+[bundler-v4.0.6]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.6
+[bundler-v4.0.7]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.7
+[bundler-v4.0.8]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.8
+[bundler-v4.0.9]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.9
+[bundler-v4.0.10]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.10
+[bundler-v4.0.11]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.11
+[bundler-v4.0.12]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.12
+[bundler-v4.0.13]: https://github.com/rubygems/rubygems/releases/tag/bundler-v4.0.13
+[erb-v6.0.1.1]: https://github.com/ruby/erb/releases/tag/v6.0.1.1
+[erb-v6.0.2]: https://github.com/ruby/erb/releases/tag/v6.0.2
+[erb-v6.0.3]: https://github.com/ruby/erb/releases/tag/v6.0.3
+[erb-v6.0.4]: https://github.com/ruby/erb/releases/tag/v6.0.4
+[ipaddr-v1.2.9]: https://github.com/ruby/ipaddr/releases/tag/v1.2.9
+[json-v2.18.1]: https://github.com/ruby/json/releases/tag/v2.18.1
+[json-v2.19.0]: https://github.com/ruby/json/releases/tag/v2.19.0
+[json-v2.19.1]: https://github.com/ruby/json/releases/tag/v2.19.1
+[json-v2.19.2]: https://github.com/ruby/json/releases/tag/v2.19.2
+[json-v2.19.3]: https://github.com/ruby/json/releases/tag/v2.19.3
+[json-v2.19.4]: https://github.com/ruby/json/releases/tag/v2.19.4
+[json-v2.19.5]: https://github.com/ruby/json/releases/tag/v2.19.5
+[json-v2.19.6]: https://github.com/ruby/json/releases/tag/v2.19.6
+[json-v2.19.7]: https://github.com/ruby/json/releases/tag/v2.19.7
+[openssl-v4.0.1]: https://github.com/ruby/openssl/releases/tag/v4.0.1
+[openssl-v4.0.2]: https://github.com/ruby/openssl/releases/tag/v4.0.2
+[prism-v1.8.0]: https://github.com/ruby/prism/releases/tag/v1.8.0
+[prism-v1.8.1]: https://github.com/ruby/prism/releases/tag/v1.8.1
+[prism-v1.9.0]: https://github.com/ruby/prism/releases/tag/v1.9.0
+[resolv-v0.7.1]: https://github.com/ruby/resolv/releases/tag/v0.7.1
+[strscan-v3.1.7]: https://github.com/ruby/strscan/releases/tag/v3.1.7
+[strscan-v3.1.8]: https://github.com/ruby/strscan/releases/tag/v3.1.8
+[timeout-v0.6.1]: https://github.com/ruby/timeout/releases/tag/v0.6.1
+[zlib-v3.2.3]: https://github.com/ruby/zlib/releases/tag/v3.2.3
+[rake-v13.4.0]: https://github.com/ruby/rake/releases/tag/v13.4.0
+[rake-v13.4.1]: https://github.com/ruby/rake/releases/tag/v13.4.1
+[rake-v13.4.2]: https://github.com/ruby/rake/releases/tag/v13.4.2
+[test-unit-3.7.6]: https://github.com/test-unit/test-unit/releases/tag/3.7.6
+[test-unit-3.7.7]: https://github.com/test-unit/test-unit/releases/tag/3.7.7
+[test-unit-3.7.8]: https://github.com/test-unit/test-unit/releases/tag/3.7.8
+[net-imap-v0.6.3]: https://github.com/ruby/net-imap/releases/tag/v0.6.3
+[net-imap-v0.6.4]: https://github.com/ruby/net-imap/releases/tag/v0.6.4
+[rbs-v3.10.1]: https://github.com/ruby/rbs/releases/tag/v3.10.1
+[rbs-v3.10.2]: https://github.com/ruby/rbs/releases/tag/v3.10.2
+[rbs-v3.10.3]: https://github.com/ruby/rbs/releases/tag/v3.10.3
+[rbs-v3.10.4]: https://github.com/ruby/rbs/releases/tag/v3.10.4
+[rbs-v4.0.0.dev.5]: https://github.com/ruby/rbs/releases/tag/v4.0.0.dev.5
+[rbs-v4.0.0]: https://github.com/ruby/rbs/releases/tag/v4.0.0
+[rbs-v4.0.2]: https://github.com/ruby/rbs/releases/tag/v4.0.2
+[bigdecimal-v4.1.0]: https://github.com/ruby/bigdecimal/releases/tag/v4.1.0
+[bigdecimal-v4.1.1]: https://github.com/ruby/bigdecimal/releases/tag/v4.1.1
+[bigdecimal-v4.1.2]: https://github.com/ruby/bigdecimal/releases/tag/v4.1.2
+[resolv-replace-v0.2.0]: https://github.com/ruby/resolv-replace/releases/tag/v0.2.0
+[syslog-v0.4.0]: https://github.com/ruby/syslog/releases/tag/v0.4.0
+[repl_type_completor-v0.1.13]: https://github.com/ruby/repl_type_completor/releases/tag/v0.1.13
+[repl_type_completor-v0.1.14]: https://github.com/ruby/repl_type_completor/releases/tag/v0.1.14
+[repl_type_completor-v0.1.15]: https://github.com/ruby/repl_type_completor/releases/tag/v0.1.15
+[pstore-v0.2.1]: https://github.com/ruby/pstore/releases/tag/v0.2.1
+[rdoc-v7.0.4]: https://github.com/ruby/rdoc/releases/tag/v7.0.4
+[rdoc-v7.1.0]: https://github.com/ruby/rdoc/releases/tag/v7.1.0
+[rdoc-v7.2.0]: https://github.com/ruby/rdoc/releases/tag/v7.2.0
+[win32ole-v1.9.3]: https://github.com/ruby/win32ole/releases/tag/v1.9.3
+[irb-v1.17.0]: https://github.com/ruby/irb/releases/tag/v1.17.0
+[irb-v1.18.0]: https://github.com/ruby/irb/releases/tag/v1.18.0
diff --git a/README b/README
deleted file mode 100644
index 5794f5daf6..0000000000
--- a/README
+++ /dev/null
@@ -1,152 +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 machines, and on DOS,
-    Windows, Mac, BeOS etc.)
-
-* How to get Ruby
-
-The Ruby distribution can be found on:
-
-  ftp://ftp.netlab.co.jp/pub/lang/ruby/
-
-You can get it by anonymous CVS.  How to check out is:
-
-  $ cvs -d :pserver:anonymous@cvs.netlab.co.jp:/home/cvs login
-  (Logging in to anonymous@cvs.netlab.co.jp)
-  CVS password: guest
-  $ cvs -d :pserver:anonymous@cvs.netlab.co.jp:/home/cvs checkout ruby
-
-* 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 <ruby-talk-ctl@netlab.co.jp>.
-
-* How to compile and install
-
-This is what you need to do to compile and install Ruby:
-
-  1. Run ./configure, which will generate config.h and Makefile.
-
-  2. Edit defines.h if you need.  Probably this step will not need.
-
-  3. Remove comment mark(#) 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 "#option nodynamic" in
-     ext/Setup.
-
-  4. Run make.
-
-  5. Optionally, run 'make test' to check whether the compiled Ruby
-     interpreter works well.  If you see the message "test succeeded",
-     your ruby works as it should (hopefully).
-
-  6. Run 'make install'
-
-     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.
-
-* Copying
-
-Ruby is copyrighted free software by Yukihiro Matsumoto <matz@zetabits.com>.
-You can redistribute it and/or modify it under either the terms of the GPL
-(see COPYING file), 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) rename any non-standard executables so the names do not conflict
-	  with standard executables, which must also be provided.
-
-       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).  But some files in the distribution
-     are not written by the author, so that they are not under this terms.
-
-     They are gc.c(partly), utils.c(partly), regex.[ch], st.[ch] and some
-     files under the ./missing directory.  See each file for the copying
-     condition.
-
-  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.
-
-* Ruby home-page
-
-The URL of the Ruby home-page is:
-
-   http://www.ruby-lang.org/
-
-* The Author
-
-Feel free to send comments and bug reports to the author.  Here is the 
-author's latest mail address:
-
-  matz@zetabits.com
-
--------------------------------------------------------
-created at: Thu Aug  3 11:57:36 JST 1995
-Local variables:
-mode: indented-text
-end:
diff --git a/README.EXT b/README.EXT
deleted file mode 100644
index 12d379e09b..0000000000
--- a/README.EXT
+++ /dev/null
@@ -1,1009 +0,0 @@
-.\" README.EXT -  -*- Text -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-This document explains how to make extension libraries for Ruby.
-
-1. Basic knowledge
-
-In C, variables have types and data do not have types.  In contrast,
-Ruby variables do not have static type and data themselves have
-types.  So, data need to be converted across the languages.
-
-Data in Ruby represented C type `VALUE'.  Each VALUE data have its
-data-type.
-
-To retrieve an C data from the VALUE, you need to:
-
- (1) Identify VALUE's data type
- (2) Convert VALUE into C data
-
-Converting to wrong data type may cause serious problems.
-
-
-1.1 Data-types
-
-Ruby interpreter has data-types as below:
-
-	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_FIXNUM	Fixnum(31bit integer)
-	T_HASH		associative array
-	T_STRUCT	(Ruby) structure
-	T_BIGNUM	multi precision integer
-	T_TRUE		true
-	T_FALSE		false
-	T_DATA		data
-
-Otherwise, there are several other types used internally:
-
-	T_ICLASS
-	T_MATCH
-	T_VARMAP
-	T_SCOPE
-	T_NODE
-
-Most of the types are represented by C structures.
-
-1.2 Check Data Type of the VALUE
-
-The macro TYPE() defined in ruby.h shows data-type of the VALUE.
-TYPE() returns the constant number T_XXXX described above.  To handle
-data-types, the code will be like:
-
-  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)
-
-It raises an exception, if the VALUE does not have the type specified.
-
-There are faster check-macros for fixnums and nil.
-
-  FIXNUM_P(obj)
-  NIL_P(obj)
-
-1.3 Convert VALUE into C data
-
-The data for type T_NIL, T_FALSE, T_TRUE are nil, true, false
-respectively.  They are singletons for the data type.
-
-The T_FIXNUM data is the 31bit length fixed integer (63bit length on
-some machines), which can be convert to the C integer by using
-FIX2INT() macro.  There also be NUM2INT() which converts any Ruby
-numbers into C integer.  The NUM2INT() macro includes type check, so
-the exception will be raised if conversion failed.
-
-Other data types have corresponding C structures, e.g. struct RArray
-for T_ARRAY etc.  VALUE of the type which has corresponding structure
-can be cast to retrieve the pointer to the struct.  The casting macro
-RXXXX for each data type like RARRAY(obj).  see "ruby.h".
-
-For example, `RSTRING(size)->len' is the way to get the size of the
-Ruby String object.  The allocated region can be accessed by
-`RSTRING(str)->ptr'.  For arrays, `RARRAY(ary)->len' and
-`RARRAY(ary)->ptr' respectively.
-
-Notice: Do not change the value of the structure directly, unless you
-are responsible about the result.  It will be the cause of interesting
-bugs.
-
-1.4 Convert C data into VALUE
-
-To convert C data to the values of Ruby:
-
-  * FIXNUM
-
-    left shift 1 bit, and turn on LSB.
-
-  * Other pointer values
-
-    cast to VALUE.
-
-You can determine whether VALUE is pointer or not, by checking LSB.  
-
-Notice Ruby does not allow arbitrary pointer value to be VALUE.  They
-should be pointers to the structures which Ruby knows.  The known
-structures are defined in <ruby.h>.
-
-To convert C numbers to Ruby value, use these macros.
-
-  INT2FIX()	for integers within 31bits.
-  INT2NUM()	for arbitrary sized integer.
-
-INT2NUM() converts integers into Bignums, if it is out of FIXNUM
-range, but bit slower.
-
-1.5 Manipulate Ruby data
-
-As I already told, it is not recommended to modify object's internal
-structure.  To manipulate objects, use functions supplied by Ruby
-interpreter.  Useful functions are listed below (not all):
-
- String functions
-
-  rb_str_new(char *ptr, int len)
-
-    Creates a new Ruby string.
-
-  rb_str_new2(char *ptr)
-
-    Creates a new Ruby string from C string.  This is equivalent to
-    rb_str_new(ptr, strlen(ptr)).
-
-  rb_tainted_str_new(char *ptr, int len)
-
-    Creates a new tainted Ruby string.  Strings from external data
-    should be tainted.
-
-  rb_tainted_str_new2(char *ptr)
-
-    Creates a new tainted Ruby string from C string.
-
-  rb_str_cat(VALUE str, char *ptr, int len)
-
-    Appends len bytes data from ptr to the Ruby string.
-
- Array functions
-
-  rb_ary_new()
-
-    Creates an array with no element.
-
-  rb_ary_new2(int len)
-
-    Creates an array with no element, with allocating internal buffer
-    for len elements.
-
-  rb_ary_new3(int n, ...)
-
-    Creates an n-elements array from arguments.
-
-  rb_ary_new4(int n, VALUE *elts)
-
-    Creates an n-elements array from C array.
-
-  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_entry(VALUE ary, int idx)
-
-    Array operations.  The first argument to each functions must be an 
-    array.  They may dump core if other types given.
-
-2. Extend Ruby with C
-
-2.1 Add new features to Ruby
-
-You can add new features (classes, methods, etc.) to the Ruby
-interpreter.  Ruby provides the API to define things below:
-
- * Classes, Modules
- * Methods, Singleton Methods
- * Constants
-
-2.1.1 Class/module definition
-
-To define class or module, use functions below:
-
-  VALUE rb_define_class(char *name, VALUE super)
-  VALUE rb_define_module(char *name)
-
-These functions return the newly created class or module.  You may
-want to save this reference into the variable to use later.
-
-To define nested class or module, use functions below:
-
-  VALUE rb_define_class_under(VALUE outer, char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, char *name)
-
-2.1.2 Method/singleton method definition
-
-To define methods or singleton methods, use functions below:
-
-  void rb_define_method(VALUE klass, char *name, 
-		        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, 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 believe you don't need that much. :-)
-
-If `argc' is negative, it specifies calling sequence, not number of
-the arguments.  
-
-If argc is -1, the function will be called like:
-
-  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 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're two more functions to define method.  One is to define
-private method:
-
-  void rb_define_private_method(VALUE klass, char *name, 
-			        VALUE (*func)(), int argc)
-
-The other is to define module function, which is private AND singleton
-method of the module.  For example, sqrt is the module function
-defined in Math module.  It can be call in the form like:
-
-  Math.sqrt(4)
-
-or
-
-  include Math
-  sqrt(4)
-
-To define module function
-
-  void rb_define_module_function(VALUE module, char *name, 
-				 VALUE (*func)(), int argc)
-
-Oh, in addition, function-like method, which is private method defined
-in Kernel module, can be defined using:
-
-  void rb_define_global_function(char *name, VALUE (*func)(), int argc)
-
-To define alias to the method,
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-2.1.3 Constant definition
-
-We have 2 functions to define constants:
-
-  void rb_define_const(VALUE klass, char *name, VALUE val)
-  void rb_define_global_const(char *name, VALUE val)
-
-The former is to define constant under specified class/module.  The
-latter is to define global constant.
-
-2.2 Use Ruby features from C
-
-There are several ways to invoke Ruby's features from C code.
-
-2.2.1 Evaluate Ruby Program in String
-
-Easiest way to call Ruby's function from C program is to evaluate the
-string as Ruby program.  This function will do the job.
-
-  VALUE rb_eval_string(char *str)
-
-Evaluation is done under current context, thus current local variables
-of the innermost method (which is defined by Ruby) can be accessed.
-
-2.2.2 ID or Symbol
-
-You can invoke methods directly, without parsing the string.  First I
-need to explain about symbols (which data type is ID).  ID is the
-integer number to represent Ruby's identifiers such as variable names.
-It can be accessed from Ruby in the form like:
-
- :Identifier
-
-You can get the symbol value from string within C code, by using
-
-  rb_intern(char *name)
-
-In addition, the symbols for one character operators (e.g +) is the
-code for that character.
-
-2.2.3 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 the method of the recv, which name is specified
-by the symbol mid.
-
-2.2.4 Accessing the variables and constants
-
-You can access class variables, and instance variables using access
-functions.  Also, global variables can be shared between both worlds.
-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 2.1.3 for defining new constant.
-
-3. Information sharing between Ruby and C
-
-3.1 Ruby constant that C can be accessed from C
-
-Following Ruby constants can be referred from C.
-
-  Qtrue
-  Qfalse
-
-Boolean values.  Qfalse is false in the C also (i.e. 0).
-
-  Qnil
-
-Ruby nil in C scope.
-
-3.2 Global variables shared between C and Ruby
-
-Information can be shared between two worlds, using shared global
-variables.  To define them, you can use functions listed below:
-
-  void rb_define_variable(char *name, VALUE *var)
-
-This function defines the variable which is shared by the both world.
-The value of the global variable pointed by `var', can be accessed
-through Ruby's global variable named `name'.
-
-You can define read-only (from Ruby, of course) variable by the
-function below.
-
-  void rb_define_readonly_variable(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(char *name, VALUE *var,
-				 VALUE (*getter)(), VALUE (*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().
-
-  void rb_define_virtual_variable(char *name,
-				  VALUE (*getter)(), VALUE (*setter)())
-
-This function defines the Ruby global variable without corresponding C
-variable.  The value of the variable will be set/get only by hooks.
-
-The prototypes of the getter and setter functions are as following:
-
-  (*getter)(ID id, void *data, struct global_entry* entry);
-  (*setter)(VALUE val, ID id, void *data, struct global_entry* entry);
-
-3.3 Encapsulate C data into Ruby object
-
-To wrapping and objectify the C pointer as Ruby object (so called
-DATA), use Data_Wrap_Struct().
-
-  Data_Wrap_Struct(klass, mark, free, ptr)
-
-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.  The functions, mark and
-free, will be called from garbage collector.
-
-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, free, works like their counterpart of
-Data_Wrap_Struct().  The pointer to allocated structure will be
-assigned to sval, which should be the pointer to the type specified.
-
-To retrieve the C pointer from the Data object, use the macro
-Data_Get_Struct().
-
-  Data_Get_Struct(obj, type, sval)
-
-The pointer to the structure will be assigned to the variable sval.
-
-See example below for detail. 
-
-4. Example - Creating dbm extension
-
-OK, here's the example to make extension library.  This is the
-extension to access dbm.  The full source is included in ext/
-directory in the Ruby's source tree.
-
-(1) make the directory
-
-  % mkdir ext/dbm
-
-Make a directory for the extension library under ext directory.
-
-(2) create MANIFEST file
-
-  % cd ext/dbm
-  % touch MANIFEST
-
-There should be MANIFEST file in the directory for the extension
-library.  Make empty file now.
-
-(3) design the library
-
-You need to design the library features, before making it.
-
-(4) write 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 plural source
-files, avoid choosing ``LIBRARY.c'' for a file name.  It may conflict
-with intermediate file ``LIBRARY.o'' on some platforms.
-
-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.
-
---
-Init_dbm()
-{
-    /* 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);
-		:
-
-}
---
-
-The dbm extension wrap dbm struct in C world 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 dbmdata structure into Ruby object.  We avoid wrapping
-DBM* directly, because we want to cache size information.
-
-To retrieve dbmdata structure from Ruby object, we define the macro below:
-
---
-#define GetDBM(obj, dbmp) {\
-    Data_Get_Struct(obj, struct dbmdata, dbmp);\
-    if (dbmp->di_dbm == 0) closed_dbm();\
-}
---
-
-This sort of complicated macro do the retrieving and close check for
-the DBM.
-
-There are three kind of way to receiving method arguments.  First, the
-methods with fixed number of arguments receives arguments like this:
-
---
-static VALUE
-fdbm_delete(obj, keystr)
-    VALUE obj, keystr;
-{
-	:
-}
---
-
-The first argument of the C function is the self, the rest are the
-arguments to the method.
-
-Second, the methods with arbitrary number of arguments receives
-arguments like this:
-
---
-static VALUE
-fdbm_s_open(argc, argv, klass)
-    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.  For example "11" means, the method requires at least one
-argument, and at most receives two arguments.
-
-The methods with arbitrary number of arguments can receives arguments
-by Ruby's array, like this:
-
---
-static VALUE
-fdbm_indexes(obj, args)
-    VALUE obj, 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 refers Ruby's objects, but
-not exported to the Ruby world.  You need to protect them by
-
-  void rb_global_variable(VALUE *var)
-
-(5) prepare extconf.rb
-
-If there exists the file named extconf.rb, it will be executed to
-generate Makefile.  If not, compilation scheme try to generate
-Makefile anyway.
-
-The extconf.rb is the file to check compilation condition etc.  You
-need to put
-
-  require 'mkmf'
-
-at the top of the file.  You can use the functions below to check the
-condition.
-
-  have_library(lib, func): check whether library containing function exists.
-  have_func(func, header): check whether function exists
-  have_header(header): check whether header file exists
-  create_makefile(target): generate Makefile
-
-The value of variables below will affect Makefile.
-
-  $CFLAGS: included in CFLAGS make variable (such as -I)
-  $LDFLAGS: included in LDFLAGS make variable (such as -L)
-
-If compilation condition is not fulfilled, you do not call
-``create_makefile''.  Makefile will not generated, compilation will
-not be done.
-
-(6) prepare depend (optional)
-
-If the file named depend exists, Makefile will include that file to
-check dependency.  You can make this file by invoking
-
-  % gcc -MM *.c > depend
-
-It's no harm.  Prepare it.
-
-(7) put file names into MANIFEST (optional)
-
-  % find * -type f -print > MANIFEST
-  % vi MANIFEST
-
-Append file names into MANIFEST.  The compilation scheme requires
-MANIFEST only to be exist.  But, you'd better take this step to
-distinguish required files.
-
-(8) generate Makefile
-
-Try generate Makefile by:
-
-  ruby extconf.rb
-
-You don't need this step, if you put extension library under ext
-directory of the ruby source tree.  In that case, compilation of the
-interpreter will do this step for you.
-
-(9) make
-
-Type
-
-  make
-
-to compile your extension.  You don't need this step neither, if you
-put extension library under ext directory of the ruby source tree.
-
-(9) debug
-
-You may need to rb_debug the extension.  The extensions can be linked
-statically by adding directory name in the ext/Setup file, so that you
-can inspect the extension with the debugger.
-
-(10) done, now you have the extension library
-
-You can do anything you want with your library.  The author of Ruby
-will not claim any restriction about your code depending Ruby API.
-Feel free to use, modify, distribute or sell your program.
-
-Appendix A. Ruby source files overview
-
-ruby language core
-
-  class.c
-  error.c
-  eval.c
-  gc.c
-  object.c
-  parse.y
-  variable.c
-
-utility functions
-
-  dln.c
-  regex.c
-  st.c
-  util.c
-
-ruby interpreter implementation
-
-  dmyext.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-class library
-
-  array.c
-  bignum.c
-  compar.c
-  dir.c
-  enum.c
-  file.c
-  hash.c
-  io.c
-  marshal.c
-  math.c
-  numeric.c
-  pack.c
-  prec.c
-  process.c
-  random.c
-  range.c
-  re.c
-  signal.c
-  sprintf.c
-  string.c
-  struct.c
-  time.c
-
-Appendix B. Ruby extension API reference
-
-** Types
-
- VALUE
-
-The type for 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
-
-const: nil object
-
- Qtrue
-
-const: true object(default true value)
-
- Qfalse
-
-const: false object
-
-** C pointer wrapping
-
- Data_Wrap_Struct(VALUE klass, void (*mark)(), void (*free)(), void *sval)
-
-Wrap C pointer into Ruby object.  If object has references to other
-Ruby object, they should be marked by using mark function during 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. 
-
-** defining class/module
-
- VALUE rb_define_class(char *name, VALUE super)
-
-Defines new Ruby class as subclass of super.
-
- VALUE rb_define_class_under(VALUE module, char *name, VALUE super)
-
-Creates new Ruby class as subclass of super, under the module's
-namespace.
-
- VALUE rb_define_module(char *name)
-
-Defines new Ruby module.
-
- VALUE rb_define_module_under(VALUE module, char *name, VALUE super)
-
-Defines 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
-ignore.
-
- void rb_extend_object(VALUE object, VALUE module)
-
-Extend the object with module's attribute.
-
-** Defining Global Variables
-
- void rb_define_variable(char *name, VALUE *var)
-
-Defines a global variable which is shared between C and Ruby.  If name
-contains the character which is not allowed to be part of the symbol,
-it can't be seen from Ruby programs.
-
- void rb_define_readonly_variable(char *name, VALUE *var)
-
-Defines a read-only global variable.  Works just like
-rb_define_variable(), except defined variable is read-only.
-
- void rb_define_virtual_variable(char *name,
-				 VALUE (*getter)(), VALUE (*setter)())
-
-Defines a virtual variable, whose behavior is defined by pair of C
-functions.  The getter function is called when the variable is
-referred.  The setter function is called when the value is set to the
-variable.  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(char *name, VALUE *var,
-				VALUE (*getter)(), VALUE (*setter)())
-
-Defines hooked variable.  It's virtual variable with C variable.  The
-getter is called as
-
-	VALUE getter(ID id, VALUE *var)
-
-returning new value.  The setter is called as
-
-	void setter(VALUE val, ID id, VALUE *var)
-
-GC requires to mark the C global variables which hold Ruby values.
-
- void rb_global_variable(VALUE *var)
-
-Tells GC to protect these variables.
-
-** Constant Definition
-
- void rb_define_const(VALUE klass, char *name, VALUE val)
-
-Defines a new constant under the class/module.
-
- void rb_define_global_const(char *name, VALUE val)
-
-Defines global constant.  This is just work as
-
-     rb_define_const(cKernal, name, val)
-
-** Method Definition
-
- rb_define_method(VALUE klass, 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 the Ruby array of
-the method arguments.
-
- rb_define_private_method(VALUE klass, 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, char *name, VALUE (*func)(), int argc)
-
-Defines a singleton method.  Arguments are same as rb_define_method().
-
- rb_scan_args(int argc, VALUE *argv, char *fmt, ...)
-
-Retrieve argument from argc, argv.  The fmt is the format string for
-the arguments, such as "12" for 1 non-optional argument, 2 optional
-arguments.  If `*' appears at the end of fmt, it means the rest of
-the arguments are assigned to corresponding variable, packed in
-array.
-
-** Invoking Ruby method
-
- VALUE rb_funcall(VALUE recv, ID mid, int narg, ...)
-
-Invokes the method.  To retrieve mid from method name, use rb_intern().
-
- VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-
-Invokes method, passing arguments by array of values.
-
- VALUE rb_eval_string(char *str)
-
-Compiles and executes the string as Ruby program.
-
- ID rb_intern(char *name)
-
-Returns ID corresponding 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, 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, char *name, VALUE val)
-
-Sets the value of the instance variable.
-
-** Control Structure
-
- 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.
- 
- VALUE rb_yield(VALUE val)
-
-Evaluates the block with value val.
-
- VALUE rb_rescue(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2)
-
-Calls the function func1, with arg1 as the argument.  If 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)(), void *arg1, void (*func2)(), void *arg2)
-
-Calls the function func1 with arg1 as the argument, then calls func2
-with arg2, whenever execution terminated.  The return value from
-rb_ensure() is that of func1.
-
-** Exceptions and Errors
-
- void rb_warn(char *fmt, ...)
-
-Prints warning message according to the printf-like format.
-
- void rb_warning(char *fmt, ...)
-
-Prints warning message according to the printf-like format, if
-$VERBOSE is true.
-
- void rb_raise(VALUE exception, char *fmt, ...)
-
-Raises an exception of class exception.  The fmt is the format string
-just like printf().
-
- void rb_fatal(char *fmt, ...)
-
-Raises fatal error, terminates the interpreter.  No exception handling
-will be done for fatal error, but ensure blocks will be executed.
-
- void rb_bug(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.
-
-** Initialize and Starts the Interpreter
-
-The embedding API 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).
-
-Appendix B. Functions Available in extconf.rb
-
-These functions are available in extconf.rb:
-
- have_library(lib, func)
-
-Checks whether library which contains specified function exists.
-Returns true if the library exists.
-
- have_func(func, header)
-
-Checks whether func exists with header.  Returns true if the function
-exists.  To check functions in the additional library, you need to
-check that library first using have_library().
-
- have_header(header)
-
-Checks for the header files.  Returns true if the header file exists.
-
- create_makefile(target)
-
-Generates the Makefile for the extension library.  If you don't invoke
-this method, the compilation will not be done.
-
-/*
- * Local variables:
- * fill-column: 70
- * end:
- */
diff --git a/README.EXT.jp b/README.EXT.jp
deleted file mode 100644
index e8be946d68..0000000000
--- a/README.EXT.jp
+++ /dev/null
@@ -1,1188 +0,0 @@
-.\" README.EXT -  -*- Text -*- created at: Mon Aug  7 16:45:54 JST 1995
-
-Ruby�γ�ĥ�饤�֥��κ�������������ޤ���
-
-1�������μ�
-
-C���ѿ��ˤϷ������ꡤ�ǡ����ˤϷ�������ޤ��󡥤Ǥ����顤��
-�Ȥ��Хݥ��󥿤�int���ѿ�����������ȡ������ͤ������Ȥ��Ƽ�
-�갷���ޤ����դ�Ruby���ѿ��ˤϷ����ʤ����ǡ����˷��������
-�������ΰ㤤�Τ��ᡤC��Ruby����ߤ��Ѵ����ʤ���С����ߤ���
-�ǡ����򥢥������Ǥ��ޤ���
-
-Ruby�Υǡ�����VALUE�Ȥ���C�η���ɽ������ޤ���VALUE���Υǡ�
-���Ϥ��Υǡ��������פ�ʬ���ΤäƤ��ޤ������Υǡ��������פ�
-�����Τϥǡ���(���֥�������)�μºݤι�¤���̣���Ƥ��ơ�Ruby
-�Υ��饹�ȤϤޤ���ä���ΤǤ���
-
-VALUE����C�ˤȤäư�̣�Τ���ǡ�������Ф�����ˤ�
-
- (1) VALUE�Υǡ��������פ��Τ�
- (2) VALUE��C�Υǡ������Ѵ�����
-
-��ξ����ɬ�פǤ���(1)��˺���ȴְ�ä��ǡ������Ѵ����Ԥ��
-�ơ��ǰ��ץ�����बcore dump���ޤ���
-
-1.1 �ǡ���������
-
-Ruby�ˤϥ桼�����Ȥ���ǽ���Τ���ʲ��Υ����פ�����ޤ���
-
-	T_NIL		nil
-	T_OBJECT	�̾�Υ��֥�������
-	T_CLASS		���饹
-	T_MODULE	�⥸�塼��
-	T_FLOAT		��ư��������
-	T_STRING	ʸ����
-	T_REGEXP	����ɽ��
-	T_ARRAY		����
-	T_FIXNUM	Fixnum(31bitĹ����)
-	T_HASH		Ϣ������
-	T_STRUCT	(Ruby��)��¤��
-	T_BIGNUM	¿��Ĺ����
-	T_FILE		������
-	T_TRUE		��
-	T_FALSE		��
-	T_DATA		�ǡ���
-
-����¾�����������Ѥ���Ƥ���ʲ��Υ����פ�����ޤ���
-
-	T_ICLASS
-	T_MATCH
-	T_VARMAP
-	T_SCOPE
-	T_NODE
-
-�ۤȤ�ɤΥ����פ�C�ι�¤�ΤǼ�������Ƥ��ޤ���
-
-1.2 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)
-
-1.3 VALUE��C�Υǡ������Ѵ�����
-
-�ǡ��������פ�T_NIL, T_FALSE, T_TRUE�Ǥ�������ǡ����Ϥ��줾
-��nil, false, true�Ǥ������Υǡ��������פΥ��֥������ȤϤҤ�
-�Ĥ��Ĥ���¸�ߤ��ޤ���
-
-�ǡ��������פ�T_FIXNUM�λ��������31bit�Υ����������������
-����FIXNUM��C���������Ѵ����뤿��ˤϥޥ�����FIX2INT()�פ��
-���ޤ������줫�顤FIXNUM�˸¤餺Ruby�Υǡ������������Ѵ�����
-��NUM2INT()�פȤ����ޥ���������ޤ������Υޥ����ϥǡ�������
-�פΥ����å�̵���ǻȤ��ޤ�(�������Ѵ��Ǥ��ʤ����ˤ��㳰��
-ȯ������)��
-
-Ʊ�ͤ˥����å�̵���ǻȤ����Ѵ��ޥ�����double����Ф�
-��NUM2DBL()�פ�char*����Ф���STR2CSTR()�פ�����ޤ���
-
-����ʳ��Υǡ��������פ��б�����C�ι�¤�Τ�����ޤ����б���
-�빽¤�ΤΤ���VALUE�Ϥ��Τޤޥ��㥹��(���Ѵ�)����й�¤�Τ�
-�ݥ��󥿤��Ѵ��Ǥ��ޤ���
-
-��¤�Τϡ�struct RXxxxx�פȤ���̾����ruby.h���������Ƥ���
-�����㤨��ʸ����ϡ�struct RString�פǤ����ºݤ˻Ȥ���ǽ����
-����Τ�ʸ��������󤯤餤���Ȼפ��ޤ���
-
-ruby.h�ǤϹ�¤�Τإ��㥹�Ȥ���ޥ������RXXXXX()��(������ʸ
-���ˤ������)�Ȥ���̾�����󶡤���Ƥ��ޤ�(��: RSTRING())��
-
-�㤨�С�ʸ����str��Ĺ�������뤿��ˤϡ�RSTRING(str)->len�פ�
-����ʸ����str��char*�Ȥ������뤿��ˤϡ�RSTRING(str)->ptr��
-�Ȥ��ޤ�������ξ��ˤϡ����줾���RARRAY(ary)->len�ס�
-��RARRAY(ary)->ptr�פȤʤ�ޤ���
-
-Ruby�ι�¤�Τ�ľ�ܥ�������������˵���Ĥ��ʤ���Фʤ�ʤ���
-�Ȥϡ������ʸ����ι�¤�Τ���Ȥϻ��Ȥ�������ǡ�ľ���ѹ���
-�ʤ����ȤǤ���ľ���ѹ�������硤���֥������Ȥ����Ƥ���������
-�Ȥ�ʤ��ʤäơ��פ�̥Х��θ����ˤʤ�ޤ���
-
-1.4 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����˼��ޤ뼫���������
-  INT2NUM()	Ǥ�դ���������VALUE��
-
-INT2NUM()��������FIXNUM���ϰϤ˼��ޤ�ʤ���硤Bignum���Ѵ�
-���Ƥ���ޤ�(���������٤�)��
-
-1.5 Ruby�Υǡ���������
-
-������Ҥ٤��̤ꡤRuby�ι�¤�Τ򥢥���������������Ƥι�����
-�Ԥ����Ȥϴ�����ޤ��󡥤ǡ�Ruby�Υǡ�����������ˤ�
-Ruby���Ѱդ��Ƥ���ؿ����Ѥ��Ƥ���������
-
-�����ǤϤ�äȤ�Ȥ���Ǥ�����ʸ��������������/�����
-���ؿ��򤢤��ޤ�(�����ǤϤʤ��Ǥ�)��
-
- ʸ������Ф���ؿ�
-
-  rb_str_new(char *ptr, int len)
-
-    ������Ruby��ʸ������������롥
-
-  rb_str_new2(char *ptr)
-
-    C��ʸ���󤫤�Ruby��ʸ������������롥���δؿ��ε�ǽ��
-    rb_str_new(ptr, strlen(ptr))��Ʊ���Ǥ��롥
-
-  rb_tainted_str_new(char *ptr, int len)
-
-    �����ޡ������ղä��줿������Ruby��ʸ������������롥����
-    ����Υǡ����˴�Ť�ʸ����ˤϱ����ޡ������ղä����٤�
-    �Ǥ��롥
-
-  rb_tainted_str_new2(char *ptr)
-
-    C��ʸ���󤫤�����ޡ������ղä��줿Ruby��ʸ������������롥
-
-  rb_str_cat(VALUE str, char *ptr, int len)
-
-    Ruby��ʸ����str��len�Х��Ȥ�ʸ����ptr���ɲä��롥
-
- ������Ф���ؿ�
-
-  rb_ary_new()
-
-    ���Ǥ�0��������������롥
-
-  rb_ary_new2(int len)
-
-    ���Ǥ�0��������������롥len����ʬ���ΰ�򤢤餫������
-    ���ƤƤ�����
-
-  rb_ary_new3(int n, ...)
-
-    �����ǻ��ꤷ��n���Ǥ�ޤ�������������롥
-
-  rb_ary_new4(int n, VALUE *elts)
-
-    �����Ϳ����n���Ǥ�������������롥
-
-  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_entry(VALUE ary, int idx)
-
-    Array��Ʊ̾�Υ᥽�åɤ�Ʊ��Ư���򤹤�ؿ�����1������ɬ��
-    ����Ǥʤ���Фʤ�ʤ���
-
-2��Ruby�ε�ǽ��Ȥ�
-
-����Ū��Ruby�ǽ񤱤뤳�Ȥ�C�Ǥ�񤱤ޤ���Ruby���Τ�Τ�C�ǵ�
-�Ҥ���Ƥ����Ǥ����顤�����Ȥ����������ʤ�Ǥ����ɡ�������
-��Ruby�γ�ĥ�˻Ȥ����Ȥ�¿����������ͽ¬����뵡ǽ���濴�˾�
-�𤷤ޤ���
-
-2.1 Ruby�˵�ǽ���ɲä���
-
-Ruby���󶡤���Ƥ���ؿ���Ȥ���Ruby���󥿥ץ꥿�˿�������ǽ
-���ɲä��뤳�Ȥ��Ǥ��ޤ���Ruby�Ǥϰʲ��ε�ǽ���ɲä���ؿ���
-�󶡤���Ƥ��ޤ���
-
- * ���饹���⥸�塼��
- * �᥽�åɡ��ðۥ᥽�åɤʤ�
- * ���
-
-�ǤϽ�˾Ҳ𤷤ޤ���
-
-2.1.1 ���饹/�⥸�塼�����
-
-���饹��⥸�塼���������뤿��ˤϡ��ʲ��δؿ���Ȥ��ޤ���
-
-  VALUE rb_define_class(char *name, VALUE super)
-  VALUE rb_define_module(char *name)
-
-�����δؿ��Ͽ�����������줿���饹��⥸�塼����֤��ޤ���
-�᥽�åɤ����������ˤ������ͤ�ɬ�פʤΤǡ��ۤȤ�ɤξ��
-������ͤ��ѿ��˳�Ǽ���Ƥ���ɬ�פ�����Ǥ��礦��
-
-���饹��⥸�塼���¾�Υ��饹�������˥ͥ��Ȥ�������������
-�ϰʲ��δؿ���Ȥ��ޤ���
-
-  VALUE rb_define_class_under(VALUE outer, char *name, VALUE super)
-  VALUE rb_define_module_under(VALUE outer, char *name)
-
-2.1.2 �᥽�å�/�ðۥ᥽�å����
-
-�᥽�åɤ��ðۥ᥽�åɤ��������ˤϰʲ��δؿ���Ȥ��ޤ���
-
-  void rb_define_method(VALUE klass, char *name, 
-		        VALUE (*func)(), int argc)
-
-  void rb_define_singleton_method(VALUE object, char *name, 
-			          VALUE (*func)(), int argc)
-
-
-ǰ�Τ�����������ȡ��ðۥ᥽�åɡפȤϡ���������Υ��֥�����
-�Ȥ��Ф��Ƥ���ͭ���ʥ᥽�åɤǤ���Ruby�ǤϤ褯Smalltalk�ˤ�
-���륯�饹�᥽�åɤȤ��ơ����饹���Ф����ðۥ᥽�åɤ��Ȥ��
-�ޤ���
-
-�����δؿ��� argc�Ȥ���������C�δؿ����Ϥ��������ο�(��
-����)����ޤ���argc��0�ʾ�λ��ϴؿ��˰����Ϥ������ο����
-̣���ޤ���16�İʾ�ΰ����ϻȤ��ޤ���(�����פ�ޤ����͡���
-��ʤ�)���ºݤδؿ��ˤ���Ƭ�ΰ����Ȥ���self��Ϳ�����ޤ���
-�ǡ����ꤷ�������1¿����������Ĥ��Ȥˤʤ�ޤ���
-
-argc����λ��ϰ����ο��ǤϤʤ�����������ꤷ�����Ȥˤʤ�ޤ���
-argc��-1�λ��ϰ����������������Ϥ���ޤ���argc��-2�λ��ϰ�
-����Ruby������Ȥ����Ϥ���ޤ���
-
-�᥽�åɤ��������ؿ��Ϥ⤦��Ĥ���ޤ����ҤȤĤ�private��
-���åɤ��������ؿ��ǡ�������rb_define_method()��Ʊ���Ǥ���
-
-  void rb_define_private_method(VALUE klass, char *name, 
-				VALUE (*func)(), int argc)
-
-private�᥽�åɤȤϴؿ������Ǥ����ƤӽФ����Ȥν���ʤ��᥽��
-�ɤǤ���
-
-�⤦�ҤȤĤϥ⥸�塼��ؿ�����������ΤǤ����⥸�塼��ؿ�
-�Ȥϥ⥸�塼����ðۥ᥽�åɤǤ��ꡤƱ����private�᥽�åɤ�
-�⤢���ΤǤ�����򤢤����Math�⥸�塼���sqrt()�ʤɤ�����
-���ޤ������Υ᥽�åɤ�
-
-  Math.sqrt(4)
-
-�Ȥ��������Ǥ�
-
-  include Math
-  sqrt(4)
-
-�Ȥ��������Ǥ�Ȥ��ޤ����⥸�塼��ؿ����������ؿ��ϰʲ���
-�̤�Ǥ���
-
-  void rb_define_module_function(VALUE module, char *name, 
-		                 VALUE (*func)(), int argc)
-
-�ؿ�Ū�᥽�å�(Kernel�⥸�塼���private method)��������뤿
-��δؿ��ϰʲ����̤�Ǥ���
-
-  void rb_define_global_function(char *name, VALUE (*func)(), int argc)
-
-
-�᥽�åɤ���̾��������뤿��δؿ��ϰʲ����̤�Ǥ���
-
-  void rb_define_alias(VALUE module, const char* new, const char* old);
-
-2.1.3 ������
-
-��ĥ�饤�֥�꤬ɬ�פ�����Ϥ��餫����������Ƥ����������ɤ�
-�Ǥ��礦��������������ؿ�����Ĥ���ޤ���
-
-  void rb_define_const(VALUE klass, char *name, VALUE val)
-  void rb_define_global_const(char *name, VALUE val)
-
-���Ԥ�����Υ��饹/�⥸�塼���°�����������������Ρ���
-�Ԥϥ������Х���������������ΤǤ���
-
-2.2 Ruby�ε�ǽ��C����ƤӽФ�
-
-���ˡ�1.5 Ruby�Υǡ���������٤ǰ����Ҳ𤷤��褦�ʴؿ���
-�Ȥ��С�Ruby�ε�ǽ��¸����Ƥ���ؿ���ľ�ܸƤӽФ����Ȥ�����
-�ޤ���
-
-# ���Τ褦�ʴؿ��ΰ���ɽ�Ϥ��ޤΤȤ�������ޤ��󡥥�������
-# �뤷���ʤ��Ǥ��͡�
-
-����ʳ��ˤ�Ruby�ε�ǽ��ƤӽФ���ˡ�Ϥ����Ĥ�����ޤ���
-
-2.2.1 Ruby�Υץ�������eval����
-
-C����Ruby�ε�ǽ��ƤӽФ���äȤ��ñ����ˡ�Ȥ��ơ�ʸ�����
-Ϳ����줿Ruby�Υץ�������ɾ������ʲ��δؿ�������ޤ���
-
-  VALUE rb_eval_string(char *str)
-
-����ɾ���ϸ��ߤδĶ��ǹԤ��ޤ����Ĥޤꡤ���ߤΥ��������ѿ�
-�ʤɤ�����Ѥ��ޤ���
-
-2.2.2 ID�ޤ��ϥ���ܥ�
-
-C����ʸ������ͳ������Ruby�Υ᥽�åɤ�ƤӽФ����Ȥ�Ǥ���
-�����������ˡ�Ruby���󥿥ץ꥿��ǥ᥽�åɤ��ѿ�̾����ꤹ��
-���˻Ȥ��Ƥ���ID�ˤĤ����������Ƥ����ޤ��礦��
-
-ID�Ȥ��ѿ�̾���᥽�å�̾��ɽ�������Ǥ���Ruby����Ǥ�
-
- :���̻�
-
-�ǥ��������Ǥ��ޤ���C���餳�����������뤿��ˤϴؿ�
-
-  rb_intern(char *name)
-
-��Ȥ��ޤ����ޤ���ʸ���α黻�ҤϤ���ʸ�������ɤ����Τޤޥ���
-�ܥ�ˤʤäƤ��ޤ���Ruby��������Ȥ���Ϳ����줿����ܥ�(��
-����ʸ����)��ID���Ѵ�����ˤϰʲ��δؿ���Ȥ��ޤ���
-
-  rb_to_id(VALUE symbol)
-
-2.2.3 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_apply(VALUE recv, ID mid, VALUE args)
-
-apply�ˤϰ����Ȥ���Ruby�������Ϳ���ޤ���
-
-2.2.4 �ѿ�/����򻲾�/��������
-
-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 �������٤ǾҲ�
-��Ƥ���ؿ���ȤäƤ���������
-
-3��Ruby��C�Ȥξ���ͭ
-
-C�����Ruby�δ֤Ǿ����ͭ������ˡ�ˤĤ��Ʋ��⤷�ޤ���
-
-3.1 C���黲�ȤǤ���Ruby�����
-
-�ʲ���Ruby�������C�Υ�٥뤫�黲�ȤǤ��ޤ���
-
-  Qtrue
-  Qfalse
-
-    �����͡�Qfalse��C����Ǥ⵶�Ȥߤʤ���ޤ�(�Ĥޤ�0)��
-
-  Qnil
-
-    C���줫�鸫����nil�ס�
-
-3.2 C��Ruby�Ƕ�ͭ���������ѿ�
-
-C��Ruby������ѿ���Ȥäƾ����ͭ�Ǥ��ޤ�����ͭ�Ǥ������
-�ѿ��ˤϤ����Ĥ��μ��ब����ޤ������Τʤ��Ǥ�äȤ��ɤ��Ȥ�
-���Ȼפ���Τ�rb_define_variable()�Ǥ���
-
-  void rb_define_variable(char *name, VALUE *var)
-
-���δؿ���Ruby��C�ȤǶ�ͭ��������ѿ���������ޤ����ѿ�̾��
-`$'�ǻϤޤ�ʤ����ˤϼ�ưŪ���ɲä���ޤ��������ѿ����ͤ���
-������ȼ�ưŪ��Ruby���б������ѿ����ͤ��Ѥ��ޤ���
-
-�ޤ�Ruby¦����Ϲ����Ǥ��ʤ��ѿ��⤢��ޤ�������read only��
-�ѿ��ϰʲ��δؿ���������ޤ���
-
-  void rb_define_readonly_variable(char *name, VALUE *var)
-
-������ѿ���¾��hook��Ĥ�������ѿ�������Ǥ��ޤ���hook�դ�
-������ѿ��ϰʲ��δؿ����Ѥ���������ޤ���hook�դ�����ѿ���
-�ͤλ��Ȥ������hook�ǹԤ�ɬ�פ�����ޤ���
-
-  void rb_define_hooked_variable(char *name, VALUE *var,
-				 VALUE (*getter)(), VALUE (*setter)())
-
-���δؿ���C�δؿ��ˤ�ä�hook�ΤĤ���줿����ѿ����������
-�����ѿ������Ȥ��줿���ˤϴؿ�getter�����ѿ����ͤ����åȤ���
-�����ˤϴؿ�setter���ƤФ�롥hook����ꤷ�ʤ�����getter��
-setter��0����ꤷ�ޤ���
-
-# getter��setter��0�ʤ��rb_define_variable()��Ʊ���ˤʤ롥
-
-���줫�顤C�δؿ��ˤ�äƼ¸������Ruby������ѿ����������
-�ؿ�������ޤ���
-
-  void rb_define_virtual_variable(char *name,
-				  VALUE (*getter)(), VALUE (*setter)())
-
-���δؿ��ˤ�ä�������줿Ruby������ѿ������Ȥ��줿���ˤ�
-getter�����ѿ����ͤ����åȤ��줿���ˤ�setter���ƤФ�ޤ���
-
-getter��setter�λ��ͤϰʲ����̤�Ǥ���
-
-  (*getter)(ID id, void *data, struct global_entry* entry);
-  (*setter)(VALUE val, ID id, void *data, struct global_entry* entry);
-
-3.3 C�Υǡ�����Ruby���֥������Ȥˤ���
-
-C��������������줿�ǡ���(��¤��)��Ruby�Υ��֥������ȤȤ���
-��갷��������礬���ꤨ�ޤ������Τ褦�ʾ��ˤϡ�Data�Ȥ���
-Ruby���֥������Ȥ�C�ι�¤��(�ؤΥݥ���)�򤯤�ळ�Ȥ�Ruby
-���֥������ȤȤ��Ƽ�갷����褦�ˤʤ�ޤ���
-
-Data���֥������Ȥ��������ƹ�¤�Τ�Ruby���֥������Ȥ˥��ץ���
-�����뤿��ˤϡ��ʲ��Υޥ�����Ȥ��ޤ���
-
-  Data_Wrap_Struct(klass, mark, free, ptr)
-
-���Υޥ���������ͤ��������줿Data���֥������ȤǤ���
-
-klass�Ϥ���Data���֥������ȤΥ��饹�Ǥ���ptr�ϥ��ץ��벽����
-C�ι�¤�ΤؤΥݥ��󥿤Ǥ���mark�Ϥ��ι�¤�Τ�Ruby�Υ��֥���
-���Ȥؤλ��Ȥ�������˻Ȥ��ؿ��Ǥ������Τ褦�ʻ��Ȥ�ޤޤʤ�
-���ˤ�0����ꤷ�ޤ���
-
-# ���Τ褦�ʻ��Ȥϴ�����ޤ���
-
-free�Ϥ��ι�¤�Τ��⤦���פˤʤä����˸ƤФ��ؿ��Ǥ�������
-�ؿ��������١������쥯������ƤФ�ޤ���
-
-C�ι�¤�Τγ�����Data���֥������Ȥ�������Ʊ���˹Ԥ��ޥ�����
-���ưʲ��Τ�Τ��󶡤���Ƥ��ޤ���
-
-  Data_Make_Struct(klass, type, mark, free, sval)
-
-���Υޥ���������ͤ��������줿Data���֥������ȤǤ���
-
-klass, mark, free��Data_Wrap_Struct��Ʊ��Ư���򤷤ޤ���type
-�ϳ�����Ƥ�C��¤�Τη��Ǥ���������Ƥ�줿��¤�Τ��ѿ�sval
-����������ޤ��������ѿ��η��� (type*) �Ǥ���ɬ�פ�����ޤ���
-
-Data���֥������Ȥ���ݥ��󥿤���Ф��Τϰʲ��Υޥ������Ѥ�
-�ޤ���
-
-  Data_Get_Struct(obj, type, sval)
-
-C�ι�¤�ΤؤΥݥ��󥿤��ѿ�sval����������ޤ���
-
-������Data�λȤ����Ϥ���ä�ʬ����ˤ����Τǡ������������
-����򻲾Ȥ��Ƥ���������
-
-4������ - dbm�ѥå���������
-
-�����ޤǤ������ǤȤꤢ������ĥ�饤�֥��Ϻ���Ϥ��Ǥ���
-Ruby��ext�ǥ��쥯�ȥ�ˤ��Ǥ˴ޤޤ�Ƥ���dbm�饤�֥������
-�����ʳ�Ū���������ޤ���
-
-(1) �ǥ��쥯�ȥ����
-
-  % mkdir ext/dbm
-
-Ruby 1.1�����Ǥ�դΥǥ��쥯�ȥ�ǥ����ʥߥå��饤�֥����
-�뤳�Ȥ��Ǥ���褦�ˤʤ�ޤ�����Ruby����Ū�˥�󥯤������
-��Ruby��Ÿ�������ǥ��쥯�ȥ�β���ext�ǥ��쥯�ȥ����˳�ĥ
-�饤�֥���ѤΥǥ��쥯�ȥ����ɬ�פ�����ޤ���̾����Ŭ����
-����ǹ����ޤ���
-
-(2) MANIFEST�ե��������
-
-  % cd ext/dbm
-  % touch MANIFEST
-
-��ĥ�饤�֥��Υǥ��쥯�ȥ�β��ˤ�MANIFEST�Ȥ����ե����뤬
-ɬ�פʤΤǡ��Ȥꤢ�������Υե�������äƤ����ޤ�����Ǥ���
-�ե�����ˤ�ɬ�פʥե�������������뤳�Ȥˤʤ�ޤ���
-
-MANIFEST�Ȥ����ե�����ϡ���Ū��󥯤�make�λ��˥ǥ��쥯�ȥ�
-����ĥ�饤�֥���ޤ�Ǥ��뤫�ɤ���Ƚ�ꤹ�뤿��˻Ȥ����
-���ޤ��������ʥߥå��饤�֥�������ˤ�ɬ������ɬ�פǤ�
-����ޤ���
-
-(3) �߷פ���
-
-�ޤ��������ʤ�Ǥ����ɡ��ɤ�������ǽ��¸����뤫�ɤ����ޤ���
-�פ���ɬ�פ�����ޤ����ɤ�ʥ��饹��Ĥ��뤫�����Υ��饹�ˤ�
-�ɤ�ʥ᥽�åɤ����뤫�����饹���󶡤�������ʤɤˤĤ����߷�
-���ޤ���dbm���饹�ˤĤ��Ƥ�ext/dbm.doc�򻲾Ȥ��Ƥ���������
-
-(4) C�����ɤ��
-
-��ĥ�饤�֥�����ΤȤʤ�C����Υ�������񤭤ޤ���C����Υ���
-�����ҤȤĤλ��ˤϡ֥饤�֥��̾.c�פ����֤��ɤ��Ǥ��礦��C
-����Υ�������ʣ���ξ��ˤϵդˡ֥饤�֥��̾.c�פȤ����ե�
-����̾���򤱤�ɬ�פ�����ޤ������֥������ȥե�����ȥ⥸�塼
-�������������Ū�����������֥饤�֥��̾.o�פȤ����ե�����
-�Ȥ����ͤ��뤫��Ǥ���
-
-Ruby�ϳ�ĥ�饤�֥�������ɤ�����ˡ�Init_�饤�֥��̾�פ�
-�����ؿ���ưŪ�˼¹Ԥ��ޤ���dbm�饤�֥��ξ���Init_dbm��
-�Ǥ������δؿ�����ǥ��饹���⥸�塼�롤�᥽�åɡ�����ʤɤ�
-�����Ԥ��ޤ���dbm.c����������Ѥ��ޤ���
-
---
-Init_dbm()
-{
-    /* 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(obj, keystr)
-    VALUE obj, keystr;
-{
-	:
-}
---
-
-�����ο�������Υ����פ���1������self����2�����ʹߤ��᥽�å�
-�ΰ����Ȥʤ�ޤ���
-
-�����ο�������Τ�Τ�C������Ǽ������Τ�Ruby������Ǽ���
-���ΤȤ�����ޤ���dbm�饤�֥�����ǡ�C������Ǽ�������
-��DBM�Υ��饹�᥽�åɤǤ���open()�Ǥ��������������Ƥ����
-��fdbm_s_open()�Ϥ����ʤäƤ��ޤ���
-
---
-static VALUE
-fdbm_s_open(argc, argv, klass)
-    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�ѿ��ʹߤ˻��ꤷ���ѿ����ͤ��������Ƥ���ޤ�������
-�ե����ޥåȤϡ���1ʸ���ܤ���ά�Ǥ��ʤ������ο�����2ʸ���ܤ�
-��ά�Ǥ�������ο�����3ʸ���ܤ��б�������̵꤬�����ޤ�ΰ�
-�������뤫�ɤ����򼨤�"*"�Ǥ���2ʸ���ܤ�3ʸ���ܤϾ�ά�Ǥ���
-����dbm.c����Ǥϡ��ե����ޥåȤ�"11"�Ǥ����顤�����Ϻ���1��
-�ǡ�2�Ĥޤǵ������Ȥ�����̣�ˤʤ�ޤ�����ά����Ƥ������
-�ѿ����ͤ�nil(C����Υ�٥�Ǥ�Qnil)�ˤʤ�ޤ���
-
-Ruby������ǰ������������Τ�indexes������ޤ��������Ϥ�
-���Ǥ���
-
---
-static VALUE
-fdbm_indexes(obj, args)
-    VALUE obj, args;
-{
-	:
-}
---
-
-��1������self����2������Ruby������Ǥ���
-
-** ���ջ���
-
-Ruby�ȶ�ͭ�Ϥ��ʤ���Ruby�Υ��֥������Ȥ��Ǽ�����ǽ���Τ���
-C������ѿ��ϰʲ��δؿ���Ȥä�Ruby���󥿥ץ꥿���ѿ���¸��
-�򶵤��Ƥ����Ƥ����������Ǥʤ���GC�ǥȥ�֥�򵯤����ޤ���
-
-  void rb_global_variable(VALUE *var)
-
-(5) 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): Makefile������
-
-�ʲ����ѿ���Ȥ����Ȥ��Ǥ��ޤ���
-
-  $CFLAGS: ����ѥ�������ɲ�Ū�˻��ꤹ��ե饰(-I�ʤ�)
-  $LDFLAGS: ��󥯻����ɲ�Ū�˻��ꤹ��ե饰(-L�ʤ�)
-
-�饤�֥��򥳥�ѥ��뤹���郎·�鷺�����Υ饤�֥��򥳥�
-�ѥ��뤷�ʤ����ˤ�create_makefile��ƤФʤ����Makefile����
-�����줺������ѥ����Ԥ��ޤ���
-
-(6) depend���Ѱդ���
-
-�⤷���ǥ��쥯�ȥ��depend�Ȥ����ե����뤬¸�ߤ���С�
-Makefile����¸�ط�������å����Ƥ���ޤ���
-
-  % gcc -MM *.c > depend
-
-�ʤɤǺ�뤳�Ȥ�����ޤ������ä�»��̵���Ǥ��礦��
-
-(7) MANIFEST�ե�����˥ե�����̾�������
-
-  % find * -type f -print > MANIFEST
-  % vi MANIFEST
-
-*.o, *~�ʤ���ɬ�פʥե�����ʳ���MANIFEST���ɲä��Ƥ����ޤ���
-make���ˤ�MANIFEST�����Ƥϻ��Ȥ��ޤ���Τǡ����ΤޤޤǤ�����
-�ϵ����ޤ��󤬡��ѥå������󥰤λ��˻��Ȥ��뤳�Ȥ�����Τȡ�
-ɬ�פʥե��������̤Ǥ���Τǡ��Ѱդ��Ƥ����������ɤ��Ǥ���
-����
-
-(8) Makefile����������
-
-Makefile��ºݤ��������뤿��ˤ�
-
-  ruby extconf.rb
-
-�Ȥ��ޤ���extconf.rb�� require 'mkmf' �ιԤ��ʤ����ˤϥ��顼
-�ˤʤ�ޤ��Τǡ��������ɲä���
-
-  ruby -r mkmf extconf.rb
-
-�Ȥ��Ƥ���������
-
-�ǥ��쥯�ȥ��ext�ʲ����Ѱդ������ˤ�Ruby���Τ�make�λ���
-��ưŪ��Makefile����������ޤ��Τǡ����Υ��ƥåפ����פǤ���
-
-(9) make����
-
-ưŪ��󥯥饤�֥�������������ˤϤ��ξ��make���Ƥ�����
-����ɬ�פǤ���� make install �ǥ��󥹥ȡ��뤵��ޤ���
-
-ext�ʲ��˥ǥ��쥯�ȥ���Ѱդ������ϡ�Ruby�Υǥ��쥯�ȥ��
-make��¹Ԥ����Makefile����������make��ɬ�פˤ�äƤϤ��Υ�
-���塼���Ruby�ؤΥ�󥯤ޤǼ�ưŪ�˼¹Ԥ��Ƥ���ޤ���
-extconf.rb��񤭴�����ʤɤ���Makefile�κ�������ɬ�פʻ��Ϥ�
-��Ruby�ǥ��쥯�ȥ��make���Ƥ���������
-
-��ĥ�饤�֥���make install��Ruby�饤�֥��Υǥ��쥯�ȥ��
-���˥��ԡ�����ޤ����⤷��ĥ�饤�֥��ȶ�Ĵ���ƻȤ�Ruby�ǵ�
-�Ҥ��줿�ץ�����ब���ꡤRuby�饤�֥����֤��������ˤϡ�
-��ĥ�饤�֥���ѤΥǥ��쥯�ȥ�β��� lib �Ȥ����ǥ��쥯�ȥ�
-���ꡤ������ ��ĥ�� .rb �Υե�������֤��Ƥ�����Ʊ���˥���
-���ȡ��뤵��ޤ���
-
-(10) �ǥХå�
-
-�ޤ����ǥХå����ʤ���ư���ʤ��Ǥ��礦�͡�ext/Setup�˥ǥ���
-���ȥ�̾��񤯤���Ū�˥�󥯤���ΤǥǥХå����Ȥ���褦�ˤ�
-��ޤ�������ʬ����ѥ��뤬�٤��ʤ�ޤ����ɡ�
-
-(11) �Ǥ�������
-
-��Ϥ��ä���Ȥ��ʤꡤ������������ʤꡤ���ʤꡤ����ͳ�ˤ�
-�Ȥ�����������Ruby�κ�Ԥϳ�ĥ�饤�֥��˴ؤ��ư��ڤθ�����
-��ĥ���ޤ���
-
-Appendix A. Ruby�Υ����������ɤ�ʬ��
-
-Ruby�Υ������Ϥ����Ĥ���ʬ�ह�뤳�Ȥ�����ޤ������Τ�������
-���饤�֥�����ʬ�ϴ���Ū�˳�ĥ�饤�֥���Ʊ��������ˤʤ�
-�Ƥ��ޤ��������Υ������Ϻ��ޤǤ������ǤۤȤ������Ǥ����
-�פ��ޤ���
-
-Ruby����Υ���
-
-  class.c
-  error.c
-  eval.c
-  gc.c
-  object.c
-  parse.y
-  variable.c
-
-�桼�ƥ���ƥ��ؿ�
-
-  dln.c
-  regex.c
-  st.c
-  util.c
-
-Ruby���ޥ�ɤμ���
-
-  dmyext.c
-  inits.c
-  main.c
-  ruby.c
-  version.c
-
-���饹�饤�֥��
-
-  array.c
-  bignum.c
-  compar.c
-  dir.c
-  enum.c
-  file.c
-  hash.c
-  io.c
-  marshal.c
-  math.c
-  numeric.c
-  pack.c
-  prec.c
-  process.c
-  random.c
-  range.c
-  re.c
-  signal.c
-  sprintf.c
-  string.c
-  struct.c
-  time.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)
-void Check_SafeStr(VALUE value)
-
-** ���Ѵ�
-
-FIX2INT(value)
-INT2FIX(i)
-NUM2INT(value)
-INT2NUM(i)
-NUM2DBL(value)
-rb_float_new(f)
-STR2CSTR(value)
-rb_str_new2(s)
-
-** ���饹/�⥸�塼�����
-
-VALUE rb_define_class(char *name, VALUE super)
-
-  super�Υ��֥��饹�Ȥ��ƿ�����Ruby���饹��������롥
-
-VALUE rb_define_class_under(VALUE module, char *name, VALUE super)
-
-  super�Υ��֥��饹�Ȥ��ƿ�����Ruby���饹���������module��
-  ����Ȥ���������롥
-
-VALUE rb_define_module(char *name)
-
-  ������Ruby�⥸�塼���������롥
-
-VALUE rb_define_module_under(VALUE module, char *name, VALUE super)
-
-  ������Ruby�⥸�塼����������module������Ȥ���������롥
-
-void rb_include_module(VALUE klass, VALUE module)
-
-  �⥸�塼��򥤥󥯥롼�ɤ��롥class�����Ǥ�module�򥤥�
-  �롼�ɤ��Ƥ�����ˤϲ��⤷�ʤ�(¿�ť��󥯥롼�ɤζػ�)��
-
-void rb_extend_object(VALUE object, VALUE module)
-
-  ���֥������Ȥ�⥸�塼��(���������Ƥ���᥽�å�)�ǳ�ĥ���롥
-
-** ����ѿ����
-
-void rb_define_variable(char *name, VALUE *var)
-
-  Ruby��C�ȤǶ�ͭ���륰�����Х��ѿ���������롥�ѿ�̾��`$'��
-  �Ϥޤ�ʤ����ˤϼ�ưŪ���ɲä���롥name�Ȥ���Ruby�μ��̻�
-  �Ȥ��Ƶ�����ʤ�ʸ��(�㤨��` ')��ޤ���ˤ�Ruby�ץ�����
-  �फ��ϸ����ʤ��ʤ롥
-
-void rb_define_readonly_variable(char *name, VALUE *var)
-
-  Ruby��C�ȤǶ�ͭ����read only�Υ������Х��ѿ���������롥
-  read only�Ǥ��뤳�Ȱʳ���rb_define_variable()��Ʊ����
-
-void rb_define_virtual_variable(char *name,
-				VALUE (*getter)(), VALUE (*setter)())
-
-  �ؿ��ˤ�äƼ¸������Ruby�ѿ���������롥�ѿ������Ȥ��줿
-  ���ˤ�getter�����ѿ����ͤ����åȤ��줿���ˤ�setter���ƤФ�
-  �롥
-
-void rb_define_hooked_variable(char *name, VALUE *var,
-			       VALUE (*getter)(), VALUE (*setter)())
-
-  �ؿ��ˤ�ä�hook�ΤĤ���줿�������Х��ѿ���������롥�ѿ�
-  �����Ȥ��줿���ˤ�getter�����ؿ����ͤ����åȤ��줿���ˤ�
-  setter���ƤФ�롥getter��setter��0����ꤷ�����ˤ�hook��
-  ���ꤷ�ʤ��Τ�Ʊ�����ˤʤ롥
-
-void rb_global_variable(VALUE *var)
-
-  GC�Τ��ᡤRuby�ץ�����फ��ϥ�����������ʤ���, Ruby����
-  �������Ȥ�ޤ�����ѿ���ޡ������롥
-
-** ���
-
-void rb_define_const(VALUE klass, char *name, VALUE val)
-
-  �����������롥
-
-void rb_define_global_const(char *name, VALUE val)
-
-  ��������������롥
-
-     rb_define_const(cKernal, name, val)
-
-  ��Ʊ����̣��
-
-** �᥽�å����
-
-rb_define_method(VALUE klass, 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, char *name, VALUE (*func)(), int argc)
-
-  private�᥽�åɤ�������롥������rb_define_method()��Ʊ����
-
-rb_define_singleton_method(VALUE klass, char *name, VALUE (*func)(), int argc)
-
-  �ðۥ᥽�åɤ�������롥������rb_define_method()��Ʊ����
-
-rb_scan_args(int argc, VALUE *argv, char *fmt, ...)
-
-  argc, argv������Ϳ����줿������ʬ�򤹤롥fmt��ɬ�ܰ����ο�, 
-  �ղð����ο�, �Ĥ�ΰ��������뤫����ꤹ��ʸ�����, "����
-  ����*"�Ȥ��������Ǥ��롥 2 ���ܤο�����"*"�Ϥ��줾���ά��
-  ǽ�Ǥ��롥ɬ�ܰ�������Ĥ�ʤ�����0����ꤹ�롥��3������
-  �ߤ��ѿ��ؤΥݥ��󥿤�, �����������Ǥ������ѿ��˳�Ǽ����롥
-  �ղð������б����������Ϳ�����Ƥ��ʤ������ѿ���Qnil��
-  ��������롥
-
-** Ruby�᥽�åɸƤӽФ�
-
-VALUE rb_funcall(VALUE recv, ID mid, int narg, ...)
-
-  �᥽�åɸƤӽФ���ʸ���󤫤�mid�����뤿��ˤ�rb_intern()��
-  �Ȥ���
-
-VALUE rb_funcall2(VALUE recv, ID mid, int argc, VALUE *argv)
-
-  �᥽�åɸƤӽФ���������argc, argv�������Ϥ���
-
-VALUE rb_eval_string(char *str)
-
-  ʸ�����Ruby������ץȤȤ��ƥ���ѥ��롦�¹Ԥ��롥
-
-ID rb_intern(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, char *name)
-
-  obj�Υ��󥹥����ѿ����ͤ����롥`@'�ǻϤޤ�ʤ����󥹥���
-  ���ѿ��� Ruby�ץ�����फ�饢�������Ǥ��ʤ��ֱ��줿�ץ���
-  �������ѿ��ˤʤ롥�������ʸ����̾������ĥ��饹(�ޤ���
-  �⥸�塼��)�Υ��󥹥����ѿ��Ȥ��Ƽ�������Ƥ��롥
-
-VALUE rb_iv_set(VALUE obj, char *name, VALUE val)
-
-  obj�Υ��󥹥����ѿ���val�˥��åȤ��롥
-
-** ���湽¤
-
-VALUE rb_iterate(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2)
-
-  func2��֥��å��Ȥ������ꤷ, func1�򥤥ƥ졼���Ȥ��ƸƤ֡� 
-  func1�ˤ� arg1�������Ȥ����Ϥ���, func2�ˤ���1�����˥��ƥ졼
-  ������Ϳ����줿��, ��2������arg2���Ϥ���롥
- 
-VALUE rb_yield(VALUE val)
-
-  val���ͤȤ��ƥ��ƥ졼���֥��å���ƤӽФ���
-
-VALUE rb_rescue(VALUE (*func1)(), void *arg1, VALUE (*func2)(), void *arg2)
-
-  �ؿ�func1��arg1������˸ƤӽФ���func1�μ¹�����㳰��ȯ��
-  �������ˤ� func2��arg2������Ȥ��ƸƤ֡�����ͤ��㳰��ȯ��
-  ���ʤ��ä�����func1�������, �㳰��ȯ���������ˤ�func2����
-  ���ͤǤ��롥
-
-VALUE rb_ensure(VALUE (*func1)(), void *arg1, void (*func2)(), void *arg2)
-
-  �ؿ�func1��arg1������Ȥ��Ƽ¹Ԥ�, �¹Խ�λ��(���Ȥ��㳰��
-  ȯ�����Ƥ�) func2��arg2������Ȥ��Ƽ¹Ԥ��롥����ͤ�func1
-  ������ͤǤ���(�㳰��ȯ�������������ʤ�)��
-
-** �㳰�����顼
-
-void rb_warning(char *fmt, ...)
-
-  rb_verbose����ɸ�२�顼���Ϥ˷ٹ�����ɽ�����롥������
-  printf()��Ʊ����
-
-void rb_raise(rb_eRuntimeError, char *fmt, ...)
-
-  RuntimeError�㳰��ȯ�������롥������printf()��Ʊ����
-
-void rb_raise(VALUE exception, char *fmt, ...)
-
-  exception�ǻ��ꤷ���㳰��ȯ�������롥fmt�ʲ��ΰ�����
-  printf()��Ʊ����
-
-void rb_fatal(char *fmt, ...)
-
-  ��̿Ū�㳰��ȯ�������롥�̾���㳰�����ϹԤʤ�줺, ���󥿡�
-  �ץ꥿����λ����(������ensure�ǻ��ꤵ�줿�����ɤϽ�λ����
-  �¹Ԥ����)��
-
-void rb_bug(char *fmt, ...)
-
-  ���󥿡��ץ꥿�ʤɥץ������ΥХ��Ǥ���ȯ������Ϥ��Τʤ�
-  �����λ��Ƥ֡����󥿡��ץ꥿�ϥ�������פ�ľ���˽�λ���롥
-  �㳰�����ϰ��ڹԤʤ��ʤ���
-
-** 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)�����ꤹ�롥
-
-
-Appendix B. extconf.rb�ǻȤ���ؿ�����
-
-extconf.rb����Ǥ����Ѳ�ǽ�ʥ���ѥ���������å��δؿ��ϰ�
-�����̤�Ǥ��롥
-
-have_library(lib, func)
-
-  �ؿ�func��������Ƥ���饤�֥��lib��¸�ߤ�����å����롥
-  �饤�֥�꤬¸�ߤ������true���֤���
-
-find_library(lib, func, path...)
-
-  �ؿ�func��������Ƥ���饤�֥��lib��¸�ߤ� -Lpath ���ɲ�
-  ���ʤ�������å����롥�饤�֥�꤬���դ��ä�����true���֤���
-
-have_func(func, header)
-
-  �إå��ե�����header�򥤥󥯥롼�ɤ��ƴؿ�func��¸�ߤ������
-  �����롥func��ɸ��Ǥϥ�󥯤���ʤ��饤�֥����Τ�ΤǤ�
-  ����ˤ����have_library�Ǥ��Υ饤�֥�������å����Ƥ���
-  �����ؿ���¸�ߤ����true���֤���
-
-have_header(header)
-
-  �إå��ե������¸�ߤ�����å����롥�إå��ե����뤬¸�ߤ�
-  ���true���֤���
-
-find_header(header)
-
-  �إå��ե������¸�ߤ� -Ipath ���ɲä��ʤ�������å����롥
-  �إå��ե����뤬���դ��ä���true���֤���
-
-create_makefile(target)
-
-  ��ĥ�饤�֥���Ѥ�Makefile���������롥���δؿ���ƤФʤ���
-  �Ф��Υ饤�֥��ϥ���ѥ��뤵��ʤ���target�ϥ⥸�塼��̾
-  ��ɽ����
-
-with_config(withval[, default=nil])
-
-  --with-<withval>�ǻ��ꤵ�줿���ץ�����ͤ����롥
-
-dir_config(target)
-
-  --with-<target>-dir, --with-<target>-include, --with-<target>-lib
-  �Τ����줫�ǻ��ꤵ���ǥ��쥯�ȥ�� $CFLAGS �� $LDFLAGS
-  ���ɲä��롥
-
-/*
- * Local variables:
- * fill-column: 60
- * end:
- */
diff --git a/README.ja.md b/README.ja.md
new file mode 100644
index 0000000000..9bbc3a83a5
--- /dev/null
+++ b/README.ja.md
@@ -0,0 +1,176 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![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)
+
+[English](rdoc-ref:README.md)
+
+# Rubyとは
+
+Rubyはシンプルかつ強力なオブジェクト指向スクリプト言語です． Rubyは純粋なオブジェクト指向言語として設計されているので，
+オブジェクト指向プログラミングを手軽に行う事が出来ます．もちろん普通の手続き型のプログラミングも可能です．
+
+Rubyはテキスト処理関係の能力などに優れ，Perlと同じくらい強力です．さらにシンプルな文法と，
+例外処理やイテレータなどの機構によって，より分かりやすいプログラミングが出来ます．
+
+## Rubyの特長
+
+*   シンプルな文法
+*   普通のオブジェクト指向機能(クラス，メソッドコールなど)
+*   特殊なオブジェクト指向機能(Mixin，特異メソッドなど)
+*   演算子オーバーロード
+*   例外処理機能
+*   イテレータとクロージャ
+*   ガーベージコレクタ
+*   ダイナミックローディング (アーキテクチャによる)
+*   移植性が高い．多くのUnix-like/POSIX互換プラットフォーム上で動くだけでなく，Windows， macOS，
+    Haikuなどの上でも動く cf.
+    https://docs.ruby-lang.org/en/master/maintainers_md.html#label-Platform+Maintainers
+
+
+## 入手法
+
+サードパーティーツールを使った方法を含むRubyのインストール方法の一覧は
+
+https://www.ruby-lang.org/ja/downloads/
+
+を参照してください．
+
+### Git
+
+ミラーをGitHubに公開しています． 以下のコマンドでリポジトリを取得できます．
+
+```console
+$ git clone https://github.com/ruby/ruby.git
+```
+
+他のブランチの一覧は次のコマンドで見られます．
+
+```console
+$ git ls-remote https://github.com/ruby/ruby.git
+```
+
+Rubyリポジトリの本来のmasterは https://git.ruby-lang.org/ruby.git にあります．
+コミッタはこちらを使います．
+
+## ホームページ
+
+RubyのホームページのURLは
+
+https://www.ruby-lang.org/
+
+です．
+
+## メーリングリスト
+
+Rubyのメーリングリストがあります．参加希望の方は [ruby-list-request@ml.ruby-lang.org] まで件名に
+
+    join
+
+と書いて送って下さい．
+
+Ruby開発者向けメーリングリストもあります．こちらではrubyのバグ，将来の仕様拡張など実装上の問題について議論されています．
+参加希望の方は [ruby-dev-request@ml.ruby-lang.org] までruby-listと同様の方法でメールしてください．
+
+Ruby拡張モジュールについて話し合うruby-extメーリングリストと数学関係の話題について話し合うruby-mathメーリングリストと
+英語でrubyについて話し合うruby-talkメーリングリストもあります．参加方法はどれも同じです．
+
+[ruby-list-request@ml.ruby-lang.org]: mailto:ruby-list-request@ml.ruby-lang.org?subject=join
+[ruby-dev-request@ml.ruby-lang.org]: mailto:ruby-dev-request@ml.ruby-lang.org?subject=join
+
+## コンパイル・インストール
+
+以下の手順で行ってください．
+
+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](https://docs.ruby-lang.org/en/master/COPYING_ja.html) ファイルを参照してください．
+
+## フィードバック
+
+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.jp b/README.jp
deleted file mode 100644
index e4c8a42eaf..0000000000
--- a/README.jp
+++ /dev/null
@@ -1,199 +0,0 @@
-* Ruby�Ȥ�
-
-Ruby�ϥ���ץ뤫�Ķ��Ϥʥ��֥������Ȼظ�������ץȸ���Ǥ���
-Ruby�Ϻǽ餫����ʥ��֥������Ȼظ�����Ȥ����߷פ���Ƥ���
-�����顤���֥������Ȼظ��ץ�����ߥ󥰤��ڤ˹Ԥ����������
-������������̾�μ�³�����Υץ�����ߥ󥰤��ǽ�Ǥ���
-
-Ruby�ϥƥ����Ƚ����ط���ǽ�Ϥʤɤ�ͥ�졤Perl��Ʊ�����餤����
-�Ǥ�������˥���ץ��ʸˡ�ȡ��㳰�����䥤�ƥ졼���ʤɤε���
-�ˤ�äơ����ʬ����䤹���ץ�����ߥ󥰤�����ޤ���
-
-
-* Ruby����Ĺ
-
-  + ����ץ��ʸˡ
-  + ���̤Υ��֥������Ȼظ���ǽ(���饹���᥽�åɥ�����ʤ�)
-  + �ü�ʥ��֥������Ȼظ���ǽ(Mixin, �ðۥ᥽�åɤʤ�)
-  + �黻�ҥ����С�������
-  + �㳰������ǽ
-  + ���ƥ졼���ȥ���������
-  + �����١������쥯��
-  + �����ʥߥå������ǥ��� (�������ƥ�����ˤ��)
-  + �ܿ������⤤��¿����UNIX���ư�������Ǥʤ���DOS��Windows��
-    Mac��BeOS�ʤɤξ�Ǥ�ư��
-
-
-* ����ˡ
-
-** ftp��
-
-�ʲ��ξ��ˤ����Ƥ���ޤ���
-
-  ftp://ftp.netlab.co.jp/pub/lang/ruby/
-
-** CVS��
-
-  $ cvs -d :pserver:anonymous@cvs.netlab.co.jp:/home/cvs login
-  (Logging in to anonymous@cvs.netlab.co.jp)
-  CVS password: guest
-  $ cvs -d :pserver:anonymous@cvs.netlab.co.jp:/home/cvs checkout ruby
-
-
-* �ۡ���ڡ���
-
-Ruby�Υۡ���ڡ�����URL��
-
-   http://www.ruby-lang.org/
-
-�Ǥ���
-
-
-* �᡼��󥰥ꥹ��
-
-Ruby�Υ᡼��󥰥ꥹ�Ȥ�����ޤ������ô�˾������
-
-   ruby-list-ctl@netlab.co.jp
-
-�ޤ���ʸ��
-
-   subscribe YourFirstName YourFamilyName
-   
-�Ƚ񤤤����äƲ������� 
-
-Ruby��ȯ�Ը����᡼��󥰥ꥹ�Ȥ⤢��ޤ���������Ǥ�ruby�Υ�
-��������λ��ͳ�ĥ�ʤɼ����������ˤĤ��Ƶ�������Ƥ��ޤ���
-���ô�˾������
-
-   ruby-dev-ctl@netlab.co.jp
-
-�ޤ�ruby-list��Ʊ�ͤ���ˡ�ǥ᡼�뤷�Ƥ��������� 
-
-Ruby��ĥ�⥸�塼��ˤĤ����ä��礦ruby-ext�᡼��󥰥ꥹ�Ȥ�
-�Ѹ���ä��礦ruby-talk�᡼��󥰥ꥹ�Ȥ⤢��ޤ���������ˡ
-�Ϥɤ��Ʊ���Ǥ��� 
-
-
-* ����ѥ��롦���󥹥ȡ���
-
-�ʲ��μ��ǹԤäƤ���������
-
-  1. configure��¹Ԥ���Makefile�ʤɤ���������
-
-  2. (ɬ�פʤ��)defines.h���Խ�����
-
-     ¿ʬ��ɬ��̵���Ȼפ��ޤ���
-
-  3. (ɬ�פʤ��)ext/Setup����Ū�˥�󥯤����ĥ�⥸�塼���
-     ���ꤹ��
-
-     ext/Setup�˵��Ҥ����⥸�塼�����Ū�˥�󥯤���ޤ���
-
-     �����ʥߥå������ǥ��󥰤򥵥ݡ��Ȥ��Ƥ��ʤ��������ƥ�
-     ����Ǥ�Setup��1���ܤΡ�option nodynamic�פȤ����ԤΥ�
-     ���Ȥ򳰤�ɬ�פ�����ޤ����ޤ������Υ������ƥ������
-     ��ĥ�⥸�塼������Ѥ��뤿��ˤϡ����餫������Ū�˥��
-     �����Ƥ���ɬ�פ�����ޤ���
-
-  4. make��¹Ԥ��ƥ���ѥ��뤹��
-
-  5. make test�ǥƥ��Ȥ�Ԥ���
-
-     ��test succeeded�פ�ɽ�������������Ǥ����������ƥ���
-     ���������Ƥⴰ�������ݾڤ���Ƥ������ǤϤ���ޤ���
-
-  6. make install
-
-     root�Ǻ�Ȥ���ɬ�פ����뤫�⤷��ޤ���
-
-�⤷������ѥ�����˥��顼��ȯ���������ˤϥ��顼�Υ����ȥ�
-����OS�μ����ޤ�Ǥ�������ܤ�����ݡ��Ȥ��Ԥ����äƤ�
-�������¾�����Τ���ˤ�ʤ�ޤ���
-
-
-* �ܿ�
-
-UNIX�Ǥ����configure���ۤȤ�ɤκ��ۤ�ۼ����Ƥ����Ϥ���
-�������פ�̸���Ȥ������ä����(����˰㤤�ʤ�)����Ԥˤ���
-���Ȥ��ݡ��Ȥ���С����Ǥ��뤫���Τ�ޤ���
-
-�������ƥ�����ˤ�äȤ��¸����Τ�GC���Ǥ���Ruby��GC���о�
-�Υ������ƥ����㤬setjmp()�ˤ�ä����ƤΥ쥸������ jmp_buf��
-��Ǽ���뤳�Ȥȡ�jmp_buf�ȥ����å���32bit���饤����Ȥ����
-���뤳�Ȥ��ꤷ�Ƥ��ޤ����ä����Ԥ���Ω���ʤ������б�����
-��˺���Ǥ��礦����Ԥβ������Ū��ñ�ǡ�gc.c�ǥ����å���
-�ޡ������Ƥ�����ʬ�˥��饤����ȤΥХ��ȿ��������餷�ƥޡ�
-�����륳���ɤ��ɲä�������ǺѤߤޤ�����defined(THINK_C)�פ�
-����Ƥ�����ʬ�򻲹ͤˤ��Ƥ�������
-
-# �ºݤˤ�Ruby��Think C�Ǥϥ���ѥ���Ǥ��ޤ���
-
-�쥸����������ɥ������CPU�Ǥϡ��쥸����������ɥ��򥹥���
-���˥ե�å��夹�륢����֥饳���ɤ��ɲä���ɬ�פ����뤫����
-��ޤ���
-
-
-* ���۾��
-
-�ܥץ������ϥե꡼���եȥ������Ǥ���GPL(the GNU General
-Public License)�ޤ��ϰʲ��˼��������ܥץ�����������ۤ�
-���ޤ���GPL�ˤĤ��Ƥ�COPYING�ե�����򻲾Ȥ��Ʋ�������
-
-  1. ʣ�������¤ʤ���ͳ�Ǥ���
-
-  2. �ʲ��ξ��Τ����줫�������������ܥץ������Υ�������
-     ��ͳ���ѹ��Ǥ��ޤ���
-
-     (a) �ͥåȥ˥塼���˥ݥ��Ȥ����ꡤ��Ԥ��ѹ������դ���
-         �ʤɤ���ˡ�ǡ��ѹ���������롥
-
-     (b) �ѹ������ܥץ�������ʬ�ν�°�����ȿ�����������
-         �Ȥ���
-
-     (c) �ѹ����������������������եȥ�������̾�����ѹ����롥
-         ���Υ��եȥ����������ۤ�����ˤ��ѹ������ܥץ�����
-         ���Ʊ�������ۤ��롥�ޤ����ѹ������ܥץ������Υ���
-         ��������ˡ���������롥
-
-     (d) ����¾���ѹ������Ԥȹ�դ��롥
-
-  3. �ʲ��ξ��Τ����줫�������������ܥץ������򥳥�ѥ�
-     �뤷�����֥������ȥ����ɤ�¹Է����Ǥ����ۤǤ��ޤ���
-
-     (a) �Х��ʥ�������ä��ͤ�������������Ǥ���褦�ˡ�
-         ������������ˡ���������롥
-
-     (b) �������ɤʥ����������ɤ�ź�դ��롥
-
-     (c) �ѹ���Ԥä��Х��ʥ��̾�����ѹ��������������ꥸ��
-         ��Υ����������ɤ�����ˡ���������롥
-
-     (d) ����¾�����۾����Ԥȹ�դ��롥
-
-  4. ¾�Υץ������ؤΰ��ѤϤ����ʤ���Ū�Ǥ��켫ͳ�Ǥ�����
-     �������ܥץ������˴ޤޤ��¾�κ�Ԥˤ�륳���ɤϡ���
-     �줾��κ�Ԥΰո��ˤ�����¤��ä������礬����ޤ���
-
-     ����Ū�ˤ�gc.c(����)��util.c(����)��st.[ch]��regex.[ch] 
-     ����� ./missing�ǥ��쥯�ȥ겼�Υե����뷲���������ޤ���
-     ���줾������۾��ʤɤ��դ��Ƥϳƥե�����򻲾Ȥ��Ƥ�
-     ��������
-
-  5. �ܥץ������ؤ����ϤȤʤ륹����ץȤ���ӡ��ܥץ�����
-     �फ��ν��Ϥθ������ܥץ������κ�ԤǤϤʤ������줾
-     ��������Ϥ����������ͤ�°���ޤ����ޤ����ܥץ�������
-     �Ȥ߹��ޤ�뤿��γ�ĥ�饤�֥��ˤĤ��Ƥ�Ʊ�ͤǤ���
-
-  6. �ܥץ�������̵�ݾڤǤ�����Ԥ��ܥץ������򥵥ݡ���
-     ����ջ֤Ϥ���ޤ������ץ�����༫�ȤΥХ����뤤���ܥ�
-     �������μ¹Ԥʤɤ���ȯ�����뤤���ʤ�»�����Ф��Ƥ���
-     Ǥ������ޤ���
-
-* ����
-
-�����ȡ��Х���ݡ��Ȥ���¾�� matz@zetabis.com �ޤǡ�
--------------------------------------------------------
-created at: Thu Aug  3 11:57:36 JST 1995
-Local variables:
-mode: indented-text
-end:
diff --git a/README.md b/README.md
new file mode 100644
index 0000000000..02435b419e
--- /dev/null
+++ b/README.md
@@ -0,0 +1,96 @@
+[![Actions Status: MinGW](https://github.com/ruby/ruby/workflows/MinGW/badge.svg)](https://github.com/ruby/ruby/actions?query=workflow%3A"MinGW")
+[![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")
+[![Travis Status](https://app.travis-ci.com/ruby/ruby.svg?branch=master)](https://app.travis-ci.com/ruby/ruby)
+
+[日本語](rdoc-ref:README.ja.md)
+
+# 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://docs.ruby-lang.org/en/master/maintainers_md.html#label-Platform+Maintainers
+
+## How to get Ruby
+
+For a complete list of ways to install Ruby, including using third-party tools
+like rvm, see:
+
+https://www.ruby-lang.org/en/downloads/
+
+You can download release packages and the snapshot of the repository. If you want to
+download whole versions of Ruby, please visit https://www.ruby-lang.org/en/downloads/releases/.
+
+### Download with Git
+
+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](https://docs.ruby-lang.org/en/master/contributing/building_ruby_md.html)
+
+## 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:
+
+    join
+
+in the mail subject (not body) to the address [ruby-talk-request@ml.ruby-lang.org].
+
+[ruby-talk-request@ml.ruby-lang.org]: mailto:ruby-talk-request@ml.ruby-lang.org?subject=join
+
+## 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/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/ToDo b/ToDo
deleted file mode 100644
index 8478dd4392..0000000000
--- a/ToDo
+++ /dev/null
@@ -1,121 +0,0 @@
-Language Spec.
-
-- def foo; .. rescue .. end
-- compile time string concatenation, "hello" "world" => "helloworld"
-- rescue modifier; a rescue b => begin a rescue; b end
-- %w(a\ b\ c abc) => ["a b c", "abc"]
-- objectify symbols
-- class variable (prefix @@)
-- rescue RuntimeError => err
-* operator !! for rescue. ???
-* objectify characters
-* ../... outside condition invokes operator method too.
-* ... inside condition turns off just before right condition.???
-* package or access control for global variables??
-* named arguments like foo(nation:="german") or foo(nation: "german").
-* method to retrieve argument information (needs new C API)
-* multiple return values, yield values.  maybe incompatible ???
-* cascading method invocation ???
-* def Class#method .. end ??
-* class Foo::Bar<Baz .. end, module Boo::Bar .. end
-* def Foo::Bar::baz() .. end ??
-* I18N (or M17N) script/string/regexp
-* Fixnum 0 as false ????
-* discourage use of symbol variable (e.g. $/, etc.) in manual
-* discourage use of Perlish features by giving warnings.
-* `exception' method to be alternative for `$!'. ??
-* non confusing in-block local variable (is it possible?)
-  + remove scope by block
-  + variables appears within block may have independent values.
-
-Hacking Interpreter
-
-- use eban's fnmatch
-- RUBYOPT environment variable
-- alias $defout $>
-- retrieve STACK_LEVEL_MAX from users' limit.
-- remove end_proc registered out of require only
-- all object made freezable
-* non-blocking open (e.g. for named pipe) for thread
-* avoid blocking with gethostbyname/gethostbyaddr (use fork ???)
-* objectify interpreters ???
-* remove rb_eval() recursions
-* syntax tree -> bytecode ???
-* scrambled script, or script filter
-* setuid ruby
-* performance tune for in-block (dynamic) local variables.
-* generational GC ?
-* give warnings to assign magic variables.
-* export rb_io_{addstr,printf,puts,print}
-
-Standard Libraries
-
-- hash[key] = nil does not remove entry; hashes may have nil as the value.
-- hash.fetch(key) raises exception if key is not found.
-- Array#{first,last,at}
-- Dir.glob(pat){|f|...}
-- sprintf/printf's $ to specify argument order
-- Dir.glob("**/*.c") ala zsh
-- Remove Enumerable#{size,length}
-- Array#slice, Array#slice!
-- String#slice, String#slice!
-- Marshal should handle generic instance variables.
-- debugger for thread programming
-- SyntaxError, NameError, LoadError and NotImplementError are subclasses of
-  ScriptError<Exception, not StandardError.
-- Thread::start gives arguments, not a thread object to the block
-- regexp: (?>..), \G
-- Struct::new([name,]member,...)
-- IO#reopen accepts path as well
-- Kernel#scan
-- call initialize for builtin classes too
-- performance tune for String's non-bang methods.
-- 'w' template for pack/unpack
-- alternative for interator? => block_given?
-- regex - /p (make obsolete), /m (new)
-- consistent /, %, divmod
-- unbound method object
-- integrate final.rb into the core.
-* Enumerable#sort_by for Schwartzian transformation
-* String#scanf(?)
-* Object#fmt(?)
-* Integer#{bin,oct,hex,heX}
-* Time::strptime
-* Integer[num], Float[num];  Fixnum[num]?
-* method to retrieve non-number trailer for to_i/to_f.
-* Stream or Port, abstract superclass of IO ?
-* String#{pred,prev}, String#downto
-* optional stepsize argument for succ()
-* Ruby module -- Ruby::Version, Ruby::Interpreter
-* introduce Boolean class; super of TrueClass, FalseClass
-* Process::waitall [ruby-talk:4557]
-
-Extension Libraries
-
-- FastCGI ruby
-* ptk.rb pTk wrapper that is compatible to tk.rb
-* Berkeley DB extension
-* BitVector
-
-Ruby Libraries
-
-- net/http.rb
-* add uri.rb
-* urllib.rb, nttplib.rb, etc.
-* format like perl's
-
-Tools
-
-- extension library maker using SWIG
-* freeze or undump to bundle everything
-
-Misc
-
-- publish Ruby books
-* publish Ruby books in English
-
-Things To Do Before 1.6
-
-* fix spec. for the following:
-
-  * mkmf.rb - create_makefile("net/socket")
diff --git a/install-sh b/aclocal.m4
index e69de29bb2..e69de29bb2 100644
--- a/install-sh
+++ b/aclocal.m4
diff --git a/addr2line.c b/addr2line.c
new file mode 100644
index 0000000000..19a6a425c1
--- /dev/null
+++ b/addr2line.c
@@ -0,0 +1,2721 @@
+/**********************************************************************
+
+  addr2line.c -
+
+  $Author$
+
+  Copyright (C) 2010 Shinichiro Hamaji
+
+**********************************************************************/
+
+#if defined(__clang__) && defined(__has_warning)
+#if __has_warning("-Wgnu-empty-initializer")
+#pragma clang diagnostic ignored "-Wgnu-empty-initializer"
+#endif
+#if __has_warning("-Wgcc-compat")
+#pragma clang diagnostic ignored "-Wgcc-compat"
+#endif
+#endif
+
+#include "ruby/internal/config.h"
+#include "ruby/defines.h"
+#include "ruby/missing.h"
+#include "addr2line.h"
+
+#include <stdio.h>
+#include <errno.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>
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/mman.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+
+/* Make alloca work the best possible way.  */
+#ifdef __GNUC__
+# ifndef alloca
+#  define alloca __builtin_alloca
+# endif
+#else
+# ifdef HAVE_ALLOCA_H
+#  include <alloca.h>
+# else
+#  ifdef _AIX
+#pragma alloca
+#  else
+#   ifndef alloca                /* predefined by HP cc +Olibcalls */
+void *alloca();
+#   endif
+#  endif /* AIX */
+# endif        /* HAVE_ALLOCA_H */
+# ifndef UNREACHABLE
+#  define UNREACHABLE __builtin_unreachable()
+# endif
+# ifndef UNREACHABLE_RETURN
+#  define UNREACHABLE_RETURN(_) __builtin_unreachable()
+# endif
+#endif /* __GNUC__ */
+
+#ifndef UNREACHABLE
+# define UNREACHABLE abort()
+#endif
+#ifndef UNREACHABLE_RETURN
+# define UNREACHABLE_RETURN(_) return (abort(), (_))
+#endif
+
+#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
+#else /* compatibility with glibc < 2.22 */
+# define SHF_COMPRESSED 0
+#endif
+
+#ifndef PATH_MAX
+#define PATH_MAX 4096
+#endif
+
+#define DW_LNS_copy                     0x01
+#define DW_LNS_advance_pc               0x02
+#define DW_LNS_advance_line             0x03
+#define DW_LNS_set_file                 0x04
+#define DW_LNS_set_column               0x05
+#define DW_LNS_negate_stmt              0x06
+#define DW_LNS_set_basic_block          0x07
+#define DW_LNS_const_add_pc             0x08
+#define DW_LNS_fixed_advance_pc         0x09
+#define DW_LNS_set_prologue_end         0x0a /* DWARF3 */
+#define DW_LNS_set_epilogue_begin       0x0b /* DWARF3 */
+#define DW_LNS_set_isa                  0x0c /* DWARF3 */
+
+/* Line number extended opcode name. */
+#define DW_LNE_end_sequence             0x01
+#define DW_LNE_set_address              0x02
+#define DW_LNE_define_file              0x03
+#define DW_LNE_set_discriminator        0x04  /* DWARF4 */
+
+#define kprintf(...) fprintf(errout, "" __VA_ARGS__)
+
+typedef struct line_info {
+    const char *dirname;
+    const char *filename;
+    const char *path; /* object path */
+    int line;
+
+    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) {
+        UNREACHABLE_RETURN(0);
+    }
+    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 + 1];
+
+static unsigned long
+uleb128(const char **p)
+{
+    unsigned long r = 0;
+    int s = 0;
+    for (;;) {
+        unsigned char b = (unsigned char)*(*p)++;
+        if (b < 0x80) {
+            r += (unsigned long)b << s;
+            break;
+        }
+        r += (b & 0x7f) << s;
+        s += 7;
+    }
+    return r;
+}
+
+static long
+sleb128(const char **p)
+{
+    long r = 0;
+    int s = 0;
+    for (;;) {
+        unsigned char b = (unsigned char)*(*p)++;
+        if (b < 0x80) {
+            if (b & 0x40) {
+                r -= (0x80 - b) << s;
+            }
+            else {
+                r += (b & 0x3f) << s;
+            }
+            break;
+        }
+        r += (b & 0x7f) << s;
+        s += 7;
+    }
+    return r;
+}
+
+static const char *
+get_nth_dirname(unsigned long dir, const char *p, FILE *errout)
+{
+    if (!dir--) {
+        return "";
+    }
+    while (dir--) {
+        while (*p) p++;
+        p++;
+        if (!*p) {
+            kprintf("Unexpected directory number %lu in %s\n",
+                    dir, binary_filename);
+            return "";
+        }
+    }
+    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, FILE *errout);
+
+static void
+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, FILE *errout)
+{
+    int i;
+    const char *p = filenames;
+    const char *filename;
+    unsigned long dir;
+    if (version >= 5) {
+        const char *path;
+        uint64_t directory_index = -1;
+        parse_ver5_debug_line_header(filenames, file, format, obj, &path, &directory_index, errout);
+        line->filename = path;
+        parse_ver5_debug_line_header(include_directories, (int)directory_index, format, obj, &path, NULL, errout);
+        line->dirname = path;
+    }
+    else {
+        for (i = 1; i <= file; i++) {
+            filename = p;
+            if (!*p) {
+#ifndef __APPLE__
+                /* Need to output binary file name? */
+                kprintf("Unexpected file number %d in %s at %tx\n",
+                        file, binary_filename, filenames - obj->mapped);
+#endif
+                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, errout);
+            }
+        }
+    }
+}
+
+static void
+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, FILE *errout)
+{
+    int i;
+    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, format, version, include_directories, filenames, &lines[i], obj, errout);
+            lines[i].line = line;
+        }
+    }
+}
+
+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, FILE *errout)
+{
+    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;
+    }
+
+    header->cu_end = p + header->unit_length;
+
+    header->version = *(uint16_t *)p;
+    p += sizeof(uint16_t);
+    if (header->version > 5) return -1;
+
+    if (header->version >= 5) {
+        /* address_size = *(uint8_t *)p++; */
+        /* segment_selector_size = *(uint8_t *)p++; */
+        p += 2;
+    }
+
+    header->header_length = header->format == 4 ? *(uint32_t *)p : *(uint64_t *)p;
+    p += header->format;
+    header->cu_start = p + header->header_length;
+
+    header->minimum_instruction_length = *(uint8_t *)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++;
+    }
+
+    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, errout);
+        header->filenames = p;
+    }
+    else {
+        header->include_directories = p;
+
+        /* temporary measure for compress-debug-sections */
+        if (p >= header->cu_end) return -1;
+
+        /* skip include directories */
+        while (*p) {
+            p = memchr(p, '\0', header->cu_end - p);
+            if (!p) return -1;
+            p++;
+        }
+        p++;
+
+        header->filenames = p;
+    }
+
+    *pp = header->cu_start;
+
+    return 0;
+}
+
+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, FILE *errout)
+{
+    const char *p = (const char *)*debug_line;
+    struct LineNumberProgramHeader header;
+
+    /* 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; */
+
+    if (parse_debug_line_header(obj, &p, &header, errout))
+        return -1;
+    is_stmt = header.default_is_stmt;
+
+#define FILL_LINE()                                                 \
+    do {                                                            \
+        fill_line(num_traces, traces, addr, file, line,             \
+                  header.format,                                    \
+                  header.version,                                   \
+                  header.include_directories,                       \
+                  header.filenames,                                 \
+                  obj, lines, offset, errout);                      \
+        /*basic_block = prologue_end = epilogue_begin = 0;*/        \
+    } while (0)
+
+    while (p < header.cu_end) {
+        unsigned long a;
+        unsigned char op = *p++;
+        switch (op) {
+        case DW_LNS_copy:
+            FILL_LINE();
+            break;
+        case DW_LNS_advance_pc:
+            a = uleb128(&p) * header.minimum_instruction_length;
+            addr += a;
+            break;
+        case DW_LNS_advance_line: {
+            long a = sleb128(&p);
+            line += a;
+            break;
+        }
+        case DW_LNS_set_file:
+            file = (unsigned int)uleb128(&p);
+            break;
+        case DW_LNS_set_column:
+            /*column = (unsigned int)*/(void)uleb128(&p);
+            break;
+        case DW_LNS_negate_stmt:
+            is_stmt = !is_stmt;
+            break;
+        case DW_LNS_set_basic_block:
+            /*basic_block = 1; */
+            break;
+        case DW_LNS_const_add_pc:
+            a = ((255UL - header.opcode_base) / header.line_range) *
+                header.minimum_instruction_length;
+            addr += a;
+            break;
+        case DW_LNS_fixed_advance_pc:
+            a = *(uint16_t *)p;
+            p += sizeof(uint16_t);
+            addr += a;
+            break;
+        case DW_LNS_set_prologue_end:
+            /* prologue_end = 1; */
+            break;
+        case DW_LNS_set_epilogue_begin:
+            /* epilogue_begin = 1; */
+            break;
+        case DW_LNS_set_isa:
+            /* isa = (unsigned int)*/(void)uleb128(&p);
+            break;
+        case 0:
+            a = uleb128(&p);
+            op = *p++;
+            switch (op) {
+            case DW_LNE_end_sequence:
+                /* end_sequence = 1; */
+                FILL_LINE();
+                addr = 0;
+                file = 1;
+                line = 1;
+                /* column = 0; */
+                is_stmt = header.default_is_stmt;
+                /* end_sequence = 0; */
+                /* isa = 0; */
+                break;
+            case DW_LNE_set_address:
+                addr = *(unsigned long *)p;
+                p += sizeof(unsigned long);
+                break;
+            case DW_LNE_define_file:
+                kprintf("Unsupported operation in %s\n",
+                        binary_filename);
+                break;
+            case DW_LNE_set_discriminator:
+                /* TODO:currently ignore */
+                uleb128(&p);
+                break;
+            default:
+                kprintf("Unknown extended opcode: %d in %s\n",
+                        op, binary_filename);
+            }
+            break;
+        default: {
+            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 = (char *)p;
+    return 0;
+}
+
+static int
+parse_debug_line(int num_traces, void **traces,
+                 const char *debug_line, unsigned long size,
+                 obj_info_t *obj, line_info_t *lines, int offset, FILE *errout)
+{
+    const char *debug_line_end = debug_line + size;
+    while (debug_line < debug_line_end) {
+        if (parse_debug_line_cu(num_traces, traces, &debug_line, obj, lines, offset, errout))
+            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, FILE *errout);
+
+static void
+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(const char *debuglink, int num_traces, void **traces,
+                 obj_info_t **objp, line_info_t *lines, int offset, FILE *errout)
+{
+    static const char global_debug_dir[] = "/usr/lib/debug";
+    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) {
+        return;
+    }
+    p[1] = '\0';
+
+    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, errout);
+}
+
+// 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, FILE *errout)
+{
+    static const char global_debug_dir[] = "/usr/lib/debug/.build-id/";
+    static const char debug_suffix[] = ".debug";
+    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 + build_id_size * 2 + sizeof(debug_suffix)) 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++ = '/';
+    }
+    memcpy(p, debug_suffix, sizeof(debug_suffix));
+
+    append_obj(objp);
+    o2 = *objp;
+    o2->base_addr = o1->base_addr;
+    o2->path = o1->path;
+    fill_lines(num_traces, traces, 0, objp, lines, offset, errout);
+}
+#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,
+
+    /* GNU extensions for referring to .gnu_debugaltlink dwz-compressed info */
+    DW_FORM_GNU_ref_alt = 0x1f20,
+    DW_FORM_GNU_strp_alt = 0x1f21
+};
+
+/* 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);
+}
+
+static void
+debug_info_reader_init(DebugInfoReader *reader, obj_info_t *obj)
+{
+    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, FILE *errout)
+{
+    const char *p;
+    struct LineNumberProgramHeader header;
+
+    p = (const char *)reader->debug_line_cu_end;
+    if (parse_debug_line_header(reader->obj, &p, &header, errout))
+        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 bool
+debug_info_reader_read_addr_value_member(DebugInfoReader *reader, DebugInfoValue *v, int size)
+{
+    if (size == 4) {
+        set_uint_value(v, read_uint32(&reader->p));
+    } else if (size == 8) {
+        set_uint_value(v, read_uint64(&reader->p));
+    } else {
+        return false;
+    }
+    return true;
+}
+
+#define debug_info_reader_read_addr_value(reader, v, mem) \
+    if (!debug_info_reader_read_addr_value_member((reader), (v), (reader)->mem)) { \
+        kprintf("unknown " #mem ":%d", (reader)->mem); \
+        return false; \
+    }
+
+
+static bool
+debug_info_reader_read_value(DebugInfoReader *reader, uint64_t form, DebugInfoValue *v, FILE *errout)
+{
+    switch (form) {
+      case DW_FORM_addr:
+        debug_info_reader_read_addr_value(reader, v, address_size);
+        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, address_size);
+        } else {
+            debug_info_reader_read_addr_value(reader, v, format);
+        }
+        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;
+      /* we have no support for actually reading the real values of these refs out
+       * of the .gnu_debugaltlink dwz-compressed debuginfo at the moment, but "read"
+       * them anyway so that we advance the reader by the right amount. */
+      case DW_FORM_GNU_ref_alt:
+      case DW_FORM_GNU_strp_alt:
+        read_uint(reader);
+        set_uint_value(v, 0);
+        break;
+      case 0:
+        goto fail;
+        break;
+    }
+    return true;
+
+  fail:
+    kprintf("%d: unsupported form: %#"PRIx64"\n", __LINE__, form);
+    return false;
+}
+
+/* find abbrev in current compilation unit */
+static const char *
+di_find_abbrev(DebugInfoReader *reader, uint64_t abbrev_number, FILE *errout)
+{
+    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) {
+            kprintf("%d: Abbrev Number %"PRId64" not found\n",__LINE__, abbrev_number);
+            return NULL;
+        }
+        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, FILE *errout)
+{
+    size_t i;
+    kprintf("     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:
+            kprintf("%02" PRIdSIZE ": %02X ", i/16, p[i]);
+            break;
+          case 15:
+            kprintf("%02X\n", p[i]);
+            break;
+          default:
+            kprintf("%02X ", p[i]);
+            break;
+        }
+    }
+    if ((i & 15) != 15) {
+        kprintf("\n");
+    }
+}
+#define hexdump(p,n,e) hexdump0((const unsigned char *)p, n, e)
+
+static void
+div_inspect(DebugInfoValue *v, FILE *errout)
+{
+    switch (v->type) {
+      case VAL_uint:
+        kprintf("%d: type:%d size:%" PRIxSIZE " v:%"PRIx64"\n",__LINE__,v->type,v->size,v->as.uint64);
+        break;
+      case VAL_int:
+        kprintf("%d: type:%d size:%" PRIxSIZE " v:%"PRId64"\n",__LINE__,v->type,v->size,(int64_t)v->as.uint64);
+        break;
+      case VAL_cstr:
+        kprintf("%d: type:%d size:%" PRIxSIZE " v:'%s'\n",__LINE__,v->type,v->size,v->as.ptr);
+        break;
+      case VAL_data:
+        kprintf("%d: type:%d size:%" PRIxSIZE " v:\n",__LINE__,v->type,v->size);
+        hexdump(v->as.ptr, 16, errout);
+        break;
+    }
+}
+#endif
+
+static DIE *
+di_read_die(DebugInfoReader *reader, DIE *die, FILE *errout)
+{
+    uint64_t abbrev_number = uleb128(&reader->p);
+    if (abbrev_number == 0) {
+        reader->level--;
+        return NULL;
+    }
+
+    if (!(reader->q = di_find_abbrev(reader, abbrev_number, errout))) return NULL;
+
+    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, FILE *errout)
+{
+    uint64_t at = uleb128(&reader->q);
+    uint64_t form = uleb128(&reader->q);
+    if (!at || !form) return NULL;
+    vp->at = at;
+    vp->form = form;
+    if (!debug_info_reader_read_value(reader, form, vp, errout)) return NULL;
+    return vp;
+}
+
+static bool
+di_skip_records(DebugInfoReader *reader, FILE *errout)
+{
+    for (;;) {
+        DebugInfoValue v = {{0}};
+        uint64_t at = uleb128(&reader->q);
+        uint64_t form = uleb128(&reader->q);
+        if (!at || !form) return true;
+        if (!debug_info_reader_read_value(reader, form, &v, errout)) return false;
+    }
+}
+
+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 bool
+addr_header_init(obj_info_t *obj, addr_header_t *header, FILE *errout)
+{
+    const char *p = obj->debug_addr.ptr;
+
+    header->ptr = p;
+
+    if (!p) return true;
+
+    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++;
+    if (header->address_size != 4 && header->address_size != 8) {
+        kprintf("unknown address_size:%d", header->address_size);
+        return false;
+    }
+    p++; /* segment_selector_size */
+    return true;
+}
+
+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 bool
+rnglists_header_init(obj_info_t *obj, rnglists_header_t *header, FILE *errout)
+{
+    const char *p = obj->debug_rnglists.ptr;
+
+    if (!p) return true;
+
+    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++;
+    if (header->address_size != 4 && header->address_size != 8) {
+        kprintf("unknown address_size:%d", header->address_size);
+        return false;
+    }
+    p++; /* segment_selector_size */
+    header->offset_entry_count = *(uint32_t *)p;
+    return true;
+}
+
+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, FILE *errout)
+{
+    const char *p = *ptr;
+    *ptr = p + reader->address_size;
+    if (reader->address_size == 4) {
+        return read_uint32(&p);
+    } else {
+        return read_uint64(&p);
+    }
+}
+
+static uintptr_t
+ranges_include(DebugInfoReader *reader, ranges_t *ptr, uint64_t addr, rnglists_header_t *rnglists_header, FILE *errout)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            return UINTPTR_MAX;
+        }
+        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, errout);
+                    base_valid = true;
+                    break;
+                  case DW_RLE_start_end:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p, errout);
+                    to = (uintptr_t)read_dw_form_addr(reader, &p, errout);
+                    break;
+                  case DW_RLE_start_length:
+                    from = (uintptr_t)read_dw_form_addr(reader, &p, errout);
+                    to = from + uleb128(&p);
+                    break;
+                }
+                if (from <= addr && addr < to) {
+                    return from;
+                }
+            }
+            return 0;
+        }
+        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 0;
+}
+
+#if 0
+static void
+ranges_inspect(DebugInfoReader *reader, ranges_t *ptr, FILE *errout)
+{
+    if (ptr->high_pc_set) {
+        if (ptr->ranges_set || !ptr->low_pc_set) {
+            kprintf("low_pc_set:%d high_pc_set:%d ranges_set:%d\n",ptr->low_pc_set,ptr->high_pc_set,ptr->ranges_set);
+            return;
+        }
+        kprintf("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;
+        kprintf("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;
+            kprintf("%"PRIx64"-%"PRIx64" ",ptr->low_pc+from,ptr->low_pc+to);
+        }
+        kprintf("\n");
+    }
+    else if (ptr->low_pc_set) {
+        kprintf("low_pc:%"PRIx64"\n",ptr->low_pc);
+    }
+    else {
+        kprintf("empty\n");
+    }
+}
+#endif
+
+static int
+di_read_cu(DebugInfoReader *reader, FILE *errout)
+{
+    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);
+    }
+    if (reader->address_size != 4 && reader->address_size != 8) {
+        kprintf("unknown address_size:%d", reader->address_size);
+        return -1;
+    }
+    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, errout)) return -1;
+
+    do {
+        DIE die;
+
+        if (!di_read_die(reader, &die, errout)) continue;
+
+        if (die.tag != DW_TAG_compile_unit) {
+            if (!di_skip_records(reader, errout)) return -1;
+            break;
+        }
+
+        reader->current_str_offsets_base = 0;
+        reader->current_addr_base = 0;
+        reader->current_rnglists_base = 0;
+
+        DebugInfoValue low_pc = {{0}};
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{0}};
+            if (!di_read_record(reader, &v, errout)) 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 = {0};
+                    if (!addr_header_init(reader->obj, &header, errout)) return -1;
+                    reader->current_low_pc = read_addr(&header, reader->current_addr_base, low_pc.as.addr_idx);
+                }
+                break;
+        }
+    } while (0);
+
+    return 0;
+}
+
+static void
+read_abstract_origin(DebugInfoReader *reader, uint64_t form, uint64_t abstract_origin, line_info_t *line, FILE *errout)
+{
+    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, errout)) goto finish;
+
+    /* enumerate abbrev */
+    for (;;) {
+        DebugInfoValue v = {{0}};
+        if (!di_read_record(reader, &v, errout)) 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 bool
+debug_info_read(DebugInfoReader *reader, int num_traces, void **traces,
+                line_info_t *lines, int offset, FILE *errout)
+{
+
+    addr_header_t addr_header = {0};
+    if (!addr_header_init(reader->obj, &addr_header, errout)) return false;
+
+    rnglists_header_t rnglists_header = {0};
+    if (!rnglists_header_init(reader->obj, &rnglists_header, errout)) return false;
+
+    while (reader->p < reader->cu_end) {
+        DIE die;
+        ranges_t ranges = {0};
+        line_info_t line = {0};
+
+        if (!di_read_die(reader, &die, errout)) continue;
+        /* kprintf("%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:
+            if (!di_skip_records(reader, errout)) return false;
+            continue;
+        }
+
+        /* enumerate abbrev */
+        for (;;) {
+            DebugInfoValue v = {{0}};
+            /* ptrdiff_t pos = reader->p - reader->p0; */
+            if (!di_read_record(reader, &v, errout)) break;
+            /* kprintf("\n%d:%tx: AT:%lx FORM:%lx\n",__LINE__,pos,v.at,v.form); */
+            /* div_inspect(&v, errout); */
+            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, errout);
+                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, errout);
+                break; /* goto skip_die; */
+            }
+        }
+        /* ranges_inspect(reader, &ranges, errout); */
+        /* kprintf("%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, errout);
+            if (saddr == UINTPTR_MAX) return false;
+            if (saddr) {
+                /* kprintf("%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;
+            }
+        }
+    }
+    return true;
+}
+
+// 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, FILE *errout)
+{
+    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 = {0};
+    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 = {{0}};
+            unsigned long dw_lnct = uleb128(&format);
+            unsigned long dw_form = uleb128(&format);
+            if (!debug_info_reader_read_value(&reader, dw_form, &v, errout)) return 0;
+            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, FILE *errout)
+{
+    int i, j;
+    char *shstr;
+    ElfW(Ehdr) *ehdr;
+    ElfW(Shdr) *shdr, *shstr_shdr;
+    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) {
+        goto fail;
+    }
+    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);
+
+    ehdr = (ElfW(Ehdr) *)file;
+    if (memcmp(ehdr->e_ident, "\177ELF", 4) != 0) {
+        /*
+         * Huh? Maybe filename was overridden by setproctitle() and
+         * it match non-elf file.
+         */
+        goto fail;
+    }
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
+
+    shdr = (ElfW(Shdr) *)(file + ehdr->e_shoff);
+
+    shstr_shdr = shdr + ehdr->e_shstrndx;
+    shstr = file + shstr_shdr->sh_offset;
+
+    for (i = 0; i < ehdr->e_shnum; 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;
+          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 == 0) {
+        /* main executable */
+        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 (obj->debug_info.ptr && obj->debug_abbrev.ptr) {
+        DebugInfoReader reader;
+        debug_info_reader_init(&reader, obj);
+        i = 0;
+        while (reader.p < reader.pend) {
+            /* kprintf("%d:%tx: CU[%d]\n", __LINE__, reader.p - reader.obj->debug_info.ptr, i++); */
+            if (di_read_cu(&reader, errout)) goto use_symtab;
+            if (!debug_info_read(&reader, num_traces, traces, lines, offset, errout))
+                goto use_symtab;
+        }
+    }
+    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,
+                             objp, lines, offset, errout);
+        }
+        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, errout);
+        }
+        goto finish;
+    }
+
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset, errout) == -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, FILE *errout)
+{
+# 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;
+            }
+        }
+    }
+
+    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);
+
+    obj->mapped = file;
+    obj->mapped_size = (size_t)filesize;
+
+    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);
+        /* kprintf("%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);
+            /* kprintf("%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 {
+# ifdef __LP64__
+#   define bitsize "64"
+# else
+#   define bitsize "32"
+# endif
+        kprintf("'%s' is not a " bitsize
+                "-bit Mach-O file!\n",binary_filename);
+# undef bitsize
+        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
+#ifdef __APPLE__
+                                    /* macOS clang 16 generates DWARF5, which have Mach-O
+                                     * section names that are limited to 16 characters,
+                                     * which causes sections with long names to be truncated
+                                     * and not match above.
+                                     * See: https://wiki.dwarfstd.org/Best_Practices.md#Mach-2d-O
+                                     */
+                                    && strncmp(sect->sectname, debug_section_names[j], 16) != 0
+#endif
+                                )
+                                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, errout)) goto fail;
+            if (!debug_info_read(&reader, num_traces, traces, lines, offset, errout))
+                goto fail;
+        }
+    }
+
+    if (parse_debug_line(num_traces, traces,
+            obj->debug_line.ptr,
+            obj->debug_line.size,
+            obj, lines, offset, errout) == -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(FILE *errout)
+ *
+ * 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(FILE *errout)
+{
+# 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(FILE *errout)
+{
+    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(FILE *errout)
+{
+    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, FILE *errout)
+{
+    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);
+    }
+}
+
+static void
+print_line(line_info_t *line, void *address, FILE *errout)
+{
+    print_line0(line, address, errout);
+    if (line->next) {
+        print_line(line->next, NULL, errout);
+    }
+}
+
+void
+rb_dump_backtrace_with_lines(int num_traces, void **traces, FILE *errout)
+{
+    int i;
+    /* async-signal unsafe */
+    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(errout)) > 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, 0, errout);
+            if (addr != (uintptr_t)-1) {
+                dladdr_fbases[0] = (void *)addr;
+            }
+        }
+    }
+#endif
+
+    /* fill source lines by reading dwarf */
+    for (i = 0; i < num_traces; i++) {
+        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;
+                }
+            }
+            *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, errout) == (uintptr_t)-1)
+                break;
+        }
+next_line:
+        continue;
+    }
+
+    /* output */
+    for (i = 0; i < num_traces; i++) {
+        print_line(&lines[i], traces[i], errout);
+
+        /* 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);
+}
+
+#undef kprintf
+
+#else /* defined(USE_ELF) */
+#error not supported
+#endif
diff --git a/addr2line.h b/addr2line.h
new file mode 100644
index 0000000000..ff8e476b92
--- /dev/null
+++ b/addr2line.h
@@ -0,0 +1,22 @@
+#ifndef RUBY_ADDR2LINE_H
+#define RUBY_ADDR2LINE_H
+/**********************************************************************
+
+  addr2line.h -
+
+  $Author$
+
+  Copyright (C) 2010 Shinichiro Hamaji
+
+**********************************************************************/
+
+#if (defined(USE_ELF) || defined(HAVE_MACH_O_LOADER_H))
+
+#include <stdio.h>
+
+void
+rb_dump_backtrace_with_lines(int num_traces, void **traces, FILE *errout);
+
+#endif /* USE_ELF */
+
+#endif /* RUBY_ADDR2LINE_H */
diff --git a/array.c b/array.c
index e3e058fd4b..db4c2c4802 100644
--- a/array.c
+++ b/array.c
@@ -3,1648 +3,8953 @@
   array.c -
 
   $Author$
-  $Date$
   created at: Fri Aug  6 09:46:12 JST 1993
 
-  Copyright (C) 1993-2000 Yukihiro Matsumoto
+  Copyright (C) 1993-2007 Yukihiro Matsumoto
   Copyright (C) 2000  Network Applied Communication Laboratory, Inc.
   Copyright (C) 2000  Information-technology Promotion Agency, Japan
 
 **********************************************************************/
 
-#include "ruby.h"
-#include "util.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 "ruby/encoding.h"
+#include "ruby/st.h"
+#include "ruby/thread.h"
+#include "ruby/util.h"
+#include "ruby/ractor.h"
+#include "shape.h"
+#include "vm_core.h"
+#include "builtin.h"
+
+#if !ARRAY_DEBUG
+# undef NDEBUG
+# define NDEBUG
+#endif
+#include "ruby_assert.h"
 
 VALUE rb_cArray;
+VALUE rb_cArray_empty_frozen;
+
+/* Flags of RArray
+ *
+ * 0:   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).
+ * 1:   RARRAY_EMBED_FLAG
+ *          The array is embedded (its contents follow the header, rather than
+ *          being on a separately allocated buffer).
+ * 3-9: RARRAY_EMBED_LEN
+ *          The length of the array when RARRAY_EMBED_FLAG is set.
+ * 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.
+ * 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
+
+RBIMPL_ATTR_MAYBE_UNUSED()
+static int
+should_be_T_ARRAY(VALUE ary)
+{
+    return RB_TYPE_P(ary, T_ARRAY);
+}
+
+#define ARY_HEAP_PTR(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
+#define ARY_HEAP_LEN(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
+#define ARY_HEAP_CAPA(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(!ARY_SHARED_ROOT_P(a)), \
+                          RARRAY(a)->as.heap.aux.capa)
+
+#define ARY_EMBED_PTR(a) (RUBY_ASSERT(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
+#define ARY_EMBED_LEN(a) \
+    (RUBY_ASSERT(ARY_EMBED_P(a)), \
+     (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
+         (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
+#define ARY_HEAP_SIZE(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(ARY_OWNS_HEAP_P(a)), ARY_CAPA(a) * sizeof(VALUE))
+
+#define ARY_OWNS_HEAP_P(a) (RUBY_ASSERT(should_be_T_ARRAY((VALUE)(a))), \
+                            !FL_TEST_RAW((a), RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG))
+
+#define FL_SET_EMBED(a) do { \
+    RUBY_ASSERT(!ARY_SHARED_P(a)); \
+    FL_SET((a), RARRAY_EMBED_FLAG); \
+    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 { \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    FL_SET((ary), RARRAY_SHARED_FLAG); \
+} while (0)
+#define FL_UNSET_SHARED(ary) FL_UNSET((ary), RARRAY_SHARED_FLAG)
+
+#define ARY_SET_PTR_FORCE(ary, p) \
+    (RARRAY(ary)->as.heap.ptr = (p))
+#define ARY_SET_PTR(ary, p) do { \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    ARY_SET_PTR_FORCE(ary, p); \
+} while (0)
+#define ARY_SET_EMBED_LEN(ary, n) do { \
+    long tmp_n = (n); \
+    RUBY_ASSERT(ARY_EMBED_P(ary)); \
+    RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
+    RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
+} while (0)
+#define ARY_SET_HEAP_LEN(ary, n) do { \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    RARRAY(ary)->as.heap.len = (n); \
+} while (0)
+#define ARY_SET_LEN(ary, n) do { \
+    if (ARY_EMBED_P(ary)) { \
+        ARY_SET_EMBED_LEN((ary), (n)); \
+    } \
+    else { \
+        ARY_SET_HEAP_LEN((ary), (n)); \
+    } \
+    RUBY_ASSERT(RARRAY_LEN(ary) == (n)); \
+} while (0)
+#define ARY_INCREASE_PTR(ary, n) do  { \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    RARRAY(ary)->as.heap.ptr += (n); \
+} while (0)
+#define ARY_INCREASE_LEN(ary, n) do  { \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    if (ARY_EMBED_P(ary)) { \
+        ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \
+    } \
+    else { \
+        RARRAY(ary)->as.heap.len += (n); \
+    } \
+} while (0)
+
+#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_FORCE(ary, n) \
+    RARRAY(ary)->as.heap.aux.capa = (n);
+#define ARY_SET_CAPA(ary, n) do { \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    RUBY_ASSERT(!ARY_SHARED_P(ary)); \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    ARY_SET_CAPA_FORCE(ary, n); \
+} while (0)
+
+#define ARY_SHARED_ROOT_OCCUPIED(ary) (!OBJ_FROZEN(ary) && ARY_SHARED_ROOT_REFCNT(ary) == 1)
+#define ARY_SET_SHARED_ROOT_REFCNT(ary, value) do { \
+    RUBY_ASSERT(ARY_SHARED_ROOT_P(ary)); \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    RUBY_ASSERT((value) >= 0); \
+    RARRAY(ary)->as.heap.aux.capa = (value); \
+} while (0)
+#define FL_SET_SHARED_ROOT(ary) do { \
+    RUBY_ASSERT(!OBJ_FROZEN(ary)); \
+    RUBY_ASSERT(!ARY_EMBED_P(ary)); \
+    FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
+} while (0)
+
+static inline void
+ARY_SET(VALUE a, long i, VALUE v)
+{
+    RUBY_ASSERT(!ARY_SHARED_P(a));
+    RUBY_ASSERT(!OBJ_FROZEN(a));
+
+    RARRAY_ASET(a, i, v);
+}
+#undef RARRAY_ASET
+
+static long
+ary_embed_capa(VALUE ary)
+{
+    size_t size = rb_gc_obj_slot_size(ary) - offsetof(struct RArray, as.ary);
+    RUBY_ASSERT(size % sizeof(VALUE) == 0);
+    return size / sizeof(VALUE);
+}
+
+static size_t
+ary_embed_size(long capa)
+{
+    size_t size = offsetof(struct RArray, as.ary) + (sizeof(VALUE) * capa);
+    if (size < sizeof(struct RArray)) size = sizeof(struct RArray);
+    return size;
+}
+
+static bool
+ary_embeddable_p(long capa)
+{
+    return rb_gc_size_allocatable_p(ary_embed_size(capa));
+}
+
+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)
+{
+    RUBY_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(root);
+        long len = ARY_HEAP_LEN(ary), root_len = RARRAY_LEN(root);
+        RUBY_ASSERT(ARY_SHARED_ROOT_P(root) || OBJ_FROZEN(root));
+        RUBY_ASSERT(root_ptr <= ptr && ptr + len <= root_ptr + root_len);
+        ary_verify(root);
+    }
+    else if (ARY_EMBED_P(ary)) {
+        RUBY_ASSERT(!ARY_SHARED_P(ary));
+        RUBY_ASSERT(RARRAY_LEN(ary) <= ary_embed_capa(ary));
+    }
+    else {
+        const VALUE *ptr = RARRAY_CONST_PTR(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;
+    }
+
+    return 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(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(mem, size)
-    register VALUE *mem;
-    register size_t size;
+rb_mem_clear(VALUE *mem, long size)
 {
     while (size--) {
-	*mem++ = Qnil;
+        *mem++ = Qnil;
     }
 }
 
 static void
-memfill(mem, size, val)
-    register VALUE *mem;
-    register size_t size;
-    register VALUE val;
+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;
+        *mem++ = val;
     }
 }
 
-#define ARY_TMPLOCK  FL_USER1
+static void
+ary_memfill(VALUE ary, long beg, long size, VALUE val)
+{
+    RARRAY_PTR_USE(ary, ptr, {
+        memfill(ptr + beg, size, val);
+        RB_OBJ_WRITTEN(ary, Qundef, val);
+    });
+}
 
 static void
-rb_ary_modify(ary)
-    VALUE ary;
+ary_memcpy0(VALUE ary, long beg, long argc, const VALUE *argv, VALUE buff_owner_ary)
 {
-    if (OBJ_FROZEN(ary)) rb_error_frozen("array");
-    if (FL_TEST(ary, ARY_TMPLOCK))
-	rb_raise(rb_eTypeError, "can't modify array during sort");
-    if (!OBJ_TAINTED(ary) && rb_safe_level() >= 4)
-	rb_raise(rb_eSecurityError, "Insecure: can't modify array");
+    RUBY_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(ary, ptr, {
+            MEMCPY(ptr+beg, argv, VALUE, argc);
+        });
+    }
+    else {
+        int i;
+        RARRAY_PTR_USE(ary, ptr, {
+            for (i=0; i<argc; i++) {
+                RB_OBJ_WRITE(buff_owner_ary, &ptr[i+beg], argv[i]);
+            }
+        });
+    }
 }
 
-VALUE
-rb_ary_freeze(ary)
-    VALUE ary;
+static void
+ary_memcpy(VALUE ary, long beg, long argc, const VALUE *argv)
 {
-    return rb_obj_freeze(ary);
+    ary_memcpy0(ary, beg, argc, argv, ary);
+}
+
+static VALUE *
+ary_heap_alloc_buffer(size_t capa)
+{
+    return ALLOC_N(VALUE, capa);
+}
+
+static void
+ary_heap_free_ptr(VALUE ary, const VALUE *ptr, long size)
+{
+    ruby_xfree_sized((void *)ptr, size);
+}
+
+static void
+ary_heap_free(VALUE ary)
+{
+    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)
+{
+    RUBY_ASSERT(!OBJ_FROZEN(ary));
+    SIZED_REALLOC_N(RARRAY(ary)->as.heap.ptr, VALUE, new_capa, ARY_HEAP_CAPA(ary));
+    ary_verify(ary);
+
+    return new_capa;
+}
+
+void
+rb_ary_make_embedded(VALUE ary)
+{
+    RUBY_ASSERT(rb_ary_embeddable_p(ary));
+    if (!ARY_EMBED_P(ary)) {
+        const VALUE *buf = ARY_HEAP_PTR(ary);
+        long len = ARY_HEAP_LEN(ary);
+        long capa = ARY_HEAP_CAPA(ary);
+
+        FL_SET_EMBED(ary);
+        ARY_SET_EMBED_LEN(ary, len);
+
+        MEMCPY((void *)ARY_EMBED_PTR(ary), (void *)buf, VALUE, len);
+
+        ary_heap_free_ptr(ary, buf, capa * sizeof(VALUE));
+    }
+}
+
+static void
+ary_resize_capa(VALUE ary, long capacity)
+{
+    RUBY_ASSERT(RARRAY_LEN(ary) <= capacity);
+    RUBY_ASSERT(!OBJ_FROZEN(ary));
+    RUBY_ASSERT(!ARY_SHARED_P(ary));
+
+    if (capacity > ary_embed_capa(ary)) {
+        size_t new_capa = capacity;
+        if (ARY_EMBED_P(ary)) {
+            long len = ARY_EMBED_LEN(ary);
+            VALUE *ptr = ary_heap_alloc_buffer(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 {
+            new_capa = ary_heap_realloc(ary, capacity);
+        }
+        ARY_SET_CAPA(ary, new_capa);
+    }
+    else {
+        if (!ARY_EMBED_P(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 * sizeof(VALUE));
+
+            FL_SET_EMBED(ary);
+            ARY_SET_LEN(ary, len);
+        }
+    }
+
+    ary_verify(ary);
+}
+
+static inline void
+ary_shrink_capa(VALUE ary)
+{
+    long capacity = ARY_HEAP_LEN(ary);
+    long old_capa = ARY_HEAP_CAPA(ary);
+    RUBY_ASSERT(!ARY_SHARED_P(ary));
+    RUBY_ASSERT(old_capa >= capacity);
+    if (old_capa > capacity) {
+        size_t new_capa = ary_heap_realloc(ary, capacity);
+        ARY_SET_CAPA(ary, new_capa);
+    }
+
+    ary_verify(ary);
+}
+
+static void
+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;
+    }
+    if (new_capa >= ARY_MAX_SIZE - min) {
+        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_root)
+{
+    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_root = ARY_SHARED_ROOT(ary);
+    rb_ary_decrement_share(shared_root);
+    FL_UNSET_SHARED(ary);
+}
+
+static void
+rb_ary_reset(VALUE 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_frozen_p(ary)
-    VALUE ary;
+rb_ary_increment_share(VALUE shared_root)
 {
-    if (FL_TEST(ary, FL_FREEZE|ARY_TMPLOCK))
-	return Qtrue;
-    return Qfalse;
+    if (!OBJ_FROZEN(shared_root)) {
+        long num = ARY_SHARED_ROOT_REFCNT(shared_root);
+        RUBY_ASSERT(num >= 0);
+        ARY_SET_SHARED_ROOT_REFCNT(shared_root, num + 1);
+    }
+    return shared_root;
+}
+
+static void
+rb_ary_set_shared(VALUE ary, VALUE shared_root)
+{
+    RUBY_ASSERT(!ARY_EMBED_P(ary));
+    RUBY_ASSERT(!OBJ_FROZEN(ary));
+    RUBY_ASSERT(ARY_SHARED_ROOT_P(shared_root) || OBJ_FROZEN(shared_root));
+
+    rb_ary_increment_share(shared_root);
+    FL_SET_SHARED(ary);
+    RB_OBJ_WRITE(ary, &RARRAY(ary)->as.heap.aux.shared_root, shared_root);
+
+    RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
+}
+
+static inline void
+rb_ary_modify_check(VALUE ary)
+{
+    RUBY_ASSERT(ruby_thread_has_gvl_p());
+
+    rb_check_frozen(ary);
+    ary_verify(ary);
+}
+
+void
+rb_ary_cancel_sharing(VALUE ary)
+{
+    if (ARY_SHARED_P(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_root);
+            ARY_SET_EMBED_LEN(ary, len);
+        }
+        else if (ARY_SHARED_ROOT_OCCUPIED(shared_root) && len > ((shared_len = RARRAY_LEN(shared_root))>>1)) {
+            long shift = RARRAY_CONST_PTR(ary) - RARRAY_CONST_PTR(shared_root);
+            FL_UNSET_SHARED(ary);
+            ARY_SET_PTR(ary, RARRAY_CONST_PTR(shared_root));
+            ARY_SET_CAPA(ary, shared_len);
+            RARRAY_PTR_USE(ary, ptr, {
+                MEMMOVE(ptr, ptr+shift, VALUE, len);
+            });
+            FL_SET_EMBED(shared_root);
+            rb_ary_decrement_share(shared_root);
+        }
+        else {
+            VALUE *ptr = ary_heap_alloc_buffer(len);
+            MEMCPY(ptr, ARY_HEAP_PTR(ary), VALUE, len);
+            rb_ary_unshare(ary);
+            ARY_SET_CAPA_FORCE(ary, len);
+            ARY_SET_PTR_FORCE(ary, ptr);
+        }
+
+        rb_gc_writebarrier_remember(ary);
+    }
+    ary_verify(ary);
+}
+
+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 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 > 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(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);
+    }
+    capa = ARY_CAPA(ary);
+    if (new_len > capa) {
+        ary_double_capa(ary, new_len);
+    }
+
+    ary_verify(ary);
+    return ary;
+}
+
+/*
+ *  call-seq:
+ *    freeze -> self
+ *
+ *  Freezes +self+ (if not already frozen); returns +self+:
+ *
+ *    a = []
+ *    a.frozen? # => false
+ *    a.freeze
+ *    a.frozen? # => true
+ *
+ *  No further changes may be made to +self+;
+ *  raises FrozenError if a change is attempted.
+ *
+ *  Related: Kernel#frozen?.
+ */
+
 VALUE
-rb_ary_new2(len)
-    long len;
+rb_ary_freeze(VALUE ary)
 {
-    NEWOBJ(ary, struct RArray);
-    OBJSETUP(ary, rb_cArray, T_ARRAY);
+    RUBY_ASSERT(RB_TYPE_P(ary, T_ARRAY));
 
-    if (len < 0) {
-	rb_raise(rb_eArgError, "negative array size (or size too big)");
+    if (OBJ_FROZEN(ary)) return ary;
+
+    if (!ARY_EMBED_P(ary) && !ARY_SHARED_P(ary) && !ARY_SHARED_ROOT_P(ary)) {
+        ary_shrink_capa(ary);
     }
-    if (len > 0 && len*sizeof(VALUE) <= 0) {
-	rb_raise(rb_eArgError, "array size too big");
+
+    return rb_obj_freeze(ary);
+}
+
+/* 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
+   something does modify the array it will pay the cost of copying
+   it.  If Array#pop or Array#shift has been called, the array will
+   be still shared with the snapshot, but the array length will
+   differ. */
+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) &&
+            ARY_SHARED_ROOT(ary1) == ARY_SHARED_ROOT(ary2) &&
+            ARY_HEAP_LEN(ary1) == ARY_HEAP_LEN(ary2)) {
+        return Qtrue;
     }
-    ary->len = 0;
-    ary->capa = len;
-    ary->ptr = 0;
-    if (len == 0) len++;
-    ary->ptr = ALLOC_N(VALUE, len);
+    return Qfalse;
+}
+
+static VALUE
+ary_alloc_embed(VALUE klass, long capa)
+{
+    size_t size = ary_embed_size(capa);
+    RUBY_ASSERT(rb_gc_size_allocatable_p(size));
+   /* Created array is:
+    *   FL_SET_EMBED((VALUE)ary);
+    *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
+    */
+    return rb_newobj_of(klass, T_ARRAY | RARRAY_EMBED_FLAG, size);
+}
+
+static VALUE
+ary_alloc_heap(VALUE klass)
+{
+    NEWOBJ_OF(ary, struct RArray, klass, T_ARRAY, sizeof(struct RArray));
+
+    ary->as.heap.len = 0;
+    ary->as.heap.aux.capa = 0;
+    ary->as.heap.ptr = NULL;
 
     return (VALUE)ary;
 }
 
+static VALUE
+empty_ary_alloc(VALUE klass)
+{
+    RUBY_DTRACE_CREATE_HOOK(ARRAY, 0);
+    return ary_alloc_embed(klass, 0);
+}
+
+static VALUE
+ary_new(VALUE klass, long capa)
+{
+    RUBY_ASSERT(ruby_thread_has_gvl_p());
+
+    VALUE ary;
+
+    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 = ary_alloc_embed(klass, capa);
+    }
+    else {
+        ary = ary_alloc_heap(klass);
+        ARY_SET_CAPA(ary, capa);
+        RUBY_ASSERT(!ARY_EMBED_P(ary));
+
+        ARY_SET_PTR(ary, ary_heap_alloc_buffer(capa));
+        ARY_SET_HEAP_LEN(ary, 0);
+    }
+
+    return ary;
+}
+
 VALUE
-rb_ary_new()
+rb_ary_new_capa(long capa)
 {
-    return rb_ary_new2(ARY_DEFAULT_SIZE);
+    return ary_new(rb_cArray, capa);
 }
 
-#ifdef HAVE_STDARG_PROTOTYPES
-#include <stdarg.h>
-#define va_init_list(a,b) va_start(a,b)
-#else
-#include <varargs.h>
-#define va_init_list(a,b) va_start(a)
-#endif
+VALUE
+rb_ary_new(void)
+{
+    return rb_ary_new_capa(0);
+}
 
 VALUE
-#ifdef HAVE_STDARG_PROTOTYPES
-rb_ary_new3(long n, ...)
-#else
-rb_ary_new3(n, va_alist)
-    long n;
-    va_dcl
-#endif
+(rb_ary_new_from_args)(long n, ...)
 {
     va_list ar;
     VALUE ary;
     long i;
 
-    if (n < 0) {
-	rb_raise(rb_eIndexError, "negative number of items(%d)", n);
-    }
-    ary = rb_ary_new2(n<ARY_DEFAULT_SIZE?ARY_DEFAULT_SIZE:n);
+    ary = rb_ary_new2(n);
 
-    va_init_list(ar, n);
+    va_start(ar, n);
     for (i=0; i<n; i++) {
-	RARRAY(ary)->ptr[i] = va_arg(ar, VALUE);
+        ARY_SET(ary, i, va_arg(ar, VALUE));
     }
     va_end(ar);
 
-    RARRAY(ary)->len = n;
+    ARY_SET_LEN(ary, n);
     return ary;
 }
 
 VALUE
-rb_ary_new4(n, elts)
-    long n;
-    VALUE *elts;
+rb_ary_tmp_new_from_values(VALUE klass, long n, const VALUE *elts)
 {
     VALUE ary;
 
-    ary = rb_ary_new2(n);
-    if (elts) {
-	MEMCPY(RARRAY(ary)->ptr, elts, VALUE, n);
+    ary = ary_new(klass, n);
+    if (n > 0 && elts) {
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
     }
-    RARRAY(ary)->len = n;
 
     return ary;
 }
 
 VALUE
-rb_assoc_new(car, cdr)
-    VALUE car, cdr;
+rb_ary_new_from_values(long n, const VALUE *elts)
 {
-    VALUE ary;
+    return rb_ary_tmp_new_from_values(rb_cArray, n, elts);
+}
 
-    ary = rb_ary_new2(2);
-    RARRAY(ary)->ptr[0] = car;
-    RARRAY(ary)->ptr[1] = cdr;
-    RARRAY(ary)->len = 2;
+static VALUE
+ec_ary_alloc_embed(rb_execution_context_t *ec, VALUE klass, long capa)
+{
+    size_t size = ary_embed_size(capa);
+    RUBY_ASSERT(rb_gc_size_allocatable_p(size));
+   /* Created array is:
+    *   FL_SET_EMBED((VALUE)ary);
+    *   ARY_SET_EMBED_LEN((VALUE)ary, 0);
+    */
+    return rb_ec_newobj_of(ec, klass, T_ARRAY | RARRAY_EMBED_FLAG, size);
+}
 
+static VALUE
+ec_ary_alloc_heap(rb_execution_context_t *ec, VALUE klass)
+{
+    VALUE ary = rb_ec_newobj_of(ec, klass, T_ARRAY, sizeof(struct RArray));
+    RARRAY(ary)->as.heap.len = 0;
+    RARRAY(ary)->as.heap.aux.capa = 0;
+    RARRAY(ary)->as.heap.ptr = NULL;
     return ary;
 }
 
 static VALUE
-rb_ary_s_new(argc, argv, klass)
-    int argc;
-    VALUE *argv;
-    VALUE klass;
+ec_ary_new(rb_execution_context_t *ec, VALUE klass, long capa)
 {
-    VALUE ary = rb_ary_new();
-    OBJSETUP(ary, klass, T_ARRAY);
-    rb_obj_call_init(ary, argc, argv);
+    VALUE ary;
+
+    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);
+        RUBY_ASSERT(!ARY_EMBED_P(ary));
+
+        ARY_SET_PTR(ary, ary_heap_alloc_buffer(capa));
+        ARY_SET_HEAP_LEN(ary, 0);
+    }
 
     return ary;
 }
 
-static VALUE
-rb_ary_initialize(argc, argv, ary)
-    int argc;
-    VALUE *argv;
+VALUE
+rb_ec_ary_new_from_values(rb_execution_context_t *ec, long n, const VALUE *elts)
+{
     VALUE ary;
+
+    ary = ec_ary_new(ec, rb_cArray, n);
+    if (n > 0 && elts) {
+        ary_memcpy(ary, 0, n, elts);
+        ARY_SET_LEN(ary, n);
+    }
+
+    return ary;
+}
+
+VALUE
+rb_ary_hidden_new(long capa)
 {
-    long len;
-    VALUE size, val;
+    VALUE ary = ary_new(0, capa);
+    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;
+}
 
-    if (rb_scan_args(argc, argv, "02", &size, &val) == 0) {
-	return ary;
+void
+rb_ary_free(VALUE ary)
+{
+    if (ARY_OWNS_HEAP_P(ary)) {
+        if (USE_DEBUG_COUNTER &&
+            !ARY_SHARED_ROOT_P(ary) &&
+            ARY_HEAP_CAPA(ary) > RARRAY_LEN(ary)) {
+            RB_DEBUG_COUNTER_INC(obj_ary_extracapa);
+        }
+
+        RB_DEBUG_COUNTER_INC(obj_ary_ptr);
+        ary_heap_free(ary);
+    }
+    else {
+        RB_DEBUG_COUNTER_INC(obj_ary_embed);
     }
 
-    rb_ary_modify(ary);
-    len = NUM2LONG(size);
-    if (len < 0) {
-	rb_raise(rb_eArgError, "negative array size");
+    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);
+    }
+}
+
+static VALUE fake_ary_flags;
+
+static VALUE
+init_fake_ary_flags(void)
+{
+    struct RArray fake_ary = {0};
+    fake_ary.basic.flags = T_ARRAY;
+    VALUE ary = (VALUE)&fake_ary;
+    RBASIC_SET_SHAPE_ID(ary, ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_OTHER);
+    rb_ary_freeze(ary);
+    return fake_ary.basic.flags;
+}
+
+VALUE
+rb_setup_fake_ary(struct RArray *fake_ary, const VALUE *list, long len)
+{
+    fake_ary->basic.flags = fake_ary_flags;
+    RBASIC_CLEAR_CLASS((VALUE)fake_ary);
+
+    // bypass frozen checks
+    fake_ary->as.heap.ptr = list;
+    fake_ary->as.heap.len = len;
+    fake_ary->as.heap.aux.capa = len;
+    return (VALUE)fake_ary;
+}
+
+size_t
+rb_ary_memsize(VALUE ary)
+{
+    if (ARY_OWNS_HEAP_P(ary)) {
+        return ARY_CAPA(ary) * sizeof(VALUE);
+    }
+    else {
+        return 0;
     }
-    if (len > 0 && len*sizeof(VALUE) <= 0) {
-	rb_raise(rb_eArgError, "array size too big");
+}
+
+static VALUE
+ary_make_shared(VALUE ary)
+{
+    ary_verify(ary);
+
+    if (ARY_SHARED_P(ary)) {
+        return ARY_SHARED_ROOT(ary);
+    }
+    else if (ARY_SHARED_ROOT_P(ary)) {
+        return ary;
+    }
+    else if (OBJ_FROZEN(ary)) {
+        return ary;
+    }
+    else {
+        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);
+
+        if (ARY_EMBED_P(ary)) {
+            VALUE *ptr = ary_heap_alloc_buffer(capa);
+            ARY_SET_PTR(shared, ptr);
+            ary_memcpy(shared, 0, len, RARRAY_CONST_PTR(ary));
+
+            FL_UNSET_EMBED(ary);
+            ARY_SET_HEAP_LEN(ary, len);
+            ARY_SET_PTR(ary, ptr);
+        }
+        else {
+            ARY_SET_PTR(shared, RARRAY_CONST_PTR(ary));
+        }
+
+        ARY_SET_LEN(shared, capa);
+        ary_mem_clear(shared, len, capa - len);
+        rb_ary_set_shared(ary, shared);
+
+        ary_verify(shared);
+        ary_verify(ary);
+
+        return shared;
+    }
+}
+
+static VALUE
+ary_make_substitution(VALUE ary)
+{
+    long len = RARRAY_LEN(ary);
+
+    if (ary_embeddable_p(len)) {
+        VALUE subst = rb_ary_new_capa(len);
+        RUBY_ASSERT(ARY_EMBED_P(subst));
+
+        ary_memcpy(subst, 0, len, RARRAY_CONST_PTR(ary));
+        ARY_SET_EMBED_LEN(subst, len);
+        return subst;
+    }
+    else {
+        return rb_ary_increment_share(ary_make_shared(ary));
+    }
+}
+
+VALUE
+rb_assoc_new(VALUE car, VALUE cdr)
+{
+    return rb_ary_new3(2, car, cdr);
+}
+
+VALUE
+rb_to_array_type(VALUE 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_with_id(ary, T_ARRAY, "Array", idTo_ary);
+}
+
+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(object) -> object, new_array, or nil
+ *
+ *  Attempts to return an array, based on the given +object+.
+ *
+ *  If +object+ is an array, returns +object+.
+ *
+ *  Otherwise if +object+ responds to <tt>:to_ary</tt>.
+ *  calls <tt>object.to_ary</tt>:
+ *  if the return value is an array or +nil+, returns that value;
+ *  if not, raises TypeError.
+ *
+ *  Otherwise returns +nil+.
+ *
+ *  Related: see {Methods for Creating an Array}[rdoc-ref:Array@Methods+for+Creating+an+Array].
+ */
+
+static VALUE
+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);
     }
-    if (len > RARRAY(ary)->capa) {
-	RARRAY(ary)->capa = len;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
+    else {
+        ary = rb_class_new_instance_pass_kw(argc, argv, klass);
     }
-    memfill(RARRAY(ary)->ptr, len, val);
-    RARRAY(ary)->len = len;
 
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    Array.new -> new_empty_array
+ *    Array.new(array) -> new_array
+ *    Array.new(size, default_value = nil) -> new_array
+ *    Array.new(size = 0) {|index| ... } -> new_array
+ *
+ *  Returns a new array.
+ *
+ *  With no block and no argument given, returns a new empty array:
+ *
+ *    Array.new # => []
+ *
+ *  With no block and array argument given, returns a new array with the same elements:
+ *
+ *    Array.new([:foo, 'bar', 2]) # => [:foo, "bar", 2]
+ *
+ *  With no block and integer argument given, returns a new array containing
+ *  that many instances of the given +default_value+:
+ *
+ *    Array.new(0)    # => []
+ *    Array.new(3)    # => [nil, nil, nil]
+ *    Array.new(2, 3) # => [3, 3]
+ *
+ *  With a block given, returns an array of the given +size+;
+ *  calls the block with each +index+ in the range <tt>(0...size)</tt>;
+ *  the element at that +index+ in the returned array is the blocks return value:
+ *
+ *    Array.new(3)  {|index| "Element #{index}" } # => ["Element 0", "Element 1", "Element 2"]
+ *
+ *  A common pitfall for new Rubyists is providing an expression as +default_value+:
+ *
+ *    array = Array.new(2, {})
+ *    array # => [{}, {}]
+ *    array[0][:a] = 1
+ *    array # => [{a: 1}, {a: 1}], as array[0] and array[1] are same object
+ *
+ *  If you want the elements of the array to be distinct, you should pass a block:
+ *
+ *    array = Array.new(2) { {} }
+ *    array # => [{}, {}]
+ *    array[0][:a] = 1
+ *    array # => [{a: 1}, {}], as array[0] and array[1] are different objects
+ *
+ *  Raises TypeError if the first argument is not either an array
+ *  or an {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects]).
+ *  Raises ArgumentError if the first argument is a negative integer.
+ *
+ *  Related: see {Methods for Creating an Array}[rdoc-ref:Array@Methods+for+Creating+an+Array].
+ */
+
 static VALUE
-rb_ary_s_create(argc, argv, klass)
-    int argc;
-    VALUE *argv;
-    VALUE klass;
+rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
 {
-    NEWOBJ(ary, struct RArray);
-    OBJSETUP(ary, klass, T_ARRAY);
+    long len;
+    VALUE size, val;
 
-    ary->len = ary->capa = 0;
+    rb_ary_modify(ary);
     if (argc == 0) {
-	ary->ptr = 0;
+        rb_ary_reset(ary);
+        RUBY_ASSERT(ARY_EMBED_P(ary));
+        RUBY_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;
+        }
+    }
+
+    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");
+    }
+    if (len > ARY_MAX_SIZE) {
+        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;
+
+        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->ptr = ALLOC_N(VALUE, argc);
-	MEMCPY(ary->ptr, argv, VALUE, argc);
+        ary_memfill(ary, 0, len, val);
+        ARY_SET_LEN(ary, len);
     }
-    ary->len = ary->capa = argc;
+    return ary;
+}
 
-    return (VALUE)ary;
+/*
+ * Returns a new array, populated with the given objects:
+ *
+ *   Array[1, 'a', /^A/]    # => [1, "a", /^A/]
+ *   Array[]                # => []
+ *   Array.[](1, 'a', /^A/) # => [1, "a", /^A/]
+ *
+ * Related: see {Methods for Creating an Array}[rdoc-ref:Array@Methods+for+Creating+an+Array].
+ */
+
+static VALUE
+rb_ary_s_create(int argc, VALUE *argv, VALUE klass)
+{
+    VALUE ary = ary_new(klass, argc);
+    if (argc > 0 && argv) {
+        ary_memcpy(ary, 0, argc, argv);
+        ARY_SET_LEN(ary, argc);
+    }
+
+    return ary;
 }
 
 void
-rb_ary_store(ary, idx, val)
-    VALUE ary;
-    long idx;
-    VALUE val;
+rb_ary_store(VALUE ary, long idx, VALUE val)
 {
-    rb_ary_modify(ary);
+    long len = RARRAY_LEN(ary);
+
     if (idx < 0) {
-	idx += RARRAY(ary)->len;
-	if (idx < 0) {
-	    rb_raise(rb_eIndexError, "index %d out of array",
-		     idx - RARRAY(ary)->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);
     }
 
-    if (idx >= RARRAY(ary)->capa) {
-	long capa_inc = RARRAY(ary)->capa / 2;
-	if (capa_inc < ARY_DEFAULT_SIZE) {
-	    capa_inc = ARY_DEFAULT_SIZE;
-	}
-	RARRAY(ary)->capa = idx + capa_inc;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
+    rb_ary_modify(ary);
+    if (idx >= ARY_CAPA(ary)) {
+        ary_double_capa(ary, idx);
     }
-    if (idx > RARRAY(ary)->len) {
-	rb_mem_clear(RARRAY(ary)->ptr+RARRAY(ary)->len,
-		     idx-RARRAY(ary)->len+1);
+    if (idx > len) {
+        ary_mem_clear(ary, len, idx - len + 1);
     }
 
-    if (idx >= RARRAY(ary)->len) {
-	RARRAY(ary)->len = idx + 1;
+    if (idx >= len) {
+        ARY_SET_LEN(ary, idx + 1);
     }
-    RARRAY(ary)->ptr[idx] = val;
+    ARY_SET(ary, idx, val);
 }
 
-VALUE
-rb_ary_push(ary, item)
-    VALUE ary;
-    VALUE item;
+static VALUE
+ary_make_partial(VALUE ary, VALUE klass, long offset, long len)
 {
-    rb_ary_store(ary, RARRAY(ary)->len, item);
-    return ary;
+    RUBY_ASSERT(offset >= 0);
+    RUBY_ASSERT(len >= 0);
+    RUBY_ASSERT(offset+len <= RARRAY_LEN(ary));
+
+    VALUE result = ary_alloc_heap(klass);
+    size_t embed_capa = ary_embed_capa(result);
+    if ((size_t)len <= embed_capa) {
+        FL_SET_EMBED(result);
+        ary_memcpy(result, 0, len, RARRAY_CONST_PTR(ary) + offset);
+        ARY_SET_EMBED_LEN(result, len);
+    }
+    else {
+        VALUE shared = ary_make_shared(ary);
+
+        /* The ary_make_shared call may allocate, which can trigger a GC
+         * compaction. This can cause the array to be embedded because it has
+         * a length of 0. */
+        FL_UNSET_EMBED(result);
+
+        ARY_SET_PTR(result, RARRAY_CONST_PTR(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
-rb_ary_push_m(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+ary_make_partial_step(VALUE ary, VALUE klass, long offset, long len, long step)
 {
-    if (argc > 0) {
-	long len = RARRAY(ary)->len;
+    RUBY_ASSERT(offset >= 0);
+    RUBY_ASSERT(len >= 0);
+    RUBY_ASSERT(offset+len <= RARRAY_LEN(ary));
+    RUBY_ASSERT(step != 0);
+
+    const long orig_len = len;
+
+    if (step > 0 && step >= len) {
+        VALUE result = ary_new(klass, 1);
+        VALUE *ptr = (VALUE *)ARY_EMBED_PTR(result);
+        const VALUE *values = RARRAY_CONST_PTR(ary);
+
+        RB_OBJ_WRITE(result, ptr, values[offset]);
+        ARY_SET_EMBED_LEN(result, 1);
+        return result;
+    }
+    else if (step < 0 && step < -len) {
+        step = -len;
+    }
 
-	--argc;
-	/* make rooms by copying the last item */
-	rb_ary_store(ary, len + argc, argv[argc]);
+    long ustep = (step < 0) ? -step : step;
+    len = roomof(len, ustep);
 
-	if (argc)		/* if any rest */
-	    MEMCPY(RARRAY(ary)->ptr + len, argv, VALUE, argc);
+    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);
+        const VALUE *values = RARRAY_CONST_PTR(ary);
+
+        for (i = 0; i < len; ++i) {
+            RB_OBJ_WRITE(result, ptr+i, values[j]);
+            j += step;
+        }
+        ARY_SET_EMBED_LEN(result, len);
     }
+    else {
+        const VALUE *values = RARRAY_CONST_PTR(ary);
+
+        RARRAY_PTR_USE(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_cArray, 0, RARRAY_LEN(ary));
+}
+
+enum ary_take_pos_flags
+{
+    ARY_TAKE_FIRST = 0,
+    ARY_TAKE_LAST = 1
+};
+
+static VALUE
+ary_take_first_or_last_n(VALUE ary, long n, enum ary_take_pos_flags last)
+{
+    long len = RARRAY_LEN(ary);
+    long offset = 0;
+
+    if (n > len) {
+        n = len;
+    }
+    else if (n < 0) {
+        rb_raise(rb_eArgError, "negative array size");
+    }
+    if (last) {
+        offset = len - n;
+    }
+    return ary_make_partial(ary, rb_cArray, offset, n);
+}
+
+static VALUE
+ary_take_first_or_last(int argc, const VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
+{
+    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);
+    return ary_take_first_or_last_n(ary, NUM2LONG(argv[0]), last);
+}
+
+/*
+ *  call-seq:
+ *    self << object -> self
+ *
+ *  Appends +object+ as the last element in +self+; returns +self+:
+ *
+ *    [:foo, 'bar', 2] << :baz # => [:foo, "bar", 2, :baz]
+ *
+ *  Appends +object+ as a single element, even if it is another array:
+ *
+ *    [:foo, 'bar', 2] << [3, 4] # => [:foo, "bar", 2, [3, 4]]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+VALUE
+rb_ary_push(VALUE ary, VALUE item)
+{
+    long idx = RARRAY_LEN((ary_verify(ary), ary));
+    VALUE target_ary = ary_ensure_room_for_push(ary, 1);
+    RARRAY_PTR_USE(ary, ptr, {
+        RB_OBJ_WRITE(target_ary, &ptr[idx], item);
+    });
+    ARY_SET_LEN(ary, idx + 1);
+    ary_verify(ary);
     return ary;
 }
 
 VALUE
-rb_ary_pop(ary)
-    VALUE ary;
+rb_ary_cat(VALUE ary, const VALUE *argv, long len)
 {
-    rb_ary_modify(ary);
-    if (RARRAY(ary)->len == 0) return Qnil;
-    if (RARRAY(ary)->len * 10 < RARRAY(ary)->capa && RARRAY(ary)->capa > ARY_DEFAULT_SIZE) {
-	RARRAY(ary)->capa = RARRAY(ary)->len * 2;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
-    }
-    return RARRAY(ary)->ptr[--RARRAY(ary)->len];
+    long oldlen = RARRAY_LEN(ary);
+    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:
+ *    push(*objects) -> self
+ *    append(*objects) -> self
+ *
+ *  Appends each argument in +objects+ to +self+; returns +self+:
+ *
+ *    a = [:foo, 'bar', 2] # => [:foo, "bar", 2]
+ *    a.push(:baz, :bat)   # => [:foo, "bar", 2, :baz, :bat]
+ *
+ *  Appends each argument as a single element, even if it is another array:
+ *
+ *    a = [:foo, 'bar', 2]               # => [:foo, "bar", 2]
+      a.push([:baz, :bat], [:bam, :bad]) # => [:foo, "bar", 2, [:baz, :bat], [:bam, :bad]]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+static VALUE
+rb_ary_push_m(int argc, VALUE *argv, VALUE ary)
+{
+    return rb_ary_cat(ary, argv, argc);
 }
 
 VALUE
-rb_ary_shift(ary)
-    VALUE ary;
+rb_ary_pop(VALUE ary)
 {
-    VALUE top;
+    long n;
+    rb_ary_modify_check(ary);
+    n = RARRAY_LEN(ary);
+    if (n == 0) return Qnil;
+    if (ARY_OWNS_HEAP_P(ary) &&
+        n * 3 < ARY_CAPA(ary) &&
+        ARY_CAPA(ary) > ARY_DEFAULT_SIZE)
+    {
+        ary_resize_capa(ary, n * 2);
+    }
 
-    rb_ary_modify(ary);
-    if (RARRAY(ary)->len == 0) return Qnil;
+    VALUE obj = RARRAY_AREF(ary, n - 1);
 
-    top = RARRAY(ary)->ptr[0];
-    RARRAY(ary)->len--;
+    ARY_SET_LEN(ary, n - 1);
+    ary_verify(ary);
+    return obj;
+}
+
+/*
+ *  call-seq:
+ *    pop -> object or nil
+ *    pop(count) -> new_array
+ *
+ *  Removes and returns trailing elements of +self+.
+ *
+ *  With no argument given, removes and returns the last element, if available;
+ *  otherwise returns +nil+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop  # => 2
+ *    a      # => [:foo, "bar"]
+ *    [].pop # => nil
+ *
+ *  With non-negative integer argument +count+ given,
+ *  returns a new array containing the trailing +count+ elements of +self+, as available:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(2) # => ["bar", 2]
+ *    a        # => [:foo]
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.pop(50) # => [:foo, "bar", 2]
+ *    a         # => []
+ *
+ *  Related: Array#push;
+ *  see also {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+static VALUE
+rb_ary_pop_m(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result;
 
-    /* sliding items */
-    MEMMOVE(RARRAY(ary)->ptr, RARRAY(ary)->ptr+1, VALUE, RARRAY(ary)->len);
-    if (RARRAY(ary)->len * 10 < RARRAY(ary)->capa && RARRAY(ary)->capa > ARY_DEFAULT_SIZE) {
-	RARRAY(ary)->capa = RARRAY(ary)->len * 2;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
+    if (argc == 0) {
+        return rb_ary_pop(ary);
     }
 
-    return top;
+    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;
 }
 
 VALUE
-rb_ary_unshift(ary, item)
-    VALUE ary, item;
+rb_ary_shift(VALUE ary)
 {
-    rb_ary_modify(ary);
-    if (RARRAY(ary)->len >= RARRAY(ary)->capa) {
-	long capa_inc = RARRAY(ary)->capa / 2;
-	if (capa_inc < ARY_DEFAULT_SIZE) {
-	    capa_inc = ARY_DEFAULT_SIZE;
-	}
-	RARRAY(ary)->capa+=capa_inc;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
+    VALUE top;
+    long len = RARRAY_LEN(ary);
+
+    if (len == 0) {
+        rb_ary_modify_check(ary);
+        return Qnil;
     }
 
-    /* sliding items */
-    MEMMOVE(RARRAY(ary)->ptr+1, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
+    top = RARRAY_AREF(ary, 0);
 
-    RARRAY(ary)->len++;
-    RARRAY(ary)->ptr[0] = item;
+    rb_ary_behead(ary, 1);
 
-    return ary;
+    return top;
 }
 
+/*
+ *  call-seq:
+ *    shift -> object or nil
+ *    shift(count) -> new_array or nil
+ *
+ *  Removes and returns leading elements from +self+.
+ *
+ *  With no argument, removes and returns one element, if available,
+ *  or +nil+ otherwise:
+ *
+ *    a = [0, 1, 2, 3]
+ *    a.shift  # => 0
+ *    a        # => [1, 2, 3]
+ *    [].shift # => nil
+ *
+ *  With non-negative numeric argument +count+ given,
+ *  removes and returns the first +count+ elements:
+ *
+ *    a = [0, 1, 2, 3]
+ *    a.shift(2)   # => [0, 1]
+ *    a            # => [2, 3]
+ *    a.shift(1.1) # => [2]
+ *    a            # => [3]
+ *    a.shift(0)   # => []
+ *    a            # => [3]
+ *
+ *  If +count+ is large,
+ *  removes and returns all elements:
+ *
+ *    a = [0, 1, 2, 3]
+ *    a.shift(50) # => [0, 1, 2, 3]
+ *    a           # => []
+ *
+ *  If +self+ is empty, returns a new empty array.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
 static VALUE
-rb_ary_unshift_m(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+rb_ary_shift_m(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result;
+    long n;
+
+    if (argc == 0) {
+        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);
+    rb_ary_behead(ary,n);
+
+    return result;
+}
+
+VALUE
+rb_ary_behead(VALUE ary, long n)
 {
-    if (argc > 0) {
-	long len = RARRAY(ary)->len;
+    if (n <= 0) {
+        return ary;
+    }
 
-	/* make rooms by setting the last item */
-	rb_ary_store(ary, len + argc - 1, Qnil);
+    rb_ary_modify_check(ary);
 
-	/* sliding items */
-	MEMMOVE(RARRAY(ary)->ptr + argc, RARRAY(ary)->ptr, VALUE, len);
+    if (!ARY_SHARED_P(ary)) {
+        if (ARY_EMBED_P(ary) || RARRAY_LEN(ary) < ARY_DEFAULT_SIZE) {
+            RARRAY_PTR_USE(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;
+        }
 
-	MEMCPY(RARRAY(ary)->ptr, argv, VALUE, argc);
+        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 ary;
 }
 
-VALUE
-rb_ary_entry(ary, offset)
-    VALUE ary;
-    long offset;
+static VALUE
+make_room_for_unshift(VALUE ary, const VALUE *head, VALUE *sharedp, int argc, long capa, long len)
 {
-    if (RARRAY(ary)->len == 0) return Qnil;
+    if (head - sharedp < argc) {
+        long room = capa - len - argc;
 
-    if (offset < 0) {
-	offset = RARRAY(ary)->len + offset;
+        room -= room >> 4;
+        MEMMOVE((VALUE *)sharedp + argc + room, head, VALUE, len);
+        head = sharedp + argc + room;
     }
-    if (offset < 0 || RARRAY(ary)->len <= offset) {
-	return Qnil;
+    ARY_SET_PTR(ary, head - argc);
+    RUBY_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;
+    const VALUE *head, *sharedp;
+
+    rb_ary_modify(ary);
+    capa = ARY_CAPA(ary);
+    if (capa - (capa >> 6) <= new_len) {
+        ary_double_capa(ary, new_len);
+    }
+
+    /* use shared array for big "queues" */
+    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(ary);
+        return make_room_for_unshift(ary, head, (void *)sharedp, argc, capa, len);
     }
+    else {
+        /* sliding items */
+        RARRAY_PTR_USE(ary, ptr, {
+            MEMMOVE(ptr + argc, ptr, VALUE, len);
+        });
 
-    return RARRAY(ary)->ptr[offset];
+        ary_verify(ary);
+        return ary;
+    }
 }
 
 static VALUE
-rb_ary_subseq(ary, beg, len)
-    VALUE ary;
-    long beg, len;
+ary_ensure_room_for_unshift(VALUE ary, int argc)
 {
-    VALUE ary2;
+    long len = RARRAY_LEN(ary);
+    long new_len = len + argc;
 
-    if (beg > RARRAY(ary)->len) return Qnil;
-    if (beg < 0) {
-	len += beg;
-	beg = 0;
+    if (len > ARY_MAX_SIZE - argc) {
+        rb_raise(rb_eIndexError, "index %ld too big", new_len);
     }
-    if (len < 0) return Qnil;
-    if (beg + len > RARRAY(ary)->len) {
-	len = RARRAY(ary)->len - beg;
+    else if (! ARY_SHARED_P(ary)) {
+        return ary_modify_for_unshift(ary, argc);
     }
-    if (len < 0) {
-	len = 0;
+    else {
+        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(ary);
+            void *sharedp = (void *)RARRAY_CONST_PTR(shared_root);
+
+            rb_ary_modify_check(ary);
+            return make_room_for_unshift(ary, head, sharedp, argc, capa, len);
+        }
     }
-    if (len == 0) return rb_ary_new2(0);
+}
 
-    ary2 = rb_ary_new2(len);
-    MEMCPY(RARRAY(ary2)->ptr, RARRAY(ary)->ptr+beg, VALUE, len);
-    RARRAY(ary2)->len = len;
+/*
+ *  call-seq:
+ *    unshift(*objects) -> self
+ *    prepend(*objects) -> self
+ *
+ *  Prepends the given +objects+ to +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.unshift(:bam, :bat) # => [:bam, :bat, :foo, "bar", 2]
+ *
+ *  Related: Array#shift;
+ *  see also {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
 
-    return ary2;
+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;
+    }
+
+    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;
 }
 
 VALUE
-rb_ary_aref(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+rb_ary_unshift(VALUE ary, VALUE item)
 {
-    VALUE arg1, arg2;
-    long beg, len;
+    return rb_ary_unshift_m(1, &item, ary);
+}
 
-    if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) {
-	beg = NUM2LONG(arg1);
-	len = NUM2LONG(arg2);
-	if (beg < 0) {
-	    beg = RARRAY(ary)->len + beg;
-	}
-	return rb_ary_subseq(ary, beg, len);
+/* faster version - use this if you don't need to treat negative offset */
+static inline VALUE
+rb_ary_elt(VALUE ary, long offset)
+{
+    long len = RARRAY_LEN(ary);
+    if (len == 0) return Qnil;
+    if (offset < 0 || len <= offset) {
+        return Qnil;
     }
+    return RARRAY_AREF(ary, offset);
+}
+
+VALUE
+rb_ary_entry(VALUE ary, long offset)
+{
+    return rb_ary_entry_internal(ary, offset);
+}
+
+VALUE
+rb_ary_subseq_step(VALUE ary, long beg, long len, long step)
+{
+    VALUE klass;
+    long alen = RARRAY_LEN(ary);
+
+    if (beg > alen) return Qnil;
+    if (beg < 0 || len < 0) return Qnil;
+
+    if (alen < len || alen < beg + len) {
+        len = alen - beg;
+    }
+    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);
+}
+
+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:
+ *    self[offset] -> object or nil
+ *    self[offset, size] -> object or nil
+ *    self[range] -> object or nil
+ *    self[aseq] -> object or nil
+ *
+ *  Returns elements from +self+; does not modify +self+.
+ *
+ *  In brief:
+ *
+ *    a = [:foo, 'bar', 2]
+ *
+ *    # Single argument offset: returns one element.
+ *    a[0]     # => :foo          # Zero-based index.
+ *    a[-1]    # => 2             # Negative index counts backwards from end.
+ *
+ *    # Arguments offset and size: returns an array.
+ *    a[1, 2]  # => ["bar", 2]
+ *    a[-2, 2] # => ["bar", 2]    # Negative offset counts backwards from end.
+ *
+ *    # Single argument range: returns an array.
+ *    a[0..1]  # => [:foo, "bar"]
+ *    a[0..-2] # => [:foo, "bar"] # Negative range-begin counts backwards from end.
+ *    a[-2..2] # => ["bar", 2]    # Negative range-end counts backwards from end.
+ *
+ *  When a single integer argument +offset+ is given, returns the element at offset +offset+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0] # => :foo
+ *    a[2] # => 2
+ *    a # => [:foo, "bar", 2]
+ *
+ *  If +offset+ is negative, counts backwards from 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 +offset+ and +size+ are given,
+ *  returns a new array of size +size+ containing successive elements beginning at offset +offset+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 2] # => [:foo, "bar"]
+ *    a[1, 2] # => ["bar", 2]
+ *
+ *  If <tt>offset + size</tt> is greater than <tt>self.size</tt>,
+ *  returns all elements from offset +offset+ to the end:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a[0, 4] # => [:foo, "bar", 2]
+ *    a[1, 3] # => ["bar", 2]
+ *    a[2, 2] # => [2]
+ *
+ *  If <tt>offset == self.size</tt> and <tt>size >= 0</tt>,
+ *  returns a new empty array.
+ *
+ *  If +size+ is negative, returns +nil+.
+ *
+ *  When a single Range argument +range+ is given,
+ *  treats <tt>range.min</tt> as +offset+ above
+ *  and <tt>range.size</tt> as +size+ 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]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+VALUE
+rb_ary_aref(int argc, const VALUE *argv, VALUE ary)
+{
+    rb_check_arity(argc, 1, 2);
+    if (argc == 2) {
+        return rb_ary_aref2(ary, argv[0], argv[1]);
+    }
+    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);
+    }
+    return rb_ary_subseq(ary, beg, len);
+}
+
+VALUE
+rb_ary_aref1(VALUE ary, VALUE arg)
+{
+    long beg, len, step;
 
     /* special case - speeding up */
-    if (FIXNUM_P(arg1)) {
-	return rb_ary_entry(ary, FIX2LONG(arg1));
+    if (FIXNUM_P(arg)) {
+        return rb_ary_entry(ary, FIX2LONG(arg));
     }
-    else if (TYPE(arg1) == T_BIGNUM) {
-	rb_raise(rb_eIndexError, "index too big");
+    /* 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;
+      case Qnil:
+        return Qnil;
+      default:
+        return rb_ary_subseq_step(ary, beg, len, step);
+    }
+
+    return rb_ary_entry(ary, NUM2LONG(arg));
+}
+
+/*
+ *  call-seq:
+ *    at(index) -> object or nil
+ *
+ *  Returns the element of +self+ specified by the given +index+
+ *  or +nil+ if there is no such element;
+ *  +index+ must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
+ *
+ *  For non-negative +index+, returns the element of +self+ at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.at(0)   # => :foo
+ *    a.at(2)   # => 2
+ *    a.at(2.0) # => 2
+ *
+ *  For negative +index+, counts backwards from the end of +self+:
+ *
+ *    a.at(-2) # => "bar"
+ *
+ *  Related: Array#[];
+ *  see also {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+VALUE
+rb_ary_at(VALUE ary, VALUE pos)
+{
+    return rb_ary_entry(ary, NUM2LONG(pos));
+}
+
+#if 0
+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);
     }
     else {
-	/* check if idx is Range */
-	switch (rb_range_beg_len(arg1, &beg, &len, RARRAY(ary)->len, 0)) {
-	  case Qfalse:
-	    break;
-	  case Qnil:
-	    return Qnil;
-	  default:
-	    return rb_ary_subseq(ary, beg, len);
-	}
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_FIRST);
     }
-    return rb_ary_entry(ary, NUM2LONG(arg1));
 }
+#endif
 
 static VALUE
-rb_ary_at(ary, pos)
-    VALUE ary, pos;
+ary_first(VALUE self)
 {
-    return rb_ary_entry(ary, NUM2LONG(pos));
+    return (RARRAY_LEN(self) == 0) ? Qnil : RARRAY_AREF(self, 0);
 }
 
 static VALUE
-rb_ary_first(ary)
-    VALUE ary;
+ary_last(VALUE self)
 {
-    if (RARRAY(ary)->len == 0) return Qnil;
-    return RARRAY(ary)->ptr[0];
+    long len = RARRAY_LEN(self);
+    return (len == 0) ? Qnil : RARRAY_AREF(self, len-1);
 }
 
+VALUE
+rb_ary_last(int argc, const VALUE *argv, VALUE ary) // used by parse.y
+{
+    if (argc == 0) {
+        return ary_last(ary);
+    }
+    else {
+        return ary_take_first_or_last(argc, argv, ary, ARY_TAKE_LAST);
+    }
+}
+
+/*
+ *  call-seq:
+ *    fetch(index) -> element
+ *    fetch(index, default_value) -> element or default_value
+ *    fetch(index) {|index| ... } -> element or block_return_value
+ *
+ *  Returns the element of +self+ at offset +index+ if +index+ is in range; +index+ must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
+ *
+ *  With the single argument +index+ and no block,
+ *  returns the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1)   # => "bar"
+ *    a.fetch(1.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+ (which may be any object) and no block,
+ *  returns +default_value+ if +index+ is out-of-range:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.fetch(1, nil)  # => "bar"
+ *    a.fetch(3, :foo) # => :foo
+ *
+ *  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"
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 static VALUE
-rb_ary_last(ary)
-    VALUE ary;
+rb_ary_fetch(int argc, VALUE *argv, VALUE ary)
 {
-    if (RARRAY(ary)->len == 0) return Qnil;
-    return RARRAY(ary)->ptr[RARRAY(ary)->len-1];
+    VALUE pos, ifnone;
+    long block_given;
+    long idx;
+
+    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");
+    }
+    idx = NUM2LONG(pos);
+
+    if (idx < 0) {
+        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;
+    }
+    return RARRAY_AREF(ary, idx);
 }
 
+/*
+ * call-seq:
+ *   find(if_none_proc = nil) {|element| ... } -> object or nil
+ *   find(if_none_proc = nil) -> enumerator
+ *
+ * Returns the first element for which the block returns a truthy value.
+ *
+ * With a block given, calls the block with successive elements of the array;
+ * returns the first element for which the block returns a truthy value:
+ *
+ *   [1, 3, 5].find {|element| element > 2}                # => 3
+ *
+ * If no such element is found, calls +if_none_proc+ and returns its return value.
+ *
+ *   [1, 3, 5].find(proc {-1}) {|element| element > 12} # => -1
+ *
+ * With no block given, returns an Enumerator.
+ *
+ */
+
 static VALUE
-rb_ary_index(ary, val)
-    VALUE ary;
-    VALUE val;
+rb_ary_find(int argc, VALUE *argv, VALUE ary)
 {
-    long i;
+    VALUE if_none;
+    long idx;
 
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	if (rb_equal(RARRAY(ary)->ptr[i], val))
-	    return INT2NUM(i);
+    RETURN_ENUMERATOR(ary, argc, argv);
+    if_none = rb_check_arity(argc, 0, 1) ? argv[0] : Qnil;
+
+    for (idx = 0; idx < RARRAY_LEN(ary); idx++) {
+        VALUE elem = RARRAY_AREF(ary, idx);
+        if (RTEST(rb_yield(elem))) {
+            return elem;
+        }
+    }
+
+    if (!NIL_P(if_none)) {
+        return rb_funcallv(if_none, idCall, 0, 0);
     }
     return Qnil;
 }
 
+/*
+ * call-seq:
+ *   rfind(if_none_proc = nil) {|element| ... } -> object or nil
+ *   rfind(if_none_proc = nil) -> enumerator
+ *
+ * Returns the last element for which the block returns a truthy value.
+ *
+ * With a block given, calls the block with successive elements of the array in
+ * reverse order; returns the first element for which the block returns a truthy
+ * value:
+ *
+ *   [1, 2, 3, 4, 5, 6].rfind {|element| element < 5}       # => 4
+ *
+ * If no such element is found, calls +if_none_proc+ and returns its return value.
+ *
+ *   [1, 2, 3, 4].rfind(proc {0}) {|element| element < -2}  # => 0
+ *
+ * With no block given, returns an Enumerator.
+ *
+ */
+
 static VALUE
-rb_ary_rindex(ary, val)
-    VALUE ary;
-    VALUE val;
+rb_ary_rfind(int argc, VALUE *argv, VALUE ary)
 {
-    long i = RARRAY(ary)->len;
+    VALUE if_none;
+    long len, idx;
 
-    while (i--) {
-	if (rb_equal(RARRAY(ary)->ptr[i], val))
-	    return INT2NUM(i);
+    RETURN_ENUMERATOR(ary, argc, argv);
+    if_none = rb_check_arity(argc, 0, 1) ? argv[0] : Qnil;
+
+    idx = RARRAY_LEN(ary);
+    while (idx--) {
+        VALUE elem = RARRAY_AREF(ary, idx);
+        if (RTEST(rb_yield(elem))) {
+            return elem;
+        }
+
+        len = RARRAY_LEN(ary);
+        idx = (idx >= len) ? len : idx;
+    }
+
+    if (!NIL_P(if_none)) {
+        return rb_funcallv(if_none, idCall, 0, 0);
     }
     return Qnil;
 }
 
+/*
+ *  call-seq:
+ *    find_index(object) -> integer or nil
+ *    find_index {|element| ... } -> integer or nil
+ *    find_index -> new_enumerator
+ *    index(object) -> integer or nil
+ *    index {|element| ... } -> integer or nil
+ *    index -> new_enumerator
+ *
+ *  Returns the zero-based integer index of a specified element, or +nil+.
+ *
+ *  With only argument +object+ given,
+ *  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.
+ *
+ *  With only a block given,
+ *  calls the block with each successive element;
+ *  returns the index of the first element for which the block returns a truthy value:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.index {|element| element == 'bar' } # => 1
+ *
+ *  Returns +nil+ if the block never returns a truthy value.
+ *
+ *  With neither an argument nor a block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_indexes(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+rb_ary_index(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE new_ary;
+    VALUE val;
     long i;
 
-    new_ary = rb_ary_new2(argc);
-    for (i=0; i<argc; i++) {
-	rb_ary_push(new_ary, rb_ary_aref(1, argv+i, ary));
+    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_check_arity(argc, 0, 1);
+    val = argv[0];
+    if (rb_block_given_p())
+        rb_warn("given block not used");
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
+    }
+    return Qnil;
+}
+
+/*
+ *  call-seq:
+ *    rindex(object) -> integer or nil
+ *    rindex {|element| ... } -> integer or nil
+ *    rindex -> new_enumerator
+ *
+ *  Returns the index of the last element for which <tt>object == element</tt>.
+ *
+ *  With argument +object+ given, returns the index of the last such element found:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex('bar') # => 3
+ *
+ *  Returns +nil+ if no such object found.
+ *
+ *  With a block given, calls the block with each successive element;
+ *  returns the index of the last element for which the block returns a truthy value:
+ *
+ *    a = [:foo, 'bar', 2, 'bar']
+ *    a.rindex {|element| element == 'bar' } # => 3
+ *
+ *  Returns +nil+ if the block never returns a truthy value.
+ *
+ *  When neither an argument nor a block is given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+static VALUE
+rb_ary_rindex(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE val;
+    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 > (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");
+    while (i--) {
+        VALUE e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, val)) {
+            return LONG2NUM(i);
+        }
+        if (i > RARRAY_LEN(ary)) {
+            break;
+        }
     }
+    return Qnil;
+}
 
-    return new_ary;
+VALUE
+rb_ary_to_ary(VALUE obj)
+{
+    VALUE tmp = rb_check_array_type(obj);
+
+    if (!NIL_P(tmp)) return tmp;
+    return rb_ary_new3(1, obj);
 }
 
 static void
-rb_ary_replace(ary, beg, len, rpl)
-    VALUE ary, rpl;
-    long beg, len;
+rb_ary_splice(VALUE ary, long beg, long len, const VALUE *rptr, long rlen)
 {
-    if (len < 0) rb_raise(rb_eIndexError, "negative length %d", len);
+    long olen;
+    long rofs;
+
+    if (len < 0) rb_raise(rb_eIndexError, "negative length (%ld)", len);
+    olen = RARRAY_LEN(ary);
     if (beg < 0) {
-	beg += RARRAY(ary)->len;
+        beg += olen;
+        if (beg < 0) {
+            rb_raise(rb_eIndexError, "index %ld too small for array; minimum: %ld",
+                     beg - olen, -olen);
+        }
     }
-    if (beg < 0) {
-	beg -= RARRAY(ary)->len;
-	rb_raise(rb_eIndexError, "index %d out of array", beg);
+    if (olen < len || olen < beg + len) {
+        len = olen - beg;
     }
-    if (beg + len > RARRAY(ary)->len) {
-	len = RARRAY(ary)->len - beg;
+
+    {
+        const VALUE *optr = RARRAY_CONST_PTR(ary);
+        rofs = (rptr >= optr && rptr < optr + olen) ? rptr - optr : -1;
     }
 
-    if (NIL_P(rpl)) {
-	rpl = rb_ary_new2(0);
+    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(ary) + rofs;
+            ary_memcpy0(ary, beg, rlen, rptr, target_ary);
+        }
+        ARY_SET_LEN(ary, len);
     }
-    else if (TYPE(rpl) != T_ARRAY) {
-	rpl = rb_ary_new3(1, rpl);
+    else {
+        long 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) {
+            RARRAY_PTR_USE(ary, ptr,
+                                     MEMMOVE(ptr + beg + rlen, ptr + beg + len,
+                                             VALUE, olen - (beg + len)));
+            ARY_SET_LEN(ary, alen);
+        }
+        if (rlen > 0) {
+            if (rofs == -1) {
+                rb_gc_writebarrier_remember(ary);
+            }
+            else {
+                /* In this case, we're copying from a region in this array, so
+                 * we don't need to fire the write barrier. */
+                rptr = RARRAY_CONST_PTR(ary) + rofs;
+            }
+
+            /* do not use RARRAY_PTR() because it can causes GC.
+             * ary can contain T_NONE object because it is not cleared.
+             */
+            RARRAY_PTR_USE(ary, ptr,
+                                     MEMMOVE(ptr + beg, rptr, VALUE, rlen));
+        }
     }
+}
+
+void
+rb_ary_set_len(VALUE ary, long len)
+{
+    long capa;
+
+    rb_ary_modify_check(ary);
+    if (ARY_SHARED_P(ary)) {
+        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);
+    }
+    ARY_SET_LEN(ary, len);
+}
+
+VALUE
+rb_ary_resize(VALUE ary, long len)
+{
+    long olen;
 
     rb_ary_modify(ary);
-    if (beg >= RARRAY(ary)->len) {
-	len = beg + RARRAY(rpl)->len;
-	if (len >= RARRAY(ary)->capa) {
-	    RARRAY(ary)->capa=len;
-	    REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
-	}
-	rb_mem_clear(RARRAY(ary)->ptr+RARRAY(ary)->len, beg-RARRAY(ary)->len);
-	MEMCPY(RARRAY(ary)->ptr+beg, RARRAY(rpl)->ptr, VALUE, RARRAY(rpl)->len);
-	RARRAY(ary)->len = len;
+    olen = RARRAY_LEN(ary);
+    if (len == olen) return ary;
+    if (len > ARY_MAX_SIZE) {
+        rb_raise(rb_eIndexError, "index %ld too big", len);
     }
-    else {
-	long alen;
+    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);
+    }
+    else if (ARY_EMBED_P(ary)) {
+        ARY_SET_EMBED_LEN(ary, len);
+    }
+    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);
 
-	if (beg + len > RARRAY(ary)->len) {
-	    len = RARRAY(ary)->len - beg;
-	}
+        FL_SET_EMBED(ary);
 
-	alen = RARRAY(ary)->len + RARRAY(rpl)->len - len;
-	if (alen >= RARRAY(ary)->capa) {
-	    RARRAY(ary)->capa=alen;
-	    REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
-	}
+        MEMCPY((VALUE *)ARY_EMBED_PTR(ary), ptr, VALUE, len); /* WB: no new reference */
+        ARY_SET_EMBED_LEN(ary, len);
 
-	if (len != RARRAY(rpl)->len) {
-	    MEMMOVE(RARRAY(ary)->ptr+beg+RARRAY(rpl)->len, RARRAY(ary)->ptr+beg+len,
-		    VALUE, RARRAY(ary)->len-(beg+len));
-	    RARRAY(ary)->len = alen;
-	}
-	MEMCPY(RARRAY(ary)->ptr+beg, RARRAY(rpl)->ptr, VALUE, RARRAY(rpl)->len);
+        if (is_malloc_ptr) ruby_xfree_sized((void *)ptr, ptr_capa);
+    }
+    else {
+        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
-rb_ary_aset(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+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(rpl), RARRAY_LEN(rpl));
+    RB_GC_GUARD(rpl);
+    return val;
+}
+
+/*
+ *  call-seq:
+ *    self[index] = object -> object
+ *    self[start, length] = object -> object
+ *    self[range] = object -> object
+ *
+ *  Assigns elements in +self+, based on the given +object+; returns +object+.
+ *
+ *  In brief:
+ *
+ *      a_orig = [:foo, 'bar', 2]
+ *
+ *      # With argument index.
+ *      a = a_orig.dup
+ *      a[0] = 'foo' # => "foo"
+ *      a # => ["foo", "bar", 2]
+ *      a = a_orig.dup
+ *      a[7] = 'foo' # => "foo"
+ *      a # => [:foo, "bar", 2, nil, nil, nil, nil, "foo"]
+ *
+ *      # With arguments start and length.
+ *      a = a_orig.dup
+ *      a[0, 2] = 'foo' # => "foo"
+ *      a # => ["foo", 2]
+ *      a = a_orig.dup
+ *      a[6, 50] = 'foo' # => "foo"
+ *      a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *      # With argument range.
+ *      a = a_orig.dup
+ *      a[0..1] = 'foo' # => "foo"
+ *      a # => ["foo", 2]
+ *      a = a_orig.dup
+ *      a[6..50] = 'foo' # => "foo"
+ *      a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
+ *
+ *  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 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..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>,
+ *  extends the array with +nil+, 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"]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+static VALUE
+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_replace(ary, NUM2LONG(argv[0]), NUM2LONG(argv[1]), argv[2]);
-	return argv[2];
-    }
-    if (argc != 2) {
-	rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)", argc);
+        beg = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_aset_by_rb_ary_splice(ary, beg, len, argv[2]);
     }
     if (FIXNUM_P(argv[0])) {
-	offset = FIX2LONG(argv[0]);
-	goto fixnum;
-    }
-    else if (rb_range_beg_len(argv[0], &beg, &len, RARRAY(ary)->len, 1)) {
-	/* check if idx is Range */
-	rb_ary_replace(ary, beg, len, argv[1]);
-	return argv[1];
+        offset = FIX2LONG(argv[0]);
+        return ary_aset_by_rb_ary_store(ary, offset, argv[1]);
     }
-    if (TYPE(argv[0]) == T_BIGNUM) {
-	rb_raise(rb_eIndexError, "index too big");
+    if (rb_range_beg_len(argv[0], &beg, &len, RARRAY_LEN(ary), 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:
+ *    insert(index, *objects) -> self
+ *
+ *  Inserts the given +objects+ as elements of +self+;
+ *  returns +self+.
+ *
+ *  When +index+ is non-negative, inserts +objects+
+ *  _before_ the element at offset +index+:
+ *
+ *    a = ['a', 'b', 'c']     # => ["a", "b", "c"]
+ *    a.insert(1, :x, :y, :z) # => ["a", :x, :y, :z, "b", "c"]
+ *
+ *  Extends the array if +index+ is beyond the array (<tt>index >= self.size</tt>):
+ *
+ *    a = ['a', 'b', 'c']     # => ["a", "b", "c"]
+ *    a.insert(5, :x, :y, :z) # => ["a", "b", "c", nil, nil, :x, :y, :z]
+ *
+ *  When +index+ is negative, inserts +objects+
+ *  _after_ the element at offset <tt>index + self.size</tt>:
+ *
+ *    a = ['a', 'b', 'c']      # => ["a", "b", "c"]
+ *    a.insert(-2, :x, :y, :z) # => ["a", "b", :x, :y, :z, "c"]
+ *
+ *  With no +objects+ given, does nothing:
+ *
+ *    a = ['a', 'b', 'c'] # => ["a", "b", "c"]
+ *    a.insert(1)         # => ["a", "b", "c"]
+ *    a.insert(50)        # => ["a", "b", "c"]
+ *    a.insert(-50)       # => ["a", "b", "c"]
+ *
+ *  Raises IndexError if +objects+ are given and +index+ is negative and out of range.
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+static VALUE
+rb_ary_insert(int argc, VALUE *argv, VALUE ary)
+{
+    long pos;
+
+    rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
+    rb_ary_modify_check(ary);
+    pos = NUM2LONG(argv[0]);
+    if (argc == 1) return ary;
+    if (pos == -1) {
+        pos = RARRAY_LEN(ary);
+    }
+    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, argv + 1, argc - 1);
+    return ary;
+}
+
+static VALUE
+rb_ary_length(VALUE ary);
+
+static VALUE
+ary_enum_length(VALUE ary, VALUE args, VALUE eobj)
+{
+    return rb_ary_length(ary);
 }
 
+// These array primitives enable tight compatibility with the C implementation
+// in terms of what method calls happen. They can use unchecked utilities such as
+// FIX2LONG since unlike userland Ruby code, these methods cannot be traced with
+// TracePoint (or ruby/debug.h APIs) and have their local variables changed from
+// underneath them.
+
+// Return true if the index is at or past the end of the array.
 VALUE
-rb_ary_each(ary)
-    VALUE ary;
+rb_jit_ary_at_end(rb_execution_context_t *ec, VALUE self, VALUE index)
 {
-    long i;
+    return FIX2LONG(index) >= RARRAY_LEN(self) ? Qtrue : Qfalse;
+}
+
+// Return the element at the given fixnum index.
+VALUE
+rb_jit_ary_at(rb_execution_context_t *ec, VALUE self, VALUE index)
+{
+    return RARRAY_AREF(self, FIX2LONG(index));
+}
 
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	rb_yield(RARRAY(ary)->ptr[i]);
+// Increment a fixnum by 1.
+VALUE
+rb_jit_fixnum_inc(rb_execution_context_t *ec, VALUE self, VALUE num)
+{
+    return LONG2FIX(FIX2LONG(num) + 1);
+}
+
+// Push a value onto an array and return the value.
+VALUE
+rb_jit_ary_push(rb_execution_context_t *ec, VALUE self, VALUE ary, VALUE val)
+{
+    rb_ary_push(ary, val);
+    return val;
+}
+
+/*
+ *  call-seq:
+ *    each {|element| ... } -> self
+ *    each -> new_enumerator
+ *
+ *  With a block given, iterates over the elements of +self+,
+ *  passing each 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:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each {|element| puts element; a.clear if element.to_s.start_with?('b') }
+ *
+ *  Output:
+ *
+ *    foo
+ *    bar
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+
+VALUE
+rb_ary_each(VALUE ary)
+{
+    long i;
+    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));
     }
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    each_index {|index| ... } -> self
+ *    each_index -> new_enumerator
+ *
+ *  With a block given, iterates over the elements of +self+,
+ *  passing each <i>array index</i> to the block;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index|  puts "#{index} #{a[index]}" }
+ *
+ *  Output:
+ *
+ *    0 foo
+ *    1 bar
+ *    2 2
+ *
+ *  Allows the array to be modified during iteration:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.each_index {|index| puts index; a.clear if index > 0 }
+ *    a # => []
+ *
+ *  Output:
+ *
+ *    0
+ *    1
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+
 static VALUE
-rb_ary_each_index(ary)
-    VALUE ary;
+rb_ary_each_index(VALUE ary)
 {
     long i;
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
 
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	rb_yield(INT2NUM(i));
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        rb_yield(LONG2NUM(i));
     }
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    reverse_each {|element| ... } -> self
+ *    reverse_each -> Enumerator
+ *
+ *  When a block given, iterates backwards over the elements of +self+,
+ *  passing, in reverse order, each element to the block;
+ *  returns +self+:
+ *
+ *    a = []
+ *    [0, 1, 2].reverse_each {|element| a.push(element) }
+ *    a # => [2, 1, 0]
+ *
+ *  Allows the array to be modified during iteration:
+ *
+ *    a = ['a', 'b', 'c']
+ *    a.reverse_each {|element| a.clear if element.start_with?('b') }
+ *    a # => []
+ *
+ *  When no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+
 static VALUE
-rb_ary_reverse_each(ary)
-    VALUE ary;
+rb_ary_reverse_each(VALUE ary)
 {
-    long len = RARRAY(ary)->len;
+    long len;
 
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    len = RARRAY_LEN(ary);
     while (len--) {
-	rb_yield(RARRAY(ary)->ptr[len]);
+        long nlen;
+        rb_yield(RARRAY_AREF(ary, len));
+        nlen = RARRAY_LEN(ary);
+        if (nlen < len) {
+            len = nlen;
+        }
     }
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    length -> integer
+ *    size -> integer
+ *
+ *  Returns the count of elements in +self+:
+ *
+ *    [0, 1, 2].length # => 3
+ *    [].length        # => 0
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_length(ary)
-    VALUE ary;
+rb_ary_length(VALUE ary)
 {
-    return INT2NUM(RARRAY(ary)->len);
+    long len = RARRAY_LEN(ary);
+    return LONG2NUM(len);
 }
 
+/*
+ *  call-seq:
+ *    empty?  -> true or false
+ *
+ *  Returns +true+ if the count of elements in +self+ is zero,
+ *  +false+ otherwise.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_empty_p(ary)
-    VALUE ary;
+rb_ary_empty_p(VALUE ary)
 {
-    if (RARRAY(ary)->len == 0)
-	return Qtrue;
-    return Qfalse;
+    return RBOOL(RARRAY_LEN(ary) == 0);
 }
 
-static VALUE
-rb_ary_clone(ary)
-    VALUE ary;
+VALUE
+rb_ary_dup(VALUE ary)
 {
-    VALUE clone = rb_ary_new2(RARRAY(ary)->len);
-
-    CLONESETUP(clone, ary);
-    MEMCPY(RARRAY(clone)->ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
-    RARRAY(clone)->len = RARRAY(ary)->len;
-    return clone;
+    long len = RARRAY_LEN(ary);
+    VALUE dup = rb_ary_new2(len);
+    ary_memcpy(dup, 0, len, RARRAY_CONST_PTR(ary));
+    ARY_SET_LEN(dup, len);
+
+    ary_verify(ary);
+    ary_verify(dup);
+    return dup;
 }
 
-static VALUE
-to_ary(ary)
-    VALUE ary;
+VALUE
+rb_ary_resurrect(VALUE ary)
 {
-    return rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
+    return ary_make_partial(ary, rb_cArray, 0, RARRAY_LEN(ary));
 }
 
 extern VALUE rb_output_fs;
 
+static void ary_join_1(VALUE obj, VALUE ary, VALUE sep, long i, VALUE result, int *first);
+
 static VALUE
-inspect_join(ary, arg)
-    VALUE ary;
-    VALUE *arg;
+recursive_join(VALUE obj, VALUE argp, int recur)
 {
-    return rb_ary_join(arg[0], arg[1]);
+    VALUE *arg = (VALUE *)argp;
+    VALUE ary = arg[0];
+    VALUE sep = arg[1];
+    VALUE result = arg[2];
+    int *first = (int *)arg[3];
+
+    if (recur) {
+        rb_raise(rb_eArgError, "recursive array join");
+    }
+    else {
+        ary_join_1(obj, ary, sep, 0, result, first);
+    }
+    return Qnil;
 }
 
-VALUE
-rb_ary_join(ary, sep)
-    VALUE ary, sep;
+static long
+ary_join_0(VALUE ary, VALUE sep, long max, VALUE result)
 {
     long i;
-    int taint = 0;
-    VALUE result, tmp;
-
-    if (RARRAY(ary)->len == 0) return rb_str_new(0, 0);
-    if (OBJ_TAINTED(ary)) taint = 1;
-    if (OBJ_TAINTED(sep)) taint = 1;
-
-    tmp = RARRAY(ary)->ptr[0];
-    if (OBJ_TAINTED(tmp)) taint = 1;
-    switch (TYPE(tmp)) {
-      case T_STRING:
-	result = rb_str_dup(tmp);
-	break;
-      case T_ARRAY:
-	if (rb_inspecting_p(tmp)) {
-	    result = rb_str_new2("[...]");
-	}
-	else {
-	    VALUE args[2];
-
-	    args[0] = tmp;
-	    args[1] = sep;
-	    result = rb_protect_inspect(inspect_join, ary, (VALUE)args);
-	}
-	break;
-      default:
-	result = rb_str_dup(rb_obj_as_string(tmp));
-	break;
-    }
-
-    for (i=1; i<RARRAY(ary)->len; i++) {
-	tmp = RARRAY(ary)->ptr[i];
-	switch (TYPE(tmp)) {
-	  case T_STRING:
-	    break;
-	  case T_ARRAY:
-	    if (rb_inspecting_p(tmp)) {
-		tmp = rb_str_new2("[...]");
-	    }
-	    else {
-		VALUE args[2];
-
-		args[0] = tmp;
-		args[1] = sep;
-		tmp = rb_protect_inspect(inspect_join, ary, (VALUE)args);
-	    }
-	    break;
-	  default:
-	    tmp = rb_obj_as_string(tmp);
-	}
-	if (!NIL_P(sep)) rb_str_append(result, sep);
-	rb_str_append(result, tmp);
-	if (OBJ_TAINTED(tmp)) taint = 1;
-    }
-
-    if (taint) OBJ_TAINT(result);
+    VALUE val;
+
+    if (max > 0) rb_enc_copy(result, RARRAY_AREF(ary, 0));
+    for (i=0; i<max; i++) {
+        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);
+    }
+}
+
+static void
+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)) {
+            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);
+        }
+    }
+}
+
+VALUE
+rb_ary_join(VALUE ary, VALUE sep)
+{
+    long len = 1, i;
+    VALUE val, tmp, result;
+
+    if (RARRAY_LEN(ary) == 0) return rb_usascii_str_new(0, 0);
+
+    if (!NIL_P(sep)) {
+        StringValue(sep);
+        len += RSTRING_LEN(sep) * (RARRAY_LEN(ary) - 1);
+    }
+    long len_memo = RARRAY_LEN(ary);
+    for (i=0; i < len_memo; i++) {
+        val = RARRAY_AREF(ary, i);
+        if (RB_UNLIKELY(!RB_TYPE_P(val, T_STRING))) {
+            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_memo = RARRAY_LEN(ary);
+        }
+        else {
+            len += RSTRING_LEN(val);
+        }
+    }
+
+    result = rb_str_new(0, len);
+    rb_str_set_len(result, 0);
+
+    ary_join_0(ary, sep, RARRAY_LEN(ary), result);
+
     return result;
 }
 
+/*
+ *  call-seq:
+ *    join(separator = $,) -> new_string
+ *
+ *  Returns the new string formed by joining the converted elements of +self+;
+ *  for each element +element+:
+ *
+ *  - Converts recursively using <tt>element.join(separator)</tt>
+ *    if +element+ is a <tt>kind_of?(Array)</tt>.
+ *  - Otherwise, converts using <tt>element.to_s</tt>.
+ *
+ *  With no argument given, joins using the output field separator, <tt>$,</tt>:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    $, # => nil
+ *    a.join # => "foobar2"
+ *
+ *  With string argument +separator+ given, 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"
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
 static VALUE
-rb_ary_join_m(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+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);
 }
 
-VALUE
-rb_ary_to_s(ary)
-    VALUE ary;
+static VALUE
+inspect_ary(VALUE ary, VALUE dummy, int recur)
 {
-    VALUE str;
+    long i;
+    VALUE s, str;
 
-    if (RARRAY(ary)->len == 0) return rb_str_new(0, 0);
-    str = rb_ary_join(ary, rb_output_fs);
-    if (NIL_P(str)) return rb_str_new(0, 0);
+    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 (i > 0) rb_str_buf_cat2(str, ", ");
+        else rb_enc_copy(str, s);
+        rb_str_buf_append(str, s);
+    }
+    rb_str_buf_cat2(str, "]");
     return str;
 }
 
-static ID inspect_key;
+/*
+ *  call-seq:
+ *    inspect -> new_string
+ *    to_s -> new_string
+ *
+ *  Returns the new string formed by calling method <tt>#inspect</tt>
+ *  on each array element:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.inspect # => "[:foo, \"bar\", 2]"
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
 
-struct inspect_arg {
-    VALUE (*func)();
-    VALUE arg1, arg2;
-};
+static VALUE
+rb_ary_inspect(VALUE ary)
+{
+    if (RARRAY_LEN(ary) == 0) return rb_usascii_str_new2("[]");
+    return rb_exec_recursive(inspect_ary, ary, 0);
+}
 
 VALUE
-inspect_call(arg)
-    struct inspect_arg *arg;
+rb_ary_to_s(VALUE ary)
 {
-    return (*arg->func)(arg->arg1, arg->arg2);
+    return rb_ary_inspect(ary);
 }
 
+/*
+ *  call-seq:
+ *    to_a -> self or new_array
+ *
+ *  When +self+ is an instance of \Array, returns +self+.
+ *
+ *  Otherwise, returns a new array containing the elements of +self+:
+ *
+ *    class MyArray < Array; end
+ *    my_a = MyArray.new(['foo', 'bar', 'two'])
+ *    a = my_a.to_a
+ *    a # => ["foo", "bar", "two"]
+ *    a.class # => Array # Not MyArray.
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
 static VALUE
-inspect_ensure(obj)
-    VALUE obj;
+rb_ary_to_a(VALUE ary)
 {
-    VALUE inspect_tbl;
+    if (rb_obj_class(ary) != rb_cArray) {
+        VALUE dup = rb_ary_new2(RARRAY_LEN(ary));
+        rb_ary_replace(dup, ary);
+        return dup;
+    }
+    return ary;
+}
 
-    inspect_tbl = rb_thread_local_aref(rb_thread_current(), inspect_key);
-    rb_ary_pop(inspect_tbl);
-    return 0;
+/*
+ *  call-seq:
+ *    to_h -> new_hash
+ *    to_h {|element| ... } -> new_hash
+ *
+ *  Returns a new hash formed from +self+.
+ *
+ *  With no block given, each element of +self+ must be a 2-element sub-array;
+ *  forms each sub-array into a key-value pair in the new hash:
+ *
+ *    a = [['foo', 'zero'], ['bar', 'one'], ['baz', 'two']]
+ *    a.to_h # => {"foo" => "zero", "bar" => "one", "baz" => "two"}
+ *    [].to_h # => {}
+ *
+ *  With a block given, the block must return a 2-element array;
+ *  calls the block with each element of +self+;
+ *  forms each returned array into a key-value pair in the returned hash:
+ *
+ *    a = ['foo', :bar, 1, [2, 3], {baz: 4}]
+ *    a.to_h {|element| [element, element.class] }
+ *    # => {"foo" => String, bar: Symbol, 1 => Integer, [2, 3] => Array, {baz: 4} => Hash}
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
+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;
 }
 
-VALUE
-rb_protect_inspect(func, obj, arg)
-    VALUE (*func)();
-    VALUE obj, arg;
+/*
+ *  call-seq:
+ *    to_ary -> self
+ *
+ *  Returns +self+.
+ */
+
+static VALUE
+rb_ary_to_ary_m(VALUE ary)
 {
-    struct inspect_arg iarg;
-    VALUE inspect_tbl;
-    VALUE id;
+    return ary;
+}
 
-    if (!inspect_key) {
-	inspect_key = rb_intern("__inspect_key__");
-    }
-    inspect_tbl = rb_thread_local_aref(rb_thread_current(), inspect_key);
-    if (NIL_P(inspect_tbl)) {
-	inspect_tbl = rb_ary_new();
-	rb_thread_local_aset(rb_thread_current(), inspect_key, inspect_tbl);
-    }
-    id = rb_obj_id(obj);
-    if (rb_ary_includes(inspect_tbl, id)) {
-	return (*func)(obj, arg);
+static void
+ary_reverse(VALUE *p1, VALUE *p2)
+{
+    while (p1 < p2) {
+        VALUE tmp = *p1;
+        *p1++ = *p2;
+        *p2-- = tmp;
     }
-    rb_ary_push(inspect_tbl, id);
-    iarg.func = func;
-    iarg.arg1 = obj;
-    iarg.arg2 = arg;
-
-    return rb_ensure(inspect_call, (VALUE)&iarg, inspect_ensure, obj);
 }
 
 VALUE
-rb_inspecting_p(obj)
-    VALUE obj;
+rb_ary_reverse(VALUE ary)
 {
-    VALUE inspect_tbl;
+    VALUE *p2;
+    long len = RARRAY_LEN(ary);
 
-    if (!inspect_key) return Qfalse;
-    inspect_tbl = rb_thread_local_aref(rb_thread_current(), inspect_key);
-    if (NIL_P(inspect_tbl)) return Qfalse;
-    return rb_ary_includes(inspect_tbl, rb_obj_id(obj));
+    rb_ary_modify(ary);
+    if (len > 1) {
+        RARRAY_PTR_USE(ary, p1, {
+            p2 = p1 + len - 1;	/* points last item */
+            ary_reverse(p1, p2);
+        }); /* WB: no new reference */
+    }
+    return ary;
 }
 
+/*
+ *  call-seq:
+ *    reverse! -> self
+ *
+ *  Reverses the order of the elements of +self+;
+ *  returns +self+:
+ *
+ *    a = [0, 1, 2]
+ *    a.reverse! # => [2, 1, 0]
+ *    a          # => [2, 1, 0]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
 static VALUE
-inspect_ary(ary)
-    VALUE ary;
+rb_ary_reverse_bang(VALUE ary)
 {
-    int tainted = OBJ_TAINTED(ary);
-    long i = 0;
-    VALUE s, str;
+    return rb_ary_reverse(ary);
+}
 
-    str = rb_str_new2("[");
+/*
+ *  call-seq:
+ *    reverse -> new_array
+ *
+ *  Returns a new array containing the elements of +self+ in reverse order:
+ *
+ *    [0, 1, 2].reverse # => [2, 1, 0]
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
 
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	s = rb_inspect(RARRAY(ary)->ptr[i]);
-	tainted = OBJ_TAINTED(s);
-	if (i > 0) rb_str_cat2(str, ", ");
-	rb_str_append(str, s);
-    }
-    rb_str_cat(str, "]", 1);
+static VALUE
+rb_ary_reverse_m(VALUE ary)
+{
+    long len = RARRAY_LEN(ary);
+    VALUE dup = rb_ary_new2(len);
 
-    if (tainted) OBJ_TAINT(str);
-    return str;
+    if (len > 0) {
+        const VALUE *p1 = RARRAY_CONST_PTR(ary);
+        VALUE *p2 = (VALUE *)RARRAY_CONST_PTR(dup) + len - 1;
+        do *p2-- = *p1++; while (--len > 0);
+    }
+    ARY_SET_LEN(dup, RARRAY_LEN(ary));
+    return dup;
 }
 
-static VALUE
-rb_ary_inspect(ary)
-    VALUE ary;
+static inline long
+rotate_count(long cnt, long len)
 {
-    if (RARRAY(ary)->len == 0) return rb_str_new2("[]");
-    if (rb_inspecting_p(ary)) return rb_str_new2("[...]");
-    return rb_protect_inspect(inspect_ary, ary, 0);
+    return (cnt < 0) ? (len - (~cnt % len) - 1) : (cnt % len);
 }
 
-static VALUE
-rb_ary_to_a(ary)
-    VALUE ary;
+static void
+ary_rotate_ptr(VALUE *ptr, long len, long cnt)
 {
-    return ary;
+    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_reverse(ary)
-    VALUE ary;
+rb_ary_rotate(VALUE ary, long cnt)
 {
-    VALUE *p1, *p2;
-    VALUE tmp;
-
-    if (RARRAY(ary)->len <= 1) return ary;
     rb_ary_modify(ary);
 
-    p1 = RARRAY(ary)->ptr;
-    p2 = p1 + RARRAY(ary)->len - 1;	/* points last item */
-
-    while (p1 < p2) {
-	tmp = *p1;
-	*p1 = *p2;
-	*p2 = tmp;
-	p1++; p2--;
+    if (cnt != 0) {
+        long len = RARRAY_LEN(ary);
+        if (len > 1 && (cnt = rotate_count(cnt, len)) > 0) {
+            RARRAY_PTR_USE(ary, ptr, ary_rotate_ptr(ptr, len, cnt));
+            return ary;
+        }
     }
+    return Qnil;
+}
+
+/*
+ *  call-seq:
+ *    rotate!(count = 1) -> self
+ *
+ *  Rotates +self+ in place by moving elements from one end to the other; returns +self+.
+ *
+ *  With non-negative numeric +count+,
+ *  rotates +count+ elements from the beginning to the end:
+ *
+ *    [0, 1, 2, 3].rotate!(2)   # => [2, 3, 0, 1]
+      [0, 1, 2, 3].rotate!(2.1) # => [2, 3, 0, 1]
+ *
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
+ *
+ *    [0, 1, 2, 3].rotate!(21) # => [1, 2, 3, 0]
+ *
+ *  If +count+ is zero, rotates no elements:
+ *
+ *    [0, 1, 2, 3].rotate!(0) # => [0, 1, 2, 3]
+ *
+ *  With a negative numeric +count+, rotates in the opposite direction,
+ *  from end to beginning:
+ *
+ *    [0, 1, 2, 3].rotate!(-1) # => [3, 0, 1, 2]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    [0, 1, 2, 3].rotate!(-21) # => [3, 0, 1, 2]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
 
+static VALUE
+rb_ary_rotate_bang(int argc, VALUE *argv, VALUE ary)
+{
+    long n = (rb_check_arity(argc, 0, 1) ? NUM2LONG(argv[0]) : 1);
+    rb_ary_rotate(ary, n);
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    rotate(count = 1) -> new_array
+ *
+ *  Returns a new array formed from +self+ with elements
+ *  rotated from one end to the other.
+ *
+ *  With non-negative numeric +count+,
+ *  rotates elements from the beginning to the end:
+ *
+ *    [0, 1, 2, 3].rotate(2)   # => [2, 3, 0, 1]
+ *    [0, 1, 2, 3].rotate(2.1) # => [2, 3, 0, 1]
+ *
+ *  If +count+ is large, uses <tt>count % array.size</tt> as the count:
+ *
+ *    [0, 1, 2, 3].rotate(22) # => [2, 3, 0, 1]
+ *
+ *  With a +count+ of zero, rotates no elements:
+ *
+ *    [0, 1, 2, 3].rotate(0) # => [0, 1, 2, 3]
+ *
+ *  With negative numeric +count+, rotates in the opposite direction,
+ *  from the end to the beginning:
+ *
+ *    [0, 1, 2, 3].rotate(-1) # => [3, 0, 1, 2]
+ *
+ *  If +count+ is small (far from zero), uses <tt>count % array.size</tt> as the count:
+ *
+ *    [0, 1, 2, 3].rotate(-21) # => [3, 0, 1, 2]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 static VALUE
-rb_ary_reverse_bang(ary)
-    VALUE ary;
+rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
 {
-    if (RARRAY(ary)->len <= 1) return Qnil;
-    return rb_ary_reverse(ary);
+    VALUE rotated;
+    const VALUE *ptr;
+    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_CONST_PTR(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;
 }
 
-static VALUE
-rb_ary_reverse_m(ary)
+struct ary_sort_data {
     VALUE ary;
+    VALUE receiver;
+};
+
+static VALUE
+sort_reentered(VALUE ary)
 {
-    return rb_ary_reverse(rb_obj_dup(ary));
+    if (RBASIC(ary)->klass) {
+        rb_raise(rb_eRuntimeError, "sort reentered");
+    }
+    return Qnil;
 }
 
-static ID cmp;
+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(a, b)
-    VALUE *a, *b;
+sort_1(const void *ap, const void *bp, void *dummy)
 {
-    VALUE retval = rb_yield(rb_assoc_new(*a, *b));
-    return NUM2INT(retval);
+    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;
+
+    args[0] = a;
+    args[1] = b;
+    retval = rb_yield_values2(2, args);
+    n = rb_cmpint(retval, a, b);
+    sort_returned(data);
+    return n;
 }
 
 static int
-sort_2(a, b)
-    VALUE *a, *b;
+sort_2(const void *ap, const void *bp, void *dummy)
 {
-    VALUE retval;
-
-    if (FIXNUM_P(*a)) {
-	if (FIXNUM_P(*b)) return *a - *b;
+    struct ary_sort_data *data = dummy;
+    VALUE retval = sort_reentered(data->ary);
+    VALUE a = *(const VALUE *)ap, b = *(const VALUE *)bp;
+    int n;
+
+    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);
     }
-    else if (TYPE(*a) == T_STRING && TYPE(*b) == T_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, cmp, 1, *b);
-    return NUM2INT(retval);
+    retval = rb_funcallv(a, id_cmp, 1, &b);
+    n = rb_cmpint(retval, a, b);
+    sort_returned(data);
+
+    return n;
 }
 
-static VALUE
-sort_internal(ary)
-    VALUE ary;
+/*
+ *  call-seq:
+ *    sort! -> self
+ *    sort! {|a, b| ... } -> self
+ *
+ *  Like Array#sort, but returns +self+ with its elements sorted in place.
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+VALUE
+rb_ary_sort_bang(VALUE ary)
 {
-    qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE),
-	  rb_block_given_p()?sort_1:sort_2);
+    rb_ary_modify(ary);
+    RUBY_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.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);
+            }
+            if (ARY_EMBED_LEN(tmp) > ARY_CAPA(ary)) {
+                ary_resize_capa(ary, ARY_EMBED_LEN(tmp));
+            }
+            ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
+            ARY_SET_LEN(ary, ARY_EMBED_LEN(tmp));
+        }
+        else {
+            if (!ARY_EMBED_P(ary) && ARY_HEAP_PTR(ary) == ARY_HEAP_PTR(tmp)) {
+                FL_UNSET_SHARED(ary);
+                ARY_SET_CAPA(ary, RARRAY_LEN(tmp));
+            }
+            else {
+                RUBY_ASSERT(!ARY_SHARED_P(tmp));
+                if (ARY_EMBED_P(ary)) {
+                    FL_UNSET_EMBED(ary);
+                }
+                else if (ARY_SHARED_P(ary)) {
+                    /* ary might be destructively operated in the given block */
+                    rb_ary_unshare(ary);
+                }
+                else {
+                    ary_heap_free(ary);
+                }
+                ARY_SET_PTR(ary, ARY_HEAP_PTR(tmp));
+                ARY_SET_HEAP_LEN(ary, len);
+                ARY_SET_CAPA(ary, ARY_HEAP_LEN(tmp));
+            }
+            /* tmp was lost ownership for the ptr */
+            FL_SET_EMBED(tmp);
+            ARY_SET_EMBED_LEN(tmp, 0);
+            OBJ_FREEZE(tmp);
+        }
+        /* tmp will be GC'ed. */
+        RBASIC_SET_CLASS_RAW(tmp, rb_cArray); /* rb_cArray must be marked */
+    }
+    ary_verify(ary);
     return ary;
 }
 
-static VALUE
-sort_unlock(ary)
-    VALUE ary;
+/*
+ *  call-seq:
+ *    sort -> new_array
+ *    sort {|a, b| ... } -> new_array
+ *
+ *  Returns a new array containing the elements of +self+, sorted.
+ *
+ *  With no block given, compares elements using operator <tt>#<=></tt>
+ *  (see Object#<=>):
+ *
+ *    [0, 2, 3, 1].sort # => [0, 1, 2, 3]
+ *
+ *  With a block given, calls the block with each combination of pairs of elements from +self+;
+ *  for each pair +a+ and +b+, the block should return a numeric:
+ *
+ *  - Negative when +b+ is to follow +a+.
+ *  - Zero when +a+ and +b+ are equivalent.
+ *  - Positive when +a+ is to follow +b+.
+ *
+ *  Example:
+ *
+ *    a = [3, 2, 0, 1]
+ *    a.sort {|a, b| a <=> b } # => [0, 1, 2, 3]
+ *    a.sort {|a, b| b <=> a } # => [3, 2, 1, 0]
+ *
+ *  When the block returns zero, the order for +a+ and +b+ is indeterminate,
+ *  and may be unstable.
+ *
+ *  See an example in Numeric#nonzero? for the idiom to sort more
+ *  complex structure.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+VALUE
+rb_ary_sort(VALUE ary)
 {
-    FL_UNSET(ary, ARY_TMPLOCK);
+    ary = rb_ary_dup(ary);
+    rb_ary_sort_bang(ary);
     return ary;
 }
 
-VALUE
-rb_ary_sort_bang(ary)
-    VALUE ary;
+static VALUE rb_ary_bsearch_index(VALUE ary);
+
+/*
+ *  call-seq:
+ *    bsearch {|element| ... } -> found_element or nil
+ *    bsearch -> new_enumerator
+ *
+ *  Returns the element from +self+ found by a binary search,
+ *  or +nil+ if the search found no suitable element.
+ *
+ *  See {Binary Searching}[rdoc-ref:language/bsearch.rdoc].
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_bsearch(VALUE ary)
 {
-    rb_ary_modify(ary);
-    if (RARRAY(ary)->len <= 1) return Qnil;
+    VALUE index_result = rb_ary_bsearch_index(ary);
 
-    FL_SET(ary, ARY_TMPLOCK);	/* prohibit modification during sort */
-    rb_ensure(sort_internal, ary, sort_unlock, ary);
-    return ary;
+    if (FIXNUM_P(index_result)) {
+        return rb_ary_entry(ary, FIX2LONG(index_result));
+    }
+    return index_result;
 }
 
-VALUE
-rb_ary_sort(ary)
-    VALUE ary;
+/*
+ *  call-seq:
+ *    bsearch_index {|element| ... } -> integer or nil
+ *    bsearch_index -> new_enumerator
+ *
+ *  Returns the integer index of the element from +self+ found by a binary search,
+ *  or +nil+ if the search found no suitable element.
+ *
+ *  See {Binary Searching}[rdoc-ref:language/bsearch.rdoc].
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_bsearch_index(VALUE ary)
 {
-    ary = rb_obj_dup(ary);
-    rb_ary_sort_bang(ary);
-    return 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 (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 INT2FIX(low);
 }
 
+
 static VALUE
-rb_ary_collect(ary)
-    VALUE ary;
+sort_by_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, dummy))
 {
-    long len, i;
-    VALUE collect;
+    return rb_yield(i);
+}
 
-    if (!rb_block_given_p()) {
-	return rb_obj_dup(ary);
+/*
+ *  call-seq:
+ *    sort_by! {|element| ... } -> self
+ *    sort_by! -> new_enumerator
+ *
+ *  With a block given, sorts the elements of +self+ in place;
+ *  returns self.
+ *
+ *  Calls the block with each successive element;
+ *  sorts elements based on the values returned from the block:
+ *
+ *    a = ['aaaa', 'bbb', 'cc', 'd']
+ *    a.sort_by! {|element| element.size }
+ *    a # => ["d", "cc", "bbb", "aaaa"]
+ *
+ *  For duplicate values returned by the block, the ordering is indeterminate, and may be unstable.
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+static VALUE
+rb_ary_sort_by_bang(VALUE ary)
+{
+    VALUE sorted;
+
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rb_ary_modify(ary);
+    if (RARRAY_LEN(ary) > 1) {
+        sorted = rb_block_call(ary, rb_intern("sort_by"), 0, 0, sort_by_i, 0);
+        rb_ary_replace(ary, sorted);
     }
+    return ary;
+}
 
-    len = RARRAY(ary)->len;
-    collect = rb_ary_new2(len);
-    for (i=0; i<len; i++) {
-	rb_ary_push(collect, rb_yield(RARRAY(ary)->ptr[i]));
+
+/*
+ *  call-seq:
+ *    collect {|element| ... } -> new_array
+ *    collect -> new_enumerator
+ *    map {|element| ... } -> new_array
+ *    map -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  returns a new array whose elements are the return values from the block:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a1 = a.map {|element| element.class }
+ *    a1 # => [Symbol, String, Integer]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: #collect!;
+ *  see also {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
+static VALUE
+rb_ary_collect(VALUE ary)
+{
+    long i;
+    VALUE collect;
+
+    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)));
     }
     return collect;
 }
 
+
+/*
+ *  call-seq:
+ *    collect! {|element| ... } -> self
+ *    collect! -> new_enumerator
+ *    map! {|element| ... } -> self
+ *    map! -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+
+ *  and replaces the element with the block's return value;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.map! { |element| element.class } # => [Symbol, String, Integer]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: #collect;
+ *  see also {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
 static VALUE
-rb_ary_collect_bang(ary)
-    VALUE ary;
+rb_ary_collect_bang(VALUE ary)
 {
     long i;
 
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
-    for (i = 0; i < RARRAY(ary)->len; i++) {
-	RARRAY(ary)->ptr[i] = rb_yield(RARRAY(ary)->ptr[i]);
+    for (i = 0; i < RARRAY_LEN(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, 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])));
+    }
+    return result;
+}
+
 static VALUE
-rb_ary_filter(ary)
-    VALUE ary;
+append_values_at_single(VALUE result, VALUE ary, long olen, VALUE idx)
 {
-    rb_warn("Array#filter is deprecated; use Array#collect!");
-    return rb_ary_collect_bang(ary);
+    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(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));
 }
 
-VALUE
-rb_ary_delete(ary, item)
+/*
+ *  call-seq:
+ *    values_at(*specifiers) -> new_array
+ *
+ *  Returns elements from +self+ in a new array; does not modify +self+.
+ *
+ *  The objects included in the returned array are the elements of +self+
+ *  selected by the given +specifiers+,
+ *  each of which must be a numeric index or a Range.
+ *
+ *  In brief:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *
+ *    # Index specifiers.
+ *    a.values_at(2, 0, 2, 0)     # => ["c", "a", "c", "a"] # May repeat.
+ *    a.values_at(-4, -3, -2, -1) # => ["a", "b", "c", "d"] # Counts backwards if negative.
+ *    a.values_at(-50, 50)        # => [nil, nil]           # Outside of self.
+ *
+ *    # Range specifiers.
+ *    a.values_at(1..3)       # => ["b", "c", "d"] # From range.begin to range.end.
+ *    a.values_at(1...3)      # => ["b", "c"]      # End excluded.
+ *    a.values_at(3..1)       # => []              # No such elements.
+ *
+ *    a.values_at(-3..3)  # => ["b", "c", "d"]     # Negative range.begin counts backwards.
+ *    a.values_at(-50..3)                          # Raises RangeError.
+ *
+ *    a.values_at(1..-2)  # => ["b", "c"]          # Negative range.end counts backwards.
+ *    a.values_at(1..-50) # => []                  # No such elements.
+ *
+ *    # Mixture of specifiers.
+ *    a.values_at(2..3, 3, 0..1, 0) # => ["c", "d", "d", "a", "b", "a"]
+ *
+ *  With no +specifiers+ given, returns a new empty array:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.values_at # => []
+ *
+ *  For each numeric specifier +index+, includes an element:
+ *
+ *  - For each non-negative numeric specifier +index+ that is in-range (less than <tt>self.size</tt>),
+ *    includes the element at offset +index+:
+ *
+ *      a.values_at(0, 2)     # => ["a", "c"]
+ *      a.values_at(0.1, 2.9) # => ["a", "c"]
+ *
+ *  - For each negative numeric +index+ that is in-range (greater than or equal to <tt>- self.size</tt>),
+ *    counts backwards from the end of +self+:
+ *
+ *      a.values_at(-1, -4) # => ["d", "a"]
+ *
+ *  The given indexes may be in any order, and may repeat:
+ *
+ *    a.values_at(2, 0, 1, 0, 2) # => ["c", "a", "b", "a", "c"]
+ *
+ *  For each +index+ that is out-of-range, includes +nil+:
+ *
+ *    a.values_at(4, -5) # => [nil, nil]
+ *
+ *  For each Range specifier +range+, includes elements
+ *  according to <tt>range.begin</tt> and <tt>range.end</tt>:
+ *
+ *  - If both <tt>range.begin</tt> and <tt>range.end</tt>
+ *    are non-negative and in-range (less than <tt>self.size</tt>),
+ *    includes elements from index <tt>range.begin</tt>
+ *    through <tt>range.end - 1</tt> (if <tt>range.exclude_end?</tt>),
+ *    or through <tt>range.end</tt> (otherwise):
+ *
+ *      a.values_at(1..2)  # => ["b", "c"]
+ *      a.values_at(1...2) # => ["b"]
+ *
+ *  - If <tt>range.begin</tt> is negative and in-range (greater than or equal to <tt>- self.size</tt>),
+ *    counts backwards from the end of +self+:
+ *
+ *      a.values_at(-2..3) # => ["c", "d"]
+ *
+ *  - If <tt>range.begin</tt> is negative and out-of-range, raises an exception:
+ *
+ *      a.values_at(-5..3) # Raises RangeError.
+ *
+ *  - If <tt>range.end</tt> is positive and out-of-range,
+ *    extends the returned array with +nil+ elements:
+ *
+ *      a.values_at(1..5) # => ["b", "c", "d", nil, nil]
+ *
+ *  - If <tt>range.end</tt> is negative and in-range,
+ *    counts backwards from the end of +self+:
+ *
+ *      a.values_at(1..-2) # => ["b", "c"]
+ *
+ *  - If <tt>range.end</tt> is negative and out-of-range,
+ *    returns an empty array:
+ *
+ *      a.values_at(1..-5) # => []
+ *
+ *  The given ranges may be in any order and may repeat:
+ *
+ *    a.values_at(2..3, 0..1, 2..3) # => ["c", "d", "a", "b", "c", "d"]
+ *
+ *  The given specifiers may be any mixture of indexes and ranges:
+ *
+ *    a.values_at(3, 1..2, 0, 2..3) # => ["d", "b", "c", "a", "c", "d"]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_values_at(int argc, VALUE *argv, VALUE ary)
+{
+    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:
+ *    select {|element| ... } -> new_array
+ *    select -> new_enumerator
+ *    filter {|element| ... } -> new_array
+ *    filter -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  returns a new array containing those elements of +self+
+ *  for which the block returns a truthy value:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select {|element| element.to_s.start_with?('b') }
+ *    # => ["bar", :bam]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_select(VALUE ary)
+{
+    VALUE result;
+    long i;
+
+    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));
+        }
+    }
+    return result;
+}
+
+struct select_bang_arg {
     VALUE ary;
-    VALUE item;
+    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(ary, ptr, {
+                    MEMMOVE(ptr + i2, ptr + i1, VALUE, tail);
+                });
+        }
+        ARY_SET_LEN(ary, i2 + tail);
+    }
+    return ary;
+}
+
+/*
+ *  call-seq:
+ *    select! {|element| ... } -> self or nil
+ *    select! -> new_enumerator
+ *    filter! {|element| ... } -> self or nil
+ *    filter! -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  removes from +self+ those elements for which the block returns +false+ or +nil+.
+ *
+ *  Returns +self+ if any elements were removed:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.select! {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
+ *
+ *  Returns +nil+ if no elements were removed.
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+static VALUE
+rb_ary_select_bang(VALUE ary)
+{
+    struct select_bang_arg args;
+
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
     rb_ary_modify(ary);
-    for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) {
-	if (rb_equal(RARRAY(ary)->ptr[i1], item)) continue;
-	if (i1 != i2) {
-	    RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1];
-	}
-	i2++;
-    }
-    if (RARRAY(ary)->len == i2) {
-	if (rb_block_given_p()) {
-	    return rb_yield(item);
-	}
-	return Qnil;
+
+    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:
+ *    keep_if {|element| ... } -> self
+ *    keep_if -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  removes the element from +self+ if the block does not return a truthy value:
+ *
+ *    a = [:foo, 'bar', 2, :bam]
+ *    a.keep_if {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+static VALUE
+rb_ary_keep_if(VALUE ary)
+{
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rb_ary_select_bang(ary);
+    return ary;
+}
+
+static void
+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);
+        }
     }
-    else {
-	RARRAY(ary)->len = i2;
+}
+
+/*
+ *  call-seq:
+ *    delete(object) -> last_removed_object
+ *    delete(object) {|element| ... } -> last_removed_object or block_return
+ *
+ *  Removes zero or more elements from +self+.
+ *
+ *  With no block given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == object</tt>;
+ *  returns the last removed element:
+ *
+ *    a = [0, 1, 2, 2.0]
+ *    a.delete(2) # => 2.0
+ *    a           # => [0, 1]
+ *
+ *  Returns +nil+ if no elements removed:
+ *
+ *    a.delete(2) # => nil
+ *
+ *  With a block given,
+ *  removes from +self+ each element +ele+ such that <tt>ele == object</tt>.
+ *
+ *  If any such elements are found, ignores the block
+ *  and returns the last removed element:
+ *
+ *    a = [0, 1, 2, 2.0]
+ *    a.delete(2) {|element| fail 'Cannot happen' } # => 2.0
+ *    a                                             # => [0, 1]
+ *
+ *  If no such element is found, returns the block's return value:
+ *
+ *    a.delete(2) {|element| "Element #{element} not found." }
+ *    # => "Element 2 not found."
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+VALUE
+rb_ary_delete(VALUE ary, VALUE item)
+{
+    VALUE v = item;
+    long i1, i2;
+
+    for (i1 = i2 = 0; i1 < RARRAY_LEN(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 (RARRAY_LEN(ary) == i2) {
+        if (rb_block_given_p()) {
+            return rb_yield(item);
+        }
+        return Qnil;
+    }
+
+    ary_resize_smaller(ary, i2);
 
-    return item;
+    ary_verify(ary);
+    return v;
+}
+
+void
+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);
+
+        if (e == item) {
+            continue;
+        }
+        if (i1 != i2) {
+            rb_ary_store(ary, i2, e);
+        }
+        i2++;
+    }
+    if (RARRAY_LEN(ary) == i2) {
+        return;
+    }
+
+    ary_resize_smaller(ary, i2);
 }
 
 VALUE
-rb_ary_delete_at(ary, pos)
-    VALUE ary;
-    long pos;
+rb_ary_delete_at(VALUE ary, long pos)
 {
-    long i, len = RARRAY(ary)->len;
-    VALUE del = Qnil;
+    long len = RARRAY_LEN(ary);
+    VALUE del;
 
-    rb_ary_modify(ary);
     if (pos >= len) return Qnil;
-    if (pos < 0) pos += len;
-    if (pos < 0) return Qnil;
-
-    del = RARRAY(ary)->ptr[pos];
-    for (i = pos + 1; i < len; i++, pos++) {
-	RARRAY(ary)->ptr[pos] = RARRAY(ary)->ptr[i];
+    if (pos < 0) {
+        pos += len;
+        if (pos < 0) return Qnil;
     }
-    RARRAY(ary)->len = pos;
 
+    rb_ary_modify(ary);
+    del = RARRAY_AREF(ary, pos);
+    RARRAY_PTR_USE(ary, ptr, {
+        MEMMOVE(ptr+pos, ptr+pos+1, VALUE, len-pos-1);
+    });
+    ARY_INCREASE_LEN(ary, -1);
+    ary_verify(ary);
     return del;
 }
 
-VALUE
-rb_ary_delete_at_m(ary, pos)
-    VALUE ary, pos;
+/*
+ *  call-seq:
+ *    delete_at(index) -> removed_object or nil
+ *
+ *  Removes the element of +self+ at the given +index+, which must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
+ *
+ *  When +index+ is non-negative, deletes the element at offset +index+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(1) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  When +index+ is negative, counts backward from the end of the array:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(-2) # => "bar"
+ *    a # => [:foo, 2]
+ *
+ *  When +index+ is out of range, returns +nil+.
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.delete_at(3)  # => nil
+ *    a.delete_at(-4) # => nil
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+static VALUE
+rb_ary_delete_at_m(VALUE ary, VALUE pos)
 {
     return rb_ary_delete_at(ary, NUM2LONG(pos));
 }
 
 static VALUE
-rb_ary_slice_bang(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+ary_slice_bang_by_rb_ary_splice(VALUE ary, long pos, long len)
 {
-    VALUE arg1, arg2;
-    long pos, len, i;
+    const long orig_len = RARRAY_LEN(ary);
 
-    rb_ary_modify(ary);
-    if (rb_scan_args(argc, argv, "11", &arg1, &arg2) == 2) {
-	pos = NUM2LONG(arg1);
-	len = NUM2LONG(arg2);
-      delete_pos_len:
-	if (pos < 0) {
-	    pos = RARRAY(ary)->len + pos;
-	}
-	arg2 = rb_ary_subseq(ary, pos, len);
-	rb_ary_replace(ary, pos, len, Qnil);	/* Qnil/rb_ary_new2(0) */
-	return arg2;
+    if (len < 0) {
+        return Qnil;
     }
-
-    if (!FIXNUM_P(arg1) && rb_range_beg_len(arg1, &pos, &len, RARRAY(ary)->len, 1)) {
-	goto delete_pos_len;
+    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(ary)+pos);
+        rb_ary_splice(ary, pos, len, 0, 0);
+        return arg2;
+    }
+}
 
-    pos = NUM2LONG(arg1);
-    len = RARRAY(ary)->len;
+/*
+ *  call-seq:
+ *    slice!(index) -> object or nil
+ *    slice!(start, length) -> new_array or nil
+ *    slice!(range) -> new_array or nil
+ *
+ *  Removes and returns elements from +self+.
+ *
+ *  With numeric argument +index+ given,
+ *  removes and returns the element at offset +index+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(2)   # => "c"
+ *    a             # => ["a", "b", "d"]
+ *    a.slice!(2.1) # => "d"
+ *    a             # => ["a", "b"]
+ *
+ *  If +index+ is negative, counts backwards from the end of +self+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(-2) # => "c"
+ *    a            # => ["a", "b", "d"]
+ *
+ *  If +index+ is out of range, returns +nil+.
+ *
+ *  With numeric arguments +start+ and +length+ given,
+ *  removes +length+ elements from +self+ beginning at zero-based offset +start+;
+ *  returns the removed objects in a new array:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(1, 2)     # => ["b", "c"]
+ *    a                  # => ["a", "d"]
+ *    a.slice!(0.1, 1.1) # => ["a"]
+ *    a                  # => ["d"]
+ *
+ *  If +start+ is negative, counts backwards from the end of +self+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(-2, 1) # => ["c"]
+ *    a               # => ["a", "b", "d"]
+ *
+ *  If +start+ is out-of-range, returns +nil+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(5, 1)  # => nil
+ *    a.slice!(-5, 1) # => nil
+ *
+ *  If <tt>start + length</tt> exceeds the array size,
+ *  removes and returns all elements from offset +start+ to the end:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(2, 50) # => ["c", "d"]
+ *    a               # => ["a", "b"]
+ *
+ *  If <tt>start == a.size</tt> and +length+ is non-negative,
+ *  returns a new empty array.
+ *
+ *  If +length+ is negative, returns +nil+.
+ *
+ *  With Range argument +range+ given,
+ *  treats <tt>range.min</tt> as +start+ (as above)
+ *  and <tt>range.size</tt> as +length+ (as above):
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(1..2) # => ["b", "c"]
+ *    a              # => ["a", "d"]
+ *
+ *  If <tt>range.start == a.size</tt>, returns a new empty array:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(4..5) # => []
+ *
+ *  If <tt>range.start</tt> is larger than the array size, returns +nil+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+      a.slice!(5..6) # => nil
+ *
+ *  If <tt>range.start</tt> is negative,
+ *  calculates the start index by counting backwards from the end of +self+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(-2..2) # => ["c"]
+ *
+ *  If <tt>range.end</tt> is negative,
+ *  calculates the end index by counting backwards from the end of +self+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.slice!(0..-2) # => ["a", "b", "c"]
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
 
-    if (pos >= len) return Qnil;
-    if (pos < 0) pos += len;
-    if (pos < 0) return Qnil;
+static VALUE
+rb_ary_slice_bang(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE arg1;
+    long pos, len;
+
+    rb_ary_modify_check(ary);
+    rb_check_arity(argc, 1, 2);
+    arg1 = argv[0];
 
-    arg2 = RARRAY(ary)->ptr[pos];
-    for (i = pos + 1; i < len; i++, pos++) {
-	RARRAY(ary)->ptr[pos] = RARRAY(ary)->ptr[i];
+    if (argc == 2) {
+        pos = NUM2LONG(argv[0]);
+        len = NUM2LONG(argv[1]);
+        return ary_slice_bang_by_rb_ary_splice(ary, pos, len);
     }
-    RARRAY(ary)->len = pos;
 
-    return arg2;
+    if (!FIXNUM_P(arg1)) {
+        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));
 }
 
 static VALUE
-rb_ary_reject_bang(ary)
-    VALUE ary;
+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(result, v);
+        }
+    }
+    return result;
+}
+
+static VALUE
+reject_bang_i(VALUE a)
 {
+    volatile struct select_bang_arg *arg = (void *)a;
+    VALUE ary = arg->ary;
     long i1, i2;
 
-    rb_ary_modify(ary);
-    for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) {
-	if (RTEST(rb_yield(RARRAY(ary)->ptr[i1]))) continue;
-	if (i1 != i2) {
-	    RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[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;
     }
-    if (RARRAY(ary)->len == i2) return Qnil;
-    RARRAY(ary)->len = i2;
+    return (i1 == i2) ? Qnil : ary;
+}
 
-    return 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:
+ *    reject! {|element| ... } -> self or nil
+ *    reject! -> new_enumerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  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]
+ *
+ *  Returns +nil+ if no elements removed.
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
 static VALUE
-rb_ary_delete_if(ary)
-    VALUE ary;
+rb_ary_reject_bang(VALUE ary)
 {
-    rb_ary_reject_bang(ary);
-    return ary;
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rb_ary_modify(ary);
+    return ary_reject_bang(ary);
 }
 
+/*
+ *  call-seq:
+ *    reject {|element| ... } -> new_array
+ *    reject -> new_enumerator
+ *
+ *  With a block given, returns a new array whose elements are all those from +self+
+ *  for which the block returns +false+ or +nil+:
+ *
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a1 = a.reject {|element| element.to_s.start_with?('b') }
+ *    a1 # => [:foo, 2]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 static VALUE
-rb_ary_replace_m(ary, ary2)
-    VALUE ary, ary2;
+rb_ary_reject(VALUE ary)
 {
-    ary2 = to_ary(ary2);
-    rb_ary_replace(ary, 0, RARRAY(ary)->len, ary2);
+    VALUE rejected_ary;
+
+    RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length);
+    rejected_ary = rb_ary_new();
+    ary_reject(ary, rejected_ary);
+    return rejected_ary;
+}
+
+/*
+ *  call-seq:
+ *    delete_if {|element| ... } -> self
+ *    delete_if -> new_numerator
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  removes the element if the block returns a truthy value;
+ *  returns +self+:
+ *
+ *    a = [:foo, 'bar', 2, 'bat']
+ *    a.delete_if {|element| element.to_s.start_with?('b') } # => [:foo, 2]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+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
-rb_ary_clear(ary)
-    VALUE ary;
+take_i(RB_BLOCK_CALL_FUNC_ARGLIST(val, cbarg))
 {
-    rb_ary_modify(ary);
-    RARRAY(ary)->len = 0;
-    if (ARY_DEFAULT_SIZE*3 < RARRAY(ary)->capa) {
-	RARRAY(ary)->capa = ARY_DEFAULT_SIZE * 2;
-	REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
+    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;
+}
+
+static VALUE
+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 (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:
+ *    zip(*other_arrays) -> new_array
+ *    zip(*other_arrays) {|sub_array| ... } -> nil
+ *
+ *  With no block given, combines +self+ with the collection of +other_arrays+;
+ *  returns a new array of sub-arrays:
+ *
+ *    [0, 1].zip(['zero', 'one'], [:zero, :one])
+ *    # => [[0, "zero", :zero], [1, "one", :one]]
+ *
+ *  Returned:
+ *
+ *  - The outer array is of size <tt>self.size</tt>.
+ *  - Each sub-array is of size <tt>other_arrays.size + 1</tt>.
+ *  - The _nth_ sub-array contains (in order):
+ *
+ *    - The _nth_ element of +self+.
+ *    - The _nth_ element of each of the other arrays, as available.
+ *
+ *  Example:
+ *
+ *    a = [0, 1]
+ *    zipped = a.zip(['zero', 'one'], [:zero, :one])
+ *    # => [[0, "zero", :zero], [1, "one", :one]]
+ *    zipped.size       # => 2 # Same size as a.
+ *    zipped.first.size # => 3 # Size of other arrays plus 1.
+ *
+ *  When the other arrays are all the same size as +self+,
+ *  the returned sub-arrays are a rearrangement containing exactly elements of all the arrays
+ *  (including +self+), with no omissions or additions:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    d = a.zip(b, c)
+ *    pp d
+ *    # =>
+ *    [[:a0, :b0, :c0],
+ *     [:a1, :b1, :c1],
+ *     [:a2, :b2, :c2],
+ *     [:a3, :b3, :c3]]
+ *
+ *  When one of the other arrays is smaller than +self+,
+ *  pads the corresponding sub-array with +nil+ elements:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2]
+ *    c = [:c0, :c1]
+ *    d = a.zip(b, c)
+ *    pp d
+ *    # =>
+ *    [[:a0, :b0, :c0],
+ *     [:a1, :b1, :c1],
+ *     [:a2, :b2, nil],
+ *     [:a3, nil, nil]]
+ *
+ *  When one of the other arrays is larger than +self+,
+ *  _ignores_ its trailing elements:
+ *
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3, :b4]
+ *    c = [:c0, :c1, :c2, :c3, :c4, :c5]
+ *    d = a.zip(b, c)
+ *    pp d
+ *    # =>
+ *    [[:a0, :b0, :c0],
+ *     [:a1, :b1, :c1],
+ *     [:a2, :b2, :c2],
+ *     [:a3, :b3, :c3]]
+ *
+ *  With a block given, calls the block with each of the other arrays;
+ *  returns +nil+:
+ *
+ *    d = []
+ *    a = [:a0, :a1, :a2, :a3]
+ *    b = [:b0, :b1, :b2, :b3]
+ *    c = [:c0, :c1, :c2, :c3]
+ *    a.zip(b, c) {|sub_array| d.push(sub_array.reverse) } # => nil
+ *    pp d
+ *    # =>
+ *    [[:c0, :b0, :a0],
+ *     [:c1, :b1, :a1],
+ *     [:c2, :b2, :a2],
+ *     [:c3, :b3, :a3]]
+ *
+ *  For an *object* in *other_arrays* that is not actually an array,
+ *  forms the "other array" as <tt>object.to_ary</tt>, if defined,
+ *  or as <tt>object.each.to_a</tt> otherwise.
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
+static VALUE
+rb_ary_zip(int argc, VALUE *argv, VALUE ary)
+{
+    int i, j;
+    long len = RARRAY_LEN(ary);
+    VALUE result = Qnil;
+
+    for (i=0; i<argc; i++) {
+        argv[i] = take_items(argv[i], 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 (work) ALLOCV_END(work);
+        }
+        else {
+            for (i=0; i<RARRAY_LEN(ary); i++) {
+                VALUE tmp = rb_ary_new2(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));
+                }
+                rb_yield(tmp);
+            }
+        }
+    }
+    else {
+        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));
+            }
+            rb_ary_push(result, tmp);
+        }
+    }
+
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    transpose -> new_array
+ *
+ *  Returns a new array that is +self+
+ *  as a {transposed matrix}[https://en.wikipedia.org/wiki/Transpose]:
+ *
+ *    a = [[:a0, :a1], [:b0, :b1], [:c0, :c1]]
+ *    a.transpose # => [[:a0, :b0, :c0], [:a1, :b1, :c1]]
+ *
+ *  The elements of +self+ must all be the same size.
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
+static VALUE
+rb_ary_transpose(VALUE ary)
+{
+    long elen = -1, alen, i, j;
+    VALUE tmp, result = 0;
+
+    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));
+        }
+    }
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    initialize_copy(other_array) -> self
+ *    replace(other_array) -> self
+ *
+ *  Replaces the elements of +self+ with the elements of +other_array+, which must be an
+ *  {array-convertible object}[rdoc-ref:implicit_conversion.rdoc@Array-Convertible+Objects];
+ *  returns +self+:
+ *
+ *    a = ['a', 'b', 'c']   # => ["a", "b", "c"]
+ *    a.replace(['d', 'e']) # => ["d", "e"]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+VALUE
+rb_ary_replace(VALUE copy, VALUE orig)
+{
+    rb_ary_modify_check(copy);
+    orig = to_ary(orig);
+    if (copy == orig) return copy;
+
+    rb_ary_reset(copy);
+
+    /* orig has enough space to embed the contents of orig. */
+    if (RARRAY_LEN(orig) <= ary_embed_capa(copy)) {
+        RUBY_ASSERT(ARY_EMBED_P(copy));
+        ary_memcpy(copy, 0, RARRAY_LEN(orig), RARRAY_CONST_PTR(orig));
+        ARY_SET_EMBED_LEN(copy, RARRAY_LEN(orig));
+    }
+    /* 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_buffer(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(orig));
+    }
+    /* Otherwise, orig is on heap and copy does not have enough space to embed
+     * the contents of orig. */
+    else {
+        VALUE shared_root = ary_make_shared(orig);
+        FL_UNSET_EMBED(copy);
+        ARY_SET_PTR(copy, ARY_HEAP_PTR(orig));
+        ARY_SET_LEN(copy, ARY_HEAP_LEN(orig));
+        rb_ary_set_shared(copy, shared_root);
+
+        RUBY_ASSERT(RB_OBJ_SHAREABLE_P(copy) ? RB_OBJ_SHAREABLE_P(shared_root) : 1);
+    }
+    ary_verify(copy);
+    return copy;
+}
+
+/*
+ *  call-seq:
+ *    clear -> self
+ *
+ *  Removes all elements from +self+; returns +self+:
+ *
+ *    a = [:foo, 'bar', 2]
+ *    a.clear # => []
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+VALUE
+rb_ary_clear(VALUE ary)
+{
+    rb_ary_modify_check(ary);
+    if (ARY_SHARED_P(ary)) {
+        rb_ary_unshare(ary);
+        FL_SET_EMBED(ary);
+        ARY_SET_EMBED_LEN(ary, 0);
+    }
+    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:
+ *    fill(object, start = nil, count = nil) -> self
+ *    fill(object, range) -> self
+ *    fill(start = nil, count = nil) {|element| ... } -> self
+ *    fill(range) {|element| ... } -> self
+ *
+ *  Replaces selected elements in +self+;
+ *  may add elements to +self+;
+ *  always returns +self+ (never a new array).
+ *
+ *  In brief:
+ *
+ *    # Non-negative start.
+ *    ['a', 'b', 'c', 'd'].fill('-', 1, 2)          # => ["a", "-", "-", "d"]
+ *    ['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
+ *
+ *    # Extends with specified values if necessary.
+ *    ['a', 'b', 'c', 'd'].fill('-', 3, 2)          # => ["a", "b", "c", "-", "-"]
+ *    ['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
+ *
+ *    # Fills with nils if necessary.
+ *    ['a', 'b', 'c', 'd'].fill('-', 6, 2)          # => ["a", "b", "c", "d", nil, nil, "-", "-"]
+ *    ['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
+ *
+ *    # For negative start, counts backwards from the end.
+ *    ['a', 'b', 'c', 'd'].fill('-', -3, 3)          # => ["a", "-", "-", "-"]
+ *    ['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
+ *
+ *    # Range.
+ *    ['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
+ *    ['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
+ *
+ *  When arguments +start+ and +count+ are given,
+ *  they select the elements of +self+ to be replaced;
+ *  each must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects]
+ *  (or +nil+):
+ *
+ *  - +start+ specifies the zero-based offset of the first element to be replaced;
+ *    +nil+ means zero.
+ *  - +count+ is the number of consecutive elements to be replaced;
+ *    +nil+ means "all the rest."
+ *
+ *  With argument +object+ given,
+ *  that one object is used for all replacements:
+ *
+ *    o = Object.new           # => #<Object:0x0000014e7bff7600>
+ *    a = ['a', 'b', 'c', 'd'] # => ["a", "b", "c", "d"]
+ *    a.fill(o, 1, 2)
+ *    # => ["a", #<Object:0x0000014e7bff7600>, #<Object:0x0000014e7bff7600>, "d"]
+ *
+ *  With a block given, the block is called once for each element to be replaced;
+ *  the value passed to the block is the _index_ of the element to be replaced
+ *  (not the element itself);
+ *  the block's return value replaces the element:
+ *
+ *    a = ['a', 'b', 'c', 'd']               # => ["a", "b", "c", "d"]
+ *    a.fill(1, 2) {|element| element.to_s } # => ["a", "1", "2", "d"]
+ *
+ *  For arguments +start+ and +count+:
+ *
+ *  - If +start+ is non-negative,
+ *    replaces +count+ elements beginning at offset +start+:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 0, 2) # => ["-", "-", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 1, 2) # => ["a", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 2, 2) # => ["a", "b", "-", "-"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(0, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(2, 2) {|e| e.to_s } # => ["a", "b", "2", "3"]
+ *
+ *    Extends +self+ if necessary:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 3, 2) # => ["a", "b", "c", "-", "-"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 4, 2) # => ["a", "b", "c", "d", "-", "-"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
+ *      ['a', 'b', 'c', 'd'].fill(4, 2) {|e| e.to_s } # => ["a", "b", "c", "d", "4", "5"]
+ *
+ *    Fills with +nil+ if necessary:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 5, 2) # => ["a", "b", "c", "d", nil, "-", "-"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 6, 2) # => ["a", "b", "c", "d", nil, nil, "-", "-"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(5, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, "5", "6"]
+ *      ['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
+ *
+ *    Does nothing if +count+ is non-positive:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 2, 0)    # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 2, -100) # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 6, -100) # => ["a", "b", "c", "d"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(2, 0) {|e| fail 'Cannot happen' }    # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(2, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(6, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  - If +start+ is negative, counts backwards from the end of +self+:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', -4, 3) # => ["-", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', -3, 3) # => ["a", "-", "-", "-"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(-4, 3) {|e| e.to_s } # => ["0", "1", "2", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
+ *
+ *    Extends +self+ if necessary:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', -2, 3) # => ["a", "b", "-", "-", "-"]
+ *      ['a', 'b', 'c', 'd'].fill('-', -1, 3) # => ["a", "b", "c", "-", "-", "-"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(-2, 3) {|e| e.to_s } # => ["a", "b", "2", "3", "4"]
+ *      ['a', 'b', 'c', 'd'].fill(-1, 3) {|e| e.to_s } # => ["a", "b", "c", "3", "4", "5"]
+ *
+ *    Starts at the beginning of +self+ if +start+ is negative and out-of-range:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', -5, 2) # => ["-", "-", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', -6, 2) # => ["-", "-", "c", "d"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(-5, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(-6, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
+ *
+ *    Does nothing if +count+ is non-positive:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', -2, 0)  # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', -2, -1) # => ["a", "b", "c", "d"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(-2, 0) {|e| fail 'Cannot happen' }  # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(-2, -1) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
+ *
+ *  When argument +range+ is given,
+ *  it must be a Range object whose members are numeric;
+ *  its +begin+ and +end+ values determine the elements of +self+
+ *  to be replaced:
+ *
+ *  - If both +begin+ and +end+ are positive, they specify the first and last elements
+ *    to be replaced:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
+ *
+ *    If +end+ is smaller than +begin+, replaces no elements:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 2..1)          # => ["a", "b", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(2..1) {|e| e.to_s } # => ["a", "b", "c", "d"]
+ *
+ *  - If either is negative (or both are negative), counts backwards from the end of +self+:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', -3..2)  # => ["a", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 1..-2)  # => ["a", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', -3..-2) # => ["a", "-", "-", "d"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(-3..2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(1..-2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(-3..-2) {|e| e.to_s } # => ["a", "1", "2", "d"]
+ *
+ *  - If the +end+ value is excluded (see Range#exclude_end?), omits the last replacement:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 1...2)  # => ["a", "-", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill('-', 1...-2) # => ["a", "-", "c", "d"]
+ *
+ *      ['a', 'b', 'c', 'd'].fill(1...2) {|e| e.to_s }  # => ["a", "1", "c", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(1...-2) {|e| e.to_s } # => ["a", "1", "c", "d"]
+ *
+ *  - If the range is endless (see {Endless Ranges}[rdoc-ref:Range@Endless+Ranges]),
+ *    replaces elements to the end of +self+:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', 1..)          # => ["a", "-", "-", "-"]
+ *      ['a', 'b', 'c', 'd'].fill(1..) {|e| e.to_s } # => ["a", "1", "2", "3"]
+ *
+ *  - If the range is beginless (see {Beginless Ranges}[rdoc-ref:Range@Beginless+Ranges]),
+ *    replaces elements from the beginning of +self+:
+ *
+ *      ['a', 'b', 'c', 'd'].fill('-', ..2)          # => ["-", "-", "-", "d"]
+ *      ['a', 'b', 'c', 'd'].fill(..2) {|e| e.to_s } # => ["0", "1", "2", "d"]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
 static VALUE
-rb_ary_fill(argc, argv, ary)
-    int argc;
-    VALUE *argv;
-    VALUE ary;
+rb_ary_fill(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE item, arg1, arg2;
-    long beg, end, len;
-    VALUE *p, *pend;
+    VALUE item = Qundef, arg1, arg2;
+    long beg = 0, end = 0, len = 0;
 
-    rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
+    if (rb_block_given_p()) {
+        rb_scan_args(argc, argv, "02", &arg1, &arg2);
+        argc += 1;		/* hackish */
+    }
+    else {
+        rb_scan_args(argc, argv, "12", &item, &arg1, &arg2);
+    }
     switch (argc) {
       case 1:
-	beg = 0;
-	len = RARRAY(ary)->len - beg;
-	break;
+        beg = 0;
+        len = RARRAY_LEN(ary);
+        break;
       case 2:
-	if (rb_range_beg_len(arg1, &beg, &len, RARRAY(ary)->len, 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(ary)->len + beg;
-	    if (beg < 0) beg = 0;
-	}
-	len = NIL_P(arg2)?RARRAY(ary)->len - 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");
+    }
     end = beg + len;
-    if (end > RARRAY(ary)->len) {
-	if (end >= RARRAY(ary)->capa) {
-	    RARRAY(ary)->capa=end;
-	    REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->capa);
-	}
-	if (beg > RARRAY(ary)->len) {
-	    rb_mem_clear(RARRAY(ary)->ptr+RARRAY(ary)->len,end-RARRAY(ary)->len);
-	}
-	RARRAY(ary)->len = end;
+    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);
     }
-    p = RARRAY(ary)->ptr + beg; pend = p + len;
 
-    while (p < pend) {
-	*p++ = item;
+    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;
+            ARY_SET(ary, i, v);
+        }
+    }
+    else {
+        ary_memfill(ary, beg, len, item);
     }
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    self + other_array -> new_array
+ *
+ *  Returns a new array containing all elements of +self+
+ *  followed by all elements of +other_array+:
+ *
+ *    a = [0, 1] + [2, 3]
+ *    a # => [0, 1, 2, 3]
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
 VALUE
-rb_ary_plus(x, y)
-    VALUE x, y;
+rb_ary_plus(VALUE x, VALUE y)
 {
     VALUE z;
+    long len, xlen, ylen;
 
-    Check_Type(y, T_ARRAY);
+    y = to_ary(y);
+    xlen = RARRAY_LEN(x);
+    ylen = RARRAY_LEN(y);
+    len = xlen + ylen;
+    z = rb_ary_new2(len);
 
-    z = rb_ary_new2(RARRAY(x)->len + RARRAY(y)->len);
-    MEMCPY(RARRAY(z)->ptr, RARRAY(x)->ptr, VALUE, RARRAY(x)->len);
-    MEMCPY(RARRAY(z)->ptr+RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len);
-    RARRAY(z)->len = RARRAY(x)->len + RARRAY(y)->len;
+    ary_memcpy(z, 0, xlen, RARRAY_CONST_PTR(x));
+    ary_memcpy(z, xlen, ylen, RARRAY_CONST_PTR(y));
+    ARY_SET_LEN(z, len);
     return z;
 }
 
-VALUE
-rb_ary_concat(x, y)
-    VALUE x, y;
+static VALUE
+ary_append(VALUE x, VALUE y)
 {
-    Check_Type(y, T_ARRAY);
-
-    rb_ary_push_m(RARRAY(y)->len, RARRAY(y)->ptr, x);
+    long n = RARRAY_LEN(y);
+    if (n > 0) {
+        rb_ary_splice(x, RARRAY_LEN(x), 0, RARRAY_CONST_PTR(y), n);
+    }
+    RB_GC_GUARD(y);
     return x;
 }
 
+/*
+ *  call-seq:
+ *    concat(*other_arrays) -> self
+ *
+ *  Adds to +self+ all elements from each array in +other_arrays+; returns +self+:
+ *
+ *    a = [0, 1]
+ *    a.concat(['two', 'three'], [:four, :five], a)
+ *    # => [0, 1, "two", "three", :four, :five, 0, 1]
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
 static VALUE
-rb_ary_times(ary, times)
-    VALUE ary;
-    VALUE times;
+rb_ary_concat_multi(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE ary2;
-    long i, len;
+    rb_ary_modify_check(ary);
 
-    if (TYPE(times) == T_STRING) {
-	return rb_ary_join(ary, times);
+    if (argc == 1) {
+        rb_ary_concat(ary, argv[0]);
     }
-
-    len = NUM2LONG(times);
-    if (len < 0) {
-	rb_raise(rb_eArgError, "negative argument");
+    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);
     }
-    len *= RARRAY(ary)->len;
 
-    ary2 = rb_ary_new2(len);
-    RARRAY(ary2)->len = len;
+    ary_verify(ary);
+    return ary;
+}
+
+VALUE
+rb_ary_concat(VALUE x, VALUE y)
+{
+    return ary_append(x, to_ary(y));
+}
+
+/*
+ *  call-seq:
+ *    self * n -> new_array
+ *    self * string_separator -> new_string
+ *
+ *  When non-negative integer argument +n+ is given,
+ *  returns a new array built by concatenating +n+ copies of +self+:
+ *
+ *    a = ['x', 'y']
+ *    a * 3 # => ["x", "y", "x", "y", "x", "y"]
+ *
+ *  When string argument +string_separator+ is given,
+ *  equivalent to <tt>self.join(string_separator)</tt>:
+ *
+ *    [0, [0, 1], {foo: 0}] * ', ' # => "0, 0, 1, {foo: 0}"
+ *
+ */
 
-    for (i=0; i<len; i+=RARRAY(ary)->len) {
-	MEMCPY(RARRAY(ary2)->ptr+i, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
+static VALUE
+rb_ary_times(VALUE ary, VALUE times)
+{
+    VALUE ary2, tmp;
+    const VALUE *ptr;
+    long t, len;
+
+    tmp = rb_check_string_type(times);
+    if (!NIL_P(tmp)) {
+        return rb_ary_join(ary, tmp);
     }
 
+    len = NUM2LONG(times);
+    if (len == 0) {
+        ary2 = ary_new(rb_cArray, 0);
+        goto out;
+    }
+    if (len < 0) {
+        rb_raise(rb_eArgError, "negative argument");
+    }
+    if (ARY_MAX_SIZE/len < RARRAY_LEN(ary)) {
+        rb_raise(rb_eArgError, "argument too big");
+    }
+    len *= RARRAY_LEN(ary);
+
+    ary2 = ary_new(rb_cArray, len);
+    ARY_SET_LEN(ary2, len);
+
+    ptr = RARRAY_CONST_PTR(ary);
+    t = RARRAY_LEN(ary);
+    if (0 < t) {
+        ary_memcpy(ary2, 0, t, ptr);
+        while (t <= len/2) {
+            ary_memcpy(ary2, t, t, RARRAY_CONST_PTR(ary2));
+            t *= 2;
+        }
+        if (t < len) {
+            ary_memcpy(ary2, t, len-t, RARRAY_CONST_PTR(ary2));
+        }
+    }
+  out:
     return ary2;
 }
 
+/*
+ *  call-seq:
+ *    assoc(object) -> found_array or nil
+ *
+ *  Returns the first element +ele+ in +self+ such that +ele+ is an array
+ *  and <tt>ele[0] == object</tt>:
+ *
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.assoc(4) # => [4, 5, 6]
+ *
+ *  Returns +nil+ if no such element is found.
+ *
+ *  Related: Array#rassoc;
+ *  see also {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 VALUE
-rb_ary_assoc(ary, key)
-    VALUE ary;
-    VALUE key;
+rb_ary_assoc(VALUE ary, VALUE key)
 {
-    VALUE *p, *pend;
+    long i;
+    VALUE v;
 
-    p = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
-    while (p < pend) {
-	if (TYPE(*p) == T_ARRAY
-	    && RARRAY(*p)->len > 0
-	    && rb_equal(RARRAY(*p)->ptr[0], key))
-	    return *p;
-	p++;
+    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;
     }
     return Qnil;
 }
 
+/*
+ *  call-seq:
+ *    rassoc(object) -> found_array or nil
+ *
+ *  Returns the first element +ele+ in +self+ such that +ele+ is an array
+ *  and <tt>ele[1] == object</tt>:
+ *
+ *    a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
+ *    a.rassoc(4) # => [2, 4]
+ *    a.rassoc(5) # => [4, 5, 6]
+ *
+ *  Returns +nil+ if no such element is found.
+ *
+ *  Related: Array#assoc;
+ *  see also {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 VALUE
-rb_ary_rassoc(ary, value)
-    VALUE ary;
-    VALUE value;
+rb_ary_rassoc(VALUE ary, VALUE value)
 {
-    VALUE *p, *pend;
+    long i;
+    VALUE v;
 
-    p = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
-    while (p < pend) {
-	if (TYPE(*p) == T_ARRAY
-	    && RARRAY(*p)->len > 1
-	    && rb_equal(RARRAY(*p)->ptr[1], value))
-	    return *p;
-	p++;
+    for (i = 0; i < RARRAY_LEN(ary); ++i) {
+        v = rb_check_array_type(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;
 }
 
 static VALUE
-rb_ary_equal(ary1, ary2)
-    VALUE ary1, ary2;
+recursive_equal(VALUE ary1, VALUE ary2, int recur)
 {
-    long i;
-
-    if (TYPE(ary2) != T_ARRAY) return Qfalse;
-    if (RARRAY(ary1)->len != RARRAY(ary2)->len) return Qfalse;
-    for (i=0; i<RARRAY(ary1)->len; i++) {
-	if (!rb_equal(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
-	    return Qfalse;
+    long i, len1;
+    const VALUE *p1, *p2;
+
+    if (recur) return Qtrue; /* Subtle! */
+
+    /* 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_CONST_PTR(ary1) + i;
+                p2 = RARRAY_CONST_PTR(ary2) + i;
+            }
+            else {
+                return Qfalse;
+            }
+        }
+        p1++;
+        p2++;
     }
     return Qtrue;
 }
 
+/*
+ *  call-seq:
+ *    self == other_array -> true or false
+ *
+ *  Returns whether both:
+ *
+ *  - +self+ and +other_array+ are the same size.
+ *  - Their corresponding elements are the same;
+ *    that is, for each index +i+ in <tt>(0...self.size)</tt>,
+ *    <tt>self[i] == other_array[i]</tt>.
+ *
+ *  Examples:
+ *
+ *    [:foo, 'bar', 2] == [:foo, 'bar', 2]   # => true
+ *    [:foo, 'bar', 2] == [:foo, 'bar', 2.0] # => true
+ *    [:foo, 'bar', 2] == [:foo, 'bar']      # => false # Different sizes.
+ *    [:foo, 'bar', 2] == [:foo, 'bar', 3]   # => false # Different elements.
+ *
+ *  This method is different from method Array#eql?,
+ *  which compares elements using <tt>Object#eql?</tt>.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Array@Methods+for+Comparing].
+ */
+
 static VALUE
-rb_ary_eql(ary1, ary2)
-    VALUE ary1, ary2;
+rb_ary_equal(VALUE ary1, VALUE ary2)
+{
+    if (ary1 == ary2) return Qtrue;
+    if (!RB_TYPE_P(ary2, T_ARRAY)) {
+        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_CONST_PTR(ary1) == RARRAY_CONST_PTR(ary2)) return Qtrue;
+    return rb_exec_recursive_paired(recursive_equal, ary1, ary2, ary2);
+}
+
+static VALUE
+recursive_eql(VALUE ary1, VALUE ary2, int recur)
 {
     long i;
 
-    if (TYPE(ary2) != T_ARRAY) return Qfalse;
-    if (RARRAY(ary1)->len != RARRAY(ary2)->len)
-	return Qfalse;
-    for (i=0; i<RARRAY(ary1)->len; i++) {
-	if (!rb_eql(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
-	    return Qfalse;
+    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;
     }
     return Qtrue;
 }
 
+/*
+ *  call-seq:
+ *    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
+ *
+ *  Otherwise, returns +false+.
+ *
+ *  This method is different from method Array#==,
+ *  which compares using method <tt>Object#==</tt>.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_hash(ary)
-    VALUE ary;
+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_CONST_PTR(ary1) == RARRAY_CONST_PTR(ary2)) return Qtrue;
+    return rb_exec_recursive_paired(recursive_eql, ary1, ary2, ary2);
+}
+
+static VALUE
+ary_hash_values(long len, const VALUE *elements, const VALUE ary)
 {
     long i;
-    int n, h;
+    st_index_t h;
+    VALUE n;
 
-    h = RARRAY(ary)->len;
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	h = (h<<1) | (h<0 ? 1 : 0);
-	n = rb_hash(RARRAY(ary)->ptr[i]);
-	h ^= NUM2LONG(n);
+    h = rb_hash_start(len);
+    h = rb_hash_uint(h, (st_index_t)rb_ary_hash_values);
+    for (i=0; i<len; i++) {
+        n = rb_hash(elements[i]);
+        h = rb_hash_uint(h, NUM2LONG(n));
+        if (ary) {
+            len = RARRAY_LEN(ary);
+            elements = RARRAY_CONST_PTR(ary);
+        }
     }
-    return INT2FIX(h);
+    h = rb_hash_end(h);
+    return ST2FIX(h);
 }
 
 VALUE
-rb_ary_includes(ary, item)
-    VALUE ary;
-    VALUE item;
+rb_ary_hash_values(long len, const VALUE *elements)
+{
+    return ary_hash_values(len, elements, 0);
+}
+
+/*
+ *  call-seq:
+ *    hash -> integer
+ *
+ *  Returns the integer hash value for +self+.
+ *
+ *  Two arrays with the same content will have the same hash value
+ *  (and will compare using eql?):
+ *
+ *    ['a', 'b'].hash == ['a', 'b'].hash # => true
+ *    ['a', 'b'].hash == ['a', 'c'].hash # => false
+ *    ['a', 'b'].hash == ['a'].hash      # => false
+ *
+ */
+
+static VALUE
+rb_ary_hash(VALUE ary)
+{
+    RBIMPL_ASSERT_OR_ASSUME(ary);
+    return ary_hash_values(RARRAY_LEN(ary), RARRAY_CONST_PTR(ary), ary);
+}
+
+/*
+ *  call-seq:
+ *    include?(object) -> true or false
+ *
+ *  Returns whether for some element +element+ in +self+,
+ *  <tt>object == element</tt>:
+ *
+ *    [0, 1, 2].include?(2)   # => true
+ *    [0, 1, 2].include?(2.0) # => true
+ *    [0, 1, 2].include?(2.1) # => false
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+VALUE
+rb_ary_includes(VALUE ary, VALUE item)
 {
     long i;
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	if (rb_equal(RARRAY(ary)->ptr[i], item)) {
-	    return Qtrue;
-	}
+    VALUE e;
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        e = RARRAY_AREF(ary, i);
+        if (rb_equal(e, item)) {
+            return Qtrue;
+        }
     }
     return Qfalse;
 }
 
 static VALUE
-rb_ary_cmp(ary, ary2)
-    VALUE ary;
-    VALUE ary2;
+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)
 {
     long i, len;
 
-    ary2 = to_ary(ary2);
-    len = RARRAY(ary)->len;
-    if (len > RARRAY(ary2)->len) {
-	len = RARRAY(ary2)->len;
+    if (recur) return Qundef;	/* Subtle! */
+    len = RARRAY_LEN(ary1);
+    if (len > RARRAY_LEN(ary2)) {
+        len = RARRAY_LEN(ary2);
     }
     for (i=0; i<len; i++) {
-	VALUE v = rb_funcall(RARRAY(ary)->ptr[i],cmp,1,RARRAY(ary2)->ptr[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;
+        }
     }
-    len = RARRAY(ary)->len - RARRAY(ary2)->len;
+    return Qundef;
+}
+
+/*
+ *  call-seq:
+ *    self <=> other_array -> -1, 0, or 1
+ *
+ *  Returns -1, 0, or 1 as +self+ is determined
+ *  to be less than, equal to, or greater than +other_array+.
+ *
+ *  Iterates over each index +i+ in <tt>(0...self.size)</tt>:
+ *
+ *  - Computes <tt>result[i]</tt> as <tt>self[i] <=> other_array[i]</tt>.
+ *  - Immediately returns 1 if <tt>result[i]</tt> is 1:
+ *
+ *      [0, 1, 2] <=> [0, 0, 2] # => 1
+ *
+ *  - Immediately returns -1 if <tt>result[i]</tt> is -1:
+ *
+ *      [0, 1, 2] <=> [0, 2, 2] # => -1
+ *
+ *  - Continues if <tt>result[i]</tt> is 0.
+ *
+ *  When every +result+ is 0,
+ *  returns <tt>self.size <=> other_array.size</tt>
+ *  (see Integer#<=>):
+ *
+ *    [0, 1, 2] <=> [0, 1]        # => 1
+ *    [0, 1, 2] <=> [0, 1, 2]     # => 0
+ *    [0, 1, 2] <=> [0, 1, 2, 3]  # => -1
+ *
+ *  Note that when +other_array+ is larger than +self+,
+ *  its trailing elements do not affect the result:
+ *
+ *    [0, 1, 2] <=> [0, 1, 2, -3] # => -1
+ *    [0, 1, 2] <=> [0, 1, 2, 0]  # => -1
+ *    [0, 1, 2] <=> [0, 1, 2, 3]  # => -1
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Array@Methods+for+Comparing].
+ */
+
+VALUE
+rb_ary_cmp(VALUE ary1, VALUE ary2)
+{
+    long len;
+    VALUE v;
+
+    ary2 = rb_check_array_type(ary2);
+    if (NIL_P(ary2)) return Qnil;
+    if (ary1 == ary2) return INT2FIX(0);
+    v = rb_exec_recursive_paired(recursive_cmp, ary1, ary2, ary2);
+    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);
     return INT2FIX(-1);
 }
 
 static VALUE
-rb_ary_diff(ary1, ary2)
-    VALUE ary1, ary2;
+ary_add_hash(VALUE hash, VALUE ary)
+{
+    long i;
+
+    for (i=0; i<RARRAY_LEN(ary); i++) {
+        VALUE elt = RARRAY_AREF(ary, i);
+        rb_hash_add_new_element(hash, elt, elt);
+    }
+    return hash;
+}
+
+static inline VALUE
+ary_tmp_hash_new(VALUE ary)
+{
+    long size = RARRAY_LEN(ary);
+    VALUE hash = rb_hash_new_with_size(size);
+
+    RBASIC_CLEAR_CLASS(hash);
+    return hash;
+}
+
+static VALUE
+ary_make_hash(VALUE ary)
+{
+    VALUE hash = ary_tmp_hash_new(ary);
+    return ary_add_hash(hash, ary);
+}
+
+static VALUE
+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);
+        rb_hash_add_new_element(hash, k, v);
+    }
+    return hash;
+}
+
+static VALUE
+ary_make_hash_by(VALUE ary)
+{
+    VALUE hash = ary_tmp_hash_new(ary);
+    return ary_add_hash_by(hash, ary);
+}
+
+/*
+ *  call-seq:
+ *    self - other_array -> new_array
+ *
+ *  Returns a new array containing only those elements of +self+
+ *  that are not found in +other_array+;
+ *  the order from +self+ is preserved:
+ *
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1] - [1]             # => [0, 2, 3]
+ *    [0, 1, 1, 2, 1, 1, 3, 1, 1] - [3, 2, 0, :foo] # => [1, 1, 1, 1, 1, 1]
+ *    [0, 1, 2] - [:foo]                            # => [0, 1, 2]
+ *
+ *  Element are compared using method <tt>#eql?</tt>
+ *  (as defined in each element of +self+).
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+VALUE
+rb_ary_diff(VALUE ary1, VALUE ary2)
 {
     VALUE ary3;
+    VALUE hash;
     long i;
 
     ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary2) == 0) { return ary_make_shared_copy(ary1); }
     ary3 = rb_ary_new();
-    for (i=0; i<RARRAY(ary1)->len; i++) {
-	if (rb_ary_includes(ary2, RARRAY(ary1)->ptr[i])) continue;
-	if (rb_ary_includes(ary3, RARRAY(ary1)->ptr[i])) continue;
-	rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
+
+    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 (rb_hash_stlike_lookup(hash, RARRAY_AREF(ary1, i), NULL)) continue;
+        rb_ary_push(ary3, rb_ary_elt(ary1, i));
+    }
+
     return ary3;
 }
 
+/*
+ *  call-seq:
+ *    difference(*other_arrays = []) -> new_array
+ *
+ *  Returns a new array containing only those elements from +self+
+ *  that are not found in any of the given +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]
+ *    [0, 1, 2].difference                        # => [0, 1, 2]
+ *
+ *  Returns a copy of +self+ if no arguments are given.
+ *
+ *  Related: Array#-;
+ *  see also {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
 static VALUE
-rb_ary_and(ary1, ary2)
-    VALUE ary1, ary2;
+rb_ary_difference_multi(int argc, VALUE *argv, VALUE ary)
 {
-    VALUE ary3;
+    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], elt, 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:
+ *    self & other_array -> new_array
+ *
+ *  Returns a new array containing the _intersection_ of +self+ and +other_array+;
+ *  that is, containing those elements found in both +self+ and +other_array+:
+ *
+ *    [0, 1, 2, 3] & [1, 2] # => [1, 2]
+ *
+ *  Omits duplicates:
+ *
+ *    [0, 1, 1, 0] & [0, 1] # => [0, 1]
+ *
+ *  Preserves order from +self+:
+ *
+ *    [0, 1, 2] & [3, 2, 1, 0] # => [0, 1, 2]
+ *
+ *  Identifies common elements using method <tt>#eql?</tt>
+ *  (as defined in each element of +self+).
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+
+static VALUE
+rb_ary_and(VALUE ary1, VALUE ary2)
+{
+    VALUE hash, ary3, v;
+    st_data_t vv;
     long i;
 
     ary2 = to_ary(ary2);
     ary3 = rb_ary_new();
-    for (i=0; i<RARRAY(ary1)->len; i++) {
-	if (rb_ary_includes(ary2, RARRAY(ary1)->ptr[i])
-	    && !rb_ary_includes(ary3, RARRAY(ary1)->ptr[i])) {
-	    rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
-	}
+    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++) {
+        v = RARRAY_AREF(ary1, i);
+        vv = (st_data_t)v;
+        if (rb_hash_stlike_delete(hash, &vv, 0)) {
+            rb_ary_push(ary3, v);
+        }
     }
+
     return ary3;
 }
 
+/*
+ *  call-seq:
+ *    intersection(*other_arrays) -> new_array
+ *
+ *  Returns a new array containing each element in +self+ that is +#eql?+
+ *  to at least one element in each of the given +other_arrays+;
+ *  duplicates are omitted:
+ *
+ *    [0, 0, 1, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
+ *
+ *  Each element must correctly implement method <tt>#hash</tt>.
+ *
+ *  Order from +self+ is preserved:
+ *
+ *    [0, 1, 2].intersection([2, 1, 0]) # => [0, 1, 2]
+ *
+ *  Returns a copy of +self+ if no arguments are given.
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
 static VALUE
-rb_ary_or(ary1, ary2)
-    VALUE ary1, ary2;
+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)
 {
-    VALUE ary3;
     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);
+    }
+}
 
-    if (TYPE(ary2) != T_ARRAY) {
-	if (rb_ary_includes(ary1, ary2)) return ary1;
-	else return rb_ary_push(ary1, ary2);
+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);
+        }
     }
+}
 
-    ary3 = rb_ary_new();
-    for (i=0; i<RARRAY(ary1)->len; i++) {
-	if (!rb_ary_includes(ary3, RARRAY(ary1)->ptr[i]))
-		rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
+/*
+ *  call-seq:
+ *    self | other_array -> new_array
+ *
+ *  Returns the union of +self+ and +other_array+;
+ *  duplicates are removed; order is preserved;
+ *  items are compared using <tt>eql?</tt> and <tt>hash</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: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+static VALUE
+rb_ary_or(VALUE ary1, VALUE ary2)
+{
+    VALUE hash;
+
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary1) + RARRAY_LEN(ary2) <= SMALL_ARRAY_LEN) {
+        VALUE 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);
+
+    return rb_hash_values(hash);
+}
+
+/*
+ *  call-seq:
+ *    union(*other_arrays) -> new_array
+ *
+ *  Returns a new array that is the union of the elements of +self+
+ *  and all given arrays +other_arrays+;
+ *  items are compared using <tt>eql?</tt> and <tt>hash</tt>:
+ *
+ *    [0, 1, 2, 3].union([4, 5], [6, 7]) # => [0, 1, 2, 3, 4, 5, 6, 7]
+ *
+ *  Removes duplicates (preserving the first found):
+ *
+ *    [0, 1, 1].union([2, 1], [3, 1]) # => [0, 1, 2, 3]
+ *
+ *  Preserves order (preserving the position of the first found):
+ *
+ *    [3, 2, 1, 0].union([5, 3], [4, 2]) # => [3, 2, 1, 0, 5, 4]
+ *
+ *  With no arguments given, returns a copy of +self+.
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+static VALUE
+rb_ary_union_multi(int argc, VALUE *argv, VALUE ary)
+{
+    int i;
+    long sum;
+    VALUE hash;
+
+    sum = RARRAY_LEN(ary);
+    for (i = 0; i < argc; i++) {
+        argv[i] = to_ary(argv[i]);
+        sum += RARRAY_LEN(argv[i]);
     }
-    for (i=0; i<RARRAY(ary2)->len; i++) {
-	if (!rb_ary_includes(ary3, RARRAY(ary2)->ptr[i]))
-		rb_ary_push(ary3, RARRAY(ary2)->ptr[i]);
+
+    if (sum <= SMALL_ARRAY_LEN) {
+        VALUE 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;
     }
-    return ary3;
+
+    hash = ary_make_hash(ary);
+    for (i = 0; i < argc; i++) rb_ary_union_hash(hash, argv[i]);
+
+    return rb_hash_values(hash);
 }
 
+/*
+ *  call-seq:
+ *    intersect?(other_array) -> true or false
+ *
+ *  Returns whether +other_array+ has at least one element that is +#eql?+ to some element of +self+:
+ *
+ *    [1, 2, 3].intersect?([3, 4, 5]) # => true
+ *    [1, 2, 3].intersect?([4, 5, 6]) # => false
+ *
+ *  Each element must correctly implement method <tt>#hash</tt>.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_uniq_bang(ary)
-    VALUE ary;
+rb_ary_intersect_p(VALUE ary1, VALUE ary2)
 {
-    VALUE *p, *q, *t, *end;
+    VALUE hash, v, result, shorter, longer;
+    st_data_t vv;
+    long i;
+
+    ary2 = to_ary(ary2);
+    if (RARRAY_LEN(ary1) == 0 || RARRAY_LEN(ary2) == 0) return Qfalse;
+
+    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;
+    }
+
+    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;
+        }
+    }
+
+    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);
 
-    rb_ary_modify(ary);
-    p = RARRAY(ary)->ptr;
-    end = p + RARRAY(ary)->len;
+        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));
 
-    while (p < end) {
-	v = *p++;
-	q = t = p;
-	while (q < end) {
-	    if (rb_equal(*q, v)) q++;
-	    else *t++ = *q++;
-	}
-	end = t;
+    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);
+        }
     }
-    if (RARRAY(ary)->len == (end - RARRAY(ary)->ptr)) {
-	return Qnil;
+
+    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);
+        }
     }
 
-    RARRAY(ary)->len = (end - RARRAY(ary)->ptr);
+    return vmax;
+}
+
+/*
+ *  call-seq:
+ *    max -> element
+ *    max(count) -> new_array
+ *    max {|a, b| ... } -> element
+ *    max(count) {|a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The maximum-valued element from +self+.
+ *  - A new array of maximum-valued elements from +self+.
+ *
+ *  Does not modify +self+.
+ *
+ *  With no block given, each element in +self+ must respond to method <tt>#<=></tt>
+ *  with a numeric.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the maximum value per method <tt>#<=></tt>:
+ *
+ *    [1, 0, 3, 2].max # => 3
+ *
+ *  With non-negative numeric argument +count+ and no block,
+ *  returns a new array with at most +count+ elements,
+ *  in descending order, per method <tt>#<=></tt>:
+ *
+ *    [1, 0, 3, 2].max(3)   # => [3, 2, 1]
+ *    [1, 0, 3, 2].max(3.0) # => [3, 2, 1]
+ *    [1, 0, 3, 2].max(9)   # => [3, 2, 1, 0]
+ *    [1, 0, 3, 2].max(0)   # => []
+ *
+ *  With a block given, the block must return a numeric.
+ *
+ *  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', '', '000', '00'].max {|a, b| a.size <=> b.size }
+ *    # => "000"
+ *
+ *  With non-negative numeric argument +count+ and a block,
+ *  returns a new array with at most +count+ elements,
+ *  in descending order, per the block:
+ *
+ *    ['0', '', '000', '00'].max(2) {|a, b| a.size <=> b.size }
+ *    # => ["000", "00"]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+static VALUE
+rb_ary_max(int argc, VALUE *argv, VALUE ary)
+{
+    VALUE result = Qundef, v;
+    VALUE num;
+    long i;
 
-    return ary;
+    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
-rb_ary_uniq(ary)
-    VALUE ary;
+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)
 {
-    ary = rb_obj_dup(ary);
-    rb_ary_uniq_bang(ary);
+    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:
+ *    min -> element
+ *    min(count) -> new_array
+ *    min {|a, b| ... } -> element
+ *    min(count) {|a, b| ... } -> new_array
+ *
+ *  Returns one of the following:
+ *
+ *  - The minimum-valued element from +self+.
+ *  - A new array of minimum-valued elements from +self+.
+ *
+ *  Does not modify +self+.
+ *
+ *  With no block given, each element in +self+ must respond to method <tt>#<=></tt>
+ *  with a numeric.
+ *
+ *  With no argument and no block, returns the element in +self+
+ *  having the minimum value per method <tt>#<=></tt>:
+ *
+ *    [1, 0, 3, 2].min # => 0
+ *
+ *  With non-negative numeric argument +count+ and no block,
+ *  returns a new array with at most +count+ elements,
+ *  in ascending order, per method <tt>#<=></tt>:
+ *
+ *    [1, 0, 3, 2].min(3)   # => [0, 1, 2]
+ *    [1, 0, 3, 2].min(3.0) # => [0, 1, 2]
+ *    [1, 0, 3, 2].min(9)   # => [0, 1, 2, 3]
+ *    [1, 0, 3, 2].min(0)   # => []
+ *
+ *  With a block given, the block must return a numeric.
+ *
+ *  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', '', '000', '00'].min {|a, b| a.size <=> b.size }
+ *    # => ""
+ *
+ *  With non-negative numeric argument +count+ and a block,
+ *  returns a new array with at most +count+ elements,
+ *  in ascending order, per the block:
+ *
+ *    ['0', '', '000', '00'].min(2) {|a, b| a.size <=> b.size }
+ *    # => ["", "0"]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+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:
+ *    minmax -> array
+ *    minmax {|a, b| ... } -> array
+ *
+ *  Returns a 2-element array containing the minimum-valued and maximum-valued
+ *  elements from +self+;
+ *  does not modify +self+.
+ *
+ *  With no block given, the minimum and maximum values are determined using method <tt>#<=></tt>:
+ *
+ *    [1, 0, 3, 2].minmax # => [0, 3]
+ *
+ *  With a block given, the block must return a numeric;
+ *  the block is called <tt>self.size - 1</tt> times to compare elements;
+ *  returns the elements having the minimum and maximum values per the block:
+ *
+ *    ['0', '', '000', '00'].minmax {|a, b| a.size <=> b.size }
+ *    # => ["", "000"]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+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
+push_value(st_data_t key, st_data_t val, st_data_t ary)
+{
+    rb_ary_push((VALUE)ary, (VALUE)val);
+    return ST_CONTINUE;
+}
+
+/*
+ *  call-seq:
+ *    uniq! -> self or nil
+ *    uniq! {|element| ... } -> self or nil
+ *
+ *  Removes duplicate elements from +self+, the first occurrence always being retained;
+ *  returns +self+ if any elements removed, +nil+ otherwise.
+ *
+ *  With no block given, identifies and removes elements using method <tt>eql?</tt>
+ *  and <tt>hash</tt> to compare elements:
+ *
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq! # => [0, 1, 2]
+ *    a.uniq! # => nil
+ *
+ *  With a block given, calls the block for each element;
+ *  identifies and omits "duplicate" elements using method <tt>eql?</tt>
+ *  and <tt>hash</tt> to compare <i>block return values</i>;
+ *  that is, an element is a duplicate if its block return value
+ *  is the same as that of a previous element:
+ *
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq! {|element| element.size } # => ["a", "aa", "aaa"]
+ *    a.uniq! {|element| element.size } # => nil
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+static VALUE
+rb_ary_uniq_bang(VALUE ary)
+{
+    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);
+    else
+        hash = ary_make_hash(ary);
+
+    hash_size = RHASH_SIZE(hash);
+    if (RARRAY_LEN(ary) == hash_size) {
+        return Qnil;
+    }
+    rb_ary_modify_check(ary);
+    ARY_SET_LEN(ary, 0);
+    if (ARY_SHARED_P(ary)) {
+        rb_ary_unshare(ary);
+        FL_SET_EMBED(ary);
+    }
+    ary_resize_capa(ary, hash_size);
+    rb_hash_foreach(hash, push_value, ary);
+
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    uniq -> new_array
+ *    uniq {|element| ... } -> new_array
+ *
+ *  Returns a new array containing those elements from +self+ that are not duplicates,
+ *  the first occurrence always being retained.
+ *
+ *  With no block given, identifies and omits duplicate elements using method <tt>eql?</tt>
+ *  and <tt>hash</tt> to compare elements:
+ *
+ *    a = [0, 0, 1, 1, 2, 2]
+ *    a.uniq # => [0, 1, 2]
+ *
+ *  With a block given, calls the block for each element;
+ *  identifies and omits "duplicate" elements using method <tt>eql?</tt>
+ *  and <tt>hash</tt> to compare <i>block return values</i>;
+ *  that is, an element is a duplicate if its block return value
+ *  is the same as that of a previous element:
+ *
+ *    a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
+ *    a.uniq {|element| element.size } # => ["a", "aa", "aaa"]
+ *
+ *  Related: {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
 static VALUE
-rb_ary_compact_bang(ary)
-    VALUE ary;
+rb_ary_uniq(VALUE ary)
+{
+    VALUE hash, 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 = rb_hash_values(hash);
+    }
+
+    return uniq;
+}
+
+/*
+ *  call-seq:
+ *    compact! -> self or nil
+ *
+ *  Removes all +nil+ elements from +self+;
+ *  Returns +self+ if any elements are removed, +nil+ otherwise:
+ *
+ *    a = [nil, 0, nil, false, nil, '', nil, [], nil, {}]
+ *    a.compact! # => [0, false, "", [], {}]
+ *    a          # => [0, false, "", [], {}]
+ *    a.compact! # => nil
+ *
+ *  Related: Array#compact;
+ *  see also {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
+VALUE
+rb_ary_compact_bang(VALUE ary)
 {
     VALUE *p, *t, *end;
+    long n;
 
     rb_ary_modify(ary);
-    p = t = RARRAY(ary)->ptr;
-    end = p + RARRAY(ary)->len;
+    p = t = (VALUE *)RARRAY_CONST_PTR(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++;
     }
-    if (RARRAY(ary)->len == (p - RARRAY(ary)->ptr)) {
-	return Qnil;
+    n = p - RARRAY_CONST_PTR(ary);
+    if (RARRAY_LEN(ary) == n) {
+        return Qnil;
     }
-    RARRAY(ary)->len = RARRAY(ary)->capa = (p - RARRAY(ary)->ptr);
-    REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
+    ary_resize_smaller(ary, n);
 
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    compact -> new_array
+ *
+ *  Returns a new array containing only the non-+nil+ elements from +self+;
+ *  element order is preserved:
+ *
+ *    a = [nil, 0, nil, false, nil, '', nil, [], nil, {}]
+ *    a.compact # => [0, false, "", [], {}]
+ *
+ *  Related: Array#compact!;
+ *  see also {Methods for Deleting}[rdoc-ref:Array@Methods+for+Deleting].
+ */
+
 static VALUE
-rb_ary_compact(ary)
-    VALUE ary;
+rb_ary_compact(VALUE ary)
 {
-    ary = rb_obj_dup(ary);
+    ary = rb_ary_dup(ary);
     rb_ary_compact_bang(ary);
     return ary;
 }
 
+/*
+ *  call-seq:
+ *    count -> integer
+ *    count(object) -> integer
+ *    count {|element| ... } -> integer
+ *
+ *  Returns a count of specified elements.
+ *
+ *  With no argument and no block, returns the count of all elements:
+ *
+ *    [0, :one, 'two', 3, 3.0].count # => 5
+ *
+ *  With argument +object+ given, returns the count of elements <tt>==</tt> to +object+:
+ *
+ *    [0, :one, 'two', 3, 3.0].count(3) # => 2
+ *
+ *  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 +object+ and a block given, issues a warning, ignores the block,
+ *  and returns the count of elements <tt>==</tt> to +object+.
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
 static VALUE
-rb_ary_nitems(ary)
-    VALUE ary;
+rb_ary_count(int argc, VALUE *argv, VALUE ary)
 {
-    long n = 0;
-    VALUE *p, *pend;
+    long i, n = 0;
+
+    if (rb_check_arity(argc, 0, 1) == 0) {
+        VALUE v;
+
+        if (!rb_block_given_p())
+            return LONG2NUM(RARRAY_LEN(ary));
 
-    p = RARRAY(ary)->ptr;
-    pend = p + RARRAY(ary)->len;
-    while (p < pend) {
-	if (!NIL_P(*p)) n++;
-	p++;
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            v = RARRAY_AREF(ary, i);
+            if (RTEST(rb_yield(v))) n++;
+        }
     }
-    return INT2NUM(n);
+    else {
+        VALUE obj = argv[0];
+
+        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
-rb_ary_flatten_bang(ary)
-    VALUE ary;
+flatten(VALUE ary, int level)
 {
     long i;
-    int mod = 0;
-    VALUE flattening = Qnil;
+    VALUE stack, result, tmp = 0, elt;
+    VALUE memo = Qfalse;
+
+    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));
+    ary_memcpy(result, 0, i, RARRAY_CONST_PTR(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) {
+        memo = rb_obj_hide(rb_ident_hash_new());
+        rb_hash_aset(memo, ary, Qtrue);
+        rb_hash_aset(memo, tmp, Qtrue);
+    }
+
+    ary = tmp;
+    i = 0;
+
+    while (1) {
+        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 (RTEST(memo)) {
+                    rb_hash_clear(memo);
+                }
+                rb_raise(rb_eRuntimeError, "flatten reentered");
+            }
+            if (NIL_P(tmp)) {
+                rb_ary_push(result, elt);
+            }
+            else {
+                if (memo) {
+                    if (rb_hash_aref(memo, tmp) == Qtrue) {
+                        rb_hash_clear(memo);
+                        rb_raise(rb_eArgError, "tried to flatten recursive array");
+                    }
+                    rb_hash_aset(memo, tmp, Qtrue);
+                }
+                rb_ary_push(stack, ary);
+                rb_ary_push(stack, LONG2NUM(i));
+                ary = tmp;
+                i = 0;
+            }
+        }
+        if (RARRAY_LEN(stack) == 0) {
+            break;
+        }
+        if (memo) {
+            rb_hash_delete(memo, ary);
+        }
+        tmp = rb_ary_pop(stack);
+        i = NUM2LONG(tmp);
+        ary = rb_ary_pop(stack);
+    }
+
+    if (memo) {
+        rb_hash_clear(memo);
+    }
+
+    RBASIC_SET_CLASS(result, rb_cArray);
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    flatten!(depth = nil) -> self or nil
+ *
+ *  Returns +self+ as a recursively flattening of +self+ to +depth+ levels of recursion;
+ *  +depth+ must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects],
+ *  or +nil+.
+ *  At each level of recursion:
+ *
+ *  - Each element that is an array is "flattened"
+ *    (that is, replaced by its individual array elements).
+ *  - Each element that is not an array is unchanged
+ *    (even if the element is an object that has instance method +flatten+).
+ *
+ *  Returns +nil+ if no elements were flattened.
+ *
+ *  With non-negative integer argument +depth+, flattens recursively through +depth+ levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5, {foo: 0}, Set.new([6, 7]) ]
+ *    a                   # => [0, [1, [2, 3], 4], 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.dup.flatten!(1)   # => [0, 1, [2, 3], 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.dup.flatten!(1.1) # => [0, 1, [2, 3], 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.dup.flatten!(2)   # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.dup.flatten!(3)   # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *
+ *  With +nil+ or negative argument +depth+, flattens all levels:
+ *
+ *    a.dup.flatten!     # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.dup.flatten!(-1) # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *
+ *  Related: Array#flatten;
+ *  see also {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+ */
+
+static VALUE
+rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
+{
+    int mod = 0, level = -1;
+    VALUE result, 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);
+    if (result == ary) {
+        return Qnil;
+    }
+    if (!(mod = ARY_EMBED_P(result))) rb_ary_freeze(result);
+    rb_ary_replace(ary, result);
+    if (mod) ARY_SET_EMBED_LEN(result, 0);
+
+    return ary;
+}
+
+/*
+ *  call-seq:
+ *    flatten(depth = nil) -> new_array
+ *
+ *  Returns a new array that is a recursive flattening of +self+
+ *  to +depth+ levels of recursion;
+ *  +depth+ must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects]
+ *  or +nil+.
+ *  At each level of recursion:
+ *
+ *  - Each element that is an array is "flattened"
+ *    (that is, replaced by its individual array elements).
+ *  - Each element that is not an array is unchanged
+ *    (even if the element is an object that has instance method +flatten+).
+ *
+ *  With non-negative integer argument +depth+, flattens recursively through +depth+ levels:
+ *
+ *    a = [ 0, [ 1, [2, 3], 4 ], 5, {foo: 0}, Set.new([6, 7]) ]
+ *    a              # => [0, [1, [2, 3], 4], 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(0)   # => [0, [1, [2, 3], 4], 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(1  ) # => [0, 1, [2, 3], 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(1.1) # => [0, 1, [2, 3], 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(2)   # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(3)   # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *
+ *  With +nil+ or negative +depth+, flattens all levels.
+ *
+ *    a.flatten     # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *    a.flatten(-1) # => [0, 1, 2, 3, 4, 5, {foo: 0}, #<Set: {6, 7}>]
+ *
+ *  Related: Array#flatten!;
+ *  see also {Methods for Converting}[rdoc-ref:Array@Methods+for+Converting].
+ */
+
+static VALUE
+rb_ary_flatten(int argc, VALUE *argv, VALUE ary)
+{
+    int level = -1;
+    VALUE result;
+
+    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);
+    if (result == ary) {
+        result = ary_make_shared_copy(ary);
+    }
+
+    return result;
+}
+
+#define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
+
+static VALUE
+rb_ary_shuffle_bang(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
+{
+    long i, len;
 
     rb_ary_modify(ary);
-    for (i=0; i<RARRAY(ary)->len; i++) {
-	VALUE ary2 = RARRAY(ary)->ptr[i];
-	if (TYPE(ary2) == T_ARRAY) {
-	    if (ary == ary2) {
-		ary2 = Qnil;
-	    } else {
-		VALUE id;
-
-		if (NIL_P(flattening)) {
-		    flattening = rb_ary_new();
-		}
-		id = rb_obj_id(ary2);
-		if (rb_ary_includes(flattening, id)) {
-		    rb_raise(rb_eArgError, "tryed to flatten recursive array");
-		}
-		rb_ary_push(flattening, id);
-	    }
-	    rb_ary_replace(ary, i--, 1, ary2);
-	    mod = 1;
-	}
-    }
-    if (mod == 0) return Qnil;
+    i = len = RARRAY_LEN(ary);
+    RARRAY_PTR_USE(ary, ptr, {
+        while (i > 1) {
+            long j = RAND_UPTO(i);
+            VALUE tmp;
+            if (len != RARRAY_LEN(ary) || ptr != RARRAY_CONST_PTR(ary)) {
+                rb_raise(rb_eRuntimeError, "modified during shuffle");
+            }
+            tmp = ptr[--i];
+            ptr[i] = ptr[j];
+            ptr[j] = tmp;
+        }
+    }); /* WB: no new reference */
     return ary;
 }
 
 static VALUE
-rb_ary_flatten(ary)
-    VALUE ary;
+rb_ary_shuffle(rb_execution_context_t *ec, VALUE ary, VALUE randgen)
+{
+    ary = rb_ary_dup(ary);
+    rb_ary_shuffle_bang(ec, ary, randgen);
+    return ary;
+}
+
+static const rb_data_type_t ary_sample_memo_type = {
+    .wrap_struct_name = "ary_sample_memo",
+    .function = {
+        .dfree = (RUBY_DATA_FUNC)st_free_table,
+    },
+    .flags = RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
+};
+
+static VALUE
+ary_sample(rb_execution_context_t *ec, VALUE ary, VALUE randgen, VALUE nv, VALUE to_array)
+{
+    VALUE result;
+    long n, len, i, j, k, idx[10];
+    long rnds[numberof(idx)];
+    long memo_threshold;
+
+    len = RARRAY_LEN(ary);
+    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);
+        }
+    }
+    k = len;
+    len = RARRAY_LEN(ary);
+    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_new_capa(0);
+      case 1:
+        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_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_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)) {
+        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(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;
+        VALUE vmemo = TypedData_Wrap_Struct(0, &ary_sample_memo_type, 0);
+        st_table *memo = st_init_numtable_with_size(n);
+        RTYPEDDATA_DATA(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(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];
+                }
+            });
+        });
+        RTYPEDDATA_DATA(vmemo) = 0;
+        st_free_table(memo);
+        RB_GC_GUARD(vmemo);
+    }
+    else {
+        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);
+
+    return result;
+}
+
+static VALUE
+ary_sized_alloc(rb_execution_context_t *ec, VALUE self)
+{
+    return rb_ary_new2(RARRAY_LEN(self));
+}
+
+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);
+    }
+    if (RARRAY_LEN(self) == 0) return INT2FIX(0);
+    if (NIL_P(n)) return DBL2NUM(HUGE_VAL);
+    mul = NUM2LONG(n);
+    if (mul <= 0) return INT2FIX(0);
+    n = LONG2FIX(mul);
+    return rb_fix_mul_fix(rb_ary_length(self), n);
+}
+
+/*
+ *  call-seq:
+ *    cycle(count = nil) {|element| ... } -> nil
+ *    cycle(count = nil) -> new_enumerator
+ *
+ *  With a block given, may call the block, depending on the value of argument +count+;
+ *  +count+ must be an
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects],
+ *  or +nil+.
+ *
+ *  When +count+ is positive,
+ *  calls the block with each element, then does so repeatedly,
+ *  until it has done so +count+ times; returns +nil+:
+ *
+ *    output = []
+ *    [0, 1].cycle(2) {|element| output.push(element) } # => nil
+ *    output # => [0, 1, 0, 1]
+ *
+ *  When +count+ is zero or negative, does not call the block:
+ *
+ *    [0, 1].cycle(0) {|element| fail 'Cannot happen' }  # => nil
+ *    [0, 1].cycle(-1) {|element| fail 'Cannot happen' } # => nil
+ *
+ *  When +count+ is +nil+, cycles forever:
+ *
+ *    # Prints 0 and 1 forever.
+ *    [0, 1].cycle {|element| puts element }
+ *    [0, 1].cycle(nil) {|element| puts element }
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+static VALUE
+rb_ary_cycle(int argc, VALUE *argv, VALUE ary)
+{
+    long n, i;
+
+    rb_check_arity(argc, 0, 1);
+
+    RETURN_SIZED_ENUMERATOR(ary, argc, argv, rb_ary_cycle_size);
+    if (argc == 0 || NIL_P(argv[0])) {
+        n = -1;
+    }
+    else {
+        n = NUM2LONG(argv[0]);
+        if (n <= 0) return Qnil;
+    }
+
+    while (RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
+        for (i=0; i<RARRAY_LEN(ary); i++) {
+            rb_yield(RARRAY_AREF(ary, i));
+        }
+    }
+    return Qnil;
+}
+
+/*
+ * 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;
+}
+
+/*
+ * Compute permutations of +r+ elements of the set <code>[0..n-1]</code>.
+ *
+ * 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
+ * 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(const long n, const long r, long *const p, char *const used, const VALUE values)
+{
+    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.
+ * https://en.wikipedia.org/wiki/Pochhammer_symbol
+ */
+static VALUE
+descending_factorial(long from, long how_many)
+{
+    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;
+}
+
+static VALUE
+binomial_coefficient(long comb, long size)
+{
+    VALUE r;
+    long i;
+    if (comb > size-comb) {
+        comb = size-comb;
+    }
+    if (comb < 0) {
+        return LONG2FIX(0);
+    }
+    else if (comb == 0) {
+        return LONG2FIX(1);
+    }
+    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
+rb_ary_permutation_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = (args && (RARRAY_LEN(args) > 0)) ? NUM2LONG(RARRAY_AREF(args, 0)) : n;
+
+    return descending_factorial(n, k);
+}
+
+/*
+ *  call-seq:
+ *    permutation(count = self.size) {|permutation| ... } -> self
+ *    permutation(count = self.size) -> new_enumerator
+ *
+ *  Iterates over permutations of the elements of +self+;
+ *  the order of permutations is indeterminate.
+ *
+ *  With a block and an in-range positive integer argument +count+ (<tt>0 < count <= self.size</tt>) given,
+ *  calls the block with each permutation of +self+ of size +count+;
+ *  returns +self+:
+ *
+ *    a = [0, 1, 2]
+ *    perms = []
+ *    a.permutation(1) {|perm| perms.push(perm) }
+ *    perms # => [[0], [1], [2]]
+ *
+ *    perms = []
+ *    a.permutation(2) {|perm| perms.push(perm) }
+ *    perms # => [[0, 1], [0, 2], [1, 0], [1, 2], [2, 0], [2, 1]]
+ *
+ *    perms = []
+ *    a.permutation(3) {|perm| perms.push(perm) }
+ *    perms # => [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]]
+ *
+ *  When +count+ is zero, calls the block once with a new empty array:
+ *
+ *    perms = []
+ *    a.permutation(0) {|perm| perms.push(perm) }
+ *    perms # => [[]]
+ *
+ *  When +count+ is out of range (negative or larger than <tt>self.size</tt>),
+ *  does not call the block:
+ *
+ *    a.permutation(-1) {|permutation| fail 'Cannot happen' }
+ *    a.permutation(4) {|permutation| fail 'Cannot happen' }
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+
+static VALUE
+rb_ary_permutation(int argc, VALUE *argv, VALUE ary)
+{
+    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 */
+    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 */
+    }
+    else if (r == 0) { /* exactly one permutation: the zero-length array */
+        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)));
+        }
+    }
+    else {             /* this is the general case */
+        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 */
+
+        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)
+{
+    long n = RARRAY_LEN(ary);
+    long k = NUM2LONG(RARRAY_AREF(args, 0));
+
+    return binomial_coefficient(k, n);
+}
+
+/*
+ *  call-seq:
+ *    combination(count) {|element| ... } -> self
+ *    combination(count) -> new_enumerator
+ *
+ *  When a block and a positive
+ *  {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects]
+ *  argument +count+ (<tt>0 < count <= self.size</tt>)
+ *  are given, calls the block with each combination of +self+ of size +count+;
+ *  returns +self+:
+ *
+ *    a = %w[a b c]                                   # => ["a", "b", "c"]
+ *    a.combination(2) {|combination| p combination } # => ["a", "b", "c"]
+ *
+ *  Output:
+ *
+ *    ["a", "b"]
+ *    ["a", "c"]
+ *    ["b", "c"]
+ *
+ *  The order of the yielded combinations is not guaranteed.
+ *
+ *  When +count+ is zero, calls the block once with a new empty array:
+ *
+ *    a.combination(0) {|combination| p combination }
+ *    [].combination(0) {|combination| p combination }
+ *
+ *  Output:
+ *
+ *    []
+ *    []
+ *
+ *  When +count+ is negative or larger than +self.size+ and +self+ is non-empty,
+ *  does not call the block:
+ *
+ *    a.combination(-1) {|combination| fail 'Cannot happen' } # => ["a", "b", "c"]
+ *    a.combination(4)  {|combination| fail 'Cannot happen' } # => ["a", "b", "c"]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: Array#permutation;
+ *  see also {Methods for Iterating}[rdoc-ref:Array@Methods+for+Iterating].
+ */
+
+static VALUE
+rb_ary_combination(VALUE ary, VALUE num)
+{
+    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 */
+    }
+    else if (n == 0) {
+        rb_yield(rb_ary_new2(0));
+    }
+    else if (n == 1) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
+    }
+    else {
+        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;
+}
+
+/*
+ * Compute repeated permutations of +r+ elements of the set
+ * <code>[0..n-1]</code>.
+ *
+ * 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
+ * values: the Ruby array that holds the actual values to permute
+ */
+static void
+rpermute0(const long n, const long r, long *const p, const VALUE values)
+{
+    long i = 0, index = 0;
+
+    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);
+    }
+}
+
+static VALUE
+rb_ary_repeated_permutation_size(VALUE ary, VALUE args, VALUE eobj)
+{
+    long n = RARRAY_LEN(ary);
+    long k = NUM2LONG(RARRAY_AREF(args, 0));
+
+    if (k < 0) {
+        return LONG2FIX(0);
+    }
+    if (n <= 0) {
+        return LONG2FIX(!k);
+    }
+    return rb_int_positive_pow(n, (unsigned long)k);
+}
+
+/*
+ *  call-seq:
+ *    repeated_permutation(size) {|permutation| ... } -> self
+ *    repeated_permutation(size) -> new_enumerator
+ *
+ *  With a block given, calls the block with each repeated permutation of length +size+
+ *  of the elements of +self+;
+ *  each permutation is an array;
+ *  returns +self+. The order of the permutations is indeterminate.
+ *
+ *  If a positive integer argument +size+ is given,
+ *  calls the block with each +size+-tuple repeated permutation of the elements of +self+.
+ *  The number of permutations is <tt>self.size**size</tt>.
+ *
+ *  Examples:
+ *
+ *  - +size+ is 1:
+ *
+ *      p = []
+ *      [0, 1, 2].repeated_permutation(1) {|permutation| p.push(permutation) }
+ *      p # => [[0], [1], [2]]
+ *
+ *  - +size+ is 2:
+ *
+ *      p = []
+ *      [0, 1, 2].repeated_permutation(2) {|permutation| p.push(permutation) }
+ *      p # => [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
+ *
+ *  If +size+ is zero, calls the block once with an empty array.
+ *
+ *  If +size+ is negative, does not call the block:
+ *
+ *    [0, 1, 2].repeated_permutation(-1) {|permutation| fail 'Cannot happen' }
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+static VALUE
+rb_ary_repeated_permutation(VALUE ary, VALUE num)
+{
+    long r, n, i;
+
+    n = RARRAY_LEN(ary);                  /* Array length */
+    RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_repeated_permutation_size);      /* Return Enumerator if no block */
+    r = NUM2LONG(num);                    /* Permutation size from argument */
+
+    if (r < 0) {
+        /* no permutations: yield nothing */
+    }
+    else if (r == 0) { /* exactly one permutation: the zero-length array */
+        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)));
+        }
+    }
+    else {             /* this is the general case */
+        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, ary0); /* compute and yield repeated permutations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
+    }
+    return ary;
+}
+
+static void
+rcombinate0(const long n, const long r, long *const p, const long rest, const VALUE values)
+{
+    long i = 0, index = 0;
+
+    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);
+    }
+}
+
+static VALUE
+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 binomial_coefficient(k, n + k - 1);
+}
+
+/*
+ *  call-seq:
+ *    repeated_combination(size) {|combination| ... } -> self
+ *    repeated_combination(size) -> new_enumerator
+ *
+ *  With a block given, calls the block with each repeated combination of length +size+
+ *  of the elements of +self+;
+ *  each combination is an array;
+ *  returns +self+. The order of the combinations is indeterminate.
+ *
+ *  If a positive integer argument +size+ is given,
+ *  calls the block with each +size+-tuple repeated combination of the elements of +self+.
+ *  The number of combinations is <tt>(size+1)(size+2)/2</tt>.
+ *
+ *  Examples:
+ *
+ *  - +size+ is 1:
+ *
+ *      c = []
+ *      [0, 1, 2].repeated_combination(1) {|combination| c.push(combination) }
+ *      c # => [[0], [1], [2]]
+ *
+ *  - +size+ is 2:
+ *
+ *      c = []
+ *      [0, 1, 2].repeated_combination(2) {|combination| c.push(combination) }
+ *      c # => [[0, 0], [0, 1], [0, 2], [1, 1], [1, 2], [2, 2]]
+ *
+ *  If +size+ is zero, calls the block once with an empty array.
+ *
+ *  If +size+ is negative, does not call the block:
+ *
+ *    [0, 1, 2].repeated_combination(-1) {|combination| fail 'Cannot happen' }
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+static VALUE
+rb_ary_repeated_combination(VALUE ary, VALUE num)
+{
+    long n, i, len;
+
+    n = NUM2LONG(num);                 /* Combination size from argument */
+    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 */
+    }
+    else if (n == 0) {
+        rb_yield(rb_ary_new2(0));
+    }
+    else if (n == 1) {
+        for (i = 0; i < RARRAY_LEN(ary); i++) {
+            rb_yield(rb_ary_new3(1, RARRAY_AREF(ary, i)));
+        }
+    }
+    else if (len == 0) {
+        /* yield nothing */
+    }
+    else {
+        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, n, ary0); /* compute and yield repeated combinations */
+        ALLOCV_END(t0);
+        RBASIC_SET_CLASS_RAW(ary0, rb_cArray);
+    }
+    return ary;
+}
+
+/*
+ *  call-seq:
+ *    product(*other_arrays) -> new_array
+ *    product(*other_arrays) {|combination| ... } -> self
+ *
+ *  Computes 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.
+ *
+ *  With no block given, returns the combinations as an array of arrays:
+ *
+ *    p = [0, 1].product([2, 3])
+ *    # => [[0, 2], [0, 3], [1, 2], [1, 3]]
+ *    p.size # => 4
+ *    p = [0, 1].product([2, 3], [4, 5])
+ *    # => [[0, 2, 4], [0, 2, 5], [0, 3, 4], [0, 3, 5], [1, 2, 4], [1, 2, 5], [1, 3, 4], [1, 3,...
+ *    p.size # => 8
+ *
+ *  If +self+ or any argument is empty, returns an empty array:
+ *
+ *    [].product([2, 3], [4, 5]) # => []
+ *    [0, 1].product([2, 3], []) # => []
+ *
+ *  If no argument is given, returns an array of 1-element arrays,
+ *  each containing an element of +self+:
+ *
+ *    a.product # => [[0], [1], [2]]
+ *
+ *  With a block given, calls the block with each combination; returns +self+:
+ *
+ *    p = []
+ *    [0, 1].product([2, 3]) {|combination| p.push(combination) }
+ *    p # => [[0, 2], [0, 3], [1, 2], [1, 3]]
+ *
+ *  If +self+ or any argument is empty, does not call the block:
+ *
+ *    [].product([2, 3], [4, 5]) {|combination| fail 'Cannot happen' }
+ *    # => []
+ *    [0, 1].product([2, 3], []) {|combination| fail 'Cannot happen' }
+ *    # => [0, 1]
+ *
+ *  If no argument is given, calls the block with each element of +self+ as a 1-element array:
+ *
+ *    p = []
+ *    [0, 1].product {|combination| p.push(combination) }
+ *    p # => [[0], [1]]
+ *
+ *  Related: see {Methods for Combining}[rdoc-ref:Array@Methods+for+Combining].
+ */
+
+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 = rb_ary_hidden_new(n);
+    volatile VALUE t1 = Qundef;
+    VALUE *arrays = RARRAY_PTR(t0); /* The arrays we're computing the product of */
+    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);
+
+    /* initialize the arrays of arrays */
+    ARY_SET_LEN(t0, n);
+    arrays[0] = ary;
+    for (i = 1; i < n; i++) arrays[i] = Qnil;
+    for (i = 1; i < n; i++) arrays[i] = to_ary(argv[i-1]);
+
+    /* initialize the counters for the arrays */
+    for (i = 0; i < n; i++) counters[i] = 0;
+
+    /* 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]);
+        }
+    }
+    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;
+            }
+            if (MUL_OVERFLOW_LONG_P(resultlen, k))
+                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, 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:
+    ALLOCV_END(t1);
+
+    return NIL_P(result) ? ary : result;
+}
+
+/*
+ *  call-seq:
+ *    take(count) -> new_array
+ *
+ *  Returns a new array containing the first +count+ element of +self+
+ *  (as available);
+ *  +count+ must be a non-negative numeric;
+ *  does not modify +self+:
+ *
+ *    a = ['a', 'b', 'c', 'd']
+ *    a.take(2)   # => ["a", "b"]
+ *    a.take(2.1) # => ["a", "b"]
+ *    a.take(50)  # => ["a", "b", "c", "d"]
+ *    a.take(0)   # => []
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_take(VALUE obj, VALUE n)
+{
+    long len = NUM2LONG(n);
+    if (len < 0) {
+        rb_raise(rb_eArgError, "attempt to take negative size");
+    }
+    return rb_ary_subseq(obj, 0, len);
+}
+
+/*
+ *  call-seq:
+ *    take_while {|element| ... } -> new_array
+ *    take_while -> new_enumerator
+ *
+ *  With a block given, calls the block with each successive element of +self+;
+ *  stops iterating if the block returns +false+ or +nil+;
+ *  returns a new array containing those elements for which the block returned a truthy value:
+ *
+ *    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.take_while {|element| false }       # => []
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Does not modify +self+.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_take_while(VALUE ary)
+{
+    long i;
+
+    RETURN_ENUMERATOR(ary, 0, 0);
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
+    }
+    return rb_ary_take(ary, LONG2FIX(i));
+}
+
+/*
+ *  call-seq:
+ *    drop(count) -> new_array
+ *
+ *  Returns a new array containing all but the first +count+ element of +self+,
+ *  where +count+ is a non-negative integer;
+ *  does not modify +self+.
+ *
+ *  Examples:
+ *
+ *    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]
+ *    a.drop(9) # => []
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+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");
+    }
+
+    result = rb_ary_subseq(ary, pos, RARRAY_LEN(ary));
+    if (NIL_P(result)) result = rb_ary_new();
+    return result;
+}
+
+/*
+ *  call-seq:
+ *    drop_while {|element| ... } -> new_array
+ *    drop_while -> new_enumerator
+ *
+ *  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;
+ *  does not modify +self+:
+ *
+ *    a = [0, 1, 2, 3, 4, 5]
+ *    a.drop_while {|element| element < 3 } # => [3, 4, 5]
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+static VALUE
+rb_ary_drop_while(VALUE ary)
+{
+    long i;
+
+    RETURN_ENUMERATOR(ary, 0, 0);
+    for (i = 0; i < RARRAY_LEN(ary); i++) {
+        if (!RTEST(rb_yield(RARRAY_AREF(ary, i)))) break;
+    }
+    return rb_ary_drop(ary, LONG2FIX(i));
+}
+
+/*
+ *  call-seq:
+ *    any? -> true or false
+ *    any?(object) -> true or false
+ *    any? {|element| ... } -> true or false
+ *
+ *  Returns whether for any element of +self+, a given criterion is satisfied.
+ *
+ *  With no block and no argument, returns whether any element of +self+ is truthy:
+ *
+ *    [nil, false, []].any? # => true  # Array object is truthy.
+ *    [nil, false, {}].any? # => true  # Hash object is truthy.
+ *    [nil, false, ''].any? # => true  # String object is truthy.
+ *    [nil, false].any?     # => false # Nil and false are not truthy.
+ *
+ *  With argument +object+ given,
+ *  returns whether <tt>object === ele</tt> for any element +ele+ in +self+:
+ *
+ *    [nil, false, 0].any?(0)          # => true
+ *    [nil, false, 1].any?(0)          # => false
+ *    [nil, false, 'food'].any?(/foo/) # => true
+ *    [nil, false, 'food'].any?(/bar/) # => false
+ *
+ *  With a block given,
+ *  calls the block with each element in +self+;
+ *  returns whether the block returns any truthy value:
+ *
+ *    [0, 1, 2].any? {|ele| ele < 1 } # => true
+ *    [0, 1, 2].any? {|ele| ele < 0 } # => false
+ *
+ *  With both a block and argument +object+ given,
+ *  ignores the block and uses +object+ as above.
+ *
+ *  <b>Special case</b>: returns +false+ if +self+ is empty
+ *  (regardless of any given argument or block).
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+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:
+ *    all? -> true or false
+ *    all?(object) -> true or false
+ *    all? {|element| ... } -> true or false
+ *
+ *  Returns whether for every element of +self+,
+ *  a given criterion is satisfied.
+ *
+ *  With no block and no argument,
+ *  returns whether every element of +self+ is truthy:
+ *
+ *    [[], {}, '', 0, 0.0, Object.new].all? # => true  # All truthy objects.
+ *    [[], {}, '', 0, 0.0, nil].all?        # => false # nil is not truthy.
+ *    [[], {}, '', 0, 0.0, false].all?      # => false # false is not truthy.
+ *
+ *  With argument +object+ given, returns whether <tt>object === ele</tt>
+ *  for every element +ele+ in +self+:
+ *
+ *    [0, 0, 0].all?(0)                    # => true
+ *    [0, 1, 2].all?(1)                    # => false
+ *    ['food', 'fool', 'foot'].all?(/foo/) # => true
+ *    ['food', 'drink'].all?(/foo/)        # => false
+ *
+ *  With a block given, calls the block with each element in +self+;
+ *  returns whether the block returns only truthy values:
+ *
+ *    [0, 1, 2].all? { |ele| ele < 3 } # => true
+ *    [0, 1, 2].all? { |ele| ele < 2 } # => false
+ *
+ *  With both a block and argument +object+ given,
+ *  ignores the block and uses +object+ as above.
+ *
+ *  <b>Special case</b>: returns +true+ if +self+ is empty
+ *  (regardless of any given argument or block).
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+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:
+ *    none? -> true or false
+ *    none?(object) -> true or false
+ *    none? {|element| ... } -> true or false
+ *
+ *  Returns +true+ if no element of +self+ meets a given criterion, +false+ otherwise.
+ *
+ *  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 argument +object+ given, returns +false+ if for any element +element+,
+ *  <tt>object === element</tt>; +true+ 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
+ *
+ *  With a block given, 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
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+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:
+ *    one? -> true or false
+ *    one? {|element| ... } -> true or false
+ *    one?(object) -> 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, 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
+ *
+ *  With argument +object+ given, returns +true+ if for exactly one element +element+, <tt>object === element</tt>;
+ *  +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: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+ */
+
+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:
+ *    dig(index, *identifiers) -> object
+ *
+ *  Finds and returns the object in nested object
+ *  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
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+ */
+
+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:
+ *   sum(init = 0) -> object
+ *   sum(init = 0) {|element| ... } -> object
+ *
+ *  With no block given, returns the sum of +init+ and all elements of +self+;
+ *  for array +array+ and value +init+, equivalent to:
+ *
+ *    sum = init
+ *    array.each {|element| sum += element }
+ *    sum
+ *
+ *  For example, <tt>[e0, e1, e2].sum</tt> returns <tt>init + e0 + e1 + e2</tt>.
+ *
+ *  Examples:
+ *
+ *    [0, 1, 2, 3].sum                 # => 6
+ *    [0, 1, 2, 3].sum(100)            # => 106
+ *    ['abc', 'def', 'ghi'].sum('jkl') # => "jklabcdefghi"
+ *    [[:foo, :bar], ['foo', 'bar']].sum([2, 3])
+ *    # => [2, 3, :foo, :bar, "foo", "bar"]
+ *
+ *  The +init+ value and elements need not be numeric, but must all be <tt>+</tt>-compatible:
+ *
+ *    # Raises TypeError: Array can't be coerced into Integer.
+ *    [[:foo, :bar], ['foo', 'bar']].sum(2)
+ *
+ *  With a block given, calls the block with each element of +self+;
+ *  the block's return value (instead of the element itself) is used as the addend:
+ *
+ *    ['zero', 1, :two].sum('Coerced and concatenated: ') {|element| element.to_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;
+
+    bool init_is_float = RB_FLOAT_TYPE_P(v);
+    if (init_is_float) {
+        v = LONG2FIX(0);
+    }
+    else if (!RB_INTEGER_TYPE_P(v) && !RB_TYPE_P(v, T_RATIONAL)) {
+        i = 0;
+        goto init_is_a_value;
+    }
+
+    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);
+    if (init_is_float) v = rb_float_plus(argv[0], v);
+    return v;
+
+  not_exact:
+    v = finish_exact_sum(n, r, v, i!=0);
+
+    if (init_is_float ? (--i, e = argv[0], true) : 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;
+    init_is_a_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;
+}
+
+/* :nodoc: */
+static VALUE
+rb_ary_deconstruct(VALUE ary)
 {
-    ary = rb_obj_dup(ary);
-    rb_ary_flatten_bang(ary);
     return ary;
 }
 
+/*
+ *  An \Array object is an ordered, integer-indexed collection of objects,
+ *  called _elements_;
+ *  the object represents
+ *  an {array data structure}[https://en.wikipedia.org/wiki/Array_(data_structure)].
+ *
+ *  An element may be any object (even another array);
+ *  elements may be any mixture of objects of different types.
+ *
+ *  Important data structures that use arrays include:
+ *
+ *  - {Coordinate vector}[https://en.wikipedia.org/wiki/Coordinate_vector].
+ *  - {Matrix}[https://en.wikipedia.org/wiki/Matrix_(mathematics)].
+ *  - {Heap}[https://en.wikipedia.org/wiki/Heap_(data_structure)].
+ *  - {Hash table}[https://en.wikipedia.org/wiki/Hash_table].
+ *  - {Deque (double-ended queue)}[https://en.wikipedia.org/wiki/Double-ended_queue].
+ *  - {Queue}[https://en.wikipedia.org/wiki/Queue_(abstract_data_type)].
+ *  - {Stack}[https://en.wikipedia.org/wiki/Stack_(abstract_data_type)].
+ *
+ *  There are also array-like data structures:
+ *
+ *  - {Associative array}[https://en.wikipedia.org/wiki/Associative_array] (see Hash).
+ *  - {Directory}[https://en.wikipedia.org/wiki/Directory_(computing)] (see Dir).
+ *  - {Environment}[https://en.wikipedia.org/wiki/Environment_variable] (see ENV).
+ *  - {Set}[https://en.wikipedia.org/wiki/Set_(abstract_data_type)] (see Set).
+ *  - {String}[https://en.wikipedia.org/wiki/String_(computer_science)] (see String).
+ *
+ *  == \Array Indexes
+ *
+ *  \Array indexing starts at 0, as in C or Java.
+ *
+ *  A non-negative 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.
+ *  - ...
+ *
+ *
+ *  === In-Range and Out-of-Range Indexes
+ *
+ *  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.
+ *
+ *  === Effective Index
+ *
+ *  Although the effective index into an array is always an integer,
+ *  some methods (both within class \Array and elsewhere)
+ *  accept one or more non-integer arguments that are
+ *  {integer-convertible objects}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects].
+ *
+ *  == Creating Arrays
+ *
+ *  You can create an \Array object explicitly with:
+ *
+ *  - An {array literal}[rdoc-ref:syntax/literals.rdoc@Array+Literals]:
+ *
+ *      [1, 'one', :one, [2, 'two', :two]]
+ *
+ *  - A {%w or %W string-array Literal}[rdoc-ref:syntax/literals.rdoc@w-and-w-String-Array-Literals]:
+ *
+ *      %w[foo bar baz] # => ["foo", "bar", "baz"]
+ *      %w[1 % *]       # => ["1", "%", "*"]
+ *
+ *  - A {%i or %I symbol-array Literal}[rdoc-ref:syntax/literals.rdoc@i+and-I-Symbol-Array+Literals]:
+ *
+ *      %i[foo bar baz] # => [:foo, :bar, :baz]
+ *      %i[1 % *]       # => [:"1", :%, :*]
+ *
+ *  - Method Kernel#Array:
+ *
+ *      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"]]
+ *
+ *  - Method Array.new:
+ *
+ *      Array.new               # => []
+ *      Array.new(3)            # => [nil, nil, nil]
+ *      Array.new(4) {Hash.new} # => [{}, {}, {}, {}]
+ *      Array.new(3, true)      # => [true, true, true]
+ *
+ *    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+.
+ *
+ *    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:
+ *
+ *      Array.new(4) {|i| i.to_s } # => ["0", "1", "2", "3"]
+ *
+ *    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,
+ *  class \Array has proprietary methods for accessing, searching and otherwise
+ *  manipulating arrays.
+ *
+ *  Some of the more common ones are illustrated below.
+ *
+ *  == Accessing Elements
+ *
+ *  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. Negative indices start counting from the end,
+ *  with -1 being the last element.
+ *
+ *     arr = [1, 2, 3, 4, 5, 6]
+ *     arr[2]    #=> 3
+ *     arr[100]  #=> nil
+ *     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
+ *
+ *     arr.at(0) #=> 1
+ *
+ *  The #slice method works in an identical manner to Array#[].
+ *
+ *  To raise an error for indices outside of the array bounds or else to
+ *  provide a default value when that happens, you can use #fetch.
+ *
+ *     arr = ['a', 'b', 'c', 'd', 'e', 'f']
+ *     arr.fetch(100) #=> IndexError: index 100 outside of array bounds: -6...6
+ *     arr.fetch(100, "oops") #=> "oops"
+ *
+ *  The special methods #first and #last will return the first and last
+ *  elements of an array, respectively.
+ *
+ *     arr.first #=> 1
+ *     arr.last  #=> 6
+ *
+ *  To return the first +n+ elements of an array, use #take
+ *
+ *     arr.take(3) #=> [1, 2, 3]
+ *
+ *  #drop does the opposite of #take, by returning the elements after +n+
+ *  elements have been dropped:
+ *
+ *     arr.drop(3) #=> [4, 5, 6]
+ *
+ *  == Obtaining Information about an \Array
+ *
+ *  An array keeps track of its own length at all times.  To query an array
+ *  about the number of elements it contains, use #length, #count or #size.
+ *
+ *    browsers = ['Chrome', 'Firefox', 'Safari', 'Opera', 'IE']
+ *    browsers.length #=> 5
+ *    browsers.count #=> 5
+ *
+ *  To check whether an array contains any elements at all
+ *
+ *    browsers.empty? #=> false
+ *
+ *  To check whether a particular item is included in the array
+ *
+ *    browsers.include?('Konqueror') #=> false
+ *
+ *  == Adding Items to an \Array
+ *
+ *  Items can be added to the end of an array by using either #push or #<<
+ *
+ *    arr = [1, 2, 3, 4]
+ *    arr.push(5) #=> [1, 2, 3, 4, 5]
+ *    arr << 6    #=> [1, 2, 3, 4, 5, 6]
+ *
+ *  #unshift will add a new item to the beginning of an array.
+ *
+ *     arr.unshift(0) #=> [0, 1, 2, 3, 4, 5, 6]
+ *
+ *  With #insert you can add a new element to an array at any position.
+ *
+ *     arr.insert(3, 'apple')  #=> [0, 1, 2, 'apple', 3, 4, 5, 6]
+ *
+ *  Using the #insert method, you can also insert multiple values at once:
+ *
+ *     arr.insert(3, 'orange', 'pear', 'grapefruit')
+ *     #=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
+ *
+ *  == Removing Items from an \Array
+ *
+ *  The method #pop removes the last element in an array and returns it:
+ *
+ *     arr =  [1, 2, 3, 4, 5, 6]
+ *     arr.pop #=> 6
+ *     arr #=> [1, 2, 3, 4, 5]
+ *
+ *  To retrieve and at the same time remove the first item, use #shift:
+ *
+ *     arr.shift #=> 1
+ *     arr #=> [2, 3, 4, 5]
+ *
+ *  To delete an element at a particular index:
+ *
+ *     arr.delete_at(2) #=> 4
+ *     arr #=> [2, 3, 5]
+ *
+ *  To delete a particular element anywhere in an array, use #delete:
+ *
+ *     arr = [1, 2, 2, 3]
+ *     arr.delete(2) #=> 2
+ *     arr #=> [1,3]
+ *
+ *  A useful method if you need to remove +nil+ values from an array is
+ *  #compact:
+ *
+ *     arr = ['foo', 0, nil, 'bar', 7, 'baz', nil]
+ *     arr.compact  #=> ['foo', 0, 'bar', 7, 'baz']
+ *     arr          #=> ['foo', 0, nil, 'bar', 7, 'baz', nil]
+ *     arr.compact! #=> ['foo', 0, 'bar', 7, 'baz']
+ *     arr          #=> ['foo', 0, 'bar', 7, 'baz']
+ *
+ *  Another common need is to remove duplicate elements from an array.
+ *
+ *  It has the non-destructive #uniq, and destructive method #uniq!
+ *
+ *     arr = [2, 5, 6, 556, 6, 6, 8, 9, 0, 123, 556]
+ *     arr.uniq #=> [2, 5, 6, 556, 8, 9, 0, 123]
+ *
+ *  == Iterating over an \Array
+ *
+ *  Like all classes that include the Enumerable module, class \Array has an each
+ *  method, which defines what elements should be iterated over and how.  In
+ *  case of Array#each, all elements in +self+ 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, " "}
+ *     # prints: -9 -8 -7 -6 -5
+ *     #=> [1, 2, 3, 4, 5]
+ *
+ *  Another sometimes useful iterator is #reverse_each which will iterate over
+ *  the elements in the array in reverse order.
+ *
+ *     words = %w[first second third fourth fifth sixth]
+ *     str = ""
+ *     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                   #=> [1, 2, 3, 4, 5]
+ *     arr.map! {|a| a**2}   #=> [1, 4, 9, 16, 25]
+ *     arr                   #=> [1, 4, 9, 16, 25]
+ *
+ *
+ *  == 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
+ *  manner.  While the destructive operations will modify the array they were
+ *  called on, the non-destructive methods usually return a new array with the
+ *  selected elements, but leave the original array unchanged.
+ *
+ *  === 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                          #=> [1, 2, 3, 4, 5, 6]
+ *
+ *  === Destructive Selection
+ *
+ *  #select! and #reject! are the corresponding destructive methods to #select
+ *  and #reject
+ *
+ *  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                         #=> [4, 5, 6]
+ *
+ *     arr = [1, 2, 3, 4, 5, 6]
+ *     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@Whats-Here].
+ *  - Includes {module Enumerable}[rdoc-ref:Enumerable@Whats-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.
+ *
+ *  See also {Creating Arrays}[rdoc-ref:Array@Creating+Arrays].
+ *
+ *  === Methods for Querying
+ *
+ *  - #all?: Returns whether all elements meet a given criterion.
+ *  - #any?: Returns whether any element meets a given criterion.
+ *  - #count: Returns the count of elements that meet a given criterion.
+ *  - #empty?: Returns whether there are no elements.
+ *  - #find_index (aliased as #index): Returns the index of the first element that meets a given criterion.
+ *  - #hash: Returns the integer hash code.
+ *  - #include?: Returns whether any element <tt>==</tt> a given object.
+ *  - #length (aliased as #size): Returns the count of elements.
+ *  - #none?: Returns whether no element <tt>==</tt> a given object.
+ *  - #one?: Returns whether exactly one element <tt>==</tt> a given object.
+ *  - #rindex: Returns the index of the last element that meets a given criterion.
+ *
+ *  === 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+.
+ *
+ *  - #[] (aliased as #slice): Returns consecutive elements as determined by a given argument.
+ *  - #assoc: Returns the first element that is an array whose first element <tt>==</tt> a given object.
+ *  - #at: Returns the element at a given offset.
+ *  - #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.
+ *  - #compact: Returns an array containing all non-+nil+ elements.
+ *  - #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.
+ *  - #drop_while: Returns trailing elements as determined by a given block.
+ *  - #fetch: Returns the element at a given offset.
+ *  - #fetch_values: Returns elements at given offsets.
+ *  - #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.
+ *  - #rassoc: Returns the first element that is an array whose second element <tt>==</tt> a given object.
+ *  - #reject: Returns an array containing elements not rejected by a given block.
+ *  - #reverse: Returns all elements in reverse order.
+ *  - #rotate: Returns all elements with some rotated from one end to the other.
+ *  - #sample: Returns one or more random elements.
+ *  - #select (aliased as #filter): Returns an array containing elements selected by a given block.
+ *  - #shuffle: Returns elements in a random order.
+ *  - #sort: Returns all elements in an order determined by <tt>#<=></tt> or a given block.
+ *  - #take: Returns leading elements as determined by a given index.
+ *  - #take_while: Returns leading elements as determined by a given block.
+ *  - #uniq: Returns an array containing non-duplicate elements.
+ *  - #values_at: Returns the elements at given offsets.
+ *
+ *  === Methods for Assigning
+ *
+ *  These methods add, replace, or reorder elements in +self+.
+ *
+ *  - #<<: Appends an element.
+ *  - #[]=: Assigns specified elements with a given object.
+ *  - #concat: Appends all elements from given arrays.
+ *  - #fill: Replaces specified elements with specified objects.
+ *  - #flatten!: Replaces each nested array in +self+ with the elements from that array.
+ *  - #initialize_copy (aliased as #replace): Replaces the content of +self+ with the content of a given array.
+ *  - #insert: Inserts given objects at a given offset; does not replace elements.
+ *  - #push (aliased as #append): Appends elements.
+ *  - #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.
+ *  - #unshift (aliased as #prepend): Prepends leading elements.
+ *
+ *  === Methods for Deleting
+ *
+ *  Each of these methods removes elements from +self+:
+ *
+ *  - #clear: Removes all elements.
+ *  - #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.
+ *  - #pop: Removes and returns the last element.
+ *  - #reject!: Removes elements specified by a given block.
+ *  - #select! (aliased as #filter!): Removes elements not specified by a given block.
+ *  - #shift:  Removes and returns the first element.
+ *  - #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.
+ *  - #+: 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 element of +self+ and all elements of a given array, duplicates removed.
+ *  - #difference: Returns an array containing all elements of +self+ that are not found in any of the given arrays..
+ *  - #intersection: Returns an array containing elements found both in +self+ and in each given array.
+ *  - #product: Returns or yields all combinations of elements from +self+ and given arrays.
+ *  - #reverse: Returns an array containing all elements of +self+ in reverse order.
+ *  - #union: Returns an array containing all elements of +self+ and all elements of given arrays, duplicates removed.
+ *
+ *  === Methods for Iterating
+ *
+ *  - #combination: Calls a given block with combinations of elements of +self+; a combination does not use the same element more than once.
+ *  - #cycle: Calls a given block with each element, then does so again, for a specified number of times, or forever.
+ *  - #each: Passes each element to a given block.
+ *  - #each_index: Passes each element index to a given block.
+ *  - #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.
+ *  - #reverse_each:  Passes each element, in reverse order, to a given block.
+ *
+ *  === Methods for Converting
+ *
+ *  - #collect (aliased as #map): Returns an array containing the block return-value for each element.
+ *  - #collect! (aliased as #map!): Replaces each element with a block return-value.
+ *  - #flatten: Returns an array that is a recursive flattening of +self+.
+ *  - #inspect (aliased as #to_s): Returns a new String containing the elements.
+ *  - #join: Returns a new String 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.
+ *
+ *  === 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>.
+ *
+ *  - #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()
+Init_Array(void)
 {
+    fake_ary_flags = init_fake_ary_flags();
+
     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);
-    rb_define_method(rb_cArray, "to_s", rb_ary_to_s, 0);
+    rb_define_method(rb_cArray, "initialize_copy", rb_ary_replace, 1);
+
     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_ary", rb_ary_to_a, 0);
-    rb_define_method(rb_cArray, "frozen?",  rb_ary_frozen_p, 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, "==", rb_ary_equal, 1);
     rb_define_method(rb_cArray, "eql?", rb_ary_eql, 1);
     rb_define_method(rb_cArray, "hash", rb_ary_hash, 0);
-    rb_define_method(rb_cArray, "===", rb_ary_equal, 1);
 
     rb_define_method(rb_cArray, "[]", rb_ary_aref, -1);
     rb_define_method(rb_cArray, "[]=", rb_ary_aset, -1);
     rb_define_method(rb_cArray, "at", rb_ary_at, 1);
-    rb_define_method(rb_cArray, "first", rb_ary_first, 0);
-    rb_define_method(rb_cArray, "last", rb_ary_last, 0);
-    rb_define_method(rb_cArray, "concat", rb_ary_concat, 1);
+    rb_define_method(rb_cArray, "fetch", rb_ary_fetch, -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_method(rb_cArray, "pop", rb_ary_pop, 0);
-    rb_define_method(rb_cArray, "shift", rb_ary_shift, 0);
+    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, "index", rb_ary_index, 1);
-    rb_define_method(rb_cArray, "rindex", rb_ary_rindex, 1);
-    rb_define_method(rb_cArray, "indexes", rb_ary_indexes, -1);
-    rb_define_method(rb_cArray, "indices", rb_ary_indexes, -1);
-    rb_define_method(rb_cArray, "clone", rb_ary_clone, 0);
+    rb_define_method(rb_cArray, "find", rb_ary_find, -1);
+    rb_define_method(rb_cArray, "detect", rb_ary_find, -1);
+    rb_define_method(rb_cArray, "rfind", rb_ary_rfind, -1);
+    rb_define_method(rb_cArray, "find_index", rb_ary_index, -1);
+    rb_define_method(rb_cArray, "index", rb_ary_index, -1);
+    rb_define_method(rb_cArray, "rindex", rb_ary_rindex, -1);
     rb_define_method(rb_cArray, "join", rb_ary_join_m, -1);
     rb_define_method(rb_cArray, "reverse", rb_ary_reverse_m, 0);
     rb_define_method(rb_cArray, "reverse!", rb_ary_reverse_bang, 0);
+    rb_define_method(rb_cArray, "rotate", rb_ary_rotate_m, -1);
+    rb_define_method(rb_cArray, "rotate!", rb_ary_rotate_bang, -1);
     rb_define_method(rb_cArray, "sort", rb_ary_sort, 0);
     rb_define_method(rb_cArray, "sort!", rb_ary_sort_bang, 0);
+    rb_define_method(rb_cArray, "sort_by!", rb_ary_sort_by_bang, 0);
     rb_define_method(rb_cArray, "collect", rb_ary_collect, 0);
     rb_define_method(rb_cArray, "collect!", rb_ary_collect_bang, 0);
+    rb_define_method(rb_cArray, "map", rb_ary_collect, 0);
     rb_define_method(rb_cArray, "map!", rb_ary_collect_bang, 0);
-    rb_define_method(rb_cArray, "filter", rb_ary_filter, 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);
     rb_define_method(rb_cArray, "delete_at", rb_ary_delete_at_m, 1);
     rb_define_method(rb_cArray, "delete_if", rb_ary_delete_if, 0);
+    rb_define_method(rb_cArray, "reject", rb_ary_reject, 0);
     rb_define_method(rb_cArray, "reject!", rb_ary_reject_bang, 0);
-    rb_define_method(rb_cArray, "replace", rb_ary_replace_m, 1);
+    rb_define_method(rb_cArray, "zip", rb_ary_zip, -1);
+    rb_define_method(rb_cArray, "transpose", rb_ary_transpose, 0);
+    rb_define_method(rb_cArray, "replace", rb_ary_replace, 1);
     rb_define_method(rb_cArray, "clear", rb_ary_clear, 0);
     rb_define_method(rb_cArray, "fill", rb_ary_fill, -1);
     rb_define_method(rb_cArray, "include?", rb_ary_includes, 1);
@@ -1663,13 +8968,42 @@ Init_Array()
     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);
     rb_define_method(rb_cArray, "compact!", rb_ary_compact_bang, 0);
-    rb_define_method(rb_cArray, "flatten", rb_ary_flatten, 0);
-    rb_define_method(rb_cArray, "flatten!", rb_ary_flatten_bang, 0);
-    rb_define_method(rb_cArray, "nitems", rb_ary_nitems, 0);
-
-    cmp = rb_intern("<=>");
+    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, "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);
+    rb_define_method(rb_cArray, "repeated_permutation", rb_ary_repeated_permutation, 1);
+    rb_define_method(rb_cArray, "repeated_combination", rb_ary_repeated_combination, 1);
+    rb_define_method(rb_cArray, "product", rb_ary_product, -1);
+
+    rb_define_method(rb_cArray, "take", rb_ary_take, 1);
+    rb_define_method(rb_cArray, "take_while", rb_ary_take_while, 0);
+    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);
+    rb_define_method(rb_cArray, "freeze", rb_ary_freeze, 0);
+
+    rb_define_method(rb_cArray, "deconstruct", rb_ary_deconstruct, 0);
+
+    rb_cArray_empty_frozen = RB_OBJ_SET_SHAREABLE(rb_ary_freeze(rb_ary_new()));
+    rb_vm_register_global_object(rb_cArray_empty_frozen);
 }
+
+#include "array.rbinc"
diff --git a/array.rb b/array.rb
new file mode 100644
index 0000000000..7ee4e09a4c
--- /dev/null
+++ b/array.rb
@@ -0,0 +1,307 @@
+class Array
+  # call-seq:
+  #   shuffle!(random: Random) -> self
+  #
+  # Shuffles all elements in +self+ into a random order,
+  # as selected by the object given by the keyword argument +random+.
+  # Returns +self+:
+  #
+  #   a =             [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
+  #   a.shuffle! # => [5, 3, 8, 7, 6, 1, 9, 4, 2, 0]
+  #   a.shuffle! # => [9, 4, 0, 6, 2, 8, 1, 5, 3, 7]
+  #
+  # Duplicate elements are included:
+  #
+  #   a =             [0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
+  #   a.shuffle! # => [1, 0, 0, 1, 1, 0, 1, 0, 0, 1]
+  #   a.shuffle! # => [0, 1, 0, 1, 1, 0, 1, 0, 1, 0]
+  #
+  # The object given with the keyword argument +random+ is used as the random number generator.
+  #
+  # Related: see {Methods for Assigning}[rdoc-ref:Array@Methods+for+Assigning].
+  def shuffle!(random: Random)
+    Primitive.rb_ary_shuffle_bang(random)
+  end
+
+  # call-seq:
+  #   shuffle(random: Random) -> new_array
+  #
+  # Returns a new array containing all elements from +self+ in a random order,
+  # as selected by the object given by the keyword argument +random+:
+  #
+  #   a =            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
+  #   a.shuffle # => [0, 8, 1, 9, 6, 3, 4, 7, 2, 5]
+  #   a.shuffle # => [8, 9, 0, 5, 1, 2, 6, 4, 7, 3]
+  #
+  # Duplicate elements are included:
+  #
+  #   a =            [0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
+  #   a.shuffle # => [1, 0, 1, 1, 0, 0, 1, 0, 0, 1]
+  #   a.shuffle # => [1, 1, 0, 0, 0, 1, 1, 0, 0, 1]
+  #
+  # The object given with the keyword argument +random+ is used as the random number generator.
+  #
+  # Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+  def shuffle(random: Random)
+    Primitive.rb_ary_shuffle(random)
+  end
+
+  # call-seq:
+  #   sample(random: Random) -> object
+  #   sample(count, random: Random) -> new_ary
+  #
+  # Returns random elements from +self+,
+  # as selected by the object given by the keyword argument +random+.
+  #
+  # With no argument +count+ given, returns one random element from +self+:
+  #
+  #   a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
+  #   a.sample # => 3
+  #   a.sample # => 8
+  #
+  # Returns +nil+ if +self+ is empty:
+  #
+  #   [].sample # => nil
+  #
+  # With a non-negative numeric argument +count+ given,
+  # returns a new array containing +count+ random elements from +self+:
+  #
+  #   a.sample(3) # => [8, 9, 2]
+  #   a.sample(6) # => [9, 6, 0, 3, 1, 4]
+  #
+  # The order of the result array is unrelated to the order of +self+.
+  #
+  # Returns a new empty array if +self+ is empty:
+  #
+  #   [].sample(4) # => []
+  #
+  # May return duplicates in +self+:
+  #
+  #   a = [1, 1, 1, 2, 2, 3]
+  #   a.sample(a.size) # => [1, 1, 3, 2, 1, 2]
+  #
+  # Returns no more than <tt>a.size</tt> elements
+  # (because no new duplicates are introduced):
+  #
+  #   a.sample(50) # => [6, 4, 1, 8, 5, 9, 0, 2, 3, 7]
+  #
+  # The object given with the keyword argument +random+ is 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]
+  #
+  # Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+  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
+
+  # call-seq:
+  #   first -> object or nil
+  #   first(count) -> new_array
+  #
+  # Returns elements from +self+, or +nil+; does not modify +self+.
+  #
+  # With no argument given, returns the first element (if available):
+  #
+  #   a = [:foo, 'bar', 2]
+  #   a.first # => :foo
+  #   a # => [:foo, "bar", 2]
+  #
+  # If +self+ is empty, returns +nil+.
+  #
+  #   [].first # => nil
+  #
+  # With a non-negative integer argument +count+ given,
+  # returns the first +count+ elements (as available) in a new array:
+  #
+  #   a.first(0)  # => []
+  #   a.first(2)  # => [:foo, "bar"]
+  #   a.first(50) # => [:foo, "bar", 2]
+  #
+  # Related: see {Methods for Querying}[rdoc-ref:Array@Methods+for+Querying].
+  def first n = unspecified = true
+    if Primitive.mandatory_only?
+      Primitive.attr! :leaf
+      Primitive.cexpr! %q{ ary_first(self) }
+    else
+      if unspecified
+        Primitive.cexpr! %q{ ary_first(self) }
+      else
+        Primitive.cexpr! %q{  ary_take_first_or_last_n(self, NUM2LONG(n), ARY_TAKE_FIRST) }
+      end
+    end
+  end
+
+  # call-seq:
+  #  last  -> last_object or nil
+  #  last(count) -> new_array
+  #
+  # Returns elements from +self+, or +nil+; +self+ is not modified.
+  #
+  # With no argument given, returns the last element, or +nil+ if +self+ is empty:
+  #
+  #   a = [:foo, 'bar', 2]
+  #   a.last # => 2
+  #   a # => [:foo, "bar", 2]
+  #   [].last # => nil
+  #
+  #
+  # With non-negative integer argument +count+ given,
+  # returns a new array containing the trailing +count+ elements of +self+, as available:
+  #
+  #   a = [:foo, 'bar', 2]
+  #   a.last(2)  # => ["bar", 2]
+  #   a.last(50) # => [:foo, "bar", 2]
+  #   a.last(0)  # => []
+  #   [].last(3) # => []
+  #
+  # Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+  def last n = unspecified = true
+    if Primitive.mandatory_only?
+      Primitive.attr! :leaf
+      Primitive.cexpr! %q{ ary_last(self) }
+    else
+      if unspecified
+        Primitive.cexpr! %q{ ary_last(self) }
+      else
+        Primitive.cexpr! %q{ ary_take_first_or_last_n(self, NUM2LONG(n), ARY_TAKE_LAST) }
+      end
+    end
+  end
+
+  # call-seq:
+  #   fetch_values(*indexes) -> new_array
+  #   fetch_values(*indexes) { |index| ... } -> new_array
+  #
+  # With no block given, returns a new array containing the elements of +self+
+  # at the offsets specified by +indexes+. Each of the +indexes+ must be an
+  # {integer-convertible object}[rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects]:
+  #
+  #    a = [:foo, :bar, :baz]
+  #    a.fetch_values(2, 0)   # => [:baz, :foo]
+  #    a.fetch_values(2.1, 0) # => [:baz, :foo]
+  #    a.fetch_values         # => []
+  #
+  # For a negative index, counts backwards from the end of the array:
+  #
+  #    a.fetch_values(-2, -1) # [:bar, :baz]
+  #
+  # When no block is given, raises an exception if any index is out of range.
+  #
+  # With a block given, for each index:
+  #
+  # - If the index is in range, uses an element of +self+ (as above).
+  # - Otherwise, calls the block with the index and uses the block's return value.
+  #
+  # Example:
+  #
+  #   a = [:foo, :bar, :baz]
+  #   a.fetch_values(1, 0, 42, 777) { |index| index.to_s }
+  #   # => [:bar, :foo, "42", "777"]
+  #
+  # Related: see {Methods for Fetching}[rdoc-ref:Array@Methods+for+Fetching].
+  def fetch_values(*indexes, &block)
+    indexes.map! { |i| fetch(i, &block) }
+    indexes
+  end
+
+  with_jit do
+    if Primitive.rb_builtin_basic_definition_p(:each)
+      undef :each
+
+      def each # :nodoc:
+        Primitive.attr! :inline_block, :c_trace, :without_interrupts
+
+        unless defined?(yield)
+          return Primitive.cexpr! 'SIZED_ENUMERATOR(self, 0, 0, ary_enum_length)'
+        end
+        i = 0
+        until Primitive.rb_jit_ary_at_end(i)
+          yield Primitive.rb_jit_ary_at(i)
+          i = Primitive.rb_jit_fixnum_inc(i)
+        end
+        self
+      end
+    end
+
+    if Primitive.rb_builtin_basic_definition_p(:map)
+      undef :map
+
+      def map # :nodoc:
+        Primitive.attr! :inline_block, :c_trace, :without_interrupts
+
+        unless defined?(yield)
+          return Primitive.cexpr! 'SIZED_ENUMERATOR(self, 0, 0, ary_enum_length)'
+        end
+
+        i = 0
+        result = Primitive.ary_sized_alloc
+        until Primitive.rb_jit_ary_at_end(i)
+          value = yield(Primitive.rb_jit_ary_at(i))
+          Primitive.rb_jit_ary_push(result, value)
+          i = Primitive.rb_jit_fixnum_inc(i)
+        end
+        result
+      end
+
+      if Primitive.rb_builtin_basic_definition_p(:collect)
+        undef :collect
+        alias collect map
+      end
+    end
+
+    if Primitive.rb_builtin_basic_definition_p(:select)
+      undef :select
+
+      def select # :nodoc:
+        Primitive.attr! :inline_block, :c_trace, :without_interrupts
+
+        unless defined?(yield)
+          return Primitive.cexpr! 'SIZED_ENUMERATOR(self, 0, 0, ary_enum_length)'
+        end
+
+        i = 0
+        result = Primitive.ary_sized_alloc
+        until Primitive.rb_jit_ary_at_end(i)
+          value = Primitive.rb_jit_ary_at(i)
+          if yield value
+            Primitive.rb_jit_ary_push(result, value)
+          end
+          i = Primitive.rb_jit_fixnum_inc(i)
+        end
+        result
+      end
+
+      if Primitive.rb_builtin_basic_definition_p(:filter)
+        undef :filter
+        alias filter select
+      end
+    end
+
+    if Primitive.rb_builtin_basic_definition_p(:find)
+      undef :find
+
+      def find(if_none_proc = nil) # :nodoc:
+        Primitive.attr! :inline_block, :c_trace, :without_interrupts
+
+        unless defined?(yield)
+          return Primitive.cexpr! 'SIZED_ENUMERATOR(self, 0, 0, ary_enum_length)'
+        end
+        i = 0
+        until Primitive.rb_jit_ary_at_end(i)
+          value = Primitive.rb_jit_ary_at(i)
+          return value if yield(value)
+          i = Primitive.rb_jit_fixnum_inc(i)
+        end
+        if_none_proc&.call
+      end
+    end
+  end
+end
diff --git a/ast.c b/ast.c
new file mode 100644
index 0000000000..1ddc2b5791
--- /dev/null
+++ b/ast.c
@@ -0,0 +1,1178 @@
+/* indent-tabs-mode: nil */
+#include "internal.h"
+#include "internal/ruby_parser.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;
+static VALUE rb_cLocation;
+
+struct ASTNodeData {
+    VALUE ast_value;
+    const NODE *node;
+};
+
+static void
+node_gc_mark(void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    rb_gc_mark(data->ast_value);
+}
+
+static size_t
+node_memsize(const void *ptr)
+{
+    struct ASTNodeData *data = (struct ASTNodeData *)ptr;
+    size_t size = sizeof(struct ASTNodeData);
+    if (data->ast_value) {
+        rb_ast_t *ast = rb_ruby_ast_data_get(data->ast_value);
+        size += rb_ast_memsize(ast);
+    }
+
+    return size;
+}
+
+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,
+};
+
+struct ASTLocationData {
+    int first_lineno;
+    int first_column;
+    int last_lineno;
+    int last_column;
+};
+
+static void
+location_gc_mark(void *ptr)
+{
+}
+
+static size_t
+location_memsize(const void *ptr)
+{
+    return sizeof(struct ASTLocationData);
+}
+
+static const rb_data_type_t rb_location_type = {
+    "AST/location",
+    {location_gc_mark, RUBY_TYPED_DEFAULT_FREE, location_memsize,},
+    0, 0,
+    RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+
+static VALUE rb_ast_node_alloc(VALUE klass);
+
+static void
+setup_node(VALUE obj, VALUE ast_value, const NODE *node)
+{
+    struct ASTNodeData *data;
+
+    TypedData_Get_Struct(obj, struct ASTNodeData, &rb_node_type, data);
+    data->ast_value = ast_value;
+    data->node = node;
+}
+
+static VALUE
+ast_new_internal(VALUE ast_value, const NODE *node)
+{
+    VALUE obj;
+
+    obj = rb_ast_node_alloc(rb_cNode);
+    setup_node(obj, ast_value, 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(VALUE ast_value)
+{
+    rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
+
+    if (!ast->body.root) {
+        rb_ast_dispose(ast);
+        rb_exc_raise(GET_EC()->errinfo);
+    }
+
+    return ast_new_internal(ast_value, (NODE *)ast->body.root);
+}
+
+static VALUE
+setup_vparser(VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE vparser = ast_parse_new();
+    if (RTEST(keep_script_lines)) rb_parser_set_script_lines(vparser);
+    if (RTEST(error_tolerant)) rb_parser_error_tolerant(vparser);
+    if (RTEST(keep_tokens)) rb_parser_keep_tokens(vparser);
+    return vparser;
+}
+
+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)
+{
+    VALUE ast_value = Qnil;
+    StringValue(str);
+    VALUE vparser = setup_vparser(keep_script_lines, error_tolerant, keep_tokens);
+    ast_value = rb_parser_compile_string_path(vparser, Qnil, str, 1);
+    return ast_parse_done(ast_value);
+}
+
+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;
+    VALUE ast_value = Qnil;
+    rb_encoding *enc = rb_utf8_encoding();
+
+    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 = setup_vparser(keep_script_lines, error_tolerant, keep_tokens);
+    ast_value = rb_parser_compile_file_path(vparser, Qnil, f, 1);
+    rb_io_close(f);
+    return ast_parse_done(ast_value);
+}
+
+static VALUE
+rb_ast_parse_array(VALUE array, VALUE keep_script_lines, VALUE error_tolerant, VALUE keep_tokens)
+{
+    VALUE ast_value = Qnil;
+
+    array = rb_check_array_type(array);
+    VALUE vparser = setup_vparser(keep_script_lines, error_tolerant, keep_tokens);
+    ast_value = rb_parser_compile_array(vparser, Qnil, array, 1);
+    return ast_parse_done(ast_value);
+}
+
+static VALUE node_children(VALUE, 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_value, 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
+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;
+    }
+
+    if (ISEQ_BODY(iseq)->prism) {
+        rb_raise(rb_eRuntimeError, "cannot get AST for ISEQ compiled by prism");
+    }
+
+    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)) {
+        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_value, node) (node ? ast_new_internal(ast_value, node) : Qnil)
+
+static VALUE
+rb_ary_new_from_node_args(VALUE ast_value, 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_value, node));
+    }
+    va_end(ar);
+    return ary;
+}
+
+static VALUE
+dump_block(VALUE ast_value, const struct RNode_BLOCK *node)
+{
+    VALUE ary = rb_ary_new();
+    do {
+        rb_ary_push(ary, NEW_CHILD(ast_value, node->nd_head));
+    } while (node->nd_next &&
+        nd_type_p(node->nd_next, NODE_BLOCK) &&
+        (node = RNODE_BLOCK(node->nd_next), 1));
+    if (node->nd_next) {
+        rb_ary_push(ary, NEW_CHILD(ast_value, node->nd_next));
+    }
+
+    return ary;
+}
+
+static VALUE
+dump_array(VALUE ast_value, const struct RNode_LIST *node)
+{
+    VALUE ary = rb_ary_new();
+    rb_ary_push(ary, NEW_CHILD(ast_value, node->nd_head));
+
+    while (node->nd_next && nd_type_p(node->nd_next, NODE_LIST)) {
+        node = RNODE_LIST(node->nd_next);
+        rb_ary_push(ary, NEW_CHILD(ast_value, node->nd_head));
+    }
+    rb_ary_push(ary, NEW_CHILD(ast_value, node->nd_next));
+
+    return ary;
+}
+
+static VALUE
+dump_parser_array(VALUE ast_value, rb_parser_ary_t *p_ary)
+{
+    VALUE ary;
+
+    if (p_ary->data_type != PARSER_ARY_DATA_NODE) {
+        rb_bug("unexpected rb_parser_ary_data_type: %d", p_ary->data_type);
+    }
+
+    ary = rb_ary_new();
+
+    for (long i = 0; i < p_ary->len; i++) {
+        rb_ary_push(ary, NEW_CHILD(ast_value, p_ary->data[i]));
+    }
+
+    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(VALUE ast_value, const NODE *rest_arg)
+{
+    return NODE_NAMED_REST_P(rest_arg) ? NEW_CHILD(ast_value, rest_arg) : no_name_rest();
+}
+
+static ID
+node_colon_name(const NODE *node)
+{
+    switch (nd_type(node)) {
+      case NODE_COLON2:
+        return RNODE_COLON2(node)->nd_mid;
+      case NODE_COLON3:
+        return RNODE_COLON3(node)->nd_mid;
+      default:
+        rb_bug("unexpected node: %s", ruby_node_name(nd_type(node)));
+    }
+}
+
+static VALUE
+node_children(VALUE ast_value, const NODE *node)
+{
+    char name[sizeof("$") + DECIMAL_SIZE_OF(long)];
+
+    enum node_type type = nd_type(node);
+    switch (type) {
+      case NODE_BLOCK:
+        return dump_block(ast_value, RNODE_BLOCK(node));
+      case NODE_IF:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_IF(node)->nd_cond, RNODE_IF(node)->nd_body, RNODE_IF(node)->nd_else);
+      case NODE_UNLESS:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_UNLESS(node)->nd_cond, RNODE_UNLESS(node)->nd_body, RNODE_UNLESS(node)->nd_else);
+      case NODE_CASE:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_CASE(node)->nd_head, RNODE_CASE(node)->nd_body);
+      case NODE_CASE2:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_CASE2(node)->nd_head, RNODE_CASE2(node)->nd_body);
+      case NODE_CASE3:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_CASE3(node)->nd_head, RNODE_CASE3(node)->nd_body);
+      case NODE_WHEN:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_WHEN(node)->nd_head, RNODE_WHEN(node)->nd_body, RNODE_WHEN(node)->nd_next);
+      case NODE_IN:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_IN(node)->nd_head, RNODE_IN(node)->nd_body, RNODE_IN(node)->nd_next);
+      case NODE_WHILE:
+      case NODE_UNTIL:
+        return rb_ary_push(rb_ary_new_from_node_args(ast_value, 2, RNODE_WHILE(node)->nd_cond, RNODE_WHILE(node)->nd_body),
+                           RBOOL(RNODE_WHILE(node)->nd_state));
+      case NODE_ITER:
+      case NODE_FOR:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_ITER(node)->nd_iter, RNODE_ITER(node)->nd_body);
+      case NODE_FOR_MASGN:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_FOR_MASGN(node)->nd_var);
+      case NODE_BREAK:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_BREAK(node)->nd_stts);
+      case NODE_NEXT:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_NEXT(node)->nd_stts);
+      case NODE_RETURN:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_RETURN(node)->nd_stts);
+      case NODE_REDO:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_RETRY:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_BEGIN:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_BEGIN(node)->nd_body);
+      case NODE_RESCUE:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_RESCUE(node)->nd_head, RNODE_RESCUE(node)->nd_resq, RNODE_RESCUE(node)->nd_else);
+      case NODE_RESBODY:
+        return rb_ary_new_from_node_args(ast_value, 4, RNODE_RESBODY(node)->nd_args, RNODE_RESBODY(node)->nd_exc_var, RNODE_RESBODY(node)->nd_body, RNODE_RESBODY(node)->nd_next);
+      case NODE_ENSURE:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_ENSURE(node)->nd_head, RNODE_ENSURE(node)->nd_ensr);
+      case NODE_AND:
+      case NODE_OR:
+        {
+            VALUE ary = rb_ary_new();
+
+            while (1) {
+                rb_ary_push(ary, NEW_CHILD(ast_value, RNODE_AND(node)->nd_1st));
+                if (!RNODE_AND(node)->nd_2nd || !nd_type_p(RNODE_AND(node)->nd_2nd, type))
+                    break;
+                node = RNODE_AND(node)->nd_2nd;
+            }
+            rb_ary_push(ary, NEW_CHILD(ast_value, RNODE_AND(node)->nd_2nd));
+            return ary;
+        }
+      case NODE_MASGN:
+        if (NODE_NAMED_REST_P(RNODE_MASGN(node)->nd_args)) {
+            return rb_ary_new_from_node_args(ast_value, 3, RNODE_MASGN(node)->nd_value, RNODE_MASGN(node)->nd_head, RNODE_MASGN(node)->nd_args);
+        }
+        else {
+            return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_MASGN(node)->nd_value),
+                                        NEW_CHILD(ast_value, RNODE_MASGN(node)->nd_head),
+                                        no_name_rest());
+        }
+      case NODE_LASGN:
+        if (NODE_REQUIRED_KEYWORD_P(RNODE_LASGN(node)->nd_value)) {
+            return rb_ary_new_from_args(2, var_name(RNODE_LASGN(node)->nd_vid), ID2SYM(rb_intern("NODE_SPECIAL_REQUIRED_KEYWORD")));
+        }
+        return rb_ary_new_from_args(2, var_name(RNODE_LASGN(node)->nd_vid), NEW_CHILD(ast_value, RNODE_LASGN(node)->nd_value));
+      case NODE_DASGN:
+        if (NODE_REQUIRED_KEYWORD_P(RNODE_DASGN(node)->nd_value)) {
+            return rb_ary_new_from_args(2, var_name(RNODE_DASGN(node)->nd_vid), ID2SYM(rb_intern("NODE_SPECIAL_REQUIRED_KEYWORD")));
+        }
+        return rb_ary_new_from_args(2, var_name(RNODE_DASGN(node)->nd_vid), NEW_CHILD(ast_value, RNODE_DASGN(node)->nd_value));
+      case NODE_IASGN:
+        return rb_ary_new_from_args(2, var_name(RNODE_IASGN(node)->nd_vid), NEW_CHILD(ast_value, RNODE_IASGN(node)->nd_value));
+      case NODE_CVASGN:
+        return rb_ary_new_from_args(2, var_name(RNODE_CVASGN(node)->nd_vid), NEW_CHILD(ast_value, RNODE_CVASGN(node)->nd_value));
+      case NODE_GASGN:
+        return rb_ary_new_from_args(2, var_name(RNODE_GASGN(node)->nd_vid), NEW_CHILD(ast_value, RNODE_GASGN(node)->nd_value));
+      case NODE_CDECL:
+        if (RNODE_CDECL(node)->nd_vid) {
+            return rb_ary_new_from_args(2, ID2SYM(RNODE_CDECL(node)->nd_vid), NEW_CHILD(ast_value, RNODE_CDECL(node)->nd_value));
+        }
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_CDECL(node)->nd_else), ID2SYM(node_colon_name(RNODE_CDECL(node)->nd_else)), NEW_CHILD(ast_value, RNODE_CDECL(node)->nd_value));
+      case NODE_OP_ASGN1:
+        return rb_ary_new_from_args(4, NEW_CHILD(ast_value, RNODE_OP_ASGN1(node)->nd_recv),
+                                    ID2SYM(RNODE_OP_ASGN1(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_OP_ASGN1(node)->nd_index),
+                                    NEW_CHILD(ast_value, RNODE_OP_ASGN1(node)->nd_rvalue));
+      case NODE_OP_ASGN2:
+        return rb_ary_new_from_args(5, NEW_CHILD(ast_value, RNODE_OP_ASGN2(node)->nd_recv),
+                                    RBOOL(RNODE_OP_ASGN2(node)->nd_aid),
+                                    ID2SYM(RNODE_OP_ASGN2(node)->nd_vid),
+                                    ID2SYM(RNODE_OP_ASGN2(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_OP_ASGN2(node)->nd_value));
+      case NODE_OP_ASGN_AND:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_OP_ASGN_AND(node)->nd_head), ID2SYM(idANDOP),
+                                    NEW_CHILD(ast_value, RNODE_OP_ASGN_AND(node)->nd_value));
+      case NODE_OP_ASGN_OR:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_OP_ASGN_OR(node)->nd_head), ID2SYM(idOROP),
+                                    NEW_CHILD(ast_value, RNODE_OP_ASGN_OR(node)->nd_value));
+      case NODE_OP_CDECL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_OP_CDECL(node)->nd_head),
+                                    ID2SYM(RNODE_OP_CDECL(node)->nd_aid),
+                                    NEW_CHILD(ast_value, RNODE_OP_CDECL(node)->nd_value));
+      case NODE_CALL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_CALL(node)->nd_recv),
+                                    ID2SYM(RNODE_CALL(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_CALL(node)->nd_args));
+      case NODE_OPCALL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_OPCALL(node)->nd_recv),
+                                    ID2SYM(RNODE_OPCALL(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_OPCALL(node)->nd_args));
+      case NODE_QCALL:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_QCALL(node)->nd_recv),
+                                    ID2SYM(RNODE_QCALL(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_QCALL(node)->nd_args));
+      case NODE_FCALL:
+        return rb_ary_new_from_args(2, ID2SYM(RNODE_FCALL(node)->nd_mid),
+                                    NEW_CHILD(ast_value, RNODE_FCALL(node)->nd_args));
+      case NODE_VCALL:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_VCALL(node)->nd_mid));
+      case NODE_SUPER:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_SUPER(node)->nd_args);
+      case NODE_ZSUPER:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_LIST:
+        return dump_array(ast_value, RNODE_LIST(node));
+      case NODE_ZLIST:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_HASH:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_HASH(node)->nd_head);
+      case NODE_YIELD:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_YIELD(node)->nd_head);
+      case NODE_LVAR:
+        return rb_ary_new_from_args(1, var_name(RNODE_LVAR(node)->nd_vid));
+      case NODE_DVAR:
+        return rb_ary_new_from_args(1, var_name(RNODE_DVAR(node)->nd_vid));
+      case NODE_IVAR:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_IVAR(node)->nd_vid));
+      case NODE_CONST:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_CONST(node)->nd_vid));
+      case NODE_CVAR:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_CVAR(node)->nd_vid));
+      case NODE_GVAR:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_GVAR(node)->nd_vid));
+      case NODE_NTH_REF:
+        snprintf(name, sizeof(name), "$%ld", RNODE_NTH_REF(node)->nd_nth);
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_BACK_REF:
+        name[0] = '$';
+        name[1] = (char)RNODE_BACK_REF(node)->nd_nth;
+        name[2] = '\0';
+        return rb_ary_new_from_args(1, ID2SYM(rb_intern(name)));
+      case NODE_MATCH:
+        return rb_ary_new_from_args(1, rb_node_regx_string_val(node));
+      case NODE_MATCH2:
+        if (RNODE_MATCH2(node)->nd_args) {
+            return rb_ary_new_from_node_args(ast_value, 3, RNODE_MATCH2(node)->nd_recv, RNODE_MATCH2(node)->nd_value, RNODE_MATCH2(node)->nd_args);
+        }
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_MATCH2(node)->nd_recv, RNODE_MATCH2(node)->nd_value);
+      case NODE_MATCH3:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_MATCH3(node)->nd_recv, RNODE_MATCH3(node)->nd_value);
+      case NODE_STR:
+      case NODE_XSTR:
+        return rb_ary_new_from_args(1, rb_node_str_string_val(node));
+      case NODE_INTEGER:
+        return rb_ary_new_from_args(1, rb_node_integer_literal_val(node));
+      case NODE_FLOAT:
+        return rb_ary_new_from_args(1, rb_node_float_literal_val(node));
+      case NODE_RATIONAL:
+        return rb_ary_new_from_args(1, rb_node_rational_literal_val(node));
+      case NODE_IMAGINARY:
+        return rb_ary_new_from_args(1, rb_node_imaginary_literal_val(node));
+      case NODE_REGX:
+        return rb_ary_new_from_args(1, rb_node_regx_string_val(node));
+      case NODE_ONCE:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_ONCE(node)->nd_body);
+      case NODE_DSTR:
+      case NODE_DXSTR:
+      case NODE_DREGX:
+      case NODE_DSYM:
+        {
+            struct RNode_LIST *n = RNODE_DSTR(node)->nd_next;
+            VALUE head = Qnil, next = Qnil;
+            if (n) {
+                head = NEW_CHILD(ast_value, n->nd_head);
+                next = NEW_CHILD(ast_value, n->nd_next);
+            }
+            return rb_ary_new_from_args(3, rb_node_dstr_string_val(node), head, next);
+        }
+      case NODE_SYM:
+        return rb_ary_new_from_args(1, rb_node_sym_string_val(node));
+      case NODE_EVSTR:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_EVSTR(node)->nd_body);
+      case NODE_ARGSCAT:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_ARGSCAT(node)->nd_head, RNODE_ARGSCAT(node)->nd_body);
+      case NODE_ARGSPUSH:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_ARGSPUSH(node)->nd_head, RNODE_ARGSPUSH(node)->nd_body);
+      case NODE_SPLAT:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_SPLAT(node)->nd_head);
+      case NODE_BLOCK_PASS:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_BLOCK_PASS(node)->nd_head, RNODE_BLOCK_PASS(node)->nd_body);
+      case NODE_DEFN:
+        return rb_ary_new_from_args(2, ID2SYM(RNODE_DEFN(node)->nd_mid), NEW_CHILD(ast_value, RNODE_DEFN(node)->nd_defn));
+      case NODE_DEFS:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_DEFS(node)->nd_recv), ID2SYM(RNODE_DEFS(node)->nd_mid), NEW_CHILD(ast_value, RNODE_DEFS(node)->nd_defn));
+      case NODE_ALIAS:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_ALIAS(node)->nd_1st, RNODE_ALIAS(node)->nd_2nd);
+      case NODE_VALIAS:
+        return rb_ary_new_from_args(2, ID2SYM(RNODE_VALIAS(node)->nd_alias), ID2SYM(RNODE_VALIAS(node)->nd_orig));
+      case NODE_UNDEF:
+        return rb_ary_new_from_args(1, dump_parser_array(ast_value, RNODE_UNDEF(node)->nd_undefs));
+      case NODE_CLASS:
+        return rb_ary_new_from_node_args(ast_value, 3, RNODE_CLASS(node)->nd_cpath, RNODE_CLASS(node)->nd_super, RNODE_CLASS(node)->nd_body);
+      case NODE_MODULE:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_MODULE(node)->nd_cpath, RNODE_MODULE(node)->nd_body);
+      case NODE_SCLASS:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_SCLASS(node)->nd_recv, RNODE_SCLASS(node)->nd_body);
+      case NODE_COLON2:
+        return rb_ary_new_from_args(2, NEW_CHILD(ast_value, RNODE_COLON2(node)->nd_head), ID2SYM(RNODE_COLON2(node)->nd_mid));
+      case NODE_COLON3:
+        return rb_ary_new_from_args(1, ID2SYM(RNODE_COLON3(node)->nd_mid));
+      case NODE_DOT2:
+      case NODE_DOT3:
+      case NODE_FLIP2:
+      case NODE_FLIP3:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_DOT2(node)->nd_beg, RNODE_DOT2(node)->nd_end);
+      case NODE_SELF:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_NIL:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_TRUE:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_FALSE:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_ERRINFO:
+        return rb_ary_new_from_node_args(ast_value, 0);
+      case NODE_DEFINED:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_DEFINED(node)->nd_head);
+      case NODE_POSTEXE:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_POSTEXE(node)->nd_body);
+      case NODE_ATTRASGN:
+        return rb_ary_new_from_args(3, NEW_CHILD(ast_value, RNODE_ATTRASGN(node)->nd_recv), ID2SYM(RNODE_ATTRASGN(node)->nd_mid), NEW_CHILD(ast_value, RNODE_ATTRASGN(node)->nd_args));
+      case NODE_LAMBDA:
+        return rb_ary_new_from_node_args(ast_value, 1, RNODE_LAMBDA(node)->nd_body);
+      case NODE_OPT_ARG:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_OPT_ARG(node)->nd_body, RNODE_OPT_ARG(node)->nd_next);
+      case NODE_KW_ARG:
+        return rb_ary_new_from_node_args(ast_value, 2, RNODE_KW_ARG(node)->nd_body, RNODE_KW_ARG(node)->nd_next);
+      case NODE_POSTARG:
+        if (NODE_NAMED_REST_P(RNODE_POSTARG(node)->nd_1st)) {
+            return rb_ary_new_from_node_args(ast_value, 2, RNODE_POSTARG(node)->nd_1st, RNODE_POSTARG(node)->nd_2nd);
+        }
+        return rb_ary_new_from_args(2, no_name_rest(),
+                                    NEW_CHILD(ast_value, RNODE_POSTARG(node)->nd_2nd));
+      case NODE_ARGS:
+        {
+            struct rb_args_info *ainfo = &RNODE_ARGS(node)->nd_ainfo;
+            return rb_ary_new_from_args(10,
+                                        INT2NUM(ainfo->pre_args_num),
+                                        NEW_CHILD(ast_value, ainfo->pre_init),
+                                        NEW_CHILD(ast_value, (NODE *)ainfo->opt_args),
+                                        var_name(ainfo->first_post_arg),
+                                        INT2NUM(ainfo->post_args_num),
+                                        NEW_CHILD(ast_value, 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_value, (NODE *)ainfo->kw_args)),
+                                        (ainfo->no_kwarg ? Qfalse : NEW_CHILD(ast_value, ainfo->kw_rest_arg)),
+                                        (ainfo->no_blockarg ? Qfalse : var_name(ainfo->block_arg)));
+        }
+      case NODE_SCOPE:
+        {
+            rb_ast_id_table_t *tbl = RNODE_SCOPE(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_value, (NODE *)RNODE_SCOPE(node)->nd_args), NEW_CHILD(ast_value, RNODE_SCOPE(node)->nd_body));
+        }
+      case NODE_ARYPTN:
+        {
+            VALUE rest = rest_arg(ast_value, RNODE_ARYPTN(node)->rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast_value, RNODE_ARYPTN(node)->nd_pconst),
+                                        NEW_CHILD(ast_value, RNODE_ARYPTN(node)->pre_args),
+                                        rest,
+                                        NEW_CHILD(ast_value, RNODE_ARYPTN(node)->post_args));
+        }
+      case NODE_FNDPTN:
+        {
+            VALUE pre_rest = rest_arg(ast_value, RNODE_FNDPTN(node)->pre_rest_arg);
+            VALUE post_rest = rest_arg(ast_value, RNODE_FNDPTN(node)->post_rest_arg);
+            return rb_ary_new_from_args(4,
+                                        NEW_CHILD(ast_value, RNODE_FNDPTN(node)->nd_pconst),
+                                        pre_rest,
+                                        NEW_CHILD(ast_value, RNODE_FNDPTN(node)->args),
+                                        post_rest);
+        }
+      case NODE_HSHPTN:
+        {
+            VALUE kwrest = RNODE_HSHPTN(node)->nd_pkwrestarg == NODE_SPECIAL_NO_REST_KEYWORD ? ID2SYM(rb_intern("NODE_SPECIAL_NO_REST_KEYWORD")) :
+                                                                                 NEW_CHILD(ast_value, RNODE_HSHPTN(node)->nd_pkwrestarg);
+
+            return rb_ary_new_from_args(3,
+                                        NEW_CHILD(ast_value, RNODE_HSHPTN(node)->nd_pconst),
+                                        NEW_CHILD(ast_value, RNODE_HSHPTN(node)->nd_pkwargs),
+                                        kwrest);
+        }
+      case NODE_LINE:
+        return rb_ary_new_from_args(1, rb_node_line_lineno_val(node));
+      case NODE_FILE:
+        return rb_ary_new_from_args(1, rb_node_file_path_val(node));
+      case NODE_ENCODING:
+        return rb_ary_new_from_args(1, rb_node_encoding_val(node));
+      case NODE_ERROR:
+        return rb_ary_new_from_node_args(ast_value, 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_value, data->node);
+}
+
+static int
+null_loc_p(rb_code_location_t *loc)
+{
+    return (loc->beg_pos.lineno == 0 && loc->beg_pos.column == -1 && loc->end_pos.lineno == 0 && loc->end_pos.column == -1);
+}
+
+static VALUE
+location_new(rb_code_location_t *loc)
+{
+    VALUE obj;
+    struct ASTLocationData *data;
+
+    if (null_loc_p(loc)) return Qnil;
+
+    obj = TypedData_Make_Struct(rb_cLocation, struct ASTLocationData, &rb_location_type, data);
+    data->first_lineno = loc->beg_pos.lineno;
+    data->first_column = loc->beg_pos.column;
+    data->last_lineno = loc->end_pos.lineno;
+    data->last_column = loc->end_pos.column;
+
+    return obj;
+}
+
+static VALUE
+node_locations(VALUE ast_value, const NODE *node)
+{
+    enum node_type type = nd_type(node);
+    switch (type) {
+      case NODE_ALIAS:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_ALIAS(node)->keyword_loc));
+      case NODE_AND:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_AND(node)->operator_loc));
+      case NODE_BLOCK_PASS:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_BLOCK_PASS(node)->operator_loc));
+      case NODE_BREAK:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_BREAK(node)->keyword_loc));
+      case NODE_CASE:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_CASE(node)->case_keyword_loc),
+                                    location_new(&RNODE_CASE(node)->end_keyword_loc));
+      case NODE_CASE2:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_CASE2(node)->case_keyword_loc),
+                                    location_new(&RNODE_CASE2(node)->end_keyword_loc));
+      case NODE_CASE3:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_CASE3(node)->case_keyword_loc),
+                                    location_new(&RNODE_CASE3(node)->end_keyword_loc));
+      case NODE_CLASS:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_CLASS(node)->class_keyword_loc),
+                                    location_new(&RNODE_CLASS(node)->inheritance_operator_loc),
+                                    location_new(&RNODE_CLASS(node)->end_keyword_loc));
+      case NODE_COLON2:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_COLON2(node)->delimiter_loc),
+                                    location_new(&RNODE_COLON2(node)->name_loc));
+      case NODE_COLON3:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_COLON3(node)->delimiter_loc),
+                                    location_new(&RNODE_COLON3(node)->name_loc));
+      case NODE_DEFINED:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_DEFINED(node)->keyword_loc));
+      case NODE_DOT2:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_DOT2(node)->operator_loc));
+      case NODE_DOT3:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_DOT3(node)->operator_loc));
+      case NODE_EVSTR:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_EVSTR(node)->opening_loc),
+                                    location_new(&RNODE_EVSTR(node)->closing_loc));
+      case NODE_FLIP2:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_FLIP2(node)->operator_loc));
+      case NODE_FLIP3:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_FLIP3(node)->operator_loc));
+      case NODE_FOR:
+        return rb_ary_new_from_args(5,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_FOR(node)->for_keyword_loc),
+                                    location_new(&RNODE_FOR(node)->in_keyword_loc),
+                                    location_new(&RNODE_FOR(node)->do_keyword_loc),
+                                    location_new(&RNODE_FOR(node)->end_keyword_loc));
+      case NODE_LAMBDA:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_LAMBDA(node)->operator_loc),
+                                    location_new(&RNODE_LAMBDA(node)->opening_loc),
+                                    location_new(&RNODE_LAMBDA(node)->closing_loc));
+      case NODE_IF:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_IF(node)->if_keyword_loc),
+                                    location_new(&RNODE_IF(node)->then_keyword_loc),
+                                    location_new(&RNODE_IF(node)->end_keyword_loc));
+      case NODE_IN:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_IN(node)->in_keyword_loc),
+                                    location_new(&RNODE_IN(node)->then_keyword_loc),
+                                    location_new(&RNODE_IN(node)->operator_loc));
+      case NODE_MODULE:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_MODULE(node)->module_keyword_loc),
+                                    location_new(&RNODE_MODULE(node)->end_keyword_loc));
+      case NODE_NEXT:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_NEXT(node)->keyword_loc));
+      case NODE_OR:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_OR(node)->operator_loc));
+      case NODE_OP_ASGN1:
+        return rb_ary_new_from_args(5,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_OP_ASGN1(node)->call_operator_loc),
+                                    location_new(&RNODE_OP_ASGN1(node)->opening_loc),
+                                    location_new(&RNODE_OP_ASGN1(node)->closing_loc),
+                                    location_new(&RNODE_OP_ASGN1(node)->binary_operator_loc));
+      case NODE_OP_ASGN2:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_OP_ASGN2(node)->call_operator_loc),
+                                    location_new(&RNODE_OP_ASGN2(node)->message_loc),
+                                    location_new(&RNODE_OP_ASGN2(node)->binary_operator_loc));
+      case NODE_POSTEXE:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_POSTEXE(node)->keyword_loc),
+                                    location_new(&RNODE_POSTEXE(node)->opening_loc),
+                                    location_new(&RNODE_POSTEXE(node)->closing_loc));
+      case NODE_REDO:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_REDO(node)->keyword_loc));
+      case NODE_REGX:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_REGX(node)->opening_loc),
+                                    location_new(&RNODE_REGX(node)->content_loc),
+                                    location_new(&RNODE_REGX(node)->closing_loc));
+      case NODE_RETURN:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_RETURN(node)->keyword_loc));
+
+      case NODE_SCLASS:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_SCLASS(node)->class_keyword_loc),
+                                    location_new(&RNODE_SCLASS(node)->operator_loc),
+                                    location_new(&RNODE_SCLASS(node)->end_keyword_loc));
+
+      case NODE_SPLAT:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_SPLAT(node)->operator_loc));
+      case NODE_SUPER:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_SUPER(node)->keyword_loc),
+                                    location_new(&RNODE_SUPER(node)->lparen_loc),
+                                    location_new(&RNODE_SUPER(node)->rparen_loc));
+      case NODE_UNDEF:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_UNDEF(node)->keyword_loc));
+      case NODE_UNLESS:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_UNLESS(node)->keyword_loc),
+                                    location_new(&RNODE_UNLESS(node)->then_keyword_loc),
+                                    location_new(&RNODE_UNLESS(node)->end_keyword_loc));
+      case NODE_VALIAS:
+        return rb_ary_new_from_args(2,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_VALIAS(node)->keyword_loc));
+      case NODE_WHEN:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_WHEN(node)->keyword_loc),
+                                    location_new(&RNODE_WHEN(node)->then_keyword_loc));
+      case NODE_WHILE:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_WHILE(node)->keyword_loc),
+                                    location_new(&RNODE_WHILE(node)->closing_loc));
+      case NODE_UNTIL:
+        return rb_ary_new_from_args(3,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_UNTIL(node)->keyword_loc),
+                                    location_new(&RNODE_UNTIL(node)->closing_loc));
+      case NODE_YIELD:
+        return rb_ary_new_from_args(4,
+                                    location_new(nd_code_loc(node)),
+                                    location_new(&RNODE_YIELD(node)->keyword_loc),
+                                    location_new(&RNODE_YIELD(node)->lparen_loc),
+                                    location_new(&RNODE_YIELD(node)->rparen_loc));
+      case NODE_ARGS_AUX:
+      case NODE_LAST:
+        break;
+      default:
+        return rb_ary_new_from_args(1, location_new(nd_code_loc(node)));
+    }
+
+    rb_bug("node_locations: unknown node: %s", ruby_node_name(type));
+}
+
+static VALUE
+ast_node_locations(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTNodeData *data;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+
+    return node_locations(data->ast_value, 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)
+{
+    long i;
+    struct ASTNodeData *data;
+    rb_ast_t *ast;
+    rb_parser_ary_t *parser_tokens;
+    rb_parser_ast_token_t *parser_token;
+    VALUE str, loc, token, all_tokens;
+
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+    ast = rb_ruby_ast_data_get(data->ast_value);
+
+    parser_tokens = ast->node_buffer->tokens;
+    if (parser_tokens == NULL) {
+        return Qnil;
+    }
+
+    all_tokens = rb_ary_new2(parser_tokens->len);
+    for (i = 0; i < parser_tokens->len; i++) {
+        parser_token = parser_tokens->data[i];
+        str = rb_str_new(parser_token->str->ptr, parser_token->str->len);
+        loc = rb_ary_new_from_args(4,
+            INT2FIX(parser_token->loc.beg_pos.lineno),
+            INT2FIX(parser_token->loc.beg_pos.column),
+            INT2FIX(parser_token->loc.end_pos.lineno),
+            INT2FIX(parser_token->loc.end_pos.column)
+        );
+        token = rb_ary_new_from_args(4, INT2FIX(parser_token->id), ID2SYM(rb_intern(parser_token->type_name)), str, loc);
+        rb_ary_push(all_tokens, token);
+    }
+    rb_ary_freeze(all_tokens);
+
+    return all_tokens;
+}
+
+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;
+    rb_ast_t *ast;
+    TypedData_Get_Struct(self, struct ASTNodeData, &rb_node_type, data);
+    ast = rb_ruby_ast_data_get(data->ast_value);
+    rb_parser_ary_t *ret = ast->body.script_lines;
+    return rb_parser_build_script_lines_from(ret);
+}
+
+static VALUE
+ast_location_first_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTLocationData *data;
+    TypedData_Get_Struct(self, struct ASTLocationData, &rb_location_type, data);
+
+    return INT2NUM(data->first_lineno);
+}
+
+static VALUE
+ast_location_first_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTLocationData *data;
+    TypedData_Get_Struct(self, struct ASTLocationData, &rb_location_type, data);
+
+    return INT2NUM(data->first_column);
+}
+
+static VALUE
+ast_location_last_lineno(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTLocationData *data;
+    TypedData_Get_Struct(self, struct ASTLocationData, &rb_location_type, data);
+
+    return INT2NUM(data->last_lineno);
+}
+
+static VALUE
+ast_location_last_column(rb_execution_context_t *ec, VALUE self)
+{
+    struct ASTLocationData *data;
+    TypedData_Get_Struct(self, struct ASTLocationData, &rb_location_type, data);
+
+    return INT2NUM(data->last_column);
+}
+
+static VALUE
+ast_location_inspect(rb_execution_context_t *ec, VALUE self)
+{
+    VALUE str;
+    VALUE cname;
+    struct ASTLocationData *data;
+    TypedData_Get_Struct(self, struct ASTLocationData, &rb_location_type, data);
+
+    cname = rb_class_path(rb_obj_class(self));
+    str = rb_str_new2("#<");
+
+    rb_str_append(str, cname);
+    rb_str_catf(str, ":@%d:%d-%d:%d>",
+                data->first_lineno, data->first_column,
+                data->last_lineno, data->last_column);
+
+    return str;
+}
+
+#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_cLocation = rb_define_class_under(rb_mAST, "Location", rb_cObject);
+    rb_undef_alloc_func(rb_cNode);
+    rb_undef_alloc_func(rb_cLocation);
+}
diff --git a/ast.rb b/ast.rb
new file mode 100644
index 0000000000..6380621780
--- /dev/null
+++ b/ast.rb
@@ -0,0 +1,332 @@
+# 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 _prism_ gem, which is the official
+# Ruby API to parse Ruby code.
+#
+module RubyVM::AbstractSyntaxTree
+
+  #  call-seq:
+  #     RubyVM::AbstractSyntaxTree.parse(string, keep_script_lines: RubyVM.keep_script_lines, 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 expression.
+  #
+  def self.parse string, keep_script_lines: RubyVM.keep_script_lines, 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: RubyVM.keep_script_lines, 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: RubyVM.keep_script_lines, 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: RubyVM.keep_script_lines, error_tolerant: false, keep_tokens: false)   -> RubyVM::AbstractSyntaxTree::Node
+  #     RubyVM::AbstractSyntaxTree.of(method, keep_script_lines: RubyVM.keep_script_lines, 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: RubyVM.keep_script_lines, 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].byteslice(0...last_column)
+        lines[0] = lines[0].byteslice(first_column..-1)
+        lines.join
+      else
+        nil
+      end
+    end
+
+    #  call-seq:
+    #     node.locations -> array
+    #
+    #  Returns location objects associated with the AST node.
+    #  The returned array contains RubyVM::AbstractSyntaxTree::Location.
+    def locations
+      Primitive.ast_node_locations
+    end
+  end
+
+  # RubyVM::AbstractSyntaxTree::Location instances are created by
+  # RubyVM::AbstractSyntaxTree::Node#locations.
+  #
+  # This class is MRI specific.
+  #
+  class Location
+
+    #  call-seq:
+    #     location.first_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text began.
+    def first_lineno
+      Primitive.ast_location_first_lineno
+    end
+
+    #  call-seq:
+    #     location.first_column -> integer
+    #
+    #  The column number in the source code where this AST's text began.
+    def first_column
+      Primitive.ast_location_first_column
+    end
+
+    #  call-seq:
+    #     location.last_lineno -> integer
+    #
+    #  The line number in the source code where this AST's text ended.
+    def last_lineno
+      Primitive.ast_location_last_lineno
+    end
+
+    #  call-seq:
+    #     location.last_column -> integer
+    #
+    #  The column number in the source code where this AST's text ended.
+    def last_column
+      Primitive.ast_location_last_column
+    end
+
+    #  call-seq:
+    #     location.inspect -> string
+    #
+    #  Returns debugging information about this location as a string.
+    def inspect
+      Primitive.ast_location_inspect
+    end
+  end
+end
diff --git a/autogen.sh b/autogen.sh
new file mode 100755
index 0000000000..6cbc5dddab
--- /dev/null
+++ b/autogen.sh
@@ -0,0 +1,22 @@
+#!/bin/sh
+
+# Clear PWD to force commands to recompute working directory
+PWD=
+
+# Figure out the source directory for this script
+# configure.ac should be in the same place
+case "$0" in
+    */* )  srcdir=`dirname "$0"` ;; # Called with path
+    *   )  srcdir="";; # Otherwise
+esac
+
+# If install-only is explicitly requested, disable symlink flags
+case " $* " in
+    *" -i "* | *" --install"* ) symlink_flags="" ;;
+    *                         ) symlink_flags="--install --symlink" ;;
+esac
+
+exec ${AUTORECONF:-autoreconf} \
+     $symlink_flags \
+     "$@" \
+     $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..711e4f4ab3
--- /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".dup.upcase![0] == ?A)
+test_ok("A".dup.downcase![0] == ?a)
+test_ok("abc".dup.tr!("a-z", "A-Z") == "ABC")
+test_ok("aabbcccc".dup.tr_s!("a-z", "A-Z") == "ABC")
+test_ok("abcc".dup.squeeze!("a-z") == "abc")
+test_ok("abcd".dup.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..9f9192685e
--- /dev/null
+++ b/benchmark/README.md
@@ -0,0 +1,75 @@
+# 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
+benchmark-driver --help
+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 visibility (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/app_answer.rb b/benchmark/app_answer.rb
new file mode 100644
index 0000000000..3cd8a8fd37
--- /dev/null
+++ b/benchmark/app_answer.rb
@@ -0,0 +1,15 @@
+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
+
+def the_answer_to_life_the_universe_and_everything
+  (ack(3,7).to_s.split(//).inject(0){|s,x| s+x.to_i}.to_s + "2" ).to_i
+end
+
+answer = the_answer_to_life_the_universe_and_everything
diff --git a/benchmark/app_aobench.rb b/benchmark/app_aobench.rb
new file mode 100644
index 0000000000..c1546e08ab
--- /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 orthoBasis(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
+    orthoBasis(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/app_factorial.rb b/benchmark/app_factorial.rb
new file mode 100644
index 0000000000..45f471dfdb
--- /dev/null
+++ b/benchmark/app_factorial.rb
@@ -0,0 +1,11 @@
+def fact(n)
+  if(n > 1)
+    n * fact(n-1)
+  else
+    1
+  end
+end
+
+100.times {
+  fact(5000)
+}
diff --git a/benchmark/app_fib.rb b/benchmark/app_fib.rb
new file mode 100644
index 0000000000..e61bc8aa32
--- /dev/null
+++ b/benchmark/app_fib.rb
@@ -0,0 +1,10 @@
+def fib(n)
+  if n < 3
+    1
+  else
+    fib(n-1) + fib(n-2)
+  end
+end
+
+fib(34)
+
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/app_mandelbrot.rb b/benchmark/app_mandelbrot.rb
new file mode 100644
index 0000000000..801b75e8e2
--- /dev/null
+++ b/benchmark/app_mandelbrot.rb
@@ -0,0 +1,23 @@
+require 'complex'
+
+def mandelbrot? z
+  i = 0
+  while i<100
+    i += 1
+    z = z * z
+    return false if z.abs > 2
+  end
+  true
+end
+
+ary = []
+
+(0..1000).each{|dx|
+  (0..1000).each{|dy|
+    x = dx / 50.0
+    y = dy / 50.0
+    c = Complex(x, y)
+    ary << c if mandelbrot?(c)
+  }
+}
+
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/app_raise.rb b/benchmark/app_raise.rb
new file mode 100644
index 0000000000..5db8f95d50
--- /dev/null
+++ b/benchmark/app_raise.rb
@@ -0,0 +1,8 @@
+i = 0
+while i<300000
+  i += 1
+  begin
+    raise
+  rescue
+  end
+end
diff --git a/benchmark/app_strconcat.rb b/benchmark/app_strconcat.rb
new file mode 100644
index 0000000000..7eed7c1aed
--- /dev/null
+++ b/benchmark/app_strconcat.rb
@@ -0,0 +1,5 @@
+i = 0
+while i<2_000_000
+  "#{1+1} #{1+1} #{1+1}"
+  i += 1
+end
diff --git a/benchmark/app_tak.rb b/benchmark/app_tak.rb
new file mode 100644
index 0000000000..efe5380f4e
--- /dev/null
+++ b/benchmark/app_tak.rb
@@ -0,0 +1,13 @@
+
+def tak x, y, z
+  unless y < x
+    z
+  else
+    tak( tak(x-1, y, z),
+         tak(y-1, z, x),
+         tak(z-1, x, y))
+  end
+end
+
+tak(18, 9, 0)
+
diff --git a/benchmark/app_tarai.rb b/benchmark/app_tarai.rb
new file mode 100644
index 0000000000..4c146f5ccf
--- /dev/null
+++ b/benchmark/app_tarai.rb
@@ -0,0 +1,10 @@
+def tarai( x, y, z )
+  if x <= y
+  then y
+  else tarai(tarai(x-1, y, z),
+             tarai(y-1, z, x),
+             tarai(z-1, x, y))
+  end
+end
+
+tarai(12, 6, 0)
diff --git a/benchmark/app_uri.rb b/benchmark/app_uri.rb
new file mode 100644
index 0000000000..586edfd5dc
--- /dev/null
+++ b/benchmark/app_uri.rb
@@ -0,0 +1,8 @@
+require 'uri'
+
+100_000.times{
+  uri = URI.parse('http://www.ruby-lang.org')
+  uri.scheme
+  uri.host
+  uri.port
+}
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_large_literal.yml b/benchmark/array_large_literal.yml
new file mode 100644
index 0000000000..423d68391f
--- /dev/null
+++ b/benchmark/array_large_literal.yml
@@ -0,0 +1,19 @@
+prelude: |
+  def def_array(size)
+    Object.class_eval(<<-END)
+      def array_#{size}
+        x = 1
+        [#{(['x'] * size).join(',')}]
+      end
+    END
+  end
+  def_array(100)
+  def_array(1000)
+  def_array(10000)
+  def_array(100000)
+benchmark:
+  array_100: array_100
+  array_1000: array_1000
+  array_10000: array_10000
+  array_100000: array_100000
+
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/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/class_superclass.yml b/benchmark/class_superclass.yml
new file mode 100644
index 0000000000..847ff811f1
--- /dev/null
+++ b/benchmark/class_superclass.yml
@@ -0,0 +1,23 @@
+prelude: |
+  class SimpleClass; end
+  class OneModuleClass
+    1.times { include Module.new }
+  end
+  class MediumClass
+    10.times { include Module.new }
+  end
+  class LargeClass
+    100.times { include Module.new }
+  end
+benchmark:
+  object_class_superclass: |
+    Object.superclass
+  simple_class_superclass: |
+    SimpleClass.superclass
+  one_module_class: |
+    OneModuleClass.superclass
+  medium_class_superclass: |
+    MediumClass.superclass
+  large_class_superclass: |
+    LargeClass.superclass
+loop_count: 20000000
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/dir_pwd.yml b/benchmark/dir_pwd.yml
new file mode 100644
index 0000000000..c435d3ac5e
--- /dev/null
+++ b/benchmark/dir_pwd.yml
@@ -0,0 +1,2 @@
+benchmark:
+  pwd: Dir.pwd
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_sort_by.yml b/benchmark/enum_sort_by.yml
new file mode 100644
index 0000000000..d386353888
--- /dev/null
+++ b/benchmark/enum_sort_by.yml
@@ -0,0 +1,53 @@
+prelude: |
+  array_length = 2
+  fixnum_array2 = array_length.times.to_a.map {rand(10000)}
+  float_array2 = array_length.times.to_a.map {rand(10000.0).to_f}
+  string_array2 = array_length.times.to_a.map {"r" * rand(1..10000)}
+  mix_array2 = array_length.times.to_a.map {if rand(1..100) <= 50 then rand(1..10000).to_f else rand(1..10000) end}
+  all_zero_array2 =array_length.times.to_a.map {0}
+
+  array_length = 10
+  fixnum_array10 = array_length.times.to_a.map {rand(10000)}
+  float_array10 = array_length.times.to_a.map {rand(10000.0).to_f}
+  string_array10 = array_length.times.to_a.map {"r" * rand(1..10000)}
+  mix_array10 = array_length.times.to_a.map {if rand(1..100) <= 50 then rand(1..10000).to_f else rand(1..10000) end}
+  all_zero_array10 =array_length.times.to_a.map {0}
+
+  array_length = 1000
+  fixnum_array1000 = array_length.times.to_a.map {rand(10000)}
+  float_array1000 = array_length.times.to_a.map {rand(10000.0).to_f}
+  string_array1000 = array_length.times.to_a.map {"r" * rand(1..10000)}
+  mix_array1000 = array_length.times.to_a.map {if rand(1..100) <= 50 then rand(1..10000).to_f else rand(1..10000) end}
+  all_zero_array1000 =array_length.times.to_a.map {0}
+
+  array_length = 100000
+  fixnum_array100000 = array_length.times.to_a.map {rand(10000)}
+  float_array100000 = array_length.times.to_a.map {rand(10000.0).to_f}
+  string_array100000 = array_length.times.to_a.map {"r" * rand(1..10000)}
+  mix_array100000 = array_length.times.to_a.map {if rand(1..100) <= 50 then rand(1..10000).to_f else rand(1..10000) end}
+  all_zero_array100000 =array_length.times.to_a.map {0}
+
+benchmark:
+  fixnum_array2.sort_by: fixnum_array2.sort_by {|a| a}
+  float_array2.sort_by:  float_array2.sort_by {|a| a}
+  string_length2.sort_by: string_array2.sort_by {|a| a.length}
+  mix_array2.sort_by:  mix_array2.sort_by {|a| a}
+  all_zero2.sort_by: all_zero_array2.sort_by{|a| a}
+
+  fixnum_array10.sort_by: fixnum_array10.sort_by {|a| a}
+  float_array10.sort_by:  float_array10.sort_by {|a| a}
+  string_length10.sort_by: string_array10.sort_by {|a| a.length}
+  mix_array10.sort_by:  mix_array10.sort_by {|a| a}
+  all_zero10.sort_by: all_zero_array10.sort_by{|a| a}
+
+  fixnum_array1000.sort_by: fixnum_array1000.sort_by {|a| a}
+  float_array1000.sort_by:  float_array1000.sort_by {|a| a}
+  string_length1000.sort_by: string_array1000.sort_by {|a| a.length}
+  mix_array1000.sort_by:  mix_array1000.sort_by {|a| a}
+  all_zero1000.sort_by: all_zero_array1000.sort_by{|a| a}
+
+  fixnum_array100000.sort_by: fixnum_array100000.sort_by {|a| a}
+  float_array100000.sort_by:  float_array100000.sort_by {|a| a}
+  string_length100000.sort_by: string_array100000.sort_by {|a| a.length}
+  mix_array100000.sort_by:  mix_array100000.sort_by {|a| a}
+  all_zero100000.sort_by: all_zero_array100000.sort_by{|a| a}
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_basename.yml b/benchmark/file_basename.yml
new file mode 100644
index 0000000000..fbd78785aa
--- /dev/null
+++ b/benchmark/file_basename.yml
@@ -0,0 +1,6 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  long: File.basename("/Users/george/src/github.com/ruby/ruby/benchmark/file_dirname.yml")
+  long_name: File.basename("Users_george_src_github.com_ruby_ruby_benchmark_file_dirname.yml")
+  withext: File.basename("/Users/george/src/github.com/ruby/ruby/benchmark/file_dirname.yml", ".yml")
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_dirname.yml b/benchmark/file_dirname.yml
new file mode 100644
index 0000000000..43a81c9371
--- /dev/null
+++ b/benchmark/file_dirname.yml
@@ -0,0 +1,6 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  long: File.dirname("/Users/george/src/github.com/ruby/ruby/benchmark/file_dirname.yml")
+  short: File.dirname("foo/bar")
+  n_4: File.dirname("/Users/george/src/github.com/ruby/ruby/benchmark/file_dirname.yml", 4)
diff --git a/benchmark/file_expand_path.yml b/benchmark/file_expand_path.yml
new file mode 100644
index 0000000000..9e503ab003
--- /dev/null
+++ b/benchmark/file_expand_path.yml
@@ -0,0 +1,4 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  expand_path: File.expand_path("../../foo.txt", __FILE__)
diff --git a/benchmark/file_extname.yml b/benchmark/file_extname.yml
new file mode 100644
index 0000000000..fb16e55840
--- /dev/null
+++ b/benchmark/file_extname.yml
@@ -0,0 +1,6 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  long: File.extname("/Users/george/src/github.com/ruby/ruby/benchmark/file_dirname.yml")
+  long_name: File.extname("Users_george_src_github.com_ruby_ruby_benchmark_file_dirname.yml")
+  short: File.extname("foo/bar")
diff --git a/benchmark/file_join.yml b/benchmark/file_join.yml
new file mode 100644
index 0000000000..845257cf1e
--- /dev/null
+++ b/benchmark/file_join.yml
@@ -0,0 +1,7 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  two_strings: File.join(__FILE__, "path")
+  many_strings: File.join(__FILE__, "path", "a", "b", "c", "d")
+  array: File.join([__FILE__, "path", "a", "b", "c", "d"])
+  mixed: File.join(__FILE__, "path", "a", "b", ["c", "d"])
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_predicate.yml b/benchmark/float_predicate.yml
new file mode 100644
index 0000000000..b946937666
--- /dev/null
+++ b/benchmark/float_predicate.yml
@@ -0,0 +1,12 @@
+prelude: |
+  floats = [1.0, -1.0, 0.0, Float::NAN, Float::INFINITY, -Float::INFINITY]
+
+benchmark:
+  float_nan?: floats.each { |f| f.nan? }
+  float_finite?: floats.each { |f| f.finite? }
+  float_infinite?: floats.each { |f| f.infinite? }
+  float_zero?: floats.each { |f| f.zero? }
+  float_positive?: floats.each { |f| f.positive? }
+  float_negative?: floats.each { |f| f.negative? }
+
+loop_count: 1000000
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
new file mode 100644
index 0000000000..275f58b924
--- /dev/null
+++ b/benchmark/gc/aobench.rb
@@ -0,0 +1 @@
+require_relative '../app_aobench'
diff --git a/benchmark/gc/binary_trees.rb b/benchmark/gc/binary_trees.rb
new file mode 100644
index 0000000000..83347cdd20
--- /dev/null
+++ b/benchmark/gc/binary_trees.rb
@@ -0,0 +1 @@
+require_relative '../so_binary_trees'
diff --git a/benchmark/gc/gcbench.rb b/benchmark/gc/gcbench.rb
new file mode 100644
index 0000000000..23d0b91c6c
--- /dev/null
+++ b/benchmark/gc/gcbench.rb
@@ -0,0 +1,57 @@
+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)
+raise "#{script} not found" unless FileTest.exist?(script)
+
+puts "Script: #{script}"
+
+if $gcprof
+  GC::Profiler.enable
+end
+
+tms = Benchmark.measure{|x|
+  load script
+}
+
+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')
+
+puts
+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/hash1.rb b/benchmark/gc/hash1.rb
new file mode 100644
index 0000000000..cb030d458d
--- /dev/null
+++ b/benchmark/gc/hash1.rb
@@ -0,0 +1,11 @@
+value = 0.01
+h = {}
+n = 50_000
+
+1.upto(n){|i|
+  h["%020d" % i] = "v-#{i}"
+}
+
+(n * 1_000).times{
+  ''
+}
diff --git a/benchmark/gc/hash2.rb b/benchmark/gc/hash2.rb
new file mode 100644
index 0000000000..e8c943fb21
--- /dev/null
+++ b/benchmark/gc/hash2.rb
@@ -0,0 +1,7 @@
+value = 0.01
+h = {}
+n = 4*(10**6)
+
+1.upto(n){|i|
+  h["%020d" % i] = value * i
+}
diff --git a/benchmark/gc/null.rb b/benchmark/gc/null.rb
new file mode 100644
index 0000000000..c05a79f561
--- /dev/null
+++ b/benchmark/gc/null.rb
@@ -0,0 +1 @@
+# null
diff --git a/benchmark/gc/pentomino.rb b/benchmark/gc/pentomino.rb
new file mode 100644
index 0000000000..8ebdff7d1d
--- /dev/null
+++ b/benchmark/gc/pentomino.rb
@@ -0,0 +1 @@
+require_relative '../app_pentomino'
diff --git a/benchmark/gc/rdoc.rb b/benchmark/gc/rdoc.rb
new file mode 100644
index 0000000000..14c89f5611
--- /dev/null
+++ b/benchmark/gc/rdoc.rb
@@ -0,0 +1,13 @@
+require 'rdoc/rdoc'
+require 'tmpdir'
+
+srcdir = File.expand_path('../..', __dir__)
+
+Dir.mktmpdir('rdocbench-'){|d|
+  dir = File.join(d, 'rdocbench')
+  args = %W(--root #{srcdir} --page-dir #{srcdir}/doc --encoding=UTF-8 --no-force-update --all --ri --debug --quiet #{srcdir})
+  args << '--op' << dir
+
+  r = RDoc::RDoc.new
+  r.document args
+}
diff --git a/benchmark/gc/redblack.rb b/benchmark/gc/redblack.rb
new file mode 100644
index 0000000000..c66290140a
--- /dev/null
+++ b/benchmark/gc/redblack.rb
@@ -0,0 +1,366 @@
+# This benchmark is imported from https://github.com/jruby/rubybench/blob/master/time/bench_red_black.rb
+# License is License is Apache-2
+
+require 'benchmark'
+
+# Algorithm based on "Introduction to Algorithms" by Cormen and others
+class RedBlackTree
+  class Node
+    attr_accessor :color
+    attr_accessor :key
+    attr_accessor :left
+    attr_accessor :right
+    attr_accessor :parent
+
+    RED = :red
+    BLACK = :black
+    COLORS = [RED, BLACK].freeze
+
+    def initialize(key, color = RED)
+      raise ArgumentError, "Bad value for color parameter" unless COLORS.include?(color)
+      @color = color
+      @key = key
+      @left = @right = @parent = NilNode.instance
+    end
+
+    def black?
+      return color == BLACK
+    end
+
+    def red?
+      return color == RED
+    end
+  end
+
+  class NilNode < Node
+    class << self
+      private :new
+
+      # it's not thread safe
+      def instance
+        @instance ||= begin
+          def instance
+            return @instance
+          end
+
+          new
+        end
+      end
+    end
+
+    def initialize
+      self.color = BLACK
+      self.key = 0
+      self.left = nil
+      self.right = nil
+      self.parent = nil
+    end
+
+    def nil?
+      return true
+    end
+  end
+
+  include Enumerable
+
+  attr_accessor :root
+  attr_accessor :size
+
+  def initialize
+    self.root = NilNode.instance
+    self.size = 0
+  end
+
+  def add(key)
+    insert(Node.new(key))
+  end
+
+  def insert(x)
+    insert_helper(x)
+
+    x.color = Node::RED
+    while x != root && x.parent.color == Node::RED
+      if x.parent == x.parent.parent.left
+        y = x.parent.parent.right
+        if !y.nil? && y.color == Node::RED
+          x.parent.color = Node::BLACK
+          y.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          x = x.parent.parent
+        else
+          if x == x.parent.right
+            x = x.parent
+            left_rotate(x)
+          end
+          x.parent.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          right_rotate(x.parent.parent)
+        end
+      else
+        y = x.parent.parent.left
+        if !y.nil? && y.color == Node::RED
+          x.parent.color = Node::BLACK
+          y.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          x = x.parent.parent
+        else
+          if x == x.parent.left
+            x = x.parent
+            right_rotate(x)
+          end
+          x.parent.color = Node::BLACK
+          x.parent.parent.color = Node::RED
+          left_rotate(x.parent.parent)
+        end
+      end
+    end
+    root.color = Node::BLACK
+  end
+
+  alias << insert
+
+  def delete(z)
+    y = (z.left.nil? || z.right.nil?) ? z : successor(z)
+    x = y.left.nil? ? y.right : y.left
+    x.parent = y.parent
+
+    if y.parent.nil?
+      self.root = x
+    else
+      if y == y.parent.left
+        y.parent.left = x
+      else
+        y.parent.right = x
+      end
+    end
+
+    z.key = y.key if y != z
+
+    if y.color == Node::BLACK
+      delete_fixup(x)
+    end
+
+    self.size -= 1
+    return y
+  end
+
+  def minimum(x = root)
+    while !x.left.nil?
+      x = x.left
+    end
+    return x
+  end
+
+  def maximum(x = root)
+    while !x.right.nil?
+      x = x.right
+    end
+    return x
+  end
+
+  def successor(x)
+    if !x.right.nil?
+      return minimum(x.right)
+    end
+    y = x.parent
+    while !y.nil? && x == y.right
+      x = y
+      y = y.parent
+    end
+    return y
+  end
+
+  def predecessor(x)
+    if !x.left.nil?
+      return maximum(x.left)
+    end
+    y = x.parent
+    while !y.nil? && x == y.left
+      x = y
+      y = y.parent
+    end
+    return y
+  end
+
+  def inorder_walk(x = root)
+    x = self.minimum
+    while !x.nil?
+      yield x.key
+      x = successor(x)
+    end
+  end
+
+  alias each inorder_walk
+
+  def reverse_inorder_walk(x = root)
+    x = self.maximum
+    while !x.nil?
+      yield x.key
+      x = predecessor(x)
+    end
+  end
+
+  alias reverse_each reverse_inorder_walk
+
+  def search(key, x = root)
+    while !x.nil? && x.key != key
+      key < x.key ? x = x.left : x = x.right
+    end
+    return x
+  end
+
+  def empty?
+    return self.root.nil?
+  end
+
+  def black_height(x = root)
+    height = 0
+    while !x.nil?
+      x = x.left
+      height +=1 if x.nil? || x.black?
+    end
+    return height
+  end
+
+private
+
+  def left_rotate(x)
+    raise "x.right is nil!" if x.right.nil?
+    y = x.right
+    x.right = y.left
+    y.left.parent = x if !y.left.nil?
+    y.parent = x.parent
+    if x.parent.nil?
+      self.root = y
+    else
+      if x == x.parent.left
+        x.parent.left = y
+      else
+        x.parent.right = y
+      end
+    end
+    y.left = x
+    x.parent = y
+  end
+
+  def right_rotate(x)
+    raise "x.left is nil!" if x.left.nil?
+    y = x.left
+    x.left = y.right
+    y.right.parent = x if !y.right.nil?
+    y.parent = x.parent
+    if x.parent.nil?
+      self.root = y
+    else
+      if x == x.parent.left
+        x.parent.left = y
+      else
+        x.parent.right = y
+      end
+    end
+    y.right = x
+    x.parent = y
+  end
+
+  def insert_helper(z)
+    y = NilNode.instance
+    x = root
+    while !x.nil?
+      y = x
+      z.key < x.key ? x = x.left : x = x.right
+    end
+    z.parent = y
+    if y.nil?
+      self.root = z
+    else
+      z.key < y.key ? y.left = z : y.right = z
+    end
+    self.size += 1
+  end
+
+  def delete_fixup(x)
+    while x != root && x.color == Node::BLACK
+      if x == x.parent.left
+        w = x.parent.right
+        if w.color == Node::RED
+          w.color = Node::BLACK
+          x.parent.color = Node::RED
+          left_rotate(x.parent)
+          w = x.parent.right
+        end
+        if w.left.color == Node::BLACK && w.right.color == Node::BLACK
+          w.color = Node::RED
+          x = x.parent
+        else
+          if w.right.color == Node::BLACK
+            w.left.color = Node::BLACK
+            w.color = Node::RED
+            right_rotate(w)
+            w = x.parent.right
+          end
+          w.color = x.parent.color
+          x.parent.color = Node::BLACK
+          w.right.color = Node::BLACK
+          left_rotate(x.parent)
+          x = root
+        end
+      else
+        w = x.parent.left
+        if w.color == Node::RED
+          w.color = Node::BLACK
+          x.parent.color = Node::RED
+          right_rotate(x.parent)
+          w = x.parent.left
+        end
+        if w.right.color == Node::BLACK && w.left.color == Node::BLACK
+          w.color = Node::RED
+          x = x.parent
+        else
+          if w.left.color == Node::BLACK
+            w.right.color = Node::BLACK
+            w.color = Node::RED
+            left_rotate(w)
+            w = x.parent.left
+          end
+          w.color = x.parent.color
+          x.parent.color = Node::BLACK
+          w.left.color = Node::BLACK
+          right_rotate(x.parent)
+          x = root
+        end
+      end
+    end
+    x.color = Node::BLACK
+  end
+end
+
+def rbt_bm
+  n = 100_000
+  a1 = []; n.times { a1 << rand(999_999) }
+  a2 = []; n.times { a2 << rand(999_999) }
+
+  start = Time.now
+
+  tree = RedBlackTree.new
+
+  n.times {|i| tree.add(i) }
+  n.times { tree.delete(tree.root) }
+
+  tree = RedBlackTree.new
+  a1.each {|e| tree.add(e) }
+  a2.each {|e| tree.search(e) }
+  tree.inorder_walk {|key| key + 1 }
+  tree.reverse_inorder_walk {|key| key + 1 }
+  n.times { tree.minimum }
+  n.times { tree.maximum }
+
+  return Time.now - start
+end
+
+N = (ARGV[0] || 10).to_i
+
+N.times do
+  # puts rbt_bm.to_f
+  rbt_bm.to_f
+  # puts "GC.count = #{GC.count}" if GC.respond_to?(:count)
+end
diff --git a/benchmark/gc/ring.rb b/benchmark/gc/ring.rb
new file mode 100644
index 0000000000..be2c7b7250
--- /dev/null
+++ b/benchmark/gc/ring.rb
@@ -0,0 +1,29 @@
+# create many old objects
+
+max = 30_000_000
+
+class Ring
+  attr_reader :next_ring
+  def initialize n = nil
+    @next_ring = n
+  end
+
+
+  def size
+    s = 1
+    ring = self
+    while ring.next_ring
+      s += 1
+      ring = ring.next_ring
+    end
+    s
+  end
+end
+
+ring = Ring.new
+
+max.times{
+  ring = Ring.new(ring)
+}
+
+# p ring.size
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_str_lit.yml b/benchmark/hash_aref_str_lit.yml
new file mode 100644
index 0000000000..ed8142bcf1
--- /dev/null
+++ b/benchmark/hash_aref_str_lit.yml
@@ -0,0 +1,20 @@
+prelude: |
+  # frozen_string_literal: true
+  hash = 10.times.to_h do |i|
+    [i, i]
+  end
+  dyn_sym = "dynamic_symbol".to_sym
+  binary = RubyVM::InstructionSequence.compile("# frozen_string_literal: true\n'iseq_load'").to_binary
+  iseq_literal_string = RubyVM::InstructionSequence.load_from_binary(binary).eval
+
+  hash[:some_symbol] = 1
+  hash[dyn_sym] = 2
+  hash["small"] = 3
+  hash["frozen_string_literal"] = 4
+  hash[iseq_literal_string] = 5
+benchmark:
+  symbol: hash[:some_symbol]
+  dyn_symbol: hash[dyn_sym]
+  small_lit: hash["small"]
+  frozen_lit: hash["frozen_string_literal"]
+  iseq_lit: hash[iseq_literal_string]
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_key.yml b/benchmark/hash_key.yml
new file mode 100644
index 0000000000..cab4cf9ca4
--- /dev/null
+++ b/benchmark/hash_key.yml
@@ -0,0 +1,5 @@
+prelude: |
+  obj = Object.new
+  hash = { obj => true }
+benchmark: hash.key?(obj)
+loop_count: 30000000
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/hash_new.yml b/benchmark/hash_new.yml
new file mode 100644
index 0000000000..9d8e34187f
--- /dev/null
+++ b/benchmark/hash_new.yml
@@ -0,0 +1,16 @@
+prelude: |
+  has_hash_with_capa = Hash.instance_method(:initialize).parameters.include?([:key, :capacity])
+  strings_1k = 1_000.times.map { |i| -i.to_s.freeze }
+  strings_100k = 100_000.times.map { |i| -i.to_s.freeze }
+benchmark:
+  new: Hash.new
+  new_with_capa_1k: |
+    h = has_hash_with_capa ? Hash.new(capacity: strings_1k.size) : {}
+    strings_1k.each do |x|
+      h[x] = true
+    end
+  new_with_capa_100k: |
+    h = has_hash_with_capa ? Hash.new(capacity: strings_100k.size) : {}
+    strings_100k.each do |x|
+      h[x] = true
+    end
diff --git a/benchmark/hash_shift.rb b/benchmark/hash_shift.rb
new file mode 100644
index 0000000000..a645671a5b
--- /dev/null
+++ b/benchmark/hash_shift.rb
@@ -0,0 +1,10 @@
+h = {}
+
+10000.times do |i|
+  h[i] = nil
+end
+
+50000.times do
+  k, v = h.shift
+  h[k] = v
+end
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/int_to_s.yml b/benchmark/int_to_s.yml
new file mode 100644
index 0000000000..000dae9612
--- /dev/null
+++ b/benchmark/int_to_s.yml
@@ -0,0 +1,25 @@
+prelude: |
+  # frozen_string_literal: true
+  N1   = 5
+  N2   = 42
+  N3   = 400
+  N5   = 12345
+  N10  = 1_234_567_890
+  N19  = 4_611_686_018_427_387_903
+  NEG  = -1_234_567_890
+  BIG20  = 10 ** 19 + 12_345_678_901_234_567
+  BIG40  = 10 ** 39 + 123_456_789_012_345
+  BIG100 = 10 ** 99 + 42
+benchmark:
+  fix_1digit:   "N1.to_s"
+  fix_2digit:   "N2.to_s"
+  fix_3digit:   "N3.to_s"
+  fix_5digit:   "N5.to_s"
+  fix_10digit:  "N10.to_s"
+  fix_19digit:  "N19.to_s"
+  fix_negative: "NEG.to_s"
+  big_20digit:  "BIG20.to_s"
+  big_40digit:  "BIG40.to_s"
+  big_100digit: "BIG100.to_s"
+  interp_id:    '"id=#{N10}"'
+  interp_mixed: '"a=#{N2},b=#{N5},c=#{N10}"'
diff --git a/benchmark/integer_predicate.yml b/benchmark/integer_predicate.yml
new file mode 100644
index 0000000000..7c05ff2587
--- /dev/null
+++ b/benchmark/integer_predicate.yml
@@ -0,0 +1,9 @@
+prelude: |
+  nums = (0..9).to_a
+
+benchmark:
+  integer_zero?: nums.each { |n| n.zero? }
+  integer_even?: nums.each { |n| n.even? }
+  integer_odd?: nums.each { |n| n.odd? }
+
+loop_count: 1000000
diff --git a/benchmark/io_close.yml b/benchmark/io_close.yml
new file mode 100644
index 0000000000..a552872884
--- /dev/null
+++ b/benchmark/io_close.yml
@@ -0,0 +1,13 @@
+prelude: |
+  ios = 1000.times.map do
+    100.times.map{IO.pipe}
+  end
+benchmark:
+  # Close IO
+  io_close: |
+    # Process each batch of ios per iteration of the benchmark.
+    ios.pop.each do |r, w|
+      r.close
+      w.close
+    end
+loop_count: 100
diff --git a/benchmark/io_close_contended.yml b/benchmark/io_close_contended.yml
new file mode 100644
index 0000000000..1d9e4e0d0f
--- /dev/null
+++ b/benchmark/io_close_contended.yml
@@ -0,0 +1,21 @@
+prelude: |
+  ios = 100.times.map do
+    10.times.map do
+      pipe = IO.pipe.tap do |r, w|
+        Thread.new do
+          r.read
+        rescue IOError
+          # Ignore
+        end
+      end
+    end
+  end
+benchmark:
+  # Close IO
+  io_close_contended: |
+    # Process each batch of ios per iteration of the benchmark.
+    ios.pop.each do |r, w|
+      r.close
+      w.close
+    end
+loop_count: 10
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/io_file_create.rb b/benchmark/io_file_create.rb
new file mode 100644
index 0000000000..2f205c1333
--- /dev/null
+++ b/benchmark/io_file_create.rb
@@ -0,0 +1,13 @@
+#
+# Create files
+#
+
+max = 200_000
+file = './tmpfile_of_bm_io_file_create'
+
+max.times{
+  f = open(file, 'w')
+  f.close#(true)
+}
+File.unlink(file)
+
diff --git a/benchmark/io_file_read.rb b/benchmark/io_file_read.rb
new file mode 100644
index 0000000000..b9e796ed30
--- /dev/null
+++ b/benchmark/io_file_read.rb
@@ -0,0 +1,15 @@
+#
+# Seek and Read file.
+#
+
+require 'tempfile'
+
+max = 200_000
+str = "Hello world!  " * 1000
+f = Tempfile.new('yarv-benchmark')
+f.write str
+
+max.times{
+  f.seek 0
+  f.read
+}
diff --git a/benchmark/io_file_write.rb b/benchmark/io_file_write.rb
new file mode 100644
index 0000000000..aa1be0e5fe
--- /dev/null
+++ b/benchmark/io_file_write.rb
@@ -0,0 +1,14 @@
+#
+# Seek and Write file.
+#
+
+require 'tempfile'
+
+max = 200_000
+str = "Hello world!  " * 1000
+f = Tempfile.new('yarv-benchmark')
+
+max.times{
+  f.seek 0
+  f.write str
+}
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/io_select.rb b/benchmark/io_select.rb
new file mode 100644
index 0000000000..19248daeb1
--- /dev/null
+++ b/benchmark/io_select.rb
@@ -0,0 +1,9 @@
+# IO.select performance
+
+w = [ IO.pipe[1] ];
+
+nr = 1000000
+nr.times {
+  IO.select nil, w
+}
+
diff --git a/benchmark/io_select2.rb b/benchmark/io_select2.rb
new file mode 100644
index 0000000000..10e37d71b2
--- /dev/null
+++ b/benchmark/io_select2.rb
@@ -0,0 +1,22 @@
+# IO.select performance. worst case of single fd.
+
+ios = []
+nr = 1000000
+if defined?(Process::RLIMIT_NOFILE)
+  max = Process.getrlimit(Process::RLIMIT_NOFILE)[0]
+else
+  max = 64
+end
+puts "max fd: #{max} (results not apparent with <= 1024 max fd)"
+
+((max / 2) - 10).times do
+  ios.concat IO.pipe
+end
+
+last = [ ios[-1] ]
+puts "last IO: #{last[0].inspect}"
+
+nr.times do
+  IO.select nil, last
+end
+
diff --git a/benchmark/io_select3.rb b/benchmark/io_select3.rb
new file mode 100644
index 0000000000..7d0ba1f092
--- /dev/null
+++ b/benchmark/io_select3.rb
@@ -0,0 +1,21 @@
+# IO.select performance. a lot of fd
+
+ios = []
+nr = 100
+if defined?(Process::RLIMIT_NOFILE)
+  max = Process.getrlimit(Process::RLIMIT_NOFILE)[0]
+else
+  max = 64
+end
+puts "max fd: #{max} (results not apparent with <= 1024 max fd)"
+
+(max - 10).times do
+  r, w = IO.pipe
+  r.close
+  ios.push w
+end
+
+nr.times do
+  IO.select nil, ios
+end
+
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/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..fd9c2dd4db
--- /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!(&:value)
+
+<% 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/loop_each.yml b/benchmark/loop_each.yml
new file mode 100644
index 0000000000..1c757185a8
--- /dev/null
+++ b/benchmark/loop_each.yml
@@ -0,0 +1,4 @@
+prelude: |
+  arr = [nil] * 30_000_000
+benchmark:
+  loop_each: arr.each{|e|}
diff --git a/benchmark/loop_for.rb b/benchmark/loop_for.rb
new file mode 100644
index 0000000000..0fc4cc1511
--- /dev/null
+++ b/benchmark/loop_for.rb
@@ -0,0 +1,3 @@
+for i in 1..30_000_000
+  #
+end
diff --git a/benchmark/loop_generator.rb b/benchmark/loop_generator.rb
new file mode 100644
index 0000000000..6a3194b670
--- /dev/null
+++ b/benchmark/loop_generator.rb
@@ -0,0 +1,14 @@
+max = 6000000
+
+if defined? Fiber
+  gen = (1..max).each
+  loop do
+    gen.next
+  end
+else
+  require 'generator'
+  gen = Generator.new((0..max))
+  while gen.next?
+    gen.next
+  end
+end
diff --git a/benchmark/loop_times.rb b/benchmark/loop_times.rb
new file mode 100644
index 0000000000..521f72ad1a
--- /dev/null
+++ b/benchmark/loop_times.rb
@@ -0,0 +1 @@
+30_000_000.times{|e|}
diff --git a/benchmark/loop_times_megamorphic.yml b/benchmark/loop_times_megamorphic.yml
new file mode 100644
index 0000000000..f9343ba897
--- /dev/null
+++ b/benchmark/loop_times_megamorphic.yml
@@ -0,0 +1,7 @@
+prelude: |
+  eval(<<~EOS)
+    def loop_times_megamorphic
+      #{"1.times {|i|};" * 1000}
+    end
+  EOS
+benchmark: loop_times_megamorphic
diff --git a/benchmark/loop_whileloop.rb b/benchmark/loop_whileloop.rb
new file mode 100644
index 0000000000..0072822c06
--- /dev/null
+++ b/benchmark/loop_whileloop.rb
@@ -0,0 +1,4 @@
+i = 0
+while i<30_000_000 # benchmark loop 1
+  i += 1
+end
diff --git a/benchmark/loop_whileloop2.rb b/benchmark/loop_whileloop2.rb
new file mode 100644
index 0000000000..47d02dffc4
--- /dev/null
+++ b/benchmark/loop_whileloop2.rb
@@ -0,0 +1,4 @@
+i = 0
+while i< 6_000_000 # benchmark loop 2
+  i += 1
+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/module_eqq.yml b/benchmark/module_eqq.yml
new file mode 100644
index 0000000000..2f9c490d92
--- /dev/null
+++ b/benchmark/module_eqq.yml
@@ -0,0 +1,32 @@
+prelude: |
+  module SomeModule; end
+  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
+  simple_class_eqq_module: |
+    SimpleClass === HugeObj
+  module_eqq_module: |
+    SomeModule === HugeObj
+loop_count: 10000000
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..66234c4cdf
--- /dev/null
+++ b/benchmark/nilclass.yml
@@ -0,0 +1,16 @@
+prelude: |
+  def a = nil
+benchmark:
+  rationalize:
+    nil.rationalize
+  to_c: |
+    nil.to_c
+  to_i: |
+    nil.to_i
+  to_f: |
+    nil.to_f
+  to_r: |
+    nil.to_r
+  splat: |
+    a(*nil)
+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..c6269923f0
--- /dev/null
+++ b/benchmark/object_allocate.yml
@@ -0,0 +1,49 @@
+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
+  class OnePositional
+    def initialize a; end
+  end
+  class TwoPositional
+    def initialize a, b; end
+  end
+  class ThreePositional
+    def initialize a, b, c; end
+  end
+  class FourPositional
+    def initialize a, b, c, d; end
+  end
+  class KWArg
+    def initialize a:, b:, c:, d:
+    end
+  end
+  class Mixed
+    def initialize a, b, c:, d:
+    end
+  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
+  allocate_1_positional_params: OnePositional.new(1)
+  allocate_2_positional_params: TwoPositional.new(1, 2)
+  allocate_3_positional_params: ThreePositional.new(1, 2, 3)
+  allocate_4_positional_params: FourPositional.new(1, 2, 3, 4)
+  allocate_kwarg_params: "KWArg.new(a: 1, b: 2, c: 3, d: 4)"
+  allocate_mixed_params: "Mixed.new(1, 2, c: 3, d: 4)"
+  allocate_no_params: "Object.new"
+  allocate_allocate: "Object.allocate"
+loop_count: 100000
diff --git a/benchmark/object_class.yml b/benchmark/object_class.yml
new file mode 100644
index 0000000000..1e5409d1e2
--- /dev/null
+++ b/benchmark/object_class.yml
@@ -0,0 +1,40 @@
+prelude: |
+  def get_class(obj)
+    i = 10_000
+    while i > 0
+      i -= 1
+      # 100 times per loop
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+      obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class; obj.class;
+    end
+  end
+
+  class Obj
+  end
+  obj = Obj.new
+
+  singleton = Obj.new
+  def singleton.bar
+  end
+
+  extended = Obj.new
+  2.times do
+    extended.extend Module.new
+  end
+
+  immediate = 1.4
+benchmark:
+  obj: get_class(obj)
+  extended: get_class(extended)
+  singleton: get_class(singleton)
+  immediate: get_class(immediate)
+loop_count: 1000
diff --git a/benchmark/object_id.yml b/benchmark/object_id.yml
new file mode 100644
index 0000000000..2bd52b923f
--- /dev/null
+++ b/benchmark/object_id.yml
@@ -0,0 +1,4 @@
+benchmark:
+  baseline: "Object.new"
+  object_id: "Object.new.object_id"
+# 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/ack.pl b/benchmark/other-lang/ack.pl
new file mode 100644
index 0000000000..201e22ddfa
--- /dev/null
+++ b/benchmark/other-lang/ack.pl
@@ -0,0 +1,11 @@
+use integer;
+
+sub Ack {
+    return $_[0] ? ($_[1] ? Ack($_[0]-1, Ack($_[0], $_[1]-1))
+		    : Ack($_[0]-1, 1))
+	: $_[1]+1;
+}
+
+my $NUM = 9;
+$NUM = 1 if ($NUM < 1);
+my $ack = Ack(3, $NUM);
diff --git a/benchmark/other-lang/ack.py b/benchmark/other-lang/ack.py
new file mode 100644
index 0000000000..9968e7cfcf
--- /dev/null
+++ b/benchmark/other-lang/ack.py
@@ -0,0 +1,16 @@
+import sys
+sys.setrecursionlimit(5000000)
+
+def Ack(M, N):
+    if (not M):
+        return( N + 1 )
+    if (not N):
+        return( Ack(M-1, 1) )
+    return( Ack(M-1, Ack(M, N-1)) )
+
+def main():
+    NUM = 9
+    sys.setrecursionlimit(10000)
+    Ack(3, NUM)
+
+main()
diff --git a/benchmark/other-lang/ack.rb b/benchmark/other-lang/ack.rb
new file mode 100644
index 0000000000..7451bed6c4
--- /dev/null
+++ b/benchmark/other-lang/ack.rb
@@ -0,0 +1,12 @@
+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/other-lang/ack.scm b/benchmark/other-lang/ack.scm
new file mode 100644
index 0000000000..a80b73ba55
--- /dev/null
+++ b/benchmark/other-lang/ack.scm
@@ -0,0 +1,7 @@
+(define (ack m n)
+  (cond ((zero? m) (+ n 1))
+	((zero? n) (ack (- m 1) 1))
+	(else      (ack (- m 1) (ack m (- n 1))))))
+
+(ack 3 9)
+
diff --git a/benchmark/other-lang/eval.rb b/benchmark/other-lang/eval.rb
new file mode 100644
index 0000000000..48a2cea019
--- /dev/null
+++ b/benchmark/other-lang/eval.rb
@@ -0,0 +1,66 @@
+
+Bench = %w(
+  loop
+  ack
+  fib
+  tak
+  fact
+)
+
+Lang = <<EOP.map{|l| l.strip}
+  ruby-cyg
+  ../../../test6/miniruby
+  perl
+  python
+  gosh
+EOP
+
+Bench.replace ['loop2']
+Lang.replace ['ruby-cyg']
+
+Ext = %w(
+  .rb
+  .rb
+  .pl
+  .py
+  .scm
+)
+
+p Bench
+p Lang
+
+require 'benchmark'
+
+def bench cmd
+  m = Benchmark.measure{
+    #p cmd
+    system(cmd)
+  }
+  [m.utime, m.real]
+end
+
+Result = []
+Bench.each{|b|
+  r = []
+  Lang.each_with_index{|l, idx|
+    cmd = "#{l} #{b}#{Ext[idx]}"
+    r << bench(cmd)
+  }
+  Result << r
+}
+
+require 'pp'
+# utime
+puts Lang.join("\t")
+Bench.each_with_index{|b, bi|
+  print b, "\t"
+  puts Result[bi].map{|e| e[0]}.join("\t")
+}
+
+# rtime
+puts Lang.join("\t")
+Bench.each_with_index{|b, bi|
+  print b, "\t"
+  puts Result[bi].map{|e| e[1]}.join("\t")
+}
+
diff --git a/benchmark/other-lang/fact.pl b/benchmark/other-lang/fact.pl
new file mode 100644
index 0000000000..a9b0b69cdf
--- /dev/null
+++ b/benchmark/other-lang/fact.pl
@@ -0,0 +1,13 @@
+sub fact{
+  my $n = @_[0];
+  if($n < 2){
+    return 1;
+  }
+  else{
+    return $n * fact($n-1);
+  }
+}
+
+for($i=0; $i<10000; $i++){
+  &fact(100);
+}
diff --git a/benchmark/other-lang/fact.py b/benchmark/other-lang/fact.py
new file mode 100644
index 0000000000..1ce9f76275
--- /dev/null
+++ b/benchmark/other-lang/fact.py
@@ -0,0 +1,18 @@
+#import sys
+#sys.setrecursionlimit(1000)
+
+def factL(n):
+	r = 1
+	for x in range(2, n+1):
+		r *= x
+	return r
+
+def factR(n):
+	if n < 2:
+		return 1
+	else:
+		return n * factR(n-1)
+
+for i in range(10000):
+	factR(100)
+
diff --git a/benchmark/other-lang/fact.rb b/benchmark/other-lang/fact.rb
new file mode 100644
index 0000000000..6cedc752cd
--- /dev/null
+++ b/benchmark/other-lang/fact.rb
@@ -0,0 +1,13 @@
+def fact(n)
+  if n < 2
+    1
+  else
+    n * fact(n-1)
+  end
+end
+
+i = 0
+while i<10000
+  i += 1
+  fact(100)
+end
diff --git a/benchmark/other-lang/fact.scm b/benchmark/other-lang/fact.scm
new file mode 100644
index 0000000000..c98a7fedd3
--- /dev/null
+++ b/benchmark/other-lang/fact.scm
@@ -0,0 +1,8 @@
+(define (fact n)
+        (if (< n 2)
+            1
+          (* n (fact (- n 1)))))
+
+(dotimes (i 10000)
+  (fact 100))
+
diff --git a/benchmark/other-lang/fib.pl b/benchmark/other-lang/fib.pl
new file mode 100644
index 0000000000..a46f666d1e
--- /dev/null
+++ b/benchmark/other-lang/fib.pl
@@ -0,0 +1,11 @@
+sub fib{
+  my $n = $_[0];
+  if($n < 3){
+    return 1;
+  }
+  else{
+    return fib($n-1) + fib($n-2);
+  }
+};
+
+&fib(34);
diff --git a/benchmark/other-lang/fib.py b/benchmark/other-lang/fib.py
new file mode 100644
index 0000000000..45f2bceb8d
--- /dev/null
+++ b/benchmark/other-lang/fib.py
@@ -0,0 +1,7 @@
+def fib(n):
+  if n < 3:
+    return 1
+  else:
+    return fib(n-1) + fib(n-2)
+
+fib(34)
diff --git a/benchmark/other-lang/fib.rb b/benchmark/other-lang/fib.rb
new file mode 100644
index 0000000000..ec587eabe0
--- /dev/null
+++ b/benchmark/other-lang/fib.rb
@@ -0,0 +1,9 @@
+def fib n
+  if n < 3
+    1
+  else
+    fib(n-1) + fib(n-2)
+  end
+end
+
+fib(34)
diff --git a/benchmark/other-lang/fib.scm b/benchmark/other-lang/fib.scm
new file mode 100644
index 0000000000..2fc4e225bd
--- /dev/null
+++ b/benchmark/other-lang/fib.scm
@@ -0,0 +1,7 @@
+(define (fib n)
+        (if (< n 3)
+            1
+          (+ (fib (- n 1)) (fib (- n 2)))))
+
+(fib 34)
+
diff --git a/benchmark/other-lang/loop.pl b/benchmark/other-lang/loop.pl
new file mode 100644
index 0000000000..2777490aaa
--- /dev/null
+++ b/benchmark/other-lang/loop.pl
@@ -0,0 +1,3 @@
+for($i=0; $i<30000000; $i++){
+}
+
diff --git a/benchmark/other-lang/loop.py b/benchmark/other-lang/loop.py
new file mode 100644
index 0000000000..003749bf3a
--- /dev/null
+++ b/benchmark/other-lang/loop.py
@@ -0,0 +1,2 @@
+for i in xrange(30000000):
+	pass
diff --git a/benchmark/other-lang/loop.rb b/benchmark/other-lang/loop.rb
new file mode 100644
index 0000000000..b367b9dbf3
--- /dev/null
+++ b/benchmark/other-lang/loop.rb
@@ -0,0 +1,4 @@
+i = 0
+while i<30000000
+  i += 1
+end
diff --git a/benchmark/other-lang/loop.scm b/benchmark/other-lang/loop.scm
new file mode 100644
index 0000000000..3364f7e679
--- /dev/null
+++ b/benchmark/other-lang/loop.scm
@@ -0,0 +1 @@
+(dotimes (x 30000000))
diff --git a/benchmark/other-lang/loop2.rb b/benchmark/other-lang/loop2.rb
new file mode 100644
index 0000000000..df8fffc1ff
--- /dev/null
+++ b/benchmark/other-lang/loop2.rb
@@ -0,0 +1 @@
+30000000.times{}
diff --git a/benchmark/other-lang/tak.pl b/benchmark/other-lang/tak.pl
new file mode 100644
index 0000000000..7e748a67c6
--- /dev/null
+++ b/benchmark/other-lang/tak.pl
@@ -0,0 +1,11 @@
+sub tak {
+    local($x, $y, $z) = @_;
+    if (!($y < $x)) {
+	return $z;
+    } else {
+	return &tak(&tak($x - 1, $y, $z),
+		    &tak($y - 1, $z, $x),
+		    &tak($z - 1, $x, $y));
+    }
+}
+&tak(18, 9, 0);
diff --git a/benchmark/other-lang/tak.py b/benchmark/other-lang/tak.py
new file mode 100644
index 0000000000..04f3f6829c
--- /dev/null
+++ b/benchmark/other-lang/tak.py
@@ -0,0 +1,8 @@
+def tak(x, y, z):
+	if not(y<x):
+		return z
+	else:
+		return tak(tak(x-1, y, z),
+		           tak(y-1, z, x),
+		           tak(z-1, x, y))
+tak(18, 9, 0)
diff --git a/benchmark/other-lang/tak.rb b/benchmark/other-lang/tak.rb
new file mode 100644
index 0000000000..efe5380f4e
--- /dev/null
+++ b/benchmark/other-lang/tak.rb
@@ -0,0 +1,13 @@
+
+def tak x, y, z
+  unless y < x
+    z
+  else
+    tak( tak(x-1, y, z),
+         tak(y-1, z, x),
+         tak(z-1, x, y))
+  end
+end
+
+tak(18, 9, 0)
+
diff --git a/benchmark/other-lang/tak.scm b/benchmark/other-lang/tak.scm
new file mode 100644
index 0000000000..52a7629ee5
--- /dev/null
+++ b/benchmark/other-lang/tak.scm
@@ -0,0 +1,10 @@
+(define (tak x y z)
+        (if (not (< y x))
+            z
+          (tak (tak (- x 1) y z)
+               (tak (- y 1) z x)
+               (tak (- z 1) x y))))
+
+(tak 18 9 0)
+
+
diff --git a/benchmark/pathname.yml b/benchmark/pathname.yml
new file mode 100644
index 0000000000..bcf3011eab
--- /dev/null
+++ b/benchmark/pathname.yml
@@ -0,0 +1,15 @@
+prelude: |
+  abs = Pathname("/a")
+  rel = Pathname("a")
+  p1 = Pathname.new('foo/././././bar')
+  p2 = Pathname.new('foo/bar/./../..')
+  p3 = Pathname.new('foo/bar/zot')
+benchmark:
+  p1+p2: p1+p2
+  abs.root?: abs.root?
+  rel.root?: rel.root?
+  abs.absolute?: abs.absolute?
+  rel.absolute?: rel.absolute?
+  p1.cleanpath: p1.cleanpath
+  p2.cleanpath: p2.cleanpath
+  relative_path_from: p3.relative_path_from('foo/bar/qux/quax')
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/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/ractor_string_fstring.yml b/benchmark/ractor_string_fstring.yml
new file mode 100644
index 0000000000..14b92d8fd8
--- /dev/null
+++ b/benchmark/ractor_string_fstring.yml
@@ -0,0 +1,18 @@
+type: lib/benchmark_driver/runner/ractor
+benchmark:
+  ractor_fstring_random: |
+    i = 0
+    str = "same".dup
+    while i < 2000000
+      -(i.to_s.freeze)
+      i += 1
+    end
+  ractor_fstring_same: |
+    i = 0
+    str = "same".dup
+    while i < 2000000
+      -str
+      i += 1
+    end
+loop_count: 1
+ractor: 4
diff --git a/benchmark/range_bsearch_bignum.yml b/benchmark/range_bsearch_bignum.yml
new file mode 100644
index 0000000000..5730c93fcf
--- /dev/null
+++ b/benchmark/range_bsearch_bignum.yml
@@ -0,0 +1,10 @@
+prelude: |
+  first = 2**100
+  last = 2**1000
+  mid = (first + last) / 2
+  r = first..last
+
+benchmark:
+  first: r.bsearch { |x| x >= first }
+  mid: r.bsearch { |x| x >= mid }
+  last: r.bsearch { |x| x >= last }
diff --git a/benchmark/range_bsearch_endpointless.yml b/benchmark/range_bsearch_endpointless.yml
new file mode 100644
index 0000000000..8d7bedb662
--- /dev/null
+++ b/benchmark/range_bsearch_endpointless.yml
@@ -0,0 +1,21 @@
+prelude: |
+  re = (1..)
+  rb = (..0)
+
+benchmark:
+  'endless 10**0': re.bsearch { |x| x >= 1 }
+  'endless 10**1': re.bsearch { |x| x >= 10 }
+  'endless 10**2': re.bsearch { |x| x >= 100 }
+  'endless 10**3': re.bsearch { |x| x >= 1000 }
+  'endless 10**4': re.bsearch { |x| x >= 10000 }
+  'endless 10**5': re.bsearch { |x| x >= 100000 }
+  'endless 10**10': re.bsearch { |x| x >= 10000000000 }
+  'endless 10**100': re.bsearch { |x| x >= 10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 }
+  'beginless -10**0': rb.bsearch { |x| x >= -1 }
+  'beginless -10**1': rb.bsearch { |x| x >= -10 }
+  'beginless -10**2': rb.bsearch { |x| x >= -100 }
+  'beginless -10**3': rb.bsearch { |x| x >= -1000 }
+  'beginless -10**4': rb.bsearch { |x| x >= -10000 }
+  'beginless -10**5': rb.bsearch { |x| x >= -100000 }
+  'beginless -10**10': rb.bsearch { |x| x >= -10000000000 }
+  'beginless -10**100': rb.bsearch { |x| x >= -10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 }
diff --git a/benchmark/range_bsearch_fixnum.yml b/benchmark/range_bsearch_fixnum.yml
new file mode 100644
index 0000000000..59416531b9
--- /dev/null
+++ b/benchmark/range_bsearch_fixnum.yml
@@ -0,0 +1,10 @@
+prelude: |
+  first = 1
+  last = 10000
+  mid = (first + last) / 2
+  r = first..last
+
+benchmark:
+  first: r.bsearch { |x| x >= first }
+  mid: r.bsearch { |x| x >= mid }
+  last: r.bsearch { |x| x >= last }
diff --git a/benchmark/range_count.yml b/benchmark/range_count.yml
new file mode 100644
index 0000000000..58f53a0236
--- /dev/null
+++ b/benchmark/range_count.yml
@@ -0,0 +1,11 @@
+prelude: |
+  r_1 = 1..1
+  r_1k = 1..1000
+  r_1m = 1..1000000
+  r_str = 'a'..'z'
+
+benchmark:
+  'int 1': r_1.count
+  'int 1K': r_1k.count
+  'int 1M': r_1m.count
+  string: r_str.count
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/range_overlap.yml b/benchmark/range_overlap.yml
new file mode 100644
index 0000000000..700a00053c
--- /dev/null
+++ b/benchmark/range_overlap.yml
@@ -0,0 +1,19 @@
+prelude: |
+  class Range
+    unless method_defined?(:overlap?)
+      def overlap?(other)
+        other.begin == self.begin || cover?(other.begin) || other.cover?(self.begin)
+      end
+    end
+  end
+
+benchmark:
+  - (2..3).overlap?(1..1)
+  - (2..3).overlap?(2..4)
+  - (2..3).overlap?(4..5)
+  - (2..3).overlap?(2..1)
+  - (2..3).overlap?(0..1)
+  - (2..3).overlap?(...1)
+  - (2...3).overlap?(..2)
+  - (2...3).overlap?(3...)
+  - (2..3).overlap?('a'..'d')
diff --git a/benchmark/range_reverse_each.yml b/benchmark/range_reverse_each.yml
new file mode 100644
index 0000000000..a32efeccc6
--- /dev/null
+++ b/benchmark/range_reverse_each.yml
@@ -0,0 +1,16 @@
+prelude: |
+  rf_1 = 0..1
+  rf_1k = 0..1000
+  rf_1m = 0..1000000
+  big = 2**1000
+  rb_1 = big..big+1
+  rb_1k = big..big+1000
+  rb_1m = big..big+1000000
+
+benchmark:
+  "Fixnum 1": rf_1.reverse_each { _1 }
+  "Fixnum 1K": rf_1k.reverse_each { _1 }
+  "Fixnum 1M": rf_1m.reverse_each { _1 }
+  "Bignum 1": rb_1.reverse_each { _1 }
+  "Bignum 1K": rb_1k.reverse_each { _1 }
+  "Bignum 1M": rb_1m.reverse_each { _1 }
diff --git a/benchmark/realpath.yml b/benchmark/realpath.yml
new file mode 100644
index 0000000000..6b6a4836b0
--- /dev/null
+++ b/benchmark/realpath.yml
@@ -0,0 +1,33 @@
+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'
+teardown: |
+  require 'fileutils'
+  FileUtils.rm_rf('b')
+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/regexp_dup.yml b/benchmark/regexp_dup.yml
new file mode 100644
index 0000000000..52f89991cd
--- /dev/null
+++ b/benchmark/regexp_dup.yml
@@ -0,0 +1,6 @@
+prelude: |
+  str = "a" * 1000
+  re = Regexp.new(str)
+
+benchmark:
+  dup: re.dup
diff --git a/benchmark/regexp_new.yml b/benchmark/regexp_new.yml
new file mode 100644
index 0000000000..bc9ab3ca21
--- /dev/null
+++ b/benchmark/regexp_new.yml
@@ -0,0 +1,7 @@
+prelude: |
+  str = "a" * 1000
+  re = Regexp.new(str)
+
+benchmark:
+  string: Regexp.new(str)
+  regexp: Regexp.new(re)
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/scan.yaml b/benchmark/scan.yaml
new file mode 100644
index 0000000000..62ad1d6862
--- /dev/null
+++ b/benchmark/scan.yaml
@@ -0,0 +1,16 @@
+prelude: |
+  $LOAD_PATH.unshift(File.expand_path("lib"))
+  require "strscan"
+  str = "test string"
+  scanner = StringScanner.new(str)
+  str = "test"
+  reg = /test/
+benchmark:
+  check(reg): |
+    scanner.check(reg)
+  check(str): |
+    scanner.check(str)
+  match?(reg): |
+    scanner.match?(reg)
+  match?(str): |
+    scanner.match?(str)
diff --git a/benchmark/search.yaml b/benchmark/search.yaml
new file mode 100644
index 0000000000..42a50c90e6
--- /dev/null
+++ b/benchmark/search.yaml
@@ -0,0 +1,16 @@
+prelude: |
+  $LOAD_PATH.unshift(File.expand_path("lib"))
+  require "strscan"
+  str = "test string"
+  scanner = StringScanner.new(str)
+  str = "string"
+  reg = /string/
+benchmark:
+  check_until(reg): |
+    scanner.check_until(reg)
+  check_until(str): |
+    scanner.check_until(str)
+  exist?(reg): |
+    scanner.exist?(reg)
+  exist?(str): |
+    scanner.exist?(str)
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/set.yml b/benchmark/set.yml
new file mode 100644
index 0000000000..061509cb1f
--- /dev/null
+++ b/benchmark/set.yml
@@ -0,0 +1,261 @@
+prelude: |
+  # First 1000 digits of pi
+  pi = <<~END.gsub(/\D/, '')
+    31415926535897932384626433832795028841971693993751058209749445923078164062862089
+    98628034825342117067982148086513282306647093844609550582231725359408128481117450
+    28410270193852110555964462294895493038196442881097566593344612847564823378678316
+    52712019091456485669234603486104543266482133936072602491412737245870066063155881
+    74881520920962829254091715364367892590360011330530548820466521384146951941511609
+    43305727036575959195309218611738193261179310511854807446237996274956735188575272
+    48912279381830119491298336733624406566430860213949463952247371907021798609437027
+    70539217176293176752384674818467669405132000568127145263560827785771342757789609
+    17363717872146844090122495343014654958537105079227968925892354201995611212902196
+    08640344181598136297747713099605187072113499999983729780499510597317328160963185
+    95024459455346908302642522308253344685035261931188171010003137838752886587533208
+    38142061717766914730359825349042875546873115956286388235378759375195778185778053
+    21712268066130019278766111959092164201989380952572010654505906988788448549
+  END
+  array1 = 10.times.flat_map do |i|
+    pi[i...].chars.each_slice(10).map(&:join)
+  end
+  array2 = array1.map(&:reverse)
+  array1.map!(&:to_i)
+  array2.map!(&:to_i)
+  a1 = array1[...10]
+  a2 = array1[...100]
+  a3 = array1
+  oa1 = array2[...10]
+  oa2 = array2[...100]
+  oa3 = array2
+  s0 = Set.new
+  s0 = Set.new
+  s1 = Set.new(a1)
+  s2 = Set.new(a2)
+  s3 = Set.new(a3)
+  o0 = Set.new
+  o1 = Set.new(array2[...10])
+  o2 = Set.new(array2[...100])
+  o3 = Set.new(array2)
+  d0 = s0.dup
+  d1 = s1.dup
+  d2 = s2.dup
+  d3 = s3.dup
+  ss1 = s1 - a1[-1..-1]
+  ss2 = s2 - a2[-1..-1]
+  ss3 = s3 - a3[-1..-1]
+  os1 = o1 - oa1[-1..-1]
+  os2 = o2 - oa2[-1..-1]
+  os3 = o3 - oa3[-1..-1]
+  member = a1.first
+  cbi = s0.dup.compare_by_identity
+  ns = Set[s3, o3, d3]
+  set_subclass = Class.new(Set)
+
+benchmark:
+  new_0: Set.new
+  new_10: Set.new(a1)
+  new_100: Set.new(a2)
+  new_1000: Set.new(a3)
+  aref_0: Set[]
+  aref_10: Set[*a1]
+  aref_100: Set[*a2]
+  aref_1000: Set[*a3]
+  amp_0: s0 & o0
+  amp_10: s1 & o1
+  amp_100: s2 & o2
+  amp_1000: s3 & o3
+  amp_same_0: s0 & d0
+  amp_same_10: s1 & d1
+  amp_same_100: s2 & d2
+  amp_same_1000: s3 & d3
+  minus_0: s0 - o0
+  minus_10: s1 - o1
+  minus_100: s2 - o2
+  minus_1000: s3 - o3
+  minus_same_0: s0 - d0
+  minus_same_10: s1 - d1
+  minus_same_100: s2 - d2
+  minus_same_1000: s3 - d3
+  spaceship_0: s0 <=> o0
+  spaceship_diff_10: s1 <=> o1
+  spaceship_diff_100: s2 <=> o2
+  spaceship_diff_1000: s2 <=> o3
+  spaceship_sub_10: s1 <=> ss1
+  spaceship_sub_100: s2 <=> ss2
+  spaceship_sub_1000: s2 <=> ss3
+  spaceship_sup_10: ss1 <=> s1
+  spaceship_sup_100: ss2 <=> s2
+  spaceship_sup_1000: ss2 <=> s3
+  eq_0: s0 == o0
+  eq_10: s1 == o1
+  eq_100: s2 == o2
+  eq_1000: s3 == o3
+  eq_same_0: s0 == d0
+  eq_same_10: s1 == d1
+  eq_same_100: s2 == d2
+  eq_same_1000: s3 == d3
+  xor_0: s0 ^ o0
+  xor_10: s1 ^ o1
+  xor_100: s2 ^ o2
+  xor_1000: s3 ^ o3
+  xor_same_0: s0 ^ d0
+  xor_same_10: s1 ^ d1
+  xor_same_100: s2 ^ d2
+  xor_same_1000: s3 ^ d3
+  pipe_0: s0 | o0
+  pipe_10: s1 | o1
+  pipe_100: s2 | o2
+  pipe_1000: s3 | o3
+  pipe_same_0: s0 | d0
+  pipe_same_10: s1 | d1
+  pipe_same_100: s2 | d2
+  pipe_same_1000: s3 | d3
+  add: a3.each { s0.add(it) }
+  add_exist: a3.each { s3.add(it) }
+  addq: a3.each { s0.add?(it) }
+  addq_exist: a3.each { s3.add?(it) }
+  classify_0: s0.classify { it }
+  classify_10: s1.classify { it & 2 }
+  classify_100: s2.classify { it & 8 }
+  classify_1000: s3.classify { it & 32 }
+  clear: s0.clear
+  collect_0: s0.collect! { it }
+  collect_10: s1.collect! { it }
+  collect_100: s2.collect! { it }
+  collect_1000: s3.collect! { it }
+  compare_by_identity_0: s0.dup.compare_by_identity
+  compare_by_identity_10: s1.dup.compare_by_identity
+  compare_by_identity_100: s2.dup.compare_by_identity
+  compare_by_identity_1000: s3.dup.compare_by_identity
+  compare_by_identityq_false: s0.compare_by_identity?
+  compare_by_identityq_true: cbi.compare_by_identity?
+  clone_0: s0.clone
+  clone_10: s1.clone
+  clone_100: s2.clone
+  clone_1000: s3.clone
+  delete: a3.each { s3.delete(it) }
+  delete_not_exist: a3.each { o3.delete(it) }
+  deleteq: a3.each { s3.delete?(it) }
+  deleteq_not_exist: a3.each { o3.delete?(it) }
+  delete_if_0: s0.delete_if { it }
+  delete_if_10: s1.delete_if { it & 2 == 0 }
+  delete_if_100: s2.delete_if { it & 2 == 0 }
+  delete_if_1000: s3.delete_if { it & 2 == 0 }
+  disjoint_0: s0.disjoint? o0
+  disjoint_10: s1.disjoint? o1
+  disjoint_100: s2.disjoint? o2
+  disjoint_1000: s3.disjoint? o3
+  disjoint_same_0: s0.disjoint? d0
+  disjoint_same_10: s1.disjoint? d1
+  disjoint_same_100: s2.disjoint? d2
+  disjoint_same_1000: s3.disjoint? d3
+  divide_1arity_0: s0.divide { true }
+  divide_1arity_10: s1.divide { it & 2 }
+  divide_1arity_100: s2.divide { it & 8 }
+  divide_1arity_1000: s3.divide { it & 32 }
+  divide_2arity_0: s0.divide { true }
+  divide_2arity_10: s1.divide { (_1 & 2) == (_2 & 2) }
+  divide_2arity_100: s2.divide { (_1 & 8) == (_2 & 8) }
+  divide_2arity_1000: s3.divide { (_1 & 32) == (_2 & 32) }
+  dup_0: s0.dup
+  dup_10: s1.dup
+  dup_100: s2.dup
+  dup_1000: s3.dup
+  each_0: s0.each { it }
+  each_10: s1.each { it }
+  each_100: s2.each { it }
+  each_1000: s3.each { it }
+  empty_true: s0.empty?
+  empty_false: s3.empty?
+  flatten: ns.flatten
+  flattenb: ns.flatten!
+  include_true_0: s0.include? member
+  include_true_10: s1.include? member
+  include_true_100: s2.include? member
+  include_true_1000: s3.include? member
+  include_false_0: s0.include?(-1)
+  include_false_10: s1.include?(-1)
+  include_false_100: s2.include?(-1)
+  include_false_1000: s3.include?(-1)
+  intersect_0: s0.intersect? o0
+  intersect_10: s1.intersect? o1
+  intersect_100: s2.intersect? o2
+  intersect_1000: s3.intersect? o3
+  intersect_same_0: s0.intersect? d0
+  intersect_same_10: s1.intersect? d1
+  intersect_same_100: s2.intersect? d2
+  intersect_same_1000: s3.intersect? d3
+  join_0: s0.join
+  join_10: s1.join
+  join_100: s2.join
+  join_1000: s3.join
+  join_arg_0: s0.join ""
+  join_arg_10: s1.join ""
+  join_arg_100: s2.join ""
+  join_arg_1000: s3.join ""
+  keep_if_0: s0.keep_if { it }
+  keep_if_10: s1.keep_if { it & 2 == 0 }
+  keep_if_100: s2.keep_if { it & 2 == 0 }
+  keep_if_1000: s3.keep_if { it & 2 == 0 }
+  merge_set: s0.dup.merge(s3, o3)
+  merge_enum: s0.dup.merge(array1, array2)
+  proper_subset_0: s0.proper_subset? s0
+  proper_subset_10: s1.proper_subset? ss1
+  proper_subset_100: s2.proper_subset? ss2
+  proper_subset_1000: s3.proper_subset? ss3
+  proper_subset_false_10: s1.proper_subset? os1
+  proper_subset_false_100: s2.proper_subset? os2
+  proper_subset_false_1000: s3.proper_subset? os3
+  proper_superset_0: s0.proper_superset? s0
+  proper_superset_10: ss1.proper_superset? s1
+  proper_superset_100: ss2.proper_superset? s2
+  proper_superset_1000: ss3.proper_superset? s3
+  proper_superset_false_10: os1.proper_superset? s1
+  proper_superset_false_100: os2.proper_superset? s2
+  proper_superset_false_1000: os3.proper_superset? s3
+  reject_0: s0.reject! { it }
+  reject_10: s1.reject! { it & 2 == 0 }
+  reject_100: s2.reject! { it & 2 == 0 }
+  reject_1000: s3.reject! { it & 2 == 0 }
+  replace_0: s = Set.new; array1.each { s.replace(s0) }
+  replace_10: s = Set.new; array1.each { s.replace(s1) }
+  replace_100: s = Set.new; array1.each { s.replace(s2) }
+  replace_1000: s = Set.new; array1.each { s.replace(s3) }
+  reset_0: s0.reset
+  reset_10: s1.reset
+  reset_100: s2.reset
+  reset_1000: s3.reset
+  select_0: s0.select! { it }
+  select_10: s1.select! { it & 2 == 0 }
+  select_100: s2.select! { it & 2 == 0 }
+  select_1000: s3.select! { it & 2 == 0 }
+  size_0: s0.size
+  size_10: s1.size
+  size_100: s2.size
+  size_1000: s3.size
+  subtract_set: s3.dup.subtract(os3)
+  subtract_enum: s3.dup.subtract(oa3)
+  subtract_same_set: s3.dup.subtract(s3)
+  subtract_same_enum: s3.dup.subtract(a3)
+  subset_0: s0.subset? s0
+  subset_10: s1.subset? ss1
+  subset_100: s2.subset? ss2
+  subset_1000: s3.subset? ss3
+  subset_false_10: s1.subset? os1
+  subset_false_100: s2.subset? os2
+  subset_false_1000: s3.subset? os3
+  superset_0: s0.superset? s0
+  superset_10: ss1.superset? s1
+  superset_100: ss2.superset? s2
+  superset_1000: ss3.superset? s3
+  superset_false_10: os1.superset? s1
+  superset_false_100: os2.superset? s2
+  superset_false_1000: os3.superset? s3
+  to_a_0: s0.to_a
+  to_a_10: s1.to_a
+  to_a_100: s2.to_a
+  to_a_1000: s3.to_a
+  to_set_0: s0.to_set
+  to_set_10: s1.to_set
+  to_set_100: s2.to_set
+  to_set_1000: s3.to_set
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/so_binary_trees.rb b/benchmark/so_binary_trees.rb
new file mode 100644
index 0000000000..b1693e4109
--- /dev/null
+++ b/benchmark/so_binary_trees.rb
@@ -0,0 +1,62 @@
+# The Computer Language Shootout Benchmarks
+# http://shootout.alioth.debian.org
+#
+# contributed by Jesse Millikan
+
+# disable output
+alias puts_orig puts
+def puts str
+  # disable puts
+end
+
+def item_check(tree)
+ if tree[0] == nil
+  tree[1]
+ else
+  tree[1] + item_check(tree[0]) - item_check(tree[2])
+ end
+end
+
+def bottom_up_tree(item, depth)
+ if depth > 0
+  item_item = 2 * item
+  depth -= 1
+  [bottom_up_tree(item_item - 1, depth), item, bottom_up_tree(item_item, depth)]
+ else
+  [nil, item, nil]
+ end
+end
+
+max_depth = 16 # ARGV[0].to_i
+min_depth = 4
+
+max_depth = min_depth + 2 if min_depth + 2 > max_depth
+
+stretch_depth = max_depth + 1
+stretch_tree = bottom_up_tree(0, stretch_depth)
+
+puts "stretch tree of depth #{stretch_depth}\t check: #{item_check(stretch_tree)}"
+stretch_tree = nil
+
+long_lived_tree = bottom_up_tree(0, max_depth)
+
+min_depth.step(max_depth + 1, 2) do |depth|
+ iterations = 2**(max_depth - depth + min_depth)
+
+ check = 0
+
+ for i in 1..iterations
+  temp_tree = bottom_up_tree(i, depth)
+  check += item_check(temp_tree)
+
+  temp_tree = bottom_up_tree(-i, depth)
+  check += item_check(temp_tree)
+ end
+
+ puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
+end
+
+puts "long lived tree of depth #{max_depth}\t check: #{item_check(long_lived_tree)}"
+
+undef puts
+alias puts puts_orig
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..f7322a8541
--- /dev/null
+++ b/benchmark/so_count_words.yml
@@ -0,0 +1,66 @@
+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
+      }
+      File.write(wcinput, data)
+    end
+    at_exit {File.unlink(wcinput) rescue nil}
+  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
+
+    nl = nw = nc = 0
+    File.open(File.join(File.dirname($0), 'wc.input'), 'rb') do |input|
+      while tmp = input.read(4096)
+        data = tmp << (input.gets || "")
+        nc += data.length
+        nl += data.count("\n")
+        ((data.strip! || data).tr!("\n", " ") || data).squeeze!
+        nw += data.count(" ") + 1
+      end
+    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/so_fannkuch.rb b/benchmark/so_fannkuch.rb
new file mode 100644
index 0000000000..bac5ecd44c
--- /dev/null
+++ b/benchmark/so_fannkuch.rb
@@ -0,0 +1,45 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+# Contributed by Sokolov Yura
+# Modified by Ryan Williams
+
+def fannkuch(n)
+   maxFlips, m, r, check = 0, n-1, n, 0
+   count = (1..n).to_a
+   perm = (1..n).to_a
+
+   while true
+      if check < 30
+         puts "#{perm}"
+         check += 1
+      end
+
+      while r != 1
+         count[r-1] = r
+         r -= 1
+      end
+
+      if perm[0] != 1 and perm[m] != n
+         perml = perm.clone #.dup
+         flips = 0
+         while (k = perml.first ) != 1
+            perml = perml.slice!(0, k).reverse + perml
+            flips += 1
+         end
+         maxFlips = flips if flips > maxFlips
+      end
+      while true
+         if r==n then return maxFlips end
+         perm.insert r,perm.shift
+         break if (count[r] -= 1) > 0
+         r += 1
+      end
+   end
+end
+
+def puts *args
+end
+
+N = 9 # (ARGV[0] || 1).to_i
+puts "Pfannkuchen(#{N}) = #{fannkuch(N)}"
+
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/so_lists.rb b/benchmark/so_lists.rb
new file mode 100644
index 0000000000..e8f4a2a5f7
--- /dev/null
+++ b/benchmark/so_lists.rb
@@ -0,0 +1,47 @@
+#from http://www.bagley.org/~doug/shootout/bench/lists/lists.ruby
+
+NUM = 300
+SIZE = 10000
+
+def test_lists()
+  # create a list of integers (Li1) from 1 to SIZE
+  li1 = (1..SIZE).to_a
+  # copy the list to li2 (not by individual items)
+  li2 = li1.dup
+  # remove each individual item from left side of li2 and
+  # append to right side of li3 (preserving order)
+  li3 = Array.new
+  while (not li2.empty?)
+    li3.push(li2.shift)
+  end
+  # li2 must now be empty
+  # remove each individual item from right side of li3 and
+  # append to right side of li2 (reversing list)
+  while (not li3.empty?)
+    li2.push(li3.pop)
+  end
+  # li3 must now be empty
+  # reverse li1 in place
+  li1.reverse!
+  # check that first item is now SIZE
+  if li1[0] != SIZE then
+    p "not SIZE"
+    0
+  else
+    # compare li1 and li2 for equality
+    if li1 != li2 then
+      return(0)
+    else
+      # return the length of the list
+      li1.length
+    end
+  end
+end
+
+i = 0
+while i<NUM
+  i += 1
+  result = test_lists()
+end
+
+result
diff --git a/benchmark/so_mandelbrot.rb b/benchmark/so_mandelbrot.rb
new file mode 100644
index 0000000000..76331c64b8
--- /dev/null
+++ b/benchmark/so_mandelbrot.rb
@@ -0,0 +1,57 @@
+#  The Computer Language Benchmarks Game
+#  http://shootout.alioth.debian.org/
+#
+#  contributed by Karl von Laudermann
+#  modified by Jeremy Echols
+
+size = 600 # ARGV[0].to_i
+
+puts "P4\n#{size} #{size}"
+
+ITER = 49                           # Iterations - 1 for easy for..in looping
+LIMIT_SQUARED = 4.0                 # Presquared limit
+
+byte_acc = 0
+bit_num = 0
+
+count_size = size - 1               # Precomputed size for easy for..in looping
+
+# For..in loops are faster than .upto, .downto, .times, etc.
+for y in 0..count_size
+  for x in 0..count_size
+    zr = 0.0
+    zi = 0.0
+    cr = (2.0*x/size)-1.5
+    ci = (2.0*y/size)-1.0
+    escape = false
+
+    # To make use of the for..in code, we use a dummy variable,
+    # like one would in C
+    for dummy in 0..ITER
+      tr = zr*zr - zi*zi + cr
+      ti = 2*zr*zi + ci
+      zr, zi = tr, ti
+
+      if (zr*zr+zi*zi) > LIMIT_SQUARED
+        escape = true
+        break
+      end
+    end
+
+    byte_acc = (byte_acc << 1) | (escape ? 0b0 : 0b1)
+    bit_num += 1
+
+    # Code is very similar for these cases, but using separate blocks
+    # ensures we skip the shifting when it's unnecessary, which is most cases.
+    if (bit_num == 8)
+      print byte_acc.chr
+      byte_acc = 0
+      bit_num = 0
+    elsif (x == count_size)
+      byte_acc <<= (8 - bit_num)
+      print byte_acc.chr
+      byte_acc = 0
+      bit_num = 0
+    end
+  end
+end
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..d8c8e3ab9c
--- /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
+#   diminish 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/so_nsieve.rb b/benchmark/so_nsieve.rb
new file mode 100644
index 0000000000..a65cc78233
--- /dev/null
+++ b/benchmark/so_nsieve.rb
@@ -0,0 +1,35 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# contributed by Glenn Parker, March 2005
+# modified by Evan Phoenix, Sept 2006
+
+def sieve(m)
+  flags = Flags.dup[0,m]
+  count = 0
+  pmax = m - 1
+  p = 2
+  while p <= pmax
+    unless flags[p].zero?
+      count += 1
+      mult = p
+      while mult <= pmax
+        flags[mult] = 0
+        mult += p
+      end
+    end
+    p += 1
+  end
+  count
+end
+
+n = 9 # (ARGV[0] || 2).to_i
+Flags = ("\x1" * ( 2 ** n * 10_000)).unpack("c*")
+
+n.downto(n-2) do |exponent|
+  break if exponent < 0
+  m = (1 << exponent) * 10_000
+  # m = (2 ** exponent) * 10_000
+  count = sieve(m)
+  printf "Primes up to %8d %8d\n", m, count
+end
diff --git a/benchmark/so_nsieve_bits.rb b/benchmark/so_nsieve_bits.rb
new file mode 100644
index 0000000000..6f958ee44e
--- /dev/null
+++ b/benchmark/so_nsieve_bits.rb
@@ -0,0 +1,43 @@
+#!/usr/bin/ruby
+#coding: us-ascii
+#
+# The Great Computer Language Shootout
+# http://shootout.alioth.debian.org/
+#
+# nsieve-bits in Ruby
+# Contributed by Glenn Parker, March 2005
+
+CharExponent = 3
+BitsPerChar = 1 << CharExponent
+LowMask = BitsPerChar - 1
+
+def sieve(m)
+  items = "\xFF" * ((m / BitsPerChar) + 1)
+  masks = ""
+  BitsPerChar.times do |b|
+    masks << (1 << b).chr
+  end
+
+  count = 0
+  pmax = m - 1
+  2.step(pmax, 1) do |p|
+    if items[p >> CharExponent][p & LowMask] == 1
+      count += 1
+      p.step(pmax, p) do |mult|
+	a = mult >> CharExponent
+	b = mult & LowMask
+	items[a] -= masks[b] if items[a][b] != 0
+      end
+    end
+  end
+  count
+end
+
+n = 9 # (ARGV[0] || 2).to_i
+n.step(n - 2, -1) do |exponent|
+  break if exponent < 0
+  m = 2 ** exponent * 10_000
+  count = sieve(m)
+  printf "Primes up to %8d %8d\n", m, count
+end
+
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/so_partial_sums.rb b/benchmark/so_partial_sums.rb
new file mode 100644
index 0000000000..630b45cb8d
--- /dev/null
+++ b/benchmark/so_partial_sums.rb
@@ -0,0 +1,31 @@
+n = 2_500_000 # (ARGV.shift || 1).to_i
+
+alt = 1.0 ; s0 = s1 = s2 = s3 = s4 = s5 = s6 = s7 = s8 = 0.0
+
+1.upto(n) do |d|
+  d = d.to_f ; d2 = d * d ; d3 = d2 * d ; ds = Math.sin(d) ; dc = Math.cos(d)
+
+  s0 += (2.0 / 3.0) ** (d - 1.0)
+  s1 += 1.0 / Math.sqrt(d)
+  s2 += 1.0 / (d * (d + 1.0))
+  s3 += 1.0 / (d3 * ds * ds)
+  s4 += 1.0 / (d3 * dc * dc)
+  s5 += 1.0 / d
+  s6 += 1.0 / d2
+  s7 += alt / d
+  s8 += alt / (2.0 * d - 1.0)
+
+  alt = -alt
+end
+
+if false
+  printf("%.9f\t(2/3)^k\n", s0)
+  printf("%.9f\tk^-0.5\n", s1)
+  printf("%.9f\t1/k(k+1)\n", s2)
+  printf("%.9f\tFlint Hills\n", s3)
+  printf("%.9f\tCookson Hills\n", s4)
+  printf("%.9f\tHarmonic\n", s5)
+  printf("%.9f\tRiemann Zeta\n", s6)
+  printf("%.9f\tAlternating Harmonic\n", s7)
+  printf("%.9f\tGregory\n", s8)
+end
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/so_random.rb b/benchmark/so_random.rb
new file mode 100644
index 0000000000..a66b9e8e63
--- /dev/null
+++ b/benchmark/so_random.rb
@@ -0,0 +1,20 @@
+# from http://www.bagley.org/~doug/shootout/bench/random/random.ruby
+
+IM = 139968.0
+IA = 3877.0
+IC = 29573.0
+
+$last = 42.0
+
+def gen_random(max)
+  (max * ($last = ($last * IA + IC) % IM)) / IM
+end
+
+N = 3_000_000
+
+i = 0
+while i<N
+  i +=1
+  gen_random(100.0)
+end
+# "%.9f" % gen_random(100.0)
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/so_sieve.rb b/benchmark/so_sieve.rb
new file mode 100644
index 0000000000..43dc302648
--- /dev/null
+++ b/benchmark/so_sieve.rb
@@ -0,0 +1,24 @@
+# from http://www.bagley.org/~doug/shootout/bench/sieve/sieve.ruby
+num = 500
+count = i = j = 0
+flags0 = Array.new(8192,1)
+k = 0
+while k < num
+  k += 1
+  count = 0
+  flags = flags0.dup
+  i = 2
+  while i<8192
+    i += 1
+    if flags[i]
+      # remove all multiples of prime: i
+      j = i*i
+      while j < 8192
+        j += i
+        flags[j] = nil
+      end
+      count += 1
+    end
+  end
+end
+count
diff --git a/benchmark/so_spectralnorm.rb b/benchmark/so_spectralnorm.rb
new file mode 100644
index 0000000000..6b97206689
--- /dev/null
+++ b/benchmark/so_spectralnorm.rb
@@ -0,0 +1,50 @@
+# The Computer Language Shootout
+# http://shootout.alioth.debian.org/
+# Contributed by Sokolov Yura
+
+def eval_A(i,j)
+	return 1.0/((i+j)*(i+j+1)/2+i+1)
+end
+
+def eval_A_times_u(u)
+        v, i = nil, nil
+	(0..u.length-1).collect { |i|
+                v = 0
+		for j in 0..u.length-1
+			v += eval_A(i,j)*u[j]
+                end
+                v
+        }
+end
+
+def eval_At_times_u(u)
+	v, i = nil, nil
+	(0..u.length-1).collect{|i|
+                v = 0
+		for j in 0..u.length-1
+			v += eval_A(j,i)*u[j]
+                end
+                v
+        }
+end
+
+def eval_AtA_times_u(u)
+	return eval_At_times_u(eval_A_times_u(u))
+end
+
+n = 500 # ARGV[0].to_i
+
+u=[1]*n
+for i in 1..10
+        v=eval_AtA_times_u(u)
+        u=eval_AtA_times_u(v)
+end
+vBv=0
+vv=0
+for i in 0..n-1
+        vBv += u[i]*v[i]
+        vv += v[i]*v[i]
+end
+
+str = "%0.9f" % (Math.sqrt(vBv/vv)), "\n"
+# print str
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..88a3555c8a
--- /dev/null
+++ b/benchmark/string_casecmp.yml
@@ -0,0 +1,28 @@
+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-1000vs10: lstr1000.casecmp(ustr10)
+  casecmp-nonascii1: lnonascii1.casecmp(unonascii1)
+  casecmp-nonascii10: lnonascii10.casecmp(unonascii10)
+  casecmp-nonascii100: lnonascii100.casecmp(unonascii100)
+  casecmp-nonascii1000: lnonascii1000.casecmp(unonascii1000)
+  casecmp-nonascii1000vs10: lnonascii1000.casecmp(unonascii10)
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_codepoints.yml b/benchmark/string_codepoints.yml
new file mode 100644
index 0000000000..6a07db7ce1
--- /dev/null
+++ b/benchmark/string_codepoints.yml
@@ -0,0 +1,9 @@
+prelude: |
+  mixed_ascii64 = ("a" * 63 + "\u{100}") * 2048
+  mixed_ascii256 = ("a" * 255 + "\u{100}") * 512
+  utf8_2byte = "\u{100}" * 65536
+
+benchmark:
+  codepoints_mixed_ascii64: mixed_ascii64.codepoints
+  codepoints_mixed_ascii256: mixed_ascii256.codepoints
+  codepoints_utf8_2byte: utf8_2byte.codepoints
diff --git a/benchmark/string_coderange_scan.yml b/benchmark/string_coderange_scan.yml
new file mode 100644
index 0000000000..d47bbd2b30
--- /dev/null
+++ b/benchmark/string_coderange_scan.yml
@@ -0,0 +1,10 @@
+prelude: |
+  def unknown(s) = s.b.force_encoding("UTF-8")
+  multibyte   = unknown("\u{00e9}" * 16384)   # best case: every byte non-ASCII
+  alternating = unknown("\u{00e9}a" * 10922)  # worst case: non-ASCII then ASCII
+  ascii       = unknown("a" * 32768)          # baseline
+
+benchmark:
+  coderange_multibyte:   multibyte.dup.valid_encoding?
+  coderange_alternating: alternating.dup.valid_encoding?
+  coderange_ascii:       ascii.dup.valid_encoding?
diff --git a/benchmark/string_concat.yml b/benchmark/string_concat.yml
new file mode 100644
index 0000000000..c07fd21013
--- /dev/null
+++ b/benchmark/string_concat.yml
@@ -0,0 +1,51 @@
+prelude: |
+  CHUNK = "a" * 64
+  UCHUNK = "é" * 32
+  SHORT = "a" * (GC.stat_heap(0, :slot_size) / 2)
+  LONG = "a" * (GC.stat_heap(0, :slot_size) * 2)
+  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}"
+  interpolation_same_heap: |
+    buffer = "#{SHORT}#{SHORT}"
+  interpolation_switching_heaps: |
+    buffer = "#{SHORT}#{LONG}"
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_dup.yml b/benchmark/string_dup.yml
new file mode 100644
index 0000000000..90793f9f2a
--- /dev/null
+++ b/benchmark/string_dup.yml
@@ -0,0 +1,7 @@
+prelude: |
+  # frozen_string_literal: true
+benchmark:
+  uplus: |
+    +"A"
+  dup: |
+    "A".dup
diff --git a/benchmark/string_fstring.yml b/benchmark/string_fstring.yml
new file mode 100644
index 0000000000..cafef1f3fe
--- /dev/null
+++ b/benchmark/string_fstring.yml
@@ -0,0 +1,16 @@
+benchmark:
+  fstring_random: |
+    i = 0
+    str = "same".dup
+    while i < 5_000_000
+      -(i.to_s.freeze)
+      i += 1
+    end
+  fstring_same: |
+    i = 0
+    str = "same".dup
+    while i < 10_000_000
+      -str
+      i += 1
+    end
+loop_count: 1
diff --git a/benchmark/string_gsub.yml b/benchmark/string_gsub.yml
new file mode 100644
index 0000000000..c26e1a6498
--- /dev/null
+++ b/benchmark/string_gsub.yml
@@ -0,0 +1,54 @@
+prelude: |
+  # frozen_string_literal: true
+  STR = ((("a" * 31) + "<") * 1000).freeze
+  STR_UNICODE = ((("a" * 30) + "\u2028") * 1000).freeze
+  ESCAPED_CHARS_BINARY = {
+    "\u2028".b => '\u2028'.b,
+    "\u2029".b => '\u2029'.b,
+    ">".b => '\u003e'.b.freeze,
+    "<".b => '\u003c'.b.freeze,
+    "&".b => '\u0026'.b.freeze,
+  }
+  BINARY_PATTERN = Regexp.union(ESCAPED_CHARS_BINARY.keys)
+
+  ESCAPED_CHARS = {
+    "\u2028" => '\u2028',
+    "\u2029" => '\u2029',
+    ">" => '\u003e',
+    "<" => '\u003c',
+    "&" => '\u0026',
+  }
+  ESCAPE_PATTERN = Regexp.union(ESCAPED_CHARS.keys)
+
+  NO_MATCH_SHARED_STRING = ("a" * 100_000).freeze
+
+benchmark:
+  gsub_no_match_shared: |
+    str = NO_MATCH_SHARED_STRING.dup
+    str.gsub!("z", "x")
+    str
+
+  sub_no_match_shared: |
+    str = NO_MATCH_SHARED_STRING.dup
+    str.sub!("z", "x")
+    str
+
+  escape: |
+    str = STR.dup
+    str.gsub!(ESCAPE_PATTERN, ESCAPED_CHARS)
+    str
+
+  escape_bin: |
+    str = STR.b
+    str.gsub!(BINARY_PATTERN, ESCAPED_CHARS_BINARY)
+    str.force_encoding(Encoding::UTF_8)
+
+  escape_utf8: |
+    str = STR_UNICODE.dup
+    str.gsub!(ESCAPE_PATTERN, ESCAPED_CHARS)
+    str
+
+  escape_utf8_bin: |
+    str = STR_UNICODE.b
+    str.gsub!(BINARY_PATTERN, ESCAPED_CHARS_BINARY)
+    str.force_encoding(Encoding::UTF_8)
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_inspect.yml b/benchmark/string_inspect.yml
new file mode 100644
index 0000000000..62a884e19d
--- /dev/null
+++ b/benchmark/string_inspect.yml
@@ -0,0 +1,13 @@
+prelude: |
+  ascii = "Hello, World! This is a benchmark test string." * 100
+  utf8 = "こんにちは世界。これはベンチマーク用のテスト文字列です。" * 100
+  mixed = ("Hello World! " + "テスト" + " is great! ") * 100
+  binary = ("\xE3\x81\x82" * 100).b
+  escapy = "\n\t\"\\\#" * 100
+
+benchmark:
+  inspect_ascii: ascii.inspect
+  inspect_utf8: utf8.inspect
+  inspect_mixed: mixed.inspect
+  inspect_binary: binary.inspect
+  inspect_escapy: escapy.inspect
diff --git a/benchmark/string_memsearch.yml b/benchmark/string_memsearch.yml
new file mode 100644
index 0000000000..cde363289a
--- /dev/null
+++ b/benchmark/string_memsearch.yml
@@ -0,0 +1,75 @@
+prelude: |
+  # Haystacks of various sizes
+  small_hay  = "a" * 256
+  medium_hay = "a" * 4096
+  large_hay  = "a" * 65536
+
+  # Short needles (2-8 bytes) that exercise rb_memsearch_ss
+  needle_2 = "xy"
+  needle_4 = "xyzw"
+  needle_8 = "xyzwabcd"
+
+  # Needle whose first byte is absent from the haystack (memchr fast-path)
+  # vs needle whose first byte is common (rolling hash comparison)
+  first_byte_absent  = "x" + "a" * 3
+  first_byte_common  = "a" + "x" * 3
+
+  # Haystack with match at the end
+  hay_match_end = "a" * 4095 + "xy"
+
+  # Haystack with match at the start
+  hay_match_start = "xy" + "a" * 4094
+
+  # Mixed content haystack (more realistic)
+  mixed_hay = (("abcdefghij" * 100) + "z") * 10
+
+benchmark:
+  # === First byte absent from haystack (biggest win for rolling hash) ===
+  index_first_byte_absent_small: |
+    small_hay.index(first_byte_absent)
+  index_first_byte_absent_medium: |
+    medium_hay.index(first_byte_absent)
+  index_first_byte_absent_large: |
+    large_hay.index(first_byte_absent)
+
+  # === First byte common in haystack (stresses comparison loop) ===
+  index_first_byte_common_small: |
+    small_hay.index(first_byte_common)
+  index_first_byte_common_medium: |
+    medium_hay.index(first_byte_common)
+  index_first_byte_common_large: |
+    large_hay.index(first_byte_common)
+
+  # === Needle length variations (all absent) ===
+  index_needle_2_absent: |
+    medium_hay.index(needle_2)
+  index_needle_4_absent: |
+    medium_hay.index(needle_4)
+  index_needle_8_absent: |
+    medium_hay.index(needle_8)
+
+  # === Match at end of haystack ===
+  index_match_at_end: |
+    hay_match_end.index(needle_2)
+
+  # === Match at start of haystack ===
+  index_match_at_start: |
+    hay_match_start.index(needle_2)
+
+  # === include? (same code path) ===
+  include_first_byte_absent: |
+    medium_hay.include?(first_byte_absent)
+  include_first_byte_common: |
+    medium_hay.include?(first_byte_common)
+
+  # === byteindex ===
+  byteindex_first_byte_absent: |
+    medium_hay.byteindex(first_byte_absent)
+  byteindex_first_byte_common: |
+    medium_hay.byteindex(first_byte_common)
+
+  # === Mixed/realistic haystack ===
+  index_mixed_absent: |
+    mixed_hay.index(needle_4)
+  index_mixed_present: |
+    mixed_hay.index("ijab")
diff --git a/benchmark/string_rpartition.yml b/benchmark/string_rpartition.yml
new file mode 100644
index 0000000000..37e9d1b071
--- /dev/null
+++ b/benchmark/string_rpartition.yml
@@ -0,0 +1,18 @@
+prelude: |
+  str1 = [*"a".."z",*"0".."9"].join("")
+  str10 = str1 * 10 + ":"
+  str100 = str1 * 100 + ":"
+  str1000 = str1 * 1000 + ":"
+  nonascii1 = [*"\u{e0}".."\u{ff}"].join("")
+  nonascii10 = nonascii1 * 10 + ":"
+  nonascii100 = nonascii1 * 100 + ":"
+  nonascii1000 = nonascii1 * 1000 + ":"
+benchmark:
+  rpartition-1: str1.rpartition(":")
+  rpartition-10: str10.rpartition(":")
+  rpartition-100: str100.rpartition(":")
+  rpartition-1000: str1000.rpartition(":")
+  rpartition-nonascii1: nonascii1.rpartition(":")
+  rpartition-nonascii10: nonascii10.rpartition(":")
+  rpartition-nonascii100: nonascii100.rpartition(":")
+  rpartition-nonascii1000: nonascii1000.rpartition(":")
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_scrub.yml b/benchmark/string_scrub.yml
new file mode 100644
index 0000000000..4b5faaad8e
--- /dev/null
+++ b/benchmark/string_scrub.yml
@@ -0,0 +1,48 @@
+prelude: |
+
+  STRING_SIZE = 1024
+  def duplicate_to_length(str, target_length)
+    return "" if target_length <= 0
+    return str[0, target_length] if str.length >= target_length
+
+    (str * ((target_length / str.length) + 1))[0, target_length]
+  end
+  base = "Hello \u{1f600} world! \u{00e9}\u{00f1}"
+  padding = duplicate_to_length(base, STRING_SIZE)
+
+  valid_utf8 = (padding.b + "OK".b).force_encoding("UTF-8")
+  valid_utf8.valid_encoding?
+  unknown_but_valid_utf8 = valid_utf8.dup.b.force_encoding("UTF-8")
+  invalid_utf8 = (padding.b + "\x80\xFF".b).force_encoding("UTF-8")
+  invalid_utf8.valid_encoding?
+  unknown_but_invalid_utf8 = (padding.b + "\x80\xFF".b).force_encoding("UTF-8")
+
+  worst_case_utf8 = duplicate_to_length("\u{1f600}\u{00e9}\u{00f1}", STRING_SIZE).b.force_encoding("UTF-8")
+
+  unknown_but_valid_utf8_worst_case = worst_case_utf8.dup.b.force_encoding("UTF-8")
+  unknown_but_invalid_utf8_worst_case = (worst_case_utf8.b + "\x80\xFF".b).force_encoding("UTF-8")
+
+benchmark:
+  scrub_known_valid: |
+    string = valid_utf8.dup
+    string.scrub!
+
+  scrub_known_invalid: |
+    string = invalid_utf8.dup
+    string.scrub!
+
+  scrub_unknown_but_valid_coderange: |
+    string = unknown_but_valid_utf8.dup
+    string.scrub!
+
+  scrub_unknown_and_invalid_coderange: |
+    string = unknown_but_invalid_utf8.dup
+    string.scrub!
+
+  scrub_unknown_but_valid_coderange_worst_case: |
+    string = unknown_but_valid_utf8_worst_case.dup
+    string.scrub!
+
+  scrub_unknown_and_invalid_coderange_worst_case: |
+    string = unknown_but_invalid_utf8_worst_case.dup
+    string.scrub!
+\ No newline at end of file
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/struct_accessor.yml b/benchmark/struct_accessor.yml
new file mode 100644
index 0000000000..d95240e2dd
--- /dev/null
+++ b/benchmark/struct_accessor.yml
@@ -0,0 +1,37 @@
+prelude: |
+  C = Struct.new(:x) do
+    def initialize(...)
+      super
+      @ivar = 42
+    end
+
+    attr_accessor :ivar
+
+    class_eval <<-END
+      def r
+        #{'x;'*256}
+      end
+      def w
+        #{'self.x = nil;'*256}
+      end
+      def rm
+        m = method(:x)
+        #{'m.call;'*256}
+      end
+      def wm
+        m = method(:x=)
+        #{'m.call(nil);'*256}
+      end
+      def r_ivar
+        #{'ivar;'*256}
+      end
+    END
+  end
+  C.new(nil) # ensure common shape is known
+  obj = C.new(nil)
+benchmark:
+  member_reader: "obj.r"
+  member_writer: "obj.w"
+  member_reader_method: "obj.rm"
+  member_writer_method: "obj.wm"
+  ivar_reader: "obj.r_ivar"
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..9336877cd4
--- /dev/null
+++ b/benchmark/time_now.yml
@@ -0,0 +1,4 @@
+benchmark:
+  - 'Time.now'
+  - 'Time.now(in: "+09:00")'
+  - 'Time.now.year'
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_strftime.yml b/benchmark/time_strftime.yml
new file mode 100644
index 0000000000..28f62aec87
--- /dev/null
+++ b/benchmark/time_strftime.yml
@@ -0,0 +1,7 @@
+prelude: |
+  # frozen_string_literal: true
+  time = Time.now
+benchmark:
+  - time.strftime("%FT%T")     # 19B
+  - time.strftime("%FT%T.%3N") # 23B
+  - time.strftime("%FT%T.%6N") # 26B
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/time_xmlschema.yml b/benchmark/time_xmlschema.yml
new file mode 100644
index 0000000000..654e5cfcbc
--- /dev/null
+++ b/benchmark/time_xmlschema.yml
@@ -0,0 +1,27 @@
+prelude: |
+  # frozen_string_literal
+  unless Time.method_defined?(:xmlschema)
+    class Time
+      def xmlschema(fraction_digits=0)
+        fraction_digits = fraction_digits.to_i
+        s = strftime("%FT%T")
+        if fraction_digits > 0
+          s << strftime(".%#{fraction_digits}N")
+        end
+        s << (utc? ? 'Z' : strftime("%:z"))
+      end
+    end
+  end
+  time = Time.now
+  utc_time = Time.now.utc
+  fraction_sec = Time.at(123456789.quo(9999999999)).getlocal("+09:00")
+  future_time = Time.utc(10000)
+benchmark:
+  - time.xmlschema
+  - utc_time.xmlschema
+  - time.xmlschema(6)
+  - utc_time.xmlschema(6)
+  - time.xmlschema(9)
+  - utc_time.xmlschema(9)
+  - fraction_sec.xmlschema(10)
+  - future_time.xmlschema
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/vm_backtrace.rb b/benchmark/vm_backtrace.rb
new file mode 100644
index 0000000000..0fbf73e1ca
--- /dev/null
+++ b/benchmark/vm_backtrace.rb
@@ -0,0 +1,22 @@
+# get last backtrace
+
+begin
+  caller(0, 0)
+rescue ArgumentError
+  alias caller_orig caller
+  def caller lev, n
+    caller_orig(lev)[0..n]
+  end
+end
+
+def rec n
+  if n < 0
+    100_000.times{
+      caller(0, 1)
+    }
+  else
+    rec(n-1)
+  end
+end
+
+rec 50
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_call_bmethod.yml b/benchmark/vm_call_bmethod.yml
new file mode 100644
index 0000000000..40136e5aa4
--- /dev/null
+++ b/benchmark/vm_call_bmethod.yml
@@ -0,0 +1,37 @@
+prelude: |
+  define_method(:a0){}
+  define_method(:a1){|a| a}
+  define_method(:s){|*a| a}
+  define_method(:b){|kw: 1| kw}
+
+  t0 = 0.times.to_a
+  t1 = 1.times.to_a
+  t10 = 10.times.to_a
+  t100 = 100.times.to_a
+  kw = {kw: 2}
+benchmark:
+  bmethod_simple_0: |
+    a0
+  bmethod_simple_1: |
+    a1(1)
+  bmethod_simple_0_splat: |
+    a0(*t0)
+  bmethod_simple_1_splat: |
+    a1(*t1)
+  bmethod_no_splat: |
+    s
+  bmethod_0_splat: |
+    s(*t0)
+  bmethod_1_splat: |
+    s(*t1)
+  bmethod_10_splat: |
+    s(*t10)
+  bmethod_100_splat: |
+    s(*t100)
+  bmethod_kw: |
+    b(kw: 1)
+  bmethod_no_kw: |
+    b
+  bmethod_kw_splat: |
+    b(**kw)
+loop_count: 6000000
diff --git a/benchmark/vm_call_kw_and_kw_splat.yml b/benchmark/vm_call_kw_and_kw_splat.yml
new file mode 100644
index 0000000000..aa6e549e0c
--- /dev/null
+++ b/benchmark/vm_call_kw_and_kw_splat.yml
@@ -0,0 +1,25 @@
+prelude: |
+  h1, h10, h100, h1000 = [1, 10, 100, 1000].map do |n|
+    h = {kw: 1}
+    n.times{|i| h[i.to_s.to_sym] = i}
+    h
+  end
+  eh = {}
+  def kw(kw: nil, **kws) end
+benchmark:
+  1: |
+    kw(**h1)
+  1_mutable: |
+    kw(**eh, **h1)
+  10: |
+    kw(**h10)
+  10_mutable: |
+    kw(**eh, **h10)
+  100: |
+    kw(**h100)
+  100_mutable: |
+    kw(**eh, **h100)
+  1000: |
+    kw(**h1000)
+  1000_mutable: |
+    kw(**eh, **h1000)
diff --git a/benchmark/vm_call_method_missing.yml b/benchmark/vm_call_method_missing.yml
new file mode 100644
index 0000000000..f890796f11
--- /dev/null
+++ b/benchmark/vm_call_method_missing.yml
@@ -0,0 +1,62 @@
+prelude: |
+  class A0
+    def method_missing(m); m end
+  end
+  class A1
+    def method_missing(m, a) a; end
+  end
+  class S
+    def method_missing(m, *a) a; end
+  end
+  class B
+    def method_missing(m, kw: 1) kw end
+  end
+  class SB
+    def method_missing(m, *a, kw: 1) kw end
+  end
+
+  t0 = 0.times.to_a
+  t1 = 1.times.to_a
+  t10 = 10.times.to_a
+  t200 = 200.times.to_a
+  kw = {kw: 2}
+
+  a0 = A0.new
+  a1 = A1.new
+  s = S.new
+  b = B.new
+  sb = SB.new
+benchmark:
+  method_missing_simple_0: |
+    a0.()
+  method_missing_simple_1: |
+    a1.x(1)
+  method_missing_simple_0_splat: |
+    a0.(*t0)
+  method_missing_simple_1_splat: |
+    a1.(*t1)
+  method_missing_no_splat: |
+    s.()
+  method_missing_0_splat: |
+    s.(*t0)
+  method_missing_1_splat: |
+    s.(*t1)
+  method_missing_10_splat: |
+    s.(*t10)
+  method_missing_200_splat: |
+    s.(*t200)
+  method_missing_kw: |
+    b.(kw: 1)
+  method_missing_no_kw: |
+    b.()
+  method_missing_kw_splat: |
+    b.(**kw)
+  method_missing_0_splat_kw: |
+    sb.(*t0, **kw)
+  method_missing_1_splat_kw: |
+    sb.(*t1, **kw)
+  method_missing_10_splat_kw: |
+    sb.(*t10, **kw)
+  method_missing_200_splat_kw: |
+    sb.(*t200, **kw)
+loop_count: 1000000
diff --git a/benchmark/vm_call_send_iseq.yml b/benchmark/vm_call_send_iseq.yml
new file mode 100644
index 0000000000..60ff23c475
--- /dev/null
+++ b/benchmark/vm_call_send_iseq.yml
@@ -0,0 +1,77 @@
+prelude: |
+  def a0; end
+  def a1(a) a; end
+  def s(*a) a; end
+  def b(kw: 1) kw end
+  def sb(*a, kw: 1) kw end
+
+  t0 = 0.times.to_a
+  t1 = 1.times.to_a
+  t10 = 10.times.to_a
+  t200 = 200.times.to_a
+
+  a0_t0 = [:a0, *t0]
+  a1_t1 = [:a1, *t1]
+  s_t0 = [:s, *t0]
+  s_t1 = [:s, *t1]
+  s_t10 = [:s, *t10]
+  s_t200 = [:s, *t200]
+  sb_t0 = [:sb, *t0]
+  sb_t1 = [:sb, *t1]
+  sb_t10 = [:sb, *t10]
+  sb_t200 = [:sb, *t200]
+  kw = {kw: 2}
+benchmark:
+  send_simple_0: |
+    send(:a0)
+  send_simple_1: |
+    send(:a1, 1)
+  send_simple_0_splat: |
+    send(:a0, *t0)
+  send_simple_1_splat: |
+    send(:a1, *t1)
+  send_simple_0_splat_comb: |
+    send(*a0_t0)
+  send_simple_1_splat_comb: |
+    send(*a1_t1)
+  send_no_splat: |
+    send(:s)
+  send_0_splat: |
+    send(:s, *t0)
+  send_1_splat: |
+    send(:s, *t1)
+  send_10_splat: |
+    send(:s, *t10)
+  send_200_splat: |
+    send(:s, *t200)
+  send_0_splat_comb: |
+    send(*s_t0)
+  send_1_splat_comb: |
+    send(*s_t1)
+  send_10_splat_comb: |
+    send(*s_t10)
+  send_200_splat_comb: |
+    send(*s_t200)
+  send_kw: |
+    send(:b, kw: 1)
+  send_no_kw: |
+    send(:b)
+  send_kw_splat: |
+    send(:b, **kw)
+  send_0_splat_kw: |
+    send(:sb, *t0, **kw)
+  send_1_splat_kw: |
+    send(:sb, *t1, **kw)
+  send_10_splat_kw: |
+    send(:sb, *t10, **kw)
+  send_200_splat_kw: |
+    send(:sb, *t200, **kw)
+  send_0_splat_comb_kw: |
+    send(*sb_t0, **kw)
+  send_1_splat_comb_kw: |
+    send(*sb_t1, **kw)
+  send_10_splat_comb_kw: |
+    send(*sb_t10, **kw)
+  send_200_splat_comb_kw: |
+    send(*sb_t200, **kw)
+loop_count: 3000000
diff --git a/benchmark/vm_call_symproc.yml b/benchmark/vm_call_symproc.yml
new file mode 100644
index 0000000000..16e0ac579e
--- /dev/null
+++ b/benchmark/vm_call_symproc.yml
@@ -0,0 +1,83 @@
+prelude: |
+  def self.a0; end
+  def self.a1(a) a; end
+  def self.s(*a) a; end
+  def self.b(kw: 1) kw end
+  def self.sb(*a, kw: 1) kw end
+
+  t0 = 0.times.to_a
+  t1 = 1.times.to_a
+  t10 = 10.times.to_a
+  t200 = 200.times.to_a
+
+  a0_t0 = [self, *t0]
+  a1_t1 = [self, *t1]
+  s_t0 = [self, *t0]
+  s_t1 = [self, *t1]
+  s_t10 = [self, *t10]
+  s_t200 = [self, *t200]
+  sb_t0 = [self, *t0]
+  sb_t1 = [self, *t1]
+  sb_t10 = [self, *t10]
+  sb_t200 = [self, *t200]
+  kw = {kw: 2}
+
+  a0 = :a0.to_proc
+  a1 = :a1.to_proc
+  s = :s.to_proc
+  b = :b.to_proc
+  sb = :sb.to_proc
+benchmark:
+  symproc_simple_0: |
+    a0.(self)
+  symproc_simple_1: |
+    a1.(self, 1)
+  symproc_simple_0_splat: |
+    a0.(self, *t0)
+  symproc_simple_1_splat: |
+    a1.(self, *t1)
+  symproc_simple_0_splat_comb: |
+    a0.(*a0_t0)
+  symproc_simple_1_splat_comb: |
+    a1.(*a1_t1)
+  symproc_no_splat: |
+    s.(self)
+  symproc_0_splat: |
+    s.(self, *t0)
+  symproc_1_splat: |
+    s.(self, *t1)
+  symproc_10_splat: |
+    s.(self, *t10)
+  symproc_200_splat: |
+    s.(self, *t200)
+  symproc_0_splat_comb: |
+    s.(*s_t0)
+  symproc_1_splat_comb: |
+    s.(*s_t1)
+  symproc_10_splat_comb: |
+    s.(*s_t10)
+  symproc_200_splat_comb: |
+    s.(*s_t200)
+  symproc_kw: |
+    b.(self, kw: 1)
+  symproc_no_kw: |
+    b.(self)
+  symproc_kw_splat: |
+    b.(self, **kw)
+  symproc_0_splat_kw: |
+    sb.(self, *t0, **kw)
+  symproc_1_splat_kw: |
+    sb.(self, *t1, **kw)
+  symproc_10_splat_kw: |
+    sb.(self, *t10, **kw)
+  symproc_200_splat_kw: |
+    sb.(self, *t200, **kw)
+  symproc_0_splat_comb_kw: |
+    sb.(*sb_t0, **kw)
+  symproc_1_splat_comb_kw: |
+    sb.(*sb_t1, **kw)
+  symproc_10_splat_comb_kw: |
+    sb.(*sb_t10, **kw)
+  symproc_200_splat_comb_kw: |
+    sb.(*sb_t200, **kw)
+loop_count: 1000000
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/vm_clearmethodcache.rb b/benchmark/vm_clearmethodcache.rb
new file mode 100644
index 0000000000..9661323cd2
--- /dev/null
+++ b/benchmark/vm_clearmethodcache.rb
@@ -0,0 +1,8 @@
+i = 0
+while i<200_000
+  i += 1
+
+  Class.new{
+    def m; end
+  }
+end
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..1e0dad665f
--- /dev/null
+++ b/benchmark/vm_ivar_get.yml
@@ -0,0 +1,100 @@
+prelude: |
+  class Example
+    def initialize
+      @levar = 1
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+    end
+
+    def get_value_loop
+      sum = 0
+
+      i = 0
+      while i < 100_000
+        # 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
+
+    @levar = 1
+    @v0 = 1
+    @v1 = 2
+    @v3 = 3
+
+    def self.get_value_loop
+      sum = 0
+
+      i = 0
+      while i < 100_000
+        # 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
+
+  class GenExample < Time
+    def initialize
+      @levar = 1
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+    end
+
+    def get_value_loop
+      sum = 0
+
+      i = 0
+      while i < 100_000
+        # 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
+  gen = GenExample.new
+benchmark:
+  vm_ivar_get_on_obj: |
+    obj.get_value_loop
+  vm_ivar_get_on_class: |
+    Example.get_value_loop
+  vm_ivar_get_on_generic: |
+    gen.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_ic_miss.yml b/benchmark/vm_ivar_ic_miss.yml
new file mode 100644
index 0000000000..944fb1a9e6
--- /dev/null
+++ b/benchmark/vm_ivar_ic_miss.yml
@@ -0,0 +1,20 @@
+prelude: |
+  class Foo
+    def initialize diverge
+      if diverge
+        @a = 1
+      end
+
+      @a0 = @a1 = @a2 = @a3 = @a4 = @a5 = @a6 = @a7 = @a8 = @a9 = @a10 = @a11 = @a12 = @a13 = @a14 = @a15 = @a16 = @a17 = @a18 = @a19 = @a20 = @a21 = @a22 = @a23 = @a24 = @a25 = @a26 = @a27 = @a28 = @a29 = @a30 = @a31 = @a32 = @a33 = @a34 = @a35 = @a36 = @a37 = @a38 = @a39 = @a40 = @a41 = @a42 = @a43 = @a44 = @a45 = @a46 = @a47 = @a48 = @a49 = @a50 = @a51 = @a52 = @a53 = @a54 = @a55 = @a56 = @a57 = @a58 = @a59 = @a60 = @a61 = @a62 = @a63 = @a64 = @a65 = @a66 = @a67 = @a68 = @a69 = @a70 = @a71 = @a72 = @a73 = @a74 = @b = 1
+    end
+
+    def b; @b; end
+  end
+
+  a = Foo.new false
+  b = Foo.new true
+benchmark:
+  vm_ivar_ic_miss: |
+    a.b
+    b.b
+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_memoize.yml b/benchmark/vm_ivar_memoize.yml
new file mode 100644
index 0000000000..90f6b07f05
--- /dev/null
+++ b/benchmark/vm_ivar_memoize.yml
@@ -0,0 +1,85 @@
+prelude: |
+  IVARS = 60
+  class Record
+    def initialize(offset = false)
+      @offset = 1 if offset
+      @first = 0
+      IVARS.times do |i|
+        instance_variable_set("@ivar_#{i}", i)
+      end
+    end
+
+    def first
+      @first
+    end
+
+    def lazy_set
+      @lazy_set ||= 123
+    end
+
+    def undef
+      @undef
+    end
+  end
+
+  Record.new # Need one alloc to right size
+
+  BASE = Record.new
+  LAZY = Record.new
+  LAZY.lazy_set
+
+  class Miss < Record
+    @first = 0
+    IVARS.times do |i|
+      instance_variable_set("@i_#{i}", i)
+    end
+  end
+
+  Miss.new # Need one alloc to right size
+  MISS = Miss.new
+
+  DIVERGENT = Record.new(true)
+
+benchmark:
+  vm_ivar_stable_shape: |
+    BASE.first
+    BASE.first
+    BASE.first
+    BASE.first
+    BASE.first
+    BASE.first
+  vm_ivar_memoize_unstable_shape: |
+    BASE.first
+    LAZY.first
+    BASE.first
+    LAZY.first
+    BASE.first
+    LAZY.first
+  vm_ivar_memoize_unstable_shape_miss: |
+    BASE.first
+    MISS.first
+    BASE.first
+    MISS.first
+    BASE.first
+    MISS.first
+  vm_ivar_unstable_undef: |
+    BASE.undef
+    LAZY.undef
+    BASE.undef
+    LAZY.undef
+    BASE.undef
+    LAZY.undef
+  vm_ivar_divergent_shape: |
+    BASE.first
+    DIVERGENT.first
+    BASE.first
+    DIVERGENT.first
+    BASE.first
+    DIVERGENT.first
+  vm_ivar_divergent_shape_imbalanced: |
+    BASE.first
+    DIVERGENT.first
+    DIVERGENT.first
+    DIVERGENT.first
+    DIVERGENT.first
+    DIVERGENT.first
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..6ce53a86ec
--- /dev/null
+++ b/benchmark/vm_ivar_set_on_instance.yml
@@ -0,0 +1,94 @@
+prelude: |
+  class TheClass
+    def initialize
+      @levar = 1
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+    end
+
+    def set_value_loop
+      # 100k
+      i = 0
+      while i < 100_000
+        # 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
+
+  class Generic < Time
+    def initialize
+      @levar = 1
+      @v0 = 1
+      @v1 = 2
+      @v3 = 3
+    end
+
+    def set_value_loop
+      # 100k
+      i = 0
+      while i < 100_000
+        # 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
+  gen_obj = Generic.new
+
+  class SomeClass
+    @levar = 1
+    @v0 = 1
+    @v1 = 2
+    @v3 = 3
+
+    def self.set_value_loop
+      # 100k
+      i = 0
+      while i < 100_000
+        # 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
+
+benchmark:
+  vm_ivar_set_on_instance: |
+    obj.set_value_loop
+  vm_ivar_set_on_generic: |
+    gen_obj.set_value_loop
+  vm_ivar_set_on_class: |
+    SomeClass.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_splat_calls.yml b/benchmark/vm_method_splat_calls.yml
new file mode 100644
index 0000000000..f2f366e99c
--- /dev/null
+++ b/benchmark/vm_method_splat_calls.yml
@@ -0,0 +1,13 @@
+prelude: |
+  def f(x=0, y: 0) end
+  a = [1]
+  ea = []
+  kw = {y: 1}
+  b = lambda{}
+benchmark:
+  arg_splat: "f(1, *ea)"
+  arg_splat_block: "f(1, *ea, &b)"
+  splat_kw_splat: "f(*a, **kw)"
+  splat_kw_splat_block: "f(*a, **kw, &b)"
+  splat_kw: "f(*a, y: 1)"
+  splat_kw_block: "f(*a, y: 1, &b)"
diff --git a/benchmark/vm_method_splat_calls2.yml b/benchmark/vm_method_splat_calls2.yml
new file mode 100644
index 0000000000..d33dcd7e8b
--- /dev/null
+++ b/benchmark/vm_method_splat_calls2.yml
@@ -0,0 +1,27 @@
+prelude: |
+  def named_arg_splat(*a) end
+  def named_arg_kw_splat(*a, **kw) end
+  def anon_arg_splat(*) end
+  def anon_kw_splat(**) end
+  def anon_arg_kw_splat(*, **) end
+  def anon_fw_to_named(*, **) named_arg_kw_splat(*, **) end
+  def fw_to_named(...) named_arg_kw_splat(...) end
+  def fw_to_anon_to_named(...) anon_fw_to_named(...) end
+  def fw_no_kw(...) named_arg_splat(...) end
+  a = [1]
+  kw = {y: 1}
+benchmark:
+  named_multi_arg_splat: "named_arg_splat(*a, *a)"
+  named_post_splat: "named_arg_splat(*a, a)"
+  anon_arg_splat: "anon_arg_splat(*a)"
+  anon_arg_kw_splat: "anon_arg_kw_splat(*a, **kw)"
+  anon_multi_arg_splat: "anon_arg_splat(*a, *a)"
+  anon_post_splat: "anon_arg_splat(*a, a)"
+  anon_kw_splat: "anon_kw_splat(**kw)"
+  anon_fw_to_named_splat: "anon_fw_to_named(*a, **kw)"
+  anon_fw_to_named_no_splat: "anon_fw_to_named(1, y: 1)"
+  fw_to_named_splat: "fw_to_named(*a, **kw)"
+  fw_to_named_no_splat: "fw_to_named(1, y: 1)"
+  fw_to_anon_to_named_splat: "fw_to_anon_to_named(*a, **kw)"
+  fw_to_anon_to_named_no_splat: "fw_to_anon_to_named(1, y: 1)"
+  fw_no_kw: "fw_no_kw(1, 2)"
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..80541332b1
--- /dev/null
+++ b/benchmark/vm_regexp.yml
@@ -0,0 +1,14 @@
+prelude: |
+  str = 'xxxhogexxx'
+benchmark:
+  vm_regexp: |
+    /hoge/ =~ str
+  vm_regexp_alternating: |
+    /hoge/ =~ str
+    /huge/ =~ str
+  vm_regexp_invert: |
+    str =~ /hoge/
+  vm_regexp_invert_alternating: |
+    str =~ /hoge/
+    str =~ /huge/
+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..6f12b65176
--- /dev/null
+++ b/benchmark/vm_send_cfunc.yml
@@ -0,0 +1,14 @@
+prelude: |
+  ary = []
+  kw = {a: 1}
+  empty_kw = {}
+  kw_ary = [Hash.ruby2_keywords_hash(a: 1)]
+  empty_kw_ary = [Hash.ruby2_keywords_hash({})]
+benchmark:
+  vm_send_cfunc: itself
+  vm_send_cfunc_splat: itself(*ary)
+  vm_send_cfunc_splat_kw_hash: equal?(*kw_ary)
+  vm_send_cfunc_splat_empty_kw_hash: itself(*empty_kw_ary)
+  vm_send_cfunc_splat_kw: equal?(*ary, **kw)
+  vm_send_cfunc_splat_empty_kw: itself(*ary, **empty_kw)
+loop_count: 20000000
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_super_splat_calls.yml b/benchmark/vm_super_splat_calls.yml
new file mode 100644
index 0000000000..795e44e4da
--- /dev/null
+++ b/benchmark/vm_super_splat_calls.yml
@@ -0,0 +1,25 @@
+prelude: |
+  @a = [1].freeze
+  @ea = [].freeze
+  @kw = {y: 1}.freeze
+  @b = lambda{}
+  extend(Module.new{def arg_splat(x=0, y: 0) end})
+  extend(Module.new{def arg_splat_block(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_splat(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_splat_block(x=0, y: 0) end})
+  extend(Module.new{def splat_kw(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_block(x=0, y: 0) end})
+
+  extend(Module.new{def arg_splat; super(1, *@ea) end})
+  extend(Module.new{def arg_splat_block; super(1, *@ea, &@b) end})
+  extend(Module.new{def splat_kw_splat; super(*@a, **@kw) end})
+  extend(Module.new{def splat_kw_splat_block; super(*@a, **@kw, &@b) end})
+  extend(Module.new{def splat_kw; super(*@a, y: 1) end})
+  extend(Module.new{def splat_kw_block; super(*@a, y: 1, &@b) end})
+benchmark:
+  arg_splat: "arg_splat"
+  arg_splat_block: "arg_splat_block"
+  splat_kw_splat: "splat_kw_splat"
+  splat_kw_splat_block: "splat_kw_splat_block"
+  splat_kw: "splat_kw"
+  splat_kw_block: "splat_kw_block"
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/vm_thread_create_join.rb b/benchmark/vm_thread_create_join.rb
new file mode 100644
index 0000000000..393cd45df9
--- /dev/null
+++ b/benchmark/vm_thread_create_join.rb
@@ -0,0 +1,6 @@
+i = 0
+while i<100_000 # benchmark loop 3
+  i += 1
+  Thread.new{
+  }.join
+end
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/vm_zsuper_splat_calls.yml b/benchmark/vm_zsuper_splat_calls.yml
new file mode 100644
index 0000000000..82dc22349d
--- /dev/null
+++ b/benchmark/vm_zsuper_splat_calls.yml
@@ -0,0 +1,28 @@
+prelude: |
+  a = [1].freeze
+  ea = [].freeze
+  kw = {y: 1}.freeze
+  b = lambda{}
+  extend(Module.new{def arg_splat(x=0, y: 0) end})
+  extend(Module.new{def arg_splat_block(x=0, y: 0) end})
+  extend(Module.new{def arg_splat_post(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_splat(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_splat_block(x=0, y: 0) end})
+  extend(Module.new{def splat_kw(x=0, y: 0) end})
+  extend(Module.new{def splat_kw_block(x=0, y: 0) end})
+
+  extend(Module.new{def arg_splat(x, *a) super end})
+  extend(Module.new{def arg_splat_block(x, *a, &b) super end})
+  extend(Module.new{def arg_splat_post(*a, x) super end})
+  extend(Module.new{def splat_kw_splat(*a, **kw) super end})
+  extend(Module.new{def splat_kw_splat_block(*a, **kw, &b) super end})
+  extend(Module.new{def splat_kw(*a, y: 1) super end})
+  extend(Module.new{def splat_kw_block(*a, y: 1, &b) super end})
+benchmark:
+  arg_splat: "arg_splat(1, *ea)"
+  arg_splat_block: "arg_splat_block(1, *ea, &b)"
+  arg_splat_post: "arg_splat_post(1, *ea, &b)"
+  splat_kw_splat: "splat_kw_splat(*a, **kw)"
+  splat_kw_splat_block: "splat_kw_splat_block(*a, **kw, &b)"
+  splat_kw: "splat_kw(*a, y: 1)"
+  splat_kw_block: "splat_kw_block(*a, y: 1, &b)"
diff --git a/bignum.c b/bignum.c
index cf9128d0b3..28924b4eb9 100644
--- a/bignum.c
+++ b/bignum.c
@@ -3,974 +3,6259 @@
   bignum.c -
 
   $Author$
-  $Date$
   created at: Fri Jun 10 00:48:55 JST 1994
 
-  Copyright (C) 1993-2000 Yukihiro Matsumoto
+  Copyright (C) 1993-2007 Yukihiro Matsumoto
 
 **********************************************************************/
 
-#include "ruby.h"
-#include <math.h>
+#include "ruby/internal/config.h"
+
 #include <ctype.h>
+#include <float.h>
+#include <math.h>
 
-VALUE rb_cBignum;
+#ifdef HAVE_STRINGS_H
+# include <strings.h>
+#endif
 
-#if defined __MINGW32__
-#define USHORT _USHORT
+#ifdef HAVE_IEEEFP_H
+# include <ieeefp.h>
 #endif
 
-typedef unsigned short USHORT;
+#if !defined(USE_GMP)
+#if defined(HAVE_LIBGMP) && defined(HAVE_GMP_H)
+# define USE_GMP 1
+#else
+# define USE_GMP 0
+#endif
+#endif
 
-#define BDIGITS(x) ((USHORT*)RBIGNUM(x)->digits)
-#define BITSPERDIG (sizeof(short)*CHAR_BIT)
-#define BIGRAD (1L << BITSPERDIG)
-#define DIGSPERLONG ((unsigned int)(sizeof(long)/sizeof(short)))
-#define BIGUP(x) ((unsigned long)(x) << BITSPERDIG)
-#define BIGDN(x) RSHIFT(x,BITSPERDIG)
-#define BIGLO(x) ((USHORT)((x) & (BIGRAD-1)))
+#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"
+
+#if USE_GMP
+RBIMPL_WARNING_PUSH()
+# ifdef _MSC_VER
+RBIMPL_WARNING_IGNORED(4146) /* for mpn_neg() */
+# endif
+# include <gmp.h>
+RBIMPL_WARNING_POP()
+#endif
 
-static VALUE
-bignew_1(klass, len, sign)
-    VALUE klass;
-    long len;
-    char sign;
+static const bool debug_integer_pack = (
+#ifdef DEBUG_INTEGER_PACK
+    DEBUG_INTEGER_PACK+0
+#else
+    RUBY_DEBUG
+#endif
+    ) != 0;
+
+const char ruby_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";
+
+/* Two-digit decimal lookup table.  Offset 2*n holds the ASCII pair for
+ * n in the range 0..99.  Used by both rb_fix2str in numeric.c and
+ * big2str_2bdigits below to emit two base-10 digits per iteration. */
+const char ruby_decimal_digit_pairs[201] =
+    "00010203040506070809"
+    "10111213141516171819"
+    "20212223242526272829"
+    "30313233343536373839"
+    "40414243444546474849"
+    "50515253545556575859"
+    "60616263646566676869"
+    "70717273747576777879"
+    "80818283848586878889"
+    "90919293949596979899";
+
+#ifndef SIZEOF_BDIGIT_DBL
+# if SIZEOF_INT*2 <= SIZEOF_LONG_LONG
+#  define SIZEOF_BDIGIT_DBL SIZEOF_LONG_LONG
+# else
+#  define SIZEOF_BDIGIT_DBL SIZEOF_LONG
+# endif
+#endif
+
+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_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);
+
+#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_BDIGIT % SIZEOF_LONG == 0);
+#endif
+
+#ifdef WORDS_BIGENDIAN
+#   define HOST_BIGENDIAN_P 1
+#else
+#   define HOST_BIGENDIAN_P 0
+#endif
+/* (!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) (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)
+#define BIGUP(x) LSHIFTX(((x) + (BDIGIT_DBL)0), BITSPERDIG)
+#define BIGDN(x) RSHIFT((x),BITSPERDIG)
+#define BIGLO(x) ((BDIGIT)((x) & BDIGMAX))
+#define BDIGMAX ((BDIGIT)(BIGRAD-1))
+#define BDIGIT_DBL_MAX (~(BDIGIT_DBL)0)
+
+#if SIZEOF_BDIGIT == 2
+#   define swap_bdigit(x) swap16(x)
+#elif SIZEOF_BDIGIT == 4
+#   define swap_bdigit(x) swap32(x)
+#elif SIZEOF_BDIGIT == 8
+#   define swap_bdigit(x) swap64(x)
+#endif
+
+#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 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_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 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_cInteger,(len),(sign))
+
+#define BDIGITS_ZERO(ptr, n) do { \
+  BDIGIT *bdigitz_zero_ptr = (ptr); \
+  size_t bdigitz_zero_n = (n); \
+  while (bdigitz_zero_n) { \
+    *bdigitz_zero_ptr++ = 0; \
+    bdigitz_zero_n--; \
+  } \
+} 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
+
+#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, size_t xn, BDIGIT y);
+
+static VALUE bignew_1(VALUE klass, size_t len, int sign);
+static inline VALUE bigtrunc(VALUE x);
+
+static VALUE bigsq(VALUE x);
+static inline VALUE power_cache_get_power(int base, int power_level, size_t *numdigits_ret);
+
+#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))
+#define U32(a) ((uint32_t)(a))
+#ifdef HAVE_UINT64_T
+#define U64(a,b) (((uint64_t)(a) << 32) | (b))
+#endif
+#ifdef HAVE_UINT128_T
+#define U128(a,b,c,d) (((uint128_t)U64(a,b) << 64) | U64(c,d))
+#endif
+
+/* The following script, maxpow.rb, generates the tables follows.
+
+def big(n, bits)
+  ns = []
+  ((bits+31)/32).times {
+    ns << sprintf("0x%08x", n & 0xffff_ffff)
+    n >>= 32
+  }
+  "U#{bits}(" + ns.reverse.join(",") + ")"
+end
+def values(ary, width, indent)
+  lines = [""]
+  ary.each {|e|
+    lines << "" if !ary.last.empty? && width < (lines.last + e + ", ").length
+    lines.last << e + ", "
+  }
+  lines.map {|line| " " * indent + line.chomp(" ") + "\n" }.join
+end
+[16,32,64,128].each {|bits|
+  max = 2**bits-1
+  exps = []
+  nums = []
+  2.upto(36) {|base|
+    exp = 0
+    n = 1
+    while n * base <= max
+      exp += 1
+      n *= base
+    end
+    exps << exp.to_s
+    nums << big(n, bits)
+  }
+  puts "#ifdef HAVE_UINT#{bits}_T"
+  puts "static const int maxpow#{bits}_exp[35] = {"
+  print values(exps, 70, 4)
+  puts "};"
+  puts "static const uint#{bits}_t maxpow#{bits}_num[35] = {"
+  print values(nums, 70, 4)
+  puts "};"
+  puts "#endif"
+}
+
+ */
+
+#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,
+};
+static const uint16_t maxpow16_num[35] = {
+    U16(0x00008000), U16(0x0000e6a9), U16(0x00004000), U16(0x00003d09),
+    U16(0x0000b640), U16(0x000041a7), U16(0x00008000), U16(0x0000e6a9),
+    U16(0x00002710), U16(0x00003931), U16(0x00005100), U16(0x00006f91),
+    U16(0x00009610), U16(0x0000c5c1), U16(0x00001000), U16(0x00001331),
+    U16(0x000016c8), U16(0x00001acb), U16(0x00001f40), U16(0x0000242d),
+    U16(0x00002998), U16(0x00002f87), U16(0x00003600), U16(0x00003d09),
+    U16(0x000044a8), U16(0x00004ce3), U16(0x000055c0), U16(0x00005f45),
+    U16(0x00006978), U16(0x0000745f), U16(0x00008000), U16(0x00008c61),
+    U16(0x00009988), U16(0x0000a77b), U16(0x0000b640),
+};
+#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,
+};
+static const uint32_t maxpow32_num[35] = {
+    U32(0x80000000), U32(0xcfd41b91), U32(0x40000000), U32(0x48c27395),
+    U32(0x81bf1000), U32(0x75db9c97), U32(0x40000000), U32(0xcfd41b91),
+    U32(0x3b9aca00), U32(0x8c8b6d2b), U32(0x19a10000), U32(0x309f1021),
+    U32(0x57f6c100), U32(0x98c29b81), U32(0x10000000), U32(0x18754571),
+    U32(0x247dbc80), U32(0x3547667b), U32(0x4c4b4000), U32(0x6b5a6e1d),
+    U32(0x94ace180), U32(0xcaf18367), U32(0x0b640000), U32(0x0e8d4a51),
+    U32(0x1269ae40), U32(0x17179149), U32(0x1cb91000), U32(0x23744899),
+    U32(0x2b73a840), U32(0x34e63b41), U32(0x40000000), U32(0x4cfa3cc1),
+    U32(0x5c13d840), U32(0x6d91b519), U32(0x81bf1000),
+};
+#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,
+    12,
+};
+static const uint64_t maxpow64_num[35] = {
+    U64(0x80000000,0x00000000), U64(0xa8b8b452,0x291fe821),
+    U64(0x40000000,0x00000000), U64(0x6765c793,0xfa10079d),
+    U64(0x41c21cb8,0xe1000000), U64(0x36427987,0x50226111),
+    U64(0x80000000,0x00000000), U64(0xa8b8b452,0x291fe821),
+    U64(0x8ac72304,0x89e80000), U64(0x4d28cb56,0xc33fa539),
+    U64(0x1eca170c,0x00000000), U64(0x780c7372,0x621bd74d),
+    U64(0x1e39a505,0x7d810000), U64(0x5b27ac99,0x3df97701),
+    U64(0x10000000,0x00000000), U64(0x27b95e99,0x7e21d9f1),
+    U64(0x5da0e1e5,0x3c5c8000), U64(0xd2ae3299,0xc1c4aedb),
+    U64(0x16bcc41e,0x90000000), U64(0x2d04b7fd,0xd9c0ef49),
+    U64(0x5658597b,0xcaa24000), U64(0xa0e20737,0x37609371),
+    U64(0x0c29e980,0x00000000), U64(0x14adf4b7,0x320334b9),
+    U64(0x226ed364,0x78bfa000), U64(0x383d9170,0xb85ff80b),
+    U64(0x5a3c23e3,0x9c000000), U64(0x8e651373,0x88122bcd),
+    U64(0xdd41bb36,0xd259e000), U64(0x0aee5720,0xee830681),
+    U64(0x10000000,0x00000000), U64(0x172588ad,0x4f5f0981),
+    U64(0x211e44f7,0xd02c1000), U64(0x2ee56725,0xf06e5c71),
+    U64(0x41c21cb8,0xe1000000),
+};
+#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,
+    24,
+};
+static const uint128_t maxpow128_num[35] = {
+    U128(0x80000000,0x00000000,0x00000000,0x00000000),
+    U128(0x6f32f1ef,0x8b18a2bc,0x3cea5978,0x9c79d441),
+    U128(0x40000000,0x00000000,0x00000000,0x00000000),
+    U128(0xd0cf4b50,0xcfe20765,0xfff4b4e3,0xf741cf6d),
+    U128(0x6558e2a0,0x921fe069,0x42860000,0x00000000),
+    U128(0x5080c7b7,0xd0e31ba7,0x5911a67d,0xdd3d35e7),
+    U128(0x40000000,0x00000000,0x00000000,0x00000000),
+    U128(0x6f32f1ef,0x8b18a2bc,0x3cea5978,0x9c79d441),
+    U128(0x4b3b4ca8,0x5a86c47a,0x098a2240,0x00000000),
+    U128(0xffd1390a,0x0adc2fb8,0xdabbb817,0x4d95c99b),
+    U128(0x2c6fdb36,0x4c25e6c0,0x00000000,0x00000000),
+    U128(0x384bacd6,0x42c343b4,0xe90c4272,0x13506d29),
+    U128(0x31f5db32,0xa34aced6,0x0bf13a0e,0x00000000),
+    U128(0x20753ada,0xfd1e839f,0x53686d01,0x3143ee01),
+    U128(0x10000000,0x00000000,0x00000000,0x00000000),
+    U128(0x68ca11d6,0xb4f6d1d1,0xfaa82667,0x8073c2f1),
+    U128(0x223e493b,0xb3bb69ff,0xa4b87d6c,0x40000000),
+    U128(0xad62418d,0x14ea8247,0x01c4b488,0x6cc66f59),
+    U128(0x2863c1f5,0xcdae42f9,0x54000000,0x00000000),
+    U128(0xa63fd833,0xb9386b07,0x36039e82,0xbe651b25),
+    U128(0x1d1f7a9c,0xd087a14d,0x28cdf3d5,0x10000000),
+    U128(0x651b5095,0xc2ea8fc1,0xb30e2c57,0x77aaf7e1),
+    U128(0x0ddef20e,0xff760000,0x00000000,0x00000000),
+    U128(0x29c30f10,0x29939b14,0x6664242d,0x97d9f649),
+    U128(0x786a435a,0xe9558b0e,0x6aaf6d63,0xa8000000),
+    U128(0x0c5afe6f,0xf302bcbf,0x94fd9829,0xd87f5079),
+    U128(0x1fce575c,0xe1692706,0x07100000,0x00000000),
+    U128(0x4f34497c,0x8597e144,0x36e91802,0x00528229),
+    U128(0xbf3a8e1d,0x41ef2170,0x7802130d,0x84000000),
+    U128(0x0e7819e1,0x7f1eb0fb,0x6ee4fb89,0x01d9531f),
+    U128(0x20000000,0x00000000,0x00000000,0x00000000),
+    U128(0x4510460d,0xd9e879c0,0x14a82375,0x2f22b321),
+    U128(0x91abce3c,0x4b4117ad,0xe76d35db,0x22000000),
+    U128(0x08973ea3,0x55d75bc2,0x2e42c391,0x727d69e1),
+    U128(0x10e425c5,0x6daffabc,0x35c10000,0x00000000),
+};
+#endif
+
+static BDIGIT_DBL
+maxpow_in_bdigit_dbl(int base, int *exp_ret)
+{
+    BDIGIT_DBL maxpow;
+    int exponent;
+
+    RUBY_ASSERT(2 <= base && base <= 36);
+
+    {
+#if SIZEOF_BDIGIT_DBL == 2
+        maxpow = maxpow16_num[base-2];
+        exponent = maxpow16_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 4
+        maxpow = maxpow32_num[base-2];
+        exponent = maxpow32_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 8 && defined HAVE_UINT64_T
+        maxpow = maxpow64_num[base-2];
+        exponent = maxpow64_exp[base-2];
+#elif SIZEOF_BDIGIT_DBL == 16 && defined HAVE_UINT128_T
+        maxpow = maxpow128_num[base-2];
+        exponent = maxpow128_exp[base-2];
+#else
+        maxpow = base;
+        exponent = 1;
+        while (maxpow <= BDIGIT_DBL_MAX / base) {
+            maxpow *= base;
+            exponent++;
+        }
+#endif
+    }
+
+    *exp_ret = exponent;
+    return maxpow;
+}
+
+static inline BDIGIT_DBL
+bary2bdigitdbl(const BDIGIT *ds, size_t n)
+{
+    RUBY_ASSERT(n <= 2);
+
+    if (n == 2)
+        return ds[0] | BIGUP(ds[1]);
+    if (n == 1)
+        return ds[0];
+    return 0;
+}
+
+static inline void
+bdigitdbl2bary(BDIGIT *ds, size_t n, BDIGIT_DBL num)
+{
+    RUBY_ASSERT(n == 2);
+
+    ds[0] = BIGLO(num);
+    ds[1] = (BDIGIT)BIGDN(num);
+}
+
+static int
+bary_cmp(const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+    BARY_TRUNC(xds, xn);
+    BARY_TRUNC(yds, yn);
+
+    if (xn < yn)
+        return -1;
+    if (xn > yn)
+        return 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 - i - 1] < yds[yn - i - 1] ? -1 : 1;
+}
+
+static BDIGIT
+bary_small_lshift(BDIGIT *zds, const BDIGIT *xds, size_t n, int shift)
+{
+    size_t i;
+    BDIGIT_DBL num = 0;
+    RUBY_ASSERT(0 <= shift && shift < BITSPERDIG);
+
+    for (i=0; i<n; i++) {
+        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, BDIGIT higher_bdigit)
+{
+    size_t i;
+    BDIGIT_DBL num = 0;
+
+    RUBY_ASSERT(0 <= shift && shift < BITSPERDIG);
+
+    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(const BDIGIT *xds, size_t xn)
+{
+    if (xn == 0)
+        return 1;
+    do {
+        if (xds[--xn]) return 0;
+    } while (xn);
+    return 1;
+}
+
+static void
+bary_neg(BDIGIT *ds, size_t 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;
+    for (i = 0; i < n; i++) {
+        if (ds[i] != 0) {
+            goto non_zero;
+        }
+    }
+    return 1;
+
+  non_zero:
+    ds[i] = BIGLO(~ds[i] + 1);
+    i++;
+    for (; i < n; i++) {
+        ds[i] = BIGLO(~ds[i]);
+    }
+    return 0;
+}
+
+static void
+bary_swap(BDIGIT *ds, size_t num_bdigits)
+{
+    BDIGIT *p1 = ds;
+    BDIGIT *p2 = ds + num_bdigits - 1;
+    for (; p1 < p2; p1++, p2--) {
+        BDIGIT tmp = *p1;
+        *p1 = *p2;
+        *p2 = tmp;
+    }
+}
+
+#define INTEGER_PACK_WORDORDER_MASK \
+    (INTEGER_PACK_MSWORD_FIRST | \
+     INTEGER_PACK_LSWORD_FIRST)
+#define INTEGER_PACK_BYTEORDER_MASK \
+    (INTEGER_PACK_MSBYTE_FIRST | \
+     INTEGER_PACK_LSBYTE_FIRST | \
+     INTEGER_PACK_NATIVE_BYTE_ORDER)
+
+static void
+validate_integer_pack_format(size_t numwords, size_t wordsize, size_t nails, int flags, int supported_flags)
+{
+    int wordorder_bits = flags & INTEGER_PACK_WORDORDER_MASK;
+    int byteorder_bits = flags & INTEGER_PACK_BYTEORDER_MASK;
+
+    if (flags & ~supported_flags) {
+        rb_raise(rb_eArgError, "unsupported flags specified");
+    }
+    if (wordorder_bits == 0) {
+        if (1 < numwords)
+            rb_raise(rb_eArgError, "word order not specified");
+    }
+    else if (wordorder_bits != INTEGER_PACK_MSWORD_FIRST &&
+        wordorder_bits != INTEGER_PACK_LSWORD_FIRST)
+        rb_raise(rb_eArgError, "unexpected word order");
+    if (byteorder_bits == 0) {
+        rb_raise(rb_eArgError, "byte order not specified");
+    }
+    else if (byteorder_bits != INTEGER_PACK_MSBYTE_FIRST &&
+        byteorder_bits != INTEGER_PACK_LSBYTE_FIRST &&
+        byteorder_bits != INTEGER_PACK_NATIVE_BYTE_ORDER)
+        rb_raise(rb_eArgError, "unexpected byte order");
+    if (wordsize == 0)
+        rb_raise(rb_eArgError, "invalid wordsize: %"PRI_SIZE_PREFIX"u", wordsize);
+    if (SSIZE_MAX < wordsize)
+        rb_raise(rb_eArgError, "too big wordsize: %"PRI_SIZE_PREFIX"u", wordsize);
+    if (wordsize <= nails / CHAR_BIT)
+        rb_raise(rb_eArgError, "too big nails: %"PRI_SIZE_PREFIX"u", nails);
+    if (SIZE_MAX / wordsize < numwords)
+        rb_raise(rb_eArgError, "too big numwords * wordsize: %"PRI_SIZE_PREFIX"u * %"PRI_SIZE_PREFIX"u", numwords, wordsize);
+}
+
+static void
+integer_pack_loop_setup(
+    size_t numwords, size_t wordsize, size_t nails, int flags,
+    size_t *word_num_fullbytes_ret,
+    int *word_num_partialbits_ret,
+    size_t *word_start_ret,
+    ssize_t *word_step_ret,
+    size_t *word_last_ret,
+    size_t *byte_start_ret,
+    int *byte_step_ret)
+{
+    int wordorder_bits = flags & INTEGER_PACK_WORDORDER_MASK;
+    int byteorder_bits = flags & INTEGER_PACK_BYTEORDER_MASK;
+    size_t word_num_fullbytes;
+    int word_num_partialbits;
+    size_t word_start;
+    ssize_t word_step;
+    size_t word_last;
+    size_t byte_start;
+    int byte_step;
+
+    word_num_partialbits = CHAR_BIT - (int)(nails % CHAR_BIT);
+    if (word_num_partialbits == CHAR_BIT)
+        word_num_partialbits = 0;
+    word_num_fullbytes = wordsize - (nails / CHAR_BIT);
+    if (word_num_partialbits != 0) {
+        word_num_fullbytes--;
+    }
+
+    if (wordorder_bits == INTEGER_PACK_MSWORD_FIRST) {
+        word_start = wordsize*(numwords-1);
+        word_step = -(ssize_t)wordsize;
+        word_last = 0;
+    }
+    else {
+        word_start = 0;
+        word_step = wordsize;
+        word_last = wordsize*(numwords-1);
+    }
+
+    if (byteorder_bits == INTEGER_PACK_NATIVE_BYTE_ORDER) {
+#ifdef WORDS_BIGENDIAN
+        byteorder_bits = INTEGER_PACK_MSBYTE_FIRST;
+#else
+        byteorder_bits = INTEGER_PACK_LSBYTE_FIRST;
+#endif
+    }
+    if (byteorder_bits == INTEGER_PACK_MSBYTE_FIRST) {
+        byte_start = wordsize-1;
+        byte_step = -1;
+    }
+    else {
+        byte_start = 0;
+        byte_step = 1;
+    }
+
+    *word_num_partialbits_ret = word_num_partialbits;
+    *word_num_fullbytes_ret = word_num_fullbytes;
+    *word_start_ret = word_start;
+    *word_step_ret = word_step;
+    *word_last_ret = word_last;
+    *byte_start_ret = byte_start;
+    *byte_step_ret = byte_step;
+}
+
+static inline void
+integer_pack_fill_dd(BDIGIT **dpp, BDIGIT **dep, BDIGIT_DBL *ddp, int *numbits_in_dd_p)
+{
+    if (*dpp < *dep && BITSPERDIG <= (int)sizeof(*ddp) * CHAR_BIT - *numbits_in_dd_p) {
+        *ddp |= (BDIGIT_DBL)(*(*dpp)++) << *numbits_in_dd_p;
+        *numbits_in_dd_p += BITSPERDIG;
+    }
+    else if (*dpp == *dep) {
+        /* higher bits are infinity zeros */
+        *numbits_in_dd_p = (int)sizeof(*ddp) * CHAR_BIT;
+    }
+}
+
+static inline BDIGIT_DBL
+integer_pack_take_lowbits(int n, BDIGIT_DBL *ddp, int *numbits_in_dd_p)
+{
+    BDIGIT_DBL ret;
+    ret = (*ddp) & (((BDIGIT_DBL)1 << n) - 1);
+    *ddp >>= n;
+    *numbits_in_dd_p -= n;
+    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++) {
+        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)
+            return 0;
+    }
+    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)
+{
+    BDIGIT *dp, *de;
+    unsigned char *buf, *bufend;
+
+    dp = ds;
+    de = ds + num_bdigits;
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    while (dp < de && de[-1] == 0)
+        de--;
+    if (dp == de) {
+        sign = 0;
+    }
+
+    if (!(flags & INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION)) {
+        if (sign == 0) {
+            MEMZERO(words, unsigned char, numwords * wordsize);
+            return 0;
+        }
+        if (nails == 0 && numwords == 1) {
+            int need_swap = wordsize != 1 &&
+                (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_NATIVE_BYTE_ORDER &&
+                ((flags & INTEGER_PACK_MSBYTE_FIRST) ? !HOST_BIGENDIAN_P : HOST_BIGENDIAN_P);
+            if (0 < sign || !(flags & INTEGER_PACK_2COMP)) {
+                BDIGIT d;
+                if (wordsize == 1) {
+                    *((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_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_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_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;
+                    return ((1 < de - dp || CLEAR_LOWBITS(d, 64) != 0) ? 2 : 1) * sign;
+                }
+#endif
+            }
+            else { /* sign < 0 && (flags & INTEGER_PACK_2COMP) */
+                BDIGIT_DBL_SIGNED d;
+                if (wordsize == 1) {
+                    *((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_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_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_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_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_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_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_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_BDIGIT;
+            size_t dst_size = numwords * wordsize;
+            int overflow = 0;
+            while (0 < src_size && ((unsigned char *)ds)[src_size-1] == 0)
+                src_size--;
+            if (src_size <= dst_size) {
+                MEMCPY(words, dp, char, src_size);
+                MEMZERO((char*)words + src_size, char, dst_size - src_size);
+            }
+            else {
+                MEMCPY(words, dp, char, dst_size);
+                overflow = 1;
+            }
+            if (sign < 0 && (flags & INTEGER_PACK_2COMP)) {
+                int zero_p = bytes_2comp(words, dst_size);
+                if (zero_p && overflow) {
+                    unsigned char *p = (unsigned char *)dp;
+                    if (dst_size == src_size-1 &&
+                        p[dst_size] == 1) {
+                        overflow = 0;
+                    }
+                }
+            }
+            if (overflow)
+                sign *= 2;
+            return sign;
+        }
+#endif
+        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;
+            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;
+            if (src_num_bdigits <= dst_num_bdigits) {
+                MEMCPY(words, dp, BDIGIT, src_num_bdigits);
+                BDIGITS_ZERO((BDIGIT*)words + src_num_bdigits, dst_num_bdigits - src_num_bdigits);
+            }
+            else {
+                MEMCPY(words, dp, BDIGIT, dst_num_bdigits);
+                overflow = 1;
+            }
+            if (sign < 0 && (flags & INTEGER_PACK_2COMP)) {
+                int zero_p = bary_2comp(words, dst_num_bdigits);
+                if (zero_p && overflow &&
+                    dst_num_bdigits == src_num_bdigits-1 &&
+                    dp[dst_num_bdigits] == 1)
+                    overflow = 0;
+            }
+            if (msbytefirst_p != HOST_BIGENDIAN_P) {
+                size_t i;
+                for (i = 0; i < dst_num_bdigits; i++) {
+                    BDIGIT d = ((BDIGIT*)words)[i];
+                    ((BDIGIT*)words)[i] = swap_bdigit(d);
+                }
+            }
+            if (mswordfirst_p ? !msbytefirst_p : msbytefirst_p) {
+                size_t i;
+                BDIGIT *p = words;
+                for (i = 0; i < numwords; i++) {
+                    bary_swap(p, bdigits_per_word);
+                    p += bdigits_per_word;
+                }
+            }
+            if (mswordfirst_p) {
+                bary_swap(words, dst_num_bdigits);
+            }
+            if (overflow)
+                sign *= 2;
+            return sign;
+        }
+    }
+
+    buf = words;
+    bufend = buf + numwords * wordsize;
+
+    if (buf == bufend) {
+        /* overflow if non-zero*/
+        if (!(flags & INTEGER_PACK_2COMP) || 0 <= sign)
+            sign *= 2;
+        else {
+            if (de - dp == 1 && dp[0] == 1)
+                sign = -1; /* val == -1 == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+            else
+                sign = -2; /* val < -1 == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+        }
+    }
+    else if (dp == de) {
+        memset(buf, '\0', bufend - buf);
+    }
+    else if (dp < de && buf < bufend) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        unsigned char *wordp, *last_wordp;
+        BDIGIT_DBL dd;
+        int numbits_in_dd;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        dd = 0;
+        numbits_in_dd = 0;
+
+#define FILL_DD \
+    integer_pack_fill_dd(&dp, &de, &dd, &numbits_in_dd)
+#define TAKE_LOWBITS(n) \
+    integer_pack_take_lowbits(n, &dd, &numbits_in_dd)
+
+        while (1) {
+            size_t index_in_word = 0;
+            unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                FILL_DD;
+                *bytep = TAKE_LOWBITS(CHAR_BIT);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                FILL_DD;
+                *bytep = TAKE_LOWBITS(word_num_partialbits);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            while (index_in_word < wordsize) {
+                *bytep = 0;
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+        FILL_DD;
+        /* overflow tests */
+        if (dp != de || 1 < dd) {
+            /* 2**(numwords*(wordsize*CHAR_BIT-nails)+1) <= abs(val) */
+            sign *= 2;
+        }
+        else if (dd == 1) {
+            /* 2**(numwords*(wordsize*CHAR_BIT-nails)) <= abs(val) < 2**(numwords*(wordsize*CHAR_BIT-nails)+1) */
+            if (!(flags & INTEGER_PACK_2COMP) || 0 <= sign)
+                sign *= 2;
+            else { /* overflow_2comp && sign == -1 */
+                /* test lower bits are all zero. */
+                dp = ds;
+                while (dp < de && *dp == 0)
+                    dp++;
+                if (de - dp == 1 && /* only one non-zero word. */
+                    POW2_P(*dp)) /* *dp contains only one bit set. */
+                    sign = -1; /* val == -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+                else
+                    sign = -2; /* val < -2**(numwords*(wordsize*CHAR_BIT-nails)) */
+            }
+        }
+    }
+
+    if ((flags & INTEGER_PACK_2COMP) && (sign < 0 && numwords != 0)) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        unsigned char *wordp, *last_wordp;
+
+        unsigned int partialbits_mask;
+        int carry;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        partialbits_mask = (1 << word_num_partialbits) - 1;
+
+        buf = words;
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        carry = 1;
+        while (1) {
+            size_t index_in_word = 0;
+            unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                carry += (unsigned char)~*bytep;
+                *bytep = (unsigned char)carry;
+                carry >>= CHAR_BIT;
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                carry += (*bytep & partialbits_mask) ^ partialbits_mask;
+                *bytep = carry & partialbits_mask;
+                carry >>= word_num_partialbits;
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+    }
+
+    return sign;
+#undef FILL_DD
+#undef TAKE_LOWBITS
+}
+
+static size_t
+integer_unpack_num_bdigits_small(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    /* nlp_bits stands for number of leading padding bits */
+    size_t num_bits = (wordsize * CHAR_BIT - nails) * numwords;
+    size_t num_bdigits = roomof(num_bits, BITSPERDIG);
+    *nlp_bits_ret = (int)(num_bdigits * BITSPERDIG - num_bits);
+    return num_bdigits;
+}
+
+static size_t
+integer_unpack_num_bdigits_generic(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    /* BITSPERDIG = SIZEOF_BDIGIT * CHAR_BIT */
+    /* num_bits = (wordsize * CHAR_BIT - nails) * numwords */
+    /* 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;
+
+    /* q1 * CHAR_BIT + r1 = numwords */
+    size_t q1 = numwords / CHAR_BIT;
+    size_t r1 = numwords % CHAR_BIT;
+
+    /* num_bits = CHAR_BIT * num_bytes1 - nails * (q1 * CHAR_BIT + r1) = CHAR_BIT * num_bytes2 - nails * r1 */
+    size_t num_bytes2 = num_bytes1 - nails * q1;
+
+    /* q2 * CHAR_BIT + r2 = nails */
+    size_t q2 = nails / CHAR_BIT;
+    size_t r2 = nails % CHAR_BIT;
+
+    /* num_bits = CHAR_BIT * num_bytes2 - (q2 * CHAR_BIT + r2) * r1 = CHAR_BIT * num_bytes3 - r1 * r2 */
+    size_t num_bytes3 = num_bytes2 - q2 * r1;
+
+    /* q3 * BITSPERDIG + r3 = num_bytes3 */
+    size_t q3 = num_bytes3 / BITSPERDIG;
+    size_t r3 = num_bytes3 % BITSPERDIG;
+
+    /* num_bits = CHAR_BIT * (q3 * BITSPERDIG + r3) - r1 * r2 = BITSPERDIG * num_digits1 + CHAR_BIT * r3 - r1 * r2 */
+    size_t num_digits1 = CHAR_BIT * q3;
+
+    /*
+     * if CHAR_BIT * r3 >= r1 * r2
+     *   CHAR_BIT * r3 - r1 * r2 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2))
+     *   q4 * BITSPERDIG + r4 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2)
+     *   num_bits = BITSPERDIG * num_digits1 + CHAR_BIT * BITSPERDIG - (q4 * BITSPERDIG + r4) = BITSPERDIG * num_digits2 - r4
+     * else
+     *   q4 * BITSPERDIG + r4 = -(CHAR_BIT * r3 - r1 * r2)
+     *   num_bits = BITSPERDIG * num_digits1 - (q4 * BITSPERDIG + r4) = BITSPERDIG * num_digits2 - r4
+     * end
+     */
+
+    if (CHAR_BIT * r3 >= r1 * r2) {
+        size_t tmp1 = CHAR_BIT * BITSPERDIG - (CHAR_BIT * r3 - r1 * r2);
+        size_t q4 = tmp1 / BITSPERDIG;
+        int r4 = (int)(tmp1 % BITSPERDIG);
+        size_t num_digits2 = num_digits1 + CHAR_BIT - q4;
+        *nlp_bits_ret = r4;
+        return num_digits2;
+    }
+    else {
+        size_t tmp1 = r1 * r2 - CHAR_BIT * r3;
+        size_t q4 = tmp1 / BITSPERDIG;
+        int r4 = (int)(tmp1 % BITSPERDIG);
+        size_t num_digits2 = num_digits1 - q4;
+        *nlp_bits_ret = r4;
+        return num_digits2;
+    }
+}
+
+static size_t
+integer_unpack_num_bdigits(size_t numwords, size_t wordsize, size_t nails, int *nlp_bits_ret)
+{
+    size_t num_bdigits;
+
+    if (numwords <= (SIZE_MAX - (BITSPERDIG-1)) / CHAR_BIT / wordsize) {
+        num_bdigits = integer_unpack_num_bdigits_small(numwords, wordsize, nails, nlp_bits_ret);
+        if (debug_integer_pack) {
+            int nlp_bits1;
+            size_t num_bdigits1 = integer_unpack_num_bdigits_generic(numwords, wordsize, nails, &nlp_bits1);
+            RUBY_ASSERT(num_bdigits == num_bdigits1);
+            RUBY_ASSERT(*nlp_bits_ret == nlp_bits1);
+            (void)num_bdigits1;
+        }
+    }
+    else {
+        num_bdigits = integer_unpack_num_bdigits_generic(numwords, wordsize, nails, nlp_bits_ret);
+    }
+    return num_bdigits;
+}
+
+static inline void
+integer_unpack_push_bits(int data, int numbits, BDIGIT_DBL *ddp, int *numbits_in_dd_p, BDIGIT **dpp)
+{
+    (*ddp) |= ((BDIGIT_DBL)data) << (*numbits_in_dd_p);
+    *numbits_in_dd_p += numbits;
+    while (BITSPERDIG <= *numbits_in_dd_p) {
+        *(*dpp)++ = BIGLO(*ddp);
+        *ddp = BIGDN(*ddp);
+        *numbits_in_dd_p -= BITSPERDIG;
+    }
+}
+
+static int
+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_BDIGIT && u == 0) ? -2 : -1) :
+            ((u >> (size * CHAR_BIT - 1)) ? -1 : 1);
+        if (sign < 0) {
+            u |= LSHIFTX(BDIGMAX, size * CHAR_BIT);
+            u = BIGLO(1 + ~u);
+        }
+    }
+    else
+        sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+    *dp = u;
+    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)
+{
+    int sign;
+    const unsigned char *buf = words;
+    BDIGIT *dp;
+    BDIGIT *de;
+
+    dp = bdigits;
+    de = dp + num_bdigits;
+
+    if (!(flags & INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION)) {
+        if (nails == 0 && numwords == 1) {
+            int need_swap = wordsize != 1 &&
+                (flags & INTEGER_PACK_BYTEORDER_MASK) != INTEGER_PACK_NATIVE_BYTE_ORDER &&
+                ((flags & INTEGER_PACK_MSBYTE_FIRST) ? !HOST_BIGENDIAN_P : HOST_BIGENDIAN_P);
+            if (wordsize == 1) {
+                return integer_unpack_single_bdigit(*(uint8_t *)buf, sizeof(uint8_t), flags, dp);
+            }
+#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_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_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_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_BDIGIT;
+            MEMCPY(dp, words, char, src_size);
+            if (flags & INTEGER_PACK_2COMP) {
+                if (flags & INTEGER_PACK_NEGATIVE) {
+                    int zero_p;
+                    memset((char*)dp + src_size, 0xff, dst_size - src_size);
+                    zero_p = bary_2comp(dp, num_bdigits);
+                    sign = zero_p ? -2 : -1;
+                }
+                else if (buf[src_size-1] >> (CHAR_BIT-1)) {
+                    memset((char*)dp + src_size, 0xff, dst_size - src_size);
+                    bary_2comp(dp, num_bdigits);
+                    sign = -1;
+                }
+                else {
+                    MEMZERO((char*)dp + src_size, char, dst_size - src_size);
+                    sign = 1;
+                }
+            }
+            else {
+                MEMZERO((char*)dp + src_size, char, dst_size - src_size);
+                sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+            }
+            return sign;
+        }
+#endif
+        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;
+            MEMCPY(dp, words, BDIGIT, numwords*bdigits_per_word);
+            if (mswordfirst_p) {
+                bary_swap(dp, num_bdigits);
+            }
+            if (mswordfirst_p ? !msbytefirst_p : msbytefirst_p) {
+                size_t i;
+                BDIGIT *p = dp;
+                for (i = 0; i < numwords; i++) {
+                    bary_swap(p, bdigits_per_word);
+                    p += bdigits_per_word;
+                }
+            }
+            if (msbytefirst_p != HOST_BIGENDIAN_P) {
+                BDIGIT *p;
+                for (p = dp; p < de; p++) {
+                    BDIGIT d = *p;
+                    *p = swap_bdigit(d);
+                }
+            }
+            if (flags & INTEGER_PACK_2COMP) {
+                if (flags & INTEGER_PACK_NEGATIVE) {
+                    int zero_p = bary_2comp(dp, num_bdigits);
+                    sign = zero_p ? -2 : -1;
+                }
+                else if (BDIGIT_MSB(de[-1])) {
+                    bary_2comp(dp, num_bdigits);
+                    sign = -1;
+                }
+                else {
+                    sign = 1;
+                }
+            }
+            else {
+                sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+            }
+            return sign;
+        }
+    }
+
+    if (num_bdigits != 0) {
+        int word_num_partialbits;
+        size_t word_num_fullbytes;
+
+        ssize_t word_step;
+        size_t byte_start;
+        int byte_step;
+
+        size_t word_start, word_last;
+        const unsigned char *wordp, *last_wordp;
+        BDIGIT_DBL dd;
+        int numbits_in_dd;
+
+        integer_pack_loop_setup(numwords, wordsize, nails, flags,
+            &word_num_fullbytes, &word_num_partialbits,
+            &word_start, &word_step, &word_last, &byte_start, &byte_step);
+
+        wordp = buf + word_start;
+        last_wordp = buf + word_last;
+
+        dd = 0;
+        numbits_in_dd = 0;
+
+#define PUSH_BITS(data, numbits) \
+        integer_unpack_push_bits(data, numbits, &dd, &numbits_in_dd, &dp)
+
+        while (1) {
+            size_t index_in_word = 0;
+            const unsigned char *bytep = wordp + byte_start;
+            while (index_in_word < word_num_fullbytes) {
+                PUSH_BITS(*bytep, CHAR_BIT);
+                bytep += byte_step;
+                index_in_word++;
+            }
+            if (word_num_partialbits) {
+                PUSH_BITS(*bytep & ((1 << word_num_partialbits) - 1), word_num_partialbits);
+                bytep += byte_step;
+                index_in_word++;
+            }
+
+            if (wordp == last_wordp)
+                break;
+
+            wordp += word_step;
+        }
+        if (dd)
+            *dp++ = (BDIGIT)dd;
+        RUBY_ASSERT(dp <= de);
+        while (dp < de)
+            *dp++ = 0;
+#undef PUSH_BITS
+    }
+
+    if (!(flags & INTEGER_PACK_2COMP)) {
+        sign = (flags & INTEGER_PACK_NEGATIVE) ? -1 : 1;
+    }
+    else {
+        if (nlp_bits) {
+            if ((flags & INTEGER_PACK_NEGATIVE) ||
+                (bdigits[num_bdigits-1] >> (BITSPERDIG - nlp_bits - 1))) {
+                bdigits[num_bdigits-1] |= BIGLO(BDIGMAX << (BITSPERDIG - nlp_bits));
+                sign = -1;
+            }
+            else {
+                sign = 1;
+            }
+        }
+        else {
+            if (flags & INTEGER_PACK_NEGATIVE) {
+                sign = bary_zero_p(bdigits, num_bdigits) ? -2 : -1;
+            }
+            else {
+                if (num_bdigits != 0 && BDIGIT_MSB(bdigits[num_bdigits-1]))
+                    sign = -1;
+                else
+                    sign = 1;
+            }
+        }
+        if (sign == -1 && num_bdigits != 0) {
+            bary_2comp(bdigits, num_bdigits);
+        }
+    }
+
+    return sign;
+}
+
+static void
+bary_unpack(BDIGIT *bdigits, size_t num_bdigits, const void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    size_t num_bdigits0;
+    int nlp_bits;
+    int sign;
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_BIGNUM|
+            INTEGER_PACK_NEGATIVE|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    num_bdigits0 = integer_unpack_num_bdigits(numwords, wordsize, nails, &nlp_bits);
+
+    RUBY_ASSERT(num_bdigits0 <= num_bdigits);
+
+    sign = bary_unpack_internal(bdigits, num_bdigits0, words, numwords, wordsize, nails, flags, nlp_bits);
+
+    if (num_bdigits0 < num_bdigits) {
+        BDIGITS_ZERO(bdigits + num_bdigits0, num_bdigits - num_bdigits0);
+        if (sign == -2) {
+            bdigits[num_bdigits0] = 1;
+        }
+    }
+}
+
+static int
+bary_subb(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, int borrow)
+{
+    BDIGIT_DBL_SIGNED num;
+    size_t i;
+    size_t sn;
+
+    RUBY_ASSERT(xn <= zn);
+    RUBY_ASSERT(yn <= zn);
+
+    sn = xn < yn ? xn : yn;
+
+    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);
+    }
+    if (yn <= xn) {
+        for (; i < xn; i++) {
+            if (num == 0) goto num_is_zero;
+            num += xds[i];
+            zds[i] = BIGLO(num);
+            num = BIGDN(num);
+        }
+    }
+    else {
+        for (; i < yn; i++) {
+            num -= yds[i];
+            zds[i] = BIGLO(num);
+            num = BIGDN(num);
+        }
+    }
+    if (num == 0) goto num_is_zero;
+    for (; i < zn; i++) {
+        zds[i] = BDIGMAX;
+    }
+    return 1;
+
+  num_is_zero:
+    if (xds == zds && xn == zn)
+        return 0;
+    for (; i < xn; i++) {
+        zds[i] = xds[i];
+    }
+    for (; i < zn; i++) {
+        zds[i] = 0;
+    }
+    return 0;
+}
+
+static int
+bary_sub(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    return bary_subb(zds, zn, xds, xn, yds, yn, 0);
+}
+
+static int
+bary_sub_one(BDIGIT *zds, size_t zn)
+{
+    return bary_subb(zds, zn, zds, zn, NULL, 0, 1);
+}
+
+static int
+bary_addc(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, int carry)
+{
+    BDIGIT_DBL num;
+    size_t i;
+
+    RUBY_ASSERT(xn <= zn);
+    RUBY_ASSERT(yn <= zn);
+
+    if (xn > yn) {
+        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);
+    }
+    for (; i < yn; i++) {
+        if (num == 0) goto num_is_zero;
+        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);
+    }
+    return num != 0;
+
+  num_is_zero:
+    if (yds == zds && yn == zn)
+        return 0;
+    for (; i < yn; i++) {
+        zds[i] = yds[i];
+    }
+    for (; i < zn; i++) {
+        zds[i] = 0;
+    }
+    return 0;
+}
+
+static int
+bary_add(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    return bary_addc(zds, zn, xds, xn, yds, yn, 0);
+}
+
+static int
+bary_add_one(BDIGIT *ds, size_t n)
+{
+    size_t i;
+    for (i = 0; i < n; i++) {
+        BDIGIT_DBL n = ds[i];
+        n += 1;
+        ds[i] = BIGLO(n);
+        if (ds[i] != 0)
+            return 0;
+    }
+    return 1;
+}
+
+static void
+bary_mul_single(BDIGIT *zds, size_t zn, BDIGIT x, BDIGIT y)
+{
+    BDIGIT_DBL n;
+
+    RUBY_ASSERT(2 <= zn);
+
+    n = (BDIGIT_DBL)x * y;
+    bdigitdbl2bary(zds, 2, n);
+    BDIGITS_ZERO(zds + 2, zn - 2);
+}
+
+static int
+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;
+
+    RUBY_ASSERT(zn > yn);
+
+    if (x == 0)
+        return 0;
+    dd = x;
+    n = 0;
+    for (j = 0; j < yn; j++) {
+        BDIGIT_DBL ee = n + dd * yds[j];
+        if (ee) {
+            n = zds[j] + ee;
+            zds[j] = BIGLO(n);
+            n = BIGDN(n);
+        }
+        else {
+            n = 0;
+        }
+
+    }
+    for (; j < zn; j++) {
+        if (n == 0)
+            break;
+        n += zds[j];
+        zds[j] = BIGLO(n);
+        n = BIGDN(n);
+    }
+    return n != 0;
+}
+
+static BDIGIT_DBL_SIGNED
+bigdivrem_mulsub(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+    BDIGIT_DBL t2;
+    BDIGIT_DBL_SIGNED num;
+
+    RUBY_ASSERT(zn == yn + 1);
+
+    num = 0;
+    t2 = 0;
+    i = 0;
+
+    do {
+        BDIGIT_DBL_SIGNED ee;
+        t2 += (BDIGIT_DBL)yds[i] * x;
+        ee = num - BIGLO(t2);
+        num = (BDIGIT_DBL_SIGNED)zds[i] + ee;
+        if (ee) zds[i] = BIGLO(num);
+        num = BIGDN(num);
+        t2 = BIGDN(t2);
+    } while (++i < yn);
+    num -= (BDIGIT_DBL_SIGNED)t2;
+    num += (BDIGIT_DBL_SIGNED)zds[yn]; /* borrow from high digit; don't update */
+    return num;
+}
+
+static int
+bary_mulsub_1xN(BDIGIT *zds, size_t zn, BDIGIT x, const BDIGIT *yds, size_t yn)
 {
-    NEWOBJ(big, struct RBignum);
-    OBJSETUP(big, klass, T_BIGNUM);
-    big->sign = sign;
-    big->len = len;
-    big->digits = ALLOC_N(USHORT, len);
+    BDIGIT_DBL_SIGNED num;
+
+    RUBY_ASSERT(zn == yn + 1);
 
-    return (VALUE)big;
+    num = bigdivrem_mulsub(zds, zn, x, yds, yn);
+    zds[yn] = BIGLO(num);
+    if (BIGDN(num))
+        return 1;
+    return 0;
 }
 
-#define bignew(len,sign) bignew_1(rb_cBignum,len,sign)
+static void
+bary_mul_normal(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    size_t i;
+
+    RUBY_ASSERT(xn + yn <= zn);
+
+    BDIGITS_ZERO(zds, zn);
+    for (i = 0; i < xn; i++) {
+        bary_muladd_1xN(zds+i, zn-i, xds[i], yds, yn);
+    }
+}
 
 VALUE
-rb_big_clone(x)
-    VALUE x;
+rb_big_mul_normal(VALUE x, VALUE y)
 {
-    VALUE z = bignew_1(CLASS_OF(x), RBIGNUM(x)->len, RBIGNUM(x)->sign);
+    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);
+    return z;
+}
 
-    MEMCPY(BDIGITS(z), BDIGITS(x), USHORT, RBIGNUM(x)->len);
+/* efficient squaring (2 times faster than normal multiplication)
+ * ref: Handbook of Applied Cryptography, Algorithm 14.16
+ *      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)
+{
+    size_t i, j;
+    BDIGIT_DBL c, v, w;
+    BDIGIT vl;
+    int vh;
+
+    RUBY_ASSERT(xn * 2 <= zn);
+
+    BDIGITS_ZERO(zds, zn);
+
+    if (xn == 0)
+        return;
+
+    for (i = 0; i < xn-1; i++) {
+        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;
+        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)
+                c += w;
+        }
+        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 */
+    v = (BDIGIT_DBL)xds[i];
+    if (!v)
+        return;
+    c = (BDIGIT_DBL)zds[i + i] + v * v;
+    zds[i + i] = BIGLO(c);
+    c = BIGDN(c);
+    if (c) {
+        zds[i + xn] += BIGLO(c);
+    }
+}
+
+VALUE
+rb_big_sq_fast(VALUE x)
+{
+    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;
 }
 
-void
-rb_big_2comp(x)			/* get 2's complement */
-    VALUE x;
+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 *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 n;
+
+    RUBY_ASSERT(xn + yn <= zn);
+    RUBY_ASSERT(xn <= yn);
+    RUBY_ASSERT(!KARATSUBA_BALANCED(xn, yn) || !TOOM3_BALANCED(xn, yn));
+
+    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 (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 {
+            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
+            }
+            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);
+        }
+        n += r;
+    }
+    BDIGITS_ZERO(zds+xn+yn, zn - (xn+yn));
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_balance(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_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);
+    return z;
+}
+
+/* multiplication by karatsuba method */
+static void
+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;
+
+    size_t n;
+    int sub_p, borrow, carry1, carry2, carry3;
+
+    int odd_y = 0;
+    int odd_xy = 0;
+    int sq;
+
+    const BDIGIT *xds0, *xds1, *yds0, *yds1;
+    BDIGIT *zds0, *zds1, *zds2, *zds3;
+
+    RUBY_ASSERT(xn + yn <= zn);
+    RUBY_ASSERT(xn <= yn);
+    RUBY_ASSERT(yn < 2 * xn);
+
+    sq = xds == yds && xn == yn;
+
+    if (yn & 1) {
+        odd_y = 1;
+        yn--;
+        if (yn < xn) {
+            odd_xy = 1;
+            xn--;
+        }
+    }
+
+    n = yn / 2;
+
+    RUBY_ASSERT(n < xn);
+
+    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.
+         */
+        wn = 2*n;
+        wds = ALLOCV_N(BDIGIT, work, wn);
+    }
+
+    /* Karatsuba algorithm:
+     *
+     * x = x0 + r*x1
+     * y = y0 + r*y1
+     * z = x*y
+     *   = (x0 + r*x1) * (y0 + r*y1)
+     *   = x0*y0 + r*(x1*y0 + x0*y1) + r*r*x1*y1
+     *   = x0*y0 + r*(x0*y0 + x1*y1 - (x1-x0)*(y1-y0)) + r*r*x1*y1
+     *   = x0*y0 + r*(x0*y0 + x1*y1 - (x0-x1)*(y0-y1)) + r*r*x1*y1
+     */
+
+    xds0 = xds;
+    xds1 = xds + n;
+    yds0 = yds;
+    yds1 = yds + n;
+    zds0 = zds;
+    zds1 = zds + n;
+    zds2 = zds + 2*n;
+    zds3 = zds + 3*n;
+
+    sub_p = 1;
+
+    /* zds0:? zds1:? zds2:? zds3:? wds:? */
+
+    if (bary_sub(zds0, n, xds, n, xds+n, xn-n)) {
+        bary_2comp(zds0, n);
+        sub_p = !sub_p;
+    }
+
+    /* zds0:|x1-x0| zds1:? zds2:? zds3:? wds:? */
+
+    if (sq) {
+        sub_p = 1;
+        bary_mul_karatsuba_start(zds1, 2*n, zds0, n, zds0, n, wds, wn);
+    }
+    else {
+        if (bary_sub(wds, n, yds, n, yds+n, n)) {
+            bary_2comp(wds, n);
+            sub_p = !sub_p;
+        }
+
+        /* zds0:|x1-x0| zds1:? zds2:? zds3:? wds:|y1-y0| */
+
+        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| */
+
+    borrow = 0;
+    if (sub_p) {
+        borrow = !bary_2comp(zds1, 2*n);
+    }
+    /* zds0:|x1-x0| zds1,zds2:-?|x1-x0|*|y1-y0| zds3:? wds:|y1-y0| */
+
+    MEMCPY(wds, zds1, BDIGIT, n);
+
+    /* 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, wn-n);
+
+    /* zds0,zds1:x0*y0 zds2:hi(-?|x1-x0|*|y1-y0|) zds3:? wds:lo(-?|x1-x0|*|y1-y0|) */
+
+    carry1 = bary_add(wds, n, wds, n, zds0, n);
+    carry1 = bary_addc(zds2, n, zds2, n, zds1, n, carry1);
+
+    /* zds0,zds1:x0*y0 zds2:hi(x0*y0-?|x1-x0|*|y1-y0|) zds3:? wds:lo(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    carry2 = bary_add(zds1, n, zds1, n, wds, n);
+
+    /* zds0:lo(x0*y0) zds1:hi(x0*y0)+lo(x0*y0-?|x1-x0|*|y1-y0|) zds2:hi(x0*y0-?|x1-x0|*|y1-y0|) zds3:? wds:lo(x0*y0-?|x1-x0|*|y1-y0|) */
+
+    MEMCPY(wds, zds2, BDIGIT, n);
+
+    /* 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, 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|) */
+
+    carry3 = bary_add(zds1, n, zds1, n, zds2, n);
+
+    /* 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 < 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, 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, zn-2*n);
+
+    if (carry1 + carry3 - borrow < 0)
+        bary_sub_one(zds3, zn-3*n);
+    else if (carry1 + carry3 - borrow > 0) {
+        BDIGIT c = carry1 + carry3 - borrow;
+        bary_add(zds3, zn-3*n, zds3, zn-3*n, &c, 1);
+    }
+
+    /*
+    if (SIZEOF_BDIGIT * zn <= 16) {
+        uint128_t z, x, y;
+        ssize_t 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]; }
+        RUBY_ASSERT(z == x * y);
+    }
+    */
+
+    if (odd_xy) {
+        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+yn, zn-yn, yds[yn], xds, xn);
+    }
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_karatsuba(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));
+    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);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+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)
+{
+    size_t n;
+    size_t wnc;
+    VALUE work = 0;
+
+    /* "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;
+    size_t y0n; const BDIGIT *y0ds;
+    size_t y1n; const BDIGIT *y1ds;
+    size_t y2n; const BDIGIT *y2ds;
+
+    size_t u1n; BDIGIT *u1ds; int u1p;
+    size_t u2n; BDIGIT *u2ds; int u2p;
+    size_t u3n; BDIGIT *u3ds; int u3p;
+
+    size_t v1n; BDIGIT *v1ds; int v1p;
+    size_t v2n; BDIGIT *v2ds; int v2p;
+    size_t v3n; BDIGIT *v3ds; int v3p;
+
+    size_t t0n; BDIGIT *t0ds; int t0p;
+    size_t t1n; BDIGIT *t1ds; int t1p;
+    size_t t2n; BDIGIT *t2ds; int t2p;
+    size_t t3n; BDIGIT *t3ds; int t3p;
+    size_t t4n; BDIGIT *t4ds; int t4p;
+
+    size_t z0n; BDIGIT *z0ds;
+    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;
+
+    size_t zzn; BDIGIT *zzds;
+
+    int sq = xds == yds && xn == yn;
+
+    RUBY_ASSERT(xn <= yn);  /* assume y >= x */
+    RUBY_ASSERT(xn + yn <= zn);
+
+    n = (yn + 2) / 3;
+    RUBY_ASSERT(2*n < xn);
+
+    wnc = 0;
+
+    wnc += (u1n = n+1); /* BITSPERDIG*n+2 bits */
+    wnc += (u2n = n+1); /* BITSPERDIG*n+1 bits */
+    wnc += (u3n = n+1); /* BITSPERDIG*n+3 bits */
+    wnc += (v1n = n+1); /* BITSPERDIG*n+2 bits */
+    wnc += (v2n = n+1); /* BITSPERDIG*n+1 bits */
+    wnc += (v3n = n+1); /* BITSPERDIG*n+3 bits */
+
+    wnc += (t0n = 2*n); /* BITSPERDIG*2*n bits */
+    wnc += (t1n = 2*n+2); /* BITSPERDIG*2*n+4 bits but bary_mul needs u1n+v1n */
+    wnc += (t2n = 2*n+2); /* BITSPERDIG*2*n+2 bits but bary_mul needs u2n+v2n */
+    wnc += (t3n = 2*n+2); /* BITSPERDIG*2*n+6 bits but bary_mul needs u3n+v3n */
+    wnc += (t4n = 2*n); /* BITSPERDIG*2*n bits */
+
+    wnc += (z1n = 2*n+1); /* BITSPERDIG*2*n+5 bits */
+    wnc += (z2n = 2*n+1); /* BITSPERDIG*2*n+6 bits */
+    wnc += (z3n = 2*n+1); /* BITSPERDIG*2*n+8 bits */
+
+    if (wn < wnc) {
+        wn = wnc * 3 / 2; /* Allocate working memory for whole recursion at once. */
+        wds = ALLOCV_N(BDIGIT, work, wn);
+    }
+
+    u1ds = wds; wds += u1n;
+    u2ds = wds; wds += u2n;
+    u3ds = wds; wds += u3n;
+
+    v1ds = wds; wds += v1n;
+    v2ds = wds; wds += v2n;
+    v3ds = wds; wds += v3n;
+
+    t0ds = wds; wds += t0n;
+    t1ds = wds; wds += t1n;
+    t2ds = wds; wds += t2n;
+    t3ds = wds; wds += t3n;
+    t4ds = wds; wds += t4n;
+
+    z1ds = wds; wds += z1n;
+    z2ds = wds; wds += z2n;
+    z3ds = wds; wds += z3n;
+
+    wn -= wnc;
+
+    zzds = u1ds;
+    zzn = 6*n+1;
+
+    x0n = n;
+    x1n = n;
+    x2n = xn - 2*n;
+    x0ds = xds;
+    x1ds = xds + n;
+    x2ds = xds + 2*n;
+
+    if (sq) {
+        y0n = x0n;
+        y1n = x1n;
+        y2n = x2n;
+        y0ds = x0ds;
+        y1ds = x1ds;
+        y2ds = x2ds;
+    }
+    else {
+        y0n = n;
+        y1n = n;
+        y2n = yn - 2*n;
+        y0ds = yds;
+        y1ds = yds + n;
+        y2ds = yds + 2*n;
+    }
+
+    /*
+     * 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
+     *
+     * z(b) = x(b) * y(b)
+     * z(b) = z0 * b^0 + z1 * b^1 + z2 * b^2 + z3 * b^3 + z4 * b^4
+     * where:
+     *   z0 = x0 * y0
+     *   z1 = x0 * y1 + x1 * y0
+     *   z2 = x0 * y2 + x1 * y1 + x2 * y0
+     *   z3 = x1 * y2 + x2 * y1
+     *   z4 = x2 * y2
+     *
+     * Toom3 method (a.k.a. Toom-Cook method):
+     * (Step1) calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4),
+     * where:
+     *   b0 = 0, b1 = 1, b2 = -1, b3 = -2, b4 = inf,
+     *   z(0)   = x(0)   * y(0)   = x0 * y0
+     *   z(1)   = x(1)   * y(1)   = (x0 + x1 + x2) * (y0 + y1 + y2)
+     *   z(-1)  = x(-1)  * y(-1)  = (x0 - x1 + x2) * (y0 - y1 + y2)
+     *   z(-2)  = x(-2)  * y(-2)  = (x0 - 2 * (x1 - 2 * x2)) * (y0 - 2 * (y1 - 2 * y2))
+     *   z(inf) = x(inf) * y(inf) = x2 * y2
+     *
+     * (Step2) interpolating z0, z1, z2, z3 and z4.
+     *
+     * (Step3) Substituting base value into b of the polynomial z(b),
+     */
+
+    /*
+     * [Step1] calculating 5 points z(b0), z(b1), z(b2), z(b3), z(b4)
+     */
+
+    /* u1 <- x0 + x2 */
+    bary_add(u1ds, u1n, x0ds, x0n, x2ds, x2n);
+    u1p = 1;
+
+    /* x(-1) : u2 <- u1 - x1 = x0 - x1 + x2 */
+    if (bary_sub(u2ds, u2n, u1ds, u1n, x1ds, x1n)) {
+        bary_2comp(u2ds, u2n);
+        u2p = 0;
+    }
+    else {
+        u2p = 1;
+    }
+
+    /* x(1) : u1 <- u1 + x1 = x0 + x1 + x2 */
+    bary_add(u1ds, u1n, u1ds, u1n, x1ds, x1n);
+
+    /* x(-2) : u3 <- 2 * (u2 + x2) - x0 = x0 - 2 * (x1 - 2 * x2) */
+    u3p = 1;
+    if (u2p) {
+        bary_add(u3ds, u3n, u2ds, u2n, x2ds, x2n);
+    }
+    else if (bary_sub(u3ds, u3n, x2ds, x2n, u2ds, u2n)) {
+        bary_2comp(u3ds, u3n);
+        u3p = 0;
+    }
+    bary_small_lshift(u3ds, u3ds, u3n, 1);
+    if (!u3p) {
+        bary_add(u3ds, u3n, u3ds, u3n, x0ds, x0n);
+    }
+    else if (bary_sub(u3ds, u3n, u3ds, u3n, x0ds, x0n)) {
+        bary_2comp(u3ds, u3n);
+        u3p = 0;
+    }
+
+    if (sq) {
+        v1n = u1n; v1ds = u1ds; v1p = u1p;
+        v2n = u2n; v2ds = u2ds; v2p = u2p;
+        v3n = u3n; v3ds = u3ds; v3p = u3p;
+    }
+    else {
+        /* v1 <- y0 + y2 */
+        bary_add(v1ds, v1n, y0ds, y0n, y2ds, y2n);
+        v1p = 1;
+
+        /* 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 */
+        bary_add(v1ds, v1n, v1ds, v1n, y1ds, y1n);
+
+        /* y(-2) : v3 <- 2 * (v2 + y2) - y0 = y0 - 2 * (y1 - 2 * y2) */
+        v3p = 1;
+        if (v2p) {
+            bary_add(v3ds, v3n, v2ds, v2n, y2ds, y2n);
+        }
+        else if (bary_sub(v3ds, v3n, y2ds, y2n, v2ds, v2n)) {
+            bary_2comp(v3ds, v3n);
+            v3p = 0;
+        }
+        bary_small_lshift(v3ds, v3ds, v3n, 1);
+        if (!v3p) {
+            bary_add(v3ds, v3n, v3ds, v3n, y0ds, y0n);
+        }
+        else if (bary_sub(v3ds, v3n, v3ds, v3n, y0ds, y0n)) {
+            bary_2comp(v3ds, v3n);
+            v3p = 0;
+        }
+    }
+
+    /* z(0) : t0 <- x0 * y0 */
+    bary_mul_toom3_start(t0ds, t0n, x0ds, x0n, y0ds, y0n, wds, wn);
+    t0p = 1;
+
+    /* z(1) : t1 <- u1 * v1 */
+    bary_mul_toom3_start(t1ds, t1n, u1ds, u1n, v1ds, v1n, wds, wn);
+    t1p = u1p == v1p;
+    RUBY_ASSERT(t1ds[t1n-1] == 0);
+    t1n--;
+
+    /* z(-1) : t2 <- u2 * v2 */
+    bary_mul_toom3_start(t2ds, t2n, u2ds, u2n, v2ds, v2n, wds, wn);
+    t2p = u2p == v2p;
+    RUBY_ASSERT(t2ds[t2n-1] == 0);
+    t2n--;
+
+    /* z(-2) : t3 <- u3 * v3 */
+    bary_mul_toom3_start(t3ds, t3n, u3ds, u3n, v3ds, v3n, wds, wn);
+    t3p = u3p == v3p;
+    RUBY_ASSERT(t3ds[t3n-1] == 0);
+    t3n--;
+
+    /* z(inf) : t4 <- x2 * y2 */
+    bary_mul_toom3_start(t4ds, t4n, x2ds, x2n, y2ds, y2n, wds, wn);
+    t4p = 1;
+
+    /*
+     * [Step2] interpolating z0, z1, z2, z3 and z4.
+     */
+
+    /* z0 <- z(0) == t0 */
+    z0n = t0n; z0ds = t0ds;
+
+    /* z4 <- z(inf) == t4 */
+    z4n = t4n; z4ds = t4ds;
+
+    /* z3 <- (z(-2) - z(1)) / 3 == (t3 - t1) / 3 */
+    if (t3p == t1p) {
+        z3p = t3p;
+        if (bary_sub(z3ds, z3n, t3ds, t3n, t1ds, t1n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+    else {
+        z3p = t3p;
+        bary_add(z3ds, z3n, t3ds, t3n, t1ds, t1n);
+    }
+    bigdivrem_single(z3ds, z3ds, z3n, 3);
+
+    /* z1 <- (z(1) - z(-1)) / 2 == (t1 - t2) / 2 */
+    if (t1p == t2p) {
+        z1p = t1p;
+        if (bary_sub(z1ds, z1n, t1ds, t1n, t2ds, t2n)) {
+            bary_2comp(z1ds, z1n);
+            z1p = !z1p;
+        }
+    }
+    else {
+        z1p = t1p;
+        bary_add(z1ds, z1n, t1ds, t1n, t2ds, t2n);
+    }
+    bary_small_rshift(z1ds, z1ds, z1n, 1, 0);
+
+    /* z2 <- z(-1) - z(0) == t2 - t0 */
+    if (t2p == t0p) {
+        z2p = t2p;
+        if (bary_sub(z2ds, z2n, t2ds, t2n, t0ds, t0n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+    else {
+        z2p = t2p;
+        bary_add(z2ds, z2n, t2ds, t2n, t0ds, t0n);
+    }
+
+    /* z3 <- (z2 - z3) / 2 + 2 * z(inf) == (z2 - z3) / 2 + 2 * t4 */
+    if (z2p == z3p) {
+        z3p = z2p;
+        if (bary_sub(z3ds, z3n, z2ds, z2n, z3ds, z3n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+    else {
+        z3p = z2p;
+        bary_add(z3ds, z3n, z2ds, z2n, z3ds, z3n);
+    }
+    bary_small_rshift(z3ds, z3ds, z3n, 1, 0);
+    if (z3p == t4p) {
+        bary_muladd_1xN(z3ds, z3n, 2, t4ds, t4n);
+    }
+    else {
+        if (bary_mulsub_1xN(z3ds, z3n, 2, t4ds, t4n)) {
+            bary_2comp(z3ds, z3n);
+            z3p = !z3p;
+        }
+    }
+
+    /* z2 <- z2 + z1 - z(inf) == z2 + z1 - t4 */
+    if (z2p == z1p) {
+        bary_add(z2ds, z2n, z2ds, z2n, z1ds, z1n);
+    }
+    else {
+        if (bary_sub(z2ds, z2n, z2ds, z2n, z1ds, z1n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+
+    if (z2p == t4p) {
+        if (bary_sub(z2ds, z2n, z2ds, z2n, t4ds, t4n)) {
+            bary_2comp(z2ds, z2n);
+            z2p = !z2p;
+        }
+    }
+    else {
+        bary_add(z2ds, z2n, z2ds, z2n, t4ds, t4n);
+    }
+
+    /* z1 <- z1 - z3 */
+    if (z1p == z3p) {
+        if (bary_sub(z1ds, z1n, z1ds, z1n, z3ds, z3n)) {
+            bary_2comp(z1ds, z1n);
+            z1p = !z1p;
+        }
+    }
+    else {
+        bary_add(z1ds, z1n, z1ds, z1n, z3ds, z3n);
+    }
+
+    /*
+     * [Step3] Substituting base value into b of the polynomial z(b),
+     */
+
+    MEMCPY(zzds, z0ds, BDIGIT, 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
+        bary_sub(zzds +   n, zzn -   n, zzds +   n, zzn -   n, z1ds, z1n);
+    if (z2p)
+        bary_add(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
+    else
+        bary_sub(zzds + 2*n, zzn - 2*n, zzds + 2*n, zzn - 2*n, z2ds, z2n);
+    if (z3p)
+        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);
+
+    BARY_TRUNC(zzds, zzn);
+    MEMCPY(zds, zzds, BDIGIT, zzn);
+    BDIGITS_ZERO(zds + zzn, zn - zzn);
+
+    if (work)
+        ALLOCV_END(work);
+}
+
+VALUE
+rb_big_mul_toom3(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));
+    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);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(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_mul_gmp(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    mpz_t x, y, z;
+    size_t count;
+
+    RUBY_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 {
+        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)
+{
+    RUBY_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();
+    }
+}
+
+/* determine whether a bignum is sparse or not by random sampling */
+static inline int
+bary_sparse_p(const BDIGIT *ds, size_t n)
+{
+    long c = 0;
+
+    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 *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 zn = *znp;
+    const BDIGIT *xds = *xdsp;
+    size_t xn = *xnp;
+    const BDIGIT *yds = *ydsp;
+    size_t yn = *ynp;
+
+    RUBY_ASSERT(xn + yn <= zn);
+
+    nlsz = 0;
+
+    while (0 < xn) {
+        if (xds[xn-1] == 0) {
+            xn--;
+        }
+        else {
+            do {
+                if (xds[0] != 0)
+                    break;
+                xds++;
+                xn--;
+                nlsz++;
+            } while (0 < xn);
+            break;
+        }
+    }
+
+    while (0 < yn) {
+        if (yds[yn-1] == 0) {
+            yn--;
+        }
+        else {
+            do {
+                if (yds[0] != 0)
+                    break;
+                yds++;
+                yn--;
+                nlsz++;
+            } while (0 < yn);
+            break;
+        }
+    }
+
+    if (nlsz) {
+        BDIGITS_ZERO(zds, nlsz);
+        zds += nlsz;
+        zn -= nlsz;
+    }
+
+    /* make sure that y is longer than x */
+    if (xn > yn) {
+        const BDIGIT *tds;
+        size_t tn;
+        tds = xds; xds = yds; yds = tds;
+        tn = xn; xn = yn; yn = tn;
+    }
+    RUBY_ASSERT(xn <= yn);
+
+    if (xn <= 1) {
+        if (xn == 0) {
+            BDIGITS_ZERO(zds, zn);
+            return 1;
+        }
+
+        if (xds[0] == 1) {
+            MEMCPY(zds, yds, BDIGIT, yn);
+            BDIGITS_ZERO(zds+yn, zn-yn);
+            return 1;
+        }
+        if (POW2_P(xds[0])) {
+            zds[yn] = bary_small_lshift(zds, yds, yn, bit_length(xds[0])-1);
+            BDIGITS_ZERO(zds+yn+1, zn-yn-1);
+            return 1;
+        }
+        if (yn == 1 && yds[0] == 1) {
+            zds[0] = xds[0];
+            BDIGITS_ZERO(zds+1, zn-1);
+            return 1;
+        }
+        bary_mul_normal(zds, zn, xds, xn, yds, yn);
+        return 1;
+    }
+
+    *zdsp = zds;
+    *znp = zn;
+    *xdsp = xds;
+    *xnp = xn;
+    *ydsp = yds;
+    *ynp = yn;
+
+    return 0;
+}
+
+static void
+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 (xn < KARATSUBA_MUL_DIGITS) {
+        goto normal;
+    }
+
+    /* normal multiplication when x or y is a sparse bignum */
+    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(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, 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 zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn, BDIGIT *wds, size_t wn)
 {
-    long i = RBIGNUM(x)->len;
-    USHORT *ds = BDIGITS(x);
-    long num;
+    if (bary_mul_precheck(&zds, &zn, &xds, &xn, &yds, &yn))
+        return;
+
+    bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+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 (xn < TOOM3_MUL_DIGITS) {
+        bary_mul_karatsuba_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+        return;
+    }
+
+    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, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+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, &zn, &xds, &xn, &yds, &yn))
+        return;
+
+    bary_mul_toom3_branch(zds, zn, xds, xn, yds, yn, wds, wn);
+}
+
+static void
+bary_mul(BDIGIT *zds, size_t zn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    if (xn <= yn) {
+        if (xn < NAIVE_MUL_DIGITS) {
+            if (xds == yds && xn == yn)
+                bary_sq_fast(zds, zn, xds, xn);
+            else
+                bary_short_mul(zds, zn, xds, xn, yds, yn);
+            return;
+        }
+    }
+    else {
+        if (yn < NAIVE_MUL_DIGITS) {
+            bary_short_mul(zds, zn, yds, yn, xds, xn);
+            return;
+        }
+    }
+
+#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 {
+    size_t yn, zn;
+    BDIGIT *yds, *zds;
+    volatile VALUE stop;
+};
+
+static void *
+bigdivrem1(void *ptr)
+{
+    struct big_div_struct *bds = (struct big_div_struct*)ptr;
+    size_t yn = bds->yn;
+    size_t zn = bds->zn;
+    BDIGIT *yds = bds->yds, *zds = bds->zds;
+    BDIGIT_DBL_SIGNED num;
+    BDIGIT q;
 
-    while (i--) ds[i] = ~ds[i];
-    i = 0; num = 1;
     do {
-	num += ds[i];
-	ds[i++] = BIGLO(num);
-	num = BIGDN(num);
-    } while (i < RBIGNUM(x)->len);
-    if (ds[0] == 1 || ds[0] == 0) {
-	for (i=1; i<RBIGNUM(x)->len; i++) {
-	    if (ds[i] != 0) return;
-	}
-	REALLOC_N(RBIGNUM(x)->digits, USHORT, RBIGNUM(x)->len++);
-	ds = BDIGITS(x);
-	ds[RBIGNUM(x)->len-1] = 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, yn);
+            while (num) { /* "add back" required */
+                q--;
+                num = bary_add(zds+zn-(yn+1), yn,
+                               zds+zn-(yn+1), yn,
+                               yds, yn);
+                num--;
+            }
+        }
+        zn--;
+        zds[zn] = q;
+    } while (zn > yn);
+    return 0;
+}
+
+/* async-signal-safe */
+static void
+rb_big_stop(void *ptr)
+{
+    struct big_div_struct *bds = ptr;
+    bds->stop = Qtrue;
+}
+
+static BDIGIT
+bigdivrem_single1(BDIGIT *qds, const BDIGIT *xds, size_t xn, BDIGIT x_higher_bdigit, BDIGIT y)
+{
+    RUBY_ASSERT(0 < xn);
+    RUBY_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, size_t xn, BDIGIT y)
+{
+    return bigdivrem_single1(qds, xds, xn, 0, y);
+}
+
+static void
+bigdivrem_restoring(BDIGIT *zds, size_t zn, BDIGIT *yds, size_t yn)
+{
+    struct big_div_struct bds;
+    size_t ynzero;
+
+    RUBY_ASSERT(yn < zn);
+    RUBY_ASSERT(BDIGIT_MSB(yds[yn-1]));
+    RUBY_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 | RB_NOGVL_OFFLOAD_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;
+
+    RUBY_ASSERT(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    RUBY_ASSERT(qds ? (xn - yn + 1) <= qn : 1);
+    RUBY_ASSERT(rds ? yn <= rn : 1);
+
+    zn = xn + BIGDIVREM_EXTRA_WORDS;
+
+    shift = nlz(yds[yn-1]);
+    if (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 {
+        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;
+    }
+
+    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);
+
+    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;
+
+    RUBY_ASSERT(yn < xn || (xn == yn && yds[yn - 1] <= xds[xn - 1]));
+    RUBY_ASSERT(qds ? (xn - yn + 1) <= qn : 1);
+    RUBY_ASSERT(rds ? yn <= rn : 1);
+    RUBY_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 {
+        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 (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 qn, BDIGIT *rds, size_t rn, const BDIGIT *xds, size_t xn, const BDIGIT *yds, size_t yn)
+{
+    RUBY_ASSERT(xn <= qn);
+    RUBY_ASSERT(yn <= rn);
+
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+
+    BARY_TRUNC(xds, xn);
+    if (xn == 0) {
+        BDIGITS_ZERO(qds, qn);
+        BDIGITS_ZERO(rds, rn);
+        return;
+    }
+
+    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 (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 (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, qn-2);
+        rds[0] = BIGLO(r);
+        rds[1] = BIGLO(BIGDN(r));
+        BDIGITS_ZERO(rds+2, rn-2);
+    }
+    else {
+        bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
+    }
+}
+
+static int
+bigzero_p(VALUE x)
+{
+    return bary_zero_p(BDIGITS(x), BIGNUM_LEN(x));
+}
+
+int
+rb_bigzero_p(VALUE x)
+{
+    return BIGZEROP(x);
+}
+
+int
+rb_cmpint(VALUE val, VALUE a, VALUE b)
+{
+    if (NIL_P(val)) {
+        rb_cmperr_reason(a, b, "comparator returned nil");
+    }
+    if (FIXNUM_P(val)) {
+        long l = FIX2LONG(val);
+        if (l > 0) return 1;
+        if (l < 0) return -1;
+        return 0;
+    }
+    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 BIGNUM_SET_LEN(b,l) \
+    (BIGNUM_EMBED_P(b) ? \
+     (void)(RBASIC(b)->flags = \
+            (RBASIC(b)->flags & ~BIGNUM_EMBED_LEN_MASK) | \
+            ((l) << BIGNUM_EMBED_LEN_SHIFT)) : \
+     (void)(RBIGNUM(b)->as.heap.len = (l)))
+
+static size_t
+big_embed_capa(VALUE big)
+{
+    size_t size = rb_gc_obj_slot_size(big) - offsetof(struct RBignum, as.ary);
+    RUBY_ASSERT(size % sizeof(BDIGIT) == 0);
+    size_t capa = size / sizeof(BDIGIT);
+    RUBY_ASSERT(capa <= BIGNUM_EMBED_LEN_MAX);
+    return capa;
+}
+
+static size_t
+big_embed_size(size_t capa)
+{
+    size_t size = offsetof(struct RBignum, as.ary) + (sizeof(BDIGIT) * capa);
+    if (size < sizeof(struct RBignum)) {
+        size = sizeof(struct RBignum);
+    }
+    return size;
+}
+
+static bool
+big_embeddable_p(size_t capa)
+{
+    if (capa > BIGNUM_EMBED_LEN_MAX) {
+        return false;
+    }
+    return rb_gc_size_allocatable_p(big_embed_size(capa));
+}
+
+static void
+rb_big_realloc(VALUE big, size_t len)
+{
+    BDIGIT *ds;
+    size_t embed_capa = big_embed_capa(big);
+
+    if (BIGNUM_EMBED_P(big)) {
+        if (embed_capa < len) {
+            ds = ALLOC_N(BDIGIT, len);
+            MEMCPY(ds, RBIGNUM(big)->as.ary, BDIGIT, embed_capa);
+            RBIGNUM(big)->as.heap.len = BIGNUM_LEN(big);
+            RBIGNUM(big)->as.heap.digits = ds;
+            FL_UNSET_RAW(big, BIGNUM_EMBED_FLAG);
+        }
+    }
+    else {
+        if (len <= embed_capa) {
+            ds = RBIGNUM(big)->as.heap.digits;
+            size_t old_len = RBIGNUM(big)->as.heap.len;
+            FL_SET_RAW(big, BIGNUM_EMBED_FLAG);
+            BIGNUM_SET_LEN(big, len);
+            (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)RBIGNUM(big)->as.ary, embed_capa * sizeof(BDIGIT));
+            if (ds) {
+                MEMCPY(RBIGNUM(big)->as.ary, ds, BDIGIT, len);
+                SIZED_FREE_N(ds, old_len);
+            }
+        }
+        else {
+            if (BIGNUM_LEN(big) == 0) {
+                RBIGNUM(big)->as.heap.digits = ALLOC_N(BDIGIT, len);
+            }
+            else if (BIGNUM_LEN(big) != len) {
+                SIZED_REALLOC_N(RBIGNUM(big)->as.heap.digits, BDIGIT, len, BIGNUM_LEN(big));
+            }
+        }
+    }
+}
+
+void
+rb_big_resize(VALUE big, size_t len)
+{
+    rb_big_realloc(big, len);
+    BIGNUM_SET_LEN(big, len);
+}
+
+static VALUE
+bignew_1(VALUE klass, size_t len, int sign)
+{
+    VALUE bigv;
+
+    if (big_embeddable_p(len)) {
+        size_t size = big_embed_size(len);
+        RUBY_ASSERT(rb_gc_size_allocatable_p(size));
+        NEWOBJ_OF(big, struct RBignum, klass, T_BIGNUM | BIGNUM_EMBED_FLAG, size);
+        bigv = (VALUE)big;
+        BIGNUM_SET_SIGN(bigv, sign);
+        BIGNUM_SET_LEN(bigv, len);
+        (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)big->as.ary, len * sizeof(BDIGIT));
+    }
+    else {
+        NEWOBJ_OF(big, struct RBignum, klass, T_BIGNUM, sizeof(struct RBignum));
+        bigv = (VALUE)big;
+        BIGNUM_SET_SIGN(bigv, sign);
+        big->as.heap.digits = ALLOC_N(BDIGIT, len);
+        big->as.heap.len = len;
+    }
+    OBJ_FREEZE(bigv);
+    return bigv;
+}
+
+VALUE
+rb_big_new(size_t len, int sign)
+{
+    VALUE obj = bignew(len, sign != 0);
+    memset(BIGNUM_DIGITS(obj), 0, len * sizeof(BDIGIT));
+    return obj;
+}
+
+VALUE
+rb_big_clone(VALUE 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;
+}
+
+static void
+big_extend_carry(VALUE x)
+{
+    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 = BIGNUM_LEN(x);
+    BDIGIT *ds = BDIGITS(x);
+
+    if (bary_2comp(ds, i)) {
+        big_extend_carry(x);
+    }
+}
+
+void
+rb_big_2comp(VALUE x)			/* get 2's complement */
+{
+    get2comp(x);
+}
+
+static BDIGIT
+abs2twocomp(VALUE *xp, long *n_ret)
+{
+    VALUE x = *xp;
+    long n = BIGNUM_LEN(x);
+    BDIGIT *ds = BDIGITS(x);
+    BDIGIT hibits = 0;
+
+    BARY_TRUNC(ds, n);
+
+    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;
+    }
+    *n_ret = n;
+    return hibits;
+}
+
+static void
+twocomp2abs_bang(VALUE x, int hibits)
+{
+    BIGNUM_SET_SIGN(x, !hibits);
+    if (hibits) {
+        get2comp(x);
     }
 }
 
+static inline VALUE
+bigtrunc(VALUE x)
+{
+    size_t len = BIGNUM_LEN(x);
+    BDIGIT *ds = BDIGITS(x);
+
+    if (len == 0) return x;
+    while (--len && !ds[len]);
+    if (BIGNUM_LEN(x) > len+1) {
+        rb_big_resize(x, len+1);
+    }
+    return x;
+}
+
+static inline VALUE
+bigfixize(VALUE x)
+{
+    size_t n = BIGNUM_LEN(x);
+    BDIGIT *ds = BDIGITS(x);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    unsigned long u;
+#else
+    BDIGIT u;
+#endif
+
+    BARY_TRUNC(ds, n);
+
+    if (n == 0) return INT2FIX(0);
+
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (sizeof(long)/SIZEOF_BDIGIT < n)
+        goto return_big;
+    else {
+        int i = (int)n;
+        u = 0;
+        while (i--) {
+            u = (unsigned long)(BIGUP(u) + ds[i]);
+        }
+    }
+#else /* SIZEOF_BDIGIT >= SIZEOF_LONG */
+    if (1 < n)
+        goto return_big;
+    else
+        u = ds[0];
+#endif
+
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (POSFIXABLE(u)) return LONG2FIX((long)u);
+    }
+    else {
+        if (u <= -FIXNUM_MIN) return LONG2FIX(-(long)u);
+    }
+
+  return_big:
+    rb_big_resize(x, n);
+    return x;
+}
+
 static VALUE
-bignorm(x)
-    VALUE x;
-{
-    if (!FIXNUM_P(x)) {
-	long len = RBIGNUM(x)->len;
-	USHORT *ds = BDIGITS(x);
-
-	while (len-- && !ds[len]) ;
-	RBIGNUM(x)->len = ++len;
-
-	if (len*sizeof(USHORT) <= sizeof(VALUE)) {
-	    long num = 0;
-	    while (len--) {
-		num = BIGUP(num) + ds[len];
-	    }
-	    if (num >= 0) {
-		if (RBIGNUM(x)->sign) {
-		    if (POSFIXABLE(num)) return INT2FIX(num);
-		}
-		else if (NEGFIXABLE(-(long)num)) return INT2FIX(-(long)num);
-	    }
-	}
+bignorm(VALUE x)
+{
+    if (RB_BIGNUM_TYPE_P(x)) {
+        x = bigfixize(x);
     }
     return x;
 }
 
 VALUE
-rb_big_norm(x)
-    VALUE x;
+rb_big_norm(VALUE x)
 {
     return bignorm(x);
 }
 
 VALUE
-rb_uint2big(n)
-    unsigned long n;
+rb_uint2big(uintptr_t n)
 {
-    unsigned int i = 0;
-    USHORT *digits;
-    VALUE big;
-
-    i = 0;
-    big = bignew(DIGSPERLONG, 1);
-    digits = BDIGITS(big);
-    while (i < DIGSPERLONG) {
-	digits[i++] = BIGLO(n);
-	n = BIGDN(n);
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_VALUE), 1);
+    BDIGIT *digits = BDIGITS(big);
+
+#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);
     }
+#endif
 
-    i = DIGSPERLONG;
-    while (i-- && !digits[i]) ;
-    RBIGNUM(big)->len = i+1;
+    i = bdigit_roomof(SIZEOF_VALUE);
+    while (--i && !digits[i]) ;
+    BIGNUM_SET_LEN(big, i+1);
     return big;
 }
 
 VALUE
-rb_int2big(n)
-    long n;
+rb_int2big(intptr_t n)
 {
     long neg = 0;
+    VALUE u;
     VALUE big;
 
     if (n < 0) {
-	n = -n;
-	neg = 1;
+        u = 1 + (VALUE)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
+    }
+    else {
+        u = n;
     }
-    big = rb_uint2big(n);
+    big = rb_uint2big(u);
     if (neg) {
-	RBIGNUM(big)->sign = 0;
+        BIGNUM_SET_NEGATIVE_SIGN(big);
     }
     return big;
 }
 
 VALUE
-rb_uint2inum(n)
-    unsigned long n;
+rb_uint2inum(uintptr_t n)
 {
-    if (POSFIXABLE(n)) return INT2FIX(n);
+    if (POSFIXABLE(n)) return LONG2FIX(n);
     return rb_uint2big(n);
 }
 
 VALUE
-rb_int2inum(n)
-    long n;
+rb_int2inum(intptr_t n)
 {
-    if (FIXABLE(n)) return INT2FIX(n);
+    if (FIXABLE(n)) return LONG2FIX(n);
     return rb_int2big(n);
 }
 
+void
+rb_big_pack(VALUE val, unsigned long *buf, long num_longs)
+{
+    rb_integer_pack(val, buf, num_longs, sizeof(long), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP);
+}
+
 VALUE
-rb_cstr2inum(str, base)
-    const char *str;
-    int base;
+rb_big_unpack(unsigned long *buf, long num_longs)
 {
-    const char *s = str;
-    char *end;
-    int badcheck = (base==0)?1:0;
-    char sign = 1, c;
-    unsigned long num;
-    long len, blen = 1;
-    long i;
+    return rb_integer_unpack(buf, num_longs, sizeof(long), 0,
+            INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP);
+}
+
+/*
+ * Calculate the number of bytes to be required to represent
+ * the absolute value of the integer given as _val_.
+ *
+ * [val] an integer.
+ * [nlz_bits_ret] number of leading zero bits in the most significant byte is returned if not NULL.
+ *
+ * This function returns ((val_numbits * CHAR_BIT + CHAR_BIT - 1) / CHAR_BIT)
+ * where val_numbits is the number of bits of abs(val).
+ * This function should not overflow.
+ *
+ * If nlz_bits_ret is not NULL,
+ * (return_value * CHAR_BIT - val_numbits) is stored in *nlz_bits_ret.
+ * In this case, 0 <= *nlz_bits_ret < CHAR_BIT.
+ *
+ */
+size_t
+rb_absint_size(VALUE val, int *nlz_bits_ret)
+{
+    BDIGIT *dp;
+    BDIGIT *de;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+
+    int num_leading_zeros;
+
+    val = rb_to_int(val);
+
+    if (FIXNUM_P(val)) {
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            v = -v;
+        }
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
+            }
+        }
+#endif
+        dp = fixbuf;
+        de = fixbuf + numberof(fixbuf);
+    }
+    else {
+        dp = BDIGITS(val);
+        de = dp + BIGNUM_LEN(val);
+    }
+    while (dp < de && de[-1] == 0)
+        de--;
+    if (dp == de) {
+        if (nlz_bits_ret)
+            *nlz_bits_ret = 0;
+        return 0;
+    }
+    num_leading_zeros = nlz(de[-1]);
+    if (nlz_bits_ret)
+        *nlz_bits_ret = num_leading_zeros % CHAR_BIT;
+    return (de - dp) * SIZEOF_BDIGIT - num_leading_zeros / CHAR_BIT;
+}
+
+static size_t
+absint_numwords_small(size_t numbytes, int nlz_bits_in_msbyte, size_t word_numbits, size_t *nlz_bits_ret)
+{
+    size_t val_numbits = numbytes * CHAR_BIT - nlz_bits_in_msbyte;
+    size_t div = val_numbits / word_numbits;
+    size_t mod = val_numbits % word_numbits;
+    size_t numwords;
+    size_t nlz_bits;
+    numwords = mod == 0 ? div : div + 1;
+    nlz_bits = mod == 0 ? 0 : word_numbits - mod;
+    *nlz_bits_ret = nlz_bits;
+    return numwords;
+}
+
+static size_t
+absint_numwords_generic(size_t numbytes, int nlz_bits_in_msbyte, size_t word_numbits, size_t *nlz_bits_ret)
+{
+    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];
+    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)];
+    BDIGIT one[1] = { 1 };
+    size_t nlz_bits;
+    size_t mod;
+    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)
+     * numwords = mod == 0 ? div : div + 1
+     * nlz_bits = mod == 0 ? 0 : word_numbits - mod
+     */
+
+    bary_unpack(BARY_ARGS(numbytes_bary), &numbytes, 1, sizeof(numbytes), 0,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+    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,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+    BARY_DIVMOD(div_bary, mod_bary, val_numbits_bary, word_numbits_bary);
+    if (BARY_ZERO_P(mod_bary)) {
+        nlz_bits = 0;
+    }
+    else {
+        BARY_ADD(div_bary, div_bary, one);
+        bary_pack(+1, BARY_ARGS(mod_bary), &mod, 1, sizeof(mod), 0,
+            INTEGER_PACK_NATIVE_BYTE_ORDER);
+        nlz_bits = word_numbits - mod;
+    }
+    sign = bary_pack(+1, BARY_ARGS(div_bary), &numwords, 1, sizeof(numwords), 0,
+        INTEGER_PACK_NATIVE_BYTE_ORDER);
+
+    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;
+}
+
+/*
+ * Calculate the number of words to be required to represent
+ * the absolute value of the integer given as _val_.
+ *
+ * [val] an integer.
+ * [word_numbits] number of bits in a word.
+ * [nlz_bits_ret] number of leading zero bits in the most significant word is returned if not NULL.
+ *
+ * This function returns ((val_numbits * CHAR_BIT + word_numbits - 1) / word_numbits)
+ * where val_numbits is the number of bits of abs(val).
+ *
+ * This function can overflow.
+ * When overflow occur, (size_t)-1 is returned.
+ *
+ * If nlz_bits_ret is not NULL and overflow is not occur,
+ * (return_value * word_numbits - val_numbits) is stored in *nlz_bits_ret.
+ * In this case, 0 <= *nlz_bits_ret < word_numbits.
+ *
+ */
+size_t
+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 = 0;
+
+    if (word_numbits == 0)
+        return (size_t)-1;
+
+    numbytes = rb_absint_size(val, &nlz_bits_in_msbyte);
+
+    if (numbytes <= SIZE_MAX / CHAR_BIT) {
+        numwords = absint_numwords_small(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits);
+        if (debug_integer_pack) {
+            size_t numwords0, nlz_bits0;
+            numwords0 = absint_numwords_generic(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits0);
+            RUBY_ASSERT(numwords0 == numwords);
+            RUBY_ASSERT(nlz_bits0 == nlz_bits);
+            (void)numwords0;
+        }
+    }
+    else {
+        numwords = absint_numwords_generic(numbytes, nlz_bits_in_msbyte, word_numbits, &nlz_bits);
+    }
+    if (numwords == (size_t)-1)
+        return numwords;
+
+    if (nlz_bits_ret)
+        *nlz_bits_ret = nlz_bits;
+
+    return numwords;
+}
+
+/* Test abs(val) consists only a bit or not.
+ *
+ * Returns 1 if abs(val) == 1 << n for some n >= 0.
+ * Returns 0 otherwise.
+ *
+ * rb_absint_singlebit_p can be used to determine required buffer size
+ * for rb_integer_pack used with INTEGER_PACK_2COMP (two's complement).
+ *
+ * Following example calculates number of bits required to
+ * represent val in two's complement number, without sign bit.
+ *
+ *   size_t size;
+ *   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))
+ *     size--;
+ *
+ * Following example calculates number of bytes required to
+ * represent val in two's complement number, with sign bit.
+ *
+ *   size_t size;
+ *   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)))
+ *     size++;
+ */
+int
+rb_absint_singlebit_p(VALUE val)
+{
+    BDIGIT *dp;
+    BDIGIT *de;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+    BDIGIT d;
+
+    val = rb_to_int(val);
+
+    if (FIXNUM_P(val)) {
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            v = -v;
+        }
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
+            }
+        }
+#endif
+        dp = fixbuf;
+        de = fixbuf + numberof(fixbuf);
+    }
+    else {
+        dp = BDIGITS(val);
+        de = dp + BIGNUM_LEN(val);
+    }
+    while (dp < de && de[-1] == 0)
+        de--;
+    while (dp < de && dp[0] == 0)
+        dp++;
+    if (dp == de) /* no bit set. */
+        return 0;
+    if (dp != de-1) /* two non-zero words. two bits set, at least. */
+        return 0;
+    d = *dp;
+    return POW2_P(d);
+}
+
+
+/*
+ * Export an integer into a buffer.
+ *
+ * This function fills the buffer specified by _words_ and _numwords_ as
+ * val in the format specified by _wordsize_, _nails_ and _flags_.
+ *
+ * [val] Fixnum, Bignum or another integer like object which has to_int method.
+ * [words] buffer to export abs(val).
+ * [numwords] the size of given buffer as number of words.
+ * [wordsize] the size of word as number of bytes.
+ * [nails] number of padding bits in a word.
+ *   Most significant nails bits of each word are filled by zero.
+ * [flags] bitwise or of constants which name starts "INTEGER_PACK_".
+ *
+ * flags:
+ * [INTEGER_PACK_MSWORD_FIRST] Store the most significant word as the first word.
+ * [INTEGER_PACK_LSWORD_FIRST] Store the least significant word as the first word.
+ * [INTEGER_PACK_MSBYTE_FIRST] Store the most significant byte in a word as the first byte in the word.
+ * [INTEGER_PACK_LSBYTE_FIRST] Store the least significant byte in a word as the first byte in the word.
+ * [INTEGER_PACK_NATIVE_BYTE_ORDER] INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST corresponding to the host's endian.
+ * [INTEGER_PACK_2COMP] Use 2's complement representation.
+ * [INTEGER_PACK_LITTLE_ENDIAN] Same as INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_LSBYTE_FIRST
+ * [INTEGER_PACK_BIG_ENDIAN] Same as INTEGER_PACK_MSWORD_FIRST|INTEGER_PACK_MSBYTE_FIRST
+ * [INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION] Use generic implementation (for test and debug).
+ *
+ * This function fills the buffer specified by _words_
+ * as abs(val) if INTEGER_PACK_2COMP is not specified in _flags_.
+ * If INTEGER_PACK_2COMP is specified, 2's complement representation of val is
+ * filled in the buffer.
+ *
+ * This function returns the signedness and overflow condition.
+ * The overflow condition depends on INTEGER_PACK_2COMP.
+ *
+ * INTEGER_PACK_2COMP is not specified:
+ *   -2 : negative overflow.  val <= -2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   -1 : negative without overflow.  -2**(numwords*(wordsize*CHAR_BIT-nails)) < val < 0
+ *   0 : zero.  val == 0
+ *   1 : positive without overflow.  0 < val < 2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   2 : positive overflow.  2**(numwords*(wordsize*CHAR_BIT-nails)) <= val
+ *
+ * INTEGER_PACK_2COMP is specified:
+ *   -2 : negative overflow.  val < -2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   -1 : negative without overflow.  -2**(numwords*(wordsize*CHAR_BIT-nails)) <= val < 0
+ *   0 : zero.  val == 0
+ *   1 : positive without overflow.  0 < val < 2**(numwords*(wordsize*CHAR_BIT-nails))
+ *   2 : positive overflow.  2**(numwords*(wordsize*CHAR_BIT-nails)) <= val
+ *
+ * The value, -2**(numwords*(wordsize*CHAR_BIT-nails)), is representable
+ * in 2's complement representation but not representable in absolute value.
+ * So -1 is returned for the value if INTEGER_PACK_2COMP is specified
+ * but returns -2 if INTEGER_PACK_2COMP is not specified.
+ *
+ * The least significant words are filled in the buffer when overflow occur.
+ */
+
+int
+rb_integer_pack(VALUE val, void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    int sign;
+    BDIGIT *ds;
+    size_t num_bdigits;
+    BDIGIT fixbuf[bdigit_roomof(sizeof(long))];
+
+    RB_GC_GUARD(val) = rb_to_int(val);
+
+    if (FIXNUM_P(val)) {
+        long v = FIX2LONG(val);
+        if (v < 0) {
+            sign = -1;
+            v = -v;
+        }
+        else {
+            sign = 1;
+        }
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+        fixbuf[0] = v;
+#else
+        {
+            int i;
+            for (i = 0; i < numberof(fixbuf); i++) {
+                fixbuf[i] = BIGLO(v);
+                v = BIGDN(v);
+            }
+        }
+#endif
+        ds = fixbuf;
+        num_bdigits = numberof(fixbuf);
+    }
+    else {
+        sign = BIGNUM_POSITIVE_P(val) ? 1 : -1;
+        ds = BDIGITS(val);
+        num_bdigits = BIGNUM_LEN(val);
+    }
+
+    return bary_pack(sign, ds, num_bdigits, words, numwords, wordsize, nails, flags);
+}
+
+/*
+ * Import an integer from a buffer.
+ *
+ * [words] buffer to import.
+ * [numwords] the size of given buffer as number of words.
+ * [wordsize] the size of word as number of bytes.
+ * [nails] number of padding bits in a word.
+ *   Most significant nails bits of each word are ignored.
+ * [flags] bitwise or of constants which name starts "INTEGER_PACK_".
+ *
+ * flags:
+ * [INTEGER_PACK_MSWORD_FIRST] Interpret the first word as the most significant word.
+ * [INTEGER_PACK_LSWORD_FIRST] Interpret the first word as the least significant word.
+ * [INTEGER_PACK_MSBYTE_FIRST] Interpret the first byte in a word as the most significant byte in the word.
+ * [INTEGER_PACK_LSBYTE_FIRST] Interpret the first byte in a word as the least significant byte in the word.
+ * [INTEGER_PACK_NATIVE_BYTE_ORDER] INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST corresponding to the host's endian.
+ * [INTEGER_PACK_2COMP] Use 2's complement representation.
+ * [INTEGER_PACK_LITTLE_ENDIAN] Same as INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_LSBYTE_FIRST
+ * [INTEGER_PACK_BIG_ENDIAN] Same as INTEGER_PACK_MSWORD_FIRST|INTEGER_PACK_MSBYTE_FIRST
+ * [INTEGER_PACK_FORCE_BIGNUM] the result will be a Bignum
+ *   even if it is representable as a Fixnum.
+ * [INTEGER_PACK_NEGATIVE] Returns non-positive value.
+ *   (Returns non-negative value if not specified.)
+ * [INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION] Use generic implementation (for test and debug).
+ *
+ * This function returns the imported integer as Fixnum or Bignum.
+ *
+ * The range of the result value depends on INTEGER_PACK_2COMP and INTEGER_PACK_NEGATIVE.
+ *
+ * INTEGER_PACK_2COMP is not set:
+ *   0 <= val < 2**(numwords*(wordsize*CHAR_BIT-nails)) if !INTEGER_PACK_NEGATIVE
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)) < val <= 0 if INTEGER_PACK_NEGATIVE
+ *
+ * INTEGER_PACK_2COMP is set:
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)-1) <= val <= 2**(numwords*(wordsize*CHAR_BIT-nails)-1)-1 if !INTEGER_PACK_NEGATIVE
+ *   -2**(numwords*(wordsize*CHAR_BIT-nails)) <= val <= -1 if INTEGER_PACK_NEGATIVE
+ *
+ * INTEGER_PACK_2COMP without INTEGER_PACK_NEGATIVE means sign extension.
+ * INTEGER_PACK_2COMP with INTEGER_PACK_NEGATIVE mean assuming the higher bits are 1.
+ *
+ * Note that this function returns 0 when numwords is zero and
+ * INTEGER_PACK_2COMP is set but INTEGER_PACK_NEGATIVE is not set.
+ */
+
+VALUE
+rb_integer_unpack(const void *words, size_t numwords, size_t wordsize, size_t nails, int flags)
+{
+    VALUE val;
+    size_t num_bdigits;
+    int sign;
+    int nlp_bits;
+    BDIGIT *ds;
+    BDIGIT fixbuf[2] = { 0, 0 };
+
+    validate_integer_pack_format(numwords, wordsize, nails, flags,
+            INTEGER_PACK_MSWORD_FIRST|
+            INTEGER_PACK_LSWORD_FIRST|
+            INTEGER_PACK_MSBYTE_FIRST|
+            INTEGER_PACK_LSBYTE_FIRST|
+            INTEGER_PACK_NATIVE_BYTE_ORDER|
+            INTEGER_PACK_2COMP|
+            INTEGER_PACK_FORCE_BIGNUM|
+            INTEGER_PACK_NEGATIVE|
+            INTEGER_PACK_FORCE_GENERIC_IMPLEMENTATION);
+
+    num_bdigits = integer_unpack_num_bdigits(numwords, wordsize, nails, &nlp_bits);
+
+    if (LONG_MAX-1 < num_bdigits)
+        rb_raise(rb_eArgError, "too big to unpack as an integer");
+    if (num_bdigits <= numberof(fixbuf) && !(flags & INTEGER_PACK_FORCE_BIGNUM)) {
+        val = Qfalse;
+        ds = fixbuf;
+    }
+    else {
+        val = bignew((long)num_bdigits, 0);
+        ds = BDIGITS(val);
+    }
+    sign = bary_unpack_internal(ds, num_bdigits, words, numwords, wordsize, nails, flags, nlp_bits);
+
+    if (sign == -2) {
+        if (val) {
+            big_extend_carry(val);
+        }
+        else if (num_bdigits == numberof(fixbuf)) {
+            val = bignew((long)num_bdigits+1, 0);
+            MEMCPY(BDIGITS(val), fixbuf, BDIGIT, num_bdigits);
+            BDIGITS(val)[num_bdigits++] = 1;
+        }
+        else {
+            ds[num_bdigits++] = 1;
+        }
+    }
+
+    if (!val) {
+        BDIGIT_DBL u = fixbuf[0] + BIGUP(fixbuf[1]);
+        if (u == 0)
+            return LONG2FIX(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((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), BIGNUM_LEN(val)))
+        sign = 0;
+    BIGNUM_SET_SIGN(val, 0 <= sign);
+
+    if (flags & INTEGER_PACK_FORCE_BIGNUM)
+        return bigtrunc(val);
+    return bignorm(val);
+}
+
+#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));
+
+static inline int
+valid_radix_p(int base)
+{
+    return (1 < base && base <= 36);
+}
+
+static inline void
+invalid_radix(int base)
+{
+    rb_raise(rb_eArgError, "invalid radix %d", base);
+}
+
+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)
+{
+    BDIGIT *dp;
+    BDIGIT_DBL dd;
+    int numbits;
+
+    size_t num_bdigits;
+    const char *p;
+    int c;
     VALUE z;
-    USHORT *zds;
-
-    while (*str && ISSPACE(*str)) str++;
-
-    if (*str == '+') {
-	str++;
-    }
-    else if (*str == '-') {
-	str++;
-	sign = 0;
-    }
-    if (base == 0) {
-	if (*str == '0') {
-	    str++;
-	    if (*str == 'x' || *str == 'X') {
-		str++;
-		base = 16;
-	    }
-	    else if (*str == 'b' || *str == 'B') {
-		str++;
-		base = 2;
-	    }
-	    else {
-		base = 8;
-		if (!*str) return INT2FIX(0);
-	    }
-	}
-	else {
-	    base = 10;
-	    if (!*str) return INT2FIX(0);
-	}
-    }
-    if (base == 8) {
-	while (str[0] == '0') str++;
-	len = 3*strlen(str)*sizeof(char);
-    }
-    else {			/* base == 10, 2 or 16 */
-	if (base == 16 && str[0] == '0' && (str[1] == 'x'||str[1] == 'X')) {
-	    str += 2;
-	}
-	if (base == 2 && str[0] == '0' && (str[1] == 'b'||str[1] == 'B')) {
-	    str += 2;
-	}
-	while (*str && *str == '0') str++;
-	if (!*str) str--;
-	len = 4*strlen(str)*sizeof(char);
-    }
-
-    if (len <= (sizeof(VALUE)*CHAR_BIT)) {
-	unsigned long val = strtoul((char*)str, &end, base);
-
-	if (badcheck) {
-	    if (end == str || *end)
-		goto bad;
-	    while (*end && ISSPACE(*end)) end++;
-	    if (*end) {
-	      bad:
-		rb_raise(rb_eArgError, "invalid literal for Integer: %s", s);
-	    }
-	}
-
-	if (POSFIXABLE(val)) {
-	    if (sign) return INT2FIX(val);
-	    else {
-		long result = -(long)val;
-		return INT2FIX(result);
-	    }
-	}
-	else {
-	    VALUE big = rb_uint2big(val);
-	    RBIGNUM(big)->sign = sign;
-	    return big;
-	}
-    }
-    len = (len/BITSPERDIG)+1;
 
-    z = bignew(len, sign);
+    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);
+    }
+    RUBY_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;
+
+    z = bignew(num_bdigits, sign);
     zds = BDIGITS(z);
-    for (i=len;i--;) zds[i]=0;
-    while (c = *str++) {
-	switch (c) {
-	  case '0': case '1': case '2': case '3': case '4':
-	  case '5': case '6': case '7': case '8': case '9':
-	    c = c - '0';
-	    break;
-	  case 'a': case 'b': case 'c':
-	  case 'd': case 'e': case 'f':
-	    c = c - 'a' + 10;
-	    break;
-	  case 'A': case 'B': case 'C':
-	  case 'D': case 'E': case 'F':
-	    c = c - 'A' + 10;
-	    break;
-	  default:
-	    c = base;
-	    if (badcheck) {
-		if (ISSPACE(c)) {
-		    while (*str && ISSPACE(*str)) str++;
-		    if (*str) {
-			break;
-		    }
-		}
-		rb_raise(rb_eArgError, "invalid literal for Integer: %s", s);
-	    }
-	    break;
-	}
-	if (c >= base) break;
-	i = 0;
-	num = c;
-	for (;;) {
-	    while (i<blen) {
-		num += zds[i]*base;
-		zds[i++] = BIGLO(num);
-		num = BIGDN(num);
-	    }
-	    if (num) {
-		blen++;
-		continue;
-	    }
-	    break;
-	}
+    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;
+        }
+        RUBY_ASSERT(blen <= num_bdigits);
+    }
+
+    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;
+        }
+    }
+    RUBY_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;
+    }
+    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 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;
+    }
+    *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);
+    }
+    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 {\
+        RUBY_ASSERT(len != 0); \
+        if (len0 >= 0) RUBY_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' && 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')) {
+            ADV(2);
+        }
+    }
+    else if (base == 8) {
+        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')) {
+            ADV(2);
+        }
+    }
+    else if (base == 16) {
+        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 && 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 (POSFIXABLE(val)) {
+            if (sign) return LONG2FIX(val);
+            else {
+                long result = -(long)val;
+                return LONG2FIX(result);
+            }
+        }
+        else {
+            VALUE big = rb_uint2big(val);
+            BIGNUM_SET_SIGN(big, sign);
+            return bignorm(big);
+        }
+    }
+
+  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) {
+            z = str2big_normal(sign, digits_start, digits_end,
+                    num_bdigits, base);
+        }
+        else {
+            z = str2big_karatsuba(sign, digits_start, digits_end, num_digits,
+                    num_bdigits, digits_per_bdigits_dbl, base);
+        }
     }
 
     return bignorm(z);
+
+  bad:
+    if (endp) *endp = (char *)str;
+    if (ndigits) *ndigits = num_digits;
+    return z;
+}
+
+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_str2inum(str, base)
-    VALUE str;
-    int base;
+rb_str_convert_to_inum(VALUE str, int base, int badcheck, int raise_exception)
 {
-    char *s;
-    int len;
+    VALUE ret;
+    const char *s;
+    long len;
+    char *end;
 
-    s = rb_str2cstr(str, &len);
-    if (len != strlen(s)) {
-	rb_raise(rb_eArgError, "string for Integer contains null byte");
+    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 rb_cstr2inum(s, base); 
+    return ret;
 }
 
-static char hexmap[] = "0123456789abcdef";
 VALUE
-rb_big2str(x, base)
-    VALUE x;
+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_str2big_normal(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_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);
+    }
+
+    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
+
+VALUE
+rb_ull2big(unsigned LONG_LONG n)
+{
+    long i;
+    VALUE big = bignew(bdigit_roomof(SIZEOF_LONG_LONG), 1);
+    BDIGIT *digits = BDIGITS(big);
+
+#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);
+    }
+#endif
+
+    i = bdigit_roomof(SIZEOF_LONG_LONG);
+    while (i-- && !digits[i]) ;
+    BIGNUM_SET_LEN(big, i+1);
+    return big;
+}
+
+VALUE
+rb_ll2big(LONG_LONG n)
+{
+    long neg = 0;
+    unsigned LONG_LONG u;
+    VALUE big;
+
+    if (n < 0) {
+        u = 1 + (unsigned LONG_LONG)(-(n + 1)); /* u = -n avoiding overflow */
+        neg = 1;
+    }
+    else {
+        u = n;
+    }
+    big = rb_ull2big(u);
+    if (neg) {
+        BIGNUM_SET_NEGATIVE_SIGN(big);
+    }
+    return big;
+}
+
+VALUE
+rb_ull2inum(unsigned LONG_LONG n)
+{
+    if (POSFIXABLE(n)) return LONG2FIX((long)n);
+    return rb_ull2big(n);
+}
+
+VALUE
+rb_ll2inum(LONG_LONG n)
+{
+    if (FIXABLE(n)) return LONG2FIX((long)n);
+    return rb_ll2big(n);
+}
+
+#endif  /* HAVE_LONG_LONG */
+
+#ifdef HAVE_INT128_T
+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;
+}
+
+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)
+{
+    return rb_cstr_to_inum(str, base, base==0);
+}
+
+VALUE
+rb_str2inum(VALUE str, int base)
+{
+    return rb_str_to_inum(str, base, base==0);
+}
+
+static VALUE
+big_shift3(VALUE x, int lshift_p, size_t shift_numdigits, int shift_numbits)
+{
+    BDIGIT *xds, *zds;
+    long s1;
+    int s2;
+    VALUE z;
+    long xn;
+
+    if (lshift_p) {
+        if (LONG_MAX < shift_numdigits) {
+          too_big:
+            rb_raise(rb_eRangeError, "shift width too big");
+        }
+        s1 = shift_numdigits;
+        s2 = shift_numbits;
+        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);
+        zds[xn+s1] = bary_small_lshift(zds+s1, xds, xn, s2);
+    }
+    else {
+        long zn;
+        BDIGIT hibitsx;
+        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);
+        }
+        s1 = shift_numdigits;
+        s2 = shift_numbits;
+        hibitsx = abs2twocomp(&x, &xn);
+        xds = BDIGITS(x);
+        if (xn <= s1) {
+            return hibitsx ? INT2FIX(-1) : INT2FIX(0);
+        }
+        zn = xn - s1;
+        z = bignew(zn, 0);
+        zds = BDIGITS(z);
+        bary_small_rshift(zds, xds+s1, zn, s2, hibitsx != 0 ? BDIGMAX : 0);
+        twocomp2abs_bang(z, hibitsx != 0);
+    }
+    RB_GC_GUARD(x);
+    return z;
+}
+
+static VALUE
+big_shift2(VALUE x, int lshift_p, VALUE y)
+{
+    int sign;
+    size_t lens[2];
+    size_t shift_numdigits;
+    int shift_numbits;
+
+    RUBY_ASSERT(POW2_P(CHAR_BIT));
+    RUBY_ASSERT(POW2_P(BITSPERDIG));
+
+    if (BIGZEROP(x))
+        return INT2FIX(0);
+    sign = rb_integer_pack(y, lens, numberof(lens), sizeof(size_t), 0,
+        INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER);
+    if (sign < 0) {
+        lshift_p = !lshift_p;
+        sign = -sign;
+    }
+    if (lshift_p) {
+        if (1 < sign || CHAR_BIT <= lens[1])
+            rb_raise(rb_eRangeError, "shift width too big");
+    }
+    else {
+        if (1 < sign || CHAR_BIT <= lens[1])
+            return BIGNUM_POSITIVE_P(x) ? INT2FIX(0) : INT2FIX(-1);
+    }
+    shift_numbits = (int)(lens[0] & (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);
+}
+
+static VALUE
+big_lshift(VALUE x, unsigned long shift)
+{
+    long s1 = shift/BITSPERDIG;
+    int s2 = (int)(shift%BITSPERDIG);
+    return big_shift3(x, 1, s1, s2);
+}
+
+static VALUE
+big_rshift(VALUE x, unsigned long shift)
+{
+    long s1 = shift/BITSPERDIG;
+    int s2 = (int)(shift%BITSPERDIG);
+    return big_shift3(x, 0, s1, s2);
+}
+
+#define MAX_BASE36_POWER_TABLE_ENTRIES (SIZEOF_SIZE_T * CHAR_BIT + 1)
+
+static VALUE base36_power_cache[35][MAX_BASE36_POWER_TABLE_ENTRIES];
+static size_t base36_numdigits_cache[35][MAX_BASE36_POWER_TABLE_ENTRIES];
+
+static void
+power_cache_init(void)
+{
+}
+
+static inline VALUE
+power_cache_get_power(int base, int power_level, size_t *numdigits_ret)
+{
+    /*
+     * MAX_BASE36_POWER_TABLE_ENTRIES is big enough to that
+     * base36_power_cache[base][MAX_BASE36_POWER_TABLE_ENTRIES-1] fills whole memory.
+     * So MAX_BASE36_POWER_TABLE_ENTRIES <= power_level is not possible to calculate.
+     *
+     * number-of-bytes =
+     * log256(base36_power_cache[base][MAX_BASE36_POWER_TABLE_ENTRIES-1]) =
+     * log256(maxpow_in_bdigit_dbl(base)**(2**(MAX_BASE36_POWER_TABLE_ENTRIES-1))) =
+     * log256(maxpow_in_bdigit_dbl(base)**(2**(SIZEOF_SIZE_T*CHAR_BIT))) =
+     * (2**(SIZEOF_SIZE_T*CHAR_BIT))*log256(maxpow_in_bdigit_dbl(base)) =
+     * (256**SIZEOF_SIZE_T)*log256(maxpow_in_bdigit_dbl(base)) >
+     * (256**SIZEOF_SIZE_T)*(sizeof(BDIGIT_DBL)-1) >
+     * 256**SIZEOF_SIZE_T
+     */
+    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);
+
+    VALUE power = base36_power_cache[base - 2][power_level];
+    if (!power) {
+        size_t numdigits;
+        if (power_level == 0) {
+            int numdigits0;
+            BDIGIT_DBL dd = maxpow_in_bdigit_dbl(base, &numdigits0);
+            power = bignew(2, 1);
+            bdigitdbl2bary(BDIGITS(power), 2, dd);
+            numdigits = numdigits0;
+        }
+        else {
+            power = bigtrunc(bigsq(power_cache_get_power(base, power_level - 1, &numdigits)));
+            numdigits *= 2;
+        }
+        rb_obj_hide(power);
+        base36_power_cache[base - 2][power_level] = power;
+        base36_numdigits_cache[base - 2][power_level] = numdigits;
+        rb_vm_register_global_object(power);
+    }
+    if (numdigits_ret)
+        *numdigits_ret = base36_numdigits_cache[base - 2][power_level];
+    return power;
+}
+
+struct big2str_struct {
+    int negative;
     int base;
+    BDIGIT_DBL hbase2;
+    int hbase2_numdigits;
+    VALUE result;
+    char *ptr;
+};
+
+static void
+big2str_alloc(struct big2str_struct *b2s, size_t len)
 {
-    VALUE t;
-    USHORT *ds;
-    unsigned long i, j, hbase;
-    VALUE ss;
-    char *s, c;
+    if (LONG_MAX-1 < len)
+        rb_raise(rb_eArgError, "too big number");
+    b2s->result = rb_usascii_str_new(0, (long)(len + 1)); /* plus one for sign */
+    b2s->ptr = RSTRING_PTR(b2s->result);
+    if (b2s->negative)
+        *b2s->ptr++ = '-';
+}
 
-    if (FIXNUM_P(x)) {
-	return rb_fix2str(x, base);
+static void
+big2str_2bdigits(struct big2str_struct *b2s, BDIGIT *xds, size_t xn, size_t taillen)
+{
+    size_t j;
+    BDIGIT_DBL num;
+    char buf[SIZEOF_BDIGIT_DBL*CHAR_BIT], *p;
+    int beginning = !b2s->ptr;
+    size_t len = 0;
+
+    RUBY_ASSERT(xn <= 2);
+    num = bary2bdigitdbl(xds, xn);
+
+    if (beginning) {
+        if (num == 0)
+            return;
+        p = buf;
+        j = sizeof(buf);
+        if (b2s->base == 10) {
+            /* Emit two decimal digits per iteration from ruby_decimal_digit_pairs.
+             * See the comment on the table in bignum.c near ruby_digitmap. */
+            while (num >= 100) {
+                BDIGIT_DBL idx = (num % 100) * 2;
+                num /= 100;
+                j -= 2;
+                p[j]     = ruby_decimal_digit_pairs[idx];
+                p[j + 1] = ruby_decimal_digit_pairs[idx + 1];
+            }
+            if (num >= 10) {
+                BDIGIT_DBL idx = num * 2;
+                j -= 2;
+                p[j]     = ruby_decimal_digit_pairs[idx];
+                p[j + 1] = ruby_decimal_digit_pairs[idx + 1];
+            }
+            else {
+                /* num is 1..9 here (0 was handled above) */
+                p[--j] = (char)('0' + num);
+            }
+        }
+        else {
+            do {
+                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);
     }
-    i = RBIGNUM(x)->len;
-    if (i == 0) return rb_str_new2("0");
-    if (base == 10) {
-	j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i*241L)/800+2;
-	hbase = 10000;
+    else {
+        p = b2s->ptr;
+        j = b2s->hbase2_numdigits;
+        if (b2s->base == 10) {
+            /* Non-beginning chunks must emit EXACTLY hbase2_numdigits,
+             * zero-padded on the left.  Consume num in 2-digit groups,
+             * handle the odd trailing digit, then memset remaining
+             * positions with '0'. */
+            while (num >= 100) {
+                BDIGIT_DBL idx = (num % 100) * 2;
+                num /= 100;
+                j -= 2;
+                p[j]     = ruby_decimal_digit_pairs[idx];
+                p[j + 1] = ruby_decimal_digit_pairs[idx + 1];
+            }
+            if (num >= 10) {
+                BDIGIT_DBL idx = num * 2;
+                j -= 2;
+                p[j]     = ruby_decimal_digit_pairs[idx];
+                p[j + 1] = ruby_decimal_digit_pairs[idx + 1];
+            }
+            else if (num > 0) {
+                p[--j] = (char)('0' + num);
+            }
+            if (j > 0) {
+                memset(p, '0', j);
+                j = 0;
+            }
+        }
+        else {
+            do {
+                BDIGIT_DBL idx = num % b2s->base;
+                num /= b2s->base;
+                p[--j] = ruby_digitmap[idx];
+            } while (j);
+        }
+        len = b2s->hbase2_numdigits;
     }
-    else if (base == 16) {
-	j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i)/4+2;
-	hbase = 0x10000;
+    b2s->ptr += len;
+}
+
+static void
+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;
+    const BDIGIT *bds;
+    size_t len;
+
+    /*
+     * Precondition:
+     * abs(x) < maxpow**(2**power_level)
+     * where
+     *   maxpow = maxpow_in_bdigit_dbl(base, &numdigits)
+     *
+     * This function generates sequence of zeros, and then stringized abs(x) into b2s->ptr.
+     *
+     * b2s->ptr can be NULL.
+     * It is allocated when the first character is generated via big2str_alloc.
+     *
+     * The prefix zeros should be generated if and only if b2s->ptr is not NULL.
+     * When the zeros are generated, the zeros and abs(x) consists
+     * numdigits*(2**power_level) characters at total.
+     *
+     * Note:
+     * power_cache_get_power(base, power_level, &len) may not be cached yet. It should not be called.
+     * power_cache_get_power(base, power_level-1, &len) should be cached already if 0 <= power_level-1.
+     */
+
+    if (xn == 0 || bary_zero_p(xds, xn)) {
+        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);
+            b2s->ptr += len;
+        }
+        return;
     }
-    else if (base == 8) {
-	j = (sizeof(USHORT)/sizeof(char)*CHAR_BIT*i)+2;
-	hbase = 010000;
+
+    if (power_level == 0) {
+        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 = BIGNUM_LEN(b);
+    bds = BDIGITS(b);
+
+    half_numdigits = lower_numdigits;
+
+    while (0 < lower_power_level &&
+            (xn < bn ||
+             (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 = BIGNUM_LEN(b);
+        bds = BDIGITS(b);
+    }
+
+    if (lower_power_level == 0 &&
+            (xn < bn ||
+             (xn == bn && bary_cmp(xds, xn, bds, bn) < 0))) {
+        if (b2s->ptr) {
+            len = half_numdigits * 2 - lower_numdigits;
+            memset(b2s->ptr, '0', len);
+            b2s->ptr += len;
+        }
+        big2str_2bdigits(b2s, xds, xn, taillen);
+    }
+    else {
+        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;
+            RUBY_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;
+
+        qds = xds + bn;
+        qn = qn - bn;
+
+        if (shift) {
+            bary_small_rshift(rds, rds, rn, shift, 0);
+        }
+
+        BARY_TRUNC(qds, qn);
+        RUBY_ASSERT(qn <= bn);
+        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);
     }
-    else if (base == 2) {
-	j = (sizeof(USHORT)*CHAR_BIT*i)+2;
-	hbase = 020;
-    }
-    else {
-	j = 0;
-	hbase = 0;
-	rb_raise(rb_eArgError, "bignum cannot treat base %d", base);
-    }
-
-    t = rb_big_clone(x);
-    ds = BDIGITS(t);
-    ss = rb_str_new(0, j);
-    s = RSTRING(ss)->ptr;
-
-    s[0] = RBIGNUM(x)->sign ? '+' : '-';
-    while (i && j) {
-	long k = i;
-	unsigned long num = 0;
-	while (k--) {
-	    num = BIGUP(num) + ds[k];
-	    ds[k] = (USHORT)(num / hbase);
-	    num %= hbase;
-	}
-	if (ds[i-1] == 0) i--;
-	k = 4;
-	while (k--) {
-	    c = (char)(num % base);
-	    s[--j] = hexmap[(int)c];
-	    num /= base;
-	    if (i == 0 && num == 0) break;
-	}
-    }
-    while (s[j] == '0') j++;
-    RSTRING(ss)->len -= RBIGNUM(x)->sign?j:j-1;
-    memmove(RBIGNUM(x)->sign?s:s+1, s+j, RSTRING(ss)->len);
-    s[RSTRING(ss)->len] = '\0';
-
-    return ss;
 }
 
 static VALUE
-rb_big_to_s(x)
-    VALUE x;
+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 (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++ = BIGNUM_POSITIVE_P(x) ? '+' : '-';
+    }
+    else {
+        if (LONG_MAX < numwords)
+            rb_raise(rb_eArgError, "too big number");
+        result = rb_usascii_str_new(0, numwords);
+        ptr = RSTRING_PTR(result);
+    }
+    rb_integer_pack(x, ptr, numwords, 1, CHAR_BIT-word_numbits,
+                    INTEGER_PACK_BIG_ENDIAN);
+    while (0 < numwords) {
+        *ptr = ruby_digitmap[*(unsigned char *)ptr];
+        ptr++;
+        numwords--;
+    }
+    return result;
+}
+
+VALUE
+rb_big2str_poweroftwo(VALUE x, int base)
+{
+    return big2str_base_poweroftwo(x, base);
+}
+
+static VALUE
+big2str_generic(VALUE x, int base)
+{
+    BDIGIT *xds;
+    size_t xn;
+    struct big2str_struct b2s_data;
+    int power_level;
+    VALUE power;
+
+    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'");
+    }
+
+    power_level = 0;
+    power = power_cache_get_power(base, power_level, NULL);
+    while (power_level < MAX_BASE36_POWER_TABLE_ENTRIES &&
+           (size_t)BIGNUM_LEN(power) <= (xn+1)/2) {
+        power_level++;
+        power = power_cache_get_power(base, power_level, NULL);
+    }
+    RUBY_ASSERT(power_level != MAX_BASE36_POWER_TABLE_ENTRIES);
+
+    if ((size_t)BIGNUM_LEN(power) <= xn) {
+        /*
+         * This increment guarantees x < power_cache_get_power(base, power_level)
+         * without invoking it actually.
+         * (power_cache_get_power(base, power_level) can be slow and not used
+         * in big2str_karatsuba.)
+         *
+         * Although it is possible that x < power_cache_get_power(base, power_level-1),
+         * it is no problem because big2str_karatsuba checks it and
+         * doesn't affect the result when b2s_data.ptr is NULL.
+         */
+        power_level++;
+    }
+
+    b2s_data.negative = BIGNUM_NEGATIVE_P(x);
+    b2s_data.base = base;
+    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_2bdigits(&b2s_data, xds, xn, 0);
+    }
+    else {
+        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;
+}
+
+VALUE
+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;
+    BDIGIT *xds = BDIGITS(x);
+    size_t xn = BIGNUM_LEN(x);
+
+    mpz_init(mx);
+    bdigits_to_mpz(mx, xds, xn);
+
+    size = mpz_sizeinbase(mx, base);
+
+    if (BIGNUM_NEGATIVE_P(x)) {
+        mpz_neg(mx, mx);
+        str = rb_usascii_str_new(0, size+1);
+    }
+    else {
+        str = rb_usascii_str_new(0, size);
+    }
+    mpz_get_str(RSTRING_PTR(str), base, mx);
+    mpz_clear(mx);
+
+    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_gmp(VALUE x, int base)
+{
+    return big2str_gmp(x, base);
+}
+#endif
+
+static VALUE
+rb_big2str1(VALUE x, int base)
+{
+    BDIGIT *xds;
+    size_t xn;
+
+    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);
+    }
+
+#if USE_GMP
+    if (GMP_BIG2STR_DIGITS < xn) {
+        return big2str_gmp(x, base);
+    }
+#endif
+
+    return big2str_generic(x, base);
+}
+
+VALUE
+rb_big2str(VALUE x, int base)
 {
-    return rb_big2str(x, 10);
+    return rb_big2str1(x, base);
 }
 
 static unsigned long
-big2ulong(x, type)
-    VALUE x;
-    char *type;
+big2ulong(VALUE x, const char *type)
 {
+#if SIZEOF_LONG > SIZEOF_BDIGIT
+    size_t i;
+#endif
+    size_t len = BIGNUM_LEN(x);
     unsigned long num;
-    long len = RBIGNUM(x)->len;
-    USHORT *ds;
+    BDIGIT *ds;
 
-    if (len > sizeof(long)/sizeof(USHORT))
-	rb_raise(rb_eRangeError, "bignum too big to convert into `%s'", type);
+    if (len == 0)
+        return 0;
+    if (BIGSIZE(x) > sizeof(long)) {
+        rb_raise(rb_eRangeError, "bignum too big to convert into '%s'", type);
+    }
     ds = BDIGITS(x);
+#if SIZEOF_LONG <= SIZEOF_BDIGIT
+    num = (unsigned long)ds[0];
+#else
     num = 0;
-    while (len--) {
-	num = BIGUP(num);
-	num += ds[len];
+    for (i = 0; i < len; i++) {
+        num <<= BITSPERDIG;
+        num += (unsigned long)ds[len - i - 1]; /* overflow is already checked */
     }
+#endif
     return num;
 }
 
 unsigned long
-rb_big2ulong(x)
-    VALUE x;
+rb_big2ulong(VALUE x)
 {
     unsigned long num = big2ulong(x, "unsigned long");
 
-    if (!RBIGNUM(x)->sign) return -num;
-    return num;
+    if (BIGNUM_POSITIVE_P(x)) {
+        return num;
+    }
+    else {
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum out of range of unsigned long");
 }
 
 long
-rb_big2long(x)
-    VALUE x;
+rb_big2long(VALUE x)
 {
-    unsigned long num = big2ulong(x, "int");
+    unsigned long num = big2ulong(x, "long");
+
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (num <= LONG_MAX)
+            return num;
+    }
+    else {
+        if (num <= 1+(unsigned long)(-(LONG_MIN+1)))
+            return -(long)(num-1)-1;
+    }
+    rb_raise(rb_eRangeError, "bignum too big to convert into 'long'");
+}
+
+#if HAVE_LONG_LONG
 
-    if ((long)num < 0) {
-	rb_raise(rb_eRangeError, "bignum too big to convert into `int'");
+static unsigned LONG_LONG
+big2ull(VALUE x, const char *type)
+{
+#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_BDIGIT
+    num = (unsigned LONG_LONG)ds[0];
+#else
+    num = 0;
+    for (i = 0; i < len; i++) {
+        num = BIGUP(num);
+        num += ds[len - i - 1];
     }
-    if (!RBIGNUM(x)->sign) return -(long)num;
+#endif
     return num;
 }
 
+unsigned LONG_LONG
+rb_big2ull(VALUE x)
+{
+    unsigned LONG_LONG num = big2ull(x, "unsigned long long");
+
+    if (BIGNUM_POSITIVE_P(x)) {
+        return num;
+    }
+    else {
+        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");
+}
+
+LONG_LONG
+rb_big2ll(VALUE x)
+{
+    unsigned LONG_LONG num = big2ull(x, "long long");
+
+    if (BIGNUM_POSITIVE_P(x)) {
+        if (num <= LLONG_MAX)
+            return num;
+    }
+    else {
+        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'");
+}
+
+#endif  /* HAVE_LONG_LONG */
+
 static VALUE
-dbl2big(d)
-    double d;
+dbl2big(double d)
 {
-    unsigned long i = 0;
-    long c;
-    USHORT *digits;
+    long i = 0;
+    BDIGIT c;
+    BDIGIT *digits;
     VALUE z;
     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 = (long)u;
-	u -= c;
-	digits[i] = (USHORT)c;
+        u *= BIGRAD;
+        c = (BDIGIT)u;
+        u -= c;
+        digits[i] = c;
     }
 
     return z;
 }
 
 VALUE
-rb_dbl2big(d)
-    double d;
+rb_dbl2big(double d)
 {
     return bignorm(dbl2big(d));
 }
 
-double
-rb_big2dbl(x)
-    VALUE x;
+static double
+big2dbl(VALUE x)
 {
     double d = 0.0;
-    long i = RBIGNUM(x)->len;
-    USHORT *ds = BDIGITS(x);
+    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) {
+                    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;
+}
 
-    while (i--) {
-	d = ds[i] + BIGRAD*d;
+double
+rb_big2dbl(VALUE x)
+{
+    double d = big2dbl(x);
+
+    if (isinf(d)) {
+        rb_warning("Integer out of Float range");
+        if (d < 0.0)
+            d = -HUGE_VAL;
+        else
+            d = HUGE_VAL;
     }
-    if (!RBIGNUM(x)->sign) d = -d;
     return d;
 }
 
-static VALUE
-rb_big_to_f(x)
-    VALUE x;
+VALUE
+rb_integer_float_cmp(VALUE x, VALUE y)
 {
-    return rb_float_new(rb_big2dbl(x));
+    double yd = RFLOAT_VALUE(y);
+    double yi, yf;
+    VALUE rel;
+
+    if (isnan(yd))
+        return Qnil;
+    if (isinf(yd)) {
+        if (yd > 0.0) return INT2FIX(-1);
+        else return INT2FIX(1);
+    }
+    yf = modf(yd, &yi);
+    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 INT2FIX(-1);
+        if (xd > yd)
+            return INT2FIX(1);
+        return INT2FIX(0);
+#else
+        long xn, yn;
+        if (yi < FIXNUM_MIN)
+            return INT2FIX(1);
+        if (FIXNUM_MAX+1 <= yi)
+            return INT2FIX(-1);
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        if (xn < yn)
+            return INT2FIX(-1);
+        if (xn > yn)
+            return INT2FIX(1);
+        if (yf < 0.0)
+            return INT2FIX(1);
+        if (0.0 < yf)
+            return INT2FIX(-1);
+        return INT2FIX(0);
+#endif
+    }
+    y = rb_dbl2big(yi);
+    rel = rb_big_cmp(x, y);
+    if (yf == 0.0 || rel != INT2FIX(0))
+        return rel;
+    if (yf < 0.0)
+        return INT2FIX(1);
+    return INT2FIX(-1);
 }
 
-static VALUE
-rb_big_cmp(x, y)
-    VALUE x, y;
+#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)
 {
-    long xlen = RBIGNUM(x)->len;
+    double yd = RFLOAT_VALUE(y);
+    double yi, yf;
+
+    if (!isfinite(yd))
+        return Qfalse;
+    yf = modf(yd, &yi);
+    if (yf != 0)
+        return Qfalse;
+    if (FIXNUM_P(x)) {
+#if SIZEOF_LONG * CHAR_BIT < DBL_MANT_DIG /* assume FLT_RADIX == 2 */
+        double xd = (double)FIX2LONG(x);
+        return RBOOL(xd == yd);
+#else
+        long xn, yn;
+        if (yi < LONG_MIN || LONG_MAX_as_double <= yi)
+            return Qfalse;
+        xn = FIX2LONG(x);
+        yn = (long)yi;
+        return RBOOL(xn == yn);
+#endif
+    }
+    y = rb_dbl2big(yi);
+    return rb_big_eq(x, y);
+}
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
 
-      case T_BIGNUM:
-	break;
+VALUE
+rb_big_cmp(VALUE x, VALUE y)
+{
+    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);
+    }
+    else {
+        return rb_num_coerce_cmp(x, y, idCmp);
+    }
+    return INT2FIX(BIGNUM_SIGN(x) ? 1 : -1);
+}
+
+enum big_op_t {
+    big_op_gt,
+    big_op_ge,
+    big_op_lt,
+    big_op_le
+};
 
-      case T_FLOAT:
-	y = dbl2big(RFLOAT(y)->value);
-	break;
+static VALUE
+big_op(VALUE x, VALUE y, enum big_op_t op)
+{
+    VALUE rel;
+    int n;
 
-      default:
-	return rb_num_coerce_bin(x, y);
+    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);
+    }
+    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 (RBIGNUM(x)->sign > RBIGNUM(y)->sign) return INT2FIX(1);
-    if (RBIGNUM(x)->sign < RBIGNUM(y)->sign) return INT2FIX(-1);
-    if (xlen < RBIGNUM(y)->len)
-	return (RBIGNUM(x)->sign) ? INT2FIX(-1) : INT2FIX(1);
-    if (xlen > RBIGNUM(y)->len)
-	return (RBIGNUM(x)->sign) ? INT2FIX(1) : INT2FIX(-1);
+    if (NIL_P(rel)) return Qfalse;
+    n = FIX2INT(rel);
 
-    while(xlen-- && (BDIGITS(x)[xlen]==BDIGITS(y)[xlen]));
-    if (-1 == xlen) return INT2FIX(0);
-    return (BDIGITS(x)[xlen] > BDIGITS(y)[xlen]) ?
-	(RBIGNUM(x)->sign ? INT2FIX(1) : INT2FIX(-1)) :
-	    (RBIGNUM(x)->sign ? INT2FIX(-1) : INT2FIX(1));
+    switch (op) {
+      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;
 }
 
-static VALUE
-rb_big_eq(x, y)
-    VALUE x, y;
-{
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
-      case T_BIGNUM:
-	break;
-      case T_FLOAT:
-	y = dbl2big(RFLOAT(y)->value);
-	break;
-      default:
-	return Qfalse;
-    }
-    if (RBIGNUM(x)->sign != RBIGNUM(y)->sign) return Qfalse;
-    if (RBIGNUM(x)->len != RBIGNUM(y)->len) return Qfalse;
-    if (memcmp(BDIGITS(x),BDIGITS(y),RBIGNUM(y)->len) != 0) return Qfalse;
-    return Qtrue;
+VALUE
+rb_big_gt(VALUE x, VALUE y)
+{
+    return big_op(x, y, big_op_gt);
 }
 
-static VALUE
-rb_big_uminus(x)
-    VALUE x;
+VALUE
+rb_big_ge(VALUE x, VALUE y)
+{
+    return big_op(x, y, big_op_ge);
+}
+
+VALUE
+rb_big_lt(VALUE x, VALUE y)
+{
+    return big_op(x, y, big_op_lt);
+}
+
+VALUE
+rb_big_le(VALUE x, VALUE y)
+{
+    return big_op(x, y, big_op_le);
+}
+
+/*
+ *  call-seq:
+ *     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 Integer#eql?, which requires
+ *  <i>obj</i> to be an Integer.
+ *
+ *     68719476736 == 68719476736.0   #=> true
+ */
+
+VALUE
+rb_big_eq(VALUE x, VALUE y)
+{
+    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);
+    }
+    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);
+}
+
+VALUE
+rb_big_eql(VALUE x, VALUE y)
+{
+    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);
+}
+
+VALUE
+rb_big_uminus(VALUE x)
 {
     VALUE z = rb_big_clone(x);
 
-    RBIGNUM(z)->sign = !RBIGNUM(x)->sign;
+    BIGNUM_NEGATE(z);
 
     return bignorm(z);
 }
 
-static VALUE
-rb_big_neg(x)
-    VALUE x;
+VALUE
+rb_big_comp(VALUE x)
 {
     VALUE z = rb_big_clone(x);
-    long i = RBIGNUM(x)->len;
-    USHORT *ds = BDIGITS(z);
+    BDIGIT *ds = BDIGITS(z);
+    long n = BIGNUM_LEN(z);
 
-    if (!RBIGNUM(x)->sign) rb_big_2comp(z);
-    while (i--) ds[i] = ~ds[i];
-    if (RBIGNUM(x)->sign) rb_big_2comp(z);
-    RBIGNUM(z)->sign = !RBIGNUM(z)->sign;
+    if (!n) return INT2FIX(-1);
+
+    if (BIGNUM_POSITIVE_P(z)) {
+        if (bary_add_one(ds, n)) {
+            big_extend_carry(z);
+        }
+        BIGNUM_SET_NEGATIVE_SIGN(z);
+    }
+    else {
+        bary_neg(ds, n);
+        if (bary_add_one(ds, n))
+            return INT2FIX(-1);
+        bary_neg(ds, n);
+        BIGNUM_SET_POSITIVE_SIGN(z);
+    }
 
     return bignorm(z);
 }
 
 static VALUE
-bigsub(x, y)
-    VALUE x, y;
+bigsub(VALUE x, VALUE y)
 {
-    VALUE z = 0;
-    USHORT *zds;
-    long num;
-    long i;
+    VALUE z;
+    BDIGIT *xds, *yds, *zds;
+    long xn, yn, zn;
 
-    i = RBIGNUM(x)->len;
-    /* if x is larger than y, swap */
-    if (RBIGNUM(x)->len < RBIGNUM(y)->len) {
-	z = x; x = y; y = z;	/* swap x y */
-    }
-    else if (RBIGNUM(x)->len == RBIGNUM(y)->len) {
-	while (i > 0) {
-	    i--;
-	    if (BDIGITS(x)[i] > BDIGITS(y)[i]) {
-		break;
-	    }
-	    if (BDIGITS(x)[i] < BDIGITS(y)[i]) {
-		z = x; x = y; y = z;	/* swap x y */
-		break;
-	    }
-	}
-    }
-
-    z = bignew(RBIGNUM(x)->len, (z == 0)?1:0);
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    zn = xn < yn ? yn : xn;
+
+    z = bignew(zn, 1);
+
+    xds = BDIGITS(x);
+    yds = BDIGITS(y);
     zds = BDIGITS(z);
 
-    for (i = 0, num = 0; i < RBIGNUM(y)->len; i++) { 
-	num += (long)BDIGITS(x)[i] - BDIGITS(y)[i];
-	zds[i] = BIGLO(num);
-	num = BIGDN(num);
-    } 
-    while (num && i < RBIGNUM(x)->len) {
-	num += BDIGITS(x)[i];
-	zds[i++] = BIGLO(num);
-	num = BIGDN(num);
-    }
-    while (i < RBIGNUM(x)->len) {
-	zds[i] = BDIGITS(x)[i];
-	i++;
-    }
-    
+    if (bary_sub(zds, zn, xds, xn, yds, yn)) {
+        bary_2comp(zds, zn);
+        BIGNUM_SET_NEGATIVE_SIGN(z);
+    }
+
     return z;
 }
 
+static VALUE bigadd_int(VALUE x, long y);
+
 static VALUE
-bigadd(x, y, sign)
-    VALUE x, y;
-    char sign;
+bigsub_int(VALUE x, long y0)
 {
     VALUE z;
-    long num;
-    long i, len;
+    BDIGIT *xds, *zds;
+    long xn, zn;
+    BDIGIT_DBL_SIGNED num;
+    long i, y;
+
+    y = y0;
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+
+    if (xn == 0)
+        return LONG2NUM(-y0);
+
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    z = bignew(zn, BIGNUM_SIGN(x));
+    zds = BDIGITS(z);
 
-    sign = (sign == RBIGNUM(y)->sign);
-    if (RBIGNUM(x)->sign != sign) {
-	if (sign) return bigsub(y, x);
-	return bigsub(x, y);
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    RUBY_ASSERT(xn == zn);
+    num = (BDIGIT_DBL_SIGNED)xds[0] - y;
+    if (xn == 1 && num < 0) {
+        BIGNUM_NEGATE(z);
+        zds[0] = (BDIGIT)-num;
+        RB_GC_GUARD(x);
+        return bignorm(z);
     }
+    zds[0] = BIGLO(num);
+    num = BIGDN(num);
+    i = 1;
+    if (i < xn)
+        goto y_is_zero_x;
+    goto finish;
+#else
+    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);
+    }
+    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);
+    }
+    goto finish;
+#endif
 
-    if (RBIGNUM(x)->len > RBIGNUM(y)->len) {
-	len = RBIGNUM(x)->len + 1;
-        z = x; x = y; y = z;
+    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);
     }
-    else {
-	len = RBIGNUM(y)->len + 1;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    for (; i < zn; i++) {
+      y_is_zero_z:
+        if (num == 0) goto num_is_zero_z;
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
     }
-    z = bignew(len, sign);
+#endif
+    goto finish;
 
-    len = RBIGNUM(x)->len;
-    for (i = 0, num = 0; i < len; i++) {
-	num += BDIGITS(x)[i] + BDIGITS(y)[i];
-	BDIGITS(z)[i] = BIGLO(num);
-	num = BIGDN(num);
+    for (; i < xn; i++) {
+      num_is_zero_x:
+        zds[i] = xds[i];
     }
-    len = RBIGNUM(y)->len;
-    while (num && i < len) {
-	num += BDIGITS(y)[i];
-	BDIGITS(z)[i++] = BIGLO(num);
-	num = BIGDN(num);
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    for (; i < zn; i++) {
+      num_is_zero_z:
+        zds[i] = 0;
     }
-    while (i < len) {
-	BDIGITS(z)[i] = BDIGITS(y)[i];
-	i++;
+#endif
+    goto finish;
+
+  finish:
+    RUBY_ASSERT(num == 0 || num == -1);
+    if (num < 0) {
+        get2comp(z);
+        BIGNUM_NEGATE(z);
     }
-    BDIGITS(z)[i] = (USHORT)num;
+    RB_GC_GUARD(x);
+    return bignorm(z);
+}
 
-    return z;
+static VALUE
+bigadd_int(VALUE x, long y)
+{
+    VALUE z;
+    BDIGIT *xds, *zds;
+    long xn, zn;
+    BDIGIT_DBL num;
+    long i;
+
+    xds = BDIGITS(x);
+    xn = BIGNUM_LEN(x);
+
+    if (xn == 0)
+        return LONG2NUM(y);
+
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+    zn++;
+
+    z = bignew(zn, BIGNUM_SIGN(x));
+    zds = BDIGITS(z);
+
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    num = (BDIGIT_DBL)xds[0] + y;
+    zds[0] = BIGLO(num);
+    num = BIGDN(num);
+    i = 1;
+    if (i < xn)
+        goto y_is_zero_x;
+    goto y_is_zero_z;
+#else
+    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);
+    }
+    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);
+    }
+    goto finish;
+
+#endif
+
+    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);
+    }
+    for (; i < zn; i++) {
+      y_is_zero_z:
+        if (num == 0) goto num_is_zero_z;
+        zds[i] = BIGLO(num);
+        num = BIGDN(num);
+    }
+    goto finish;
+
+    for (;i < xn; i++) {
+      num_is_zero_x:
+        zds[i] = xds[i];
+    }
+    for (; i < zn; i++) {
+      num_is_zero_z:
+        zds[i] = 0;
+    }
+    goto finish;
+
+  finish:
+    RB_GC_GUARD(x);
+    return bignorm(z);
 }
 
-VALUE
-rb_big_plus(x, y)
-    VALUE x, y;
+static VALUE
+bigadd(VALUE x, VALUE y, int sign)
 {
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	/* fall through */
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 1));
+    VALUE z;
+    size_t len;
 
-      case T_FLOAT:
-	return rb_float_new(rb_big2dbl(x) + RFLOAT(y)->value);
+    sign = (sign == BIGNUM_SIGN(y));
+    if (BIGNUM_SIGN(x) != sign) {
+        if (sign) return bigsub(y, x);
+        return bigsub(x, y);
+    }
 
-      default:
-	return rb_num_coerce_bin(x, y);
+    if (BIGNUM_LEN(x) > BIGNUM_LEN(y)) {
+        len = BIGNUM_LEN(x) + 1;
+    }
+    else {
+        len = BIGNUM_LEN(y) + 1;
     }
+    z = bignew(len, sign);
+
+    bary_add(BDIGITS(z), BIGNUM_LEN(z),
+             BDIGITS(x), BIGNUM_LEN(x),
+             BDIGITS(y), BIGNUM_LEN(y));
+
+    return z;
 }
 
 VALUE
-rb_big_minus(x, y)
-    VALUE x, y;
+rb_big_plus(VALUE x, VALUE y)
 {
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	/* fall through */
-      case T_BIGNUM:
-	return bignorm(bigadd(x, y, 0));
-
-      case T_FLOAT:
-	return rb_float_new(rb_big2dbl(x) - RFLOAT(y)->value);
+    long n;
 
-      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, '+');
     }
 }
 
 VALUE
-rb_big_mul(x, y)
-    VALUE x, y;
+rb_big_minus(VALUE x, VALUE y)
 {
-    long i, j;
-    unsigned long n = 0;
+    long n;
+
+    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
+bigsq(VALUE x)
+{
+    long xn, zn;
     VALUE z;
-    USHORT *zds;
+    BDIGIT *xds, *zds;
+
+    xn = BIGNUM_LEN(x);
+    if (MUL_OVERFLOW_LONG_P(2, xn))
+        rb_raise(rb_eArgError, "square overflow");
+    zn = 2 * xn;
 
-    if (FIXNUM_P(x)) x = rb_int2big(FIX2LONG(x));
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
+    z = bignew(zn, 1);
 
-      case T_BIGNUM:
-	break;
+    xds = BDIGITS(x);
+    zds = BDIGITS(z);
 
-      case T_FLOAT:
-	return rb_float_new(rb_big2dbl(x) * RFLOAT(y)->value);
+    if (xn < NAIVE_MUL_DIGITS)
+        bary_sq_fast(zds, zn, xds, xn);
+    else
+        bary_mul(zds, zn, xds, xn, xds, xn);
 
-      default:
-	return rb_num_coerce_bin(x, y);
-    }
+    RB_GC_GUARD(x);
+    return z;
+}
+
+static VALUE
+bigmul0(VALUE x, VALUE y)
+{
+    long xn, yn, zn;
+    VALUE z;
+    BDIGIT *xds, *yds, *zds;
+
+    if (x == y)
+        return bigsq(x);
 
-    j = RBIGNUM(x)->len + RBIGNUM(y)->len + 1;
-    z = bignew(j, RBIGNUM(x)->sign==RBIGNUM(y)->sign);
+    xn = BIGNUM_LEN(x);
+    yn = BIGNUM_LEN(y);
+    if (ADD_OVERFLOW_LONG_P(xn, yn))
+        rb_raise(rb_eArgError, "multiplication overflow");
+    zn = xn + yn;
+
+    z = bignew(zn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+
+    xds = BDIGITS(x);
+    yds = BDIGITS(y);
     zds = BDIGITS(z);
-    while (j--) zds[j] = 0;
-    for (i = 0; i < RBIGNUM(x)->len; i++) {
-	unsigned long dd = BDIGITS(x)[i]; 
-	if (dd == 0) continue;
-	n = 0;
-	for (j = 0; j < RBIGNUM(y)->len; j++) {
-	    int ee = n + dd * BDIGITS(y)[j];
-	    n = zds[i + j] + ee;
-	    if (ee) zds[i + j] = BIGLO(n);
-	    n = BIGDN(n);
-	}
-	if (n) {
-	    zds[i + j] = n;
-	}
+
+    bary_mul(zds, zn, xds, xn, yds, yn);
+
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return z;
+}
+
+VALUE
+rb_big_mul(VALUE x, VALUE 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(z);
+    return bignorm(bigmul0(x, y));
 }
 
-static void
-bigdivrem(x, y, divp, modp)
-    VALUE x, y;
-    VALUE *divp, *modp;
-{
-    long nx = RBIGNUM(x)->len, ny = RBIGNUM(y)->len;
-    long i, j;
-    VALUE yy, z;
-    USHORT *xds, *yds, *zds, *tds;
-    unsigned long t2;
-    long num;
-    USHORT dd, q;
+static VALUE
+bigdivrem(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
+{
+    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);
-    if (ny == 0 && yds[0] == 0) rb_num_zerodiv();
-    if (nx < ny	|| nx == ny && BDIGITS(x)[nx - 1] < BDIGITS(y)[ny - 1]) {
-	if (divp) *divp = rb_int2big(0);
-	if (modp) *modp = x;
-	return;
-    }
+    BARY_TRUNC(yds, yn);
+    if (yn == 0)
+        rb_num_zerodiv();
+
     xds = BDIGITS(x);
-    if (ny == 1) {
-	dd = yds[0];
-	z = rb_big_clone(x);
-	zds = BDIGITS(z);
-	t2 = 0; i = nx;
-	while (i--) {
-	    t2 = BIGUP(t2) + zds[i];
-	    zds[i] = (USHORT)(t2 / dd);
-	    t2 %= dd;
-	}
-	RBIGNUM(z)->sign = RBIGNUM(x)->sign==RBIGNUM(y)->sign;
-	if (!RBIGNUM(x)->sign) t2 = -(long)t2;
-	if (modp) *modp = rb_int2big((long)t2);
-	if (divp) *divp = z;
-	return;
-    }
-    z = bignew(nx==ny?nx+2:nx+1, RBIGNUM(x)->sign==RBIGNUM(y)->sign);
-    zds = BDIGITS(z);
-    if (nx==ny) zds[nx+1] = 0;
-    while (!yds[ny-1]) ny--;
-    if ((dd = BIGRAD/(int)(yds[ny-1]+1)) != 1) {
-	yy = rb_big_clone(y);
-	tds = BDIGITS(yy);
-	j = 0;
-	num = 0;
-	while (j<ny) {
-	    num += (long)yds[j]*dd;
-	    tds[j++] = BIGLO(num);
-	    num = BIGDN(num);
-	}
-	yds = tds;
-	j = 0;
-	num = 0;
-	while (j<nx) {
-	    num += (long)xds[j]*dd;
-	    zds[j++] = BIGLO(num);
-	    num = BIGDN(num);
-	}
-	zds[j] = (USHORT)num;
-    }
-    else {
-	zds[nx] = 0;
-	j = nx;
-	while (j--) zds[j] = xds[j];
-    }
-    j = nx==ny?nx+1:nx;
-    do {
-	if (zds[j] ==  yds[ny-1]) q = BIGRAD-1;
-	else q = (USHORT)((BIGUP(zds[j]) + zds[j-1])/yds[ny-1]);
-	if (q) {
-	    i = 0; num = 0; t2 = 0;
-	    do {			/* multiply and subtract */
-		int ee;
-		t2 += (long)yds[i] * q;
-		ee = num - BIGLO(t2);
-		num = zds[j - ny + i] + ee;
-		if (ee) zds[j - ny + i] = BIGLO(num);
-		num = BIGDN(num);
-		t2 = BIGDN(t2);
-	    } while (++i < ny);
-	    num += zds[j - ny + i] - t2; /* borrow from high digit; don't update */
-	    while (num) {		/* "add back" required */
-		i = 0; num = 0; q--;
-		do {
-		    int ee = num + yds[i];
-		    num = (long) zds[j - ny + i] + ee;
-		    if (ee) zds[j - ny + i] = BIGLO(num);
-		    num = BIGDN(num);
-		} while (++i < ny);
-		num--;
-	    }
-	}
-	zds[j] = q;
-    } while (--j >= ny);
-    if (divp) {			/* move quotient down in z */
-	*divp = rb_big_clone(z);
-	zds = BDIGITS(*divp);
-	j = (nx==ny ? nx+2 : nx+1) - ny;
-	for (i = 0;i < j;i++) zds[i] = zds[i+ny];
-	RBIGNUM(*divp)->len = i;
-    }
-    if (modp) {			/* just normalize remainder */
-	*modp = rb_big_clone(z);
-	if (dd) {
-	    zds = BDIGITS(*modp);
-	    t2 = 0; i = ny;
-	    while(i--) {
-		t2 = BIGUP(t2) + zds[i];
-		zds[i] = (USHORT)(t2 / dd);
-		t2 %= dd;
-	    }
-	}
-	RBIGNUM(*modp)->len = ny;
-	RBIGNUM(*modp)->sign = RBIGNUM(x)->sign;
+    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)), 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)), BIGNUM_SIGN(x));
+            zds = BDIGITS(z);
+            zds[0] = BIGLO(r0);
+            zds[1] = BIGLO(BIGDN(r0));
+            *modp = z;
+        }
+        return Qnil;
+    }
+
+    if (divp) {
+        qn = xn + BIGDIVREM_EXTRA_WORDS;
+        q = bignew(qn, BIGNUM_SIGN(x)==BIGNUM_SIGN(y));
+        qds = BDIGITS(q);
+    }
+    else {
+        qn = 0;
+        qds = NULL;
     }
+
+    if (modp) {
+        rn = yn;
+        r = bignew(rn, BIGNUM_SIGN(x));
+        rds = BDIGITS(r);
+    }
+    else {
+        rn = 0;
+        rds = NULL;
+    }
+
+    bary_divmod_branch(qds, qn, rds, rn, xds, xn, yds, yn);
+
+    if (divp) {
+        bigtrunc(q);
+        *divp = q;
+    }
+    if (modp) {
+        bigtrunc(r);
+        *modp = r;
+    }
+
+    return Qnil;
 }
 
 static void
-bigdivmod(x, y, divp, modp)
-    VALUE x, y;
-    VALUE *divp, *modp;
+bigdivmod(VALUE x, VALUE y, volatile VALUE *divp, volatile VALUE *modp)
 {
     VALUE mod;
 
     bigdivrem(x, y, divp, &mod);
-    if (RBIGNUM(x)->sign != RBIGNUM(y)->sign && RBIGNUM(mod)->len > 0) {
-	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 (divp) *divp = *divp;
-	if (modp) *modp = mod;
+    else if (modp) {
+        *modp = mod;
     }
 }
 
+
 static VALUE
-rb_big_div(x, y)
-    VALUE x, y;
+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:
-	return rb_float_new(rb_big2dbl(x) / RFLOAT(y)->value);
-
-      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)) {
+        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);
 }
 
-
-static VALUE
-rb_big_modulo(x, y)
-    VALUE x, y;
+VALUE
+rb_big_div(VALUE x, VALUE y)
 {
-    VALUE z;
+    return rb_big_divide(x, y, '/');
+}
 
-    switch (TYPE(y)) {
-      case T_FIXNUM:
-	y = rb_int2big(FIX2LONG(y));
-	break;
+VALUE
+rb_big_idiv(VALUE x, VALUE y)
+{
+    return rb_big_divide(x, y, idDiv);
+}
 
-      case T_BIGNUM:
-	break;
+VALUE
+rb_big_modulo(VALUE x, VALUE y)
+{
+    VALUE z;
 
-      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);
 }
 
-static VALUE
-rb_big_remainder(x, y)
-    VALUE x, y;
+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);
+    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);
 
@@ -978,428 +6263,1070 @@ rb_big_remainder(x, y)
 }
 
 VALUE
-rb_big_divmod(x, y)
-    VALUE x, y;
+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);
+    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);
 
     return rb_assoc_new(bignorm(div), bignorm(mod));
 }
 
-VALUE
-rb_big_pow(x, y)
-    VALUE x, y;
+static VALUE
+big_shift(VALUE x, long n)
 {
-    double d;
-    long yy;
-    
-    if (y == INT2FIX(0)) return INT2FIX(1);
-    switch (TYPE(y)) {
-      case T_FLOAT:
-	d = RFLOAT(y)->value;
-	break;
-
-      case T_BIGNUM:
-	rb_warn("in a**b, b may be too big");
-	d = rb_big2dbl(y);
-	break;
-
-      case T_FIXNUM:
-	yy = NUM2LONG(y);
-	if (yy > 0) {
-	    VALUE z;
-
-	    z = x;
-	    for (;;) {
-		yy = yy - 1;
-		if (yy == 0) break;
-		while (yy % 2 == 0) {
-		    yy = yy / 2;
-		    x = rb_big_mul(x, x);
-		}
-		z = rb_big_mul(z, x);
-	    }
-	    if (!FIXNUM_P(z)) z = bignorm(z);
-	    return z;
-	}
-	d = (double)yy;
-	break;
-
-      default:
-	return rb_num_coerce_bin(x, y);
-    }
-    return rb_float_new(pow(rb_big2dbl(x), d));
-}
-
-VALUE
-rb_big_and(x, y)
-    VALUE x, y;
+    if (n < 0)
+        return big_lshift(x, 1+(unsigned long)(-(n+1)));
+    else if (n > 0)
+        return big_rshift(x, (unsigned long)n);
+    return x;
+}
+
+enum {DBL_BIGDIG = ((DBL_MANT_DIG + BITSPERDIG) / BITSPERDIG)};
+
+static double
+big_fdiv(VALUE x, VALUE y, long ey)
 {
     VALUE z;
-    USHORT *ds1, *ds2, *zds;
-    long i, l1, l2;
-    char sign;
+    long l, ex;
+
+    bigtrunc(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);
+
+    bigdivrem(x, y, &z, 0);
+    l = ex - ey;
+#if SIZEOF_LONG > SIZEOF_INT
+    {
+        /* Visual C++ can't be here */
+        if (l > INT_MAX) return HUGE_VAL;
+        if (l < INT_MIN) return 0.0;
+    }
+#endif
+    return ldexp(big2dbl(z), (int)l);
+}
 
+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);
+}
+
+double
+rb_big_fdiv_double(VALUE x, VALUE y)
+{
+    double dx, dy;
+    VALUE v;
+
+    dx = big2dbl(x);
     if (FIXNUM_P(y)) {
-	y = rb_int2big(FIX2LONG(y));
+        dy = (double)FIX2LONG(y);
+        if (isinf(dx))
+            return big_fdiv_int(x, rb_int2big(FIX2LONG(y)));
+    }
+    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 {
-	Check_Type(y, T_BIGNUM);
+        return NUM2DBL(rb_num_coerce_bin(x, y, idFdiv));
     }
+    v = rb_flo_div_flo(DBL2NUM(dx), DBL2NUM(dy));
+    return NUM2DBL(v);
+}
+
+VALUE
+rb_big_fdiv(VALUE x, VALUE y)
+{
+    return DBL2NUM(rb_big_fdiv_double(x, y));
+}
+
+VALUE
+rb_big_pow(VALUE x, VALUE y)
+{
+    double d;
+    SIGNED_VALUE yy;
 
-    if (!RBIGNUM(y)->sign) {
-	y = rb_big_clone(y);
-	rb_big_2comp(y);
+  again:
+    if (y == INT2FIX(0)) return INT2FIX(1);
+    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);
+        }
     }
-    if (!RBIGNUM(x)->sign) {
-	x = rb_big_clone(x);
-	rb_big_2comp(x);
+    else if (RB_BIGNUM_TYPE_P(y)) {
+        y = bignorm(y);
+        if (FIXNUM_P(y))
+            goto again;
+        rb_raise(rb_eArgError, "exponent is too large");
     }
-    if (RBIGNUM(x)->len > RBIGNUM(y)->len) {
-	l1 = RBIGNUM(y)->len;
-	l2 = RBIGNUM(x)->len;
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM(y)->sign;
+    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);
+#if SIZEOF_SIZE_T == 4
+            const size_t BIGLEN_LIMIT = 1ULL << 31; // 2 GB
+#else // SIZEOF_SIZE_T == 8
+            const size_t BIGLEN_LIMIT = 1ULL << 34; // 16 GB
+#endif
+
+            if (xbits == (size_t)-1 ||
+                (xbits > BIGLEN_LIMIT) ||
+                MUL_OVERFLOW_LONG_P(yy, xbits) ||
+                (xbits * yy > BIGLEN_LIMIT)) {
+                rb_raise(rb_eArgError, "exponent is too large");
+            }
+            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 {
-	l1 = RBIGNUM(x)->len;
-	l2 = RBIGNUM(y)->len;
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM(x)->sign;
+        return rb_num_coerce_bin(x, y, idPow);
+    }
+    return DBL2NUM(pow(rb_big2dbl(x), d));
+}
+
+static VALUE
+bigand_int(VALUE x, long xn, BDIGIT hibitsx, long y)
+{
+    VALUE z;
+    BDIGIT *xds, *zds;
+    long zn;
+    long i;
+    BDIGIT hibitsy;
+
+    if (y == 0) return INT2FIX(0);
+    if (xn == 0) return hibitsx ? LONG2NUM(y) : INT2FIX(0);
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
+    xds = BDIGITS(x);
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    if (!hibitsy) {
+        y &= xds[0];
+        return LONG2NUM(y);
     }
-    z = bignew(l2, RBIGNUM(x)->sign || RBIGNUM(y)->sign);
+#endif
+
+    zn = xn;
+#if SIZEOF_BDIGIT < SIZEOF_LONG
+    if (hibitsx && zn < bdigit_roomof(SIZEOF_LONG))
+        zn = bdigit_roomof(SIZEOF_LONG);
+#endif
+
+    z = bignew(zn, 0);
     zds = BDIGITS(z);
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] & ds2[i];
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    i = 1;
+    zds[0] = xds[0] & BIGLO(y);
+#else
+    for (i=0; i < xn; i++) {
+        if (y == 0 || y == -1) break;
+        zds[i] = xds[i] & BIGLO(y);
+        y = BIGDN(y);
+    }
+    for (; i < zn; i++) {
+        if (y == 0 || y == -1) break;
+        zds[i] = hibitsx & BIGLO(y);
+        y = BIGDN(y);
+    }
+#endif
+    for (;i < xn; i++) {
+        zds[i] = xds[i] & hibitsy;
     }
-    for (; i<l2; i++) {
-	zds[i] = sign?0:ds2[i];
+    for (;i < zn; i++) {
+        zds[i] = hibitsx & hibitsy;
     }
-    if (!RBIGNUM(z)->sign) rb_big_2comp(z);
+    twocomp2abs_bang(z, hibitsx && hibitsy);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
 
 VALUE
-rb_big_or(x, y)
-    VALUE x, y;
+rb_big_and(VALUE x, VALUE y)
 {
     VALUE z;
-    USHORT *ds1, *ds2, *zds;
-    unsigned long i, l1, l2;
-    char sign;
+    BDIGIT *ds1, *ds2, *zds;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
+
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '&');
+    }
 
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	y = rb_int2big(FIX2LONG(y));
+        return bigand_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    else {
-	Check_Type(y, T_BIGNUM);
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
 
-    if (!RBIGNUM(y)->sign) {
-	y = rb_big_clone(y);
-	rb_big_2comp(y);
+    if (!hibits1)
+        n2 = n1;
+
+    z = bignew(n2, 0);
+    zds = BDIGITS(z);
+
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] & ds2[i];
     }
-    if (!RBIGNUM(x)->sign) {
-	x = rb_big_clone(x);
-	rb_big_2comp(x);
+    for (; i<n2; i++) {
+        zds[i] = hibits1 & ds2[i];
     }
-    if (RBIGNUM(x)->len > RBIGNUM(y)->len) {
-	l1 = RBIGNUM(y)->len;
-	l2 = RBIGNUM(x)->len;
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM(y)->sign;
+    twocomp2abs_bang(z, hibits1 && hibits2);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
+    return bignorm(z);
+}
+
+static VALUE
+bigor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
+{
+    VALUE z;
+    BDIGIT *xds, *zds;
+    long zn;
+    long i;
+    BDIGIT hibitsy;
+
+    if (y == -1) return INT2FIX(-1);
+    if (xn == 0) return hibitsx ? INT2FIX(-1) : LONG2FIX(y);
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
+    xds = BDIGITS(x);
+
+    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_BDIGIT >= SIZEOF_LONG
+    i = 1;
+    zds[0] = xds[0] | BIGLO(y);
+    if (i < zn)
+        goto y_is_fixed_point;
+    goto finish;
+#else
+    for (i=0; i < xn; i++) {
+        if (y == 0 || y == -1) goto y_is_fixed_point;
+        zds[i] = xds[i] | BIGLO(y);
+        y = BIGDN(y);
     }
-    else {
-	l1 = RBIGNUM(x)->len;
-	l2 = RBIGNUM(y)->len;
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM(x)->sign;
+    if (hibitsx)
+        goto fill_hibits;
+    for (; i < zn; i++) {
+        if (y == 0 || y == -1) goto y_is_fixed_point;
+        zds[i] = BIGLO(y);
+        y = BIGDN(y);
     }
-    z = bignew(l2, RBIGNUM(x)->sign && RBIGNUM(y)->sign);
-    zds = BDIGITS(z);
+  goto finish;
+#endif
 
-    for (i=0; i<l1; i++) {
-	zds[i] = ds1[i] | ds2[i];
+  y_is_fixed_point:
+    if (hibitsy)
+        goto fill_hibits;
+    for (; i < xn; i++) {
+        zds[i] = xds[i];
+    }
+    if (hibitsx)
+        goto fill_hibits;
+    for (; i < zn; i++) {
+        zds[i] = 0;
     }
-    for (; i<l2; i++) {
-	zds[i] = sign?ds2[i]:(BIGRAD-1);
+  goto finish;
+
+  fill_hibits:
+    for (; i < zn; i++) {
+        zds[i] = BDIGMAX;
     }
-    if (!RBIGNUM(z)->sign) rb_big_2comp(z);
 
+  finish:
+    twocomp2abs_bang(z, hibitsx || hibitsy);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
 
 VALUE
-rb_big_xor(x, y)
-    VALUE x, y;
+rb_big_or(VALUE x, VALUE y)
 {
     VALUE z;
-    USHORT *ds1, *ds2, *zds;
-    unsigned int i, l1, l2;
-    char sign;
+    BDIGIT *ds1, *ds2, *zds;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
+
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '|');
+    }
 
+    hibitsx = abs2twocomp(&x, &xn);
     if (FIXNUM_P(y)) {
-	y = rb_int2big(FIX2LONG(y));
+        return bigor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    else {
-	Check_Type(y, T_BIGNUM);
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
     }
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
 
-    if (!RBIGNUM(y)->sign) {
-	y = rb_big_clone(y);
-	rb_big_2comp(y);
-    }
-    if (!RBIGNUM(x)->sign) {
-	x = rb_big_clone(x);
-	rb_big_2comp(x);
-    }
-    if (RBIGNUM(x)->len > RBIGNUM(y)->len) {
-	l1 = RBIGNUM(y)->len;
-	l2 = RBIGNUM(x)->len;
-	ds1 = BDIGITS(y);
-	ds2 = BDIGITS(x);
-	sign = RBIGNUM(y)->sign;
-    }
-    else {
-	l1 = RBIGNUM(x)->len;
-	l2 = RBIGNUM(y)->len;
-	ds1 = BDIGITS(x);
-	ds2 = BDIGITS(y);
-	sign = RBIGNUM(x)->sign;
-    }
-    RBIGNUM(x)->sign = RBIGNUM(x)->sign?1:0;
-    RBIGNUM(y)->sign = RBIGNUM(y)->sign?1:0;
-    z = bignew(l2, !(RBIGNUM(x)->sign ^ RBIGNUM(y)->sign));
+    if (hibits1)
+        n2 = n1;
+
+    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] = sign?ds2[i]:~ds2[i];
+    for (; i<n2; i++) {
+        zds[i] = hibits1 | ds2[i];
     }
-    if (!RBIGNUM(z)->sign) rb_big_2comp(z);
-
+    twocomp2abs_bang(z, hibits1 || hibits2);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return bignorm(z);
 }
 
-static VALUE rb_big_rshift _((VALUE,VALUE));
-
-VALUE
-rb_big_lshift(x, y)
-    VALUE x, y;
+static VALUE
+bigxor_int(VALUE x, long xn, BDIGIT hibitsx, long y)
 {
-    USHORT *xds, *zds;
-    int shift = NUM2INT(y);
-    int s1 = shift/BITSPERDIG;
-    int s2 = shift%BITSPERDIG;
     VALUE z;
-    unsigned long num = 0;
-    long len, i;
+    BDIGIT *xds, *zds;
+    long zn;
+    long i;
+    BDIGIT hibitsy;
 
-    if (shift < 0) return rb_big_rshift(x, INT2FIX(-shift));
-    len = RBIGNUM(x)->len;
-    z = bignew(len+s1+1, RBIGNUM(x)->sign);
+    hibitsy = 0 <= y ? 0 : BDIGMAX;
+    xds = BDIGITS(x);
+    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);
-    for (i=0; i<s1; i++) {
-	*zds++ = 0;
+
+#if SIZEOF_BDIGIT >= SIZEOF_LONG
+    i = 1;
+    zds[0] = xds[0] ^ BIGLO(y);
+#else
+    for (i = 0; i < xn; i++) {
+        zds[i] = xds[i] ^ BIGLO(y);
+        y = BIGDN(y);
     }
-    xds = BDIGITS(x);
-    for (i=0; i<len; i++) {
-	num = num | *xds++<<s2;
-	*zds++ = BIGLO(num);
-	num = BIGDN(num);
+    for (; i < zn; i++) {
+        zds[i] = hibitsx ^ BIGLO(y);
+        y = BIGDN(y);
+    }
+#endif
+    for (; i < xn; i++) {
+        zds[i] = xds[i] ^ hibitsy;
+    }
+    for (; i < zn; i++) {
+        zds[i] = hibitsx ^ hibitsy;
     }
-    *zds = BIGLO(num);
+    twocomp2abs_bang(z, (hibitsx ^ hibitsy) != 0);
+    RB_GC_GUARD(x);
     return bignorm(z);
 }
 
-static VALUE
-rb_big_rshift(x, y)
-    VALUE x, y;
+VALUE
+rb_big_xor(VALUE x, VALUE y)
 {
-    USHORT *xds, *zds;
-    int shift = NUM2INT(y);
-    int s1 = shift/BITSPERDIG;
-    int s2 = shift%BITSPERDIG;
     VALUE z;
-    unsigned long num = 0;
-    long i = RBIGNUM(x)->len;
-    long j;
+    BDIGIT *ds1, *ds2, *zds;
+    long i, xn, yn, n1, n2;
+    BDIGIT hibitsx, hibitsy;
+    BDIGIT hibits1, hibits2;
+    VALUE tmpv;
+    BDIGIT tmph;
+    long tmpn;
+
+    if (!RB_INTEGER_TYPE_P(y)) {
+        return rb_num_coerce_bit(x, y, '^');
+    }
 
-    if (shift < 0) return rb_big_lshift(x, INT2FIX(-shift));
-    if (s1 > RBIGNUM(x)->len) {
-	if (RBIGNUM(x)->sign)
-	    return INT2FIX(0);
-	else
-	    return INT2FIX(-1);
+    hibitsx = abs2twocomp(&x, &xn);
+    if (FIXNUM_P(y)) {
+        return bigxor_int(x, xn, hibitsx, FIX2LONG(y));
     }
-    xds = BDIGITS(x);
-    i = RBIGNUM(x)->len; j = i - s1;
-    z = bignew(j, RBIGNUM(x)->sign);
+    hibitsy = abs2twocomp(&y, &yn);
+    if (xn > yn) {
+        tmpv = x; x = y; y = tmpv;
+        tmpn = xn; xn = yn; yn = tmpn;
+        tmph = hibitsx; hibitsx = hibitsy; hibitsy = tmph;
+    }
+    n1 = xn;
+    n2 = yn;
+    ds1 = BDIGITS(x);
+    ds2 = BDIGITS(y);
+    hibits1 = hibitsx;
+    hibits2 = hibitsy;
+
+    z = bignew(n2, 0);
     zds = BDIGITS(z);
-    while (i--, j--) {
-	num = (num | xds[i]) >> s2;
-	zds[j] = BIGLO(num);
-	num = BIGUP(xds[i]);
+
+    for (i=0; i<n1; i++) {
+        zds[i] = ds1[i] ^ ds2[i];
+    }
+    for (; i<n2; i++) {
+        zds[i] = hibitsx ^ ds2[i];
     }
+    twocomp2abs_bang(z, (hibits1 ^ hibits2) != 0);
+    RB_GC_GUARD(x);
+    RB_GC_GUARD(y);
     return bignorm(z);
 }
 
-static VALUE
-rb_big_aref(x, y)
-    VALUE x, y;
+VALUE
+rb_big_lshift(VALUE x, VALUE y)
 {
-    USHORT *xds;
-    int shift = NUM2INT(y);
-    int s1, s2;
+    int lshift_p;
+    size_t shift_numdigits;
+    int shift_numbits;
+
+    for (;;) {
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
+            unsigned long shift;
+            if (0 <= l) {
+                lshift_p = 1;
+                shift = l;
+            }
+            else {
+                lshift_p = 0;
+                shift = 1+(unsigned long)(-(l+1));
+            }
+            shift_numbits = (int)(shift & (BITSPERDIG-1));
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
+            return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
+            return bignorm(big_shift2(x, 1, y));
+        }
+        y = rb_to_int(y);
+    }
+}
 
-    if (shift < 0) return INT2FIX(0);
-    s1 = shift/BITSPERDIG;
-    s2 = shift%BITSPERDIG;
+VALUE
+rb_big_rshift(VALUE x, VALUE y)
+{
+    int lshift_p;
+    size_t shift_numdigits;
+    int shift_numbits;
+
+    for (;;) {
+        if (FIXNUM_P(y)) {
+            long l = FIX2LONG(y);
+            unsigned long shift;
+            if (0 <= l) {
+                lshift_p = 0;
+                shift = l;
+            }
+            else {
+                lshift_p = 1;
+                shift = 1+(unsigned long)(-(l+1));
+            }
+            shift_numbits = (int)(shift & (BITSPERDIG-1));
+            shift_numdigits = shift >> bit_length(BITSPERDIG-1);
+            return bignorm(big_shift3(x, lshift_p, shift_numdigits, shift_numbits));
+        }
+        else if (RB_BIGNUM_TYPE_P(y)) {
+            return bignorm(big_shift2(x, 0, y));
+        }
+        y = rb_to_int(y);
+    }
+}
 
-    if (!RBIGNUM(x)->sign) {
-	if (s1 >= RBIGNUM(x)->len) return INT2FIX(1);
-	x = rb_big_clone(x);
-	rb_big_2comp(x);
+VALUE
+rb_big_aref(VALUE x, VALUE y)
+{
+    BDIGIT *xds;
+    size_t shift;
+    size_t i, s1, s2;
+    long l;
+    BDIGIT bit;
+
+    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 {
-	if (s1 >= RBIGNUM(x)->len) return INT2FIX(0);
+        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 >= BIGNUM_LEN(x))
+        return BIGNUM_SIGN(x) ? INT2FIX(0) : INT2FIX(1);
+
     xds = BDIGITS(x);
-    if (xds[s1] & (1<<s2))
-	return INT2FIX(1);
-    return INT2FIX(0);
+    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);
+    for (i = 0; i < s1; i++)
+        if (xds[i])
+            return (xds[s1] & bit) ? INT2FIX(0) : INT2FIX(1);
+    return (xds[s1] & bit) ? INT2FIX(1) : INT2FIX(0);
 }
 
-static VALUE
-rb_big_hash(x)
-    VALUE x;
+VALUE
+rb_big_aref2(VALUE x, VALUE beg, VALUE len)
 {
-    long i, len;
-    int key;
-    USHORT *digits;
+    BDIGIT *xds, *vds;
+    VALUE v;
+    size_t copy_begin, xn, shift;
+    ssize_t begin, length, end;
+    bool negative_add_one;
+
+    beg = rb_to_int(beg);
+    len = rb_to_int(len);
+    length = NUM2SSIZET(len);
+    begin = NUM2SSIZET(beg);
+    end = NUM2SSIZET(rb_int_plus(beg, len));
+    shift = begin < 0 ? -begin : 0;
+    xn = BIGNUM_LEN(x);
+    xds = BDIGITS(x);
+
+    if (length < 0) return rb_big_rshift(x, beg);
+    if (length == 0 || end <= 0) return INT2FIX(0);
+    if (begin < 0) begin = 0;
+
+    if ((size_t)(end - 1) / BITSPERDIG >= xn) {
+        /* end > xn * BITSPERDIG */
+        end = xn * BITSPERDIG;
+    }
 
-    key = 0; digits = BDIGITS(x);
-    for (i=0,len=RBIGNUM(x)->len; i<RBIGNUM(x)->len; i++) {
-	key ^= *digits++;
+    if ((size_t)begin / BITSPERDIG < xn) {
+        /* begin < xn * BITSPERDIG */
+        size_t shift_bits, copy_end;
+        copy_begin = begin / BITSPERDIG;
+        shift_bits = begin % BITSPERDIG;
+        copy_end = (end - 1) / BITSPERDIG + 1;
+        v = bignew(copy_end - copy_begin, 1);
+        vds = BDIGITS(v);
+        MEMCPY(vds, xds + copy_begin, BDIGIT, copy_end - copy_begin);
+        negative_add_one = (vds[0] & ((1 << shift_bits) - 1)) == 0;
+        v = bignorm(v);
+        if (shift_bits) v = rb_int_rshift(v, SIZET2NUM(shift_bits));
+    }
+    else {
+        /* Out of range */
+        v = INT2FIX(0);
+        negative_add_one = false;
+        copy_begin = begin = end = 0;
     }
-    return INT2FIX(key);
+
+    if (BIGNUM_NEGATIVE_P(x)) {
+        size_t mask_size = length - shift;
+        VALUE mask = rb_int_minus(rb_int_lshift(INT2FIX(1), SIZET2NUM(mask_size)), INT2FIX(1));
+        v = rb_int_xor(v, mask);
+        for (size_t i = 0; negative_add_one && i < copy_begin; i++) {
+            if (xds[i]) negative_add_one = false;
+        }
+        if (negative_add_one) v = rb_int_plus(v, INT2FIX(1));
+        v = rb_int_and(v, mask);
+    }
+    else {
+        size_t mask_size = (size_t)end - begin;
+        VALUE mask = rb_int_minus(rb_int_lshift(INT2FIX(1), SIZET2NUM(mask_size)), INT2FIX(1));
+        v = rb_int_and(v, mask);
+    }
+    RB_GC_GUARD(x);
+    if (shift) v = rb_int_lshift(v, SSIZET2NUM(shift));
+    return v;
 }
 
+VALUE
+rb_big_hash(VALUE x)
+{
+    st_index_t hash;
+
+    hash = rb_memhash(BDIGITS(x), sizeof(BDIGIT)*BIGNUM_LEN(x)) ^ BIGNUM_SIGN(x);
+    return ST2FIX(hash);
+}
+
+/*
+ * call-seq:
+ *   int.coerce(numeric)  ->  array
+ *
+ * Returns an array with both a +numeric+ and a +int+ represented as
+ * Integer objects or Float objects.
+ *
+ * This is achieved by converting +numeric+ to an Integer or a Float.
+ *
+ * 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(x, y)
-    VALUE x, y;
+rb_int_coerce(VALUE x, VALUE y)
 {
-    if (FIXNUM_P(y)) {
-	return rb_assoc_new(rb_int2big(FIX2LONG(y)), x);
+    if (RB_INTEGER_TYPE_P(y)) {
+        return rb_assoc_new(y, x);
     }
     else {
-	rb_raise(rb_eTypeError, "Can't coerce %s to Bignum",
-		 rb_class2name(CLASS_OF(y)));
+        x = rb_Float(x);
+        y = rb_Float(y);
+        return rb_assoc_new(y, x);
     }
-    /* not reached */
-    return Qnil;
 }
 
-static VALUE
-rb_big_abs(x)
-    VALUE x;
+VALUE
+rb_big_abs(VALUE x)
 {
-    if (!RBIGNUM(x)->sign) {
-	x = rb_big_clone(x);
-	RBIGNUM(x)->sign = 1;
+    if (BIGNUM_NEGATIVE_P(x)) {
+        x = rb_big_clone(x);
+        BIGNUM_SET_POSITIVE_SIGN(x);
     }
     return x;
 }
 
-/* !!!warnig!!!!
-   this is not really a random number!!
-*/
+int
+rb_big_sign(VALUE x)
+{
+    return BIGNUM_SIGN(x);
+}
+
+size_t
+rb_big_size(VALUE big)
+{
+    return BIGSIZE(big);
+}
 
 VALUE
-rb_big_rand(max, rand)
-    VALUE max;
-    double rand;
+rb_big_size_m(VALUE big)
 {
-    VALUE v;
-    long len;
+    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
+
+VALUE
+rb_big_isqrt(VALUE n)
+{
+    BDIGIT *nds = BDIGITS(n);
+    size_t len = BIGNUM_LEN(n);
+
+    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 {
+        size_t shift = FIX2LONG(rb_big_bit_length(n)) / 4;
+        VALUE n2 = rb_int_rshift(n, SIZET2NUM(2 * shift));
+        VALUE x = FIXNUM_P(n2) ? LONG2FIX(rb_ulong_isqrt(FIX2ULONG(n2))) : rb_big_isqrt(n2);
+        /* x = (x+n/x)/2 */
+        x = rb_int_plus(rb_int_lshift(x, SIZET2NUM(shift - 1)), rb_int_idiv(rb_int_rshift(n, SIZET2NUM(shift + 1)), x));
+        VALUE xx = rb_int_mul(x, x);
+        while (rb_int_gt(xx, n)) {
+            xx = rb_int_minus(xx, rb_int_minus(rb_int_plus(x, x), INT2FIX(1)));
+            x = rb_int_minus(x, INT2FIX(1));
+        }
+        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));
+    }
+    RUBY_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) && !BIGZEROP(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;
 
-    len = RBIGNUM(max)->len;
-    v = bignew(len,1);
-    while (len--) {
-	BDIGITS(v)[len] = ((USHORT)~0) * rand;
+    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);
     }
 
-    return rb_big_modulo((VALUE)v, max);
+    if (nega_flg && rb_int_positive_p(tmp) && !rb_int_zero_p(tmp)) {
+        tmp = rb_int_minus(tmp, m);
+    }
+    return tmp;
+#endif
 }
 
+/*
+ * Integer#pow
+ */
+
 static VALUE
-rb_big_size(big)
-    VALUE big;
+int_pow_tmp1(VALUE x, VALUE y, long mm, int nega_flg)
 {
-    return INT2FIX(RBIGNUM(big)->len*sizeof(USHORT));
+    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 LONG2FIX(tmp);
 }
 
 static VALUE
-rb_big_zero_p(big)
-    VALUE big;
+int_pow_tmp2(VALUE x, VALUE y, long mm, int nega_flg)
 {
-    return Qfalse;
+    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);
 }
 
+/*
+ * Document-method: Integer#pow
+ * call-seq:
+ *    integer.pow(numeric)           ->  numeric
+ *    integer.pow(integer, integer)  ->  integer
+ *
+ * Returns (modular) exponentiation as:
+ *
+ *   a.pow(b)     #=> same as a**b
+ *   a.pow(b, m)  #=> same as (a**b) % m, but avoids huge temporary values
+ */
+VALUE
+rb_int_powm(int const argc, VALUE * const argv, VALUE const num)
+{
+    rb_check_arity(argc, 1, 2);
+
+    if (argc == 1) {
+        return rb_int_pow(num, argv[0]);
+    }
+    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_zero_p(a) && !rb_int_zero_p(b)) {
+            /* shortcut; 0**x => 0 except for x == 0 */
+            return INT2FIX(0);
+        }
+
+        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);
+}
+
+/*
+ *  Bignum objects hold integers outside the range of
+ *  Fixnum. Bignum objects are created
+ *  automatically when integer calculations would otherwise overflow a
+ *  Fixnum. When a calculation involving
+ *  Bignum objects returns a result that will fit in a
+ *  Fixnum, the result is automatically converted.
+ *
+ *  For the purposes of the bitwise operations and <code>[]</code>, a
+ *  Bignum is treated as if it were an infinite-length
+ *  bitstring with 2's complement representation.
+ *
+ *  While Fixnum values are immediate, Bignum
+ *  objects are not---assignment and parameter passing work with
+ *  references to objects, not the objects themselves.
+ *
+ */
+
 void
-Init_Bignum()
-{
-    rb_cBignum = rb_define_class("Bignum", rb_cInteger);
-
-    rb_undef_method(CLASS_OF(rb_cBignum), "new");
-
-    rb_define_method(rb_cBignum, "to_s", rb_big_to_s, 0);
-    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, "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, "**", 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, "===", rb_big_eq, 1);
-    rb_define_method(rb_cBignum, "eql?", rb_big_eq, 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, "size", rb_big_size, 0);
-    rb_define_method(rb_cBignum, "zero?", rb_big_zero_p, 0);
+Init_Bignum(void)
+{
+    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/gem b/bin/gem
new file mode 100755
index 0000000000..3ac1d9e623
--- /dev/null
+++ b/bin/gem
@@ -0,0 +1,12 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+#--
+# Copyright 2006 by Chad Fowler, Rich Kilmer, Jim Weirich and others.
+# All rights reserved.
+# See LICENSE.txt for permissions.
+#++
+
+require "rubygems/gem_runner"
+
+Gem::GemRunner.new.run ARGV.clone
diff --git a/bootstraptest/pending.rb b/bootstraptest/pending.rb
new file mode 100644
index 0000000000..2c4b85a419
--- /dev/null
+++ b/bootstraptest/pending.rb
@@ -0,0 +1,21 @@
+assert_equal 'ok', %q{
+  def m
+    lambda{
+      proc{
+        return :ng1
+      }
+    }.call.call
+    :ng2
+  end
+
+  begin
+    m()
+  rescue LocalJumpError
+    :ok
+  end
+}
+
+# This randomly fails on mswin.
+assert_equal %q{[]}, %q{
+  Thread.new{sleep}.backtrace
+}
diff --git a/bootstraptest/runner.rb b/bootstraptest/runner.rb
new file mode 100755
index 0000000000..04de0c93b9
--- /dev/null
+++ b/bootstraptest/runner.rb
@@ -0,0 +1,877 @@
+"exec" "${RUBY-ruby}" "-x" "$0" "$@" || true # -*- Ruby -*-
+#!./ruby
+# $Id$
+
+# NOTE:
+# Never use optparse in this file.
+# Never use test/unit in this file.
+# Never use Ruby extensions in this file.
+
+$start_time = Time.now
+
+begin
+  require 'fileutils'
+  require 'tmpdir'
+rescue LoadError
+  $:.unshift File.join(File.dirname(__FILE__), '../lib')
+  retry
+end
+require_relative '../tool/lib/test/jobserver'
+
+if !Dir.respond_to?(:mktmpdir)
+  # copied from lib/tmpdir.rb
+  def Dir.mktmpdir(prefix_suffix=nil, tmpdir=nil)
+    case prefix_suffix
+    when nil
+      prefix = "d"
+      suffix = ""
+    when String
+      prefix = prefix_suffix
+      suffix = ""
+    when Array
+      prefix = prefix_suffix[0]
+      suffix = prefix_suffix[1]
+    else
+      raise ArgumentError, "unexpected prefix_suffix: #{prefix_suffix.inspect}"
+    end
+    tmpdir ||= Dir.tmpdir
+    t = Time.now.strftime("%Y%m%d")
+    n = nil
+    begin
+      path = "#{tmpdir}/#{prefix}#{t}-#{$$}-#{rand(0x100000000).to_s(36)}"
+      path << "-#{n}" if n
+      path << suffix
+      Dir.mkdir(path, 0700)
+    rescue Errno::EEXIST
+      n ||= 0
+      n += 1
+      retry
+    end
+
+    if block_given?
+      begin
+        yield path
+      ensure
+        FileUtils.remove_entry_secure path
+      end
+    else
+      path
+    end
+  end
+end
+
+# Configuration
+bt = Struct.new(:ruby,
+                :verbose,
+                :color,
+                :tty,
+                :quiet,
+                :wn,
+                :progress,
+                :progress_bs,
+                :passed,
+                :failed,
+                :reset,
+                :columns,
+                :window_width,
+                :width,
+                :indent,
+                :platform,
+                :timeout,
+                :timeout_scale,
+                :launchable_test_reports
+                )
+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
+      wn = Test::JobServer.max_jobs(wn > 0 ? wn : 1024, ENV.delete("MAKEFLAGS")) || wn
+      if wn <= 0
+        require 'etc'
+        wn = [Etc.nprocessors / 2, 1].max
+      end
+    end
+    super wn
+  end
+
+  def apply_timeout_scale(timeout)
+    timeout&.*(timeout_scale)
+  end
+end.new
+
+BT_STATE = Struct.new(:count, :error).new
+
+def main
+  BT.ruby = File.expand_path('miniruby')
+  BT.verbose = false
+  $VERBOSE = false
+  $stress = false
+  BT.color = nil
+  BT.tty = nil
+  BT.quiet = false
+  BT.timeout = 180
+  BT.timeout_scale = 1
+  if (ts = (ENV["RUBY_TEST_TIMEOUT_SCALE"] || ENV["RUBY_TEST_SUBPROCESS_TIMEOUT_SCALE"]).to_i) > 1
+    BT.timeout_scale *= ts
+  end
+
+  # 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)}
+      BT.ruby = ruby
+      true
+    when /\A--sets=(.*)/
+      tests = Dir.glob("#{File.dirname($0)}/test_{#{$1}}*.rb").sort
+      puts tests.map {|path| File.basename(path) }.inspect
+      true
+    when /\A--dir=(.*)/
+      dir = $1
+      true
+    when /\A(--stress|-s)/
+      $stress = true
+    when /\A--color(?:=(?:always|(auto)|(never)|(.*)))?\z/
+      warn "unknown --color argument: #$3" if $3
+      BT.color = color = $1 ? nil : !$2
+      true
+    when /\A--tty(=(?:yes|(no)|(.*)))?\z/
+      warn "unknown --tty argument: #$3" if $3
+      BT.tty = !$1 || !$2
+      true
+    when /\A(-q|--q(uiet)?)\z/
+      quiet = true
+      BT.quiet = true
+      true
+    when /\A-j(\d+)?/
+      BT.wn = $1.to_i
+      true
+    when /\A--timeout=(\d+(?:_\d+)*(?:\.\d+(?:_\d+)*)?)(?::(\d+(?:_\d+)*(?:\.\d+(?:_\d+)*)?))?/
+      BT.timeout = $1.to_f
+      BT.timeout_scale = $2.to_f if defined?($2)
+      true
+    when /\A(-v|--v(erbose)?)\z/
+      BT.verbose = true
+      BT.quiet = false
+      true
+    when /\A(-h|--h(elp)?)\z/
+      puts(<<-End)
+Usage: #{File.basename($0, '.*')} --ruby=PATH [--sets=NAME,NAME,...]
+        --sets=NAME,NAME,...        Name of test sets.
+        --dir=DIRECTORY             Working directory.
+                                    default: /tmp/bootstraptestXXXXX.tmpwd
+        --color[=WHEN]              Colorize the output.  WHEN defaults to 'always'
+                                    or can be 'never' or 'auto'.
+        --timeout=TIMEOUT           Default timeout in seconds.
+    -s, --stress                    stress test.
+    -v, --verbose                   Output test name before exec.
+    -q, --quiet                     Don\'t print header message.
+    -h, --help                      Print this message and quit.
+End
+      exit true
+    when /\A-j/
+      true
+    when /--launchable-test-reports=(.*)/
+      if File.exist?($1)
+        # To protect files from overwritten, do nothing when the file exists.
+        return true
+      end
+
+      begin
+        require_relative '../tool/lib/launchable'
+      rescue LoadError
+        # The following error sometimes happens, so we're going to skip writing Launchable report files in this case.
+        #
+        # ```
+        # /tmp/tmp.bISss9CtXZ/.ext/common/json/ext.rb:15:in 'Kernel#require':
+        #   /tmp/tmp.bISss9CtXZ/.ext/x86_64-linux/json/ext/parser.so:
+        #     undefined symbol: ruby_abi_version - ruby_abi_version (LoadError)
+        # ```
+        #
+        return true
+      end
+      BT.launchable_test_reports = writer = Launchable::JsonStreamWriter.new($1)
+      writer.write_array('testCases')
+      at_exit {
+        writer.close
+      }
+      true
+    else
+      false
+    end
+  }
+  if tests and not ARGV.empty?
+    abort "--sets and arguments are exclusive"
+  end
+  tests ||= ARGV
+  tests = Dir.glob("#{File.dirname($0)}/test_*.rb").sort if tests.empty?
+  paths = tests.map {|path| File.expand_path(path) }
+
+  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
+    BT.color = BT.tty && /dumb/ !~ ENV["TERM"]
+  end
+  BT.tty &&= !BT.verbose
+  if BT.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
+    BT.passed = "\e[;#{colors["pass"] || "32"}m"
+    BT.failed = "\e[;#{colors["fail"] || "31"}m"
+    BT.reset = "\e[m"
+  else
+    BT.passed = BT.failed = BT.reset = ""
+  end
+  target_version = `#{BT.ruby} -v`.chomp
+  BT.platform = target_version[/\[(.*)\]\z/, 1]
+  unless quiet
+    puts $start_time
+    if defined?(RUBY_DESCRIPTION)
+      puts "Driver is #{RUBY_DESCRIPTION}"
+    elsif defined?(RUBY_PATCHLEVEL)
+      puts "Driver is ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}#{RUBY_PATCHLEVEL}) [#{RUBY_PLATFORM}]"
+    else
+      puts "Driver is ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}) [#{RUBY_PLATFORM}]"
+    end
+    puts "Target is #{target_version}"
+    puts
+    $stdout.flush
+  end
+
+  in_temporary_working_directory(dir) do
+    exec_test paths
+  end
+end
+
+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 paths
+  paths.each do |path|
+    load File.expand_path(path)
+  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
+        BT_STATE.count += 1
+        case
+        when BT.quiet
+        when BT.tty
+          $stderr.print "#{BT.progress_bs}#{BT.progress[(i+=1) % BT.progress.size]}"
+        else
+          BT.putc '.'
+        end
+      else
+        term_wn += 1
+      end
+    end
+  ensure
+    ts.each(&:kill)
+    ts.each(&:join)
+  end
+end
+
+##
+# Module for writing a test file for uploading test results into Launchable.
+# In bootstraptest, we aggregate the test results based on file level.
+module Launchable
+  @@last_test_name = nil
+  @@failure_log = ''
+  @@duration = 0
+
+  def show_progress(message = '')
+    faildesc, t = super
+
+    if writer = BT.launchable_test_reports
+      if faildesc
+        @@failure_log += faildesc
+      end
+      repo_path = File.expand_path("#{__dir__}/../")
+      relative_path = File.join(__dir__, self.path).delete_prefix("#{repo_path}/")
+      if @@last_test_name != nil && @@last_test_name != relative_path
+        # The test path is a URL-encoded representation.
+        # https://github.com/launchableinc/cli/blob/v1.81.0/launchable/testpath.py#L18
+        test_path = "#{encode_test_path_component("file")}=#{encode_test_path_component(@@last_test_name)}"
+        if @@failure_log.size > 0
+          status = 'TEST_FAILED'
+        else
+          status = 'TEST_PASSED'
+        end
+        writer.write_object(
+          {
+            testPath: test_path,
+            status: status,
+            duration: t,
+            createdAt: Time.now.to_s,
+            stderr: @@failure_log,
+            stdout: nil,
+            data: {
+              lineNumber: self.lineno
+            }
+          }
+        )
+        @@duration = 0
+        @@failure_log = ''
+      end
+      @@last_test_name = relative_path
+      @@duration += t
+    end
+  end
+
+  private
+  def encode_test_path_component component
+    component.to_s.gsub('%', '%25').gsub('=', '%3D').gsub('#', '%23').gsub('&', '%26')
+  end
+end
+
+def exec_test(paths)
+  # setup
+  load_test paths
+  BT_STATE.count = 0
+  BT_STATE.error = 0
+  BT.columns = 0
+  BT.width = paths.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
+      out.puts "#{BT.passed}PASS#{BT.reset} all #{Assertion.count} tests"
+    end
+    true
+  else
+    $stderr.puts "#{BT.failed}FAIL#{BT.reset} #{BT_STATE.error}/#{BT_STATE.count} tests failed"
+    false
+  end
+end
+
+def target_platform
+  BT.platform or RUBY_PLATFORM
+end
+
+class Assertion < Struct.new(:src, :path, :lineno, :proc)
+  prepend Launchable
+  @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[/\Atest_(.+)\.rb\z/, 1]
+  end
+
+  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
+      Assertion.errbuf << msg
+    end
+    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
+
+    t = Time.now if BT.verbose || BT.launchable_test_reports
+    faildesc, errout = with_stderr {yield}
+    t = Time.now - t if BT.verbose || BT.launchable_test_reports
+
+    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
+
+    [faildesc, t]
+  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
+
+  class Timeout < StandardError; end
+
+  def get_result_string(opt = '', timeout: BT.timeout, **argh)
+    if BT.ruby
+      timeout = BT.apply_timeout_scale(timeout)
+      filename = make_srcfile(**argh)
+      begin
+        kw = self.err ? {err: self.err} : {}
+        out = IO.popen("#{BT.ruby} -W0 #{opt} #{filename}", **kw)
+        pid = out.pid
+        th = Thread.new {out.read.tap {Process.waitpid(pid); out.close}}
+        if th.join(timeout)
+          th.value
+        else
+          Timeout.new("timed out after #{timeout} seconds")
+        end
+      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
+
+  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:#{frozen_string_literal}" unless frozen_string_literal.nil?
+      if $stress
+        f.puts "GC.stress = true" if $stress
+      else
+        f.puts ""
+      end
+      f.puts "class BT_Skip < Exception; end; def skip(msg) = raise(BT_Skip, msg.to_s)"
+      f.puts "print(begin; #{self.src}; rescue BT_Skip; $!.message; end)"
+    }
+    filename
+  end
+end
+
+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 = '', opt = '', **kwargs)
+  add_assertion testsrc, -> as do
+    as.assert_check(message, opt, **kwargs) {|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 = '', **argh)
+  add_assertion testsrc, -> as do
+    as.assert_check(message, **argh) {|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 = '')
+  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 = '')
+  add_assertion testsrc, -> as do
+    as.assert_check(message, '-c') {|result|
+      result if /Syntax OK/ !~ result
+    }
+  end
+end
+
+def assert_normal_exit(testsrc, *rest, timeout: BT.timeout, **opt)
+  add_assertion testsrc, -> as do
+    timeout = BT.apply_timeout_scale(timeout)
+    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"
+
+      io = IO.popen("#{BT.ruby} -W0 #{filename}", err: logfile)
+      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
+
+      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
+      faildesc
+    }
+  end
+end
+
+def assert_finish(timeout_seconds, testsrc, message = '')
+  add_assertion testsrc, -> as do
+    timeout_seconds = BT.apply_timeout_scale(timeout_seconds)
+
+    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 = '')
+  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\s*\n/, '')
+  lines = src.lines
+  src = lines[0..20].join + "(...snip)\n" if lines.size > 20
+  (/\n/ =~ src ? "\n#{adjust_indent(src)}" : src) + "  #=> #{desc}"
+end
+
+INDENT = 27
+
+def adjust_indent(src)
+  untabify(src).gsub(/^ {#{INDENT}}/o, '').gsub(/^/, '   ').sub(/\s*\z/, "\n")
+end
+
+def untabify(str)
+  str.gsub(/^\t+/) {' ' * (8 * $&.size) }
+end
+
+def in_temporary_working_directory(dir)
+  if dir
+    Dir.mkdir dir
+    Dir.chdir(dir) {
+      yield
+    }
+  else
+    Dir.mktmpdir(["bootstraptest", ".tmpwd"]) {|d|
+      Dir.chdir(d) {
+        yield
+      }
+    }
+  end
+end
+
+def cleanup_coredump
+  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 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
+      (BT.ruby and File.exist?(BT.ruby+'.stackdump'))
+    raise CoreDumpError, "core dumped"
+  end
+end
+
+def yjit_enabled?
+  ENV.key?('RUBY_YJIT_ENABLE') || ENV.fetch('RUN_OPTS', '').include?('yjit') || BT.ruby.include?('yjit')
+end
+
+def zjit_enabled?
+  ENV.key?('RUBY_ZJIT_ENABLE') || ENV.fetch('RUN_OPTS', '').include?('zjit') || BT.ruby.include?('zjit')
+end
+
+exit main
diff --git a/bootstraptest/test_attr.rb b/bootstraptest/test_attr.rb
new file mode 100644
index 0000000000..3cb9d3eb39
--- /dev/null
+++ b/bootstraptest/test_attr.rb
@@ -0,0 +1,52 @@
+assert_equal 'ok', %q{
+  module M
+    class A
+      class << self
+        attr_accessor :at
+        def workflow_rule
+          yield self
+        end
+
+        def eval_str(str)
+          eval(str)
+        end
+      end
+    end
+  end
+  begin
+    M::A.eval_str(<<-END)
+    workflow_rule do |r|
+      r.at 1
+    end
+    END
+  rescue ArgumentError => e
+    print "ok"
+  end
+}, '[ruby-core:14641]'
+
+assert_equal %{ok}, %{
+  class A
+    attr :m
+  end
+  begin
+    A.new.m(3)
+  rescue ArgumentError => e
+    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
new file mode 100644
index 0000000000..de66f1f3ee
--- /dev/null
+++ b/bootstraptest/test_autoload.rb
@@ -0,0 +1,70 @@
+assert_equal 'ok', %q{
+  File.unlink('zzz1.rb') if File.file?('zzz1.rb')
+  instance_eval do
+    autoload :ZZZ, './zzz1.rb'
+    begin
+      ZZZ
+    rescue LoadError
+      :ok
+    end
+  end
+}, '[ruby-dev:43816]'
+
+assert_equal 'ok', %q{
+  File.write('zzz2.rb', '')
+  instance_eval do
+    autoload :ZZZ, './zzz2.rb'
+    begin
+      ZZZ
+    rescue NameError
+      :ok
+    end
+  end
+}, '[ruby-dev:43816]'
+
+assert_equal 'ok', %q{
+  File.write('zzz3.rb', "class ZZZ; def self.ok;:ok;end;end\n")
+  instance_eval do
+    autoload :ZZZ, './zzz3.rb'
+    ZZZ.ok
+  end
+}, '[ruby-dev:43816]'
+
+assert_equal 'ok', %q{
+  File.write("zzz4.rb", "class ZZZ; def self.ok;:ok;end;end\n")
+  autoload :ZZZ, "./zzz4.rb"
+  ZZZ.ok
+}
+
+assert_equal 'ok', %q{
+  File.write("zzz5.rb", "class ZZZ; def self.ok;:ok;end;end\n")
+  autoload :ZZZ, "./zzz5.rb"
+  require "./zzz5.rb"
+  ZZZ.ok
+}
+
+assert_equal 'okok', %q{
+  File.write("zzz6.rb", "class ZZZ; def self.ok;:ok;end;end\n")
+  autoload :ZZZ, "./zzz6.rb"
+  t1 = Thread.new {ZZZ.ok}
+  t2 = Thread.new {ZZZ.ok}
+  [t1.value, t2.value].join
+}
+
+assert_finish 5, %q{
+  autoload :ZZZ, File.expand_path(__FILE__)
+  begin
+    ZZZ
+  rescue NameError
+  end
+}, '[ruby-core:21696]'
+
+assert_equal 'A::C', %q{
+  File.write("zzz7.rb", "")
+  class A
+    autoload :C, "./zzz7"
+    class C
+    end
+    C
+  end
+}
diff --git a/bootstraptest/test_block.rb b/bootstraptest/test_block.rb
new file mode 100644
index 0000000000..cdc5960a59
--- /dev/null
+++ b/bootstraptest/test_block.rb
@@ -0,0 +1,613 @@
+assert_equal %q{1}, %q{
+  1.times{
+    begin
+      a = 1
+    ensure
+      foo = nil
+    end
+  }
+}
+assert_equal %q{2}, %q{
+  [1,2,3].find{|x| x == 2}
+}
+assert_equal %q{2}, %q{
+  class E
+    include Enumerable
+    def each(&block)
+      [1, 2, 3].each(&block)
+    end
+  end
+  E.new.find {|x| x == 2 }
+}
+assert_equal %q{6}, %q{
+  sum = 0
+  for x in [1, 2, 3]
+    sum += x
+  end
+  sum
+}
+assert_equal %q{15}, %q{
+  sum = 0
+  for x in (1..5)
+    sum += x
+  end
+  sum
+}
+assert_equal %q{0}, %q{
+  sum = 0
+  for x in []
+    sum += x
+  end
+  sum
+}
+assert_equal %q{1}, %q{
+  ans = []
+  1.times{
+    for n in 1..3
+      a = n
+      ans << a
+    end
+  }
+}
+assert_equal %q{1..3}, %q{
+  ans = []
+  for m in 1..3
+    for n in 1..3
+      a = [m, n]
+      ans << a
+    end
+  end
+}
+assert_equal %q{[1, 2, 3]}, %q{
+  (1..3).to_a
+}
+assert_equal %q{[4, 8, 12]}, %q{
+  (1..3).map{|e|
+    e * 4
+  }
+}
+assert_equal %q{[1, 2, 3]}, %q{
+  class C
+    include Enumerable
+    def each
+      [1,2,3].each{|e|
+        yield e
+      }
+    end
+  end
+
+  C.new.to_a
+}
+assert_equal %q{[4, 5, 6]}, %q{
+  class C
+    include Enumerable
+    def each
+      [1,2,3].each{|e|
+        yield e
+      }
+    end
+  end
+
+  C.new.map{|e|
+    e + 3
+  }
+}
+assert_equal %q{100}, %q{
+  def m
+    yield
+  end
+  def n
+    yield
+  end
+
+  m{
+    n{
+      100
+    }
+  }
+}
+assert_equal %q{20}, %q{
+  def m
+    yield 1
+  end
+
+  m{|ib|
+    m{|jb|
+      i = 20
+    }
+  }
+}
+assert_equal %q{2}, %q{
+  def m
+    yield 1
+  end
+
+  m{|ib|
+    m{|jb|
+      ib = 20
+      kb = 2
+    }
+  }
+}
+assert_equal %q{3}, %q{
+  def iter1
+    iter2{
+      yield
+    }
+  end
+
+  def iter2
+    yield
+  end
+
+  iter1{
+    jb = 2
+    iter1{
+      jb = 3
+    }
+    jb
+  }
+}
+assert_equal %q{2}, %q{
+  def iter1
+    iter2{
+      yield
+    }
+  end
+
+  def iter2
+    yield
+  end
+
+  iter1{
+    jb = 2
+    iter1{
+      jb
+    }
+    jb
+  }
+}
+assert_equal %q{2}, %q{
+  def m
+    yield 1
+  end
+  m{|ib|
+    ib*2
+  }
+}
+assert_equal %q{92580}, %q{
+  def m
+    yield 12345, 67890
+  end
+  m{|ib,jb|
+    ib*2+jb
+  }
+}
+assert_equal %q{[10, nil]}, %q{
+  def iter
+    yield 10
+  end
+
+  a = nil
+  [iter{|a|
+    a
+  }, a]
+}
+assert_equal %q{21}, %q{
+  def iter
+    yield 10
+  end
+
+  iter{|a|
+    iter{|a|
+      a + 1
+    } + a
+  }
+}
+assert_equal %q{[10, 20, 30, 40, nil, nil, nil, nil]}, %q{
+  def iter
+    yield 10, 20, 30, 40
+  end
+
+  a = b = c = d = nil
+  iter{|a, b, c, d|
+    [a, b, c, d]
+  } + [a, b, c, d]
+}
+assert_equal %q{[10, 20, 30, 40, nil, nil]}, %q{
+  def iter
+    yield 10, 20, 30, 40
+  end
+
+  a = b = nil
+  iter{|a, b, c, d|
+    [a, b, c, d]
+  } + [a, b]
+}
+assert_equal %q{[1]}, %q{
+  $a = []
+
+  def iter
+    yield 1
+  end
+
+  def m
+    x = iter{|x|
+      $a << x
+      y = 0
+    }
+  end
+  m
+  $a
+}
+assert_equal %q{[1, [2]]}, %q{
+  def iter
+    yield 1, 2
+  end
+
+  iter{|a, *b|
+    [a, b]
+  }
+}
+assert_equal %q{[[1, 2]]}, %q{
+  def iter
+    yield 1, 2
+  end
+
+  iter{|*a|
+    [a]
+  }
+}
+assert_equal %q{[1, 2, []]}, %q{
+  def iter
+    yield 1, 2
+  end
+
+  iter{|a, b, *c|
+    [a, b, c]
+  }
+}
+assert_equal %q{[1, 2, nil, []]}, %q{
+  def iter
+    yield 1, 2
+  end
+
+  iter{|a, b, c, *d|
+    [a, b, c, d]
+  }
+}
+assert_equal %q{1}, %q{
+  def m
+    yield
+  end
+  m{
+    1
+  }
+}
+assert_equal %q{15129}, %q{
+  def m
+    yield 123
+  end
+  m{|ib|
+    m{|jb|
+      ib*jb
+    }
+  }
+}
+assert_equal %q{2}, %q{
+  def m a
+    yield a
+  end
+  m(1){|ib|
+    m(2){|jb|
+      ib*jb
+    }
+  }
+}
+assert_equal %q{9}, %q{
+  sum = 0
+  3.times{|ib|
+    2.times{|jb|
+      sum += ib + jb
+    }}
+  sum
+}
+assert_equal %q{10}, %q{
+  3.times{|bl|
+    break 10
+  }
+}
+assert_equal %q{[1, 2]}, %q{
+  def iter
+    yield 1,2,3
+  end
+
+  iter{|i, j|
+    [i, j]
+  }
+}
+assert_equal %q{[1, nil]}, %q{
+  def iter
+    yield 1
+  end
+
+  iter{|i, j|
+    [i, j]
+  }
+}
+
+assert_equal '0', %q{
+def m()
+end
+m {|(v0,*,(*)),|}
+m {|(*v0,(*)),|}
+m {|(v0,*v1,(*)),|}
+m {|((v0,*v1,v2)),|}
+m {|(v0,*v1,v2),|}
+m {|(v0,*v1,(v2)),|}
+m {|((*),*v0,v1),|}
+m {|((v0),*v1,v2),|}
+m {|(v0,v1,*v2,v3),|}
+m {|v0,(v1,*v2,v3),|}
+m {|(v0,*v1,v2),v3,|}
+m {|(v0,*v1,v2)|}
+m {|(v0,*v1,v2),&v3|}
+m {|(v0,*v1,v2),*|}
+m {|(v0,*v1,v2),*,&v3|}
+m {|*,(v0,*v1,v2)|}
+m {|*,(v0,*v1,v2),&v3|}
+m {|v0,*,(v1,*v2,v3)|}
+m {|v0,*,(v1,*v2,v3),&v4|}
+m {|(v0,*v1,v2),*,v3|}
+m {|(v0,*v1,v2),*,v3,&v4|}
+m {|(v0, *v1, v2)|}
+m {|(*,v)|}
+0
+}, "block parameter (shouldn't SEGV: [ruby-dev:31143])"
+
+assert_equal 'nil', %q{
+  def m
+    yield
+  end
+  m{|&b| b}.inspect
+}, '[ruby-dev:31147]'
+
+assert_equal 'nil', %q{
+  def m()
+    yield
+  end
+  m {|(v,(*))|}.inspect
+}, '[ruby-dev:31160]'
+
+assert_equal 'nil', %q{
+  def m()
+    yield
+  end
+  m {|(*,a,b)|}.inspect
+}, '[ruby-dev:31153]'
+
+assert_equal 'nil', %q{
+  def m()
+    yield
+  end
+  m {|((*))|}.inspect
+}
+
+assert_equal %q{[1, 1, [1, nil], [1, nil], [1, nil], [1, nil], [1, 1], 1, [1, nil], [1, nil], [1, nil], [1, nil], [[1, 1], [1, 1]], [1, 1], [1, 1], [1, 1], [1, nil], [1, nil], [[[1, 1], [1, 1]], [[1, 1], [1, 1]]], [[1, 1], [1, 1]], [[1, 1], [1, 1]], [[1, 1], [1, 1]], [1, 1], [1, 1], [[[[1, 1], [1, 1]], [[1, 1], [1, 1]]], [[[1, 1], [1, 1]], [[1, 1], [1, 1]]]], [[[1, 1], [1, 1]], [[1, 1], [1, 1]]], [[[1, 1], [1, 1]], [[1, 1], [1, 1]]], [[[1, 1], [1, 1]], [[1, 1], [1, 1]]], [[1, 1], [1, 1]], [[1, 1], [1, 1]]]}, %q{
+def m(ary = [])
+  yield(ary)
+end
+
+$ans = []
+o = 1
+5.times{
+  v,(*) = o; $ans << o
+  m(o){|(v,(*))| $ans << v}
+  ((x, y)) = o; $ans << [x, y]
+  m(o){|((x, y))| $ans << [x, y]}
+  (((x, y))) = o; $ans << [x, y]
+  m(o){|(((x, y)))| $ans << [x, y]}
+  o = [o, o]
+}; $ans
+}
+
+assert_equal '0', %q{
+  def m()
+    yield [0]
+  end
+  m {|*,v| v}.inspect
+}, '[ruby-dev:31437]'
+assert_equal '[0]', %q{
+  def m
+    yield [0]
+  end
+  m{|v, &b| v}.inspect
+}, '[ruby-dev:31440]'
+assert_equal 'ok', %q{
+  begin
+    lambda{|a|}.call(1, 2)
+  rescue ArgumentError
+    :ok
+  else
+    :ng
+  end
+}, '[ruby-dev:31464]'
+assert_equal 'ok', %q{
+  begin
+    lambda{|&b|}.call(3)
+  rescue ArgumentError
+    :ok
+  else
+    :ng
+  end
+}, '[ruby-dev:31472]'
+assert_equal 'ok', %q{
+  class C
+    def each
+      yield [1,2]
+      yield 1,2
+    end
+  end
+  vs1 = []
+  C.new.each {|*v| vs1 << v }
+  vs2 = []
+  C.new.to_enum.each {|*v| vs2 << v }
+  vs1 == vs2 ? :ok : :ng
+}, '[ruby-dev:32329]'
+
+assert_normal_exit %q{
+  e = [1,2,3].each
+  10000.times {
+    e = [e].each
+  }
+  Thread.new { GC.start }.join
+}, '[ruby-dev:32604]'
+
+
+assert_equal '[nil, []]', %q{
+  def m() yield nil,[] end
+  l = lambda {|*v| v}
+  GC.stress=true
+  r = m(&l)
+  GC.stress=false
+  r.inspect
+}, '[ruby-dev:32567]'
+
+assert_equal NilClass.to_s, %q{
+  r = false; 1.times{|&b| r = b}; r.class
+}
+
+assert_equal 'ok', %q{
+  class C
+    define_method(:foo) do |arg, &block|
+      if block then block.call else arg end
+    end
+  end
+  C.new.foo("ng") {"ok"}
+}, '[ruby-talk:266422]'
+
+assert_equal 'ok', %q{
+  class C
+    define_method(:xyz) do |o, k, &block|
+      block.call(o, k)
+    end
+  end
+  C.new.xyz("o","k") {|o, k| o+k}
+}, '[ruby-core:20544]'
+
+assert_equal 'ok', %q{
+  class C
+    define_method(:xyz) do |*args, &block|
+      block.call(*args)
+    end
+  end
+  C.new.xyz("o","k") {|*args| args.join("")}
+}, '[ruby-core:20544]'
+
+assert_equal 'ok', %q{
+  STDERR.reopen(STDOUT)
+  class C
+    define_method(:foo) do |&block|
+      block.call if block
+    end
+    result = "ng"
+    new.foo() {result = "ok"}
+    result
+  end
+}
+
+assert_equal "ok", %q{
+  class Bar
+    def bar; :ok; end
+  end
+  def foo
+    yield(Bar.new) if block_given?
+  end
+  foo(&:bar)
+}, '[ruby-core:14279]'
+
+assert_normal_exit %q{
+  class Controller
+    def respond_to(&block)
+      responder = Responder.new
+      block.call(responder)
+      responder.respond
+    end
+    def test_for_bug
+      respond_to{|format|
+        format.js{
+          puts "in test"
+          render{|obj|
+            puts obj
+          }
+        }
+      }
+    end
+    def render(&block)
+      puts "in render"
+    end
+  end
+
+  class Responder
+    def method_missing(symbol, &block)
+      puts "enter method_missing"
+      @response = Proc.new{
+        puts 'in method missing'
+        block.call
+      }
+      puts "leave method_missing"
+    end
+    def respond
+      @response.call
+    end
+  end
+  t = Controller.new
+  t.test_for_bug
+}, '[ruby-core:14395]'
+
+assert_equal 'true', %q{
+  class C0
+    def foo
+      block_given?
+    end
+  end
+
+  class C1 < C0
+    def foo
+      super
+    end
+  end
+
+  C1.new.foo{}
+}
+
+assert_equal 'true', %q{
+  class C0
+    def foo
+      block_given?
+    end
+  end
+
+  class C1 < C0
+    def foo
+      super()
+    end
+  end
+
+  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
new file mode 100644
index 0000000000..b7fe0a1acd
--- /dev/null
+++ b/bootstraptest/test_class.rb
@@ -0,0 +1,169 @@
+# class
+assert_equal 'true',    %q( class C; end
+                            Object.const_defined?(:C) )
+assert_equal 'Class',   %q( class C; end
+                            C.class )
+assert_equal 'C',       %q( class C; end
+                            C.name )
+assert_equal 'C',       %q( class C; end
+                            C.new.class )
+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
+                            class C < A; end
+                            Object.const_defined?(:C) )
+assert_equal 'Class',   %q( class A; end
+                            class C < A; end
+                            C.class )
+assert_equal 'C',       %q( class A; end
+                            class C < A; end
+                            C.name )
+assert_equal 'C',       %q( class A; end
+                            class C < A; end
+                            C.new.class )
+assert_equal 'C',       %q( class A; end
+                            class C < A; end
+                            C.new.class.name )
+assert_equal 'Class',   %q( class A; end
+                            class C < A; end
+                            C.new.class.class )
+
+# module
+assert_equal 'true',    %q( module M; end
+                            Object.const_defined?(:M) )
+assert_equal 'Module',  %q( module M; end
+                            M.class )
+assert_equal 'M',       %q( module M; end
+                            M.name )
+assert_equal 'C',       %q( module M; end
+                            class C; include M; end
+                            C.new.class )
+
+# nested class
+assert_equal 'A::B',    %q( class A; end
+                            class A::B; end
+                            A::B )
+assert_equal 'A::B',    %q( class A; end
+                            class A::B; end
+                            A::B.name )
+assert_equal 'A::B',    %q( class A; end
+                            class A::B; end
+                            A::B.new.class )
+assert_equal 'Class',   %q( class A; end
+                            class A::B; end
+                            A::B.new.class.class )
+assert_equal 'A::B::C', %q( class A; end
+                            class A::B; end
+                            class A::B::C; end
+                            A::B::C )
+assert_equal 'A::B::C', %q( class A; end
+                            class A::B; end
+                            class A::B::C; end
+                            A::B::C.name )
+assert_equal 'Class',   %q( class A; end
+                            class A::B; end
+                            class A::B::C; end
+                            A::B::C.class )
+assert_equal 'A::B::C', %q( class A; end
+                            class A::B; end
+                            class A::B::C; end
+                            A::B::C.new.class )
+assert_equal 'Class',   %q( class A; end
+                            class A::B; end
+                            class A::B::C; end
+                            A::B::C.new.class.class )
+assert_equal 'A::B2',   %q( class A; end
+                            class A::B; end
+                            class A::B2 < A::B; end
+                            A::B2 )
+assert_equal 'Class',   %q( class A; end
+                            class A::B; end
+                            class A::B2 < A::B; end
+                            A::B2.class )
+
+# reopen
+assert_equal 'true',    %q( class C; end;  c1 = ::C
+                            class C; end;  c2 = ::C
+                            c1.equal?(c2) )
+assert_equal '1',       %q( class C; end
+                            class A; end
+                            begin class C < A; end; rescue TypeError; 1 end )
+assert_equal '1',       %q( class C; end
+                            begin module C; end; rescue TypeError; 1 end )
+assert_equal '1',       %q( C = 1   # [yarv-dev:782]
+                            begin class C; end; rescue TypeError; 1 end )
+assert_equal '1',       %q( C = 1   # [yarv-dev:800]
+                            begin module C; end; rescue TypeError; 1 end )
+
+# colon2, colon3
+assert_equal '1',       %q( class A; end;  A::C = 1;  A::C )
+assert_equal '1',       %q( A = 7;  begin A::C = 7; rescue TypeError; 1 end )
+assert_equal '1',       %q( begin 7::C = 7; rescue TypeError; 1 end )
+assert_equal 'C',       %q( class A; class ::C; end end;  C )
+assert_equal 'Class',   %q( class A; class ::C; end end;  C.class )
+assert_equal 'OK',      %q( class A; ::C = "OK"; end;  C )
+assert_equal 'String',  %q( class A; ::C = "OK"; end;  C.class )
+
+# class/module dup
+assert_equal 'Class',   %q( class C; end;  C.dup.class )
+assert_equal 'Module',  %q( module M; end;  M.dup.class )
+
+
+assert_equal "ok", %q{
+  module Foo
+  end
+
+  begin
+    def foo(&b)
+      Foo.module_eval &b
+    end
+    foo{
+      def bar
+      end
+    }
+    bar()
+  rescue NameError
+    :ok
+  end
+}, '[ruby-core:14378]'
+
+assert_equal '3', %q{
+  $i = 0
+  class C
+    def self.const_missing *args
+      $i+=1
+    end
+  end
+
+  3.times{
+    C::FOO
+  }
+  $i
+}
+
+assert_match /::C\z/, %q{
+  c = nil
+  Module.new{|m| c = class m::C; name; end}
+  c
+}, '[ruby-dev:38456]'
+
+assert_normal_exit %q{
+  s = Symbol.dup
+  class << s
+  end
+  s.allocate.to_s
+}, '[ruby-core:30843]'
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
new file mode 100644
index 0000000000..20bd9615f4
--- /dev/null
+++ b/bootstraptest/test_eval.rb
@@ -0,0 +1,397 @@
+assert_equal %q{ok}, %q{
+  def m
+    a = :ok
+    $b = binding
+  end
+  m
+  eval('a', $b)
+}
+assert_equal %q{[:ok, :ok2]}, %q{
+  def m
+    a = :ok
+    $b = binding
+  end
+  m
+  eval('b = :ok2', $b)
+  eval('[a, b]', $b)
+}
+assert_equal %q{[nil, 1]}, %q{
+  $ans = []
+  def m
+    $b = binding
+  end
+  m
+  $ans << eval(%q{
+    $ans << eval(%q{
+      a
+    }, $b)
+    a = 1
+  }, $b)
+  $ans
+}
+assert_equal %q{C}, %q{
+  Const = :top
+  class C
+    Const = :C
+    def m
+      binding
+    end
+  end
+  eval('Const', C.new.m)
+}
+assert_equal %q{top}, %q{
+  Const = :top
+  a = 1
+  class C
+    Const = :C
+    def m
+      eval('Const', TOPLEVEL_BINDING)
+    end
+  end
+  C.new.m
+}
+assert_equal %q{:ok
+ok}, %q{
+  class C
+    $b = binding
+  end
+  eval %q{
+    def m
+      :ok
+    end
+  }, $b
+  p C.new.m
+}
+assert_equal %q{ok}, %q{
+  b = proc{
+    a = :ok
+    binding
+  }.call
+  a = :ng
+  eval("a", b)
+}
+assert_equal %q{C}, %q{
+  class C
+    def foo
+      binding
+    end
+  end
+  C.new.foo.eval("self.class.to_s")
+}
+assert_equal %q{1}, %q{
+  eval('1')
+}
+assert_equal %q{1}, %q{
+  eval('a=1; a')
+}
+assert_equal %q{1}, %q{
+  a = 1
+  eval('a')
+}
+assert_equal %q{ok}, %q{
+  __send__ :eval, %{
+    :ok
+  }
+}
+assert_equal %q{ok}, %q{
+  1.__send__ :instance_eval, %{
+    :ok
+  }
+}
+assert_equal %q{1}, %q{
+  1.instance_eval{
+    self
+  }
+}
+assert_equal %q{foo}, %q{
+  'foo'.instance_eval{
+    self
+  }
+}
+assert_equal %q{1}, %q{
+  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
+    Const = :C
+  end
+  C.module_eval{
+    Const
+  }
+}
+assert_equal %q{C}, %q{
+  Const = :top
+  class C
+    Const = :C
+  end
+  C.class_eval %{
+    def m
+      Const
+    end
+  }
+  C.new.m
+}
+assert_equal %q{top}, %q{
+  Const = :top
+  class C
+    Const = :C
+  end
+  C.class_eval{
+    def m
+      Const
+    end
+  }
+  C.new.m
+}
+assert_equal %q{[:top, :C, :top, :C]}, %q{
+  Const = :top
+  class C
+    Const = :C
+  end
+  $nest = false
+  $ans = []
+  def m
+    $ans << Const
+    C.module_eval %{
+      $ans << Const
+      Boo = false unless defined? Boo
+      unless $nest
+        $nest = true
+        m
+      end
+    }
+  end
+  m
+  $ans
+}
+assert_equal %q{[10, main]}, %q{
+  $nested = false
+  $ans = []
+  $pr = proc{
+    $ans << self
+    unless $nested
+      $nested = true
+      $pr.call
+    end
+  }
+  class C
+    def initialize &b
+      10.instance_eval(&b)
+    end
+  end
+  C.new(&$pr)
+  $ans
+}
+
+%w[break next redo].each do |keyword|
+  assert_match %r"Invalid #{keyword}\b", %{
+    $stderr = STDOUT
+    begin
+      eval "0 rescue #{keyword}"
+    rescue SyntaxError => e
+      e.message
+    end
+  }, '[ruby-dev:31372]'
+end
+
+assert_normal_exit %{
+  $stderr = STDOUT
+  5000.times do
+    begin
+      eval "0 rescue break"
+    rescue SyntaxError
+    end
+  end
+}
+
+assert_normal_exit %q{
+  $stderr = STDOUT
+  class Foo
+     def self.add_method
+       class_eval("def some-bad-name; puts 'hello' unless @some_variable.some_function(''); end")
+     end
+  end
+  Foo.add_method
+}, '[ruby-core:14556] reported by Frederick Cheung'
+
+assert_equal 'ok', %q{
+  class Module
+    def my_module_eval(&block)
+      module_eval(&block)
+    end
+  end
+  class String
+    Integer.my_module_eval do
+      def hoge; end
+    end
+  end
+  if Integer.instance_methods(false).map{|m|m.to_sym}.include?(:hoge) &&
+     !String.instance_methods(false).map{|m|m.to_sym}.include?(:hoge)
+    :ok
+  else
+    :ng
+  end
+}, "[ruby-dev:34236]"
+
+assert_equal 'ok', %q{
+  begin
+    eval("class nil::Foo; end")
+    :ng
+  rescue Exception
+    :ok
+  end
+}
+
+assert_equal 'ok', %q{
+  begin
+    0.instance_eval { def m() :m end }
+    1.m
+    :ng
+  rescue Exception
+    :ok
+  end
+}, '[ruby-dev:34579]'
+
+assert_equal 'ok', %q{
+  begin
+    class A
+      12.instance_eval { @@a }
+    end
+  rescue NameError
+    :ok
+  end
+}, '[ruby-core:16794]'
+
+assert_equal 'ok', %q{
+  begin
+    class A
+      12.instance_exec { @@a }
+    end
+  rescue NameError
+    :ok
+  end
+}, '[ruby-core:16794]'
+
+assert_equal 'ok', %q{
+  nil.instance_eval {
+    def defd_using_instance_eval() :ok end
+  }
+  nil.defd_using_instance_eval
+}, '[ruby-core:28324]'
+
+assert_equal 'ok', %q{
+  nil.instance_exec {
+    def defd_using_instance_exec() :ok end
+  }
+  nil.defd_using_instance_exec
+}, '[ruby-core:28324]'
+
+assert_normal_exit %q{
+  eval("", method(:proc).call {}.binding)
+}
+
+assert_equal "", %q{
+  b = binding
+  10.times{
+    eval('', b)
+  }
+  begin
+    eval('1.times{raise}', b)
+  rescue => e
+    e.message
+  end
+}, '[ruby-dev:35392]'
+
+assert_equal "[:x]", %q{
+  def kaboom!
+    yield.eval("local_variables")
+  end
+
+  for x in enum_for(:kaboom!)
+    binding
+  end
+}, '[ruby-core:25125]'
+
+assert_normal_exit %q{
+  hash = {}
+  ("aaaa".."matz").each_with_index do |s, i|
+    hash[s] = i
+  end
+  begin
+    eval "class C; @@h = #{hash.inspect}; end"
+  end
+}, '[ruby-core:25714]'
+
+assert_normal_exit %q{
+  begin
+    eval("# encoding:utf-16le\nfoo")
+  rescue Exception => e
+    p e
+    RubyVM::InstructionSequence.compile("p:hello")
+  end
+}, 'check escaping the internal value th->base_block'
+
+assert_equal "false", <<~RUBY, "literal strings are mutable", "--disable-frozen-string-literal"
+  eval("'test'").frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "literal strings are mutable", "--disable-frozen-string-literal", frozen_string_literal: true
+  eval("'test'").frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "literal strings are frozen", "--enable-frozen-string-literal"
+  eval("'test'").frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "literal strings are frozen", "--enable-frozen-string-literal", frozen_string_literal: false
+  eval("'test'").frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "__FILE__ is mutable", "--disable-frozen-string-literal"
+  eval("__FILE__").frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "__FILE__ is mutable", "--disable-frozen-string-literal", frozen_string_literal: true
+  eval("__FILE__").frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "__FILE__ is frozen", "--enable-frozen-string-literal"
+  eval("__FILE__").frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "__FILE__ is frozen", "--enable-frozen-string-literal", frozen_string_literal: false
+  eval("__FILE__").frozen?
+RUBY
diff --git a/bootstraptest/test_exception.rb b/bootstraptest/test_exception.rb
new file mode 100644
index 0000000000..decfdc08a3
--- /dev/null
+++ b/bootstraptest/test_exception.rb
@@ -0,0 +1,432 @@
+assert_equal %q{2}, %q{
+  begin
+    1+1
+  ensure
+    2+2
+  end
+}
+assert_equal %q{4}, %q{
+  begin
+    1+1
+    begin
+      2+2
+    ensure
+      3+3
+    end
+  ensure
+    4+4
+  end
+}
+assert_equal %q{4}, %q{
+  begin
+    1+1
+    begin
+      2+2
+    ensure
+      3+3
+    end
+  ensure
+    4+4
+    begin
+      5+5
+    ensure
+      6+6
+    end
+  end
+}
+assert_equal %q{NilClass}, %q{
+  a = nil
+  1.times{|e|
+    begin
+    rescue => err
+    end
+    a = err.class
+  }
+  a
+}
+assert_equal %q{RuntimeError}, %q{
+  a = nil
+  1.times{|e|
+    begin
+      raise
+    rescue => err
+    end
+    a = err.class
+  }
+  a
+}
+assert_equal %q{}, %q{
+  $!
+}
+assert_equal %q{FOO}, %q{
+  begin
+    raise "FOO"
+  rescue
+    $!
+  end
+}
+assert_equal %q{FOO}, %q{
+  def m
+    $!
+  end
+  begin
+    raise "FOO"
+  rescue
+    m()
+  end
+}
+assert_equal %q{[#<RuntimeError: BAR>, #<RuntimeError: FOO>]}, %q{
+  $ans = []
+  def m
+    $!
+  end
+  begin
+    raise "FOO"
+  rescue
+    begin
+      raise "BAR"
+    rescue
+      $ans << m()
+    end
+    $ans << m()
+  end
+  $ans
+}
+assert_equal %q{[#<RuntimeError: FOO>, #<RuntimeError: FOO>]}, %q{
+  $ans = []
+  def m
+    $!
+  end
+
+  begin
+    begin
+      raise "FOO"
+    ensure
+      $ans << m()
+    end
+  rescue
+    $ans << m()
+  end
+}
+assert_equal %q{[nil]}, %q{
+  $ans = []
+  def m
+    $!
+  end
+  def m2
+    1.times{
+      begin
+        return
+      ensure
+        $ans << m
+      end
+    }
+  end
+  m2
+  $ans
+}
+assert_equal %q{ok}, %q{
+  begin
+    raise
+  rescue
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  begin
+    raise
+  rescue
+    :ok
+  ensure
+    :ng
+  end
+}
+assert_equal %q{RuntimeError}, %q{
+  begin
+    raise
+  rescue => e
+    e.class
+  end
+}
+assert_equal %q{ng}, %q{
+  begin
+    raise
+  rescue StandardError
+    :ng
+  rescue Exception
+    :ok
+  end
+}
+assert_equal %q{c}, %q{
+  begin
+    begin
+      raise "a"
+    rescue
+      raise "b"
+    ensure
+      raise "c"
+    end
+  rescue => e
+    e.message
+  end
+}
+assert_equal %q{33}, %q{
+  def m a, b
+    a + b
+  end
+  m(1, begin
+         raise
+       rescue
+         2
+       end) +
+  m(10, begin
+         raise
+       rescue
+         20
+       ensure
+         30
+       end)
+}
+assert_equal %q{3}, %q{
+  def m a, b
+    a + b
+  end
+  m(begin
+      raise
+    rescue
+      1
+    end,
+    begin
+      raise
+    rescue
+      2
+    end)
+}
+assert_equal %q{ok3}, %q{
+  class E1 < Exception
+  end
+
+  def m
+    yield
+  end
+
+  begin
+    begin
+      begin
+        m{
+          raise
+        }
+      rescue E1
+        :ok2
+      ensure
+      end
+    rescue
+      :ok3
+    ensure
+    end
+  rescue E1
+    :ok
+  ensure
+  end
+}
+assert_equal %q{7}, %q{
+  $i = 0
+  def m
+    iter{
+      begin
+        $i += 1
+        begin
+          $i += 2
+          break
+        ensure
+
+        end
+      ensure
+        $i += 4
+      end
+      $i = 0
+    }
+  end
+
+  def iter
+    yield
+  end
+  m
+  $i
+}
+assert_equal %q{10}, %q{
+  $i = 0
+  def m
+    begin
+      $i += 1
+      begin
+        $i += 2
+        return
+      ensure
+        $i += 3
+      end
+    ensure
+      $i += 4
+    end
+    p :end
+  end
+  m
+  $i
+}
+assert_equal %q{1}, %q{
+  begin
+    1
+  rescue
+    2
+  end
+}
+assert_equal %q{4}, %q{
+  begin
+    1
+    begin
+      2
+    rescue
+      3
+    end
+    4
+  rescue
+    5
+  end
+}
+assert_equal %q{3}, %q{
+  begin
+    1
+  rescue
+    2
+  else
+    3
+  end
+}
+assert_equal %q{2}, %q{
+  begin
+    1+1
+  rescue
+    2+2
+  ensure
+    3+3
+  end
+   }
+assert_equal %q{2}, %q{
+  begin
+    1+1
+  rescue
+    2+2
+  ensure
+    3+3
+  end
+   }
+assert_equal %q{6}, %q{
+  begin
+    1+1
+  rescue
+    2+2
+  else
+    3+3
+  ensure
+    4+4
+  end
+   }
+assert_equal %q{12}, %q{
+ begin
+   1+1
+   begin
+     2+2
+   rescue
+     3+3
+   else
+     4+4
+   end
+ rescue
+   5+5
+ else
+   6+6
+ ensure
+   7+7
+ end
+   }
+assert_equal %q{ok}, %q{ #
+  proc{
+    begin
+      raise
+      break
+    rescue
+      :ok
+    end
+  }.call
+}
+assert_equal %q{}, %q{
+  proc do
+    begin
+      raise StandardError
+      redo
+    rescue StandardError
+    end
+  end.call
+}
+
+##
+assert_match /undefined method 'foo\'/, %q{#`
+  STDERR.reopen(STDOUT)
+  class C
+    def inspect
+      bar {}
+    end
+
+    def bar
+      raise
+    ensure
+    end
+  end
+  C.new.foo
+}, "[ruby-dev:31407]"
+
+assert_equal 'nil', %q{
+  doit = false
+  exc = nil
+  t = Thread.new {
+    begin
+      doit = true
+      sleep 10
+    ensure
+      exc = $!
+    end
+  }
+  Thread.pass until doit
+  t.kill
+  t.join
+  exc.inspect
+}, '[ruby-dev:32608]'
+
+assert_equal 'divided by 0', %q{
+  class ZeroDivisionError
+    def self.new(message)
+      42
+    end
+  end
+  begin
+    1/0
+  rescue Exception => e
+    e.message
+  end
+}, '[ruby-core:24767]'
+
+assert_equal 'ok', %q{
+  class C
+    def ===(o)
+      true
+    end
+  end
+  begin
+    begin
+      raise
+    rescue C.new
+    end
+  rescue TypeError
+    :ok
+  end
+}
diff --git a/bootstraptest/test_fiber.rb b/bootstraptest/test_fiber.rb
new file mode 100644
index 0000000000..ae809a5936
--- /dev/null
+++ b/bootstraptest/test_fiber.rb
@@ -0,0 +1,44 @@
+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]'
+
+# [Bug #21400]
+assert_normal_exit %q{
+  Thread.new { Fiber.current.kill }.join
+}
diff --git a/bootstraptest/test_finalizer.rb b/bootstraptest/test_finalizer.rb
new file mode 100644
index 0000000000..ccfa0b55d6
--- /dev/null
+++ b/bootstraptest/test_finalizer.rb
@@ -0,0 +1,16 @@
+assert_normal_exit %q{
+a1,a2,b1,b2=Array.new(4){""}
+ObjectSpace.define_finalizer(b2,proc{})
+ObjectSpace.define_finalizer(b1,proc{b1.inspect})
+
+ObjectSpace.define_finalizer(a2,proc{a1.inspect})
+ObjectSpace.define_finalizer(a1,proc{})
+}, '[ruby-dev:35778]'
+
+assert_equal 'true', %q{
+  obj = Object.new
+  id = obj.object_id
+
+  ObjectSpace.define_finalizer(obj, proc { |i| print(id == i) })
+  nil
+}
diff --git a/bootstraptest/test_flip.rb b/bootstraptest/test_flip.rb
new file mode 100644
index 0000000000..ff194868b2
--- /dev/null
+++ b/bootstraptest/test_flip.rb
@@ -0,0 +1 @@
+assert_equal %q{E}, %q{$_ = "E"; eval("nil if true..~/^E/",nil,"-e"); $_}
diff --git a/bootstraptest/test_flow.rb b/bootstraptest/test_flow.rb
new file mode 100644
index 0000000000..7a95def1e6
--- /dev/null
+++ b/bootstraptest/test_flow.rb
@@ -0,0 +1,601 @@
+assert_equal %q{[1, 2, 4, 5, 6, 7, 8]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each{; $a << 2
+    break; $a << 3
+  }; $a << 4
+  begin; $a << 5
+  ensure; $a << 6
+  end; $a << 7
+; $a << 8
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 6, 7, 8]}, %q{$a = []; begin;  ; $a << 1
+  begin; $a << 2
+    [1,2].each do; $a << 3
+      break; $a << 4
+    end; $a << 5
+  ensure; $a << 6
+  end; $a << 7
+; $a << 8
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{ok}, %q{
+  ["a"].inject("ng"){|x,y|
+    break :ok
+  }
+}
+assert_equal %q{ok}, %q{
+  unless ''.respond_to? :lines
+    class String
+      def lines
+        self
+      end
+    end
+  end
+
+  ('a').lines.map{|e|
+    break :ok
+  }
+}
+assert_equal %q{[1, 2, 4, 5]}, %q{$a = []; begin; ; $a << 1
+  ["a"].inject("ng"){|x,y|; $a << 2
+    break :ok; $a << 3
+  }; $a << 4
+; $a << 5
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 4, 5]}, %q{$a = []; begin; ; $a << 1
+  ('a'..'b').map{|e|; $a << 2
+    break :ok; $a << 3
+  }; $a << 4
+; $a << 5
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 7, 8]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      break; $a << 4
+    ensure; $a << 5
+    end; $a << 6
+  end; $a << 7
+; $a << 8
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 6, 9, 10]}, %q{$a = []; begin; ; $a << 1
+  i=0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    begin; $a << 5
+    ensure; $a << 6
+      break; $a << 7
+    end; $a << 8
+  end; $a << 9
+; $a << 10
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 7, 10, 11]}, %q{$a = []; begin; ; $a << 1
+  i=0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    begin; $a << 5
+      raise; $a << 6
+    ensure; $a << 7
+      break; $a << 8
+    end; $a << 9
+  end; $a << 10
+; $a << 11
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 7, 10, 11]}, %q{$a = []; begin; ; $a << 1
+  i=0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    begin; $a << 5
+      raise; $a << 6
+    rescue; $a << 7
+      break; $a << 8
+    end; $a << 9
+  end; $a << 10
+; $a << 11
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 8, 9]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      raise StandardError; $a << 4
+    ensure; $a << 5
+      break; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 8, 9]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      raise StandardError; $a << 4
+    rescue; $a << 5
+      break; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 6, 8, 10, 11]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      begin; $a << 4
+        break; $a << 5
+      ensure; $a << 6
+      end; $a << 7
+    ensure; $a << 8
+    end; $a << 9
+  end; $a << 10
+; $a << 11
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 3, 4, 5, 6, 7, 8, 10, 13, 3, 4, 5, 6, 7, 8, 10, 13, 14, 15]}, %q{$a = []; begin; ; $a << 1
+  i = 0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    j = 0; $a << 5
+    while j<3; $a << 6
+      j+=1; $a << 7
+      begin; $a << 8
+        raise; $a << 9
+      rescue; $a << 10
+        break; $a << 11
+      end; $a << 12
+    end; $a << 13
+  end; $a << 14
+; $a << 15
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 16, 17]}, %q{$a = []; begin; ; $a << 1
+  i = 0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    j = 0; $a << 5
+    while j<3; $a << 6
+      j+=1; $a << 7
+      1.times{; $a << 8
+        begin; $a << 9
+          raise; $a << 10
+        rescue; $a << 11
+          break; $a << 12
+        end; $a << 13
+      }; $a << 14
+    end; $a << 15
+  end; $a << 16
+; $a << 17
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 6, 7, 8, 10, 13, 3, 4, 5, 6, 7, 8, 10, 13, 3, 4, 5, 6, 7, 8, 10, 13, 14, 15]}, %q{$a = []; begin; ; $a << 1
+  i = 0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    j = 0; $a << 5
+    while j<3; $a << 6
+      j+=1; $a << 7
+      begin; $a << 8
+        raise; $a << 9
+      ensure; $a << 10
+        break; $a << 11
+      end; $a << 12
+    end; $a << 13
+  end; $a << 14
+; $a << 15
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 3, 4, 5, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 6, 7, 8, 9, 11, 14, 15, 16, 17]}, %q{$a = []; begin; ; $a << 1
+  i = 0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    j = 0; $a << 5
+    while j<3; $a << 6
+      j+=1; $a << 7
+      1.times{; $a << 8
+        begin; $a << 9
+          raise; $a << 10
+        ensure; $a << 11
+          break; $a << 12
+        end; $a << 13
+      }; $a << 14
+    end; $a << 15
+  end; $a << 16
+; $a << 17
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  while true; $a << 2
+    begin; $a << 3
+      break; $a << 4
+    ensure; $a << 5
+      break; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 99]}, %q{
+$a = [];
+begin; ; $a << 1
+  while true; $a << 2
+    begin; $a << 3
+      break; $a << 4
+    ensure; $a << 5
+      raise; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 6, 8, 9, 10, 11]}, %q{$a = []; begin;  ; $a << 1
+  begin; $a << 2
+    [1,2].each do; $a << 3
+      begin; $a << 4
+        break; $a << 5
+      ensure; $a << 6
+      end; $a << 7
+    end; $a << 8
+  ensure; $a << 9
+  end; $a << 10
+; $a << 11
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 4, 99]}, %q{$a = []; begin; ; $a << 1
+  begin; $a << 2
+    raise StandardError; $a << 3
+  ensure; $a << 4
+  end; $a << 5
+; $a << 6
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4]}, %q{$a = []; begin;  ; $a << 1
+  begin; $a << 2
+  ensure; $a << 3
+  end ; $a << 4
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 5, 99]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      break; $a << 4
+    ensure; $a << 5
+      raise StandardError; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{3}, %q{
+  def m a, b
+    a + b
+  end
+  m(1,
+    while true
+      break 2
+    end
+    )
+}
+assert_equal %q{4}, %q{
+  def m a, b
+    a + b
+  end
+  m(1,
+    (i=0; while i<2
+       i+=1
+       class C
+         next 2
+       end
+     end; 3)
+    )
+}
+assert_equal %q{34}, %q{
+  def m a, b
+    a+b
+  end
+  m(1, 1.times{break 3}) +
+  m(10, (1.times{next 3}; 20))
+}
+assert_equal %q{[1, 2, 3, 6, 7]}, %q{$a = []; begin; ; $a << 1
+  3.times{; $a << 2
+    class C; $a << 3
+      break; $a << 4
+    end; $a << 5
+  }; $a << 6
+; $a << 7
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  3.times{; $a << 2
+    class A; $a << 3
+      class B; $a << 4
+        break; $a << 5
+      end; $a << 6
+    end; $a << 7
+  }; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 2, 3, 2, 3, 6, 7]}, %q{$a = []; begin; ; $a << 1
+  3.times{; $a << 2
+    class C; $a << 3
+      next; $a << 4
+    end; $a << 5
+  }; $a << 6
+; $a << 7
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 2, 3, 4, 2, 3, 4, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  3.times{; $a << 2
+    class C; $a << 3
+      class D; $a << 4
+        next; $a << 5
+      end; $a << 6
+    end; $a << 7
+  }; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 6, 7]}, %q{$a = []; begin; ; $a << 1
+  while true; $a << 2
+    class C; $a << 3
+      break; $a << 4
+    end; $a << 5
+  end; $a << 6
+; $a << 7
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  while true; $a << 2
+    class C; $a << 3
+      class D; $a << 4
+        break; $a << 5
+      end; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 3, 4, 5, 3, 4, 5, 3, 4, 5, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  i=0; $a << 2
+  while i<3; $a << 3
+    i+=1; $a << 4
+    class C; $a << 5
+      next 10; $a << 6
+    end; $a << 7
+  end; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{1}, %q{
+  1.times{
+    while true
+      class C
+        begin
+          break
+        ensure
+          break
+        end
+      end
+    end
+  }
+}
+assert_equal %q{[1, 2, 3, 5, 2, 3, 5, 7, 8]}, %q{$a = []; begin;  ; $a << 1
+  [1,2].each do; $a << 2
+    begin; $a << 3
+      next; $a << 4
+    ensure; $a << 5
+    end; $a << 6
+  end; $a << 7
+; $a << 8
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 2, 6, 3, 5, 7, 8]}, %q{$a = []; begin;  ; $a << 1
+  o = "test".dup; $a << 2
+  def o.test(a); $a << 3
+    return a; $a << 4
+  ensure; $a << 5
+  end; $a << 6
+  o.test(123); $a << 7
+; $a << 8
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 4, 7, 5, 8, 9]}, %q{$a = []; begin; ; $a << 1
+  def m1 *args; $a << 2
+    ; $a << 3
+  end; $a << 4
+  def m2; $a << 5
+    m1(:a, :b, (return 1 if true; :c)); $a << 6
+  end; $a << 7
+  m2; $a << 8
+; $a << 9
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 8, 2, 3, 4, 5, 9, 10]}, %q{$a = []; begin; ; $a << 1
+  def m(); $a << 2
+    begin; $a << 3
+      2; $a << 4
+    ensure; $a << 5
+      return 3; $a << 6
+    end; $a << 7
+  end; $a << 8
+  m; $a << 9
+; $a << 10
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 3, 11, 4, 5, 6, 7, 12, 13]}, %q{$a = []; begin; ; $a << 1
+  def m2; $a << 2
+  end; $a << 3
+  def m(); $a << 4
+    m2(begin; $a << 5
+         2; $a << 6
+       ensure; $a << 7
+         return 3 if true; $a << 8
+       end); $a << 9
+    4; $a << 10
+  end; $a << 11
+  m(); $a << 12
+; $a << 13
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[1, 16, 2, 3, 4, 5, 6, 7, 10, 11, 17, 18]}, %q{$a = []; begin; ; $a << 1
+  def m; $a << 2
+    1; $a << 3
+    1.times{; $a << 4
+      2; $a << 5
+      begin; $a << 6
+        3; $a << 7
+        return; $a << 8
+        4; $a << 9
+      ensure; $a << 10
+        5; $a << 11
+      end; $a << 12
+      6; $a << 13
+    }; $a << 14
+    7; $a << 15
+  end; $a << 16
+  m(); $a << 17
+; $a << 18
+; rescue Exception; $a << 99; end; $a}
+assert_equal %q{[:ok, :ok2, :last]}, %q{
+  a = []
+  i = 0
+  begin
+    while i < 1
+      i+=1
+      begin
+        begin
+          next
+        ensure
+          a << :ok
+        end
+      ensure
+        a << :ok2
+      end
+    end
+  ensure
+    a << :last
+  end
+  a
+}
+assert_equal %q{[:ok, :ok2, :last]}, %q{
+  a = []
+  i = 0
+  begin
+    while i < 1
+      i+=1
+      begin
+        begin
+          break
+        ensure
+          a << :ok
+        end
+      ensure
+        a << :ok2
+      end
+    end
+  ensure
+    a << :last
+  end
+  a
+}
+assert_equal %q{[:ok, :ok2, :last]}, %q{
+  a = []
+  i = 0
+  begin
+    while i < 1
+      if i>0
+        break
+      end
+      i+=1
+      begin
+        begin
+          redo
+        ensure
+          a << :ok
+        end
+      ensure
+        a << :ok2
+      end
+    end
+  ensure
+    a << :last
+  end
+  a
+}
+assert_equal %Q{ENSURE\n}, %q{
+  def test
+    while true
+      return
+    end
+  ensure
+    puts("ENSURE")
+  end
+  test
+}, '[ruby-dev:37967]'
+
+[['[ruby-core:28129]', %q{
+  class Bug2728
+    include Enumerable
+    define_method(:dynamic_method) do
+      "dynamically defined method"
+    end
+    def each
+      begin
+        yield :foo
+      ensure
+        dynamic_method
+      end
+    end
+  end
+  e = Bug2728.new
+}],
+ ['[ruby-core:28132]', %q{
+  class Bug2729
+    include Enumerable
+    def each
+      begin
+        yield :foo
+      ensure
+        proc {}.call
+      end
+    end
+  end
+  e = Bug2729.new
+}],
+ ['[ruby-core:39125]', %q{
+  class Bug5234
+    include Enumerable
+    def each(&block)
+      begin
+        yield :foo
+      ensure
+        proc(&block)
+      end
+    end
+  end
+  e = Bug5234.new
+}],
+ ['[ruby-dev:45656]', %q{
+  class Bug6460
+    include Enumerable
+    def each(&block)
+      begin
+        yield :foo
+      ensure
+        1.times { Proc.new(&block) }
+      end
+    end
+  end
+  e = Bug6460.new
+}]].each do |bug, src|
+  assert_equal "foo", src + %q{e.detect {true}}, bug
+  assert_equal "true", src + %q{e.any? {true}}, bug
+  assert_equal "false", src + %q{e.all? {false}}, bug
+  assert_equal "true", src + %q{e.include?(:foo)}, bug
+end
+
+assert_equal "foo", %q{
+  class Bug6460
+    def m1
+      m2 {|e|
+        return e
+      }
+    end
+
+    def m2
+      begin
+        yield :foo
+      ensure
+        begin
+          begin
+            yield :foo
+          ensure
+            Proc.new
+            raise ''
+          end
+        rescue
+        end
+      end
+    end
+  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
new file mode 100644
index 0000000000..860ef285d0
--- /dev/null
+++ b/bootstraptest/test_fork.rb
@@ -0,0 +1,104 @@
+assert_equal '0', %q{
+  begin
+    GC.stress = true
+    pid = fork {}
+    Process.wait pid
+    $?.to_i
+  rescue NotImplementedError
+    0
+  end
+}, '[ruby-dev:32404]'
+
+assert_finish 10, %q{
+  begin
+    children = (1..10).map{
+      Thread.start{fork{}}.value
+    }
+    while !children.empty? and pid = Process.wait
+      children.delete(pid)
+    end
+  rescue NotImplementedError
+  end
+}, '[ruby-core:22158]'
+
+# 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
+      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; Process.kill("USR2", pid2) }
+        w.close
+        Process.wait2(pid2)
+      else
+        w.close
+        sleep 0.2
+      end
+      exit true
+    end
+  rescue NotImplementedError
+    :ok
+  end
+}, '[ruby-core:28924]'
+
+assert_equal '[1, 2]', %q{
+  a = []
+  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
+    pid = fork do
+      Process.kill(:INT, pid)
+      Process.kill(:TERM, pid)
+    end
+    Process.wait(pid)
+    100.times {break if a.size > 1; sleep 0.001}
+    a.sort
+  rescue NotImplementedError
+    [1, 2]
+  end
+}, '[ruby-dev:44005] [Ruby 1.9 - Bug #4950]'
+
+assert_equal 'ok', %q{
+  def now = Process.clock_gettime(Process::CLOCK_MONOTONIC)
+
+  Thread.new do
+    loop { sleep 0.0001 }
+  end
+
+  10.times do
+    pid = fork{ exit!(0) }
+    deadline = now + 10
+    while true
+      _, status = Process.waitpid2(pid, Process::WNOHANG)
+      break if status
+      if now > deadline
+        Process.kill(:KILL, pid)
+        raise "failed"
+      end
+      sleep 0.001
+    end
+    unless status.success?
+      raise "child exited with status #{status}"
+    end
+  rescue NotImplementedError
+  end
+  :ok
+}, '[Bug #20670]'
+
diff --git a/bootstraptest/test_gc.rb b/bootstraptest/test_gc.rb
new file mode 100644
index 0000000000..eb68c9845e
--- /dev/null
+++ b/bootstraptest/test_gc.rb
@@ -0,0 +1,34 @@
+assert_normal_exit %q{
+a = []
+ms = "a".."k"
+("A".."Z").each do |mod|
+  mod = eval("module #{mod}; self; end")
+  ms.each do |meth|
+    iseq = RubyVM::InstructionSequence.compile("module #{mod}; def #{meth}; end; end")
+    GC.stress = true
+    iseq.eval
+    GC.stress = false
+  end
+  o = Object.new.extend(mod)
+  ms.each do |meth|
+    o.send(meth)
+  end
+end
+}, '[ruby-dev:39453]'
+
+assert_normal_exit %q{
+a = []
+ms = "a".."k"
+("A".."Z").each do |mod|
+  mod = eval("module #{mod}; self; end")
+  ms.each do |meth|
+    GC.stress = true
+    mod.module_eval {define_method(meth) {}}
+    GC.stress = false
+  end
+  o = Object.new.extend(mod)
+  ms.each do |meth|
+    o.send(meth)
+  end
+end
+}, '[ruby-dev:39453]'
diff --git a/bootstraptest/test_insns.rb b/bootstraptest/test_insns.rb
new file mode 100644
index 0000000000..1f70c8075c
--- /dev/null
+++ b/bootstraptest/test_insns.rb
@@ -0,0 +1,492 @@
+# 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}[//] }, ],
+  [ 'dupstring',                %q{ "true" }, ],
+  [ 'tostring / concatstrings', %q{ "#{true}" }, ],
+  [ 'toregexp',                 %q{ /#{true}/ =~ "true" && $~ }, ],
+  [ 'intern',                   %q{ :"#{true}" }, ],
+
+  [ 'newarray',    %q{ ["true"][0] }, ],
+  [ 'pushtoarraykwsplat', %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_duparray_send', %q{ x = :a; [:a, :b].include?(x) }, ],
+  [ 'opt_duparray_send', <<-'},', ], # {
+    class Array
+      def include?(i)
+        i == 1
+      end
+    end
+    x = 1
+    [:a, :b].include?(x)
+  },
+
+  [ 'opt_newarray_send', %q{ ![ ].hash.nil? }, ],
+
+  [ 'opt_newarray_send', %q{ v=2; [1, Object.new, 2].include?(v) }, ],
+
+  [ 'opt_newarray_send', %q{ [ ].max.nil? }, ],
+  [ 'opt_newarray_send', %q{ [1, x = 2, 3].max == 3 }, ],
+  [ 'opt_newarray_send', <<-'},', ], # {
+    class Array
+      def max
+        true
+      end
+    end
+    [1, x = 2, 3].max
+  },
+  [ 'opt_newarray_send', %q{ [ ].min.nil? }, ],
+  [ 'opt_newarray_send', %q{ [3, x = 2, 1].min == 1 }, ],
+  [ 'opt_newarray_send', <<-'},', ], # {
+    class Array
+      def min
+        true
+      end
+    end
+    [3, x = 2, 1].min
+  },
+  [ 'opt_newarray_send', %q{ v = 1.23; [v, v*2].pack("E*").unpack("E*") == [v, v*2] }, ],
+  [ 'opt_newarray_send', %q{ v = 4.56; b = +"x"; [v, v*2].pack("E*", buffer: b); b[1..].unpack("E*") == [v, v*2] }, ],
+  [ 'opt_newarray_send', <<-'},', ], # {
+    v = 7.89;
+    b = +"x";
+    class Array
+      alias _pack pack
+      def pack(s, buffer: nil, prefix: "y")
+        buffer ||= +"b"
+        buffer << prefix
+        _pack(s, buffer: buffer)
+      end
+    end
+    tests = []
+
+    ret = [v].pack("E*", prefix: "z")
+    tests << (ret[0..1] == "bz")
+    tests << (ret[2..].unpack("E*") == [v])
+
+    ret = [v].pack("E*")
+    tests << (ret[0..1] == "by")
+    tests << (ret[2..].unpack("E*") == [v])
+
+    [v, v*2, v*3].pack("E*", buffer: b)
+    tests << (b[0..1] == "xy")
+    tests << (b[2..].unpack("E*") == [v, v*2, v*3])
+
+    class Array
+      def pack(_fmt, buffer:) = buffer
+    end
+
+    b = nil
+    tests << [v].pack("E*", buffer: b).nil?
+
+    class Array
+      def pack(_fmt, **kw) = kw.empty?
+    end
+
+    tests << [v].pack("E*") == true
+
+    tests.all? or puts tests
+  },
+
+  [ '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_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
new file mode 100644
index 0000000000..4081769a8c
--- /dev/null
+++ b/bootstraptest/test_io.rb
@@ -0,0 +1,115 @@
+/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.01 until t1.stop? and t2.stop?
+  w.write "a"
+  w.write "a"
+}, '[ruby-dev:31866]'
+
+assert_finish 10, %q{
+  begin
+    require "io/nonblock"
+    require "timeout"
+    timeout(3) do
+      r, w = IO.pipe
+      w.nonblock?
+      w.nonblock = true
+      w.write_nonblock("a" * 100000)
+      w.nonblock = false
+      t1 = Thread.new { w.write("b" * 4096) }
+      t2 = Thread.new { w.write("c" * 4096) }
+      sleep 0.5
+      r.sysread(4096).length
+      sleep 0.5
+      r.sysread(4096).length
+      t1.join
+      t2.join
+    end
+  rescue LoadError, Timeout::Error, NotImplementedError
+  end
+}, '[ruby-dev:32566]'
+
+/freebsd/ =~ RUBY_PLATFORM or
+assert_finish 5, %q{
+  r, w = IO.pipe
+  Thread.new {
+    w << "ab"
+    sleep 0.01
+    w << "ab"
+  }
+  r.gets("abab")
+}
+
+assert_equal 'ok', %q{
+  require 'tmpdir'
+  begin
+    tmpname = "#{Dir.tmpdir}/ruby-btest-#{$$}-#{rand(0x100000000).to_s(36)}"
+    rw = File.open(tmpname, File::RDWR|File::CREAT|File::EXCL)
+  rescue Errno::EEXIST
+    retry
+  end
+  save = STDIN.dup
+  STDIN.reopen(rw)
+  STDIN.reopen(save)
+  rw.close
+  File.unlink(tmpname)
+  :ok
+}
+
+assert_equal 'ok', %q{
+  require 'tmpdir'
+  begin
+    tmpname = "#{Dir.tmpdir}/ruby-btest-#{$$}-#{rand(0x100000000).to_s(36)}"
+    rw = File.open(tmpname, File::RDWR|File::CREAT|File::EXCL)
+  rescue Errno::EEXIST
+    retry
+  end
+  save = STDIN.dup
+  STDIN.reopen(rw)
+  STDIN.print "a"
+  STDIN.reopen(save)
+  rw.close
+  File.unlink(tmpname)
+  :ok
+}
+
+assert_equal 'ok', %q{
+  dup = STDIN.dup
+  dupfd = dup.fileno
+  dupfd == STDIN.dup.fileno ? :ng : :ok
+}, '[ruby-dev:46834]'
+
+assert_normal_exit %q{
+  ARGF.set_encoding "foo"
+}
+
+/(freebsd|mswin)/ =~ RUBY_PLATFORM or
+10.times do
+  assert_normal_exit %q{
+    at_exit { p :foo }
+
+    megacontent = "abc" * 12345678
+    #File.write("megasrc", megacontent)
+
+    t0 = Thread.main
+    Thread.new { sleep 0.001 until t0.stop?; Process.kill(:INT, $$) }
+
+    r1, w1 = IO.pipe
+    r2, w2 = IO.pipe
+    t1 = Thread.new { w1 << megacontent; w1.close }
+    t2 = Thread.new { r2.read; r2.close }
+    IO.copy_stream(r1, w2) rescue nil
+    w2.close
+    r1.close
+    t1.join
+    t2.join
+  }, 'megacontent-copy_stream', ["INT"], :timeout => 10 or break
+end
+
+assert_normal_exit %q{
+  r, w = IO.pipe
+  STDOUT.reopen(w)
+  STDOUT.reopen(__FILE__, "r")
+}, '[ruby-dev:38131]'
diff --git a/bootstraptest/test_jump.rb b/bootstraptest/test_jump.rb
new file mode 100644
index 0000000000..8751343b1f
--- /dev/null
+++ b/bootstraptest/test_jump.rb
@@ -0,0 +1,314 @@
+assert_equal %q{ok}, %q{
+  def m
+    :ng1
+    mm{
+      yield
+    }
+    :ng2
+  end
+
+  def mm
+    :ng3
+    yield
+    :ng4
+  end
+
+  m{
+    break :ok
+  }
+}
+assert_equal %q{ok}, %q{
+  3.times{
+    break :ok
+  }
+}
+assert_equal %q{}, %q{
+  catch(:foo){
+    throw :foo
+  }
+}
+assert_equal %q{false}, %q{
+  catch(:foo){
+    throw :foo, false
+  }
+}
+assert_equal %q{}, %q{
+  catch(:foo){
+    throw :foo, nil
+  }
+}
+assert_equal %q{ok}, %q{
+  catch(:foo){
+    throw :foo, :ok
+  }
+}
+assert_equal %q{}, %q{
+  catch(:foo){
+    1.times{
+      throw :foo
+    }
+  }
+}
+assert_equal %q{ok}, %q{
+  catch(:foo){
+    1.times{
+      throw :foo, :ok
+    }
+  }
+}
+assert_equal %q{ok}, %q{
+  catch(:foo){
+    catch(:bar){
+      throw :foo, :ok
+    }
+    :ng
+  }
+}
+assert_equal %q{ok}, %q{
+  catch(:foo){
+    catch(:bar){
+      1.times{
+        throw :foo, :ok
+      }
+    }
+    :ng
+  }
+}
+assert_equal %q{2}, %q{
+  module Enumerable
+    def all_?
+      self.each{|e|
+        unless yield(e)
+          return false
+        end
+      }
+      true
+    end
+  end
+
+  xxx = 0
+  [1,2].each{|bi|
+    [3,4].each{|bj|
+      [true, nil, true].all_?{|be| be}
+      break
+    }
+    xxx += 1
+  }
+  xxx
+}
+assert_equal %q{ok}, %q{
+  def m
+    yield
+  end
+
+  m{
+    begin
+    ensure
+      break :ok
+    end
+  }
+}
+assert_equal %q{ok}, %q{
+  def m
+    yield
+    :ok
+  end
+  i=0
+  m{
+    if i>10
+      i*i
+    else
+      i+=1
+      next
+    end
+  }
+}
+assert_equal %q{ok}, %q{
+  def m
+    yield
+  end
+
+  m{
+    next :ok
+  }
+}
+assert_equal %q{131}, %q{
+  def m
+    yield + 10
+  end
+  i=0
+  m{
+    if i>10
+      i*i
+    else
+      i+=1
+      redo
+    end
+  }
+}
+assert_match %r{Invalid retry}, %q{
+$stderr = STDOUT
+begin
+  eval %q{
+    1.times{
+      retry
+    }
+  }
+rescue SyntaxError => e
+  e.message
+end
+}
+assert_equal %q{3}, %q{
+  def m
+    return 3
+  end
+  m
+}
+assert_equal %q{ok}, %q{
+  def m
+    :ng1
+    mm{
+      return :ok
+    }
+    :ng2
+  end
+
+  def mm
+    :ng3
+    yield
+    :ng4
+  end
+  m
+}
+assert_equal %q{100}, %q{
+  $i = 0
+  def m
+    begin
+      iter{
+        return
+      }
+    ensure
+      $i = 100
+    end
+  end
+
+  def iter
+    yield
+  end
+  m
+  $i
+}
+assert_equal %q{ok}, %q{
+  def m
+    begin
+      raise
+    rescue
+      return :ok
+    end
+    :ng
+  end
+  m
+}
+assert_equal %q{1}, %q{
+  def m
+    begin
+      raise
+    rescue
+      return 1
+    end
+  end
+
+  m
+}
+assert_equal %q{1}, %q{
+  def m
+    begin
+      #
+    ensure
+      return 1
+    end
+  end
+
+  m
+}
+assert_equal 'ok', %q{
+  begin
+    catch {|t| throw t, :ok }
+  rescue ArgumentError
+    :ng
+  end
+}, '[ruby-dev:31609]'
+
+assert_equal "1", %q{
+  catch do |t|
+    begin
+      throw t, 1
+      2
+    ensure
+      3
+    end
+  end
+}, "[ruby-dev:31698]"
+
+assert_normal_exit %q{
+  f = 0
+  1.times do
+    begin
+      f += 1
+    ensure
+      redo unless f > 2
+    end
+  end
+}
+
+assert_normal_exit %q{
+  -> do
+    1.times do
+      begin
+        raise
+      rescue
+        return
+      end
+    end
+  end.call
+}
+
+assert_normal_exit %q{
+  while true
+    begin
+      raise
+      next
+    rescue
+    end
+    break
+  end
+}, '[ruby-core:28172]'
+
+assert_equal "true", %q{
+  class Object
+    def return_eigenclass
+      class << self
+        return self
+      end
+    end
+  end
+  s = +"foo"
+  s.return_eigenclass == class << s; self; end
+}, '[ruby-core:21379]'
+
+assert_match %r{Invalid yield}, %q{
+$stderr = STDOUT
+begin
+  eval %q{
+    class Object
+      def yield_eigenclass
+        class << self
+          yield self
+        end
+      end
+    end
+  }
+rescue SyntaxError => e
+  e.message
+end
+}
diff --git a/bootstraptest/test_literal.rb b/bootstraptest/test_literal.rb
new file mode 100644
index 0000000000..39e6527027
--- /dev/null
+++ b/bootstraptest/test_literal.rb
@@ -0,0 +1,251 @@
+# empty program
+assert_equal '',                ''
+assert_equal '',                ' '
+assert_equal '',                "\n"
+
+# special const
+assert_equal 'true',            'true'
+assert_equal 'TrueClass',       'true.class'
+assert_equal 'false',           'false'
+assert_equal 'FalseClass',      'false.class'
+assert_equal '',                'nil'
+assert_equal 'nil',             'nil.inspect'
+assert_equal 'NilClass',        'nil.class'
+assert_equal 'sym',             ':sym'
+assert_equal ':sym',            ':sym.inspect'
+assert_equal 'Symbol',          ':sym.class'
+assert_equal '1234',            '1234'
+assert_equal 'Integer',         '1234.class'
+assert_equal '1234',            '1_2_3_4'
+assert_equal 'Integer',         '1_2_3_4.class'
+assert_equal '18',              '0x12'
+assert_equal 'Integer',         '0x12.class'
+assert_equal '15',              '0o17'
+assert_equal 'Integer',         '0o17.class'
+assert_equal '5',               '0b101'
+assert_equal 'Integer',         '0b101.class'
+assert_equal '123456789012345678901234567890', '123456789012345678901234567890'
+assert_equal 'Integer',         '123456789012345678901234567890.class'
+assert_equal '2.0',             '2.0'
+assert_equal 'Float',           '1.3.class'
+
+# self
+assert_equal 'main',            'self'
+assert_equal 'Object',          'self.class'
+
+# string literal
+assert_equal 'a',               '?a'
+assert_equal 'String',          '?a.class'
+assert_equal 'A',               '?A'
+assert_equal 'String',          '?A.class'
+assert_equal "\n",              '?\n'
+assert_equal 'String',          '?\n.class'
+assert_equal ' ',               '?\ '
+assert_equal 'String',          '?\ .class'
+assert_equal 'string',          "'string'"
+assert_equal 'string',          '"string"'
+assert_equal 'string',          '%(string)'
+assert_equal 'string',          '%q(string)'
+assert_equal 'string',          '%Q(string)'
+assert_equal 'string string',   '"string string"'
+assert_equal ' ',               '" "'
+assert_equal "\0",              '"\0"'
+assert_equal "\1",              '"\1"'
+assert_equal "3",               '"\x33"'
+assert_equal "\n",              '"\n"'
+
+# dynamic string literal
+assert_equal '2',               '"#{1 + 1}"'
+assert_equal '16',              '"#{2 ** 4}"'
+assert_equal 'string',          's = "string"; "#{s}"'
+
+# dynamic symbol literal
+assert_equal 'a3c',             ':"a#{1+2}c"'
+assert_equal ':a3c',            ':"a#{1+2}c".inspect'
+assert_equal 'Symbol',          ':"a#{1+2}c".class'
+
+# xstring
+# 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
+assert_equal "ECHO FOO",        %q(def `(s) s.upcase; end; `echo foo`)
+
+# regexp
+assert_equal '',                '//.source'
+assert_equal 'Regexp',          '//.class'
+assert_equal '0',               '// =~ "a"'
+assert_equal '0',               '// =~ ""'
+assert_equal 'a',               '/a/.source'
+assert_equal 'Regexp',          '/a/.class'
+assert_equal '0',               '/a/ =~ "a"'
+assert_equal '0',               '/test/ =~ "test"'
+assert_equal '',                '/test/ =~ "tes"'
+assert_equal '0',               're = /test/; re =~ "test"'
+assert_equal '0',               'str = "test"; /test/ =~ str'
+assert_equal '0',               're = /test/; str = "test"; re =~ str'
+
+# dynamic regexp
+assert_equal 'regexp',          %q(/re#{'ge'}xp/.source)
+assert_equal 'Regexp',          %q(/re#{'ge'}xp/.class)
+
+# array
+assert_equal 'Array',           '[].class'
+assert_equal '0',               '[].size'
+assert_equal '0',               '[].length'
+assert_equal '[]',              '[].inspect'
+assert_equal 'Array',           '[0].class'
+assert_equal '1',               '[3].size'
+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 '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'
+assert_equal '1',               'a = [1,2]; a[0]'
+assert_equal '2',               'a = [1,2]; a[1]'
+assert_equal 'Array',           'a = [1 + 2, 3 + 4, 5 + 6]; a.class'
+assert_equal '[3, 7, 11]',      'a = [1 + 2, 3 + 4, 5 + 6]; a.inspect'
+assert_equal '7',               'a = [1 + 2, 3 + 4, 5 + 6]; a[1]'
+assert_equal '1',               '([0][0] += 1)'
+assert_equal '1',               '([2][0] -= 1)'
+assert_equal 'Array',           'a = [obj = Object.new]; a.class'
+assert_equal '1',               'a = [obj = Object.new]; a.size'
+assert_equal 'true',            'a = [obj = Object.new]; a[0] == obj'
+assert_equal '5',               'a = [1,2,3]; a[1] = 5; a[1]'
+assert_equal 'bar',             '[*:foo];:bar'
+assert_equal '[]',              'def nil.to_a; [1, 2]; end; [*nil]'
+assert_equal '[1]',             'def nil.to_a; [2]; end; [1, *nil]'
+assert_equal '[0, 1, {2 => 3}]', '[0, *[1], 2=>3]', "[ruby-dev:31592]"
+
+
+# hash
+assert_equal 'Hash',            '{}.class'
+assert_equal '{}',              '{}.inspect'
+assert_equal 'Hash',            '{1=>2}.class'
+assert_equal '{1 => 2}',        '{1=>2}.inspect'
+assert_equal '2',               'h = {1 => 2}; h[1]'
+assert_equal '0',               'h = {1 => 2}; h.delete(1); h.size'
+assert_equal '',                'h = {1 => 2}; h.delete(1); h[1]'
+assert_equal '2',               'h = {"string" => "literal", "goto" => "hell"}; h.size'
+assert_equal 'literal', 'h = {"string"=>"literal", "goto"=>"hell"}; h["string"]'
+assert_equal 'hell', 'h = {"string"=>"literal", "goto"=>"hell"}; h["goto"]'
+
+# range
+assert_equal 'Range',           '(1..2).class'
+assert_equal '1..2',            '(1..2).inspect'
+assert_equal '1',               '(1..2).begin'
+assert_equal '2',               '(1..2).end'
+assert_equal 'false',           '(1..2).exclude_end?'
+assert_equal 'Range',           'r = 1..2; r.class'
+assert_equal '1..2',            'r = 1..2; r.inspect'
+assert_equal '1',               'r = 1..2; r.begin'
+assert_equal '2',               'r = 1..2; r.end'
+assert_equal 'false',           'r = 1..2; r.exclude_end?'
+assert_equal 'Range',           '(1...3).class'
+assert_equal '1...3',           '(1...3).inspect'
+assert_equal '1',               '(1...3).begin'
+assert_equal '3',               '(1...3).end'
+assert_equal 'true',            '(1...3).exclude_end?'
+assert_equal 'Range',           'r = (1...3); r.class'
+assert_equal '1...3',           'r = (1...3); r.inspect'
+assert_equal '1',               'r = (1...3); r.begin'
+assert_equal '3',               'r = (1...3); r.end'
+assert_equal 'true',            'r = (1...3); r.exclude_end?'
+assert_equal 'Range',           'r = (1+2 .. 3+4); r.class'
+assert_equal '3..7',            'r = (1+2 .. 3+4); r.inspect'
+assert_equal '3',               'r = (1+2 .. 3+4); r.begin'
+assert_equal '7',               'r = (1+2 .. 3+4); r.end'
+assert_equal 'false',           'r = (1+2 .. 3+4); r.exclude_end?'
+assert_equal 'Range',           'r = (1+2 ... 3+4); r.class'
+assert_equal '3...7',           'r = (1+2 ... 3+4); r.inspect'
+assert_equal '3',               'r = (1+2 ... 3+4); r.begin'
+assert_equal '7',               'r = (1+2 ... 3+4); r.end'
+assert_equal 'true',            'r = (1+2 ... 3+4); r.exclude_end?'
+assert_equal 'Range',           'r = ("a".."c"); r.class'
+assert_equal '"a".."c"',        'r = ("a".."c"); r.inspect'
+assert_equal 'a',               'r = ("a".."c"); r.begin'
+assert_equal 'c',               'r = ("a".."c"); r.end'
+
+assert_equal 'String',          '__FILE__.class'
+assert_equal 'Integer',         '__LINE__.class'
+
+###
+
+assert_equal 'ok', %q{
+  # this cause "called on terminated object".
+  ObjectSpace.each_object(Module) {|m| m.name.inspect }
+  :ok
+}
+
+assert_normal_exit %q{
+  begin
+    r = 0**-1
+    r + r
+  rescue
+  end
+}, '[ruby-dev:34524]'
+
+assert_normal_exit %q{
+  begin
+    r = Marshal.load("\x04\bU:\rRational[\ai\x06i\x05")
+    r + r
+  rescue
+  end
+}, '[ruby-dev:34536]'
+
+assert_equal 'ok', %q{
+  "#{}""#{}ok"
+}, '[ruby-dev:38968]'
+
+assert_equal 'ok', %q{
+  "#{}o""#{}k""#{}"
+}, '[ruby-core:25284]'
+
+assert_equal 'ok', %q{ #  long array literal
+  x = nil
+  eval "a = [#{(1..10_000).map{'x'}.join(", ")}]"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long array literal (optimized)
+  eval "a = [#{(1..10_000).to_a.join(", ")}]"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long hash literal
+  x = nil
+  eval "a = {#{(1..10_000).map{|n| "#{n} => x"}.join(', ')}}"
+  :ok
+}
+
+assert_equal 'ok', %q{ #  long hash literal (optimized)
+  eval "a = {#{(1..10_000).map{|n| "#{n} => #{n}"}.join(', ')}}"
+  :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
new file mode 100644
index 0000000000..7a4d67d0fa
--- /dev/null
+++ b/bootstraptest/test_literal_suffix.rb
@@ -0,0 +1,54 @@
+# numbers with suffix
+assert_equal '0/1',             '0r'
+assert_equal 'Rational',        '0r.class'
+assert_equal '1/1',             '1r'
+assert_equal 'Rational',        '1r.class'
+assert_equal '-1/1',            '-1r'
+assert_equal 'Rational',        '(-1r).class'
+assert_equal '1/1',             '0x1r'
+assert_equal 'Rational',        '0x1r.class'
+assert_equal '1/1',             '0b1r'
+assert_equal 'Rational',        '0b1r.class'
+assert_equal '1/1',             '0d1r'
+assert_equal 'Rational',        '0d1r.class'
+assert_equal '1/1',             '0o1r'
+assert_equal 'Rational',        '0o1r.class'
+assert_equal '1/1',             '01r'
+assert_equal 'Rational',        '01r.class'
+assert_equal '6/5',             '1.2r'
+assert_equal 'Rational',        '1.2r.class'
+assert_equal '-6/5',            '-1.2r'
+assert_equal 'Rational',        '(-1.2r).class'
+assert_equal '0+0i',            '0i'
+assert_equal 'Complex',         '0i.class'
+assert_equal '0+1i',            '1i'
+assert_equal 'Complex',         '1i.class'
+assert_equal '0+1i',            '0x1i'
+assert_equal 'Complex',         '0x1i.class'
+assert_equal '0+1i',            '0b1i'
+assert_equal 'Complex',         '0b1i.class'
+assert_equal '0+1i',            '0d1i'
+assert_equal 'Complex',         '0d1i.class'
+assert_equal '0+1i',            '0o1i'
+assert_equal 'Complex',         '0o1i.class'
+assert_equal '0+1i',            '01i'
+assert_equal 'Complex',         '01i.class'
+assert_equal '0+1.2i',          '1.2i'
+assert_equal 'Complex',         '1.2i.class'
+assert_equal '0+1/1i',          '1ri'
+assert_equal 'Complex',         '1ri.class'
+assert_equal '0+6/5i',          '1.2ri'
+assert_equal 'Complex',         '1.2ri.class'
+assert_equal '0+10.0i',         '1e1i'
+assert_equal 'Complex',         '1e1i.class'
+assert_equal '1',               '1if true'
+assert_equal '1',               '1rescue nil'
+assert_equal '10000000000000000001/10000000000000000000',
+             '1.0000000000000000001r'
+
+assert_equal 'unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1ir', nil, '', 0); rescue SyntaxError => e; e.message[/(?:\^~*|\A:(?:\d+:)? syntax error,) (.*)/, 1]; end}
+assert_equal 'unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1.2ir', nil, '', 0); rescue SyntaxError => e; e.message[/(?:\^~*|\A:(?:\d+:)? syntax error,) (.*)/, 1]; end}
+assert_equal 'unexpected local variable or method, expecting end-of-input',
+             %q{begin eval('1e1r', nil, '', 0); rescue SyntaxError => e; e.message[/(?:\^~*|\A:(?:\d+:)? syntax error,) (.*)/, 1]; end}
diff --git a/bootstraptest/test_load.rb b/bootstraptest/test_load.rb
new file mode 100644
index 0000000000..fa8d31c098
--- /dev/null
+++ b/bootstraptest/test_load.rb
@@ -0,0 +1,27 @@
+assert_equal 'ok', %q{
+  File.write("require-lock-test.rb", <<-END)
+    sleep 0.1
+    module M
+    end
+  END
+  $:.unshift Dir.pwd
+  vs = (1..2).map {|i|
+    Thread.start {
+      require "require-lock-test"
+      M
+    }
+  }.map {|t| t.value }
+  vs[0] == M && vs[1] == M ? :ok : :ng
+}, '[ruby-dev:32048]'
+
+assert_equal 'ok', %q{
+  %w[a a/foo b].each {|d| Dir.mkdir(d)}
+  File.write("b/foo", "$ok = :ok\n")
+  $:.replace(%w[a b])
+  begin
+    load "foo"
+    $ok
+  rescue => e
+    e.message
+  end
+}, '[ruby-dev:38097]'
diff --git a/bootstraptest/test_marshal.rb b/bootstraptest/test_marshal.rb
new file mode 100644
index 0000000000..7e34176169
--- /dev/null
+++ b/bootstraptest/test_marshal.rb
@@ -0,0 +1,5 @@
+
+assert_normal_exit %q{
+  Marshal.load(Marshal.dump({"k"=>"v"}), lambda {|v| v})
+}
+
diff --git a/bootstraptest/test_massign.rb b/bootstraptest/test_massign.rb
new file mode 100644
index 0000000000..0f63dd424a
--- /dev/null
+++ b/bootstraptest/test_massign.rb
@@ -0,0 +1,183 @@
+assert_equal '[[1], 2, 3]', '*v1, (a, b) = [1,[2, 3]]; [v1, a, b]'
+assert_equal '[[1], 2, 3]', '*v1,(*), (a, b) = [1,:x,[2, 3]]; [v1, a, b]'
+
+assert_equal '[]',          '*a = *nil; a'
+assert_equal '[nil]',       '*a = nil; a'
+assert_equal '2',           'a, a = 1, 2; a', "[ruby-dev:31522]"
+assert_equal '[1, 2]',      'a, b = 1, 2'
+assert_equal '[1, 2]', %q{
+  ans = []
+  trace_var(:$a){|v| ans << v}
+  trace_var(:$b){|v| ans << v}
+  $a, $b = 1, 2
+  ans
+}
+
+assert_equal 'ok', %q{
+  r = :ok
+  :ng.tap {|(r)|}
+  r
+}, '[ruby-dev:31507]'
+
+=begin
+# generated by this script:
+
+3.times{|i|
+  8.times{|e|
+    ary = (0...e).to_a
+    a,b,c,d,e,f = nil
+    vals = %w(a b c d e f)
+    vals[i] = '*' + vals[i]
+    program = "#{vals.join(", ")} = *ary"
+    eval(program)
+    ans = [a,b,c,d,e,f]
+    puts %Q{
+      assert_equal "#{ans.inspect}", %q{
+        ary = #{ary.inspect}
+        #{program}; [a, b, c, d, e, f]
+      }}
+  }
+}
+=end
+
+      assert_equal "[[], nil, nil, nil, nil, nil]", %q{
+        ary = []
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[], 0, nil, nil, nil, nil]", %q{
+        ary = [0]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[], 0, 1, nil, nil, nil]", %q{
+        ary = [0, 1]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[], 0, 1, 2, nil, nil]", %q{
+        ary = [0, 1, 2]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[], 0, 1, 2, 3, nil]", %q{
+        ary = [0, 1, 2, 3]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[], 0, 1, 2, 3, 4]", %q{
+        ary = [0, 1, 2, 3, 4]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[0], 1, 2, 3, 4, 5]", %q{
+        ary = [0, 1, 2, 3, 4, 5]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[[0, 1], 2, 3, 4, 5, 6]", %q{
+        ary = [0, 1, 2, 3, 4, 5, 6]
+        *a, b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[nil, [], nil, nil, nil, nil]", %q{
+        ary = []
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [], nil, nil, nil, nil]", %q{
+        ary = [0]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [], 1, nil, nil, nil]", %q{
+        ary = [0, 1]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [], 1, 2, nil, nil]", %q{
+        ary = [0, 1, 2]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [], 1, 2, 3, nil]", %q{
+        ary = [0, 1, 2, 3]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [], 1, 2, 3, 4]", %q{
+        ary = [0, 1, 2, 3, 4]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [1], 2, 3, 4, 5]", %q{
+        ary = [0, 1, 2, 3, 4, 5]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, [1, 2], 3, 4, 5, 6]", %q{
+        ary = [0, 1, 2, 3, 4, 5, 6]
+        a, *b, c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[nil, nil, [], nil, nil, nil]", %q{
+        ary = []
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, nil, [], nil, nil, nil]", %q{
+        ary = [0]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [], nil, nil, nil]", %q{
+        ary = [0, 1]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [], 2, nil, nil]", %q{
+        ary = [0, 1, 2]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [], 2, 3, nil]", %q{
+        ary = [0, 1, 2, 3]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [], 2, 3, 4]", %q{
+        ary = [0, 1, 2, 3, 4]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [2], 3, 4, 5]", %q{
+        ary = [0, 1, 2, 3, 4, 5]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+      assert_equal "[0, 1, [2, 3], 4, 5, 6]", %q{
+        ary = [0, 1, 2, 3, 4, 5, 6]
+        a, b, *c, d, e, f = *ary; [a, b, c, d, e, f]
+      }
+
+
+#
+assert_equal 'ok', %q{
+  a,s=[],"aaa"
+  300.times { a<<s; s=s.succ }
+  eval <<-END__
+  GC.stress=true
+  Fiber.new do
+    #{ a.join(",") },*zzz=1
+  end.resume
+  END__
+  :ok
+}, '[ruby-dev:32581]'
+
+assert_equal 'ok', %q{
+  while true
+    *, z = 1
+    break
+  end
+  :ok
+}, '[ruby-dev:32892]'
diff --git a/bootstraptest/test_method.rb b/bootstraptest/test_method.rb
new file mode 100644
index 0000000000..e894f6f601
--- /dev/null
+++ b/bootstraptest/test_method.rb
@@ -0,0 +1,1442 @@
+# regular argument
+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_match /\Awrong number of arguments \(.*\b1\b.* 0\)\z/, %q{
+  def m; end
+  begin
+    m(1)
+  rescue => e
+    e.message
+  end
+}
+
+assert_match /\Awrong number of arguments \(.*\b0\b.* 1\)\z/, %q{
+  def m a; end
+  begin
+    m
+  rescue => e
+    e.message
+  end
+}
+
+# default argument
+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)'
+assert_equal '1',       'def m(a,b,x=1) x end; m(7,7)'
+assert_equal '1',       'def m(a,b,x=7) x end; m(7,7,1)'
+assert_equal '1',       'def m(a,x=1,y=1) x end; m(7)'
+assert_equal '1',       'def m(a,x=1,y=1) y end; m(7)'
+assert_equal '1',       'def m(a,x=7,y=1) x end; m(7,1)'
+assert_equal '1',       'def m(a,x=7,y=1) y end; m(7,1)'
+assert_equal '1',       'def m(a,x=7,y=7) x end; m(7,1,1)'
+assert_equal '1',       'def m(a,x=7,y=7) y end; m(7,1,1)'
+
+# rest argument
+assert_equal '[]',      'def m(*a) a end; m().inspect'
+assert_equal '[1]',     'def m(*a) a end; m(1).inspect'
+assert_equal '[1, 2]',  'def m(*a) a end; m(1,2).inspect'
+assert_equal '[]',      'def m(x,*a) a end; m(7).inspect'
+assert_equal '[1]',     'def m(x,*a) a end; m(7,1).inspect'
+assert_equal '[1, 2]',  'def m(x,*a) a end; m(7,1,2).inspect'
+assert_equal '[]',      'def m(x,y,*a) a end; m(7,7).inspect'
+assert_equal '[1]',     'def m(x,y,*a) a end; m(7,7,1).inspect'
+assert_equal '[1, 2]',  'def m(x,y,*a) a end; m(7,7,1,2).inspect'
+assert_equal '[]',      'def m(x,y=7,*a) a end; m(7).inspect'
+assert_equal '[]',      'def m(x,y,z=7,*a) a end; m(7,7).inspect'
+assert_equal '[]',      'def m(x,y,z=7,*a) a end; m(7,7,7).inspect'
+assert_equal '[]',      'def m(x,y,z=7,zz=7,*a) a end; m(7,7,7).inspect'
+assert_equal '[]',      'def m(x,y,z=7,zz=7,*a) a end; m(7,7,7,7).inspect'
+assert_equal '1',       'def m(x,y,z=7,zz=1,*a) zz end; m(7,7,7).inspect'
+assert_equal '1',       'def m(x,y,z=7,zz=1,*a) zz end; m(7,7,7).inspect'
+assert_equal '1',       'def m(x,y,z=7,zz=7,*a) zz end; m(7,7,7,1).inspect'
+
+# block argument
+assert_equal 'Proc',    'def m(&block) block end; m{}.class'
+assert_equal 'nil',     'def m(&block) block end; m().inspect'
+assert_equal 'Proc',    'def m(a,&block) block end; m(7){}.class'
+assert_equal 'nil',     'def m(a,&block) block end; m(7).inspect'
+assert_equal '1',       'def m(a,&block) a end; m(1){}'
+assert_equal 'Proc',    'def m(a,b=nil,&block) block end; m(7){}.class'
+assert_equal 'nil',     'def m(a,b=nil,&block) block end; m(7).inspect'
+assert_equal 'Proc',    'def m(a,b=nil,&block) block end; m(7,7){}.class'
+assert_equal '1',       'def m(a,b=nil,&block) b end; m(7,1){}'
+assert_equal 'Proc',    'def m(a,b=nil,*c,&block) block end; m(7){}.class'
+assert_equal 'nil',     'def m(a,b=nil,*c,&block) block end; m(7).inspect'
+assert_equal '1',       'def m(a,b=nil,*c,&block) a end; m(1).inspect'
+assert_equal '1',       'def m(a,b=1,*c,&block) b end; m(7).inspect'
+assert_equal '1',       'def m(a,b=7,*c,&block) b end; m(7,1).inspect'
+assert_equal '[1]',     'def m(a,b=7,*c,&block) c end; m(7,7,1).inspect'
+
+# splat
+assert_equal '1',       'def m(a) a end; m(*[1])'
+assert_equal '1',       'def m(x,a) a end; m(7,*[1])'
+assert_equal '1',       'def m(x,y,a) a end; m(7,7,*[1])'
+assert_equal '1',       'def m(a,b) a end; m(*[1,7])'
+assert_equal '1',       'def m(a,b) b end; m(*[7,1])'
+assert_equal '1',       'def m(x,a,b) b end; m(7,*[7,1])'
+assert_equal '1',       'def m(x,y,a,b) b end; m(7,7,*[7,1])'
+assert_equal '1',       'def m(a,b,c) a end; m(*[1,7,7])'
+assert_equal '1',       'def m(a,b,c) b end; m(*[7,1,7])'
+assert_equal '1',       'def m(a,b,c) c end; m(*[7,7,1])'
+assert_equal '1',       'def m(x,a,b,c) a end; m(7,*[1,7,7])'
+assert_equal '1',       'def m(x,y,a,b,c) a end; m(7,7,*[1,7,7])'
+
+# hash argument
+assert_equal '1',       'def m(h) h end; m(7=>1)[7]'
+assert_equal '1',       'def m(h) h end; m(7=>1).size'
+assert_equal '1',       'def m(h) h end; m(7=>1, 8=>7)[7]'
+assert_equal '2',       'def m(h) h end; m(7=>1, 8=>7).size'
+assert_equal '1',       'def m(h) h end; m(7=>1, 8=>7, 9=>7)[7]'
+assert_equal '3',       'def m(h) h end; m(7=>1, 8=>7, 9=>7).size'
+assert_equal '1',       'def m(x,h) h end; m(7, 7=>1)[7]'
+assert_equal '1',       'def m(x,h) h end; m(7, 7=>1, 8=>7)[7]'
+assert_equal '1',       'def m(x,h) h end; m(7, 7=>1, 8=>7, 9=>7)[7]'
+assert_equal '1',       'def m(x,y,h) h end; m(7,7, 7=>1)[7]'
+assert_equal '1',       'def m(x,y,h) h end; m(7,7, 7=>1, 8=>7)[7]'
+assert_equal '1',       'def m(x,y,h) h end; m(7,7, 7=>1, 8=>7, 9=>7)[7]'
+
+# block argument
+assert_equal '1',       %q(def m(&block) mm(&block) end
+                           def mm() yield 1 end
+                           m {|a| a })
+assert_equal '1',       %q(def m(x,&block) mm(x,&block) end
+                           def mm(x) yield 1 end
+                           m(7) {|a| a })
+assert_equal '1',       %q(def m(x,y,&block) mm(x,y,&block) end
+                           def mm(x,y) yield 1 end
+                           m(7,7) {|a| a })
+
+# recursive call
+assert_equal '1',       %q(def m(n) n == 0 ? 1 : m(n-1) end; m(5))
+
+# instance method
+assert_equal '1',       %q(class C; def m() 1 end end;  C.new.m)
+assert_equal '1',       %q(class C; def m(a) a end end;  C.new.m(1))
+assert_equal '1',       %q(class C; def m(a = 1) a end end;  C.new.m)
+assert_equal '[1]',     %q(class C; def m(*a) a end end;  C.new.m(1).inspect)
+assert_equal '1',       %q( class C
+                              def m() mm() end
+                              def mm() 1 end
+                            end
+                            C.new.m )
+
+# singleton method (const)
+assert_equal '1',       %q(class C; def C.m() 1 end end;  C.m)
+assert_equal '1',       %q(class C; def C.m(a) a end end;  C.m(1))
+assert_equal '1',       %q(class C; def C.m(a = 1) a end end;  C.m)
+assert_equal '[1]',     %q(class C; def C.m(*a) a end end;  C.m(1).inspect)
+assert_equal '1',       %q(class C; end; def C.m() 1 end;  C.m)
+assert_equal '1',       %q(class C; end; def C.m(a) a end;  C.m(1))
+assert_equal '1',       %q(class C; end; def C.m(a = 1) a end;  C.m)
+assert_equal '[1]',     %q(class C; end; def C.m(*a) a end;  C.m(1).inspect)
+assert_equal '1',       %q(class C; def m() 7 end end; def C.m() 1 end;  C.m)
+assert_equal '1',       %q( class C
+                              def C.m() mm() end
+                              def C.mm() 1 end
+                            end
+                            C.m )
+
+# singleton method (lvar)
+assert_equal '1',       %q(obj = Object.new; def obj.m() 1 end;  obj.m)
+assert_equal '1',       %q(obj = Object.new; def obj.m(a) a end;  obj.m(1))
+assert_equal '1',       %q(obj = Object.new; def obj.m(a=1) a end;  obj.m)
+assert_equal '[1]',     %q(obj = Object.new; def obj.m(*a) a end;  obj.m(1))
+assert_equal '1',       %q(class C; def m() 7 end; end
+                           obj = C.new
+                           def obj.m() 1 end
+                           obj.m)
+
+# inheritance
+assert_equal '1',       %q(class A; def m(a) a end end
+                           class B < A; end
+                           B.new.m(1))
+assert_equal '1',       %q(class A; end
+                           class B < A; def m(a) a end end
+                           B.new.m(1))
+assert_equal '1',       %q(class A; def m(a) a end end
+                           class B < A; end
+                           class C < B; end
+                           C.new.m(1))
+
+# include
+assert_equal '1',       %q(class A; def m(a) a end end
+                           module M; end
+                           class B < A; include M; end
+                           B.new.m(1))
+assert_equal '1',       %q(class A; end
+                           module M; def m(a) a end end
+                           class B < A; include M; end
+                           B.new.m(1))
+
+# alias
+assert_equal '1',       %q( def a() 1 end
+                            alias m a
+                            m() )
+assert_equal '1',       %q( class C
+                              def a() 1 end
+                              alias m a
+                            end
+                            C.new.m )
+assert_equal '1',       %q( class C
+                              def a() 1 end
+                              alias :m a
+                            end
+                            C.new.m )
+assert_equal '1',       %q( class C
+                              def a() 1 end
+                              alias m :a
+                            end
+                            C.new.m )
+assert_equal '1',       %q( class C
+                              def a() 1 end
+                              alias :m :a
+                            end
+                            C.new.m )
+assert_equal '1',       %q( class C
+                              def a() 1 end
+                              alias m a
+                              undef a
+                            end
+                            C.new.m )
+
+# undef
+assert_equal '1',       %q( class C
+                              def m() end
+                              undef m
+                            end
+                            begin C.new.m; rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class A
+                              def m() end
+                            end
+                            class C < A
+                              def m() end
+                              undef m
+                            end
+                            begin C.new.m; rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class A; def a() end end   # [yarv-dev:999]
+                            class B < A
+                              def b() end
+                              undef a, b
+                            end
+                            begin B.new.a; rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class A; def a() end end   # [yarv-dev:999]
+                            class B < A
+                              def b() end
+                              undef a, b
+                            end
+                            begin B.new.b; rescue NoMethodError; 1 end )
+
+assert_equal '3',  %q{
+  def m1
+    1
+  end
+  alias m2 m1
+  alias :"#{'m3'}" m1
+  m1 + m2 + m3
+}, '[ruby-dev:32308]'
+assert_equal '1', %q{
+  def foobar
+  end
+  undef :"foo#{:bar}"
+  1
+}, '[ruby-dev:32308]'
+assert_equal '1', %q{
+  def foobar
+    1
+  end
+  alias :"bar#{:baz}" :"foo#{:bar}"
+  barbaz
+}, '[ruby-dev:32308]'
+
+# private
+assert_equal '1',       %q( class C
+                              def m() mm() end
+                              def mm() 1 end
+                              private :mm
+                            end
+                            C.new.m )
+assert_equal '1',       %q( class C
+                              def m() 7 end
+                              private :m
+                            end
+                            begin C.m; rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class C
+                              def C.m() mm() end
+                              def C.mm() 1 end
+                              private_class_method :mm
+                            end
+                            C.m )
+assert_equal '1',       %q( class C
+                              def C.m() 7 end
+                              private_class_method :m
+                            end
+                            begin C.m; rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class C; def m() 1 end end
+                            C.new.m   # cache
+                            class C
+                              alias mm m; private :mm
+                            end
+                            C.new.m
+                            begin C.new.mm; 7; rescue NoMethodError; 1 end )
+
+# nested method
+assert_equal '1',       %q( class C
+                              def m
+                                def mm() 1 end
+                              end
+                            end
+                            C.new.m
+                            C.new.mm )
+assert_equal '1',       %q( class C
+                              def m
+                                def mm() 1 end
+                              end
+                            end
+                            instance_eval "C.new.m; C.new.mm" )
+
+# method_missing
+assert_equal ':m',      %q( class C
+                              def method_missing(mid, *args) mid end
+                            end
+                            C.new.m.inspect )
+assert_equal ':mm',     %q( class C
+                              def method_missing(mid, *args) mid end
+                            end
+                            C.new.mm.inspect )
+assert_equal '[1, 2]',  %q( class C
+                              def method_missing(mid, *args) args end
+                            end
+                            C.new.m(1,2).inspect )
+assert_equal '1',       %q( class C
+                              def method_missing(mid, *args) yield 1 end
+                            end
+                            C.new.m {|a| a })
+assert_equal 'nil',     %q( class C
+                              def method_missing(mid, *args, &block) block end
+                            end
+                            C.new.m.inspect )
+
+# send
+assert_equal '1',       %q( class C; def m() 1 end end;
+                            C.new.__send__(:m) )
+assert_equal '1',       %q( class C; def m() 1 end end;
+                            C.new.send(:m) )
+assert_equal '1',       %q( class C; def m(a) a end end;
+                            C.new.send(:m,1) )
+assert_equal '1',       %q( class C; def m(a,b) a end end;
+                            C.new.send(:m,1,7) )
+assert_equal '1',       %q( class C; def m(x,a=1) a end end;
+                            C.new.send(:m,7) )
+assert_equal '1',       %q( class C; def m(x,a=7) a end end;
+                            C.new.send(:m,7,1) )
+assert_equal '[1, 2]',  %q( class C; def m(*a) a end end;
+                            C.new.send(:m,1,2).inspect )
+assert_equal '1',       %q( class C; def m() 7 end; private :m end
+                            begin C.new.public_send(:m); rescue NoMethodError; 1 end )
+assert_equal '1',       %q( class C; def m() 1 end; private :m end
+                            C.new.send(:m) )
+
+# with
+assert_equal '[:ok1, [:ok2, 11]]', %q{
+  class C
+    def []
+      $ary << :ok1
+      10
+    end
+    def []=(a)
+      $ary << [:ok2, a]
+    end
+  end
+  $ary = []
+  C.new[]+=1
+  $ary
+}
+
+# splat and block arguments
+assert_equal %q{[[[:x, :y, :z], NilClass], [[1, :x, :y, :z], NilClass], [[1, 2, :x, :y, :z], NilClass], [[:obj], NilClass], [[1, :obj], NilClass], [[1, 2, :obj], NilClass], [[], Proc], [[1], Proc], [[1, 2], Proc], [[], Proc], [[1], Proc], [[1, 2], Proc], [[:x, :y, :z], Proc], [[1, :x, :y, :z], Proc], [[1, 2, :x, :y, :z], Proc]]}, %q{
+def m(*args, &b)
+  $result << [args, b.class]
+end
+$result = []
+ary = [:x, :y, :z]
+obj = :obj
+b = Proc.new{}
+
+m(*ary)
+m(1,*ary)
+m(1,2,*ary)
+m(*obj)
+m(1,*obj)
+m(1,2,*obj)
+m(){}
+m(1){}
+m(1,2){}
+m(&b)
+m(1,&b)
+m(1,2,&b)
+m(*ary,&b)
+m(1,*ary,&b)
+m(1,2,*ary,&b)
+$result
+}
+
+# aset and splat
+assert_equal '4', %q{class Foo;def []=(a,b,c,d);end;end;Foo.new[1,*a=[2,3]]=4}
+
+# post test
+assert_equal %q{[1, 2, :o1, :o2, [], 3, 4, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4)}
+
+assert_equal %q{[1, 2, 3, :o2, [], 4, 5, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5)}
+
+assert_equal %q{[1, 2, 3, 4, [], 5, 6, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6)}
+
+assert_equal %q{[1, 2, 3, 4, [5], 6, 7, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7)}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6], 7, 8, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8)}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7], 8, 9, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9)}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7, 8], 9, 10, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7, 8, 9], 10, 11, NilClass, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11)}
+
+assert_equal %q{[1, 2, :o1, :o2, [], 3, 4, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4){}}
+
+assert_equal %q{[1, 2, 3, :o2, [], 4, 5, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5){}}
+
+assert_equal %q{[1, 2, 3, 4, [], 5, 6, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6){}}
+
+assert_equal %q{[1, 2, 3, 4, [5], 6, 7, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7){}}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6], 7, 8, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8){}}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7], 8, 9, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9){}}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7, 8], 9, 10, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9, 10){}}
+
+assert_equal %q{[1, 2, 3, 4, [5, 6, 7, 8, 9], 10, 11, Proc, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2, &b)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, b.class, x, y]
+end
+; m(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11){}}
+
+assert_equal %q{[1, 2, :o1, :o2, [], 3, 4, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, x, y]
+end
+; m(1, 2, 3, 4)}
+
+assert_equal %q{[1, 2, 3, :o2, [], 4, 5, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, x, y]
+end
+; m(1, 2, 3, 4, 5)}
+
+assert_equal %q{[1, 2, 3, 4, [], 5, 6, nil, nil]}, %q{
+def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2)
+  x, y = :x, :y if $foo
+  [m1, m2, o1, o2, r, p1, p2, x, y]
+end
+; m(1, 2, 3, 4, 5, 6)}
+
+
+#
+# super
+#
+=begin
+# below programs are generated by this program:
+
+BASE = <<EOS__
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; <TEST>; super; end; end
+EOS__
+
+tests = {
+%q{
+  def m
+} => %q{
+  C1.new.m
+},
+#
+%q{
+  def m a
+} => %q{
+  C1.new.m 1
+},
+%q{
+  def m a
+    a = :a
+} => %q{
+  C1.new.m 1
+},
+#
+%q{
+  def m a, o=:o
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+},
+%q{
+  def m a, o=:o
+    a = :a
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+},
+%q{
+  def m a, o=:o
+    o = :x
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+},
+#
+%q{
+  def m a, *r
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+  C1.new.m 1, 2, 3
+},
+%q{
+  def m a, *r
+    r = [:x, :y]
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+  C1.new.m 1, 2, 3
+},
+#
+%q{
+  def m a, o=:o, *r
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+  C1.new.m 1, 2, 3
+  C1.new.m 1, 2, 3, 4
+},
+#
+%q{
+  def m a, o=:o, *r, &b
+} => %q{
+  C1.new.m 1
+  C1.new.m 1, 2
+  C1.new.m 1, 2, 3
+  C1.new.m 1, 2, 3, 4
+  C1.new.m(1){}
+  C1.new.m(1, 2){}
+  C1.new.m(1, 2, 3){}
+  C1.new.m(1, 2, 3, 4){}
+},
+#
+"def m(m1, m2, o1=:o1, o2=:o2, p1, p2)" =>
+%q{
+C1.new.m(1,2,3,4)
+C1.new.m(1,2,3,4,5)
+C1.new.m(1,2,3,4,5,6)
+},
+#
+"def m(m1, m2, *r, p1, p2)" =>
+%q{
+C1.new.m(1,2,3,4)
+C1.new.m(1,2,3,4,5)
+C1.new.m(1,2,3,4,5,6)
+C1.new.m(1,2,3,4,5,6,7)
+C1.new.m(1,2,3,4,5,6,7,8)
+},
+#
+"def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2)" =>
+%q{
+C1.new.m(1,2,3,4)
+C1.new.m(1,2,3,4,5)
+C1.new.m(1,2,3,4,5,6)
+C1.new.m(1,2,3,4,5,6,7)
+C1.new.m(1,2,3,4,5,6,7,8)
+C1.new.m(1,2,3,4,5,6,7,8,9)
+},
+
+###
+}
+
+
+tests.each{|setup, methods| setup = setup.dup; setup.strip!
+  setup = BASE.gsub(/<TEST>/){setup}
+  methods.split(/\n/).each{|m| m = m.dup; m.strip!
+    next if m.empty?
+    expr = "#{setup}; #{m}"
+    result = eval(expr)
+    puts "assert_equal %q{#{result.inspect}}, %q{\n#{expr}}"
+    puts
+  }
+}
+
+=end
+
+assert_equal %q{[:C0_m, [1, 2, :o1, :o2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, p1, p2); super; end; end
+; C1.new.m(1,2,3,4)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, :o2, 4, 5]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6)}
+
+assert_equal %q{[:C0_m, [1, :o]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [1, 2, 3]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r; super; end; end
+; C1.new.m 1, 2, 3}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r; super; end; end
+; C1.new.m 1, 2, 3, 4}
+
+assert_equal %q{[:C0_m, [:a]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a
+    a = :a; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6, 7]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6,7)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6, 7, 8]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6,7,8)}
+
+assert_equal %q{[:C0_m, [1, :o]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [1, 2, 3]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m 1, 2, 3}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m 1, 2, 3, 4}
+
+assert_equal %q{[:C0_m, [1, :o]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m(1){}}
+
+assert_equal %q{[:C0_m, [1, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m(1, 2){}}
+
+assert_equal %q{[:C0_m, [1, 2, 3]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m(1, 2, 3){}}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o, *r, &b; super; end; end
+; C1.new.m(1, 2, 3, 4){}}
+
+assert_equal %q{[:C0_m, [1, :x]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o
+    o = :x; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, :x]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o
+    o = :x; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [:a, :o]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o
+    a = :a; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [:a, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o
+    a = :a; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [1]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, :x, :y]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r
+    r = [:x, :y]; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, :x, :y]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r
+    r = [:x, :y]; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [1, :x, :y]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r
+    r = [:x, :y]; super; end; end
+; C1.new.m 1, 2, 3}
+
+assert_equal %q{[:C0_m, [1, 2, :o1, :o2, 3, 4]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, :o2, 4, 5]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6, 7]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6,7)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6, 7, 8]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6,7,8)}
+
+assert_equal %q{[:C0_m, [1, 2, 3, 4, 5, 6, 7, 8, 9]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m(m1, m2, o1=:o1, o2=:o2, *r, p1, p2); super; end; end
+; C1.new.m(1,2,3,4,5,6,7,8,9)}
+
+assert_equal %q{[:C0_m, [1]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal %q{[:C0_m, [1, 2, 3]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, *r; super; end; end
+; C1.new.m 1, 2, 3}
+
+assert_equal %q{[:C0_m, []]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m; super; end; end
+; C1.new.m}
+
+assert_equal %q{[:C0_m, [1, :o]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o; super; end; end
+; C1.new.m 1}
+
+assert_equal %q{[:C0_m, [1, 2]]}, %q{
+class C0; def m *args; [:C0_m, args]; end; end
+class C1 < C0; def m a, o=:o; super; end; end
+; C1.new.m 1, 2}
+
+assert_equal 'ok', %q{
+  class C
+    def x=(n)
+    end
+    def m
+      self.x = :ok
+    end
+  end
+  C.new.m
+}
+
+assert_equal 'ok', %q{
+  proc{
+    $SAFE = 1
+    class C
+      def m
+        :ok
+      end
+    end
+  }.call
+  C.new.m
+}, '[ruby-core:11998]'
+
+assert_equal 'ok', %q{
+  class B
+    def m() :fail end
+  end
+  class C < B
+    undef m
+    begin
+      remove_method :m
+    rescue NameError
+    end
+  end
+  begin
+    C.new.m
+  rescue NameError
+    :ok
+  end
+}, '[ruby-dev:31816], [ruby-dev:31817]'
+
+assert_normal_exit %q{
+  begin
+    Process.setrlimit(Process::RLIMIT_STACK, 4_206_592)
+    # FreeBSD SEGVs this less than 4M + 12K bytes.
+  rescue Exception
+    exit
+  end
+  class C
+    attr "a" * (10*1024*1024)
+  end
+}, '[ruby-dev:31818]'
+
+assert_equal 'ok', %q{
+  class Module
+    def define_method2(name, &block)
+      define_method(name, &block)
+    end
+  end
+  class C
+    define_method2(:m) {|x, y| :fail }
+  end
+  begin
+    C.new.m([1,2])
+  rescue ArgumentError
+    :ok
+  end
+}
+
+assert_not_match /method_missing/, %q{
+  STDERR.reopen(STDOUT)
+  variable_or_mehtod_not_exist
+}
+
+assert_equal '[false, false, false, false, true, true]', %q{
+  class C
+    define_method(:foo) {
+      block_given?
+    }
+  end
+
+  C.new.foo {}
+
+  class D
+    def foo
+      D.module_eval{
+        define_method(:m1){
+          block_given?
+        }
+      }
+    end
+    def bar
+      D.module_eval{
+        define_method(:m2){
+          block_given?
+        }
+      }
+    end
+  end
+
+  D.new.foo
+  D.new.bar{}
+  [C.new.foo, C.new.foo{}, D.new.m1, D.new.m1{}, D.new.m2, D.new.m2{}]
+}, '[ruby-core:14813]'
+
+assert_equal 'ok', %q{
+  class Foo
+    define_method(:foo) do |&b|
+      b.call
+    end
+  end
+  Foo.new.foo do
+    break :ok
+  end
+}, '[ruby-dev:36028]'
+
+assert_equal '[1, 2, [3, 4]]', %q{
+  def regular(a, b, *c)
+    [a, b, c]
+  end
+  regular(*[], 1, *[], *[2, 3], *[], 4)
+}, '[ruby-core:19413]'
+
+assert_equal '[1, [:foo, 3, 4, :foo]]', %q{
+  def regular(a, *b)
+    [a, b]
+  end
+  a = b = [:foo]
+  regular(1, *a, *[3, 4], *b)
+}
+
+assert_equal '["B", "A"]', %q{
+  class A
+    def m
+      'A'
+    end
+  end
+
+  class B < A
+    define_method(:m) do
+      ['B', super()]
+    end
+  end
+
+  class C < B
+  end
+
+  C.new.m
+}
+
+assert_equal 'ok', %q{
+  module Foo
+    def foo
+      begin
+        super
+      rescue NoMethodError
+        :ok
+      end
+    end
+    module_function :foo
+  end
+  Foo.foo
+}, '[ruby-dev:37587]'
+
+assert_equal 'Object#foo', %q{
+  class Object
+    def self.foo
+      "Object.foo"
+    end
+    def foo
+      "Object#foo"
+    end
+  end
+
+  module Foo
+    def foo
+      begin
+        super
+      rescue NoMethodError
+        :ok
+      end
+    end
+    module_function :foo
+  end
+  Foo.foo
+}, '[ruby-dev:37587]'
+
+assert_normal_exit %q{
+  class BasicObject
+    remove_method :method_missing
+  end
+  begin
+    "a".lalala!
+  rescue NoMethodError => e
+    e.message == "undefined method `lalala!' for \"a\":String" ? :ok : :ng
+  end
+}, '[ruby-core:22298]'
+
+assert_equal 'ok', %q{
+  "hello"[0] ||= "H"
+  "ok"
+}
+
+assert_equal 'ok', %q{
+  "hello"[0, 1] ||= "H"
+  "ok"
+}
+
+assert_equal 'ok', %q{
+  class C
+    define_method(:foo) do
+      C.class_eval { remove_method(:foo) }
+      super()
+    end
+  end
+  begin
+    C.new.foo
+  rescue NoMethodError
+    'ok'
+  end
+}
+
+# should not cache when splat
+assert_equal 'ok', %q{
+  class C
+    attr_reader :a
+    def initialize
+      @a = 1
+    end
+  end
+
+  def m *args
+    C.new.a(*args)
+  end
+
+  m()
+  begin
+    m(1)
+  rescue ArgumentError
+    'ok'
+  end
+}
+
+assert_equal 'DC', %q{
+  $result = []
+
+  class C
+    def foo *args
+      $result << 'C'
+    end
+  end
+  class D
+    def foo *args
+      $result << 'D'
+    end
+  end
+
+  o1 = $o1 = C.new
+  o2 = $o2 = D.new
+
+  args = Object.new
+  def args.to_a
+    test1 $o2, nil
+    []
+  end
+  def test1 o, args
+    o.foo(*args)
+  end
+  test1 o1, args
+  $result.join
+}
+
+assert_equal 'DC', %q{
+  $result = []
+
+  class C
+    def foo *args
+      $result << 'C'
+    end
+  end
+  class D
+    def foo *args
+      $result << 'D'
+    end
+  end
+
+  o1 = $o1 = C.new
+  o2 = $o2 = D.new
+
+  block = Object.new
+  def block.to_proc
+    test2 $o2, %w(a, b, c), nil
+    Proc.new{}
+  end
+  def test2 o, args, block
+    o.foo(*args, &block)
+  end
+  test2 o1, [], block
+  $result.join
+}
+
+assert_equal 'ok', %q{
+  def foo
+    binding
+    ["ok"].first
+  end
+  foo
+  foo
+}, '[Bug #20178]'
+
+assert_equal 'ok', %q{
+  def bar(x); x; end
+  def foo(...); bar(...); end
+  foo('ok')
+}
+
+assert_equal 'ok', %q{
+  def bar(x); x; end
+  def foo(z, ...); bar(...); end
+  foo(1, 'ok')
+}
+
+assert_equal 'ok', %q{
+  def bar(x, y); x; end
+  def foo(...); bar("ok", ...); end
+  foo(1)
+}
+
+assert_equal 'ok', %q{
+  def bar(x); x; end
+  def foo(...); 1.times { return bar(...) }; end
+  foo("ok")
+}
+
+assert_equal 'ok', %q{
+  def bar(x); x; end
+  def foo(...); x = nil; 1.times { x = bar(...) }; x; end
+  foo("ok")
+}
+
+assert_equal 'ok', %q{
+  def bar(x); yield; end
+  def foo(...); bar(...); end
+  foo(1) { "ok" }
+}
+
+assert_equal 'ok', %q{
+  def baz(x); x; end
+  def bar(...); baz(...); end
+  def foo(...); bar(...); end
+  foo("ok")
+}
+
+assert_equal '[1, 2, 3, 4]', %q{
+  def baz(a, b, c, d); [a, b, c, d]; end
+  def bar(...); baz(1, ...); end
+  def foo(...); bar(2, ...); end
+  foo(3, 4)
+}
+
+assert_equal 'ok', %q{
+  class Foo; def self.foo(x); x; end; end
+  class Bar < Foo; def self.foo(...); super; end; end
+  Bar.foo('ok')
+}
+
+assert_equal 'ok', %q{
+  class Foo; def self.foo(x); x; end; end
+  class Bar < Foo; def self.foo(...); super(...); end; end
+  Bar.foo('ok')
+}
+
+assert_equal 'ok', %q{
+  class Foo; def self.foo(x, y); x + y; end; end
+  class Bar < Foo; def self.foo(...); super("o", ...); end; end
+  Bar.foo('k')
+}
+
+assert_equal 'ok', %q{
+  def bar(a); a; end
+  def foo(...); lambda { bar(...) }; end
+  foo("ok").call
+}
+
+assert_equal 'ok', %q{
+  class Foo; def self.foo(x, y); x + y; end; end
+  class Bar < Foo; def self.y(&b); b; end; def self.foo(...); y { super("o", ...) }; end; end
+  Bar.foo('k').call
+}
+
+assert_equal 'ok', %q{
+  def baz(n); n; end
+  def foo(...); bar = baz(...); lambda { lambda { bar } }; end
+  foo("ok").call.call
+}
+
+assert_equal 'ok', %q{
+  class A; def self.foo(...); new(...); end; attr_reader :b; def initialize(a, b:"ng"); @a = a; @b = b; end end
+  A.foo(1).b
+  A.foo(1, b: "ok").b
+}
+
+assert_equal 'ok', %q{
+  class A; def initialize; @a = ["ok"]; end; def first(...); @a.first(...); end; end
+  def call x; x.first; end
+  def call1 x; x.first(1); end
+  call(A.new)
+  call1(A.new).first
+}
+
+assert_equal 'ok', %q{
+  class A; def foo; yield("o"); end; end
+  class B < A; def foo(...); super { |x| yield(x + "k") }; end; end
+  B.new.foo { |x| x }
+}
+
+assert_equal "[1, 2, 3, 4]", %q{
+  def foo(*b) = b
+
+  def forward(...)
+    splat = [1,2,3]
+    foo(*splat, ...)
+  end
+
+  forward(4)
+}
+
+assert_equal "[1, 2, 3, 4]", %q{
+class A
+  def foo(*b) = b
+end
+
+class B < A
+  def foo(...)
+    splat = [1,2,3]
+    super(*splat, ...)
+  end
+end
+
+B.new.foo(4)
+}
+
+assert_equal 'ok', %q{
+  class A; attr_reader :iv; def initialize(...) = @iv = "ok"; end
+  A.new("foo", bar: []).iv
+}
+
+assert_equal 'ok', %q{
+  def foo(a, b) = a + b
+  def bar(...) = foo(...)
+  bar(1, 2)
+  bar(1, 2)
+  begin
+    bar(1, 2, 3)
+    "ng"
+  rescue ArgumentError
+    "ok"
+  end
+}
+
+assert_equal 'ok', %q{
+  class C
+    def foo(...) = :ok
+    def bar(...) = __send__(:foo, ...)
+  end
+
+  C.new.bar
+}
+
+assert_equal 'ok', %q{
+  class C
+    def method_missing(...) = :ok
+    def foo(...) = xyzzy(...)
+  end
+
+  C.new.foo
+}
+
+assert_equal 'ok', %q{
+  class C
+    def initialize(a)
+    end
+  end
+
+  def foo(...)
+    C.new(...)
+    :ok
+  end
+
+  foo(*["bar"])
+  foo("baz")
+}
+
+assert_equal 'ok', %q{
+  class C
+    def foo(b:)
+      b
+    end
+  end
+
+  def foo(...)
+    C.new.send(...)
+  end
+
+  foo(:foo, b: :ok)
+  foo(*["foo"], b: :ok)
+}
+
+assert_equal 'ok', %q{
+  Thing = Struct.new(:value)
+
+  Obj = Thing.new("ok")
+
+  def delegate(...)
+    Obj.value(...)
+  end
+
+  def no_args
+    delegate
+  end
+
+  def splat_args(*args)
+    delegate(*args)
+  end
+
+  no_args
+  splat_args
+}
+
+assert_equal 'ok', %q{
+  class A
+    private
+    def foo = "ng"
+  end
+
+  class B
+    def initialize(o)
+      @o = o
+    end
+
+    def foo(...) = @o.foo(...)
+    def internal_foo = foo
+  end
+
+  b = B.new(A.new)
+
+  begin
+    b.internal_foo
+  rescue NoMethodError
+    "ok"
+  end
+}
+
+assert_equal 'ok', <<~RUBY
+  def test(*, kw: false)
+    "ok"
+  end
+
+  test
+RUBY
+
+assert_equal '[1, 2, 3]', %q{
+  def target(*args) = args
+  def x = [1]
+  def forwarder(...) = target(*x, 2, ...)
+  forwarder(3).inspect
+}, '[Bug #21832] post-splat args before forwarding'
+
+assert_equal '[nil, nil]', %q{
+  def self_reading(a = a, kw:) = a
+  def through_binding(a = binding.local_variable_get(:a), kw:) = a
+  [self_reading(kw: 1), through_binding(kw: 1)]
+}, 'nil initialization of optional parameters'
diff --git a/bootstraptest/test_objectspace.rb b/bootstraptest/test_objectspace.rb
new file mode 100644
index 0000000000..63a8d99322
--- /dev/null
+++ b/bootstraptest/test_objectspace.rb
@@ -0,0 +1,55 @@
+assert_normal_exit %q{
+  eval("", TOPLEVEL_BINDING)
+  minobj = ObjectSpace.to_enum(:each_object).min_by {|a| a.object_id }
+  maxobj = ObjectSpace.to_enum(:each_object).max_by {|a| a.object_id }
+  (((minobj.object_id-100)..(minobj.object_id+100))+
+   ((maxobj.object_id-100)..(maxobj.object_id+100))).each {|id|
+    begin
+      o = ObjectSpace._id2ref(id)
+    rescue RangeError
+      next
+    end
+    o.inspect if defined?(o.inspect)
+  }
+}, '[ruby-dev:31911]'
+
+assert_normal_exit %q{
+  ary = (1..10).to_a
+  ary.permutation(2) {|x|
+    if x == [1,2]
+      ObjectSpace.each_object(String) {|s|
+        s.clear if !s.frozen? && (s.length == 40 || s.length == 80)
+      }
+    end
+  }
+}, '[ruby-dev:31982]'
+
+assert_normal_exit %q{
+  ary = (1..100).to_a
+  ary.permutation(2) {|x|
+    if x == [1,2]
+      ObjectSpace.each_object(Array) {|o| o.clear if o == ary && o.object_id != ary.object_id }
+    end
+  }
+}, '[ruby-dev:31985]'
+
+assert_normal_exit %q{
+  ObjectSpace.define_finalizer("") do
+    Thread::Mutex.new.lock
+  end
+}, '[ruby-dev:44049]'
+
+assert_normal_exit %q{
+  ObjectSpace.define_finalizer("") do
+    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
new file mode 100644
index 0000000000..637603243d
--- /dev/null
+++ b/bootstraptest/test_proc.rb
@@ -0,0 +1,470 @@
+assert_equal %q{[1, 2, 3]}, %q{
+  def getproc &b
+    b
+  end
+
+  def m
+    yield
+  end
+
+  m{
+    i = 1
+    m{
+      j = 2
+      m{
+        k = 3
+        getproc{
+          [i, j, k]
+        }
+      }
+    }
+  }.call
+}
+assert_equal %q{7}, %q{
+  def make_proc(&b)
+    b
+  end
+
+  def make_closure
+    a = 0
+    make_proc{
+      a+=1
+    }
+  end
+
+  cl = make_closure
+  cl.call + cl.call * cl.call
+}
+assert_equal %q{ok}, %q{
+  class C
+    def foo
+      :ok
+    end
+  end
+
+  def block
+    C.method(:new).to_proc
+  end
+  b = block()
+  b.call.foo
+}
+assert_equal %q{[0, 1, :last, 0, 2, :last]}, %q{
+  def proc &b
+    b
+  end
+
+  pr = []
+  proc{|i_b|
+    p3 = proc{|j_b|
+      pr << proc{|k_b|
+        [i_b, j_b, k_b]
+      }
+    }
+    p3.call(1)
+    p3.call(2)
+  }.call(0)
+
+  pr[0].call(:last).concat pr[1].call(:last)
+}
+assert_equal %q{12}, %q{
+  def iter
+    yield
+  end
+
+  def getproc &b
+    b
+  end
+
+  iter{
+    bvar = 3
+    getproc{
+      bvar2 = 4
+      bvar * bvar2
+    }
+  }.call
+}
+assert_equal %q{200}, %q{
+  def iter
+    yield
+  end
+
+  def getproc &b
+    b
+  end
+
+  loc1 = 0
+  pr1 = iter{
+    bl1 = 1
+    getproc{
+      loc1 += 1
+      bl1  += 1
+      loc1 + bl1
+    }
+  }
+
+  pr2 = iter{
+    bl1 = 1
+    getproc{
+      loc1 += 1
+      bl1  += 1
+      loc1 + bl1
+    }
+  }
+
+  pr1.call; pr2.call
+  pr1.call; pr2.call
+  pr1.call; pr2.call
+  (pr1.call + pr2.call) * loc1
+}
+assert_equal %q{[1, 2]}, %q{
+  def proc(&pr)
+    pr
+  end
+
+  def m
+    a = 1
+    m2{
+      a
+    }
+  end
+
+  def m2
+    b = 2
+    proc{
+      [yield, b]
+    }
+  end
+
+  pr = m
+  x = ['a', 1,2,3,4,5,6,7,8,9,0,
+            1,2,3,4,5,6,7,8,9,0,
+            1,2,3,4,5,6,7,8,9,0,
+            1,2,3,4,5,6,7,8,9,0,
+            1,2,3,4,5,6,7,8,9,0,]
+  pr.call
+}
+assert_equal %q{1}, %q{
+  def proc(&pr)
+    pr
+  end
+
+  def m
+    a = 1
+    m2{
+      a
+    }
+  end
+
+  def m2
+    b = 2
+    proc{
+      [yield, b]
+    }
+    100000.times{|x|
+      "#{x}"
+    }
+    yield
+  end
+  m
+}
+assert_equal %q{[:C, :C]}, %q{
+  Const = :top
+  class C
+    Const = :C
+    $pr = proc{
+      (1..2).map{
+        Const
+      }
+    }
+  end
+  $pr.call
+}
+assert_equal %q{top}, %q{
+  Const = :top
+  class C
+    Const = :C
+  end
+  pr = proc{
+    Const
+  }
+  C.class_eval %q{
+    pr.call
+  }
+}
+assert_equal %q{1}, %q{
+  def m(&b)
+    b
+  end
+
+  m{|e_proctest| e_proctest}.call(1)
+}
+assert_equal %q{12}, %q{
+  def m(&b)
+    b
+  end
+
+  m{|e_proctest1, e_proctest2|
+    a = e_proctest1 * e_proctest2 * 2
+    a * 3
+  }.call(1, 2)
+}
+assert_equal %q{[[], [1], [1, 2], [1, 2, 3]]}, %q{
+  [
+  Proc.new{|*args| args}.call(),
+  Proc.new{|*args| args}.call(1),
+  Proc.new{|*args| args}.call(1, 2),
+  Proc.new{|*args| args}.call(1, 2, 3),
+  ]
+}
+assert_equal %q{[[nil, []], [1, []], [1, [2]], [1, [2, 3]]]}, %q{
+  [
+  Proc.new{|a, *b| [a, b]}.call(),
+  Proc.new{|a, *b| [a, b]}.call(1),
+  Proc.new{|a, *b| [a, b]}.call(1, 2),
+  Proc.new{|a, *b| [a, b]}.call(1, 2, 3),
+  ]
+}
+assert_equal %q{1}, %q{
+  def m(&b)
+    b
+  end
+  m{1}.call
+}
+assert_equal %q{3}, %q{
+  def m(&b)
+    b
+  end
+
+  m{
+    a = 1
+    a + 2
+  }.call
+}
+assert_equal %Q{ok\n}, %q{
+  class A; def get_block; proc {puts "ok"} end end
+  block = A.new.get_block
+  GC.start
+  block.call
+}, '[ruby-core:14885]'
+
+assert_equal 'ok', %q{
+  a = lambda {|x, y, &b| b }
+  b = a.curry[1]
+  if b.call(2){} == nil
+    :ng
+  else
+    :ok
+  end
+}, '[ruby-core:15551]'
+
+assert_equal 'ok', %q{
+  lambda {
+    break :ok
+    :ng
+  }.call
+}, '[ruby-dev:34646]'
+
+assert_equal %q{[:bar, :foo]}, %q{
+  def foo
+    klass = Class.new do
+      define_method(:bar) do
+        return :bar
+      end
+    end
+    [klass.new.bar, :foo]
+  end
+  foo
+}, "[ ruby-Bugs-19304 ]"
+
+assert_equal 'ok', %q{
+   $x = :ok
+   def def7(x, y)
+      x[y]
+      $x = :ng
+   end
+   def test_def7
+      def7(lambda {|x| x.call}, Proc.new {return})
+      $x = :ng
+   end
+   test_def7
+   $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+  lambda { a = lambda { return }; $x = :ng; a[]; $x = :ok }.call
+  $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+  lambda { a = lambda { break }; $x = :ng; a[]; $x = :ok }.call
+  $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+  def def8
+    $x = :ng
+    lambda { a = Proc.new { return }; a[]}.call
+    $x = :ok
+  end
+  def8
+  $x
+}, '[ruby-core:17164]'
+
+
+assert_equal 'ok', %q{
+   def def9
+      lambda {|a| $x = :ok; a[]; $x = :ng }.call(Proc.new { return })
+      $x = :ng
+   end
+   def9
+   $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+   def def10
+     $x = :ng
+     lambda { 1.times { return } }.call
+     $x = :ok
+   end
+   $x = :ok
+   def10
+   $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+   def def11
+      yield
+   end
+   begin
+      lambda { def11 { return } }.call
+   rescue LocalJumpError
+      :ng
+   else
+      :ok
+   end
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+   def def12
+      b = Proc.new { $x = :ng; lambda { return }.call; $x = :ok }.call
+   end
+   def12
+   $x
+}, '[ruby-core:17164]'
+
+assert_equal 'ok', %q{
+  def m
+    pr = proc{
+      proc{
+        return :ok
+      }
+    }.call
+    pr.call
+    :ng
+  end
+  m()
+}
+
+assert_equal 'ok', %q{
+  class Foo
+    def call_it(&block)
+      p = Proc.new(&block)
+      p.call
+    end
+  end
+
+  def give_it
+    proc { :ok }
+  end
+
+  f = Foo.new
+  a_proc = give_it
+  f.call_it(&give_it())
+}, '[ruby-core:15711]'
+
+assert_equal 'foo!', %q{
+  class FooProc < Proc
+    def initialize
+      @foo = "foo!"
+    end
+
+    def bar
+      @foo
+    end
+  end
+
+  def bar
+    FooProc.new &lambda{
+      p 1
+    }
+  end
+
+  fp = bar(&lambda{
+    p 2
+  })
+
+  fp.bar
+}, 'Subclass of Proc'
+
+assert_equal 'ok', %q{
+  o = Object.new
+  def o.write(s); end
+  $stderr = o
+  at_exit{
+    print $!.message
+  }
+  raise "ok"
+}
+
+assert_equal 'ok', %q{
+  lambda do
+    class A
+      class B
+        proc{return :ng}.call
+      end
+    end
+  end.call
+  :ok
+}
+
+assert_equal 'ok', %q{
+  $proc = proc{return}
+  begin
+    lambda do
+      class A
+        class B
+          $proc.call
+        end
+      end
+    end.call
+    :ng
+  rescue LocalJumpError
+    :ok
+  end
+}
+
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  b = x{|a| a }
+  b.eval('yield("ok")')
+}, '[Bug #5634]'
+
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  eval("x { 'ok' }").eval "yield"
+}, '[Bug #5634]'
+
+assert_equal 'ok', %q{
+  def x
+    binding
+  end
+  def m
+    x{ 'ok' }
+  end
+  eval('yield', m)
+}, '[Bug #5634]'
+
diff --git a/bootstraptest/test_ractor.rb b/bootstraptest/test_ractor.rb
new file mode 100644
index 0000000000..4fe90703fc
--- /dev/null
+++ b/bootstraptest/test_ractor.rb
@@ -0,0 +1,2666 @@
+# 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.join
+  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.join
+  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.value
+}
+
+# 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.value
+}
+
+# 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.value == ['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.value
+}
+
+# Ractor#receive_if can filter the message
+assert_equal '[1, 2, 3]', %q{
+  ports = 3.times.map{Ractor::Port.new}
+
+  r = Ractor.new ports do |ports|
+    ports[0] << 3
+    ports[1] << 1
+    ports[2] << 2
+  end
+  a = []
+  a << ports[1].receive # 1
+  a << ports[2].receive # 2
+  a << ports[0].receive # 3
+  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(&:value)
+}
+
+assert_equal "42", %q{
+  a = 42
+  Ractor.shareable_lambda{ a }.call
+}
+
+# Ractor.shareable_proc 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 = Proc.new { [v1, v2, v3, v4, v5] }
+  Ractor.shareable_proc(&closure).call
+}
+
+# Ractor.shareable_proc makes a copy of given Proc
+assert_equal '[true, true]', %q{
+  pr1 = Proc.new do
+    self
+  end
+  pr2 = Ractor.shareable_proc(&pr1)
+
+  [pr1.call == self, pr2.call == nil]
+}
+
+# Ractor.shareable_proc keeps the original Proc intact
+assert_equal '[SyntaxError, [Object, 43, 43], Binding]', %q{
+  a = 42
+  pr1 = Proc.new do
+    [self.class, eval("a"), binding.local_variable_get(:a)]
+  end
+  a += 1
+  pr2 = Ractor.shareable_proc(&pr1)
+
+  r = []
+  begin
+    pr2.call
+  rescue SyntaxError
+    r << SyntaxError
+  end
+
+  r << pr1.call << pr1.binding.class
+}
+
+# Ractor.make_shareable mutates the original Proc
+# This is the current behavior, it's currently considered safe enough
+# because in most cases it would raise anyway due to not-shared self or not-shared captured variable value
+assert_equal '[[42, 42], Binding, true, SyntaxError, "Can\'t create Binding from isolated Proc"]', %q{
+  a = 42
+  pr1 = nil.instance_exec do
+    Proc.new do
+      [eval("a"), binding.local_variable_get(:a)]
+    end
+  end
+
+  r = [pr1.call, pr1.binding.class]
+
+  pr2 = Ractor.make_shareable(pr1)
+  r << pr1.equal?(pr2)
+
+  begin
+    pr1.call
+  rescue SyntaxError
+    r << SyntaxError
+  end
+
+  begin
+    r << pr1.binding
+  rescue ArgumentError
+    r << $!.message
+  end
+
+  r
+}
+
+# Ractor::IsolationError cases
+assert_equal '3', %q{
+  ok = 0
+
+  begin
+    a = 1
+    Ractor.shareable_proc{a}
+    a = 2
+  rescue Ractor::IsolationError => e
+    ok += 1
+  end
+
+  begin
+    cond = false
+    b = 1
+    b = 2 if cond
+    Ractor.shareable_proc{b}
+  rescue Ractor::IsolationError => e
+    ok += 1
+  end
+
+  begin
+    1.times{|i|
+      i = 2
+      Ractor.shareable_proc{i}
+    }
+  rescue Ractor::IsolationError => e
+    ok += 1
+  end
+}
+
+###
+###
+# Ractor still has several memory corruption so skip huge number of tests
+if ENV['GITHUB_WORKFLOW'] == 'Compilations'
+   # ignore the follow
+else
+
+# Ractor.select with a Ractor argument
+assert_equal 'ok', %q{
+  # select 1
+  r1 = Ractor.new{'r1'}
+  port, obj = Ractor.select(r1)
+  if port == r1 and obj == 'r1'
+    'ok'
+  else
+    # failed
+    [port, obj].inspect
+  end
+}
+
+# Ractor.select from two ractors.
+assert_equal '["r1", "r2"]', %q{
+  # select 2
+  p1 = Ractor::Port.new
+  p2 = Ractor::Port.new
+  r1 = Ractor.new(p1){|p1| p1 << 'r1'}
+  r2 = Ractor.new(p2){|p2| p2 << 'r2'}
+  ps = [p1, p2]
+  as = []
+  port, obj = Ractor.select(*ps)
+  ps.delete(port)
+  as << obj
+  port, obj = Ractor.select(*ps)
+  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.key?('TRAVIS') && ENV['TRAVIS_CPU_ARCH'] == 'arm64') # https://bugs.ruby-lang.org/issues/17878
+
+# Exception for empty select
+assert_match /specify at least one Ractor::Port or Ractor/, %q{
+  begin
+    Ractor.select
+  rescue ArgumentError => e
+    e.message
+  end
+}
+
+# Raise Ractor::ClosedError when try to send into a terminated ractor
+assert_equal 'ok', %q{
+  r = Ractor.new do
+  end
+
+  r.join # closed
+  sleep 0.1 until r.inspect =~ /terminated/
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Can mix with Thread#interrupt and Ractor#join [Bug #17366]
+assert_equal 'err', %q{
+  Ractor.new do
+    t = Thread.current
+    begin
+      Thread.new{ t.raise "err" }.join
+    rescue => e
+      e.message
+    end
+  end.value
+}
+
+# Killed Ractor's thread yields nil
+assert_equal 'nil', %q{
+  Ractor.new{
+    t = Thread.current
+    Thread.new{ t.kill }.join
+  }.value.inspect #=> nil
+}
+
+# Raise Ractor::ClosedError when try to send into a ractor with closed default port
+assert_equal 'ok', %q{
+  r = Ractor.new {
+    Ractor.current.close
+    Ractor.main << :ok
+    Ractor.receive
+  }
+
+  Ractor.receive # wait for ok
+
+  begin
+    r.send(1)
+  rescue Ractor::ClosedError
+    'ok'
+  else
+    'ng'
+  end
+}
+
+# Ractor.main returns main ractor
+assert_equal 'true', %q{
+  Ractor.new{
+    Ractor.main
+  }.value == Ractor.current
+}
+
+# a ractor with closed outgoing port should terminate
+assert_equal 'ok', %q{
+  Ractor.new do
+    Ractor.current.close
+  end
+
+  true until Ractor.count == 1
+  :ok
+}
+
+# an exception in a Ractor main thread 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.join
+  rescue Ractor::RemoteError => e
+    [e.cause.class,   #=> RuntimeError
+     e.cause.message, #=> 'ok'
+     e.ractor == r]   #=> true
+  end
+}
+
+# an exception in a Ractor will be re-raised at Ractor#value
+assert_equal '[RuntimeError, "ok", true]', %q{
+  r = Ractor.new do
+    raise 'ok' # exception will be transferred receiver
+  end
+  begin
+    r.value
+  rescue Ractor::RemoteError => e
+    [e.cause.class,   #=> RuntimeError
+     e.cause.message, #=> 'ok'
+     e.ractor == r]   #=> true
+  end
+}
+
+# an exception in a Ractor non-main thread will not be re-raised at Ractor#receive
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Thread.new do
+      raise 'ng'
+    end
+    sleep 0.1
+    'ok'
+  end
+  r.value
+}
+
+# SystemExit from a Ractor is re-raised
+# [Bug #21505]
+assert_equal '[SystemExit, "exit", true]', %q{
+  r = Ractor.new { exit }
+  begin
+    r.value
+  rescue Ractor::RemoteError => e
+    [e.cause.class,   #=> RuntimeError
+     e.cause.message, #=> 'ok'
+     e.ractor == r]   #=> true
+  end
+}
+
+# SystemExit from a Thread inside a Ractor is re-raised
+# [Bug #21505]
+assert_equal '[SystemExit, "exit", true]', %q{
+  r = Ractor.new { Thread.new { exit }.join }
+  begin
+    r.value
+  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
+} unless yjit_enabled? # YJIT: `[BUG] Bus Error at 0x000000010b7002d0` in jit_exec()
+
+# 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.value
+}
+
+# To copy the object, now Marshal#dump is used
+assert_match /can't clone unshareable instance of Thread/, %q{
+  obj = Thread.new{}
+  begin
+    r = Ractor.new obj do |msg|
+      msg
+    end
+  rescue Ractor::Error => e
+    e.message
+  else
+    'ng'
+  end
+}
+
+# send shareable and unshareable objects
+assert_equal "ok", <<~'RUBY', frozen_string_literal: false
+  port = Ractor::Port.new
+  echo_ractor = Ractor.new port do |port|
+    loop do
+      v = Ractor.receive
+      port << 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 = port.receive
+    results << "#{o} is copied" unless o.object_id == o2.object_id
+  }
+
+  unshareable_objects.map{|o|
+    echo_ractor << o
+    o2 = port.receive
+    results << "#{o.inspect} is not copied" if o.object_id == o2.object_id
+  }
+
+  if results.empty?
+    :ok
+  else
+    results.inspect
+  end
+RUBY
+
+# frozen Objects are shareable
+assert_equal [false, true, false].inspect, <<~'RUBY', frozen_string_literal: false
+  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.value
+
+    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
+RUBY
+
+# move example2: String
+# touching moved object causes an error
+assert_equal 'hello world', <<~'RUBY', frozen_string_literal: false
+  # move
+  r = Ractor.new do
+    obj = Ractor.receive
+    obj << ' world'
+  end
+
+  str = 'hello'
+  r.send str, move: true
+  modified = r.value
+
+  begin
+    str << ' exception' # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    modified #=> 'hello world'
+  else
+    raise 'unreachable'
+  end
+RUBY
+
+# 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.value
+  begin
+    a1 << 2 # raise Ractor::MovedError
+  rescue Ractor::MovedError
+    a2.inspect
+  end
+}
+
+# unshareable frozen objects should still be frozen in new ractor after move
+assert_equal 'true', %q{
+  r = Ractor.new do
+    obj = receive
+    { frozen: obj.frozen? }
+  end
+  obj = [Object.new].freeze
+  r.send(obj, move: true)
+  r.value[:frozen]
+}
+
+# Access to global-variables are prohibited (read)
+assert_equal 'can not access global variable $gv from non-main Ractor', %q{
+  $gv = 1
+  r = Ractor.new do
+    $gv
+  end
+
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Access to global-variables are prohibited (write)
+assert_equal 'can not access global variable $gv from non-main Ractor', %q{
+  r = Ractor.new do
+    $gv = 1
+  end
+
+  begin
+    r.join
+  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.value){|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.value
+}
+
+# $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.value
+  ractor_local_globals == h #=> true
+}
+
+# selfs are different objects
+assert_equal 'false', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  ret = r.value
+  ret == self.object_id
+}
+
+# self is a Ractor instance
+assert_equal 'true', %q{
+  r = Ractor.new do
+    self.object_id
+  end
+  ret = r.value
+  if r.object_id == ret #=> true
+    true
+  else
+    raise [ret, r.object_id].inspect
+  end
+}
+
+# given block Proc will be isolated, so can not access outer variables.
+assert_equal 'Ractor::IsolationError', %q{
+  begin
+    a = true
+    r = Ractor.new do
+      a
+    end
+  rescue => e
+    e.class
+  end
+}
+
+# eval with outer locals in a Ractor raises SyntaxError
+# [Bug #21522]
+assert_equal 'SyntaxError', %q{
+  outer = 42
+  r = Ractor.new do
+    eval("outer")
+  end
+  begin
+    r.value
+  rescue Ractor::RemoteError => e
+    e.cause.class
+  end
+}
+
+# eval of an undefined name in a Ractor raises NameError
+assert_equal 'NameError', %q{
+  r = Ractor.new do
+    eval("totally_undefined_name")
+  end
+  begin
+    r.value
+  rescue Ractor::RemoteError => e
+    e.cause.class
+  end
+}
+
+# eval of a local defined inside the Ractor works
+assert_equal '99', %q{
+  Ractor.new { inner = 99; eval("inner").to_s }.value
+}
+
+# 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 (@iv from C)", <<~'RUBY', frozen_string_literal: false
+  class C
+    @iv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @iv
+    end
+  end
+
+  begin
+    r.value
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+RUBY
+
+# 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.value
+  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.value
+  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.value
+  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.value.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 }.value
+  b = Ractor.new do
+    C.str.to_i
+  rescue Ractor::IsolationError
+    10
+  end.value
+  c = Ractor.new do
+    C.fstr.to_i
+  end.value
+
+  d = Ractor.new{ M.int }.value
+  e = Ractor.new do
+    M.str.to_i
+  rescue Ractor::IsolationError
+    20
+  end.value
+  f = Ractor.new do
+    M.fstr.to_i
+  end.value
+
+
+  # 1 + 10 + 100 + 2 + 20 + 200
+  a + b + c + d + e + f
+}
+
+assert_equal '["instance-variable", "instance-variable", nil]', %q{
+  class C
+    @iv1 = ""
+    @iv2 = 42
+    def self.iv1 = defined?(@iv1) # "instance-variable"
+    def self.iv2 = defined?(@iv2) # "instance-variable"
+    def self.iv3 = defined?(@iv3) # nil
+  end
+
+  Ractor.new{
+    [C.iv1, C.iv2, C.iv3]
+  }.value
+}
+
+# moved objects have their shape properly set to original object's shape
+assert_equal '1234', %q{
+  class Obj
+    attr_accessor :a, :b, :c, :d
+    def initialize
+      @a = 1
+      @b = 2
+      @c = 3
+    end
+  end
+  r = Ractor.new do
+    obj = receive
+    obj.d = 4
+    [obj.a, obj.b, obj.c, obj.d]
+  end
+  obj = Obj.new
+  r.send(obj, move: true)
+  values = r.value
+  values.join
+}
+
+# Reading non-shareable cvar from non-main Ractor is not allowed
+assert_equal 'can not read non-shareable class variable @@cv from non-main Ractors (C)', %q{
+  class C
+    @@cv = 'str'
+  end
+
+  r = Ractor.new do
+    class C
+      p @@cv
+    end
+  end
+
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# also cached non-shareable cvar read from non-main Ractor is not allowed
+assert_equal 'can not read non-shareable class variable @@cv from non-main Ractors (C)', %q{
+  class C
+    @@cv = 'str'
+    def self.cv
+      @@cv
+    end
+  end
+
+  C.cv # cache
+
+  r = Ractor.new do
+    C.cv
+  end
+
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Reading shareable cvar from non-main Ractor is allowed
+assert_equal 'shareable', %q{
+  class C
+    @@cv = 'shareable'.freeze
+    def self.cv
+      @@cv
+    end
+  end
+
+  Ractor.new { C.cv }.value
+}
+
+# Reading shareable cvar (integer) from non-main Ractor is allowed
+assert_equal '42', %q{
+  class C
+    @@cv = 42
+    def self.cv
+      @@cv
+    end
+  end
+
+  Ractor.new { C.cv }.value.to_s
+}
+
+# Reading shareable cvar via module include from non-main Ractor is allowed
+assert_equal 'hello', %q{
+  module M
+    @@cv = 'hello'.freeze
+    def self.cv
+      @@cv
+    end
+  end
+
+  class C
+    include M
+    def self.cv
+      @@cv
+    end
+  end
+
+  Ractor.new { C.cv }.value
+}
+
+# Writing cvar from non-main Ractor is not allowed
+assert_equal 'can not set class variables from non-main Ractors (@@cv from C)', %q{
+  class C
+    @@cv = 'str'
+    def self.cv=(v)
+      @@cv = v
+    end
+  end
+
+  r = Ractor.new do
+    C.cv = 'new'
+  end
+
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+# Reading cvar that was made shareable after initial assignment
+assert_equal 'made shareable', %q{
+  class C
+    @@cv = +'made shareable'
+    Ractor.make_shareable(@@cv)
+    def self.cv
+      @@cv
+    end
+  end
+
+  Ractor.new { C.cv }.value
+}
+
+# cvar_defined? works from non-main Ractor
+assert_equal 'true', %q{
+  class C
+    @@cv = 42
+    def self.cv?
+      defined?(@@cv)
+    end
+  end
+
+  r = Ractor.new { C.cv? ? 'true' : 'false' }
+  r.value
+}
+
+# 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.', <<~'RUBY', frozen_string_literal: false
+  class C
+    CONST = 'str'
+  end
+  r = Ractor.new do
+    C::CONST
+  end
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+  RUBY
+
+# Constant cache should care about non-shareable constants
+assert_equal "can not access non-shareable objects in constant Object::STR by non-main Ractor.", <<~'RUBY', frozen_string_literal: false
+  STR = "hello"
+  def str; STR; end
+  s = str() # fill const cache
+  begin
+    Ractor.new{ str() }.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+RUBY
+
+# The correct constant path shall be reported
+assert_equal "can not access non-shareable objects in constant Object::STR by non-main Ractor.", <<~'RUBY', frozen_string_literal: false
+  STR = "hello"
+  module M
+    def self.str; STR; end
+  end
+
+  begin
+    Ractor.new{ M.str }.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+RUBY
+
+# 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', <<~'RUBY', frozen_string_literal: false
+  class C
+  end
+  r = Ractor.new do
+    C::CONST = 'str'
+  end
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+RUBY
+
+# 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)}.join
+  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] }.value
+}
+
+# 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').join
+  sleep 0.1 until ractors[0].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[1].send('End 1').join
+  sleep 0.1 until ractors[1].inspect =~ /terminated/
+  counts << Ractor.count
+
+  ractors[2].send('End 2').join
+  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
+  }.value
+}
+
+# ObjectSpace._id2ref can not handle unshareable objects with Ractors
+assert_equal 'ok', <<~'RUBY', frozen_string_literal: false
+  s = 'hello'
+
+  Ractor.new s.object_id do |id ;s|
+    begin
+      s = ObjectSpace._id2ref(id)
+    rescue => e
+      :ok
+    end
+  end.value
+RUBY
+
+# Inserting into the id2ref table should be Ractor-safe
+assert_equal 'ok', <<~'RUBY'
+  # Force all calls to Kernel#object_id to insert into the id2ref table
+  obj = Object.new
+  ObjectSpace._id2ref(obj.object_id) rescue nil
+
+  10.times.map do
+    Ractor.new do
+      10_000.times do
+        a = Object.new
+        a.object_id
+      end
+    end
+  end.map(&:value)
+
+  :ok
+RUBY
+
+# Ractor.make_shareable(obj)
+assert_equal 'true', <<~'RUBY', frozen_string_literal: false
+  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)
+RUBY
+
+# 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) requires a shareable receiver
+assert_equal '[:ok, "Proc\'s self is not shareable:"]', %q{
+  pr1 = nil.instance_exec { Proc.new{} }
+  pr2 = Proc.new{}
+
+  [pr1, pr2].map do |pr|
+    begin
+      Ractor.make_shareable(pr)
+    rescue Ractor::Error => e
+      e.message[/^.+?:/]
+    else
+      :ok
+    end
+  end
+}
+
+# Ractor.make_shareable(Method/UnboundMethod)
+assert_equal 'true', %q{
+  # raise because receiver is unshareable
+  begin
+    _m0 = Ractor.make_shareable(self.method(:__id__))
+  rescue => e
+    raise e unless e.message =~ /can not make shareable object/
+  else
+    raise "no error"
+  end
+
+  # Method with shareable receiver
+  M1 = Ractor.make_shareable(Object.method(:__id__))
+
+  # UnboundMethod
+  M2 = Ractor.make_shareable(Object.instance_method(:__id__))
+
+  Ractor.new do
+    Object.__id__ == M1.call && M1.call == M2.bind_call(Object)
+  end.value
+}
+
+# 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.shareable_proc{ a }
+  end
+
+  Ractor.new{ C.new.foo }.value
+}
+
+# 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 '[6, 10]', %q{
+  rs = []
+  TracePoint.new(:line){|tp| rs << tp.lineno if tp.path == __FILE__}.enable do
+    Ractor.new{ # line 5
+      a = 1
+      b = 2
+    }.value
+    c = 3       # line 9
+  end
+  rs
+}
+
+# Ractor deep copies frozen objects (ary)
+assert_equal '[true, false]', %q{
+  Ractor.new([[]].freeze) { |ary|
+    [ary.frozen?, ary.first.frozen? ]
+  }.value
+}
+
+# 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?]
+  }.value
+}
+
+# Can not trap with not isolated Proc on non-main ractor
+assert_equal '[:ok, :ok]', %q{
+  a = []
+  Ractor.new{
+    trap(:INT){p :ok}
+  }.join
+  a << :ok
+
+  begin
+    Ractor.new{
+      s = 'str'
+      trap(:INT){p s}
+    }.join
+  rescue Ractor::RemoteError
+    a << :ok
+  end
+}
+
+# Ractor.select is interruptible
+assert_normal_exit %q{
+  trap(:INT) do
+    exit
+  end
+
+  r = Ractor.new do
+    loop do
+      sleep 1
+    end
+  end
+
+  Thread.new do
+    sleep 0.5
+    Process.kill(:INT, Process.pid)
+  end
+  Ractor.select(r)
+}
+
+# Ractor-local storage
+assert_equal '[nil, "b", "a"]', %q{
+  ans = []
+  Ractor.current[:key] = 'a'
+  r = Ractor.new{
+    Ractor.main << self[:key]
+    self[:key] = 'b'
+    self[:key]
+  }
+  ans << Ractor.receive
+  ans << r.value
+  ans << Ractor.current[:key]
+}
+
+assert_equal '1', %q{
+  N = 1_000
+  Ractor.new{
+    a = []
+    1_000.times.map{|i|
+      Thread.new(i){|i|
+        Thread.pass if i < N
+        a << Ractor.store_if_absent(:i){ i }
+        a << Ractor.current[:i]
+      }
+    }.each(&:join)
+    a.uniq.size
+  }.value
+}
+
+# Ractor-local storage
+assert_equal '2', %q{
+  Ractor.new {
+    fails = 0
+    begin
+      Ractor.main[:key] # cannot get ractor local storage from non-main ractor
+    rescue => e
+      fails += 1 if e.message =~ /Cannot get ractor local/
+    end
+    begin
+      Ractor.main[:key] = 'val'
+    rescue => e
+      fails += 1 if e.message =~ /Cannot set ractor local/
+    end
+    fails
+  }.value
+}
+
+###
+### 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.value}.join
+}
+
+assert_equal "ok", %Q{
+  N = #{N}
+  a, b = 2.times.map{
+    Ractor.new{
+      N.times.map{|i| -(i.to_s)}
+    }
+  }.map{|r| r.value}
+  N.times do |i|
+    unless a[i].equal?(b[i])
+      raise [a[i], b[i]].inspect
+    end
+    unless a[i] == i.to_s
+      raise [i, a[i], b[i]].inspect
+    end
+  end
+  :ok
+}
+
+# Generic fields_tbl
+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.value}.join
+}
+
+# Now NoMethodError is copyable
+assert_equal "NoMethodError", %q{
+  obj = "".freeze # NameError refers the receiver indirectly
+  begin
+    obj.bar
+  rescue => err
+  end
+
+  r = Ractor.new{ Ractor.receive }
+  r << err
+  r.value.class
+}
+
+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{
+  port = Ractor::Port.new
+  workers = (0...8).map do
+    Ractor.new port do |port|
+      loop do
+        10_000.times.map { Object.new }
+        port << Time.now
+        Ractor.receive
+      end
+    end
+  end
+
+  100.times {
+    workers.each do
+      port.receive
+    end
+    workers.each do |w|
+      w.send(nil)
+    end
+  }
+  "ok"
+} if !yjit_enabled? && ENV['GITHUB_WORKFLOW'] != 'ModGC' # flaky
+
+# check method cache invalidation
+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"
+}
+
+# check method cache invalidation
+assert_equal 'true', %q{
+  class C1; def self.foo = 1; end
+  class C2; def self.foo = 2; end
+  class C3; def self.foo = 3; end
+  class C4; def self.foo = 5; end
+  class C5; def self.foo = 7; end
+  class C6; def self.foo = 11; end
+  class C7; def self.foo = 13; end
+  class C8; def self.foo = 17; end
+
+  LN = 10_000
+  RN = 10
+  CS = [C1, C2, C3, C4, C5, C6, C7, C8]
+  rs = RN.times.map{|i|
+    Ractor.new(CS.shuffle){|cs|
+      LN.times.sum{
+        cs.inject(1){|r, c| r * c.foo} # c.foo invalidates method cache entry
+      }
+    }
+  }
+
+  n = CS.inject(1){|r, c| r * c.foo} * LN
+  rs.map{|r| r.value} == Array.new(RN){n}
+}
+
+# check method cache invalidation
+assert_equal 'true', %q{
+  class Foo
+    def hello = nil
+  end
+
+  r1 = Ractor.new do
+    1000.times do
+      class Foo
+        def hello = nil
+      end
+    end
+  end
+
+  r2 = Ractor.new do
+    1000.times do
+      o = Foo.new
+      o.hello
+    end
+  end
+
+  r1.value
+  r2.value
+
+  true
+}
+
+# check experimental warning
+assert_match /\Atest_ractor\.rb:1:\s+warning:\s+Ractor API is experimental/, %q{
+  Warning[:experimental] = $VERBOSE = true
+  STDERR.reopen(STDOUT)
+  eval("Ractor.new{}.value", nil, "test_ractor.rb", 1)
+}, frozen_string_literal: false
+
+# check moved object
+assert_equal 'ok', %q{
+  r = Ractor.new do
+    Ractor.receive
+    GC.start
+    :ok
+  end
+
+  obj = begin
+  raise
+  rescue => e
+    e = Marshal.load(Marshal.dump(e))
+  end
+
+  r.send obj, move: true
+  r.value
+}
+
+## Ractor::Selector
+
+# Selector#empty? returns true
+assert_equal 'true', %q{
+  skip true unless defined? Ractor::Selector
+
+  s = Ractor::Selector.new
+  s.empty?
+}
+
+# Selector#empty? returns false if there is target ractors
+assert_equal 'false', %q{
+  skip false unless defined? Ractor::Selector
+
+  s = Ractor::Selector.new
+  s.add Ractor.new{}
+  s.empty?
+}
+
+# Selector#clear removes all ractors from the waiting list
+assert_equal 'true', %q{
+  skip true unless defined? Ractor::Selector
+
+  s = Ractor::Selector.new
+  s.add Ractor.new{10}
+  s.add Ractor.new{20}
+  s.clear
+  s.empty?
+}
+
+# Selector#wait can wait multiple ractors
+assert_equal '[10, 20, true]', %q{
+  skip [10, 20, true] unless defined? Ractor::Selector
+
+  s = Ractor::Selector.new
+  s.add Ractor.new{10}
+  s.add Ractor.new{20}
+  r, v = s.wait
+  vs = []
+  vs << v
+  r, v = s.wait
+  vs << v
+  [*vs.sort, s.empty?]
+} if defined? Ractor::Selector
+
+# Selector#wait can wait multiple ractors with receiving.
+assert_equal '30', %q{
+  skip 30 unless defined? Ractor::Selector
+
+  RN = 30
+  rs = RN.times.map{
+    Ractor.new{ :v }
+  }
+  s = Ractor::Selector.new(*rs)
+
+  results = []
+  until s.empty?
+    results << s.wait
+
+    # Note that s.wait can raise an exception because other Ractors/Threads
+    # can take from the same ractors in the waiting set.
+    # In this case there is no other takers so `s.wait` doesn't raise an error.
+  end
+
+  results.size
+} if defined? Ractor::Selector
+
+# Selector#wait can support dynamic addition
+assert_equal '600', %q{
+  skip 600 unless defined? Ractor::Selector
+
+  RN = 100
+  s = Ractor::Selector.new
+  port = Ractor::Port.new
+  rs = RN.times.map{
+    Ractor.new{
+      Ractor.main << Ractor.new(port){|port| port << :v3; :v4 }
+      Ractor.main << Ractor.new(port){|port| port << :v5; :v6 }
+      Ractor.yield :v1
+      :v2
+    }
+  }
+
+  rs.each{|r| s.add(r)}
+  h = {v1: 0, v2: 0, v3: 0, v4: 0, v5: 0, v6: 0}
+
+  loop do
+    case s.wait receive: true
+    in :receive, r
+      s.add r
+    in r, v
+      h[v] += 1
+      break if h.all?{|k, v| v == RN}
+    end
+  end
+
+  h.sum{|k, v| v}
+} unless yjit_enabled? # http://ci.rvm.jp/results/trunk-yjit@ruby-sp2-docker/4466770
+
+# Selector should be GCed (free'ed) without trouble
+assert_equal 'ok', %q{
+  skip :ok unless defined? Ractor::Selector
+
+  RN = 30
+  rs = RN.times.map{
+    Ractor.new{ :v }
+  }
+  s = Ractor::Selector.new(*rs)
+  :ok
+}
+
+end # if !ENV['GITHUB_WORKFLOW']
+
+# Chilled strings are not shareable
+assert_equal 'false', %q{
+  Ractor.shareable?("chilled")
+}
+
+# Chilled strings can be made shareable
+assert_equal 'true', %q{
+  shareable = Ractor.make_shareable("chilled")
+  shareable == "chilled" && Ractor.shareable?(shareable)
+}
+
+# require in Ractor
+assert_equal 'true', %q{
+  Module.new do
+    def require feature
+      return Ractor._require(feature) unless Ractor.main?
+      super
+    end
+    Object.prepend self
+    set_temporary_name 'Ractor#require'
+  end
+
+  Ractor.new{
+    begin
+      require 'tempfile'
+      Tempfile.new
+    rescue SystemStackError
+      # prism parser with -O0 build consumes a lot of machine stack
+      Data.define(:fileno).new(1)
+    end
+  }.value.fileno > 0
+}
+
+# require_relative in Ractor
+assert_equal 'true', %q{
+  dummyfile = File.join(__dir__, "dummy#{rand}.rb")
+  return true if File.exist?(dummyfile)
+
+  begin
+    File.write dummyfile, ''
+  rescue Exception
+    # skip on any errors
+    return true
+  end
+
+  begin
+    Ractor.new dummyfile do |f|
+      require_relative File.basename(f)
+    end.value
+  ensure
+    File.unlink dummyfile
+  end
+}
+
+# require_relative in Ractor
+assert_equal 'LoadError', %q{
+  dummyfile = File.join(__dir__, "not_existed_dummy#{rand}.rb")
+  return true if File.exist?(dummyfile)
+
+  Ractor.new dummyfile do |f|
+    begin
+      require_relative File.basename(f)
+    rescue LoadError => e
+      e.class
+    end
+  end.value
+}
+
+# autolaod in Ractor
+assert_equal 'true', %q{
+  autoload :Tempfile, 'tempfile'
+
+  r = Ractor.new do
+    begin
+      Tempfile.new
+    rescue SystemStackError
+      # prism parser with -O0 build consumes a lot of machine stack
+      Data.define(:fileno).new(1)
+    end
+  end
+  r.value.fileno > 0
+}
+
+# failed in autolaod in Ractor
+assert_equal 'LoadError', %q{
+  dummyfile = File.join(__dir__, "not_existed_dummy#{rand}.rb")
+  autoload :Tempfile, dummyfile
+
+  r = Ractor.new do
+    begin
+      Tempfile.new
+    rescue LoadError => e
+      e.class
+    end
+  end
+  r.value
+}
+
+# bind_call in Ractor [Bug #20934]
+assert_equal 'ok', %q{
+  2.times.map do
+    Ractor.new do
+      1000.times do
+        Object.instance_method(:itself).bind_call(self)
+      end
+    end
+  end.each(&:join)
+  GC.start
+  :ok.itself
+}
+
+# moved objects being corrupted if embeded (String)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = "foobarbazfoobarbazfoobarbazfoobarbaz"
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved objects being corrupted if embeded (Array)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved objects being corrupted if embeded (Hash)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = { foo: 1, bar: 2 }
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved objects being corrupted if embeded (MatchData)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = "foo".match(/o/)
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved objects being corrupted if embeded (Struct)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Struct.new(:a, :b, :c, :d, :e, :f).new(1, 2, 3, 4, 5, 6)
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved objects being corrupted if embeded (Object)
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  class SomeObject
+    attr_reader :a, :b, :c, :d, :e, :f
+    def initialize
+      @a = @b = @c = @d = @e = @f = 1
+    end
+
+    def ==(o)
+      @a == o.a &&
+      @b == o.b &&
+      @c == o.c &&
+      @d == o.d &&
+      @e == o.e &&
+      @f == o.f
+    end
+  end
+
+  SomeObject.new # initial non-embeded
+
+  obj = SomeObject.new
+  ractor.send(obj.dup, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj == obj ? :ok : roundtripped_obj
+}
+
+# moved arrays can't be used
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = [1]
+  ractor.send(obj, move: true)
+  begin
+    [].concat(obj)
+  rescue TypeError
+    :ok
+  else
+    :fail
+  end
+}
+
+# moved strings can't be used
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = "hello"
+  ractor.send(obj, move: true)
+  begin
+    "".replace(obj)
+  rescue TypeError
+    :ok
+  else
+    :fail
+  end
+}
+
+# moved hashes can't be used
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = { a: 1 }
+  ractor.send(obj, move: true)
+  begin
+    {}.merge(obj)
+  rescue TypeError
+    :ok
+  else
+    :fail
+  end
+}
+
+# move objects inside frozen containers
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  original = obj.dup
+  ractor.send([obj].freeze, move: true)
+  roundtripped_obj = ractor.value[0]
+  roundtripped_obj == original ? :ok : roundtripped_obj
+}
+
+# move object with generic ivar
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  obj.instance_variable_set(:@array, [1])
+
+  ractor.send(obj, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj.instance_variable_get(:@array) == [1] ? :ok : roundtripped_obj
+}
+
+# move object with many generic ivars
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  0.upto(300) do |i|
+    obj.instance_variable_set(:"@array#{i}", [i])
+  end
+
+  ractor.send(obj, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj.instance_variable_get(:@array1) == [1] ? :ok : roundtripped_obj
+}
+
+# move object with complex generic ivars
+assert_equal 'ok', %q{
+  # Make Array complex
+  30.times { |i| [].instance_variable_set(:"@complex#{i}", 1) }
+
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  obj.instance_variable_set(:@array1, [1])
+
+  ractor.send(obj, move: true)
+  roundtripped_obj = ractor.value
+  roundtripped_obj.instance_variable_get(:@array1) == [1] ? :ok : roundtripped_obj
+}
+
+# move object with generic ivars and existing id2ref table
+# [Bug #21664]
+assert_equal 'ok', %q{
+  obj = [1]
+  obj.instance_variable_set("@field", :ok)
+  ObjectSpace._id2ref(obj.object_id) # build id2ref table
+
+  ractor = Ractor.new { Ractor.receive }
+  ractor.send(obj, move: true)
+  obj = ractor.value
+  obj.instance_variable_get("@field")
+}
+
+# copy object with complex generic ivars
+assert_equal 'ok', %q{
+  # Make Array complex
+  30.times { |i| [].instance_variable_set(:"@complex#{i}", 1) }
+
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  obj.instance_variable_set(:@array1, [1])
+
+  ractor.send(obj)
+  roundtripped_obj = ractor.value
+  roundtripped_obj.instance_variable_get(:@array1) == [1] ? :ok : roundtripped_obj
+}
+
+# copy object with many generic ivars
+assert_equal 'ok', %q{
+  ractor = Ractor.new { Ractor.receive }
+  obj = Array.new(10, 42)
+  0.upto(300) do |i|
+    obj.instance_variable_set(:"@array#{i}", [i])
+  end
+
+  ractor.send(obj)
+  roundtripped_obj = ractor.value
+  roundtripped_obj.instance_variable_get(:@array1) == [1] ? :ok : roundtripped_obj
+}
+
+# moved composite types move their non-shareable parts properly
+assert_equal 'ok', %q{
+  k, v = String.new("key"), String.new("value")
+  h = { k => v }
+  h.instance_variable_set("@b", String.new("b"))
+  a = [k,v]
+  o_singleton = Object.new
+  def o_singleton.a
+    @a
+  end
+  o_singleton.instance_variable_set("@a", String.new("a"))
+  class MyObject
+    attr_reader :a
+    def initialize(a)
+      @a = a
+    end
+  end
+  struct_class = Struct.new(:a)
+  struct = struct_class.new(String.new('a'))
+  o = MyObject.new(String.new('a'))
+  port = Ractor::Port.new
+
+  r = Ractor.new port do |port|
+    loop do
+      obj = Ractor.receive
+      val = case obj
+      when Hash
+        obj['key'] == 'value' && obj.instance_variable_get("@b") == 'b'
+      when Array
+        obj[0] == 'key'
+      when Struct
+        obj.a == 'a'
+      when Object
+        obj.a == 'a'
+      end
+      port << val
+    end
+  end
+
+  objs = [h, a, o_singleton, o, struct]
+  objs.each_with_index do |obj, i|
+    klass = obj.class
+    parts_moved = {}
+    case obj
+    when Hash
+      parts_moved[klass] = [obj['key'], obj.instance_variable_get("@b")]
+    when Array
+      parts_moved[klass] = obj.dup # the contents
+    when Struct, Object
+      parts_moved[klass] = [obj.a]
+    end
+    r.send(obj, move: true)
+    val = port.receive
+    if val != true
+      raise "bad val in ractor for obj at i:#{i}"
+    end
+    begin
+      p obj
+    rescue
+    else
+      raise "should be moved"
+    end
+    parts_moved.each do |klass, parts|
+      parts.each_with_index do |part, j|
+        case part
+        when Ractor::MovedObject
+        else
+          raise "part for class #{klass} at i:#{j} should be moved"
+        end
+      end
+    end
+  end
+  'ok'
+}
+
+# fork after creating Ractor
+assert_equal 'ok', %q{
+begin
+  Ractor.new { Ractor.receive }
+  _, status = Process.waitpid2 fork { }
+  status.success? ? "ok" : status
+rescue NotImplementedError
+  :ok
+end
+}
+
+# Ractors should be terminated after fork
+assert_equal 'ok', %q{
+begin
+  r = Ractor.new { Ractor.receive }
+  _, status = Process.waitpid2 fork {
+    begin
+      raise if r.value != nil
+    end
+  }
+  r.send(123)
+  raise unless r.value == 123
+  status.success? ? "ok" : status
+rescue NotImplementedError
+  :ok
+end
+}
+
+# Ractors should be terminated after fork
+assert_equal 'ok', %q{
+begin
+  r = Ractor.new { Ractor.receive }
+  _, status = Process.waitpid2 fork {
+    begin
+      r.send(123)
+    rescue Ractor::ClosedError
+    end
+  }
+  r.send(123)
+  raise unless r.value == 123
+  status.success? ? "ok" : status
+rescue NotImplementedError
+  :ok
+end
+}
+
+# Creating classes inside of Ractors
+# [Bug #18119]
+assert_equal 'ok', %q{
+  port = Ractor::Port.new
+  workers = (0...8).map do
+    Ractor.new port do |port|
+      loop do
+        100.times.map { Class.new }
+        port << nil
+      end
+    end
+  end
+
+  100.times { port.receive }
+
+  'ok'
+}
+
+# Using Symbol#to_proc inside ractors
+# [Bug #21354]
+assert_equal 'ok', %q{
+  :inspect.to_proc
+  Ractor.new do
+    # It should not use this cached proc, it should create a new one. If it used
+    # the cached proc, we would get a ractor_confirm_belonging error here.
+    :inspect.to_proc
+  end.join
+  'ok'
+}
+
+# take vm lock when deleting generic ivars from the global table
+assert_equal 'ok', %q{
+  Ractor.new do
+    a = [1, 2, 3]
+    a.object_id
+    a.dup # this deletes generic ivar on dupped object
+    'ok'
+  end.value
+}
+
+## Ractor#monitor
+
+# monitor port returns `:exited` when the monitering Ractor terminated.
+assert_equal 'true', %q{
+  r = Ractor.new do
+    Ractor.main << :ok1
+    :ok2
+  end
+
+  r.monitor port = Ractor::Port.new
+  Ractor.receive # :ok1
+  port.receive == :exited
+}
+
+# monitor port returns `:exited` even if the monitoring Ractor was terminated.
+assert_equal 'true', %q{
+  r = Ractor.new do
+    :ok
+  end
+
+  r.join # wait for r's terminateion
+
+  r.monitor port = Ractor::Port.new
+  port.receive == :exited
+}
+
+# monitor returns false if the monitoring Ractor was terminated.
+assert_equal 'false', %q{
+  r = Ractor.new do
+    :ok
+  end
+
+  r.join # wait for r's terminateion
+
+  r.monitor Ractor::Port.new
+}
+
+# monitor port returns `:aborted` when the monitering Ractor is aborted.
+assert_equal 'true', %q{
+  r = Ractor.new do
+    Ractor.main << :ok1
+    raise 'ok'
+  end
+
+  r.monitor port = Ractor::Port.new
+  Ractor.receive # :ok1
+  port.receive == :aborted
+}
+
+# monitor port returns `:aborted` even if the monitoring Ractor was aborted.
+assert_equal 'true', %q{
+  r = Ractor.new do
+    raise 'ok'
+  end
+
+  begin
+    r.join # wait for r's terminateion
+  rescue Ractor::RemoteError
+    # ignore
+  end
+
+  r.monitor port = Ractor::Port.new
+  port.receive == :aborted
+}
+
+## Ractor#join
+
+# Ractor#join returns self when the Ractor is terminated.
+assert_equal 'true', %q{
+  r = Ractor.new do
+    Ractor.receive
+  end
+
+  r << :ok
+  r.join
+  r.inspect in /terminated/
+} if false # TODO
+
+# Ractor#join raises RemoteError when the remote Ractor aborted with an exception
+assert_equal 'err', %q{
+  r = Ractor.new do
+    raise 'err'
+  end
+
+  begin
+    r.join
+  rescue Ractor::RemoteError => e
+    e.cause.message
+  end
+}
+
+## Ractor#value
+
+# Ractor#value returns the last expression even if it is unshareable
+assert_equal 'true', %q{
+  r = Ractor.new do
+    obj = [1, 2]
+    obj << obj.object_id
+  end
+
+  ret = r.value
+  ret == [1, 2, ret.object_id]
+}
+
+# Only one Ractor can call Ractor#value
+assert_equal '[["Only the successor ractor can take a value", 9], ["ok", 2]]', %q{
+  r = Ractor.new do
+    'ok'
+  end
+
+  RN = 10
+
+  rs = RN.times.map do
+    Ractor.new r do |r|
+      begin
+        Ractor.main << r.value
+        Ractor.main << r.value # this ractor can get same result
+      rescue Ractor::Error => e
+        Ractor.main << e.message
+      end
+    end
+  end
+
+  (RN+1).times.map{
+    Ractor.receive
+  }.tally.sort
+}
+
+# Cause lots of inline CC misses.
+assert_equal 'ok', <<~'RUBY'
+  class A; def test; 1 + 1; end; end
+  class B; def test; 1 + 1; end; end
+  class C; def test; 1 + 1; end; end
+  class D; def test; 1 + 1; end; end
+  class E; def test; 1 + 1; end; end
+  class F; def test; 1 + 1; end; end
+  class G; def test; 1 + 1; end; end
+
+  objs = [A.new, B.new, C.new, D.new, E.new, F.new, G.new].freeze
+
+  def call_test(obj)
+    obj.test
+  end
+
+  ractors = 7.times.map do
+    Ractor.new(objs) do |objs|
+      objs = objs.shuffle
+      100_000.times do
+        objs.each do |o|
+          call_test(o)
+        end
+      end
+    end
+  end
+  ractors.each(&:join)
+  :ok
+RUBY
+
+# This test checks that we do not trigger a GC when we have malloc with Ractor
+# locks. We cannot trigger a GC with Ractor locks because GC requires VM lock
+# and Ractor barrier. If another Ractor is waiting on this Ractor lock, then it
+# will deadlock because the other Ractor will never join the barrier.
+#
+# Creating Ractor::Port requires locking the Ractor and inserting into an
+# st_table, which can call malloc.
+assert_equal 'ok', <<~'RUBY'
+  r = Ractor.new do
+    loop do
+      Ractor::Port.new
+    end
+  end
+
+  10.times do
+    10_000.times do
+      r.send(nil)
+    end
+    sleep(0.01)
+  end
+  :ok
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+  begin
+    100.times do |i|
+      Ractor.new(i) do |j|
+        1000.times do |i|
+          "#{j}-#{i}"
+        end
+        Ractor.receive
+      end
+      pid = fork { }
+      _, status = Process.waitpid2 pid
+      raise unless status.success?
+    end
+
+    :ok
+  rescue NotImplementedError
+    :ok
+  end
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+  begin
+    100.times do |i|
+      Ractor.new(i) do |j|
+        1000.times do |i|
+          "#{j}-#{i}"
+        end
+      end
+      pid = fork do
+        GC.verify_internal_consistency
+      end
+      _, status = Process.waitpid2 pid
+      raise unless status.success?
+    end
+
+    :ok
+  rescue NotImplementedError
+    :ok
+  end
+RUBY
+
+# When creating bmethods in Ractors, they should only be usable from their
+# defining ractor, even if it is GC'd
+assert_equal 'ok', <<~'RUBY'
+
+begin
+  CLASSES = 1000.times.map { Class.new }.freeze
+
+  # This would be better to run in parallel, but there's a bug with lambda
+  # creation and YJIT causing crashes in dev mode
+  ractors = CLASSES.map do |klass|
+    Ractor.new(klass) do |klass|
+      Ractor.receive
+      klass.define_method(:foo) {}
+    end
+  end
+
+  ractors.each do |ractor|
+    ractor << nil
+    ractor.join
+  end
+
+  ractors.clear
+  GC.start
+
+  any = 1000.times.map do
+    Ractor.new do
+      CLASSES.any? do |klass|
+        begin
+          klass.new.foo
+          true
+        rescue RuntimeError
+          false
+        end
+      end
+    end
+  end.map(&:value).none? && :ok
+rescue ThreadError => e
+  # ignore limited memory machine
+  if /can\'t create Thread/ =~ e.message
+    :ok
+  else
+    raise
+  end
+end
+RUBY
+
+# Concurrent super calls with keyword arguments must not race on the
+# callinfo kwarg reference count. [Bug #22075]
+assert_equal 'ok', %q{
+  class Base
+    def foo(a:, b:, c:) = a
+  end
+
+  class Sub < Base
+    def foo(a:, b:, c:) = super(a: a, b: b, c: c)
+  end
+
+  4.times.map do
+    Ractor.new do
+      obj = Sub.new
+      100_000.times { obj.foo(a: 1, b: 2, c: 3) }
+    end
+  end.each(&:join)
+
+  :ok
+}
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_struct.rb b/bootstraptest/test_struct.rb
new file mode 100644
index 0000000000..a65964d5f9
--- /dev/null
+++ b/bootstraptest/test_struct.rb
@@ -0,0 +1,5 @@
+assert_equal 'Struct::Foo', %q{
+  Struct.instance_eval { const_set(:Foo, nil) }
+  Struct.new("Foo")
+  Struct::Foo
+}
diff --git a/bootstraptest/test_syntax.rb b/bootstraptest/test_syntax.rb
new file mode 100644
index 0000000000..29bf93cb8f
--- /dev/null
+++ b/bootstraptest/test_syntax.rb
@@ -0,0 +1,938 @@
+assert_equal %q{4}, %q{1 && 2 && 3 && 4}
+assert_equal %q{}, %q{1 && nil && 3 && 4}
+assert_equal %q{}, %q{1 && 2 && 3 && nil}
+assert_equal %q{false}, %q{1 && 2 && 3 && false}
+assert_equal %q{4}, %q{1 and 2 and 3 and 4}
+assert_equal %q{}, %q{1 and nil and 3 and 4}
+assert_equal %q{}, %q{1 and 2 and 3 and nil}
+assert_equal %q{false}, %q{1 and 2 and 3 and false}
+assert_equal %q{}, %q{nil && true}
+assert_equal %q{false}, %q{false && true}
+assert_equal %q{}, %q{
+  case 1
+  when 2
+    :ng
+  end}
+assert_equal %q{ok}, %q{
+  case 1
+  when 10,20,30
+    :ng1
+  when 1,2,3
+    :ok
+  when 100,200,300
+    :ng2
+  else
+    :elseng
+  end}
+assert_equal %q{elseok}, %q{
+  case 123
+  when 10,20,30
+    :ng1
+  when 1,2,3
+    :ng2
+  when 100,200,300
+    :ng3
+  else
+    :elseok
+  end
+}
+assert_equal %q{ok}, %q{
+  case 'test'
+  when /testx/
+    :ng1
+  when /test/
+    :ok
+  when /tetxx/
+    :ng2
+  else
+    :ng_else
+  end
+}
+assert_equal %q{ok}, %q{
+  case Object.new
+  when Object
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  case Object
+  when Object.new
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  case 'test'
+  when 'tes'
+    :ng
+  when 'te'
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  case 'test'
+  when 'tes'
+    :ng
+  when 'te'
+    :ng
+  when 'test'
+    :ok
+  end
+}
+assert_equal %q{ng}, %q{
+  case 'test'
+  when 'tes'
+    :ng
+  when /te/
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  case 'test'
+  when 'tes'
+    :ng
+  when /test/
+    :ok
+  else
+    :ng
+  end
+}
+assert_equal %q{100}, %q{
+  def test(arg)
+    case 1
+    when 2
+      3
+    end
+    return arg
+  end
+
+  test(100)
+}
+assert_equal %q{ok}, %q{
+  ary = [1, 2]
+  case 1
+  when *ary
+    :ok
+  else
+    :ng
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [1, 2]
+  case 3
+  when *ary
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [1, 2]
+  case 1
+  when :x, *ary
+    :ok
+  when :z
+    :ng1
+  else
+    :ng2
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [1, 2]
+  case 3
+  when :x, *ary
+    :ng1
+  when :z
+    :ng2
+  else
+    :ok
+  end
+}
+assert_equal %q{[:false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :false, :false, :false, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :then, :false, :then, :then, :then, :false, :false, :false, :false, :false, :false, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :false, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :false, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :false, :then, :then, :then, :then, :then, :then, :then, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep, :then, :sep]}, %q{
+
+  def make_perm ary, num
+    if num == 1
+      ary.map{|e| [e]}
+    else
+      base = make_perm(ary, num-1)
+      res  = []
+      base.each{|b|
+        ary.each{|e|
+          res << [e] + b
+        }
+      }
+      res
+    end
+  end
+
+  def each_test
+    conds = make_perm(['fv', 'tv'], 3)
+    bangs = make_perm(['', '!'], 3)
+    exprs = make_perm(['and', 'or'], 3)
+    ['if', 'unless'].each{|syn|
+      conds.each{|cs|
+        bangs.each{|bs|
+          exprs.each{|es|
+            yield(syn, cs, bs, es)
+          }
+        }
+      }
+    }
+  end
+
+  fv = false
+  tv = true
+
+  $ans = []
+  each_test{|syn, conds, bangs, exprs|
+    c1, c2, c3 = conds
+    bang1, bang2, bang3 = bangs
+    e1, e2 = exprs
+    eval %Q{
+      #{syn} #{bang1}#{c1} #{e1} #{bang2}#{c2} #{e2} #{bang3}#{c3}
+        $ans << :then
+      else
+        $ans << :false
+      end
+    }
+  }
+
+  each_test{|syn, conds, bangs, exprs|
+    c1, c2, c3 = conds
+    bang1, bang2, bang3 = bangs
+    e1, e2 = exprs
+    eval %Q{
+      #{syn} #{bang1}#{c1} #{e1} #{bang2}#{c2} #{e2} #{bang3}#{c3}
+        $ans << :then
+      end
+      $ans << :sep
+    }
+  }
+  $ans
+}
+assert_equal %q{}, %q{
+  defined?(m)
+}
+assert_equal %q{method}, %q{
+  def m
+  end
+  defined?(m)
+}
+assert_equal %q{}, %q{
+  defined?(a.class)
+}
+assert_equal %q{method}, %q{
+  a = 1
+  defined?(a.class)
+}
+assert_equal %q{["method", "method", "method", "method", nil, nil, "method", "method", "method", nil]}, %q{
+  class C
+    def test
+      [defined?(m1()), defined?(self.m1), defined?(C.new.m1),
+       defined?(m2()), defined?(self.m2), defined?(C.new.m2),
+       defined?(m3()), defined?(self.m3), defined?(C.new.m3)]
+    end
+    def m1
+    end
+    private
+    def m2
+    end
+    protected
+    def m3
+    end
+  end
+  C.new.test + [defined?(C.new.m3)]
+}
+assert_equal %q{[nil, nil, nil, nil, "global-variable", "global-variable", nil, nil]}, %q{
+  $ans = [defined?($1), defined?($2), defined?($3), defined?($4)]
+  /(a)(b)/ =~ 'ab'
+  $ans + [defined?($1), defined?($2), defined?($3), defined?($4)]
+}
+assert_equal %q{nilselftruefalse}, %q{
+  defined?(nil) + defined?(self) +
+    defined?(true) + defined?(false)
+}
+assert_equal %q{}, %q{
+  defined?(@a)
+}
+assert_equal %q{instance-variable}, %q{
+  @a = 1
+  defined?(@a)
+}
+assert_equal %q{}, %q{
+  defined?(@@a)
+}
+assert_equal %q{class variable}, %q{
+  class A
+    @@a = 1
+    defined?(@@a)
+  end
+}
+assert_equal %q{}, %q{
+  defined?($a)
+}
+assert_equal %q{global-variable}, %q{
+  $a = 1
+  defined?($a)
+}
+assert_equal %q{}, %q{
+  defined?(C_definedtest)
+}
+assert_equal %q{constant}, %q{
+  C_definedtest = 1
+  defined?(C_definedtest)
+}
+assert_equal %q{}, %q{
+  defined?(::C_definedtest)
+}
+assert_equal %q{constant}, %q{
+  C_definedtest = 1
+  defined?(::C_definedtest)
+}
+assert_equal %q{}, %q{
+  defined?(C_definedtestA::C_definedtestB::C_definedtestC)
+}
+assert_equal %q{constant}, %q{
+  class C_definedtestA
+    class C_definedtestB
+      C_definedtestC = 1
+    end
+  end
+  defined?(C_definedtestA::C_definedtestB::C_definedtestC)
+}
+assert_equal %q{30}, %q{
+  sum = 0
+  30.times{|ib|
+    if ib % 10 == 0 .. true
+      sum += ib
+    end
+  }
+  sum
+}
+assert_equal %q{63}, %q{
+  sum = 0
+  30.times{|ib|
+    if ib % 10 == 0 ... true
+      sum += ib
+    end
+  }
+  sum
+}
+assert_equal %q{[["NUM", "Type: NUM\n"], ["NUM", "123\n"], ["NUM", "456\n"], ["NUM", "Type: ARP\n"], ["NUM", "aaa\n"], ["NUM", "bbb\n"], ["NUM", "\f\n"], ["ARP", "Type: ARP\n"], ["ARP", "aaa\n"], ["ARP", "bbb\n"]]}, %q{
+  t = nil
+  unless ''.respond_to? :lines
+    class String
+      def lines
+        self
+      end
+    end
+  end
+  ary = []
+"this must not print
+Type: NUM
+123
+456
+Type: ARP
+aaa
+bbb
+\f
+this must not print
+hoge
+Type: ARP
+aaa
+bbb
+".lines.each{|l|
+    if (t = l[/^Type: (.*)/, 1])..(/^\f/ =~ l)
+      ary << [t, l]
+    end
+  }
+  ary
+}
+assert_equal %q{1}, %q{if true  then 1 ; end}
+assert_equal %q{}, %q{if false then 1 ; end}
+assert_equal %q{1}, %q{if true  then 1 ; else; 2; end}
+assert_equal %q{2}, %q{if false then 1 ; else; 2; end}
+assert_equal %q{}, %q{if true  then   ; elsif true then ; 1 ; end}
+assert_equal %q{1}, %q{if false then   ; elsif true then ; 1 ; end}
+assert_equal %q{}, %q{unless true  then 1 ; end}
+assert_equal %q{1}, %q{unless false then 1 ; end}
+assert_equal %q{2}, %q{unless true  then 1 ; else; 2; end}
+assert_equal %q{1}, %q{unless false then 1 ; else; 2; end}
+assert_equal %q{1}, %q{1 if true}
+assert_equal %q{}, %q{1 if false}
+assert_equal %q{}, %q{1 if nil}
+assert_equal %q{}, %q{1 unless true}
+assert_equal %q{1}, %q{1 unless false}
+assert_equal %q{1}, %q{1 unless nil}
+assert_equal %q{1}, %q{1 || 2 || 3 || 4}
+assert_equal %q{1}, %q{1 || false || 3 || 4}
+assert_equal %q{2}, %q{nil || 2 || 3 || 4}
+assert_equal %q{2}, %q{false || 2 || 3 || 4}
+assert_equal %q{false}, %q{nil || false || nil || false}
+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
+  when 1==2, 2==3
+    :ng1
+  when false, 4==5
+    :ok
+  when false
+    :ng2
+  else
+    :elseng
+  end
+}
+assert_equal %q{ok}, %q{
+  case
+  when nil, nil
+    :ng1
+  when 1,2,3
+    :ok
+  when false, false
+    :ng2
+  else
+    :elseng
+  end
+}
+assert_equal %q{elseok}, %q{
+  case
+  when nil
+    :ng1
+  when false
+    :ng2
+  else
+    :elseok
+  end}
+assert_equal %q{}, %q{
+  case
+  when 1
+  end
+}
+assert_equal %q{ok}, %q{
+  r = nil
+  ary = []
+  case
+  when false
+    r = :ng1
+  when false, false
+    r = :ng2
+  when *ary
+    r = :ng3
+  when false, *ary
+    r = :ng4
+  when true, *ary
+    r = :ok
+  end
+  r
+}
+assert_equal %q{ok}, %q{
+  ary = []
+  case
+  when false, *ary
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [false, nil]
+  case
+  when *ary
+    :ng
+  else
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [false, nil]
+  case
+  when *ary
+    :ng
+  when true
+    :ok
+  else
+    :ng2
+  end
+}
+assert_equal %q{ng}, %q{
+  ary = [false, nil]
+  case
+  when *ary
+    :ok
+  else
+    :ng
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [false, true]
+  case
+  when *ary
+    :ok
+  else
+    :ng
+  end
+}
+assert_equal %q{ok}, %q{
+  ary = [false, true]
+  case
+  when false, false
+  when false, *ary
+    :ok
+  else
+    :ng
+  end
+}
+assert_equal %q{}, %q{
+  i = 0
+  while i < 10
+    i+=1
+  end}
+assert_equal %q{10}, %q{
+  i = 0
+  while i < 10
+    i+=1
+  end; i}
+assert_equal %q{}, %q{
+  i = 0
+  until i > 10
+    i+=1
+  end}
+assert_equal %q{11}, %q{
+  i = 0
+  until i > 10
+    i+=1
+  end; i}
+assert_equal %q{1}, %q{
+  i = 0
+  begin
+    i+=1
+  end while false
+  i
+}
+assert_equal %q{1}, %q{
+  i = 0
+  begin
+    i+=1
+  end until true
+  i
+}
+def assert_syntax_error expected, code, message = ''
+  assert_match /^#{Regexp.escape(expected)}/,
+    "begin eval(%q{#{code}}, nil, '', 0)"'; rescue SyntaxError => e; e.message[/(?:\^~*|\A:(?:\d+:)?(?! syntax errors? found)(?: syntax error,)?) (.*)/, 1] end', message
+end
+assert_syntax_error "unterminated string meets end of file", '().."', '[ruby-dev:29732]'
+assert_equal %q{[]}, %q{$&;[]}, '[ruby-dev:31068]'
+assert_syntax_error "unexpected *, expecting '}'", %q{{*0}}, '[ruby-dev:31072]'
+assert_syntax_error "'@0' is not allowed as an instance variable name", %q{@0..0}, '[ruby-dev:31095]'
+assert_syntax_error "'$00' is not allowed as a global variable name", %q{$00..0}, '[ruby-dev:31100]'
+assert_syntax_error "'$00' is not allowed as a global variable name", %q{0..$00=1}
+assert_equal %q{0}, %q{[*0];0}, '[ruby-dev:31102]'
+assert_syntax_error "unexpected ')'", %q{v0,(*,v1,) = 0}, '[ruby-dev:31104]'
+assert_equal %q{1}, %q{
+  class << (ary=[]); def []; 0; end; def []=(x); super(0,x);end;end; ary[]+=1
+}, '[ruby-dev:31110]'
+assert_syntax_error "Can't set variable $1", %q{0..$1=1}, '[ruby-dev:31118]'
+assert_valid_syntax %q{1.times{1+(1&&next)}}, '[ruby-dev:31119]'
+assert_valid_syntax %q{x=-1;loop{x+=1&&redo if (x+=1).zero?}}, '[ruby-dev:31119]'
+assert_syntax_error %q{unexpected end-of-input}, %q{!}, '[ruby-dev:31243]'
+assert_equal %q{[nil]}, %q{[()]}, '[ruby-dev:31252]'
+assert_equal %q{true}, %q{!_=()}, '[ruby-dev:31263]'
+assert_equal 'ok', %q{while true; redo; end if 1 == 2; :ok}, '[ruby-dev:31360]'
+assert_equal 'ok', %q{
+  1.times {
+    begin
+    ensure
+      next
+    end
+  }; :ok
+}, '[ruby-dev:31373]'
+assert_equal 'ok', %q{
+  flag = false
+  1.times {
+    next if flag
+    flag = true
+    begin
+    ensure
+      redo
+    end
+  }; :ok
+}, '[ruby-dev:31373]'
+
+assert_equal 'ok', %q{
+  1.times{
+    p(1, (next if true; 2))
+  }; :ok
+}
+assert_equal '3', %q{
+  i = 0
+  1 + (while true
+         break 2 if (i+=1) > 1
+         next
+       end)
+}
+assert_equal '3', %q{
+  i = 0
+  1 + (while true
+         break 2 if (i+=1) > 1
+         p(1, (next if true; 2))
+       end)
+}
+# redo
+assert_equal 'ok', %q{
+  i = 0
+  1.times{
+    break if i>1
+    i+=1
+    p(1, (redo if true; 2))
+  }; :ok
+}
+assert_equal '3', %q{
+  i = 0
+  1 + (while true
+         break 2 if (i+=1) > 1
+         redo
+       end)
+}
+assert_equal '3', %q{
+  i = 0
+  1 + (while true
+         break 2 if (i+=1) > 1
+         p(1, (redo if true; 2))
+       end)
+}
+assert_equal '1', %q{
+  a = [0]
+  a[*a]+=1
+}
+assert_equal '2', %q{
+  ary = [0]
+  case 1
+  when *ary, 1
+    1
+  end +
+  case
+  when *ary
+    1
+  end
+}
+
+assert_match /invalid multibyte char/, %q{
+  $stderr = STDOUT
+  eval("\"\xf0".dup.force_encoding("utf-8"))
+}, '[ruby-dev:32429]'
+
+# method ! and !=
+assert_equal 'true', %q{!false}
+assert_equal 'true', %q{1 == 1}
+assert_equal 'true', %q{1 != 2}
+assert_equal 'true', %q{
+  class C; def !=(obj); true; end; end
+  C.new != 1
+}
+assert_equal 'true', %q{
+  class C; def !@; true; end; end
+  !C.new
+}
+assert_normal_exit %q{
+  eval "while true; return; end rescue p $!"
+}, '[ruby-dev:31663]'
+assert_equal '1', %q{
+  def bar
+    raise
+  end
+
+  def foo
+    1.times{
+      begin
+        return bar
+      rescue
+        :ok
+      end
+    }
+  end
+
+  foo
+}
+
+assert_equal 'ok', %q{
+  counter = 2
+  while true
+    counter -= 1
+    next if counter != 0
+    break
+  end
+  :ok
+}, '[ruby-core:14385]'
+
+assert_equal 'ok', %q{
+  counter = 2
+  while true
+    counter -= 1
+    next if counter != 0
+    break :ok
+  end # direct
+}, '[ruby-core:14385]'
+
+assert_equal 'ok', %q{
+  counter = 2
+  while true
+    counter -= 1
+    break if counter == 0
+    "#{next}"
+  end
+  :ok
+}, 'reported by Yusuke ENDOH'
+
+assert_equal 'ok', %q{
+  counter = 2
+  while true
+    counter -= 1
+    break if counter == 0
+    next
+    redo
+  end
+  :ok
+}, 'reported by Yusuke ENDOH'
+
+assert_equal 'ok', %q{
+  counter = 2
+  while true
+    counter -= 1
+    break if counter == 0
+    next
+    "#{ redo }"
+  end
+  :ok
+}, 'reported by Yusuke ENDOH'
+
+assert_normal_exit %q{
+  begin
+    raise
+  rescue
+    counter = 2
+    while true
+      counter -= 1
+      break if counter == 0
+      next
+      retry
+    end
+  end
+}, 'reported by Yusuke ENDOH'
+
+assert_normal_exit %q{
+  counter = 2
+  while true
+    counter -= 1
+    break if counter == 0
+    next
+    "#{ break }"
+  end
+}, 'reported by Yusuke ENDOH'
+
+assert_normal_exit %q{
+  counter = 2
+  while true
+    counter -= 1
+    next if counter != 0
+    "#{ break }"
+  end
+}, 'reported by Yusuke ENDOH'
+
+assert_equal 'ok', %q{
+  1.times do
+    [
+      1, 2, 3, 4, 5, 6, 7, 8,
+      begin
+        false ? next : p
+        break while true
+      end
+    ]
+  end
+  :ok
+}, '[ruby-dev:32882]'
+
+assert_equal "1\n2\n", %q{
+  i = 0
+  while i<2
+    i += 1
+    next p(i)
+  end
+}
+
+assert_valid_syntax('1.times {|i|print (42),1;}', '[ruby-list:44479]')
+
+assert_equal 'ok', %q{
+  def a() end
+  begin
+    if defined?(a(1).a)
+      :ng
+    else
+      :ok
+    end
+  rescue
+    :ng
+  end
+}, '[ruby-core:16010]'
+
+assert_equal 'ok', %q{
+  def a() end
+  begin
+    if defined?(a::B)
+      :ng
+    else
+      :ok
+    end
+  rescue
+    :ng
+  end
+}, '[ruby-core:16010]'
+
+assert_normal_exit %q{
+  defined? C && 0
+}
+
+assert_normal_exit %q{
+  class C
+    def m
+      defined?(super())
+    end
+  end
+  C.new.m
+}
+
+assert_equal 'ok', %q{
+  class X < RuntimeError;end
+  x = [X]
+  begin
+   raise X
+  rescue *x
+   :ok
+  end
+}, '[ruby-core:14537]'
+
+assert_equal 'ok', %q{
+  a = [false]
+  (a[0] &&= true) == false ? :ok : :ng
+}, '[ruby-dev:34679]'
+
+assert_normal_exit %q{
+  a = []
+  100.times {|i| a << i << nil << nil }
+  p a.compact!
+}
+
+assert_equal 'ok', %q{
+  "#{}""#{}ok"
+}, '[ruby-dev:38968]'
+
+
+assert_equal 'ok', %q{
+  "o" "#{}k"
+}, '[ruby-dev:38980]'
+
+bug2415 = '[ruby-core:26961]'
+assert_normal_exit %q{
+  0.times do
+    0.times do
+      def x(a=1, b, *rest); nil end
+    end
+  end
+}, bug2415
+
+assert_normal_exit %q{
+  0.times do
+    0.times do
+      def x@; nil end
+    end
+  end
+}, bug2415
+
+assert_normal_exit %q{
+  0.times do
+    0.times do
+      def x(a = 0.times do
+              def y(a=1, b, *rest); nil; end
+            end)
+        nil
+      end
+    end
+  end
+}, bug2415
+
+assert_normal_exit %q{
+  0.times do
+    0.times do
+      def x(a = 0.times do
+              def x@; nil; end
+            end)
+        nil
+      end
+    end
+  end
+}, bug2415
+
+assert_normal_exit %q{
+  a {
+    b {|c.d| }
+    e
+  }
+}, '[ruby-dev:39861]'
+
+bug1240 = '[ruby-core:22637]'
+assert_valid_syntax('x y { "#{}".z { } }', bug1240)
+assert_valid_syntax('x y { "#{}".z do end }', bug1240)
+
+assert_valid_syntax('y "#{a 1}" do end', '[ruby-core:29579]')
+assert_normal_exit %q{
+  def foo(&block)
+    yield
+  end
+
+  foo do
+    s = defined?(raise + 1)
+    Class
+  end
+}, '[ruby-core:30293]'
+
+assert_equal "false", <<~RUBY, "literal strings are mutable", "--disable-frozen-string-literal"
+  'test'.frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "literal strings are frozen", "--disable-frozen-string-literal", frozen_string_literal: true
+  'test'.frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "literal strings are frozen", "--enable-frozen-string-literal"
+  'test'.frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "literal strings are mutable", "--enable-frozen-string-literal", frozen_string_literal: false
+  'test'.frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "__FILE__ is mutable", "--disable-frozen-string-literal"
+  __FILE__.frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "__FILE__ is frozen", "--disable-frozen-string-literal", frozen_string_literal: true
+  __FILE__.frozen?
+RUBY
+
+assert_equal "true", <<~RUBY, "__FILE__ is frozen", "--enable-frozen-string-literal"
+  __FILE__.frozen?
+RUBY
+
+assert_equal "false", <<~RUBY, "__FILE__ is mutable", "--enable-frozen-string-literal", frozen_string_literal: false
+  __FILE__.frozen?
+RUBY
diff --git a/bootstraptest/test_thread.rb b/bootstraptest/test_thread.rb
new file mode 100644
index 0000000000..7ff5bb4a38
--- /dev/null
+++ b/bootstraptest/test_thread.rb
@@ -0,0 +1,511 @@
+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{
+  }.join
+  :ok
+}
+assert_equal %q{ok}, %q{
+  Thread.new{
+    :ok
+  }.value
+}
+assert_equal %q{ok}, %q{
+begin
+  v = 0
+  (1..200).map{|i|
+    Thread.new{
+      i
+    }
+  }.each{|t|
+    v += t.value
+  }
+  v == 20100 ? :ok : v
+rescue ThreadError => e
+  :ok if /can't create Thread/ =~ e.message
+end
+}
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
+    (1..2).map{
+      Thread.new{
+      }
+    }.each{|e|
+      e.join()
+    }
+  }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
+}
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{|e|
+    (1..2).map{
+      Thread.new{
+      }
+    }.each{|e|
+      e.join(1000000000)
+    }
+  }
+rescue ThreadError => e
+  /can't create Thread/ =~ e.message ? :ok : e.message
+end
+}
+assert_equal %q{ok}, %q{
+begin
+  :ok if 5000 == 5000.times{
+    t = Thread.new{}
+    while t.alive?
+      Thread.pass
+    end
+  }
+rescue NoMemoryError
+  :ok
+end
+}
+assert_equal %q{100}, %q{
+  100.times{
+    Thread.new{loop{Thread.pass}}
+  }
+}
+assert_equal %q{ok}, %q{
+  Thread.new{
+    :ok
+  }.join.value
+}
+assert_equal %q{ok}, %q{
+  begin
+    Thread.new{
+      raise "ok"
+    }.join
+  rescue => e
+    e
+  end
+}
+assert_equal %q{ok}, %q{
+  ans = nil
+  t = Thread.new{
+    begin
+      sleep 0.5
+    ensure
+      ans = :ok
+    end
+  }
+  Thread.pass until t.stop?
+  t.kill
+  t.join
+  ans
+}
+assert_equal %q{ok}, %q{
+  t = Thread.new{
+    sleep
+  }
+  sleep 0.1
+  t.raise
+  begin
+    t.join
+    :ng
+  rescue
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  t = Thread.new{
+    loop{}
+  }
+  Thread.pass
+  t.raise
+  begin
+    t.join
+    :ng
+  rescue
+    :ok
+  end
+}
+assert_equal %q{ok}, %q{
+  t = Thread.new{
+  }
+  Thread.pass
+  t.join
+  t.raise # raise to exited thread
+  begin
+    t.join
+    :ok
+  rescue
+    :ng
+  end
+}
+assert_equal %q{run}, %q{
+  t = Thread.new{
+    loop{}
+  }
+  st = t.status
+  t.kill
+  st
+}
+assert_equal %q{sleep}, %q{
+  t = Thread.new{
+    sleep
+  }
+  sleep 0.1
+  st = t.status
+  t.kill
+  st
+}
+assert_equal %q{false}, %q{
+  t = Thread.new{
+  }
+  t.kill
+  sleep 0.1
+  t.status
+}
+assert_equal %q{[ThreadGroup, true]}, %q{
+  ptg = Thread.current.group
+  Thread.new{
+    ctg = Thread.current.group
+    [ctg.class, ctg == ptg]
+  }.value
+}
+assert_equal %q{[1, 1]}, %q{
+  thg = ThreadGroup.new
+
+  t = Thread.new{
+    thg.add Thread.current
+    sleep
+  }
+  sleep 0.1
+  [thg.list.size, ThreadGroup::Default.list.size]
+}
+assert_equal %q{true}, %q{
+  thg = ThreadGroup.new
+
+  t = Thread.new{sleep 5}
+  thg.add t
+  thg.list.include?(t)
+}
+assert_equal %q{[true, nil, true]}, %q{
+  /a/ =~ 'a'
+  $a = $~
+  Thread.new{
+    $b = $~
+    /b/ =~ 'b'
+    $c = $~
+  }.join
+  $d = $~
+  [$a == $d, $b, $c != $d]
+}
+assert_equal %q{11}, %q{
+  Thread.current[:a] = 1
+  Thread.new{
+    Thread.current[:a] = 10
+    Thread.pass
+    Thread.current[:a]
+  }.value + Thread.current[:a]
+}
+assert_normal_exit %q{
+  begin
+    100.times do |i|
+      begin
+        th = Thread.start(Thread.current) {|u| u.raise }
+        raise
+      rescue
+      ensure
+        th.join
+      end
+    end
+  rescue
+  end
+}, '[ruby-dev:31371]'
+
+assert_equal 'true', %{
+  t = Thread.new { loop {} }
+  begin
+    pid = fork {
+      exit t.status != "run"
+    }
+    Process.wait pid
+    $?.success?
+  rescue NotImplementedError
+    true
+  end
+}
+
+assert_equal 'true', %{
+  Thread.new{}.join
+  begin
+    Process.waitpid2 fork{
+      Thread.new{
+        sleep 0.1
+      }.join
+    }
+    true
+  rescue NotImplementedError
+    true
+  end
+}
+
+assert_equal 'ok', %{
+  File.write("zzz_t1.rb", <<-END)
+      begin
+        Thread.new { fork { GC.start } }.join
+        pid, status = Process.wait2
+        $result = status.success? ? :ok : :ng
+      rescue NotImplementedError
+        $result = :ok
+      end
+    END
+  require "./zzz_t1.rb"
+  $result
+}
+
+assert_finish 3, %{
+  th = Thread.new {sleep 0.2}
+  th.join(0.1)
+  th.join
+}
+
+assert_finish 3, %{
+  require 'timeout'
+  th = Thread.new {sleep 0.2}
+  begin
+    Timeout.timeout(0.1) {th.join}
+  rescue Timeout::Error
+  end
+  th.join
+}
+
+assert_normal_exit %q{
+  STDERR.reopen(STDOUT)
+  exec "/"
+}
+
+assert_normal_exit %q{
+  (0..10).map {
+    Thread.new {
+     10000.times {
+        Object.new.to_s
+      }
+    }
+  }.each {|t|
+    t.join
+  }
+}
+
+assert_equal 'ok', %q{
+  def m
+    t = Thread.new { while true; // =~ "" end }
+    sleep 0.01
+    10.times {
+      if /((ab)*(ab)*)*(b)/ =~ "ab"*7
+        return :ng if !$4
+        return :ng if $~.size != 5
+      end
+    }
+    :ok
+  ensure
+    Thread.kill t
+  end
+  m
+}, '[ruby-dev:34492]'
+
+assert_normal_exit %q{
+  g = enum_for(:local_variables)
+  loop { g.next }
+}, '[ruby-dev:34128]'
+
+assert_normal_exit %q{
+  g = enum_for(:block_given?)
+  loop { g.next }
+}, '[ruby-dev:34128]'
+
+assert_normal_exit %q{
+  g = enum_for(:binding)
+  loop { g.next }
+}, '[ruby-dev:34128]'
+
+assert_normal_exit %q{
+  g = "abc".enum_for(:scan, /./)
+  loop { g.next }
+}, '[ruby-dev:34128]'
+
+assert_normal_exit %q{
+  g = Module.enum_for(:new)
+  loop { g.next }
+}, '[ruby-dev:34128]'
+
+assert_normal_exit %q{
+  Thread.new("foo", &Object.method(:class_eval)).join
+}, '[ruby-dev:34128]'
+
+assert_equal 'ok', %q{
+  begin
+    Thread.new { Thread.stop }
+    Thread.stop
+    :ng
+  rescue Exception
+    :ok
+  end
+}
+
+assert_equal 'ok', %q{
+  begin
+    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
+  end
+}
+
+assert_equal 'ok', %q{
+  m = Thread::Mutex.new
+  Thread.new { m.lock }; sleep 0.1; m.lock
+  :ok
+}
+
+assert_equal 'ok', %q{
+  m = Thread::Mutex.new
+  Thread.new { m.lock }; m.lock
+  :ok
+}
+
+assert_equal 'ok', %q{
+  m = Thread::Mutex.new
+  Thread.new { m.lock }.join; m.lock
+  :ok
+}
+
+assert_equal 'ok', %q{
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2 }
+  sleep 0.1; m.lock
+  :ok
+}
+
+assert_equal 'ok', %q{
+  m = Thread::Mutex.new
+  Thread.new { m.lock; sleep 0.2; m.unlock }
+  sleep 0.1; m.lock
+  :ok
+}
+
+assert_equal 'ok', %q{
+  t = Thread.new {`echo`}
+  t.join
+  $? ? :ng : :ok
+}, '[ruby-dev:35414]'
+
+assert_equal 'ok', %q{
+  begin
+    100.times{
+      (1..100).map{ Thread.new(true) {|x| x == false } }.each{|th| th.join}
+    }
+  rescue NoMemoryError, StandardError
+  end
+  :ok
+}
+
+assert_equal 'ok', %{
+  File.write("zzz_t2.rb", <<-'end;') # do
+      begin
+        m = Thread::Mutex.new
+        parent = Thread.current
+        th1 = Thread.new { m.lock; sleep }
+        sleep 0.01 until th1.stop?
+        Thread.new do
+          sleep 0.01 until parent.stop?
+          begin
+            fork { GC.start }
+          rescue Exception
+            parent.raise $!
+          end
+          th1.run
+        end
+        m.lock
+        pid, status = Process.wait2
+        $result = status.success? ? :ok : :ng
+      rescue NotImplementedError
+        $result = :ok
+      end
+    end;
+  require "./zzz_t2.rb"
+  $result
+}
+
+assert_finish 3, %q{
+  require 'thread'
+
+  lock = Thread::Mutex.new
+  cond = Thread::ConditionVariable.new
+  t = Thread.new do
+    lock.synchronize do
+      cond.wait(lock)
+    end
+  end
+
+  begin
+    pid = fork do
+      # Child
+      STDOUT.write "This is the child process.\n"
+      STDOUT.write "Child process exiting.\n"
+    end
+    Process.waitpid(pid)
+  rescue NotImplementedError
+  end
+}, '[ruby-core:23572]'
+
+assert_equal 'ok', %q{
+  begin
+    Process.waitpid2(fork {})[1].success? ? 'ok' : 'ng'
+  rescue NotImplementedError
+    'ok'
+  end
+}
+
+assert_equal 'foo', %q{
+  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..e9ce905e2c
--- /dev/null
+++ b/bootstraptest/test_yjit.rb
@@ -0,0 +1,5557 @@
+# To run the tests in this file only, with YJIT enabled:
+# make btest BTESTS=bootstraptest/test_yjit.rb RUN_OPTS="--yjit-call-threshold=1"
+
+# regression test for popping before side exit
+assert_equal "ok", %q{
+  def foo(a, *) = a
+
+  def call(args, &)
+    foo(1) # spill at where the block arg will be
+    foo(*args, &)
+  end
+
+  call([1, 2])
+
+  begin
+    call([])
+  rescue ArgumentError
+    :ok
+  end
+}
+
+# regression test for send processing before side exit
+assert_equal "ok", %q{
+  def foo(a, *) = :foo
+
+  def call(args)
+    send(:foo, *args)
+  end
+
+  call([1, 2])
+
+  begin
+    call([])
+  rescue ArgumentError
+    :ok
+  end
+}
+
+# test discarding extra yield arguments
+assert_equal "22131300500015901015", %q{
+  def splat_kw(ary) = yield *ary, a: 1
+
+  def splat(ary) = yield *ary
+
+  def kw = yield 1, 2, a: 3
+
+  def kw_only = yield a: 0
+
+  def simple = yield 0, 1
+
+  def none = yield
+
+  def calls
+    [
+      splat([1, 1, 2]) { |x, y| x + y },
+      splat([1, 1, 2]) { |y, opt = raise| opt + y},
+      splat_kw([0, 1]) { |a:| a },
+      kw { |a:| a },
+      kw { |one| one },
+      kw { |one, a:| a },
+      kw_only { |a:| a },
+      kw_only { |a: 1| a },
+      simple { 5.itself },
+      simple { |a| a },
+      simple { |opt = raise| opt },
+      simple { |*rest| rest },
+      simple { |opt_kw: 5| opt_kw },
+      none { |a: 9| a },
+      # autosplat ineractions
+      [0, 1, 2].yield_self { |a, b| [a, b] },
+      [0, 1, 2].yield_self { |a, opt = raise| [a, opt] },
+      [1].yield_self { |a, opt = 4| a + opt },
+    ]
+  end
+
+  calls.join
+}
+
+# test autosplat with empty splat
+assert_equal "ok", %q{
+  def m(pos, splat) = yield pos, *splat
+
+  m([:ok], []) {|v0,| v0 }
+}
+
+# regression test for send stack shifting
+assert_normal_exit %q{
+  def foo(a, b)
+    a.singleton_methods(b)
+  end
+
+  def call_foo
+    [1, 1, 1, 1, 1, 1, send(:foo, 1, 1)]
+  end
+
+  call_foo
+}
+
+# regression test for keyword splat with yield
+assert_equal 'nil', %q{
+  def splat_kw(kwargs) = yield(**kwargs)
+
+  splat_kw({}) { _1 }.inspect
+}
+
+# regression test for arity check with splat
+assert_equal '[:ae, :ae]', %q{
+  def req_one(a_, b_ = 1) = raise
+
+  def test(args)
+    req_one *args
+  rescue ArgumentError
+    :ae
+  end
+
+  [test(Array.new 5), test([])]
+}
+
+# regression test for arity check with splat and send
+assert_equal '[:ae, :ae]', %q{
+  def two_reqs(a, b_, _ = 1) = a.gsub(a, a)
+
+  def test(name, args)
+    send(name, *args)
+  rescue ArgumentError
+    :ae
+  end
+
+  [test(:two_reqs, ["g", nil, nil, nil]), test(:two_reqs, ["g"])]
+}
+
+# regression test for GC marking stubs in invalidated code
+assert_normal_exit %q{
+  skip true unless GC.respond_to?(:compact)
+  garbage = Array.new(10_000) { [] } # create garbage to cause iseq movement
+  eval(<<~RUBY)
+  def foo(n, garbage)
+    if n == 2
+      # 1.times.each to create a cfunc frame to preserve the JIT frame
+      # which will return to a stub housed in an invalidated block
+      return 1.times.each do
+        Object.define_method(:foo) {}
+        garbage.clear
+        GC.verify_compaction_references(toward: :empty, expand_heap: true)
+      end
+    end
+
+    foo(n + 1, garbage)
+  end
+  RUBY
+
+  foo(1, garbage)
+}
+
+# regression test for callee block handler overlapping with arguments
+assert_equal '3', %q{
+  def foo(_req, *args) = args.last
+
+  def call_foo = foo(0, 1, 2, 3, &->{})
+
+  call_foo
+}
+
+# call leaf builtin with a block argument
+assert_equal '0', "0.abs(&nil)"
+
+# regression test for invokeblock iseq guard
+assert_equal 'ok', %q{
+  skip :ok unless GC.respond_to?(:compact)
+  def foo = yield
+  10.times do |i|
+    ret = eval("foo { #{i} }")
+    raise "failed at #{i}" unless ret == i
+    GC.compact
+  end
+  :ok
+}
+
+# regression test for overly generous guard elision
+assert_equal '[0, :sum, 0, :sum]', %q{
+  # In faulty versions, the following happens:
+  #  1. YJIT puts object on the temp stack with type knowledge
+  #     (CArray or CString) about RBASIC_CLASS(object).
+  #  2. In iter=0, due to the type knowledge, YJIT generates
+  #     a call to sum() without any guard on RBASIC_CLASS(object).
+  #  3. In iter=1, a singleton class is added to the object,
+  #     changing RBASIC_CLASS(object), falsifying the type knowledge.
+  #  4. Because the code from (1) has no class guard, it is incorrectly
+  #     reused and the wrong method is invoked.
+  # Putting a literal is important for gaining type knowledge.
+  def carray(iter)
+    array = []
+    array.sum(iter.times { def array.sum(_) = :sum })
+  end
+
+  def cstring(iter)
+    string = "".dup
+    string.sum(iter.times { def string.sum(_) = :sum })
+  end
+
+  [carray(0), carray(1), cstring(0), cstring(1)]
+}
+
+# regression test for return type of Integer#/
+# It can return a T_BIGNUM when inputs are T_FIXNUM.
+assert_equal 0x3fffffffffffffff.to_s, %q{
+  def call(fixnum_min)
+    (fixnum_min / -1) - 1
+  end
+
+  call(-(2**62))
+}
+
+# regression test for return type of String#<<
+assert_equal 'Sub', %q{
+  def call(sub) = (sub << sub).itself
+
+  class Sub < String; end
+
+  call(Sub.new('o')).class
+}
+
+# String#dup with generic ivars
+assert_equal '["str", "ivar"]', %q{
+  def str_dup(str) = str.dup
+  str = "str"
+  str.instance_variable_set(:@ivar, "ivar")
+  str = str_dup(str)
+  [str, str.instance_variable_get(:@ivar)]
+}
+
+# test splat filling required and feeding rest
+assert_equal '[0, 1, 2, [3, 4]]', %q{
+  public def lead_rest(a, b, *rest)
+    [self, a, b, rest]
+  end
+
+  def call(args) = 0.lead_rest(*args)
+
+  call([1, 2, 3, 4])
+}
+
+# test missing opts are nil initialized
+assert_equal '[[0, 1, nil, 3], [0, 1, nil, 3], [0, 1, nil, 3, []], [0, 1, nil, 3, []]]', %q{
+  public def lead_opts(a, b=binding.local_variable_get(:c), c=3)
+    [self, a, b, c]
+  end
+
+  public def opts_rest(a=raise, b=binding.local_variable_get(:c), c=3, *rest)
+    [self, a, b, c, rest]
+  end
+
+  def call(args)
+    [
+      0.lead_opts(1),
+      0.lead_opts(*args),
+
+      0.opts_rest(1),
+      0.opts_rest(*args),
+    ]
+  end
+
+  call([1])
+}
+
+# test filled optionals with unspecified keyword param
+assert_equal 'ok', %q{
+  def opt_rest_opt_kw(_=1, *, k: :ok) = k
+
+  def call = opt_rest_opt_kw(0)
+
+  call
+}
+
+# test splat empty array with rest param
+assert_equal '[0, 1, 2, []]', %q{
+  public def foo(a=1, b=2, *rest)
+    [self, a, b, rest]
+  end
+
+  def call(args) = 0.foo(*args)
+
+  call([])
+}
+
+# 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 overridden 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 '[nil, nil, nil, nil, nil, nil]', %q{
+  # Tests defined? on non-heap objects
+  [NilClass, TrueClass, FalseClass, Integer, Float, Symbol].each do |klass|
+    klass.class_eval("def foo = defined?(@foo)")
+  end
+
+  [nil, true, false, 0xFABCAFE, 0.42, :cake].map do |instance|
+    instance.foo
+    instance.foo
+  end
+}
+
+assert_equal '[nil, "instance-variable", nil, "instance-variable"]', %q{
+  # defined? on object that changes shape between calls
+  class Foo
+    def foo
+      defined?(@foo)
+    end
+
+    def add
+      @foo = 1
+    end
+
+    def remove
+      self.remove_instance_variable(:@foo)
+    end
+  end
+
+  obj = Foo.new
+  [obj.foo, (obj.add; obj.foo), (obj.remove; obj.foo), (obj.add; obj.foo)]
+}
+
+assert_equal '["instance-variable", 5]', %q{
+  # defined? on object too complex for shape information
+  class Foo
+    def initialize
+      100.times { |i| instance_variable_set("@foo#{i}", i) }
+    end
+
+    def foo
+      [defined?(@foo5), @foo5]
+    end
+  end
+
+  Foo.new.foo
+}
+
+# getinstancevariable with shape too complex
+assert_normal_exit %q{
+  class Foo
+    def initialize
+      @a = 1
+    end
+
+    def getter
+      @foobar
+    end
+  end
+
+  # Initialize ivars in changing order, making the Foo
+  # class have shape too complex
+  100.times do |x|
+    foo = Foo.new
+    foo.instance_variable_set(:"@a#{x}", 1)
+    foo.instance_variable_set(:"@foobar", 777)
+
+    # The getter method eventually sees shape too complex
+    r = foo.getter
+    if r != 777
+      raise "error"
+    end
+  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
+}
+
+# BOP redefinition works on Integer#<=
+assert_equal 'false', %q{
+  def le(x, y) = x <= y
+
+  le(2, 2)
+
+  class Integer
+    def <=(_) = false
+  end
+
+  le(2, 2)
+}
+
+# BOP redefinition works on Integer#>
+assert_equal 'false', %q{
+  def gt(x, y) = x > y
+
+  gt(3, 2)
+
+  class Integer
+    def >(_) = false
+  end
+
+  gt(3, 2)
+}
+
+# BOP redefinition works on Integer#>=
+assert_equal 'false', %q{
+  def ge(x, y) = x >= y
+
+  ge(2, 2)
+
+  class Integer
+    def >=(_) = false
+  end
+
+  ge(2, 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{
+  skip :good unless GC.respond_to?(:compact)
+  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)
+  ]
+}
+
+# Test default value block for Hash
+assert_equal "false", <<~RUBY, frozen_string_literal: false
+  def index_with_string(h)
+    h["foo"]
+  end
+
+  h = Hash.new { |h, k| k.frozen? }
+
+  index_with_string(h)
+  index_with_string(h)
+RUBY
+
+# 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', <<~RUBY, frozen_string_literal: false
+  def jittable_method
+    str = "bar"
+
+    old_obj_id = str.object_id
+    uplus_str = +str
+
+    uplus_str.object_id == old_obj_id
+  end
+  jittable_method
+RUBY
+
+# 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 getbyte on string class
+assert_equal '[97, :nil, 97, :nil, :raised]', %q{
+  def getbyte(s, i)
+   byte = begin
+    s.getbyte(i)
+   rescue TypeError
+    :raised
+   end
+
+   byte || :nil
+  end
+
+  getbyte("a", 0)
+  getbyte("a", 0)
+
+  [getbyte("a", 0), getbyte("a", 1), getbyte("a", -1), getbyte("a", -2), getbyte("a", "a")]
+}
+
+# Basic test for String#setbyte
+assert_equal 'AoZ', %q{
+  s = +"foo"
+  s.setbyte(0, 65)
+  s.setbyte(-1, 90)
+  s
+}
+
+# String#setbyte IndexError
+assert_equal 'String#setbyte', %q{
+  def ccall = "".setbyte(1, 0)
+  begin
+    ccall
+  rescue => e
+    e.backtrace.first.split("'").last
+  end
+}
+
+# String#setbyte TypeError
+assert_equal 'String#setbyte', %q{
+  def ccall = "".setbyte(nil, 0)
+  begin
+    ccall
+  rescue => e
+    e.backtrace.first.split("'").last
+  end
+}
+
+# String#setbyte FrozenError
+assert_equal 'String#setbyte', %q{
+  def ccall = "a".freeze.setbyte(0, 0)
+  begin
+    ccall
+  rescue => e
+    e.backtrace.first.split("'").last
+  end
+}
+
+# non-leaf String#setbyte
+assert_equal 'String#setbyte', %q{
+  def to_int
+    @caller = caller
+    0
+  end
+
+  def ccall = "a".dup.setbyte(self, 98)
+  ccall
+
+  @caller.first.split("'").last
+}
+
+# non-leaf String#byteslice
+assert_equal 'TypeError', %q{
+  def ccall = "".byteslice(nil, nil)
+  begin
+    ccall
+  rescue => e
+    e.class
+  end
+}
+
+# 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)
+}
+
+# regression test for argument registers with invalidation
+assert_equal '[0, 1, 2]', %q{
+  def test(n)
+    ret = n
+    binding
+    ret
+  end
+
+  [0, 1, 2].map do |n|
+    test(n)
+  end
+}
+
+# regression test for argument registers
+assert_equal 'true', %q{
+  class Foo
+    def ==(other)
+      other == nil
+    end
+  end
+
+  def test
+    [Foo.new].include?(Foo.new)
+  end
+
+  test
+}
+
+# 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)
+}
+
+# Test EP == BP invalidation with moving ISEQs
+assert_equal 'ok', %q{
+  skip :ok unless GC.respond_to?(:compact)
+  def entry
+    ok = proc { :ok } # set #entry as an EP-escaping ISEQ
+    [nil].reverse_each do # avoid exiting the JIT frame on the constant
+      GC.compact # move #entry ISEQ
+    end
+    ok # should be read off of escaped EP
+  end
+
+  entry.call
+}
+
+# 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
+}
+
+# invokesuper with a block
+assert_equal 'true', %q{
+  class A
+    def foo = block_given?
+  end
+
+  class B < A
+    def foo = super()
+  end
+
+  B.new.foo { }
+  B.new.foo { }
+}
+
+# invokesuper in a block
+assert_equal '[0, 2]', %q{
+  class A
+    def foo(x) = x * 2
+  end
+
+  class B < A
+    def foo
+      2.times.map do |x|
+        super(x)
+      end
+    end
+  end
+
+  B.new.foo
+  B.new.foo
+}
+
+# invokesuper in a weird block
+assert_equal '["block->A#itself", "block->singleton#itself"]', %q{
+  # This test runs the same block as first as a block and then as a method,
+  # testing the routine that finds the currently running method, which is
+  # relevant for `super`.
+  class BlockIseqDuality
+    prepend(Module.new do
+      def itself
+        nested = -> { "block->" + super() }
+        @singleton_itself.define_singleton_method(:itself, &nested)
+        nested
+      end
+    end)
+
+    attr_reader :singleton_itself
+    def initialize = (@singleton_itself = "singleton#itself")
+
+    def itself = "A#itself"
+  end
+
+  tester = BlockIseqDuality.new
+  super_lambda = tester.itself
+  super_lambda.call # warmup
+  [super_lambda.call, tester.singleton_itself.itself]
+}
+
+# invokesuper zsuper in a bmethod
+assert_equal 'ok', %q{
+  class Foo
+    define_method(:itself) { super }
+  end
+  begin
+    Foo.new.itself
+  rescue RuntimeError
+    :ok
+  end
+}
+
+# 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)]
+}
+
+# Flonum and Flonum
+assert_equal '[2.0, 0.0, 1.0, 4.0]', %q{
+  [1.0 + 1.0, 1.0 - 1.0, 1.0 * 1.0, 8.0 / 2.0]
+}
+
+# Flonum and Fixnum
+assert_equal '[2.0, 0.0, 1.0, 4.0]', %q{
+  [1.0 + 1, 1.0 - 1, 1.0 * 1, 8.0 / 2]
+}
+
+# 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
+}
+
+# splatkw
+assert_equal '[1, 2]', %q{
+  def foo(a:) = [a, yield]
+
+  def entry(&block)
+    a = { a: 1 }
+    foo(**a, &block)
+  end
+
+  entry { 2 }
+}
+assert_equal '[1, 2]', %q{
+  def foo(a:) = [a, yield]
+
+  def entry(obj, &block)
+    foo(**obj, &block)
+  end
+
+  entry({ a: 3 }) { 2 }
+  obj = Object.new
+  def obj.to_hash = { a: 1 }
+  entry(obj) { 2 }
+}
+
+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]', %q{
+  class NilClass
+    private
+    def to_ary
+      [1, 2]
+    end
+  end
+
+  def expandarray_redefined_nilclass
+    a, b = nil
+    [a, b]
+  end
+
+  expandarray_redefined_nilclass
+  expandarray_redefined_nilclass
+}
+
+assert_equal 'not_array', %q{
+  def expandarray_not_array(obj)
+    a, = obj
+    a
+  end
+
+  obj = Object.new
+  def obj.method_missing(m, *args, &block)
+    return [:not_array] if m == :to_ary
+    super
+  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 '[nil, 2, nil]', %q{
+  def foo(arr)
+    a, b, c = arr
+  end
+
+  a, b, c1 = foo([0, 1])
+  a, b, c2 = foo([0, 1, 2])
+  a, b, c3 = foo([0, 1])
+  [c1, c2, c3]
+}
+
+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
+}
+
+# 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
+}
+
+# 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
+}
+
+# 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
+
+  port = Ractor::Port.new
+  tracing_ractor = Ractor.new port do |port|
+    # 1: start tracing
+    events = []
+    tp = TracePoint.new(:c_call) { events << _1.method_id }
+    tp.enable
+    port << nil
+
+    # 3: run compiled method on tracing ractor
+    port << nil
+    traced_method
+
+    events
+  ensure
+    tp&.disable
+  end
+
+  port.receive
+
+  # 2: compile on non tracing ractor
+  traced_method
+
+  port.receive
+  tracing_ractor.value
+}
+
+# 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
+
+  port = Ractor::Port.new
+  ractor = Ractor.new port do |port|
+    compiled(false)
+    port << nil
+    compiled(41)
+  end
+
+  tp = TracePoint.new(:line) { itself }
+  port.receive
+  tp.enable
+
+  ractor.value
+}
+
+# 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 }.value
+}
+
+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
+}
+
+# Bug #21257 (infinite jmp)
+assert_equal 'ok', %q{
+  Good = :ok
+
+  def first
+    second
+  end
+
+  def second
+    ::Good
+  end
+
+  # Make `second` side exit on its first instruction
+  trace = TracePoint.new(:line) { }
+  trace.enable(target: method(:second))
+
+  first
+  # Recompile now that the constant cache is populated, so we get a fallthrough from `first` to `second`
+  # (this is need to reproduce with --yjit-call-threshold=1)
+  RubyVM::YJIT.code_gc if defined?(RubyVM::YJIT)
+  first
+
+  # Trigger a constant cache miss in rb_vm_opt_getconstant_path (in `second`) next time it's called
+  module InvalidateConstantCache
+    Good = nil
+  end
+
+  RubyVM::YJIT.simulate_oom! if defined?(RubyVM::YJIT)
+
+  first
+  first
+}
+
+assert_equal 'ok', %q{
+  # Multiple incoming branches into second
+  Good = :ok
+
+  def incoming_one
+    second
+  end
+
+  def incoming_two
+    second
+  end
+
+  def second
+    ::Good
+  end
+
+  # Make `second` side exit on its first instruction
+  trace = TracePoint.new(:line) { }
+  trace.enable(target: method(:second))
+
+  incoming_one
+  # Recompile now that the constant cache is populated, so we get a fallthrough from `incoming_one` to `second`
+  # (this is need to reproduce with --yjit-call-threshold=1)
+  RubyVM::YJIT.code_gc if defined?(RubyVM::YJIT)
+  incoming_one
+  incoming_two
+
+  # Trigger a constant cache miss in rb_vm_opt_getconstant_path (in `second`) next time it's called
+  module InvalidateConstantCache
+    Good = nil
+  end
+
+  incoming_one
+}
+
+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)
+}
+
+# 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 { }
+}
+
+# unshareable bmethod call through Method#to_proc#call
+assert_equal '1000', %q{
+  define_method(:bmethod) do
+    self
+  end
+
+  Ractor.new do
+    errors = 0
+    1000.times do
+      p = method(:bmethod).to_proc
+      begin
+        p.call
+      rescue RuntimeError
+        errors += 1
+      end
+    end
+    errors
+  end.value
+}
+
+# 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_equal 'threw', %q{
+  def foo(args)
+    wrap(*args)
+  rescue ArgumentError
+    'threw'
+  end
+
+  def wrap(a)
+    [a]
+  end
+
+  foo([Hash.ruby2_keywords_hash({})])
+}
+
+assert_equal 'threw', %q{
+  # C call
+  def bar(args)
+    Array(*args)
+  rescue ArgumentError
+    'threw'
+  end
+
+  bar([Hash.ruby2_keywords_hash({})])
+}
+
+# Test instance_of? and is_a?
+assert_equal 'true', %q{
+  1.instance_of?(Integer) && 1.is_a?(Integer)
+}
+
+# Test instance_of? and is_a? for singleton classes
+assert_equal 'true', %q{
+  a = []
+  def a.test = :test
+  a.instance_of?(Array) && a.is_a?(Array)
+}
+
+# Test instance_of? for singleton_class
+# Yes this does really return false
+assert_equal 'false', %q{
+  a = []
+  def a.test = :test
+  a.instance_of?(a.singleton_class)
+}
+
+# Test is_a? for singleton_class
+assert_equal 'true', %q{
+  a = []
+  def a.test = :test
+  a.is_a?(a.singleton_class)
+}
+
+# Test send with splat to a cfunc
+assert_equal 'true', %q{
+  1.send(:==, 1, *[])
+}
+
+# Test empty splat with cfunc
+assert_equal '2', %q{
+  def foo
+    Integer.sqrt(4, *[])
+  end
+  # call twice to deal with constant exiting
+  foo
+  foo
+}
+
+# Test non-empty splat with cfunc
+assert_equal 'Hello World', %q{
+  def bar
+    args = ["Hello "]
+    greeting = +"World"
+    greeting.insert(0, *args)
+    greeting
+  end
+  bar
+}
+
+# Regression: this creates a temp stack with > 127 elements
+assert_normal_exit %q{
+  def foo(a)
+    [
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a, a, a,
+      a, a, a, a, a, a, a, a,
+    ]
+  end
+
+  def entry
+    foo(1)
+  end
+
+  entry
+}
+
+# Test that splat and rest combined
+# properly dupe the array
+assert_equal "[]", %q{
+  def foo(*rest)
+    rest << 1
+  end
+
+  def test(splat)
+    foo(*splat)
+  end
+
+  EMPTY = []
+  custom = Object.new
+  def custom.to_a
+    EMPTY
+  end
+
+  test(custom)
+  test(custom)
+  EMPTY
+}
+
+# Rest with send
+assert_equal '[1, 2, 3]', %q{
+  def bar(x, *rest)
+    rest.insert(0, x)
+  end
+  send(:bar, 1, 2, 3)
+}
+
+# Fix splat block arg bad compilation
+assert_equal "foo", %q{
+  def literal(*args, &block)
+    s = ''.dup
+    literal_append(s, *args, &block)
+    s
+  end
+
+  def literal_append(sql, v)
+    sql << v
+  end
+
+  literal("foo")
+}
+
+# regression test for accidentally having a parameter truncated
+# due to Rust/C signature mismatch. Used to crash with
+# > [BUG] rb_vm_insn_addr2insn: invalid insn address ...
+# or
+# > ... `Err` value: TryFromIntError(())'
+assert_normal_exit %q{
+  n = 16384
+  eval(
+    "def foo(arg); " + "_=arg;" * n + '_=1;' + "Object; end"
+  )
+  foo 1
+}
+
+# Regression test for CantCompile not using starting_ctx
+assert_normal_exit %q{
+  class Integer
+    def ===(other)
+      false
+    end
+  end
+
+  def my_func(x)
+    case x
+    when 1
+      1
+    when 2
+      2
+    else
+      3
+    end
+  end
+
+  my_func(1)
+}
+
+# Regression test for CantCompile not using starting_ctx
+assert_equal "ArgumentError", %q{
+  def literal(*args, &block)
+    s = ''.dup
+    args = [1, 2, 3]
+    literal_append(s, *args, &block)
+    s
+  end
+
+  def literal_append(sql, v)
+    [sql.inspect, v.inspect]
+  end
+
+  begin
+    literal("foo")
+  rescue ArgumentError
+    "ArgumentError"
+  end
+}
+
+# Rest with block
+# Simplified code from railsbench
+assert_equal '[{"/a" => "b", as: :c, via: :post}, [], nil]', %q{
+  def match(path, *rest, &block)
+    [path, rest, block]
+  end
+
+  def map_method(method, args, &block)
+    options = args.last
+    args.pop
+    options[:via] = method
+    match(*args, options, &block)
+  end
+
+  def post(*args, &block)
+    map_method(:post, args, &block)
+  end
+
+  post "/a" => "b", as: :c
+}
+
+# Test rest and kw_args
+assert_equal '[true, true, true, true]', %q{
+  def my_func(*args, base: nil, sort: true)
+    [args, base, sort]
+  end
+
+  def calling_my_func
+    results = []
+    results << (my_func("test") == [["test"], nil, true])
+    results << (my_func("test", base: :base) == [["test"], :base, true])
+    results << (my_func("test", sort: false) == [["test"], nil, false])
+    results << (my_func("test", "other", base: :base) == [["test", "other"], :base, true])
+    results
+  end
+  calling_my_func
+}
+
+# Test Integer#[] with 2 args
+assert_equal '0', %q{
+  3[0, 0]
+}
+
+# unspecified_bits + checkkeyword
+assert_equal '2', %q{
+  def callee = 1
+
+  # checkkeyword should see unspecified_bits=0 (use bar), not Integer 1 (set bar = foo).
+  def foo(foo, bar: foo) = bar
+
+  def entry(&block)
+    # write 1 at stack[3]. Calling #callee spills stack[3].
+    1 + (1 + (1 + (1 + callee)))
+    # &block is written to a register instead of stack[3]. When &block is popped and
+    # unspecified_bits is pushed, it must be written to stack[3], not to a register.
+    foo(1, bar: 2, &block)
+  end
+
+  entry # call branch_stub_hit (spill temps)
+  entry # doesn't call branch_stub_hit (not spill temps)
+}
+
+# Test rest and optional_params
+assert_equal '[true, true, true, true]', %q{
+  def my_func(stuff, base=nil, sort=true, *args)
+    [stuff, base, sort, args]
+  end
+
+  def calling_my_func
+    results = []
+    results << (my_func("test") == ["test", nil, true, []])
+    results << (my_func("test", :base) == ["test", :base, true, []])
+    results << (my_func("test", :base, false) == ["test", :base, false, []])
+    results << (my_func("test", :base, false, "other", "other") == ["test", :base, false, ["other", "other"]])
+    results
+  end
+  calling_my_func
+}
+
+# Test rest and optional_params and splat
+assert_equal '[true, true, true, true, true]', %q{
+  def my_func(stuff, base=nil, sort=true, *args)
+    [stuff, base, sort, args]
+  end
+
+  def calling_my_func
+    results = []
+    splat = ["test"]
+    results << (my_func(*splat) == ["test", nil, true, []])
+    splat = [:base]
+    results << (my_func("test", *splat) == ["test", :base, true, []])
+    splat = [:base, false]
+    results << (my_func("test", *splat) == ["test", :base, false, []])
+    splat = [:base, false, "other", "other"]
+    results << (my_func("test", *splat) == ["test", :base, false, ["other", "other"]])
+    splat = ["test", :base, false, "other", "other"]
+    results << (my_func(*splat) == ["test", :base, false, ["other", "other"]])
+    results
+  end
+  calling_my_func
+}
+
+# Regression test: rest and optional and splat
+assert_equal 'true', %q{
+  def my_func(base=nil, *args)
+    [base, args]
+  end
+
+  def calling_my_func
+    array = []
+    my_func(:base, :rest1, *array) == [:base, [:rest1]]
+  end
+
+  calling_my_func
+}
+
+# Fix failed case for large splat
+assert_equal 'true', %q{
+  def d(a, b=:b)
+  end
+
+  def calling_func
+    ary = 1380888.times;
+    d(*ary)
+  end
+  begin
+    calling_func
+  rescue ArgumentError
+    true
+  end
+}
+
+# Regression test: register allocator on expandarray
+assert_equal '[]', %q{
+  func = proc { [] }
+  proc do
+    _x, _y = func.call
+  end.call
+}
+
+# Catch TAG_BREAK in a non-FINISH frame with JIT code
+assert_equal '1', %q{
+  def entry
+    catch_break
+  end
+
+  def catch_break
+    while_true do
+      break
+    end
+    1
+  end
+
+  def while_true
+    while true
+      yield
+    end
+  end
+
+  entry
+}
+
+assert_equal '6', %q{
+  class Base
+    def number = 1 + yield
+  end
+
+  class Sub < Base
+    def number = super + 2
+  end
+
+  Sub.new.number { 3 }
+}
+
+# Integer multiplication and overflow
+assert_equal '[6, -6, 9671406556917033397649408, -9671406556917033397649408, 21267647932558653966460912964485513216]', %q{
+  def foo(a, b)
+    a * b
+  end
+
+  r1 = foo(2, 3)
+  r2 = foo(2, -3)
+  r3 = foo(2 << 40, 2 << 41)
+  r4 = foo(2 << 40, -2 << 41)
+  r5 = foo(1 << 62, 1 << 62)
+
+  [r1, r2, r3, r4, r5]
+}
+
+# Integer multiplication and overflow (minimized regression test from test-basic)
+assert_equal '8515157028618240000', %q{2128789257154560000 * 4}
+
+# Inlined method calls
+assert_equal 'nil', %q{
+  def putnil = nil
+  def entry = putnil
+  entry.inspect
+}
+assert_equal '1', %q{
+  def putobject_1 = 1
+  def entry = putobject_1
+  entry
+}
+assert_equal 'false', %q{
+  def putobject(_unused_arg1) = false
+  def entry = putobject(nil)
+  entry
+}
+assert_equal 'true', %q{
+  def entry = yield
+  entry { true }
+}
+assert_equal 'sym', %q{
+  def entry = :sym.to_sym
+  entry
+}
+
+assert_normal_exit %q{
+  ivars = 1024.times.map { |i| "@iv_#{i} = #{i}\n" }.join
+  Foo = Class.new
+  Foo.class_eval "def initialize() #{ivars} end"
+  Foo.new
+}
+
+assert_equal '0', %q{
+  def spill
+    1.to_i # not inlined
+  end
+
+  def inline(_stack1, _stack2, _stack3, _stack4, _stack5)
+    0 # inlined
+  end
+
+  def entry
+    # RegTemps is 00111110 prior to the #inline call.
+    # Its return value goes to stack_idx=0, which conflicts with stack_idx=5.
+    inline(spill, 2, 3, 4, 5)
+  end
+
+  entry
+}
+
+# Integer succ and overflow
+assert_equal '[2, 4611686018427387904]', %q{
+  [1.succ, 4611686018427387903.succ]
+}
+
+# Integer pred and overflow
+assert_equal '[0, -4611686018427387905]', %q{
+  [1.pred, -4611686018427387904.pred]
+}
+
+# Integer right shift
+assert_equal '[0, 1, -4]', %q{
+  [0 >> 1, 2 >> 1, -7 >> 1]
+}
+
+# Integer XOR
+assert_equal '[0, 0, 4]', %q{
+  [0 ^ 0, 1 ^ 1, 7 ^ 3]
+}
+
+assert_equal '[nil, "yield"]', %q{
+  def defined_yield = defined?(yield)
+  [defined_yield, defined_yield {}]
+}
+
+# splat with ruby2_keywords into rest parameter
+assert_equal '[[{a: 1}], {}]', %q{
+  ruby2_keywords def foo(*args) = args
+
+  def bar(*args, **kw) = [args, kw]
+
+  def pass_bar(*args) = bar(*args)
+
+  def body
+    args = foo(a: 1)
+    pass_bar(*args)
+  end
+
+  body
+}
+
+# concatarray
+assert_equal '[1, 2]', %q{
+  def foo(a, b) = [a, b]
+  arr = [2]
+  foo(*[1], *arr)
+}
+
+# pushtoarray
+assert_equal '[1, 2]', %q{
+  def foo(a, b) = [a, b]
+  arr = [1]
+  foo(*arr, 2)
+}
+
+# pop before fallback
+assert_normal_exit %q{
+  class Foo
+    attr_reader :foo
+
+    def try = foo(0, &nil)
+  end
+
+  Foo.new.try
+}
+
+# a kwrest case
+assert_equal '[1, 2, {complete: false}]', %q{
+  def rest(foo: 1, bar: 2, **kwrest)
+    [foo, bar, kwrest]
+  end
+
+  def callsite = rest(complete: false)
+
+  callsite
+}
+
+# splat+kw_splat+opt+rest
+assert_equal '[1, []]', %q{
+  def opt_rest(a = 0, *rest) = [a, rest]
+
+  def call_site(args) = opt_rest(*args, **nil)
+
+  call_site([1])
+}
+
+# splat and nil kw_splat
+assert_equal 'ok', %q{
+  def identity(x) = x
+
+  def splat_nil_kw_splat(args) = identity(*args, **nil)
+
+  splat_nil_kw_splat([:ok])
+}
+
+# empty splat and kwsplat into leaf builtins
+assert_equal '[1, 1, 1]', %q{
+  empty = []
+  [1.abs(*empty), 1.abs(**nil), 1.bit_length(*empty, **nil)]
+}
+
+# splat into C methods with -1 arity
+assert_equal '[[1, 2, 3], [0, 2, 3], [1, 2, 3], [2, 2, 3], [], [], [{}]]', %q{
+  class Foo < Array
+    def push(args) = super(1, *args)
+  end
+
+  def test_cfunc_vargs_splat(sub_instance, array_class, empty_kw_hash)
+    splat = [2, 3]
+    kw_splat = [empty_kw_hash]
+    [
+      sub_instance.push(splat),
+      array_class[0, *splat, **nil],
+      array_class[1, *splat, &nil],
+      array_class[2, *splat, **nil, &nil],
+      array_class.send(:[], *kw_splat),
+      # kw_splat disables keywords hash handling
+      array_class[*kw_splat],
+      array_class[*kw_splat, **nil],
+    ]
+  end
+
+  test_cfunc_vargs_splat(Foo.new, Array, Hash.ruby2_keywords_hash({}))
+}
+
+# Class#new (arity=-1), splat, and ruby2_keywords
+assert_equal '[0, {1 => 1}]', %q{
+  class KwInit
+    attr_reader :init_args
+    def initialize(x = 0, **kw)
+      @init_args = [x, kw]
+    end
+  end
+
+  def test(klass, args)
+    klass.new(*args).init_args
+  end
+
+  test(KwInit, [Hash.ruby2_keywords_hash({1 => 1})])
+}
+
+# Chilled string setivar trigger warning
+assert_match(/literal string will be frozen in the future/, %q{
+  Warning[:deprecated] = true
+  $VERBOSE = true
+  $warning = "no-warning"
+  module ::Warning
+    def self.warn(message)
+      $warning = message.split("warning: ").last.strip
+    end
+  end
+
+  class String
+    def setivar!
+      @ivar = 42
+    end
+  end
+
+  def setivar!(str)
+    str.setivar!
+  end
+
+  10.times { setivar!("mutable".dup) }
+  10.times do
+    setivar!("frozen".freeze)
+  rescue FrozenError
+  end
+
+  setivar!("chilled") # Emit warning
+  $warning
+})
+
+# arity=-2 cfuncs
+assert_equal '["", "1/2", [0, [:ok, 1]]]', %q{
+  def test_cases(file, chain)
+    new_chain = chain.allocate # to call initialize directly
+    new_chain.send(:initialize, [0], ok: 1)
+
+    [
+      file.join,
+      file.join("1", "2"),
+      new_chain.to_a,
+    ]
+  end
+
+  test_cases(File, Enumerator::Chain)
+}
+
+# singleton class should invalidate Type::CString assumption
+assert_equal 'foo', %q{
+  def define_singleton(str, define)
+    if define
+      # Wrap a C method frame to avoid exiting JIT code on defineclass
+      [nil].reverse_each do
+        class << str
+          def +(_)
+            "foo"
+          end
+        end
+      end
+    end
+    "bar"
+  end
+
+  def entry(define)
+    str = ""
+    # When `define` is false, #+ compiles to rb_str_plus() without a class guard.
+    # When the code is reused with `define` is true, the class of `str` is changed
+    # to a singleton class, so the block should be invalidated.
+    str + define_singleton(str, define)
+  end
+
+  entry(false)
+  entry(true)
+}
+
+assert_equal 'ok', %q{
+  def ok
+    :ok
+  end
+
+  def delegator(...)
+    ok(...)
+  end
+
+  def caller
+    send(:delegator)
+  end
+
+  caller
+}
+
+# test inlining of simple iseqs
+assert_equal '[:ok, :ok, :ok]', %q{
+  def identity(x) = x
+  def foo(x, _) = x
+  def bar(_, _, _, _, x) = x
+
+  def tests
+    [
+      identity(:ok),
+      foo(:ok, 2),
+      bar(1, 2, 3, 4, :ok),
+    ]
+  end
+
+  tests
+}
+
+# test inlining of simple iseqs with kwargs
+assert_equal '[:ok, :ok, :ok, :ok, :ok]', %q{
+  def optional_unused(x, opt: :not_ok) = x
+  def optional_used(x, opt: :ok) = opt
+  def required_unused(x, req:) = x
+  def required_used(x, req:) = req
+  def unknown(x) = x
+
+  def tests
+    [
+      optional_unused(:ok),
+      optional_used(:not_ok),
+      required_unused(:ok, req: :not_ok),
+      required_used(:not_ok, req: :ok),
+      begin unknown(:not_ok, unknown_kwarg: :not_ok) rescue ArgumentError; :ok end,
+    ]
+  end
+
+  tests
+}
+
+# test simple iseqs not eligible for inlining
+assert_equal '[:ok, :ok, :ok, :ok, :ok]', %q{
+  def identity(x) = x
+  def arg_splat(x, *args) = x
+  def kwarg_splat(x, **kwargs) = x
+  def block_arg(x, &blk) = x
+  def block_iseq(x) = x
+  def call_forwarding(...) = identity(...)
+
+  def tests
+    [
+      arg_splat(:ok),
+      kwarg_splat(:ok),
+      block_arg(:ok, &proc { :not_ok }),
+      block_iseq(:ok) { :not_ok },
+      call_forwarding(:ok),
+    ]
+  end
+
+  tests
+}
+
+# regression test for splat with &proc{} when the target has rest (Bug #21266)
+assert_equal '[]', %q{
+  def foo(args) = bar(*args, &proc { _1 })
+  def bar(_, _, _, _, *rest) = yield rest
+
+  GC.stress = true
+  foo([1,2,3,4])
+  foo([1,2,3,4])
+}
+
+# regression test for invalidating an empty block
+assert_equal '0', %q{
+  def foo = (* = 1).pred
+
+  foo # compile it
+
+  class Integer
+    def to_ary = [] # invalidate
+  end
+
+  foo # try again
+}
+
+# test integer left shift with constant rhs
+assert_equal [0x80000000000, 'a+', :ok].inspect, %q{
+  def shift(val) = val << 43
+
+  def tests
+    int = shift(1)
+    str = shift("a")
+
+    Integer.define_method(:<<) { |_| :ok }
+    redef = shift(1)
+
+    [int, str, redef]
+  end
+
+  tests
+}
+
+# test integer left shift fusion followed by opt_getconstant_path
+assert_equal '33', %q{
+  def test(a)
+    (a << 5) | (Object; a)
+  end
+
+  test(1)
+}
+
+# test String#stebyte with arguments that need conversion
+assert_equal "abc", %q{
+  str = +"a00"
+  def change_bytes(str, one, two)
+    str.setbyte(one, "b".ord)
+    str.setbyte(2, two)
+  end
+
+  to_int_1 = Object.new
+  to_int_99 = Object.new
+  def to_int_1.to_int = 1
+  def to_int_99.to_int = 99
+
+  change_bytes(str, to_int_1, to_int_99)
+  str
+}
+
+# test --yjit-verify-ctx for arrays with a singleton class
+assert_equal "ok", %q{
+  class Array
+    def foo
+      self.singleton_class.define_method(:first) { :ok }
+      first
+    end
+  end
+
+  def test = [].foo
+
+  test
+}
+
+assert_equal '["raised", "Module", "Object"]', %q{
+  def foo(obj)
+    obj.superclass.name
+  end
+
+  ret = []
+
+  begin
+    foo(Class.allocate)
+  rescue TypeError
+    ret << 'raised'
+  end
+
+  ret += [foo(Class), foo(Class.new)]
+}
+
+# test TrueClass#=== before and after redefining TrueClass#==
+assert_equal '[[true, false, false], [true, true, false], [true, :error, :error]]', %q{
+  def true_eqq(x)
+    true === x
+  rescue NoMethodError
+    :error
+  end
+
+  def test
+    [
+      # first one is always true because rb_equal does object comparison before calling #==
+      true_eqq(true),
+      # these will use TrueClass#==
+      true_eqq(false),
+      true_eqq(:truthy),
+    ]
+  end
+
+  results = [test]
+
+  class TrueClass
+    def ==(x)
+      !x
+    end
+  end
+
+  results << test
+
+  class TrueClass
+    undef_method :==
+  end
+
+  results << test
+}
+
+# test FalseClass#=== before and after redefining FalseClass#==
+assert_equal '[[true, false, false], [true, false, true], [true, :error, :error]]', %q{
+  def case_equal(x, y)
+    x === y
+  rescue NoMethodError
+    :error
+  end
+
+  def test
+    [
+      # first one is always true because rb_equal does object comparison before calling #==
+      case_equal(false, false),
+      # these will use #==
+      case_equal(false, true),
+      case_equal(false, nil),
+    ]
+  end
+
+  results = [test]
+
+  class FalseClass
+    def ==(x)
+      !x
+    end
+  end
+
+  results << test
+
+  class FalseClass
+    undef_method :==
+  end
+
+  results << test
+}
+
+# test NilClass#=== before and after redefining NilClass#==
+assert_equal '[[true, false, false], [true, false, true], [true, :error, :error]]', %q{
+  def case_equal(x, y)
+    x === y
+  rescue NoMethodError
+    :error
+  end
+
+  def test
+    [
+      # first one is always true because rb_equal does object comparison before calling #==
+      case_equal(nil, nil),
+      # these will use #==
+      case_equal(nil, true),
+      case_equal(nil, false),
+    ]
+  end
+
+  results = [test]
+
+  class NilClass
+    def ==(x)
+      !x
+    end
+  end
+
+  results << test
+
+  class NilClass
+    undef_method :==
+  end
+
+  results << test
+}
+
+# test struct accessors fire c_call events
+assert_equal '[[:c_call, :x=], [:c_call, :x]]', %q{
+  c = Struct.new(:x)
+  obj = c.new
+
+  events = []
+  TracePoint.new(:c_call) do
+    events << [_1.event, _1.method_id]
+  end.enable do
+    obj.x = 100
+    obj.x
+  end
+
+  events
+}
+
+# regression test for splatting empty array
+assert_equal '1', %q{
+  def callee(foo) = foo
+
+  def test_body(args) = callee(1, *args)
+
+  test_body([])
+  array = Array.new(100)
+  array.clear
+  test_body(array)
+}
+
+# regression test for splatting empty array to cfunc
+assert_normal_exit %q{
+  def test_body(args) = Array(1, *args)
+
+  test_body([])
+  0x100.times do
+    array = Array.new(100)
+    array.clear
+    test_body(array)
+  end
+}
+
+# compiling code shouldn't emit warnings as it may call into more Ruby code
+assert_equal 'ok', <<~'RUBY'
+  # [Bug #20522]
+  $VERBOSE = true
+  Warning[:performance] = true
+
+  module StrictWarnings
+    def warn(msg, **)
+      raise msg
+    end
+  end
+  Warning.singleton_class.prepend(StrictWarnings)
+
+  class A
+    def compiled_method(is_private)
+      @some_ivar = is_private
+    end
+  end
+
+  shape_max_variations = 8
+  if defined?(RubyVM::Shape::SHAPE_MAX_VARIATIONS) && RubyVM::Shape::SHAPE_MAX_VARIATIONS != shape_max_variations
+    raise "Expected SHAPE_MAX_VARIATIONS to be #{shape_max_variations}, got: #{RubyVM::Shape::SHAPE_MAX_VARIATIONS}"
+  end
+
+  100.times do |i|
+    klass = Class.new(A)
+    (shape_max_variations - 1).times do |j|
+      obj = klass.new
+      obj.instance_variable_set("@base_#{i}", 42)
+      obj.instance_variable_set("@ivar_#{j}", 42)
+    end
+    obj = klass.new
+    obj.instance_variable_set("@base_#{i}", 42)
+    begin
+      obj.compiled_method(true)
+    rescue
+      # expected
+    end
+  end
+
+  :ok
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+  class MyRelation
+    def callee(...)
+      :ok
+    end
+
+    def uncached(...)
+      callee(...)
+    end
+
+    def takes_block(&block)
+      # push blockhandler
+      uncached(&block) # CI1
+    end
+  end
+
+  relation = MyRelation.new
+  relation.takes_block { }
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+  def _exec_scope(...)
+    instance_exec(...)
+  end
+
+  def ok args, body
+    _exec_scope(*args, &body)
+  end
+
+  ok([], -> { "ok" })
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+  def _exec_scope(...)
+    instance_exec(...)
+  end
+
+  def ok args, body
+    _exec_scope(*args, &body)
+  end
+
+  ok(["ok"], ->(x) { x })
+RUBY
+
+assert_equal 'ok', <<~'RUBY'
+def baz(a, b)
+  a + b
+end
+
+def bar(...)
+  baz(...)
+end
+
+def foo(a, ...)
+  bar(a, ...)
+end
+
+def test
+  foo("o", "k")
+end
+
+test
+RUBY
+
+# opt_newarray_send pack/buffer
+assert_equal '[true, true]', <<~'RUBY'
+  def pack
+    v = 1.23
+    [v, v*2, v*3].pack("E*").unpack("E*") == [v, v*2, v*3]
+  end
+
+  def with_buffer
+    v = 4.56
+    b = +"x"
+    [v, v*2, v*3].pack("E*", buffer: b)
+    b[1..].unpack("E*") == [v, v*2, v*3]
+  end
+
+  [pack, with_buffer]
+RUBY
+
+# String#[] / String#slice
+assert_equal 'ok', <<~'RUBY'
+  def error(klass)
+    yield
+  rescue klass
+    true
+  end
+
+  def test
+    str = "こんにちは"
+    substr = "にち"
+    failures = []
+
+    # Use many small statements to keep context for each slice call smaller than MAX_CTX_TEMPS
+
+    str[1] == "ん" && str.slice(4) == "は" || failures << :index
+    str[5].nil? && str.slice(5).nil? || failures << :index_end
+
+    str[1, 2] == "んに" && str.slice(2, 1) == "に" || failures << :beg_len
+    str[5, 1] == "" && str.slice(5, 1) == "" || failures << :beg_len_end
+
+    str[1..2] == "んに" && str.slice(2..2) == "に" || failures << :range
+
+    str[/に./] == "にち" && str.slice(/に./) == "にち" || failures << :regexp
+
+    str[/に./, 0] == "にち" && str.slice(/に./, 0) == "にち" || failures << :regexp_cap0
+
+    str[/に(.)/, 1] == "ち" && str.slice(/に(.)/, 1) == "ち" || failures << :regexp_cap1
+
+    str[substr] == substr && str.slice(substr) == substr || failures << :substr
+
+    error(TypeError) { str[Object.new] } && error(TypeError) { str.slice(Object.new, 1) } || failures << :type_error
+    error(RangeError) { str[Float::INFINITY] } && error(RangeError) { str.slice(Float::INFINITY) } || failures << :range_error
+
+    return "ok" if failures.empty?
+    {failures: failures}
+  end
+
+  test
+RUBY
+
+# opt_duparray_send :include?
+assert_equal '[true, false]', <<~'RUBY'
+  def test(x)
+    [:a, :b].include?(x)
+  end
+
+  [
+    test(:b),
+    test(:c),
+  ]
+RUBY
+
+# opt_newarray_send :include?
+assert_equal '[true, false]', <<~'RUBY'
+  def test(x)
+    [Object.new, :a, :b].include?(x.to_sym)
+  end
+
+  [
+    test("b"),
+    test("c"),
+  ]
+RUBY
+
+# YARV: swap and opt_reverse
+assert_equal '["x", "Y", "c", "A", "t", "A", "b", "C", "d"]', <<~'RUBY'
+  class Swap
+    def initialize(s)
+      @a, @b, @c, @d = s.split("")
+    end
+
+    def swap
+      a, b = @a, @b
+      b = b.upcase
+      @a, @b = a, b
+    end
+
+    def reverse_odd
+      a, b, c = @a, @b, @c
+      b = b.upcase
+      @a, @b, @c = a, b, c
+    end
+
+    def reverse_even
+      a, b, c, d = @a, @b, @c, @d
+      a = a.upcase
+      c = c.upcase
+      @a, @b, @c, @d = a, b, c, d
+    end
+  end
+
+  Swap.new("xy").swap + Swap.new("cat").reverse_odd + Swap.new("abcd").reverse_even
+RUBY
+
+assert_normal_exit %{
+  class Bug20997
+    def foo(&) = self.class.name(&)
+
+    new.foo
+  end
+}
+
+# This used to trigger a "try to mark T_NONE"
+# due to an uninitialized local in foo.
+assert_normal_exit %{
+  def foo(...)
+    _local_that_should_nil_on_call = GC.start
+  end
+
+  def test_bug21021
+    puts [], [], [], [], [], []
+    foo []
+  end
+
+  GC.stress = true
+  test_bug21021
+}
+
+assert_equal 'nil', %{
+  def foo(...)
+    _a = _b = _c = binding.local_variable_get(:_c)
+
+    _c
+  end
+
+  # [Bug #21021]
+  def test_local_fill_in_forwardable
+    puts [], [], [], [], []
+    foo []
+  end
+
+  test_local_fill_in_forwardable.inspect
+}
+
+# Test defined?(yield) and block_given? in non-method context.
+# It's good that the body of this runs at true top level and isn't wrapped in a block.
+assert_equal 'false', %{
+  RESULT = []
+  RESULT << defined?(yield)
+  RESULT << block_given?
+
+  1.times do
+    RESULT << defined?(yield)
+    RESULT << block_given?
+  end
+
+  module ModuleContext
+    1.times do
+      RESULT << defined?(yield)
+      RESULT << block_given?
+    end
+  end
+
+  class << self
+    RESULT << defined?(yield)
+    RESULT << block_given?
+  end
+
+  RESULT.any?
+}
+
+# throw and String#dup with GC stress
+assert_equal 'foo', %{
+  GC.stress = true
+
+  def foo
+    1.times { return "foo".dup }
+  end
+
+  10.times.map { foo.dup }.last
+}
+
+# regression test for [Bug #21772]
+# local variable type tracking desync
+assert_normal_exit %q{
+  def some_method = 0
+
+  def test_body(key)
+    some_method
+    key = key.to_s # setting of local relevant
+
+    key == "symbol"
+  end
+
+  def jit_caller = test_body("session_id")
+
+  jit_caller # first iteration, non-escaped environment
+  alias some_method binding # induce environment escape
+  test_body(:symbol)
+}
+
+# regression test for missing check in identity method inlining
+assert_normal_exit %q{
+  # Use dead code (if false) to create a local
+  # without initialization instructions.
+  def foo(a)
+    if false
+      x = nil
+    end
+    x
+  end
+  def test = foo(1)
+  test
+  test
+}
+
+# regression test for tracing invalidation with on-stack compiled methods
+# Exercises the on_stack_iseqs path in rb_yjit_tracing_invalidate_all
+# where delayed deallocation must not create aliasing &mut references
+# to IseqPayload (use-after-free of version_map backing storage).
+assert_normal_exit %q{
+  def deep = 42
+  def mid = deep
+  def outer = mid
+
+  # Compile all three methods with YJIT
+  10.times { outer }
+
+  # Enable tracing from within a call chain so that outer/mid/deep
+  # are on the stack when rb_yjit_tracing_invalidate_all runs.
+  # This triggers the on_stack_iseqs (delayed deallocation) path.
+  def deep
+    TracePoint.new(:line) {}.enable
+    42
+  end
+
+  outer
+
+  # After invalidation, verify YJIT can recompile and run correctly
+  def deep = 42
+  10.times { outer }
+}
+
+# regression test for tracing invalidation with on-stack fibers
+# Suspended fibers have iseqs on their stack that must survive invalidation.
+assert_equal '42', %q{
+  def compiled_method
+    Fiber.yield
+    42
+  end
+
+  # Compile the method
+  10.times { compiled_method rescue nil }
+
+  fiber = Fiber.new { compiled_method }
+  fiber.resume # suspends inside compiled_method — it's now on the fiber's stack
+
+  # Enable tracing while compiled_method is on the fiber's stack.
+  # This triggers rb_yjit_tracing_invalidate_all with on-stack iseqs.
+  TracePoint.new(:call) {}.enable
+
+  # Resume the fiber — compiled_method's iseq must still be valid
+  fiber.resume.to_s
+}
+
+# regression test for register mapping of methods with over 256 locals
+# [Bug #22074]
+assert_equal "ok", %q{
+  source = +"def many_locals\n"
+  source << "  total = 0\n"
+
+  128.times do |i|
+    source << "  y#{i} = 1\n"
+    source << "  x#{i} = Object.new\n"
+  end
+
+  source << "  total += 1\n"
+  source << "  raise total.inspect unless total == 1\n"
+  source << "end\n"
+
+  eval(source)
+  many_locals
+  "ok"
+}
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)
+    end
+end
+
+def fun_l6_n348(x)
+    if (x < 1)
+        fun_l7_n249(x)
+    else
+        fun_l7_n200(x)
+    end
+end
+
+def fun_l6_n349(x)
+    if (x < 1)
+        fun_l7_n11(x)
+    else
+        fun_l7_n550(x)
+    end
+end
+
+def fun_l6_n350(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n351(x)
+    if (x < 1)
+        fun_l7_n422(x)
+    else
+        fun_l7_n242(x)
+    end
+end
+
+def fun_l6_n352(x)
+    if (x < 1)
+        fun_l7_n653(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n353(x)
+    if (x < 1)
+        fun_l7_n605(x)
+    else
+        fun_l7_n129(x)
+    end
+end
+
+def fun_l6_n354(x)
+    if (x < 1)
+        fun_l7_n622(x)
+    else
+        fun_l7_n172(x)
+    end
+end
+
+def fun_l6_n355(x)
+    if (x < 1)
+        fun_l7_n568(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n356(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n818(x)
+    end
+end
+
+def fun_l6_n357(x)
+    if (x < 1)
+        fun_l7_n807(x)
+    else
+        fun_l7_n642(x)
+    end
+end
+
+def fun_l6_n358(x)
+    if (x < 1)
+        fun_l7_n745(x)
+    else
+        fun_l7_n866(x)
+    end
+end
+
+def fun_l6_n359(x)
+    if (x < 1)
+        fun_l7_n603(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n360(x)
+    if (x < 1)
+        fun_l7_n818(x)
+    else
+        fun_l7_n203(x)
+    end
+end
+
+def fun_l6_n361(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n362(x)
+    if (x < 1)
+        fun_l7_n31(x)
+    else
+        fun_l7_n148(x)
+    end
+end
+
+def fun_l6_n363(x)
+    if (x < 1)
+        fun_l7_n148(x)
+    else
+        fun_l7_n292(x)
+    end
+end
+
+def fun_l6_n364(x)
+    if (x < 1)
+        fun_l7_n175(x)
+    else
+        fun_l7_n849(x)
+    end
+end
+
+def fun_l6_n365(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n57(x)
+    end
+end
+
+def fun_l6_n366(x)
+    if (x < 1)
+        fun_l7_n771(x)
+    else
+        fun_l7_n625(x)
+    end
+end
+
+def fun_l6_n367(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n108(x)
+    end
+end
+
+def fun_l6_n368(x)
+    if (x < 1)
+        fun_l7_n123(x)
+    else
+        fun_l7_n413(x)
+    end
+end
+
+def fun_l6_n369(x)
+    if (x < 1)
+        fun_l7_n587(x)
+    else
+        fun_l7_n876(x)
+    end
+end
+
+def fun_l6_n370(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n531(x)
+    end
+end
+
+def fun_l6_n371(x)
+    if (x < 1)
+        fun_l7_n55(x)
+    else
+        fun_l7_n859(x)
+    end
+end
+
+def fun_l6_n372(x)
+    if (x < 1)
+        fun_l7_n848(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n373(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n976(x)
+    end
+end
+
+def fun_l6_n374(x)
+    if (x < 1)
+        fun_l7_n298(x)
+    else
+        fun_l7_n844(x)
+    end
+end
+
+def fun_l6_n375(x)
+    if (x < 1)
+        fun_l7_n564(x)
+    else
+        fun_l7_n960(x)
+    end
+end
+
+def fun_l6_n376(x)
+    if (x < 1)
+        fun_l7_n684(x)
+    else
+        fun_l7_n181(x)
+    end
+end
+
+def fun_l6_n377(x)
+    if (x < 1)
+        fun_l7_n153(x)
+    else
+        fun_l7_n21(x)
+    end
+end
+
+def fun_l6_n378(x)
+    if (x < 1)
+        fun_l7_n377(x)
+    else
+        fun_l7_n761(x)
+    end
+end
+
+def fun_l6_n379(x)
+    if (x < 1)
+        fun_l7_n737(x)
+    else
+        fun_l7_n605(x)
+    end
+end
+
+def fun_l6_n380(x)
+    if (x < 1)
+        fun_l7_n536(x)
+    else
+        fun_l7_n143(x)
+    end
+end
+
+def fun_l6_n381(x)
+    if (x < 1)
+        fun_l7_n314(x)
+    else
+        fun_l7_n999(x)
+    end
+end
+
+def fun_l6_n382(x)
+    if (x < 1)
+        fun_l7_n995(x)
+    else
+        fun_l7_n564(x)
+    end
+end
+
+def fun_l6_n383(x)
+    if (x < 1)
+        fun_l7_n772(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n384(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n142(x)
+    end
+end
+
+def fun_l6_n385(x)
+    if (x < 1)
+        fun_l7_n993(x)
+    else
+        fun_l7_n987(x)
+    end
+end
+
+def fun_l6_n386(x)
+    if (x < 1)
+        fun_l7_n717(x)
+    else
+        fun_l7_n674(x)
+    end
+end
+
+def fun_l6_n387(x)
+    if (x < 1)
+        fun_l7_n585(x)
+    else
+        fun_l7_n102(x)
+    end
+end
+
+def fun_l6_n388(x)
+    if (x < 1)
+        fun_l7_n779(x)
+    else
+        fun_l7_n110(x)
+    end
+end
+
+def fun_l6_n389(x)
+    if (x < 1)
+        fun_l7_n815(x)
+    else
+        fun_l7_n194(x)
+    end
+end
+
+def fun_l6_n390(x)
+    if (x < 1)
+        fun_l7_n261(x)
+    else
+        fun_l7_n30(x)
+    end
+end
+
+def fun_l6_n391(x)
+    if (x < 1)
+        fun_l7_n746(x)
+    else
+        fun_l7_n207(x)
+    end
+end
+
+def fun_l6_n392(x)
+    if (x < 1)
+        fun_l7_n866(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n393(x)
+    if (x < 1)
+        fun_l7_n47(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n394(x)
+    if (x < 1)
+        fun_l7_n140(x)
+    else
+        fun_l7_n104(x)
+    end
+end
+
+def fun_l6_n395(x)
+    if (x < 1)
+        fun_l7_n170(x)
+    else
+        fun_l7_n93(x)
+    end
+end
+
+def fun_l6_n396(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n218(x)
+    end
+end
+
+def fun_l6_n397(x)
+    if (x < 1)
+        fun_l7_n268(x)
+    else
+        fun_l7_n278(x)
+    end
+end
+
+def fun_l6_n398(x)
+    if (x < 1)
+        fun_l7_n859(x)
+    else
+        fun_l7_n888(x)
+    end
+end
+
+def fun_l6_n399(x)
+    if (x < 1)
+        fun_l7_n540(x)
+    else
+        fun_l7_n218(x)
+    end
+end
+
+def fun_l6_n400(x)
+    if (x < 1)
+        fun_l7_n148(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n401(x)
+    if (x < 1)
+        fun_l7_n169(x)
+    else
+        fun_l7_n310(x)
+    end
+end
+
+def fun_l6_n402(x)
+    if (x < 1)
+        fun_l7_n256(x)
+    else
+        fun_l7_n336(x)
+    end
+end
+
+def fun_l6_n403(x)
+    if (x < 1)
+        fun_l7_n257(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n404(x)
+    if (x < 1)
+        fun_l7_n47(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n405(x)
+    if (x < 1)
+        fun_l7_n913(x)
+    else
+        fun_l7_n705(x)
+    end
+end
+
+def fun_l6_n406(x)
+    if (x < 1)
+        fun_l7_n816(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n407(x)
+    if (x < 1)
+        fun_l7_n506(x)
+    else
+        fun_l7_n772(x)
+    end
+end
+
+def fun_l6_n408(x)
+    if (x < 1)
+        fun_l7_n983(x)
+    else
+        fun_l7_n973(x)
+    end
+end
+
+def fun_l6_n409(x)
+    if (x < 1)
+        fun_l7_n752(x)
+    else
+        fun_l7_n543(x)
+    end
+end
+
+def fun_l6_n410(x)
+    if (x < 1)
+        fun_l7_n580(x)
+    else
+        fun_l7_n265(x)
+    end
+end
+
+def fun_l6_n411(x)
+    if (x < 1)
+        fun_l7_n744(x)
+    else
+        fun_l7_n736(x)
+    end
+end
+
+def fun_l6_n412(x)
+    if (x < 1)
+        fun_l7_n950(x)
+    else
+        fun_l7_n5(x)
+    end
+end
+
+def fun_l6_n413(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n414(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n113(x)
+    end
+end
+
+def fun_l6_n415(x)
+    if (x < 1)
+        fun_l7_n621(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n416(x)
+    if (x < 1)
+        fun_l7_n598(x)
+    else
+        fun_l7_n872(x)
+    end
+end
+
+def fun_l6_n417(x)
+    if (x < 1)
+        fun_l7_n811(x)
+    else
+        fun_l7_n734(x)
+    end
+end
+
+def fun_l6_n418(x)
+    if (x < 1)
+        fun_l7_n18(x)
+    else
+        fun_l7_n405(x)
+    end
+end
+
+def fun_l6_n419(x)
+    if (x < 1)
+        fun_l7_n89(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n420(x)
+    if (x < 1)
+        fun_l7_n438(x)
+    else
+        fun_l7_n452(x)
+    end
+end
+
+def fun_l6_n421(x)
+    if (x < 1)
+        fun_l7_n601(x)
+    else
+        fun_l7_n777(x)
+    end
+end
+
+def fun_l6_n422(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n423(x)
+    if (x < 1)
+        fun_l7_n636(x)
+    else
+        fun_l7_n137(x)
+    end
+end
+
+def fun_l6_n424(x)
+    if (x < 1)
+        fun_l7_n222(x)
+    else
+        fun_l7_n838(x)
+    end
+end
+
+def fun_l6_n425(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n175(x)
+    end
+end
+
+def fun_l6_n426(x)
+    if (x < 1)
+        fun_l7_n629(x)
+    else
+        fun_l7_n376(x)
+    end
+end
+
+def fun_l6_n427(x)
+    if (x < 1)
+        fun_l7_n293(x)
+    else
+        fun_l7_n517(x)
+    end
+end
+
+def fun_l6_n428(x)
+    if (x < 1)
+        fun_l7_n859(x)
+    else
+        fun_l7_n129(x)
+    end
+end
+
+def fun_l6_n429(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n647(x)
+    end
+end
+
+def fun_l6_n430(x)
+    if (x < 1)
+        fun_l7_n117(x)
+    else
+        fun_l7_n291(x)
+    end
+end
+
+def fun_l6_n431(x)
+    if (x < 1)
+        fun_l7_n505(x)
+    else
+        fun_l7_n938(x)
+    end
+end
+
+def fun_l6_n432(x)
+    if (x < 1)
+        fun_l7_n536(x)
+    else
+        fun_l7_n303(x)
+    end
+end
+
+def fun_l6_n433(x)
+    if (x < 1)
+        fun_l7_n443(x)
+    else
+        fun_l7_n945(x)
+    end
+end
+
+def fun_l6_n434(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n435(x)
+    if (x < 1)
+        fun_l7_n273(x)
+    else
+        fun_l7_n704(x)
+    end
+end
+
+def fun_l6_n436(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n437(x)
+    if (x < 1)
+        fun_l7_n628(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n438(x)
+    if (x < 1)
+        fun_l7_n361(x)
+    else
+        fun_l7_n506(x)
+    end
+end
+
+def fun_l6_n439(x)
+    if (x < 1)
+        fun_l7_n8(x)
+    else
+        fun_l7_n721(x)
+    end
+end
+
+def fun_l6_n440(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n372(x)
+    end
+end
+
+def fun_l6_n441(x)
+    if (x < 1)
+        fun_l7_n988(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n442(x)
+    if (x < 1)
+        fun_l7_n5(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n443(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n776(x)
+    end
+end
+
+def fun_l6_n444(x)
+    if (x < 1)
+        fun_l7_n194(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n445(x)
+    if (x < 1)
+        fun_l7_n613(x)
+    else
+        fun_l7_n977(x)
+    end
+end
+
+def fun_l6_n446(x)
+    if (x < 1)
+        fun_l7_n23(x)
+    else
+        fun_l7_n311(x)
+    end
+end
+
+def fun_l6_n447(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n8(x)
+    end
+end
+
+def fun_l6_n448(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n229(x)
+    end
+end
+
+def fun_l6_n449(x)
+    if (x < 1)
+        fun_l7_n222(x)
+    else
+        fun_l7_n620(x)
+    end
+end
+
+def fun_l6_n450(x)
+    if (x < 1)
+        fun_l7_n599(x)
+    else
+        fun_l7_n468(x)
+    end
+end
+
+def fun_l6_n451(x)
+    if (x < 1)
+        fun_l7_n347(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n452(x)
+    if (x < 1)
+        fun_l7_n95(x)
+    else
+        fun_l7_n482(x)
+    end
+end
+
+def fun_l6_n453(x)
+    if (x < 1)
+        fun_l7_n217(x)
+    else
+        fun_l7_n419(x)
+    end
+end
+
+def fun_l6_n454(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n609(x)
+    end
+end
+
+def fun_l6_n455(x)
+    if (x < 1)
+        fun_l7_n932(x)
+    else
+        fun_l7_n744(x)
+    end
+end
+
+def fun_l6_n456(x)
+    if (x < 1)
+        fun_l7_n901(x)
+    else
+        fun_l7_n882(x)
+    end
+end
+
+def fun_l6_n457(x)
+    if (x < 1)
+        fun_l7_n368(x)
+    else
+        fun_l7_n441(x)
+    end
+end
+
+def fun_l6_n458(x)
+    if (x < 1)
+        fun_l7_n49(x)
+    else
+        fun_l7_n135(x)
+    end
+end
+
+def fun_l6_n459(x)
+    if (x < 1)
+        fun_l7_n228(x)
+    else
+        fun_l7_n899(x)
+    end
+end
+
+def fun_l6_n460(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n190(x)
+    end
+end
+
+def fun_l6_n461(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n670(x)
+    end
+end
+
+def fun_l6_n462(x)
+    if (x < 1)
+        fun_l7_n961(x)
+    else
+        fun_l7_n769(x)
+    end
+end
+
+def fun_l6_n463(x)
+    if (x < 1)
+        fun_l7_n828(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n464(x)
+    if (x < 1)
+        fun_l7_n17(x)
+    else
+        fun_l7_n345(x)
+    end
+end
+
+def fun_l6_n465(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n498(x)
+    end
+end
+
+def fun_l6_n466(x)
+    if (x < 1)
+        fun_l7_n659(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n467(x)
+    if (x < 1)
+        fun_l7_n528(x)
+    else
+        fun_l7_n138(x)
+    end
+end
+
+def fun_l6_n468(x)
+    if (x < 1)
+        fun_l7_n272(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n469(x)
+    if (x < 1)
+        fun_l7_n458(x)
+    else
+        fun_l7_n430(x)
+    end
+end
+
+def fun_l6_n470(x)
+    if (x < 1)
+        fun_l7_n192(x)
+    else
+        fun_l7_n755(x)
+    end
+end
+
+def fun_l6_n471(x)
+    if (x < 1)
+        fun_l7_n188(x)
+    else
+        fun_l7_n827(x)
+    end
+end
+
+def fun_l6_n472(x)
+    if (x < 1)
+        fun_l7_n467(x)
+    else
+        fun_l7_n167(x)
+    end
+end
+
+def fun_l6_n473(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n823(x)
+    end
+end
+
+def fun_l6_n474(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n120(x)
+    end
+end
+
+def fun_l6_n475(x)
+    if (x < 1)
+        fun_l7_n199(x)
+    else
+        fun_l7_n25(x)
+    end
+end
+
+def fun_l6_n476(x)
+    if (x < 1)
+        fun_l7_n812(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n477(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n478(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n157(x)
+    end
+end
+
+def fun_l6_n479(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n172(x)
+    end
+end
+
+def fun_l6_n480(x)
+    if (x < 1)
+        fun_l7_n295(x)
+    else
+        fun_l7_n230(x)
+    end
+end
+
+def fun_l6_n481(x)
+    if (x < 1)
+        fun_l7_n619(x)
+    else
+        fun_l7_n495(x)
+    end
+end
+
+def fun_l6_n482(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n30(x)
+    end
+end
+
+def fun_l6_n483(x)
+    if (x < 1)
+        fun_l7_n236(x)
+    else
+        fun_l7_n842(x)
+    end
+end
+
+def fun_l6_n484(x)
+    if (x < 1)
+        fun_l7_n59(x)
+    else
+        fun_l7_n341(x)
+    end
+end
+
+def fun_l6_n485(x)
+    if (x < 1)
+        fun_l7_n841(x)
+    else
+        fun_l7_n67(x)
+    end
+end
+
+def fun_l6_n486(x)
+    if (x < 1)
+        fun_l7_n299(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n487(x)
+    if (x < 1)
+        fun_l7_n672(x)
+    else
+        fun_l7_n682(x)
+    end
+end
+
+def fun_l6_n488(x)
+    if (x < 1)
+        fun_l7_n110(x)
+    else
+        fun_l7_n231(x)
+    end
+end
+
+def fun_l6_n489(x)
+    if (x < 1)
+        fun_l7_n984(x)
+    else
+        fun_l7_n583(x)
+    end
+end
+
+def fun_l6_n490(x)
+    if (x < 1)
+        fun_l7_n354(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n491(x)
+    if (x < 1)
+        fun_l7_n541(x)
+    else
+        fun_l7_n583(x)
+    end
+end
+
+def fun_l6_n492(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n209(x)
+    end
+end
+
+def fun_l6_n493(x)
+    if (x < 1)
+        fun_l7_n547(x)
+    else
+        fun_l7_n982(x)
+    end
+end
+
+def fun_l6_n494(x)
+    if (x < 1)
+        fun_l7_n3(x)
+    else
+        fun_l7_n230(x)
+    end
+end
+
+def fun_l6_n495(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n496(x)
+    if (x < 1)
+        fun_l7_n927(x)
+    else
+        fun_l7_n934(x)
+    end
+end
+
+def fun_l6_n497(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n342(x)
+    end
+end
+
+def fun_l6_n498(x)
+    if (x < 1)
+        fun_l7_n973(x)
+    else
+        fun_l7_n106(x)
+    end
+end
+
+def fun_l6_n499(x)
+    if (x < 1)
+        fun_l7_n373(x)
+    else
+        fun_l7_n558(x)
+    end
+end
+
+def fun_l6_n500(x)
+    if (x < 1)
+        fun_l7_n835(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n501(x)
+    if (x < 1)
+        fun_l7_n135(x)
+    else
+        fun_l7_n997(x)
+    end
+end
+
+def fun_l6_n502(x)
+    if (x < 1)
+        fun_l7_n129(x)
+    else
+        fun_l7_n530(x)
+    end
+end
+
+def fun_l6_n503(x)
+    if (x < 1)
+        fun_l7_n924(x)
+    else
+        fun_l7_n611(x)
+    end
+end
+
+def fun_l6_n504(x)
+    if (x < 1)
+        fun_l7_n125(x)
+    else
+        fun_l7_n26(x)
+    end
+end
+
+def fun_l6_n505(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n50(x)
+    end
+end
+
+def fun_l6_n506(x)
+    if (x < 1)
+        fun_l7_n220(x)
+    else
+        fun_l7_n787(x)
+    end
+end
+
+def fun_l6_n507(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n15(x)
+    end
+end
+
+def fun_l6_n508(x)
+    if (x < 1)
+        fun_l7_n475(x)
+    else
+        fun_l7_n899(x)
+    end
+end
+
+def fun_l6_n509(x)
+    if (x < 1)
+        fun_l7_n704(x)
+    else
+        fun_l7_n559(x)
+    end
+end
+
+def fun_l6_n510(x)
+    if (x < 1)
+        fun_l7_n625(x)
+    else
+        fun_l7_n73(x)
+    end
+end
+
+def fun_l6_n511(x)
+    if (x < 1)
+        fun_l7_n234(x)
+    else
+        fun_l7_n166(x)
+    end
+end
+
+def fun_l6_n512(x)
+    if (x < 1)
+        fun_l7_n502(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n513(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n643(x)
+    end
+end
+
+def fun_l6_n514(x)
+    if (x < 1)
+        fun_l7_n804(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n515(x)
+    if (x < 1)
+        fun_l7_n365(x)
+    else
+        fun_l7_n102(x)
+    end
+end
+
+def fun_l6_n516(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n517(x)
+    if (x < 1)
+        fun_l7_n695(x)
+    else
+        fun_l7_n936(x)
+    end
+end
+
+def fun_l6_n518(x)
+    if (x < 1)
+        fun_l7_n220(x)
+    else
+        fun_l7_n884(x)
+    end
+end
+
+def fun_l6_n519(x)
+    if (x < 1)
+        fun_l7_n602(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n520(x)
+    if (x < 1)
+        fun_l7_n409(x)
+    else
+        fun_l7_n861(x)
+    end
+end
+
+def fun_l6_n521(x)
+    if (x < 1)
+        fun_l7_n258(x)
+    else
+        fun_l7_n768(x)
+    end
+end
+
+def fun_l6_n522(x)
+    if (x < 1)
+        fun_l7_n878(x)
+    else
+        fun_l7_n503(x)
+    end
+end
+
+def fun_l6_n523(x)
+    if (x < 1)
+        fun_l7_n570(x)
+    else
+        fun_l7_n675(x)
+    end
+end
+
+def fun_l6_n524(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n748(x)
+    end
+end
+
+def fun_l6_n525(x)
+    if (x < 1)
+        fun_l7_n729(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n526(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n70(x)
+    end
+end
+
+def fun_l6_n527(x)
+    if (x < 1)
+        fun_l7_n235(x)
+    else
+        fun_l7_n606(x)
+    end
+end
+
+def fun_l6_n528(x)
+    if (x < 1)
+        fun_l7_n67(x)
+    else
+        fun_l7_n399(x)
+    end
+end
+
+def fun_l6_n529(x)
+    if (x < 1)
+        fun_l7_n706(x)
+    else
+        fun_l7_n150(x)
+    end
+end
+
+def fun_l6_n530(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n531(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n329(x)
+    end
+end
+
+def fun_l6_n532(x)
+    if (x < 1)
+        fun_l7_n392(x)
+    else
+        fun_l7_n970(x)
+    end
+end
+
+def fun_l6_n533(x)
+    if (x < 1)
+        fun_l7_n466(x)
+    else
+        fun_l7_n260(x)
+    end
+end
+
+def fun_l6_n534(x)
+    if (x < 1)
+        fun_l7_n957(x)
+    else
+        fun_l7_n417(x)
+    end
+end
+
+def fun_l6_n535(x)
+    if (x < 1)
+        fun_l7_n184(x)
+    else
+        fun_l7_n188(x)
+    end
+end
+
+def fun_l6_n536(x)
+    if (x < 1)
+        fun_l7_n298(x)
+    else
+        fun_l7_n192(x)
+    end
+end
+
+def fun_l6_n537(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n309(x)
+    end
+end
+
+def fun_l6_n538(x)
+    if (x < 1)
+        fun_l7_n801(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n539(x)
+    if (x < 1)
+        fun_l7_n894(x)
+    else
+        fun_l7_n973(x)
+    end
+end
+
+def fun_l6_n540(x)
+    if (x < 1)
+        fun_l7_n895(x)
+    else
+        fun_l7_n231(x)
+    end
+end
+
+def fun_l6_n541(x)
+    if (x < 1)
+        fun_l7_n728(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n542(x)
+    if (x < 1)
+        fun_l7_n655(x)
+    else
+        fun_l7_n845(x)
+    end
+end
+
+def fun_l6_n543(x)
+    if (x < 1)
+        fun_l7_n952(x)
+    else
+        fun_l7_n484(x)
+    end
+end
+
+def fun_l6_n544(x)
+    if (x < 1)
+        fun_l7_n835(x)
+    else
+        fun_l7_n187(x)
+    end
+end
+
+def fun_l6_n545(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n460(x)
+    end
+end
+
+def fun_l6_n546(x)
+    if (x < 1)
+        fun_l7_n734(x)
+    else
+        fun_l7_n165(x)
+    end
+end
+
+def fun_l6_n547(x)
+    if (x < 1)
+        fun_l7_n499(x)
+    else
+        fun_l7_n133(x)
+    end
+end
+
+def fun_l6_n548(x)
+    if (x < 1)
+        fun_l7_n751(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n549(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n550(x)
+    if (x < 1)
+        fun_l7_n320(x)
+    else
+        fun_l7_n308(x)
+    end
+end
+
+def fun_l6_n551(x)
+    if (x < 1)
+        fun_l7_n182(x)
+    else
+        fun_l7_n144(x)
+    end
+end
+
+def fun_l6_n552(x)
+    if (x < 1)
+        fun_l7_n683(x)
+    else
+        fun_l7_n691(x)
+    end
+end
+
+def fun_l6_n553(x)
+    if (x < 1)
+        fun_l7_n502(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n554(x)
+    if (x < 1)
+        fun_l7_n60(x)
+    else
+        fun_l7_n551(x)
+    end
+end
+
+def fun_l6_n555(x)
+    if (x < 1)
+        fun_l7_n185(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n556(x)
+    if (x < 1)
+        fun_l7_n140(x)
+    else
+        fun_l7_n725(x)
+    end
+end
+
+def fun_l6_n557(x)
+    if (x < 1)
+        fun_l7_n76(x)
+    else
+        fun_l7_n501(x)
+    end
+end
+
+def fun_l6_n558(x)
+    if (x < 1)
+        fun_l7_n553(x)
+    else
+        fun_l7_n146(x)
+    end
+end
+
+def fun_l6_n559(x)
+    if (x < 1)
+        fun_l7_n535(x)
+    else
+        fun_l7_n17(x)
+    end
+end
+
+def fun_l6_n560(x)
+    if (x < 1)
+        fun_l7_n566(x)
+    else
+        fun_l7_n773(x)
+    end
+end
+
+def fun_l6_n561(x)
+    if (x < 1)
+        fun_l7_n358(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n562(x)
+    if (x < 1)
+        fun_l7_n492(x)
+    else
+        fun_l7_n478(x)
+    end
+end
+
+def fun_l6_n563(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n906(x)
+    end
+end
+
+def fun_l6_n564(x)
+    if (x < 1)
+        fun_l7_n751(x)
+    else
+        fun_l7_n546(x)
+    end
+end
+
+def fun_l6_n565(x)
+    if (x < 1)
+        fun_l7_n179(x)
+    else
+        fun_l7_n49(x)
+    end
+end
+
+def fun_l6_n566(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n440(x)
+    end
+end
+
+def fun_l6_n567(x)
+    if (x < 1)
+        fun_l7_n715(x)
+    else
+        fun_l7_n862(x)
+    end
+end
+
+def fun_l6_n568(x)
+    if (x < 1)
+        fun_l7_n124(x)
+    else
+        fun_l7_n191(x)
+    end
+end
+
+def fun_l6_n569(x)
+    if (x < 1)
+        fun_l7_n709(x)
+    else
+        fun_l7_n704(x)
+    end
+end
+
+def fun_l6_n570(x)
+    if (x < 1)
+        fun_l7_n864(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n571(x)
+    if (x < 1)
+        fun_l7_n302(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n572(x)
+    if (x < 1)
+        fun_l7_n488(x)
+    else
+        fun_l7_n570(x)
+    end
+end
+
+def fun_l6_n573(x)
+    if (x < 1)
+        fun_l7_n590(x)
+    else
+        fun_l7_n560(x)
+    end
+end
+
+def fun_l6_n574(x)
+    if (x < 1)
+        fun_l7_n38(x)
+    else
+        fun_l7_n444(x)
+    end
+end
+
+def fun_l6_n575(x)
+    if (x < 1)
+        fun_l7_n401(x)
+    else
+        fun_l7_n359(x)
+    end
+end
+
+def fun_l6_n576(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n240(x)
+    end
+end
+
+def fun_l6_n577(x)
+    if (x < 1)
+        fun_l7_n247(x)
+    else
+        fun_l7_n540(x)
+    end
+end
+
+def fun_l6_n578(x)
+    if (x < 1)
+        fun_l7_n223(x)
+    else
+        fun_l7_n729(x)
+    end
+end
+
+def fun_l6_n579(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n684(x)
+    end
+end
+
+def fun_l6_n580(x)
+    if (x < 1)
+        fun_l7_n113(x)
+    else
+        fun_l7_n865(x)
+    end
+end
+
+def fun_l6_n581(x)
+    if (x < 1)
+        fun_l7_n920(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n582(x)
+    if (x < 1)
+        fun_l7_n78(x)
+    else
+        fun_l7_n85(x)
+    end
+end
+
+def fun_l6_n583(x)
+    if (x < 1)
+        fun_l7_n713(x)
+    else
+        fun_l7_n110(x)
+    end
+end
+
+def fun_l6_n584(x)
+    if (x < 1)
+        fun_l7_n170(x)
+    else
+        fun_l7_n183(x)
+    end
+end
+
+def fun_l6_n585(x)
+    if (x < 1)
+        fun_l7_n100(x)
+    else
+        fun_l7_n215(x)
+    end
+end
+
+def fun_l6_n586(x)
+    if (x < 1)
+        fun_l7_n126(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n587(x)
+    if (x < 1)
+        fun_l7_n592(x)
+    else
+        fun_l7_n502(x)
+    end
+end
+
+def fun_l6_n588(x)
+    if (x < 1)
+        fun_l7_n155(x)
+    else
+        fun_l7_n591(x)
+    end
+end
+
+def fun_l6_n589(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n590(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n849(x)
+    end
+end
+
+def fun_l6_n591(x)
+    if (x < 1)
+        fun_l7_n161(x)
+    else
+        fun_l7_n884(x)
+    end
+end
+
+def fun_l6_n592(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n341(x)
+    end
+end
+
+def fun_l6_n593(x)
+    if (x < 1)
+        fun_l7_n974(x)
+    else
+        fun_l7_n355(x)
+    end
+end
+
+def fun_l6_n594(x)
+    if (x < 1)
+        fun_l7_n726(x)
+    else
+        fun_l7_n266(x)
+    end
+end
+
+def fun_l6_n595(x)
+    if (x < 1)
+        fun_l7_n142(x)
+    else
+        fun_l7_n154(x)
+    end
+end
+
+def fun_l6_n596(x)
+    if (x < 1)
+        fun_l7_n287(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n597(x)
+    if (x < 1)
+        fun_l7_n594(x)
+    else
+        fun_l7_n424(x)
+    end
+end
+
+def fun_l6_n598(x)
+    if (x < 1)
+        fun_l7_n227(x)
+    else
+        fun_l7_n445(x)
+    end
+end
+
+def fun_l6_n599(x)
+    if (x < 1)
+        fun_l7_n660(x)
+    else
+        fun_l7_n464(x)
+    end
+end
+
+def fun_l6_n600(x)
+    if (x < 1)
+        fun_l7_n930(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n601(x)
+    if (x < 1)
+        fun_l7_n714(x)
+    else
+        fun_l7_n984(x)
+    end
+end
+
+def fun_l6_n602(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n316(x)
+    end
+end
+
+def fun_l6_n603(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n563(x)
+    end
+end
+
+def fun_l6_n604(x)
+    if (x < 1)
+        fun_l7_n149(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n605(x)
+    if (x < 1)
+        fun_l7_n195(x)
+    else
+        fun_l7_n696(x)
+    end
+end
+
+def fun_l6_n606(x)
+    if (x < 1)
+        fun_l7_n337(x)
+    else
+        fun_l7_n347(x)
+    end
+end
+
+def fun_l6_n607(x)
+    if (x < 1)
+        fun_l7_n657(x)
+    else
+        fun_l7_n67(x)
+    end
+end
+
+def fun_l6_n608(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n589(x)
+    end
+end
+
+def fun_l6_n609(x)
+    if (x < 1)
+        fun_l7_n230(x)
+    else
+        fun_l7_n769(x)
+    end
+end
+
+def fun_l6_n610(x)
+    if (x < 1)
+        fun_l7_n427(x)
+    else
+        fun_l7_n892(x)
+    end
+end
+
+def fun_l6_n611(x)
+    if (x < 1)
+        fun_l7_n741(x)
+    else
+        fun_l7_n567(x)
+    end
+end
+
+def fun_l6_n612(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n824(x)
+    end
+end
+
+def fun_l6_n613(x)
+    if (x < 1)
+        fun_l7_n522(x)
+    else
+        fun_l7_n694(x)
+    end
+end
+
+def fun_l6_n614(x)
+    if (x < 1)
+        fun_l7_n95(x)
+    else
+        fun_l7_n84(x)
+    end
+end
+
+def fun_l6_n615(x)
+    if (x < 1)
+        fun_l7_n632(x)
+    else
+        fun_l7_n590(x)
+    end
+end
+
+def fun_l6_n616(x)
+    if (x < 1)
+        fun_l7_n372(x)
+    else
+        fun_l7_n659(x)
+    end
+end
+
+def fun_l6_n617(x)
+    if (x < 1)
+        fun_l7_n547(x)
+    else
+        fun_l7_n321(x)
+    end
+end
+
+def fun_l6_n618(x)
+    if (x < 1)
+        fun_l7_n53(x)
+    else
+        fun_l7_n723(x)
+    end
+end
+
+def fun_l6_n619(x)
+    if (x < 1)
+        fun_l7_n653(x)
+    else
+        fun_l7_n740(x)
+    end
+end
+
+def fun_l6_n620(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n228(x)
+    end
+end
+
+def fun_l6_n621(x)
+    if (x < 1)
+        fun_l7_n655(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n622(x)
+    if (x < 1)
+        fun_l7_n212(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n623(x)
+    if (x < 1)
+        fun_l7_n959(x)
+    else
+        fun_l7_n327(x)
+    end
+end
+
+def fun_l6_n624(x)
+    if (x < 1)
+        fun_l7_n607(x)
+    else
+        fun_l7_n168(x)
+    end
+end
+
+def fun_l6_n625(x)
+    if (x < 1)
+        fun_l7_n229(x)
+    else
+        fun_l7_n584(x)
+    end
+end
+
+def fun_l6_n626(x)
+    if (x < 1)
+        fun_l7_n776(x)
+    else
+        fun_l7_n284(x)
+    end
+end
+
+def fun_l6_n627(x)
+    if (x < 1)
+        fun_l7_n770(x)
+    else
+        fun_l7_n169(x)
+    end
+end
+
+def fun_l6_n628(x)
+    if (x < 1)
+        fun_l7_n550(x)
+    else
+        fun_l7_n918(x)
+    end
+end
+
+def fun_l6_n629(x)
+    if (x < 1)
+        fun_l7_n450(x)
+    else
+        fun_l7_n654(x)
+    end
+end
+
+def fun_l6_n630(x)
+    if (x < 1)
+        fun_l7_n968(x)
+    else
+        fun_l7_n770(x)
+    end
+end
+
+def fun_l6_n631(x)
+    if (x < 1)
+        fun_l7_n118(x)
+    else
+        fun_l7_n411(x)
+    end
+end
+
+def fun_l6_n632(x)
+    if (x < 1)
+        fun_l7_n352(x)
+    else
+        fun_l7_n840(x)
+    end
+end
+
+def fun_l6_n633(x)
+    if (x < 1)
+        fun_l7_n588(x)
+    else
+        fun_l7_n810(x)
+    end
+end
+
+def fun_l6_n634(x)
+    if (x < 1)
+        fun_l7_n955(x)
+    else
+        fun_l7_n709(x)
+    end
+end
+
+def fun_l6_n635(x)
+    if (x < 1)
+        fun_l7_n137(x)
+    else
+        fun_l7_n239(x)
+    end
+end
+
+def fun_l6_n636(x)
+    if (x < 1)
+        fun_l7_n955(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n637(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n91(x)
+    end
+end
+
+def fun_l6_n638(x)
+    if (x < 1)
+        fun_l7_n366(x)
+    else
+        fun_l7_n388(x)
+    end
+end
+
+def fun_l6_n639(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n971(x)
+    end
+end
+
+def fun_l6_n640(x)
+    if (x < 1)
+        fun_l7_n330(x)
+    else
+        fun_l7_n415(x)
+    end
+end
+
+def fun_l6_n641(x)
+    if (x < 1)
+        fun_l7_n233(x)
+    else
+        fun_l7_n653(x)
+    end
+end
+
+def fun_l6_n642(x)
+    if (x < 1)
+        fun_l7_n106(x)
+    else
+        fun_l7_n440(x)
+    end
+end
+
+def fun_l6_n643(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n818(x)
+    end
+end
+
+def fun_l6_n644(x)
+    if (x < 1)
+        fun_l7_n68(x)
+    else
+        fun_l7_n763(x)
+    end
+end
+
+def fun_l6_n645(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n465(x)
+    end
+end
+
+def fun_l6_n646(x)
+    if (x < 1)
+        fun_l7_n886(x)
+    else
+        fun_l7_n86(x)
+    end
+end
+
+def fun_l6_n647(x)
+    if (x < 1)
+        fun_l7_n689(x)
+    else
+        fun_l7_n964(x)
+    end
+end
+
+def fun_l6_n648(x)
+    if (x < 1)
+        fun_l7_n748(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n649(x)
+    if (x < 1)
+        fun_l7_n830(x)
+    else
+        fun_l7_n567(x)
+    end
+end
+
+def fun_l6_n650(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n957(x)
+    end
+end
+
+def fun_l6_n651(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n239(x)
+    end
+end
+
+def fun_l6_n652(x)
+    if (x < 1)
+        fun_l7_n347(x)
+    else
+        fun_l7_n63(x)
+    end
+end
+
+def fun_l6_n653(x)
+    if (x < 1)
+        fun_l7_n480(x)
+    else
+        fun_l7_n441(x)
+    end
+end
+
+def fun_l6_n654(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n690(x)
+    end
+end
+
+def fun_l6_n655(x)
+    if (x < 1)
+        fun_l7_n511(x)
+    else
+        fun_l7_n710(x)
+    end
+end
+
+def fun_l6_n656(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n657(x)
+    if (x < 1)
+        fun_l7_n232(x)
+    else
+        fun_l7_n919(x)
+    end
+end
+
+def fun_l6_n658(x)
+    if (x < 1)
+        fun_l7_n627(x)
+    else
+        fun_l7_n620(x)
+    end
+end
+
+def fun_l6_n659(x)
+    if (x < 1)
+        fun_l7_n716(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n660(x)
+    if (x < 1)
+        fun_l7_n105(x)
+    else
+        fun_l7_n536(x)
+    end
+end
+
+def fun_l6_n661(x)
+    if (x < 1)
+        fun_l7_n376(x)
+    else
+        fun_l7_n965(x)
+    end
+end
+
+def fun_l6_n662(x)
+    if (x < 1)
+        fun_l7_n417(x)
+    else
+        fun_l7_n726(x)
+    end
+end
+
+def fun_l6_n663(x)
+    if (x < 1)
+        fun_l7_n567(x)
+    else
+        fun_l7_n948(x)
+    end
+end
+
+def fun_l6_n664(x)
+    if (x < 1)
+        fun_l7_n640(x)
+    else
+        fun_l7_n910(x)
+    end
+end
+
+def fun_l6_n665(x)
+    if (x < 1)
+        fun_l7_n874(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n666(x)
+    if (x < 1)
+        fun_l7_n946(x)
+    else
+        fun_l7_n101(x)
+    end
+end
+
+def fun_l6_n667(x)
+    if (x < 1)
+        fun_l7_n960(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n668(x)
+    if (x < 1)
+        fun_l7_n389(x)
+    else
+        fun_l7_n976(x)
+    end
+end
+
+def fun_l6_n669(x)
+    if (x < 1)
+        fun_l7_n31(x)
+    else
+        fun_l7_n903(x)
+    end
+end
+
+def fun_l6_n670(x)
+    if (x < 1)
+        fun_l7_n288(x)
+    else
+        fun_l7_n115(x)
+    end
+end
+
+def fun_l6_n671(x)
+    if (x < 1)
+        fun_l7_n418(x)
+    else
+        fun_l7_n249(x)
+    end
+end
+
+def fun_l6_n672(x)
+    if (x < 1)
+        fun_l7_n733(x)
+    else
+        fun_l7_n815(x)
+    end
+end
+
+def fun_l6_n673(x)
+    if (x < 1)
+        fun_l7_n227(x)
+    else
+        fun_l7_n23(x)
+    end
+end
+
+def fun_l6_n674(x)
+    if (x < 1)
+        fun_l7_n936(x)
+    else
+        fun_l7_n386(x)
+    end
+end
+
+def fun_l6_n675(x)
+    if (x < 1)
+        fun_l7_n638(x)
+    else
+        fun_l7_n39(x)
+    end
+end
+
+def fun_l6_n676(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n35(x)
+    end
+end
+
+def fun_l6_n677(x)
+    if (x < 1)
+        fun_l7_n676(x)
+    else
+        fun_l7_n443(x)
+    end
+end
+
+def fun_l6_n678(x)
+    if (x < 1)
+        fun_l7_n648(x)
+    else
+        fun_l7_n453(x)
+    end
+end
+
+def fun_l6_n679(x)
+    if (x < 1)
+        fun_l7_n15(x)
+    else
+        fun_l7_n220(x)
+    end
+end
+
+def fun_l6_n680(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n842(x)
+    end
+end
+
+def fun_l6_n681(x)
+    if (x < 1)
+        fun_l7_n67(x)
+    else
+        fun_l7_n73(x)
+    end
+end
+
+def fun_l6_n682(x)
+    if (x < 1)
+        fun_l7_n280(x)
+    else
+        fun_l7_n370(x)
+    end
+end
+
+def fun_l6_n683(x)
+    if (x < 1)
+        fun_l7_n822(x)
+    else
+        fun_l7_n27(x)
+    end
+end
+
+def fun_l6_n684(x)
+    if (x < 1)
+        fun_l7_n720(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n685(x)
+    if (x < 1)
+        fun_l7_n414(x)
+    else
+        fun_l7_n257(x)
+    end
+end
+
+def fun_l6_n686(x)
+    if (x < 1)
+        fun_l7_n477(x)
+    else
+        fun_l7_n883(x)
+    end
+end
+
+def fun_l6_n687(x)
+    if (x < 1)
+        fun_l7_n467(x)
+    else
+        fun_l7_n739(x)
+    end
+end
+
+def fun_l6_n688(x)
+    if (x < 1)
+        fun_l7_n421(x)
+    else
+        fun_l7_n271(x)
+    end
+end
+
+def fun_l6_n689(x)
+    if (x < 1)
+        fun_l7_n444(x)
+    else
+        fun_l7_n601(x)
+    end
+end
+
+def fun_l6_n690(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n597(x)
+    end
+end
+
+def fun_l6_n691(x)
+    if (x < 1)
+        fun_l7_n273(x)
+    else
+        fun_l7_n79(x)
+    end
+end
+
+def fun_l6_n692(x)
+    if (x < 1)
+        fun_l7_n310(x)
+    else
+        fun_l7_n261(x)
+    end
+end
+
+def fun_l6_n693(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n330(x)
+    end
+end
+
+def fun_l6_n694(x)
+    if (x < 1)
+        fun_l7_n103(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n695(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n988(x)
+    end
+end
+
+def fun_l6_n696(x)
+    if (x < 1)
+        fun_l7_n885(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n697(x)
+    if (x < 1)
+        fun_l7_n212(x)
+    else
+        fun_l7_n98(x)
+    end
+end
+
+def fun_l6_n698(x)
+    if (x < 1)
+        fun_l7_n735(x)
+    else
+        fun_l7_n682(x)
+    end
+end
+
+def fun_l6_n699(x)
+    if (x < 1)
+        fun_l7_n610(x)
+    else
+        fun_l7_n512(x)
+    end
+end
+
+def fun_l6_n700(x)
+    if (x < 1)
+        fun_l7_n828(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n701(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n192(x)
+    end
+end
+
+def fun_l6_n702(x)
+    if (x < 1)
+        fun_l7_n775(x)
+    else
+        fun_l7_n334(x)
+    end
+end
+
+def fun_l6_n703(x)
+    if (x < 1)
+        fun_l7_n880(x)
+    else
+        fun_l7_n396(x)
+    end
+end
+
+def fun_l6_n704(x)
+    if (x < 1)
+        fun_l7_n907(x)
+    else
+        fun_l7_n107(x)
+    end
+end
+
+def fun_l6_n705(x)
+    if (x < 1)
+        fun_l7_n425(x)
+    else
+        fun_l7_n555(x)
+    end
+end
+
+def fun_l6_n706(x)
+    if (x < 1)
+        fun_l7_n458(x)
+    else
+        fun_l7_n610(x)
+    end
+end
+
+def fun_l6_n707(x)
+    if (x < 1)
+        fun_l7_n527(x)
+    else
+        fun_l7_n69(x)
+    end
+end
+
+def fun_l6_n708(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n87(x)
+    end
+end
+
+def fun_l6_n709(x)
+    if (x < 1)
+        fun_l7_n441(x)
+    else
+        fun_l7_n533(x)
+    end
+end
+
+def fun_l6_n710(x)
+    if (x < 1)
+        fun_l7_n872(x)
+    else
+        fun_l7_n896(x)
+    end
+end
+
+def fun_l6_n711(x)
+    if (x < 1)
+        fun_l7_n388(x)
+    else
+        fun_l7_n476(x)
+    end
+end
+
+def fun_l6_n712(x)
+    if (x < 1)
+        fun_l7_n913(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n713(x)
+    if (x < 1)
+        fun_l7_n203(x)
+    else
+        fun_l7_n457(x)
+    end
+end
+
+def fun_l6_n714(x)
+    if (x < 1)
+        fun_l7_n593(x)
+    else
+        fun_l7_n921(x)
+    end
+end
+
+def fun_l6_n715(x)
+    if (x < 1)
+        fun_l7_n452(x)
+    else
+        fun_l7_n68(x)
+    end
+end
+
+def fun_l6_n716(x)
+    if (x < 1)
+        fun_l7_n203(x)
+    else
+        fun_l7_n362(x)
+    end
+end
+
+def fun_l6_n717(x)
+    if (x < 1)
+        fun_l7_n455(x)
+    else
+        fun_l7_n199(x)
+    end
+end
+
+def fun_l6_n718(x)
+    if (x < 1)
+        fun_l7_n500(x)
+    else
+        fun_l7_n272(x)
+    end
+end
+
+def fun_l6_n719(x)
+    if (x < 1)
+        fun_l7_n970(x)
+    else
+        fun_l7_n572(x)
+    end
+end
+
+def fun_l6_n720(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n246(x)
+    end
+end
+
+def fun_l6_n721(x)
+    if (x < 1)
+        fun_l7_n943(x)
+    else
+        fun_l7_n640(x)
+    end
+end
+
+def fun_l6_n722(x)
+    if (x < 1)
+        fun_l7_n106(x)
+    else
+        fun_l7_n387(x)
+    end
+end
+
+def fun_l6_n723(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n530(x)
+    end
+end
+
+def fun_l6_n724(x)
+    if (x < 1)
+        fun_l7_n246(x)
+    else
+        fun_l7_n387(x)
+    end
+end
+
+def fun_l6_n725(x)
+    if (x < 1)
+        fun_l7_n572(x)
+    else
+        fun_l7_n874(x)
+    end
+end
+
+def fun_l6_n726(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n71(x)
+    end
+end
+
+def fun_l6_n727(x)
+    if (x < 1)
+        fun_l7_n615(x)
+    else
+        fun_l7_n14(x)
+    end
+end
+
+def fun_l6_n728(x)
+    if (x < 1)
+        fun_l7_n840(x)
+    else
+        fun_l7_n779(x)
+    end
+end
+
+def fun_l6_n729(x)
+    if (x < 1)
+        fun_l7_n811(x)
+    else
+        fun_l7_n981(x)
+    end
+end
+
+def fun_l6_n730(x)
+    if (x < 1)
+        fun_l7_n196(x)
+    else
+        fun_l7_n731(x)
+    end
+end
+
+def fun_l6_n731(x)
+    if (x < 1)
+        fun_l7_n202(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n732(x)
+    if (x < 1)
+        fun_l7_n867(x)
+    else
+        fun_l7_n770(x)
+    end
+end
+
+def fun_l6_n733(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n937(x)
+    end
+end
+
+def fun_l6_n734(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n937(x)
+    end
+end
+
+def fun_l6_n735(x)
+    if (x < 1)
+        fun_l7_n967(x)
+    else
+        fun_l7_n235(x)
+    end
+end
+
+def fun_l6_n736(x)
+    if (x < 1)
+        fun_l7_n612(x)
+    else
+        fun_l7_n140(x)
+    end
+end
+
+def fun_l6_n737(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n600(x)
+    end
+end
+
+def fun_l6_n738(x)
+    if (x < 1)
+        fun_l7_n462(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n739(x)
+    if (x < 1)
+        fun_l7_n226(x)
+    else
+        fun_l7_n83(x)
+    end
+end
+
+def fun_l6_n740(x)
+    if (x < 1)
+        fun_l7_n419(x)
+    else
+        fun_l7_n95(x)
+    end
+end
+
+def fun_l6_n741(x)
+    if (x < 1)
+        fun_l7_n358(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n742(x)
+    if (x < 1)
+        fun_l7_n451(x)
+    else
+        fun_l7_n700(x)
+    end
+end
+
+def fun_l6_n743(x)
+    if (x < 1)
+        fun_l7_n561(x)
+    else
+        fun_l7_n383(x)
+    end
+end
+
+def fun_l6_n744(x)
+    if (x < 1)
+        fun_l7_n28(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n745(x)
+    if (x < 1)
+        fun_l7_n127(x)
+    else
+        fun_l7_n113(x)
+    end
+end
+
+def fun_l6_n746(x)
+    if (x < 1)
+        fun_l7_n767(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n747(x)
+    if (x < 1)
+        fun_l7_n174(x)
+    else
+        fun_l7_n955(x)
+    end
+end
+
+def fun_l6_n748(x)
+    if (x < 1)
+        fun_l7_n51(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n749(x)
+    if (x < 1)
+        fun_l7_n172(x)
+    else
+        fun_l7_n847(x)
+    end
+end
+
+def fun_l6_n750(x)
+    if (x < 1)
+        fun_l7_n240(x)
+    else
+        fun_l7_n869(x)
+    end
+end
+
+def fun_l6_n751(x)
+    if (x < 1)
+        fun_l7_n435(x)
+    else
+        fun_l7_n747(x)
+    end
+end
+
+def fun_l6_n752(x)
+    if (x < 1)
+        fun_l7_n673(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n753(x)
+    if (x < 1)
+        fun_l7_n98(x)
+    else
+        fun_l7_n66(x)
+    end
+end
+
+def fun_l6_n754(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n943(x)
+    end
+end
+
+def fun_l6_n755(x)
+    if (x < 1)
+        fun_l7_n863(x)
+    else
+        fun_l7_n155(x)
+    end
+end
+
+def fun_l6_n756(x)
+    if (x < 1)
+        fun_l7_n197(x)
+    else
+        fun_l7_n807(x)
+    end
+end
+
+def fun_l6_n757(x)
+    if (x < 1)
+        fun_l7_n992(x)
+    else
+        fun_l7_n615(x)
+    end
+end
+
+def fun_l6_n758(x)
+    if (x < 1)
+        fun_l7_n172(x)
+    else
+        fun_l7_n507(x)
+    end
+end
+
+def fun_l6_n759(x)
+    if (x < 1)
+        fun_l7_n756(x)
+    else
+        fun_l7_n599(x)
+    end
+end
+
+def fun_l6_n760(x)
+    if (x < 1)
+        fun_l7_n876(x)
+    else
+        fun_l7_n185(x)
+    end
+end
+
+def fun_l6_n761(x)
+    if (x < 1)
+        fun_l7_n522(x)
+    else
+        fun_l7_n301(x)
+    end
+end
+
+def fun_l6_n762(x)
+    if (x < 1)
+        fun_l7_n994(x)
+    else
+        fun_l7_n408(x)
+    end
+end
+
+def fun_l6_n763(x)
+    if (x < 1)
+        fun_l7_n201(x)
+    else
+        fun_l7_n304(x)
+    end
+end
+
+def fun_l6_n764(x)
+    if (x < 1)
+        fun_l7_n200(x)
+    else
+        fun_l7_n123(x)
+    end
+end
+
+def fun_l6_n765(x)
+    if (x < 1)
+        fun_l7_n156(x)
+    else
+        fun_l7_n117(x)
+    end
+end
+
+def fun_l6_n766(x)
+    if (x < 1)
+        fun_l7_n918(x)
+    else
+        fun_l7_n416(x)
+    end
+end
+
+def fun_l6_n767(x)
+    if (x < 1)
+        fun_l7_n538(x)
+    else
+        fun_l7_n335(x)
+    end
+end
+
+def fun_l6_n768(x)
+    if (x < 1)
+        fun_l7_n699(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n769(x)
+    if (x < 1)
+        fun_l7_n903(x)
+    else
+        fun_l7_n195(x)
+    end
+end
+
+def fun_l6_n770(x)
+    if (x < 1)
+        fun_l7_n419(x)
+    else
+        fun_l7_n523(x)
+    end
+end
+
+def fun_l6_n771(x)
+    if (x < 1)
+        fun_l7_n221(x)
+    else
+        fun_l7_n39(x)
+    end
+end
+
+def fun_l6_n772(x)
+    if (x < 1)
+        fun_l7_n369(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n773(x)
+    if (x < 1)
+        fun_l7_n861(x)
+    else
+        fun_l7_n252(x)
+    end
+end
+
+def fun_l6_n774(x)
+    if (x < 1)
+        fun_l7_n682(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n775(x)
+    if (x < 1)
+        fun_l7_n777(x)
+    else
+        fun_l7_n594(x)
+    end
+end
+
+def fun_l6_n776(x)
+    if (x < 1)
+        fun_l7_n794(x)
+    else
+        fun_l7_n71(x)
+    end
+end
+
+def fun_l6_n777(x)
+    if (x < 1)
+        fun_l7_n669(x)
+    else
+        fun_l7_n66(x)
+    end
+end
+
+def fun_l6_n778(x)
+    if (x < 1)
+        fun_l7_n824(x)
+    else
+        fun_l7_n95(x)
+    end
+end
+
+def fun_l6_n779(x)
+    if (x < 1)
+        fun_l7_n833(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n780(x)
+    if (x < 1)
+        fun_l7_n50(x)
+    else
+        fun_l7_n647(x)
+    end
+end
+
+def fun_l6_n781(x)
+    if (x < 1)
+        fun_l7_n139(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n782(x)
+    if (x < 1)
+        fun_l7_n450(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n783(x)
+    if (x < 1)
+        fun_l7_n164(x)
+    else
+        fun_l7_n576(x)
+    end
+end
+
+def fun_l6_n784(x)
+    if (x < 1)
+        fun_l7_n722(x)
+    else
+        fun_l7_n714(x)
+    end
+end
+
+def fun_l6_n785(x)
+    if (x < 1)
+        fun_l7_n90(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n786(x)
+    if (x < 1)
+        fun_l7_n413(x)
+    else
+        fun_l7_n722(x)
+    end
+end
+
+def fun_l6_n787(x)
+    if (x < 1)
+        fun_l7_n141(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n788(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n660(x)
+    end
+end
+
+def fun_l6_n789(x)
+    if (x < 1)
+        fun_l7_n581(x)
+    else
+        fun_l7_n368(x)
+    end
+end
+
+def fun_l6_n790(x)
+    if (x < 1)
+        fun_l7_n922(x)
+    else
+        fun_l7_n551(x)
+    end
+end
+
+def fun_l6_n791(x)
+    if (x < 1)
+        fun_l7_n842(x)
+    else
+        fun_l7_n336(x)
+    end
+end
+
+def fun_l6_n792(x)
+    if (x < 1)
+        fun_l7_n264(x)
+    else
+        fun_l7_n7(x)
+    end
+end
+
+def fun_l6_n793(x)
+    if (x < 1)
+        fun_l7_n902(x)
+    else
+        fun_l7_n184(x)
+    end
+end
+
+def fun_l6_n794(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n854(x)
+    end
+end
+
+def fun_l6_n795(x)
+    if (x < 1)
+        fun_l7_n375(x)
+    else
+        fun_l7_n601(x)
+    end
+end
+
+def fun_l6_n796(x)
+    if (x < 1)
+        fun_l7_n674(x)
+    else
+        fun_l7_n136(x)
+    end
+end
+
+def fun_l6_n797(x)
+    if (x < 1)
+        fun_l7_n836(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n798(x)
+    if (x < 1)
+        fun_l7_n461(x)
+    else
+        fun_l7_n686(x)
+    end
+end
+
+def fun_l6_n799(x)
+    if (x < 1)
+        fun_l7_n308(x)
+    else
+        fun_l7_n179(x)
+    end
+end
+
+def fun_l6_n800(x)
+    if (x < 1)
+        fun_l7_n154(x)
+    else
+        fun_l7_n618(x)
+    end
+end
+
+def fun_l6_n801(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n16(x)
+    end
+end
+
+def fun_l6_n802(x)
+    if (x < 1)
+        fun_l7_n880(x)
+    else
+        fun_l7_n143(x)
+    end
+end
+
+def fun_l6_n803(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n414(x)
+    end
+end
+
+def fun_l6_n804(x)
+    if (x < 1)
+        fun_l7_n409(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n805(x)
+    if (x < 1)
+        fun_l7_n259(x)
+    else
+        fun_l7_n820(x)
+    end
+end
+
+def fun_l6_n806(x)
+    if (x < 1)
+        fun_l7_n384(x)
+    else
+        fun_l7_n939(x)
+    end
+end
+
+def fun_l6_n807(x)
+    if (x < 1)
+        fun_l7_n138(x)
+    else
+        fun_l7_n652(x)
+    end
+end
+
+def fun_l6_n808(x)
+    if (x < 1)
+        fun_l7_n455(x)
+    else
+        fun_l7_n693(x)
+    end
+end
+
+def fun_l6_n809(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n638(x)
+    end
+end
+
+def fun_l6_n810(x)
+    if (x < 1)
+        fun_l7_n498(x)
+    else
+        fun_l7_n716(x)
+    end
+end
+
+def fun_l6_n811(x)
+    if (x < 1)
+        fun_l7_n713(x)
+    else
+        fun_l7_n9(x)
+    end
+end
+
+def fun_l6_n812(x)
+    if (x < 1)
+        fun_l7_n854(x)
+    else
+        fun_l7_n507(x)
+    end
+end
+
+def fun_l6_n813(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n323(x)
+    end
+end
+
+def fun_l6_n814(x)
+    if (x < 1)
+        fun_l7_n437(x)
+    else
+        fun_l7_n954(x)
+    end
+end
+
+def fun_l6_n815(x)
+    if (x < 1)
+        fun_l7_n471(x)
+    else
+        fun_l7_n245(x)
+    end
+end
+
+def fun_l6_n816(x)
+    if (x < 1)
+        fun_l7_n485(x)
+    else
+        fun_l7_n935(x)
+    end
+end
+
+def fun_l6_n817(x)
+    if (x < 1)
+        fun_l7_n319(x)
+    else
+        fun_l7_n566(x)
+    end
+end
+
+def fun_l6_n818(x)
+    if (x < 1)
+        fun_l7_n339(x)
+    else
+        fun_l7_n152(x)
+    end
+end
+
+def fun_l6_n819(x)
+    if (x < 1)
+        fun_l7_n21(x)
+    else
+        fun_l7_n452(x)
+    end
+end
+
+def fun_l6_n820(x)
+    if (x < 1)
+        fun_l7_n16(x)
+    else
+        fun_l7_n502(x)
+    end
+end
+
+def fun_l6_n821(x)
+    if (x < 1)
+        fun_l7_n813(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n822(x)
+    if (x < 1)
+        fun_l7_n519(x)
+    else
+        fun_l7_n651(x)
+    end
+end
+
+def fun_l6_n823(x)
+    if (x < 1)
+        fun_l7_n890(x)
+    else
+        fun_l7_n227(x)
+    end
+end
+
+def fun_l6_n824(x)
+    if (x < 1)
+        fun_l7_n517(x)
+    else
+        fun_l7_n799(x)
+    end
+end
+
+def fun_l6_n825(x)
+    if (x < 1)
+        fun_l7_n404(x)
+    else
+        fun_l7_n442(x)
+    end
+end
+
+def fun_l6_n826(x)
+    if (x < 1)
+        fun_l7_n308(x)
+    else
+        fun_l7_n328(x)
+    end
+end
+
+def fun_l6_n827(x)
+    if (x < 1)
+        fun_l7_n953(x)
+    else
+        fun_l7_n950(x)
+    end
+end
+
+def fun_l6_n828(x)
+    if (x < 1)
+        fun_l7_n206(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n829(x)
+    if (x < 1)
+        fun_l7_n499(x)
+    else
+        fun_l7_n972(x)
+    end
+end
+
+def fun_l6_n830(x)
+    if (x < 1)
+        fun_l7_n578(x)
+    else
+        fun_l7_n697(x)
+    end
+end
+
+def fun_l6_n831(x)
+    if (x < 1)
+        fun_l7_n116(x)
+    else
+        fun_l7_n747(x)
+    end
+end
+
+def fun_l6_n832(x)
+    if (x < 1)
+        fun_l7_n423(x)
+    else
+        fun_l7_n653(x)
+    end
+end
+
+def fun_l6_n833(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n423(x)
+    end
+end
+
+def fun_l6_n834(x)
+    if (x < 1)
+        fun_l7_n940(x)
+    else
+        fun_l7_n48(x)
+    end
+end
+
+def fun_l6_n835(x)
+    if (x < 1)
+        fun_l7_n336(x)
+    else
+        fun_l7_n584(x)
+    end
+end
+
+def fun_l6_n836(x)
+    if (x < 1)
+        fun_l7_n66(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n837(x)
+    if (x < 1)
+        fun_l7_n176(x)
+    else
+        fun_l7_n845(x)
+    end
+end
+
+def fun_l6_n838(x)
+    if (x < 1)
+        fun_l7_n736(x)
+    else
+        fun_l7_n385(x)
+    end
+end
+
+def fun_l6_n839(x)
+    if (x < 1)
+        fun_l7_n948(x)
+    else
+        fun_l7_n258(x)
+    end
+end
+
+def fun_l6_n840(x)
+    if (x < 1)
+        fun_l7_n926(x)
+    else
+        fun_l7_n926(x)
+    end
+end
+
+def fun_l6_n841(x)
+    if (x < 1)
+        fun_l7_n334(x)
+    else
+        fun_l7_n134(x)
+    end
+end
+
+def fun_l6_n842(x)
+    if (x < 1)
+        fun_l7_n757(x)
+    else
+        fun_l7_n995(x)
+    end
+end
+
+def fun_l6_n843(x)
+    if (x < 1)
+        fun_l7_n75(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n844(x)
+    if (x < 1)
+        fun_l7_n632(x)
+    else
+        fun_l7_n683(x)
+    end
+end
+
+def fun_l6_n845(x)
+    if (x < 1)
+        fun_l7_n788(x)
+    else
+        fun_l7_n153(x)
+    end
+end
+
+def fun_l6_n846(x)
+    if (x < 1)
+        fun_l7_n668(x)
+    else
+        fun_l7_n78(x)
+    end
+end
+
+def fun_l6_n847(x)
+    if (x < 1)
+        fun_l7_n509(x)
+    else
+        fun_l7_n210(x)
+    end
+end
+
+def fun_l6_n848(x)
+    if (x < 1)
+        fun_l7_n862(x)
+    else
+        fun_l7_n90(x)
+    end
+end
+
+def fun_l6_n849(x)
+    if (x < 1)
+        fun_l7_n837(x)
+    else
+        fun_l7_n37(x)
+    end
+end
+
+def fun_l6_n850(x)
+    if (x < 1)
+        fun_l7_n792(x)
+    else
+        fun_l7_n171(x)
+    end
+end
+
+def fun_l6_n851(x)
+    if (x < 1)
+        fun_l7_n869(x)
+    else
+        fun_l7_n217(x)
+    end
+end
+
+def fun_l6_n852(x)
+    if (x < 1)
+        fun_l7_n585(x)
+    else
+        fun_l7_n980(x)
+    end
+end
+
+def fun_l6_n853(x)
+    if (x < 1)
+        fun_l7_n752(x)
+    else
+        fun_l7_n214(x)
+    end
+end
+
+def fun_l6_n854(x)
+    if (x < 1)
+        fun_l7_n151(x)
+    else
+        fun_l7_n668(x)
+    end
+end
+
+def fun_l6_n855(x)
+    if (x < 1)
+        fun_l7_n145(x)
+    else
+        fun_l7_n99(x)
+    end
+end
+
+def fun_l6_n856(x)
+    if (x < 1)
+        fun_l7_n114(x)
+    else
+        fun_l7_n852(x)
+    end
+end
+
+def fun_l6_n857(x)
+    if (x < 1)
+        fun_l7_n571(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n858(x)
+    if (x < 1)
+        fun_l7_n724(x)
+    else
+        fun_l7_n132(x)
+    end
+end
+
+def fun_l6_n859(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n627(x)
+    end
+end
+
+def fun_l6_n860(x)
+    if (x < 1)
+        fun_l7_n515(x)
+    else
+        fun_l7_n598(x)
+    end
+end
+
+def fun_l6_n861(x)
+    if (x < 1)
+        fun_l7_n49(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n862(x)
+    if (x < 1)
+        fun_l7_n378(x)
+    else
+        fun_l7_n295(x)
+    end
+end
+
+def fun_l6_n863(x)
+    if (x < 1)
+        fun_l7_n122(x)
+    else
+        fun_l7_n738(x)
+    end
+end
+
+def fun_l6_n864(x)
+    if (x < 1)
+        fun_l7_n421(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n865(x)
+    if (x < 1)
+        fun_l7_n965(x)
+    else
+        fun_l7_n963(x)
+    end
+end
+
+def fun_l6_n866(x)
+    if (x < 1)
+        fun_l7_n551(x)
+    else
+        fun_l7_n177(x)
+    end
+end
+
+def fun_l6_n867(x)
+    if (x < 1)
+        fun_l7_n136(x)
+    else
+        fun_l7_n289(x)
+    end
+end
+
+def fun_l6_n868(x)
+    if (x < 1)
+        fun_l7_n26(x)
+    else
+        fun_l7_n376(x)
+    end
+end
+
+def fun_l6_n869(x)
+    if (x < 1)
+        fun_l7_n888(x)
+    else
+        fun_l7_n948(x)
+    end
+end
+
+def fun_l6_n870(x)
+    if (x < 1)
+        fun_l7_n636(x)
+    else
+        fun_l7_n89(x)
+    end
+end
+
+def fun_l6_n871(x)
+    if (x < 1)
+        fun_l7_n953(x)
+    else
+        fun_l7_n634(x)
+    end
+end
+
+def fun_l6_n872(x)
+    if (x < 1)
+        fun_l7_n74(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n873(x)
+    if (x < 1)
+        fun_l7_n317(x)
+    else
+        fun_l7_n863(x)
+    end
+end
+
+def fun_l6_n874(x)
+    if (x < 1)
+        fun_l7_n495(x)
+    else
+        fun_l7_n478(x)
+    end
+end
+
+def fun_l6_n875(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n634(x)
+    end
+end
+
+def fun_l6_n876(x)
+    if (x < 1)
+        fun_l7_n780(x)
+    else
+        fun_l7_n886(x)
+    end
+end
+
+def fun_l6_n877(x)
+    if (x < 1)
+        fun_l7_n768(x)
+    else
+        fun_l7_n820(x)
+    end
+end
+
+def fun_l6_n878(x)
+    if (x < 1)
+        fun_l7_n501(x)
+    else
+        fun_l7_n355(x)
+    end
+end
+
+def fun_l6_n879(x)
+    if (x < 1)
+        fun_l7_n412(x)
+    else
+        fun_l7_n701(x)
+    end
+end
+
+def fun_l6_n880(x)
+    if (x < 1)
+        fun_l7_n541(x)
+    else
+        fun_l7_n148(x)
+    end
+end
+
+def fun_l6_n881(x)
+    if (x < 1)
+        fun_l7_n460(x)
+    else
+        fun_l7_n579(x)
+    end
+end
+
+def fun_l6_n882(x)
+    if (x < 1)
+        fun_l7_n576(x)
+    else
+        fun_l7_n118(x)
+    end
+end
+
+def fun_l6_n883(x)
+    if (x < 1)
+        fun_l7_n218(x)
+    else
+        fun_l7_n197(x)
+    end
+end
+
+def fun_l6_n884(x)
+    if (x < 1)
+        fun_l7_n279(x)
+    else
+        fun_l7_n565(x)
+    end
+end
+
+def fun_l6_n885(x)
+    if (x < 1)
+        fun_l7_n934(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n886(x)
+    if (x < 1)
+        fun_l7_n894(x)
+    else
+        fun_l7_n864(x)
+    end
+end
+
+def fun_l6_n887(x)
+    if (x < 1)
+        fun_l7_n45(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n888(x)
+    if (x < 1)
+        fun_l7_n190(x)
+    else
+        fun_l7_n46(x)
+    end
+end
+
+def fun_l6_n889(x)
+    if (x < 1)
+        fun_l7_n56(x)
+    else
+        fun_l7_n451(x)
+    end
+end
+
+def fun_l6_n890(x)
+    if (x < 1)
+        fun_l7_n7(x)
+    else
+        fun_l7_n906(x)
+    end
+end
+
+def fun_l6_n891(x)
+    if (x < 1)
+        fun_l7_n507(x)
+    else
+        fun_l7_n121(x)
+    end
+end
+
+def fun_l6_n892(x)
+    if (x < 1)
+        fun_l7_n757(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n893(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n366(x)
+    end
+end
+
+def fun_l6_n894(x)
+    if (x < 1)
+        fun_l7_n563(x)
+    else
+        fun_l7_n749(x)
+    end
+end
+
+def fun_l6_n895(x)
+    if (x < 1)
+        fun_l7_n976(x)
+    else
+        fun_l7_n907(x)
+    end
+end
+
+def fun_l6_n896(x)
+    if (x < 1)
+        fun_l7_n525(x)
+    else
+        fun_l7_n843(x)
+    end
+end
+
+def fun_l6_n897(x)
+    if (x < 1)
+        fun_l7_n255(x)
+    else
+        fun_l7_n133(x)
+    end
+end
+
+def fun_l6_n898(x)
+    if (x < 1)
+        fun_l7_n796(x)
+    else
+        fun_l7_n275(x)
+    end
+end
+
+def fun_l6_n899(x)
+    if (x < 1)
+        fun_l7_n985(x)
+    else
+        fun_l7_n485(x)
+    end
+end
+
+def fun_l6_n900(x)
+    if (x < 1)
+        fun_l7_n32(x)
+    else
+        fun_l7_n324(x)
+    end
+end
+
+def fun_l6_n901(x)
+    if (x < 1)
+        fun_l7_n334(x)
+    else
+        fun_l7_n618(x)
+    end
+end
+
+def fun_l6_n902(x)
+    if (x < 1)
+        fun_l7_n762(x)
+    else
+        fun_l7_n778(x)
+    end
+end
+
+def fun_l6_n903(x)
+    if (x < 1)
+        fun_l7_n343(x)
+    else
+        fun_l7_n349(x)
+    end
+end
+
+def fun_l6_n904(x)
+    if (x < 1)
+        fun_l7_n310(x)
+    else
+        fun_l7_n215(x)
+    end
+end
+
+def fun_l6_n905(x)
+    if (x < 1)
+        fun_l7_n162(x)
+    else
+        fun_l7_n405(x)
+    end
+end
+
+def fun_l6_n906(x)
+    if (x < 1)
+        fun_l7_n667(x)
+    else
+        fun_l7_n633(x)
+    end
+end
+
+def fun_l6_n907(x)
+    if (x < 1)
+        fun_l7_n652(x)
+    else
+        fun_l7_n771(x)
+    end
+end
+
+def fun_l6_n908(x)
+    if (x < 1)
+        fun_l7_n198(x)
+    else
+        fun_l7_n32(x)
+    end
+end
+
+def fun_l6_n909(x)
+    if (x < 1)
+        fun_l7_n577(x)
+    else
+        fun_l7_n116(x)
+    end
+end
+
+def fun_l6_n910(x)
+    if (x < 1)
+        fun_l7_n63(x)
+    else
+        fun_l7_n57(x)
+    end
+end
+
+def fun_l6_n911(x)
+    if (x < 1)
+        fun_l7_n908(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n912(x)
+    if (x < 1)
+        fun_l7_n420(x)
+    else
+        fun_l7_n163(x)
+    end
+end
+
+def fun_l6_n913(x)
+    if (x < 1)
+        fun_l7_n795(x)
+    else
+        fun_l7_n225(x)
+    end
+end
+
+def fun_l6_n914(x)
+    if (x < 1)
+        fun_l7_n855(x)
+    else
+        fun_l7_n742(x)
+    end
+end
+
+def fun_l6_n915(x)
+    if (x < 1)
+        fun_l7_n386(x)
+    else
+        fun_l7_n314(x)
+    end
+end
+
+def fun_l6_n916(x)
+    if (x < 1)
+        fun_l7_n587(x)
+    else
+        fun_l7_n371(x)
+    end
+end
+
+def fun_l6_n917(x)
+    if (x < 1)
+        fun_l7_n570(x)
+    else
+        fun_l7_n735(x)
+    end
+end
+
+def fun_l6_n918(x)
+    if (x < 1)
+        fun_l7_n985(x)
+    else
+        fun_l7_n492(x)
+    end
+end
+
+def fun_l6_n919(x)
+    if (x < 1)
+        fun_l7_n991(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n920(x)
+    if (x < 1)
+        fun_l7_n925(x)
+    else
+        fun_l7_n161(x)
+    end
+end
+
+def fun_l6_n921(x)
+    if (x < 1)
+        fun_l7_n398(x)
+    else
+        fun_l7_n621(x)
+    end
+end
+
+def fun_l6_n922(x)
+    if (x < 1)
+        fun_l7_n732(x)
+    else
+        fun_l7_n509(x)
+    end
+end
+
+def fun_l6_n923(x)
+    if (x < 1)
+        fun_l7_n879(x)
+    else
+        fun_l7_n219(x)
+    end
+end
+
+def fun_l6_n924(x)
+    if (x < 1)
+        fun_l7_n19(x)
+    else
+        fun_l7_n604(x)
+    end
+end
+
+def fun_l6_n925(x)
+    if (x < 1)
+        fun_l7_n474(x)
+    else
+        fun_l7_n439(x)
+    end
+end
+
+def fun_l6_n926(x)
+    if (x < 1)
+        fun_l7_n807(x)
+    else
+        fun_l7_n802(x)
+    end
+end
+
+def fun_l6_n927(x)
+    if (x < 1)
+        fun_l7_n146(x)
+    else
+        fun_l7_n966(x)
+    end
+end
+
+def fun_l6_n928(x)
+    if (x < 1)
+        fun_l7_n72(x)
+    else
+        fun_l7_n835(x)
+    end
+end
+
+def fun_l6_n929(x)
+    if (x < 1)
+        fun_l7_n389(x)
+    else
+        fun_l7_n951(x)
+    end
+end
+
+def fun_l6_n930(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n719(x)
+    end
+end
+
+def fun_l6_n931(x)
+    if (x < 1)
+        fun_l7_n250(x)
+    else
+        fun_l7_n13(x)
+    end
+end
+
+def fun_l6_n932(x)
+    if (x < 1)
+        fun_l7_n470(x)
+    else
+        fun_l7_n984(x)
+    end
+end
+
+def fun_l6_n933(x)
+    if (x < 1)
+        fun_l7_n485(x)
+    else
+        fun_l7_n750(x)
+    end
+end
+
+def fun_l6_n934(x)
+    if (x < 1)
+        fun_l7_n371(x)
+    else
+        fun_l7_n912(x)
+    end
+end
+
+def fun_l6_n935(x)
+    if (x < 1)
+        fun_l7_n686(x)
+    else
+        fun_l7_n523(x)
+    end
+end
+
+def fun_l6_n936(x)
+    if (x < 1)
+        fun_l7_n998(x)
+    else
+        fun_l7_n6(x)
+    end
+end
+
+def fun_l6_n937(x)
+    if (x < 1)
+        fun_l7_n753(x)
+    else
+        fun_l7_n781(x)
+    end
+end
+
+def fun_l6_n938(x)
+    if (x < 1)
+        fun_l7_n518(x)
+    else
+        fun_l7_n18(x)
+    end
+end
+
+def fun_l6_n939(x)
+    if (x < 1)
+        fun_l7_n771(x)
+    else
+        fun_l7_n1(x)
+    end
+end
+
+def fun_l6_n940(x)
+    if (x < 1)
+        fun_l7_n43(x)
+    else
+        fun_l7_n727(x)
+    end
+end
+
+def fun_l6_n941(x)
+    if (x < 1)
+        fun_l7_n282(x)
+    else
+        fun_l7_n676(x)
+    end
+end
+
+def fun_l6_n942(x)
+    if (x < 1)
+        fun_l7_n284(x)
+    else
+        fun_l7_n56(x)
+    end
+end
+
+def fun_l6_n943(x)
+    if (x < 1)
+        fun_l7_n304(x)
+    else
+        fun_l7_n287(x)
+    end
+end
+
+def fun_l6_n944(x)
+    if (x < 1)
+        fun_l7_n968(x)
+    else
+        fun_l7_n283(x)
+    end
+end
+
+def fun_l6_n945(x)
+    if (x < 1)
+        fun_l7_n892(x)
+    else
+        fun_l7_n413(x)
+    end
+end
+
+def fun_l6_n946(x)
+    if (x < 1)
+        fun_l7_n750(x)
+    else
+        fun_l7_n244(x)
+    end
+end
+
+def fun_l6_n947(x)
+    if (x < 1)
+        fun_l7_n599(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n948(x)
+    if (x < 1)
+        fun_l7_n447(x)
+    else
+        fun_l7_n880(x)
+    end
+end
+
+def fun_l6_n949(x)
+    if (x < 1)
+        fun_l7_n242(x)
+    else
+        fun_l7_n210(x)
+    end
+end
+
+def fun_l6_n950(x)
+    if (x < 1)
+        fun_l7_n143(x)
+    else
+        fun_l7_n816(x)
+    end
+end
+
+def fun_l6_n951(x)
+    if (x < 1)
+        fun_l7_n125(x)
+    else
+        fun_l7_n909(x)
+    end
+end
+
+def fun_l6_n952(x)
+    if (x < 1)
+        fun_l7_n134(x)
+    else
+        fun_l7_n946(x)
+    end
+end
+
+def fun_l6_n953(x)
+    if (x < 1)
+        fun_l7_n858(x)
+    else
+        fun_l7_n927(x)
+    end
+end
+
+def fun_l6_n954(x)
+    if (x < 1)
+        fun_l7_n853(x)
+    else
+        fun_l7_n396(x)
+    end
+end
+
+def fun_l6_n955(x)
+    if (x < 1)
+        fun_l7_n725(x)
+    else
+        fun_l7_n42(x)
+    end
+end
+
+def fun_l6_n956(x)
+    if (x < 1)
+        fun_l7_n108(x)
+    else
+        fun_l7_n177(x)
+    end
+end
+
+def fun_l6_n957(x)
+    if (x < 1)
+        fun_l7_n742(x)
+    else
+        fun_l7_n482(x)
+    end
+end
+
+def fun_l6_n958(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n292(x)
+    end
+end
+
+def fun_l6_n959(x)
+    if (x < 1)
+        fun_l7_n325(x)
+    else
+        fun_l7_n27(x)
+    end
+end
+
+def fun_l6_n960(x)
+    if (x < 1)
+        fun_l7_n558(x)
+    else
+        fun_l7_n556(x)
+    end
+end
+
+def fun_l6_n961(x)
+    if (x < 1)
+        fun_l7_n472(x)
+    else
+        fun_l7_n322(x)
+    end
+end
+
+def fun_l6_n962(x)
+    if (x < 1)
+        fun_l7_n754(x)
+    else
+        fun_l7_n729(x)
+    end
+end
+
+def fun_l6_n963(x)
+    if (x < 1)
+        fun_l7_n35(x)
+    else
+        fun_l7_n232(x)
+    end
+end
+
+def fun_l6_n964(x)
+    if (x < 1)
+        fun_l7_n113(x)
+    else
+        fun_l7_n878(x)
+    end
+end
+
+def fun_l6_n965(x)
+    if (x < 1)
+        fun_l7_n982(x)
+    else
+        fun_l7_n404(x)
+    end
+end
+
+def fun_l6_n966(x)
+    if (x < 1)
+        fun_l7_n385(x)
+    else
+        fun_l7_n20(x)
+    end
+end
+
+def fun_l6_n967(x)
+    if (x < 1)
+        fun_l7_n394(x)
+    else
+        fun_l7_n873(x)
+    end
+end
+
+def fun_l6_n968(x)
+    if (x < 1)
+        fun_l7_n230(x)
+    else
+        fun_l7_n141(x)
+    end
+end
+
+def fun_l6_n969(x)
+    if (x < 1)
+        fun_l7_n742(x)
+    else
+        fun_l7_n75(x)
+    end
+end
+
+def fun_l6_n970(x)
+    if (x < 1)
+        fun_l7_n583(x)
+    else
+        fun_l7_n809(x)
+    end
+end
+
+def fun_l6_n971(x)
+    if (x < 1)
+        fun_l7_n535(x)
+    else
+        fun_l7_n151(x)
+    end
+end
+
+def fun_l6_n972(x)
+    if (x < 1)
+        fun_l7_n42(x)
+    else
+        fun_l7_n469(x)
+    end
+end
+
+def fun_l6_n973(x)
+    if (x < 1)
+        fun_l7_n964(x)
+    else
+        fun_l7_n759(x)
+    end
+end
+
+def fun_l6_n974(x)
+    if (x < 1)
+        fun_l7_n897(x)
+    else
+        fun_l7_n29(x)
+    end
+end
+
+def fun_l6_n975(x)
+    if (x < 1)
+        fun_l7_n331(x)
+    else
+        fun_l7_n972(x)
+    end
+end
+
+def fun_l6_n976(x)
+    if (x < 1)
+        fun_l7_n825(x)
+    else
+        fun_l7_n221(x)
+    end
+end
+
+def fun_l6_n977(x)
+    if (x < 1)
+        fun_l7_n207(x)
+    else
+        fun_l7_n520(x)
+    end
+end
+
+def fun_l6_n978(x)
+    if (x < 1)
+        fun_l7_n231(x)
+    else
+        fun_l7_n552(x)
+    end
+end
+
+def fun_l6_n979(x)
+    if (x < 1)
+        fun_l7_n621(x)
+    else
+        fun_l7_n766(x)
+    end
+end
+
+def fun_l6_n980(x)
+    if (x < 1)
+        fun_l7_n461(x)
+    else
+        fun_l7_n552(x)
+    end
+end
+
+def fun_l6_n981(x)
+    if (x < 1)
+        fun_l7_n891(x)
+    else
+        fun_l7_n710(x)
+    end
+end
+
+def fun_l6_n982(x)
+    if (x < 1)
+        fun_l7_n253(x)
+    else
+        fun_l7_n104(x)
+    end
+end
+
+def fun_l6_n983(x)
+    if (x < 1)
+        fun_l7_n726(x)
+    else
+        fun_l7_n903(x)
+    end
+end
+
+def fun_l6_n984(x)
+    if (x < 1)
+        fun_l7_n524(x)
+    else
+        fun_l7_n700(x)
+    end
+end
+
+def fun_l6_n985(x)
+    if (x < 1)
+        fun_l7_n234(x)
+    else
+        fun_l7_n454(x)
+    end
+end
+
+def fun_l6_n986(x)
+    if (x < 1)
+        fun_l7_n379(x)
+    else
+        fun_l7_n504(x)
+    end
+end
+
+def fun_l6_n987(x)
+    if (x < 1)
+        fun_l7_n194(x)
+    else
+        fun_l7_n962(x)
+    end
+end
+
+def fun_l6_n988(x)
+    if (x < 1)
+        fun_l7_n60(x)
+    else
+        fun_l7_n699(x)
+    end
+end
+
+def fun_l6_n989(x)
+    if (x < 1)
+        fun_l7_n692(x)
+    else
+        fun_l7_n28(x)
+    end
+end
+
+def fun_l6_n990(x)
+    if (x < 1)
+        fun_l7_n456(x)
+    else
+        fun_l7_n126(x)
+    end
+end
+
+def fun_l6_n991(x)
+    if (x < 1)
+        fun_l7_n104(x)
+    else
+        fun_l7_n156(x)
+    end
+end
+
+def fun_l6_n992(x)
+    if (x < 1)
+        fun_l7_n269(x)
+    else
+        fun_l7_n513(x)
+    end
+end
+
+def fun_l6_n993(x)
+    if (x < 1)
+        fun_l7_n20(x)
+    else
+        fun_l7_n754(x)
+    end
+end
+
+def fun_l6_n994(x)
+    if (x < 1)
+        fun_l7_n445(x)
+    else
+        fun_l7_n422(x)
+    end
+end
+
+def fun_l6_n995(x)
+    if (x < 1)
+        fun_l7_n320(x)
+    else
+        fun_l7_n398(x)
+    end
+end
+
+def fun_l6_n996(x)
+    if (x < 1)
+        fun_l7_n479(x)
+    else
+        fun_l7_n238(x)
+    end
+end
+
+def fun_l6_n997(x)
+    if (x < 1)
+        fun_l7_n254(x)
+    else
+        fun_l7_n692(x)
+    end
+end
+
+def fun_l6_n998(x)
+    if (x < 1)
+        fun_l7_n774(x)
+    else
+        fun_l7_n510(x)
+    end
+end
+
+def fun_l6_n999(x)
+    if (x < 1)
+        fun_l7_n158(x)
+    else
+        fun_l7_n929(x)
+    end
+end
+
+def fun_l7_n0(x)
+    if (x < 1)
+        fun_l8_n414(x)
+    else
+        fun_l8_n327(x)
+    end
+end
+
+def fun_l7_n1(x)
+    if (x < 1)
+        fun_l8_n446(x)
+    else
+        fun_l8_n611(x)
+    end
+end
+
+def fun_l7_n2(x)
+    if (x < 1)
+        fun_l8_n116(x)
+    else
+        fun_l8_n224(x)
+    end
+end
+
+def fun_l7_n3(x)
+    if (x < 1)
+        fun_l8_n809(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n4(x)
+    if (x < 1)
+        fun_l8_n137(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n5(x)
+    if (x < 1)
+        fun_l8_n686(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n6(x)
+    if (x < 1)
+        fun_l8_n430(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n7(x)
+    if (x < 1)
+        fun_l8_n865(x)
+    else
+        fun_l8_n60(x)
+    end
+end
+
+def fun_l7_n8(x)
+    if (x < 1)
+        fun_l8_n895(x)
+    else
+        fun_l8_n148(x)
+    end
+end
+
+def fun_l7_n9(x)
+    if (x < 1)
+        fun_l8_n740(x)
+    else
+        fun_l8_n982(x)
+    end
+end
+
+def fun_l7_n10(x)
+    if (x < 1)
+        fun_l8_n757(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n11(x)
+    if (x < 1)
+        fun_l8_n744(x)
+    else
+        fun_l8_n256(x)
+    end
+end
+
+def fun_l7_n12(x)
+    if (x < 1)
+        fun_l8_n272(x)
+    else
+        fun_l8_n828(x)
+    end
+end
+
+def fun_l7_n13(x)
+    if (x < 1)
+        fun_l8_n395(x)
+    else
+        fun_l8_n932(x)
+    end
+end
+
+def fun_l7_n14(x)
+    if (x < 1)
+        fun_l8_n178(x)
+    else
+        fun_l8_n676(x)
+    end
+end
+
+def fun_l7_n15(x)
+    if (x < 1)
+        fun_l8_n40(x)
+    else
+        fun_l8_n548(x)
+    end
+end
+
+def fun_l7_n16(x)
+    if (x < 1)
+        fun_l8_n506(x)
+    else
+        fun_l8_n234(x)
+    end
+end
+
+def fun_l7_n17(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n56(x)
+    end
+end
+
+def fun_l7_n18(x)
+    if (x < 1)
+        fun_l8_n381(x)
+    else
+        fun_l8_n720(x)
+    end
+end
+
+def fun_l7_n19(x)
+    if (x < 1)
+        fun_l8_n781(x)
+    else
+        fun_l8_n605(x)
+    end
+end
+
+def fun_l7_n20(x)
+    if (x < 1)
+        fun_l8_n479(x)
+    else
+        fun_l8_n894(x)
+    end
+end
+
+def fun_l7_n21(x)
+    if (x < 1)
+        fun_l8_n437(x)
+    else
+        fun_l8_n123(x)
+    end
+end
+
+def fun_l7_n22(x)
+    if (x < 1)
+        fun_l8_n20(x)
+    else
+        fun_l8_n144(x)
+    end
+end
+
+def fun_l7_n23(x)
+    if (x < 1)
+        fun_l8_n684(x)
+    else
+        fun_l8_n866(x)
+    end
+end
+
+def fun_l7_n24(x)
+    if (x < 1)
+        fun_l8_n527(x)
+    else
+        fun_l8_n629(x)
+    end
+end
+
+def fun_l7_n25(x)
+    if (x < 1)
+        fun_l8_n399(x)
+    else
+        fun_l8_n52(x)
+    end
+end
+
+def fun_l7_n26(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n438(x)
+    end
+end
+
+def fun_l7_n27(x)
+    if (x < 1)
+        fun_l8_n916(x)
+    else
+        fun_l8_n488(x)
+    end
+end
+
+def fun_l7_n28(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n585(x)
+    end
+end
+
+def fun_l7_n29(x)
+    if (x < 1)
+        fun_l8_n38(x)
+    else
+        fun_l8_n785(x)
+    end
+end
+
+def fun_l7_n30(x)
+    if (x < 1)
+        fun_l8_n157(x)
+    else
+        fun_l8_n332(x)
+    end
+end
+
+def fun_l7_n31(x)
+    if (x < 1)
+        fun_l8_n467(x)
+    else
+        fun_l8_n442(x)
+    end
+end
+
+def fun_l7_n32(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n295(x)
+    end
+end
+
+def fun_l7_n33(x)
+    if (x < 1)
+        fun_l8_n829(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n34(x)
+    if (x < 1)
+        fun_l8_n227(x)
+    else
+        fun_l8_n865(x)
+    end
+end
+
+def fun_l7_n35(x)
+    if (x < 1)
+        fun_l8_n930(x)
+    else
+        fun_l8_n129(x)
+    end
+end
+
+def fun_l7_n36(x)
+    if (x < 1)
+        fun_l8_n519(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n37(x)
+    if (x < 1)
+        fun_l8_n132(x)
+    else
+        fun_l8_n547(x)
+    end
+end
+
+def fun_l7_n38(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n712(x)
+    end
+end
+
+def fun_l7_n39(x)
+    if (x < 1)
+        fun_l8_n752(x)
+    else
+        fun_l8_n357(x)
+    end
+end
+
+def fun_l7_n40(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n41(x)
+    if (x < 1)
+        fun_l8_n89(x)
+    else
+        fun_l8_n492(x)
+    end
+end
+
+def fun_l7_n42(x)
+    if (x < 1)
+        fun_l8_n508(x)
+    else
+        fun_l8_n288(x)
+    end
+end
+
+def fun_l7_n43(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n632(x)
+    end
+end
+
+def fun_l7_n44(x)
+    if (x < 1)
+        fun_l8_n513(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n45(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n581(x)
+    end
+end
+
+def fun_l7_n46(x)
+    if (x < 1)
+        fun_l8_n907(x)
+    else
+        fun_l8_n71(x)
+    end
+end
+
+def fun_l7_n47(x)
+    if (x < 1)
+        fun_l8_n609(x)
+    else
+        fun_l8_n601(x)
+    end
+end
+
+def fun_l7_n48(x)
+    if (x < 1)
+        fun_l8_n985(x)
+    else
+        fun_l8_n536(x)
+    end
+end
+
+def fun_l7_n49(x)
+    if (x < 1)
+        fun_l8_n220(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n50(x)
+    if (x < 1)
+        fun_l8_n445(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n51(x)
+    if (x < 1)
+        fun_l8_n973(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n52(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n70(x)
+    end
+end
+
+def fun_l7_n53(x)
+    if (x < 1)
+        fun_l8_n745(x)
+    else
+        fun_l8_n237(x)
+    end
+end
+
+def fun_l7_n54(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n756(x)
+    end
+end
+
+def fun_l7_n55(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n56(x)
+    if (x < 1)
+        fun_l8_n564(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n57(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n832(x)
+    end
+end
+
+def fun_l7_n58(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n59(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n60(x)
+    if (x < 1)
+        fun_l8_n407(x)
+    else
+        fun_l8_n573(x)
+    end
+end
+
+def fun_l7_n61(x)
+    if (x < 1)
+        fun_l8_n705(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n62(x)
+    if (x < 1)
+        fun_l8_n715(x)
+    else
+        fun_l8_n394(x)
+    end
+end
+
+def fun_l7_n63(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n64(x)
+    if (x < 1)
+        fun_l8_n525(x)
+    else
+        fun_l8_n81(x)
+    end
+end
+
+def fun_l7_n65(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n372(x)
+    end
+end
+
+def fun_l7_n66(x)
+    if (x < 1)
+        fun_l8_n286(x)
+    else
+        fun_l8_n568(x)
+    end
+end
+
+def fun_l7_n67(x)
+    if (x < 1)
+        fun_l8_n829(x)
+    else
+        fun_l8_n89(x)
+    end
+end
+
+def fun_l7_n68(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n362(x)
+    end
+end
+
+def fun_l7_n69(x)
+    if (x < 1)
+        fun_l8_n673(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n70(x)
+    if (x < 1)
+        fun_l8_n649(x)
+    else
+        fun_l8_n890(x)
+    end
+end
+
+def fun_l7_n71(x)
+    if (x < 1)
+        fun_l8_n639(x)
+    else
+        fun_l8_n304(x)
+    end
+end
+
+def fun_l7_n72(x)
+    if (x < 1)
+        fun_l8_n797(x)
+    else
+        fun_l8_n132(x)
+    end
+end
+
+def fun_l7_n73(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n328(x)
+    end
+end
+
+def fun_l7_n74(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n75(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n621(x)
+    end
+end
+
+def fun_l7_n76(x)
+    if (x < 1)
+        fun_l8_n136(x)
+    else
+        fun_l8_n916(x)
+    end
+end
+
+def fun_l7_n77(x)
+    if (x < 1)
+        fun_l8_n39(x)
+    else
+        fun_l8_n945(x)
+    end
+end
+
+def fun_l7_n78(x)
+    if (x < 1)
+        fun_l8_n365(x)
+    else
+        fun_l8_n883(x)
+    end
+end
+
+def fun_l7_n79(x)
+    if (x < 1)
+        fun_l8_n514(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n80(x)
+    if (x < 1)
+        fun_l8_n378(x)
+    else
+        fun_l8_n634(x)
+    end
+end
+
+def fun_l7_n81(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n73(x)
+    end
+end
+
+def fun_l7_n82(x)
+    if (x < 1)
+        fun_l8_n521(x)
+    else
+        fun_l8_n848(x)
+    end
+end
+
+def fun_l7_n83(x)
+    if (x < 1)
+        fun_l8_n184(x)
+    else
+        fun_l8_n350(x)
+    end
+end
+
+def fun_l7_n84(x)
+    if (x < 1)
+        fun_l8_n215(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n85(x)
+    if (x < 1)
+        fun_l8_n556(x)
+    else
+        fun_l8_n723(x)
+    end
+end
+
+def fun_l7_n86(x)
+    if (x < 1)
+        fun_l8_n565(x)
+    else
+        fun_l8_n661(x)
+    end
+end
+
+def fun_l7_n87(x)
+    if (x < 1)
+        fun_l8_n22(x)
+    else
+        fun_l8_n623(x)
+    end
+end
+
+def fun_l7_n88(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n30(x)
+    end
+end
+
+def fun_l7_n89(x)
+    if (x < 1)
+        fun_l8_n912(x)
+    else
+        fun_l8_n332(x)
+    end
+end
+
+def fun_l7_n90(x)
+    if (x < 1)
+        fun_l8_n776(x)
+    else
+        fun_l8_n362(x)
+    end
+end
+
+def fun_l7_n91(x)
+    if (x < 1)
+        fun_l8_n720(x)
+    else
+        fun_l8_n512(x)
+    end
+end
+
+def fun_l7_n92(x)
+    if (x < 1)
+        fun_l8_n437(x)
+    else
+        fun_l8_n107(x)
+    end
+end
+
+def fun_l7_n93(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n94(x)
+    if (x < 1)
+        fun_l8_n814(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n95(x)
+    if (x < 1)
+        fun_l8_n117(x)
+    else
+        fun_l8_n18(x)
+    end
+end
+
+def fun_l7_n96(x)
+    if (x < 1)
+        fun_l8_n769(x)
+    else
+        fun_l8_n37(x)
+    end
+end
+
+def fun_l7_n97(x)
+    if (x < 1)
+        fun_l8_n213(x)
+    else
+        fun_l8_n5(x)
+    end
+end
+
+def fun_l7_n98(x)
+    if (x < 1)
+        fun_l8_n608(x)
+    else
+        fun_l8_n551(x)
+    end
+end
+
+def fun_l7_n99(x)
+    if (x < 1)
+        fun_l8_n130(x)
+    else
+        fun_l8_n879(x)
+    end
+end
+
+def fun_l7_n100(x)
+    if (x < 1)
+        fun_l8_n279(x)
+    else
+        fun_l8_n786(x)
+    end
+end
+
+def fun_l7_n101(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n904(x)
+    end
+end
+
+def fun_l7_n102(x)
+    if (x < 1)
+        fun_l8_n661(x)
+    else
+        fun_l8_n873(x)
+    end
+end
+
+def fun_l7_n103(x)
+    if (x < 1)
+        fun_l8_n360(x)
+    else
+        fun_l8_n793(x)
+    end
+end
+
+def fun_l7_n104(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n853(x)
+    end
+end
+
+def fun_l7_n105(x)
+    if (x < 1)
+        fun_l8_n168(x)
+    else
+        fun_l8_n280(x)
+    end
+end
+
+def fun_l7_n106(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n222(x)
+    end
+end
+
+def fun_l7_n107(x)
+    if (x < 1)
+        fun_l8_n470(x)
+    else
+        fun_l8_n633(x)
+    end
+end
+
+def fun_l7_n108(x)
+    if (x < 1)
+        fun_l8_n495(x)
+    else
+        fun_l8_n253(x)
+    end
+end
+
+def fun_l7_n109(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n108(x)
+    end
+end
+
+def fun_l7_n110(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n162(x)
+    end
+end
+
+def fun_l7_n111(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n295(x)
+    end
+end
+
+def fun_l7_n112(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n113(x)
+    if (x < 1)
+        fun_l8_n237(x)
+    else
+        fun_l8_n484(x)
+    end
+end
+
+def fun_l7_n114(x)
+    if (x < 1)
+        fun_l8_n755(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n115(x)
+    if (x < 1)
+        fun_l8_n542(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n116(x)
+    if (x < 1)
+        fun_l8_n837(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n117(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n104(x)
+    end
+end
+
+def fun_l7_n118(x)
+    if (x < 1)
+        fun_l8_n201(x)
+    else
+        fun_l8_n340(x)
+    end
+end
+
+def fun_l7_n119(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n213(x)
+    end
+end
+
+def fun_l7_n120(x)
+    if (x < 1)
+        fun_l8_n563(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n121(x)
+    if (x < 1)
+        fun_l8_n738(x)
+    else
+        fun_l8_n600(x)
+    end
+end
+
+def fun_l7_n122(x)
+    if (x < 1)
+        fun_l8_n261(x)
+    else
+        fun_l8_n500(x)
+    end
+end
+
+def fun_l7_n123(x)
+    if (x < 1)
+        fun_l8_n870(x)
+    else
+        fun_l8_n423(x)
+    end
+end
+
+def fun_l7_n124(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n749(x)
+    end
+end
+
+def fun_l7_n125(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n126(x)
+    if (x < 1)
+        fun_l8_n382(x)
+    else
+        fun_l8_n379(x)
+    end
+end
+
+def fun_l7_n127(x)
+    if (x < 1)
+        fun_l8_n232(x)
+    else
+        fun_l8_n913(x)
+    end
+end
+
+def fun_l7_n128(x)
+    if (x < 1)
+        fun_l8_n7(x)
+    else
+        fun_l8_n177(x)
+    end
+end
+
+def fun_l7_n129(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n670(x)
+    end
+end
+
+def fun_l7_n130(x)
+    if (x < 1)
+        fun_l8_n361(x)
+    else
+        fun_l8_n132(x)
+    end
+end
+
+def fun_l7_n131(x)
+    if (x < 1)
+        fun_l8_n125(x)
+    else
+        fun_l8_n925(x)
+    end
+end
+
+def fun_l7_n132(x)
+    if (x < 1)
+        fun_l8_n529(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n133(x)
+    if (x < 1)
+        fun_l8_n283(x)
+    else
+        fun_l8_n112(x)
+    end
+end
+
+def fun_l7_n134(x)
+    if (x < 1)
+        fun_l8_n974(x)
+    else
+        fun_l8_n204(x)
+    end
+end
+
+def fun_l7_n135(x)
+    if (x < 1)
+        fun_l8_n903(x)
+    else
+        fun_l8_n196(x)
+    end
+end
+
+def fun_l7_n136(x)
+    if (x < 1)
+        fun_l8_n59(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n137(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n31(x)
+    end
+end
+
+def fun_l7_n138(x)
+    if (x < 1)
+        fun_l8_n990(x)
+    else
+        fun_l8_n924(x)
+    end
+end
+
+def fun_l7_n139(x)
+    if (x < 1)
+        fun_l8_n202(x)
+    else
+        fun_l8_n980(x)
+    end
+end
+
+def fun_l7_n140(x)
+    if (x < 1)
+        fun_l8_n354(x)
+    else
+        fun_l8_n694(x)
+    end
+end
+
+def fun_l7_n141(x)
+    if (x < 1)
+        fun_l8_n306(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n142(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n902(x)
+    end
+end
+
+def fun_l7_n143(x)
+    if (x < 1)
+        fun_l8_n522(x)
+    else
+        fun_l8_n904(x)
+    end
+end
+
+def fun_l7_n144(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n11(x)
+    end
+end
+
+def fun_l7_n145(x)
+    if (x < 1)
+        fun_l8_n147(x)
+    else
+        fun_l8_n21(x)
+    end
+end
+
+def fun_l7_n146(x)
+    if (x < 1)
+        fun_l8_n47(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n147(x)
+    if (x < 1)
+        fun_l8_n306(x)
+    else
+        fun_l8_n309(x)
+    end
+end
+
+def fun_l7_n148(x)
+    if (x < 1)
+        fun_l8_n757(x)
+    else
+        fun_l8_n83(x)
+    end
+end
+
+def fun_l7_n149(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n124(x)
+    end
+end
+
+def fun_l7_n150(x)
+    if (x < 1)
+        fun_l8_n276(x)
+    else
+        fun_l8_n838(x)
+    end
+end
+
+def fun_l7_n151(x)
+    if (x < 1)
+        fun_l8_n148(x)
+    else
+        fun_l8_n653(x)
+    end
+end
+
+def fun_l7_n152(x)
+    if (x < 1)
+        fun_l8_n315(x)
+    else
+        fun_l8_n942(x)
+    end
+end
+
+def fun_l7_n153(x)
+    if (x < 1)
+        fun_l8_n794(x)
+    else
+        fun_l8_n680(x)
+    end
+end
+
+def fun_l7_n154(x)
+    if (x < 1)
+        fun_l8_n508(x)
+    else
+        fun_l8_n427(x)
+    end
+end
+
+def fun_l7_n155(x)
+    if (x < 1)
+        fun_l8_n249(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n156(x)
+    if (x < 1)
+        fun_l8_n339(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n157(x)
+    if (x < 1)
+        fun_l8_n772(x)
+    else
+        fun_l8_n128(x)
+    end
+end
+
+def fun_l7_n158(x)
+    if (x < 1)
+        fun_l8_n247(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n159(x)
+    if (x < 1)
+        fun_l8_n648(x)
+    else
+        fun_l8_n338(x)
+    end
+end
+
+def fun_l7_n160(x)
+    if (x < 1)
+        fun_l8_n104(x)
+    else
+        fun_l8_n757(x)
+    end
+end
+
+def fun_l7_n161(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n288(x)
+    end
+end
+
+def fun_l7_n162(x)
+    if (x < 1)
+        fun_l8_n849(x)
+    else
+        fun_l8_n982(x)
+    end
+end
+
+def fun_l7_n163(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n442(x)
+    end
+end
+
+def fun_l7_n164(x)
+    if (x < 1)
+        fun_l8_n268(x)
+    else
+        fun_l8_n717(x)
+    end
+end
+
+def fun_l7_n165(x)
+    if (x < 1)
+        fun_l8_n185(x)
+    else
+        fun_l8_n628(x)
+    end
+end
+
+def fun_l7_n166(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n830(x)
+    end
+end
+
+def fun_l7_n167(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n20(x)
+    end
+end
+
+def fun_l7_n168(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n169(x)
+    if (x < 1)
+        fun_l8_n559(x)
+    else
+        fun_l8_n561(x)
+    end
+end
+
+def fun_l7_n170(x)
+    if (x < 1)
+        fun_l8_n942(x)
+    else
+        fun_l8_n699(x)
+    end
+end
+
+def fun_l7_n171(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n928(x)
+    end
+end
+
+def fun_l7_n172(x)
+    if (x < 1)
+        fun_l8_n564(x)
+    else
+        fun_l8_n972(x)
+    end
+end
+
+def fun_l7_n173(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n125(x)
+    end
+end
+
+def fun_l7_n174(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n175(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n22(x)
+    end
+end
+
+def fun_l7_n176(x)
+    if (x < 1)
+        fun_l8_n955(x)
+    else
+        fun_l8_n579(x)
+    end
+end
+
+def fun_l7_n177(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n675(x)
+    end
+end
+
+def fun_l7_n178(x)
+    if (x < 1)
+        fun_l8_n867(x)
+    else
+        fun_l8_n119(x)
+    end
+end
+
+def fun_l7_n179(x)
+    if (x < 1)
+        fun_l8_n357(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n180(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n181(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n931(x)
+    end
+end
+
+def fun_l7_n182(x)
+    if (x < 1)
+        fun_l8_n962(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n183(x)
+    if (x < 1)
+        fun_l8_n568(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n184(x)
+    if (x < 1)
+        fun_l8_n877(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n185(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n981(x)
+    end
+end
+
+def fun_l7_n186(x)
+    if (x < 1)
+        fun_l8_n283(x)
+    else
+        fun_l8_n81(x)
+    end
+end
+
+def fun_l7_n187(x)
+    if (x < 1)
+        fun_l8_n318(x)
+    else
+        fun_l8_n7(x)
+    end
+end
+
+def fun_l7_n188(x)
+    if (x < 1)
+        fun_l8_n874(x)
+    else
+        fun_l8_n879(x)
+    end
+end
+
+def fun_l7_n189(x)
+    if (x < 1)
+        fun_l8_n944(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n190(x)
+    if (x < 1)
+        fun_l8_n462(x)
+    else
+        fun_l8_n570(x)
+    end
+end
+
+def fun_l7_n191(x)
+    if (x < 1)
+        fun_l8_n815(x)
+    else
+        fun_l8_n957(x)
+    end
+end
+
+def fun_l7_n192(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n93(x)
+    end
+end
+
+def fun_l7_n193(x)
+    if (x < 1)
+        fun_l8_n708(x)
+    else
+        fun_l8_n323(x)
+    end
+end
+
+def fun_l7_n194(x)
+    if (x < 1)
+        fun_l8_n420(x)
+    else
+        fun_l8_n375(x)
+    end
+end
+
+def fun_l7_n195(x)
+    if (x < 1)
+        fun_l8_n307(x)
+    else
+        fun_l8_n427(x)
+    end
+end
+
+def fun_l7_n196(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n265(x)
+    end
+end
+
+def fun_l7_n197(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n687(x)
+    end
+end
+
+def fun_l7_n198(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n420(x)
+    end
+end
+
+def fun_l7_n199(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n200(x)
+    if (x < 1)
+        fun_l8_n418(x)
+    else
+        fun_l8_n758(x)
+    end
+end
+
+def fun_l7_n201(x)
+    if (x < 1)
+        fun_l8_n204(x)
+    else
+        fun_l8_n572(x)
+    end
+end
+
+def fun_l7_n202(x)
+    if (x < 1)
+        fun_l8_n847(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n203(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n595(x)
+    end
+end
+
+def fun_l7_n204(x)
+    if (x < 1)
+        fun_l8_n922(x)
+    else
+        fun_l8_n618(x)
+    end
+end
+
+def fun_l7_n205(x)
+    if (x < 1)
+        fun_l8_n431(x)
+    else
+        fun_l8_n135(x)
+    end
+end
+
+def fun_l7_n206(x)
+    if (x < 1)
+        fun_l8_n92(x)
+    else
+        fun_l8_n370(x)
+    end
+end
+
+def fun_l7_n207(x)
+    if (x < 1)
+        fun_l8_n141(x)
+    else
+        fun_l8_n845(x)
+    end
+end
+
+def fun_l7_n208(x)
+    if (x < 1)
+        fun_l8_n552(x)
+    else
+        fun_l8_n917(x)
+    end
+end
+
+def fun_l7_n209(x)
+    if (x < 1)
+        fun_l8_n341(x)
+    else
+        fun_l8_n794(x)
+    end
+end
+
+def fun_l7_n210(x)
+    if (x < 1)
+        fun_l8_n772(x)
+    else
+        fun_l8_n515(x)
+    end
+end
+
+def fun_l7_n211(x)
+    if (x < 1)
+        fun_l8_n37(x)
+    else
+        fun_l8_n635(x)
+    end
+end
+
+def fun_l7_n212(x)
+    if (x < 1)
+        fun_l8_n164(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n213(x)
+    if (x < 1)
+        fun_l8_n621(x)
+    else
+        fun_l8_n722(x)
+    end
+end
+
+def fun_l7_n214(x)
+    if (x < 1)
+        fun_l8_n475(x)
+    else
+        fun_l8_n854(x)
+    end
+end
+
+def fun_l7_n215(x)
+    if (x < 1)
+        fun_l8_n275(x)
+    else
+        fun_l8_n884(x)
+    end
+end
+
+def fun_l7_n216(x)
+    if (x < 1)
+        fun_l8_n894(x)
+    else
+        fun_l8_n424(x)
+    end
+end
+
+def fun_l7_n217(x)
+    if (x < 1)
+        fun_l8_n32(x)
+    else
+        fun_l8_n698(x)
+    end
+end
+
+def fun_l7_n218(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n219(x)
+    if (x < 1)
+        fun_l8_n294(x)
+    else
+        fun_l8_n583(x)
+    end
+end
+
+def fun_l7_n220(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n221(x)
+    if (x < 1)
+        fun_l8_n925(x)
+    else
+        fun_l8_n177(x)
+    end
+end
+
+def fun_l7_n222(x)
+    if (x < 1)
+        fun_l8_n495(x)
+    else
+        fun_l8_n407(x)
+    end
+end
+
+def fun_l7_n223(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n753(x)
+    end
+end
+
+def fun_l7_n224(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n546(x)
+    end
+end
+
+def fun_l7_n225(x)
+    if (x < 1)
+        fun_l8_n644(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n226(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n292(x)
+    end
+end
+
+def fun_l7_n227(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n521(x)
+    end
+end
+
+def fun_l7_n228(x)
+    if (x < 1)
+        fun_l8_n479(x)
+    else
+        fun_l8_n329(x)
+    end
+end
+
+def fun_l7_n229(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n230(x)
+    if (x < 1)
+        fun_l8_n58(x)
+    else
+        fun_l8_n369(x)
+    end
+end
+
+def fun_l7_n231(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n869(x)
+    end
+end
+
+def fun_l7_n232(x)
+    if (x < 1)
+        fun_l8_n810(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n233(x)
+    if (x < 1)
+        fun_l8_n19(x)
+    else
+        fun_l8_n278(x)
+    end
+end
+
+def fun_l7_n234(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n826(x)
+    end
+end
+
+def fun_l7_n235(x)
+    if (x < 1)
+        fun_l8_n302(x)
+    else
+        fun_l8_n62(x)
+    end
+end
+
+def fun_l7_n236(x)
+    if (x < 1)
+        fun_l8_n289(x)
+    else
+        fun_l8_n935(x)
+    end
+end
+
+def fun_l7_n237(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n238(x)
+    if (x < 1)
+        fun_l8_n234(x)
+    else
+        fun_l8_n720(x)
+    end
+end
+
+def fun_l7_n239(x)
+    if (x < 1)
+        fun_l8_n158(x)
+    else
+        fun_l8_n409(x)
+    end
+end
+
+def fun_l7_n240(x)
+    if (x < 1)
+        fun_l8_n478(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n241(x)
+    if (x < 1)
+        fun_l8_n115(x)
+    else
+        fun_l8_n406(x)
+    end
+end
+
+def fun_l7_n242(x)
+    if (x < 1)
+        fun_l8_n278(x)
+    else
+        fun_l8_n12(x)
+    end
+end
+
+def fun_l7_n243(x)
+    if (x < 1)
+        fun_l8_n273(x)
+    else
+        fun_l8_n243(x)
+    end
+end
+
+def fun_l7_n244(x)
+    if (x < 1)
+        fun_l8_n909(x)
+    else
+        fun_l8_n721(x)
+    end
+end
+
+def fun_l7_n245(x)
+    if (x < 1)
+        fun_l8_n415(x)
+    else
+        fun_l8_n530(x)
+    end
+end
+
+def fun_l7_n246(x)
+    if (x < 1)
+        fun_l8_n770(x)
+    else
+        fun_l8_n413(x)
+    end
+end
+
+def fun_l7_n247(x)
+    if (x < 1)
+        fun_l8_n228(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n248(x)
+    if (x < 1)
+        fun_l8_n174(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n249(x)
+    if (x < 1)
+        fun_l8_n740(x)
+    else
+        fun_l8_n314(x)
+    end
+end
+
+def fun_l7_n250(x)
+    if (x < 1)
+        fun_l8_n293(x)
+    else
+        fun_l8_n835(x)
+    end
+end
+
+def fun_l7_n251(x)
+    if (x < 1)
+        fun_l8_n584(x)
+    else
+        fun_l8_n755(x)
+    end
+end
+
+def fun_l7_n252(x)
+    if (x < 1)
+        fun_l8_n792(x)
+    else
+        fun_l8_n135(x)
+    end
+end
+
+def fun_l7_n253(x)
+    if (x < 1)
+        fun_l8_n116(x)
+    else
+        fun_l8_n82(x)
+    end
+end
+
+def fun_l7_n254(x)
+    if (x < 1)
+        fun_l8_n478(x)
+    else
+        fun_l8_n809(x)
+    end
+end
+
+def fun_l7_n255(x)
+    if (x < 1)
+        fun_l8_n924(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n256(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n669(x)
+    end
+end
+
+def fun_l7_n257(x)
+    if (x < 1)
+        fun_l8_n300(x)
+    else
+        fun_l8_n166(x)
+    end
+end
+
+def fun_l7_n258(x)
+    if (x < 1)
+        fun_l8_n979(x)
+    else
+        fun_l8_n894(x)
+    end
+end
+
+def fun_l7_n259(x)
+    if (x < 1)
+        fun_l8_n765(x)
+    else
+        fun_l8_n838(x)
+    end
+end
+
+def fun_l7_n260(x)
+    if (x < 1)
+        fun_l8_n812(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n261(x)
+    if (x < 1)
+        fun_l8_n220(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n262(x)
+    if (x < 1)
+        fun_l8_n727(x)
+    else
+        fun_l8_n783(x)
+    end
+end
+
+def fun_l7_n263(x)
+    if (x < 1)
+        fun_l8_n560(x)
+    else
+        fun_l8_n781(x)
+    end
+end
+
+def fun_l7_n264(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n33(x)
+    end
+end
+
+def fun_l7_n265(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n64(x)
+    end
+end
+
+def fun_l7_n266(x)
+    if (x < 1)
+        fun_l8_n944(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n267(x)
+    if (x < 1)
+        fun_l8_n154(x)
+    else
+        fun_l8_n103(x)
+    end
+end
+
+def fun_l7_n268(x)
+    if (x < 1)
+        fun_l8_n55(x)
+    else
+        fun_l8_n841(x)
+    end
+end
+
+def fun_l7_n269(x)
+    if (x < 1)
+        fun_l8_n914(x)
+    else
+        fun_l8_n108(x)
+    end
+end
+
+def fun_l7_n270(x)
+    if (x < 1)
+        fun_l8_n733(x)
+    else
+        fun_l8_n398(x)
+    end
+end
+
+def fun_l7_n271(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n735(x)
+    end
+end
+
+def fun_l7_n272(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n216(x)
+    end
+end
+
+def fun_l7_n273(x)
+    if (x < 1)
+        fun_l8_n380(x)
+    else
+        fun_l8_n798(x)
+    end
+end
+
+def fun_l7_n274(x)
+    if (x < 1)
+        fun_l8_n63(x)
+    else
+        fun_l8_n133(x)
+    end
+end
+
+def fun_l7_n275(x)
+    if (x < 1)
+        fun_l8_n878(x)
+    else
+        fun_l8_n284(x)
+    end
+end
+
+def fun_l7_n276(x)
+    if (x < 1)
+        fun_l8_n718(x)
+    else
+        fun_l8_n97(x)
+    end
+end
+
+def fun_l7_n277(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n278(x)
+    if (x < 1)
+        fun_l8_n581(x)
+    else
+        fun_l8_n898(x)
+    end
+end
+
+def fun_l7_n279(x)
+    if (x < 1)
+        fun_l8_n247(x)
+    else
+        fun_l8_n526(x)
+    end
+end
+
+def fun_l7_n280(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n614(x)
+    end
+end
+
+def fun_l7_n281(x)
+    if (x < 1)
+        fun_l8_n301(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n282(x)
+    if (x < 1)
+        fun_l8_n575(x)
+    else
+        fun_l8_n712(x)
+    end
+end
+
+def fun_l7_n283(x)
+    if (x < 1)
+        fun_l8_n261(x)
+    else
+        fun_l8_n740(x)
+    end
+end
+
+def fun_l7_n284(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n350(x)
+    end
+end
+
+def fun_l7_n285(x)
+    if (x < 1)
+        fun_l8_n521(x)
+    else
+        fun_l8_n305(x)
+    end
+end
+
+def fun_l7_n286(x)
+    if (x < 1)
+        fun_l8_n271(x)
+    else
+        fun_l8_n728(x)
+    end
+end
+
+def fun_l7_n287(x)
+    if (x < 1)
+        fun_l8_n292(x)
+    else
+        fun_l8_n799(x)
+    end
+end
+
+def fun_l7_n288(x)
+    if (x < 1)
+        fun_l8_n852(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n289(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n649(x)
+    end
+end
+
+def fun_l7_n290(x)
+    if (x < 1)
+        fun_l8_n488(x)
+    else
+        fun_l8_n252(x)
+    end
+end
+
+def fun_l7_n291(x)
+    if (x < 1)
+        fun_l8_n815(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n292(x)
+    if (x < 1)
+        fun_l8_n999(x)
+    else
+        fun_l8_n700(x)
+    end
+end
+
+def fun_l7_n293(x)
+    if (x < 1)
+        fun_l8_n9(x)
+    else
+        fun_l8_n194(x)
+    end
+end
+
+def fun_l7_n294(x)
+    if (x < 1)
+        fun_l8_n390(x)
+    else
+        fun_l8_n772(x)
+    end
+end
+
+def fun_l7_n295(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n587(x)
+    end
+end
+
+def fun_l7_n296(x)
+    if (x < 1)
+        fun_l8_n892(x)
+    else
+        fun_l8_n126(x)
+    end
+end
+
+def fun_l7_n297(x)
+    if (x < 1)
+        fun_l8_n199(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n298(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n299(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n58(x)
+    end
+end
+
+def fun_l7_n300(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n301(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n302(x)
+    if (x < 1)
+        fun_l8_n292(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n303(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n296(x)
+    end
+end
+
+def fun_l7_n304(x)
+    if (x < 1)
+        fun_l8_n350(x)
+    else
+        fun_l8_n769(x)
+    end
+end
+
+def fun_l7_n305(x)
+    if (x < 1)
+        fun_l8_n959(x)
+    else
+        fun_l8_n292(x)
+    end
+end
+
+def fun_l7_n306(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n507(x)
+    end
+end
+
+def fun_l7_n307(x)
+    if (x < 1)
+        fun_l8_n910(x)
+    else
+        fun_l8_n542(x)
+    end
+end
+
+def fun_l7_n308(x)
+    if (x < 1)
+        fun_l8_n299(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n309(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n393(x)
+    end
+end
+
+def fun_l7_n310(x)
+    if (x < 1)
+        fun_l8_n1(x)
+    else
+        fun_l8_n810(x)
+    end
+end
+
+def fun_l7_n311(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n519(x)
+    end
+end
+
+def fun_l7_n312(x)
+    if (x < 1)
+        fun_l8_n730(x)
+    else
+        fun_l8_n912(x)
+    end
+end
+
+def fun_l7_n313(x)
+    if (x < 1)
+        fun_l8_n128(x)
+    else
+        fun_l8_n3(x)
+    end
+end
+
+def fun_l7_n314(x)
+    if (x < 1)
+        fun_l8_n393(x)
+    else
+        fun_l8_n887(x)
+    end
+end
+
+def fun_l7_n315(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n316(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n255(x)
+    end
+end
+
+def fun_l7_n317(x)
+    if (x < 1)
+        fun_l8_n265(x)
+    else
+        fun_l8_n754(x)
+    end
+end
+
+def fun_l7_n318(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n163(x)
+    end
+end
+
+def fun_l7_n319(x)
+    if (x < 1)
+        fun_l8_n409(x)
+    else
+        fun_l8_n110(x)
+    end
+end
+
+def fun_l7_n320(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n959(x)
+    end
+end
+
+def fun_l7_n321(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n280(x)
+    end
+end
+
+def fun_l7_n322(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n403(x)
+    end
+end
+
+def fun_l7_n323(x)
+    if (x < 1)
+        fun_l8_n108(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n324(x)
+    if (x < 1)
+        fun_l8_n310(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n325(x)
+    if (x < 1)
+        fun_l8_n600(x)
+    else
+        fun_l8_n850(x)
+    end
+end
+
+def fun_l7_n326(x)
+    if (x < 1)
+        fun_l8_n736(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n327(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n948(x)
+    end
+end
+
+def fun_l7_n328(x)
+    if (x < 1)
+        fun_l8_n625(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n329(x)
+    if (x < 1)
+        fun_l8_n507(x)
+    else
+        fun_l8_n624(x)
+    end
+end
+
+def fun_l7_n330(x)
+    if (x < 1)
+        fun_l8_n956(x)
+    else
+        fun_l8_n281(x)
+    end
+end
+
+def fun_l7_n331(x)
+    if (x < 1)
+        fun_l8_n72(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n332(x)
+    if (x < 1)
+        fun_l8_n445(x)
+    else
+        fun_l8_n465(x)
+    end
+end
+
+def fun_l7_n333(x)
+    if (x < 1)
+        fun_l8_n438(x)
+    else
+        fun_l8_n698(x)
+    end
+end
+
+def fun_l7_n334(x)
+    if (x < 1)
+        fun_l8_n242(x)
+    else
+        fun_l8_n837(x)
+    end
+end
+
+def fun_l7_n335(x)
+    if (x < 1)
+        fun_l8_n299(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n336(x)
+    if (x < 1)
+        fun_l8_n264(x)
+    else
+        fun_l8_n330(x)
+    end
+end
+
+def fun_l7_n337(x)
+    if (x < 1)
+        fun_l8_n251(x)
+    else
+        fun_l8_n459(x)
+    end
+end
+
+def fun_l7_n338(x)
+    if (x < 1)
+        fun_l8_n876(x)
+    else
+        fun_l8_n689(x)
+    end
+end
+
+def fun_l7_n339(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n745(x)
+    end
+end
+
+def fun_l7_n340(x)
+    if (x < 1)
+        fun_l8_n493(x)
+    else
+        fun_l8_n877(x)
+    end
+end
+
+def fun_l7_n341(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n342(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n384(x)
+    end
+end
+
+def fun_l7_n343(x)
+    if (x < 1)
+        fun_l8_n897(x)
+    else
+        fun_l8_n980(x)
+    end
+end
+
+def fun_l7_n344(x)
+    if (x < 1)
+        fun_l8_n699(x)
+    else
+        fun_l8_n673(x)
+    end
+end
+
+def fun_l7_n345(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n342(x)
+    end
+end
+
+def fun_l7_n346(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n140(x)
+    end
+end
+
+def fun_l7_n347(x)
+    if (x < 1)
+        fun_l8_n661(x)
+    else
+        fun_l8_n153(x)
+    end
+end
+
+def fun_l7_n348(x)
+    if (x < 1)
+        fun_l8_n477(x)
+    else
+        fun_l8_n460(x)
+    end
+end
+
+def fun_l7_n349(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n941(x)
+    end
+end
+
+def fun_l7_n350(x)
+    if (x < 1)
+        fun_l8_n952(x)
+    else
+        fun_l8_n886(x)
+    end
+end
+
+def fun_l7_n351(x)
+    if (x < 1)
+        fun_l8_n338(x)
+    else
+        fun_l8_n655(x)
+    end
+end
+
+def fun_l7_n352(x)
+    if (x < 1)
+        fun_l8_n717(x)
+    else
+        fun_l8_n314(x)
+    end
+end
+
+def fun_l7_n353(x)
+    if (x < 1)
+        fun_l8_n645(x)
+    else
+        fun_l8_n464(x)
+    end
+end
+
+def fun_l7_n354(x)
+    if (x < 1)
+        fun_l8_n114(x)
+    else
+        fun_l8_n816(x)
+    end
+end
+
+def fun_l7_n355(x)
+    if (x < 1)
+        fun_l8_n18(x)
+    else
+        fun_l8_n173(x)
+    end
+end
+
+def fun_l7_n356(x)
+    if (x < 1)
+        fun_l8_n214(x)
+    else
+        fun_l8_n834(x)
+    end
+end
+
+def fun_l7_n357(x)
+    if (x < 1)
+        fun_l8_n6(x)
+    else
+        fun_l8_n161(x)
+    end
+end
+
+def fun_l7_n358(x)
+    if (x < 1)
+        fun_l8_n823(x)
+    else
+        fun_l8_n695(x)
+    end
+end
+
+def fun_l7_n359(x)
+    if (x < 1)
+        fun_l8_n86(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n360(x)
+    if (x < 1)
+        fun_l8_n904(x)
+    else
+        fun_l8_n240(x)
+    end
+end
+
+def fun_l7_n361(x)
+    if (x < 1)
+        fun_l8_n857(x)
+    else
+        fun_l8_n494(x)
+    end
+end
+
+def fun_l7_n362(x)
+    if (x < 1)
+        fun_l8_n780(x)
+    else
+        fun_l8_n186(x)
+    end
+end
+
+def fun_l7_n363(x)
+    if (x < 1)
+        fun_l8_n575(x)
+    else
+        fun_l8_n510(x)
+    end
+end
+
+def fun_l7_n364(x)
+    if (x < 1)
+        fun_l8_n412(x)
+    else
+        fun_l8_n153(x)
+    end
+end
+
+def fun_l7_n365(x)
+    if (x < 1)
+        fun_l8_n840(x)
+    else
+        fun_l8_n199(x)
+    end
+end
+
+def fun_l7_n366(x)
+    if (x < 1)
+        fun_l8_n162(x)
+    else
+        fun_l8_n971(x)
+    end
+end
+
+def fun_l7_n367(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n128(x)
+    end
+end
+
+def fun_l7_n368(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n657(x)
+    end
+end
+
+def fun_l7_n369(x)
+    if (x < 1)
+        fun_l8_n631(x)
+    else
+        fun_l8_n714(x)
+    end
+end
+
+def fun_l7_n370(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n718(x)
+    end
+end
+
+def fun_l7_n371(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n474(x)
+    end
+end
+
+def fun_l7_n372(x)
+    if (x < 1)
+        fun_l8_n138(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n373(x)
+    if (x < 1)
+        fun_l8_n78(x)
+    else
+        fun_l8_n750(x)
+    end
+end
+
+def fun_l7_n374(x)
+    if (x < 1)
+        fun_l8_n231(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n375(x)
+    if (x < 1)
+        fun_l8_n238(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n376(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n354(x)
+    end
+end
+
+def fun_l7_n377(x)
+    if (x < 1)
+        fun_l8_n332(x)
+    else
+        fun_l8_n739(x)
+    end
+end
+
+def fun_l7_n378(x)
+    if (x < 1)
+        fun_l8_n76(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n379(x)
+    if (x < 1)
+        fun_l8_n781(x)
+    else
+        fun_l8_n918(x)
+    end
+end
+
+def fun_l7_n380(x)
+    if (x < 1)
+        fun_l8_n854(x)
+    else
+        fun_l8_n85(x)
+    end
+end
+
+def fun_l7_n381(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n382(x)
+    if (x < 1)
+        fun_l8_n425(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n383(x)
+    if (x < 1)
+        fun_l8_n210(x)
+    else
+        fun_l8_n533(x)
+    end
+end
+
+def fun_l7_n384(x)
+    if (x < 1)
+        fun_l8_n469(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n385(x)
+    if (x < 1)
+        fun_l8_n398(x)
+    else
+        fun_l8_n583(x)
+    end
+end
+
+def fun_l7_n386(x)
+    if (x < 1)
+        fun_l8_n483(x)
+    else
+        fun_l8_n80(x)
+    end
+end
+
+def fun_l7_n387(x)
+    if (x < 1)
+        fun_l8_n557(x)
+    else
+        fun_l8_n165(x)
+    end
+end
+
+def fun_l7_n388(x)
+    if (x < 1)
+        fun_l8_n335(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n389(x)
+    if (x < 1)
+        fun_l8_n810(x)
+    else
+        fun_l8_n586(x)
+    end
+end
+
+def fun_l7_n390(x)
+    if (x < 1)
+        fun_l8_n90(x)
+    else
+        fun_l8_n788(x)
+    end
+end
+
+def fun_l7_n391(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n948(x)
+    end
+end
+
+def fun_l7_n392(x)
+    if (x < 1)
+        fun_l8_n139(x)
+    else
+        fun_l8_n631(x)
+    end
+end
+
+def fun_l7_n393(x)
+    if (x < 1)
+        fun_l8_n341(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n394(x)
+    if (x < 1)
+        fun_l8_n435(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n395(x)
+    if (x < 1)
+        fun_l8_n186(x)
+    else
+        fun_l8_n58(x)
+    end
+end
+
+def fun_l7_n396(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n87(x)
+    end
+end
+
+def fun_l7_n397(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n398(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n231(x)
+    end
+end
+
+def fun_l7_n399(x)
+    if (x < 1)
+        fun_l8_n308(x)
+    else
+        fun_l8_n512(x)
+    end
+end
+
+def fun_l7_n400(x)
+    if (x < 1)
+        fun_l8_n26(x)
+    else
+        fun_l8_n228(x)
+    end
+end
+
+def fun_l7_n401(x)
+    if (x < 1)
+        fun_l8_n143(x)
+    else
+        fun_l8_n826(x)
+    end
+end
+
+def fun_l7_n402(x)
+    if (x < 1)
+        fun_l8_n893(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n403(x)
+    if (x < 1)
+        fun_l8_n9(x)
+    else
+        fun_l8_n867(x)
+    end
+end
+
+def fun_l7_n404(x)
+    if (x < 1)
+        fun_l8_n85(x)
+    else
+        fun_l8_n279(x)
+    end
+end
+
+def fun_l7_n405(x)
+    if (x < 1)
+        fun_l8_n30(x)
+    else
+        fun_l8_n85(x)
+    end
+end
+
+def fun_l7_n406(x)
+    if (x < 1)
+        fun_l8_n38(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n407(x)
+    if (x < 1)
+        fun_l8_n630(x)
+    else
+        fun_l8_n262(x)
+    end
+end
+
+def fun_l7_n408(x)
+    if (x < 1)
+        fun_l8_n430(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n409(x)
+    if (x < 1)
+        fun_l8_n131(x)
+    else
+        fun_l8_n66(x)
+    end
+end
+
+def fun_l7_n410(x)
+    if (x < 1)
+        fun_l8_n373(x)
+    else
+        fun_l8_n514(x)
+    end
+end
+
+def fun_l7_n411(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n591(x)
+    end
+end
+
+def fun_l7_n412(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n490(x)
+    end
+end
+
+def fun_l7_n413(x)
+    if (x < 1)
+        fun_l8_n318(x)
+    else
+        fun_l8_n456(x)
+    end
+end
+
+def fun_l7_n414(x)
+    if (x < 1)
+        fun_l8_n576(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n415(x)
+    if (x < 1)
+        fun_l8_n407(x)
+    else
+        fun_l8_n44(x)
+    end
+end
+
+def fun_l7_n416(x)
+    if (x < 1)
+        fun_l8_n970(x)
+    else
+        fun_l8_n564(x)
+    end
+end
+
+def fun_l7_n417(x)
+    if (x < 1)
+        fun_l8_n163(x)
+    else
+        fun_l8_n533(x)
+    end
+end
+
+def fun_l7_n418(x)
+    if (x < 1)
+        fun_l8_n216(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n419(x)
+    if (x < 1)
+        fun_l8_n505(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n420(x)
+    if (x < 1)
+        fun_l8_n746(x)
+    else
+        fun_l8_n998(x)
+    end
+end
+
+def fun_l7_n421(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n762(x)
+    end
+end
+
+def fun_l7_n422(x)
+    if (x < 1)
+        fun_l8_n216(x)
+    else
+        fun_l8_n995(x)
+    end
+end
+
+def fun_l7_n423(x)
+    if (x < 1)
+        fun_l8_n824(x)
+    else
+        fun_l8_n349(x)
+    end
+end
+
+def fun_l7_n424(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n425(x)
+    if (x < 1)
+        fun_l8_n286(x)
+    else
+        fun_l8_n213(x)
+    end
+end
+
+def fun_l7_n426(x)
+    if (x < 1)
+        fun_l8_n794(x)
+    else
+        fun_l8_n428(x)
+    end
+end
+
+def fun_l7_n427(x)
+    if (x < 1)
+        fun_l8_n404(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n428(x)
+    if (x < 1)
+        fun_l8_n571(x)
+    else
+        fun_l8_n812(x)
+    end
+end
+
+def fun_l7_n429(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n277(x)
+    end
+end
+
+def fun_l7_n430(x)
+    if (x < 1)
+        fun_l8_n138(x)
+    else
+        fun_l8_n230(x)
+    end
+end
+
+def fun_l7_n431(x)
+    if (x < 1)
+        fun_l8_n832(x)
+    else
+        fun_l8_n78(x)
+    end
+end
+
+def fun_l7_n432(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n137(x)
+    end
+end
+
+def fun_l7_n433(x)
+    if (x < 1)
+        fun_l8_n92(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n434(x)
+    if (x < 1)
+        fun_l8_n788(x)
+    else
+        fun_l8_n991(x)
+    end
+end
+
+def fun_l7_n435(x)
+    if (x < 1)
+        fun_l8_n584(x)
+    else
+        fun_l8_n783(x)
+    end
+end
+
+def fun_l7_n436(x)
+    if (x < 1)
+        fun_l8_n786(x)
+    else
+        fun_l8_n771(x)
+    end
+end
+
+def fun_l7_n437(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n684(x)
+    end
+end
+
+def fun_l7_n438(x)
+    if (x < 1)
+        fun_l8_n964(x)
+    else
+        fun_l8_n738(x)
+    end
+end
+
+def fun_l7_n439(x)
+    if (x < 1)
+        fun_l8_n356(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n440(x)
+    if (x < 1)
+        fun_l8_n630(x)
+    else
+        fun_l8_n79(x)
+    end
+end
+
+def fun_l7_n441(x)
+    if (x < 1)
+        fun_l8_n326(x)
+    else
+        fun_l8_n667(x)
+    end
+end
+
+def fun_l7_n442(x)
+    if (x < 1)
+        fun_l8_n561(x)
+    else
+        fun_l8_n263(x)
+    end
+end
+
+def fun_l7_n443(x)
+    if (x < 1)
+        fun_l8_n62(x)
+    else
+        fun_l8_n528(x)
+    end
+end
+
+def fun_l7_n444(x)
+    if (x < 1)
+        fun_l8_n156(x)
+    else
+        fun_l8_n496(x)
+    end
+end
+
+def fun_l7_n445(x)
+    if (x < 1)
+        fun_l8_n971(x)
+    else
+        fun_l8_n853(x)
+    end
+end
+
+def fun_l7_n446(x)
+    if (x < 1)
+        fun_l8_n217(x)
+    else
+        fun_l8_n985(x)
+    end
+end
+
+def fun_l7_n447(x)
+    if (x < 1)
+        fun_l8_n569(x)
+    else
+        fun_l8_n320(x)
+    end
+end
+
+def fun_l7_n448(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n417(x)
+    end
+end
+
+def fun_l7_n449(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n25(x)
+    end
+end
+
+def fun_l7_n450(x)
+    if (x < 1)
+        fun_l8_n735(x)
+    else
+        fun_l8_n573(x)
+    end
+end
+
+def fun_l7_n451(x)
+    if (x < 1)
+        fun_l8_n764(x)
+    else
+        fun_l8_n247(x)
+    end
+end
+
+def fun_l7_n452(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n274(x)
+    end
+end
+
+def fun_l7_n453(x)
+    if (x < 1)
+        fun_l8_n388(x)
+    else
+        fun_l8_n438(x)
+    end
+end
+
+def fun_l7_n454(x)
+    if (x < 1)
+        fun_l8_n565(x)
+    else
+        fun_l8_n449(x)
+    end
+end
+
+def fun_l7_n455(x)
+    if (x < 1)
+        fun_l8_n771(x)
+    else
+        fun_l8_n827(x)
+    end
+end
+
+def fun_l7_n456(x)
+    if (x < 1)
+        fun_l8_n538(x)
+    else
+        fun_l8_n270(x)
+    end
+end
+
+def fun_l7_n457(x)
+    if (x < 1)
+        fun_l8_n288(x)
+    else
+        fun_l8_n325(x)
+    end
+end
+
+def fun_l7_n458(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n334(x)
+    end
+end
+
+def fun_l7_n459(x)
+    if (x < 1)
+        fun_l8_n696(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n460(x)
+    if (x < 1)
+        fun_l8_n509(x)
+    else
+        fun_l8_n580(x)
+    end
+end
+
+def fun_l7_n461(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n162(x)
+    end
+end
+
+def fun_l7_n462(x)
+    if (x < 1)
+        fun_l8_n541(x)
+    else
+        fun_l8_n493(x)
+    end
+end
+
+def fun_l7_n463(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n302(x)
+    end
+end
+
+def fun_l7_n464(x)
+    if (x < 1)
+        fun_l8_n44(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n465(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n716(x)
+    end
+end
+
+def fun_l7_n466(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n827(x)
+    end
+end
+
+def fun_l7_n467(x)
+    if (x < 1)
+        fun_l8_n871(x)
+    else
+        fun_l8_n962(x)
+    end
+end
+
+def fun_l7_n468(x)
+    if (x < 1)
+        fun_l8_n323(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n469(x)
+    if (x < 1)
+        fun_l8_n100(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n470(x)
+    if (x < 1)
+        fun_l8_n95(x)
+    else
+        fun_l8_n96(x)
+    end
+end
+
+def fun_l7_n471(x)
+    if (x < 1)
+        fun_l8_n398(x)
+    else
+        fun_l8_n40(x)
+    end
+end
+
+def fun_l7_n472(x)
+    if (x < 1)
+        fun_l8_n280(x)
+    else
+        fun_l8_n34(x)
+    end
+end
+
+def fun_l7_n473(x)
+    if (x < 1)
+        fun_l8_n262(x)
+    else
+        fun_l8_n399(x)
+    end
+end
+
+def fun_l7_n474(x)
+    if (x < 1)
+        fun_l8_n126(x)
+    else
+        fun_l8_n208(x)
+    end
+end
+
+def fun_l7_n475(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n697(x)
+    end
+end
+
+def fun_l7_n476(x)
+    if (x < 1)
+        fun_l8_n617(x)
+    else
+        fun_l8_n822(x)
+    end
+end
+
+def fun_l7_n477(x)
+    if (x < 1)
+        fun_l8_n24(x)
+    else
+        fun_l8_n300(x)
+    end
+end
+
+def fun_l7_n478(x)
+    if (x < 1)
+        fun_l8_n864(x)
+    else
+        fun_l8_n357(x)
+    end
+end
+
+def fun_l7_n479(x)
+    if (x < 1)
+        fun_l8_n231(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n480(x)
+    if (x < 1)
+        fun_l8_n200(x)
+    else
+        fun_l8_n49(x)
+    end
+end
+
+def fun_l7_n481(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n482(x)
+    if (x < 1)
+        fun_l8_n617(x)
+    else
+        fun_l8_n752(x)
+    end
+end
+
+def fun_l7_n483(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n796(x)
+    end
+end
+
+def fun_l7_n484(x)
+    if (x < 1)
+        fun_l8_n960(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n485(x)
+    if (x < 1)
+        fun_l8_n383(x)
+    else
+        fun_l8_n50(x)
+    end
+end
+
+def fun_l7_n486(x)
+    if (x < 1)
+        fun_l8_n269(x)
+    else
+        fun_l8_n413(x)
+    end
+end
+
+def fun_l7_n487(x)
+    if (x < 1)
+        fun_l8_n762(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n488(x)
+    if (x < 1)
+        fun_l8_n635(x)
+    else
+        fun_l8_n900(x)
+    end
+end
+
+def fun_l7_n489(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n376(x)
+    end
+end
+
+def fun_l7_n490(x)
+    if (x < 1)
+        fun_l8_n215(x)
+    else
+        fun_l8_n255(x)
+    end
+end
+
+def fun_l7_n491(x)
+    if (x < 1)
+        fun_l8_n730(x)
+    else
+        fun_l8_n489(x)
+    end
+end
+
+def fun_l7_n492(x)
+    if (x < 1)
+        fun_l8_n896(x)
+    else
+        fun_l8_n501(x)
+    end
+end
+
+def fun_l7_n493(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n876(x)
+    end
+end
+
+def fun_l7_n494(x)
+    if (x < 1)
+        fun_l8_n13(x)
+    else
+        fun_l8_n669(x)
+    end
+end
+
+def fun_l7_n495(x)
+    if (x < 1)
+        fun_l8_n442(x)
+    else
+        fun_l8_n975(x)
+    end
+end
+
+def fun_l7_n496(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n240(x)
+    end
+end
+
+def fun_l7_n497(x)
+    if (x < 1)
+        fun_l8_n174(x)
+    else
+        fun_l8_n416(x)
+    end
+end
+
+def fun_l7_n498(x)
+    if (x < 1)
+        fun_l8_n141(x)
+    else
+        fun_l8_n231(x)
+    end
+end
+
+def fun_l7_n499(x)
+    if (x < 1)
+        fun_l8_n868(x)
+    else
+        fun_l8_n370(x)
+    end
+end
+
+def fun_l7_n500(x)
+    if (x < 1)
+        fun_l8_n888(x)
+    else
+        fun_l8_n525(x)
+    end
+end
+
+def fun_l7_n501(x)
+    if (x < 1)
+        fun_l8_n418(x)
+    else
+        fun_l8_n402(x)
+    end
+end
+
+def fun_l7_n502(x)
+    if (x < 1)
+        fun_l8_n910(x)
+    else
+        fun_l8_n308(x)
+    end
+end
+
+def fun_l7_n503(x)
+    if (x < 1)
+        fun_l8_n435(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n504(x)
+    if (x < 1)
+        fun_l8_n716(x)
+    else
+        fun_l8_n768(x)
+    end
+end
+
+def fun_l7_n505(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n382(x)
+    end
+end
+
+def fun_l7_n506(x)
+    if (x < 1)
+        fun_l8_n786(x)
+    else
+        fun_l8_n270(x)
+    end
+end
+
+def fun_l7_n507(x)
+    if (x < 1)
+        fun_l8_n317(x)
+    else
+        fun_l8_n802(x)
+    end
+end
+
+def fun_l7_n508(x)
+    if (x < 1)
+        fun_l8_n423(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n509(x)
+    if (x < 1)
+        fun_l8_n853(x)
+    else
+        fun_l8_n434(x)
+    end
+end
+
+def fun_l7_n510(x)
+    if (x < 1)
+        fun_l8_n691(x)
+    else
+        fun_l8_n458(x)
+    end
+end
+
+def fun_l7_n511(x)
+    if (x < 1)
+        fun_l8_n806(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n512(x)
+    if (x < 1)
+        fun_l8_n696(x)
+    else
+        fun_l8_n234(x)
+    end
+end
+
+def fun_l7_n513(x)
+    if (x < 1)
+        fun_l8_n370(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n514(x)
+    if (x < 1)
+        fun_l8_n889(x)
+    else
+        fun_l8_n306(x)
+    end
+end
+
+def fun_l7_n515(x)
+    if (x < 1)
+        fun_l8_n147(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n516(x)
+    if (x < 1)
+        fun_l8_n18(x)
+    else
+        fun_l8_n120(x)
+    end
+end
+
+def fun_l7_n517(x)
+    if (x < 1)
+        fun_l8_n93(x)
+    else
+        fun_l8_n861(x)
+    end
+end
+
+def fun_l7_n518(x)
+    if (x < 1)
+        fun_l8_n954(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n519(x)
+    if (x < 1)
+        fun_l8_n886(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n520(x)
+    if (x < 1)
+        fun_l8_n525(x)
+    else
+        fun_l8_n73(x)
+    end
+end
+
+def fun_l7_n521(x)
+    if (x < 1)
+        fun_l8_n550(x)
+    else
+        fun_l8_n638(x)
+    end
+end
+
+def fun_l7_n522(x)
+    if (x < 1)
+        fun_l8_n36(x)
+    else
+        fun_l8_n511(x)
+    end
+end
+
+def fun_l7_n523(x)
+    if (x < 1)
+        fun_l8_n346(x)
+    else
+        fun_l8_n257(x)
+    end
+end
+
+def fun_l7_n524(x)
+    if (x < 1)
+        fun_l8_n973(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n525(x)
+    if (x < 1)
+        fun_l8_n21(x)
+    else
+        fun_l8_n354(x)
+    end
+end
+
+def fun_l7_n526(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n527(x)
+    if (x < 1)
+        fun_l8_n444(x)
+    else
+        fun_l8_n333(x)
+    end
+end
+
+def fun_l7_n528(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n579(x)
+    end
+end
+
+def fun_l7_n529(x)
+    if (x < 1)
+        fun_l8_n135(x)
+    else
+        fun_l8_n69(x)
+    end
+end
+
+def fun_l7_n530(x)
+    if (x < 1)
+        fun_l8_n66(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n531(x)
+    if (x < 1)
+        fun_l8_n84(x)
+    else
+        fun_l8_n392(x)
+    end
+end
+
+def fun_l7_n532(x)
+    if (x < 1)
+        fun_l8_n178(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n533(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n534(x)
+    if (x < 1)
+        fun_l8_n266(x)
+    else
+        fun_l8_n8(x)
+    end
+end
+
+def fun_l7_n535(x)
+    if (x < 1)
+        fun_l8_n806(x)
+    else
+        fun_l8_n878(x)
+    end
+end
+
+def fun_l7_n536(x)
+    if (x < 1)
+        fun_l8_n775(x)
+    else
+        fun_l8_n778(x)
+    end
+end
+
+def fun_l7_n537(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n552(x)
+    end
+end
+
+def fun_l7_n538(x)
+    if (x < 1)
+        fun_l8_n71(x)
+    else
+        fun_l8_n786(x)
+    end
+end
+
+def fun_l7_n539(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n407(x)
+    end
+end
+
+def fun_l7_n540(x)
+    if (x < 1)
+        fun_l8_n532(x)
+    else
+        fun_l8_n75(x)
+    end
+end
+
+def fun_l7_n541(x)
+    if (x < 1)
+        fun_l8_n367(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n542(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n374(x)
+    end
+end
+
+def fun_l7_n543(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n874(x)
+    end
+end
+
+def fun_l7_n544(x)
+    if (x < 1)
+        fun_l8_n774(x)
+    else
+        fun_l8_n750(x)
+    end
+end
+
+def fun_l7_n545(x)
+    if (x < 1)
+        fun_l8_n503(x)
+    else
+        fun_l8_n933(x)
+    end
+end
+
+def fun_l7_n546(x)
+    if (x < 1)
+        fun_l8_n125(x)
+    else
+        fun_l8_n570(x)
+    end
+end
+
+def fun_l7_n547(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n506(x)
+    end
+end
+
+def fun_l7_n548(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n70(x)
+    end
+end
+
+def fun_l7_n549(x)
+    if (x < 1)
+        fun_l8_n692(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n550(x)
+    if (x < 1)
+        fun_l8_n446(x)
+    else
+        fun_l8_n432(x)
+    end
+end
+
+def fun_l7_n551(x)
+    if (x < 1)
+        fun_l8_n947(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n552(x)
+    if (x < 1)
+        fun_l8_n417(x)
+    else
+        fun_l8_n136(x)
+    end
+end
+
+def fun_l7_n553(x)
+    if (x < 1)
+        fun_l8_n236(x)
+    else
+        fun_l8_n291(x)
+    end
+end
+
+def fun_l7_n554(x)
+    if (x < 1)
+        fun_l8_n60(x)
+    else
+        fun_l8_n328(x)
+    end
+end
+
+def fun_l7_n555(x)
+    if (x < 1)
+        fun_l8_n97(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n556(x)
+    if (x < 1)
+        fun_l8_n158(x)
+    else
+        fun_l8_n603(x)
+    end
+end
+
+def fun_l7_n557(x)
+    if (x < 1)
+        fun_l8_n328(x)
+    else
+        fun_l8_n725(x)
+    end
+end
+
+def fun_l7_n558(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n933(x)
+    end
+end
+
+def fun_l7_n559(x)
+    if (x < 1)
+        fun_l8_n352(x)
+    else
+        fun_l8_n552(x)
+    end
+end
+
+def fun_l7_n560(x)
+    if (x < 1)
+        fun_l8_n427(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n561(x)
+    if (x < 1)
+        fun_l8_n293(x)
+    else
+        fun_l8_n749(x)
+    end
+end
+
+def fun_l7_n562(x)
+    if (x < 1)
+        fun_l8_n672(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n563(x)
+    if (x < 1)
+        fun_l8_n201(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n564(x)
+    if (x < 1)
+        fun_l8_n109(x)
+    else
+        fun_l8_n401(x)
+    end
+end
+
+def fun_l7_n565(x)
+    if (x < 1)
+        fun_l8_n678(x)
+    else
+        fun_l8_n890(x)
+    end
+end
+
+def fun_l7_n566(x)
+    if (x < 1)
+        fun_l8_n876(x)
+    else
+        fun_l8_n129(x)
+    end
+end
+
+def fun_l7_n567(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n979(x)
+    end
+end
+
+def fun_l7_n568(x)
+    if (x < 1)
+        fun_l8_n899(x)
+    else
+        fun_l8_n792(x)
+    end
+end
+
+def fun_l7_n569(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n441(x)
+    end
+end
+
+def fun_l7_n570(x)
+    if (x < 1)
+        fun_l8_n338(x)
+    else
+        fun_l8_n877(x)
+    end
+end
+
+def fun_l7_n571(x)
+    if (x < 1)
+        fun_l8_n684(x)
+    else
+        fun_l8_n167(x)
+    end
+end
+
+def fun_l7_n572(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n239(x)
+    end
+end
+
+def fun_l7_n573(x)
+    if (x < 1)
+        fun_l8_n925(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n574(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n811(x)
+    end
+end
+
+def fun_l7_n575(x)
+    if (x < 1)
+        fun_l8_n348(x)
+    else
+        fun_l8_n994(x)
+    end
+end
+
+def fun_l7_n576(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n584(x)
+    end
+end
+
+def fun_l7_n577(x)
+    if (x < 1)
+        fun_l8_n827(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n578(x)
+    if (x < 1)
+        fun_l8_n649(x)
+    else
+        fun_l8_n684(x)
+    end
+end
+
+def fun_l7_n579(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n183(x)
+    end
+end
+
+def fun_l7_n580(x)
+    if (x < 1)
+        fun_l8_n516(x)
+    else
+        fun_l8_n893(x)
+    end
+end
+
+def fun_l7_n581(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n582(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n583(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n403(x)
+    end
+end
+
+def fun_l7_n584(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n155(x)
+    end
+end
+
+def fun_l7_n585(x)
+    if (x < 1)
+        fun_l8_n1(x)
+    else
+        fun_l8_n903(x)
+    end
+end
+
+def fun_l7_n586(x)
+    if (x < 1)
+        fun_l8_n956(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n587(x)
+    if (x < 1)
+        fun_l8_n590(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n588(x)
+    if (x < 1)
+        fun_l8_n74(x)
+    else
+        fun_l8_n612(x)
+    end
+end
+
+def fun_l7_n589(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n590(x)
+    if (x < 1)
+        fun_l8_n650(x)
+    else
+        fun_l8_n863(x)
+    end
+end
+
+def fun_l7_n591(x)
+    if (x < 1)
+        fun_l8_n974(x)
+    else
+        fun_l8_n932(x)
+    end
+end
+
+def fun_l7_n592(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n537(x)
+    end
+end
+
+def fun_l7_n593(x)
+    if (x < 1)
+        fun_l8_n118(x)
+    else
+        fun_l8_n588(x)
+    end
+end
+
+def fun_l7_n594(x)
+    if (x < 1)
+        fun_l8_n241(x)
+    else
+        fun_l8_n929(x)
+    end
+end
+
+def fun_l7_n595(x)
+    if (x < 1)
+        fun_l8_n667(x)
+    else
+        fun_l8_n251(x)
+    end
+end
+
+def fun_l7_n596(x)
+    if (x < 1)
+        fun_l8_n473(x)
+    else
+        fun_l8_n189(x)
+    end
+end
+
+def fun_l7_n597(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n666(x)
+    end
+end
+
+def fun_l7_n598(x)
+    if (x < 1)
+        fun_l8_n700(x)
+    else
+        fun_l8_n294(x)
+    end
+end
+
+def fun_l7_n599(x)
+    if (x < 1)
+        fun_l8_n144(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n600(x)
+    if (x < 1)
+        fun_l8_n375(x)
+    else
+        fun_l8_n571(x)
+    end
+end
+
+def fun_l7_n601(x)
+    if (x < 1)
+        fun_l8_n506(x)
+    else
+        fun_l8_n212(x)
+    end
+end
+
+def fun_l7_n602(x)
+    if (x < 1)
+        fun_l8_n770(x)
+    else
+        fun_l8_n491(x)
+    end
+end
+
+def fun_l7_n603(x)
+    if (x < 1)
+        fun_l8_n325(x)
+    else
+        fun_l8_n660(x)
+    end
+end
+
+def fun_l7_n604(x)
+    if (x < 1)
+        fun_l8_n255(x)
+    else
+        fun_l8_n842(x)
+    end
+end
+
+def fun_l7_n605(x)
+    if (x < 1)
+        fun_l8_n149(x)
+    else
+        fun_l8_n648(x)
+    end
+end
+
+def fun_l7_n606(x)
+    if (x < 1)
+        fun_l8_n845(x)
+    else
+        fun_l8_n248(x)
+    end
+end
+
+def fun_l7_n607(x)
+    if (x < 1)
+        fun_l8_n484(x)
+    else
+        fun_l8_n333(x)
+    end
+end
+
+def fun_l7_n608(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n341(x)
+    end
+end
+
+def fun_l7_n609(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n610(x)
+    if (x < 1)
+        fun_l8_n45(x)
+    else
+        fun_l8_n994(x)
+    end
+end
+
+def fun_l7_n611(x)
+    if (x < 1)
+        fun_l8_n427(x)
+    else
+        fun_l8_n359(x)
+    end
+end
+
+def fun_l7_n612(x)
+    if (x < 1)
+        fun_l8_n433(x)
+    else
+        fun_l8_n189(x)
+    end
+end
+
+def fun_l7_n613(x)
+    if (x < 1)
+        fun_l8_n25(x)
+    else
+        fun_l8_n564(x)
+    end
+end
+
+def fun_l7_n614(x)
+    if (x < 1)
+        fun_l8_n789(x)
+    else
+        fun_l8_n441(x)
+    end
+end
+
+def fun_l7_n615(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n217(x)
+    end
+end
+
+def fun_l7_n616(x)
+    if (x < 1)
+        fun_l8_n334(x)
+    else
+        fun_l8_n559(x)
+    end
+end
+
+def fun_l7_n617(x)
+    if (x < 1)
+        fun_l8_n709(x)
+    else
+        fun_l8_n764(x)
+    end
+end
+
+def fun_l7_n618(x)
+    if (x < 1)
+        fun_l8_n710(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n619(x)
+    if (x < 1)
+        fun_l8_n246(x)
+    else
+        fun_l8_n88(x)
+    end
+end
+
+def fun_l7_n620(x)
+    if (x < 1)
+        fun_l8_n259(x)
+    else
+        fun_l8_n813(x)
+    end
+end
+
+def fun_l7_n621(x)
+    if (x < 1)
+        fun_l8_n250(x)
+    else
+        fun_l8_n566(x)
+    end
+end
+
+def fun_l7_n622(x)
+    if (x < 1)
+        fun_l8_n223(x)
+    else
+        fun_l8_n627(x)
+    end
+end
+
+def fun_l7_n623(x)
+    if (x < 1)
+        fun_l8_n345(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n624(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n850(x)
+    end
+end
+
+def fun_l7_n625(x)
+    if (x < 1)
+        fun_l8_n278(x)
+    else
+        fun_l8_n643(x)
+    end
+end
+
+def fun_l7_n626(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n167(x)
+    end
+end
+
+def fun_l7_n627(x)
+    if (x < 1)
+        fun_l8_n589(x)
+    else
+        fun_l8_n656(x)
+    end
+end
+
+def fun_l7_n628(x)
+    if (x < 1)
+        fun_l8_n612(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n629(x)
+    if (x < 1)
+        fun_l8_n845(x)
+    else
+        fun_l8_n469(x)
+    end
+end
+
+def fun_l7_n630(x)
+    if (x < 1)
+        fun_l8_n833(x)
+    else
+        fun_l8_n92(x)
+    end
+end
+
+def fun_l7_n631(x)
+    if (x < 1)
+        fun_l8_n411(x)
+    else
+        fun_l8_n815(x)
+    end
+end
+
+def fun_l7_n632(x)
+    if (x < 1)
+        fun_l8_n844(x)
+    else
+        fun_l8_n349(x)
+    end
+end
+
+def fun_l7_n633(x)
+    if (x < 1)
+        fun_l8_n333(x)
+    else
+        fun_l8_n468(x)
+    end
+end
+
+def fun_l7_n634(x)
+    if (x < 1)
+        fun_l8_n12(x)
+    else
+        fun_l8_n727(x)
+    end
+end
+
+def fun_l7_n635(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n729(x)
+    end
+end
+
+def fun_l7_n636(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n524(x)
+    end
+end
+
+def fun_l7_n637(x)
+    if (x < 1)
+        fun_l8_n547(x)
+    else
+        fun_l8_n220(x)
+    end
+end
+
+def fun_l7_n638(x)
+    if (x < 1)
+        fun_l8_n679(x)
+    else
+        fun_l8_n693(x)
+    end
+end
+
+def fun_l7_n639(x)
+    if (x < 1)
+        fun_l8_n428(x)
+    else
+        fun_l8_n938(x)
+    end
+end
+
+def fun_l7_n640(x)
+    if (x < 1)
+        fun_l8_n779(x)
+    else
+        fun_l8_n323(x)
+    end
+end
+
+def fun_l7_n641(x)
+    if (x < 1)
+        fun_l8_n254(x)
+    else
+        fun_l8_n443(x)
+    end
+end
+
+def fun_l7_n642(x)
+    if (x < 1)
+        fun_l8_n623(x)
+    else
+        fun_l8_n361(x)
+    end
+end
+
+def fun_l7_n643(x)
+    if (x < 1)
+        fun_l8_n524(x)
+    else
+        fun_l8_n19(x)
+    end
+end
+
+def fun_l7_n644(x)
+    if (x < 1)
+        fun_l8_n77(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n645(x)
+    if (x < 1)
+        fun_l8_n468(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n646(x)
+    if (x < 1)
+        fun_l8_n319(x)
+    else
+        fun_l8_n921(x)
+    end
+end
+
+def fun_l7_n647(x)
+    if (x < 1)
+        fun_l8_n681(x)
+    else
+        fun_l8_n925(x)
+    end
+end
+
+def fun_l7_n648(x)
+    if (x < 1)
+        fun_l8_n146(x)
+    else
+        fun_l8_n451(x)
+    end
+end
+
+def fun_l7_n649(x)
+    if (x < 1)
+        fun_l8_n871(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n650(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n651(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n80(x)
+    end
+end
+
+def fun_l7_n652(x)
+    if (x < 1)
+        fun_l8_n110(x)
+    else
+        fun_l8_n529(x)
+    end
+end
+
+def fun_l7_n653(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n876(x)
+    end
+end
+
+def fun_l7_n654(x)
+    if (x < 1)
+        fun_l8_n902(x)
+    else
+        fun_l8_n45(x)
+    end
+end
+
+def fun_l7_n655(x)
+    if (x < 1)
+        fun_l8_n714(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n656(x)
+    if (x < 1)
+        fun_l8_n761(x)
+    else
+        fun_l8_n940(x)
+    end
+end
+
+def fun_l7_n657(x)
+    if (x < 1)
+        fun_l8_n165(x)
+    else
+        fun_l8_n779(x)
+    end
+end
+
+def fun_l7_n658(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n659(x)
+    if (x < 1)
+        fun_l8_n414(x)
+    else
+        fun_l8_n855(x)
+    end
+end
+
+def fun_l7_n660(x)
+    if (x < 1)
+        fun_l8_n963(x)
+    else
+        fun_l8_n887(x)
+    end
+end
+
+def fun_l7_n661(x)
+    if (x < 1)
+        fun_l8_n71(x)
+    else
+        fun_l8_n249(x)
+    end
+end
+
+def fun_l7_n662(x)
+    if (x < 1)
+        fun_l8_n426(x)
+    else
+        fun_l8_n977(x)
+    end
+end
+
+def fun_l7_n663(x)
+    if (x < 1)
+        fun_l8_n924(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n664(x)
+    if (x < 1)
+        fun_l8_n88(x)
+    else
+        fun_l8_n718(x)
+    end
+end
+
+def fun_l7_n665(x)
+    if (x < 1)
+        fun_l8_n611(x)
+    else
+        fun_l8_n898(x)
+    end
+end
+
+def fun_l7_n666(x)
+    if (x < 1)
+        fun_l8_n656(x)
+    else
+        fun_l8_n116(x)
+    end
+end
+
+def fun_l7_n667(x)
+    if (x < 1)
+        fun_l8_n196(x)
+    else
+        fun_l8_n688(x)
+    end
+end
+
+def fun_l7_n668(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n561(x)
+    end
+end
+
+def fun_l7_n669(x)
+    if (x < 1)
+        fun_l8_n947(x)
+    else
+        fun_l8_n64(x)
+    end
+end
+
+def fun_l7_n670(x)
+    if (x < 1)
+        fun_l8_n309(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n671(x)
+    if (x < 1)
+        fun_l8_n699(x)
+    else
+        fun_l8_n218(x)
+    end
+end
+
+def fun_l7_n672(x)
+    if (x < 1)
+        fun_l8_n930(x)
+    else
+        fun_l8_n387(x)
+    end
+end
+
+def fun_l7_n673(x)
+    if (x < 1)
+        fun_l8_n598(x)
+    else
+        fun_l8_n245(x)
+    end
+end
+
+def fun_l7_n674(x)
+    if (x < 1)
+        fun_l8_n411(x)
+    else
+        fun_l8_n236(x)
+    end
+end
+
+def fun_l7_n675(x)
+    if (x < 1)
+        fun_l8_n193(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n676(x)
+    if (x < 1)
+        fun_l8_n2(x)
+    else
+        fun_l8_n253(x)
+    end
+end
+
+def fun_l7_n677(x)
+    if (x < 1)
+        fun_l8_n839(x)
+    else
+        fun_l8_n919(x)
+    end
+end
+
+def fun_l7_n678(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n245(x)
+    end
+end
+
+def fun_l7_n679(x)
+    if (x < 1)
+        fun_l8_n625(x)
+    else
+        fun_l8_n690(x)
+    end
+end
+
+def fun_l7_n680(x)
+    if (x < 1)
+        fun_l8_n899(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n681(x)
+    if (x < 1)
+        fun_l8_n894(x)
+    else
+        fun_l8_n92(x)
+    end
+end
+
+def fun_l7_n682(x)
+    if (x < 1)
+        fun_l8_n139(x)
+    else
+        fun_l8_n252(x)
+    end
+end
+
+def fun_l7_n683(x)
+    if (x < 1)
+        fun_l8_n978(x)
+    else
+        fun_l8_n84(x)
+    end
+end
+
+def fun_l7_n684(x)
+    if (x < 1)
+        fun_l8_n426(x)
+    else
+        fun_l8_n329(x)
+    end
+end
+
+def fun_l7_n685(x)
+    if (x < 1)
+        fun_l8_n241(x)
+    else
+        fun_l8_n780(x)
+    end
+end
+
+def fun_l7_n686(x)
+    if (x < 1)
+        fun_l8_n793(x)
+    else
+        fun_l8_n534(x)
+    end
+end
+
+def fun_l7_n687(x)
+    if (x < 1)
+        fun_l8_n409(x)
+    else
+        fun_l8_n152(x)
+    end
+end
+
+def fun_l7_n688(x)
+    if (x < 1)
+        fun_l8_n838(x)
+    else
+        fun_l8_n555(x)
+    end
+end
+
+def fun_l7_n689(x)
+    if (x < 1)
+        fun_l8_n634(x)
+    else
+        fun_l8_n27(x)
+    end
+end
+
+def fun_l7_n690(x)
+    if (x < 1)
+        fun_l8_n629(x)
+    else
+        fun_l8_n448(x)
+    end
+end
+
+def fun_l7_n691(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n293(x)
+    end
+end
+
+def fun_l7_n692(x)
+    if (x < 1)
+        fun_l8_n739(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n693(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n642(x)
+    end
+end
+
+def fun_l7_n694(x)
+    if (x < 1)
+        fun_l8_n123(x)
+    else
+        fun_l8_n880(x)
+    end
+end
+
+def fun_l7_n695(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n364(x)
+    end
+end
+
+def fun_l7_n696(x)
+    if (x < 1)
+        fun_l8_n610(x)
+    else
+        fun_l8_n798(x)
+    end
+end
+
+def fun_l7_n697(x)
+    if (x < 1)
+        fun_l8_n396(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n698(x)
+    if (x < 1)
+        fun_l8_n759(x)
+    else
+        fun_l8_n880(x)
+    end
+end
+
+def fun_l7_n699(x)
+    if (x < 1)
+        fun_l8_n885(x)
+    else
+        fun_l8_n139(x)
+    end
+end
+
+def fun_l7_n700(x)
+    if (x < 1)
+        fun_l8_n244(x)
+    else
+        fun_l8_n307(x)
+    end
+end
+
+def fun_l7_n701(x)
+    if (x < 1)
+        fun_l8_n698(x)
+    else
+        fun_l8_n949(x)
+    end
+end
+
+def fun_l7_n702(x)
+    if (x < 1)
+        fun_l8_n585(x)
+    else
+        fun_l8_n211(x)
+    end
+end
+
+def fun_l7_n703(x)
+    if (x < 1)
+        fun_l8_n834(x)
+    else
+        fun_l8_n111(x)
+    end
+end
+
+def fun_l7_n704(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n981(x)
+    end
+end
+
+def fun_l7_n705(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n392(x)
+    end
+end
+
+def fun_l7_n706(x)
+    if (x < 1)
+        fun_l8_n988(x)
+    else
+        fun_l8_n759(x)
+    end
+end
+
+def fun_l7_n707(x)
+    if (x < 1)
+        fun_l8_n917(x)
+    else
+        fun_l8_n326(x)
+    end
+end
+
+def fun_l7_n708(x)
+    if (x < 1)
+        fun_l8_n662(x)
+    else
+        fun_l8_n488(x)
+    end
+end
+
+def fun_l7_n709(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n663(x)
+    end
+end
+
+def fun_l7_n710(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n282(x)
+    end
+end
+
+def fun_l7_n711(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n405(x)
+    end
+end
+
+def fun_l7_n712(x)
+    if (x < 1)
+        fun_l8_n332(x)
+    else
+        fun_l8_n660(x)
+    end
+end
+
+def fun_l7_n713(x)
+    if (x < 1)
+        fun_l8_n37(x)
+    else
+        fun_l8_n689(x)
+    end
+end
+
+def fun_l7_n714(x)
+    if (x < 1)
+        fun_l8_n642(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n715(x)
+    if (x < 1)
+        fun_l8_n322(x)
+    else
+        fun_l8_n609(x)
+    end
+end
+
+def fun_l7_n716(x)
+    if (x < 1)
+        fun_l8_n567(x)
+    else
+        fun_l8_n492(x)
+    end
+end
+
+def fun_l7_n717(x)
+    if (x < 1)
+        fun_l8_n934(x)
+    else
+        fun_l8_n353(x)
+    end
+end
+
+def fun_l7_n718(x)
+    if (x < 1)
+        fun_l8_n572(x)
+    else
+        fun_l8_n859(x)
+    end
+end
+
+def fun_l7_n719(x)
+    if (x < 1)
+        fun_l8_n777(x)
+    else
+        fun_l8_n810(x)
+    end
+end
+
+def fun_l7_n720(x)
+    if (x < 1)
+        fun_l8_n121(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n721(x)
+    if (x < 1)
+        fun_l8_n177(x)
+    else
+        fun_l8_n484(x)
+    end
+end
+
+def fun_l7_n722(x)
+    if (x < 1)
+        fun_l8_n73(x)
+    else
+        fun_l8_n795(x)
+    end
+end
+
+def fun_l7_n723(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n382(x)
+    end
+end
+
+def fun_l7_n724(x)
+    if (x < 1)
+        fun_l8_n349(x)
+    else
+        fun_l8_n644(x)
+    end
+end
+
+def fun_l7_n725(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n262(x)
+    end
+end
+
+def fun_l7_n726(x)
+    if (x < 1)
+        fun_l8_n39(x)
+    else
+        fun_l8_n543(x)
+    end
+end
+
+def fun_l7_n727(x)
+    if (x < 1)
+        fun_l8_n934(x)
+    else
+        fun_l8_n440(x)
+    end
+end
+
+def fun_l7_n728(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n341(x)
+    end
+end
+
+def fun_l7_n729(x)
+    if (x < 1)
+        fun_l8_n284(x)
+    else
+        fun_l8_n884(x)
+    end
+end
+
+def fun_l7_n730(x)
+    if (x < 1)
+        fun_l8_n841(x)
+    else
+        fun_l8_n221(x)
+    end
+end
+
+def fun_l7_n731(x)
+    if (x < 1)
+        fun_l8_n719(x)
+    else
+        fun_l8_n907(x)
+    end
+end
+
+def fun_l7_n732(x)
+    if (x < 1)
+        fun_l8_n422(x)
+    else
+        fun_l8_n65(x)
+    end
+end
+
+def fun_l7_n733(x)
+    if (x < 1)
+        fun_l8_n324(x)
+    else
+        fun_l8_n811(x)
+    end
+end
+
+def fun_l7_n734(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n622(x)
+    end
+end
+
+def fun_l7_n735(x)
+    if (x < 1)
+        fun_l8_n20(x)
+    else
+        fun_l8_n205(x)
+    end
+end
+
+def fun_l7_n736(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n908(x)
+    end
+end
+
+def fun_l7_n737(x)
+    if (x < 1)
+        fun_l8_n576(x)
+    else
+        fun_l8_n789(x)
+    end
+end
+
+def fun_l7_n738(x)
+    if (x < 1)
+        fun_l8_n353(x)
+    else
+        fun_l8_n286(x)
+    end
+end
+
+def fun_l7_n739(x)
+    if (x < 1)
+        fun_l8_n614(x)
+    else
+        fun_l8_n121(x)
+    end
+end
+
+def fun_l7_n740(x)
+    if (x < 1)
+        fun_l8_n79(x)
+    else
+        fun_l8_n637(x)
+    end
+end
+
+def fun_l7_n741(x)
+    if (x < 1)
+        fun_l8_n808(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n742(x)
+    if (x < 1)
+        fun_l8_n590(x)
+    else
+        fun_l8_n198(x)
+    end
+end
+
+def fun_l7_n743(x)
+    if (x < 1)
+        fun_l8_n498(x)
+    else
+        fun_l8_n379(x)
+    end
+end
+
+def fun_l7_n744(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n359(x)
+    end
+end
+
+def fun_l7_n745(x)
+    if (x < 1)
+        fun_l8_n898(x)
+    else
+        fun_l8_n520(x)
+    end
+end
+
+def fun_l7_n746(x)
+    if (x < 1)
+        fun_l8_n835(x)
+    else
+        fun_l8_n131(x)
+    end
+end
+
+def fun_l7_n747(x)
+    if (x < 1)
+        fun_l8_n648(x)
+    else
+        fun_l8_n248(x)
+    end
+end
+
+def fun_l7_n748(x)
+    if (x < 1)
+        fun_l8_n451(x)
+    else
+        fun_l8_n352(x)
+    end
+end
+
+def fun_l7_n749(x)
+    if (x < 1)
+        fun_l8_n69(x)
+    else
+        fun_l8_n974(x)
+    end
+end
+
+def fun_l7_n750(x)
+    if (x < 1)
+        fun_l8_n108(x)
+    else
+        fun_l8_n744(x)
+    end
+end
+
+def fun_l7_n751(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n305(x)
+    end
+end
+
+def fun_l7_n752(x)
+    if (x < 1)
+        fun_l8_n180(x)
+    else
+        fun_l8_n293(x)
+    end
+end
+
+def fun_l7_n753(x)
+    if (x < 1)
+        fun_l8_n555(x)
+    else
+        fun_l8_n882(x)
+    end
+end
+
+def fun_l7_n754(x)
+    if (x < 1)
+        fun_l8_n756(x)
+    else
+        fun_l8_n604(x)
+    end
+end
+
+def fun_l7_n755(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n708(x)
+    end
+end
+
+def fun_l7_n756(x)
+    if (x < 1)
+        fun_l8_n65(x)
+    else
+        fun_l8_n474(x)
+    end
+end
+
+def fun_l7_n757(x)
+    if (x < 1)
+        fun_l8_n43(x)
+    else
+        fun_l8_n892(x)
+    end
+end
+
+def fun_l7_n758(x)
+    if (x < 1)
+        fun_l8_n90(x)
+    else
+        fun_l8_n968(x)
+    end
+end
+
+def fun_l7_n759(x)
+    if (x < 1)
+        fun_l8_n599(x)
+    else
+        fun_l8_n505(x)
+    end
+end
+
+def fun_l7_n760(x)
+    if (x < 1)
+        fun_l8_n344(x)
+    else
+        fun_l8_n122(x)
+    end
+end
+
+def fun_l7_n761(x)
+    if (x < 1)
+        fun_l8_n289(x)
+    else
+        fun_l8_n867(x)
+    end
+end
+
+def fun_l7_n762(x)
+    if (x < 1)
+        fun_l8_n107(x)
+    else
+        fun_l8_n950(x)
+    end
+end
+
+def fun_l7_n763(x)
+    if (x < 1)
+        fun_l8_n405(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n764(x)
+    if (x < 1)
+        fun_l8_n91(x)
+    else
+        fun_l8_n760(x)
+    end
+end
+
+def fun_l7_n765(x)
+    if (x < 1)
+        fun_l8_n268(x)
+    else
+        fun_l8_n451(x)
+    end
+end
+
+def fun_l7_n766(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n150(x)
+    end
+end
+
+def fun_l7_n767(x)
+    if (x < 1)
+        fun_l8_n622(x)
+    else
+        fun_l8_n114(x)
+    end
+end
+
+def fun_l7_n768(x)
+    if (x < 1)
+        fun_l8_n662(x)
+    else
+        fun_l8_n514(x)
+    end
+end
+
+def fun_l7_n769(x)
+    if (x < 1)
+        fun_l8_n440(x)
+    else
+        fun_l8_n537(x)
+    end
+end
+
+def fun_l7_n770(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n513(x)
+    end
+end
+
+def fun_l7_n771(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n857(x)
+    end
+end
+
+def fun_l7_n772(x)
+    if (x < 1)
+        fun_l8_n635(x)
+    else
+        fun_l8_n696(x)
+    end
+end
+
+def fun_l7_n773(x)
+    if (x < 1)
+        fun_l8_n687(x)
+    else
+        fun_l8_n926(x)
+    end
+end
+
+def fun_l7_n774(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n410(x)
+    end
+end
+
+def fun_l7_n775(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n339(x)
+    end
+end
+
+def fun_l7_n776(x)
+    if (x < 1)
+        fun_l8_n130(x)
+    else
+        fun_l8_n48(x)
+    end
+end
+
+def fun_l7_n777(x)
+    if (x < 1)
+        fun_l8_n627(x)
+    else
+        fun_l8_n191(x)
+    end
+end
+
+def fun_l7_n778(x)
+    if (x < 1)
+        fun_l8_n843(x)
+    else
+        fun_l8_n627(x)
+    end
+end
+
+def fun_l7_n779(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n247(x)
+    end
+end
+
+def fun_l7_n780(x)
+    if (x < 1)
+        fun_l8_n865(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n781(x)
+    if (x < 1)
+        fun_l8_n440(x)
+    else
+        fun_l8_n326(x)
+    end
+end
+
+def fun_l7_n782(x)
+    if (x < 1)
+        fun_l8_n463(x)
+    else
+        fun_l8_n808(x)
+    end
+end
+
+def fun_l7_n783(x)
+    if (x < 1)
+        fun_l8_n44(x)
+    else
+        fun_l8_n888(x)
+    end
+end
+
+def fun_l7_n784(x)
+    if (x < 1)
+        fun_l8_n690(x)
+    else
+        fun_l8_n673(x)
+    end
+end
+
+def fun_l7_n785(x)
+    if (x < 1)
+        fun_l8_n641(x)
+    else
+        fun_l8_n367(x)
+    end
+end
+
+def fun_l7_n786(x)
+    if (x < 1)
+        fun_l8_n193(x)
+    else
+        fun_l8_n764(x)
+    end
+end
+
+def fun_l7_n787(x)
+    if (x < 1)
+        fun_l8_n604(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n788(x)
+    if (x < 1)
+        fun_l8_n626(x)
+    else
+        fun_l8_n101(x)
+    end
+end
+
+def fun_l7_n789(x)
+    if (x < 1)
+        fun_l8_n152(x)
+    else
+        fun_l8_n9(x)
+    end
+end
+
+def fun_l7_n790(x)
+    if (x < 1)
+        fun_l8_n541(x)
+    else
+        fun_l8_n789(x)
+    end
+end
+
+def fun_l7_n791(x)
+    if (x < 1)
+        fun_l8_n706(x)
+    else
+        fun_l8_n577(x)
+    end
+end
+
+def fun_l7_n792(x)
+    if (x < 1)
+        fun_l8_n480(x)
+    else
+        fun_l8_n284(x)
+    end
+end
+
+def fun_l7_n793(x)
+    if (x < 1)
+        fun_l8_n157(x)
+    else
+        fun_l8_n620(x)
+    end
+end
+
+def fun_l7_n794(x)
+    if (x < 1)
+        fun_l8_n666(x)
+    else
+        fun_l8_n755(x)
+    end
+end
+
+def fun_l7_n795(x)
+    if (x < 1)
+        fun_l8_n487(x)
+    else
+        fun_l8_n20(x)
+    end
+end
+
+def fun_l7_n796(x)
+    if (x < 1)
+        fun_l8_n750(x)
+    else
+        fun_l8_n974(x)
+    end
+end
+
+def fun_l7_n797(x)
+    if (x < 1)
+        fun_l8_n812(x)
+    else
+        fun_l8_n915(x)
+    end
+end
+
+def fun_l7_n798(x)
+    if (x < 1)
+        fun_l8_n297(x)
+    else
+        fun_l8_n8(x)
+    end
+end
+
+def fun_l7_n799(x)
+    if (x < 1)
+        fun_l8_n385(x)
+    else
+        fun_l8_n920(x)
+    end
+end
+
+def fun_l7_n800(x)
+    if (x < 1)
+        fun_l8_n322(x)
+    else
+        fun_l8_n603(x)
+    end
+end
+
+def fun_l7_n801(x)
+    if (x < 1)
+        fun_l8_n825(x)
+    else
+        fun_l8_n702(x)
+    end
+end
+
+def fun_l7_n802(x)
+    if (x < 1)
+        fun_l8_n902(x)
+    else
+        fun_l8_n978(x)
+    end
+end
+
+def fun_l7_n803(x)
+    if (x < 1)
+        fun_l8_n921(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n804(x)
+    if (x < 1)
+        fun_l8_n171(x)
+    else
+        fun_l8_n630(x)
+    end
+end
+
+def fun_l7_n805(x)
+    if (x < 1)
+        fun_l8_n469(x)
+    else
+        fun_l8_n265(x)
+    end
+end
+
+def fun_l7_n806(x)
+    if (x < 1)
+        fun_l8_n367(x)
+    else
+        fun_l8_n820(x)
+    end
+end
+
+def fun_l7_n807(x)
+    if (x < 1)
+        fun_l8_n242(x)
+    else
+        fun_l8_n707(x)
+    end
+end
+
+def fun_l7_n808(x)
+    if (x < 1)
+        fun_l8_n512(x)
+    else
+        fun_l8_n139(x)
+    end
+end
+
+def fun_l7_n809(x)
+    if (x < 1)
+        fun_l8_n17(x)
+    else
+        fun_l8_n615(x)
+    end
+end
+
+def fun_l7_n810(x)
+    if (x < 1)
+        fun_l8_n600(x)
+    else
+        fun_l8_n6(x)
+    end
+end
+
+def fun_l7_n811(x)
+    if (x < 1)
+        fun_l8_n342(x)
+    else
+        fun_l8_n194(x)
+    end
+end
+
+def fun_l7_n812(x)
+    if (x < 1)
+        fun_l8_n191(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n813(x)
+    if (x < 1)
+        fun_l8_n577(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n814(x)
+    if (x < 1)
+        fun_l8_n729(x)
+    else
+        fun_l8_n989(x)
+    end
+end
+
+def fun_l7_n815(x)
+    if (x < 1)
+        fun_l8_n707(x)
+    else
+        fun_l8_n846(x)
+    end
+end
+
+def fun_l7_n816(x)
+    if (x < 1)
+        fun_l8_n874(x)
+    else
+        fun_l8_n790(x)
+    end
+end
+
+def fun_l7_n817(x)
+    if (x < 1)
+        fun_l8_n968(x)
+    else
+        fun_l8_n215(x)
+    end
+end
+
+def fun_l7_n818(x)
+    if (x < 1)
+        fun_l8_n444(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n819(x)
+    if (x < 1)
+        fun_l8_n103(x)
+    else
+        fun_l8_n134(x)
+    end
+end
+
+def fun_l7_n820(x)
+    if (x < 1)
+        fun_l8_n718(x)
+    else
+        fun_l8_n950(x)
+    end
+end
+
+def fun_l7_n821(x)
+    if (x < 1)
+        fun_l8_n439(x)
+    else
+        fun_l8_n68(x)
+    end
+end
+
+def fun_l7_n822(x)
+    if (x < 1)
+        fun_l8_n961(x)
+    else
+        fun_l8_n593(x)
+    end
+end
+
+def fun_l7_n823(x)
+    if (x < 1)
+        fun_l8_n212(x)
+    else
+        fun_l8_n346(x)
+    end
+end
+
+def fun_l7_n824(x)
+    if (x < 1)
+        fun_l8_n926(x)
+    else
+        fun_l8_n225(x)
+    end
+end
+
+def fun_l7_n825(x)
+    if (x < 1)
+        fun_l8_n880(x)
+    else
+        fun_l8_n527(x)
+    end
+end
+
+def fun_l7_n826(x)
+    if (x < 1)
+        fun_l8_n13(x)
+    else
+        fun_l8_n436(x)
+    end
+end
+
+def fun_l7_n827(x)
+    if (x < 1)
+        fun_l8_n19(x)
+    else
+        fun_l8_n201(x)
+    end
+end
+
+def fun_l7_n828(x)
+    if (x < 1)
+        fun_l8_n568(x)
+    else
+        fun_l8_n450(x)
+    end
+end
+
+def fun_l7_n829(x)
+    if (x < 1)
+        fun_l8_n543(x)
+    else
+        fun_l8_n606(x)
+    end
+end
+
+def fun_l7_n830(x)
+    if (x < 1)
+        fun_l8_n503(x)
+    else
+        fun_l8_n104(x)
+    end
+end
+
+def fun_l7_n831(x)
+    if (x < 1)
+        fun_l8_n185(x)
+    else
+        fun_l8_n1(x)
+    end
+end
+
+def fun_l7_n832(x)
+    if (x < 1)
+        fun_l8_n598(x)
+    else
+        fun_l8_n637(x)
+    end
+end
+
+def fun_l7_n833(x)
+    if (x < 1)
+        fun_l8_n936(x)
+    else
+        fun_l8_n554(x)
+    end
+end
+
+def fun_l7_n834(x)
+    if (x < 1)
+        fun_l8_n864(x)
+    else
+        fun_l8_n766(x)
+    end
+end
+
+def fun_l7_n835(x)
+    if (x < 1)
+        fun_l8_n11(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n836(x)
+    if (x < 1)
+        fun_l8_n596(x)
+    else
+        fun_l8_n429(x)
+    end
+end
+
+def fun_l7_n837(x)
+    if (x < 1)
+        fun_l8_n643(x)
+    else
+        fun_l8_n61(x)
+    end
+end
+
+def fun_l7_n838(x)
+    if (x < 1)
+        fun_l8_n905(x)
+    else
+        fun_l8_n605(x)
+    end
+end
+
+def fun_l7_n839(x)
+    if (x < 1)
+        fun_l8_n371(x)
+    else
+        fun_l8_n44(x)
+    end
+end
+
+def fun_l7_n840(x)
+    if (x < 1)
+        fun_l8_n195(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n841(x)
+    if (x < 1)
+        fun_l8_n432(x)
+    else
+        fun_l8_n368(x)
+    end
+end
+
+def fun_l7_n842(x)
+    if (x < 1)
+        fun_l8_n145(x)
+    else
+        fun_l8_n180(x)
+    end
+end
+
+def fun_l7_n843(x)
+    if (x < 1)
+        fun_l8_n124(x)
+    else
+        fun_l8_n358(x)
+    end
+end
+
+def fun_l7_n844(x)
+    if (x < 1)
+        fun_l8_n87(x)
+    else
+        fun_l8_n364(x)
+    end
+end
+
+def fun_l7_n845(x)
+    if (x < 1)
+        fun_l8_n133(x)
+    else
+        fun_l8_n849(x)
+    end
+end
+
+def fun_l7_n846(x)
+    if (x < 1)
+        fun_l8_n686(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n847(x)
+    if (x < 1)
+        fun_l8_n732(x)
+    else
+        fun_l8_n536(x)
+    end
+end
+
+def fun_l7_n848(x)
+    if (x < 1)
+        fun_l8_n950(x)
+    else
+        fun_l8_n173(x)
+    end
+end
+
+def fun_l7_n849(x)
+    if (x < 1)
+        fun_l8_n694(x)
+    else
+        fun_l8_n747(x)
+    end
+end
+
+def fun_l7_n850(x)
+    if (x < 1)
+        fun_l8_n421(x)
+    else
+        fun_l8_n940(x)
+    end
+end
+
+def fun_l7_n851(x)
+    if (x < 1)
+        fun_l8_n359(x)
+    else
+        fun_l8_n239(x)
+    end
+end
+
+def fun_l7_n852(x)
+    if (x < 1)
+        fun_l8_n731(x)
+    else
+        fun_l8_n530(x)
+    end
+end
+
+def fun_l7_n853(x)
+    if (x < 1)
+        fun_l8_n887(x)
+    else
+        fun_l8_n548(x)
+    end
+end
+
+def fun_l7_n854(x)
+    if (x < 1)
+        fun_l8_n47(x)
+    else
+        fun_l8_n675(x)
+    end
+end
+
+def fun_l7_n855(x)
+    if (x < 1)
+        fun_l8_n534(x)
+    else
+        fun_l8_n34(x)
+    end
+end
+
+def fun_l7_n856(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n402(x)
+    end
+end
+
+def fun_l7_n857(x)
+    if (x < 1)
+        fun_l8_n873(x)
+    else
+        fun_l8_n864(x)
+    end
+end
+
+def fun_l7_n858(x)
+    if (x < 1)
+        fun_l8_n325(x)
+    else
+        fun_l8_n495(x)
+    end
+end
+
+def fun_l7_n859(x)
+    if (x < 1)
+        fun_l8_n758(x)
+    else
+        fun_l8_n63(x)
+    end
+end
+
+def fun_l7_n860(x)
+    if (x < 1)
+        fun_l8_n811(x)
+    else
+        fun_l8_n150(x)
+    end
+end
+
+def fun_l7_n861(x)
+    if (x < 1)
+        fun_l8_n666(x)
+    else
+        fun_l8_n282(x)
+    end
+end
+
+def fun_l7_n862(x)
+    if (x < 1)
+        fun_l8_n123(x)
+    else
+        fun_l8_n893(x)
+    end
+end
+
+def fun_l7_n863(x)
+    if (x < 1)
+        fun_l8_n681(x)
+    else
+        fun_l8_n640(x)
+    end
+end
+
+def fun_l7_n864(x)
+    if (x < 1)
+        fun_l8_n861(x)
+    else
+        fun_l8_n922(x)
+    end
+end
+
+def fun_l7_n865(x)
+    if (x < 1)
+        fun_l8_n8(x)
+    else
+        fun_l8_n14(x)
+    end
+end
+
+def fun_l7_n866(x)
+    if (x < 1)
+        fun_l8_n713(x)
+    else
+        fun_l8_n802(x)
+    end
+end
+
+def fun_l7_n867(x)
+    if (x < 1)
+        fun_l8_n654(x)
+    else
+        fun_l8_n540(x)
+    end
+end
+
+def fun_l7_n868(x)
+    if (x < 1)
+        fun_l8_n308(x)
+    else
+        fun_l8_n504(x)
+    end
+end
+
+def fun_l7_n869(x)
+    if (x < 1)
+        fun_l8_n67(x)
+    else
+        fun_l8_n592(x)
+    end
+end
+
+def fun_l7_n870(x)
+    if (x < 1)
+        fun_l8_n295(x)
+    else
+        fun_l8_n585(x)
+    end
+end
+
+def fun_l7_n871(x)
+    if (x < 1)
+        fun_l8_n121(x)
+    else
+        fun_l8_n797(x)
+    end
+end
+
+def fun_l7_n872(x)
+    if (x < 1)
+        fun_l8_n234(x)
+    else
+        fun_l8_n834(x)
+    end
+end
+
+def fun_l7_n873(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n731(x)
+    end
+end
+
+def fun_l7_n874(x)
+    if (x < 1)
+        fun_l8_n460(x)
+    else
+        fun_l8_n261(x)
+    end
+end
+
+def fun_l7_n875(x)
+    if (x < 1)
+        fun_l8_n211(x)
+    else
+        fun_l8_n199(x)
+    end
+end
+
+def fun_l7_n876(x)
+    if (x < 1)
+        fun_l8_n256(x)
+    else
+        fun_l8_n547(x)
+    end
+end
+
+def fun_l7_n877(x)
+    if (x < 1)
+        fun_l8_n560(x)
+    else
+        fun_l8_n202(x)
+    end
+end
+
+def fun_l7_n878(x)
+    if (x < 1)
+        fun_l8_n5(x)
+    else
+        fun_l8_n955(x)
+    end
+end
+
+def fun_l7_n879(x)
+    if (x < 1)
+        fun_l8_n908(x)
+    else
+        fun_l8_n677(x)
+    end
+end
+
+def fun_l7_n880(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n226(x)
+    end
+end
+
+def fun_l7_n881(x)
+    if (x < 1)
+        fun_l8_n970(x)
+    else
+        fun_l8_n939(x)
+    end
+end
+
+def fun_l7_n882(x)
+    if (x < 1)
+        fun_l8_n562(x)
+    else
+        fun_l8_n420(x)
+    end
+end
+
+def fun_l7_n883(x)
+    if (x < 1)
+        fun_l8_n377(x)
+    else
+        fun_l8_n35(x)
+    end
+end
+
+def fun_l7_n884(x)
+    if (x < 1)
+        fun_l8_n459(x)
+    else
+        fun_l8_n155(x)
+    end
+end
+
+def fun_l7_n885(x)
+    if (x < 1)
+        fun_l8_n257(x)
+    else
+        fun_l8_n704(x)
+    end
+end
+
+def fun_l7_n886(x)
+    if (x < 1)
+        fun_l8_n393(x)
+    else
+        fun_l8_n741(x)
+    end
+end
+
+def fun_l7_n887(x)
+    if (x < 1)
+        fun_l8_n333(x)
+    else
+        fun_l8_n225(x)
+    end
+end
+
+def fun_l7_n888(x)
+    if (x < 1)
+        fun_l8_n614(x)
+    else
+        fun_l8_n106(x)
+    end
+end
+
+def fun_l7_n889(x)
+    if (x < 1)
+        fun_l8_n229(x)
+    else
+        fun_l8_n519(x)
+    end
+end
+
+def fun_l7_n890(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n68(x)
+    end
+end
+
+def fun_l7_n891(x)
+    if (x < 1)
+        fun_l8_n987(x)
+    else
+        fun_l8_n905(x)
+    end
+end
+
+def fun_l7_n892(x)
+    if (x < 1)
+        fun_l8_n698(x)
+    else
+        fun_l8_n942(x)
+    end
+end
+
+def fun_l7_n893(x)
+    if (x < 1)
+        fun_l8_n559(x)
+    else
+        fun_l8_n613(x)
+    end
+end
+
+def fun_l7_n894(x)
+    if (x < 1)
+        fun_l8_n402(x)
+    else
+        fun_l8_n966(x)
+    end
+end
+
+def fun_l7_n895(x)
+    if (x < 1)
+        fun_l8_n475(x)
+    else
+        fun_l8_n158(x)
+    end
+end
+
+def fun_l7_n896(x)
+    if (x < 1)
+        fun_l8_n420(x)
+    else
+        fun_l8_n113(x)
+    end
+end
+
+def fun_l7_n897(x)
+    if (x < 1)
+        fun_l8_n366(x)
+    else
+        fun_l8_n272(x)
+    end
+end
+
+def fun_l7_n898(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n821(x)
+    end
+end
+
+def fun_l7_n899(x)
+    if (x < 1)
+        fun_l8_n736(x)
+    else
+        fun_l8_n174(x)
+    end
+end
+
+def fun_l7_n900(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n611(x)
+    end
+end
+
+def fun_l7_n901(x)
+    if (x < 1)
+        fun_l8_n3(x)
+    else
+        fun_l8_n221(x)
+    end
+end
+
+def fun_l7_n902(x)
+    if (x < 1)
+        fun_l8_n319(x)
+    else
+        fun_l8_n930(x)
+    end
+end
+
+def fun_l7_n903(x)
+    if (x < 1)
+        fun_l8_n619(x)
+    else
+        fun_l8_n491(x)
+    end
+end
+
+def fun_l7_n904(x)
+    if (x < 1)
+        fun_l8_n144(x)
+    else
+        fun_l8_n304(x)
+    end
+end
+
+def fun_l7_n905(x)
+    if (x < 1)
+        fun_l8_n721(x)
+    else
+        fun_l8_n996(x)
+    end
+end
+
+def fun_l7_n906(x)
+    if (x < 1)
+        fun_l8_n700(x)
+    else
+        fun_l8_n688(x)
+    end
+end
+
+def fun_l7_n907(x)
+    if (x < 1)
+        fun_l8_n202(x)
+    else
+        fun_l8_n668(x)
+    end
+end
+
+def fun_l7_n908(x)
+    if (x < 1)
+        fun_l8_n514(x)
+    else
+        fun_l8_n306(x)
+    end
+end
+
+def fun_l7_n909(x)
+    if (x < 1)
+        fun_l8_n592(x)
+    else
+        fun_l8_n43(x)
+    end
+end
+
+def fun_l7_n910(x)
+    if (x < 1)
+        fun_l8_n743(x)
+    else
+        fun_l8_n406(x)
+    end
+end
+
+def fun_l7_n911(x)
+    if (x < 1)
+        fun_l8_n801(x)
+    else
+        fun_l8_n91(x)
+    end
+end
+
+def fun_l7_n912(x)
+    if (x < 1)
+        fun_l8_n392(x)
+    else
+        fun_l8_n461(x)
+    end
+end
+
+def fun_l7_n913(x)
+    if (x < 1)
+        fun_l8_n175(x)
+    else
+        fun_l8_n578(x)
+    end
+end
+
+def fun_l7_n914(x)
+    if (x < 1)
+        fun_l8_n155(x)
+    else
+        fun_l8_n795(x)
+    end
+end
+
+def fun_l7_n915(x)
+    if (x < 1)
+        fun_l8_n394(x)
+    else
+        fun_l8_n89(x)
+    end
+end
+
+def fun_l7_n916(x)
+    if (x < 1)
+        fun_l8_n59(x)
+    else
+        fun_l8_n345(x)
+    end
+end
+
+def fun_l7_n917(x)
+    if (x < 1)
+        fun_l8_n450(x)
+    else
+        fun_l8_n136(x)
+    end
+end
+
+def fun_l7_n918(x)
+    if (x < 1)
+        fun_l8_n530(x)
+    else
+        fun_l8_n233(x)
+    end
+end
+
+def fun_l7_n919(x)
+    if (x < 1)
+        fun_l8_n632(x)
+    else
+        fun_l8_n631(x)
+    end
+end
+
+def fun_l7_n920(x)
+    if (x < 1)
+        fun_l8_n252(x)
+    else
+        fun_l8_n95(x)
+    end
+end
+
+def fun_l7_n921(x)
+    if (x < 1)
+        fun_l8_n980(x)
+    else
+        fun_l8_n819(x)
+    end
+end
+
+def fun_l7_n922(x)
+    if (x < 1)
+        fun_l8_n866(x)
+    else
+        fun_l8_n652(x)
+    end
+end
+
+def fun_l7_n923(x)
+    if (x < 1)
+        fun_l8_n239(x)
+    else
+        fun_l8_n83(x)
+    end
+end
+
+def fun_l7_n924(x)
+    if (x < 1)
+        fun_l8_n162(x)
+    else
+        fun_l8_n193(x)
+    end
+end
+
+def fun_l7_n925(x)
+    if (x < 1)
+        fun_l8_n78(x)
+    else
+        fun_l8_n546(x)
+    end
+end
+
+def fun_l7_n926(x)
+    if (x < 1)
+        fun_l8_n102(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n927(x)
+    if (x < 1)
+        fun_l8_n84(x)
+    else
+        fun_l8_n257(x)
+    end
+end
+
+def fun_l7_n928(x)
+    if (x < 1)
+        fun_l8_n195(x)
+    else
+        fun_l8_n200(x)
+    end
+end
+
+def fun_l7_n929(x)
+    if (x < 1)
+        fun_l8_n245(x)
+    else
+        fun_l8_n926(x)
+    end
+end
+
+def fun_l7_n930(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n308(x)
+    end
+end
+
+def fun_l7_n931(x)
+    if (x < 1)
+        fun_l8_n312(x)
+    else
+        fun_l8_n901(x)
+    end
+end
+
+def fun_l7_n932(x)
+    if (x < 1)
+        fun_l8_n221(x)
+    else
+        fun_l8_n775(x)
+    end
+end
+
+def fun_l7_n933(x)
+    if (x < 1)
+        fun_l8_n397(x)
+    else
+        fun_l8_n973(x)
+    end
+end
+
+def fun_l7_n934(x)
+    if (x < 1)
+        fun_l8_n788(x)
+    else
+        fun_l8_n952(x)
+    end
+end
+
+def fun_l7_n935(x)
+    if (x < 1)
+        fun_l8_n965(x)
+    else
+        fun_l8_n861(x)
+    end
+end
+
+def fun_l7_n936(x)
+    if (x < 1)
+        fun_l8_n969(x)
+    else
+        fun_l8_n773(x)
+    end
+end
+
+def fun_l7_n937(x)
+    if (x < 1)
+        fun_l8_n742(x)
+    else
+        fun_l8_n237(x)
+    end
+end
+
+def fun_l7_n938(x)
+    if (x < 1)
+        fun_l8_n369(x)
+    else
+        fun_l8_n444(x)
+    end
+end
+
+def fun_l7_n939(x)
+    if (x < 1)
+        fun_l8_n863(x)
+    else
+        fun_l8_n515(x)
+    end
+end
+
+def fun_l7_n940(x)
+    if (x < 1)
+        fun_l8_n573(x)
+    else
+        fun_l8_n356(x)
+    end
+end
+
+def fun_l7_n941(x)
+    if (x < 1)
+        fun_l8_n188(x)
+    else
+        fun_l8_n171(x)
+    end
+end
+
+def fun_l7_n942(x)
+    if (x < 1)
+        fun_l8_n483(x)
+    else
+        fun_l8_n556(x)
+    end
+end
+
+def fun_l7_n943(x)
+    if (x < 1)
+        fun_l8_n935(x)
+    else
+        fun_l8_n723(x)
+    end
+end
+
+def fun_l7_n944(x)
+    if (x < 1)
+        fun_l8_n451(x)
+    else
+        fun_l8_n227(x)
+    end
+end
+
+def fun_l7_n945(x)
+    if (x < 1)
+        fun_l8_n651(x)
+    else
+        fun_l8_n891(x)
+    end
+end
+
+def fun_l7_n946(x)
+    if (x < 1)
+        fun_l8_n225(x)
+    else
+        fun_l8_n178(x)
+    end
+end
+
+def fun_l7_n947(x)
+    if (x < 1)
+        fun_l8_n704(x)
+    else
+        fun_l8_n456(x)
+    end
+end
+
+def fun_l7_n948(x)
+    if (x < 1)
+        fun_l8_n995(x)
+    else
+        fun_l8_n816(x)
+    end
+end
+
+def fun_l7_n949(x)
+    if (x < 1)
+        fun_l8_n287(x)
+    else
+        fun_l8_n140(x)
+    end
+end
+
+def fun_l7_n950(x)
+    if (x < 1)
+        fun_l8_n302(x)
+    else
+        fun_l8_n582(x)
+    end
+end
+
+def fun_l7_n951(x)
+    if (x < 1)
+        fun_l8_n58(x)
+    else
+        fun_l8_n759(x)
+    end
+end
+
+def fun_l7_n952(x)
+    if (x < 1)
+        fun_l8_n54(x)
+    else
+        fun_l8_n812(x)
+    end
+end
+
+def fun_l7_n953(x)
+    if (x < 1)
+        fun_l8_n263(x)
+    else
+        fun_l8_n801(x)
+    end
+end
+
+def fun_l7_n954(x)
+    if (x < 1)
+        fun_l8_n507(x)
+    else
+        fun_l8_n781(x)
+    end
+end
+
+def fun_l7_n955(x)
+    if (x < 1)
+        fun_l8_n328(x)
+    else
+        fun_l8_n886(x)
+    end
+end
+
+def fun_l7_n956(x)
+    if (x < 1)
+        fun_l8_n653(x)
+    else
+        fun_l8_n847(x)
+    end
+end
+
+def fun_l7_n957(x)
+    if (x < 1)
+        fun_l8_n594(x)
+    else
+        fun_l8_n9(x)
+    end
+end
+
+def fun_l7_n958(x)
+    if (x < 1)
+        fun_l8_n818(x)
+    else
+        fun_l8_n912(x)
+    end
+end
+
+def fun_l7_n959(x)
+    if (x < 1)
+        fun_l8_n941(x)
+    else
+        fun_l8_n394(x)
+    end
+end
+
+def fun_l7_n960(x)
+    if (x < 1)
+        fun_l8_n151(x)
+    else
+        fun_l8_n426(x)
+    end
+end
+
+def fun_l7_n961(x)
+    if (x < 1)
+        fun_l8_n276(x)
+    else
+        fun_l8_n458(x)
+    end
+end
+
+def fun_l7_n962(x)
+    if (x < 1)
+        fun_l8_n310(x)
+    else
+        fun_l8_n472(x)
+    end
+end
+
+def fun_l7_n963(x)
+    if (x < 1)
+        fun_l8_n103(x)
+    else
+        fun_l8_n995(x)
+    end
+end
+
+def fun_l7_n964(x)
+    if (x < 1)
+        fun_l8_n808(x)
+    else
+        fun_l8_n41(x)
+    end
+end
+
+def fun_l7_n965(x)
+    if (x < 1)
+        fun_l8_n840(x)
+    else
+        fun_l8_n143(x)
+    end
+end
+
+def fun_l7_n966(x)
+    if (x < 1)
+        fun_l8_n855(x)
+    else
+        fun_l8_n38(x)
+    end
+end
+
+def fun_l7_n967(x)
+    if (x < 1)
+        fun_l8_n316(x)
+    else
+        fun_l8_n86(x)
+    end
+end
+
+def fun_l7_n968(x)
+    if (x < 1)
+        fun_l8_n856(x)
+    else
+        fun_l8_n182(x)
+    end
+end
+
+def fun_l7_n969(x)
+    if (x < 1)
+        fun_l8_n436(x)
+    else
+        fun_l8_n460(x)
+    end
+end
+
+def fun_l7_n970(x)
+    if (x < 1)
+        fun_l8_n187(x)
+    else
+        fun_l8_n90(x)
+    end
+end
+
+def fun_l7_n971(x)
+    if (x < 1)
+        fun_l8_n689(x)
+    else
+        fun_l8_n921(x)
+    end
+end
+
+def fun_l7_n972(x)
+    if (x < 1)
+        fun_l8_n207(x)
+    else
+        fun_l8_n79(x)
+    end
+end
+
+def fun_l7_n973(x)
+    if (x < 1)
+        fun_l8_n137(x)
+    else
+        fun_l8_n17(x)
+    end
+end
+
+def fun_l7_n974(x)
+    if (x < 1)
+        fun_l8_n813(x)
+    else
+        fun_l8_n944(x)
+    end
+end
+
+def fun_l7_n975(x)
+    if (x < 1)
+        fun_l8_n589(x)
+    else
+        fun_l8_n416(x)
+    end
+end
+
+def fun_l7_n976(x)
+    if (x < 1)
+        fun_l8_n763(x)
+    else
+        fun_l8_n289(x)
+    end
+end
+
+def fun_l7_n977(x)
+    if (x < 1)
+        fun_l8_n118(x)
+    else
+        fun_l8_n998(x)
+    end
+end
+
+def fun_l7_n978(x)
+    if (x < 1)
+        fun_l8_n382(x)
+    else
+        fun_l8_n216(x)
+    end
+end
+
+def fun_l7_n979(x)
+    if (x < 1)
+        fun_l8_n304(x)
+    else
+        fun_l8_n586(x)
+    end
+end
+
+def fun_l7_n980(x)
+    if (x < 1)
+        fun_l8_n693(x)
+    else
+        fun_l8_n118(x)
+    end
+end
+
+def fun_l7_n981(x)
+    if (x < 1)
+        fun_l8_n669(x)
+    else
+        fun_l8_n796(x)
+    end
+end
+
+def fun_l7_n982(x)
+    if (x < 1)
+        fun_l8_n187(x)
+    else
+        fun_l8_n143(x)
+    end
+end
+
+def fun_l7_n983(x)
+    if (x < 1)
+        fun_l8_n848(x)
+    else
+        fun_l8_n172(x)
+    end
+end
+
+def fun_l7_n984(x)
+    if (x < 1)
+        fun_l8_n782(x)
+    else
+        fun_l8_n670(x)
+    end
+end
+
+def fun_l7_n985(x)
+    if (x < 1)
+        fun_l8_n275(x)
+    else
+        fun_l8_n520(x)
+    end
+end
+
+def fun_l7_n986(x)
+    if (x < 1)
+        fun_l8_n841(x)
+    else
+        fun_l8_n446(x)
+    end
+end
+
+def fun_l7_n987(x)
+    if (x < 1)
+        fun_l8_n712(x)
+    else
+        fun_l8_n976(x)
+    end
+end
+
+def fun_l7_n988(x)
+    if (x < 1)
+        fun_l8_n115(x)
+    else
+        fun_l8_n222(x)
+    end
+end
+
+def fun_l7_n989(x)
+    if (x < 1)
+        fun_l8_n23(x)
+    else
+        fun_l8_n665(x)
+    end
+end
+
+def fun_l7_n990(x)
+    if (x < 1)
+        fun_l8_n416(x)
+    else
+        fun_l8_n455(x)
+    end
+end
+
+def fun_l7_n991(x)
+    if (x < 1)
+        fun_l8_n556(x)
+    else
+        fun_l8_n971(x)
+    end
+end
+
+def fun_l7_n992(x)
+    if (x < 1)
+        fun_l8_n726(x)
+    else
+        fun_l8_n312(x)
+    end
+end
+
+def fun_l7_n993(x)
+    if (x < 1)
+        fun_l8_n354(x)
+    else
+        fun_l8_n860(x)
+    end
+end
+
+def fun_l7_n994(x)
+    if (x < 1)
+        fun_l8_n62(x)
+    else
+        fun_l8_n290(x)
+    end
+end
+
+def fun_l7_n995(x)
+    if (x < 1)
+        fun_l8_n695(x)
+    else
+        fun_l8_n881(x)
+    end
+end
+
+def fun_l7_n996(x)
+    if (x < 1)
+        fun_l8_n938(x)
+    else
+        fun_l8_n566(x)
+    end
+end
+
+def fun_l7_n997(x)
+    if (x < 1)
+        fun_l8_n379(x)
+    else
+        fun_l8_n731(x)
+    end
+end
+
+def fun_l7_n998(x)
+    if (x < 1)
+        fun_l8_n320(x)
+    else
+        fun_l8_n339(x)
+    end
+end
+
+def fun_l7_n999(x)
+    if (x < 1)
+        fun_l8_n219(x)
+    else
+        fun_l8_n320(x)
+    end
+end
+
+def fun_l8_n0(x)
+    if (x < 1)
+        fun_l9_n590(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n1(x)
+    if (x < 1)
+        fun_l9_n301(x)
+    else
+        fun_l9_n457(x)
+    end
+end
+
+def fun_l8_n2(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n909(x)
+    end
+end
+
+def fun_l8_n3(x)
+    if (x < 1)
+        fun_l9_n485(x)
+    else
+        fun_l9_n603(x)
+    end
+end
+
+def fun_l8_n4(x)
+    if (x < 1)
+        fun_l9_n465(x)
+    else
+        fun_l9_n39(x)
+    end
+end
+
+def fun_l8_n5(x)
+    if (x < 1)
+        fun_l9_n861(x)
+    else
+        fun_l9_n153(x)
+    end
+end
+
+def fun_l8_n6(x)
+    if (x < 1)
+        fun_l9_n130(x)
+    else
+        fun_l9_n401(x)
+    end
+end
+
+def fun_l8_n7(x)
+    if (x < 1)
+        fun_l9_n726(x)
+    else
+        fun_l9_n248(x)
+    end
+end
+
+def fun_l8_n8(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n681(x)
+    end
+end
+
+def fun_l8_n9(x)
+    if (x < 1)
+        fun_l9_n862(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n10(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n373(x)
+    end
+end
+
+def fun_l8_n11(x)
+    if (x < 1)
+        fun_l9_n692(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n12(x)
+    if (x < 1)
+        fun_l9_n412(x)
+    else
+        fun_l9_n576(x)
+    end
+end
+
+def fun_l8_n13(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n14(x)
+    if (x < 1)
+        fun_l9_n986(x)
+    else
+        fun_l9_n99(x)
+    end
+end
+
+def fun_l8_n15(x)
+    if (x < 1)
+        fun_l9_n807(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n16(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n51(x)
+    end
+end
+
+def fun_l8_n17(x)
+    if (x < 1)
+        fun_l9_n193(x)
+    else
+        fun_l9_n673(x)
+    end
+end
+
+def fun_l8_n18(x)
+    if (x < 1)
+        fun_l9_n897(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n19(x)
+    if (x < 1)
+        fun_l9_n288(x)
+    else
+        fun_l9_n337(x)
+    end
+end
+
+def fun_l8_n20(x)
+    if (x < 1)
+        fun_l9_n754(x)
+    else
+        fun_l9_n581(x)
+    end
+end
+
+def fun_l8_n21(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n205(x)
+    end
+end
+
+def fun_l8_n22(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n428(x)
+    end
+end
+
+def fun_l8_n23(x)
+    if (x < 1)
+        fun_l9_n821(x)
+    else
+        fun_l9_n930(x)
+    end
+end
+
+def fun_l8_n24(x)
+    if (x < 1)
+        fun_l9_n237(x)
+    else
+        fun_l9_n681(x)
+    end
+end
+
+def fun_l8_n25(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n26(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n802(x)
+    end
+end
+
+def fun_l8_n27(x)
+    if (x < 1)
+        fun_l9_n4(x)
+    else
+        fun_l9_n288(x)
+    end
+end
+
+def fun_l8_n28(x)
+    if (x < 1)
+        fun_l9_n9(x)
+    else
+        fun_l9_n180(x)
+    end
+end
+
+def fun_l8_n29(x)
+    if (x < 1)
+        fun_l9_n585(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n30(x)
+    if (x < 1)
+        fun_l9_n954(x)
+    else
+        fun_l9_n603(x)
+    end
+end
+
+def fun_l8_n31(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n770(x)
+    end
+end
+
+def fun_l8_n32(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n243(x)
+    end
+end
+
+def fun_l8_n33(x)
+    if (x < 1)
+        fun_l9_n139(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n34(x)
+    if (x < 1)
+        fun_l9_n270(x)
+    else
+        fun_l9_n333(x)
+    end
+end
+
+def fun_l8_n35(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n38(x)
+    end
+end
+
+def fun_l8_n36(x)
+    if (x < 1)
+        fun_l9_n892(x)
+    else
+        fun_l9_n517(x)
+    end
+end
+
+def fun_l8_n37(x)
+    if (x < 1)
+        fun_l9_n599(x)
+    else
+        fun_l9_n692(x)
+    end
+end
+
+def fun_l8_n38(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n879(x)
+    end
+end
+
+def fun_l8_n39(x)
+    if (x < 1)
+        fun_l9_n835(x)
+    else
+        fun_l9_n134(x)
+    end
+end
+
+def fun_l8_n40(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n546(x)
+    end
+end
+
+def fun_l8_n41(x)
+    if (x < 1)
+        fun_l9_n214(x)
+    else
+        fun_l9_n652(x)
+    end
+end
+
+def fun_l8_n42(x)
+    if (x < 1)
+        fun_l9_n239(x)
+    else
+        fun_l9_n123(x)
+    end
+end
+
+def fun_l8_n43(x)
+    if (x < 1)
+        fun_l9_n763(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n44(x)
+    if (x < 1)
+        fun_l9_n449(x)
+    else
+        fun_l9_n343(x)
+    end
+end
+
+def fun_l8_n45(x)
+    if (x < 1)
+        fun_l9_n727(x)
+    else
+        fun_l9_n47(x)
+    end
+end
+
+def fun_l8_n46(x)
+    if (x < 1)
+        fun_l9_n684(x)
+    else
+        fun_l9_n711(x)
+    end
+end
+
+def fun_l8_n47(x)
+    if (x < 1)
+        fun_l9_n895(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n48(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n358(x)
+    end
+end
+
+def fun_l8_n49(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n411(x)
+    end
+end
+
+def fun_l8_n50(x)
+    if (x < 1)
+        fun_l9_n673(x)
+    else
+        fun_l9_n640(x)
+    end
+end
+
+def fun_l8_n51(x)
+    if (x < 1)
+        fun_l9_n9(x)
+    else
+        fun_l9_n690(x)
+    end
+end
+
+def fun_l8_n52(x)
+    if (x < 1)
+        fun_l9_n293(x)
+    else
+        fun_l9_n889(x)
+    end
+end
+
+def fun_l8_n53(x)
+    if (x < 1)
+        fun_l9_n141(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n54(x)
+    if (x < 1)
+        fun_l9_n982(x)
+    else
+        fun_l9_n955(x)
+    end
+end
+
+def fun_l8_n55(x)
+    if (x < 1)
+        fun_l9_n382(x)
+    else
+        fun_l9_n897(x)
+    end
+end
+
+def fun_l8_n56(x)
+    if (x < 1)
+        fun_l9_n332(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n57(x)
+    if (x < 1)
+        fun_l9_n46(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n58(x)
+    if (x < 1)
+        fun_l9_n556(x)
+    else
+        fun_l9_n0(x)
+    end
+end
+
+def fun_l8_n59(x)
+    if (x < 1)
+        fun_l9_n931(x)
+    else
+        fun_l9_n995(x)
+    end
+end
+
+def fun_l8_n60(x)
+    if (x < 1)
+        fun_l9_n470(x)
+    else
+        fun_l9_n679(x)
+    end
+end
+
+def fun_l8_n61(x)
+    if (x < 1)
+        fun_l9_n269(x)
+    else
+        fun_l9_n742(x)
+    end
+end
+
+def fun_l8_n62(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n556(x)
+    end
+end
+
+def fun_l8_n63(x)
+    if (x < 1)
+        fun_l9_n713(x)
+    else
+        fun_l9_n249(x)
+    end
+end
+
+def fun_l8_n64(x)
+    if (x < 1)
+        fun_l9_n842(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n65(x)
+    if (x < 1)
+        fun_l9_n708(x)
+    else
+        fun_l9_n3(x)
+    end
+end
+
+def fun_l8_n66(x)
+    if (x < 1)
+        fun_l9_n845(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n67(x)
+    if (x < 1)
+        fun_l9_n823(x)
+    else
+        fun_l9_n326(x)
+    end
+end
+
+def fun_l8_n68(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n888(x)
+    end
+end
+
+def fun_l8_n69(x)
+    if (x < 1)
+        fun_l9_n454(x)
+    else
+        fun_l9_n601(x)
+    end
+end
+
+def fun_l8_n70(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n482(x)
+    end
+end
+
+def fun_l8_n71(x)
+    if (x < 1)
+        fun_l9_n778(x)
+    else
+        fun_l9_n678(x)
+    end
+end
+
+def fun_l8_n72(x)
+    if (x < 1)
+        fun_l9_n715(x)
+    else
+        fun_l9_n851(x)
+    end
+end
+
+def fun_l8_n73(x)
+    if (x < 1)
+        fun_l9_n330(x)
+    else
+        fun_l9_n84(x)
+    end
+end
+
+def fun_l8_n74(x)
+    if (x < 1)
+        fun_l9_n524(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n75(x)
+    if (x < 1)
+        fun_l9_n610(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n76(x)
+    if (x < 1)
+        fun_l9_n964(x)
+    else
+        fun_l9_n893(x)
+    end
+end
+
+def fun_l8_n77(x)
+    if (x < 1)
+        fun_l9_n653(x)
+    else
+        fun_l9_n451(x)
+    end
+end
+
+def fun_l8_n78(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n29(x)
+    end
+end
+
+def fun_l8_n79(x)
+    if (x < 1)
+        fun_l9_n219(x)
+    else
+        fun_l9_n25(x)
+    end
+end
+
+def fun_l8_n80(x)
+    if (x < 1)
+        fun_l9_n471(x)
+    else
+        fun_l9_n217(x)
+    end
+end
+
+def fun_l8_n81(x)
+    if (x < 1)
+        fun_l9_n339(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n82(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n501(x)
+    end
+end
+
+def fun_l8_n83(x)
+    if (x < 1)
+        fun_l9_n23(x)
+    else
+        fun_l9_n252(x)
+    end
+end
+
+def fun_l8_n84(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n514(x)
+    end
+end
+
+def fun_l8_n85(x)
+    if (x < 1)
+        fun_l9_n22(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n86(x)
+    if (x < 1)
+        fun_l9_n553(x)
+    else
+        fun_l9_n788(x)
+    end
+end
+
+def fun_l8_n87(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n945(x)
+    end
+end
+
+def fun_l8_n88(x)
+    if (x < 1)
+        fun_l9_n886(x)
+    else
+        fun_l9_n438(x)
+    end
+end
+
+def fun_l8_n89(x)
+    if (x < 1)
+        fun_l9_n821(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n90(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n39(x)
+    end
+end
+
+def fun_l8_n91(x)
+    if (x < 1)
+        fun_l9_n135(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n92(x)
+    if (x < 1)
+        fun_l9_n225(x)
+    else
+        fun_l9_n125(x)
+    end
+end
+
+def fun_l8_n93(x)
+    if (x < 1)
+        fun_l9_n201(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n94(x)
+    if (x < 1)
+        fun_l9_n30(x)
+    else
+        fun_l9_n938(x)
+    end
+end
+
+def fun_l8_n95(x)
+    if (x < 1)
+        fun_l9_n987(x)
+    else
+        fun_l9_n141(x)
+    end
+end
+
+def fun_l8_n96(x)
+    if (x < 1)
+        fun_l9_n968(x)
+    else
+        fun_l9_n999(x)
+    end
+end
+
+def fun_l8_n97(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n927(x)
+    end
+end
+
+def fun_l8_n98(x)
+    if (x < 1)
+        fun_l9_n720(x)
+    else
+        fun_l9_n717(x)
+    end
+end
+
+def fun_l8_n99(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n100(x)
+    if (x < 1)
+        fun_l9_n973(x)
+    else
+        fun_l9_n379(x)
+    end
+end
+
+def fun_l8_n101(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n530(x)
+    end
+end
+
+def fun_l8_n102(x)
+    if (x < 1)
+        fun_l9_n411(x)
+    else
+        fun_l9_n560(x)
+    end
+end
+
+def fun_l8_n103(x)
+    if (x < 1)
+        fun_l9_n54(x)
+    else
+        fun_l9_n813(x)
+    end
+end
+
+def fun_l8_n104(x)
+    if (x < 1)
+        fun_l9_n217(x)
+    else
+        fun_l9_n455(x)
+    end
+end
+
+def fun_l8_n105(x)
+    if (x < 1)
+        fun_l9_n667(x)
+    else
+        fun_l9_n92(x)
+    end
+end
+
+def fun_l8_n106(x)
+    if (x < 1)
+        fun_l9_n933(x)
+    else
+        fun_l9_n727(x)
+    end
+end
+
+def fun_l8_n107(x)
+    if (x < 1)
+        fun_l9_n578(x)
+    else
+        fun_l9_n350(x)
+    end
+end
+
+def fun_l8_n108(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n439(x)
+    end
+end
+
+def fun_l8_n109(x)
+    if (x < 1)
+        fun_l9_n21(x)
+    else
+        fun_l9_n112(x)
+    end
+end
+
+def fun_l8_n110(x)
+    if (x < 1)
+        fun_l9_n57(x)
+    else
+        fun_l9_n553(x)
+    end
+end
+
+def fun_l8_n111(x)
+    if (x < 1)
+        fun_l9_n347(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n112(x)
+    if (x < 1)
+        fun_l9_n837(x)
+    else
+        fun_l9_n793(x)
+    end
+end
+
+def fun_l8_n113(x)
+    if (x < 1)
+        fun_l9_n517(x)
+    else
+        fun_l9_n668(x)
+    end
+end
+
+def fun_l8_n114(x)
+    if (x < 1)
+        fun_l9_n486(x)
+    else
+        fun_l9_n872(x)
+    end
+end
+
+def fun_l8_n115(x)
+    if (x < 1)
+        fun_l9_n454(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n116(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n263(x)
+    end
+end
+
+def fun_l8_n117(x)
+    if (x < 1)
+        fun_l9_n878(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n118(x)
+    if (x < 1)
+        fun_l9_n564(x)
+    else
+        fun_l9_n409(x)
+    end
+end
+
+def fun_l8_n119(x)
+    if (x < 1)
+        fun_l9_n511(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n120(x)
+    if (x < 1)
+        fun_l9_n501(x)
+    else
+        fun_l9_n305(x)
+    end
+end
+
+def fun_l8_n121(x)
+    if (x < 1)
+        fun_l9_n630(x)
+    else
+        fun_l9_n319(x)
+    end
+end
+
+def fun_l8_n122(x)
+    if (x < 1)
+        fun_l9_n271(x)
+    else
+        fun_l9_n639(x)
+    end
+end
+
+def fun_l8_n123(x)
+    if (x < 1)
+        fun_l9_n812(x)
+    else
+        fun_l9_n735(x)
+    end
+end
+
+def fun_l8_n124(x)
+    if (x < 1)
+        fun_l9_n828(x)
+    else
+        fun_l9_n203(x)
+    end
+end
+
+def fun_l8_n125(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n536(x)
+    end
+end
+
+def fun_l8_n126(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n127(x)
+    if (x < 1)
+        fun_l9_n19(x)
+    else
+        fun_l9_n324(x)
+    end
+end
+
+def fun_l8_n128(x)
+    if (x < 1)
+        fun_l9_n419(x)
+    else
+        fun_l9_n425(x)
+    end
+end
+
+def fun_l8_n129(x)
+    if (x < 1)
+        fun_l9_n384(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n130(x)
+    if (x < 1)
+        fun_l9_n956(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n131(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n132(x)
+    if (x < 1)
+        fun_l9_n317(x)
+    else
+        fun_l9_n909(x)
+    end
+end
+
+def fun_l8_n133(x)
+    if (x < 1)
+        fun_l9_n131(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n134(x)
+    if (x < 1)
+        fun_l9_n648(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n135(x)
+    if (x < 1)
+        fun_l9_n837(x)
+    else
+        fun_l9_n89(x)
+    end
+end
+
+def fun_l8_n136(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n394(x)
+    end
+end
+
+def fun_l8_n137(x)
+    if (x < 1)
+        fun_l9_n608(x)
+    else
+        fun_l9_n283(x)
+    end
+end
+
+def fun_l8_n138(x)
+    if (x < 1)
+        fun_l9_n728(x)
+    else
+        fun_l9_n586(x)
+    end
+end
+
+def fun_l8_n139(x)
+    if (x < 1)
+        fun_l9_n689(x)
+    else
+        fun_l9_n700(x)
+    end
+end
+
+def fun_l8_n140(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n98(x)
+    end
+end
+
+def fun_l8_n141(x)
+    if (x < 1)
+        fun_l9_n696(x)
+    else
+        fun_l9_n951(x)
+    end
+end
+
+def fun_l8_n142(x)
+    if (x < 1)
+        fun_l9_n28(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n143(x)
+    if (x < 1)
+        fun_l9_n438(x)
+    else
+        fun_l9_n934(x)
+    end
+end
+
+def fun_l8_n144(x)
+    if (x < 1)
+        fun_l9_n738(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n145(x)
+    if (x < 1)
+        fun_l9_n201(x)
+    else
+        fun_l9_n634(x)
+    end
+end
+
+def fun_l8_n146(x)
+    if (x < 1)
+        fun_l9_n391(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n147(x)
+    if (x < 1)
+        fun_l9_n740(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n148(x)
+    if (x < 1)
+        fun_l9_n303(x)
+    else
+        fun_l9_n162(x)
+    end
+end
+
+def fun_l8_n149(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n899(x)
+    end
+end
+
+def fun_l8_n150(x)
+    if (x < 1)
+        fun_l9_n847(x)
+    else
+        fun_l9_n840(x)
+    end
+end
+
+def fun_l8_n151(x)
+    if (x < 1)
+        fun_l9_n567(x)
+    else
+        fun_l9_n29(x)
+    end
+end
+
+def fun_l8_n152(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n578(x)
+    end
+end
+
+def fun_l8_n153(x)
+    if (x < 1)
+        fun_l9_n617(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n154(x)
+    if (x < 1)
+        fun_l9_n673(x)
+    else
+        fun_l9_n663(x)
+    end
+end
+
+def fun_l8_n155(x)
+    if (x < 1)
+        fun_l9_n456(x)
+    else
+        fun_l9_n406(x)
+    end
+end
+
+def fun_l8_n156(x)
+    if (x < 1)
+        fun_l9_n297(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n157(x)
+    if (x < 1)
+        fun_l9_n300(x)
+    else
+        fun_l9_n179(x)
+    end
+end
+
+def fun_l8_n158(x)
+    if (x < 1)
+        fun_l9_n646(x)
+    else
+        fun_l9_n9(x)
+    end
+end
+
+def fun_l8_n159(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n228(x)
+    end
+end
+
+def fun_l8_n160(x)
+    if (x < 1)
+        fun_l9_n814(x)
+    else
+        fun_l9_n775(x)
+    end
+end
+
+def fun_l8_n161(x)
+    if (x < 1)
+        fun_l9_n748(x)
+    else
+        fun_l9_n849(x)
+    end
+end
+
+def fun_l8_n162(x)
+    if (x < 1)
+        fun_l9_n209(x)
+    else
+        fun_l9_n273(x)
+    end
+end
+
+def fun_l8_n163(x)
+    if (x < 1)
+        fun_l9_n116(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n164(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n621(x)
+    end
+end
+
+def fun_l8_n165(x)
+    if (x < 1)
+        fun_l9_n619(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n166(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n745(x)
+    end
+end
+
+def fun_l8_n167(x)
+    if (x < 1)
+        fun_l9_n12(x)
+    else
+        fun_l9_n633(x)
+    end
+end
+
+def fun_l8_n168(x)
+    if (x < 1)
+        fun_l9_n619(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n169(x)
+    if (x < 1)
+        fun_l9_n685(x)
+    else
+        fun_l9_n107(x)
+    end
+end
+
+def fun_l8_n170(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n280(x)
+    end
+end
+
+def fun_l8_n171(x)
+    if (x < 1)
+        fun_l9_n254(x)
+    else
+        fun_l9_n742(x)
+    end
+end
+
+def fun_l8_n172(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n632(x)
+    end
+end
+
+def fun_l8_n173(x)
+    if (x < 1)
+        fun_l9_n341(x)
+    else
+        fun_l9_n186(x)
+    end
+end
+
+def fun_l8_n174(x)
+    if (x < 1)
+        fun_l9_n903(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n175(x)
+    if (x < 1)
+        fun_l9_n416(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n176(x)
+    if (x < 1)
+        fun_l9_n893(x)
+    else
+        fun_l9_n438(x)
+    end
+end
+
+def fun_l8_n177(x)
+    if (x < 1)
+        fun_l9_n551(x)
+    else
+        fun_l9_n312(x)
+    end
+end
+
+def fun_l8_n178(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n179(x)
+    if (x < 1)
+        fun_l9_n547(x)
+    else
+        fun_l9_n804(x)
+    end
+end
+
+def fun_l8_n180(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n246(x)
+    end
+end
+
+def fun_l8_n181(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n345(x)
+    end
+end
+
+def fun_l8_n182(x)
+    if (x < 1)
+        fun_l9_n958(x)
+    else
+        fun_l9_n923(x)
+    end
+end
+
+def fun_l8_n183(x)
+    if (x < 1)
+        fun_l9_n418(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n184(x)
+    if (x < 1)
+        fun_l9_n372(x)
+    else
+        fun_l9_n808(x)
+    end
+end
+
+def fun_l8_n185(x)
+    if (x < 1)
+        fun_l9_n849(x)
+    else
+        fun_l9_n755(x)
+    end
+end
+
+def fun_l8_n186(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n73(x)
+    end
+end
+
+def fun_l8_n187(x)
+    if (x < 1)
+        fun_l9_n729(x)
+    else
+        fun_l9_n295(x)
+    end
+end
+
+def fun_l8_n188(x)
+    if (x < 1)
+        fun_l9_n782(x)
+    else
+        fun_l9_n117(x)
+    end
+end
+
+def fun_l8_n189(x)
+    if (x < 1)
+        fun_l9_n947(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n190(x)
+    if (x < 1)
+        fun_l9_n989(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n191(x)
+    if (x < 1)
+        fun_l9_n394(x)
+    else
+        fun_l9_n741(x)
+    end
+end
+
+def fun_l8_n192(x)
+    if (x < 1)
+        fun_l9_n582(x)
+    else
+        fun_l9_n333(x)
+    end
+end
+
+def fun_l8_n193(x)
+    if (x < 1)
+        fun_l9_n73(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n194(x)
+    if (x < 1)
+        fun_l9_n946(x)
+    else
+        fun_l9_n354(x)
+    end
+end
+
+def fun_l8_n195(x)
+    if (x < 1)
+        fun_l9_n383(x)
+    else
+        fun_l9_n863(x)
+    end
+end
+
+def fun_l8_n196(x)
+    if (x < 1)
+        fun_l9_n441(x)
+    else
+        fun_l9_n947(x)
+    end
+end
+
+def fun_l8_n197(x)
+    if (x < 1)
+        fun_l9_n506(x)
+    else
+        fun_l9_n45(x)
+    end
+end
+
+def fun_l8_n198(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n341(x)
+    end
+end
+
+def fun_l8_n199(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n56(x)
+    end
+end
+
+def fun_l8_n200(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n280(x)
+    end
+end
+
+def fun_l8_n201(x)
+    if (x < 1)
+        fun_l9_n364(x)
+    else
+        fun_l9_n424(x)
+    end
+end
+
+def fun_l8_n202(x)
+    if (x < 1)
+        fun_l9_n923(x)
+    else
+        fun_l9_n326(x)
+    end
+end
+
+def fun_l8_n203(x)
+    if (x < 1)
+        fun_l9_n692(x)
+    else
+        fun_l9_n502(x)
+    end
+end
+
+def fun_l8_n204(x)
+    if (x < 1)
+        fun_l9_n508(x)
+    else
+        fun_l9_n561(x)
+    end
+end
+
+def fun_l8_n205(x)
+    if (x < 1)
+        fun_l9_n496(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n206(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n447(x)
+    end
+end
+
+def fun_l8_n207(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n782(x)
+    end
+end
+
+def fun_l8_n208(x)
+    if (x < 1)
+        fun_l9_n505(x)
+    else
+        fun_l9_n32(x)
+    end
+end
+
+def fun_l8_n209(x)
+    if (x < 1)
+        fun_l9_n591(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n210(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n211(x)
+    if (x < 1)
+        fun_l9_n19(x)
+    else
+        fun_l9_n362(x)
+    end
+end
+
+def fun_l8_n212(x)
+    if (x < 1)
+        fun_l9_n759(x)
+    else
+        fun_l9_n835(x)
+    end
+end
+
+def fun_l8_n213(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n294(x)
+    end
+end
+
+def fun_l8_n214(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n687(x)
+    end
+end
+
+def fun_l8_n215(x)
+    if (x < 1)
+        fun_l9_n114(x)
+    else
+        fun_l9_n130(x)
+    end
+end
+
+def fun_l8_n216(x)
+    if (x < 1)
+        fun_l9_n829(x)
+    else
+        fun_l9_n8(x)
+    end
+end
+
+def fun_l8_n217(x)
+    if (x < 1)
+        fun_l9_n875(x)
+    else
+        fun_l9_n392(x)
+    end
+end
+
+def fun_l8_n218(x)
+    if (x < 1)
+        fun_l9_n13(x)
+    else
+        fun_l9_n907(x)
+    end
+end
+
+def fun_l8_n219(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n77(x)
+    end
+end
+
+def fun_l8_n220(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n12(x)
+    end
+end
+
+def fun_l8_n221(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n231(x)
+    end
+end
+
+def fun_l8_n222(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n458(x)
+    end
+end
+
+def fun_l8_n223(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n44(x)
+    end
+end
+
+def fun_l8_n224(x)
+    if (x < 1)
+        fun_l9_n651(x)
+    else
+        fun_l9_n836(x)
+    end
+end
+
+def fun_l8_n225(x)
+    if (x < 1)
+        fun_l9_n518(x)
+    else
+        fun_l9_n845(x)
+    end
+end
+
+def fun_l8_n226(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n637(x)
+    end
+end
+
+def fun_l8_n227(x)
+    if (x < 1)
+        fun_l9_n990(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n228(x)
+    if (x < 1)
+        fun_l9_n465(x)
+    else
+        fun_l9_n764(x)
+    end
+end
+
+def fun_l8_n229(x)
+    if (x < 1)
+        fun_l9_n7(x)
+    else
+        fun_l9_n981(x)
+    end
+end
+
+def fun_l8_n230(x)
+    if (x < 1)
+        fun_l9_n250(x)
+    else
+        fun_l9_n690(x)
+    end
+end
+
+def fun_l8_n231(x)
+    if (x < 1)
+        fun_l9_n101(x)
+    else
+        fun_l9_n342(x)
+    end
+end
+
+def fun_l8_n232(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n216(x)
+    end
+end
+
+def fun_l8_n233(x)
+    if (x < 1)
+        fun_l9_n129(x)
+    else
+        fun_l9_n439(x)
+    end
+end
+
+def fun_l8_n234(x)
+    if (x < 1)
+        fun_l9_n616(x)
+    else
+        fun_l9_n700(x)
+    end
+end
+
+def fun_l8_n235(x)
+    if (x < 1)
+        fun_l9_n850(x)
+    else
+        fun_l9_n254(x)
+    end
+end
+
+def fun_l8_n236(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n237(x)
+    if (x < 1)
+        fun_l9_n895(x)
+    else
+        fun_l9_n752(x)
+    end
+end
+
+def fun_l8_n238(x)
+    if (x < 1)
+        fun_l9_n496(x)
+    else
+        fun_l9_n784(x)
+    end
+end
+
+def fun_l8_n239(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n144(x)
+    end
+end
+
+def fun_l8_n240(x)
+    if (x < 1)
+        fun_l9_n805(x)
+    else
+        fun_l9_n851(x)
+    end
+end
+
+def fun_l8_n241(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n332(x)
+    end
+end
+
+def fun_l8_n242(x)
+    if (x < 1)
+        fun_l9_n898(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n243(x)
+    if (x < 1)
+        fun_l9_n729(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n244(x)
+    if (x < 1)
+        fun_l9_n881(x)
+    else
+        fun_l9_n356(x)
+    end
+end
+
+def fun_l8_n245(x)
+    if (x < 1)
+        fun_l9_n351(x)
+    else
+        fun_l9_n805(x)
+    end
+end
+
+def fun_l8_n246(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n200(x)
+    end
+end
+
+def fun_l8_n247(x)
+    if (x < 1)
+        fun_l9_n706(x)
+    else
+        fun_l9_n917(x)
+    end
+end
+
+def fun_l8_n248(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n755(x)
+    end
+end
+
+def fun_l8_n249(x)
+    if (x < 1)
+        fun_l9_n859(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n250(x)
+    if (x < 1)
+        fun_l9_n443(x)
+    else
+        fun_l9_n113(x)
+    end
+end
+
+def fun_l8_n251(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n195(x)
+    end
+end
+
+def fun_l8_n252(x)
+    if (x < 1)
+        fun_l9_n357(x)
+    else
+        fun_l9_n694(x)
+    end
+end
+
+def fun_l8_n253(x)
+    if (x < 1)
+        fun_l9_n387(x)
+    else
+        fun_l9_n820(x)
+    end
+end
+
+def fun_l8_n254(x)
+    if (x < 1)
+        fun_l9_n909(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n255(x)
+    if (x < 1)
+        fun_l9_n474(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n256(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n257(x)
+    if (x < 1)
+        fun_l9_n915(x)
+    else
+        fun_l9_n177(x)
+    end
+end
+
+def fun_l8_n258(x)
+    if (x < 1)
+        fun_l9_n917(x)
+    else
+        fun_l9_n210(x)
+    end
+end
+
+def fun_l8_n259(x)
+    if (x < 1)
+        fun_l9_n851(x)
+    else
+        fun_l9_n342(x)
+    end
+end
+
+def fun_l8_n260(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n412(x)
+    end
+end
+
+def fun_l8_n261(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n62(x)
+    end
+end
+
+def fun_l8_n262(x)
+    if (x < 1)
+        fun_l9_n706(x)
+    else
+        fun_l9_n903(x)
+    end
+end
+
+def fun_l8_n263(x)
+    if (x < 1)
+        fun_l9_n403(x)
+    else
+        fun_l9_n994(x)
+    end
+end
+
+def fun_l8_n264(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n126(x)
+    end
+end
+
+def fun_l8_n265(x)
+    if (x < 1)
+        fun_l9_n216(x)
+    else
+        fun_l9_n573(x)
+    end
+end
+
+def fun_l8_n266(x)
+    if (x < 1)
+        fun_l9_n174(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n267(x)
+    if (x < 1)
+        fun_l9_n802(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n268(x)
+    if (x < 1)
+        fun_l9_n148(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n269(x)
+    if (x < 1)
+        fun_l9_n675(x)
+    else
+        fun_l9_n596(x)
+    end
+end
+
+def fun_l8_n270(x)
+    if (x < 1)
+        fun_l9_n306(x)
+    else
+        fun_l9_n413(x)
+    end
+end
+
+def fun_l8_n271(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n272(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n273(x)
+    if (x < 1)
+        fun_l9_n516(x)
+    else
+        fun_l9_n172(x)
+    end
+end
+
+def fun_l8_n274(x)
+    if (x < 1)
+        fun_l9_n641(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n275(x)
+    if (x < 1)
+        fun_l9_n258(x)
+    else
+        fun_l9_n773(x)
+    end
+end
+
+def fun_l8_n276(x)
+    if (x < 1)
+        fun_l9_n233(x)
+    else
+        fun_l9_n222(x)
+    end
+end
+
+def fun_l8_n277(x)
+    if (x < 1)
+        fun_l9_n615(x)
+    else
+        fun_l9_n598(x)
+    end
+end
+
+def fun_l8_n278(x)
+    if (x < 1)
+        fun_l9_n126(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n279(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n78(x)
+    end
+end
+
+def fun_l8_n280(x)
+    if (x < 1)
+        fun_l9_n731(x)
+    else
+        fun_l9_n114(x)
+    end
+end
+
+def fun_l8_n281(x)
+    if (x < 1)
+        fun_l9_n513(x)
+    else
+        fun_l9_n69(x)
+    end
+end
+
+def fun_l8_n282(x)
+    if (x < 1)
+        fun_l9_n208(x)
+    else
+        fun_l9_n466(x)
+    end
+end
+
+def fun_l8_n283(x)
+    if (x < 1)
+        fun_l9_n958(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n284(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n619(x)
+    end
+end
+
+def fun_l8_n285(x)
+    if (x < 1)
+        fun_l9_n698(x)
+    else
+        fun_l9_n97(x)
+    end
+end
+
+def fun_l8_n286(x)
+    if (x < 1)
+        fun_l9_n544(x)
+    else
+        fun_l9_n791(x)
+    end
+end
+
+def fun_l8_n287(x)
+    if (x < 1)
+        fun_l9_n51(x)
+    else
+        fun_l9_n415(x)
+    end
+end
+
+def fun_l8_n288(x)
+    if (x < 1)
+        fun_l9_n942(x)
+    else
+        fun_l9_n11(x)
+    end
+end
+
+def fun_l8_n289(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n290(x)
+    if (x < 1)
+        fun_l9_n983(x)
+    else
+        fun_l9_n81(x)
+    end
+end
+
+def fun_l8_n291(x)
+    if (x < 1)
+        fun_l9_n403(x)
+    else
+        fun_l9_n628(x)
+    end
+end
+
+def fun_l8_n292(x)
+    if (x < 1)
+        fun_l9_n479(x)
+    else
+        fun_l9_n379(x)
+    end
+end
+
+def fun_l8_n293(x)
+    if (x < 1)
+        fun_l9_n284(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n294(x)
+    if (x < 1)
+        fun_l9_n29(x)
+    else
+        fun_l9_n802(x)
+    end
+end
+
+def fun_l8_n295(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n371(x)
+    end
+end
+
+def fun_l8_n296(x)
+    if (x < 1)
+        fun_l9_n96(x)
+    else
+        fun_l9_n632(x)
+    end
+end
+
+def fun_l8_n297(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n298(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n804(x)
+    end
+end
+
+def fun_l8_n299(x)
+    if (x < 1)
+        fun_l9_n561(x)
+    else
+        fun_l9_n952(x)
+    end
+end
+
+def fun_l8_n300(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n819(x)
+    end
+end
+
+def fun_l8_n301(x)
+    if (x < 1)
+        fun_l9_n97(x)
+    else
+        fun_l9_n892(x)
+    end
+end
+
+def fun_l8_n302(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n765(x)
+    end
+end
+
+def fun_l8_n303(x)
+    if (x < 1)
+        fun_l9_n166(x)
+    else
+        fun_l9_n769(x)
+    end
+end
+
+def fun_l8_n304(x)
+    if (x < 1)
+        fun_l9_n592(x)
+    else
+        fun_l9_n423(x)
+    end
+end
+
+def fun_l8_n305(x)
+    if (x < 1)
+        fun_l9_n354(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n306(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n18(x)
+    end
+end
+
+def fun_l8_n307(x)
+    if (x < 1)
+        fun_l9_n445(x)
+    else
+        fun_l9_n796(x)
+    end
+end
+
+def fun_l8_n308(x)
+    if (x < 1)
+        fun_l9_n293(x)
+    else
+        fun_l9_n304(x)
+    end
+end
+
+def fun_l8_n309(x)
+    if (x < 1)
+        fun_l9_n859(x)
+    else
+        fun_l9_n282(x)
+    end
+end
+
+def fun_l8_n310(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n90(x)
+    end
+end
+
+def fun_l8_n311(x)
+    if (x < 1)
+        fun_l9_n997(x)
+    else
+        fun_l9_n201(x)
+    end
+end
+
+def fun_l8_n312(x)
+    if (x < 1)
+        fun_l9_n140(x)
+    else
+        fun_l9_n772(x)
+    end
+end
+
+def fun_l8_n313(x)
+    if (x < 1)
+        fun_l9_n761(x)
+    else
+        fun_l9_n980(x)
+    end
+end
+
+def fun_l8_n314(x)
+    if (x < 1)
+        fun_l9_n357(x)
+    else
+        fun_l9_n552(x)
+    end
+end
+
+def fun_l8_n315(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n412(x)
+    end
+end
+
+def fun_l8_n316(x)
+    if (x < 1)
+        fun_l9_n700(x)
+    else
+        fun_l9_n551(x)
+    end
+end
+
+def fun_l8_n317(x)
+    if (x < 1)
+        fun_l9_n623(x)
+    else
+        fun_l9_n219(x)
+    end
+end
+
+def fun_l8_n318(x)
+    if (x < 1)
+        fun_l9_n613(x)
+    else
+        fun_l9_n959(x)
+    end
+end
+
+def fun_l8_n319(x)
+    if (x < 1)
+        fun_l9_n978(x)
+    else
+        fun_l9_n596(x)
+    end
+end
+
+def fun_l8_n320(x)
+    if (x < 1)
+        fun_l9_n542(x)
+    else
+        fun_l9_n527(x)
+    end
+end
+
+def fun_l8_n321(x)
+    if (x < 1)
+        fun_l9_n877(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n322(x)
+    if (x < 1)
+        fun_l9_n817(x)
+    else
+        fun_l9_n476(x)
+    end
+end
+
+def fun_l8_n323(x)
+    if (x < 1)
+        fun_l9_n765(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n324(x)
+    if (x < 1)
+        fun_l9_n863(x)
+    else
+        fun_l9_n605(x)
+    end
+end
+
+def fun_l8_n325(x)
+    if (x < 1)
+        fun_l9_n566(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n326(x)
+    if (x < 1)
+        fun_l9_n607(x)
+    else
+        fun_l9_n968(x)
+    end
+end
+
+def fun_l8_n327(x)
+    if (x < 1)
+        fun_l9_n36(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n328(x)
+    if (x < 1)
+        fun_l9_n597(x)
+    else
+        fun_l9_n664(x)
+    end
+end
+
+def fun_l8_n329(x)
+    if (x < 1)
+        fun_l9_n195(x)
+    else
+        fun_l9_n268(x)
+    end
+end
+
+def fun_l8_n330(x)
+    if (x < 1)
+        fun_l9_n419(x)
+    else
+        fun_l9_n715(x)
+    end
+end
+
+def fun_l8_n331(x)
+    if (x < 1)
+        fun_l9_n451(x)
+    else
+        fun_l9_n518(x)
+    end
+end
+
+def fun_l8_n332(x)
+    if (x < 1)
+        fun_l9_n106(x)
+    else
+        fun_l9_n236(x)
+    end
+end
+
+def fun_l8_n333(x)
+    if (x < 1)
+        fun_l9_n611(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n334(x)
+    if (x < 1)
+        fun_l9_n394(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n335(x)
+    if (x < 1)
+        fun_l9_n63(x)
+    else
+        fun_l9_n58(x)
+    end
+end
+
+def fun_l8_n336(x)
+    if (x < 1)
+        fun_l9_n475(x)
+    else
+        fun_l9_n455(x)
+    end
+end
+
+def fun_l8_n337(x)
+    if (x < 1)
+        fun_l9_n836(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n338(x)
+    if (x < 1)
+        fun_l9_n844(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n339(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n721(x)
+    end
+end
+
+def fun_l8_n340(x)
+    if (x < 1)
+        fun_l9_n966(x)
+    else
+        fun_l9_n833(x)
+    end
+end
+
+def fun_l8_n341(x)
+    if (x < 1)
+        fun_l9_n267(x)
+    else
+        fun_l9_n28(x)
+    end
+end
+
+def fun_l8_n342(x)
+    if (x < 1)
+        fun_l9_n204(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n343(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n382(x)
+    end
+end
+
+def fun_l8_n344(x)
+    if (x < 1)
+        fun_l9_n409(x)
+    else
+        fun_l9_n591(x)
+    end
+end
+
+def fun_l8_n345(x)
+    if (x < 1)
+        fun_l9_n680(x)
+    else
+        fun_l9_n912(x)
+    end
+end
+
+def fun_l8_n346(x)
+    if (x < 1)
+        fun_l9_n150(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n347(x)
+    if (x < 1)
+        fun_l9_n538(x)
+    else
+        fun_l9_n441(x)
+    end
+end
+
+def fun_l8_n348(x)
+    if (x < 1)
+        fun_l9_n707(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n349(x)
+    if (x < 1)
+        fun_l9_n245(x)
+    else
+        fun_l9_n809(x)
+    end
+end
+
+def fun_l8_n350(x)
+    if (x < 1)
+        fun_l9_n16(x)
+    else
+        fun_l9_n565(x)
+    end
+end
+
+def fun_l8_n351(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n37(x)
+    end
+end
+
+def fun_l8_n352(x)
+    if (x < 1)
+        fun_l9_n816(x)
+    else
+        fun_l9_n941(x)
+    end
+end
+
+def fun_l8_n353(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n476(x)
+    end
+end
+
+def fun_l8_n354(x)
+    if (x < 1)
+        fun_l9_n641(x)
+    else
+        fun_l9_n319(x)
+    end
+end
+
+def fun_l8_n355(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n676(x)
+    end
+end
+
+def fun_l8_n356(x)
+    if (x < 1)
+        fun_l9_n826(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n357(x)
+    if (x < 1)
+        fun_l9_n17(x)
+    else
+        fun_l9_n486(x)
+    end
+end
+
+def fun_l8_n358(x)
+    if (x < 1)
+        fun_l9_n90(x)
+    else
+        fun_l9_n744(x)
+    end
+end
+
+def fun_l8_n359(x)
+    if (x < 1)
+        fun_l9_n745(x)
+    else
+        fun_l9_n158(x)
+    end
+end
+
+def fun_l8_n360(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n878(x)
+    end
+end
+
+def fun_l8_n361(x)
+    if (x < 1)
+        fun_l9_n832(x)
+    else
+        fun_l9_n905(x)
+    end
+end
+
+def fun_l8_n362(x)
+    if (x < 1)
+        fun_l9_n879(x)
+    else
+        fun_l9_n475(x)
+    end
+end
+
+def fun_l8_n363(x)
+    if (x < 1)
+        fun_l9_n586(x)
+    else
+        fun_l9_n272(x)
+    end
+end
+
+def fun_l8_n364(x)
+    if (x < 1)
+        fun_l9_n469(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n365(x)
+    if (x < 1)
+        fun_l9_n568(x)
+    else
+        fun_l9_n777(x)
+    end
+end
+
+def fun_l8_n366(x)
+    if (x < 1)
+        fun_l9_n662(x)
+    else
+        fun_l9_n957(x)
+    end
+end
+
+def fun_l8_n367(x)
+    if (x < 1)
+        fun_l9_n26(x)
+    else
+        fun_l9_n593(x)
+    end
+end
+
+def fun_l8_n368(x)
+    if (x < 1)
+        fun_l9_n766(x)
+    else
+        fun_l9_n598(x)
+    end
+end
+
+def fun_l8_n369(x)
+    if (x < 1)
+        fun_l9_n362(x)
+    else
+        fun_l9_n491(x)
+    end
+end
+
+def fun_l8_n370(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n585(x)
+    end
+end
+
+def fun_l8_n371(x)
+    if (x < 1)
+        fun_l9_n301(x)
+    else
+        fun_l9_n796(x)
+    end
+end
+
+def fun_l8_n372(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n31(x)
+    end
+end
+
+def fun_l8_n373(x)
+    if (x < 1)
+        fun_l9_n461(x)
+    else
+        fun_l9_n42(x)
+    end
+end
+
+def fun_l8_n374(x)
+    if (x < 1)
+        fun_l9_n288(x)
+    else
+        fun_l9_n534(x)
+    end
+end
+
+def fun_l8_n375(x)
+    if (x < 1)
+        fun_l9_n558(x)
+    else
+        fun_l9_n403(x)
+    end
+end
+
+def fun_l8_n376(x)
+    if (x < 1)
+        fun_l9_n835(x)
+    else
+        fun_l9_n390(x)
+    end
+end
+
+def fun_l8_n377(x)
+    if (x < 1)
+        fun_l9_n658(x)
+    else
+        fun_l9_n768(x)
+    end
+end
+
+def fun_l8_n378(x)
+    if (x < 1)
+        fun_l9_n856(x)
+    else
+        fun_l9_n299(x)
+    end
+end
+
+def fun_l8_n379(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n540(x)
+    end
+end
+
+def fun_l8_n380(x)
+    if (x < 1)
+        fun_l9_n70(x)
+    else
+        fun_l9_n627(x)
+    end
+end
+
+def fun_l8_n381(x)
+    if (x < 1)
+        fun_l9_n28(x)
+    else
+        fun_l9_n377(x)
+    end
+end
+
+def fun_l8_n382(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n124(x)
+    end
+end
+
+def fun_l8_n383(x)
+    if (x < 1)
+        fun_l9_n16(x)
+    else
+        fun_l9_n783(x)
+    end
+end
+
+def fun_l8_n384(x)
+    if (x < 1)
+        fun_l9_n843(x)
+    else
+        fun_l9_n801(x)
+    end
+end
+
+def fun_l8_n385(x)
+    if (x < 1)
+        fun_l9_n876(x)
+    else
+        fun_l9_n152(x)
+    end
+end
+
+def fun_l8_n386(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n432(x)
+    end
+end
+
+def fun_l8_n387(x)
+    if (x < 1)
+        fun_l9_n636(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n388(x)
+    if (x < 1)
+        fun_l9_n267(x)
+    else
+        fun_l9_n716(x)
+    end
+end
+
+def fun_l8_n389(x)
+    if (x < 1)
+        fun_l9_n898(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n390(x)
+    if (x < 1)
+        fun_l9_n481(x)
+    else
+        fun_l9_n878(x)
+    end
+end
+
+def fun_l8_n391(x)
+    if (x < 1)
+        fun_l9_n398(x)
+    else
+        fun_l9_n159(x)
+    end
+end
+
+def fun_l8_n392(x)
+    if (x < 1)
+        fun_l9_n889(x)
+    else
+        fun_l9_n517(x)
+    end
+end
+
+def fun_l8_n393(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n440(x)
+    end
+end
+
+def fun_l8_n394(x)
+    if (x < 1)
+        fun_l9_n576(x)
+    else
+        fun_l9_n421(x)
+    end
+end
+
+def fun_l8_n395(x)
+    if (x < 1)
+        fun_l9_n310(x)
+    else
+        fun_l9_n646(x)
+    end
+end
+
+def fun_l8_n396(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n414(x)
+    end
+end
+
+def fun_l8_n397(x)
+    if (x < 1)
+        fun_l9_n330(x)
+    else
+        fun_l9_n520(x)
+    end
+end
+
+def fun_l8_n398(x)
+    if (x < 1)
+        fun_l9_n175(x)
+    else
+        fun_l9_n975(x)
+    end
+end
+
+def fun_l8_n399(x)
+    if (x < 1)
+        fun_l9_n443(x)
+    else
+        fun_l9_n964(x)
+    end
+end
+
+def fun_l8_n400(x)
+    if (x < 1)
+        fun_l9_n810(x)
+    else
+        fun_l9_n102(x)
+    end
+end
+
+def fun_l8_n401(x)
+    if (x < 1)
+        fun_l9_n352(x)
+    else
+        fun_l9_n295(x)
+    end
+end
+
+def fun_l8_n402(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n974(x)
+    end
+end
+
+def fun_l8_n403(x)
+    if (x < 1)
+        fun_l9_n169(x)
+    else
+        fun_l9_n877(x)
+    end
+end
+
+def fun_l8_n404(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n306(x)
+    end
+end
+
+def fun_l8_n405(x)
+    if (x < 1)
+        fun_l9_n183(x)
+    else
+        fun_l9_n704(x)
+    end
+end
+
+def fun_l8_n406(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n684(x)
+    end
+end
+
+def fun_l8_n407(x)
+    if (x < 1)
+        fun_l9_n526(x)
+    else
+        fun_l9_n287(x)
+    end
+end
+
+def fun_l8_n408(x)
+    if (x < 1)
+        fun_l9_n377(x)
+    else
+        fun_l9_n351(x)
+    end
+end
+
+def fun_l8_n409(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n738(x)
+    end
+end
+
+def fun_l8_n410(x)
+    if (x < 1)
+        fun_l9_n61(x)
+    else
+        fun_l9_n499(x)
+    end
+end
+
+def fun_l8_n411(x)
+    if (x < 1)
+        fun_l9_n156(x)
+    else
+        fun_l9_n247(x)
+    end
+end
+
+def fun_l8_n412(x)
+    if (x < 1)
+        fun_l9_n431(x)
+    else
+        fun_l9_n636(x)
+    end
+end
+
+def fun_l8_n413(x)
+    if (x < 1)
+        fun_l9_n540(x)
+    else
+        fun_l9_n329(x)
+    end
+end
+
+def fun_l8_n414(x)
+    if (x < 1)
+        fun_l9_n49(x)
+    else
+        fun_l9_n979(x)
+    end
+end
+
+def fun_l8_n415(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n487(x)
+    end
+end
+
+def fun_l8_n416(x)
+    if (x < 1)
+        fun_l9_n679(x)
+    else
+        fun_l9_n644(x)
+    end
+end
+
+def fun_l8_n417(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n324(x)
+    end
+end
+
+def fun_l8_n418(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n419(x)
+    if (x < 1)
+        fun_l9_n273(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n420(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n205(x)
+    end
+end
+
+def fun_l8_n421(x)
+    if (x < 1)
+        fun_l9_n484(x)
+    else
+        fun_l9_n80(x)
+    end
+end
+
+def fun_l8_n422(x)
+    if (x < 1)
+        fun_l9_n908(x)
+    else
+        fun_l9_n514(x)
+    end
+end
+
+def fun_l8_n423(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n190(x)
+    end
+end
+
+def fun_l8_n424(x)
+    if (x < 1)
+        fun_l9_n463(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n425(x)
+    if (x < 1)
+        fun_l9_n780(x)
+    else
+        fun_l9_n444(x)
+    end
+end
+
+def fun_l8_n426(x)
+    if (x < 1)
+        fun_l9_n418(x)
+    else
+        fun_l9_n518(x)
+    end
+end
+
+def fun_l8_n427(x)
+    if (x < 1)
+        fun_l9_n912(x)
+    else
+        fun_l9_n27(x)
+    end
+end
+
+def fun_l8_n428(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n547(x)
+    end
+end
+
+def fun_l8_n429(x)
+    if (x < 1)
+        fun_l9_n760(x)
+    else
+        fun_l9_n466(x)
+    end
+end
+
+def fun_l8_n430(x)
+    if (x < 1)
+        fun_l9_n726(x)
+    else
+        fun_l9_n609(x)
+    end
+end
+
+def fun_l8_n431(x)
+    if (x < 1)
+        fun_l9_n206(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n432(x)
+    if (x < 1)
+        fun_l9_n396(x)
+    else
+        fun_l9_n325(x)
+    end
+end
+
+def fun_l8_n433(x)
+    if (x < 1)
+        fun_l9_n100(x)
+    else
+        fun_l9_n519(x)
+    end
+end
+
+def fun_l8_n434(x)
+    if (x < 1)
+        fun_l9_n923(x)
+    else
+        fun_l9_n387(x)
+    end
+end
+
+def fun_l8_n435(x)
+    if (x < 1)
+        fun_l9_n334(x)
+    else
+        fun_l9_n866(x)
+    end
+end
+
+def fun_l8_n436(x)
+    if (x < 1)
+        fun_l9_n896(x)
+    else
+        fun_l9_n780(x)
+    end
+end
+
+def fun_l8_n437(x)
+    if (x < 1)
+        fun_l9_n328(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n438(x)
+    if (x < 1)
+        fun_l9_n414(x)
+    else
+        fun_l9_n884(x)
+    end
+end
+
+def fun_l8_n439(x)
+    if (x < 1)
+        fun_l9_n528(x)
+    else
+        fun_l9_n419(x)
+    end
+end
+
+def fun_l8_n440(x)
+    if (x < 1)
+        fun_l9_n192(x)
+    else
+        fun_l9_n973(x)
+    end
+end
+
+def fun_l8_n441(x)
+    if (x < 1)
+        fun_l9_n679(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n442(x)
+    if (x < 1)
+        fun_l9_n294(x)
+    else
+        fun_l9_n138(x)
+    end
+end
+
+def fun_l8_n443(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n940(x)
+    end
+end
+
+def fun_l8_n444(x)
+    if (x < 1)
+        fun_l9_n834(x)
+    else
+        fun_l9_n127(x)
+    end
+end
+
+def fun_l8_n445(x)
+    if (x < 1)
+        fun_l9_n217(x)
+    else
+        fun_l9_n788(x)
+    end
+end
+
+def fun_l8_n446(x)
+    if (x < 1)
+        fun_l9_n173(x)
+    else
+        fun_l9_n49(x)
+    end
+end
+
+def fun_l8_n447(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n384(x)
+    end
+end
+
+def fun_l8_n448(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n761(x)
+    end
+end
+
+def fun_l8_n449(x)
+    if (x < 1)
+        fun_l9_n633(x)
+    else
+        fun_l9_n555(x)
+    end
+end
+
+def fun_l8_n450(x)
+    if (x < 1)
+        fun_l9_n25(x)
+    else
+        fun_l9_n714(x)
+    end
+end
+
+def fun_l8_n451(x)
+    if (x < 1)
+        fun_l9_n960(x)
+    else
+        fun_l9_n371(x)
+    end
+end
+
+def fun_l8_n452(x)
+    if (x < 1)
+        fun_l9_n733(x)
+    else
+        fun_l9_n996(x)
+    end
+end
+
+def fun_l8_n453(x)
+    if (x < 1)
+        fun_l9_n628(x)
+    else
+        fun_l9_n512(x)
+    end
+end
+
+def fun_l8_n454(x)
+    if (x < 1)
+        fun_l9_n406(x)
+    else
+        fun_l9_n671(x)
+    end
+end
+
+def fun_l8_n455(x)
+    if (x < 1)
+        fun_l9_n47(x)
+    else
+        fun_l9_n102(x)
+    end
+end
+
+def fun_l8_n456(x)
+    if (x < 1)
+        fun_l9_n85(x)
+    else
+        fun_l9_n591(x)
+    end
+end
+
+def fun_l8_n457(x)
+    if (x < 1)
+        fun_l9_n234(x)
+    else
+        fun_l9_n209(x)
+    end
+end
+
+def fun_l8_n458(x)
+    if (x < 1)
+        fun_l9_n186(x)
+    else
+        fun_l9_n928(x)
+    end
+end
+
+def fun_l8_n459(x)
+    if (x < 1)
+        fun_l9_n36(x)
+    else
+        fun_l9_n783(x)
+    end
+end
+
+def fun_l8_n460(x)
+    if (x < 1)
+        fun_l9_n775(x)
+    else
+        fun_l9_n641(x)
+    end
+end
+
+def fun_l8_n461(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n740(x)
+    end
+end
+
+def fun_l8_n462(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n113(x)
+    end
+end
+
+def fun_l8_n463(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n574(x)
+    end
+end
+
+def fun_l8_n464(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n776(x)
+    end
+end
+
+def fun_l8_n465(x)
+    if (x < 1)
+        fun_l9_n252(x)
+    else
+        fun_l9_n182(x)
+    end
+end
+
+def fun_l8_n466(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n849(x)
+    end
+end
+
+def fun_l8_n467(x)
+    if (x < 1)
+        fun_l9_n393(x)
+    else
+        fun_l9_n437(x)
+    end
+end
+
+def fun_l8_n468(x)
+    if (x < 1)
+        fun_l9_n269(x)
+    else
+        fun_l9_n381(x)
+    end
+end
+
+def fun_l8_n469(x)
+    if (x < 1)
+        fun_l9_n97(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n470(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n621(x)
+    end
+end
+
+def fun_l8_n471(x)
+    if (x < 1)
+        fun_l9_n627(x)
+    else
+        fun_l9_n793(x)
+    end
+end
+
+def fun_l8_n472(x)
+    if (x < 1)
+        fun_l9_n117(x)
+    else
+        fun_l9_n318(x)
+    end
+end
+
+def fun_l8_n473(x)
+    if (x < 1)
+        fun_l9_n238(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n474(x)
+    if (x < 1)
+        fun_l9_n81(x)
+    else
+        fun_l9_n355(x)
+    end
+end
+
+def fun_l8_n475(x)
+    if (x < 1)
+        fun_l9_n889(x)
+    else
+        fun_l9_n940(x)
+    end
+end
+
+def fun_l8_n476(x)
+    if (x < 1)
+        fun_l9_n358(x)
+    else
+        fun_l9_n52(x)
+    end
+end
+
+def fun_l8_n477(x)
+    if (x < 1)
+        fun_l9_n144(x)
+    else
+        fun_l9_n575(x)
+    end
+end
+
+def fun_l8_n478(x)
+    if (x < 1)
+        fun_l9_n975(x)
+    else
+        fun_l9_n740(x)
+    end
+end
+
+def fun_l8_n479(x)
+    if (x < 1)
+        fun_l9_n552(x)
+    else
+        fun_l9_n169(x)
+    end
+end
+
+def fun_l8_n480(x)
+    if (x < 1)
+        fun_l9_n854(x)
+    else
+        fun_l9_n524(x)
+    end
+end
+
+def fun_l8_n481(x)
+    if (x < 1)
+        fun_l9_n461(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n482(x)
+    if (x < 1)
+        fun_l9_n809(x)
+    else
+        fun_l9_n844(x)
+    end
+end
+
+def fun_l8_n483(x)
+    if (x < 1)
+        fun_l9_n741(x)
+    else
+        fun_l9_n327(x)
+    end
+end
+
+def fun_l8_n484(x)
+    if (x < 1)
+        fun_l9_n560(x)
+    else
+        fun_l9_n385(x)
+    end
+end
+
+def fun_l8_n485(x)
+    if (x < 1)
+        fun_l9_n798(x)
+    else
+        fun_l9_n154(x)
+    end
+end
+
+def fun_l8_n486(x)
+    if (x < 1)
+        fun_l9_n892(x)
+    else
+        fun_l9_n367(x)
+    end
+end
+
+def fun_l8_n487(x)
+    if (x < 1)
+        fun_l9_n423(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n488(x)
+    if (x < 1)
+        fun_l9_n618(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n489(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n495(x)
+    end
+end
+
+def fun_l8_n490(x)
+    if (x < 1)
+        fun_l9_n566(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n491(x)
+    if (x < 1)
+        fun_l9_n718(x)
+    else
+        fun_l9_n674(x)
+    end
+end
+
+def fun_l8_n492(x)
+    if (x < 1)
+        fun_l9_n487(x)
+    else
+        fun_l9_n95(x)
+    end
+end
+
+def fun_l8_n493(x)
+    if (x < 1)
+        fun_l9_n473(x)
+    else
+        fun_l9_n722(x)
+    end
+end
+
+def fun_l8_n494(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n157(x)
+    end
+end
+
+def fun_l8_n495(x)
+    if (x < 1)
+        fun_l9_n812(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n496(x)
+    if (x < 1)
+        fun_l9_n609(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n497(x)
+    if (x < 1)
+        fun_l9_n894(x)
+    else
+        fun_l9_n580(x)
+    end
+end
+
+def fun_l8_n498(x)
+    if (x < 1)
+        fun_l9_n642(x)
+    else
+        fun_l9_n13(x)
+    end
+end
+
+def fun_l8_n499(x)
+    if (x < 1)
+        fun_l9_n961(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n500(x)
+    if (x < 1)
+        fun_l9_n587(x)
+    else
+        fun_l9_n828(x)
+    end
+end
+
+def fun_l8_n501(x)
+    if (x < 1)
+        fun_l9_n30(x)
+    else
+        fun_l9_n966(x)
+    end
+end
+
+def fun_l8_n502(x)
+    if (x < 1)
+        fun_l9_n436(x)
+    else
+        fun_l9_n170(x)
+    end
+end
+
+def fun_l8_n503(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n927(x)
+    end
+end
+
+def fun_l8_n504(x)
+    if (x < 1)
+        fun_l9_n326(x)
+    else
+        fun_l9_n223(x)
+    end
+end
+
+def fun_l8_n505(x)
+    if (x < 1)
+        fun_l9_n911(x)
+    else
+        fun_l9_n746(x)
+    end
+end
+
+def fun_l8_n506(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n773(x)
+    end
+end
+
+def fun_l8_n507(x)
+    if (x < 1)
+        fun_l9_n514(x)
+    else
+        fun_l9_n882(x)
+    end
+end
+
+def fun_l8_n508(x)
+    if (x < 1)
+        fun_l9_n918(x)
+    else
+        fun_l9_n713(x)
+    end
+end
+
+def fun_l8_n509(x)
+    if (x < 1)
+        fun_l9_n694(x)
+    else
+        fun_l9_n950(x)
+    end
+end
+
+def fun_l8_n510(x)
+    if (x < 1)
+        fun_l9_n77(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n511(x)
+    if (x < 1)
+        fun_l9_n506(x)
+    else
+        fun_l9_n144(x)
+    end
+end
+
+def fun_l8_n512(x)
+    if (x < 1)
+        fun_l9_n69(x)
+    else
+        fun_l9_n308(x)
+    end
+end
+
+def fun_l8_n513(x)
+    if (x < 1)
+        fun_l9_n377(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n514(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n515(x)
+    if (x < 1)
+        fun_l9_n453(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n516(x)
+    if (x < 1)
+        fun_l9_n396(x)
+    else
+        fun_l9_n130(x)
+    end
+end
+
+def fun_l8_n517(x)
+    if (x < 1)
+        fun_l9_n715(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n518(x)
+    if (x < 1)
+        fun_l9_n326(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n519(x)
+    if (x < 1)
+        fun_l9_n535(x)
+    else
+        fun_l9_n41(x)
+    end
+end
+
+def fun_l8_n520(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n521(x)
+    if (x < 1)
+        fun_l9_n347(x)
+    else
+        fun_l9_n263(x)
+    end
+end
+
+def fun_l8_n522(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n378(x)
+    end
+end
+
+def fun_l8_n523(x)
+    if (x < 1)
+        fun_l9_n362(x)
+    else
+        fun_l9_n630(x)
+    end
+end
+
+def fun_l8_n524(x)
+    if (x < 1)
+        fun_l9_n382(x)
+    else
+        fun_l9_n256(x)
+    end
+end
+
+def fun_l8_n525(x)
+    if (x < 1)
+        fun_l9_n444(x)
+    else
+        fun_l9_n756(x)
+    end
+end
+
+def fun_l8_n526(x)
+    if (x < 1)
+        fun_l9_n5(x)
+    else
+        fun_l9_n754(x)
+    end
+end
+
+def fun_l8_n527(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n279(x)
+    end
+end
+
+def fun_l8_n528(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n246(x)
+    end
+end
+
+def fun_l8_n529(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n530(x)
+    if (x < 1)
+        fun_l9_n624(x)
+    else
+        fun_l9_n548(x)
+    end
+end
+
+def fun_l8_n531(x)
+    if (x < 1)
+        fun_l9_n615(x)
+    else
+        fun_l9_n948(x)
+    end
+end
+
+def fun_l8_n532(x)
+    if (x < 1)
+        fun_l9_n519(x)
+    else
+        fun_l9_n583(x)
+    end
+end
+
+def fun_l8_n533(x)
+    if (x < 1)
+        fun_l9_n292(x)
+    else
+        fun_l9_n827(x)
+    end
+end
+
+def fun_l8_n534(x)
+    if (x < 1)
+        fun_l9_n893(x)
+    else
+        fun_l9_n877(x)
+    end
+end
+
+def fun_l8_n535(x)
+    if (x < 1)
+        fun_l9_n873(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n536(x)
+    if (x < 1)
+        fun_l9_n497(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n537(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n815(x)
+    end
+end
+
+def fun_l8_n538(x)
+    if (x < 1)
+        fun_l9_n258(x)
+    else
+        fun_l9_n810(x)
+    end
+end
+
+def fun_l8_n539(x)
+    if (x < 1)
+        fun_l9_n907(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n540(x)
+    if (x < 1)
+        fun_l9_n752(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n541(x)
+    if (x < 1)
+        fun_l9_n802(x)
+    else
+        fun_l9_n45(x)
+    end
+end
+
+def fun_l8_n542(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n470(x)
+    end
+end
+
+def fun_l8_n543(x)
+    if (x < 1)
+        fun_l9_n353(x)
+    else
+        fun_l9_n238(x)
+    end
+end
+
+def fun_l8_n544(x)
+    if (x < 1)
+        fun_l9_n656(x)
+    else
+        fun_l9_n569(x)
+    end
+end
+
+def fun_l8_n545(x)
+    if (x < 1)
+        fun_l9_n494(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n546(x)
+    if (x < 1)
+        fun_l9_n65(x)
+    else
+        fun_l9_n896(x)
+    end
+end
+
+def fun_l8_n547(x)
+    if (x < 1)
+        fun_l9_n995(x)
+    else
+        fun_l9_n727(x)
+    end
+end
+
+def fun_l8_n548(x)
+    if (x < 1)
+        fun_l9_n562(x)
+    else
+        fun_l9_n759(x)
+    end
+end
+
+def fun_l8_n549(x)
+    if (x < 1)
+        fun_l9_n210(x)
+    else
+        fun_l9_n734(x)
+    end
+end
+
+def fun_l8_n550(x)
+    if (x < 1)
+        fun_l9_n482(x)
+    else
+        fun_l9_n11(x)
+    end
+end
+
+def fun_l8_n551(x)
+    if (x < 1)
+        fun_l9_n86(x)
+    else
+        fun_l9_n867(x)
+    end
+end
+
+def fun_l8_n552(x)
+    if (x < 1)
+        fun_l9_n647(x)
+    else
+        fun_l9_n293(x)
+    end
+end
+
+def fun_l8_n553(x)
+    if (x < 1)
+        fun_l9_n98(x)
+    else
+        fun_l9_n868(x)
+    end
+end
+
+def fun_l8_n554(x)
+    if (x < 1)
+        fun_l9_n380(x)
+    else
+        fun_l9_n2(x)
+    end
+end
+
+def fun_l8_n555(x)
+    if (x < 1)
+        fun_l9_n274(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n556(x)
+    if (x < 1)
+        fun_l9_n623(x)
+    else
+        fun_l9_n848(x)
+    end
+end
+
+def fun_l8_n557(x)
+    if (x < 1)
+        fun_l9_n642(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n558(x)
+    if (x < 1)
+        fun_l9_n247(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n559(x)
+    if (x < 1)
+        fun_l9_n896(x)
+    else
+        fun_l9_n937(x)
+    end
+end
+
+def fun_l8_n560(x)
+    if (x < 1)
+        fun_l9_n592(x)
+    else
+        fun_l9_n211(x)
+    end
+end
+
+def fun_l8_n561(x)
+    if (x < 1)
+        fun_l9_n205(x)
+    else
+        fun_l9_n971(x)
+    end
+end
+
+def fun_l8_n562(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n147(x)
+    end
+end
+
+def fun_l8_n563(x)
+    if (x < 1)
+        fun_l9_n722(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n564(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n58(x)
+    end
+end
+
+def fun_l8_n565(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n617(x)
+    end
+end
+
+def fun_l8_n566(x)
+    if (x < 1)
+        fun_l9_n772(x)
+    else
+        fun_l9_n428(x)
+    end
+end
+
+def fun_l8_n567(x)
+    if (x < 1)
+        fun_l9_n870(x)
+    else
+        fun_l9_n672(x)
+    end
+end
+
+def fun_l8_n568(x)
+    if (x < 1)
+        fun_l9_n946(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n569(x)
+    if (x < 1)
+        fun_l9_n507(x)
+    else
+        fun_l9_n346(x)
+    end
+end
+
+def fun_l8_n570(x)
+    if (x < 1)
+        fun_l9_n157(x)
+    else
+        fun_l9_n70(x)
+    end
+end
+
+def fun_l8_n571(x)
+    if (x < 1)
+        fun_l9_n549(x)
+    else
+        fun_l9_n831(x)
+    end
+end
+
+def fun_l8_n572(x)
+    if (x < 1)
+        fun_l9_n463(x)
+    else
+        fun_l9_n843(x)
+    end
+end
+
+def fun_l8_n573(x)
+    if (x < 1)
+        fun_l9_n676(x)
+    else
+        fun_l9_n651(x)
+    end
+end
+
+def fun_l8_n574(x)
+    if (x < 1)
+        fun_l9_n648(x)
+    else
+        fun_l9_n562(x)
+    end
+end
+
+def fun_l8_n575(x)
+    if (x < 1)
+        fun_l9_n771(x)
+    else
+        fun_l9_n549(x)
+    end
+end
+
+def fun_l8_n576(x)
+    if (x < 1)
+        fun_l9_n899(x)
+    else
+        fun_l9_n436(x)
+    end
+end
+
+def fun_l8_n577(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n708(x)
+    end
+end
+
+def fun_l8_n578(x)
+    if (x < 1)
+        fun_l9_n49(x)
+    else
+        fun_l9_n559(x)
+    end
+end
+
+def fun_l8_n579(x)
+    if (x < 1)
+        fun_l9_n937(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n580(x)
+    if (x < 1)
+        fun_l9_n970(x)
+    else
+        fun_l9_n203(x)
+    end
+end
+
+def fun_l8_n581(x)
+    if (x < 1)
+        fun_l9_n901(x)
+    else
+        fun_l9_n666(x)
+    end
+end
+
+def fun_l8_n582(x)
+    if (x < 1)
+        fun_l9_n79(x)
+    else
+        fun_l9_n260(x)
+    end
+end
+
+def fun_l8_n583(x)
+    if (x < 1)
+        fun_l9_n167(x)
+    else
+        fun_l9_n512(x)
+    end
+end
+
+def fun_l8_n584(x)
+    if (x < 1)
+        fun_l9_n750(x)
+    else
+        fun_l9_n406(x)
+    end
+end
+
+def fun_l8_n585(x)
+    if (x < 1)
+        fun_l9_n118(x)
+    else
+        fun_l9_n525(x)
+    end
+end
+
+def fun_l8_n586(x)
+    if (x < 1)
+        fun_l9_n573(x)
+    else
+        fun_l9_n657(x)
+    end
+end
+
+def fun_l8_n587(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n903(x)
+    end
+end
+
+def fun_l8_n588(x)
+    if (x < 1)
+        fun_l9_n971(x)
+    else
+        fun_l9_n608(x)
+    end
+end
+
+def fun_l8_n589(x)
+    if (x < 1)
+        fun_l9_n334(x)
+    else
+        fun_l9_n704(x)
+    end
+end
+
+def fun_l8_n590(x)
+    if (x < 1)
+        fun_l9_n398(x)
+    else
+        fun_l9_n500(x)
+    end
+end
+
+def fun_l8_n591(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n616(x)
+    end
+end
+
+def fun_l8_n592(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n655(x)
+    end
+end
+
+def fun_l8_n593(x)
+    if (x < 1)
+        fun_l9_n864(x)
+    else
+        fun_l9_n697(x)
+    end
+end
+
+def fun_l8_n594(x)
+    if (x < 1)
+        fun_l9_n35(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n595(x)
+    if (x < 1)
+        fun_l9_n480(x)
+    else
+        fun_l9_n688(x)
+    end
+end
+
+def fun_l8_n596(x)
+    if (x < 1)
+        fun_l9_n846(x)
+    else
+        fun_l9_n403(x)
+    end
+end
+
+def fun_l8_n597(x)
+    if (x < 1)
+        fun_l9_n522(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n598(x)
+    if (x < 1)
+        fun_l9_n800(x)
+    else
+        fun_l9_n531(x)
+    end
+end
+
+def fun_l8_n599(x)
+    if (x < 1)
+        fun_l9_n64(x)
+    else
+        fun_l9_n876(x)
+    end
+end
+
+def fun_l8_n600(x)
+    if (x < 1)
+        fun_l9_n614(x)
+    else
+        fun_l9_n660(x)
+    end
+end
+
+def fun_l8_n601(x)
+    if (x < 1)
+        fun_l9_n119(x)
+    else
+        fun_l9_n998(x)
+    end
+end
+
+def fun_l8_n602(x)
+    if (x < 1)
+        fun_l9_n549(x)
+    else
+        fun_l9_n911(x)
+    end
+end
+
+def fun_l8_n603(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n664(x)
+    end
+end
+
+def fun_l8_n604(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n960(x)
+    end
+end
+
+def fun_l8_n605(x)
+    if (x < 1)
+        fun_l9_n82(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n606(x)
+    if (x < 1)
+        fun_l9_n379(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n607(x)
+    if (x < 1)
+        fun_l9_n104(x)
+    else
+        fun_l9_n869(x)
+    end
+end
+
+def fun_l8_n608(x)
+    if (x < 1)
+        fun_l9_n874(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n609(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n667(x)
+    end
+end
+
+def fun_l8_n610(x)
+    if (x < 1)
+        fun_l9_n1(x)
+    else
+        fun_l9_n524(x)
+    end
+end
+
+def fun_l8_n611(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n230(x)
+    end
+end
+
+def fun_l8_n612(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n129(x)
+    end
+end
+
+def fun_l8_n613(x)
+    if (x < 1)
+        fun_l9_n591(x)
+    else
+        fun_l9_n551(x)
+    end
+end
+
+def fun_l8_n614(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n358(x)
+    end
+end
+
+def fun_l8_n615(x)
+    if (x < 1)
+        fun_l9_n387(x)
+    else
+        fun_l9_n425(x)
+    end
+end
+
+def fun_l8_n616(x)
+    if (x < 1)
+        fun_l9_n426(x)
+    else
+        fun_l9_n449(x)
+    end
+end
+
+def fun_l8_n617(x)
+    if (x < 1)
+        fun_l9_n627(x)
+    else
+        fun_l9_n399(x)
+    end
+end
+
+def fun_l8_n618(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n24(x)
+    end
+end
+
+def fun_l8_n619(x)
+    if (x < 1)
+        fun_l9_n574(x)
+    else
+        fun_l9_n640(x)
+    end
+end
+
+def fun_l8_n620(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n6(x)
+    end
+end
+
+def fun_l8_n621(x)
+    if (x < 1)
+        fun_l9_n148(x)
+    else
+        fun_l9_n718(x)
+    end
+end
+
+def fun_l8_n622(x)
+    if (x < 1)
+        fun_l9_n151(x)
+    else
+        fun_l9_n56(x)
+    end
+end
+
+def fun_l8_n623(x)
+    if (x < 1)
+        fun_l9_n672(x)
+    else
+        fun_l9_n93(x)
+    end
+end
+
+def fun_l8_n624(x)
+    if (x < 1)
+        fun_l9_n948(x)
+    else
+        fun_l9_n530(x)
+    end
+end
+
+def fun_l8_n625(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n334(x)
+    end
+end
+
+def fun_l8_n626(x)
+    if (x < 1)
+        fun_l9_n736(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n627(x)
+    if (x < 1)
+        fun_l9_n291(x)
+    else
+        fun_l9_n953(x)
+    end
+end
+
+def fun_l8_n628(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n4(x)
+    end
+end
+
+def fun_l8_n629(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n297(x)
+    end
+end
+
+def fun_l8_n630(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n631(x)
+    if (x < 1)
+        fun_l9_n400(x)
+    else
+        fun_l9_n584(x)
+    end
+end
+
+def fun_l8_n632(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n200(x)
+    end
+end
+
+def fun_l8_n633(x)
+    if (x < 1)
+        fun_l9_n433(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n634(x)
+    if (x < 1)
+        fun_l9_n974(x)
+    else
+        fun_l9_n25(x)
+    end
+end
+
+def fun_l8_n635(x)
+    if (x < 1)
+        fun_l9_n739(x)
+    else
+        fun_l9_n695(x)
+    end
+end
+
+def fun_l8_n636(x)
+    if (x < 1)
+        fun_l9_n855(x)
+    else
+        fun_l9_n898(x)
+    end
+end
+
+def fun_l8_n637(x)
+    if (x < 1)
+        fun_l9_n868(x)
+    else
+        fun_l9_n825(x)
+    end
+end
+
+def fun_l8_n638(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n417(x)
+    end
+end
+
+def fun_l8_n639(x)
+    if (x < 1)
+        fun_l9_n975(x)
+    else
+        fun_l9_n484(x)
+    end
+end
+
+def fun_l8_n640(x)
+    if (x < 1)
+        fun_l9_n228(x)
+    else
+        fun_l9_n964(x)
+    end
+end
+
+def fun_l8_n641(x)
+    if (x < 1)
+        fun_l9_n743(x)
+    else
+        fun_l9_n986(x)
+    end
+end
+
+def fun_l8_n642(x)
+    if (x < 1)
+        fun_l9_n763(x)
+    else
+        fun_l9_n747(x)
+    end
+end
+
+def fun_l8_n643(x)
+    if (x < 1)
+        fun_l9_n77(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n644(x)
+    if (x < 1)
+        fun_l9_n393(x)
+    else
+        fun_l9_n694(x)
+    end
+end
+
+def fun_l8_n645(x)
+    if (x < 1)
+        fun_l9_n196(x)
+    else
+        fun_l9_n211(x)
+    end
+end
+
+def fun_l8_n646(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n649(x)
+    end
+end
+
+def fun_l8_n647(x)
+    if (x < 1)
+        fun_l9_n669(x)
+    else
+        fun_l9_n12(x)
+    end
+end
+
+def fun_l8_n648(x)
+    if (x < 1)
+        fun_l9_n175(x)
+    else
+        fun_l9_n388(x)
+    end
+end
+
+def fun_l8_n649(x)
+    if (x < 1)
+        fun_l9_n122(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n650(x)
+    if (x < 1)
+        fun_l9_n817(x)
+    else
+        fun_l9_n274(x)
+    end
+end
+
+def fun_l8_n651(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n538(x)
+    end
+end
+
+def fun_l8_n652(x)
+    if (x < 1)
+        fun_l9_n171(x)
+    else
+        fun_l9_n895(x)
+    end
+end
+
+def fun_l8_n653(x)
+    if (x < 1)
+        fun_l9_n417(x)
+    else
+        fun_l9_n618(x)
+    end
+end
+
+def fun_l8_n654(x)
+    if (x < 1)
+        fun_l9_n709(x)
+    else
+        fun_l9_n892(x)
+    end
+end
+
+def fun_l8_n655(x)
+    if (x < 1)
+        fun_l9_n906(x)
+    else
+        fun_l9_n602(x)
+    end
+end
+
+def fun_l8_n656(x)
+    if (x < 1)
+        fun_l9_n769(x)
+    else
+        fun_l9_n554(x)
+    end
+end
+
+def fun_l8_n657(x)
+    if (x < 1)
+        fun_l9_n468(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n658(x)
+    if (x < 1)
+        fun_l9_n38(x)
+    else
+        fun_l9_n947(x)
+    end
+end
+
+def fun_l8_n659(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n327(x)
+    end
+end
+
+def fun_l8_n660(x)
+    if (x < 1)
+        fun_l9_n452(x)
+    else
+        fun_l9_n313(x)
+    end
+end
+
+def fun_l8_n661(x)
+    if (x < 1)
+        fun_l9_n568(x)
+    else
+        fun_l9_n383(x)
+    end
+end
+
+def fun_l8_n662(x)
+    if (x < 1)
+        fun_l9_n795(x)
+    else
+        fun_l9_n680(x)
+    end
+end
+
+def fun_l8_n663(x)
+    if (x < 1)
+        fun_l9_n152(x)
+    else
+        fun_l9_n846(x)
+    end
+end
+
+def fun_l8_n664(x)
+    if (x < 1)
+        fun_l9_n585(x)
+    else
+        fun_l9_n670(x)
+    end
+end
+
+def fun_l8_n665(x)
+    if (x < 1)
+        fun_l9_n133(x)
+    else
+        fun_l9_n799(x)
+    end
+end
+
+def fun_l8_n666(x)
+    if (x < 1)
+        fun_l9_n699(x)
+    else
+        fun_l9_n311(x)
+    end
+end
+
+def fun_l8_n667(x)
+    if (x < 1)
+        fun_l9_n558(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n668(x)
+    if (x < 1)
+        fun_l9_n825(x)
+    else
+        fun_l9_n534(x)
+    end
+end
+
+def fun_l8_n669(x)
+    if (x < 1)
+        fun_l9_n143(x)
+    else
+        fun_l9_n21(x)
+    end
+end
+
+def fun_l8_n670(x)
+    if (x < 1)
+        fun_l9_n827(x)
+    else
+        fun_l9_n679(x)
+    end
+end
+
+def fun_l8_n671(x)
+    if (x < 1)
+        fun_l9_n704(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n672(x)
+    if (x < 1)
+        fun_l9_n776(x)
+    else
+        fun_l9_n867(x)
+    end
+end
+
+def fun_l8_n673(x)
+    if (x < 1)
+        fun_l9_n871(x)
+    else
+        fun_l9_n315(x)
+    end
+end
+
+def fun_l8_n674(x)
+    if (x < 1)
+        fun_l9_n860(x)
+    else
+        fun_l9_n945(x)
+    end
+end
+
+def fun_l8_n675(x)
+    if (x < 1)
+        fun_l9_n890(x)
+    else
+        fun_l9_n629(x)
+    end
+end
+
+def fun_l8_n676(x)
+    if (x < 1)
+        fun_l9_n91(x)
+    else
+        fun_l9_n35(x)
+    end
+end
+
+def fun_l8_n677(x)
+    if (x < 1)
+        fun_l9_n825(x)
+    else
+        fun_l9_n922(x)
+    end
+end
+
+def fun_l8_n678(x)
+    if (x < 1)
+        fun_l9_n457(x)
+    else
+        fun_l9_n156(x)
+    end
+end
+
+def fun_l8_n679(x)
+    if (x < 1)
+        fun_l9_n455(x)
+    else
+        fun_l9_n809(x)
+    end
+end
+
+def fun_l8_n680(x)
+    if (x < 1)
+        fun_l9_n213(x)
+    else
+        fun_l9_n944(x)
+    end
+end
+
+def fun_l8_n681(x)
+    if (x < 1)
+        fun_l9_n760(x)
+    else
+        fun_l9_n137(x)
+    end
+end
+
+def fun_l8_n682(x)
+    if (x < 1)
+        fun_l9_n998(x)
+    else
+        fun_l9_n703(x)
+    end
+end
+
+def fun_l8_n683(x)
+    if (x < 1)
+        fun_l9_n988(x)
+    else
+        fun_l9_n952(x)
+    end
+end
+
+def fun_l8_n684(x)
+    if (x < 1)
+        fun_l9_n583(x)
+    else
+        fun_l9_n890(x)
+    end
+end
+
+def fun_l8_n685(x)
+    if (x < 1)
+        fun_l9_n879(x)
+    else
+        fun_l9_n978(x)
+    end
+end
+
+def fun_l8_n686(x)
+    if (x < 1)
+        fun_l9_n6(x)
+    else
+        fun_l9_n978(x)
+    end
+end
+
+def fun_l8_n687(x)
+    if (x < 1)
+        fun_l9_n67(x)
+    else
+        fun_l9_n149(x)
+    end
+end
+
+def fun_l8_n688(x)
+    if (x < 1)
+        fun_l9_n386(x)
+    else
+        fun_l9_n293(x)
+    end
+end
+
+def fun_l8_n689(x)
+    if (x < 1)
+        fun_l9_n493(x)
+    else
+        fun_l9_n140(x)
+    end
+end
+
+def fun_l8_n690(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n550(x)
+    end
+end
+
+def fun_l8_n691(x)
+    if (x < 1)
+        fun_l9_n456(x)
+    else
+        fun_l9_n976(x)
+    end
+end
+
+def fun_l8_n692(x)
+    if (x < 1)
+        fun_l9_n516(x)
+    else
+        fun_l9_n145(x)
+    end
+end
+
+def fun_l8_n693(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n647(x)
+    end
+end
+
+def fun_l8_n694(x)
+    if (x < 1)
+        fun_l9_n348(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n695(x)
+    if (x < 1)
+        fun_l9_n546(x)
+    else
+        fun_l9_n320(x)
+    end
+end
+
+def fun_l8_n696(x)
+    if (x < 1)
+        fun_l9_n588(x)
+    else
+        fun_l9_n285(x)
+    end
+end
+
+def fun_l8_n697(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n710(x)
+    end
+end
+
+def fun_l8_n698(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n217(x)
+    end
+end
+
+def fun_l8_n699(x)
+    if (x < 1)
+        fun_l9_n714(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n700(x)
+    if (x < 1)
+        fun_l9_n378(x)
+    else
+        fun_l9_n122(x)
+    end
+end
+
+def fun_l8_n701(x)
+    if (x < 1)
+        fun_l9_n696(x)
+    else
+        fun_l9_n577(x)
+    end
+end
+
+def fun_l8_n702(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n578(x)
+    end
+end
+
+def fun_l8_n703(x)
+    if (x < 1)
+        fun_l9_n502(x)
+    else
+        fun_l9_n410(x)
+    end
+end
+
+def fun_l8_n704(x)
+    if (x < 1)
+        fun_l9_n532(x)
+    else
+        fun_l9_n532(x)
+    end
+end
+
+def fun_l8_n705(x)
+    if (x < 1)
+        fun_l9_n662(x)
+    else
+        fun_l9_n361(x)
+    end
+end
+
+def fun_l8_n706(x)
+    if (x < 1)
+        fun_l9_n109(x)
+    else
+        fun_l9_n380(x)
+    end
+end
+
+def fun_l8_n707(x)
+    if (x < 1)
+        fun_l9_n653(x)
+    else
+        fun_l9_n566(x)
+    end
+end
+
+def fun_l8_n708(x)
+    if (x < 1)
+        fun_l9_n587(x)
+    else
+        fun_l9_n465(x)
+    end
+end
+
+def fun_l8_n709(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n274(x)
+    end
+end
+
+def fun_l8_n710(x)
+    if (x < 1)
+        fun_l9_n459(x)
+    else
+        fun_l9_n872(x)
+    end
+end
+
+def fun_l8_n711(x)
+    if (x < 1)
+        fun_l9_n71(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n712(x)
+    if (x < 1)
+        fun_l9_n770(x)
+    else
+        fun_l9_n405(x)
+    end
+end
+
+def fun_l8_n713(x)
+    if (x < 1)
+        fun_l9_n233(x)
+    else
+        fun_l9_n232(x)
+    end
+end
+
+def fun_l8_n714(x)
+    if (x < 1)
+        fun_l9_n29(x)
+    else
+        fun_l9_n23(x)
+    end
+end
+
+def fun_l8_n715(x)
+    if (x < 1)
+        fun_l9_n44(x)
+    else
+        fun_l9_n185(x)
+    end
+end
+
+def fun_l8_n716(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n717(x)
+    if (x < 1)
+        fun_l9_n323(x)
+    else
+        fun_l9_n636(x)
+    end
+end
+
+def fun_l8_n718(x)
+    if (x < 1)
+        fun_l9_n733(x)
+    else
+        fun_l9_n10(x)
+    end
+end
+
+def fun_l8_n719(x)
+    if (x < 1)
+        fun_l9_n100(x)
+    else
+        fun_l9_n123(x)
+    end
+end
+
+def fun_l8_n720(x)
+    if (x < 1)
+        fun_l9_n572(x)
+    else
+        fun_l9_n813(x)
+    end
+end
+
+def fun_l8_n721(x)
+    if (x < 1)
+        fun_l9_n634(x)
+    else
+        fun_l9_n152(x)
+    end
+end
+
+def fun_l8_n722(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n881(x)
+    end
+end
+
+def fun_l8_n723(x)
+    if (x < 1)
+        fun_l9_n202(x)
+    else
+        fun_l9_n294(x)
+    end
+end
+
+def fun_l8_n724(x)
+    if (x < 1)
+        fun_l9_n668(x)
+    else
+        fun_l9_n792(x)
+    end
+end
+
+def fun_l8_n725(x)
+    if (x < 1)
+        fun_l9_n309(x)
+    else
+        fun_l9_n612(x)
+    end
+end
+
+def fun_l8_n726(x)
+    if (x < 1)
+        fun_l9_n320(x)
+    else
+        fun_l9_n459(x)
+    end
+end
+
+def fun_l8_n727(x)
+    if (x < 1)
+        fun_l9_n355(x)
+    else
+        fun_l9_n321(x)
+    end
+end
+
+def fun_l8_n728(x)
+    if (x < 1)
+        fun_l9_n237(x)
+    else
+        fun_l9_n135(x)
+    end
+end
+
+def fun_l8_n729(x)
+    if (x < 1)
+        fun_l9_n980(x)
+    else
+        fun_l9_n209(x)
+    end
+end
+
+def fun_l8_n730(x)
+    if (x < 1)
+        fun_l9_n957(x)
+    else
+        fun_l9_n481(x)
+    end
+end
+
+def fun_l8_n731(x)
+    if (x < 1)
+        fun_l9_n594(x)
+    else
+        fun_l9_n396(x)
+    end
+end
+
+def fun_l8_n732(x)
+    if (x < 1)
+        fun_l9_n916(x)
+    else
+        fun_l9_n473(x)
+    end
+end
+
+def fun_l8_n733(x)
+    if (x < 1)
+        fun_l9_n376(x)
+    else
+        fun_l9_n231(x)
+    end
+end
+
+def fun_l8_n734(x)
+    if (x < 1)
+        fun_l9_n758(x)
+    else
+        fun_l9_n111(x)
+    end
+end
+
+def fun_l8_n735(x)
+    if (x < 1)
+        fun_l9_n131(x)
+    else
+        fun_l9_n586(x)
+    end
+end
+
+def fun_l8_n736(x)
+    if (x < 1)
+        fun_l9_n290(x)
+    else
+        fun_l9_n227(x)
+    end
+end
+
+def fun_l8_n737(x)
+    if (x < 1)
+        fun_l9_n784(x)
+    else
+        fun_l9_n869(x)
+    end
+end
+
+def fun_l8_n738(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n79(x)
+    end
+end
+
+def fun_l8_n739(x)
+    if (x < 1)
+        fun_l9_n489(x)
+    else
+        fun_l9_n347(x)
+    end
+end
+
+def fun_l8_n740(x)
+    if (x < 1)
+        fun_l9_n4(x)
+    else
+        fun_l9_n587(x)
+    end
+end
+
+def fun_l8_n741(x)
+    if (x < 1)
+        fun_l9_n949(x)
+    else
+        fun_l9_n196(x)
+    end
+end
+
+def fun_l8_n742(x)
+    if (x < 1)
+        fun_l9_n577(x)
+    else
+        fun_l9_n562(x)
+    end
+end
+
+def fun_l8_n743(x)
+    if (x < 1)
+        fun_l9_n656(x)
+    else
+        fun_l9_n685(x)
+    end
+end
+
+def fun_l8_n744(x)
+    if (x < 1)
+        fun_l9_n792(x)
+    else
+        fun_l9_n572(x)
+    end
+end
+
+def fun_l8_n745(x)
+    if (x < 1)
+        fun_l9_n318(x)
+    else
+        fun_l9_n335(x)
+    end
+end
+
+def fun_l8_n746(x)
+    if (x < 1)
+        fun_l9_n59(x)
+    else
+        fun_l9_n109(x)
+    end
+end
+
+def fun_l8_n747(x)
+    if (x < 1)
+        fun_l9_n276(x)
+    else
+        fun_l9_n567(x)
+    end
+end
+
+def fun_l8_n748(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n220(x)
+    end
+end
+
+def fun_l8_n749(x)
+    if (x < 1)
+        fun_l9_n208(x)
+    else
+        fun_l9_n108(x)
+    end
+end
+
+def fun_l8_n750(x)
+    if (x < 1)
+        fun_l9_n927(x)
+    else
+        fun_l9_n950(x)
+    end
+end
+
+def fun_l8_n751(x)
+    if (x < 1)
+        fun_l9_n371(x)
+    else
+        fun_l9_n72(x)
+    end
+end
+
+def fun_l8_n752(x)
+    if (x < 1)
+        fun_l9_n455(x)
+    else
+        fun_l9_n467(x)
+    end
+end
+
+def fun_l8_n753(x)
+    if (x < 1)
+        fun_l9_n344(x)
+    else
+        fun_l9_n82(x)
+    end
+end
+
+def fun_l8_n754(x)
+    if (x < 1)
+        fun_l9_n902(x)
+    else
+        fun_l9_n219(x)
+    end
+end
+
+def fun_l8_n755(x)
+    if (x < 1)
+        fun_l9_n101(x)
+    else
+        fun_l9_n523(x)
+    end
+end
+
+def fun_l8_n756(x)
+    if (x < 1)
+        fun_l9_n517(x)
+    else
+        fun_l9_n97(x)
+    end
+end
+
+def fun_l8_n757(x)
+    if (x < 1)
+        fun_l9_n571(x)
+    else
+        fun_l9_n650(x)
+    end
+end
+
+def fun_l8_n758(x)
+    if (x < 1)
+        fun_l9_n701(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n759(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n808(x)
+    end
+end
+
+def fun_l8_n760(x)
+    if (x < 1)
+        fun_l9_n570(x)
+    else
+        fun_l9_n90(x)
+    end
+end
+
+def fun_l8_n761(x)
+    if (x < 1)
+        fun_l9_n792(x)
+    else
+        fun_l9_n673(x)
+    end
+end
+
+def fun_l8_n762(x)
+    if (x < 1)
+        fun_l9_n514(x)
+    else
+        fun_l9_n771(x)
+    end
+end
+
+def fun_l8_n763(x)
+    if (x < 1)
+        fun_l9_n404(x)
+    else
+        fun_l9_n264(x)
+    end
+end
+
+def fun_l8_n764(x)
+    if (x < 1)
+        fun_l9_n270(x)
+    else
+        fun_l9_n738(x)
+    end
+end
+
+def fun_l8_n765(x)
+    if (x < 1)
+        fun_l9_n915(x)
+    else
+        fun_l9_n901(x)
+    end
+end
+
+def fun_l8_n766(x)
+    if (x < 1)
+        fun_l9_n120(x)
+    else
+        fun_l9_n176(x)
+    end
+end
+
+def fun_l8_n767(x)
+    if (x < 1)
+        fun_l9_n470(x)
+    else
+        fun_l9_n837(x)
+    end
+end
+
+def fun_l8_n768(x)
+    if (x < 1)
+        fun_l9_n912(x)
+    else
+        fun_l9_n898(x)
+    end
+end
+
+def fun_l8_n769(x)
+    if (x < 1)
+        fun_l9_n76(x)
+    else
+        fun_l9_n350(x)
+    end
+end
+
+def fun_l8_n770(x)
+    if (x < 1)
+        fun_l9_n487(x)
+    else
+        fun_l9_n572(x)
+    end
+end
+
+def fun_l8_n771(x)
+    if (x < 1)
+        fun_l9_n823(x)
+    else
+        fun_l9_n815(x)
+    end
+end
+
+def fun_l8_n772(x)
+    if (x < 1)
+        fun_l9_n655(x)
+    else
+        fun_l9_n968(x)
+    end
+end
+
+def fun_l8_n773(x)
+    if (x < 1)
+        fun_l9_n824(x)
+    else
+        fun_l9_n741(x)
+    end
+end
+
+def fun_l8_n774(x)
+    if (x < 1)
+        fun_l9_n143(x)
+    else
+        fun_l9_n641(x)
+    end
+end
+
+def fun_l8_n775(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n592(x)
+    end
+end
+
+def fun_l8_n776(x)
+    if (x < 1)
+        fun_l9_n686(x)
+    else
+        fun_l9_n234(x)
+    end
+end
+
+def fun_l8_n777(x)
+    if (x < 1)
+        fun_l9_n540(x)
+    else
+        fun_l9_n794(x)
+    end
+end
+
+def fun_l8_n778(x)
+    if (x < 1)
+        fun_l9_n154(x)
+    else
+        fun_l9_n656(x)
+    end
+end
+
+def fun_l8_n779(x)
+    if (x < 1)
+        fun_l9_n836(x)
+    else
+        fun_l9_n756(x)
+    end
+end
+
+def fun_l8_n780(x)
+    if (x < 1)
+        fun_l9_n98(x)
+    else
+        fun_l9_n233(x)
+    end
+end
+
+def fun_l8_n781(x)
+    if (x < 1)
+        fun_l9_n584(x)
+    else
+        fun_l9_n398(x)
+    end
+end
+
+def fun_l8_n782(x)
+    if (x < 1)
+        fun_l9_n851(x)
+    else
+        fun_l9_n967(x)
+    end
+end
+
+def fun_l8_n783(x)
+    if (x < 1)
+        fun_l9_n868(x)
+    else
+        fun_l9_n57(x)
+    end
+end
+
+def fun_l8_n784(x)
+    if (x < 1)
+        fun_l9_n782(x)
+    else
+        fun_l9_n214(x)
+    end
+end
+
+def fun_l8_n785(x)
+    if (x < 1)
+        fun_l9_n79(x)
+    else
+        fun_l9_n489(x)
+    end
+end
+
+def fun_l8_n786(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n787(x)
+    if (x < 1)
+        fun_l9_n985(x)
+    else
+        fun_l9_n781(x)
+    end
+end
+
+def fun_l8_n788(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n542(x)
+    end
+end
+
+def fun_l8_n789(x)
+    if (x < 1)
+        fun_l9_n982(x)
+    else
+        fun_l9_n834(x)
+    end
+end
+
+def fun_l8_n790(x)
+    if (x < 1)
+        fun_l9_n482(x)
+    else
+        fun_l9_n424(x)
+    end
+end
+
+def fun_l8_n791(x)
+    if (x < 1)
+        fun_l9_n289(x)
+    else
+        fun_l9_n487(x)
+    end
+end
+
+def fun_l8_n792(x)
+    if (x < 1)
+        fun_l9_n820(x)
+    else
+        fun_l9_n242(x)
+    end
+end
+
+def fun_l8_n793(x)
+    if (x < 1)
+        fun_l9_n110(x)
+    else
+        fun_l9_n356(x)
+    end
+end
+
+def fun_l8_n794(x)
+    if (x < 1)
+        fun_l9_n142(x)
+    else
+        fun_l9_n607(x)
+    end
+end
+
+def fun_l8_n795(x)
+    if (x < 1)
+        fun_l9_n21(x)
+    else
+        fun_l9_n14(x)
+    end
+end
+
+def fun_l8_n796(x)
+    if (x < 1)
+        fun_l9_n147(x)
+    else
+        fun_l9_n767(x)
+    end
+end
+
+def fun_l8_n797(x)
+    if (x < 1)
+        fun_l9_n427(x)
+    else
+        fun_l9_n854(x)
+    end
+end
+
+def fun_l8_n798(x)
+    if (x < 1)
+        fun_l9_n557(x)
+    else
+        fun_l9_n729(x)
+    end
+end
+
+def fun_l8_n799(x)
+    if (x < 1)
+        fun_l9_n150(x)
+    else
+        fun_l9_n180(x)
+    end
+end
+
+def fun_l8_n800(x)
+    if (x < 1)
+        fun_l9_n888(x)
+    else
+        fun_l9_n612(x)
+    end
+end
+
+def fun_l8_n801(x)
+    if (x < 1)
+        fun_l9_n631(x)
+    else
+        fun_l9_n370(x)
+    end
+end
+
+def fun_l8_n802(x)
+    if (x < 1)
+        fun_l9_n759(x)
+    else
+        fun_l9_n446(x)
+    end
+end
+
+def fun_l8_n803(x)
+    if (x < 1)
+        fun_l9_n182(x)
+    else
+        fun_l9_n705(x)
+    end
+end
+
+def fun_l8_n804(x)
+    if (x < 1)
+        fun_l9_n474(x)
+    else
+        fun_l9_n461(x)
+    end
+end
+
+def fun_l8_n805(x)
+    if (x < 1)
+        fun_l9_n897(x)
+    else
+        fun_l9_n935(x)
+    end
+end
+
+def fun_l8_n806(x)
+    if (x < 1)
+        fun_l9_n793(x)
+    else
+        fun_l9_n981(x)
+    end
+end
+
+def fun_l8_n807(x)
+    if (x < 1)
+        fun_l9_n124(x)
+    else
+        fun_l9_n528(x)
+    end
+end
+
+def fun_l8_n808(x)
+    if (x < 1)
+        fun_l9_n637(x)
+    else
+        fun_l9_n989(x)
+    end
+end
+
+def fun_l8_n809(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n196(x)
+    end
+end
+
+def fun_l8_n810(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n806(x)
+    end
+end
+
+def fun_l8_n811(x)
+    if (x < 1)
+        fun_l9_n541(x)
+    else
+        fun_l9_n6(x)
+    end
+end
+
+def fun_l8_n812(x)
+    if (x < 1)
+        fun_l9_n346(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n813(x)
+    if (x < 1)
+        fun_l9_n374(x)
+    else
+        fun_l9_n739(x)
+    end
+end
+
+def fun_l8_n814(x)
+    if (x < 1)
+        fun_l9_n121(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n815(x)
+    if (x < 1)
+        fun_l9_n460(x)
+    else
+        fun_l9_n759(x)
+    end
+end
+
+def fun_l8_n816(x)
+    if (x < 1)
+        fun_l9_n598(x)
+    else
+        fun_l9_n638(x)
+    end
+end
+
+def fun_l8_n817(x)
+    if (x < 1)
+        fun_l9_n986(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n818(x)
+    if (x < 1)
+        fun_l9_n169(x)
+    else
+        fun_l9_n696(x)
+    end
+end
+
+def fun_l8_n819(x)
+    if (x < 1)
+        fun_l9_n885(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n820(x)
+    if (x < 1)
+        fun_l9_n24(x)
+    else
+        fun_l9_n87(x)
+    end
+end
+
+def fun_l8_n821(x)
+    if (x < 1)
+        fun_l9_n59(x)
+    else
+        fun_l9_n843(x)
+    end
+end
+
+def fun_l8_n822(x)
+    if (x < 1)
+        fun_l9_n640(x)
+    else
+        fun_l9_n360(x)
+    end
+end
+
+def fun_l8_n823(x)
+    if (x < 1)
+        fun_l9_n355(x)
+    else
+        fun_l9_n28(x)
+    end
+end
+
+def fun_l8_n824(x)
+    if (x < 1)
+        fun_l9_n553(x)
+    else
+        fun_l9_n475(x)
+    end
+end
+
+def fun_l8_n825(x)
+    if (x < 1)
+        fun_l9_n757(x)
+    else
+        fun_l9_n790(x)
+    end
+end
+
+def fun_l8_n826(x)
+    if (x < 1)
+        fun_l9_n787(x)
+    else
+        fun_l9_n226(x)
+    end
+end
+
+def fun_l8_n827(x)
+    if (x < 1)
+        fun_l9_n622(x)
+    else
+        fun_l9_n711(x)
+    end
+end
+
+def fun_l8_n828(x)
+    if (x < 1)
+        fun_l9_n399(x)
+    else
+        fun_l9_n7(x)
+    end
+end
+
+def fun_l8_n829(x)
+    if (x < 1)
+        fun_l9_n589(x)
+    else
+        fun_l9_n276(x)
+    end
+end
+
+def fun_l8_n830(x)
+    if (x < 1)
+        fun_l9_n83(x)
+    else
+        fun_l9_n126(x)
+    end
+end
+
+def fun_l8_n831(x)
+    if (x < 1)
+        fun_l9_n576(x)
+    else
+        fun_l9_n855(x)
+    end
+end
+
+def fun_l8_n832(x)
+    if (x < 1)
+        fun_l9_n756(x)
+    else
+        fun_l9_n638(x)
+    end
+end
+
+def fun_l8_n833(x)
+    if (x < 1)
+        fun_l9_n388(x)
+    else
+        fun_l9_n154(x)
+    end
+end
+
+def fun_l8_n834(x)
+    if (x < 1)
+        fun_l9_n268(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n835(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n678(x)
+    end
+end
+
+def fun_l8_n836(x)
+    if (x < 1)
+        fun_l9_n537(x)
+    else
+        fun_l9_n984(x)
+    end
+end
+
+def fun_l8_n837(x)
+    if (x < 1)
+        fun_l9_n798(x)
+    else
+        fun_l9_n221(x)
+    end
+end
+
+def fun_l8_n838(x)
+    if (x < 1)
+        fun_l9_n153(x)
+    else
+        fun_l9_n414(x)
+    end
+end
+
+def fun_l8_n839(x)
+    if (x < 1)
+        fun_l9_n904(x)
+    else
+        fun_l9_n847(x)
+    end
+end
+
+def fun_l8_n840(x)
+    if (x < 1)
+        fun_l9_n501(x)
+    else
+        fun_l9_n971(x)
+    end
+end
+
+def fun_l8_n841(x)
+    if (x < 1)
+        fun_l9_n94(x)
+    else
+        fun_l9_n719(x)
+    end
+end
+
+def fun_l8_n842(x)
+    if (x < 1)
+        fun_l9_n343(x)
+    else
+        fun_l9_n365(x)
+    end
+end
+
+def fun_l8_n843(x)
+    if (x < 1)
+        fun_l9_n541(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n844(x)
+    if (x < 1)
+        fun_l9_n122(x)
+    else
+        fun_l9_n662(x)
+    end
+end
+
+def fun_l8_n845(x)
+    if (x < 1)
+        fun_l9_n312(x)
+    else
+        fun_l9_n688(x)
+    end
+end
+
+def fun_l8_n846(x)
+    if (x < 1)
+        fun_l9_n668(x)
+    else
+        fun_l9_n805(x)
+    end
+end
+
+def fun_l8_n847(x)
+    if (x < 1)
+        fun_l9_n785(x)
+    else
+        fun_l9_n917(x)
+    end
+end
+
+def fun_l8_n848(x)
+    if (x < 1)
+        fun_l9_n333(x)
+    else
+        fun_l9_n782(x)
+    end
+end
+
+def fun_l8_n849(x)
+    if (x < 1)
+        fun_l9_n402(x)
+    else
+        fun_l9_n398(x)
+    end
+end
+
+def fun_l8_n850(x)
+    if (x < 1)
+        fun_l9_n708(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n851(x)
+    if (x < 1)
+        fun_l9_n950(x)
+    else
+        fun_l9_n308(x)
+    end
+end
+
+def fun_l8_n852(x)
+    if (x < 1)
+        fun_l9_n524(x)
+    else
+        fun_l9_n411(x)
+    end
+end
+
+def fun_l8_n853(x)
+    if (x < 1)
+        fun_l9_n467(x)
+    else
+        fun_l9_n807(x)
+    end
+end
+
+def fun_l8_n854(x)
+    if (x < 1)
+        fun_l9_n316(x)
+    else
+        fun_l9_n717(x)
+    end
+end
+
+def fun_l8_n855(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n631(x)
+    end
+end
+
+def fun_l8_n856(x)
+    if (x < 1)
+        fun_l9_n244(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n857(x)
+    if (x < 1)
+        fun_l9_n574(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n858(x)
+    if (x < 1)
+        fun_l9_n80(x)
+    else
+        fun_l9_n888(x)
+    end
+end
+
+def fun_l8_n859(x)
+    if (x < 1)
+        fun_l9_n675(x)
+    else
+        fun_l9_n71(x)
+    end
+end
+
+def fun_l8_n860(x)
+    if (x < 1)
+        fun_l9_n375(x)
+    else
+        fun_l9_n507(x)
+    end
+end
+
+def fun_l8_n861(x)
+    if (x < 1)
+        fun_l9_n450(x)
+    else
+        fun_l9_n705(x)
+    end
+end
+
+def fun_l8_n862(x)
+    if (x < 1)
+        fun_l9_n358(x)
+    else
+        fun_l9_n614(x)
+    end
+end
+
+def fun_l8_n863(x)
+    if (x < 1)
+        fun_l9_n690(x)
+    else
+        fun_l9_n73(x)
+    end
+end
+
+def fun_l8_n864(x)
+    if (x < 1)
+        fun_l9_n806(x)
+    else
+        fun_l9_n85(x)
+    end
+end
+
+def fun_l8_n865(x)
+    if (x < 1)
+        fun_l9_n251(x)
+    else
+        fun_l9_n657(x)
+    end
+end
+
+def fun_l8_n866(x)
+    if (x < 1)
+        fun_l9_n921(x)
+    else
+        fun_l9_n199(x)
+    end
+end
+
+def fun_l8_n867(x)
+    if (x < 1)
+        fun_l9_n265(x)
+    else
+        fun_l9_n937(x)
+    end
+end
+
+def fun_l8_n868(x)
+    if (x < 1)
+        fun_l9_n610(x)
+    else
+        fun_l9_n7(x)
+    end
+end
+
+def fun_l8_n869(x)
+    if (x < 1)
+        fun_l9_n703(x)
+    else
+        fun_l9_n74(x)
+    end
+end
+
+def fun_l8_n870(x)
+    if (x < 1)
+        fun_l9_n869(x)
+    else
+        fun_l9_n665(x)
+    end
+end
+
+def fun_l8_n871(x)
+    if (x < 1)
+        fun_l9_n808(x)
+    else
+        fun_l9_n686(x)
+    end
+end
+
+def fun_l8_n872(x)
+    if (x < 1)
+        fun_l9_n678(x)
+    else
+        fun_l9_n709(x)
+    end
+end
+
+def fun_l8_n873(x)
+    if (x < 1)
+        fun_l9_n557(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n874(x)
+    if (x < 1)
+        fun_l9_n214(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n875(x)
+    if (x < 1)
+        fun_l9_n218(x)
+    else
+        fun_l9_n810(x)
+    end
+end
+
+def fun_l8_n876(x)
+    if (x < 1)
+        fun_l9_n365(x)
+    else
+        fun_l9_n257(x)
+    end
+end
+
+def fun_l8_n877(x)
+    if (x < 1)
+        fun_l9_n51(x)
+    else
+        fun_l9_n68(x)
+    end
+end
+
+def fun_l8_n878(x)
+    if (x < 1)
+        fun_l9_n20(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n879(x)
+    if (x < 1)
+        fun_l9_n686(x)
+    else
+        fun_l9_n226(x)
+    end
+end
+
+def fun_l8_n880(x)
+    if (x < 1)
+        fun_l9_n283(x)
+    else
+        fun_l9_n270(x)
+    end
+end
+
+def fun_l8_n881(x)
+    if (x < 1)
+        fun_l9_n811(x)
+    else
+        fun_l9_n820(x)
+    end
+end
+
+def fun_l8_n882(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n919(x)
+    end
+end
+
+def fun_l8_n883(x)
+    if (x < 1)
+        fun_l9_n515(x)
+    else
+        fun_l9_n24(x)
+    end
+end
+
+def fun_l8_n884(x)
+    if (x < 1)
+        fun_l9_n0(x)
+    else
+        fun_l9_n150(x)
+    end
+end
+
+def fun_l8_n885(x)
+    if (x < 1)
+        fun_l9_n481(x)
+    else
+        fun_l9_n65(x)
+    end
+end
+
+def fun_l8_n886(x)
+    if (x < 1)
+        fun_l9_n252(x)
+    else
+        fun_l9_n544(x)
+    end
+end
+
+def fun_l8_n887(x)
+    if (x < 1)
+        fun_l9_n635(x)
+    else
+        fun_l9_n402(x)
+    end
+end
+
+def fun_l8_n888(x)
+    if (x < 1)
+        fun_l9_n78(x)
+    else
+        fun_l9_n779(x)
+    end
+end
+
+def fun_l8_n889(x)
+    if (x < 1)
+        fun_l9_n249(x)
+    else
+        fun_l9_n331(x)
+    end
+end
+
+def fun_l8_n890(x)
+    if (x < 1)
+        fun_l9_n914(x)
+    else
+        fun_l9_n115(x)
+    end
+end
+
+def fun_l8_n891(x)
+    if (x < 1)
+        fun_l9_n832(x)
+    else
+        fun_l9_n34(x)
+    end
+end
+
+def fun_l8_n892(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n620(x)
+    end
+end
+
+def fun_l8_n893(x)
+    if (x < 1)
+        fun_l9_n360(x)
+    else
+        fun_l9_n189(x)
+    end
+end
+
+def fun_l8_n894(x)
+    if (x < 1)
+        fun_l9_n736(x)
+    else
+        fun_l9_n949(x)
+    end
+end
+
+def fun_l8_n895(x)
+    if (x < 1)
+        fun_l9_n56(x)
+    else
+        fun_l9_n826(x)
+    end
+end
+
+def fun_l8_n896(x)
+    if (x < 1)
+        fun_l9_n159(x)
+    else
+        fun_l9_n523(x)
+    end
+end
+
+def fun_l8_n897(x)
+    if (x < 1)
+        fun_l9_n630(x)
+    else
+        fun_l9_n601(x)
+    end
+end
+
+def fun_l8_n898(x)
+    if (x < 1)
+        fun_l9_n434(x)
+    else
+        fun_l9_n919(x)
+    end
+end
+
+def fun_l8_n899(x)
+    if (x < 1)
+        fun_l9_n872(x)
+    else
+        fun_l9_n652(x)
+    end
+end
+
+def fun_l8_n900(x)
+    if (x < 1)
+        fun_l9_n550(x)
+    else
+        fun_l9_n124(x)
+    end
+end
+
+def fun_l8_n901(x)
+    if (x < 1)
+        fun_l9_n56(x)
+    else
+        fun_l9_n422(x)
+    end
+end
+
+def fun_l8_n902(x)
+    if (x < 1)
+        fun_l9_n297(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n903(x)
+    if (x < 1)
+        fun_l9_n764(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n904(x)
+    if (x < 1)
+        fun_l9_n700(x)
+    else
+        fun_l9_n525(x)
+    end
+end
+
+def fun_l8_n905(x)
+    if (x < 1)
+        fun_l9_n370(x)
+    else
+        fun_l9_n871(x)
+    end
+end
+
+def fun_l8_n906(x)
+    if (x < 1)
+        fun_l9_n385(x)
+    else
+        fun_l9_n999(x)
+    end
+end
+
+def fun_l8_n907(x)
+    if (x < 1)
+        fun_l9_n63(x)
+    else
+        fun_l9_n137(x)
+    end
+end
+
+def fun_l8_n908(x)
+    if (x < 1)
+        fun_l9_n793(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n909(x)
+    if (x < 1)
+        fun_l9_n141(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n910(x)
+    if (x < 1)
+        fun_l9_n764(x)
+    else
+        fun_l9_n334(x)
+    end
+end
+
+def fun_l8_n911(x)
+    if (x < 1)
+        fun_l9_n429(x)
+    else
+        fun_l9_n309(x)
+    end
+end
+
+def fun_l8_n912(x)
+    if (x < 1)
+        fun_l9_n852(x)
+    else
+        fun_l9_n662(x)
+    end
+end
+
+def fun_l8_n913(x)
+    if (x < 1)
+        fun_l9_n467(x)
+    else
+        fun_l9_n817(x)
+    end
+end
+
+def fun_l8_n914(x)
+    if (x < 1)
+        fun_l9_n318(x)
+    else
+        fun_l9_n942(x)
+    end
+end
+
+def fun_l8_n915(x)
+    if (x < 1)
+        fun_l9_n442(x)
+    else
+        fun_l9_n987(x)
+    end
+end
+
+def fun_l8_n916(x)
+    if (x < 1)
+        fun_l9_n657(x)
+    else
+        fun_l9_n736(x)
+    end
+end
+
+def fun_l8_n917(x)
+    if (x < 1)
+        fun_l9_n839(x)
+    else
+        fun_l9_n897(x)
+    end
+end
+
+def fun_l8_n918(x)
+    if (x < 1)
+        fun_l9_n659(x)
+    else
+        fun_l9_n766(x)
+    end
+end
+
+def fun_l8_n919(x)
+    if (x < 1)
+        fun_l9_n523(x)
+    else
+        fun_l9_n54(x)
+    end
+end
+
+def fun_l8_n920(x)
+    if (x < 1)
+        fun_l9_n298(x)
+    else
+        fun_l9_n169(x)
+    end
+end
+
+def fun_l8_n921(x)
+    if (x < 1)
+        fun_l9_n752(x)
+    else
+        fun_l9_n281(x)
+    end
+end
+
+def fun_l8_n922(x)
+    if (x < 1)
+        fun_l9_n703(x)
+    else
+        fun_l9_n874(x)
+    end
+end
+
+def fun_l8_n923(x)
+    if (x < 1)
+        fun_l9_n218(x)
+    else
+        fun_l9_n880(x)
+    end
+end
+
+def fun_l8_n924(x)
+    if (x < 1)
+        fun_l9_n699(x)
+    else
+        fun_l9_n357(x)
+    end
+end
+
+def fun_l8_n925(x)
+    if (x < 1)
+        fun_l9_n279(x)
+    else
+        fun_l9_n300(x)
+    end
+end
+
+def fun_l8_n926(x)
+    if (x < 1)
+        fun_l9_n955(x)
+    else
+        fun_l9_n522(x)
+    end
+end
+
+def fun_l8_n927(x)
+    if (x < 1)
+        fun_l9_n943(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n928(x)
+    if (x < 1)
+        fun_l9_n828(x)
+    else
+        fun_l9_n658(x)
+    end
+end
+
+def fun_l8_n929(x)
+    if (x < 1)
+        fun_l9_n160(x)
+    else
+        fun_l9_n536(x)
+    end
+end
+
+def fun_l8_n930(x)
+    if (x < 1)
+        fun_l9_n422(x)
+    else
+        fun_l9_n848(x)
+    end
+end
+
+def fun_l8_n931(x)
+    if (x < 1)
+        fun_l9_n66(x)
+    else
+        fun_l9_n298(x)
+    end
+end
+
+def fun_l8_n932(x)
+    if (x < 1)
+        fun_l9_n871(x)
+    else
+        fun_l9_n443(x)
+    end
+end
+
+def fun_l8_n933(x)
+    if (x < 1)
+        fun_l9_n876(x)
+    else
+        fun_l9_n459(x)
+    end
+end
+
+def fun_l8_n934(x)
+    if (x < 1)
+        fun_l9_n319(x)
+    else
+        fun_l9_n921(x)
+    end
+end
+
+def fun_l8_n935(x)
+    if (x < 1)
+        fun_l9_n741(x)
+    else
+        fun_l9_n659(x)
+    end
+end
+
+def fun_l8_n936(x)
+    if (x < 1)
+        fun_l9_n713(x)
+    else
+        fun_l9_n800(x)
+    end
+end
+
+def fun_l8_n937(x)
+    if (x < 1)
+        fun_l9_n945(x)
+    else
+        fun_l9_n548(x)
+    end
+end
+
+def fun_l8_n938(x)
+    if (x < 1)
+        fun_l9_n732(x)
+    else
+        fun_l9_n10(x)
+    end
+end
+
+def fun_l8_n939(x)
+    if (x < 1)
+        fun_l9_n5(x)
+    else
+        fun_l9_n864(x)
+    end
+end
+
+def fun_l8_n940(x)
+    if (x < 1)
+        fun_l9_n353(x)
+    else
+        fun_l9_n46(x)
+    end
+end
+
+def fun_l8_n941(x)
+    if (x < 1)
+        fun_l9_n622(x)
+    else
+        fun_l9_n430(x)
+    end
+end
+
+def fun_l8_n942(x)
+    if (x < 1)
+        fun_l9_n120(x)
+    else
+        fun_l9_n265(x)
+    end
+end
+
+def fun_l8_n943(x)
+    if (x < 1)
+        fun_l9_n272(x)
+    else
+        fun_l9_n290(x)
+    end
+end
+
+def fun_l8_n944(x)
+    if (x < 1)
+        fun_l9_n527(x)
+    else
+        fun_l9_n830(x)
+    end
+end
+
+def fun_l8_n945(x)
+    if (x < 1)
+        fun_l9_n202(x)
+    else
+        fun_l9_n597(x)
+    end
+end
+
+def fun_l8_n946(x)
+    if (x < 1)
+        fun_l9_n797(x)
+    else
+        fun_l9_n984(x)
+    end
+end
+
+def fun_l8_n947(x)
+    if (x < 1)
+        fun_l9_n3(x)
+    else
+        fun_l9_n173(x)
+    end
+end
+
+def fun_l8_n948(x)
+    if (x < 1)
+        fun_l9_n658(x)
+    else
+        fun_l9_n48(x)
+    end
+end
+
+def fun_l8_n949(x)
+    if (x < 1)
+        fun_l9_n302(x)
+    else
+        fun_l9_n549(x)
+    end
+end
+
+def fun_l8_n950(x)
+    if (x < 1)
+        fun_l9_n450(x)
+    else
+        fun_l9_n442(x)
+    end
+end
+
+def fun_l8_n951(x)
+    if (x < 1)
+        fun_l9_n32(x)
+    else
+        fun_l9_n287(x)
+    end
+end
+
+def fun_l8_n952(x)
+    if (x < 1)
+        fun_l9_n427(x)
+    else
+        fun_l9_n67(x)
+    end
+end
+
+def fun_l8_n953(x)
+    if (x < 1)
+        fun_l9_n153(x)
+    else
+        fun_l9_n748(x)
+    end
+end
+
+def fun_l8_n954(x)
+    if (x < 1)
+        fun_l9_n528(x)
+    else
+        fun_l9_n754(x)
+    end
+end
+
+def fun_l8_n955(x)
+    if (x < 1)
+        fun_l9_n722(x)
+    else
+        fun_l9_n982(x)
+    end
+end
+
+def fun_l8_n956(x)
+    if (x < 1)
+        fun_l9_n857(x)
+    else
+        fun_l9_n286(x)
+    end
+end
+
+def fun_l8_n957(x)
+    if (x < 1)
+        fun_l9_n579(x)
+    else
+        fun_l9_n830(x)
+    end
+end
+
+def fun_l8_n958(x)
+    if (x < 1)
+        fun_l9_n913(x)
+    else
+        fun_l9_n918(x)
+    end
+end
+
+def fun_l8_n959(x)
+    if (x < 1)
+        fun_l9_n575(x)
+    else
+        fun_l9_n441(x)
+    end
+end
+
+def fun_l8_n960(x)
+    if (x < 1)
+        fun_l9_n774(x)
+    else
+        fun_l9_n426(x)
+    end
+end
+
+def fun_l8_n961(x)
+    if (x < 1)
+        fun_l9_n415(x)
+    else
+        fun_l9_n720(x)
+    end
+end
+
+def fun_l8_n962(x)
+    if (x < 1)
+        fun_l9_n187(x)
+    else
+        fun_l9_n101(x)
+    end
+end
+
+def fun_l8_n963(x)
+    if (x < 1)
+        fun_l9_n146(x)
+    else
+        fun_l9_n911(x)
+    end
+end
+
+def fun_l8_n964(x)
+    if (x < 1)
+        fun_l9_n758(x)
+    else
+        fun_l9_n46(x)
+    end
+end
+
+def fun_l8_n965(x)
+    if (x < 1)
+        fun_l9_n316(x)
+    else
+        fun_l9_n874(x)
+    end
+end
+
+def fun_l8_n966(x)
+    if (x < 1)
+        fun_l9_n604(x)
+    else
+        fun_l9_n933(x)
+    end
+end
+
+def fun_l8_n967(x)
+    if (x < 1)
+        fun_l9_n185(x)
+    else
+        fun_l9_n729(x)
+    end
+end
+
+def fun_l8_n968(x)
+    if (x < 1)
+        fun_l9_n735(x)
+    else
+        fun_l9_n347(x)
+    end
+end
+
+def fun_l8_n969(x)
+    if (x < 1)
+        fun_l9_n796(x)
+    else
+        fun_l9_n163(x)
+    end
+end
+
+def fun_l8_n970(x)
+    if (x < 1)
+        fun_l9_n535(x)
+    else
+        fun_l9_n184(x)
+    end
+end
+
+def fun_l8_n971(x)
+    if (x < 1)
+        fun_l9_n919(x)
+    else
+        fun_l9_n838(x)
+    end
+end
+
+def fun_l8_n972(x)
+    if (x < 1)
+        fun_l9_n296(x)
+    else
+        fun_l9_n822(x)
+    end
+end
+
+def fun_l8_n973(x)
+    if (x < 1)
+        fun_l9_n503(x)
+    else
+        fun_l9_n979(x)
+    end
+end
+
+def fun_l8_n974(x)
+    if (x < 1)
+        fun_l9_n598(x)
+    else
+        fun_l9_n916(x)
+    end
+end
+
+def fun_l8_n975(x)
+    if (x < 1)
+        fun_l9_n119(x)
+    else
+        fun_l9_n138(x)
+    end
+end
+
+def fun_l8_n976(x)
+    if (x < 1)
+        fun_l9_n92(x)
+    else
+        fun_l9_n244(x)
+    end
+end
+
+def fun_l8_n977(x)
+    if (x < 1)
+        fun_l9_n250(x)
+    else
+        fun_l9_n496(x)
+    end
+end
+
+def fun_l8_n978(x)
+    if (x < 1)
+        fun_l9_n665(x)
+    else
+        fun_l9_n617(x)
+    end
+end
+
+def fun_l8_n979(x)
+    if (x < 1)
+        fun_l9_n212(x)
+    else
+        fun_l9_n63(x)
+    end
+end
+
+def fun_l8_n980(x)
+    if (x < 1)
+        fun_l9_n304(x)
+    else
+        fun_l9_n373(x)
+    end
+end
+
+def fun_l8_n981(x)
+    if (x < 1)
+        fun_l9_n70(x)
+    else
+        fun_l9_n194(x)
+    end
+end
+
+def fun_l8_n982(x)
+    if (x < 1)
+        fun_l9_n996(x)
+    else
+        fun_l9_n821(x)
+    end
+end
+
+def fun_l8_n983(x)
+    if (x < 1)
+        fun_l9_n109(x)
+    else
+        fun_l9_n926(x)
+    end
+end
+
+def fun_l8_n984(x)
+    if (x < 1)
+        fun_l9_n342(x)
+    else
+        fun_l9_n768(x)
+    end
+end
+
+def fun_l8_n985(x)
+    if (x < 1)
+        fun_l9_n12(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n986(x)
+    if (x < 1)
+        fun_l9_n663(x)
+    else
+        fun_l9_n963(x)
+    end
+end
+
+def fun_l8_n987(x)
+    if (x < 1)
+        fun_l9_n108(x)
+    else
+        fun_l9_n139(x)
+    end
+end
+
+def fun_l8_n988(x)
+    if (x < 1)
+        fun_l9_n256(x)
+    else
+        fun_l9_n55(x)
+    end
+end
+
+def fun_l8_n989(x)
+    if (x < 1)
+        fun_l9_n261(x)
+    else
+        fun_l9_n962(x)
+    end
+end
+
+def fun_l8_n990(x)
+    if (x < 1)
+        fun_l9_n581(x)
+    else
+        fun_l9_n558(x)
+    end
+end
+
+def fun_l8_n991(x)
+    if (x < 1)
+        fun_l9_n379(x)
+    else
+        fun_l9_n179(x)
+    end
+end
+
+def fun_l8_n992(x)
+    if (x < 1)
+        fun_l9_n256(x)
+    else
+        fun_l9_n158(x)
+    end
+end
+
+def fun_l8_n993(x)
+    if (x < 1)
+        fun_l9_n75(x)
+    else
+        fun_l9_n669(x)
+    end
+end
+
+def fun_l8_n994(x)
+    if (x < 1)
+        fun_l9_n1(x)
+    else
+        fun_l9_n723(x)
+    end
+end
+
+def fun_l8_n995(x)
+    if (x < 1)
+        fun_l9_n52(x)
+    else
+        fun_l9_n706(x)
+    end
+end
+
+def fun_l8_n996(x)
+    if (x < 1)
+        fun_l9_n583(x)
+    else
+        fun_l9_n769(x)
+    end
+end
+
+def fun_l8_n997(x)
+    if (x < 1)
+        fun_l9_n91(x)
+    else
+        fun_l9_n86(x)
+    end
+end
+
+def fun_l8_n998(x)
+    if (x < 1)
+        fun_l9_n605(x)
+    else
+        fun_l9_n106(x)
+    end
+end
+
+def fun_l8_n999(x)
+    if (x < 1)
+        fun_l9_n634(x)
+    else
+        fun_l9_n110(x)
+    end
+end
+
+def fun_l9_n0(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n168(x)
+    end
+end
+
+def fun_l9_n1(x)
+    if (x < 1)
+        fun_l10_n523(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n2(x)
+    if (x < 1)
+        fun_l10_n869(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n3(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n4(x)
+    if (x < 1)
+        fun_l10_n8(x)
+    else
+        fun_l10_n984(x)
+    end
+end
+
+def fun_l9_n5(x)
+    if (x < 1)
+        fun_l10_n757(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n6(x)
+    if (x < 1)
+        fun_l10_n131(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n7(x)
+    if (x < 1)
+        fun_l10_n292(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n8(x)
+    if (x < 1)
+        fun_l10_n237(x)
+    else
+        fun_l10_n439(x)
+    end
+end
+
+def fun_l9_n9(x)
+    if (x < 1)
+        fun_l10_n99(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n10(x)
+    if (x < 1)
+        fun_l10_n702(x)
+    else
+        fun_l10_n983(x)
+    end
+end
+
+def fun_l9_n11(x)
+    if (x < 1)
+        fun_l10_n843(x)
+    else
+        fun_l10_n774(x)
+    end
+end
+
+def fun_l9_n12(x)
+    if (x < 1)
+        fun_l10_n720(x)
+    else
+        fun_l10_n238(x)
+    end
+end
+
+def fun_l9_n13(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n613(x)
+    end
+end
+
+def fun_l9_n14(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n15(x)
+    if (x < 1)
+        fun_l10_n542(x)
+    else
+        fun_l10_n90(x)
+    end
+end
+
+def fun_l9_n16(x)
+    if (x < 1)
+        fun_l10_n931(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n17(x)
+    if (x < 1)
+        fun_l10_n568(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n18(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n245(x)
+    end
+end
+
+def fun_l9_n19(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n644(x)
+    end
+end
+
+def fun_l9_n20(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n21(x)
+    if (x < 1)
+        fun_l10_n84(x)
+    else
+        fun_l10_n821(x)
+    end
+end
+
+def fun_l9_n22(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n23(x)
+    if (x < 1)
+        fun_l10_n591(x)
+    else
+        fun_l10_n443(x)
+    end
+end
+
+def fun_l9_n24(x)
+    if (x < 1)
+        fun_l10_n105(x)
+    else
+        fun_l10_n652(x)
+    end
+end
+
+def fun_l9_n25(x)
+    if (x < 1)
+        fun_l10_n495(x)
+    else
+        fun_l10_n185(x)
+    end
+end
+
+def fun_l9_n26(x)
+    if (x < 1)
+        fun_l10_n160(x)
+    else
+        fun_l10_n77(x)
+    end
+end
+
+def fun_l9_n27(x)
+    if (x < 1)
+        fun_l10_n307(x)
+    else
+        fun_l10_n813(x)
+    end
+end
+
+def fun_l9_n28(x)
+    if (x < 1)
+        fun_l10_n651(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n29(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n995(x)
+    end
+end
+
+def fun_l9_n30(x)
+    if (x < 1)
+        fun_l10_n52(x)
+    else
+        fun_l10_n846(x)
+    end
+end
+
+def fun_l9_n31(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n758(x)
+    end
+end
+
+def fun_l9_n32(x)
+    if (x < 1)
+        fun_l10_n675(x)
+    else
+        fun_l10_n240(x)
+    end
+end
+
+def fun_l9_n33(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n826(x)
+    end
+end
+
+def fun_l9_n34(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n35(x)
+    if (x < 1)
+        fun_l10_n28(x)
+    else
+        fun_l10_n870(x)
+    end
+end
+
+def fun_l9_n36(x)
+    if (x < 1)
+        fun_l10_n275(x)
+    else
+        fun_l10_n376(x)
+    end
+end
+
+def fun_l9_n37(x)
+    if (x < 1)
+        fun_l10_n852(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n38(x)
+    if (x < 1)
+        fun_l10_n608(x)
+    else
+        fun_l10_n740(x)
+    end
+end
+
+def fun_l9_n39(x)
+    if (x < 1)
+        fun_l10_n856(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n40(x)
+    if (x < 1)
+        fun_l10_n979(x)
+    else
+        fun_l10_n37(x)
+    end
+end
+
+def fun_l9_n41(x)
+    if (x < 1)
+        fun_l10_n752(x)
+    else
+        fun_l10_n94(x)
+    end
+end
+
+def fun_l9_n42(x)
+    if (x < 1)
+        fun_l10_n653(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n43(x)
+    if (x < 1)
+        fun_l10_n860(x)
+    else
+        fun_l10_n658(x)
+    end
+end
+
+def fun_l9_n44(x)
+    if (x < 1)
+        fun_l10_n952(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n45(x)
+    if (x < 1)
+        fun_l10_n70(x)
+    else
+        fun_l10_n297(x)
+    end
+end
+
+def fun_l9_n46(x)
+    if (x < 1)
+        fun_l10_n100(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n47(x)
+    if (x < 1)
+        fun_l10_n746(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n48(x)
+    if (x < 1)
+        fun_l10_n341(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n49(x)
+    if (x < 1)
+        fun_l10_n317(x)
+    else
+        fun_l10_n607(x)
+    end
+end
+
+def fun_l9_n50(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n499(x)
+    end
+end
+
+def fun_l9_n51(x)
+    if (x < 1)
+        fun_l10_n936(x)
+    else
+        fun_l10_n387(x)
+    end
+end
+
+def fun_l9_n52(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n734(x)
+    end
+end
+
+def fun_l9_n53(x)
+    if (x < 1)
+        fun_l10_n523(x)
+    else
+        fun_l10_n532(x)
+    end
+end
+
+def fun_l9_n54(x)
+    if (x < 1)
+        fun_l10_n847(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n55(x)
+    if (x < 1)
+        fun_l10_n378(x)
+    else
+        fun_l10_n226(x)
+    end
+end
+
+def fun_l9_n56(x)
+    if (x < 1)
+        fun_l10_n55(x)
+    else
+        fun_l10_n823(x)
+    end
+end
+
+def fun_l9_n57(x)
+    if (x < 1)
+        fun_l10_n931(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n58(x)
+    if (x < 1)
+        fun_l10_n603(x)
+    else
+        fun_l10_n746(x)
+    end
+end
+
+def fun_l9_n59(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n196(x)
+    end
+end
+
+def fun_l9_n60(x)
+    if (x < 1)
+        fun_l10_n45(x)
+    else
+        fun_l10_n907(x)
+    end
+end
+
+def fun_l9_n61(x)
+    if (x < 1)
+        fun_l10_n282(x)
+    else
+        fun_l10_n478(x)
+    end
+end
+
+def fun_l9_n62(x)
+    if (x < 1)
+        fun_l10_n558(x)
+    else
+        fun_l10_n354(x)
+    end
+end
+
+def fun_l9_n63(x)
+    if (x < 1)
+        fun_l10_n729(x)
+    else
+        fun_l10_n275(x)
+    end
+end
+
+def fun_l9_n64(x)
+    if (x < 1)
+        fun_l10_n804(x)
+    else
+        fun_l10_n873(x)
+    end
+end
+
+def fun_l9_n65(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n66(x)
+    if (x < 1)
+        fun_l10_n542(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n67(x)
+    if (x < 1)
+        fun_l10_n112(x)
+    else
+        fun_l10_n48(x)
+    end
+end
+
+def fun_l9_n68(x)
+    if (x < 1)
+        fun_l10_n78(x)
+    else
+        fun_l10_n50(x)
+    end
+end
+
+def fun_l9_n69(x)
+    if (x < 1)
+        fun_l10_n595(x)
+    else
+        fun_l10_n163(x)
+    end
+end
+
+def fun_l9_n70(x)
+    if (x < 1)
+        fun_l10_n839(x)
+    else
+        fun_l10_n811(x)
+    end
+end
+
+def fun_l9_n71(x)
+    if (x < 1)
+        fun_l10_n704(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n72(x)
+    if (x < 1)
+        fun_l10_n708(x)
+    else
+        fun_l10_n711(x)
+    end
+end
+
+def fun_l9_n73(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n74(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n415(x)
+    end
+end
+
+def fun_l9_n75(x)
+    if (x < 1)
+        fun_l10_n191(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n76(x)
+    if (x < 1)
+        fun_l10_n163(x)
+    else
+        fun_l10_n246(x)
+    end
+end
+
+def fun_l9_n77(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n80(x)
+    end
+end
+
+def fun_l9_n78(x)
+    if (x < 1)
+        fun_l10_n178(x)
+    else
+        fun_l10_n698(x)
+    end
+end
+
+def fun_l9_n79(x)
+    if (x < 1)
+        fun_l10_n150(x)
+    else
+        fun_l10_n545(x)
+    end
+end
+
+def fun_l9_n80(x)
+    if (x < 1)
+        fun_l10_n808(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n81(x)
+    if (x < 1)
+        fun_l10_n597(x)
+    else
+        fun_l10_n908(x)
+    end
+end
+
+def fun_l9_n82(x)
+    if (x < 1)
+        fun_l10_n868(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n83(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n281(x)
+    end
+end
+
+def fun_l9_n84(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n85(x)
+    if (x < 1)
+        fun_l10_n828(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n86(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n283(x)
+    end
+end
+
+def fun_l9_n87(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n157(x)
+    end
+end
+
+def fun_l9_n88(x)
+    if (x < 1)
+        fun_l10_n576(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n89(x)
+    if (x < 1)
+        fun_l10_n633(x)
+    else
+        fun_l10_n43(x)
+    end
+end
+
+def fun_l9_n90(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n91(x)
+    if (x < 1)
+        fun_l10_n656(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n92(x)
+    if (x < 1)
+        fun_l10_n366(x)
+    else
+        fun_l10_n613(x)
+    end
+end
+
+def fun_l9_n93(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n250(x)
+    end
+end
+
+def fun_l9_n94(x)
+    if (x < 1)
+        fun_l10_n911(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n95(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n334(x)
+    end
+end
+
+def fun_l9_n96(x)
+    if (x < 1)
+        fun_l10_n473(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n97(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n80(x)
+    end
+end
+
+def fun_l9_n98(x)
+    if (x < 1)
+        fun_l10_n46(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n99(x)
+    if (x < 1)
+        fun_l10_n294(x)
+    else
+        fun_l10_n615(x)
+    end
+end
+
+def fun_l9_n100(x)
+    if (x < 1)
+        fun_l10_n286(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n101(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n498(x)
+    end
+end
+
+def fun_l9_n102(x)
+    if (x < 1)
+        fun_l10_n700(x)
+    else
+        fun_l10_n35(x)
+    end
+end
+
+def fun_l9_n103(x)
+    if (x < 1)
+        fun_l10_n225(x)
+    else
+        fun_l10_n206(x)
+    end
+end
+
+def fun_l9_n104(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n679(x)
+    end
+end
+
+def fun_l9_n105(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n449(x)
+    end
+end
+
+def fun_l9_n106(x)
+    if (x < 1)
+        fun_l10_n125(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n107(x)
+    if (x < 1)
+        fun_l10_n642(x)
+    else
+        fun_l10_n988(x)
+    end
+end
+
+def fun_l9_n108(x)
+    if (x < 1)
+        fun_l10_n952(x)
+    else
+        fun_l10_n436(x)
+    end
+end
+
+def fun_l9_n109(x)
+    if (x < 1)
+        fun_l10_n955(x)
+    else
+        fun_l10_n380(x)
+    end
+end
+
+def fun_l9_n110(x)
+    if (x < 1)
+        fun_l10_n813(x)
+    else
+        fun_l10_n837(x)
+    end
+end
+
+def fun_l9_n111(x)
+    if (x < 1)
+        fun_l10_n471(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n112(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n665(x)
+    end
+end
+
+def fun_l9_n113(x)
+    if (x < 1)
+        fun_l10_n485(x)
+    else
+        fun_l10_n276(x)
+    end
+end
+
+def fun_l9_n114(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n457(x)
+    end
+end
+
+def fun_l9_n115(x)
+    if (x < 1)
+        fun_l10_n106(x)
+    else
+        fun_l10_n555(x)
+    end
+end
+
+def fun_l9_n116(x)
+    if (x < 1)
+        fun_l10_n231(x)
+    else
+        fun_l10_n163(x)
+    end
+end
+
+def fun_l9_n117(x)
+    if (x < 1)
+        fun_l10_n569(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n118(x)
+    if (x < 1)
+        fun_l10_n946(x)
+    else
+        fun_l10_n174(x)
+    end
+end
+
+def fun_l9_n119(x)
+    if (x < 1)
+        fun_l10_n716(x)
+    else
+        fun_l10_n882(x)
+    end
+end
+
+def fun_l9_n120(x)
+    if (x < 1)
+        fun_l10_n628(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n121(x)
+    if (x < 1)
+        fun_l10_n699(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n122(x)
+    if (x < 1)
+        fun_l10_n180(x)
+    else
+        fun_l10_n98(x)
+    end
+end
+
+def fun_l9_n123(x)
+    if (x < 1)
+        fun_l10_n177(x)
+    else
+        fun_l10_n635(x)
+    end
+end
+
+def fun_l9_n124(x)
+    if (x < 1)
+        fun_l10_n398(x)
+    else
+        fun_l10_n121(x)
+    end
+end
+
+def fun_l9_n125(x)
+    if (x < 1)
+        fun_l10_n866(x)
+    else
+        fun_l10_n595(x)
+    end
+end
+
+def fun_l9_n126(x)
+    if (x < 1)
+        fun_l10_n9(x)
+    else
+        fun_l10_n901(x)
+    end
+end
+
+def fun_l9_n127(x)
+    if (x < 1)
+        fun_l10_n579(x)
+    else
+        fun_l10_n640(x)
+    end
+end
+
+def fun_l9_n128(x)
+    if (x < 1)
+        fun_l10_n884(x)
+    else
+        fun_l10_n327(x)
+    end
+end
+
+def fun_l9_n129(x)
+    if (x < 1)
+        fun_l10_n553(x)
+    else
+        fun_l10_n73(x)
+    end
+end
+
+def fun_l9_n130(x)
+    if (x < 1)
+        fun_l10_n372(x)
+    else
+        fun_l10_n450(x)
+    end
+end
+
+def fun_l9_n131(x)
+    if (x < 1)
+        fun_l10_n748(x)
+    else
+        fun_l10_n534(x)
+    end
+end
+
+def fun_l9_n132(x)
+    if (x < 1)
+        fun_l10_n529(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n133(x)
+    if (x < 1)
+        fun_l10_n24(x)
+    else
+        fun_l10_n677(x)
+    end
+end
+
+def fun_l9_n134(x)
+    if (x < 1)
+        fun_l10_n4(x)
+    else
+        fun_l10_n482(x)
+    end
+end
+
+def fun_l9_n135(x)
+    if (x < 1)
+        fun_l10_n314(x)
+    else
+        fun_l10_n509(x)
+    end
+end
+
+def fun_l9_n136(x)
+    if (x < 1)
+        fun_l10_n160(x)
+    else
+        fun_l10_n342(x)
+    end
+end
+
+def fun_l9_n137(x)
+    if (x < 1)
+        fun_l10_n289(x)
+    else
+        fun_l10_n910(x)
+    end
+end
+
+def fun_l9_n138(x)
+    if (x < 1)
+        fun_l10_n926(x)
+    else
+        fun_l10_n752(x)
+    end
+end
+
+def fun_l9_n139(x)
+    if (x < 1)
+        fun_l10_n303(x)
+    else
+        fun_l10_n399(x)
+    end
+end
+
+def fun_l9_n140(x)
+    if (x < 1)
+        fun_l10_n11(x)
+    else
+        fun_l10_n241(x)
+    end
+end
+
+def fun_l9_n141(x)
+    if (x < 1)
+        fun_l10_n528(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n142(x)
+    if (x < 1)
+        fun_l10_n572(x)
+    else
+        fun_l10_n132(x)
+    end
+end
+
+def fun_l9_n143(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n712(x)
+    end
+end
+
+def fun_l9_n144(x)
+    if (x < 1)
+        fun_l10_n662(x)
+    else
+        fun_l10_n128(x)
+    end
+end
+
+def fun_l9_n145(x)
+    if (x < 1)
+        fun_l10_n668(x)
+    else
+        fun_l10_n483(x)
+    end
+end
+
+def fun_l9_n146(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n330(x)
+    end
+end
+
+def fun_l9_n147(x)
+    if (x < 1)
+        fun_l10_n103(x)
+    else
+        fun_l10_n859(x)
+    end
+end
+
+def fun_l9_n148(x)
+    if (x < 1)
+        fun_l10_n129(x)
+    else
+        fun_l10_n628(x)
+    end
+end
+
+def fun_l9_n149(x)
+    if (x < 1)
+        fun_l10_n898(x)
+    else
+        fun_l10_n984(x)
+    end
+end
+
+def fun_l9_n150(x)
+    if (x < 1)
+        fun_l10_n574(x)
+    else
+        fun_l10_n59(x)
+    end
+end
+
+def fun_l9_n151(x)
+    if (x < 1)
+        fun_l10_n759(x)
+    else
+        fun_l10_n782(x)
+    end
+end
+
+def fun_l9_n152(x)
+    if (x < 1)
+        fun_l10_n588(x)
+    else
+        fun_l10_n383(x)
+    end
+end
+
+def fun_l9_n153(x)
+    if (x < 1)
+        fun_l10_n889(x)
+    else
+        fun_l10_n628(x)
+    end
+end
+
+def fun_l9_n154(x)
+    if (x < 1)
+        fun_l10_n376(x)
+    else
+        fun_l10_n442(x)
+    end
+end
+
+def fun_l9_n155(x)
+    if (x < 1)
+        fun_l10_n497(x)
+    else
+        fun_l10_n269(x)
+    end
+end
+
+def fun_l9_n156(x)
+    if (x < 1)
+        fun_l10_n976(x)
+    else
+        fun_l10_n829(x)
+    end
+end
+
+def fun_l9_n157(x)
+    if (x < 1)
+        fun_l10_n366(x)
+    else
+        fun_l10_n416(x)
+    end
+end
+
+def fun_l9_n158(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n19(x)
+    end
+end
+
+def fun_l9_n159(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n129(x)
+    end
+end
+
+def fun_l9_n160(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n385(x)
+    end
+end
+
+def fun_l9_n161(x)
+    if (x < 1)
+        fun_l10_n626(x)
+    else
+        fun_l10_n686(x)
+    end
+end
+
+def fun_l9_n162(x)
+    if (x < 1)
+        fun_l10_n165(x)
+    else
+        fun_l10_n922(x)
+    end
+end
+
+def fun_l9_n163(x)
+    if (x < 1)
+        fun_l10_n670(x)
+    else
+        fun_l10_n889(x)
+    end
+end
+
+def fun_l9_n164(x)
+    if (x < 1)
+        fun_l10_n346(x)
+    else
+        fun_l10_n292(x)
+    end
+end
+
+def fun_l9_n165(x)
+    if (x < 1)
+        fun_l10_n812(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n166(x)
+    if (x < 1)
+        fun_l10_n21(x)
+    else
+        fun_l10_n641(x)
+    end
+end
+
+def fun_l9_n167(x)
+    if (x < 1)
+        fun_l10_n268(x)
+    else
+        fun_l10_n943(x)
+    end
+end
+
+def fun_l9_n168(x)
+    if (x < 1)
+        fun_l10_n349(x)
+    else
+        fun_l10_n620(x)
+    end
+end
+
+def fun_l9_n169(x)
+    if (x < 1)
+        fun_l10_n894(x)
+    else
+        fun_l10_n625(x)
+    end
+end
+
+def fun_l9_n170(x)
+    if (x < 1)
+        fun_l10_n732(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n171(x)
+    if (x < 1)
+        fun_l10_n272(x)
+    else
+        fun_l10_n148(x)
+    end
+end
+
+def fun_l9_n172(x)
+    if (x < 1)
+        fun_l10_n701(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n173(x)
+    if (x < 1)
+        fun_l10_n833(x)
+    else
+        fun_l10_n853(x)
+    end
+end
+
+def fun_l9_n174(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n314(x)
+    end
+end
+
+def fun_l9_n175(x)
+    if (x < 1)
+        fun_l10_n217(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n176(x)
+    if (x < 1)
+        fun_l10_n204(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n177(x)
+    if (x < 1)
+        fun_l10_n130(x)
+    else
+        fun_l10_n829(x)
+    end
+end
+
+def fun_l9_n178(x)
+    if (x < 1)
+        fun_l10_n260(x)
+    else
+        fun_l10_n881(x)
+    end
+end
+
+def fun_l9_n179(x)
+    if (x < 1)
+        fun_l10_n728(x)
+    else
+        fun_l10_n491(x)
+    end
+end
+
+def fun_l9_n180(x)
+    if (x < 1)
+        fun_l10_n456(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n181(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n166(x)
+    end
+end
+
+def fun_l9_n182(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n452(x)
+    end
+end
+
+def fun_l9_n183(x)
+    if (x < 1)
+        fun_l10_n754(x)
+    else
+        fun_l10_n54(x)
+    end
+end
+
+def fun_l9_n184(x)
+    if (x < 1)
+        fun_l10_n137(x)
+    else
+        fun_l10_n155(x)
+    end
+end
+
+def fun_l9_n185(x)
+    if (x < 1)
+        fun_l10_n611(x)
+    else
+        fun_l10_n573(x)
+    end
+end
+
+def fun_l9_n186(x)
+    if (x < 1)
+        fun_l10_n694(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n187(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n102(x)
+    end
+end
+
+def fun_l9_n188(x)
+    if (x < 1)
+        fun_l10_n400(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n189(x)
+    if (x < 1)
+        fun_l10_n783(x)
+    else
+        fun_l10_n620(x)
+    end
+end
+
+def fun_l9_n190(x)
+    if (x < 1)
+        fun_l10_n209(x)
+    else
+        fun_l10_n777(x)
+    end
+end
+
+def fun_l9_n191(x)
+    if (x < 1)
+        fun_l10_n760(x)
+    else
+        fun_l10_n299(x)
+    end
+end
+
+def fun_l9_n192(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n509(x)
+    end
+end
+
+def fun_l9_n193(x)
+    if (x < 1)
+        fun_l10_n842(x)
+    else
+        fun_l10_n0(x)
+    end
+end
+
+def fun_l9_n194(x)
+    if (x < 1)
+        fun_l10_n620(x)
+    else
+        fun_l10_n757(x)
+    end
+end
+
+def fun_l9_n195(x)
+    if (x < 1)
+        fun_l10_n944(x)
+    else
+        fun_l10_n257(x)
+    end
+end
+
+def fun_l9_n196(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n11(x)
+    end
+end
+
+def fun_l9_n197(x)
+    if (x < 1)
+        fun_l10_n419(x)
+    else
+        fun_l10_n704(x)
+    end
+end
+
+def fun_l9_n198(x)
+    if (x < 1)
+        fun_l10_n656(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n199(x)
+    if (x < 1)
+        fun_l10_n129(x)
+    else
+        fun_l10_n815(x)
+    end
+end
+
+def fun_l9_n200(x)
+    if (x < 1)
+        fun_l10_n768(x)
+    else
+        fun_l10_n924(x)
+    end
+end
+
+def fun_l9_n201(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n361(x)
+    end
+end
+
+def fun_l9_n202(x)
+    if (x < 1)
+        fun_l10_n421(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n203(x)
+    if (x < 1)
+        fun_l10_n323(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n204(x)
+    if (x < 1)
+        fun_l10_n335(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n205(x)
+    if (x < 1)
+        fun_l10_n973(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n206(x)
+    if (x < 1)
+        fun_l10_n494(x)
+    else
+        fun_l10_n430(x)
+    end
+end
+
+def fun_l9_n207(x)
+    if (x < 1)
+        fun_l10_n482(x)
+    else
+        fun_l10_n828(x)
+    end
+end
+
+def fun_l9_n208(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n209(x)
+    if (x < 1)
+        fun_l10_n669(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n210(x)
+    if (x < 1)
+        fun_l10_n165(x)
+    else
+        fun_l10_n963(x)
+    end
+end
+
+def fun_l9_n211(x)
+    if (x < 1)
+        fun_l10_n772(x)
+    else
+        fun_l10_n49(x)
+    end
+end
+
+def fun_l9_n212(x)
+    if (x < 1)
+        fun_l10_n167(x)
+    else
+        fun_l10_n598(x)
+    end
+end
+
+def fun_l9_n213(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n214(x)
+    if (x < 1)
+        fun_l10_n39(x)
+    else
+        fun_l10_n470(x)
+    end
+end
+
+def fun_l9_n215(x)
+    if (x < 1)
+        fun_l10_n489(x)
+    else
+        fun_l10_n812(x)
+    end
+end
+
+def fun_l9_n216(x)
+    if (x < 1)
+        fun_l10_n390(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n217(x)
+    if (x < 1)
+        fun_l10_n909(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n218(x)
+    if (x < 1)
+        fun_l10_n781(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n219(x)
+    if (x < 1)
+        fun_l10_n958(x)
+    else
+        fun_l10_n697(x)
+    end
+end
+
+def fun_l9_n220(x)
+    if (x < 1)
+        fun_l10_n577(x)
+    else
+        fun_l10_n667(x)
+    end
+end
+
+def fun_l9_n221(x)
+    if (x < 1)
+        fun_l10_n206(x)
+    else
+        fun_l10_n573(x)
+    end
+end
+
+def fun_l9_n222(x)
+    if (x < 1)
+        fun_l10_n389(x)
+    else
+        fun_l10_n659(x)
+    end
+end
+
+def fun_l9_n223(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n572(x)
+    end
+end
+
+def fun_l9_n224(x)
+    if (x < 1)
+        fun_l10_n158(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n225(x)
+    if (x < 1)
+        fun_l10_n681(x)
+    else
+        fun_l10_n983(x)
+    end
+end
+
+def fun_l9_n226(x)
+    if (x < 1)
+        fun_l10_n987(x)
+    else
+        fun_l10_n116(x)
+    end
+end
+
+def fun_l9_n227(x)
+    if (x < 1)
+        fun_l10_n347(x)
+    else
+        fun_l10_n606(x)
+    end
+end
+
+def fun_l9_n228(x)
+    if (x < 1)
+        fun_l10_n566(x)
+    else
+        fun_l10_n77(x)
+    end
+end
+
+def fun_l9_n229(x)
+    if (x < 1)
+        fun_l10_n879(x)
+    else
+        fun_l10_n66(x)
+    end
+end
+
+def fun_l9_n230(x)
+    if (x < 1)
+        fun_l10_n355(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n231(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n5(x)
+    end
+end
+
+def fun_l9_n232(x)
+    if (x < 1)
+        fun_l10_n684(x)
+    else
+        fun_l10_n528(x)
+    end
+end
+
+def fun_l9_n233(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n246(x)
+    end
+end
+
+def fun_l9_n234(x)
+    if (x < 1)
+        fun_l10_n610(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n235(x)
+    if (x < 1)
+        fun_l10_n199(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n236(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n633(x)
+    end
+end
+
+def fun_l9_n237(x)
+    if (x < 1)
+        fun_l10_n216(x)
+    else
+        fun_l10_n546(x)
+    end
+end
+
+def fun_l9_n238(x)
+    if (x < 1)
+        fun_l10_n555(x)
+    else
+        fun_l10_n153(x)
+    end
+end
+
+def fun_l9_n239(x)
+    if (x < 1)
+        fun_l10_n236(x)
+    else
+        fun_l10_n231(x)
+    end
+end
+
+def fun_l9_n240(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n823(x)
+    end
+end
+
+def fun_l9_n241(x)
+    if (x < 1)
+        fun_l10_n275(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n242(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n243(x)
+    if (x < 1)
+        fun_l10_n639(x)
+    else
+        fun_l10_n972(x)
+    end
+end
+
+def fun_l9_n244(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n510(x)
+    end
+end
+
+def fun_l9_n245(x)
+    if (x < 1)
+        fun_l10_n256(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n246(x)
+    if (x < 1)
+        fun_l10_n139(x)
+    else
+        fun_l10_n385(x)
+    end
+end
+
+def fun_l9_n247(x)
+    if (x < 1)
+        fun_l10_n4(x)
+    else
+        fun_l10_n323(x)
+    end
+end
+
+def fun_l9_n248(x)
+    if (x < 1)
+        fun_l10_n166(x)
+    else
+        fun_l10_n539(x)
+    end
+end
+
+def fun_l9_n249(x)
+    if (x < 1)
+        fun_l10_n374(x)
+    else
+        fun_l10_n351(x)
+    end
+end
+
+def fun_l9_n250(x)
+    if (x < 1)
+        fun_l10_n650(x)
+    else
+        fun_l10_n791(x)
+    end
+end
+
+def fun_l9_n251(x)
+    if (x < 1)
+        fun_l10_n799(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n252(x)
+    if (x < 1)
+        fun_l10_n388(x)
+    else
+        fun_l10_n887(x)
+    end
+end
+
+def fun_l9_n253(x)
+    if (x < 1)
+        fun_l10_n564(x)
+    else
+        fun_l10_n997(x)
+    end
+end
+
+def fun_l9_n254(x)
+    if (x < 1)
+        fun_l10_n580(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n255(x)
+    if (x < 1)
+        fun_l10_n0(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n256(x)
+    if (x < 1)
+        fun_l10_n606(x)
+    else
+        fun_l10_n48(x)
+    end
+end
+
+def fun_l9_n257(x)
+    if (x < 1)
+        fun_l10_n601(x)
+    else
+        fun_l10_n657(x)
+    end
+end
+
+def fun_l9_n258(x)
+    if (x < 1)
+        fun_l10_n419(x)
+    else
+        fun_l10_n909(x)
+    end
+end
+
+def fun_l9_n259(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n961(x)
+    end
+end
+
+def fun_l9_n260(x)
+    if (x < 1)
+        fun_l10_n876(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n261(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n905(x)
+    end
+end
+
+def fun_l9_n262(x)
+    if (x < 1)
+        fun_l10_n105(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n263(x)
+    if (x < 1)
+        fun_l10_n610(x)
+    else
+        fun_l10_n527(x)
+    end
+end
+
+def fun_l9_n264(x)
+    if (x < 1)
+        fun_l10_n183(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n265(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n103(x)
+    end
+end
+
+def fun_l9_n266(x)
+    if (x < 1)
+        fun_l10_n501(x)
+    else
+        fun_l10_n293(x)
+    end
+end
+
+def fun_l9_n267(x)
+    if (x < 1)
+        fun_l10_n207(x)
+    else
+        fun_l10_n162(x)
+    end
+end
+
+def fun_l9_n268(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n269(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n270(x)
+    if (x < 1)
+        fun_l10_n445(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n271(x)
+    if (x < 1)
+        fun_l10_n585(x)
+    else
+        fun_l10_n371(x)
+    end
+end
+
+def fun_l9_n272(x)
+    if (x < 1)
+        fun_l10_n137(x)
+    else
+        fun_l10_n678(x)
+    end
+end
+
+def fun_l9_n273(x)
+    if (x < 1)
+        fun_l10_n284(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n274(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n456(x)
+    end
+end
+
+def fun_l9_n275(x)
+    if (x < 1)
+        fun_l10_n663(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n276(x)
+    if (x < 1)
+        fun_l10_n154(x)
+    else
+        fun_l10_n421(x)
+    end
+end
+
+def fun_l9_n277(x)
+    if (x < 1)
+        fun_l10_n778(x)
+    else
+        fun_l10_n325(x)
+    end
+end
+
+def fun_l9_n278(x)
+    if (x < 1)
+        fun_l10_n179(x)
+    else
+        fun_l10_n369(x)
+    end
+end
+
+def fun_l9_n279(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n280(x)
+    if (x < 1)
+        fun_l10_n617(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n281(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n763(x)
+    end
+end
+
+def fun_l9_n282(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n541(x)
+    end
+end
+
+def fun_l9_n283(x)
+    if (x < 1)
+        fun_l10_n664(x)
+    else
+        fun_l10_n854(x)
+    end
+end
+
+def fun_l9_n284(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n285(x)
+    if (x < 1)
+        fun_l10_n211(x)
+    else
+        fun_l10_n733(x)
+    end
+end
+
+def fun_l9_n286(x)
+    if (x < 1)
+        fun_l10_n524(x)
+    else
+        fun_l10_n850(x)
+    end
+end
+
+def fun_l9_n287(x)
+    if (x < 1)
+        fun_l10_n270(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n288(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n408(x)
+    end
+end
+
+def fun_l9_n289(x)
+    if (x < 1)
+        fun_l10_n873(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n290(x)
+    if (x < 1)
+        fun_l10_n535(x)
+    else
+        fun_l10_n946(x)
+    end
+end
+
+def fun_l9_n291(x)
+    if (x < 1)
+        fun_l10_n290(x)
+    else
+        fun_l10_n631(x)
+    end
+end
+
+def fun_l9_n292(x)
+    if (x < 1)
+        fun_l10_n223(x)
+    else
+        fun_l10_n165(x)
+    end
+end
+
+def fun_l9_n293(x)
+    if (x < 1)
+        fun_l10_n768(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n294(x)
+    if (x < 1)
+        fun_l10_n133(x)
+    else
+        fun_l10_n986(x)
+    end
+end
+
+def fun_l9_n295(x)
+    if (x < 1)
+        fun_l10_n657(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n296(x)
+    if (x < 1)
+        fun_l10_n444(x)
+    else
+        fun_l10_n490(x)
+    end
+end
+
+def fun_l9_n297(x)
+    if (x < 1)
+        fun_l10_n478(x)
+    else
+        fun_l10_n979(x)
+    end
+end
+
+def fun_l9_n298(x)
+    if (x < 1)
+        fun_l10_n994(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n299(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n206(x)
+    end
+end
+
+def fun_l9_n300(x)
+    if (x < 1)
+        fun_l10_n678(x)
+    else
+        fun_l10_n103(x)
+    end
+end
+
+def fun_l9_n301(x)
+    if (x < 1)
+        fun_l10_n115(x)
+    else
+        fun_l10_n742(x)
+    end
+end
+
+def fun_l9_n302(x)
+    if (x < 1)
+        fun_l10_n677(x)
+    else
+        fun_l10_n446(x)
+    end
+end
+
+def fun_l9_n303(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n304(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n989(x)
+    end
+end
+
+def fun_l9_n305(x)
+    if (x < 1)
+        fun_l10_n200(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n306(x)
+    if (x < 1)
+        fun_l10_n685(x)
+    else
+        fun_l10_n663(x)
+    end
+end
+
+def fun_l9_n307(x)
+    if (x < 1)
+        fun_l10_n831(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n308(x)
+    if (x < 1)
+        fun_l10_n467(x)
+    else
+        fun_l10_n715(x)
+    end
+end
+
+def fun_l9_n309(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n310(x)
+    if (x < 1)
+        fun_l10_n382(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n311(x)
+    if (x < 1)
+        fun_l10_n489(x)
+    else
+        fun_l10_n810(x)
+    end
+end
+
+def fun_l9_n312(x)
+    if (x < 1)
+        fun_l10_n922(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n313(x)
+    if (x < 1)
+        fun_l10_n788(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n314(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n315(x)
+    if (x < 1)
+        fun_l10_n848(x)
+    else
+        fun_l10_n250(x)
+    end
+end
+
+def fun_l9_n316(x)
+    if (x < 1)
+        fun_l10_n933(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n317(x)
+    if (x < 1)
+        fun_l10_n659(x)
+    else
+        fun_l10_n91(x)
+    end
+end
+
+def fun_l9_n318(x)
+    if (x < 1)
+        fun_l10_n417(x)
+    else
+        fun_l10_n99(x)
+    end
+end
+
+def fun_l9_n319(x)
+    if (x < 1)
+        fun_l10_n781(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n320(x)
+    if (x < 1)
+        fun_l10_n820(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n321(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n232(x)
+    end
+end
+
+def fun_l9_n322(x)
+    if (x < 1)
+        fun_l10_n793(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n323(x)
+    if (x < 1)
+        fun_l10_n91(x)
+    else
+        fun_l10_n356(x)
+    end
+end
+
+def fun_l9_n324(x)
+    if (x < 1)
+        fun_l10_n262(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n325(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n326(x)
+    if (x < 1)
+        fun_l10_n798(x)
+    else
+        fun_l10_n703(x)
+    end
+end
+
+def fun_l9_n327(x)
+    if (x < 1)
+        fun_l10_n478(x)
+    else
+        fun_l10_n181(x)
+    end
+end
+
+def fun_l9_n328(x)
+    if (x < 1)
+        fun_l10_n66(x)
+    else
+        fun_l10_n736(x)
+    end
+end
+
+def fun_l9_n329(x)
+    if (x < 1)
+        fun_l10_n388(x)
+    else
+        fun_l10_n122(x)
+    end
+end
+
+def fun_l9_n330(x)
+    if (x < 1)
+        fun_l10_n382(x)
+    else
+        fun_l10_n85(x)
+    end
+end
+
+def fun_l9_n331(x)
+    if (x < 1)
+        fun_l10_n987(x)
+    else
+        fun_l10_n769(x)
+    end
+end
+
+def fun_l9_n332(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n230(x)
+    end
+end
+
+def fun_l9_n333(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n157(x)
+    end
+end
+
+def fun_l9_n334(x)
+    if (x < 1)
+        fun_l10_n50(x)
+    else
+        fun_l10_n417(x)
+    end
+end
+
+def fun_l9_n335(x)
+    if (x < 1)
+        fun_l10_n37(x)
+    else
+        fun_l10_n564(x)
+    end
+end
+
+def fun_l9_n336(x)
+    if (x < 1)
+        fun_l10_n265(x)
+    else
+        fun_l10_n330(x)
+    end
+end
+
+def fun_l9_n337(x)
+    if (x < 1)
+        fun_l10_n816(x)
+    else
+        fun_l10_n723(x)
+    end
+end
+
+def fun_l9_n338(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n193(x)
+    end
+end
+
+def fun_l9_n339(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n710(x)
+    end
+end
+
+def fun_l9_n340(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n323(x)
+    end
+end
+
+def fun_l9_n341(x)
+    if (x < 1)
+        fun_l10_n727(x)
+    else
+        fun_l10_n305(x)
+    end
+end
+
+def fun_l9_n342(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n917(x)
+    end
+end
+
+def fun_l9_n343(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n36(x)
+    end
+end
+
+def fun_l9_n344(x)
+    if (x < 1)
+        fun_l10_n792(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n345(x)
+    if (x < 1)
+        fun_l10_n399(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n346(x)
+    if (x < 1)
+        fun_l10_n110(x)
+    else
+        fun_l10_n120(x)
+    end
+end
+
+def fun_l9_n347(x)
+    if (x < 1)
+        fun_l10_n521(x)
+    else
+        fun_l10_n111(x)
+    end
+end
+
+def fun_l9_n348(x)
+    if (x < 1)
+        fun_l10_n134(x)
+    else
+        fun_l10_n49(x)
+    end
+end
+
+def fun_l9_n349(x)
+    if (x < 1)
+        fun_l10_n353(x)
+    else
+        fun_l10_n156(x)
+    end
+end
+
+def fun_l9_n350(x)
+    if (x < 1)
+        fun_l10_n532(x)
+    else
+        fun_l10_n796(x)
+    end
+end
+
+def fun_l9_n351(x)
+    if (x < 1)
+        fun_l10_n896(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n352(x)
+    if (x < 1)
+        fun_l10_n857(x)
+    else
+        fun_l10_n798(x)
+    end
+end
+
+def fun_l9_n353(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n870(x)
+    end
+end
+
+def fun_l9_n354(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n355(x)
+    if (x < 1)
+        fun_l10_n841(x)
+    else
+        fun_l10_n918(x)
+    end
+end
+
+def fun_l9_n356(x)
+    if (x < 1)
+        fun_l10_n226(x)
+    else
+        fun_l10_n514(x)
+    end
+end
+
+def fun_l9_n357(x)
+    if (x < 1)
+        fun_l10_n289(x)
+    else
+        fun_l10_n911(x)
+    end
+end
+
+def fun_l9_n358(x)
+    if (x < 1)
+        fun_l10_n697(x)
+    else
+        fun_l10_n138(x)
+    end
+end
+
+def fun_l9_n359(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n88(x)
+    end
+end
+
+def fun_l9_n360(x)
+    if (x < 1)
+        fun_l10_n351(x)
+    else
+        fun_l10_n968(x)
+    end
+end
+
+def fun_l9_n361(x)
+    if (x < 1)
+        fun_l10_n782(x)
+    else
+        fun_l10_n506(x)
+    end
+end
+
+def fun_l9_n362(x)
+    if (x < 1)
+        fun_l10_n875(x)
+    else
+        fun_l10_n459(x)
+    end
+end
+
+def fun_l9_n363(x)
+    if (x < 1)
+        fun_l10_n2(x)
+    else
+        fun_l10_n468(x)
+    end
+end
+
+def fun_l9_n364(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n365(x)
+    if (x < 1)
+        fun_l10_n203(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n366(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n483(x)
+    end
+end
+
+def fun_l9_n367(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n724(x)
+    end
+end
+
+def fun_l9_n368(x)
+    if (x < 1)
+        fun_l10_n745(x)
+    else
+        fun_l10_n92(x)
+    end
+end
+
+def fun_l9_n369(x)
+    if (x < 1)
+        fun_l10_n312(x)
+    else
+        fun_l10_n754(x)
+    end
+end
+
+def fun_l9_n370(x)
+    if (x < 1)
+        fun_l10_n432(x)
+    else
+        fun_l10_n234(x)
+    end
+end
+
+def fun_l9_n371(x)
+    if (x < 1)
+        fun_l10_n629(x)
+    else
+        fun_l10_n751(x)
+    end
+end
+
+def fun_l9_n372(x)
+    if (x < 1)
+        fun_l10_n142(x)
+    else
+        fun_l10_n381(x)
+    end
+end
+
+def fun_l9_n373(x)
+    if (x < 1)
+        fun_l10_n490(x)
+    else
+        fun_l10_n405(x)
+    end
+end
+
+def fun_l9_n374(x)
+    if (x < 1)
+        fun_l10_n197(x)
+    else
+        fun_l10_n574(x)
+    end
+end
+
+def fun_l9_n375(x)
+    if (x < 1)
+        fun_l10_n808(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n376(x)
+    if (x < 1)
+        fun_l10_n195(x)
+    else
+        fun_l10_n186(x)
+    end
+end
+
+def fun_l9_n377(x)
+    if (x < 1)
+        fun_l10_n172(x)
+    else
+        fun_l10_n233(x)
+    end
+end
+
+def fun_l9_n378(x)
+    if (x < 1)
+        fun_l10_n723(x)
+    else
+        fun_l10_n919(x)
+    end
+end
+
+def fun_l9_n379(x)
+    if (x < 1)
+        fun_l10_n937(x)
+    else
+        fun_l10_n149(x)
+    end
+end
+
+def fun_l9_n380(x)
+    if (x < 1)
+        fun_l10_n676(x)
+    else
+        fun_l10_n502(x)
+    end
+end
+
+def fun_l9_n381(x)
+    if (x < 1)
+        fun_l10_n756(x)
+    else
+        fun_l10_n346(x)
+    end
+end
+
+def fun_l9_n382(x)
+    if (x < 1)
+        fun_l10_n477(x)
+    else
+        fun_l10_n179(x)
+    end
+end
+
+def fun_l9_n383(x)
+    if (x < 1)
+        fun_l10_n729(x)
+    else
+        fun_l10_n862(x)
+    end
+end
+
+def fun_l9_n384(x)
+    if (x < 1)
+        fun_l10_n406(x)
+    else
+        fun_l10_n145(x)
+    end
+end
+
+def fun_l9_n385(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n169(x)
+    end
+end
+
+def fun_l9_n386(x)
+    if (x < 1)
+        fun_l10_n596(x)
+    else
+        fun_l10_n971(x)
+    end
+end
+
+def fun_l9_n387(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n388(x)
+    if (x < 1)
+        fun_l10_n711(x)
+    else
+        fun_l10_n553(x)
+    end
+end
+
+def fun_l9_n389(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n390(x)
+    if (x < 1)
+        fun_l10_n872(x)
+    else
+        fun_l10_n901(x)
+    end
+end
+
+def fun_l9_n391(x)
+    if (x < 1)
+        fun_l10_n579(x)
+    else
+        fun_l10_n906(x)
+    end
+end
+
+def fun_l9_n392(x)
+    if (x < 1)
+        fun_l10_n734(x)
+    else
+        fun_l10_n195(x)
+    end
+end
+
+def fun_l9_n393(x)
+    if (x < 1)
+        fun_l10_n691(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n394(x)
+    if (x < 1)
+        fun_l10_n446(x)
+    else
+        fun_l10_n838(x)
+    end
+end
+
+def fun_l9_n395(x)
+    if (x < 1)
+        fun_l10_n708(x)
+    else
+        fun_l10_n319(x)
+    end
+end
+
+def fun_l9_n396(x)
+    if (x < 1)
+        fun_l10_n414(x)
+    else
+        fun_l10_n152(x)
+    end
+end
+
+def fun_l9_n397(x)
+    if (x < 1)
+        fun_l10_n637(x)
+    else
+        fun_l10_n662(x)
+    end
+end
+
+def fun_l9_n398(x)
+    if (x < 1)
+        fun_l10_n990(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n399(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n845(x)
+    end
+end
+
+def fun_l9_n400(x)
+    if (x < 1)
+        fun_l10_n843(x)
+    else
+        fun_l10_n876(x)
+    end
+end
+
+def fun_l9_n401(x)
+    if (x < 1)
+        fun_l10_n925(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n402(x)
+    if (x < 1)
+        fun_l10_n420(x)
+    else
+        fun_l10_n267(x)
+    end
+end
+
+def fun_l9_n403(x)
+    if (x < 1)
+        fun_l10_n78(x)
+    else
+        fun_l10_n316(x)
+    end
+end
+
+def fun_l9_n404(x)
+    if (x < 1)
+        fun_l10_n291(x)
+    else
+        fun_l10_n614(x)
+    end
+end
+
+def fun_l9_n405(x)
+    if (x < 1)
+        fun_l10_n956(x)
+    else
+        fun_l10_n550(x)
+    end
+end
+
+def fun_l9_n406(x)
+    if (x < 1)
+        fun_l10_n232(x)
+    else
+        fun_l10_n53(x)
+    end
+end
+
+def fun_l9_n407(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n408(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n932(x)
+    end
+end
+
+def fun_l9_n409(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n410(x)
+    if (x < 1)
+        fun_l10_n64(x)
+    else
+        fun_l10_n721(x)
+    end
+end
+
+def fun_l9_n411(x)
+    if (x < 1)
+        fun_l10_n539(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n412(x)
+    if (x < 1)
+        fun_l10_n660(x)
+    else
+        fun_l10_n852(x)
+    end
+end
+
+def fun_l9_n413(x)
+    if (x < 1)
+        fun_l10_n777(x)
+    else
+        fun_l10_n366(x)
+    end
+end
+
+def fun_l9_n414(x)
+    if (x < 1)
+        fun_l10_n695(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n415(x)
+    if (x < 1)
+        fun_l10_n208(x)
+    else
+        fun_l10_n892(x)
+    end
+end
+
+def fun_l9_n416(x)
+    if (x < 1)
+        fun_l10_n632(x)
+    else
+        fun_l10_n463(x)
+    end
+end
+
+def fun_l9_n417(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n55(x)
+    end
+end
+
+def fun_l9_n418(x)
+    if (x < 1)
+        fun_l10_n276(x)
+    else
+        fun_l10_n526(x)
+    end
+end
+
+def fun_l9_n419(x)
+    if (x < 1)
+        fun_l10_n625(x)
+    else
+        fun_l10_n806(x)
+    end
+end
+
+def fun_l9_n420(x)
+    if (x < 1)
+        fun_l10_n899(x)
+    else
+        fun_l10_n594(x)
+    end
+end
+
+def fun_l9_n421(x)
+    if (x < 1)
+        fun_l10_n725(x)
+    else
+        fun_l10_n461(x)
+    end
+end
+
+def fun_l9_n422(x)
+    if (x < 1)
+        fun_l10_n187(x)
+    else
+        fun_l10_n953(x)
+    end
+end
+
+def fun_l9_n423(x)
+    if (x < 1)
+        fun_l10_n698(x)
+    else
+        fun_l10_n751(x)
+    end
+end
+
+def fun_l9_n424(x)
+    if (x < 1)
+        fun_l10_n115(x)
+    else
+        fun_l10_n321(x)
+    end
+end
+
+def fun_l9_n425(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n426(x)
+    if (x < 1)
+        fun_l10_n177(x)
+    else
+        fun_l10_n565(x)
+    end
+end
+
+def fun_l9_n427(x)
+    if (x < 1)
+        fun_l10_n568(x)
+    else
+        fun_l10_n234(x)
+    end
+end
+
+def fun_l9_n428(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n815(x)
+    end
+end
+
+def fun_l9_n429(x)
+    if (x < 1)
+        fun_l10_n580(x)
+    else
+        fun_l10_n990(x)
+    end
+end
+
+def fun_l9_n430(x)
+    if (x < 1)
+        fun_l10_n680(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n431(x)
+    if (x < 1)
+        fun_l10_n650(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n432(x)
+    if (x < 1)
+        fun_l10_n377(x)
+    else
+        fun_l10_n232(x)
+    end
+end
+
+def fun_l9_n433(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n948(x)
+    end
+end
+
+def fun_l9_n434(x)
+    if (x < 1)
+        fun_l10_n126(x)
+    else
+        fun_l10_n220(x)
+    end
+end
+
+def fun_l9_n435(x)
+    if (x < 1)
+        fun_l10_n395(x)
+    else
+        fun_l10_n732(x)
+    end
+end
+
+def fun_l9_n436(x)
+    if (x < 1)
+        fun_l10_n194(x)
+    else
+        fun_l10_n159(x)
+    end
+end
+
+def fun_l9_n437(x)
+    if (x < 1)
+        fun_l10_n123(x)
+    else
+        fun_l10_n40(x)
+    end
+end
+
+def fun_l9_n438(x)
+    if (x < 1)
+        fun_l10_n241(x)
+    else
+        fun_l10_n861(x)
+    end
+end
+
+def fun_l9_n439(x)
+    if (x < 1)
+        fun_l10_n333(x)
+    else
+        fun_l10_n950(x)
+    end
+end
+
+def fun_l9_n440(x)
+    if (x < 1)
+        fun_l10_n116(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n441(x)
+    if (x < 1)
+        fun_l10_n598(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n442(x)
+    if (x < 1)
+        fun_l10_n234(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n443(x)
+    if (x < 1)
+        fun_l10_n943(x)
+    else
+        fun_l10_n895(x)
+    end
+end
+
+def fun_l9_n444(x)
+    if (x < 1)
+        fun_l10_n490(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n445(x)
+    if (x < 1)
+        fun_l10_n54(x)
+    else
+        fun_l10_n74(x)
+    end
+end
+
+def fun_l9_n446(x)
+    if (x < 1)
+        fun_l10_n214(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n447(x)
+    if (x < 1)
+        fun_l10_n274(x)
+    else
+        fun_l10_n255(x)
+    end
+end
+
+def fun_l9_n448(x)
+    if (x < 1)
+        fun_l10_n307(x)
+    else
+        fun_l10_n197(x)
+    end
+end
+
+def fun_l9_n449(x)
+    if (x < 1)
+        fun_l10_n152(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n450(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n582(x)
+    end
+end
+
+def fun_l9_n451(x)
+    if (x < 1)
+        fun_l10_n757(x)
+    else
+        fun_l10_n298(x)
+    end
+end
+
+def fun_l9_n452(x)
+    if (x < 1)
+        fun_l10_n648(x)
+    else
+        fun_l10_n826(x)
+    end
+end
+
+def fun_l9_n453(x)
+    if (x < 1)
+        fun_l10_n209(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n454(x)
+    if (x < 1)
+        fun_l10_n448(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n455(x)
+    if (x < 1)
+        fun_l10_n975(x)
+    else
+        fun_l10_n45(x)
+    end
+end
+
+def fun_l9_n456(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n354(x)
+    end
+end
+
+def fun_l9_n457(x)
+    if (x < 1)
+        fun_l10_n723(x)
+    else
+        fun_l10_n511(x)
+    end
+end
+
+def fun_l9_n458(x)
+    if (x < 1)
+        fun_l10_n864(x)
+    else
+        fun_l10_n688(x)
+    end
+end
+
+def fun_l9_n459(x)
+    if (x < 1)
+        fun_l10_n283(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n460(x)
+    if (x < 1)
+        fun_l10_n167(x)
+    else
+        fun_l10_n639(x)
+    end
+end
+
+def fun_l9_n461(x)
+    if (x < 1)
+        fun_l10_n493(x)
+    else
+        fun_l10_n538(x)
+    end
+end
+
+def fun_l9_n462(x)
+    if (x < 1)
+        fun_l10_n392(x)
+    else
+        fun_l10_n434(x)
+    end
+end
+
+def fun_l9_n463(x)
+    if (x < 1)
+        fun_l10_n958(x)
+    else
+        fun_l10_n305(x)
+    end
+end
+
+def fun_l9_n464(x)
+    if (x < 1)
+        fun_l10_n516(x)
+    else
+        fun_l10_n375(x)
+    end
+end
+
+def fun_l9_n465(x)
+    if (x < 1)
+        fun_l10_n371(x)
+    else
+        fun_l10_n596(x)
+    end
+end
+
+def fun_l9_n466(x)
+    if (x < 1)
+        fun_l10_n435(x)
+    else
+        fun_l10_n176(x)
+    end
+end
+
+def fun_l9_n467(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n83(x)
+    end
+end
+
+def fun_l9_n468(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n632(x)
+    end
+end
+
+def fun_l9_n469(x)
+    if (x < 1)
+        fun_l10_n14(x)
+    else
+        fun_l10_n530(x)
+    end
+end
+
+def fun_l9_n470(x)
+    if (x < 1)
+        fun_l10_n663(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n471(x)
+    if (x < 1)
+        fun_l10_n82(x)
+    else
+        fun_l10_n493(x)
+    end
+end
+
+def fun_l9_n472(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n473(x)
+    if (x < 1)
+        fun_l10_n492(x)
+    else
+        fun_l10_n492(x)
+    end
+end
+
+def fun_l9_n474(x)
+    if (x < 1)
+        fun_l10_n440(x)
+    else
+        fun_l10_n665(x)
+    end
+end
+
+def fun_l9_n475(x)
+    if (x < 1)
+        fun_l10_n284(x)
+    else
+        fun_l10_n513(x)
+    end
+end
+
+def fun_l9_n476(x)
+    if (x < 1)
+        fun_l10_n690(x)
+    else
+        fun_l10_n507(x)
+    end
+end
+
+def fun_l9_n477(x)
+    if (x < 1)
+        fun_l10_n281(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n478(x)
+    if (x < 1)
+        fun_l10_n903(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n479(x)
+    if (x < 1)
+        fun_l10_n880(x)
+    else
+        fun_l10_n310(x)
+    end
+end
+
+def fun_l9_n480(x)
+    if (x < 1)
+        fun_l10_n69(x)
+    else
+        fun_l10_n227(x)
+    end
+end
+
+def fun_l9_n481(x)
+    if (x < 1)
+        fun_l10_n316(x)
+    else
+        fun_l10_n692(x)
+    end
+end
+
+def fun_l9_n482(x)
+    if (x < 1)
+        fun_l10_n875(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n483(x)
+    if (x < 1)
+        fun_l10_n496(x)
+    else
+        fun_l10_n81(x)
+    end
+end
+
+def fun_l9_n484(x)
+    if (x < 1)
+        fun_l10_n336(x)
+    else
+        fun_l10_n193(x)
+    end
+end
+
+def fun_l9_n485(x)
+    if (x < 1)
+        fun_l10_n541(x)
+    else
+        fun_l10_n465(x)
+    end
+end
+
+def fun_l9_n486(x)
+    if (x < 1)
+        fun_l10_n197(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n487(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n736(x)
+    end
+end
+
+def fun_l9_n488(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n912(x)
+    end
+end
+
+def fun_l9_n489(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n490(x)
+    if (x < 1)
+        fun_l10_n505(x)
+    else
+        fun_l10_n204(x)
+    end
+end
+
+def fun_l9_n491(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n492(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n669(x)
+    end
+end
+
+def fun_l9_n493(x)
+    if (x < 1)
+        fun_l10_n860(x)
+    else
+        fun_l10_n676(x)
+    end
+end
+
+def fun_l9_n494(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n495(x)
+    if (x < 1)
+        fun_l10_n151(x)
+    else
+        fun_l10_n588(x)
+    end
+end
+
+def fun_l9_n496(x)
+    if (x < 1)
+        fun_l10_n159(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n497(x)
+    if (x < 1)
+        fun_l10_n803(x)
+    else
+        fun_l10_n292(x)
+    end
+end
+
+def fun_l9_n498(x)
+    if (x < 1)
+        fun_l10_n308(x)
+    else
+        fun_l10_n46(x)
+    end
+end
+
+def fun_l9_n499(x)
+    if (x < 1)
+        fun_l10_n511(x)
+    else
+        fun_l10_n766(x)
+    end
+end
+
+def fun_l9_n500(x)
+    if (x < 1)
+        fun_l10_n753(x)
+    else
+        fun_l10_n235(x)
+    end
+end
+
+def fun_l9_n501(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n779(x)
+    end
+end
+
+def fun_l9_n502(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n969(x)
+    end
+end
+
+def fun_l9_n503(x)
+    if (x < 1)
+        fun_l10_n511(x)
+    else
+        fun_l10_n678(x)
+    end
+end
+
+def fun_l9_n504(x)
+    if (x < 1)
+        fun_l10_n578(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n505(x)
+    if (x < 1)
+        fun_l10_n434(x)
+    else
+        fun_l10_n0(x)
+    end
+end
+
+def fun_l9_n506(x)
+    if (x < 1)
+        fun_l10_n121(x)
+    else
+        fun_l10_n488(x)
+    end
+end
+
+def fun_l9_n507(x)
+    if (x < 1)
+        fun_l10_n865(x)
+    else
+        fun_l10_n540(x)
+    end
+end
+
+def fun_l9_n508(x)
+    if (x < 1)
+        fun_l10_n809(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n509(x)
+    if (x < 1)
+        fun_l10_n463(x)
+    else
+        fun_l10_n141(x)
+    end
+end
+
+def fun_l9_n510(x)
+    if (x < 1)
+        fun_l10_n442(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n511(x)
+    if (x < 1)
+        fun_l10_n971(x)
+    else
+        fun_l10_n57(x)
+    end
+end
+
+def fun_l9_n512(x)
+    if (x < 1)
+        fun_l10_n892(x)
+    else
+        fun_l10_n612(x)
+    end
+end
+
+def fun_l9_n513(x)
+    if (x < 1)
+        fun_l10_n864(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n514(x)
+    if (x < 1)
+        fun_l10_n504(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n515(x)
+    if (x < 1)
+        fun_l10_n881(x)
+    else
+        fun_l10_n621(x)
+    end
+end
+
+def fun_l9_n516(x)
+    if (x < 1)
+        fun_l10_n170(x)
+    else
+        fun_l10_n435(x)
+    end
+end
+
+def fun_l9_n517(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n537(x)
+    end
+end
+
+def fun_l9_n518(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n519(x)
+    if (x < 1)
+        fun_l10_n654(x)
+    else
+        fun_l10_n364(x)
+    end
+end
+
+def fun_l9_n520(x)
+    if (x < 1)
+        fun_l10_n410(x)
+    else
+        fun_l10_n10(x)
+    end
+end
+
+def fun_l9_n521(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n569(x)
+    end
+end
+
+def fun_l9_n522(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n333(x)
+    end
+end
+
+def fun_l9_n523(x)
+    if (x < 1)
+        fun_l10_n336(x)
+    else
+        fun_l10_n720(x)
+    end
+end
+
+def fun_l9_n524(x)
+    if (x < 1)
+        fun_l10_n34(x)
+    else
+        fun_l10_n643(x)
+    end
+end
+
+def fun_l9_n525(x)
+    if (x < 1)
+        fun_l10_n147(x)
+    else
+        fun_l10_n62(x)
+    end
+end
+
+def fun_l9_n526(x)
+    if (x < 1)
+        fun_l10_n431(x)
+    else
+        fun_l10_n452(x)
+    end
+end
+
+def fun_l9_n527(x)
+    if (x < 1)
+        fun_l10_n374(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n528(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n274(x)
+    end
+end
+
+def fun_l9_n529(x)
+    if (x < 1)
+        fun_l10_n470(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n530(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n646(x)
+    end
+end
+
+def fun_l9_n531(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n464(x)
+    end
+end
+
+def fun_l9_n532(x)
+    if (x < 1)
+        fun_l10_n553(x)
+    else
+        fun_l10_n605(x)
+    end
+end
+
+def fun_l9_n533(x)
+    if (x < 1)
+        fun_l10_n59(x)
+    else
+        fun_l10_n794(x)
+    end
+end
+
+def fun_l9_n534(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n740(x)
+    end
+end
+
+def fun_l9_n535(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n651(x)
+    end
+end
+
+def fun_l9_n536(x)
+    if (x < 1)
+        fun_l10_n904(x)
+    else
+        fun_l10_n552(x)
+    end
+end
+
+def fun_l9_n537(x)
+    if (x < 1)
+        fun_l10_n389(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n538(x)
+    if (x < 1)
+        fun_l10_n622(x)
+    else
+        fun_l10_n100(x)
+    end
+end
+
+def fun_l9_n539(x)
+    if (x < 1)
+        fun_l10_n117(x)
+    else
+        fun_l10_n715(x)
+    end
+end
+
+def fun_l9_n540(x)
+    if (x < 1)
+        fun_l10_n959(x)
+    else
+        fun_l10_n391(x)
+    end
+end
+
+def fun_l9_n541(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n393(x)
+    end
+end
+
+def fun_l9_n542(x)
+    if (x < 1)
+        fun_l10_n171(x)
+    else
+        fun_l10_n299(x)
+    end
+end
+
+def fun_l9_n543(x)
+    if (x < 1)
+        fun_l10_n655(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n544(x)
+    if (x < 1)
+        fun_l10_n819(x)
+    else
+        fun_l10_n817(x)
+    end
+end
+
+def fun_l9_n545(x)
+    if (x < 1)
+        fun_l10_n938(x)
+    else
+        fun_l10_n54(x)
+    end
+end
+
+def fun_l9_n546(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n6(x)
+    end
+end
+
+def fun_l9_n547(x)
+    if (x < 1)
+        fun_l10_n203(x)
+    else
+        fun_l10_n626(x)
+    end
+end
+
+def fun_l9_n548(x)
+    if (x < 1)
+        fun_l10_n643(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n549(x)
+    if (x < 1)
+        fun_l10_n450(x)
+    else
+        fun_l10_n673(x)
+    end
+end
+
+def fun_l9_n550(x)
+    if (x < 1)
+        fun_l10_n496(x)
+    else
+        fun_l10_n568(x)
+    end
+end
+
+def fun_l9_n551(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n552(x)
+    if (x < 1)
+        fun_l10_n398(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n553(x)
+    if (x < 1)
+        fun_l10_n253(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n554(x)
+    if (x < 1)
+        fun_l10_n493(x)
+    else
+        fun_l10_n750(x)
+    end
+end
+
+def fun_l9_n555(x)
+    if (x < 1)
+        fun_l10_n111(x)
+    else
+        fun_l10_n279(x)
+    end
+end
+
+def fun_l9_n556(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n557(x)
+    if (x < 1)
+        fun_l10_n530(x)
+    else
+        fun_l10_n182(x)
+    end
+end
+
+def fun_l9_n558(x)
+    if (x < 1)
+        fun_l10_n434(x)
+    else
+        fun_l10_n453(x)
+    end
+end
+
+def fun_l9_n559(x)
+    if (x < 1)
+        fun_l10_n480(x)
+    else
+        fun_l10_n590(x)
+    end
+end
+
+def fun_l9_n560(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n280(x)
+    end
+end
+
+def fun_l9_n561(x)
+    if (x < 1)
+        fun_l10_n107(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n562(x)
+    if (x < 1)
+        fun_l10_n15(x)
+    else
+        fun_l10_n671(x)
+    end
+end
+
+def fun_l9_n563(x)
+    if (x < 1)
+        fun_l10_n544(x)
+    else
+        fun_l10_n571(x)
+    end
+end
+
+def fun_l9_n564(x)
+    if (x < 1)
+        fun_l10_n482(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n565(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n916(x)
+    end
+end
+
+def fun_l9_n566(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n567(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n568(x)
+    if (x < 1)
+        fun_l10_n604(x)
+    else
+        fun_l10_n899(x)
+    end
+end
+
+def fun_l9_n569(x)
+    if (x < 1)
+        fun_l10_n138(x)
+    else
+        fun_l10_n164(x)
+    end
+end
+
+def fun_l9_n570(x)
+    if (x < 1)
+        fun_l10_n993(x)
+    else
+        fun_l10_n94(x)
+    end
+end
+
+def fun_l9_n571(x)
+    if (x < 1)
+        fun_l10_n602(x)
+    else
+        fun_l10_n989(x)
+    end
+end
+
+def fun_l9_n572(x)
+    if (x < 1)
+        fun_l10_n700(x)
+    else
+        fun_l10_n308(x)
+    end
+end
+
+def fun_l9_n573(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n945(x)
+    end
+end
+
+def fun_l9_n574(x)
+    if (x < 1)
+        fun_l10_n148(x)
+    else
+        fun_l10_n608(x)
+    end
+end
+
+def fun_l9_n575(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n908(x)
+    end
+end
+
+def fun_l9_n576(x)
+    if (x < 1)
+        fun_l10_n174(x)
+    else
+        fun_l10_n872(x)
+    end
+end
+
+def fun_l9_n577(x)
+    if (x < 1)
+        fun_l10_n291(x)
+    else
+        fun_l10_n265(x)
+    end
+end
+
+def fun_l9_n578(x)
+    if (x < 1)
+        fun_l10_n425(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n579(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n666(x)
+    end
+end
+
+def fun_l9_n580(x)
+    if (x < 1)
+        fun_l10_n784(x)
+    else
+        fun_l10_n147(x)
+    end
+end
+
+def fun_l9_n581(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n119(x)
+    end
+end
+
+def fun_l9_n582(x)
+    if (x < 1)
+        fun_l10_n953(x)
+    else
+        fun_l10_n269(x)
+    end
+end
+
+def fun_l9_n583(x)
+    if (x < 1)
+        fun_l10_n575(x)
+    else
+        fun_l10_n79(x)
+    end
+end
+
+def fun_l9_n584(x)
+    if (x < 1)
+        fun_l10_n498(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n585(x)
+    if (x < 1)
+        fun_l10_n728(x)
+    else
+        fun_l10_n92(x)
+    end
+end
+
+def fun_l9_n586(x)
+    if (x < 1)
+        fun_l10_n344(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n587(x)
+    if (x < 1)
+        fun_l10_n911(x)
+    else
+        fun_l10_n327(x)
+    end
+end
+
+def fun_l9_n588(x)
+    if (x < 1)
+        fun_l10_n422(x)
+    else
+        fun_l10_n224(x)
+    end
+end
+
+def fun_l9_n589(x)
+    if (x < 1)
+        fun_l10_n311(x)
+    else
+        fun_l10_n457(x)
+    end
+end
+
+def fun_l9_n590(x)
+    if (x < 1)
+        fun_l10_n705(x)
+    else
+        fun_l10_n136(x)
+    end
+end
+
+def fun_l9_n591(x)
+    if (x < 1)
+        fun_l10_n338(x)
+    else
+        fun_l10_n14(x)
+    end
+end
+
+def fun_l9_n592(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n671(x)
+    end
+end
+
+def fun_l9_n593(x)
+    if (x < 1)
+        fun_l10_n402(x)
+    else
+        fun_l10_n218(x)
+    end
+end
+
+def fun_l9_n594(x)
+    if (x < 1)
+        fun_l10_n854(x)
+    else
+        fun_l10_n198(x)
+    end
+end
+
+def fun_l9_n595(x)
+    if (x < 1)
+        fun_l10_n932(x)
+    else
+        fun_l10_n181(x)
+    end
+end
+
+def fun_l9_n596(x)
+    if (x < 1)
+        fun_l10_n373(x)
+    else
+        fun_l10_n937(x)
+    end
+end
+
+def fun_l9_n597(x)
+    if (x < 1)
+        fun_l10_n181(x)
+    else
+        fun_l10_n925(x)
+    end
+end
+
+def fun_l9_n598(x)
+    if (x < 1)
+        fun_l10_n263(x)
+    else
+        fun_l10_n98(x)
+    end
+end
+
+def fun_l9_n599(x)
+    if (x < 1)
+        fun_l10_n736(x)
+    else
+        fun_l10_n951(x)
+    end
+end
+
+def fun_l9_n600(x)
+    if (x < 1)
+        fun_l10_n576(x)
+    else
+        fun_l10_n998(x)
+    end
+end
+
+def fun_l9_n601(x)
+    if (x < 1)
+        fun_l10_n577(x)
+    else
+        fun_l10_n559(x)
+    end
+end
+
+def fun_l9_n602(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n993(x)
+    end
+end
+
+def fun_l9_n603(x)
+    if (x < 1)
+        fun_l10_n35(x)
+    else
+        fun_l10_n132(x)
+    end
+end
+
+def fun_l9_n604(x)
+    if (x < 1)
+        fun_l10_n715(x)
+    else
+        fun_l10_n933(x)
+    end
+end
+
+def fun_l9_n605(x)
+    if (x < 1)
+        fun_l10_n570(x)
+    else
+        fun_l10_n455(x)
+    end
+end
+
+def fun_l9_n606(x)
+    if (x < 1)
+        fun_l10_n225(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n607(x)
+    if (x < 1)
+        fun_l10_n431(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n608(x)
+    if (x < 1)
+        fun_l10_n647(x)
+    else
+        fun_l10_n221(x)
+    end
+end
+
+def fun_l9_n609(x)
+    if (x < 1)
+        fun_l10_n348(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n610(x)
+    if (x < 1)
+        fun_l10_n301(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n611(x)
+    if (x < 1)
+        fun_l10_n152(x)
+    else
+        fun_l10_n1(x)
+    end
+end
+
+def fun_l9_n612(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n613(x)
+    if (x < 1)
+        fun_l10_n427(x)
+    else
+        fun_l10_n779(x)
+    end
+end
+
+def fun_l9_n614(x)
+    if (x < 1)
+        fun_l10_n60(x)
+    else
+        fun_l10_n199(x)
+    end
+end
+
+def fun_l9_n615(x)
+    if (x < 1)
+        fun_l10_n616(x)
+    else
+        fun_l10_n33(x)
+    end
+end
+
+def fun_l9_n616(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n981(x)
+    end
+end
+
+def fun_l9_n617(x)
+    if (x < 1)
+        fun_l10_n594(x)
+    else
+        fun_l10_n321(x)
+    end
+end
+
+def fun_l9_n618(x)
+    if (x < 1)
+        fun_l10_n233(x)
+    else
+        fun_l10_n500(x)
+    end
+end
+
+def fun_l9_n619(x)
+    if (x < 1)
+        fun_l10_n169(x)
+    else
+        fun_l10_n883(x)
+    end
+end
+
+def fun_l9_n620(x)
+    if (x < 1)
+        fun_l10_n611(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n621(x)
+    if (x < 1)
+        fun_l10_n155(x)
+    else
+        fun_l10_n547(x)
+    end
+end
+
+def fun_l9_n622(x)
+    if (x < 1)
+        fun_l10_n244(x)
+    else
+        fun_l10_n760(x)
+    end
+end
+
+def fun_l9_n623(x)
+    if (x < 1)
+        fun_l10_n893(x)
+    else
+        fun_l10_n13(x)
+    end
+end
+
+def fun_l9_n624(x)
+    if (x < 1)
+        fun_l10_n465(x)
+    else
+        fun_l10_n276(x)
+    end
+end
+
+def fun_l9_n625(x)
+    if (x < 1)
+        fun_l10_n196(x)
+    else
+        fun_l10_n920(x)
+    end
+end
+
+def fun_l9_n626(x)
+    if (x < 1)
+        fun_l10_n235(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n627(x)
+    if (x < 1)
+        fun_l10_n361(x)
+    else
+        fun_l10_n162(x)
+    end
+end
+
+def fun_l9_n628(x)
+    if (x < 1)
+        fun_l10_n110(x)
+    else
+        fun_l10_n574(x)
+    end
+end
+
+def fun_l9_n629(x)
+    if (x < 1)
+        fun_l10_n861(x)
+    else
+        fun_l10_n839(x)
+    end
+end
+
+def fun_l9_n630(x)
+    if (x < 1)
+        fun_l10_n386(x)
+    else
+        fun_l10_n741(x)
+    end
+end
+
+def fun_l9_n631(x)
+    if (x < 1)
+        fun_l10_n426(x)
+    else
+        fun_l10_n430(x)
+    end
+end
+
+def fun_l9_n632(x)
+    if (x < 1)
+        fun_l10_n231(x)
+    else
+        fun_l10_n353(x)
+    end
+end
+
+def fun_l9_n633(x)
+    if (x < 1)
+        fun_l10_n945(x)
+    else
+        fun_l10_n199(x)
+    end
+end
+
+def fun_l9_n634(x)
+    if (x < 1)
+        fun_l10_n607(x)
+    else
+        fun_l10_n388(x)
+    end
+end
+
+def fun_l9_n635(x)
+    if (x < 1)
+        fun_l10_n214(x)
+    else
+        fun_l10_n135(x)
+    end
+end
+
+def fun_l9_n636(x)
+    if (x < 1)
+        fun_l10_n642(x)
+    else
+        fun_l10_n522(x)
+    end
+end
+
+def fun_l9_n637(x)
+    if (x < 1)
+        fun_l10_n605(x)
+    else
+        fun_l10_n336(x)
+    end
+end
+
+def fun_l9_n638(x)
+    if (x < 1)
+        fun_l10_n719(x)
+    else
+        fun_l10_n213(x)
+    end
+end
+
+def fun_l9_n639(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n640(x)
+    if (x < 1)
+        fun_l10_n242(x)
+    else
+        fun_l10_n596(x)
+    end
+end
+
+def fun_l9_n641(x)
+    if (x < 1)
+        fun_l10_n851(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n642(x)
+    if (x < 1)
+        fun_l10_n645(x)
+    else
+        fun_l10_n890(x)
+    end
+end
+
+def fun_l9_n643(x)
+    if (x < 1)
+        fun_l10_n241(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n644(x)
+    if (x < 1)
+        fun_l10_n597(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n645(x)
+    if (x < 1)
+        fun_l10_n170(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n646(x)
+    if (x < 1)
+        fun_l10_n229(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n647(x)
+    if (x < 1)
+        fun_l10_n473(x)
+    else
+        fun_l10_n942(x)
+    end
+end
+
+def fun_l9_n648(x)
+    if (x < 1)
+        fun_l10_n630(x)
+    else
+        fun_l10_n630(x)
+    end
+end
+
+def fun_l9_n649(x)
+    if (x < 1)
+        fun_l10_n183(x)
+    else
+        fun_l10_n313(x)
+    end
+end
+
+def fun_l9_n650(x)
+    if (x < 1)
+        fun_l10_n951(x)
+    else
+        fun_l10_n394(x)
+    end
+end
+
+def fun_l9_n651(x)
+    if (x < 1)
+        fun_l10_n107(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n652(x)
+    if (x < 1)
+        fun_l10_n678(x)
+    else
+        fun_l10_n768(x)
+    end
+end
+
+def fun_l9_n653(x)
+    if (x < 1)
+        fun_l10_n534(x)
+    else
+        fun_l10_n410(x)
+    end
+end
+
+def fun_l9_n654(x)
+    if (x < 1)
+        fun_l10_n694(x)
+    else
+        fun_l10_n134(x)
+    end
+end
+
+def fun_l9_n655(x)
+    if (x < 1)
+        fun_l10_n751(x)
+    else
+        fun_l10_n923(x)
+    end
+end
+
+def fun_l9_n656(x)
+    if (x < 1)
+        fun_l10_n957(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n657(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n658(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n659(x)
+    if (x < 1)
+        fun_l10_n297(x)
+    else
+        fun_l10_n344(x)
+    end
+end
+
+def fun_l9_n660(x)
+    if (x < 1)
+        fun_l10_n674(x)
+    else
+        fun_l10_n780(x)
+    end
+end
+
+def fun_l9_n661(x)
+    if (x < 1)
+        fun_l10_n302(x)
+    else
+        fun_l10_n184(x)
+    end
+end
+
+def fun_l9_n662(x)
+    if (x < 1)
+        fun_l10_n308(x)
+    else
+        fun_l10_n302(x)
+    end
+end
+
+def fun_l9_n663(x)
+    if (x < 1)
+        fun_l10_n825(x)
+    else
+        fun_l10_n866(x)
+    end
+end
+
+def fun_l9_n664(x)
+    if (x < 1)
+        fun_l10_n771(x)
+    else
+        fun_l10_n141(x)
+    end
+end
+
+def fun_l9_n665(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n63(x)
+    end
+end
+
+def fun_l9_n666(x)
+    if (x < 1)
+        fun_l10_n198(x)
+    else
+        fun_l10_n793(x)
+    end
+end
+
+def fun_l9_n667(x)
+    if (x < 1)
+        fun_l10_n800(x)
+    else
+        fun_l10_n748(x)
+    end
+end
+
+def fun_l9_n668(x)
+    if (x < 1)
+        fun_l10_n809(x)
+    else
+        fun_l10_n673(x)
+    end
+end
+
+def fun_l9_n669(x)
+    if (x < 1)
+        fun_l10_n438(x)
+    else
+        fun_l10_n301(x)
+    end
+end
+
+def fun_l9_n670(x)
+    if (x < 1)
+        fun_l10_n802(x)
+    else
+        fun_l10_n882(x)
+    end
+end
+
+def fun_l9_n671(x)
+    if (x < 1)
+        fun_l10_n690(x)
+    else
+        fun_l10_n524(x)
+    end
+end
+
+def fun_l9_n672(x)
+    if (x < 1)
+        fun_l10_n996(x)
+    else
+        fun_l10_n68(x)
+    end
+end
+
+def fun_l9_n673(x)
+    if (x < 1)
+        fun_l10_n773(x)
+    else
+        fun_l10_n26(x)
+    end
+end
+
+def fun_l9_n674(x)
+    if (x < 1)
+        fun_l10_n252(x)
+    else
+        fun_l10_n680(x)
+    end
+end
+
+def fun_l9_n675(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n885(x)
+    end
+end
+
+def fun_l9_n676(x)
+    if (x < 1)
+        fun_l10_n746(x)
+    else
+        fun_l10_n968(x)
+    end
+end
+
+def fun_l9_n677(x)
+    if (x < 1)
+        fun_l10_n827(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n678(x)
+    if (x < 1)
+        fun_l10_n158(x)
+    else
+        fun_l10_n780(x)
+    end
+end
+
+def fun_l9_n679(x)
+    if (x < 1)
+        fun_l10_n267(x)
+    else
+        fun_l10_n907(x)
+    end
+end
+
+def fun_l9_n680(x)
+    if (x < 1)
+        fun_l10_n378(x)
+    else
+        fun_l10_n668(x)
+    end
+end
+
+def fun_l9_n681(x)
+    if (x < 1)
+        fun_l10_n481(x)
+    else
+        fun_l10_n421(x)
+    end
+end
+
+def fun_l9_n682(x)
+    if (x < 1)
+        fun_l10_n501(x)
+    else
+        fun_l10_n277(x)
+    end
+end
+
+def fun_l9_n683(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n604(x)
+    end
+end
+
+def fun_l9_n684(x)
+    if (x < 1)
+        fun_l10_n483(x)
+    else
+        fun_l10_n761(x)
+    end
+end
+
+def fun_l9_n685(x)
+    if (x < 1)
+        fun_l10_n41(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n686(x)
+    if (x < 1)
+        fun_l10_n549(x)
+    else
+        fun_l10_n319(x)
+    end
+end
+
+def fun_l9_n687(x)
+    if (x < 1)
+        fun_l10_n246(x)
+    else
+        fun_l10_n854(x)
+    end
+end
+
+def fun_l9_n688(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n43(x)
+    end
+end
+
+def fun_l9_n689(x)
+    if (x < 1)
+        fun_l10_n994(x)
+    else
+        fun_l10_n549(x)
+    end
+end
+
+def fun_l9_n690(x)
+    if (x < 1)
+        fun_l10_n439(x)
+    else
+        fun_l10_n560(x)
+    end
+end
+
+def fun_l9_n691(x)
+    if (x < 1)
+        fun_l10_n227(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n692(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n350(x)
+    end
+end
+
+def fun_l9_n693(x)
+    if (x < 1)
+        fun_l10_n543(x)
+    else
+        fun_l10_n638(x)
+    end
+end
+
+def fun_l9_n694(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n187(x)
+    end
+end
+
+def fun_l9_n695(x)
+    if (x < 1)
+        fun_l10_n1(x)
+    else
+        fun_l10_n540(x)
+    end
+end
+
+def fun_l9_n696(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n290(x)
+    end
+end
+
+def fun_l9_n697(x)
+    if (x < 1)
+        fun_l10_n140(x)
+    else
+        fun_l10_n72(x)
+    end
+end
+
+def fun_l9_n698(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n257(x)
+    end
+end
+
+def fun_l9_n699(x)
+    if (x < 1)
+        fun_l10_n91(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n700(x)
+    if (x < 1)
+        fun_l10_n420(x)
+    else
+        fun_l10_n763(x)
+    end
+end
+
+def fun_l9_n701(x)
+    if (x < 1)
+        fun_l10_n429(x)
+    else
+        fun_l10_n28(x)
+    end
+end
+
+def fun_l9_n702(x)
+    if (x < 1)
+        fun_l10_n615(x)
+    else
+        fun_l10_n995(x)
+    end
+end
+
+def fun_l9_n703(x)
+    if (x < 1)
+        fun_l10_n776(x)
+    else
+        fun_l10_n85(x)
+    end
+end
+
+def fun_l9_n704(x)
+    if (x < 1)
+        fun_l10_n795(x)
+    else
+        fun_l10_n542(x)
+    end
+end
+
+def fun_l9_n705(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n166(x)
+    end
+end
+
+def fun_l9_n706(x)
+    if (x < 1)
+        fun_l10_n99(x)
+    else
+        fun_l10_n400(x)
+    end
+end
+
+def fun_l9_n707(x)
+    if (x < 1)
+        fun_l10_n292(x)
+    else
+        fun_l10_n801(x)
+    end
+end
+
+def fun_l9_n708(x)
+    if (x < 1)
+        fun_l10_n303(x)
+    else
+        fun_l10_n380(x)
+    end
+end
+
+def fun_l9_n709(x)
+    if (x < 1)
+        fun_l10_n369(x)
+    else
+        fun_l10_n938(x)
+    end
+end
+
+def fun_l9_n710(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n453(x)
+    end
+end
+
+def fun_l9_n711(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n32(x)
+    end
+end
+
+def fun_l9_n712(x)
+    if (x < 1)
+        fun_l10_n261(x)
+    else
+        fun_l10_n485(x)
+    end
+end
+
+def fun_l9_n713(x)
+    if (x < 1)
+        fun_l10_n935(x)
+    else
+        fun_l10_n39(x)
+    end
+end
+
+def fun_l9_n714(x)
+    if (x < 1)
+        fun_l10_n332(x)
+    else
+        fun_l10_n309(x)
+    end
+end
+
+def fun_l9_n715(x)
+    if (x < 1)
+        fun_l10_n824(x)
+    else
+        fun_l10_n614(x)
+    end
+end
+
+def fun_l9_n716(x)
+    if (x < 1)
+        fun_l10_n468(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n717(x)
+    if (x < 1)
+        fun_l10_n425(x)
+    else
+        fun_l10_n67(x)
+    end
+end
+
+def fun_l9_n718(x)
+    if (x < 1)
+        fun_l10_n199(x)
+    else
+        fun_l10_n423(x)
+    end
+end
+
+def fun_l9_n719(x)
+    if (x < 1)
+        fun_l10_n294(x)
+    else
+        fun_l10_n484(x)
+    end
+end
+
+def fun_l9_n720(x)
+    if (x < 1)
+        fun_l10_n276(x)
+    else
+        fun_l10_n799(x)
+    end
+end
+
+def fun_l9_n721(x)
+    if (x < 1)
+        fun_l10_n98(x)
+    else
+        fun_l10_n278(x)
+    end
+end
+
+def fun_l9_n722(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n767(x)
+    end
+end
+
+def fun_l9_n723(x)
+    if (x < 1)
+        fun_l10_n786(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n724(x)
+    if (x < 1)
+        fun_l10_n874(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n725(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n726(x)
+    if (x < 1)
+        fun_l10_n847(x)
+    else
+        fun_l10_n427(x)
+    end
+end
+
+def fun_l9_n727(x)
+    if (x < 1)
+        fun_l10_n285(x)
+    else
+        fun_l10_n878(x)
+    end
+end
+
+def fun_l9_n728(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n341(x)
+    end
+end
+
+def fun_l9_n729(x)
+    if (x < 1)
+        fun_l10_n797(x)
+    else
+        fun_l10_n865(x)
+    end
+end
+
+def fun_l9_n730(x)
+    if (x < 1)
+        fun_l10_n689(x)
+    else
+        fun_l10_n241(x)
+    end
+end
+
+def fun_l9_n731(x)
+    if (x < 1)
+        fun_l10_n764(x)
+    else
+        fun_l10_n451(x)
+    end
+end
+
+def fun_l9_n732(x)
+    if (x < 1)
+        fun_l10_n147(x)
+    else
+        fun_l10_n998(x)
+    end
+end
+
+def fun_l9_n733(x)
+    if (x < 1)
+        fun_l10_n192(x)
+    else
+        fun_l10_n293(x)
+    end
+end
+
+def fun_l9_n734(x)
+    if (x < 1)
+        fun_l10_n207(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n735(x)
+    if (x < 1)
+        fun_l10_n457(x)
+    else
+        fun_l10_n93(x)
+    end
+end
+
+def fun_l9_n736(x)
+    if (x < 1)
+        fun_l10_n130(x)
+    else
+        fun_l10_n512(x)
+    end
+end
+
+def fun_l9_n737(x)
+    if (x < 1)
+        fun_l10_n86(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n738(x)
+    if (x < 1)
+        fun_l10_n783(x)
+    else
+        fun_l10_n981(x)
+    end
+end
+
+def fun_l9_n739(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n831(x)
+    end
+end
+
+def fun_l9_n740(x)
+    if (x < 1)
+        fun_l10_n719(x)
+    else
+        fun_l10_n422(x)
+    end
+end
+
+def fun_l9_n741(x)
+    if (x < 1)
+        fun_l10_n287(x)
+    else
+        fun_l10_n139(x)
+    end
+end
+
+def fun_l9_n742(x)
+    if (x < 1)
+        fun_l10_n533(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n743(x)
+    if (x < 1)
+        fun_l10_n550(x)
+    else
+        fun_l10_n972(x)
+    end
+end
+
+def fun_l9_n744(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n306(x)
+    end
+end
+
+def fun_l9_n745(x)
+    if (x < 1)
+        fun_l10_n755(x)
+    else
+        fun_l10_n849(x)
+    end
+end
+
+def fun_l9_n746(x)
+    if (x < 1)
+        fun_l10_n912(x)
+    else
+        fun_l10_n307(x)
+    end
+end
+
+def fun_l9_n747(x)
+    if (x < 1)
+        fun_l10_n181(x)
+    else
+        fun_l10_n476(x)
+    end
+end
+
+def fun_l9_n748(x)
+    if (x < 1)
+        fun_l10_n353(x)
+    else
+        fun_l10_n412(x)
+    end
+end
+
+def fun_l9_n749(x)
+    if (x < 1)
+        fun_l10_n187(x)
+    else
+        fun_l10_n591(x)
+    end
+end
+
+def fun_l9_n750(x)
+    if (x < 1)
+        fun_l10_n464(x)
+    else
+        fun_l10_n581(x)
+    end
+end
+
+def fun_l9_n751(x)
+    if (x < 1)
+        fun_l10_n1(x)
+    else
+        fun_l10_n557(x)
+    end
+end
+
+def fun_l9_n752(x)
+    if (x < 1)
+        fun_l10_n788(x)
+    else
+        fun_l10_n438(x)
+    end
+end
+
+def fun_l9_n753(x)
+    if (x < 1)
+        fun_l10_n535(x)
+    else
+        fun_l10_n13(x)
+    end
+end
+
+def fun_l9_n754(x)
+    if (x < 1)
+        fun_l10_n811(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n755(x)
+    if (x < 1)
+        fun_l10_n328(x)
+    else
+        fun_l10_n44(x)
+    end
+end
+
+def fun_l9_n756(x)
+    if (x < 1)
+        fun_l10_n839(x)
+    else
+        fun_l10_n16(x)
+    end
+end
+
+def fun_l9_n757(x)
+    if (x < 1)
+        fun_l10_n778(x)
+    else
+        fun_l10_n865(x)
+    end
+end
+
+def fun_l9_n758(x)
+    if (x < 1)
+        fun_l10_n552(x)
+    else
+        fun_l10_n783(x)
+    end
+end
+
+def fun_l9_n759(x)
+    if (x < 1)
+        fun_l10_n293(x)
+    else
+        fun_l10_n140(x)
+    end
+end
+
+def fun_l9_n760(x)
+    if (x < 1)
+        fun_l10_n814(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n761(x)
+    if (x < 1)
+        fun_l10_n922(x)
+    else
+        fun_l10_n986(x)
+    end
+end
+
+def fun_l9_n762(x)
+    if (x < 1)
+        fun_l10_n100(x)
+    else
+        fun_l10_n346(x)
+    end
+end
+
+def fun_l9_n763(x)
+    if (x < 1)
+        fun_l10_n738(x)
+    else
+        fun_l10_n223(x)
+    end
+end
+
+def fun_l9_n764(x)
+    if (x < 1)
+        fun_l10_n168(x)
+    else
+        fun_l10_n367(x)
+    end
+end
+
+def fun_l9_n765(x)
+    if (x < 1)
+        fun_l10_n929(x)
+    else
+        fun_l10_n684(x)
+    end
+end
+
+def fun_l9_n766(x)
+    if (x < 1)
+        fun_l10_n940(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n767(x)
+    if (x < 1)
+        fun_l10_n198(x)
+    else
+        fun_l10_n386(x)
+    end
+end
+
+def fun_l9_n768(x)
+    if (x < 1)
+        fun_l10_n667(x)
+    else
+        fun_l10_n913(x)
+    end
+end
+
+def fun_l9_n769(x)
+    if (x < 1)
+        fun_l10_n210(x)
+    else
+        fun_l10_n233(x)
+    end
+end
+
+def fun_l9_n770(x)
+    if (x < 1)
+        fun_l10_n819(x)
+    else
+        fun_l10_n755(x)
+    end
+end
+
+def fun_l9_n771(x)
+    if (x < 1)
+        fun_l10_n519(x)
+    else
+        fun_l10_n554(x)
+    end
+end
+
+def fun_l9_n772(x)
+    if (x < 1)
+        fun_l10_n880(x)
+    else
+        fun_l10_n280(x)
+    end
+end
+
+def fun_l9_n773(x)
+    if (x < 1)
+        fun_l10_n368(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n774(x)
+    if (x < 1)
+        fun_l10_n447(x)
+    else
+        fun_l10_n918(x)
+    end
+end
+
+def fun_l9_n775(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n35(x)
+    end
+end
+
+def fun_l9_n776(x)
+    if (x < 1)
+        fun_l10_n339(x)
+    else
+        fun_l10_n309(x)
+    end
+end
+
+def fun_l9_n777(x)
+    if (x < 1)
+        fun_l10_n948(x)
+    else
+        fun_l10_n967(x)
+    end
+end
+
+def fun_l9_n778(x)
+    if (x < 1)
+        fun_l10_n561(x)
+    else
+        fun_l10_n202(x)
+    end
+end
+
+def fun_l9_n779(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n356(x)
+    end
+end
+
+def fun_l9_n780(x)
+    if (x < 1)
+        fun_l10_n459(x)
+    else
+        fun_l10_n358(x)
+    end
+end
+
+def fun_l9_n781(x)
+    if (x < 1)
+        fun_l10_n543(x)
+    else
+        fun_l10_n229(x)
+    end
+end
+
+def fun_l9_n782(x)
+    if (x < 1)
+        fun_l10_n422(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n783(x)
+    if (x < 1)
+        fun_l10_n222(x)
+    else
+        fun_l10_n63(x)
+    end
+end
+
+def fun_l9_n784(x)
+    if (x < 1)
+        fun_l10_n520(x)
+    else
+        fun_l10_n443(x)
+    end
+end
+
+def fun_l9_n785(x)
+    if (x < 1)
+        fun_l10_n894(x)
+    else
+        fun_l10_n379(x)
+    end
+end
+
+def fun_l9_n786(x)
+    if (x < 1)
+        fun_l10_n362(x)
+    else
+        fun_l10_n676(x)
+    end
+end
+
+def fun_l9_n787(x)
+    if (x < 1)
+        fun_l10_n545(x)
+    else
+        fun_l10_n263(x)
+    end
+end
+
+def fun_l9_n788(x)
+    if (x < 1)
+        fun_l10_n322(x)
+    else
+        fun_l10_n631(x)
+    end
+end
+
+def fun_l9_n789(x)
+    if (x < 1)
+        fun_l10_n916(x)
+    else
+        fun_l10_n877(x)
+    end
+end
+
+def fun_l9_n790(x)
+    if (x < 1)
+        fun_l10_n443(x)
+    else
+        fun_l10_n640(x)
+    end
+end
+
+def fun_l9_n791(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n686(x)
+    end
+end
+
+def fun_l9_n792(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n793(x)
+    if (x < 1)
+        fun_l10_n939(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n794(x)
+    if (x < 1)
+        fun_l10_n506(x)
+    else
+        fun_l10_n782(x)
+    end
+end
+
+def fun_l9_n795(x)
+    if (x < 1)
+        fun_l10_n619(x)
+    else
+        fun_l10_n439(x)
+    end
+end
+
+def fun_l9_n796(x)
+    if (x < 1)
+        fun_l10_n748(x)
+    else
+        fun_l10_n61(x)
+    end
+end
+
+def fun_l9_n797(x)
+    if (x < 1)
+        fun_l10_n217(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n798(x)
+    if (x < 1)
+        fun_l10_n310(x)
+    else
+        fun_l10_n445(x)
+    end
+end
+
+def fun_l9_n799(x)
+    if (x < 1)
+        fun_l10_n262(x)
+    else
+        fun_l10_n776(x)
+    end
+end
+
+def fun_l9_n800(x)
+    if (x < 1)
+        fun_l10_n807(x)
+    else
+        fun_l10_n566(x)
+    end
+end
+
+def fun_l9_n801(x)
+    if (x < 1)
+        fun_l10_n466(x)
+    else
+        fun_l10_n287(x)
+    end
+end
+
+def fun_l9_n802(x)
+    if (x < 1)
+        fun_l10_n205(x)
+    else
+        fun_l10_n415(x)
+    end
+end
+
+def fun_l9_n803(x)
+    if (x < 1)
+        fun_l10_n618(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n804(x)
+    if (x < 1)
+        fun_l10_n248(x)
+    else
+        fun_l10_n32(x)
+    end
+end
+
+def fun_l9_n805(x)
+    if (x < 1)
+        fun_l10_n537(x)
+    else
+        fun_l10_n844(x)
+    end
+end
+
+def fun_l9_n806(x)
+    if (x < 1)
+        fun_l10_n554(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n807(x)
+    if (x < 1)
+        fun_l10_n774(x)
+    else
+        fun_l10_n486(x)
+    end
+end
+
+def fun_l9_n808(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n926(x)
+    end
+end
+
+def fun_l9_n809(x)
+    if (x < 1)
+        fun_l10_n601(x)
+    else
+        fun_l10_n696(x)
+    end
+end
+
+def fun_l9_n810(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n948(x)
+    end
+end
+
+def fun_l9_n811(x)
+    if (x < 1)
+        fun_l10_n658(x)
+    else
+        fun_l10_n840(x)
+    end
+end
+
+def fun_l9_n812(x)
+    if (x < 1)
+        fun_l10_n913(x)
+    else
+        fun_l10_n892(x)
+    end
+end
+
+def fun_l9_n813(x)
+    if (x < 1)
+        fun_l10_n440(x)
+    else
+        fun_l10_n204(x)
+    end
+end
+
+def fun_l9_n814(x)
+    if (x < 1)
+        fun_l10_n273(x)
+    else
+        fun_l10_n816(x)
+    end
+end
+
+def fun_l9_n815(x)
+    if (x < 1)
+        fun_l10_n190(x)
+    else
+        fun_l10_n735(x)
+    end
+end
+
+def fun_l9_n816(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n30(x)
+    end
+end
+
+def fun_l9_n817(x)
+    if (x < 1)
+        fun_l10_n697(x)
+    else
+        fun_l10_n985(x)
+    end
+end
+
+def fun_l9_n818(x)
+    if (x < 1)
+        fun_l10_n583(x)
+    else
+        fun_l10_n314(x)
+    end
+end
+
+def fun_l9_n819(x)
+    if (x < 1)
+        fun_l10_n149(x)
+    else
+        fun_l10_n556(x)
+    end
+end
+
+def fun_l9_n820(x)
+    if (x < 1)
+        fun_l10_n634(x)
+    else
+        fun_l10_n392(x)
+    end
+end
+
+def fun_l9_n821(x)
+    if (x < 1)
+        fun_l10_n401(x)
+    else
+        fun_l10_n217(x)
+    end
+end
+
+def fun_l9_n822(x)
+    if (x < 1)
+        fun_l10_n564(x)
+    else
+        fun_l10_n860(x)
+    end
+end
+
+def fun_l9_n823(x)
+    if (x < 1)
+        fun_l10_n901(x)
+    else
+        fun_l10_n836(x)
+    end
+end
+
+def fun_l9_n824(x)
+    if (x < 1)
+        fun_l10_n526(x)
+    else
+        fun_l10_n660(x)
+    end
+end
+
+def fun_l9_n825(x)
+    if (x < 1)
+        fun_l10_n245(x)
+    else
+        fun_l10_n914(x)
+    end
+end
+
+def fun_l9_n826(x)
+    if (x < 1)
+        fun_l10_n712(x)
+    else
+        fun_l10_n928(x)
+    end
+end
+
+def fun_l9_n827(x)
+    if (x < 1)
+        fun_l10_n596(x)
+    else
+        fun_l10_n803(x)
+    end
+end
+
+def fun_l9_n828(x)
+    if (x < 1)
+        fun_l10_n454(x)
+    else
+        fun_l10_n679(x)
+    end
+end
+
+def fun_l9_n829(x)
+    if (x < 1)
+        fun_l10_n104(x)
+    else
+        fun_l10_n137(x)
+    end
+end
+
+def fun_l9_n830(x)
+    if (x < 1)
+        fun_l10_n516(x)
+    else
+        fun_l10_n687(x)
+    end
+end
+
+def fun_l9_n831(x)
+    if (x < 1)
+        fun_l10_n720(x)
+    else
+        fun_l10_n770(x)
+    end
+end
+
+def fun_l9_n832(x)
+    if (x < 1)
+        fun_l10_n939(x)
+    else
+        fun_l10_n119(x)
+    end
+end
+
+def fun_l9_n833(x)
+    if (x < 1)
+        fun_l10_n515(x)
+    else
+        fun_l10_n71(x)
+    end
+end
+
+def fun_l9_n834(x)
+    if (x < 1)
+        fun_l10_n668(x)
+    else
+        fun_l10_n521(x)
+    end
+end
+
+def fun_l9_n835(x)
+    if (x < 1)
+        fun_l10_n405(x)
+    else
+        fun_l10_n69(x)
+    end
+end
+
+def fun_l9_n836(x)
+    if (x < 1)
+        fun_l10_n201(x)
+    else
+        fun_l10_n681(x)
+    end
+end
+
+def fun_l9_n837(x)
+    if (x < 1)
+        fun_l10_n161(x)
+    else
+        fun_l10_n258(x)
+    end
+end
+
+def fun_l9_n838(x)
+    if (x < 1)
+        fun_l10_n913(x)
+    else
+        fun_l10_n586(x)
+    end
+end
+
+def fun_l9_n839(x)
+    if (x < 1)
+        fun_l10_n566(x)
+    else
+        fun_l10_n543(x)
+    end
+end
+
+def fun_l9_n840(x)
+    if (x < 1)
+        fun_l10_n547(x)
+    else
+        fun_l10_n570(x)
+    end
+end
+
+def fun_l9_n841(x)
+    if (x < 1)
+        fun_l10_n888(x)
+    else
+        fun_l10_n843(x)
+    end
+end
+
+def fun_l9_n842(x)
+    if (x < 1)
+        fun_l10_n497(x)
+    else
+        fun_l10_n985(x)
+    end
+end
+
+def fun_l9_n843(x)
+    if (x < 1)
+        fun_l10_n754(x)
+    else
+        fun_l10_n390(x)
+    end
+end
+
+def fun_l9_n844(x)
+    if (x < 1)
+        fun_l10_n625(x)
+    else
+        fun_l10_n562(x)
+    end
+end
+
+def fun_l9_n845(x)
+    if (x < 1)
+        fun_l10_n858(x)
+    else
+        fun_l10_n553(x)
+    end
+end
+
+def fun_l9_n846(x)
+    if (x < 1)
+        fun_l10_n145(x)
+    else
+        fun_l10_n551(x)
+    end
+end
+
+def fun_l9_n847(x)
+    if (x < 1)
+        fun_l10_n916(x)
+    else
+        fun_l10_n851(x)
+    end
+end
+
+def fun_l9_n848(x)
+    if (x < 1)
+        fun_l10_n935(x)
+    else
+        fun_l10_n448(x)
+    end
+end
+
+def fun_l9_n849(x)
+    if (x < 1)
+        fun_l10_n664(x)
+    else
+        fun_l10_n832(x)
+    end
+end
+
+def fun_l9_n850(x)
+    if (x < 1)
+        fun_l10_n904(x)
+    else
+        fun_l10_n203(x)
+    end
+end
+
+def fun_l9_n851(x)
+    if (x < 1)
+        fun_l10_n863(x)
+    else
+        fun_l10_n491(x)
+    end
+end
+
+def fun_l9_n852(x)
+    if (x < 1)
+        fun_l10_n930(x)
+    else
+        fun_l10_n248(x)
+    end
+end
+
+def fun_l9_n853(x)
+    if (x < 1)
+        fun_l10_n637(x)
+    else
+        fun_l10_n716(x)
+    end
+end
+
+def fun_l9_n854(x)
+    if (x < 1)
+        fun_l10_n35(x)
+    else
+        fun_l10_n662(x)
+    end
+end
+
+def fun_l9_n855(x)
+    if (x < 1)
+        fun_l10_n57(x)
+    else
+        fun_l10_n392(x)
+    end
+end
+
+def fun_l9_n856(x)
+    if (x < 1)
+        fun_l10_n480(x)
+    else
+        fun_l10_n447(x)
+    end
+end
+
+def fun_l9_n857(x)
+    if (x < 1)
+        fun_l10_n134(x)
+    else
+        fun_l10_n842(x)
+    end
+end
+
+def fun_l9_n858(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n577(x)
+    end
+end
+
+def fun_l9_n859(x)
+    if (x < 1)
+        fun_l10_n718(x)
+    else
+        fun_l10_n571(x)
+    end
+end
+
+def fun_l9_n860(x)
+    if (x < 1)
+        fun_l10_n237(x)
+    else
+        fun_l10_n654(x)
+    end
+end
+
+def fun_l9_n861(x)
+    if (x < 1)
+        fun_l10_n807(x)
+    else
+        fun_l10_n409(x)
+    end
+end
+
+def fun_l9_n862(x)
+    if (x < 1)
+        fun_l10_n801(x)
+    else
+        fun_l10_n575(x)
+    end
+end
+
+def fun_l9_n863(x)
+    if (x < 1)
+        fun_l10_n500(x)
+    else
+        fun_l10_n133(x)
+    end
+end
+
+def fun_l9_n864(x)
+    if (x < 1)
+        fun_l10_n403(x)
+    else
+        fun_l10_n720(x)
+    end
+end
+
+def fun_l9_n865(x)
+    if (x < 1)
+        fun_l10_n648(x)
+    else
+        fun_l10_n677(x)
+    end
+end
+
+def fun_l9_n866(x)
+    if (x < 1)
+        fun_l10_n873(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n867(x)
+    if (x < 1)
+        fun_l10_n459(x)
+    else
+        fun_l10_n331(x)
+    end
+end
+
+def fun_l9_n868(x)
+    if (x < 1)
+        fun_l10_n159(x)
+    else
+        fun_l10_n64(x)
+    end
+end
+
+def fun_l9_n869(x)
+    if (x < 1)
+        fun_l10_n155(x)
+    else
+        fun_l10_n41(x)
+    end
+end
+
+def fun_l9_n870(x)
+    if (x < 1)
+        fun_l10_n947(x)
+    else
+        fun_l10_n386(x)
+    end
+end
+
+def fun_l9_n871(x)
+    if (x < 1)
+        fun_l10_n868(x)
+    else
+        fun_l10_n794(x)
+    end
+end
+
+def fun_l9_n872(x)
+    if (x < 1)
+        fun_l10_n77(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n873(x)
+    if (x < 1)
+        fun_l10_n119(x)
+    else
+        fun_l10_n819(x)
+    end
+end
+
+def fun_l9_n874(x)
+    if (x < 1)
+        fun_l10_n143(x)
+    else
+        fun_l10_n434(x)
+    end
+end
+
+def fun_l9_n875(x)
+    if (x < 1)
+        fun_l10_n238(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n876(x)
+    if (x < 1)
+        fun_l10_n687(x)
+    else
+        fun_l10_n384(x)
+    end
+end
+
+def fun_l9_n877(x)
+    if (x < 1)
+        fun_l10_n27(x)
+    else
+        fun_l10_n138(x)
+    end
+end
+
+def fun_l9_n878(x)
+    if (x < 1)
+        fun_l10_n208(x)
+    else
+        fun_l10_n691(x)
+    end
+end
+
+def fun_l9_n879(x)
+    if (x < 1)
+        fun_l10_n793(x)
+    else
+        fun_l10_n165(x)
+    end
+end
+
+def fun_l9_n880(x)
+    if (x < 1)
+        fun_l10_n358(x)
+    else
+        fun_l10_n455(x)
+    end
+end
+
+def fun_l9_n881(x)
+    if (x < 1)
+        fun_l10_n558(x)
+    else
+        fun_l10_n184(x)
+    end
+end
+
+def fun_l9_n882(x)
+    if (x < 1)
+        fun_l10_n461(x)
+    else
+        fun_l10_n155(x)
+    end
+end
+
+def fun_l9_n883(x)
+    if (x < 1)
+        fun_l10_n503(x)
+    else
+        fun_l10_n225(x)
+    end
+end
+
+def fun_l9_n884(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n262(x)
+    end
+end
+
+def fun_l9_n885(x)
+    if (x < 1)
+        fun_l10_n565(x)
+    else
+        fun_l10_n633(x)
+    end
+end
+
+def fun_l9_n886(x)
+    if (x < 1)
+        fun_l10_n626(x)
+    else
+        fun_l10_n796(x)
+    end
+end
+
+def fun_l9_n887(x)
+    if (x < 1)
+        fun_l10_n424(x)
+    else
+        fun_l10_n458(x)
+    end
+end
+
+def fun_l9_n888(x)
+    if (x < 1)
+        fun_l10_n687(x)
+    else
+        fun_l10_n145(x)
+    end
+end
+
+def fun_l9_n889(x)
+    if (x < 1)
+        fun_l10_n787(x)
+    else
+        fun_l10_n225(x)
+    end
+end
+
+def fun_l9_n890(x)
+    if (x < 1)
+        fun_l10_n249(x)
+    else
+        fun_l10_n154(x)
+    end
+end
+
+def fun_l9_n891(x)
+    if (x < 1)
+        fun_l10_n38(x)
+    else
+        fun_l10_n635(x)
+    end
+end
+
+def fun_l9_n892(x)
+    if (x < 1)
+        fun_l10_n920(x)
+    else
+        fun_l10_n478(x)
+    end
+end
+
+def fun_l9_n893(x)
+    if (x < 1)
+        fun_l10_n13(x)
+    else
+        fun_l10_n174(x)
+    end
+end
+
+def fun_l9_n894(x)
+    if (x < 1)
+        fun_l10_n304(x)
+    else
+        fun_l10_n495(x)
+    end
+end
+
+def fun_l9_n895(x)
+    if (x < 1)
+        fun_l10_n226(x)
+    else
+        fun_l10_n420(x)
+    end
+end
+
+def fun_l9_n896(x)
+    if (x < 1)
+        fun_l10_n86(x)
+    else
+        fun_l10_n837(x)
+    end
+end
+
+def fun_l9_n897(x)
+    if (x < 1)
+        fun_l10_n927(x)
+    else
+        fun_l10_n344(x)
+    end
+end
+
+def fun_l9_n898(x)
+    if (x < 1)
+        fun_l10_n87(x)
+    else
+        fun_l10_n270(x)
+    end
+end
+
+def fun_l9_n899(x)
+    if (x < 1)
+        fun_l10_n549(x)
+    else
+        fun_l10_n349(x)
+    end
+end
+
+def fun_l9_n900(x)
+    if (x < 1)
+        fun_l10_n456(x)
+    else
+        fun_l10_n345(x)
+    end
+end
+
+def fun_l9_n901(x)
+    if (x < 1)
+        fun_l10_n154(x)
+    else
+        fun_l10_n764(x)
+    end
+end
+
+def fun_l9_n902(x)
+    if (x < 1)
+        fun_l10_n614(x)
+    else
+        fun_l10_n536(x)
+    end
+end
+
+def fun_l9_n903(x)
+    if (x < 1)
+        fun_l10_n108(x)
+    else
+        fun_l10_n197(x)
+    end
+end
+
+def fun_l9_n904(x)
+    if (x < 1)
+        fun_l10_n616(x)
+    else
+        fun_l10_n777(x)
+    end
+end
+
+def fun_l9_n905(x)
+    if (x < 1)
+        fun_l10_n515(x)
+    else
+        fun_l10_n830(x)
+    end
+end
+
+def fun_l9_n906(x)
+    if (x < 1)
+        fun_l10_n288(x)
+    else
+        fun_l10_n717(x)
+    end
+end
+
+def fun_l9_n907(x)
+    if (x < 1)
+        fun_l10_n704(x)
+    else
+        fun_l10_n962(x)
+    end
+end
+
+def fun_l9_n908(x)
+    if (x < 1)
+        fun_l10_n85(x)
+    else
+        fun_l10_n70(x)
+    end
+end
+
+def fun_l9_n909(x)
+    if (x < 1)
+        fun_l10_n806(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n910(x)
+    if (x < 1)
+        fun_l10_n567(x)
+    else
+        fun_l10_n47(x)
+    end
+end
+
+def fun_l9_n911(x)
+    if (x < 1)
+        fun_l10_n919(x)
+    else
+        fun_l10_n879(x)
+    end
+end
+
+def fun_l9_n912(x)
+    if (x < 1)
+        fun_l10_n229(x)
+    else
+        fun_l10_n200(x)
+    end
+end
+
+def fun_l9_n913(x)
+    if (x < 1)
+        fun_l10_n502(x)
+    else
+        fun_l10_n820(x)
+    end
+end
+
+def fun_l9_n914(x)
+    if (x < 1)
+        fun_l10_n57(x)
+    else
+        fun_l10_n470(x)
+    end
+end
+
+def fun_l9_n915(x)
+    if (x < 1)
+        fun_l10_n909(x)
+    else
+        fun_l10_n845(x)
+    end
+end
+
+def fun_l9_n916(x)
+    if (x < 1)
+        fun_l10_n658(x)
+    else
+        fun_l10_n925(x)
+    end
+end
+
+def fun_l9_n917(x)
+    if (x < 1)
+        fun_l10_n886(x)
+    else
+        fun_l10_n285(x)
+    end
+end
+
+def fun_l9_n918(x)
+    if (x < 1)
+        fun_l10_n484(x)
+    else
+        fun_l10_n712(x)
+    end
+end
+
+def fun_l9_n919(x)
+    if (x < 1)
+        fun_l10_n299(x)
+    else
+        fun_l10_n144(x)
+    end
+end
+
+def fun_l9_n920(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n913(x)
+    end
+end
+
+def fun_l9_n921(x)
+    if (x < 1)
+        fun_l10_n306(x)
+    else
+        fun_l10_n242(x)
+    end
+end
+
+def fun_l9_n922(x)
+    if (x < 1)
+        fun_l10_n442(x)
+    else
+        fun_l10_n497(x)
+    end
+end
+
+def fun_l9_n923(x)
+    if (x < 1)
+        fun_l10_n22(x)
+    else
+        fun_l10_n376(x)
+    end
+end
+
+def fun_l9_n924(x)
+    if (x < 1)
+        fun_l10_n737(x)
+    else
+        fun_l10_n603(x)
+    end
+end
+
+def fun_l9_n925(x)
+    if (x < 1)
+        fun_l10_n300(x)
+    else
+        fun_l10_n974(x)
+    end
+end
+
+def fun_l9_n926(x)
+    if (x < 1)
+        fun_l10_n644(x)
+    else
+        fun_l10_n973(x)
+    end
+end
+
+def fun_l9_n927(x)
+    if (x < 1)
+        fun_l10_n413(x)
+    else
+        fun_l10_n353(x)
+    end
+end
+
+def fun_l9_n928(x)
+    if (x < 1)
+        fun_l10_n438(x)
+    else
+        fun_l10_n518(x)
+    end
+end
+
+def fun_l9_n929(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n207(x)
+    end
+end
+
+def fun_l9_n930(x)
+    if (x < 1)
+        fun_l10_n976(x)
+    else
+        fun_l10_n70(x)
+    end
+end
+
+def fun_l9_n931(x)
+    if (x < 1)
+        fun_l10_n5(x)
+    else
+        fun_l10_n37(x)
+    end
+end
+
+def fun_l9_n932(x)
+    if (x < 1)
+        fun_l10_n612(x)
+    else
+        fun_l10_n268(x)
+    end
+end
+
+def fun_l9_n933(x)
+    if (x < 1)
+        fun_l10_n81(x)
+    else
+        fun_l10_n373(x)
+    end
+end
+
+def fun_l9_n934(x)
+    if (x < 1)
+        fun_l10_n30(x)
+    else
+        fun_l10_n504(x)
+    end
+end
+
+def fun_l9_n935(x)
+    if (x < 1)
+        fun_l10_n131(x)
+    else
+        fun_l10_n617(x)
+    end
+end
+
+def fun_l9_n936(x)
+    if (x < 1)
+        fun_l10_n114(x)
+    else
+        fun_l10_n883(x)
+    end
+end
+
+def fun_l9_n937(x)
+    if (x < 1)
+        fun_l10_n859(x)
+    else
+        fun_l10_n788(x)
+    end
+end
+
+def fun_l9_n938(x)
+    if (x < 1)
+        fun_l10_n993(x)
+    else
+        fun_l10_n349(x)
+    end
+end
+
+def fun_l9_n939(x)
+    if (x < 1)
+        fun_l10_n775(x)
+    else
+        fun_l10_n195(x)
+    end
+end
+
+def fun_l9_n940(x)
+    if (x < 1)
+        fun_l10_n829(x)
+    else
+        fun_l10_n398(x)
+    end
+end
+
+def fun_l9_n941(x)
+    if (x < 1)
+        fun_l10_n906(x)
+    else
+        fun_l10_n529(x)
+    end
+end
+
+def fun_l9_n942(x)
+    if (x < 1)
+        fun_l10_n965(x)
+    else
+        fun_l10_n372(x)
+    end
+end
+
+def fun_l9_n943(x)
+    if (x < 1)
+        fun_l10_n953(x)
+    else
+        fun_l10_n397(x)
+    end
+end
+
+def fun_l9_n944(x)
+    if (x < 1)
+        fun_l10_n984(x)
+    else
+        fun_l10_n909(x)
+    end
+end
+
+def fun_l9_n945(x)
+    if (x < 1)
+        fun_l10_n649(x)
+    else
+        fun_l10_n304(x)
+    end
+end
+
+def fun_l9_n946(x)
+    if (x < 1)
+        fun_l10_n0(x)
+    else
+        fun_l10_n922(x)
+    end
+end
+
+def fun_l9_n947(x)
+    if (x < 1)
+        fun_l10_n460(x)
+    else
+        fun_l10_n215(x)
+    end
+end
+
+def fun_l9_n948(x)
+    if (x < 1)
+        fun_l10_n251(x)
+    else
+        fun_l10_n636(x)
+    end
+end
+
+def fun_l9_n949(x)
+    if (x < 1)
+        fun_l10_n14(x)
+    else
+        fun_l10_n494(x)
+    end
+end
+
+def fun_l9_n950(x)
+    if (x < 1)
+        fun_l10_n6(x)
+    else
+        fun_l10_n523(x)
+    end
+end
+
+def fun_l9_n951(x)
+    if (x < 1)
+        fun_l10_n705(x)
+    else
+        fun_l10_n689(x)
+    end
+end
+
+def fun_l9_n952(x)
+    if (x < 1)
+        fun_l10_n830(x)
+    else
+        fun_l10_n374(x)
+    end
+end
+
+def fun_l9_n953(x)
+    if (x < 1)
+        fun_l10_n451(x)
+    else
+        fun_l10_n87(x)
+    end
+end
+
+def fun_l9_n954(x)
+    if (x < 1)
+        fun_l10_n202(x)
+    else
+        fun_l10_n753(x)
+    end
+end
+
+def fun_l9_n955(x)
+    if (x < 1)
+        fun_l10_n384(x)
+    else
+        fun_l10_n216(x)
+    end
+end
+
+def fun_l9_n956(x)
+    if (x < 1)
+        fun_l10_n381(x)
+    else
+        fun_l10_n727(x)
+    end
+end
+
+def fun_l9_n957(x)
+    if (x < 1)
+        fun_l10_n876(x)
+    else
+        fun_l10_n760(x)
+    end
+end
+
+def fun_l9_n958(x)
+    if (x < 1)
+        fun_l10_n975(x)
+    else
+        fun_l10_n372(x)
+    end
+end
+
+def fun_l9_n959(x)
+    if (x < 1)
+        fun_l10_n714(x)
+    else
+        fun_l10_n680(x)
+    end
+end
+
+def fun_l9_n960(x)
+    if (x < 1)
+        fun_l10_n733(x)
+    else
+        fun_l10_n508(x)
+    end
+end
+
+def fun_l9_n961(x)
+    if (x < 1)
+        fun_l10_n319(x)
+    else
+        fun_l10_n90(x)
+    end
+end
+
+def fun_l9_n962(x)
+    if (x < 1)
+        fun_l10_n964(x)
+    else
+        fun_l10_n282(x)
+    end
+end
+
+def fun_l9_n963(x)
+    if (x < 1)
+        fun_l10_n179(x)
+    else
+        fun_l10_n324(x)
+    end
+end
+
+def fun_l9_n964(x)
+    if (x < 1)
+        fun_l10_n627(x)
+    else
+        fun_l10_n627(x)
+    end
+end
+
+def fun_l9_n965(x)
+    if (x < 1)
+        fun_l10_n7(x)
+    else
+        fun_l10_n375(x)
+    end
+end
+
+def fun_l9_n966(x)
+    if (x < 1)
+        fun_l10_n960(x)
+    else
+        fun_l10_n272(x)
+    end
+end
+
+def fun_l9_n967(x)
+    if (x < 1)
+        fun_l10_n869(x)
+    else
+        fun_l10_n737(x)
+    end
+end
+
+def fun_l9_n968(x)
+    if (x < 1)
+        fun_l10_n621(x)
+    else
+        fun_l10_n413(x)
+    end
+end
+
+def fun_l9_n969(x)
+    if (x < 1)
+        fun_l10_n258(x)
+    else
+        fun_l10_n105(x)
+    end
+end
+
+def fun_l9_n970(x)
+    if (x < 1)
+        fun_l10_n817(x)
+    else
+        fun_l10_n519(x)
+    end
+end
+
+def fun_l9_n971(x)
+    if (x < 1)
+        fun_l10_n462(x)
+    else
+        fun_l10_n335(x)
+    end
+end
+
+def fun_l9_n972(x)
+    if (x < 1)
+        fun_l10_n770(x)
+    else
+        fun_l10_n856(x)
+    end
+end
+
+def fun_l9_n973(x)
+    if (x < 1)
+        fun_l10_n607(x)
+    else
+        fun_l10_n142(x)
+    end
+end
+
+def fun_l9_n974(x)
+    if (x < 1)
+        fun_l10_n498(x)
+    else
+        fun_l10_n373(x)
+    end
+end
+
+def fun_l9_n975(x)
+    if (x < 1)
+        fun_l10_n239(x)
+    else
+        fun_l10_n895(x)
+    end
+end
+
+def fun_l9_n976(x)
+    if (x < 1)
+        fun_l10_n312(x)
+    else
+        fun_l10_n489(x)
+    end
+end
+
+def fun_l9_n977(x)
+    if (x < 1)
+        fun_l10_n595(x)
+    else
+        fun_l10_n674(x)
+    end
+end
+
+def fun_l9_n978(x)
+    if (x < 1)
+        fun_l10_n928(x)
+    else
+        fun_l10_n774(x)
+    end
+end
+
+def fun_l9_n979(x)
+    if (x < 1)
+        fun_l10_n964(x)
+    else
+        fun_l10_n860(x)
+    end
+end
+
+def fun_l9_n980(x)
+    if (x < 1)
+        fun_l10_n63(x)
+    else
+        fun_l10_n115(x)
+    end
+end
+
+def fun_l9_n981(x)
+    if (x < 1)
+        fun_l10_n930(x)
+    else
+        fun_l10_n559(x)
+    end
+end
+
+def fun_l9_n982(x)
+    if (x < 1)
+        fun_l10_n391(x)
+    else
+        fun_l10_n411(x)
+    end
+end
+
+def fun_l9_n983(x)
+    if (x < 1)
+        fun_l10_n71(x)
+    else
+        fun_l10_n632(x)
+    end
+end
+
+def fun_l9_n984(x)
+    if (x < 1)
+        fun_l10_n613(x)
+    else
+        fun_l10_n218(x)
+    end
+end
+
+def fun_l9_n985(x)
+    if (x < 1)
+        fun_l10_n263(x)
+    else
+        fun_l10_n858(x)
+    end
+end
+
+def fun_l9_n986(x)
+    if (x < 1)
+        fun_l10_n974(x)
+    else
+        fun_l10_n824(x)
+    end
+end
+
+def fun_l9_n987(x)
+    if (x < 1)
+        fun_l10_n636(x)
+    else
+        fun_l10_n55(x)
+    end
+end
+
+def fun_l9_n988(x)
+    if (x < 1)
+        fun_l10_n367(x)
+    else
+        fun_l10_n878(x)
+    end
+end
+
+def fun_l9_n989(x)
+    if (x < 1)
+        fun_l10_n316(x)
+    else
+        fun_l10_n800(x)
+    end
+end
+
+def fun_l9_n990(x)
+    if (x < 1)
+        fun_l10_n581(x)
+    else
+        fun_l10_n511(x)
+    end
+end
+
+def fun_l9_n991(x)
+    if (x < 1)
+        fun_l10_n667(x)
+    else
+        fun_l10_n566(x)
+    end
+end
+
+def fun_l9_n992(x)
+    if (x < 1)
+        fun_l10_n144(x)
+    else
+        fun_l10_n51(x)
+    end
+end
+
+def fun_l9_n993(x)
+    if (x < 1)
+        fun_l10_n652(x)
+    else
+        fun_l10_n436(x)
+    end
+end
+
+def fun_l9_n994(x)
+    if (x < 1)
+        fun_l10_n283(x)
+    else
+        fun_l10_n480(x)
+    end
+end
+
+def fun_l9_n995(x)
+    if (x < 1)
+        fun_l10_n908(x)
+    else
+        fun_l10_n86(x)
+    end
+end
+
+def fun_l9_n996(x)
+    if (x < 1)
+        fun_l10_n43(x)
+    else
+        fun_l10_n466(x)
+    end
+end
+
+def fun_l9_n997(x)
+    if (x < 1)
+        fun_l10_n968(x)
+    else
+        fun_l10_n97(x)
+    end
+end
+
+def fun_l9_n998(x)
+    if (x < 1)
+        fun_l10_n38(x)
+    else
+        fun_l10_n78(x)
+    end
+end
+
+def fun_l9_n999(x)
+    if (x < 1)
+        fun_l10_n947(x)
+    else
+        fun_l10_n322(x)
+    end
+end
+
+def fun_l10_n0(x)
+    if (x < 1)
+        fun_l11_n424(x)
+    else
+        fun_l11_n206(x)
+    end
+end
+
+def fun_l10_n1(x)
+    if (x < 1)
+        fun_l11_n263(x)
+    else
+        fun_l11_n886(x)
+    end
+end
+
+def fun_l10_n2(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n3(x)
+    if (x < 1)
+        fun_l11_n924(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n4(x)
+    if (x < 1)
+        fun_l11_n552(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n5(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n127(x)
+    end
+end
+
+def fun_l10_n6(x)
+    if (x < 1)
+        fun_l11_n284(x)
+    else
+        fun_l11_n952(x)
+    end
+end
+
+def fun_l10_n7(x)
+    if (x < 1)
+        fun_l11_n294(x)
+    else
+        fun_l11_n527(x)
+    end
+end
+
+def fun_l10_n8(x)
+    if (x < 1)
+        fun_l11_n675(x)
+    else
+        fun_l11_n457(x)
+    end
+end
+
+def fun_l10_n9(x)
+    if (x < 1)
+        fun_l11_n908(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n10(x)
+    if (x < 1)
+        fun_l11_n361(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n11(x)
+    if (x < 1)
+        fun_l11_n402(x)
+    else
+        fun_l11_n228(x)
+    end
+end
+
+def fun_l10_n12(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n13(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n14(x)
+    if (x < 1)
+        fun_l11_n987(x)
+    else
+        fun_l11_n870(x)
+    end
+end
+
+def fun_l10_n15(x)
+    if (x < 1)
+        fun_l11_n538(x)
+    else
+        fun_l11_n837(x)
+    end
+end
+
+def fun_l10_n16(x)
+    if (x < 1)
+        fun_l11_n205(x)
+    else
+        fun_l11_n831(x)
+    end
+end
+
+def fun_l10_n17(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n242(x)
+    end
+end
+
+def fun_l10_n18(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n103(x)
+    end
+end
+
+def fun_l10_n19(x)
+    if (x < 1)
+        fun_l11_n928(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n20(x)
+    if (x < 1)
+        fun_l11_n816(x)
+    else
+        fun_l11_n225(x)
+    end
+end
+
+def fun_l10_n21(x)
+    if (x < 1)
+        fun_l11_n52(x)
+    else
+        fun_l11_n901(x)
+    end
+end
+
+def fun_l10_n22(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n556(x)
+    end
+end
+
+def fun_l10_n23(x)
+    if (x < 1)
+        fun_l11_n103(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n24(x)
+    if (x < 1)
+        fun_l11_n14(x)
+    else
+        fun_l11_n875(x)
+    end
+end
+
+def fun_l10_n25(x)
+    if (x < 1)
+        fun_l11_n359(x)
+    else
+        fun_l11_n504(x)
+    end
+end
+
+def fun_l10_n26(x)
+    if (x < 1)
+        fun_l11_n416(x)
+    else
+        fun_l11_n172(x)
+    end
+end
+
+def fun_l10_n27(x)
+    if (x < 1)
+        fun_l11_n142(x)
+    else
+        fun_l11_n238(x)
+    end
+end
+
+def fun_l10_n28(x)
+    if (x < 1)
+        fun_l11_n319(x)
+    else
+        fun_l11_n350(x)
+    end
+end
+
+def fun_l10_n29(x)
+    if (x < 1)
+        fun_l11_n53(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n30(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n31(x)
+    if (x < 1)
+        fun_l11_n447(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n32(x)
+    if (x < 1)
+        fun_l11_n931(x)
+    else
+        fun_l11_n571(x)
+    end
+end
+
+def fun_l10_n33(x)
+    if (x < 1)
+        fun_l11_n705(x)
+    else
+        fun_l11_n544(x)
+    end
+end
+
+def fun_l10_n34(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n695(x)
+    end
+end
+
+def fun_l10_n35(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n391(x)
+    end
+end
+
+def fun_l10_n36(x)
+    if (x < 1)
+        fun_l11_n686(x)
+    else
+        fun_l11_n785(x)
+    end
+end
+
+def fun_l10_n37(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n38(x)
+    if (x < 1)
+        fun_l11_n351(x)
+    else
+        fun_l11_n732(x)
+    end
+end
+
+def fun_l10_n39(x)
+    if (x < 1)
+        fun_l11_n22(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n40(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n41(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n673(x)
+    end
+end
+
+def fun_l10_n42(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n43(x)
+    if (x < 1)
+        fun_l11_n158(x)
+    else
+        fun_l11_n774(x)
+    end
+end
+
+def fun_l10_n44(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n45(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n184(x)
+    end
+end
+
+def fun_l10_n46(x)
+    if (x < 1)
+        fun_l11_n446(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n47(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n123(x)
+    end
+end
+
+def fun_l10_n48(x)
+    if (x < 1)
+        fun_l11_n435(x)
+    else
+        fun_l11_n560(x)
+    end
+end
+
+def fun_l10_n49(x)
+    if (x < 1)
+        fun_l11_n94(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n50(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n902(x)
+    end
+end
+
+def fun_l10_n51(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n807(x)
+    end
+end
+
+def fun_l10_n52(x)
+    if (x < 1)
+        fun_l11_n414(x)
+    else
+        fun_l11_n335(x)
+    end
+end
+
+def fun_l10_n53(x)
+    if (x < 1)
+        fun_l11_n754(x)
+    else
+        fun_l11_n789(x)
+    end
+end
+
+def fun_l10_n54(x)
+    if (x < 1)
+        fun_l11_n843(x)
+    else
+        fun_l11_n980(x)
+    end
+end
+
+def fun_l10_n55(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n160(x)
+    end
+end
+
+def fun_l10_n56(x)
+    if (x < 1)
+        fun_l11_n564(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n57(x)
+    if (x < 1)
+        fun_l11_n158(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n58(x)
+    if (x < 1)
+        fun_l11_n120(x)
+    else
+        fun_l11_n970(x)
+    end
+end
+
+def fun_l10_n59(x)
+    if (x < 1)
+        fun_l11_n561(x)
+    else
+        fun_l11_n872(x)
+    end
+end
+
+def fun_l10_n60(x)
+    if (x < 1)
+        fun_l11_n93(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n61(x)
+    if (x < 1)
+        fun_l11_n921(x)
+    else
+        fun_l11_n578(x)
+    end
+end
+
+def fun_l10_n62(x)
+    if (x < 1)
+        fun_l11_n527(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n63(x)
+    if (x < 1)
+        fun_l11_n225(x)
+    else
+        fun_l11_n937(x)
+    end
+end
+
+def fun_l10_n64(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n415(x)
+    end
+end
+
+def fun_l10_n65(x)
+    if (x < 1)
+        fun_l11_n718(x)
+    else
+        fun_l11_n958(x)
+    end
+end
+
+def fun_l10_n66(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n453(x)
+    end
+end
+
+def fun_l10_n67(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n934(x)
+    end
+end
+
+def fun_l10_n68(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n138(x)
+    end
+end
+
+def fun_l10_n69(x)
+    if (x < 1)
+        fun_l11_n312(x)
+    else
+        fun_l11_n62(x)
+    end
+end
+
+def fun_l10_n70(x)
+    if (x < 1)
+        fun_l11_n591(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n71(x)
+    if (x < 1)
+        fun_l11_n571(x)
+    else
+        fun_l11_n429(x)
+    end
+end
+
+def fun_l10_n72(x)
+    if (x < 1)
+        fun_l11_n996(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n73(x)
+    if (x < 1)
+        fun_l11_n691(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n74(x)
+    if (x < 1)
+        fun_l11_n670(x)
+    else
+        fun_l11_n865(x)
+    end
+end
+
+def fun_l10_n75(x)
+    if (x < 1)
+        fun_l11_n568(x)
+    else
+        fun_l11_n164(x)
+    end
+end
+
+def fun_l10_n76(x)
+    if (x < 1)
+        fun_l11_n747(x)
+    else
+        fun_l11_n235(x)
+    end
+end
+
+def fun_l10_n77(x)
+    if (x < 1)
+        fun_l11_n402(x)
+    else
+        fun_l11_n670(x)
+    end
+end
+
+def fun_l10_n78(x)
+    if (x < 1)
+        fun_l11_n525(x)
+    else
+        fun_l11_n675(x)
+    end
+end
+
+def fun_l10_n79(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n238(x)
+    end
+end
+
+def fun_l10_n80(x)
+    if (x < 1)
+        fun_l11_n905(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n81(x)
+    if (x < 1)
+        fun_l11_n610(x)
+    else
+        fun_l11_n527(x)
+    end
+end
+
+def fun_l10_n82(x)
+    if (x < 1)
+        fun_l11_n796(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n83(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n84(x)
+    if (x < 1)
+        fun_l11_n376(x)
+    else
+        fun_l11_n852(x)
+    end
+end
+
+def fun_l10_n85(x)
+    if (x < 1)
+        fun_l11_n593(x)
+    else
+        fun_l11_n752(x)
+    end
+end
+
+def fun_l10_n86(x)
+    if (x < 1)
+        fun_l11_n821(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n87(x)
+    if (x < 1)
+        fun_l11_n950(x)
+    else
+        fun_l11_n309(x)
+    end
+end
+
+def fun_l10_n88(x)
+    if (x < 1)
+        fun_l11_n360(x)
+    else
+        fun_l11_n134(x)
+    end
+end
+
+def fun_l10_n89(x)
+    if (x < 1)
+        fun_l11_n935(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n90(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n120(x)
+    end
+end
+
+def fun_l10_n91(x)
+    if (x < 1)
+        fun_l11_n25(x)
+    else
+        fun_l11_n357(x)
+    end
+end
+
+def fun_l10_n92(x)
+    if (x < 1)
+        fun_l11_n248(x)
+    else
+        fun_l11_n212(x)
+    end
+end
+
+def fun_l10_n93(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n733(x)
+    end
+end
+
+def fun_l10_n94(x)
+    if (x < 1)
+        fun_l11_n147(x)
+    else
+        fun_l11_n907(x)
+    end
+end
+
+def fun_l10_n95(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n62(x)
+    end
+end
+
+def fun_l10_n96(x)
+    if (x < 1)
+        fun_l11_n205(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n97(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n813(x)
+    end
+end
+
+def fun_l10_n98(x)
+    if (x < 1)
+        fun_l11_n296(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n99(x)
+    if (x < 1)
+        fun_l11_n181(x)
+    else
+        fun_l11_n709(x)
+    end
+end
+
+def fun_l10_n100(x)
+    if (x < 1)
+        fun_l11_n109(x)
+    else
+        fun_l11_n560(x)
+    end
+end
+
+def fun_l10_n101(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n693(x)
+    end
+end
+
+def fun_l10_n102(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n813(x)
+    end
+end
+
+def fun_l10_n103(x)
+    if (x < 1)
+        fun_l11_n3(x)
+    else
+        fun_l11_n787(x)
+    end
+end
+
+def fun_l10_n104(x)
+    if (x < 1)
+        fun_l11_n477(x)
+    else
+        fun_l11_n336(x)
+    end
+end
+
+def fun_l10_n105(x)
+    if (x < 1)
+        fun_l11_n131(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n106(x)
+    if (x < 1)
+        fun_l11_n278(x)
+    else
+        fun_l11_n948(x)
+    end
+end
+
+def fun_l10_n107(x)
+    if (x < 1)
+        fun_l11_n950(x)
+    else
+        fun_l11_n848(x)
+    end
+end
+
+def fun_l10_n108(x)
+    if (x < 1)
+        fun_l11_n490(x)
+    else
+        fun_l11_n1(x)
+    end
+end
+
+def fun_l10_n109(x)
+    if (x < 1)
+        fun_l11_n297(x)
+    else
+        fun_l11_n902(x)
+    end
+end
+
+def fun_l10_n110(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n697(x)
+    end
+end
+
+def fun_l10_n111(x)
+    if (x < 1)
+        fun_l11_n330(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n112(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n113(x)
+    if (x < 1)
+        fun_l11_n811(x)
+    else
+        fun_l11_n196(x)
+    end
+end
+
+def fun_l10_n114(x)
+    if (x < 1)
+        fun_l11_n868(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n115(x)
+    if (x < 1)
+        fun_l11_n308(x)
+    else
+        fun_l11_n184(x)
+    end
+end
+
+def fun_l10_n116(x)
+    if (x < 1)
+        fun_l11_n64(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n117(x)
+    if (x < 1)
+        fun_l11_n339(x)
+    else
+        fun_l11_n338(x)
+    end
+end
+
+def fun_l10_n118(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n119(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n472(x)
+    end
+end
+
+def fun_l10_n120(x)
+    if (x < 1)
+        fun_l11_n646(x)
+    else
+        fun_l11_n83(x)
+    end
+end
+
+def fun_l10_n121(x)
+    if (x < 1)
+        fun_l11_n294(x)
+    else
+        fun_l11_n208(x)
+    end
+end
+
+def fun_l10_n122(x)
+    if (x < 1)
+        fun_l11_n309(x)
+    else
+        fun_l11_n52(x)
+    end
+end
+
+def fun_l10_n123(x)
+    if (x < 1)
+        fun_l11_n5(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n124(x)
+    if (x < 1)
+        fun_l11_n288(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n125(x)
+    if (x < 1)
+        fun_l11_n835(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n126(x)
+    if (x < 1)
+        fun_l11_n269(x)
+    else
+        fun_l11_n104(x)
+    end
+end
+
+def fun_l10_n127(x)
+    if (x < 1)
+        fun_l11_n377(x)
+    else
+        fun_l11_n650(x)
+    end
+end
+
+def fun_l10_n128(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n129(x)
+    if (x < 1)
+        fun_l11_n493(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n130(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n857(x)
+    end
+end
+
+def fun_l10_n131(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n132(x)
+    if (x < 1)
+        fun_l11_n585(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n133(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n748(x)
+    end
+end
+
+def fun_l10_n134(x)
+    if (x < 1)
+        fun_l11_n218(x)
+    else
+        fun_l11_n343(x)
+    end
+end
+
+def fun_l10_n135(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n655(x)
+    end
+end
+
+def fun_l10_n136(x)
+    if (x < 1)
+        fun_l11_n43(x)
+    else
+        fun_l11_n964(x)
+    end
+end
+
+def fun_l10_n137(x)
+    if (x < 1)
+        fun_l11_n50(x)
+    else
+        fun_l11_n836(x)
+    end
+end
+
+def fun_l10_n138(x)
+    if (x < 1)
+        fun_l11_n915(x)
+    else
+        fun_l11_n262(x)
+    end
+end
+
+def fun_l10_n139(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n140(x)
+    if (x < 1)
+        fun_l11_n473(x)
+    else
+        fun_l11_n771(x)
+    end
+end
+
+def fun_l10_n141(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n142(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n178(x)
+    end
+end
+
+def fun_l10_n143(x)
+    if (x < 1)
+        fun_l11_n223(x)
+    else
+        fun_l11_n509(x)
+    end
+end
+
+def fun_l10_n144(x)
+    if (x < 1)
+        fun_l11_n62(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n145(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n146(x)
+    if (x < 1)
+        fun_l11_n414(x)
+    else
+        fun_l11_n384(x)
+    end
+end
+
+def fun_l10_n147(x)
+    if (x < 1)
+        fun_l11_n840(x)
+    else
+        fun_l11_n287(x)
+    end
+end
+
+def fun_l10_n148(x)
+    if (x < 1)
+        fun_l11_n605(x)
+    else
+        fun_l11_n283(x)
+    end
+end
+
+def fun_l10_n149(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n150(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n304(x)
+    end
+end
+
+def fun_l10_n151(x)
+    if (x < 1)
+        fun_l11_n501(x)
+    else
+        fun_l11_n789(x)
+    end
+end
+
+def fun_l10_n152(x)
+    if (x < 1)
+        fun_l11_n265(x)
+    else
+        fun_l11_n304(x)
+    end
+end
+
+def fun_l10_n153(x)
+    if (x < 1)
+        fun_l11_n500(x)
+    else
+        fun_l11_n32(x)
+    end
+end
+
+def fun_l10_n154(x)
+    if (x < 1)
+        fun_l11_n464(x)
+    else
+        fun_l11_n212(x)
+    end
+end
+
+def fun_l10_n155(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n805(x)
+    end
+end
+
+def fun_l10_n156(x)
+    if (x < 1)
+        fun_l11_n225(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n157(x)
+    if (x < 1)
+        fun_l11_n600(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n158(x)
+    if (x < 1)
+        fun_l11_n684(x)
+    else
+        fun_l11_n898(x)
+    end
+end
+
+def fun_l10_n159(x)
+    if (x < 1)
+        fun_l11_n354(x)
+    else
+        fun_l11_n909(x)
+    end
+end
+
+def fun_l10_n160(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n917(x)
+    end
+end
+
+def fun_l10_n161(x)
+    if (x < 1)
+        fun_l11_n547(x)
+    else
+        fun_l11_n333(x)
+    end
+end
+
+def fun_l10_n162(x)
+    if (x < 1)
+        fun_l11_n769(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n163(x)
+    if (x < 1)
+        fun_l11_n292(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n164(x)
+    if (x < 1)
+        fun_l11_n355(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n165(x)
+    if (x < 1)
+        fun_l11_n413(x)
+    else
+        fun_l11_n570(x)
+    end
+end
+
+def fun_l10_n166(x)
+    if (x < 1)
+        fun_l11_n535(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n167(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n178(x)
+    end
+end
+
+def fun_l10_n168(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n853(x)
+    end
+end
+
+def fun_l10_n169(x)
+    if (x < 1)
+        fun_l11_n208(x)
+    else
+        fun_l11_n378(x)
+    end
+end
+
+def fun_l10_n170(x)
+    if (x < 1)
+        fun_l11_n385(x)
+    else
+        fun_l11_n811(x)
+    end
+end
+
+def fun_l10_n171(x)
+    if (x < 1)
+        fun_l11_n960(x)
+    else
+        fun_l11_n631(x)
+    end
+end
+
+def fun_l10_n172(x)
+    if (x < 1)
+        fun_l11_n104(x)
+    else
+        fun_l11_n667(x)
+    end
+end
+
+def fun_l10_n173(x)
+    if (x < 1)
+        fun_l11_n532(x)
+    else
+        fun_l11_n169(x)
+    end
+end
+
+def fun_l10_n174(x)
+    if (x < 1)
+        fun_l11_n794(x)
+    else
+        fun_l11_n761(x)
+    end
+end
+
+def fun_l10_n175(x)
+    if (x < 1)
+        fun_l11_n306(x)
+    else
+        fun_l11_n369(x)
+    end
+end
+
+def fun_l10_n176(x)
+    if (x < 1)
+        fun_l11_n693(x)
+    else
+        fun_l11_n254(x)
+    end
+end
+
+def fun_l10_n177(x)
+    if (x < 1)
+        fun_l11_n927(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n178(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n136(x)
+    end
+end
+
+def fun_l10_n179(x)
+    if (x < 1)
+        fun_l11_n482(x)
+    else
+        fun_l11_n182(x)
+    end
+end
+
+def fun_l10_n180(x)
+    if (x < 1)
+        fun_l11_n20(x)
+    else
+        fun_l11_n978(x)
+    end
+end
+
+def fun_l10_n181(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n92(x)
+    end
+end
+
+def fun_l10_n182(x)
+    if (x < 1)
+        fun_l11_n179(x)
+    else
+        fun_l11_n634(x)
+    end
+end
+
+def fun_l10_n183(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n275(x)
+    end
+end
+
+def fun_l10_n184(x)
+    if (x < 1)
+        fun_l11_n826(x)
+    else
+        fun_l11_n630(x)
+    end
+end
+
+def fun_l10_n185(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n186(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n182(x)
+    end
+end
+
+def fun_l10_n187(x)
+    if (x < 1)
+        fun_l11_n404(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n188(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n189(x)
+    if (x < 1)
+        fun_l11_n620(x)
+    else
+        fun_l11_n659(x)
+    end
+end
+
+def fun_l10_n190(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n191(x)
+    if (x < 1)
+        fun_l11_n328(x)
+    else
+        fun_l11_n223(x)
+    end
+end
+
+def fun_l10_n192(x)
+    if (x < 1)
+        fun_l11_n280(x)
+    else
+        fun_l11_n360(x)
+    end
+end
+
+def fun_l10_n193(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n303(x)
+    end
+end
+
+def fun_l10_n194(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n207(x)
+    end
+end
+
+def fun_l10_n195(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n398(x)
+    end
+end
+
+def fun_l10_n196(x)
+    if (x < 1)
+        fun_l11_n998(x)
+    else
+        fun_l11_n31(x)
+    end
+end
+
+def fun_l10_n197(x)
+    if (x < 1)
+        fun_l11_n740(x)
+    else
+        fun_l11_n220(x)
+    end
+end
+
+def fun_l10_n198(x)
+    if (x < 1)
+        fun_l11_n847(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n199(x)
+    if (x < 1)
+        fun_l11_n946(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n200(x)
+    if (x < 1)
+        fun_l11_n494(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n201(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n310(x)
+    end
+end
+
+def fun_l10_n202(x)
+    if (x < 1)
+        fun_l11_n660(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n203(x)
+    if (x < 1)
+        fun_l11_n478(x)
+    else
+        fun_l11_n618(x)
+    end
+end
+
+def fun_l10_n204(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n205(x)
+    if (x < 1)
+        fun_l11_n128(x)
+    else
+        fun_l11_n279(x)
+    end
+end
+
+def fun_l10_n206(x)
+    if (x < 1)
+        fun_l11_n718(x)
+    else
+        fun_l11_n514(x)
+    end
+end
+
+def fun_l10_n207(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n979(x)
+    end
+end
+
+def fun_l10_n208(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n881(x)
+    end
+end
+
+def fun_l10_n209(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n210(x)
+    if (x < 1)
+        fun_l11_n269(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n211(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n97(x)
+    end
+end
+
+def fun_l10_n212(x)
+    if (x < 1)
+        fun_l11_n377(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n213(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n276(x)
+    end
+end
+
+def fun_l10_n214(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n215(x)
+    if (x < 1)
+        fun_l11_n445(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n216(x)
+    if (x < 1)
+        fun_l11_n433(x)
+    else
+        fun_l11_n937(x)
+    end
+end
+
+def fun_l10_n217(x)
+    if (x < 1)
+        fun_l11_n288(x)
+    else
+        fun_l11_n897(x)
+    end
+end
+
+def fun_l10_n218(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n545(x)
+    end
+end
+
+def fun_l10_n219(x)
+    if (x < 1)
+        fun_l11_n678(x)
+    else
+        fun_l11_n433(x)
+    end
+end
+
+def fun_l10_n220(x)
+    if (x < 1)
+        fun_l11_n203(x)
+    else
+        fun_l11_n163(x)
+    end
+end
+
+def fun_l10_n221(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n545(x)
+    end
+end
+
+def fun_l10_n222(x)
+    if (x < 1)
+        fun_l11_n556(x)
+    else
+        fun_l11_n537(x)
+    end
+end
+
+def fun_l10_n223(x)
+    if (x < 1)
+        fun_l11_n743(x)
+    else
+        fun_l11_n88(x)
+    end
+end
+
+def fun_l10_n224(x)
+    if (x < 1)
+        fun_l11_n678(x)
+    else
+        fun_l11_n643(x)
+    end
+end
+
+def fun_l10_n225(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n219(x)
+    end
+end
+
+def fun_l10_n226(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n227(x)
+    if (x < 1)
+        fun_l11_n117(x)
+    else
+        fun_l11_n433(x)
+    end
+end
+
+def fun_l10_n228(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n884(x)
+    end
+end
+
+def fun_l10_n229(x)
+    if (x < 1)
+        fun_l11_n58(x)
+    else
+        fun_l11_n620(x)
+    end
+end
+
+def fun_l10_n230(x)
+    if (x < 1)
+        fun_l11_n688(x)
+    else
+        fun_l11_n76(x)
+    end
+end
+
+def fun_l10_n231(x)
+    if (x < 1)
+        fun_l11_n726(x)
+    else
+        fun_l11_n644(x)
+    end
+end
+
+def fun_l10_n232(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n233(x)
+    if (x < 1)
+        fun_l11_n761(x)
+    else
+        fun_l11_n487(x)
+    end
+end
+
+def fun_l10_n234(x)
+    if (x < 1)
+        fun_l11_n657(x)
+    else
+        fun_l11_n107(x)
+    end
+end
+
+def fun_l10_n235(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n881(x)
+    end
+end
+
+def fun_l10_n236(x)
+    if (x < 1)
+        fun_l11_n851(x)
+    else
+        fun_l11_n593(x)
+    end
+end
+
+def fun_l10_n237(x)
+    if (x < 1)
+        fun_l11_n319(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n238(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n870(x)
+    end
+end
+
+def fun_l10_n239(x)
+    if (x < 1)
+        fun_l11_n195(x)
+    else
+        fun_l11_n378(x)
+    end
+end
+
+def fun_l10_n240(x)
+    if (x < 1)
+        fun_l11_n398(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n241(x)
+    if (x < 1)
+        fun_l11_n118(x)
+    else
+        fun_l11_n417(x)
+    end
+end
+
+def fun_l10_n242(x)
+    if (x < 1)
+        fun_l11_n220(x)
+    else
+        fun_l11_n445(x)
+    end
+end
+
+def fun_l10_n243(x)
+    if (x < 1)
+        fun_l11_n783(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n244(x)
+    if (x < 1)
+        fun_l11_n229(x)
+    else
+        fun_l11_n439(x)
+    end
+end
+
+def fun_l10_n245(x)
+    if (x < 1)
+        fun_l11_n78(x)
+    else
+        fun_l11_n272(x)
+    end
+end
+
+def fun_l10_n246(x)
+    if (x < 1)
+        fun_l11_n481(x)
+    else
+        fun_l11_n499(x)
+    end
+end
+
+def fun_l10_n247(x)
+    if (x < 1)
+        fun_l11_n213(x)
+    else
+        fun_l11_n471(x)
+    end
+end
+
+def fun_l10_n248(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n919(x)
+    end
+end
+
+def fun_l10_n249(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n250(x)
+    if (x < 1)
+        fun_l11_n997(x)
+    else
+        fun_l11_n112(x)
+    end
+end
+
+def fun_l10_n251(x)
+    if (x < 1)
+        fun_l11_n662(x)
+    else
+        fun_l11_n950(x)
+    end
+end
+
+def fun_l10_n252(x)
+    if (x < 1)
+        fun_l11_n272(x)
+    else
+        fun_l11_n345(x)
+    end
+end
+
+def fun_l10_n253(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n24(x)
+    end
+end
+
+def fun_l10_n254(x)
+    if (x < 1)
+        fun_l11_n326(x)
+    else
+        fun_l11_n907(x)
+    end
+end
+
+def fun_l10_n255(x)
+    if (x < 1)
+        fun_l11_n612(x)
+    else
+        fun_l11_n790(x)
+    end
+end
+
+def fun_l10_n256(x)
+    if (x < 1)
+        fun_l11_n50(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n257(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n151(x)
+    end
+end
+
+def fun_l10_n258(x)
+    if (x < 1)
+        fun_l11_n290(x)
+    else
+        fun_l11_n113(x)
+    end
+end
+
+def fun_l10_n259(x)
+    if (x < 1)
+        fun_l11_n751(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n260(x)
+    if (x < 1)
+        fun_l11_n337(x)
+    else
+        fun_l11_n516(x)
+    end
+end
+
+def fun_l10_n261(x)
+    if (x < 1)
+        fun_l11_n530(x)
+    else
+        fun_l11_n19(x)
+    end
+end
+
+def fun_l10_n262(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n529(x)
+    end
+end
+
+def fun_l10_n263(x)
+    if (x < 1)
+        fun_l11_n769(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n264(x)
+    if (x < 1)
+        fun_l11_n673(x)
+    else
+        fun_l11_n771(x)
+    end
+end
+
+def fun_l10_n265(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n427(x)
+    end
+end
+
+def fun_l10_n266(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n590(x)
+    end
+end
+
+def fun_l10_n267(x)
+    if (x < 1)
+        fun_l11_n762(x)
+    else
+        fun_l11_n352(x)
+    end
+end
+
+def fun_l10_n268(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n126(x)
+    end
+end
+
+def fun_l10_n269(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n270(x)
+    if (x < 1)
+        fun_l11_n233(x)
+    else
+        fun_l11_n404(x)
+    end
+end
+
+def fun_l10_n271(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n245(x)
+    end
+end
+
+def fun_l10_n272(x)
+    if (x < 1)
+        fun_l11_n277(x)
+    else
+        fun_l11_n969(x)
+    end
+end
+
+def fun_l10_n273(x)
+    if (x < 1)
+        fun_l11_n848(x)
+    else
+        fun_l11_n56(x)
+    end
+end
+
+def fun_l10_n274(x)
+    if (x < 1)
+        fun_l11_n640(x)
+    else
+        fun_l11_n632(x)
+    end
+end
+
+def fun_l10_n275(x)
+    if (x < 1)
+        fun_l11_n38(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n276(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n126(x)
+    end
+end
+
+def fun_l10_n277(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n278(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n954(x)
+    end
+end
+
+def fun_l10_n279(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n58(x)
+    end
+end
+
+def fun_l10_n280(x)
+    if (x < 1)
+        fun_l11_n926(x)
+    else
+        fun_l11_n287(x)
+    end
+end
+
+def fun_l10_n281(x)
+    if (x < 1)
+        fun_l11_n981(x)
+    else
+        fun_l11_n921(x)
+    end
+end
+
+def fun_l10_n282(x)
+    if (x < 1)
+        fun_l11_n222(x)
+    else
+        fun_l11_n954(x)
+    end
+end
+
+def fun_l10_n283(x)
+    if (x < 1)
+        fun_l11_n295(x)
+    else
+        fun_l11_n575(x)
+    end
+end
+
+def fun_l10_n284(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n559(x)
+    end
+end
+
+def fun_l10_n285(x)
+    if (x < 1)
+        fun_l11_n476(x)
+    else
+        fun_l11_n487(x)
+    end
+end
+
+def fun_l10_n286(x)
+    if (x < 1)
+        fun_l11_n102(x)
+    else
+        fun_l11_n928(x)
+    end
+end
+
+def fun_l10_n287(x)
+    if (x < 1)
+        fun_l11_n949(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n288(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n762(x)
+    end
+end
+
+def fun_l10_n289(x)
+    if (x < 1)
+        fun_l11_n304(x)
+    else
+        fun_l11_n572(x)
+    end
+end
+
+def fun_l10_n290(x)
+    if (x < 1)
+        fun_l11_n748(x)
+    else
+        fun_l11_n791(x)
+    end
+end
+
+def fun_l10_n291(x)
+    if (x < 1)
+        fun_l11_n557(x)
+    else
+        fun_l11_n79(x)
+    end
+end
+
+def fun_l10_n292(x)
+    if (x < 1)
+        fun_l11_n74(x)
+    else
+        fun_l11_n931(x)
+    end
+end
+
+def fun_l10_n293(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n791(x)
+    end
+end
+
+def fun_l10_n294(x)
+    if (x < 1)
+        fun_l11_n29(x)
+    else
+        fun_l11_n377(x)
+    end
+end
+
+def fun_l10_n295(x)
+    if (x < 1)
+        fun_l11_n509(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n296(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n835(x)
+    end
+end
+
+def fun_l10_n297(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n621(x)
+    end
+end
+
+def fun_l10_n298(x)
+    if (x < 1)
+        fun_l11_n860(x)
+    else
+        fun_l11_n403(x)
+    end
+end
+
+def fun_l10_n299(x)
+    if (x < 1)
+        fun_l11_n676(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n300(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n301(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n302(x)
+    if (x < 1)
+        fun_l11_n763(x)
+    else
+        fun_l11_n823(x)
+    end
+end
+
+def fun_l10_n303(x)
+    if (x < 1)
+        fun_l11_n469(x)
+    else
+        fun_l11_n250(x)
+    end
+end
+
+def fun_l10_n304(x)
+    if (x < 1)
+        fun_l11_n637(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n305(x)
+    if (x < 1)
+        fun_l11_n825(x)
+    else
+        fun_l11_n258(x)
+    end
+end
+
+def fun_l10_n306(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n307(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n490(x)
+    end
+end
+
+def fun_l10_n308(x)
+    if (x < 1)
+        fun_l11_n157(x)
+    else
+        fun_l11_n407(x)
+    end
+end
+
+def fun_l10_n309(x)
+    if (x < 1)
+        fun_l11_n68(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n310(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n955(x)
+    end
+end
+
+def fun_l10_n311(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n27(x)
+    end
+end
+
+def fun_l10_n312(x)
+    if (x < 1)
+        fun_l11_n771(x)
+    else
+        fun_l11_n604(x)
+    end
+end
+
+def fun_l10_n313(x)
+    if (x < 1)
+        fun_l11_n436(x)
+    else
+        fun_l11_n714(x)
+    end
+end
+
+def fun_l10_n314(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n889(x)
+    end
+end
+
+def fun_l10_n315(x)
+    if (x < 1)
+        fun_l11_n621(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n316(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n317(x)
+    if (x < 1)
+        fun_l11_n532(x)
+    else
+        fun_l11_n920(x)
+    end
+end
+
+def fun_l10_n318(x)
+    if (x < 1)
+        fun_l11_n895(x)
+    else
+        fun_l11_n781(x)
+    end
+end
+
+def fun_l10_n319(x)
+    if (x < 1)
+        fun_l11_n109(x)
+    else
+        fun_l11_n254(x)
+    end
+end
+
+def fun_l10_n320(x)
+    if (x < 1)
+        fun_l11_n842(x)
+    else
+        fun_l11_n879(x)
+    end
+end
+
+def fun_l10_n321(x)
+    if (x < 1)
+        fun_l11_n655(x)
+    else
+        fun_l11_n518(x)
+    end
+end
+
+def fun_l10_n322(x)
+    if (x < 1)
+        fun_l11_n727(x)
+    else
+        fun_l11_n14(x)
+    end
+end
+
+def fun_l10_n323(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n324(x)
+    if (x < 1)
+        fun_l11_n412(x)
+    else
+        fun_l11_n940(x)
+    end
+end
+
+def fun_l10_n325(x)
+    if (x < 1)
+        fun_l11_n944(x)
+    else
+        fun_l11_n915(x)
+    end
+end
+
+def fun_l10_n326(x)
+    if (x < 1)
+        fun_l11_n120(x)
+    else
+        fun_l11_n572(x)
+    end
+end
+
+def fun_l10_n327(x)
+    if (x < 1)
+        fun_l11_n444(x)
+    else
+        fun_l11_n793(x)
+    end
+end
+
+def fun_l10_n328(x)
+    if (x < 1)
+        fun_l11_n892(x)
+    else
+        fun_l11_n475(x)
+    end
+end
+
+def fun_l10_n329(x)
+    if (x < 1)
+        fun_l11_n919(x)
+    else
+        fun_l11_n183(x)
+    end
+end
+
+def fun_l10_n330(x)
+    if (x < 1)
+        fun_l11_n80(x)
+    else
+        fun_l11_n357(x)
+    end
+end
+
+def fun_l10_n331(x)
+    if (x < 1)
+        fun_l11_n340(x)
+    else
+        fun_l11_n349(x)
+    end
+end
+
+def fun_l10_n332(x)
+    if (x < 1)
+        fun_l11_n579(x)
+    else
+        fun_l11_n845(x)
+    end
+end
+
+def fun_l10_n333(x)
+    if (x < 1)
+        fun_l11_n169(x)
+    else
+        fun_l11_n583(x)
+    end
+end
+
+def fun_l10_n334(x)
+    if (x < 1)
+        fun_l11_n544(x)
+    else
+        fun_l11_n462(x)
+    end
+end
+
+def fun_l10_n335(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n635(x)
+    end
+end
+
+def fun_l10_n336(x)
+    if (x < 1)
+        fun_l11_n965(x)
+    else
+        fun_l11_n538(x)
+    end
+end
+
+def fun_l10_n337(x)
+    if (x < 1)
+        fun_l11_n930(x)
+    else
+        fun_l11_n169(x)
+    end
+end
+
+def fun_l10_n338(x)
+    if (x < 1)
+        fun_l11_n732(x)
+    else
+        fun_l11_n574(x)
+    end
+end
+
+def fun_l10_n339(x)
+    if (x < 1)
+        fun_l11_n51(x)
+    else
+        fun_l11_n141(x)
+    end
+end
+
+def fun_l10_n340(x)
+    if (x < 1)
+        fun_l11_n149(x)
+    else
+        fun_l11_n346(x)
+    end
+end
+
+def fun_l10_n341(x)
+    if (x < 1)
+        fun_l11_n163(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n342(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n343(x)
+    if (x < 1)
+        fun_l11_n156(x)
+    else
+        fun_l11_n639(x)
+    end
+end
+
+def fun_l10_n344(x)
+    if (x < 1)
+        fun_l11_n934(x)
+    else
+        fun_l11_n85(x)
+    end
+end
+
+def fun_l10_n345(x)
+    if (x < 1)
+        fun_l11_n182(x)
+    else
+        fun_l11_n190(x)
+    end
+end
+
+def fun_l10_n346(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n702(x)
+    end
+end
+
+def fun_l10_n347(x)
+    if (x < 1)
+        fun_l11_n540(x)
+    else
+        fun_l11_n689(x)
+    end
+end
+
+def fun_l10_n348(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n349(x)
+    if (x < 1)
+        fun_l11_n683(x)
+    else
+        fun_l11_n688(x)
+    end
+end
+
+def fun_l10_n350(x)
+    if (x < 1)
+        fun_l11_n750(x)
+    else
+        fun_l11_n577(x)
+    end
+end
+
+def fun_l10_n351(x)
+    if (x < 1)
+        fun_l11_n74(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n352(x)
+    if (x < 1)
+        fun_l11_n252(x)
+    else
+        fun_l11_n766(x)
+    end
+end
+
+def fun_l10_n353(x)
+    if (x < 1)
+        fun_l11_n702(x)
+    else
+        fun_l11_n516(x)
+    end
+end
+
+def fun_l10_n354(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n290(x)
+    end
+end
+
+def fun_l10_n355(x)
+    if (x < 1)
+        fun_l11_n70(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n356(x)
+    if (x < 1)
+        fun_l11_n654(x)
+    else
+        fun_l11_n108(x)
+    end
+end
+
+def fun_l10_n357(x)
+    if (x < 1)
+        fun_l11_n820(x)
+    else
+        fun_l11_n320(x)
+    end
+end
+
+def fun_l10_n358(x)
+    if (x < 1)
+        fun_l11_n417(x)
+    else
+        fun_l11_n290(x)
+    end
+end
+
+def fun_l10_n359(x)
+    if (x < 1)
+        fun_l11_n832(x)
+    else
+        fun_l11_n647(x)
+    end
+end
+
+def fun_l10_n360(x)
+    if (x < 1)
+        fun_l11_n625(x)
+    else
+        fun_l11_n723(x)
+    end
+end
+
+def fun_l10_n361(x)
+    if (x < 1)
+        fun_l11_n257(x)
+    else
+        fun_l11_n991(x)
+    end
+end
+
+def fun_l10_n362(x)
+    if (x < 1)
+        fun_l11_n101(x)
+    else
+        fun_l11_n247(x)
+    end
+end
+
+def fun_l10_n363(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n364(x)
+    if (x < 1)
+        fun_l11_n281(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n365(x)
+    if (x < 1)
+        fun_l11_n425(x)
+    else
+        fun_l11_n772(x)
+    end
+end
+
+def fun_l10_n366(x)
+    if (x < 1)
+        fun_l11_n724(x)
+    else
+        fun_l11_n725(x)
+    end
+end
+
+def fun_l10_n367(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n360(x)
+    end
+end
+
+def fun_l10_n368(x)
+    if (x < 1)
+        fun_l11_n874(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n369(x)
+    if (x < 1)
+        fun_l11_n419(x)
+    else
+        fun_l11_n672(x)
+    end
+end
+
+def fun_l10_n370(x)
+    if (x < 1)
+        fun_l11_n655(x)
+    else
+        fun_l11_n468(x)
+    end
+end
+
+def fun_l10_n371(x)
+    if (x < 1)
+        fun_l11_n577(x)
+    else
+        fun_l11_n402(x)
+    end
+end
+
+def fun_l10_n372(x)
+    if (x < 1)
+        fun_l11_n531(x)
+    else
+        fun_l11_n319(x)
+    end
+end
+
+def fun_l10_n373(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n901(x)
+    end
+end
+
+def fun_l10_n374(x)
+    if (x < 1)
+        fun_l11_n59(x)
+    else
+        fun_l11_n12(x)
+    end
+end
+
+def fun_l10_n375(x)
+    if (x < 1)
+        fun_l11_n409(x)
+    else
+        fun_l11_n214(x)
+    end
+end
+
+def fun_l10_n376(x)
+    if (x < 1)
+        fun_l11_n52(x)
+    else
+        fun_l11_n395(x)
+    end
+end
+
+def fun_l10_n377(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n434(x)
+    end
+end
+
+def fun_l10_n378(x)
+    if (x < 1)
+        fun_l11_n795(x)
+    else
+        fun_l11_n820(x)
+    end
+end
+
+def fun_l10_n379(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n111(x)
+    end
+end
+
+def fun_l10_n380(x)
+    if (x < 1)
+        fun_l11_n762(x)
+    else
+        fun_l11_n678(x)
+    end
+end
+
+def fun_l10_n381(x)
+    if (x < 1)
+        fun_l11_n324(x)
+    else
+        fun_l11_n478(x)
+    end
+end
+
+def fun_l10_n382(x)
+    if (x < 1)
+        fun_l11_n360(x)
+    else
+        fun_l11_n35(x)
+    end
+end
+
+def fun_l10_n383(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n898(x)
+    end
+end
+
+def fun_l10_n384(x)
+    if (x < 1)
+        fun_l11_n584(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n385(x)
+    if (x < 1)
+        fun_l11_n514(x)
+    else
+        fun_l11_n649(x)
+    end
+end
+
+def fun_l10_n386(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n391(x)
+    end
+end
+
+def fun_l10_n387(x)
+    if (x < 1)
+        fun_l11_n713(x)
+    else
+        fun_l11_n734(x)
+    end
+end
+
+def fun_l10_n388(x)
+    if (x < 1)
+        fun_l11_n236(x)
+    else
+        fun_l11_n469(x)
+    end
+end
+
+def fun_l10_n389(x)
+    if (x < 1)
+        fun_l11_n267(x)
+    else
+        fun_l11_n965(x)
+    end
+end
+
+def fun_l10_n390(x)
+    if (x < 1)
+        fun_l11_n943(x)
+    else
+        fun_l11_n181(x)
+    end
+end
+
+def fun_l10_n391(x)
+    if (x < 1)
+        fun_l11_n869(x)
+    else
+        fun_l11_n348(x)
+    end
+end
+
+def fun_l10_n392(x)
+    if (x < 1)
+        fun_l11_n144(x)
+    else
+        fun_l11_n801(x)
+    end
+end
+
+def fun_l10_n393(x)
+    if (x < 1)
+        fun_l11_n907(x)
+    else
+        fun_l11_n609(x)
+    end
+end
+
+def fun_l10_n394(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n395(x)
+    if (x < 1)
+        fun_l11_n629(x)
+    else
+        fun_l11_n924(x)
+    end
+end
+
+def fun_l10_n396(x)
+    if (x < 1)
+        fun_l11_n191(x)
+    else
+        fun_l11_n248(x)
+    end
+end
+
+def fun_l10_n397(x)
+    if (x < 1)
+        fun_l11_n339(x)
+    else
+        fun_l11_n805(x)
+    end
+end
+
+def fun_l10_n398(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n399(x)
+    if (x < 1)
+        fun_l11_n847(x)
+    else
+        fun_l11_n14(x)
+    end
+end
+
+def fun_l10_n400(x)
+    if (x < 1)
+        fun_l11_n296(x)
+    else
+        fun_l11_n144(x)
+    end
+end
+
+def fun_l10_n401(x)
+    if (x < 1)
+        fun_l11_n853(x)
+    else
+        fun_l11_n156(x)
+    end
+end
+
+def fun_l10_n402(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n944(x)
+    end
+end
+
+def fun_l10_n403(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n324(x)
+    end
+end
+
+def fun_l10_n404(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n139(x)
+    end
+end
+
+def fun_l10_n405(x)
+    if (x < 1)
+        fun_l11_n466(x)
+    else
+        fun_l11_n388(x)
+    end
+end
+
+def fun_l10_n406(x)
+    if (x < 1)
+        fun_l11_n914(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n407(x)
+    if (x < 1)
+        fun_l11_n741(x)
+    else
+        fun_l11_n757(x)
+    end
+end
+
+def fun_l10_n408(x)
+    if (x < 1)
+        fun_l11_n36(x)
+    else
+        fun_l11_n312(x)
+    end
+end
+
+def fun_l10_n409(x)
+    if (x < 1)
+        fun_l11_n203(x)
+    else
+        fun_l11_n523(x)
+    end
+end
+
+def fun_l10_n410(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n291(x)
+    end
+end
+
+def fun_l10_n411(x)
+    if (x < 1)
+        fun_l11_n13(x)
+    else
+        fun_l11_n107(x)
+    end
+end
+
+def fun_l10_n412(x)
+    if (x < 1)
+        fun_l11_n960(x)
+    else
+        fun_l11_n565(x)
+    end
+end
+
+def fun_l10_n413(x)
+    if (x < 1)
+        fun_l11_n549(x)
+    else
+        fun_l11_n885(x)
+    end
+end
+
+def fun_l10_n414(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n612(x)
+    end
+end
+
+def fun_l10_n415(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n167(x)
+    end
+end
+
+def fun_l10_n416(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n206(x)
+    end
+end
+
+def fun_l10_n417(x)
+    if (x < 1)
+        fun_l11_n980(x)
+    else
+        fun_l11_n497(x)
+    end
+end
+
+def fun_l10_n418(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n419(x)
+    if (x < 1)
+        fun_l11_n690(x)
+    else
+        fun_l11_n63(x)
+    end
+end
+
+def fun_l10_n420(x)
+    if (x < 1)
+        fun_l11_n219(x)
+    else
+        fun_l11_n814(x)
+    end
+end
+
+def fun_l10_n421(x)
+    if (x < 1)
+        fun_l11_n864(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n422(x)
+    if (x < 1)
+        fun_l11_n672(x)
+    else
+        fun_l11_n87(x)
+    end
+end
+
+def fun_l10_n423(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n461(x)
+    end
+end
+
+def fun_l10_n424(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n283(x)
+    end
+end
+
+def fun_l10_n425(x)
+    if (x < 1)
+        fun_l11_n369(x)
+    else
+        fun_l11_n269(x)
+    end
+end
+
+def fun_l10_n426(x)
+    if (x < 1)
+        fun_l11_n832(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n427(x)
+    if (x < 1)
+        fun_l11_n272(x)
+    else
+        fun_l11_n634(x)
+    end
+end
+
+def fun_l10_n428(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n53(x)
+    end
+end
+
+def fun_l10_n429(x)
+    if (x < 1)
+        fun_l11_n895(x)
+    else
+        fun_l11_n292(x)
+    end
+end
+
+def fun_l10_n430(x)
+    if (x < 1)
+        fun_l11_n460(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n431(x)
+    if (x < 1)
+        fun_l11_n238(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n432(x)
+    if (x < 1)
+        fun_l11_n302(x)
+    else
+        fun_l11_n492(x)
+    end
+end
+
+def fun_l10_n433(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n876(x)
+    end
+end
+
+def fun_l10_n434(x)
+    if (x < 1)
+        fun_l11_n64(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n435(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n718(x)
+    end
+end
+
+def fun_l10_n436(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n437(x)
+    if (x < 1)
+        fun_l11_n282(x)
+    else
+        fun_l11_n168(x)
+    end
+end
+
+def fun_l10_n438(x)
+    if (x < 1)
+        fun_l11_n529(x)
+    else
+        fun_l11_n66(x)
+    end
+end
+
+def fun_l10_n439(x)
+    if (x < 1)
+        fun_l11_n286(x)
+    else
+        fun_l11_n134(x)
+    end
+end
+
+def fun_l10_n440(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n873(x)
+    end
+end
+
+def fun_l10_n441(x)
+    if (x < 1)
+        fun_l11_n871(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n442(x)
+    if (x < 1)
+        fun_l11_n314(x)
+    else
+        fun_l11_n685(x)
+    end
+end
+
+def fun_l10_n443(x)
+    if (x < 1)
+        fun_l11_n752(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n444(x)
+    if (x < 1)
+        fun_l11_n686(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n445(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n446(x)
+    if (x < 1)
+        fun_l11_n433(x)
+    else
+        fun_l11_n241(x)
+    end
+end
+
+def fun_l10_n447(x)
+    if (x < 1)
+        fun_l11_n99(x)
+    else
+        fun_l11_n563(x)
+    end
+end
+
+def fun_l10_n448(x)
+    if (x < 1)
+        fun_l11_n463(x)
+    else
+        fun_l11_n395(x)
+    end
+end
+
+def fun_l10_n449(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n151(x)
+    end
+end
+
+def fun_l10_n450(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n451(x)
+    if (x < 1)
+        fun_l11_n195(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n452(x)
+    if (x < 1)
+        fun_l11_n372(x)
+    else
+        fun_l11_n228(x)
+    end
+end
+
+def fun_l10_n453(x)
+    if (x < 1)
+        fun_l11_n526(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n454(x)
+    if (x < 1)
+        fun_l11_n594(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n455(x)
+    if (x < 1)
+        fun_l11_n25(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n456(x)
+    if (x < 1)
+        fun_l11_n83(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n457(x)
+    if (x < 1)
+        fun_l11_n644(x)
+    else
+        fun_l11_n837(x)
+    end
+end
+
+def fun_l10_n458(x)
+    if (x < 1)
+        fun_l11_n311(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n459(x)
+    if (x < 1)
+        fun_l11_n139(x)
+    else
+        fun_l11_n735(x)
+    end
+end
+
+def fun_l10_n460(x)
+    if (x < 1)
+        fun_l11_n431(x)
+    else
+        fun_l11_n808(x)
+    end
+end
+
+def fun_l10_n461(x)
+    if (x < 1)
+        fun_l11_n488(x)
+    else
+        fun_l11_n439(x)
+    end
+end
+
+def fun_l10_n462(x)
+    if (x < 1)
+        fun_l11_n448(x)
+    else
+        fun_l11_n882(x)
+    end
+end
+
+def fun_l10_n463(x)
+    if (x < 1)
+        fun_l11_n362(x)
+    else
+        fun_l11_n875(x)
+    end
+end
+
+def fun_l10_n464(x)
+    if (x < 1)
+        fun_l11_n88(x)
+    else
+        fun_l11_n842(x)
+    end
+end
+
+def fun_l10_n465(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n368(x)
+    end
+end
+
+def fun_l10_n466(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n3(x)
+    end
+end
+
+def fun_l10_n467(x)
+    if (x < 1)
+        fun_l11_n654(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n468(x)
+    if (x < 1)
+        fun_l11_n765(x)
+    else
+        fun_l11_n604(x)
+    end
+end
+
+def fun_l10_n469(x)
+    if (x < 1)
+        fun_l11_n881(x)
+    else
+        fun_l11_n567(x)
+    end
+end
+
+def fun_l10_n470(x)
+    if (x < 1)
+        fun_l11_n41(x)
+    else
+        fun_l11_n92(x)
+    end
+end
+
+def fun_l10_n471(x)
+    if (x < 1)
+        fun_l11_n905(x)
+    else
+        fun_l11_n731(x)
+    end
+end
+
+def fun_l10_n472(x)
+    if (x < 1)
+        fun_l11_n797(x)
+    else
+        fun_l11_n878(x)
+    end
+end
+
+def fun_l10_n473(x)
+    if (x < 1)
+        fun_l11_n487(x)
+    else
+        fun_l11_n951(x)
+    end
+end
+
+def fun_l10_n474(x)
+    if (x < 1)
+        fun_l11_n998(x)
+    else
+        fun_l11_n900(x)
+    end
+end
+
+def fun_l10_n475(x)
+    if (x < 1)
+        fun_l11_n451(x)
+    else
+        fun_l11_n780(x)
+    end
+end
+
+def fun_l10_n476(x)
+    if (x < 1)
+        fun_l11_n427(x)
+    else
+        fun_l11_n760(x)
+    end
+end
+
+def fun_l10_n477(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n478(x)
+    if (x < 1)
+        fun_l11_n359(x)
+    else
+        fun_l11_n236(x)
+    end
+end
+
+def fun_l10_n479(x)
+    if (x < 1)
+        fun_l11_n70(x)
+    else
+        fun_l11_n49(x)
+    end
+end
+
+def fun_l10_n480(x)
+    if (x < 1)
+        fun_l11_n338(x)
+    else
+        fun_l11_n714(x)
+    end
+end
+
+def fun_l10_n481(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n194(x)
+    end
+end
+
+def fun_l10_n482(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n591(x)
+    end
+end
+
+def fun_l10_n483(x)
+    if (x < 1)
+        fun_l11_n362(x)
+    else
+        fun_l11_n687(x)
+    end
+end
+
+def fun_l10_n484(x)
+    if (x < 1)
+        fun_l11_n659(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n485(x)
+    if (x < 1)
+        fun_l11_n903(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n486(x)
+    if (x < 1)
+        fun_l11_n279(x)
+    else
+        fun_l11_n995(x)
+    end
+end
+
+def fun_l10_n487(x)
+    if (x < 1)
+        fun_l11_n529(x)
+    else
+        fun_l11_n373(x)
+    end
+end
+
+def fun_l10_n488(x)
+    if (x < 1)
+        fun_l11_n198(x)
+    else
+        fun_l11_n899(x)
+    end
+end
+
+def fun_l10_n489(x)
+    if (x < 1)
+        fun_l11_n174(x)
+    else
+        fun_l11_n485(x)
+    end
+end
+
+def fun_l10_n490(x)
+    if (x < 1)
+        fun_l11_n19(x)
+    else
+        fun_l11_n322(x)
+    end
+end
+
+def fun_l10_n491(x)
+    if (x < 1)
+        fun_l11_n0(x)
+    else
+        fun_l11_n855(x)
+    end
+end
+
+def fun_l10_n492(x)
+    if (x < 1)
+        fun_l11_n126(x)
+    else
+        fun_l11_n986(x)
+    end
+end
+
+def fun_l10_n493(x)
+    if (x < 1)
+        fun_l11_n263(x)
+    else
+        fun_l11_n374(x)
+    end
+end
+
+def fun_l10_n494(x)
+    if (x < 1)
+        fun_l11_n21(x)
+    else
+        fun_l11_n749(x)
+    end
+end
+
+def fun_l10_n495(x)
+    if (x < 1)
+        fun_l11_n618(x)
+    else
+        fun_l11_n955(x)
+    end
+end
+
+def fun_l10_n496(x)
+    if (x < 1)
+        fun_l11_n157(x)
+    else
+        fun_l11_n230(x)
+    end
+end
+
+def fun_l10_n497(x)
+    if (x < 1)
+        fun_l11_n387(x)
+    else
+        fun_l11_n841(x)
+    end
+end
+
+def fun_l10_n498(x)
+    if (x < 1)
+        fun_l11_n496(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n499(x)
+    if (x < 1)
+        fun_l11_n581(x)
+    else
+        fun_l11_n821(x)
+    end
+end
+
+def fun_l10_n500(x)
+    if (x < 1)
+        fun_l11_n202(x)
+    else
+        fun_l11_n26(x)
+    end
+end
+
+def fun_l10_n501(x)
+    if (x < 1)
+        fun_l11_n273(x)
+    else
+        fun_l11_n294(x)
+    end
+end
+
+def fun_l10_n502(x)
+    if (x < 1)
+        fun_l11_n604(x)
+    else
+        fun_l11_n261(x)
+    end
+end
+
+def fun_l10_n503(x)
+    if (x < 1)
+        fun_l11_n632(x)
+    else
+        fun_l11_n340(x)
+    end
+end
+
+def fun_l10_n504(x)
+    if (x < 1)
+        fun_l11_n162(x)
+    else
+        fun_l11_n483(x)
+    end
+end
+
+def fun_l10_n505(x)
+    if (x < 1)
+        fun_l11_n824(x)
+    else
+        fun_l11_n747(x)
+    end
+end
+
+def fun_l10_n506(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n932(x)
+    end
+end
+
+def fun_l10_n507(x)
+    if (x < 1)
+        fun_l11_n645(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n508(x)
+    if (x < 1)
+        fun_l11_n876(x)
+    else
+        fun_l11_n640(x)
+    end
+end
+
+def fun_l10_n509(x)
+    if (x < 1)
+        fun_l11_n280(x)
+    else
+        fun_l11_n116(x)
+    end
+end
+
+def fun_l10_n510(x)
+    if (x < 1)
+        fun_l11_n570(x)
+    else
+        fun_l11_n640(x)
+    end
+end
+
+def fun_l10_n511(x)
+    if (x < 1)
+        fun_l11_n576(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n512(x)
+    if (x < 1)
+        fun_l11_n328(x)
+    else
+        fun_l11_n880(x)
+    end
+end
+
+def fun_l10_n513(x)
+    if (x < 1)
+        fun_l11_n185(x)
+    else
+        fun_l11_n977(x)
+    end
+end
+
+def fun_l10_n514(x)
+    if (x < 1)
+        fun_l11_n560(x)
+    else
+        fun_l11_n825(x)
+    end
+end
+
+def fun_l10_n515(x)
+    if (x < 1)
+        fun_l11_n28(x)
+    else
+        fun_l11_n908(x)
+    end
+end
+
+def fun_l10_n516(x)
+    if (x < 1)
+        fun_l11_n902(x)
+    else
+        fun_l11_n882(x)
+    end
+end
+
+def fun_l10_n517(x)
+    if (x < 1)
+        fun_l11_n429(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n518(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n149(x)
+    end
+end
+
+def fun_l10_n519(x)
+    if (x < 1)
+        fun_l11_n837(x)
+    else
+        fun_l11_n573(x)
+    end
+end
+
+def fun_l10_n520(x)
+    if (x < 1)
+        fun_l11_n934(x)
+    else
+        fun_l11_n504(x)
+    end
+end
+
+def fun_l10_n521(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n551(x)
+    end
+end
+
+def fun_l10_n522(x)
+    if (x < 1)
+        fun_l11_n53(x)
+    else
+        fun_l11_n297(x)
+    end
+end
+
+def fun_l10_n523(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n695(x)
+    end
+end
+
+def fun_l10_n524(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n525(x)
+    if (x < 1)
+        fun_l11_n249(x)
+    else
+        fun_l11_n757(x)
+    end
+end
+
+def fun_l10_n526(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n527(x)
+    if (x < 1)
+        fun_l11_n783(x)
+    else
+        fun_l11_n856(x)
+    end
+end
+
+def fun_l10_n528(x)
+    if (x < 1)
+        fun_l11_n708(x)
+    else
+        fun_l11_n550(x)
+    end
+end
+
+def fun_l10_n529(x)
+    if (x < 1)
+        fun_l11_n749(x)
+    else
+        fun_l11_n56(x)
+    end
+end
+
+def fun_l10_n530(x)
+    if (x < 1)
+        fun_l11_n838(x)
+    else
+        fun_l11_n57(x)
+    end
+end
+
+def fun_l10_n531(x)
+    if (x < 1)
+        fun_l11_n293(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n532(x)
+    if (x < 1)
+        fun_l11_n245(x)
+    else
+        fun_l11_n367(x)
+    end
+end
+
+def fun_l10_n533(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n234(x)
+    end
+end
+
+def fun_l10_n534(x)
+    if (x < 1)
+        fun_l11_n315(x)
+    else
+        fun_l11_n982(x)
+    end
+end
+
+def fun_l10_n535(x)
+    if (x < 1)
+        fun_l11_n841(x)
+    else
+        fun_l11_n112(x)
+    end
+end
+
+def fun_l10_n536(x)
+    if (x < 1)
+        fun_l11_n481(x)
+    else
+        fun_l11_n622(x)
+    end
+end
+
+def fun_l10_n537(x)
+    if (x < 1)
+        fun_l11_n666(x)
+    else
+        fun_l11_n775(x)
+    end
+end
+
+def fun_l10_n538(x)
+    if (x < 1)
+        fun_l11_n409(x)
+    else
+        fun_l11_n733(x)
+    end
+end
+
+def fun_l10_n539(x)
+    if (x < 1)
+        fun_l11_n633(x)
+    else
+        fun_l11_n122(x)
+    end
+end
+
+def fun_l10_n540(x)
+    if (x < 1)
+        fun_l11_n453(x)
+    else
+        fun_l11_n938(x)
+    end
+end
+
+def fun_l10_n541(x)
+    if (x < 1)
+        fun_l11_n55(x)
+    else
+        fun_l11_n344(x)
+    end
+end
+
+def fun_l10_n542(x)
+    if (x < 1)
+        fun_l11_n167(x)
+    else
+        fun_l11_n908(x)
+    end
+end
+
+def fun_l10_n543(x)
+    if (x < 1)
+        fun_l11_n318(x)
+    else
+        fun_l11_n893(x)
+    end
+end
+
+def fun_l10_n544(x)
+    if (x < 1)
+        fun_l11_n683(x)
+    else
+        fun_l11_n109(x)
+    end
+end
+
+def fun_l10_n545(x)
+    if (x < 1)
+        fun_l11_n728(x)
+    else
+        fun_l11_n432(x)
+    end
+end
+
+def fun_l10_n546(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n674(x)
+    end
+end
+
+def fun_l10_n547(x)
+    if (x < 1)
+        fun_l11_n374(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n548(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n549(x)
+    if (x < 1)
+        fun_l11_n984(x)
+    else
+        fun_l11_n261(x)
+    end
+end
+
+def fun_l10_n550(x)
+    if (x < 1)
+        fun_l11_n729(x)
+    else
+        fun_l11_n469(x)
+    end
+end
+
+def fun_l10_n551(x)
+    if (x < 1)
+        fun_l11_n829(x)
+    else
+        fun_l11_n30(x)
+    end
+end
+
+def fun_l10_n552(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n440(x)
+    end
+end
+
+def fun_l10_n553(x)
+    if (x < 1)
+        fun_l11_n128(x)
+    else
+        fun_l11_n790(x)
+    end
+end
+
+def fun_l10_n554(x)
+    if (x < 1)
+        fun_l11_n135(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n555(x)
+    if (x < 1)
+        fun_l11_n558(x)
+    else
+        fun_l11_n415(x)
+    end
+end
+
+def fun_l10_n556(x)
+    if (x < 1)
+        fun_l11_n388(x)
+    else
+        fun_l11_n102(x)
+    end
+end
+
+def fun_l10_n557(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n877(x)
+    end
+end
+
+def fun_l10_n558(x)
+    if (x < 1)
+        fun_l11_n266(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n559(x)
+    if (x < 1)
+        fun_l11_n681(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n560(x)
+    if (x < 1)
+        fun_l11_n922(x)
+    else
+        fun_l11_n828(x)
+    end
+end
+
+def fun_l10_n561(x)
+    if (x < 1)
+        fun_l11_n135(x)
+    else
+        fun_l11_n971(x)
+    end
+end
+
+def fun_l10_n562(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n266(x)
+    end
+end
+
+def fun_l10_n563(x)
+    if (x < 1)
+        fun_l11_n291(x)
+    else
+        fun_l11_n587(x)
+    end
+end
+
+def fun_l10_n564(x)
+    if (x < 1)
+        fun_l11_n143(x)
+    else
+        fun_l11_n289(x)
+    end
+end
+
+def fun_l10_n565(x)
+    if (x < 1)
+        fun_l11_n947(x)
+    else
+        fun_l11_n462(x)
+    end
+end
+
+def fun_l10_n566(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n567(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n814(x)
+    end
+end
+
+def fun_l10_n568(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n61(x)
+    end
+end
+
+def fun_l10_n569(x)
+    if (x < 1)
+        fun_l11_n446(x)
+    else
+        fun_l11_n305(x)
+    end
+end
+
+def fun_l10_n570(x)
+    if (x < 1)
+        fun_l11_n209(x)
+    else
+        fun_l11_n768(x)
+    end
+end
+
+def fun_l10_n571(x)
+    if (x < 1)
+        fun_l11_n904(x)
+    else
+        fun_l11_n736(x)
+    end
+end
+
+def fun_l10_n572(x)
+    if (x < 1)
+        fun_l11_n87(x)
+    else
+        fun_l11_n474(x)
+    end
+end
+
+def fun_l10_n573(x)
+    if (x < 1)
+        fun_l11_n886(x)
+    else
+        fun_l11_n75(x)
+    end
+end
+
+def fun_l10_n574(x)
+    if (x < 1)
+        fun_l11_n761(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n575(x)
+    if (x < 1)
+        fun_l11_n255(x)
+    else
+        fun_l11_n321(x)
+    end
+end
+
+def fun_l10_n576(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n356(x)
+    end
+end
+
+def fun_l10_n577(x)
+    if (x < 1)
+        fun_l11_n802(x)
+    else
+        fun_l11_n912(x)
+    end
+end
+
+def fun_l10_n578(x)
+    if (x < 1)
+        fun_l11_n709(x)
+    else
+        fun_l11_n66(x)
+    end
+end
+
+def fun_l10_n579(x)
+    if (x < 1)
+        fun_l11_n994(x)
+    else
+        fun_l11_n424(x)
+    end
+end
+
+def fun_l10_n580(x)
+    if (x < 1)
+        fun_l11_n520(x)
+    else
+        fun_l11_n551(x)
+    end
+end
+
+def fun_l10_n581(x)
+    if (x < 1)
+        fun_l11_n386(x)
+    else
+        fun_l11_n615(x)
+    end
+end
+
+def fun_l10_n582(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n667(x)
+    end
+end
+
+def fun_l10_n583(x)
+    if (x < 1)
+        fun_l11_n829(x)
+    else
+        fun_l11_n802(x)
+    end
+end
+
+def fun_l10_n584(x)
+    if (x < 1)
+        fun_l11_n649(x)
+    else
+        fun_l11_n39(x)
+    end
+end
+
+def fun_l10_n585(x)
+    if (x < 1)
+        fun_l11_n454(x)
+    else
+        fun_l11_n541(x)
+    end
+end
+
+def fun_l10_n586(x)
+    if (x < 1)
+        fun_l11_n281(x)
+    else
+        fun_l11_n4(x)
+    end
+end
+
+def fun_l10_n587(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n656(x)
+    end
+end
+
+def fun_l10_n588(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n38(x)
+    end
+end
+
+def fun_l10_n589(x)
+    if (x < 1)
+        fun_l11_n555(x)
+    else
+        fun_l11_n557(x)
+    end
+end
+
+def fun_l10_n590(x)
+    if (x < 1)
+        fun_l11_n999(x)
+    else
+        fun_l11_n645(x)
+    end
+end
+
+def fun_l10_n591(x)
+    if (x < 1)
+        fun_l11_n714(x)
+    else
+        fun_l11_n872(x)
+    end
+end
+
+def fun_l10_n592(x)
+    if (x < 1)
+        fun_l11_n779(x)
+    else
+        fun_l11_n524(x)
+    end
+end
+
+def fun_l10_n593(x)
+    if (x < 1)
+        fun_l11_n557(x)
+    else
+        fun_l11_n906(x)
+    end
+end
+
+def fun_l10_n594(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n550(x)
+    end
+end
+
+def fun_l10_n595(x)
+    if (x < 1)
+        fun_l11_n138(x)
+    else
+        fun_l11_n785(x)
+    end
+end
+
+def fun_l10_n596(x)
+    if (x < 1)
+        fun_l11_n486(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n597(x)
+    if (x < 1)
+        fun_l11_n374(x)
+    else
+        fun_l11_n477(x)
+    end
+end
+
+def fun_l10_n598(x)
+    if (x < 1)
+        fun_l11_n113(x)
+    else
+        fun_l11_n455(x)
+    end
+end
+
+def fun_l10_n599(x)
+    if (x < 1)
+        fun_l11_n31(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n600(x)
+    if (x < 1)
+        fun_l11_n758(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n601(x)
+    if (x < 1)
+        fun_l11_n198(x)
+    else
+        fun_l11_n436(x)
+    end
+end
+
+def fun_l10_n602(x)
+    if (x < 1)
+        fun_l11_n207(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n603(x)
+    if (x < 1)
+        fun_l11_n827(x)
+    else
+        fun_l11_n267(x)
+    end
+end
+
+def fun_l10_n604(x)
+    if (x < 1)
+        fun_l11_n760(x)
+    else
+        fun_l11_n707(x)
+    end
+end
+
+def fun_l10_n605(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n249(x)
+    end
+end
+
+def fun_l10_n606(x)
+    if (x < 1)
+        fun_l11_n634(x)
+    else
+        fun_l11_n607(x)
+    end
+end
+
+def fun_l10_n607(x)
+    if (x < 1)
+        fun_l11_n605(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n608(x)
+    if (x < 1)
+        fun_l11_n401(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n609(x)
+    if (x < 1)
+        fun_l11_n928(x)
+    else
+        fun_l11_n313(x)
+    end
+end
+
+def fun_l10_n610(x)
+    if (x < 1)
+        fun_l11_n601(x)
+    else
+        fun_l11_n278(x)
+    end
+end
+
+def fun_l10_n611(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n584(x)
+    end
+end
+
+def fun_l10_n612(x)
+    if (x < 1)
+        fun_l11_n906(x)
+    else
+        fun_l11_n58(x)
+    end
+end
+
+def fun_l10_n613(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n631(x)
+    end
+end
+
+def fun_l10_n614(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n85(x)
+    end
+end
+
+def fun_l10_n615(x)
+    if (x < 1)
+        fun_l11_n88(x)
+    else
+        fun_l11_n367(x)
+    end
+end
+
+def fun_l10_n616(x)
+    if (x < 1)
+        fun_l11_n693(x)
+    else
+        fun_l11_n385(x)
+    end
+end
+
+def fun_l10_n617(x)
+    if (x < 1)
+        fun_l11_n18(x)
+    else
+        fun_l11_n526(x)
+    end
+end
+
+def fun_l10_n618(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n303(x)
+    end
+end
+
+def fun_l10_n619(x)
+    if (x < 1)
+        fun_l11_n972(x)
+    else
+        fun_l11_n246(x)
+    end
+end
+
+def fun_l10_n620(x)
+    if (x < 1)
+        fun_l11_n185(x)
+    else
+        fun_l11_n512(x)
+    end
+end
+
+def fun_l10_n621(x)
+    if (x < 1)
+        fun_l11_n87(x)
+    else
+        fun_l11_n131(x)
+    end
+end
+
+def fun_l10_n622(x)
+    if (x < 1)
+        fun_l11_n617(x)
+    else
+        fun_l11_n869(x)
+    end
+end
+
+def fun_l10_n623(x)
+    if (x < 1)
+        fun_l11_n514(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n624(x)
+    if (x < 1)
+        fun_l11_n551(x)
+    else
+        fun_l11_n430(x)
+    end
+end
+
+def fun_l10_n625(x)
+    if (x < 1)
+        fun_l11_n266(x)
+    else
+        fun_l11_n826(x)
+    end
+end
+
+def fun_l10_n626(x)
+    if (x < 1)
+        fun_l11_n90(x)
+    else
+        fun_l11_n866(x)
+    end
+end
+
+def fun_l10_n627(x)
+    if (x < 1)
+        fun_l11_n34(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n628(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n990(x)
+    end
+end
+
+def fun_l10_n629(x)
+    if (x < 1)
+        fun_l11_n573(x)
+    else
+        fun_l11_n874(x)
+    end
+end
+
+def fun_l10_n630(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n87(x)
+    end
+end
+
+def fun_l10_n631(x)
+    if (x < 1)
+        fun_l11_n234(x)
+    else
+        fun_l11_n389(x)
+    end
+end
+
+def fun_l10_n632(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n655(x)
+    end
+end
+
+def fun_l10_n633(x)
+    if (x < 1)
+        fun_l11_n649(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n634(x)
+    if (x < 1)
+        fun_l11_n613(x)
+    else
+        fun_l11_n10(x)
+    end
+end
+
+def fun_l10_n635(x)
+    if (x < 1)
+        fun_l11_n315(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n636(x)
+    if (x < 1)
+        fun_l11_n575(x)
+    else
+        fun_l11_n29(x)
+    end
+end
+
+def fun_l10_n637(x)
+    if (x < 1)
+        fun_l11_n75(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n638(x)
+    if (x < 1)
+        fun_l11_n42(x)
+    else
+        fun_l11_n45(x)
+    end
+end
+
+def fun_l10_n639(x)
+    if (x < 1)
+        fun_l11_n629(x)
+    else
+        fun_l11_n850(x)
+    end
+end
+
+def fun_l10_n640(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n641(x)
+    if (x < 1)
+        fun_l11_n673(x)
+    else
+        fun_l11_n722(x)
+    end
+end
+
+def fun_l10_n642(x)
+    if (x < 1)
+        fun_l11_n922(x)
+    else
+        fun_l11_n783(x)
+    end
+end
+
+def fun_l10_n643(x)
+    if (x < 1)
+        fun_l11_n855(x)
+    else
+        fun_l11_n145(x)
+    end
+end
+
+def fun_l10_n644(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n281(x)
+    end
+end
+
+def fun_l10_n645(x)
+    if (x < 1)
+        fun_l11_n148(x)
+    else
+        fun_l11_n786(x)
+    end
+end
+
+def fun_l10_n646(x)
+    if (x < 1)
+        fun_l11_n743(x)
+    else
+        fun_l11_n627(x)
+    end
+end
+
+def fun_l10_n647(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n234(x)
+    end
+end
+
+def fun_l10_n648(x)
+    if (x < 1)
+        fun_l11_n995(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n649(x)
+    if (x < 1)
+        fun_l11_n155(x)
+    else
+        fun_l11_n384(x)
+    end
+end
+
+def fun_l10_n650(x)
+    if (x < 1)
+        fun_l11_n329(x)
+    else
+        fun_l11_n313(x)
+    end
+end
+
+def fun_l10_n651(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n763(x)
+    end
+end
+
+def fun_l10_n652(x)
+    if (x < 1)
+        fun_l11_n839(x)
+    else
+        fun_l11_n692(x)
+    end
+end
+
+def fun_l10_n653(x)
+    if (x < 1)
+        fun_l11_n388(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n654(x)
+    if (x < 1)
+        fun_l11_n919(x)
+    else
+        fun_l11_n198(x)
+    end
+end
+
+def fun_l10_n655(x)
+    if (x < 1)
+        fun_l11_n313(x)
+    else
+        fun_l11_n686(x)
+    end
+end
+
+def fun_l10_n656(x)
+    if (x < 1)
+        fun_l11_n91(x)
+    else
+        fun_l11_n95(x)
+    end
+end
+
+def fun_l10_n657(x)
+    if (x < 1)
+        fun_l11_n801(x)
+    else
+        fun_l11_n700(x)
+    end
+end
+
+def fun_l10_n658(x)
+    if (x < 1)
+        fun_l11_n938(x)
+    else
+        fun_l11_n936(x)
+    end
+end
+
+def fun_l10_n659(x)
+    if (x < 1)
+        fun_l11_n78(x)
+    else
+        fun_l11_n611(x)
+    end
+end
+
+def fun_l10_n660(x)
+    if (x < 1)
+        fun_l11_n261(x)
+    else
+        fun_l11_n396(x)
+    end
+end
+
+def fun_l10_n661(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n662(x)
+    if (x < 1)
+        fun_l11_n603(x)
+    else
+        fun_l11_n718(x)
+    end
+end
+
+def fun_l10_n663(x)
+    if (x < 1)
+        fun_l11_n512(x)
+    else
+        fun_l11_n158(x)
+    end
+end
+
+def fun_l10_n664(x)
+    if (x < 1)
+        fun_l11_n178(x)
+    else
+        fun_l11_n59(x)
+    end
+end
+
+def fun_l10_n665(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n54(x)
+    end
+end
+
+def fun_l10_n666(x)
+    if (x < 1)
+        fun_l11_n623(x)
+    else
+        fun_l11_n793(x)
+    end
+end
+
+def fun_l10_n667(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n244(x)
+    end
+end
+
+def fun_l10_n668(x)
+    if (x < 1)
+        fun_l11_n253(x)
+    else
+        fun_l11_n297(x)
+    end
+end
+
+def fun_l10_n669(x)
+    if (x < 1)
+        fun_l11_n137(x)
+    else
+        fun_l11_n76(x)
+    end
+end
+
+def fun_l10_n670(x)
+    if (x < 1)
+        fun_l11_n755(x)
+    else
+        fun_l11_n627(x)
+    end
+end
+
+def fun_l10_n671(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n394(x)
+    end
+end
+
+def fun_l10_n672(x)
+    if (x < 1)
+        fun_l11_n858(x)
+    else
+        fun_l11_n823(x)
+    end
+end
+
+def fun_l10_n673(x)
+    if (x < 1)
+        fun_l11_n202(x)
+    else
+        fun_l11_n800(x)
+    end
+end
+
+def fun_l10_n674(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n343(x)
+    end
+end
+
+def fun_l10_n675(x)
+    if (x < 1)
+        fun_l11_n352(x)
+    else
+        fun_l11_n690(x)
+    end
+end
+
+def fun_l10_n676(x)
+    if (x < 1)
+        fun_l11_n598(x)
+    else
+        fun_l11_n108(x)
+    end
+end
+
+def fun_l10_n677(x)
+    if (x < 1)
+        fun_l11_n126(x)
+    else
+        fun_l11_n226(x)
+    end
+end
+
+def fun_l10_n678(x)
+    if (x < 1)
+        fun_l11_n937(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n679(x)
+    if (x < 1)
+        fun_l11_n231(x)
+    else
+        fun_l11_n264(x)
+    end
+end
+
+def fun_l10_n680(x)
+    if (x < 1)
+        fun_l11_n657(x)
+    else
+        fun_l11_n766(x)
+    end
+end
+
+def fun_l10_n681(x)
+    if (x < 1)
+        fun_l11_n444(x)
+    else
+        fun_l11_n405(x)
+    end
+end
+
+def fun_l10_n682(x)
+    if (x < 1)
+        fun_l11_n410(x)
+    else
+        fun_l11_n409(x)
+    end
+end
+
+def fun_l10_n683(x)
+    if (x < 1)
+        fun_l11_n690(x)
+    else
+        fun_l11_n673(x)
+    end
+end
+
+def fun_l10_n684(x)
+    if (x < 1)
+        fun_l11_n737(x)
+    else
+        fun_l11_n61(x)
+    end
+end
+
+def fun_l10_n685(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n387(x)
+    end
+end
+
+def fun_l10_n686(x)
+    if (x < 1)
+        fun_l11_n271(x)
+    else
+        fun_l11_n698(x)
+    end
+end
+
+def fun_l10_n687(x)
+    if (x < 1)
+        fun_l11_n988(x)
+    else
+        fun_l11_n816(x)
+    end
+end
+
+def fun_l10_n688(x)
+    if (x < 1)
+        fun_l11_n309(x)
+    else
+        fun_l11_n576(x)
+    end
+end
+
+def fun_l10_n689(x)
+    if (x < 1)
+        fun_l11_n390(x)
+    else
+        fun_l11_n35(x)
+    end
+end
+
+def fun_l10_n690(x)
+    if (x < 1)
+        fun_l11_n93(x)
+    else
+        fun_l11_n712(x)
+    end
+end
+
+def fun_l10_n691(x)
+    if (x < 1)
+        fun_l11_n285(x)
+    else
+        fun_l11_n467(x)
+    end
+end
+
+def fun_l10_n692(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n41(x)
+    end
+end
+
+def fun_l10_n693(x)
+    if (x < 1)
+        fun_l11_n228(x)
+    else
+        fun_l11_n689(x)
+    end
+end
+
+def fun_l10_n694(x)
+    if (x < 1)
+        fun_l11_n581(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n695(x)
+    if (x < 1)
+        fun_l11_n451(x)
+    else
+        fun_l11_n618(x)
+    end
+end
+
+def fun_l10_n696(x)
+    if (x < 1)
+        fun_l11_n640(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n697(x)
+    if (x < 1)
+        fun_l11_n968(x)
+    else
+        fun_l11_n903(x)
+    end
+end
+
+def fun_l10_n698(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n244(x)
+    end
+end
+
+def fun_l10_n699(x)
+    if (x < 1)
+        fun_l11_n17(x)
+    else
+        fun_l11_n17(x)
+    end
+end
+
+def fun_l10_n700(x)
+    if (x < 1)
+        fun_l11_n918(x)
+    else
+        fun_l11_n539(x)
+    end
+end
+
+def fun_l10_n701(x)
+    if (x < 1)
+        fun_l11_n924(x)
+    else
+        fun_l11_n103(x)
+    end
+end
+
+def fun_l10_n702(x)
+    if (x < 1)
+        fun_l11_n908(x)
+    else
+        fun_l11_n328(x)
+    end
+end
+
+def fun_l10_n703(x)
+    if (x < 1)
+        fun_l11_n393(x)
+    else
+        fun_l11_n386(x)
+    end
+end
+
+def fun_l10_n704(x)
+    if (x < 1)
+        fun_l11_n194(x)
+    else
+        fun_l11_n812(x)
+    end
+end
+
+def fun_l10_n705(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n276(x)
+    end
+end
+
+def fun_l10_n706(x)
+    if (x < 1)
+        fun_l11_n257(x)
+    else
+        fun_l11_n269(x)
+    end
+end
+
+def fun_l10_n707(x)
+    if (x < 1)
+        fun_l11_n940(x)
+    else
+        fun_l11_n593(x)
+    end
+end
+
+def fun_l10_n708(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n709(x)
+    if (x < 1)
+        fun_l11_n244(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n710(x)
+    if (x < 1)
+        fun_l11_n712(x)
+    else
+        fun_l11_n544(x)
+    end
+end
+
+def fun_l10_n711(x)
+    if (x < 1)
+        fun_l11_n701(x)
+    else
+        fun_l11_n104(x)
+    end
+end
+
+def fun_l10_n712(x)
+    if (x < 1)
+        fun_l11_n706(x)
+    else
+        fun_l11_n199(x)
+    end
+end
+
+def fun_l10_n713(x)
+    if (x < 1)
+        fun_l11_n189(x)
+    else
+        fun_l11_n840(x)
+    end
+end
+
+def fun_l10_n714(x)
+    if (x < 1)
+        fun_l11_n122(x)
+    else
+        fun_l11_n318(x)
+    end
+end
+
+def fun_l10_n715(x)
+    if (x < 1)
+        fun_l11_n915(x)
+    else
+        fun_l11_n964(x)
+    end
+end
+
+def fun_l10_n716(x)
+    if (x < 1)
+        fun_l11_n341(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n717(x)
+    if (x < 1)
+        fun_l11_n846(x)
+    else
+        fun_l11_n235(x)
+    end
+end
+
+def fun_l10_n718(x)
+    if (x < 1)
+        fun_l11_n679(x)
+    else
+        fun_l11_n959(x)
+    end
+end
+
+def fun_l10_n719(x)
+    if (x < 1)
+        fun_l11_n121(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n720(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n480(x)
+    end
+end
+
+def fun_l10_n721(x)
+    if (x < 1)
+        fun_l11_n773(x)
+    else
+        fun_l11_n568(x)
+    end
+end
+
+def fun_l10_n722(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n111(x)
+    end
+end
+
+def fun_l10_n723(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n724(x)
+    if (x < 1)
+        fun_l11_n473(x)
+    else
+        fun_l11_n387(x)
+    end
+end
+
+def fun_l10_n725(x)
+    if (x < 1)
+        fun_l11_n584(x)
+    else
+        fun_l11_n224(x)
+    end
+end
+
+def fun_l10_n726(x)
+    if (x < 1)
+        fun_l11_n110(x)
+    else
+        fun_l11_n827(x)
+    end
+end
+
+def fun_l10_n727(x)
+    if (x < 1)
+        fun_l11_n753(x)
+    else
+        fun_l11_n745(x)
+    end
+end
+
+def fun_l10_n728(x)
+    if (x < 1)
+        fun_l11_n550(x)
+    else
+        fun_l11_n380(x)
+    end
+end
+
+def fun_l10_n729(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n401(x)
+    end
+end
+
+def fun_l10_n730(x)
+    if (x < 1)
+        fun_l11_n837(x)
+    else
+        fun_l11_n759(x)
+    end
+end
+
+def fun_l10_n731(x)
+    if (x < 1)
+        fun_l11_n850(x)
+    else
+        fun_l11_n953(x)
+    end
+end
+
+def fun_l10_n732(x)
+    if (x < 1)
+        fun_l11_n872(x)
+    else
+        fun_l11_n864(x)
+    end
+end
+
+def fun_l10_n733(x)
+    if (x < 1)
+        fun_l11_n894(x)
+    else
+        fun_l11_n943(x)
+    end
+end
+
+def fun_l10_n734(x)
+    if (x < 1)
+        fun_l11_n830(x)
+    else
+        fun_l11_n858(x)
+    end
+end
+
+def fun_l10_n735(x)
+    if (x < 1)
+        fun_l11_n661(x)
+    else
+        fun_l11_n366(x)
+    end
+end
+
+def fun_l10_n736(x)
+    if (x < 1)
+        fun_l11_n736(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n737(x)
+    if (x < 1)
+        fun_l11_n316(x)
+    else
+        fun_l11_n977(x)
+    end
+end
+
+def fun_l10_n738(x)
+    if (x < 1)
+        fun_l11_n54(x)
+    else
+        fun_l11_n386(x)
+    end
+end
+
+def fun_l10_n739(x)
+    if (x < 1)
+        fun_l11_n985(x)
+    else
+        fun_l11_n274(x)
+    end
+end
+
+def fun_l10_n740(x)
+    if (x < 1)
+        fun_l11_n756(x)
+    else
+        fun_l11_n171(x)
+    end
+end
+
+def fun_l10_n741(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n251(x)
+    end
+end
+
+def fun_l10_n742(x)
+    if (x < 1)
+        fun_l11_n751(x)
+    else
+        fun_l11_n29(x)
+    end
+end
+
+def fun_l10_n743(x)
+    if (x < 1)
+        fun_l11_n6(x)
+    else
+        fun_l11_n892(x)
+    end
+end
+
+def fun_l10_n744(x)
+    if (x < 1)
+        fun_l11_n85(x)
+    else
+        fun_l11_n205(x)
+    end
+end
+
+def fun_l10_n745(x)
+    if (x < 1)
+        fun_l11_n887(x)
+    else
+        fun_l11_n734(x)
+    end
+end
+
+def fun_l10_n746(x)
+    if (x < 1)
+        fun_l11_n478(x)
+    else
+        fun_l11_n505(x)
+    end
+end
+
+def fun_l10_n747(x)
+    if (x < 1)
+        fun_l11_n760(x)
+    else
+        fun_l11_n286(x)
+    end
+end
+
+def fun_l10_n748(x)
+    if (x < 1)
+        fun_l11_n391(x)
+    else
+        fun_l11_n69(x)
+    end
+end
+
+def fun_l10_n749(x)
+    if (x < 1)
+        fun_l11_n780(x)
+    else
+        fun_l11_n28(x)
+    end
+end
+
+def fun_l10_n750(x)
+    if (x < 1)
+        fun_l11_n337(x)
+    else
+        fun_l11_n647(x)
+    end
+end
+
+def fun_l10_n751(x)
+    if (x < 1)
+        fun_l11_n92(x)
+    else
+        fun_l11_n121(x)
+    end
+end
+
+def fun_l10_n752(x)
+    if (x < 1)
+        fun_l11_n358(x)
+    else
+        fun_l11_n177(x)
+    end
+end
+
+def fun_l10_n753(x)
+    if (x < 1)
+        fun_l11_n642(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n754(x)
+    if (x < 1)
+        fun_l11_n66(x)
+    else
+        fun_l11_n948(x)
+    end
+end
+
+def fun_l10_n755(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n795(x)
+    end
+end
+
+def fun_l10_n756(x)
+    if (x < 1)
+        fun_l11_n734(x)
+    else
+        fun_l11_n162(x)
+    end
+end
+
+def fun_l10_n757(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n31(x)
+    end
+end
+
+def fun_l10_n758(x)
+    if (x < 1)
+        fun_l11_n33(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n759(x)
+    if (x < 1)
+        fun_l11_n210(x)
+    else
+        fun_l11_n330(x)
+    end
+end
+
+def fun_l10_n760(x)
+    if (x < 1)
+        fun_l11_n727(x)
+    else
+        fun_l11_n265(x)
+    end
+end
+
+def fun_l10_n761(x)
+    if (x < 1)
+        fun_l11_n710(x)
+    else
+        fun_l11_n706(x)
+    end
+end
+
+def fun_l10_n762(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n763(x)
+    if (x < 1)
+        fun_l11_n350(x)
+    else
+        fun_l11_n443(x)
+    end
+end
+
+def fun_l10_n764(x)
+    if (x < 1)
+        fun_l11_n522(x)
+    else
+        fun_l11_n662(x)
+    end
+end
+
+def fun_l10_n765(x)
+    if (x < 1)
+        fun_l11_n786(x)
+    else
+        fun_l11_n969(x)
+    end
+end
+
+def fun_l10_n766(x)
+    if (x < 1)
+        fun_l11_n486(x)
+    else
+        fun_l11_n834(x)
+    end
+end
+
+def fun_l10_n767(x)
+    if (x < 1)
+        fun_l11_n84(x)
+    else
+        fun_l11_n989(x)
+    end
+end
+
+def fun_l10_n768(x)
+    if (x < 1)
+        fun_l11_n511(x)
+    else
+        fun_l11_n0(x)
+    end
+end
+
+def fun_l10_n769(x)
+    if (x < 1)
+        fun_l11_n459(x)
+    else
+        fun_l11_n243(x)
+    end
+end
+
+def fun_l10_n770(x)
+    if (x < 1)
+        fun_l11_n59(x)
+    else
+        fun_l11_n267(x)
+    end
+end
+
+def fun_l10_n771(x)
+    if (x < 1)
+        fun_l11_n435(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n772(x)
+    if (x < 1)
+        fun_l11_n986(x)
+    else
+        fun_l11_n227(x)
+    end
+end
+
+def fun_l10_n773(x)
+    if (x < 1)
+        fun_l11_n931(x)
+    else
+        fun_l11_n215(x)
+    end
+end
+
+def fun_l10_n774(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n775(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n780(x)
+    end
+end
+
+def fun_l10_n776(x)
+    if (x < 1)
+        fun_l11_n81(x)
+    else
+        fun_l11_n583(x)
+    end
+end
+
+def fun_l10_n777(x)
+    if (x < 1)
+        fun_l11_n118(x)
+    else
+        fun_l11_n451(x)
+    end
+end
+
+def fun_l10_n778(x)
+    if (x < 1)
+        fun_l11_n767(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n779(x)
+    if (x < 1)
+        fun_l11_n270(x)
+    else
+        fun_l11_n725(x)
+    end
+end
+
+def fun_l10_n780(x)
+    if (x < 1)
+        fun_l11_n146(x)
+    else
+        fun_l11_n407(x)
+    end
+end
+
+def fun_l10_n781(x)
+    if (x < 1)
+        fun_l11_n103(x)
+    else
+        fun_l11_n523(x)
+    end
+end
+
+def fun_l10_n782(x)
+    if (x < 1)
+        fun_l11_n499(x)
+    else
+        fun_l11_n710(x)
+    end
+end
+
+def fun_l10_n783(x)
+    if (x < 1)
+        fun_l11_n971(x)
+    else
+        fun_l11_n426(x)
+    end
+end
+
+def fun_l10_n784(x)
+    if (x < 1)
+        fun_l11_n457(x)
+    else
+        fun_l11_n207(x)
+    end
+end
+
+def fun_l10_n785(x)
+    if (x < 1)
+        fun_l11_n307(x)
+    else
+        fun_l11_n19(x)
+    end
+end
+
+def fun_l10_n786(x)
+    if (x < 1)
+        fun_l11_n458(x)
+    else
+        fun_l11_n243(x)
+    end
+end
+
+def fun_l10_n787(x)
+    if (x < 1)
+        fun_l11_n488(x)
+    else
+        fun_l11_n694(x)
+    end
+end
+
+def fun_l10_n788(x)
+    if (x < 1)
+        fun_l11_n422(x)
+    else
+        fun_l11_n201(x)
+    end
+end
+
+def fun_l10_n789(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n993(x)
+    end
+end
+
+def fun_l10_n790(x)
+    if (x < 1)
+        fun_l11_n443(x)
+    else
+        fun_l11_n124(x)
+    end
+end
+
+def fun_l10_n791(x)
+    if (x < 1)
+        fun_l11_n875(x)
+    else
+        fun_l11_n605(x)
+    end
+end
+
+def fun_l10_n792(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n776(x)
+    end
+end
+
+def fun_l10_n793(x)
+    if (x < 1)
+        fun_l11_n58(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n794(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n981(x)
+    end
+end
+
+def fun_l10_n795(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n599(x)
+    end
+end
+
+def fun_l10_n796(x)
+    if (x < 1)
+        fun_l11_n37(x)
+    else
+        fun_l11_n211(x)
+    end
+end
+
+def fun_l10_n797(x)
+    if (x < 1)
+        fun_l11_n770(x)
+    else
+        fun_l11_n688(x)
+    end
+end
+
+def fun_l10_n798(x)
+    if (x < 1)
+        fun_l11_n728(x)
+    else
+        fun_l11_n150(x)
+    end
+end
+
+def fun_l10_n799(x)
+    if (x < 1)
+        fun_l11_n175(x)
+    else
+        fun_l11_n762(x)
+    end
+end
+
+def fun_l10_n800(x)
+    if (x < 1)
+        fun_l11_n977(x)
+    else
+        fun_l11_n86(x)
+    end
+end
+
+def fun_l10_n801(x)
+    if (x < 1)
+        fun_l11_n669(x)
+    else
+        fun_l11_n120(x)
+    end
+end
+
+def fun_l10_n802(x)
+    if (x < 1)
+        fun_l11_n630(x)
+    else
+        fun_l11_n839(x)
+    end
+end
+
+def fun_l10_n803(x)
+    if (x < 1)
+        fun_l11_n505(x)
+    else
+        fun_l11_n461(x)
+    end
+end
+
+def fun_l10_n804(x)
+    if (x < 1)
+        fun_l11_n757(x)
+    else
+        fun_l11_n620(x)
+    end
+end
+
+def fun_l10_n805(x)
+    if (x < 1)
+        fun_l11_n379(x)
+    else
+        fun_l11_n468(x)
+    end
+end
+
+def fun_l10_n806(x)
+    if (x < 1)
+        fun_l11_n708(x)
+    else
+        fun_l11_n73(x)
+    end
+end
+
+def fun_l10_n807(x)
+    if (x < 1)
+        fun_l11_n340(x)
+    else
+        fun_l11_n671(x)
+    end
+end
+
+def fun_l10_n808(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n912(x)
+    end
+end
+
+def fun_l10_n809(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n20(x)
+    end
+end
+
+def fun_l10_n810(x)
+    if (x < 1)
+        fun_l11_n211(x)
+    else
+        fun_l11_n724(x)
+    end
+end
+
+def fun_l10_n811(x)
+    if (x < 1)
+        fun_l11_n982(x)
+    else
+        fun_l11_n876(x)
+    end
+end
+
+def fun_l10_n812(x)
+    if (x < 1)
+        fun_l11_n455(x)
+    else
+        fun_l11_n846(x)
+    end
+end
+
+def fun_l10_n813(x)
+    if (x < 1)
+        fun_l11_n317(x)
+    else
+        fun_l11_n909(x)
+    end
+end
+
+def fun_l10_n814(x)
+    if (x < 1)
+        fun_l11_n622(x)
+    else
+        fun_l11_n147(x)
+    end
+end
+
+def fun_l10_n815(x)
+    if (x < 1)
+        fun_l11_n174(x)
+    else
+        fun_l11_n660(x)
+    end
+end
+
+def fun_l10_n816(x)
+    if (x < 1)
+        fun_l11_n63(x)
+    else
+        fun_l11_n427(x)
+    end
+end
+
+def fun_l10_n817(x)
+    if (x < 1)
+        fun_l11_n944(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n818(x)
+    if (x < 1)
+        fun_l11_n887(x)
+    else
+        fun_l11_n641(x)
+    end
+end
+
+def fun_l10_n819(x)
+    if (x < 1)
+        fun_l11_n237(x)
+    else
+        fun_l11_n568(x)
+    end
+end
+
+def fun_l10_n820(x)
+    if (x < 1)
+        fun_l11_n415(x)
+    else
+        fun_l11_n374(x)
+    end
+end
+
+def fun_l10_n821(x)
+    if (x < 1)
+        fun_l11_n183(x)
+    else
+        fun_l11_n38(x)
+    end
+end
+
+def fun_l10_n822(x)
+    if (x < 1)
+        fun_l11_n835(x)
+    else
+        fun_l11_n406(x)
+    end
+end
+
+def fun_l10_n823(x)
+    if (x < 1)
+        fun_l11_n233(x)
+    else
+        fun_l11_n118(x)
+    end
+end
+
+def fun_l10_n824(x)
+    if (x < 1)
+        fun_l11_n898(x)
+    else
+        fun_l11_n543(x)
+    end
+end
+
+def fun_l10_n825(x)
+    if (x < 1)
+        fun_l11_n971(x)
+    else
+        fun_l11_n750(x)
+    end
+end
+
+def fun_l10_n826(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n759(x)
+    end
+end
+
+def fun_l10_n827(x)
+    if (x < 1)
+        fun_l11_n953(x)
+    else
+        fun_l11_n187(x)
+    end
+end
+
+def fun_l10_n828(x)
+    if (x < 1)
+        fun_l11_n403(x)
+    else
+        fun_l11_n170(x)
+    end
+end
+
+def fun_l10_n829(x)
+    if (x < 1)
+        fun_l11_n251(x)
+    else
+        fun_l11_n506(x)
+    end
+end
+
+def fun_l10_n830(x)
+    if (x < 1)
+        fun_l11_n426(x)
+    else
+        fun_l11_n325(x)
+    end
+end
+
+def fun_l10_n831(x)
+    if (x < 1)
+        fun_l11_n958(x)
+    else
+        fun_l11_n4(x)
+    end
+end
+
+def fun_l10_n832(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n920(x)
+    end
+end
+
+def fun_l10_n833(x)
+    if (x < 1)
+        fun_l11_n241(x)
+    else
+        fun_l11_n459(x)
+    end
+end
+
+def fun_l10_n834(x)
+    if (x < 1)
+        fun_l11_n559(x)
+    else
+        fun_l11_n671(x)
+    end
+end
+
+def fun_l10_n835(x)
+    if (x < 1)
+        fun_l11_n980(x)
+    else
+        fun_l11_n295(x)
+    end
+end
+
+def fun_l10_n836(x)
+    if (x < 1)
+        fun_l11_n306(x)
+    else
+        fun_l11_n143(x)
+    end
+end
+
+def fun_l10_n837(x)
+    if (x < 1)
+        fun_l11_n176(x)
+    else
+        fun_l11_n341(x)
+    end
+end
+
+def fun_l10_n838(x)
+    if (x < 1)
+        fun_l11_n130(x)
+    else
+        fun_l11_n380(x)
+    end
+end
+
+def fun_l10_n839(x)
+    if (x < 1)
+        fun_l11_n630(x)
+    else
+        fun_l11_n216(x)
+    end
+end
+
+def fun_l10_n840(x)
+    if (x < 1)
+        fun_l11_n500(x)
+    else
+        fun_l11_n579(x)
+    end
+end
+
+def fun_l10_n841(x)
+    if (x < 1)
+        fun_l11_n312(x)
+    else
+        fun_l11_n656(x)
+    end
+end
+
+def fun_l10_n842(x)
+    if (x < 1)
+        fun_l11_n209(x)
+    else
+        fun_l11_n332(x)
+    end
+end
+
+def fun_l10_n843(x)
+    if (x < 1)
+        fun_l11_n555(x)
+    else
+        fun_l11_n179(x)
+    end
+end
+
+def fun_l10_n844(x)
+    if (x < 1)
+        fun_l11_n154(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n845(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n543(x)
+    end
+end
+
+def fun_l10_n846(x)
+    if (x < 1)
+        fun_l11_n346(x)
+    else
+        fun_l11_n553(x)
+    end
+end
+
+def fun_l10_n847(x)
+    if (x < 1)
+        fun_l11_n117(x)
+    else
+        fun_l11_n738(x)
+    end
+end
+
+def fun_l10_n848(x)
+    if (x < 1)
+        fun_l11_n664(x)
+    else
+        fun_l11_n988(x)
+    end
+end
+
+def fun_l10_n849(x)
+    if (x < 1)
+        fun_l11_n298(x)
+    else
+        fun_l11_n753(x)
+    end
+end
+
+def fun_l10_n850(x)
+    if (x < 1)
+        fun_l11_n177(x)
+    else
+        fun_l11_n690(x)
+    end
+end
+
+def fun_l10_n851(x)
+    if (x < 1)
+        fun_l11_n259(x)
+    else
+        fun_l11_n713(x)
+    end
+end
+
+def fun_l10_n852(x)
+    if (x < 1)
+        fun_l11_n151(x)
+    else
+        fun_l11_n580(x)
+    end
+end
+
+def fun_l10_n853(x)
+    if (x < 1)
+        fun_l11_n274(x)
+    else
+        fun_l11_n703(x)
+    end
+end
+
+def fun_l10_n854(x)
+    if (x < 1)
+        fun_l11_n295(x)
+    else
+        fun_l11_n885(x)
+    end
+end
+
+def fun_l10_n855(x)
+    if (x < 1)
+        fun_l11_n513(x)
+    else
+        fun_l11_n963(x)
+    end
+end
+
+def fun_l10_n856(x)
+    if (x < 1)
+        fun_l11_n855(x)
+    else
+        fun_l11_n435(x)
+    end
+end
+
+def fun_l10_n857(x)
+    if (x < 1)
+        fun_l11_n573(x)
+    else
+        fun_l11_n489(x)
+    end
+end
+
+def fun_l10_n858(x)
+    if (x < 1)
+        fun_l11_n880(x)
+    else
+        fun_l11_n91(x)
+    end
+end
+
+def fun_l10_n859(x)
+    if (x < 1)
+        fun_l11_n993(x)
+    else
+        fun_l11_n358(x)
+    end
+end
+
+def fun_l10_n860(x)
+    if (x < 1)
+        fun_l11_n836(x)
+    else
+        fun_l11_n192(x)
+    end
+end
+
+def fun_l10_n861(x)
+    if (x < 1)
+        fun_l11_n493(x)
+    else
+        fun_l11_n564(x)
+    end
+end
+
+def fun_l10_n862(x)
+    if (x < 1)
+        fun_l11_n111(x)
+    else
+        fun_l11_n8(x)
+    end
+end
+
+def fun_l10_n863(x)
+    if (x < 1)
+        fun_l11_n596(x)
+    else
+        fun_l11_n129(x)
+    end
+end
+
+def fun_l10_n864(x)
+    if (x < 1)
+        fun_l11_n0(x)
+    else
+        fun_l11_n687(x)
+    end
+end
+
+def fun_l10_n865(x)
+    if (x < 1)
+        fun_l11_n543(x)
+    else
+        fun_l11_n866(x)
+    end
+end
+
+def fun_l10_n866(x)
+    if (x < 1)
+        fun_l11_n398(x)
+    else
+        fun_l11_n532(x)
+    end
+end
+
+def fun_l10_n867(x)
+    if (x < 1)
+        fun_l11_n15(x)
+    else
+        fun_l11_n991(x)
+    end
+end
+
+def fun_l10_n868(x)
+    if (x < 1)
+        fun_l11_n890(x)
+    else
+        fun_l11_n222(x)
+    end
+end
+
+def fun_l10_n869(x)
+    if (x < 1)
+        fun_l11_n206(x)
+    else
+        fun_l11_n983(x)
+    end
+end
+
+def fun_l10_n870(x)
+    if (x < 1)
+        fun_l11_n869(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n871(x)
+    if (x < 1)
+        fun_l11_n417(x)
+    else
+        fun_l11_n18(x)
+    end
+end
+
+def fun_l10_n872(x)
+    if (x < 1)
+        fun_l11_n738(x)
+    else
+        fun_l11_n473(x)
+    end
+end
+
+def fun_l10_n873(x)
+    if (x < 1)
+        fun_l11_n773(x)
+    else
+        fun_l11_n128(x)
+    end
+end
+
+def fun_l10_n874(x)
+    if (x < 1)
+        fun_l11_n930(x)
+    else
+        fun_l11_n563(x)
+    end
+end
+
+def fun_l10_n875(x)
+    if (x < 1)
+        fun_l11_n868(x)
+    else
+        fun_l11_n356(x)
+    end
+end
+
+def fun_l10_n876(x)
+    if (x < 1)
+        fun_l11_n533(x)
+    else
+        fun_l11_n402(x)
+    end
+end
+
+def fun_l10_n877(x)
+    if (x < 1)
+        fun_l11_n959(x)
+    else
+        fun_l11_n921(x)
+    end
+end
+
+def fun_l10_n878(x)
+    if (x < 1)
+        fun_l11_n717(x)
+    else
+        fun_l11_n484(x)
+    end
+end
+
+def fun_l10_n879(x)
+    if (x < 1)
+        fun_l11_n583(x)
+    else
+        fun_l11_n801(x)
+    end
+end
+
+def fun_l10_n880(x)
+    if (x < 1)
+        fun_l11_n576(x)
+    else
+        fun_l11_n811(x)
+    end
+end
+
+def fun_l10_n881(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n585(x)
+    end
+end
+
+def fun_l10_n882(x)
+    if (x < 1)
+        fun_l11_n648(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n883(x)
+    if (x < 1)
+        fun_l11_n246(x)
+    else
+        fun_l11_n636(x)
+    end
+end
+
+def fun_l10_n884(x)
+    if (x < 1)
+        fun_l11_n112(x)
+    else
+        fun_l11_n798(x)
+    end
+end
+
+def fun_l10_n885(x)
+    if (x < 1)
+        fun_l11_n517(x)
+    else
+        fun_l11_n633(x)
+    end
+end
+
+def fun_l10_n886(x)
+    if (x < 1)
+        fun_l11_n651(x)
+    else
+        fun_l11_n377(x)
+    end
+end
+
+def fun_l10_n887(x)
+    if (x < 1)
+        fun_l11_n652(x)
+    else
+        fun_l11_n419(x)
+    end
+end
+
+def fun_l10_n888(x)
+    if (x < 1)
+        fun_l11_n346(x)
+    else
+        fun_l11_n294(x)
+    end
+end
+
+def fun_l10_n889(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n844(x)
+    end
+end
+
+def fun_l10_n890(x)
+    if (x < 1)
+        fun_l11_n382(x)
+    else
+        fun_l11_n930(x)
+    end
+end
+
+def fun_l10_n891(x)
+    if (x < 1)
+        fun_l11_n900(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n892(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n46(x)
+    end
+end
+
+def fun_l10_n893(x)
+    if (x < 1)
+        fun_l11_n429(x)
+    else
+        fun_l11_n174(x)
+    end
+end
+
+def fun_l10_n894(x)
+    if (x < 1)
+        fun_l11_n142(x)
+    else
+        fun_l11_n739(x)
+    end
+end
+
+def fun_l10_n895(x)
+    if (x < 1)
+        fun_l11_n300(x)
+    else
+        fun_l11_n546(x)
+    end
+end
+
+def fun_l10_n896(x)
+    if (x < 1)
+        fun_l11_n253(x)
+    else
+        fun_l11_n555(x)
+    end
+end
+
+def fun_l10_n897(x)
+    if (x < 1)
+        fun_l11_n29(x)
+    else
+        fun_l11_n913(x)
+    end
+end
+
+def fun_l10_n898(x)
+    if (x < 1)
+        fun_l11_n879(x)
+    else
+        fun_l11_n2(x)
+    end
+end
+
+def fun_l10_n899(x)
+    if (x < 1)
+        fun_l11_n191(x)
+    else
+        fun_l11_n418(x)
+    end
+end
+
+def fun_l10_n900(x)
+    if (x < 1)
+        fun_l11_n239(x)
+    else
+        fun_l11_n904(x)
+    end
+end
+
+def fun_l10_n901(x)
+    if (x < 1)
+        fun_l11_n962(x)
+    else
+        fun_l11_n978(x)
+    end
+end
+
+def fun_l10_n902(x)
+    if (x < 1)
+        fun_l11_n343(x)
+    else
+        fun_l11_n358(x)
+    end
+end
+
+def fun_l10_n903(x)
+    if (x < 1)
+        fun_l11_n334(x)
+    else
+        fun_l11_n806(x)
+    end
+end
+
+def fun_l10_n904(x)
+    if (x < 1)
+        fun_l11_n973(x)
+    else
+        fun_l11_n708(x)
+    end
+end
+
+def fun_l10_n905(x)
+    if (x < 1)
+        fun_l11_n990(x)
+    else
+        fun_l11_n211(x)
+    end
+end
+
+def fun_l10_n906(x)
+    if (x < 1)
+        fun_l11_n499(x)
+    else
+        fun_l11_n605(x)
+    end
+end
+
+def fun_l10_n907(x)
+    if (x < 1)
+        fun_l11_n335(x)
+    else
+        fun_l11_n855(x)
+    end
+end
+
+def fun_l10_n908(x)
+    if (x < 1)
+        fun_l11_n197(x)
+    else
+        fun_l11_n130(x)
+    end
+end
+
+def fun_l10_n909(x)
+    if (x < 1)
+        fun_l11_n462(x)
+    else
+        fun_l11_n838(x)
+    end
+end
+
+def fun_l10_n910(x)
+    if (x < 1)
+        fun_l11_n254(x)
+    else
+        fun_l11_n16(x)
+    end
+end
+
+def fun_l10_n911(x)
+    if (x < 1)
+        fun_l11_n321(x)
+    else
+        fun_l11_n158(x)
+    end
+end
+
+def fun_l10_n912(x)
+    if (x < 1)
+        fun_l11_n113(x)
+    else
+        fun_l11_n50(x)
+    end
+end
+
+def fun_l10_n913(x)
+    if (x < 1)
+        fun_l11_n492(x)
+    else
+        fun_l11_n502(x)
+    end
+end
+
+def fun_l10_n914(x)
+    if (x < 1)
+        fun_l11_n221(x)
+    else
+        fun_l11_n732(x)
+    end
+end
+
+def fun_l10_n915(x)
+    if (x < 1)
+        fun_l11_n853(x)
+    else
+        fun_l11_n625(x)
+    end
+end
+
+def fun_l10_n916(x)
+    if (x < 1)
+        fun_l11_n172(x)
+    else
+        fun_l11_n17(x)
+    end
+end
+
+def fun_l10_n917(x)
+    if (x < 1)
+        fun_l11_n438(x)
+    else
+        fun_l11_n480(x)
+    end
+end
+
+def fun_l10_n918(x)
+    if (x < 1)
+        fun_l11_n646(x)
+    else
+        fun_l11_n833(x)
+    end
+end
+
+def fun_l10_n919(x)
+    if (x < 1)
+        fun_l11_n628(x)
+    else
+        fun_l11_n40(x)
+    end
+end
+
+def fun_l10_n920(x)
+    if (x < 1)
+        fun_l11_n387(x)
+    else
+        fun_l11_n824(x)
+    end
+end
+
+def fun_l10_n921(x)
+    if (x < 1)
+        fun_l11_n641(x)
+    else
+        fun_l11_n669(x)
+    end
+end
+
+def fun_l10_n922(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n591(x)
+    end
+end
+
+def fun_l10_n923(x)
+    if (x < 1)
+        fun_l11_n610(x)
+    else
+        fun_l11_n132(x)
+    end
+end
+
+def fun_l10_n924(x)
+    if (x < 1)
+        fun_l11_n90(x)
+    else
+        fun_l11_n727(x)
+    end
+end
+
+def fun_l10_n925(x)
+    if (x < 1)
+        fun_l11_n44(x)
+    else
+        fun_l11_n412(x)
+    end
+end
+
+def fun_l10_n926(x)
+    if (x < 1)
+        fun_l11_n912(x)
+    else
+        fun_l11_n229(x)
+    end
+end
+
+def fun_l10_n927(x)
+    if (x < 1)
+        fun_l11_n647(x)
+    else
+        fun_l11_n13(x)
+    end
+end
+
+def fun_l10_n928(x)
+    if (x < 1)
+        fun_l11_n820(x)
+    else
+        fun_l11_n316(x)
+    end
+end
+
+def fun_l10_n929(x)
+    if (x < 1)
+        fun_l11_n850(x)
+    else
+        fun_l11_n868(x)
+    end
+end
+
+def fun_l10_n930(x)
+    if (x < 1)
+        fun_l11_n373(x)
+    else
+        fun_l11_n183(x)
+    end
+end
+
+def fun_l10_n931(x)
+    if (x < 1)
+        fun_l11_n217(x)
+    else
+        fun_l11_n230(x)
+    end
+end
+
+def fun_l10_n932(x)
+    if (x < 1)
+        fun_l11_n77(x)
+    else
+        fun_l11_n917(x)
+    end
+end
+
+def fun_l10_n933(x)
+    if (x < 1)
+        fun_l11_n264(x)
+    else
+        fun_l11_n992(x)
+    end
+end
+
+def fun_l10_n934(x)
+    if (x < 1)
+        fun_l11_n125(x)
+    else
+        fun_l11_n441(x)
+    end
+end
+
+def fun_l10_n935(x)
+    if (x < 1)
+        fun_l11_n586(x)
+    else
+        fun_l11_n946(x)
+    end
+end
+
+def fun_l10_n936(x)
+    if (x < 1)
+        fun_l11_n186(x)
+    else
+        fun_l11_n595(x)
+    end
+end
+
+def fun_l10_n937(x)
+    if (x < 1)
+        fun_l11_n210(x)
+    else
+        fun_l11_n186(x)
+    end
+end
+
+def fun_l10_n938(x)
+    if (x < 1)
+        fun_l11_n131(x)
+    else
+        fun_l11_n519(x)
+    end
+end
+
+def fun_l10_n939(x)
+    if (x < 1)
+        fun_l11_n863(x)
+    else
+        fun_l11_n486(x)
+    end
+end
+
+def fun_l10_n940(x)
+    if (x < 1)
+        fun_l11_n753(x)
+    else
+        fun_l11_n916(x)
+    end
+end
+
+def fun_l10_n941(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n153(x)
+    end
+end
+
+def fun_l10_n942(x)
+    if (x < 1)
+        fun_l11_n798(x)
+    else
+        fun_l11_n873(x)
+    end
+end
+
+def fun_l10_n943(x)
+    if (x < 1)
+        fun_l11_n862(x)
+    else
+        fun_l11_n293(x)
+    end
+end
+
+def fun_l10_n944(x)
+    if (x < 1)
+        fun_l11_n554(x)
+    else
+        fun_l11_n599(x)
+    end
+end
+
+def fun_l10_n945(x)
+    if (x < 1)
+        fun_l11_n134(x)
+    else
+        fun_l11_n535(x)
+    end
+end
+
+def fun_l10_n946(x)
+    if (x < 1)
+        fun_l11_n992(x)
+    else
+        fun_l11_n624(x)
+    end
+end
+
+def fun_l10_n947(x)
+    if (x < 1)
+        fun_l11_n436(x)
+    else
+        fun_l11_n153(x)
+    end
+end
+
+def fun_l10_n948(x)
+    if (x < 1)
+        fun_l11_n72(x)
+    else
+        fun_l11_n154(x)
+    end
+end
+
+def fun_l10_n949(x)
+    if (x < 1)
+        fun_l11_n61(x)
+    else
+        fun_l11_n612(x)
+    end
+end
+
+def fun_l10_n950(x)
+    if (x < 1)
+        fun_l11_n964(x)
+    else
+        fun_l11_n999(x)
+    end
+end
+
+def fun_l10_n951(x)
+    if (x < 1)
+        fun_l11_n689(x)
+    else
+        fun_l11_n165(x)
+    end
+end
+
+def fun_l10_n952(x)
+    if (x < 1)
+        fun_l11_n856(x)
+    else
+        fun_l11_n7(x)
+    end
+end
+
+def fun_l10_n953(x)
+    if (x < 1)
+        fun_l11_n421(x)
+    else
+        fun_l11_n416(x)
+    end
+end
+
+def fun_l10_n954(x)
+    if (x < 1)
+        fun_l11_n969(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n955(x)
+    if (x < 1)
+        fun_l11_n716(x)
+    else
+        fun_l11_n364(x)
+    end
+end
+
+def fun_l10_n956(x)
+    if (x < 1)
+        fun_l11_n491(x)
+    else
+        fun_l11_n575(x)
+    end
+end
+
+def fun_l10_n957(x)
+    if (x < 1)
+        fun_l11_n522(x)
+    else
+        fun_l11_n430(x)
+    end
+end
+
+def fun_l10_n958(x)
+    if (x < 1)
+        fun_l11_n712(x)
+    else
+        fun_l11_n939(x)
+    end
+end
+
+def fun_l10_n959(x)
+    if (x < 1)
+        fun_l11_n230(x)
+    else
+        fun_l11_n819(x)
+    end
+end
+
+def fun_l10_n960(x)
+    if (x < 1)
+        fun_l11_n790(x)
+    else
+        fun_l11_n939(x)
+    end
+end
+
+def fun_l10_n961(x)
+    if (x < 1)
+        fun_l11_n844(x)
+    else
+        fun_l11_n847(x)
+    end
+end
+
+def fun_l10_n962(x)
+    if (x < 1)
+        fun_l11_n105(x)
+    else
+        fun_l11_n722(x)
+    end
+end
+
+def fun_l10_n963(x)
+    if (x < 1)
+        fun_l11_n166(x)
+    else
+        fun_l11_n990(x)
+    end
+end
+
+def fun_l10_n964(x)
+    if (x < 1)
+        fun_l11_n224(x)
+    else
+        fun_l11_n751(x)
+    end
+end
+
+def fun_l10_n965(x)
+    if (x < 1)
+        fun_l11_n809(x)
+    else
+        fun_l11_n739(x)
+    end
+end
+
+def fun_l10_n966(x)
+    if (x < 1)
+        fun_l11_n840(x)
+    else
+        fun_l11_n795(x)
+    end
+end
+
+def fun_l10_n967(x)
+    if (x < 1)
+        fun_l11_n791(x)
+    else
+        fun_l11_n926(x)
+    end
+end
+
+def fun_l10_n968(x)
+    if (x < 1)
+        fun_l11_n484(x)
+    else
+        fun_l11_n409(x)
+    end
+end
+
+def fun_l10_n969(x)
+    if (x < 1)
+        fun_l11_n22(x)
+    else
+        fun_l11_n284(x)
+    end
+end
+
+def fun_l10_n970(x)
+    if (x < 1)
+        fun_l11_n539(x)
+    else
+        fun_l11_n661(x)
+    end
+end
+
+def fun_l10_n971(x)
+    if (x < 1)
+        fun_l11_n453(x)
+    else
+        fun_l11_n619(x)
+    end
+end
+
+def fun_l10_n972(x)
+    if (x < 1)
+        fun_l11_n80(x)
+    else
+        fun_l11_n848(x)
+    end
+end
+
+def fun_l10_n973(x)
+    if (x < 1)
+        fun_l11_n599(x)
+    else
+        fun_l11_n147(x)
+    end
+end
+
+def fun_l10_n974(x)
+    if (x < 1)
+        fun_l11_n784(x)
+    else
+        fun_l11_n603(x)
+    end
+end
+
+def fun_l10_n975(x)
+    if (x < 1)
+        fun_l11_n166(x)
+    else
+        fun_l11_n12(x)
+    end
+end
+
+def fun_l10_n976(x)
+    if (x < 1)
+        fun_l11_n739(x)
+    else
+        fun_l11_n381(x)
+    end
+end
+
+def fun_l10_n977(x)
+    if (x < 1)
+        fun_l11_n45(x)
+    else
+        fun_l11_n67(x)
+    end
+end
+
+def fun_l10_n978(x)
+    if (x < 1)
+        fun_l11_n243(x)
+    else
+        fun_l11_n51(x)
+    end
+end
+
+def fun_l10_n979(x)
+    if (x < 1)
+        fun_l11_n964(x)
+    else
+        fun_l11_n949(x)
+    end
+end
+
+def fun_l10_n980(x)
+    if (x < 1)
+        fun_l11_n881(x)
+    else
+        fun_l11_n893(x)
+    end
+end
+
+def fun_l10_n981(x)
+    if (x < 1)
+        fun_l11_n808(x)
+    else
+        fun_l11_n205(x)
+    end
+end
+
+def fun_l10_n982(x)
+    if (x < 1)
+        fun_l11_n897(x)
+    else
+        fun_l11_n259(x)
+    end
+end
+
+def fun_l10_n983(x)
+    if (x < 1)
+        fun_l11_n671(x)
+    else
+        fun_l11_n115(x)
+    end
+end
+
+def fun_l10_n984(x)
+    if (x < 1)
+        fun_l11_n9(x)
+    else
+        fun_l11_n994(x)
+    end
+end
+
+def fun_l10_n985(x)
+    if (x < 1)
+        fun_l11_n663(x)
+    else
+        fun_l11_n979(x)
+    end
+end
+
+def fun_l10_n986(x)
+    if (x < 1)
+        fun_l11_n8(x)
+    else
+        fun_l11_n949(x)
+    end
+end
+
+def fun_l10_n987(x)
+    if (x < 1)
+        fun_l11_n230(x)
+    else
+        fun_l11_n822(x)
+    end
+end
+
+def fun_l10_n988(x)
+    if (x < 1)
+        fun_l11_n767(x)
+    else
+        fun_l11_n691(x)
+    end
+end
+
+def fun_l10_n989(x)
+    if (x < 1)
+        fun_l11_n524(x)
+    else
+        fun_l11_n514(x)
+    end
+end
+
+def fun_l10_n990(x)
+    if (x < 1)
+        fun_l11_n556(x)
+    else
+        fun_l11_n34(x)
+    end
+end
+
+def fun_l10_n991(x)
+    if (x < 1)
+        fun_l11_n516(x)
+    else
+        fun_l11_n817(x)
+    end
+end
+
+def fun_l10_n992(x)
+    if (x < 1)
+        fun_l11_n273(x)
+    else
+        fun_l11_n189(x)
+    end
+end
+
+def fun_l10_n993(x)
+    if (x < 1)
+        fun_l11_n726(x)
+    else
+        fun_l11_n260(x)
+    end
+end
+
+def fun_l10_n994(x)
+    if (x < 1)
+        fun_l11_n789(x)
+    else
+        fun_l11_n993(x)
+    end
+end
+
+def fun_l10_n995(x)
+    if (x < 1)
+        fun_l11_n187(x)
+    else
+        fun_l11_n291(x)
+    end
+end
+
+def fun_l10_n996(x)
+    if (x < 1)
+        fun_l11_n145(x)
+    else
+        fun_l11_n500(x)
+    end
+end
+
+def fun_l10_n997(x)
+    if (x < 1)
+        fun_l11_n437(x)
+    else
+        fun_l11_n925(x)
+    end
+end
+
+def fun_l10_n998(x)
+    if (x < 1)
+        fun_l11_n945(x)
+    else
+        fun_l11_n300(x)
+    end
+end
+
+def fun_l10_n999(x)
+    if (x < 1)
+        fun_l11_n703(x)
+    else
+        fun_l11_n542(x)
+    end
+end
+
+def fun_l11_n0(x)
+    if (x < 1)
+        fun_l12_n539(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n1(x)
+    if (x < 1)
+        fun_l12_n659(x)
+    else
+        fun_l12_n739(x)
+    end
+end
+
+def fun_l11_n2(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n392(x)
+    end
+end
+
+def fun_l11_n3(x)
+    if (x < 1)
+        fun_l12_n394(x)
+    else
+        fun_l12_n989(x)
+    end
+end
+
+def fun_l11_n4(x)
+    if (x < 1)
+        fun_l12_n254(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n5(x)
+    if (x < 1)
+        fun_l12_n229(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n6(x)
+    if (x < 1)
+        fun_l12_n15(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n7(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n187(x)
+    end
+end
+
+def fun_l11_n8(x)
+    if (x < 1)
+        fun_l12_n761(x)
+    else
+        fun_l12_n850(x)
+    end
+end
+
+def fun_l11_n9(x)
+    if (x < 1)
+        fun_l12_n644(x)
+    else
+        fun_l12_n274(x)
+    end
+end
+
+def fun_l11_n10(x)
+    if (x < 1)
+        fun_l12_n652(x)
+    else
+        fun_l12_n223(x)
+    end
+end
+
+def fun_l11_n11(x)
+    if (x < 1)
+        fun_l12_n905(x)
+    else
+        fun_l12_n215(x)
+    end
+end
+
+def fun_l11_n12(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n495(x)
+    end
+end
+
+def fun_l11_n13(x)
+    if (x < 1)
+        fun_l12_n529(x)
+    else
+        fun_l12_n477(x)
+    end
+end
+
+def fun_l11_n14(x)
+    if (x < 1)
+        fun_l12_n743(x)
+    else
+        fun_l12_n847(x)
+    end
+end
+
+def fun_l11_n15(x)
+    if (x < 1)
+        fun_l12_n558(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n16(x)
+    if (x < 1)
+        fun_l12_n115(x)
+    else
+        fun_l12_n972(x)
+    end
+end
+
+def fun_l11_n17(x)
+    if (x < 1)
+        fun_l12_n374(x)
+    else
+        fun_l12_n637(x)
+    end
+end
+
+def fun_l11_n18(x)
+    if (x < 1)
+        fun_l12_n978(x)
+    else
+        fun_l12_n570(x)
+    end
+end
+
+def fun_l11_n19(x)
+    if (x < 1)
+        fun_l12_n264(x)
+    else
+        fun_l12_n743(x)
+    end
+end
+
+def fun_l11_n20(x)
+    if (x < 1)
+        fun_l12_n936(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n21(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n167(x)
+    end
+end
+
+def fun_l11_n22(x)
+    if (x < 1)
+        fun_l12_n777(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n23(x)
+    if (x < 1)
+        fun_l12_n510(x)
+    else
+        fun_l12_n236(x)
+    end
+end
+
+def fun_l11_n24(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n309(x)
+    end
+end
+
+def fun_l11_n25(x)
+    if (x < 1)
+        fun_l12_n850(x)
+    else
+        fun_l12_n374(x)
+    end
+end
+
+def fun_l11_n26(x)
+    if (x < 1)
+        fun_l12_n573(x)
+    else
+        fun_l12_n722(x)
+    end
+end
+
+def fun_l11_n27(x)
+    if (x < 1)
+        fun_l12_n800(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n28(x)
+    if (x < 1)
+        fun_l12_n705(x)
+    else
+        fun_l12_n636(x)
+    end
+end
+
+def fun_l11_n29(x)
+    if (x < 1)
+        fun_l12_n618(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n30(x)
+    if (x < 1)
+        fun_l12_n139(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n31(x)
+    if (x < 1)
+        fun_l12_n861(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n32(x)
+    if (x < 1)
+        fun_l12_n576(x)
+    else
+        fun_l12_n719(x)
+    end
+end
+
+def fun_l11_n33(x)
+    if (x < 1)
+        fun_l12_n236(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n34(x)
+    if (x < 1)
+        fun_l12_n375(x)
+    else
+        fun_l12_n696(x)
+    end
+end
+
+def fun_l11_n35(x)
+    if (x < 1)
+        fun_l12_n291(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n36(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n228(x)
+    end
+end
+
+def fun_l11_n37(x)
+    if (x < 1)
+        fun_l12_n455(x)
+    else
+        fun_l12_n983(x)
+    end
+end
+
+def fun_l11_n38(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n871(x)
+    end
+end
+
+def fun_l11_n39(x)
+    if (x < 1)
+        fun_l12_n945(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n40(x)
+    if (x < 1)
+        fun_l12_n531(x)
+    else
+        fun_l12_n506(x)
+    end
+end
+
+def fun_l11_n41(x)
+    if (x < 1)
+        fun_l12_n248(x)
+    else
+        fun_l12_n142(x)
+    end
+end
+
+def fun_l11_n42(x)
+    if (x < 1)
+        fun_l12_n415(x)
+    else
+        fun_l12_n177(x)
+    end
+end
+
+def fun_l11_n43(x)
+    if (x < 1)
+        fun_l12_n560(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n44(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n45(x)
+    if (x < 1)
+        fun_l12_n814(x)
+    else
+        fun_l12_n967(x)
+    end
+end
+
+def fun_l11_n46(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n702(x)
+    end
+end
+
+def fun_l11_n47(x)
+    if (x < 1)
+        fun_l12_n626(x)
+    else
+        fun_l12_n615(x)
+    end
+end
+
+def fun_l11_n48(x)
+    if (x < 1)
+        fun_l12_n374(x)
+    else
+        fun_l12_n669(x)
+    end
+end
+
+def fun_l11_n49(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n48(x)
+    end
+end
+
+def fun_l11_n50(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n455(x)
+    end
+end
+
+def fun_l11_n51(x)
+    if (x < 1)
+        fun_l12_n461(x)
+    else
+        fun_l12_n350(x)
+    end
+end
+
+def fun_l11_n52(x)
+    if (x < 1)
+        fun_l12_n129(x)
+    else
+        fun_l12_n266(x)
+    end
+end
+
+def fun_l11_n53(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n863(x)
+    end
+end
+
+def fun_l11_n54(x)
+    if (x < 1)
+        fun_l12_n216(x)
+    else
+        fun_l12_n820(x)
+    end
+end
+
+def fun_l11_n55(x)
+    if (x < 1)
+        fun_l12_n626(x)
+    else
+        fun_l12_n476(x)
+    end
+end
+
+def fun_l11_n56(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n796(x)
+    end
+end
+
+def fun_l11_n57(x)
+    if (x < 1)
+        fun_l12_n45(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n58(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n919(x)
+    end
+end
+
+def fun_l11_n59(x)
+    if (x < 1)
+        fun_l12_n300(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n60(x)
+    if (x < 1)
+        fun_l12_n265(x)
+    else
+        fun_l12_n552(x)
+    end
+end
+
+def fun_l11_n61(x)
+    if (x < 1)
+        fun_l12_n927(x)
+    else
+        fun_l12_n486(x)
+    end
+end
+
+def fun_l11_n62(x)
+    if (x < 1)
+        fun_l12_n94(x)
+    else
+        fun_l12_n28(x)
+    end
+end
+
+def fun_l11_n63(x)
+    if (x < 1)
+        fun_l12_n295(x)
+    else
+        fun_l12_n967(x)
+    end
+end
+
+def fun_l11_n64(x)
+    if (x < 1)
+        fun_l12_n713(x)
+    else
+        fun_l12_n463(x)
+    end
+end
+
+def fun_l11_n65(x)
+    if (x < 1)
+        fun_l12_n454(x)
+    else
+        fun_l12_n616(x)
+    end
+end
+
+def fun_l11_n66(x)
+    if (x < 1)
+        fun_l12_n121(x)
+    else
+        fun_l12_n277(x)
+    end
+end
+
+def fun_l11_n67(x)
+    if (x < 1)
+        fun_l12_n524(x)
+    else
+        fun_l12_n242(x)
+    end
+end
+
+def fun_l11_n68(x)
+    if (x < 1)
+        fun_l12_n570(x)
+    else
+        fun_l12_n658(x)
+    end
+end
+
+def fun_l11_n69(x)
+    if (x < 1)
+        fun_l12_n343(x)
+    else
+        fun_l12_n826(x)
+    end
+end
+
+def fun_l11_n70(x)
+    if (x < 1)
+        fun_l12_n732(x)
+    else
+        fun_l12_n993(x)
+    end
+end
+
+def fun_l11_n71(x)
+    if (x < 1)
+        fun_l12_n380(x)
+    else
+        fun_l12_n486(x)
+    end
+end
+
+def fun_l11_n72(x)
+    if (x < 1)
+        fun_l12_n55(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n73(x)
+    if (x < 1)
+        fun_l12_n789(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n74(x)
+    if (x < 1)
+        fun_l12_n106(x)
+    else
+        fun_l12_n557(x)
+    end
+end
+
+def fun_l11_n75(x)
+    if (x < 1)
+        fun_l12_n368(x)
+    else
+        fun_l12_n5(x)
+    end
+end
+
+def fun_l11_n76(x)
+    if (x < 1)
+        fun_l12_n992(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n77(x)
+    if (x < 1)
+        fun_l12_n754(x)
+    else
+        fun_l12_n259(x)
+    end
+end
+
+def fun_l11_n78(x)
+    if (x < 1)
+        fun_l12_n855(x)
+    else
+        fun_l12_n946(x)
+    end
+end
+
+def fun_l11_n79(x)
+    if (x < 1)
+        fun_l12_n727(x)
+    else
+        fun_l12_n422(x)
+    end
+end
+
+def fun_l11_n80(x)
+    if (x < 1)
+        fun_l12_n649(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n81(x)
+    if (x < 1)
+        fun_l12_n206(x)
+    else
+        fun_l12_n222(x)
+    end
+end
+
+def fun_l11_n82(x)
+    if (x < 1)
+        fun_l12_n995(x)
+    else
+        fun_l12_n471(x)
+    end
+end
+
+def fun_l11_n83(x)
+    if (x < 1)
+        fun_l12_n926(x)
+    else
+        fun_l12_n165(x)
+    end
+end
+
+def fun_l11_n84(x)
+    if (x < 1)
+        fun_l12_n988(x)
+    else
+        fun_l12_n495(x)
+    end
+end
+
+def fun_l11_n85(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n565(x)
+    end
+end
+
+def fun_l11_n86(x)
+    if (x < 1)
+        fun_l12_n381(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n87(x)
+    if (x < 1)
+        fun_l12_n64(x)
+    else
+        fun_l12_n616(x)
+    end
+end
+
+def fun_l11_n88(x)
+    if (x < 1)
+        fun_l12_n714(x)
+    else
+        fun_l12_n995(x)
+    end
+end
+
+def fun_l11_n89(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n534(x)
+    end
+end
+
+def fun_l11_n90(x)
+    if (x < 1)
+        fun_l12_n31(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n91(x)
+    if (x < 1)
+        fun_l12_n741(x)
+    else
+        fun_l12_n356(x)
+    end
+end
+
+def fun_l11_n92(x)
+    if (x < 1)
+        fun_l12_n418(x)
+    else
+        fun_l12_n184(x)
+    end
+end
+
+def fun_l11_n93(x)
+    if (x < 1)
+        fun_l12_n427(x)
+    else
+        fun_l12_n136(x)
+    end
+end
+
+def fun_l11_n94(x)
+    if (x < 1)
+        fun_l12_n968(x)
+    else
+        fun_l12_n647(x)
+    end
+end
+
+def fun_l11_n95(x)
+    if (x < 1)
+        fun_l12_n641(x)
+    else
+        fun_l12_n675(x)
+    end
+end
+
+def fun_l11_n96(x)
+    if (x < 1)
+        fun_l12_n465(x)
+    else
+        fun_l12_n507(x)
+    end
+end
+
+def fun_l11_n97(x)
+    if (x < 1)
+        fun_l12_n910(x)
+    else
+        fun_l12_n718(x)
+    end
+end
+
+def fun_l11_n98(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n99(x)
+    if (x < 1)
+        fun_l12_n94(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n100(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n228(x)
+    end
+end
+
+def fun_l11_n101(x)
+    if (x < 1)
+        fun_l12_n569(x)
+    else
+        fun_l12_n492(x)
+    end
+end
+
+def fun_l11_n102(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n183(x)
+    end
+end
+
+def fun_l11_n103(x)
+    if (x < 1)
+        fun_l12_n894(x)
+    else
+        fun_l12_n655(x)
+    end
+end
+
+def fun_l11_n104(x)
+    if (x < 1)
+        fun_l12_n347(x)
+    else
+        fun_l12_n467(x)
+    end
+end
+
+def fun_l11_n105(x)
+    if (x < 1)
+        fun_l12_n198(x)
+    else
+        fun_l12_n838(x)
+    end
+end
+
+def fun_l11_n106(x)
+    if (x < 1)
+        fun_l12_n941(x)
+    else
+        fun_l12_n98(x)
+    end
+end
+
+def fun_l11_n107(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n108(x)
+    if (x < 1)
+        fun_l12_n980(x)
+    else
+        fun_l12_n508(x)
+    end
+end
+
+def fun_l11_n109(x)
+    if (x < 1)
+        fun_l12_n286(x)
+    else
+        fun_l12_n928(x)
+    end
+end
+
+def fun_l11_n110(x)
+    if (x < 1)
+        fun_l12_n710(x)
+    else
+        fun_l12_n20(x)
+    end
+end
+
+def fun_l11_n111(x)
+    if (x < 1)
+        fun_l12_n358(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n112(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n548(x)
+    end
+end
+
+def fun_l11_n113(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n802(x)
+    end
+end
+
+def fun_l11_n114(x)
+    if (x < 1)
+        fun_l12_n199(x)
+    else
+        fun_l12_n904(x)
+    end
+end
+
+def fun_l11_n115(x)
+    if (x < 1)
+        fun_l12_n995(x)
+    else
+        fun_l12_n319(x)
+    end
+end
+
+def fun_l11_n116(x)
+    if (x < 1)
+        fun_l12_n873(x)
+    else
+        fun_l12_n786(x)
+    end
+end
+
+def fun_l11_n117(x)
+    if (x < 1)
+        fun_l12_n147(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n118(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n871(x)
+    end
+end
+
+def fun_l11_n119(x)
+    if (x < 1)
+        fun_l12_n552(x)
+    else
+        fun_l12_n998(x)
+    end
+end
+
+def fun_l11_n120(x)
+    if (x < 1)
+        fun_l12_n300(x)
+    else
+        fun_l12_n333(x)
+    end
+end
+
+def fun_l11_n121(x)
+    if (x < 1)
+        fun_l12_n846(x)
+    else
+        fun_l12_n133(x)
+    end
+end
+
+def fun_l11_n122(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n540(x)
+    end
+end
+
+def fun_l11_n123(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n264(x)
+    end
+end
+
+def fun_l11_n124(x)
+    if (x < 1)
+        fun_l12_n410(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n125(x)
+    if (x < 1)
+        fun_l12_n62(x)
+    else
+        fun_l12_n211(x)
+    end
+end
+
+def fun_l11_n126(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n635(x)
+    end
+end
+
+def fun_l11_n127(x)
+    if (x < 1)
+        fun_l12_n444(x)
+    else
+        fun_l12_n735(x)
+    end
+end
+
+def fun_l11_n128(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n403(x)
+    end
+end
+
+def fun_l11_n129(x)
+    if (x < 1)
+        fun_l12_n121(x)
+    else
+        fun_l12_n882(x)
+    end
+end
+
+def fun_l11_n130(x)
+    if (x < 1)
+        fun_l12_n985(x)
+    else
+        fun_l12_n983(x)
+    end
+end
+
+def fun_l11_n131(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n132(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n312(x)
+    end
+end
+
+def fun_l11_n133(x)
+    if (x < 1)
+        fun_l12_n249(x)
+    else
+        fun_l12_n870(x)
+    end
+end
+
+def fun_l11_n134(x)
+    if (x < 1)
+        fun_l12_n367(x)
+    else
+        fun_l12_n748(x)
+    end
+end
+
+def fun_l11_n135(x)
+    if (x < 1)
+        fun_l12_n670(x)
+    else
+        fun_l12_n464(x)
+    end
+end
+
+def fun_l11_n136(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n238(x)
+    end
+end
+
+def fun_l11_n137(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n660(x)
+    end
+end
+
+def fun_l11_n138(x)
+    if (x < 1)
+        fun_l12_n693(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n139(x)
+    if (x < 1)
+        fun_l12_n959(x)
+    else
+        fun_l12_n377(x)
+    end
+end
+
+def fun_l11_n140(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n250(x)
+    end
+end
+
+def fun_l11_n141(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n720(x)
+    end
+end
+
+def fun_l11_n142(x)
+    if (x < 1)
+        fun_l12_n775(x)
+    else
+        fun_l12_n781(x)
+    end
+end
+
+def fun_l11_n143(x)
+    if (x < 1)
+        fun_l12_n266(x)
+    else
+        fun_l12_n608(x)
+    end
+end
+
+def fun_l11_n144(x)
+    if (x < 1)
+        fun_l12_n196(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n145(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n846(x)
+    end
+end
+
+def fun_l11_n146(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n966(x)
+    end
+end
+
+def fun_l11_n147(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n148(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n710(x)
+    end
+end
+
+def fun_l11_n149(x)
+    if (x < 1)
+        fun_l12_n597(x)
+    else
+        fun_l12_n596(x)
+    end
+end
+
+def fun_l11_n150(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n349(x)
+    end
+end
+
+def fun_l11_n151(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n231(x)
+    end
+end
+
+def fun_l11_n152(x)
+    if (x < 1)
+        fun_l12_n67(x)
+    else
+        fun_l12_n685(x)
+    end
+end
+
+def fun_l11_n153(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n71(x)
+    end
+end
+
+def fun_l11_n154(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n155(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n565(x)
+    end
+end
+
+def fun_l11_n156(x)
+    if (x < 1)
+        fun_l12_n885(x)
+    else
+        fun_l12_n27(x)
+    end
+end
+
+def fun_l11_n157(x)
+    if (x < 1)
+        fun_l12_n704(x)
+    else
+        fun_l12_n140(x)
+    end
+end
+
+def fun_l11_n158(x)
+    if (x < 1)
+        fun_l12_n505(x)
+    else
+        fun_l12_n428(x)
+    end
+end
+
+def fun_l11_n159(x)
+    if (x < 1)
+        fun_l12_n646(x)
+    else
+        fun_l12_n250(x)
+    end
+end
+
+def fun_l11_n160(x)
+    if (x < 1)
+        fun_l12_n125(x)
+    else
+        fun_l12_n22(x)
+    end
+end
+
+def fun_l11_n161(x)
+    if (x < 1)
+        fun_l12_n49(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n162(x)
+    if (x < 1)
+        fun_l12_n992(x)
+    else
+        fun_l12_n321(x)
+    end
+end
+
+def fun_l11_n163(x)
+    if (x < 1)
+        fun_l12_n457(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n164(x)
+    if (x < 1)
+        fun_l12_n612(x)
+    else
+        fun_l12_n107(x)
+    end
+end
+
+def fun_l11_n165(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n338(x)
+    end
+end
+
+def fun_l11_n166(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n18(x)
+    end
+end
+
+def fun_l11_n167(x)
+    if (x < 1)
+        fun_l12_n605(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n168(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n822(x)
+    end
+end
+
+def fun_l11_n169(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n291(x)
+    end
+end
+
+def fun_l11_n170(x)
+    if (x < 1)
+        fun_l12_n984(x)
+    else
+        fun_l12_n950(x)
+    end
+end
+
+def fun_l11_n171(x)
+    if (x < 1)
+        fun_l12_n915(x)
+    else
+        fun_l12_n81(x)
+    end
+end
+
+def fun_l11_n172(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n405(x)
+    end
+end
+
+def fun_l11_n173(x)
+    if (x < 1)
+        fun_l12_n331(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n174(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n378(x)
+    end
+end
+
+def fun_l11_n175(x)
+    if (x < 1)
+        fun_l12_n648(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n176(x)
+    if (x < 1)
+        fun_l12_n876(x)
+    else
+        fun_l12_n873(x)
+    end
+end
+
+def fun_l11_n177(x)
+    if (x < 1)
+        fun_l12_n932(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n178(x)
+    if (x < 1)
+        fun_l12_n975(x)
+    else
+        fun_l12_n166(x)
+    end
+end
+
+def fun_l11_n179(x)
+    if (x < 1)
+        fun_l12_n66(x)
+    else
+        fun_l12_n624(x)
+    end
+end
+
+def fun_l11_n180(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n181(x)
+    if (x < 1)
+        fun_l12_n80(x)
+    else
+        fun_l12_n504(x)
+    end
+end
+
+def fun_l11_n182(x)
+    if (x < 1)
+        fun_l12_n465(x)
+    else
+        fun_l12_n319(x)
+    end
+end
+
+def fun_l11_n183(x)
+    if (x < 1)
+        fun_l12_n493(x)
+    else
+        fun_l12_n412(x)
+    end
+end
+
+def fun_l11_n184(x)
+    if (x < 1)
+        fun_l12_n278(x)
+    else
+        fun_l12_n145(x)
+    end
+end
+
+def fun_l11_n185(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n777(x)
+    end
+end
+
+def fun_l11_n186(x)
+    if (x < 1)
+        fun_l12_n120(x)
+    else
+        fun_l12_n462(x)
+    end
+end
+
+def fun_l11_n187(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n188(x)
+    if (x < 1)
+        fun_l12_n378(x)
+    else
+        fun_l12_n174(x)
+    end
+end
+
+def fun_l11_n189(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n234(x)
+    end
+end
+
+def fun_l11_n190(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n437(x)
+    end
+end
+
+def fun_l11_n191(x)
+    if (x < 1)
+        fun_l12_n399(x)
+    else
+        fun_l12_n989(x)
+    end
+end
+
+def fun_l11_n192(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n953(x)
+    end
+end
+
+def fun_l11_n193(x)
+    if (x < 1)
+        fun_l12_n139(x)
+    else
+        fun_l12_n138(x)
+    end
+end
+
+def fun_l11_n194(x)
+    if (x < 1)
+        fun_l12_n294(x)
+    else
+        fun_l12_n676(x)
+    end
+end
+
+def fun_l11_n195(x)
+    if (x < 1)
+        fun_l12_n581(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n196(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n197(x)
+    if (x < 1)
+        fun_l12_n170(x)
+    else
+        fun_l12_n476(x)
+    end
+end
+
+def fun_l11_n198(x)
+    if (x < 1)
+        fun_l12_n350(x)
+    else
+        fun_l12_n576(x)
+    end
+end
+
+def fun_l11_n199(x)
+    if (x < 1)
+        fun_l12_n647(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n200(x)
+    if (x < 1)
+        fun_l12_n28(x)
+    else
+        fun_l12_n706(x)
+    end
+end
+
+def fun_l11_n201(x)
+    if (x < 1)
+        fun_l12_n189(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n202(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n807(x)
+    end
+end
+
+def fun_l11_n203(x)
+    if (x < 1)
+        fun_l12_n402(x)
+    else
+        fun_l12_n685(x)
+    end
+end
+
+def fun_l11_n204(x)
+    if (x < 1)
+        fun_l12_n232(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n205(x)
+    if (x < 1)
+        fun_l12_n108(x)
+    else
+        fun_l12_n888(x)
+    end
+end
+
+def fun_l11_n206(x)
+    if (x < 1)
+        fun_l12_n494(x)
+    else
+        fun_l12_n372(x)
+    end
+end
+
+def fun_l11_n207(x)
+    if (x < 1)
+        fun_l12_n607(x)
+    else
+        fun_l12_n336(x)
+    end
+end
+
+def fun_l11_n208(x)
+    if (x < 1)
+        fun_l12_n913(x)
+    else
+        fun_l12_n134(x)
+    end
+end
+
+def fun_l11_n209(x)
+    if (x < 1)
+        fun_l12_n996(x)
+    else
+        fun_l12_n918(x)
+    end
+end
+
+def fun_l11_n210(x)
+    if (x < 1)
+        fun_l12_n674(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n211(x)
+    if (x < 1)
+        fun_l12_n344(x)
+    else
+        fun_l12_n219(x)
+    end
+end
+
+def fun_l11_n212(x)
+    if (x < 1)
+        fun_l12_n161(x)
+    else
+        fun_l12_n415(x)
+    end
+end
+
+def fun_l11_n213(x)
+    if (x < 1)
+        fun_l12_n65(x)
+    else
+        fun_l12_n777(x)
+    end
+end
+
+def fun_l11_n214(x)
+    if (x < 1)
+        fun_l12_n369(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n215(x)
+    if (x < 1)
+        fun_l12_n310(x)
+    else
+        fun_l12_n118(x)
+    end
+end
+
+def fun_l11_n216(x)
+    if (x < 1)
+        fun_l12_n326(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n217(x)
+    if (x < 1)
+        fun_l12_n981(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n218(x)
+    if (x < 1)
+        fun_l12_n425(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n219(x)
+    if (x < 1)
+        fun_l12_n931(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n220(x)
+    if (x < 1)
+        fun_l12_n325(x)
+    else
+        fun_l12_n926(x)
+    end
+end
+
+def fun_l11_n221(x)
+    if (x < 1)
+        fun_l12_n924(x)
+    else
+        fun_l12_n764(x)
+    end
+end
+
+def fun_l11_n222(x)
+    if (x < 1)
+        fun_l12_n407(x)
+    else
+        fun_l12_n137(x)
+    end
+end
+
+def fun_l11_n223(x)
+    if (x < 1)
+        fun_l12_n584(x)
+    else
+        fun_l12_n294(x)
+    end
+end
+
+def fun_l11_n224(x)
+    if (x < 1)
+        fun_l12_n39(x)
+    else
+        fun_l12_n795(x)
+    end
+end
+
+def fun_l11_n225(x)
+    if (x < 1)
+        fun_l12_n37(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n226(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n227(x)
+    if (x < 1)
+        fun_l12_n116(x)
+    else
+        fun_l12_n589(x)
+    end
+end
+
+def fun_l11_n228(x)
+    if (x < 1)
+        fun_l12_n500(x)
+    else
+        fun_l12_n916(x)
+    end
+end
+
+def fun_l11_n229(x)
+    if (x < 1)
+        fun_l12_n443(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n230(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n184(x)
+    end
+end
+
+def fun_l11_n231(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n171(x)
+    end
+end
+
+def fun_l11_n232(x)
+    if (x < 1)
+        fun_l12_n287(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n233(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n435(x)
+    end
+end
+
+def fun_l11_n234(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n235(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n236(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n702(x)
+    end
+end
+
+def fun_l11_n237(x)
+    if (x < 1)
+        fun_l12_n645(x)
+    else
+        fun_l12_n691(x)
+    end
+end
+
+def fun_l11_n238(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n97(x)
+    end
+end
+
+def fun_l11_n239(x)
+    if (x < 1)
+        fun_l12_n491(x)
+    else
+        fun_l12_n172(x)
+    end
+end
+
+def fun_l11_n240(x)
+    if (x < 1)
+        fun_l12_n882(x)
+    else
+        fun_l12_n596(x)
+    end
+end
+
+def fun_l11_n241(x)
+    if (x < 1)
+        fun_l12_n178(x)
+    else
+        fun_l12_n671(x)
+    end
+end
+
+def fun_l11_n242(x)
+    if (x < 1)
+        fun_l12_n483(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n243(x)
+    if (x < 1)
+        fun_l12_n677(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n244(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n873(x)
+    end
+end
+
+def fun_l11_n245(x)
+    if (x < 1)
+        fun_l12_n393(x)
+    else
+        fun_l12_n532(x)
+    end
+end
+
+def fun_l11_n246(x)
+    if (x < 1)
+        fun_l12_n704(x)
+    else
+        fun_l12_n885(x)
+    end
+end
+
+def fun_l11_n247(x)
+    if (x < 1)
+        fun_l12_n668(x)
+    else
+        fun_l12_n305(x)
+    end
+end
+
+def fun_l11_n248(x)
+    if (x < 1)
+        fun_l12_n925(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n249(x)
+    if (x < 1)
+        fun_l12_n487(x)
+    else
+        fun_l12_n517(x)
+    end
+end
+
+def fun_l11_n250(x)
+    if (x < 1)
+        fun_l12_n889(x)
+    else
+        fun_l12_n91(x)
+    end
+end
+
+def fun_l11_n251(x)
+    if (x < 1)
+        fun_l12_n908(x)
+    else
+        fun_l12_n645(x)
+    end
+end
+
+def fun_l11_n252(x)
+    if (x < 1)
+        fun_l12_n747(x)
+    else
+        fun_l12_n736(x)
+    end
+end
+
+def fun_l11_n253(x)
+    if (x < 1)
+        fun_l12_n749(x)
+    else
+        fun_l12_n264(x)
+    end
+end
+
+def fun_l11_n254(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n120(x)
+    end
+end
+
+def fun_l11_n255(x)
+    if (x < 1)
+        fun_l12_n231(x)
+    else
+        fun_l12_n211(x)
+    end
+end
+
+def fun_l11_n256(x)
+    if (x < 1)
+        fun_l12_n66(x)
+    else
+        fun_l12_n998(x)
+    end
+end
+
+def fun_l11_n257(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n258(x)
+    if (x < 1)
+        fun_l12_n96(x)
+    else
+        fun_l12_n489(x)
+    end
+end
+
+def fun_l11_n259(x)
+    if (x < 1)
+        fun_l12_n86(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n260(x)
+    if (x < 1)
+        fun_l12_n774(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n261(x)
+    if (x < 1)
+        fun_l12_n935(x)
+    else
+        fun_l12_n29(x)
+    end
+end
+
+def fun_l11_n262(x)
+    if (x < 1)
+        fun_l12_n599(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n263(x)
+    if (x < 1)
+        fun_l12_n63(x)
+    else
+        fun_l12_n866(x)
+    end
+end
+
+def fun_l11_n264(x)
+    if (x < 1)
+        fun_l12_n892(x)
+    else
+        fun_l12_n847(x)
+    end
+end
+
+def fun_l11_n265(x)
+    if (x < 1)
+        fun_l12_n695(x)
+    else
+        fun_l12_n881(x)
+    end
+end
+
+def fun_l11_n266(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n267(x)
+    if (x < 1)
+        fun_l12_n448(x)
+    else
+        fun_l12_n744(x)
+    end
+end
+
+def fun_l11_n268(x)
+    if (x < 1)
+        fun_l12_n587(x)
+    else
+        fun_l12_n462(x)
+    end
+end
+
+def fun_l11_n269(x)
+    if (x < 1)
+        fun_l12_n670(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n270(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n903(x)
+    end
+end
+
+def fun_l11_n271(x)
+    if (x < 1)
+        fun_l12_n914(x)
+    else
+        fun_l12_n459(x)
+    end
+end
+
+def fun_l11_n272(x)
+    if (x < 1)
+        fun_l12_n932(x)
+    else
+        fun_l12_n10(x)
+    end
+end
+
+def fun_l11_n273(x)
+    if (x < 1)
+        fun_l12_n554(x)
+    else
+        fun_l12_n528(x)
+    end
+end
+
+def fun_l11_n274(x)
+    if (x < 1)
+        fun_l12_n698(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n275(x)
+    if (x < 1)
+        fun_l12_n907(x)
+    else
+        fun_l12_n945(x)
+    end
+end
+
+def fun_l11_n276(x)
+    if (x < 1)
+        fun_l12_n421(x)
+    else
+        fun_l12_n575(x)
+    end
+end
+
+def fun_l11_n277(x)
+    if (x < 1)
+        fun_l12_n757(x)
+    else
+        fun_l12_n808(x)
+    end
+end
+
+def fun_l11_n278(x)
+    if (x < 1)
+        fun_l12_n527(x)
+    else
+        fun_l12_n438(x)
+    end
+end
+
+def fun_l11_n279(x)
+    if (x < 1)
+        fun_l12_n263(x)
+    else
+        fun_l12_n842(x)
+    end
+end
+
+def fun_l11_n280(x)
+    if (x < 1)
+        fun_l12_n603(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n281(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n380(x)
+    end
+end
+
+def fun_l11_n282(x)
+    if (x < 1)
+        fun_l12_n699(x)
+    else
+        fun_l12_n199(x)
+    end
+end
+
+def fun_l11_n283(x)
+    if (x < 1)
+        fun_l12_n422(x)
+    else
+        fun_l12_n258(x)
+    end
+end
+
+def fun_l11_n284(x)
+    if (x < 1)
+        fun_l12_n255(x)
+    else
+        fun_l12_n752(x)
+    end
+end
+
+def fun_l11_n285(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n801(x)
+    end
+end
+
+def fun_l11_n286(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n287(x)
+    if (x < 1)
+        fun_l12_n547(x)
+    else
+        fun_l12_n74(x)
+    end
+end
+
+def fun_l11_n288(x)
+    if (x < 1)
+        fun_l12_n923(x)
+    else
+        fun_l12_n135(x)
+    end
+end
+
+def fun_l11_n289(x)
+    if (x < 1)
+        fun_l12_n78(x)
+    else
+        fun_l12_n704(x)
+    end
+end
+
+def fun_l11_n290(x)
+    if (x < 1)
+        fun_l12_n771(x)
+    else
+        fun_l12_n915(x)
+    end
+end
+
+def fun_l11_n291(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n188(x)
+    end
+end
+
+def fun_l11_n292(x)
+    if (x < 1)
+        fun_l12_n736(x)
+    else
+        fun_l12_n190(x)
+    end
+end
+
+def fun_l11_n293(x)
+    if (x < 1)
+        fun_l12_n301(x)
+    else
+        fun_l12_n745(x)
+    end
+end
+
+def fun_l11_n294(x)
+    if (x < 1)
+        fun_l12_n525(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n295(x)
+    if (x < 1)
+        fun_l12_n339(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n296(x)
+    if (x < 1)
+        fun_l12_n491(x)
+    else
+        fun_l12_n601(x)
+    end
+end
+
+def fun_l11_n297(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n361(x)
+    end
+end
+
+def fun_l11_n298(x)
+    if (x < 1)
+        fun_l12_n617(x)
+    else
+        fun_l12_n346(x)
+    end
+end
+
+def fun_l11_n299(x)
+    if (x < 1)
+        fun_l12_n578(x)
+    else
+        fun_l12_n147(x)
+    end
+end
+
+def fun_l11_n300(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n301(x)
+    if (x < 1)
+        fun_l12_n398(x)
+    else
+        fun_l12_n749(x)
+    end
+end
+
+def fun_l11_n302(x)
+    if (x < 1)
+        fun_l12_n871(x)
+    else
+        fun_l12_n745(x)
+    end
+end
+
+def fun_l11_n303(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n304(x)
+    if (x < 1)
+        fun_l12_n202(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n305(x)
+    if (x < 1)
+        fun_l12_n975(x)
+    else
+        fun_l12_n859(x)
+    end
+end
+
+def fun_l11_n306(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n433(x)
+    end
+end
+
+def fun_l11_n307(x)
+    if (x < 1)
+        fun_l12_n760(x)
+    else
+        fun_l12_n4(x)
+    end
+end
+
+def fun_l11_n308(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n276(x)
+    end
+end
+
+def fun_l11_n309(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n741(x)
+    end
+end
+
+def fun_l11_n310(x)
+    if (x < 1)
+        fun_l12_n231(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n311(x)
+    if (x < 1)
+        fun_l12_n90(x)
+    else
+        fun_l12_n46(x)
+    end
+end
+
+def fun_l11_n312(x)
+    if (x < 1)
+        fun_l12_n101(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n313(x)
+    if (x < 1)
+        fun_l12_n415(x)
+    else
+        fun_l12_n535(x)
+    end
+end
+
+def fun_l11_n314(x)
+    if (x < 1)
+        fun_l12_n550(x)
+    else
+        fun_l12_n305(x)
+    end
+end
+
+def fun_l11_n315(x)
+    if (x < 1)
+        fun_l12_n971(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n316(x)
+    if (x < 1)
+        fun_l12_n942(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n317(x)
+    if (x < 1)
+        fun_l12_n771(x)
+    else
+        fun_l12_n383(x)
+    end
+end
+
+def fun_l11_n318(x)
+    if (x < 1)
+        fun_l12_n846(x)
+    else
+        fun_l12_n504(x)
+    end
+end
+
+def fun_l11_n319(x)
+    if (x < 1)
+        fun_l12_n28(x)
+    else
+        fun_l12_n174(x)
+    end
+end
+
+def fun_l11_n320(x)
+    if (x < 1)
+        fun_l12_n437(x)
+    else
+        fun_l12_n355(x)
+    end
+end
+
+def fun_l11_n321(x)
+    if (x < 1)
+        fun_l12_n954(x)
+    else
+        fun_l12_n78(x)
+    end
+end
+
+def fun_l11_n322(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n323(x)
+    if (x < 1)
+        fun_l12_n41(x)
+    else
+        fun_l12_n88(x)
+    end
+end
+
+def fun_l11_n324(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n325(x)
+    if (x < 1)
+        fun_l12_n143(x)
+    else
+        fun_l12_n506(x)
+    end
+end
+
+def fun_l11_n326(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n968(x)
+    end
+end
+
+def fun_l11_n327(x)
+    if (x < 1)
+        fun_l12_n235(x)
+    else
+        fun_l12_n246(x)
+    end
+end
+
+def fun_l11_n328(x)
+    if (x < 1)
+        fun_l12_n85(x)
+    else
+        fun_l12_n125(x)
+    end
+end
+
+def fun_l11_n329(x)
+    if (x < 1)
+        fun_l12_n877(x)
+    else
+        fun_l12_n193(x)
+    end
+end
+
+def fun_l11_n330(x)
+    if (x < 1)
+        fun_l12_n678(x)
+    else
+        fun_l12_n147(x)
+    end
+end
+
+def fun_l11_n331(x)
+    if (x < 1)
+        fun_l12_n402(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n332(x)
+    if (x < 1)
+        fun_l12_n390(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n333(x)
+    if (x < 1)
+        fun_l12_n299(x)
+    else
+        fun_l12_n122(x)
+    end
+end
+
+def fun_l11_n334(x)
+    if (x < 1)
+        fun_l12_n398(x)
+    else
+        fun_l12_n886(x)
+    end
+end
+
+def fun_l11_n335(x)
+    if (x < 1)
+        fun_l12_n128(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n336(x)
+    if (x < 1)
+        fun_l12_n611(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n337(x)
+    if (x < 1)
+        fun_l12_n327(x)
+    else
+        fun_l12_n442(x)
+    end
+end
+
+def fun_l11_n338(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n259(x)
+    end
+end
+
+def fun_l11_n339(x)
+    if (x < 1)
+        fun_l12_n173(x)
+    else
+        fun_l12_n846(x)
+    end
+end
+
+def fun_l11_n340(x)
+    if (x < 1)
+        fun_l12_n579(x)
+    else
+        fun_l12_n869(x)
+    end
+end
+
+def fun_l11_n341(x)
+    if (x < 1)
+        fun_l12_n336(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n342(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n317(x)
+    end
+end
+
+def fun_l11_n343(x)
+    if (x < 1)
+        fun_l12_n560(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n344(x)
+    if (x < 1)
+        fun_l12_n232(x)
+    else
+        fun_l12_n447(x)
+    end
+end
+
+def fun_l11_n345(x)
+    if (x < 1)
+        fun_l12_n712(x)
+    else
+        fun_l12_n205(x)
+    end
+end
+
+def fun_l11_n346(x)
+    if (x < 1)
+        fun_l12_n102(x)
+    else
+        fun_l12_n785(x)
+    end
+end
+
+def fun_l11_n347(x)
+    if (x < 1)
+        fun_l12_n545(x)
+    else
+        fun_l12_n186(x)
+    end
+end
+
+def fun_l11_n348(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n349(x)
+    if (x < 1)
+        fun_l12_n428(x)
+    else
+        fun_l12_n295(x)
+    end
+end
+
+def fun_l11_n350(x)
+    if (x < 1)
+        fun_l12_n855(x)
+    else
+        fun_l12_n232(x)
+    end
+end
+
+def fun_l11_n351(x)
+    if (x < 1)
+        fun_l12_n759(x)
+    else
+        fun_l12_n13(x)
+    end
+end
+
+def fun_l11_n352(x)
+    if (x < 1)
+        fun_l12_n366(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n353(x)
+    if (x < 1)
+        fun_l12_n814(x)
+    else
+        fun_l12_n101(x)
+    end
+end
+
+def fun_l11_n354(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n509(x)
+    end
+end
+
+def fun_l11_n355(x)
+    if (x < 1)
+        fun_l12_n619(x)
+    else
+        fun_l12_n531(x)
+    end
+end
+
+def fun_l11_n356(x)
+    if (x < 1)
+        fun_l12_n142(x)
+    else
+        fun_l12_n586(x)
+    end
+end
+
+def fun_l11_n357(x)
+    if (x < 1)
+        fun_l12_n772(x)
+    else
+        fun_l12_n714(x)
+    end
+end
+
+def fun_l11_n358(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n405(x)
+    end
+end
+
+def fun_l11_n359(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n360(x)
+    if (x < 1)
+        fun_l12_n156(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n361(x)
+    if (x < 1)
+        fun_l12_n525(x)
+    else
+        fun_l12_n293(x)
+    end
+end
+
+def fun_l11_n362(x)
+    if (x < 1)
+        fun_l12_n396(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n363(x)
+    if (x < 1)
+        fun_l12_n153(x)
+    else
+        fun_l12_n831(x)
+    end
+end
+
+def fun_l11_n364(x)
+    if (x < 1)
+        fun_l12_n240(x)
+    else
+        fun_l12_n450(x)
+    end
+end
+
+def fun_l11_n365(x)
+    if (x < 1)
+        fun_l12_n514(x)
+    else
+        fun_l12_n312(x)
+    end
+end
+
+def fun_l11_n366(x)
+    if (x < 1)
+        fun_l12_n456(x)
+    else
+        fun_l12_n221(x)
+    end
+end
+
+def fun_l11_n367(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n699(x)
+    end
+end
+
+def fun_l11_n368(x)
+    if (x < 1)
+        fun_l12_n738(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n369(x)
+    if (x < 1)
+        fun_l12_n13(x)
+    else
+        fun_l12_n812(x)
+    end
+end
+
+def fun_l11_n370(x)
+    if (x < 1)
+        fun_l12_n392(x)
+    else
+        fun_l12_n342(x)
+    end
+end
+
+def fun_l11_n371(x)
+    if (x < 1)
+        fun_l12_n470(x)
+    else
+        fun_l12_n623(x)
+    end
+end
+
+def fun_l11_n372(x)
+    if (x < 1)
+        fun_l12_n26(x)
+    else
+        fun_l12_n138(x)
+    end
+end
+
+def fun_l11_n373(x)
+    if (x < 1)
+        fun_l12_n70(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n374(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n900(x)
+    end
+end
+
+def fun_l11_n375(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n848(x)
+    end
+end
+
+def fun_l11_n376(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n377(x)
+    if (x < 1)
+        fun_l12_n469(x)
+    else
+        fun_l12_n868(x)
+    end
+end
+
+def fun_l11_n378(x)
+    if (x < 1)
+        fun_l12_n241(x)
+    else
+        fun_l12_n571(x)
+    end
+end
+
+def fun_l11_n379(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n75(x)
+    end
+end
+
+def fun_l11_n380(x)
+    if (x < 1)
+        fun_l12_n587(x)
+    else
+        fun_l12_n454(x)
+    end
+end
+
+def fun_l11_n381(x)
+    if (x < 1)
+        fun_l12_n210(x)
+    else
+        fun_l12_n512(x)
+    end
+end
+
+def fun_l11_n382(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n981(x)
+    end
+end
+
+def fun_l11_n383(x)
+    if (x < 1)
+        fun_l12_n59(x)
+    else
+        fun_l12_n274(x)
+    end
+end
+
+def fun_l11_n384(x)
+    if (x < 1)
+        fun_l12_n242(x)
+    else
+        fun_l12_n631(x)
+    end
+end
+
+def fun_l11_n385(x)
+    if (x < 1)
+        fun_l12_n933(x)
+    else
+        fun_l12_n678(x)
+    end
+end
+
+def fun_l11_n386(x)
+    if (x < 1)
+        fun_l12_n695(x)
+    else
+        fun_l12_n766(x)
+    end
+end
+
+def fun_l11_n387(x)
+    if (x < 1)
+        fun_l12_n49(x)
+    else
+        fun_l12_n459(x)
+    end
+end
+
+def fun_l11_n388(x)
+    if (x < 1)
+        fun_l12_n751(x)
+    else
+        fun_l12_n594(x)
+    end
+end
+
+def fun_l11_n389(x)
+    if (x < 1)
+        fun_l12_n149(x)
+    else
+        fun_l12_n290(x)
+    end
+end
+
+def fun_l11_n390(x)
+    if (x < 1)
+        fun_l12_n307(x)
+    else
+        fun_l12_n723(x)
+    end
+end
+
+def fun_l11_n391(x)
+    if (x < 1)
+        fun_l12_n606(x)
+    else
+        fun_l12_n97(x)
+    end
+end
+
+def fun_l11_n392(x)
+    if (x < 1)
+        fun_l12_n31(x)
+    else
+        fun_l12_n610(x)
+    end
+end
+
+def fun_l11_n393(x)
+    if (x < 1)
+        fun_l12_n798(x)
+    else
+        fun_l12_n940(x)
+    end
+end
+
+def fun_l11_n394(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n79(x)
+    end
+end
+
+def fun_l11_n395(x)
+    if (x < 1)
+        fun_l12_n230(x)
+    else
+        fun_l12_n72(x)
+    end
+end
+
+def fun_l11_n396(x)
+    if (x < 1)
+        fun_l12_n506(x)
+    else
+        fun_l12_n433(x)
+    end
+end
+
+def fun_l11_n397(x)
+    if (x < 1)
+        fun_l12_n410(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n398(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n630(x)
+    end
+end
+
+def fun_l11_n399(x)
+    if (x < 1)
+        fun_l12_n394(x)
+    else
+        fun_l12_n220(x)
+    end
+end
+
+def fun_l11_n400(x)
+    if (x < 1)
+        fun_l12_n761(x)
+    else
+        fun_l12_n407(x)
+    end
+end
+
+def fun_l11_n401(x)
+    if (x < 1)
+        fun_l12_n386(x)
+    else
+        fun_l12_n411(x)
+    end
+end
+
+def fun_l11_n402(x)
+    if (x < 1)
+        fun_l12_n290(x)
+    else
+        fun_l12_n334(x)
+    end
+end
+
+def fun_l11_n403(x)
+    if (x < 1)
+        fun_l12_n600(x)
+    else
+        fun_l12_n282(x)
+    end
+end
+
+def fun_l11_n404(x)
+    if (x < 1)
+        fun_l12_n334(x)
+    else
+        fun_l12_n214(x)
+    end
+end
+
+def fun_l11_n405(x)
+    if (x < 1)
+        fun_l12_n103(x)
+    else
+        fun_l12_n188(x)
+    end
+end
+
+def fun_l11_n406(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n407(x)
+    if (x < 1)
+        fun_l12_n269(x)
+    else
+        fun_l12_n579(x)
+    end
+end
+
+def fun_l11_n408(x)
+    if (x < 1)
+        fun_l12_n54(x)
+    else
+        fun_l12_n961(x)
+    end
+end
+
+def fun_l11_n409(x)
+    if (x < 1)
+        fun_l12_n699(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n410(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n411(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n676(x)
+    end
+end
+
+def fun_l11_n412(x)
+    if (x < 1)
+        fun_l12_n520(x)
+    else
+        fun_l12_n447(x)
+    end
+end
+
+def fun_l11_n413(x)
+    if (x < 1)
+        fun_l12_n856(x)
+    else
+        fun_l12_n285(x)
+    end
+end
+
+def fun_l11_n414(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n590(x)
+    end
+end
+
+def fun_l11_n415(x)
+    if (x < 1)
+        fun_l12_n128(x)
+    else
+        fun_l12_n677(x)
+    end
+end
+
+def fun_l11_n416(x)
+    if (x < 1)
+        fun_l12_n422(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n417(x)
+    if (x < 1)
+        fun_l12_n159(x)
+    else
+        fun_l12_n722(x)
+    end
+end
+
+def fun_l11_n418(x)
+    if (x < 1)
+        fun_l12_n989(x)
+    else
+        fun_l12_n670(x)
+    end
+end
+
+def fun_l11_n419(x)
+    if (x < 1)
+        fun_l12_n952(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n420(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n493(x)
+    end
+end
+
+def fun_l11_n421(x)
+    if (x < 1)
+        fun_l12_n897(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n422(x)
+    if (x < 1)
+        fun_l12_n557(x)
+    else
+        fun_l12_n545(x)
+    end
+end
+
+def fun_l11_n423(x)
+    if (x < 1)
+        fun_l12_n716(x)
+    else
+        fun_l12_n746(x)
+    end
+end
+
+def fun_l11_n424(x)
+    if (x < 1)
+        fun_l12_n335(x)
+    else
+        fun_l12_n968(x)
+    end
+end
+
+def fun_l11_n425(x)
+    if (x < 1)
+        fun_l12_n891(x)
+    else
+        fun_l12_n115(x)
+    end
+end
+
+def fun_l11_n426(x)
+    if (x < 1)
+        fun_l12_n757(x)
+    else
+        fun_l12_n750(x)
+    end
+end
+
+def fun_l11_n427(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n428(x)
+    if (x < 1)
+        fun_l12_n249(x)
+    else
+        fun_l12_n347(x)
+    end
+end
+
+def fun_l11_n429(x)
+    if (x < 1)
+        fun_l12_n234(x)
+    else
+        fun_l12_n154(x)
+    end
+end
+
+def fun_l11_n430(x)
+    if (x < 1)
+        fun_l12_n890(x)
+    else
+        fun_l12_n40(x)
+    end
+end
+
+def fun_l11_n431(x)
+    if (x < 1)
+        fun_l12_n804(x)
+    else
+        fun_l12_n90(x)
+    end
+end
+
+def fun_l11_n432(x)
+    if (x < 1)
+        fun_l12_n936(x)
+    else
+        fun_l12_n127(x)
+    end
+end
+
+def fun_l11_n433(x)
+    if (x < 1)
+        fun_l12_n551(x)
+    else
+        fun_l12_n404(x)
+    end
+end
+
+def fun_l11_n434(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n759(x)
+    end
+end
+
+def fun_l11_n435(x)
+    if (x < 1)
+        fun_l12_n708(x)
+    else
+        fun_l12_n735(x)
+    end
+end
+
+def fun_l11_n436(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n785(x)
+    end
+end
+
+def fun_l11_n437(x)
+    if (x < 1)
+        fun_l12_n322(x)
+    else
+        fun_l12_n629(x)
+    end
+end
+
+def fun_l11_n438(x)
+    if (x < 1)
+        fun_l12_n986(x)
+    else
+        fun_l12_n899(x)
+    end
+end
+
+def fun_l11_n439(x)
+    if (x < 1)
+        fun_l12_n147(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n440(x)
+    if (x < 1)
+        fun_l12_n375(x)
+    else
+        fun_l12_n667(x)
+    end
+end
+
+def fun_l11_n441(x)
+    if (x < 1)
+        fun_l12_n467(x)
+    else
+        fun_l12_n994(x)
+    end
+end
+
+def fun_l11_n442(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n558(x)
+    end
+end
+
+def fun_l11_n443(x)
+    if (x < 1)
+        fun_l12_n452(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n444(x)
+    if (x < 1)
+        fun_l12_n701(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n445(x)
+    if (x < 1)
+        fun_l12_n881(x)
+    else
+        fun_l12_n896(x)
+    end
+end
+
+def fun_l11_n446(x)
+    if (x < 1)
+        fun_l12_n901(x)
+    else
+        fun_l12_n822(x)
+    end
+end
+
+def fun_l11_n447(x)
+    if (x < 1)
+        fun_l12_n6(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n448(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n449(x)
+    if (x < 1)
+        fun_l12_n675(x)
+    else
+        fun_l12_n379(x)
+    end
+end
+
+def fun_l11_n450(x)
+    if (x < 1)
+        fun_l12_n254(x)
+    else
+        fun_l12_n475(x)
+    end
+end
+
+def fun_l11_n451(x)
+    if (x < 1)
+        fun_l12_n951(x)
+    else
+        fun_l12_n947(x)
+    end
+end
+
+def fun_l11_n452(x)
+    if (x < 1)
+        fun_l12_n909(x)
+    else
+        fun_l12_n703(x)
+    end
+end
+
+def fun_l11_n453(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n862(x)
+    end
+end
+
+def fun_l11_n454(x)
+    if (x < 1)
+        fun_l12_n379(x)
+    else
+        fun_l12_n852(x)
+    end
+end
+
+def fun_l11_n455(x)
+    if (x < 1)
+        fun_l12_n85(x)
+    else
+        fun_l12_n219(x)
+    end
+end
+
+def fun_l11_n456(x)
+    if (x < 1)
+        fun_l12_n84(x)
+    else
+        fun_l12_n678(x)
+    end
+end
+
+def fun_l11_n457(x)
+    if (x < 1)
+        fun_l12_n663(x)
+    else
+        fun_l12_n637(x)
+    end
+end
+
+def fun_l11_n458(x)
+    if (x < 1)
+        fun_l12_n627(x)
+    else
+        fun_l12_n764(x)
+    end
+end
+
+def fun_l11_n459(x)
+    if (x < 1)
+        fun_l12_n3(x)
+    else
+        fun_l12_n419(x)
+    end
+end
+
+def fun_l11_n460(x)
+    if (x < 1)
+        fun_l12_n69(x)
+    else
+        fun_l12_n802(x)
+    end
+end
+
+def fun_l11_n461(x)
+    if (x < 1)
+        fun_l12_n708(x)
+    else
+        fun_l12_n304(x)
+    end
+end
+
+def fun_l11_n462(x)
+    if (x < 1)
+        fun_l12_n323(x)
+    else
+        fun_l12_n92(x)
+    end
+end
+
+def fun_l11_n463(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n434(x)
+    end
+end
+
+def fun_l11_n464(x)
+    if (x < 1)
+        fun_l12_n532(x)
+    else
+        fun_l12_n82(x)
+    end
+end
+
+def fun_l11_n465(x)
+    if (x < 1)
+        fun_l12_n664(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n466(x)
+    if (x < 1)
+        fun_l12_n488(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n467(x)
+    if (x < 1)
+        fun_l12_n882(x)
+    else
+        fun_l12_n948(x)
+    end
+end
+
+def fun_l11_n468(x)
+    if (x < 1)
+        fun_l12_n585(x)
+    else
+        fun_l12_n528(x)
+    end
+end
+
+def fun_l11_n469(x)
+    if (x < 1)
+        fun_l12_n318(x)
+    else
+        fun_l12_n233(x)
+    end
+end
+
+def fun_l11_n470(x)
+    if (x < 1)
+        fun_l12_n537(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n471(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n298(x)
+    end
+end
+
+def fun_l11_n472(x)
+    if (x < 1)
+        fun_l12_n266(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n473(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n713(x)
+    end
+end
+
+def fun_l11_n474(x)
+    if (x < 1)
+        fun_l12_n352(x)
+    else
+        fun_l12_n12(x)
+    end
+end
+
+def fun_l11_n475(x)
+    if (x < 1)
+        fun_l12_n23(x)
+    else
+        fun_l12_n715(x)
+    end
+end
+
+def fun_l11_n476(x)
+    if (x < 1)
+        fun_l12_n342(x)
+    else
+        fun_l12_n323(x)
+    end
+end
+
+def fun_l11_n477(x)
+    if (x < 1)
+        fun_l12_n563(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n478(x)
+    if (x < 1)
+        fun_l12_n313(x)
+    else
+        fun_l12_n489(x)
+    end
+end
+
+def fun_l11_n479(x)
+    if (x < 1)
+        fun_l12_n75(x)
+    else
+        fun_l12_n291(x)
+    end
+end
+
+def fun_l11_n480(x)
+    if (x < 1)
+        fun_l12_n693(x)
+    else
+        fun_l12_n991(x)
+    end
+end
+
+def fun_l11_n481(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n664(x)
+    end
+end
+
+def fun_l11_n482(x)
+    if (x < 1)
+        fun_l12_n524(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n483(x)
+    if (x < 1)
+        fun_l12_n712(x)
+    else
+        fun_l12_n289(x)
+    end
+end
+
+def fun_l11_n484(x)
+    if (x < 1)
+        fun_l12_n435(x)
+    else
+        fun_l12_n163(x)
+    end
+end
+
+def fun_l11_n485(x)
+    if (x < 1)
+        fun_l12_n338(x)
+    else
+        fun_l12_n883(x)
+    end
+end
+
+def fun_l11_n486(x)
+    if (x < 1)
+        fun_l12_n958(x)
+    else
+        fun_l12_n143(x)
+    end
+end
+
+def fun_l11_n487(x)
+    if (x < 1)
+        fun_l12_n22(x)
+    else
+        fun_l12_n674(x)
+    end
+end
+
+def fun_l11_n488(x)
+    if (x < 1)
+        fun_l12_n905(x)
+    else
+        fun_l12_n955(x)
+    end
+end
+
+def fun_l11_n489(x)
+    if (x < 1)
+        fun_l12_n590(x)
+    else
+        fun_l12_n623(x)
+    end
+end
+
+def fun_l11_n490(x)
+    if (x < 1)
+        fun_l12_n434(x)
+    else
+        fun_l12_n793(x)
+    end
+end
+
+def fun_l11_n491(x)
+    if (x < 1)
+        fun_l12_n274(x)
+    else
+        fun_l12_n879(x)
+    end
+end
+
+def fun_l11_n492(x)
+    if (x < 1)
+        fun_l12_n639(x)
+    else
+        fun_l12_n915(x)
+    end
+end
+
+def fun_l11_n493(x)
+    if (x < 1)
+        fun_l12_n547(x)
+    else
+        fun_l12_n87(x)
+    end
+end
+
+def fun_l11_n494(x)
+    if (x < 1)
+        fun_l12_n364(x)
+    else
+        fun_l12_n133(x)
+    end
+end
+
+def fun_l11_n495(x)
+    if (x < 1)
+        fun_l12_n568(x)
+    else
+        fun_l12_n449(x)
+    end
+end
+
+def fun_l11_n496(x)
+    if (x < 1)
+        fun_l12_n751(x)
+    else
+        fun_l12_n580(x)
+    end
+end
+
+def fun_l11_n497(x)
+    if (x < 1)
+        fun_l12_n864(x)
+    else
+        fun_l12_n505(x)
+    end
+end
+
+def fun_l11_n498(x)
+    if (x < 1)
+        fun_l12_n68(x)
+    else
+        fun_l12_n280(x)
+    end
+end
+
+def fun_l11_n499(x)
+    if (x < 1)
+        fun_l12_n821(x)
+    else
+        fun_l12_n816(x)
+    end
+end
+
+def fun_l11_n500(x)
+    if (x < 1)
+        fun_l12_n793(x)
+    else
+        fun_l12_n558(x)
+    end
+end
+
+def fun_l11_n501(x)
+    if (x < 1)
+        fun_l12_n460(x)
+    else
+        fun_l12_n358(x)
+    end
+end
+
+def fun_l11_n502(x)
+    if (x < 1)
+        fun_l12_n99(x)
+    else
+        fun_l12_n149(x)
+    end
+end
+
+def fun_l11_n503(x)
+    if (x < 1)
+        fun_l12_n599(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n504(x)
+    if (x < 1)
+        fun_l12_n853(x)
+    else
+        fun_l12_n477(x)
+    end
+end
+
+def fun_l11_n505(x)
+    if (x < 1)
+        fun_l12_n845(x)
+    else
+        fun_l12_n776(x)
+    end
+end
+
+def fun_l11_n506(x)
+    if (x < 1)
+        fun_l12_n533(x)
+    else
+        fun_l12_n6(x)
+    end
+end
+
+def fun_l11_n507(x)
+    if (x < 1)
+        fun_l12_n700(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n508(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n261(x)
+    end
+end
+
+def fun_l11_n509(x)
+    if (x < 1)
+        fun_l12_n773(x)
+    else
+        fun_l12_n583(x)
+    end
+end
+
+def fun_l11_n510(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n215(x)
+    end
+end
+
+def fun_l11_n511(x)
+    if (x < 1)
+        fun_l12_n280(x)
+    else
+        fun_l12_n589(x)
+    end
+end
+
+def fun_l11_n512(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n513(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n606(x)
+    end
+end
+
+def fun_l11_n514(x)
+    if (x < 1)
+        fun_l12_n509(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n515(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n912(x)
+    end
+end
+
+def fun_l11_n516(x)
+    if (x < 1)
+        fun_l12_n181(x)
+    else
+        fun_l12_n724(x)
+    end
+end
+
+def fun_l11_n517(x)
+    if (x < 1)
+        fun_l12_n167(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n518(x)
+    if (x < 1)
+        fun_l12_n654(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n519(x)
+    if (x < 1)
+        fun_l12_n192(x)
+    else
+        fun_l12_n110(x)
+    end
+end
+
+def fun_l11_n520(x)
+    if (x < 1)
+        fun_l12_n271(x)
+    else
+        fun_l12_n74(x)
+    end
+end
+
+def fun_l11_n521(x)
+    if (x < 1)
+        fun_l12_n324(x)
+    else
+        fun_l12_n224(x)
+    end
+end
+
+def fun_l11_n522(x)
+    if (x < 1)
+        fun_l12_n535(x)
+    else
+        fun_l12_n537(x)
+    end
+end
+
+def fun_l11_n523(x)
+    if (x < 1)
+        fun_l12_n103(x)
+    else
+        fun_l12_n942(x)
+    end
+end
+
+def fun_l11_n524(x)
+    if (x < 1)
+        fun_l12_n755(x)
+    else
+        fun_l12_n431(x)
+    end
+end
+
+def fun_l11_n525(x)
+    if (x < 1)
+        fun_l12_n243(x)
+    else
+        fun_l12_n131(x)
+    end
+end
+
+def fun_l11_n526(x)
+    if (x < 1)
+        fun_l12_n270(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n527(x)
+    if (x < 1)
+        fun_l12_n566(x)
+    else
+        fun_l12_n284(x)
+    end
+end
+
+def fun_l11_n528(x)
+    if (x < 1)
+        fun_l12_n510(x)
+    else
+        fun_l12_n928(x)
+    end
+end
+
+def fun_l11_n529(x)
+    if (x < 1)
+        fun_l12_n354(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n530(x)
+    if (x < 1)
+        fun_l12_n271(x)
+    else
+        fun_l12_n875(x)
+    end
+end
+
+def fun_l11_n531(x)
+    if (x < 1)
+        fun_l12_n871(x)
+    else
+        fun_l12_n441(x)
+    end
+end
+
+def fun_l11_n532(x)
+    if (x < 1)
+        fun_l12_n727(x)
+    else
+        fun_l12_n903(x)
+    end
+end
+
+def fun_l11_n533(x)
+    if (x < 1)
+        fun_l12_n843(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n534(x)
+    if (x < 1)
+        fun_l12_n798(x)
+    else
+        fun_l12_n309(x)
+    end
+end
+
+def fun_l11_n535(x)
+    if (x < 1)
+        fun_l12_n397(x)
+    else
+        fun_l12_n377(x)
+    end
+end
+
+def fun_l11_n536(x)
+    if (x < 1)
+        fun_l12_n441(x)
+    else
+        fun_l12_n253(x)
+    end
+end
+
+def fun_l11_n537(x)
+    if (x < 1)
+        fun_l12_n861(x)
+    else
+        fun_l12_n84(x)
+    end
+end
+
+def fun_l11_n538(x)
+    if (x < 1)
+        fun_l12_n268(x)
+    else
+        fun_l12_n627(x)
+    end
+end
+
+def fun_l11_n539(x)
+    if (x < 1)
+        fun_l12_n923(x)
+    else
+        fun_l12_n650(x)
+    end
+end
+
+def fun_l11_n540(x)
+    if (x < 1)
+        fun_l12_n503(x)
+    else
+        fun_l12_n598(x)
+    end
+end
+
+def fun_l11_n541(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n201(x)
+    end
+end
+
+def fun_l11_n542(x)
+    if (x < 1)
+        fun_l12_n956(x)
+    else
+        fun_l12_n789(x)
+    end
+end
+
+def fun_l11_n543(x)
+    if (x < 1)
+        fun_l12_n438(x)
+    else
+        fun_l12_n47(x)
+    end
+end
+
+def fun_l11_n544(x)
+    if (x < 1)
+        fun_l12_n425(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n545(x)
+    if (x < 1)
+        fun_l12_n540(x)
+    else
+        fun_l12_n360(x)
+    end
+end
+
+def fun_l11_n546(x)
+    if (x < 1)
+        fun_l12_n228(x)
+    else
+        fun_l12_n270(x)
+    end
+end
+
+def fun_l11_n547(x)
+    if (x < 1)
+        fun_l12_n528(x)
+    else
+        fun_l12_n423(x)
+    end
+end
+
+def fun_l11_n548(x)
+    if (x < 1)
+        fun_l12_n656(x)
+    else
+        fun_l12_n269(x)
+    end
+end
+
+def fun_l11_n549(x)
+    if (x < 1)
+        fun_l12_n541(x)
+    else
+        fun_l12_n488(x)
+    end
+end
+
+def fun_l11_n550(x)
+    if (x < 1)
+        fun_l12_n240(x)
+    else
+        fun_l12_n990(x)
+    end
+end
+
+def fun_l11_n551(x)
+    if (x < 1)
+        fun_l12_n279(x)
+    else
+        fun_l12_n61(x)
+    end
+end
+
+def fun_l11_n552(x)
+    if (x < 1)
+        fun_l12_n996(x)
+    else
+        fun_l12_n738(x)
+    end
+end
+
+def fun_l11_n553(x)
+    if (x < 1)
+        fun_l12_n334(x)
+    else
+        fun_l12_n117(x)
+    end
+end
+
+def fun_l11_n554(x)
+    if (x < 1)
+        fun_l12_n943(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n555(x)
+    if (x < 1)
+        fun_l12_n256(x)
+    else
+        fun_l12_n961(x)
+    end
+end
+
+def fun_l11_n556(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n378(x)
+    end
+end
+
+def fun_l11_n557(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n153(x)
+    end
+end
+
+def fun_l11_n558(x)
+    if (x < 1)
+        fun_l12_n145(x)
+    else
+        fun_l12_n951(x)
+    end
+end
+
+def fun_l11_n559(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n341(x)
+    end
+end
+
+def fun_l11_n560(x)
+    if (x < 1)
+        fun_l12_n570(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n561(x)
+    if (x < 1)
+        fun_l12_n351(x)
+    else
+        fun_l12_n664(x)
+    end
+end
+
+def fun_l11_n562(x)
+    if (x < 1)
+        fun_l12_n825(x)
+    else
+        fun_l12_n226(x)
+    end
+end
+
+def fun_l11_n563(x)
+    if (x < 1)
+        fun_l12_n898(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n564(x)
+    if (x < 1)
+        fun_l12_n122(x)
+    else
+        fun_l12_n618(x)
+    end
+end
+
+def fun_l11_n565(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n51(x)
+    end
+end
+
+def fun_l11_n566(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n567(x)
+    if (x < 1)
+        fun_l12_n471(x)
+    else
+        fun_l12_n28(x)
+    end
+end
+
+def fun_l11_n568(x)
+    if (x < 1)
+        fun_l12_n195(x)
+    else
+        fun_l12_n104(x)
+    end
+end
+
+def fun_l11_n569(x)
+    if (x < 1)
+        fun_l12_n556(x)
+    else
+        fun_l12_n242(x)
+    end
+end
+
+def fun_l11_n570(x)
+    if (x < 1)
+        fun_l12_n203(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n571(x)
+    if (x < 1)
+        fun_l12_n217(x)
+    else
+        fun_l12_n392(x)
+    end
+end
+
+def fun_l11_n572(x)
+    if (x < 1)
+        fun_l12_n223(x)
+    else
+        fun_l12_n176(x)
+    end
+end
+
+def fun_l11_n573(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n19(x)
+    end
+end
+
+def fun_l11_n574(x)
+    if (x < 1)
+        fun_l12_n799(x)
+    else
+        fun_l12_n652(x)
+    end
+end
+
+def fun_l11_n575(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n332(x)
+    end
+end
+
+def fun_l11_n576(x)
+    if (x < 1)
+        fun_l12_n928(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n577(x)
+    if (x < 1)
+        fun_l12_n796(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n578(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n985(x)
+    end
+end
+
+def fun_l11_n579(x)
+    if (x < 1)
+        fun_l12_n246(x)
+    else
+        fun_l12_n253(x)
+    end
+end
+
+def fun_l11_n580(x)
+    if (x < 1)
+        fun_l12_n492(x)
+    else
+        fun_l12_n239(x)
+    end
+end
+
+def fun_l11_n581(x)
+    if (x < 1)
+        fun_l12_n428(x)
+    else
+        fun_l12_n351(x)
+    end
+end
+
+def fun_l11_n582(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n37(x)
+    end
+end
+
+def fun_l11_n583(x)
+    if (x < 1)
+        fun_l12_n809(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n584(x)
+    if (x < 1)
+        fun_l12_n661(x)
+    else
+        fun_l12_n539(x)
+    end
+end
+
+def fun_l11_n585(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n190(x)
+    end
+end
+
+def fun_l11_n586(x)
+    if (x < 1)
+        fun_l12_n178(x)
+    else
+        fun_l12_n301(x)
+    end
+end
+
+def fun_l11_n587(x)
+    if (x < 1)
+        fun_l12_n316(x)
+    else
+        fun_l12_n731(x)
+    end
+end
+
+def fun_l11_n588(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n776(x)
+    end
+end
+
+def fun_l11_n589(x)
+    if (x < 1)
+        fun_l12_n273(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n590(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n622(x)
+    end
+end
+
+def fun_l11_n591(x)
+    if (x < 1)
+        fun_l12_n359(x)
+    else
+        fun_l12_n694(x)
+    end
+end
+
+def fun_l11_n592(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n984(x)
+    end
+end
+
+def fun_l11_n593(x)
+    if (x < 1)
+        fun_l12_n790(x)
+    else
+        fun_l12_n547(x)
+    end
+end
+
+def fun_l11_n594(x)
+    if (x < 1)
+        fun_l12_n313(x)
+    else
+        fun_l12_n526(x)
+    end
+end
+
+def fun_l11_n595(x)
+    if (x < 1)
+        fun_l12_n239(x)
+    else
+        fun_l12_n821(x)
+    end
+end
+
+def fun_l11_n596(x)
+    if (x < 1)
+        fun_l12_n36(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n597(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n65(x)
+    end
+end
+
+def fun_l11_n598(x)
+    if (x < 1)
+        fun_l12_n226(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n599(x)
+    if (x < 1)
+        fun_l12_n716(x)
+    else
+        fun_l12_n7(x)
+    end
+end
+
+def fun_l11_n600(x)
+    if (x < 1)
+        fun_l12_n694(x)
+    else
+        fun_l12_n663(x)
+    end
+end
+
+def fun_l11_n601(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n256(x)
+    end
+end
+
+def fun_l11_n602(x)
+    if (x < 1)
+        fun_l12_n251(x)
+    else
+        fun_l12_n177(x)
+    end
+end
+
+def fun_l11_n603(x)
+    if (x < 1)
+        fun_l12_n659(x)
+    else
+        fun_l12_n732(x)
+    end
+end
+
+def fun_l11_n604(x)
+    if (x < 1)
+        fun_l12_n440(x)
+    else
+        fun_l12_n334(x)
+    end
+end
+
+def fun_l11_n605(x)
+    if (x < 1)
+        fun_l12_n396(x)
+    else
+        fun_l12_n931(x)
+    end
+end
+
+def fun_l11_n606(x)
+    if (x < 1)
+        fun_l12_n687(x)
+    else
+        fun_l12_n88(x)
+    end
+end
+
+def fun_l11_n607(x)
+    if (x < 1)
+        fun_l12_n647(x)
+    else
+        fun_l12_n799(x)
+    end
+end
+
+def fun_l11_n608(x)
+    if (x < 1)
+        fun_l12_n383(x)
+    else
+        fun_l12_n889(x)
+    end
+end
+
+def fun_l11_n609(x)
+    if (x < 1)
+        fun_l12_n174(x)
+    else
+        fun_l12_n121(x)
+    end
+end
+
+def fun_l11_n610(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n835(x)
+    end
+end
+
+def fun_l11_n611(x)
+    if (x < 1)
+        fun_l12_n684(x)
+    else
+        fun_l12_n625(x)
+    end
+end
+
+def fun_l11_n612(x)
+    if (x < 1)
+        fun_l12_n961(x)
+    else
+        fun_l12_n711(x)
+    end
+end
+
+def fun_l11_n613(x)
+    if (x < 1)
+        fun_l12_n15(x)
+    else
+        fun_l12_n542(x)
+    end
+end
+
+def fun_l11_n614(x)
+    if (x < 1)
+        fun_l12_n378(x)
+    else
+        fun_l12_n809(x)
+    end
+end
+
+def fun_l11_n615(x)
+    if (x < 1)
+        fun_l12_n970(x)
+    else
+        fun_l12_n283(x)
+    end
+end
+
+def fun_l11_n616(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n949(x)
+    end
+end
+
+def fun_l11_n617(x)
+    if (x < 1)
+        fun_l12_n135(x)
+    else
+        fun_l12_n29(x)
+    end
+end
+
+def fun_l11_n618(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n834(x)
+    end
+end
+
+def fun_l11_n619(x)
+    if (x < 1)
+        fun_l12_n555(x)
+    else
+        fun_l12_n464(x)
+    end
+end
+
+def fun_l11_n620(x)
+    if (x < 1)
+        fun_l12_n414(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n621(x)
+    if (x < 1)
+        fun_l12_n964(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n622(x)
+    if (x < 1)
+        fun_l12_n184(x)
+    else
+        fun_l12_n499(x)
+    end
+end
+
+def fun_l11_n623(x)
+    if (x < 1)
+        fun_l12_n441(x)
+    else
+        fun_l12_n124(x)
+    end
+end
+
+def fun_l11_n624(x)
+    if (x < 1)
+        fun_l12_n884(x)
+    else
+        fun_l12_n484(x)
+    end
+end
+
+def fun_l11_n625(x)
+    if (x < 1)
+        fun_l12_n878(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n626(x)
+    if (x < 1)
+        fun_l12_n918(x)
+    else
+        fun_l12_n481(x)
+    end
+end
+
+def fun_l11_n627(x)
+    if (x < 1)
+        fun_l12_n162(x)
+    else
+        fun_l12_n197(x)
+    end
+end
+
+def fun_l11_n628(x)
+    if (x < 1)
+        fun_l12_n852(x)
+    else
+        fun_l12_n874(x)
+    end
+end
+
+def fun_l11_n629(x)
+    if (x < 1)
+        fun_l12_n654(x)
+    else
+        fun_l12_n709(x)
+    end
+end
+
+def fun_l11_n630(x)
+    if (x < 1)
+        fun_l12_n819(x)
+    else
+        fun_l12_n325(x)
+    end
+end
+
+def fun_l11_n631(x)
+    if (x < 1)
+        fun_l12_n776(x)
+    else
+        fun_l12_n621(x)
+    end
+end
+
+def fun_l11_n632(x)
+    if (x < 1)
+        fun_l12_n648(x)
+    else
+        fun_l12_n53(x)
+    end
+end
+
+def fun_l11_n633(x)
+    if (x < 1)
+        fun_l12_n182(x)
+    else
+        fun_l12_n267(x)
+    end
+end
+
+def fun_l11_n634(x)
+    if (x < 1)
+        fun_l12_n17(x)
+    else
+        fun_l12_n415(x)
+    end
+end
+
+def fun_l11_n635(x)
+    if (x < 1)
+        fun_l12_n123(x)
+    else
+        fun_l12_n862(x)
+    end
+end
+
+def fun_l11_n636(x)
+    if (x < 1)
+        fun_l12_n594(x)
+    else
+        fun_l12_n878(x)
+    end
+end
+
+def fun_l11_n637(x)
+    if (x < 1)
+        fun_l12_n913(x)
+    else
+        fun_l12_n245(x)
+    end
+end
+
+def fun_l11_n638(x)
+    if (x < 1)
+        fun_l12_n976(x)
+    else
+        fun_l12_n19(x)
+    end
+end
+
+def fun_l11_n639(x)
+    if (x < 1)
+        fun_l12_n490(x)
+    else
+        fun_l12_n999(x)
+    end
+end
+
+def fun_l11_n640(x)
+    if (x < 1)
+        fun_l12_n345(x)
+    else
+        fun_l12_n585(x)
+    end
+end
+
+def fun_l11_n641(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n566(x)
+    end
+end
+
+def fun_l11_n642(x)
+    if (x < 1)
+        fun_l12_n680(x)
+    else
+        fun_l12_n77(x)
+    end
+end
+
+def fun_l11_n643(x)
+    if (x < 1)
+        fun_l12_n330(x)
+    else
+        fun_l12_n268(x)
+    end
+end
+
+def fun_l11_n644(x)
+    if (x < 1)
+        fun_l12_n651(x)
+    else
+        fun_l12_n386(x)
+    end
+end
+
+def fun_l11_n645(x)
+    if (x < 1)
+        fun_l12_n276(x)
+    else
+        fun_l12_n471(x)
+    end
+end
+
+def fun_l11_n646(x)
+    if (x < 1)
+        fun_l12_n784(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n647(x)
+    if (x < 1)
+        fun_l12_n963(x)
+    else
+        fun_l12_n864(x)
+    end
+end
+
+def fun_l11_n648(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n649(x)
+    if (x < 1)
+        fun_l12_n321(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n650(x)
+    if (x < 1)
+        fun_l12_n598(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n651(x)
+    if (x < 1)
+        fun_l12_n201(x)
+    else
+        fun_l12_n760(x)
+    end
+end
+
+def fun_l11_n652(x)
+    if (x < 1)
+        fun_l12_n880(x)
+    else
+        fun_l12_n841(x)
+    end
+end
+
+def fun_l11_n653(x)
+    if (x < 1)
+        fun_l12_n61(x)
+    else
+        fun_l12_n403(x)
+    end
+end
+
+def fun_l11_n654(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n768(x)
+    end
+end
+
+def fun_l11_n655(x)
+    if (x < 1)
+        fun_l12_n511(x)
+    else
+        fun_l12_n521(x)
+    end
+end
+
+def fun_l11_n656(x)
+    if (x < 1)
+        fun_l12_n27(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n657(x)
+    if (x < 1)
+        fun_l12_n217(x)
+    else
+        fun_l12_n547(x)
+    end
+end
+
+def fun_l11_n658(x)
+    if (x < 1)
+        fun_l12_n549(x)
+    else
+        fun_l12_n823(x)
+    end
+end
+
+def fun_l11_n659(x)
+    if (x < 1)
+        fun_l12_n327(x)
+    else
+        fun_l12_n529(x)
+    end
+end
+
+def fun_l11_n660(x)
+    if (x < 1)
+        fun_l12_n395(x)
+    else
+        fun_l12_n797(x)
+    end
+end
+
+def fun_l11_n661(x)
+    if (x < 1)
+        fun_l12_n867(x)
+    else
+        fun_l12_n142(x)
+    end
+end
+
+def fun_l11_n662(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n663(x)
+    if (x < 1)
+        fun_l12_n628(x)
+    else
+        fun_l12_n798(x)
+    end
+end
+
+def fun_l11_n664(x)
+    if (x < 1)
+        fun_l12_n260(x)
+    else
+        fun_l12_n607(x)
+    end
+end
+
+def fun_l11_n665(x)
+    if (x < 1)
+        fun_l12_n911(x)
+    else
+        fun_l12_n487(x)
+    end
+end
+
+def fun_l11_n666(x)
+    if (x < 1)
+        fun_l12_n340(x)
+    else
+        fun_l12_n23(x)
+    end
+end
+
+def fun_l11_n667(x)
+    if (x < 1)
+        fun_l12_n744(x)
+    else
+        fun_l12_n874(x)
+    end
+end
+
+def fun_l11_n668(x)
+    if (x < 1)
+        fun_l12_n53(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n669(x)
+    if (x < 1)
+        fun_l12_n775(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n670(x)
+    if (x < 1)
+        fun_l12_n922(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n671(x)
+    if (x < 1)
+        fun_l12_n23(x)
+    else
+        fun_l12_n798(x)
+    end
+end
+
+def fun_l11_n672(x)
+    if (x < 1)
+        fun_l12_n453(x)
+    else
+        fun_l12_n667(x)
+    end
+end
+
+def fun_l11_n673(x)
+    if (x < 1)
+        fun_l12_n991(x)
+    else
+        fun_l12_n350(x)
+    end
+end
+
+def fun_l11_n674(x)
+    if (x < 1)
+        fun_l12_n865(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n675(x)
+    if (x < 1)
+        fun_l12_n404(x)
+    else
+        fun_l12_n714(x)
+    end
+end
+
+def fun_l11_n676(x)
+    if (x < 1)
+        fun_l12_n576(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n677(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n453(x)
+    end
+end
+
+def fun_l11_n678(x)
+    if (x < 1)
+        fun_l12_n127(x)
+    else
+        fun_l12_n224(x)
+    end
+end
+
+def fun_l11_n679(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n11(x)
+    end
+end
+
+def fun_l11_n680(x)
+    if (x < 1)
+        fun_l12_n778(x)
+    else
+        fun_l12_n202(x)
+    end
+end
+
+def fun_l11_n681(x)
+    if (x < 1)
+        fun_l12_n745(x)
+    else
+        fun_l12_n690(x)
+    end
+end
+
+def fun_l11_n682(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n683(x)
+    if (x < 1)
+        fun_l12_n726(x)
+    else
+        fun_l12_n466(x)
+    end
+end
+
+def fun_l11_n684(x)
+    if (x < 1)
+        fun_l12_n709(x)
+    else
+        fun_l12_n287(x)
+    end
+end
+
+def fun_l11_n685(x)
+    if (x < 1)
+        fun_l12_n304(x)
+    else
+        fun_l12_n617(x)
+    end
+end
+
+def fun_l11_n686(x)
+    if (x < 1)
+        fun_l12_n834(x)
+    else
+        fun_l12_n240(x)
+    end
+end
+
+def fun_l11_n687(x)
+    if (x < 1)
+        fun_l12_n406(x)
+    else
+        fun_l12_n588(x)
+    end
+end
+
+def fun_l11_n688(x)
+    if (x < 1)
+        fun_l12_n308(x)
+    else
+        fun_l12_n790(x)
+    end
+end
+
+def fun_l11_n689(x)
+    if (x < 1)
+        fun_l12_n969(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n690(x)
+    if (x < 1)
+        fun_l12_n760(x)
+    else
+        fun_l12_n807(x)
+    end
+end
+
+def fun_l11_n691(x)
+    if (x < 1)
+        fun_l12_n417(x)
+    else
+        fun_l12_n645(x)
+    end
+end
+
+def fun_l11_n692(x)
+    if (x < 1)
+        fun_l12_n722(x)
+    else
+        fun_l12_n614(x)
+    end
+end
+
+def fun_l11_n693(x)
+    if (x < 1)
+        fun_l12_n19(x)
+    else
+        fun_l12_n497(x)
+    end
+end
+
+def fun_l11_n694(x)
+    if (x < 1)
+        fun_l12_n580(x)
+    else
+        fun_l12_n76(x)
+    end
+end
+
+def fun_l11_n695(x)
+    if (x < 1)
+        fun_l12_n527(x)
+    else
+        fun_l12_n819(x)
+    end
+end
+
+def fun_l11_n696(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n906(x)
+    end
+end
+
+def fun_l11_n697(x)
+    if (x < 1)
+        fun_l12_n95(x)
+    else
+        fun_l12_n743(x)
+    end
+end
+
+def fun_l11_n698(x)
+    if (x < 1)
+        fun_l12_n544(x)
+    else
+        fun_l12_n265(x)
+    end
+end
+
+def fun_l11_n699(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n210(x)
+    end
+end
+
+def fun_l11_n700(x)
+    if (x < 1)
+        fun_l12_n865(x)
+    else
+        fun_l12_n318(x)
+    end
+end
+
+def fun_l11_n701(x)
+    if (x < 1)
+        fun_l12_n88(x)
+    else
+        fun_l12_n120(x)
+    end
+end
+
+def fun_l11_n702(x)
+    if (x < 1)
+        fun_l12_n165(x)
+    else
+        fun_l12_n671(x)
+    end
+end
+
+def fun_l11_n703(x)
+    if (x < 1)
+        fun_l12_n607(x)
+    else
+        fun_l12_n730(x)
+    end
+end
+
+def fun_l11_n704(x)
+    if (x < 1)
+        fun_l12_n690(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n705(x)
+    if (x < 1)
+        fun_l12_n826(x)
+    else
+        fun_l12_n665(x)
+    end
+end
+
+def fun_l11_n706(x)
+    if (x < 1)
+        fun_l12_n125(x)
+    else
+        fun_l12_n167(x)
+    end
+end
+
+def fun_l11_n707(x)
+    if (x < 1)
+        fun_l12_n961(x)
+    else
+        fun_l12_n73(x)
+    end
+end
+
+def fun_l11_n708(x)
+    if (x < 1)
+        fun_l12_n446(x)
+    else
+        fun_l12_n373(x)
+    end
+end
+
+def fun_l11_n709(x)
+    if (x < 1)
+        fun_l12_n199(x)
+    else
+        fun_l12_n803(x)
+    end
+end
+
+def fun_l11_n710(x)
+    if (x < 1)
+        fun_l12_n960(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n711(x)
+    if (x < 1)
+        fun_l12_n602(x)
+    else
+        fun_l12_n896(x)
+    end
+end
+
+def fun_l11_n712(x)
+    if (x < 1)
+        fun_l12_n198(x)
+    else
+        fun_l12_n857(x)
+    end
+end
+
+def fun_l11_n713(x)
+    if (x < 1)
+        fun_l12_n19(x)
+    else
+        fun_l12_n938(x)
+    end
+end
+
+def fun_l11_n714(x)
+    if (x < 1)
+        fun_l12_n530(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n715(x)
+    if (x < 1)
+        fun_l12_n99(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n716(x)
+    if (x < 1)
+        fun_l12_n623(x)
+    else
+        fun_l12_n461(x)
+    end
+end
+
+def fun_l11_n717(x)
+    if (x < 1)
+        fun_l12_n658(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n718(x)
+    if (x < 1)
+        fun_l12_n17(x)
+    else
+        fun_l12_n83(x)
+    end
+end
+
+def fun_l11_n719(x)
+    if (x < 1)
+        fun_l12_n439(x)
+    else
+        fun_l12_n747(x)
+    end
+end
+
+def fun_l11_n720(x)
+    if (x < 1)
+        fun_l12_n259(x)
+    else
+        fun_l12_n80(x)
+    end
+end
+
+def fun_l11_n721(x)
+    if (x < 1)
+        fun_l12_n749(x)
+    else
+        fun_l12_n108(x)
+    end
+end
+
+def fun_l11_n722(x)
+    if (x < 1)
+        fun_l12_n20(x)
+    else
+        fun_l12_n391(x)
+    end
+end
+
+def fun_l11_n723(x)
+    if (x < 1)
+        fun_l12_n181(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n724(x)
+    if (x < 1)
+        fun_l12_n426(x)
+    else
+        fun_l12_n109(x)
+    end
+end
+
+def fun_l11_n725(x)
+    if (x < 1)
+        fun_l12_n436(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n726(x)
+    if (x < 1)
+        fun_l12_n496(x)
+    else
+        fun_l12_n265(x)
+    end
+end
+
+def fun_l11_n727(x)
+    if (x < 1)
+        fun_l12_n58(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n728(x)
+    if (x < 1)
+        fun_l12_n236(x)
+    else
+        fun_l12_n152(x)
+    end
+end
+
+def fun_l11_n729(x)
+    if (x < 1)
+        fun_l12_n818(x)
+    else
+        fun_l12_n95(x)
+    end
+end
+
+def fun_l11_n730(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n263(x)
+    end
+end
+
+def fun_l11_n731(x)
+    if (x < 1)
+        fun_l12_n539(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n732(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n454(x)
+    end
+end
+
+def fun_l11_n733(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n877(x)
+    end
+end
+
+def fun_l11_n734(x)
+    if (x < 1)
+        fun_l12_n449(x)
+    else
+        fun_l12_n222(x)
+    end
+end
+
+def fun_l11_n735(x)
+    if (x < 1)
+        fun_l12_n71(x)
+    else
+        fun_l12_n467(x)
+    end
+end
+
+def fun_l11_n736(x)
+    if (x < 1)
+        fun_l12_n220(x)
+    else
+        fun_l12_n214(x)
+    end
+end
+
+def fun_l11_n737(x)
+    if (x < 1)
+        fun_l12_n537(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n738(x)
+    if (x < 1)
+        fun_l12_n897(x)
+    else
+        fun_l12_n515(x)
+    end
+end
+
+def fun_l11_n739(x)
+    if (x < 1)
+        fun_l12_n724(x)
+    else
+        fun_l12_n48(x)
+    end
+end
+
+def fun_l11_n740(x)
+    if (x < 1)
+        fun_l12_n61(x)
+    else
+        fun_l12_n963(x)
+    end
+end
+
+def fun_l11_n741(x)
+    if (x < 1)
+        fun_l12_n40(x)
+    else
+        fun_l12_n553(x)
+    end
+end
+
+def fun_l11_n742(x)
+    if (x < 1)
+        fun_l12_n361(x)
+    else
+        fun_l12_n975(x)
+    end
+end
+
+def fun_l11_n743(x)
+    if (x < 1)
+        fun_l12_n306(x)
+    else
+        fun_l12_n982(x)
+    end
+end
+
+def fun_l11_n744(x)
+    if (x < 1)
+        fun_l12_n951(x)
+    else
+        fun_l12_n590(x)
+    end
+end
+
+def fun_l11_n745(x)
+    if (x < 1)
+        fun_l12_n224(x)
+    else
+        fun_l12_n409(x)
+    end
+end
+
+def fun_l11_n746(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n747(x)
+    if (x < 1)
+        fun_l12_n533(x)
+    else
+        fun_l12_n543(x)
+    end
+end
+
+def fun_l11_n748(x)
+    if (x < 1)
+        fun_l12_n616(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n749(x)
+    if (x < 1)
+        fun_l12_n365(x)
+    else
+        fun_l12_n335(x)
+    end
+end
+
+def fun_l11_n750(x)
+    if (x < 1)
+        fun_l12_n134(x)
+    else
+        fun_l12_n363(x)
+    end
+end
+
+def fun_l11_n751(x)
+    if (x < 1)
+        fun_l12_n413(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n752(x)
+    if (x < 1)
+        fun_l12_n987(x)
+    else
+        fun_l12_n948(x)
+    end
+end
+
+def fun_l11_n753(x)
+    if (x < 1)
+        fun_l12_n696(x)
+    else
+        fun_l12_n374(x)
+    end
+end
+
+def fun_l11_n754(x)
+    if (x < 1)
+        fun_l12_n730(x)
+    else
+        fun_l12_n345(x)
+    end
+end
+
+def fun_l11_n755(x)
+    if (x < 1)
+        fun_l12_n857(x)
+    else
+        fun_l12_n441(x)
+    end
+end
+
+def fun_l11_n756(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n757(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n657(x)
+    end
+end
+
+def fun_l11_n758(x)
+    if (x < 1)
+        fun_l12_n470(x)
+    else
+        fun_l12_n650(x)
+    end
+end
+
+def fun_l11_n759(x)
+    if (x < 1)
+        fun_l12_n119(x)
+    else
+        fun_l12_n479(x)
+    end
+end
+
+def fun_l11_n760(x)
+    if (x < 1)
+        fun_l12_n429(x)
+    else
+        fun_l12_n922(x)
+    end
+end
+
+def fun_l11_n761(x)
+    if (x < 1)
+        fun_l12_n13(x)
+    else
+        fun_l12_n134(x)
+    end
+end
+
+def fun_l11_n762(x)
+    if (x < 1)
+        fun_l12_n797(x)
+    else
+        fun_l12_n223(x)
+    end
+end
+
+def fun_l11_n763(x)
+    if (x < 1)
+        fun_l12_n945(x)
+    else
+        fun_l12_n197(x)
+    end
+end
+
+def fun_l11_n764(x)
+    if (x < 1)
+        fun_l12_n612(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n765(x)
+    if (x < 1)
+        fun_l12_n478(x)
+    else
+        fun_l12_n972(x)
+    end
+end
+
+def fun_l11_n766(x)
+    if (x < 1)
+        fun_l12_n946(x)
+    else
+        fun_l12_n9(x)
+    end
+end
+
+def fun_l11_n767(x)
+    if (x < 1)
+        fun_l12_n247(x)
+    else
+        fun_l12_n730(x)
+    end
+end
+
+def fun_l11_n768(x)
+    if (x < 1)
+        fun_l12_n223(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n769(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n770(x)
+    if (x < 1)
+        fun_l12_n112(x)
+    else
+        fun_l12_n660(x)
+    end
+end
+
+def fun_l11_n771(x)
+    if (x < 1)
+        fun_l12_n457(x)
+    else
+        fun_l12_n733(x)
+    end
+end
+
+def fun_l11_n772(x)
+    if (x < 1)
+        fun_l12_n633(x)
+    else
+        fun_l12_n449(x)
+    end
+end
+
+def fun_l11_n773(x)
+    if (x < 1)
+        fun_l12_n910(x)
+    else
+        fun_l12_n329(x)
+    end
+end
+
+def fun_l11_n774(x)
+    if (x < 1)
+        fun_l12_n354(x)
+    else
+        fun_l12_n233(x)
+    end
+end
+
+def fun_l11_n775(x)
+    if (x < 1)
+        fun_l12_n887(x)
+    else
+        fun_l12_n100(x)
+    end
+end
+
+def fun_l11_n776(x)
+    if (x < 1)
+        fun_l12_n65(x)
+    else
+        fun_l12_n199(x)
+    end
+end
+
+def fun_l11_n777(x)
+    if (x < 1)
+        fun_l12_n978(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n778(x)
+    if (x < 1)
+        fun_l12_n502(x)
+    else
+        fun_l12_n90(x)
+    end
+end
+
+def fun_l11_n779(x)
+    if (x < 1)
+        fun_l12_n37(x)
+    else
+        fun_l12_n668(x)
+    end
+end
+
+def fun_l11_n780(x)
+    if (x < 1)
+        fun_l12_n80(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n781(x)
+    if (x < 1)
+        fun_l12_n435(x)
+    else
+        fun_l12_n583(x)
+    end
+end
+
+def fun_l11_n782(x)
+    if (x < 1)
+        fun_l12_n899(x)
+    else
+        fun_l12_n863(x)
+    end
+end
+
+def fun_l11_n783(x)
+    if (x < 1)
+        fun_l12_n414(x)
+    else
+        fun_l12_n96(x)
+    end
+end
+
+def fun_l11_n784(x)
+    if (x < 1)
+        fun_l12_n286(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n785(x)
+    if (x < 1)
+        fun_l12_n444(x)
+    else
+        fun_l12_n344(x)
+    end
+end
+
+def fun_l11_n786(x)
+    if (x < 1)
+        fun_l12_n484(x)
+    else
+        fun_l12_n469(x)
+    end
+end
+
+def fun_l11_n787(x)
+    if (x < 1)
+        fun_l12_n686(x)
+    else
+        fun_l12_n728(x)
+    end
+end
+
+def fun_l11_n788(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n789(x)
+    if (x < 1)
+        fun_l12_n958(x)
+    else
+        fun_l12_n633(x)
+    end
+end
+
+def fun_l11_n790(x)
+    if (x < 1)
+        fun_l12_n984(x)
+    else
+        fun_l12_n39(x)
+    end
+end
+
+def fun_l11_n791(x)
+    if (x < 1)
+        fun_l12_n877(x)
+    else
+        fun_l12_n721(x)
+    end
+end
+
+def fun_l11_n792(x)
+    if (x < 1)
+        fun_l12_n710(x)
+    else
+        fun_l12_n840(x)
+    end
+end
+
+def fun_l11_n793(x)
+    if (x < 1)
+        fun_l12_n955(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n794(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n859(x)
+    end
+end
+
+def fun_l11_n795(x)
+    if (x < 1)
+        fun_l12_n722(x)
+    else
+        fun_l12_n700(x)
+    end
+end
+
+def fun_l11_n796(x)
+    if (x < 1)
+        fun_l12_n508(x)
+    else
+        fun_l12_n617(x)
+    end
+end
+
+def fun_l11_n797(x)
+    if (x < 1)
+        fun_l12_n382(x)
+    else
+        fun_l12_n1(x)
+    end
+end
+
+def fun_l11_n798(x)
+    if (x < 1)
+        fun_l12_n857(x)
+    else
+        fun_l12_n141(x)
+    end
+end
+
+def fun_l11_n799(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n842(x)
+    end
+end
+
+def fun_l11_n800(x)
+    if (x < 1)
+        fun_l12_n588(x)
+    else
+        fun_l12_n511(x)
+    end
+end
+
+def fun_l11_n801(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n516(x)
+    end
+end
+
+def fun_l11_n802(x)
+    if (x < 1)
+        fun_l12_n792(x)
+    else
+        fun_l12_n128(x)
+    end
+end
+
+def fun_l11_n803(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n444(x)
+    end
+end
+
+def fun_l11_n804(x)
+    if (x < 1)
+        fun_l12_n564(x)
+    else
+        fun_l12_n129(x)
+    end
+end
+
+def fun_l11_n805(x)
+    if (x < 1)
+        fun_l12_n234(x)
+    else
+        fun_l12_n429(x)
+    end
+end
+
+def fun_l11_n806(x)
+    if (x < 1)
+        fun_l12_n841(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n807(x)
+    if (x < 1)
+        fun_l12_n72(x)
+    else
+        fun_l12_n87(x)
+    end
+end
+
+def fun_l11_n808(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n27(x)
+    end
+end
+
+def fun_l11_n809(x)
+    if (x < 1)
+        fun_l12_n136(x)
+    else
+        fun_l12_n84(x)
+    end
+end
+
+def fun_l11_n810(x)
+    if (x < 1)
+        fun_l12_n464(x)
+    else
+        fun_l12_n411(x)
+    end
+end
+
+def fun_l11_n811(x)
+    if (x < 1)
+        fun_l12_n939(x)
+    else
+        fun_l12_n584(x)
+    end
+end
+
+def fun_l11_n812(x)
+    if (x < 1)
+        fun_l12_n24(x)
+    else
+        fun_l12_n593(x)
+    end
+end
+
+def fun_l11_n813(x)
+    if (x < 1)
+        fun_l12_n980(x)
+    else
+        fun_l12_n318(x)
+    end
+end
+
+def fun_l11_n814(x)
+    if (x < 1)
+        fun_l12_n73(x)
+    else
+        fun_l12_n431(x)
+    end
+end
+
+def fun_l11_n815(x)
+    if (x < 1)
+        fun_l12_n938(x)
+    else
+        fun_l12_n794(x)
+    end
+end
+
+def fun_l11_n816(x)
+    if (x < 1)
+        fun_l12_n305(x)
+    else
+        fun_l12_n620(x)
+    end
+end
+
+def fun_l11_n817(x)
+    if (x < 1)
+        fun_l12_n881(x)
+    else
+        fun_l12_n636(x)
+    end
+end
+
+def fun_l11_n818(x)
+    if (x < 1)
+        fun_l12_n493(x)
+    else
+        fun_l12_n536(x)
+    end
+end
+
+def fun_l11_n819(x)
+    if (x < 1)
+        fun_l12_n32(x)
+    else
+        fun_l12_n69(x)
+    end
+end
+
+def fun_l11_n820(x)
+    if (x < 1)
+        fun_l12_n131(x)
+    else
+        fun_l12_n206(x)
+    end
+end
+
+def fun_l11_n821(x)
+    if (x < 1)
+        fun_l12_n130(x)
+    else
+        fun_l12_n63(x)
+    end
+end
+
+def fun_l11_n822(x)
+    if (x < 1)
+        fun_l12_n228(x)
+    else
+        fun_l12_n753(x)
+    end
+end
+
+def fun_l11_n823(x)
+    if (x < 1)
+        fun_l12_n171(x)
+    else
+        fun_l12_n605(x)
+    end
+end
+
+def fun_l11_n824(x)
+    if (x < 1)
+        fun_l12_n69(x)
+    else
+        fun_l12_n900(x)
+    end
+end
+
+def fun_l11_n825(x)
+    if (x < 1)
+        fun_l12_n802(x)
+    else
+        fun_l12_n682(x)
+    end
+end
+
+def fun_l11_n826(x)
+    if (x < 1)
+        fun_l12_n311(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n827(x)
+    if (x < 1)
+        fun_l12_n994(x)
+    else
+        fun_l12_n162(x)
+    end
+end
+
+def fun_l11_n828(x)
+    if (x < 1)
+        fun_l12_n780(x)
+    else
+        fun_l12_n805(x)
+    end
+end
+
+def fun_l11_n829(x)
+    if (x < 1)
+        fun_l12_n744(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n830(x)
+    if (x < 1)
+        fun_l12_n655(x)
+    else
+        fun_l12_n603(x)
+    end
+end
+
+def fun_l11_n831(x)
+    if (x < 1)
+        fun_l12_n245(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n832(x)
+    if (x < 1)
+        fun_l12_n381(x)
+    else
+        fun_l12_n582(x)
+    end
+end
+
+def fun_l11_n833(x)
+    if (x < 1)
+        fun_l12_n185(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n834(x)
+    if (x < 1)
+        fun_l12_n601(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n835(x)
+    if (x < 1)
+        fun_l12_n934(x)
+    else
+        fun_l12_n460(x)
+    end
+end
+
+def fun_l11_n836(x)
+    if (x < 1)
+        fun_l12_n550(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n837(x)
+    if (x < 1)
+        fun_l12_n183(x)
+    else
+        fun_l12_n880(x)
+    end
+end
+
+def fun_l11_n838(x)
+    if (x < 1)
+        fun_l12_n742(x)
+    else
+        fun_l12_n249(x)
+    end
+end
+
+def fun_l11_n839(x)
+    if (x < 1)
+        fun_l12_n979(x)
+    else
+        fun_l12_n100(x)
+    end
+end
+
+def fun_l11_n840(x)
+    if (x < 1)
+        fun_l12_n889(x)
+    else
+        fun_l12_n683(x)
+    end
+end
+
+def fun_l11_n841(x)
+    if (x < 1)
+        fun_l12_n964(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n842(x)
+    if (x < 1)
+        fun_l12_n461(x)
+    else
+        fun_l12_n126(x)
+    end
+end
+
+def fun_l11_n843(x)
+    if (x < 1)
+        fun_l12_n839(x)
+    else
+        fun_l12_n554(x)
+    end
+end
+
+def fun_l11_n844(x)
+    if (x < 1)
+        fun_l12_n150(x)
+    else
+        fun_l12_n857(x)
+    end
+end
+
+def fun_l11_n845(x)
+    if (x < 1)
+        fun_l12_n114(x)
+    else
+        fun_l12_n72(x)
+    end
+end
+
+def fun_l11_n846(x)
+    if (x < 1)
+        fun_l12_n953(x)
+    else
+        fun_l12_n695(x)
+    end
+end
+
+def fun_l11_n847(x)
+    if (x < 1)
+        fun_l12_n16(x)
+    else
+        fun_l12_n216(x)
+    end
+end
+
+def fun_l11_n848(x)
+    if (x < 1)
+        fun_l12_n440(x)
+    else
+        fun_l12_n893(x)
+    end
+end
+
+def fun_l11_n849(x)
+    if (x < 1)
+        fun_l12_n176(x)
+    else
+        fun_l12_n932(x)
+    end
+end
+
+def fun_l11_n850(x)
+    if (x < 1)
+        fun_l12_n723(x)
+    else
+        fun_l12_n363(x)
+    end
+end
+
+def fun_l11_n851(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n774(x)
+    end
+end
+
+def fun_l11_n852(x)
+    if (x < 1)
+        fun_l12_n618(x)
+    else
+        fun_l12_n252(x)
+    end
+end
+
+def fun_l11_n853(x)
+    if (x < 1)
+        fun_l12_n298(x)
+    else
+        fun_l12_n563(x)
+    end
+end
+
+def fun_l11_n854(x)
+    if (x < 1)
+        fun_l12_n972(x)
+    else
+        fun_l12_n681(x)
+    end
+end
+
+def fun_l11_n855(x)
+    if (x < 1)
+        fun_l12_n412(x)
+    else
+        fun_l12_n932(x)
+    end
+end
+
+def fun_l11_n856(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n699(x)
+    end
+end
+
+def fun_l11_n857(x)
+    if (x < 1)
+        fun_l12_n208(x)
+    else
+        fun_l12_n602(x)
+    end
+end
+
+def fun_l11_n858(x)
+    if (x < 1)
+        fun_l12_n705(x)
+    else
+        fun_l12_n833(x)
+    end
+end
+
+def fun_l11_n859(x)
+    if (x < 1)
+        fun_l12_n408(x)
+    else
+        fun_l12_n570(x)
+    end
+end
+
+def fun_l11_n860(x)
+    if (x < 1)
+        fun_l12_n720(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n861(x)
+    if (x < 1)
+        fun_l12_n926(x)
+    else
+        fun_l12_n490(x)
+    end
+end
+
+def fun_l11_n862(x)
+    if (x < 1)
+        fun_l12_n985(x)
+    else
+        fun_l12_n54(x)
+    end
+end
+
+def fun_l11_n863(x)
+    if (x < 1)
+        fun_l12_n214(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n864(x)
+    if (x < 1)
+        fun_l12_n351(x)
+    else
+        fun_l12_n951(x)
+    end
+end
+
+def fun_l11_n865(x)
+    if (x < 1)
+        fun_l12_n514(x)
+    else
+        fun_l12_n468(x)
+    end
+end
+
+def fun_l11_n866(x)
+    if (x < 1)
+        fun_l12_n793(x)
+    else
+        fun_l12_n712(x)
+    end
+end
+
+def fun_l11_n867(x)
+    if (x < 1)
+        fun_l12_n697(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n868(x)
+    if (x < 1)
+        fun_l12_n144(x)
+    else
+        fun_l12_n703(x)
+    end
+end
+
+def fun_l11_n869(x)
+    if (x < 1)
+        fun_l12_n552(x)
+    else
+        fun_l12_n612(x)
+    end
+end
+
+def fun_l11_n870(x)
+    if (x < 1)
+        fun_l12_n2(x)
+    else
+        fun_l12_n287(x)
+    end
+end
+
+def fun_l11_n871(x)
+    if (x < 1)
+        fun_l12_n604(x)
+    else
+        fun_l12_n260(x)
+    end
+end
+
+def fun_l11_n872(x)
+    if (x < 1)
+        fun_l12_n517(x)
+    else
+        fun_l12_n173(x)
+    end
+end
+
+def fun_l11_n873(x)
+    if (x < 1)
+        fun_l12_n640(x)
+    else
+        fun_l12_n196(x)
+    end
+end
+
+def fun_l11_n874(x)
+    if (x < 1)
+        fun_l12_n874(x)
+    else
+        fun_l12_n697(x)
+    end
+end
+
+def fun_l11_n875(x)
+    if (x < 1)
+        fun_l12_n180(x)
+    else
+        fun_l12_n652(x)
+    end
+end
+
+def fun_l11_n876(x)
+    if (x < 1)
+        fun_l12_n432(x)
+    else
+        fun_l12_n971(x)
+    end
+end
+
+def fun_l11_n877(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n919(x)
+    end
+end
+
+def fun_l11_n878(x)
+    if (x < 1)
+        fun_l12_n631(x)
+    else
+        fun_l12_n439(x)
+    end
+end
+
+def fun_l11_n879(x)
+    if (x < 1)
+        fun_l12_n39(x)
+    else
+        fun_l12_n372(x)
+    end
+end
+
+def fun_l11_n880(x)
+    if (x < 1)
+        fun_l12_n675(x)
+    else
+        fun_l12_n64(x)
+    end
+end
+
+def fun_l11_n881(x)
+    if (x < 1)
+        fun_l12_n831(x)
+    else
+        fun_l12_n705(x)
+    end
+end
+
+def fun_l11_n882(x)
+    if (x < 1)
+        fun_l12_n126(x)
+    else
+        fun_l12_n648(x)
+    end
+end
+
+def fun_l11_n883(x)
+    if (x < 1)
+        fun_l12_n768(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n884(x)
+    if (x < 1)
+        fun_l12_n328(x)
+    else
+        fun_l12_n646(x)
+    end
+end
+
+def fun_l11_n885(x)
+    if (x < 1)
+        fun_l12_n890(x)
+    else
+        fun_l12_n544(x)
+    end
+end
+
+def fun_l11_n886(x)
+    if (x < 1)
+        fun_l12_n651(x)
+    else
+        fun_l12_n557(x)
+    end
+end
+
+def fun_l11_n887(x)
+    if (x < 1)
+        fun_l12_n479(x)
+    else
+        fun_l12_n594(x)
+    end
+end
+
+def fun_l11_n888(x)
+    if (x < 1)
+        fun_l12_n649(x)
+    else
+        fun_l12_n488(x)
+    end
+end
+
+def fun_l11_n889(x)
+    if (x < 1)
+        fun_l12_n347(x)
+    else
+        fun_l12_n42(x)
+    end
+end
+
+def fun_l11_n890(x)
+    if (x < 1)
+        fun_l12_n111(x)
+    else
+        fun_l12_n683(x)
+    end
+end
+
+def fun_l11_n891(x)
+    if (x < 1)
+        fun_l12_n965(x)
+    else
+        fun_l12_n275(x)
+    end
+end
+
+def fun_l11_n892(x)
+    if (x < 1)
+        fun_l12_n148(x)
+    else
+        fun_l12_n541(x)
+    end
+end
+
+def fun_l11_n893(x)
+    if (x < 1)
+        fun_l12_n633(x)
+    else
+        fun_l12_n358(x)
+    end
+end
+
+def fun_l11_n894(x)
+    if (x < 1)
+        fun_l12_n681(x)
+    else
+        fun_l12_n236(x)
+    end
+end
+
+def fun_l11_n895(x)
+    if (x < 1)
+        fun_l12_n292(x)
+    else
+        fun_l12_n417(x)
+    end
+end
+
+def fun_l11_n896(x)
+    if (x < 1)
+        fun_l12_n165(x)
+    else
+        fun_l12_n80(x)
+    end
+end
+
+def fun_l11_n897(x)
+    if (x < 1)
+        fun_l12_n132(x)
+    else
+        fun_l12_n659(x)
+    end
+end
+
+def fun_l11_n898(x)
+    if (x < 1)
+        fun_l12_n329(x)
+    else
+        fun_l12_n204(x)
+    end
+end
+
+def fun_l11_n899(x)
+    if (x < 1)
+        fun_l12_n339(x)
+    else
+        fun_l12_n632(x)
+    end
+end
+
+def fun_l11_n900(x)
+    if (x < 1)
+        fun_l12_n957(x)
+    else
+        fun_l12_n282(x)
+    end
+end
+
+def fun_l11_n901(x)
+    if (x < 1)
+        fun_l12_n709(x)
+    else
+        fun_l12_n155(x)
+    end
+end
+
+def fun_l11_n902(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n659(x)
+    end
+end
+
+def fun_l11_n903(x)
+    if (x < 1)
+        fun_l12_n224(x)
+    else
+        fun_l12_n23(x)
+    end
+end
+
+def fun_l11_n904(x)
+    if (x < 1)
+        fun_l12_n494(x)
+    else
+        fun_l12_n292(x)
+    end
+end
+
+def fun_l11_n905(x)
+    if (x < 1)
+        fun_l12_n309(x)
+    else
+        fun_l12_n949(x)
+    end
+end
+
+def fun_l11_n906(x)
+    if (x < 1)
+        fun_l12_n960(x)
+    else
+        fun_l12_n24(x)
+    end
+end
+
+def fun_l11_n907(x)
+    if (x < 1)
+        fun_l12_n98(x)
+    else
+        fun_l12_n674(x)
+    end
+end
+
+def fun_l11_n908(x)
+    if (x < 1)
+        fun_l12_n84(x)
+    else
+        fun_l12_n307(x)
+    end
+end
+
+def fun_l11_n909(x)
+    if (x < 1)
+        fun_l12_n786(x)
+    else
+        fun_l12_n311(x)
+    end
+end
+
+def fun_l11_n910(x)
+    if (x < 1)
+        fun_l12_n631(x)
+    else
+        fun_l12_n605(x)
+    end
+end
+
+def fun_l11_n911(x)
+    if (x < 1)
+        fun_l12_n352(x)
+    else
+        fun_l12_n750(x)
+    end
+end
+
+def fun_l11_n912(x)
+    if (x < 1)
+        fun_l12_n75(x)
+    else
+        fun_l12_n112(x)
+    end
+end
+
+def fun_l11_n913(x)
+    if (x < 1)
+        fun_l12_n404(x)
+    else
+        fun_l12_n995(x)
+    end
+end
+
+def fun_l11_n914(x)
+    if (x < 1)
+        fun_l12_n656(x)
+    else
+        fun_l12_n203(x)
+    end
+end
+
+def fun_l11_n915(x)
+    if (x < 1)
+        fun_l12_n625(x)
+    else
+        fun_l12_n32(x)
+    end
+end
+
+def fun_l11_n916(x)
+    if (x < 1)
+        fun_l12_n785(x)
+    else
+        fun_l12_n237(x)
+    end
+end
+
+def fun_l11_n917(x)
+    if (x < 1)
+        fun_l12_n643(x)
+    else
+        fun_l12_n364(x)
+    end
+end
+
+def fun_l11_n918(x)
+    if (x < 1)
+        fun_l12_n920(x)
+    else
+        fun_l12_n957(x)
+    end
+end
+
+def fun_l11_n919(x)
+    if (x < 1)
+        fun_l12_n336(x)
+    else
+        fun_l12_n726(x)
+    end
+end
+
+def fun_l11_n920(x)
+    if (x < 1)
+        fun_l12_n329(x)
+    else
+        fun_l12_n15(x)
+    end
+end
+
+def fun_l11_n921(x)
+    if (x < 1)
+        fun_l12_n911(x)
+    else
+        fun_l12_n824(x)
+    end
+end
+
+def fun_l11_n922(x)
+    if (x < 1)
+        fun_l12_n907(x)
+    else
+        fun_l12_n854(x)
+    end
+end
+
+def fun_l11_n923(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n549(x)
+    end
+end
+
+def fun_l11_n924(x)
+    if (x < 1)
+        fun_l12_n833(x)
+    else
+        fun_l12_n986(x)
+    end
+end
+
+def fun_l11_n925(x)
+    if (x < 1)
+        fun_l12_n450(x)
+    else
+        fun_l12_n783(x)
+    end
+end
+
+def fun_l11_n926(x)
+    if (x < 1)
+        fun_l12_n405(x)
+    else
+        fun_l12_n960(x)
+    end
+end
+
+def fun_l11_n927(x)
+    if (x < 1)
+        fun_l12_n603(x)
+    else
+        fun_l12_n892(x)
+    end
+end
+
+def fun_l11_n928(x)
+    if (x < 1)
+        fun_l12_n137(x)
+    else
+        fun_l12_n200(x)
+    end
+end
+
+def fun_l11_n929(x)
+    if (x < 1)
+        fun_l12_n161(x)
+    else
+        fun_l12_n754(x)
+    end
+end
+
+def fun_l11_n930(x)
+    if (x < 1)
+        fun_l12_n107(x)
+    else
+        fun_l12_n258(x)
+    end
+end
+
+def fun_l11_n931(x)
+    if (x < 1)
+        fun_l12_n794(x)
+    else
+        fun_l12_n812(x)
+    end
+end
+
+def fun_l11_n932(x)
+    if (x < 1)
+        fun_l12_n956(x)
+    else
+        fun_l12_n156(x)
+    end
+end
+
+def fun_l11_n933(x)
+    if (x < 1)
+        fun_l12_n676(x)
+    else
+        fun_l12_n496(x)
+    end
+end
+
+def fun_l11_n934(x)
+    if (x < 1)
+        fun_l12_n229(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n935(x)
+    if (x < 1)
+        fun_l12_n353(x)
+    else
+        fun_l12_n430(x)
+    end
+end
+
+def fun_l11_n936(x)
+    if (x < 1)
+        fun_l12_n721(x)
+    else
+        fun_l12_n409(x)
+    end
+end
+
+def fun_l11_n937(x)
+    if (x < 1)
+        fun_l12_n151(x)
+    else
+        fun_l12_n60(x)
+    end
+end
+
+def fun_l11_n938(x)
+    if (x < 1)
+        fun_l12_n362(x)
+    else
+        fun_l12_n92(x)
+    end
+end
+
+def fun_l11_n939(x)
+    if (x < 1)
+        fun_l12_n315(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n940(x)
+    if (x < 1)
+        fun_l12_n788(x)
+    else
+        fun_l12_n105(x)
+    end
+end
+
+def fun_l11_n941(x)
+    if (x < 1)
+        fun_l12_n124(x)
+    else
+        fun_l12_n496(x)
+    end
+end
+
+def fun_l11_n942(x)
+    if (x < 1)
+        fun_l12_n546(x)
+    else
+        fun_l12_n17(x)
+    end
+end
+
+def fun_l11_n943(x)
+    if (x < 1)
+        fun_l12_n594(x)
+    else
+        fun_l12_n55(x)
+    end
+end
+
+def fun_l11_n944(x)
+    if (x < 1)
+        fun_l12_n187(x)
+    else
+        fun_l12_n139(x)
+    end
+end
+
+def fun_l11_n945(x)
+    if (x < 1)
+        fun_l12_n117(x)
+    else
+        fun_l12_n382(x)
+    end
+end
+
+def fun_l11_n946(x)
+    if (x < 1)
+        fun_l12_n579(x)
+    else
+        fun_l12_n895(x)
+    end
+end
+
+def fun_l11_n947(x)
+    if (x < 1)
+        fun_l12_n541(x)
+    else
+        fun_l12_n497(x)
+    end
+end
+
+def fun_l11_n948(x)
+    if (x < 1)
+        fun_l12_n250(x)
+    else
+        fun_l12_n257(x)
+    end
+end
+
+def fun_l11_n949(x)
+    if (x < 1)
+        fun_l12_n553(x)
+    else
+        fun_l12_n663(x)
+    end
+end
+
+def fun_l11_n950(x)
+    if (x < 1)
+        fun_l12_n779(x)
+    else
+        fun_l12_n414(x)
+    end
+end
+
+def fun_l11_n951(x)
+    if (x < 1)
+        fun_l12_n748(x)
+    else
+        fun_l12_n525(x)
+    end
+end
+
+def fun_l11_n952(x)
+    if (x < 1)
+        fun_l12_n669(x)
+    else
+        fun_l12_n339(x)
+    end
+end
+
+def fun_l11_n953(x)
+    if (x < 1)
+        fun_l12_n665(x)
+    else
+        fun_l12_n996(x)
+    end
+end
+
+def fun_l11_n954(x)
+    if (x < 1)
+        fun_l12_n366(x)
+    else
+        fun_l12_n149(x)
+    end
+end
+
+def fun_l11_n955(x)
+    if (x < 1)
+        fun_l12_n549(x)
+    else
+        fun_l12_n414(x)
+    end
+end
+
+def fun_l11_n956(x)
+    if (x < 1)
+        fun_l12_n258(x)
+    else
+        fun_l12_n67(x)
+    end
+end
+
+def fun_l11_n957(x)
+    if (x < 1)
+        fun_l12_n439(x)
+    else
+        fun_l12_n83(x)
+    end
+end
+
+def fun_l11_n958(x)
+    if (x < 1)
+        fun_l12_n601(x)
+    else
+        fun_l12_n938(x)
+    end
+end
+
+def fun_l11_n959(x)
+    if (x < 1)
+        fun_l12_n953(x)
+    else
+        fun_l12_n973(x)
+    end
+end
+
+def fun_l11_n960(x)
+    if (x < 1)
+        fun_l12_n426(x)
+    else
+        fun_l12_n8(x)
+    end
+end
+
+def fun_l11_n961(x)
+    if (x < 1)
+        fun_l12_n719(x)
+    else
+        fun_l12_n657(x)
+    end
+end
+
+def fun_l11_n962(x)
+    if (x < 1)
+        fun_l12_n391(x)
+    else
+        fun_l12_n992(x)
+    end
+end
+
+def fun_l11_n963(x)
+    if (x < 1)
+        fun_l12_n141(x)
+    else
+        fun_l12_n468(x)
+    end
+end
+
+def fun_l11_n964(x)
+    if (x < 1)
+        fun_l12_n463(x)
+    else
+        fun_l12_n94(x)
+    end
+end
+
+def fun_l11_n965(x)
+    if (x < 1)
+        fun_l12_n765(x)
+    else
+        fun_l12_n168(x)
+    end
+end
+
+def fun_l11_n966(x)
+    if (x < 1)
+        fun_l12_n237(x)
+    else
+        fun_l12_n437(x)
+    end
+end
+
+def fun_l11_n967(x)
+    if (x < 1)
+        fun_l12_n741(x)
+    else
+        fun_l12_n331(x)
+    end
+end
+
+def fun_l11_n968(x)
+    if (x < 1)
+        fun_l12_n617(x)
+    else
+        fun_l12_n773(x)
+    end
+end
+
+def fun_l11_n969(x)
+    if (x < 1)
+        fun_l12_n880(x)
+    else
+        fun_l12_n727(x)
+    end
+end
+
+def fun_l11_n970(x)
+    if (x < 1)
+        fun_l12_n781(x)
+    else
+        fun_l12_n270(x)
+    end
+end
+
+def fun_l11_n971(x)
+    if (x < 1)
+        fun_l12_n511(x)
+    else
+        fun_l12_n183(x)
+    end
+end
+
+def fun_l11_n972(x)
+    if (x < 1)
+        fun_l12_n448(x)
+    else
+        fun_l12_n965(x)
+    end
+end
+
+def fun_l11_n973(x)
+    if (x < 1)
+        fun_l12_n816(x)
+    else
+        fun_l12_n974(x)
+    end
+end
+
+def fun_l11_n974(x)
+    if (x < 1)
+        fun_l12_n583(x)
+    else
+        fun_l12_n731(x)
+    end
+end
+
+def fun_l11_n975(x)
+    if (x < 1)
+        fun_l12_n42(x)
+    else
+        fun_l12_n463(x)
+    end
+end
+
+def fun_l11_n976(x)
+    if (x < 1)
+        fun_l12_n267(x)
+    else
+        fun_l12_n769(x)
+    end
+end
+
+def fun_l11_n977(x)
+    if (x < 1)
+        fun_l12_n993(x)
+    else
+        fun_l12_n391(x)
+    end
+end
+
+def fun_l11_n978(x)
+    if (x < 1)
+        fun_l12_n507(x)
+    else
+        fun_l12_n905(x)
+    end
+end
+
+def fun_l11_n979(x)
+    if (x < 1)
+        fun_l12_n486(x)
+    else
+        fun_l12_n562(x)
+    end
+end
+
+def fun_l11_n980(x)
+    if (x < 1)
+        fun_l12_n252(x)
+    else
+        fun_l12_n475(x)
+    end
+end
+
+def fun_l11_n981(x)
+    if (x < 1)
+        fun_l12_n979(x)
+    else
+        fun_l12_n70(x)
+    end
+end
+
+def fun_l11_n982(x)
+    if (x < 1)
+        fun_l12_n11(x)
+    else
+        fun_l12_n483(x)
+    end
+end
+
+def fun_l11_n983(x)
+    if (x < 1)
+        fun_l12_n208(x)
+    else
+        fun_l12_n315(x)
+    end
+end
+
+def fun_l11_n984(x)
+    if (x < 1)
+        fun_l12_n452(x)
+    else
+        fun_l12_n367(x)
+    end
+end
+
+def fun_l11_n985(x)
+    if (x < 1)
+        fun_l12_n937(x)
+    else
+        fun_l12_n33(x)
+    end
+end
+
+def fun_l11_n986(x)
+    if (x < 1)
+        fun_l12_n227(x)
+    else
+        fun_l12_n448(x)
+    end
+end
+
+def fun_l11_n987(x)
+    if (x < 1)
+        fun_l12_n928(x)
+    else
+        fun_l12_n693(x)
+    end
+end
+
+def fun_l11_n988(x)
+    if (x < 1)
+        fun_l12_n731(x)
+    else
+        fun_l12_n872(x)
+    end
+end
+
+def fun_l11_n989(x)
+    if (x < 1)
+        fun_l12_n355(x)
+    else
+        fun_l12_n0(x)
+    end
+end
+
+def fun_l11_n990(x)
+    if (x < 1)
+        fun_l12_n203(x)
+    else
+        fun_l12_n545(x)
+    end
+end
+
+def fun_l11_n991(x)
+    if (x < 1)
+        fun_l12_n237(x)
+    else
+        fun_l12_n186(x)
+    end
+end
+
+def fun_l11_n992(x)
+    if (x < 1)
+        fun_l12_n22(x)
+    else
+        fun_l12_n597(x)
+    end
+end
+
+def fun_l11_n993(x)
+    if (x < 1)
+        fun_l12_n711(x)
+    else
+        fun_l12_n677(x)
+    end
+end
+
+def fun_l11_n994(x)
+    if (x < 1)
+        fun_l12_n892(x)
+    else
+        fun_l12_n729(x)
+    end
+end
+
+def fun_l11_n995(x)
+    if (x < 1)
+        fun_l12_n51(x)
+    else
+        fun_l12_n279(x)
+    end
+end
+
+def fun_l11_n996(x)
+    if (x < 1)
+        fun_l12_n430(x)
+    else
+        fun_l12_n527(x)
+    end
+end
+
+def fun_l11_n997(x)
+    if (x < 1)
+        fun_l12_n153(x)
+    else
+        fun_l12_n366(x)
+    end
+end
+
+def fun_l11_n998(x)
+    if (x < 1)
+        fun_l12_n574(x)
+    else
+        fun_l12_n432(x)
+    end
+end
+
+def fun_l11_n999(x)
+    if (x < 1)
+        fun_l12_n100(x)
+    else
+        fun_l12_n943(x)
+    end
+end
+
+def fun_l12_n0(x)
+    if (x < 1)
+        fun_l13_n874(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n1(x)
+    if (x < 1)
+        fun_l13_n354(x)
+    else
+        fun_l13_n103(x)
+    end
+end
+
+def fun_l12_n2(x)
+    if (x < 1)
+        fun_l13_n265(x)
+    else
+        fun_l13_n936(x)
+    end
+end
+
+def fun_l12_n3(x)
+    if (x < 1)
+        fun_l13_n683(x)
+    else
+        fun_l13_n607(x)
+    end
+end
+
+def fun_l12_n4(x)
+    if (x < 1)
+        fun_l13_n398(x)
+    else
+        fun_l13_n902(x)
+    end
+end
+
+def fun_l12_n5(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n392(x)
+    end
+end
+
+def fun_l12_n6(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n207(x)
+    end
+end
+
+def fun_l12_n7(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n368(x)
+    end
+end
+
+def fun_l12_n8(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n9(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n697(x)
+    end
+end
+
+def fun_l12_n10(x)
+    if (x < 1)
+        fun_l13_n860(x)
+    else
+        fun_l13_n407(x)
+    end
+end
+
+def fun_l12_n11(x)
+    if (x < 1)
+        fun_l13_n581(x)
+    else
+        fun_l13_n582(x)
+    end
+end
+
+def fun_l12_n12(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n706(x)
+    end
+end
+
+def fun_l12_n13(x)
+    if (x < 1)
+        fun_l13_n862(x)
+    else
+        fun_l13_n89(x)
+    end
+end
+
+def fun_l12_n14(x)
+    if (x < 1)
+        fun_l13_n379(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n15(x)
+    if (x < 1)
+        fun_l13_n175(x)
+    else
+        fun_l13_n113(x)
+    end
+end
+
+def fun_l12_n16(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n935(x)
+    end
+end
+
+def fun_l12_n17(x)
+    if (x < 1)
+        fun_l13_n171(x)
+    else
+        fun_l13_n264(x)
+    end
+end
+
+def fun_l12_n18(x)
+    if (x < 1)
+        fun_l13_n61(x)
+    else
+        fun_l13_n412(x)
+    end
+end
+
+def fun_l12_n19(x)
+    if (x < 1)
+        fun_l13_n213(x)
+    else
+        fun_l13_n422(x)
+    end
+end
+
+def fun_l12_n20(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n537(x)
+    end
+end
+
+def fun_l12_n21(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n495(x)
+    end
+end
+
+def fun_l12_n22(x)
+    if (x < 1)
+        fun_l13_n941(x)
+    else
+        fun_l13_n466(x)
+    end
+end
+
+def fun_l12_n23(x)
+    if (x < 1)
+        fun_l13_n195(x)
+    else
+        fun_l13_n984(x)
+    end
+end
+
+def fun_l12_n24(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n812(x)
+    end
+end
+
+def fun_l12_n25(x)
+    if (x < 1)
+        fun_l13_n979(x)
+    else
+        fun_l13_n902(x)
+    end
+end
+
+def fun_l12_n26(x)
+    if (x < 1)
+        fun_l13_n726(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n27(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n995(x)
+    end
+end
+
+def fun_l12_n28(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n333(x)
+    end
+end
+
+def fun_l12_n29(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n59(x)
+    end
+end
+
+def fun_l12_n30(x)
+    if (x < 1)
+        fun_l13_n731(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n31(x)
+    if (x < 1)
+        fun_l13_n591(x)
+    else
+        fun_l13_n473(x)
+    end
+end
+
+def fun_l12_n32(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n175(x)
+    end
+end
+
+def fun_l12_n33(x)
+    if (x < 1)
+        fun_l13_n26(x)
+    else
+        fun_l13_n867(x)
+    end
+end
+
+def fun_l12_n34(x)
+    if (x < 1)
+        fun_l13_n349(x)
+    else
+        fun_l13_n332(x)
+    end
+end
+
+def fun_l12_n35(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n591(x)
+    end
+end
+
+def fun_l12_n36(x)
+    if (x < 1)
+        fun_l13_n339(x)
+    else
+        fun_l13_n354(x)
+    end
+end
+
+def fun_l12_n37(x)
+    if (x < 1)
+        fun_l13_n289(x)
+    else
+        fun_l13_n101(x)
+    end
+end
+
+def fun_l12_n38(x)
+    if (x < 1)
+        fun_l13_n410(x)
+    else
+        fun_l13_n91(x)
+    end
+end
+
+def fun_l12_n39(x)
+    if (x < 1)
+        fun_l13_n617(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n40(x)
+    if (x < 1)
+        fun_l13_n116(x)
+    else
+        fun_l13_n875(x)
+    end
+end
+
+def fun_l12_n41(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n844(x)
+    end
+end
+
+def fun_l12_n42(x)
+    if (x < 1)
+        fun_l13_n79(x)
+    else
+        fun_l13_n589(x)
+    end
+end
+
+def fun_l12_n43(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n21(x)
+    end
+end
+
+def fun_l12_n44(x)
+    if (x < 1)
+        fun_l13_n420(x)
+    else
+        fun_l13_n403(x)
+    end
+end
+
+def fun_l12_n45(x)
+    if (x < 1)
+        fun_l13_n203(x)
+    else
+        fun_l13_n890(x)
+    end
+end
+
+def fun_l12_n46(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n47(x)
+    if (x < 1)
+        fun_l13_n766(x)
+    else
+        fun_l13_n635(x)
+    end
+end
+
+def fun_l12_n48(x)
+    if (x < 1)
+        fun_l13_n223(x)
+    else
+        fun_l13_n460(x)
+    end
+end
+
+def fun_l12_n49(x)
+    if (x < 1)
+        fun_l13_n799(x)
+    else
+        fun_l13_n397(x)
+    end
+end
+
+def fun_l12_n50(x)
+    if (x < 1)
+        fun_l13_n200(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n51(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n612(x)
+    end
+end
+
+def fun_l12_n52(x)
+    if (x < 1)
+        fun_l13_n271(x)
+    else
+        fun_l13_n324(x)
+    end
+end
+
+def fun_l12_n53(x)
+    if (x < 1)
+        fun_l13_n639(x)
+    else
+        fun_l13_n603(x)
+    end
+end
+
+def fun_l12_n54(x)
+    if (x < 1)
+        fun_l13_n125(x)
+    else
+        fun_l13_n726(x)
+    end
+end
+
+def fun_l12_n55(x)
+    if (x < 1)
+        fun_l13_n266(x)
+    else
+        fun_l13_n552(x)
+    end
+end
+
+def fun_l12_n56(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n132(x)
+    end
+end
+
+def fun_l12_n57(x)
+    if (x < 1)
+        fun_l13_n235(x)
+    else
+        fun_l13_n892(x)
+    end
+end
+
+def fun_l12_n58(x)
+    if (x < 1)
+        fun_l13_n515(x)
+    else
+        fun_l13_n465(x)
+    end
+end
+
+def fun_l12_n59(x)
+    if (x < 1)
+        fun_l13_n38(x)
+    else
+        fun_l13_n757(x)
+    end
+end
+
+def fun_l12_n60(x)
+    if (x < 1)
+        fun_l13_n544(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n61(x)
+    if (x < 1)
+        fun_l13_n622(x)
+    else
+        fun_l13_n340(x)
+    end
+end
+
+def fun_l12_n62(x)
+    if (x < 1)
+        fun_l13_n563(x)
+    else
+        fun_l13_n313(x)
+    end
+end
+
+def fun_l12_n63(x)
+    if (x < 1)
+        fun_l13_n936(x)
+    else
+        fun_l13_n38(x)
+    end
+end
+
+def fun_l12_n64(x)
+    if (x < 1)
+        fun_l13_n951(x)
+    else
+        fun_l13_n543(x)
+    end
+end
+
+def fun_l12_n65(x)
+    if (x < 1)
+        fun_l13_n577(x)
+    else
+        fun_l13_n190(x)
+    end
+end
+
+def fun_l12_n66(x)
+    if (x < 1)
+        fun_l13_n649(x)
+    else
+        fun_l13_n887(x)
+    end
+end
+
+def fun_l12_n67(x)
+    if (x < 1)
+        fun_l13_n218(x)
+    else
+        fun_l13_n200(x)
+    end
+end
+
+def fun_l12_n68(x)
+    if (x < 1)
+        fun_l13_n111(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n69(x)
+    if (x < 1)
+        fun_l13_n431(x)
+    else
+        fun_l13_n816(x)
+    end
+end
+
+def fun_l12_n70(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n545(x)
+    end
+end
+
+def fun_l12_n71(x)
+    if (x < 1)
+        fun_l13_n3(x)
+    else
+        fun_l13_n751(x)
+    end
+end
+
+def fun_l12_n72(x)
+    if (x < 1)
+        fun_l13_n58(x)
+    else
+        fun_l13_n994(x)
+    end
+end
+
+def fun_l12_n73(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n783(x)
+    end
+end
+
+def fun_l12_n74(x)
+    if (x < 1)
+        fun_l13_n705(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n75(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n880(x)
+    end
+end
+
+def fun_l12_n76(x)
+    if (x < 1)
+        fun_l13_n867(x)
+    else
+        fun_l13_n234(x)
+    end
+end
+
+def fun_l12_n77(x)
+    if (x < 1)
+        fun_l13_n447(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n78(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n687(x)
+    end
+end
+
+def fun_l12_n79(x)
+    if (x < 1)
+        fun_l13_n735(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n80(x)
+    if (x < 1)
+        fun_l13_n826(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n81(x)
+    if (x < 1)
+        fun_l13_n959(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n82(x)
+    if (x < 1)
+        fun_l13_n17(x)
+    else
+        fun_l13_n722(x)
+    end
+end
+
+def fun_l12_n83(x)
+    if (x < 1)
+        fun_l13_n702(x)
+    else
+        fun_l13_n441(x)
+    end
+end
+
+def fun_l12_n84(x)
+    if (x < 1)
+        fun_l13_n939(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n85(x)
+    if (x < 1)
+        fun_l13_n747(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n86(x)
+    if (x < 1)
+        fun_l13_n813(x)
+    else
+        fun_l13_n780(x)
+    end
+end
+
+def fun_l12_n87(x)
+    if (x < 1)
+        fun_l13_n87(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n88(x)
+    if (x < 1)
+        fun_l13_n422(x)
+    else
+        fun_l13_n938(x)
+    end
+end
+
+def fun_l12_n89(x)
+    if (x < 1)
+        fun_l13_n575(x)
+    else
+        fun_l13_n150(x)
+    end
+end
+
+def fun_l12_n90(x)
+    if (x < 1)
+        fun_l13_n294(x)
+    else
+        fun_l13_n666(x)
+    end
+end
+
+def fun_l12_n91(x)
+    if (x < 1)
+        fun_l13_n216(x)
+    else
+        fun_l13_n315(x)
+    end
+end
+
+def fun_l12_n92(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n487(x)
+    end
+end
+
+def fun_l12_n93(x)
+    if (x < 1)
+        fun_l13_n500(x)
+    else
+        fun_l13_n2(x)
+    end
+end
+
+def fun_l12_n94(x)
+    if (x < 1)
+        fun_l13_n362(x)
+    else
+        fun_l13_n69(x)
+    end
+end
+
+def fun_l12_n95(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n549(x)
+    end
+end
+
+def fun_l12_n96(x)
+    if (x < 1)
+        fun_l13_n407(x)
+    else
+        fun_l13_n935(x)
+    end
+end
+
+def fun_l12_n97(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n70(x)
+    end
+end
+
+def fun_l12_n98(x)
+    if (x < 1)
+        fun_l13_n184(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n99(x)
+    if (x < 1)
+        fun_l13_n612(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n100(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n458(x)
+    end
+end
+
+def fun_l12_n101(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n783(x)
+    end
+end
+
+def fun_l12_n102(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n647(x)
+    end
+end
+
+def fun_l12_n103(x)
+    if (x < 1)
+        fun_l13_n310(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n104(x)
+    if (x < 1)
+        fun_l13_n643(x)
+    else
+        fun_l13_n479(x)
+    end
+end
+
+def fun_l12_n105(x)
+    if (x < 1)
+        fun_l13_n909(x)
+    else
+        fun_l13_n10(x)
+    end
+end
+
+def fun_l12_n106(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n671(x)
+    end
+end
+
+def fun_l12_n107(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n108(x)
+    if (x < 1)
+        fun_l13_n438(x)
+    else
+        fun_l13_n196(x)
+    end
+end
+
+def fun_l12_n109(x)
+    if (x < 1)
+        fun_l13_n605(x)
+    else
+        fun_l13_n529(x)
+    end
+end
+
+def fun_l12_n110(x)
+    if (x < 1)
+        fun_l13_n31(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n111(x)
+    if (x < 1)
+        fun_l13_n790(x)
+    else
+        fun_l13_n773(x)
+    end
+end
+
+def fun_l12_n112(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n621(x)
+    end
+end
+
+def fun_l12_n113(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n413(x)
+    end
+end
+
+def fun_l12_n114(x)
+    if (x < 1)
+        fun_l13_n675(x)
+    else
+        fun_l13_n124(x)
+    end
+end
+
+def fun_l12_n115(x)
+    if (x < 1)
+        fun_l13_n366(x)
+    else
+        fun_l13_n884(x)
+    end
+end
+
+def fun_l12_n116(x)
+    if (x < 1)
+        fun_l13_n552(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n117(x)
+    if (x < 1)
+        fun_l13_n11(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n118(x)
+    if (x < 1)
+        fun_l13_n766(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n119(x)
+    if (x < 1)
+        fun_l13_n980(x)
+    else
+        fun_l13_n956(x)
+    end
+end
+
+def fun_l12_n120(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n532(x)
+    end
+end
+
+def fun_l12_n121(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n489(x)
+    end
+end
+
+def fun_l12_n122(x)
+    if (x < 1)
+        fun_l13_n581(x)
+    else
+        fun_l13_n33(x)
+    end
+end
+
+def fun_l12_n123(x)
+    if (x < 1)
+        fun_l13_n188(x)
+    else
+        fun_l13_n652(x)
+    end
+end
+
+def fun_l12_n124(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n932(x)
+    end
+end
+
+def fun_l12_n125(x)
+    if (x < 1)
+        fun_l13_n646(x)
+    else
+        fun_l13_n525(x)
+    end
+end
+
+def fun_l12_n126(x)
+    if (x < 1)
+        fun_l13_n878(x)
+    else
+        fun_l13_n98(x)
+    end
+end
+
+def fun_l12_n127(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n950(x)
+    end
+end
+
+def fun_l12_n128(x)
+    if (x < 1)
+        fun_l13_n405(x)
+    else
+        fun_l13_n60(x)
+    end
+end
+
+def fun_l12_n129(x)
+    if (x < 1)
+        fun_l13_n635(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n130(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n172(x)
+    end
+end
+
+def fun_l12_n131(x)
+    if (x < 1)
+        fun_l13_n2(x)
+    else
+        fun_l13_n328(x)
+    end
+end
+
+def fun_l12_n132(x)
+    if (x < 1)
+        fun_l13_n506(x)
+    else
+        fun_l13_n258(x)
+    end
+end
+
+def fun_l12_n133(x)
+    if (x < 1)
+        fun_l13_n737(x)
+    else
+        fun_l13_n552(x)
+    end
+end
+
+def fun_l12_n134(x)
+    if (x < 1)
+        fun_l13_n596(x)
+    else
+        fun_l13_n475(x)
+    end
+end
+
+def fun_l12_n135(x)
+    if (x < 1)
+        fun_l13_n751(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n136(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n137(x)
+    if (x < 1)
+        fun_l13_n779(x)
+    else
+        fun_l13_n204(x)
+    end
+end
+
+def fun_l12_n138(x)
+    if (x < 1)
+        fun_l13_n765(x)
+    else
+        fun_l13_n280(x)
+    end
+end
+
+def fun_l12_n139(x)
+    if (x < 1)
+        fun_l13_n896(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n140(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n809(x)
+    end
+end
+
+def fun_l12_n141(x)
+    if (x < 1)
+        fun_l13_n182(x)
+    else
+        fun_l13_n960(x)
+    end
+end
+
+def fun_l12_n142(x)
+    if (x < 1)
+        fun_l13_n196(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n143(x)
+    if (x < 1)
+        fun_l13_n993(x)
+    else
+        fun_l13_n426(x)
+    end
+end
+
+def fun_l12_n144(x)
+    if (x < 1)
+        fun_l13_n926(x)
+    else
+        fun_l13_n554(x)
+    end
+end
+
+def fun_l12_n145(x)
+    if (x < 1)
+        fun_l13_n839(x)
+    else
+        fun_l13_n987(x)
+    end
+end
+
+def fun_l12_n146(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n359(x)
+    end
+end
+
+def fun_l12_n147(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n640(x)
+    end
+end
+
+def fun_l12_n148(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n862(x)
+    end
+end
+
+def fun_l12_n149(x)
+    if (x < 1)
+        fun_l13_n161(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n150(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n151(x)
+    if (x < 1)
+        fun_l13_n390(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n152(x)
+    if (x < 1)
+        fun_l13_n722(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n153(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n461(x)
+    end
+end
+
+def fun_l12_n154(x)
+    if (x < 1)
+        fun_l13_n223(x)
+    else
+        fun_l13_n502(x)
+    end
+end
+
+def fun_l12_n155(x)
+    if (x < 1)
+        fun_l13_n526(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n156(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n290(x)
+    end
+end
+
+def fun_l12_n157(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n158(x)
+    if (x < 1)
+        fun_l13_n308(x)
+    else
+        fun_l13_n646(x)
+    end
+end
+
+def fun_l12_n159(x)
+    if (x < 1)
+        fun_l13_n417(x)
+    else
+        fun_l13_n576(x)
+    end
+end
+
+def fun_l12_n160(x)
+    if (x < 1)
+        fun_l13_n846(x)
+    else
+        fun_l13_n989(x)
+    end
+end
+
+def fun_l12_n161(x)
+    if (x < 1)
+        fun_l13_n59(x)
+    else
+        fun_l13_n877(x)
+    end
+end
+
+def fun_l12_n162(x)
+    if (x < 1)
+        fun_l13_n194(x)
+    else
+        fun_l13_n654(x)
+    end
+end
+
+def fun_l12_n163(x)
+    if (x < 1)
+        fun_l13_n350(x)
+    else
+        fun_l13_n412(x)
+    end
+end
+
+def fun_l12_n164(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n820(x)
+    end
+end
+
+def fun_l12_n165(x)
+    if (x < 1)
+        fun_l13_n251(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n166(x)
+    if (x < 1)
+        fun_l13_n832(x)
+    else
+        fun_l13_n505(x)
+    end
+end
+
+def fun_l12_n167(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n168(x)
+    if (x < 1)
+        fun_l13_n325(x)
+    else
+        fun_l13_n755(x)
+    end
+end
+
+def fun_l12_n169(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n753(x)
+    end
+end
+
+def fun_l12_n170(x)
+    if (x < 1)
+        fun_l13_n819(x)
+    else
+        fun_l13_n532(x)
+    end
+end
+
+def fun_l12_n171(x)
+    if (x < 1)
+        fun_l13_n633(x)
+    else
+        fun_l13_n96(x)
+    end
+end
+
+def fun_l12_n172(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n105(x)
+    end
+end
+
+def fun_l12_n173(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n466(x)
+    end
+end
+
+def fun_l12_n174(x)
+    if (x < 1)
+        fun_l13_n520(x)
+    else
+        fun_l13_n329(x)
+    end
+end
+
+def fun_l12_n175(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n176(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n649(x)
+    end
+end
+
+def fun_l12_n177(x)
+    if (x < 1)
+        fun_l13_n933(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n178(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n723(x)
+    end
+end
+
+def fun_l12_n179(x)
+    if (x < 1)
+        fun_l13_n992(x)
+    else
+        fun_l13_n436(x)
+    end
+end
+
+def fun_l12_n180(x)
+    if (x < 1)
+        fun_l13_n221(x)
+    else
+        fun_l13_n294(x)
+    end
+end
+
+def fun_l12_n181(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n182(x)
+    if (x < 1)
+        fun_l13_n608(x)
+    else
+        fun_l13_n709(x)
+    end
+end
+
+def fun_l12_n183(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n184(x)
+    if (x < 1)
+        fun_l13_n605(x)
+    else
+        fun_l13_n665(x)
+    end
+end
+
+def fun_l12_n185(x)
+    if (x < 1)
+        fun_l13_n729(x)
+    else
+        fun_l13_n876(x)
+    end
+end
+
+def fun_l12_n186(x)
+    if (x < 1)
+        fun_l13_n43(x)
+    else
+        fun_l13_n366(x)
+    end
+end
+
+def fun_l12_n187(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n188(x)
+    if (x < 1)
+        fun_l13_n489(x)
+    else
+        fun_l13_n107(x)
+    end
+end
+
+def fun_l12_n189(x)
+    if (x < 1)
+        fun_l13_n859(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n190(x)
+    if (x < 1)
+        fun_l13_n631(x)
+    else
+        fun_l13_n399(x)
+    end
+end
+
+def fun_l12_n191(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n333(x)
+    end
+end
+
+def fun_l12_n192(x)
+    if (x < 1)
+        fun_l13_n535(x)
+    else
+        fun_l13_n191(x)
+    end
+end
+
+def fun_l12_n193(x)
+    if (x < 1)
+        fun_l13_n157(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n194(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n798(x)
+    end
+end
+
+def fun_l12_n195(x)
+    if (x < 1)
+        fun_l13_n31(x)
+    else
+        fun_l13_n703(x)
+    end
+end
+
+def fun_l12_n196(x)
+    if (x < 1)
+        fun_l13_n976(x)
+    else
+        fun_l13_n862(x)
+    end
+end
+
+def fun_l12_n197(x)
+    if (x < 1)
+        fun_l13_n267(x)
+    else
+        fun_l13_n803(x)
+    end
+end
+
+def fun_l12_n198(x)
+    if (x < 1)
+        fun_l13_n598(x)
+    else
+        fun_l13_n255(x)
+    end
+end
+
+def fun_l12_n199(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n668(x)
+    end
+end
+
+def fun_l12_n200(x)
+    if (x < 1)
+        fun_l13_n48(x)
+    else
+        fun_l13_n406(x)
+    end
+end
+
+def fun_l12_n201(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n225(x)
+    end
+end
+
+def fun_l12_n202(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n72(x)
+    end
+end
+
+def fun_l12_n203(x)
+    if (x < 1)
+        fun_l13_n333(x)
+    else
+        fun_l13_n381(x)
+    end
+end
+
+def fun_l12_n204(x)
+    if (x < 1)
+        fun_l13_n558(x)
+    else
+        fun_l13_n474(x)
+    end
+end
+
+def fun_l12_n205(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n420(x)
+    end
+end
+
+def fun_l12_n206(x)
+    if (x < 1)
+        fun_l13_n287(x)
+    else
+        fun_l13_n43(x)
+    end
+end
+
+def fun_l12_n207(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n208(x)
+    if (x < 1)
+        fun_l13_n707(x)
+    else
+        fun_l13_n824(x)
+    end
+end
+
+def fun_l12_n209(x)
+    if (x < 1)
+        fun_l13_n788(x)
+    else
+        fun_l13_n625(x)
+    end
+end
+
+def fun_l12_n210(x)
+    if (x < 1)
+        fun_l13_n818(x)
+    else
+        fun_l13_n667(x)
+    end
+end
+
+def fun_l12_n211(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n212(x)
+    if (x < 1)
+        fun_l13_n497(x)
+    else
+        fun_l13_n20(x)
+    end
+end
+
+def fun_l12_n213(x)
+    if (x < 1)
+        fun_l13_n648(x)
+    else
+        fun_l13_n33(x)
+    end
+end
+
+def fun_l12_n214(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n918(x)
+    end
+end
+
+def fun_l12_n215(x)
+    if (x < 1)
+        fun_l13_n595(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n216(x)
+    if (x < 1)
+        fun_l13_n302(x)
+    else
+        fun_l13_n388(x)
+    end
+end
+
+def fun_l12_n217(x)
+    if (x < 1)
+        fun_l13_n301(x)
+    else
+        fun_l13_n416(x)
+    end
+end
+
+def fun_l12_n218(x)
+    if (x < 1)
+        fun_l13_n114(x)
+    else
+        fun_l13_n650(x)
+    end
+end
+
+def fun_l12_n219(x)
+    if (x < 1)
+        fun_l13_n221(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n220(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n438(x)
+    end
+end
+
+def fun_l12_n221(x)
+    if (x < 1)
+        fun_l13_n528(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n222(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n223(x)
+    if (x < 1)
+        fun_l13_n726(x)
+    else
+        fun_l13_n142(x)
+    end
+end
+
+def fun_l12_n224(x)
+    if (x < 1)
+        fun_l13_n57(x)
+    else
+        fun_l13_n625(x)
+    end
+end
+
+def fun_l12_n225(x)
+    if (x < 1)
+        fun_l13_n739(x)
+    else
+        fun_l13_n667(x)
+    end
+end
+
+def fun_l12_n226(x)
+    if (x < 1)
+        fun_l13_n693(x)
+    else
+        fun_l13_n819(x)
+    end
+end
+
+def fun_l12_n227(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n866(x)
+    end
+end
+
+def fun_l12_n228(x)
+    if (x < 1)
+        fun_l13_n88(x)
+    else
+        fun_l13_n336(x)
+    end
+end
+
+def fun_l12_n229(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n230(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n231(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n747(x)
+    end
+end
+
+def fun_l12_n232(x)
+    if (x < 1)
+        fun_l13_n107(x)
+    else
+        fun_l13_n0(x)
+    end
+end
+
+def fun_l12_n233(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n234(x)
+    if (x < 1)
+        fun_l13_n429(x)
+    else
+        fun_l13_n845(x)
+    end
+end
+
+def fun_l12_n235(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n203(x)
+    end
+end
+
+def fun_l12_n236(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n134(x)
+    end
+end
+
+def fun_l12_n237(x)
+    if (x < 1)
+        fun_l13_n114(x)
+    else
+        fun_l13_n794(x)
+    end
+end
+
+def fun_l12_n238(x)
+    if (x < 1)
+        fun_l13_n463(x)
+    else
+        fun_l13_n127(x)
+    end
+end
+
+def fun_l12_n239(x)
+    if (x < 1)
+        fun_l13_n443(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n240(x)
+    if (x < 1)
+        fun_l13_n713(x)
+    else
+        fun_l13_n447(x)
+    end
+end
+
+def fun_l12_n241(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n796(x)
+    end
+end
+
+def fun_l12_n242(x)
+    if (x < 1)
+        fun_l13_n277(x)
+    else
+        fun_l13_n106(x)
+    end
+end
+
+def fun_l12_n243(x)
+    if (x < 1)
+        fun_l13_n584(x)
+    else
+        fun_l13_n262(x)
+    end
+end
+
+def fun_l12_n244(x)
+    if (x < 1)
+        fun_l13_n670(x)
+    else
+        fun_l13_n989(x)
+    end
+end
+
+def fun_l12_n245(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n246(x)
+    if (x < 1)
+        fun_l13_n98(x)
+    else
+        fun_l13_n400(x)
+    end
+end
+
+def fun_l12_n247(x)
+    if (x < 1)
+        fun_l13_n119(x)
+    else
+        fun_l13_n321(x)
+    end
+end
+
+def fun_l12_n248(x)
+    if (x < 1)
+        fun_l13_n157(x)
+    else
+        fun_l13_n557(x)
+    end
+end
+
+def fun_l12_n249(x)
+    if (x < 1)
+        fun_l13_n243(x)
+    else
+        fun_l13_n596(x)
+    end
+end
+
+def fun_l12_n250(x)
+    if (x < 1)
+        fun_l13_n280(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n251(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n829(x)
+    end
+end
+
+def fun_l12_n252(x)
+    if (x < 1)
+        fun_l13_n472(x)
+    else
+        fun_l13_n224(x)
+    end
+end
+
+def fun_l12_n253(x)
+    if (x < 1)
+        fun_l13_n151(x)
+    else
+        fun_l13_n168(x)
+    end
+end
+
+def fun_l12_n254(x)
+    if (x < 1)
+        fun_l13_n724(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n255(x)
+    if (x < 1)
+        fun_l13_n27(x)
+    else
+        fun_l13_n776(x)
+    end
+end
+
+def fun_l12_n256(x)
+    if (x < 1)
+        fun_l13_n116(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n257(x)
+    if (x < 1)
+        fun_l13_n201(x)
+    else
+        fun_l13_n982(x)
+    end
+end
+
+def fun_l12_n258(x)
+    if (x < 1)
+        fun_l13_n152(x)
+    else
+        fun_l13_n818(x)
+    end
+end
+
+def fun_l12_n259(x)
+    if (x < 1)
+        fun_l13_n859(x)
+    else
+        fun_l13_n555(x)
+    end
+end
+
+def fun_l12_n260(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n416(x)
+    end
+end
+
+def fun_l12_n261(x)
+    if (x < 1)
+        fun_l13_n811(x)
+    else
+        fun_l13_n827(x)
+    end
+end
+
+def fun_l12_n262(x)
+    if (x < 1)
+        fun_l13_n867(x)
+    else
+        fun_l13_n298(x)
+    end
+end
+
+def fun_l12_n263(x)
+    if (x < 1)
+        fun_l13_n464(x)
+    else
+        fun_l13_n420(x)
+    end
+end
+
+def fun_l12_n264(x)
+    if (x < 1)
+        fun_l13_n494(x)
+    else
+        fun_l13_n368(x)
+    end
+end
+
+def fun_l12_n265(x)
+    if (x < 1)
+        fun_l13_n959(x)
+    else
+        fun_l13_n425(x)
+    end
+end
+
+def fun_l12_n266(x)
+    if (x < 1)
+        fun_l13_n841(x)
+    else
+        fun_l13_n874(x)
+    end
+end
+
+def fun_l12_n267(x)
+    if (x < 1)
+        fun_l13_n885(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n268(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n342(x)
+    end
+end
+
+def fun_l12_n269(x)
+    if (x < 1)
+        fun_l13_n4(x)
+    else
+        fun_l13_n81(x)
+    end
+end
+
+def fun_l12_n270(x)
+    if (x < 1)
+        fun_l13_n44(x)
+    else
+        fun_l13_n924(x)
+    end
+end
+
+def fun_l12_n271(x)
+    if (x < 1)
+        fun_l13_n955(x)
+    else
+        fun_l13_n834(x)
+    end
+end
+
+def fun_l12_n272(x)
+    if (x < 1)
+        fun_l13_n969(x)
+    else
+        fun_l13_n699(x)
+    end
+end
+
+def fun_l12_n273(x)
+    if (x < 1)
+        fun_l13_n590(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n274(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n343(x)
+    end
+end
+
+def fun_l12_n275(x)
+    if (x < 1)
+        fun_l13_n317(x)
+    else
+        fun_l13_n998(x)
+    end
+end
+
+def fun_l12_n276(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n644(x)
+    end
+end
+
+def fun_l12_n277(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n663(x)
+    end
+end
+
+def fun_l12_n278(x)
+    if (x < 1)
+        fun_l13_n39(x)
+    else
+        fun_l13_n624(x)
+    end
+end
+
+def fun_l12_n279(x)
+    if (x < 1)
+        fun_l13_n578(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n280(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n462(x)
+    end
+end
+
+def fun_l12_n281(x)
+    if (x < 1)
+        fun_l13_n741(x)
+    else
+        fun_l13_n93(x)
+    end
+end
+
+def fun_l12_n282(x)
+    if (x < 1)
+        fun_l13_n845(x)
+    else
+        fun_l13_n981(x)
+    end
+end
+
+def fun_l12_n283(x)
+    if (x < 1)
+        fun_l13_n479(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n284(x)
+    if (x < 1)
+        fun_l13_n201(x)
+    else
+        fun_l13_n526(x)
+    end
+end
+
+def fun_l12_n285(x)
+    if (x < 1)
+        fun_l13_n890(x)
+    else
+        fun_l13_n237(x)
+    end
+end
+
+def fun_l12_n286(x)
+    if (x < 1)
+        fun_l13_n377(x)
+    else
+        fun_l13_n249(x)
+    end
+end
+
+def fun_l12_n287(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n306(x)
+    end
+end
+
+def fun_l12_n288(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n220(x)
+    end
+end
+
+def fun_l12_n289(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n648(x)
+    end
+end
+
+def fun_l12_n290(x)
+    if (x < 1)
+        fun_l13_n278(x)
+    else
+        fun_l13_n255(x)
+    end
+end
+
+def fun_l12_n291(x)
+    if (x < 1)
+        fun_l13_n994(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n292(x)
+    if (x < 1)
+        fun_l13_n731(x)
+    else
+        fun_l13_n473(x)
+    end
+end
+
+def fun_l12_n293(x)
+    if (x < 1)
+        fun_l13_n321(x)
+    else
+        fun_l13_n518(x)
+    end
+end
+
+def fun_l12_n294(x)
+    if (x < 1)
+        fun_l13_n91(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n295(x)
+    if (x < 1)
+        fun_l13_n39(x)
+    else
+        fun_l13_n639(x)
+    end
+end
+
+def fun_l12_n296(x)
+    if (x < 1)
+        fun_l13_n800(x)
+    else
+        fun_l13_n821(x)
+    end
+end
+
+def fun_l12_n297(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n898(x)
+    end
+end
+
+def fun_l12_n298(x)
+    if (x < 1)
+        fun_l13_n487(x)
+    else
+        fun_l13_n470(x)
+    end
+end
+
+def fun_l12_n299(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n300(x)
+    if (x < 1)
+        fun_l13_n177(x)
+    else
+        fun_l13_n375(x)
+    end
+end
+
+def fun_l12_n301(x)
+    if (x < 1)
+        fun_l13_n714(x)
+    else
+        fun_l13_n922(x)
+    end
+end
+
+def fun_l12_n302(x)
+    if (x < 1)
+        fun_l13_n845(x)
+    else
+        fun_l13_n93(x)
+    end
+end
+
+def fun_l12_n303(x)
+    if (x < 1)
+        fun_l13_n806(x)
+    else
+        fun_l13_n706(x)
+    end
+end
+
+def fun_l12_n304(x)
+    if (x < 1)
+        fun_l13_n428(x)
+    else
+        fun_l13_n942(x)
+    end
+end
+
+def fun_l12_n305(x)
+    if (x < 1)
+        fun_l13_n170(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n306(x)
+    if (x < 1)
+        fun_l13_n998(x)
+    else
+        fun_l13_n224(x)
+    end
+end
+
+def fun_l12_n307(x)
+    if (x < 1)
+        fun_l13_n15(x)
+    else
+        fun_l13_n753(x)
+    end
+end
+
+def fun_l12_n308(x)
+    if (x < 1)
+        fun_l13_n323(x)
+    else
+        fun_l13_n846(x)
+    end
+end
+
+def fun_l12_n309(x)
+    if (x < 1)
+        fun_l13_n779(x)
+    else
+        fun_l13_n330(x)
+    end
+end
+
+def fun_l12_n310(x)
+    if (x < 1)
+        fun_l13_n652(x)
+    else
+        fun_l13_n560(x)
+    end
+end
+
+def fun_l12_n311(x)
+    if (x < 1)
+        fun_l13_n54(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n312(x)
+    if (x < 1)
+        fun_l13_n674(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n313(x)
+    if (x < 1)
+        fun_l13_n975(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n314(x)
+    if (x < 1)
+        fun_l13_n997(x)
+    else
+        fun_l13_n827(x)
+    end
+end
+
+def fun_l12_n315(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n349(x)
+    end
+end
+
+def fun_l12_n316(x)
+    if (x < 1)
+        fun_l13_n516(x)
+    else
+        fun_l13_n974(x)
+    end
+end
+
+def fun_l12_n317(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n786(x)
+    end
+end
+
+def fun_l12_n318(x)
+    if (x < 1)
+        fun_l13_n125(x)
+    else
+        fun_l13_n809(x)
+    end
+end
+
+def fun_l12_n319(x)
+    if (x < 1)
+        fun_l13_n642(x)
+    else
+        fun_l13_n188(x)
+    end
+end
+
+def fun_l12_n320(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n321(x)
+    if (x < 1)
+        fun_l13_n278(x)
+    else
+        fun_l13_n752(x)
+    end
+end
+
+def fun_l12_n322(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n894(x)
+    end
+end
+
+def fun_l12_n323(x)
+    if (x < 1)
+        fun_l13_n357(x)
+    else
+        fun_l13_n742(x)
+    end
+end
+
+def fun_l12_n324(x)
+    if (x < 1)
+        fun_l13_n667(x)
+    else
+        fun_l13_n764(x)
+    end
+end
+
+def fun_l12_n325(x)
+    if (x < 1)
+        fun_l13_n333(x)
+    else
+        fun_l13_n445(x)
+    end
+end
+
+def fun_l12_n326(x)
+    if (x < 1)
+        fun_l13_n669(x)
+    else
+        fun_l13_n484(x)
+    end
+end
+
+def fun_l12_n327(x)
+    if (x < 1)
+        fun_l13_n662(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n328(x)
+    if (x < 1)
+        fun_l13_n869(x)
+    else
+        fun_l13_n993(x)
+    end
+end
+
+def fun_l12_n329(x)
+    if (x < 1)
+        fun_l13_n305(x)
+    else
+        fun_l13_n45(x)
+    end
+end
+
+def fun_l12_n330(x)
+    if (x < 1)
+        fun_l13_n32(x)
+    else
+        fun_l13_n253(x)
+    end
+end
+
+def fun_l12_n331(x)
+    if (x < 1)
+        fun_l13_n45(x)
+    else
+        fun_l13_n327(x)
+    end
+end
+
+def fun_l12_n332(x)
+    if (x < 1)
+        fun_l13_n685(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n333(x)
+    if (x < 1)
+        fun_l13_n274(x)
+    else
+        fun_l13_n461(x)
+    end
+end
+
+def fun_l12_n334(x)
+    if (x < 1)
+        fun_l13_n93(x)
+    else
+        fun_l13_n7(x)
+    end
+end
+
+def fun_l12_n335(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n259(x)
+    end
+end
+
+def fun_l12_n336(x)
+    if (x < 1)
+        fun_l13_n518(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n337(x)
+    if (x < 1)
+        fun_l13_n439(x)
+    else
+        fun_l13_n21(x)
+    end
+end
+
+def fun_l12_n338(x)
+    if (x < 1)
+        fun_l13_n34(x)
+    else
+        fun_l13_n869(x)
+    end
+end
+
+def fun_l12_n339(x)
+    if (x < 1)
+        fun_l13_n995(x)
+    else
+        fun_l13_n810(x)
+    end
+end
+
+def fun_l12_n340(x)
+    if (x < 1)
+        fun_l13_n640(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n341(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n174(x)
+    end
+end
+
+def fun_l12_n342(x)
+    if (x < 1)
+        fun_l13_n425(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n343(x)
+    if (x < 1)
+        fun_l13_n886(x)
+    else
+        fun_l13_n9(x)
+    end
+end
+
+def fun_l12_n344(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n345(x)
+    if (x < 1)
+        fun_l13_n40(x)
+    else
+        fun_l13_n569(x)
+    end
+end
+
+def fun_l12_n346(x)
+    if (x < 1)
+        fun_l13_n530(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n347(x)
+    if (x < 1)
+        fun_l13_n624(x)
+    else
+        fun_l13_n525(x)
+    end
+end
+
+def fun_l12_n348(x)
+    if (x < 1)
+        fun_l13_n106(x)
+    else
+        fun_l13_n101(x)
+    end
+end
+
+def fun_l12_n349(x)
+    if (x < 1)
+        fun_l13_n164(x)
+    else
+        fun_l13_n675(x)
+    end
+end
+
+def fun_l12_n350(x)
+    if (x < 1)
+        fun_l13_n349(x)
+    else
+        fun_l13_n125(x)
+    end
+end
+
+def fun_l12_n351(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n352(x)
+    if (x < 1)
+        fun_l13_n872(x)
+    else
+        fun_l13_n678(x)
+    end
+end
+
+def fun_l12_n353(x)
+    if (x < 1)
+        fun_l13_n566(x)
+    else
+        fun_l13_n576(x)
+    end
+end
+
+def fun_l12_n354(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n355(x)
+    if (x < 1)
+        fun_l13_n929(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n356(x)
+    if (x < 1)
+        fun_l13_n768(x)
+    else
+        fun_l13_n292(x)
+    end
+end
+
+def fun_l12_n357(x)
+    if (x < 1)
+        fun_l13_n873(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n358(x)
+    if (x < 1)
+        fun_l13_n852(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n359(x)
+    if (x < 1)
+        fun_l13_n220(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n360(x)
+    if (x < 1)
+        fun_l13_n339(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n361(x)
+    if (x < 1)
+        fun_l13_n896(x)
+    else
+        fun_l13_n611(x)
+    end
+end
+
+def fun_l12_n362(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n781(x)
+    end
+end
+
+def fun_l12_n363(x)
+    if (x < 1)
+        fun_l13_n994(x)
+    else
+        fun_l13_n306(x)
+    end
+end
+
+def fun_l12_n364(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n634(x)
+    end
+end
+
+def fun_l12_n365(x)
+    if (x < 1)
+        fun_l13_n367(x)
+    else
+        fun_l13_n798(x)
+    end
+end
+
+def fun_l12_n366(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n352(x)
+    end
+end
+
+def fun_l12_n367(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n368(x)
+    if (x < 1)
+        fun_l13_n214(x)
+    else
+        fun_l13_n67(x)
+    end
+end
+
+def fun_l12_n369(x)
+    if (x < 1)
+        fun_l13_n628(x)
+    else
+        fun_l13_n637(x)
+    end
+end
+
+def fun_l12_n370(x)
+    if (x < 1)
+        fun_l13_n42(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n371(x)
+    if (x < 1)
+        fun_l13_n53(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n372(x)
+    if (x < 1)
+        fun_l13_n810(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n373(x)
+    if (x < 1)
+        fun_l13_n257(x)
+    else
+        fun_l13_n480(x)
+    end
+end
+
+def fun_l12_n374(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n375(x)
+    if (x < 1)
+        fun_l13_n499(x)
+    else
+        fun_l13_n694(x)
+    end
+end
+
+def fun_l12_n376(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n99(x)
+    end
+end
+
+def fun_l12_n377(x)
+    if (x < 1)
+        fun_l13_n672(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n378(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n590(x)
+    end
+end
+
+def fun_l12_n379(x)
+    if (x < 1)
+        fun_l13_n678(x)
+    else
+        fun_l13_n727(x)
+    end
+end
+
+def fun_l12_n380(x)
+    if (x < 1)
+        fun_l13_n269(x)
+    else
+        fun_l13_n74(x)
+    end
+end
+
+def fun_l12_n381(x)
+    if (x < 1)
+        fun_l13_n838(x)
+    else
+        fun_l13_n105(x)
+    end
+end
+
+def fun_l12_n382(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n400(x)
+    end
+end
+
+def fun_l12_n383(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n829(x)
+    end
+end
+
+def fun_l12_n384(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n895(x)
+    end
+end
+
+def fun_l12_n385(x)
+    if (x < 1)
+        fun_l13_n718(x)
+    else
+        fun_l13_n641(x)
+    end
+end
+
+def fun_l12_n386(x)
+    if (x < 1)
+        fun_l13_n825(x)
+    else
+        fun_l13_n761(x)
+    end
+end
+
+def fun_l12_n387(x)
+    if (x < 1)
+        fun_l13_n930(x)
+    else
+        fun_l13_n204(x)
+    end
+end
+
+def fun_l12_n388(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n319(x)
+    end
+end
+
+def fun_l12_n389(x)
+    if (x < 1)
+        fun_l13_n40(x)
+    else
+        fun_l13_n57(x)
+    end
+end
+
+def fun_l12_n390(x)
+    if (x < 1)
+        fun_l13_n206(x)
+    else
+        fun_l13_n219(x)
+    end
+end
+
+def fun_l12_n391(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n239(x)
+    end
+end
+
+def fun_l12_n392(x)
+    if (x < 1)
+        fun_l13_n326(x)
+    else
+        fun_l13_n613(x)
+    end
+end
+
+def fun_l12_n393(x)
+    if (x < 1)
+        fun_l13_n860(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n394(x)
+    if (x < 1)
+        fun_l13_n829(x)
+    else
+        fun_l13_n153(x)
+    end
+end
+
+def fun_l12_n395(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n926(x)
+    end
+end
+
+def fun_l12_n396(x)
+    if (x < 1)
+        fun_l13_n188(x)
+    else
+        fun_l13_n821(x)
+    end
+end
+
+def fun_l12_n397(x)
+    if (x < 1)
+        fun_l13_n161(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n398(x)
+    if (x < 1)
+        fun_l13_n402(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n399(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n348(x)
+    end
+end
+
+def fun_l12_n400(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n401(x)
+    if (x < 1)
+        fun_l13_n787(x)
+    else
+        fun_l13_n5(x)
+    end
+end
+
+def fun_l12_n402(x)
+    if (x < 1)
+        fun_l13_n525(x)
+    else
+        fun_l13_n983(x)
+    end
+end
+
+def fun_l12_n403(x)
+    if (x < 1)
+        fun_l13_n185(x)
+    else
+        fun_l13_n315(x)
+    end
+end
+
+def fun_l12_n404(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n892(x)
+    end
+end
+
+def fun_l12_n405(x)
+    if (x < 1)
+        fun_l13_n990(x)
+    else
+        fun_l13_n868(x)
+    end
+end
+
+def fun_l12_n406(x)
+    if (x < 1)
+        fun_l13_n399(x)
+    else
+        fun_l13_n298(x)
+    end
+end
+
+def fun_l12_n407(x)
+    if (x < 1)
+        fun_l13_n283(x)
+    else
+        fun_l13_n87(x)
+    end
+end
+
+def fun_l12_n408(x)
+    if (x < 1)
+        fun_l13_n597(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n409(x)
+    if (x < 1)
+        fun_l13_n517(x)
+    else
+        fun_l13_n700(x)
+    end
+end
+
+def fun_l12_n410(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n282(x)
+    end
+end
+
+def fun_l12_n411(x)
+    if (x < 1)
+        fun_l13_n876(x)
+    else
+        fun_l13_n562(x)
+    end
+end
+
+def fun_l12_n412(x)
+    if (x < 1)
+        fun_l13_n344(x)
+    else
+        fun_l13_n182(x)
+    end
+end
+
+def fun_l12_n413(x)
+    if (x < 1)
+        fun_l13_n879(x)
+    else
+        fun_l13_n443(x)
+    end
+end
+
+def fun_l12_n414(x)
+    if (x < 1)
+        fun_l13_n335(x)
+    else
+        fun_l13_n451(x)
+    end
+end
+
+def fun_l12_n415(x)
+    if (x < 1)
+        fun_l13_n112(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n416(x)
+    if (x < 1)
+        fun_l13_n217(x)
+    else
+        fun_l13_n221(x)
+    end
+end
+
+def fun_l12_n417(x)
+    if (x < 1)
+        fun_l13_n113(x)
+    else
+        fun_l13_n563(x)
+    end
+end
+
+def fun_l12_n418(x)
+    if (x < 1)
+        fun_l13_n486(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n419(x)
+    if (x < 1)
+        fun_l13_n970(x)
+    else
+        fun_l13_n393(x)
+    end
+end
+
+def fun_l12_n420(x)
+    if (x < 1)
+        fun_l13_n273(x)
+    else
+        fun_l13_n64(x)
+    end
+end
+
+def fun_l12_n421(x)
+    if (x < 1)
+        fun_l13_n69(x)
+    else
+        fun_l13_n158(x)
+    end
+end
+
+def fun_l12_n422(x)
+    if (x < 1)
+        fun_l13_n308(x)
+    else
+        fun_l13_n609(x)
+    end
+end
+
+def fun_l12_n423(x)
+    if (x < 1)
+        fun_l13_n964(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n424(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n425(x)
+    if (x < 1)
+        fun_l13_n792(x)
+    else
+        fun_l13_n960(x)
+    end
+end
+
+def fun_l12_n426(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n911(x)
+    end
+end
+
+def fun_l12_n427(x)
+    if (x < 1)
+        fun_l13_n374(x)
+    else
+        fun_l13_n672(x)
+    end
+end
+
+def fun_l12_n428(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n166(x)
+    end
+end
+
+def fun_l12_n429(x)
+    if (x < 1)
+        fun_l13_n807(x)
+    else
+        fun_l13_n929(x)
+    end
+end
+
+def fun_l12_n430(x)
+    if (x < 1)
+        fun_l13_n997(x)
+    else
+        fun_l13_n938(x)
+    end
+end
+
+def fun_l12_n431(x)
+    if (x < 1)
+        fun_l13_n934(x)
+    else
+        fun_l13_n365(x)
+    end
+end
+
+def fun_l12_n432(x)
+    if (x < 1)
+        fun_l13_n546(x)
+    else
+        fun_l13_n272(x)
+    end
+end
+
+def fun_l12_n433(x)
+    if (x < 1)
+        fun_l13_n176(x)
+    else
+        fun_l13_n629(x)
+    end
+end
+
+def fun_l12_n434(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n165(x)
+    end
+end
+
+def fun_l12_n435(x)
+    if (x < 1)
+        fun_l13_n915(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n436(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n437(x)
+    if (x < 1)
+        fun_l13_n353(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n438(x)
+    if (x < 1)
+        fun_l13_n888(x)
+    else
+        fun_l13_n874(x)
+    end
+end
+
+def fun_l12_n439(x)
+    if (x < 1)
+        fun_l13_n670(x)
+    else
+        fun_l13_n279(x)
+    end
+end
+
+def fun_l12_n440(x)
+    if (x < 1)
+        fun_l13_n818(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n441(x)
+    if (x < 1)
+        fun_l13_n686(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n442(x)
+    if (x < 1)
+        fun_l13_n882(x)
+    else
+        fun_l13_n932(x)
+    end
+end
+
+def fun_l12_n443(x)
+    if (x < 1)
+        fun_l13_n677(x)
+    else
+        fun_l13_n267(x)
+    end
+end
+
+def fun_l12_n444(x)
+    if (x < 1)
+        fun_l13_n632(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n445(x)
+    if (x < 1)
+        fun_l13_n159(x)
+    else
+        fun_l13_n251(x)
+    end
+end
+
+def fun_l12_n446(x)
+    if (x < 1)
+        fun_l13_n939(x)
+    else
+        fun_l13_n231(x)
+    end
+end
+
+def fun_l12_n447(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n103(x)
+    end
+end
+
+def fun_l12_n448(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n356(x)
+    end
+end
+
+def fun_l12_n449(x)
+    if (x < 1)
+        fun_l13_n999(x)
+    else
+        fun_l13_n722(x)
+    end
+end
+
+def fun_l12_n450(x)
+    if (x < 1)
+        fun_l13_n387(x)
+    else
+        fun_l13_n15(x)
+    end
+end
+
+def fun_l12_n451(x)
+    if (x < 1)
+        fun_l13_n736(x)
+    else
+        fun_l13_n869(x)
+    end
+end
+
+def fun_l12_n452(x)
+    if (x < 1)
+        fun_l13_n984(x)
+    else
+        fun_l13_n396(x)
+    end
+end
+
+def fun_l12_n453(x)
+    if (x < 1)
+        fun_l13_n375(x)
+    else
+        fun_l13_n275(x)
+    end
+end
+
+def fun_l12_n454(x)
+    if (x < 1)
+        fun_l13_n100(x)
+    else
+        fun_l13_n956(x)
+    end
+end
+
+def fun_l12_n455(x)
+    if (x < 1)
+        fun_l13_n575(x)
+    else
+        fun_l13_n22(x)
+    end
+end
+
+def fun_l12_n456(x)
+    if (x < 1)
+        fun_l13_n515(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n457(x)
+    if (x < 1)
+        fun_l13_n953(x)
+    else
+        fun_l13_n823(x)
+    end
+end
+
+def fun_l12_n458(x)
+    if (x < 1)
+        fun_l13_n343(x)
+    else
+        fun_l13_n843(x)
+    end
+end
+
+def fun_l12_n459(x)
+    if (x < 1)
+        fun_l13_n209(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n460(x)
+    if (x < 1)
+        fun_l13_n281(x)
+    else
+        fun_l13_n165(x)
+    end
+end
+
+def fun_l12_n461(x)
+    if (x < 1)
+        fun_l13_n416(x)
+    else
+        fun_l13_n896(x)
+    end
+end
+
+def fun_l12_n462(x)
+    if (x < 1)
+        fun_l13_n677(x)
+    else
+        fun_l13_n767(x)
+    end
+end
+
+def fun_l12_n463(x)
+    if (x < 1)
+        fun_l13_n271(x)
+    else
+        fun_l13_n515(x)
+    end
+end
+
+def fun_l12_n464(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n447(x)
+    end
+end
+
+def fun_l12_n465(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n309(x)
+    end
+end
+
+def fun_l12_n466(x)
+    if (x < 1)
+        fun_l13_n48(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n467(x)
+    if (x < 1)
+        fun_l13_n334(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n468(x)
+    if (x < 1)
+        fun_l13_n483(x)
+    else
+        fun_l13_n353(x)
+    end
+end
+
+def fun_l12_n469(x)
+    if (x < 1)
+        fun_l13_n893(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n470(x)
+    if (x < 1)
+        fun_l13_n945(x)
+    else
+        fun_l13_n438(x)
+    end
+end
+
+def fun_l12_n471(x)
+    if (x < 1)
+        fun_l13_n546(x)
+    else
+        fun_l13_n181(x)
+    end
+end
+
+def fun_l12_n472(x)
+    if (x < 1)
+        fun_l13_n443(x)
+    else
+        fun_l13_n35(x)
+    end
+end
+
+def fun_l12_n473(x)
+    if (x < 1)
+        fun_l13_n611(x)
+    else
+        fun_l13_n106(x)
+    end
+end
+
+def fun_l12_n474(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n162(x)
+    end
+end
+
+def fun_l12_n475(x)
+    if (x < 1)
+        fun_l13_n104(x)
+    else
+        fun_l13_n173(x)
+    end
+end
+
+def fun_l12_n476(x)
+    if (x < 1)
+        fun_l13_n922(x)
+    else
+        fun_l13_n593(x)
+    end
+end
+
+def fun_l12_n477(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n659(x)
+    end
+end
+
+def fun_l12_n478(x)
+    if (x < 1)
+        fun_l13_n746(x)
+    else
+        fun_l13_n484(x)
+    end
+end
+
+def fun_l12_n479(x)
+    if (x < 1)
+        fun_l13_n366(x)
+    else
+        fun_l13_n318(x)
+    end
+end
+
+def fun_l12_n480(x)
+    if (x < 1)
+        fun_l13_n995(x)
+    else
+        fun_l13_n108(x)
+    end
+end
+
+def fun_l12_n481(x)
+    if (x < 1)
+        fun_l13_n61(x)
+    else
+        fun_l13_n426(x)
+    end
+end
+
+def fun_l12_n482(x)
+    if (x < 1)
+        fun_l13_n578(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n483(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n588(x)
+    end
+end
+
+def fun_l12_n484(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n485(x)
+    if (x < 1)
+        fun_l13_n439(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n486(x)
+    if (x < 1)
+        fun_l13_n94(x)
+    else
+        fun_l13_n531(x)
+    end
+end
+
+def fun_l12_n487(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n488(x)
+    if (x < 1)
+        fun_l13_n648(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n489(x)
+    if (x < 1)
+        fun_l13_n371(x)
+    else
+        fun_l13_n972(x)
+    end
+end
+
+def fun_l12_n490(x)
+    if (x < 1)
+        fun_l13_n128(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n491(x)
+    if (x < 1)
+        fun_l13_n22(x)
+    else
+        fun_l13_n201(x)
+    end
+end
+
+def fun_l12_n492(x)
+    if (x < 1)
+        fun_l13_n209(x)
+    else
+        fun_l13_n679(x)
+    end
+end
+
+def fun_l12_n493(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n494(x)
+    if (x < 1)
+        fun_l13_n498(x)
+    else
+        fun_l13_n719(x)
+    end
+end
+
+def fun_l12_n495(x)
+    if (x < 1)
+        fun_l13_n492(x)
+    else
+        fun_l13_n161(x)
+    end
+end
+
+def fun_l12_n496(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n54(x)
+    end
+end
+
+def fun_l12_n497(x)
+    if (x < 1)
+        fun_l13_n743(x)
+    else
+        fun_l13_n834(x)
+    end
+end
+
+def fun_l12_n498(x)
+    if (x < 1)
+        fun_l13_n376(x)
+    else
+        fun_l13_n676(x)
+    end
+end
+
+def fun_l12_n499(x)
+    if (x < 1)
+        fun_l13_n626(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n500(x)
+    if (x < 1)
+        fun_l13_n874(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n501(x)
+    if (x < 1)
+        fun_l13_n146(x)
+    else
+        fun_l13_n732(x)
+    end
+end
+
+def fun_l12_n502(x)
+    if (x < 1)
+        fun_l13_n908(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n503(x)
+    if (x < 1)
+        fun_l13_n758(x)
+    else
+        fun_l13_n289(x)
+    end
+end
+
+def fun_l12_n504(x)
+    if (x < 1)
+        fun_l13_n913(x)
+    else
+        fun_l13_n770(x)
+    end
+end
+
+def fun_l12_n505(x)
+    if (x < 1)
+        fun_l13_n305(x)
+    else
+        fun_l13_n990(x)
+    end
+end
+
+def fun_l12_n506(x)
+    if (x < 1)
+        fun_l13_n79(x)
+    else
+        fun_l13_n199(x)
+    end
+end
+
+def fun_l12_n507(x)
+    if (x < 1)
+        fun_l13_n430(x)
+    else
+        fun_l13_n394(x)
+    end
+end
+
+def fun_l12_n508(x)
+    if (x < 1)
+        fun_l13_n835(x)
+    else
+        fun_l13_n64(x)
+    end
+end
+
+def fun_l12_n509(x)
+    if (x < 1)
+        fun_l13_n661(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n510(x)
+    if (x < 1)
+        fun_l13_n672(x)
+    else
+        fun_l13_n498(x)
+    end
+end
+
+def fun_l12_n511(x)
+    if (x < 1)
+        fun_l13_n540(x)
+    else
+        fun_l13_n57(x)
+    end
+end
+
+def fun_l12_n512(x)
+    if (x < 1)
+        fun_l13_n634(x)
+    else
+        fun_l13_n790(x)
+    end
+end
+
+def fun_l12_n513(x)
+    if (x < 1)
+        fun_l13_n998(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n514(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n116(x)
+    end
+end
+
+def fun_l12_n515(x)
+    if (x < 1)
+        fun_l13_n967(x)
+    else
+        fun_l13_n17(x)
+    end
+end
+
+def fun_l12_n516(x)
+    if (x < 1)
+        fun_l13_n614(x)
+    else
+        fun_l13_n260(x)
+    end
+end
+
+def fun_l12_n517(x)
+    if (x < 1)
+        fun_l13_n273(x)
+    else
+        fun_l13_n982(x)
+    end
+end
+
+def fun_l12_n518(x)
+    if (x < 1)
+        fun_l13_n786(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n519(x)
+    if (x < 1)
+        fun_l13_n990(x)
+    else
+        fun_l13_n223(x)
+    end
+end
+
+def fun_l12_n520(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n521(x)
+    if (x < 1)
+        fun_l13_n548(x)
+    else
+        fun_l13_n160(x)
+    end
+end
+
+def fun_l12_n522(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n295(x)
+    end
+end
+
+def fun_l12_n523(x)
+    if (x < 1)
+        fun_l13_n434(x)
+    else
+        fun_l13_n73(x)
+    end
+end
+
+def fun_l12_n524(x)
+    if (x < 1)
+        fun_l13_n550(x)
+    else
+        fun_l13_n472(x)
+    end
+end
+
+def fun_l12_n525(x)
+    if (x < 1)
+        fun_l13_n720(x)
+    else
+        fun_l13_n979(x)
+    end
+end
+
+def fun_l12_n526(x)
+    if (x < 1)
+        fun_l13_n806(x)
+    else
+        fun_l13_n156(x)
+    end
+end
+
+def fun_l12_n527(x)
+    if (x < 1)
+        fun_l13_n689(x)
+    else
+        fun_l13_n781(x)
+    end
+end
+
+def fun_l12_n528(x)
+    if (x < 1)
+        fun_l13_n130(x)
+    else
+        fun_l13_n909(x)
+    end
+end
+
+def fun_l12_n529(x)
+    if (x < 1)
+        fun_l13_n762(x)
+    else
+        fun_l13_n301(x)
+    end
+end
+
+def fun_l12_n530(x)
+    if (x < 1)
+        fun_l13_n580(x)
+    else
+        fun_l13_n269(x)
+    end
+end
+
+def fun_l12_n531(x)
+    if (x < 1)
+        fun_l13_n427(x)
+    else
+        fun_l13_n279(x)
+    end
+end
+
+def fun_l12_n532(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n533(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n386(x)
+    end
+end
+
+def fun_l12_n534(x)
+    if (x < 1)
+        fun_l13_n401(x)
+    else
+        fun_l13_n148(x)
+    end
+end
+
+def fun_l12_n535(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n607(x)
+    end
+end
+
+def fun_l12_n536(x)
+    if (x < 1)
+        fun_l13_n445(x)
+    else
+        fun_l13_n681(x)
+    end
+end
+
+def fun_l12_n537(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n931(x)
+    end
+end
+
+def fun_l12_n538(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n9(x)
+    end
+end
+
+def fun_l12_n539(x)
+    if (x < 1)
+        fun_l13_n584(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n540(x)
+    if (x < 1)
+        fun_l13_n147(x)
+    else
+        fun_l13_n498(x)
+    end
+end
+
+def fun_l12_n541(x)
+    if (x < 1)
+        fun_l13_n727(x)
+    else
+        fun_l13_n152(x)
+    end
+end
+
+def fun_l12_n542(x)
+    if (x < 1)
+        fun_l13_n797(x)
+    else
+        fun_l13_n789(x)
+    end
+end
+
+def fun_l12_n543(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n544(x)
+    if (x < 1)
+        fun_l13_n276(x)
+    else
+        fun_l13_n325(x)
+    end
+end
+
+def fun_l12_n545(x)
+    if (x < 1)
+        fun_l13_n800(x)
+    else
+        fun_l13_n974(x)
+    end
+end
+
+def fun_l12_n546(x)
+    if (x < 1)
+        fun_l13_n654(x)
+    else
+        fun_l13_n331(x)
+    end
+end
+
+def fun_l12_n547(x)
+    if (x < 1)
+        fun_l13_n179(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n548(x)
+    if (x < 1)
+        fun_l13_n348(x)
+    else
+        fun_l13_n210(x)
+    end
+end
+
+def fun_l12_n549(x)
+    if (x < 1)
+        fun_l13_n669(x)
+    else
+        fun_l13_n459(x)
+    end
+end
+
+def fun_l12_n550(x)
+    if (x < 1)
+        fun_l13_n316(x)
+    else
+        fun_l13_n846(x)
+    end
+end
+
+def fun_l12_n551(x)
+    if (x < 1)
+        fun_l13_n262(x)
+    else
+        fun_l13_n430(x)
+    end
+end
+
+def fun_l12_n552(x)
+    if (x < 1)
+        fun_l13_n224(x)
+    else
+        fun_l13_n866(x)
+    end
+end
+
+def fun_l12_n553(x)
+    if (x < 1)
+        fun_l13_n551(x)
+    else
+        fun_l13_n30(x)
+    end
+end
+
+def fun_l12_n554(x)
+    if (x < 1)
+        fun_l13_n864(x)
+    else
+        fun_l13_n931(x)
+    end
+end
+
+def fun_l12_n555(x)
+    if (x < 1)
+        fun_l13_n427(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n556(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n167(x)
+    end
+end
+
+def fun_l12_n557(x)
+    if (x < 1)
+        fun_l13_n858(x)
+    else
+        fun_l13_n123(x)
+    end
+end
+
+def fun_l12_n558(x)
+    if (x < 1)
+        fun_l13_n729(x)
+    else
+        fun_l13_n769(x)
+    end
+end
+
+def fun_l12_n559(x)
+    if (x < 1)
+        fun_l13_n529(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n560(x)
+    if (x < 1)
+        fun_l13_n727(x)
+    else
+        fun_l13_n673(x)
+    end
+end
+
+def fun_l12_n561(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n981(x)
+    end
+end
+
+def fun_l12_n562(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n493(x)
+    end
+end
+
+def fun_l12_n563(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n361(x)
+    end
+end
+
+def fun_l12_n564(x)
+    if (x < 1)
+        fun_l13_n370(x)
+    else
+        fun_l13_n185(x)
+    end
+end
+
+def fun_l12_n565(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n28(x)
+    end
+end
+
+def fun_l12_n566(x)
+    if (x < 1)
+        fun_l13_n332(x)
+    else
+        fun_l13_n718(x)
+    end
+end
+
+def fun_l12_n567(x)
+    if (x < 1)
+        fun_l13_n329(x)
+    else
+        fun_l13_n623(x)
+    end
+end
+
+def fun_l12_n568(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n870(x)
+    end
+end
+
+def fun_l12_n569(x)
+    if (x < 1)
+        fun_l13_n539(x)
+    else
+        fun_l13_n68(x)
+    end
+end
+
+def fun_l12_n570(x)
+    if (x < 1)
+        fun_l13_n794(x)
+    else
+        fun_l13_n617(x)
+    end
+end
+
+def fun_l12_n571(x)
+    if (x < 1)
+        fun_l13_n801(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n572(x)
+    if (x < 1)
+        fun_l13_n781(x)
+    else
+        fun_l13_n879(x)
+    end
+end
+
+def fun_l12_n573(x)
+    if (x < 1)
+        fun_l13_n519(x)
+    else
+        fun_l13_n748(x)
+    end
+end
+
+def fun_l12_n574(x)
+    if (x < 1)
+        fun_l13_n416(x)
+    else
+        fun_l13_n908(x)
+    end
+end
+
+def fun_l12_n575(x)
+    if (x < 1)
+        fun_l13_n288(x)
+    else
+        fun_l13_n925(x)
+    end
+end
+
+def fun_l12_n576(x)
+    if (x < 1)
+        fun_l13_n398(x)
+    else
+        fun_l13_n185(x)
+    end
+end
+
+def fun_l12_n577(x)
+    if (x < 1)
+        fun_l13_n742(x)
+    else
+        fun_l13_n768(x)
+    end
+end
+
+def fun_l12_n578(x)
+    if (x < 1)
+        fun_l13_n472(x)
+    else
+        fun_l13_n474(x)
+    end
+end
+
+def fun_l12_n579(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n479(x)
+    end
+end
+
+def fun_l12_n580(x)
+    if (x < 1)
+        fun_l13_n483(x)
+    else
+        fun_l13_n60(x)
+    end
+end
+
+def fun_l12_n581(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n582(x)
+    if (x < 1)
+        fun_l13_n612(x)
+    else
+        fun_l13_n491(x)
+    end
+end
+
+def fun_l12_n583(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n356(x)
+    end
+end
+
+def fun_l12_n584(x)
+    if (x < 1)
+        fun_l13_n521(x)
+    else
+        fun_l13_n126(x)
+    end
+end
+
+def fun_l12_n585(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n503(x)
+    end
+end
+
+def fun_l12_n586(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n849(x)
+    end
+end
+
+def fun_l12_n587(x)
+    if (x < 1)
+        fun_l13_n192(x)
+    else
+        fun_l13_n278(x)
+    end
+end
+
+def fun_l12_n588(x)
+    if (x < 1)
+        fun_l13_n882(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n589(x)
+    if (x < 1)
+        fun_l13_n693(x)
+    else
+        fun_l13_n734(x)
+    end
+end
+
+def fun_l12_n590(x)
+    if (x < 1)
+        fun_l13_n207(x)
+    else
+        fun_l13_n674(x)
+    end
+end
+
+def fun_l12_n591(x)
+    if (x < 1)
+        fun_l13_n409(x)
+    else
+        fun_l13_n937(x)
+    end
+end
+
+def fun_l12_n592(x)
+    if (x < 1)
+        fun_l13_n424(x)
+    else
+        fun_l13_n709(x)
+    end
+end
+
+def fun_l12_n593(x)
+    if (x < 1)
+        fun_l13_n530(x)
+    else
+        fun_l13_n50(x)
+    end
+end
+
+def fun_l12_n594(x)
+    if (x < 1)
+        fun_l13_n451(x)
+    else
+        fun_l13_n513(x)
+    end
+end
+
+def fun_l12_n595(x)
+    if (x < 1)
+        fun_l13_n522(x)
+    else
+        fun_l13_n414(x)
+    end
+end
+
+def fun_l12_n596(x)
+    if (x < 1)
+        fun_l13_n352(x)
+    else
+        fun_l13_n323(x)
+    end
+end
+
+def fun_l12_n597(x)
+    if (x < 1)
+        fun_l13_n342(x)
+    else
+        fun_l13_n362(x)
+    end
+end
+
+def fun_l12_n598(x)
+    if (x < 1)
+        fun_l13_n870(x)
+    else
+        fun_l13_n366(x)
+    end
+end
+
+def fun_l12_n599(x)
+    if (x < 1)
+        fun_l13_n562(x)
+    else
+        fun_l13_n455(x)
+    end
+end
+
+def fun_l12_n600(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n929(x)
+    end
+end
+
+def fun_l12_n601(x)
+    if (x < 1)
+        fun_l13_n498(x)
+    else
+        fun_l13_n287(x)
+    end
+end
+
+def fun_l12_n602(x)
+    if (x < 1)
+        fun_l13_n9(x)
+    else
+        fun_l13_n258(x)
+    end
+end
+
+def fun_l12_n603(x)
+    if (x < 1)
+        fun_l13_n976(x)
+    else
+        fun_l13_n604(x)
+    end
+end
+
+def fun_l12_n604(x)
+    if (x < 1)
+        fun_l13_n411(x)
+    else
+        fun_l13_n238(x)
+    end
+end
+
+def fun_l12_n605(x)
+    if (x < 1)
+        fun_l13_n80(x)
+    else
+        fun_l13_n665(x)
+    end
+end
+
+def fun_l12_n606(x)
+    if (x < 1)
+        fun_l13_n453(x)
+    else
+        fun_l13_n642(x)
+    end
+end
+
+def fun_l12_n607(x)
+    if (x < 1)
+        fun_l13_n247(x)
+    else
+        fun_l13_n651(x)
+    end
+end
+
+def fun_l12_n608(x)
+    if (x < 1)
+        fun_l13_n586(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n609(x)
+    if (x < 1)
+        fun_l13_n623(x)
+    else
+        fun_l13_n380(x)
+    end
+end
+
+def fun_l12_n610(x)
+    if (x < 1)
+        fun_l13_n399(x)
+    else
+        fun_l13_n43(x)
+    end
+end
+
+def fun_l12_n611(x)
+    if (x < 1)
+        fun_l13_n191(x)
+    else
+        fun_l13_n211(x)
+    end
+end
+
+def fun_l12_n612(x)
+    if (x < 1)
+        fun_l13_n719(x)
+    else
+        fun_l13_n663(x)
+    end
+end
+
+def fun_l12_n613(x)
+    if (x < 1)
+        fun_l13_n849(x)
+    else
+        fun_l13_n39(x)
+    end
+end
+
+def fun_l12_n614(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n927(x)
+    end
+end
+
+def fun_l12_n615(x)
+    if (x < 1)
+        fun_l13_n358(x)
+    else
+        fun_l13_n364(x)
+    end
+end
+
+def fun_l12_n616(x)
+    if (x < 1)
+        fun_l13_n685(x)
+    else
+        fun_l13_n897(x)
+    end
+end
+
+def fun_l12_n617(x)
+    if (x < 1)
+        fun_l13_n243(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n618(x)
+    if (x < 1)
+        fun_l13_n737(x)
+    else
+        fun_l13_n187(x)
+    end
+end
+
+def fun_l12_n619(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n620(x)
+    if (x < 1)
+        fun_l13_n865(x)
+    else
+        fun_l13_n886(x)
+    end
+end
+
+def fun_l12_n621(x)
+    if (x < 1)
+        fun_l13_n749(x)
+    else
+        fun_l13_n554(x)
+    end
+end
+
+def fun_l12_n622(x)
+    if (x < 1)
+        fun_l13_n162(x)
+    else
+        fun_l13_n600(x)
+    end
+end
+
+def fun_l12_n623(x)
+    if (x < 1)
+        fun_l13_n763(x)
+    else
+        fun_l13_n227(x)
+    end
+end
+
+def fun_l12_n624(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n431(x)
+    end
+end
+
+def fun_l12_n625(x)
+    if (x < 1)
+        fun_l13_n347(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n626(x)
+    if (x < 1)
+        fun_l13_n365(x)
+    else
+        fun_l13_n747(x)
+    end
+end
+
+def fun_l12_n627(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n597(x)
+    end
+end
+
+def fun_l12_n628(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n906(x)
+    end
+end
+
+def fun_l12_n629(x)
+    if (x < 1)
+        fun_l13_n803(x)
+    else
+        fun_l13_n855(x)
+    end
+end
+
+def fun_l12_n630(x)
+    if (x < 1)
+        fun_l13_n981(x)
+    else
+        fun_l13_n38(x)
+    end
+end
+
+def fun_l12_n631(x)
+    if (x < 1)
+        fun_l13_n437(x)
+    else
+        fun_l13_n158(x)
+    end
+end
+
+def fun_l12_n632(x)
+    if (x < 1)
+        fun_l13_n611(x)
+    else
+        fun_l13_n142(x)
+    end
+end
+
+def fun_l12_n633(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n172(x)
+    end
+end
+
+def fun_l12_n634(x)
+    if (x < 1)
+        fun_l13_n135(x)
+    else
+        fun_l13_n529(x)
+    end
+end
+
+def fun_l12_n635(x)
+    if (x < 1)
+        fun_l13_n694(x)
+    else
+        fun_l13_n949(x)
+    end
+end
+
+def fun_l12_n636(x)
+    if (x < 1)
+        fun_l13_n153(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n637(x)
+    if (x < 1)
+        fun_l13_n318(x)
+    else
+        fun_l13_n372(x)
+    end
+end
+
+def fun_l12_n638(x)
+    if (x < 1)
+        fun_l13_n467(x)
+    else
+        fun_l13_n450(x)
+    end
+end
+
+def fun_l12_n639(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n138(x)
+    end
+end
+
+def fun_l12_n640(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n335(x)
+    end
+end
+
+def fun_l12_n641(x)
+    if (x < 1)
+        fun_l13_n342(x)
+    else
+        fun_l13_n856(x)
+    end
+end
+
+def fun_l12_n642(x)
+    if (x < 1)
+        fun_l13_n163(x)
+    else
+        fun_l13_n979(x)
+    end
+end
+
+def fun_l12_n643(x)
+    if (x < 1)
+        fun_l13_n509(x)
+    else
+        fun_l13_n153(x)
+    end
+end
+
+def fun_l12_n644(x)
+    if (x < 1)
+        fun_l13_n3(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n645(x)
+    if (x < 1)
+        fun_l13_n730(x)
+    else
+        fun_l13_n52(x)
+    end
+end
+
+def fun_l12_n646(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n885(x)
+    end
+end
+
+def fun_l12_n647(x)
+    if (x < 1)
+        fun_l13_n866(x)
+    else
+        fun_l13_n684(x)
+    end
+end
+
+def fun_l12_n648(x)
+    if (x < 1)
+        fun_l13_n989(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n649(x)
+    if (x < 1)
+        fun_l13_n527(x)
+    else
+        fun_l13_n166(x)
+    end
+end
+
+def fun_l12_n650(x)
+    if (x < 1)
+        fun_l13_n507(x)
+    else
+        fun_l13_n527(x)
+    end
+end
+
+def fun_l12_n651(x)
+    if (x < 1)
+        fun_l13_n174(x)
+    else
+        fun_l13_n881(x)
+    end
+end
+
+def fun_l12_n652(x)
+    if (x < 1)
+        fun_l13_n302(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n653(x)
+    if (x < 1)
+        fun_l13_n971(x)
+    else
+        fun_l13_n601(x)
+    end
+end
+
+def fun_l12_n654(x)
+    if (x < 1)
+        fun_l13_n440(x)
+    else
+        fun_l13_n286(x)
+    end
+end
+
+def fun_l12_n655(x)
+    if (x < 1)
+        fun_l13_n208(x)
+    else
+        fun_l13_n275(x)
+    end
+end
+
+def fun_l12_n656(x)
+    if (x < 1)
+        fun_l13_n954(x)
+    else
+        fun_l13_n991(x)
+    end
+end
+
+def fun_l12_n657(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n640(x)
+    end
+end
+
+def fun_l12_n658(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n459(x)
+    end
+end
+
+def fun_l12_n659(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n581(x)
+    end
+end
+
+def fun_l12_n660(x)
+    if (x < 1)
+        fun_l13_n421(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n661(x)
+    if (x < 1)
+        fun_l13_n500(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n662(x)
+    if (x < 1)
+        fun_l13_n26(x)
+    else
+        fun_l13_n300(x)
+    end
+end
+
+def fun_l12_n663(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n112(x)
+    end
+end
+
+def fun_l12_n664(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n665(x)
+    if (x < 1)
+        fun_l13_n573(x)
+    else
+        fun_l13_n283(x)
+    end
+end
+
+def fun_l12_n666(x)
+    if (x < 1)
+        fun_l13_n562(x)
+    else
+        fun_l13_n992(x)
+    end
+end
+
+def fun_l12_n667(x)
+    if (x < 1)
+        fun_l13_n426(x)
+    else
+        fun_l13_n921(x)
+    end
+end
+
+def fun_l12_n668(x)
+    if (x < 1)
+        fun_l13_n319(x)
+    else
+        fun_l13_n226(x)
+    end
+end
+
+def fun_l12_n669(x)
+    if (x < 1)
+        fun_l13_n832(x)
+    else
+        fun_l13_n690(x)
+    end
+end
+
+def fun_l12_n670(x)
+    if (x < 1)
+        fun_l13_n921(x)
+    else
+        fun_l13_n964(x)
+    end
+end
+
+def fun_l12_n671(x)
+    if (x < 1)
+        fun_l13_n823(x)
+    else
+        fun_l13_n903(x)
+    end
+end
+
+def fun_l12_n672(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n673(x)
+    if (x < 1)
+        fun_l13_n478(x)
+    else
+        fun_l13_n481(x)
+    end
+end
+
+def fun_l12_n674(x)
+    if (x < 1)
+        fun_l13_n762(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n675(x)
+    if (x < 1)
+        fun_l13_n930(x)
+    else
+        fun_l13_n587(x)
+    end
+end
+
+def fun_l12_n676(x)
+    if (x < 1)
+        fun_l13_n351(x)
+    else
+        fun_l13_n239(x)
+    end
+end
+
+def fun_l12_n677(x)
+    if (x < 1)
+        fun_l13_n989(x)
+    else
+        fun_l13_n424(x)
+    end
+end
+
+def fun_l12_n678(x)
+    if (x < 1)
+        fun_l13_n505(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n679(x)
+    if (x < 1)
+        fun_l13_n665(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n680(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n36(x)
+    end
+end
+
+def fun_l12_n681(x)
+    if (x < 1)
+        fun_l13_n380(x)
+    else
+        fun_l13_n340(x)
+    end
+end
+
+def fun_l12_n682(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n205(x)
+    end
+end
+
+def fun_l12_n683(x)
+    if (x < 1)
+        fun_l13_n412(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n684(x)
+    if (x < 1)
+        fun_l13_n187(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n685(x)
+    if (x < 1)
+        fun_l13_n299(x)
+    else
+        fun_l13_n875(x)
+    end
+end
+
+def fun_l12_n686(x)
+    if (x < 1)
+        fun_l13_n943(x)
+    else
+        fun_l13_n96(x)
+    end
+end
+
+def fun_l12_n687(x)
+    if (x < 1)
+        fun_l13_n736(x)
+    else
+        fun_l13_n377(x)
+    end
+end
+
+def fun_l12_n688(x)
+    if (x < 1)
+        fun_l13_n559(x)
+    else
+        fun_l13_n410(x)
+    end
+end
+
+def fun_l12_n689(x)
+    if (x < 1)
+        fun_l13_n538(x)
+    else
+        fun_l13_n521(x)
+    end
+end
+
+def fun_l12_n690(x)
+    if (x < 1)
+        fun_l13_n568(x)
+    else
+        fun_l13_n838(x)
+    end
+end
+
+def fun_l12_n691(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n42(x)
+    end
+end
+
+def fun_l12_n692(x)
+    if (x < 1)
+        fun_l13_n137(x)
+    else
+        fun_l13_n939(x)
+    end
+end
+
+def fun_l12_n693(x)
+    if (x < 1)
+        fun_l13_n974(x)
+    else
+        fun_l13_n308(x)
+    end
+end
+
+def fun_l12_n694(x)
+    if (x < 1)
+        fun_l13_n459(x)
+    else
+        fun_l13_n323(x)
+    end
+end
+
+def fun_l12_n695(x)
+    if (x < 1)
+        fun_l13_n829(x)
+    else
+        fun_l13_n909(x)
+    end
+end
+
+def fun_l12_n696(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n648(x)
+    end
+end
+
+def fun_l12_n697(x)
+    if (x < 1)
+        fun_l13_n27(x)
+    else
+        fun_l13_n500(x)
+    end
+end
+
+def fun_l12_n698(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n865(x)
+    end
+end
+
+def fun_l12_n699(x)
+    if (x < 1)
+        fun_l13_n126(x)
+    else
+        fun_l13_n789(x)
+    end
+end
+
+def fun_l12_n700(x)
+    if (x < 1)
+        fun_l13_n408(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n701(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n48(x)
+    end
+end
+
+def fun_l12_n702(x)
+    if (x < 1)
+        fun_l13_n646(x)
+    else
+        fun_l13_n117(x)
+    end
+end
+
+def fun_l12_n703(x)
+    if (x < 1)
+        fun_l13_n461(x)
+    else
+        fun_l13_n114(x)
+    end
+end
+
+def fun_l12_n704(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n27(x)
+    end
+end
+
+def fun_l12_n705(x)
+    if (x < 1)
+        fun_l13_n842(x)
+    else
+        fun_l13_n792(x)
+    end
+end
+
+def fun_l12_n706(x)
+    if (x < 1)
+        fun_l13_n194(x)
+    else
+        fun_l13_n405(x)
+    end
+end
+
+def fun_l12_n707(x)
+    if (x < 1)
+        fun_l13_n975(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n708(x)
+    if (x < 1)
+        fun_l13_n919(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n709(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n868(x)
+    end
+end
+
+def fun_l12_n710(x)
+    if (x < 1)
+        fun_l13_n577(x)
+    else
+        fun_l13_n816(x)
+    end
+end
+
+def fun_l12_n711(x)
+    if (x < 1)
+        fun_l13_n625(x)
+    else
+        fun_l13_n319(x)
+    end
+end
+
+def fun_l12_n712(x)
+    if (x < 1)
+        fun_l13_n100(x)
+    else
+        fun_l13_n421(x)
+    end
+end
+
+def fun_l12_n713(x)
+    if (x < 1)
+        fun_l13_n120(x)
+    else
+        fun_l13_n727(x)
+    end
+end
+
+def fun_l12_n714(x)
+    if (x < 1)
+        fun_l13_n346(x)
+    else
+        fun_l13_n399(x)
+    end
+end
+
+def fun_l12_n715(x)
+    if (x < 1)
+        fun_l13_n64(x)
+    else
+        fun_l13_n895(x)
+    end
+end
+
+def fun_l12_n716(x)
+    if (x < 1)
+        fun_l13_n810(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n717(x)
+    if (x < 1)
+        fun_l13_n24(x)
+    else
+        fun_l13_n851(x)
+    end
+end
+
+def fun_l12_n718(x)
+    if (x < 1)
+        fun_l13_n716(x)
+    else
+        fun_l13_n859(x)
+    end
+end
+
+def fun_l12_n719(x)
+    if (x < 1)
+        fun_l13_n556(x)
+    else
+        fun_l13_n999(x)
+    end
+end
+
+def fun_l12_n720(x)
+    if (x < 1)
+        fun_l13_n388(x)
+    else
+        fun_l13_n127(x)
+    end
+end
+
+def fun_l12_n721(x)
+    if (x < 1)
+        fun_l13_n447(x)
+    else
+        fun_l13_n880(x)
+    end
+end
+
+def fun_l12_n722(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n636(x)
+    end
+end
+
+def fun_l12_n723(x)
+    if (x < 1)
+        fun_l13_n315(x)
+    else
+        fun_l13_n766(x)
+    end
+end
+
+def fun_l12_n724(x)
+    if (x < 1)
+        fun_l13_n600(x)
+    else
+        fun_l13_n223(x)
+    end
+end
+
+def fun_l12_n725(x)
+    if (x < 1)
+        fun_l13_n773(x)
+    else
+        fun_l13_n523(x)
+    end
+end
+
+def fun_l12_n726(x)
+    if (x < 1)
+        fun_l13_n662(x)
+    else
+        fun_l13_n775(x)
+    end
+end
+
+def fun_l12_n727(x)
+    if (x < 1)
+        fun_l13_n553(x)
+    else
+        fun_l13_n247(x)
+    end
+end
+
+def fun_l12_n728(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n815(x)
+    end
+end
+
+def fun_l12_n729(x)
+    if (x < 1)
+        fun_l13_n786(x)
+    else
+        fun_l13_n729(x)
+    end
+end
+
+def fun_l12_n730(x)
+    if (x < 1)
+        fun_l13_n1(x)
+    else
+        fun_l13_n791(x)
+    end
+end
+
+def fun_l12_n731(x)
+    if (x < 1)
+        fun_l13_n216(x)
+    else
+        fun_l13_n682(x)
+    end
+end
+
+def fun_l12_n732(x)
+    if (x < 1)
+        fun_l13_n953(x)
+    else
+        fun_l13_n364(x)
+    end
+end
+
+def fun_l12_n733(x)
+    if (x < 1)
+        fun_l13_n164(x)
+    else
+        fun_l13_n277(x)
+    end
+end
+
+def fun_l12_n734(x)
+    if (x < 1)
+        fun_l13_n486(x)
+    else
+        fun_l13_n741(x)
+    end
+end
+
+def fun_l12_n735(x)
+    if (x < 1)
+        fun_l13_n310(x)
+    else
+        fun_l13_n940(x)
+    end
+end
+
+def fun_l12_n736(x)
+    if (x < 1)
+        fun_l13_n312(x)
+    else
+        fun_l13_n46(x)
+    end
+end
+
+def fun_l12_n737(x)
+    if (x < 1)
+        fun_l13_n473(x)
+    else
+        fun_l13_n728(x)
+    end
+end
+
+def fun_l12_n738(x)
+    if (x < 1)
+        fun_l13_n602(x)
+    else
+        fun_l13_n652(x)
+    end
+end
+
+def fun_l12_n739(x)
+    if (x < 1)
+        fun_l13_n397(x)
+    else
+        fun_l13_n855(x)
+    end
+end
+
+def fun_l12_n740(x)
+    if (x < 1)
+        fun_l13_n81(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n741(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n231(x)
+    end
+end
+
+def fun_l12_n742(x)
+    if (x < 1)
+        fun_l13_n200(x)
+    else
+        fun_l13_n440(x)
+    end
+end
+
+def fun_l12_n743(x)
+    if (x < 1)
+        fun_l13_n415(x)
+    else
+        fun_l13_n631(x)
+    end
+end
+
+def fun_l12_n744(x)
+    if (x < 1)
+        fun_l13_n353(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n745(x)
+    if (x < 1)
+        fun_l13_n986(x)
+    else
+        fun_l13_n384(x)
+    end
+end
+
+def fun_l12_n746(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n583(x)
+    end
+end
+
+def fun_l12_n747(x)
+    if (x < 1)
+        fun_l13_n518(x)
+    else
+        fun_l13_n717(x)
+    end
+end
+
+def fun_l12_n748(x)
+    if (x < 1)
+        fun_l13_n242(x)
+    else
+        fun_l13_n180(x)
+    end
+end
+
+def fun_l12_n749(x)
+    if (x < 1)
+        fun_l13_n369(x)
+    else
+        fun_l13_n249(x)
+    end
+end
+
+def fun_l12_n750(x)
+    if (x < 1)
+        fun_l13_n335(x)
+    else
+        fun_l13_n180(x)
+    end
+end
+
+def fun_l12_n751(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n506(x)
+    end
+end
+
+def fun_l12_n752(x)
+    if (x < 1)
+        fun_l13_n941(x)
+    else
+        fun_l13_n251(x)
+    end
+end
+
+def fun_l12_n753(x)
+    if (x < 1)
+        fun_l13_n21(x)
+    else
+        fun_l13_n536(x)
+    end
+end
+
+def fun_l12_n754(x)
+    if (x < 1)
+        fun_l13_n123(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n755(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n535(x)
+    end
+end
+
+def fun_l12_n756(x)
+    if (x < 1)
+        fun_l13_n23(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n757(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n677(x)
+    end
+end
+
+def fun_l12_n758(x)
+    if (x < 1)
+        fun_l13_n692(x)
+    else
+        fun_l13_n334(x)
+    end
+end
+
+def fun_l12_n759(x)
+    if (x < 1)
+        fun_l13_n380(x)
+    else
+        fun_l13_n903(x)
+    end
+end
+
+def fun_l12_n760(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n750(x)
+    end
+end
+
+def fun_l12_n761(x)
+    if (x < 1)
+        fun_l13_n186(x)
+    else
+        fun_l13_n639(x)
+    end
+end
+
+def fun_l12_n762(x)
+    if (x < 1)
+        fun_l13_n163(x)
+    else
+        fun_l13_n273(x)
+    end
+end
+
+def fun_l12_n763(x)
+    if (x < 1)
+        fun_l13_n791(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n764(x)
+    if (x < 1)
+        fun_l13_n10(x)
+    else
+        fun_l13_n672(x)
+    end
+end
+
+def fun_l12_n765(x)
+    if (x < 1)
+        fun_l13_n382(x)
+    else
+        fun_l13_n284(x)
+    end
+end
+
+def fun_l12_n766(x)
+    if (x < 1)
+        fun_l13_n940(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n767(x)
+    if (x < 1)
+        fun_l13_n414(x)
+    else
+        fun_l13_n997(x)
+    end
+end
+
+def fun_l12_n768(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n511(x)
+    end
+end
+
+def fun_l12_n769(x)
+    if (x < 1)
+        fun_l13_n915(x)
+    else
+        fun_l13_n907(x)
+    end
+end
+
+def fun_l12_n770(x)
+    if (x < 1)
+        fun_l13_n508(x)
+    else
+        fun_l13_n144(x)
+    end
+end
+
+def fun_l12_n771(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n211(x)
+    end
+end
+
+def fun_l12_n772(x)
+    if (x < 1)
+        fun_l13_n571(x)
+    else
+        fun_l13_n486(x)
+    end
+end
+
+def fun_l12_n773(x)
+    if (x < 1)
+        fun_l13_n503(x)
+    else
+        fun_l13_n561(x)
+    end
+end
+
+def fun_l12_n774(x)
+    if (x < 1)
+        fun_l13_n831(x)
+    else
+        fun_l13_n608(x)
+    end
+end
+
+def fun_l12_n775(x)
+    if (x < 1)
+        fun_l13_n254(x)
+    else
+        fun_l13_n626(x)
+    end
+end
+
+def fun_l12_n776(x)
+    if (x < 1)
+        fun_l13_n155(x)
+    else
+        fun_l13_n602(x)
+    end
+end
+
+def fun_l12_n777(x)
+    if (x < 1)
+        fun_l13_n331(x)
+    else
+        fun_l13_n837(x)
+    end
+end
+
+def fun_l12_n778(x)
+    if (x < 1)
+        fun_l13_n109(x)
+    else
+        fun_l13_n558(x)
+    end
+end
+
+def fun_l12_n779(x)
+    if (x < 1)
+        fun_l13_n557(x)
+    else
+        fun_l13_n784(x)
+    end
+end
+
+def fun_l12_n780(x)
+    if (x < 1)
+        fun_l13_n719(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n781(x)
+    if (x < 1)
+        fun_l13_n63(x)
+    else
+        fun_l13_n776(x)
+    end
+end
+
+def fun_l12_n782(x)
+    if (x < 1)
+        fun_l13_n146(x)
+    else
+        fun_l13_n32(x)
+    end
+end
+
+def fun_l12_n783(x)
+    if (x < 1)
+        fun_l13_n452(x)
+    else
+        fun_l13_n621(x)
+    end
+end
+
+def fun_l12_n784(x)
+    if (x < 1)
+        fun_l13_n821(x)
+    else
+        fun_l13_n454(x)
+    end
+end
+
+def fun_l12_n785(x)
+    if (x < 1)
+        fun_l13_n943(x)
+    else
+        fun_l13_n835(x)
+    end
+end
+
+def fun_l12_n786(x)
+    if (x < 1)
+        fun_l13_n47(x)
+    else
+        fun_l13_n252(x)
+    end
+end
+
+def fun_l12_n787(x)
+    if (x < 1)
+        fun_l13_n759(x)
+    else
+        fun_l13_n820(x)
+    end
+end
+
+def fun_l12_n788(x)
+    if (x < 1)
+        fun_l13_n883(x)
+    else
+        fun_l13_n218(x)
+    end
+end
+
+def fun_l12_n789(x)
+    if (x < 1)
+        fun_l13_n10(x)
+    else
+        fun_l13_n765(x)
+    end
+end
+
+def fun_l12_n790(x)
+    if (x < 1)
+        fun_l13_n6(x)
+    else
+        fun_l13_n424(x)
+    end
+end
+
+def fun_l12_n791(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n598(x)
+    end
+end
+
+def fun_l12_n792(x)
+    if (x < 1)
+        fun_l13_n237(x)
+    else
+        fun_l13_n141(x)
+    end
+end
+
+def fun_l12_n793(x)
+    if (x < 1)
+        fun_l13_n793(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n794(x)
+    if (x < 1)
+        fun_l13_n404(x)
+    else
+        fun_l13_n864(x)
+    end
+end
+
+def fun_l12_n795(x)
+    if (x < 1)
+        fun_l13_n511(x)
+    else
+        fun_l13_n620(x)
+    end
+end
+
+def fun_l12_n796(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n330(x)
+    end
+end
+
+def fun_l12_n797(x)
+    if (x < 1)
+        fun_l13_n637(x)
+    else
+        fun_l13_n13(x)
+    end
+end
+
+def fun_l12_n798(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n799(x)
+    if (x < 1)
+        fun_l13_n715(x)
+    else
+        fun_l13_n983(x)
+    end
+end
+
+def fun_l12_n800(x)
+    if (x < 1)
+        fun_l13_n502(x)
+    else
+        fun_l13_n600(x)
+    end
+end
+
+def fun_l12_n801(x)
+    if (x < 1)
+        fun_l13_n645(x)
+    else
+        fun_l13_n713(x)
+    end
+end
+
+def fun_l12_n802(x)
+    if (x < 1)
+        fun_l13_n804(x)
+    else
+        fun_l13_n475(x)
+    end
+end
+
+def fun_l12_n803(x)
+    if (x < 1)
+        fun_l13_n286(x)
+    else
+        fun_l13_n135(x)
+    end
+end
+
+def fun_l12_n804(x)
+    if (x < 1)
+        fun_l13_n420(x)
+    else
+        fun_l13_n534(x)
+    end
+end
+
+def fun_l12_n805(x)
+    if (x < 1)
+        fun_l13_n345(x)
+    else
+        fun_l13_n833(x)
+    end
+end
+
+def fun_l12_n806(x)
+    if (x < 1)
+        fun_l13_n558(x)
+    else
+        fun_l13_n831(x)
+    end
+end
+
+def fun_l12_n807(x)
+    if (x < 1)
+        fun_l13_n82(x)
+    else
+        fun_l13_n56(x)
+    end
+end
+
+def fun_l12_n808(x)
+    if (x < 1)
+        fun_l13_n809(x)
+    else
+        fun_l13_n12(x)
+    end
+end
+
+def fun_l12_n809(x)
+    if (x < 1)
+        fun_l13_n450(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n810(x)
+    if (x < 1)
+        fun_l13_n567(x)
+    else
+        fun_l13_n437(x)
+    end
+end
+
+def fun_l12_n811(x)
+    if (x < 1)
+        fun_l13_n880(x)
+    else
+        fun_l13_n785(x)
+    end
+end
+
+def fun_l12_n812(x)
+    if (x < 1)
+        fun_l13_n585(x)
+    else
+        fun_l13_n610(x)
+    end
+end
+
+def fun_l12_n813(x)
+    if (x < 1)
+        fun_l13_n41(x)
+    else
+        fun_l13_n911(x)
+    end
+end
+
+def fun_l12_n814(x)
+    if (x < 1)
+        fun_l13_n438(x)
+    else
+        fun_l13_n300(x)
+    end
+end
+
+def fun_l12_n815(x)
+    if (x < 1)
+        fun_l13_n363(x)
+    else
+        fun_l13_n357(x)
+    end
+end
+
+def fun_l12_n816(x)
+    if (x < 1)
+        fun_l13_n172(x)
+    else
+        fun_l13_n25(x)
+    end
+end
+
+def fun_l12_n817(x)
+    if (x < 1)
+        fun_l13_n593(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n818(x)
+    if (x < 1)
+        fun_l13_n790(x)
+    else
+        fun_l13_n575(x)
+    end
+end
+
+def fun_l12_n819(x)
+    if (x < 1)
+        fun_l13_n795(x)
+    else
+        fun_l13_n877(x)
+    end
+end
+
+def fun_l12_n820(x)
+    if (x < 1)
+        fun_l13_n563(x)
+    else
+        fun_l13_n170(x)
+    end
+end
+
+def fun_l12_n821(x)
+    if (x < 1)
+        fun_l13_n405(x)
+    else
+        fun_l13_n985(x)
+    end
+end
+
+def fun_l12_n822(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n823(x)
+    if (x < 1)
+        fun_l13_n210(x)
+    else
+        fun_l13_n450(x)
+    end
+end
+
+def fun_l12_n824(x)
+    if (x < 1)
+        fun_l13_n817(x)
+    else
+        fun_l13_n693(x)
+    end
+end
+
+def fun_l12_n825(x)
+    if (x < 1)
+        fun_l13_n909(x)
+    else
+        fun_l13_n857(x)
+    end
+end
+
+def fun_l12_n826(x)
+    if (x < 1)
+        fun_l13_n944(x)
+    else
+        fun_l13_n601(x)
+    end
+end
+
+def fun_l12_n827(x)
+    if (x < 1)
+        fun_l13_n152(x)
+    else
+        fun_l13_n187(x)
+    end
+end
+
+def fun_l12_n828(x)
+    if (x < 1)
+        fun_l13_n735(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n829(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n362(x)
+    end
+end
+
+def fun_l12_n830(x)
+    if (x < 1)
+        fun_l13_n636(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n831(x)
+    if (x < 1)
+        fun_l13_n597(x)
+    else
+        fun_l13_n186(x)
+    end
+end
+
+def fun_l12_n832(x)
+    if (x < 1)
+        fun_l13_n680(x)
+    else
+        fun_l13_n477(x)
+    end
+end
+
+def fun_l12_n833(x)
+    if (x < 1)
+        fun_l13_n334(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n834(x)
+    if (x < 1)
+        fun_l13_n927(x)
+    else
+        fun_l13_n111(x)
+    end
+end
+
+def fun_l12_n835(x)
+    if (x < 1)
+        fun_l13_n424(x)
+    else
+        fun_l13_n326(x)
+    end
+end
+
+def fun_l12_n836(x)
+    if (x < 1)
+        fun_l13_n624(x)
+    else
+        fun_l13_n270(x)
+    end
+end
+
+def fun_l12_n837(x)
+    if (x < 1)
+        fun_l13_n458(x)
+    else
+        fun_l13_n736(x)
+    end
+end
+
+def fun_l12_n838(x)
+    if (x < 1)
+        fun_l13_n881(x)
+    else
+        fun_l13_n702(x)
+    end
+end
+
+def fun_l12_n839(x)
+    if (x < 1)
+        fun_l13_n778(x)
+    else
+        fun_l13_n374(x)
+    end
+end
+
+def fun_l12_n840(x)
+    if (x < 1)
+        fun_l13_n118(x)
+    else
+        fun_l13_n543(x)
+    end
+end
+
+def fun_l12_n841(x)
+    if (x < 1)
+        fun_l13_n270(x)
+    else
+        fun_l13_n810(x)
+    end
+end
+
+def fun_l12_n842(x)
+    if (x < 1)
+        fun_l13_n122(x)
+    else
+        fun_l13_n905(x)
+    end
+end
+
+def fun_l12_n843(x)
+    if (x < 1)
+        fun_l13_n154(x)
+    else
+        fun_l13_n636(x)
+    end
+end
+
+def fun_l12_n844(x)
+    if (x < 1)
+        fun_l13_n603(x)
+    else
+        fun_l13_n586(x)
+    end
+end
+
+def fun_l12_n845(x)
+    if (x < 1)
+        fun_l13_n264(x)
+    else
+        fun_l13_n492(x)
+    end
+end
+
+def fun_l12_n846(x)
+    if (x < 1)
+        fun_l13_n264(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n847(x)
+    if (x < 1)
+        fun_l13_n337(x)
+    else
+        fun_l13_n339(x)
+    end
+end
+
+def fun_l12_n848(x)
+    if (x < 1)
+        fun_l13_n83(x)
+    else
+        fun_l13_n454(x)
+    end
+end
+
+def fun_l12_n849(x)
+    if (x < 1)
+        fun_l13_n129(x)
+    else
+        fun_l13_n30(x)
+    end
+end
+
+def fun_l12_n850(x)
+    if (x < 1)
+        fun_l13_n602(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n851(x)
+    if (x < 1)
+        fun_l13_n650(x)
+    else
+        fun_l13_n715(x)
+    end
+end
+
+def fun_l12_n852(x)
+    if (x < 1)
+        fun_l13_n482(x)
+    else
+        fun_l13_n852(x)
+    end
+end
+
+def fun_l12_n853(x)
+    if (x < 1)
+        fun_l13_n946(x)
+    else
+        fun_l13_n393(x)
+    end
+end
+
+def fun_l12_n854(x)
+    if (x < 1)
+        fun_l13_n16(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n855(x)
+    if (x < 1)
+        fun_l13_n469(x)
+    else
+        fun_l13_n567(x)
+    end
+end
+
+def fun_l12_n856(x)
+    if (x < 1)
+        fun_l13_n531(x)
+    else
+        fun_l13_n39(x)
+    end
+end
+
+def fun_l12_n857(x)
+    if (x < 1)
+        fun_l13_n673(x)
+    else
+        fun_l13_n670(x)
+    end
+end
+
+def fun_l12_n858(x)
+    if (x < 1)
+        fun_l13_n83(x)
+    else
+        fun_l13_n588(x)
+    end
+end
+
+def fun_l12_n859(x)
+    if (x < 1)
+        fun_l13_n247(x)
+    else
+        fun_l13_n460(x)
+    end
+end
+
+def fun_l12_n860(x)
+    if (x < 1)
+        fun_l13_n621(x)
+    else
+        fun_l13_n229(x)
+    end
+end
+
+def fun_l12_n861(x)
+    if (x < 1)
+        fun_l13_n121(x)
+    else
+        fun_l13_n147(x)
+    end
+end
+
+def fun_l12_n862(x)
+    if (x < 1)
+        fun_l13_n293(x)
+    else
+        fun_l13_n976(x)
+    end
+end
+
+def fun_l12_n863(x)
+    if (x < 1)
+        fun_l13_n64(x)
+    else
+        fun_l13_n569(x)
+    end
+end
+
+def fun_l12_n864(x)
+    if (x < 1)
+        fun_l13_n802(x)
+    else
+        fun_l13_n962(x)
+    end
+end
+
+def fun_l12_n865(x)
+    if (x < 1)
+        fun_l13_n406(x)
+    else
+        fun_l13_n571(x)
+    end
+end
+
+def fun_l12_n866(x)
+    if (x < 1)
+        fun_l13_n798(x)
+    else
+        fun_l13_n418(x)
+    end
+end
+
+def fun_l12_n867(x)
+    if (x < 1)
+        fun_l13_n725(x)
+    else
+        fun_l13_n716(x)
+    end
+end
+
+def fun_l12_n868(x)
+    if (x < 1)
+        fun_l13_n245(x)
+    else
+        fun_l13_n154(x)
+    end
+end
+
+def fun_l12_n869(x)
+    if (x < 1)
+        fun_l13_n954(x)
+    else
+        fun_l13_n242(x)
+    end
+end
+
+def fun_l12_n870(x)
+    if (x < 1)
+        fun_l13_n649(x)
+    else
+        fun_l13_n160(x)
+    end
+end
+
+def fun_l12_n871(x)
+    if (x < 1)
+        fun_l13_n700(x)
+    else
+        fun_l13_n863(x)
+    end
+end
+
+def fun_l12_n872(x)
+    if (x < 1)
+        fun_l13_n60(x)
+    else
+        fun_l13_n359(x)
+    end
+end
+
+def fun_l12_n873(x)
+    if (x < 1)
+        fun_l13_n820(x)
+    else
+        fun_l13_n247(x)
+    end
+end
+
+def fun_l12_n874(x)
+    if (x < 1)
+        fun_l13_n294(x)
+    else
+        fun_l13_n179(x)
+    end
+end
+
+def fun_l12_n875(x)
+    if (x < 1)
+        fun_l13_n599(x)
+    else
+        fun_l13_n309(x)
+    end
+end
+
+def fun_l12_n876(x)
+    if (x < 1)
+        fun_l13_n922(x)
+    else
+        fun_l13_n632(x)
+    end
+end
+
+def fun_l12_n877(x)
+    if (x < 1)
+        fun_l13_n921(x)
+    else
+        fun_l13_n200(x)
+    end
+end
+
+def fun_l12_n878(x)
+    if (x < 1)
+        fun_l13_n375(x)
+    else
+        fun_l13_n109(x)
+    end
+end
+
+def fun_l12_n879(x)
+    if (x < 1)
+        fun_l13_n771(x)
+    else
+        fun_l13_n758(x)
+    end
+end
+
+def fun_l12_n880(x)
+    if (x < 1)
+        fun_l13_n887(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n881(x)
+    if (x < 1)
+        fun_l13_n668(x)
+    else
+        fun_l13_n508(x)
+    end
+end
+
+def fun_l12_n882(x)
+    if (x < 1)
+        fun_l13_n822(x)
+    else
+        fun_l13_n933(x)
+    end
+end
+
+def fun_l12_n883(x)
+    if (x < 1)
+        fun_l13_n328(x)
+    else
+        fun_l13_n152(x)
+    end
+end
+
+def fun_l12_n884(x)
+    if (x < 1)
+        fun_l13_n978(x)
+    else
+        fun_l13_n282(x)
+    end
+end
+
+def fun_l12_n885(x)
+    if (x < 1)
+        fun_l13_n91(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n886(x)
+    if (x < 1)
+        fun_l13_n844(x)
+    else
+        fun_l13_n254(x)
+    end
+end
+
+def fun_l12_n887(x)
+    if (x < 1)
+        fun_l13_n49(x)
+    else
+        fun_l13_n430(x)
+    end
+end
+
+def fun_l12_n888(x)
+    if (x < 1)
+        fun_l13_n653(x)
+    else
+        fun_l13_n612(x)
+    end
+end
+
+def fun_l12_n889(x)
+    if (x < 1)
+        fun_l13_n352(x)
+    else
+        fun_l13_n228(x)
+    end
+end
+
+def fun_l12_n890(x)
+    if (x < 1)
+        fun_l13_n952(x)
+    else
+        fun_l13_n505(x)
+    end
+end
+
+def fun_l12_n891(x)
+    if (x < 1)
+        fun_l13_n381(x)
+    else
+        fun_l13_n799(x)
+    end
+end
+
+def fun_l12_n892(x)
+    if (x < 1)
+        fun_l13_n160(x)
+    else
+        fun_l13_n78(x)
+    end
+end
+
+def fun_l12_n893(x)
+    if (x < 1)
+        fun_l13_n554(x)
+    else
+        fun_l13_n383(x)
+    end
+end
+
+def fun_l12_n894(x)
+    if (x < 1)
+        fun_l13_n475(x)
+    else
+        fun_l13_n853(x)
+    end
+end
+
+def fun_l12_n895(x)
+    if (x < 1)
+        fun_l13_n588(x)
+    else
+        fun_l13_n452(x)
+    end
+end
+
+def fun_l12_n896(x)
+    if (x < 1)
+        fun_l13_n991(x)
+    else
+        fun_l13_n758(x)
+    end
+end
+
+def fun_l12_n897(x)
+    if (x < 1)
+        fun_l13_n808(x)
+    else
+        fun_l13_n742(x)
+    end
+end
+
+def fun_l12_n898(x)
+    if (x < 1)
+        fun_l13_n654(x)
+    else
+        fun_l13_n772(x)
+    end
+end
+
+def fun_l12_n899(x)
+    if (x < 1)
+        fun_l13_n365(x)
+    else
+        fun_l13_n3(x)
+    end
+end
+
+def fun_l12_n900(x)
+    if (x < 1)
+        fun_l13_n322(x)
+    else
+        fun_l13_n143(x)
+    end
+end
+
+def fun_l12_n901(x)
+    if (x < 1)
+        fun_l13_n833(x)
+    else
+        fun_l13_n19(x)
+    end
+end
+
+def fun_l12_n902(x)
+    if (x < 1)
+        fun_l13_n796(x)
+    else
+        fun_l13_n140(x)
+    end
+end
+
+def fun_l12_n903(x)
+    if (x < 1)
+        fun_l13_n866(x)
+    else
+        fun_l13_n227(x)
+    end
+end
+
+def fun_l12_n904(x)
+    if (x < 1)
+        fun_l13_n814(x)
+    else
+        fun_l13_n714(x)
+    end
+end
+
+def fun_l12_n905(x)
+    if (x < 1)
+        fun_l13_n841(x)
+    else
+        fun_l13_n802(x)
+    end
+end
+
+def fun_l12_n906(x)
+    if (x < 1)
+        fun_l13_n212(x)
+    else
+        fun_l13_n14(x)
+    end
+end
+
+def fun_l12_n907(x)
+    if (x < 1)
+        fun_l13_n35(x)
+    else
+        fun_l13_n952(x)
+    end
+end
+
+def fun_l12_n908(x)
+    if (x < 1)
+        fun_l13_n181(x)
+    else
+        fun_l13_n539(x)
+    end
+end
+
+def fun_l12_n909(x)
+    if (x < 1)
+        fun_l13_n770(x)
+    else
+        fun_l13_n80(x)
+    end
+end
+
+def fun_l12_n910(x)
+    if (x < 1)
+        fun_l13_n421(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n911(x)
+    if (x < 1)
+        fun_l13_n710(x)
+    else
+        fun_l13_n666(x)
+    end
+end
+
+def fun_l12_n912(x)
+    if (x < 1)
+        fun_l13_n319(x)
+    else
+        fun_l13_n491(x)
+    end
+end
+
+def fun_l12_n913(x)
+    if (x < 1)
+        fun_l13_n924(x)
+    else
+        fun_l13_n198(x)
+    end
+end
+
+def fun_l12_n914(x)
+    if (x < 1)
+        fun_l13_n707(x)
+    else
+        fun_l13_n91(x)
+    end
+end
+
+def fun_l12_n915(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n134(x)
+    end
+end
+
+def fun_l12_n916(x)
+    if (x < 1)
+        fun_l13_n314(x)
+    else
+        fun_l13_n831(x)
+    end
+end
+
+def fun_l12_n917(x)
+    if (x < 1)
+        fun_l13_n986(x)
+    else
+        fun_l13_n732(x)
+    end
+end
+
+def fun_l12_n918(x)
+    if (x < 1)
+        fun_l13_n787(x)
+    else
+        fun_l13_n232(x)
+    end
+end
+
+def fun_l12_n919(x)
+    if (x < 1)
+        fun_l13_n452(x)
+    else
+        fun_l13_n386(x)
+    end
+end
+
+def fun_l12_n920(x)
+    if (x < 1)
+        fun_l13_n12(x)
+    else
+        fun_l13_n264(x)
+    end
+end
+
+def fun_l12_n921(x)
+    if (x < 1)
+        fun_l13_n734(x)
+    else
+        fun_l13_n885(x)
+    end
+end
+
+def fun_l12_n922(x)
+    if (x < 1)
+        fun_l13_n180(x)
+    else
+        fun_l13_n509(x)
+    end
+end
+
+def fun_l12_n923(x)
+    if (x < 1)
+        fun_l13_n783(x)
+    else
+        fun_l13_n212(x)
+    end
+end
+
+def fun_l12_n924(x)
+    if (x < 1)
+        fun_l13_n623(x)
+    else
+        fun_l13_n159(x)
+    end
+end
+
+def fun_l12_n925(x)
+    if (x < 1)
+        fun_l13_n361(x)
+    else
+        fun_l13_n47(x)
+    end
+end
+
+def fun_l12_n926(x)
+    if (x < 1)
+        fun_l13_n355(x)
+    else
+        fun_l13_n337(x)
+    end
+end
+
+def fun_l12_n927(x)
+    if (x < 1)
+        fun_l13_n892(x)
+    else
+        fun_l13_n814(x)
+    end
+end
+
+def fun_l12_n928(x)
+    if (x < 1)
+        fun_l13_n173(x)
+    else
+        fun_l13_n613(x)
+    end
+end
+
+def fun_l12_n929(x)
+    if (x < 1)
+        fun_l13_n140(x)
+    else
+        fun_l13_n782(x)
+    end
+end
+
+def fun_l12_n930(x)
+    if (x < 1)
+        fun_l13_n964(x)
+    else
+        fun_l13_n830(x)
+    end
+end
+
+def fun_l12_n931(x)
+    if (x < 1)
+        fun_l13_n110(x)
+    else
+        fun_l13_n767(x)
+    end
+end
+
+def fun_l12_n932(x)
+    if (x < 1)
+        fun_l13_n738(x)
+    else
+        fun_l13_n73(x)
+    end
+end
+
+def fun_l12_n933(x)
+    if (x < 1)
+        fun_l13_n92(x)
+    else
+        fun_l13_n113(x)
+    end
+end
+
+def fun_l12_n934(x)
+    if (x < 1)
+        fun_l13_n377(x)
+    else
+        fun_l13_n464(x)
+    end
+end
+
+def fun_l12_n935(x)
+    if (x < 1)
+        fun_l13_n544(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n936(x)
+    if (x < 1)
+        fun_l13_n36(x)
+    else
+        fun_l13_n343(x)
+    end
+end
+
+def fun_l12_n937(x)
+    if (x < 1)
+        fun_l13_n745(x)
+    else
+        fun_l13_n342(x)
+    end
+end
+
+def fun_l12_n938(x)
+    if (x < 1)
+        fun_l13_n238(x)
+    else
+        fun_l13_n703(x)
+    end
+end
+
+def fun_l12_n939(x)
+    if (x < 1)
+        fun_l13_n229(x)
+    else
+        fun_l13_n118(x)
+    end
+end
+
+def fun_l12_n940(x)
+    if (x < 1)
+        fun_l13_n90(x)
+    else
+        fun_l13_n0(x)
+    end
+end
+
+def fun_l12_n941(x)
+    if (x < 1)
+        fun_l13_n586(x)
+    else
+        fun_l13_n99(x)
+    end
+end
+
+def fun_l12_n942(x)
+    if (x < 1)
+        fun_l13_n755(x)
+    else
+        fun_l13_n573(x)
+    end
+end
+
+def fun_l12_n943(x)
+    if (x < 1)
+        fun_l13_n74(x)
+    else
+        fun_l13_n805(x)
+    end
+end
+
+def fun_l12_n944(x)
+    if (x < 1)
+        fun_l13_n574(x)
+    else
+        fun_l13_n876(x)
+    end
+end
+
+def fun_l12_n945(x)
+    if (x < 1)
+        fun_l13_n0(x)
+    else
+        fun_l13_n478(x)
+    end
+end
+
+def fun_l12_n946(x)
+    if (x < 1)
+        fun_l13_n536(x)
+    else
+        fun_l13_n957(x)
+    end
+end
+
+def fun_l12_n947(x)
+    if (x < 1)
+        fun_l13_n644(x)
+    else
+        fun_l13_n285(x)
+    end
+end
+
+def fun_l12_n948(x)
+    if (x < 1)
+        fun_l13_n215(x)
+    else
+        fun_l13_n914(x)
+    end
+end
+
+def fun_l12_n949(x)
+    if (x < 1)
+        fun_l13_n265(x)
+    else
+        fun_l13_n262(x)
+    end
+end
+
+def fun_l12_n950(x)
+    if (x < 1)
+        fun_l13_n44(x)
+    else
+        fun_l13_n917(x)
+    end
+end
+
+def fun_l12_n951(x)
+    if (x < 1)
+        fun_l13_n222(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n952(x)
+    if (x < 1)
+        fun_l13_n149(x)
+    else
+        fun_l13_n11(x)
+    end
+end
+
+def fun_l12_n953(x)
+    if (x < 1)
+        fun_l13_n827(x)
+    else
+        fun_l13_n737(x)
+    end
+end
+
+def fun_l12_n954(x)
+    if (x < 1)
+        fun_l13_n655(x)
+    else
+        fun_l13_n308(x)
+    end
+end
+
+def fun_l12_n955(x)
+    if (x < 1)
+        fun_l13_n108(x)
+    else
+        fun_l13_n940(x)
+    end
+end
+
+def fun_l12_n956(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n259(x)
+    end
+end
+
+def fun_l12_n957(x)
+    if (x < 1)
+        fun_l13_n886(x)
+    else
+        fun_l13_n955(x)
+    end
+end
+
+def fun_l12_n958(x)
+    if (x < 1)
+        fun_l13_n688(x)
+    else
+        fun_l13_n391(x)
+    end
+end
+
+def fun_l12_n959(x)
+    if (x < 1)
+        fun_l13_n521(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n960(x)
+    if (x < 1)
+        fun_l13_n877(x)
+    else
+        fun_l13_n808(x)
+    end
+end
+
+def fun_l12_n961(x)
+    if (x < 1)
+        fun_l13_n29(x)
+    else
+        fun_l13_n422(x)
+    end
+end
+
+def fun_l12_n962(x)
+    if (x < 1)
+        fun_l13_n417(x)
+    else
+        fun_l13_n310(x)
+    end
+end
+
+def fun_l12_n963(x)
+    if (x < 1)
+        fun_l13_n987(x)
+    else
+        fun_l13_n462(x)
+    end
+end
+
+def fun_l12_n964(x)
+    if (x < 1)
+        fun_l13_n914(x)
+    else
+        fun_l13_n115(x)
+    end
+end
+
+def fun_l12_n965(x)
+    if (x < 1)
+        fun_l13_n895(x)
+    else
+        fun_l13_n504(x)
+    end
+end
+
+def fun_l12_n966(x)
+    if (x < 1)
+        fun_l13_n304(x)
+    else
+        fun_l13_n788(x)
+    end
+end
+
+def fun_l12_n967(x)
+    if (x < 1)
+        fun_l13_n354(x)
+    else
+        fun_l13_n592(x)
+    end
+end
+
+def fun_l12_n968(x)
+    if (x < 1)
+        fun_l13_n231(x)
+    else
+        fun_l13_n214(x)
+    end
+end
+
+def fun_l12_n969(x)
+    if (x < 1)
+        fun_l13_n435(x)
+    else
+        fun_l13_n779(x)
+    end
+end
+
+def fun_l12_n970(x)
+    if (x < 1)
+        fun_l13_n261(x)
+    else
+        fun_l13_n139(x)
+    end
+end
+
+def fun_l12_n971(x)
+    if (x < 1)
+        fun_l13_n320(x)
+    else
+        fun_l13_n749(x)
+    end
+end
+
+def fun_l12_n972(x)
+    if (x < 1)
+        fun_l13_n56(x)
+    else
+        fun_l13_n207(x)
+    end
+end
+
+def fun_l12_n973(x)
+    if (x < 1)
+        fun_l13_n238(x)
+    else
+        fun_l13_n637(x)
+    end
+end
+
+def fun_l12_n974(x)
+    if (x < 1)
+        fun_l13_n474(x)
+    else
+        fun_l13_n512(x)
+    end
+end
+
+def fun_l12_n975(x)
+    if (x < 1)
+        fun_l13_n552(x)
+    else
+        fun_l13_n355(x)
+    end
+end
+
+def fun_l12_n976(x)
+    if (x < 1)
+        fun_l13_n127(x)
+    else
+        fun_l13_n571(x)
+    end
+end
+
+def fun_l12_n977(x)
+    if (x < 1)
+        fun_l13_n261(x)
+    else
+        fun_l13_n845(x)
+    end
+end
+
+def fun_l12_n978(x)
+    if (x < 1)
+        fun_l13_n280(x)
+    else
+        fun_l13_n465(x)
+    end
+end
+
+def fun_l12_n979(x)
+    if (x < 1)
+        fun_l13_n249(x)
+    else
+        fun_l13_n66(x)
+    end
+end
+
+def fun_l12_n980(x)
+    if (x < 1)
+        fun_l13_n306(x)
+    else
+        fun_l13_n53(x)
+    end
+end
+
+def fun_l12_n981(x)
+    if (x < 1)
+        fun_l13_n827(x)
+    else
+        fun_l13_n395(x)
+    end
+end
+
+def fun_l12_n982(x)
+    if (x < 1)
+        fun_l13_n858(x)
+    else
+        fun_l13_n644(x)
+    end
+end
+
+def fun_l12_n983(x)
+    if (x < 1)
+        fun_l13_n50(x)
+    else
+        fun_l13_n671(x)
+    end
+end
+
+def fun_l12_n984(x)
+    if (x < 1)
+        fun_l13_n629(x)
+    else
+        fun_l13_n55(x)
+    end
+end
+
+def fun_l12_n985(x)
+    if (x < 1)
+        fun_l13_n73(x)
+    else
+        fun_l13_n958(x)
+    end
+end
+
+def fun_l12_n986(x)
+    if (x < 1)
+        fun_l13_n197(x)
+    else
+        fun_l13_n444(x)
+    end
+end
+
+def fun_l12_n987(x)
+    if (x < 1)
+        fun_l13_n108(x)
+    else
+        fun_l13_n898(x)
+    end
+end
+
+def fun_l12_n988(x)
+    if (x < 1)
+        fun_l13_n153(x)
+    else
+        fun_l13_n278(x)
+    end
+end
+
+def fun_l12_n989(x)
+    if (x < 1)
+        fun_l13_n764(x)
+    else
+        fun_l13_n712(x)
+    end
+end
+
+def fun_l12_n990(x)
+    if (x < 1)
+        fun_l13_n711(x)
+    else
+        fun_l13_n825(x)
+    end
+end
+
+def fun_l12_n991(x)
+    if (x < 1)
+        fun_l13_n767(x)
+    else
+        fun_l13_n169(x)
+    end
+end
+
+def fun_l12_n992(x)
+    if (x < 1)
+        fun_l13_n917(x)
+    else
+        fun_l13_n524(x)
+    end
+end
+
+def fun_l12_n993(x)
+    if (x < 1)
+        fun_l13_n589(x)
+    else
+        fun_l13_n695(x)
+    end
+end
+
+def fun_l12_n994(x)
+    if (x < 1)
+        fun_l13_n733(x)
+    else
+        fun_l13_n764(x)
+    end
+end
+
+def fun_l12_n995(x)
+    if (x < 1)
+        fun_l13_n86(x)
+    else
+        fun_l13_n547(x)
+    end
+end
+
+def fun_l12_n996(x)
+    if (x < 1)
+        fun_l13_n236(x)
+    else
+        fun_l13_n197(x)
+    end
+end
+
+def fun_l12_n997(x)
+    if (x < 1)
+        fun_l13_n592(x)
+    else
+        fun_l13_n313(x)
+    end
+end
+
+def fun_l12_n998(x)
+    if (x < 1)
+        fun_l13_n878(x)
+    else
+        fun_l13_n439(x)
+    end
+end
+
+def fun_l12_n999(x)
+    if (x < 1)
+        fun_l13_n904(x)
+    else
+        fun_l13_n651(x)
+    end
+end
+
+def fun_l13_n0(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n1(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n170(x)
+    end
+end
+
+def fun_l13_n2(x)
+    if (x < 1)
+        fun_l14_n773(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n3(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n304(x)
+    end
+end
+
+def fun_l13_n4(x)
+    if (x < 1)
+        fun_l14_n395(x)
+    else
+        fun_l14_n187(x)
+    end
+end
+
+def fun_l13_n5(x)
+    if (x < 1)
+        fun_l14_n60(x)
+    else
+        fun_l14_n165(x)
+    end
+end
+
+def fun_l13_n6(x)
+    if (x < 1)
+        fun_l14_n711(x)
+    else
+        fun_l14_n815(x)
+    end
+end
+
+def fun_l13_n7(x)
+    if (x < 1)
+        fun_l14_n396(x)
+    else
+        fun_l14_n614(x)
+    end
+end
+
+def fun_l13_n8(x)
+    if (x < 1)
+        fun_l14_n477(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n9(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n10(x)
+    if (x < 1)
+        fun_l14_n261(x)
+    else
+        fun_l14_n324(x)
+    end
+end
+
+def fun_l13_n11(x)
+    if (x < 1)
+        fun_l14_n485(x)
+    else
+        fun_l14_n302(x)
+    end
+end
+
+def fun_l13_n12(x)
+    if (x < 1)
+        fun_l14_n324(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n13(x)
+    if (x < 1)
+        fun_l14_n811(x)
+    else
+        fun_l14_n357(x)
+    end
+end
+
+def fun_l13_n14(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n763(x)
+    end
+end
+
+def fun_l13_n15(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n557(x)
+    end
+end
+
+def fun_l13_n16(x)
+    if (x < 1)
+        fun_l14_n406(x)
+    else
+        fun_l14_n200(x)
+    end
+end
+
+def fun_l13_n17(x)
+    if (x < 1)
+        fun_l14_n500(x)
+    else
+        fun_l14_n480(x)
+    end
+end
+
+def fun_l13_n18(x)
+    if (x < 1)
+        fun_l14_n215(x)
+    else
+        fun_l14_n241(x)
+    end
+end
+
+def fun_l13_n19(x)
+    if (x < 1)
+        fun_l14_n341(x)
+    else
+        fun_l14_n142(x)
+    end
+end
+
+def fun_l13_n20(x)
+    if (x < 1)
+        fun_l14_n649(x)
+    else
+        fun_l14_n853(x)
+    end
+end
+
+def fun_l13_n21(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n295(x)
+    end
+end
+
+def fun_l13_n22(x)
+    if (x < 1)
+        fun_l14_n210(x)
+    else
+        fun_l14_n947(x)
+    end
+end
+
+def fun_l13_n23(x)
+    if (x < 1)
+        fun_l14_n764(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n24(x)
+    if (x < 1)
+        fun_l14_n96(x)
+    else
+        fun_l14_n359(x)
+    end
+end
+
+def fun_l13_n25(x)
+    if (x < 1)
+        fun_l14_n542(x)
+    else
+        fun_l14_n506(x)
+    end
+end
+
+def fun_l13_n26(x)
+    if (x < 1)
+        fun_l14_n583(x)
+    else
+        fun_l14_n754(x)
+    end
+end
+
+def fun_l13_n27(x)
+    if (x < 1)
+        fun_l14_n881(x)
+    else
+        fun_l14_n693(x)
+    end
+end
+
+def fun_l13_n28(x)
+    if (x < 1)
+        fun_l14_n385(x)
+    else
+        fun_l14_n628(x)
+    end
+end
+
+def fun_l13_n29(x)
+    if (x < 1)
+        fun_l14_n429(x)
+    else
+        fun_l14_n370(x)
+    end
+end
+
+def fun_l13_n30(x)
+    if (x < 1)
+        fun_l14_n484(x)
+    else
+        fun_l14_n724(x)
+    end
+end
+
+def fun_l13_n31(x)
+    if (x < 1)
+        fun_l14_n328(x)
+    else
+        fun_l14_n857(x)
+    end
+end
+
+def fun_l13_n32(x)
+    if (x < 1)
+        fun_l14_n367(x)
+    else
+        fun_l14_n441(x)
+    end
+end
+
+def fun_l13_n33(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n390(x)
+    end
+end
+
+def fun_l13_n34(x)
+    if (x < 1)
+        fun_l14_n935(x)
+    else
+        fun_l14_n46(x)
+    end
+end
+
+def fun_l13_n35(x)
+    if (x < 1)
+        fun_l14_n274(x)
+    else
+        fun_l14_n536(x)
+    end
+end
+
+def fun_l13_n36(x)
+    if (x < 1)
+        fun_l14_n645(x)
+    else
+        fun_l14_n396(x)
+    end
+end
+
+def fun_l13_n37(x)
+    if (x < 1)
+        fun_l14_n905(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n38(x)
+    if (x < 1)
+        fun_l14_n562(x)
+    else
+        fun_l14_n983(x)
+    end
+end
+
+def fun_l13_n39(x)
+    if (x < 1)
+        fun_l14_n846(x)
+    else
+        fun_l14_n140(x)
+    end
+end
+
+def fun_l13_n40(x)
+    if (x < 1)
+        fun_l14_n308(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n41(x)
+    if (x < 1)
+        fun_l14_n299(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n42(x)
+    if (x < 1)
+        fun_l14_n266(x)
+    else
+        fun_l14_n368(x)
+    end
+end
+
+def fun_l13_n43(x)
+    if (x < 1)
+        fun_l14_n216(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n44(x)
+    if (x < 1)
+        fun_l14_n30(x)
+    else
+        fun_l14_n118(x)
+    end
+end
+
+def fun_l13_n45(x)
+    if (x < 1)
+        fun_l14_n66(x)
+    else
+        fun_l14_n677(x)
+    end
+end
+
+def fun_l13_n46(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n311(x)
+    end
+end
+
+def fun_l13_n47(x)
+    if (x < 1)
+        fun_l14_n63(x)
+    else
+        fun_l14_n410(x)
+    end
+end
+
+def fun_l13_n48(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n49(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n50(x)
+    if (x < 1)
+        fun_l14_n102(x)
+    else
+        fun_l14_n791(x)
+    end
+end
+
+def fun_l13_n51(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n52(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n653(x)
+    end
+end
+
+def fun_l13_n53(x)
+    if (x < 1)
+        fun_l14_n842(x)
+    else
+        fun_l14_n780(x)
+    end
+end
+
+def fun_l13_n54(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n55(x)
+    if (x < 1)
+        fun_l14_n745(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n56(x)
+    if (x < 1)
+        fun_l14_n688(x)
+    else
+        fun_l14_n930(x)
+    end
+end
+
+def fun_l13_n57(x)
+    if (x < 1)
+        fun_l14_n58(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n58(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n59(x)
+    if (x < 1)
+        fun_l14_n334(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n60(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n61(x)
+    if (x < 1)
+        fun_l14_n696(x)
+    else
+        fun_l14_n973(x)
+    end
+end
+
+def fun_l13_n62(x)
+    if (x < 1)
+        fun_l14_n378(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n63(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n100(x)
+    end
+end
+
+def fun_l13_n64(x)
+    if (x < 1)
+        fun_l14_n105(x)
+    else
+        fun_l14_n393(x)
+    end
+end
+
+def fun_l13_n65(x)
+    if (x < 1)
+        fun_l14_n833(x)
+    else
+        fun_l14_n424(x)
+    end
+end
+
+def fun_l13_n66(x)
+    if (x < 1)
+        fun_l14_n125(x)
+    else
+        fun_l14_n697(x)
+    end
+end
+
+def fun_l13_n67(x)
+    if (x < 1)
+        fun_l14_n684(x)
+    else
+        fun_l14_n458(x)
+    end
+end
+
+def fun_l13_n68(x)
+    if (x < 1)
+        fun_l14_n301(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n69(x)
+    if (x < 1)
+        fun_l14_n131(x)
+    else
+        fun_l14_n552(x)
+    end
+end
+
+def fun_l13_n70(x)
+    if (x < 1)
+        fun_l14_n425(x)
+    else
+        fun_l14_n241(x)
+    end
+end
+
+def fun_l13_n71(x)
+    if (x < 1)
+        fun_l14_n531(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n72(x)
+    if (x < 1)
+        fun_l14_n801(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n73(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n294(x)
+    end
+end
+
+def fun_l13_n74(x)
+    if (x < 1)
+        fun_l14_n715(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n75(x)
+    if (x < 1)
+        fun_l14_n932(x)
+    else
+        fun_l14_n928(x)
+    end
+end
+
+def fun_l13_n76(x)
+    if (x < 1)
+        fun_l14_n930(x)
+    else
+        fun_l14_n102(x)
+    end
+end
+
+def fun_l13_n77(x)
+    if (x < 1)
+        fun_l14_n293(x)
+    else
+        fun_l14_n301(x)
+    end
+end
+
+def fun_l13_n78(x)
+    if (x < 1)
+        fun_l14_n270(x)
+    else
+        fun_l14_n715(x)
+    end
+end
+
+def fun_l13_n79(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n589(x)
+    end
+end
+
+def fun_l13_n80(x)
+    if (x < 1)
+        fun_l14_n337(x)
+    else
+        fun_l14_n940(x)
+    end
+end
+
+def fun_l13_n81(x)
+    if (x < 1)
+        fun_l14_n394(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n82(x)
+    if (x < 1)
+        fun_l14_n468(x)
+    else
+        fun_l14_n816(x)
+    end
+end
+
+def fun_l13_n83(x)
+    if (x < 1)
+        fun_l14_n517(x)
+    else
+        fun_l14_n633(x)
+    end
+end
+
+def fun_l13_n84(x)
+    if (x < 1)
+        fun_l14_n312(x)
+    else
+        fun_l14_n473(x)
+    end
+end
+
+def fun_l13_n85(x)
+    if (x < 1)
+        fun_l14_n377(x)
+    else
+        fun_l14_n616(x)
+    end
+end
+
+def fun_l13_n86(x)
+    if (x < 1)
+        fun_l14_n541(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n87(x)
+    if (x < 1)
+        fun_l14_n66(x)
+    else
+        fun_l14_n162(x)
+    end
+end
+
+def fun_l13_n88(x)
+    if (x < 1)
+        fun_l14_n202(x)
+    else
+        fun_l14_n158(x)
+    end
+end
+
+def fun_l13_n89(x)
+    if (x < 1)
+        fun_l14_n549(x)
+    else
+        fun_l14_n947(x)
+    end
+end
+
+def fun_l13_n90(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n747(x)
+    end
+end
+
+def fun_l13_n91(x)
+    if (x < 1)
+        fun_l14_n374(x)
+    else
+        fun_l14_n738(x)
+    end
+end
+
+def fun_l13_n92(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n673(x)
+    end
+end
+
+def fun_l13_n93(x)
+    if (x < 1)
+        fun_l14_n405(x)
+    else
+        fun_l14_n562(x)
+    end
+end
+
+def fun_l13_n94(x)
+    if (x < 1)
+        fun_l14_n766(x)
+    else
+        fun_l14_n466(x)
+    end
+end
+
+def fun_l13_n95(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n96(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n964(x)
+    end
+end
+
+def fun_l13_n97(x)
+    if (x < 1)
+        fun_l14_n529(x)
+    else
+        fun_l14_n374(x)
+    end
+end
+
+def fun_l13_n98(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n464(x)
+    end
+end
+
+def fun_l13_n99(x)
+    if (x < 1)
+        fun_l14_n849(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n100(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n421(x)
+    end
+end
+
+def fun_l13_n101(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n392(x)
+    end
+end
+
+def fun_l13_n102(x)
+    if (x < 1)
+        fun_l14_n8(x)
+    else
+        fun_l14_n913(x)
+    end
+end
+
+def fun_l13_n103(x)
+    if (x < 1)
+        fun_l14_n498(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n104(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n83(x)
+    end
+end
+
+def fun_l13_n105(x)
+    if (x < 1)
+        fun_l14_n943(x)
+    else
+        fun_l14_n358(x)
+    end
+end
+
+def fun_l13_n106(x)
+    if (x < 1)
+        fun_l14_n252(x)
+    else
+        fun_l14_n626(x)
+    end
+end
+
+def fun_l13_n107(x)
+    if (x < 1)
+        fun_l14_n495(x)
+    else
+        fun_l14_n627(x)
+    end
+end
+
+def fun_l13_n108(x)
+    if (x < 1)
+        fun_l14_n286(x)
+    else
+        fun_l14_n500(x)
+    end
+end
+
+def fun_l13_n109(x)
+    if (x < 1)
+        fun_l14_n927(x)
+    else
+        fun_l14_n627(x)
+    end
+end
+
+def fun_l13_n110(x)
+    if (x < 1)
+        fun_l14_n103(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n111(x)
+    if (x < 1)
+        fun_l14_n730(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n112(x)
+    if (x < 1)
+        fun_l14_n188(x)
+    else
+        fun_l14_n145(x)
+    end
+end
+
+def fun_l13_n113(x)
+    if (x < 1)
+        fun_l14_n361(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n114(x)
+    if (x < 1)
+        fun_l14_n629(x)
+    else
+        fun_l14_n536(x)
+    end
+end
+
+def fun_l13_n115(x)
+    if (x < 1)
+        fun_l14_n276(x)
+    else
+        fun_l14_n244(x)
+    end
+end
+
+def fun_l13_n116(x)
+    if (x < 1)
+        fun_l14_n512(x)
+    else
+        fun_l14_n578(x)
+    end
+end
+
+def fun_l13_n117(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n437(x)
+    end
+end
+
+def fun_l13_n118(x)
+    if (x < 1)
+        fun_l14_n855(x)
+    else
+        fun_l14_n617(x)
+    end
+end
+
+def fun_l13_n119(x)
+    if (x < 1)
+        fun_l14_n467(x)
+    else
+        fun_l14_n594(x)
+    end
+end
+
+def fun_l13_n120(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n765(x)
+    end
+end
+
+def fun_l13_n121(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n189(x)
+    end
+end
+
+def fun_l13_n122(x)
+    if (x < 1)
+        fun_l14_n731(x)
+    else
+        fun_l14_n469(x)
+    end
+end
+
+def fun_l13_n123(x)
+    if (x < 1)
+        fun_l14_n6(x)
+    else
+        fun_l14_n451(x)
+    end
+end
+
+def fun_l13_n124(x)
+    if (x < 1)
+        fun_l14_n402(x)
+    else
+        fun_l14_n445(x)
+    end
+end
+
+def fun_l13_n125(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n551(x)
+    end
+end
+
+def fun_l13_n126(x)
+    if (x < 1)
+        fun_l14_n295(x)
+    else
+        fun_l14_n180(x)
+    end
+end
+
+def fun_l13_n127(x)
+    if (x < 1)
+        fun_l14_n873(x)
+    else
+        fun_l14_n209(x)
+    end
+end
+
+def fun_l13_n128(x)
+    if (x < 1)
+        fun_l14_n181(x)
+    else
+        fun_l14_n198(x)
+    end
+end
+
+def fun_l13_n129(x)
+    if (x < 1)
+        fun_l14_n817(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n130(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n429(x)
+    end
+end
+
+def fun_l13_n131(x)
+    if (x < 1)
+        fun_l14_n573(x)
+    else
+        fun_l14_n120(x)
+    end
+end
+
+def fun_l13_n132(x)
+    if (x < 1)
+        fun_l14_n433(x)
+    else
+        fun_l14_n668(x)
+    end
+end
+
+def fun_l13_n133(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n134(x)
+    if (x < 1)
+        fun_l14_n280(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n135(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n612(x)
+    end
+end
+
+def fun_l13_n136(x)
+    if (x < 1)
+        fun_l14_n55(x)
+    else
+        fun_l14_n684(x)
+    end
+end
+
+def fun_l13_n137(x)
+    if (x < 1)
+        fun_l14_n458(x)
+    else
+        fun_l14_n107(x)
+    end
+end
+
+def fun_l13_n138(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n189(x)
+    end
+end
+
+def fun_l13_n139(x)
+    if (x < 1)
+        fun_l14_n877(x)
+    else
+        fun_l14_n862(x)
+    end
+end
+
+def fun_l13_n140(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n141(x)
+    if (x < 1)
+        fun_l14_n817(x)
+    else
+        fun_l14_n121(x)
+    end
+end
+
+def fun_l13_n142(x)
+    if (x < 1)
+        fun_l14_n523(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n143(x)
+    if (x < 1)
+        fun_l14_n893(x)
+    else
+        fun_l14_n187(x)
+    end
+end
+
+def fun_l13_n144(x)
+    if (x < 1)
+        fun_l14_n921(x)
+    else
+        fun_l14_n253(x)
+    end
+end
+
+def fun_l13_n145(x)
+    if (x < 1)
+        fun_l14_n0(x)
+    else
+        fun_l14_n608(x)
+    end
+end
+
+def fun_l13_n146(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n450(x)
+    end
+end
+
+def fun_l13_n147(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n148(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n149(x)
+    if (x < 1)
+        fun_l14_n449(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n150(x)
+    if (x < 1)
+        fun_l14_n601(x)
+    else
+        fun_l14_n442(x)
+    end
+end
+
+def fun_l13_n151(x)
+    if (x < 1)
+        fun_l14_n96(x)
+    else
+        fun_l14_n552(x)
+    end
+end
+
+def fun_l13_n152(x)
+    if (x < 1)
+        fun_l14_n667(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n153(x)
+    if (x < 1)
+        fun_l14_n445(x)
+    else
+        fun_l14_n81(x)
+    end
+end
+
+def fun_l13_n154(x)
+    if (x < 1)
+        fun_l14_n906(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n155(x)
+    if (x < 1)
+        fun_l14_n781(x)
+    else
+        fun_l14_n763(x)
+    end
+end
+
+def fun_l13_n156(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n886(x)
+    end
+end
+
+def fun_l13_n157(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n158(x)
+    if (x < 1)
+        fun_l14_n114(x)
+    else
+        fun_l14_n23(x)
+    end
+end
+
+def fun_l13_n159(x)
+    if (x < 1)
+        fun_l14_n967(x)
+    else
+        fun_l14_n885(x)
+    end
+end
+
+def fun_l13_n160(x)
+    if (x < 1)
+        fun_l14_n563(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n161(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n162(x)
+    if (x < 1)
+        fun_l14_n212(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n163(x)
+    if (x < 1)
+        fun_l14_n841(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n164(x)
+    if (x < 1)
+        fun_l14_n405(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n165(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n398(x)
+    end
+end
+
+def fun_l13_n166(x)
+    if (x < 1)
+        fun_l14_n112(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n167(x)
+    if (x < 1)
+        fun_l14_n414(x)
+    else
+        fun_l14_n509(x)
+    end
+end
+
+def fun_l13_n168(x)
+    if (x < 1)
+        fun_l14_n585(x)
+    else
+        fun_l14_n166(x)
+    end
+end
+
+def fun_l13_n169(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n581(x)
+    end
+end
+
+def fun_l13_n170(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n520(x)
+    end
+end
+
+def fun_l13_n171(x)
+    if (x < 1)
+        fun_l14_n920(x)
+    else
+        fun_l14_n599(x)
+    end
+end
+
+def fun_l13_n172(x)
+    if (x < 1)
+        fun_l14_n125(x)
+    else
+        fun_l14_n84(x)
+    end
+end
+
+def fun_l13_n173(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n174(x)
+    if (x < 1)
+        fun_l14_n23(x)
+    else
+        fun_l14_n922(x)
+    end
+end
+
+def fun_l13_n175(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n685(x)
+    end
+end
+
+def fun_l13_n176(x)
+    if (x < 1)
+        fun_l14_n235(x)
+    else
+        fun_l14_n157(x)
+    end
+end
+
+def fun_l13_n177(x)
+    if (x < 1)
+        fun_l14_n284(x)
+    else
+        fun_l14_n601(x)
+    end
+end
+
+def fun_l13_n178(x)
+    if (x < 1)
+        fun_l14_n785(x)
+    else
+        fun_l14_n498(x)
+    end
+end
+
+def fun_l13_n179(x)
+    if (x < 1)
+        fun_l14_n416(x)
+    else
+        fun_l14_n624(x)
+    end
+end
+
+def fun_l13_n180(x)
+    if (x < 1)
+        fun_l14_n747(x)
+    else
+        fun_l14_n824(x)
+    end
+end
+
+def fun_l13_n181(x)
+    if (x < 1)
+        fun_l14_n658(x)
+    else
+        fun_l14_n814(x)
+    end
+end
+
+def fun_l13_n182(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n365(x)
+    end
+end
+
+def fun_l13_n183(x)
+    if (x < 1)
+        fun_l14_n772(x)
+    else
+        fun_l14_n831(x)
+    end
+end
+
+def fun_l13_n184(x)
+    if (x < 1)
+        fun_l14_n560(x)
+    else
+        fun_l14_n933(x)
+    end
+end
+
+def fun_l13_n185(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n716(x)
+    end
+end
+
+def fun_l13_n186(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n187(x)
+    if (x < 1)
+        fun_l14_n910(x)
+    else
+        fun_l14_n31(x)
+    end
+end
+
+def fun_l13_n188(x)
+    if (x < 1)
+        fun_l14_n792(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n189(x)
+    if (x < 1)
+        fun_l14_n42(x)
+    else
+        fun_l14_n942(x)
+    end
+end
+
+def fun_l13_n190(x)
+    if (x < 1)
+        fun_l14_n520(x)
+    else
+        fun_l14_n826(x)
+    end
+end
+
+def fun_l13_n191(x)
+    if (x < 1)
+        fun_l14_n723(x)
+    else
+        fun_l14_n5(x)
+    end
+end
+
+def fun_l13_n192(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n243(x)
+    end
+end
+
+def fun_l13_n193(x)
+    if (x < 1)
+        fun_l14_n722(x)
+    else
+        fun_l14_n450(x)
+    end
+end
+
+def fun_l13_n194(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n968(x)
+    end
+end
+
+def fun_l13_n195(x)
+    if (x < 1)
+        fun_l14_n381(x)
+    else
+        fun_l14_n964(x)
+    end
+end
+
+def fun_l13_n196(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n216(x)
+    end
+end
+
+def fun_l13_n197(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n439(x)
+    end
+end
+
+def fun_l13_n198(x)
+    if (x < 1)
+        fun_l14_n983(x)
+    else
+        fun_l14_n363(x)
+    end
+end
+
+def fun_l13_n199(x)
+    if (x < 1)
+        fun_l14_n939(x)
+    else
+        fun_l14_n806(x)
+    end
+end
+
+def fun_l13_n200(x)
+    if (x < 1)
+        fun_l14_n710(x)
+    else
+        fun_l14_n513(x)
+    end
+end
+
+def fun_l13_n201(x)
+    if (x < 1)
+        fun_l14_n431(x)
+    else
+        fun_l14_n81(x)
+    end
+end
+
+def fun_l13_n202(x)
+    if (x < 1)
+        fun_l14_n41(x)
+    else
+        fun_l14_n916(x)
+    end
+end
+
+def fun_l13_n203(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n626(x)
+    end
+end
+
+def fun_l13_n204(x)
+    if (x < 1)
+        fun_l14_n505(x)
+    else
+        fun_l14_n750(x)
+    end
+end
+
+def fun_l13_n205(x)
+    if (x < 1)
+        fun_l14_n263(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n206(x)
+    if (x < 1)
+        fun_l14_n589(x)
+    else
+        fun_l14_n215(x)
+    end
+end
+
+def fun_l13_n207(x)
+    if (x < 1)
+        fun_l14_n435(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n208(x)
+    if (x < 1)
+        fun_l14_n114(x)
+    else
+        fun_l14_n222(x)
+    end
+end
+
+def fun_l13_n209(x)
+    if (x < 1)
+        fun_l14_n784(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n210(x)
+    if (x < 1)
+        fun_l14_n434(x)
+    else
+        fun_l14_n79(x)
+    end
+end
+
+def fun_l13_n211(x)
+    if (x < 1)
+        fun_l14_n152(x)
+    else
+        fun_l14_n428(x)
+    end
+end
+
+def fun_l13_n212(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n101(x)
+    end
+end
+
+def fun_l13_n213(x)
+    if (x < 1)
+        fun_l14_n880(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n214(x)
+    if (x < 1)
+        fun_l14_n824(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n215(x)
+    if (x < 1)
+        fun_l14_n657(x)
+    else
+        fun_l14_n822(x)
+    end
+end
+
+def fun_l13_n216(x)
+    if (x < 1)
+        fun_l14_n603(x)
+    else
+        fun_l14_n993(x)
+    end
+end
+
+def fun_l13_n217(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n218(x)
+    if (x < 1)
+        fun_l14_n30(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n219(x)
+    if (x < 1)
+        fun_l14_n175(x)
+    else
+        fun_l14_n124(x)
+    end
+end
+
+def fun_l13_n220(x)
+    if (x < 1)
+        fun_l14_n878(x)
+    else
+        fun_l14_n342(x)
+    end
+end
+
+def fun_l13_n221(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n204(x)
+    end
+end
+
+def fun_l13_n222(x)
+    if (x < 1)
+        fun_l14_n29(x)
+    else
+        fun_l14_n573(x)
+    end
+end
+
+def fun_l13_n223(x)
+    if (x < 1)
+        fun_l14_n329(x)
+    else
+        fun_l14_n35(x)
+    end
+end
+
+def fun_l13_n224(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n323(x)
+    end
+end
+
+def fun_l13_n225(x)
+    if (x < 1)
+        fun_l14_n921(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n226(x)
+    if (x < 1)
+        fun_l14_n599(x)
+    else
+        fun_l14_n566(x)
+    end
+end
+
+def fun_l13_n227(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n549(x)
+    end
+end
+
+def fun_l13_n228(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n212(x)
+    end
+end
+
+def fun_l13_n229(x)
+    if (x < 1)
+        fun_l14_n22(x)
+    else
+        fun_l14_n656(x)
+    end
+end
+
+def fun_l13_n230(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n658(x)
+    end
+end
+
+def fun_l13_n231(x)
+    if (x < 1)
+        fun_l14_n522(x)
+    else
+        fun_l14_n596(x)
+    end
+end
+
+def fun_l13_n232(x)
+    if (x < 1)
+        fun_l14_n296(x)
+    else
+        fun_l14_n53(x)
+    end
+end
+
+def fun_l13_n233(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n818(x)
+    end
+end
+
+def fun_l13_n234(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n235(x)
+    if (x < 1)
+        fun_l14_n776(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n236(x)
+    if (x < 1)
+        fun_l14_n204(x)
+    else
+        fun_l14_n34(x)
+    end
+end
+
+def fun_l13_n237(x)
+    if (x < 1)
+        fun_l14_n704(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n238(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n239(x)
+    if (x < 1)
+        fun_l14_n382(x)
+    else
+        fun_l14_n447(x)
+    end
+end
+
+def fun_l13_n240(x)
+    if (x < 1)
+        fun_l14_n200(x)
+    else
+        fun_l14_n623(x)
+    end
+end
+
+def fun_l13_n241(x)
+    if (x < 1)
+        fun_l14_n563(x)
+    else
+        fun_l14_n259(x)
+    end
+end
+
+def fun_l13_n242(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n243(x)
+    if (x < 1)
+        fun_l14_n287(x)
+    else
+        fun_l14_n441(x)
+    end
+end
+
+def fun_l13_n244(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n961(x)
+    end
+end
+
+def fun_l13_n245(x)
+    if (x < 1)
+        fun_l14_n677(x)
+    else
+        fun_l14_n310(x)
+    end
+end
+
+def fun_l13_n246(x)
+    if (x < 1)
+        fun_l14_n504(x)
+    else
+        fun_l14_n504(x)
+    end
+end
+
+def fun_l13_n247(x)
+    if (x < 1)
+        fun_l14_n61(x)
+    else
+        fun_l14_n560(x)
+    end
+end
+
+def fun_l13_n248(x)
+    if (x < 1)
+        fun_l14_n813(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n249(x)
+    if (x < 1)
+        fun_l14_n89(x)
+    else
+        fun_l14_n733(x)
+    end
+end
+
+def fun_l13_n250(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n342(x)
+    end
+end
+
+def fun_l13_n251(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n767(x)
+    end
+end
+
+def fun_l13_n252(x)
+    if (x < 1)
+        fun_l14_n35(x)
+    else
+        fun_l14_n338(x)
+    end
+end
+
+def fun_l13_n253(x)
+    if (x < 1)
+        fun_l14_n894(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n254(x)
+    if (x < 1)
+        fun_l14_n516(x)
+    else
+        fun_l14_n832(x)
+    end
+end
+
+def fun_l13_n255(x)
+    if (x < 1)
+        fun_l14_n106(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n256(x)
+    if (x < 1)
+        fun_l14_n978(x)
+    else
+        fun_l14_n940(x)
+    end
+end
+
+def fun_l13_n257(x)
+    if (x < 1)
+        fun_l14_n808(x)
+    else
+        fun_l14_n906(x)
+    end
+end
+
+def fun_l13_n258(x)
+    if (x < 1)
+        fun_l14_n435(x)
+    else
+        fun_l14_n55(x)
+    end
+end
+
+def fun_l13_n259(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n550(x)
+    end
+end
+
+def fun_l13_n260(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n261(x)
+    if (x < 1)
+        fun_l14_n995(x)
+    else
+        fun_l14_n174(x)
+    end
+end
+
+def fun_l13_n262(x)
+    if (x < 1)
+        fun_l14_n161(x)
+    else
+        fun_l14_n357(x)
+    end
+end
+
+def fun_l13_n263(x)
+    if (x < 1)
+        fun_l14_n248(x)
+    else
+        fun_l14_n509(x)
+    end
+end
+
+def fun_l13_n264(x)
+    if (x < 1)
+        fun_l14_n521(x)
+    else
+        fun_l14_n41(x)
+    end
+end
+
+def fun_l13_n265(x)
+    if (x < 1)
+        fun_l14_n771(x)
+    else
+        fun_l14_n387(x)
+    end
+end
+
+def fun_l13_n266(x)
+    if (x < 1)
+        fun_l14_n149(x)
+    else
+        fun_l14_n814(x)
+    end
+end
+
+def fun_l13_n267(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n172(x)
+    end
+end
+
+def fun_l13_n268(x)
+    if (x < 1)
+        fun_l14_n167(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n269(x)
+    if (x < 1)
+        fun_l14_n321(x)
+    else
+        fun_l14_n152(x)
+    end
+end
+
+def fun_l13_n270(x)
+    if (x < 1)
+        fun_l14_n851(x)
+    else
+        fun_l14_n793(x)
+    end
+end
+
+def fun_l13_n271(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n843(x)
+    end
+end
+
+def fun_l13_n272(x)
+    if (x < 1)
+        fun_l14_n499(x)
+    else
+        fun_l14_n118(x)
+    end
+end
+
+def fun_l13_n273(x)
+    if (x < 1)
+        fun_l14_n958(x)
+    else
+        fun_l14_n597(x)
+    end
+end
+
+def fun_l13_n274(x)
+    if (x < 1)
+        fun_l14_n884(x)
+    else
+        fun_l14_n23(x)
+    end
+end
+
+def fun_l13_n275(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n796(x)
+    end
+end
+
+def fun_l13_n276(x)
+    if (x < 1)
+        fun_l14_n944(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n277(x)
+    if (x < 1)
+        fun_l14_n511(x)
+    else
+        fun_l14_n464(x)
+    end
+end
+
+def fun_l13_n278(x)
+    if (x < 1)
+        fun_l14_n906(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n279(x)
+    if (x < 1)
+        fun_l14_n872(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n280(x)
+    if (x < 1)
+        fun_l14_n888(x)
+    else
+        fun_l14_n117(x)
+    end
+end
+
+def fun_l13_n281(x)
+    if (x < 1)
+        fun_l14_n298(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n282(x)
+    if (x < 1)
+        fun_l14_n740(x)
+    else
+        fun_l14_n668(x)
+    end
+end
+
+def fun_l13_n283(x)
+    if (x < 1)
+        fun_l14_n438(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n284(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n39(x)
+    end
+end
+
+def fun_l13_n285(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n984(x)
+    end
+end
+
+def fun_l13_n286(x)
+    if (x < 1)
+        fun_l14_n278(x)
+    else
+        fun_l14_n453(x)
+    end
+end
+
+def fun_l13_n287(x)
+    if (x < 1)
+        fun_l14_n303(x)
+    else
+        fun_l14_n812(x)
+    end
+end
+
+def fun_l13_n288(x)
+    if (x < 1)
+        fun_l14_n891(x)
+    else
+        fun_l14_n843(x)
+    end
+end
+
+def fun_l13_n289(x)
+    if (x < 1)
+        fun_l14_n672(x)
+    else
+        fun_l14_n543(x)
+    end
+end
+
+def fun_l13_n290(x)
+    if (x < 1)
+        fun_l14_n115(x)
+    else
+        fun_l14_n33(x)
+    end
+end
+
+def fun_l13_n291(x)
+    if (x < 1)
+        fun_l14_n467(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n292(x)
+    if (x < 1)
+        fun_l14_n528(x)
+    else
+        fun_l14_n51(x)
+    end
+end
+
+def fun_l13_n293(x)
+    if (x < 1)
+        fun_l14_n50(x)
+    else
+        fun_l14_n917(x)
+    end
+end
+
+def fun_l13_n294(x)
+    if (x < 1)
+        fun_l14_n245(x)
+    else
+        fun_l14_n289(x)
+    end
+end
+
+def fun_l13_n295(x)
+    if (x < 1)
+        fun_l14_n108(x)
+    else
+        fun_l14_n772(x)
+    end
+end
+
+def fun_l13_n296(x)
+    if (x < 1)
+        fun_l14_n451(x)
+    else
+        fun_l14_n127(x)
+    end
+end
+
+def fun_l13_n297(x)
+    if (x < 1)
+        fun_l14_n374(x)
+    else
+        fun_l14_n20(x)
+    end
+end
+
+def fun_l13_n298(x)
+    if (x < 1)
+        fun_l14_n588(x)
+    else
+        fun_l14_n95(x)
+    end
+end
+
+def fun_l13_n299(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n146(x)
+    end
+end
+
+def fun_l13_n300(x)
+    if (x < 1)
+        fun_l14_n812(x)
+    else
+        fun_l14_n373(x)
+    end
+end
+
+def fun_l13_n301(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n228(x)
+    end
+end
+
+def fun_l13_n302(x)
+    if (x < 1)
+        fun_l14_n992(x)
+    else
+        fun_l14_n578(x)
+    end
+end
+
+def fun_l13_n303(x)
+    if (x < 1)
+        fun_l14_n106(x)
+    else
+        fun_l14_n413(x)
+    end
+end
+
+def fun_l13_n304(x)
+    if (x < 1)
+        fun_l14_n463(x)
+    else
+        fun_l14_n884(x)
+    end
+end
+
+def fun_l13_n305(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n306(x)
+    if (x < 1)
+        fun_l14_n960(x)
+    else
+        fun_l14_n596(x)
+    end
+end
+
+def fun_l13_n307(x)
+    if (x < 1)
+        fun_l14_n858(x)
+    else
+        fun_l14_n488(x)
+    end
+end
+
+def fun_l13_n308(x)
+    if (x < 1)
+        fun_l14_n968(x)
+    else
+        fun_l14_n507(x)
+    end
+end
+
+def fun_l13_n309(x)
+    if (x < 1)
+        fun_l14_n956(x)
+    else
+        fun_l14_n125(x)
+    end
+end
+
+def fun_l13_n310(x)
+    if (x < 1)
+        fun_l14_n190(x)
+    else
+        fun_l14_n817(x)
+    end
+end
+
+def fun_l13_n311(x)
+    if (x < 1)
+        fun_l14_n574(x)
+    else
+        fun_l14_n447(x)
+    end
+end
+
+def fun_l13_n312(x)
+    if (x < 1)
+        fun_l14_n403(x)
+    else
+        fun_l14_n591(x)
+    end
+end
+
+def fun_l13_n313(x)
+    if (x < 1)
+        fun_l14_n499(x)
+    else
+        fun_l14_n458(x)
+    end
+end
+
+def fun_l13_n314(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n77(x)
+    end
+end
+
+def fun_l13_n315(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n316(x)
+    if (x < 1)
+        fun_l14_n304(x)
+    else
+        fun_l14_n785(x)
+    end
+end
+
+def fun_l13_n317(x)
+    if (x < 1)
+        fun_l14_n624(x)
+    else
+        fun_l14_n399(x)
+    end
+end
+
+def fun_l13_n318(x)
+    if (x < 1)
+        fun_l14_n882(x)
+    else
+        fun_l14_n3(x)
+    end
+end
+
+def fun_l13_n319(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n955(x)
+    end
+end
+
+def fun_l13_n320(x)
+    if (x < 1)
+        fun_l14_n690(x)
+    else
+        fun_l14_n281(x)
+    end
+end
+
+def fun_l13_n321(x)
+    if (x < 1)
+        fun_l14_n453(x)
+    else
+        fun_l14_n969(x)
+    end
+end
+
+def fun_l13_n322(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n50(x)
+    end
+end
+
+def fun_l13_n323(x)
+    if (x < 1)
+        fun_l14_n342(x)
+    else
+        fun_l14_n618(x)
+    end
+end
+
+def fun_l13_n324(x)
+    if (x < 1)
+        fun_l14_n74(x)
+    else
+        fun_l14_n638(x)
+    end
+end
+
+def fun_l13_n325(x)
+    if (x < 1)
+        fun_l14_n218(x)
+    else
+        fun_l14_n169(x)
+    end
+end
+
+def fun_l13_n326(x)
+    if (x < 1)
+        fun_l14_n128(x)
+    else
+        fun_l14_n504(x)
+    end
+end
+
+def fun_l13_n327(x)
+    if (x < 1)
+        fun_l14_n612(x)
+    else
+        fun_l14_n62(x)
+    end
+end
+
+def fun_l13_n328(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n329(x)
+    if (x < 1)
+        fun_l14_n515(x)
+    else
+        fun_l14_n15(x)
+    end
+end
+
+def fun_l13_n330(x)
+    if (x < 1)
+        fun_l14_n448(x)
+    else
+        fun_l14_n951(x)
+    end
+end
+
+def fun_l13_n331(x)
+    if (x < 1)
+        fun_l14_n804(x)
+    else
+        fun_l14_n315(x)
+    end
+end
+
+def fun_l13_n332(x)
+    if (x < 1)
+        fun_l14_n522(x)
+    else
+        fun_l14_n761(x)
+    end
+end
+
+def fun_l13_n333(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n542(x)
+    end
+end
+
+def fun_l13_n334(x)
+    if (x < 1)
+        fun_l14_n952(x)
+    else
+        fun_l14_n390(x)
+    end
+end
+
+def fun_l13_n335(x)
+    if (x < 1)
+        fun_l14_n324(x)
+    else
+        fun_l14_n60(x)
+    end
+end
+
+def fun_l13_n336(x)
+    if (x < 1)
+        fun_l14_n887(x)
+    else
+        fun_l14_n474(x)
+    end
+end
+
+def fun_l13_n337(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n338(x)
+    if (x < 1)
+        fun_l14_n21(x)
+    else
+        fun_l14_n133(x)
+    end
+end
+
+def fun_l13_n339(x)
+    if (x < 1)
+        fun_l14_n12(x)
+    else
+        fun_l14_n30(x)
+    end
+end
+
+def fun_l13_n340(x)
+    if (x < 1)
+        fun_l14_n678(x)
+    else
+        fun_l14_n583(x)
+    end
+end
+
+def fun_l13_n341(x)
+    if (x < 1)
+        fun_l14_n289(x)
+    else
+        fun_l14_n490(x)
+    end
+end
+
+def fun_l13_n342(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n288(x)
+    end
+end
+
+def fun_l13_n343(x)
+    if (x < 1)
+        fun_l14_n744(x)
+    else
+        fun_l14_n963(x)
+    end
+end
+
+def fun_l13_n344(x)
+    if (x < 1)
+        fun_l14_n651(x)
+    else
+        fun_l14_n377(x)
+    end
+end
+
+def fun_l13_n345(x)
+    if (x < 1)
+        fun_l14_n13(x)
+    else
+        fun_l14_n749(x)
+    end
+end
+
+def fun_l13_n346(x)
+    if (x < 1)
+        fun_l14_n789(x)
+    else
+        fun_l14_n621(x)
+    end
+end
+
+def fun_l13_n347(x)
+    if (x < 1)
+        fun_l14_n346(x)
+    else
+        fun_l14_n663(x)
+    end
+end
+
+def fun_l13_n348(x)
+    if (x < 1)
+        fun_l14_n252(x)
+    else
+        fun_l14_n202(x)
+    end
+end
+
+def fun_l13_n349(x)
+    if (x < 1)
+        fun_l14_n919(x)
+    else
+        fun_l14_n997(x)
+    end
+end
+
+def fun_l13_n350(x)
+    if (x < 1)
+        fun_l14_n472(x)
+    else
+        fun_l14_n900(x)
+    end
+end
+
+def fun_l13_n351(x)
+    if (x < 1)
+        fun_l14_n954(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n352(x)
+    if (x < 1)
+        fun_l14_n227(x)
+    else
+        fun_l14_n344(x)
+    end
+end
+
+def fun_l13_n353(x)
+    if (x < 1)
+        fun_l14_n110(x)
+    else
+        fun_l14_n266(x)
+    end
+end
+
+def fun_l13_n354(x)
+    if (x < 1)
+        fun_l14_n840(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n355(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n356(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n480(x)
+    end
+end
+
+def fun_l13_n357(x)
+    if (x < 1)
+        fun_l14_n122(x)
+    else
+        fun_l14_n408(x)
+    end
+end
+
+def fun_l13_n358(x)
+    if (x < 1)
+        fun_l14_n105(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n359(x)
+    if (x < 1)
+        fun_l14_n358(x)
+    else
+        fun_l14_n336(x)
+    end
+end
+
+def fun_l13_n360(x)
+    if (x < 1)
+        fun_l14_n457(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n361(x)
+    if (x < 1)
+        fun_l14_n679(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n362(x)
+    if (x < 1)
+        fun_l14_n419(x)
+    else
+        fun_l14_n909(x)
+    end
+end
+
+def fun_l13_n363(x)
+    if (x < 1)
+        fun_l14_n672(x)
+    else
+        fun_l14_n132(x)
+    end
+end
+
+def fun_l13_n364(x)
+    if (x < 1)
+        fun_l14_n947(x)
+    else
+        fun_l14_n328(x)
+    end
+end
+
+def fun_l13_n365(x)
+    if (x < 1)
+        fun_l14_n959(x)
+    else
+        fun_l14_n122(x)
+    end
+end
+
+def fun_l13_n366(x)
+    if (x < 1)
+        fun_l14_n534(x)
+    else
+        fun_l14_n611(x)
+    end
+end
+
+def fun_l13_n367(x)
+    if (x < 1)
+        fun_l14_n349(x)
+    else
+        fun_l14_n149(x)
+    end
+end
+
+def fun_l13_n368(x)
+    if (x < 1)
+        fun_l14_n94(x)
+    else
+        fun_l14_n870(x)
+    end
+end
+
+def fun_l13_n369(x)
+    if (x < 1)
+        fun_l14_n774(x)
+    else
+        fun_l14_n696(x)
+    end
+end
+
+def fun_l13_n370(x)
+    if (x < 1)
+        fun_l14_n311(x)
+    else
+        fun_l14_n479(x)
+    end
+end
+
+def fun_l13_n371(x)
+    if (x < 1)
+        fun_l14_n650(x)
+    else
+        fun_l14_n66(x)
+    end
+end
+
+def fun_l13_n372(x)
+    if (x < 1)
+        fun_l14_n825(x)
+    else
+        fun_l14_n910(x)
+    end
+end
+
+def fun_l13_n373(x)
+    if (x < 1)
+        fun_l14_n454(x)
+    else
+        fun_l14_n492(x)
+    end
+end
+
+def fun_l13_n374(x)
+    if (x < 1)
+        fun_l14_n785(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n375(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n664(x)
+    end
+end
+
+def fun_l13_n376(x)
+    if (x < 1)
+        fun_l14_n427(x)
+    else
+        fun_l14_n615(x)
+    end
+end
+
+def fun_l13_n377(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n378(x)
+    if (x < 1)
+        fun_l14_n575(x)
+    else
+        fun_l14_n561(x)
+    end
+end
+
+def fun_l13_n379(x)
+    if (x < 1)
+        fun_l14_n497(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n380(x)
+    if (x < 1)
+        fun_l14_n350(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n381(x)
+    if (x < 1)
+        fun_l14_n292(x)
+    else
+        fun_l14_n739(x)
+    end
+end
+
+def fun_l13_n382(x)
+    if (x < 1)
+        fun_l14_n302(x)
+    else
+        fun_l14_n583(x)
+    end
+end
+
+def fun_l13_n383(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n384(x)
+    if (x < 1)
+        fun_l14_n953(x)
+    else
+        fun_l14_n394(x)
+    end
+end
+
+def fun_l13_n385(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n149(x)
+    end
+end
+
+def fun_l13_n386(x)
+    if (x < 1)
+        fun_l14_n77(x)
+    else
+        fun_l14_n880(x)
+    end
+end
+
+def fun_l13_n387(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n649(x)
+    end
+end
+
+def fun_l13_n388(x)
+    if (x < 1)
+        fun_l14_n277(x)
+    else
+        fun_l14_n922(x)
+    end
+end
+
+def fun_l13_n389(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n427(x)
+    end
+end
+
+def fun_l13_n390(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n804(x)
+    end
+end
+
+def fun_l13_n391(x)
+    if (x < 1)
+        fun_l14_n52(x)
+    else
+        fun_l14_n770(x)
+    end
+end
+
+def fun_l13_n392(x)
+    if (x < 1)
+        fun_l14_n592(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n393(x)
+    if (x < 1)
+        fun_l14_n274(x)
+    else
+        fun_l14_n778(x)
+    end
+end
+
+def fun_l13_n394(x)
+    if (x < 1)
+        fun_l14_n708(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n395(x)
+    if (x < 1)
+        fun_l14_n449(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n396(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n148(x)
+    end
+end
+
+def fun_l13_n397(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n398(x)
+    if (x < 1)
+        fun_l14_n150(x)
+    else
+        fun_l14_n540(x)
+    end
+end
+
+def fun_l13_n399(x)
+    if (x < 1)
+        fun_l14_n791(x)
+    else
+        fun_l14_n517(x)
+    end
+end
+
+def fun_l13_n400(x)
+    if (x < 1)
+        fun_l14_n152(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n401(x)
+    if (x < 1)
+        fun_l14_n911(x)
+    else
+        fun_l14_n544(x)
+    end
+end
+
+def fun_l13_n402(x)
+    if (x < 1)
+        fun_l14_n915(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n403(x)
+    if (x < 1)
+        fun_l14_n452(x)
+    else
+        fun_l14_n62(x)
+    end
+end
+
+def fun_l13_n404(x)
+    if (x < 1)
+        fun_l14_n823(x)
+    else
+        fun_l14_n913(x)
+    end
+end
+
+def fun_l13_n405(x)
+    if (x < 1)
+        fun_l14_n808(x)
+    else
+        fun_l14_n49(x)
+    end
+end
+
+def fun_l13_n406(x)
+    if (x < 1)
+        fun_l14_n498(x)
+    else
+        fun_l14_n470(x)
+    end
+end
+
+def fun_l13_n407(x)
+    if (x < 1)
+        fun_l14_n314(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n408(x)
+    if (x < 1)
+        fun_l14_n61(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n409(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n505(x)
+    end
+end
+
+def fun_l13_n410(x)
+    if (x < 1)
+        fun_l14_n646(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l13_n411(x)
+    if (x < 1)
+        fun_l14_n741(x)
+    else
+        fun_l14_n979(x)
+    end
+end
+
+def fun_l13_n412(x)
+    if (x < 1)
+        fun_l14_n840(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n413(x)
+    if (x < 1)
+        fun_l14_n217(x)
+    else
+        fun_l14_n98(x)
+    end
+end
+
+def fun_l13_n414(x)
+    if (x < 1)
+        fun_l14_n398(x)
+    else
+        fun_l14_n701(x)
+    end
+end
+
+def fun_l13_n415(x)
+    if (x < 1)
+        fun_l14_n470(x)
+    else
+        fun_l14_n394(x)
+    end
+end
+
+def fun_l13_n416(x)
+    if (x < 1)
+        fun_l14_n113(x)
+    else
+        fun_l14_n792(x)
+    end
+end
+
+def fun_l13_n417(x)
+    if (x < 1)
+        fun_l14_n969(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n418(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n800(x)
+    end
+end
+
+def fun_l13_n419(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n510(x)
+    end
+end
+
+def fun_l13_n420(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n904(x)
+    end
+end
+
+def fun_l13_n421(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n200(x)
+    end
+end
+
+def fun_l13_n422(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n35(x)
+    end
+end
+
+def fun_l13_n423(x)
+    if (x < 1)
+        fun_l14_n644(x)
+    else
+        fun_l14_n963(x)
+    end
+end
+
+def fun_l13_n424(x)
+    if (x < 1)
+        fun_l14_n0(x)
+    else
+        fun_l14_n625(x)
+    end
+end
+
+def fun_l13_n425(x)
+    if (x < 1)
+        fun_l14_n186(x)
+    else
+        fun_l14_n409(x)
+    end
+end
+
+def fun_l13_n426(x)
+    if (x < 1)
+        fun_l14_n869(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n427(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n160(x)
+    end
+end
+
+def fun_l13_n428(x)
+    if (x < 1)
+        fun_l14_n974(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n429(x)
+    if (x < 1)
+        fun_l14_n570(x)
+    else
+        fun_l14_n10(x)
+    end
+end
+
+def fun_l13_n430(x)
+    if (x < 1)
+        fun_l14_n199(x)
+    else
+        fun_l14_n829(x)
+    end
+end
+
+def fun_l13_n431(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n362(x)
+    end
+end
+
+def fun_l13_n432(x)
+    if (x < 1)
+        fun_l14_n925(x)
+    else
+        fun_l14_n365(x)
+    end
+end
+
+def fun_l13_n433(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n119(x)
+    end
+end
+
+def fun_l13_n434(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n374(x)
+    end
+end
+
+def fun_l13_n435(x)
+    if (x < 1)
+        fun_l14_n126(x)
+    else
+        fun_l14_n568(x)
+    end
+end
+
+def fun_l13_n436(x)
+    if (x < 1)
+        fun_l14_n468(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n437(x)
+    if (x < 1)
+        fun_l14_n667(x)
+    else
+        fun_l14_n795(x)
+    end
+end
+
+def fun_l13_n438(x)
+    if (x < 1)
+        fun_l14_n989(x)
+    else
+        fun_l14_n484(x)
+    end
+end
+
+def fun_l13_n439(x)
+    if (x < 1)
+        fun_l14_n109(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n440(x)
+    if (x < 1)
+        fun_l14_n999(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n441(x)
+    if (x < 1)
+        fun_l14_n616(x)
+    else
+        fun_l14_n794(x)
+    end
+end
+
+def fun_l13_n442(x)
+    if (x < 1)
+        fun_l14_n719(x)
+    else
+        fun_l14_n967(x)
+    end
+end
+
+def fun_l13_n443(x)
+    if (x < 1)
+        fun_l14_n279(x)
+    else
+        fun_l14_n240(x)
+    end
+end
+
+def fun_l13_n444(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n146(x)
+    end
+end
+
+def fun_l13_n445(x)
+    if (x < 1)
+        fun_l14_n164(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n446(x)
+    if (x < 1)
+        fun_l14_n474(x)
+    else
+        fun_l14_n137(x)
+    end
+end
+
+def fun_l13_n447(x)
+    if (x < 1)
+        fun_l14_n198(x)
+    else
+        fun_l14_n66(x)
+    end
+end
+
+def fun_l13_n448(x)
+    if (x < 1)
+        fun_l14_n948(x)
+    else
+        fun_l14_n682(x)
+    end
+end
+
+def fun_l13_n449(x)
+    if (x < 1)
+        fun_l14_n545(x)
+    else
+        fun_l14_n928(x)
+    end
+end
+
+def fun_l13_n450(x)
+    if (x < 1)
+        fun_l14_n822(x)
+    else
+        fun_l14_n846(x)
+    end
+end
+
+def fun_l13_n451(x)
+    if (x < 1)
+        fun_l14_n514(x)
+    else
+        fun_l14_n54(x)
+    end
+end
+
+def fun_l13_n452(x)
+    if (x < 1)
+        fun_l14_n539(x)
+    else
+        fun_l14_n199(x)
+    end
+end
+
+def fun_l13_n453(x)
+    if (x < 1)
+        fun_l14_n917(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n454(x)
+    if (x < 1)
+        fun_l14_n924(x)
+    else
+        fun_l14_n51(x)
+    end
+end
+
+def fun_l13_n455(x)
+    if (x < 1)
+        fun_l14_n675(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n456(x)
+    if (x < 1)
+        fun_l14_n335(x)
+    else
+        fun_l14_n138(x)
+    end
+end
+
+def fun_l13_n457(x)
+    if (x < 1)
+        fun_l14_n112(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n458(x)
+    if (x < 1)
+        fun_l14_n784(x)
+    else
+        fun_l14_n278(x)
+    end
+end
+
+def fun_l13_n459(x)
+    if (x < 1)
+        fun_l14_n165(x)
+    else
+        fun_l14_n985(x)
+    end
+end
+
+def fun_l13_n460(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n461(x)
+    if (x < 1)
+        fun_l14_n492(x)
+    else
+        fun_l14_n21(x)
+    end
+end
+
+def fun_l13_n462(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n248(x)
+    end
+end
+
+def fun_l13_n463(x)
+    if (x < 1)
+        fun_l14_n940(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n464(x)
+    if (x < 1)
+        fun_l14_n8(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n465(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n663(x)
+    end
+end
+
+def fun_l13_n466(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n570(x)
+    end
+end
+
+def fun_l13_n467(x)
+    if (x < 1)
+        fun_l14_n464(x)
+    else
+        fun_l14_n497(x)
+    end
+end
+
+def fun_l13_n468(x)
+    if (x < 1)
+        fun_l14_n49(x)
+    else
+        fun_l14_n153(x)
+    end
+end
+
+def fun_l13_n469(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n562(x)
+    end
+end
+
+def fun_l13_n470(x)
+    if (x < 1)
+        fun_l14_n207(x)
+    else
+        fun_l14_n328(x)
+    end
+end
+
+def fun_l13_n471(x)
+    if (x < 1)
+        fun_l14_n356(x)
+    else
+        fun_l14_n834(x)
+    end
+end
+
+def fun_l13_n472(x)
+    if (x < 1)
+        fun_l14_n46(x)
+    else
+        fun_l14_n842(x)
+    end
+end
+
+def fun_l13_n473(x)
+    if (x < 1)
+        fun_l14_n14(x)
+    else
+        fun_l14_n488(x)
+    end
+end
+
+def fun_l13_n474(x)
+    if (x < 1)
+        fun_l14_n307(x)
+    else
+        fun_l14_n647(x)
+    end
+end
+
+def fun_l13_n475(x)
+    if (x < 1)
+        fun_l14_n474(x)
+    else
+        fun_l14_n369(x)
+    end
+end
+
+def fun_l13_n476(x)
+    if (x < 1)
+        fun_l14_n471(x)
+    else
+        fun_l14_n956(x)
+    end
+end
+
+def fun_l13_n477(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n478(x)
+    end
+end
+
+def fun_l13_n478(x)
+    if (x < 1)
+        fun_l14_n377(x)
+    else
+        fun_l14_n675(x)
+    end
+end
+
+def fun_l13_n479(x)
+    if (x < 1)
+        fun_l14_n370(x)
+    else
+        fun_l14_n819(x)
+    end
+end
+
+def fun_l13_n480(x)
+    if (x < 1)
+        fun_l14_n459(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n481(x)
+    if (x < 1)
+        fun_l14_n200(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n482(x)
+    if (x < 1)
+        fun_l14_n893(x)
+    else
+        fun_l14_n518(x)
+    end
+end
+
+def fun_l13_n483(x)
+    if (x < 1)
+        fun_l14_n130(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n484(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n533(x)
+    end
+end
+
+def fun_l13_n485(x)
+    if (x < 1)
+        fun_l14_n254(x)
+    else
+        fun_l14_n294(x)
+    end
+end
+
+def fun_l13_n486(x)
+    if (x < 1)
+        fun_l14_n608(x)
+    else
+        fun_l14_n858(x)
+    end
+end
+
+def fun_l13_n487(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n379(x)
+    end
+end
+
+def fun_l13_n488(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n489(x)
+    if (x < 1)
+        fun_l14_n572(x)
+    else
+        fun_l14_n199(x)
+    end
+end
+
+def fun_l13_n490(x)
+    if (x < 1)
+        fun_l14_n3(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n491(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n372(x)
+    end
+end
+
+def fun_l13_n492(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n378(x)
+    end
+end
+
+def fun_l13_n493(x)
+    if (x < 1)
+        fun_l14_n980(x)
+    else
+        fun_l14_n617(x)
+    end
+end
+
+def fun_l13_n494(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n348(x)
+    end
+end
+
+def fun_l13_n495(x)
+    if (x < 1)
+        fun_l14_n631(x)
+    else
+        fun_l14_n281(x)
+    end
+end
+
+def fun_l13_n496(x)
+    if (x < 1)
+        fun_l14_n552(x)
+    else
+        fun_l14_n493(x)
+    end
+end
+
+def fun_l13_n497(x)
+    if (x < 1)
+        fun_l14_n342(x)
+    else
+        fun_l14_n931(x)
+    end
+end
+
+def fun_l13_n498(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n512(x)
+    end
+end
+
+def fun_l13_n499(x)
+    if (x < 1)
+        fun_l14_n950(x)
+    else
+        fun_l14_n952(x)
+    end
+end
+
+def fun_l13_n500(x)
+    if (x < 1)
+        fun_l14_n355(x)
+    else
+        fun_l14_n383(x)
+    end
+end
+
+def fun_l13_n501(x)
+    if (x < 1)
+        fun_l14_n278(x)
+    else
+        fun_l14_n442(x)
+    end
+end
+
+def fun_l13_n502(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n150(x)
+    end
+end
+
+def fun_l13_n503(x)
+    if (x < 1)
+        fun_l14_n399(x)
+    else
+        fun_l14_n989(x)
+    end
+end
+
+def fun_l13_n504(x)
+    if (x < 1)
+        fun_l14_n289(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n505(x)
+    if (x < 1)
+        fun_l14_n743(x)
+    else
+        fun_l14_n784(x)
+    end
+end
+
+def fun_l13_n506(x)
+    if (x < 1)
+        fun_l14_n916(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n507(x)
+    if (x < 1)
+        fun_l14_n912(x)
+    else
+        fun_l14_n448(x)
+    end
+end
+
+def fun_l13_n508(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n451(x)
+    end
+end
+
+def fun_l13_n509(x)
+    if (x < 1)
+        fun_l14_n15(x)
+    else
+        fun_l14_n697(x)
+    end
+end
+
+def fun_l13_n510(x)
+    if (x < 1)
+        fun_l14_n565(x)
+    else
+        fun_l14_n511(x)
+    end
+end
+
+def fun_l13_n511(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n272(x)
+    end
+end
+
+def fun_l13_n512(x)
+    if (x < 1)
+        fun_l14_n70(x)
+    else
+        fun_l14_n333(x)
+    end
+end
+
+def fun_l13_n513(x)
+    if (x < 1)
+        fun_l14_n100(x)
+    else
+        fun_l14_n399(x)
+    end
+end
+
+def fun_l13_n514(x)
+    if (x < 1)
+        fun_l14_n678(x)
+    else
+        fun_l14_n247(x)
+    end
+end
+
+def fun_l13_n515(x)
+    if (x < 1)
+        fun_l14_n823(x)
+    else
+        fun_l14_n371(x)
+    end
+end
+
+def fun_l13_n516(x)
+    if (x < 1)
+        fun_l14_n994(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n517(x)
+    if (x < 1)
+        fun_l14_n399(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n518(x)
+    if (x < 1)
+        fun_l14_n898(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n519(x)
+    if (x < 1)
+        fun_l14_n33(x)
+    else
+        fun_l14_n640(x)
+    end
+end
+
+def fun_l13_n520(x)
+    if (x < 1)
+        fun_l14_n475(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n521(x)
+    if (x < 1)
+        fun_l14_n896(x)
+    else
+        fun_l14_n312(x)
+    end
+end
+
+def fun_l13_n522(x)
+    if (x < 1)
+        fun_l14_n454(x)
+    else
+        fun_l14_n520(x)
+    end
+end
+
+def fun_l13_n523(x)
+    if (x < 1)
+        fun_l14_n334(x)
+    else
+        fun_l14_n879(x)
+    end
+end
+
+def fun_l13_n524(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n526(x)
+    end
+end
+
+def fun_l13_n525(x)
+    if (x < 1)
+        fun_l14_n552(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n526(x)
+    if (x < 1)
+        fun_l14_n224(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n527(x)
+    if (x < 1)
+        fun_l14_n113(x)
+    else
+        fun_l14_n193(x)
+    end
+end
+
+def fun_l13_n528(x)
+    if (x < 1)
+        fun_l14_n389(x)
+    else
+        fun_l14_n332(x)
+    end
+end
+
+def fun_l13_n529(x)
+    if (x < 1)
+        fun_l14_n881(x)
+    else
+        fun_l14_n655(x)
+    end
+end
+
+def fun_l13_n530(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n588(x)
+    end
+end
+
+def fun_l13_n531(x)
+    if (x < 1)
+        fun_l14_n70(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n532(x)
+    if (x < 1)
+        fun_l14_n617(x)
+    else
+        fun_l14_n477(x)
+    end
+end
+
+def fun_l13_n533(x)
+    if (x < 1)
+        fun_l14_n655(x)
+    else
+        fun_l14_n801(x)
+    end
+end
+
+def fun_l13_n534(x)
+    if (x < 1)
+        fun_l14_n665(x)
+    else
+        fun_l14_n22(x)
+    end
+end
+
+def fun_l13_n535(x)
+    if (x < 1)
+        fun_l14_n314(x)
+    else
+        fun_l14_n924(x)
+    end
+end
+
+def fun_l13_n536(x)
+    if (x < 1)
+        fun_l14_n619(x)
+    else
+        fun_l14_n455(x)
+    end
+end
+
+def fun_l13_n537(x)
+    if (x < 1)
+        fun_l14_n183(x)
+    else
+        fun_l14_n767(x)
+    end
+end
+
+def fun_l13_n538(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n352(x)
+    end
+end
+
+def fun_l13_n539(x)
+    if (x < 1)
+        fun_l14_n540(x)
+    else
+        fun_l14_n813(x)
+    end
+end
+
+def fun_l13_n540(x)
+    if (x < 1)
+        fun_l14_n429(x)
+    else
+        fun_l14_n515(x)
+    end
+end
+
+def fun_l13_n541(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n341(x)
+    end
+end
+
+def fun_l13_n542(x)
+    if (x < 1)
+        fun_l14_n910(x)
+    else
+        fun_l14_n882(x)
+    end
+end
+
+def fun_l13_n543(x)
+    if (x < 1)
+        fun_l14_n971(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n544(x)
+    if (x < 1)
+        fun_l14_n344(x)
+    else
+        fun_l14_n419(x)
+    end
+end
+
+def fun_l13_n545(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n996(x)
+    end
+end
+
+def fun_l13_n546(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n431(x)
+    end
+end
+
+def fun_l13_n547(x)
+    if (x < 1)
+        fun_l14_n548(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n548(x)
+    if (x < 1)
+        fun_l14_n420(x)
+    else
+        fun_l14_n506(x)
+    end
+end
+
+def fun_l13_n549(x)
+    if (x < 1)
+        fun_l14_n992(x)
+    else
+        fun_l14_n213(x)
+    end
+end
+
+def fun_l13_n550(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n666(x)
+    end
+end
+
+def fun_l13_n551(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n908(x)
+    end
+end
+
+def fun_l13_n552(x)
+    if (x < 1)
+        fun_l14_n708(x)
+    else
+        fun_l14_n308(x)
+    end
+end
+
+def fun_l13_n553(x)
+    if (x < 1)
+        fun_l14_n797(x)
+    else
+        fun_l14_n622(x)
+    end
+end
+
+def fun_l13_n554(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n102(x)
+    end
+end
+
+def fun_l13_n555(x)
+    if (x < 1)
+        fun_l14_n614(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n556(x)
+    if (x < 1)
+        fun_l14_n368(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n557(x)
+    if (x < 1)
+        fun_l14_n782(x)
+    else
+        fun_l14_n659(x)
+    end
+end
+
+def fun_l13_n558(x)
+    if (x < 1)
+        fun_l14_n544(x)
+    else
+        fun_l14_n507(x)
+    end
+end
+
+def fun_l13_n559(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n97(x)
+    end
+end
+
+def fun_l13_n560(x)
+    if (x < 1)
+        fun_l14_n390(x)
+    else
+        fun_l14_n93(x)
+    end
+end
+
+def fun_l13_n561(x)
+    if (x < 1)
+        fun_l14_n28(x)
+    else
+        fun_l14_n267(x)
+    end
+end
+
+def fun_l13_n562(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n990(x)
+    end
+end
+
+def fun_l13_n563(x)
+    if (x < 1)
+        fun_l14_n428(x)
+    else
+        fun_l14_n878(x)
+    end
+end
+
+def fun_l13_n564(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n724(x)
+    end
+end
+
+def fun_l13_n565(x)
+    if (x < 1)
+        fun_l14_n524(x)
+    else
+        fun_l14_n87(x)
+    end
+end
+
+def fun_l13_n566(x)
+    if (x < 1)
+        fun_l14_n213(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n567(x)
+    if (x < 1)
+        fun_l14_n821(x)
+    else
+        fun_l14_n478(x)
+    end
+end
+
+def fun_l13_n568(x)
+    if (x < 1)
+        fun_l14_n580(x)
+    else
+        fun_l14_n731(x)
+    end
+end
+
+def fun_l13_n569(x)
+    if (x < 1)
+        fun_l14_n673(x)
+    else
+        fun_l14_n780(x)
+    end
+end
+
+def fun_l13_n570(x)
+    if (x < 1)
+        fun_l14_n791(x)
+    else
+        fun_l14_n691(x)
+    end
+end
+
+def fun_l13_n571(x)
+    if (x < 1)
+        fun_l14_n192(x)
+    else
+        fun_l14_n712(x)
+    end
+end
+
+def fun_l13_n572(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n732(x)
+    end
+end
+
+def fun_l13_n573(x)
+    if (x < 1)
+        fun_l14_n180(x)
+    else
+        fun_l14_n260(x)
+    end
+end
+
+def fun_l13_n574(x)
+    if (x < 1)
+        fun_l14_n609(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n575(x)
+    if (x < 1)
+        fun_l14_n993(x)
+    else
+        fun_l14_n510(x)
+    end
+end
+
+def fun_l13_n576(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n915(x)
+    end
+end
+
+def fun_l13_n577(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n21(x)
+    end
+end
+
+def fun_l13_n578(x)
+    if (x < 1)
+        fun_l14_n330(x)
+    else
+        fun_l14_n860(x)
+    end
+end
+
+def fun_l13_n579(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n87(x)
+    end
+end
+
+def fun_l13_n580(x)
+    if (x < 1)
+        fun_l14_n404(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n581(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n582(x)
+    if (x < 1)
+        fun_l14_n272(x)
+    else
+        fun_l14_n438(x)
+    end
+end
+
+def fun_l13_n583(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n414(x)
+    end
+end
+
+def fun_l13_n584(x)
+    if (x < 1)
+        fun_l14_n38(x)
+    else
+        fun_l14_n676(x)
+    end
+end
+
+def fun_l13_n585(x)
+    if (x < 1)
+        fun_l14_n104(x)
+    else
+        fun_l14_n566(x)
+    end
+end
+
+def fun_l13_n586(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n601(x)
+    end
+end
+
+def fun_l13_n587(x)
+    if (x < 1)
+        fun_l14_n20(x)
+    else
+        fun_l14_n242(x)
+    end
+end
+
+def fun_l13_n588(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n744(x)
+    end
+end
+
+def fun_l13_n589(x)
+    if (x < 1)
+        fun_l14_n702(x)
+    else
+        fun_l14_n456(x)
+    end
+end
+
+def fun_l13_n590(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n493(x)
+    end
+end
+
+def fun_l13_n591(x)
+    if (x < 1)
+        fun_l14_n51(x)
+    else
+        fun_l14_n193(x)
+    end
+end
+
+def fun_l13_n592(x)
+    if (x < 1)
+        fun_l14_n512(x)
+    else
+        fun_l14_n382(x)
+    end
+end
+
+def fun_l13_n593(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n594(x)
+    if (x < 1)
+        fun_l14_n586(x)
+    else
+        fun_l14_n130(x)
+    end
+end
+
+def fun_l13_n595(x)
+    if (x < 1)
+        fun_l14_n348(x)
+    else
+        fun_l14_n214(x)
+    end
+end
+
+def fun_l13_n596(x)
+    if (x < 1)
+        fun_l14_n193(x)
+    else
+        fun_l14_n490(x)
+    end
+end
+
+def fun_l13_n597(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n824(x)
+    end
+end
+
+def fun_l13_n598(x)
+    if (x < 1)
+        fun_l14_n555(x)
+    else
+        fun_l14_n546(x)
+    end
+end
+
+def fun_l13_n599(x)
+    if (x < 1)
+        fun_l14_n244(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n600(x)
+    if (x < 1)
+        fun_l14_n786(x)
+    else
+        fun_l14_n817(x)
+    end
+end
+
+def fun_l13_n601(x)
+    if (x < 1)
+        fun_l14_n991(x)
+    else
+        fun_l14_n691(x)
+    end
+end
+
+def fun_l13_n602(x)
+    if (x < 1)
+        fun_l14_n369(x)
+    else
+        fun_l14_n85(x)
+    end
+end
+
+def fun_l13_n603(x)
+    if (x < 1)
+        fun_l14_n232(x)
+    else
+        fun_l14_n287(x)
+    end
+end
+
+def fun_l13_n604(x)
+    if (x < 1)
+        fun_l14_n397(x)
+    else
+        fun_l14_n59(x)
+    end
+end
+
+def fun_l13_n605(x)
+    if (x < 1)
+        fun_l14_n394(x)
+    else
+        fun_l14_n297(x)
+    end
+end
+
+def fun_l13_n606(x)
+    if (x < 1)
+        fun_l14_n676(x)
+    else
+        fun_l14_n444(x)
+    end
+end
+
+def fun_l13_n607(x)
+    if (x < 1)
+        fun_l14_n894(x)
+    else
+        fun_l14_n147(x)
+    end
+end
+
+def fun_l13_n608(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n880(x)
+    end
+end
+
+def fun_l13_n609(x)
+    if (x < 1)
+        fun_l14_n306(x)
+    else
+        fun_l14_n610(x)
+    end
+end
+
+def fun_l13_n610(x)
+    if (x < 1)
+        fun_l14_n884(x)
+    else
+        fun_l14_n202(x)
+    end
+end
+
+def fun_l13_n611(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n592(x)
+    end
+end
+
+def fun_l13_n612(x)
+    if (x < 1)
+        fun_l14_n477(x)
+    else
+        fun_l14_n614(x)
+    end
+end
+
+def fun_l13_n613(x)
+    if (x < 1)
+        fun_l14_n372(x)
+    else
+        fun_l14_n330(x)
+    end
+end
+
+def fun_l13_n614(x)
+    if (x < 1)
+        fun_l14_n767(x)
+    else
+        fun_l14_n277(x)
+    end
+end
+
+def fun_l13_n615(x)
+    if (x < 1)
+        fun_l14_n530(x)
+    else
+        fun_l14_n24(x)
+    end
+end
+
+def fun_l13_n616(x)
+    if (x < 1)
+        fun_l14_n657(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n617(x)
+    if (x < 1)
+        fun_l14_n559(x)
+    else
+        fun_l14_n125(x)
+    end
+end
+
+def fun_l13_n618(x)
+    if (x < 1)
+        fun_l14_n855(x)
+    else
+        fun_l14_n353(x)
+    end
+end
+
+def fun_l13_n619(x)
+    if (x < 1)
+        fun_l14_n635(x)
+    else
+        fun_l14_n907(x)
+    end
+end
+
+def fun_l13_n620(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n7(x)
+    end
+end
+
+def fun_l13_n621(x)
+    if (x < 1)
+        fun_l14_n568(x)
+    else
+        fun_l14_n393(x)
+    end
+end
+
+def fun_l13_n622(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n623(x)
+    if (x < 1)
+        fun_l14_n249(x)
+    else
+        fun_l14_n139(x)
+    end
+end
+
+def fun_l13_n624(x)
+    if (x < 1)
+        fun_l14_n961(x)
+    else
+        fun_l14_n897(x)
+    end
+end
+
+def fun_l13_n625(x)
+    if (x < 1)
+        fun_l14_n535(x)
+    else
+        fun_l14_n252(x)
+    end
+end
+
+def fun_l13_n626(x)
+    if (x < 1)
+        fun_l14_n832(x)
+    else
+        fun_l14_n995(x)
+    end
+end
+
+def fun_l13_n627(x)
+    if (x < 1)
+        fun_l14_n896(x)
+    else
+        fun_l14_n173(x)
+    end
+end
+
+def fun_l13_n628(x)
+    if (x < 1)
+        fun_l14_n939(x)
+    else
+        fun_l14_n852(x)
+    end
+end
+
+def fun_l13_n629(x)
+    if (x < 1)
+        fun_l14_n424(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n630(x)
+    if (x < 1)
+        fun_l14_n822(x)
+    else
+        fun_l14_n523(x)
+    end
+end
+
+def fun_l13_n631(x)
+    if (x < 1)
+        fun_l14_n697(x)
+    else
+        fun_l14_n939(x)
+    end
+end
+
+def fun_l13_n632(x)
+    if (x < 1)
+        fun_l14_n831(x)
+    else
+        fun_l14_n722(x)
+    end
+end
+
+def fun_l13_n633(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n994(x)
+    end
+end
+
+def fun_l13_n634(x)
+    if (x < 1)
+        fun_l14_n568(x)
+    else
+        fun_l14_n636(x)
+    end
+end
+
+def fun_l13_n635(x)
+    if (x < 1)
+        fun_l14_n573(x)
+    else
+        fun_l14_n156(x)
+    end
+end
+
+def fun_l13_n636(x)
+    if (x < 1)
+        fun_l14_n682(x)
+    else
+        fun_l14_n999(x)
+    end
+end
+
+def fun_l13_n637(x)
+    if (x < 1)
+        fun_l14_n648(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n638(x)
+    if (x < 1)
+        fun_l14_n395(x)
+    else
+        fun_l14_n837(x)
+    end
+end
+
+def fun_l13_n639(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n508(x)
+    end
+end
+
+def fun_l13_n640(x)
+    if (x < 1)
+        fun_l14_n530(x)
+    else
+        fun_l14_n542(x)
+    end
+end
+
+def fun_l13_n641(x)
+    if (x < 1)
+        fun_l14_n227(x)
+    else
+        fun_l14_n939(x)
+    end
+end
+
+def fun_l13_n642(x)
+    if (x < 1)
+        fun_l14_n415(x)
+    else
+        fun_l14_n79(x)
+    end
+end
+
+def fun_l13_n643(x)
+    if (x < 1)
+        fun_l14_n354(x)
+    else
+        fun_l14_n606(x)
+    end
+end
+
+def fun_l13_n644(x)
+    if (x < 1)
+        fun_l14_n270(x)
+    else
+        fun_l14_n644(x)
+    end
+end
+
+def fun_l13_n645(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n299(x)
+    end
+end
+
+def fun_l13_n646(x)
+    if (x < 1)
+        fun_l14_n384(x)
+    else
+        fun_l14_n97(x)
+    end
+end
+
+def fun_l13_n647(x)
+    if (x < 1)
+        fun_l14_n86(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n648(x)
+    if (x < 1)
+        fun_l14_n765(x)
+    else
+        fun_l14_n498(x)
+    end
+end
+
+def fun_l13_n649(x)
+    if (x < 1)
+        fun_l14_n135(x)
+    else
+        fun_l14_n993(x)
+    end
+end
+
+def fun_l13_n650(x)
+    if (x < 1)
+        fun_l14_n837(x)
+    else
+        fun_l14_n576(x)
+    end
+end
+
+def fun_l13_n651(x)
+    if (x < 1)
+        fun_l14_n75(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n652(x)
+    if (x < 1)
+        fun_l14_n932(x)
+    else
+        fun_l14_n646(x)
+    end
+end
+
+def fun_l13_n653(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n654(x)
+    if (x < 1)
+        fun_l14_n540(x)
+    else
+        fun_l14_n946(x)
+    end
+end
+
+def fun_l13_n655(x)
+    if (x < 1)
+        fun_l14_n686(x)
+    else
+        fun_l14_n926(x)
+    end
+end
+
+def fun_l13_n656(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n815(x)
+    end
+end
+
+def fun_l13_n657(x)
+    if (x < 1)
+        fun_l14_n101(x)
+    else
+        fun_l14_n960(x)
+    end
+end
+
+def fun_l13_n658(x)
+    if (x < 1)
+        fun_l14_n956(x)
+    else
+        fun_l14_n980(x)
+    end
+end
+
+def fun_l13_n659(x)
+    if (x < 1)
+        fun_l14_n196(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n660(x)
+    if (x < 1)
+        fun_l14_n83(x)
+    else
+        fun_l14_n288(x)
+    end
+end
+
+def fun_l13_n661(x)
+    if (x < 1)
+        fun_l14_n907(x)
+    else
+        fun_l14_n719(x)
+    end
+end
+
+def fun_l13_n662(x)
+    if (x < 1)
+        fun_l14_n922(x)
+    else
+        fun_l14_n186(x)
+    end
+end
+
+def fun_l13_n663(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n890(x)
+    end
+end
+
+def fun_l13_n664(x)
+    if (x < 1)
+        fun_l14_n310(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n665(x)
+    if (x < 1)
+        fun_l14_n584(x)
+    else
+        fun_l14_n322(x)
+    end
+end
+
+def fun_l13_n666(x)
+    if (x < 1)
+        fun_l14_n385(x)
+    else
+        fun_l14_n466(x)
+    end
+end
+
+def fun_l13_n667(x)
+    if (x < 1)
+        fun_l14_n387(x)
+    else
+        fun_l14_n284(x)
+    end
+end
+
+def fun_l13_n668(x)
+    if (x < 1)
+        fun_l14_n834(x)
+    else
+        fun_l14_n446(x)
+    end
+end
+
+def fun_l13_n669(x)
+    if (x < 1)
+        fun_l14_n839(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n670(x)
+    if (x < 1)
+        fun_l14_n666(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n671(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n83(x)
+    end
+end
+
+def fun_l13_n672(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n332(x)
+    end
+end
+
+def fun_l13_n673(x)
+    if (x < 1)
+        fun_l14_n776(x)
+    else
+        fun_l14_n818(x)
+    end
+end
+
+def fun_l13_n674(x)
+    if (x < 1)
+        fun_l14_n82(x)
+    else
+        fun_l14_n594(x)
+    end
+end
+
+def fun_l13_n675(x)
+    if (x < 1)
+        fun_l14_n491(x)
+    else
+        fun_l14_n0(x)
+    end
+end
+
+def fun_l13_n676(x)
+    if (x < 1)
+        fun_l14_n963(x)
+    else
+        fun_l14_n634(x)
+    end
+end
+
+def fun_l13_n677(x)
+    if (x < 1)
+        fun_l14_n716(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n678(x)
+    if (x < 1)
+        fun_l14_n997(x)
+    else
+        fun_l14_n933(x)
+    end
+end
+
+def fun_l13_n679(x)
+    if (x < 1)
+        fun_l14_n171(x)
+    else
+        fun_l14_n356(x)
+    end
+end
+
+def fun_l13_n680(x)
+    if (x < 1)
+        fun_l14_n214(x)
+    else
+        fun_l14_n360(x)
+    end
+end
+
+def fun_l13_n681(x)
+    if (x < 1)
+        fun_l14_n758(x)
+    else
+        fun_l14_n185(x)
+    end
+end
+
+def fun_l13_n682(x)
+    if (x < 1)
+        fun_l14_n480(x)
+    else
+        fun_l14_n572(x)
+    end
+end
+
+def fun_l13_n683(x)
+    if (x < 1)
+        fun_l14_n595(x)
+    else
+        fun_l14_n534(x)
+    end
+end
+
+def fun_l13_n684(x)
+    if (x < 1)
+        fun_l14_n462(x)
+    else
+        fun_l14_n481(x)
+    end
+end
+
+def fun_l13_n685(x)
+    if (x < 1)
+        fun_l14_n946(x)
+    else
+        fun_l14_n726(x)
+    end
+end
+
+def fun_l13_n686(x)
+    if (x < 1)
+        fun_l14_n428(x)
+    else
+        fun_l14_n256(x)
+    end
+end
+
+def fun_l13_n687(x)
+    if (x < 1)
+        fun_l14_n562(x)
+    else
+        fun_l14_n290(x)
+    end
+end
+
+def fun_l13_n688(x)
+    if (x < 1)
+        fun_l14_n679(x)
+    else
+        fun_l14_n787(x)
+    end
+end
+
+def fun_l13_n689(x)
+    if (x < 1)
+        fun_l14_n972(x)
+    else
+        fun_l14_n809(x)
+    end
+end
+
+def fun_l13_n690(x)
+    if (x < 1)
+        fun_l14_n700(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n691(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n251(x)
+    end
+end
+
+def fun_l13_n692(x)
+    if (x < 1)
+        fun_l14_n4(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n693(x)
+    if (x < 1)
+        fun_l14_n362(x)
+    else
+        fun_l14_n495(x)
+    end
+end
+
+def fun_l13_n694(x)
+    if (x < 1)
+        fun_l14_n466(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n695(x)
+    if (x < 1)
+        fun_l14_n244(x)
+    else
+        fun_l14_n233(x)
+    end
+end
+
+def fun_l13_n696(x)
+    if (x < 1)
+        fun_l14_n920(x)
+    else
+        fun_l14_n124(x)
+    end
+end
+
+def fun_l13_n697(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n417(x)
+    end
+end
+
+def fun_l13_n698(x)
+    if (x < 1)
+        fun_l14_n756(x)
+    else
+        fun_l14_n683(x)
+    end
+end
+
+def fun_l13_n699(x)
+    if (x < 1)
+        fun_l14_n487(x)
+    else
+        fun_l14_n191(x)
+    end
+end
+
+def fun_l13_n700(x)
+    if (x < 1)
+        fun_l14_n316(x)
+    else
+        fun_l14_n123(x)
+    end
+end
+
+def fun_l13_n701(x)
+    if (x < 1)
+        fun_l14_n851(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n702(x)
+    if (x < 1)
+        fun_l14_n766(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n703(x)
+    if (x < 1)
+        fun_l14_n689(x)
+    else
+        fun_l14_n524(x)
+    end
+end
+
+def fun_l13_n704(x)
+    if (x < 1)
+        fun_l14_n23(x)
+    else
+        fun_l14_n866(x)
+    end
+end
+
+def fun_l13_n705(x)
+    if (x < 1)
+        fun_l14_n62(x)
+    else
+        fun_l14_n926(x)
+    end
+end
+
+def fun_l13_n706(x)
+    if (x < 1)
+        fun_l14_n53(x)
+    else
+        fun_l14_n567(x)
+    end
+end
+
+def fun_l13_n707(x)
+    if (x < 1)
+        fun_l14_n756(x)
+    else
+        fun_l14_n595(x)
+    end
+end
+
+def fun_l13_n708(x)
+    if (x < 1)
+        fun_l14_n495(x)
+    else
+        fun_l14_n698(x)
+    end
+end
+
+def fun_l13_n709(x)
+    if (x < 1)
+        fun_l14_n511(x)
+    else
+        fun_l14_n131(x)
+    end
+end
+
+def fun_l13_n710(x)
+    if (x < 1)
+        fun_l14_n593(x)
+    else
+        fun_l14_n233(x)
+    end
+end
+
+def fun_l13_n711(x)
+    if (x < 1)
+        fun_l14_n846(x)
+    else
+        fun_l14_n166(x)
+    end
+end
+
+def fun_l13_n712(x)
+    if (x < 1)
+        fun_l14_n759(x)
+    else
+        fun_l14_n103(x)
+    end
+end
+
+def fun_l13_n713(x)
+    if (x < 1)
+        fun_l14_n364(x)
+    else
+        fun_l14_n805(x)
+    end
+end
+
+def fun_l13_n714(x)
+    if (x < 1)
+        fun_l14_n957(x)
+    else
+        fun_l14_n85(x)
+    end
+end
+
+def fun_l13_n715(x)
+    if (x < 1)
+        fun_l14_n877(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n716(x)
+    if (x < 1)
+        fun_l14_n290(x)
+    else
+        fun_l14_n894(x)
+    end
+end
+
+def fun_l13_n717(x)
+    if (x < 1)
+        fun_l14_n354(x)
+    else
+        fun_l14_n646(x)
+    end
+end
+
+def fun_l13_n718(x)
+    if (x < 1)
+        fun_l14_n364(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n719(x)
+    if (x < 1)
+        fun_l14_n392(x)
+    else
+        fun_l14_n537(x)
+    end
+end
+
+def fun_l13_n720(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n721(x)
+    if (x < 1)
+        fun_l14_n153(x)
+    else
+        fun_l14_n925(x)
+    end
+end
+
+def fun_l13_n722(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n482(x)
+    end
+end
+
+def fun_l13_n723(x)
+    if (x < 1)
+        fun_l14_n981(x)
+    else
+        fun_l14_n364(x)
+    end
+end
+
+def fun_l13_n724(x)
+    if (x < 1)
+        fun_l14_n869(x)
+    else
+        fun_l14_n871(x)
+    end
+end
+
+def fun_l13_n725(x)
+    if (x < 1)
+        fun_l14_n693(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n726(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n654(x)
+    end
+end
+
+def fun_l13_n727(x)
+    if (x < 1)
+        fun_l14_n150(x)
+    else
+        fun_l14_n904(x)
+    end
+end
+
+def fun_l13_n728(x)
+    if (x < 1)
+        fun_l14_n843(x)
+    else
+        fun_l14_n556(x)
+    end
+end
+
+def fun_l13_n729(x)
+    if (x < 1)
+        fun_l14_n726(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n730(x)
+    if (x < 1)
+        fun_l14_n976(x)
+    else
+        fun_l14_n740(x)
+    end
+end
+
+def fun_l13_n731(x)
+    if (x < 1)
+        fun_l14_n709(x)
+    else
+        fun_l14_n293(x)
+    end
+end
+
+def fun_l13_n732(x)
+    if (x < 1)
+        fun_l14_n858(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n733(x)
+    if (x < 1)
+        fun_l14_n789(x)
+    else
+        fun_l14_n475(x)
+    end
+end
+
+def fun_l13_n734(x)
+    if (x < 1)
+        fun_l14_n813(x)
+    else
+        fun_l14_n359(x)
+    end
+end
+
+def fun_l13_n735(x)
+    if (x < 1)
+        fun_l14_n209(x)
+    else
+        fun_l14_n29(x)
+    end
+end
+
+def fun_l13_n736(x)
+    if (x < 1)
+        fun_l14_n710(x)
+    else
+        fun_l14_n823(x)
+    end
+end
+
+def fun_l13_n737(x)
+    if (x < 1)
+        fun_l14_n434(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n738(x)
+    if (x < 1)
+        fun_l14_n184(x)
+    else
+        fun_l14_n902(x)
+    end
+end
+
+def fun_l13_n739(x)
+    if (x < 1)
+        fun_l14_n206(x)
+    else
+        fun_l14_n65(x)
+    end
+end
+
+def fun_l13_n740(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n956(x)
+    end
+end
+
+def fun_l13_n741(x)
+    if (x < 1)
+        fun_l14_n91(x)
+    else
+        fun_l14_n341(x)
+    end
+end
+
+def fun_l13_n742(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n864(x)
+    end
+end
+
+def fun_l13_n743(x)
+    if (x < 1)
+        fun_l14_n426(x)
+    else
+        fun_l14_n302(x)
+    end
+end
+
+def fun_l13_n744(x)
+    if (x < 1)
+        fun_l14_n241(x)
+    else
+        fun_l14_n151(x)
+    end
+end
+
+def fun_l13_n745(x)
+    if (x < 1)
+        fun_l14_n161(x)
+    else
+        fun_l14_n715(x)
+    end
+end
+
+def fun_l13_n746(x)
+    if (x < 1)
+        fun_l14_n925(x)
+    else
+        fun_l14_n840(x)
+    end
+end
+
+def fun_l13_n747(x)
+    if (x < 1)
+        fun_l14_n864(x)
+    else
+        fun_l14_n610(x)
+    end
+end
+
+def fun_l13_n748(x)
+    if (x < 1)
+        fun_l14_n322(x)
+    else
+        fun_l14_n69(x)
+    end
+end
+
+def fun_l13_n749(x)
+    if (x < 1)
+        fun_l14_n847(x)
+    else
+        fun_l14_n3(x)
+    end
+end
+
+def fun_l13_n750(x)
+    if (x < 1)
+        fun_l14_n124(x)
+    else
+        fun_l14_n915(x)
+    end
+end
+
+def fun_l13_n751(x)
+    if (x < 1)
+        fun_l14_n163(x)
+    else
+        fun_l14_n136(x)
+    end
+end
+
+def fun_l13_n752(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n753(x)
+    if (x < 1)
+        fun_l14_n109(x)
+    else
+        fun_l14_n208(x)
+    end
+end
+
+def fun_l13_n754(x)
+    if (x < 1)
+        fun_l14_n597(x)
+    else
+        fun_l14_n307(x)
+    end
+end
+
+def fun_l13_n755(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n756(x)
+    if (x < 1)
+        fun_l14_n236(x)
+    else
+        fun_l14_n716(x)
+    end
+end
+
+def fun_l13_n757(x)
+    if (x < 1)
+        fun_l14_n326(x)
+    else
+        fun_l14_n870(x)
+    end
+end
+
+def fun_l13_n758(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n224(x)
+    end
+end
+
+def fun_l13_n759(x)
+    if (x < 1)
+        fun_l14_n141(x)
+    else
+        fun_l14_n232(x)
+    end
+end
+
+def fun_l13_n760(x)
+    if (x < 1)
+        fun_l14_n653(x)
+    else
+        fun_l14_n559(x)
+    end
+end
+
+def fun_l13_n761(x)
+    if (x < 1)
+        fun_l14_n305(x)
+    else
+        fun_l14_n296(x)
+    end
+end
+
+def fun_l13_n762(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n351(x)
+    end
+end
+
+def fun_l13_n763(x)
+    if (x < 1)
+        fun_l14_n685(x)
+    else
+        fun_l14_n643(x)
+    end
+end
+
+def fun_l13_n764(x)
+    if (x < 1)
+        fun_l14_n180(x)
+    else
+        fun_l14_n348(x)
+    end
+end
+
+def fun_l13_n765(x)
+    if (x < 1)
+        fun_l14_n72(x)
+    else
+        fun_l14_n99(x)
+    end
+end
+
+def fun_l13_n766(x)
+    if (x < 1)
+        fun_l14_n463(x)
+    else
+        fun_l14_n135(x)
+    end
+end
+
+def fun_l13_n767(x)
+    if (x < 1)
+        fun_l14_n461(x)
+    else
+        fun_l14_n989(x)
+    end
+end
+
+def fun_l13_n768(x)
+    if (x < 1)
+        fun_l14_n759(x)
+    else
+        fun_l14_n907(x)
+    end
+end
+
+def fun_l13_n769(x)
+    if (x < 1)
+        fun_l14_n330(x)
+    else
+        fun_l14_n268(x)
+    end
+end
+
+def fun_l13_n770(x)
+    if (x < 1)
+        fun_l14_n809(x)
+    else
+        fun_l14_n46(x)
+    end
+end
+
+def fun_l13_n771(x)
+    if (x < 1)
+        fun_l14_n396(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n772(x)
+    if (x < 1)
+        fun_l14_n300(x)
+    else
+        fun_l14_n60(x)
+    end
+end
+
+def fun_l13_n773(x)
+    if (x < 1)
+        fun_l14_n938(x)
+    else
+        fun_l14_n112(x)
+    end
+end
+
+def fun_l13_n774(x)
+    if (x < 1)
+        fun_l14_n862(x)
+    else
+        fun_l14_n503(x)
+    end
+end
+
+def fun_l13_n775(x)
+    if (x < 1)
+        fun_l14_n305(x)
+    else
+        fun_l14_n11(x)
+    end
+end
+
+def fun_l13_n776(x)
+    if (x < 1)
+        fun_l14_n638(x)
+    else
+        fun_l14_n161(x)
+    end
+end
+
+def fun_l13_n777(x)
+    if (x < 1)
+        fun_l14_n2(x)
+    else
+        fun_l14_n176(x)
+    end
+end
+
+def fun_l13_n778(x)
+    if (x < 1)
+        fun_l14_n967(x)
+    else
+        fun_l14_n739(x)
+    end
+end
+
+def fun_l13_n779(x)
+    if (x < 1)
+        fun_l14_n961(x)
+    else
+        fun_l14_n609(x)
+    end
+end
+
+def fun_l13_n780(x)
+    if (x < 1)
+        fun_l14_n207(x)
+    else
+        fun_l14_n910(x)
+    end
+end
+
+def fun_l13_n781(x)
+    if (x < 1)
+        fun_l14_n370(x)
+    else
+        fun_l14_n163(x)
+    end
+end
+
+def fun_l13_n782(x)
+    if (x < 1)
+        fun_l14_n140(x)
+    else
+        fun_l14_n816(x)
+    end
+end
+
+def fun_l13_n783(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n406(x)
+    end
+end
+
+def fun_l13_n784(x)
+    if (x < 1)
+        fun_l14_n790(x)
+    else
+        fun_l14_n175(x)
+    end
+end
+
+def fun_l13_n785(x)
+    if (x < 1)
+        fun_l14_n644(x)
+    else
+        fun_l14_n713(x)
+    end
+end
+
+def fun_l13_n786(x)
+    if (x < 1)
+        fun_l14_n800(x)
+    else
+        fun_l14_n257(x)
+    end
+end
+
+def fun_l13_n787(x)
+    if (x < 1)
+        fun_l14_n248(x)
+    else
+        fun_l14_n709(x)
+    end
+end
+
+def fun_l13_n788(x)
+    if (x < 1)
+        fun_l14_n280(x)
+    else
+        fun_l14_n485(x)
+    end
+end
+
+def fun_l13_n789(x)
+    if (x < 1)
+        fun_l14_n900(x)
+    else
+        fun_l14_n675(x)
+    end
+end
+
+def fun_l13_n790(x)
+    if (x < 1)
+        fun_l14_n65(x)
+    else
+        fun_l14_n426(x)
+    end
+end
+
+def fun_l13_n791(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n484(x)
+    end
+end
+
+def fun_l13_n792(x)
+    if (x < 1)
+        fun_l14_n741(x)
+    else
+        fun_l14_n13(x)
+    end
+end
+
+def fun_l13_n793(x)
+    if (x < 1)
+        fun_l14_n550(x)
+    else
+        fun_l14_n884(x)
+    end
+end
+
+def fun_l13_n794(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n262(x)
+    end
+end
+
+def fun_l13_n795(x)
+    if (x < 1)
+        fun_l14_n537(x)
+    else
+        fun_l14_n980(x)
+    end
+end
+
+def fun_l13_n796(x)
+    if (x < 1)
+        fun_l14_n742(x)
+    else
+        fun_l14_n6(x)
+    end
+end
+
+def fun_l13_n797(x)
+    if (x < 1)
+        fun_l14_n986(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n798(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n658(x)
+    end
+end
+
+def fun_l13_n799(x)
+    if (x < 1)
+        fun_l14_n838(x)
+    else
+        fun_l14_n810(x)
+    end
+end
+
+def fun_l13_n800(x)
+    if (x < 1)
+        fun_l14_n79(x)
+    else
+        fun_l14_n695(x)
+    end
+end
+
+def fun_l13_n801(x)
+    if (x < 1)
+        fun_l14_n99(x)
+    else
+        fun_l14_n26(x)
+    end
+end
+
+def fun_l13_n802(x)
+    if (x < 1)
+        fun_l14_n839(x)
+    else
+        fun_l14_n430(x)
+    end
+end
+
+def fun_l13_n803(x)
+    if (x < 1)
+        fun_l14_n410(x)
+    else
+        fun_l14_n403(x)
+    end
+end
+
+def fun_l13_n804(x)
+    if (x < 1)
+        fun_l14_n143(x)
+    else
+        fun_l14_n689(x)
+    end
+end
+
+def fun_l13_n805(x)
+    if (x < 1)
+        fun_l14_n695(x)
+    else
+        fun_l14_n721(x)
+    end
+end
+
+def fun_l13_n806(x)
+    if (x < 1)
+        fun_l14_n418(x)
+    else
+        fun_l14_n508(x)
+    end
+end
+
+def fun_l13_n807(x)
+    if (x < 1)
+        fun_l14_n569(x)
+    else
+        fun_l14_n86(x)
+    end
+end
+
+def fun_l13_n808(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n690(x)
+    end
+end
+
+def fun_l13_n809(x)
+    if (x < 1)
+        fun_l14_n283(x)
+    else
+        fun_l14_n630(x)
+    end
+end
+
+def fun_l13_n810(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n180(x)
+    end
+end
+
+def fun_l13_n811(x)
+    if (x < 1)
+        fun_l14_n669(x)
+    else
+        fun_l14_n131(x)
+    end
+end
+
+def fun_l13_n812(x)
+    if (x < 1)
+        fun_l14_n972(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n813(x)
+    if (x < 1)
+        fun_l14_n585(x)
+    else
+        fun_l14_n244(x)
+    end
+end
+
+def fun_l13_n814(x)
+    if (x < 1)
+        fun_l14_n277(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n815(x)
+    if (x < 1)
+        fun_l14_n908(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n816(x)
+    if (x < 1)
+        fun_l14_n520(x)
+    else
+        fun_l14_n382(x)
+    end
+end
+
+def fun_l13_n817(x)
+    if (x < 1)
+        fun_l14_n40(x)
+    else
+        fun_l14_n757(x)
+    end
+end
+
+def fun_l13_n818(x)
+    if (x < 1)
+        fun_l14_n220(x)
+    else
+        fun_l14_n781(x)
+    end
+end
+
+def fun_l13_n819(x)
+    if (x < 1)
+        fun_l14_n507(x)
+    else
+        fun_l14_n602(x)
+    end
+end
+
+def fun_l13_n820(x)
+    if (x < 1)
+        fun_l14_n39(x)
+    else
+        fun_l14_n798(x)
+    end
+end
+
+def fun_l13_n821(x)
+    if (x < 1)
+        fun_l14_n412(x)
+    else
+        fun_l14_n58(x)
+    end
+end
+
+def fun_l13_n822(x)
+    if (x < 1)
+        fun_l14_n599(x)
+    else
+        fun_l14_n206(x)
+    end
+end
+
+def fun_l13_n823(x)
+    if (x < 1)
+        fun_l14_n294(x)
+    else
+        fun_l14_n711(x)
+    end
+end
+
+def fun_l13_n824(x)
+    if (x < 1)
+        fun_l14_n421(x)
+    else
+        fun_l14_n191(x)
+    end
+end
+
+def fun_l13_n825(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n547(x)
+    end
+end
+
+def fun_l13_n826(x)
+    if (x < 1)
+        fun_l14_n131(x)
+    else
+        fun_l14_n29(x)
+    end
+end
+
+def fun_l13_n827(x)
+    if (x < 1)
+        fun_l14_n19(x)
+    else
+        fun_l14_n213(x)
+    end
+end
+
+def fun_l13_n828(x)
+    if (x < 1)
+        fun_l14_n202(x)
+    else
+        fun_l14_n195(x)
+    end
+end
+
+def fun_l13_n829(x)
+    if (x < 1)
+        fun_l14_n133(x)
+    else
+        fun_l14_n949(x)
+    end
+end
+
+def fun_l13_n830(x)
+    if (x < 1)
+        fun_l14_n402(x)
+    else
+        fun_l14_n762(x)
+    end
+end
+
+def fun_l13_n831(x)
+    if (x < 1)
+        fun_l14_n233(x)
+    else
+        fun_l14_n984(x)
+    end
+end
+
+def fun_l13_n832(x)
+    if (x < 1)
+        fun_l14_n309(x)
+    else
+        fun_l14_n545(x)
+    end
+end
+
+def fun_l13_n833(x)
+    if (x < 1)
+        fun_l14_n160(x)
+    else
+        fun_l14_n434(x)
+    end
+end
+
+def fun_l13_n834(x)
+    if (x < 1)
+        fun_l14_n909(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n835(x)
+    if (x < 1)
+        fun_l14_n747(x)
+    else
+        fun_l14_n813(x)
+    end
+end
+
+def fun_l13_n836(x)
+    if (x < 1)
+        fun_l14_n338(x)
+    else
+        fun_l14_n592(x)
+    end
+end
+
+def fun_l13_n837(x)
+    if (x < 1)
+        fun_l14_n707(x)
+    else
+        fun_l14_n587(x)
+    end
+end
+
+def fun_l13_n838(x)
+    if (x < 1)
+        fun_l14_n655(x)
+    else
+        fun_l14_n207(x)
+    end
+end
+
+def fun_l13_n839(x)
+    if (x < 1)
+        fun_l14_n231(x)
+    else
+        fun_l14_n459(x)
+    end
+end
+
+def fun_l13_n840(x)
+    if (x < 1)
+        fun_l14_n351(x)
+    else
+        fun_l14_n228(x)
+    end
+end
+
+def fun_l13_n841(x)
+    if (x < 1)
+        fun_l14_n205(x)
+    else
+        fun_l14_n628(x)
+    end
+end
+
+def fun_l13_n842(x)
+    if (x < 1)
+        fun_l14_n725(x)
+    else
+        fun_l14_n246(x)
+    end
+end
+
+def fun_l13_n843(x)
+    if (x < 1)
+        fun_l14_n297(x)
+    else
+        fun_l14_n891(x)
+    end
+end
+
+def fun_l13_n844(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n168(x)
+    end
+end
+
+def fun_l13_n845(x)
+    if (x < 1)
+        fun_l14_n101(x)
+    else
+        fun_l14_n681(x)
+    end
+end
+
+def fun_l13_n846(x)
+    if (x < 1)
+        fun_l14_n162(x)
+    else
+        fun_l14_n270(x)
+    end
+end
+
+def fun_l13_n847(x)
+    if (x < 1)
+        fun_l14_n84(x)
+    else
+        fun_l14_n957(x)
+    end
+end
+
+def fun_l13_n848(x)
+    if (x < 1)
+        fun_l14_n16(x)
+    else
+        fun_l14_n708(x)
+    end
+end
+
+def fun_l13_n849(x)
+    if (x < 1)
+        fun_l14_n636(x)
+    else
+        fun_l14_n518(x)
+    end
+end
+
+def fun_l13_n850(x)
+    if (x < 1)
+        fun_l14_n379(x)
+    else
+        fun_l14_n595(x)
+    end
+end
+
+def fun_l13_n851(x)
+    if (x < 1)
+        fun_l14_n258(x)
+    else
+        fun_l14_n757(x)
+    end
+end
+
+def fun_l13_n852(x)
+    if (x < 1)
+        fun_l14_n995(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n853(x)
+    if (x < 1)
+        fun_l14_n505(x)
+    else
+        fun_l14_n934(x)
+    end
+end
+
+def fun_l13_n854(x)
+    if (x < 1)
+        fun_l14_n268(x)
+    else
+        fun_l14_n36(x)
+    end
+end
+
+def fun_l13_n855(x)
+    if (x < 1)
+        fun_l14_n795(x)
+    else
+        fun_l14_n905(x)
+    end
+end
+
+def fun_l13_n856(x)
+    if (x < 1)
+        fun_l14_n136(x)
+    else
+        fun_l14_n750(x)
+    end
+end
+
+def fun_l13_n857(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n156(x)
+    end
+end
+
+def fun_l13_n858(x)
+    if (x < 1)
+        fun_l14_n157(x)
+    else
+        fun_l14_n414(x)
+    end
+end
+
+def fun_l13_n859(x)
+    if (x < 1)
+        fun_l14_n926(x)
+    else
+        fun_l14_n718(x)
+    end
+end
+
+def fun_l13_n860(x)
+    if (x < 1)
+        fun_l14_n904(x)
+    else
+        fun_l14_n821(x)
+    end
+end
+
+def fun_l13_n861(x)
+    if (x < 1)
+        fun_l14_n887(x)
+    else
+        fun_l14_n407(x)
+    end
+end
+
+def fun_l13_n862(x)
+    if (x < 1)
+        fun_l14_n870(x)
+    else
+        fun_l14_n950(x)
+    end
+end
+
+def fun_l13_n863(x)
+    if (x < 1)
+        fun_l14_n267(x)
+    else
+        fun_l14_n712(x)
+    end
+end
+
+def fun_l13_n864(x)
+    if (x < 1)
+        fun_l14_n409(x)
+    else
+        fun_l14_n309(x)
+    end
+end
+
+def fun_l13_n865(x)
+    if (x < 1)
+        fun_l14_n345(x)
+    else
+        fun_l14_n110(x)
+    end
+end
+
+def fun_l13_n866(x)
+    if (x < 1)
+        fun_l14_n401(x)
+    else
+        fun_l14_n970(x)
+    end
+end
+
+def fun_l13_n867(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n260(x)
+    end
+end
+
+def fun_l13_n868(x)
+    if (x < 1)
+        fun_l14_n490(x)
+    else
+        fun_l14_n31(x)
+    end
+end
+
+def fun_l13_n869(x)
+    if (x < 1)
+        fun_l14_n214(x)
+    else
+        fun_l14_n425(x)
+    end
+end
+
+def fun_l13_n870(x)
+    if (x < 1)
+        fun_l14_n660(x)
+    else
+        fun_l14_n703(x)
+    end
+end
+
+def fun_l13_n871(x)
+    if (x < 1)
+        fun_l14_n650(x)
+    else
+        fun_l14_n257(x)
+    end
+end
+
+def fun_l13_n872(x)
+    if (x < 1)
+        fun_l14_n701(x)
+    else
+        fun_l14_n55(x)
+    end
+end
+
+def fun_l13_n873(x)
+    if (x < 1)
+        fun_l14_n225(x)
+    else
+        fun_l14_n701(x)
+    end
+end
+
+def fun_l13_n874(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n793(x)
+    end
+end
+
+def fun_l13_n875(x)
+    if (x < 1)
+        fun_l14_n87(x)
+    else
+        fun_l14_n807(x)
+    end
+end
+
+def fun_l13_n876(x)
+    if (x < 1)
+        fun_l14_n24(x)
+    else
+        fun_l14_n15(x)
+    end
+end
+
+def fun_l13_n877(x)
+    if (x < 1)
+        fun_l14_n120(x)
+    else
+        fun_l14_n551(x)
+    end
+end
+
+def fun_l13_n878(x)
+    if (x < 1)
+        fun_l14_n703(x)
+    else
+        fun_l14_n67(x)
+    end
+end
+
+def fun_l13_n879(x)
+    if (x < 1)
+        fun_l14_n496(x)
+    else
+        fun_l14_n197(x)
+    end
+end
+
+def fun_l13_n880(x)
+    if (x < 1)
+        fun_l14_n369(x)
+    else
+        fun_l14_n834(x)
+    end
+end
+
+def fun_l13_n881(x)
+    if (x < 1)
+        fun_l14_n892(x)
+    else
+        fun_l14_n210(x)
+    end
+end
+
+def fun_l13_n882(x)
+    if (x < 1)
+        fun_l14_n587(x)
+    else
+        fun_l14_n472(x)
+    end
+end
+
+def fun_l13_n883(x)
+    if (x < 1)
+        fun_l14_n1(x)
+    else
+        fun_l14_n778(x)
+    end
+end
+
+def fun_l13_n884(x)
+    if (x < 1)
+        fun_l14_n762(x)
+    else
+        fun_l14_n286(x)
+    end
+end
+
+def fun_l13_n885(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n326(x)
+    end
+end
+
+def fun_l13_n886(x)
+    if (x < 1)
+        fun_l14_n857(x)
+    else
+        fun_l14_n564(x)
+    end
+end
+
+def fun_l13_n887(x)
+    if (x < 1)
+        fun_l14_n461(x)
+    else
+        fun_l14_n415(x)
+    end
+end
+
+def fun_l13_n888(x)
+    if (x < 1)
+        fun_l14_n225(x)
+    else
+        fun_l14_n783(x)
+    end
+end
+
+def fun_l13_n889(x)
+    if (x < 1)
+        fun_l14_n10(x)
+    else
+        fun_l14_n114(x)
+    end
+end
+
+def fun_l13_n890(x)
+    if (x < 1)
+        fun_l14_n670(x)
+    else
+        fun_l14_n473(x)
+    end
+end
+
+def fun_l13_n891(x)
+    if (x < 1)
+        fun_l14_n777(x)
+    else
+        fun_l14_n98(x)
+    end
+end
+
+def fun_l13_n892(x)
+    if (x < 1)
+        fun_l14_n600(x)
+    else
+        fun_l14_n808(x)
+    end
+end
+
+def fun_l13_n893(x)
+    if (x < 1)
+        fun_l14_n605(x)
+    else
+        fun_l14_n687(x)
+    end
+end
+
+def fun_l13_n894(x)
+    if (x < 1)
+        fun_l14_n29(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n895(x)
+    if (x < 1)
+        fun_l14_n26(x)
+    else
+        fun_l14_n887(x)
+    end
+end
+
+def fun_l13_n896(x)
+    if (x < 1)
+        fun_l14_n680(x)
+    else
+        fun_l14_n413(x)
+    end
+end
+
+def fun_l13_n897(x)
+    if (x < 1)
+        fun_l14_n634(x)
+    else
+        fun_l14_n184(x)
+    end
+end
+
+def fun_l13_n898(x)
+    if (x < 1)
+        fun_l14_n420(x)
+    else
+        fun_l14_n603(x)
+    end
+end
+
+def fun_l13_n899(x)
+    if (x < 1)
+        fun_l14_n702(x)
+    else
+        fun_l14_n54(x)
+    end
+end
+
+def fun_l13_n900(x)
+    if (x < 1)
+        fun_l14_n620(x)
+    else
+        fun_l14_n849(x)
+    end
+end
+
+def fun_l13_n901(x)
+    if (x < 1)
+        fun_l14_n848(x)
+    else
+        fun_l14_n384(x)
+    end
+end
+
+def fun_l13_n902(x)
+    if (x < 1)
+        fun_l14_n726(x)
+    else
+        fun_l14_n624(x)
+    end
+end
+
+def fun_l13_n903(x)
+    if (x < 1)
+        fun_l14_n663(x)
+    else
+        fun_l14_n395(x)
+    end
+end
+
+def fun_l13_n904(x)
+    if (x < 1)
+        fun_l14_n803(x)
+    else
+        fun_l14_n979(x)
+    end
+end
+
+def fun_l13_n905(x)
+    if (x < 1)
+        fun_l14_n487(x)
+    else
+        fun_l14_n530(x)
+    end
+end
+
+def fun_l13_n906(x)
+    if (x < 1)
+        fun_l14_n737(x)
+    else
+        fun_l14_n679(x)
+    end
+end
+
+def fun_l13_n907(x)
+    if (x < 1)
+        fun_l14_n815(x)
+    else
+        fun_l14_n84(x)
+    end
+end
+
+def fun_l13_n908(x)
+    if (x < 1)
+        fun_l14_n116(x)
+    else
+        fun_l14_n820(x)
+    end
+end
+
+def fun_l13_n909(x)
+    if (x < 1)
+        fun_l14_n353(x)
+    else
+        fun_l14_n949(x)
+    end
+end
+
+def fun_l13_n910(x)
+    if (x < 1)
+        fun_l14_n271(x)
+    else
+        fun_l14_n168(x)
+    end
+end
+
+def fun_l13_n911(x)
+    if (x < 1)
+        fun_l14_n54(x)
+    else
+        fun_l14_n236(x)
+    end
+end
+
+def fun_l13_n912(x)
+    if (x < 1)
+        fun_l14_n391(x)
+    else
+        fun_l14_n152(x)
+    end
+end
+
+def fun_l13_n913(x)
+    if (x < 1)
+        fun_l14_n450(x)
+    else
+        fun_l14_n521(x)
+    end
+end
+
+def fun_l13_n914(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n995(x)
+    end
+end
+
+def fun_l13_n915(x)
+    if (x < 1)
+        fun_l14_n177(x)
+    else
+        fun_l14_n358(x)
+    end
+end
+
+def fun_l13_n916(x)
+    if (x < 1)
+        fun_l14_n36(x)
+    else
+        fun_l14_n32(x)
+    end
+end
+
+def fun_l13_n917(x)
+    if (x < 1)
+        fun_l14_n970(x)
+    else
+        fun_l14_n957(x)
+    end
+end
+
+def fun_l13_n918(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n138(x)
+    end
+end
+
+def fun_l13_n919(x)
+    if (x < 1)
+        fun_l14_n439(x)
+    else
+        fun_l14_n641(x)
+    end
+end
+
+def fun_l13_n920(x)
+    if (x < 1)
+        fun_l14_n318(x)
+    else
+        fun_l14_n649(x)
+    end
+end
+
+def fun_l13_n921(x)
+    if (x < 1)
+        fun_l14_n455(x)
+    else
+        fun_l14_n312(x)
+    end
+end
+
+def fun_l13_n922(x)
+    if (x < 1)
+        fun_l14_n15(x)
+    else
+        fun_l14_n825(x)
+    end
+end
+
+def fun_l13_n923(x)
+    if (x < 1)
+        fun_l14_n546(x)
+    else
+        fun_l14_n629(x)
+    end
+end
+
+def fun_l13_n924(x)
+    if (x < 1)
+        fun_l14_n298(x)
+    else
+        fun_l14_n563(x)
+    end
+end
+
+def fun_l13_n925(x)
+    if (x < 1)
+        fun_l14_n312(x)
+    else
+        fun_l14_n736(x)
+    end
+end
+
+def fun_l13_n926(x)
+    if (x < 1)
+        fun_l14_n767(x)
+    else
+        fun_l14_n107(x)
+    end
+end
+
+def fun_l13_n927(x)
+    if (x < 1)
+        fun_l14_n966(x)
+    else
+        fun_l14_n765(x)
+    end
+end
+
+def fun_l13_n928(x)
+    if (x < 1)
+        fun_l14_n545(x)
+    else
+        fun_l14_n383(x)
+    end
+end
+
+def fun_l13_n929(x)
+    if (x < 1)
+        fun_l14_n389(x)
+    else
+        fun_l14_n48(x)
+    end
+end
+
+def fun_l13_n930(x)
+    if (x < 1)
+        fun_l14_n142(x)
+    else
+        fun_l14_n632(x)
+    end
+end
+
+def fun_l13_n931(x)
+    if (x < 1)
+        fun_l14_n146(x)
+    else
+        fun_l14_n275(x)
+    end
+end
+
+def fun_l13_n932(x)
+    if (x < 1)
+        fun_l14_n754(x)
+    else
+        fun_l14_n380(x)
+    end
+end
+
+def fun_l13_n933(x)
+    if (x < 1)
+        fun_l14_n561(x)
+    else
+        fun_l14_n677(x)
+    end
+end
+
+def fun_l13_n934(x)
+    if (x < 1)
+        fun_l14_n253(x)
+    else
+        fun_l14_n86(x)
+    end
+end
+
+def fun_l13_n935(x)
+    if (x < 1)
+        fun_l14_n528(x)
+    else
+        fun_l14_n177(x)
+    end
+end
+
+def fun_l13_n936(x)
+    if (x < 1)
+        fun_l14_n938(x)
+    else
+        fun_l14_n265(x)
+    end
+end
+
+def fun_l13_n937(x)
+    if (x < 1)
+        fun_l14_n763(x)
+    else
+        fun_l14_n662(x)
+    end
+end
+
+def fun_l13_n938(x)
+    if (x < 1)
+        fun_l14_n836(x)
+    else
+        fun_l14_n734(x)
+    end
+end
+
+def fun_l13_n939(x)
+    if (x < 1)
+        fun_l14_n127(x)
+    else
+        fun_l14_n111(x)
+    end
+end
+
+def fun_l13_n940(x)
+    if (x < 1)
+        fun_l14_n356(x)
+    else
+        fun_l14_n544(x)
+    end
+end
+
+def fun_l13_n941(x)
+    if (x < 1)
+        fun_l14_n525(x)
+    else
+        fun_l14_n762(x)
+    end
+end
+
+def fun_l13_n942(x)
+    if (x < 1)
+        fun_l14_n333(x)
+    else
+        fun_l14_n639(x)
+    end
+end
+
+def fun_l13_n943(x)
+    if (x < 1)
+        fun_l14_n452(x)
+    else
+        fun_l14_n944(x)
+    end
+end
+
+def fun_l13_n944(x)
+    if (x < 1)
+        fun_l14_n827(x)
+    else
+        fun_l14_n961(x)
+    end
+end
+
+def fun_l13_n945(x)
+    if (x < 1)
+        fun_l14_n991(x)
+    else
+        fun_l14_n431(x)
+    end
+end
+
+def fun_l13_n946(x)
+    if (x < 1)
+        fun_l14_n646(x)
+    else
+        fun_l14_n183(x)
+    end
+end
+
+def fun_l13_n947(x)
+    if (x < 1)
+        fun_l14_n107(x)
+    else
+        fun_l14_n273(x)
+    end
+end
+
+def fun_l13_n948(x)
+    if (x < 1)
+        fun_l14_n210(x)
+    else
+        fun_l14_n664(x)
+    end
+end
+
+def fun_l13_n949(x)
+    if (x < 1)
+        fun_l14_n542(x)
+    else
+        fun_l14_n462(x)
+    end
+end
+
+def fun_l13_n950(x)
+    if (x < 1)
+        fun_l14_n891(x)
+    else
+        fun_l14_n486(x)
+    end
+end
+
+def fun_l13_n951(x)
+    if (x < 1)
+        fun_l14_n527(x)
+    else
+        fun_l14_n721(x)
+    end
+end
+
+def fun_l13_n952(x)
+    if (x < 1)
+        fun_l14_n745(x)
+    else
+        fun_l14_n11(x)
+    end
+end
+
+def fun_l13_n953(x)
+    if (x < 1)
+        fun_l14_n427(x)
+    else
+        fun_l14_n521(x)
+    end
+end
+
+def fun_l13_n954(x)
+    if (x < 1)
+        fun_l14_n907(x)
+    else
+        fun_l14_n878(x)
+    end
+end
+
+def fun_l13_n955(x)
+    if (x < 1)
+        fun_l14_n818(x)
+    else
+        fun_l14_n722(x)
+    end
+end
+
+def fun_l13_n956(x)
+    if (x < 1)
+        fun_l14_n567(x)
+    else
+        fun_l14_n71(x)
+    end
+end
+
+def fun_l13_n957(x)
+    if (x < 1)
+        fun_l14_n203(x)
+    else
+        fun_l14_n221(x)
+    end
+end
+
+def fun_l13_n958(x)
+    if (x < 1)
+        fun_l14_n173(x)
+    else
+        fun_l14_n854(x)
+    end
+end
+
+def fun_l13_n959(x)
+    if (x < 1)
+        fun_l14_n201(x)
+    else
+        fun_l14_n930(x)
+    end
+end
+
+def fun_l13_n960(x)
+    if (x < 1)
+        fun_l14_n736(x)
+    else
+        fun_l14_n539(x)
+    end
+end
+
+def fun_l13_n961(x)
+    if (x < 1)
+        fun_l14_n459(x)
+    else
+        fun_l14_n771(x)
+    end
+end
+
+def fun_l13_n962(x)
+    if (x < 1)
+        fun_l14_n682(x)
+    else
+        fun_l14_n19(x)
+    end
+end
+
+def fun_l13_n963(x)
+    if (x < 1)
+        fun_l14_n897(x)
+    else
+        fun_l14_n650(x)
+    end
+end
+
+def fun_l13_n964(x)
+    if (x < 1)
+        fun_l14_n814(x)
+    else
+        fun_l14_n726(x)
+    end
+end
+
+def fun_l13_n965(x)
+    if (x < 1)
+        fun_l14_n31(x)
+    else
+        fun_l14_n211(x)
+    end
+end
+
+def fun_l13_n966(x)
+    if (x < 1)
+        fun_l14_n89(x)
+    else
+        fun_l14_n407(x)
+    end
+end
+
+def fun_l13_n967(x)
+    if (x < 1)
+        fun_l14_n772(x)
+    else
+        fun_l14_n7(x)
+    end
+end
+
+def fun_l13_n968(x)
+    if (x < 1)
+        fun_l14_n764(x)
+    else
+        fun_l14_n523(x)
+    end
+end
+
+def fun_l13_n969(x)
+    if (x < 1)
+        fun_l14_n680(x)
+    else
+        fun_l14_n674(x)
+    end
+end
+
+def fun_l13_n970(x)
+    if (x < 1)
+        fun_l14_n517(x)
+    else
+        fun_l14_n346(x)
+    end
+end
+
+def fun_l13_n971(x)
+    if (x < 1)
+        fun_l14_n136(x)
+    else
+        fun_l14_n921(x)
+    end
+end
+
+def fun_l13_n972(x)
+    if (x < 1)
+        fun_l14_n400(x)
+    else
+        fun_l14_n901(x)
+    end
+end
+
+def fun_l13_n973(x)
+    if (x < 1)
+        fun_l14_n62(x)
+    else
+        fun_l14_n784(x)
+    end
+end
+
+def fun_l13_n974(x)
+    if (x < 1)
+        fun_l14_n411(x)
+    else
+        fun_l14_n889(x)
+    end
+end
+
+def fun_l13_n975(x)
+    if (x < 1)
+        fun_l14_n291(x)
+    else
+        fun_l14_n198(x)
+    end
+end
+
+def fun_l13_n976(x)
+    if (x < 1)
+        fun_l14_n229(x)
+    else
+        fun_l14_n346(x)
+    end
+end
+
+def fun_l13_n977(x)
+    if (x < 1)
+        fun_l14_n769(x)
+    else
+        fun_l14_n381(x)
+    end
+end
+
+def fun_l13_n978(x)
+    if (x < 1)
+        fun_l14_n430(x)
+    else
+        fun_l14_n205(x)
+    end
+end
+
+def fun_l13_n979(x)
+    if (x < 1)
+        fun_l14_n170(x)
+    else
+        fun_l14_n927(x)
+    end
+end
+
+def fun_l13_n980(x)
+    if (x < 1)
+        fun_l14_n12(x)
+    else
+        fun_l14_n605(x)
+    end
+end
+
+def fun_l13_n981(x)
+    if (x < 1)
+        fun_l14_n613(x)
+    else
+        fun_l14_n912(x)
+    end
+end
+
+def fun_l13_n982(x)
+    if (x < 1)
+        fun_l14_n982(x)
+    else
+        fun_l14_n707(x)
+    end
+end
+
+def fun_l13_n983(x)
+    if (x < 1)
+        fun_l14_n230(x)
+    else
+        fun_l14_n239(x)
+    end
+end
+
+def fun_l13_n984(x)
+    if (x < 1)
+        fun_l14_n55(x)
+    else
+        fun_l14_n337(x)
+    end
+end
+
+def fun_l13_n985(x)
+    if (x < 1)
+        fun_l14_n853(x)
+    else
+        fun_l14_n425(x)
+    end
+end
+
+def fun_l13_n986(x)
+    if (x < 1)
+        fun_l14_n14(x)
+    else
+        fun_l14_n921(x)
+    end
+end
+
+def fun_l13_n987(x)
+    if (x < 1)
+        fun_l14_n166(x)
+    else
+        fun_l14_n948(x)
+    end
+end
+
+def fun_l13_n988(x)
+    if (x < 1)
+        fun_l14_n752(x)
+    else
+        fun_l14_n226(x)
+    end
+end
+
+def fun_l13_n989(x)
+    if (x < 1)
+        fun_l14_n730(x)
+    else
+        fun_l14_n671(x)
+    end
+end
+
+def fun_l13_n990(x)
+    if (x < 1)
+        fun_l14_n603(x)
+    else
+        fun_l14_n903(x)
+    end
+end
+
+def fun_l13_n991(x)
+    if (x < 1)
+        fun_l14_n598(x)
+    else
+        fun_l14_n842(x)
+    end
+end
+
+def fun_l13_n992(x)
+    if (x < 1)
+        fun_l14_n230(x)
+    else
+        fun_l14_n704(x)
+    end
+end
+
+def fun_l13_n993(x)
+    if (x < 1)
+        fun_l14_n897(x)
+    else
+        fun_l14_n190(x)
+    end
+end
+
+def fun_l13_n994(x)
+    if (x < 1)
+        fun_l14_n640(x)
+    else
+        fun_l14_n622(x)
+    end
+end
+
+def fun_l13_n995(x)
+    if (x < 1)
+        fun_l14_n988(x)
+    else
+        fun_l14_n471(x)
+    end
+end
+
+def fun_l13_n996(x)
+    if (x < 1)
+        fun_l14_n721(x)
+    else
+        fun_l14_n672(x)
+    end
+end
+
+def fun_l13_n997(x)
+    if (x < 1)
+        fun_l14_n425(x)
+    else
+        fun_l14_n885(x)
+    end
+end
+
+def fun_l13_n998(x)
+    if (x < 1)
+        fun_l14_n279(x)
+    else
+        fun_l14_n966(x)
+    end
+end
+
+def fun_l13_n999(x)
+    if (x < 1)
+        fun_l14_n610(x)
+    else
+        fun_l14_n319(x)
+    end
+end
+
+def fun_l14_n0(x)
+    if (x < 1)
+        fun_l15_n46(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n1(x)
+    if (x < 1)
+        fun_l15_n360(x)
+    else
+        fun_l15_n637(x)
+    end
+end
+
+def fun_l14_n2(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n728(x)
+    end
+end
+
+def fun_l14_n3(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n826(x)
+    end
+end
+
+def fun_l14_n4(x)
+    if (x < 1)
+        fun_l15_n789(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n5(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n6(x)
+    if (x < 1)
+        fun_l15_n64(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n7(x)
+    if (x < 1)
+        fun_l15_n423(x)
+    else
+        fun_l15_n162(x)
+    end
+end
+
+def fun_l14_n8(x)
+    if (x < 1)
+        fun_l15_n177(x)
+    else
+        fun_l15_n923(x)
+    end
+end
+
+def fun_l14_n9(x)
+    if (x < 1)
+        fun_l15_n508(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n10(x)
+    if (x < 1)
+        fun_l15_n640(x)
+    else
+        fun_l15_n869(x)
+    end
+end
+
+def fun_l14_n11(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n12(x)
+    if (x < 1)
+        fun_l15_n332(x)
+    else
+        fun_l15_n263(x)
+    end
+end
+
+def fun_l14_n13(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n14(x)
+    if (x < 1)
+        fun_l15_n436(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n15(x)
+    if (x < 1)
+        fun_l15_n160(x)
+    else
+        fun_l15_n291(x)
+    end
+end
+
+def fun_l14_n16(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n704(x)
+    end
+end
+
+def fun_l14_n17(x)
+    if (x < 1)
+        fun_l15_n237(x)
+    else
+        fun_l15_n962(x)
+    end
+end
+
+def fun_l14_n18(x)
+    if (x < 1)
+        fun_l15_n941(x)
+    else
+        fun_l15_n217(x)
+    end
+end
+
+def fun_l14_n19(x)
+    if (x < 1)
+        fun_l15_n904(x)
+    else
+        fun_l15_n36(x)
+    end
+end
+
+def fun_l14_n20(x)
+    if (x < 1)
+        fun_l15_n74(x)
+    else
+        fun_l15_n790(x)
+    end
+end
+
+def fun_l14_n21(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n298(x)
+    end
+end
+
+def fun_l14_n22(x)
+    if (x < 1)
+        fun_l15_n757(x)
+    else
+        fun_l15_n636(x)
+    end
+end
+
+def fun_l14_n23(x)
+    if (x < 1)
+        fun_l15_n989(x)
+    else
+        fun_l15_n508(x)
+    end
+end
+
+def fun_l14_n24(x)
+    if (x < 1)
+        fun_l15_n80(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n25(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n922(x)
+    end
+end
+
+def fun_l14_n26(x)
+    if (x < 1)
+        fun_l15_n922(x)
+    else
+        fun_l15_n207(x)
+    end
+end
+
+def fun_l14_n27(x)
+    if (x < 1)
+        fun_l15_n406(x)
+    else
+        fun_l15_n481(x)
+    end
+end
+
+def fun_l14_n28(x)
+    if (x < 1)
+        fun_l15_n986(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n29(x)
+    if (x < 1)
+        fun_l15_n958(x)
+    else
+        fun_l15_n804(x)
+    end
+end
+
+def fun_l14_n30(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n31(x)
+    if (x < 1)
+        fun_l15_n648(x)
+    else
+        fun_l15_n547(x)
+    end
+end
+
+def fun_l14_n32(x)
+    if (x < 1)
+        fun_l15_n641(x)
+    else
+        fun_l15_n628(x)
+    end
+end
+
+def fun_l14_n33(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n34(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n948(x)
+    end
+end
+
+def fun_l14_n35(x)
+    if (x < 1)
+        fun_l15_n761(x)
+    else
+        fun_l15_n384(x)
+    end
+end
+
+def fun_l14_n36(x)
+    if (x < 1)
+        fun_l15_n75(x)
+    else
+        fun_l15_n581(x)
+    end
+end
+
+def fun_l14_n37(x)
+    if (x < 1)
+        fun_l15_n962(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n38(x)
+    if (x < 1)
+        fun_l15_n422(x)
+    else
+        fun_l15_n953(x)
+    end
+end
+
+def fun_l14_n39(x)
+    if (x < 1)
+        fun_l15_n123(x)
+    else
+        fun_l15_n989(x)
+    end
+end
+
+def fun_l14_n40(x)
+    if (x < 1)
+        fun_l15_n789(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n41(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n997(x)
+    end
+end
+
+def fun_l14_n42(x)
+    if (x < 1)
+        fun_l15_n231(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n43(x)
+    if (x < 1)
+        fun_l15_n520(x)
+    else
+        fun_l15_n252(x)
+    end
+end
+
+def fun_l14_n44(x)
+    if (x < 1)
+        fun_l15_n966(x)
+    else
+        fun_l15_n244(x)
+    end
+end
+
+def fun_l14_n45(x)
+    if (x < 1)
+        fun_l15_n192(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n46(x)
+    if (x < 1)
+        fun_l15_n422(x)
+    else
+        fun_l15_n847(x)
+    end
+end
+
+def fun_l14_n47(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n564(x)
+    end
+end
+
+def fun_l14_n48(x)
+    if (x < 1)
+        fun_l15_n263(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n49(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n592(x)
+    end
+end
+
+def fun_l14_n50(x)
+    if (x < 1)
+        fun_l15_n464(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n51(x)
+    if (x < 1)
+        fun_l15_n903(x)
+    else
+        fun_l15_n821(x)
+    end
+end
+
+def fun_l14_n52(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n322(x)
+    end
+end
+
+def fun_l14_n53(x)
+    if (x < 1)
+        fun_l15_n107(x)
+    else
+        fun_l15_n497(x)
+    end
+end
+
+def fun_l14_n54(x)
+    if (x < 1)
+        fun_l15_n692(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n55(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n56(x)
+    if (x < 1)
+        fun_l15_n181(x)
+    else
+        fun_l15_n200(x)
+    end
+end
+
+def fun_l14_n57(x)
+    if (x < 1)
+        fun_l15_n721(x)
+    else
+        fun_l15_n849(x)
+    end
+end
+
+def fun_l14_n58(x)
+    if (x < 1)
+        fun_l15_n626(x)
+    else
+        fun_l15_n866(x)
+    end
+end
+
+def fun_l14_n59(x)
+    if (x < 1)
+        fun_l15_n689(x)
+    else
+        fun_l15_n387(x)
+    end
+end
+
+def fun_l14_n60(x)
+    if (x < 1)
+        fun_l15_n805(x)
+    else
+        fun_l15_n842(x)
+    end
+end
+
+def fun_l14_n61(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n62(x)
+    if (x < 1)
+        fun_l15_n884(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n63(x)
+    if (x < 1)
+        fun_l15_n509(x)
+    else
+        fun_l15_n106(x)
+    end
+end
+
+def fun_l14_n64(x)
+    if (x < 1)
+        fun_l15_n600(x)
+    else
+        fun_l15_n314(x)
+    end
+end
+
+def fun_l14_n65(x)
+    if (x < 1)
+        fun_l15_n761(x)
+    else
+        fun_l15_n362(x)
+    end
+end
+
+def fun_l14_n66(x)
+    if (x < 1)
+        fun_l15_n812(x)
+    else
+        fun_l15_n640(x)
+    end
+end
+
+def fun_l14_n67(x)
+    if (x < 1)
+        fun_l15_n862(x)
+    else
+        fun_l15_n627(x)
+    end
+end
+
+def fun_l14_n68(x)
+    if (x < 1)
+        fun_l15_n503(x)
+    else
+        fun_l15_n381(x)
+    end
+end
+
+def fun_l14_n69(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n851(x)
+    end
+end
+
+def fun_l14_n70(x)
+    if (x < 1)
+        fun_l15_n253(x)
+    else
+        fun_l15_n728(x)
+    end
+end
+
+def fun_l14_n71(x)
+    if (x < 1)
+        fun_l15_n195(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n72(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n73(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n502(x)
+    end
+end
+
+def fun_l14_n74(x)
+    if (x < 1)
+        fun_l15_n183(x)
+    else
+        fun_l15_n50(x)
+    end
+end
+
+def fun_l14_n75(x)
+    if (x < 1)
+        fun_l15_n397(x)
+    else
+        fun_l15_n467(x)
+    end
+end
+
+def fun_l14_n76(x)
+    if (x < 1)
+        fun_l15_n207(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n77(x)
+    if (x < 1)
+        fun_l15_n416(x)
+    else
+        fun_l15_n846(x)
+    end
+end
+
+def fun_l14_n78(x)
+    if (x < 1)
+        fun_l15_n426(x)
+    else
+        fun_l15_n142(x)
+    end
+end
+
+def fun_l14_n79(x)
+    if (x < 1)
+        fun_l15_n234(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n80(x)
+    if (x < 1)
+        fun_l15_n133(x)
+    else
+        fun_l15_n216(x)
+    end
+end
+
+def fun_l14_n81(x)
+    if (x < 1)
+        fun_l15_n23(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n82(x)
+    if (x < 1)
+        fun_l15_n129(x)
+    else
+        fun_l15_n614(x)
+    end
+end
+
+def fun_l14_n83(x)
+    if (x < 1)
+        fun_l15_n560(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n84(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n300(x)
+    end
+end
+
+def fun_l14_n85(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n249(x)
+    end
+end
+
+def fun_l14_n86(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n280(x)
+    end
+end
+
+def fun_l14_n87(x)
+    if (x < 1)
+        fun_l15_n528(x)
+    else
+        fun_l15_n350(x)
+    end
+end
+
+def fun_l14_n88(x)
+    if (x < 1)
+        fun_l15_n568(x)
+    else
+        fun_l15_n762(x)
+    end
+end
+
+def fun_l14_n89(x)
+    if (x < 1)
+        fun_l15_n190(x)
+    else
+        fun_l15_n858(x)
+    end
+end
+
+def fun_l14_n90(x)
+    if (x < 1)
+        fun_l15_n896(x)
+    else
+        fun_l15_n543(x)
+    end
+end
+
+def fun_l14_n91(x)
+    if (x < 1)
+        fun_l15_n937(x)
+    else
+        fun_l15_n593(x)
+    end
+end
+
+def fun_l14_n92(x)
+    if (x < 1)
+        fun_l15_n135(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n93(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n94(x)
+    if (x < 1)
+        fun_l15_n617(x)
+    else
+        fun_l15_n375(x)
+    end
+end
+
+def fun_l14_n95(x)
+    if (x < 1)
+        fun_l15_n111(x)
+    else
+        fun_l15_n870(x)
+    end
+end
+
+def fun_l14_n96(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n97(x)
+    if (x < 1)
+        fun_l15_n150(x)
+    else
+        fun_l15_n98(x)
+    end
+end
+
+def fun_l14_n98(x)
+    if (x < 1)
+        fun_l15_n629(x)
+    else
+        fun_l15_n548(x)
+    end
+end
+
+def fun_l14_n99(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n383(x)
+    end
+end
+
+def fun_l14_n100(x)
+    if (x < 1)
+        fun_l15_n719(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n101(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n102(x)
+    if (x < 1)
+        fun_l15_n924(x)
+    else
+        fun_l15_n520(x)
+    end
+end
+
+def fun_l14_n103(x)
+    if (x < 1)
+        fun_l15_n194(x)
+    else
+        fun_l15_n613(x)
+    end
+end
+
+def fun_l14_n104(x)
+    if (x < 1)
+        fun_l15_n909(x)
+    else
+        fun_l15_n333(x)
+    end
+end
+
+def fun_l14_n105(x)
+    if (x < 1)
+        fun_l15_n586(x)
+    else
+        fun_l15_n2(x)
+    end
+end
+
+def fun_l14_n106(x)
+    if (x < 1)
+        fun_l15_n373(x)
+    else
+        fun_l15_n316(x)
+    end
+end
+
+def fun_l14_n107(x)
+    if (x < 1)
+        fun_l15_n737(x)
+    else
+        fun_l15_n469(x)
+    end
+end
+
+def fun_l14_n108(x)
+    if (x < 1)
+        fun_l15_n841(x)
+    else
+        fun_l15_n888(x)
+    end
+end
+
+def fun_l14_n109(x)
+    if (x < 1)
+        fun_l15_n165(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n110(x)
+    if (x < 1)
+        fun_l15_n344(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n111(x)
+    if (x < 1)
+        fun_l15_n424(x)
+    else
+        fun_l15_n702(x)
+    end
+end
+
+def fun_l14_n112(x)
+    if (x < 1)
+        fun_l15_n161(x)
+    else
+        fun_l15_n827(x)
+    end
+end
+
+def fun_l14_n113(x)
+    if (x < 1)
+        fun_l15_n982(x)
+    else
+        fun_l15_n172(x)
+    end
+end
+
+def fun_l14_n114(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n178(x)
+    end
+end
+
+def fun_l14_n115(x)
+    if (x < 1)
+        fun_l15_n130(x)
+    else
+        fun_l15_n266(x)
+    end
+end
+
+def fun_l14_n116(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n63(x)
+    end
+end
+
+def fun_l14_n117(x)
+    if (x < 1)
+        fun_l15_n117(x)
+    else
+        fun_l15_n659(x)
+    end
+end
+
+def fun_l14_n118(x)
+    if (x < 1)
+        fun_l15_n607(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n119(x)
+    if (x < 1)
+        fun_l15_n30(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n120(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n789(x)
+    end
+end
+
+def fun_l14_n121(x)
+    if (x < 1)
+        fun_l15_n906(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n122(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n378(x)
+    end
+end
+
+def fun_l14_n123(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n896(x)
+    end
+end
+
+def fun_l14_n124(x)
+    if (x < 1)
+        fun_l15_n23(x)
+    else
+        fun_l15_n648(x)
+    end
+end
+
+def fun_l14_n125(x)
+    if (x < 1)
+        fun_l15_n290(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n126(x)
+    if (x < 1)
+        fun_l15_n410(x)
+    else
+        fun_l15_n646(x)
+    end
+end
+
+def fun_l14_n127(x)
+    if (x < 1)
+        fun_l15_n162(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n128(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n176(x)
+    end
+end
+
+def fun_l14_n129(x)
+    if (x < 1)
+        fun_l15_n642(x)
+    else
+        fun_l15_n709(x)
+    end
+end
+
+def fun_l14_n130(x)
+    if (x < 1)
+        fun_l15_n669(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n131(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n578(x)
+    end
+end
+
+def fun_l14_n132(x)
+    if (x < 1)
+        fun_l15_n112(x)
+    else
+        fun_l15_n72(x)
+    end
+end
+
+def fun_l14_n133(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n134(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n135(x)
+    if (x < 1)
+        fun_l15_n168(x)
+    else
+        fun_l15_n430(x)
+    end
+end
+
+def fun_l14_n136(x)
+    if (x < 1)
+        fun_l15_n889(x)
+    else
+        fun_l15_n635(x)
+    end
+end
+
+def fun_l14_n137(x)
+    if (x < 1)
+        fun_l15_n348(x)
+    else
+        fun_l15_n445(x)
+    end
+end
+
+def fun_l14_n138(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n23(x)
+    end
+end
+
+def fun_l14_n139(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n25(x)
+    end
+end
+
+def fun_l14_n140(x)
+    if (x < 1)
+        fun_l15_n268(x)
+    else
+        fun_l15_n105(x)
+    end
+end
+
+def fun_l14_n141(x)
+    if (x < 1)
+        fun_l15_n296(x)
+    else
+        fun_l15_n856(x)
+    end
+end
+
+def fun_l14_n142(x)
+    if (x < 1)
+        fun_l15_n206(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n143(x)
+    if (x < 1)
+        fun_l15_n203(x)
+    else
+        fun_l15_n240(x)
+    end
+end
+
+def fun_l14_n144(x)
+    if (x < 1)
+        fun_l15_n556(x)
+    else
+        fun_l15_n47(x)
+    end
+end
+
+def fun_l14_n145(x)
+    if (x < 1)
+        fun_l15_n340(x)
+    else
+        fun_l15_n511(x)
+    end
+end
+
+def fun_l14_n146(x)
+    if (x < 1)
+        fun_l15_n250(x)
+    else
+        fun_l15_n402(x)
+    end
+end
+
+def fun_l14_n147(x)
+    if (x < 1)
+        fun_l15_n4(x)
+    else
+        fun_l15_n26(x)
+    end
+end
+
+def fun_l14_n148(x)
+    if (x < 1)
+        fun_l15_n52(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n149(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n884(x)
+    end
+end
+
+def fun_l14_n150(x)
+    if (x < 1)
+        fun_l15_n677(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n151(x)
+    if (x < 1)
+        fun_l15_n949(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n152(x)
+    if (x < 1)
+        fun_l15_n719(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n153(x)
+    if (x < 1)
+        fun_l15_n12(x)
+    else
+        fun_l15_n985(x)
+    end
+end
+
+def fun_l14_n154(x)
+    if (x < 1)
+        fun_l15_n639(x)
+    else
+        fun_l15_n367(x)
+    end
+end
+
+def fun_l14_n155(x)
+    if (x < 1)
+        fun_l15_n401(x)
+    else
+        fun_l15_n431(x)
+    end
+end
+
+def fun_l14_n156(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n136(x)
+    end
+end
+
+def fun_l14_n157(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n158(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n167(x)
+    end
+end
+
+def fun_l14_n159(x)
+    if (x < 1)
+        fun_l15_n643(x)
+    else
+        fun_l15_n458(x)
+    end
+end
+
+def fun_l14_n160(x)
+    if (x < 1)
+        fun_l15_n539(x)
+    else
+        fun_l15_n36(x)
+    end
+end
+
+def fun_l14_n161(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n162(x)
+    if (x < 1)
+        fun_l15_n214(x)
+    else
+        fun_l15_n712(x)
+    end
+end
+
+def fun_l14_n163(x)
+    if (x < 1)
+        fun_l15_n47(x)
+    else
+        fun_l15_n799(x)
+    end
+end
+
+def fun_l14_n164(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n888(x)
+    end
+end
+
+def fun_l14_n165(x)
+    if (x < 1)
+        fun_l15_n904(x)
+    else
+        fun_l15_n484(x)
+    end
+end
+
+def fun_l14_n166(x)
+    if (x < 1)
+        fun_l15_n870(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n167(x)
+    if (x < 1)
+        fun_l15_n960(x)
+    else
+        fun_l15_n33(x)
+    end
+end
+
+def fun_l14_n168(x)
+    if (x < 1)
+        fun_l15_n16(x)
+    else
+        fun_l15_n24(x)
+    end
+end
+
+def fun_l14_n169(x)
+    if (x < 1)
+        fun_l15_n913(x)
+    else
+        fun_l15_n793(x)
+    end
+end
+
+def fun_l14_n170(x)
+    if (x < 1)
+        fun_l15_n35(x)
+    else
+        fun_l15_n204(x)
+    end
+end
+
+def fun_l14_n171(x)
+    if (x < 1)
+        fun_l15_n526(x)
+    else
+        fun_l15_n92(x)
+    end
+end
+
+def fun_l14_n172(x)
+    if (x < 1)
+        fun_l15_n648(x)
+    else
+        fun_l15_n535(x)
+    end
+end
+
+def fun_l14_n173(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n174(x)
+    if (x < 1)
+        fun_l15_n352(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n175(x)
+    if (x < 1)
+        fun_l15_n692(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n176(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n177(x)
+    if (x < 1)
+        fun_l15_n725(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n178(x)
+    if (x < 1)
+        fun_l15_n43(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n179(x)
+    if (x < 1)
+        fun_l15_n890(x)
+    else
+        fun_l15_n887(x)
+    end
+end
+
+def fun_l14_n180(x)
+    if (x < 1)
+        fun_l15_n499(x)
+    else
+        fun_l15_n729(x)
+    end
+end
+
+def fun_l14_n181(x)
+    if (x < 1)
+        fun_l15_n714(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n182(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n671(x)
+    end
+end
+
+def fun_l14_n183(x)
+    if (x < 1)
+        fun_l15_n123(x)
+    else
+        fun_l15_n349(x)
+    end
+end
+
+def fun_l14_n184(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n160(x)
+    end
+end
+
+def fun_l14_n185(x)
+    if (x < 1)
+        fun_l15_n43(x)
+    else
+        fun_l15_n965(x)
+    end
+end
+
+def fun_l14_n186(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n411(x)
+    end
+end
+
+def fun_l14_n187(x)
+    if (x < 1)
+        fun_l15_n788(x)
+    else
+        fun_l15_n297(x)
+    end
+end
+
+def fun_l14_n188(x)
+    if (x < 1)
+        fun_l15_n83(x)
+    else
+        fun_l15_n784(x)
+    end
+end
+
+def fun_l14_n189(x)
+    if (x < 1)
+        fun_l15_n403(x)
+    else
+        fun_l15_n469(x)
+    end
+end
+
+def fun_l14_n190(x)
+    if (x < 1)
+        fun_l15_n77(x)
+    else
+        fun_l15_n55(x)
+    end
+end
+
+def fun_l14_n191(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n462(x)
+    end
+end
+
+def fun_l14_n192(x)
+    if (x < 1)
+        fun_l15_n830(x)
+    else
+        fun_l15_n680(x)
+    end
+end
+
+def fun_l14_n193(x)
+    if (x < 1)
+        fun_l15_n750(x)
+    else
+        fun_l15_n580(x)
+    end
+end
+
+def fun_l14_n194(x)
+    if (x < 1)
+        fun_l15_n668(x)
+    else
+        fun_l15_n911(x)
+    end
+end
+
+def fun_l14_n195(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n232(x)
+    end
+end
+
+def fun_l14_n196(x)
+    if (x < 1)
+        fun_l15_n936(x)
+    else
+        fun_l15_n127(x)
+    end
+end
+
+def fun_l14_n197(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n198(x)
+    if (x < 1)
+        fun_l15_n797(x)
+    else
+        fun_l15_n835(x)
+    end
+end
+
+def fun_l14_n199(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n200(x)
+    if (x < 1)
+        fun_l15_n891(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n201(x)
+    if (x < 1)
+        fun_l15_n697(x)
+    else
+        fun_l15_n218(x)
+    end
+end
+
+def fun_l14_n202(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n977(x)
+    end
+end
+
+def fun_l14_n203(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n992(x)
+    end
+end
+
+def fun_l14_n204(x)
+    if (x < 1)
+        fun_l15_n591(x)
+    else
+        fun_l15_n394(x)
+    end
+end
+
+def fun_l14_n205(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n206(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n470(x)
+    end
+end
+
+def fun_l14_n207(x)
+    if (x < 1)
+        fun_l15_n92(x)
+    else
+        fun_l15_n148(x)
+    end
+end
+
+def fun_l14_n208(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n769(x)
+    end
+end
+
+def fun_l14_n209(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n211(x)
+    end
+end
+
+def fun_l14_n210(x)
+    if (x < 1)
+        fun_l15_n338(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n211(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n605(x)
+    end
+end
+
+def fun_l14_n212(x)
+    if (x < 1)
+        fun_l15_n359(x)
+    else
+        fun_l15_n970(x)
+    end
+end
+
+def fun_l14_n213(x)
+    if (x < 1)
+        fun_l15_n437(x)
+    else
+        fun_l15_n279(x)
+    end
+end
+
+def fun_l14_n214(x)
+    if (x < 1)
+        fun_l15_n782(x)
+    else
+        fun_l15_n344(x)
+    end
+end
+
+def fun_l14_n215(x)
+    if (x < 1)
+        fun_l15_n501(x)
+    else
+        fun_l15_n19(x)
+    end
+end
+
+def fun_l14_n216(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n269(x)
+    end
+end
+
+def fun_l14_n217(x)
+    if (x < 1)
+        fun_l15_n35(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n218(x)
+    if (x < 1)
+        fun_l15_n759(x)
+    else
+        fun_l15_n547(x)
+    end
+end
+
+def fun_l14_n219(x)
+    if (x < 1)
+        fun_l15_n260(x)
+    else
+        fun_l15_n155(x)
+    end
+end
+
+def fun_l14_n220(x)
+    if (x < 1)
+        fun_l15_n691(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n221(x)
+    if (x < 1)
+        fun_l15_n632(x)
+    else
+        fun_l15_n803(x)
+    end
+end
+
+def fun_l14_n222(x)
+    if (x < 1)
+        fun_l15_n652(x)
+    else
+        fun_l15_n70(x)
+    end
+end
+
+def fun_l14_n223(x)
+    if (x < 1)
+        fun_l15_n710(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n224(x)
+    if (x < 1)
+        fun_l15_n3(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n225(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n814(x)
+    end
+end
+
+def fun_l14_n226(x)
+    if (x < 1)
+        fun_l15_n88(x)
+    else
+        fun_l15_n683(x)
+    end
+end
+
+def fun_l14_n227(x)
+    if (x < 1)
+        fun_l15_n898(x)
+    else
+        fun_l15_n996(x)
+    end
+end
+
+def fun_l14_n228(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n315(x)
+    end
+end
+
+def fun_l14_n229(x)
+    if (x < 1)
+        fun_l15_n509(x)
+    else
+        fun_l15_n75(x)
+    end
+end
+
+def fun_l14_n230(x)
+    if (x < 1)
+        fun_l15_n184(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n231(x)
+    if (x < 1)
+        fun_l15_n227(x)
+    else
+        fun_l15_n607(x)
+    end
+end
+
+def fun_l14_n232(x)
+    if (x < 1)
+        fun_l15_n245(x)
+    else
+        fun_l15_n347(x)
+    end
+end
+
+def fun_l14_n233(x)
+    if (x < 1)
+        fun_l15_n728(x)
+    else
+        fun_l15_n457(x)
+    end
+end
+
+def fun_l14_n234(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n235(x)
+    if (x < 1)
+        fun_l15_n855(x)
+    else
+        fun_l15_n774(x)
+    end
+end
+
+def fun_l14_n236(x)
+    if (x < 1)
+        fun_l15_n217(x)
+    else
+        fun_l15_n908(x)
+    end
+end
+
+def fun_l14_n237(x)
+    if (x < 1)
+        fun_l15_n537(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n238(x)
+    if (x < 1)
+        fun_l15_n930(x)
+    else
+        fun_l15_n601(x)
+    end
+end
+
+def fun_l14_n239(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n903(x)
+    end
+end
+
+def fun_l14_n240(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n241(x)
+    if (x < 1)
+        fun_l15_n662(x)
+    else
+        fun_l15_n197(x)
+    end
+end
+
+def fun_l14_n242(x)
+    if (x < 1)
+        fun_l15_n839(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n243(x)
+    if (x < 1)
+        fun_l15_n122(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n244(x)
+    if (x < 1)
+        fun_l15_n209(x)
+    else
+        fun_l15_n977(x)
+    end
+end
+
+def fun_l14_n245(x)
+    if (x < 1)
+        fun_l15_n231(x)
+    else
+        fun_l15_n318(x)
+    end
+end
+
+def fun_l14_n246(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n247(x)
+    if (x < 1)
+        fun_l15_n276(x)
+    else
+        fun_l15_n458(x)
+    end
+end
+
+def fun_l14_n248(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n753(x)
+    end
+end
+
+def fun_l14_n249(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n783(x)
+    end
+end
+
+def fun_l14_n250(x)
+    if (x < 1)
+        fun_l15_n865(x)
+    else
+        fun_l15_n736(x)
+    end
+end
+
+def fun_l14_n251(x)
+    if (x < 1)
+        fun_l15_n861(x)
+    else
+        fun_l15_n414(x)
+    end
+end
+
+def fun_l14_n252(x)
+    if (x < 1)
+        fun_l15_n327(x)
+    else
+        fun_l15_n440(x)
+    end
+end
+
+def fun_l14_n253(x)
+    if (x < 1)
+        fun_l15_n800(x)
+    else
+        fun_l15_n186(x)
+    end
+end
+
+def fun_l14_n254(x)
+    if (x < 1)
+        fun_l15_n687(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n255(x)
+    if (x < 1)
+        fun_l15_n421(x)
+    else
+        fun_l15_n421(x)
+    end
+end
+
+def fun_l14_n256(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n975(x)
+    end
+end
+
+def fun_l14_n257(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n697(x)
+    end
+end
+
+def fun_l14_n258(x)
+    if (x < 1)
+        fun_l15_n433(x)
+    else
+        fun_l15_n811(x)
+    end
+end
+
+def fun_l14_n259(x)
+    if (x < 1)
+        fun_l15_n473(x)
+    else
+        fun_l15_n747(x)
+    end
+end
+
+def fun_l14_n260(x)
+    if (x < 1)
+        fun_l15_n636(x)
+    else
+        fun_l15_n718(x)
+    end
+end
+
+def fun_l14_n261(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n971(x)
+    end
+end
+
+def fun_l14_n262(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n18(x)
+    end
+end
+
+def fun_l14_n263(x)
+    if (x < 1)
+        fun_l15_n582(x)
+    else
+        fun_l15_n629(x)
+    end
+end
+
+def fun_l14_n264(x)
+    if (x < 1)
+        fun_l15_n493(x)
+    else
+        fun_l15_n718(x)
+    end
+end
+
+def fun_l14_n265(x)
+    if (x < 1)
+        fun_l15_n857(x)
+    else
+        fun_l15_n134(x)
+    end
+end
+
+def fun_l14_n266(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n454(x)
+    end
+end
+
+def fun_l14_n267(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n268(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n269(x)
+    if (x < 1)
+        fun_l15_n446(x)
+    else
+        fun_l15_n7(x)
+    end
+end
+
+def fun_l14_n270(x)
+    if (x < 1)
+        fun_l15_n375(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n271(x)
+    if (x < 1)
+        fun_l15_n688(x)
+    else
+        fun_l15_n863(x)
+    end
+end
+
+def fun_l14_n272(x)
+    if (x < 1)
+        fun_l15_n382(x)
+    else
+        fun_l15_n997(x)
+    end
+end
+
+def fun_l14_n273(x)
+    if (x < 1)
+        fun_l15_n281(x)
+    else
+        fun_l15_n909(x)
+    end
+end
+
+def fun_l14_n274(x)
+    if (x < 1)
+        fun_l15_n618(x)
+    else
+        fun_l15_n967(x)
+    end
+end
+
+def fun_l14_n275(x)
+    if (x < 1)
+        fun_l15_n651(x)
+    else
+        fun_l15_n826(x)
+    end
+end
+
+def fun_l14_n276(x)
+    if (x < 1)
+        fun_l15_n326(x)
+    else
+        fun_l15_n11(x)
+    end
+end
+
+def fun_l14_n277(x)
+    if (x < 1)
+        fun_l15_n193(x)
+    else
+        fun_l15_n719(x)
+    end
+end
+
+def fun_l14_n278(x)
+    if (x < 1)
+        fun_l15_n973(x)
+    else
+        fun_l15_n313(x)
+    end
+end
+
+def fun_l14_n279(x)
+    if (x < 1)
+        fun_l15_n33(x)
+    else
+        fun_l15_n526(x)
+    end
+end
+
+def fun_l14_n280(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n158(x)
+    end
+end
+
+def fun_l14_n281(x)
+    if (x < 1)
+        fun_l15_n627(x)
+    else
+        fun_l15_n346(x)
+    end
+end
+
+def fun_l14_n282(x)
+    if (x < 1)
+        fun_l15_n537(x)
+    else
+        fun_l15_n198(x)
+    end
+end
+
+def fun_l14_n283(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n0(x)
+    end
+end
+
+def fun_l14_n284(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n489(x)
+    end
+end
+
+def fun_l14_n285(x)
+    if (x < 1)
+        fun_l15_n793(x)
+    else
+        fun_l15_n803(x)
+    end
+end
+
+def fun_l14_n286(x)
+    if (x < 1)
+        fun_l15_n206(x)
+    else
+        fun_l15_n936(x)
+    end
+end
+
+def fun_l14_n287(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n278(x)
+    end
+end
+
+def fun_l14_n288(x)
+    if (x < 1)
+        fun_l15_n601(x)
+    else
+        fun_l15_n251(x)
+    end
+end
+
+def fun_l14_n289(x)
+    if (x < 1)
+        fun_l15_n144(x)
+    else
+        fun_l15_n420(x)
+    end
+end
+
+def fun_l14_n290(x)
+    if (x < 1)
+        fun_l15_n964(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n291(x)
+    if (x < 1)
+        fun_l15_n385(x)
+    else
+        fun_l15_n498(x)
+    end
+end
+
+def fun_l14_n292(x)
+    if (x < 1)
+        fun_l15_n19(x)
+    else
+        fun_l15_n959(x)
+    end
+end
+
+def fun_l14_n293(x)
+    if (x < 1)
+        fun_l15_n77(x)
+    else
+        fun_l15_n849(x)
+    end
+end
+
+def fun_l14_n294(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n964(x)
+    end
+end
+
+def fun_l14_n295(x)
+    if (x < 1)
+        fun_l15_n374(x)
+    else
+        fun_l15_n337(x)
+    end
+end
+
+def fun_l14_n296(x)
+    if (x < 1)
+        fun_l15_n210(x)
+    else
+        fun_l15_n621(x)
+    end
+end
+
+def fun_l14_n297(x)
+    if (x < 1)
+        fun_l15_n992(x)
+    else
+        fun_l15_n90(x)
+    end
+end
+
+def fun_l14_n298(x)
+    if (x < 1)
+        fun_l15_n442(x)
+    else
+        fun_l15_n799(x)
+    end
+end
+
+def fun_l14_n299(x)
+    if (x < 1)
+        fun_l15_n133(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n300(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n46(x)
+    end
+end
+
+def fun_l14_n301(x)
+    if (x < 1)
+        fun_l15_n359(x)
+    else
+        fun_l15_n386(x)
+    end
+end
+
+def fun_l14_n302(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n197(x)
+    end
+end
+
+def fun_l14_n303(x)
+    if (x < 1)
+        fun_l15_n382(x)
+    else
+        fun_l15_n693(x)
+    end
+end
+
+def fun_l14_n304(x)
+    if (x < 1)
+        fun_l15_n700(x)
+    else
+        fun_l15_n167(x)
+    end
+end
+
+def fun_l14_n305(x)
+    if (x < 1)
+        fun_l15_n124(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n306(x)
+    if (x < 1)
+        fun_l15_n829(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l14_n307(x)
+    if (x < 1)
+        fun_l15_n39(x)
+    else
+        fun_l15_n557(x)
+    end
+end
+
+def fun_l14_n308(x)
+    if (x < 1)
+        fun_l15_n495(x)
+    else
+        fun_l15_n259(x)
+    end
+end
+
+def fun_l14_n309(x)
+    if (x < 1)
+        fun_l15_n462(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n310(x)
+    if (x < 1)
+        fun_l15_n110(x)
+    else
+        fun_l15_n159(x)
+    end
+end
+
+def fun_l14_n311(x)
+    if (x < 1)
+        fun_l15_n144(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n312(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n313(x)
+    if (x < 1)
+        fun_l15_n332(x)
+    else
+        fun_l15_n759(x)
+    end
+end
+
+def fun_l14_n314(x)
+    if (x < 1)
+        fun_l15_n819(x)
+    else
+        fun_l15_n595(x)
+    end
+end
+
+def fun_l14_n315(x)
+    if (x < 1)
+        fun_l15_n180(x)
+    else
+        fun_l15_n555(x)
+    end
+end
+
+def fun_l14_n316(x)
+    if (x < 1)
+        fun_l15_n218(x)
+    else
+        fun_l15_n844(x)
+    end
+end
+
+def fun_l14_n317(x)
+    if (x < 1)
+        fun_l15_n486(x)
+    else
+        fun_l15_n666(x)
+    end
+end
+
+def fun_l14_n318(x)
+    if (x < 1)
+        fun_l15_n277(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n319(x)
+    if (x < 1)
+        fun_l15_n874(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n320(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n348(x)
+    end
+end
+
+def fun_l14_n321(x)
+    if (x < 1)
+        fun_l15_n701(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n322(x)
+    if (x < 1)
+        fun_l15_n229(x)
+    else
+        fun_l15_n976(x)
+    end
+end
+
+def fun_l14_n323(x)
+    if (x < 1)
+        fun_l15_n288(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n324(x)
+    if (x < 1)
+        fun_l15_n25(x)
+    else
+        fun_l15_n566(x)
+    end
+end
+
+def fun_l14_n325(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n326(x)
+    if (x < 1)
+        fun_l15_n646(x)
+    else
+        fun_l15_n529(x)
+    end
+end
+
+def fun_l14_n327(x)
+    if (x < 1)
+        fun_l15_n126(x)
+    else
+        fun_l15_n247(x)
+    end
+end
+
+def fun_l14_n328(x)
+    if (x < 1)
+        fun_l15_n180(x)
+    else
+        fun_l15_n838(x)
+    end
+end
+
+def fun_l14_n329(x)
+    if (x < 1)
+        fun_l15_n827(x)
+    else
+        fun_l15_n251(x)
+    end
+end
+
+def fun_l14_n330(x)
+    if (x < 1)
+        fun_l15_n232(x)
+    else
+        fun_l15_n371(x)
+    end
+end
+
+def fun_l14_n331(x)
+    if (x < 1)
+        fun_l15_n742(x)
+    else
+        fun_l15_n365(x)
+    end
+end
+
+def fun_l14_n332(x)
+    if (x < 1)
+        fun_l15_n254(x)
+    else
+        fun_l15_n895(x)
+    end
+end
+
+def fun_l14_n333(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n716(x)
+    end
+end
+
+def fun_l14_n334(x)
+    if (x < 1)
+        fun_l15_n907(x)
+    else
+        fun_l15_n846(x)
+    end
+end
+
+def fun_l14_n335(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n207(x)
+    end
+end
+
+def fun_l14_n336(x)
+    if (x < 1)
+        fun_l15_n342(x)
+    else
+        fun_l15_n533(x)
+    end
+end
+
+def fun_l14_n337(x)
+    if (x < 1)
+        fun_l15_n155(x)
+    else
+        fun_l15_n626(x)
+    end
+end
+
+def fun_l14_n338(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n339(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n685(x)
+    end
+end
+
+def fun_l14_n340(x)
+    if (x < 1)
+        fun_l15_n502(x)
+    else
+        fun_l15_n604(x)
+    end
+end
+
+def fun_l14_n341(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n250(x)
+    end
+end
+
+def fun_l14_n342(x)
+    if (x < 1)
+        fun_l15_n16(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n343(x)
+    if (x < 1)
+        fun_l15_n173(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n344(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n287(x)
+    end
+end
+
+def fun_l14_n345(x)
+    if (x < 1)
+        fun_l15_n549(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n346(x)
+    if (x < 1)
+        fun_l15_n587(x)
+    else
+        fun_l15_n712(x)
+    end
+end
+
+def fun_l14_n347(x)
+    if (x < 1)
+        fun_l15_n2(x)
+    else
+        fun_l15_n279(x)
+    end
+end
+
+def fun_l14_n348(x)
+    if (x < 1)
+        fun_l15_n602(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n349(x)
+    if (x < 1)
+        fun_l15_n114(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n350(x)
+    if (x < 1)
+        fun_l15_n751(x)
+    else
+        fun_l15_n760(x)
+    end
+end
+
+def fun_l14_n351(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n168(x)
+    end
+end
+
+def fun_l14_n352(x)
+    if (x < 1)
+        fun_l15_n342(x)
+    else
+        fun_l15_n401(x)
+    end
+end
+
+def fun_l14_n353(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n175(x)
+    end
+end
+
+def fun_l14_n354(x)
+    if (x < 1)
+        fun_l15_n0(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n355(x)
+    if (x < 1)
+        fun_l15_n127(x)
+    else
+        fun_l15_n751(x)
+    end
+end
+
+def fun_l14_n356(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n357(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n694(x)
+    end
+end
+
+def fun_l14_n358(x)
+    if (x < 1)
+        fun_l15_n240(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n359(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n360(x)
+    if (x < 1)
+        fun_l15_n435(x)
+    else
+        fun_l15_n24(x)
+    end
+end
+
+def fun_l14_n361(x)
+    if (x < 1)
+        fun_l15_n366(x)
+    else
+        fun_l15_n397(x)
+    end
+end
+
+def fun_l14_n362(x)
+    if (x < 1)
+        fun_l15_n626(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n363(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n364(x)
+    if (x < 1)
+        fun_l15_n299(x)
+    else
+        fun_l15_n9(x)
+    end
+end
+
+def fun_l14_n365(x)
+    if (x < 1)
+        fun_l15_n115(x)
+    else
+        fun_l15_n126(x)
+    end
+end
+
+def fun_l14_n366(x)
+    if (x < 1)
+        fun_l15_n777(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n367(x)
+    if (x < 1)
+        fun_l15_n697(x)
+    else
+        fun_l15_n663(x)
+    end
+end
+
+def fun_l14_n368(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n339(x)
+    end
+end
+
+def fun_l14_n369(x)
+    if (x < 1)
+        fun_l15_n703(x)
+    else
+        fun_l15_n901(x)
+    end
+end
+
+def fun_l14_n370(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n920(x)
+    end
+end
+
+def fun_l14_n371(x)
+    if (x < 1)
+        fun_l15_n97(x)
+    else
+        fun_l15_n418(x)
+    end
+end
+
+def fun_l14_n372(x)
+    if (x < 1)
+        fun_l15_n831(x)
+    else
+        fun_l15_n295(x)
+    end
+end
+
+def fun_l14_n373(x)
+    if (x < 1)
+        fun_l15_n849(x)
+    else
+        fun_l15_n818(x)
+    end
+end
+
+def fun_l14_n374(x)
+    if (x < 1)
+        fun_l15_n308(x)
+    else
+        fun_l15_n379(x)
+    end
+end
+
+def fun_l14_n375(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n109(x)
+    end
+end
+
+def fun_l14_n376(x)
+    if (x < 1)
+        fun_l15_n444(x)
+    else
+        fun_l15_n509(x)
+    end
+end
+
+def fun_l14_n377(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n363(x)
+    end
+end
+
+def fun_l14_n378(x)
+    if (x < 1)
+        fun_l15_n475(x)
+    else
+        fun_l15_n250(x)
+    end
+end
+
+def fun_l14_n379(x)
+    if (x < 1)
+        fun_l15_n635(x)
+    else
+        fun_l15_n550(x)
+    end
+end
+
+def fun_l14_n380(x)
+    if (x < 1)
+        fun_l15_n835(x)
+    else
+        fun_l15_n261(x)
+    end
+end
+
+def fun_l14_n381(x)
+    if (x < 1)
+        fun_l15_n903(x)
+    else
+        fun_l15_n492(x)
+    end
+end
+
+def fun_l14_n382(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n570(x)
+    end
+end
+
+def fun_l14_n383(x)
+    if (x < 1)
+        fun_l15_n785(x)
+    else
+        fun_l15_n711(x)
+    end
+end
+
+def fun_l14_n384(x)
+    if (x < 1)
+        fun_l15_n321(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n385(x)
+    if (x < 1)
+        fun_l15_n786(x)
+    else
+        fun_l15_n667(x)
+    end
+end
+
+def fun_l14_n386(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n101(x)
+    end
+end
+
+def fun_l14_n387(x)
+    if (x < 1)
+        fun_l15_n868(x)
+    else
+        fun_l15_n1(x)
+    end
+end
+
+def fun_l14_n388(x)
+    if (x < 1)
+        fun_l15_n380(x)
+    else
+        fun_l15_n949(x)
+    end
+end
+
+def fun_l14_n389(x)
+    if (x < 1)
+        fun_l15_n456(x)
+    else
+        fun_l15_n122(x)
+    end
+end
+
+def fun_l14_n390(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n601(x)
+    end
+end
+
+def fun_l14_n391(x)
+    if (x < 1)
+        fun_l15_n523(x)
+    else
+        fun_l15_n754(x)
+    end
+end
+
+def fun_l14_n392(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n393(x)
+    if (x < 1)
+        fun_l15_n249(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n394(x)
+    if (x < 1)
+        fun_l15_n453(x)
+    else
+        fun_l15_n490(x)
+    end
+end
+
+def fun_l14_n395(x)
+    if (x < 1)
+        fun_l15_n699(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n396(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n397(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n682(x)
+    end
+end
+
+def fun_l14_n398(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n74(x)
+    end
+end
+
+def fun_l14_n399(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n504(x)
+    end
+end
+
+def fun_l14_n400(x)
+    if (x < 1)
+        fun_l15_n450(x)
+    else
+        fun_l15_n778(x)
+    end
+end
+
+def fun_l14_n401(x)
+    if (x < 1)
+        fun_l15_n428(x)
+    else
+        fun_l15_n101(x)
+    end
+end
+
+def fun_l14_n402(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n924(x)
+    end
+end
+
+def fun_l14_n403(x)
+    if (x < 1)
+        fun_l15_n957(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n404(x)
+    if (x < 1)
+        fun_l15_n0(x)
+    else
+        fun_l15_n781(x)
+    end
+end
+
+def fun_l14_n405(x)
+    if (x < 1)
+        fun_l15_n100(x)
+    else
+        fun_l15_n21(x)
+    end
+end
+
+def fun_l14_n406(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n925(x)
+    end
+end
+
+def fun_l14_n407(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n193(x)
+    end
+end
+
+def fun_l14_n408(x)
+    if (x < 1)
+        fun_l15_n140(x)
+    else
+        fun_l15_n459(x)
+    end
+end
+
+def fun_l14_n409(x)
+    if (x < 1)
+        fun_l15_n484(x)
+    else
+        fun_l15_n584(x)
+    end
+end
+
+def fun_l14_n410(x)
+    if (x < 1)
+        fun_l15_n762(x)
+    else
+        fun_l15_n640(x)
+    end
+end
+
+def fun_l14_n411(x)
+    if (x < 1)
+        fun_l15_n347(x)
+    else
+        fun_l15_n395(x)
+    end
+end
+
+def fun_l14_n412(x)
+    if (x < 1)
+        fun_l15_n809(x)
+    else
+        fun_l15_n105(x)
+    end
+end
+
+def fun_l14_n413(x)
+    if (x < 1)
+        fun_l15_n929(x)
+    else
+        fun_l15_n265(x)
+    end
+end
+
+def fun_l14_n414(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n415(x)
+    if (x < 1)
+        fun_l15_n650(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n416(x)
+    if (x < 1)
+        fun_l15_n806(x)
+    else
+        fun_l15_n743(x)
+    end
+end
+
+def fun_l14_n417(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n454(x)
+    end
+end
+
+def fun_l14_n418(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n651(x)
+    end
+end
+
+def fun_l14_n419(x)
+    if (x < 1)
+        fun_l15_n341(x)
+    else
+        fun_l15_n242(x)
+    end
+end
+
+def fun_l14_n420(x)
+    if (x < 1)
+        fun_l15_n613(x)
+    else
+        fun_l15_n339(x)
+    end
+end
+
+def fun_l14_n421(x)
+    if (x < 1)
+        fun_l15_n657(x)
+    else
+        fun_l15_n759(x)
+    end
+end
+
+def fun_l14_n422(x)
+    if (x < 1)
+        fun_l15_n33(x)
+    else
+        fun_l15_n669(x)
+    end
+end
+
+def fun_l14_n423(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n963(x)
+    end
+end
+
+def fun_l14_n424(x)
+    if (x < 1)
+        fun_l15_n940(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n425(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n426(x)
+    if (x < 1)
+        fun_l15_n501(x)
+    else
+        fun_l15_n278(x)
+    end
+end
+
+def fun_l14_n427(x)
+    if (x < 1)
+        fun_l15_n620(x)
+    else
+        fun_l15_n426(x)
+    end
+end
+
+def fun_l14_n428(x)
+    if (x < 1)
+        fun_l15_n606(x)
+    else
+        fun_l15_n123(x)
+    end
+end
+
+def fun_l14_n429(x)
+    if (x < 1)
+        fun_l15_n622(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n430(x)
+    if (x < 1)
+        fun_l15_n660(x)
+    else
+        fun_l15_n736(x)
+    end
+end
+
+def fun_l14_n431(x)
+    if (x < 1)
+        fun_l15_n927(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n432(x)
+    if (x < 1)
+        fun_l15_n492(x)
+    else
+        fun_l15_n947(x)
+    end
+end
+
+def fun_l14_n433(x)
+    if (x < 1)
+        fun_l15_n164(x)
+    else
+        fun_l15_n853(x)
+    end
+end
+
+def fun_l14_n434(x)
+    if (x < 1)
+        fun_l15_n730(x)
+    else
+        fun_l15_n265(x)
+    end
+end
+
+def fun_l14_n435(x)
+    if (x < 1)
+        fun_l15_n548(x)
+    else
+        fun_l15_n272(x)
+    end
+end
+
+def fun_l14_n436(x)
+    if (x < 1)
+        fun_l15_n944(x)
+    else
+        fun_l15_n344(x)
+    end
+end
+
+def fun_l14_n437(x)
+    if (x < 1)
+        fun_l15_n931(x)
+    else
+        fun_l15_n376(x)
+    end
+end
+
+def fun_l14_n438(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n439(x)
+    if (x < 1)
+        fun_l15_n705(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n440(x)
+    if (x < 1)
+        fun_l15_n115(x)
+    else
+        fun_l15_n964(x)
+    end
+end
+
+def fun_l14_n441(x)
+    if (x < 1)
+        fun_l15_n396(x)
+    else
+        fun_l15_n780(x)
+    end
+end
+
+def fun_l14_n442(x)
+    if (x < 1)
+        fun_l15_n813(x)
+    else
+        fun_l15_n25(x)
+    end
+end
+
+def fun_l14_n443(x)
+    if (x < 1)
+        fun_l15_n405(x)
+    else
+        fun_l15_n264(x)
+    end
+end
+
+def fun_l14_n444(x)
+    if (x < 1)
+        fun_l15_n816(x)
+    else
+        fun_l15_n857(x)
+    end
+end
+
+def fun_l14_n445(x)
+    if (x < 1)
+        fun_l15_n191(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n446(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n611(x)
+    end
+end
+
+def fun_l14_n447(x)
+    if (x < 1)
+        fun_l15_n473(x)
+    else
+        fun_l15_n701(x)
+    end
+end
+
+def fun_l14_n448(x)
+    if (x < 1)
+        fun_l15_n532(x)
+    else
+        fun_l15_n501(x)
+    end
+end
+
+def fun_l14_n449(x)
+    if (x < 1)
+        fun_l15_n731(x)
+    else
+        fun_l15_n631(x)
+    end
+end
+
+def fun_l14_n450(x)
+    if (x < 1)
+        fun_l15_n75(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n451(x)
+    if (x < 1)
+        fun_l15_n614(x)
+    else
+        fun_l15_n600(x)
+    end
+end
+
+def fun_l14_n452(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n995(x)
+    end
+end
+
+def fun_l14_n453(x)
+    if (x < 1)
+        fun_l15_n712(x)
+    else
+        fun_l15_n815(x)
+    end
+end
+
+def fun_l14_n454(x)
+    if (x < 1)
+        fun_l15_n859(x)
+    else
+        fun_l15_n560(x)
+    end
+end
+
+def fun_l14_n455(x)
+    if (x < 1)
+        fun_l15_n665(x)
+    else
+        fun_l15_n408(x)
+    end
+end
+
+def fun_l14_n456(x)
+    if (x < 1)
+        fun_l15_n693(x)
+    else
+        fun_l15_n491(x)
+    end
+end
+
+def fun_l14_n457(x)
+    if (x < 1)
+        fun_l15_n29(x)
+    else
+        fun_l15_n515(x)
+    end
+end
+
+def fun_l14_n458(x)
+    if (x < 1)
+        fun_l15_n598(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n459(x)
+    if (x < 1)
+        fun_l15_n937(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n460(x)
+    if (x < 1)
+        fun_l15_n950(x)
+    else
+        fun_l15_n874(x)
+    end
+end
+
+def fun_l14_n461(x)
+    if (x < 1)
+        fun_l15_n38(x)
+    else
+        fun_l15_n650(x)
+    end
+end
+
+def fun_l14_n462(x)
+    if (x < 1)
+        fun_l15_n366(x)
+    else
+        fun_l15_n271(x)
+    end
+end
+
+def fun_l14_n463(x)
+    if (x < 1)
+        fun_l15_n21(x)
+    else
+        fun_l15_n690(x)
+    end
+end
+
+def fun_l14_n464(x)
+    if (x < 1)
+        fun_l15_n660(x)
+    else
+        fun_l15_n71(x)
+    end
+end
+
+def fun_l14_n465(x)
+    if (x < 1)
+        fun_l15_n889(x)
+    else
+        fun_l15_n324(x)
+    end
+end
+
+def fun_l14_n466(x)
+    if (x < 1)
+        fun_l15_n808(x)
+    else
+        fun_l15_n532(x)
+    end
+end
+
+def fun_l14_n467(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n468(x)
+    if (x < 1)
+        fun_l15_n563(x)
+    else
+        fun_l15_n327(x)
+    end
+end
+
+def fun_l14_n469(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n794(x)
+    end
+end
+
+def fun_l14_n470(x)
+    if (x < 1)
+        fun_l15_n8(x)
+    else
+        fun_l15_n594(x)
+    end
+end
+
+def fun_l14_n471(x)
+    if (x < 1)
+        fun_l15_n859(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n472(x)
+    if (x < 1)
+        fun_l15_n539(x)
+    else
+        fun_l15_n432(x)
+    end
+end
+
+def fun_l14_n473(x)
+    if (x < 1)
+        fun_l15_n795(x)
+    else
+        fun_l15_n916(x)
+    end
+end
+
+def fun_l14_n474(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n475(x)
+    if (x < 1)
+        fun_l15_n274(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n476(x)
+    if (x < 1)
+        fun_l15_n221(x)
+    else
+        fun_l15_n906(x)
+    end
+end
+
+def fun_l14_n477(x)
+    if (x < 1)
+        fun_l15_n116(x)
+    else
+        fun_l15_n778(x)
+    end
+end
+
+def fun_l14_n478(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n855(x)
+    end
+end
+
+def fun_l14_n479(x)
+    if (x < 1)
+        fun_l15_n705(x)
+    else
+        fun_l15_n935(x)
+    end
+end
+
+def fun_l14_n480(x)
+    if (x < 1)
+        fun_l15_n119(x)
+    else
+        fun_l15_n559(x)
+    end
+end
+
+def fun_l14_n481(x)
+    if (x < 1)
+        fun_l15_n996(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n482(x)
+    if (x < 1)
+        fun_l15_n619(x)
+    else
+        fun_l15_n475(x)
+    end
+end
+
+def fun_l14_n483(x)
+    if (x < 1)
+        fun_l15_n189(x)
+    else
+        fun_l15_n398(x)
+    end
+end
+
+def fun_l14_n484(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n485(x)
+    if (x < 1)
+        fun_l15_n508(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n486(x)
+    if (x < 1)
+        fun_l15_n825(x)
+    else
+        fun_l15_n337(x)
+    end
+end
+
+def fun_l14_n487(x)
+    if (x < 1)
+        fun_l15_n449(x)
+    else
+        fun_l15_n389(x)
+    end
+end
+
+def fun_l14_n488(x)
+    if (x < 1)
+        fun_l15_n328(x)
+    else
+        fun_l15_n658(x)
+    end
+end
+
+def fun_l14_n489(x)
+    if (x < 1)
+        fun_l15_n138(x)
+    else
+        fun_l15_n938(x)
+    end
+end
+
+def fun_l14_n490(x)
+    if (x < 1)
+        fun_l15_n387(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n491(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n516(x)
+    end
+end
+
+def fun_l14_n492(x)
+    if (x < 1)
+        fun_l15_n962(x)
+    else
+        fun_l15_n821(x)
+    end
+end
+
+def fun_l14_n493(x)
+    if (x < 1)
+        fun_l15_n544(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n494(x)
+    if (x < 1)
+        fun_l15_n610(x)
+    else
+        fun_l15_n404(x)
+    end
+end
+
+def fun_l14_n495(x)
+    if (x < 1)
+        fun_l15_n329(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n496(x)
+    if (x < 1)
+        fun_l15_n659(x)
+    else
+        fun_l15_n837(x)
+    end
+end
+
+def fun_l14_n497(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n55(x)
+    end
+end
+
+def fun_l14_n498(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n810(x)
+    end
+end
+
+def fun_l14_n499(x)
+    if (x < 1)
+        fun_l15_n260(x)
+    else
+        fun_l15_n412(x)
+    end
+end
+
+def fun_l14_n500(x)
+    if (x < 1)
+        fun_l15_n940(x)
+    else
+        fun_l15_n920(x)
+    end
+end
+
+def fun_l14_n501(x)
+    if (x < 1)
+        fun_l15_n829(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n502(x)
+    if (x < 1)
+        fun_l15_n457(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n503(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n812(x)
+    end
+end
+
+def fun_l14_n504(x)
+    if (x < 1)
+        fun_l15_n175(x)
+    else
+        fun_l15_n715(x)
+    end
+end
+
+def fun_l14_n505(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n103(x)
+    end
+end
+
+def fun_l14_n506(x)
+    if (x < 1)
+        fun_l15_n357(x)
+    else
+        fun_l15_n606(x)
+    end
+end
+
+def fun_l14_n507(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n389(x)
+    end
+end
+
+def fun_l14_n508(x)
+    if (x < 1)
+        fun_l15_n641(x)
+    else
+        fun_l15_n450(x)
+    end
+end
+
+def fun_l14_n509(x)
+    if (x < 1)
+        fun_l15_n4(x)
+    else
+        fun_l15_n533(x)
+    end
+end
+
+def fun_l14_n510(x)
+    if (x < 1)
+        fun_l15_n258(x)
+    else
+        fun_l15_n716(x)
+    end
+end
+
+def fun_l14_n511(x)
+    if (x < 1)
+        fun_l15_n919(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n512(x)
+    if (x < 1)
+        fun_l15_n313(x)
+    else
+        fun_l15_n282(x)
+    end
+end
+
+def fun_l14_n513(x)
+    if (x < 1)
+        fun_l15_n116(x)
+    else
+        fun_l15_n861(x)
+    end
+end
+
+def fun_l14_n514(x)
+    if (x < 1)
+        fun_l15_n178(x)
+    else
+        fun_l15_n717(x)
+    end
+end
+
+def fun_l14_n515(x)
+    if (x < 1)
+        fun_l15_n896(x)
+    else
+        fun_l15_n583(x)
+    end
+end
+
+def fun_l14_n516(x)
+    if (x < 1)
+        fun_l15_n203(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n517(x)
+    if (x < 1)
+        fun_l15_n810(x)
+    else
+        fun_l15_n34(x)
+    end
+end
+
+def fun_l14_n518(x)
+    if (x < 1)
+        fun_l15_n908(x)
+    else
+        fun_l15_n623(x)
+    end
+end
+
+def fun_l14_n519(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n411(x)
+    end
+end
+
+def fun_l14_n520(x)
+    if (x < 1)
+        fun_l15_n880(x)
+    else
+        fun_l15_n38(x)
+    end
+end
+
+def fun_l14_n521(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n522(x)
+    if (x < 1)
+        fun_l15_n693(x)
+    else
+        fun_l15_n950(x)
+    end
+end
+
+def fun_l14_n523(x)
+    if (x < 1)
+        fun_l15_n654(x)
+    else
+        fun_l15_n27(x)
+    end
+end
+
+def fun_l14_n524(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n873(x)
+    end
+end
+
+def fun_l14_n525(x)
+    if (x < 1)
+        fun_l15_n554(x)
+    else
+        fun_l15_n656(x)
+    end
+end
+
+def fun_l14_n526(x)
+    if (x < 1)
+        fun_l15_n739(x)
+    else
+        fun_l15_n69(x)
+    end
+end
+
+def fun_l14_n527(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n528(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n271(x)
+    end
+end
+
+def fun_l14_n529(x)
+    if (x < 1)
+        fun_l15_n652(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n530(x)
+    if (x < 1)
+        fun_l15_n746(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n531(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n532(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n514(x)
+    end
+end
+
+def fun_l14_n533(x)
+    if (x < 1)
+        fun_l15_n375(x)
+    else
+        fun_l15_n84(x)
+    end
+end
+
+def fun_l14_n534(x)
+    if (x < 1)
+        fun_l15_n226(x)
+    else
+        fun_l15_n770(x)
+    end
+end
+
+def fun_l14_n535(x)
+    if (x < 1)
+        fun_l15_n106(x)
+    else
+        fun_l15_n230(x)
+    end
+end
+
+def fun_l14_n536(x)
+    if (x < 1)
+        fun_l15_n18(x)
+    else
+        fun_l15_n335(x)
+    end
+end
+
+def fun_l14_n537(x)
+    if (x < 1)
+        fun_l15_n755(x)
+    else
+        fun_l15_n16(x)
+    end
+end
+
+def fun_l14_n538(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n539(x)
+    if (x < 1)
+        fun_l15_n665(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n540(x)
+    if (x < 1)
+        fun_l15_n282(x)
+    else
+        fun_l15_n780(x)
+    end
+end
+
+def fun_l14_n541(x)
+    if (x < 1)
+        fun_l15_n633(x)
+    else
+        fun_l15_n240(x)
+    end
+end
+
+def fun_l14_n542(x)
+    if (x < 1)
+        fun_l15_n141(x)
+    else
+        fun_l15_n474(x)
+    end
+end
+
+def fun_l14_n543(x)
+    if (x < 1)
+        fun_l15_n80(x)
+    else
+        fun_l15_n708(x)
+    end
+end
+
+def fun_l14_n544(x)
+    if (x < 1)
+        fun_l15_n309(x)
+    else
+        fun_l15_n808(x)
+    end
+end
+
+def fun_l14_n545(x)
+    if (x < 1)
+        fun_l15_n744(x)
+    else
+        fun_l15_n51(x)
+    end
+end
+
+def fun_l14_n546(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n581(x)
+    end
+end
+
+def fun_l14_n547(x)
+    if (x < 1)
+        fun_l15_n272(x)
+    else
+        fun_l15_n867(x)
+    end
+end
+
+def fun_l14_n548(x)
+    if (x < 1)
+        fun_l15_n96(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n549(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n109(x)
+    end
+end
+
+def fun_l14_n550(x)
+    if (x < 1)
+        fun_l15_n94(x)
+    else
+        fun_l15_n839(x)
+    end
+end
+
+def fun_l14_n551(x)
+    if (x < 1)
+        fun_l15_n704(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n552(x)
+    if (x < 1)
+        fun_l15_n531(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n553(x)
+    if (x < 1)
+        fun_l15_n506(x)
+    else
+        fun_l15_n16(x)
+    end
+end
+
+def fun_l14_n554(x)
+    if (x < 1)
+        fun_l15_n583(x)
+    else
+        fun_l15_n186(x)
+    end
+end
+
+def fun_l14_n555(x)
+    if (x < 1)
+        fun_l15_n673(x)
+    else
+        fun_l15_n560(x)
+    end
+end
+
+def fun_l14_n556(x)
+    if (x < 1)
+        fun_l15_n947(x)
+    else
+        fun_l15_n268(x)
+    end
+end
+
+def fun_l14_n557(x)
+    if (x < 1)
+        fun_l15_n88(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n558(x)
+    if (x < 1)
+        fun_l15_n690(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n559(x)
+    if (x < 1)
+        fun_l15_n24(x)
+    else
+        fun_l15_n631(x)
+    end
+end
+
+def fun_l14_n560(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n3(x)
+    end
+end
+
+def fun_l14_n561(x)
+    if (x < 1)
+        fun_l15_n954(x)
+    else
+        fun_l15_n816(x)
+    end
+end
+
+def fun_l14_n562(x)
+    if (x < 1)
+        fun_l15_n948(x)
+    else
+        fun_l15_n886(x)
+    end
+end
+
+def fun_l14_n563(x)
+    if (x < 1)
+        fun_l15_n749(x)
+    else
+        fun_l15_n558(x)
+    end
+end
+
+def fun_l14_n564(x)
+    if (x < 1)
+        fun_l15_n715(x)
+    else
+        fun_l15_n157(x)
+    end
+end
+
+def fun_l14_n565(x)
+    if (x < 1)
+        fun_l15_n674(x)
+    else
+        fun_l15_n643(x)
+    end
+end
+
+def fun_l14_n566(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n686(x)
+    end
+end
+
+def fun_l14_n567(x)
+    if (x < 1)
+        fun_l15_n362(x)
+    else
+        fun_l15_n37(x)
+    end
+end
+
+def fun_l14_n568(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n146(x)
+    end
+end
+
+def fun_l14_n569(x)
+    if (x < 1)
+        fun_l15_n32(x)
+    else
+        fun_l15_n203(x)
+    end
+end
+
+def fun_l14_n570(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n571(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n572(x)
+    if (x < 1)
+        fun_l15_n735(x)
+    else
+        fun_l15_n100(x)
+    end
+end
+
+def fun_l14_n573(x)
+    if (x < 1)
+        fun_l15_n186(x)
+    else
+        fun_l15_n83(x)
+    end
+end
+
+def fun_l14_n574(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n573(x)
+    end
+end
+
+def fun_l14_n575(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n618(x)
+    end
+end
+
+def fun_l14_n576(x)
+    if (x < 1)
+        fun_l15_n426(x)
+    else
+        fun_l15_n616(x)
+    end
+end
+
+def fun_l14_n577(x)
+    if (x < 1)
+        fun_l15_n810(x)
+    else
+        fun_l15_n817(x)
+    end
+end
+
+def fun_l14_n578(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n815(x)
+    end
+end
+
+def fun_l14_n579(x)
+    if (x < 1)
+        fun_l15_n851(x)
+    else
+        fun_l15_n524(x)
+    end
+end
+
+def fun_l14_n580(x)
+    if (x < 1)
+        fun_l15_n748(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n581(x)
+    if (x < 1)
+        fun_l15_n284(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n582(x)
+    if (x < 1)
+        fun_l15_n976(x)
+    else
+        fun_l15_n294(x)
+    end
+end
+
+def fun_l14_n583(x)
+    if (x < 1)
+        fun_l15_n609(x)
+    else
+        fun_l15_n866(x)
+    end
+end
+
+def fun_l14_n584(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n980(x)
+    end
+end
+
+def fun_l14_n585(x)
+    if (x < 1)
+        fun_l15_n548(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n586(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n587(x)
+    if (x < 1)
+        fun_l15_n963(x)
+    else
+        fun_l15_n120(x)
+    end
+end
+
+def fun_l14_n588(x)
+    if (x < 1)
+        fun_l15_n149(x)
+    else
+        fun_l15_n17(x)
+    end
+end
+
+def fun_l14_n589(x)
+    if (x < 1)
+        fun_l15_n11(x)
+    else
+        fun_l15_n396(x)
+    end
+end
+
+def fun_l14_n590(x)
+    if (x < 1)
+        fun_l15_n40(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n591(x)
+    if (x < 1)
+        fun_l15_n617(x)
+    else
+        fun_l15_n564(x)
+    end
+end
+
+def fun_l14_n592(x)
+    if (x < 1)
+        fun_l15_n26(x)
+    else
+        fun_l15_n812(x)
+    end
+end
+
+def fun_l14_n593(x)
+    if (x < 1)
+        fun_l15_n890(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n594(x)
+    if (x < 1)
+        fun_l15_n455(x)
+    else
+        fun_l15_n248(x)
+    end
+end
+
+def fun_l14_n595(x)
+    if (x < 1)
+        fun_l15_n880(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n596(x)
+    if (x < 1)
+        fun_l15_n412(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l14_n597(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n75(x)
+    end
+end
+
+def fun_l14_n598(x)
+    if (x < 1)
+        fun_l15_n911(x)
+    else
+        fun_l15_n789(x)
+    end
+end
+
+def fun_l14_n599(x)
+    if (x < 1)
+        fun_l15_n856(x)
+    else
+        fun_l15_n773(x)
+    end
+end
+
+def fun_l14_n600(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n601(x)
+    if (x < 1)
+        fun_l15_n828(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n602(x)
+    if (x < 1)
+        fun_l15_n230(x)
+    else
+        fun_l15_n326(x)
+    end
+end
+
+def fun_l14_n603(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n906(x)
+    end
+end
+
+def fun_l14_n604(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n605(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n0(x)
+    end
+end
+
+def fun_l14_n606(x)
+    if (x < 1)
+        fun_l15_n258(x)
+    else
+        fun_l15_n574(x)
+    end
+end
+
+def fun_l14_n607(x)
+    if (x < 1)
+        fun_l15_n821(x)
+    else
+        fun_l15_n786(x)
+    end
+end
+
+def fun_l14_n608(x)
+    if (x < 1)
+        fun_l15_n553(x)
+    else
+        fun_l15_n183(x)
+    end
+end
+
+def fun_l14_n609(x)
+    if (x < 1)
+        fun_l15_n853(x)
+    else
+        fun_l15_n600(x)
+    end
+end
+
+def fun_l14_n610(x)
+    if (x < 1)
+        fun_l15_n606(x)
+    else
+        fun_l15_n76(x)
+    end
+end
+
+def fun_l14_n611(x)
+    if (x < 1)
+        fun_l15_n488(x)
+    else
+        fun_l15_n313(x)
+    end
+end
+
+def fun_l14_n612(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n320(x)
+    end
+end
+
+def fun_l14_n613(x)
+    if (x < 1)
+        fun_l15_n410(x)
+    else
+        fun_l15_n225(x)
+    end
+end
+
+def fun_l14_n614(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n699(x)
+    end
+end
+
+def fun_l14_n615(x)
+    if (x < 1)
+        fun_l15_n917(x)
+    else
+        fun_l15_n199(x)
+    end
+end
+
+def fun_l14_n616(x)
+    if (x < 1)
+        fun_l15_n583(x)
+    else
+        fun_l15_n676(x)
+    end
+end
+
+def fun_l14_n617(x)
+    if (x < 1)
+        fun_l15_n708(x)
+    else
+        fun_l15_n323(x)
+    end
+end
+
+def fun_l14_n618(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n570(x)
+    end
+end
+
+def fun_l14_n619(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n765(x)
+    end
+end
+
+def fun_l14_n620(x)
+    if (x < 1)
+        fun_l15_n621(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n621(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n586(x)
+    end
+end
+
+def fun_l14_n622(x)
+    if (x < 1)
+        fun_l15_n786(x)
+    else
+        fun_l15_n894(x)
+    end
+end
+
+def fun_l14_n623(x)
+    if (x < 1)
+        fun_l15_n637(x)
+    else
+        fun_l15_n502(x)
+    end
+end
+
+def fun_l14_n624(x)
+    if (x < 1)
+        fun_l15_n982(x)
+    else
+        fun_l15_n690(x)
+    end
+end
+
+def fun_l14_n625(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n407(x)
+    end
+end
+
+def fun_l14_n626(x)
+    if (x < 1)
+        fun_l15_n324(x)
+    else
+        fun_l15_n937(x)
+    end
+end
+
+def fun_l14_n627(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n628(x)
+    if (x < 1)
+        fun_l15_n865(x)
+    else
+        fun_l15_n459(x)
+    end
+end
+
+def fun_l14_n629(x)
+    if (x < 1)
+        fun_l15_n990(x)
+    else
+        fun_l15_n602(x)
+    end
+end
+
+def fun_l14_n630(x)
+    if (x < 1)
+        fun_l15_n289(x)
+    else
+        fun_l15_n608(x)
+    end
+end
+
+def fun_l14_n631(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n632(x)
+    if (x < 1)
+        fun_l15_n8(x)
+    else
+        fun_l15_n114(x)
+    end
+end
+
+def fun_l14_n633(x)
+    if (x < 1)
+        fun_l15_n91(x)
+    else
+        fun_l15_n130(x)
+    end
+end
+
+def fun_l14_n634(x)
+    if (x < 1)
+        fun_l15_n691(x)
+    else
+        fun_l15_n961(x)
+    end
+end
+
+def fun_l14_n635(x)
+    if (x < 1)
+        fun_l15_n590(x)
+    else
+        fun_l15_n739(x)
+    end
+end
+
+def fun_l14_n636(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n526(x)
+    end
+end
+
+def fun_l14_n637(x)
+    if (x < 1)
+        fun_l15_n741(x)
+    else
+        fun_l15_n506(x)
+    end
+end
+
+def fun_l14_n638(x)
+    if (x < 1)
+        fun_l15_n458(x)
+    else
+        fun_l15_n1(x)
+    end
+end
+
+def fun_l14_n639(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n500(x)
+    end
+end
+
+def fun_l14_n640(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n450(x)
+    end
+end
+
+def fun_l14_n641(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n591(x)
+    end
+end
+
+def fun_l14_n642(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n643(x)
+    if (x < 1)
+        fun_l15_n320(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n644(x)
+    if (x < 1)
+        fun_l15_n137(x)
+    else
+        fun_l15_n802(x)
+    end
+end
+
+def fun_l14_n645(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n646(x)
+    if (x < 1)
+        fun_l15_n863(x)
+    else
+        fun_l15_n273(x)
+    end
+end
+
+def fun_l14_n647(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n519(x)
+    end
+end
+
+def fun_l14_n648(x)
+    if (x < 1)
+        fun_l15_n232(x)
+    else
+        fun_l15_n876(x)
+    end
+end
+
+def fun_l14_n649(x)
+    if (x < 1)
+        fun_l15_n850(x)
+    else
+        fun_l15_n51(x)
+    end
+end
+
+def fun_l14_n650(x)
+    if (x < 1)
+        fun_l15_n610(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n651(x)
+    if (x < 1)
+        fun_l15_n701(x)
+    else
+        fun_l15_n143(x)
+    end
+end
+
+def fun_l14_n652(x)
+    if (x < 1)
+        fun_l15_n933(x)
+    else
+        fun_l15_n748(x)
+    end
+end
+
+def fun_l14_n653(x)
+    if (x < 1)
+        fun_l15_n280(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n654(x)
+    if (x < 1)
+        fun_l15_n361(x)
+    else
+        fun_l15_n107(x)
+    end
+end
+
+def fun_l14_n655(x)
+    if (x < 1)
+        fun_l15_n743(x)
+    else
+        fun_l15_n899(x)
+    end
+end
+
+def fun_l14_n656(x)
+    if (x < 1)
+        fun_l15_n383(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n657(x)
+    if (x < 1)
+        fun_l15_n244(x)
+    else
+        fun_l15_n349(x)
+    end
+end
+
+def fun_l14_n658(x)
+    if (x < 1)
+        fun_l15_n69(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n659(x)
+    if (x < 1)
+        fun_l15_n570(x)
+    else
+        fun_l15_n760(x)
+    end
+end
+
+def fun_l14_n660(x)
+    if (x < 1)
+        fun_l15_n554(x)
+    else
+        fun_l15_n258(x)
+    end
+end
+
+def fun_l14_n661(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n934(x)
+    end
+end
+
+def fun_l14_n662(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n99(x)
+    end
+end
+
+def fun_l14_n663(x)
+    if (x < 1)
+        fun_l15_n882(x)
+    else
+        fun_l15_n515(x)
+    end
+end
+
+def fun_l14_n664(x)
+    if (x < 1)
+        fun_l15_n623(x)
+    else
+        fun_l15_n679(x)
+    end
+end
+
+def fun_l14_n665(x)
+    if (x < 1)
+        fun_l15_n974(x)
+    else
+        fun_l15_n127(x)
+    end
+end
+
+def fun_l14_n666(x)
+    if (x < 1)
+        fun_l15_n592(x)
+    else
+        fun_l15_n322(x)
+    end
+end
+
+def fun_l14_n667(x)
+    if (x < 1)
+        fun_l15_n698(x)
+    else
+        fun_l15_n670(x)
+    end
+end
+
+def fun_l14_n668(x)
+    if (x < 1)
+        fun_l15_n164(x)
+    else
+        fun_l15_n670(x)
+    end
+end
+
+def fun_l14_n669(x)
+    if (x < 1)
+        fun_l15_n837(x)
+    else
+        fun_l15_n113(x)
+    end
+end
+
+def fun_l14_n670(x)
+    if (x < 1)
+        fun_l15_n200(x)
+    else
+        fun_l15_n486(x)
+    end
+end
+
+def fun_l14_n671(x)
+    if (x < 1)
+        fun_l15_n593(x)
+    else
+        fun_l15_n822(x)
+    end
+end
+
+def fun_l14_n672(x)
+    if (x < 1)
+        fun_l15_n191(x)
+    else
+        fun_l15_n842(x)
+    end
+end
+
+def fun_l14_n673(x)
+    if (x < 1)
+        fun_l15_n391(x)
+    else
+        fun_l15_n119(x)
+    end
+end
+
+def fun_l14_n674(x)
+    if (x < 1)
+        fun_l15_n914(x)
+    else
+        fun_l15_n453(x)
+    end
+end
+
+def fun_l14_n675(x)
+    if (x < 1)
+        fun_l15_n73(x)
+    else
+        fun_l15_n366(x)
+    end
+end
+
+def fun_l14_n676(x)
+    if (x < 1)
+        fun_l15_n58(x)
+    else
+        fun_l15_n804(x)
+    end
+end
+
+def fun_l14_n677(x)
+    if (x < 1)
+        fun_l15_n905(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n678(x)
+    if (x < 1)
+        fun_l15_n301(x)
+    else
+        fun_l15_n838(x)
+    end
+end
+
+def fun_l14_n679(x)
+    if (x < 1)
+        fun_l15_n14(x)
+    else
+        fun_l15_n567(x)
+    end
+end
+
+def fun_l14_n680(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n325(x)
+    end
+end
+
+def fun_l14_n681(x)
+    if (x < 1)
+        fun_l15_n985(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n682(x)
+    if (x < 1)
+        fun_l15_n197(x)
+    else
+        fun_l15_n175(x)
+    end
+end
+
+def fun_l14_n683(x)
+    if (x < 1)
+        fun_l15_n714(x)
+    else
+        fun_l15_n276(x)
+    end
+end
+
+def fun_l14_n684(x)
+    if (x < 1)
+        fun_l15_n720(x)
+    else
+        fun_l15_n517(x)
+    end
+end
+
+def fun_l14_n685(x)
+    if (x < 1)
+        fun_l15_n351(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n686(x)
+    if (x < 1)
+        fun_l15_n199(x)
+    else
+        fun_l15_n163(x)
+    end
+end
+
+def fun_l14_n687(x)
+    if (x < 1)
+        fun_l15_n769(x)
+    else
+        fun_l15_n205(x)
+    end
+end
+
+def fun_l14_n688(x)
+    if (x < 1)
+        fun_l15_n840(x)
+    else
+        fun_l15_n756(x)
+    end
+end
+
+def fun_l14_n689(x)
+    if (x < 1)
+        fun_l15_n306(x)
+    else
+        fun_l15_n273(x)
+    end
+end
+
+def fun_l14_n690(x)
+    if (x < 1)
+        fun_l15_n549(x)
+    else
+        fun_l15_n192(x)
+    end
+end
+
+def fun_l14_n691(x)
+    if (x < 1)
+        fun_l15_n167(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n692(x)
+    if (x < 1)
+        fun_l15_n175(x)
+    else
+        fun_l15_n361(x)
+    end
+end
+
+def fun_l14_n693(x)
+    if (x < 1)
+        fun_l15_n208(x)
+    else
+        fun_l15_n582(x)
+    end
+end
+
+def fun_l14_n694(x)
+    if (x < 1)
+        fun_l15_n347(x)
+    else
+        fun_l15_n962(x)
+    end
+end
+
+def fun_l14_n695(x)
+    if (x < 1)
+        fun_l15_n381(x)
+    else
+        fun_l15_n865(x)
+    end
+end
+
+def fun_l14_n696(x)
+    if (x < 1)
+        fun_l15_n76(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n697(x)
+    if (x < 1)
+        fun_l15_n801(x)
+    else
+        fun_l15_n267(x)
+    end
+end
+
+def fun_l14_n698(x)
+    if (x < 1)
+        fun_l15_n137(x)
+    else
+        fun_l15_n518(x)
+    end
+end
+
+def fun_l14_n699(x)
+    if (x < 1)
+        fun_l15_n56(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n700(x)
+    if (x < 1)
+        fun_l15_n178(x)
+    else
+        fun_l15_n641(x)
+    end
+end
+
+def fun_l14_n701(x)
+    if (x < 1)
+        fun_l15_n815(x)
+    else
+        fun_l15_n692(x)
+    end
+end
+
+def fun_l14_n702(x)
+    if (x < 1)
+        fun_l15_n355(x)
+    else
+        fun_l15_n338(x)
+    end
+end
+
+def fun_l14_n703(x)
+    if (x < 1)
+        fun_l15_n894(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n704(x)
+    if (x < 1)
+        fun_l15_n728(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n705(x)
+    if (x < 1)
+        fun_l15_n304(x)
+    else
+        fun_l15_n237(x)
+    end
+end
+
+def fun_l14_n706(x)
+    if (x < 1)
+        fun_l15_n57(x)
+    else
+        fun_l15_n947(x)
+    end
+end
+
+def fun_l14_n707(x)
+    if (x < 1)
+        fun_l15_n90(x)
+    else
+        fun_l15_n831(x)
+    end
+end
+
+def fun_l14_n708(x)
+    if (x < 1)
+        fun_l15_n487(x)
+    else
+        fun_l15_n937(x)
+    end
+end
+
+def fun_l14_n709(x)
+    if (x < 1)
+        fun_l15_n898(x)
+    else
+        fun_l15_n151(x)
+    end
+end
+
+def fun_l14_n710(x)
+    if (x < 1)
+        fun_l15_n306(x)
+    else
+        fun_l15_n687(x)
+    end
+end
+
+def fun_l14_n711(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n712(x)
+    if (x < 1)
+        fun_l15_n512(x)
+    else
+        fun_l15_n203(x)
+    end
+end
+
+def fun_l14_n713(x)
+    if (x < 1)
+        fun_l15_n611(x)
+    else
+        fun_l15_n474(x)
+    end
+end
+
+def fun_l14_n714(x)
+    if (x < 1)
+        fun_l15_n109(x)
+    else
+        fun_l15_n149(x)
+    end
+end
+
+def fun_l14_n715(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n563(x)
+    end
+end
+
+def fun_l14_n716(x)
+    if (x < 1)
+        fun_l15_n877(x)
+    else
+        fun_l15_n644(x)
+    end
+end
+
+def fun_l14_n717(x)
+    if (x < 1)
+        fun_l15_n960(x)
+    else
+        fun_l15_n471(x)
+    end
+end
+
+def fun_l14_n718(x)
+    if (x < 1)
+        fun_l15_n250(x)
+    else
+        fun_l15_n93(x)
+    end
+end
+
+def fun_l14_n719(x)
+    if (x < 1)
+        fun_l15_n177(x)
+    else
+        fun_l15_n14(x)
+    end
+end
+
+def fun_l14_n720(x)
+    if (x < 1)
+        fun_l15_n912(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n721(x)
+    if (x < 1)
+        fun_l15_n776(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n722(x)
+    if (x < 1)
+        fun_l15_n968(x)
+    else
+        fun_l15_n857(x)
+    end
+end
+
+def fun_l14_n723(x)
+    if (x < 1)
+        fun_l15_n402(x)
+    else
+        fun_l15_n60(x)
+    end
+end
+
+def fun_l14_n724(x)
+    if (x < 1)
+        fun_l15_n345(x)
+    else
+        fun_l15_n688(x)
+    end
+end
+
+def fun_l14_n725(x)
+    if (x < 1)
+        fun_l15_n72(x)
+    else
+        fun_l15_n943(x)
+    end
+end
+
+def fun_l14_n726(x)
+    if (x < 1)
+        fun_l15_n535(x)
+    else
+        fun_l15_n916(x)
+    end
+end
+
+def fun_l14_n727(x)
+    if (x < 1)
+        fun_l15_n717(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n728(x)
+    if (x < 1)
+        fun_l15_n679(x)
+    else
+        fun_l15_n348(x)
+    end
+end
+
+def fun_l14_n729(x)
+    if (x < 1)
+        fun_l15_n187(x)
+    else
+        fun_l15_n910(x)
+    end
+end
+
+def fun_l14_n730(x)
+    if (x < 1)
+        fun_l15_n151(x)
+    else
+        fun_l15_n689(x)
+    end
+end
+
+def fun_l14_n731(x)
+    if (x < 1)
+        fun_l15_n653(x)
+    else
+        fun_l15_n380(x)
+    end
+end
+
+def fun_l14_n732(x)
+    if (x < 1)
+        fun_l15_n627(x)
+    else
+        fun_l15_n214(x)
+    end
+end
+
+def fun_l14_n733(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n734(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n632(x)
+    end
+end
+
+def fun_l14_n735(x)
+    if (x < 1)
+        fun_l15_n415(x)
+    else
+        fun_l15_n719(x)
+    end
+end
+
+def fun_l14_n736(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n966(x)
+    end
+end
+
+def fun_l14_n737(x)
+    if (x < 1)
+        fun_l15_n140(x)
+    else
+        fun_l15_n79(x)
+    end
+end
+
+def fun_l14_n738(x)
+    if (x < 1)
+        fun_l15_n682(x)
+    else
+        fun_l15_n788(x)
+    end
+end
+
+def fun_l14_n739(x)
+    if (x < 1)
+        fun_l15_n62(x)
+    else
+        fun_l15_n289(x)
+    end
+end
+
+def fun_l14_n740(x)
+    if (x < 1)
+        fun_l15_n256(x)
+    else
+        fun_l15_n53(x)
+    end
+end
+
+def fun_l14_n741(x)
+    if (x < 1)
+        fun_l15_n571(x)
+    else
+        fun_l15_n912(x)
+    end
+end
+
+def fun_l14_n742(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n757(x)
+    end
+end
+
+def fun_l14_n743(x)
+    if (x < 1)
+        fun_l15_n914(x)
+    else
+        fun_l15_n216(x)
+    end
+end
+
+def fun_l14_n744(x)
+    if (x < 1)
+        fun_l15_n474(x)
+    else
+        fun_l15_n860(x)
+    end
+end
+
+def fun_l14_n745(x)
+    if (x < 1)
+        fun_l15_n303(x)
+    else
+        fun_l15_n417(x)
+    end
+end
+
+def fun_l14_n746(x)
+    if (x < 1)
+        fun_l15_n601(x)
+    else
+        fun_l15_n872(x)
+    end
+end
+
+def fun_l14_n747(x)
+    if (x < 1)
+        fun_l15_n70(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n748(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n749(x)
+    if (x < 1)
+        fun_l15_n965(x)
+    else
+        fun_l15_n89(x)
+    end
+end
+
+def fun_l14_n750(x)
+    if (x < 1)
+        fun_l15_n910(x)
+    else
+        fun_l15_n386(x)
+    end
+end
+
+def fun_l14_n751(x)
+    if (x < 1)
+        fun_l15_n444(x)
+    else
+        fun_l15_n765(x)
+    end
+end
+
+def fun_l14_n752(x)
+    if (x < 1)
+        fun_l15_n481(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n753(x)
+    if (x < 1)
+        fun_l15_n45(x)
+    else
+        fun_l15_n644(x)
+    end
+end
+
+def fun_l14_n754(x)
+    if (x < 1)
+        fun_l15_n262(x)
+    else
+        fun_l15_n681(x)
+    end
+end
+
+def fun_l14_n755(x)
+    if (x < 1)
+        fun_l15_n984(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n756(x)
+    if (x < 1)
+        fun_l15_n751(x)
+    else
+        fun_l15_n165(x)
+    end
+end
+
+def fun_l14_n757(x)
+    if (x < 1)
+        fun_l15_n716(x)
+    else
+        fun_l15_n483(x)
+    end
+end
+
+def fun_l14_n758(x)
+    if (x < 1)
+        fun_l15_n863(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n759(x)
+    if (x < 1)
+        fun_l15_n654(x)
+    else
+        fun_l15_n782(x)
+    end
+end
+
+def fun_l14_n760(x)
+    if (x < 1)
+        fun_l15_n390(x)
+    else
+        fun_l15_n254(x)
+    end
+end
+
+def fun_l14_n761(x)
+    if (x < 1)
+        fun_l15_n888(x)
+    else
+        fun_l15_n739(x)
+    end
+end
+
+def fun_l14_n762(x)
+    if (x < 1)
+        fun_l15_n775(x)
+    else
+        fun_l15_n310(x)
+    end
+end
+
+def fun_l14_n763(x)
+    if (x < 1)
+        fun_l15_n713(x)
+    else
+        fun_l15_n246(x)
+    end
+end
+
+def fun_l14_n764(x)
+    if (x < 1)
+        fun_l15_n318(x)
+    else
+        fun_l15_n121(x)
+    end
+end
+
+def fun_l14_n765(x)
+    if (x < 1)
+        fun_l15_n424(x)
+    else
+        fun_l15_n538(x)
+    end
+end
+
+def fun_l14_n766(x)
+    if (x < 1)
+        fun_l15_n58(x)
+    else
+        fun_l15_n487(x)
+    end
+end
+
+def fun_l14_n767(x)
+    if (x < 1)
+        fun_l15_n48(x)
+    else
+        fun_l15_n776(x)
+    end
+end
+
+def fun_l14_n768(x)
+    if (x < 1)
+        fun_l15_n156(x)
+    else
+        fun_l15_n340(x)
+    end
+end
+
+def fun_l14_n769(x)
+    if (x < 1)
+        fun_l15_n66(x)
+    else
+        fun_l15_n655(x)
+    end
+end
+
+def fun_l14_n770(x)
+    if (x < 1)
+        fun_l15_n15(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n771(x)
+    if (x < 1)
+        fun_l15_n331(x)
+    else
+        fun_l15_n114(x)
+    end
+end
+
+def fun_l14_n772(x)
+    if (x < 1)
+        fun_l15_n267(x)
+    else
+        fun_l15_n711(x)
+    end
+end
+
+def fun_l14_n773(x)
+    if (x < 1)
+        fun_l15_n567(x)
+    else
+        fun_l15_n869(x)
+    end
+end
+
+def fun_l14_n774(x)
+    if (x < 1)
+        fun_l15_n915(x)
+    else
+        fun_l15_n594(x)
+    end
+end
+
+def fun_l14_n775(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n285(x)
+    end
+end
+
+def fun_l14_n776(x)
+    if (x < 1)
+        fun_l15_n994(x)
+    else
+        fun_l15_n116(x)
+    end
+end
+
+def fun_l14_n777(x)
+    if (x < 1)
+        fun_l15_n999(x)
+    else
+        fun_l15_n356(x)
+    end
+end
+
+def fun_l14_n778(x)
+    if (x < 1)
+        fun_l15_n46(x)
+    else
+        fun_l15_n845(x)
+    end
+end
+
+def fun_l14_n779(x)
+    if (x < 1)
+        fun_l15_n313(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n780(x)
+    if (x < 1)
+        fun_l15_n282(x)
+    else
+        fun_l15_n489(x)
+    end
+end
+
+def fun_l14_n781(x)
+    if (x < 1)
+        fun_l15_n101(x)
+    else
+        fun_l15_n928(x)
+    end
+end
+
+def fun_l14_n782(x)
+    if (x < 1)
+        fun_l15_n307(x)
+    else
+        fun_l15_n808(x)
+    end
+end
+
+def fun_l14_n783(x)
+    if (x < 1)
+        fun_l15_n475(x)
+    else
+        fun_l15_n347(x)
+    end
+end
+
+def fun_l14_n784(x)
+    if (x < 1)
+        fun_l15_n404(x)
+    else
+        fun_l15_n65(x)
+    end
+end
+
+def fun_l14_n785(x)
+    if (x < 1)
+        fun_l15_n61(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n786(x)
+    if (x < 1)
+        fun_l15_n919(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n787(x)
+    if (x < 1)
+        fun_l15_n333(x)
+    else
+        fun_l15_n702(x)
+    end
+end
+
+def fun_l14_n788(x)
+    if (x < 1)
+        fun_l15_n924(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n789(x)
+    if (x < 1)
+        fun_l15_n171(x)
+    else
+        fun_l15_n643(x)
+    end
+end
+
+def fun_l14_n790(x)
+    if (x < 1)
+        fun_l15_n852(x)
+    else
+        fun_l15_n421(x)
+    end
+end
+
+def fun_l14_n791(x)
+    if (x < 1)
+        fun_l15_n706(x)
+    else
+        fun_l15_n260(x)
+    end
+end
+
+def fun_l14_n792(x)
+    if (x < 1)
+        fun_l15_n908(x)
+    else
+        fun_l15_n145(x)
+    end
+end
+
+def fun_l14_n793(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n365(x)
+    end
+end
+
+def fun_l14_n794(x)
+    if (x < 1)
+        fun_l15_n727(x)
+    else
+        fun_l15_n758(x)
+    end
+end
+
+def fun_l14_n795(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n796(x)
+    if (x < 1)
+        fun_l15_n413(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n797(x)
+    if (x < 1)
+        fun_l15_n970(x)
+    else
+        fun_l15_n480(x)
+    end
+end
+
+def fun_l14_n798(x)
+    if (x < 1)
+        fun_l15_n476(x)
+    else
+        fun_l15_n316(x)
+    end
+end
+
+def fun_l14_n799(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n586(x)
+    end
+end
+
+def fun_l14_n800(x)
+    if (x < 1)
+        fun_l15_n848(x)
+    else
+        fun_l15_n286(x)
+    end
+end
+
+def fun_l14_n801(x)
+    if (x < 1)
+        fun_l15_n745(x)
+    else
+        fun_l15_n144(x)
+    end
+end
+
+def fun_l14_n802(x)
+    if (x < 1)
+        fun_l15_n369(x)
+    else
+        fun_l15_n819(x)
+    end
+end
+
+def fun_l14_n803(x)
+    if (x < 1)
+        fun_l15_n498(x)
+    else
+        fun_l15_n206(x)
+    end
+end
+
+def fun_l14_n804(x)
+    if (x < 1)
+        fun_l15_n817(x)
+    else
+        fun_l15_n707(x)
+    end
+end
+
+def fun_l14_n805(x)
+    if (x < 1)
+        fun_l15_n935(x)
+    else
+        fun_l15_n43(x)
+    end
+end
+
+def fun_l14_n806(x)
+    if (x < 1)
+        fun_l15_n285(x)
+    else
+        fun_l15_n605(x)
+    end
+end
+
+def fun_l14_n807(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n672(x)
+    end
+end
+
+def fun_l14_n808(x)
+    if (x < 1)
+        fun_l15_n965(x)
+    else
+        fun_l15_n610(x)
+    end
+end
+
+def fun_l14_n809(x)
+    if (x < 1)
+        fun_l15_n266(x)
+    else
+        fun_l15_n233(x)
+    end
+end
+
+def fun_l14_n810(x)
+    if (x < 1)
+        fun_l15_n514(x)
+    else
+        fun_l15_n204(x)
+    end
+end
+
+def fun_l14_n811(x)
+    if (x < 1)
+        fun_l15_n973(x)
+    else
+        fun_l15_n768(x)
+    end
+end
+
+def fun_l14_n812(x)
+    if (x < 1)
+        fun_l15_n241(x)
+    else
+        fun_l15_n329(x)
+    end
+end
+
+def fun_l14_n813(x)
+    if (x < 1)
+        fun_l15_n150(x)
+    else
+        fun_l15_n264(x)
+    end
+end
+
+def fun_l14_n814(x)
+    if (x < 1)
+        fun_l15_n205(x)
+    else
+        fun_l15_n595(x)
+    end
+end
+
+def fun_l14_n815(x)
+    if (x < 1)
+        fun_l15_n452(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n816(x)
+    if (x < 1)
+        fun_l15_n385(x)
+    else
+        fun_l15_n633(x)
+    end
+end
+
+def fun_l14_n817(x)
+    if (x < 1)
+        fun_l15_n290(x)
+    else
+        fun_l15_n656(x)
+    end
+end
+
+def fun_l14_n818(x)
+    if (x < 1)
+        fun_l15_n463(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n819(x)
+    if (x < 1)
+        fun_l15_n183(x)
+    else
+        fun_l15_n787(x)
+    end
+end
+
+def fun_l14_n820(x)
+    if (x < 1)
+        fun_l15_n515(x)
+    else
+        fun_l15_n104(x)
+    end
+end
+
+def fun_l14_n821(x)
+    if (x < 1)
+        fun_l15_n848(x)
+    else
+        fun_l15_n745(x)
+    end
+end
+
+def fun_l14_n822(x)
+    if (x < 1)
+        fun_l15_n268(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n823(x)
+    if (x < 1)
+        fun_l15_n607(x)
+    else
+        fun_l15_n785(x)
+    end
+end
+
+def fun_l14_n824(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n659(x)
+    end
+end
+
+def fun_l14_n825(x)
+    if (x < 1)
+        fun_l15_n628(x)
+    else
+        fun_l15_n427(x)
+    end
+end
+
+def fun_l14_n826(x)
+    if (x < 1)
+        fun_l15_n293(x)
+    else
+        fun_l15_n141(x)
+    end
+end
+
+def fun_l14_n827(x)
+    if (x < 1)
+        fun_l15_n112(x)
+    else
+        fun_l15_n135(x)
+    end
+end
+
+def fun_l14_n828(x)
+    if (x < 1)
+        fun_l15_n779(x)
+    else
+        fun_l15_n323(x)
+    end
+end
+
+def fun_l14_n829(x)
+    if (x < 1)
+        fun_l15_n295(x)
+    else
+        fun_l15_n753(x)
+    end
+end
+
+def fun_l14_n830(x)
+    if (x < 1)
+        fun_l15_n683(x)
+    else
+        fun_l15_n303(x)
+    end
+end
+
+def fun_l14_n831(x)
+    if (x < 1)
+        fun_l15_n522(x)
+    else
+        fun_l15_n983(x)
+    end
+end
+
+def fun_l14_n832(x)
+    if (x < 1)
+        fun_l15_n338(x)
+    else
+        fun_l15_n835(x)
+    end
+end
+
+def fun_l14_n833(x)
+    if (x < 1)
+        fun_l15_n888(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n834(x)
+    if (x < 1)
+        fun_l15_n510(x)
+    else
+        fun_l15_n342(x)
+    end
+end
+
+def fun_l14_n835(x)
+    if (x < 1)
+        fun_l15_n168(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n836(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n779(x)
+    end
+end
+
+def fun_l14_n837(x)
+    if (x < 1)
+        fun_l15_n176(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n838(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n95(x)
+    end
+end
+
+def fun_l14_n839(x)
+    if (x < 1)
+        fun_l15_n223(x)
+    else
+        fun_l15_n213(x)
+    end
+end
+
+def fun_l14_n840(x)
+    if (x < 1)
+        fun_l15_n228(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n841(x)
+    if (x < 1)
+        fun_l15_n551(x)
+    else
+        fun_l15_n649(x)
+    end
+end
+
+def fun_l14_n842(x)
+    if (x < 1)
+        fun_l15_n541(x)
+    else
+        fun_l15_n741(x)
+    end
+end
+
+def fun_l14_n843(x)
+    if (x < 1)
+        fun_l15_n464(x)
+    else
+        fun_l15_n403(x)
+    end
+end
+
+def fun_l14_n844(x)
+    if (x < 1)
+        fun_l15_n853(x)
+    else
+        fun_l15_n223(x)
+    end
+end
+
+def fun_l14_n845(x)
+    if (x < 1)
+        fun_l15_n443(x)
+    else
+        fun_l15_n441(x)
+    end
+end
+
+def fun_l14_n846(x)
+    if (x < 1)
+        fun_l15_n864(x)
+    else
+        fun_l15_n912(x)
+    end
+end
+
+def fun_l14_n847(x)
+    if (x < 1)
+        fun_l15_n631(x)
+    else
+        fun_l15_n764(x)
+    end
+end
+
+def fun_l14_n848(x)
+    if (x < 1)
+        fun_l15_n198(x)
+    else
+        fun_l15_n825(x)
+    end
+end
+
+def fun_l14_n849(x)
+    if (x < 1)
+        fun_l15_n525(x)
+    else
+        fun_l15_n31(x)
+    end
+end
+
+def fun_l14_n850(x)
+    if (x < 1)
+        fun_l15_n928(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n851(x)
+    if (x < 1)
+        fun_l15_n499(x)
+    else
+        fun_l15_n297(x)
+    end
+end
+
+def fun_l14_n852(x)
+    if (x < 1)
+        fun_l15_n777(x)
+    else
+        fun_l15_n239(x)
+    end
+end
+
+def fun_l14_n853(x)
+    if (x < 1)
+        fun_l15_n120(x)
+    else
+        fun_l15_n134(x)
+    end
+end
+
+def fun_l14_n854(x)
+    if (x < 1)
+        fun_l15_n613(x)
+    else
+        fun_l15_n324(x)
+    end
+end
+
+def fun_l14_n855(x)
+    if (x < 1)
+        fun_l15_n22(x)
+    else
+        fun_l15_n192(x)
+    end
+end
+
+def fun_l14_n856(x)
+    if (x < 1)
+        fun_l15_n609(x)
+    else
+        fun_l15_n284(x)
+    end
+end
+
+def fun_l14_n857(x)
+    if (x < 1)
+        fun_l15_n130(x)
+    else
+        fun_l15_n256(x)
+    end
+end
+
+def fun_l14_n858(x)
+    if (x < 1)
+        fun_l15_n40(x)
+    else
+        fun_l15_n340(x)
+    end
+end
+
+def fun_l14_n859(x)
+    if (x < 1)
+        fun_l15_n644(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n860(x)
+    if (x < 1)
+        fun_l15_n363(x)
+    else
+        fun_l15_n52(x)
+    end
+end
+
+def fun_l14_n861(x)
+    if (x < 1)
+        fun_l15_n166(x)
+    else
+        fun_l15_n452(x)
+    end
+end
+
+def fun_l14_n862(x)
+    if (x < 1)
+        fun_l15_n552(x)
+    else
+        fun_l15_n534(x)
+    end
+end
+
+def fun_l14_n863(x)
+    if (x < 1)
+        fun_l15_n489(x)
+    else
+        fun_l15_n181(x)
+    end
+end
+
+def fun_l14_n864(x)
+    if (x < 1)
+        fun_l15_n584(x)
+    else
+        fun_l15_n871(x)
+    end
+end
+
+def fun_l14_n865(x)
+    if (x < 1)
+        fun_l15_n868(x)
+    else
+        fun_l15_n807(x)
+    end
+end
+
+def fun_l14_n866(x)
+    if (x < 1)
+        fun_l15_n159(x)
+    else
+        fun_l15_n226(x)
+    end
+end
+
+def fun_l14_n867(x)
+    if (x < 1)
+        fun_l15_n440(x)
+    else
+        fun_l15_n318(x)
+    end
+end
+
+def fun_l14_n868(x)
+    if (x < 1)
+        fun_l15_n603(x)
+    else
+        fun_l15_n440(x)
+    end
+end
+
+def fun_l14_n869(x)
+    if (x < 1)
+        fun_l15_n478(x)
+    else
+        fun_l15_n896(x)
+    end
+end
+
+def fun_l14_n870(x)
+    if (x < 1)
+        fun_l15_n593(x)
+    else
+        fun_l15_n973(x)
+    end
+end
+
+def fun_l14_n871(x)
+    if (x < 1)
+        fun_l15_n767(x)
+    else
+        fun_l15_n828(x)
+    end
+end
+
+def fun_l14_n872(x)
+    if (x < 1)
+        fun_l15_n578(x)
+    else
+        fun_l15_n309(x)
+    end
+end
+
+def fun_l14_n873(x)
+    if (x < 1)
+        fun_l15_n959(x)
+    else
+        fun_l15_n263(x)
+    end
+end
+
+def fun_l14_n874(x)
+    if (x < 1)
+        fun_l15_n170(x)
+    else
+        fun_l15_n700(x)
+    end
+end
+
+def fun_l14_n875(x)
+    if (x < 1)
+        fun_l15_n800(x)
+    else
+        fun_l15_n703(x)
+    end
+end
+
+def fun_l14_n876(x)
+    if (x < 1)
+        fun_l15_n556(x)
+    else
+        fun_l15_n854(x)
+    end
+end
+
+def fun_l14_n877(x)
+    if (x < 1)
+        fun_l15_n472(x)
+    else
+        fun_l15_n893(x)
+    end
+end
+
+def fun_l14_n878(x)
+    if (x < 1)
+        fun_l15_n847(x)
+    else
+        fun_l15_n438(x)
+    end
+end
+
+def fun_l14_n879(x)
+    if (x < 1)
+        fun_l15_n401(x)
+    else
+        fun_l15_n59(x)
+    end
+end
+
+def fun_l14_n880(x)
+    if (x < 1)
+        fun_l15_n321(x)
+    else
+        fun_l15_n57(x)
+    end
+end
+
+def fun_l14_n881(x)
+    if (x < 1)
+        fun_l15_n664(x)
+    else
+        fun_l15_n448(x)
+    end
+end
+
+def fun_l14_n882(x)
+    if (x < 1)
+        fun_l15_n113(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n883(x)
+    if (x < 1)
+        fun_l15_n596(x)
+    else
+        fun_l15_n354(x)
+    end
+end
+
+def fun_l14_n884(x)
+    if (x < 1)
+        fun_l15_n681(x)
+    else
+        fun_l15_n801(x)
+    end
+end
+
+def fun_l14_n885(x)
+    if (x < 1)
+        fun_l15_n802(x)
+    else
+        fun_l15_n327(x)
+    end
+end
+
+def fun_l14_n886(x)
+    if (x < 1)
+        fun_l15_n657(x)
+    else
+        fun_l15_n325(x)
+    end
+end
+
+def fun_l14_n887(x)
+    if (x < 1)
+        fun_l15_n108(x)
+    else
+        fun_l15_n11(x)
+    end
+end
+
+def fun_l14_n888(x)
+    if (x < 1)
+        fun_l15_n696(x)
+    else
+        fun_l15_n88(x)
+    end
+end
+
+def fun_l14_n889(x)
+    if (x < 1)
+        fun_l15_n220(x)
+    else
+        fun_l15_n282(x)
+    end
+end
+
+def fun_l14_n890(x)
+    if (x < 1)
+        fun_l15_n702(x)
+    else
+        fun_l15_n550(x)
+    end
+end
+
+def fun_l14_n891(x)
+    if (x < 1)
+        fun_l15_n67(x)
+    else
+        fun_l15_n763(x)
+    end
+end
+
+def fun_l14_n892(x)
+    if (x < 1)
+        fun_l15_n386(x)
+    else
+        fun_l15_n938(x)
+    end
+end
+
+def fun_l14_n893(x)
+    if (x < 1)
+        fun_l15_n193(x)
+    else
+        fun_l15_n110(x)
+    end
+end
+
+def fun_l14_n894(x)
+    if (x < 1)
+        fun_l15_n408(x)
+    else
+        fun_l15_n392(x)
+    end
+end
+
+def fun_l14_n895(x)
+    if (x < 1)
+        fun_l15_n488(x)
+    else
+        fun_l15_n445(x)
+    end
+end
+
+def fun_l14_n896(x)
+    if (x < 1)
+        fun_l15_n572(x)
+    else
+        fun_l15_n645(x)
+    end
+end
+
+def fun_l14_n897(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n288(x)
+    end
+end
+
+def fun_l14_n898(x)
+    if (x < 1)
+        fun_l15_n466(x)
+    else
+        fun_l15_n877(x)
+    end
+end
+
+def fun_l14_n899(x)
+    if (x < 1)
+        fun_l15_n981(x)
+    else
+        fun_l15_n546(x)
+    end
+end
+
+def fun_l14_n900(x)
+    if (x < 1)
+        fun_l15_n334(x)
+    else
+        fun_l15_n198(x)
+    end
+end
+
+def fun_l14_n901(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n902(x)
+    if (x < 1)
+        fun_l15_n818(x)
+    else
+        fun_l15_n882(x)
+    end
+end
+
+def fun_l14_n903(x)
+    if (x < 1)
+        fun_l15_n86(x)
+    else
+        fun_l15_n864(x)
+    end
+end
+
+def fun_l14_n904(x)
+    if (x < 1)
+        fun_l15_n981(x)
+    else
+        fun_l15_n472(x)
+    end
+end
+
+def fun_l14_n905(x)
+    if (x < 1)
+        fun_l15_n684(x)
+    else
+        fun_l15_n314(x)
+    end
+end
+
+def fun_l14_n906(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n270(x)
+    end
+end
+
+def fun_l14_n907(x)
+    if (x < 1)
+        fun_l15_n958(x)
+    else
+        fun_l15_n293(x)
+    end
+end
+
+def fun_l14_n908(x)
+    if (x < 1)
+        fun_l15_n953(x)
+    else
+        fun_l15_n837(x)
+    end
+end
+
+def fun_l14_n909(x)
+    if (x < 1)
+        fun_l15_n448(x)
+    else
+        fun_l15_n985(x)
+    end
+end
+
+def fun_l14_n910(x)
+    if (x < 1)
+        fun_l15_n148(x)
+    else
+        fun_l15_n210(x)
+    end
+end
+
+def fun_l14_n911(x)
+    if (x < 1)
+        fun_l15_n51(x)
+    else
+        fun_l15_n714(x)
+    end
+end
+
+def fun_l14_n912(x)
+    if (x < 1)
+        fun_l15_n538(x)
+    else
+        fun_l15_n653(x)
+    end
+end
+
+def fun_l14_n913(x)
+    if (x < 1)
+        fun_l15_n374(x)
+    else
+        fun_l15_n836(x)
+    end
+end
+
+def fun_l14_n914(x)
+    if (x < 1)
+        fun_l15_n5(x)
+    else
+        fun_l15_n307(x)
+    end
+end
+
+def fun_l14_n915(x)
+    if (x < 1)
+        fun_l15_n670(x)
+    else
+        fun_l15_n961(x)
+    end
+end
+
+def fun_l14_n916(x)
+    if (x < 1)
+        fun_l15_n600(x)
+    else
+        fun_l15_n843(x)
+    end
+end
+
+def fun_l14_n917(x)
+    if (x < 1)
+        fun_l15_n235(x)
+    else
+        fun_l15_n542(x)
+    end
+end
+
+def fun_l14_n918(x)
+    if (x < 1)
+        fun_l15_n883(x)
+    else
+        fun_l15_n990(x)
+    end
+end
+
+def fun_l14_n919(x)
+    if (x < 1)
+        fun_l15_n988(x)
+    else
+        fun_l15_n678(x)
+    end
+end
+
+def fun_l14_n920(x)
+    if (x < 1)
+        fun_l15_n246(x)
+    else
+        fun_l15_n942(x)
+    end
+end
+
+def fun_l14_n921(x)
+    if (x < 1)
+        fun_l15_n316(x)
+    else
+        fun_l15_n503(x)
+    end
+end
+
+def fun_l14_n922(x)
+    if (x < 1)
+        fun_l15_n392(x)
+    else
+        fun_l15_n948(x)
+    end
+end
+
+def fun_l14_n923(x)
+    if (x < 1)
+        fun_l15_n79(x)
+    else
+        fun_l15_n375(x)
+    end
+end
+
+def fun_l14_n924(x)
+    if (x < 1)
+        fun_l15_n139(x)
+    else
+        fun_l15_n350(x)
+    end
+end
+
+def fun_l14_n925(x)
+    if (x < 1)
+        fun_l15_n132(x)
+    else
+        fun_l15_n27(x)
+    end
+end
+
+def fun_l14_n926(x)
+    if (x < 1)
+        fun_l15_n608(x)
+    else
+        fun_l15_n910(x)
+    end
+end
+
+def fun_l14_n927(x)
+    if (x < 1)
+        fun_l15_n447(x)
+    else
+        fun_l15_n361(x)
+    end
+end
+
+def fun_l14_n928(x)
+    if (x < 1)
+        fun_l15_n432(x)
+    else
+        fun_l15_n943(x)
+    end
+end
+
+def fun_l14_n929(x)
+    if (x < 1)
+        fun_l15_n726(x)
+    else
+        fun_l15_n19(x)
+    end
+end
+
+def fun_l14_n930(x)
+    if (x < 1)
+        fun_l15_n311(x)
+    else
+        fun_l15_n683(x)
+    end
+end
+
+def fun_l14_n931(x)
+    if (x < 1)
+        fun_l15_n988(x)
+    else
+        fun_l15_n731(x)
+    end
+end
+
+def fun_l14_n932(x)
+    if (x < 1)
+        fun_l15_n916(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n933(x)
+    if (x < 1)
+        fun_l15_n723(x)
+    else
+        fun_l15_n954(x)
+    end
+end
+
+def fun_l14_n934(x)
+    if (x < 1)
+        fun_l15_n82(x)
+    else
+        fun_l15_n140(x)
+    end
+end
+
+def fun_l14_n935(x)
+    if (x < 1)
+        fun_l15_n11(x)
+    else
+        fun_l15_n407(x)
+    end
+end
+
+def fun_l14_n936(x)
+    if (x < 1)
+        fun_l15_n261(x)
+    else
+        fun_l15_n733(x)
+    end
+end
+
+def fun_l14_n937(x)
+    if (x < 1)
+        fun_l15_n37(x)
+    else
+        fun_l15_n617(x)
+    end
+end
+
+def fun_l14_n938(x)
+    if (x < 1)
+        fun_l15_n733(x)
+    else
+        fun_l15_n178(x)
+    end
+end
+
+def fun_l14_n939(x)
+    if (x < 1)
+        fun_l15_n989(x)
+    else
+        fun_l15_n917(x)
+    end
+end
+
+def fun_l14_n940(x)
+    if (x < 1)
+        fun_l15_n297(x)
+    else
+        fun_l15_n393(x)
+    end
+end
+
+def fun_l14_n941(x)
+    if (x < 1)
+        fun_l15_n167(x)
+    else
+        fun_l15_n498(x)
+    end
+end
+
+def fun_l14_n942(x)
+    if (x < 1)
+        fun_l15_n365(x)
+    else
+        fun_l15_n158(x)
+    end
+end
+
+def fun_l14_n943(x)
+    if (x < 1)
+        fun_l15_n340(x)
+    else
+        fun_l15_n813(x)
+    end
+end
+
+def fun_l14_n944(x)
+    if (x < 1)
+        fun_l15_n417(x)
+    else
+        fun_l15_n150(x)
+    end
+end
+
+def fun_l14_n945(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n639(x)
+    end
+end
+
+def fun_l14_n946(x)
+    if (x < 1)
+        fun_l15_n243(x)
+    else
+        fun_l15_n439(x)
+    end
+end
+
+def fun_l14_n947(x)
+    if (x < 1)
+        fun_l15_n149(x)
+    else
+        fun_l15_n881(x)
+    end
+end
+
+def fun_l14_n948(x)
+    if (x < 1)
+        fun_l15_n383(x)
+    else
+        fun_l15_n525(x)
+    end
+end
+
+def fun_l14_n949(x)
+    if (x < 1)
+        fun_l15_n482(x)
+    else
+        fun_l15_n625(x)
+    end
+end
+
+def fun_l14_n950(x)
+    if (x < 1)
+        fun_l15_n376(x)
+    else
+        fun_l15_n743(x)
+    end
+end
+
+def fun_l14_n951(x)
+    if (x < 1)
+        fun_l15_n53(x)
+    else
+        fun_l15_n734(x)
+    end
+end
+
+def fun_l14_n952(x)
+    if (x < 1)
+        fun_l15_n437(x)
+    else
+        fun_l15_n829(x)
+    end
+end
+
+def fun_l14_n953(x)
+    if (x < 1)
+        fun_l15_n673(x)
+    else
+        fun_l15_n540(x)
+    end
+end
+
+def fun_l14_n954(x)
+    if (x < 1)
+        fun_l15_n477(x)
+    else
+        fun_l15_n488(x)
+    end
+end
+
+def fun_l14_n955(x)
+    if (x < 1)
+        fun_l15_n876(x)
+    else
+        fun_l15_n710(x)
+    end
+end
+
+def fun_l14_n956(x)
+    if (x < 1)
+        fun_l15_n823(x)
+    else
+        fun_l15_n841(x)
+    end
+end
+
+def fun_l14_n957(x)
+    if (x < 1)
+        fun_l15_n948(x)
+    else
+        fun_l15_n378(x)
+    end
+end
+
+def fun_l14_n958(x)
+    if (x < 1)
+        fun_l15_n941(x)
+    else
+        fun_l15_n555(x)
+    end
+end
+
+def fun_l14_n959(x)
+    if (x < 1)
+        fun_l15_n204(x)
+    else
+        fun_l15_n792(x)
+    end
+end
+
+def fun_l14_n960(x)
+    if (x < 1)
+        fun_l15_n897(x)
+    else
+        fun_l15_n287(x)
+    end
+end
+
+def fun_l14_n961(x)
+    if (x < 1)
+        fun_l15_n771(x)
+    else
+        fun_l15_n409(x)
+    end
+end
+
+def fun_l14_n962(x)
+    if (x < 1)
+        fun_l15_n597(x)
+    else
+        fun_l15_n190(x)
+    end
+end
+
+def fun_l14_n963(x)
+    if (x < 1)
+        fun_l15_n573(x)
+    else
+        fun_l15_n982(x)
+    end
+end
+
+def fun_l14_n964(x)
+    if (x < 1)
+        fun_l15_n186(x)
+    else
+        fun_l15_n363(x)
+    end
+end
+
+def fun_l14_n965(x)
+    if (x < 1)
+        fun_l15_n694(x)
+    else
+        fun_l15_n319(x)
+    end
+end
+
+def fun_l14_n966(x)
+    if (x < 1)
+        fun_l15_n312(x)
+    else
+        fun_l15_n332(x)
+    end
+end
+
+def fun_l14_n967(x)
+    if (x < 1)
+        fun_l15_n754(x)
+    else
+        fun_l15_n965(x)
+    end
+end
+
+def fun_l14_n968(x)
+    if (x < 1)
+        fun_l15_n18(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n969(x)
+    if (x < 1)
+        fun_l15_n111(x)
+    else
+        fun_l15_n447(x)
+    end
+end
+
+def fun_l14_n970(x)
+    if (x < 1)
+        fun_l15_n3(x)
+    else
+        fun_l15_n302(x)
+    end
+end
+
+def fun_l14_n971(x)
+    if (x < 1)
+        fun_l15_n121(x)
+    else
+        fun_l15_n764(x)
+    end
+end
+
+def fun_l14_n972(x)
+    if (x < 1)
+        fun_l15_n192(x)
+    else
+        fun_l15_n692(x)
+    end
+end
+
+def fun_l14_n973(x)
+    if (x < 1)
+        fun_l15_n596(x)
+    else
+        fun_l15_n514(x)
+    end
+end
+
+def fun_l14_n974(x)
+    if (x < 1)
+        fun_l15_n845(x)
+    else
+        fun_l15_n245(x)
+    end
+end
+
+def fun_l14_n975(x)
+    if (x < 1)
+        fun_l15_n566(x)
+    else
+        fun_l15_n58(x)
+    end
+end
+
+def fun_l14_n976(x)
+    if (x < 1)
+        fun_l15_n843(x)
+    else
+        fun_l15_n35(x)
+    end
+end
+
+def fun_l14_n977(x)
+    if (x < 1)
+        fun_l15_n995(x)
+    else
+        fun_l15_n723(x)
+    end
+end
+
+def fun_l14_n978(x)
+    if (x < 1)
+        fun_l15_n534(x)
+    else
+        fun_l15_n704(x)
+    end
+end
+
+def fun_l14_n979(x)
+    if (x < 1)
+        fun_l15_n533(x)
+    else
+        fun_l15_n492(x)
+    end
+end
+
+def fun_l14_n980(x)
+    if (x < 1)
+        fun_l15_n758(x)
+    else
+        fun_l15_n655(x)
+    end
+end
+
+def fun_l14_n981(x)
+    if (x < 1)
+        fun_l15_n94(x)
+    else
+        fun_l15_n246(x)
+    end
+end
+
+def fun_l14_n982(x)
+    if (x < 1)
+        fun_l15_n873(x)
+    else
+        fun_l15_n996(x)
+    end
+end
+
+def fun_l14_n983(x)
+    if (x < 1)
+        fun_l15_n681(x)
+    else
+        fun_l15_n522(x)
+    end
+end
+
+def fun_l14_n984(x)
+    if (x < 1)
+        fun_l15_n272(x)
+    else
+        fun_l15_n501(x)
+    end
+end
+
+def fun_l14_n985(x)
+    if (x < 1)
+        fun_l15_n345(x)
+    else
+        fun_l15_n61(x)
+    end
+end
+
+def fun_l14_n986(x)
+    if (x < 1)
+        fun_l15_n517(x)
+    else
+        fun_l15_n151(x)
+    end
+end
+
+def fun_l14_n987(x)
+    if (x < 1)
+        fun_l15_n792(x)
+    else
+        fun_l15_n969(x)
+    end
+end
+
+def fun_l14_n988(x)
+    if (x < 1)
+        fun_l15_n683(x)
+    else
+        fun_l15_n537(x)
+    end
+end
+
+def fun_l14_n989(x)
+    if (x < 1)
+        fun_l15_n310(x)
+    else
+        fun_l15_n367(x)
+    end
+end
+
+def fun_l14_n990(x)
+    if (x < 1)
+        fun_l15_n249(x)
+    else
+        fun_l15_n897(x)
+    end
+end
+
+def fun_l14_n991(x)
+    if (x < 1)
+        fun_l15_n389(x)
+    else
+        fun_l15_n176(x)
+    end
+end
+
+def fun_l14_n992(x)
+    if (x < 1)
+        fun_l15_n233(x)
+    else
+        fun_l15_n220(x)
+    end
+end
+
+def fun_l14_n993(x)
+    if (x < 1)
+        fun_l15_n161(x)
+    else
+        fun_l15_n642(x)
+    end
+end
+
+def fun_l14_n994(x)
+    if (x < 1)
+        fun_l15_n163(x)
+    else
+        fun_l15_n5(x)
+    end
+end
+
+def fun_l14_n995(x)
+    if (x < 1)
+        fun_l15_n678(x)
+    else
+        fun_l15_n108(x)
+    end
+end
+
+def fun_l14_n996(x)
+    if (x < 1)
+        fun_l15_n732(x)
+    else
+        fun_l15_n26(x)
+    end
+end
+
+def fun_l14_n997(x)
+    if (x < 1)
+        fun_l15_n805(x)
+    else
+        fun_l15_n726(x)
+    end
+end
+
+def fun_l14_n998(x)
+    if (x < 1)
+        fun_l15_n543(x)
+    else
+        fun_l15_n102(x)
+    end
+end
+
+def fun_l14_n999(x)
+    if (x < 1)
+        fun_l15_n358(x)
+    else
+        fun_l15_n986(x)
+    end
+end
+
+def fun_l15_n0(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n1(x)
+    if (x < 1)
+        fun_l16_n920(x)
+    else
+        fun_l16_n27(x)
+    end
+end
+
+def fun_l15_n2(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n230(x)
+    end
+end
+
+def fun_l15_n3(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n427(x)
+    end
+end
+
+def fun_l15_n4(x)
+    if (x < 1)
+        fun_l16_n299(x)
+    else
+        fun_l16_n811(x)
+    end
+end
+
+def fun_l15_n5(x)
+    if (x < 1)
+        fun_l16_n821(x)
+    else
+        fun_l16_n717(x)
+    end
+end
+
+def fun_l15_n6(x)
+    if (x < 1)
+        fun_l16_n907(x)
+    else
+        fun_l16_n348(x)
+    end
+end
+
+def fun_l15_n7(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n8(x)
+    if (x < 1)
+        fun_l16_n835(x)
+    else
+        fun_l16_n754(x)
+    end
+end
+
+def fun_l15_n9(x)
+    if (x < 1)
+        fun_l16_n25(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n10(x)
+    if (x < 1)
+        fun_l16_n73(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n11(x)
+    if (x < 1)
+        fun_l16_n413(x)
+    else
+        fun_l16_n914(x)
+    end
+end
+
+def fun_l15_n12(x)
+    if (x < 1)
+        fun_l16_n734(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n13(x)
+    if (x < 1)
+        fun_l16_n658(x)
+    else
+        fun_l16_n491(x)
+    end
+end
+
+def fun_l15_n14(x)
+    if (x < 1)
+        fun_l16_n839(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n15(x)
+    if (x < 1)
+        fun_l16_n378(x)
+    else
+        fun_l16_n800(x)
+    end
+end
+
+def fun_l15_n16(x)
+    if (x < 1)
+        fun_l16_n980(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n17(x)
+    if (x < 1)
+        fun_l16_n338(x)
+    else
+        fun_l16_n871(x)
+    end
+end
+
+def fun_l15_n18(x)
+    if (x < 1)
+        fun_l16_n497(x)
+    else
+        fun_l16_n347(x)
+    end
+end
+
+def fun_l15_n19(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n913(x)
+    end
+end
+
+def fun_l15_n20(x)
+    if (x < 1)
+        fun_l16_n663(x)
+    else
+        fun_l16_n432(x)
+    end
+end
+
+def fun_l15_n21(x)
+    if (x < 1)
+        fun_l16_n787(x)
+    else
+        fun_l16_n248(x)
+    end
+end
+
+def fun_l15_n22(x)
+    if (x < 1)
+        fun_l16_n257(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n23(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n343(x)
+    end
+end
+
+def fun_l15_n24(x)
+    if (x < 1)
+        fun_l16_n860(x)
+    else
+        fun_l16_n752(x)
+    end
+end
+
+def fun_l15_n25(x)
+    if (x < 1)
+        fun_l16_n766(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n26(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n27(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n916(x)
+    end
+end
+
+def fun_l15_n28(x)
+    if (x < 1)
+        fun_l16_n429(x)
+    else
+        fun_l16_n272(x)
+    end
+end
+
+def fun_l15_n29(x)
+    if (x < 1)
+        fun_l16_n54(x)
+    else
+        fun_l16_n794(x)
+    end
+end
+
+def fun_l15_n30(x)
+    if (x < 1)
+        fun_l16_n273(x)
+    else
+        fun_l16_n929(x)
+    end
+end
+
+def fun_l15_n31(x)
+    if (x < 1)
+        fun_l16_n868(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n32(x)
+    if (x < 1)
+        fun_l16_n888(x)
+    else
+        fun_l16_n283(x)
+    end
+end
+
+def fun_l15_n33(x)
+    if (x < 1)
+        fun_l16_n6(x)
+    else
+        fun_l16_n677(x)
+    end
+end
+
+def fun_l15_n34(x)
+    if (x < 1)
+        fun_l16_n248(x)
+    else
+        fun_l16_n831(x)
+    end
+end
+
+def fun_l15_n35(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n634(x)
+    end
+end
+
+def fun_l15_n36(x)
+    if (x < 1)
+        fun_l16_n221(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n37(x)
+    if (x < 1)
+        fun_l16_n403(x)
+    else
+        fun_l16_n29(x)
+    end
+end
+
+def fun_l15_n38(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n517(x)
+    end
+end
+
+def fun_l15_n39(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n40(x)
+    if (x < 1)
+        fun_l16_n185(x)
+    else
+        fun_l16_n818(x)
+    end
+end
+
+def fun_l15_n41(x)
+    if (x < 1)
+        fun_l16_n169(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n42(x)
+    if (x < 1)
+        fun_l16_n111(x)
+    else
+        fun_l16_n836(x)
+    end
+end
+
+def fun_l15_n43(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n44(x)
+    if (x < 1)
+        fun_l16_n167(x)
+    else
+        fun_l16_n65(x)
+    end
+end
+
+def fun_l15_n45(x)
+    if (x < 1)
+        fun_l16_n801(x)
+    else
+        fun_l16_n456(x)
+    end
+end
+
+def fun_l15_n46(x)
+    if (x < 1)
+        fun_l16_n894(x)
+    else
+        fun_l16_n103(x)
+    end
+end
+
+def fun_l15_n47(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n228(x)
+    end
+end
+
+def fun_l15_n48(x)
+    if (x < 1)
+        fun_l16_n167(x)
+    else
+        fun_l16_n317(x)
+    end
+end
+
+def fun_l15_n49(x)
+    if (x < 1)
+        fun_l16_n864(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n50(x)
+    if (x < 1)
+        fun_l16_n11(x)
+    else
+        fun_l16_n498(x)
+    end
+end
+
+def fun_l15_n51(x)
+    if (x < 1)
+        fun_l16_n209(x)
+    else
+        fun_l16_n399(x)
+    end
+end
+
+def fun_l15_n52(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n912(x)
+    end
+end
+
+def fun_l15_n53(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n349(x)
+    end
+end
+
+def fun_l15_n54(x)
+    if (x < 1)
+        fun_l16_n410(x)
+    else
+        fun_l16_n849(x)
+    end
+end
+
+def fun_l15_n55(x)
+    if (x < 1)
+        fun_l16_n989(x)
+    else
+        fun_l16_n700(x)
+    end
+end
+
+def fun_l15_n56(x)
+    if (x < 1)
+        fun_l16_n79(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n57(x)
+    if (x < 1)
+        fun_l16_n396(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n58(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n225(x)
+    end
+end
+
+def fun_l15_n59(x)
+    if (x < 1)
+        fun_l16_n124(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n60(x)
+    if (x < 1)
+        fun_l16_n813(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n61(x)
+    if (x < 1)
+        fun_l16_n568(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n62(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n63(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n136(x)
+    end
+end
+
+def fun_l15_n64(x)
+    if (x < 1)
+        fun_l16_n620(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n65(x)
+    if (x < 1)
+        fun_l16_n130(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n66(x)
+    if (x < 1)
+        fun_l16_n774(x)
+    else
+        fun_l16_n109(x)
+    end
+end
+
+def fun_l15_n67(x)
+    if (x < 1)
+        fun_l16_n817(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n68(x)
+    if (x < 1)
+        fun_l16_n123(x)
+    else
+        fun_l16_n482(x)
+    end
+end
+
+def fun_l15_n69(x)
+    if (x < 1)
+        fun_l16_n173(x)
+    else
+        fun_l16_n22(x)
+    end
+end
+
+def fun_l15_n70(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n671(x)
+    end
+end
+
+def fun_l15_n71(x)
+    if (x < 1)
+        fun_l16_n831(x)
+    else
+        fun_l16_n126(x)
+    end
+end
+
+def fun_l15_n72(x)
+    if (x < 1)
+        fun_l16_n731(x)
+    else
+        fun_l16_n273(x)
+    end
+end
+
+def fun_l15_n73(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n772(x)
+    end
+end
+
+def fun_l15_n74(x)
+    if (x < 1)
+        fun_l16_n831(x)
+    else
+        fun_l16_n49(x)
+    end
+end
+
+def fun_l15_n75(x)
+    if (x < 1)
+        fun_l16_n501(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n76(x)
+    if (x < 1)
+        fun_l16_n712(x)
+    else
+        fun_l16_n762(x)
+    end
+end
+
+def fun_l15_n77(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n398(x)
+    end
+end
+
+def fun_l15_n78(x)
+    if (x < 1)
+        fun_l16_n811(x)
+    else
+        fun_l16_n866(x)
+    end
+end
+
+def fun_l15_n79(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n502(x)
+    end
+end
+
+def fun_l15_n80(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n116(x)
+    end
+end
+
+def fun_l15_n81(x)
+    if (x < 1)
+        fun_l16_n30(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n82(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n526(x)
+    end
+end
+
+def fun_l15_n83(x)
+    if (x < 1)
+        fun_l16_n760(x)
+    else
+        fun_l16_n206(x)
+    end
+end
+
+def fun_l15_n84(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n85(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n222(x)
+    end
+end
+
+def fun_l15_n86(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n885(x)
+    end
+end
+
+def fun_l15_n87(x)
+    if (x < 1)
+        fun_l16_n2(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n88(x)
+    if (x < 1)
+        fun_l16_n272(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n89(x)
+    if (x < 1)
+        fun_l16_n31(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n90(x)
+    if (x < 1)
+        fun_l16_n264(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n91(x)
+    if (x < 1)
+        fun_l16_n637(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n92(x)
+    if (x < 1)
+        fun_l16_n317(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n93(x)
+    if (x < 1)
+        fun_l16_n523(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n94(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n95(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n96(x)
+    if (x < 1)
+        fun_l16_n725(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n97(x)
+    if (x < 1)
+        fun_l16_n432(x)
+    else
+        fun_l16_n367(x)
+    end
+end
+
+def fun_l15_n98(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n165(x)
+    end
+end
+
+def fun_l15_n99(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n498(x)
+    end
+end
+
+def fun_l15_n100(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n103(x)
+    end
+end
+
+def fun_l15_n101(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n556(x)
+    end
+end
+
+def fun_l15_n102(x)
+    if (x < 1)
+        fun_l16_n0(x)
+    else
+        fun_l16_n925(x)
+    end
+end
+
+def fun_l15_n103(x)
+    if (x < 1)
+        fun_l16_n484(x)
+    else
+        fun_l16_n889(x)
+    end
+end
+
+def fun_l15_n104(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n105(x)
+    if (x < 1)
+        fun_l16_n486(x)
+    else
+        fun_l16_n720(x)
+    end
+end
+
+def fun_l15_n106(x)
+    if (x < 1)
+        fun_l16_n281(x)
+    else
+        fun_l16_n61(x)
+    end
+end
+
+def fun_l15_n107(x)
+    if (x < 1)
+        fun_l16_n861(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n108(x)
+    if (x < 1)
+        fun_l16_n739(x)
+    else
+        fun_l16_n192(x)
+    end
+end
+
+def fun_l15_n109(x)
+    if (x < 1)
+        fun_l16_n327(x)
+    else
+        fun_l16_n423(x)
+    end
+end
+
+def fun_l15_n110(x)
+    if (x < 1)
+        fun_l16_n541(x)
+    else
+        fun_l16_n927(x)
+    end
+end
+
+def fun_l15_n111(x)
+    if (x < 1)
+        fun_l16_n86(x)
+    else
+        fun_l16_n170(x)
+    end
+end
+
+def fun_l15_n112(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n554(x)
+    end
+end
+
+def fun_l15_n113(x)
+    if (x < 1)
+        fun_l16_n326(x)
+    else
+        fun_l16_n289(x)
+    end
+end
+
+def fun_l15_n114(x)
+    if (x < 1)
+        fun_l16_n309(x)
+    else
+        fun_l16_n125(x)
+    end
+end
+
+def fun_l15_n115(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n64(x)
+    end
+end
+
+def fun_l15_n116(x)
+    if (x < 1)
+        fun_l16_n942(x)
+    else
+        fun_l16_n737(x)
+    end
+end
+
+def fun_l15_n117(x)
+    if (x < 1)
+        fun_l16_n717(x)
+    else
+        fun_l16_n701(x)
+    end
+end
+
+def fun_l15_n118(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n119(x)
+    if (x < 1)
+        fun_l16_n49(x)
+    else
+        fun_l16_n610(x)
+    end
+end
+
+def fun_l15_n120(x)
+    if (x < 1)
+        fun_l16_n578(x)
+    else
+        fun_l16_n372(x)
+    end
+end
+
+def fun_l15_n121(x)
+    if (x < 1)
+        fun_l16_n262(x)
+    else
+        fun_l16_n441(x)
+    end
+end
+
+def fun_l15_n122(x)
+    if (x < 1)
+        fun_l16_n29(x)
+    else
+        fun_l16_n837(x)
+    end
+end
+
+def fun_l15_n123(x)
+    if (x < 1)
+        fun_l16_n796(x)
+    else
+        fun_l16_n771(x)
+    end
+end
+
+def fun_l15_n124(x)
+    if (x < 1)
+        fun_l16_n354(x)
+    else
+        fun_l16_n818(x)
+    end
+end
+
+def fun_l15_n125(x)
+    if (x < 1)
+        fun_l16_n971(x)
+    else
+        fun_l16_n305(x)
+    end
+end
+
+def fun_l15_n126(x)
+    if (x < 1)
+        fun_l16_n435(x)
+    else
+        fun_l16_n307(x)
+    end
+end
+
+def fun_l15_n127(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n884(x)
+    end
+end
+
+def fun_l15_n128(x)
+    if (x < 1)
+        fun_l16_n794(x)
+    else
+        fun_l16_n480(x)
+    end
+end
+
+def fun_l15_n129(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n130(x)
+    if (x < 1)
+        fun_l16_n415(x)
+    else
+        fun_l16_n255(x)
+    end
+end
+
+def fun_l15_n131(x)
+    if (x < 1)
+        fun_l16_n736(x)
+    else
+        fun_l16_n904(x)
+    end
+end
+
+def fun_l15_n132(x)
+    if (x < 1)
+        fun_l16_n753(x)
+    else
+        fun_l16_n408(x)
+    end
+end
+
+def fun_l15_n133(x)
+    if (x < 1)
+        fun_l16_n61(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n134(x)
+    if (x < 1)
+        fun_l16_n541(x)
+    else
+        fun_l16_n93(x)
+    end
+end
+
+def fun_l15_n135(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n765(x)
+    end
+end
+
+def fun_l15_n136(x)
+    if (x < 1)
+        fun_l16_n749(x)
+    else
+        fun_l16_n344(x)
+    end
+end
+
+def fun_l15_n137(x)
+    if (x < 1)
+        fun_l16_n431(x)
+    else
+        fun_l16_n354(x)
+    end
+end
+
+def fun_l15_n138(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n139(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n380(x)
+    end
+end
+
+def fun_l15_n140(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n953(x)
+    end
+end
+
+def fun_l15_n141(x)
+    if (x < 1)
+        fun_l16_n287(x)
+    else
+        fun_l16_n154(x)
+    end
+end
+
+def fun_l15_n142(x)
+    if (x < 1)
+        fun_l16_n347(x)
+    else
+        fun_l16_n841(x)
+    end
+end
+
+def fun_l15_n143(x)
+    if (x < 1)
+        fun_l16_n562(x)
+    else
+        fun_l16_n674(x)
+    end
+end
+
+def fun_l15_n144(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n788(x)
+    end
+end
+
+def fun_l15_n145(x)
+    if (x < 1)
+        fun_l16_n463(x)
+    else
+        fun_l16_n590(x)
+    end
+end
+
+def fun_l15_n146(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n732(x)
+    end
+end
+
+def fun_l15_n147(x)
+    if (x < 1)
+        fun_l16_n840(x)
+    else
+        fun_l16_n254(x)
+    end
+end
+
+def fun_l15_n148(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n826(x)
+    end
+end
+
+def fun_l15_n149(x)
+    if (x < 1)
+        fun_l16_n40(x)
+    else
+        fun_l16_n267(x)
+    end
+end
+
+def fun_l15_n150(x)
+    if (x < 1)
+        fun_l16_n160(x)
+    else
+        fun_l16_n745(x)
+    end
+end
+
+def fun_l15_n151(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n567(x)
+    end
+end
+
+def fun_l15_n152(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n487(x)
+    end
+end
+
+def fun_l15_n153(x)
+    if (x < 1)
+        fun_l16_n603(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n154(x)
+    if (x < 1)
+        fun_l16_n993(x)
+    else
+        fun_l16_n451(x)
+    end
+end
+
+def fun_l15_n155(x)
+    if (x < 1)
+        fun_l16_n358(x)
+    else
+        fun_l16_n52(x)
+    end
+end
+
+def fun_l15_n156(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n419(x)
+    end
+end
+
+def fun_l15_n157(x)
+    if (x < 1)
+        fun_l16_n138(x)
+    else
+        fun_l16_n127(x)
+    end
+end
+
+def fun_l15_n158(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n159(x)
+    if (x < 1)
+        fun_l16_n281(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n160(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n69(x)
+    end
+end
+
+def fun_l15_n161(x)
+    if (x < 1)
+        fun_l16_n41(x)
+    else
+        fun_l16_n734(x)
+    end
+end
+
+def fun_l15_n162(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n163(x)
+    if (x < 1)
+        fun_l16_n851(x)
+    else
+        fun_l16_n420(x)
+    end
+end
+
+def fun_l15_n164(x)
+    if (x < 1)
+        fun_l16_n534(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n165(x)
+    if (x < 1)
+        fun_l16_n639(x)
+    else
+        fun_l16_n155(x)
+    end
+end
+
+def fun_l15_n166(x)
+    if (x < 1)
+        fun_l16_n196(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n167(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n506(x)
+    end
+end
+
+def fun_l15_n168(x)
+    if (x < 1)
+        fun_l16_n74(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n169(x)
+    if (x < 1)
+        fun_l16_n122(x)
+    else
+        fun_l16_n150(x)
+    end
+end
+
+def fun_l15_n170(x)
+    if (x < 1)
+        fun_l16_n805(x)
+    else
+        fun_l16_n46(x)
+    end
+end
+
+def fun_l15_n171(x)
+    if (x < 1)
+        fun_l16_n741(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n172(x)
+    if (x < 1)
+        fun_l16_n749(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n173(x)
+    if (x < 1)
+        fun_l16_n310(x)
+    else
+        fun_l16_n517(x)
+    end
+end
+
+def fun_l15_n174(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n948(x)
+    end
+end
+
+def fun_l15_n175(x)
+    if (x < 1)
+        fun_l16_n402(x)
+    else
+        fun_l16_n332(x)
+    end
+end
+
+def fun_l15_n176(x)
+    if (x < 1)
+        fun_l16_n189(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n177(x)
+    if (x < 1)
+        fun_l16_n1(x)
+    else
+        fun_l16_n577(x)
+    end
+end
+
+def fun_l15_n178(x)
+    if (x < 1)
+        fun_l16_n738(x)
+    else
+        fun_l16_n775(x)
+    end
+end
+
+def fun_l15_n179(x)
+    if (x < 1)
+        fun_l16_n80(x)
+    else
+        fun_l16_n652(x)
+    end
+end
+
+def fun_l15_n180(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n181(x)
+    if (x < 1)
+        fun_l16_n721(x)
+    else
+        fun_l16_n661(x)
+    end
+end
+
+def fun_l15_n182(x)
+    if (x < 1)
+        fun_l16_n354(x)
+    else
+        fun_l16_n681(x)
+    end
+end
+
+def fun_l15_n183(x)
+    if (x < 1)
+        fun_l16_n689(x)
+    else
+        fun_l16_n775(x)
+    end
+end
+
+def fun_l15_n184(x)
+    if (x < 1)
+        fun_l16_n923(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n185(x)
+    if (x < 1)
+        fun_l16_n33(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n186(x)
+    if (x < 1)
+        fun_l16_n155(x)
+    else
+        fun_l16_n880(x)
+    end
+end
+
+def fun_l15_n187(x)
+    if (x < 1)
+        fun_l16_n625(x)
+    else
+        fun_l16_n314(x)
+    end
+end
+
+def fun_l15_n188(x)
+    if (x < 1)
+        fun_l16_n284(x)
+    else
+        fun_l16_n229(x)
+    end
+end
+
+def fun_l15_n189(x)
+    if (x < 1)
+        fun_l16_n471(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n190(x)
+    if (x < 1)
+        fun_l16_n102(x)
+    else
+        fun_l16_n766(x)
+    end
+end
+
+def fun_l15_n191(x)
+    if (x < 1)
+        fun_l16_n812(x)
+    else
+        fun_l16_n94(x)
+    end
+end
+
+def fun_l15_n192(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n736(x)
+    end
+end
+
+def fun_l15_n193(x)
+    if (x < 1)
+        fun_l16_n976(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n194(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n612(x)
+    end
+end
+
+def fun_l15_n195(x)
+    if (x < 1)
+        fun_l16_n510(x)
+    else
+        fun_l16_n237(x)
+    end
+end
+
+def fun_l15_n196(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n624(x)
+    end
+end
+
+def fun_l15_n197(x)
+    if (x < 1)
+        fun_l16_n515(x)
+    else
+        fun_l16_n979(x)
+    end
+end
+
+def fun_l15_n198(x)
+    if (x < 1)
+        fun_l16_n700(x)
+    else
+        fun_l16_n284(x)
+    end
+end
+
+def fun_l15_n199(x)
+    if (x < 1)
+        fun_l16_n226(x)
+    else
+        fun_l16_n32(x)
+    end
+end
+
+def fun_l15_n200(x)
+    if (x < 1)
+        fun_l16_n453(x)
+    else
+        fun_l16_n959(x)
+    end
+end
+
+def fun_l15_n201(x)
+    if (x < 1)
+        fun_l16_n132(x)
+    else
+        fun_l16_n323(x)
+    end
+end
+
+def fun_l15_n202(x)
+    if (x < 1)
+        fun_l16_n539(x)
+    else
+        fun_l16_n670(x)
+    end
+end
+
+def fun_l15_n203(x)
+    if (x < 1)
+        fun_l16_n786(x)
+    else
+        fun_l16_n633(x)
+    end
+end
+
+def fun_l15_n204(x)
+    if (x < 1)
+        fun_l16_n498(x)
+    else
+        fun_l16_n520(x)
+    end
+end
+
+def fun_l15_n205(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n573(x)
+    end
+end
+
+def fun_l15_n206(x)
+    if (x < 1)
+        fun_l16_n746(x)
+    else
+        fun_l16_n562(x)
+    end
+end
+
+def fun_l15_n207(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n951(x)
+    end
+end
+
+def fun_l15_n208(x)
+    if (x < 1)
+        fun_l16_n331(x)
+    else
+        fun_l16_n596(x)
+    end
+end
+
+def fun_l15_n209(x)
+    if (x < 1)
+        fun_l16_n1(x)
+    else
+        fun_l16_n69(x)
+    end
+end
+
+def fun_l15_n210(x)
+    if (x < 1)
+        fun_l16_n19(x)
+    else
+        fun_l16_n148(x)
+    end
+end
+
+def fun_l15_n211(x)
+    if (x < 1)
+        fun_l16_n770(x)
+    else
+        fun_l16_n216(x)
+    end
+end
+
+def fun_l15_n212(x)
+    if (x < 1)
+        fun_l16_n863(x)
+    else
+        fun_l16_n319(x)
+    end
+end
+
+def fun_l15_n213(x)
+    if (x < 1)
+        fun_l16_n675(x)
+    else
+        fun_l16_n797(x)
+    end
+end
+
+def fun_l15_n214(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n593(x)
+    end
+end
+
+def fun_l15_n215(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n232(x)
+    end
+end
+
+def fun_l15_n216(x)
+    if (x < 1)
+        fun_l16_n549(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n217(x)
+    if (x < 1)
+        fun_l16_n784(x)
+    else
+        fun_l16_n8(x)
+    end
+end
+
+def fun_l15_n218(x)
+    if (x < 1)
+        fun_l16_n296(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n219(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n628(x)
+    end
+end
+
+def fun_l15_n220(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n294(x)
+    end
+end
+
+def fun_l15_n221(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n771(x)
+    end
+end
+
+def fun_l15_n222(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n476(x)
+    end
+end
+
+def fun_l15_n223(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n850(x)
+    end
+end
+
+def fun_l15_n224(x)
+    if (x < 1)
+        fun_l16_n489(x)
+    else
+        fun_l16_n234(x)
+    end
+end
+
+def fun_l15_n225(x)
+    if (x < 1)
+        fun_l16_n478(x)
+    else
+        fun_l16_n744(x)
+    end
+end
+
+def fun_l15_n226(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n323(x)
+    end
+end
+
+def fun_l15_n227(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n228(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n320(x)
+    end
+end
+
+def fun_l15_n229(x)
+    if (x < 1)
+        fun_l16_n184(x)
+    else
+        fun_l16_n129(x)
+    end
+end
+
+def fun_l15_n230(x)
+    if (x < 1)
+        fun_l16_n563(x)
+    else
+        fun_l16_n581(x)
+    end
+end
+
+def fun_l15_n231(x)
+    if (x < 1)
+        fun_l16_n585(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n232(x)
+    if (x < 1)
+        fun_l16_n895(x)
+    else
+        fun_l16_n622(x)
+    end
+end
+
+def fun_l15_n233(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n95(x)
+    end
+end
+
+def fun_l15_n234(x)
+    if (x < 1)
+        fun_l16_n770(x)
+    else
+        fun_l16_n557(x)
+    end
+end
+
+def fun_l15_n235(x)
+    if (x < 1)
+        fun_l16_n418(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n236(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n237(x)
+    if (x < 1)
+        fun_l16_n677(x)
+    else
+        fun_l16_n108(x)
+    end
+end
+
+def fun_l15_n238(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n288(x)
+    end
+end
+
+def fun_l15_n239(x)
+    if (x < 1)
+        fun_l16_n467(x)
+    else
+        fun_l16_n661(x)
+    end
+end
+
+def fun_l15_n240(x)
+    if (x < 1)
+        fun_l16_n267(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n241(x)
+    if (x < 1)
+        fun_l16_n655(x)
+    else
+        fun_l16_n990(x)
+    end
+end
+
+def fun_l15_n242(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n390(x)
+    end
+end
+
+def fun_l15_n243(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n244(x)
+    if (x < 1)
+        fun_l16_n490(x)
+    else
+        fun_l16_n627(x)
+    end
+end
+
+def fun_l15_n245(x)
+    if (x < 1)
+        fun_l16_n293(x)
+    else
+        fun_l16_n569(x)
+    end
+end
+
+def fun_l15_n246(x)
+    if (x < 1)
+        fun_l16_n818(x)
+    else
+        fun_l16_n74(x)
+    end
+end
+
+def fun_l15_n247(x)
+    if (x < 1)
+        fun_l16_n141(x)
+    else
+        fun_l16_n743(x)
+    end
+end
+
+def fun_l15_n248(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n141(x)
+    end
+end
+
+def fun_l15_n249(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n53(x)
+    end
+end
+
+def fun_l15_n250(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n463(x)
+    end
+end
+
+def fun_l15_n251(x)
+    if (x < 1)
+        fun_l16_n828(x)
+    else
+        fun_l16_n739(x)
+    end
+end
+
+def fun_l15_n252(x)
+    if (x < 1)
+        fun_l16_n18(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n253(x)
+    if (x < 1)
+        fun_l16_n668(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n254(x)
+    if (x < 1)
+        fun_l16_n649(x)
+    else
+        fun_l16_n397(x)
+    end
+end
+
+def fun_l15_n255(x)
+    if (x < 1)
+        fun_l16_n376(x)
+    else
+        fun_l16_n375(x)
+    end
+end
+
+def fun_l15_n256(x)
+    if (x < 1)
+        fun_l16_n451(x)
+    else
+        fun_l16_n537(x)
+    end
+end
+
+def fun_l15_n257(x)
+    if (x < 1)
+        fun_l16_n360(x)
+    else
+        fun_l16_n330(x)
+    end
+end
+
+def fun_l15_n258(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n259(x)
+    if (x < 1)
+        fun_l16_n738(x)
+    else
+        fun_l16_n662(x)
+    end
+end
+
+def fun_l15_n260(x)
+    if (x < 1)
+        fun_l16_n450(x)
+    else
+        fun_l16_n942(x)
+    end
+end
+
+def fun_l15_n261(x)
+    if (x < 1)
+        fun_l16_n23(x)
+    else
+        fun_l16_n534(x)
+    end
+end
+
+def fun_l15_n262(x)
+    if (x < 1)
+        fun_l16_n364(x)
+    else
+        fun_l16_n716(x)
+    end
+end
+
+def fun_l15_n263(x)
+    if (x < 1)
+        fun_l16_n528(x)
+    else
+        fun_l16_n185(x)
+    end
+end
+
+def fun_l15_n264(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n265(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n986(x)
+    end
+end
+
+def fun_l15_n266(x)
+    if (x < 1)
+        fun_l16_n726(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n267(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n11(x)
+    end
+end
+
+def fun_l15_n268(x)
+    if (x < 1)
+        fun_l16_n993(x)
+    else
+        fun_l16_n269(x)
+    end
+end
+
+def fun_l15_n269(x)
+    if (x < 1)
+        fun_l16_n296(x)
+    else
+        fun_l16_n8(x)
+    end
+end
+
+def fun_l15_n270(x)
+    if (x < 1)
+        fun_l16_n700(x)
+    else
+        fun_l16_n692(x)
+    end
+end
+
+def fun_l15_n271(x)
+    if (x < 1)
+        fun_l16_n902(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n272(x)
+    if (x < 1)
+        fun_l16_n39(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n273(x)
+    if (x < 1)
+        fun_l16_n520(x)
+    else
+        fun_l16_n49(x)
+    end
+end
+
+def fun_l15_n274(x)
+    if (x < 1)
+        fun_l16_n24(x)
+    else
+        fun_l16_n466(x)
+    end
+end
+
+def fun_l15_n275(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n276(x)
+    if (x < 1)
+        fun_l16_n719(x)
+    else
+        fun_l16_n693(x)
+    end
+end
+
+def fun_l15_n277(x)
+    if (x < 1)
+        fun_l16_n687(x)
+    else
+        fun_l16_n987(x)
+    end
+end
+
+def fun_l15_n278(x)
+    if (x < 1)
+        fun_l16_n426(x)
+    else
+        fun_l16_n179(x)
+    end
+end
+
+def fun_l15_n279(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n36(x)
+    end
+end
+
+def fun_l15_n280(x)
+    if (x < 1)
+        fun_l16_n460(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n281(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n230(x)
+    end
+end
+
+def fun_l15_n282(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n422(x)
+    end
+end
+
+def fun_l15_n283(x)
+    if (x < 1)
+        fun_l16_n305(x)
+    else
+        fun_l16_n554(x)
+    end
+end
+
+def fun_l15_n284(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n147(x)
+    end
+end
+
+def fun_l15_n285(x)
+    if (x < 1)
+        fun_l16_n632(x)
+    else
+        fun_l16_n767(x)
+    end
+end
+
+def fun_l15_n286(x)
+    if (x < 1)
+        fun_l16_n735(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n287(x)
+    if (x < 1)
+        fun_l16_n17(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n288(x)
+    if (x < 1)
+        fun_l16_n517(x)
+    else
+        fun_l16_n47(x)
+    end
+end
+
+def fun_l15_n289(x)
+    if (x < 1)
+        fun_l16_n101(x)
+    else
+        fun_l16_n882(x)
+    end
+end
+
+def fun_l15_n290(x)
+    if (x < 1)
+        fun_l16_n697(x)
+    else
+        fun_l16_n963(x)
+    end
+end
+
+def fun_l15_n291(x)
+    if (x < 1)
+        fun_l16_n468(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n292(x)
+    if (x < 1)
+        fun_l16_n817(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n293(x)
+    if (x < 1)
+        fun_l16_n885(x)
+    else
+        fun_l16_n733(x)
+    end
+end
+
+def fun_l15_n294(x)
+    if (x < 1)
+        fun_l16_n844(x)
+    else
+        fun_l16_n564(x)
+    end
+end
+
+def fun_l15_n295(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n286(x)
+    end
+end
+
+def fun_l15_n296(x)
+    if (x < 1)
+        fun_l16_n694(x)
+    else
+        fun_l16_n660(x)
+    end
+end
+
+def fun_l15_n297(x)
+    if (x < 1)
+        fun_l16_n839(x)
+    else
+        fun_l16_n274(x)
+    end
+end
+
+def fun_l15_n298(x)
+    if (x < 1)
+        fun_l16_n385(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n299(x)
+    if (x < 1)
+        fun_l16_n137(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n300(x)
+    if (x < 1)
+        fun_l16_n662(x)
+    else
+        fun_l16_n2(x)
+    end
+end
+
+def fun_l15_n301(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n186(x)
+    end
+end
+
+def fun_l15_n302(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n454(x)
+    end
+end
+
+def fun_l15_n303(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n304(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n213(x)
+    end
+end
+
+def fun_l15_n305(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n306(x)
+    if (x < 1)
+        fun_l16_n221(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n307(x)
+    if (x < 1)
+        fun_l16_n555(x)
+    else
+        fun_l16_n570(x)
+    end
+end
+
+def fun_l15_n308(x)
+    if (x < 1)
+        fun_l16_n57(x)
+    else
+        fun_l16_n91(x)
+    end
+end
+
+def fun_l15_n309(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n516(x)
+    end
+end
+
+def fun_l15_n310(x)
+    if (x < 1)
+        fun_l16_n661(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n311(x)
+    if (x < 1)
+        fun_l16_n119(x)
+    else
+        fun_l16_n613(x)
+    end
+end
+
+def fun_l15_n312(x)
+    if (x < 1)
+        fun_l16_n982(x)
+    else
+        fun_l16_n20(x)
+    end
+end
+
+def fun_l15_n313(x)
+    if (x < 1)
+        fun_l16_n241(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n314(x)
+    if (x < 1)
+        fun_l16_n638(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n315(x)
+    if (x < 1)
+        fun_l16_n580(x)
+    else
+        fun_l16_n39(x)
+    end
+end
+
+def fun_l15_n316(x)
+    if (x < 1)
+        fun_l16_n705(x)
+    else
+        fun_l16_n240(x)
+    end
+end
+
+def fun_l15_n317(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n114(x)
+    end
+end
+
+def fun_l15_n318(x)
+    if (x < 1)
+        fun_l16_n554(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n319(x)
+    if (x < 1)
+        fun_l16_n108(x)
+    else
+        fun_l16_n537(x)
+    end
+end
+
+def fun_l15_n320(x)
+    if (x < 1)
+        fun_l16_n554(x)
+    else
+        fun_l16_n902(x)
+    end
+end
+
+def fun_l15_n321(x)
+    if (x < 1)
+        fun_l16_n665(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n322(x)
+    if (x < 1)
+        fun_l16_n4(x)
+    else
+        fun_l16_n572(x)
+    end
+end
+
+def fun_l15_n323(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n324(x)
+    if (x < 1)
+        fun_l16_n593(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n325(x)
+    if (x < 1)
+        fun_l16_n678(x)
+    else
+        fun_l16_n0(x)
+    end
+end
+
+def fun_l15_n326(x)
+    if (x < 1)
+        fun_l16_n809(x)
+    else
+        fun_l16_n833(x)
+    end
+end
+
+def fun_l15_n327(x)
+    if (x < 1)
+        fun_l16_n618(x)
+    else
+        fun_l16_n381(x)
+    end
+end
+
+def fun_l15_n328(x)
+    if (x < 1)
+        fun_l16_n133(x)
+    else
+        fun_l16_n744(x)
+    end
+end
+
+def fun_l15_n329(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n330(x)
+    if (x < 1)
+        fun_l16_n205(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n331(x)
+    if (x < 1)
+        fun_l16_n515(x)
+    else
+        fun_l16_n145(x)
+    end
+end
+
+def fun_l15_n332(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n333(x)
+    if (x < 1)
+        fun_l16_n356(x)
+    else
+        fun_l16_n155(x)
+    end
+end
+
+def fun_l15_n334(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n272(x)
+    end
+end
+
+def fun_l15_n335(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n245(x)
+    end
+end
+
+def fun_l15_n336(x)
+    if (x < 1)
+        fun_l16_n581(x)
+    else
+        fun_l16_n877(x)
+    end
+end
+
+def fun_l15_n337(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n944(x)
+    end
+end
+
+def fun_l15_n338(x)
+    if (x < 1)
+        fun_l16_n49(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n339(x)
+    if (x < 1)
+        fun_l16_n68(x)
+    else
+        fun_l16_n448(x)
+    end
+end
+
+def fun_l15_n340(x)
+    if (x < 1)
+        fun_l16_n249(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n341(x)
+    if (x < 1)
+        fun_l16_n720(x)
+    else
+        fun_l16_n977(x)
+    end
+end
+
+def fun_l15_n342(x)
+    if (x < 1)
+        fun_l16_n771(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n343(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n759(x)
+    end
+end
+
+def fun_l15_n344(x)
+    if (x < 1)
+        fun_l16_n972(x)
+    else
+        fun_l16_n558(x)
+    end
+end
+
+def fun_l15_n345(x)
+    if (x < 1)
+        fun_l16_n184(x)
+    else
+        fun_l16_n774(x)
+    end
+end
+
+def fun_l15_n346(x)
+    if (x < 1)
+        fun_l16_n881(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n347(x)
+    if (x < 1)
+        fun_l16_n921(x)
+    else
+        fun_l16_n640(x)
+    end
+end
+
+def fun_l15_n348(x)
+    if (x < 1)
+        fun_l16_n840(x)
+    else
+        fun_l16_n366(x)
+    end
+end
+
+def fun_l15_n349(x)
+    if (x < 1)
+        fun_l16_n835(x)
+    else
+        fun_l16_n701(x)
+    end
+end
+
+def fun_l15_n350(x)
+    if (x < 1)
+        fun_l16_n304(x)
+    else
+        fun_l16_n144(x)
+    end
+end
+
+def fun_l15_n351(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n247(x)
+    end
+end
+
+def fun_l15_n352(x)
+    if (x < 1)
+        fun_l16_n595(x)
+    else
+        fun_l16_n676(x)
+    end
+end
+
+def fun_l15_n353(x)
+    if (x < 1)
+        fun_l16_n125(x)
+    else
+        fun_l16_n99(x)
+    end
+end
+
+def fun_l15_n354(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n355(x)
+    if (x < 1)
+        fun_l16_n405(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n356(x)
+    if (x < 1)
+        fun_l16_n347(x)
+    else
+        fun_l16_n482(x)
+    end
+end
+
+def fun_l15_n357(x)
+    if (x < 1)
+        fun_l16_n742(x)
+    else
+        fun_l16_n531(x)
+    end
+end
+
+def fun_l15_n358(x)
+    if (x < 1)
+        fun_l16_n954(x)
+    else
+        fun_l16_n908(x)
+    end
+end
+
+def fun_l15_n359(x)
+    if (x < 1)
+        fun_l16_n670(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n360(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n802(x)
+    end
+end
+
+def fun_l15_n361(x)
+    if (x < 1)
+        fun_l16_n12(x)
+    else
+        fun_l16_n985(x)
+    end
+end
+
+def fun_l15_n362(x)
+    if (x < 1)
+        fun_l16_n644(x)
+    else
+        fun_l16_n40(x)
+    end
+end
+
+def fun_l15_n363(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n255(x)
+    end
+end
+
+def fun_l15_n364(x)
+    if (x < 1)
+        fun_l16_n14(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n365(x)
+    if (x < 1)
+        fun_l16_n652(x)
+    else
+        fun_l16_n418(x)
+    end
+end
+
+def fun_l15_n366(x)
+    if (x < 1)
+        fun_l16_n815(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n367(x)
+    if (x < 1)
+        fun_l16_n623(x)
+    else
+        fun_l16_n34(x)
+    end
+end
+
+def fun_l15_n368(x)
+    if (x < 1)
+        fun_l16_n596(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n369(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n18(x)
+    end
+end
+
+def fun_l15_n370(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n371(x)
+    if (x < 1)
+        fun_l16_n275(x)
+    else
+        fun_l16_n343(x)
+    end
+end
+
+def fun_l15_n372(x)
+    if (x < 1)
+        fun_l16_n951(x)
+    else
+        fun_l16_n93(x)
+    end
+end
+
+def fun_l15_n373(x)
+    if (x < 1)
+        fun_l16_n893(x)
+    else
+        fun_l16_n137(x)
+    end
+end
+
+def fun_l15_n374(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n663(x)
+    end
+end
+
+def fun_l15_n375(x)
+    if (x < 1)
+        fun_l16_n888(x)
+    else
+        fun_l16_n708(x)
+    end
+end
+
+def fun_l15_n376(x)
+    if (x < 1)
+        fun_l16_n745(x)
+    else
+        fun_l16_n275(x)
+    end
+end
+
+def fun_l15_n377(x)
+    if (x < 1)
+        fun_l16_n957(x)
+    else
+        fun_l16_n766(x)
+    end
+end
+
+def fun_l15_n378(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n309(x)
+    end
+end
+
+def fun_l15_n379(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n289(x)
+    end
+end
+
+def fun_l15_n380(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n381(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n169(x)
+    end
+end
+
+def fun_l15_n382(x)
+    if (x < 1)
+        fun_l16_n646(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n383(x)
+    if (x < 1)
+        fun_l16_n181(x)
+    else
+        fun_l16_n798(x)
+    end
+end
+
+def fun_l15_n384(x)
+    if (x < 1)
+        fun_l16_n290(x)
+    else
+        fun_l16_n756(x)
+    end
+end
+
+def fun_l15_n385(x)
+    if (x < 1)
+        fun_l16_n896(x)
+    else
+        fun_l16_n14(x)
+    end
+end
+
+def fun_l15_n386(x)
+    if (x < 1)
+        fun_l16_n602(x)
+    else
+        fun_l16_n817(x)
+    end
+end
+
+def fun_l15_n387(x)
+    if (x < 1)
+        fun_l16_n908(x)
+    else
+        fun_l16_n773(x)
+    end
+end
+
+def fun_l15_n388(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n416(x)
+    end
+end
+
+def fun_l15_n389(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n390(x)
+    if (x < 1)
+        fun_l16_n245(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n391(x)
+    if (x < 1)
+        fun_l16_n674(x)
+    else
+        fun_l16_n854(x)
+    end
+end
+
+def fun_l15_n392(x)
+    if (x < 1)
+        fun_l16_n294(x)
+    else
+        fun_l16_n299(x)
+    end
+end
+
+def fun_l15_n393(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n17(x)
+    end
+end
+
+def fun_l15_n394(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n395(x)
+    if (x < 1)
+        fun_l16_n753(x)
+    else
+        fun_l16_n362(x)
+    end
+end
+
+def fun_l15_n396(x)
+    if (x < 1)
+        fun_l16_n326(x)
+    else
+        fun_l16_n878(x)
+    end
+end
+
+def fun_l15_n397(x)
+    if (x < 1)
+        fun_l16_n118(x)
+    else
+        fun_l16_n552(x)
+    end
+end
+
+def fun_l15_n398(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n552(x)
+    end
+end
+
+def fun_l15_n399(x)
+    if (x < 1)
+        fun_l16_n125(x)
+    else
+        fun_l16_n817(x)
+    end
+end
+
+def fun_l15_n400(x)
+    if (x < 1)
+        fun_l16_n747(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n401(x)
+    if (x < 1)
+        fun_l16_n204(x)
+    else
+        fun_l16_n644(x)
+    end
+end
+
+def fun_l15_n402(x)
+    if (x < 1)
+        fun_l16_n730(x)
+    else
+        fun_l16_n622(x)
+    end
+end
+
+def fun_l15_n403(x)
+    if (x < 1)
+        fun_l16_n718(x)
+    else
+        fun_l16_n616(x)
+    end
+end
+
+def fun_l15_n404(x)
+    if (x < 1)
+        fun_l16_n260(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n405(x)
+    if (x < 1)
+        fun_l16_n123(x)
+    else
+        fun_l16_n377(x)
+    end
+end
+
+def fun_l15_n406(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n601(x)
+    end
+end
+
+def fun_l15_n407(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n936(x)
+    end
+end
+
+def fun_l15_n408(x)
+    if (x < 1)
+        fun_l16_n797(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n409(x)
+    if (x < 1)
+        fun_l16_n930(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n410(x)
+    if (x < 1)
+        fun_l16_n163(x)
+    else
+        fun_l16_n703(x)
+    end
+end
+
+def fun_l15_n411(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n276(x)
+    end
+end
+
+def fun_l15_n412(x)
+    if (x < 1)
+        fun_l16_n37(x)
+    else
+        fun_l16_n372(x)
+    end
+end
+
+def fun_l15_n413(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n762(x)
+    end
+end
+
+def fun_l15_n414(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n601(x)
+    end
+end
+
+def fun_l15_n415(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n853(x)
+    end
+end
+
+def fun_l15_n416(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n417(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n67(x)
+    end
+end
+
+def fun_l15_n418(x)
+    if (x < 1)
+        fun_l16_n563(x)
+    else
+        fun_l16_n248(x)
+    end
+end
+
+def fun_l15_n419(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n188(x)
+    end
+end
+
+def fun_l15_n420(x)
+    if (x < 1)
+        fun_l16_n369(x)
+    else
+        fun_l16_n706(x)
+    end
+end
+
+def fun_l15_n421(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n869(x)
+    end
+end
+
+def fun_l15_n422(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n333(x)
+    end
+end
+
+def fun_l15_n423(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n22(x)
+    end
+end
+
+def fun_l15_n424(x)
+    if (x < 1)
+        fun_l16_n443(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n425(x)
+    if (x < 1)
+        fun_l16_n892(x)
+    else
+        fun_l16_n937(x)
+    end
+end
+
+def fun_l15_n426(x)
+    if (x < 1)
+        fun_l16_n586(x)
+    else
+        fun_l16_n636(x)
+    end
+end
+
+def fun_l15_n427(x)
+    if (x < 1)
+        fun_l16_n519(x)
+    else
+        fun_l16_n269(x)
+    end
+end
+
+def fun_l15_n428(x)
+    if (x < 1)
+        fun_l16_n379(x)
+    else
+        fun_l16_n994(x)
+    end
+end
+
+def fun_l15_n429(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n532(x)
+    end
+end
+
+def fun_l15_n430(x)
+    if (x < 1)
+        fun_l16_n584(x)
+    else
+        fun_l16_n445(x)
+    end
+end
+
+def fun_l15_n431(x)
+    if (x < 1)
+        fun_l16_n63(x)
+    else
+        fun_l16_n678(x)
+    end
+end
+
+def fun_l15_n432(x)
+    if (x < 1)
+        fun_l16_n487(x)
+    else
+        fun_l16_n435(x)
+    end
+end
+
+def fun_l15_n433(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n220(x)
+    end
+end
+
+def fun_l15_n434(x)
+    if (x < 1)
+        fun_l16_n131(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n435(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n436(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n437(x)
+    if (x < 1)
+        fun_l16_n983(x)
+    else
+        fun_l16_n632(x)
+    end
+end
+
+def fun_l15_n438(x)
+    if (x < 1)
+        fun_l16_n350(x)
+    else
+        fun_l16_n492(x)
+    end
+end
+
+def fun_l15_n439(x)
+    if (x < 1)
+        fun_l16_n994(x)
+    else
+        fun_l16_n76(x)
+    end
+end
+
+def fun_l15_n440(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n441(x)
+    if (x < 1)
+        fun_l16_n619(x)
+    else
+        fun_l16_n473(x)
+    end
+end
+
+def fun_l15_n442(x)
+    if (x < 1)
+        fun_l16_n667(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n443(x)
+    if (x < 1)
+        fun_l16_n790(x)
+    else
+        fun_l16_n848(x)
+    end
+end
+
+def fun_l15_n444(x)
+    if (x < 1)
+        fun_l16_n925(x)
+    else
+        fun_l16_n113(x)
+    end
+end
+
+def fun_l15_n445(x)
+    if (x < 1)
+        fun_l16_n990(x)
+    else
+        fun_l16_n566(x)
+    end
+end
+
+def fun_l15_n446(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n881(x)
+    end
+end
+
+def fun_l15_n447(x)
+    if (x < 1)
+        fun_l16_n961(x)
+    else
+        fun_l16_n786(x)
+    end
+end
+
+def fun_l15_n448(x)
+    if (x < 1)
+        fun_l16_n928(x)
+    else
+        fun_l16_n631(x)
+    end
+end
+
+def fun_l15_n449(x)
+    if (x < 1)
+        fun_l16_n317(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n450(x)
+    if (x < 1)
+        fun_l16_n276(x)
+    else
+        fun_l16_n941(x)
+    end
+end
+
+def fun_l15_n451(x)
+    if (x < 1)
+        fun_l16_n552(x)
+    else
+        fun_l16_n545(x)
+    end
+end
+
+def fun_l15_n452(x)
+    if (x < 1)
+        fun_l16_n334(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n453(x)
+    if (x < 1)
+        fun_l16_n800(x)
+    else
+        fun_l16_n548(x)
+    end
+end
+
+def fun_l15_n454(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n742(x)
+    end
+end
+
+def fun_l15_n455(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n446(x)
+    end
+end
+
+def fun_l15_n456(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n457(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n401(x)
+    end
+end
+
+def fun_l15_n458(x)
+    if (x < 1)
+        fun_l16_n3(x)
+    else
+        fun_l16_n483(x)
+    end
+end
+
+def fun_l15_n459(x)
+    if (x < 1)
+        fun_l16_n450(x)
+    else
+        fun_l16_n468(x)
+    end
+end
+
+def fun_l15_n460(x)
+    if (x < 1)
+        fun_l16_n447(x)
+    else
+        fun_l16_n758(x)
+    end
+end
+
+def fun_l15_n461(x)
+    if (x < 1)
+        fun_l16_n531(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n462(x)
+    if (x < 1)
+        fun_l16_n628(x)
+    else
+        fun_l16_n142(x)
+    end
+end
+
+def fun_l15_n463(x)
+    if (x < 1)
+        fun_l16_n823(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n464(x)
+    if (x < 1)
+        fun_l16_n807(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n465(x)
+    if (x < 1)
+        fun_l16_n113(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n466(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n467(x)
+    if (x < 1)
+        fun_l16_n242(x)
+    else
+        fun_l16_n121(x)
+    end
+end
+
+def fun_l15_n468(x)
+    if (x < 1)
+        fun_l16_n38(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n469(x)
+    if (x < 1)
+        fun_l16_n618(x)
+    else
+        fun_l16_n550(x)
+    end
+end
+
+def fun_l15_n470(x)
+    if (x < 1)
+        fun_l16_n318(x)
+    else
+        fun_l16_n182(x)
+    end
+end
+
+def fun_l15_n471(x)
+    if (x < 1)
+        fun_l16_n782(x)
+    else
+        fun_l16_n876(x)
+    end
+end
+
+def fun_l15_n472(x)
+    if (x < 1)
+        fun_l16_n995(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n473(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n891(x)
+    end
+end
+
+def fun_l15_n474(x)
+    if (x < 1)
+        fun_l16_n263(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n475(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n62(x)
+    end
+end
+
+def fun_l15_n476(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n153(x)
+    end
+end
+
+def fun_l15_n477(x)
+    if (x < 1)
+        fun_l16_n979(x)
+    else
+        fun_l16_n957(x)
+    end
+end
+
+def fun_l15_n478(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n479(x)
+    if (x < 1)
+        fun_l16_n479(x)
+    else
+        fun_l16_n400(x)
+    end
+end
+
+def fun_l15_n480(x)
+    if (x < 1)
+        fun_l16_n740(x)
+    else
+        fun_l16_n940(x)
+    end
+end
+
+def fun_l15_n481(x)
+    if (x < 1)
+        fun_l16_n270(x)
+    else
+        fun_l16_n802(x)
+    end
+end
+
+def fun_l15_n482(x)
+    if (x < 1)
+        fun_l16_n489(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n483(x)
+    if (x < 1)
+        fun_l16_n505(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n484(x)
+    if (x < 1)
+        fun_l16_n64(x)
+    else
+        fun_l16_n748(x)
+    end
+end
+
+def fun_l15_n485(x)
+    if (x < 1)
+        fun_l16_n7(x)
+    else
+        fun_l16_n627(x)
+    end
+end
+
+def fun_l15_n486(x)
+    if (x < 1)
+        fun_l16_n302(x)
+    else
+        fun_l16_n331(x)
+    end
+end
+
+def fun_l15_n487(x)
+    if (x < 1)
+        fun_l16_n771(x)
+    else
+        fun_l16_n895(x)
+    end
+end
+
+def fun_l15_n488(x)
+    if (x < 1)
+        fun_l16_n306(x)
+    else
+        fun_l16_n740(x)
+    end
+end
+
+def fun_l15_n489(x)
+    if (x < 1)
+        fun_l16_n722(x)
+    else
+        fun_l16_n848(x)
+    end
+end
+
+def fun_l15_n490(x)
+    if (x < 1)
+        fun_l16_n764(x)
+    else
+        fun_l16_n851(x)
+    end
+end
+
+def fun_l15_n491(x)
+    if (x < 1)
+        fun_l16_n357(x)
+    else
+        fun_l16_n117(x)
+    end
+end
+
+def fun_l15_n492(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n187(x)
+    end
+end
+
+def fun_l15_n493(x)
+    if (x < 1)
+        fun_l16_n695(x)
+    else
+        fun_l16_n727(x)
+    end
+end
+
+def fun_l15_n494(x)
+    if (x < 1)
+        fun_l16_n460(x)
+    else
+        fun_l16_n154(x)
+    end
+end
+
+def fun_l15_n495(x)
+    if (x < 1)
+        fun_l16_n130(x)
+    else
+        fun_l16_n999(x)
+    end
+end
+
+def fun_l15_n496(x)
+    if (x < 1)
+        fun_l16_n963(x)
+    else
+        fun_l16_n746(x)
+    end
+end
+
+def fun_l15_n497(x)
+    if (x < 1)
+        fun_l16_n630(x)
+    else
+        fun_l16_n852(x)
+    end
+end
+
+def fun_l15_n498(x)
+    if (x < 1)
+        fun_l16_n847(x)
+    else
+        fun_l16_n836(x)
+    end
+end
+
+def fun_l15_n499(x)
+    if (x < 1)
+        fun_l16_n100(x)
+    else
+        fun_l16_n40(x)
+    end
+end
+
+def fun_l15_n500(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n501(x)
+    if (x < 1)
+        fun_l16_n355(x)
+    else
+        fun_l16_n405(x)
+    end
+end
+
+def fun_l15_n502(x)
+    if (x < 1)
+        fun_l16_n857(x)
+    else
+        fun_l16_n652(x)
+    end
+end
+
+def fun_l15_n503(x)
+    if (x < 1)
+        fun_l16_n612(x)
+    else
+        fun_l16_n779(x)
+    end
+end
+
+def fun_l15_n504(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n625(x)
+    end
+end
+
+def fun_l15_n505(x)
+    if (x < 1)
+        fun_l16_n872(x)
+    else
+        fun_l16_n905(x)
+    end
+end
+
+def fun_l15_n506(x)
+    if (x < 1)
+        fun_l16_n953(x)
+    else
+        fun_l16_n955(x)
+    end
+end
+
+def fun_l15_n507(x)
+    if (x < 1)
+        fun_l16_n678(x)
+    else
+        fun_l16_n663(x)
+    end
+end
+
+def fun_l15_n508(x)
+    if (x < 1)
+        fun_l16_n848(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n509(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n430(x)
+    end
+end
+
+def fun_l15_n510(x)
+    if (x < 1)
+        fun_l16_n424(x)
+    else
+        fun_l16_n473(x)
+    end
+end
+
+def fun_l15_n511(x)
+    if (x < 1)
+        fun_l16_n897(x)
+    else
+        fun_l16_n359(x)
+    end
+end
+
+def fun_l15_n512(x)
+    if (x < 1)
+        fun_l16_n229(x)
+    else
+        fun_l16_n205(x)
+    end
+end
+
+def fun_l15_n513(x)
+    if (x < 1)
+        fun_l16_n553(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n514(x)
+    if (x < 1)
+        fun_l16_n300(x)
+    else
+        fun_l16_n588(x)
+    end
+end
+
+def fun_l15_n515(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n467(x)
+    end
+end
+
+def fun_l15_n516(x)
+    if (x < 1)
+        fun_l16_n767(x)
+    else
+        fun_l16_n786(x)
+    end
+end
+
+def fun_l15_n517(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n309(x)
+    end
+end
+
+def fun_l15_n518(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n519(x)
+    if (x < 1)
+        fun_l16_n935(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n520(x)
+    if (x < 1)
+        fun_l16_n343(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n521(x)
+    if (x < 1)
+        fun_l16_n212(x)
+    else
+        fun_l16_n987(x)
+    end
+end
+
+def fun_l15_n522(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n331(x)
+    end
+end
+
+def fun_l15_n523(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n393(x)
+    end
+end
+
+def fun_l15_n524(x)
+    if (x < 1)
+        fun_l16_n823(x)
+    else
+        fun_l16_n212(x)
+    end
+end
+
+def fun_l15_n525(x)
+    if (x < 1)
+        fun_l16_n516(x)
+    else
+        fun_l16_n906(x)
+    end
+end
+
+def fun_l15_n526(x)
+    if (x < 1)
+        fun_l16_n590(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n527(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n714(x)
+    end
+end
+
+def fun_l15_n528(x)
+    if (x < 1)
+        fun_l16_n729(x)
+    else
+        fun_l16_n751(x)
+    end
+end
+
+def fun_l15_n529(x)
+    if (x < 1)
+        fun_l16_n863(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n530(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n672(x)
+    end
+end
+
+def fun_l15_n531(x)
+    if (x < 1)
+        fun_l16_n811(x)
+    else
+        fun_l16_n201(x)
+    end
+end
+
+def fun_l15_n532(x)
+    if (x < 1)
+        fun_l16_n558(x)
+    else
+        fun_l16_n602(x)
+    end
+end
+
+def fun_l15_n533(x)
+    if (x < 1)
+        fun_l16_n788(x)
+    else
+        fun_l16_n175(x)
+    end
+end
+
+def fun_l15_n534(x)
+    if (x < 1)
+        fun_l16_n497(x)
+    else
+        fun_l16_n807(x)
+    end
+end
+
+def fun_l15_n535(x)
+    if (x < 1)
+        fun_l16_n712(x)
+    else
+        fun_l16_n870(x)
+    end
+end
+
+def fun_l15_n536(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n537(x)
+    if (x < 1)
+        fun_l16_n215(x)
+    else
+        fun_l16_n807(x)
+    end
+end
+
+def fun_l15_n538(x)
+    if (x < 1)
+        fun_l16_n569(x)
+    else
+        fun_l16_n385(x)
+    end
+end
+
+def fun_l15_n539(x)
+    if (x < 1)
+        fun_l16_n807(x)
+    else
+        fun_l16_n699(x)
+    end
+end
+
+def fun_l15_n540(x)
+    if (x < 1)
+        fun_l16_n982(x)
+    else
+        fun_l16_n436(x)
+    end
+end
+
+def fun_l15_n541(x)
+    if (x < 1)
+        fun_l16_n852(x)
+    else
+        fun_l16_n800(x)
+    end
+end
+
+def fun_l15_n542(x)
+    if (x < 1)
+        fun_l16_n401(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n543(x)
+    if (x < 1)
+        fun_l16_n373(x)
+    else
+        fun_l16_n465(x)
+    end
+end
+
+def fun_l15_n544(x)
+    if (x < 1)
+        fun_l16_n299(x)
+    else
+        fun_l16_n337(x)
+    end
+end
+
+def fun_l15_n545(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n68(x)
+    end
+end
+
+def fun_l15_n546(x)
+    if (x < 1)
+        fun_l16_n87(x)
+    else
+        fun_l16_n947(x)
+    end
+end
+
+def fun_l15_n547(x)
+    if (x < 1)
+        fun_l16_n287(x)
+    else
+        fun_l16_n530(x)
+    end
+end
+
+def fun_l15_n548(x)
+    if (x < 1)
+        fun_l16_n910(x)
+    else
+        fun_l16_n112(x)
+    end
+end
+
+def fun_l15_n549(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n737(x)
+    end
+end
+
+def fun_l15_n550(x)
+    if (x < 1)
+        fun_l16_n538(x)
+    else
+        fun_l16_n634(x)
+    end
+end
+
+def fun_l15_n551(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n493(x)
+    end
+end
+
+def fun_l15_n552(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n244(x)
+    end
+end
+
+def fun_l15_n553(x)
+    if (x < 1)
+        fun_l16_n107(x)
+    else
+        fun_l16_n718(x)
+    end
+end
+
+def fun_l15_n554(x)
+    if (x < 1)
+        fun_l16_n572(x)
+    else
+        fun_l16_n199(x)
+    end
+end
+
+def fun_l15_n555(x)
+    if (x < 1)
+        fun_l16_n109(x)
+    else
+        fun_l16_n705(x)
+    end
+end
+
+def fun_l15_n556(x)
+    if (x < 1)
+        fun_l16_n679(x)
+    else
+        fun_l16_n999(x)
+    end
+end
+
+def fun_l15_n557(x)
+    if (x < 1)
+        fun_l16_n714(x)
+    else
+        fun_l16_n121(x)
+    end
+end
+
+def fun_l15_n558(x)
+    if (x < 1)
+        fun_l16_n408(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n559(x)
+    if (x < 1)
+        fun_l16_n861(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n560(x)
+    if (x < 1)
+        fun_l16_n597(x)
+    else
+        fun_l16_n413(x)
+    end
+end
+
+def fun_l15_n561(x)
+    if (x < 1)
+        fun_l16_n485(x)
+    else
+        fun_l16_n42(x)
+    end
+end
+
+def fun_l15_n562(x)
+    if (x < 1)
+        fun_l16_n798(x)
+    else
+        fun_l16_n340(x)
+    end
+end
+
+def fun_l15_n563(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n564(x)
+    if (x < 1)
+        fun_l16_n92(x)
+    else
+        fun_l16_n3(x)
+    end
+end
+
+def fun_l15_n565(x)
+    if (x < 1)
+        fun_l16_n311(x)
+    else
+        fun_l16_n953(x)
+    end
+end
+
+def fun_l15_n566(x)
+    if (x < 1)
+        fun_l16_n649(x)
+    else
+        fun_l16_n670(x)
+    end
+end
+
+def fun_l15_n567(x)
+    if (x < 1)
+        fun_l16_n598(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n568(x)
+    if (x < 1)
+        fun_l16_n425(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n569(x)
+    if (x < 1)
+        fun_l16_n447(x)
+    else
+        fun_l16_n940(x)
+    end
+end
+
+def fun_l15_n570(x)
+    if (x < 1)
+        fun_l16_n755(x)
+    else
+        fun_l16_n26(x)
+    end
+end
+
+def fun_l15_n571(x)
+    if (x < 1)
+        fun_l16_n157(x)
+    else
+        fun_l16_n582(x)
+    end
+end
+
+def fun_l15_n572(x)
+    if (x < 1)
+        fun_l16_n530(x)
+    else
+        fun_l16_n202(x)
+    end
+end
+
+def fun_l15_n573(x)
+    if (x < 1)
+        fun_l16_n95(x)
+    else
+        fun_l16_n137(x)
+    end
+end
+
+def fun_l15_n574(x)
+    if (x < 1)
+        fun_l16_n789(x)
+    else
+        fun_l16_n531(x)
+    end
+end
+
+def fun_l15_n575(x)
+    if (x < 1)
+        fun_l16_n677(x)
+    else
+        fun_l16_n686(x)
+    end
+end
+
+def fun_l15_n576(x)
+    if (x < 1)
+        fun_l16_n253(x)
+    else
+        fun_l16_n101(x)
+    end
+end
+
+def fun_l15_n577(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n250(x)
+    end
+end
+
+def fun_l15_n578(x)
+    if (x < 1)
+        fun_l16_n104(x)
+    else
+        fun_l16_n860(x)
+    end
+end
+
+def fun_l15_n579(x)
+    if (x < 1)
+        fun_l16_n415(x)
+    else
+        fun_l16_n480(x)
+    end
+end
+
+def fun_l15_n580(x)
+    if (x < 1)
+        fun_l16_n255(x)
+    else
+        fun_l16_n123(x)
+    end
+end
+
+def fun_l15_n581(x)
+    if (x < 1)
+        fun_l16_n40(x)
+    else
+        fun_l16_n36(x)
+    end
+end
+
+def fun_l15_n582(x)
+    if (x < 1)
+        fun_l16_n612(x)
+    else
+        fun_l16_n46(x)
+    end
+end
+
+def fun_l15_n583(x)
+    if (x < 1)
+        fun_l16_n328(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n584(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n672(x)
+    end
+end
+
+def fun_l15_n585(x)
+    if (x < 1)
+        fun_l16_n67(x)
+    else
+        fun_l16_n584(x)
+    end
+end
+
+def fun_l15_n586(x)
+    if (x < 1)
+        fun_l16_n222(x)
+    else
+        fun_l16_n366(x)
+    end
+end
+
+def fun_l15_n587(x)
+    if (x < 1)
+        fun_l16_n194(x)
+    else
+        fun_l16_n54(x)
+    end
+end
+
+def fun_l15_n588(x)
+    if (x < 1)
+        fun_l16_n742(x)
+    else
+        fun_l16_n725(x)
+    end
+end
+
+def fun_l15_n589(x)
+    if (x < 1)
+        fun_l16_n557(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n590(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n296(x)
+    end
+end
+
+def fun_l15_n591(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n619(x)
+    end
+end
+
+def fun_l15_n592(x)
+    if (x < 1)
+        fun_l16_n919(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n593(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n594(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n595(x)
+    if (x < 1)
+        fun_l16_n132(x)
+    else
+        fun_l16_n120(x)
+    end
+end
+
+def fun_l15_n596(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n383(x)
+    end
+end
+
+def fun_l15_n597(x)
+    if (x < 1)
+        fun_l16_n987(x)
+    else
+        fun_l16_n685(x)
+    end
+end
+
+def fun_l15_n598(x)
+    if (x < 1)
+        fun_l16_n898(x)
+    else
+        fun_l16_n53(x)
+    end
+end
+
+def fun_l15_n599(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n25(x)
+    end
+end
+
+def fun_l15_n600(x)
+    if (x < 1)
+        fun_l16_n841(x)
+    else
+        fun_l16_n623(x)
+    end
+end
+
+def fun_l15_n601(x)
+    if (x < 1)
+        fun_l16_n63(x)
+    else
+        fun_l16_n515(x)
+    end
+end
+
+def fun_l15_n602(x)
+    if (x < 1)
+        fun_l16_n708(x)
+    else
+        fun_l16_n318(x)
+    end
+end
+
+def fun_l15_n603(x)
+    if (x < 1)
+        fun_l16_n679(x)
+    else
+        fun_l16_n31(x)
+    end
+end
+
+def fun_l15_n604(x)
+    if (x < 1)
+        fun_l16_n617(x)
+    else
+        fun_l16_n20(x)
+    end
+end
+
+def fun_l15_n605(x)
+    if (x < 1)
+        fun_l16_n635(x)
+    else
+        fun_l16_n990(x)
+    end
+end
+
+def fun_l15_n606(x)
+    if (x < 1)
+        fun_l16_n174(x)
+    else
+        fun_l16_n977(x)
+    end
+end
+
+def fun_l15_n607(x)
+    if (x < 1)
+        fun_l16_n449(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l15_n608(x)
+    if (x < 1)
+        fun_l16_n208(x)
+    else
+        fun_l16_n875(x)
+    end
+end
+
+def fun_l15_n609(x)
+    if (x < 1)
+        fun_l16_n665(x)
+    else
+        fun_l16_n431(x)
+    end
+end
+
+def fun_l15_n610(x)
+    if (x < 1)
+        fun_l16_n6(x)
+    else
+        fun_l16_n78(x)
+    end
+end
+
+def fun_l15_n611(x)
+    if (x < 1)
+        fun_l16_n335(x)
+    else
+        fun_l16_n558(x)
+    end
+end
+
+def fun_l15_n612(x)
+    if (x < 1)
+        fun_l16_n259(x)
+    else
+        fun_l16_n893(x)
+    end
+end
+
+def fun_l15_n613(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n519(x)
+    end
+end
+
+def fun_l15_n614(x)
+    if (x < 1)
+        fun_l16_n96(x)
+    else
+        fun_l16_n28(x)
+    end
+end
+
+def fun_l15_n615(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n417(x)
+    end
+end
+
+def fun_l15_n616(x)
+    if (x < 1)
+        fun_l16_n666(x)
+    else
+        fun_l16_n932(x)
+    end
+end
+
+def fun_l15_n617(x)
+    if (x < 1)
+        fun_l16_n745(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n618(x)
+    if (x < 1)
+        fun_l16_n5(x)
+    else
+        fun_l16_n769(x)
+    end
+end
+
+def fun_l15_n619(x)
+    if (x < 1)
+        fun_l16_n108(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l15_n620(x)
+    if (x < 1)
+        fun_l16_n454(x)
+    else
+        fun_l16_n666(x)
+    end
+end
+
+def fun_l15_n621(x)
+    if (x < 1)
+        fun_l16_n756(x)
+    else
+        fun_l16_n580(x)
+    end
+end
+
+def fun_l15_n622(x)
+    if (x < 1)
+        fun_l16_n419(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n623(x)
+    if (x < 1)
+        fun_l16_n793(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n624(x)
+    if (x < 1)
+        fun_l16_n78(x)
+    else
+        fun_l16_n311(x)
+    end
+end
+
+def fun_l15_n625(x)
+    if (x < 1)
+        fun_l16_n35(x)
+    else
+        fun_l16_n378(x)
+    end
+end
+
+def fun_l15_n626(x)
+    if (x < 1)
+        fun_l16_n974(x)
+    else
+        fun_l16_n483(x)
+    end
+end
+
+def fun_l15_n627(x)
+    if (x < 1)
+        fun_l16_n67(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n628(x)
+    if (x < 1)
+        fun_l16_n640(x)
+    else
+        fun_l16_n32(x)
+    end
+end
+
+def fun_l15_n629(x)
+    if (x < 1)
+        fun_l16_n297(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n630(x)
+    if (x < 1)
+        fun_l16_n546(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n631(x)
+    if (x < 1)
+        fun_l16_n688(x)
+    else
+        fun_l16_n542(x)
+    end
+end
+
+def fun_l15_n632(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n633(x)
+    if (x < 1)
+        fun_l16_n743(x)
+    else
+        fun_l16_n382(x)
+    end
+end
+
+def fun_l15_n634(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n311(x)
+    end
+end
+
+def fun_l15_n635(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n329(x)
+    end
+end
+
+def fun_l15_n636(x)
+    if (x < 1)
+        fun_l16_n735(x)
+    else
+        fun_l16_n759(x)
+    end
+end
+
+def fun_l15_n637(x)
+    if (x < 1)
+        fun_l16_n699(x)
+    else
+        fun_l16_n27(x)
+    end
+end
+
+def fun_l15_n638(x)
+    if (x < 1)
+        fun_l16_n710(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n639(x)
+    if (x < 1)
+        fun_l16_n245(x)
+    else
+        fun_l16_n950(x)
+    end
+end
+
+def fun_l15_n640(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n357(x)
+    end
+end
+
+def fun_l15_n641(x)
+    if (x < 1)
+        fun_l16_n331(x)
+    else
+        fun_l16_n962(x)
+    end
+end
+
+def fun_l15_n642(x)
+    if (x < 1)
+        fun_l16_n144(x)
+    else
+        fun_l16_n877(x)
+    end
+end
+
+def fun_l15_n643(x)
+    if (x < 1)
+        fun_l16_n605(x)
+    else
+        fun_l16_n733(x)
+    end
+end
+
+def fun_l15_n644(x)
+    if (x < 1)
+        fun_l16_n22(x)
+    else
+        fun_l16_n176(x)
+    end
+end
+
+def fun_l15_n645(x)
+    if (x < 1)
+        fun_l16_n934(x)
+    else
+        fun_l16_n351(x)
+    end
+end
+
+def fun_l15_n646(x)
+    if (x < 1)
+        fun_l16_n224(x)
+    else
+        fun_l16_n308(x)
+    end
+end
+
+def fun_l15_n647(x)
+    if (x < 1)
+        fun_l16_n374(x)
+    else
+        fun_l16_n612(x)
+    end
+end
+
+def fun_l15_n648(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n563(x)
+    end
+end
+
+def fun_l15_n649(x)
+    if (x < 1)
+        fun_l16_n955(x)
+    else
+        fun_l16_n63(x)
+    end
+end
+
+def fun_l15_n650(x)
+    if (x < 1)
+        fun_l16_n734(x)
+    else
+        fun_l16_n194(x)
+    end
+end
+
+def fun_l15_n651(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n652(x)
+    if (x < 1)
+        fun_l16_n135(x)
+    else
+        fun_l16_n217(x)
+    end
+end
+
+def fun_l15_n653(x)
+    if (x < 1)
+        fun_l16_n565(x)
+    else
+        fun_l16_n437(x)
+    end
+end
+
+def fun_l15_n654(x)
+    if (x < 1)
+        fun_l16_n471(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n655(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n64(x)
+    end
+end
+
+def fun_l15_n656(x)
+    if (x < 1)
+        fun_l16_n456(x)
+    else
+        fun_l16_n479(x)
+    end
+end
+
+def fun_l15_n657(x)
+    if (x < 1)
+        fun_l16_n446(x)
+    else
+        fun_l16_n362(x)
+    end
+end
+
+def fun_l15_n658(x)
+    if (x < 1)
+        fun_l16_n294(x)
+    else
+        fun_l16_n485(x)
+    end
+end
+
+def fun_l15_n659(x)
+    if (x < 1)
+        fun_l16_n96(x)
+    else
+        fun_l16_n60(x)
+    end
+end
+
+def fun_l15_n660(x)
+    if (x < 1)
+        fun_l16_n436(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n661(x)
+    if (x < 1)
+        fun_l16_n5(x)
+    else
+        fun_l16_n452(x)
+    end
+end
+
+def fun_l15_n662(x)
+    if (x < 1)
+        fun_l16_n70(x)
+    else
+        fun_l16_n564(x)
+    end
+end
+
+def fun_l15_n663(x)
+    if (x < 1)
+        fun_l16_n92(x)
+    else
+        fun_l16_n333(x)
+    end
+end
+
+def fun_l15_n664(x)
+    if (x < 1)
+        fun_l16_n884(x)
+    else
+        fun_l16_n381(x)
+    end
+end
+
+def fun_l15_n665(x)
+    if (x < 1)
+        fun_l16_n816(x)
+    else
+        fun_l16_n243(x)
+    end
+end
+
+def fun_l15_n666(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n306(x)
+    end
+end
+
+def fun_l15_n667(x)
+    if (x < 1)
+        fun_l16_n470(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n668(x)
+    if (x < 1)
+        fun_l16_n34(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n669(x)
+    if (x < 1)
+        fun_l16_n644(x)
+    else
+        fun_l16_n389(x)
+    end
+end
+
+def fun_l15_n670(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n575(x)
+    end
+end
+
+def fun_l15_n671(x)
+    if (x < 1)
+        fun_l16_n241(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n672(x)
+    if (x < 1)
+        fun_l16_n280(x)
+    else
+        fun_l16_n996(x)
+    end
+end
+
+def fun_l15_n673(x)
+    if (x < 1)
+        fun_l16_n723(x)
+    else
+        fun_l16_n42(x)
+    end
+end
+
+def fun_l15_n674(x)
+    if (x < 1)
+        fun_l16_n503(x)
+    else
+        fun_l16_n837(x)
+    end
+end
+
+def fun_l15_n675(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n815(x)
+    end
+end
+
+def fun_l15_n676(x)
+    if (x < 1)
+        fun_l16_n441(x)
+    else
+        fun_l16_n313(x)
+    end
+end
+
+def fun_l15_n677(x)
+    if (x < 1)
+        fun_l16_n277(x)
+    else
+        fun_l16_n653(x)
+    end
+end
+
+def fun_l15_n678(x)
+    if (x < 1)
+        fun_l16_n105(x)
+    else
+        fun_l16_n907(x)
+    end
+end
+
+def fun_l15_n679(x)
+    if (x < 1)
+        fun_l16_n549(x)
+    else
+        fun_l16_n956(x)
+    end
+end
+
+def fun_l15_n680(x)
+    if (x < 1)
+        fun_l16_n177(x)
+    else
+        fun_l16_n238(x)
+    end
+end
+
+def fun_l15_n681(x)
+    if (x < 1)
+        fun_l16_n931(x)
+    else
+        fun_l16_n278(x)
+    end
+end
+
+def fun_l15_n682(x)
+    if (x < 1)
+        fun_l16_n923(x)
+    else
+        fun_l16_n924(x)
+    end
+end
+
+def fun_l15_n683(x)
+    if (x < 1)
+        fun_l16_n926(x)
+    else
+        fun_l16_n76(x)
+    end
+end
+
+def fun_l15_n684(x)
+    if (x < 1)
+        fun_l16_n828(x)
+    else
+        fun_l16_n961(x)
+    end
+end
+
+def fun_l15_n685(x)
+    if (x < 1)
+        fun_l16_n298(x)
+    else
+        fun_l16_n95(x)
+    end
+end
+
+def fun_l15_n686(x)
+    if (x < 1)
+        fun_l16_n929(x)
+    else
+        fun_l16_n239(x)
+    end
+end
+
+def fun_l15_n687(x)
+    if (x < 1)
+        fun_l16_n488(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n688(x)
+    if (x < 1)
+        fun_l16_n562(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n689(x)
+    if (x < 1)
+        fun_l16_n348(x)
+    else
+        fun_l16_n458(x)
+    end
+end
+
+def fun_l15_n690(x)
+    if (x < 1)
+        fun_l16_n431(x)
+    else
+        fun_l16_n653(x)
+    end
+end
+
+def fun_l15_n691(x)
+    if (x < 1)
+        fun_l16_n173(x)
+    else
+        fun_l16_n600(x)
+    end
+end
+
+def fun_l15_n692(x)
+    if (x < 1)
+        fun_l16_n820(x)
+    else
+        fun_l16_n793(x)
+    end
+end
+
+def fun_l15_n693(x)
+    if (x < 1)
+        fun_l16_n611(x)
+    else
+        fun_l16_n308(x)
+    end
+end
+
+def fun_l15_n694(x)
+    if (x < 1)
+        fun_l16_n325(x)
+    else
+        fun_l16_n791(x)
+    end
+end
+
+def fun_l15_n695(x)
+    if (x < 1)
+        fun_l16_n890(x)
+    else
+        fun_l16_n98(x)
+    end
+end
+
+def fun_l15_n696(x)
+    if (x < 1)
+        fun_l16_n803(x)
+    else
+        fun_l16_n890(x)
+    end
+end
+
+def fun_l15_n697(x)
+    if (x < 1)
+        fun_l16_n182(x)
+    else
+        fun_l16_n229(x)
+    end
+end
+
+def fun_l15_n698(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n395(x)
+    end
+end
+
+def fun_l15_n699(x)
+    if (x < 1)
+        fun_l16_n349(x)
+    else
+        fun_l16_n903(x)
+    end
+end
+
+def fun_l15_n700(x)
+    if (x < 1)
+        fun_l16_n328(x)
+    else
+        fun_l16_n664(x)
+    end
+end
+
+def fun_l15_n701(x)
+    if (x < 1)
+        fun_l16_n924(x)
+    else
+        fun_l16_n415(x)
+    end
+end
+
+def fun_l15_n702(x)
+    if (x < 1)
+        fun_l16_n504(x)
+    else
+        fun_l16_n180(x)
+    end
+end
+
+def fun_l15_n703(x)
+    if (x < 1)
+        fun_l16_n754(x)
+    else
+        fun_l16_n580(x)
+    end
+end
+
+def fun_l15_n704(x)
+    if (x < 1)
+        fun_l16_n686(x)
+    else
+        fun_l16_n75(x)
+    end
+end
+
+def fun_l15_n705(x)
+    if (x < 1)
+        fun_l16_n295(x)
+    else
+        fun_l16_n789(x)
+    end
+end
+
+def fun_l15_n706(x)
+    if (x < 1)
+        fun_l16_n796(x)
+    else
+        fun_l16_n628(x)
+    end
+end
+
+def fun_l15_n707(x)
+    if (x < 1)
+        fun_l16_n603(x)
+    else
+        fun_l16_n864(x)
+    end
+end
+
+def fun_l15_n708(x)
+    if (x < 1)
+        fun_l16_n420(x)
+    else
+        fun_l16_n506(x)
+    end
+end
+
+def fun_l15_n709(x)
+    if (x < 1)
+        fun_l16_n417(x)
+    else
+        fun_l16_n677(x)
+    end
+end
+
+def fun_l15_n710(x)
+    if (x < 1)
+        fun_l16_n484(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n711(x)
+    if (x < 1)
+        fun_l16_n127(x)
+    else
+        fun_l16_n423(x)
+    end
+end
+
+def fun_l15_n712(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n75(x)
+    end
+end
+
+def fun_l15_n713(x)
+    if (x < 1)
+        fun_l16_n388(x)
+    else
+        fun_l16_n261(x)
+    end
+end
+
+def fun_l15_n714(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n160(x)
+    end
+end
+
+def fun_l15_n715(x)
+    if (x < 1)
+        fun_l16_n468(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n716(x)
+    if (x < 1)
+        fun_l16_n156(x)
+    else
+        fun_l16_n769(x)
+    end
+end
+
+def fun_l15_n717(x)
+    if (x < 1)
+        fun_l16_n219(x)
+    else
+        fun_l16_n618(x)
+    end
+end
+
+def fun_l15_n718(x)
+    if (x < 1)
+        fun_l16_n921(x)
+    else
+        fun_l16_n83(x)
+    end
+end
+
+def fun_l15_n719(x)
+    if (x < 1)
+        fun_l16_n262(x)
+    else
+        fun_l16_n170(x)
+    end
+end
+
+def fun_l15_n720(x)
+    if (x < 1)
+        fun_l16_n420(x)
+    else
+        fun_l16_n504(x)
+    end
+end
+
+def fun_l15_n721(x)
+    if (x < 1)
+        fun_l16_n485(x)
+    else
+        fun_l16_n782(x)
+    end
+end
+
+def fun_l15_n722(x)
+    if (x < 1)
+        fun_l16_n607(x)
+    else
+        fun_l16_n706(x)
+    end
+end
+
+def fun_l15_n723(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n73(x)
+    end
+end
+
+def fun_l15_n724(x)
+    if (x < 1)
+        fun_l16_n946(x)
+    else
+        fun_l16_n694(x)
+    end
+end
+
+def fun_l15_n725(x)
+    if (x < 1)
+        fun_l16_n73(x)
+    else
+        fun_l16_n223(x)
+    end
+end
+
+def fun_l15_n726(x)
+    if (x < 1)
+        fun_l16_n54(x)
+    else
+        fun_l16_n681(x)
+    end
+end
+
+def fun_l15_n727(x)
+    if (x < 1)
+        fun_l16_n474(x)
+    else
+        fun_l16_n339(x)
+    end
+end
+
+def fun_l15_n728(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n364(x)
+    end
+end
+
+def fun_l15_n729(x)
+    if (x < 1)
+        fun_l16_n537(x)
+    else
+        fun_l16_n1(x)
+    end
+end
+
+def fun_l15_n730(x)
+    if (x < 1)
+        fun_l16_n81(x)
+    else
+        fun_l16_n591(x)
+    end
+end
+
+def fun_l15_n731(x)
+    if (x < 1)
+        fun_l16_n631(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n732(x)
+    if (x < 1)
+        fun_l16_n904(x)
+    else
+        fun_l16_n988(x)
+    end
+end
+
+def fun_l15_n733(x)
+    if (x < 1)
+        fun_l16_n933(x)
+    else
+        fun_l16_n761(x)
+    end
+end
+
+def fun_l15_n734(x)
+    if (x < 1)
+        fun_l16_n687(x)
+    else
+        fun_l16_n611(x)
+    end
+end
+
+def fun_l15_n735(x)
+    if (x < 1)
+        fun_l16_n197(x)
+    else
+        fun_l16_n210(x)
+    end
+end
+
+def fun_l15_n736(x)
+    if (x < 1)
+        fun_l16_n227(x)
+    else
+        fun_l16_n82(x)
+    end
+end
+
+def fun_l15_n737(x)
+    if (x < 1)
+        fun_l16_n981(x)
+    else
+        fun_l16_n18(x)
+    end
+end
+
+def fun_l15_n738(x)
+    if (x < 1)
+        fun_l16_n673(x)
+    else
+        fun_l16_n452(x)
+    end
+end
+
+def fun_l15_n739(x)
+    if (x < 1)
+        fun_l16_n225(x)
+    else
+        fun_l16_n555(x)
+    end
+end
+
+def fun_l15_n740(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n29(x)
+    end
+end
+
+def fun_l15_n741(x)
+    if (x < 1)
+        fun_l16_n550(x)
+    else
+        fun_l16_n880(x)
+    end
+end
+
+def fun_l15_n742(x)
+    if (x < 1)
+        fun_l16_n930(x)
+    else
+        fun_l16_n280(x)
+    end
+end
+
+def fun_l15_n743(x)
+    if (x < 1)
+        fun_l16_n622(x)
+    else
+        fun_l16_n438(x)
+    end
+end
+
+def fun_l15_n744(x)
+    if (x < 1)
+        fun_l16_n874(x)
+    else
+        fun_l16_n921(x)
+    end
+end
+
+def fun_l15_n745(x)
+    if (x < 1)
+        fun_l16_n337(x)
+    else
+        fun_l16_n879(x)
+    end
+end
+
+def fun_l15_n746(x)
+    if (x < 1)
+        fun_l16_n668(x)
+    else
+        fun_l16_n858(x)
+    end
+end
+
+def fun_l15_n747(x)
+    if (x < 1)
+        fun_l16_n588(x)
+    else
+        fun_l16_n433(x)
+    end
+end
+
+def fun_l15_n748(x)
+    if (x < 1)
+        fun_l16_n263(x)
+    else
+        fun_l16_n389(x)
+    end
+end
+
+def fun_l15_n749(x)
+    if (x < 1)
+        fun_l16_n79(x)
+    else
+        fun_l16_n218(x)
+    end
+end
+
+def fun_l15_n750(x)
+    if (x < 1)
+        fun_l16_n586(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n751(x)
+    if (x < 1)
+        fun_l16_n29(x)
+    else
+        fun_l16_n183(x)
+    end
+end
+
+def fun_l15_n752(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n994(x)
+    end
+end
+
+def fun_l15_n753(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n754(x)
+    if (x < 1)
+        fun_l16_n58(x)
+    else
+        fun_l16_n980(x)
+    end
+end
+
+def fun_l15_n755(x)
+    if (x < 1)
+        fun_l16_n333(x)
+    else
+        fun_l16_n949(x)
+    end
+end
+
+def fun_l15_n756(x)
+    if (x < 1)
+        fun_l16_n846(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n757(x)
+    if (x < 1)
+        fun_l16_n341(x)
+    else
+        fun_l16_n200(x)
+    end
+end
+
+def fun_l15_n758(x)
+    if (x < 1)
+        fun_l16_n32(x)
+    else
+        fun_l16_n271(x)
+    end
+end
+
+def fun_l15_n759(x)
+    if (x < 1)
+        fun_l16_n654(x)
+    else
+        fun_l16_n978(x)
+    end
+end
+
+def fun_l15_n760(x)
+    if (x < 1)
+        fun_l16_n438(x)
+    else
+        fun_l16_n426(x)
+    end
+end
+
+def fun_l15_n761(x)
+    if (x < 1)
+        fun_l16_n218(x)
+    else
+        fun_l16_n393(x)
+    end
+end
+
+def fun_l15_n762(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n231(x)
+    end
+end
+
+def fun_l15_n763(x)
+    if (x < 1)
+        fun_l16_n957(x)
+    else
+        fun_l16_n801(x)
+    end
+end
+
+def fun_l15_n764(x)
+    if (x < 1)
+        fun_l16_n571(x)
+    else
+        fun_l16_n369(x)
+    end
+end
+
+def fun_l15_n765(x)
+    if (x < 1)
+        fun_l16_n806(x)
+    else
+        fun_l16_n527(x)
+    end
+end
+
+def fun_l15_n766(x)
+    if (x < 1)
+        fun_l16_n511(x)
+    else
+        fun_l16_n911(x)
+    end
+end
+
+def fun_l15_n767(x)
+    if (x < 1)
+        fun_l16_n589(x)
+    else
+        fun_l16_n468(x)
+    end
+end
+
+def fun_l15_n768(x)
+    if (x < 1)
+        fun_l16_n846(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n769(x)
+    if (x < 1)
+        fun_l16_n350(x)
+    else
+        fun_l16_n268(x)
+    end
+end
+
+def fun_l15_n770(x)
+    if (x < 1)
+        fun_l16_n200(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n771(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n442(x)
+    end
+end
+
+def fun_l15_n772(x)
+    if (x < 1)
+        fun_l16_n768(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n773(x)
+    if (x < 1)
+        fun_l16_n414(x)
+    else
+        fun_l16_n857(x)
+    end
+end
+
+def fun_l15_n774(x)
+    if (x < 1)
+        fun_l16_n654(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n775(x)
+    if (x < 1)
+        fun_l16_n283(x)
+    else
+        fun_l16_n565(x)
+    end
+end
+
+def fun_l15_n776(x)
+    if (x < 1)
+        fun_l16_n375(x)
+    else
+        fun_l16_n897(x)
+    end
+end
+
+def fun_l15_n777(x)
+    if (x < 1)
+        fun_l16_n711(x)
+    else
+        fun_l16_n487(x)
+    end
+end
+
+def fun_l15_n778(x)
+    if (x < 1)
+        fun_l16_n445(x)
+    else
+        fun_l16_n99(x)
+    end
+end
+
+def fun_l15_n779(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n614(x)
+    end
+end
+
+def fun_l15_n780(x)
+    if (x < 1)
+        fun_l16_n330(x)
+    else
+        fun_l16_n478(x)
+    end
+end
+
+def fun_l15_n781(x)
+    if (x < 1)
+        fun_l16_n680(x)
+    else
+        fun_l16_n882(x)
+    end
+end
+
+def fun_l15_n782(x)
+    if (x < 1)
+        fun_l16_n799(x)
+    else
+        fun_l16_n511(x)
+    end
+end
+
+def fun_l15_n783(x)
+    if (x < 1)
+        fun_l16_n630(x)
+    else
+        fun_l16_n946(x)
+    end
+end
+
+def fun_l15_n784(x)
+    if (x < 1)
+        fun_l16_n867(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n785(x)
+    if (x < 1)
+        fun_l16_n154(x)
+    else
+        fun_l16_n400(x)
+    end
+end
+
+def fun_l15_n786(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n224(x)
+    end
+end
+
+def fun_l15_n787(x)
+    if (x < 1)
+        fun_l16_n120(x)
+    else
+        fun_l16_n518(x)
+    end
+end
+
+def fun_l15_n788(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n789(x)
+    if (x < 1)
+        fun_l16_n965(x)
+    else
+        fun_l16_n760(x)
+    end
+end
+
+def fun_l15_n790(x)
+    if (x < 1)
+        fun_l16_n880(x)
+    else
+        fun_l16_n809(x)
+    end
+end
+
+def fun_l15_n791(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n61(x)
+    end
+end
+
+def fun_l15_n792(x)
+    if (x < 1)
+        fun_l16_n874(x)
+    else
+        fun_l16_n559(x)
+    end
+end
+
+def fun_l15_n793(x)
+    if (x < 1)
+        fun_l16_n896(x)
+    else
+        fun_l16_n72(x)
+    end
+end
+
+def fun_l15_n794(x)
+    if (x < 1)
+        fun_l16_n994(x)
+    else
+        fun_l16_n411(x)
+    end
+end
+
+def fun_l15_n795(x)
+    if (x < 1)
+        fun_l16_n289(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n796(x)
+    if (x < 1)
+        fun_l16_n190(x)
+    else
+        fun_l16_n693(x)
+    end
+end
+
+def fun_l15_n797(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n955(x)
+    end
+end
+
+def fun_l15_n798(x)
+    if (x < 1)
+        fun_l16_n572(x)
+    else
+        fun_l16_n626(x)
+    end
+end
+
+def fun_l15_n799(x)
+    if (x < 1)
+        fun_l16_n35(x)
+    else
+        fun_l16_n838(x)
+    end
+end
+
+def fun_l15_n800(x)
+    if (x < 1)
+        fun_l16_n423(x)
+    else
+        fun_l16_n834(x)
+    end
+end
+
+def fun_l15_n801(x)
+    if (x < 1)
+        fun_l16_n964(x)
+    else
+        fun_l16_n824(x)
+    end
+end
+
+def fun_l15_n802(x)
+    if (x < 1)
+        fun_l16_n77(x)
+    else
+        fun_l16_n62(x)
+    end
+end
+
+def fun_l15_n803(x)
+    if (x < 1)
+        fun_l16_n226(x)
+    else
+        fun_l16_n373(x)
+    end
+end
+
+def fun_l15_n804(x)
+    if (x < 1)
+        fun_l16_n832(x)
+    else
+        fun_l16_n915(x)
+    end
+end
+
+def fun_l15_n805(x)
+    if (x < 1)
+        fun_l16_n421(x)
+    else
+        fun_l16_n621(x)
+    end
+end
+
+def fun_l15_n806(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n713(x)
+    end
+end
+
+def fun_l15_n807(x)
+    if (x < 1)
+        fun_l16_n393(x)
+    else
+        fun_l16_n698(x)
+    end
+end
+
+def fun_l15_n808(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n341(x)
+    end
+end
+
+def fun_l15_n809(x)
+    if (x < 1)
+        fun_l16_n116(x)
+    else
+        fun_l16_n976(x)
+    end
+end
+
+def fun_l15_n810(x)
+    if (x < 1)
+        fun_l16_n873(x)
+    else
+        fun_l16_n822(x)
+    end
+end
+
+def fun_l15_n811(x)
+    if (x < 1)
+        fun_l16_n358(x)
+    else
+        fun_l16_n334(x)
+    end
+end
+
+def fun_l15_n812(x)
+    if (x < 1)
+        fun_l16_n599(x)
+    else
+        fun_l16_n527(x)
+    end
+end
+
+def fun_l15_n813(x)
+    if (x < 1)
+        fun_l16_n842(x)
+    else
+        fun_l16_n791(x)
+    end
+end
+
+def fun_l15_n814(x)
+    if (x < 1)
+        fun_l16_n45(x)
+    else
+        fun_l16_n280(x)
+    end
+end
+
+def fun_l15_n815(x)
+    if (x < 1)
+        fun_l16_n187(x)
+    else
+        fun_l16_n151(x)
+    end
+end
+
+def fun_l15_n816(x)
+    if (x < 1)
+        fun_l16_n8(x)
+    else
+        fun_l16_n409(x)
+    end
+end
+
+def fun_l15_n817(x)
+    if (x < 1)
+        fun_l16_n670(x)
+    else
+        fun_l16_n569(x)
+    end
+end
+
+def fun_l15_n818(x)
+    if (x < 1)
+        fun_l16_n344(x)
+    else
+        fun_l16_n618(x)
+    end
+end
+
+def fun_l15_n819(x)
+    if (x < 1)
+        fun_l16_n659(x)
+    else
+        fun_l16_n321(x)
+    end
+end
+
+def fun_l15_n820(x)
+    if (x < 1)
+        fun_l16_n890(x)
+    else
+        fun_l16_n911(x)
+    end
+end
+
+def fun_l15_n821(x)
+    if (x < 1)
+        fun_l16_n360(x)
+    else
+        fun_l16_n742(x)
+    end
+end
+
+def fun_l15_n822(x)
+    if (x < 1)
+        fun_l16_n166(x)
+    else
+        fun_l16_n803(x)
+    end
+end
+
+def fun_l15_n823(x)
+    if (x < 1)
+        fun_l16_n765(x)
+    else
+        fun_l16_n958(x)
+    end
+end
+
+def fun_l15_n824(x)
+    if (x < 1)
+        fun_l16_n439(x)
+    else
+        fun_l16_n931(x)
+    end
+end
+
+def fun_l15_n825(x)
+    if (x < 1)
+        fun_l16_n740(x)
+    else
+        fun_l16_n901(x)
+    end
+end
+
+def fun_l15_n826(x)
+    if (x < 1)
+        fun_l16_n223(x)
+    else
+        fun_l16_n878(x)
+    end
+end
+
+def fun_l15_n827(x)
+    if (x < 1)
+        fun_l16_n969(x)
+    else
+        fun_l16_n553(x)
+    end
+end
+
+def fun_l15_n828(x)
+    if (x < 1)
+        fun_l16_n42(x)
+    else
+        fun_l16_n915(x)
+    end
+end
+
+def fun_l15_n829(x)
+    if (x < 1)
+        fun_l16_n386(x)
+    else
+        fun_l16_n430(x)
+    end
+end
+
+def fun_l15_n830(x)
+    if (x < 1)
+        fun_l16_n164(x)
+    else
+        fun_l16_n337(x)
+    end
+end
+
+def fun_l15_n831(x)
+    if (x < 1)
+        fun_l16_n465(x)
+    else
+        fun_l16_n898(x)
+    end
+end
+
+def fun_l15_n832(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n688(x)
+    end
+end
+
+def fun_l15_n833(x)
+    if (x < 1)
+        fun_l16_n238(x)
+    else
+        fun_l16_n624(x)
+    end
+end
+
+def fun_l15_n834(x)
+    if (x < 1)
+        fun_l16_n973(x)
+    else
+        fun_l16_n507(x)
+    end
+end
+
+def fun_l15_n835(x)
+    if (x < 1)
+        fun_l16_n24(x)
+    else
+        fun_l16_n607(x)
+    end
+end
+
+def fun_l15_n836(x)
+    if (x < 1)
+        fun_l16_n307(x)
+    else
+        fun_l16_n265(x)
+    end
+end
+
+def fun_l15_n837(x)
+    if (x < 1)
+        fun_l16_n91(x)
+    else
+        fun_l16_n543(x)
+    end
+end
+
+def fun_l15_n838(x)
+    if (x < 1)
+        fun_l16_n544(x)
+    else
+        fun_l16_n397(x)
+    end
+end
+
+def fun_l15_n839(x)
+    if (x < 1)
+        fun_l16_n121(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n840(x)
+    if (x < 1)
+        fun_l16_n806(x)
+    else
+        fun_l16_n831(x)
+    end
+end
+
+def fun_l15_n841(x)
+    if (x < 1)
+        fun_l16_n629(x)
+    else
+        fun_l16_n553(x)
+    end
+end
+
+def fun_l15_n842(x)
+    if (x < 1)
+        fun_l16_n674(x)
+    else
+        fun_l16_n945(x)
+    end
+end
+
+def fun_l15_n843(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n469(x)
+    end
+end
+
+def fun_l15_n844(x)
+    if (x < 1)
+        fun_l16_n779(x)
+    else
+        fun_l16_n168(x)
+    end
+end
+
+def fun_l15_n845(x)
+    if (x < 1)
+        fun_l16_n258(x)
+    else
+        fun_l16_n501(x)
+    end
+end
+
+def fun_l15_n846(x)
+    if (x < 1)
+        fun_l16_n408(x)
+    else
+        fun_l16_n211(x)
+    end
+end
+
+def fun_l15_n847(x)
+    if (x < 1)
+        fun_l16_n844(x)
+    else
+        fun_l16_n458(x)
+    end
+end
+
+def fun_l15_n848(x)
+    if (x < 1)
+        fun_l16_n565(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n849(x)
+    if (x < 1)
+        fun_l16_n111(x)
+    else
+        fun_l16_n995(x)
+    end
+end
+
+def fun_l15_n850(x)
+    if (x < 1)
+        fun_l16_n883(x)
+    else
+        fun_l16_n776(x)
+    end
+end
+
+def fun_l15_n851(x)
+    if (x < 1)
+        fun_l16_n821(x)
+    else
+        fun_l16_n352(x)
+    end
+end
+
+def fun_l15_n852(x)
+    if (x < 1)
+        fun_l16_n977(x)
+    else
+        fun_l16_n520(x)
+    end
+end
+
+def fun_l15_n853(x)
+    if (x < 1)
+        fun_l16_n602(x)
+    else
+        fun_l16_n88(x)
+    end
+end
+
+def fun_l15_n854(x)
+    if (x < 1)
+        fun_l16_n819(x)
+    else
+        fun_l16_n177(x)
+    end
+end
+
+def fun_l15_n855(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n648(x)
+    end
+end
+
+def fun_l15_n856(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n134(x)
+    end
+end
+
+def fun_l15_n857(x)
+    if (x < 1)
+        fun_l16_n728(x)
+    else
+        fun_l16_n282(x)
+    end
+end
+
+def fun_l15_n858(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n725(x)
+    end
+end
+
+def fun_l15_n859(x)
+    if (x < 1)
+        fun_l16_n140(x)
+    else
+        fun_l16_n12(x)
+    end
+end
+
+def fun_l15_n860(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n159(x)
+    end
+end
+
+def fun_l15_n861(x)
+    if (x < 1)
+        fun_l16_n366(x)
+    else
+        fun_l16_n97(x)
+    end
+end
+
+def fun_l15_n862(x)
+    if (x < 1)
+        fun_l16_n812(x)
+    else
+        fun_l16_n178(x)
+    end
+end
+
+def fun_l15_n863(x)
+    if (x < 1)
+        fun_l16_n491(x)
+    else
+        fun_l16_n167(x)
+    end
+end
+
+def fun_l15_n864(x)
+    if (x < 1)
+        fun_l16_n280(x)
+    else
+        fun_l16_n463(x)
+    end
+end
+
+def fun_l15_n865(x)
+    if (x < 1)
+        fun_l16_n405(x)
+    else
+        fun_l16_n108(x)
+    end
+end
+
+def fun_l15_n866(x)
+    if (x < 1)
+        fun_l16_n956(x)
+    else
+        fun_l16_n840(x)
+    end
+end
+
+def fun_l15_n867(x)
+    if (x < 1)
+        fun_l16_n866(x)
+    else
+        fun_l16_n291(x)
+    end
+end
+
+def fun_l15_n868(x)
+    if (x < 1)
+        fun_l16_n176(x)
+    else
+        fun_l16_n192(x)
+    end
+end
+
+def fun_l15_n869(x)
+    if (x < 1)
+        fun_l16_n833(x)
+    else
+        fun_l16_n503(x)
+    end
+end
+
+def fun_l15_n870(x)
+    if (x < 1)
+        fun_l16_n648(x)
+    else
+        fun_l16_n778(x)
+    end
+end
+
+def fun_l15_n871(x)
+    if (x < 1)
+        fun_l16_n237(x)
+    else
+        fun_l16_n206(x)
+    end
+end
+
+def fun_l15_n872(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n868(x)
+    end
+end
+
+def fun_l15_n873(x)
+    if (x < 1)
+        fun_l16_n547(x)
+    else
+        fun_l16_n731(x)
+    end
+end
+
+def fun_l15_n874(x)
+    if (x < 1)
+        fun_l16_n870(x)
+    else
+        fun_l16_n43(x)
+    end
+end
+
+def fun_l15_n875(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n654(x)
+    end
+end
+
+def fun_l15_n876(x)
+    if (x < 1)
+        fun_l16_n570(x)
+    else
+        fun_l16_n842(x)
+    end
+end
+
+def fun_l15_n877(x)
+    if (x < 1)
+        fun_l16_n272(x)
+    else
+        fun_l16_n784(x)
+    end
+end
+
+def fun_l15_n878(x)
+    if (x < 1)
+        fun_l16_n702(x)
+    else
+        fun_l16_n758(x)
+    end
+end
+
+def fun_l15_n879(x)
+    if (x < 1)
+        fun_l16_n691(x)
+    else
+        fun_l16_n303(x)
+    end
+end
+
+def fun_l15_n880(x)
+    if (x < 1)
+        fun_l16_n944(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n881(x)
+    if (x < 1)
+        fun_l16_n741(x)
+    else
+        fun_l16_n254(x)
+    end
+end
+
+def fun_l15_n882(x)
+    if (x < 1)
+        fun_l16_n195(x)
+    else
+        fun_l16_n294(x)
+    end
+end
+
+def fun_l15_n883(x)
+    if (x < 1)
+        fun_l16_n776(x)
+    else
+        fun_l16_n147(x)
+    end
+end
+
+def fun_l15_n884(x)
+    if (x < 1)
+        fun_l16_n145(x)
+    else
+        fun_l16_n856(x)
+    end
+end
+
+def fun_l15_n885(x)
+    if (x < 1)
+        fun_l16_n671(x)
+    else
+        fun_l16_n429(x)
+    end
+end
+
+def fun_l15_n886(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n455(x)
+    end
+end
+
+def fun_l15_n887(x)
+    if (x < 1)
+        fun_l16_n775(x)
+    else
+        fun_l16_n43(x)
+    end
+end
+
+def fun_l15_n888(x)
+    if (x < 1)
+        fun_l16_n936(x)
+    else
+        fun_l16_n642(x)
+    end
+end
+
+def fun_l15_n889(x)
+    if (x < 1)
+        fun_l16_n794(x)
+    else
+        fun_l16_n277(x)
+    end
+end
+
+def fun_l15_n890(x)
+    if (x < 1)
+        fun_l16_n72(x)
+    else
+        fun_l16_n450(x)
+    end
+end
+
+def fun_l15_n891(x)
+    if (x < 1)
+        fun_l16_n417(x)
+    else
+        fun_l16_n5(x)
+    end
+end
+
+def fun_l15_n892(x)
+    if (x < 1)
+        fun_l16_n69(x)
+    else
+        fun_l16_n355(x)
+    end
+end
+
+def fun_l15_n893(x)
+    if (x < 1)
+        fun_l16_n352(x)
+    else
+        fun_l16_n635(x)
+    end
+end
+
+def fun_l15_n894(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n16(x)
+    end
+end
+
+def fun_l15_n895(x)
+    if (x < 1)
+        fun_l16_n922(x)
+    else
+        fun_l16_n440(x)
+    end
+end
+
+def fun_l15_n896(x)
+    if (x < 1)
+        fun_l16_n808(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n897(x)
+    if (x < 1)
+        fun_l16_n736(x)
+    else
+        fun_l16_n596(x)
+    end
+end
+
+def fun_l15_n898(x)
+    if (x < 1)
+        fun_l16_n886(x)
+    else
+        fun_l16_n386(x)
+    end
+end
+
+def fun_l15_n899(x)
+    if (x < 1)
+        fun_l16_n374(x)
+    else
+        fun_l16_n746(x)
+    end
+end
+
+def fun_l15_n900(x)
+    if (x < 1)
+        fun_l16_n623(x)
+    else
+        fun_l16_n329(x)
+    end
+end
+
+def fun_l15_n901(x)
+    if (x < 1)
+        fun_l16_n313(x)
+    else
+        fun_l16_n102(x)
+    end
+end
+
+def fun_l15_n902(x)
+    if (x < 1)
+        fun_l16_n234(x)
+    else
+        fun_l16_n425(x)
+    end
+end
+
+def fun_l15_n903(x)
+    if (x < 1)
+        fun_l16_n836(x)
+    else
+        fun_l16_n492(x)
+    end
+end
+
+def fun_l15_n904(x)
+    if (x < 1)
+        fun_l16_n690(x)
+    else
+        fun_l16_n241(x)
+    end
+end
+
+def fun_l15_n905(x)
+    if (x < 1)
+        fun_l16_n129(x)
+    else
+        fun_l16_n57(x)
+    end
+end
+
+def fun_l15_n906(x)
+    if (x < 1)
+        fun_l16_n50(x)
+    else
+        fun_l16_n24(x)
+    end
+end
+
+def fun_l15_n907(x)
+    if (x < 1)
+        fun_l16_n609(x)
+    else
+        fun_l16_n4(x)
+    end
+end
+
+def fun_l15_n908(x)
+    if (x < 1)
+        fun_l16_n483(x)
+    else
+        fun_l16_n708(x)
+    end
+end
+
+def fun_l15_n909(x)
+    if (x < 1)
+        fun_l16_n656(x)
+    else
+        fun_l16_n234(x)
+    end
+end
+
+def fun_l15_n910(x)
+    if (x < 1)
+        fun_l16_n945(x)
+    else
+        fun_l16_n753(x)
+    end
+end
+
+def fun_l15_n911(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n739(x)
+    end
+end
+
+def fun_l15_n912(x)
+    if (x < 1)
+        fun_l16_n855(x)
+    else
+        fun_l16_n518(x)
+    end
+end
+
+def fun_l15_n913(x)
+    if (x < 1)
+        fun_l16_n295(x)
+    else
+        fun_l16_n719(x)
+    end
+end
+
+def fun_l15_n914(x)
+    if (x < 1)
+        fun_l16_n442(x)
+    else
+        fun_l16_n803(x)
+    end
+end
+
+def fun_l15_n915(x)
+    if (x < 1)
+        fun_l16_n672(x)
+    else
+        fun_l16_n935(x)
+    end
+end
+
+def fun_l15_n916(x)
+    if (x < 1)
+        fun_l16_n908(x)
+    else
+        fun_l16_n900(x)
+    end
+end
+
+def fun_l15_n917(x)
+    if (x < 1)
+        fun_l16_n853(x)
+    else
+        fun_l16_n896(x)
+    end
+end
+
+def fun_l15_n918(x)
+    if (x < 1)
+        fun_l16_n90(x)
+    else
+        fun_l16_n56(x)
+    end
+end
+
+def fun_l15_n919(x)
+    if (x < 1)
+        fun_l16_n944(x)
+    else
+        fun_l16_n763(x)
+    end
+end
+
+def fun_l15_n920(x)
+    if (x < 1)
+        fun_l16_n303(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n921(x)
+    if (x < 1)
+        fun_l16_n599(x)
+    else
+        fun_l16_n648(x)
+    end
+end
+
+def fun_l15_n922(x)
+    if (x < 1)
+        fun_l16_n113(x)
+    else
+        fun_l16_n665(x)
+    end
+end
+
+def fun_l15_n923(x)
+    if (x < 1)
+        fun_l16_n97(x)
+    else
+        fun_l16_n757(x)
+    end
+end
+
+def fun_l15_n924(x)
+    if (x < 1)
+        fun_l16_n815(x)
+    else
+        fun_l16_n821(x)
+    end
+end
+
+def fun_l15_n925(x)
+    if (x < 1)
+        fun_l16_n146(x)
+    else
+        fun_l16_n970(x)
+    end
+end
+
+def fun_l15_n926(x)
+    if (x < 1)
+        fun_l16_n74(x)
+    else
+        fun_l16_n203(x)
+    end
+end
+
+def fun_l15_n927(x)
+    if (x < 1)
+        fun_l16_n573(x)
+    else
+        fun_l16_n763(x)
+    end
+end
+
+def fun_l15_n928(x)
+    if (x < 1)
+        fun_l16_n656(x)
+    else
+        fun_l16_n691(x)
+    end
+end
+
+def fun_l15_n929(x)
+    if (x < 1)
+        fun_l16_n240(x)
+    else
+        fun_l16_n536(x)
+    end
+end
+
+def fun_l15_n930(x)
+    if (x < 1)
+        fun_l16_n168(x)
+    else
+        fun_l16_n145(x)
+    end
+end
+
+def fun_l15_n931(x)
+    if (x < 1)
+        fun_l16_n502(x)
+    else
+        fun_l16_n603(x)
+    end
+end
+
+def fun_l15_n932(x)
+    if (x < 1)
+        fun_l16_n998(x)
+    else
+        fun_l16_n259(x)
+    end
+end
+
+def fun_l15_n933(x)
+    if (x < 1)
+        fun_l16_n633(x)
+    else
+        fun_l16_n66(x)
+    end
+end
+
+def fun_l15_n934(x)
+    if (x < 1)
+        fun_l16_n657(x)
+    else
+        fun_l16_n727(x)
+    end
+end
+
+def fun_l15_n935(x)
+    if (x < 1)
+        fun_l16_n641(x)
+    else
+        fun_l16_n975(x)
+    end
+end
+
+def fun_l15_n936(x)
+    if (x < 1)
+        fun_l16_n610(x)
+    else
+        fun_l16_n256(x)
+    end
+end
+
+def fun_l15_n937(x)
+    if (x < 1)
+        fun_l16_n760(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n938(x)
+    if (x < 1)
+        fun_l16_n395(x)
+    else
+        fun_l16_n302(x)
+    end
+end
+
+def fun_l15_n939(x)
+    if (x < 1)
+        fun_l16_n810(x)
+    else
+        fun_l16_n549(x)
+    end
+end
+
+def fun_l15_n940(x)
+    if (x < 1)
+        fun_l16_n452(x)
+    else
+        fun_l16_n914(x)
+    end
+end
+
+def fun_l15_n941(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n328(x)
+    end
+end
+
+def fun_l15_n942(x)
+    if (x < 1)
+        fun_l16_n886(x)
+    else
+        fun_l16_n535(x)
+    end
+end
+
+def fun_l15_n943(x)
+    if (x < 1)
+        fun_l16_n162(x)
+    else
+        fun_l16_n449(x)
+    end
+end
+
+def fun_l15_n944(x)
+    if (x < 1)
+        fun_l16_n152(x)
+    else
+        fun_l16_n790(x)
+    end
+end
+
+def fun_l15_n945(x)
+    if (x < 1)
+        fun_l16_n228(x)
+    else
+        fun_l16_n391(x)
+    end
+end
+
+def fun_l15_n946(x)
+    if (x < 1)
+        fun_l16_n115(x)
+    else
+        fun_l16_n371(x)
+    end
+end
+
+def fun_l15_n947(x)
+    if (x < 1)
+        fun_l16_n359(x)
+    else
+        fun_l16_n928(x)
+    end
+end
+
+def fun_l15_n948(x)
+    if (x < 1)
+        fun_l16_n246(x)
+    else
+        fun_l16_n907(x)
+    end
+end
+
+def fun_l15_n949(x)
+    if (x < 1)
+        fun_l16_n448(x)
+    else
+        fun_l16_n845(x)
+    end
+end
+
+def fun_l15_n950(x)
+    if (x < 1)
+        fun_l16_n457(x)
+    else
+        fun_l16_n954(x)
+    end
+end
+
+def fun_l15_n951(x)
+    if (x < 1)
+        fun_l16_n627(x)
+    else
+        fun_l16_n684(x)
+    end
+end
+
+def fun_l15_n952(x)
+    if (x < 1)
+        fun_l16_n887(x)
+    else
+        fun_l16_n928(x)
+    end
+end
+
+def fun_l15_n953(x)
+    if (x < 1)
+        fun_l16_n782(x)
+    else
+        fun_l16_n619(x)
+    end
+end
+
+def fun_l15_n954(x)
+    if (x < 1)
+        fun_l16_n436(x)
+    else
+        fun_l16_n745(x)
+    end
+end
+
+def fun_l15_n955(x)
+    if (x < 1)
+        fun_l16_n9(x)
+    else
+        fun_l16_n604(x)
+    end
+end
+
+def fun_l15_n956(x)
+    if (x < 1)
+        fun_l16_n149(x)
+    else
+        fun_l16_n357(x)
+    end
+end
+
+def fun_l15_n957(x)
+    if (x < 1)
+        fun_l16_n664(x)
+    else
+        fun_l16_n371(x)
+    end
+end
+
+def fun_l15_n958(x)
+    if (x < 1)
+        fun_l16_n236(x)
+    else
+        fun_l16_n402(x)
+    end
+end
+
+def fun_l15_n959(x)
+    if (x < 1)
+        fun_l16_n681(x)
+    else
+        fun_l16_n410(x)
+    end
+end
+
+def fun_l15_n960(x)
+    if (x < 1)
+        fun_l16_n909(x)
+    else
+        fun_l16_n958(x)
+    end
+end
+
+def fun_l15_n961(x)
+    if (x < 1)
+        fun_l16_n400(x)
+    else
+        fun_l16_n497(x)
+    end
+end
+
+def fun_l15_n962(x)
+    if (x < 1)
+        fun_l16_n949(x)
+    else
+        fun_l16_n794(x)
+    end
+end
+
+def fun_l15_n963(x)
+    if (x < 1)
+        fun_l16_n774(x)
+    else
+        fun_l16_n770(x)
+    end
+end
+
+def fun_l15_n964(x)
+    if (x < 1)
+        fun_l16_n573(x)
+    else
+        fun_l16_n73(x)
+    end
+end
+
+def fun_l15_n965(x)
+    if (x < 1)
+        fun_l16_n33(x)
+    else
+        fun_l16_n978(x)
+    end
+end
+
+def fun_l15_n966(x)
+    if (x < 1)
+        fun_l16_n8(x)
+    else
+        fun_l16_n542(x)
+    end
+end
+
+def fun_l15_n967(x)
+    if (x < 1)
+        fun_l16_n780(x)
+    else
+        fun_l16_n96(x)
+    end
+end
+
+def fun_l15_n968(x)
+    if (x < 1)
+        fun_l16_n75(x)
+    else
+        fun_l16_n560(x)
+    end
+end
+
+def fun_l15_n969(x)
+    if (x < 1)
+        fun_l16_n950(x)
+    else
+        fun_l16_n610(x)
+    end
+end
+
+def fun_l15_n970(x)
+    if (x < 1)
+        fun_l16_n254(x)
+    else
+        fun_l16_n2(x)
+    end
+end
+
+def fun_l15_n971(x)
+    if (x < 1)
+        fun_l16_n793(x)
+    else
+        fun_l16_n89(x)
+    end
+end
+
+def fun_l15_n972(x)
+    if (x < 1)
+        fun_l16_n409(x)
+    else
+        fun_l16_n967(x)
+    end
+end
+
+def fun_l15_n973(x)
+    if (x < 1)
+        fun_l16_n356(x)
+    else
+        fun_l16_n421(x)
+    end
+end
+
+def fun_l15_n974(x)
+    if (x < 1)
+        fun_l16_n539(x)
+    else
+        fun_l16_n997(x)
+    end
+end
+
+def fun_l15_n975(x)
+    if (x < 1)
+        fun_l16_n772(x)
+    else
+        fun_l16_n304(x)
+    end
+end
+
+def fun_l15_n976(x)
+    if (x < 1)
+        fun_l16_n228(x)
+    else
+        fun_l16_n420(x)
+    end
+end
+
+def fun_l15_n977(x)
+    if (x < 1)
+        fun_l16_n508(x)
+    else
+        fun_l16_n352(x)
+    end
+end
+
+def fun_l15_n978(x)
+    if (x < 1)
+        fun_l16_n878(x)
+    else
+        fun_l16_n316(x)
+    end
+end
+
+def fun_l15_n979(x)
+    if (x < 1)
+        fun_l16_n279(x)
+    else
+        fun_l16_n325(x)
+    end
+end
+
+def fun_l15_n980(x)
+    if (x < 1)
+        fun_l16_n98(x)
+    else
+        fun_l16_n10(x)
+    end
+end
+
+def fun_l15_n981(x)
+    if (x < 1)
+        fun_l16_n320(x)
+    else
+        fun_l16_n578(x)
+    end
+end
+
+def fun_l15_n982(x)
+    if (x < 1)
+        fun_l16_n112(x)
+    else
+        fun_l16_n353(x)
+    end
+end
+
+def fun_l15_n983(x)
+    if (x < 1)
+        fun_l16_n579(x)
+    else
+        fun_l16_n946(x)
+    end
+end
+
+def fun_l15_n984(x)
+    if (x < 1)
+        fun_l16_n183(x)
+    else
+        fun_l16_n638(x)
+    end
+end
+
+def fun_l15_n985(x)
+    if (x < 1)
+        fun_l16_n500(x)
+    else
+        fun_l16_n11(x)
+    end
+end
+
+def fun_l15_n986(x)
+    if (x < 1)
+        fun_l16_n773(x)
+    else
+        fun_l16_n135(x)
+    end
+end
+
+def fun_l15_n987(x)
+    if (x < 1)
+        fun_l16_n997(x)
+    else
+        fun_l16_n645(x)
+    end
+end
+
+def fun_l15_n988(x)
+    if (x < 1)
+        fun_l16_n392(x)
+    else
+        fun_l16_n172(x)
+    end
+end
+
+def fun_l15_n989(x)
+    if (x < 1)
+        fun_l16_n150(x)
+    else
+        fun_l16_n163(x)
+    end
+end
+
+def fun_l15_n990(x)
+    if (x < 1)
+        fun_l16_n351(x)
+    else
+        fun_l16_n297(x)
+    end
+end
+
+def fun_l15_n991(x)
+    if (x < 1)
+        fun_l16_n676(x)
+    else
+        fun_l16_n31(x)
+    end
+end
+
+def fun_l15_n992(x)
+    if (x < 1)
+        fun_l16_n257(x)
+    else
+        fun_l16_n45(x)
+    end
+end
+
+def fun_l15_n993(x)
+    if (x < 1)
+        fun_l16_n971(x)
+    else
+        fun_l16_n60(x)
+    end
+end
+
+def fun_l15_n994(x)
+    if (x < 1)
+        fun_l16_n472(x)
+    else
+        fun_l16_n774(x)
+    end
+end
+
+def fun_l15_n995(x)
+    if (x < 1)
+        fun_l16_n559(x)
+    else
+        fun_l16_n605(x)
+    end
+end
+
+def fun_l15_n996(x)
+    if (x < 1)
+        fun_l16_n122(x)
+    else
+        fun_l16_n695(x)
+    end
+end
+
+def fun_l15_n997(x)
+    if (x < 1)
+        fun_l16_n118(x)
+    else
+        fun_l16_n613(x)
+    end
+end
+
+def fun_l15_n998(x)
+    if (x < 1)
+        fun_l16_n973(x)
+    else
+        fun_l16_n193(x)
+    end
+end
+
+def fun_l15_n999(x)
+    if (x < 1)
+        fun_l16_n652(x)
+    else
+        fun_l16_n658(x)
+    end
+end
+
+def fun_l16_n0(x)
+    if (x < 1)
+        fun_l17_n352(x)
+    else
+        fun_l17_n155(x)
+    end
+end
+
+def fun_l16_n1(x)
+    if (x < 1)
+        fun_l17_n786(x)
+    else
+        fun_l17_n961(x)
+    end
+end
+
+def fun_l16_n2(x)
+    if (x < 1)
+        fun_l17_n760(x)
+    else
+        fun_l17_n629(x)
+    end
+end
+
+def fun_l16_n3(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n4(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n616(x)
+    end
+end
+
+def fun_l16_n5(x)
+    if (x < 1)
+        fun_l17_n470(x)
+    else
+        fun_l17_n859(x)
+    end
+end
+
+def fun_l16_n6(x)
+    if (x < 1)
+        fun_l17_n830(x)
+    else
+        fun_l17_n987(x)
+    end
+end
+
+def fun_l16_n7(x)
+    if (x < 1)
+        fun_l17_n339(x)
+    else
+        fun_l17_n284(x)
+    end
+end
+
+def fun_l16_n8(x)
+    if (x < 1)
+        fun_l17_n677(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n9(x)
+    if (x < 1)
+        fun_l17_n7(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n10(x)
+    if (x < 1)
+        fun_l17_n275(x)
+    else
+        fun_l17_n37(x)
+    end
+end
+
+def fun_l16_n11(x)
+    if (x < 1)
+        fun_l17_n406(x)
+    else
+        fun_l17_n588(x)
+    end
+end
+
+def fun_l16_n12(x)
+    if (x < 1)
+        fun_l17_n132(x)
+    else
+        fun_l17_n208(x)
+    end
+end
+
+def fun_l16_n13(x)
+    if (x < 1)
+        fun_l17_n87(x)
+    else
+        fun_l17_n850(x)
+    end
+end
+
+def fun_l16_n14(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n15(x)
+    if (x < 1)
+        fun_l17_n176(x)
+    else
+        fun_l17_n966(x)
+    end
+end
+
+def fun_l16_n16(x)
+    if (x < 1)
+        fun_l17_n825(x)
+    else
+        fun_l17_n815(x)
+    end
+end
+
+def fun_l16_n17(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n18(x)
+    if (x < 1)
+        fun_l17_n166(x)
+    else
+        fun_l17_n732(x)
+    end
+end
+
+def fun_l16_n19(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n20(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n304(x)
+    end
+end
+
+def fun_l16_n21(x)
+    if (x < 1)
+        fun_l17_n545(x)
+    else
+        fun_l17_n221(x)
+    end
+end
+
+def fun_l16_n22(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n143(x)
+    end
+end
+
+def fun_l16_n23(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n24(x)
+    if (x < 1)
+        fun_l17_n490(x)
+    else
+        fun_l17_n327(x)
+    end
+end
+
+def fun_l16_n25(x)
+    if (x < 1)
+        fun_l17_n588(x)
+    else
+        fun_l17_n658(x)
+    end
+end
+
+def fun_l16_n26(x)
+    if (x < 1)
+        fun_l17_n555(x)
+    else
+        fun_l17_n507(x)
+    end
+end
+
+def fun_l16_n27(x)
+    if (x < 1)
+        fun_l17_n228(x)
+    else
+        fun_l17_n808(x)
+    end
+end
+
+def fun_l16_n28(x)
+    if (x < 1)
+        fun_l17_n705(x)
+    else
+        fun_l17_n696(x)
+    end
+end
+
+def fun_l16_n29(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n913(x)
+    end
+end
+
+def fun_l16_n30(x)
+    if (x < 1)
+        fun_l17_n264(x)
+    else
+        fun_l17_n287(x)
+    end
+end
+
+def fun_l16_n31(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n358(x)
+    end
+end
+
+def fun_l16_n32(x)
+    if (x < 1)
+        fun_l17_n102(x)
+    else
+        fun_l17_n303(x)
+    end
+end
+
+def fun_l16_n33(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n921(x)
+    end
+end
+
+def fun_l16_n34(x)
+    if (x < 1)
+        fun_l17_n637(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n35(x)
+    if (x < 1)
+        fun_l17_n8(x)
+    else
+        fun_l17_n752(x)
+    end
+end
+
+def fun_l16_n36(x)
+    if (x < 1)
+        fun_l17_n748(x)
+    else
+        fun_l17_n956(x)
+    end
+end
+
+def fun_l16_n37(x)
+    if (x < 1)
+        fun_l17_n985(x)
+    else
+        fun_l17_n133(x)
+    end
+end
+
+def fun_l16_n38(x)
+    if (x < 1)
+        fun_l17_n422(x)
+    else
+        fun_l17_n608(x)
+    end
+end
+
+def fun_l16_n39(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n40(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n874(x)
+    end
+end
+
+def fun_l16_n41(x)
+    if (x < 1)
+        fun_l17_n299(x)
+    else
+        fun_l17_n971(x)
+    end
+end
+
+def fun_l16_n42(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n535(x)
+    end
+end
+
+def fun_l16_n43(x)
+    if (x < 1)
+        fun_l17_n282(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n44(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n45(x)
+    if (x < 1)
+        fun_l17_n750(x)
+    else
+        fun_l17_n725(x)
+    end
+end
+
+def fun_l16_n46(x)
+    if (x < 1)
+        fun_l17_n227(x)
+    else
+        fun_l17_n769(x)
+    end
+end
+
+def fun_l16_n47(x)
+    if (x < 1)
+        fun_l17_n348(x)
+    else
+        fun_l17_n83(x)
+    end
+end
+
+def fun_l16_n48(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n398(x)
+    end
+end
+
+def fun_l16_n49(x)
+    if (x < 1)
+        fun_l17_n645(x)
+    else
+        fun_l17_n645(x)
+    end
+end
+
+def fun_l16_n50(x)
+    if (x < 1)
+        fun_l17_n191(x)
+    else
+        fun_l17_n256(x)
+    end
+end
+
+def fun_l16_n51(x)
+    if (x < 1)
+        fun_l17_n947(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n52(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n53(x)
+    if (x < 1)
+        fun_l17_n867(x)
+    else
+        fun_l17_n520(x)
+    end
+end
+
+def fun_l16_n54(x)
+    if (x < 1)
+        fun_l17_n450(x)
+    else
+        fun_l17_n864(x)
+    end
+end
+
+def fun_l16_n55(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n370(x)
+    end
+end
+
+def fun_l16_n56(x)
+    if (x < 1)
+        fun_l17_n754(x)
+    else
+        fun_l17_n919(x)
+    end
+end
+
+def fun_l16_n57(x)
+    if (x < 1)
+        fun_l17_n360(x)
+    else
+        fun_l17_n513(x)
+    end
+end
+
+def fun_l16_n58(x)
+    if (x < 1)
+        fun_l17_n436(x)
+    else
+        fun_l17_n618(x)
+    end
+end
+
+def fun_l16_n59(x)
+    if (x < 1)
+        fun_l17_n795(x)
+    else
+        fun_l17_n851(x)
+    end
+end
+
+def fun_l16_n60(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n305(x)
+    end
+end
+
+def fun_l16_n61(x)
+    if (x < 1)
+        fun_l17_n520(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n62(x)
+    if (x < 1)
+        fun_l17_n297(x)
+    else
+        fun_l17_n218(x)
+    end
+end
+
+def fun_l16_n63(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n64(x)
+    if (x < 1)
+        fun_l17_n800(x)
+    else
+        fun_l17_n985(x)
+    end
+end
+
+def fun_l16_n65(x)
+    if (x < 1)
+        fun_l17_n875(x)
+    else
+        fun_l17_n821(x)
+    end
+end
+
+def fun_l16_n66(x)
+    if (x < 1)
+        fun_l17_n677(x)
+    else
+        fun_l17_n705(x)
+    end
+end
+
+def fun_l16_n67(x)
+    if (x < 1)
+        fun_l17_n643(x)
+    else
+        fun_l17_n240(x)
+    end
+end
+
+def fun_l16_n68(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n69(x)
+    if (x < 1)
+        fun_l17_n987(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n70(x)
+    if (x < 1)
+        fun_l17_n546(x)
+    else
+        fun_l17_n95(x)
+    end
+end
+
+def fun_l16_n71(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n260(x)
+    end
+end
+
+def fun_l16_n72(x)
+    if (x < 1)
+        fun_l17_n118(x)
+    else
+        fun_l17_n110(x)
+    end
+end
+
+def fun_l16_n73(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n602(x)
+    end
+end
+
+def fun_l16_n74(x)
+    if (x < 1)
+        fun_l17_n725(x)
+    else
+        fun_l17_n606(x)
+    end
+end
+
+def fun_l16_n75(x)
+    if (x < 1)
+        fun_l17_n114(x)
+    else
+        fun_l17_n336(x)
+    end
+end
+
+def fun_l16_n76(x)
+    if (x < 1)
+        fun_l17_n930(x)
+    else
+        fun_l17_n513(x)
+    end
+end
+
+def fun_l16_n77(x)
+    if (x < 1)
+        fun_l17_n217(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n78(x)
+    if (x < 1)
+        fun_l17_n987(x)
+    else
+        fun_l17_n538(x)
+    end
+end
+
+def fun_l16_n79(x)
+    if (x < 1)
+        fun_l17_n467(x)
+    else
+        fun_l17_n675(x)
+    end
+end
+
+def fun_l16_n80(x)
+    if (x < 1)
+        fun_l17_n553(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n81(x)
+    if (x < 1)
+        fun_l17_n643(x)
+    else
+        fun_l17_n156(x)
+    end
+end
+
+def fun_l16_n82(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n300(x)
+    end
+end
+
+def fun_l16_n83(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n637(x)
+    end
+end
+
+def fun_l16_n84(x)
+    if (x < 1)
+        fun_l17_n71(x)
+    else
+        fun_l17_n979(x)
+    end
+end
+
+def fun_l16_n85(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n893(x)
+    end
+end
+
+def fun_l16_n86(x)
+    if (x < 1)
+        fun_l17_n734(x)
+    else
+        fun_l17_n254(x)
+    end
+end
+
+def fun_l16_n87(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n88(x)
+    if (x < 1)
+        fun_l17_n931(x)
+    else
+        fun_l17_n110(x)
+    end
+end
+
+def fun_l16_n89(x)
+    if (x < 1)
+        fun_l17_n957(x)
+    else
+        fun_l17_n489(x)
+    end
+end
+
+def fun_l16_n90(x)
+    if (x < 1)
+        fun_l17_n145(x)
+    else
+        fun_l17_n861(x)
+    end
+end
+
+def fun_l16_n91(x)
+    if (x < 1)
+        fun_l17_n276(x)
+    else
+        fun_l17_n967(x)
+    end
+end
+
+def fun_l16_n92(x)
+    if (x < 1)
+        fun_l17_n657(x)
+    else
+        fun_l17_n638(x)
+    end
+end
+
+def fun_l16_n93(x)
+    if (x < 1)
+        fun_l17_n714(x)
+    else
+        fun_l17_n52(x)
+    end
+end
+
+def fun_l16_n94(x)
+    if (x < 1)
+        fun_l17_n487(x)
+    else
+        fun_l17_n380(x)
+    end
+end
+
+def fun_l16_n95(x)
+    if (x < 1)
+        fun_l17_n58(x)
+    else
+        fun_l17_n67(x)
+    end
+end
+
+def fun_l16_n96(x)
+    if (x < 1)
+        fun_l17_n9(x)
+    else
+        fun_l17_n896(x)
+    end
+end
+
+def fun_l16_n97(x)
+    if (x < 1)
+        fun_l17_n723(x)
+    else
+        fun_l17_n16(x)
+    end
+end
+
+def fun_l16_n98(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n31(x)
+    end
+end
+
+def fun_l16_n99(x)
+    if (x < 1)
+        fun_l17_n33(x)
+    else
+        fun_l17_n615(x)
+    end
+end
+
+def fun_l16_n100(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n83(x)
+    end
+end
+
+def fun_l16_n101(x)
+    if (x < 1)
+        fun_l17_n694(x)
+    else
+        fun_l17_n851(x)
+    end
+end
+
+def fun_l16_n102(x)
+    if (x < 1)
+        fun_l17_n31(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n103(x)
+    if (x < 1)
+        fun_l17_n739(x)
+    else
+        fun_l17_n680(x)
+    end
+end
+
+def fun_l16_n104(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n105(x)
+    if (x < 1)
+        fun_l17_n526(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n106(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n738(x)
+    end
+end
+
+def fun_l16_n107(x)
+    if (x < 1)
+        fun_l17_n48(x)
+    else
+        fun_l17_n107(x)
+    end
+end
+
+def fun_l16_n108(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n109(x)
+    if (x < 1)
+        fun_l17_n101(x)
+    else
+        fun_l17_n295(x)
+    end
+end
+
+def fun_l16_n110(x)
+    if (x < 1)
+        fun_l17_n257(x)
+    else
+        fun_l17_n132(x)
+    end
+end
+
+def fun_l16_n111(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n635(x)
+    end
+end
+
+def fun_l16_n112(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n113(x)
+    if (x < 1)
+        fun_l17_n973(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n114(x)
+    if (x < 1)
+        fun_l17_n110(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n115(x)
+    if (x < 1)
+        fun_l17_n769(x)
+    else
+        fun_l17_n872(x)
+    end
+end
+
+def fun_l16_n116(x)
+    if (x < 1)
+        fun_l17_n63(x)
+    else
+        fun_l17_n90(x)
+    end
+end
+
+def fun_l16_n117(x)
+    if (x < 1)
+        fun_l17_n392(x)
+    else
+        fun_l17_n3(x)
+    end
+end
+
+def fun_l16_n118(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n354(x)
+    end
+end
+
+def fun_l16_n119(x)
+    if (x < 1)
+        fun_l17_n173(x)
+    else
+        fun_l17_n573(x)
+    end
+end
+
+def fun_l16_n120(x)
+    if (x < 1)
+        fun_l17_n481(x)
+    else
+        fun_l17_n571(x)
+    end
+end
+
+def fun_l16_n121(x)
+    if (x < 1)
+        fun_l17_n838(x)
+    else
+        fun_l17_n736(x)
+    end
+end
+
+def fun_l16_n122(x)
+    if (x < 1)
+        fun_l17_n400(x)
+    else
+        fun_l17_n169(x)
+    end
+end
+
+def fun_l16_n123(x)
+    if (x < 1)
+        fun_l17_n806(x)
+    else
+        fun_l17_n954(x)
+    end
+end
+
+def fun_l16_n124(x)
+    if (x < 1)
+        fun_l17_n328(x)
+    else
+        fun_l17_n200(x)
+    end
+end
+
+def fun_l16_n125(x)
+    if (x < 1)
+        fun_l17_n388(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n126(x)
+    if (x < 1)
+        fun_l17_n178(x)
+    else
+        fun_l17_n122(x)
+    end
+end
+
+def fun_l16_n127(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n490(x)
+    end
+end
+
+def fun_l16_n128(x)
+    if (x < 1)
+        fun_l17_n731(x)
+    else
+        fun_l17_n807(x)
+    end
+end
+
+def fun_l16_n129(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n130(x)
+    if (x < 1)
+        fun_l17_n482(x)
+    else
+        fun_l17_n926(x)
+    end
+end
+
+def fun_l16_n131(x)
+    if (x < 1)
+        fun_l17_n884(x)
+    else
+        fun_l17_n179(x)
+    end
+end
+
+def fun_l16_n132(x)
+    if (x < 1)
+        fun_l17_n683(x)
+    else
+        fun_l17_n24(x)
+    end
+end
+
+def fun_l16_n133(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n536(x)
+    end
+end
+
+def fun_l16_n134(x)
+    if (x < 1)
+        fun_l17_n229(x)
+    else
+        fun_l17_n280(x)
+    end
+end
+
+def fun_l16_n135(x)
+    if (x < 1)
+        fun_l17_n47(x)
+    else
+        fun_l17_n12(x)
+    end
+end
+
+def fun_l16_n136(x)
+    if (x < 1)
+        fun_l17_n905(x)
+    else
+        fun_l17_n461(x)
+    end
+end
+
+def fun_l16_n137(x)
+    if (x < 1)
+        fun_l17_n992(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n138(x)
+    if (x < 1)
+        fun_l17_n383(x)
+    else
+        fun_l17_n916(x)
+    end
+end
+
+def fun_l16_n139(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n96(x)
+    end
+end
+
+def fun_l16_n140(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n141(x)
+    if (x < 1)
+        fun_l17_n528(x)
+    else
+        fun_l17_n650(x)
+    end
+end
+
+def fun_l16_n142(x)
+    if (x < 1)
+        fun_l17_n341(x)
+    else
+        fun_l17_n168(x)
+    end
+end
+
+def fun_l16_n143(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n384(x)
+    end
+end
+
+def fun_l16_n144(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n145(x)
+    if (x < 1)
+        fun_l17_n359(x)
+    else
+        fun_l17_n691(x)
+    end
+end
+
+def fun_l16_n146(x)
+    if (x < 1)
+        fun_l17_n465(x)
+    else
+        fun_l17_n310(x)
+    end
+end
+
+def fun_l16_n147(x)
+    if (x < 1)
+        fun_l17_n610(x)
+    else
+        fun_l17_n133(x)
+    end
+end
+
+def fun_l16_n148(x)
+    if (x < 1)
+        fun_l17_n829(x)
+    else
+        fun_l17_n449(x)
+    end
+end
+
+def fun_l16_n149(x)
+    if (x < 1)
+        fun_l17_n319(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n150(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n151(x)
+    if (x < 1)
+        fun_l17_n801(x)
+    else
+        fun_l17_n294(x)
+    end
+end
+
+def fun_l16_n152(x)
+    if (x < 1)
+        fun_l17_n39(x)
+    else
+        fun_l17_n113(x)
+    end
+end
+
+def fun_l16_n153(x)
+    if (x < 1)
+        fun_l17_n299(x)
+    else
+        fun_l17_n560(x)
+    end
+end
+
+def fun_l16_n154(x)
+    if (x < 1)
+        fun_l17_n220(x)
+    else
+        fun_l17_n485(x)
+    end
+end
+
+def fun_l16_n155(x)
+    if (x < 1)
+        fun_l17_n219(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n156(x)
+    if (x < 1)
+        fun_l17_n44(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n157(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n9(x)
+    end
+end
+
+def fun_l16_n158(x)
+    if (x < 1)
+        fun_l17_n298(x)
+    else
+        fun_l17_n584(x)
+    end
+end
+
+def fun_l16_n159(x)
+    if (x < 1)
+        fun_l17_n627(x)
+    else
+        fun_l17_n991(x)
+    end
+end
+
+def fun_l16_n160(x)
+    if (x < 1)
+        fun_l17_n459(x)
+    else
+        fun_l17_n686(x)
+    end
+end
+
+def fun_l16_n161(x)
+    if (x < 1)
+        fun_l17_n694(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n162(x)
+    if (x < 1)
+        fun_l17_n331(x)
+    else
+        fun_l17_n869(x)
+    end
+end
+
+def fun_l16_n163(x)
+    if (x < 1)
+        fun_l17_n958(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n164(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n165(x)
+    if (x < 1)
+        fun_l17_n639(x)
+    else
+        fun_l17_n342(x)
+    end
+end
+
+def fun_l16_n166(x)
+    if (x < 1)
+        fun_l17_n859(x)
+    else
+        fun_l17_n2(x)
+    end
+end
+
+def fun_l16_n167(x)
+    if (x < 1)
+        fun_l17_n504(x)
+    else
+        fun_l17_n726(x)
+    end
+end
+
+def fun_l16_n168(x)
+    if (x < 1)
+        fun_l17_n426(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n169(x)
+    if (x < 1)
+        fun_l17_n919(x)
+    else
+        fun_l17_n515(x)
+    end
+end
+
+def fun_l16_n170(x)
+    if (x < 1)
+        fun_l17_n394(x)
+    else
+        fun_l17_n259(x)
+    end
+end
+
+def fun_l16_n171(x)
+    if (x < 1)
+        fun_l17_n920(x)
+    else
+        fun_l17_n502(x)
+    end
+end
+
+def fun_l16_n172(x)
+    if (x < 1)
+        fun_l17_n898(x)
+    else
+        fun_l17_n984(x)
+    end
+end
+
+def fun_l16_n173(x)
+    if (x < 1)
+        fun_l17_n869(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n174(x)
+    if (x < 1)
+        fun_l17_n959(x)
+    else
+        fun_l17_n283(x)
+    end
+end
+
+def fun_l16_n175(x)
+    if (x < 1)
+        fun_l17_n1(x)
+    else
+        fun_l17_n68(x)
+    end
+end
+
+def fun_l16_n176(x)
+    if (x < 1)
+        fun_l17_n91(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n177(x)
+    if (x < 1)
+        fun_l17_n803(x)
+    else
+        fun_l17_n335(x)
+    end
+end
+
+def fun_l16_n178(x)
+    if (x < 1)
+        fun_l17_n242(x)
+    else
+        fun_l17_n671(x)
+    end
+end
+
+def fun_l16_n179(x)
+    if (x < 1)
+        fun_l17_n944(x)
+    else
+        fun_l17_n136(x)
+    end
+end
+
+def fun_l16_n180(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n587(x)
+    end
+end
+
+def fun_l16_n181(x)
+    if (x < 1)
+        fun_l17_n564(x)
+    else
+        fun_l17_n965(x)
+    end
+end
+
+def fun_l16_n182(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n183(x)
+    if (x < 1)
+        fun_l17_n467(x)
+    else
+        fun_l17_n155(x)
+    end
+end
+
+def fun_l16_n184(x)
+    if (x < 1)
+        fun_l17_n62(x)
+    else
+        fun_l17_n507(x)
+    end
+end
+
+def fun_l16_n185(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n792(x)
+    end
+end
+
+def fun_l16_n186(x)
+    if (x < 1)
+        fun_l17_n174(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n187(x)
+    if (x < 1)
+        fun_l17_n733(x)
+    else
+        fun_l17_n640(x)
+    end
+end
+
+def fun_l16_n188(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n189(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n381(x)
+    end
+end
+
+def fun_l16_n190(x)
+    if (x < 1)
+        fun_l17_n34(x)
+    else
+        fun_l17_n145(x)
+    end
+end
+
+def fun_l16_n191(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n192(x)
+    if (x < 1)
+        fun_l17_n497(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n193(x)
+    if (x < 1)
+        fun_l17_n935(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n194(x)
+    if (x < 1)
+        fun_l17_n728(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n195(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n678(x)
+    end
+end
+
+def fun_l16_n196(x)
+    if (x < 1)
+        fun_l17_n420(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n197(x)
+    if (x < 1)
+        fun_l17_n651(x)
+    else
+        fun_l17_n569(x)
+    end
+end
+
+def fun_l16_n198(x)
+    if (x < 1)
+        fun_l17_n274(x)
+    else
+        fun_l17_n683(x)
+    end
+end
+
+def fun_l16_n199(x)
+    if (x < 1)
+        fun_l17_n624(x)
+    else
+        fun_l17_n343(x)
+    end
+end
+
+def fun_l16_n200(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n201(x)
+    if (x < 1)
+        fun_l17_n519(x)
+    else
+        fun_l17_n54(x)
+    end
+end
+
+def fun_l16_n202(x)
+    if (x < 1)
+        fun_l17_n858(x)
+    else
+        fun_l17_n379(x)
+    end
+end
+
+def fun_l16_n203(x)
+    if (x < 1)
+        fun_l17_n515(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n204(x)
+    if (x < 1)
+        fun_l17_n736(x)
+    else
+        fun_l17_n880(x)
+    end
+end
+
+def fun_l16_n205(x)
+    if (x < 1)
+        fun_l17_n724(x)
+    else
+        fun_l17_n890(x)
+    end
+end
+
+def fun_l16_n206(x)
+    if (x < 1)
+        fun_l17_n92(x)
+    else
+        fun_l17_n305(x)
+    end
+end
+
+def fun_l16_n207(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n208(x)
+    if (x < 1)
+        fun_l17_n722(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n209(x)
+    if (x < 1)
+        fun_l17_n250(x)
+    else
+        fun_l17_n810(x)
+    end
+end
+
+def fun_l16_n210(x)
+    if (x < 1)
+        fun_l17_n118(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n211(x)
+    if (x < 1)
+        fun_l17_n8(x)
+    else
+        fun_l17_n874(x)
+    end
+end
+
+def fun_l16_n212(x)
+    if (x < 1)
+        fun_l17_n589(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n213(x)
+    if (x < 1)
+        fun_l17_n786(x)
+    else
+        fun_l17_n249(x)
+    end
+end
+
+def fun_l16_n214(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n763(x)
+    end
+end
+
+def fun_l16_n215(x)
+    if (x < 1)
+        fun_l17_n733(x)
+    else
+        fun_l17_n657(x)
+    end
+end
+
+def fun_l16_n216(x)
+    if (x < 1)
+        fun_l17_n168(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n217(x)
+    if (x < 1)
+        fun_l17_n568(x)
+    else
+        fun_l17_n698(x)
+    end
+end
+
+def fun_l16_n218(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n219(x)
+    if (x < 1)
+        fun_l17_n443(x)
+    else
+        fun_l17_n600(x)
+    end
+end
+
+def fun_l16_n220(x)
+    if (x < 1)
+        fun_l17_n901(x)
+    else
+        fun_l17_n875(x)
+    end
+end
+
+def fun_l16_n221(x)
+    if (x < 1)
+        fun_l17_n374(x)
+    else
+        fun_l17_n819(x)
+    end
+end
+
+def fun_l16_n222(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n223(x)
+    if (x < 1)
+        fun_l17_n404(x)
+    else
+        fun_l17_n201(x)
+    end
+end
+
+def fun_l16_n224(x)
+    if (x < 1)
+        fun_l17_n932(x)
+    else
+        fun_l17_n803(x)
+    end
+end
+
+def fun_l16_n225(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n717(x)
+    end
+end
+
+def fun_l16_n226(x)
+    if (x < 1)
+        fun_l17_n599(x)
+    else
+        fun_l17_n692(x)
+    end
+end
+
+def fun_l16_n227(x)
+    if (x < 1)
+        fun_l17_n351(x)
+    else
+        fun_l17_n177(x)
+    end
+end
+
+def fun_l16_n228(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n79(x)
+    end
+end
+
+def fun_l16_n229(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n702(x)
+    end
+end
+
+def fun_l16_n230(x)
+    if (x < 1)
+        fun_l17_n591(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n231(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n881(x)
+    end
+end
+
+def fun_l16_n232(x)
+    if (x < 1)
+        fun_l17_n390(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n233(x)
+    if (x < 1)
+        fun_l17_n530(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n234(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n783(x)
+    end
+end
+
+def fun_l16_n235(x)
+    if (x < 1)
+        fun_l17_n91(x)
+    else
+        fun_l17_n142(x)
+    end
+end
+
+def fun_l16_n236(x)
+    if (x < 1)
+        fun_l17_n55(x)
+    else
+        fun_l17_n897(x)
+    end
+end
+
+def fun_l16_n237(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n24(x)
+    end
+end
+
+def fun_l16_n238(x)
+    if (x < 1)
+        fun_l17_n812(x)
+    else
+        fun_l17_n833(x)
+    end
+end
+
+def fun_l16_n239(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n560(x)
+    end
+end
+
+def fun_l16_n240(x)
+    if (x < 1)
+        fun_l17_n882(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n241(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n299(x)
+    end
+end
+
+def fun_l16_n242(x)
+    if (x < 1)
+        fun_l17_n855(x)
+    else
+        fun_l17_n751(x)
+    end
+end
+
+def fun_l16_n243(x)
+    if (x < 1)
+        fun_l17_n184(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n244(x)
+    if (x < 1)
+        fun_l17_n151(x)
+    else
+        fun_l17_n495(x)
+    end
+end
+
+def fun_l16_n245(x)
+    if (x < 1)
+        fun_l17_n181(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n246(x)
+    if (x < 1)
+        fun_l17_n208(x)
+    else
+        fun_l17_n767(x)
+    end
+end
+
+def fun_l16_n247(x)
+    if (x < 1)
+        fun_l17_n969(x)
+    else
+        fun_l17_n15(x)
+    end
+end
+
+def fun_l16_n248(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n879(x)
+    end
+end
+
+def fun_l16_n249(x)
+    if (x < 1)
+        fun_l17_n729(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n250(x)
+    if (x < 1)
+        fun_l17_n239(x)
+    else
+        fun_l17_n414(x)
+    end
+end
+
+def fun_l16_n251(x)
+    if (x < 1)
+        fun_l17_n257(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n252(x)
+    if (x < 1)
+        fun_l17_n832(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n253(x)
+    if (x < 1)
+        fun_l17_n907(x)
+    else
+        fun_l17_n548(x)
+    end
+end
+
+def fun_l16_n254(x)
+    if (x < 1)
+        fun_l17_n391(x)
+    else
+        fun_l17_n316(x)
+    end
+end
+
+def fun_l16_n255(x)
+    if (x < 1)
+        fun_l17_n163(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n256(x)
+    if (x < 1)
+        fun_l17_n86(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n257(x)
+    if (x < 1)
+        fun_l17_n519(x)
+    else
+        fun_l17_n556(x)
+    end
+end
+
+def fun_l16_n258(x)
+    if (x < 1)
+        fun_l17_n819(x)
+    else
+        fun_l17_n41(x)
+    end
+end
+
+def fun_l16_n259(x)
+    if (x < 1)
+        fun_l17_n330(x)
+    else
+        fun_l17_n334(x)
+    end
+end
+
+def fun_l16_n260(x)
+    if (x < 1)
+        fun_l17_n441(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n261(x)
+    if (x < 1)
+        fun_l17_n116(x)
+    else
+        fun_l17_n597(x)
+    end
+end
+
+def fun_l16_n262(x)
+    if (x < 1)
+        fun_l17_n537(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n263(x)
+    if (x < 1)
+        fun_l17_n511(x)
+    else
+        fun_l17_n56(x)
+    end
+end
+
+def fun_l16_n264(x)
+    if (x < 1)
+        fun_l17_n264(x)
+    else
+        fun_l17_n641(x)
+    end
+end
+
+def fun_l16_n265(x)
+    if (x < 1)
+        fun_l17_n806(x)
+    else
+        fun_l17_n432(x)
+    end
+end
+
+def fun_l16_n266(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n463(x)
+    end
+end
+
+def fun_l16_n267(x)
+    if (x < 1)
+        fun_l17_n39(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n268(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n87(x)
+    end
+end
+
+def fun_l16_n269(x)
+    if (x < 1)
+        fun_l17_n143(x)
+    else
+        fun_l17_n92(x)
+    end
+end
+
+def fun_l16_n270(x)
+    if (x < 1)
+        fun_l17_n675(x)
+    else
+        fun_l17_n629(x)
+    end
+end
+
+def fun_l16_n271(x)
+    if (x < 1)
+        fun_l17_n33(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n272(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n204(x)
+    end
+end
+
+def fun_l16_n273(x)
+    if (x < 1)
+        fun_l17_n81(x)
+    else
+        fun_l17_n855(x)
+    end
+end
+
+def fun_l16_n274(x)
+    if (x < 1)
+        fun_l17_n608(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n275(x)
+    if (x < 1)
+        fun_l17_n606(x)
+    else
+        fun_l17_n292(x)
+    end
+end
+
+def fun_l16_n276(x)
+    if (x < 1)
+        fun_l17_n494(x)
+    else
+        fun_l17_n689(x)
+    end
+end
+
+def fun_l16_n277(x)
+    if (x < 1)
+        fun_l17_n3(x)
+    else
+        fun_l17_n207(x)
+    end
+end
+
+def fun_l16_n278(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n279(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n651(x)
+    end
+end
+
+def fun_l16_n280(x)
+    if (x < 1)
+        fun_l17_n199(x)
+    else
+        fun_l17_n77(x)
+    end
+end
+
+def fun_l16_n281(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n282(x)
+    if (x < 1)
+        fun_l17_n120(x)
+    else
+        fun_l17_n466(x)
+    end
+end
+
+def fun_l16_n283(x)
+    if (x < 1)
+        fun_l17_n667(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n284(x)
+    if (x < 1)
+        fun_l17_n248(x)
+    else
+        fun_l17_n480(x)
+    end
+end
+
+def fun_l16_n285(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n609(x)
+    end
+end
+
+def fun_l16_n286(x)
+    if (x < 1)
+        fun_l17_n95(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n287(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n552(x)
+    end
+end
+
+def fun_l16_n288(x)
+    if (x < 1)
+        fun_l17_n955(x)
+    else
+        fun_l17_n434(x)
+    end
+end
+
+def fun_l16_n289(x)
+    if (x < 1)
+        fun_l17_n954(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n290(x)
+    if (x < 1)
+        fun_l17_n981(x)
+    else
+        fun_l17_n374(x)
+    end
+end
+
+def fun_l16_n291(x)
+    if (x < 1)
+        fun_l17_n153(x)
+    else
+        fun_l17_n849(x)
+    end
+end
+
+def fun_l16_n292(x)
+    if (x < 1)
+        fun_l17_n89(x)
+    else
+        fun_l17_n491(x)
+    end
+end
+
+def fun_l16_n293(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n75(x)
+    end
+end
+
+def fun_l16_n294(x)
+    if (x < 1)
+        fun_l17_n772(x)
+    else
+        fun_l17_n474(x)
+    end
+end
+
+def fun_l16_n295(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n296(x)
+    if (x < 1)
+        fun_l17_n699(x)
+    else
+        fun_l17_n172(x)
+    end
+end
+
+def fun_l16_n297(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n314(x)
+    end
+end
+
+def fun_l16_n298(x)
+    if (x < 1)
+        fun_l17_n521(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n299(x)
+    if (x < 1)
+        fun_l17_n804(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n300(x)
+    if (x < 1)
+        fun_l17_n712(x)
+    else
+        fun_l17_n227(x)
+    end
+end
+
+def fun_l16_n301(x)
+    if (x < 1)
+        fun_l17_n700(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n302(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n212(x)
+    end
+end
+
+def fun_l16_n303(x)
+    if (x < 1)
+        fun_l17_n525(x)
+    else
+        fun_l17_n273(x)
+    end
+end
+
+def fun_l16_n304(x)
+    if (x < 1)
+        fun_l17_n356(x)
+    else
+        fun_l17_n359(x)
+    end
+end
+
+def fun_l16_n305(x)
+    if (x < 1)
+        fun_l17_n84(x)
+    else
+        fun_l17_n207(x)
+    end
+end
+
+def fun_l16_n306(x)
+    if (x < 1)
+        fun_l17_n566(x)
+    else
+        fun_l17_n945(x)
+    end
+end
+
+def fun_l16_n307(x)
+    if (x < 1)
+        fun_l17_n692(x)
+    else
+        fun_l17_n326(x)
+    end
+end
+
+def fun_l16_n308(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n205(x)
+    end
+end
+
+def fun_l16_n309(x)
+    if (x < 1)
+        fun_l17_n568(x)
+    else
+        fun_l17_n386(x)
+    end
+end
+
+def fun_l16_n310(x)
+    if (x < 1)
+        fun_l17_n244(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n311(x)
+    if (x < 1)
+        fun_l17_n956(x)
+    else
+        fun_l17_n546(x)
+    end
+end
+
+def fun_l16_n312(x)
+    if (x < 1)
+        fun_l17_n807(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n313(x)
+    if (x < 1)
+        fun_l17_n931(x)
+    else
+        fun_l17_n962(x)
+    end
+end
+
+def fun_l16_n314(x)
+    if (x < 1)
+        fun_l17_n64(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n315(x)
+    if (x < 1)
+        fun_l17_n460(x)
+    else
+        fun_l17_n438(x)
+    end
+end
+
+def fun_l16_n316(x)
+    if (x < 1)
+        fun_l17_n185(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n317(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n460(x)
+    end
+end
+
+def fun_l16_n318(x)
+    if (x < 1)
+        fun_l17_n5(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n319(x)
+    if (x < 1)
+        fun_l17_n682(x)
+    else
+        fun_l17_n644(x)
+    end
+end
+
+def fun_l16_n320(x)
+    if (x < 1)
+        fun_l17_n151(x)
+    else
+        fun_l17_n578(x)
+    end
+end
+
+def fun_l16_n321(x)
+    if (x < 1)
+        fun_l17_n219(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n322(x)
+    if (x < 1)
+        fun_l17_n214(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n323(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n275(x)
+    end
+end
+
+def fun_l16_n324(x)
+    if (x < 1)
+        fun_l17_n442(x)
+    else
+        fun_l17_n377(x)
+    end
+end
+
+def fun_l16_n325(x)
+    if (x < 1)
+        fun_l17_n783(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n326(x)
+    if (x < 1)
+        fun_l17_n43(x)
+    else
+        fun_l17_n884(x)
+    end
+end
+
+def fun_l16_n327(x)
+    if (x < 1)
+        fun_l17_n857(x)
+    else
+        fun_l17_n593(x)
+    end
+end
+
+def fun_l16_n328(x)
+    if (x < 1)
+        fun_l17_n942(x)
+    else
+        fun_l17_n772(x)
+    end
+end
+
+def fun_l16_n329(x)
+    if (x < 1)
+        fun_l17_n309(x)
+    else
+        fun_l17_n508(x)
+    end
+end
+
+def fun_l16_n330(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n331(x)
+    if (x < 1)
+        fun_l17_n981(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n332(x)
+    if (x < 1)
+        fun_l17_n159(x)
+    else
+        fun_l17_n228(x)
+    end
+end
+
+def fun_l16_n333(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n565(x)
+    end
+end
+
+def fun_l16_n334(x)
+    if (x < 1)
+        fun_l17_n371(x)
+    else
+        fun_l17_n856(x)
+    end
+end
+
+def fun_l16_n335(x)
+    if (x < 1)
+        fun_l17_n717(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n336(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n337(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n566(x)
+    end
+end
+
+def fun_l16_n338(x)
+    if (x < 1)
+        fun_l17_n74(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n339(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n443(x)
+    end
+end
+
+def fun_l16_n340(x)
+    if (x < 1)
+        fun_l17_n233(x)
+    else
+        fun_l17_n79(x)
+    end
+end
+
+def fun_l16_n341(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n900(x)
+    end
+end
+
+def fun_l16_n342(x)
+    if (x < 1)
+        fun_l17_n785(x)
+    else
+        fun_l17_n63(x)
+    end
+end
+
+def fun_l16_n343(x)
+    if (x < 1)
+        fun_l17_n429(x)
+    else
+        fun_l17_n111(x)
+    end
+end
+
+def fun_l16_n344(x)
+    if (x < 1)
+        fun_l17_n226(x)
+    else
+        fun_l17_n137(x)
+    end
+end
+
+def fun_l16_n345(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n674(x)
+    end
+end
+
+def fun_l16_n346(x)
+    if (x < 1)
+        fun_l17_n940(x)
+    else
+        fun_l17_n987(x)
+    end
+end
+
+def fun_l16_n347(x)
+    if (x < 1)
+        fun_l17_n579(x)
+    else
+        fun_l17_n220(x)
+    end
+end
+
+def fun_l16_n348(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n530(x)
+    end
+end
+
+def fun_l16_n349(x)
+    if (x < 1)
+        fun_l17_n334(x)
+    else
+        fun_l17_n955(x)
+    end
+end
+
+def fun_l16_n350(x)
+    if (x < 1)
+        fun_l17_n680(x)
+    else
+        fun_l17_n41(x)
+    end
+end
+
+def fun_l16_n351(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n750(x)
+    end
+end
+
+def fun_l16_n352(x)
+    if (x < 1)
+        fun_l17_n212(x)
+    else
+        fun_l17_n537(x)
+    end
+end
+
+def fun_l16_n353(x)
+    if (x < 1)
+        fun_l17_n555(x)
+    else
+        fun_l17_n834(x)
+    end
+end
+
+def fun_l16_n354(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n355(x)
+    if (x < 1)
+        fun_l17_n771(x)
+    else
+        fun_l17_n915(x)
+    end
+end
+
+def fun_l16_n356(x)
+    if (x < 1)
+        fun_l17_n844(x)
+    else
+        fun_l17_n235(x)
+    end
+end
+
+def fun_l16_n357(x)
+    if (x < 1)
+        fun_l17_n604(x)
+    else
+        fun_l17_n241(x)
+    end
+end
+
+def fun_l16_n358(x)
+    if (x < 1)
+        fun_l17_n156(x)
+    else
+        fun_l17_n832(x)
+    end
+end
+
+def fun_l16_n359(x)
+    if (x < 1)
+        fun_l17_n335(x)
+    else
+        fun_l17_n115(x)
+    end
+end
+
+def fun_l16_n360(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n779(x)
+    end
+end
+
+def fun_l16_n361(x)
+    if (x < 1)
+        fun_l17_n280(x)
+    else
+        fun_l17_n946(x)
+    end
+end
+
+def fun_l16_n362(x)
+    if (x < 1)
+        fun_l17_n497(x)
+    else
+        fun_l17_n390(x)
+    end
+end
+
+def fun_l16_n363(x)
+    if (x < 1)
+        fun_l17_n59(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n364(x)
+    if (x < 1)
+        fun_l17_n509(x)
+    else
+        fun_l17_n963(x)
+    end
+end
+
+def fun_l16_n365(x)
+    if (x < 1)
+        fun_l17_n670(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n366(x)
+    if (x < 1)
+        fun_l17_n852(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n367(x)
+    if (x < 1)
+        fun_l17_n714(x)
+    else
+        fun_l17_n98(x)
+    end
+end
+
+def fun_l16_n368(x)
+    if (x < 1)
+        fun_l17_n456(x)
+    else
+        fun_l17_n754(x)
+    end
+end
+
+def fun_l16_n369(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n38(x)
+    end
+end
+
+def fun_l16_n370(x)
+    if (x < 1)
+        fun_l17_n127(x)
+    else
+        fun_l17_n395(x)
+    end
+end
+
+def fun_l16_n371(x)
+    if (x < 1)
+        fun_l17_n700(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n372(x)
+    if (x < 1)
+        fun_l17_n705(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n373(x)
+    if (x < 1)
+        fun_l17_n808(x)
+    else
+        fun_l17_n253(x)
+    end
+end
+
+def fun_l16_n374(x)
+    if (x < 1)
+        fun_l17_n195(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n375(x)
+    if (x < 1)
+        fun_l17_n124(x)
+    else
+        fun_l17_n438(x)
+    end
+end
+
+def fun_l16_n376(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n377(x)
+    if (x < 1)
+        fun_l17_n702(x)
+    else
+        fun_l17_n67(x)
+    end
+end
+
+def fun_l16_n378(x)
+    if (x < 1)
+        fun_l17_n194(x)
+    else
+        fun_l17_n990(x)
+    end
+end
+
+def fun_l16_n379(x)
+    if (x < 1)
+        fun_l17_n574(x)
+    else
+        fun_l17_n379(x)
+    end
+end
+
+def fun_l16_n380(x)
+    if (x < 1)
+        fun_l17_n182(x)
+    else
+        fun_l17_n902(x)
+    end
+end
+
+def fun_l16_n381(x)
+    if (x < 1)
+        fun_l17_n963(x)
+    else
+        fun_l17_n627(x)
+    end
+end
+
+def fun_l16_n382(x)
+    if (x < 1)
+        fun_l17_n200(x)
+    else
+        fun_l17_n889(x)
+    end
+end
+
+def fun_l16_n383(x)
+    if (x < 1)
+        fun_l17_n14(x)
+    else
+        fun_l17_n422(x)
+    end
+end
+
+def fun_l16_n384(x)
+    if (x < 1)
+        fun_l17_n543(x)
+    else
+        fun_l17_n940(x)
+    end
+end
+
+def fun_l16_n385(x)
+    if (x < 1)
+        fun_l17_n762(x)
+    else
+        fun_l17_n493(x)
+    end
+end
+
+def fun_l16_n386(x)
+    if (x < 1)
+        fun_l17_n824(x)
+    else
+        fun_l17_n963(x)
+    end
+end
+
+def fun_l16_n387(x)
+    if (x < 1)
+        fun_l17_n298(x)
+    else
+        fun_l17_n831(x)
+    end
+end
+
+def fun_l16_n388(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n389(x)
+    if (x < 1)
+        fun_l17_n461(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n390(x)
+    if (x < 1)
+        fun_l17_n829(x)
+    else
+        fun_l17_n788(x)
+    end
+end
+
+def fun_l16_n391(x)
+    if (x < 1)
+        fun_l17_n263(x)
+    else
+        fun_l17_n21(x)
+    end
+end
+
+def fun_l16_n392(x)
+    if (x < 1)
+        fun_l17_n994(x)
+    else
+        fun_l17_n646(x)
+    end
+end
+
+def fun_l16_n393(x)
+    if (x < 1)
+        fun_l17_n438(x)
+    else
+        fun_l17_n84(x)
+    end
+end
+
+def fun_l16_n394(x)
+    if (x < 1)
+        fun_l17_n660(x)
+    else
+        fun_l17_n269(x)
+    end
+end
+
+def fun_l16_n395(x)
+    if (x < 1)
+        fun_l17_n939(x)
+    else
+        fun_l17_n676(x)
+    end
+end
+
+def fun_l16_n396(x)
+    if (x < 1)
+        fun_l17_n608(x)
+    else
+        fun_l17_n483(x)
+    end
+end
+
+def fun_l16_n397(x)
+    if (x < 1)
+        fun_l17_n504(x)
+    else
+        fun_l17_n499(x)
+    end
+end
+
+def fun_l16_n398(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n489(x)
+    end
+end
+
+def fun_l16_n399(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n158(x)
+    end
+end
+
+def fun_l16_n400(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n21(x)
+    end
+end
+
+def fun_l16_n401(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n730(x)
+    end
+end
+
+def fun_l16_n402(x)
+    if (x < 1)
+        fun_l17_n593(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n403(x)
+    if (x < 1)
+        fun_l17_n881(x)
+    else
+        fun_l17_n956(x)
+    end
+end
+
+def fun_l16_n404(x)
+    if (x < 1)
+        fun_l17_n676(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n405(x)
+    if (x < 1)
+        fun_l17_n192(x)
+    else
+        fun_l17_n301(x)
+    end
+end
+
+def fun_l16_n406(x)
+    if (x < 1)
+        fun_l17_n170(x)
+    else
+        fun_l17_n970(x)
+    end
+end
+
+def fun_l16_n407(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n765(x)
+    end
+end
+
+def fun_l16_n408(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n578(x)
+    end
+end
+
+def fun_l16_n409(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n870(x)
+    end
+end
+
+def fun_l16_n410(x)
+    if (x < 1)
+        fun_l17_n390(x)
+    else
+        fun_l17_n769(x)
+    end
+end
+
+def fun_l16_n411(x)
+    if (x < 1)
+        fun_l17_n973(x)
+    else
+        fun_l17_n545(x)
+    end
+end
+
+def fun_l16_n412(x)
+    if (x < 1)
+        fun_l17_n108(x)
+    else
+        fun_l17_n731(x)
+    end
+end
+
+def fun_l16_n413(x)
+    if (x < 1)
+        fun_l17_n842(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n414(x)
+    if (x < 1)
+        fun_l17_n10(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n415(x)
+    if (x < 1)
+        fun_l17_n765(x)
+    else
+        fun_l17_n584(x)
+    end
+end
+
+def fun_l16_n416(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n494(x)
+    end
+end
+
+def fun_l16_n417(x)
+    if (x < 1)
+        fun_l17_n977(x)
+    else
+        fun_l17_n66(x)
+    end
+end
+
+def fun_l16_n418(x)
+    if (x < 1)
+        fun_l17_n291(x)
+    else
+        fun_l17_n161(x)
+    end
+end
+
+def fun_l16_n419(x)
+    if (x < 1)
+        fun_l17_n400(x)
+    else
+        fun_l17_n99(x)
+    end
+end
+
+def fun_l16_n420(x)
+    if (x < 1)
+        fun_l17_n621(x)
+    else
+        fun_l17_n778(x)
+    end
+end
+
+def fun_l16_n421(x)
+    if (x < 1)
+        fun_l17_n286(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n422(x)
+    if (x < 1)
+        fun_l17_n575(x)
+    else
+        fun_l17_n606(x)
+    end
+end
+
+def fun_l16_n423(x)
+    if (x < 1)
+        fun_l17_n459(x)
+    else
+        fun_l17_n198(x)
+    end
+end
+
+def fun_l16_n424(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n597(x)
+    end
+end
+
+def fun_l16_n425(x)
+    if (x < 1)
+        fun_l17_n365(x)
+    else
+        fun_l17_n73(x)
+    end
+end
+
+def fun_l16_n426(x)
+    if (x < 1)
+        fun_l17_n769(x)
+    else
+        fun_l17_n658(x)
+    end
+end
+
+def fun_l16_n427(x)
+    if (x < 1)
+        fun_l17_n980(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n428(x)
+    if (x < 1)
+        fun_l17_n210(x)
+    else
+        fun_l17_n33(x)
+    end
+end
+
+def fun_l16_n429(x)
+    if (x < 1)
+        fun_l17_n585(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n430(x)
+    if (x < 1)
+        fun_l17_n660(x)
+    else
+        fun_l17_n883(x)
+    end
+end
+
+def fun_l16_n431(x)
+    if (x < 1)
+        fun_l17_n613(x)
+    else
+        fun_l17_n7(x)
+    end
+end
+
+def fun_l16_n432(x)
+    if (x < 1)
+        fun_l17_n764(x)
+    else
+        fun_l17_n150(x)
+    end
+end
+
+def fun_l16_n433(x)
+    if (x < 1)
+        fun_l17_n582(x)
+    else
+        fun_l17_n197(x)
+    end
+end
+
+def fun_l16_n434(x)
+    if (x < 1)
+        fun_l17_n553(x)
+    else
+        fun_l17_n107(x)
+    end
+end
+
+def fun_l16_n435(x)
+    if (x < 1)
+        fun_l17_n975(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n436(x)
+    if (x < 1)
+        fun_l17_n622(x)
+    else
+        fun_l17_n351(x)
+    end
+end
+
+def fun_l16_n437(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n438(x)
+    if (x < 1)
+        fun_l17_n329(x)
+    else
+        fun_l17_n54(x)
+    end
+end
+
+def fun_l16_n439(x)
+    if (x < 1)
+        fun_l17_n340(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n440(x)
+    if (x < 1)
+        fun_l17_n563(x)
+    else
+        fun_l17_n134(x)
+    end
+end
+
+def fun_l16_n441(x)
+    if (x < 1)
+        fun_l17_n194(x)
+    else
+        fun_l17_n986(x)
+    end
+end
+
+def fun_l16_n442(x)
+    if (x < 1)
+        fun_l17_n926(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n443(x)
+    if (x < 1)
+        fun_l17_n771(x)
+    else
+        fun_l17_n383(x)
+    end
+end
+
+def fun_l16_n444(x)
+    if (x < 1)
+        fun_l17_n682(x)
+    else
+        fun_l17_n1(x)
+    end
+end
+
+def fun_l16_n445(x)
+    if (x < 1)
+        fun_l17_n633(x)
+    else
+        fun_l17_n757(x)
+    end
+end
+
+def fun_l16_n446(x)
+    if (x < 1)
+        fun_l17_n95(x)
+    else
+        fun_l17_n256(x)
+    end
+end
+
+def fun_l16_n447(x)
+    if (x < 1)
+        fun_l17_n183(x)
+    else
+        fun_l17_n214(x)
+    end
+end
+
+def fun_l16_n448(x)
+    if (x < 1)
+        fun_l17_n140(x)
+    else
+        fun_l17_n371(x)
+    end
+end
+
+def fun_l16_n449(x)
+    if (x < 1)
+        fun_l17_n188(x)
+    else
+        fun_l17_n898(x)
+    end
+end
+
+def fun_l16_n450(x)
+    if (x < 1)
+        fun_l17_n710(x)
+    else
+        fun_l17_n512(x)
+    end
+end
+
+def fun_l16_n451(x)
+    if (x < 1)
+        fun_l17_n796(x)
+    else
+        fun_l17_n56(x)
+    end
+end
+
+def fun_l16_n452(x)
+    if (x < 1)
+        fun_l17_n124(x)
+    else
+        fun_l17_n304(x)
+    end
+end
+
+def fun_l16_n453(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n503(x)
+    end
+end
+
+def fun_l16_n454(x)
+    if (x < 1)
+        fun_l17_n369(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n455(x)
+    if (x < 1)
+        fun_l17_n514(x)
+    else
+        fun_l17_n672(x)
+    end
+end
+
+def fun_l16_n456(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n332(x)
+    end
+end
+
+def fun_l16_n457(x)
+    if (x < 1)
+        fun_l17_n80(x)
+    else
+        fun_l17_n32(x)
+    end
+end
+
+def fun_l16_n458(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n90(x)
+    end
+end
+
+def fun_l16_n459(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n170(x)
+    end
+end
+
+def fun_l16_n460(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n461(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n536(x)
+    end
+end
+
+def fun_l16_n462(x)
+    if (x < 1)
+        fun_l17_n123(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n463(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n757(x)
+    end
+end
+
+def fun_l16_n464(x)
+    if (x < 1)
+        fun_l17_n750(x)
+    else
+        fun_l17_n916(x)
+    end
+end
+
+def fun_l16_n465(x)
+    if (x < 1)
+        fun_l17_n621(x)
+    else
+        fun_l17_n386(x)
+    end
+end
+
+def fun_l16_n466(x)
+    if (x < 1)
+        fun_l17_n904(x)
+    else
+        fun_l17_n732(x)
+    end
+end
+
+def fun_l16_n467(x)
+    if (x < 1)
+        fun_l17_n625(x)
+    else
+        fun_l17_n1(x)
+    end
+end
+
+def fun_l16_n468(x)
+    if (x < 1)
+        fun_l17_n762(x)
+    else
+        fun_l17_n373(x)
+    end
+end
+
+def fun_l16_n469(x)
+    if (x < 1)
+        fun_l17_n816(x)
+    else
+        fun_l17_n490(x)
+    end
+end
+
+def fun_l16_n470(x)
+    if (x < 1)
+        fun_l17_n908(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n471(x)
+    if (x < 1)
+        fun_l17_n690(x)
+    else
+        fun_l17_n374(x)
+    end
+end
+
+def fun_l16_n472(x)
+    if (x < 1)
+        fun_l17_n753(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n473(x)
+    if (x < 1)
+        fun_l17_n602(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n474(x)
+    if (x < 1)
+        fun_l17_n565(x)
+    else
+        fun_l17_n320(x)
+    end
+end
+
+def fun_l16_n475(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n431(x)
+    end
+end
+
+def fun_l16_n476(x)
+    if (x < 1)
+        fun_l17_n135(x)
+    else
+        fun_l17_n506(x)
+    end
+end
+
+def fun_l16_n477(x)
+    if (x < 1)
+        fun_l17_n57(x)
+    else
+        fun_l17_n944(x)
+    end
+end
+
+def fun_l16_n478(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n28(x)
+    end
+end
+
+def fun_l16_n479(x)
+    if (x < 1)
+        fun_l17_n132(x)
+    else
+        fun_l17_n280(x)
+    end
+end
+
+def fun_l16_n480(x)
+    if (x < 1)
+        fun_l17_n514(x)
+    else
+        fun_l17_n51(x)
+    end
+end
+
+def fun_l16_n481(x)
+    if (x < 1)
+        fun_l17_n55(x)
+    else
+        fun_l17_n366(x)
+    end
+end
+
+def fun_l16_n482(x)
+    if (x < 1)
+        fun_l17_n59(x)
+    else
+        fun_l17_n810(x)
+    end
+end
+
+def fun_l16_n483(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n55(x)
+    end
+end
+
+def fun_l16_n484(x)
+    if (x < 1)
+        fun_l17_n813(x)
+    else
+        fun_l17_n408(x)
+    end
+end
+
+def fun_l16_n485(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n126(x)
+    end
+end
+
+def fun_l16_n486(x)
+    if (x < 1)
+        fun_l17_n479(x)
+    else
+        fun_l17_n964(x)
+    end
+end
+
+def fun_l16_n487(x)
+    if (x < 1)
+        fun_l17_n267(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n488(x)
+    if (x < 1)
+        fun_l17_n787(x)
+    else
+        fun_l17_n34(x)
+    end
+end
+
+def fun_l16_n489(x)
+    if (x < 1)
+        fun_l17_n223(x)
+    else
+        fun_l17_n568(x)
+    end
+end
+
+def fun_l16_n490(x)
+    if (x < 1)
+        fun_l17_n773(x)
+    else
+        fun_l17_n11(x)
+    end
+end
+
+def fun_l16_n491(x)
+    if (x < 1)
+        fun_l17_n906(x)
+    else
+        fun_l17_n146(x)
+    end
+end
+
+def fun_l16_n492(x)
+    if (x < 1)
+        fun_l17_n221(x)
+    else
+        fun_l17_n136(x)
+    end
+end
+
+def fun_l16_n493(x)
+    if (x < 1)
+        fun_l17_n40(x)
+    else
+        fun_l17_n599(x)
+    end
+end
+
+def fun_l16_n494(x)
+    if (x < 1)
+        fun_l17_n494(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n495(x)
+    if (x < 1)
+        fun_l17_n237(x)
+    else
+        fun_l17_n149(x)
+    end
+end
+
+def fun_l16_n496(x)
+    if (x < 1)
+        fun_l17_n501(x)
+    else
+        fun_l17_n681(x)
+    end
+end
+
+def fun_l16_n497(x)
+    if (x < 1)
+        fun_l17_n141(x)
+    else
+        fun_l17_n226(x)
+    end
+end
+
+def fun_l16_n498(x)
+    if (x < 1)
+        fun_l17_n868(x)
+    else
+        fun_l17_n837(x)
+    end
+end
+
+def fun_l16_n499(x)
+    if (x < 1)
+        fun_l17_n921(x)
+    else
+        fun_l17_n806(x)
+    end
+end
+
+def fun_l16_n500(x)
+    if (x < 1)
+        fun_l17_n117(x)
+    else
+        fun_l17_n835(x)
+    end
+end
+
+def fun_l16_n501(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n567(x)
+    end
+end
+
+def fun_l16_n502(x)
+    if (x < 1)
+        fun_l17_n787(x)
+    else
+        fun_l17_n785(x)
+    end
+end
+
+def fun_l16_n503(x)
+    if (x < 1)
+        fun_l17_n827(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n504(x)
+    if (x < 1)
+        fun_l17_n328(x)
+    else
+        fun_l17_n849(x)
+    end
+end
+
+def fun_l16_n505(x)
+    if (x < 1)
+        fun_l17_n348(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n506(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n507(x)
+    if (x < 1)
+        fun_l17_n959(x)
+    else
+        fun_l17_n739(x)
+    end
+end
+
+def fun_l16_n508(x)
+    if (x < 1)
+        fun_l17_n496(x)
+    else
+        fun_l17_n774(x)
+    end
+end
+
+def fun_l16_n509(x)
+    if (x < 1)
+        fun_l17_n639(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n510(x)
+    if (x < 1)
+        fun_l17_n910(x)
+    else
+        fun_l17_n697(x)
+    end
+end
+
+def fun_l16_n511(x)
+    if (x < 1)
+        fun_l17_n239(x)
+    else
+        fun_l17_n691(x)
+    end
+end
+
+def fun_l16_n512(x)
+    if (x < 1)
+        fun_l17_n923(x)
+    else
+        fun_l17_n735(x)
+    end
+end
+
+def fun_l16_n513(x)
+    if (x < 1)
+        fun_l17_n911(x)
+    else
+        fun_l17_n372(x)
+    end
+end
+
+def fun_l16_n514(x)
+    if (x < 1)
+        fun_l17_n706(x)
+    else
+        fun_l17_n27(x)
+    end
+end
+
+def fun_l16_n515(x)
+    if (x < 1)
+        fun_l17_n788(x)
+    else
+        fun_l17_n670(x)
+    end
+end
+
+def fun_l16_n516(x)
+    if (x < 1)
+        fun_l17_n507(x)
+    else
+        fun_l17_n330(x)
+    end
+end
+
+def fun_l16_n517(x)
+    if (x < 1)
+        fun_l17_n398(x)
+    else
+        fun_l17_n997(x)
+    end
+end
+
+def fun_l16_n518(x)
+    if (x < 1)
+        fun_l17_n675(x)
+    else
+        fun_l17_n383(x)
+    end
+end
+
+def fun_l16_n519(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n520(x)
+    if (x < 1)
+        fun_l17_n884(x)
+    else
+        fun_l17_n200(x)
+    end
+end
+
+def fun_l16_n521(x)
+    if (x < 1)
+        fun_l17_n574(x)
+    else
+        fun_l17_n192(x)
+    end
+end
+
+def fun_l16_n522(x)
+    if (x < 1)
+        fun_l17_n883(x)
+    else
+        fun_l17_n399(x)
+    end
+end
+
+def fun_l16_n523(x)
+    if (x < 1)
+        fun_l17_n516(x)
+    else
+        fun_l17_n592(x)
+    end
+end
+
+def fun_l16_n524(x)
+    if (x < 1)
+        fun_l17_n653(x)
+    else
+        fun_l17_n355(x)
+    end
+end
+
+def fun_l16_n525(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n714(x)
+    end
+end
+
+def fun_l16_n526(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n527(x)
+    if (x < 1)
+        fun_l17_n46(x)
+    else
+        fun_l17_n591(x)
+    end
+end
+
+def fun_l16_n528(x)
+    if (x < 1)
+        fun_l17_n969(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n529(x)
+    if (x < 1)
+        fun_l17_n713(x)
+    else
+        fun_l17_n775(x)
+    end
+end
+
+def fun_l16_n530(x)
+    if (x < 1)
+        fun_l17_n374(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n531(x)
+    if (x < 1)
+        fun_l17_n996(x)
+    else
+        fun_l17_n764(x)
+    end
+end
+
+def fun_l16_n532(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n533(x)
+    if (x < 1)
+        fun_l17_n951(x)
+    else
+        fun_l17_n912(x)
+    end
+end
+
+def fun_l16_n534(x)
+    if (x < 1)
+        fun_l17_n760(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n535(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n16(x)
+    end
+end
+
+def fun_l16_n536(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n693(x)
+    end
+end
+
+def fun_l16_n537(x)
+    if (x < 1)
+        fun_l17_n631(x)
+    else
+        fun_l17_n934(x)
+    end
+end
+
+def fun_l16_n538(x)
+    if (x < 1)
+        fun_l17_n944(x)
+    else
+        fun_l17_n922(x)
+    end
+end
+
+def fun_l16_n539(x)
+    if (x < 1)
+        fun_l17_n263(x)
+    else
+        fun_l17_n796(x)
+    end
+end
+
+def fun_l16_n540(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n604(x)
+    end
+end
+
+def fun_l16_n541(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n880(x)
+    end
+end
+
+def fun_l16_n542(x)
+    if (x < 1)
+        fun_l17_n286(x)
+    else
+        fun_l17_n123(x)
+    end
+end
+
+def fun_l16_n543(x)
+    if (x < 1)
+        fun_l17_n604(x)
+    else
+        fun_l17_n57(x)
+    end
+end
+
+def fun_l16_n544(x)
+    if (x < 1)
+        fun_l17_n204(x)
+    else
+        fun_l17_n950(x)
+    end
+end
+
+def fun_l16_n545(x)
+    if (x < 1)
+        fun_l17_n60(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n546(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n818(x)
+    end
+end
+
+def fun_l16_n547(x)
+    if (x < 1)
+        fun_l17_n515(x)
+    else
+        fun_l17_n180(x)
+    end
+end
+
+def fun_l16_n548(x)
+    if (x < 1)
+        fun_l17_n443(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n549(x)
+    if (x < 1)
+        fun_l17_n820(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n550(x)
+    if (x < 1)
+        fun_l17_n938(x)
+    else
+        fun_l17_n307(x)
+    end
+end
+
+def fun_l16_n551(x)
+    if (x < 1)
+        fun_l17_n350(x)
+    else
+        fun_l17_n177(x)
+    end
+end
+
+def fun_l16_n552(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n553(x)
+    if (x < 1)
+        fun_l17_n189(x)
+    else
+        fun_l17_n991(x)
+    end
+end
+
+def fun_l16_n554(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n555(x)
+    if (x < 1)
+        fun_l17_n42(x)
+    else
+        fun_l17_n273(x)
+    end
+end
+
+def fun_l16_n556(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n328(x)
+    end
+end
+
+def fun_l16_n557(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n403(x)
+    end
+end
+
+def fun_l16_n558(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n363(x)
+    end
+end
+
+def fun_l16_n559(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n648(x)
+    end
+end
+
+def fun_l16_n560(x)
+    if (x < 1)
+        fun_l17_n288(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n561(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n908(x)
+    end
+end
+
+def fun_l16_n562(x)
+    if (x < 1)
+        fun_l17_n244(x)
+    else
+        fun_l17_n342(x)
+    end
+end
+
+def fun_l16_n563(x)
+    if (x < 1)
+        fun_l17_n535(x)
+    else
+        fun_l17_n750(x)
+    end
+end
+
+def fun_l16_n564(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n106(x)
+    end
+end
+
+def fun_l16_n565(x)
+    if (x < 1)
+        fun_l17_n236(x)
+    else
+        fun_l17_n95(x)
+    end
+end
+
+def fun_l16_n566(x)
+    if (x < 1)
+        fun_l17_n356(x)
+    else
+        fun_l17_n129(x)
+    end
+end
+
+def fun_l16_n567(x)
+    if (x < 1)
+        fun_l17_n297(x)
+    else
+        fun_l17_n247(x)
+    end
+end
+
+def fun_l16_n568(x)
+    if (x < 1)
+        fun_l17_n735(x)
+    else
+        fun_l17_n781(x)
+    end
+end
+
+def fun_l16_n569(x)
+    if (x < 1)
+        fun_l17_n650(x)
+    else
+        fun_l17_n377(x)
+    end
+end
+
+def fun_l16_n570(x)
+    if (x < 1)
+        fun_l17_n872(x)
+    else
+        fun_l17_n52(x)
+    end
+end
+
+def fun_l16_n571(x)
+    if (x < 1)
+        fun_l17_n970(x)
+    else
+        fun_l17_n719(x)
+    end
+end
+
+def fun_l16_n572(x)
+    if (x < 1)
+        fun_l17_n380(x)
+    else
+        fun_l17_n121(x)
+    end
+end
+
+def fun_l16_n573(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n675(x)
+    end
+end
+
+def fun_l16_n574(x)
+    if (x < 1)
+        fun_l17_n269(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n575(x)
+    if (x < 1)
+        fun_l17_n480(x)
+    else
+        fun_l17_n228(x)
+    end
+end
+
+def fun_l16_n576(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n45(x)
+    end
+end
+
+def fun_l16_n577(x)
+    if (x < 1)
+        fun_l17_n403(x)
+    else
+        fun_l17_n887(x)
+    end
+end
+
+def fun_l16_n578(x)
+    if (x < 1)
+        fun_l17_n139(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n579(x)
+    if (x < 1)
+        fun_l17_n472(x)
+    else
+        fun_l17_n869(x)
+    end
+end
+
+def fun_l16_n580(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n298(x)
+    end
+end
+
+def fun_l16_n581(x)
+    if (x < 1)
+        fun_l17_n822(x)
+    else
+        fun_l17_n859(x)
+    end
+end
+
+def fun_l16_n582(x)
+    if (x < 1)
+        fun_l17_n768(x)
+    else
+        fun_l17_n814(x)
+    end
+end
+
+def fun_l16_n583(x)
+    if (x < 1)
+        fun_l17_n892(x)
+    else
+        fun_l17_n821(x)
+    end
+end
+
+def fun_l16_n584(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n276(x)
+    end
+end
+
+def fun_l16_n585(x)
+    if (x < 1)
+        fun_l17_n162(x)
+    else
+        fun_l17_n873(x)
+    end
+end
+
+def fun_l16_n586(x)
+    if (x < 1)
+        fun_l17_n932(x)
+    else
+        fun_l17_n227(x)
+    end
+end
+
+def fun_l16_n587(x)
+    if (x < 1)
+        fun_l17_n105(x)
+    else
+        fun_l17_n620(x)
+    end
+end
+
+def fun_l16_n588(x)
+    if (x < 1)
+        fun_l17_n137(x)
+    else
+        fun_l17_n941(x)
+    end
+end
+
+def fun_l16_n589(x)
+    if (x < 1)
+        fun_l17_n936(x)
+    else
+        fun_l17_n877(x)
+    end
+end
+
+def fun_l16_n590(x)
+    if (x < 1)
+        fun_l17_n280(x)
+    else
+        fun_l17_n711(x)
+    end
+end
+
+def fun_l16_n591(x)
+    if (x < 1)
+        fun_l17_n968(x)
+    else
+        fun_l17_n695(x)
+    end
+end
+
+def fun_l16_n592(x)
+    if (x < 1)
+        fun_l17_n774(x)
+    else
+        fun_l17_n674(x)
+    end
+end
+
+def fun_l16_n593(x)
+    if (x < 1)
+        fun_l17_n421(x)
+    else
+        fun_l17_n516(x)
+    end
+end
+
+def fun_l16_n594(x)
+    if (x < 1)
+        fun_l17_n830(x)
+    else
+        fun_l17_n852(x)
+    end
+end
+
+def fun_l16_n595(x)
+    if (x < 1)
+        fun_l17_n659(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n596(x)
+    if (x < 1)
+        fun_l17_n411(x)
+    else
+        fun_l17_n217(x)
+    end
+end
+
+def fun_l16_n597(x)
+    if (x < 1)
+        fun_l17_n506(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n598(x)
+    if (x < 1)
+        fun_l17_n979(x)
+    else
+        fun_l17_n579(x)
+    end
+end
+
+def fun_l16_n599(x)
+    if (x < 1)
+        fun_l17_n423(x)
+    else
+        fun_l17_n765(x)
+    end
+end
+
+def fun_l16_n600(x)
+    if (x < 1)
+        fun_l17_n138(x)
+    else
+        fun_l17_n878(x)
+    end
+end
+
+def fun_l16_n601(x)
+    if (x < 1)
+        fun_l17_n616(x)
+    else
+        fun_l17_n531(x)
+    end
+end
+
+def fun_l16_n602(x)
+    if (x < 1)
+        fun_l17_n737(x)
+    else
+        fun_l17_n936(x)
+    end
+end
+
+def fun_l16_n603(x)
+    if (x < 1)
+        fun_l17_n106(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n604(x)
+    if (x < 1)
+        fun_l17_n562(x)
+    else
+        fun_l17_n852(x)
+    end
+end
+
+def fun_l16_n605(x)
+    if (x < 1)
+        fun_l17_n473(x)
+    else
+        fun_l17_n771(x)
+    end
+end
+
+def fun_l16_n606(x)
+    if (x < 1)
+        fun_l17_n778(x)
+    else
+        fun_l17_n463(x)
+    end
+end
+
+def fun_l16_n607(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n341(x)
+    end
+end
+
+def fun_l16_n608(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n659(x)
+    end
+end
+
+def fun_l16_n609(x)
+    if (x < 1)
+        fun_l17_n734(x)
+    else
+        fun_l17_n174(x)
+    end
+end
+
+def fun_l16_n610(x)
+    if (x < 1)
+        fun_l17_n815(x)
+    else
+        fun_l17_n798(x)
+    end
+end
+
+def fun_l16_n611(x)
+    if (x < 1)
+        fun_l17_n251(x)
+    else
+        fun_l17_n694(x)
+    end
+end
+
+def fun_l16_n612(x)
+    if (x < 1)
+        fun_l17_n597(x)
+    else
+        fun_l17_n245(x)
+    end
+end
+
+def fun_l16_n613(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n58(x)
+    end
+end
+
+def fun_l16_n614(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n13(x)
+    end
+end
+
+def fun_l16_n615(x)
+    if (x < 1)
+        fun_l17_n7(x)
+    else
+        fun_l17_n787(x)
+    end
+end
+
+def fun_l16_n616(x)
+    if (x < 1)
+        fun_l17_n372(x)
+    else
+        fun_l17_n643(x)
+    end
+end
+
+def fun_l16_n617(x)
+    if (x < 1)
+        fun_l17_n592(x)
+    else
+        fun_l17_n508(x)
+    end
+end
+
+def fun_l16_n618(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n619(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n885(x)
+    end
+end
+
+def fun_l16_n620(x)
+    if (x < 1)
+        fun_l17_n4(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n621(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n141(x)
+    end
+end
+
+def fun_l16_n622(x)
+    if (x < 1)
+        fun_l17_n529(x)
+    else
+        fun_l17_n140(x)
+    end
+end
+
+def fun_l16_n623(x)
+    if (x < 1)
+        fun_l17_n713(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n624(x)
+    if (x < 1)
+        fun_l17_n148(x)
+    else
+        fun_l17_n195(x)
+    end
+end
+
+def fun_l16_n625(x)
+    if (x < 1)
+        fun_l17_n287(x)
+    else
+        fun_l17_n662(x)
+    end
+end
+
+def fun_l16_n626(x)
+    if (x < 1)
+        fun_l17_n678(x)
+    else
+        fun_l17_n262(x)
+    end
+end
+
+def fun_l16_n627(x)
+    if (x < 1)
+        fun_l17_n217(x)
+    else
+        fun_l17_n612(x)
+    end
+end
+
+def fun_l16_n628(x)
+    if (x < 1)
+        fun_l17_n826(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n629(x)
+    if (x < 1)
+        fun_l17_n360(x)
+    else
+        fun_l17_n221(x)
+    end
+end
+
+def fun_l16_n630(x)
+    if (x < 1)
+        fun_l17_n842(x)
+    else
+        fun_l17_n362(x)
+    end
+end
+
+def fun_l16_n631(x)
+    if (x < 1)
+        fun_l17_n53(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n632(x)
+    if (x < 1)
+        fun_l17_n628(x)
+    else
+        fun_l17_n150(x)
+    end
+end
+
+def fun_l16_n633(x)
+    if (x < 1)
+        fun_l17_n206(x)
+    else
+        fun_l17_n789(x)
+    end
+end
+
+def fun_l16_n634(x)
+    if (x < 1)
+        fun_l17_n26(x)
+    else
+        fun_l17_n376(x)
+    end
+end
+
+def fun_l16_n635(x)
+    if (x < 1)
+        fun_l17_n614(x)
+    else
+        fun_l17_n109(x)
+    end
+end
+
+def fun_l16_n636(x)
+    if (x < 1)
+        fun_l17_n626(x)
+    else
+        fun_l17_n456(x)
+    end
+end
+
+def fun_l16_n637(x)
+    if (x < 1)
+        fun_l17_n836(x)
+    else
+        fun_l17_n602(x)
+    end
+end
+
+def fun_l16_n638(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n791(x)
+    end
+end
+
+def fun_l16_n639(x)
+    if (x < 1)
+        fun_l17_n689(x)
+    else
+        fun_l17_n714(x)
+    end
+end
+
+def fun_l16_n640(x)
+    if (x < 1)
+        fun_l17_n587(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n641(x)
+    if (x < 1)
+        fun_l17_n686(x)
+    else
+        fun_l17_n297(x)
+    end
+end
+
+def fun_l16_n642(x)
+    if (x < 1)
+        fun_l17_n394(x)
+    else
+        fun_l17_n564(x)
+    end
+end
+
+def fun_l16_n643(x)
+    if (x < 1)
+        fun_l17_n669(x)
+    else
+        fun_l17_n250(x)
+    end
+end
+
+def fun_l16_n644(x)
+    if (x < 1)
+        fun_l17_n407(x)
+    else
+        fun_l17_n631(x)
+    end
+end
+
+def fun_l16_n645(x)
+    if (x < 1)
+        fun_l17_n928(x)
+    else
+        fun_l17_n856(x)
+    end
+end
+
+def fun_l16_n646(x)
+    if (x < 1)
+        fun_l17_n344(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n647(x)
+    if (x < 1)
+        fun_l17_n540(x)
+    else
+        fun_l17_n468(x)
+    end
+end
+
+def fun_l16_n648(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n649(x)
+    if (x < 1)
+        fun_l17_n154(x)
+    else
+        fun_l17_n587(x)
+    end
+end
+
+def fun_l16_n650(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n651(x)
+    if (x < 1)
+        fun_l17_n839(x)
+    else
+        fun_l17_n782(x)
+    end
+end
+
+def fun_l16_n652(x)
+    if (x < 1)
+        fun_l17_n408(x)
+    else
+        fun_l17_n923(x)
+    end
+end
+
+def fun_l16_n653(x)
+    if (x < 1)
+        fun_l17_n51(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n654(x)
+    if (x < 1)
+        fun_l17_n635(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n655(x)
+    if (x < 1)
+        fun_l17_n921(x)
+    else
+        fun_l17_n641(x)
+    end
+end
+
+def fun_l16_n656(x)
+    if (x < 1)
+        fun_l17_n615(x)
+    else
+        fun_l17_n118(x)
+    end
+end
+
+def fun_l16_n657(x)
+    if (x < 1)
+        fun_l17_n673(x)
+    else
+        fun_l17_n842(x)
+    end
+end
+
+def fun_l16_n658(x)
+    if (x < 1)
+        fun_l17_n743(x)
+    else
+        fun_l17_n594(x)
+    end
+end
+
+def fun_l16_n659(x)
+    if (x < 1)
+        fun_l17_n85(x)
+    else
+        fun_l17_n787(x)
+    end
+end
+
+def fun_l16_n660(x)
+    if (x < 1)
+        fun_l17_n363(x)
+    else
+        fun_l17_n830(x)
+    end
+end
+
+def fun_l16_n661(x)
+    if (x < 1)
+        fun_l17_n897(x)
+    else
+        fun_l17_n989(x)
+    end
+end
+
+def fun_l16_n662(x)
+    if (x < 1)
+        fun_l17_n644(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n663(x)
+    if (x < 1)
+        fun_l17_n812(x)
+    else
+        fun_l17_n159(x)
+    end
+end
+
+def fun_l16_n664(x)
+    if (x < 1)
+        fun_l17_n937(x)
+    else
+        fun_l17_n720(x)
+    end
+end
+
+def fun_l16_n665(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n516(x)
+    end
+end
+
+def fun_l16_n666(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n728(x)
+    end
+end
+
+def fun_l16_n667(x)
+    if (x < 1)
+        fun_l17_n673(x)
+    else
+        fun_l17_n735(x)
+    end
+end
+
+def fun_l16_n668(x)
+    if (x < 1)
+        fun_l17_n321(x)
+    else
+        fun_l17_n850(x)
+    end
+end
+
+def fun_l16_n669(x)
+    if (x < 1)
+        fun_l17_n873(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n670(x)
+    if (x < 1)
+        fun_l17_n683(x)
+    else
+        fun_l17_n903(x)
+    end
+end
+
+def fun_l16_n671(x)
+    if (x < 1)
+        fun_l17_n440(x)
+    else
+        fun_l17_n178(x)
+    end
+end
+
+def fun_l16_n672(x)
+    if (x < 1)
+        fun_l17_n619(x)
+    else
+        fun_l17_n785(x)
+    end
+end
+
+def fun_l16_n673(x)
+    if (x < 1)
+        fun_l17_n185(x)
+    else
+        fun_l17_n794(x)
+    end
+end
+
+def fun_l16_n674(x)
+    if (x < 1)
+        fun_l17_n543(x)
+    else
+        fun_l17_n161(x)
+    end
+end
+
+def fun_l16_n675(x)
+    if (x < 1)
+        fun_l17_n898(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n676(x)
+    if (x < 1)
+        fun_l17_n471(x)
+    else
+        fun_l17_n66(x)
+    end
+end
+
+def fun_l16_n677(x)
+    if (x < 1)
+        fun_l17_n764(x)
+    else
+        fun_l17_n163(x)
+    end
+end
+
+def fun_l16_n678(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n353(x)
+    end
+end
+
+def fun_l16_n679(x)
+    if (x < 1)
+        fun_l17_n851(x)
+    else
+        fun_l17_n7(x)
+    end
+end
+
+def fun_l16_n680(x)
+    if (x < 1)
+        fun_l17_n741(x)
+    else
+        fun_l17_n180(x)
+    end
+end
+
+def fun_l16_n681(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n258(x)
+    end
+end
+
+def fun_l16_n682(x)
+    if (x < 1)
+        fun_l17_n536(x)
+    else
+        fun_l17_n84(x)
+    end
+end
+
+def fun_l16_n683(x)
+    if (x < 1)
+        fun_l17_n447(x)
+    else
+        fun_l17_n455(x)
+    end
+end
+
+def fun_l16_n684(x)
+    if (x < 1)
+        fun_l17_n23(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n685(x)
+    if (x < 1)
+        fun_l17_n983(x)
+    else
+        fun_l17_n470(x)
+    end
+end
+
+def fun_l16_n686(x)
+    if (x < 1)
+        fun_l17_n261(x)
+    else
+        fun_l17_n138(x)
+    end
+end
+
+def fun_l16_n687(x)
+    if (x < 1)
+        fun_l17_n791(x)
+    else
+        fun_l17_n474(x)
+    end
+end
+
+def fun_l16_n688(x)
+    if (x < 1)
+        fun_l17_n148(x)
+    else
+        fun_l17_n317(x)
+    end
+end
+
+def fun_l16_n689(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n529(x)
+    end
+end
+
+def fun_l16_n690(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n394(x)
+    end
+end
+
+def fun_l16_n691(x)
+    if (x < 1)
+        fun_l17_n193(x)
+    else
+        fun_l17_n348(x)
+    end
+end
+
+def fun_l16_n692(x)
+    if (x < 1)
+        fun_l17_n308(x)
+    else
+        fun_l17_n26(x)
+    end
+end
+
+def fun_l16_n693(x)
+    if (x < 1)
+        fun_l17_n502(x)
+    else
+        fun_l17_n517(x)
+    end
+end
+
+def fun_l16_n694(x)
+    if (x < 1)
+        fun_l17_n396(x)
+    else
+        fun_l17_n886(x)
+    end
+end
+
+def fun_l16_n695(x)
+    if (x < 1)
+        fun_l17_n179(x)
+    else
+        fun_l17_n35(x)
+    end
+end
+
+def fun_l16_n696(x)
+    if (x < 1)
+        fun_l17_n431(x)
+    else
+        fun_l17_n392(x)
+    end
+end
+
+def fun_l16_n697(x)
+    if (x < 1)
+        fun_l17_n778(x)
+    else
+        fun_l17_n766(x)
+    end
+end
+
+def fun_l16_n698(x)
+    if (x < 1)
+        fun_l17_n868(x)
+    else
+        fun_l17_n31(x)
+    end
+end
+
+def fun_l16_n699(x)
+    if (x < 1)
+        fun_l17_n277(x)
+    else
+        fun_l17_n649(x)
+    end
+end
+
+def fun_l16_n700(x)
+    if (x < 1)
+        fun_l17_n638(x)
+    else
+        fun_l17_n411(x)
+    end
+end
+
+def fun_l16_n701(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n702(x)
+    if (x < 1)
+        fun_l17_n530(x)
+    else
+        fun_l17_n540(x)
+    end
+end
+
+def fun_l16_n703(x)
+    if (x < 1)
+        fun_l17_n691(x)
+    else
+        fun_l17_n550(x)
+    end
+end
+
+def fun_l16_n704(x)
+    if (x < 1)
+        fun_l17_n691(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n705(x)
+    if (x < 1)
+        fun_l17_n744(x)
+    else
+        fun_l17_n333(x)
+    end
+end
+
+def fun_l16_n706(x)
+    if (x < 1)
+        fun_l17_n845(x)
+    else
+        fun_l17_n229(x)
+    end
+end
+
+def fun_l16_n707(x)
+    if (x < 1)
+        fun_l17_n784(x)
+    else
+        fun_l17_n123(x)
+    end
+end
+
+def fun_l16_n708(x)
+    if (x < 1)
+        fun_l17_n88(x)
+    else
+        fun_l17_n961(x)
+    end
+end
+
+def fun_l16_n709(x)
+    if (x < 1)
+        fun_l17_n310(x)
+    else
+        fun_l17_n943(x)
+    end
+end
+
+def fun_l16_n710(x)
+    if (x < 1)
+        fun_l17_n265(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n711(x)
+    if (x < 1)
+        fun_l17_n483(x)
+    else
+        fun_l17_n577(x)
+    end
+end
+
+def fun_l16_n712(x)
+    if (x < 1)
+        fun_l17_n703(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n713(x)
+    if (x < 1)
+        fun_l17_n301(x)
+    else
+        fun_l17_n17(x)
+    end
+end
+
+def fun_l16_n714(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n647(x)
+    end
+end
+
+def fun_l16_n715(x)
+    if (x < 1)
+        fun_l17_n628(x)
+    else
+        fun_l17_n748(x)
+    end
+end
+
+def fun_l16_n716(x)
+    if (x < 1)
+        fun_l17_n10(x)
+    else
+        fun_l17_n632(x)
+    end
+end
+
+def fun_l16_n717(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n888(x)
+    end
+end
+
+def fun_l16_n718(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n719(x)
+    if (x < 1)
+        fun_l17_n811(x)
+    else
+        fun_l17_n46(x)
+    end
+end
+
+def fun_l16_n720(x)
+    if (x < 1)
+        fun_l17_n227(x)
+    else
+        fun_l17_n89(x)
+    end
+end
+
+def fun_l16_n721(x)
+    if (x < 1)
+        fun_l17_n780(x)
+    else
+        fun_l17_n941(x)
+    end
+end
+
+def fun_l16_n722(x)
+    if (x < 1)
+        fun_l17_n877(x)
+    else
+        fun_l17_n262(x)
+    end
+end
+
+def fun_l16_n723(x)
+    if (x < 1)
+        fun_l17_n649(x)
+    else
+        fun_l17_n477(x)
+    end
+end
+
+def fun_l16_n724(x)
+    if (x < 1)
+        fun_l17_n902(x)
+    else
+        fun_l17_n315(x)
+    end
+end
+
+def fun_l16_n725(x)
+    if (x < 1)
+        fun_l17_n985(x)
+    else
+        fun_l17_n232(x)
+    end
+end
+
+def fun_l16_n726(x)
+    if (x < 1)
+        fun_l17_n5(x)
+    else
+        fun_l17_n981(x)
+    end
+end
+
+def fun_l16_n727(x)
+    if (x < 1)
+        fun_l17_n730(x)
+    else
+        fun_l17_n780(x)
+    end
+end
+
+def fun_l16_n728(x)
+    if (x < 1)
+        fun_l17_n626(x)
+    else
+        fun_l17_n272(x)
+    end
+end
+
+def fun_l16_n729(x)
+    if (x < 1)
+        fun_l17_n380(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n730(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n861(x)
+    end
+end
+
+def fun_l16_n731(x)
+    if (x < 1)
+        fun_l17_n351(x)
+    else
+        fun_l17_n948(x)
+    end
+end
+
+def fun_l16_n732(x)
+    if (x < 1)
+        fun_l17_n864(x)
+    else
+        fun_l17_n60(x)
+    end
+end
+
+def fun_l16_n733(x)
+    if (x < 1)
+        fun_l17_n974(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n734(x)
+    if (x < 1)
+        fun_l17_n855(x)
+    else
+        fun_l17_n988(x)
+    end
+end
+
+def fun_l16_n735(x)
+    if (x < 1)
+        fun_l17_n740(x)
+    else
+        fun_l17_n559(x)
+    end
+end
+
+def fun_l16_n736(x)
+    if (x < 1)
+        fun_l17_n449(x)
+    else
+        fun_l17_n580(x)
+    end
+end
+
+def fun_l16_n737(x)
+    if (x < 1)
+        fun_l17_n313(x)
+    else
+        fun_l17_n462(x)
+    end
+end
+
+def fun_l16_n738(x)
+    if (x < 1)
+        fun_l17_n177(x)
+    else
+        fun_l17_n812(x)
+    end
+end
+
+def fun_l16_n739(x)
+    if (x < 1)
+        fun_l17_n518(x)
+    else
+        fun_l17_n453(x)
+    end
+end
+
+def fun_l16_n740(x)
+    if (x < 1)
+        fun_l17_n190(x)
+    else
+        fun_l17_n722(x)
+    end
+end
+
+def fun_l16_n741(x)
+    if (x < 1)
+        fun_l17_n509(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n742(x)
+    if (x < 1)
+        fun_l17_n901(x)
+    else
+        fun_l17_n497(x)
+    end
+end
+
+def fun_l16_n743(x)
+    if (x < 1)
+        fun_l17_n19(x)
+    else
+        fun_l17_n789(x)
+    end
+end
+
+def fun_l16_n744(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n554(x)
+    end
+end
+
+def fun_l16_n745(x)
+    if (x < 1)
+        fun_l17_n106(x)
+    else
+        fun_l17_n255(x)
+    end
+end
+
+def fun_l16_n746(x)
+    if (x < 1)
+        fun_l17_n942(x)
+    else
+        fun_l17_n701(x)
+    end
+end
+
+def fun_l16_n747(x)
+    if (x < 1)
+        fun_l17_n738(x)
+    else
+        fun_l17_n459(x)
+    end
+end
+
+def fun_l16_n748(x)
+    if (x < 1)
+        fun_l17_n984(x)
+    else
+        fun_l17_n501(x)
+    end
+end
+
+def fun_l16_n749(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n750(x)
+    if (x < 1)
+        fun_l17_n956(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n751(x)
+    if (x < 1)
+        fun_l17_n549(x)
+    else
+        fun_l17_n406(x)
+    end
+end
+
+def fun_l16_n752(x)
+    if (x < 1)
+        fun_l17_n671(x)
+    else
+        fun_l17_n809(x)
+    end
+end
+
+def fun_l16_n753(x)
+    if (x < 1)
+        fun_l17_n807(x)
+    else
+        fun_l17_n544(x)
+    end
+end
+
+def fun_l16_n754(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n705(x)
+    end
+end
+
+def fun_l16_n755(x)
+    if (x < 1)
+        fun_l17_n822(x)
+    else
+        fun_l17_n627(x)
+    end
+end
+
+def fun_l16_n756(x)
+    if (x < 1)
+        fun_l17_n429(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n757(x)
+    if (x < 1)
+        fun_l17_n327(x)
+    else
+        fun_l17_n391(x)
+    end
+end
+
+def fun_l16_n758(x)
+    if (x < 1)
+        fun_l17_n335(x)
+    else
+        fun_l17_n779(x)
+    end
+end
+
+def fun_l16_n759(x)
+    if (x < 1)
+        fun_l17_n149(x)
+    else
+        fun_l17_n637(x)
+    end
+end
+
+def fun_l16_n760(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n616(x)
+    end
+end
+
+def fun_l16_n761(x)
+    if (x < 1)
+        fun_l17_n997(x)
+    else
+        fun_l17_n189(x)
+    end
+end
+
+def fun_l16_n762(x)
+    if (x < 1)
+        fun_l17_n779(x)
+    else
+        fun_l17_n175(x)
+    end
+end
+
+def fun_l16_n763(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n473(x)
+    end
+end
+
+def fun_l16_n764(x)
+    if (x < 1)
+        fun_l17_n784(x)
+    else
+        fun_l17_n415(x)
+    end
+end
+
+def fun_l16_n765(x)
+    if (x < 1)
+        fun_l17_n809(x)
+    else
+        fun_l17_n263(x)
+    end
+end
+
+def fun_l16_n766(x)
+    if (x < 1)
+        fun_l17_n114(x)
+    else
+        fun_l17_n898(x)
+    end
+end
+
+def fun_l16_n767(x)
+    if (x < 1)
+        fun_l17_n983(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n768(x)
+    if (x < 1)
+        fun_l17_n141(x)
+    else
+        fun_l17_n492(x)
+    end
+end
+
+def fun_l16_n769(x)
+    if (x < 1)
+        fun_l17_n216(x)
+    else
+        fun_l17_n610(x)
+    end
+end
+
+def fun_l16_n770(x)
+    if (x < 1)
+        fun_l17_n797(x)
+    else
+        fun_l17_n164(x)
+    end
+end
+
+def fun_l16_n771(x)
+    if (x < 1)
+        fun_l17_n434(x)
+    else
+        fun_l17_n876(x)
+    end
+end
+
+def fun_l16_n772(x)
+    if (x < 1)
+        fun_l17_n165(x)
+    else
+        fun_l17_n646(x)
+    end
+end
+
+def fun_l16_n773(x)
+    if (x < 1)
+        fun_l17_n359(x)
+    else
+        fun_l17_n754(x)
+    end
+end
+
+def fun_l16_n774(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n745(x)
+    end
+end
+
+def fun_l16_n775(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n673(x)
+    end
+end
+
+def fun_l16_n776(x)
+    if (x < 1)
+        fun_l17_n51(x)
+    else
+        fun_l17_n708(x)
+    end
+end
+
+def fun_l16_n777(x)
+    if (x < 1)
+        fun_l17_n451(x)
+    else
+        fun_l17_n30(x)
+    end
+end
+
+def fun_l16_n778(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n779(x)
+    if (x < 1)
+        fun_l17_n727(x)
+    else
+        fun_l17_n71(x)
+    end
+end
+
+def fun_l16_n780(x)
+    if (x < 1)
+        fun_l17_n404(x)
+    else
+        fun_l17_n42(x)
+    end
+end
+
+def fun_l16_n781(x)
+    if (x < 1)
+        fun_l17_n926(x)
+    else
+        fun_l17_n53(x)
+    end
+end
+
+def fun_l16_n782(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n429(x)
+    end
+end
+
+def fun_l16_n783(x)
+    if (x < 1)
+        fun_l17_n887(x)
+    else
+        fun_l17_n912(x)
+    end
+end
+
+def fun_l16_n784(x)
+    if (x < 1)
+        fun_l17_n900(x)
+    else
+        fun_l17_n163(x)
+    end
+end
+
+def fun_l16_n785(x)
+    if (x < 1)
+        fun_l17_n589(x)
+    else
+        fun_l17_n271(x)
+    end
+end
+
+def fun_l16_n786(x)
+    if (x < 1)
+        fun_l17_n732(x)
+    else
+        fun_l17_n296(x)
+    end
+end
+
+def fun_l16_n787(x)
+    if (x < 1)
+        fun_l17_n711(x)
+    else
+        fun_l17_n777(x)
+    end
+end
+
+def fun_l16_n788(x)
+    if (x < 1)
+        fun_l17_n426(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n789(x)
+    if (x < 1)
+        fun_l17_n833(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n790(x)
+    if (x < 1)
+        fun_l17_n680(x)
+    else
+        fun_l17_n707(x)
+    end
+end
+
+def fun_l16_n791(x)
+    if (x < 1)
+        fun_l17_n668(x)
+    else
+        fun_l17_n727(x)
+    end
+end
+
+def fun_l16_n792(x)
+    if (x < 1)
+        fun_l17_n948(x)
+    else
+        fun_l17_n160(x)
+    end
+end
+
+def fun_l16_n793(x)
+    if (x < 1)
+        fun_l17_n847(x)
+    else
+        fun_l17_n643(x)
+    end
+end
+
+def fun_l16_n794(x)
+    if (x < 1)
+        fun_l17_n89(x)
+    else
+        fun_l17_n704(x)
+    end
+end
+
+def fun_l16_n795(x)
+    if (x < 1)
+        fun_l17_n52(x)
+    else
+        fun_l17_n307(x)
+    end
+end
+
+def fun_l16_n796(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n797(x)
+    if (x < 1)
+        fun_l17_n343(x)
+    else
+        fun_l17_n969(x)
+    end
+end
+
+def fun_l16_n798(x)
+    if (x < 1)
+        fun_l17_n850(x)
+    else
+        fun_l17_n975(x)
+    end
+end
+
+def fun_l16_n799(x)
+    if (x < 1)
+        fun_l17_n119(x)
+    else
+        fun_l17_n303(x)
+    end
+end
+
+def fun_l16_n800(x)
+    if (x < 1)
+        fun_l17_n870(x)
+    else
+        fun_l17_n4(x)
+    end
+end
+
+def fun_l16_n801(x)
+    if (x < 1)
+        fun_l17_n223(x)
+    else
+        fun_l17_n618(x)
+    end
+end
+
+def fun_l16_n802(x)
+    if (x < 1)
+        fun_l17_n183(x)
+    else
+        fun_l17_n358(x)
+    end
+end
+
+def fun_l16_n803(x)
+    if (x < 1)
+        fun_l17_n152(x)
+    else
+        fun_l17_n76(x)
+    end
+end
+
+def fun_l16_n804(x)
+    if (x < 1)
+        fun_l17_n487(x)
+    else
+        fun_l17_n475(x)
+    end
+end
+
+def fun_l16_n805(x)
+    if (x < 1)
+        fun_l17_n900(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n806(x)
+    if (x < 1)
+        fun_l17_n881(x)
+    else
+        fun_l17_n523(x)
+    end
+end
+
+def fun_l16_n807(x)
+    if (x < 1)
+        fun_l17_n686(x)
+    else
+        fun_l17_n5(x)
+    end
+end
+
+def fun_l16_n808(x)
+    if (x < 1)
+        fun_l17_n841(x)
+    else
+        fun_l17_n73(x)
+    end
+end
+
+def fun_l16_n809(x)
+    if (x < 1)
+        fun_l17_n737(x)
+    else
+        fun_l17_n590(x)
+    end
+end
+
+def fun_l16_n810(x)
+    if (x < 1)
+        fun_l17_n252(x)
+    else
+        fun_l17_n867(x)
+    end
+end
+
+def fun_l16_n811(x)
+    if (x < 1)
+        fun_l17_n333(x)
+    else
+        fun_l17_n418(x)
+    end
+end
+
+def fun_l16_n812(x)
+    if (x < 1)
+        fun_l17_n155(x)
+    else
+        fun_l17_n104(x)
+    end
+end
+
+def fun_l16_n813(x)
+    if (x < 1)
+        fun_l17_n933(x)
+    else
+        fun_l17_n344(x)
+    end
+end
+
+def fun_l16_n814(x)
+    if (x < 1)
+        fun_l17_n107(x)
+    else
+        fun_l17_n784(x)
+    end
+end
+
+def fun_l16_n815(x)
+    if (x < 1)
+        fun_l17_n355(x)
+    else
+        fun_l17_n184(x)
+    end
+end
+
+def fun_l16_n816(x)
+    if (x < 1)
+        fun_l17_n266(x)
+    else
+        fun_l17_n315(x)
+    end
+end
+
+def fun_l16_n817(x)
+    if (x < 1)
+        fun_l17_n821(x)
+    else
+        fun_l17_n534(x)
+    end
+end
+
+def fun_l16_n818(x)
+    if (x < 1)
+        fun_l17_n126(x)
+    else
+        fun_l17_n712(x)
+    end
+end
+
+def fun_l16_n819(x)
+    if (x < 1)
+        fun_l17_n309(x)
+    else
+        fun_l17_n39(x)
+    end
+end
+
+def fun_l16_n820(x)
+    if (x < 1)
+        fun_l17_n629(x)
+    else
+        fun_l17_n689(x)
+    end
+end
+
+def fun_l16_n821(x)
+    if (x < 1)
+        fun_l17_n35(x)
+    else
+        fun_l17_n250(x)
+    end
+end
+
+def fun_l16_n822(x)
+    if (x < 1)
+        fun_l17_n276(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n823(x)
+    if (x < 1)
+        fun_l17_n775(x)
+    else
+        fun_l17_n542(x)
+    end
+end
+
+def fun_l16_n824(x)
+    if (x < 1)
+        fun_l17_n739(x)
+    else
+        fun_l17_n441(x)
+    end
+end
+
+def fun_l16_n825(x)
+    if (x < 1)
+        fun_l17_n86(x)
+    else
+        fun_l17_n360(x)
+    end
+end
+
+def fun_l16_n826(x)
+    if (x < 1)
+        fun_l17_n196(x)
+    else
+        fun_l17_n406(x)
+    end
+end
+
+def fun_l16_n827(x)
+    if (x < 1)
+        fun_l17_n612(x)
+    else
+        fun_l17_n471(x)
+    end
+end
+
+def fun_l16_n828(x)
+    if (x < 1)
+        fun_l17_n409(x)
+    else
+        fun_l17_n572(x)
+    end
+end
+
+def fun_l16_n829(x)
+    if (x < 1)
+        fun_l17_n347(x)
+    else
+        fun_l17_n450(x)
+    end
+end
+
+def fun_l16_n830(x)
+    if (x < 1)
+        fun_l17_n75(x)
+    else
+        fun_l17_n185(x)
+    end
+end
+
+def fun_l16_n831(x)
+    if (x < 1)
+        fun_l17_n904(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n832(x)
+    if (x < 1)
+        fun_l17_n889(x)
+    else
+        fun_l17_n651(x)
+    end
+end
+
+def fun_l16_n833(x)
+    if (x < 1)
+        fun_l17_n670(x)
+    else
+        fun_l17_n216(x)
+    end
+end
+
+def fun_l16_n834(x)
+    if (x < 1)
+        fun_l17_n212(x)
+    else
+        fun_l17_n445(x)
+    end
+end
+
+def fun_l16_n835(x)
+    if (x < 1)
+        fun_l17_n453(x)
+    else
+        fun_l17_n187(x)
+    end
+end
+
+def fun_l16_n836(x)
+    if (x < 1)
+        fun_l17_n614(x)
+    else
+        fun_l17_n203(x)
+    end
+end
+
+def fun_l16_n837(x)
+    if (x < 1)
+        fun_l17_n177(x)
+    else
+        fun_l17_n721(x)
+    end
+end
+
+def fun_l16_n838(x)
+    if (x < 1)
+        fun_l17_n910(x)
+    else
+        fun_l17_n510(x)
+    end
+end
+
+def fun_l16_n839(x)
+    if (x < 1)
+        fun_l17_n880(x)
+    else
+        fun_l17_n365(x)
+    end
+end
+
+def fun_l16_n840(x)
+    if (x < 1)
+        fun_l17_n336(x)
+    else
+        fun_l17_n483(x)
+    end
+end
+
+def fun_l16_n841(x)
+    if (x < 1)
+        fun_l17_n83(x)
+    else
+        fun_l17_n947(x)
+    end
+end
+
+def fun_l16_n842(x)
+    if (x < 1)
+        fun_l17_n723(x)
+    else
+        fun_l17_n209(x)
+    end
+end
+
+def fun_l16_n843(x)
+    if (x < 1)
+        fun_l17_n432(x)
+    else
+        fun_l17_n664(x)
+    end
+end
+
+def fun_l16_n844(x)
+    if (x < 1)
+        fun_l17_n906(x)
+    else
+        fun_l17_n472(x)
+    end
+end
+
+def fun_l16_n845(x)
+    if (x < 1)
+        fun_l17_n147(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n846(x)
+    if (x < 1)
+        fun_l17_n296(x)
+    else
+        fun_l17_n44(x)
+    end
+end
+
+def fun_l16_n847(x)
+    if (x < 1)
+        fun_l17_n498(x)
+    else
+        fun_l17_n764(x)
+    end
+end
+
+def fun_l16_n848(x)
+    if (x < 1)
+        fun_l17_n428(x)
+    else
+        fun_l17_n575(x)
+    end
+end
+
+def fun_l16_n849(x)
+    if (x < 1)
+        fun_l17_n311(x)
+    else
+        fun_l17_n975(x)
+    end
+end
+
+def fun_l16_n850(x)
+    if (x < 1)
+        fun_l17_n482(x)
+    else
+        fun_l17_n388(x)
+    end
+end
+
+def fun_l16_n851(x)
+    if (x < 1)
+        fun_l17_n174(x)
+    else
+        fun_l17_n190(x)
+    end
+end
+
+def fun_l16_n852(x)
+    if (x < 1)
+        fun_l17_n28(x)
+    else
+        fun_l17_n598(x)
+    end
+end
+
+def fun_l16_n853(x)
+    if (x < 1)
+        fun_l17_n142(x)
+    else
+        fun_l17_n340(x)
+    end
+end
+
+def fun_l16_n854(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n226(x)
+    end
+end
+
+def fun_l16_n855(x)
+    if (x < 1)
+        fun_l17_n268(x)
+    else
+        fun_l17_n201(x)
+    end
+end
+
+def fun_l16_n856(x)
+    if (x < 1)
+        fun_l17_n52(x)
+    else
+        fun_l17_n871(x)
+    end
+end
+
+def fun_l16_n857(x)
+    if (x < 1)
+        fun_l17_n30(x)
+    else
+        fun_l17_n673(x)
+    end
+end
+
+def fun_l16_n858(x)
+    if (x < 1)
+        fun_l17_n794(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n859(x)
+    if (x < 1)
+        fun_l17_n162(x)
+    else
+        fun_l17_n655(x)
+    end
+end
+
+def fun_l16_n860(x)
+    if (x < 1)
+        fun_l17_n770(x)
+    else
+        fun_l17_n879(x)
+    end
+end
+
+def fun_l16_n861(x)
+    if (x < 1)
+        fun_l17_n93(x)
+    else
+        fun_l17_n338(x)
+    end
+end
+
+def fun_l16_n862(x)
+    if (x < 1)
+        fun_l17_n468(x)
+    else
+        fun_l17_n977(x)
+    end
+end
+
+def fun_l16_n863(x)
+    if (x < 1)
+        fun_l17_n627(x)
+    else
+        fun_l17_n296(x)
+    end
+end
+
+def fun_l16_n864(x)
+    if (x < 1)
+        fun_l17_n402(x)
+    else
+        fun_l17_n515(x)
+    end
+end
+
+def fun_l16_n865(x)
+    if (x < 1)
+        fun_l17_n793(x)
+    else
+        fun_l17_n62(x)
+    end
+end
+
+def fun_l16_n866(x)
+    if (x < 1)
+        fun_l17_n87(x)
+    else
+        fun_l17_n532(x)
+    end
+end
+
+def fun_l16_n867(x)
+    if (x < 1)
+        fun_l17_n766(x)
+    else
+        fun_l17_n162(x)
+    end
+end
+
+def fun_l16_n868(x)
+    if (x < 1)
+        fun_l17_n214(x)
+    else
+        fun_l17_n827(x)
+    end
+end
+
+def fun_l16_n869(x)
+    if (x < 1)
+        fun_l17_n879(x)
+    else
+        fun_l17_n285(x)
+    end
+end
+
+def fun_l16_n870(x)
+    if (x < 1)
+        fun_l17_n619(x)
+    else
+        fun_l17_n648(x)
+    end
+end
+
+def fun_l16_n871(x)
+    if (x < 1)
+        fun_l17_n150(x)
+    else
+        fun_l17_n458(x)
+    end
+end
+
+def fun_l16_n872(x)
+    if (x < 1)
+        fun_l17_n346(x)
+    else
+        fun_l17_n824(x)
+    end
+end
+
+def fun_l16_n873(x)
+    if (x < 1)
+        fun_l17_n839(x)
+    else
+        fun_l17_n188(x)
+    end
+end
+
+def fun_l16_n874(x)
+    if (x < 1)
+        fun_l17_n202(x)
+    else
+        fun_l17_n147(x)
+    end
+end
+
+def fun_l16_n875(x)
+    if (x < 1)
+        fun_l17_n779(x)
+    else
+        fun_l17_n217(x)
+    end
+end
+
+def fun_l16_n876(x)
+    if (x < 1)
+        fun_l17_n417(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n877(x)
+    if (x < 1)
+        fun_l17_n971(x)
+    else
+        fun_l17_n825(x)
+    end
+end
+
+def fun_l16_n878(x)
+    if (x < 1)
+        fun_l17_n843(x)
+    else
+        fun_l17_n431(x)
+    end
+end
+
+def fun_l16_n879(x)
+    if (x < 1)
+        fun_l17_n560(x)
+    else
+        fun_l17_n421(x)
+    end
+end
+
+def fun_l16_n880(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n101(x)
+    end
+end
+
+def fun_l16_n881(x)
+    if (x < 1)
+        fun_l17_n458(x)
+    else
+        fun_l17_n805(x)
+    end
+end
+
+def fun_l16_n882(x)
+    if (x < 1)
+        fun_l17_n590(x)
+    else
+        fun_l17_n924(x)
+    end
+end
+
+def fun_l16_n883(x)
+    if (x < 1)
+        fun_l17_n753(x)
+    else
+        fun_l17_n128(x)
+    end
+end
+
+def fun_l16_n884(x)
+    if (x < 1)
+        fun_l17_n271(x)
+    else
+        fun_l17_n366(x)
+    end
+end
+
+def fun_l16_n885(x)
+    if (x < 1)
+        fun_l17_n251(x)
+    else
+        fun_l17_n581(x)
+    end
+end
+
+def fun_l16_n886(x)
+    if (x < 1)
+        fun_l17_n82(x)
+    else
+        fun_l17_n212(x)
+    end
+end
+
+def fun_l16_n887(x)
+    if (x < 1)
+        fun_l17_n254(x)
+    else
+        fun_l17_n476(x)
+    end
+end
+
+def fun_l16_n888(x)
+    if (x < 1)
+        fun_l17_n774(x)
+    else
+        fun_l17_n23(x)
+    end
+end
+
+def fun_l16_n889(x)
+    if (x < 1)
+        fun_l17_n258(x)
+    else
+        fun_l17_n931(x)
+    end
+end
+
+def fun_l16_n890(x)
+    if (x < 1)
+        fun_l17_n60(x)
+    else
+        fun_l17_n267(x)
+    end
+end
+
+def fun_l16_n891(x)
+    if (x < 1)
+        fun_l17_n465(x)
+    else
+        fun_l17_n298(x)
+    end
+end
+
+def fun_l16_n892(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n59(x)
+    end
+end
+
+def fun_l16_n893(x)
+    if (x < 1)
+        fun_l17_n485(x)
+    else
+        fun_l17_n19(x)
+    end
+end
+
+def fun_l16_n894(x)
+    if (x < 1)
+        fun_l17_n676(x)
+    else
+        fun_l17_n196(x)
+    end
+end
+
+def fun_l16_n895(x)
+    if (x < 1)
+        fun_l17_n894(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n896(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n115(x)
+    end
+end
+
+def fun_l16_n897(x)
+    if (x < 1)
+        fun_l17_n161(x)
+    else
+        fun_l17_n47(x)
+    end
+end
+
+def fun_l16_n898(x)
+    if (x < 1)
+        fun_l17_n598(x)
+    else
+        fun_l17_n796(x)
+    end
+end
+
+def fun_l16_n899(x)
+    if (x < 1)
+        fun_l17_n191(x)
+    else
+        fun_l17_n36(x)
+    end
+end
+
+def fun_l16_n900(x)
+    if (x < 1)
+        fun_l17_n803(x)
+    else
+        fun_l17_n894(x)
+    end
+end
+
+def fun_l16_n901(x)
+    if (x < 1)
+        fun_l17_n225(x)
+    else
+        fun_l17_n608(x)
+    end
+end
+
+def fun_l16_n902(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n667(x)
+    end
+end
+
+def fun_l16_n903(x)
+    if (x < 1)
+        fun_l17_n815(x)
+    else
+        fun_l17_n645(x)
+    end
+end
+
+def fun_l16_n904(x)
+    if (x < 1)
+        fun_l17_n891(x)
+    else
+        fun_l17_n465(x)
+    end
+end
+
+def fun_l16_n905(x)
+    if (x < 1)
+        fun_l17_n789(x)
+    else
+        fun_l17_n573(x)
+    end
+end
+
+def fun_l16_n906(x)
+    if (x < 1)
+        fun_l17_n139(x)
+    else
+        fun_l17_n745(x)
+    end
+end
+
+def fun_l16_n907(x)
+    if (x < 1)
+        fun_l17_n632(x)
+    else
+        fun_l17_n625(x)
+    end
+end
+
+def fun_l16_n908(x)
+    if (x < 1)
+        fun_l17_n249(x)
+    else
+        fun_l17_n279(x)
+    end
+end
+
+def fun_l16_n909(x)
+    if (x < 1)
+        fun_l17_n357(x)
+    else
+        fun_l17_n477(x)
+    end
+end
+
+def fun_l16_n910(x)
+    if (x < 1)
+        fun_l17_n796(x)
+    else
+        fun_l17_n313(x)
+    end
+end
+
+def fun_l16_n911(x)
+    if (x < 1)
+        fun_l17_n917(x)
+    else
+        fun_l17_n775(x)
+    end
+end
+
+def fun_l16_n912(x)
+    if (x < 1)
+        fun_l17_n451(x)
+    else
+        fun_l17_n102(x)
+    end
+end
+
+def fun_l16_n913(x)
+    if (x < 1)
+        fun_l17_n782(x)
+    else
+        fun_l17_n998(x)
+    end
+end
+
+def fun_l16_n914(x)
+    if (x < 1)
+        fun_l17_n237(x)
+    else
+        fun_l17_n586(x)
+    end
+end
+
+def fun_l16_n915(x)
+    if (x < 1)
+        fun_l17_n399(x)
+    else
+        fun_l17_n676(x)
+    end
+end
+
+def fun_l16_n916(x)
+    if (x < 1)
+        fun_l17_n65(x)
+    else
+        fun_l17_n61(x)
+    end
+end
+
+def fun_l16_n917(x)
+    if (x < 1)
+        fun_l17_n861(x)
+    else
+        fun_l17_n72(x)
+    end
+end
+
+def fun_l16_n918(x)
+    if (x < 1)
+        fun_l17_n375(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n919(x)
+    if (x < 1)
+        fun_l17_n776(x)
+    else
+        fun_l17_n302(x)
+    end
+end
+
+def fun_l16_n920(x)
+    if (x < 1)
+        fun_l17_n216(x)
+    else
+        fun_l17_n804(x)
+    end
+end
+
+def fun_l16_n921(x)
+    if (x < 1)
+        fun_l17_n667(x)
+    else
+        fun_l17_n593(x)
+    end
+end
+
+def fun_l16_n922(x)
+    if (x < 1)
+        fun_l17_n499(x)
+    else
+        fun_l17_n577(x)
+    end
+end
+
+def fun_l16_n923(x)
+    if (x < 1)
+        fun_l17_n41(x)
+    else
+        fun_l17_n316(x)
+    end
+end
+
+def fun_l16_n924(x)
+    if (x < 1)
+        fun_l17_n521(x)
+    else
+        fun_l17_n86(x)
+    end
+end
+
+def fun_l16_n925(x)
+    if (x < 1)
+        fun_l17_n695(x)
+    else
+        fun_l17_n662(x)
+    end
+end
+
+def fun_l16_n926(x)
+    if (x < 1)
+        fun_l17_n379(x)
+    else
+        fun_l17_n58(x)
+    end
+end
+
+def fun_l16_n927(x)
+    if (x < 1)
+        fun_l17_n820(x)
+    else
+        fun_l17_n801(x)
+    end
+end
+
+def fun_l16_n928(x)
+    if (x < 1)
+        fun_l17_n175(x)
+    else
+        fun_l17_n865(x)
+    end
+end
+
+def fun_l16_n929(x)
+    if (x < 1)
+        fun_l17_n903(x)
+    else
+        fun_l17_n644(x)
+    end
+end
+
+def fun_l16_n930(x)
+    if (x < 1)
+        fun_l17_n801(x)
+    else
+        fun_l17_n265(x)
+    end
+end
+
+def fun_l16_n931(x)
+    if (x < 1)
+        fun_l17_n292(x)
+    else
+        fun_l17_n897(x)
+    end
+end
+
+def fun_l16_n932(x)
+    if (x < 1)
+        fun_l17_n666(x)
+    else
+        fun_l17_n531(x)
+    end
+end
+
+def fun_l16_n933(x)
+    if (x < 1)
+        fun_l17_n929(x)
+    else
+        fun_l17_n205(x)
+    end
+end
+
+def fun_l16_n934(x)
+    if (x < 1)
+        fun_l17_n557(x)
+    else
+        fun_l17_n70(x)
+    end
+end
+
+def fun_l16_n935(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n194(x)
+    end
+end
+
+def fun_l16_n936(x)
+    if (x < 1)
+        fun_l17_n277(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n937(x)
+    if (x < 1)
+        fun_l17_n464(x)
+    else
+        fun_l17_n482(x)
+    end
+end
+
+def fun_l16_n938(x)
+    if (x < 1)
+        fun_l17_n782(x)
+    else
+        fun_l17_n60(x)
+    end
+end
+
+def fun_l16_n939(x)
+    if (x < 1)
+        fun_l17_n780(x)
+    else
+        fun_l17_n786(x)
+    end
+end
+
+def fun_l16_n940(x)
+    if (x < 1)
+        fun_l17_n201(x)
+    else
+        fun_l17_n614(x)
+    end
+end
+
+def fun_l16_n941(x)
+    if (x < 1)
+        fun_l17_n318(x)
+    else
+        fun_l17_n210(x)
+    end
+end
+
+def fun_l16_n942(x)
+    if (x < 1)
+        fun_l17_n831(x)
+    else
+        fun_l17_n293(x)
+    end
+end
+
+def fun_l16_n943(x)
+    if (x < 1)
+        fun_l17_n368(x)
+    else
+        fun_l17_n292(x)
+    end
+end
+
+def fun_l16_n944(x)
+    if (x < 1)
+        fun_l17_n924(x)
+    else
+        fun_l17_n20(x)
+    end
+end
+
+def fun_l16_n945(x)
+    if (x < 1)
+        fun_l17_n340(x)
+    else
+        fun_l17_n268(x)
+    end
+end
+
+def fun_l16_n946(x)
+    if (x < 1)
+        fun_l17_n913(x)
+    else
+        fun_l17_n877(x)
+    end
+end
+
+def fun_l16_n947(x)
+    if (x < 1)
+        fun_l17_n577(x)
+    else
+        fun_l17_n973(x)
+    end
+end
+
+def fun_l16_n948(x)
+    if (x < 1)
+        fun_l17_n101(x)
+    else
+        fun_l17_n350(x)
+    end
+end
+
+def fun_l16_n949(x)
+    if (x < 1)
+        fun_l17_n1(x)
+    else
+        fun_l17_n683(x)
+    end
+end
+
+def fun_l16_n950(x)
+    if (x < 1)
+        fun_l17_n290(x)
+    else
+        fun_l17_n30(x)
+    end
+end
+
+def fun_l16_n951(x)
+    if (x < 1)
+        fun_l17_n965(x)
+    else
+        fun_l17_n165(x)
+    end
+end
+
+def fun_l16_n952(x)
+    if (x < 1)
+        fun_l17_n532(x)
+    else
+        fun_l17_n887(x)
+    end
+end
+
+def fun_l16_n953(x)
+    if (x < 1)
+        fun_l17_n73(x)
+    else
+        fun_l17_n82(x)
+    end
+end
+
+def fun_l16_n954(x)
+    if (x < 1)
+        fun_l17_n518(x)
+    else
+        fun_l17_n886(x)
+    end
+end
+
+def fun_l16_n955(x)
+    if (x < 1)
+        fun_l17_n990(x)
+    else
+        fun_l17_n213(x)
+    end
+end
+
+def fun_l16_n956(x)
+    if (x < 1)
+        fun_l17_n489(x)
+    else
+        fun_l17_n937(x)
+    end
+end
+
+def fun_l16_n957(x)
+    if (x < 1)
+        fun_l17_n657(x)
+    else
+        fun_l17_n25(x)
+    end
+end
+
+def fun_l16_n958(x)
+    if (x < 1)
+        fun_l17_n988(x)
+    else
+        fun_l17_n684(x)
+    end
+end
+
+def fun_l16_n959(x)
+    if (x < 1)
+        fun_l17_n142(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n960(x)
+    if (x < 1)
+        fun_l17_n495(x)
+    else
+        fun_l17_n806(x)
+    end
+end
+
+def fun_l16_n961(x)
+    if (x < 1)
+        fun_l17_n92(x)
+    else
+        fun_l17_n137(x)
+    end
+end
+
+def fun_l16_n962(x)
+    if (x < 1)
+        fun_l17_n954(x)
+    else
+        fun_l17_n943(x)
+    end
+end
+
+def fun_l16_n963(x)
+    if (x < 1)
+        fun_l17_n761(x)
+    else
+        fun_l17_n839(x)
+    end
+end
+
+def fun_l16_n964(x)
+    if (x < 1)
+        fun_l17_n591(x)
+    else
+        fun_l17_n519(x)
+    end
+end
+
+def fun_l16_n965(x)
+    if (x < 1)
+        fun_l17_n548(x)
+    else
+        fun_l17_n190(x)
+    end
+end
+
+def fun_l16_n966(x)
+    if (x < 1)
+        fun_l17_n206(x)
+    else
+        fun_l17_n491(x)
+    end
+end
+
+def fun_l16_n967(x)
+    if (x < 1)
+        fun_l17_n895(x)
+    else
+        fun_l17_n404(x)
+    end
+end
+
+def fun_l16_n968(x)
+    if (x < 1)
+        fun_l17_n284(x)
+    else
+        fun_l17_n715(x)
+    end
+end
+
+def fun_l16_n969(x)
+    if (x < 1)
+        fun_l17_n507(x)
+    else
+        fun_l17_n623(x)
+    end
+end
+
+def fun_l16_n970(x)
+    if (x < 1)
+        fun_l17_n415(x)
+    else
+        fun_l17_n718(x)
+    end
+end
+
+def fun_l16_n971(x)
+    if (x < 1)
+        fun_l17_n72(x)
+    else
+        fun_l17_n938(x)
+    end
+end
+
+def fun_l16_n972(x)
+    if (x < 1)
+        fun_l17_n661(x)
+    else
+        fun_l17_n525(x)
+    end
+end
+
+def fun_l16_n973(x)
+    if (x < 1)
+        fun_l17_n314(x)
+    else
+        fun_l17_n195(x)
+    end
+end
+
+def fun_l16_n974(x)
+    if (x < 1)
+        fun_l17_n53(x)
+    else
+        fun_l17_n562(x)
+    end
+end
+
+def fun_l16_n975(x)
+    if (x < 1)
+        fun_l17_n381(x)
+    else
+        fun_l17_n241(x)
+    end
+end
+
+def fun_l16_n976(x)
+    if (x < 1)
+        fun_l17_n919(x)
+    else
+        fun_l17_n291(x)
+    end
+end
+
+def fun_l16_n977(x)
+    if (x < 1)
+        fun_l17_n455(x)
+    else
+        fun_l17_n773(x)
+    end
+end
+
+def fun_l16_n978(x)
+    if (x < 1)
+        fun_l17_n75(x)
+    else
+        fun_l17_n737(x)
+    end
+end
+
+def fun_l16_n979(x)
+    if (x < 1)
+        fun_l17_n68(x)
+    else
+        fun_l17_n339(x)
+    end
+end
+
+def fun_l16_n980(x)
+    if (x < 1)
+        fun_l17_n719(x)
+    else
+        fun_l17_n464(x)
+    end
+end
+
+def fun_l16_n981(x)
+    if (x < 1)
+        fun_l17_n681(x)
+    else
+        fun_l17_n611(x)
+    end
+end
+
+def fun_l16_n982(x)
+    if (x < 1)
+        fun_l17_n367(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n983(x)
+    if (x < 1)
+        fun_l17_n493(x)
+    else
+        fun_l17_n958(x)
+    end
+end
+
+def fun_l16_n984(x)
+    if (x < 1)
+        fun_l17_n271(x)
+    else
+        fun_l17_n982(x)
+    end
+end
+
+def fun_l16_n985(x)
+    if (x < 1)
+        fun_l17_n136(x)
+    else
+        fun_l17_n446(x)
+    end
+end
+
+def fun_l16_n986(x)
+    if (x < 1)
+        fun_l17_n362(x)
+    else
+        fun_l17_n114(x)
+    end
+end
+
+def fun_l16_n987(x)
+    if (x < 1)
+        fun_l17_n234(x)
+    else
+        fun_l17_n236(x)
+    end
+end
+
+def fun_l16_n988(x)
+    if (x < 1)
+        fun_l17_n339(x)
+    else
+        fun_l17_n2(x)
+    end
+end
+
+def fun_l16_n989(x)
+    if (x < 1)
+        fun_l17_n66(x)
+    else
+        fun_l17_n378(x)
+    end
+end
+
+def fun_l16_n990(x)
+    if (x < 1)
+        fun_l17_n366(x)
+    else
+        fun_l17_n289(x)
+    end
+end
+
+def fun_l16_n991(x)
+    if (x < 1)
+        fun_l17_n977(x)
+    else
+        fun_l17_n520(x)
+    end
+end
+
+def fun_l16_n992(x)
+    if (x < 1)
+        fun_l17_n953(x)
+    else
+        fun_l17_n254(x)
+    end
+end
+
+def fun_l16_n993(x)
+    if (x < 1)
+        fun_l17_n569(x)
+    else
+        fun_l17_n63(x)
+    end
+end
+
+def fun_l16_n994(x)
+    if (x < 1)
+        fun_l17_n844(x)
+    else
+        fun_l17_n42(x)
+    end
+end
+
+def fun_l16_n995(x)
+    if (x < 1)
+        fun_l17_n184(x)
+    else
+        fun_l17_n371(x)
+    end
+end
+
+def fun_l16_n996(x)
+    if (x < 1)
+        fun_l17_n229(x)
+    else
+        fun_l17_n309(x)
+    end
+end
+
+def fun_l16_n997(x)
+    if (x < 1)
+        fun_l17_n468(x)
+    else
+        fun_l17_n653(x)
+    end
+end
+
+def fun_l16_n998(x)
+    if (x < 1)
+        fun_l17_n173(x)
+    else
+        fun_l17_n709(x)
+    end
+end
+
+def fun_l16_n999(x)
+    if (x < 1)
+        fun_l17_n625(x)
+    else
+        fun_l17_n831(x)
+    end
+end
+
+def fun_l17_n0(x)
+    if (x < 1)
+        fun_l18_n495(x)
+    else
+        fun_l18_n122(x)
+    end
+end
+
+def fun_l17_n1(x)
+    if (x < 1)
+        fun_l18_n99(x)
+    else
+        fun_l18_n84(x)
+    end
+end
+
+def fun_l17_n2(x)
+    if (x < 1)
+        fun_l18_n464(x)
+    else
+        fun_l18_n321(x)
+    end
+end
+
+def fun_l17_n3(x)
+    if (x < 1)
+        fun_l18_n391(x)
+    else
+        fun_l18_n122(x)
+    end
+end
+
+def fun_l17_n4(x)
+    if (x < 1)
+        fun_l18_n65(x)
+    else
+        fun_l18_n514(x)
+    end
+end
+
+def fun_l17_n5(x)
+    if (x < 1)
+        fun_l18_n972(x)
+    else
+        fun_l18_n802(x)
+    end
+end
+
+def fun_l17_n6(x)
+    if (x < 1)
+        fun_l18_n577(x)
+    else
+        fun_l18_n26(x)
+    end
+end
+
+def fun_l17_n7(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n403(x)
+    end
+end
+
+def fun_l17_n8(x)
+    if (x < 1)
+        fun_l18_n466(x)
+    else
+        fun_l18_n162(x)
+    end
+end
+
+def fun_l17_n9(x)
+    if (x < 1)
+        fun_l18_n30(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n10(x)
+    if (x < 1)
+        fun_l18_n92(x)
+    else
+        fun_l18_n365(x)
+    end
+end
+
+def fun_l17_n11(x)
+    if (x < 1)
+        fun_l18_n230(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n12(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n38(x)
+    end
+end
+
+def fun_l17_n13(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n951(x)
+    end
+end
+
+def fun_l17_n14(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n15(x)
+    if (x < 1)
+        fun_l18_n592(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n16(x)
+    if (x < 1)
+        fun_l18_n524(x)
+    else
+        fun_l18_n812(x)
+    end
+end
+
+def fun_l17_n17(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n335(x)
+    end
+end
+
+def fun_l17_n18(x)
+    if (x < 1)
+        fun_l18_n427(x)
+    else
+        fun_l18_n591(x)
+    end
+end
+
+def fun_l17_n19(x)
+    if (x < 1)
+        fun_l18_n520(x)
+    else
+        fun_l18_n240(x)
+    end
+end
+
+def fun_l17_n20(x)
+    if (x < 1)
+        fun_l18_n729(x)
+    else
+        fun_l18_n709(x)
+    end
+end
+
+def fun_l17_n21(x)
+    if (x < 1)
+        fun_l18_n100(x)
+    else
+        fun_l18_n192(x)
+    end
+end
+
+def fun_l17_n22(x)
+    if (x < 1)
+        fun_l18_n762(x)
+    else
+        fun_l18_n373(x)
+    end
+end
+
+def fun_l17_n23(x)
+    if (x < 1)
+        fun_l18_n485(x)
+    else
+        fun_l18_n736(x)
+    end
+end
+
+def fun_l17_n24(x)
+    if (x < 1)
+        fun_l18_n743(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n25(x)
+    if (x < 1)
+        fun_l18_n750(x)
+    else
+        fun_l18_n545(x)
+    end
+end
+
+def fun_l17_n26(x)
+    if (x < 1)
+        fun_l18_n488(x)
+    else
+        fun_l18_n870(x)
+    end
+end
+
+def fun_l17_n27(x)
+    if (x < 1)
+        fun_l18_n0(x)
+    else
+        fun_l18_n675(x)
+    end
+end
+
+def fun_l17_n28(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n32(x)
+    end
+end
+
+def fun_l17_n29(x)
+    if (x < 1)
+        fun_l18_n906(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n30(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n58(x)
+    end
+end
+
+def fun_l17_n31(x)
+    if (x < 1)
+        fun_l18_n117(x)
+    else
+        fun_l18_n592(x)
+    end
+end
+
+def fun_l17_n32(x)
+    if (x < 1)
+        fun_l18_n123(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n33(x)
+    if (x < 1)
+        fun_l18_n672(x)
+    else
+        fun_l18_n645(x)
+    end
+end
+
+def fun_l17_n34(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n280(x)
+    end
+end
+
+def fun_l17_n35(x)
+    if (x < 1)
+        fun_l18_n851(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n36(x)
+    if (x < 1)
+        fun_l18_n968(x)
+    else
+        fun_l18_n840(x)
+    end
+end
+
+def fun_l17_n37(x)
+    if (x < 1)
+        fun_l18_n153(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n38(x)
+    if (x < 1)
+        fun_l18_n817(x)
+    else
+        fun_l18_n521(x)
+    end
+end
+
+def fun_l17_n39(x)
+    if (x < 1)
+        fun_l18_n742(x)
+    else
+        fun_l18_n576(x)
+    end
+end
+
+def fun_l17_n40(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n41(x)
+    if (x < 1)
+        fun_l18_n442(x)
+    else
+        fun_l18_n157(x)
+    end
+end
+
+def fun_l17_n42(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n218(x)
+    end
+end
+
+def fun_l17_n43(x)
+    if (x < 1)
+        fun_l18_n298(x)
+    else
+        fun_l18_n132(x)
+    end
+end
+
+def fun_l17_n44(x)
+    if (x < 1)
+        fun_l18_n397(x)
+    else
+        fun_l18_n375(x)
+    end
+end
+
+def fun_l17_n45(x)
+    if (x < 1)
+        fun_l18_n974(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n46(x)
+    if (x < 1)
+        fun_l18_n340(x)
+    else
+        fun_l18_n506(x)
+    end
+end
+
+def fun_l17_n47(x)
+    if (x < 1)
+        fun_l18_n943(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n48(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n2(x)
+    end
+end
+
+def fun_l17_n49(x)
+    if (x < 1)
+        fun_l18_n229(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n50(x)
+    if (x < 1)
+        fun_l18_n243(x)
+    else
+        fun_l18_n562(x)
+    end
+end
+
+def fun_l17_n51(x)
+    if (x < 1)
+        fun_l18_n231(x)
+    else
+        fun_l18_n381(x)
+    end
+end
+
+def fun_l17_n52(x)
+    if (x < 1)
+        fun_l18_n509(x)
+    else
+        fun_l18_n693(x)
+    end
+end
+
+def fun_l17_n53(x)
+    if (x < 1)
+        fun_l18_n877(x)
+    else
+        fun_l18_n620(x)
+    end
+end
+
+def fun_l17_n54(x)
+    if (x < 1)
+        fun_l18_n435(x)
+    else
+        fun_l18_n3(x)
+    end
+end
+
+def fun_l17_n55(x)
+    if (x < 1)
+        fun_l18_n929(x)
+    else
+        fun_l18_n640(x)
+    end
+end
+
+def fun_l17_n56(x)
+    if (x < 1)
+        fun_l18_n913(x)
+    else
+        fun_l18_n374(x)
+    end
+end
+
+def fun_l17_n57(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n588(x)
+    end
+end
+
+def fun_l17_n58(x)
+    if (x < 1)
+        fun_l18_n339(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n59(x)
+    if (x < 1)
+        fun_l18_n649(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n60(x)
+    if (x < 1)
+        fun_l18_n326(x)
+    else
+        fun_l18_n739(x)
+    end
+end
+
+def fun_l17_n61(x)
+    if (x < 1)
+        fun_l18_n692(x)
+    else
+        fun_l18_n673(x)
+    end
+end
+
+def fun_l17_n62(x)
+    if (x < 1)
+        fun_l18_n515(x)
+    else
+        fun_l18_n951(x)
+    end
+end
+
+def fun_l17_n63(x)
+    if (x < 1)
+        fun_l18_n502(x)
+    else
+        fun_l18_n781(x)
+    end
+end
+
+def fun_l17_n64(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n235(x)
+    end
+end
+
+def fun_l17_n65(x)
+    if (x < 1)
+        fun_l18_n483(x)
+    else
+        fun_l18_n207(x)
+    end
+end
+
+def fun_l17_n66(x)
+    if (x < 1)
+        fun_l18_n292(x)
+    else
+        fun_l18_n916(x)
+    end
+end
+
+def fun_l17_n67(x)
+    if (x < 1)
+        fun_l18_n677(x)
+    else
+        fun_l18_n937(x)
+    end
+end
+
+def fun_l17_n68(x)
+    if (x < 1)
+        fun_l18_n733(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n69(x)
+    if (x < 1)
+        fun_l18_n186(x)
+    else
+        fun_l18_n146(x)
+    end
+end
+
+def fun_l17_n70(x)
+    if (x < 1)
+        fun_l18_n493(x)
+    else
+        fun_l18_n418(x)
+    end
+end
+
+def fun_l17_n71(x)
+    if (x < 1)
+        fun_l18_n732(x)
+    else
+        fun_l18_n584(x)
+    end
+end
+
+def fun_l17_n72(x)
+    if (x < 1)
+        fun_l18_n774(x)
+    else
+        fun_l18_n349(x)
+    end
+end
+
+def fun_l17_n73(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n142(x)
+    end
+end
+
+def fun_l17_n74(x)
+    if (x < 1)
+        fun_l18_n506(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n75(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n76(x)
+    if (x < 1)
+        fun_l18_n172(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n77(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n508(x)
+    end
+end
+
+def fun_l17_n78(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n79(x)
+    if (x < 1)
+        fun_l18_n639(x)
+    else
+        fun_l18_n644(x)
+    end
+end
+
+def fun_l17_n80(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n193(x)
+    end
+end
+
+def fun_l17_n81(x)
+    if (x < 1)
+        fun_l18_n200(x)
+    else
+        fun_l18_n766(x)
+    end
+end
+
+def fun_l17_n82(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n83(x)
+    if (x < 1)
+        fun_l18_n740(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n84(x)
+    if (x < 1)
+        fun_l18_n484(x)
+    else
+        fun_l18_n158(x)
+    end
+end
+
+def fun_l17_n85(x)
+    if (x < 1)
+        fun_l18_n924(x)
+    else
+        fun_l18_n963(x)
+    end
+end
+
+def fun_l17_n86(x)
+    if (x < 1)
+        fun_l18_n614(x)
+    else
+        fun_l18_n806(x)
+    end
+end
+
+def fun_l17_n87(x)
+    if (x < 1)
+        fun_l18_n553(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n88(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n89(x)
+    if (x < 1)
+        fun_l18_n757(x)
+    else
+        fun_l18_n248(x)
+    end
+end
+
+def fun_l17_n90(x)
+    if (x < 1)
+        fun_l18_n616(x)
+    else
+        fun_l18_n217(x)
+    end
+end
+
+def fun_l17_n91(x)
+    if (x < 1)
+        fun_l18_n997(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n92(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n457(x)
+    end
+end
+
+def fun_l17_n93(x)
+    if (x < 1)
+        fun_l18_n264(x)
+    else
+        fun_l18_n213(x)
+    end
+end
+
+def fun_l17_n94(x)
+    if (x < 1)
+        fun_l18_n352(x)
+    else
+        fun_l18_n304(x)
+    end
+end
+
+def fun_l17_n95(x)
+    if (x < 1)
+        fun_l18_n975(x)
+    else
+        fun_l18_n868(x)
+    end
+end
+
+def fun_l17_n96(x)
+    if (x < 1)
+        fun_l18_n859(x)
+    else
+        fun_l18_n786(x)
+    end
+end
+
+def fun_l17_n97(x)
+    if (x < 1)
+        fun_l18_n610(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n98(x)
+    if (x < 1)
+        fun_l18_n814(x)
+    else
+        fun_l18_n71(x)
+    end
+end
+
+def fun_l17_n99(x)
+    if (x < 1)
+        fun_l18_n897(x)
+    else
+        fun_l18_n412(x)
+    end
+end
+
+def fun_l17_n100(x)
+    if (x < 1)
+        fun_l18_n654(x)
+    else
+        fun_l18_n600(x)
+    end
+end
+
+def fun_l17_n101(x)
+    if (x < 1)
+        fun_l18_n185(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n102(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n509(x)
+    end
+end
+
+def fun_l17_n103(x)
+    if (x < 1)
+        fun_l18_n115(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n104(x)
+    if (x < 1)
+        fun_l18_n650(x)
+    else
+        fun_l18_n389(x)
+    end
+end
+
+def fun_l17_n105(x)
+    if (x < 1)
+        fun_l18_n939(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n106(x)
+    if (x < 1)
+        fun_l18_n645(x)
+    else
+        fun_l18_n34(x)
+    end
+end
+
+def fun_l17_n107(x)
+    if (x < 1)
+        fun_l18_n510(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n108(x)
+    if (x < 1)
+        fun_l18_n377(x)
+    else
+        fun_l18_n397(x)
+    end
+end
+
+def fun_l17_n109(x)
+    if (x < 1)
+        fun_l18_n884(x)
+    else
+        fun_l18_n380(x)
+    end
+end
+
+def fun_l17_n110(x)
+    if (x < 1)
+        fun_l18_n924(x)
+    else
+        fun_l18_n102(x)
+    end
+end
+
+def fun_l17_n111(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n646(x)
+    end
+end
+
+def fun_l17_n112(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n345(x)
+    end
+end
+
+def fun_l17_n113(x)
+    if (x < 1)
+        fun_l18_n211(x)
+    else
+        fun_l18_n672(x)
+    end
+end
+
+def fun_l17_n114(x)
+    if (x < 1)
+        fun_l18_n947(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n115(x)
+    if (x < 1)
+        fun_l18_n219(x)
+    else
+        fun_l18_n927(x)
+    end
+end
+
+def fun_l17_n116(x)
+    if (x < 1)
+        fun_l18_n731(x)
+    else
+        fun_l18_n327(x)
+    end
+end
+
+def fun_l17_n117(x)
+    if (x < 1)
+        fun_l18_n512(x)
+    else
+        fun_l18_n658(x)
+    end
+end
+
+def fun_l17_n118(x)
+    if (x < 1)
+        fun_l18_n248(x)
+    else
+        fun_l18_n661(x)
+    end
+end
+
+def fun_l17_n119(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n56(x)
+    end
+end
+
+def fun_l17_n120(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n648(x)
+    end
+end
+
+def fun_l17_n121(x)
+    if (x < 1)
+        fun_l18_n122(x)
+    else
+        fun_l18_n717(x)
+    end
+end
+
+def fun_l17_n122(x)
+    if (x < 1)
+        fun_l18_n495(x)
+    else
+        fun_l18_n30(x)
+    end
+end
+
+def fun_l17_n123(x)
+    if (x < 1)
+        fun_l18_n418(x)
+    else
+        fun_l18_n686(x)
+    end
+end
+
+def fun_l17_n124(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n300(x)
+    end
+end
+
+def fun_l17_n125(x)
+    if (x < 1)
+        fun_l18_n677(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n126(x)
+    if (x < 1)
+        fun_l18_n448(x)
+    else
+        fun_l18_n584(x)
+    end
+end
+
+def fun_l17_n127(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n128(x)
+    if (x < 1)
+        fun_l18_n166(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n129(x)
+    if (x < 1)
+        fun_l18_n890(x)
+    else
+        fun_l18_n581(x)
+    end
+end
+
+def fun_l17_n130(x)
+    if (x < 1)
+        fun_l18_n554(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n131(x)
+    if (x < 1)
+        fun_l18_n607(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n132(x)
+    if (x < 1)
+        fun_l18_n747(x)
+    else
+        fun_l18_n461(x)
+    end
+end
+
+def fun_l17_n133(x)
+    if (x < 1)
+        fun_l18_n399(x)
+    else
+        fun_l18_n436(x)
+    end
+end
+
+def fun_l17_n134(x)
+    if (x < 1)
+        fun_l18_n922(x)
+    else
+        fun_l18_n33(x)
+    end
+end
+
+def fun_l17_n135(x)
+    if (x < 1)
+        fun_l18_n719(x)
+    else
+        fun_l18_n70(x)
+    end
+end
+
+def fun_l17_n136(x)
+    if (x < 1)
+        fun_l18_n664(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n137(x)
+    if (x < 1)
+        fun_l18_n626(x)
+    else
+        fun_l18_n328(x)
+    end
+end
+
+def fun_l17_n138(x)
+    if (x < 1)
+        fun_l18_n64(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n139(x)
+    if (x < 1)
+        fun_l18_n198(x)
+    else
+        fun_l18_n658(x)
+    end
+end
+
+def fun_l17_n140(x)
+    if (x < 1)
+        fun_l18_n813(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n141(x)
+    if (x < 1)
+        fun_l18_n8(x)
+    else
+        fun_l18_n115(x)
+    end
+end
+
+def fun_l17_n142(x)
+    if (x < 1)
+        fun_l18_n699(x)
+    else
+        fun_l18_n135(x)
+    end
+end
+
+def fun_l17_n143(x)
+    if (x < 1)
+        fun_l18_n595(x)
+    else
+        fun_l18_n607(x)
+    end
+end
+
+def fun_l17_n144(x)
+    if (x < 1)
+        fun_l18_n650(x)
+    else
+        fun_l18_n994(x)
+    end
+end
+
+def fun_l17_n145(x)
+    if (x < 1)
+        fun_l18_n14(x)
+    else
+        fun_l18_n798(x)
+    end
+end
+
+def fun_l17_n146(x)
+    if (x < 1)
+        fun_l18_n107(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n147(x)
+    if (x < 1)
+        fun_l18_n923(x)
+    else
+        fun_l18_n482(x)
+    end
+end
+
+def fun_l17_n148(x)
+    if (x < 1)
+        fun_l18_n629(x)
+    else
+        fun_l18_n224(x)
+    end
+end
+
+def fun_l17_n149(x)
+    if (x < 1)
+        fun_l18_n363(x)
+    else
+        fun_l18_n958(x)
+    end
+end
+
+def fun_l17_n150(x)
+    if (x < 1)
+        fun_l18_n143(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n151(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n561(x)
+    end
+end
+
+def fun_l17_n152(x)
+    if (x < 1)
+        fun_l18_n418(x)
+    else
+        fun_l18_n46(x)
+    end
+end
+
+def fun_l17_n153(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n736(x)
+    end
+end
+
+def fun_l17_n154(x)
+    if (x < 1)
+        fun_l18_n340(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n155(x)
+    if (x < 1)
+        fun_l18_n488(x)
+    else
+        fun_l18_n995(x)
+    end
+end
+
+def fun_l17_n156(x)
+    if (x < 1)
+        fun_l18_n500(x)
+    else
+        fun_l18_n106(x)
+    end
+end
+
+def fun_l17_n157(x)
+    if (x < 1)
+        fun_l18_n76(x)
+    else
+        fun_l18_n147(x)
+    end
+end
+
+def fun_l17_n158(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n754(x)
+    end
+end
+
+def fun_l17_n159(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n676(x)
+    end
+end
+
+def fun_l17_n160(x)
+    if (x < 1)
+        fun_l18_n997(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n161(x)
+    if (x < 1)
+        fun_l18_n614(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n162(x)
+    if (x < 1)
+        fun_l18_n943(x)
+    else
+        fun_l18_n534(x)
+    end
+end
+
+def fun_l17_n163(x)
+    if (x < 1)
+        fun_l18_n577(x)
+    else
+        fun_l18_n670(x)
+    end
+end
+
+def fun_l17_n164(x)
+    if (x < 1)
+        fun_l18_n707(x)
+    else
+        fun_l18_n701(x)
+    end
+end
+
+def fun_l17_n165(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n166(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n710(x)
+    end
+end
+
+def fun_l17_n167(x)
+    if (x < 1)
+        fun_l18_n763(x)
+    else
+        fun_l18_n900(x)
+    end
+end
+
+def fun_l17_n168(x)
+    if (x < 1)
+        fun_l18_n818(x)
+    else
+        fun_l18_n2(x)
+    end
+end
+
+def fun_l17_n169(x)
+    if (x < 1)
+        fun_l18_n68(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n170(x)
+    if (x < 1)
+        fun_l18_n88(x)
+    else
+        fun_l18_n431(x)
+    end
+end
+
+def fun_l17_n171(x)
+    if (x < 1)
+        fun_l18_n530(x)
+    else
+        fun_l18_n714(x)
+    end
+end
+
+def fun_l17_n172(x)
+    if (x < 1)
+        fun_l18_n636(x)
+    else
+        fun_l18_n747(x)
+    end
+end
+
+def fun_l17_n173(x)
+    if (x < 1)
+        fun_l18_n481(x)
+    else
+        fun_l18_n804(x)
+    end
+end
+
+def fun_l17_n174(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n121(x)
+    end
+end
+
+def fun_l17_n175(x)
+    if (x < 1)
+        fun_l18_n320(x)
+    else
+        fun_l18_n881(x)
+    end
+end
+
+def fun_l17_n176(x)
+    if (x < 1)
+        fun_l18_n524(x)
+    else
+        fun_l18_n948(x)
+    end
+end
+
+def fun_l17_n177(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n508(x)
+    end
+end
+
+def fun_l17_n178(x)
+    if (x < 1)
+        fun_l18_n949(x)
+    else
+        fun_l18_n492(x)
+    end
+end
+
+def fun_l17_n179(x)
+    if (x < 1)
+        fun_l18_n548(x)
+    else
+        fun_l18_n534(x)
+    end
+end
+
+def fun_l17_n180(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n104(x)
+    end
+end
+
+def fun_l17_n181(x)
+    if (x < 1)
+        fun_l18_n727(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n182(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n628(x)
+    end
+end
+
+def fun_l17_n183(x)
+    if (x < 1)
+        fun_l18_n32(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n184(x)
+    if (x < 1)
+        fun_l18_n778(x)
+    else
+        fun_l18_n929(x)
+    end
+end
+
+def fun_l17_n185(x)
+    if (x < 1)
+        fun_l18_n797(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n186(x)
+    if (x < 1)
+        fun_l18_n800(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n187(x)
+    if (x < 1)
+        fun_l18_n974(x)
+    else
+        fun_l18_n982(x)
+    end
+end
+
+def fun_l17_n188(x)
+    if (x < 1)
+        fun_l18_n259(x)
+    else
+        fun_l18_n465(x)
+    end
+end
+
+def fun_l17_n189(x)
+    if (x < 1)
+        fun_l18_n905(x)
+    else
+        fun_l18_n477(x)
+    end
+end
+
+def fun_l17_n190(x)
+    if (x < 1)
+        fun_l18_n453(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n191(x)
+    if (x < 1)
+        fun_l18_n461(x)
+    else
+        fun_l18_n251(x)
+    end
+end
+
+def fun_l17_n192(x)
+    if (x < 1)
+        fun_l18_n377(x)
+    else
+        fun_l18_n371(x)
+    end
+end
+
+def fun_l17_n193(x)
+    if (x < 1)
+        fun_l18_n252(x)
+    else
+        fun_l18_n493(x)
+    end
+end
+
+def fun_l17_n194(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n104(x)
+    end
+end
+
+def fun_l17_n195(x)
+    if (x < 1)
+        fun_l18_n791(x)
+    else
+        fun_l18_n4(x)
+    end
+end
+
+def fun_l17_n196(x)
+    if (x < 1)
+        fun_l18_n801(x)
+    else
+        fun_l18_n429(x)
+    end
+end
+
+def fun_l17_n197(x)
+    if (x < 1)
+        fun_l18_n106(x)
+    else
+        fun_l18_n622(x)
+    end
+end
+
+def fun_l17_n198(x)
+    if (x < 1)
+        fun_l18_n581(x)
+    else
+        fun_l18_n312(x)
+    end
+end
+
+def fun_l17_n199(x)
+    if (x < 1)
+        fun_l18_n142(x)
+    else
+        fun_l18_n296(x)
+    end
+end
+
+def fun_l17_n200(x)
+    if (x < 1)
+        fun_l18_n234(x)
+    else
+        fun_l18_n185(x)
+    end
+end
+
+def fun_l17_n201(x)
+    if (x < 1)
+        fun_l18_n486(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n202(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n718(x)
+    end
+end
+
+def fun_l17_n203(x)
+    if (x < 1)
+        fun_l18_n830(x)
+    else
+        fun_l18_n618(x)
+    end
+end
+
+def fun_l17_n204(x)
+    if (x < 1)
+        fun_l18_n860(x)
+    else
+        fun_l18_n28(x)
+    end
+end
+
+def fun_l17_n205(x)
+    if (x < 1)
+        fun_l18_n244(x)
+    else
+        fun_l18_n575(x)
+    end
+end
+
+def fun_l17_n206(x)
+    if (x < 1)
+        fun_l18_n189(x)
+    else
+        fun_l18_n722(x)
+    end
+end
+
+def fun_l17_n207(x)
+    if (x < 1)
+        fun_l18_n164(x)
+    else
+        fun_l18_n197(x)
+    end
+end
+
+def fun_l17_n208(x)
+    if (x < 1)
+        fun_l18_n109(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n209(x)
+    if (x < 1)
+        fun_l18_n629(x)
+    else
+        fun_l18_n290(x)
+    end
+end
+
+def fun_l17_n210(x)
+    if (x < 1)
+        fun_l18_n637(x)
+    else
+        fun_l18_n317(x)
+    end
+end
+
+def fun_l17_n211(x)
+    if (x < 1)
+        fun_l18_n148(x)
+    else
+        fun_l18_n702(x)
+    end
+end
+
+def fun_l17_n212(x)
+    if (x < 1)
+        fun_l18_n892(x)
+    else
+        fun_l18_n395(x)
+    end
+end
+
+def fun_l17_n213(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n859(x)
+    end
+end
+
+def fun_l17_n214(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n295(x)
+    end
+end
+
+def fun_l17_n215(x)
+    if (x < 1)
+        fun_l18_n459(x)
+    else
+        fun_l18_n407(x)
+    end
+end
+
+def fun_l17_n216(x)
+    if (x < 1)
+        fun_l18_n761(x)
+    else
+        fun_l18_n308(x)
+    end
+end
+
+def fun_l17_n217(x)
+    if (x < 1)
+        fun_l18_n350(x)
+    else
+        fun_l18_n680(x)
+    end
+end
+
+def fun_l17_n218(x)
+    if (x < 1)
+        fun_l18_n240(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n219(x)
+    if (x < 1)
+        fun_l18_n538(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n220(x)
+    if (x < 1)
+        fun_l18_n45(x)
+    else
+        fun_l18_n643(x)
+    end
+end
+
+def fun_l17_n221(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n690(x)
+    end
+end
+
+def fun_l17_n222(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n223(x)
+    if (x < 1)
+        fun_l18_n591(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n224(x)
+    if (x < 1)
+        fun_l18_n433(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n225(x)
+    if (x < 1)
+        fun_l18_n51(x)
+    else
+        fun_l18_n837(x)
+    end
+end
+
+def fun_l17_n226(x)
+    if (x < 1)
+        fun_l18_n755(x)
+    else
+        fun_l18_n949(x)
+    end
+end
+
+def fun_l17_n227(x)
+    if (x < 1)
+        fun_l18_n566(x)
+    else
+        fun_l18_n754(x)
+    end
+end
+
+def fun_l17_n228(x)
+    if (x < 1)
+        fun_l18_n915(x)
+    else
+        fun_l18_n893(x)
+    end
+end
+
+def fun_l17_n229(x)
+    if (x < 1)
+        fun_l18_n990(x)
+    else
+        fun_l18_n208(x)
+    end
+end
+
+def fun_l17_n230(x)
+    if (x < 1)
+        fun_l18_n220(x)
+    else
+        fun_l18_n292(x)
+    end
+end
+
+def fun_l17_n231(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n211(x)
+    end
+end
+
+def fun_l17_n232(x)
+    if (x < 1)
+        fun_l18_n669(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n233(x)
+    if (x < 1)
+        fun_l18_n804(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n234(x)
+    if (x < 1)
+        fun_l18_n198(x)
+    else
+        fun_l18_n393(x)
+    end
+end
+
+def fun_l17_n235(x)
+    if (x < 1)
+        fun_l18_n154(x)
+    else
+        fun_l18_n980(x)
+    end
+end
+
+def fun_l17_n236(x)
+    if (x < 1)
+        fun_l18_n46(x)
+    else
+        fun_l18_n926(x)
+    end
+end
+
+def fun_l17_n237(x)
+    if (x < 1)
+        fun_l18_n158(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n238(x)
+    if (x < 1)
+        fun_l18_n728(x)
+    else
+        fun_l18_n864(x)
+    end
+end
+
+def fun_l17_n239(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n240(x)
+    if (x < 1)
+        fun_l18_n619(x)
+    else
+        fun_l18_n216(x)
+    end
+end
+
+def fun_l17_n241(x)
+    if (x < 1)
+        fun_l18_n338(x)
+    else
+        fun_l18_n289(x)
+    end
+end
+
+def fun_l17_n242(x)
+    if (x < 1)
+        fun_l18_n42(x)
+    else
+        fun_l18_n360(x)
+    end
+end
+
+def fun_l17_n243(x)
+    if (x < 1)
+        fun_l18_n883(x)
+    else
+        fun_l18_n243(x)
+    end
+end
+
+def fun_l17_n244(x)
+    if (x < 1)
+        fun_l18_n474(x)
+    else
+        fun_l18_n236(x)
+    end
+end
+
+def fun_l17_n245(x)
+    if (x < 1)
+        fun_l18_n694(x)
+    else
+        fun_l18_n579(x)
+    end
+end
+
+def fun_l17_n246(x)
+    if (x < 1)
+        fun_l18_n787(x)
+    else
+        fun_l18_n349(x)
+    end
+end
+
+def fun_l17_n247(x)
+    if (x < 1)
+        fun_l18_n140(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n248(x)
+    if (x < 1)
+        fun_l18_n587(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n249(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n352(x)
+    end
+end
+
+def fun_l17_n250(x)
+    if (x < 1)
+        fun_l18_n330(x)
+    else
+        fun_l18_n779(x)
+    end
+end
+
+def fun_l17_n251(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n45(x)
+    end
+end
+
+def fun_l17_n252(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n668(x)
+    end
+end
+
+def fun_l17_n253(x)
+    if (x < 1)
+        fun_l18_n799(x)
+    else
+        fun_l18_n141(x)
+    end
+end
+
+def fun_l17_n254(x)
+    if (x < 1)
+        fun_l18_n868(x)
+    else
+        fun_l18_n486(x)
+    end
+end
+
+def fun_l17_n255(x)
+    if (x < 1)
+        fun_l18_n238(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n256(x)
+    if (x < 1)
+        fun_l18_n939(x)
+    else
+        fun_l18_n977(x)
+    end
+end
+
+def fun_l17_n257(x)
+    if (x < 1)
+        fun_l18_n999(x)
+    else
+        fun_l18_n241(x)
+    end
+end
+
+def fun_l17_n258(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n259(x)
+    if (x < 1)
+        fun_l18_n166(x)
+    else
+        fun_l18_n550(x)
+    end
+end
+
+def fun_l17_n260(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n453(x)
+    end
+end
+
+def fun_l17_n261(x)
+    if (x < 1)
+        fun_l18_n590(x)
+    else
+        fun_l18_n217(x)
+    end
+end
+
+def fun_l17_n262(x)
+    if (x < 1)
+        fun_l18_n703(x)
+    else
+        fun_l18_n827(x)
+    end
+end
+
+def fun_l17_n263(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n869(x)
+    end
+end
+
+def fun_l17_n264(x)
+    if (x < 1)
+        fun_l18_n980(x)
+    else
+        fun_l18_n598(x)
+    end
+end
+
+def fun_l17_n265(x)
+    if (x < 1)
+        fun_l18_n751(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n266(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n267(x)
+    if (x < 1)
+        fun_l18_n257(x)
+    else
+        fun_l18_n731(x)
+    end
+end
+
+def fun_l17_n268(x)
+    if (x < 1)
+        fun_l18_n254(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n269(x)
+    if (x < 1)
+        fun_l18_n145(x)
+    else
+        fun_l18_n987(x)
+    end
+end
+
+def fun_l17_n270(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n370(x)
+    end
+end
+
+def fun_l17_n271(x)
+    if (x < 1)
+        fun_l18_n767(x)
+    else
+        fun_l18_n246(x)
+    end
+end
+
+def fun_l17_n272(x)
+    if (x < 1)
+        fun_l18_n274(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n273(x)
+    if (x < 1)
+        fun_l18_n12(x)
+    else
+        fun_l18_n48(x)
+    end
+end
+
+def fun_l17_n274(x)
+    if (x < 1)
+        fun_l18_n389(x)
+    else
+        fun_l18_n353(x)
+    end
+end
+
+def fun_l17_n275(x)
+    if (x < 1)
+        fun_l18_n966(x)
+    else
+        fun_l18_n248(x)
+    end
+end
+
+def fun_l17_n276(x)
+    if (x < 1)
+        fun_l18_n459(x)
+    else
+        fun_l18_n989(x)
+    end
+end
+
+def fun_l17_n277(x)
+    if (x < 1)
+        fun_l18_n416(x)
+    else
+        fun_l18_n976(x)
+    end
+end
+
+def fun_l17_n278(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n282(x)
+    end
+end
+
+def fun_l17_n279(x)
+    if (x < 1)
+        fun_l18_n774(x)
+    else
+        fun_l18_n478(x)
+    end
+end
+
+def fun_l17_n280(x)
+    if (x < 1)
+        fun_l18_n713(x)
+    else
+        fun_l18_n117(x)
+    end
+end
+
+def fun_l17_n281(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n282(x)
+    if (x < 1)
+        fun_l18_n791(x)
+    else
+        fun_l18_n331(x)
+    end
+end
+
+def fun_l17_n283(x)
+    if (x < 1)
+        fun_l18_n955(x)
+    else
+        fun_l18_n847(x)
+    end
+end
+
+def fun_l17_n284(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n681(x)
+    end
+end
+
+def fun_l17_n285(x)
+    if (x < 1)
+        fun_l18_n185(x)
+    else
+        fun_l18_n651(x)
+    end
+end
+
+def fun_l17_n286(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n827(x)
+    end
+end
+
+def fun_l17_n287(x)
+    if (x < 1)
+        fun_l18_n788(x)
+    else
+        fun_l18_n794(x)
+    end
+end
+
+def fun_l17_n288(x)
+    if (x < 1)
+        fun_l18_n361(x)
+    else
+        fun_l18_n415(x)
+    end
+end
+
+def fun_l17_n289(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n375(x)
+    end
+end
+
+def fun_l17_n290(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n85(x)
+    end
+end
+
+def fun_l17_n291(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n292(x)
+    if (x < 1)
+        fun_l18_n21(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n293(x)
+    if (x < 1)
+        fun_l18_n716(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n294(x)
+    if (x < 1)
+        fun_l18_n462(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n295(x)
+    if (x < 1)
+        fun_l18_n87(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n296(x)
+    if (x < 1)
+        fun_l18_n889(x)
+    else
+        fun_l18_n755(x)
+    end
+end
+
+def fun_l17_n297(x)
+    if (x < 1)
+        fun_l18_n539(x)
+    else
+        fun_l18_n130(x)
+    end
+end
+
+def fun_l17_n298(x)
+    if (x < 1)
+        fun_l18_n729(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n299(x)
+    if (x < 1)
+        fun_l18_n605(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n300(x)
+    if (x < 1)
+        fun_l18_n408(x)
+    else
+        fun_l18_n281(x)
+    end
+end
+
+def fun_l17_n301(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n188(x)
+    end
+end
+
+def fun_l17_n302(x)
+    if (x < 1)
+        fun_l18_n42(x)
+    else
+        fun_l18_n970(x)
+    end
+end
+
+def fun_l17_n303(x)
+    if (x < 1)
+        fun_l18_n904(x)
+    else
+        fun_l18_n630(x)
+    end
+end
+
+def fun_l17_n304(x)
+    if (x < 1)
+        fun_l18_n142(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n305(x)
+    if (x < 1)
+        fun_l18_n242(x)
+    else
+        fun_l18_n111(x)
+    end
+end
+
+def fun_l17_n306(x)
+    if (x < 1)
+        fun_l18_n184(x)
+    else
+        fun_l18_n301(x)
+    end
+end
+
+def fun_l17_n307(x)
+    if (x < 1)
+        fun_l18_n297(x)
+    else
+        fun_l18_n722(x)
+    end
+end
+
+def fun_l17_n308(x)
+    if (x < 1)
+        fun_l18_n608(x)
+    else
+        fun_l18_n502(x)
+    end
+end
+
+def fun_l17_n309(x)
+    if (x < 1)
+        fun_l18_n513(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n310(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n638(x)
+    end
+end
+
+def fun_l17_n311(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n312(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n526(x)
+    end
+end
+
+def fun_l17_n313(x)
+    if (x < 1)
+        fun_l18_n795(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n314(x)
+    if (x < 1)
+        fun_l18_n505(x)
+    else
+        fun_l18_n526(x)
+    end
+end
+
+def fun_l17_n315(x)
+    if (x < 1)
+        fun_l18_n458(x)
+    else
+        fun_l18_n767(x)
+    end
+end
+
+def fun_l17_n316(x)
+    if (x < 1)
+        fun_l18_n778(x)
+    else
+        fun_l18_n972(x)
+    end
+end
+
+def fun_l17_n317(x)
+    if (x < 1)
+        fun_l18_n734(x)
+    else
+        fun_l18_n289(x)
+    end
+end
+
+def fun_l17_n318(x)
+    if (x < 1)
+        fun_l18_n950(x)
+    else
+        fun_l18_n507(x)
+    end
+end
+
+def fun_l17_n319(x)
+    if (x < 1)
+        fun_l18_n597(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n320(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n323(x)
+    end
+end
+
+def fun_l17_n321(x)
+    if (x < 1)
+        fun_l18_n558(x)
+    else
+        fun_l18_n357(x)
+    end
+end
+
+def fun_l17_n322(x)
+    if (x < 1)
+        fun_l18_n948(x)
+    else
+        fun_l18_n726(x)
+    end
+end
+
+def fun_l17_n323(x)
+    if (x < 1)
+        fun_l18_n787(x)
+    else
+        fun_l18_n89(x)
+    end
+end
+
+def fun_l17_n324(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n454(x)
+    end
+end
+
+def fun_l17_n325(x)
+    if (x < 1)
+        fun_l18_n173(x)
+    else
+        fun_l18_n815(x)
+    end
+end
+
+def fun_l17_n326(x)
+    if (x < 1)
+        fun_l18_n102(x)
+    else
+        fun_l18_n261(x)
+    end
+end
+
+def fun_l17_n327(x)
+    if (x < 1)
+        fun_l18_n83(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n328(x)
+    if (x < 1)
+        fun_l18_n675(x)
+    else
+        fun_l18_n186(x)
+    end
+end
+
+def fun_l17_n329(x)
+    if (x < 1)
+        fun_l18_n783(x)
+    else
+        fun_l18_n481(x)
+    end
+end
+
+def fun_l17_n330(x)
+    if (x < 1)
+        fun_l18_n828(x)
+    else
+        fun_l18_n829(x)
+    end
+end
+
+def fun_l17_n331(x)
+    if (x < 1)
+        fun_l18_n195(x)
+    else
+        fun_l18_n264(x)
+    end
+end
+
+def fun_l17_n332(x)
+    if (x < 1)
+        fun_l18_n842(x)
+    else
+        fun_l18_n198(x)
+    end
+end
+
+def fun_l17_n333(x)
+    if (x < 1)
+        fun_l18_n549(x)
+    else
+        fun_l18_n208(x)
+    end
+end
+
+def fun_l17_n334(x)
+    if (x < 1)
+        fun_l18_n976(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n335(x)
+    if (x < 1)
+        fun_l18_n401(x)
+    else
+        fun_l18_n105(x)
+    end
+end
+
+def fun_l17_n336(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n54(x)
+    end
+end
+
+def fun_l17_n337(x)
+    if (x < 1)
+        fun_l18_n685(x)
+    else
+        fun_l18_n140(x)
+    end
+end
+
+def fun_l17_n338(x)
+    if (x < 1)
+        fun_l18_n301(x)
+    else
+        fun_l18_n167(x)
+    end
+end
+
+def fun_l17_n339(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n643(x)
+    end
+end
+
+def fun_l17_n340(x)
+    if (x < 1)
+        fun_l18_n147(x)
+    else
+        fun_l18_n27(x)
+    end
+end
+
+def fun_l17_n341(x)
+    if (x < 1)
+        fun_l18_n813(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n342(x)
+    if (x < 1)
+        fun_l18_n319(x)
+    else
+        fun_l18_n429(x)
+    end
+end
+
+def fun_l17_n343(x)
+    if (x < 1)
+        fun_l18_n957(x)
+    else
+        fun_l18_n961(x)
+    end
+end
+
+def fun_l17_n344(x)
+    if (x < 1)
+        fun_l18_n380(x)
+    else
+        fun_l18_n604(x)
+    end
+end
+
+def fun_l17_n345(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n473(x)
+    end
+end
+
+def fun_l17_n346(x)
+    if (x < 1)
+        fun_l18_n346(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n347(x)
+    if (x < 1)
+        fun_l18_n645(x)
+    else
+        fun_l18_n511(x)
+    end
+end
+
+def fun_l17_n348(x)
+    if (x < 1)
+        fun_l18_n647(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n349(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n580(x)
+    end
+end
+
+def fun_l17_n350(x)
+    if (x < 1)
+        fun_l18_n745(x)
+    else
+        fun_l18_n402(x)
+    end
+end
+
+def fun_l17_n351(x)
+    if (x < 1)
+        fun_l18_n533(x)
+    else
+        fun_l18_n117(x)
+    end
+end
+
+def fun_l17_n352(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n458(x)
+    end
+end
+
+def fun_l17_n353(x)
+    if (x < 1)
+        fun_l18_n526(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n354(x)
+    if (x < 1)
+        fun_l18_n315(x)
+    else
+        fun_l18_n306(x)
+    end
+end
+
+def fun_l17_n355(x)
+    if (x < 1)
+        fun_l18_n349(x)
+    else
+        fun_l18_n975(x)
+    end
+end
+
+def fun_l17_n356(x)
+    if (x < 1)
+        fun_l18_n764(x)
+    else
+        fun_l18_n897(x)
+    end
+end
+
+def fun_l17_n357(x)
+    if (x < 1)
+        fun_l18_n308(x)
+    else
+        fun_l18_n662(x)
+    end
+end
+
+def fun_l17_n358(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n807(x)
+    end
+end
+
+def fun_l17_n359(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n277(x)
+    end
+end
+
+def fun_l17_n360(x)
+    if (x < 1)
+        fun_l18_n606(x)
+    else
+        fun_l18_n605(x)
+    end
+end
+
+def fun_l17_n361(x)
+    if (x < 1)
+        fun_l18_n971(x)
+    else
+        fun_l18_n59(x)
+    end
+end
+
+def fun_l17_n362(x)
+    if (x < 1)
+        fun_l18_n304(x)
+    else
+        fun_l18_n604(x)
+    end
+end
+
+def fun_l17_n363(x)
+    if (x < 1)
+        fun_l18_n607(x)
+    else
+        fun_l18_n758(x)
+    end
+end
+
+def fun_l17_n364(x)
+    if (x < 1)
+        fun_l18_n454(x)
+    else
+        fun_l18_n635(x)
+    end
+end
+
+def fun_l17_n365(x)
+    if (x < 1)
+        fun_l18_n287(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n366(x)
+    if (x < 1)
+        fun_l18_n708(x)
+    else
+        fun_l18_n480(x)
+    end
+end
+
+def fun_l17_n367(x)
+    if (x < 1)
+        fun_l18_n925(x)
+    else
+        fun_l18_n96(x)
+    end
+end
+
+def fun_l17_n368(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n765(x)
+    end
+end
+
+def fun_l17_n369(x)
+    if (x < 1)
+        fun_l18_n134(x)
+    else
+        fun_l18_n320(x)
+    end
+end
+
+def fun_l17_n370(x)
+    if (x < 1)
+        fun_l18_n167(x)
+    else
+        fun_l18_n112(x)
+    end
+end
+
+def fun_l17_n371(x)
+    if (x < 1)
+        fun_l18_n393(x)
+    else
+        fun_l18_n701(x)
+    end
+end
+
+def fun_l17_n372(x)
+    if (x < 1)
+        fun_l18_n363(x)
+    else
+        fun_l18_n934(x)
+    end
+end
+
+def fun_l17_n373(x)
+    if (x < 1)
+        fun_l18_n431(x)
+    else
+        fun_l18_n343(x)
+    end
+end
+
+def fun_l17_n374(x)
+    if (x < 1)
+        fun_l18_n111(x)
+    else
+        fun_l18_n689(x)
+    end
+end
+
+def fun_l17_n375(x)
+    if (x < 1)
+        fun_l18_n609(x)
+    else
+        fun_l18_n814(x)
+    end
+end
+
+def fun_l17_n376(x)
+    if (x < 1)
+        fun_l18_n9(x)
+    else
+        fun_l18_n711(x)
+    end
+end
+
+def fun_l17_n377(x)
+    if (x < 1)
+        fun_l18_n270(x)
+    else
+        fun_l18_n455(x)
+    end
+end
+
+def fun_l17_n378(x)
+    if (x < 1)
+        fun_l18_n432(x)
+    else
+        fun_l18_n348(x)
+    end
+end
+
+def fun_l17_n379(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n934(x)
+    end
+end
+
+def fun_l17_n380(x)
+    if (x < 1)
+        fun_l18_n737(x)
+    else
+        fun_l18_n472(x)
+    end
+end
+
+def fun_l17_n381(x)
+    if (x < 1)
+        fun_l18_n163(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n382(x)
+    if (x < 1)
+        fun_l18_n71(x)
+    else
+        fun_l18_n343(x)
+    end
+end
+
+def fun_l17_n383(x)
+    if (x < 1)
+        fun_l18_n52(x)
+    else
+        fun_l18_n0(x)
+    end
+end
+
+def fun_l17_n384(x)
+    if (x < 1)
+        fun_l18_n708(x)
+    else
+        fun_l18_n616(x)
+    end
+end
+
+def fun_l17_n385(x)
+    if (x < 1)
+        fun_l18_n525(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n386(x)
+    if (x < 1)
+        fun_l18_n154(x)
+    else
+        fun_l18_n588(x)
+    end
+end
+
+def fun_l17_n387(x)
+    if (x < 1)
+        fun_l18_n295(x)
+    else
+        fun_l18_n462(x)
+    end
+end
+
+def fun_l17_n388(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n773(x)
+    end
+end
+
+def fun_l17_n389(x)
+    if (x < 1)
+        fun_l18_n221(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n390(x)
+    if (x < 1)
+        fun_l18_n575(x)
+    else
+        fun_l18_n284(x)
+    end
+end
+
+def fun_l17_n391(x)
+    if (x < 1)
+        fun_l18_n936(x)
+    else
+        fun_l18_n71(x)
+    end
+end
+
+def fun_l17_n392(x)
+    if (x < 1)
+        fun_l18_n123(x)
+    else
+        fun_l18_n863(x)
+    end
+end
+
+def fun_l17_n393(x)
+    if (x < 1)
+        fun_l18_n664(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n394(x)
+    if (x < 1)
+        fun_l18_n456(x)
+    else
+        fun_l18_n476(x)
+    end
+end
+
+def fun_l17_n395(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n877(x)
+    end
+end
+
+def fun_l17_n396(x)
+    if (x < 1)
+        fun_l18_n192(x)
+    else
+        fun_l18_n312(x)
+    end
+end
+
+def fun_l17_n397(x)
+    if (x < 1)
+        fun_l18_n87(x)
+    else
+        fun_l18_n56(x)
+    end
+end
+
+def fun_l17_n398(x)
+    if (x < 1)
+        fun_l18_n769(x)
+    else
+        fun_l18_n597(x)
+    end
+end
+
+def fun_l17_n399(x)
+    if (x < 1)
+        fun_l18_n534(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n400(x)
+    if (x < 1)
+        fun_l18_n284(x)
+    else
+        fun_l18_n503(x)
+    end
+end
+
+def fun_l17_n401(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n242(x)
+    end
+end
+
+def fun_l17_n402(x)
+    if (x < 1)
+        fun_l18_n491(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n403(x)
+    if (x < 1)
+        fun_l18_n861(x)
+    else
+        fun_l18_n372(x)
+    end
+end
+
+def fun_l17_n404(x)
+    if (x < 1)
+        fun_l18_n600(x)
+    else
+        fun_l18_n692(x)
+    end
+end
+
+def fun_l17_n405(x)
+    if (x < 1)
+        fun_l18_n336(x)
+    else
+        fun_l18_n778(x)
+    end
+end
+
+def fun_l17_n406(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n277(x)
+    end
+end
+
+def fun_l17_n407(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n861(x)
+    end
+end
+
+def fun_l17_n408(x)
+    if (x < 1)
+        fun_l18_n829(x)
+    else
+        fun_l18_n213(x)
+    end
+end
+
+def fun_l17_n409(x)
+    if (x < 1)
+        fun_l18_n325(x)
+    else
+        fun_l18_n599(x)
+    end
+end
+
+def fun_l17_n410(x)
+    if (x < 1)
+        fun_l18_n850(x)
+    else
+        fun_l18_n828(x)
+    end
+end
+
+def fun_l17_n411(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n757(x)
+    end
+end
+
+def fun_l17_n412(x)
+    if (x < 1)
+        fun_l18_n755(x)
+    else
+        fun_l18_n474(x)
+    end
+end
+
+def fun_l17_n413(x)
+    if (x < 1)
+        fun_l18_n945(x)
+    else
+        fun_l18_n113(x)
+    end
+end
+
+def fun_l17_n414(x)
+    if (x < 1)
+        fun_l18_n584(x)
+    else
+        fun_l18_n815(x)
+    end
+end
+
+def fun_l17_n415(x)
+    if (x < 1)
+        fun_l18_n136(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n416(x)
+    if (x < 1)
+        fun_l18_n57(x)
+    else
+        fun_l18_n361(x)
+    end
+end
+
+def fun_l17_n417(x)
+    if (x < 1)
+        fun_l18_n3(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n418(x)
+    if (x < 1)
+        fun_l18_n578(x)
+    else
+        fun_l18_n719(x)
+    end
+end
+
+def fun_l17_n419(x)
+    if (x < 1)
+        fun_l18_n426(x)
+    else
+        fun_l18_n958(x)
+    end
+end
+
+def fun_l17_n420(x)
+    if (x < 1)
+        fun_l18_n384(x)
+    else
+        fun_l18_n182(x)
+    end
+end
+
+def fun_l17_n421(x)
+    if (x < 1)
+        fun_l18_n458(x)
+    else
+        fun_l18_n314(x)
+    end
+end
+
+def fun_l17_n422(x)
+    if (x < 1)
+        fun_l18_n641(x)
+    else
+        fun_l18_n678(x)
+    end
+end
+
+def fun_l17_n423(x)
+    if (x < 1)
+        fun_l18_n790(x)
+    else
+        fun_l18_n830(x)
+    end
+end
+
+def fun_l17_n424(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n686(x)
+    end
+end
+
+def fun_l17_n425(x)
+    if (x < 1)
+        fun_l18_n847(x)
+    else
+        fun_l18_n387(x)
+    end
+end
+
+def fun_l17_n426(x)
+    if (x < 1)
+        fun_l18_n744(x)
+    else
+        fun_l18_n9(x)
+    end
+end
+
+def fun_l17_n427(x)
+    if (x < 1)
+        fun_l18_n446(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n428(x)
+    if (x < 1)
+        fun_l18_n910(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n429(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n430(x)
+    if (x < 1)
+        fun_l18_n812(x)
+    else
+        fun_l18_n545(x)
+    end
+end
+
+def fun_l17_n431(x)
+    if (x < 1)
+        fun_l18_n191(x)
+    else
+        fun_l18_n260(x)
+    end
+end
+
+def fun_l17_n432(x)
+    if (x < 1)
+        fun_l18_n155(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n433(x)
+    if (x < 1)
+        fun_l18_n374(x)
+    else
+        fun_l18_n991(x)
+    end
+end
+
+def fun_l17_n434(x)
+    if (x < 1)
+        fun_l18_n611(x)
+    else
+        fun_l18_n334(x)
+    end
+end
+
+def fun_l17_n435(x)
+    if (x < 1)
+        fun_l18_n876(x)
+    else
+        fun_l18_n386(x)
+    end
+end
+
+def fun_l17_n436(x)
+    if (x < 1)
+        fun_l18_n985(x)
+    else
+        fun_l18_n874(x)
+    end
+end
+
+def fun_l17_n437(x)
+    if (x < 1)
+        fun_l18_n715(x)
+    else
+        fun_l18_n52(x)
+    end
+end
+
+def fun_l17_n438(x)
+    if (x < 1)
+        fun_l18_n53(x)
+    else
+        fun_l18_n15(x)
+    end
+end
+
+def fun_l17_n439(x)
+    if (x < 1)
+        fun_l18_n689(x)
+    else
+        fun_l18_n498(x)
+    end
+end
+
+def fun_l17_n440(x)
+    if (x < 1)
+        fun_l18_n990(x)
+    else
+        fun_l18_n70(x)
+    end
+end
+
+def fun_l17_n441(x)
+    if (x < 1)
+        fun_l18_n369(x)
+    else
+        fun_l18_n327(x)
+    end
+end
+
+def fun_l17_n442(x)
+    if (x < 1)
+        fun_l18_n157(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n443(x)
+    if (x < 1)
+        fun_l18_n822(x)
+    else
+        fun_l18_n472(x)
+    end
+end
+
+def fun_l17_n444(x)
+    if (x < 1)
+        fun_l18_n465(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n445(x)
+    if (x < 1)
+        fun_l18_n543(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n446(x)
+    if (x < 1)
+        fun_l18_n662(x)
+    else
+        fun_l18_n531(x)
+    end
+end
+
+def fun_l17_n447(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n150(x)
+    end
+end
+
+def fun_l17_n448(x)
+    if (x < 1)
+        fun_l18_n438(x)
+    else
+        fun_l18_n552(x)
+    end
+end
+
+def fun_l17_n449(x)
+    if (x < 1)
+        fun_l18_n23(x)
+    else
+        fun_l18_n89(x)
+    end
+end
+
+def fun_l17_n450(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n313(x)
+    end
+end
+
+def fun_l17_n451(x)
+    if (x < 1)
+        fun_l18_n221(x)
+    else
+        fun_l18_n622(x)
+    end
+end
+
+def fun_l17_n452(x)
+    if (x < 1)
+        fun_l18_n347(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n453(x)
+    if (x < 1)
+        fun_l18_n695(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n454(x)
+    if (x < 1)
+        fun_l18_n829(x)
+    else
+        fun_l18_n409(x)
+    end
+end
+
+def fun_l17_n455(x)
+    if (x < 1)
+        fun_l18_n398(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n456(x)
+    if (x < 1)
+        fun_l18_n983(x)
+    else
+        fun_l18_n235(x)
+    end
+end
+
+def fun_l17_n457(x)
+    if (x < 1)
+        fun_l18_n542(x)
+    else
+        fun_l18_n819(x)
+    end
+end
+
+def fun_l17_n458(x)
+    if (x < 1)
+        fun_l18_n952(x)
+    else
+        fun_l18_n123(x)
+    end
+end
+
+def fun_l17_n459(x)
+    if (x < 1)
+        fun_l18_n249(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n460(x)
+    if (x < 1)
+        fun_l18_n833(x)
+    else
+        fun_l18_n657(x)
+    end
+end
+
+def fun_l17_n461(x)
+    if (x < 1)
+        fun_l18_n847(x)
+    else
+        fun_l18_n396(x)
+    end
+end
+
+def fun_l17_n462(x)
+    if (x < 1)
+        fun_l18_n611(x)
+    else
+        fun_l18_n790(x)
+    end
+end
+
+def fun_l17_n463(x)
+    if (x < 1)
+        fun_l18_n944(x)
+    else
+        fun_l18_n655(x)
+    end
+end
+
+def fun_l17_n464(x)
+    if (x < 1)
+        fun_l18_n688(x)
+    else
+        fun_l18_n804(x)
+    end
+end
+
+def fun_l17_n465(x)
+    if (x < 1)
+        fun_l18_n29(x)
+    else
+        fun_l18_n324(x)
+    end
+end
+
+def fun_l17_n466(x)
+    if (x < 1)
+        fun_l18_n496(x)
+    else
+        fun_l18_n76(x)
+    end
+end
+
+def fun_l17_n467(x)
+    if (x < 1)
+        fun_l18_n317(x)
+    else
+        fun_l18_n241(x)
+    end
+end
+
+def fun_l17_n468(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n516(x)
+    end
+end
+
+def fun_l17_n469(x)
+    if (x < 1)
+        fun_l18_n430(x)
+    else
+        fun_l18_n355(x)
+    end
+end
+
+def fun_l17_n470(x)
+    if (x < 1)
+        fun_l18_n683(x)
+    else
+        fun_l18_n16(x)
+    end
+end
+
+def fun_l17_n471(x)
+    if (x < 1)
+        fun_l18_n46(x)
+    else
+        fun_l18_n216(x)
+    end
+end
+
+def fun_l17_n472(x)
+    if (x < 1)
+        fun_l18_n460(x)
+    else
+        fun_l18_n460(x)
+    end
+end
+
+def fun_l17_n473(x)
+    if (x < 1)
+        fun_l18_n120(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n474(x)
+    if (x < 1)
+        fun_l18_n663(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n475(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n460(x)
+    end
+end
+
+def fun_l17_n476(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n533(x)
+    end
+end
+
+def fun_l17_n477(x)
+    if (x < 1)
+        fun_l18_n105(x)
+    else
+        fun_l18_n671(x)
+    end
+end
+
+def fun_l17_n478(x)
+    if (x < 1)
+        fun_l18_n849(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n479(x)
+    if (x < 1)
+        fun_l18_n482(x)
+    else
+        fun_l18_n502(x)
+    end
+end
+
+def fun_l17_n480(x)
+    if (x < 1)
+        fun_l18_n335(x)
+    else
+        fun_l18_n795(x)
+    end
+end
+
+def fun_l17_n481(x)
+    if (x < 1)
+        fun_l18_n168(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n482(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n633(x)
+    end
+end
+
+def fun_l17_n483(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n484(x)
+    if (x < 1)
+        fun_l18_n448(x)
+    else
+        fun_l18_n954(x)
+    end
+end
+
+def fun_l17_n485(x)
+    if (x < 1)
+        fun_l18_n421(x)
+    else
+        fun_l18_n802(x)
+    end
+end
+
+def fun_l17_n486(x)
+    if (x < 1)
+        fun_l18_n477(x)
+    else
+        fun_l18_n976(x)
+    end
+end
+
+def fun_l17_n487(x)
+    if (x < 1)
+        fun_l18_n53(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n488(x)
+    if (x < 1)
+        fun_l18_n733(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n489(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n537(x)
+    end
+end
+
+def fun_l17_n490(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n178(x)
+    end
+end
+
+def fun_l17_n491(x)
+    if (x < 1)
+        fun_l18_n335(x)
+    else
+        fun_l18_n255(x)
+    end
+end
+
+def fun_l17_n492(x)
+    if (x < 1)
+        fun_l18_n798(x)
+    else
+        fun_l18_n398(x)
+    end
+end
+
+def fun_l17_n493(x)
+    if (x < 1)
+        fun_l18_n112(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n494(x)
+    if (x < 1)
+        fun_l18_n888(x)
+    else
+        fun_l18_n136(x)
+    end
+end
+
+def fun_l17_n495(x)
+    if (x < 1)
+        fun_l18_n726(x)
+    else
+        fun_l18_n678(x)
+    end
+end
+
+def fun_l17_n496(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n625(x)
+    end
+end
+
+def fun_l17_n497(x)
+    if (x < 1)
+        fun_l18_n772(x)
+    else
+        fun_l18_n14(x)
+    end
+end
+
+def fun_l17_n498(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n758(x)
+    end
+end
+
+def fun_l17_n499(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n570(x)
+    end
+end
+
+def fun_l17_n500(x)
+    if (x < 1)
+        fun_l18_n368(x)
+    else
+        fun_l18_n681(x)
+    end
+end
+
+def fun_l17_n501(x)
+    if (x < 1)
+        fun_l18_n768(x)
+    else
+        fun_l18_n747(x)
+    end
+end
+
+def fun_l17_n502(x)
+    if (x < 1)
+        fun_l18_n957(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n503(x)
+    if (x < 1)
+        fun_l18_n669(x)
+    else
+        fun_l18_n939(x)
+    end
+end
+
+def fun_l17_n504(x)
+    if (x < 1)
+        fun_l18_n969(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n505(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n29(x)
+    end
+end
+
+def fun_l17_n506(x)
+    if (x < 1)
+        fun_l18_n92(x)
+    else
+        fun_l18_n230(x)
+    end
+end
+
+def fun_l17_n507(x)
+    if (x < 1)
+        fun_l18_n670(x)
+    else
+        fun_l18_n744(x)
+    end
+end
+
+def fun_l17_n508(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n900(x)
+    end
+end
+
+def fun_l17_n509(x)
+    if (x < 1)
+        fun_l18_n480(x)
+    else
+        fun_l18_n6(x)
+    end
+end
+
+def fun_l17_n510(x)
+    if (x < 1)
+        fun_l18_n141(x)
+    else
+        fun_l18_n735(x)
+    end
+end
+
+def fun_l17_n511(x)
+    if (x < 1)
+        fun_l18_n622(x)
+    else
+        fun_l18_n617(x)
+    end
+end
+
+def fun_l17_n512(x)
+    if (x < 1)
+        fun_l18_n491(x)
+    else
+        fun_l18_n154(x)
+    end
+end
+
+def fun_l17_n513(x)
+    if (x < 1)
+        fun_l18_n931(x)
+    else
+        fun_l18_n730(x)
+    end
+end
+
+def fun_l17_n514(x)
+    if (x < 1)
+        fun_l18_n935(x)
+    else
+        fun_l18_n51(x)
+    end
+end
+
+def fun_l17_n515(x)
+    if (x < 1)
+        fun_l18_n751(x)
+    else
+        fun_l18_n786(x)
+    end
+end
+
+def fun_l17_n516(x)
+    if (x < 1)
+        fun_l18_n538(x)
+    else
+        fun_l18_n630(x)
+    end
+end
+
+def fun_l17_n517(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n518(x)
+    if (x < 1)
+        fun_l18_n572(x)
+    else
+        fun_l18_n408(x)
+    end
+end
+
+def fun_l17_n519(x)
+    if (x < 1)
+        fun_l18_n961(x)
+    else
+        fun_l18_n820(x)
+    end
+end
+
+def fun_l17_n520(x)
+    if (x < 1)
+        fun_l18_n33(x)
+    else
+        fun_l18_n655(x)
+    end
+end
+
+def fun_l17_n521(x)
+    if (x < 1)
+        fun_l18_n940(x)
+    else
+        fun_l18_n436(x)
+    end
+end
+
+def fun_l17_n522(x)
+    if (x < 1)
+        fun_l18_n471(x)
+    else
+        fun_l18_n975(x)
+    end
+end
+
+def fun_l17_n523(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n640(x)
+    end
+end
+
+def fun_l17_n524(x)
+    if (x < 1)
+        fun_l18_n226(x)
+    else
+        fun_l18_n645(x)
+    end
+end
+
+def fun_l17_n525(x)
+    if (x < 1)
+        fun_l18_n986(x)
+    else
+        fun_l18_n858(x)
+    end
+end
+
+def fun_l17_n526(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n842(x)
+    end
+end
+
+def fun_l17_n527(x)
+    if (x < 1)
+        fun_l18_n273(x)
+    else
+        fun_l18_n510(x)
+    end
+end
+
+def fun_l17_n528(x)
+    if (x < 1)
+        fun_l18_n728(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n529(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n988(x)
+    end
+end
+
+def fun_l17_n530(x)
+    if (x < 1)
+        fun_l18_n472(x)
+    else
+        fun_l18_n933(x)
+    end
+end
+
+def fun_l17_n531(x)
+    if (x < 1)
+        fun_l18_n105(x)
+    else
+        fun_l18_n501(x)
+    end
+end
+
+def fun_l17_n532(x)
+    if (x < 1)
+        fun_l18_n77(x)
+    else
+        fun_l18_n616(x)
+    end
+end
+
+def fun_l17_n533(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n86(x)
+    end
+end
+
+def fun_l17_n534(x)
+    if (x < 1)
+        fun_l18_n312(x)
+    else
+        fun_l18_n638(x)
+    end
+end
+
+def fun_l17_n535(x)
+    if (x < 1)
+        fun_l18_n908(x)
+    else
+        fun_l18_n697(x)
+    end
+end
+
+def fun_l17_n536(x)
+    if (x < 1)
+        fun_l18_n520(x)
+    else
+        fun_l18_n379(x)
+    end
+end
+
+def fun_l17_n537(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n97(x)
+    end
+end
+
+def fun_l17_n538(x)
+    if (x < 1)
+        fun_l18_n312(x)
+    else
+        fun_l18_n981(x)
+    end
+end
+
+def fun_l17_n539(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n579(x)
+    end
+end
+
+def fun_l17_n540(x)
+    if (x < 1)
+        fun_l18_n569(x)
+    else
+        fun_l18_n512(x)
+    end
+end
+
+def fun_l17_n541(x)
+    if (x < 1)
+        fun_l18_n319(x)
+    else
+        fun_l18_n388(x)
+    end
+end
+
+def fun_l17_n542(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n422(x)
+    end
+end
+
+def fun_l17_n543(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n614(x)
+    end
+end
+
+def fun_l17_n544(x)
+    if (x < 1)
+        fun_l18_n104(x)
+    else
+        fun_l18_n771(x)
+    end
+end
+
+def fun_l17_n545(x)
+    if (x < 1)
+        fun_l18_n204(x)
+    else
+        fun_l18_n452(x)
+    end
+end
+
+def fun_l17_n546(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n558(x)
+    end
+end
+
+def fun_l17_n547(x)
+    if (x < 1)
+        fun_l18_n265(x)
+    else
+        fun_l18_n768(x)
+    end
+end
+
+def fun_l17_n548(x)
+    if (x < 1)
+        fun_l18_n21(x)
+    else
+        fun_l18_n44(x)
+    end
+end
+
+def fun_l17_n549(x)
+    if (x < 1)
+        fun_l18_n72(x)
+    else
+        fun_l18_n321(x)
+    end
+end
+
+def fun_l17_n550(x)
+    if (x < 1)
+        fun_l18_n473(x)
+    else
+        fun_l18_n127(x)
+    end
+end
+
+def fun_l17_n551(x)
+    if (x < 1)
+        fun_l18_n188(x)
+    else
+        fun_l18_n782(x)
+    end
+end
+
+def fun_l17_n552(x)
+    if (x < 1)
+        fun_l18_n118(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n553(x)
+    if (x < 1)
+        fun_l18_n279(x)
+    else
+        fun_l18_n605(x)
+    end
+end
+
+def fun_l17_n554(x)
+    if (x < 1)
+        fun_l18_n760(x)
+    else
+        fun_l18_n561(x)
+    end
+end
+
+def fun_l17_n555(x)
+    if (x < 1)
+        fun_l18_n873(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n556(x)
+    if (x < 1)
+        fun_l18_n555(x)
+    else
+        fun_l18_n955(x)
+    end
+end
+
+def fun_l17_n557(x)
+    if (x < 1)
+        fun_l18_n757(x)
+    else
+        fun_l18_n171(x)
+    end
+end
+
+def fun_l17_n558(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n784(x)
+    end
+end
+
+def fun_l17_n559(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n798(x)
+    end
+end
+
+def fun_l17_n560(x)
+    if (x < 1)
+        fun_l18_n472(x)
+    else
+        fun_l18_n291(x)
+    end
+end
+
+def fun_l17_n561(x)
+    if (x < 1)
+        fun_l18_n870(x)
+    else
+        fun_l18_n395(x)
+    end
+end
+
+def fun_l17_n562(x)
+    if (x < 1)
+        fun_l18_n482(x)
+    else
+        fun_l18_n281(x)
+    end
+end
+
+def fun_l17_n563(x)
+    if (x < 1)
+        fun_l18_n761(x)
+    else
+        fun_l18_n362(x)
+    end
+end
+
+def fun_l17_n564(x)
+    if (x < 1)
+        fun_l18_n586(x)
+    else
+        fun_l18_n92(x)
+    end
+end
+
+def fun_l17_n565(x)
+    if (x < 1)
+        fun_l18_n620(x)
+    else
+        fun_l18_n356(x)
+    end
+end
+
+def fun_l17_n566(x)
+    if (x < 1)
+        fun_l18_n529(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n567(x)
+    if (x < 1)
+        fun_l18_n351(x)
+    else
+        fun_l18_n77(x)
+    end
+end
+
+def fun_l17_n568(x)
+    if (x < 1)
+        fun_l18_n659(x)
+    else
+        fun_l18_n631(x)
+    end
+end
+
+def fun_l17_n569(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n466(x)
+    end
+end
+
+def fun_l17_n570(x)
+    if (x < 1)
+        fun_l18_n374(x)
+    else
+        fun_l18_n203(x)
+    end
+end
+
+def fun_l17_n571(x)
+    if (x < 1)
+        fun_l18_n479(x)
+    else
+        fun_l18_n977(x)
+    end
+end
+
+def fun_l17_n572(x)
+    if (x < 1)
+        fun_l18_n862(x)
+    else
+        fun_l18_n323(x)
+    end
+end
+
+def fun_l17_n573(x)
+    if (x < 1)
+        fun_l18_n148(x)
+    else
+        fun_l18_n848(x)
+    end
+end
+
+def fun_l17_n574(x)
+    if (x < 1)
+        fun_l18_n29(x)
+    else
+        fun_l18_n210(x)
+    end
+end
+
+def fun_l17_n575(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n874(x)
+    end
+end
+
+def fun_l17_n576(x)
+    if (x < 1)
+        fun_l18_n843(x)
+    else
+        fun_l18_n5(x)
+    end
+end
+
+def fun_l17_n577(x)
+    if (x < 1)
+        fun_l18_n284(x)
+    else
+        fun_l18_n242(x)
+    end
+end
+
+def fun_l17_n578(x)
+    if (x < 1)
+        fun_l18_n768(x)
+    else
+        fun_l18_n683(x)
+    end
+end
+
+def fun_l17_n579(x)
+    if (x < 1)
+        fun_l18_n67(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n580(x)
+    if (x < 1)
+        fun_l18_n326(x)
+    else
+        fun_l18_n200(x)
+    end
+end
+
+def fun_l17_n581(x)
+    if (x < 1)
+        fun_l18_n186(x)
+    else
+        fun_l18_n772(x)
+    end
+end
+
+def fun_l17_n582(x)
+    if (x < 1)
+        fun_l18_n151(x)
+    else
+        fun_l18_n222(x)
+    end
+end
+
+def fun_l17_n583(x)
+    if (x < 1)
+        fun_l18_n690(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n584(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n585(x)
+    if (x < 1)
+        fun_l18_n542(x)
+    else
+        fun_l18_n703(x)
+    end
+end
+
+def fun_l17_n586(x)
+    if (x < 1)
+        fun_l18_n417(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n587(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n231(x)
+    end
+end
+
+def fun_l17_n588(x)
+    if (x < 1)
+        fun_l18_n859(x)
+    else
+        fun_l18_n557(x)
+    end
+end
+
+def fun_l17_n589(x)
+    if (x < 1)
+        fun_l18_n131(x)
+    else
+        fun_l18_n847(x)
+    end
+end
+
+def fun_l17_n590(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n613(x)
+    end
+end
+
+def fun_l17_n591(x)
+    if (x < 1)
+        fun_l18_n273(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n592(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n243(x)
+    end
+end
+
+def fun_l17_n593(x)
+    if (x < 1)
+        fun_l18_n742(x)
+    else
+        fun_l18_n123(x)
+    end
+end
+
+def fun_l17_n594(x)
+    if (x < 1)
+        fun_l18_n480(x)
+    else
+        fun_l18_n290(x)
+    end
+end
+
+def fun_l17_n595(x)
+    if (x < 1)
+        fun_l18_n56(x)
+    else
+        fun_l18_n727(x)
+    end
+end
+
+def fun_l17_n596(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n723(x)
+    end
+end
+
+def fun_l17_n597(x)
+    if (x < 1)
+        fun_l18_n405(x)
+    else
+        fun_l18_n498(x)
+    end
+end
+
+def fun_l17_n598(x)
+    if (x < 1)
+        fun_l18_n772(x)
+    else
+        fun_l18_n543(x)
+    end
+end
+
+def fun_l17_n599(x)
+    if (x < 1)
+        fun_l18_n20(x)
+    else
+        fun_l18_n39(x)
+    end
+end
+
+def fun_l17_n600(x)
+    if (x < 1)
+        fun_l18_n657(x)
+    else
+        fun_l18_n381(x)
+    end
+end
+
+def fun_l17_n601(x)
+    if (x < 1)
+        fun_l18_n505(x)
+    else
+        fun_l18_n196(x)
+    end
+end
+
+def fun_l17_n602(x)
+    if (x < 1)
+        fun_l18_n250(x)
+    else
+        fun_l18_n503(x)
+    end
+end
+
+def fun_l17_n603(x)
+    if (x < 1)
+        fun_l18_n694(x)
+    else
+        fun_l18_n589(x)
+    end
+end
+
+def fun_l17_n604(x)
+    if (x < 1)
+        fun_l18_n27(x)
+    else
+        fun_l18_n202(x)
+    end
+end
+
+def fun_l17_n605(x)
+    if (x < 1)
+        fun_l18_n901(x)
+    else
+        fun_l18_n823(x)
+    end
+end
+
+def fun_l17_n606(x)
+    if (x < 1)
+        fun_l18_n296(x)
+    else
+        fun_l18_n854(x)
+    end
+end
+
+def fun_l17_n607(x)
+    if (x < 1)
+        fun_l18_n226(x)
+    else
+        fun_l18_n110(x)
+    end
+end
+
+def fun_l17_n608(x)
+    if (x < 1)
+        fun_l18_n205(x)
+    else
+        fun_l18_n215(x)
+    end
+end
+
+def fun_l17_n609(x)
+    if (x < 1)
+        fun_l18_n265(x)
+    else
+        fun_l18_n715(x)
+    end
+end
+
+def fun_l17_n610(x)
+    if (x < 1)
+        fun_l18_n881(x)
+    else
+        fun_l18_n106(x)
+    end
+end
+
+def fun_l17_n611(x)
+    if (x < 1)
+        fun_l18_n674(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n612(x)
+    if (x < 1)
+        fun_l18_n20(x)
+    else
+        fun_l18_n96(x)
+    end
+end
+
+def fun_l17_n613(x)
+    if (x < 1)
+        fun_l18_n880(x)
+    else
+        fun_l18_n599(x)
+    end
+end
+
+def fun_l17_n614(x)
+    if (x < 1)
+        fun_l18_n47(x)
+    else
+        fun_l18_n633(x)
+    end
+end
+
+def fun_l17_n615(x)
+    if (x < 1)
+        fun_l18_n7(x)
+    else
+        fun_l18_n165(x)
+    end
+end
+
+def fun_l17_n616(x)
+    if (x < 1)
+        fun_l18_n478(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n617(x)
+    if (x < 1)
+        fun_l18_n97(x)
+    else
+        fun_l18_n369(x)
+    end
+end
+
+def fun_l17_n618(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n637(x)
+    end
+end
+
+def fun_l17_n619(x)
+    if (x < 1)
+        fun_l18_n966(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n620(x)
+    if (x < 1)
+        fun_l18_n349(x)
+    else
+        fun_l18_n413(x)
+    end
+end
+
+def fun_l17_n621(x)
+    if (x < 1)
+        fun_l18_n343(x)
+    else
+        fun_l18_n224(x)
+    end
+end
+
+def fun_l17_n622(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n3(x)
+    end
+end
+
+def fun_l17_n623(x)
+    if (x < 1)
+        fun_l18_n539(x)
+    else
+        fun_l18_n542(x)
+    end
+end
+
+def fun_l17_n624(x)
+    if (x < 1)
+        fun_l18_n117(x)
+    else
+        fun_l18_n348(x)
+    end
+end
+
+def fun_l17_n625(x)
+    if (x < 1)
+        fun_l18_n753(x)
+    else
+        fun_l18_n284(x)
+    end
+end
+
+def fun_l17_n626(x)
+    if (x < 1)
+        fun_l18_n146(x)
+    else
+        fun_l18_n228(x)
+    end
+end
+
+def fun_l17_n627(x)
+    if (x < 1)
+        fun_l18_n286(x)
+    else
+        fun_l18_n413(x)
+    end
+end
+
+def fun_l17_n628(x)
+    if (x < 1)
+        fun_l18_n730(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n629(x)
+    if (x < 1)
+        fun_l18_n455(x)
+    else
+        fun_l18_n141(x)
+    end
+end
+
+def fun_l17_n630(x)
+    if (x < 1)
+        fun_l18_n300(x)
+    else
+        fun_l18_n368(x)
+    end
+end
+
+def fun_l17_n631(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n711(x)
+    end
+end
+
+def fun_l17_n632(x)
+    if (x < 1)
+        fun_l18_n310(x)
+    else
+        fun_l18_n805(x)
+    end
+end
+
+def fun_l17_n633(x)
+    if (x < 1)
+        fun_l18_n2(x)
+    else
+        fun_l18_n709(x)
+    end
+end
+
+def fun_l17_n634(x)
+    if (x < 1)
+        fun_l18_n239(x)
+    else
+        fun_l18_n394(x)
+    end
+end
+
+def fun_l17_n635(x)
+    if (x < 1)
+        fun_l18_n933(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n636(x)
+    if (x < 1)
+        fun_l18_n54(x)
+    else
+        fun_l18_n511(x)
+    end
+end
+
+def fun_l17_n637(x)
+    if (x < 1)
+        fun_l18_n908(x)
+    else
+        fun_l18_n550(x)
+    end
+end
+
+def fun_l17_n638(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n485(x)
+    end
+end
+
+def fun_l17_n639(x)
+    if (x < 1)
+        fun_l18_n676(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n640(x)
+    if (x < 1)
+        fun_l18_n205(x)
+    else
+        fun_l18_n901(x)
+    end
+end
+
+def fun_l17_n641(x)
+    if (x < 1)
+        fun_l18_n834(x)
+    else
+        fun_l18_n133(x)
+    end
+end
+
+def fun_l17_n642(x)
+    if (x < 1)
+        fun_l18_n824(x)
+    else
+        fun_l18_n551(x)
+    end
+end
+
+def fun_l17_n643(x)
+    if (x < 1)
+        fun_l18_n362(x)
+    else
+        fun_l18_n684(x)
+    end
+end
+
+def fun_l17_n644(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n103(x)
+    end
+end
+
+def fun_l17_n645(x)
+    if (x < 1)
+        fun_l18_n999(x)
+    else
+        fun_l18_n995(x)
+    end
+end
+
+def fun_l17_n646(x)
+    if (x < 1)
+        fun_l18_n24(x)
+    else
+        fun_l18_n405(x)
+    end
+end
+
+def fun_l17_n647(x)
+    if (x < 1)
+        fun_l18_n71(x)
+    else
+        fun_l18_n201(x)
+    end
+end
+
+def fun_l17_n648(x)
+    if (x < 1)
+        fun_l18_n905(x)
+    else
+        fun_l18_n14(x)
+    end
+end
+
+def fun_l17_n649(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n932(x)
+    end
+end
+
+def fun_l17_n650(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n333(x)
+    end
+end
+
+def fun_l17_n651(x)
+    if (x < 1)
+        fun_l18_n282(x)
+    else
+        fun_l18_n197(x)
+    end
+end
+
+def fun_l17_n652(x)
+    if (x < 1)
+        fun_l18_n684(x)
+    else
+        fun_l18_n618(x)
+    end
+end
+
+def fun_l17_n653(x)
+    if (x < 1)
+        fun_l18_n201(x)
+    else
+        fun_l18_n571(x)
+    end
+end
+
+def fun_l17_n654(x)
+    if (x < 1)
+        fun_l18_n26(x)
+    else
+        fun_l18_n813(x)
+    end
+end
+
+def fun_l17_n655(x)
+    if (x < 1)
+        fun_l18_n879(x)
+    else
+        fun_l18_n860(x)
+    end
+end
+
+def fun_l17_n656(x)
+    if (x < 1)
+        fun_l18_n193(x)
+    else
+        fun_l18_n635(x)
+    end
+end
+
+def fun_l17_n657(x)
+    if (x < 1)
+        fun_l18_n163(x)
+    else
+        fun_l18_n601(x)
+    end
+end
+
+def fun_l17_n658(x)
+    if (x < 1)
+        fun_l18_n794(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n659(x)
+    if (x < 1)
+        fun_l18_n22(x)
+    else
+        fun_l18_n427(x)
+    end
+end
+
+def fun_l17_n660(x)
+    if (x < 1)
+        fun_l18_n959(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n661(x)
+    if (x < 1)
+        fun_l18_n233(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n662(x)
+    if (x < 1)
+        fun_l18_n367(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n663(x)
+    if (x < 1)
+        fun_l18_n511(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n664(x)
+    if (x < 1)
+        fun_l18_n256(x)
+    else
+        fun_l18_n294(x)
+    end
+end
+
+def fun_l17_n665(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n549(x)
+    end
+end
+
+def fun_l17_n666(x)
+    if (x < 1)
+        fun_l18_n868(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n667(x)
+    if (x < 1)
+        fun_l18_n703(x)
+    else
+        fun_l18_n157(x)
+    end
+end
+
+def fun_l17_n668(x)
+    if (x < 1)
+        fun_l18_n639(x)
+    else
+        fun_l18_n685(x)
+    end
+end
+
+def fun_l17_n669(x)
+    if (x < 1)
+        fun_l18_n278(x)
+    else
+        fun_l18_n366(x)
+    end
+end
+
+def fun_l17_n670(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n641(x)
+    end
+end
+
+def fun_l17_n671(x)
+    if (x < 1)
+        fun_l18_n452(x)
+    else
+        fun_l18_n851(x)
+    end
+end
+
+def fun_l17_n672(x)
+    if (x < 1)
+        fun_l18_n256(x)
+    else
+        fun_l18_n282(x)
+    end
+end
+
+def fun_l17_n673(x)
+    if (x < 1)
+        fun_l18_n397(x)
+    else
+        fun_l18_n446(x)
+    end
+end
+
+def fun_l17_n674(x)
+    if (x < 1)
+        fun_l18_n499(x)
+    else
+        fun_l18_n166(x)
+    end
+end
+
+def fun_l17_n675(x)
+    if (x < 1)
+        fun_l18_n299(x)
+    else
+        fun_l18_n473(x)
+    end
+end
+
+def fun_l17_n676(x)
+    if (x < 1)
+        fun_l18_n331(x)
+    else
+        fun_l18_n590(x)
+    end
+end
+
+def fun_l17_n677(x)
+    if (x < 1)
+        fun_l18_n951(x)
+    else
+        fun_l18_n227(x)
+    end
+end
+
+def fun_l17_n678(x)
+    if (x < 1)
+        fun_l18_n874(x)
+    else
+        fun_l18_n359(x)
+    end
+end
+
+def fun_l17_n679(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n13(x)
+    end
+end
+
+def fun_l17_n680(x)
+    if (x < 1)
+        fun_l18_n878(x)
+    else
+        fun_l18_n902(x)
+    end
+end
+
+def fun_l17_n681(x)
+    if (x < 1)
+        fun_l18_n450(x)
+    else
+        fun_l18_n262(x)
+    end
+end
+
+def fun_l17_n682(x)
+    if (x < 1)
+        fun_l18_n759(x)
+    else
+        fun_l18_n253(x)
+    end
+end
+
+def fun_l17_n683(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n191(x)
+    end
+end
+
+def fun_l17_n684(x)
+    if (x < 1)
+        fun_l18_n93(x)
+    else
+        fun_l18_n275(x)
+    end
+end
+
+def fun_l17_n685(x)
+    if (x < 1)
+        fun_l18_n17(x)
+    else
+        fun_l18_n575(x)
+    end
+end
+
+def fun_l17_n686(x)
+    if (x < 1)
+        fun_l18_n971(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n687(x)
+    if (x < 1)
+        fun_l18_n942(x)
+    else
+        fun_l18_n285(x)
+    end
+end
+
+def fun_l17_n688(x)
+    if (x < 1)
+        fun_l18_n348(x)
+    else
+        fun_l18_n7(x)
+    end
+end
+
+def fun_l17_n689(x)
+    if (x < 1)
+        fun_l18_n839(x)
+    else
+        fun_l18_n532(x)
+    end
+end
+
+def fun_l17_n690(x)
+    if (x < 1)
+        fun_l18_n578(x)
+    else
+        fun_l18_n751(x)
+    end
+end
+
+def fun_l17_n691(x)
+    if (x < 1)
+        fun_l18_n85(x)
+    else
+        fun_l18_n311(x)
+    end
+end
+
+def fun_l17_n692(x)
+    if (x < 1)
+        fun_l18_n573(x)
+    else
+        fun_l18_n685(x)
+    end
+end
+
+def fun_l17_n693(x)
+    if (x < 1)
+        fun_l18_n449(x)
+    else
+        fun_l18_n749(x)
+    end
+end
+
+def fun_l17_n694(x)
+    if (x < 1)
+        fun_l18_n251(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n695(x)
+    if (x < 1)
+        fun_l18_n69(x)
+    else
+        fun_l18_n725(x)
+    end
+end
+
+def fun_l17_n696(x)
+    if (x < 1)
+        fun_l18_n54(x)
+    else
+        fun_l18_n196(x)
+    end
+end
+
+def fun_l17_n697(x)
+    if (x < 1)
+        fun_l18_n950(x)
+    else
+        fun_l18_n423(x)
+    end
+end
+
+def fun_l17_n698(x)
+    if (x < 1)
+        fun_l18_n809(x)
+    else
+        fun_l18_n787(x)
+    end
+end
+
+def fun_l17_n699(x)
+    if (x < 1)
+        fun_l18_n211(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n700(x)
+    if (x < 1)
+        fun_l18_n686(x)
+    else
+        fun_l18_n287(x)
+    end
+end
+
+def fun_l17_n701(x)
+    if (x < 1)
+        fun_l18_n412(x)
+    else
+        fun_l18_n769(x)
+    end
+end
+
+def fun_l17_n702(x)
+    if (x < 1)
+        fun_l18_n62(x)
+    else
+        fun_l18_n592(x)
+    end
+end
+
+def fun_l17_n703(x)
+    if (x < 1)
+        fun_l18_n628(x)
+    else
+        fun_l18_n121(x)
+    end
+end
+
+def fun_l17_n704(x)
+    if (x < 1)
+        fun_l18_n84(x)
+    else
+        fun_l18_n350(x)
+    end
+end
+
+def fun_l17_n705(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n174(x)
+    end
+end
+
+def fun_l17_n706(x)
+    if (x < 1)
+        fun_l18_n39(x)
+    else
+        fun_l18_n266(x)
+    end
+end
+
+def fun_l17_n707(x)
+    if (x < 1)
+        fun_l18_n196(x)
+    else
+        fun_l18_n838(x)
+    end
+end
+
+def fun_l17_n708(x)
+    if (x < 1)
+        fun_l18_n647(x)
+    else
+        fun_l18_n26(x)
+    end
+end
+
+def fun_l17_n709(x)
+    if (x < 1)
+        fun_l18_n693(x)
+    else
+        fun_l18_n660(x)
+    end
+end
+
+def fun_l17_n710(x)
+    if (x < 1)
+        fun_l18_n530(x)
+    else
+        fun_l18_n654(x)
+    end
+end
+
+def fun_l17_n711(x)
+    if (x < 1)
+        fun_l18_n580(x)
+    else
+        fun_l18_n65(x)
+    end
+end
+
+def fun_l17_n712(x)
+    if (x < 1)
+        fun_l18_n789(x)
+    else
+        fun_l18_n832(x)
+    end
+end
+
+def fun_l17_n713(x)
+    if (x < 1)
+        fun_l18_n366(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n714(x)
+    if (x < 1)
+        fun_l18_n571(x)
+    else
+        fun_l18_n23(x)
+    end
+end
+
+def fun_l17_n715(x)
+    if (x < 1)
+        fun_l18_n552(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n716(x)
+    if (x < 1)
+        fun_l18_n752(x)
+    else
+        fun_l18_n403(x)
+    end
+end
+
+def fun_l17_n717(x)
+    if (x < 1)
+        fun_l18_n498(x)
+    else
+        fun_l18_n173(x)
+    end
+end
+
+def fun_l17_n718(x)
+    if (x < 1)
+        fun_l18_n168(x)
+    else
+        fun_l18_n656(x)
+    end
+end
+
+def fun_l17_n719(x)
+    if (x < 1)
+        fun_l18_n75(x)
+    else
+        fun_l18_n393(x)
+    end
+end
+
+def fun_l17_n720(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n101(x)
+    end
+end
+
+def fun_l17_n721(x)
+    if (x < 1)
+        fun_l18_n445(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n722(x)
+    if (x < 1)
+        fun_l18_n450(x)
+    else
+        fun_l18_n136(x)
+    end
+end
+
+def fun_l17_n723(x)
+    if (x < 1)
+        fun_l18_n267(x)
+    else
+        fun_l18_n800(x)
+    end
+end
+
+def fun_l17_n724(x)
+    if (x < 1)
+        fun_l18_n98(x)
+    else
+        fun_l18_n955(x)
+    end
+end
+
+def fun_l17_n725(x)
+    if (x < 1)
+        fun_l18_n951(x)
+    else
+        fun_l18_n319(x)
+    end
+end
+
+def fun_l17_n726(x)
+    if (x < 1)
+        fun_l18_n531(x)
+    else
+        fun_l18_n846(x)
+    end
+end
+
+def fun_l17_n727(x)
+    if (x < 1)
+        fun_l18_n888(x)
+    else
+        fun_l18_n600(x)
+    end
+end
+
+def fun_l17_n728(x)
+    if (x < 1)
+        fun_l18_n278(x)
+    else
+        fun_l18_n445(x)
+    end
+end
+
+def fun_l17_n729(x)
+    if (x < 1)
+        fun_l18_n113(x)
+    else
+        fun_l18_n991(x)
+    end
+end
+
+def fun_l17_n730(x)
+    if (x < 1)
+        fun_l18_n756(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n731(x)
+    if (x < 1)
+        fun_l18_n2(x)
+    else
+        fun_l18_n969(x)
+    end
+end
+
+def fun_l17_n732(x)
+    if (x < 1)
+        fun_l18_n138(x)
+    else
+        fun_l18_n198(x)
+    end
+end
+
+def fun_l17_n733(x)
+    if (x < 1)
+        fun_l18_n845(x)
+    else
+        fun_l18_n614(x)
+    end
+end
+
+def fun_l17_n734(x)
+    if (x < 1)
+        fun_l18_n603(x)
+    else
+        fun_l18_n568(x)
+    end
+end
+
+def fun_l17_n735(x)
+    if (x < 1)
+        fun_l18_n276(x)
+    else
+        fun_l18_n58(x)
+    end
+end
+
+def fun_l17_n736(x)
+    if (x < 1)
+        fun_l18_n404(x)
+    else
+        fun_l18_n906(x)
+    end
+end
+
+def fun_l17_n737(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n734(x)
+    end
+end
+
+def fun_l17_n738(x)
+    if (x < 1)
+        fun_l18_n327(x)
+    else
+        fun_l18_n667(x)
+    end
+end
+
+def fun_l17_n739(x)
+    if (x < 1)
+        fun_l18_n600(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n740(x)
+    if (x < 1)
+        fun_l18_n820(x)
+    else
+        fun_l18_n615(x)
+    end
+end
+
+def fun_l17_n741(x)
+    if (x < 1)
+        fun_l18_n779(x)
+    else
+        fun_l18_n912(x)
+    end
+end
+
+def fun_l17_n742(x)
+    if (x < 1)
+        fun_l18_n55(x)
+    else
+        fun_l18_n41(x)
+    end
+end
+
+def fun_l17_n743(x)
+    if (x < 1)
+        fun_l18_n24(x)
+    else
+        fun_l18_n877(x)
+    end
+end
+
+def fun_l17_n744(x)
+    if (x < 1)
+        fun_l18_n834(x)
+    else
+        fun_l18_n10(x)
+    end
+end
+
+def fun_l17_n745(x)
+    if (x < 1)
+        fun_l18_n369(x)
+    else
+        fun_l18_n761(x)
+    end
+end
+
+def fun_l17_n746(x)
+    if (x < 1)
+        fun_l18_n534(x)
+    else
+        fun_l18_n292(x)
+    end
+end
+
+def fun_l17_n747(x)
+    if (x < 1)
+        fun_l18_n260(x)
+    else
+        fun_l18_n98(x)
+    end
+end
+
+def fun_l17_n748(x)
+    if (x < 1)
+        fun_l18_n738(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n749(x)
+    if (x < 1)
+        fun_l18_n156(x)
+    else
+        fun_l18_n322(x)
+    end
+end
+
+def fun_l17_n750(x)
+    if (x < 1)
+        fun_l18_n519(x)
+    else
+        fun_l18_n566(x)
+    end
+end
+
+def fun_l17_n751(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n525(x)
+    end
+end
+
+def fun_l17_n752(x)
+    if (x < 1)
+        fun_l18_n51(x)
+    else
+        fun_l18_n334(x)
+    end
+end
+
+def fun_l17_n753(x)
+    if (x < 1)
+        fun_l18_n593(x)
+    else
+        fun_l18_n799(x)
+    end
+end
+
+def fun_l17_n754(x)
+    if (x < 1)
+        fun_l18_n599(x)
+    else
+        fun_l18_n167(x)
+    end
+end
+
+def fun_l17_n755(x)
+    if (x < 1)
+        fun_l18_n799(x)
+    else
+        fun_l18_n909(x)
+    end
+end
+
+def fun_l17_n756(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n793(x)
+    end
+end
+
+def fun_l17_n757(x)
+    if (x < 1)
+        fun_l18_n144(x)
+    else
+        fun_l18_n279(x)
+    end
+end
+
+def fun_l17_n758(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n603(x)
+    end
+end
+
+def fun_l17_n759(x)
+    if (x < 1)
+        fun_l18_n576(x)
+    else
+        fun_l18_n730(x)
+    end
+end
+
+def fun_l17_n760(x)
+    if (x < 1)
+        fun_l18_n66(x)
+    else
+        fun_l18_n359(x)
+    end
+end
+
+def fun_l17_n761(x)
+    if (x < 1)
+        fun_l18_n555(x)
+    else
+        fun_l18_n553(x)
+    end
+end
+
+def fun_l17_n762(x)
+    if (x < 1)
+        fun_l18_n508(x)
+    else
+        fun_l18_n665(x)
+    end
+end
+
+def fun_l17_n763(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n19(x)
+    end
+end
+
+def fun_l17_n764(x)
+    if (x < 1)
+        fun_l18_n162(x)
+    else
+        fun_l18_n707(x)
+    end
+end
+
+def fun_l17_n765(x)
+    if (x < 1)
+        fun_l18_n262(x)
+    else
+        fun_l18_n494(x)
+    end
+end
+
+def fun_l17_n766(x)
+    if (x < 1)
+        fun_l18_n220(x)
+    else
+        fun_l18_n144(x)
+    end
+end
+
+def fun_l17_n767(x)
+    if (x < 1)
+        fun_l18_n245(x)
+    else
+        fun_l18_n727(x)
+    end
+end
+
+def fun_l17_n768(x)
+    if (x < 1)
+        fun_l18_n875(x)
+    else
+        fun_l18_n610(x)
+    end
+end
+
+def fun_l17_n769(x)
+    if (x < 1)
+        fun_l18_n338(x)
+    else
+        fun_l18_n344(x)
+    end
+end
+
+def fun_l17_n770(x)
+    if (x < 1)
+        fun_l18_n224(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n771(x)
+    if (x < 1)
+        fun_l18_n353(x)
+    else
+        fun_l18_n102(x)
+    end
+end
+
+def fun_l17_n772(x)
+    if (x < 1)
+        fun_l18_n122(x)
+    else
+        fun_l18_n979(x)
+    end
+end
+
+def fun_l17_n773(x)
+    if (x < 1)
+        fun_l18_n549(x)
+    else
+        fun_l18_n296(x)
+    end
+end
+
+def fun_l17_n774(x)
+    if (x < 1)
+        fun_l18_n82(x)
+    else
+        fun_l18_n748(x)
+    end
+end
+
+def fun_l17_n775(x)
+    if (x < 1)
+        fun_l18_n958(x)
+    else
+        fun_l18_n917(x)
+    end
+end
+
+def fun_l17_n776(x)
+    if (x < 1)
+        fun_l18_n173(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n777(x)
+    if (x < 1)
+        fun_l18_n222(x)
+    else
+        fun_l18_n55(x)
+    end
+end
+
+def fun_l17_n778(x)
+    if (x < 1)
+        fun_l18_n529(x)
+    else
+        fun_l18_n548(x)
+    end
+end
+
+def fun_l17_n779(x)
+    if (x < 1)
+        fun_l18_n28(x)
+    else
+        fun_l18_n582(x)
+    end
+end
+
+def fun_l17_n780(x)
+    if (x < 1)
+        fun_l18_n818(x)
+    else
+        fun_l18_n836(x)
+    end
+end
+
+def fun_l17_n781(x)
+    if (x < 1)
+        fun_l18_n972(x)
+    else
+        fun_l18_n73(x)
+    end
+end
+
+def fun_l17_n782(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n999(x)
+    end
+end
+
+def fun_l17_n783(x)
+    if (x < 1)
+        fun_l18_n832(x)
+    else
+        fun_l18_n833(x)
+    end
+end
+
+def fun_l17_n784(x)
+    if (x < 1)
+        fun_l18_n987(x)
+    else
+        fun_l18_n329(x)
+    end
+end
+
+def fun_l17_n785(x)
+    if (x < 1)
+        fun_l18_n715(x)
+    else
+        fun_l18_n441(x)
+    end
+end
+
+def fun_l17_n786(x)
+    if (x < 1)
+        fun_l18_n55(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n787(x)
+    if (x < 1)
+        fun_l18_n606(x)
+    else
+        fun_l18_n656(x)
+    end
+end
+
+def fun_l17_n788(x)
+    if (x < 1)
+        fun_l18_n254(x)
+    else
+        fun_l18_n544(x)
+    end
+end
+
+def fun_l17_n789(x)
+    if (x < 1)
+        fun_l18_n285(x)
+    else
+        fun_l18_n585(x)
+    end
+end
+
+def fun_l17_n790(x)
+    if (x < 1)
+        fun_l18_n441(x)
+    else
+        fun_l18_n716(x)
+    end
+end
+
+def fun_l17_n791(x)
+    if (x < 1)
+        fun_l18_n415(x)
+    else
+        fun_l18_n126(x)
+    end
+end
+
+def fun_l17_n792(x)
+    if (x < 1)
+        fun_l18_n490(x)
+    else
+        fun_l18_n753(x)
+    end
+end
+
+def fun_l17_n793(x)
+    if (x < 1)
+        fun_l18_n324(x)
+    else
+        fun_l18_n223(x)
+    end
+end
+
+def fun_l17_n794(x)
+    if (x < 1)
+        fun_l18_n913(x)
+    else
+        fun_l18_n94(x)
+    end
+end
+
+def fun_l17_n795(x)
+    if (x < 1)
+        fun_l18_n879(x)
+    else
+        fun_l18_n404(x)
+    end
+end
+
+def fun_l17_n796(x)
+    if (x < 1)
+        fun_l18_n309(x)
+    else
+        fun_l18_n65(x)
+    end
+end
+
+def fun_l17_n797(x)
+    if (x < 1)
+        fun_l18_n712(x)
+    else
+        fun_l18_n947(x)
+    end
+end
+
+def fun_l17_n798(x)
+    if (x < 1)
+        fun_l18_n238(x)
+    else
+        fun_l18_n83(x)
+    end
+end
+
+def fun_l17_n799(x)
+    if (x < 1)
+        fun_l18_n25(x)
+    else
+        fun_l18_n371(x)
+    end
+end
+
+def fun_l17_n800(x)
+    if (x < 1)
+        fun_l18_n501(x)
+    else
+        fun_l18_n386(x)
+    end
+end
+
+def fun_l17_n801(x)
+    if (x < 1)
+        fun_l18_n453(x)
+    else
+        fun_l18_n168(x)
+    end
+end
+
+def fun_l17_n802(x)
+    if (x < 1)
+        fun_l18_n763(x)
+    else
+        fun_l18_n675(x)
+    end
+end
+
+def fun_l17_n803(x)
+    if (x < 1)
+        fun_l18_n984(x)
+    else
+        fun_l18_n882(x)
+    end
+end
+
+def fun_l17_n804(x)
+    if (x < 1)
+        fun_l18_n545(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n805(x)
+    if (x < 1)
+        fun_l18_n263(x)
+    else
+        fun_l18_n143(x)
+    end
+end
+
+def fun_l17_n806(x)
+    if (x < 1)
+        fun_l18_n232(x)
+    else
+        fun_l18_n864(x)
+    end
+end
+
+def fun_l17_n807(x)
+    if (x < 1)
+        fun_l18_n6(x)
+    else
+        fun_l18_n983(x)
+    end
+end
+
+def fun_l17_n808(x)
+    if (x < 1)
+        fun_l18_n17(x)
+    else
+        fun_l18_n426(x)
+    end
+end
+
+def fun_l17_n809(x)
+    if (x < 1)
+        fun_l18_n1(x)
+    else
+        fun_l18_n669(x)
+    end
+end
+
+def fun_l17_n810(x)
+    if (x < 1)
+        fun_l18_n191(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n811(x)
+    if (x < 1)
+        fun_l18_n16(x)
+    else
+        fun_l18_n871(x)
+    end
+end
+
+def fun_l17_n812(x)
+    if (x < 1)
+        fun_l18_n352(x)
+    else
+        fun_l18_n156(x)
+    end
+end
+
+def fun_l17_n813(x)
+    if (x < 1)
+        fun_l18_n239(x)
+    else
+        fun_l18_n314(x)
+    end
+end
+
+def fun_l17_n814(x)
+    if (x < 1)
+        fun_l18_n890(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n815(x)
+    if (x < 1)
+        fun_l18_n894(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n816(x)
+    if (x < 1)
+        fun_l18_n75(x)
+    else
+        fun_l18_n631(x)
+    end
+end
+
+def fun_l17_n817(x)
+    if (x < 1)
+        fun_l18_n118(x)
+    else
+        fun_l18_n857(x)
+    end
+end
+
+def fun_l17_n818(x)
+    if (x < 1)
+        fun_l18_n403(x)
+    else
+        fun_l18_n364(x)
+    end
+end
+
+def fun_l17_n819(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n232(x)
+    end
+end
+
+def fun_l17_n820(x)
+    if (x < 1)
+        fun_l18_n610(x)
+    else
+        fun_l18_n43(x)
+    end
+end
+
+def fun_l17_n821(x)
+    if (x < 1)
+        fun_l18_n949(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n822(x)
+    if (x < 1)
+        fun_l18_n387(x)
+    else
+        fun_l18_n587(x)
+    end
+end
+
+def fun_l17_n823(x)
+    if (x < 1)
+        fun_l18_n99(x)
+    else
+        fun_l18_n653(x)
+    end
+end
+
+def fun_l17_n824(x)
+    if (x < 1)
+        fun_l18_n41(x)
+    else
+        fun_l18_n822(x)
+    end
+end
+
+def fun_l17_n825(x)
+    if (x < 1)
+        fun_l18_n325(x)
+    else
+        fun_l18_n735(x)
+    end
+end
+
+def fun_l17_n826(x)
+    if (x < 1)
+        fun_l18_n415(x)
+    else
+        fun_l18_n684(x)
+    end
+end
+
+def fun_l17_n827(x)
+    if (x < 1)
+        fun_l18_n856(x)
+    else
+        fun_l18_n257(x)
+    end
+end
+
+def fun_l17_n828(x)
+    if (x < 1)
+        fun_l18_n455(x)
+    else
+        fun_l18_n200(x)
+    end
+end
+
+def fun_l17_n829(x)
+    if (x < 1)
+        fun_l18_n486(x)
+    else
+        fun_l18_n528(x)
+    end
+end
+
+def fun_l17_n830(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n619(x)
+    end
+end
+
+def fun_l17_n831(x)
+    if (x < 1)
+        fun_l18_n910(x)
+    else
+        fun_l18_n796(x)
+    end
+end
+
+def fun_l17_n832(x)
+    if (x < 1)
+        fun_l18_n303(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n833(x)
+    if (x < 1)
+        fun_l18_n477(x)
+    else
+        fun_l18_n733(x)
+    end
+end
+
+def fun_l17_n834(x)
+    if (x < 1)
+        fun_l18_n320(x)
+    else
+        fun_l18_n801(x)
+    end
+end
+
+def fun_l17_n835(x)
+    if (x < 1)
+        fun_l18_n672(x)
+    else
+        fun_l18_n183(x)
+    end
+end
+
+def fun_l17_n836(x)
+    if (x < 1)
+        fun_l18_n810(x)
+    else
+        fun_l18_n923(x)
+    end
+end
+
+def fun_l17_n837(x)
+    if (x < 1)
+        fun_l18_n775(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n838(x)
+    if (x < 1)
+        fun_l18_n9(x)
+    else
+        fun_l18_n690(x)
+    end
+end
+
+def fun_l17_n839(x)
+    if (x < 1)
+        fun_l18_n843(x)
+    else
+        fun_l18_n482(x)
+    end
+end
+
+def fun_l17_n840(x)
+    if (x < 1)
+        fun_l18_n527(x)
+    else
+        fun_l18_n331(x)
+    end
+end
+
+def fun_l17_n841(x)
+    if (x < 1)
+        fun_l18_n210(x)
+    else
+        fun_l18_n119(x)
+    end
+end
+
+def fun_l17_n842(x)
+    if (x < 1)
+        fun_l18_n365(x)
+    else
+        fun_l18_n752(x)
+    end
+end
+
+def fun_l17_n843(x)
+    if (x < 1)
+        fun_l18_n855(x)
+    else
+        fun_l18_n149(x)
+    end
+end
+
+def fun_l17_n844(x)
+    if (x < 1)
+        fun_l18_n822(x)
+    else
+        fun_l18_n852(x)
+    end
+end
+
+def fun_l17_n845(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n145(x)
+    end
+end
+
+def fun_l17_n846(x)
+    if (x < 1)
+        fun_l18_n167(x)
+    else
+        fun_l18_n47(x)
+    end
+end
+
+def fun_l17_n847(x)
+    if (x < 1)
+        fun_l18_n350(x)
+    else
+        fun_l18_n894(x)
+    end
+end
+
+def fun_l17_n848(x)
+    if (x < 1)
+        fun_l18_n264(x)
+    else
+        fun_l18_n739(x)
+    end
+end
+
+def fun_l17_n849(x)
+    if (x < 1)
+        fun_l18_n475(x)
+    else
+        fun_l18_n974(x)
+    end
+end
+
+def fun_l17_n850(x)
+    if (x < 1)
+        fun_l18_n849(x)
+    else
+        fun_l18_n68(x)
+    end
+end
+
+def fun_l17_n851(x)
+    if (x < 1)
+        fun_l18_n160(x)
+    else
+        fun_l18_n173(x)
+    end
+end
+
+def fun_l17_n852(x)
+    if (x < 1)
+        fun_l18_n353(x)
+    else
+        fun_l18_n931(x)
+    end
+end
+
+def fun_l17_n853(x)
+    if (x < 1)
+        fun_l18_n706(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n854(x)
+    if (x < 1)
+        fun_l18_n559(x)
+    else
+        fun_l18_n149(x)
+    end
+end
+
+def fun_l17_n855(x)
+    if (x < 1)
+        fun_l18_n347(x)
+    else
+        fun_l18_n559(x)
+    end
+end
+
+def fun_l17_n856(x)
+    if (x < 1)
+        fun_l18_n640(x)
+    else
+        fun_l18_n529(x)
+    end
+end
+
+def fun_l17_n857(x)
+    if (x < 1)
+        fun_l18_n410(x)
+    else
+        fun_l18_n278(x)
+    end
+end
+
+def fun_l17_n858(x)
+    if (x < 1)
+        fun_l18_n15(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n859(x)
+    if (x < 1)
+        fun_l18_n180(x)
+    else
+        fun_l18_n530(x)
+    end
+end
+
+def fun_l17_n860(x)
+    if (x < 1)
+        fun_l18_n739(x)
+    else
+        fun_l18_n817(x)
+    end
+end
+
+def fun_l17_n861(x)
+    if (x < 1)
+        fun_l18_n341(x)
+    else
+        fun_l18_n962(x)
+    end
+end
+
+def fun_l17_n862(x)
+    if (x < 1)
+        fun_l18_n994(x)
+    else
+        fun_l18_n338(x)
+    end
+end
+
+def fun_l17_n863(x)
+    if (x < 1)
+        fun_l18_n428(x)
+    else
+        fun_l18_n608(x)
+    end
+end
+
+def fun_l17_n864(x)
+    if (x < 1)
+        fun_l18_n889(x)
+    else
+        fun_l18_n974(x)
+    end
+end
+
+def fun_l17_n865(x)
+    if (x < 1)
+        fun_l18_n300(x)
+    else
+        fun_l18_n164(x)
+    end
+end
+
+def fun_l17_n866(x)
+    if (x < 1)
+        fun_l18_n195(x)
+    else
+        fun_l18_n75(x)
+    end
+end
+
+def fun_l17_n867(x)
+    if (x < 1)
+        fun_l18_n725(x)
+    else
+        fun_l18_n639(x)
+    end
+end
+
+def fun_l17_n868(x)
+    if (x < 1)
+        fun_l18_n793(x)
+    else
+        fun_l18_n925(x)
+    end
+end
+
+def fun_l17_n869(x)
+    if (x < 1)
+        fun_l18_n845(x)
+    else
+        fun_l18_n174(x)
+    end
+end
+
+def fun_l17_n870(x)
+    if (x < 1)
+        fun_l18_n202(x)
+    else
+        fun_l18_n376(x)
+    end
+end
+
+def fun_l17_n871(x)
+    if (x < 1)
+        fun_l18_n503(x)
+    else
+        fun_l18_n441(x)
+    end
+end
+
+def fun_l17_n872(x)
+    if (x < 1)
+        fun_l18_n675(x)
+    else
+        fun_l18_n180(x)
+    end
+end
+
+def fun_l17_n873(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n874(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n438(x)
+    end
+end
+
+def fun_l17_n875(x)
+    if (x < 1)
+        fun_l18_n269(x)
+    else
+        fun_l18_n539(x)
+    end
+end
+
+def fun_l17_n876(x)
+    if (x < 1)
+        fun_l18_n417(x)
+    else
+        fun_l18_n68(x)
+    end
+end
+
+def fun_l17_n877(x)
+    if (x < 1)
+        fun_l18_n382(x)
+    else
+        fun_l18_n392(x)
+    end
+end
+
+def fun_l17_n878(x)
+    if (x < 1)
+        fun_l18_n981(x)
+    else
+        fun_l18_n997(x)
+    end
+end
+
+def fun_l17_n879(x)
+    if (x < 1)
+        fun_l18_n8(x)
+    else
+        fun_l18_n255(x)
+    end
+end
+
+def fun_l17_n880(x)
+    if (x < 1)
+        fun_l18_n634(x)
+    else
+        fun_l18_n971(x)
+    end
+end
+
+def fun_l17_n881(x)
+    if (x < 1)
+        fun_l18_n940(x)
+    else
+        fun_l18_n410(x)
+    end
+end
+
+def fun_l17_n882(x)
+    if (x < 1)
+        fun_l18_n550(x)
+    else
+        fun_l18_n959(x)
+    end
+end
+
+def fun_l17_n883(x)
+    if (x < 1)
+        fun_l18_n258(x)
+    else
+        fun_l18_n766(x)
+    end
+end
+
+def fun_l17_n884(x)
+    if (x < 1)
+        fun_l18_n841(x)
+    else
+        fun_l18_n387(x)
+    end
+end
+
+def fun_l17_n885(x)
+    if (x < 1)
+        fun_l18_n357(x)
+    else
+        fun_l18_n128(x)
+    end
+end
+
+def fun_l17_n886(x)
+    if (x < 1)
+        fun_l18_n872(x)
+    else
+        fun_l18_n471(x)
+    end
+end
+
+def fun_l17_n887(x)
+    if (x < 1)
+        fun_l18_n596(x)
+    else
+        fun_l18_n639(x)
+    end
+end
+
+def fun_l17_n888(x)
+    if (x < 1)
+        fun_l18_n665(x)
+    else
+        fun_l18_n999(x)
+    end
+end
+
+def fun_l17_n889(x)
+    if (x < 1)
+        fun_l18_n898(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n890(x)
+    if (x < 1)
+        fun_l18_n457(x)
+    else
+        fun_l18_n370(x)
+    end
+end
+
+def fun_l17_n891(x)
+    if (x < 1)
+        fun_l18_n100(x)
+    else
+        fun_l18_n899(x)
+    end
+end
+
+def fun_l17_n892(x)
+    if (x < 1)
+        fun_l18_n785(x)
+    else
+        fun_l18_n552(x)
+    end
+end
+
+def fun_l17_n893(x)
+    if (x < 1)
+        fun_l18_n386(x)
+    else
+        fun_l18_n971(x)
+    end
+end
+
+def fun_l17_n894(x)
+    if (x < 1)
+        fun_l18_n128(x)
+    else
+        fun_l18_n28(x)
+    end
+end
+
+def fun_l17_n895(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n682(x)
+    end
+end
+
+def fun_l17_n896(x)
+    if (x < 1)
+        fun_l18_n470(x)
+    else
+        fun_l18_n477(x)
+    end
+end
+
+def fun_l17_n897(x)
+    if (x < 1)
+        fun_l18_n543(x)
+    else
+        fun_l18_n943(x)
+    end
+end
+
+def fun_l17_n898(x)
+    if (x < 1)
+        fun_l18_n554(x)
+    else
+        fun_l18_n431(x)
+    end
+end
+
+def fun_l17_n899(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n480(x)
+    end
+end
+
+def fun_l17_n900(x)
+    if (x < 1)
+        fun_l18_n557(x)
+    else
+        fun_l18_n831(x)
+    end
+end
+
+def fun_l17_n901(x)
+    if (x < 1)
+        fun_l18_n245(x)
+    else
+        fun_l18_n79(x)
+    end
+end
+
+def fun_l17_n902(x)
+    if (x < 1)
+        fun_l18_n332(x)
+    else
+        fun_l18_n536(x)
+    end
+end
+
+def fun_l17_n903(x)
+    if (x < 1)
+        fun_l18_n531(x)
+    else
+        fun_l18_n933(x)
+    end
+end
+
+def fun_l17_n904(x)
+    if (x < 1)
+        fun_l18_n748(x)
+    else
+        fun_l18_n210(x)
+    end
+end
+
+def fun_l17_n905(x)
+    if (x < 1)
+        fun_l18_n351(x)
+    else
+        fun_l18_n698(x)
+    end
+end
+
+def fun_l17_n906(x)
+    if (x < 1)
+        fun_l18_n112(x)
+    else
+        fun_l18_n397(x)
+    end
+end
+
+def fun_l17_n907(x)
+    if (x < 1)
+        fun_l18_n177(x)
+    else
+        fun_l18_n826(x)
+    end
+end
+
+def fun_l17_n908(x)
+    if (x < 1)
+        fun_l18_n635(x)
+    else
+        fun_l18_n885(x)
+    end
+end
+
+def fun_l17_n909(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n139(x)
+    end
+end
+
+def fun_l17_n910(x)
+    if (x < 1)
+        fun_l18_n30(x)
+    else
+        fun_l18_n113(x)
+    end
+end
+
+def fun_l17_n911(x)
+    if (x < 1)
+        fun_l18_n5(x)
+    else
+        fun_l18_n324(x)
+    end
+end
+
+def fun_l17_n912(x)
+    if (x < 1)
+        fun_l18_n626(x)
+    else
+        fun_l18_n326(x)
+    end
+end
+
+def fun_l17_n913(x)
+    if (x < 1)
+        fun_l18_n478(x)
+    else
+        fun_l18_n373(x)
+    end
+end
+
+def fun_l17_n914(x)
+    if (x < 1)
+        fun_l18_n348(x)
+    else
+        fun_l18_n420(x)
+    end
+end
+
+def fun_l17_n915(x)
+    if (x < 1)
+        fun_l18_n777(x)
+    else
+        fun_l18_n185(x)
+    end
+end
+
+def fun_l17_n916(x)
+    if (x < 1)
+        fun_l18_n18(x)
+    else
+        fun_l18_n286(x)
+    end
+end
+
+def fun_l17_n917(x)
+    if (x < 1)
+        fun_l18_n199(x)
+    else
+        fun_l18_n378(x)
+    end
+end
+
+def fun_l17_n918(x)
+    if (x < 1)
+        fun_l18_n282(x)
+    else
+        fun_l18_n617(x)
+    end
+end
+
+def fun_l17_n919(x)
+    if (x < 1)
+        fun_l18_n634(x)
+    else
+        fun_l18_n396(x)
+    end
+end
+
+def fun_l17_n920(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n479(x)
+    end
+end
+
+def fun_l17_n921(x)
+    if (x < 1)
+        fun_l18_n828(x)
+    else
+        fun_l18_n189(x)
+    end
+end
+
+def fun_l17_n922(x)
+    if (x < 1)
+        fun_l18_n468(x)
+    else
+        fun_l18_n400(x)
+    end
+end
+
+def fun_l17_n923(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n0(x)
+    end
+end
+
+def fun_l17_n924(x)
+    if (x < 1)
+        fun_l18_n796(x)
+    else
+        fun_l18_n357(x)
+    end
+end
+
+def fun_l17_n925(x)
+    if (x < 1)
+        fun_l18_n4(x)
+    else
+        fun_l18_n293(x)
+    end
+end
+
+def fun_l17_n926(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n131(x)
+    end
+end
+
+def fun_l17_n927(x)
+    if (x < 1)
+        fun_l18_n896(x)
+    else
+        fun_l18_n257(x)
+    end
+end
+
+def fun_l17_n928(x)
+    if (x < 1)
+        fun_l18_n596(x)
+    else
+        fun_l18_n115(x)
+    end
+end
+
+def fun_l17_n929(x)
+    if (x < 1)
+        fun_l18_n630(x)
+    else
+        fun_l18_n62(x)
+    end
+end
+
+def fun_l17_n930(x)
+    if (x < 1)
+        fun_l18_n776(x)
+    else
+        fun_l18_n664(x)
+    end
+end
+
+def fun_l17_n931(x)
+    if (x < 1)
+        fun_l18_n424(x)
+    else
+        fun_l18_n298(x)
+    end
+end
+
+def fun_l17_n932(x)
+    if (x < 1)
+        fun_l18_n734(x)
+    else
+        fun_l18_n652(x)
+    end
+end
+
+def fun_l17_n933(x)
+    if (x < 1)
+        fun_l18_n796(x)
+    else
+        fun_l18_n8(x)
+    end
+end
+
+def fun_l17_n934(x)
+    if (x < 1)
+        fun_l18_n783(x)
+    else
+        fun_l18_n177(x)
+    end
+end
+
+def fun_l17_n935(x)
+    if (x < 1)
+        fun_l18_n288(x)
+    else
+        fun_l18_n274(x)
+    end
+end
+
+def fun_l17_n936(x)
+    if (x < 1)
+        fun_l18_n289(x)
+    else
+        fun_l18_n938(x)
+    end
+end
+
+def fun_l17_n937(x)
+    if (x < 1)
+        fun_l18_n815(x)
+    else
+        fun_l18_n924(x)
+    end
+end
+
+def fun_l17_n938(x)
+    if (x < 1)
+        fun_l18_n145(x)
+    else
+        fun_l18_n497(x)
+    end
+end
+
+def fun_l17_n939(x)
+    if (x < 1)
+        fun_l18_n433(x)
+    else
+        fun_l18_n628(x)
+    end
+end
+
+def fun_l17_n940(x)
+    if (x < 1)
+        fun_l18_n410(x)
+    else
+        fun_l18_n461(x)
+    end
+end
+
+def fun_l17_n941(x)
+    if (x < 1)
+        fun_l18_n682(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n942(x)
+    if (x < 1)
+        fun_l18_n948(x)
+    else
+        fun_l18_n29(x)
+    end
+end
+
+def fun_l17_n943(x)
+    if (x < 1)
+        fun_l18_n78(x)
+    else
+        fun_l18_n237(x)
+    end
+end
+
+def fun_l17_n944(x)
+    if (x < 1)
+        fun_l18_n683(x)
+    else
+        fun_l18_n936(x)
+    end
+end
+
+def fun_l17_n945(x)
+    if (x < 1)
+        fun_l18_n339(x)
+    else
+        fun_l18_n471(x)
+    end
+end
+
+def fun_l17_n946(x)
+    if (x < 1)
+        fun_l18_n903(x)
+    else
+        fun_l18_n983(x)
+    end
+end
+
+def fun_l17_n947(x)
+    if (x < 1)
+        fun_l18_n231(x)
+    else
+        fun_l18_n985(x)
+    end
+end
+
+def fun_l17_n948(x)
+    if (x < 1)
+        fun_l18_n379(x)
+    else
+        fun_l18_n385(x)
+    end
+end
+
+def fun_l17_n949(x)
+    if (x < 1)
+        fun_l18_n89(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n950(x)
+    if (x < 1)
+        fun_l18_n851(x)
+    else
+        fun_l18_n563(x)
+    end
+end
+
+def fun_l17_n951(x)
+    if (x < 1)
+        fun_l18_n803(x)
+    else
+        fun_l18_n109(x)
+    end
+end
+
+def fun_l17_n952(x)
+    if (x < 1)
+        fun_l18_n178(x)
+    else
+        fun_l18_n886(x)
+    end
+end
+
+def fun_l17_n953(x)
+    if (x < 1)
+        fun_l18_n705(x)
+    else
+        fun_l18_n340(x)
+    end
+end
+
+def fun_l17_n954(x)
+    if (x < 1)
+        fun_l18_n207(x)
+    else
+        fun_l18_n499(x)
+    end
+end
+
+def fun_l17_n955(x)
+    if (x < 1)
+        fun_l18_n298(x)
+    else
+        fun_l18_n921(x)
+    end
+end
+
+def fun_l17_n956(x)
+    if (x < 1)
+        fun_l18_n291(x)
+    else
+        fun_l18_n768(x)
+    end
+end
+
+def fun_l17_n957(x)
+    if (x < 1)
+        fun_l18_n144(x)
+    else
+        fun_l18_n316(x)
+    end
+end
+
+def fun_l17_n958(x)
+    if (x < 1)
+        fun_l18_n375(x)
+    else
+        fun_l18_n891(x)
+    end
+end
+
+def fun_l17_n959(x)
+    if (x < 1)
+        fun_l18_n989(x)
+    else
+        fun_l18_n773(x)
+    end
+end
+
+def fun_l17_n960(x)
+    if (x < 1)
+        fun_l18_n615(x)
+    else
+        fun_l18_n252(x)
+    end
+end
+
+def fun_l17_n961(x)
+    if (x < 1)
+        fun_l18_n827(x)
+    else
+        fun_l18_n567(x)
+    end
+end
+
+def fun_l17_n962(x)
+    if (x < 1)
+        fun_l18_n792(x)
+    else
+        fun_l18_n81(x)
+    end
+end
+
+def fun_l17_n963(x)
+    if (x < 1)
+        fun_l18_n561(x)
+    else
+        fun_l18_n732(x)
+    end
+end
+
+def fun_l17_n964(x)
+    if (x < 1)
+        fun_l18_n113(x)
+    else
+        fun_l18_n110(x)
+    end
+end
+
+def fun_l17_n965(x)
+    if (x < 1)
+        fun_l18_n321(x)
+    else
+        fun_l18_n557(x)
+    end
+end
+
+def fun_l17_n966(x)
+    if (x < 1)
+        fun_l18_n409(x)
+    else
+        fun_l18_n449(x)
+    end
+end
+
+def fun_l17_n967(x)
+    if (x < 1)
+        fun_l18_n316(x)
+    else
+        fun_l18_n669(x)
+    end
+end
+
+def fun_l17_n968(x)
+    if (x < 1)
+        fun_l18_n190(x)
+    else
+        fun_l18_n450(x)
+    end
+end
+
+def fun_l17_n969(x)
+    if (x < 1)
+        fun_l18_n174(x)
+    else
+        fun_l18_n425(x)
+    end
+end
+
+def fun_l17_n970(x)
+    if (x < 1)
+        fun_l18_n918(x)
+    else
+        fun_l18_n537(x)
+    end
+end
+
+def fun_l17_n971(x)
+    if (x < 1)
+        fun_l18_n923(x)
+    else
+        fun_l18_n998(x)
+    end
+end
+
+def fun_l17_n972(x)
+    if (x < 1)
+        fun_l18_n625(x)
+    else
+        fun_l18_n75(x)
+    end
+end
+
+def fun_l17_n973(x)
+    if (x < 1)
+        fun_l18_n171(x)
+    else
+        fun_l18_n180(x)
+    end
+end
+
+def fun_l17_n974(x)
+    if (x < 1)
+        fun_l18_n430(x)
+    else
+        fun_l18_n659(x)
+    end
+end
+
+def fun_l17_n975(x)
+    if (x < 1)
+        fun_l18_n88(x)
+    else
+        fun_l18_n363(x)
+    end
+end
+
+def fun_l17_n976(x)
+    if (x < 1)
+        fun_l18_n408(x)
+    else
+        fun_l18_n986(x)
+    end
+end
+
+def fun_l17_n977(x)
+    if (x < 1)
+        fun_l18_n988(x)
+    else
+        fun_l18_n818(x)
+    end
+end
+
+def fun_l17_n978(x)
+    if (x < 1)
+        fun_l18_n824(x)
+    else
+        fun_l18_n24(x)
+    end
+end
+
+def fun_l17_n979(x)
+    if (x < 1)
+        fun_l18_n182(x)
+    else
+        fun_l18_n969(x)
+    end
+end
+
+def fun_l17_n980(x)
+    if (x < 1)
+        fun_l18_n187(x)
+    else
+        fun_l18_n615(x)
+    end
+end
+
+def fun_l17_n981(x)
+    if (x < 1)
+        fun_l18_n646(x)
+    else
+        fun_l18_n25(x)
+    end
+end
+
+def fun_l17_n982(x)
+    if (x < 1)
+        fun_l18_n700(x)
+    else
+        fun_l18_n127(x)
+    end
+end
+
+def fun_l17_n983(x)
+    if (x < 1)
+        fun_l18_n153(x)
+    else
+        fun_l18_n831(x)
+    end
+end
+
+def fun_l17_n984(x)
+    if (x < 1)
+        fun_l18_n884(x)
+    else
+        fun_l18_n540(x)
+    end
+end
+
+def fun_l17_n985(x)
+    if (x < 1)
+        fun_l18_n225(x)
+    else
+        fun_l18_n221(x)
+    end
+end
+
+def fun_l17_n986(x)
+    if (x < 1)
+        fun_l18_n431(x)
+    else
+        fun_l18_n884(x)
+    end
+end
+
+def fun_l17_n987(x)
+    if (x < 1)
+        fun_l18_n271(x)
+    else
+        fun_l18_n541(x)
+    end
+end
+
+def fun_l17_n988(x)
+    if (x < 1)
+        fun_l18_n419(x)
+    else
+        fun_l18_n183(x)
+    end
+end
+
+def fun_l17_n989(x)
+    if (x < 1)
+        fun_l18_n85(x)
+    else
+        fun_l18_n51(x)
+    end
+end
+
+def fun_l17_n990(x)
+    if (x < 1)
+        fun_l18_n528(x)
+    else
+        fun_l18_n380(x)
+    end
+end
+
+def fun_l17_n991(x)
+    if (x < 1)
+        fun_l18_n13(x)
+    else
+        fun_l18_n137(x)
+    end
+end
+
+def fun_l17_n992(x)
+    if (x < 1)
+        fun_l18_n655(x)
+    else
+        fun_l18_n344(x)
+    end
+end
+
+def fun_l17_n993(x)
+    if (x < 1)
+        fun_l18_n911(x)
+    else
+        fun_l18_n21(x)
+    end
+end
+
+def fun_l17_n994(x)
+    if (x < 1)
+        fun_l18_n887(x)
+    else
+        fun_l18_n935(x)
+    end
+end
+
+def fun_l17_n995(x)
+    if (x < 1)
+        fun_l18_n206(x)
+    else
+        fun_l18_n374(x)
+    end
+end
+
+def fun_l17_n996(x)
+    if (x < 1)
+        fun_l18_n552(x)
+    else
+        fun_l18_n209(x)
+    end
+end
+
+def fun_l17_n997(x)
+    if (x < 1)
+        fun_l18_n540(x)
+    else
+        fun_l18_n901(x)
+    end
+end
+
+def fun_l17_n998(x)
+    if (x < 1)
+        fun_l18_n547(x)
+    else
+        fun_l18_n304(x)
+    end
+end
+
+def fun_l17_n999(x)
+    if (x < 1)
+        fun_l18_n297(x)
+    else
+        fun_l18_n868(x)
+    end
+end
+
+def fun_l18_n0(x)
+    if (x < 1)
+        fun_l19_n619(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n1(x)
+    if (x < 1)
+        fun_l19_n669(x)
+    else
+        fun_l19_n962(x)
+    end
+end
+
+def fun_l18_n2(x)
+    if (x < 1)
+        fun_l19_n235(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n3(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n4(x)
+    if (x < 1)
+        fun_l19_n812(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n5(x)
+    if (x < 1)
+        fun_l19_n605(x)
+    else
+        fun_l19_n260(x)
+    end
+end
+
+def fun_l18_n6(x)
+    if (x < 1)
+        fun_l19_n146(x)
+    else
+        fun_l19_n617(x)
+    end
+end
+
+def fun_l18_n7(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n31(x)
+    end
+end
+
+def fun_l18_n8(x)
+    if (x < 1)
+        fun_l19_n884(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n9(x)
+    if (x < 1)
+        fun_l19_n741(x)
+    else
+        fun_l19_n704(x)
+    end
+end
+
+def fun_l18_n10(x)
+    if (x < 1)
+        fun_l19_n610(x)
+    else
+        fun_l19_n24(x)
+    end
+end
+
+def fun_l18_n11(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n125(x)
+    end
+end
+
+def fun_l18_n12(x)
+    if (x < 1)
+        fun_l19_n59(x)
+    else
+        fun_l19_n30(x)
+    end
+end
+
+def fun_l18_n13(x)
+    if (x < 1)
+        fun_l19_n255(x)
+    else
+        fun_l19_n18(x)
+    end
+end
+
+def fun_l18_n14(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n15(x)
+    if (x < 1)
+        fun_l19_n557(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n16(x)
+    if (x < 1)
+        fun_l19_n946(x)
+    else
+        fun_l19_n403(x)
+    end
+end
+
+def fun_l18_n17(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n64(x)
+    end
+end
+
+def fun_l18_n18(x)
+    if (x < 1)
+        fun_l19_n531(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n19(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n319(x)
+    end
+end
+
+def fun_l18_n20(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n707(x)
+    end
+end
+
+def fun_l18_n21(x)
+    if (x < 1)
+        fun_l19_n726(x)
+    else
+        fun_l19_n718(x)
+    end
+end
+
+def fun_l18_n22(x)
+    if (x < 1)
+        fun_l19_n169(x)
+    else
+        fun_l19_n117(x)
+    end
+end
+
+def fun_l18_n23(x)
+    if (x < 1)
+        fun_l19_n913(x)
+    else
+        fun_l19_n489(x)
+    end
+end
+
+def fun_l18_n24(x)
+    if (x < 1)
+        fun_l19_n950(x)
+    else
+        fun_l19_n272(x)
+    end
+end
+
+def fun_l18_n25(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n26(x)
+    if (x < 1)
+        fun_l19_n771(x)
+    else
+        fun_l19_n805(x)
+    end
+end
+
+def fun_l18_n27(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n515(x)
+    end
+end
+
+def fun_l18_n28(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n807(x)
+    end
+end
+
+def fun_l18_n29(x)
+    if (x < 1)
+        fun_l19_n957(x)
+    else
+        fun_l19_n555(x)
+    end
+end
+
+def fun_l18_n30(x)
+    if (x < 1)
+        fun_l19_n629(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n31(x)
+    if (x < 1)
+        fun_l19_n791(x)
+    else
+        fun_l19_n340(x)
+    end
+end
+
+def fun_l18_n32(x)
+    if (x < 1)
+        fun_l19_n852(x)
+    else
+        fun_l19_n204(x)
+    end
+end
+
+def fun_l18_n33(x)
+    if (x < 1)
+        fun_l19_n441(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n34(x)
+    if (x < 1)
+        fun_l19_n51(x)
+    else
+        fun_l19_n199(x)
+    end
+end
+
+def fun_l18_n35(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n589(x)
+    end
+end
+
+def fun_l18_n36(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n333(x)
+    end
+end
+
+def fun_l18_n37(x)
+    if (x < 1)
+        fun_l19_n412(x)
+    else
+        fun_l19_n661(x)
+    end
+end
+
+def fun_l18_n38(x)
+    if (x < 1)
+        fun_l19_n427(x)
+    else
+        fun_l19_n401(x)
+    end
+end
+
+def fun_l18_n39(x)
+    if (x < 1)
+        fun_l19_n96(x)
+    else
+        fun_l19_n235(x)
+    end
+end
+
+def fun_l18_n40(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n41(x)
+    if (x < 1)
+        fun_l19_n559(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n42(x)
+    if (x < 1)
+        fun_l19_n802(x)
+    else
+        fun_l19_n217(x)
+    end
+end
+
+def fun_l18_n43(x)
+    if (x < 1)
+        fun_l19_n693(x)
+    else
+        fun_l19_n178(x)
+    end
+end
+
+def fun_l18_n44(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n425(x)
+    end
+end
+
+def fun_l18_n45(x)
+    if (x < 1)
+        fun_l19_n242(x)
+    else
+        fun_l19_n949(x)
+    end
+end
+
+def fun_l18_n46(x)
+    if (x < 1)
+        fun_l19_n418(x)
+    else
+        fun_l19_n462(x)
+    end
+end
+
+def fun_l18_n47(x)
+    if (x < 1)
+        fun_l19_n56(x)
+    else
+        fun_l19_n79(x)
+    end
+end
+
+def fun_l18_n48(x)
+    if (x < 1)
+        fun_l19_n5(x)
+    else
+        fun_l19_n939(x)
+    end
+end
+
+def fun_l18_n49(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n262(x)
+    end
+end
+
+def fun_l18_n50(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n51(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n489(x)
+    end
+end
+
+def fun_l18_n52(x)
+    if (x < 1)
+        fun_l19_n965(x)
+    else
+        fun_l19_n198(x)
+    end
+end
+
+def fun_l18_n53(x)
+    if (x < 1)
+        fun_l19_n349(x)
+    else
+        fun_l19_n603(x)
+    end
+end
+
+def fun_l18_n54(x)
+    if (x < 1)
+        fun_l19_n893(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n55(x)
+    if (x < 1)
+        fun_l19_n816(x)
+    else
+        fun_l19_n922(x)
+    end
+end
+
+def fun_l18_n56(x)
+    if (x < 1)
+        fun_l19_n10(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n57(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n446(x)
+    end
+end
+
+def fun_l18_n58(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n636(x)
+    end
+end
+
+def fun_l18_n59(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n604(x)
+    end
+end
+
+def fun_l18_n60(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n657(x)
+    end
+end
+
+def fun_l18_n61(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n516(x)
+    end
+end
+
+def fun_l18_n62(x)
+    if (x < 1)
+        fun_l19_n167(x)
+    else
+        fun_l19_n770(x)
+    end
+end
+
+def fun_l18_n63(x)
+    if (x < 1)
+        fun_l19_n572(x)
+    else
+        fun_l19_n224(x)
+    end
+end
+
+def fun_l18_n64(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n64(x)
+    end
+end
+
+def fun_l18_n65(x)
+    if (x < 1)
+        fun_l19_n200(x)
+    else
+        fun_l19_n724(x)
+    end
+end
+
+def fun_l18_n66(x)
+    if (x < 1)
+        fun_l19_n295(x)
+    else
+        fun_l19_n127(x)
+    end
+end
+
+def fun_l18_n67(x)
+    if (x < 1)
+        fun_l19_n81(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n68(x)
+    if (x < 1)
+        fun_l19_n573(x)
+    else
+        fun_l19_n473(x)
+    end
+end
+
+def fun_l18_n69(x)
+    if (x < 1)
+        fun_l19_n475(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n70(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n74(x)
+    end
+end
+
+def fun_l18_n71(x)
+    if (x < 1)
+        fun_l19_n270(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n72(x)
+    if (x < 1)
+        fun_l19_n809(x)
+    else
+        fun_l19_n857(x)
+    end
+end
+
+def fun_l18_n73(x)
+    if (x < 1)
+        fun_l19_n329(x)
+    else
+        fun_l19_n850(x)
+    end
+end
+
+def fun_l18_n74(x)
+    if (x < 1)
+        fun_l19_n471(x)
+    else
+        fun_l19_n127(x)
+    end
+end
+
+def fun_l18_n75(x)
+    if (x < 1)
+        fun_l19_n558(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n76(x)
+    if (x < 1)
+        fun_l19_n648(x)
+    else
+        fun_l19_n687(x)
+    end
+end
+
+def fun_l18_n77(x)
+    if (x < 1)
+        fun_l19_n690(x)
+    else
+        fun_l19_n612(x)
+    end
+end
+
+def fun_l18_n78(x)
+    if (x < 1)
+        fun_l19_n122(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n79(x)
+    if (x < 1)
+        fun_l19_n375(x)
+    else
+        fun_l19_n56(x)
+    end
+end
+
+def fun_l18_n80(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n81(x)
+    if (x < 1)
+        fun_l19_n588(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n82(x)
+    if (x < 1)
+        fun_l19_n144(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n83(x)
+    if (x < 1)
+        fun_l19_n468(x)
+    else
+        fun_l19_n951(x)
+    end
+end
+
+def fun_l18_n84(x)
+    if (x < 1)
+        fun_l19_n380(x)
+    else
+        fun_l19_n597(x)
+    end
+end
+
+def fun_l18_n85(x)
+    if (x < 1)
+        fun_l19_n651(x)
+    else
+        fun_l19_n756(x)
+    end
+end
+
+def fun_l18_n86(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n87(x)
+    if (x < 1)
+        fun_l19_n851(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n88(x)
+    if (x < 1)
+        fun_l19_n808(x)
+    else
+        fun_l19_n102(x)
+    end
+end
+
+def fun_l18_n89(x)
+    if (x < 1)
+        fun_l19_n768(x)
+    else
+        fun_l19_n885(x)
+    end
+end
+
+def fun_l18_n90(x)
+    if (x < 1)
+        fun_l19_n933(x)
+    else
+        fun_l19_n284(x)
+    end
+end
+
+def fun_l18_n91(x)
+    if (x < 1)
+        fun_l19_n234(x)
+    else
+        fun_l19_n927(x)
+    end
+end
+
+def fun_l18_n92(x)
+    if (x < 1)
+        fun_l19_n901(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n93(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n692(x)
+    end
+end
+
+def fun_l18_n94(x)
+    if (x < 1)
+        fun_l19_n572(x)
+    else
+        fun_l19_n795(x)
+    end
+end
+
+def fun_l18_n95(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n96(x)
+    if (x < 1)
+        fun_l19_n794(x)
+    else
+        fun_l19_n611(x)
+    end
+end
+
+def fun_l18_n97(x)
+    if (x < 1)
+        fun_l19_n752(x)
+    else
+        fun_l19_n548(x)
+    end
+end
+
+def fun_l18_n98(x)
+    if (x < 1)
+        fun_l19_n710(x)
+    else
+        fun_l19_n685(x)
+    end
+end
+
+def fun_l18_n99(x)
+    if (x < 1)
+        fun_l19_n711(x)
+    else
+        fun_l19_n307(x)
+    end
+end
+
+def fun_l18_n100(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n355(x)
+    end
+end
+
+def fun_l18_n101(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n924(x)
+    end
+end
+
+def fun_l18_n102(x)
+    if (x < 1)
+        fun_l19_n79(x)
+    else
+        fun_l19_n87(x)
+    end
+end
+
+def fun_l18_n103(x)
+    if (x < 1)
+        fun_l19_n27(x)
+    else
+        fun_l19_n914(x)
+    end
+end
+
+def fun_l18_n104(x)
+    if (x < 1)
+        fun_l19_n327(x)
+    else
+        fun_l19_n136(x)
+    end
+end
+
+def fun_l18_n105(x)
+    if (x < 1)
+        fun_l19_n42(x)
+    else
+        fun_l19_n289(x)
+    end
+end
+
+def fun_l18_n106(x)
+    if (x < 1)
+        fun_l19_n371(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n107(x)
+    if (x < 1)
+        fun_l19_n579(x)
+    else
+        fun_l19_n500(x)
+    end
+end
+
+def fun_l18_n108(x)
+    if (x < 1)
+        fun_l19_n351(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n109(x)
+    if (x < 1)
+        fun_l19_n831(x)
+    else
+        fun_l19_n310(x)
+    end
+end
+
+def fun_l18_n110(x)
+    if (x < 1)
+        fun_l19_n618(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n111(x)
+    if (x < 1)
+        fun_l19_n147(x)
+    else
+        fun_l19_n324(x)
+    end
+end
+
+def fun_l18_n112(x)
+    if (x < 1)
+        fun_l19_n97(x)
+    else
+        fun_l19_n901(x)
+    end
+end
+
+def fun_l18_n113(x)
+    if (x < 1)
+        fun_l19_n223(x)
+    else
+        fun_l19_n819(x)
+    end
+end
+
+def fun_l18_n114(x)
+    if (x < 1)
+        fun_l19_n929(x)
+    else
+        fun_l19_n143(x)
+    end
+end
+
+def fun_l18_n115(x)
+    if (x < 1)
+        fun_l19_n697(x)
+    else
+        fun_l19_n934(x)
+    end
+end
+
+def fun_l18_n116(x)
+    if (x < 1)
+        fun_l19_n143(x)
+    else
+        fun_l19_n815(x)
+    end
+end
+
+def fun_l18_n117(x)
+    if (x < 1)
+        fun_l19_n889(x)
+    else
+        fun_l19_n859(x)
+    end
+end
+
+def fun_l18_n118(x)
+    if (x < 1)
+        fun_l19_n233(x)
+    else
+        fun_l19_n6(x)
+    end
+end
+
+def fun_l18_n119(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n783(x)
+    end
+end
+
+def fun_l18_n120(x)
+    if (x < 1)
+        fun_l19_n930(x)
+    else
+        fun_l19_n376(x)
+    end
+end
+
+def fun_l18_n121(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n882(x)
+    end
+end
+
+def fun_l18_n122(x)
+    if (x < 1)
+        fun_l19_n532(x)
+    else
+        fun_l19_n294(x)
+    end
+end
+
+def fun_l18_n123(x)
+    if (x < 1)
+        fun_l19_n20(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n124(x)
+    if (x < 1)
+        fun_l19_n301(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n125(x)
+    if (x < 1)
+        fun_l19_n424(x)
+    else
+        fun_l19_n524(x)
+    end
+end
+
+def fun_l18_n126(x)
+    if (x < 1)
+        fun_l19_n12(x)
+    else
+        fun_l19_n537(x)
+    end
+end
+
+def fun_l18_n127(x)
+    if (x < 1)
+        fun_l19_n548(x)
+    else
+        fun_l19_n850(x)
+    end
+end
+
+def fun_l18_n128(x)
+    if (x < 1)
+        fun_l19_n463(x)
+    else
+        fun_l19_n714(x)
+    end
+end
+
+def fun_l18_n129(x)
+    if (x < 1)
+        fun_l19_n438(x)
+    else
+        fun_l19_n667(x)
+    end
+end
+
+def fun_l18_n130(x)
+    if (x < 1)
+        fun_l19_n481(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n131(x)
+    if (x < 1)
+        fun_l19_n84(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n132(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n740(x)
+    end
+end
+
+def fun_l18_n133(x)
+    if (x < 1)
+        fun_l19_n807(x)
+    else
+        fun_l19_n595(x)
+    end
+end
+
+def fun_l18_n134(x)
+    if (x < 1)
+        fun_l19_n716(x)
+    else
+        fun_l19_n440(x)
+    end
+end
+
+def fun_l18_n135(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n136(x)
+    if (x < 1)
+        fun_l19_n683(x)
+    else
+        fun_l19_n344(x)
+    end
+end
+
+def fun_l18_n137(x)
+    if (x < 1)
+        fun_l19_n228(x)
+    else
+        fun_l19_n186(x)
+    end
+end
+
+def fun_l18_n138(x)
+    if (x < 1)
+        fun_l19_n666(x)
+    else
+        fun_l19_n66(x)
+    end
+end
+
+def fun_l18_n139(x)
+    if (x < 1)
+        fun_l19_n416(x)
+    else
+        fun_l19_n398(x)
+    end
+end
+
+def fun_l18_n140(x)
+    if (x < 1)
+        fun_l19_n766(x)
+    else
+        fun_l19_n534(x)
+    end
+end
+
+def fun_l18_n141(x)
+    if (x < 1)
+        fun_l19_n370(x)
+    else
+        fun_l19_n653(x)
+    end
+end
+
+def fun_l18_n142(x)
+    if (x < 1)
+        fun_l19_n953(x)
+    else
+        fun_l19_n917(x)
+    end
+end
+
+def fun_l18_n143(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n862(x)
+    end
+end
+
+def fun_l18_n144(x)
+    if (x < 1)
+        fun_l19_n969(x)
+    else
+        fun_l19_n243(x)
+    end
+end
+
+def fun_l18_n145(x)
+    if (x < 1)
+        fun_l19_n379(x)
+    else
+        fun_l19_n315(x)
+    end
+end
+
+def fun_l18_n146(x)
+    if (x < 1)
+        fun_l19_n360(x)
+    else
+        fun_l19_n585(x)
+    end
+end
+
+def fun_l18_n147(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n372(x)
+    end
+end
+
+def fun_l18_n148(x)
+    if (x < 1)
+        fun_l19_n395(x)
+    else
+        fun_l19_n817(x)
+    end
+end
+
+def fun_l18_n149(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n506(x)
+    end
+end
+
+def fun_l18_n150(x)
+    if (x < 1)
+        fun_l19_n940(x)
+    else
+        fun_l19_n380(x)
+    end
+end
+
+def fun_l18_n151(x)
+    if (x < 1)
+        fun_l19_n190(x)
+    else
+        fun_l19_n925(x)
+    end
+end
+
+def fun_l18_n152(x)
+    if (x < 1)
+        fun_l19_n810(x)
+    else
+        fun_l19_n958(x)
+    end
+end
+
+def fun_l18_n153(x)
+    if (x < 1)
+        fun_l19_n69(x)
+    else
+        fun_l19_n19(x)
+    end
+end
+
+def fun_l18_n154(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n155(x)
+    if (x < 1)
+        fun_l19_n179(x)
+    else
+        fun_l19_n583(x)
+    end
+end
+
+def fun_l18_n156(x)
+    if (x < 1)
+        fun_l19_n583(x)
+    else
+        fun_l19_n374(x)
+    end
+end
+
+def fun_l18_n157(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n158(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n715(x)
+    end
+end
+
+def fun_l18_n159(x)
+    if (x < 1)
+        fun_l19_n742(x)
+    else
+        fun_l19_n733(x)
+    end
+end
+
+def fun_l18_n160(x)
+    if (x < 1)
+        fun_l19_n994(x)
+    else
+        fun_l19_n434(x)
+    end
+end
+
+def fun_l18_n161(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n994(x)
+    end
+end
+
+def fun_l18_n162(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n632(x)
+    end
+end
+
+def fun_l18_n163(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n369(x)
+    end
+end
+
+def fun_l18_n164(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n276(x)
+    end
+end
+
+def fun_l18_n165(x)
+    if (x < 1)
+        fun_l19_n173(x)
+    else
+        fun_l19_n93(x)
+    end
+end
+
+def fun_l18_n166(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n568(x)
+    end
+end
+
+def fun_l18_n167(x)
+    if (x < 1)
+        fun_l19_n61(x)
+    else
+        fun_l19_n79(x)
+    end
+end
+
+def fun_l18_n168(x)
+    if (x < 1)
+        fun_l19_n683(x)
+    else
+        fun_l19_n958(x)
+    end
+end
+
+def fun_l18_n169(x)
+    if (x < 1)
+        fun_l19_n419(x)
+    else
+        fun_l19_n648(x)
+    end
+end
+
+def fun_l18_n170(x)
+    if (x < 1)
+        fun_l19_n152(x)
+    else
+        fun_l19_n746(x)
+    end
+end
+
+def fun_l18_n171(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n974(x)
+    end
+end
+
+def fun_l18_n172(x)
+    if (x < 1)
+        fun_l19_n142(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n173(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n911(x)
+    end
+end
+
+def fun_l18_n174(x)
+    if (x < 1)
+        fun_l19_n256(x)
+    else
+        fun_l19_n414(x)
+    end
+end
+
+def fun_l18_n175(x)
+    if (x < 1)
+        fun_l19_n207(x)
+    else
+        fun_l19_n80(x)
+    end
+end
+
+def fun_l18_n176(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n22(x)
+    end
+end
+
+def fun_l18_n177(x)
+    if (x < 1)
+        fun_l19_n457(x)
+    else
+        fun_l19_n723(x)
+    end
+end
+
+def fun_l18_n178(x)
+    if (x < 1)
+        fun_l19_n36(x)
+    else
+        fun_l19_n44(x)
+    end
+end
+
+def fun_l18_n179(x)
+    if (x < 1)
+        fun_l19_n92(x)
+    else
+        fun_l19_n75(x)
+    end
+end
+
+def fun_l18_n180(x)
+    if (x < 1)
+        fun_l19_n878(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n181(x)
+    if (x < 1)
+        fun_l19_n499(x)
+    else
+        fun_l19_n462(x)
+    end
+end
+
+def fun_l18_n182(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n91(x)
+    end
+end
+
+def fun_l18_n183(x)
+    if (x < 1)
+        fun_l19_n549(x)
+    else
+        fun_l19_n126(x)
+    end
+end
+
+def fun_l18_n184(x)
+    if (x < 1)
+        fun_l19_n484(x)
+    else
+        fun_l19_n45(x)
+    end
+end
+
+def fun_l18_n185(x)
+    if (x < 1)
+        fun_l19_n237(x)
+    else
+        fun_l19_n651(x)
+    end
+end
+
+def fun_l18_n186(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n466(x)
+    end
+end
+
+def fun_l18_n187(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n188(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n251(x)
+    end
+end
+
+def fun_l18_n189(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n190(x)
+    if (x < 1)
+        fun_l19_n516(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n191(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n192(x)
+    if (x < 1)
+        fun_l19_n820(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n193(x)
+    if (x < 1)
+        fun_l19_n514(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n194(x)
+    if (x < 1)
+        fun_l19_n744(x)
+    else
+        fun_l19_n605(x)
+    end
+end
+
+def fun_l18_n195(x)
+    if (x < 1)
+        fun_l19_n428(x)
+    else
+        fun_l19_n528(x)
+    end
+end
+
+def fun_l18_n196(x)
+    if (x < 1)
+        fun_l19_n291(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n197(x)
+    if (x < 1)
+        fun_l19_n238(x)
+    else
+        fun_l19_n38(x)
+    end
+end
+
+def fun_l18_n198(x)
+    if (x < 1)
+        fun_l19_n332(x)
+    else
+        fun_l19_n112(x)
+    end
+end
+
+def fun_l18_n199(x)
+    if (x < 1)
+        fun_l19_n703(x)
+    else
+        fun_l19_n108(x)
+    end
+end
+
+def fun_l18_n200(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n201(x)
+    if (x < 1)
+        fun_l19_n402(x)
+    else
+        fun_l19_n223(x)
+    end
+end
+
+def fun_l18_n202(x)
+    if (x < 1)
+        fun_l19_n9(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n203(x)
+    if (x < 1)
+        fun_l19_n560(x)
+    else
+        fun_l19_n77(x)
+    end
+end
+
+def fun_l18_n204(x)
+    if (x < 1)
+        fun_l19_n379(x)
+    else
+        fun_l19_n903(x)
+    end
+end
+
+def fun_l18_n205(x)
+    if (x < 1)
+        fun_l19_n185(x)
+    else
+        fun_l19_n174(x)
+    end
+end
+
+def fun_l18_n206(x)
+    if (x < 1)
+        fun_l19_n738(x)
+    else
+        fun_l19_n518(x)
+    end
+end
+
+def fun_l18_n207(x)
+    if (x < 1)
+        fun_l19_n343(x)
+    else
+        fun_l19_n567(x)
+    end
+end
+
+def fun_l18_n208(x)
+    if (x < 1)
+        fun_l19_n546(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n209(x)
+    if (x < 1)
+        fun_l19_n589(x)
+    else
+        fun_l19_n511(x)
+    end
+end
+
+def fun_l18_n210(x)
+    if (x < 1)
+        fun_l19_n507(x)
+    else
+        fun_l19_n912(x)
+    end
+end
+
+def fun_l18_n211(x)
+    if (x < 1)
+        fun_l19_n779(x)
+    else
+        fun_l19_n133(x)
+    end
+end
+
+def fun_l18_n212(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n345(x)
+    end
+end
+
+def fun_l18_n213(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n214(x)
+    if (x < 1)
+        fun_l19_n829(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n215(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n80(x)
+    end
+end
+
+def fun_l18_n216(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n836(x)
+    end
+end
+
+def fun_l18_n217(x)
+    if (x < 1)
+        fun_l19_n861(x)
+    else
+        fun_l19_n801(x)
+    end
+end
+
+def fun_l18_n218(x)
+    if (x < 1)
+        fun_l19_n316(x)
+    else
+        fun_l19_n263(x)
+    end
+end
+
+def fun_l18_n219(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n315(x)
+    end
+end
+
+def fun_l18_n220(x)
+    if (x < 1)
+        fun_l19_n700(x)
+    else
+        fun_l19_n276(x)
+    end
+end
+
+def fun_l18_n221(x)
+    if (x < 1)
+        fun_l19_n654(x)
+    else
+        fun_l19_n32(x)
+    end
+end
+
+def fun_l18_n222(x)
+    if (x < 1)
+        fun_l19_n758(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n223(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n224(x)
+    if (x < 1)
+        fun_l19_n31(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n225(x)
+    if (x < 1)
+        fun_l19_n704(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n226(x)
+    if (x < 1)
+        fun_l19_n635(x)
+    else
+        fun_l19_n411(x)
+    end
+end
+
+def fun_l18_n227(x)
+    if (x < 1)
+        fun_l19_n368(x)
+    else
+        fun_l19_n472(x)
+    end
+end
+
+def fun_l18_n228(x)
+    if (x < 1)
+        fun_l19_n928(x)
+    else
+        fun_l19_n357(x)
+    end
+end
+
+def fun_l18_n229(x)
+    if (x < 1)
+        fun_l19_n503(x)
+    else
+        fun_l19_n495(x)
+    end
+end
+
+def fun_l18_n230(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n73(x)
+    end
+end
+
+def fun_l18_n231(x)
+    if (x < 1)
+        fun_l19_n718(x)
+    else
+        fun_l19_n971(x)
+    end
+end
+
+def fun_l18_n232(x)
+    if (x < 1)
+        fun_l19_n314(x)
+    else
+        fun_l19_n100(x)
+    end
+end
+
+def fun_l18_n233(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n234(x)
+    if (x < 1)
+        fun_l19_n309(x)
+    else
+        fun_l19_n806(x)
+    end
+end
+
+def fun_l18_n235(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n388(x)
+    end
+end
+
+def fun_l18_n236(x)
+    if (x < 1)
+        fun_l19_n158(x)
+    else
+        fun_l19_n438(x)
+    end
+end
+
+def fun_l18_n237(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n728(x)
+    end
+end
+
+def fun_l18_n238(x)
+    if (x < 1)
+        fun_l19_n238(x)
+    else
+        fun_l19_n41(x)
+    end
+end
+
+def fun_l18_n239(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n756(x)
+    end
+end
+
+def fun_l18_n240(x)
+    if (x < 1)
+        fun_l19_n873(x)
+    else
+        fun_l19_n274(x)
+    end
+end
+
+def fun_l18_n241(x)
+    if (x < 1)
+        fun_l19_n273(x)
+    else
+        fun_l19_n740(x)
+    end
+end
+
+def fun_l18_n242(x)
+    if (x < 1)
+        fun_l19_n256(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n243(x)
+    if (x < 1)
+        fun_l19_n482(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n244(x)
+    if (x < 1)
+        fun_l19_n598(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n245(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n164(x)
+    end
+end
+
+def fun_l18_n246(x)
+    if (x < 1)
+        fun_l19_n803(x)
+    else
+        fun_l19_n240(x)
+    end
+end
+
+def fun_l18_n247(x)
+    if (x < 1)
+        fun_l19_n790(x)
+    else
+        fun_l19_n55(x)
+    end
+end
+
+def fun_l18_n248(x)
+    if (x < 1)
+        fun_l19_n193(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n249(x)
+    if (x < 1)
+        fun_l19_n122(x)
+    else
+        fun_l19_n841(x)
+    end
+end
+
+def fun_l18_n250(x)
+    if (x < 1)
+        fun_l19_n724(x)
+    else
+        fun_l19_n359(x)
+    end
+end
+
+def fun_l18_n251(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n777(x)
+    end
+end
+
+def fun_l18_n252(x)
+    if (x < 1)
+        fun_l19_n986(x)
+    else
+        fun_l19_n666(x)
+    end
+end
+
+def fun_l18_n253(x)
+    if (x < 1)
+        fun_l19_n864(x)
+    else
+        fun_l19_n320(x)
+    end
+end
+
+def fun_l18_n254(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n582(x)
+    end
+end
+
+def fun_l18_n255(x)
+    if (x < 1)
+        fun_l19_n434(x)
+    else
+        fun_l19_n224(x)
+    end
+end
+
+def fun_l18_n256(x)
+    if (x < 1)
+        fun_l19_n921(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n257(x)
+    if (x < 1)
+        fun_l19_n789(x)
+    else
+        fun_l19_n546(x)
+    end
+end
+
+def fun_l18_n258(x)
+    if (x < 1)
+        fun_l19_n324(x)
+    else
+        fun_l19_n987(x)
+    end
+end
+
+def fun_l18_n259(x)
+    if (x < 1)
+        fun_l19_n279(x)
+    else
+        fun_l19_n180(x)
+    end
+end
+
+def fun_l18_n260(x)
+    if (x < 1)
+        fun_l19_n596(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n261(x)
+    if (x < 1)
+        fun_l19_n940(x)
+    else
+        fun_l19_n982(x)
+    end
+end
+
+def fun_l18_n262(x)
+    if (x < 1)
+        fun_l19_n54(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n263(x)
+    if (x < 1)
+        fun_l19_n815(x)
+    else
+        fun_l19_n663(x)
+    end
+end
+
+def fun_l18_n264(x)
+    if (x < 1)
+        fun_l19_n794(x)
+    else
+        fun_l19_n251(x)
+    end
+end
+
+def fun_l18_n265(x)
+    if (x < 1)
+        fun_l19_n485(x)
+    else
+        fun_l19_n896(x)
+    end
+end
+
+def fun_l18_n266(x)
+    if (x < 1)
+        fun_l19_n346(x)
+    else
+        fun_l19_n151(x)
+    end
+end
+
+def fun_l18_n267(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n395(x)
+    end
+end
+
+def fun_l18_n268(x)
+    if (x < 1)
+        fun_l19_n76(x)
+    else
+        fun_l19_n25(x)
+    end
+end
+
+def fun_l18_n269(x)
+    if (x < 1)
+        fun_l19_n943(x)
+    else
+        fun_l19_n587(x)
+    end
+end
+
+def fun_l18_n270(x)
+    if (x < 1)
+        fun_l19_n663(x)
+    else
+        fun_l19_n255(x)
+    end
+end
+
+def fun_l18_n271(x)
+    if (x < 1)
+        fun_l19_n307(x)
+    else
+        fun_l19_n261(x)
+    end
+end
+
+def fun_l18_n272(x)
+    if (x < 1)
+        fun_l19_n478(x)
+    else
+        fun_l19_n600(x)
+    end
+end
+
+def fun_l18_n273(x)
+    if (x < 1)
+        fun_l19_n345(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n274(x)
+    if (x < 1)
+        fun_l19_n637(x)
+    else
+        fun_l19_n27(x)
+    end
+end
+
+def fun_l18_n275(x)
+    if (x < 1)
+        fun_l19_n752(x)
+    else
+        fun_l19_n946(x)
+    end
+end
+
+def fun_l18_n276(x)
+    if (x < 1)
+        fun_l19_n571(x)
+    else
+        fun_l19_n973(x)
+    end
+end
+
+def fun_l18_n277(x)
+    if (x < 1)
+        fun_l19_n274(x)
+    else
+        fun_l19_n673(x)
+    end
+end
+
+def fun_l18_n278(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n279(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n280(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n531(x)
+    end
+end
+
+def fun_l18_n281(x)
+    if (x < 1)
+        fun_l19_n295(x)
+    else
+        fun_l19_n961(x)
+    end
+end
+
+def fun_l18_n282(x)
+    if (x < 1)
+        fun_l19_n902(x)
+    else
+        fun_l19_n364(x)
+    end
+end
+
+def fun_l18_n283(x)
+    if (x < 1)
+        fun_l19_n147(x)
+    else
+        fun_l19_n709(x)
+    end
+end
+
+def fun_l18_n284(x)
+    if (x < 1)
+        fun_l19_n394(x)
+    else
+        fun_l19_n757(x)
+    end
+end
+
+def fun_l18_n285(x)
+    if (x < 1)
+        fun_l19_n372(x)
+    else
+        fun_l19_n45(x)
+    end
+end
+
+def fun_l18_n286(x)
+    if (x < 1)
+        fun_l19_n323(x)
+    else
+        fun_l19_n128(x)
+    end
+end
+
+def fun_l18_n287(x)
+    if (x < 1)
+        fun_l19_n50(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n288(x)
+    if (x < 1)
+        fun_l19_n300(x)
+    else
+        fun_l19_n308(x)
+    end
+end
+
+def fun_l18_n289(x)
+    if (x < 1)
+        fun_l19_n2(x)
+    else
+        fun_l19_n27(x)
+    end
+end
+
+def fun_l18_n290(x)
+    if (x < 1)
+        fun_l19_n341(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n291(x)
+    if (x < 1)
+        fun_l19_n797(x)
+    else
+        fun_l19_n575(x)
+    end
+end
+
+def fun_l18_n292(x)
+    if (x < 1)
+        fun_l19_n740(x)
+    else
+        fun_l19_n772(x)
+    end
+end
+
+def fun_l18_n293(x)
+    if (x < 1)
+        fun_l19_n707(x)
+    else
+        fun_l19_n456(x)
+    end
+end
+
+def fun_l18_n294(x)
+    if (x < 1)
+        fun_l19_n714(x)
+    else
+        fun_l19_n601(x)
+    end
+end
+
+def fun_l18_n295(x)
+    if (x < 1)
+        fun_l19_n298(x)
+    else
+        fun_l19_n367(x)
+    end
+end
+
+def fun_l18_n296(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n297(x)
+    if (x < 1)
+        fun_l19_n703(x)
+    else
+        fun_l19_n673(x)
+    end
+end
+
+def fun_l18_n298(x)
+    if (x < 1)
+        fun_l19_n890(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n299(x)
+    if (x < 1)
+        fun_l19_n152(x)
+    else
+        fun_l19_n784(x)
+    end
+end
+
+def fun_l18_n300(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n301(x)
+    if (x < 1)
+        fun_l19_n161(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n302(x)
+    if (x < 1)
+        fun_l19_n695(x)
+    else
+        fun_l19_n604(x)
+    end
+end
+
+def fun_l18_n303(x)
+    if (x < 1)
+        fun_l19_n415(x)
+    else
+        fun_l19_n752(x)
+    end
+end
+
+def fun_l18_n304(x)
+    if (x < 1)
+        fun_l19_n737(x)
+    else
+        fun_l19_n944(x)
+    end
+end
+
+def fun_l18_n305(x)
+    if (x < 1)
+        fun_l19_n833(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n306(x)
+    if (x < 1)
+        fun_l19_n598(x)
+    else
+        fun_l19_n601(x)
+    end
+end
+
+def fun_l18_n307(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n116(x)
+    end
+end
+
+def fun_l18_n308(x)
+    if (x < 1)
+        fun_l19_n892(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n309(x)
+    if (x < 1)
+        fun_l19_n926(x)
+    else
+        fun_l19_n119(x)
+    end
+end
+
+def fun_l18_n310(x)
+    if (x < 1)
+        fun_l19_n194(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n311(x)
+    if (x < 1)
+        fun_l19_n490(x)
+    else
+        fun_l19_n401(x)
+    end
+end
+
+def fun_l18_n312(x)
+    if (x < 1)
+        fun_l19_n727(x)
+    else
+        fun_l19_n193(x)
+    end
+end
+
+def fun_l18_n313(x)
+    if (x < 1)
+        fun_l19_n643(x)
+    else
+        fun_l19_n327(x)
+    end
+end
+
+def fun_l18_n314(x)
+    if (x < 1)
+        fun_l19_n747(x)
+    else
+        fun_l19_n938(x)
+    end
+end
+
+def fun_l18_n315(x)
+    if (x < 1)
+        fun_l19_n153(x)
+    else
+        fun_l19_n438(x)
+    end
+end
+
+def fun_l18_n316(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n471(x)
+    end
+end
+
+def fun_l18_n317(x)
+    if (x < 1)
+        fun_l19_n105(x)
+    else
+        fun_l19_n832(x)
+    end
+end
+
+def fun_l18_n318(x)
+    if (x < 1)
+        fun_l19_n652(x)
+    else
+        fun_l19_n826(x)
+    end
+end
+
+def fun_l18_n319(x)
+    if (x < 1)
+        fun_l19_n3(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n320(x)
+    if (x < 1)
+        fun_l19_n854(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n321(x)
+    if (x < 1)
+        fun_l19_n241(x)
+    else
+        fun_l19_n51(x)
+    end
+end
+
+def fun_l18_n322(x)
+    if (x < 1)
+        fun_l19_n832(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n323(x)
+    if (x < 1)
+        fun_l19_n472(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n324(x)
+    if (x < 1)
+        fun_l19_n844(x)
+    else
+        fun_l19_n228(x)
+    end
+end
+
+def fun_l18_n325(x)
+    if (x < 1)
+        fun_l19_n132(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n326(x)
+    if (x < 1)
+        fun_l19_n311(x)
+    else
+        fun_l19_n388(x)
+    end
+end
+
+def fun_l18_n327(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n328(x)
+    if (x < 1)
+        fun_l19_n342(x)
+    else
+        fun_l19_n743(x)
+    end
+end
+
+def fun_l18_n329(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n762(x)
+    end
+end
+
+def fun_l18_n330(x)
+    if (x < 1)
+        fun_l19_n358(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n331(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n35(x)
+    end
+end
+
+def fun_l18_n332(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n333(x)
+    if (x < 1)
+        fun_l19_n70(x)
+    else
+        fun_l19_n150(x)
+    end
+end
+
+def fun_l18_n334(x)
+    if (x < 1)
+        fun_l19_n538(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n335(x)
+    if (x < 1)
+        fun_l19_n818(x)
+    else
+        fun_l19_n878(x)
+    end
+end
+
+def fun_l18_n336(x)
+    if (x < 1)
+        fun_l19_n233(x)
+    else
+        fun_l19_n286(x)
+    end
+end
+
+def fun_l18_n337(x)
+    if (x < 1)
+        fun_l19_n731(x)
+    else
+        fun_l19_n416(x)
+    end
+end
+
+def fun_l18_n338(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n710(x)
+    end
+end
+
+def fun_l18_n339(x)
+    if (x < 1)
+        fun_l19_n638(x)
+    else
+        fun_l19_n187(x)
+    end
+end
+
+def fun_l18_n340(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n767(x)
+    end
+end
+
+def fun_l18_n341(x)
+    if (x < 1)
+        fun_l19_n9(x)
+    else
+        fun_l19_n708(x)
+    end
+end
+
+def fun_l18_n342(x)
+    if (x < 1)
+        fun_l19_n76(x)
+    else
+        fun_l19_n479(x)
+    end
+end
+
+def fun_l18_n343(x)
+    if (x < 1)
+        fun_l19_n679(x)
+    else
+        fun_l19_n85(x)
+    end
+end
+
+def fun_l18_n344(x)
+    if (x < 1)
+        fun_l19_n725(x)
+    else
+        fun_l19_n809(x)
+    end
+end
+
+def fun_l18_n345(x)
+    if (x < 1)
+        fun_l19_n680(x)
+    else
+        fun_l19_n416(x)
+    end
+end
+
+def fun_l18_n346(x)
+    if (x < 1)
+        fun_l19_n66(x)
+    else
+        fun_l19_n36(x)
+    end
+end
+
+def fun_l18_n347(x)
+    if (x < 1)
+        fun_l19_n420(x)
+    else
+        fun_l19_n879(x)
+    end
+end
+
+def fun_l18_n348(x)
+    if (x < 1)
+        fun_l19_n653(x)
+    else
+        fun_l19_n634(x)
+    end
+end
+
+def fun_l18_n349(x)
+    if (x < 1)
+        fun_l19_n134(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n350(x)
+    if (x < 1)
+        fun_l19_n21(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n351(x)
+    if (x < 1)
+        fun_l19_n917(x)
+    else
+        fun_l19_n101(x)
+    end
+end
+
+def fun_l18_n352(x)
+    if (x < 1)
+        fun_l19_n541(x)
+    else
+        fun_l19_n646(x)
+    end
+end
+
+def fun_l18_n353(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n648(x)
+    end
+end
+
+def fun_l18_n354(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n355(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n512(x)
+    end
+end
+
+def fun_l18_n356(x)
+    if (x < 1)
+        fun_l19_n852(x)
+    else
+        fun_l19_n348(x)
+    end
+end
+
+def fun_l18_n357(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n997(x)
+    end
+end
+
+def fun_l18_n358(x)
+    if (x < 1)
+        fun_l19_n595(x)
+    else
+        fun_l19_n544(x)
+    end
+end
+
+def fun_l18_n359(x)
+    if (x < 1)
+        fun_l19_n13(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n360(x)
+    if (x < 1)
+        fun_l19_n518(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n361(x)
+    if (x < 1)
+        fun_l19_n333(x)
+    else
+        fun_l19_n59(x)
+    end
+end
+
+def fun_l18_n362(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n844(x)
+    end
+end
+
+def fun_l18_n363(x)
+    if (x < 1)
+        fun_l19_n14(x)
+    else
+        fun_l19_n932(x)
+    end
+end
+
+def fun_l18_n364(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n466(x)
+    end
+end
+
+def fun_l18_n365(x)
+    if (x < 1)
+        fun_l19_n177(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n366(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n205(x)
+    end
+end
+
+def fun_l18_n367(x)
+    if (x < 1)
+        fun_l19_n353(x)
+    else
+        fun_l19_n328(x)
+    end
+end
+
+def fun_l18_n368(x)
+    if (x < 1)
+        fun_l19_n801(x)
+    else
+        fun_l19_n420(x)
+    end
+end
+
+def fun_l18_n369(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n370(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n852(x)
+    end
+end
+
+def fun_l18_n371(x)
+    if (x < 1)
+        fun_l19_n47(x)
+    else
+        fun_l19_n130(x)
+    end
+end
+
+def fun_l18_n372(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n792(x)
+    end
+end
+
+def fun_l18_n373(x)
+    if (x < 1)
+        fun_l19_n124(x)
+    else
+        fun_l19_n665(x)
+    end
+end
+
+def fun_l18_n374(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n375(x)
+    if (x < 1)
+        fun_l19_n484(x)
+    else
+        fun_l19_n708(x)
+    end
+end
+
+def fun_l18_n376(x)
+    if (x < 1)
+        fun_l19_n810(x)
+    else
+        fun_l19_n856(x)
+    end
+end
+
+def fun_l18_n377(x)
+    if (x < 1)
+        fun_l19_n23(x)
+    else
+        fun_l19_n817(x)
+    end
+end
+
+def fun_l18_n378(x)
+    if (x < 1)
+        fun_l19_n827(x)
+    else
+        fun_l19_n639(x)
+    end
+end
+
+def fun_l18_n379(x)
+    if (x < 1)
+        fun_l19_n557(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n380(x)
+    if (x < 1)
+        fun_l19_n885(x)
+    else
+        fun_l19_n421(x)
+    end
+end
+
+def fun_l18_n381(x)
+    if (x < 1)
+        fun_l19_n543(x)
+    else
+        fun_l19_n230(x)
+    end
+end
+
+def fun_l18_n382(x)
+    if (x < 1)
+        fun_l19_n978(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n383(x)
+    if (x < 1)
+        fun_l19_n31(x)
+    else
+        fun_l19_n731(x)
+    end
+end
+
+def fun_l18_n384(x)
+    if (x < 1)
+        fun_l19_n20(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n385(x)
+    if (x < 1)
+        fun_l19_n650(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n386(x)
+    if (x < 1)
+        fun_l19_n491(x)
+    else
+        fun_l19_n644(x)
+    end
+end
+
+def fun_l18_n387(x)
+    if (x < 1)
+        fun_l19_n537(x)
+    else
+        fun_l19_n400(x)
+    end
+end
+
+def fun_l18_n388(x)
+    if (x < 1)
+        fun_l19_n939(x)
+    else
+        fun_l19_n861(x)
+    end
+end
+
+def fun_l18_n389(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n390(x)
+    if (x < 1)
+        fun_l19_n226(x)
+    else
+        fun_l19_n288(x)
+    end
+end
+
+def fun_l18_n391(x)
+    if (x < 1)
+        fun_l19_n921(x)
+    else
+        fun_l19_n754(x)
+    end
+end
+
+def fun_l18_n392(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n844(x)
+    end
+end
+
+def fun_l18_n393(x)
+    if (x < 1)
+        fun_l19_n310(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n394(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n933(x)
+    end
+end
+
+def fun_l18_n395(x)
+    if (x < 1)
+        fun_l19_n849(x)
+    else
+        fun_l19_n719(x)
+    end
+end
+
+def fun_l18_n396(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n435(x)
+    end
+end
+
+def fun_l18_n397(x)
+    if (x < 1)
+        fun_l19_n916(x)
+    else
+        fun_l19_n399(x)
+    end
+end
+
+def fun_l18_n398(x)
+    if (x < 1)
+        fun_l19_n820(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n399(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n678(x)
+    end
+end
+
+def fun_l18_n400(x)
+    if (x < 1)
+        fun_l19_n562(x)
+    else
+        fun_l19_n392(x)
+    end
+end
+
+def fun_l18_n401(x)
+    if (x < 1)
+        fun_l19_n298(x)
+    else
+        fun_l19_n61(x)
+    end
+end
+
+def fun_l18_n402(x)
+    if (x < 1)
+        fun_l19_n803(x)
+    else
+        fun_l19_n535(x)
+    end
+end
+
+def fun_l18_n403(x)
+    if (x < 1)
+        fun_l19_n335(x)
+    else
+        fun_l19_n431(x)
+    end
+end
+
+def fun_l18_n404(x)
+    if (x < 1)
+        fun_l19_n558(x)
+    else
+        fun_l19_n821(x)
+    end
+end
+
+def fun_l18_n405(x)
+    if (x < 1)
+        fun_l19_n608(x)
+    else
+        fun_l19_n415(x)
+    end
+end
+
+def fun_l18_n406(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n635(x)
+    end
+end
+
+def fun_l18_n407(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n923(x)
+    end
+end
+
+def fun_l18_n408(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n409(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n410(x)
+    if (x < 1)
+        fun_l19_n998(x)
+    else
+        fun_l19_n969(x)
+    end
+end
+
+def fun_l18_n411(x)
+    if (x < 1)
+        fun_l19_n210(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n412(x)
+    if (x < 1)
+        fun_l19_n902(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n413(x)
+    if (x < 1)
+        fun_l19_n417(x)
+    else
+        fun_l19_n192(x)
+    end
+end
+
+def fun_l18_n414(x)
+    if (x < 1)
+        fun_l19_n543(x)
+    else
+        fun_l19_n277(x)
+    end
+end
+
+def fun_l18_n415(x)
+    if (x < 1)
+        fun_l19_n145(x)
+    else
+        fun_l19_n157(x)
+    end
+end
+
+def fun_l18_n416(x)
+    if (x < 1)
+        fun_l19_n696(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n417(x)
+    if (x < 1)
+        fun_l19_n593(x)
+    else
+        fun_l19_n683(x)
+    end
+end
+
+def fun_l18_n418(x)
+    if (x < 1)
+        fun_l19_n459(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n419(x)
+    if (x < 1)
+        fun_l19_n37(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n420(x)
+    if (x < 1)
+        fun_l19_n39(x)
+    else
+        fun_l19_n642(x)
+    end
+end
+
+def fun_l18_n421(x)
+    if (x < 1)
+        fun_l19_n942(x)
+    else
+        fun_l19_n997(x)
+    end
+end
+
+def fun_l18_n422(x)
+    if (x < 1)
+        fun_l19_n18(x)
+    else
+        fun_l19_n301(x)
+    end
+end
+
+def fun_l18_n423(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n231(x)
+    end
+end
+
+def fun_l18_n424(x)
+    if (x < 1)
+        fun_l19_n331(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n425(x)
+    if (x < 1)
+        fun_l19_n786(x)
+    else
+        fun_l19_n991(x)
+    end
+end
+
+def fun_l18_n426(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n427(x)
+    if (x < 1)
+        fun_l19_n294(x)
+    else
+        fun_l19_n3(x)
+    end
+end
+
+def fun_l18_n428(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n429(x)
+    if (x < 1)
+        fun_l19_n818(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n430(x)
+    if (x < 1)
+        fun_l19_n360(x)
+    else
+        fun_l19_n443(x)
+    end
+end
+
+def fun_l18_n431(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n863(x)
+    end
+end
+
+def fun_l18_n432(x)
+    if (x < 1)
+        fun_l19_n591(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n433(x)
+    if (x < 1)
+        fun_l19_n955(x)
+    else
+        fun_l19_n265(x)
+    end
+end
+
+def fun_l18_n434(x)
+    if (x < 1)
+        fun_l19_n374(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n435(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n603(x)
+    end
+end
+
+def fun_l18_n436(x)
+    if (x < 1)
+        fun_l19_n750(x)
+    else
+        fun_l19_n852(x)
+    end
+end
+
+def fun_l18_n437(x)
+    if (x < 1)
+        fun_l19_n393(x)
+    else
+        fun_l19_n121(x)
+    end
+end
+
+def fun_l18_n438(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n439(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n841(x)
+    end
+end
+
+def fun_l18_n440(x)
+    if (x < 1)
+        fun_l19_n828(x)
+    else
+        fun_l19_n549(x)
+    end
+end
+
+def fun_l18_n441(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n795(x)
+    end
+end
+
+def fun_l18_n442(x)
+    if (x < 1)
+        fun_l19_n609(x)
+    else
+        fun_l19_n837(x)
+    end
+end
+
+def fun_l18_n443(x)
+    if (x < 1)
+        fun_l19_n977(x)
+    else
+        fun_l19_n670(x)
+    end
+end
+
+def fun_l18_n444(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n912(x)
+    end
+end
+
+def fun_l18_n445(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n994(x)
+    end
+end
+
+def fun_l18_n446(x)
+    if (x < 1)
+        fun_l19_n868(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n447(x)
+    if (x < 1)
+        fun_l19_n405(x)
+    else
+        fun_l19_n318(x)
+    end
+end
+
+def fun_l18_n448(x)
+    if (x < 1)
+        fun_l19_n966(x)
+    else
+        fun_l19_n214(x)
+    end
+end
+
+def fun_l18_n449(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n650(x)
+    end
+end
+
+def fun_l18_n450(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n697(x)
+    end
+end
+
+def fun_l18_n451(x)
+    if (x < 1)
+        fun_l19_n799(x)
+    else
+        fun_l19_n661(x)
+    end
+end
+
+def fun_l18_n452(x)
+    if (x < 1)
+        fun_l19_n677(x)
+    else
+        fun_l19_n750(x)
+    end
+end
+
+def fun_l18_n453(x)
+    if (x < 1)
+        fun_l19_n530(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n454(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n455(x)
+    if (x < 1)
+        fun_l19_n680(x)
+    else
+        fun_l19_n201(x)
+    end
+end
+
+def fun_l18_n456(x)
+    if (x < 1)
+        fun_l19_n246(x)
+    else
+        fun_l19_n972(x)
+    end
+end
+
+def fun_l18_n457(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n451(x)
+    end
+end
+
+def fun_l18_n458(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n288(x)
+    end
+end
+
+def fun_l18_n459(x)
+    if (x < 1)
+        fun_l19_n612(x)
+    else
+        fun_l19_n150(x)
+    end
+end
+
+def fun_l18_n460(x)
+    if (x < 1)
+        fun_l19_n549(x)
+    else
+        fun_l19_n917(x)
+    end
+end
+
+def fun_l18_n461(x)
+    if (x < 1)
+        fun_l19_n661(x)
+    else
+        fun_l19_n11(x)
+    end
+end
+
+def fun_l18_n462(x)
+    if (x < 1)
+        fun_l19_n172(x)
+    else
+        fun_l19_n561(x)
+    end
+end
+
+def fun_l18_n463(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n464(x)
+    if (x < 1)
+        fun_l19_n57(x)
+    else
+        fun_l19_n835(x)
+    end
+end
+
+def fun_l18_n465(x)
+    if (x < 1)
+        fun_l19_n116(x)
+    else
+        fun_l19_n993(x)
+    end
+end
+
+def fun_l18_n466(x)
+    if (x < 1)
+        fun_l19_n932(x)
+    else
+        fun_l19_n623(x)
+    end
+end
+
+def fun_l18_n467(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n468(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n193(x)
+    end
+end
+
+def fun_l18_n469(x)
+    if (x < 1)
+        fun_l19_n762(x)
+    else
+        fun_l19_n654(x)
+    end
+end
+
+def fun_l18_n470(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n42(x)
+    end
+end
+
+def fun_l18_n471(x)
+    if (x < 1)
+        fun_l19_n959(x)
+    else
+        fun_l19_n368(x)
+    end
+end
+
+def fun_l18_n472(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n357(x)
+    end
+end
+
+def fun_l18_n473(x)
+    if (x < 1)
+        fun_l19_n394(x)
+    else
+        fun_l19_n313(x)
+    end
+end
+
+def fun_l18_n474(x)
+    if (x < 1)
+        fun_l19_n826(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n475(x)
+    if (x < 1)
+        fun_l19_n202(x)
+    else
+        fun_l19_n455(x)
+    end
+end
+
+def fun_l18_n476(x)
+    if (x < 1)
+        fun_l19_n855(x)
+    else
+        fun_l19_n375(x)
+    end
+end
+
+def fun_l18_n477(x)
+    if (x < 1)
+        fun_l19_n554(x)
+    else
+        fun_l19_n176(x)
+    end
+end
+
+def fun_l18_n478(x)
+    if (x < 1)
+        fun_l19_n705(x)
+    else
+        fun_l19_n509(x)
+    end
+end
+
+def fun_l18_n479(x)
+    if (x < 1)
+        fun_l19_n473(x)
+    else
+        fun_l19_n123(x)
+    end
+end
+
+def fun_l18_n480(x)
+    if (x < 1)
+        fun_l19_n108(x)
+    else
+        fun_l19_n125(x)
+    end
+end
+
+def fun_l18_n481(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n657(x)
+    end
+end
+
+def fun_l18_n482(x)
+    if (x < 1)
+        fun_l19_n800(x)
+    else
+        fun_l19_n691(x)
+    end
+end
+
+def fun_l18_n483(x)
+    if (x < 1)
+        fun_l19_n343(x)
+    else
+        fun_l19_n573(x)
+    end
+end
+
+def fun_l18_n484(x)
+    if (x < 1)
+        fun_l19_n654(x)
+    else
+        fun_l19_n114(x)
+    end
+end
+
+def fun_l18_n485(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n291(x)
+    end
+end
+
+def fun_l18_n486(x)
+    if (x < 1)
+        fun_l19_n877(x)
+    else
+        fun_l19_n628(x)
+    end
+end
+
+def fun_l18_n487(x)
+    if (x < 1)
+        fun_l19_n35(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n488(x)
+    if (x < 1)
+        fun_l19_n592(x)
+    else
+        fun_l19_n951(x)
+    end
+end
+
+def fun_l18_n489(x)
+    if (x < 1)
+        fun_l19_n292(x)
+    else
+        fun_l19_n768(x)
+    end
+end
+
+def fun_l18_n490(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n759(x)
+    end
+end
+
+def fun_l18_n491(x)
+    if (x < 1)
+        fun_l19_n474(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n492(x)
+    if (x < 1)
+        fun_l19_n556(x)
+    else
+        fun_l19_n691(x)
+    end
+end
+
+def fun_l18_n493(x)
+    if (x < 1)
+        fun_l19_n717(x)
+    else
+        fun_l19_n714(x)
+    end
+end
+
+def fun_l18_n494(x)
+    if (x < 1)
+        fun_l19_n542(x)
+    else
+        fun_l19_n505(x)
+    end
+end
+
+def fun_l18_n495(x)
+    if (x < 1)
+        fun_l19_n154(x)
+    else
+        fun_l19_n500(x)
+    end
+end
+
+def fun_l18_n496(x)
+    if (x < 1)
+        fun_l19_n311(x)
+    else
+        fun_l19_n458(x)
+    end
+end
+
+def fun_l18_n497(x)
+    if (x < 1)
+        fun_l19_n523(x)
+    else
+        fun_l19_n475(x)
+    end
+end
+
+def fun_l18_n498(x)
+    if (x < 1)
+        fun_l19_n101(x)
+    else
+        fun_l19_n478(x)
+    end
+end
+
+def fun_l18_n499(x)
+    if (x < 1)
+        fun_l19_n243(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n500(x)
+    if (x < 1)
+        fun_l19_n263(x)
+    else
+        fun_l19_n888(x)
+    end
+end
+
+def fun_l18_n501(x)
+    if (x < 1)
+        fun_l19_n415(x)
+    else
+        fun_l19_n808(x)
+    end
+end
+
+def fun_l18_n502(x)
+    if (x < 1)
+        fun_l19_n38(x)
+    else
+        fun_l19_n640(x)
+    end
+end
+
+def fun_l18_n503(x)
+    if (x < 1)
+        fun_l19_n218(x)
+    else
+        fun_l19_n577(x)
+    end
+end
+
+def fun_l18_n504(x)
+    if (x < 1)
+        fun_l19_n723(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n505(x)
+    if (x < 1)
+        fun_l19_n392(x)
+    else
+        fun_l19_n984(x)
+    end
+end
+
+def fun_l18_n506(x)
+    if (x < 1)
+        fun_l19_n310(x)
+    else
+        fun_l19_n668(x)
+    end
+end
+
+def fun_l18_n507(x)
+    if (x < 1)
+        fun_l19_n278(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n508(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n479(x)
+    end
+end
+
+def fun_l18_n509(x)
+    if (x < 1)
+        fun_l19_n63(x)
+    else
+        fun_l19_n774(x)
+    end
+end
+
+def fun_l18_n510(x)
+    if (x < 1)
+        fun_l19_n607(x)
+    else
+        fun_l19_n433(x)
+    end
+end
+
+def fun_l18_n511(x)
+    if (x < 1)
+        fun_l19_n28(x)
+    else
+        fun_l19_n672(x)
+    end
+end
+
+def fun_l18_n512(x)
+    if (x < 1)
+        fun_l19_n684(x)
+    else
+        fun_l19_n247(x)
+    end
+end
+
+def fun_l18_n513(x)
+    if (x < 1)
+        fun_l19_n181(x)
+    else
+        fun_l19_n649(x)
+    end
+end
+
+def fun_l18_n514(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n281(x)
+    end
+end
+
+def fun_l18_n515(x)
+    if (x < 1)
+        fun_l19_n191(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n516(x)
+    if (x < 1)
+        fun_l19_n796(x)
+    else
+        fun_l19_n572(x)
+    end
+end
+
+def fun_l18_n517(x)
+    if (x < 1)
+        fun_l19_n780(x)
+    else
+        fun_l19_n816(x)
+    end
+end
+
+def fun_l18_n518(x)
+    if (x < 1)
+        fun_l19_n429(x)
+    else
+        fun_l19_n681(x)
+    end
+end
+
+def fun_l18_n519(x)
+    if (x < 1)
+        fun_l19_n476(x)
+    else
+        fun_l19_n954(x)
+    end
+end
+
+def fun_l18_n520(x)
+    if (x < 1)
+        fun_l19_n537(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n521(x)
+    if (x < 1)
+        fun_l19_n657(x)
+    else
+        fun_l19_n293(x)
+    end
+end
+
+def fun_l18_n522(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n685(x)
+    end
+end
+
+def fun_l18_n523(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n184(x)
+    end
+end
+
+def fun_l18_n524(x)
+    if (x < 1)
+        fun_l19_n6(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n525(x)
+    if (x < 1)
+        fun_l19_n395(x)
+    else
+        fun_l19_n570(x)
+    end
+end
+
+def fun_l18_n526(x)
+    if (x < 1)
+        fun_l19_n837(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n527(x)
+    if (x < 1)
+        fun_l19_n827(x)
+    else
+        fun_l19_n119(x)
+    end
+end
+
+def fun_l18_n528(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n382(x)
+    end
+end
+
+def fun_l18_n529(x)
+    if (x < 1)
+        fun_l19_n365(x)
+    else
+        fun_l19_n713(x)
+    end
+end
+
+def fun_l18_n530(x)
+    if (x < 1)
+        fun_l19_n223(x)
+    else
+        fun_l19_n346(x)
+    end
+end
+
+def fun_l18_n531(x)
+    if (x < 1)
+        fun_l19_n624(x)
+    else
+        fun_l19_n671(x)
+    end
+end
+
+def fun_l18_n532(x)
+    if (x < 1)
+        fun_l19_n522(x)
+    else
+        fun_l19_n354(x)
+    end
+end
+
+def fun_l18_n533(x)
+    if (x < 1)
+        fun_l19_n324(x)
+    else
+        fun_l19_n602(x)
+    end
+end
+
+def fun_l18_n534(x)
+    if (x < 1)
+        fun_l19_n138(x)
+    else
+        fun_l19_n259(x)
+    end
+end
+
+def fun_l18_n535(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n810(x)
+    end
+end
+
+def fun_l18_n536(x)
+    if (x < 1)
+        fun_l19_n694(x)
+    else
+        fun_l19_n39(x)
+    end
+end
+
+def fun_l18_n537(x)
+    if (x < 1)
+        fun_l19_n441(x)
+    else
+        fun_l19_n158(x)
+    end
+end
+
+def fun_l18_n538(x)
+    if (x < 1)
+        fun_l19_n609(x)
+    else
+        fun_l19_n54(x)
+    end
+end
+
+def fun_l18_n539(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n206(x)
+    end
+end
+
+def fun_l18_n540(x)
+    if (x < 1)
+        fun_l19_n548(x)
+    else
+        fun_l19_n558(x)
+    end
+end
+
+def fun_l18_n541(x)
+    if (x < 1)
+        fun_l19_n640(x)
+    else
+        fun_l19_n721(x)
+    end
+end
+
+def fun_l18_n542(x)
+    if (x < 1)
+        fun_l19_n50(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n543(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n544(x)
+    if (x < 1)
+        fun_l19_n151(x)
+    else
+        fun_l19_n75(x)
+    end
+end
+
+def fun_l18_n545(x)
+    if (x < 1)
+        fun_l19_n162(x)
+    else
+        fun_l19_n550(x)
+    end
+end
+
+def fun_l18_n546(x)
+    if (x < 1)
+        fun_l19_n892(x)
+    else
+        fun_l19_n322(x)
+    end
+end
+
+def fun_l18_n547(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n548(x)
+    if (x < 1)
+        fun_l19_n54(x)
+    else
+        fun_l19_n627(x)
+    end
+end
+
+def fun_l18_n549(x)
+    if (x < 1)
+        fun_l19_n847(x)
+    else
+        fun_l19_n236(x)
+    end
+end
+
+def fun_l18_n550(x)
+    if (x < 1)
+        fun_l19_n796(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n551(x)
+    if (x < 1)
+        fun_l19_n922(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n552(x)
+    if (x < 1)
+        fun_l19_n378(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n553(x)
+    if (x < 1)
+        fun_l19_n188(x)
+    else
+        fun_l19_n65(x)
+    end
+end
+
+def fun_l18_n554(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n555(x)
+    if (x < 1)
+        fun_l19_n718(x)
+    else
+        fun_l19_n926(x)
+    end
+end
+
+def fun_l18_n556(x)
+    if (x < 1)
+        fun_l19_n765(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n557(x)
+    if (x < 1)
+        fun_l19_n987(x)
+    else
+        fun_l19_n152(x)
+    end
+end
+
+def fun_l18_n558(x)
+    if (x < 1)
+        fun_l19_n978(x)
+    else
+        fun_l19_n861(x)
+    end
+end
+
+def fun_l18_n559(x)
+    if (x < 1)
+        fun_l19_n563(x)
+    else
+        fun_l19_n532(x)
+    end
+end
+
+def fun_l18_n560(x)
+    if (x < 1)
+        fun_l19_n492(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n561(x)
+    if (x < 1)
+        fun_l19_n967(x)
+    else
+        fun_l19_n33(x)
+    end
+end
+
+def fun_l18_n562(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n212(x)
+    end
+end
+
+def fun_l18_n563(x)
+    if (x < 1)
+        fun_l19_n55(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n564(x)
+    if (x < 1)
+        fun_l19_n263(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n565(x)
+    if (x < 1)
+        fun_l19_n292(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n566(x)
+    if (x < 1)
+        fun_l19_n16(x)
+    else
+        fun_l19_n180(x)
+    end
+end
+
+def fun_l18_n567(x)
+    if (x < 1)
+        fun_l19_n359(x)
+    else
+        fun_l19_n398(x)
+    end
+end
+
+def fun_l18_n568(x)
+    if (x < 1)
+        fun_l19_n799(x)
+    else
+        fun_l19_n616(x)
+    end
+end
+
+def fun_l18_n569(x)
+    if (x < 1)
+        fun_l19_n751(x)
+    else
+        fun_l19_n539(x)
+    end
+end
+
+def fun_l18_n570(x)
+    if (x < 1)
+        fun_l19_n497(x)
+    else
+        fun_l19_n197(x)
+    end
+end
+
+def fun_l18_n571(x)
+    if (x < 1)
+        fun_l19_n88(x)
+    else
+        fun_l19_n565(x)
+    end
+end
+
+def fun_l18_n572(x)
+    if (x < 1)
+        fun_l19_n213(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n573(x)
+    if (x < 1)
+        fun_l19_n570(x)
+    else
+        fun_l19_n893(x)
+    end
+end
+
+def fun_l18_n574(x)
+    if (x < 1)
+        fun_l19_n436(x)
+    else
+        fun_l19_n285(x)
+    end
+end
+
+def fun_l18_n575(x)
+    if (x < 1)
+        fun_l19_n787(x)
+    else
+        fun_l19_n541(x)
+    end
+end
+
+def fun_l18_n576(x)
+    if (x < 1)
+        fun_l19_n432(x)
+    else
+        fun_l19_n371(x)
+    end
+end
+
+def fun_l18_n577(x)
+    if (x < 1)
+        fun_l19_n542(x)
+    else
+        fun_l19_n431(x)
+    end
+end
+
+def fun_l18_n578(x)
+    if (x < 1)
+        fun_l19_n829(x)
+    else
+        fun_l19_n415(x)
+    end
+end
+
+def fun_l18_n579(x)
+    if (x < 1)
+        fun_l19_n925(x)
+    else
+        fun_l19_n862(x)
+    end
+end
+
+def fun_l18_n580(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n67(x)
+    end
+end
+
+def fun_l18_n581(x)
+    if (x < 1)
+        fun_l19_n734(x)
+    else
+        fun_l19_n220(x)
+    end
+end
+
+def fun_l18_n582(x)
+    if (x < 1)
+        fun_l19_n971(x)
+    else
+        fun_l19_n359(x)
+    end
+end
+
+def fun_l18_n583(x)
+    if (x < 1)
+        fun_l19_n293(x)
+    else
+        fun_l19_n286(x)
+    end
+end
+
+def fun_l18_n584(x)
+    if (x < 1)
+        fun_l19_n618(x)
+    else
+        fun_l19_n866(x)
+    end
+end
+
+def fun_l18_n585(x)
+    if (x < 1)
+        fun_l19_n315(x)
+    else
+        fun_l19_n594(x)
+    end
+end
+
+def fun_l18_n586(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n450(x)
+    end
+end
+
+def fun_l18_n587(x)
+    if (x < 1)
+        fun_l19_n805(x)
+    else
+        fun_l19_n429(x)
+    end
+end
+
+def fun_l18_n588(x)
+    if (x < 1)
+        fun_l19_n782(x)
+    else
+        fun_l19_n133(x)
+    end
+end
+
+def fun_l18_n589(x)
+    if (x < 1)
+        fun_l19_n166(x)
+    else
+        fun_l19_n111(x)
+    end
+end
+
+def fun_l18_n590(x)
+    if (x < 1)
+        fun_l19_n26(x)
+    else
+        fun_l19_n678(x)
+    end
+end
+
+def fun_l18_n591(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n346(x)
+    end
+end
+
+def fun_l18_n592(x)
+    if (x < 1)
+        fun_l19_n882(x)
+    else
+        fun_l19_n930(x)
+    end
+end
+
+def fun_l18_n593(x)
+    if (x < 1)
+        fun_l19_n454(x)
+    else
+        fun_l19_n560(x)
+    end
+end
+
+def fun_l18_n594(x)
+    if (x < 1)
+        fun_l19_n881(x)
+    else
+        fun_l19_n929(x)
+    end
+end
+
+def fun_l18_n595(x)
+    if (x < 1)
+        fun_l19_n464(x)
+    else
+        fun_l19_n8(x)
+    end
+end
+
+def fun_l18_n596(x)
+    if (x < 1)
+        fun_l19_n247(x)
+    else
+        fun_l19_n48(x)
+    end
+end
+
+def fun_l18_n597(x)
+    if (x < 1)
+        fun_l19_n838(x)
+    else
+        fun_l19_n811(x)
+    end
+end
+
+def fun_l18_n598(x)
+    if (x < 1)
+        fun_l19_n493(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n599(x)
+    if (x < 1)
+        fun_l19_n372(x)
+    else
+        fun_l19_n334(x)
+    end
+end
+
+def fun_l18_n600(x)
+    if (x < 1)
+        fun_l19_n971(x)
+    else
+        fun_l19_n198(x)
+    end
+end
+
+def fun_l18_n601(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n273(x)
+    end
+end
+
+def fun_l18_n602(x)
+    if (x < 1)
+        fun_l19_n778(x)
+    else
+        fun_l19_n815(x)
+    end
+end
+
+def fun_l18_n603(x)
+    if (x < 1)
+        fun_l19_n247(x)
+    else
+        fun_l19_n615(x)
+    end
+end
+
+def fun_l18_n604(x)
+    if (x < 1)
+        fun_l19_n659(x)
+    else
+        fun_l19_n613(x)
+    end
+end
+
+def fun_l18_n605(x)
+    if (x < 1)
+        fun_l19_n814(x)
+    else
+        fun_l19_n742(x)
+    end
+end
+
+def fun_l18_n606(x)
+    if (x < 1)
+        fun_l19_n988(x)
+    else
+        fun_l19_n877(x)
+    end
+end
+
+def fun_l18_n607(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n491(x)
+    end
+end
+
+def fun_l18_n608(x)
+    if (x < 1)
+        fun_l19_n600(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n609(x)
+    if (x < 1)
+        fun_l19_n695(x)
+    else
+        fun_l19_n343(x)
+    end
+end
+
+def fun_l18_n610(x)
+    if (x < 1)
+        fun_l19_n686(x)
+    else
+        fun_l19_n154(x)
+    end
+end
+
+def fun_l18_n611(x)
+    if (x < 1)
+        fun_l19_n413(x)
+    else
+        fun_l19_n364(x)
+    end
+end
+
+def fun_l18_n612(x)
+    if (x < 1)
+        fun_l19_n86(x)
+    else
+        fun_l19_n478(x)
+    end
+end
+
+def fun_l18_n613(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n134(x)
+    end
+end
+
+def fun_l18_n614(x)
+    if (x < 1)
+        fun_l19_n71(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n615(x)
+    if (x < 1)
+        fun_l19_n716(x)
+    else
+        fun_l19_n697(x)
+    end
+end
+
+def fun_l18_n616(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n617(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n117(x)
+    end
+end
+
+def fun_l18_n618(x)
+    if (x < 1)
+        fun_l19_n304(x)
+    else
+        fun_l19_n115(x)
+    end
+end
+
+def fun_l18_n619(x)
+    if (x < 1)
+        fun_l19_n322(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n620(x)
+    if (x < 1)
+        fun_l19_n213(x)
+    else
+        fun_l19_n122(x)
+    end
+end
+
+def fun_l18_n621(x)
+    if (x < 1)
+        fun_l19_n675(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n622(x)
+    if (x < 1)
+        fun_l19_n660(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n623(x)
+    if (x < 1)
+        fun_l19_n656(x)
+    else
+        fun_l19_n698(x)
+    end
+end
+
+def fun_l18_n624(x)
+    if (x < 1)
+        fun_l19_n575(x)
+    else
+        fun_l19_n274(x)
+    end
+end
+
+def fun_l18_n625(x)
+    if (x < 1)
+        fun_l19_n44(x)
+    else
+        fun_l19_n78(x)
+    end
+end
+
+def fun_l18_n626(x)
+    if (x < 1)
+        fun_l19_n326(x)
+    else
+        fun_l19_n76(x)
+    end
+end
+
+def fun_l18_n627(x)
+    if (x < 1)
+        fun_l19_n365(x)
+    else
+        fun_l19_n453(x)
+    end
+end
+
+def fun_l18_n628(x)
+    if (x < 1)
+        fun_l19_n306(x)
+    else
+        fun_l19_n63(x)
+    end
+end
+
+def fun_l18_n629(x)
+    if (x < 1)
+        fun_l19_n116(x)
+    else
+        fun_l19_n577(x)
+    end
+end
+
+def fun_l18_n630(x)
+    if (x < 1)
+        fun_l19_n625(x)
+    else
+        fun_l19_n321(x)
+    end
+end
+
+def fun_l18_n631(x)
+    if (x < 1)
+        fun_l19_n328(x)
+    else
+        fun_l19_n989(x)
+    end
+end
+
+def fun_l18_n632(x)
+    if (x < 1)
+        fun_l19_n216(x)
+    else
+        fun_l19_n375(x)
+    end
+end
+
+def fun_l18_n633(x)
+    if (x < 1)
+        fun_l19_n942(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n634(x)
+    if (x < 1)
+        fun_l19_n821(x)
+    else
+        fun_l19_n132(x)
+    end
+end
+
+def fun_l18_n635(x)
+    if (x < 1)
+        fun_l19_n164(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n636(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n404(x)
+    end
+end
+
+def fun_l18_n637(x)
+    if (x < 1)
+        fun_l19_n715(x)
+    else
+        fun_l19_n955(x)
+    end
+end
+
+def fun_l18_n638(x)
+    if (x < 1)
+        fun_l19_n297(x)
+    else
+        fun_l19_n349(x)
+    end
+end
+
+def fun_l18_n639(x)
+    if (x < 1)
+        fun_l19_n835(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n640(x)
+    if (x < 1)
+        fun_l19_n778(x)
+    else
+        fun_l19_n572(x)
+    end
+end
+
+def fun_l18_n641(x)
+    if (x < 1)
+        fun_l19_n51(x)
+    else
+        fun_l19_n497(x)
+    end
+end
+
+def fun_l18_n642(x)
+    if (x < 1)
+        fun_l19_n390(x)
+    else
+        fun_l19_n341(x)
+    end
+end
+
+def fun_l18_n643(x)
+    if (x < 1)
+        fun_l19_n961(x)
+    else
+        fun_l19_n966(x)
+    end
+end
+
+def fun_l18_n644(x)
+    if (x < 1)
+        fun_l19_n832(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n645(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n266(x)
+    end
+end
+
+def fun_l18_n646(x)
+    if (x < 1)
+        fun_l19_n512(x)
+    else
+        fun_l19_n988(x)
+    end
+end
+
+def fun_l18_n647(x)
+    if (x < 1)
+        fun_l19_n728(x)
+    else
+        fun_l19_n390(x)
+    end
+end
+
+def fun_l18_n648(x)
+    if (x < 1)
+        fun_l19_n61(x)
+    else
+        fun_l19_n188(x)
+    end
+end
+
+def fun_l18_n649(x)
+    if (x < 1)
+        fun_l19_n772(x)
+    else
+        fun_l19_n457(x)
+    end
+end
+
+def fun_l18_n650(x)
+    if (x < 1)
+        fun_l19_n768(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n651(x)
+    if (x < 1)
+        fun_l19_n30(x)
+    else
+        fun_l19_n663(x)
+    end
+end
+
+def fun_l18_n652(x)
+    if (x < 1)
+        fun_l19_n42(x)
+    else
+        fun_l19_n781(x)
+    end
+end
+
+def fun_l18_n653(x)
+    if (x < 1)
+        fun_l19_n59(x)
+    else
+        fun_l19_n99(x)
+    end
+end
+
+def fun_l18_n654(x)
+    if (x < 1)
+        fun_l19_n81(x)
+    else
+        fun_l19_n368(x)
+    end
+end
+
+def fun_l18_n655(x)
+    if (x < 1)
+        fun_l19_n0(x)
+    else
+        fun_l19_n321(x)
+    end
+end
+
+def fun_l18_n656(x)
+    if (x < 1)
+        fun_l19_n344(x)
+    else
+        fun_l19_n996(x)
+    end
+end
+
+def fun_l18_n657(x)
+    if (x < 1)
+        fun_l19_n384(x)
+    else
+        fun_l19_n123(x)
+    end
+end
+
+def fun_l18_n658(x)
+    if (x < 1)
+        fun_l19_n336(x)
+    else
+        fun_l19_n928(x)
+    end
+end
+
+def fun_l18_n659(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n370(x)
+    end
+end
+
+def fun_l18_n660(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n200(x)
+    end
+end
+
+def fun_l18_n661(x)
+    if (x < 1)
+        fun_l19_n674(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n662(x)
+    if (x < 1)
+        fun_l19_n839(x)
+    else
+        fun_l19_n737(x)
+    end
+end
+
+def fun_l18_n663(x)
+    if (x < 1)
+        fun_l19_n670(x)
+    else
+        fun_l19_n77(x)
+    end
+end
+
+def fun_l18_n664(x)
+    if (x < 1)
+        fun_l19_n402(x)
+    else
+        fun_l19_n7(x)
+    end
+end
+
+def fun_l18_n665(x)
+    if (x < 1)
+        fun_l19_n357(x)
+    else
+        fun_l19_n961(x)
+    end
+end
+
+def fun_l18_n666(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n535(x)
+    end
+end
+
+def fun_l18_n667(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n450(x)
+    end
+end
+
+def fun_l18_n668(x)
+    if (x < 1)
+        fun_l19_n823(x)
+    else
+        fun_l19_n301(x)
+    end
+end
+
+def fun_l18_n669(x)
+    if (x < 1)
+        fun_l19_n36(x)
+    else
+        fun_l19_n660(x)
+    end
+end
+
+def fun_l18_n670(x)
+    if (x < 1)
+        fun_l19_n322(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n671(x)
+    if (x < 1)
+        fun_l19_n408(x)
+    else
+        fun_l19_n872(x)
+    end
+end
+
+def fun_l18_n672(x)
+    if (x < 1)
+        fun_l19_n614(x)
+    else
+        fun_l19_n567(x)
+    end
+end
+
+def fun_l18_n673(x)
+    if (x < 1)
+        fun_l19_n601(x)
+    else
+        fun_l19_n429(x)
+    end
+end
+
+def fun_l18_n674(x)
+    if (x < 1)
+        fun_l19_n658(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n675(x)
+    if (x < 1)
+        fun_l19_n248(x)
+    else
+        fun_l19_n29(x)
+    end
+end
+
+def fun_l18_n676(x)
+    if (x < 1)
+        fun_l19_n206(x)
+    else
+        fun_l19_n838(x)
+    end
+end
+
+def fun_l18_n677(x)
+    if (x < 1)
+        fun_l19_n354(x)
+    else
+        fun_l19_n700(x)
+    end
+end
+
+def fun_l18_n678(x)
+    if (x < 1)
+        fun_l19_n264(x)
+    else
+        fun_l19_n591(x)
+    end
+end
+
+def fun_l18_n679(x)
+    if (x < 1)
+        fun_l19_n73(x)
+    else
+        fun_l19_n419(x)
+    end
+end
+
+def fun_l18_n680(x)
+    if (x < 1)
+        fun_l19_n260(x)
+    else
+        fun_l19_n902(x)
+    end
+end
+
+def fun_l18_n681(x)
+    if (x < 1)
+        fun_l19_n776(x)
+    else
+        fun_l19_n148(x)
+    end
+end
+
+def fun_l18_n682(x)
+    if (x < 1)
+        fun_l19_n819(x)
+    else
+        fun_l19_n743(x)
+    end
+end
+
+def fun_l18_n683(x)
+    if (x < 1)
+        fun_l19_n831(x)
+    else
+        fun_l19_n194(x)
+    end
+end
+
+def fun_l18_n684(x)
+    if (x < 1)
+        fun_l19_n652(x)
+    else
+        fun_l19_n229(x)
+    end
+end
+
+def fun_l18_n685(x)
+    if (x < 1)
+        fun_l19_n533(x)
+    else
+        fun_l19_n600(x)
+    end
+end
+
+def fun_l18_n686(x)
+    if (x < 1)
+        fun_l19_n45(x)
+    else
+        fun_l19_n623(x)
+    end
+end
+
+def fun_l18_n687(x)
+    if (x < 1)
+        fun_l19_n287(x)
+    else
+        fun_l19_n443(x)
+    end
+end
+
+def fun_l18_n688(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n819(x)
+    end
+end
+
+def fun_l18_n689(x)
+    if (x < 1)
+        fun_l19_n872(x)
+    else
+        fun_l19_n944(x)
+    end
+end
+
+def fun_l18_n690(x)
+    if (x < 1)
+        fun_l19_n352(x)
+    else
+        fun_l19_n49(x)
+    end
+end
+
+def fun_l18_n691(x)
+    if (x < 1)
+        fun_l19_n438(x)
+    else
+        fun_l19_n592(x)
+    end
+end
+
+def fun_l18_n692(x)
+    if (x < 1)
+        fun_l19_n717(x)
+    else
+        fun_l19_n30(x)
+    end
+end
+
+def fun_l18_n693(x)
+    if (x < 1)
+        fun_l19_n132(x)
+    else
+        fun_l19_n830(x)
+    end
+end
+
+def fun_l18_n694(x)
+    if (x < 1)
+        fun_l19_n17(x)
+    else
+        fun_l19_n649(x)
+    end
+end
+
+def fun_l18_n695(x)
+    if (x < 1)
+        fun_l19_n883(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n696(x)
+    if (x < 1)
+        fun_l19_n354(x)
+    else
+        fun_l19_n927(x)
+    end
+end
+
+def fun_l18_n697(x)
+    if (x < 1)
+        fun_l19_n534(x)
+    else
+        fun_l19_n192(x)
+    end
+end
+
+def fun_l18_n698(x)
+    if (x < 1)
+        fun_l19_n911(x)
+    else
+        fun_l19_n386(x)
+    end
+end
+
+def fun_l18_n699(x)
+    if (x < 1)
+        fun_l19_n1(x)
+    else
+        fun_l19_n253(x)
+    end
+end
+
+def fun_l18_n700(x)
+    if (x < 1)
+        fun_l19_n318(x)
+    else
+        fun_l19_n323(x)
+    end
+end
+
+def fun_l18_n701(x)
+    if (x < 1)
+        fun_l19_n158(x)
+    else
+        fun_l19_n61(x)
+    end
+end
+
+def fun_l18_n702(x)
+    if (x < 1)
+        fun_l19_n719(x)
+    else
+        fun_l19_n842(x)
+    end
+end
+
+def fun_l18_n703(x)
+    if (x < 1)
+        fun_l19_n918(x)
+    else
+        fun_l19_n231(x)
+    end
+end
+
+def fun_l18_n704(x)
+    if (x < 1)
+        fun_l19_n136(x)
+    else
+        fun_l19_n28(x)
+    end
+end
+
+def fun_l18_n705(x)
+    if (x < 1)
+        fun_l19_n451(x)
+    else
+        fun_l19_n328(x)
+    end
+end
+
+def fun_l18_n706(x)
+    if (x < 1)
+        fun_l19_n182(x)
+    else
+        fun_l19_n434(x)
+    end
+end
+
+def fun_l18_n707(x)
+    if (x < 1)
+        fun_l19_n368(x)
+    else
+        fun_l19_n302(x)
+    end
+end
+
+def fun_l18_n708(x)
+    if (x < 1)
+        fun_l19_n370(x)
+    else
+        fun_l19_n291(x)
+    end
+end
+
+def fun_l18_n709(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n530(x)
+    end
+end
+
+def fun_l18_n710(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n325(x)
+    end
+end
+
+def fun_l18_n711(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n299(x)
+    end
+end
+
+def fun_l18_n712(x)
+    if (x < 1)
+        fun_l19_n40(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n713(x)
+    if (x < 1)
+        fun_l19_n871(x)
+    else
+        fun_l19_n72(x)
+    end
+end
+
+def fun_l18_n714(x)
+    if (x < 1)
+        fun_l19_n137(x)
+    else
+        fun_l19_n195(x)
+    end
+end
+
+def fun_l18_n715(x)
+    if (x < 1)
+        fun_l19_n534(x)
+    else
+        fun_l19_n613(x)
+    end
+end
+
+def fun_l18_n716(x)
+    if (x < 1)
+        fun_l19_n591(x)
+    else
+        fun_l19_n899(x)
+    end
+end
+
+def fun_l18_n717(x)
+    if (x < 1)
+        fun_l19_n103(x)
+    else
+        fun_l19_n333(x)
+    end
+end
+
+def fun_l18_n718(x)
+    if (x < 1)
+        fun_l19_n470(x)
+    else
+        fun_l19_n576(x)
+    end
+end
+
+def fun_l18_n719(x)
+    if (x < 1)
+        fun_l19_n494(x)
+    else
+        fun_l19_n765(x)
+    end
+end
+
+def fun_l18_n720(x)
+    if (x < 1)
+        fun_l19_n317(x)
+    else
+        fun_l19_n720(x)
+    end
+end
+
+def fun_l18_n721(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n722(x)
+    if (x < 1)
+        fun_l19_n642(x)
+    else
+        fun_l19_n700(x)
+    end
+end
+
+def fun_l18_n723(x)
+    if (x < 1)
+        fun_l19_n775(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n724(x)
+    if (x < 1)
+        fun_l19_n346(x)
+    else
+        fun_l19_n974(x)
+    end
+end
+
+def fun_l18_n725(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n90(x)
+    end
+end
+
+def fun_l18_n726(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n793(x)
+    end
+end
+
+def fun_l18_n727(x)
+    if (x < 1)
+        fun_l19_n588(x)
+    else
+        fun_l19_n895(x)
+    end
+end
+
+def fun_l18_n728(x)
+    if (x < 1)
+        fun_l19_n18(x)
+    else
+        fun_l19_n218(x)
+    end
+end
+
+def fun_l18_n729(x)
+    if (x < 1)
+        fun_l19_n109(x)
+    else
+        fun_l19_n970(x)
+    end
+end
+
+def fun_l18_n730(x)
+    if (x < 1)
+        fun_l19_n721(x)
+    else
+        fun_l19_n81(x)
+    end
+end
+
+def fun_l18_n731(x)
+    if (x < 1)
+        fun_l19_n935(x)
+    else
+        fun_l19_n652(x)
+    end
+end
+
+def fun_l18_n732(x)
+    if (x < 1)
+        fun_l19_n821(x)
+    else
+        fun_l19_n32(x)
+    end
+end
+
+def fun_l18_n733(x)
+    if (x < 1)
+        fun_l19_n189(x)
+    else
+        fun_l19_n469(x)
+    end
+end
+
+def fun_l18_n734(x)
+    if (x < 1)
+        fun_l19_n11(x)
+    else
+        fun_l19_n741(x)
+    end
+end
+
+def fun_l18_n735(x)
+    if (x < 1)
+        fun_l19_n575(x)
+    else
+        fun_l19_n679(x)
+    end
+end
+
+def fun_l18_n736(x)
+    if (x < 1)
+        fun_l19_n442(x)
+    else
+        fun_l19_n652(x)
+    end
+end
+
+def fun_l18_n737(x)
+    if (x < 1)
+        fun_l19_n22(x)
+    else
+        fun_l19_n950(x)
+    end
+end
+
+def fun_l18_n738(x)
+    if (x < 1)
+        fun_l19_n605(x)
+    else
+        fun_l19_n16(x)
+    end
+end
+
+def fun_l18_n739(x)
+    if (x < 1)
+        fun_l19_n888(x)
+    else
+        fun_l19_n873(x)
+    end
+end
+
+def fun_l18_n740(x)
+    if (x < 1)
+        fun_l19_n355(x)
+    else
+        fun_l19_n558(x)
+    end
+end
+
+def fun_l18_n741(x)
+    if (x < 1)
+        fun_l19_n171(x)
+    else
+        fun_l19_n513(x)
+    end
+end
+
+def fun_l18_n742(x)
+    if (x < 1)
+        fun_l19_n843(x)
+    else
+        fun_l19_n833(x)
+    end
+end
+
+def fun_l18_n743(x)
+    if (x < 1)
+        fun_l19_n774(x)
+    else
+        fun_l19_n992(x)
+    end
+end
+
+def fun_l18_n744(x)
+    if (x < 1)
+        fun_l19_n505(x)
+    else
+        fun_l19_n353(x)
+    end
+end
+
+def fun_l18_n745(x)
+    if (x < 1)
+        fun_l19_n93(x)
+    else
+        fun_l19_n476(x)
+    end
+end
+
+def fun_l18_n746(x)
+    if (x < 1)
+        fun_l19_n555(x)
+    else
+        fun_l19_n233(x)
+    end
+end
+
+def fun_l18_n747(x)
+    if (x < 1)
+        fun_l19_n639(x)
+    else
+        fun_l19_n239(x)
+    end
+end
+
+def fun_l18_n748(x)
+    if (x < 1)
+        fun_l19_n318(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n749(x)
+    if (x < 1)
+        fun_l19_n80(x)
+    else
+        fun_l19_n252(x)
+    end
+end
+
+def fun_l18_n750(x)
+    if (x < 1)
+        fun_l19_n546(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n751(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n732(x)
+    end
+end
+
+def fun_l18_n752(x)
+    if (x < 1)
+        fun_l19_n870(x)
+    else
+        fun_l19_n696(x)
+    end
+end
+
+def fun_l18_n753(x)
+    if (x < 1)
+        fun_l19_n633(x)
+    else
+        fun_l19_n547(x)
+    end
+end
+
+def fun_l18_n754(x)
+    if (x < 1)
+        fun_l19_n860(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n755(x)
+    if (x < 1)
+        fun_l19_n4(x)
+    else
+        fun_l19_n560(x)
+    end
+end
+
+def fun_l18_n756(x)
+    if (x < 1)
+        fun_l19_n227(x)
+    else
+        fun_l19_n189(x)
+    end
+end
+
+def fun_l18_n757(x)
+    if (x < 1)
+        fun_l19_n560(x)
+    else
+        fun_l19_n467(x)
+    end
+end
+
+def fun_l18_n758(x)
+    if (x < 1)
+        fun_l19_n777(x)
+    else
+        fun_l19_n761(x)
+    end
+end
+
+def fun_l18_n759(x)
+    if (x < 1)
+        fun_l19_n626(x)
+    else
+        fun_l19_n391(x)
+    end
+end
+
+def fun_l18_n760(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n629(x)
+    end
+end
+
+def fun_l18_n761(x)
+    if (x < 1)
+        fun_l19_n509(x)
+    else
+        fun_l19_n268(x)
+    end
+end
+
+def fun_l18_n762(x)
+    if (x < 1)
+        fun_l19_n49(x)
+    else
+        fun_l19_n149(x)
+    end
+end
+
+def fun_l18_n763(x)
+    if (x < 1)
+        fun_l19_n614(x)
+    else
+        fun_l19_n490(x)
+    end
+end
+
+def fun_l18_n764(x)
+    if (x < 1)
+        fun_l19_n7(x)
+    else
+        fun_l19_n686(x)
+    end
+end
+
+def fun_l18_n765(x)
+    if (x < 1)
+        fun_l19_n93(x)
+    else
+        fun_l19_n334(x)
+    end
+end
+
+def fun_l18_n766(x)
+    if (x < 1)
+        fun_l19_n30(x)
+    else
+        fun_l19_n396(x)
+    end
+end
+
+def fun_l18_n767(x)
+    if (x < 1)
+        fun_l19_n437(x)
+    else
+        fun_l19_n614(x)
+    end
+end
+
+def fun_l18_n768(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n915(x)
+    end
+end
+
+def fun_l18_n769(x)
+    if (x < 1)
+        fun_l19_n465(x)
+    else
+        fun_l19_n816(x)
+    end
+end
+
+def fun_l18_n770(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n772(x)
+    end
+end
+
+def fun_l18_n771(x)
+    if (x < 1)
+        fun_l19_n196(x)
+    else
+        fun_l19_n812(x)
+    end
+end
+
+def fun_l18_n772(x)
+    if (x < 1)
+        fun_l19_n785(x)
+    else
+        fun_l19_n592(x)
+    end
+end
+
+def fun_l18_n773(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n50(x)
+    end
+end
+
+def fun_l18_n774(x)
+    if (x < 1)
+        fun_l19_n102(x)
+    else
+        fun_l19_n843(x)
+    end
+end
+
+def fun_l18_n775(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n805(x)
+    end
+end
+
+def fun_l18_n776(x)
+    if (x < 1)
+        fun_l19_n449(x)
+    else
+        fun_l19_n425(x)
+    end
+end
+
+def fun_l18_n777(x)
+    if (x < 1)
+        fun_l19_n855(x)
+    else
+        fun_l19_n345(x)
+    end
+end
+
+def fun_l18_n778(x)
+    if (x < 1)
+        fun_l19_n714(x)
+    else
+        fun_l19_n499(x)
+    end
+end
+
+def fun_l18_n779(x)
+    if (x < 1)
+        fun_l19_n131(x)
+    else
+        fun_l19_n396(x)
+    end
+end
+
+def fun_l18_n780(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n851(x)
+    end
+end
+
+def fun_l18_n781(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n569(x)
+    end
+end
+
+def fun_l18_n782(x)
+    if (x < 1)
+        fun_l19_n121(x)
+    else
+        fun_l19_n690(x)
+    end
+end
+
+def fun_l18_n783(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n522(x)
+    end
+end
+
+def fun_l18_n784(x)
+    if (x < 1)
+        fun_l19_n212(x)
+    else
+        fun_l19_n199(x)
+    end
+end
+
+def fun_l18_n785(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n948(x)
+    end
+end
+
+def fun_l18_n786(x)
+    if (x < 1)
+        fun_l19_n288(x)
+    else
+        fun_l19_n631(x)
+    end
+end
+
+def fun_l18_n787(x)
+    if (x < 1)
+        fun_l19_n713(x)
+    else
+        fun_l19_n232(x)
+    end
+end
+
+def fun_l18_n788(x)
+    if (x < 1)
+        fun_l19_n6(x)
+    else
+        fun_l19_n725(x)
+    end
+end
+
+def fun_l18_n789(x)
+    if (x < 1)
+        fun_l19_n893(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n790(x)
+    if (x < 1)
+        fun_l19_n734(x)
+    else
+        fun_l19_n589(x)
+    end
+end
+
+def fun_l18_n791(x)
+    if (x < 1)
+        fun_l19_n369(x)
+    else
+        fun_l19_n710(x)
+    end
+end
+
+def fun_l18_n792(x)
+    if (x < 1)
+        fun_l19_n373(x)
+    else
+        fun_l19_n226(x)
+    end
+end
+
+def fun_l18_n793(x)
+    if (x < 1)
+        fun_l19_n651(x)
+    else
+        fun_l19_n292(x)
+    end
+end
+
+def fun_l18_n794(x)
+    if (x < 1)
+        fun_l19_n625(x)
+    else
+        fun_l19_n494(x)
+    end
+end
+
+def fun_l18_n795(x)
+    if (x < 1)
+        fun_l19_n463(x)
+    else
+        fun_l19_n113(x)
+    end
+end
+
+def fun_l18_n796(x)
+    if (x < 1)
+        fun_l19_n857(x)
+    else
+        fun_l19_n561(x)
+    end
+end
+
+def fun_l18_n797(x)
+    if (x < 1)
+        fun_l19_n845(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n798(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n822(x)
+    end
+end
+
+def fun_l18_n799(x)
+    if (x < 1)
+        fun_l19_n649(x)
+    else
+        fun_l19_n610(x)
+    end
+end
+
+def fun_l18_n800(x)
+    if (x < 1)
+        fun_l19_n619(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n801(x)
+    if (x < 1)
+        fun_l19_n947(x)
+    else
+        fun_l19_n665(x)
+    end
+end
+
+def fun_l18_n802(x)
+    if (x < 1)
+        fun_l19_n869(x)
+    else
+        fun_l19_n928(x)
+    end
+end
+
+def fun_l18_n803(x)
+    if (x < 1)
+        fun_l19_n568(x)
+    else
+        fun_l19_n624(x)
+    end
+end
+
+def fun_l18_n804(x)
+    if (x < 1)
+        fun_l19_n724(x)
+    else
+        fun_l19_n104(x)
+    end
+end
+
+def fun_l18_n805(x)
+    if (x < 1)
+        fun_l19_n687(x)
+    else
+        fun_l19_n906(x)
+    end
+end
+
+def fun_l18_n806(x)
+    if (x < 1)
+        fun_l19_n387(x)
+    else
+        fun_l19_n317(x)
+    end
+end
+
+def fun_l18_n807(x)
+    if (x < 1)
+        fun_l19_n433(x)
+    else
+        fun_l19_n211(x)
+    end
+end
+
+def fun_l18_n808(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n848(x)
+    end
+end
+
+def fun_l18_n809(x)
+    if (x < 1)
+        fun_l19_n929(x)
+    else
+        fun_l19_n751(x)
+    end
+end
+
+def fun_l18_n810(x)
+    if (x < 1)
+        fun_l19_n24(x)
+    else
+        fun_l19_n97(x)
+    end
+end
+
+def fun_l18_n811(x)
+    if (x < 1)
+        fun_l19_n503(x)
+    else
+        fun_l19_n173(x)
+    end
+end
+
+def fun_l18_n812(x)
+    if (x < 1)
+        fun_l19_n431(x)
+    else
+        fun_l19_n553(x)
+    end
+end
+
+def fun_l18_n813(x)
+    if (x < 1)
+        fun_l19_n215(x)
+    else
+        fun_l19_n920(x)
+    end
+end
+
+def fun_l18_n814(x)
+    if (x < 1)
+        fun_l19_n952(x)
+    else
+        fun_l19_n484(x)
+    end
+end
+
+def fun_l18_n815(x)
+    if (x < 1)
+        fun_l19_n253(x)
+    else
+        fun_l19_n20(x)
+    end
+end
+
+def fun_l18_n816(x)
+    if (x < 1)
+        fun_l19_n853(x)
+    else
+        fun_l19_n902(x)
+    end
+end
+
+def fun_l18_n817(x)
+    if (x < 1)
+        fun_l19_n606(x)
+    else
+        fun_l19_n732(x)
+    end
+end
+
+def fun_l18_n818(x)
+    if (x < 1)
+        fun_l19_n227(x)
+    else
+        fun_l19_n908(x)
+    end
+end
+
+def fun_l18_n819(x)
+    if (x < 1)
+        fun_l19_n423(x)
+    else
+        fun_l19_n511(x)
+    end
+end
+
+def fun_l18_n820(x)
+    if (x < 1)
+        fun_l19_n25(x)
+    else
+        fun_l19_n939(x)
+    end
+end
+
+def fun_l18_n821(x)
+    if (x < 1)
+        fun_l19_n709(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n822(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n41(x)
+    end
+end
+
+def fun_l18_n823(x)
+    if (x < 1)
+        fun_l19_n764(x)
+    else
+        fun_l19_n240(x)
+    end
+end
+
+def fun_l18_n824(x)
+    if (x < 1)
+        fun_l19_n508(x)
+    else
+        fun_l19_n505(x)
+    end
+end
+
+def fun_l18_n825(x)
+    if (x < 1)
+        fun_l19_n788(x)
+    else
+        fun_l19_n245(x)
+    end
+end
+
+def fun_l18_n826(x)
+    if (x < 1)
+        fun_l19_n315(x)
+    else
+        fun_l19_n391(x)
+    end
+end
+
+def fun_l18_n827(x)
+    if (x < 1)
+        fun_l19_n210(x)
+    else
+        fun_l19_n17(x)
+    end
+end
+
+def fun_l18_n828(x)
+    if (x < 1)
+        fun_l19_n726(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n829(x)
+    if (x < 1)
+        fun_l19_n228(x)
+    else
+        fun_l19_n44(x)
+    end
+end
+
+def fun_l18_n830(x)
+    if (x < 1)
+        fun_l19_n5(x)
+    else
+        fun_l19_n110(x)
+    end
+end
+
+def fun_l18_n831(x)
+    if (x < 1)
+        fun_l19_n409(x)
+    else
+        fun_l19_n874(x)
+    end
+end
+
+def fun_l18_n832(x)
+    if (x < 1)
+        fun_l19_n710(x)
+    else
+        fun_l19_n960(x)
+    end
+end
+
+def fun_l18_n833(x)
+    if (x < 1)
+        fun_l19_n92(x)
+    else
+        fun_l19_n869(x)
+    end
+end
+
+def fun_l18_n834(x)
+    if (x < 1)
+        fun_l19_n420(x)
+    else
+        fun_l19_n616(x)
+    end
+end
+
+def fun_l18_n835(x)
+    if (x < 1)
+        fun_l19_n705(x)
+    else
+        fun_l19_n727(x)
+    end
+end
+
+def fun_l18_n836(x)
+    if (x < 1)
+        fun_l19_n78(x)
+    else
+        fun_l19_n211(x)
+    end
+end
+
+def fun_l18_n837(x)
+    if (x < 1)
+        fun_l19_n214(x)
+    else
+        fun_l19_n504(x)
+    end
+end
+
+def fun_l18_n838(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n303(x)
+    end
+end
+
+def fun_l18_n839(x)
+    if (x < 1)
+        fun_l19_n168(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n840(x)
+    if (x < 1)
+        fun_l19_n523(x)
+    else
+        fun_l19_n183(x)
+    end
+end
+
+def fun_l18_n841(x)
+    if (x < 1)
+        fun_l19_n757(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n842(x)
+    if (x < 1)
+        fun_l19_n309(x)
+    else
+        fun_l19_n70(x)
+    end
+end
+
+def fun_l18_n843(x)
+    if (x < 1)
+        fun_l19_n316(x)
+    else
+        fun_l19_n758(x)
+    end
+end
+
+def fun_l18_n844(x)
+    if (x < 1)
+        fun_l19_n459(x)
+    else
+        fun_l19_n28(x)
+    end
+end
+
+def fun_l18_n845(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n597(x)
+    end
+end
+
+def fun_l18_n846(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n480(x)
+    end
+end
+
+def fun_l18_n847(x)
+    if (x < 1)
+        fun_l19_n967(x)
+    else
+        fun_l19_n764(x)
+    end
+end
+
+def fun_l18_n848(x)
+    if (x < 1)
+        fun_l19_n248(x)
+    else
+        fun_l19_n459(x)
+    end
+end
+
+def fun_l18_n849(x)
+    if (x < 1)
+        fun_l19_n306(x)
+    else
+        fun_l19_n892(x)
+    end
+end
+
+def fun_l18_n850(x)
+    if (x < 1)
+        fun_l19_n541(x)
+    else
+        fun_l19_n745(x)
+    end
+end
+
+def fun_l18_n851(x)
+    if (x < 1)
+        fun_l19_n974(x)
+    else
+        fun_l19_n593(x)
+    end
+end
+
+def fun_l18_n852(x)
+    if (x < 1)
+        fun_l19_n564(x)
+    else
+        fun_l19_n598(x)
+    end
+end
+
+def fun_l18_n853(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n207(x)
+    end
+end
+
+def fun_l18_n854(x)
+    if (x < 1)
+        fun_l19_n261(x)
+    else
+        fun_l19_n35(x)
+    end
+end
+
+def fun_l18_n855(x)
+    if (x < 1)
+        fun_l19_n597(x)
+    else
+        fun_l19_n898(x)
+    end
+end
+
+def fun_l18_n856(x)
+    if (x < 1)
+        fun_l19_n97(x)
+    else
+        fun_l19_n109(x)
+    end
+end
+
+def fun_l18_n857(x)
+    if (x < 1)
+        fun_l19_n487(x)
+    else
+        fun_l19_n423(x)
+    end
+end
+
+def fun_l18_n858(x)
+    if (x < 1)
+        fun_l19_n804(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n859(x)
+    if (x < 1)
+        fun_l19_n935(x)
+    else
+        fun_l19_n952(x)
+    end
+end
+
+def fun_l18_n860(x)
+    if (x < 1)
+        fun_l19_n149(x)
+    else
+        fun_l19_n586(x)
+    end
+end
+
+def fun_l18_n861(x)
+    if (x < 1)
+        fun_l19_n750(x)
+    else
+        fun_l19_n962(x)
+    end
+end
+
+def fun_l18_n862(x)
+    if (x < 1)
+        fun_l19_n396(x)
+    else
+        fun_l19_n324(x)
+    end
+end
+
+def fun_l18_n863(x)
+    if (x < 1)
+        fun_l19_n231(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n864(x)
+    if (x < 1)
+        fun_l19_n239(x)
+    else
+        fun_l19_n118(x)
+    end
+end
+
+def fun_l18_n865(x)
+    if (x < 1)
+        fun_l19_n221(x)
+    else
+        fun_l19_n771(x)
+    end
+end
+
+def fun_l18_n866(x)
+    if (x < 1)
+        fun_l19_n258(x)
+    else
+        fun_l19_n868(x)
+    end
+end
+
+def fun_l18_n867(x)
+    if (x < 1)
+        fun_l19_n629(x)
+    else
+        fun_l19_n491(x)
+    end
+end
+
+def fun_l18_n868(x)
+    if (x < 1)
+        fun_l19_n685(x)
+    else
+        fun_l19_n532(x)
+    end
+end
+
+def fun_l18_n869(x)
+    if (x < 1)
+        fun_l19_n45(x)
+    else
+        fun_l19_n769(x)
+    end
+end
+
+def fun_l18_n870(x)
+    if (x < 1)
+        fun_l19_n249(x)
+    else
+        fun_l19_n677(x)
+    end
+end
+
+def fun_l18_n871(x)
+    if (x < 1)
+        fun_l19_n685(x)
+    else
+        fun_l19_n953(x)
+    end
+end
+
+def fun_l18_n872(x)
+    if (x < 1)
+        fun_l19_n270(x)
+    else
+        fun_l19_n208(x)
+    end
+end
+
+def fun_l18_n873(x)
+    if (x < 1)
+        fun_l19_n195(x)
+    else
+        fun_l19_n811(x)
+    end
+end
+
+def fun_l18_n874(x)
+    if (x < 1)
+        fun_l19_n700(x)
+    else
+        fun_l19_n331(x)
+    end
+end
+
+def fun_l18_n875(x)
+    if (x < 1)
+        fun_l19_n209(x)
+    else
+        fun_l19_n304(x)
+    end
+end
+
+def fun_l18_n876(x)
+    if (x < 1)
+        fun_l19_n897(x)
+    else
+        fun_l19_n98(x)
+    end
+end
+
+def fun_l18_n877(x)
+    if (x < 1)
+        fun_l19_n400(x)
+    else
+        fun_l19_n325(x)
+    end
+end
+
+def fun_l18_n878(x)
+    if (x < 1)
+        fun_l19_n312(x)
+    else
+        fun_l19_n872(x)
+    end
+end
+
+def fun_l18_n879(x)
+    if (x < 1)
+        fun_l19_n669(x)
+    else
+        fun_l19_n729(x)
+    end
+end
+
+def fun_l18_n880(x)
+    if (x < 1)
+        fun_l19_n644(x)
+    else
+        fun_l19_n243(x)
+    end
+end
+
+def fun_l18_n881(x)
+    if (x < 1)
+        fun_l19_n440(x)
+    else
+        fun_l19_n495(x)
+    end
+end
+
+def fun_l18_n882(x)
+    if (x < 1)
+        fun_l19_n694(x)
+    else
+        fun_l19_n189(x)
+    end
+end
+
+def fun_l18_n883(x)
+    if (x < 1)
+        fun_l19_n610(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n884(x)
+    if (x < 1)
+        fun_l19_n69(x)
+    else
+        fun_l19_n129(x)
+    end
+end
+
+def fun_l18_n885(x)
+    if (x < 1)
+        fun_l19_n837(x)
+    else
+        fun_l19_n521(x)
+    end
+end
+
+def fun_l18_n886(x)
+    if (x < 1)
+        fun_l19_n204(x)
+    else
+        fun_l19_n284(x)
+    end
+end
+
+def fun_l18_n887(x)
+    if (x < 1)
+        fun_l19_n2(x)
+    else
+        fun_l19_n378(x)
+    end
+end
+
+def fun_l18_n888(x)
+    if (x < 1)
+        fun_l19_n410(x)
+    else
+        fun_l19_n871(x)
+    end
+end
+
+def fun_l18_n889(x)
+    if (x < 1)
+        fun_l19_n976(x)
+    else
+        fun_l19_n581(x)
+    end
+end
+
+def fun_l18_n890(x)
+    if (x < 1)
+        fun_l19_n274(x)
+    else
+        fun_l19_n57(x)
+    end
+end
+
+def fun_l18_n891(x)
+    if (x < 1)
+        fun_l19_n983(x)
+    else
+        fun_l19_n900(x)
+    end
+end
+
+def fun_l18_n892(x)
+    if (x < 1)
+        fun_l19_n351(x)
+    else
+        fun_l19_n621(x)
+    end
+end
+
+def fun_l18_n893(x)
+    if (x < 1)
+        fun_l19_n539(x)
+    else
+        fun_l19_n847(x)
+    end
+end
+
+def fun_l18_n894(x)
+    if (x < 1)
+        fun_l19_n56(x)
+    else
+        fun_l19_n918(x)
+    end
+end
+
+def fun_l18_n895(x)
+    if (x < 1)
+        fun_l19_n906(x)
+    else
+        fun_l19_n509(x)
+    end
+end
+
+def fun_l18_n896(x)
+    if (x < 1)
+        fun_l19_n64(x)
+    else
+        fun_l19_n269(x)
+    end
+end
+
+def fun_l18_n897(x)
+    if (x < 1)
+        fun_l19_n348(x)
+    else
+        fun_l19_n983(x)
+    end
+end
+
+def fun_l18_n898(x)
+    if (x < 1)
+        fun_l19_n699(x)
+    else
+        fun_l19_n322(x)
+    end
+end
+
+def fun_l18_n899(x)
+    if (x < 1)
+        fun_l19_n754(x)
+    else
+        fun_l19_n608(x)
+    end
+end
+
+def fun_l18_n900(x)
+    if (x < 1)
+        fun_l19_n530(x)
+    else
+        fun_l19_n919(x)
+    end
+end
+
+def fun_l18_n901(x)
+    if (x < 1)
+        fun_l19_n359(x)
+    else
+        fun_l19_n739(x)
+    end
+end
+
+def fun_l18_n902(x)
+    if (x < 1)
+        fun_l19_n647(x)
+    else
+        fun_l19_n389(x)
+    end
+end
+
+def fun_l18_n903(x)
+    if (x < 1)
+        fun_l19_n908(x)
+    else
+        fun_l19_n680(x)
+    end
+end
+
+def fun_l18_n904(x)
+    if (x < 1)
+        fun_l19_n78(x)
+    else
+        fun_l19_n512(x)
+    end
+end
+
+def fun_l18_n905(x)
+    if (x < 1)
+        fun_l19_n514(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n906(x)
+    if (x < 1)
+        fun_l19_n320(x)
+    else
+        fun_l19_n393(x)
+    end
+end
+
+def fun_l18_n907(x)
+    if (x < 1)
+        fun_l19_n666(x)
+    else
+        fun_l19_n846(x)
+    end
+end
+
+def fun_l18_n908(x)
+    if (x < 1)
+        fun_l19_n757(x)
+    else
+        fun_l19_n194(x)
+    end
+end
+
+def fun_l18_n909(x)
+    if (x < 1)
+        fun_l19_n386(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n910(x)
+    if (x < 1)
+        fun_l19_n561(x)
+    else
+        fun_l19_n897(x)
+    end
+end
+
+def fun_l18_n911(x)
+    if (x < 1)
+        fun_l19_n281(x)
+    else
+        fun_l19_n960(x)
+    end
+end
+
+def fun_l18_n912(x)
+    if (x < 1)
+        fun_l19_n215(x)
+    else
+        fun_l19_n54(x)
+    end
+end
+
+def fun_l18_n913(x)
+    if (x < 1)
+        fun_l19_n561(x)
+    else
+        fun_l19_n353(x)
+    end
+end
+
+def fun_l18_n914(x)
+    if (x < 1)
+        fun_l19_n780(x)
+    else
+        fun_l19_n924(x)
+    end
+end
+
+def fun_l18_n915(x)
+    if (x < 1)
+        fun_l19_n663(x)
+    else
+        fun_l19_n112(x)
+    end
+end
+
+def fun_l18_n916(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n342(x)
+    end
+end
+
+def fun_l18_n917(x)
+    if (x < 1)
+        fun_l19_n226(x)
+    else
+        fun_l19_n337(x)
+    end
+end
+
+def fun_l18_n918(x)
+    if (x < 1)
+        fun_l19_n477(x)
+    else
+        fun_l19_n12(x)
+    end
+end
+
+def fun_l18_n919(x)
+    if (x < 1)
+        fun_l19_n495(x)
+    else
+        fun_l19_n721(x)
+    end
+end
+
+def fun_l18_n920(x)
+    if (x < 1)
+        fun_l19_n551(x)
+    else
+        fun_l19_n626(x)
+    end
+end
+
+def fun_l18_n921(x)
+    if (x < 1)
+        fun_l19_n491(x)
+    else
+        fun_l19_n442(x)
+    end
+end
+
+def fun_l18_n922(x)
+    if (x < 1)
+        fun_l19_n72(x)
+    else
+        fun_l19_n165(x)
+    end
+end
+
+def fun_l18_n923(x)
+    if (x < 1)
+        fun_l19_n475(x)
+    else
+        fun_l19_n381(x)
+    end
+end
+
+def fun_l18_n924(x)
+    if (x < 1)
+        fun_l19_n655(x)
+    else
+        fun_l19_n95(x)
+    end
+end
+
+def fun_l18_n925(x)
+    if (x < 1)
+        fun_l19_n882(x)
+    else
+        fun_l19_n888(x)
+    end
+end
+
+def fun_l18_n926(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n85(x)
+    end
+end
+
+def fun_l18_n927(x)
+    if (x < 1)
+        fun_l19_n13(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n928(x)
+    if (x < 1)
+        fun_l19_n797(x)
+    else
+        fun_l19_n547(x)
+    end
+end
+
+def fun_l18_n929(x)
+    if (x < 1)
+        fun_l19_n34(x)
+    else
+        fun_l19_n753(x)
+    end
+end
+
+def fun_l18_n930(x)
+    if (x < 1)
+        fun_l19_n894(x)
+    else
+        fun_l19_n527(x)
+    end
+end
+
+def fun_l18_n931(x)
+    if (x < 1)
+        fun_l19_n951(x)
+    else
+        fun_l19_n261(x)
+    end
+end
+
+def fun_l18_n932(x)
+    if (x < 1)
+        fun_l19_n178(x)
+    else
+        fun_l19_n365(x)
+    end
+end
+
+def fun_l18_n933(x)
+    if (x < 1)
+        fun_l19_n813(x)
+    else
+        fun_l19_n404(x)
+    end
+end
+
+def fun_l18_n934(x)
+    if (x < 1)
+        fun_l19_n920(x)
+    else
+        fun_l19_n674(x)
+    end
+end
+
+def fun_l18_n935(x)
+    if (x < 1)
+        fun_l19_n155(x)
+    else
+        fun_l19_n250(x)
+    end
+end
+
+def fun_l18_n936(x)
+    if (x < 1)
+        fun_l19_n376(x)
+    else
+        fun_l19_n29(x)
+    end
+end
+
+def fun_l18_n937(x)
+    if (x < 1)
+        fun_l19_n104(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n938(x)
+    if (x < 1)
+        fun_l19_n340(x)
+    else
+        fun_l19_n424(x)
+    end
+end
+
+def fun_l18_n939(x)
+    if (x < 1)
+        fun_l19_n590(x)
+    else
+        fun_l19_n525(x)
+    end
+end
+
+def fun_l18_n940(x)
+    if (x < 1)
+        fun_l19_n15(x)
+    else
+        fun_l19_n48(x)
+    end
+end
+
+def fun_l18_n941(x)
+    if (x < 1)
+        fun_l19_n83(x)
+    else
+        fun_l19_n975(x)
+    end
+end
+
+def fun_l18_n942(x)
+    if (x < 1)
+        fun_l19_n219(x)
+    else
+        fun_l19_n173(x)
+    end
+end
+
+def fun_l18_n943(x)
+    if (x < 1)
+        fun_l19_n457(x)
+    else
+        fun_l19_n956(x)
+    end
+end
+
+def fun_l18_n944(x)
+    if (x < 1)
+        fun_l19_n900(x)
+    else
+        fun_l19_n363(x)
+    end
+end
+
+def fun_l18_n945(x)
+    if (x < 1)
+        fun_l19_n973(x)
+    else
+        fun_l19_n279(x)
+    end
+end
+
+def fun_l18_n946(x)
+    if (x < 1)
+        fun_l19_n155(x)
+    else
+        fun_l19_n554(x)
+    end
+end
+
+def fun_l18_n947(x)
+    if (x < 1)
+        fun_l19_n744(x)
+    else
+        fun_l19_n854(x)
+    end
+end
+
+def fun_l18_n948(x)
+    if (x < 1)
+        fun_l19_n574(x)
+    else
+        fun_l19_n385(x)
+    end
+end
+
+def fun_l18_n949(x)
+    if (x < 1)
+        fun_l19_n447(x)
+    else
+        fun_l19_n93(x)
+    end
+end
+
+def fun_l18_n950(x)
+    if (x < 1)
+        fun_l19_n621(x)
+    else
+        fun_l19_n467(x)
+    end
+end
+
+def fun_l18_n951(x)
+    if (x < 1)
+        fun_l19_n409(x)
+    else
+        fun_l19_n260(x)
+    end
+end
+
+def fun_l18_n952(x)
+    if (x < 1)
+        fun_l19_n992(x)
+    else
+        fun_l19_n728(x)
+    end
+end
+
+def fun_l18_n953(x)
+    if (x < 1)
+        fun_l19_n760(x)
+    else
+        fun_l19_n724(x)
+    end
+end
+
+def fun_l18_n954(x)
+    if (x < 1)
+        fun_l19_n567(x)
+    else
+        fun_l19_n857(x)
+    end
+end
+
+def fun_l18_n955(x)
+    if (x < 1)
+        fun_l19_n225(x)
+    else
+        fun_l19_n132(x)
+    end
+end
+
+def fun_l18_n956(x)
+    if (x < 1)
+        fun_l19_n856(x)
+    else
+        fun_l19_n449(x)
+    end
+end
+
+def fun_l18_n957(x)
+    if (x < 1)
+        fun_l19_n200(x)
+    else
+        fun_l19_n216(x)
+    end
+end
+
+def fun_l18_n958(x)
+    if (x < 1)
+        fun_l19_n684(x)
+    else
+        fun_l19_n151(x)
+    end
+end
+
+def fun_l18_n959(x)
+    if (x < 1)
+        fun_l19_n989(x)
+    else
+        fun_l19_n137(x)
+    end
+end
+
+def fun_l18_n960(x)
+    if (x < 1)
+        fun_l19_n207(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n961(x)
+    if (x < 1)
+        fun_l19_n984(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n962(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n155(x)
+    end
+end
+
+def fun_l18_n963(x)
+    if (x < 1)
+        fun_l19_n202(x)
+    else
+        fun_l19_n237(x)
+    end
+end
+
+def fun_l18_n964(x)
+    if (x < 1)
+        fun_l19_n932(x)
+    else
+        fun_l19_n167(x)
+    end
+end
+
+def fun_l18_n965(x)
+    if (x < 1)
+        fun_l19_n269(x)
+    else
+        fun_l19_n105(x)
+    end
+end
+
+def fun_l18_n966(x)
+    if (x < 1)
+        fun_l19_n775(x)
+    else
+        fun_l19_n776(x)
+    end
+end
+
+def fun_l18_n967(x)
+    if (x < 1)
+        fun_l19_n636(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n968(x)
+    if (x < 1)
+        fun_l19_n335(x)
+    else
+        fun_l19_n4(x)
+    end
+end
+
+def fun_l18_n969(x)
+    if (x < 1)
+        fun_l19_n987(x)
+    else
+        fun_l19_n935(x)
+    end
+end
+
+def fun_l18_n970(x)
+    if (x < 1)
+        fun_l19_n692(x)
+    else
+        fun_l19_n20(x)
+    end
+end
+
+def fun_l18_n971(x)
+    if (x < 1)
+        fun_l19_n805(x)
+    else
+        fun_l19_n139(x)
+    end
+end
+
+def fun_l18_n972(x)
+    if (x < 1)
+        fun_l19_n53(x)
+    else
+        fun_l19_n539(x)
+    end
+end
+
+def fun_l18_n973(x)
+    if (x < 1)
+        fun_l19_n620(x)
+    else
+        fun_l19_n680(x)
+    end
+end
+
+def fun_l18_n974(x)
+    if (x < 1)
+        fun_l19_n662(x)
+    else
+        fun_l19_n580(x)
+    end
+end
+
+def fun_l18_n975(x)
+    if (x < 1)
+        fun_l19_n401(x)
+    else
+        fun_l19_n428(x)
+    end
+end
+
+def fun_l18_n976(x)
+    if (x < 1)
+        fun_l19_n367(x)
+    else
+        fun_l19_n794(x)
+    end
+end
+
+def fun_l18_n977(x)
+    if (x < 1)
+        fun_l19_n204(x)
+    else
+        fun_l19_n258(x)
+    end
+end
+
+def fun_l18_n978(x)
+    if (x < 1)
+        fun_l19_n868(x)
+    else
+        fun_l19_n300(x)
+    end
+end
+
+def fun_l18_n979(x)
+    if (x < 1)
+        fun_l19_n245(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n980(x)
+    if (x < 1)
+        fun_l19_n965(x)
+    else
+        fun_l19_n639(x)
+    end
+end
+
+def fun_l18_n981(x)
+    if (x < 1)
+        fun_l19_n903(x)
+    else
+        fun_l19_n139(x)
+    end
+end
+
+def fun_l18_n982(x)
+    if (x < 1)
+        fun_l19_n890(x)
+    else
+        fun_l19_n497(x)
+    end
+end
+
+def fun_l18_n983(x)
+    if (x < 1)
+        fun_l19_n723(x)
+    else
+        fun_l19_n705(x)
+    end
+end
+
+def fun_l18_n984(x)
+    if (x < 1)
+        fun_l19_n592(x)
+    else
+        fun_l19_n965(x)
+    end
+end
+
+def fun_l18_n985(x)
+    if (x < 1)
+        fun_l19_n660(x)
+    else
+        fun_l19_n985(x)
+    end
+end
+
+def fun_l18_n986(x)
+    if (x < 1)
+        fun_l19_n230(x)
+    else
+        fun_l19_n447(x)
+    end
+end
+
+def fun_l18_n987(x)
+    if (x < 1)
+        fun_l19_n875(x)
+    else
+        fun_l19_n86(x)
+    end
+end
+
+def fun_l18_n988(x)
+    if (x < 1)
+        fun_l19_n864(x)
+    else
+        fun_l19_n460(x)
+    end
+end
+
+def fun_l18_n989(x)
+    if (x < 1)
+        fun_l19_n834(x)
+    else
+        fun_l19_n628(x)
+    end
+end
+
+def fun_l18_n990(x)
+    if (x < 1)
+        fun_l19_n578(x)
+    else
+        fun_l19_n160(x)
+    end
+end
+
+def fun_l18_n991(x)
+    if (x < 1)
+        fun_l19_n58(x)
+    else
+        fun_l19_n839(x)
+    end
+end
+
+def fun_l18_n992(x)
+    if (x < 1)
+        fun_l19_n282(x)
+    else
+        fun_l19_n864(x)
+    end
+end
+
+def fun_l18_n993(x)
+    if (x < 1)
+        fun_l19_n957(x)
+    else
+        fun_l19_n280(x)
+    end
+end
+
+def fun_l18_n994(x)
+    if (x < 1)
+        fun_l19_n184(x)
+    else
+        fun_l19_n741(x)
+    end
+end
+
+def fun_l18_n995(x)
+    if (x < 1)
+        fun_l19_n458(x)
+    else
+        fun_l19_n802(x)
+    end
+end
+
+def fun_l18_n996(x)
+    if (x < 1)
+        fun_l19_n260(x)
+    else
+        fun_l19_n840(x)
+    end
+end
+
+def fun_l18_n997(x)
+    if (x < 1)
+        fun_l19_n500(x)
+    else
+        fun_l19_n142(x)
+    end
+end
+
+def fun_l18_n998(x)
+    if (x < 1)
+        fun_l19_n712(x)
+    else
+        fun_l19_n736(x)
+    end
+end
+
+def fun_l18_n999(x)
+    if (x < 1)
+        fun_l19_n366(x)
+    else
+        fun_l19_n726(x)
+    end
+end
+
+def fun_l19_n0(x)
+    if (x < 1)
+        fun_l20_n238(x)
+    else
+        fun_l20_n685(x)
+    end
+end
+
+def fun_l19_n1(x)
+    if (x < 1)
+        fun_l20_n892(x)
+    else
+        fun_l20_n786(x)
+    end
+end
+
+def fun_l19_n2(x)
+    if (x < 1)
+        fun_l20_n99(x)
+    else
+        fun_l20_n337(x)
+    end
+end
+
+def fun_l19_n3(x)
+    if (x < 1)
+        fun_l20_n40(x)
+    else
+        fun_l20_n773(x)
+    end
+end
+
+def fun_l19_n4(x)
+    if (x < 1)
+        fun_l20_n815(x)
+    else
+        fun_l20_n576(x)
+    end
+end
+
+def fun_l19_n5(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n362(x)
+    end
+end
+
+def fun_l19_n6(x)
+    if (x < 1)
+        fun_l20_n352(x)
+    else
+        fun_l20_n263(x)
+    end
+end
+
+def fun_l19_n7(x)
+    if (x < 1)
+        fun_l20_n920(x)
+    else
+        fun_l20_n164(x)
+    end
+end
+
+def fun_l19_n8(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n663(x)
+    end
+end
+
+def fun_l19_n9(x)
+    if (x < 1)
+        fun_l20_n261(x)
+    else
+        fun_l20_n769(x)
+    end
+end
+
+def fun_l19_n10(x)
+    if (x < 1)
+        fun_l20_n85(x)
+    else
+        fun_l20_n243(x)
+    end
+end
+
+def fun_l19_n11(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n969(x)
+    end
+end
+
+def fun_l19_n12(x)
+    if (x < 1)
+        fun_l20_n954(x)
+    else
+        fun_l20_n340(x)
+    end
+end
+
+def fun_l19_n13(x)
+    if (x < 1)
+        fun_l20_n548(x)
+    else
+        fun_l20_n689(x)
+    end
+end
+
+def fun_l19_n14(x)
+    if (x < 1)
+        fun_l20_n577(x)
+    else
+        fun_l20_n954(x)
+    end
+end
+
+def fun_l19_n15(x)
+    if (x < 1)
+        fun_l20_n43(x)
+    else
+        fun_l20_n3(x)
+    end
+end
+
+def fun_l19_n16(x)
+    if (x < 1)
+        fun_l20_n15(x)
+    else
+        fun_l20_n281(x)
+    end
+end
+
+def fun_l19_n17(x)
+    if (x < 1)
+        fun_l20_n439(x)
+    else
+        fun_l20_n26(x)
+    end
+end
+
+def fun_l19_n18(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n419(x)
+    end
+end
+
+def fun_l19_n19(x)
+    if (x < 1)
+        fun_l20_n456(x)
+    else
+        fun_l20_n959(x)
+    end
+end
+
+def fun_l19_n20(x)
+    if (x < 1)
+        fun_l20_n706(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n21(x)
+    if (x < 1)
+        fun_l20_n559(x)
+    else
+        fun_l20_n61(x)
+    end
+end
+
+def fun_l19_n22(x)
+    if (x < 1)
+        fun_l20_n986(x)
+    else
+        fun_l20_n202(x)
+    end
+end
+
+def fun_l19_n23(x)
+    if (x < 1)
+        fun_l20_n935(x)
+    else
+        fun_l20_n804(x)
+    end
+end
+
+def fun_l19_n24(x)
+    if (x < 1)
+        fun_l20_n775(x)
+    else
+        fun_l20_n909(x)
+    end
+end
+
+def fun_l19_n25(x)
+    if (x < 1)
+        fun_l20_n28(x)
+    else
+        fun_l20_n631(x)
+    end
+end
+
+def fun_l19_n26(x)
+    if (x < 1)
+        fun_l20_n257(x)
+    else
+        fun_l20_n822(x)
+    end
+end
+
+def fun_l19_n27(x)
+    if (x < 1)
+        fun_l20_n198(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n28(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n46(x)
+    end
+end
+
+def fun_l19_n29(x)
+    if (x < 1)
+        fun_l20_n880(x)
+    else
+        fun_l20_n995(x)
+    end
+end
+
+def fun_l19_n30(x)
+    if (x < 1)
+        fun_l20_n953(x)
+    else
+        fun_l20_n367(x)
+    end
+end
+
+def fun_l19_n31(x)
+    if (x < 1)
+        fun_l20_n165(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n32(x)
+    if (x < 1)
+        fun_l20_n752(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n33(x)
+    if (x < 1)
+        fun_l20_n973(x)
+    else
+        fun_l20_n357(x)
+    end
+end
+
+def fun_l19_n34(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n501(x)
+    end
+end
+
+def fun_l19_n35(x)
+    if (x < 1)
+        fun_l20_n607(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n36(x)
+    if (x < 1)
+        fun_l20_n870(x)
+    else
+        fun_l20_n590(x)
+    end
+end
+
+def fun_l19_n37(x)
+    if (x < 1)
+        fun_l20_n620(x)
+    else
+        fun_l20_n462(x)
+    end
+end
+
+def fun_l19_n38(x)
+    if (x < 1)
+        fun_l20_n176(x)
+    else
+        fun_l20_n891(x)
+    end
+end
+
+def fun_l19_n39(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n730(x)
+    end
+end
+
+def fun_l19_n40(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n635(x)
+    end
+end
+
+def fun_l19_n41(x)
+    if (x < 1)
+        fun_l20_n443(x)
+    else
+        fun_l20_n398(x)
+    end
+end
+
+def fun_l19_n42(x)
+    if (x < 1)
+        fun_l20_n324(x)
+    else
+        fun_l20_n566(x)
+    end
+end
+
+def fun_l19_n43(x)
+    if (x < 1)
+        fun_l20_n817(x)
+    else
+        fun_l20_n791(x)
+    end
+end
+
+def fun_l19_n44(x)
+    if (x < 1)
+        fun_l20_n46(x)
+    else
+        fun_l20_n375(x)
+    end
+end
+
+def fun_l19_n45(x)
+    if (x < 1)
+        fun_l20_n504(x)
+    else
+        fun_l20_n64(x)
+    end
+end
+
+def fun_l19_n46(x)
+    if (x < 1)
+        fun_l20_n174(x)
+    else
+        fun_l20_n621(x)
+    end
+end
+
+def fun_l19_n47(x)
+    if (x < 1)
+        fun_l20_n756(x)
+    else
+        fun_l20_n857(x)
+    end
+end
+
+def fun_l19_n48(x)
+    if (x < 1)
+        fun_l20_n635(x)
+    else
+        fun_l20_n216(x)
+    end
+end
+
+def fun_l19_n49(x)
+    if (x < 1)
+        fun_l20_n806(x)
+    else
+        fun_l20_n291(x)
+    end
+end
+
+def fun_l19_n50(x)
+    if (x < 1)
+        fun_l20_n998(x)
+    else
+        fun_l20_n46(x)
+    end
+end
+
+def fun_l19_n51(x)
+    if (x < 1)
+        fun_l20_n685(x)
+    else
+        fun_l20_n968(x)
+    end
+end
+
+def fun_l19_n52(x)
+    if (x < 1)
+        fun_l20_n906(x)
+    else
+        fun_l20_n788(x)
+    end
+end
+
+def fun_l19_n53(x)
+    if (x < 1)
+        fun_l20_n814(x)
+    else
+        fun_l20_n343(x)
+    end
+end
+
+def fun_l19_n54(x)
+    if (x < 1)
+        fun_l20_n320(x)
+    else
+        fun_l20_n293(x)
+    end
+end
+
+def fun_l19_n55(x)
+    if (x < 1)
+        fun_l20_n608(x)
+    else
+        fun_l20_n958(x)
+    end
+end
+
+def fun_l19_n56(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n839(x)
+    end
+end
+
+def fun_l19_n57(x)
+    if (x < 1)
+        fun_l20_n618(x)
+    else
+        fun_l20_n483(x)
+    end
+end
+
+def fun_l19_n58(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n782(x)
+    end
+end
+
+def fun_l19_n59(x)
+    if (x < 1)
+        fun_l20_n664(x)
+    else
+        fun_l20_n3(x)
+    end
+end
+
+def fun_l19_n60(x)
+    if (x < 1)
+        fun_l20_n556(x)
+    else
+        fun_l20_n185(x)
+    end
+end
+
+def fun_l19_n61(x)
+    if (x < 1)
+        fun_l20_n657(x)
+    else
+        fun_l20_n162(x)
+    end
+end
+
+def fun_l19_n62(x)
+    if (x < 1)
+        fun_l20_n668(x)
+    else
+        fun_l20_n585(x)
+    end
+end
+
+def fun_l19_n63(x)
+    if (x < 1)
+        fun_l20_n913(x)
+    else
+        fun_l20_n855(x)
+    end
+end
+
+def fun_l19_n64(x)
+    if (x < 1)
+        fun_l20_n331(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n65(x)
+    if (x < 1)
+        fun_l20_n321(x)
+    else
+        fun_l20_n314(x)
+    end
+end
+
+def fun_l19_n66(x)
+    if (x < 1)
+        fun_l20_n512(x)
+    else
+        fun_l20_n607(x)
+    end
+end
+
+def fun_l19_n67(x)
+    if (x < 1)
+        fun_l20_n649(x)
+    else
+        fun_l20_n733(x)
+    end
+end
+
+def fun_l19_n68(x)
+    if (x < 1)
+        fun_l20_n651(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n69(x)
+    if (x < 1)
+        fun_l20_n510(x)
+    else
+        fun_l20_n675(x)
+    end
+end
+
+def fun_l19_n70(x)
+    if (x < 1)
+        fun_l20_n830(x)
+    else
+        fun_l20_n338(x)
+    end
+end
+
+def fun_l19_n71(x)
+    if (x < 1)
+        fun_l20_n110(x)
+    else
+        fun_l20_n806(x)
+    end
+end
+
+def fun_l19_n72(x)
+    if (x < 1)
+        fun_l20_n588(x)
+    else
+        fun_l20_n7(x)
+    end
+end
+
+def fun_l19_n73(x)
+    if (x < 1)
+        fun_l20_n495(x)
+    else
+        fun_l20_n293(x)
+    end
+end
+
+def fun_l19_n74(x)
+    if (x < 1)
+        fun_l20_n891(x)
+    else
+        fun_l20_n514(x)
+    end
+end
+
+def fun_l19_n75(x)
+    if (x < 1)
+        fun_l20_n419(x)
+    else
+        fun_l20_n934(x)
+    end
+end
+
+def fun_l19_n76(x)
+    if (x < 1)
+        fun_l20_n476(x)
+    else
+        fun_l20_n652(x)
+    end
+end
+
+def fun_l19_n77(x)
+    if (x < 1)
+        fun_l20_n927(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n78(x)
+    if (x < 1)
+        fun_l20_n361(x)
+    else
+        fun_l20_n847(x)
+    end
+end
+
+def fun_l19_n79(x)
+    if (x < 1)
+        fun_l20_n584(x)
+    else
+        fun_l20_n24(x)
+    end
+end
+
+def fun_l19_n80(x)
+    if (x < 1)
+        fun_l20_n428(x)
+    else
+        fun_l20_n219(x)
+    end
+end
+
+def fun_l19_n81(x)
+    if (x < 1)
+        fun_l20_n922(x)
+    else
+        fun_l20_n758(x)
+    end
+end
+
+def fun_l19_n82(x)
+    if (x < 1)
+        fun_l20_n188(x)
+    else
+        fun_l20_n378(x)
+    end
+end
+
+def fun_l19_n83(x)
+    if (x < 1)
+        fun_l20_n239(x)
+    else
+        fun_l20_n690(x)
+    end
+end
+
+def fun_l19_n84(x)
+    if (x < 1)
+        fun_l20_n262(x)
+    else
+        fun_l20_n162(x)
+    end
+end
+
+def fun_l19_n85(x)
+    if (x < 1)
+        fun_l20_n117(x)
+    else
+        fun_l20_n117(x)
+    end
+end
+
+def fun_l19_n86(x)
+    if (x < 1)
+        fun_l20_n154(x)
+    else
+        fun_l20_n564(x)
+    end
+end
+
+def fun_l19_n87(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n591(x)
+    end
+end
+
+def fun_l19_n88(x)
+    if (x < 1)
+        fun_l20_n529(x)
+    else
+        fun_l20_n107(x)
+    end
+end
+
+def fun_l19_n89(x)
+    if (x < 1)
+        fun_l20_n609(x)
+    else
+        fun_l20_n287(x)
+    end
+end
+
+def fun_l19_n90(x)
+    if (x < 1)
+        fun_l20_n780(x)
+    else
+        fun_l20_n397(x)
+    end
+end
+
+def fun_l19_n91(x)
+    if (x < 1)
+        fun_l20_n587(x)
+    else
+        fun_l20_n416(x)
+    end
+end
+
+def fun_l19_n92(x)
+    if (x < 1)
+        fun_l20_n784(x)
+    else
+        fun_l20_n413(x)
+    end
+end
+
+def fun_l19_n93(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n560(x)
+    end
+end
+
+def fun_l19_n94(x)
+    if (x < 1)
+        fun_l20_n126(x)
+    else
+        fun_l20_n67(x)
+    end
+end
+
+def fun_l19_n95(x)
+    if (x < 1)
+        fun_l20_n22(x)
+    else
+        fun_l20_n865(x)
+    end
+end
+
+def fun_l19_n96(x)
+    if (x < 1)
+        fun_l20_n35(x)
+    else
+        fun_l20_n160(x)
+    end
+end
+
+def fun_l19_n97(x)
+    if (x < 1)
+        fun_l20_n701(x)
+    else
+        fun_l20_n139(x)
+    end
+end
+
+def fun_l19_n98(x)
+    if (x < 1)
+        fun_l20_n488(x)
+    else
+        fun_l20_n407(x)
+    end
+end
+
+def fun_l19_n99(x)
+    if (x < 1)
+        fun_l20_n636(x)
+    else
+        fun_l20_n135(x)
+    end
+end
+
+def fun_l19_n100(x)
+    if (x < 1)
+        fun_l20_n83(x)
+    else
+        fun_l20_n923(x)
+    end
+end
+
+def fun_l19_n101(x)
+    if (x < 1)
+        fun_l20_n232(x)
+    else
+        fun_l20_n955(x)
+    end
+end
+
+def fun_l19_n102(x)
+    if (x < 1)
+        fun_l20_n816(x)
+    else
+        fun_l20_n671(x)
+    end
+end
+
+def fun_l19_n103(x)
+    if (x < 1)
+        fun_l20_n366(x)
+    else
+        fun_l20_n646(x)
+    end
+end
+
+def fun_l19_n104(x)
+    if (x < 1)
+        fun_l20_n465(x)
+    else
+        fun_l20_n659(x)
+    end
+end
+
+def fun_l19_n105(x)
+    if (x < 1)
+        fun_l20_n488(x)
+    else
+        fun_l20_n720(x)
+    end
+end
+
+def fun_l19_n106(x)
+    if (x < 1)
+        fun_l20_n278(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n107(x)
+    if (x < 1)
+        fun_l20_n630(x)
+    else
+        fun_l20_n280(x)
+    end
+end
+
+def fun_l19_n108(x)
+    if (x < 1)
+        fun_l20_n688(x)
+    else
+        fun_l20_n999(x)
+    end
+end
+
+def fun_l19_n109(x)
+    if (x < 1)
+        fun_l20_n175(x)
+    else
+        fun_l20_n633(x)
+    end
+end
+
+def fun_l19_n110(x)
+    if (x < 1)
+        fun_l20_n111(x)
+    else
+        fun_l20_n130(x)
+    end
+end
+
+def fun_l19_n111(x)
+    if (x < 1)
+        fun_l20_n405(x)
+    else
+        fun_l20_n148(x)
+    end
+end
+
+def fun_l19_n112(x)
+    if (x < 1)
+        fun_l20_n645(x)
+    else
+        fun_l20_n303(x)
+    end
+end
+
+def fun_l19_n113(x)
+    if (x < 1)
+        fun_l20_n685(x)
+    else
+        fun_l20_n122(x)
+    end
+end
+
+def fun_l19_n114(x)
+    if (x < 1)
+        fun_l20_n808(x)
+    else
+        fun_l20_n780(x)
+    end
+end
+
+def fun_l19_n115(x)
+    if (x < 1)
+        fun_l20_n136(x)
+    else
+        fun_l20_n749(x)
+    end
+end
+
+def fun_l19_n116(x)
+    if (x < 1)
+        fun_l20_n134(x)
+    else
+        fun_l20_n291(x)
+    end
+end
+
+def fun_l19_n117(x)
+    if (x < 1)
+        fun_l20_n288(x)
+    else
+        fun_l20_n759(x)
+    end
+end
+
+def fun_l19_n118(x)
+    if (x < 1)
+        fun_l20_n617(x)
+    else
+        fun_l20_n823(x)
+    end
+end
+
+def fun_l19_n119(x)
+    if (x < 1)
+        fun_l20_n412(x)
+    else
+        fun_l20_n548(x)
+    end
+end
+
+def fun_l19_n120(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n455(x)
+    end
+end
+
+def fun_l19_n121(x)
+    if (x < 1)
+        fun_l20_n105(x)
+    else
+        fun_l20_n753(x)
+    end
+end
+
+def fun_l19_n122(x)
+    if (x < 1)
+        fun_l20_n84(x)
+    else
+        fun_l20_n575(x)
+    end
+end
+
+def fun_l19_n123(x)
+    if (x < 1)
+        fun_l20_n326(x)
+    else
+        fun_l20_n858(x)
+    end
+end
+
+def fun_l19_n124(x)
+    if (x < 1)
+        fun_l20_n878(x)
+    else
+        fun_l20_n348(x)
+    end
+end
+
+def fun_l19_n125(x)
+    if (x < 1)
+        fun_l20_n285(x)
+    else
+        fun_l20_n182(x)
+    end
+end
+
+def fun_l19_n126(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n413(x)
+    end
+end
+
+def fun_l19_n127(x)
+    if (x < 1)
+        fun_l20_n597(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n128(x)
+    if (x < 1)
+        fun_l20_n642(x)
+    else
+        fun_l20_n529(x)
+    end
+end
+
+def fun_l19_n129(x)
+    if (x < 1)
+        fun_l20_n842(x)
+    else
+        fun_l20_n228(x)
+    end
+end
+
+def fun_l19_n130(x)
+    if (x < 1)
+        fun_l20_n283(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n131(x)
+    if (x < 1)
+        fun_l20_n699(x)
+    else
+        fun_l20_n135(x)
+    end
+end
+
+def fun_l19_n132(x)
+    if (x < 1)
+        fun_l20_n276(x)
+    else
+        fun_l20_n41(x)
+    end
+end
+
+def fun_l19_n133(x)
+    if (x < 1)
+        fun_l20_n734(x)
+    else
+        fun_l20_n157(x)
+    end
+end
+
+def fun_l19_n134(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n318(x)
+    end
+end
+
+def fun_l19_n135(x)
+    if (x < 1)
+        fun_l20_n345(x)
+    else
+        fun_l20_n332(x)
+    end
+end
+
+def fun_l19_n136(x)
+    if (x < 1)
+        fun_l20_n131(x)
+    else
+        fun_l20_n747(x)
+    end
+end
+
+def fun_l19_n137(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n84(x)
+    end
+end
+
+def fun_l19_n138(x)
+    if (x < 1)
+        fun_l20_n665(x)
+    else
+        fun_l20_n194(x)
+    end
+end
+
+def fun_l19_n139(x)
+    if (x < 1)
+        fun_l20_n301(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n140(x)
+    if (x < 1)
+        fun_l20_n432(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n141(x)
+    if (x < 1)
+        fun_l20_n628(x)
+    else
+        fun_l20_n268(x)
+    end
+end
+
+def fun_l19_n142(x)
+    if (x < 1)
+        fun_l20_n982(x)
+    else
+        fun_l20_n241(x)
+    end
+end
+
+def fun_l19_n143(x)
+    if (x < 1)
+        fun_l20_n35(x)
+    else
+        fun_l20_n593(x)
+    end
+end
+
+def fun_l19_n144(x)
+    if (x < 1)
+        fun_l20_n791(x)
+    else
+        fun_l20_n960(x)
+    end
+end
+
+def fun_l19_n145(x)
+    if (x < 1)
+        fun_l20_n613(x)
+    else
+        fun_l20_n366(x)
+    end
+end
+
+def fun_l19_n146(x)
+    if (x < 1)
+        fun_l20_n997(x)
+    else
+        fun_l20_n7(x)
+    end
+end
+
+def fun_l19_n147(x)
+    if (x < 1)
+        fun_l20_n206(x)
+    else
+        fun_l20_n785(x)
+    end
+end
+
+def fun_l19_n148(x)
+    if (x < 1)
+        fun_l20_n822(x)
+    else
+        fun_l20_n178(x)
+    end
+end
+
+def fun_l19_n149(x)
+    if (x < 1)
+        fun_l20_n793(x)
+    else
+        fun_l20_n860(x)
+    end
+end
+
+def fun_l19_n150(x)
+    if (x < 1)
+        fun_l20_n260(x)
+    else
+        fun_l20_n523(x)
+    end
+end
+
+def fun_l19_n151(x)
+    if (x < 1)
+        fun_l20_n848(x)
+    else
+        fun_l20_n568(x)
+    end
+end
+
+def fun_l19_n152(x)
+    if (x < 1)
+        fun_l20_n466(x)
+    else
+        fun_l20_n959(x)
+    end
+end
+
+def fun_l19_n153(x)
+    if (x < 1)
+        fun_l20_n972(x)
+    else
+        fun_l20_n780(x)
+    end
+end
+
+def fun_l19_n154(x)
+    if (x < 1)
+        fun_l20_n349(x)
+    else
+        fun_l20_n490(x)
+    end
+end
+
+def fun_l19_n155(x)
+    if (x < 1)
+        fun_l20_n658(x)
+    else
+        fun_l20_n766(x)
+    end
+end
+
+def fun_l19_n156(x)
+    if (x < 1)
+        fun_l20_n788(x)
+    else
+        fun_l20_n961(x)
+    end
+end
+
+def fun_l19_n157(x)
+    if (x < 1)
+        fun_l20_n32(x)
+    else
+        fun_l20_n155(x)
+    end
+end
+
+def fun_l19_n158(x)
+    if (x < 1)
+        fun_l20_n820(x)
+    else
+        fun_l20_n317(x)
+    end
+end
+
+def fun_l19_n159(x)
+    if (x < 1)
+        fun_l20_n818(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n160(x)
+    if (x < 1)
+        fun_l20_n82(x)
+    else
+        fun_l20_n331(x)
+    end
+end
+
+def fun_l19_n161(x)
+    if (x < 1)
+        fun_l20_n576(x)
+    else
+        fun_l20_n134(x)
+    end
+end
+
+def fun_l19_n162(x)
+    if (x < 1)
+        fun_l20_n287(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n163(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n97(x)
+    end
+end
+
+def fun_l19_n164(x)
+    if (x < 1)
+        fun_l20_n218(x)
+    else
+        fun_l20_n195(x)
+    end
+end
+
+def fun_l19_n165(x)
+    if (x < 1)
+        fun_l20_n179(x)
+    else
+        fun_l20_n566(x)
+    end
+end
+
+def fun_l19_n166(x)
+    if (x < 1)
+        fun_l20_n833(x)
+    else
+        fun_l20_n35(x)
+    end
+end
+
+def fun_l19_n167(x)
+    if (x < 1)
+        fun_l20_n595(x)
+    else
+        fun_l20_n344(x)
+    end
+end
+
+def fun_l19_n168(x)
+    if (x < 1)
+        fun_l20_n171(x)
+    else
+        fun_l20_n199(x)
+    end
+end
+
+def fun_l19_n169(x)
+    if (x < 1)
+        fun_l20_n531(x)
+    else
+        fun_l20_n385(x)
+    end
+end
+
+def fun_l19_n170(x)
+    if (x < 1)
+        fun_l20_n168(x)
+    else
+        fun_l20_n911(x)
+    end
+end
+
+def fun_l19_n171(x)
+    if (x < 1)
+        fun_l20_n767(x)
+    else
+        fun_l20_n521(x)
+    end
+end
+
+def fun_l19_n172(x)
+    if (x < 1)
+        fun_l20_n769(x)
+    else
+        fun_l20_n56(x)
+    end
+end
+
+def fun_l19_n173(x)
+    if (x < 1)
+        fun_l20_n521(x)
+    else
+        fun_l20_n600(x)
+    end
+end
+
+def fun_l19_n174(x)
+    if (x < 1)
+        fun_l20_n239(x)
+    else
+        fun_l20_n22(x)
+    end
+end
+
+def fun_l19_n175(x)
+    if (x < 1)
+        fun_l20_n963(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n176(x)
+    if (x < 1)
+        fun_l20_n989(x)
+    else
+        fun_l20_n748(x)
+    end
+end
+
+def fun_l19_n177(x)
+    if (x < 1)
+        fun_l20_n105(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n178(x)
+    if (x < 1)
+        fun_l20_n48(x)
+    else
+        fun_l20_n550(x)
+    end
+end
+
+def fun_l19_n179(x)
+    if (x < 1)
+        fun_l20_n66(x)
+    else
+        fun_l20_n595(x)
+    end
+end
+
+def fun_l19_n180(x)
+    if (x < 1)
+        fun_l20_n692(x)
+    else
+        fun_l20_n71(x)
+    end
+end
+
+def fun_l19_n181(x)
+    if (x < 1)
+        fun_l20_n639(x)
+    else
+        fun_l20_n869(x)
+    end
+end
+
+def fun_l19_n182(x)
+    if (x < 1)
+        fun_l20_n925(x)
+    else
+        fun_l20_n868(x)
+    end
+end
+
+def fun_l19_n183(x)
+    if (x < 1)
+        fun_l20_n890(x)
+    else
+        fun_l20_n924(x)
+    end
+end
+
+def fun_l19_n184(x)
+    if (x < 1)
+        fun_l20_n579(x)
+    else
+        fun_l20_n349(x)
+    end
+end
+
+def fun_l19_n185(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n16(x)
+    end
+end
+
+def fun_l19_n186(x)
+    if (x < 1)
+        fun_l20_n947(x)
+    else
+        fun_l20_n644(x)
+    end
+end
+
+def fun_l19_n187(x)
+    if (x < 1)
+        fun_l20_n424(x)
+    else
+        fun_l20_n815(x)
+    end
+end
+
+def fun_l19_n188(x)
+    if (x < 1)
+        fun_l20_n177(x)
+    else
+        fun_l20_n230(x)
+    end
+end
+
+def fun_l19_n189(x)
+    if (x < 1)
+        fun_l20_n556(x)
+    else
+        fun_l20_n47(x)
+    end
+end
+
+def fun_l19_n190(x)
+    if (x < 1)
+        fun_l20_n804(x)
+    else
+        fun_l20_n516(x)
+    end
+end
+
+def fun_l19_n191(x)
+    if (x < 1)
+        fun_l20_n411(x)
+    else
+        fun_l20_n779(x)
+    end
+end
+
+def fun_l19_n192(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n827(x)
+    end
+end
+
+def fun_l19_n193(x)
+    if (x < 1)
+        fun_l20_n514(x)
+    else
+        fun_l20_n516(x)
+    end
+end
+
+def fun_l19_n194(x)
+    if (x < 1)
+        fun_l20_n134(x)
+    else
+        fun_l20_n356(x)
+    end
+end
+
+def fun_l19_n195(x)
+    if (x < 1)
+        fun_l20_n499(x)
+    else
+        fun_l20_n809(x)
+    end
+end
+
+def fun_l19_n196(x)
+    if (x < 1)
+        fun_l20_n958(x)
+    else
+        fun_l20_n675(x)
+    end
+end
+
+def fun_l19_n197(x)
+    if (x < 1)
+        fun_l20_n847(x)
+    else
+        fun_l20_n418(x)
+    end
+end
+
+def fun_l19_n198(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n510(x)
+    end
+end
+
+def fun_l19_n199(x)
+    if (x < 1)
+        fun_l20_n365(x)
+    else
+        fun_l20_n952(x)
+    end
+end
+
+def fun_l19_n200(x)
+    if (x < 1)
+        fun_l20_n961(x)
+    else
+        fun_l20_n747(x)
+    end
+end
+
+def fun_l19_n201(x)
+    if (x < 1)
+        fun_l20_n731(x)
+    else
+        fun_l20_n618(x)
+    end
+end
+
+def fun_l19_n202(x)
+    if (x < 1)
+        fun_l20_n825(x)
+    else
+        fun_l20_n907(x)
+    end
+end
+
+def fun_l19_n203(x)
+    if (x < 1)
+        fun_l20_n865(x)
+    else
+        fun_l20_n886(x)
+    end
+end
+
+def fun_l19_n204(x)
+    if (x < 1)
+        fun_l20_n732(x)
+    else
+        fun_l20_n823(x)
+    end
+end
+
+def fun_l19_n205(x)
+    if (x < 1)
+        fun_l20_n305(x)
+    else
+        fun_l20_n596(x)
+    end
+end
+
+def fun_l19_n206(x)
+    if (x < 1)
+        fun_l20_n245(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n207(x)
+    if (x < 1)
+        fun_l20_n728(x)
+    else
+        fun_l20_n917(x)
+    end
+end
+
+def fun_l19_n208(x)
+    if (x < 1)
+        fun_l20_n448(x)
+    else
+        fun_l20_n904(x)
+    end
+end
+
+def fun_l19_n209(x)
+    if (x < 1)
+        fun_l20_n90(x)
+    else
+        fun_l20_n181(x)
+    end
+end
+
+def fun_l19_n210(x)
+    if (x < 1)
+        fun_l20_n569(x)
+    else
+        fun_l20_n268(x)
+    end
+end
+
+def fun_l19_n211(x)
+    if (x < 1)
+        fun_l20_n772(x)
+    else
+        fun_l20_n770(x)
+    end
+end
+
+def fun_l19_n212(x)
+    if (x < 1)
+        fun_l20_n781(x)
+    else
+        fun_l20_n603(x)
+    end
+end
+
+def fun_l19_n213(x)
+    if (x < 1)
+        fun_l20_n733(x)
+    else
+        fun_l20_n904(x)
+    end
+end
+
+def fun_l19_n214(x)
+    if (x < 1)
+        fun_l20_n303(x)
+    else
+        fun_l20_n888(x)
+    end
+end
+
+def fun_l19_n215(x)
+    if (x < 1)
+        fun_l20_n280(x)
+    else
+        fun_l20_n428(x)
+    end
+end
+
+def fun_l19_n216(x)
+    if (x < 1)
+        fun_l20_n737(x)
+    else
+        fun_l20_n483(x)
+    end
+end
+
+def fun_l19_n217(x)
+    if (x < 1)
+        fun_l20_n780(x)
+    else
+        fun_l20_n240(x)
+    end
+end
+
+def fun_l19_n218(x)
+    if (x < 1)
+        fun_l20_n202(x)
+    else
+        fun_l20_n580(x)
+    end
+end
+
+def fun_l19_n219(x)
+    if (x < 1)
+        fun_l20_n837(x)
+    else
+        fun_l20_n83(x)
+    end
+end
+
+def fun_l19_n220(x)
+    if (x < 1)
+        fun_l20_n68(x)
+    else
+        fun_l20_n292(x)
+    end
+end
+
+def fun_l19_n221(x)
+    if (x < 1)
+        fun_l20_n289(x)
+    else
+        fun_l20_n655(x)
+    end
+end
+
+def fun_l19_n222(x)
+    if (x < 1)
+        fun_l20_n505(x)
+    else
+        fun_l20_n660(x)
+    end
+end
+
+def fun_l19_n223(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n391(x)
+    end
+end
+
+def fun_l19_n224(x)
+    if (x < 1)
+        fun_l20_n72(x)
+    else
+        fun_l20_n81(x)
+    end
+end
+
+def fun_l19_n225(x)
+    if (x < 1)
+        fun_l20_n194(x)
+    else
+        fun_l20_n437(x)
+    end
+end
+
+def fun_l19_n226(x)
+    if (x < 1)
+        fun_l20_n629(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n227(x)
+    if (x < 1)
+        fun_l20_n912(x)
+    else
+        fun_l20_n425(x)
+    end
+end
+
+def fun_l19_n228(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n456(x)
+    end
+end
+
+def fun_l19_n229(x)
+    if (x < 1)
+        fun_l20_n247(x)
+    else
+        fun_l20_n275(x)
+    end
+end
+
+def fun_l19_n230(x)
+    if (x < 1)
+        fun_l20_n263(x)
+    else
+        fun_l20_n482(x)
+    end
+end
+
+def fun_l19_n231(x)
+    if (x < 1)
+        fun_l20_n999(x)
+    else
+        fun_l20_n146(x)
+    end
+end
+
+def fun_l19_n232(x)
+    if (x < 1)
+        fun_l20_n117(x)
+    else
+        fun_l20_n851(x)
+    end
+end
+
+def fun_l19_n233(x)
+    if (x < 1)
+        fun_l20_n889(x)
+    else
+        fun_l20_n441(x)
+    end
+end
+
+def fun_l19_n234(x)
+    if (x < 1)
+        fun_l20_n885(x)
+    else
+        fun_l20_n374(x)
+    end
+end
+
+def fun_l19_n235(x)
+    if (x < 1)
+        fun_l20_n703(x)
+    else
+        fun_l20_n962(x)
+    end
+end
+
+def fun_l19_n236(x)
+    if (x < 1)
+        fun_l20_n298(x)
+    else
+        fun_l20_n57(x)
+    end
+end
+
+def fun_l19_n237(x)
+    if (x < 1)
+        fun_l20_n821(x)
+    else
+        fun_l20_n120(x)
+    end
+end
+
+def fun_l19_n238(x)
+    if (x < 1)
+        fun_l20_n437(x)
+    else
+        fun_l20_n204(x)
+    end
+end
+
+def fun_l19_n239(x)
+    if (x < 1)
+        fun_l20_n558(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n240(x)
+    if (x < 1)
+        fun_l20_n631(x)
+    else
+        fun_l20_n986(x)
+    end
+end
+
+def fun_l19_n241(x)
+    if (x < 1)
+        fun_l20_n418(x)
+    else
+        fun_l20_n738(x)
+    end
+end
+
+def fun_l19_n242(x)
+    if (x < 1)
+        fun_l20_n249(x)
+    else
+        fun_l20_n322(x)
+    end
+end
+
+def fun_l19_n243(x)
+    if (x < 1)
+        fun_l20_n484(x)
+    else
+        fun_l20_n270(x)
+    end
+end
+
+def fun_l19_n244(x)
+    if (x < 1)
+        fun_l20_n749(x)
+    else
+        fun_l20_n322(x)
+    end
+end
+
+def fun_l19_n245(x)
+    if (x < 1)
+        fun_l20_n562(x)
+    else
+        fun_l20_n353(x)
+    end
+end
+
+def fun_l19_n246(x)
+    if (x < 1)
+        fun_l20_n974(x)
+    else
+        fun_l20_n333(x)
+    end
+end
+
+def fun_l19_n247(x)
+    if (x < 1)
+        fun_l20_n929(x)
+    else
+        fun_l20_n885(x)
+    end
+end
+
+def fun_l19_n248(x)
+    if (x < 1)
+        fun_l20_n421(x)
+    else
+        fun_l20_n576(x)
+    end
+end
+
+def fun_l19_n249(x)
+    if (x < 1)
+        fun_l20_n757(x)
+    else
+        fun_l20_n618(x)
+    end
+end
+
+def fun_l19_n250(x)
+    if (x < 1)
+        fun_l20_n108(x)
+    else
+        fun_l20_n704(x)
+    end
+end
+
+def fun_l19_n251(x)
+    if (x < 1)
+        fun_l20_n882(x)
+    else
+        fun_l20_n994(x)
+    end
+end
+
+def fun_l19_n252(x)
+    if (x < 1)
+        fun_l20_n995(x)
+    else
+        fun_l20_n580(x)
+    end
+end
+
+def fun_l19_n253(x)
+    if (x < 1)
+        fun_l20_n869(x)
+    else
+        fun_l20_n302(x)
+    end
+end
+
+def fun_l19_n254(x)
+    if (x < 1)
+        fun_l20_n873(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n255(x)
+    if (x < 1)
+        fun_l20_n266(x)
+    else
+        fun_l20_n263(x)
+    end
+end
+
+def fun_l19_n256(x)
+    if (x < 1)
+        fun_l20_n450(x)
+    else
+        fun_l20_n994(x)
+    end
+end
+
+def fun_l19_n257(x)
+    if (x < 1)
+        fun_l20_n552(x)
+    else
+        fun_l20_n407(x)
+    end
+end
+
+def fun_l19_n258(x)
+    if (x < 1)
+        fun_l20_n603(x)
+    else
+        fun_l20_n453(x)
+    end
+end
+
+def fun_l19_n259(x)
+    if (x < 1)
+        fun_l20_n933(x)
+    else
+        fun_l20_n609(x)
+    end
+end
+
+def fun_l19_n260(x)
+    if (x < 1)
+        fun_l20_n983(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n261(x)
+    if (x < 1)
+        fun_l20_n123(x)
+    else
+        fun_l20_n159(x)
+    end
+end
+
+def fun_l19_n262(x)
+    if (x < 1)
+        fun_l20_n890(x)
+    else
+        fun_l20_n749(x)
+    end
+end
+
+def fun_l19_n263(x)
+    if (x < 1)
+        fun_l20_n758(x)
+    else
+        fun_l20_n123(x)
+    end
+end
+
+def fun_l19_n264(x)
+    if (x < 1)
+        fun_l20_n194(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n265(x)
+    if (x < 1)
+        fun_l20_n71(x)
+    else
+        fun_l20_n750(x)
+    end
+end
+
+def fun_l19_n266(x)
+    if (x < 1)
+        fun_l20_n713(x)
+    else
+        fun_l20_n125(x)
+    end
+end
+
+def fun_l19_n267(x)
+    if (x < 1)
+        fun_l20_n286(x)
+    else
+        fun_l20_n227(x)
+    end
+end
+
+def fun_l19_n268(x)
+    if (x < 1)
+        fun_l20_n220(x)
+    else
+        fun_l20_n233(x)
+    end
+end
+
+def fun_l19_n269(x)
+    if (x < 1)
+        fun_l20_n263(x)
+    else
+        fun_l20_n306(x)
+    end
+end
+
+def fun_l19_n270(x)
+    if (x < 1)
+        fun_l20_n959(x)
+    else
+        fun_l20_n552(x)
+    end
+end
+
+def fun_l19_n271(x)
+    if (x < 1)
+        fun_l20_n154(x)
+    else
+        fun_l20_n212(x)
+    end
+end
+
+def fun_l19_n272(x)
+    if (x < 1)
+        fun_l20_n985(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n273(x)
+    if (x < 1)
+        fun_l20_n763(x)
+    else
+        fun_l20_n897(x)
+    end
+end
+
+def fun_l19_n274(x)
+    if (x < 1)
+        fun_l20_n582(x)
+    else
+        fun_l20_n638(x)
+    end
+end
+
+def fun_l19_n275(x)
+    if (x < 1)
+        fun_l20_n509(x)
+    else
+        fun_l20_n366(x)
+    end
+end
+
+def fun_l19_n276(x)
+    if (x < 1)
+        fun_l20_n500(x)
+    else
+        fun_l20_n814(x)
+    end
+end
+
+def fun_l19_n277(x)
+    if (x < 1)
+        fun_l20_n726(x)
+    else
+        fun_l20_n934(x)
+    end
+end
+
+def fun_l19_n278(x)
+    if (x < 1)
+        fun_l20_n198(x)
+    else
+        fun_l20_n852(x)
+    end
+end
+
+def fun_l19_n279(x)
+    if (x < 1)
+        fun_l20_n43(x)
+    else
+        fun_l20_n614(x)
+    end
+end
+
+def fun_l19_n280(x)
+    if (x < 1)
+        fun_l20_n79(x)
+    else
+        fun_l20_n821(x)
+    end
+end
+
+def fun_l19_n281(x)
+    if (x < 1)
+        fun_l20_n269(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n282(x)
+    if (x < 1)
+        fun_l20_n327(x)
+    else
+        fun_l20_n528(x)
+    end
+end
+
+def fun_l19_n283(x)
+    if (x < 1)
+        fun_l20_n77(x)
+    else
+        fun_l20_n743(x)
+    end
+end
+
+def fun_l19_n284(x)
+    if (x < 1)
+        fun_l20_n282(x)
+    else
+        fun_l20_n406(x)
+    end
+end
+
+def fun_l19_n285(x)
+    if (x < 1)
+        fun_l20_n129(x)
+    else
+        fun_l20_n855(x)
+    end
+end
+
+def fun_l19_n286(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n687(x)
+    end
+end
+
+def fun_l19_n287(x)
+    if (x < 1)
+        fun_l20_n166(x)
+    else
+        fun_l20_n5(x)
+    end
+end
+
+def fun_l19_n288(x)
+    if (x < 1)
+        fun_l20_n545(x)
+    else
+        fun_l20_n661(x)
+    end
+end
+
+def fun_l19_n289(x)
+    if (x < 1)
+        fun_l20_n630(x)
+    else
+        fun_l20_n820(x)
+    end
+end
+
+def fun_l19_n290(x)
+    if (x < 1)
+        fun_l20_n774(x)
+    else
+        fun_l20_n125(x)
+    end
+end
+
+def fun_l19_n291(x)
+    if (x < 1)
+        fun_l20_n110(x)
+    else
+        fun_l20_n721(x)
+    end
+end
+
+def fun_l19_n292(x)
+    if (x < 1)
+        fun_l20_n777(x)
+    else
+        fun_l20_n44(x)
+    end
+end
+
+def fun_l19_n293(x)
+    if (x < 1)
+        fun_l20_n504(x)
+    else
+        fun_l20_n478(x)
+    end
+end
+
+def fun_l19_n294(x)
+    if (x < 1)
+        fun_l20_n540(x)
+    else
+        fun_l20_n603(x)
+    end
+end
+
+def fun_l19_n295(x)
+    if (x < 1)
+        fun_l20_n576(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n296(x)
+    if (x < 1)
+        fun_l20_n553(x)
+    else
+        fun_l20_n295(x)
+    end
+end
+
+def fun_l19_n297(x)
+    if (x < 1)
+        fun_l20_n56(x)
+    else
+        fun_l20_n990(x)
+    end
+end
+
+def fun_l19_n298(x)
+    if (x < 1)
+        fun_l20_n362(x)
+    else
+        fun_l20_n158(x)
+    end
+end
+
+def fun_l19_n299(x)
+    if (x < 1)
+        fun_l20_n788(x)
+    else
+        fun_l20_n70(x)
+    end
+end
+
+def fun_l19_n300(x)
+    if (x < 1)
+        fun_l20_n670(x)
+    else
+        fun_l20_n542(x)
+    end
+end
+
+def fun_l19_n301(x)
+    if (x < 1)
+        fun_l20_n960(x)
+    else
+        fun_l20_n827(x)
+    end
+end
+
+def fun_l19_n302(x)
+    if (x < 1)
+        fun_l20_n366(x)
+    else
+        fun_l20_n325(x)
+    end
+end
+
+def fun_l19_n303(x)
+    if (x < 1)
+        fun_l20_n252(x)
+    else
+        fun_l20_n931(x)
+    end
+end
+
+def fun_l19_n304(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n102(x)
+    end
+end
+
+def fun_l19_n305(x)
+    if (x < 1)
+        fun_l20_n678(x)
+    else
+        fun_l20_n299(x)
+    end
+end
+
+def fun_l19_n306(x)
+    if (x < 1)
+        fun_l20_n538(x)
+    else
+        fun_l20_n371(x)
+    end
+end
+
+def fun_l19_n307(x)
+    if (x < 1)
+        fun_l20_n452(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n308(x)
+    if (x < 1)
+        fun_l20_n410(x)
+    else
+        fun_l20_n156(x)
+    end
+end
+
+def fun_l19_n309(x)
+    if (x < 1)
+        fun_l20_n259(x)
+    else
+        fun_l20_n236(x)
+    end
+end
+
+def fun_l19_n310(x)
+    if (x < 1)
+        fun_l20_n710(x)
+    else
+        fun_l20_n23(x)
+    end
+end
+
+def fun_l19_n311(x)
+    if (x < 1)
+        fun_l20_n214(x)
+    else
+        fun_l20_n649(x)
+    end
+end
+
+def fun_l19_n312(x)
+    if (x < 1)
+        fun_l20_n603(x)
+    else
+        fun_l20_n213(x)
+    end
+end
+
+def fun_l19_n313(x)
+    if (x < 1)
+        fun_l20_n874(x)
+    else
+        fun_l20_n83(x)
+    end
+end
+
+def fun_l19_n314(x)
+    if (x < 1)
+        fun_l20_n902(x)
+    else
+        fun_l20_n303(x)
+    end
+end
+
+def fun_l19_n315(x)
+    if (x < 1)
+        fun_l20_n601(x)
+    else
+        fun_l20_n801(x)
+    end
+end
+
+def fun_l19_n316(x)
+    if (x < 1)
+        fun_l20_n76(x)
+    else
+        fun_l20_n960(x)
+    end
+end
+
+def fun_l19_n317(x)
+    if (x < 1)
+        fun_l20_n926(x)
+    else
+        fun_l20_n700(x)
+    end
+end
+
+def fun_l19_n318(x)
+    if (x < 1)
+        fun_l20_n233(x)
+    else
+        fun_l20_n278(x)
+    end
+end
+
+def fun_l19_n319(x)
+    if (x < 1)
+        fun_l20_n724(x)
+    else
+        fun_l20_n181(x)
+    end
+end
+
+def fun_l19_n320(x)
+    if (x < 1)
+        fun_l20_n367(x)
+    else
+        fun_l20_n511(x)
+    end
+end
+
+def fun_l19_n321(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n601(x)
+    end
+end
+
+def fun_l19_n322(x)
+    if (x < 1)
+        fun_l20_n173(x)
+    else
+        fun_l20_n151(x)
+    end
+end
+
+def fun_l19_n323(x)
+    if (x < 1)
+        fun_l20_n628(x)
+    else
+        fun_l20_n790(x)
+    end
+end
+
+def fun_l19_n324(x)
+    if (x < 1)
+        fun_l20_n423(x)
+    else
+        fun_l20_n40(x)
+    end
+end
+
+def fun_l19_n325(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n698(x)
+    end
+end
+
+def fun_l19_n326(x)
+    if (x < 1)
+        fun_l20_n351(x)
+    else
+        fun_l20_n562(x)
+    end
+end
+
+def fun_l19_n327(x)
+    if (x < 1)
+        fun_l20_n717(x)
+    else
+        fun_l20_n386(x)
+    end
+end
+
+def fun_l19_n328(x)
+    if (x < 1)
+        fun_l20_n461(x)
+    else
+        fun_l20_n604(x)
+    end
+end
+
+def fun_l19_n329(x)
+    if (x < 1)
+        fun_l20_n423(x)
+    else
+        fun_l20_n506(x)
+    end
+end
+
+def fun_l19_n330(x)
+    if (x < 1)
+        fun_l20_n389(x)
+    else
+        fun_l20_n365(x)
+    end
+end
+
+def fun_l19_n331(x)
+    if (x < 1)
+        fun_l20_n858(x)
+    else
+        fun_l20_n623(x)
+    end
+end
+
+def fun_l19_n332(x)
+    if (x < 1)
+        fun_l20_n34(x)
+    else
+        fun_l20_n598(x)
+    end
+end
+
+def fun_l19_n333(x)
+    if (x < 1)
+        fun_l20_n458(x)
+    else
+        fun_l20_n619(x)
+    end
+end
+
+def fun_l19_n334(x)
+    if (x < 1)
+        fun_l20_n203(x)
+    else
+        fun_l20_n391(x)
+    end
+end
+
+def fun_l19_n335(x)
+    if (x < 1)
+        fun_l20_n745(x)
+    else
+        fun_l20_n197(x)
+    end
+end
+
+def fun_l19_n336(x)
+    if (x < 1)
+        fun_l20_n388(x)
+    else
+        fun_l20_n682(x)
+    end
+end
+
+def fun_l19_n337(x)
+    if (x < 1)
+        fun_l20_n340(x)
+    else
+        fun_l20_n836(x)
+    end
+end
+
+def fun_l19_n338(x)
+    if (x < 1)
+        fun_l20_n231(x)
+    else
+        fun_l20_n508(x)
+    end
+end
+
+def fun_l19_n339(x)
+    if (x < 1)
+        fun_l20_n376(x)
+    else
+        fun_l20_n733(x)
+    end
+end
+
+def fun_l19_n340(x)
+    if (x < 1)
+        fun_l20_n162(x)
+    else
+        fun_l20_n397(x)
+    end
+end
+
+def fun_l19_n341(x)
+    if (x < 1)
+        fun_l20_n526(x)
+    else
+        fun_l20_n431(x)
+    end
+end
+
+def fun_l19_n342(x)
+    if (x < 1)
+        fun_l20_n850(x)
+    else
+        fun_l20_n226(x)
+    end
+end
+
+def fun_l19_n343(x)
+    if (x < 1)
+        fun_l20_n936(x)
+    else
+        fun_l20_n739(x)
+    end
+end
+
+def fun_l19_n344(x)
+    if (x < 1)
+        fun_l20_n639(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n345(x)
+    if (x < 1)
+        fun_l20_n230(x)
+    else
+        fun_l20_n8(x)
+    end
+end
+
+def fun_l19_n346(x)
+    if (x < 1)
+        fun_l20_n156(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n347(x)
+    if (x < 1)
+        fun_l20_n823(x)
+    else
+        fun_l20_n843(x)
+    end
+end
+
+def fun_l19_n348(x)
+    if (x < 1)
+        fun_l20_n798(x)
+    else
+        fun_l20_n538(x)
+    end
+end
+
+def fun_l19_n349(x)
+    if (x < 1)
+        fun_l20_n701(x)
+    else
+        fun_l20_n949(x)
+    end
+end
+
+def fun_l19_n350(x)
+    if (x < 1)
+        fun_l20_n131(x)
+    else
+        fun_l20_n727(x)
+    end
+end
+
+def fun_l19_n351(x)
+    if (x < 1)
+        fun_l20_n661(x)
+    else
+        fun_l20_n655(x)
+    end
+end
+
+def fun_l19_n352(x)
+    if (x < 1)
+        fun_l20_n824(x)
+    else
+        fun_l20_n436(x)
+    end
+end
+
+def fun_l19_n353(x)
+    if (x < 1)
+        fun_l20_n599(x)
+    else
+        fun_l20_n581(x)
+    end
+end
+
+def fun_l19_n354(x)
+    if (x < 1)
+        fun_l20_n290(x)
+    else
+        fun_l20_n632(x)
+    end
+end
+
+def fun_l19_n355(x)
+    if (x < 1)
+        fun_l20_n495(x)
+    else
+        fun_l20_n466(x)
+    end
+end
+
+def fun_l19_n356(x)
+    if (x < 1)
+        fun_l20_n70(x)
+    else
+        fun_l20_n270(x)
+    end
+end
+
+def fun_l19_n357(x)
+    if (x < 1)
+        fun_l20_n409(x)
+    else
+        fun_l20_n635(x)
+    end
+end
+
+def fun_l19_n358(x)
+    if (x < 1)
+        fun_l20_n396(x)
+    else
+        fun_l20_n41(x)
+    end
+end
+
+def fun_l19_n359(x)
+    if (x < 1)
+        fun_l20_n302(x)
+    else
+        fun_l20_n209(x)
+    end
+end
+
+def fun_l19_n360(x)
+    if (x < 1)
+        fun_l20_n844(x)
+    else
+        fun_l20_n23(x)
+    end
+end
+
+def fun_l19_n361(x)
+    if (x < 1)
+        fun_l20_n18(x)
+    else
+        fun_l20_n20(x)
+    end
+end
+
+def fun_l19_n362(x)
+    if (x < 1)
+        fun_l20_n821(x)
+    else
+        fun_l20_n806(x)
+    end
+end
+
+def fun_l19_n363(x)
+    if (x < 1)
+        fun_l20_n710(x)
+    else
+        fun_l20_n209(x)
+    end
+end
+
+def fun_l19_n364(x)
+    if (x < 1)
+        fun_l20_n979(x)
+    else
+        fun_l20_n457(x)
+    end
+end
+
+def fun_l19_n365(x)
+    if (x < 1)
+        fun_l20_n787(x)
+    else
+        fun_l20_n582(x)
+    end
+end
+
+def fun_l19_n366(x)
+    if (x < 1)
+        fun_l20_n274(x)
+    else
+        fun_l20_n710(x)
+    end
+end
+
+def fun_l19_n367(x)
+    if (x < 1)
+        fun_l20_n461(x)
+    else
+        fun_l20_n685(x)
+    end
+end
+
+def fun_l19_n368(x)
+    if (x < 1)
+        fun_l20_n953(x)
+    else
+        fun_l20_n477(x)
+    end
+end
+
+def fun_l19_n369(x)
+    if (x < 1)
+        fun_l20_n363(x)
+    else
+        fun_l20_n976(x)
+    end
+end
+
+def fun_l19_n370(x)
+    if (x < 1)
+        fun_l20_n934(x)
+    else
+        fun_l20_n742(x)
+    end
+end
+
+def fun_l19_n371(x)
+    if (x < 1)
+        fun_l20_n769(x)
+    else
+        fun_l20_n358(x)
+    end
+end
+
+def fun_l19_n372(x)
+    if (x < 1)
+        fun_l20_n53(x)
+    else
+        fun_l20_n915(x)
+    end
+end
+
+def fun_l19_n373(x)
+    if (x < 1)
+        fun_l20_n678(x)
+    else
+        fun_l20_n930(x)
+    end
+end
+
+def fun_l19_n374(x)
+    if (x < 1)
+        fun_l20_n160(x)
+    else
+        fun_l20_n937(x)
+    end
+end
+
+def fun_l19_n375(x)
+    if (x < 1)
+        fun_l20_n54(x)
+    else
+        fun_l20_n844(x)
+    end
+end
+
+def fun_l19_n376(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n756(x)
+    end
+end
+
+def fun_l19_n377(x)
+    if (x < 1)
+        fun_l20_n138(x)
+    else
+        fun_l20_n673(x)
+    end
+end
+
+def fun_l19_n378(x)
+    if (x < 1)
+        fun_l20_n976(x)
+    else
+        fun_l20_n720(x)
+    end
+end
+
+def fun_l19_n379(x)
+    if (x < 1)
+        fun_l20_n704(x)
+    else
+        fun_l20_n53(x)
+    end
+end
+
+def fun_l19_n380(x)
+    if (x < 1)
+        fun_l20_n762(x)
+    else
+        fun_l20_n340(x)
+    end
+end
+
+def fun_l19_n381(x)
+    if (x < 1)
+        fun_l20_n323(x)
+    else
+        fun_l20_n634(x)
+    end
+end
+
+def fun_l19_n382(x)
+    if (x < 1)
+        fun_l20_n515(x)
+    else
+        fun_l20_n562(x)
+    end
+end
+
+def fun_l19_n383(x)
+    if (x < 1)
+        fun_l20_n160(x)
+    else
+        fun_l20_n826(x)
+    end
+end
+
+def fun_l19_n384(x)
+    if (x < 1)
+        fun_l20_n779(x)
+    else
+        fun_l20_n638(x)
+    end
+end
+
+def fun_l19_n385(x)
+    if (x < 1)
+        fun_l20_n401(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n386(x)
+    if (x < 1)
+        fun_l20_n604(x)
+    else
+        fun_l20_n820(x)
+    end
+end
+
+def fun_l19_n387(x)
+    if (x < 1)
+        fun_l20_n694(x)
+    else
+        fun_l20_n533(x)
+    end
+end
+
+def fun_l19_n388(x)
+    if (x < 1)
+        fun_l20_n687(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n389(x)
+    if (x < 1)
+        fun_l20_n19(x)
+    else
+        fun_l20_n457(x)
+    end
+end
+
+def fun_l19_n390(x)
+    if (x < 1)
+        fun_l20_n812(x)
+    else
+        fun_l20_n152(x)
+    end
+end
+
+def fun_l19_n391(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n25(x)
+    end
+end
+
+def fun_l19_n392(x)
+    if (x < 1)
+        fun_l20_n24(x)
+    else
+        fun_l20_n930(x)
+    end
+end
+
+def fun_l19_n393(x)
+    if (x < 1)
+        fun_l20_n277(x)
+    else
+        fun_l20_n727(x)
+    end
+end
+
+def fun_l19_n394(x)
+    if (x < 1)
+        fun_l20_n272(x)
+    else
+        fun_l20_n298(x)
+    end
+end
+
+def fun_l19_n395(x)
+    if (x < 1)
+        fun_l20_n661(x)
+    else
+        fun_l20_n269(x)
+    end
+end
+
+def fun_l19_n396(x)
+    if (x < 1)
+        fun_l20_n624(x)
+    else
+        fun_l20_n654(x)
+    end
+end
+
+def fun_l19_n397(x)
+    if (x < 1)
+        fun_l20_n501(x)
+    else
+        fun_l20_n625(x)
+    end
+end
+
+def fun_l19_n398(x)
+    if (x < 1)
+        fun_l20_n596(x)
+    else
+        fun_l20_n160(x)
+    end
+end
+
+def fun_l19_n399(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n954(x)
+    end
+end
+
+def fun_l19_n400(x)
+    if (x < 1)
+        fun_l20_n911(x)
+    else
+        fun_l20_n321(x)
+    end
+end
+
+def fun_l19_n401(x)
+    if (x < 1)
+        fun_l20_n294(x)
+    else
+        fun_l20_n382(x)
+    end
+end
+
+def fun_l19_n402(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n732(x)
+    end
+end
+
+def fun_l19_n403(x)
+    if (x < 1)
+        fun_l20_n929(x)
+    else
+        fun_l20_n109(x)
+    end
+end
+
+def fun_l19_n404(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n405(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n395(x)
+    end
+end
+
+def fun_l19_n406(x)
+    if (x < 1)
+        fun_l20_n949(x)
+    else
+        fun_l20_n195(x)
+    end
+end
+
+def fun_l19_n407(x)
+    if (x < 1)
+        fun_l20_n249(x)
+    else
+        fun_l20_n771(x)
+    end
+end
+
+def fun_l19_n408(x)
+    if (x < 1)
+        fun_l20_n728(x)
+    else
+        fun_l20_n752(x)
+    end
+end
+
+def fun_l19_n409(x)
+    if (x < 1)
+        fun_l20_n135(x)
+    else
+        fun_l20_n774(x)
+    end
+end
+
+def fun_l19_n410(x)
+    if (x < 1)
+        fun_l20_n277(x)
+    else
+        fun_l20_n499(x)
+    end
+end
+
+def fun_l19_n411(x)
+    if (x < 1)
+        fun_l20_n634(x)
+    else
+        fun_l20_n713(x)
+    end
+end
+
+def fun_l19_n412(x)
+    if (x < 1)
+        fun_l20_n118(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n413(x)
+    if (x < 1)
+        fun_l20_n202(x)
+    else
+        fun_l20_n146(x)
+    end
+end
+
+def fun_l19_n414(x)
+    if (x < 1)
+        fun_l20_n668(x)
+    else
+        fun_l20_n22(x)
+    end
+end
+
+def fun_l19_n415(x)
+    if (x < 1)
+        fun_l20_n673(x)
+    else
+        fun_l20_n91(x)
+    end
+end
+
+def fun_l19_n416(x)
+    if (x < 1)
+        fun_l20_n399(x)
+    else
+        fun_l20_n288(x)
+    end
+end
+
+def fun_l19_n417(x)
+    if (x < 1)
+        fun_l20_n985(x)
+    else
+        fun_l20_n63(x)
+    end
+end
+
+def fun_l19_n418(x)
+    if (x < 1)
+        fun_l20_n973(x)
+    else
+        fun_l20_n37(x)
+    end
+end
+
+def fun_l19_n419(x)
+    if (x < 1)
+        fun_l20_n907(x)
+    else
+        fun_l20_n274(x)
+    end
+end
+
+def fun_l19_n420(x)
+    if (x < 1)
+        fun_l20_n0(x)
+    else
+        fun_l20_n895(x)
+    end
+end
+
+def fun_l19_n421(x)
+    if (x < 1)
+        fun_l20_n138(x)
+    else
+        fun_l20_n941(x)
+    end
+end
+
+def fun_l19_n422(x)
+    if (x < 1)
+        fun_l20_n944(x)
+    else
+        fun_l20_n393(x)
+    end
+end
+
+def fun_l19_n423(x)
+    if (x < 1)
+        fun_l20_n7(x)
+    else
+        fun_l20_n879(x)
+    end
+end
+
+def fun_l19_n424(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n19(x)
+    end
+end
+
+def fun_l19_n425(x)
+    if (x < 1)
+        fun_l20_n11(x)
+    else
+        fun_l20_n12(x)
+    end
+end
+
+def fun_l19_n426(x)
+    if (x < 1)
+        fun_l20_n652(x)
+    else
+        fun_l20_n501(x)
+    end
+end
+
+def fun_l19_n427(x)
+    if (x < 1)
+        fun_l20_n825(x)
+    else
+        fun_l20_n547(x)
+    end
+end
+
+def fun_l19_n428(x)
+    if (x < 1)
+        fun_l20_n485(x)
+    else
+        fun_l20_n905(x)
+    end
+end
+
+def fun_l19_n429(x)
+    if (x < 1)
+        fun_l20_n800(x)
+    else
+        fun_l20_n922(x)
+    end
+end
+
+def fun_l19_n430(x)
+    if (x < 1)
+        fun_l20_n122(x)
+    else
+        fun_l20_n79(x)
+    end
+end
+
+def fun_l19_n431(x)
+    if (x < 1)
+        fun_l20_n822(x)
+    else
+        fun_l20_n228(x)
+    end
+end
+
+def fun_l19_n432(x)
+    if (x < 1)
+        fun_l20_n616(x)
+    else
+        fun_l20_n886(x)
+    end
+end
+
+def fun_l19_n433(x)
+    if (x < 1)
+        fun_l20_n232(x)
+    else
+        fun_l20_n716(x)
+    end
+end
+
+def fun_l19_n434(x)
+    if (x < 1)
+        fun_l20_n288(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n435(x)
+    if (x < 1)
+        fun_l20_n606(x)
+    else
+        fun_l20_n220(x)
+    end
+end
+
+def fun_l19_n436(x)
+    if (x < 1)
+        fun_l20_n185(x)
+    else
+        fun_l20_n69(x)
+    end
+end
+
+def fun_l19_n437(x)
+    if (x < 1)
+        fun_l20_n869(x)
+    else
+        fun_l20_n264(x)
+    end
+end
+
+def fun_l19_n438(x)
+    if (x < 1)
+        fun_l20_n142(x)
+    else
+        fun_l20_n766(x)
+    end
+end
+
+def fun_l19_n439(x)
+    if (x < 1)
+        fun_l20_n155(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n440(x)
+    if (x < 1)
+        fun_l20_n486(x)
+    else
+        fun_l20_n442(x)
+    end
+end
+
+def fun_l19_n441(x)
+    if (x < 1)
+        fun_l20_n896(x)
+    else
+        fun_l20_n404(x)
+    end
+end
+
+def fun_l19_n442(x)
+    if (x < 1)
+        fun_l20_n944(x)
+    else
+        fun_l20_n906(x)
+    end
+end
+
+def fun_l19_n443(x)
+    if (x < 1)
+        fun_l20_n400(x)
+    else
+        fun_l20_n230(x)
+    end
+end
+
+def fun_l19_n444(x)
+    if (x < 1)
+        fun_l20_n646(x)
+    else
+        fun_l20_n89(x)
+    end
+end
+
+def fun_l19_n445(x)
+    if (x < 1)
+        fun_l20_n683(x)
+    else
+        fun_l20_n434(x)
+    end
+end
+
+def fun_l19_n446(x)
+    if (x < 1)
+        fun_l20_n333(x)
+    else
+        fun_l20_n164(x)
+    end
+end
+
+def fun_l19_n447(x)
+    if (x < 1)
+        fun_l20_n732(x)
+    else
+        fun_l20_n721(x)
+    end
+end
+
+def fun_l19_n448(x)
+    if (x < 1)
+        fun_l20_n948(x)
+    else
+        fun_l20_n343(x)
+    end
+end
+
+def fun_l19_n449(x)
+    if (x < 1)
+        fun_l20_n211(x)
+    else
+        fun_l20_n754(x)
+    end
+end
+
+def fun_l19_n450(x)
+    if (x < 1)
+        fun_l20_n984(x)
+    else
+        fun_l20_n952(x)
+    end
+end
+
+def fun_l19_n451(x)
+    if (x < 1)
+        fun_l20_n349(x)
+    else
+        fun_l20_n424(x)
+    end
+end
+
+def fun_l19_n452(x)
+    if (x < 1)
+        fun_l20_n721(x)
+    else
+        fun_l20_n475(x)
+    end
+end
+
+def fun_l19_n453(x)
+    if (x < 1)
+        fun_l20_n143(x)
+    else
+        fun_l20_n875(x)
+    end
+end
+
+def fun_l19_n454(x)
+    if (x < 1)
+        fun_l20_n561(x)
+    else
+        fun_l20_n255(x)
+    end
+end
+
+def fun_l19_n455(x)
+    if (x < 1)
+        fun_l20_n962(x)
+    else
+        fun_l20_n489(x)
+    end
+end
+
+def fun_l19_n456(x)
+    if (x < 1)
+        fun_l20_n95(x)
+    else
+        fun_l20_n434(x)
+    end
+end
+
+def fun_l19_n457(x)
+    if (x < 1)
+        fun_l20_n863(x)
+    else
+        fun_l20_n198(x)
+    end
+end
+
+def fun_l19_n458(x)
+    if (x < 1)
+        fun_l20_n106(x)
+    else
+        fun_l20_n786(x)
+    end
+end
+
+def fun_l19_n459(x)
+    if (x < 1)
+        fun_l20_n415(x)
+    else
+        fun_l20_n456(x)
+    end
+end
+
+def fun_l19_n460(x)
+    if (x < 1)
+        fun_l20_n706(x)
+    else
+        fun_l20_n47(x)
+    end
+end
+
+def fun_l19_n461(x)
+    if (x < 1)
+        fun_l20_n894(x)
+    else
+        fun_l20_n119(x)
+    end
+end
+
+def fun_l19_n462(x)
+    if (x < 1)
+        fun_l20_n267(x)
+    else
+        fun_l20_n662(x)
+    end
+end
+
+def fun_l19_n463(x)
+    if (x < 1)
+        fun_l20_n689(x)
+    else
+        fun_l20_n633(x)
+    end
+end
+
+def fun_l19_n464(x)
+    if (x < 1)
+        fun_l20_n94(x)
+    else
+        fun_l20_n967(x)
+    end
+end
+
+def fun_l19_n465(x)
+    if (x < 1)
+        fun_l20_n902(x)
+    else
+        fun_l20_n619(x)
+    end
+end
+
+def fun_l19_n466(x)
+    if (x < 1)
+        fun_l20_n574(x)
+    else
+        fun_l20_n204(x)
+    end
+end
+
+def fun_l19_n467(x)
+    if (x < 1)
+        fun_l20_n195(x)
+    else
+        fun_l20_n455(x)
+    end
+end
+
+def fun_l19_n468(x)
+    if (x < 1)
+        fun_l20_n173(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n469(x)
+    if (x < 1)
+        fun_l20_n769(x)
+    else
+        fun_l20_n314(x)
+    end
+end
+
+def fun_l19_n470(x)
+    if (x < 1)
+        fun_l20_n669(x)
+    else
+        fun_l20_n648(x)
+    end
+end
+
+def fun_l19_n471(x)
+    if (x < 1)
+        fun_l20_n741(x)
+    else
+        fun_l20_n238(x)
+    end
+end
+
+def fun_l19_n472(x)
+    if (x < 1)
+        fun_l20_n370(x)
+    else
+        fun_l20_n610(x)
+    end
+end
+
+def fun_l19_n473(x)
+    if (x < 1)
+        fun_l20_n200(x)
+    else
+        fun_l20_n698(x)
+    end
+end
+
+def fun_l19_n474(x)
+    if (x < 1)
+        fun_l20_n200(x)
+    else
+        fun_l20_n951(x)
+    end
+end
+
+def fun_l19_n475(x)
+    if (x < 1)
+        fun_l20_n47(x)
+    else
+        fun_l20_n244(x)
+    end
+end
+
+def fun_l19_n476(x)
+    if (x < 1)
+        fun_l20_n314(x)
+    else
+        fun_l20_n163(x)
+    end
+end
+
+def fun_l19_n477(x)
+    if (x < 1)
+        fun_l20_n665(x)
+    else
+        fun_l20_n278(x)
+    end
+end
+
+def fun_l19_n478(x)
+    if (x < 1)
+        fun_l20_n539(x)
+    else
+        fun_l20_n149(x)
+    end
+end
+
+def fun_l19_n479(x)
+    if (x < 1)
+        fun_l20_n10(x)
+    else
+        fun_l20_n686(x)
+    end
+end
+
+def fun_l19_n480(x)
+    if (x < 1)
+        fun_l20_n684(x)
+    else
+        fun_l20_n531(x)
+    end
+end
+
+def fun_l19_n481(x)
+    if (x < 1)
+        fun_l20_n579(x)
+    else
+        fun_l20_n468(x)
+    end
+end
+
+def fun_l19_n482(x)
+    if (x < 1)
+        fun_l20_n794(x)
+    else
+        fun_l20_n116(x)
+    end
+end
+
+def fun_l19_n483(x)
+    if (x < 1)
+        fun_l20_n848(x)
+    else
+        fun_l20_n278(x)
+    end
+end
+
+def fun_l19_n484(x)
+    if (x < 1)
+        fun_l20_n965(x)
+    else
+        fun_l20_n23(x)
+    end
+end
+
+def fun_l19_n485(x)
+    if (x < 1)
+        fun_l20_n123(x)
+    else
+        fun_l20_n905(x)
+    end
+end
+
+def fun_l19_n486(x)
+    if (x < 1)
+        fun_l20_n69(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n487(x)
+    if (x < 1)
+        fun_l20_n234(x)
+    else
+        fun_l20_n648(x)
+    end
+end
+
+def fun_l19_n488(x)
+    if (x < 1)
+        fun_l20_n31(x)
+    else
+        fun_l20_n127(x)
+    end
+end
+
+def fun_l19_n489(x)
+    if (x < 1)
+        fun_l20_n469(x)
+    else
+        fun_l20_n300(x)
+    end
+end
+
+def fun_l19_n490(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n722(x)
+    end
+end
+
+def fun_l19_n491(x)
+    if (x < 1)
+        fun_l20_n949(x)
+    else
+        fun_l20_n567(x)
+    end
+end
+
+def fun_l19_n492(x)
+    if (x < 1)
+        fun_l20_n465(x)
+    else
+        fun_l20_n226(x)
+    end
+end
+
+def fun_l19_n493(x)
+    if (x < 1)
+        fun_l20_n436(x)
+    else
+        fun_l20_n292(x)
+    end
+end
+
+def fun_l19_n494(x)
+    if (x < 1)
+        fun_l20_n552(x)
+    else
+        fun_l20_n81(x)
+    end
+end
+
+def fun_l19_n495(x)
+    if (x < 1)
+        fun_l20_n950(x)
+    else
+        fun_l20_n481(x)
+    end
+end
+
+def fun_l19_n496(x)
+    if (x < 1)
+        fun_l20_n382(x)
+    else
+        fun_l20_n846(x)
+    end
+end
+
+def fun_l19_n497(x)
+    if (x < 1)
+        fun_l20_n355(x)
+    else
+        fun_l20_n546(x)
+    end
+end
+
+def fun_l19_n498(x)
+    if (x < 1)
+        fun_l20_n404(x)
+    else
+        fun_l20_n655(x)
+    end
+end
+
+def fun_l19_n499(x)
+    if (x < 1)
+        fun_l20_n794(x)
+    else
+        fun_l20_n531(x)
+    end
+end
+
+def fun_l19_n500(x)
+    if (x < 1)
+        fun_l20_n555(x)
+    else
+        fun_l20_n37(x)
+    end
+end
+
+def fun_l19_n501(x)
+    if (x < 1)
+        fun_l20_n955(x)
+    else
+        fun_l20_n60(x)
+    end
+end
+
+def fun_l19_n502(x)
+    if (x < 1)
+        fun_l20_n957(x)
+    else
+        fun_l20_n482(x)
+    end
+end
+
+def fun_l19_n503(x)
+    if (x < 1)
+        fun_l20_n683(x)
+    else
+        fun_l20_n374(x)
+    end
+end
+
+def fun_l19_n504(x)
+    if (x < 1)
+        fun_l20_n839(x)
+    else
+        fun_l20_n867(x)
+    end
+end
+
+def fun_l19_n505(x)
+    if (x < 1)
+        fun_l20_n956(x)
+    else
+        fun_l20_n336(x)
+    end
+end
+
+def fun_l19_n506(x)
+    if (x < 1)
+        fun_l20_n234(x)
+    else
+        fun_l20_n50(x)
+    end
+end
+
+def fun_l19_n507(x)
+    if (x < 1)
+        fun_l20_n968(x)
+    else
+        fun_l20_n627(x)
+    end
+end
+
+def fun_l19_n508(x)
+    if (x < 1)
+        fun_l20_n680(x)
+    else
+        fun_l20_n812(x)
+    end
+end
+
+def fun_l19_n509(x)
+    if (x < 1)
+        fun_l20_n106(x)
+    else
+        fun_l20_n428(x)
+    end
+end
+
+def fun_l19_n510(x)
+    if (x < 1)
+        fun_l20_n50(x)
+    else
+        fun_l20_n101(x)
+    end
+end
+
+def fun_l19_n511(x)
+    if (x < 1)
+        fun_l20_n75(x)
+    else
+        fun_l20_n299(x)
+    end
+end
+
+def fun_l19_n512(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n367(x)
+    end
+end
+
+def fun_l19_n513(x)
+    if (x < 1)
+        fun_l20_n278(x)
+    else
+        fun_l20_n803(x)
+    end
+end
+
+def fun_l19_n514(x)
+    if (x < 1)
+        fun_l20_n637(x)
+    else
+        fun_l20_n837(x)
+    end
+end
+
+def fun_l19_n515(x)
+    if (x < 1)
+        fun_l20_n908(x)
+    else
+        fun_l20_n410(x)
+    end
+end
+
+def fun_l19_n516(x)
+    if (x < 1)
+        fun_l20_n349(x)
+    else
+        fun_l20_n219(x)
+    end
+end
+
+def fun_l19_n517(x)
+    if (x < 1)
+        fun_l20_n869(x)
+    else
+        fun_l20_n922(x)
+    end
+end
+
+def fun_l19_n518(x)
+    if (x < 1)
+        fun_l20_n429(x)
+    else
+        fun_l20_n332(x)
+    end
+end
+
+def fun_l19_n519(x)
+    if (x < 1)
+        fun_l20_n775(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n520(x)
+    if (x < 1)
+        fun_l20_n551(x)
+    else
+        fun_l20_n214(x)
+    end
+end
+
+def fun_l19_n521(x)
+    if (x < 1)
+        fun_l20_n643(x)
+    else
+        fun_l20_n74(x)
+    end
+end
+
+def fun_l19_n522(x)
+    if (x < 1)
+        fun_l20_n960(x)
+    else
+        fun_l20_n189(x)
+    end
+end
+
+def fun_l19_n523(x)
+    if (x < 1)
+        fun_l20_n815(x)
+    else
+        fun_l20_n624(x)
+    end
+end
+
+def fun_l19_n524(x)
+    if (x < 1)
+        fun_l20_n247(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n525(x)
+    if (x < 1)
+        fun_l20_n261(x)
+    else
+        fun_l20_n728(x)
+    end
+end
+
+def fun_l19_n526(x)
+    if (x < 1)
+        fun_l20_n361(x)
+    else
+        fun_l20_n295(x)
+    end
+end
+
+def fun_l19_n527(x)
+    if (x < 1)
+        fun_l20_n559(x)
+    else
+        fun_l20_n763(x)
+    end
+end
+
+def fun_l19_n528(x)
+    if (x < 1)
+        fun_l20_n291(x)
+    else
+        fun_l20_n815(x)
+    end
+end
+
+def fun_l19_n529(x)
+    if (x < 1)
+        fun_l20_n224(x)
+    else
+        fun_l20_n305(x)
+    end
+end
+
+def fun_l19_n530(x)
+    if (x < 1)
+        fun_l20_n579(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n531(x)
+    if (x < 1)
+        fun_l20_n571(x)
+    else
+        fun_l20_n65(x)
+    end
+end
+
+def fun_l19_n532(x)
+    if (x < 1)
+        fun_l20_n815(x)
+    else
+        fun_l20_n567(x)
+    end
+end
+
+def fun_l19_n533(x)
+    if (x < 1)
+        fun_l20_n48(x)
+    else
+        fun_l20_n386(x)
+    end
+end
+
+def fun_l19_n534(x)
+    if (x < 1)
+        fun_l20_n478(x)
+    else
+        fun_l20_n679(x)
+    end
+end
+
+def fun_l19_n535(x)
+    if (x < 1)
+        fun_l20_n241(x)
+    else
+        fun_l20_n829(x)
+    end
+end
+
+def fun_l19_n536(x)
+    if (x < 1)
+        fun_l20_n267(x)
+    else
+        fun_l20_n160(x)
+    end
+end
+
+def fun_l19_n537(x)
+    if (x < 1)
+        fun_l20_n719(x)
+    else
+        fun_l20_n199(x)
+    end
+end
+
+def fun_l19_n538(x)
+    if (x < 1)
+        fun_l20_n477(x)
+    else
+        fun_l20_n662(x)
+    end
+end
+
+def fun_l19_n539(x)
+    if (x < 1)
+        fun_l20_n506(x)
+    else
+        fun_l20_n856(x)
+    end
+end
+
+def fun_l19_n540(x)
+    if (x < 1)
+        fun_l20_n717(x)
+    else
+        fun_l20_n207(x)
+    end
+end
+
+def fun_l19_n541(x)
+    if (x < 1)
+        fun_l20_n94(x)
+    else
+        fun_l20_n988(x)
+    end
+end
+
+def fun_l19_n542(x)
+    if (x < 1)
+        fun_l20_n837(x)
+    else
+        fun_l20_n334(x)
+    end
+end
+
+def fun_l19_n543(x)
+    if (x < 1)
+        fun_l20_n23(x)
+    else
+        fun_l20_n991(x)
+    end
+end
+
+def fun_l19_n544(x)
+    if (x < 1)
+        fun_l20_n558(x)
+    else
+        fun_l20_n740(x)
+    end
+end
+
+def fun_l19_n545(x)
+    if (x < 1)
+        fun_l20_n762(x)
+    else
+        fun_l20_n79(x)
+    end
+end
+
+def fun_l19_n546(x)
+    if (x < 1)
+        fun_l20_n81(x)
+    else
+        fun_l20_n331(x)
+    end
+end
+
+def fun_l19_n547(x)
+    if (x < 1)
+        fun_l20_n9(x)
+    else
+        fun_l20_n267(x)
+    end
+end
+
+def fun_l19_n548(x)
+    if (x < 1)
+        fun_l20_n550(x)
+    else
+        fun_l20_n98(x)
+    end
+end
+
+def fun_l19_n549(x)
+    if (x < 1)
+        fun_l20_n735(x)
+    else
+        fun_l20_n361(x)
+    end
+end
+
+def fun_l19_n550(x)
+    if (x < 1)
+        fun_l20_n155(x)
+    else
+        fun_l20_n560(x)
+    end
+end
+
+def fun_l19_n551(x)
+    if (x < 1)
+        fun_l20_n394(x)
+    else
+        fun_l20_n793(x)
+    end
+end
+
+def fun_l19_n552(x)
+    if (x < 1)
+        fun_l20_n826(x)
+    else
+        fun_l20_n508(x)
+    end
+end
+
+def fun_l19_n553(x)
+    if (x < 1)
+        fun_l20_n569(x)
+    else
+        fun_l20_n981(x)
+    end
+end
+
+def fun_l19_n554(x)
+    if (x < 1)
+        fun_l20_n580(x)
+    else
+        fun_l20_n848(x)
+    end
+end
+
+def fun_l19_n555(x)
+    if (x < 1)
+        fun_l20_n31(x)
+    else
+        fun_l20_n191(x)
+    end
+end
+
+def fun_l19_n556(x)
+    if (x < 1)
+        fun_l20_n283(x)
+    else
+        fun_l20_n376(x)
+    end
+end
+
+def fun_l19_n557(x)
+    if (x < 1)
+        fun_l20_n978(x)
+    else
+        fun_l20_n554(x)
+    end
+end
+
+def fun_l19_n558(x)
+    if (x < 1)
+        fun_l20_n727(x)
+    else
+        fun_l20_n89(x)
+    end
+end
+
+def fun_l19_n559(x)
+    if (x < 1)
+        fun_l20_n204(x)
+    else
+        fun_l20_n652(x)
+    end
+end
+
+def fun_l19_n560(x)
+    if (x < 1)
+        fun_l20_n481(x)
+    else
+        fun_l20_n114(x)
+    end
+end
+
+def fun_l19_n561(x)
+    if (x < 1)
+        fun_l20_n601(x)
+    else
+        fun_l20_n187(x)
+    end
+end
+
+def fun_l19_n562(x)
+    if (x < 1)
+        fun_l20_n682(x)
+    else
+        fun_l20_n88(x)
+    end
+end
+
+def fun_l19_n563(x)
+    if (x < 1)
+        fun_l20_n346(x)
+    else
+        fun_l20_n190(x)
+    end
+end
+
+def fun_l19_n564(x)
+    if (x < 1)
+        fun_l20_n15(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n565(x)
+    if (x < 1)
+        fun_l20_n555(x)
+    else
+        fun_l20_n208(x)
+    end
+end
+
+def fun_l19_n566(x)
+    if (x < 1)
+        fun_l20_n29(x)
+    else
+        fun_l20_n511(x)
+    end
+end
+
+def fun_l19_n567(x)
+    if (x < 1)
+        fun_l20_n897(x)
+    else
+        fun_l20_n309(x)
+    end
+end
+
+def fun_l19_n568(x)
+    if (x < 1)
+        fun_l20_n586(x)
+    else
+        fun_l20_n602(x)
+    end
+end
+
+def fun_l19_n569(x)
+    if (x < 1)
+        fun_l20_n51(x)
+    else
+        fun_l20_n483(x)
+    end
+end
+
+def fun_l19_n570(x)
+    if (x < 1)
+        fun_l20_n159(x)
+    else
+        fun_l20_n5(x)
+    end
+end
+
+def fun_l19_n571(x)
+    if (x < 1)
+        fun_l20_n892(x)
+    else
+        fun_l20_n336(x)
+    end
+end
+
+def fun_l19_n572(x)
+    if (x < 1)
+        fun_l20_n203(x)
+    else
+        fun_l20_n287(x)
+    end
+end
+
+def fun_l19_n573(x)
+    if (x < 1)
+        fun_l20_n41(x)
+    else
+        fun_l20_n51(x)
+    end
+end
+
+def fun_l19_n574(x)
+    if (x < 1)
+        fun_l20_n977(x)
+    else
+        fun_l20_n474(x)
+    end
+end
+
+def fun_l19_n575(x)
+    if (x < 1)
+        fun_l20_n247(x)
+    else
+        fun_l20_n281(x)
+    end
+end
+
+def fun_l19_n576(x)
+    if (x < 1)
+        fun_l20_n877(x)
+    else
+        fun_l20_n836(x)
+    end
+end
+
+def fun_l19_n577(x)
+    if (x < 1)
+        fun_l20_n527(x)
+    else
+        fun_l20_n549(x)
+    end
+end
+
+def fun_l19_n578(x)
+    if (x < 1)
+        fun_l20_n102(x)
+    else
+        fun_l20_n906(x)
+    end
+end
+
+def fun_l19_n579(x)
+    if (x < 1)
+        fun_l20_n842(x)
+    else
+        fun_l20_n554(x)
+    end
+end
+
+def fun_l19_n580(x)
+    if (x < 1)
+        fun_l20_n371(x)
+    else
+        fun_l20_n44(x)
+    end
+end
+
+def fun_l19_n581(x)
+    if (x < 1)
+        fun_l20_n306(x)
+    else
+        fun_l20_n571(x)
+    end
+end
+
+def fun_l19_n582(x)
+    if (x < 1)
+        fun_l20_n548(x)
+    else
+        fun_l20_n596(x)
+    end
+end
+
+def fun_l19_n583(x)
+    if (x < 1)
+        fun_l20_n724(x)
+    else
+        fun_l20_n835(x)
+    end
+end
+
+def fun_l19_n584(x)
+    if (x < 1)
+        fun_l20_n238(x)
+    else
+        fun_l20_n408(x)
+    end
+end
+
+def fun_l19_n585(x)
+    if (x < 1)
+        fun_l20_n378(x)
+    else
+        fun_l20_n272(x)
+    end
+end
+
+def fun_l19_n586(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n814(x)
+    end
+end
+
+def fun_l19_n587(x)
+    if (x < 1)
+        fun_l20_n210(x)
+    else
+        fun_l20_n801(x)
+    end
+end
+
+def fun_l19_n588(x)
+    if (x < 1)
+        fun_l20_n796(x)
+    else
+        fun_l20_n329(x)
+    end
+end
+
+def fun_l19_n589(x)
+    if (x < 1)
+        fun_l20_n403(x)
+    else
+        fun_l20_n392(x)
+    end
+end
+
+def fun_l19_n590(x)
+    if (x < 1)
+        fun_l20_n677(x)
+    else
+        fun_l20_n574(x)
+    end
+end
+
+def fun_l19_n591(x)
+    if (x < 1)
+        fun_l20_n183(x)
+    else
+        fun_l20_n962(x)
+    end
+end
+
+def fun_l19_n592(x)
+    if (x < 1)
+        fun_l20_n230(x)
+    else
+        fun_l20_n783(x)
+    end
+end
+
+def fun_l19_n593(x)
+    if (x < 1)
+        fun_l20_n191(x)
+    else
+        fun_l20_n42(x)
+    end
+end
+
+def fun_l19_n594(x)
+    if (x < 1)
+        fun_l20_n244(x)
+    else
+        fun_l20_n760(x)
+    end
+end
+
+def fun_l19_n595(x)
+    if (x < 1)
+        fun_l20_n754(x)
+    else
+        fun_l20_n570(x)
+    end
+end
+
+def fun_l19_n596(x)
+    if (x < 1)
+        fun_l20_n612(x)
+    else
+        fun_l20_n287(x)
+    end
+end
+
+def fun_l19_n597(x)
+    if (x < 1)
+        fun_l20_n89(x)
+    else
+        fun_l20_n625(x)
+    end
+end
+
+def fun_l19_n598(x)
+    if (x < 1)
+        fun_l20_n782(x)
+    else
+        fun_l20_n516(x)
+    end
+end
+
+def fun_l19_n599(x)
+    if (x < 1)
+        fun_l20_n75(x)
+    else
+        fun_l20_n857(x)
+    end
+end
+
+def fun_l19_n600(x)
+    if (x < 1)
+        fun_l20_n717(x)
+    else
+        fun_l20_n408(x)
+    end
+end
+
+def fun_l19_n601(x)
+    if (x < 1)
+        fun_l20_n528(x)
+    else
+        fun_l20_n761(x)
+    end
+end
+
+def fun_l19_n602(x)
+    if (x < 1)
+        fun_l20_n319(x)
+    else
+        fun_l20_n645(x)
+    end
+end
+
+def fun_l19_n603(x)
+    if (x < 1)
+        fun_l20_n20(x)
+    else
+        fun_l20_n621(x)
+    end
+end
+
+def fun_l19_n604(x)
+    if (x < 1)
+        fun_l20_n118(x)
+    else
+        fun_l20_n699(x)
+    end
+end
+
+def fun_l19_n605(x)
+    if (x < 1)
+        fun_l20_n19(x)
+    else
+        fun_l20_n63(x)
+    end
+end
+
+def fun_l19_n606(x)
+    if (x < 1)
+        fun_l20_n845(x)
+    else
+        fun_l20_n618(x)
+    end
+end
+
+def fun_l19_n607(x)
+    if (x < 1)
+        fun_l20_n733(x)
+    else
+        fun_l20_n880(x)
+    end
+end
+
+def fun_l19_n608(x)
+    if (x < 1)
+        fun_l20_n785(x)
+    else
+        fun_l20_n254(x)
+    end
+end
+
+def fun_l19_n609(x)
+    if (x < 1)
+        fun_l20_n393(x)
+    else
+        fun_l20_n946(x)
+    end
+end
+
+def fun_l19_n610(x)
+    if (x < 1)
+        fun_l20_n635(x)
+    else
+        fun_l20_n418(x)
+    end
+end
+
+def fun_l19_n611(x)
+    if (x < 1)
+        fun_l20_n987(x)
+    else
+        fun_l20_n703(x)
+    end
+end
+
+def fun_l19_n612(x)
+    if (x < 1)
+        fun_l20_n130(x)
+    else
+        fun_l20_n439(x)
+    end
+end
+
+def fun_l19_n613(x)
+    if (x < 1)
+        fun_l20_n516(x)
+    else
+        fun_l20_n724(x)
+    end
+end
+
+def fun_l19_n614(x)
+    if (x < 1)
+        fun_l20_n44(x)
+    else
+        fun_l20_n102(x)
+    end
+end
+
+def fun_l19_n615(x)
+    if (x < 1)
+        fun_l20_n353(x)
+    else
+        fun_l20_n999(x)
+    end
+end
+
+def fun_l19_n616(x)
+    if (x < 1)
+        fun_l20_n191(x)
+    else
+        fun_l20_n726(x)
+    end
+end
+
+def fun_l19_n617(x)
+    if (x < 1)
+        fun_l20_n375(x)
+    else
+        fun_l20_n575(x)
+    end
+end
+
+def fun_l19_n618(x)
+    if (x < 1)
+        fun_l20_n719(x)
+    else
+        fun_l20_n581(x)
+    end
+end
+
+def fun_l19_n619(x)
+    if (x < 1)
+        fun_l20_n960(x)
+    else
+        fun_l20_n316(x)
+    end
+end
+
+def fun_l19_n620(x)
+    if (x < 1)
+        fun_l20_n860(x)
+    else
+        fun_l20_n784(x)
+    end
+end
+
+def fun_l19_n621(x)
+    if (x < 1)
+        fun_l20_n124(x)
+    else
+        fun_l20_n577(x)
+    end
+end
+
+def fun_l19_n622(x)
+    if (x < 1)
+        fun_l20_n547(x)
+    else
+        fun_l20_n623(x)
+    end
+end
+
+def fun_l19_n623(x)
+    if (x < 1)
+        fun_l20_n842(x)
+    else
+        fun_l20_n380(x)
+    end
+end
+
+def fun_l19_n624(x)
+    if (x < 1)
+        fun_l20_n331(x)
+    else
+        fun_l20_n473(x)
+    end
+end
+
+def fun_l19_n625(x)
+    if (x < 1)
+        fun_l20_n118(x)
+    else
+        fun_l20_n392(x)
+    end
+end
+
+def fun_l19_n626(x)
+    if (x < 1)
+        fun_l20_n836(x)
+    else
+        fun_l20_n988(x)
+    end
+end
+
+def fun_l19_n627(x)
+    if (x < 1)
+        fun_l20_n641(x)
+    else
+        fun_l20_n372(x)
+    end
+end
+
+def fun_l19_n628(x)
+    if (x < 1)
+        fun_l20_n377(x)
+    else
+        fun_l20_n780(x)
+    end
+end
+
+def fun_l19_n629(x)
+    if (x < 1)
+        fun_l20_n180(x)
+    else
+        fun_l20_n670(x)
+    end
+end
+
+def fun_l19_n630(x)
+    if (x < 1)
+        fun_l20_n985(x)
+    else
+        fun_l20_n613(x)
+    end
+end
+
+def fun_l19_n631(x)
+    if (x < 1)
+        fun_l20_n149(x)
+    else
+        fun_l20_n754(x)
+    end
+end
+
+def fun_l19_n632(x)
+    if (x < 1)
+        fun_l20_n967(x)
+    else
+        fun_l20_n940(x)
+    end
+end
+
+def fun_l19_n633(x)
+    if (x < 1)
+        fun_l20_n91(x)
+    else
+        fun_l20_n772(x)
+    end
+end
+
+def fun_l19_n634(x)
+    if (x < 1)
+        fun_l20_n637(x)
+    else
+        fun_l20_n296(x)
+    end
+end
+
+def fun_l19_n635(x)
+    if (x < 1)
+        fun_l20_n50(x)
+    else
+        fun_l20_n314(x)
+    end
+end
+
+def fun_l19_n636(x)
+    if (x < 1)
+        fun_l20_n367(x)
+    else
+        fun_l20_n849(x)
+    end
+end
+
+def fun_l19_n637(x)
+    if (x < 1)
+        fun_l20_n229(x)
+    else
+        fun_l20_n550(x)
+    end
+end
+
+def fun_l19_n638(x)
+    if (x < 1)
+        fun_l20_n680(x)
+    else
+        fun_l20_n783(x)
+    end
+end
+
+def fun_l19_n639(x)
+    if (x < 1)
+        fun_l20_n879(x)
+    else
+        fun_l20_n264(x)
+    end
+end
+
+def fun_l19_n640(x)
+    if (x < 1)
+        fun_l20_n143(x)
+    else
+        fun_l20_n455(x)
+    end
+end
+
+def fun_l19_n641(x)
+    if (x < 1)
+        fun_l20_n191(x)
+    else
+        fun_l20_n110(x)
+    end
+end
+
+def fun_l19_n642(x)
+    if (x < 1)
+        fun_l20_n782(x)
+    else
+        fun_l20_n43(x)
+    end
+end
+
+def fun_l19_n643(x)
+    if (x < 1)
+        fun_l20_n320(x)
+    else
+        fun_l20_n376(x)
+    end
+end
+
+def fun_l19_n644(x)
+    if (x < 1)
+        fun_l20_n554(x)
+    else
+        fun_l20_n667(x)
+    end
+end
+
+def fun_l19_n645(x)
+    if (x < 1)
+        fun_l20_n29(x)
+    else
+        fun_l20_n938(x)
+    end
+end
+
+def fun_l19_n646(x)
+    if (x < 1)
+        fun_l20_n789(x)
+    else
+        fun_l20_n907(x)
+    end
+end
+
+def fun_l19_n647(x)
+    if (x < 1)
+        fun_l20_n859(x)
+    else
+        fun_l20_n138(x)
+    end
+end
+
+def fun_l19_n648(x)
+    if (x < 1)
+        fun_l20_n373(x)
+    else
+        fun_l20_n843(x)
+    end
+end
+
+def fun_l19_n649(x)
+    if (x < 1)
+        fun_l20_n50(x)
+    else
+        fun_l20_n982(x)
+    end
+end
+
+def fun_l19_n650(x)
+    if (x < 1)
+        fun_l20_n622(x)
+    else
+        fun_l20_n368(x)
+    end
+end
+
+def fun_l19_n651(x)
+    if (x < 1)
+        fun_l20_n231(x)
+    else
+        fun_l20_n523(x)
+    end
+end
+
+def fun_l19_n652(x)
+    if (x < 1)
+        fun_l20_n233(x)
+    else
+        fun_l20_n963(x)
+    end
+end
+
+def fun_l19_n653(x)
+    if (x < 1)
+        fun_l20_n363(x)
+    else
+        fun_l20_n177(x)
+    end
+end
+
+def fun_l19_n654(x)
+    if (x < 1)
+        fun_l20_n952(x)
+    else
+        fun_l20_n96(x)
+    end
+end
+
+def fun_l19_n655(x)
+    if (x < 1)
+        fun_l20_n98(x)
+    else
+        fun_l20_n93(x)
+    end
+end
+
+def fun_l19_n656(x)
+    if (x < 1)
+        fun_l20_n200(x)
+    else
+        fun_l20_n137(x)
+    end
+end
+
+def fun_l19_n657(x)
+    if (x < 1)
+        fun_l20_n485(x)
+    else
+        fun_l20_n45(x)
+    end
+end
+
+def fun_l19_n658(x)
+    if (x < 1)
+        fun_l20_n234(x)
+    else
+        fun_l20_n366(x)
+    end
+end
+
+def fun_l19_n659(x)
+    if (x < 1)
+        fun_l20_n120(x)
+    else
+        fun_l20_n850(x)
+    end
+end
+
+def fun_l19_n660(x)
+    if (x < 1)
+        fun_l20_n932(x)
+    else
+        fun_l20_n551(x)
+    end
+end
+
+def fun_l19_n661(x)
+    if (x < 1)
+        fun_l20_n952(x)
+    else
+        fun_l20_n178(x)
+    end
+end
+
+def fun_l19_n662(x)
+    if (x < 1)
+        fun_l20_n761(x)
+    else
+        fun_l20_n2(x)
+    end
+end
+
+def fun_l19_n663(x)
+    if (x < 1)
+        fun_l20_n674(x)
+    else
+        fun_l20_n698(x)
+    end
+end
+
+def fun_l19_n664(x)
+    if (x < 1)
+        fun_l20_n669(x)
+    else
+        fun_l20_n563(x)
+    end
+end
+
+def fun_l19_n665(x)
+    if (x < 1)
+        fun_l20_n106(x)
+    else
+        fun_l20_n442(x)
+    end
+end
+
+def fun_l19_n666(x)
+    if (x < 1)
+        fun_l20_n476(x)
+    else
+        fun_l20_n620(x)
+    end
+end
+
+def fun_l19_n667(x)
+    if (x < 1)
+        fun_l20_n813(x)
+    else
+        fun_l20_n501(x)
+    end
+end
+
+def fun_l19_n668(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n485(x)
+    end
+end
+
+def fun_l19_n669(x)
+    if (x < 1)
+        fun_l20_n533(x)
+    else
+        fun_l20_n801(x)
+    end
+end
+
+def fun_l19_n670(x)
+    if (x < 1)
+        fun_l20_n64(x)
+    else
+        fun_l20_n872(x)
+    end
+end
+
+def fun_l19_n671(x)
+    if (x < 1)
+        fun_l20_n770(x)
+    else
+        fun_l20_n101(x)
+    end
+end
+
+def fun_l19_n672(x)
+    if (x < 1)
+        fun_l20_n22(x)
+    else
+        fun_l20_n644(x)
+    end
+end
+
+def fun_l19_n673(x)
+    if (x < 1)
+        fun_l20_n634(x)
+    else
+        fun_l20_n955(x)
+    end
+end
+
+def fun_l19_n674(x)
+    if (x < 1)
+        fun_l20_n976(x)
+    else
+        fun_l20_n665(x)
+    end
+end
+
+def fun_l19_n675(x)
+    if (x < 1)
+        fun_l20_n988(x)
+    else
+        fun_l20_n793(x)
+    end
+end
+
+def fun_l19_n676(x)
+    if (x < 1)
+        fun_l20_n235(x)
+    else
+        fun_l20_n833(x)
+    end
+end
+
+def fun_l19_n677(x)
+    if (x < 1)
+        fun_l20_n604(x)
+    else
+        fun_l20_n797(x)
+    end
+end
+
+def fun_l19_n678(x)
+    if (x < 1)
+        fun_l20_n622(x)
+    else
+        fun_l20_n896(x)
+    end
+end
+
+def fun_l19_n679(x)
+    if (x < 1)
+        fun_l20_n190(x)
+    else
+        fun_l20_n281(x)
+    end
+end
+
+def fun_l19_n680(x)
+    if (x < 1)
+        fun_l20_n325(x)
+    else
+        fun_l20_n669(x)
+    end
+end
+
+def fun_l19_n681(x)
+    if (x < 1)
+        fun_l20_n898(x)
+    else
+        fun_l20_n352(x)
+    end
+end
+
+def fun_l19_n682(x)
+    if (x < 1)
+        fun_l20_n820(x)
+    else
+        fun_l20_n117(x)
+    end
+end
+
+def fun_l19_n683(x)
+    if (x < 1)
+        fun_l20_n148(x)
+    else
+        fun_l20_n842(x)
+    end
+end
+
+def fun_l19_n684(x)
+    if (x < 1)
+        fun_l20_n468(x)
+    else
+        fun_l20_n596(x)
+    end
+end
+
+def fun_l19_n685(x)
+    if (x < 1)
+        fun_l20_n285(x)
+    else
+        fun_l20_n730(x)
+    end
+end
+
+def fun_l19_n686(x)
+    if (x < 1)
+        fun_l20_n426(x)
+    else
+        fun_l20_n657(x)
+    end
+end
+
+def fun_l19_n687(x)
+    if (x < 1)
+        fun_l20_n874(x)
+    else
+        fun_l20_n867(x)
+    end
+end
+
+def fun_l19_n688(x)
+    if (x < 1)
+        fun_l20_n451(x)
+    else
+        fun_l20_n846(x)
+    end
+end
+
+def fun_l19_n689(x)
+    if (x < 1)
+        fun_l20_n425(x)
+    else
+        fun_l20_n796(x)
+    end
+end
+
+def fun_l19_n690(x)
+    if (x < 1)
+        fun_l20_n37(x)
+    else
+        fun_l20_n301(x)
+    end
+end
+
+def fun_l19_n691(x)
+    if (x < 1)
+        fun_l20_n886(x)
+    else
+        fun_l20_n513(x)
+    end
+end
+
+def fun_l19_n692(x)
+    if (x < 1)
+        fun_l20_n426(x)
+    else
+        fun_l20_n46(x)
+    end
+end
+
+def fun_l19_n693(x)
+    if (x < 1)
+        fun_l20_n622(x)
+    else
+        fun_l20_n738(x)
+    end
+end
+
+def fun_l19_n694(x)
+    if (x < 1)
+        fun_l20_n530(x)
+    else
+        fun_l20_n981(x)
+    end
+end
+
+def fun_l19_n695(x)
+    if (x < 1)
+        fun_l20_n568(x)
+    else
+        fun_l20_n934(x)
+    end
+end
+
+def fun_l19_n696(x)
+    if (x < 1)
+        fun_l20_n974(x)
+    else
+        fun_l20_n585(x)
+    end
+end
+
+def fun_l19_n697(x)
+    if (x < 1)
+        fun_l20_n780(x)
+    else
+        fun_l20_n408(x)
+    end
+end
+
+def fun_l19_n698(x)
+    if (x < 1)
+        fun_l20_n373(x)
+    else
+        fun_l20_n163(x)
+    end
+end
+
+def fun_l19_n699(x)
+    if (x < 1)
+        fun_l20_n745(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n700(x)
+    if (x < 1)
+        fun_l20_n307(x)
+    else
+        fun_l20_n172(x)
+    end
+end
+
+def fun_l19_n701(x)
+    if (x < 1)
+        fun_l20_n342(x)
+    else
+        fun_l20_n381(x)
+    end
+end
+
+def fun_l19_n702(x)
+    if (x < 1)
+        fun_l20_n67(x)
+    else
+        fun_l20_n841(x)
+    end
+end
+
+def fun_l19_n703(x)
+    if (x < 1)
+        fun_l20_n697(x)
+    else
+        fun_l20_n597(x)
+    end
+end
+
+def fun_l19_n704(x)
+    if (x < 1)
+        fun_l20_n809(x)
+    else
+        fun_l20_n306(x)
+    end
+end
+
+def fun_l19_n705(x)
+    if (x < 1)
+        fun_l20_n575(x)
+    else
+        fun_l20_n401(x)
+    end
+end
+
+def fun_l19_n706(x)
+    if (x < 1)
+        fun_l20_n651(x)
+    else
+        fun_l20_n552(x)
+    end
+end
+
+def fun_l19_n707(x)
+    if (x < 1)
+        fun_l20_n644(x)
+    else
+        fun_l20_n697(x)
+    end
+end
+
+def fun_l19_n708(x)
+    if (x < 1)
+        fun_l20_n572(x)
+    else
+        fun_l20_n86(x)
+    end
+end
+
+def fun_l19_n709(x)
+    if (x < 1)
+        fun_l20_n239(x)
+    else
+        fun_l20_n18(x)
+    end
+end
+
+def fun_l19_n710(x)
+    if (x < 1)
+        fun_l20_n48(x)
+    else
+        fun_l20_n822(x)
+    end
+end
+
+def fun_l19_n711(x)
+    if (x < 1)
+        fun_l20_n126(x)
+    else
+        fun_l20_n186(x)
+    end
+end
+
+def fun_l19_n712(x)
+    if (x < 1)
+        fun_l20_n552(x)
+    else
+        fun_l20_n901(x)
+    end
+end
+
+def fun_l19_n713(x)
+    if (x < 1)
+        fun_l20_n993(x)
+    else
+        fun_l20_n313(x)
+    end
+end
+
+def fun_l19_n714(x)
+    if (x < 1)
+        fun_l20_n918(x)
+    else
+        fun_l20_n718(x)
+    end
+end
+
+def fun_l19_n715(x)
+    if (x < 1)
+        fun_l20_n442(x)
+    else
+        fun_l20_n652(x)
+    end
+end
+
+def fun_l19_n716(x)
+    if (x < 1)
+        fun_l20_n624(x)
+    else
+        fun_l20_n492(x)
+    end
+end
+
+def fun_l19_n717(x)
+    if (x < 1)
+        fun_l20_n585(x)
+    else
+        fun_l20_n980(x)
+    end
+end
+
+def fun_l19_n718(x)
+    if (x < 1)
+        fun_l20_n159(x)
+    else
+        fun_l20_n327(x)
+    end
+end
+
+def fun_l19_n719(x)
+    if (x < 1)
+        fun_l20_n867(x)
+    else
+        fun_l20_n239(x)
+    end
+end
+
+def fun_l19_n720(x)
+    if (x < 1)
+        fun_l20_n551(x)
+    else
+        fun_l20_n123(x)
+    end
+end
+
+def fun_l19_n721(x)
+    if (x < 1)
+        fun_l20_n794(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n722(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n847(x)
+    end
+end
+
+def fun_l19_n723(x)
+    if (x < 1)
+        fun_l20_n560(x)
+    else
+        fun_l20_n163(x)
+    end
+end
+
+def fun_l19_n724(x)
+    if (x < 1)
+        fun_l20_n338(x)
+    else
+        fun_l20_n411(x)
+    end
+end
+
+def fun_l19_n725(x)
+    if (x < 1)
+        fun_l20_n227(x)
+    else
+        fun_l20_n437(x)
+    end
+end
+
+def fun_l19_n726(x)
+    if (x < 1)
+        fun_l20_n691(x)
+    else
+        fun_l20_n821(x)
+    end
+end
+
+def fun_l19_n727(x)
+    if (x < 1)
+        fun_l20_n578(x)
+    else
+        fun_l20_n589(x)
+    end
+end
+
+def fun_l19_n728(x)
+    if (x < 1)
+        fun_l20_n990(x)
+    else
+        fun_l20_n164(x)
+    end
+end
+
+def fun_l19_n729(x)
+    if (x < 1)
+        fun_l20_n620(x)
+    else
+        fun_l20_n736(x)
+    end
+end
+
+def fun_l19_n730(x)
+    if (x < 1)
+        fun_l20_n980(x)
+    else
+        fun_l20_n345(x)
+    end
+end
+
+def fun_l19_n731(x)
+    if (x < 1)
+        fun_l20_n302(x)
+    else
+        fun_l20_n75(x)
+    end
+end
+
+def fun_l19_n732(x)
+    if (x < 1)
+        fun_l20_n684(x)
+    else
+        fun_l20_n2(x)
+    end
+end
+
+def fun_l19_n733(x)
+    if (x < 1)
+        fun_l20_n11(x)
+    else
+        fun_l20_n503(x)
+    end
+end
+
+def fun_l19_n734(x)
+    if (x < 1)
+        fun_l20_n719(x)
+    else
+        fun_l20_n745(x)
+    end
+end
+
+def fun_l19_n735(x)
+    if (x < 1)
+        fun_l20_n74(x)
+    else
+        fun_l20_n413(x)
+    end
+end
+
+def fun_l19_n736(x)
+    if (x < 1)
+        fun_l20_n858(x)
+    else
+        fun_l20_n224(x)
+    end
+end
+
+def fun_l19_n737(x)
+    if (x < 1)
+        fun_l20_n372(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n738(x)
+    if (x < 1)
+        fun_l20_n274(x)
+    else
+        fun_l20_n967(x)
+    end
+end
+
+def fun_l19_n739(x)
+    if (x < 1)
+        fun_l20_n191(x)
+    else
+        fun_l20_n984(x)
+    end
+end
+
+def fun_l19_n740(x)
+    if (x < 1)
+        fun_l20_n646(x)
+    else
+        fun_l20_n279(x)
+    end
+end
+
+def fun_l19_n741(x)
+    if (x < 1)
+        fun_l20_n55(x)
+    else
+        fun_l20_n947(x)
+    end
+end
+
+def fun_l19_n742(x)
+    if (x < 1)
+        fun_l20_n306(x)
+    else
+        fun_l20_n798(x)
+    end
+end
+
+def fun_l19_n743(x)
+    if (x < 1)
+        fun_l20_n571(x)
+    else
+        fun_l20_n905(x)
+    end
+end
+
+def fun_l19_n744(x)
+    if (x < 1)
+        fun_l20_n270(x)
+    else
+        fun_l20_n290(x)
+    end
+end
+
+def fun_l19_n745(x)
+    if (x < 1)
+        fun_l20_n39(x)
+    else
+        fun_l20_n983(x)
+    end
+end
+
+def fun_l19_n746(x)
+    if (x < 1)
+        fun_l20_n405(x)
+    else
+        fun_l20_n727(x)
+    end
+end
+
+def fun_l19_n747(x)
+    if (x < 1)
+        fun_l20_n424(x)
+    else
+        fun_l20_n597(x)
+    end
+end
+
+def fun_l19_n748(x)
+    if (x < 1)
+        fun_l20_n602(x)
+    else
+        fun_l20_n467(x)
+    end
+end
+
+def fun_l19_n749(x)
+    if (x < 1)
+        fun_l20_n859(x)
+    else
+        fun_l20_n76(x)
+    end
+end
+
+def fun_l19_n750(x)
+    if (x < 1)
+        fun_l20_n201(x)
+    else
+        fun_l20_n948(x)
+    end
+end
+
+def fun_l19_n751(x)
+    if (x < 1)
+        fun_l20_n998(x)
+    else
+        fun_l20_n425(x)
+    end
+end
+
+def fun_l19_n752(x)
+    if (x < 1)
+        fun_l20_n352(x)
+    else
+        fun_l20_n762(x)
+    end
+end
+
+def fun_l19_n753(x)
+    if (x < 1)
+        fun_l20_n996(x)
+    else
+        fun_l20_n136(x)
+    end
+end
+
+def fun_l19_n754(x)
+    if (x < 1)
+        fun_l20_n462(x)
+    else
+        fun_l20_n544(x)
+    end
+end
+
+def fun_l19_n755(x)
+    if (x < 1)
+        fun_l20_n126(x)
+    else
+        fun_l20_n857(x)
+    end
+end
+
+def fun_l19_n756(x)
+    if (x < 1)
+        fun_l20_n695(x)
+    else
+        fun_l20_n444(x)
+    end
+end
+
+def fun_l19_n757(x)
+    if (x < 1)
+        fun_l20_n694(x)
+    else
+        fun_l20_n718(x)
+    end
+end
+
+def fun_l19_n758(x)
+    if (x < 1)
+        fun_l20_n308(x)
+    else
+        fun_l20_n867(x)
+    end
+end
+
+def fun_l19_n759(x)
+    if (x < 1)
+        fun_l20_n224(x)
+    else
+        fun_l20_n739(x)
+    end
+end
+
+def fun_l19_n760(x)
+    if (x < 1)
+        fun_l20_n286(x)
+    else
+        fun_l20_n660(x)
+    end
+end
+
+def fun_l19_n761(x)
+    if (x < 1)
+        fun_l20_n486(x)
+    else
+        fun_l20_n614(x)
+    end
+end
+
+def fun_l19_n762(x)
+    if (x < 1)
+        fun_l20_n234(x)
+    else
+        fun_l20_n812(x)
+    end
+end
+
+def fun_l19_n763(x)
+    if (x < 1)
+        fun_l20_n663(x)
+    else
+        fun_l20_n649(x)
+    end
+end
+
+def fun_l19_n764(x)
+    if (x < 1)
+        fun_l20_n815(x)
+    else
+        fun_l20_n436(x)
+    end
+end
+
+def fun_l19_n765(x)
+    if (x < 1)
+        fun_l20_n330(x)
+    else
+        fun_l20_n350(x)
+    end
+end
+
+def fun_l19_n766(x)
+    if (x < 1)
+        fun_l20_n532(x)
+    else
+        fun_l20_n676(x)
+    end
+end
+
+def fun_l19_n767(x)
+    if (x < 1)
+        fun_l20_n74(x)
+    else
+        fun_l20_n182(x)
+    end
+end
+
+def fun_l19_n768(x)
+    if (x < 1)
+        fun_l20_n432(x)
+    else
+        fun_l20_n912(x)
+    end
+end
+
+def fun_l19_n769(x)
+    if (x < 1)
+        fun_l20_n413(x)
+    else
+        fun_l20_n315(x)
+    end
+end
+
+def fun_l19_n770(x)
+    if (x < 1)
+        fun_l20_n457(x)
+    else
+        fun_l20_n917(x)
+    end
+end
+
+def fun_l19_n771(x)
+    if (x < 1)
+        fun_l20_n435(x)
+    else
+        fun_l20_n768(x)
+    end
+end
+
+def fun_l19_n772(x)
+    if (x < 1)
+        fun_l20_n994(x)
+    else
+        fun_l20_n865(x)
+    end
+end
+
+def fun_l19_n773(x)
+    if (x < 1)
+        fun_l20_n425(x)
+    else
+        fun_l20_n347(x)
+    end
+end
+
+def fun_l19_n774(x)
+    if (x < 1)
+        fun_l20_n405(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n775(x)
+    if (x < 1)
+        fun_l20_n460(x)
+    else
+        fun_l20_n417(x)
+    end
+end
+
+def fun_l19_n776(x)
+    if (x < 1)
+        fun_l20_n539(x)
+    else
+        fun_l20_n825(x)
+    end
+end
+
+def fun_l19_n777(x)
+    if (x < 1)
+        fun_l20_n180(x)
+    else
+        fun_l20_n613(x)
+    end
+end
+
+def fun_l19_n778(x)
+    if (x < 1)
+        fun_l20_n452(x)
+    else
+        fun_l20_n717(x)
+    end
+end
+
+def fun_l19_n779(x)
+    if (x < 1)
+        fun_l20_n265(x)
+    else
+        fun_l20_n802(x)
+    end
+end
+
+def fun_l19_n780(x)
+    if (x < 1)
+        fun_l20_n941(x)
+    else
+        fun_l20_n939(x)
+    end
+end
+
+def fun_l19_n781(x)
+    if (x < 1)
+        fun_l20_n777(x)
+    else
+        fun_l20_n796(x)
+    end
+end
+
+def fun_l19_n782(x)
+    if (x < 1)
+        fun_l20_n924(x)
+    else
+        fun_l20_n442(x)
+    end
+end
+
+def fun_l19_n783(x)
+    if (x < 1)
+        fun_l20_n901(x)
+    else
+        fun_l20_n817(x)
+    end
+end
+
+def fun_l19_n784(x)
+    if (x < 1)
+        fun_l20_n101(x)
+    else
+        fun_l20_n983(x)
+    end
+end
+
+def fun_l19_n785(x)
+    if (x < 1)
+        fun_l20_n992(x)
+    else
+        fun_l20_n790(x)
+    end
+end
+
+def fun_l19_n786(x)
+    if (x < 1)
+        fun_l20_n426(x)
+    else
+        fun_l20_n337(x)
+    end
+end
+
+def fun_l19_n787(x)
+    if (x < 1)
+        fun_l20_n812(x)
+    else
+        fun_l20_n7(x)
+    end
+end
+
+def fun_l19_n788(x)
+    if (x < 1)
+        fun_l20_n768(x)
+    else
+        fun_l20_n25(x)
+    end
+end
+
+def fun_l19_n789(x)
+    if (x < 1)
+        fun_l20_n292(x)
+    else
+        fun_l20_n440(x)
+    end
+end
+
+def fun_l19_n790(x)
+    if (x < 1)
+        fun_l20_n855(x)
+    else
+        fun_l20_n191(x)
+    end
+end
+
+def fun_l19_n791(x)
+    if (x < 1)
+        fun_l20_n32(x)
+    else
+        fun_l20_n855(x)
+    end
+end
+
+def fun_l19_n792(x)
+    if (x < 1)
+        fun_l20_n920(x)
+    else
+        fun_l20_n198(x)
+    end
+end
+
+def fun_l19_n793(x)
+    if (x < 1)
+        fun_l20_n411(x)
+    else
+        fun_l20_n396(x)
+    end
+end
+
+def fun_l19_n794(x)
+    if (x < 1)
+        fun_l20_n977(x)
+    else
+        fun_l20_n712(x)
+    end
+end
+
+def fun_l19_n795(x)
+    if (x < 1)
+        fun_l20_n636(x)
+    else
+        fun_l20_n66(x)
+    end
+end
+
+def fun_l19_n796(x)
+    if (x < 1)
+        fun_l20_n137(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n797(x)
+    if (x < 1)
+        fun_l20_n51(x)
+    else
+        fun_l20_n244(x)
+    end
+end
+
+def fun_l19_n798(x)
+    if (x < 1)
+        fun_l20_n426(x)
+    else
+        fun_l20_n418(x)
+    end
+end
+
+def fun_l19_n799(x)
+    if (x < 1)
+        fun_l20_n272(x)
+    else
+        fun_l20_n365(x)
+    end
+end
+
+def fun_l19_n800(x)
+    if (x < 1)
+        fun_l20_n361(x)
+    else
+        fun_l20_n952(x)
+    end
+end
+
+def fun_l19_n801(x)
+    if (x < 1)
+        fun_l20_n428(x)
+    else
+        fun_l20_n683(x)
+    end
+end
+
+def fun_l19_n802(x)
+    if (x < 1)
+        fun_l20_n54(x)
+    else
+        fun_l20_n86(x)
+    end
+end
+
+def fun_l19_n803(x)
+    if (x < 1)
+        fun_l20_n771(x)
+    else
+        fun_l20_n555(x)
+    end
+end
+
+def fun_l19_n804(x)
+    if (x < 1)
+        fun_l20_n498(x)
+    else
+        fun_l20_n744(x)
+    end
+end
+
+def fun_l19_n805(x)
+    if (x < 1)
+        fun_l20_n30(x)
+    else
+        fun_l20_n813(x)
+    end
+end
+
+def fun_l19_n806(x)
+    if (x < 1)
+        fun_l20_n96(x)
+    else
+        fun_l20_n295(x)
+    end
+end
+
+def fun_l19_n807(x)
+    if (x < 1)
+        fun_l20_n128(x)
+    else
+        fun_l20_n584(x)
+    end
+end
+
+def fun_l19_n808(x)
+    if (x < 1)
+        fun_l20_n818(x)
+    else
+        fun_l20_n396(x)
+    end
+end
+
+def fun_l19_n809(x)
+    if (x < 1)
+        fun_l20_n896(x)
+    else
+        fun_l20_n779(x)
+    end
+end
+
+def fun_l19_n810(x)
+    if (x < 1)
+        fun_l20_n40(x)
+    else
+        fun_l20_n638(x)
+    end
+end
+
+def fun_l19_n811(x)
+    if (x < 1)
+        fun_l20_n925(x)
+    else
+        fun_l20_n914(x)
+    end
+end
+
+def fun_l19_n812(x)
+    if (x < 1)
+        fun_l20_n217(x)
+    else
+        fun_l20_n833(x)
+    end
+end
+
+def fun_l19_n813(x)
+    if (x < 1)
+        fun_l20_n687(x)
+    else
+        fun_l20_n469(x)
+    end
+end
+
+def fun_l19_n814(x)
+    if (x < 1)
+        fun_l20_n709(x)
+    else
+        fun_l20_n196(x)
+    end
+end
+
+def fun_l19_n815(x)
+    if (x < 1)
+        fun_l20_n633(x)
+    else
+        fun_l20_n622(x)
+    end
+end
+
+def fun_l19_n816(x)
+    if (x < 1)
+        fun_l20_n976(x)
+    else
+        fun_l20_n691(x)
+    end
+end
+
+def fun_l19_n817(x)
+    if (x < 1)
+        fun_l20_n260(x)
+    else
+        fun_l20_n592(x)
+    end
+end
+
+def fun_l19_n818(x)
+    if (x < 1)
+        fun_l20_n893(x)
+    else
+        fun_l20_n353(x)
+    end
+end
+
+def fun_l19_n819(x)
+    if (x < 1)
+        fun_l20_n824(x)
+    else
+        fun_l20_n875(x)
+    end
+end
+
+def fun_l19_n820(x)
+    if (x < 1)
+        fun_l20_n605(x)
+    else
+        fun_l20_n797(x)
+    end
+end
+
+def fun_l19_n821(x)
+    if (x < 1)
+        fun_l20_n990(x)
+    else
+        fun_l20_n272(x)
+    end
+end
+
+def fun_l19_n822(x)
+    if (x < 1)
+        fun_l20_n819(x)
+    else
+        fun_l20_n313(x)
+    end
+end
+
+def fun_l19_n823(x)
+    if (x < 1)
+        fun_l20_n838(x)
+    else
+        fun_l20_n513(x)
+    end
+end
+
+def fun_l19_n824(x)
+    if (x < 1)
+        fun_l20_n332(x)
+    else
+        fun_l20_n838(x)
+    end
+end
+
+def fun_l19_n825(x)
+    if (x < 1)
+        fun_l20_n994(x)
+    else
+        fun_l20_n641(x)
+    end
+end
+
+def fun_l19_n826(x)
+    if (x < 1)
+        fun_l20_n820(x)
+    else
+        fun_l20_n17(x)
+    end
+end
+
+def fun_l19_n827(x)
+    if (x < 1)
+        fun_l20_n645(x)
+    else
+        fun_l20_n587(x)
+    end
+end
+
+def fun_l19_n828(x)
+    if (x < 1)
+        fun_l20_n352(x)
+    else
+        fun_l20_n726(x)
+    end
+end
+
+def fun_l19_n829(x)
+    if (x < 1)
+        fun_l20_n33(x)
+    else
+        fun_l20_n803(x)
+    end
+end
+
+def fun_l19_n830(x)
+    if (x < 1)
+        fun_l20_n854(x)
+    else
+        fun_l20_n468(x)
+    end
+end
+
+def fun_l19_n831(x)
+    if (x < 1)
+        fun_l20_n149(x)
+    else
+        fun_l20_n529(x)
+    end
+end
+
+def fun_l19_n832(x)
+    if (x < 1)
+        fun_l20_n442(x)
+    else
+        fun_l20_n114(x)
+    end
+end
+
+def fun_l19_n833(x)
+    if (x < 1)
+        fun_l20_n986(x)
+    else
+        fun_l20_n778(x)
+    end
+end
+
+def fun_l19_n834(x)
+    if (x < 1)
+        fun_l20_n220(x)
+    else
+        fun_l20_n782(x)
+    end
+end
+
+def fun_l19_n835(x)
+    if (x < 1)
+        fun_l20_n330(x)
+    else
+        fun_l20_n361(x)
+    end
+end
+
+def fun_l19_n836(x)
+    if (x < 1)
+        fun_l20_n805(x)
+    else
+        fun_l20_n204(x)
+    end
+end
+
+def fun_l19_n837(x)
+    if (x < 1)
+        fun_l20_n534(x)
+    else
+        fun_l20_n970(x)
+    end
+end
+
+def fun_l19_n838(x)
+    if (x < 1)
+        fun_l20_n890(x)
+    else
+        fun_l20_n526(x)
+    end
+end
+
+def fun_l19_n839(x)
+    if (x < 1)
+        fun_l20_n511(x)
+    else
+        fun_l20_n743(x)
+    end
+end
+
+def fun_l19_n840(x)
+    if (x < 1)
+        fun_l20_n730(x)
+    else
+        fun_l20_n435(x)
+    end
+end
+
+def fun_l19_n841(x)
+    if (x < 1)
+        fun_l20_n34(x)
+    else
+        fun_l20_n228(x)
+    end
+end
+
+def fun_l19_n842(x)
+    if (x < 1)
+        fun_l20_n170(x)
+    else
+        fun_l20_n162(x)
+    end
+end
+
+def fun_l19_n843(x)
+    if (x < 1)
+        fun_l20_n987(x)
+    else
+        fun_l20_n631(x)
+    end
+end
+
+def fun_l19_n844(x)
+    if (x < 1)
+        fun_l20_n193(x)
+    else
+        fun_l20_n48(x)
+    end
+end
+
+def fun_l19_n845(x)
+    if (x < 1)
+        fun_l20_n479(x)
+    else
+        fun_l20_n295(x)
+    end
+end
+
+def fun_l19_n846(x)
+    if (x < 1)
+        fun_l20_n545(x)
+    else
+        fun_l20_n474(x)
+    end
+end
+
+def fun_l19_n847(x)
+    if (x < 1)
+        fun_l20_n155(x)
+    else
+        fun_l20_n222(x)
+    end
+end
+
+def fun_l19_n848(x)
+    if (x < 1)
+        fun_l20_n641(x)
+    else
+        fun_l20_n151(x)
+    end
+end
+
+def fun_l19_n849(x)
+    if (x < 1)
+        fun_l20_n191(x)
+    else
+        fun_l20_n563(x)
+    end
+end
+
+def fun_l19_n850(x)
+    if (x < 1)
+        fun_l20_n891(x)
+    else
+        fun_l20_n247(x)
+    end
+end
+
+def fun_l19_n851(x)
+    if (x < 1)
+        fun_l20_n987(x)
+    else
+        fun_l20_n296(x)
+    end
+end
+
+def fun_l19_n852(x)
+    if (x < 1)
+        fun_l20_n86(x)
+    else
+        fun_l20_n346(x)
+    end
+end
+
+def fun_l19_n853(x)
+    if (x < 1)
+        fun_l20_n93(x)
+    else
+        fun_l20_n198(x)
+    end
+end
+
+def fun_l19_n854(x)
+    if (x < 1)
+        fun_l20_n767(x)
+    else
+        fun_l20_n759(x)
+    end
+end
+
+def fun_l19_n855(x)
+    if (x < 1)
+        fun_l20_n571(x)
+    else
+        fun_l20_n456(x)
+    end
+end
+
+def fun_l19_n856(x)
+    if (x < 1)
+        fun_l20_n722(x)
+    else
+        fun_l20_n603(x)
+    end
+end
+
+def fun_l19_n857(x)
+    if (x < 1)
+        fun_l20_n940(x)
+    else
+        fun_l20_n163(x)
+    end
+end
+
+def fun_l19_n858(x)
+    if (x < 1)
+        fun_l20_n973(x)
+    else
+        fun_l20_n598(x)
+    end
+end
+
+def fun_l19_n859(x)
+    if (x < 1)
+        fun_l20_n79(x)
+    else
+        fun_l20_n401(x)
+    end
+end
+
+def fun_l19_n860(x)
+    if (x < 1)
+        fun_l20_n234(x)
+    else
+        fun_l20_n769(x)
+    end
+end
+
+def fun_l19_n861(x)
+    if (x < 1)
+        fun_l20_n292(x)
+    else
+        fun_l20_n526(x)
+    end
+end
+
+def fun_l19_n862(x)
+    if (x < 1)
+        fun_l20_n554(x)
+    else
+        fun_l20_n468(x)
+    end
+end
+
+def fun_l19_n863(x)
+    if (x < 1)
+        fun_l20_n386(x)
+    else
+        fun_l20_n946(x)
+    end
+end
+
+def fun_l19_n864(x)
+    if (x < 1)
+        fun_l20_n227(x)
+    else
+        fun_l20_n287(x)
+    end
+end
+
+def fun_l19_n865(x)
+    if (x < 1)
+        fun_l20_n485(x)
+    else
+        fun_l20_n276(x)
+    end
+end
+
+def fun_l19_n866(x)
+    if (x < 1)
+        fun_l20_n38(x)
+    else
+        fun_l20_n329(x)
+    end
+end
+
+def fun_l19_n867(x)
+    if (x < 1)
+        fun_l20_n1(x)
+    else
+        fun_l20_n985(x)
+    end
+end
+
+def fun_l19_n868(x)
+    if (x < 1)
+        fun_l20_n13(x)
+    else
+        fun_l20_n823(x)
+    end
+end
+
+def fun_l19_n869(x)
+    if (x < 1)
+        fun_l20_n834(x)
+    else
+        fun_l20_n959(x)
+    end
+end
+
+def fun_l19_n870(x)
+    if (x < 1)
+        fun_l20_n177(x)
+    else
+        fun_l20_n232(x)
+    end
+end
+
+def fun_l19_n871(x)
+    if (x < 1)
+        fun_l20_n56(x)
+    else
+        fun_l20_n712(x)
+    end
+end
+
+def fun_l19_n872(x)
+    if (x < 1)
+        fun_l20_n69(x)
+    else
+        fun_l20_n850(x)
+    end
+end
+
+def fun_l19_n873(x)
+    if (x < 1)
+        fun_l20_n558(x)
+    else
+        fun_l20_n877(x)
+    end
+end
+
+def fun_l19_n874(x)
+    if (x < 1)
+        fun_l20_n34(x)
+    else
+        fun_l20_n540(x)
+    end
+end
+
+def fun_l19_n875(x)
+    if (x < 1)
+        fun_l20_n392(x)
+    else
+        fun_l20_n904(x)
+    end
+end
+
+def fun_l19_n876(x)
+    if (x < 1)
+        fun_l20_n99(x)
+    else
+        fun_l20_n691(x)
+    end
+end
+
+def fun_l19_n877(x)
+    if (x < 1)
+        fun_l20_n799(x)
+    else
+        fun_l20_n982(x)
+    end
+end
+
+def fun_l19_n878(x)
+    if (x < 1)
+        fun_l20_n511(x)
+    else
+        fun_l20_n869(x)
+    end
+end
+
+def fun_l19_n879(x)
+    if (x < 1)
+        fun_l20_n65(x)
+    else
+        fun_l20_n318(x)
+    end
+end
+
+def fun_l19_n880(x)
+    if (x < 1)
+        fun_l20_n335(x)
+    else
+        fun_l20_n811(x)
+    end
+end
+
+def fun_l19_n881(x)
+    if (x < 1)
+        fun_l20_n165(x)
+    else
+        fun_l20_n870(x)
+    end
+end
+
+def fun_l19_n882(x)
+    if (x < 1)
+        fun_l20_n427(x)
+    else
+        fun_l20_n597(x)
+    end
+end
+
+def fun_l19_n883(x)
+    if (x < 1)
+        fun_l20_n319(x)
+    else
+        fun_l20_n503(x)
+    end
+end
+
+def fun_l19_n884(x)
+    if (x < 1)
+        fun_l20_n57(x)
+    else
+        fun_l20_n620(x)
+    end
+end
+
+def fun_l19_n885(x)
+    if (x < 1)
+        fun_l20_n489(x)
+    else
+        fun_l20_n359(x)
+    end
+end
+
+def fun_l19_n886(x)
+    if (x < 1)
+        fun_l20_n773(x)
+    else
+        fun_l20_n719(x)
+    end
+end
+
+def fun_l19_n887(x)
+    if (x < 1)
+        fun_l20_n969(x)
+    else
+        fun_l20_n32(x)
+    end
+end
+
+def fun_l19_n888(x)
+    if (x < 1)
+        fun_l20_n758(x)
+    else
+        fun_l20_n132(x)
+    end
+end
+
+def fun_l19_n889(x)
+    if (x < 1)
+        fun_l20_n130(x)
+    else
+        fun_l20_n886(x)
+    end
+end
+
+def fun_l19_n890(x)
+    if (x < 1)
+        fun_l20_n195(x)
+    else
+        fun_l20_n258(x)
+    end
+end
+
+def fun_l19_n891(x)
+    if (x < 1)
+        fun_l20_n747(x)
+    else
+        fun_l20_n967(x)
+    end
+end
+
+def fun_l19_n892(x)
+    if (x < 1)
+        fun_l20_n403(x)
+    else
+        fun_l20_n314(x)
+    end
+end
+
+def fun_l19_n893(x)
+    if (x < 1)
+        fun_l20_n927(x)
+    else
+        fun_l20_n923(x)
+    end
+end
+
+def fun_l19_n894(x)
+    if (x < 1)
+        fun_l20_n894(x)
+    else
+        fun_l20_n318(x)
+    end
+end
+
+def fun_l19_n895(x)
+    if (x < 1)
+        fun_l20_n825(x)
+    else
+        fun_l20_n574(x)
+    end
+end
+
+def fun_l19_n896(x)
+    if (x < 1)
+        fun_l20_n436(x)
+    else
+        fun_l20_n321(x)
+    end
+end
+
+def fun_l19_n897(x)
+    if (x < 1)
+        fun_l20_n317(x)
+    else
+        fun_l20_n312(x)
+    end
+end
+
+def fun_l19_n898(x)
+    if (x < 1)
+        fun_l20_n219(x)
+    else
+        fun_l20_n362(x)
+    end
+end
+
+def fun_l19_n899(x)
+    if (x < 1)
+        fun_l20_n731(x)
+    else
+        fun_l20_n1(x)
+    end
+end
+
+def fun_l19_n900(x)
+    if (x < 1)
+        fun_l20_n804(x)
+    else
+        fun_l20_n629(x)
+    end
+end
+
+def fun_l19_n901(x)
+    if (x < 1)
+        fun_l20_n152(x)
+    else
+        fun_l20_n232(x)
+    end
+end
+
+def fun_l19_n902(x)
+    if (x < 1)
+        fun_l20_n104(x)
+    else
+        fun_l20_n579(x)
+    end
+end
+
+def fun_l19_n903(x)
+    if (x < 1)
+        fun_l20_n860(x)
+    else
+        fun_l20_n322(x)
+    end
+end
+
+def fun_l19_n904(x)
+    if (x < 1)
+        fun_l20_n55(x)
+    else
+        fun_l20_n70(x)
+    end
+end
+
+def fun_l19_n905(x)
+    if (x < 1)
+        fun_l20_n674(x)
+    else
+        fun_l20_n713(x)
+    end
+end
+
+def fun_l19_n906(x)
+    if (x < 1)
+        fun_l20_n957(x)
+    else
+        fun_l20_n962(x)
+    end
+end
+
+def fun_l19_n907(x)
+    if (x < 1)
+        fun_l20_n656(x)
+    else
+        fun_l20_n582(x)
+    end
+end
+
+def fun_l19_n908(x)
+    if (x < 1)
+        fun_l20_n3(x)
+    else
+        fun_l20_n323(x)
+    end
+end
+
+def fun_l19_n909(x)
+    if (x < 1)
+        fun_l20_n763(x)
+    else
+        fun_l20_n387(x)
+    end
+end
+
+def fun_l19_n910(x)
+    if (x < 1)
+        fun_l20_n434(x)
+    else
+        fun_l20_n113(x)
+    end
+end
+
+def fun_l19_n911(x)
+    if (x < 1)
+        fun_l20_n713(x)
+    else
+        fun_l20_n4(x)
+    end
+end
+
+def fun_l19_n912(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n776(x)
+    end
+end
+
+def fun_l19_n913(x)
+    if (x < 1)
+        fun_l20_n541(x)
+    else
+        fun_l20_n80(x)
+    end
+end
+
+def fun_l19_n914(x)
+    if (x < 1)
+        fun_l20_n131(x)
+    else
+        fun_l20_n982(x)
+    end
+end
+
+def fun_l19_n915(x)
+    if (x < 1)
+        fun_l20_n558(x)
+    else
+        fun_l20_n538(x)
+    end
+end
+
+def fun_l19_n916(x)
+    if (x < 1)
+        fun_l20_n715(x)
+    else
+        fun_l20_n401(x)
+    end
+end
+
+def fun_l19_n917(x)
+    if (x < 1)
+        fun_l20_n820(x)
+    else
+        fun_l20_n576(x)
+    end
+end
+
+def fun_l19_n918(x)
+    if (x < 1)
+        fun_l20_n602(x)
+    else
+        fun_l20_n158(x)
+    end
+end
+
+def fun_l19_n919(x)
+    if (x < 1)
+        fun_l20_n127(x)
+    else
+        fun_l20_n493(x)
+    end
+end
+
+def fun_l19_n920(x)
+    if (x < 1)
+        fun_l20_n719(x)
+    else
+        fun_l20_n895(x)
+    end
+end
+
+def fun_l19_n921(x)
+    if (x < 1)
+        fun_l20_n277(x)
+    else
+        fun_l20_n588(x)
+    end
+end
+
+def fun_l19_n922(x)
+    if (x < 1)
+        fun_l20_n479(x)
+    else
+        fun_l20_n799(x)
+    end
+end
+
+def fun_l19_n923(x)
+    if (x < 1)
+        fun_l20_n879(x)
+    else
+        fun_l20_n809(x)
+    end
+end
+
+def fun_l19_n924(x)
+    if (x < 1)
+        fun_l20_n574(x)
+    else
+        fun_l20_n756(x)
+    end
+end
+
+def fun_l19_n925(x)
+    if (x < 1)
+        fun_l20_n774(x)
+    else
+        fun_l20_n806(x)
+    end
+end
+
+def fun_l19_n926(x)
+    if (x < 1)
+        fun_l20_n804(x)
+    else
+        fun_l20_n87(x)
+    end
+end
+
+def fun_l19_n927(x)
+    if (x < 1)
+        fun_l20_n647(x)
+    else
+        fun_l20_n497(x)
+    end
+end
+
+def fun_l19_n928(x)
+    if (x < 1)
+        fun_l20_n134(x)
+    else
+        fun_l20_n690(x)
+    end
+end
+
+def fun_l19_n929(x)
+    if (x < 1)
+        fun_l20_n981(x)
+    else
+        fun_l20_n590(x)
+    end
+end
+
+def fun_l19_n930(x)
+    if (x < 1)
+        fun_l20_n393(x)
+    else
+        fun_l20_n585(x)
+    end
+end
+
+def fun_l19_n931(x)
+    if (x < 1)
+        fun_l20_n408(x)
+    else
+        fun_l20_n753(x)
+    end
+end
+
+def fun_l19_n932(x)
+    if (x < 1)
+        fun_l20_n133(x)
+    else
+        fun_l20_n289(x)
+    end
+end
+
+def fun_l19_n933(x)
+    if (x < 1)
+        fun_l20_n552(x)
+    else
+        fun_l20_n867(x)
+    end
+end
+
+def fun_l19_n934(x)
+    if (x < 1)
+        fun_l20_n232(x)
+    else
+        fun_l20_n134(x)
+    end
+end
+
+def fun_l19_n935(x)
+    if (x < 1)
+        fun_l20_n45(x)
+    else
+        fun_l20_n100(x)
+    end
+end
+
+def fun_l19_n936(x)
+    if (x < 1)
+        fun_l20_n263(x)
+    else
+        fun_l20_n686(x)
+    end
+end
+
+def fun_l19_n937(x)
+    if (x < 1)
+        fun_l20_n63(x)
+    else
+        fun_l20_n401(x)
+    end
+end
+
+def fun_l19_n938(x)
+    if (x < 1)
+        fun_l20_n564(x)
+    else
+        fun_l20_n265(x)
+    end
+end
+
+def fun_l19_n939(x)
+    if (x < 1)
+        fun_l20_n414(x)
+    else
+        fun_l20_n32(x)
+    end
+end
+
+def fun_l19_n940(x)
+    if (x < 1)
+        fun_l20_n686(x)
+    else
+        fun_l20_n116(x)
+    end
+end
+
+def fun_l19_n941(x)
+    if (x < 1)
+        fun_l20_n812(x)
+    else
+        fun_l20_n438(x)
+    end
+end
+
+def fun_l19_n942(x)
+    if (x < 1)
+        fun_l20_n365(x)
+    else
+        fun_l20_n95(x)
+    end
+end
+
+def fun_l19_n943(x)
+    if (x < 1)
+        fun_l20_n159(x)
+    else
+        fun_l20_n763(x)
+    end
+end
+
+def fun_l19_n944(x)
+    if (x < 1)
+        fun_l20_n844(x)
+    else
+        fun_l20_n958(x)
+    end
+end
+
+def fun_l19_n945(x)
+    if (x < 1)
+        fun_l20_n730(x)
+    else
+        fun_l20_n814(x)
+    end
+end
+
+def fun_l19_n946(x)
+    if (x < 1)
+        fun_l20_n963(x)
+    else
+        fun_l20_n2(x)
+    end
+end
+
+def fun_l19_n947(x)
+    if (x < 1)
+        fun_l20_n285(x)
+    else
+        fun_l20_n605(x)
+    end
+end
+
+def fun_l19_n948(x)
+    if (x < 1)
+        fun_l20_n869(x)
+    else
+        fun_l20_n409(x)
+    end
+end
+
+def fun_l19_n949(x)
+    if (x < 1)
+        fun_l20_n313(x)
+    else
+        fun_l20_n854(x)
+    end
+end
+
+def fun_l19_n950(x)
+    if (x < 1)
+        fun_l20_n802(x)
+    else
+        fun_l20_n411(x)
+    end
+end
+
+def fun_l19_n951(x)
+    if (x < 1)
+        fun_l20_n273(x)
+    else
+        fun_l20_n100(x)
+    end
+end
+
+def fun_l19_n952(x)
+    if (x < 1)
+        fun_l20_n283(x)
+    else
+        fun_l20_n253(x)
+    end
+end
+
+def fun_l19_n953(x)
+    if (x < 1)
+        fun_l20_n137(x)
+    else
+        fun_l20_n535(x)
+    end
+end
+
+def fun_l19_n954(x)
+    if (x < 1)
+        fun_l20_n504(x)
+    else
+        fun_l20_n849(x)
+    end
+end
+
+def fun_l19_n955(x)
+    if (x < 1)
+        fun_l20_n568(x)
+    else
+        fun_l20_n208(x)
+    end
+end
+
+def fun_l19_n956(x)
+    if (x < 1)
+        fun_l20_n775(x)
+    else
+        fun_l20_n781(x)
+    end
+end
+
+def fun_l19_n957(x)
+    if (x < 1)
+        fun_l20_n144(x)
+    else
+        fun_l20_n411(x)
+    end
+end
+
+def fun_l19_n958(x)
+    if (x < 1)
+        fun_l20_n791(x)
+    else
+        fun_l20_n720(x)
+    end
+end
+
+def fun_l19_n959(x)
+    if (x < 1)
+        fun_l20_n268(x)
+    else
+        fun_l20_n251(x)
+    end
+end
+
+def fun_l19_n960(x)
+    if (x < 1)
+        fun_l20_n661(x)
+    else
+        fun_l20_n114(x)
+    end
+end
+
+def fun_l19_n961(x)
+    if (x < 1)
+        fun_l20_n559(x)
+    else
+        fun_l20_n177(x)
+    end
+end
+
+def fun_l19_n962(x)
+    if (x < 1)
+        fun_l20_n536(x)
+    else
+        fun_l20_n671(x)
+    end
+end
+
+def fun_l19_n963(x)
+    if (x < 1)
+        fun_l20_n64(x)
+    else
+        fun_l20_n656(x)
+    end
+end
+
+def fun_l19_n964(x)
+    if (x < 1)
+        fun_l20_n618(x)
+    else
+        fun_l20_n837(x)
+    end
+end
+
+def fun_l19_n965(x)
+    if (x < 1)
+        fun_l20_n201(x)
+    else
+        fun_l20_n562(x)
+    end
+end
+
+def fun_l19_n966(x)
+    if (x < 1)
+        fun_l20_n562(x)
+    else
+        fun_l20_n632(x)
+    end
+end
+
+def fun_l19_n967(x)
+    if (x < 1)
+        fun_l20_n183(x)
+    else
+        fun_l20_n589(x)
+    end
+end
+
+def fun_l19_n968(x)
+    if (x < 1)
+        fun_l20_n971(x)
+    else
+        fun_l20_n619(x)
+    end
+end
+
+def fun_l19_n969(x)
+    if (x < 1)
+        fun_l20_n826(x)
+    else
+        fun_l20_n745(x)
+    end
+end
+
+def fun_l19_n970(x)
+    if (x < 1)
+        fun_l20_n140(x)
+    else
+        fun_l20_n370(x)
+    end
+end
+
+def fun_l19_n971(x)
+    if (x < 1)
+        fun_l20_n26(x)
+    else
+        fun_l20_n243(x)
+    end
+end
+
+def fun_l19_n972(x)
+    if (x < 1)
+        fun_l20_n375(x)
+    else
+        fun_l20_n6(x)
+    end
+end
+
+def fun_l19_n973(x)
+    if (x < 1)
+        fun_l20_n289(x)
+    else
+        fun_l20_n266(x)
+    end
+end
+
+def fun_l19_n974(x)
+    if (x < 1)
+        fun_l20_n932(x)
+    else
+        fun_l20_n602(x)
+    end
+end
+
+def fun_l19_n975(x)
+    if (x < 1)
+        fun_l20_n272(x)
+    else
+        fun_l20_n671(x)
+    end
+end
+
+def fun_l19_n976(x)
+    if (x < 1)
+        fun_l20_n653(x)
+    else
+        fun_l20_n201(x)
+    end
+end
+
+def fun_l19_n977(x)
+    if (x < 1)
+        fun_l20_n785(x)
+    else
+        fun_l20_n976(x)
+    end
+end
+
+def fun_l19_n978(x)
+    if (x < 1)
+        fun_l20_n212(x)
+    else
+        fun_l20_n601(x)
+    end
+end
+
+def fun_l19_n979(x)
+    if (x < 1)
+        fun_l20_n218(x)
+    else
+        fun_l20_n914(x)
+    end
+end
+
+def fun_l19_n980(x)
+    if (x < 1)
+        fun_l20_n109(x)
+    else
+        fun_l20_n147(x)
+    end
+end
+
+def fun_l19_n981(x)
+    if (x < 1)
+        fun_l20_n46(x)
+    else
+        fun_l20_n276(x)
+    end
+end
+
+def fun_l19_n982(x)
+    if (x < 1)
+        fun_l20_n727(x)
+    else
+        fun_l20_n545(x)
+    end
+end
+
+def fun_l19_n983(x)
+    if (x < 1)
+        fun_l20_n679(x)
+    else
+        fun_l20_n731(x)
+    end
+end
+
+def fun_l19_n984(x)
+    if (x < 1)
+        fun_l20_n291(x)
+    else
+        fun_l20_n294(x)
+    end
+end
+
+def fun_l19_n985(x)
+    if (x < 1)
+        fun_l20_n741(x)
+    else
+        fun_l20_n508(x)
+    end
+end
+
+def fun_l19_n986(x)
+    if (x < 1)
+        fun_l20_n417(x)
+    else
+        fun_l20_n169(x)
+    end
+end
+
+def fun_l19_n987(x)
+    if (x < 1)
+        fun_l20_n685(x)
+    else
+        fun_l20_n871(x)
+    end
+end
+
+def fun_l19_n988(x)
+    if (x < 1)
+        fun_l20_n386(x)
+    else
+        fun_l20_n616(x)
+    end
+end
+
+def fun_l19_n989(x)
+    if (x < 1)
+        fun_l20_n317(x)
+    else
+        fun_l20_n954(x)
+    end
+end
+
+def fun_l19_n990(x)
+    if (x < 1)
+        fun_l20_n954(x)
+    else
+        fun_l20_n974(x)
+    end
+end
+
+def fun_l19_n991(x)
+    if (x < 1)
+        fun_l20_n251(x)
+    else
+        fun_l20_n56(x)
+    end
+end
+
+def fun_l19_n992(x)
+    if (x < 1)
+        fun_l20_n775(x)
+    else
+        fun_l20_n175(x)
+    end
+end
+
+def fun_l19_n993(x)
+    if (x < 1)
+        fun_l20_n578(x)
+    else
+        fun_l20_n217(x)
+    end
+end
+
+def fun_l19_n994(x)
+    if (x < 1)
+        fun_l20_n483(x)
+    else
+        fun_l20_n279(x)
+    end
+end
+
+def fun_l19_n995(x)
+    if (x < 1)
+        fun_l20_n316(x)
+    else
+        fun_l20_n343(x)
+    end
+end
+
+def fun_l19_n996(x)
+    if (x < 1)
+        fun_l20_n618(x)
+    else
+        fun_l20_n995(x)
+    end
+end
+
+def fun_l19_n997(x)
+    if (x < 1)
+        fun_l20_n396(x)
+    else
+        fun_l20_n540(x)
+    end
+end
+
+def fun_l19_n998(x)
+    if (x < 1)
+        fun_l20_n184(x)
+    else
+        fun_l20_n380(x)
+    end
+end
+
+def fun_l19_n999(x)
+    if (x < 1)
+        fun_l20_n360(x)
+    else
+        fun_l20_n48(x)
+    end
+end
+
+def fun_l20_n0(x)
+    if (x < 1)
+        fun_l21_n609(x)
+    else
+        fun_l21_n305(x)
+    end
+end
+
+def fun_l20_n1(x)
+    if (x < 1)
+        fun_l21_n937(x)
+    else
+        fun_l21_n174(x)
+    end
+end
+
+def fun_l20_n2(x)
+    if (x < 1)
+        fun_l21_n939(x)
+    else
+        fun_l21_n174(x)
+    end
+end
+
+def fun_l20_n3(x)
+    if (x < 1)
+        fun_l21_n163(x)
+    else
+        fun_l21_n572(x)
+    end
+end
+
+def fun_l20_n4(x)
+    if (x < 1)
+        fun_l21_n43(x)
+    else
+        fun_l21_n384(x)
+    end
+end
+
+def fun_l20_n5(x)
+    if (x < 1)
+        fun_l21_n565(x)
+    else
+        fun_l21_n788(x)
+    end
+end
+
+def fun_l20_n6(x)
+    if (x < 1)
+        fun_l21_n539(x)
+    else
+        fun_l21_n806(x)
+    end
+end
+
+def fun_l20_n7(x)
+    if (x < 1)
+        fun_l21_n395(x)
+    else
+        fun_l21_n9(x)
+    end
+end
+
+def fun_l20_n8(x)
+    if (x < 1)
+        fun_l21_n231(x)
+    else
+        fun_l21_n788(x)
+    end
+end
+
+def fun_l20_n9(x)
+    if (x < 1)
+        fun_l21_n511(x)
+    else
+        fun_l21_n236(x)
+    end
+end
+
+def fun_l20_n10(x)
+    if (x < 1)
+        fun_l21_n141(x)
+    else
+        fun_l21_n34(x)
+    end
+end
+
+def fun_l20_n11(x)
+    if (x < 1)
+        fun_l21_n801(x)
+    else
+        fun_l21_n760(x)
+    end
+end
+
+def fun_l20_n12(x)
+    if (x < 1)
+        fun_l21_n627(x)
+    else
+        fun_l21_n289(x)
+    end
+end
+
+def fun_l20_n13(x)
+    if (x < 1)
+        fun_l21_n795(x)
+    else
+        fun_l21_n183(x)
+    end
+end
+
+def fun_l20_n14(x)
+    if (x < 1)
+        fun_l21_n384(x)
+    else
+        fun_l21_n3(x)
+    end
+end
+
+def fun_l20_n15(x)
+    if (x < 1)
+        fun_l21_n823(x)
+    else
+        fun_l21_n312(x)
+    end
+end
+
+def fun_l20_n16(x)
+    if (x < 1)
+        fun_l21_n727(x)
+    else
+        fun_l21_n897(x)
+    end
+end
+
+def fun_l20_n17(x)
+    if (x < 1)
+        fun_l21_n710(x)
+    else
+        fun_l21_n532(x)
+    end
+end
+
+def fun_l20_n18(x)
+    if (x < 1)
+        fun_l21_n373(x)
+    else
+        fun_l21_n807(x)
+    end
+end
+
+def fun_l20_n19(x)
+    if (x < 1)
+        fun_l21_n164(x)
+    else
+        fun_l21_n472(x)
+    end
+end
+
+def fun_l20_n20(x)
+    if (x < 1)
+        fun_l21_n522(x)
+    else
+        fun_l21_n264(x)
+    end
+end
+
+def fun_l20_n21(x)
+    if (x < 1)
+        fun_l21_n122(x)
+    else
+        fun_l21_n897(x)
+    end
+end
+
+def fun_l20_n22(x)
+    if (x < 1)
+        fun_l21_n292(x)
+    else
+        fun_l21_n873(x)
+    end
+end
+
+def fun_l20_n23(x)
+    if (x < 1)
+        fun_l21_n461(x)
+    else
+        fun_l21_n681(x)
+    end
+end
+
+def fun_l20_n24(x)
+    if (x < 1)
+        fun_l21_n80(x)
+    else
+        fun_l21_n484(x)
+    end
+end
+
+def fun_l20_n25(x)
+    if (x < 1)
+        fun_l21_n7(x)
+    else
+        fun_l21_n444(x)
+    end
+end
+
+def fun_l20_n26(x)
+    if (x < 1)
+        fun_l21_n269(x)
+    else
+        fun_l21_n58(x)
+    end
+end
+
+def fun_l20_n27(x)
+    if (x < 1)
+        fun_l21_n318(x)
+    else
+        fun_l21_n224(x)
+    end
+end
+
+def fun_l20_n28(x)
+    if (x < 1)
+        fun_l21_n437(x)
+    else
+        fun_l21_n621(x)
+    end
+end
+
+def fun_l20_n29(x)
+    if (x < 1)
+        fun_l21_n907(x)
+    else
+        fun_l21_n32(x)
+    end
+end
+
+def fun_l20_n30(x)
+    if (x < 1)
+        fun_l21_n525(x)
+    else
+        fun_l21_n10(x)
+    end
+end
+
+def fun_l20_n31(x)
+    if (x < 1)
+        fun_l21_n278(x)
+    else
+        fun_l21_n243(x)
+    end
+end
+
+def fun_l20_n32(x)
+    if (x < 1)
+        fun_l21_n865(x)
+    else
+        fun_l21_n236(x)
+    end
+end
+
+def fun_l20_n33(x)
+    if (x < 1)
+        fun_l21_n732(x)
+    else
+        fun_l21_n472(x)
+    end
+end
+
+def fun_l20_n34(x)
+    if (x < 1)
+        fun_l21_n331(x)
+    else
+        fun_l21_n162(x)
+    end
+end
+
+def fun_l20_n35(x)
+    if (x < 1)
+        fun_l21_n217(x)
+    else
+        fun_l21_n877(x)
+    end
+end
+
+def fun_l20_n36(x)
+    if (x < 1)
+        fun_l21_n125(x)
+    else
+        fun_l21_n683(x)
+    end
+end
+
+def fun_l20_n37(x)
+    if (x < 1)
+        fun_l21_n236(x)
+    else
+        fun_l21_n79(x)
+    end
+end
+
+def fun_l20_n38(x)
+    if (x < 1)
+        fun_l21_n308(x)
+    else
+        fun_l21_n995(x)
+    end
+end
+
+def fun_l20_n39(x)
+    if (x < 1)
+        fun_l21_n923(x)
+    else
+        fun_l21_n956(x)
+    end
+end
+
+def fun_l20_n40(x)
+    if (x < 1)
+        fun_l21_n505(x)
+    else
+        fun_l21_n47(x)
+    end
+end
+
+def fun_l20_n41(x)
+    if (x < 1)
+        fun_l21_n24(x)
+    else
+        fun_l21_n894(x)
+    end
+end
+
+def fun_l20_n42(x)
+    if (x < 1)
+        fun_l21_n824(x)
+    else
+        fun_l21_n106(x)
+    end
+end
+
+def fun_l20_n43(x)
+    if (x < 1)
+        fun_l21_n898(x)
+    else
+        fun_l21_n576(x)
+    end
+end
+
+def fun_l20_n44(x)
+    if (x < 1)
+        fun_l21_n231(x)
+    else
+        fun_l21_n689(x)
+    end
+end
+
+def fun_l20_n45(x)
+    if (x < 1)
+        fun_l21_n340(x)
+    else
+        fun_l21_n887(x)
+    end
+end
+
+def fun_l20_n46(x)
+    if (x < 1)
+        fun_l21_n157(x)
+    else
+        fun_l21_n551(x)
+    end
+end
+
+def fun_l20_n47(x)
+    if (x < 1)
+        fun_l21_n904(x)
+    else
+        fun_l21_n975(x)
+    end
+end
+
+def fun_l20_n48(x)
+    if (x < 1)
+        fun_l21_n392(x)
+    else
+        fun_l21_n882(x)
+    end
+end
+
+def fun_l20_n49(x)
+    if (x < 1)
+        fun_l21_n484(x)
+    else
+        fun_l21_n810(x)
+    end
+end
+
+def fun_l20_n50(x)
+    if (x < 1)
+        fun_l21_n517(x)
+    else
+        fun_l21_n434(x)
+    end
+end
+
+def fun_l20_n51(x)
+    if (x < 1)
+        fun_l21_n115(x)
+    else
+        fun_l21_n975(x)
+    end
+end
+
+def fun_l20_n52(x)
+    if (x < 1)
+        fun_l21_n633(x)
+    else
+        fun_l21_n799(x)
+    end
+end
+
+def fun_l20_n53(x)
+    if (x < 1)
+        fun_l21_n938(x)
+    else
+        fun_l21_n321(x)
+    end
+end
+
+def fun_l20_n54(x)
+    if (x < 1)
+        fun_l21_n98(x)
+    else
+        fun_l21_n343(x)
+    end
+end
+
+def fun_l20_n55(x)
+    if (x < 1)
+        fun_l21_n851(x)
+    else
+        fun_l21_n794(x)
+    end
+end
+
+def fun_l20_n56(x)
+    if (x < 1)
+        fun_l21_n119(x)
+    else
+        fun_l21_n649(x)
+    end
+end
+
+def fun_l20_n57(x)
+    if (x < 1)
+        fun_l21_n799(x)
+    else
+        fun_l21_n397(x)
+    end
+end
+
+def fun_l20_n58(x)
+    if (x < 1)
+        fun_l21_n429(x)
+    else
+        fun_l21_n781(x)
+    end
+end
+
+def fun_l20_n59(x)
+    if (x < 1)
+        fun_l21_n862(x)
+    else
+        fun_l21_n870(x)
+    end
+end
+
+def fun_l20_n60(x)
+    if (x < 1)
+        fun_l21_n864(x)
+    else
+        fun_l21_n333(x)
+    end
+end
+
+def fun_l20_n61(x)
+    if (x < 1)
+        fun_l21_n673(x)
+    else
+        fun_l21_n481(x)
+    end
+end
+
+def fun_l20_n62(x)
+    if (x < 1)
+        fun_l21_n193(x)
+    else
+        fun_l21_n524(x)
+    end
+end
+
+def fun_l20_n63(x)
+    if (x < 1)
+        fun_l21_n976(x)
+    else
+        fun_l21_n0(x)
+    end
+end
+
+def fun_l20_n64(x)
+    if (x < 1)
+        fun_l21_n804(x)
+    else
+        fun_l21_n833(x)
+    end
+end
+
+def fun_l20_n65(x)
+    if (x < 1)
+        fun_l21_n20(x)
+    else
+        fun_l21_n285(x)
+    end
+end
+
+def fun_l20_n66(x)
+    if (x < 1)
+        fun_l21_n70(x)
+    else
+        fun_l21_n932(x)
+    end
+end
+
+def fun_l20_n67(x)
+    if (x < 1)
+        fun_l21_n213(x)
+    else
+        fun_l21_n196(x)
+    end
+end
+
+def fun_l20_n68(x)
+    if (x < 1)
+        fun_l21_n806(x)
+    else
+        fun_l21_n322(x)
+    end
+end
+
+def fun_l20_n69(x)
+    if (x < 1)
+        fun_l21_n583(x)
+    else
+        fun_l21_n62(x)
+    end
+end
+
+def fun_l20_n70(x)
+    if (x < 1)
+        fun_l21_n141(x)
+    else
+        fun_l21_n490(x)
+    end
+end
+
+def fun_l20_n71(x)
+    if (x < 1)
+        fun_l21_n995(x)
+    else
+        fun_l21_n398(x)
+    end
+end
+
+def fun_l20_n72(x)
+    if (x < 1)
+        fun_l21_n436(x)
+    else
+        fun_l21_n490(x)
+    end
+end
+
+def fun_l20_n73(x)
+    if (x < 1)
+        fun_l21_n585(x)
+    else
+        fun_l21_n275(x)
+    end
+end
+
+def fun_l20_n74(x)
+    if (x < 1)
+        fun_l21_n120(x)
+    else
+        fun_l21_n968(x)
+    end
+end
+
+def fun_l20_n75(x)
+    if (x < 1)
+        fun_l21_n562(x)
+    else
+        fun_l21_n896(x)
+    end
+end
+
+def fun_l20_n76(x)
+    if (x < 1)
+        fun_l21_n794(x)
+    else
+        fun_l21_n224(x)
+    end
+end
+
+def fun_l20_n77(x)
+    if (x < 1)
+        fun_l21_n71(x)
+    else
+        fun_l21_n870(x)
+    end
+end
+
+def fun_l20_n78(x)
+    if (x < 1)
+        fun_l21_n0(x)
+    else
+        fun_l21_n41(x)
+    end
+end
+
+def fun_l20_n79(x)
+    if (x < 1)
+        fun_l21_n325(x)
+    else
+        fun_l21_n814(x)
+    end
+end
+
+def fun_l20_n80(x)
+    if (x < 1)
+        fun_l21_n963(x)
+    else
+        fun_l21_n792(x)
+    end
+end
+
+def fun_l20_n81(x)
+    if (x < 1)
+        fun_l21_n415(x)
+    else
+        fun_l21_n200(x)
+    end
+end
+
+def fun_l20_n82(x)
+    if (x < 1)
+        fun_l21_n438(x)
+    else
+        fun_l21_n506(x)
+    end
+end
+
+def fun_l20_n83(x)
+    if (x < 1)
+        fun_l21_n283(x)
+    else
+        fun_l21_n708(x)
+    end
+end
+
+def fun_l20_n84(x)
+    if (x < 1)
+        fun_l21_n968(x)
+    else
+        fun_l21_n80(x)
+    end
+end
+
+def fun_l20_n85(x)
+    if (x < 1)
+        fun_l21_n839(x)
+    else
+        fun_l21_n808(x)
+    end
+end
+
+def fun_l20_n86(x)
+    if (x < 1)
+        fun_l21_n653(x)
+    else
+        fun_l21_n343(x)
+    end
+end
+
+def fun_l20_n87(x)
+    if (x < 1)
+        fun_l21_n580(x)
+    else
+        fun_l21_n652(x)
+    end
+end
+
+def fun_l20_n88(x)
+    if (x < 1)
+        fun_l21_n64(x)
+    else
+        fun_l21_n899(x)
+    end
+end
+
+def fun_l20_n89(x)
+    if (x < 1)
+        fun_l21_n325(x)
+    else
+        fun_l21_n645(x)
+    end
+end
+
+def fun_l20_n90(x)
+    if (x < 1)
+        fun_l21_n251(x)
+    else
+        fun_l21_n210(x)
+    end
+end
+
+def fun_l20_n91(x)
+    if (x < 1)
+        fun_l21_n943(x)
+    else
+        fun_l21_n451(x)
+    end
+end
+
+def fun_l20_n92(x)
+    if (x < 1)
+        fun_l21_n95(x)
+    else
+        fun_l21_n937(x)
+    end
+end
+
+def fun_l20_n93(x)
+    if (x < 1)
+        fun_l21_n263(x)
+    else
+        fun_l21_n107(x)
+    end
+end
+
+def fun_l20_n94(x)
+    if (x < 1)
+        fun_l21_n438(x)
+    else
+        fun_l21_n213(x)
+    end
+end
+
+def fun_l20_n95(x)
+    if (x < 1)
+        fun_l21_n283(x)
+    else
+        fun_l21_n203(x)
+    end
+end
+
+def fun_l20_n96(x)
+    if (x < 1)
+        fun_l21_n809(x)
+    else
+        fun_l21_n154(x)
+    end
+end
+
+def fun_l20_n97(x)
+    if (x < 1)
+        fun_l21_n513(x)
+    else
+        fun_l21_n15(x)
+    end
+end
+
+def fun_l20_n98(x)
+    if (x < 1)
+        fun_l21_n854(x)
+    else
+        fun_l21_n679(x)
+    end
+end
+
+def fun_l20_n99(x)
+    if (x < 1)
+        fun_l21_n102(x)
+    else
+        fun_l21_n546(x)
+    end
+end
+
+def fun_l20_n100(x)
+    if (x < 1)
+        fun_l21_n790(x)
+    else
+        fun_l21_n143(x)
+    end
+end
+
+def fun_l20_n101(x)
+    if (x < 1)
+        fun_l21_n835(x)
+    else
+        fun_l21_n78(x)
+    end
+end
+
+def fun_l20_n102(x)
+    if (x < 1)
+        fun_l21_n96(x)
+    else
+        fun_l21_n995(x)
+    end
+end
+
+def fun_l20_n103(x)
+    if (x < 1)
+        fun_l21_n445(x)
+    else
+        fun_l21_n332(x)
+    end
+end
+
+def fun_l20_n104(x)
+    if (x < 1)
+        fun_l21_n532(x)
+    else
+        fun_l21_n509(x)
+    end
+end
+
+def fun_l20_n105(x)
+    if (x < 1)
+        fun_l21_n592(x)
+    else
+        fun_l21_n237(x)
+    end
+end
+
+def fun_l20_n106(x)
+    if (x < 1)
+        fun_l21_n837(x)
+    else
+        fun_l21_n13(x)
+    end
+end
+
+def fun_l20_n107(x)
+    if (x < 1)
+        fun_l21_n518(x)
+    else
+        fun_l21_n463(x)
+    end
+end
+
+def fun_l20_n108(x)
+    if (x < 1)
+        fun_l21_n373(x)
+    else
+        fun_l21_n597(x)
+    end
+end
+
+def fun_l20_n109(x)
+    if (x < 1)
+        fun_l21_n832(x)
+    else
+        fun_l21_n784(x)
+    end
+end
+
+def fun_l20_n110(x)
+    if (x < 1)
+        fun_l21_n408(x)
+    else
+        fun_l21_n738(x)
+    end
+end
+
+def fun_l20_n111(x)
+    if (x < 1)
+        fun_l21_n243(x)
+    else
+        fun_l21_n96(x)
+    end
+end
+
+def fun_l20_n112(x)
+    if (x < 1)
+        fun_l21_n251(x)
+    else
+        fun_l21_n151(x)
+    end
+end
+
+def fun_l20_n113(x)
+    if (x < 1)
+        fun_l21_n970(x)
+    else
+        fun_l21_n329(x)
+    end
+end
+
+def fun_l20_n114(x)
+    if (x < 1)
+        fun_l21_n691(x)
+    else
+        fun_l21_n309(x)
+    end
+end
+
+def fun_l20_n115(x)
+    if (x < 1)
+        fun_l21_n250(x)
+    else
+        fun_l21_n927(x)
+    end
+end
+
+def fun_l20_n116(x)
+    if (x < 1)
+        fun_l21_n819(x)
+    else
+        fun_l21_n49(x)
+    end
+end
+
+def fun_l20_n117(x)
+    if (x < 1)
+        fun_l21_n761(x)
+    else
+        fun_l21_n91(x)
+    end
+end
+
+def fun_l20_n118(x)
+    if (x < 1)
+        fun_l21_n170(x)
+    else
+        fun_l21_n317(x)
+    end
+end
+
+def fun_l20_n119(x)
+    if (x < 1)
+        fun_l21_n199(x)
+    else
+        fun_l21_n406(x)
+    end
+end
+
+def fun_l20_n120(x)
+    if (x < 1)
+        fun_l21_n983(x)
+    else
+        fun_l21_n742(x)
+    end
+end
+
+def fun_l20_n121(x)
+    if (x < 1)
+        fun_l21_n428(x)
+    else
+        fun_l21_n887(x)
+    end
+end
+
+def fun_l20_n122(x)
+    if (x < 1)
+        fun_l21_n369(x)
+    else
+        fun_l21_n64(x)
+    end
+end
+
+def fun_l20_n123(x)
+    if (x < 1)
+        fun_l21_n727(x)
+    else
+        fun_l21_n484(x)
+    end
+end
+
+def fun_l20_n124(x)
+    if (x < 1)
+        fun_l21_n310(x)
+    else
+        fun_l21_n198(x)
+    end
+end
+
+def fun_l20_n125(x)
+    if (x < 1)
+        fun_l21_n747(x)
+    else
+        fun_l21_n935(x)
+    end
+end
+
+def fun_l20_n126(x)
+    if (x < 1)
+        fun_l21_n389(x)
+    else
+        fun_l21_n966(x)
+    end
+end
+
+def fun_l20_n127(x)
+    if (x < 1)
+        fun_l21_n852(x)
+    else
+        fun_l21_n128(x)
+    end
+end
+
+def fun_l20_n128(x)
+    if (x < 1)
+        fun_l21_n10(x)
+    else
+        fun_l21_n376(x)
+    end
+end
+
+def fun_l20_n129(x)
+    if (x < 1)
+        fun_l21_n413(x)
+    else
+        fun_l21_n465(x)
+    end
+end
+
+def fun_l20_n130(x)
+    if (x < 1)
+        fun_l21_n536(x)
+    else
+        fun_l21_n689(x)
+    end
+end
+
+def fun_l20_n131(x)
+    if (x < 1)
+        fun_l21_n707(x)
+    else
+        fun_l21_n793(x)
+    end
+end
+
+def fun_l20_n132(x)
+    if (x < 1)
+        fun_l21_n328(x)
+    else
+        fun_l21_n56(x)
+    end
+end
+
+def fun_l20_n133(x)
+    if (x < 1)
+        fun_l21_n318(x)
+    else
+        fun_l21_n570(x)
+    end
+end
+
+def fun_l20_n134(x)
+    if (x < 1)
+        fun_l21_n656(x)
+    else
+        fun_l21_n187(x)
+    end
+end
+
+def fun_l20_n135(x)
+    if (x < 1)
+        fun_l21_n259(x)
+    else
+        fun_l21_n718(x)
+    end
+end
+
+def fun_l20_n136(x)
+    if (x < 1)
+        fun_l21_n284(x)
+    else
+        fun_l21_n167(x)
+    end
+end
+
+def fun_l20_n137(x)
+    if (x < 1)
+        fun_l21_n788(x)
+    else
+        fun_l21_n595(x)
+    end
+end
+
+def fun_l20_n138(x)
+    if (x < 1)
+        fun_l21_n431(x)
+    else
+        fun_l21_n620(x)
+    end
+end
+
+def fun_l20_n139(x)
+    if (x < 1)
+        fun_l21_n365(x)
+    else
+        fun_l21_n995(x)
+    end
+end
+
+def fun_l20_n140(x)
+    if (x < 1)
+        fun_l21_n614(x)
+    else
+        fun_l21_n79(x)
+    end
+end
+
+def fun_l20_n141(x)
+    if (x < 1)
+        fun_l21_n138(x)
+    else
+        fun_l21_n655(x)
+    end
+end
+
+def fun_l20_n142(x)
+    if (x < 1)
+        fun_l21_n155(x)
+    else
+        fun_l21_n34(x)
+    end
+end
+
+def fun_l20_n143(x)
+    if (x < 1)
+        fun_l21_n829(x)
+    else
+        fun_l21_n703(x)
+    end
+end
+
+def fun_l20_n144(x)
+    if (x < 1)
+        fun_l21_n290(x)
+    else
+        fun_l21_n279(x)
+    end
+end
+
+def fun_l20_n145(x)
+    if (x < 1)
+        fun_l21_n825(x)
+    else
+        fun_l21_n720(x)
+    end
+end
+
+def fun_l20_n146(x)
+    if (x < 1)
+        fun_l21_n678(x)
+    else
+        fun_l21_n347(x)
+    end
+end
+
+def fun_l20_n147(x)
+    if (x < 1)
+        fun_l21_n967(x)
+    else
+        fun_l21_n133(x)
+    end
+end
+
+def fun_l20_n148(x)
+    if (x < 1)
+        fun_l21_n935(x)
+    else
+        fun_l21_n438(x)
+    end
+end
+
+def fun_l20_n149(x)
+    if (x < 1)
+        fun_l21_n14(x)
+    else
+        fun_l21_n233(x)
+    end
+end
+
+def fun_l20_n150(x)
+    if (x < 1)
+        fun_l21_n42(x)
+    else
+        fun_l21_n507(x)
+    end
+end
+
+def fun_l20_n151(x)
+    if (x < 1)
+        fun_l21_n33(x)
+    else
+        fun_l21_n404(x)
+    end
+end
+
+def fun_l20_n152(x)
+    if (x < 1)
+        fun_l21_n897(x)
+    else
+        fun_l21_n972(x)
+    end
+end
+
+def fun_l20_n153(x)
+    if (x < 1)
+        fun_l21_n221(x)
+    else
+        fun_l21_n718(x)
+    end
+end
+
+def fun_l20_n154(x)
+    if (x < 1)
+        fun_l21_n737(x)
+    else
+        fun_l21_n257(x)
+    end
+end
+
+def fun_l20_n155(x)
+    if (x < 1)
+        fun_l21_n465(x)
+    else
+        fun_l21_n917(x)
+    end
+end
+
+def fun_l20_n156(x)
+    if (x < 1)
+        fun_l21_n338(x)
+    else
+        fun_l21_n673(x)
+    end
+end
+
+def fun_l20_n157(x)
+    if (x < 1)
+        fun_l21_n429(x)
+    else
+        fun_l21_n23(x)
+    end
+end
+
+def fun_l20_n158(x)
+    if (x < 1)
+        fun_l21_n826(x)
+    else
+        fun_l21_n115(x)
+    end
+end
+
+def fun_l20_n159(x)
+    if (x < 1)
+        fun_l21_n713(x)
+    else
+        fun_l21_n954(x)
+    end
+end
+
+def fun_l20_n160(x)
+    if (x < 1)
+        fun_l21_n897(x)
+    else
+        fun_l21_n46(x)
+    end
+end
+
+def fun_l20_n161(x)
+    if (x < 1)
+        fun_l21_n751(x)
+    else
+        fun_l21_n885(x)
+    end
+end
+
+def fun_l20_n162(x)
+    if (x < 1)
+        fun_l21_n935(x)
+    else
+        fun_l21_n230(x)
+    end
+end
+
+def fun_l20_n163(x)
+    if (x < 1)
+        fun_l21_n862(x)
+    else
+        fun_l21_n874(x)
+    end
+end
+
+def fun_l20_n164(x)
+    if (x < 1)
+        fun_l21_n695(x)
+    else
+        fun_l21_n707(x)
+    end
+end
+
+def fun_l20_n165(x)
+    if (x < 1)
+        fun_l21_n539(x)
+    else
+        fun_l21_n14(x)
+    end
+end
+
+def fun_l20_n166(x)
+    if (x < 1)
+        fun_l21_n139(x)
+    else
+        fun_l21_n766(x)
+    end
+end
+
+def fun_l20_n167(x)
+    if (x < 1)
+        fun_l21_n100(x)
+    else
+        fun_l21_n229(x)
+    end
+end
+
+def fun_l20_n168(x)
+    if (x < 1)
+        fun_l21_n88(x)
+    else
+        fun_l21_n642(x)
+    end
+end
+
+def fun_l20_n169(x)
+    if (x < 1)
+        fun_l21_n57(x)
+    else
+        fun_l21_n252(x)
+    end
+end
+
+def fun_l20_n170(x)
+    if (x < 1)
+        fun_l21_n470(x)
+    else
+        fun_l21_n224(x)
+    end
+end
+
+def fun_l20_n171(x)
+    if (x < 1)
+        fun_l21_n163(x)
+    else
+        fun_l21_n114(x)
+    end
+end
+
+def fun_l20_n172(x)
+    if (x < 1)
+        fun_l21_n231(x)
+    else
+        fun_l21_n405(x)
+    end
+end
+
+def fun_l20_n173(x)
+    if (x < 1)
+        fun_l21_n553(x)
+    else
+        fun_l21_n758(x)
+    end
+end
+
+def fun_l20_n174(x)
+    if (x < 1)
+        fun_l21_n874(x)
+    else
+        fun_l21_n43(x)
+    end
+end
+
+def fun_l20_n175(x)
+    if (x < 1)
+        fun_l21_n911(x)
+    else
+        fun_l21_n644(x)
+    end
+end
+
+def fun_l20_n176(x)
+    if (x < 1)
+        fun_l21_n747(x)
+    else
+        fun_l21_n900(x)
+    end
+end
+
+def fun_l20_n177(x)
+    if (x < 1)
+        fun_l21_n956(x)
+    else
+        fun_l21_n152(x)
+    end
+end
+
+def fun_l20_n178(x)
+    if (x < 1)
+        fun_l21_n226(x)
+    else
+        fun_l21_n654(x)
+    end
+end
+
+def fun_l20_n179(x)
+    if (x < 1)
+        fun_l21_n284(x)
+    else
+        fun_l21_n968(x)
+    end
+end
+
+def fun_l20_n180(x)
+    if (x < 1)
+        fun_l21_n181(x)
+    else
+        fun_l21_n690(x)
+    end
+end
+
+def fun_l20_n181(x)
+    if (x < 1)
+        fun_l21_n35(x)
+    else
+        fun_l21_n500(x)
+    end
+end
+
+def fun_l20_n182(x)
+    if (x < 1)
+        fun_l21_n212(x)
+    else
+        fun_l21_n559(x)
+    end
+end
+
+def fun_l20_n183(x)
+    if (x < 1)
+        fun_l21_n981(x)
+    else
+        fun_l21_n605(x)
+    end
+end
+
+def fun_l20_n184(x)
+    if (x < 1)
+        fun_l21_n447(x)
+    else
+        fun_l21_n718(x)
+    end
+end
+
+def fun_l20_n185(x)
+    if (x < 1)
+        fun_l21_n272(x)
+    else
+        fun_l21_n341(x)
+    end
+end
+
+def fun_l20_n186(x)
+    if (x < 1)
+        fun_l21_n5(x)
+    else
+        fun_l21_n426(x)
+    end
+end
+
+def fun_l20_n187(x)
+    if (x < 1)
+        fun_l21_n630(x)
+    else
+        fun_l21_n62(x)
+    end
+end
+
+def fun_l20_n188(x)
+    if (x < 1)
+        fun_l21_n600(x)
+    else
+        fun_l21_n674(x)
+    end
+end
+
+def fun_l20_n189(x)
+    if (x < 1)
+        fun_l21_n645(x)
+    else
+        fun_l21_n936(x)
+    end
+end
+
+def fun_l20_n190(x)
+    if (x < 1)
+        fun_l21_n15(x)
+    else
+        fun_l21_n158(x)
+    end
+end
+
+def fun_l20_n191(x)
+    if (x < 1)
+        fun_l21_n789(x)
+    else
+        fun_l21_n103(x)
+    end
+end
+
+def fun_l20_n192(x)
+    if (x < 1)
+        fun_l21_n501(x)
+    else
+        fun_l21_n655(x)
+    end
+end
+
+def fun_l20_n193(x)
+    if (x < 1)
+        fun_l21_n242(x)
+    else
+        fun_l21_n241(x)
+    end
+end
+
+def fun_l20_n194(x)
+    if (x < 1)
+        fun_l21_n296(x)
+    else
+        fun_l21_n442(x)
+    end
+end
+
+def fun_l20_n195(x)
+    if (x < 1)
+        fun_l21_n288(x)
+    else
+        fun_l21_n165(x)
+    end
+end
+
+def fun_l20_n196(x)
+    if (x < 1)
+        fun_l21_n336(x)
+    else
+        fun_l21_n328(x)
+    end
+end
+
+def fun_l20_n197(x)
+    if (x < 1)
+        fun_l21_n423(x)
+    else
+        fun_l21_n906(x)
+    end
+end
+
+def fun_l20_n198(x)
+    if (x < 1)
+        fun_l21_n875(x)
+    else
+        fun_l21_n801(x)
+    end
+end
+
+def fun_l20_n199(x)
+    if (x < 1)
+        fun_l21_n864(x)
+    else
+        fun_l21_n594(x)
+    end
+end
+
+def fun_l20_n200(x)
+    if (x < 1)
+        fun_l21_n145(x)
+    else
+        fun_l21_n728(x)
+    end
+end
+
+def fun_l20_n201(x)
+    if (x < 1)
+        fun_l21_n941(x)
+    else
+        fun_l21_n592(x)
+    end
+end
+
+def fun_l20_n202(x)
+    if (x < 1)
+        fun_l21_n458(x)
+    else
+        fun_l21_n839(x)
+    end
+end
+
+def fun_l20_n203(x)
+    if (x < 1)
+        fun_l21_n352(x)
+    else
+        fun_l21_n319(x)
+    end
+end
+
+def fun_l20_n204(x)
+    if (x < 1)
+        fun_l21_n453(x)
+    else
+        fun_l21_n944(x)
+    end
+end
+
+def fun_l20_n205(x)
+    if (x < 1)
+        fun_l21_n479(x)
+    else
+        fun_l21_n409(x)
+    end
+end
+
+def fun_l20_n206(x)
+    if (x < 1)
+        fun_l21_n72(x)
+    else
+        fun_l21_n177(x)
+    end
+end
+
+def fun_l20_n207(x)
+    if (x < 1)
+        fun_l21_n895(x)
+    else
+        fun_l21_n77(x)
+    end
+end
+
+def fun_l20_n208(x)
+    if (x < 1)
+        fun_l21_n308(x)
+    else
+        fun_l21_n181(x)
+    end
+end
+
+def fun_l20_n209(x)
+    if (x < 1)
+        fun_l21_n358(x)
+    else
+        fun_l21_n666(x)
+    end
+end
+
+def fun_l20_n210(x)
+    if (x < 1)
+        fun_l21_n275(x)
+    else
+        fun_l21_n739(x)
+    end
+end
+
+def fun_l20_n211(x)
+    if (x < 1)
+        fun_l21_n706(x)
+    else
+        fun_l21_n722(x)
+    end
+end
+
+def fun_l20_n212(x)
+    if (x < 1)
+        fun_l21_n185(x)
+    else
+        fun_l21_n893(x)
+    end
+end
+
+def fun_l20_n213(x)
+    if (x < 1)
+        fun_l21_n307(x)
+    else
+        fun_l21_n871(x)
+    end
+end
+
+def fun_l20_n214(x)
+    if (x < 1)
+        fun_l21_n365(x)
+    else
+        fun_l21_n311(x)
+    end
+end
+
+def fun_l20_n215(x)
+    if (x < 1)
+        fun_l21_n176(x)
+    else
+        fun_l21_n998(x)
+    end
+end
+
+def fun_l20_n216(x)
+    if (x < 1)
+        fun_l21_n542(x)
+    else
+        fun_l21_n248(x)
+    end
+end
+
+def fun_l20_n217(x)
+    if (x < 1)
+        fun_l21_n568(x)
+    else
+        fun_l21_n671(x)
+    end
+end
+
+def fun_l20_n218(x)
+    if (x < 1)
+        fun_l21_n704(x)
+    else
+        fun_l21_n992(x)
+    end
+end
+
+def fun_l20_n219(x)
+    if (x < 1)
+        fun_l21_n500(x)
+    else
+        fun_l21_n845(x)
+    end
+end
+
+def fun_l20_n220(x)
+    if (x < 1)
+        fun_l21_n75(x)
+    else
+        fun_l21_n365(x)
+    end
+end
+
+def fun_l20_n221(x)
+    if (x < 1)
+        fun_l21_n780(x)
+    else
+        fun_l21_n574(x)
+    end
+end
+
+def fun_l20_n222(x)
+    if (x < 1)
+        fun_l21_n778(x)
+    else
+        fun_l21_n315(x)
+    end
+end
+
+def fun_l20_n223(x)
+    if (x < 1)
+        fun_l21_n845(x)
+    else
+        fun_l21_n521(x)
+    end
+end
+
+def fun_l20_n224(x)
+    if (x < 1)
+        fun_l21_n608(x)
+    else
+        fun_l21_n762(x)
+    end
+end
+
+def fun_l20_n225(x)
+    if (x < 1)
+        fun_l21_n912(x)
+    else
+        fun_l21_n651(x)
+    end
+end
+
+def fun_l20_n226(x)
+    if (x < 1)
+        fun_l21_n337(x)
+    else
+        fun_l21_n723(x)
+    end
+end
+
+def fun_l20_n227(x)
+    if (x < 1)
+        fun_l21_n734(x)
+    else
+        fun_l21_n967(x)
+    end
+end
+
+def fun_l20_n228(x)
+    if (x < 1)
+        fun_l21_n342(x)
+    else
+        fun_l21_n611(x)
+    end
+end
+
+def fun_l20_n229(x)
+    if (x < 1)
+        fun_l21_n607(x)
+    else
+        fun_l21_n317(x)
+    end
+end
+
+def fun_l20_n230(x)
+    if (x < 1)
+        fun_l21_n478(x)
+    else
+        fun_l21_n208(x)
+    end
+end
+
+def fun_l20_n231(x)
+    if (x < 1)
+        fun_l21_n481(x)
+    else
+        fun_l21_n171(x)
+    end
+end
+
+def fun_l20_n232(x)
+    if (x < 1)
+        fun_l21_n80(x)
+    else
+        fun_l21_n810(x)
+    end
+end
+
+def fun_l20_n233(x)
+    if (x < 1)
+        fun_l21_n597(x)
+    else
+        fun_l21_n474(x)
+    end
+end
+
+def fun_l20_n234(x)
+    if (x < 1)
+        fun_l21_n997(x)
+    else
+        fun_l21_n98(x)
+    end
+end
+
+def fun_l20_n235(x)
+    if (x < 1)
+        fun_l21_n663(x)
+    else
+        fun_l21_n103(x)
+    end
+end
+
+def fun_l20_n236(x)
+    if (x < 1)
+        fun_l21_n602(x)
+    else
+        fun_l21_n421(x)
+    end
+end
+
+def fun_l20_n237(x)
+    if (x < 1)
+        fun_l21_n888(x)
+    else
+        fun_l21_n759(x)
+    end
+end
+
+def fun_l20_n238(x)
+    if (x < 1)
+        fun_l21_n21(x)
+    else
+        fun_l21_n56(x)
+    end
+end
+
+def fun_l20_n239(x)
+    if (x < 1)
+        fun_l21_n663(x)
+    else
+        fun_l21_n102(x)
+    end
+end
+
+def fun_l20_n240(x)
+    if (x < 1)
+        fun_l21_n244(x)
+    else
+        fun_l21_n507(x)
+    end
+end
+
+def fun_l20_n241(x)
+    if (x < 1)
+        fun_l21_n263(x)
+    else
+        fun_l21_n382(x)
+    end
+end
+
+def fun_l20_n242(x)
+    if (x < 1)
+        fun_l21_n639(x)
+    else
+        fun_l21_n380(x)
+    end
+end
+
+def fun_l20_n243(x)
+    if (x < 1)
+        fun_l21_n99(x)
+    else
+        fun_l21_n35(x)
+    end
+end
+
+def fun_l20_n244(x)
+    if (x < 1)
+        fun_l21_n648(x)
+    else
+        fun_l21_n266(x)
+    end
+end
+
+def fun_l20_n245(x)
+    if (x < 1)
+        fun_l21_n613(x)
+    else
+        fun_l21_n277(x)
+    end
+end
+
+def fun_l20_n246(x)
+    if (x < 1)
+        fun_l21_n886(x)
+    else
+        fun_l21_n4(x)
+    end
+end
+
+def fun_l20_n247(x)
+    if (x < 1)
+        fun_l21_n510(x)
+    else
+        fun_l21_n146(x)
+    end
+end
+
+def fun_l20_n248(x)
+    if (x < 1)
+        fun_l21_n933(x)
+    else
+        fun_l21_n765(x)
+    end
+end
+
+def fun_l20_n249(x)
+    if (x < 1)
+        fun_l21_n323(x)
+    else
+        fun_l21_n222(x)
+    end
+end
+
+def fun_l20_n250(x)
+    if (x < 1)
+        fun_l21_n708(x)
+    else
+        fun_l21_n241(x)
+    end
+end
+
+def fun_l20_n251(x)
+    if (x < 1)
+        fun_l21_n394(x)
+    else
+        fun_l21_n899(x)
+    end
+end
+
+def fun_l20_n252(x)
+    if (x < 1)
+        fun_l21_n253(x)
+    else
+        fun_l21_n221(x)
+    end
+end
+
+def fun_l20_n253(x)
+    if (x < 1)
+        fun_l21_n842(x)
+    else
+        fun_l21_n594(x)
+    end
+end
+
+def fun_l20_n254(x)
+    if (x < 1)
+        fun_l21_n325(x)
+    else
+        fun_l21_n145(x)
+    end
+end
+
+def fun_l20_n255(x)
+    if (x < 1)
+        fun_l21_n568(x)
+    else
+        fun_l21_n736(x)
+    end
+end
+
+def fun_l20_n256(x)
+    if (x < 1)
+        fun_l21_n862(x)
+    else
+        fun_l21_n388(x)
+    end
+end
+
+def fun_l20_n257(x)
+    if (x < 1)
+        fun_l21_n738(x)
+    else
+        fun_l21_n255(x)
+    end
+end
+
+def fun_l20_n258(x)
+    if (x < 1)
+        fun_l21_n704(x)
+    else
+        fun_l21_n539(x)
+    end
+end
+
+def fun_l20_n259(x)
+    if (x < 1)
+        fun_l21_n149(x)
+    else
+        fun_l21_n940(x)
+    end
+end
+
+def fun_l20_n260(x)
+    if (x < 1)
+        fun_l21_n462(x)
+    else
+        fun_l21_n840(x)
+    end
+end
+
+def fun_l20_n261(x)
+    if (x < 1)
+        fun_l21_n549(x)
+    else
+        fun_l21_n968(x)
+    end
+end
+
+def fun_l20_n262(x)
+    if (x < 1)
+        fun_l21_n290(x)
+    else
+        fun_l21_n127(x)
+    end
+end
+
+def fun_l20_n263(x)
+    if (x < 1)
+        fun_l21_n311(x)
+    else
+        fun_l21_n652(x)
+    end
+end
+
+def fun_l20_n264(x)
+    if (x < 1)
+        fun_l21_n544(x)
+    else
+        fun_l21_n521(x)
+    end
+end
+
+def fun_l20_n265(x)
+    if (x < 1)
+        fun_l21_n984(x)
+    else
+        fun_l21_n957(x)
+    end
+end
+
+def fun_l20_n266(x)
+    if (x < 1)
+        fun_l21_n10(x)
+    else
+        fun_l21_n154(x)
+    end
+end
+
+def fun_l20_n267(x)
+    if (x < 1)
+        fun_l21_n707(x)
+    else
+        fun_l21_n623(x)
+    end
+end
+
+def fun_l20_n268(x)
+    if (x < 1)
+        fun_l21_n420(x)
+    else
+        fun_l21_n31(x)
+    end
+end
+
+def fun_l20_n269(x)
+    if (x < 1)
+        fun_l21_n380(x)
+    else
+        fun_l21_n397(x)
+    end
+end
+
+def fun_l20_n270(x)
+    if (x < 1)
+        fun_l21_n95(x)
+    else
+        fun_l21_n881(x)
+    end
+end
+
+def fun_l20_n271(x)
+    if (x < 1)
+        fun_l21_n731(x)
+    else
+        fun_l21_n521(x)
+    end
+end
+
+def fun_l20_n272(x)
+    if (x < 1)
+        fun_l21_n255(x)
+    else
+        fun_l21_n412(x)
+    end
+end
+
+def fun_l20_n273(x)
+    if (x < 1)
+        fun_l21_n455(x)
+    else
+        fun_l21_n225(x)
+    end
+end
+
+def fun_l20_n274(x)
+    if (x < 1)
+        fun_l21_n223(x)
+    else
+        fun_l21_n71(x)
+    end
+end
+
+def fun_l20_n275(x)
+    if (x < 1)
+        fun_l21_n819(x)
+    else
+        fun_l21_n765(x)
+    end
+end
+
+def fun_l20_n276(x)
+    if (x < 1)
+        fun_l21_n379(x)
+    else
+        fun_l21_n892(x)
+    end
+end
+
+def fun_l20_n277(x)
+    if (x < 1)
+        fun_l21_n695(x)
+    else
+        fun_l21_n856(x)
+    end
+end
+
+def fun_l20_n278(x)
+    if (x < 1)
+        fun_l21_n217(x)
+    else
+        fun_l21_n166(x)
+    end
+end
+
+def fun_l20_n279(x)
+    if (x < 1)
+        fun_l21_n708(x)
+    else
+        fun_l21_n987(x)
+    end
+end
+
+def fun_l20_n280(x)
+    if (x < 1)
+        fun_l21_n251(x)
+    else
+        fun_l21_n144(x)
+    end
+end
+
+def fun_l20_n281(x)
+    if (x < 1)
+        fun_l21_n262(x)
+    else
+        fun_l21_n428(x)
+    end
+end
+
+def fun_l20_n282(x)
+    if (x < 1)
+        fun_l21_n439(x)
+    else
+        fun_l21_n1(x)
+    end
+end
+
+def fun_l20_n283(x)
+    if (x < 1)
+        fun_l21_n405(x)
+    else
+        fun_l21_n413(x)
+    end
+end
+
+def fun_l20_n284(x)
+    if (x < 1)
+        fun_l21_n729(x)
+    else
+        fun_l21_n61(x)
+    end
+end
+
+def fun_l20_n285(x)
+    if (x < 1)
+        fun_l21_n255(x)
+    else
+        fun_l21_n985(x)
+    end
+end
+
+def fun_l20_n286(x)
+    if (x < 1)
+        fun_l21_n348(x)
+    else
+        fun_l21_n54(x)
+    end
+end
+
+def fun_l20_n287(x)
+    if (x < 1)
+        fun_l21_n663(x)
+    else
+        fun_l21_n837(x)
+    end
+end
+
+def fun_l20_n288(x)
+    if (x < 1)
+        fun_l21_n444(x)
+    else
+        fun_l21_n767(x)
+    end
+end
+
+def fun_l20_n289(x)
+    if (x < 1)
+        fun_l21_n756(x)
+    else
+        fun_l21_n246(x)
+    end
+end
+
+def fun_l20_n290(x)
+    if (x < 1)
+        fun_l21_n0(x)
+    else
+        fun_l21_n253(x)
+    end
+end
+
+def fun_l20_n291(x)
+    if (x < 1)
+        fun_l21_n867(x)
+    else
+        fun_l21_n464(x)
+    end
+end
+
+def fun_l20_n292(x)
+    if (x < 1)
+        fun_l21_n885(x)
+    else
+        fun_l21_n588(x)
+    end
+end
+
+def fun_l20_n293(x)
+    if (x < 1)
+        fun_l21_n420(x)
+    else
+        fun_l21_n622(x)
+    end
+end
+
+def fun_l20_n294(x)
+    if (x < 1)
+        fun_l21_n411(x)
+    else
+        fun_l21_n351(x)
+    end
+end
+
+def fun_l20_n295(x)
+    if (x < 1)
+        fun_l21_n208(x)
+    else
+        fun_l21_n0(x)
+    end
+end
+
+def fun_l20_n296(x)
+    if (x < 1)
+        fun_l21_n551(x)
+    else
+        fun_l21_n68(x)
+    end
+end
+
+def fun_l20_n297(x)
+    if (x < 1)
+        fun_l21_n351(x)
+    else
+        fun_l21_n108(x)
+    end
+end
+
+def fun_l20_n298(x)
+    if (x < 1)
+        fun_l21_n134(x)
+    else
+        fun_l21_n893(x)
+    end
+end
+
+def fun_l20_n299(x)
+    if (x < 1)
+        fun_l21_n697(x)
+    else
+        fun_l21_n538(x)
+    end
+end
+
+def fun_l20_n300(x)
+    if (x < 1)
+        fun_l21_n61(x)
+    else
+        fun_l21_n641(x)
+    end
+end
+
+def fun_l20_n301(x)
+    if (x < 1)
+        fun_l21_n13(x)
+    else
+        fun_l21_n103(x)
+    end
+end
+
+def fun_l20_n302(x)
+    if (x < 1)
+        fun_l21_n260(x)
+    else
+        fun_l21_n430(x)
+    end
+end
+
+def fun_l20_n303(x)
+    if (x < 1)
+        fun_l21_n63(x)
+    else
+        fun_l21_n911(x)
+    end
+end
+
+def fun_l20_n304(x)
+    if (x < 1)
+        fun_l21_n470(x)
+    else
+        fun_l21_n407(x)
+    end
+end
+
+def fun_l20_n305(x)
+    if (x < 1)
+        fun_l21_n615(x)
+    else
+        fun_l21_n767(x)
+    end
+end
+
+def fun_l20_n306(x)
+    if (x < 1)
+        fun_l21_n898(x)
+    else
+        fun_l21_n215(x)
+    end
+end
+
+def fun_l20_n307(x)
+    if (x < 1)
+        fun_l21_n793(x)
+    else
+        fun_l21_n468(x)
+    end
+end
+
+def fun_l20_n308(x)
+    if (x < 1)
+        fun_l21_n582(x)
+    else
+        fun_l21_n968(x)
+    end
+end
+
+def fun_l20_n309(x)
+    if (x < 1)
+        fun_l21_n7(x)
+    else
+        fun_l21_n703(x)
+    end
+end
+
+def fun_l20_n310(x)
+    if (x < 1)
+        fun_l21_n826(x)
+    else
+        fun_l21_n735(x)
+    end
+end
+
+def fun_l20_n311(x)
+    if (x < 1)
+        fun_l21_n856(x)
+    else
+        fun_l21_n959(x)
+    end
+end
+
+def fun_l20_n312(x)
+    if (x < 1)
+        fun_l21_n194(x)
+    else
+        fun_l21_n158(x)
+    end
+end
+
+def fun_l20_n313(x)
+    if (x < 1)
+        fun_l21_n690(x)
+    else
+        fun_l21_n813(x)
+    end
+end
+
+def fun_l20_n314(x)
+    if (x < 1)
+        fun_l21_n699(x)
+    else
+        fun_l21_n842(x)
+    end
+end
+
+def fun_l20_n315(x)
+    if (x < 1)
+        fun_l21_n485(x)
+    else
+        fun_l21_n0(x)
+    end
+end
+
+def fun_l20_n316(x)
+    if (x < 1)
+        fun_l21_n753(x)
+    else
+        fun_l21_n306(x)
+    end
+end
+
+def fun_l20_n317(x)
+    if (x < 1)
+        fun_l21_n516(x)
+    else
+        fun_l21_n35(x)
+    end
+end
+
+def fun_l20_n318(x)
+    if (x < 1)
+        fun_l21_n78(x)
+    else
+        fun_l21_n104(x)
+    end
+end
+
+def fun_l20_n319(x)
+    if (x < 1)
+        fun_l21_n492(x)
+    else
+        fun_l21_n211(x)
+    end
+end
+
+def fun_l20_n320(x)
+    if (x < 1)
+        fun_l21_n303(x)
+    else
+        fun_l21_n218(x)
+    end
+end
+
+def fun_l20_n321(x)
+    if (x < 1)
+        fun_l21_n614(x)
+    else
+        fun_l21_n743(x)
+    end
+end
+
+def fun_l20_n322(x)
+    if (x < 1)
+        fun_l21_n141(x)
+    else
+        fun_l21_n320(x)
+    end
+end
+
+def fun_l20_n323(x)
+    if (x < 1)
+        fun_l21_n349(x)
+    else
+        fun_l21_n396(x)
+    end
+end
+
+def fun_l20_n324(x)
+    if (x < 1)
+        fun_l21_n189(x)
+    else
+        fun_l21_n32(x)
+    end
+end
+
+def fun_l20_n325(x)
+    if (x < 1)
+        fun_l21_n938(x)
+    else
+        fun_l21_n747(x)
+    end
+end
+
+def fun_l20_n326(x)
+    if (x < 1)
+        fun_l21_n571(x)
+    else
+        fun_l21_n20(x)
+    end
+end
+
+def fun_l20_n327(x)
+    if (x < 1)
+        fun_l21_n905(x)
+    else
+        fun_l21_n106(x)
+    end
+end
+
+def fun_l20_n328(x)
+    if (x < 1)
+        fun_l21_n849(x)
+    else
+        fun_l21_n747(x)
+    end
+end
+
+def fun_l20_n329(x)
+    if (x < 1)
+        fun_l21_n830(x)
+    else
+        fun_l21_n61(x)
+    end
+end
+
+def fun_l20_n330(x)
+    if (x < 1)
+        fun_l21_n613(x)
+    else
+        fun_l21_n945(x)
+    end
+end
+
+def fun_l20_n331(x)
+    if (x < 1)
+        fun_l21_n379(x)
+    else
+        fun_l21_n920(x)
+    end
+end
+
+def fun_l20_n332(x)
+    if (x < 1)
+        fun_l21_n315(x)
+    else
+        fun_l21_n968(x)
+    end
+end
+
+def fun_l20_n333(x)
+    if (x < 1)
+        fun_l21_n256(x)
+    else
+        fun_l21_n460(x)
+    end
+end
+
+def fun_l20_n334(x)
+    if (x < 1)
+        fun_l21_n644(x)
+    else
+        fun_l21_n372(x)
+    end
+end
+
+def fun_l20_n335(x)
+    if (x < 1)
+        fun_l21_n588(x)
+    else
+        fun_l21_n351(x)
+    end
+end
+
+def fun_l20_n336(x)
+    if (x < 1)
+        fun_l21_n516(x)
+    else
+        fun_l21_n975(x)
+    end
+end
+
+def fun_l20_n337(x)
+    if (x < 1)
+        fun_l21_n432(x)
+    else
+        fun_l21_n47(x)
+    end
+end
+
+def fun_l20_n338(x)
+    if (x < 1)
+        fun_l21_n31(x)
+    else
+        fun_l21_n728(x)
+    end
+end
+
+def fun_l20_n339(x)
+    if (x < 1)
+        fun_l21_n700(x)
+    else
+        fun_l21_n454(x)
+    end
+end
+
+def fun_l20_n340(x)
+    if (x < 1)
+        fun_l21_n947(x)
+    else
+        fun_l21_n880(x)
+    end
+end
+
+def fun_l20_n341(x)
+    if (x < 1)
+        fun_l21_n363(x)
+    else
+        fun_l21_n861(x)
+    end
+end
+
+def fun_l20_n342(x)
+    if (x < 1)
+        fun_l21_n338(x)
+    else
+        fun_l21_n118(x)
+    end
+end
+
+def fun_l20_n343(x)
+    if (x < 1)
+        fun_l21_n352(x)
+    else
+        fun_l21_n402(x)
+    end
+end
+
+def fun_l20_n344(x)
+    if (x < 1)
+        fun_l21_n344(x)
+    else
+        fun_l21_n407(x)
+    end
+end
+
+def fun_l20_n345(x)
+    if (x < 1)
+        fun_l21_n869(x)
+    else
+        fun_l21_n912(x)
+    end
+end
+
+def fun_l20_n346(x)
+    if (x < 1)
+        fun_l21_n397(x)
+    else
+        fun_l21_n429(x)
+    end
+end
+
+def fun_l20_n347(x)
+    if (x < 1)
+        fun_l21_n28(x)
+    else
+        fun_l21_n671(x)
+    end
+end
+
+def fun_l20_n348(x)
+    if (x < 1)
+        fun_l21_n215(x)
+    else
+        fun_l21_n821(x)
+    end
+end
+
+def fun_l20_n349(x)
+    if (x < 1)
+        fun_l21_n432(x)
+    else
+        fun_l21_n250(x)
+    end
+end
+
+def fun_l20_n350(x)
+    if (x < 1)
+        fun_l21_n496(x)
+    else
+        fun_l21_n988(x)
+    end
+end
+
+def fun_l20_n351(x)
+    if (x < 1)
+        fun_l21_n317(x)
+    else
+        fun_l21_n516(x)
+    end
+end
+
+def fun_l20_n352(x)
+    if (x < 1)
+        fun_l21_n968(x)
+    else
+        fun_l21_n638(x)
+    end
+end
+
+def fun_l20_n353(x)
+    if (x < 1)
+        fun_l21_n447(x)
+    else
+        fun_l21_n14(x)
+    end
+end
+
+def fun_l20_n354(x)
+    if (x < 1)
+        fun_l21_n151(x)
+    else
+        fun_l21_n545(x)
+    end
+end
+
+def fun_l20_n355(x)
+    if (x < 1)
+        fun_l21_n579(x)
+    else
+        fun_l21_n934(x)
+    end
+end
+
+def fun_l20_n356(x)
+    if (x < 1)
+        fun_l21_n612(x)
+    else
+        fun_l21_n433(x)
+    end
+end
+
+def fun_l20_n357(x)
+    if (x < 1)
+        fun_l21_n969(x)
+    else
+        fun_l21_n816(x)
+    end
+end
+
+def fun_l20_n358(x)
+    if (x < 1)
+        fun_l21_n24(x)
+    else
+        fun_l21_n272(x)
+    end
+end
+
+def fun_l20_n359(x)
+    if (x < 1)
+        fun_l21_n945(x)
+    else
+        fun_l21_n458(x)
+    end
+end
+
+def fun_l20_n360(x)
+    if (x < 1)
+        fun_l21_n294(x)
+    else
+        fun_l21_n934(x)
+    end
+end
+
+def fun_l20_n361(x)
+    if (x < 1)
+        fun_l21_n777(x)
+    else
+        fun_l21_n499(x)
+    end
+end
+
+def fun_l20_n362(x)
+    if (x < 1)
+        fun_l21_n538(x)
+    else
+        fun_l21_n400(x)
+    end
+end
+
+def fun_l20_n363(x)
+    if (x < 1)
+        fun_l21_n660(x)
+    else
+        fun_l21_n970(x)
+    end
+end
+
+def fun_l20_n364(x)
+    if (x < 1)
+        fun_l21_n230(x)
+    else
+        fun_l21_n977(x)
+    end
+end
+
+def fun_l20_n365(x)
+    if (x < 1)
+        fun_l21_n335(x)
+    else
+        fun_l21_n436(x)
+    end
+end
+
+def fun_l20_n366(x)
+    if (x < 1)
+        fun_l21_n596(x)
+    else
+        fun_l21_n992(x)
+    end
+end
+
+def fun_l20_n367(x)
+    if (x < 1)
+        fun_l21_n502(x)
+    else
+        fun_l21_n251(x)
+    end
+end
+
+def fun_l20_n368(x)
+    if (x < 1)
+        fun_l21_n501(x)
+    else
+        fun_l21_n493(x)
+    end
+end
+
+def fun_l20_n369(x)
+    if (x < 1)
+        fun_l21_n48(x)
+    else
+        fun_l21_n850(x)
+    end
+end
+
+def fun_l20_n370(x)
+    if (x < 1)
+        fun_l21_n900(x)
+    else
+        fun_l21_n919(x)
+    end
+end
+
+def fun_l20_n371(x)
+    if (x < 1)
+        fun_l21_n349(x)
+    else
+        fun_l21_n80(x)
+    end
+end
+
+def fun_l20_n372(x)
+    if (x < 1)
+        fun_l21_n275(x)
+    else
+        fun_l21_n135(x)
+    end
+end
+
+def fun_l20_n373(x)
+    if (x < 1)
+        fun_l21_n987(x)
+    else
+        fun_l21_n472(x)
+    end
+end
+
+def fun_l20_n374(x)
+    if (x < 1)
+        fun_l21_n877(x)
+    else
+        fun_l21_n298(x)
+    end
+end
+
+def fun_l20_n375(x)
+    if (x < 1)
+        fun_l21_n518(x)
+    else
+        fun_l21_n676(x)
+    end
+end
+
+def fun_l20_n376(x)
+    if (x < 1)
+        fun_l21_n108(x)
+    else
+        fun_l21_n470(x)
+    end
+end
+
+def fun_l20_n377(x)
+    if (x < 1)
+        fun_l21_n643(x)
+    else
+        fun_l21_n189(x)
+    end
+end
+
+def fun_l20_n378(x)
+    if (x < 1)
+        fun_l21_n608(x)
+    else
+        fun_l21_n376(x)
+    end
+end
+
+def fun_l20_n379(x)
+    if (x < 1)
+        fun_l21_n520(x)
+    else
+        fun_l21_n651(x)
+    end
+end
+
+def fun_l20_n380(x)
+    if (x < 1)
+        fun_l21_n399(x)
+    else
+        fun_l21_n867(x)
+    end
+end
+
+def fun_l20_n381(x)
+    if (x < 1)
+        fun_l21_n815(x)
+    else
+        fun_l21_n78(x)
+    end
+end
+
+def fun_l20_n382(x)
+    if (x < 1)
+        fun_l21_n216(x)
+    else
+        fun_l21_n379(x)
+    end
+end
+
+def fun_l20_n383(x)
+    if (x < 1)
+        fun_l21_n628(x)
+    else
+        fun_l21_n227(x)
+    end
+end
+
+def fun_l20_n384(x)
+    if (x < 1)
+        fun_l21_n699(x)
+    else
+        fun_l21_n170(x)
+    end
+end
+
+def fun_l20_n385(x)
+    if (x < 1)
+        fun_l21_n444(x)
+    else
+        fun_l21_n603(x)
+    end
+end
+
+def fun_l20_n386(x)
+    if (x < 1)
+        fun_l21_n299(x)
+    else
+        fun_l21_n803(x)
+    end
+end
+
+def fun_l20_n387(x)
+    if (x < 1)
+        fun_l21_n708(x)
+    else
+        fun_l21_n187(x)
+    end
+end
+
+def fun_l20_n388(x)
+    if (x < 1)
+        fun_l21_n490(x)
+    else
+        fun_l21_n75(x)
+    end
+end
+
+def fun_l20_n389(x)
+    if (x < 1)
+        fun_l21_n856(x)
+    else
+        fun_l21_n257(x)
+    end
+end
+
+def fun_l20_n390(x)
+    if (x < 1)
+        fun_l21_n394(x)
+    else
+        fun_l21_n669(x)
+    end
+end
+
+def fun_l20_n391(x)
+    if (x < 1)
+        fun_l21_n501(x)
+    else
+        fun_l21_n555(x)
+    end
+end
+
+def fun_l20_n392(x)
+    if (x < 1)
+        fun_l21_n657(x)
+    else
+        fun_l21_n226(x)
+    end
+end
+
+def fun_l20_n393(x)
+    if (x < 1)
+        fun_l21_n229(x)
+    else
+        fun_l21_n898(x)
+    end
+end
+
+def fun_l20_n394(x)
+    if (x < 1)
+        fun_l21_n726(x)
+    else
+        fun_l21_n349(x)
+    end
+end
+
+def fun_l20_n395(x)
+    if (x < 1)
+        fun_l21_n247(x)
+    else
+        fun_l21_n996(x)
+    end
+end
+
+def fun_l20_n396(x)
+    if (x < 1)
+        fun_l21_n136(x)
+    else
+        fun_l21_n601(x)
+    end
+end
+
+def fun_l20_n397(x)
+    if (x < 1)
+        fun_l21_n365(x)
+    else
+        fun_l21_n203(x)
+    end
+end
+
+def fun_l20_n398(x)
+    if (x < 1)
+        fun_l21_n376(x)
+    else
+        fun_l21_n172(x)
+    end
+end
+
+def fun_l20_n399(x)
+    if (x < 1)
+        fun_l21_n23(x)
+    else
+        fun_l21_n577(x)
+    end
+end
+
+def fun_l20_n400(x)
+    if (x < 1)
+        fun_l21_n368(x)
+    else
+        fun_l21_n448(x)
+    end
+end
+
+def fun_l20_n401(x)
+    if (x < 1)
+        fun_l21_n934(x)
+    else
+        fun_l21_n949(x)
+    end
+end
+
+def fun_l20_n402(x)
+    if (x < 1)
+        fun_l21_n127(x)
+    else
+        fun_l21_n132(x)
+    end
+end
+
+def fun_l20_n403(x)
+    if (x < 1)
+        fun_l21_n133(x)
+    else
+        fun_l21_n389(x)
+    end
+end
+
+def fun_l20_n404(x)
+    if (x < 1)
+        fun_l21_n750(x)
+    else
+        fun_l21_n591(x)
+    end
+end
+
+def fun_l20_n405(x)
+    if (x < 1)
+        fun_l21_n492(x)
+    else
+        fun_l21_n763(x)
+    end
+end
+
+def fun_l20_n406(x)
+    if (x < 1)
+        fun_l21_n137(x)
+    else
+        fun_l21_n552(x)
+    end
+end
+
+def fun_l20_n407(x)
+    if (x < 1)
+        fun_l21_n200(x)
+    else
+        fun_l21_n537(x)
+    end
+end
+
+def fun_l20_n408(x)
+    if (x < 1)
+        fun_l21_n681(x)
+    else
+        fun_l21_n645(x)
+    end
+end
+
+def fun_l20_n409(x)
+    if (x < 1)
+        fun_l21_n86(x)
+    else
+        fun_l21_n239(x)
+    end
+end
+
+def fun_l20_n410(x)
+    if (x < 1)
+        fun_l21_n357(x)
+    else
+        fun_l21_n98(x)
+    end
+end
+
+def fun_l20_n411(x)
+    if (x < 1)
+        fun_l21_n889(x)
+    else
+        fun_l21_n199(x)
+    end
+end
+
+def fun_l20_n412(x)
+    if (x < 1)
+        fun_l21_n504(x)
+    else
+        fun_l21_n950(x)
+    end
+end
+
+def fun_l20_n413(x)
+    if (x < 1)
+        fun_l21_n220(x)
+    else
+        fun_l21_n351(x)
+    end
+end
+
+def fun_l20_n414(x)
+    if (x < 1)
+        fun_l21_n287(x)
+    else
+        fun_l21_n614(x)
+    end
+end
+
+def fun_l20_n415(x)
+    if (x < 1)
+        fun_l21_n699(x)
+    else
+        fun_l21_n464(x)
+    end
+end
+
+def fun_l20_n416(x)
+    if (x < 1)
+        fun_l21_n638(x)
+    else
+        fun_l21_n10(x)
+    end
+end
+
+def fun_l20_n417(x)
+    if (x < 1)
+        fun_l21_n52(x)
+    else
+        fun_l21_n348(x)
+    end
+end
+
+def fun_l20_n418(x)
+    if (x < 1)
+        fun_l21_n248(x)
+    else
+        fun_l21_n703(x)
+    end
+end
+
+def fun_l20_n419(x)
+    if (x < 1)
+        fun_l21_n430(x)
+    else
+        fun_l21_n886(x)
+    end
+end
+
+def fun_l20_n420(x)
+    if (x < 1)
+        fun_l21_n695(x)
+    else
+        fun_l21_n528(x)
+    end
+end
+
+def fun_l20_n421(x)
+    if (x < 1)
+        fun_l21_n545(x)
+    else
+        fun_l21_n521(x)
+    end
+end
+
+def fun_l20_n422(x)
+    if (x < 1)
+        fun_l21_n66(x)
+    else
+        fun_l21_n31(x)
+    end
+end
+
+def fun_l20_n423(x)
+    if (x < 1)
+        fun_l21_n411(x)
+    else
+        fun_l21_n476(x)
+    end
+end
+
+def fun_l20_n424(x)
+    if (x < 1)
+        fun_l21_n433(x)
+    else
+        fun_l21_n940(x)
+    end
+end
+
+def fun_l20_n425(x)
+    if (x < 1)
+        fun_l21_n622(x)
+    else
+        fun_l21_n817(x)
+    end
+end
+
+def fun_l20_n426(x)
+    if (x < 1)
+        fun_l21_n516(x)
+    else
+        fun_l21_n665(x)
+    end
+end
+
+def fun_l20_n427(x)
+    if (x < 1)
+        fun_l21_n828(x)
+    else
+        fun_l21_n47(x)
+    end
+end
+
+def fun_l20_n428(x)
+    if (x < 1)
+        fun_l21_n445(x)
+    else
+        fun_l21_n94(x)
+    end
+end
+
+def fun_l20_n429(x)
+    if (x < 1)
+        fun_l21_n799(x)
+    else
+        fun_l21_n676(x)
+    end
+end
+
+def fun_l20_n430(x)
+    if (x < 1)
+        fun_l21_n518(x)
+    else
+        fun_l21_n988(x)
+    end
+end
+
+def fun_l20_n431(x)
+    if (x < 1)
+        fun_l21_n787(x)
+    else
+        fun_l21_n127(x)
+    end
+end
+
+def fun_l20_n432(x)
+    if (x < 1)
+        fun_l21_n502(x)
+    else
+        fun_l21_n719(x)
+    end
+end
+
+def fun_l20_n433(x)
+    if (x < 1)
+        fun_l21_n406(x)
+    else
+        fun_l21_n828(x)
+    end
+end
+
+def fun_l20_n434(x)
+    if (x < 1)
+        fun_l21_n845(x)
+    else
+        fun_l21_n75(x)
+    end
+end
+
+def fun_l20_n435(x)
+    if (x < 1)
+        fun_l21_n425(x)
+    else
+        fun_l21_n449(x)
+    end
+end
+
+def fun_l20_n436(x)
+    if (x < 1)
+        fun_l21_n520(x)
+    else
+        fun_l21_n68(x)
+    end
+end
+
+def fun_l20_n437(x)
+    if (x < 1)
+        fun_l21_n872(x)
+    else
+        fun_l21_n978(x)
+    end
+end
+
+def fun_l20_n438(x)
+    if (x < 1)
+        fun_l21_n522(x)
+    else
+        fun_l21_n658(x)
+    end
+end
+
+def fun_l20_n439(x)
+    if (x < 1)
+        fun_l21_n976(x)
+    else
+        fun_l21_n224(x)
+    end
+end
+
+def fun_l20_n440(x)
+    if (x < 1)
+        fun_l21_n256(x)
+    else
+        fun_l21_n700(x)
+    end
+end
+
+def fun_l20_n441(x)
+    if (x < 1)
+        fun_l21_n722(x)
+    else
+        fun_l21_n348(x)
+    end
+end
+
+def fun_l20_n442(x)
+    if (x < 1)
+        fun_l21_n377(x)
+    else
+        fun_l21_n966(x)
+    end
+end
+
+def fun_l20_n443(x)
+    if (x < 1)
+        fun_l21_n519(x)
+    else
+        fun_l21_n611(x)
+    end
+end
+
+def fun_l20_n444(x)
+    if (x < 1)
+        fun_l21_n318(x)
+    else
+        fun_l21_n937(x)
+    end
+end
+
+def fun_l20_n445(x)
+    if (x < 1)
+        fun_l21_n416(x)
+    else
+        fun_l21_n874(x)
+    end
+end
+
+def fun_l20_n446(x)
+    if (x < 1)
+        fun_l21_n157(x)
+    else
+        fun_l21_n328(x)
+    end
+end
+
+def fun_l20_n447(x)
+    if (x < 1)
+        fun_l21_n540(x)
+    else
+        fun_l21_n906(x)
+    end
+end
+
+def fun_l20_n448(x)
+    if (x < 1)
+        fun_l21_n13(x)
+    else
+        fun_l21_n325(x)
+    end
+end
+
+def fun_l20_n449(x)
+    if (x < 1)
+        fun_l21_n771(x)
+    else
+        fun_l21_n929(x)
+    end
+end
+
+def fun_l20_n450(x)
+    if (x < 1)
+        fun_l21_n770(x)
+    else
+        fun_l21_n778(x)
+    end
+end
+
+def fun_l20_n451(x)
+    if (x < 1)
+        fun_l21_n939(x)
+    else
+        fun_l21_n493(x)
+    end
+end
+
+def fun_l20_n452(x)
+    if (x < 1)
+        fun_l21_n481(x)
+    else
+        fun_l21_n407(x)
+    end
+end
+
+def fun_l20_n453(x)
+    if (x < 1)
+        fun_l21_n759(x)
+    else
+        fun_l21_n322(x)
+    end
+end
+
+def fun_l20_n454(x)
+    if (x < 1)
+        fun_l21_n703(x)
+    else
+        fun_l21_n409(x)
+    end
+end
+
+def fun_l20_n455(x)
+    if (x < 1)
+        fun_l21_n394(x)
+    else
+        fun_l21_n415(x)
+    end
+end
+
+def fun_l20_n456(x)
+    if (x < 1)
+        fun_l21_n583(x)
+    else
+        fun_l21_n188(x)
+    end
+end
+
+def fun_l20_n457(x)
+    if (x < 1)
+        fun_l21_n668(x)
+    else
+        fun_l21_n46(x)
+    end
+end
+
+def fun_l20_n458(x)
+    if (x < 1)
+        fun_l21_n855(x)
+    else
+        fun_l21_n802(x)
+    end
+end
+
+def fun_l20_n459(x)
+    if (x < 1)
+        fun_l21_n720(x)
+    else
+        fun_l21_n691(x)
+    end
+end
+
+def fun_l20_n460(x)
+    if (x < 1)
+        fun_l21_n440(x)
+    else
+        fun_l21_n353(x)
+    end
+end
+
+def fun_l20_n461(x)
+    if (x < 1)
+        fun_l21_n604(x)
+    else
+        fun_l21_n872(x)
+    end
+end
+
+def fun_l20_n462(x)
+    if (x < 1)
+        fun_l21_n355(x)
+    else
+        fun_l21_n699(x)
+    end
+end
+
+def fun_l20_n463(x)
+    if (x < 1)
+        fun_l21_n476(x)
+    else
+        fun_l21_n447(x)
+    end
+end
+
+def fun_l20_n464(x)
+    if (x < 1)
+        fun_l21_n554(x)
+    else
+        fun_l21_n745(x)
+    end
+end
+
+def fun_l20_n465(x)
+    if (x < 1)
+        fun_l21_n632(x)
+    else
+        fun_l21_n281(x)
+    end
+end
+
+def fun_l20_n466(x)
+    if (x < 1)
+        fun_l21_n873(x)
+    else
+        fun_l21_n449(x)
+    end
+end
+
+def fun_l20_n467(x)
+    if (x < 1)
+        fun_l21_n90(x)
+    else
+        fun_l21_n933(x)
+    end
+end
+
+def fun_l20_n468(x)
+    if (x < 1)
+        fun_l21_n915(x)
+    else
+        fun_l21_n801(x)
+    end
+end
+
+def fun_l20_n469(x)
+    if (x < 1)
+        fun_l21_n429(x)
+    else
+        fun_l21_n139(x)
+    end
+end
+
+def fun_l20_n470(x)
+    if (x < 1)
+        fun_l21_n858(x)
+    else
+        fun_l21_n450(x)
+    end
+end
+
+def fun_l20_n471(x)
+    if (x < 1)
+        fun_l21_n556(x)
+    else
+        fun_l21_n109(x)
+    end
+end
+
+def fun_l20_n472(x)
+    if (x < 1)
+        fun_l21_n395(x)
+    else
+        fun_l21_n129(x)
+    end
+end
+
+def fun_l20_n473(x)
+    if (x < 1)
+        fun_l21_n282(x)
+    else
+        fun_l21_n277(x)
+    end
+end
+
+def fun_l20_n474(x)
+    if (x < 1)
+        fun_l21_n90(x)
+    else
+        fun_l21_n399(x)
+    end
+end
+
+def fun_l20_n475(x)
+    if (x < 1)
+        fun_l21_n719(x)
+    else
+        fun_l21_n698(x)
+    end
+end
+
+def fun_l20_n476(x)
+    if (x < 1)
+        fun_l21_n597(x)
+    else
+        fun_l21_n210(x)
+    end
+end
+
+def fun_l20_n477(x)
+    if (x < 1)
+        fun_l21_n722(x)
+    else
+        fun_l21_n31(x)
+    end
+end
+
+def fun_l20_n478(x)
+    if (x < 1)
+        fun_l21_n874(x)
+    else
+        fun_l21_n527(x)
+    end
+end
+
+def fun_l20_n479(x)
+    if (x < 1)
+        fun_l21_n247(x)
+    else
+        fun_l21_n164(x)
+    end
+end
+
+def fun_l20_n480(x)
+    if (x < 1)
+        fun_l21_n449(x)
+    else
+        fun_l21_n106(x)
+    end
+end
+
+def fun_l20_n481(x)
+    if (x < 1)
+        fun_l21_n787(x)
+    else
+        fun_l21_n678(x)
+    end
+end
+
+def fun_l20_n482(x)
+    if (x < 1)
+        fun_l21_n176(x)
+    else
+        fun_l21_n650(x)
+    end
+end
+
+def fun_l20_n483(x)
+    if (x < 1)
+        fun_l21_n314(x)
+    else
+        fun_l21_n325(x)
+    end
+end
+
+def fun_l20_n484(x)
+    if (x < 1)
+        fun_l21_n877(x)
+    else
+        fun_l21_n539(x)
+    end
+end
+
+def fun_l20_n485(x)
+    if (x < 1)
+        fun_l21_n230(x)
+    else
+        fun_l21_n314(x)
+    end
+end
+
+def fun_l20_n486(x)
+    if (x < 1)
+        fun_l21_n778(x)
+    else
+        fun_l21_n493(x)
+    end
+end
+
+def fun_l20_n487(x)
+    if (x < 1)
+        fun_l21_n615(x)
+    else
+        fun_l21_n111(x)
+    end
+end
+
+def fun_l20_n488(x)
+    if (x < 1)
+        fun_l21_n133(x)
+    else
+        fun_l21_n381(x)
+    end
+end
+
+def fun_l20_n489(x)
+    if (x < 1)
+        fun_l21_n332(x)
+    else
+        fun_l21_n68(x)
+    end
+end
+
+def fun_l20_n490(x)
+    if (x < 1)
+        fun_l21_n995(x)
+    else
+        fun_l21_n861(x)
+    end
+end
+
+def fun_l20_n491(x)
+    if (x < 1)
+        fun_l21_n537(x)
+    else
+        fun_l21_n164(x)
+    end
+end
+
+def fun_l20_n492(x)
+    if (x < 1)
+        fun_l21_n759(x)
+    else
+        fun_l21_n598(x)
+    end
+end
+
+def fun_l20_n493(x)
+    if (x < 1)
+        fun_l21_n890(x)
+    else
+        fun_l21_n644(x)
+    end
+end
+
+def fun_l20_n494(x)
+    if (x < 1)
+        fun_l21_n641(x)
+    else
+        fun_l21_n420(x)
+    end
+end
+
+def fun_l20_n495(x)
+    if (x < 1)
+        fun_l21_n826(x)
+    else
+        fun_l21_n821(x)
+    end
+end
+
+def fun_l20_n496(x)
+    if (x < 1)
+        fun_l21_n348(x)
+    else
+        fun_l21_n277(x)
+    end
+end
+
+def fun_l20_n497(x)
+    if (x < 1)
+        fun_l21_n14(x)
+    else
+        fun_l21_n950(x)
+    end
+end
+
+def fun_l20_n498(x)
+    if (x < 1)
+        fun_l21_n43(x)
+    else
+        fun_l21_n759(x)
+    end
+end
+
+def fun_l20_n499(x)
+    if (x < 1)
+        fun_l21_n899(x)
+    else
+        fun_l21_n730(x)
+    end
+end
+
+def fun_l20_n500(x)
+    if (x < 1)
+        fun_l21_n918(x)
+    else
+        fun_l21_n454(x)
+    end
+end
+
+def fun_l20_n501(x)
+    if (x < 1)
+        fun_l21_n821(x)
+    else
+        fun_l21_n388(x)
+    end
+end
+
+def fun_l20_n502(x)
+    if (x < 1)
+        fun_l21_n164(x)
+    else
+        fun_l21_n718(x)
+    end
+end
+
+def fun_l20_n503(x)
+    if (x < 1)
+        fun_l21_n152(x)
+    else
+        fun_l21_n613(x)
+    end
+end
+
+def fun_l20_n504(x)
+    if (x < 1)
+        fun_l21_n931(x)
+    else
+        fun_l21_n912(x)
+    end
+end
+
+def fun_l20_n505(x)
+    if (x < 1)
+        fun_l21_n655(x)
+    else
+        fun_l21_n38(x)
+    end
+end
+
+def fun_l20_n506(x)
+    if (x < 1)
+        fun_l21_n408(x)
+    else
+        fun_l21_n38(x)
+    end
+end
+
+def fun_l20_n507(x)
+    if (x < 1)
+        fun_l21_n960(x)
+    else
+        fun_l21_n857(x)
+    end
+end
+
+def fun_l20_n508(x)
+    if (x < 1)
+        fun_l21_n308(x)
+    else
+        fun_l21_n210(x)
+    end
+end
+
+def fun_l20_n509(x)
+    if (x < 1)
+        fun_l21_n985(x)
+    else
+        fun_l21_n537(x)
+    end
+end
+
+def fun_l20_n510(x)
+    if (x < 1)
+        fun_l21_n200(x)
+    else
+        fun_l21_n598(x)
+    end
+end
+
+def fun_l20_n511(x)
+    if (x < 1)
+        fun_l21_n451(x)
+    else
+        fun_l21_n958(x)
+    end
+end
+
+def fun_l20_n512(x)
+    if (x < 1)
+        fun_l21_n459(x)
+    else
+        fun_l21_n823(x)
+    end
+end
+
+def fun_l20_n513(x)
+    if (x < 1)
+        fun_l21_n153(x)
+    else
+        fun_l21_n931(x)
+    end
+end
+
+def fun_l20_n514(x)
+    if (x < 1)
+        fun_l21_n213(x)
+    else
+        fun_l21_n336(x)
+    end
+end
+
+def fun_l20_n515(x)
+    if (x < 1)
+        fun_l21_n401(x)
+    else
+        fun_l21_n222(x)
+    end
+end
+
+def fun_l20_n516(x)
+    if (x < 1)
+        fun_l21_n582(x)
+    else
+        fun_l21_n735(x)
+    end
+end
+
+def fun_l20_n517(x)
+    if (x < 1)
+        fun_l21_n799(x)
+    else
+        fun_l21_n139(x)
+    end
+end
+
+def fun_l20_n518(x)
+    if (x < 1)
+        fun_l21_n279(x)
+    else
+        fun_l21_n476(x)
+    end
+end
+
+def fun_l20_n519(x)
+    if (x < 1)
+        fun_l21_n624(x)
+    else
+        fun_l21_n276(x)
+    end
+end
+
+def fun_l20_n520(x)
+    if (x < 1)
+        fun_l21_n505(x)
+    else
+        fun_l21_n523(x)
+    end
+end
+
+def fun_l20_n521(x)
+    if (x < 1)
+        fun_l21_n887(x)
+    else
+        fun_l21_n948(x)
+    end
+end
+
+def fun_l20_n522(x)
+    if (x < 1)
+        fun_l21_n969(x)
+    else
+        fun_l21_n988(x)
+    end
+end
+
+def fun_l20_n523(x)
+    if (x < 1)
+        fun_l21_n271(x)
+    else
+        fun_l21_n189(x)
+    end
+end
+
+def fun_l20_n524(x)
+    if (x < 1)
+        fun_l21_n478(x)
+    else
+        fun_l21_n111(x)
+    end
+end
+
+def fun_l20_n525(x)
+    if (x < 1)
+        fun_l21_n808(x)
+    else
+        fun_l21_n256(x)
+    end
+end
+
+def fun_l20_n526(x)
+    if (x < 1)
+        fun_l21_n715(x)
+    else
+        fun_l21_n508(x)
+    end
+end
+
+def fun_l20_n527(x)
+    if (x < 1)
+        fun_l21_n819(x)
+    else
+        fun_l21_n670(x)
+    end
+end
+
+def fun_l20_n528(x)
+    if (x < 1)
+        fun_l21_n598(x)
+    else
+        fun_l21_n369(x)
+    end
+end
+
+def fun_l20_n529(x)
+    if (x < 1)
+        fun_l21_n391(x)
+    else
+        fun_l21_n651(x)
+    end
+end
+
+def fun_l20_n530(x)
+    if (x < 1)
+        fun_l21_n69(x)
+    else
+        fun_l21_n706(x)
+    end
+end
+
+def fun_l20_n531(x)
+    if (x < 1)
+        fun_l21_n786(x)
+    else
+        fun_l21_n289(x)
+    end
+end
+
+def fun_l20_n532(x)
+    if (x < 1)
+        fun_l21_n128(x)
+    else
+        fun_l21_n789(x)
+    end
+end
+
+def fun_l20_n533(x)
+    if (x < 1)
+        fun_l21_n935(x)
+    else
+        fun_l21_n29(x)
+    end
+end
+
+def fun_l20_n534(x)
+    if (x < 1)
+        fun_l21_n735(x)
+    else
+        fun_l21_n381(x)
+    end
+end
+
+def fun_l20_n535(x)
+    if (x < 1)
+        fun_l21_n299(x)
+    else
+        fun_l21_n932(x)
+    end
+end
+
+def fun_l20_n536(x)
+    if (x < 1)
+        fun_l21_n823(x)
+    else
+        fun_l21_n7(x)
+    end
+end
+
+def fun_l20_n537(x)
+    if (x < 1)
+        fun_l21_n152(x)
+    else
+        fun_l21_n758(x)
+    end
+end
+
+def fun_l20_n538(x)
+    if (x < 1)
+        fun_l21_n8(x)
+    else
+        fun_l21_n772(x)
+    end
+end
+
+def fun_l20_n539(x)
+    if (x < 1)
+        fun_l21_n900(x)
+    else
+        fun_l21_n984(x)
+    end
+end
+
+def fun_l20_n540(x)
+    if (x < 1)
+        fun_l21_n726(x)
+    else
+        fun_l21_n337(x)
+    end
+end
+
+def fun_l20_n541(x)
+    if (x < 1)
+        fun_l21_n557(x)
+    else
+        fun_l21_n998(x)
+    end
+end
+
+def fun_l20_n542(x)
+    if (x < 1)
+        fun_l21_n898(x)
+    else
+        fun_l21_n389(x)
+    end
+end
+
+def fun_l20_n543(x)
+    if (x < 1)
+        fun_l21_n71(x)
+    else
+        fun_l21_n276(x)
+    end
+end
+
+def fun_l20_n544(x)
+    if (x < 1)
+        fun_l21_n888(x)
+    else
+        fun_l21_n525(x)
+    end
+end
+
+def fun_l20_n545(x)
+    if (x < 1)
+        fun_l21_n797(x)
+    else
+        fun_l21_n487(x)
+    end
+end
+
+def fun_l20_n546(x)
+    if (x < 1)
+        fun_l21_n825(x)
+    else
+        fun_l21_n349(x)
+    end
+end
+
+def fun_l20_n547(x)
+    if (x < 1)
+        fun_l21_n538(x)
+    else
+        fun_l21_n817(x)
+    end
+end
+
+def fun_l20_n548(x)
+    if (x < 1)
+        fun_l21_n630(x)
+    else
+        fun_l21_n432(x)
+    end
+end
+
+def fun_l20_n549(x)
+    if (x < 1)
+        fun_l21_n553(x)
+    else
+        fun_l21_n179(x)
+    end
+end
+
+def fun_l20_n550(x)
+    if (x < 1)
+        fun_l21_n982(x)
+    else
+        fun_l21_n350(x)
+    end
+end
+
+def fun_l20_n551(x)
+    if (x < 1)
+        fun_l21_n404(x)
+    else
+        fun_l21_n313(x)
+    end
+end
+
+def fun_l20_n552(x)
+    if (x < 1)
+        fun_l21_n893(x)
+    else
+        fun_l21_n879(x)
+    end
+end
+
+def fun_l20_n553(x)
+    if (x < 1)
+        fun_l21_n360(x)
+    else
+        fun_l21_n403(x)
+    end
+end
+
+def fun_l20_n554(x)
+    if (x < 1)
+        fun_l21_n607(x)
+    else
+        fun_l21_n18(x)
+    end
+end
+
+def fun_l20_n555(x)
+    if (x < 1)
+        fun_l21_n269(x)
+    else
+        fun_l21_n514(x)
+    end
+end
+
+def fun_l20_n556(x)
+    if (x < 1)
+        fun_l21_n22(x)
+    else
+        fun_l21_n164(x)
+    end
+end
+
+def fun_l20_n557(x)
+    if (x < 1)
+        fun_l21_n560(x)
+    else
+        fun_l21_n671(x)
+    end
+end
+
+def fun_l20_n558(x)
+    if (x < 1)
+        fun_l21_n857(x)
+    else
+        fun_l21_n34(x)
+    end
+end
+
+def fun_l20_n559(x)
+    if (x < 1)
+        fun_l21_n750(x)
+    else
+        fun_l21_n267(x)
+    end
+end
+
+def fun_l20_n560(x)
+    if (x < 1)
+        fun_l21_n97(x)
+    else
+        fun_l21_n72(x)
+    end
+end
+
+def fun_l20_n561(x)
+    if (x < 1)
+        fun_l21_n482(x)
+    else
+        fun_l21_n644(x)
+    end
+end
+
+def fun_l20_n562(x)
+    if (x < 1)
+        fun_l21_n147(x)
+    else
+        fun_l21_n524(x)
+    end
+end
+
+def fun_l20_n563(x)
+    if (x < 1)
+        fun_l21_n509(x)
+    else
+        fun_l21_n124(x)
+    end
+end
+
+def fun_l20_n564(x)
+    if (x < 1)
+        fun_l21_n183(x)
+    else
+        fun_l21_n254(x)
+    end
+end
+
+def fun_l20_n565(x)
+    if (x < 1)
+        fun_l21_n919(x)
+    else
+        fun_l21_n727(x)
+    end
+end
+
+def fun_l20_n566(x)
+    if (x < 1)
+        fun_l21_n847(x)
+    else
+        fun_l21_n546(x)
+    end
+end
+
+def fun_l20_n567(x)
+    if (x < 1)
+        fun_l21_n214(x)
+    else
+        fun_l21_n692(x)
+    end
+end
+
+def fun_l20_n568(x)
+    if (x < 1)
+        fun_l21_n867(x)
+    else
+        fun_l21_n747(x)
+    end
+end
+
+def fun_l20_n569(x)
+    if (x < 1)
+        fun_l21_n277(x)
+    else
+        fun_l21_n130(x)
+    end
+end
+
+def fun_l20_n570(x)
+    if (x < 1)
+        fun_l21_n472(x)
+    else
+        fun_l21_n296(x)
+    end
+end
+
+def fun_l20_n571(x)
+    if (x < 1)
+        fun_l21_n633(x)
+    else
+        fun_l21_n704(x)
+    end
+end
+
+def fun_l20_n572(x)
+    if (x < 1)
+        fun_l21_n179(x)
+    else
+        fun_l21_n683(x)
+    end
+end
+
+def fun_l20_n573(x)
+    if (x < 1)
+        fun_l21_n607(x)
+    else
+        fun_l21_n140(x)
+    end
+end
+
+def fun_l20_n574(x)
+    if (x < 1)
+        fun_l21_n647(x)
+    else
+        fun_l21_n233(x)
+    end
+end
+
+def fun_l20_n575(x)
+    if (x < 1)
+        fun_l21_n992(x)
+    else
+        fun_l21_n951(x)
+    end
+end
+
+def fun_l20_n576(x)
+    if (x < 1)
+        fun_l21_n750(x)
+    else
+        fun_l21_n574(x)
+    end
+end
+
+def fun_l20_n577(x)
+    if (x < 1)
+        fun_l21_n116(x)
+    else
+        fun_l21_n488(x)
+    end
+end
+
+def fun_l20_n578(x)
+    if (x < 1)
+        fun_l21_n580(x)
+    else
+        fun_l21_n547(x)
+    end
+end
+
+def fun_l20_n579(x)
+    if (x < 1)
+        fun_l21_n576(x)
+    else
+        fun_l21_n744(x)
+    end
+end
+
+def fun_l20_n580(x)
+    if (x < 1)
+        fun_l21_n791(x)
+    else
+        fun_l21_n495(x)
+    end
+end
+
+def fun_l20_n581(x)
+    if (x < 1)
+        fun_l21_n188(x)
+    else
+        fun_l21_n795(x)
+    end
+end
+
+def fun_l20_n582(x)
+    if (x < 1)
+        fun_l21_n477(x)
+    else
+        fun_l21_n965(x)
+    end
+end
+
+def fun_l20_n583(x)
+    if (x < 1)
+        fun_l21_n436(x)
+    else
+        fun_l21_n169(x)
+    end
+end
+
+def fun_l20_n584(x)
+    if (x < 1)
+        fun_l21_n518(x)
+    else
+        fun_l21_n849(x)
+    end
+end
+
+def fun_l20_n585(x)
+    if (x < 1)
+        fun_l21_n747(x)
+    else
+        fun_l21_n882(x)
+    end
+end
+
+def fun_l20_n586(x)
+    if (x < 1)
+        fun_l21_n0(x)
+    else
+        fun_l21_n481(x)
+    end
+end
+
+def fun_l20_n587(x)
+    if (x < 1)
+        fun_l21_n876(x)
+    else
+        fun_l21_n279(x)
+    end
+end
+
+def fun_l20_n588(x)
+    if (x < 1)
+        fun_l21_n355(x)
+    else
+        fun_l21_n744(x)
+    end
+end
+
+def fun_l20_n589(x)
+    if (x < 1)
+        fun_l21_n408(x)
+    else
+        fun_l21_n27(x)
+    end
+end
+
+def fun_l20_n590(x)
+    if (x < 1)
+        fun_l21_n152(x)
+    else
+        fun_l21_n867(x)
+    end
+end
+
+def fun_l20_n591(x)
+    if (x < 1)
+        fun_l21_n543(x)
+    else
+        fun_l21_n193(x)
+    end
+end
+
+def fun_l20_n592(x)
+    if (x < 1)
+        fun_l21_n160(x)
+    else
+        fun_l21_n185(x)
+    end
+end
+
+def fun_l20_n593(x)
+    if (x < 1)
+        fun_l21_n613(x)
+    else
+        fun_l21_n403(x)
+    end
+end
+
+def fun_l20_n594(x)
+    if (x < 1)
+        fun_l21_n660(x)
+    else
+        fun_l21_n933(x)
+    end
+end
+
+def fun_l20_n595(x)
+    if (x < 1)
+        fun_l21_n222(x)
+    else
+        fun_l21_n922(x)
+    end
+end
+
+def fun_l20_n596(x)
+    if (x < 1)
+        fun_l21_n668(x)
+    else
+        fun_l21_n857(x)
+    end
+end
+
+def fun_l20_n597(x)
+    if (x < 1)
+        fun_l21_n846(x)
+    else
+        fun_l21_n164(x)
+    end
+end
+
+def fun_l20_n598(x)
+    if (x < 1)
+        fun_l21_n755(x)
+    else
+        fun_l21_n591(x)
+    end
+end
+
+def fun_l20_n599(x)
+    if (x < 1)
+        fun_l21_n224(x)
+    else
+        fun_l21_n390(x)
+    end
+end
+
+def fun_l20_n600(x)
+    if (x < 1)
+        fun_l21_n713(x)
+    else
+        fun_l21_n735(x)
+    end
+end
+
+def fun_l20_n601(x)
+    if (x < 1)
+        fun_l21_n551(x)
+    else
+        fun_l21_n57(x)
+    end
+end
+
+def fun_l20_n602(x)
+    if (x < 1)
+        fun_l21_n808(x)
+    else
+        fun_l21_n928(x)
+    end
+end
+
+def fun_l20_n603(x)
+    if (x < 1)
+        fun_l21_n471(x)
+    else
+        fun_l21_n436(x)
+    end
+end
+
+def fun_l20_n604(x)
+    if (x < 1)
+        fun_l21_n482(x)
+    else
+        fun_l21_n445(x)
+    end
+end
+
+def fun_l20_n605(x)
+    if (x < 1)
+        fun_l21_n680(x)
+    else
+        fun_l21_n433(x)
+    end
+end
+
+def fun_l20_n606(x)
+    if (x < 1)
+        fun_l21_n687(x)
+    else
+        fun_l21_n885(x)
+    end
+end
+
+def fun_l20_n607(x)
+    if (x < 1)
+        fun_l21_n370(x)
+    else
+        fun_l21_n414(x)
+    end
+end
+
+def fun_l20_n608(x)
+    if (x < 1)
+        fun_l21_n11(x)
+    else
+        fun_l21_n792(x)
+    end
+end
+
+def fun_l20_n609(x)
+    if (x < 1)
+        fun_l21_n490(x)
+    else
+        fun_l21_n947(x)
+    end
+end
+
+def fun_l20_n610(x)
+    if (x < 1)
+        fun_l21_n609(x)
+    else
+        fun_l21_n514(x)
+    end
+end
+
+def fun_l20_n611(x)
+    if (x < 1)
+        fun_l21_n873(x)
+    else
+        fun_l21_n247(x)
+    end
+end
+
+def fun_l20_n612(x)
+    if (x < 1)
+        fun_l21_n199(x)
+    else
+        fun_l21_n421(x)
+    end
+end
+
+def fun_l20_n613(x)
+    if (x < 1)
+        fun_l21_n807(x)
+    else
+        fun_l21_n905(x)
+    end
+end
+
+def fun_l20_n614(x)
+    if (x < 1)
+        fun_l21_n260(x)
+    else
+        fun_l21_n926(x)
+    end
+end
+
+def fun_l20_n615(x)
+    if (x < 1)
+        fun_l21_n288(x)
+    else
+        fun_l21_n944(x)
+    end
+end
+
+def fun_l20_n616(x)
+    if (x < 1)
+        fun_l21_n346(x)
+    else
+        fun_l21_n949(x)
+    end
+end
+
+def fun_l20_n617(x)
+    if (x < 1)
+        fun_l21_n243(x)
+    else
+        fun_l21_n527(x)
+    end
+end
+
+def fun_l20_n618(x)
+    if (x < 1)
+        fun_l21_n193(x)
+    else
+        fun_l21_n576(x)
+    end
+end
+
+def fun_l20_n619(x)
+    if (x < 1)
+        fun_l21_n861(x)
+    else
+        fun_l21_n19(x)
+    end
+end
+
+def fun_l20_n620(x)
+    if (x < 1)
+        fun_l21_n735(x)
+    else
+        fun_l21_n477(x)
+    end
+end
+
+def fun_l20_n621(x)
+    if (x < 1)
+        fun_l21_n368(x)
+    else
+        fun_l21_n250(x)
+    end
+end
+
+def fun_l20_n622(x)
+    if (x < 1)
+        fun_l21_n235(x)
+    else
+        fun_l21_n461(x)
+    end
+end
+
+def fun_l20_n623(x)
+    if (x < 1)
+        fun_l21_n289(x)
+    else
+        fun_l21_n217(x)
+    end
+end
+
+def fun_l20_n624(x)
+    if (x < 1)
+        fun_l21_n951(x)
+    else
+        fun_l21_n124(x)
+    end
+end
+
+def fun_l20_n625(x)
+    if (x < 1)
+        fun_l21_n590(x)
+    else
+        fun_l21_n163(x)
+    end
+end
+
+def fun_l20_n626(x)
+    if (x < 1)
+        fun_l21_n122(x)
+    else
+        fun_l21_n34(x)
+    end
+end
+
+def fun_l20_n627(x)
+    if (x < 1)
+        fun_l21_n139(x)
+    else
+        fun_l21_n452(x)
+    end
+end
+
+def fun_l20_n628(x)
+    if (x < 1)
+        fun_l21_n626(x)
+    else
+        fun_l21_n816(x)
+    end
+end
+
+def fun_l20_n629(x)
+    if (x < 1)
+        fun_l21_n713(x)
+    else
+        fun_l21_n291(x)
+    end
+end
+
+def fun_l20_n630(x)
+    if (x < 1)
+        fun_l21_n896(x)
+    else
+        fun_l21_n167(x)
+    end
+end
+
+def fun_l20_n631(x)
+    if (x < 1)
+        fun_l21_n461(x)
+    else
+        fun_l21_n965(x)
+    end
+end
+
+def fun_l20_n632(x)
+    if (x < 1)
+        fun_l21_n984(x)
+    else
+        fun_l21_n336(x)
+    end
+end
+
+def fun_l20_n633(x)
+    if (x < 1)
+        fun_l21_n525(x)
+    else
+        fun_l21_n500(x)
+    end
+end
+
+def fun_l20_n634(x)
+    if (x < 1)
+        fun_l21_n296(x)
+    else
+        fun_l21_n535(x)
+    end
+end
+
+def fun_l20_n635(x)
+    if (x < 1)
+        fun_l21_n961(x)
+    else
+        fun_l21_n296(x)
+    end
+end
+
+def fun_l20_n636(x)
+    if (x < 1)
+        fun_l21_n736(x)
+    else
+        fun_l21_n474(x)
+    end
+end
+
+def fun_l20_n637(x)
+    if (x < 1)
+        fun_l21_n942(x)
+    else
+        fun_l21_n503(x)
+    end
+end
+
+def fun_l20_n638(x)
+    if (x < 1)
+        fun_l21_n906(x)
+    else
+        fun_l21_n612(x)
+    end
+end
+
+def fun_l20_n639(x)
+    if (x < 1)
+        fun_l21_n152(x)
+    else
+        fun_l21_n772(x)
+    end
+end
+
+def fun_l20_n640(x)
+    if (x < 1)
+        fun_l21_n109(x)
+    else
+        fun_l21_n416(x)
+    end
+end
+
+def fun_l20_n641(x)
+    if (x < 1)
+        fun_l21_n189(x)
+    else
+        fun_l21_n353(x)
+    end
+end
+
+def fun_l20_n642(x)
+    if (x < 1)
+        fun_l21_n414(x)
+    else
+        fun_l21_n550(x)
+    end
+end
+
+def fun_l20_n643(x)
+    if (x < 1)
+        fun_l21_n469(x)
+    else
+        fun_l21_n542(x)
+    end
+end
+
+def fun_l20_n644(x)
+    if (x < 1)
+        fun_l21_n465(x)
+    else
+        fun_l21_n742(x)
+    end
+end
+
+def fun_l20_n645(x)
+    if (x < 1)
+        fun_l21_n139(x)
+    else
+        fun_l21_n138(x)
+    end
+end
+
+def fun_l20_n646(x)
+    if (x < 1)
+        fun_l21_n550(x)
+    else
+        fun_l21_n910(x)
+    end
+end
+
+def fun_l20_n647(x)
+    if (x < 1)
+        fun_l21_n939(x)
+    else
+        fun_l21_n347(x)
+    end
+end
+
+def fun_l20_n648(x)
+    if (x < 1)
+        fun_l21_n391(x)
+    else
+        fun_l21_n648(x)
+    end
+end
+
+def fun_l20_n649(x)
+    if (x < 1)
+        fun_l21_n690(x)
+    else
+        fun_l21_n627(x)
+    end
+end
+
+def fun_l20_n650(x)
+    if (x < 1)
+        fun_l21_n596(x)
+    else
+        fun_l21_n681(x)
+    end
+end
+
+def fun_l20_n651(x)
+    if (x < 1)
+        fun_l21_n686(x)
+    else
+        fun_l21_n399(x)
+    end
+end
+
+def fun_l20_n652(x)
+    if (x < 1)
+        fun_l21_n461(x)
+    else
+        fun_l21_n851(x)
+    end
+end
+
+def fun_l20_n653(x)
+    if (x < 1)
+        fun_l21_n562(x)
+    else
+        fun_l21_n60(x)
+    end
+end
+
+def fun_l20_n654(x)
+    if (x < 1)
+        fun_l21_n269(x)
+    else
+        fun_l21_n937(x)
+    end
+end
+
+def fun_l20_n655(x)
+    if (x < 1)
+        fun_l21_n994(x)
+    else
+        fun_l21_n386(x)
+    end
+end
+
+def fun_l20_n656(x)
+    if (x < 1)
+        fun_l21_n568(x)
+    else
+        fun_l21_n180(x)
+    end
+end
+
+def fun_l20_n657(x)
+    if (x < 1)
+        fun_l21_n334(x)
+    else
+        fun_l21_n362(x)
+    end
+end
+
+def fun_l20_n658(x)
+    if (x < 1)
+        fun_l21_n14(x)
+    else
+        fun_l21_n311(x)
+    end
+end
+
+def fun_l20_n659(x)
+    if (x < 1)
+        fun_l21_n715(x)
+    else
+        fun_l21_n945(x)
+    end
+end
+
+def fun_l20_n660(x)
+    if (x < 1)
+        fun_l21_n739(x)
+    else
+        fun_l21_n456(x)
+    end
+end
+
+def fun_l20_n661(x)
+    if (x < 1)
+        fun_l21_n298(x)
+    else
+        fun_l21_n344(x)
+    end
+end
+
+def fun_l20_n662(x)
+    if (x < 1)
+        fun_l21_n134(x)
+    else
+        fun_l21_n828(x)
+    end
+end
+
+def fun_l20_n663(x)
+    if (x < 1)
+        fun_l21_n831(x)
+    else
+        fun_l21_n231(x)
+    end
+end
+
+def fun_l20_n664(x)
+    if (x < 1)
+        fun_l21_n330(x)
+    else
+        fun_l21_n733(x)
+    end
+end
+
+def fun_l20_n665(x)
+    if (x < 1)
+        fun_l21_n22(x)
+    else
+        fun_l21_n973(x)
+    end
+end
+
+def fun_l20_n666(x)
+    if (x < 1)
+        fun_l21_n277(x)
+    else
+        fun_l21_n988(x)
+    end
+end
+
+def fun_l20_n667(x)
+    if (x < 1)
+        fun_l21_n252(x)
+    else
+        fun_l21_n8(x)
+    end
+end
+
+def fun_l20_n668(x)
+    if (x < 1)
+        fun_l21_n991(x)
+    else
+        fun_l21_n801(x)
+    end
+end
+
+def fun_l20_n669(x)
+    if (x < 1)
+        fun_l21_n811(x)
+    else
+        fun_l21_n660(x)
+    end
+end
+
+def fun_l20_n670(x)
+    if (x < 1)
+        fun_l21_n384(x)
+    else
+        fun_l21_n596(x)
+    end
+end
+
+def fun_l20_n671(x)
+    if (x < 1)
+        fun_l21_n509(x)
+    else
+        fun_l21_n133(x)
+    end
+end
+
+def fun_l20_n672(x)
+    if (x < 1)
+        fun_l21_n650(x)
+    else
+        fun_l21_n679(x)
+    end
+end
+
+def fun_l20_n673(x)
+    if (x < 1)
+        fun_l21_n323(x)
+    else
+        fun_l21_n824(x)
+    end
+end
+
+def fun_l20_n674(x)
+    if (x < 1)
+        fun_l21_n728(x)
+    else
+        fun_l21_n697(x)
+    end
+end
+
+def fun_l20_n675(x)
+    if (x < 1)
+        fun_l21_n367(x)
+    else
+        fun_l21_n383(x)
+    end
+end
+
+def fun_l20_n676(x)
+    if (x < 1)
+        fun_l21_n280(x)
+    else
+        fun_l21_n309(x)
+    end
+end
+
+def fun_l20_n677(x)
+    if (x < 1)
+        fun_l21_n17(x)
+    else
+        fun_l21_n687(x)
+    end
+end
+
+def fun_l20_n678(x)
+    if (x < 1)
+        fun_l21_n133(x)
+    else
+        fun_l21_n250(x)
+    end
+end
+
+def fun_l20_n679(x)
+    if (x < 1)
+        fun_l21_n713(x)
+    else
+        fun_l21_n630(x)
+    end
+end
+
+def fun_l20_n680(x)
+    if (x < 1)
+        fun_l21_n348(x)
+    else
+        fun_l21_n737(x)
+    end
+end
+
+def fun_l20_n681(x)
+    if (x < 1)
+        fun_l21_n450(x)
+    else
+        fun_l21_n283(x)
+    end
+end
+
+def fun_l20_n682(x)
+    if (x < 1)
+        fun_l21_n568(x)
+    else
+        fun_l21_n22(x)
+    end
+end
+
+def fun_l20_n683(x)
+    if (x < 1)
+        fun_l21_n173(x)
+    else
+        fun_l21_n457(x)
+    end
+end
+
+def fun_l20_n684(x)
+    if (x < 1)
+        fun_l21_n846(x)
+    else
+        fun_l21_n415(x)
+    end
+end
+
+def fun_l20_n685(x)
+    if (x < 1)
+        fun_l21_n757(x)
+    else
+        fun_l21_n817(x)
+    end
+end
+
+def fun_l20_n686(x)
+    if (x < 1)
+        fun_l21_n282(x)
+    else
+        fun_l21_n503(x)
+    end
+end
+
+def fun_l20_n687(x)
+    if (x < 1)
+        fun_l21_n337(x)
+    else
+        fun_l21_n407(x)
+    end
+end
+
+def fun_l20_n688(x)
+    if (x < 1)
+        fun_l21_n783(x)
+    else
+        fun_l21_n307(x)
+    end
+end
+
+def fun_l20_n689(x)
+    if (x < 1)
+        fun_l21_n397(x)
+    else
+        fun_l21_n10(x)
+    end
+end
+
+def fun_l20_n690(x)
+    if (x < 1)
+        fun_l21_n100(x)
+    else
+        fun_l21_n704(x)
+    end
+end
+
+def fun_l20_n691(x)
+    if (x < 1)
+        fun_l21_n380(x)
+    else
+        fun_l21_n780(x)
+    end
+end
+
+def fun_l20_n692(x)
+    if (x < 1)
+        fun_l21_n782(x)
+    else
+        fun_l21_n955(x)
+    end
+end
+
+def fun_l20_n693(x)
+    if (x < 1)
+        fun_l21_n40(x)
+    else
+        fun_l21_n599(x)
+    end
+end
+
+def fun_l20_n694(x)
+    if (x < 1)
+        fun_l21_n730(x)
+    else
+        fun_l21_n215(x)
+    end
+end
+
+def fun_l20_n695(x)
+    if (x < 1)
+        fun_l21_n168(x)
+    else
+        fun_l21_n757(x)
+    end
+end
+
+def fun_l20_n696(x)
+    if (x < 1)
+        fun_l21_n622(x)
+    else
+        fun_l21_n411(x)
+    end
+end
+
+def fun_l20_n697(x)
+    if (x < 1)
+        fun_l21_n958(x)
+    else
+        fun_l21_n832(x)
+    end
+end
+
+def fun_l20_n698(x)
+    if (x < 1)
+        fun_l21_n452(x)
+    else
+        fun_l21_n390(x)
+    end
+end
+
+def fun_l20_n699(x)
+    if (x < 1)
+        fun_l21_n669(x)
+    else
+        fun_l21_n642(x)
+    end
+end
+
+def fun_l20_n700(x)
+    if (x < 1)
+        fun_l21_n481(x)
+    else
+        fun_l21_n273(x)
+    end
+end
+
+def fun_l20_n701(x)
+    if (x < 1)
+        fun_l21_n305(x)
+    else
+        fun_l21_n783(x)
+    end
+end
+
+def fun_l20_n702(x)
+    if (x < 1)
+        fun_l21_n766(x)
+    else
+        fun_l21_n943(x)
+    end
+end
+
+def fun_l20_n703(x)
+    if (x < 1)
+        fun_l21_n440(x)
+    else
+        fun_l21_n875(x)
+    end
+end
+
+def fun_l20_n704(x)
+    if (x < 1)
+        fun_l21_n332(x)
+    else
+        fun_l21_n839(x)
+    end
+end
+
+def fun_l20_n705(x)
+    if (x < 1)
+        fun_l21_n459(x)
+    else
+        fun_l21_n341(x)
+    end
+end
+
+def fun_l20_n706(x)
+    if (x < 1)
+        fun_l21_n897(x)
+    else
+        fun_l21_n235(x)
+    end
+end
+
+def fun_l20_n707(x)
+    if (x < 1)
+        fun_l21_n400(x)
+    else
+        fun_l21_n349(x)
+    end
+end
+
+def fun_l20_n708(x)
+    if (x < 1)
+        fun_l21_n121(x)
+    else
+        fun_l21_n40(x)
+    end
+end
+
+def fun_l20_n709(x)
+    if (x < 1)
+        fun_l21_n496(x)
+    else
+        fun_l21_n473(x)
+    end
+end
+
+def fun_l20_n710(x)
+    if (x < 1)
+        fun_l21_n146(x)
+    else
+        fun_l21_n944(x)
+    end
+end
+
+def fun_l20_n711(x)
+    if (x < 1)
+        fun_l21_n497(x)
+    else
+        fun_l21_n322(x)
+    end
+end
+
+def fun_l20_n712(x)
+    if (x < 1)
+        fun_l21_n647(x)
+    else
+        fun_l21_n76(x)
+    end
+end
+
+def fun_l20_n713(x)
+    if (x < 1)
+        fun_l21_n402(x)
+    else
+        fun_l21_n904(x)
+    end
+end
+
+def fun_l20_n714(x)
+    if (x < 1)
+        fun_l21_n834(x)
+    else
+        fun_l21_n904(x)
+    end
+end
+
+def fun_l20_n715(x)
+    if (x < 1)
+        fun_l21_n482(x)
+    else
+        fun_l21_n399(x)
+    end
+end
+
+def fun_l20_n716(x)
+    if (x < 1)
+        fun_l21_n441(x)
+    else
+        fun_l21_n348(x)
+    end
+end
+
+def fun_l20_n717(x)
+    if (x < 1)
+        fun_l21_n577(x)
+    else
+        fun_l21_n815(x)
+    end
+end
+
+def fun_l20_n718(x)
+    if (x < 1)
+        fun_l21_n18(x)
+    else
+        fun_l21_n399(x)
+    end
+end
+
+def fun_l20_n719(x)
+    if (x < 1)
+        fun_l21_n245(x)
+    else
+        fun_l21_n928(x)
+    end
+end
+
+def fun_l20_n720(x)
+    if (x < 1)
+        fun_l21_n373(x)
+    else
+        fun_l21_n432(x)
+    end
+end
+
+def fun_l20_n721(x)
+    if (x < 1)
+        fun_l21_n20(x)
+    else
+        fun_l21_n485(x)
+    end
+end
+
+def fun_l20_n722(x)
+    if (x < 1)
+        fun_l21_n79(x)
+    else
+        fun_l21_n525(x)
+    end
+end
+
+def fun_l20_n723(x)
+    if (x < 1)
+        fun_l21_n474(x)
+    else
+        fun_l21_n706(x)
+    end
+end
+
+def fun_l20_n724(x)
+    if (x < 1)
+        fun_l21_n27(x)
+    else
+        fun_l21_n833(x)
+    end
+end
+
+def fun_l20_n725(x)
+    if (x < 1)
+        fun_l21_n386(x)
+    else
+        fun_l21_n422(x)
+    end
+end
+
+def fun_l20_n726(x)
+    if (x < 1)
+        fun_l21_n816(x)
+    else
+        fun_l21_n204(x)
+    end
+end
+
+def fun_l20_n727(x)
+    if (x < 1)
+        fun_l21_n502(x)
+    else
+        fun_l21_n554(x)
+    end
+end
+
+def fun_l20_n728(x)
+    if (x < 1)
+        fun_l21_n846(x)
+    else
+        fun_l21_n948(x)
+    end
+end
+
+def fun_l20_n729(x)
+    if (x < 1)
+        fun_l21_n308(x)
+    else
+        fun_l21_n408(x)
+    end
+end
+
+def fun_l20_n730(x)
+    if (x < 1)
+        fun_l21_n882(x)
+    else
+        fun_l21_n151(x)
+    end
+end
+
+def fun_l20_n731(x)
+    if (x < 1)
+        fun_l21_n22(x)
+    else
+        fun_l21_n839(x)
+    end
+end
+
+def fun_l20_n732(x)
+    if (x < 1)
+        fun_l21_n482(x)
+    else
+        fun_l21_n942(x)
+    end
+end
+
+def fun_l20_n733(x)
+    if (x < 1)
+        fun_l21_n959(x)
+    else
+        fun_l21_n615(x)
+    end
+end
+
+def fun_l20_n734(x)
+    if (x < 1)
+        fun_l21_n137(x)
+    else
+        fun_l21_n455(x)
+    end
+end
+
+def fun_l20_n735(x)
+    if (x < 1)
+        fun_l21_n388(x)
+    else
+        fun_l21_n362(x)
+    end
+end
+
+def fun_l20_n736(x)
+    if (x < 1)
+        fun_l21_n107(x)
+    else
+        fun_l21_n883(x)
+    end
+end
+
+def fun_l20_n737(x)
+    if (x < 1)
+        fun_l21_n42(x)
+    else
+        fun_l21_n288(x)
+    end
+end
+
+def fun_l20_n738(x)
+    if (x < 1)
+        fun_l21_n885(x)
+    else
+        fun_l21_n443(x)
+    end
+end
+
+def fun_l20_n739(x)
+    if (x < 1)
+        fun_l21_n414(x)
+    else
+        fun_l21_n976(x)
+    end
+end
+
+def fun_l20_n740(x)
+    if (x < 1)
+        fun_l21_n244(x)
+    else
+        fun_l21_n327(x)
+    end
+end
+
+def fun_l20_n741(x)
+    if (x < 1)
+        fun_l21_n832(x)
+    else
+        fun_l21_n951(x)
+    end
+end
+
+def fun_l20_n742(x)
+    if (x < 1)
+        fun_l21_n408(x)
+    else
+        fun_l21_n978(x)
+    end
+end
+
+def fun_l20_n743(x)
+    if (x < 1)
+        fun_l21_n517(x)
+    else
+        fun_l21_n468(x)
+    end
+end
+
+def fun_l20_n744(x)
+    if (x < 1)
+        fun_l21_n281(x)
+    else
+        fun_l21_n9(x)
+    end
+end
+
+def fun_l20_n745(x)
+    if (x < 1)
+        fun_l21_n488(x)
+    else
+        fun_l21_n526(x)
+    end
+end
+
+def fun_l20_n746(x)
+    if (x < 1)
+        fun_l21_n494(x)
+    else
+        fun_l21_n769(x)
+    end
+end
+
+def fun_l20_n747(x)
+    if (x < 1)
+        fun_l21_n277(x)
+    else
+        fun_l21_n103(x)
+    end
+end
+
+def fun_l20_n748(x)
+    if (x < 1)
+        fun_l21_n663(x)
+    else
+        fun_l21_n281(x)
+    end
+end
+
+def fun_l20_n749(x)
+    if (x < 1)
+        fun_l21_n260(x)
+    else
+        fun_l21_n320(x)
+    end
+end
+
+def fun_l20_n750(x)
+    if (x < 1)
+        fun_l21_n781(x)
+    else
+        fun_l21_n705(x)
+    end
+end
+
+def fun_l20_n751(x)
+    if (x < 1)
+        fun_l21_n317(x)
+    else
+        fun_l21_n728(x)
+    end
+end
+
+def fun_l20_n752(x)
+    if (x < 1)
+        fun_l21_n573(x)
+    else
+        fun_l21_n172(x)
+    end
+end
+
+def fun_l20_n753(x)
+    if (x < 1)
+        fun_l21_n352(x)
+    else
+        fun_l21_n933(x)
+    end
+end
+
+def fun_l20_n754(x)
+    if (x < 1)
+        fun_l21_n876(x)
+    else
+        fun_l21_n180(x)
+    end
+end
+
+def fun_l20_n755(x)
+    if (x < 1)
+        fun_l21_n937(x)
+    else
+        fun_l21_n387(x)
+    end
+end
+
+def fun_l20_n756(x)
+    if (x < 1)
+        fun_l21_n154(x)
+    else
+        fun_l21_n187(x)
+    end
+end
+
+def fun_l20_n757(x)
+    if (x < 1)
+        fun_l21_n766(x)
+    else
+        fun_l21_n259(x)
+    end
+end
+
+def fun_l20_n758(x)
+    if (x < 1)
+        fun_l21_n235(x)
+    else
+        fun_l21_n636(x)
+    end
+end
+
+def fun_l20_n759(x)
+    if (x < 1)
+        fun_l21_n872(x)
+    else
+        fun_l21_n913(x)
+    end
+end
+
+def fun_l20_n760(x)
+    if (x < 1)
+        fun_l21_n73(x)
+    else
+        fun_l21_n743(x)
+    end
+end
+
+def fun_l20_n761(x)
+    if (x < 1)
+        fun_l21_n666(x)
+    else
+        fun_l21_n777(x)
+    end
+end
+
+def fun_l20_n762(x)
+    if (x < 1)
+        fun_l21_n829(x)
+    else
+        fun_l21_n800(x)
+    end
+end
+
+def fun_l20_n763(x)
+    if (x < 1)
+        fun_l21_n37(x)
+    else
+        fun_l21_n152(x)
+    end
+end
+
+def fun_l20_n764(x)
+    if (x < 1)
+        fun_l21_n53(x)
+    else
+        fun_l21_n196(x)
+    end
+end
+
+def fun_l20_n765(x)
+    if (x < 1)
+        fun_l21_n511(x)
+    else
+        fun_l21_n415(x)
+    end
+end
+
+def fun_l20_n766(x)
+    if (x < 1)
+        fun_l21_n375(x)
+    else
+        fun_l21_n885(x)
+    end
+end
+
+def fun_l20_n767(x)
+    if (x < 1)
+        fun_l21_n267(x)
+    else
+        fun_l21_n597(x)
+    end
+end
+
+def fun_l20_n768(x)
+    if (x < 1)
+        fun_l21_n920(x)
+    else
+        fun_l21_n943(x)
+    end
+end
+
+def fun_l20_n769(x)
+    if (x < 1)
+        fun_l21_n585(x)
+    else
+        fun_l21_n659(x)
+    end
+end
+
+def fun_l20_n770(x)
+    if (x < 1)
+        fun_l21_n897(x)
+    else
+        fun_l21_n742(x)
+    end
+end
+
+def fun_l20_n771(x)
+    if (x < 1)
+        fun_l21_n41(x)
+    else
+        fun_l21_n431(x)
+    end
+end
+
+def fun_l20_n772(x)
+    if (x < 1)
+        fun_l21_n446(x)
+    else
+        fun_l21_n22(x)
+    end
+end
+
+def fun_l20_n773(x)
+    if (x < 1)
+        fun_l21_n918(x)
+    else
+        fun_l21_n387(x)
+    end
+end
+
+def fun_l20_n774(x)
+    if (x < 1)
+        fun_l21_n88(x)
+    else
+        fun_l21_n763(x)
+    end
+end
+
+def fun_l20_n775(x)
+    if (x < 1)
+        fun_l21_n224(x)
+    else
+        fun_l21_n886(x)
+    end
+end
+
+def fun_l20_n776(x)
+    if (x < 1)
+        fun_l21_n860(x)
+    else
+        fun_l21_n145(x)
+    end
+end
+
+def fun_l20_n777(x)
+    if (x < 1)
+        fun_l21_n198(x)
+    else
+        fun_l21_n593(x)
+    end
+end
+
+def fun_l20_n778(x)
+    if (x < 1)
+        fun_l21_n510(x)
+    else
+        fun_l21_n146(x)
+    end
+end
+
+def fun_l20_n779(x)
+    if (x < 1)
+        fun_l21_n125(x)
+    else
+        fun_l21_n390(x)
+    end
+end
+
+def fun_l20_n780(x)
+    if (x < 1)
+        fun_l21_n278(x)
+    else
+        fun_l21_n100(x)
+    end
+end
+
+def fun_l20_n781(x)
+    if (x < 1)
+        fun_l21_n9(x)
+    else
+        fun_l21_n312(x)
+    end
+end
+
+def fun_l20_n782(x)
+    if (x < 1)
+        fun_l21_n883(x)
+    else
+        fun_l21_n118(x)
+    end
+end
+
+def fun_l20_n783(x)
+    if (x < 1)
+        fun_l21_n314(x)
+    else
+        fun_l21_n357(x)
+    end
+end
+
+def fun_l20_n784(x)
+    if (x < 1)
+        fun_l21_n599(x)
+    else
+        fun_l21_n211(x)
+    end
+end
+
+def fun_l20_n785(x)
+    if (x < 1)
+        fun_l21_n882(x)
+    else
+        fun_l21_n903(x)
+    end
+end
+
+def fun_l20_n786(x)
+    if (x < 1)
+        fun_l21_n741(x)
+    else
+        fun_l21_n634(x)
+    end
+end
+
+def fun_l20_n787(x)
+    if (x < 1)
+        fun_l21_n186(x)
+    else
+        fun_l21_n68(x)
+    end
+end
+
+def fun_l20_n788(x)
+    if (x < 1)
+        fun_l21_n620(x)
+    else
+        fun_l21_n976(x)
+    end
+end
+
+def fun_l20_n789(x)
+    if (x < 1)
+        fun_l21_n692(x)
+    else
+        fun_l21_n8(x)
+    end
+end
+
+def fun_l20_n790(x)
+    if (x < 1)
+        fun_l21_n893(x)
+    else
+        fun_l21_n916(x)
+    end
+end
+
+def fun_l20_n791(x)
+    if (x < 1)
+        fun_l21_n823(x)
+    else
+        fun_l21_n498(x)
+    end
+end
+
+def fun_l20_n792(x)
+    if (x < 1)
+        fun_l21_n390(x)
+    else
+        fun_l21_n711(x)
+    end
+end
+
+def fun_l20_n793(x)
+    if (x < 1)
+        fun_l21_n918(x)
+    else
+        fun_l21_n819(x)
+    end
+end
+
+def fun_l20_n794(x)
+    if (x < 1)
+        fun_l21_n809(x)
+    else
+        fun_l21_n320(x)
+    end
+end
+
+def fun_l20_n795(x)
+    if (x < 1)
+        fun_l21_n387(x)
+    else
+        fun_l21_n377(x)
+    end
+end
+
+def fun_l20_n796(x)
+    if (x < 1)
+        fun_l21_n243(x)
+    else
+        fun_l21_n555(x)
+    end
+end
+
+def fun_l20_n797(x)
+    if (x < 1)
+        fun_l21_n946(x)
+    else
+        fun_l21_n811(x)
+    end
+end
+
+def fun_l20_n798(x)
+    if (x < 1)
+        fun_l21_n492(x)
+    else
+        fun_l21_n367(x)
+    end
+end
+
+def fun_l20_n799(x)
+    if (x < 1)
+        fun_l21_n161(x)
+    else
+        fun_l21_n818(x)
+    end
+end
+
+def fun_l20_n800(x)
+    if (x < 1)
+        fun_l21_n365(x)
+    else
+        fun_l21_n560(x)
+    end
+end
+
+def fun_l20_n801(x)
+    if (x < 1)
+        fun_l21_n456(x)
+    else
+        fun_l21_n880(x)
+    end
+end
+
+def fun_l20_n802(x)
+    if (x < 1)
+        fun_l21_n683(x)
+    else
+        fun_l21_n71(x)
+    end
+end
+
+def fun_l20_n803(x)
+    if (x < 1)
+        fun_l21_n250(x)
+    else
+        fun_l21_n183(x)
+    end
+end
+
+def fun_l20_n804(x)
+    if (x < 1)
+        fun_l21_n900(x)
+    else
+        fun_l21_n63(x)
+    end
+end
+
+def fun_l20_n805(x)
+    if (x < 1)
+        fun_l21_n798(x)
+    else
+        fun_l21_n91(x)
+    end
+end
+
+def fun_l20_n806(x)
+    if (x < 1)
+        fun_l21_n525(x)
+    else
+        fun_l21_n59(x)
+    end
+end
+
+def fun_l20_n807(x)
+    if (x < 1)
+        fun_l21_n515(x)
+    else
+        fun_l21_n457(x)
+    end
+end
+
+def fun_l20_n808(x)
+    if (x < 1)
+        fun_l21_n410(x)
+    else
+        fun_l21_n172(x)
+    end
+end
+
+def fun_l20_n809(x)
+    if (x < 1)
+        fun_l21_n194(x)
+    else
+        fun_l21_n425(x)
+    end
+end
+
+def fun_l20_n810(x)
+    if (x < 1)
+        fun_l21_n660(x)
+    else
+        fun_l21_n120(x)
+    end
+end
+
+def fun_l20_n811(x)
+    if (x < 1)
+        fun_l21_n920(x)
+    else
+        fun_l21_n97(x)
+    end
+end
+
+def fun_l20_n812(x)
+    if (x < 1)
+        fun_l21_n443(x)
+    else
+        fun_l21_n876(x)
+    end
+end
+
+def fun_l20_n813(x)
+    if (x < 1)
+        fun_l21_n935(x)
+    else
+        fun_l21_n186(x)
+    end
+end
+
+def fun_l20_n814(x)
+    if (x < 1)
+        fun_l21_n139(x)
+    else
+        fun_l21_n313(x)
+    end
+end
+
+def fun_l20_n815(x)
+    if (x < 1)
+        fun_l21_n21(x)
+    else
+        fun_l21_n500(x)
+    end
+end
+
+def fun_l20_n816(x)
+    if (x < 1)
+        fun_l21_n682(x)
+    else
+        fun_l21_n17(x)
+    end
+end
+
+def fun_l20_n817(x)
+    if (x < 1)
+        fun_l21_n945(x)
+    else
+        fun_l21_n472(x)
+    end
+end
+
+def fun_l20_n818(x)
+    if (x < 1)
+        fun_l21_n76(x)
+    else
+        fun_l21_n464(x)
+    end
+end
+
+def fun_l20_n819(x)
+    if (x < 1)
+        fun_l21_n696(x)
+    else
+        fun_l21_n989(x)
+    end
+end
+
+def fun_l20_n820(x)
+    if (x < 1)
+        fun_l21_n150(x)
+    else
+        fun_l21_n459(x)
+    end
+end
+
+def fun_l20_n821(x)
+    if (x < 1)
+        fun_l21_n280(x)
+    else
+        fun_l21_n535(x)
+    end
+end
+
+def fun_l20_n822(x)
+    if (x < 1)
+        fun_l21_n120(x)
+    else
+        fun_l21_n553(x)
+    end
+end
+
+def fun_l20_n823(x)
+    if (x < 1)
+        fun_l21_n450(x)
+    else
+        fun_l21_n168(x)
+    end
+end
+
+def fun_l20_n824(x)
+    if (x < 1)
+        fun_l21_n635(x)
+    else
+        fun_l21_n45(x)
+    end
+end
+
+def fun_l20_n825(x)
+    if (x < 1)
+        fun_l21_n245(x)
+    else
+        fun_l21_n491(x)
+    end
+end
+
+def fun_l20_n826(x)
+    if (x < 1)
+        fun_l21_n202(x)
+    else
+        fun_l21_n307(x)
+    end
+end
+
+def fun_l20_n827(x)
+    if (x < 1)
+        fun_l21_n883(x)
+    else
+        fun_l21_n113(x)
+    end
+end
+
+def fun_l20_n828(x)
+    if (x < 1)
+        fun_l21_n864(x)
+    else
+        fun_l21_n982(x)
+    end
+end
+
+def fun_l20_n829(x)
+    if (x < 1)
+        fun_l21_n707(x)
+    else
+        fun_l21_n909(x)
+    end
+end
+
+def fun_l20_n830(x)
+    if (x < 1)
+        fun_l21_n838(x)
+    else
+        fun_l21_n784(x)
+    end
+end
+
+def fun_l20_n831(x)
+    if (x < 1)
+        fun_l21_n179(x)
+    else
+        fun_l21_n445(x)
+    end
+end
+
+def fun_l20_n832(x)
+    if (x < 1)
+        fun_l21_n563(x)
+    else
+        fun_l21_n981(x)
+    end
+end
+
+def fun_l20_n833(x)
+    if (x < 1)
+        fun_l21_n441(x)
+    else
+        fun_l21_n911(x)
+    end
+end
+
+def fun_l20_n834(x)
+    if (x < 1)
+        fun_l21_n46(x)
+    else
+        fun_l21_n244(x)
+    end
+end
+
+def fun_l20_n835(x)
+    if (x < 1)
+        fun_l21_n740(x)
+    else
+        fun_l21_n877(x)
+    end
+end
+
+def fun_l20_n836(x)
+    if (x < 1)
+        fun_l21_n987(x)
+    else
+        fun_l21_n459(x)
+    end
+end
+
+def fun_l20_n837(x)
+    if (x < 1)
+        fun_l21_n51(x)
+    else
+        fun_l21_n533(x)
+    end
+end
+
+def fun_l20_n838(x)
+    if (x < 1)
+        fun_l21_n530(x)
+    else
+        fun_l21_n916(x)
+    end
+end
+
+def fun_l20_n839(x)
+    if (x < 1)
+        fun_l21_n644(x)
+    else
+        fun_l21_n574(x)
+    end
+end
+
+def fun_l20_n840(x)
+    if (x < 1)
+        fun_l21_n167(x)
+    else
+        fun_l21_n935(x)
+    end
+end
+
+def fun_l20_n841(x)
+    if (x < 1)
+        fun_l21_n657(x)
+    else
+        fun_l21_n914(x)
+    end
+end
+
+def fun_l20_n842(x)
+    if (x < 1)
+        fun_l21_n646(x)
+    else
+        fun_l21_n191(x)
+    end
+end
+
+def fun_l20_n843(x)
+    if (x < 1)
+        fun_l21_n881(x)
+    else
+        fun_l21_n744(x)
+    end
+end
+
+def fun_l20_n844(x)
+    if (x < 1)
+        fun_l21_n293(x)
+    else
+        fun_l21_n474(x)
+    end
+end
+
+def fun_l20_n845(x)
+    if (x < 1)
+        fun_l21_n481(x)
+    else
+        fun_l21_n80(x)
+    end
+end
+
+def fun_l20_n846(x)
+    if (x < 1)
+        fun_l21_n785(x)
+    else
+        fun_l21_n694(x)
+    end
+end
+
+def fun_l20_n847(x)
+    if (x < 1)
+        fun_l21_n874(x)
+    else
+        fun_l21_n465(x)
+    end
+end
+
+def fun_l20_n848(x)
+    if (x < 1)
+        fun_l21_n43(x)
+    else
+        fun_l21_n666(x)
+    end
+end
+
+def fun_l20_n849(x)
+    if (x < 1)
+        fun_l21_n868(x)
+    else
+        fun_l21_n272(x)
+    end
+end
+
+def fun_l20_n850(x)
+    if (x < 1)
+        fun_l21_n194(x)
+    else
+        fun_l21_n995(x)
+    end
+end
+
+def fun_l20_n851(x)
+    if (x < 1)
+        fun_l21_n989(x)
+    else
+        fun_l21_n385(x)
+    end
+end
+
+def fun_l20_n852(x)
+    if (x < 1)
+        fun_l21_n396(x)
+    else
+        fun_l21_n366(x)
+    end
+end
+
+def fun_l20_n853(x)
+    if (x < 1)
+        fun_l21_n439(x)
+    else
+        fun_l21_n141(x)
+    end
+end
+
+def fun_l20_n854(x)
+    if (x < 1)
+        fun_l21_n78(x)
+    else
+        fun_l21_n180(x)
+    end
+end
+
+def fun_l20_n855(x)
+    if (x < 1)
+        fun_l21_n203(x)
+    else
+        fun_l21_n382(x)
+    end
+end
+
+def fun_l20_n856(x)
+    if (x < 1)
+        fun_l21_n387(x)
+    else
+        fun_l21_n696(x)
+    end
+end
+
+def fun_l20_n857(x)
+    if (x < 1)
+        fun_l21_n383(x)
+    else
+        fun_l21_n655(x)
+    end
+end
+
+def fun_l20_n858(x)
+    if (x < 1)
+        fun_l21_n375(x)
+    else
+        fun_l21_n14(x)
+    end
+end
+
+def fun_l20_n859(x)
+    if (x < 1)
+        fun_l21_n418(x)
+    else
+        fun_l21_n435(x)
+    end
+end
+
+def fun_l20_n860(x)
+    if (x < 1)
+        fun_l21_n75(x)
+    else
+        fun_l21_n258(x)
+    end
+end
+
+def fun_l20_n861(x)
+    if (x < 1)
+        fun_l21_n509(x)
+    else
+        fun_l21_n585(x)
+    end
+end
+
+def fun_l20_n862(x)
+    if (x < 1)
+        fun_l21_n388(x)
+    else
+        fun_l21_n962(x)
+    end
+end
+
+def fun_l20_n863(x)
+    if (x < 1)
+        fun_l21_n826(x)
+    else
+        fun_l21_n691(x)
+    end
+end
+
+def fun_l20_n864(x)
+    if (x < 1)
+        fun_l21_n230(x)
+    else
+        fun_l21_n588(x)
+    end
+end
+
+def fun_l20_n865(x)
+    if (x < 1)
+        fun_l21_n138(x)
+    else
+        fun_l21_n779(x)
+    end
+end
+
+def fun_l20_n866(x)
+    if (x < 1)
+        fun_l21_n994(x)
+    else
+        fun_l21_n325(x)
+    end
+end
+
+def fun_l20_n867(x)
+    if (x < 1)
+        fun_l21_n169(x)
+    else
+        fun_l21_n384(x)
+    end
+end
+
+def fun_l20_n868(x)
+    if (x < 1)
+        fun_l21_n30(x)
+    else
+        fun_l21_n922(x)
+    end
+end
+
+def fun_l20_n869(x)
+    if (x < 1)
+        fun_l21_n500(x)
+    else
+        fun_l21_n896(x)
+    end
+end
+
+def fun_l20_n870(x)
+    if (x < 1)
+        fun_l21_n25(x)
+    else
+        fun_l21_n292(x)
+    end
+end
+
+def fun_l20_n871(x)
+    if (x < 1)
+        fun_l21_n266(x)
+    else
+        fun_l21_n58(x)
+    end
+end
+
+def fun_l20_n872(x)
+    if (x < 1)
+        fun_l21_n172(x)
+    else
+        fun_l21_n721(x)
+    end
+end
+
+def fun_l20_n873(x)
+    if (x < 1)
+        fun_l21_n87(x)
+    else
+        fun_l21_n717(x)
+    end
+end
+
+def fun_l20_n874(x)
+    if (x < 1)
+        fun_l21_n235(x)
+    else
+        fun_l21_n891(x)
+    end
+end
+
+def fun_l20_n875(x)
+    if (x < 1)
+        fun_l21_n87(x)
+    else
+        fun_l21_n810(x)
+    end
+end
+
+def fun_l20_n876(x)
+    if (x < 1)
+        fun_l21_n785(x)
+    else
+        fun_l21_n668(x)
+    end
+end
+
+def fun_l20_n877(x)
+    if (x < 1)
+        fun_l21_n532(x)
+    else
+        fun_l21_n505(x)
+    end
+end
+
+def fun_l20_n878(x)
+    if (x < 1)
+        fun_l21_n885(x)
+    else
+        fun_l21_n820(x)
+    end
+end
+
+def fun_l20_n879(x)
+    if (x < 1)
+        fun_l21_n986(x)
+    else
+        fun_l21_n916(x)
+    end
+end
+
+def fun_l20_n880(x)
+    if (x < 1)
+        fun_l21_n46(x)
+    else
+        fun_l21_n751(x)
+    end
+end
+
+def fun_l20_n881(x)
+    if (x < 1)
+        fun_l21_n964(x)
+    else
+        fun_l21_n829(x)
+    end
+end
+
+def fun_l20_n882(x)
+    if (x < 1)
+        fun_l21_n938(x)
+    else
+        fun_l21_n862(x)
+    end
+end
+
+def fun_l20_n883(x)
+    if (x < 1)
+        fun_l21_n880(x)
+    else
+        fun_l21_n548(x)
+    end
+end
+
+def fun_l20_n884(x)
+    if (x < 1)
+        fun_l21_n621(x)
+    else
+        fun_l21_n184(x)
+    end
+end
+
+def fun_l20_n885(x)
+    if (x < 1)
+        fun_l21_n587(x)
+    else
+        fun_l21_n603(x)
+    end
+end
+
+def fun_l20_n886(x)
+    if (x < 1)
+        fun_l21_n935(x)
+    else
+        fun_l21_n105(x)
+    end
+end
+
+def fun_l20_n887(x)
+    if (x < 1)
+        fun_l21_n76(x)
+    else
+        fun_l21_n96(x)
+    end
+end
+
+def fun_l20_n888(x)
+    if (x < 1)
+        fun_l21_n241(x)
+    else
+        fun_l21_n56(x)
+    end
+end
+
+def fun_l20_n889(x)
+    if (x < 1)
+        fun_l21_n180(x)
+    else
+        fun_l21_n360(x)
+    end
+end
+
+def fun_l20_n890(x)
+    if (x < 1)
+        fun_l21_n179(x)
+    else
+        fun_l21_n510(x)
+    end
+end
+
+def fun_l20_n891(x)
+    if (x < 1)
+        fun_l21_n641(x)
+    else
+        fun_l21_n70(x)
+    end
+end
+
+def fun_l20_n892(x)
+    if (x < 1)
+        fun_l21_n615(x)
+    else
+        fun_l21_n30(x)
+    end
+end
+
+def fun_l20_n893(x)
+    if (x < 1)
+        fun_l21_n787(x)
+    else
+        fun_l21_n914(x)
+    end
+end
+
+def fun_l20_n894(x)
+    if (x < 1)
+        fun_l21_n949(x)
+    else
+        fun_l21_n449(x)
+    end
+end
+
+def fun_l20_n895(x)
+    if (x < 1)
+        fun_l21_n182(x)
+    else
+        fun_l21_n935(x)
+    end
+end
+
+def fun_l20_n896(x)
+    if (x < 1)
+        fun_l21_n411(x)
+    else
+        fun_l21_n43(x)
+    end
+end
+
+def fun_l20_n897(x)
+    if (x < 1)
+        fun_l21_n70(x)
+    else
+        fun_l21_n363(x)
+    end
+end
+
+def fun_l20_n898(x)
+    if (x < 1)
+        fun_l21_n910(x)
+    else
+        fun_l21_n271(x)
+    end
+end
+
+def fun_l20_n899(x)
+    if (x < 1)
+        fun_l21_n722(x)
+    else
+        fun_l21_n793(x)
+    end
+end
+
+def fun_l20_n900(x)
+    if (x < 1)
+        fun_l21_n356(x)
+    else
+        fun_l21_n301(x)
+    end
+end
+
+def fun_l20_n901(x)
+    if (x < 1)
+        fun_l21_n915(x)
+    else
+        fun_l21_n373(x)
+    end
+end
+
+def fun_l20_n902(x)
+    if (x < 1)
+        fun_l21_n468(x)
+    else
+        fun_l21_n632(x)
+    end
+end
+
+def fun_l20_n903(x)
+    if (x < 1)
+        fun_l21_n970(x)
+    else
+        fun_l21_n54(x)
+    end
+end
+
+def fun_l20_n904(x)
+    if (x < 1)
+        fun_l21_n452(x)
+    else
+        fun_l21_n536(x)
+    end
+end
+
+def fun_l20_n905(x)
+    if (x < 1)
+        fun_l21_n223(x)
+    else
+        fun_l21_n423(x)
+    end
+end
+
+def fun_l20_n906(x)
+    if (x < 1)
+        fun_l21_n102(x)
+    else
+        fun_l21_n755(x)
+    end
+end
+
+def fun_l20_n907(x)
+    if (x < 1)
+        fun_l21_n537(x)
+    else
+        fun_l21_n84(x)
+    end
+end
+
+def fun_l20_n908(x)
+    if (x < 1)
+        fun_l21_n786(x)
+    else
+        fun_l21_n979(x)
+    end
+end
+
+def fun_l20_n909(x)
+    if (x < 1)
+        fun_l21_n573(x)
+    else
+        fun_l21_n965(x)
+    end
+end
+
+def fun_l20_n910(x)
+    if (x < 1)
+        fun_l21_n764(x)
+    else
+        fun_l21_n375(x)
+    end
+end
+
+def fun_l20_n911(x)
+    if (x < 1)
+        fun_l21_n673(x)
+    else
+        fun_l21_n545(x)
+    end
+end
+
+def fun_l20_n912(x)
+    if (x < 1)
+        fun_l21_n616(x)
+    else
+        fun_l21_n257(x)
+    end
+end
+
+def fun_l20_n913(x)
+    if (x < 1)
+        fun_l21_n276(x)
+    else
+        fun_l21_n670(x)
+    end
+end
+
+def fun_l20_n914(x)
+    if (x < 1)
+        fun_l21_n969(x)
+    else
+        fun_l21_n482(x)
+    end
+end
+
+def fun_l20_n915(x)
+    if (x < 1)
+        fun_l21_n603(x)
+    else
+        fun_l21_n916(x)
+    end
+end
+
+def fun_l20_n916(x)
+    if (x < 1)
+        fun_l21_n287(x)
+    else
+        fun_l21_n253(x)
+    end
+end
+
+def fun_l20_n917(x)
+    if (x < 1)
+        fun_l21_n201(x)
+    else
+        fun_l21_n175(x)
+    end
+end
+
+def fun_l20_n918(x)
+    if (x < 1)
+        fun_l21_n557(x)
+    else
+        fun_l21_n668(x)
+    end
+end
+
+def fun_l20_n919(x)
+    if (x < 1)
+        fun_l21_n598(x)
+    else
+        fun_l21_n85(x)
+    end
+end
+
+def fun_l20_n920(x)
+    if (x < 1)
+        fun_l21_n998(x)
+    else
+        fun_l21_n611(x)
+    end
+end
+
+def fun_l20_n921(x)
+    if (x < 1)
+        fun_l21_n22(x)
+    else
+        fun_l21_n76(x)
+    end
+end
+
+def fun_l20_n922(x)
+    if (x < 1)
+        fun_l21_n611(x)
+    else
+        fun_l21_n823(x)
+    end
+end
+
+def fun_l20_n923(x)
+    if (x < 1)
+        fun_l21_n739(x)
+    else
+        fun_l21_n231(x)
+    end
+end
+
+def fun_l20_n924(x)
+    if (x < 1)
+        fun_l21_n806(x)
+    else
+        fun_l21_n362(x)
+    end
+end
+
+def fun_l20_n925(x)
+    if (x < 1)
+        fun_l21_n32(x)
+    else
+        fun_l21_n593(x)
+    end
+end
+
+def fun_l20_n926(x)
+    if (x < 1)
+        fun_l21_n592(x)
+    else
+        fun_l21_n422(x)
+    end
+end
+
+def fun_l20_n927(x)
+    if (x < 1)
+        fun_l21_n624(x)
+    else
+        fun_l21_n690(x)
+    end
+end
+
+def fun_l20_n928(x)
+    if (x < 1)
+        fun_l21_n838(x)
+    else
+        fun_l21_n351(x)
+    end
+end
+
+def fun_l20_n929(x)
+    if (x < 1)
+        fun_l21_n289(x)
+    else
+        fun_l21_n842(x)
+    end
+end
+
+def fun_l20_n930(x)
+    if (x < 1)
+        fun_l21_n948(x)
+    else
+        fun_l21_n679(x)
+    end
+end
+
+def fun_l20_n931(x)
+    if (x < 1)
+        fun_l21_n746(x)
+    else
+        fun_l21_n267(x)
+    end
+end
+
+def fun_l20_n932(x)
+    if (x < 1)
+        fun_l21_n494(x)
+    else
+        fun_l21_n19(x)
+    end
+end
+
+def fun_l20_n933(x)
+    if (x < 1)
+        fun_l21_n8(x)
+    else
+        fun_l21_n234(x)
+    end
+end
+
+def fun_l20_n934(x)
+    if (x < 1)
+        fun_l21_n743(x)
+    else
+        fun_l21_n175(x)
+    end
+end
+
+def fun_l20_n935(x)
+    if (x < 1)
+        fun_l21_n111(x)
+    else
+        fun_l21_n300(x)
+    end
+end
+
+def fun_l20_n936(x)
+    if (x < 1)
+        fun_l21_n482(x)
+    else
+        fun_l21_n431(x)
+    end
+end
+
+def fun_l20_n937(x)
+    if (x < 1)
+        fun_l21_n885(x)
+    else
+        fun_l21_n523(x)
+    end
+end
+
+def fun_l20_n938(x)
+    if (x < 1)
+        fun_l21_n661(x)
+    else
+        fun_l21_n461(x)
+    end
+end
+
+def fun_l20_n939(x)
+    if (x < 1)
+        fun_l21_n809(x)
+    else
+        fun_l21_n868(x)
+    end
+end
+
+def fun_l20_n940(x)
+    if (x < 1)
+        fun_l21_n549(x)
+    else
+        fun_l21_n287(x)
+    end
+end
+
+def fun_l20_n941(x)
+    if (x < 1)
+        fun_l21_n246(x)
+    else
+        fun_l21_n228(x)
+    end
+end
+
+def fun_l20_n942(x)
+    if (x < 1)
+        fun_l21_n656(x)
+    else
+        fun_l21_n399(x)
+    end
+end
+
+def fun_l20_n943(x)
+    if (x < 1)
+        fun_l21_n344(x)
+    else
+        fun_l21_n77(x)
+    end
+end
+
+def fun_l20_n944(x)
+    if (x < 1)
+        fun_l21_n862(x)
+    else
+        fun_l21_n696(x)
+    end
+end
+
+def fun_l20_n945(x)
+    if (x < 1)
+        fun_l21_n892(x)
+    else
+        fun_l21_n782(x)
+    end
+end
+
+def fun_l20_n946(x)
+    if (x < 1)
+        fun_l21_n461(x)
+    else
+        fun_l21_n946(x)
+    end
+end
+
+def fun_l20_n947(x)
+    if (x < 1)
+        fun_l21_n576(x)
+    else
+        fun_l21_n216(x)
+    end
+end
+
+def fun_l20_n948(x)
+    if (x < 1)
+        fun_l21_n136(x)
+    else
+        fun_l21_n132(x)
+    end
+end
+
+def fun_l20_n949(x)
+    if (x < 1)
+        fun_l21_n987(x)
+    else
+        fun_l21_n615(x)
+    end
+end
+
+def fun_l20_n950(x)
+    if (x < 1)
+        fun_l21_n170(x)
+    else
+        fun_l21_n55(x)
+    end
+end
+
+def fun_l20_n951(x)
+    if (x < 1)
+        fun_l21_n260(x)
+    else
+        fun_l21_n675(x)
+    end
+end
+
+def fun_l20_n952(x)
+    if (x < 1)
+        fun_l21_n406(x)
+    else
+        fun_l21_n569(x)
+    end
+end
+
+def fun_l20_n953(x)
+    if (x < 1)
+        fun_l21_n41(x)
+    else
+        fun_l21_n951(x)
+    end
+end
+
+def fun_l20_n954(x)
+    if (x < 1)
+        fun_l21_n467(x)
+    else
+        fun_l21_n837(x)
+    end
+end
+
+def fun_l20_n955(x)
+    if (x < 1)
+        fun_l21_n41(x)
+    else
+        fun_l21_n349(x)
+    end
+end
+
+def fun_l20_n956(x)
+    if (x < 1)
+        fun_l21_n105(x)
+    else
+        fun_l21_n595(x)
+    end
+end
+
+def fun_l20_n957(x)
+    if (x < 1)
+        fun_l21_n132(x)
+    else
+        fun_l21_n622(x)
+    end
+end
+
+def fun_l20_n958(x)
+    if (x < 1)
+        fun_l21_n1(x)
+    else
+        fun_l21_n770(x)
+    end
+end
+
+def fun_l20_n959(x)
+    if (x < 1)
+        fun_l21_n768(x)
+    else
+        fun_l21_n979(x)
+    end
+end
+
+def fun_l20_n960(x)
+    if (x < 1)
+        fun_l21_n954(x)
+    else
+        fun_l21_n906(x)
+    end
+end
+
+def fun_l20_n961(x)
+    if (x < 1)
+        fun_l21_n759(x)
+    else
+        fun_l21_n381(x)
+    end
+end
+
+def fun_l20_n962(x)
+    if (x < 1)
+        fun_l21_n590(x)
+    else
+        fun_l21_n868(x)
+    end
+end
+
+def fun_l20_n963(x)
+    if (x < 1)
+        fun_l21_n119(x)
+    else
+        fun_l21_n962(x)
+    end
+end
+
+def fun_l20_n964(x)
+    if (x < 1)
+        fun_l21_n350(x)
+    else
+        fun_l21_n930(x)
+    end
+end
+
+def fun_l20_n965(x)
+    if (x < 1)
+        fun_l21_n542(x)
+    else
+        fun_l21_n217(x)
+    end
+end
+
+def fun_l20_n966(x)
+    if (x < 1)
+        fun_l21_n375(x)
+    else
+        fun_l21_n244(x)
+    end
+end
+
+def fun_l20_n967(x)
+    if (x < 1)
+        fun_l21_n160(x)
+    else
+        fun_l21_n610(x)
+    end
+end
+
+def fun_l20_n968(x)
+    if (x < 1)
+        fun_l21_n28(x)
+    else
+        fun_l21_n925(x)
+    end
+end
+
+def fun_l20_n969(x)
+    if (x < 1)
+        fun_l21_n661(x)
+    else
+        fun_l21_n944(x)
+    end
+end
+
+def fun_l20_n970(x)
+    if (x < 1)
+        fun_l21_n534(x)
+    else
+        fun_l21_n872(x)
+    end
+end
+
+def fun_l20_n971(x)
+    if (x < 1)
+        fun_l21_n684(x)
+    else
+        fun_l21_n271(x)
+    end
+end
+
+def fun_l20_n972(x)
+    if (x < 1)
+        fun_l21_n493(x)
+    else
+        fun_l21_n893(x)
+    end
+end
+
+def fun_l20_n973(x)
+    if (x < 1)
+        fun_l21_n912(x)
+    else
+        fun_l21_n385(x)
+    end
+end
+
+def fun_l20_n974(x)
+    if (x < 1)
+        fun_l21_n528(x)
+    else
+        fun_l21_n948(x)
+    end
+end
+
+def fun_l20_n975(x)
+    if (x < 1)
+        fun_l21_n263(x)
+    else
+        fun_l21_n362(x)
+    end
+end
+
+def fun_l20_n976(x)
+    if (x < 1)
+        fun_l21_n86(x)
+    else
+        fun_l21_n937(x)
+    end
+end
+
+def fun_l20_n977(x)
+    if (x < 1)
+        fun_l21_n886(x)
+    else
+        fun_l21_n845(x)
+    end
+end
+
+def fun_l20_n978(x)
+    if (x < 1)
+        fun_l21_n681(x)
+    else
+        fun_l21_n437(x)
+    end
+end
+
+def fun_l20_n979(x)
+    if (x < 1)
+        fun_l21_n342(x)
+    else
+        fun_l21_n333(x)
+    end
+end
+
+def fun_l20_n980(x)
+    if (x < 1)
+        fun_l21_n160(x)
+    else
+        fun_l21_n635(x)
+    end
+end
+
+def fun_l20_n981(x)
+    if (x < 1)
+        fun_l21_n580(x)
+    else
+        fun_l21_n895(x)
+    end
+end
+
+def fun_l20_n982(x)
+    if (x < 1)
+        fun_l21_n578(x)
+    else
+        fun_l21_n669(x)
+    end
+end
+
+def fun_l20_n983(x)
+    if (x < 1)
+        fun_l21_n939(x)
+    else
+        fun_l21_n321(x)
+    end
+end
+
+def fun_l20_n984(x)
+    if (x < 1)
+        fun_l21_n465(x)
+    else
+        fun_l21_n175(x)
+    end
+end
+
+def fun_l20_n985(x)
+    if (x < 1)
+        fun_l21_n522(x)
+    else
+        fun_l21_n108(x)
+    end
+end
+
+def fun_l20_n986(x)
+    if (x < 1)
+        fun_l21_n347(x)
+    else
+        fun_l21_n207(x)
+    end
+end
+
+def fun_l20_n987(x)
+    if (x < 1)
+        fun_l21_n844(x)
+    else
+        fun_l21_n39(x)
+    end
+end
+
+def fun_l20_n988(x)
+    if (x < 1)
+        fun_l21_n104(x)
+    else
+        fun_l21_n528(x)
+    end
+end
+
+def fun_l20_n989(x)
+    if (x < 1)
+        fun_l21_n486(x)
+    else
+        fun_l21_n443(x)
+    end
+end
+
+def fun_l20_n990(x)
+    if (x < 1)
+        fun_l21_n643(x)
+    else
+        fun_l21_n503(x)
+    end
+end
+
+def fun_l20_n991(x)
+    if (x < 1)
+        fun_l21_n428(x)
+    else
+        fun_l21_n813(x)
+    end
+end
+
+def fun_l20_n992(x)
+    if (x < 1)
+        fun_l21_n452(x)
+    else
+        fun_l21_n536(x)
+    end
+end
+
+def fun_l20_n993(x)
+    if (x < 1)
+        fun_l21_n247(x)
+    else
+        fun_l21_n961(x)
+    end
+end
+
+def fun_l20_n994(x)
+    if (x < 1)
+        fun_l21_n749(x)
+    else
+        fun_l21_n554(x)
+    end
+end
+
+def fun_l20_n995(x)
+    if (x < 1)
+        fun_l21_n333(x)
+    else
+        fun_l21_n162(x)
+    end
+end
+
+def fun_l20_n996(x)
+    if (x < 1)
+        fun_l21_n686(x)
+    else
+        fun_l21_n635(x)
+    end
+end
+
+def fun_l20_n997(x)
+    if (x < 1)
+        fun_l21_n709(x)
+    else
+        fun_l21_n953(x)
+    end
+end
+
+def fun_l20_n998(x)
+    if (x < 1)
+        fun_l21_n315(x)
+    else
+        fun_l21_n818(x)
+    end
+end
+
+def fun_l20_n999(x)
+    if (x < 1)
+        fun_l21_n543(x)
+    else
+        fun_l21_n385(x)
+    end
+end
+
+def fun_l21_n0(x)
+    if (x < 1)
+        fun_l22_n736(x)
+    else
+        fun_l22_n837(x)
+    end
+end
+
+def fun_l21_n1(x)
+    if (x < 1)
+        fun_l22_n333(x)
+    else
+        fun_l22_n358(x)
+    end
+end
+
+def fun_l21_n2(x)
+    if (x < 1)
+        fun_l22_n150(x)
+    else
+        fun_l22_n469(x)
+    end
+end
+
+def fun_l21_n3(x)
+    if (x < 1)
+        fun_l22_n899(x)
+    else
+        fun_l22_n917(x)
+    end
+end
+
+def fun_l21_n4(x)
+    if (x < 1)
+        fun_l22_n943(x)
+    else
+        fun_l22_n435(x)
+    end
+end
+
+def fun_l21_n5(x)
+    if (x < 1)
+        fun_l22_n56(x)
+    else
+        fun_l22_n123(x)
+    end
+end
+
+def fun_l21_n6(x)
+    if (x < 1)
+        fun_l22_n849(x)
+    else
+        fun_l22_n475(x)
+    end
+end
+
+def fun_l21_n7(x)
+    if (x < 1)
+        fun_l22_n931(x)
+    else
+        fun_l22_n529(x)
+    end
+end
+
+def fun_l21_n8(x)
+    if (x < 1)
+        fun_l22_n192(x)
+    else
+        fun_l22_n441(x)
+    end
+end
+
+def fun_l21_n9(x)
+    if (x < 1)
+        fun_l22_n84(x)
+    else
+        fun_l22_n428(x)
+    end
+end
+
+def fun_l21_n10(x)
+    if (x < 1)
+        fun_l22_n355(x)
+    else
+        fun_l22_n432(x)
+    end
+end
+
+def fun_l21_n11(x)
+    if (x < 1)
+        fun_l22_n380(x)
+    else
+        fun_l22_n739(x)
+    end
+end
+
+def fun_l21_n12(x)
+    if (x < 1)
+        fun_l22_n559(x)
+    else
+        fun_l22_n492(x)
+    end
+end
+
+def fun_l21_n13(x)
+    if (x < 1)
+        fun_l22_n542(x)
+    else
+        fun_l22_n284(x)
+    end
+end
+
+def fun_l21_n14(x)
+    if (x < 1)
+        fun_l22_n106(x)
+    else
+        fun_l22_n443(x)
+    end
+end
+
+def fun_l21_n15(x)
+    if (x < 1)
+        fun_l22_n769(x)
+    else
+        fun_l22_n111(x)
+    end
+end
+
+def fun_l21_n16(x)
+    if (x < 1)
+        fun_l22_n982(x)
+    else
+        fun_l22_n855(x)
+    end
+end
+
+def fun_l21_n17(x)
+    if (x < 1)
+        fun_l22_n994(x)
+    else
+        fun_l22_n952(x)
+    end
+end
+
+def fun_l21_n18(x)
+    if (x < 1)
+        fun_l22_n567(x)
+    else
+        fun_l22_n741(x)
+    end
+end
+
+def fun_l21_n19(x)
+    if (x < 1)
+        fun_l22_n851(x)
+    else
+        fun_l22_n830(x)
+    end
+end
+
+def fun_l21_n20(x)
+    if (x < 1)
+        fun_l22_n353(x)
+    else
+        fun_l22_n184(x)
+    end
+end
+
+def fun_l21_n21(x)
+    if (x < 1)
+        fun_l22_n891(x)
+    else
+        fun_l22_n629(x)
+    end
+end
+
+def fun_l21_n22(x)
+    if (x < 1)
+        fun_l22_n521(x)
+    else
+        fun_l22_n932(x)
+    end
+end
+
+def fun_l21_n23(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n913(x)
+    end
+end
+
+def fun_l21_n24(x)
+    if (x < 1)
+        fun_l22_n839(x)
+    else
+        fun_l22_n402(x)
+    end
+end
+
+def fun_l21_n25(x)
+    if (x < 1)
+        fun_l22_n525(x)
+    else
+        fun_l22_n247(x)
+    end
+end
+
+def fun_l21_n26(x)
+    if (x < 1)
+        fun_l22_n906(x)
+    else
+        fun_l22_n392(x)
+    end
+end
+
+def fun_l21_n27(x)
+    if (x < 1)
+        fun_l22_n716(x)
+    else
+        fun_l22_n804(x)
+    end
+end
+
+def fun_l21_n28(x)
+    if (x < 1)
+        fun_l22_n444(x)
+    else
+        fun_l22_n21(x)
+    end
+end
+
+def fun_l21_n29(x)
+    if (x < 1)
+        fun_l22_n674(x)
+    else
+        fun_l22_n695(x)
+    end
+end
+
+def fun_l21_n30(x)
+    if (x < 1)
+        fun_l22_n948(x)
+    else
+        fun_l22_n447(x)
+    end
+end
+
+def fun_l21_n31(x)
+    if (x < 1)
+        fun_l22_n460(x)
+    else
+        fun_l22_n743(x)
+    end
+end
+
+def fun_l21_n32(x)
+    if (x < 1)
+        fun_l22_n369(x)
+    else
+        fun_l22_n331(x)
+    end
+end
+
+def fun_l21_n33(x)
+    if (x < 1)
+        fun_l22_n602(x)
+    else
+        fun_l22_n934(x)
+    end
+end
+
+def fun_l21_n34(x)
+    if (x < 1)
+        fun_l22_n572(x)
+    else
+        fun_l22_n267(x)
+    end
+end
+
+def fun_l21_n35(x)
+    if (x < 1)
+        fun_l22_n517(x)
+    else
+        fun_l22_n298(x)
+    end
+end
+
+def fun_l21_n36(x)
+    if (x < 1)
+        fun_l22_n998(x)
+    else
+        fun_l22_n561(x)
+    end
+end
+
+def fun_l21_n37(x)
+    if (x < 1)
+        fun_l22_n457(x)
+    else
+        fun_l22_n513(x)
+    end
+end
+
+def fun_l21_n38(x)
+    if (x < 1)
+        fun_l22_n378(x)
+    else
+        fun_l22_n238(x)
+    end
+end
+
+def fun_l21_n39(x)
+    if (x < 1)
+        fun_l22_n788(x)
+    else
+        fun_l22_n45(x)
+    end
+end
+
+def fun_l21_n40(x)
+    if (x < 1)
+        fun_l22_n299(x)
+    else
+        fun_l22_n516(x)
+    end
+end
+
+def fun_l21_n41(x)
+    if (x < 1)
+        fun_l22_n454(x)
+    else
+        fun_l22_n274(x)
+    end
+end
+
+def fun_l21_n42(x)
+    if (x < 1)
+        fun_l22_n855(x)
+    else
+        fun_l22_n360(x)
+    end
+end
+
+def fun_l21_n43(x)
+    if (x < 1)
+        fun_l22_n577(x)
+    else
+        fun_l22_n213(x)
+    end
+end
+
+def fun_l21_n44(x)
+    if (x < 1)
+        fun_l22_n569(x)
+    else
+        fun_l22_n857(x)
+    end
+end
+
+def fun_l21_n45(x)
+    if (x < 1)
+        fun_l22_n667(x)
+    else
+        fun_l22_n285(x)
+    end
+end
+
+def fun_l21_n46(x)
+    if (x < 1)
+        fun_l22_n915(x)
+    else
+        fun_l22_n232(x)
+    end
+end
+
+def fun_l21_n47(x)
+    if (x < 1)
+        fun_l22_n124(x)
+    else
+        fun_l22_n708(x)
+    end
+end
+
+def fun_l21_n48(x)
+    if (x < 1)
+        fun_l22_n184(x)
+    else
+        fun_l22_n272(x)
+    end
+end
+
+def fun_l21_n49(x)
+    if (x < 1)
+        fun_l22_n376(x)
+    else
+        fun_l22_n138(x)
+    end
+end
+
+def fun_l21_n50(x)
+    if (x < 1)
+        fun_l22_n897(x)
+    else
+        fun_l22_n857(x)
+    end
+end
+
+def fun_l21_n51(x)
+    if (x < 1)
+        fun_l22_n335(x)
+    else
+        fun_l22_n614(x)
+    end
+end
+
+def fun_l21_n52(x)
+    if (x < 1)
+        fun_l22_n921(x)
+    else
+        fun_l22_n109(x)
+    end
+end
+
+def fun_l21_n53(x)
+    if (x < 1)
+        fun_l22_n27(x)
+    else
+        fun_l22_n609(x)
+    end
+end
+
+def fun_l21_n54(x)
+    if (x < 1)
+        fun_l22_n831(x)
+    else
+        fun_l22_n769(x)
+    end
+end
+
+def fun_l21_n55(x)
+    if (x < 1)
+        fun_l22_n936(x)
+    else
+        fun_l22_n250(x)
+    end
+end
+
+def fun_l21_n56(x)
+    if (x < 1)
+        fun_l22_n261(x)
+    else
+        fun_l22_n142(x)
+    end
+end
+
+def fun_l21_n57(x)
+    if (x < 1)
+        fun_l22_n721(x)
+    else
+        fun_l22_n604(x)
+    end
+end
+
+def fun_l21_n58(x)
+    if (x < 1)
+        fun_l22_n760(x)
+    else
+        fun_l22_n545(x)
+    end
+end
+
+def fun_l21_n59(x)
+    if (x < 1)
+        fun_l22_n934(x)
+    else
+        fun_l22_n110(x)
+    end
+end
+
+def fun_l21_n60(x)
+    if (x < 1)
+        fun_l22_n422(x)
+    else
+        fun_l22_n31(x)
+    end
+end
+
+def fun_l21_n61(x)
+    if (x < 1)
+        fun_l22_n776(x)
+    else
+        fun_l22_n251(x)
+    end
+end
+
+def fun_l21_n62(x)
+    if (x < 1)
+        fun_l22_n76(x)
+    else
+        fun_l22_n930(x)
+    end
+end
+
+def fun_l21_n63(x)
+    if (x < 1)
+        fun_l22_n331(x)
+    else
+        fun_l22_n550(x)
+    end
+end
+
+def fun_l21_n64(x)
+    if (x < 1)
+        fun_l22_n845(x)
+    else
+        fun_l22_n62(x)
+    end
+end
+
+def fun_l21_n65(x)
+    if (x < 1)
+        fun_l22_n887(x)
+    else
+        fun_l22_n784(x)
+    end
+end
+
+def fun_l21_n66(x)
+    if (x < 1)
+        fun_l22_n353(x)
+    else
+        fun_l22_n918(x)
+    end
+end
+
+def fun_l21_n67(x)
+    if (x < 1)
+        fun_l22_n682(x)
+    else
+        fun_l22_n840(x)
+    end
+end
+
+def fun_l21_n68(x)
+    if (x < 1)
+        fun_l22_n966(x)
+    else
+        fun_l22_n187(x)
+    end
+end
+
+def fun_l21_n69(x)
+    if (x < 1)
+        fun_l22_n424(x)
+    else
+        fun_l22_n674(x)
+    end
+end
+
+def fun_l21_n70(x)
+    if (x < 1)
+        fun_l22_n530(x)
+    else
+        fun_l22_n148(x)
+    end
+end
+
+def fun_l21_n71(x)
+    if (x < 1)
+        fun_l22_n616(x)
+    else
+        fun_l22_n945(x)
+    end
+end
+
+def fun_l21_n72(x)
+    if (x < 1)
+        fun_l22_n634(x)
+    else
+        fun_l22_n945(x)
+    end
+end
+
+def fun_l21_n73(x)
+    if (x < 1)
+        fun_l22_n153(x)
+    else
+        fun_l22_n657(x)
+    end
+end
+
+def fun_l21_n74(x)
+    if (x < 1)
+        fun_l22_n284(x)
+    else
+        fun_l22_n83(x)
+    end
+end
+
+def fun_l21_n75(x)
+    if (x < 1)
+        fun_l22_n292(x)
+    else
+        fun_l22_n440(x)
+    end
+end
+
+def fun_l21_n76(x)
+    if (x < 1)
+        fun_l22_n932(x)
+    else
+        fun_l22_n29(x)
+    end
+end
+
+def fun_l21_n77(x)
+    if (x < 1)
+        fun_l22_n292(x)
+    else
+        fun_l22_n866(x)
+    end
+end
+
+def fun_l21_n78(x)
+    if (x < 1)
+        fun_l22_n822(x)
+    else
+        fun_l22_n838(x)
+    end
+end
+
+def fun_l21_n79(x)
+    if (x < 1)
+        fun_l22_n297(x)
+    else
+        fun_l22_n677(x)
+    end
+end
+
+def fun_l21_n80(x)
+    if (x < 1)
+        fun_l22_n540(x)
+    else
+        fun_l22_n975(x)
+    end
+end
+
+def fun_l21_n81(x)
+    if (x < 1)
+        fun_l22_n375(x)
+    else
+        fun_l22_n735(x)
+    end
+end
+
+def fun_l21_n82(x)
+    if (x < 1)
+        fun_l22_n549(x)
+    else
+        fun_l22_n844(x)
+    end
+end
+
+def fun_l21_n83(x)
+    if (x < 1)
+        fun_l22_n763(x)
+    else
+        fun_l22_n863(x)
+    end
+end
+
+def fun_l21_n84(x)
+    if (x < 1)
+        fun_l22_n993(x)
+    else
+        fun_l22_n155(x)
+    end
+end
+
+def fun_l21_n85(x)
+    if (x < 1)
+        fun_l22_n751(x)
+    else
+        fun_l22_n264(x)
+    end
+end
+
+def fun_l21_n86(x)
+    if (x < 1)
+        fun_l22_n517(x)
+    else
+        fun_l22_n752(x)
+    end
+end
+
+def fun_l21_n87(x)
+    if (x < 1)
+        fun_l22_n477(x)
+    else
+        fun_l22_n486(x)
+    end
+end
+
+def fun_l21_n88(x)
+    if (x < 1)
+        fun_l22_n220(x)
+    else
+        fun_l22_n4(x)
+    end
+end
+
+def fun_l21_n89(x)
+    if (x < 1)
+        fun_l22_n678(x)
+    else
+        fun_l22_n692(x)
+    end
+end
+
+def fun_l21_n90(x)
+    if (x < 1)
+        fun_l22_n75(x)
+    else
+        fun_l22_n306(x)
+    end
+end
+
+def fun_l21_n91(x)
+    if (x < 1)
+        fun_l22_n460(x)
+    else
+        fun_l22_n514(x)
+    end
+end
+
+def fun_l21_n92(x)
+    if (x < 1)
+        fun_l22_n446(x)
+    else
+        fun_l22_n201(x)
+    end
+end
+
+def fun_l21_n93(x)
+    if (x < 1)
+        fun_l22_n872(x)
+    else
+        fun_l22_n611(x)
+    end
+end
+
+def fun_l21_n94(x)
+    if (x < 1)
+        fun_l22_n809(x)
+    else
+        fun_l22_n91(x)
+    end
+end
+
+def fun_l21_n95(x)
+    if (x < 1)
+        fun_l22_n565(x)
+    else
+        fun_l22_n968(x)
+    end
+end
+
+def fun_l21_n96(x)
+    if (x < 1)
+        fun_l22_n765(x)
+    else
+        fun_l22_n622(x)
+    end
+end
+
+def fun_l21_n97(x)
+    if (x < 1)
+        fun_l22_n856(x)
+    else
+        fun_l22_n923(x)
+    end
+end
+
+def fun_l21_n98(x)
+    if (x < 1)
+        fun_l22_n14(x)
+    else
+        fun_l22_n742(x)
+    end
+end
+
+def fun_l21_n99(x)
+    if (x < 1)
+        fun_l22_n214(x)
+    else
+        fun_l22_n118(x)
+    end
+end
+
+def fun_l21_n100(x)
+    if (x < 1)
+        fun_l22_n992(x)
+    else
+        fun_l22_n610(x)
+    end
+end
+
+def fun_l21_n101(x)
+    if (x < 1)
+        fun_l22_n603(x)
+    else
+        fun_l22_n208(x)
+    end
+end
+
+def fun_l21_n102(x)
+    if (x < 1)
+        fun_l22_n647(x)
+    else
+        fun_l22_n753(x)
+    end
+end
+
+def fun_l21_n103(x)
+    if (x < 1)
+        fun_l22_n952(x)
+    else
+        fun_l22_n25(x)
+    end
+end
+
+def fun_l21_n104(x)
+    if (x < 1)
+        fun_l22_n635(x)
+    else
+        fun_l22_n381(x)
+    end
+end
+
+def fun_l21_n105(x)
+    if (x < 1)
+        fun_l22_n258(x)
+    else
+        fun_l22_n346(x)
+    end
+end
+
+def fun_l21_n106(x)
+    if (x < 1)
+        fun_l22_n732(x)
+    else
+        fun_l22_n851(x)
+    end
+end
+
+def fun_l21_n107(x)
+    if (x < 1)
+        fun_l22_n67(x)
+    else
+        fun_l22_n80(x)
+    end
+end
+
+def fun_l21_n108(x)
+    if (x < 1)
+        fun_l22_n237(x)
+    else
+        fun_l22_n600(x)
+    end
+end
+
+def fun_l21_n109(x)
+    if (x < 1)
+        fun_l22_n448(x)
+    else
+        fun_l22_n768(x)
+    end
+end
+
+def fun_l21_n110(x)
+    if (x < 1)
+        fun_l22_n52(x)
+    else
+        fun_l22_n849(x)
+    end
+end
+
+def fun_l21_n111(x)
+    if (x < 1)
+        fun_l22_n471(x)
+    else
+        fun_l22_n400(x)
+    end
+end
+
+def fun_l21_n112(x)
+    if (x < 1)
+        fun_l22_n655(x)
+    else
+        fun_l22_n691(x)
+    end
+end
+
+def fun_l21_n113(x)
+    if (x < 1)
+        fun_l22_n325(x)
+    else
+        fun_l22_n936(x)
+    end
+end
+
+def fun_l21_n114(x)
+    if (x < 1)
+        fun_l22_n693(x)
+    else
+        fun_l22_n118(x)
+    end
+end
+
+def fun_l21_n115(x)
+    if (x < 1)
+        fun_l22_n881(x)
+    else
+        fun_l22_n167(x)
+    end
+end
+
+def fun_l21_n116(x)
+    if (x < 1)
+        fun_l22_n958(x)
+    else
+        fun_l22_n36(x)
+    end
+end
+
+def fun_l21_n117(x)
+    if (x < 1)
+        fun_l22_n233(x)
+    else
+        fun_l22_n649(x)
+    end
+end
+
+def fun_l21_n118(x)
+    if (x < 1)
+        fun_l22_n847(x)
+    else
+        fun_l22_n544(x)
+    end
+end
+
+def fun_l21_n119(x)
+    if (x < 1)
+        fun_l22_n392(x)
+    else
+        fun_l22_n2(x)
+    end
+end
+
+def fun_l21_n120(x)
+    if (x < 1)
+        fun_l22_n750(x)
+    else
+        fun_l22_n481(x)
+    end
+end
+
+def fun_l21_n121(x)
+    if (x < 1)
+        fun_l22_n124(x)
+    else
+        fun_l22_n769(x)
+    end
+end
+
+def fun_l21_n122(x)
+    if (x < 1)
+        fun_l22_n483(x)
+    else
+        fun_l22_n147(x)
+    end
+end
+
+def fun_l21_n123(x)
+    if (x < 1)
+        fun_l22_n543(x)
+    else
+        fun_l22_n454(x)
+    end
+end
+
+def fun_l21_n124(x)
+    if (x < 1)
+        fun_l22_n24(x)
+    else
+        fun_l22_n815(x)
+    end
+end
+
+def fun_l21_n125(x)
+    if (x < 1)
+        fun_l22_n315(x)
+    else
+        fun_l22_n263(x)
+    end
+end
+
+def fun_l21_n126(x)
+    if (x < 1)
+        fun_l22_n934(x)
+    else
+        fun_l22_n351(x)
+    end
+end
+
+def fun_l21_n127(x)
+    if (x < 1)
+        fun_l22_n982(x)
+    else
+        fun_l22_n755(x)
+    end
+end
+
+def fun_l21_n128(x)
+    if (x < 1)
+        fun_l22_n146(x)
+    else
+        fun_l22_n345(x)
+    end
+end
+
+def fun_l21_n129(x)
+    if (x < 1)
+        fun_l22_n85(x)
+    else
+        fun_l22_n356(x)
+    end
+end
+
+def fun_l21_n130(x)
+    if (x < 1)
+        fun_l22_n987(x)
+    else
+        fun_l22_n103(x)
+    end
+end
+
+def fun_l21_n131(x)
+    if (x < 1)
+        fun_l22_n413(x)
+    else
+        fun_l22_n260(x)
+    end
+end
+
+def fun_l21_n132(x)
+    if (x < 1)
+        fun_l22_n615(x)
+    else
+        fun_l22_n742(x)
+    end
+end
+
+def fun_l21_n133(x)
+    if (x < 1)
+        fun_l22_n836(x)
+    else
+        fun_l22_n214(x)
+    end
+end
+
+def fun_l21_n134(x)
+    if (x < 1)
+        fun_l22_n85(x)
+    else
+        fun_l22_n916(x)
+    end
+end
+
+def fun_l21_n135(x)
+    if (x < 1)
+        fun_l22_n21(x)
+    else
+        fun_l22_n902(x)
+    end
+end
+
+def fun_l21_n136(x)
+    if (x < 1)
+        fun_l22_n842(x)
+    else
+        fun_l22_n475(x)
+    end
+end
+
+def fun_l21_n137(x)
+    if (x < 1)
+        fun_l22_n573(x)
+    else
+        fun_l22_n108(x)
+    end
+end
+
+def fun_l21_n138(x)
+    if (x < 1)
+        fun_l22_n394(x)
+    else
+        fun_l22_n783(x)
+    end
+end
+
+def fun_l21_n139(x)
+    if (x < 1)
+        fun_l22_n514(x)
+    else
+        fun_l22_n37(x)
+    end
+end
+
+def fun_l21_n140(x)
+    if (x < 1)
+        fun_l22_n358(x)
+    else
+        fun_l22_n768(x)
+    end
+end
+
+def fun_l21_n141(x)
+    if (x < 1)
+        fun_l22_n201(x)
+    else
+        fun_l22_n981(x)
+    end
+end
+
+def fun_l21_n142(x)
+    if (x < 1)
+        fun_l22_n371(x)
+    else
+        fun_l22_n66(x)
+    end
+end
+
+def fun_l21_n143(x)
+    if (x < 1)
+        fun_l22_n41(x)
+    else
+        fun_l22_n869(x)
+    end
+end
+
+def fun_l21_n144(x)
+    if (x < 1)
+        fun_l22_n961(x)
+    else
+        fun_l22_n488(x)
+    end
+end
+
+def fun_l21_n145(x)
+    if (x < 1)
+        fun_l22_n769(x)
+    else
+        fun_l22_n82(x)
+    end
+end
+
+def fun_l21_n146(x)
+    if (x < 1)
+        fun_l22_n700(x)
+    else
+        fun_l22_n276(x)
+    end
+end
+
+def fun_l21_n147(x)
+    if (x < 1)
+        fun_l22_n439(x)
+    else
+        fun_l22_n654(x)
+    end
+end
+
+def fun_l21_n148(x)
+    if (x < 1)
+        fun_l22_n130(x)
+    else
+        fun_l22_n825(x)
+    end
+end
+
+def fun_l21_n149(x)
+    if (x < 1)
+        fun_l22_n174(x)
+    else
+        fun_l22_n907(x)
+    end
+end
+
+def fun_l21_n150(x)
+    if (x < 1)
+        fun_l22_n386(x)
+    else
+        fun_l22_n760(x)
+    end
+end
+
+def fun_l21_n151(x)
+    if (x < 1)
+        fun_l22_n460(x)
+    else
+        fun_l22_n403(x)
+    end
+end
+
+def fun_l21_n152(x)
+    if (x < 1)
+        fun_l22_n861(x)
+    else
+        fun_l22_n832(x)
+    end
+end
+
+def fun_l21_n153(x)
+    if (x < 1)
+        fun_l22_n564(x)
+    else
+        fun_l22_n604(x)
+    end
+end
+
+def fun_l21_n154(x)
+    if (x < 1)
+        fun_l22_n402(x)
+    else
+        fun_l22_n999(x)
+    end
+end
+
+def fun_l21_n155(x)
+    if (x < 1)
+        fun_l22_n645(x)
+    else
+        fun_l22_n807(x)
+    end
+end
+
+def fun_l21_n156(x)
+    if (x < 1)
+        fun_l22_n709(x)
+    else
+        fun_l22_n930(x)
+    end
+end
+
+def fun_l21_n157(x)
+    if (x < 1)
+        fun_l22_n353(x)
+    else
+        fun_l22_n462(x)
+    end
+end
+
+def fun_l21_n158(x)
+    if (x < 1)
+        fun_l22_n697(x)
+    else
+        fun_l22_n463(x)
+    end
+end
+
+def fun_l21_n159(x)
+    if (x < 1)
+        fun_l22_n690(x)
+    else
+        fun_l22_n309(x)
+    end
+end
+
+def fun_l21_n160(x)
+    if (x < 1)
+        fun_l22_n889(x)
+    else
+        fun_l22_n326(x)
+    end
+end
+
+def fun_l21_n161(x)
+    if (x < 1)
+        fun_l22_n952(x)
+    else
+        fun_l22_n225(x)
+    end
+end
+
+def fun_l21_n162(x)
+    if (x < 1)
+        fun_l22_n345(x)
+    else
+        fun_l22_n168(x)
+    end
+end
+
+def fun_l21_n163(x)
+    if (x < 1)
+        fun_l22_n437(x)
+    else
+        fun_l22_n494(x)
+    end
+end
+
+def fun_l21_n164(x)
+    if (x < 1)
+        fun_l22_n151(x)
+    else
+        fun_l22_n846(x)
+    end
+end
+
+def fun_l21_n165(x)
+    if (x < 1)
+        fun_l22_n324(x)
+    else
+        fun_l22_n999(x)
+    end
+end
+
+def fun_l21_n166(x)
+    if (x < 1)
+        fun_l22_n232(x)
+    else
+        fun_l22_n473(x)
+    end
+end
+
+def fun_l21_n167(x)
+    if (x < 1)
+        fun_l22_n934(x)
+    else
+        fun_l22_n437(x)
+    end
+end
+
+def fun_l21_n168(x)
+    if (x < 1)
+        fun_l22_n738(x)
+    else
+        fun_l22_n410(x)
+    end
+end
+
+def fun_l21_n169(x)
+    if (x < 1)
+        fun_l22_n686(x)
+    else
+        fun_l22_n108(x)
+    end
+end
+
+def fun_l21_n170(x)
+    if (x < 1)
+        fun_l22_n595(x)
+    else
+        fun_l22_n935(x)
+    end
+end
+
+def fun_l21_n171(x)
+    if (x < 1)
+        fun_l22_n723(x)
+    else
+        fun_l22_n478(x)
+    end
+end
+
+def fun_l21_n172(x)
+    if (x < 1)
+        fun_l22_n610(x)
+    else
+        fun_l22_n709(x)
+    end
+end
+
+def fun_l21_n173(x)
+    if (x < 1)
+        fun_l22_n539(x)
+    else
+        fun_l22_n17(x)
+    end
+end
+
+def fun_l21_n174(x)
+    if (x < 1)
+        fun_l22_n612(x)
+    else
+        fun_l22_n235(x)
+    end
+end
+
+def fun_l21_n175(x)
+    if (x < 1)
+        fun_l22_n835(x)
+    else
+        fun_l22_n138(x)
+    end
+end
+
+def fun_l21_n176(x)
+    if (x < 1)
+        fun_l22_n997(x)
+    else
+        fun_l22_n123(x)
+    end
+end
+
+def fun_l21_n177(x)
+    if (x < 1)
+        fun_l22_n97(x)
+    else
+        fun_l22_n997(x)
+    end
+end
+
+def fun_l21_n178(x)
+    if (x < 1)
+        fun_l22_n842(x)
+    else
+        fun_l22_n925(x)
+    end
+end
+
+def fun_l21_n179(x)
+    if (x < 1)
+        fun_l22_n159(x)
+    else
+        fun_l22_n412(x)
+    end
+end
+
+def fun_l21_n180(x)
+    if (x < 1)
+        fun_l22_n109(x)
+    else
+        fun_l22_n691(x)
+    end
+end
+
+def fun_l21_n181(x)
+    if (x < 1)
+        fun_l22_n315(x)
+    else
+        fun_l22_n127(x)
+    end
+end
+
+def fun_l21_n182(x)
+    if (x < 1)
+        fun_l22_n220(x)
+    else
+        fun_l22_n143(x)
+    end
+end
+
+def fun_l21_n183(x)
+    if (x < 1)
+        fun_l22_n493(x)
+    else
+        fun_l22_n895(x)
+    end
+end
+
+def fun_l21_n184(x)
+    if (x < 1)
+        fun_l22_n667(x)
+    else
+        fun_l22_n675(x)
+    end
+end
+
+def fun_l21_n185(x)
+    if (x < 1)
+        fun_l22_n995(x)
+    else
+        fun_l22_n4(x)
+    end
+end
+
+def fun_l21_n186(x)
+    if (x < 1)
+        fun_l22_n210(x)
+    else
+        fun_l22_n690(x)
+    end
+end
+
+def fun_l21_n187(x)
+    if (x < 1)
+        fun_l22_n413(x)
+    else
+        fun_l22_n227(x)
+    end
+end
+
+def fun_l21_n188(x)
+    if (x < 1)
+        fun_l22_n562(x)
+    else
+        fun_l22_n591(x)
+    end
+end
+
+def fun_l21_n189(x)
+    if (x < 1)
+        fun_l22_n171(x)
+    else
+        fun_l22_n891(x)
+    end
+end
+
+def fun_l21_n190(x)
+    if (x < 1)
+        fun_l22_n207(x)
+    else
+        fun_l22_n401(x)
+    end
+end
+
+def fun_l21_n191(x)
+    if (x < 1)
+        fun_l22_n703(x)
+    else
+        fun_l22_n604(x)
+    end
+end
+
+def fun_l21_n192(x)
+    if (x < 1)
+        fun_l22_n772(x)
+    else
+        fun_l22_n321(x)
+    end
+end
+
+def fun_l21_n193(x)
+    if (x < 1)
+        fun_l22_n576(x)
+    else
+        fun_l22_n273(x)
+    end
+end
+
+def fun_l21_n194(x)
+    if (x < 1)
+        fun_l22_n897(x)
+    else
+        fun_l22_n624(x)
+    end
+end
+
+def fun_l21_n195(x)
+    if (x < 1)
+        fun_l22_n909(x)
+    else
+        fun_l22_n216(x)
+    end
+end
+
+def fun_l21_n196(x)
+    if (x < 1)
+        fun_l22_n904(x)
+    else
+        fun_l22_n618(x)
+    end
+end
+
+def fun_l21_n197(x)
+    if (x < 1)
+        fun_l22_n410(x)
+    else
+        fun_l22_n926(x)
+    end
+end
+
+def fun_l21_n198(x)
+    if (x < 1)
+        fun_l22_n884(x)
+    else
+        fun_l22_n174(x)
+    end
+end
+
+def fun_l21_n199(x)
+    if (x < 1)
+        fun_l22_n407(x)
+    else
+        fun_l22_n270(x)
+    end
+end
+
+def fun_l21_n200(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n2(x)
+    end
+end
+
+def fun_l21_n201(x)
+    if (x < 1)
+        fun_l22_n143(x)
+    else
+        fun_l22_n93(x)
+    end
+end
+
+def fun_l21_n202(x)
+    if (x < 1)
+        fun_l22_n397(x)
+    else
+        fun_l22_n424(x)
+    end
+end
+
+def fun_l21_n203(x)
+    if (x < 1)
+        fun_l22_n183(x)
+    else
+        fun_l22_n258(x)
+    end
+end
+
+def fun_l21_n204(x)
+    if (x < 1)
+        fun_l22_n12(x)
+    else
+        fun_l22_n50(x)
+    end
+end
+
+def fun_l21_n205(x)
+    if (x < 1)
+        fun_l22_n488(x)
+    else
+        fun_l22_n148(x)
+    end
+end
+
+def fun_l21_n206(x)
+    if (x < 1)
+        fun_l22_n516(x)
+    else
+        fun_l22_n87(x)
+    end
+end
+
+def fun_l21_n207(x)
+    if (x < 1)
+        fun_l22_n810(x)
+    else
+        fun_l22_n773(x)
+    end
+end
+
+def fun_l21_n208(x)
+    if (x < 1)
+        fun_l22_n508(x)
+    else
+        fun_l22_n898(x)
+    end
+end
+
+def fun_l21_n209(x)
+    if (x < 1)
+        fun_l22_n188(x)
+    else
+        fun_l22_n815(x)
+    end
+end
+
+def fun_l21_n210(x)
+    if (x < 1)
+        fun_l22_n86(x)
+    else
+        fun_l22_n615(x)
+    end
+end
+
+def fun_l21_n211(x)
+    if (x < 1)
+        fun_l22_n589(x)
+    else
+        fun_l22_n774(x)
+    end
+end
+
+def fun_l21_n212(x)
+    if (x < 1)
+        fun_l22_n926(x)
+    else
+        fun_l22_n14(x)
+    end
+end
+
+def fun_l21_n213(x)
+    if (x < 1)
+        fun_l22_n104(x)
+    else
+        fun_l22_n723(x)
+    end
+end
+
+def fun_l21_n214(x)
+    if (x < 1)
+        fun_l22_n699(x)
+    else
+        fun_l22_n775(x)
+    end
+end
+
+def fun_l21_n215(x)
+    if (x < 1)
+        fun_l22_n941(x)
+    else
+        fun_l22_n997(x)
+    end
+end
+
+def fun_l21_n216(x)
+    if (x < 1)
+        fun_l22_n182(x)
+    else
+        fun_l22_n409(x)
+    end
+end
+
+def fun_l21_n217(x)
+    if (x < 1)
+        fun_l22_n410(x)
+    else
+        fun_l22_n807(x)
+    end
+end
+
+def fun_l21_n218(x)
+    if (x < 1)
+        fun_l22_n787(x)
+    else
+        fun_l22_n143(x)
+    end
+end
+
+def fun_l21_n219(x)
+    if (x < 1)
+        fun_l22_n515(x)
+    else
+        fun_l22_n558(x)
+    end
+end
+
+def fun_l21_n220(x)
+    if (x < 1)
+        fun_l22_n22(x)
+    else
+        fun_l22_n37(x)
+    end
+end
+
+def fun_l21_n221(x)
+    if (x < 1)
+        fun_l22_n366(x)
+    else
+        fun_l22_n63(x)
+    end
+end
+
+def fun_l21_n222(x)
+    if (x < 1)
+        fun_l22_n846(x)
+    else
+        fun_l22_n655(x)
+    end
+end
+
+def fun_l21_n223(x)
+    if (x < 1)
+        fun_l22_n946(x)
+    else
+        fun_l22_n587(x)
+    end
+end
+
+def fun_l21_n224(x)
+    if (x < 1)
+        fun_l22_n841(x)
+    else
+        fun_l22_n874(x)
+    end
+end
+
+def fun_l21_n225(x)
+    if (x < 1)
+        fun_l22_n19(x)
+    else
+        fun_l22_n142(x)
+    end
+end
+
+def fun_l21_n226(x)
+    if (x < 1)
+        fun_l22_n939(x)
+    else
+        fun_l22_n214(x)
+    end
+end
+
+def fun_l21_n227(x)
+    if (x < 1)
+        fun_l22_n900(x)
+    else
+        fun_l22_n673(x)
+    end
+end
+
+def fun_l21_n228(x)
+    if (x < 1)
+        fun_l22_n784(x)
+    else
+        fun_l22_n258(x)
+    end
+end
+
+def fun_l21_n229(x)
+    if (x < 1)
+        fun_l22_n553(x)
+    else
+        fun_l22_n253(x)
+    end
+end
+
+def fun_l21_n230(x)
+    if (x < 1)
+        fun_l22_n927(x)
+    else
+        fun_l22_n9(x)
+    end
+end
+
+def fun_l21_n231(x)
+    if (x < 1)
+        fun_l22_n822(x)
+    else
+        fun_l22_n870(x)
+    end
+end
+
+def fun_l21_n232(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n185(x)
+    end
+end
+
+def fun_l21_n233(x)
+    if (x < 1)
+        fun_l22_n691(x)
+    else
+        fun_l22_n613(x)
+    end
+end
+
+def fun_l21_n234(x)
+    if (x < 1)
+        fun_l22_n995(x)
+    else
+        fun_l22_n73(x)
+    end
+end
+
+def fun_l21_n235(x)
+    if (x < 1)
+        fun_l22_n250(x)
+    else
+        fun_l22_n356(x)
+    end
+end
+
+def fun_l21_n236(x)
+    if (x < 1)
+        fun_l22_n531(x)
+    else
+        fun_l22_n335(x)
+    end
+end
+
+def fun_l21_n237(x)
+    if (x < 1)
+        fun_l22_n376(x)
+    else
+        fun_l22_n732(x)
+    end
+end
+
+def fun_l21_n238(x)
+    if (x < 1)
+        fun_l22_n293(x)
+    else
+        fun_l22_n886(x)
+    end
+end
+
+def fun_l21_n239(x)
+    if (x < 1)
+        fun_l22_n266(x)
+    else
+        fun_l22_n820(x)
+    end
+end
+
+def fun_l21_n240(x)
+    if (x < 1)
+        fun_l22_n450(x)
+    else
+        fun_l22_n418(x)
+    end
+end
+
+def fun_l21_n241(x)
+    if (x < 1)
+        fun_l22_n902(x)
+    else
+        fun_l22_n991(x)
+    end
+end
+
+def fun_l21_n242(x)
+    if (x < 1)
+        fun_l22_n521(x)
+    else
+        fun_l22_n516(x)
+    end
+end
+
+def fun_l21_n243(x)
+    if (x < 1)
+        fun_l22_n97(x)
+    else
+        fun_l22_n388(x)
+    end
+end
+
+def fun_l21_n244(x)
+    if (x < 1)
+        fun_l22_n596(x)
+    else
+        fun_l22_n758(x)
+    end
+end
+
+def fun_l21_n245(x)
+    if (x < 1)
+        fun_l22_n370(x)
+    else
+        fun_l22_n747(x)
+    end
+end
+
+def fun_l21_n246(x)
+    if (x < 1)
+        fun_l22_n73(x)
+    else
+        fun_l22_n84(x)
+    end
+end
+
+def fun_l21_n247(x)
+    if (x < 1)
+        fun_l22_n489(x)
+    else
+        fun_l22_n166(x)
+    end
+end
+
+def fun_l21_n248(x)
+    if (x < 1)
+        fun_l22_n419(x)
+    else
+        fun_l22_n698(x)
+    end
+end
+
+def fun_l21_n249(x)
+    if (x < 1)
+        fun_l22_n330(x)
+    else
+        fun_l22_n995(x)
+    end
+end
+
+def fun_l21_n250(x)
+    if (x < 1)
+        fun_l22_n443(x)
+    else
+        fun_l22_n341(x)
+    end
+end
+
+def fun_l21_n251(x)
+    if (x < 1)
+        fun_l22_n442(x)
+    else
+        fun_l22_n311(x)
+    end
+end
+
+def fun_l21_n252(x)
+    if (x < 1)
+        fun_l22_n60(x)
+    else
+        fun_l22_n399(x)
+    end
+end
+
+def fun_l21_n253(x)
+    if (x < 1)
+        fun_l22_n831(x)
+    else
+        fun_l22_n245(x)
+    end
+end
+
+def fun_l21_n254(x)
+    if (x < 1)
+        fun_l22_n946(x)
+    else
+        fun_l22_n205(x)
+    end
+end
+
+def fun_l21_n255(x)
+    if (x < 1)
+        fun_l22_n499(x)
+    else
+        fun_l22_n476(x)
+    end
+end
+
+def fun_l21_n256(x)
+    if (x < 1)
+        fun_l22_n841(x)
+    else
+        fun_l22_n70(x)
+    end
+end
+
+def fun_l21_n257(x)
+    if (x < 1)
+        fun_l22_n289(x)
+    else
+        fun_l22_n329(x)
+    end
+end
+
+def fun_l21_n258(x)
+    if (x < 1)
+        fun_l22_n149(x)
+    else
+        fun_l22_n270(x)
+    end
+end
+
+def fun_l21_n259(x)
+    if (x < 1)
+        fun_l22_n569(x)
+    else
+        fun_l22_n972(x)
+    end
+end
+
+def fun_l21_n260(x)
+    if (x < 1)
+        fun_l22_n313(x)
+    else
+        fun_l22_n573(x)
+    end
+end
+
+def fun_l21_n261(x)
+    if (x < 1)
+        fun_l22_n458(x)
+    else
+        fun_l22_n964(x)
+    end
+end
+
+def fun_l21_n262(x)
+    if (x < 1)
+        fun_l22_n308(x)
+    else
+        fun_l22_n825(x)
+    end
+end
+
+def fun_l21_n263(x)
+    if (x < 1)
+        fun_l22_n810(x)
+    else
+        fun_l22_n864(x)
+    end
+end
+
+def fun_l21_n264(x)
+    if (x < 1)
+        fun_l22_n52(x)
+    else
+        fun_l22_n486(x)
+    end
+end
+
+def fun_l21_n265(x)
+    if (x < 1)
+        fun_l22_n520(x)
+    else
+        fun_l22_n758(x)
+    end
+end
+
+def fun_l21_n266(x)
+    if (x < 1)
+        fun_l22_n954(x)
+    else
+        fun_l22_n819(x)
+    end
+end
+
+def fun_l21_n267(x)
+    if (x < 1)
+        fun_l22_n226(x)
+    else
+        fun_l22_n893(x)
+    end
+end
+
+def fun_l21_n268(x)
+    if (x < 1)
+        fun_l22_n854(x)
+    else
+        fun_l22_n281(x)
+    end
+end
+
+def fun_l21_n269(x)
+    if (x < 1)
+        fun_l22_n354(x)
+    else
+        fun_l22_n296(x)
+    end
+end
+
+def fun_l21_n270(x)
+    if (x < 1)
+        fun_l22_n970(x)
+    else
+        fun_l22_n898(x)
+    end
+end
+
+def fun_l21_n271(x)
+    if (x < 1)
+        fun_l22_n769(x)
+    else
+        fun_l22_n94(x)
+    end
+end
+
+def fun_l21_n272(x)
+    if (x < 1)
+        fun_l22_n100(x)
+    else
+        fun_l22_n830(x)
+    end
+end
+
+def fun_l21_n273(x)
+    if (x < 1)
+        fun_l22_n514(x)
+    else
+        fun_l22_n522(x)
+    end
+end
+
+def fun_l21_n274(x)
+    if (x < 1)
+        fun_l22_n897(x)
+    else
+        fun_l22_n260(x)
+    end
+end
+
+def fun_l21_n275(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n125(x)
+    end
+end
+
+def fun_l21_n276(x)
+    if (x < 1)
+        fun_l22_n262(x)
+    else
+        fun_l22_n617(x)
+    end
+end
+
+def fun_l21_n277(x)
+    if (x < 1)
+        fun_l22_n84(x)
+    else
+        fun_l22_n483(x)
+    end
+end
+
+def fun_l21_n278(x)
+    if (x < 1)
+        fun_l22_n657(x)
+    else
+        fun_l22_n10(x)
+    end
+end
+
+def fun_l21_n279(x)
+    if (x < 1)
+        fun_l22_n142(x)
+    else
+        fun_l22_n666(x)
+    end
+end
+
+def fun_l21_n280(x)
+    if (x < 1)
+        fun_l22_n824(x)
+    else
+        fun_l22_n408(x)
+    end
+end
+
+def fun_l21_n281(x)
+    if (x < 1)
+        fun_l22_n39(x)
+    else
+        fun_l22_n225(x)
+    end
+end
+
+def fun_l21_n282(x)
+    if (x < 1)
+        fun_l22_n93(x)
+    else
+        fun_l22_n410(x)
+    end
+end
+
+def fun_l21_n283(x)
+    if (x < 1)
+        fun_l22_n294(x)
+    else
+        fun_l22_n268(x)
+    end
+end
+
+def fun_l21_n284(x)
+    if (x < 1)
+        fun_l22_n636(x)
+    else
+        fun_l22_n767(x)
+    end
+end
+
+def fun_l21_n285(x)
+    if (x < 1)
+        fun_l22_n181(x)
+    else
+        fun_l22_n317(x)
+    end
+end
+
+def fun_l21_n286(x)
+    if (x < 1)
+        fun_l22_n208(x)
+    else
+        fun_l22_n803(x)
+    end
+end
+
+def fun_l21_n287(x)
+    if (x < 1)
+        fun_l22_n910(x)
+    else
+        fun_l22_n872(x)
+    end
+end
+
+def fun_l21_n288(x)
+    if (x < 1)
+        fun_l22_n771(x)
+    else
+        fun_l22_n858(x)
+    end
+end
+
+def fun_l21_n289(x)
+    if (x < 1)
+        fun_l22_n109(x)
+    else
+        fun_l22_n577(x)
+    end
+end
+
+def fun_l21_n290(x)
+    if (x < 1)
+        fun_l22_n474(x)
+    else
+        fun_l22_n289(x)
+    end
+end
+
+def fun_l21_n291(x)
+    if (x < 1)
+        fun_l22_n55(x)
+    else
+        fun_l22_n448(x)
+    end
+end
+
+def fun_l21_n292(x)
+    if (x < 1)
+        fun_l22_n644(x)
+    else
+        fun_l22_n958(x)
+    end
+end
+
+def fun_l21_n293(x)
+    if (x < 1)
+        fun_l22_n775(x)
+    else
+        fun_l22_n131(x)
+    end
+end
+
+def fun_l21_n294(x)
+    if (x < 1)
+        fun_l22_n950(x)
+    else
+        fun_l22_n216(x)
+    end
+end
+
+def fun_l21_n295(x)
+    if (x < 1)
+        fun_l22_n258(x)
+    else
+        fun_l22_n919(x)
+    end
+end
+
+def fun_l21_n296(x)
+    if (x < 1)
+        fun_l22_n298(x)
+    else
+        fun_l22_n334(x)
+    end
+end
+
+def fun_l21_n297(x)
+    if (x < 1)
+        fun_l22_n124(x)
+    else
+        fun_l22_n704(x)
+    end
+end
+
+def fun_l21_n298(x)
+    if (x < 1)
+        fun_l22_n526(x)
+    else
+        fun_l22_n139(x)
+    end
+end
+
+def fun_l21_n299(x)
+    if (x < 1)
+        fun_l22_n133(x)
+    else
+        fun_l22_n65(x)
+    end
+end
+
+def fun_l21_n300(x)
+    if (x < 1)
+        fun_l22_n476(x)
+    else
+        fun_l22_n858(x)
+    end
+end
+
+def fun_l21_n301(x)
+    if (x < 1)
+        fun_l22_n23(x)
+    else
+        fun_l22_n391(x)
+    end
+end
+
+def fun_l21_n302(x)
+    if (x < 1)
+        fun_l22_n292(x)
+    else
+        fun_l22_n127(x)
+    end
+end
+
+def fun_l21_n303(x)
+    if (x < 1)
+        fun_l22_n935(x)
+    else
+        fun_l22_n399(x)
+    end
+end
+
+def fun_l21_n304(x)
+    if (x < 1)
+        fun_l22_n110(x)
+    else
+        fun_l22_n904(x)
+    end
+end
+
+def fun_l21_n305(x)
+    if (x < 1)
+        fun_l22_n865(x)
+    else
+        fun_l22_n510(x)
+    end
+end
+
+def fun_l21_n306(x)
+    if (x < 1)
+        fun_l22_n930(x)
+    else
+        fun_l22_n892(x)
+    end
+end
+
+def fun_l21_n307(x)
+    if (x < 1)
+        fun_l22_n701(x)
+    else
+        fun_l22_n172(x)
+    end
+end
+
+def fun_l21_n308(x)
+    if (x < 1)
+        fun_l22_n424(x)
+    else
+        fun_l22_n169(x)
+    end
+end
+
+def fun_l21_n309(x)
+    if (x < 1)
+        fun_l22_n494(x)
+    else
+        fun_l22_n608(x)
+    end
+end
+
+def fun_l21_n310(x)
+    if (x < 1)
+        fun_l22_n862(x)
+    else
+        fun_l22_n54(x)
+    end
+end
+
+def fun_l21_n311(x)
+    if (x < 1)
+        fun_l22_n679(x)
+    else
+        fun_l22_n246(x)
+    end
+end
+
+def fun_l21_n312(x)
+    if (x < 1)
+        fun_l22_n897(x)
+    else
+        fun_l22_n581(x)
+    end
+end
+
+def fun_l21_n313(x)
+    if (x < 1)
+        fun_l22_n788(x)
+    else
+        fun_l22_n32(x)
+    end
+end
+
+def fun_l21_n314(x)
+    if (x < 1)
+        fun_l22_n68(x)
+    else
+        fun_l22_n920(x)
+    end
+end
+
+def fun_l21_n315(x)
+    if (x < 1)
+        fun_l22_n520(x)
+    else
+        fun_l22_n814(x)
+    end
+end
+
+def fun_l21_n316(x)
+    if (x < 1)
+        fun_l22_n190(x)
+    else
+        fun_l22_n832(x)
+    end
+end
+
+def fun_l21_n317(x)
+    if (x < 1)
+        fun_l22_n500(x)
+    else
+        fun_l22_n576(x)
+    end
+end
+
+def fun_l21_n318(x)
+    if (x < 1)
+        fun_l22_n999(x)
+    else
+        fun_l22_n423(x)
+    end
+end
+
+def fun_l21_n319(x)
+    if (x < 1)
+        fun_l22_n62(x)
+    else
+        fun_l22_n451(x)
+    end
+end
+
+def fun_l21_n320(x)
+    if (x < 1)
+        fun_l22_n265(x)
+    else
+        fun_l22_n421(x)
+    end
+end
+
+def fun_l21_n321(x)
+    if (x < 1)
+        fun_l22_n340(x)
+    else
+        fun_l22_n297(x)
+    end
+end
+
+def fun_l21_n322(x)
+    if (x < 1)
+        fun_l22_n526(x)
+    else
+        fun_l22_n834(x)
+    end
+end
+
+def fun_l21_n323(x)
+    if (x < 1)
+        fun_l22_n305(x)
+    else
+        fun_l22_n444(x)
+    end
+end
+
+def fun_l21_n324(x)
+    if (x < 1)
+        fun_l22_n117(x)
+    else
+        fun_l22_n617(x)
+    end
+end
+
+def fun_l21_n325(x)
+    if (x < 1)
+        fun_l22_n715(x)
+    else
+        fun_l22_n551(x)
+    end
+end
+
+def fun_l21_n326(x)
+    if (x < 1)
+        fun_l22_n921(x)
+    else
+        fun_l22_n69(x)
+    end
+end
+
+def fun_l21_n327(x)
+    if (x < 1)
+        fun_l22_n226(x)
+    else
+        fun_l22_n21(x)
+    end
+end
+
+def fun_l21_n328(x)
+    if (x < 1)
+        fun_l22_n181(x)
+    else
+        fun_l22_n409(x)
+    end
+end
+
+def fun_l21_n329(x)
+    if (x < 1)
+        fun_l22_n894(x)
+    else
+        fun_l22_n17(x)
+    end
+end
+
+def fun_l21_n330(x)
+    if (x < 1)
+        fun_l22_n633(x)
+    else
+        fun_l22_n370(x)
+    end
+end
+
+def fun_l21_n331(x)
+    if (x < 1)
+        fun_l22_n638(x)
+    else
+        fun_l22_n994(x)
+    end
+end
+
+def fun_l21_n332(x)
+    if (x < 1)
+        fun_l22_n663(x)
+    else
+        fun_l22_n981(x)
+    end
+end
+
+def fun_l21_n333(x)
+    if (x < 1)
+        fun_l22_n861(x)
+    else
+        fun_l22_n472(x)
+    end
+end
+
+def fun_l21_n334(x)
+    if (x < 1)
+        fun_l22_n265(x)
+    else
+        fun_l22_n534(x)
+    end
+end
+
+def fun_l21_n335(x)
+    if (x < 1)
+        fun_l22_n43(x)
+    else
+        fun_l22_n613(x)
+    end
+end
+
+def fun_l21_n336(x)
+    if (x < 1)
+        fun_l22_n788(x)
+    else
+        fun_l22_n649(x)
+    end
+end
+
+def fun_l21_n337(x)
+    if (x < 1)
+        fun_l22_n406(x)
+    else
+        fun_l22_n644(x)
+    end
+end
+
+def fun_l21_n338(x)
+    if (x < 1)
+        fun_l22_n582(x)
+    else
+        fun_l22_n463(x)
+    end
+end
+
+def fun_l21_n339(x)
+    if (x < 1)
+        fun_l22_n825(x)
+    else
+        fun_l22_n775(x)
+    end
+end
+
+def fun_l21_n340(x)
+    if (x < 1)
+        fun_l22_n696(x)
+    else
+        fun_l22_n318(x)
+    end
+end
+
+def fun_l21_n341(x)
+    if (x < 1)
+        fun_l22_n21(x)
+    else
+        fun_l22_n285(x)
+    end
+end
+
+def fun_l21_n342(x)
+    if (x < 1)
+        fun_l22_n10(x)
+    else
+        fun_l22_n423(x)
+    end
+end
+
+def fun_l21_n343(x)
+    if (x < 1)
+        fun_l22_n205(x)
+    else
+        fun_l22_n86(x)
+    end
+end
+
+def fun_l21_n344(x)
+    if (x < 1)
+        fun_l22_n437(x)
+    else
+        fun_l22_n712(x)
+    end
+end
+
+def fun_l21_n345(x)
+    if (x < 1)
+        fun_l22_n941(x)
+    else
+        fun_l22_n655(x)
+    end
+end
+
+def fun_l21_n346(x)
+    if (x < 1)
+        fun_l22_n673(x)
+    else
+        fun_l22_n750(x)
+    end
+end
+
+def fun_l21_n347(x)
+    if (x < 1)
+        fun_l22_n728(x)
+    else
+        fun_l22_n605(x)
+    end
+end
+
+def fun_l21_n348(x)
+    if (x < 1)
+        fun_l22_n452(x)
+    else
+        fun_l22_n968(x)
+    end
+end
+
+def fun_l21_n349(x)
+    if (x < 1)
+        fun_l22_n554(x)
+    else
+        fun_l22_n997(x)
+    end
+end
+
+def fun_l21_n350(x)
+    if (x < 1)
+        fun_l22_n784(x)
+    else
+        fun_l22_n801(x)
+    end
+end
+
+def fun_l21_n351(x)
+    if (x < 1)
+        fun_l22_n397(x)
+    else
+        fun_l22_n636(x)
+    end
+end
+
+def fun_l21_n352(x)
+    if (x < 1)
+        fun_l22_n562(x)
+    else
+        fun_l22_n150(x)
+    end
+end
+
+def fun_l21_n353(x)
+    if (x < 1)
+        fun_l22_n142(x)
+    else
+        fun_l22_n396(x)
+    end
+end
+
+def fun_l21_n354(x)
+    if (x < 1)
+        fun_l22_n455(x)
+    else
+        fun_l22_n424(x)
+    end
+end
+
+def fun_l21_n355(x)
+    if (x < 1)
+        fun_l22_n736(x)
+    else
+        fun_l22_n534(x)
+    end
+end
+
+def fun_l21_n356(x)
+    if (x < 1)
+        fun_l22_n111(x)
+    else
+        fun_l22_n903(x)
+    end
+end
+
+def fun_l21_n357(x)
+    if (x < 1)
+        fun_l22_n996(x)
+    else
+        fun_l22_n350(x)
+    end
+end
+
+def fun_l21_n358(x)
+    if (x < 1)
+        fun_l22_n516(x)
+    else
+        fun_l22_n202(x)
+    end
+end
+
+def fun_l21_n359(x)
+    if (x < 1)
+        fun_l22_n68(x)
+    else
+        fun_l22_n823(x)
+    end
+end
+
+def fun_l21_n360(x)
+    if (x < 1)
+        fun_l22_n298(x)
+    else
+        fun_l22_n873(x)
+    end
+end
+
+def fun_l21_n361(x)
+    if (x < 1)
+        fun_l22_n491(x)
+    else
+        fun_l22_n86(x)
+    end
+end
+
+def fun_l21_n362(x)
+    if (x < 1)
+        fun_l22_n340(x)
+    else
+        fun_l22_n215(x)
+    end
+end
+
+def fun_l21_n363(x)
+    if (x < 1)
+        fun_l22_n452(x)
+    else
+        fun_l22_n416(x)
+    end
+end
+
+def fun_l21_n364(x)
+    if (x < 1)
+        fun_l22_n625(x)
+    else
+        fun_l22_n638(x)
+    end
+end
+
+def fun_l21_n365(x)
+    if (x < 1)
+        fun_l22_n166(x)
+    else
+        fun_l22_n380(x)
+    end
+end
+
+def fun_l21_n366(x)
+    if (x < 1)
+        fun_l22_n934(x)
+    else
+        fun_l22_n937(x)
+    end
+end
+
+def fun_l21_n367(x)
+    if (x < 1)
+        fun_l22_n77(x)
+    else
+        fun_l22_n117(x)
+    end
+end
+
+def fun_l21_n368(x)
+    if (x < 1)
+        fun_l22_n688(x)
+    else
+        fun_l22_n529(x)
+    end
+end
+
+def fun_l21_n369(x)
+    if (x < 1)
+        fun_l22_n950(x)
+    else
+        fun_l22_n148(x)
+    end
+end
+
+def fun_l21_n370(x)
+    if (x < 1)
+        fun_l22_n216(x)
+    else
+        fun_l22_n588(x)
+    end
+end
+
+def fun_l21_n371(x)
+    if (x < 1)
+        fun_l22_n127(x)
+    else
+        fun_l22_n901(x)
+    end
+end
+
+def fun_l21_n372(x)
+    if (x < 1)
+        fun_l22_n244(x)
+    else
+        fun_l22_n516(x)
+    end
+end
+
+def fun_l21_n373(x)
+    if (x < 1)
+        fun_l22_n791(x)
+    else
+        fun_l22_n466(x)
+    end
+end
+
+def fun_l21_n374(x)
+    if (x < 1)
+        fun_l22_n469(x)
+    else
+        fun_l22_n38(x)
+    end
+end
+
+def fun_l21_n375(x)
+    if (x < 1)
+        fun_l22_n894(x)
+    else
+        fun_l22_n82(x)
+    end
+end
+
+def fun_l21_n376(x)
+    if (x < 1)
+        fun_l22_n663(x)
+    else
+        fun_l22_n865(x)
+    end
+end
+
+def fun_l21_n377(x)
+    if (x < 1)
+        fun_l22_n782(x)
+    else
+        fun_l22_n10(x)
+    end
+end
+
+def fun_l21_n378(x)
+    if (x < 1)
+        fun_l22_n930(x)
+    else
+        fun_l22_n767(x)
+    end
+end
+
+def fun_l21_n379(x)
+    if (x < 1)
+        fun_l22_n130(x)
+    else
+        fun_l22_n437(x)
+    end
+end
+
+def fun_l21_n380(x)
+    if (x < 1)
+        fun_l22_n496(x)
+    else
+        fun_l22_n413(x)
+    end
+end
+
+def fun_l21_n381(x)
+    if (x < 1)
+        fun_l22_n453(x)
+    else
+        fun_l22_n542(x)
+    end
+end
+
+def fun_l21_n382(x)
+    if (x < 1)
+        fun_l22_n404(x)
+    else
+        fun_l22_n637(x)
+    end
+end
+
+def fun_l21_n383(x)
+    if (x < 1)
+        fun_l22_n829(x)
+    else
+        fun_l22_n526(x)
+    end
+end
+
+def fun_l21_n384(x)
+    if (x < 1)
+        fun_l22_n882(x)
+    else
+        fun_l22_n922(x)
+    end
+end
+
+def fun_l21_n385(x)
+    if (x < 1)
+        fun_l22_n58(x)
+    else
+        fun_l22_n401(x)
+    end
+end
+
+def fun_l21_n386(x)
+    if (x < 1)
+        fun_l22_n936(x)
+    else
+        fun_l22_n164(x)
+    end
+end
+
+def fun_l21_n387(x)
+    if (x < 1)
+        fun_l22_n773(x)
+    else
+        fun_l22_n323(x)
+    end
+end
+
+def fun_l21_n388(x)
+    if (x < 1)
+        fun_l22_n718(x)
+    else
+        fun_l22_n189(x)
+    end
+end
+
+def fun_l21_n389(x)
+    if (x < 1)
+        fun_l22_n950(x)
+    else
+        fun_l22_n283(x)
+    end
+end
+
+def fun_l21_n390(x)
+    if (x < 1)
+        fun_l22_n278(x)
+    else
+        fun_l22_n325(x)
+    end
+end
+
+def fun_l21_n391(x)
+    if (x < 1)
+        fun_l22_n98(x)
+    else
+        fun_l22_n162(x)
+    end
+end
+
+def fun_l21_n392(x)
+    if (x < 1)
+        fun_l22_n268(x)
+    else
+        fun_l22_n416(x)
+    end
+end
+
+def fun_l21_n393(x)
+    if (x < 1)
+        fun_l22_n344(x)
+    else
+        fun_l22_n680(x)
+    end
+end
+
+def fun_l21_n394(x)
+    if (x < 1)
+        fun_l22_n545(x)
+    else
+        fun_l22_n41(x)
+    end
+end
+
+def fun_l21_n395(x)
+    if (x < 1)
+        fun_l22_n149(x)
+    else
+        fun_l22_n659(x)
+    end
+end
+
+def fun_l21_n396(x)
+    if (x < 1)
+        fun_l22_n81(x)
+    else
+        fun_l22_n316(x)
+    end
+end
+
+def fun_l21_n397(x)
+    if (x < 1)
+        fun_l22_n657(x)
+    else
+        fun_l22_n414(x)
+    end
+end
+
+def fun_l21_n398(x)
+    if (x < 1)
+        fun_l22_n262(x)
+    else
+        fun_l22_n26(x)
+    end
+end
+
+def fun_l21_n399(x)
+    if (x < 1)
+        fun_l22_n509(x)
+    else
+        fun_l22_n658(x)
+    end
+end
+
+def fun_l21_n400(x)
+    if (x < 1)
+        fun_l22_n533(x)
+    else
+        fun_l22_n416(x)
+    end
+end
+
+def fun_l21_n401(x)
+    if (x < 1)
+        fun_l22_n631(x)
+    else
+        fun_l22_n575(x)
+    end
+end
+
+def fun_l21_n402(x)
+    if (x < 1)
+        fun_l22_n171(x)
+    else
+        fun_l22_n727(x)
+    end
+end
+
+def fun_l21_n403(x)
+    if (x < 1)
+        fun_l22_n65(x)
+    else
+        fun_l22_n109(x)
+    end
+end
+
+def fun_l21_n404(x)
+    if (x < 1)
+        fun_l22_n818(x)
+    else
+        fun_l22_n638(x)
+    end
+end
+
+def fun_l21_n405(x)
+    if (x < 1)
+        fun_l22_n515(x)
+    else
+        fun_l22_n86(x)
+    end
+end
+
+def fun_l21_n406(x)
+    if (x < 1)
+        fun_l22_n500(x)
+    else
+        fun_l22_n367(x)
+    end
+end
+
+def fun_l21_n407(x)
+    if (x < 1)
+        fun_l22_n609(x)
+    else
+        fun_l22_n926(x)
+    end
+end
+
+def fun_l21_n408(x)
+    if (x < 1)
+        fun_l22_n553(x)
+    else
+        fun_l22_n494(x)
+    end
+end
+
+def fun_l21_n409(x)
+    if (x < 1)
+        fun_l22_n837(x)
+    else
+        fun_l22_n800(x)
+    end
+end
+
+def fun_l21_n410(x)
+    if (x < 1)
+        fun_l22_n511(x)
+    else
+        fun_l22_n376(x)
+    end
+end
+
+def fun_l21_n411(x)
+    if (x < 1)
+        fun_l22_n691(x)
+    else
+        fun_l22_n135(x)
+    end
+end
+
+def fun_l21_n412(x)
+    if (x < 1)
+        fun_l22_n537(x)
+    else
+        fun_l22_n708(x)
+    end
+end
+
+def fun_l21_n413(x)
+    if (x < 1)
+        fun_l22_n858(x)
+    else
+        fun_l22_n75(x)
+    end
+end
+
+def fun_l21_n414(x)
+    if (x < 1)
+        fun_l22_n473(x)
+    else
+        fun_l22_n26(x)
+    end
+end
+
+def fun_l21_n415(x)
+    if (x < 1)
+        fun_l22_n443(x)
+    else
+        fun_l22_n709(x)
+    end
+end
+
+def fun_l21_n416(x)
+    if (x < 1)
+        fun_l22_n464(x)
+    else
+        fun_l22_n329(x)
+    end
+end
+
+def fun_l21_n417(x)
+    if (x < 1)
+        fun_l22_n402(x)
+    else
+        fun_l22_n438(x)
+    end
+end
+
+def fun_l21_n418(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n704(x)
+    end
+end
+
+def fun_l21_n419(x)
+    if (x < 1)
+        fun_l22_n949(x)
+    else
+        fun_l22_n46(x)
+    end
+end
+
+def fun_l21_n420(x)
+    if (x < 1)
+        fun_l22_n102(x)
+    else
+        fun_l22_n20(x)
+    end
+end
+
+def fun_l21_n421(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n876(x)
+    end
+end
+
+def fun_l21_n422(x)
+    if (x < 1)
+        fun_l22_n881(x)
+    else
+        fun_l22_n100(x)
+    end
+end
+
+def fun_l21_n423(x)
+    if (x < 1)
+        fun_l22_n155(x)
+    else
+        fun_l22_n99(x)
+    end
+end
+
+def fun_l21_n424(x)
+    if (x < 1)
+        fun_l22_n913(x)
+    else
+        fun_l22_n839(x)
+    end
+end
+
+def fun_l21_n425(x)
+    if (x < 1)
+        fun_l22_n981(x)
+    else
+        fun_l22_n73(x)
+    end
+end
+
+def fun_l21_n426(x)
+    if (x < 1)
+        fun_l22_n221(x)
+    else
+        fun_l22_n548(x)
+    end
+end
+
+def fun_l21_n427(x)
+    if (x < 1)
+        fun_l22_n563(x)
+    else
+        fun_l22_n978(x)
+    end
+end
+
+def fun_l21_n428(x)
+    if (x < 1)
+        fun_l22_n310(x)
+    else
+        fun_l22_n591(x)
+    end
+end
+
+def fun_l21_n429(x)
+    if (x < 1)
+        fun_l22_n962(x)
+    else
+        fun_l22_n156(x)
+    end
+end
+
+def fun_l21_n430(x)
+    if (x < 1)
+        fun_l22_n810(x)
+    else
+        fun_l22_n766(x)
+    end
+end
+
+def fun_l21_n431(x)
+    if (x < 1)
+        fun_l22_n675(x)
+    else
+        fun_l22_n354(x)
+    end
+end
+
+def fun_l21_n432(x)
+    if (x < 1)
+        fun_l22_n320(x)
+    else
+        fun_l22_n474(x)
+    end
+end
+
+def fun_l21_n433(x)
+    if (x < 1)
+        fun_l22_n50(x)
+    else
+        fun_l22_n626(x)
+    end
+end
+
+def fun_l21_n434(x)
+    if (x < 1)
+        fun_l22_n956(x)
+    else
+        fun_l22_n238(x)
+    end
+end
+
+def fun_l21_n435(x)
+    if (x < 1)
+        fun_l22_n966(x)
+    else
+        fun_l22_n729(x)
+    end
+end
+
+def fun_l21_n436(x)
+    if (x < 1)
+        fun_l22_n856(x)
+    else
+        fun_l22_n553(x)
+    end
+end
+
+def fun_l21_n437(x)
+    if (x < 1)
+        fun_l22_n833(x)
+    else
+        fun_l22_n312(x)
+    end
+end
+
+def fun_l21_n438(x)
+    if (x < 1)
+        fun_l22_n254(x)
+    else
+        fun_l22_n515(x)
+    end
+end
+
+def fun_l21_n439(x)
+    if (x < 1)
+        fun_l22_n548(x)
+    else
+        fun_l22_n184(x)
+    end
+end
+
+def fun_l21_n440(x)
+    if (x < 1)
+        fun_l22_n922(x)
+    else
+        fun_l22_n465(x)
+    end
+end
+
+def fun_l21_n441(x)
+    if (x < 1)
+        fun_l22_n136(x)
+    else
+        fun_l22_n739(x)
+    end
+end
+
+def fun_l21_n442(x)
+    if (x < 1)
+        fun_l22_n4(x)
+    else
+        fun_l22_n359(x)
+    end
+end
+
+def fun_l21_n443(x)
+    if (x < 1)
+        fun_l22_n269(x)
+    else
+        fun_l22_n417(x)
+    end
+end
+
+def fun_l21_n444(x)
+    if (x < 1)
+        fun_l22_n809(x)
+    else
+        fun_l22_n430(x)
+    end
+end
+
+def fun_l21_n445(x)
+    if (x < 1)
+        fun_l22_n428(x)
+    else
+        fun_l22_n55(x)
+    end
+end
+
+def fun_l21_n446(x)
+    if (x < 1)
+        fun_l22_n265(x)
+    else
+        fun_l22_n394(x)
+    end
+end
+
+def fun_l21_n447(x)
+    if (x < 1)
+        fun_l22_n885(x)
+    else
+        fun_l22_n139(x)
+    end
+end
+
+def fun_l21_n448(x)
+    if (x < 1)
+        fun_l22_n219(x)
+    else
+        fun_l22_n578(x)
+    end
+end
+
+def fun_l21_n449(x)
+    if (x < 1)
+        fun_l22_n458(x)
+    else
+        fun_l22_n226(x)
+    end
+end
+
+def fun_l21_n450(x)
+    if (x < 1)
+        fun_l22_n128(x)
+    else
+        fun_l22_n790(x)
+    end
+end
+
+def fun_l21_n451(x)
+    if (x < 1)
+        fun_l22_n134(x)
+    else
+        fun_l22_n471(x)
+    end
+end
+
+def fun_l21_n452(x)
+    if (x < 1)
+        fun_l22_n180(x)
+    else
+        fun_l22_n183(x)
+    end
+end
+
+def fun_l21_n453(x)
+    if (x < 1)
+        fun_l22_n823(x)
+    else
+        fun_l22_n667(x)
+    end
+end
+
+def fun_l21_n454(x)
+    if (x < 1)
+        fun_l22_n324(x)
+    else
+        fun_l22_n487(x)
+    end
+end
+
+def fun_l21_n455(x)
+    if (x < 1)
+        fun_l22_n341(x)
+    else
+        fun_l22_n784(x)
+    end
+end
+
+def fun_l21_n456(x)
+    if (x < 1)
+        fun_l22_n32(x)
+    else
+        fun_l22_n227(x)
+    end
+end
+
+def fun_l21_n457(x)
+    if (x < 1)
+        fun_l22_n567(x)
+    else
+        fun_l22_n774(x)
+    end
+end
+
+def fun_l21_n458(x)
+    if (x < 1)
+        fun_l22_n342(x)
+    else
+        fun_l22_n126(x)
+    end
+end
+
+def fun_l21_n459(x)
+    if (x < 1)
+        fun_l22_n116(x)
+    else
+        fun_l22_n367(x)
+    end
+end
+
+def fun_l21_n460(x)
+    if (x < 1)
+        fun_l22_n864(x)
+    else
+        fun_l22_n618(x)
+    end
+end
+
+def fun_l21_n461(x)
+    if (x < 1)
+        fun_l22_n823(x)
+    else
+        fun_l22_n799(x)
+    end
+end
+
+def fun_l21_n462(x)
+    if (x < 1)
+        fun_l22_n684(x)
+    else
+        fun_l22_n758(x)
+    end
+end
+
+def fun_l21_n463(x)
+    if (x < 1)
+        fun_l22_n662(x)
+    else
+        fun_l22_n514(x)
+    end
+end
+
+def fun_l21_n464(x)
+    if (x < 1)
+        fun_l22_n736(x)
+    else
+        fun_l22_n794(x)
+    end
+end
+
+def fun_l21_n465(x)
+    if (x < 1)
+        fun_l22_n200(x)
+    else
+        fun_l22_n565(x)
+    end
+end
+
+def fun_l21_n466(x)
+    if (x < 1)
+        fun_l22_n787(x)
+    else
+        fun_l22_n835(x)
+    end
+end
+
+def fun_l21_n467(x)
+    if (x < 1)
+        fun_l22_n927(x)
+    else
+        fun_l22_n399(x)
+    end
+end
+
+def fun_l21_n468(x)
+    if (x < 1)
+        fun_l22_n102(x)
+    else
+        fun_l22_n738(x)
+    end
+end
+
+def fun_l21_n469(x)
+    if (x < 1)
+        fun_l22_n833(x)
+    else
+        fun_l22_n917(x)
+    end
+end
+
+def fun_l21_n470(x)
+    if (x < 1)
+        fun_l22_n422(x)
+    else
+        fun_l22_n108(x)
+    end
+end
+
+def fun_l21_n471(x)
+    if (x < 1)
+        fun_l22_n884(x)
+    else
+        fun_l22_n19(x)
+    end
+end
+
+def fun_l21_n472(x)
+    if (x < 1)
+        fun_l22_n849(x)
+    else
+        fun_l22_n251(x)
+    end
+end
+
+def fun_l21_n473(x)
+    if (x < 1)
+        fun_l22_n636(x)
+    else
+        fun_l22_n439(x)
+    end
+end
+
+def fun_l21_n474(x)
+    if (x < 1)
+        fun_l22_n867(x)
+    else
+        fun_l22_n227(x)
+    end
+end
+
+def fun_l21_n475(x)
+    if (x < 1)
+        fun_l22_n809(x)
+    else
+        fun_l22_n548(x)
+    end
+end
+
+def fun_l21_n476(x)
+    if (x < 1)
+        fun_l22_n213(x)
+    else
+        fun_l22_n607(x)
+    end
+end
+
+def fun_l21_n477(x)
+    if (x < 1)
+        fun_l22_n44(x)
+    else
+        fun_l22_n38(x)
+    end
+end
+
+def fun_l21_n478(x)
+    if (x < 1)
+        fun_l22_n400(x)
+    else
+        fun_l22_n436(x)
+    end
+end
+
+def fun_l21_n479(x)
+    if (x < 1)
+        fun_l22_n701(x)
+    else
+        fun_l22_n84(x)
+    end
+end
+
+def fun_l21_n480(x)
+    if (x < 1)
+        fun_l22_n21(x)
+    else
+        fun_l22_n215(x)
+    end
+end
+
+def fun_l21_n481(x)
+    if (x < 1)
+        fun_l22_n27(x)
+    else
+        fun_l22_n198(x)
+    end
+end
+
+def fun_l21_n482(x)
+    if (x < 1)
+        fun_l22_n803(x)
+    else
+        fun_l22_n82(x)
+    end
+end
+
+def fun_l21_n483(x)
+    if (x < 1)
+        fun_l22_n490(x)
+    else
+        fun_l22_n126(x)
+    end
+end
+
+def fun_l21_n484(x)
+    if (x < 1)
+        fun_l22_n348(x)
+    else
+        fun_l22_n586(x)
+    end
+end
+
+def fun_l21_n485(x)
+    if (x < 1)
+        fun_l22_n279(x)
+    else
+        fun_l22_n266(x)
+    end
+end
+
+def fun_l21_n486(x)
+    if (x < 1)
+        fun_l22_n398(x)
+    else
+        fun_l22_n26(x)
+    end
+end
+
+def fun_l21_n487(x)
+    if (x < 1)
+        fun_l22_n529(x)
+    else
+        fun_l22_n972(x)
+    end
+end
+
+def fun_l21_n488(x)
+    if (x < 1)
+        fun_l22_n390(x)
+    else
+        fun_l22_n220(x)
+    end
+end
+
+def fun_l21_n489(x)
+    if (x < 1)
+        fun_l22_n909(x)
+    else
+        fun_l22_n777(x)
+    end
+end
+
+def fun_l21_n490(x)
+    if (x < 1)
+        fun_l22_n797(x)
+    else
+        fun_l22_n643(x)
+    end
+end
+
+def fun_l21_n491(x)
+    if (x < 1)
+        fun_l22_n920(x)
+    else
+        fun_l22_n820(x)
+    end
+end
+
+def fun_l21_n492(x)
+    if (x < 1)
+        fun_l22_n170(x)
+    else
+        fun_l22_n236(x)
+    end
+end
+
+def fun_l21_n493(x)
+    if (x < 1)
+        fun_l22_n352(x)
+    else
+        fun_l22_n147(x)
+    end
+end
+
+def fun_l21_n494(x)
+    if (x < 1)
+        fun_l22_n938(x)
+    else
+        fun_l22_n83(x)
+    end
+end
+
+def fun_l21_n495(x)
+    if (x < 1)
+        fun_l22_n512(x)
+    else
+        fun_l22_n798(x)
+    end
+end
+
+def fun_l21_n496(x)
+    if (x < 1)
+        fun_l22_n254(x)
+    else
+        fun_l22_n827(x)
+    end
+end
+
+def fun_l21_n497(x)
+    if (x < 1)
+        fun_l22_n730(x)
+    else
+        fun_l22_n995(x)
+    end
+end
+
+def fun_l21_n498(x)
+    if (x < 1)
+        fun_l22_n130(x)
+    else
+        fun_l22_n269(x)
+    end
+end
+
+def fun_l21_n499(x)
+    if (x < 1)
+        fun_l22_n275(x)
+    else
+        fun_l22_n176(x)
+    end
+end
+
+def fun_l21_n500(x)
+    if (x < 1)
+        fun_l22_n493(x)
+    else
+        fun_l22_n322(x)
+    end
+end
+
+def fun_l21_n501(x)
+    if (x < 1)
+        fun_l22_n421(x)
+    else
+        fun_l22_n859(x)
+    end
+end
+
+def fun_l21_n502(x)
+    if (x < 1)
+        fun_l22_n611(x)
+    else
+        fun_l22_n727(x)
+    end
+end
+
+def fun_l21_n503(x)
+    if (x < 1)
+        fun_l22_n42(x)
+    else
+        fun_l22_n294(x)
+    end
+end
+
+def fun_l21_n504(x)
+    if (x < 1)
+        fun_l22_n735(x)
+    else
+        fun_l22_n145(x)
+    end
+end
+
+def fun_l21_n505(x)
+    if (x < 1)
+        fun_l22_n865(x)
+    else
+        fun_l22_n225(x)
+    end
+end
+
+def fun_l21_n506(x)
+    if (x < 1)
+        fun_l22_n922(x)
+    else
+        fun_l22_n619(x)
+    end
+end
+
+def fun_l21_n507(x)
+    if (x < 1)
+        fun_l22_n646(x)
+    else
+        fun_l22_n145(x)
+    end
+end
+
+def fun_l21_n508(x)
+    if (x < 1)
+        fun_l22_n608(x)
+    else
+        fun_l22_n320(x)
+    end
+end
+
+def fun_l21_n509(x)
+    if (x < 1)
+        fun_l22_n624(x)
+    else
+        fun_l22_n984(x)
+    end
+end
+
+def fun_l21_n510(x)
+    if (x < 1)
+        fun_l22_n454(x)
+    else
+        fun_l22_n988(x)
+    end
+end
+
+def fun_l21_n511(x)
+    if (x < 1)
+        fun_l22_n593(x)
+    else
+        fun_l22_n796(x)
+    end
+end
+
+def fun_l21_n512(x)
+    if (x < 1)
+        fun_l22_n922(x)
+    else
+        fun_l22_n5(x)
+    end
+end
+
+def fun_l21_n513(x)
+    if (x < 1)
+        fun_l22_n0(x)
+    else
+        fun_l22_n338(x)
+    end
+end
+
+def fun_l21_n514(x)
+    if (x < 1)
+        fun_l22_n454(x)
+    else
+        fun_l22_n743(x)
+    end
+end
+
+def fun_l21_n515(x)
+    if (x < 1)
+        fun_l22_n215(x)
+    else
+        fun_l22_n689(x)
+    end
+end
+
+def fun_l21_n516(x)
+    if (x < 1)
+        fun_l22_n148(x)
+    else
+        fun_l22_n850(x)
+    end
+end
+
+def fun_l21_n517(x)
+    if (x < 1)
+        fun_l22_n466(x)
+    else
+        fun_l22_n529(x)
+    end
+end
+
+def fun_l21_n518(x)
+    if (x < 1)
+        fun_l22_n967(x)
+    else
+        fun_l22_n790(x)
+    end
+end
+
+def fun_l21_n519(x)
+    if (x < 1)
+        fun_l22_n97(x)
+    else
+        fun_l22_n461(x)
+    end
+end
+
+def fun_l21_n520(x)
+    if (x < 1)
+        fun_l22_n106(x)
+    else
+        fun_l22_n41(x)
+    end
+end
+
+def fun_l21_n521(x)
+    if (x < 1)
+        fun_l22_n561(x)
+    else
+        fun_l22_n428(x)
+    end
+end
+
+def fun_l21_n522(x)
+    if (x < 1)
+        fun_l22_n816(x)
+    else
+        fun_l22_n42(x)
+    end
+end
+
+def fun_l21_n523(x)
+    if (x < 1)
+        fun_l22_n229(x)
+    else
+        fun_l22_n720(x)
+    end
+end
+
+def fun_l21_n524(x)
+    if (x < 1)
+        fun_l22_n341(x)
+    else
+        fun_l22_n875(x)
+    end
+end
+
+def fun_l21_n525(x)
+    if (x < 1)
+        fun_l22_n23(x)
+    else
+        fun_l22_n227(x)
+    end
+end
+
+def fun_l21_n526(x)
+    if (x < 1)
+        fun_l22_n230(x)
+    else
+        fun_l22_n655(x)
+    end
+end
+
+def fun_l21_n527(x)
+    if (x < 1)
+        fun_l22_n19(x)
+    else
+        fun_l22_n957(x)
+    end
+end
+
+def fun_l21_n528(x)
+    if (x < 1)
+        fun_l22_n680(x)
+    else
+        fun_l22_n142(x)
+    end
+end
+
+def fun_l21_n529(x)
+    if (x < 1)
+        fun_l22_n994(x)
+    else
+        fun_l22_n674(x)
+    end
+end
+
+def fun_l21_n530(x)
+    if (x < 1)
+        fun_l22_n762(x)
+    else
+        fun_l22_n10(x)
+    end
+end
+
+def fun_l21_n531(x)
+    if (x < 1)
+        fun_l22_n75(x)
+    else
+        fun_l22_n43(x)
+    end
+end
+
+def fun_l21_n532(x)
+    if (x < 1)
+        fun_l22_n481(x)
+    else
+        fun_l22_n766(x)
+    end
+end
+
+def fun_l21_n533(x)
+    if (x < 1)
+        fun_l22_n261(x)
+    else
+        fun_l22_n256(x)
+    end
+end
+
+def fun_l21_n534(x)
+    if (x < 1)
+        fun_l22_n316(x)
+    else
+        fun_l22_n547(x)
+    end
+end
+
+def fun_l21_n535(x)
+    if (x < 1)
+        fun_l22_n304(x)
+    else
+        fun_l22_n392(x)
+    end
+end
+
+def fun_l21_n536(x)
+    if (x < 1)
+        fun_l22_n83(x)
+    else
+        fun_l22_n789(x)
+    end
+end
+
+def fun_l21_n537(x)
+    if (x < 1)
+        fun_l22_n434(x)
+    else
+        fun_l22_n783(x)
+    end
+end
+
+def fun_l21_n538(x)
+    if (x < 1)
+        fun_l22_n445(x)
+    else
+        fun_l22_n960(x)
+    end
+end
+
+def fun_l21_n539(x)
+    if (x < 1)
+        fun_l22_n398(x)
+    else
+        fun_l22_n529(x)
+    end
+end
+
+def fun_l21_n540(x)
+    if (x < 1)
+        fun_l22_n413(x)
+    else
+        fun_l22_n684(x)
+    end
+end
+
+def fun_l21_n541(x)
+    if (x < 1)
+        fun_l22_n812(x)
+    else
+        fun_l22_n257(x)
+    end
+end
+
+def fun_l21_n542(x)
+    if (x < 1)
+        fun_l22_n186(x)
+    else
+        fun_l22_n35(x)
+    end
+end
+
+def fun_l21_n543(x)
+    if (x < 1)
+        fun_l22_n489(x)
+    else
+        fun_l22_n93(x)
+    end
+end
+
+def fun_l21_n544(x)
+    if (x < 1)
+        fun_l22_n105(x)
+    else
+        fun_l22_n282(x)
+    end
+end
+
+def fun_l21_n545(x)
+    if (x < 1)
+        fun_l22_n586(x)
+    else
+        fun_l22_n614(x)
+    end
+end
+
+def fun_l21_n546(x)
+    if (x < 1)
+        fun_l22_n75(x)
+    else
+        fun_l22_n589(x)
+    end
+end
+
+def fun_l21_n547(x)
+    if (x < 1)
+        fun_l22_n128(x)
+    else
+        fun_l22_n552(x)
+    end
+end
+
+def fun_l21_n548(x)
+    if (x < 1)
+        fun_l22_n961(x)
+    else
+        fun_l22_n209(x)
+    end
+end
+
+def fun_l21_n549(x)
+    if (x < 1)
+        fun_l22_n727(x)
+    else
+        fun_l22_n615(x)
+    end
+end
+
+def fun_l21_n550(x)
+    if (x < 1)
+        fun_l22_n45(x)
+    else
+        fun_l22_n161(x)
+    end
+end
+
+def fun_l21_n551(x)
+    if (x < 1)
+        fun_l22_n480(x)
+    else
+        fun_l22_n852(x)
+    end
+end
+
+def fun_l21_n552(x)
+    if (x < 1)
+        fun_l22_n383(x)
+    else
+        fun_l22_n698(x)
+    end
+end
+
+def fun_l21_n553(x)
+    if (x < 1)
+        fun_l22_n805(x)
+    else
+        fun_l22_n309(x)
+    end
+end
+
+def fun_l21_n554(x)
+    if (x < 1)
+        fun_l22_n635(x)
+    else
+        fun_l22_n821(x)
+    end
+end
+
+def fun_l21_n555(x)
+    if (x < 1)
+        fun_l22_n616(x)
+    else
+        fun_l22_n52(x)
+    end
+end
+
+def fun_l21_n556(x)
+    if (x < 1)
+        fun_l22_n283(x)
+    else
+        fun_l22_n514(x)
+    end
+end
+
+def fun_l21_n557(x)
+    if (x < 1)
+        fun_l22_n6(x)
+    else
+        fun_l22_n174(x)
+    end
+end
+
+def fun_l21_n558(x)
+    if (x < 1)
+        fun_l22_n344(x)
+    else
+        fun_l22_n932(x)
+    end
+end
+
+def fun_l21_n559(x)
+    if (x < 1)
+        fun_l22_n287(x)
+    else
+        fun_l22_n98(x)
+    end
+end
+
+def fun_l21_n560(x)
+    if (x < 1)
+        fun_l22_n510(x)
+    else
+        fun_l22_n672(x)
+    end
+end
+
+def fun_l21_n561(x)
+    if (x < 1)
+        fun_l22_n951(x)
+    else
+        fun_l22_n984(x)
+    end
+end
+
+def fun_l21_n562(x)
+    if (x < 1)
+        fun_l22_n133(x)
+    else
+        fun_l22_n207(x)
+    end
+end
+
+def fun_l21_n563(x)
+    if (x < 1)
+        fun_l22_n780(x)
+    else
+        fun_l22_n402(x)
+    end
+end
+
+def fun_l21_n564(x)
+    if (x < 1)
+        fun_l22_n783(x)
+    else
+        fun_l22_n189(x)
+    end
+end
+
+def fun_l21_n565(x)
+    if (x < 1)
+        fun_l22_n736(x)
+    else
+        fun_l22_n590(x)
+    end
+end
+
+def fun_l21_n566(x)
+    if (x < 1)
+        fun_l22_n724(x)
+    else
+        fun_l22_n69(x)
+    end
+end
+
+def fun_l21_n567(x)
+    if (x < 1)
+        fun_l22_n521(x)
+    else
+        fun_l22_n242(x)
+    end
+end
+
+def fun_l21_n568(x)
+    if (x < 1)
+        fun_l22_n440(x)
+    else
+        fun_l22_n156(x)
+    end
+end
+
+def fun_l21_n569(x)
+    if (x < 1)
+        fun_l22_n776(x)
+    else
+        fun_l22_n456(x)
+    end
+end
+
+def fun_l21_n570(x)
+    if (x < 1)
+        fun_l22_n336(x)
+    else
+        fun_l22_n615(x)
+    end
+end
+
+def fun_l21_n571(x)
+    if (x < 1)
+        fun_l22_n775(x)
+    else
+        fun_l22_n585(x)
+    end
+end
+
+def fun_l21_n572(x)
+    if (x < 1)
+        fun_l22_n466(x)
+    else
+        fun_l22_n559(x)
+    end
+end
+
+def fun_l21_n573(x)
+    if (x < 1)
+        fun_l22_n609(x)
+    else
+        fun_l22_n177(x)
+    end
+end
+
+def fun_l21_n574(x)
+    if (x < 1)
+        fun_l22_n310(x)
+    else
+        fun_l22_n190(x)
+    end
+end
+
+def fun_l21_n575(x)
+    if (x < 1)
+        fun_l22_n861(x)
+    else
+        fun_l22_n289(x)
+    end
+end
+
+def fun_l21_n576(x)
+    if (x < 1)
+        fun_l22_n978(x)
+    else
+        fun_l22_n460(x)
+    end
+end
+
+def fun_l21_n577(x)
+    if (x < 1)
+        fun_l22_n440(x)
+    else
+        fun_l22_n816(x)
+    end
+end
+
+def fun_l21_n578(x)
+    if (x < 1)
+        fun_l22_n522(x)
+    else
+        fun_l22_n214(x)
+    end
+end
+
+def fun_l21_n579(x)
+    if (x < 1)
+        fun_l22_n38(x)
+    else
+        fun_l22_n166(x)
+    end
+end
+
+def fun_l21_n580(x)
+    if (x < 1)
+        fun_l22_n114(x)
+    else
+        fun_l22_n314(x)
+    end
+end
+
+def fun_l21_n581(x)
+    if (x < 1)
+        fun_l22_n233(x)
+    else
+        fun_l22_n840(x)
+    end
+end
+
+def fun_l21_n582(x)
+    if (x < 1)
+        fun_l22_n867(x)
+    else
+        fun_l22_n213(x)
+    end
+end
+
+def fun_l21_n583(x)
+    if (x < 1)
+        fun_l22_n742(x)
+    else
+        fun_l22_n798(x)
+    end
+end
+
+def fun_l21_n584(x)
+    if (x < 1)
+        fun_l22_n772(x)
+    else
+        fun_l22_n400(x)
+    end
+end
+
+def fun_l21_n585(x)
+    if (x < 1)
+        fun_l22_n564(x)
+    else
+        fun_l22_n70(x)
+    end
+end
+
+def fun_l21_n586(x)
+    if (x < 1)
+        fun_l22_n836(x)
+    else
+        fun_l22_n188(x)
+    end
+end
+
+def fun_l21_n587(x)
+    if (x < 1)
+        fun_l22_n624(x)
+    else
+        fun_l22_n923(x)
+    end
+end
+
+def fun_l21_n588(x)
+    if (x < 1)
+        fun_l22_n265(x)
+    else
+        fun_l22_n733(x)
+    end
+end
+
+def fun_l21_n589(x)
+    if (x < 1)
+        fun_l22_n545(x)
+    else
+        fun_l22_n399(x)
+    end
+end
+
+def fun_l21_n590(x)
+    if (x < 1)
+        fun_l22_n22(x)
+    else
+        fun_l22_n266(x)
+    end
+end
+
+def fun_l21_n591(x)
+    if (x < 1)
+        fun_l22_n504(x)
+    else
+        fun_l22_n798(x)
+    end
+end
+
+def fun_l21_n592(x)
+    if (x < 1)
+        fun_l22_n979(x)
+    else
+        fun_l22_n712(x)
+    end
+end
+
+def fun_l21_n593(x)
+    if (x < 1)
+        fun_l22_n343(x)
+    else
+        fun_l22_n54(x)
+    end
+end
+
+def fun_l21_n594(x)
+    if (x < 1)
+        fun_l22_n893(x)
+    else
+        fun_l22_n465(x)
+    end
+end
+
+def fun_l21_n595(x)
+    if (x < 1)
+        fun_l22_n28(x)
+    else
+        fun_l22_n162(x)
+    end
+end
+
+def fun_l21_n596(x)
+    if (x < 1)
+        fun_l22_n609(x)
+    else
+        fun_l22_n882(x)
+    end
+end
+
+def fun_l21_n597(x)
+    if (x < 1)
+        fun_l22_n575(x)
+    else
+        fun_l22_n951(x)
+    end
+end
+
+def fun_l21_n598(x)
+    if (x < 1)
+        fun_l22_n794(x)
+    else
+        fun_l22_n767(x)
+    end
+end
+
+def fun_l21_n599(x)
+    if (x < 1)
+        fun_l22_n605(x)
+    else
+        fun_l22_n141(x)
+    end
+end
+
+def fun_l21_n600(x)
+    if (x < 1)
+        fun_l22_n54(x)
+    else
+        fun_l22_n958(x)
+    end
+end
+
+def fun_l21_n601(x)
+    if (x < 1)
+        fun_l22_n506(x)
+    else
+        fun_l22_n269(x)
+    end
+end
+
+def fun_l21_n602(x)
+    if (x < 1)
+        fun_l22_n401(x)
+    else
+        fun_l22_n104(x)
+    end
+end
+
+def fun_l21_n603(x)
+    if (x < 1)
+        fun_l22_n379(x)
+    else
+        fun_l22_n489(x)
+    end
+end
+
+def fun_l21_n604(x)
+    if (x < 1)
+        fun_l22_n673(x)
+    else
+        fun_l22_n502(x)
+    end
+end
+
+def fun_l21_n605(x)
+    if (x < 1)
+        fun_l22_n355(x)
+    else
+        fun_l22_n483(x)
+    end
+end
+
+def fun_l21_n606(x)
+    if (x < 1)
+        fun_l22_n763(x)
+    else
+        fun_l22_n160(x)
+    end
+end
+
+def fun_l21_n607(x)
+    if (x < 1)
+        fun_l22_n802(x)
+    else
+        fun_l22_n414(x)
+    end
+end
+
+def fun_l21_n608(x)
+    if (x < 1)
+        fun_l22_n401(x)
+    else
+        fun_l22_n987(x)
+    end
+end
+
+def fun_l21_n609(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n511(x)
+    end
+end
+
+def fun_l21_n610(x)
+    if (x < 1)
+        fun_l22_n883(x)
+    else
+        fun_l22_n73(x)
+    end
+end
+
+def fun_l21_n611(x)
+    if (x < 1)
+        fun_l22_n105(x)
+    else
+        fun_l22_n612(x)
+    end
+end
+
+def fun_l21_n612(x)
+    if (x < 1)
+        fun_l22_n911(x)
+    else
+        fun_l22_n764(x)
+    end
+end
+
+def fun_l21_n613(x)
+    if (x < 1)
+        fun_l22_n818(x)
+    else
+        fun_l22_n43(x)
+    end
+end
+
+def fun_l21_n614(x)
+    if (x < 1)
+        fun_l22_n388(x)
+    else
+        fun_l22_n99(x)
+    end
+end
+
+def fun_l21_n615(x)
+    if (x < 1)
+        fun_l22_n657(x)
+    else
+        fun_l22_n231(x)
+    end
+end
+
+def fun_l21_n616(x)
+    if (x < 1)
+        fun_l22_n937(x)
+    else
+        fun_l22_n357(x)
+    end
+end
+
+def fun_l21_n617(x)
+    if (x < 1)
+        fun_l22_n691(x)
+    else
+        fun_l22_n952(x)
+    end
+end
+
+def fun_l21_n618(x)
+    if (x < 1)
+        fun_l22_n712(x)
+    else
+        fun_l22_n84(x)
+    end
+end
+
+def fun_l21_n619(x)
+    if (x < 1)
+        fun_l22_n483(x)
+    else
+        fun_l22_n506(x)
+    end
+end
+
+def fun_l21_n620(x)
+    if (x < 1)
+        fun_l22_n804(x)
+    else
+        fun_l22_n813(x)
+    end
+end
+
+def fun_l21_n621(x)
+    if (x < 1)
+        fun_l22_n280(x)
+    else
+        fun_l22_n626(x)
+    end
+end
+
+def fun_l21_n622(x)
+    if (x < 1)
+        fun_l22_n979(x)
+    else
+        fun_l22_n508(x)
+    end
+end
+
+def fun_l21_n623(x)
+    if (x < 1)
+        fun_l22_n482(x)
+    else
+        fun_l22_n120(x)
+    end
+end
+
+def fun_l21_n624(x)
+    if (x < 1)
+        fun_l22_n99(x)
+    else
+        fun_l22_n975(x)
+    end
+end
+
+def fun_l21_n625(x)
+    if (x < 1)
+        fun_l22_n540(x)
+    else
+        fun_l22_n68(x)
+    end
+end
+
+def fun_l21_n626(x)
+    if (x < 1)
+        fun_l22_n818(x)
+    else
+        fun_l22_n591(x)
+    end
+end
+
+def fun_l21_n627(x)
+    if (x < 1)
+        fun_l22_n37(x)
+    else
+        fun_l22_n984(x)
+    end
+end
+
+def fun_l21_n628(x)
+    if (x < 1)
+        fun_l22_n547(x)
+    else
+        fun_l22_n482(x)
+    end
+end
+
+def fun_l21_n629(x)
+    if (x < 1)
+        fun_l22_n851(x)
+    else
+        fun_l22_n335(x)
+    end
+end
+
+def fun_l21_n630(x)
+    if (x < 1)
+        fun_l22_n474(x)
+    else
+        fun_l22_n402(x)
+    end
+end
+
+def fun_l21_n631(x)
+    if (x < 1)
+        fun_l22_n433(x)
+    else
+        fun_l22_n298(x)
+    end
+end
+
+def fun_l21_n632(x)
+    if (x < 1)
+        fun_l22_n376(x)
+    else
+        fun_l22_n898(x)
+    end
+end
+
+def fun_l21_n633(x)
+    if (x < 1)
+        fun_l22_n456(x)
+    else
+        fun_l22_n753(x)
+    end
+end
+
+def fun_l21_n634(x)
+    if (x < 1)
+        fun_l22_n888(x)
+    else
+        fun_l22_n394(x)
+    end
+end
+
+def fun_l21_n635(x)
+    if (x < 1)
+        fun_l22_n555(x)
+    else
+        fun_l22_n69(x)
+    end
+end
+
+def fun_l21_n636(x)
+    if (x < 1)
+        fun_l22_n572(x)
+    else
+        fun_l22_n822(x)
+    end
+end
+
+def fun_l21_n637(x)
+    if (x < 1)
+        fun_l22_n645(x)
+    else
+        fun_l22_n968(x)
+    end
+end
+
+def fun_l21_n638(x)
+    if (x < 1)
+        fun_l22_n406(x)
+    else
+        fun_l22_n318(x)
+    end
+end
+
+def fun_l21_n639(x)
+    if (x < 1)
+        fun_l22_n554(x)
+    else
+        fun_l22_n591(x)
+    end
+end
+
+def fun_l21_n640(x)
+    if (x < 1)
+        fun_l22_n478(x)
+    else
+        fun_l22_n962(x)
+    end
+end
+
+def fun_l21_n641(x)
+    if (x < 1)
+        fun_l22_n688(x)
+    else
+        fun_l22_n305(x)
+    end
+end
+
+def fun_l21_n642(x)
+    if (x < 1)
+        fun_l22_n767(x)
+    else
+        fun_l22_n156(x)
+    end
+end
+
+def fun_l21_n643(x)
+    if (x < 1)
+        fun_l22_n264(x)
+    else
+        fun_l22_n489(x)
+    end
+end
+
+def fun_l21_n644(x)
+    if (x < 1)
+        fun_l22_n678(x)
+    else
+        fun_l22_n196(x)
+    end
+end
+
+def fun_l21_n645(x)
+    if (x < 1)
+        fun_l22_n849(x)
+    else
+        fun_l22_n488(x)
+    end
+end
+
+def fun_l21_n646(x)
+    if (x < 1)
+        fun_l22_n837(x)
+    else
+        fun_l22_n274(x)
+    end
+end
+
+def fun_l21_n647(x)
+    if (x < 1)
+        fun_l22_n58(x)
+    else
+        fun_l22_n694(x)
+    end
+end
+
+def fun_l21_n648(x)
+    if (x < 1)
+        fun_l22_n878(x)
+    else
+        fun_l22_n356(x)
+    end
+end
+
+def fun_l21_n649(x)
+    if (x < 1)
+        fun_l22_n945(x)
+    else
+        fun_l22_n28(x)
+    end
+end
+
+def fun_l21_n650(x)
+    if (x < 1)
+        fun_l22_n10(x)
+    else
+        fun_l22_n330(x)
+    end
+end
+
+def fun_l21_n651(x)
+    if (x < 1)
+        fun_l22_n461(x)
+    else
+        fun_l22_n872(x)
+    end
+end
+
+def fun_l21_n652(x)
+    if (x < 1)
+        fun_l22_n860(x)
+    else
+        fun_l22_n358(x)
+    end
+end
+
+def fun_l21_n653(x)
+    if (x < 1)
+        fun_l22_n11(x)
+    else
+        fun_l22_n596(x)
+    end
+end
+
+def fun_l21_n654(x)
+    if (x < 1)
+        fun_l22_n340(x)
+    else
+        fun_l22_n335(x)
+    end
+end
+
+def fun_l21_n655(x)
+    if (x < 1)
+        fun_l22_n259(x)
+    else
+        fun_l22_n642(x)
+    end
+end
+
+def fun_l21_n656(x)
+    if (x < 1)
+        fun_l22_n78(x)
+    else
+        fun_l22_n442(x)
+    end
+end
+
+def fun_l21_n657(x)
+    if (x < 1)
+        fun_l22_n151(x)
+    else
+        fun_l22_n122(x)
+    end
+end
+
+def fun_l21_n658(x)
+    if (x < 1)
+        fun_l22_n440(x)
+    else
+        fun_l22_n940(x)
+    end
+end
+
+def fun_l21_n659(x)
+    if (x < 1)
+        fun_l22_n237(x)
+    else
+        fun_l22_n899(x)
+    end
+end
+
+def fun_l21_n660(x)
+    if (x < 1)
+        fun_l22_n906(x)
+    else
+        fun_l22_n789(x)
+    end
+end
+
+def fun_l21_n661(x)
+    if (x < 1)
+        fun_l22_n812(x)
+    else
+        fun_l22_n492(x)
+    end
+end
+
+def fun_l21_n662(x)
+    if (x < 1)
+        fun_l22_n241(x)
+    else
+        fun_l22_n732(x)
+    end
+end
+
+def fun_l21_n663(x)
+    if (x < 1)
+        fun_l22_n557(x)
+    else
+        fun_l22_n570(x)
+    end
+end
+
+def fun_l21_n664(x)
+    if (x < 1)
+        fun_l22_n928(x)
+    else
+        fun_l22_n943(x)
+    end
+end
+
+def fun_l21_n665(x)
+    if (x < 1)
+        fun_l22_n400(x)
+    else
+        fun_l22_n914(x)
+    end
+end
+
+def fun_l21_n666(x)
+    if (x < 1)
+        fun_l22_n368(x)
+    else
+        fun_l22_n434(x)
+    end
+end
+
+def fun_l21_n667(x)
+    if (x < 1)
+        fun_l22_n827(x)
+    else
+        fun_l22_n213(x)
+    end
+end
+
+def fun_l21_n668(x)
+    if (x < 1)
+        fun_l22_n729(x)
+    else
+        fun_l22_n273(x)
+    end
+end
+
+def fun_l21_n669(x)
+    if (x < 1)
+        fun_l22_n649(x)
+    else
+        fun_l22_n29(x)
+    end
+end
+
+def fun_l21_n670(x)
+    if (x < 1)
+        fun_l22_n878(x)
+    else
+        fun_l22_n794(x)
+    end
+end
+
+def fun_l21_n671(x)
+    if (x < 1)
+        fun_l22_n474(x)
+    else
+        fun_l22_n960(x)
+    end
+end
+
+def fun_l21_n672(x)
+    if (x < 1)
+        fun_l22_n250(x)
+    else
+        fun_l22_n935(x)
+    end
+end
+
+def fun_l21_n673(x)
+    if (x < 1)
+        fun_l22_n766(x)
+    else
+        fun_l22_n325(x)
+    end
+end
+
+def fun_l21_n674(x)
+    if (x < 1)
+        fun_l22_n64(x)
+    else
+        fun_l22_n334(x)
+    end
+end
+
+def fun_l21_n675(x)
+    if (x < 1)
+        fun_l22_n737(x)
+    else
+        fun_l22_n983(x)
+    end
+end
+
+def fun_l21_n676(x)
+    if (x < 1)
+        fun_l22_n506(x)
+    else
+        fun_l22_n393(x)
+    end
+end
+
+def fun_l21_n677(x)
+    if (x < 1)
+        fun_l22_n348(x)
+    else
+        fun_l22_n558(x)
+    end
+end
+
+def fun_l21_n678(x)
+    if (x < 1)
+        fun_l22_n68(x)
+    else
+        fun_l22_n483(x)
+    end
+end
+
+def fun_l21_n679(x)
+    if (x < 1)
+        fun_l22_n816(x)
+    else
+        fun_l22_n959(x)
+    end
+end
+
+def fun_l21_n680(x)
+    if (x < 1)
+        fun_l22_n128(x)
+    else
+        fun_l22_n393(x)
+    end
+end
+
+def fun_l21_n681(x)
+    if (x < 1)
+        fun_l22_n738(x)
+    else
+        fun_l22_n609(x)
+    end
+end
+
+def fun_l21_n682(x)
+    if (x < 1)
+        fun_l22_n113(x)
+    else
+        fun_l22_n664(x)
+    end
+end
+
+def fun_l21_n683(x)
+    if (x < 1)
+        fun_l22_n904(x)
+    else
+        fun_l22_n699(x)
+    end
+end
+
+def fun_l21_n684(x)
+    if (x < 1)
+        fun_l22_n759(x)
+    else
+        fun_l22_n277(x)
+    end
+end
+
+def fun_l21_n685(x)
+    if (x < 1)
+        fun_l22_n359(x)
+    else
+        fun_l22_n961(x)
+    end
+end
+
+def fun_l21_n686(x)
+    if (x < 1)
+        fun_l22_n269(x)
+    else
+        fun_l22_n66(x)
+    end
+end
+
+def fun_l21_n687(x)
+    if (x < 1)
+        fun_l22_n510(x)
+    else
+        fun_l22_n935(x)
+    end
+end
+
+def fun_l21_n688(x)
+    if (x < 1)
+        fun_l22_n127(x)
+    else
+        fun_l22_n441(x)
+    end
+end
+
+def fun_l21_n689(x)
+    if (x < 1)
+        fun_l22_n515(x)
+    else
+        fun_l22_n184(x)
+    end
+end
+
+def fun_l21_n690(x)
+    if (x < 1)
+        fun_l22_n339(x)
+    else
+        fun_l22_n121(x)
+    end
+end
+
+def fun_l21_n691(x)
+    if (x < 1)
+        fun_l22_n74(x)
+    else
+        fun_l22_n172(x)
+    end
+end
+
+def fun_l21_n692(x)
+    if (x < 1)
+        fun_l22_n156(x)
+    else
+        fun_l22_n829(x)
+    end
+end
+
+def fun_l21_n693(x)
+    if (x < 1)
+        fun_l22_n761(x)
+    else
+        fun_l22_n322(x)
+    end
+end
+
+def fun_l21_n694(x)
+    if (x < 1)
+        fun_l22_n168(x)
+    else
+        fun_l22_n789(x)
+    end
+end
+
+def fun_l21_n695(x)
+    if (x < 1)
+        fun_l22_n896(x)
+    else
+        fun_l22_n275(x)
+    end
+end
+
+def fun_l21_n696(x)
+    if (x < 1)
+        fun_l22_n283(x)
+    else
+        fun_l22_n195(x)
+    end
+end
+
+def fun_l21_n697(x)
+    if (x < 1)
+        fun_l22_n353(x)
+    else
+        fun_l22_n664(x)
+    end
+end
+
+def fun_l21_n698(x)
+    if (x < 1)
+        fun_l22_n801(x)
+    else
+        fun_l22_n544(x)
+    end
+end
+
+def fun_l21_n699(x)
+    if (x < 1)
+        fun_l22_n729(x)
+    else
+        fun_l22_n323(x)
+    end
+end
+
+def fun_l21_n700(x)
+    if (x < 1)
+        fun_l22_n47(x)
+    else
+        fun_l22_n340(x)
+    end
+end
+
+def fun_l21_n701(x)
+    if (x < 1)
+        fun_l22_n132(x)
+    else
+        fun_l22_n968(x)
+    end
+end
+
+def fun_l21_n702(x)
+    if (x < 1)
+        fun_l22_n556(x)
+    else
+        fun_l22_n23(x)
+    end
+end
+
+def fun_l21_n703(x)
+    if (x < 1)
+        fun_l22_n274(x)
+    else
+        fun_l22_n276(x)
+    end
+end
+
+def fun_l21_n704(x)
+    if (x < 1)
+        fun_l22_n152(x)
+    else
+        fun_l22_n244(x)
+    end
+end
+
+def fun_l21_n705(x)
+    if (x < 1)
+        fun_l22_n508(x)
+    else
+        fun_l22_n350(x)
+    end
+end
+
+def fun_l21_n706(x)
+    if (x < 1)
+        fun_l22_n188(x)
+    else
+        fun_l22_n60(x)
+    end
+end
+
+def fun_l21_n707(x)
+    if (x < 1)
+        fun_l22_n970(x)
+    else
+        fun_l22_n55(x)
+    end
+end
+
+def fun_l21_n708(x)
+    if (x < 1)
+        fun_l22_n840(x)
+    else
+        fun_l22_n990(x)
+    end
+end
+
+def fun_l21_n709(x)
+    if (x < 1)
+        fun_l22_n466(x)
+    else
+        fun_l22_n25(x)
+    end
+end
+
+def fun_l21_n710(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n481(x)
+    end
+end
+
+def fun_l21_n711(x)
+    if (x < 1)
+        fun_l22_n859(x)
+    else
+        fun_l22_n58(x)
+    end
+end
+
+def fun_l21_n712(x)
+    if (x < 1)
+        fun_l22_n282(x)
+    else
+        fun_l22_n807(x)
+    end
+end
+
+def fun_l21_n713(x)
+    if (x < 1)
+        fun_l22_n387(x)
+    else
+        fun_l22_n235(x)
+    end
+end
+
+def fun_l21_n714(x)
+    if (x < 1)
+        fun_l22_n558(x)
+    else
+        fun_l22_n494(x)
+    end
+end
+
+def fun_l21_n715(x)
+    if (x < 1)
+        fun_l22_n613(x)
+    else
+        fun_l22_n194(x)
+    end
+end
+
+def fun_l21_n716(x)
+    if (x < 1)
+        fun_l22_n120(x)
+    else
+        fun_l22_n154(x)
+    end
+end
+
+def fun_l21_n717(x)
+    if (x < 1)
+        fun_l22_n501(x)
+    else
+        fun_l22_n540(x)
+    end
+end
+
+def fun_l21_n718(x)
+    if (x < 1)
+        fun_l22_n283(x)
+    else
+        fun_l22_n102(x)
+    end
+end
+
+def fun_l21_n719(x)
+    if (x < 1)
+        fun_l22_n569(x)
+    else
+        fun_l22_n407(x)
+    end
+end
+
+def fun_l21_n720(x)
+    if (x < 1)
+        fun_l22_n86(x)
+    else
+        fun_l22_n99(x)
+    end
+end
+
+def fun_l21_n721(x)
+    if (x < 1)
+        fun_l22_n872(x)
+    else
+        fun_l22_n331(x)
+    end
+end
+
+def fun_l21_n722(x)
+    if (x < 1)
+        fun_l22_n772(x)
+    else
+        fun_l22_n57(x)
+    end
+end
+
+def fun_l21_n723(x)
+    if (x < 1)
+        fun_l22_n396(x)
+    else
+        fun_l22_n534(x)
+    end
+end
+
+def fun_l21_n724(x)
+    if (x < 1)
+        fun_l22_n928(x)
+    else
+        fun_l22_n576(x)
+    end
+end
+
+def fun_l21_n725(x)
+    if (x < 1)
+        fun_l22_n650(x)
+    else
+        fun_l22_n790(x)
+    end
+end
+
+def fun_l21_n726(x)
+    if (x < 1)
+        fun_l22_n173(x)
+    else
+        fun_l22_n480(x)
+    end
+end
+
+def fun_l21_n727(x)
+    if (x < 1)
+        fun_l22_n222(x)
+    else
+        fun_l22_n258(x)
+    end
+end
+
+def fun_l21_n728(x)
+    if (x < 1)
+        fun_l22_n797(x)
+    else
+        fun_l22_n793(x)
+    end
+end
+
+def fun_l21_n729(x)
+    if (x < 1)
+        fun_l22_n260(x)
+    else
+        fun_l22_n737(x)
+    end
+end
+
+def fun_l21_n730(x)
+    if (x < 1)
+        fun_l22_n419(x)
+    else
+        fun_l22_n974(x)
+    end
+end
+
+def fun_l21_n731(x)
+    if (x < 1)
+        fun_l22_n837(x)
+    else
+        fun_l22_n628(x)
+    end
+end
+
+def fun_l21_n732(x)
+    if (x < 1)
+        fun_l22_n753(x)
+    else
+        fun_l22_n380(x)
+    end
+end
+
+def fun_l21_n733(x)
+    if (x < 1)
+        fun_l22_n420(x)
+    else
+        fun_l22_n890(x)
+    end
+end
+
+def fun_l21_n734(x)
+    if (x < 1)
+        fun_l22_n993(x)
+    else
+        fun_l22_n172(x)
+    end
+end
+
+def fun_l21_n735(x)
+    if (x < 1)
+        fun_l22_n123(x)
+    else
+        fun_l22_n290(x)
+    end
+end
+
+def fun_l21_n736(x)
+    if (x < 1)
+        fun_l22_n805(x)
+    else
+        fun_l22_n923(x)
+    end
+end
+
+def fun_l21_n737(x)
+    if (x < 1)
+        fun_l22_n124(x)
+    else
+        fun_l22_n25(x)
+    end
+end
+
+def fun_l21_n738(x)
+    if (x < 1)
+        fun_l22_n192(x)
+    else
+        fun_l22_n258(x)
+    end
+end
+
+def fun_l21_n739(x)
+    if (x < 1)
+        fun_l22_n243(x)
+    else
+        fun_l22_n512(x)
+    end
+end
+
+def fun_l21_n740(x)
+    if (x < 1)
+        fun_l22_n577(x)
+    else
+        fun_l22_n307(x)
+    end
+end
+
+def fun_l21_n741(x)
+    if (x < 1)
+        fun_l22_n422(x)
+    else
+        fun_l22_n51(x)
+    end
+end
+
+def fun_l21_n742(x)
+    if (x < 1)
+        fun_l22_n247(x)
+    else
+        fun_l22_n453(x)
+    end
+end
+
+def fun_l21_n743(x)
+    if (x < 1)
+        fun_l22_n369(x)
+    else
+        fun_l22_n564(x)
+    end
+end
+
+def fun_l21_n744(x)
+    if (x < 1)
+        fun_l22_n815(x)
+    else
+        fun_l22_n894(x)
+    end
+end
+
+def fun_l21_n745(x)
+    if (x < 1)
+        fun_l22_n526(x)
+    else
+        fun_l22_n555(x)
+    end
+end
+
+def fun_l21_n746(x)
+    if (x < 1)
+        fun_l22_n281(x)
+    else
+        fun_l22_n121(x)
+    end
+end
+
+def fun_l21_n747(x)
+    if (x < 1)
+        fun_l22_n141(x)
+    else
+        fun_l22_n335(x)
+    end
+end
+
+def fun_l21_n748(x)
+    if (x < 1)
+        fun_l22_n73(x)
+    else
+        fun_l22_n241(x)
+    end
+end
+
+def fun_l21_n749(x)
+    if (x < 1)
+        fun_l22_n201(x)
+    else
+        fun_l22_n650(x)
+    end
+end
+
+def fun_l21_n750(x)
+    if (x < 1)
+        fun_l22_n569(x)
+    else
+        fun_l22_n231(x)
+    end
+end
+
+def fun_l21_n751(x)
+    if (x < 1)
+        fun_l22_n23(x)
+    else
+        fun_l22_n315(x)
+    end
+end
+
+def fun_l21_n752(x)
+    if (x < 1)
+        fun_l22_n951(x)
+    else
+        fun_l22_n697(x)
+    end
+end
+
+def fun_l21_n753(x)
+    if (x < 1)
+        fun_l22_n734(x)
+    else
+        fun_l22_n991(x)
+    end
+end
+
+def fun_l21_n754(x)
+    if (x < 1)
+        fun_l22_n557(x)
+    else
+        fun_l22_n85(x)
+    end
+end
+
+def fun_l21_n755(x)
+    if (x < 1)
+        fun_l22_n213(x)
+    else
+        fun_l22_n918(x)
+    end
+end
+
+def fun_l21_n756(x)
+    if (x < 1)
+        fun_l22_n995(x)
+    else
+        fun_l22_n134(x)
+    end
+end
+
+def fun_l21_n757(x)
+    if (x < 1)
+        fun_l22_n173(x)
+    else
+        fun_l22_n764(x)
+    end
+end
+
+def fun_l21_n758(x)
+    if (x < 1)
+        fun_l22_n503(x)
+    else
+        fun_l22_n370(x)
+    end
+end
+
+def fun_l21_n759(x)
+    if (x < 1)
+        fun_l22_n922(x)
+    else
+        fun_l22_n819(x)
+    end
+end
+
+def fun_l21_n760(x)
+    if (x < 1)
+        fun_l22_n901(x)
+    else
+        fun_l22_n252(x)
+    end
+end
+
+def fun_l21_n761(x)
+    if (x < 1)
+        fun_l22_n928(x)
+    else
+        fun_l22_n958(x)
+    end
+end
+
+def fun_l21_n762(x)
+    if (x < 1)
+        fun_l22_n402(x)
+    else
+        fun_l22_n756(x)
+    end
+end
+
+def fun_l21_n763(x)
+    if (x < 1)
+        fun_l22_n223(x)
+    else
+        fun_l22_n781(x)
+    end
+end
+
+def fun_l21_n764(x)
+    if (x < 1)
+        fun_l22_n692(x)
+    else
+        fun_l22_n893(x)
+    end
+end
+
+def fun_l21_n765(x)
+    if (x < 1)
+        fun_l22_n308(x)
+    else
+        fun_l22_n485(x)
+    end
+end
+
+def fun_l21_n766(x)
+    if (x < 1)
+        fun_l22_n858(x)
+    else
+        fun_l22_n316(x)
+    end
+end
+
+def fun_l21_n767(x)
+    if (x < 1)
+        fun_l22_n546(x)
+    else
+        fun_l22_n793(x)
+    end
+end
+
+def fun_l21_n768(x)
+    if (x < 1)
+        fun_l22_n75(x)
+    else
+        fun_l22_n999(x)
+    end
+end
+
+def fun_l21_n769(x)
+    if (x < 1)
+        fun_l22_n758(x)
+    else
+        fun_l22_n149(x)
+    end
+end
+
+def fun_l21_n770(x)
+    if (x < 1)
+        fun_l22_n801(x)
+    else
+        fun_l22_n594(x)
+    end
+end
+
+def fun_l21_n771(x)
+    if (x < 1)
+        fun_l22_n544(x)
+    else
+        fun_l22_n477(x)
+    end
+end
+
+def fun_l21_n772(x)
+    if (x < 1)
+        fun_l22_n118(x)
+    else
+        fun_l22_n406(x)
+    end
+end
+
+def fun_l21_n773(x)
+    if (x < 1)
+        fun_l22_n741(x)
+    else
+        fun_l22_n539(x)
+    end
+end
+
+def fun_l21_n774(x)
+    if (x < 1)
+        fun_l22_n99(x)
+    else
+        fun_l22_n636(x)
+    end
+end
+
+def fun_l21_n775(x)
+    if (x < 1)
+        fun_l22_n54(x)
+    else
+        fun_l22_n139(x)
+    end
+end
+
+def fun_l21_n776(x)
+    if (x < 1)
+        fun_l22_n990(x)
+    else
+        fun_l22_n518(x)
+    end
+end
+
+def fun_l21_n777(x)
+    if (x < 1)
+        fun_l22_n172(x)
+    else
+        fun_l22_n432(x)
+    end
+end
+
+def fun_l21_n778(x)
+    if (x < 1)
+        fun_l22_n302(x)
+    else
+        fun_l22_n406(x)
+    end
+end
+
+def fun_l21_n779(x)
+    if (x < 1)
+        fun_l22_n199(x)
+    else
+        fun_l22_n198(x)
+    end
+end
+
+def fun_l21_n780(x)
+    if (x < 1)
+        fun_l22_n454(x)
+    else
+        fun_l22_n547(x)
+    end
+end
+
+def fun_l21_n781(x)
+    if (x < 1)
+        fun_l22_n234(x)
+    else
+        fun_l22_n332(x)
+    end
+end
+
+def fun_l21_n782(x)
+    if (x < 1)
+        fun_l22_n693(x)
+    else
+        fun_l22_n800(x)
+    end
+end
+
+def fun_l21_n783(x)
+    if (x < 1)
+        fun_l22_n728(x)
+    else
+        fun_l22_n799(x)
+    end
+end
+
+def fun_l21_n784(x)
+    if (x < 1)
+        fun_l22_n594(x)
+    else
+        fun_l22_n350(x)
+    end
+end
+
+def fun_l21_n785(x)
+    if (x < 1)
+        fun_l22_n695(x)
+    else
+        fun_l22_n596(x)
+    end
+end
+
+def fun_l21_n786(x)
+    if (x < 1)
+        fun_l22_n141(x)
+    else
+        fun_l22_n372(x)
+    end
+end
+
+def fun_l21_n787(x)
+    if (x < 1)
+        fun_l22_n15(x)
+    else
+        fun_l22_n352(x)
+    end
+end
+
+def fun_l21_n788(x)
+    if (x < 1)
+        fun_l22_n769(x)
+    else
+        fun_l22_n62(x)
+    end
+end
+
+def fun_l21_n789(x)
+    if (x < 1)
+        fun_l22_n284(x)
+    else
+        fun_l22_n119(x)
+    end
+end
+
+def fun_l21_n790(x)
+    if (x < 1)
+        fun_l22_n335(x)
+    else
+        fun_l22_n570(x)
+    end
+end
+
+def fun_l21_n791(x)
+    if (x < 1)
+        fun_l22_n779(x)
+    else
+        fun_l22_n104(x)
+    end
+end
+
+def fun_l21_n792(x)
+    if (x < 1)
+        fun_l22_n835(x)
+    else
+        fun_l22_n612(x)
+    end
+end
+
+def fun_l21_n793(x)
+    if (x < 1)
+        fun_l22_n241(x)
+    else
+        fun_l22_n883(x)
+    end
+end
+
+def fun_l21_n794(x)
+    if (x < 1)
+        fun_l22_n957(x)
+    else
+        fun_l22_n357(x)
+    end
+end
+
+def fun_l21_n795(x)
+    if (x < 1)
+        fun_l22_n78(x)
+    else
+        fun_l22_n392(x)
+    end
+end
+
+def fun_l21_n796(x)
+    if (x < 1)
+        fun_l22_n711(x)
+    else
+        fun_l22_n364(x)
+    end
+end
+
+def fun_l21_n797(x)
+    if (x < 1)
+        fun_l22_n909(x)
+    else
+        fun_l22_n77(x)
+    end
+end
+
+def fun_l21_n798(x)
+    if (x < 1)
+        fun_l22_n901(x)
+    else
+        fun_l22_n483(x)
+    end
+end
+
+def fun_l21_n799(x)
+    if (x < 1)
+        fun_l22_n429(x)
+    else
+        fun_l22_n244(x)
+    end
+end
+
+def fun_l21_n800(x)
+    if (x < 1)
+        fun_l22_n394(x)
+    else
+        fun_l22_n652(x)
+    end
+end
+
+def fun_l21_n801(x)
+    if (x < 1)
+        fun_l22_n831(x)
+    else
+        fun_l22_n698(x)
+    end
+end
+
+def fun_l21_n802(x)
+    if (x < 1)
+        fun_l22_n623(x)
+    else
+        fun_l22_n382(x)
+    end
+end
+
+def fun_l21_n803(x)
+    if (x < 1)
+        fun_l22_n803(x)
+    else
+        fun_l22_n370(x)
+    end
+end
+
+def fun_l21_n804(x)
+    if (x < 1)
+        fun_l22_n173(x)
+    else
+        fun_l22_n697(x)
+    end
+end
+
+def fun_l21_n805(x)
+    if (x < 1)
+        fun_l22_n653(x)
+    else
+        fun_l22_n514(x)
+    end
+end
+
+def fun_l21_n806(x)
+    if (x < 1)
+        fun_l22_n703(x)
+    else
+        fun_l22_n642(x)
+    end
+end
+
+def fun_l21_n807(x)
+    if (x < 1)
+        fun_l22_n788(x)
+    else
+        fun_l22_n594(x)
+    end
+end
+
+def fun_l21_n808(x)
+    if (x < 1)
+        fun_l22_n389(x)
+    else
+        fun_l22_n3(x)
+    end
+end
+
+def fun_l21_n809(x)
+    if (x < 1)
+        fun_l22_n548(x)
+    else
+        fun_l22_n338(x)
+    end
+end
+
+def fun_l21_n810(x)
+    if (x < 1)
+        fun_l22_n157(x)
+    else
+        fun_l22_n967(x)
+    end
+end
+
+def fun_l21_n811(x)
+    if (x < 1)
+        fun_l22_n573(x)
+    else
+        fun_l22_n91(x)
+    end
+end
+
+def fun_l21_n812(x)
+    if (x < 1)
+        fun_l22_n594(x)
+    else
+        fun_l22_n240(x)
+    end
+end
+
+def fun_l21_n813(x)
+    if (x < 1)
+        fun_l22_n661(x)
+    else
+        fun_l22_n557(x)
+    end
+end
+
+def fun_l21_n814(x)
+    if (x < 1)
+        fun_l22_n29(x)
+    else
+        fun_l22_n808(x)
+    end
+end
+
+def fun_l21_n815(x)
+    if (x < 1)
+        fun_l22_n212(x)
+    else
+        fun_l22_n592(x)
+    end
+end
+
+def fun_l21_n816(x)
+    if (x < 1)
+        fun_l22_n57(x)
+    else
+        fun_l22_n248(x)
+    end
+end
+
+def fun_l21_n817(x)
+    if (x < 1)
+        fun_l22_n656(x)
+    else
+        fun_l22_n588(x)
+    end
+end
+
+def fun_l21_n818(x)
+    if (x < 1)
+        fun_l22_n949(x)
+    else
+        fun_l22_n284(x)
+    end
+end
+
+def fun_l21_n819(x)
+    if (x < 1)
+        fun_l22_n488(x)
+    else
+        fun_l22_n543(x)
+    end
+end
+
+def fun_l21_n820(x)
+    if (x < 1)
+        fun_l22_n938(x)
+    else
+        fun_l22_n155(x)
+    end
+end
+
+def fun_l21_n821(x)
+    if (x < 1)
+        fun_l22_n4(x)
+    else
+        fun_l22_n888(x)
+    end
+end
+
+def fun_l21_n822(x)
+    if (x < 1)
+        fun_l22_n460(x)
+    else
+        fun_l22_n249(x)
+    end
+end
+
+def fun_l21_n823(x)
+    if (x < 1)
+        fun_l22_n494(x)
+    else
+        fun_l22_n864(x)
+    end
+end
+
+def fun_l21_n824(x)
+    if (x < 1)
+        fun_l22_n239(x)
+    else
+        fun_l22_n305(x)
+    end
+end
+
+def fun_l21_n825(x)
+    if (x < 1)
+        fun_l22_n578(x)
+    else
+        fun_l22_n568(x)
+    end
+end
+
+def fun_l21_n826(x)
+    if (x < 1)
+        fun_l22_n669(x)
+    else
+        fun_l22_n28(x)
+    end
+end
+
+def fun_l21_n827(x)
+    if (x < 1)
+        fun_l22_n928(x)
+    else
+        fun_l22_n43(x)
+    end
+end
+
+def fun_l21_n828(x)
+    if (x < 1)
+        fun_l22_n459(x)
+    else
+        fun_l22_n450(x)
+    end
+end
+
+def fun_l21_n829(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n583(x)
+    end
+end
+
+def fun_l21_n830(x)
+    if (x < 1)
+        fun_l22_n655(x)
+    else
+        fun_l22_n674(x)
+    end
+end
+
+def fun_l21_n831(x)
+    if (x < 1)
+        fun_l22_n551(x)
+    else
+        fun_l22_n367(x)
+    end
+end
+
+def fun_l21_n832(x)
+    if (x < 1)
+        fun_l22_n921(x)
+    else
+        fun_l22_n750(x)
+    end
+end
+
+def fun_l21_n833(x)
+    if (x < 1)
+        fun_l22_n255(x)
+    else
+        fun_l22_n253(x)
+    end
+end
+
+def fun_l21_n834(x)
+    if (x < 1)
+        fun_l22_n873(x)
+    else
+        fun_l22_n84(x)
+    end
+end
+
+def fun_l21_n835(x)
+    if (x < 1)
+        fun_l22_n362(x)
+    else
+        fun_l22_n976(x)
+    end
+end
+
+def fun_l21_n836(x)
+    if (x < 1)
+        fun_l22_n677(x)
+    else
+        fun_l22_n429(x)
+    end
+end
+
+def fun_l21_n837(x)
+    if (x < 1)
+        fun_l22_n78(x)
+    else
+        fun_l22_n782(x)
+    end
+end
+
+def fun_l21_n838(x)
+    if (x < 1)
+        fun_l22_n339(x)
+    else
+        fun_l22_n855(x)
+    end
+end
+
+def fun_l21_n839(x)
+    if (x < 1)
+        fun_l22_n73(x)
+    else
+        fun_l22_n13(x)
+    end
+end
+
+def fun_l21_n840(x)
+    if (x < 1)
+        fun_l22_n788(x)
+    else
+        fun_l22_n701(x)
+    end
+end
+
+def fun_l21_n841(x)
+    if (x < 1)
+        fun_l22_n583(x)
+    else
+        fun_l22_n501(x)
+    end
+end
+
+def fun_l21_n842(x)
+    if (x < 1)
+        fun_l22_n532(x)
+    else
+        fun_l22_n190(x)
+    end
+end
+
+def fun_l21_n843(x)
+    if (x < 1)
+        fun_l22_n206(x)
+    else
+        fun_l22_n718(x)
+    end
+end
+
+def fun_l21_n844(x)
+    if (x < 1)
+        fun_l22_n307(x)
+    else
+        fun_l22_n200(x)
+    end
+end
+
+def fun_l21_n845(x)
+    if (x < 1)
+        fun_l22_n83(x)
+    else
+        fun_l22_n294(x)
+    end
+end
+
+def fun_l21_n846(x)
+    if (x < 1)
+        fun_l22_n157(x)
+    else
+        fun_l22_n225(x)
+    end
+end
+
+def fun_l21_n847(x)
+    if (x < 1)
+        fun_l22_n935(x)
+    else
+        fun_l22_n888(x)
+    end
+end
+
+def fun_l21_n848(x)
+    if (x < 1)
+        fun_l22_n840(x)
+    else
+        fun_l22_n606(x)
+    end
+end
+
+def fun_l21_n849(x)
+    if (x < 1)
+        fun_l22_n214(x)
+    else
+        fun_l22_n198(x)
+    end
+end
+
+def fun_l21_n850(x)
+    if (x < 1)
+        fun_l22_n793(x)
+    else
+        fun_l22_n503(x)
+    end
+end
+
+def fun_l21_n851(x)
+    if (x < 1)
+        fun_l22_n210(x)
+    else
+        fun_l22_n267(x)
+    end
+end
+
+def fun_l21_n852(x)
+    if (x < 1)
+        fun_l22_n558(x)
+    else
+        fun_l22_n226(x)
+    end
+end
+
+def fun_l21_n853(x)
+    if (x < 1)
+        fun_l22_n12(x)
+    else
+        fun_l22_n765(x)
+    end
+end
+
+def fun_l21_n854(x)
+    if (x < 1)
+        fun_l22_n136(x)
+    else
+        fun_l22_n713(x)
+    end
+end
+
+def fun_l21_n855(x)
+    if (x < 1)
+        fun_l22_n638(x)
+    else
+        fun_l22_n999(x)
+    end
+end
+
+def fun_l21_n856(x)
+    if (x < 1)
+        fun_l22_n366(x)
+    else
+        fun_l22_n505(x)
+    end
+end
+
+def fun_l21_n857(x)
+    if (x < 1)
+        fun_l22_n935(x)
+    else
+        fun_l22_n657(x)
+    end
+end
+
+def fun_l21_n858(x)
+    if (x < 1)
+        fun_l22_n4(x)
+    else
+        fun_l22_n732(x)
+    end
+end
+
+def fun_l21_n859(x)
+    if (x < 1)
+        fun_l22_n433(x)
+    else
+        fun_l22_n350(x)
+    end
+end
+
+def fun_l21_n860(x)
+    if (x < 1)
+        fun_l22_n988(x)
+    else
+        fun_l22_n855(x)
+    end
+end
+
+def fun_l21_n861(x)
+    if (x < 1)
+        fun_l22_n906(x)
+    else
+        fun_l22_n118(x)
+    end
+end
+
+def fun_l21_n862(x)
+    if (x < 1)
+        fun_l22_n127(x)
+    else
+        fun_l22_n299(x)
+    end
+end
+
+def fun_l21_n863(x)
+    if (x < 1)
+        fun_l22_n324(x)
+    else
+        fun_l22_n776(x)
+    end
+end
+
+def fun_l21_n864(x)
+    if (x < 1)
+        fun_l22_n208(x)
+    else
+        fun_l22_n827(x)
+    end
+end
+
+def fun_l21_n865(x)
+    if (x < 1)
+        fun_l22_n846(x)
+    else
+        fun_l22_n750(x)
+    end
+end
+
+def fun_l21_n866(x)
+    if (x < 1)
+        fun_l22_n275(x)
+    else
+        fun_l22_n179(x)
+    end
+end
+
+def fun_l21_n867(x)
+    if (x < 1)
+        fun_l22_n234(x)
+    else
+        fun_l22_n809(x)
+    end
+end
+
+def fun_l21_n868(x)
+    if (x < 1)
+        fun_l22_n597(x)
+    else
+        fun_l22_n563(x)
+    end
+end
+
+def fun_l21_n869(x)
+    if (x < 1)
+        fun_l22_n987(x)
+    else
+        fun_l22_n690(x)
+    end
+end
+
+def fun_l21_n870(x)
+    if (x < 1)
+        fun_l22_n176(x)
+    else
+        fun_l22_n991(x)
+    end
+end
+
+def fun_l21_n871(x)
+    if (x < 1)
+        fun_l22_n272(x)
+    else
+        fun_l22_n211(x)
+    end
+end
+
+def fun_l21_n872(x)
+    if (x < 1)
+        fun_l22_n976(x)
+    else
+        fun_l22_n940(x)
+    end
+end
+
+def fun_l21_n873(x)
+    if (x < 1)
+        fun_l22_n871(x)
+    else
+        fun_l22_n866(x)
+    end
+end
+
+def fun_l21_n874(x)
+    if (x < 1)
+        fun_l22_n727(x)
+    else
+        fun_l22_n560(x)
+    end
+end
+
+def fun_l21_n875(x)
+    if (x < 1)
+        fun_l22_n201(x)
+    else
+        fun_l22_n423(x)
+    end
+end
+
+def fun_l21_n876(x)
+    if (x < 1)
+        fun_l22_n245(x)
+    else
+        fun_l22_n33(x)
+    end
+end
+
+def fun_l21_n877(x)
+    if (x < 1)
+        fun_l22_n535(x)
+    else
+        fun_l22_n11(x)
+    end
+end
+
+def fun_l21_n878(x)
+    if (x < 1)
+        fun_l22_n11(x)
+    else
+        fun_l22_n140(x)
+    end
+end
+
+def fun_l21_n879(x)
+    if (x < 1)
+        fun_l22_n757(x)
+    else
+        fun_l22_n64(x)
+    end
+end
+
+def fun_l21_n880(x)
+    if (x < 1)
+        fun_l22_n982(x)
+    else
+        fun_l22_n774(x)
+    end
+end
+
+def fun_l21_n881(x)
+    if (x < 1)
+        fun_l22_n324(x)
+    else
+        fun_l22_n903(x)
+    end
+end
+
+def fun_l21_n882(x)
+    if (x < 1)
+        fun_l22_n257(x)
+    else
+        fun_l22_n232(x)
+    end
+end
+
+def fun_l21_n883(x)
+    if (x < 1)
+        fun_l22_n546(x)
+    else
+        fun_l22_n317(x)
+    end
+end
+
+def fun_l21_n884(x)
+    if (x < 1)
+        fun_l22_n40(x)
+    else
+        fun_l22_n393(x)
+    end
+end
+
+def fun_l21_n885(x)
+    if (x < 1)
+        fun_l22_n281(x)
+    else
+        fun_l22_n572(x)
+    end
+end
+
+def fun_l21_n886(x)
+    if (x < 1)
+        fun_l22_n41(x)
+    else
+        fun_l22_n656(x)
+    end
+end
+
+def fun_l21_n887(x)
+    if (x < 1)
+        fun_l22_n911(x)
+    else
+        fun_l22_n55(x)
+    end
+end
+
+def fun_l21_n888(x)
+    if (x < 1)
+        fun_l22_n555(x)
+    else
+        fun_l22_n60(x)
+    end
+end
+
+def fun_l21_n889(x)
+    if (x < 1)
+        fun_l22_n69(x)
+    else
+        fun_l22_n330(x)
+    end
+end
+
+def fun_l21_n890(x)
+    if (x < 1)
+        fun_l22_n332(x)
+    else
+        fun_l22_n573(x)
+    end
+end
+
+def fun_l21_n891(x)
+    if (x < 1)
+        fun_l22_n529(x)
+    else
+        fun_l22_n555(x)
+    end
+end
+
+def fun_l21_n892(x)
+    if (x < 1)
+        fun_l22_n900(x)
+    else
+        fun_l22_n137(x)
+    end
+end
+
+def fun_l21_n893(x)
+    if (x < 1)
+        fun_l22_n479(x)
+    else
+        fun_l22_n196(x)
+    end
+end
+
+def fun_l21_n894(x)
+    if (x < 1)
+        fun_l22_n418(x)
+    else
+        fun_l22_n124(x)
+    end
+end
+
+def fun_l21_n895(x)
+    if (x < 1)
+        fun_l22_n658(x)
+    else
+        fun_l22_n196(x)
+    end
+end
+
+def fun_l21_n896(x)
+    if (x < 1)
+        fun_l22_n739(x)
+    else
+        fun_l22_n454(x)
+    end
+end
+
+def fun_l21_n897(x)
+    if (x < 1)
+        fun_l22_n716(x)
+    else
+        fun_l22_n150(x)
+    end
+end
+
+def fun_l21_n898(x)
+    if (x < 1)
+        fun_l22_n356(x)
+    else
+        fun_l22_n264(x)
+    end
+end
+
+def fun_l21_n899(x)
+    if (x < 1)
+        fun_l22_n667(x)
+    else
+        fun_l22_n629(x)
+    end
+end
+
+def fun_l21_n900(x)
+    if (x < 1)
+        fun_l22_n879(x)
+    else
+        fun_l22_n237(x)
+    end
+end
+
+def fun_l21_n901(x)
+    if (x < 1)
+        fun_l22_n462(x)
+    else
+        fun_l22_n401(x)
+    end
+end
+
+def fun_l21_n902(x)
+    if (x < 1)
+        fun_l22_n902(x)
+    else
+        fun_l22_n203(x)
+    end
+end
+
+def fun_l21_n903(x)
+    if (x < 1)
+        fun_l22_n802(x)
+    else
+        fun_l22_n383(x)
+    end
+end
+
+def fun_l21_n904(x)
+    if (x < 1)
+        fun_l22_n672(x)
+    else
+        fun_l22_n808(x)
+    end
+end
+
+def fun_l21_n905(x)
+    if (x < 1)
+        fun_l22_n625(x)
+    else
+        fun_l22_n320(x)
+    end
+end
+
+def fun_l21_n906(x)
+    if (x < 1)
+        fun_l22_n963(x)
+    else
+        fun_l22_n101(x)
+    end
+end
+
+def fun_l21_n907(x)
+    if (x < 1)
+        fun_l22_n609(x)
+    else
+        fun_l22_n500(x)
+    end
+end
+
+def fun_l21_n908(x)
+    if (x < 1)
+        fun_l22_n79(x)
+    else
+        fun_l22_n774(x)
+    end
+end
+
+def fun_l21_n909(x)
+    if (x < 1)
+        fun_l22_n152(x)
+    else
+        fun_l22_n245(x)
+    end
+end
+
+def fun_l21_n910(x)
+    if (x < 1)
+        fun_l22_n981(x)
+    else
+        fun_l22_n647(x)
+    end
+end
+
+def fun_l21_n911(x)
+    if (x < 1)
+        fun_l22_n457(x)
+    else
+        fun_l22_n394(x)
+    end
+end
+
+def fun_l21_n912(x)
+    if (x < 1)
+        fun_l22_n516(x)
+    else
+        fun_l22_n411(x)
+    end
+end
+
+def fun_l21_n913(x)
+    if (x < 1)
+        fun_l22_n212(x)
+    else
+        fun_l22_n159(x)
+    end
+end
+
+def fun_l21_n914(x)
+    if (x < 1)
+        fun_l22_n756(x)
+    else
+        fun_l22_n612(x)
+    end
+end
+
+def fun_l21_n915(x)
+    if (x < 1)
+        fun_l22_n78(x)
+    else
+        fun_l22_n387(x)
+    end
+end
+
+def fun_l21_n916(x)
+    if (x < 1)
+        fun_l22_n973(x)
+    else
+        fun_l22_n854(x)
+    end
+end
+
+def fun_l21_n917(x)
+    if (x < 1)
+        fun_l22_n613(x)
+    else
+        fun_l22_n78(x)
+    end
+end
+
+def fun_l21_n918(x)
+    if (x < 1)
+        fun_l22_n199(x)
+    else
+        fun_l22_n637(x)
+    end
+end
+
+def fun_l21_n919(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n804(x)
+    end
+end
+
+def fun_l21_n920(x)
+    if (x < 1)
+        fun_l22_n410(x)
+    else
+        fun_l22_n728(x)
+    end
+end
+
+def fun_l21_n921(x)
+    if (x < 1)
+        fun_l22_n139(x)
+    else
+        fun_l22_n236(x)
+    end
+end
+
+def fun_l21_n922(x)
+    if (x < 1)
+        fun_l22_n443(x)
+    else
+        fun_l22_n683(x)
+    end
+end
+
+def fun_l21_n923(x)
+    if (x < 1)
+        fun_l22_n226(x)
+    else
+        fun_l22_n906(x)
+    end
+end
+
+def fun_l21_n924(x)
+    if (x < 1)
+        fun_l22_n487(x)
+    else
+        fun_l22_n551(x)
+    end
+end
+
+def fun_l21_n925(x)
+    if (x < 1)
+        fun_l22_n143(x)
+    else
+        fun_l22_n932(x)
+    end
+end
+
+def fun_l21_n926(x)
+    if (x < 1)
+        fun_l22_n533(x)
+    else
+        fun_l22_n307(x)
+    end
+end
+
+def fun_l21_n927(x)
+    if (x < 1)
+        fun_l22_n89(x)
+    else
+        fun_l22_n278(x)
+    end
+end
+
+def fun_l21_n928(x)
+    if (x < 1)
+        fun_l22_n802(x)
+    else
+        fun_l22_n18(x)
+    end
+end
+
+def fun_l21_n929(x)
+    if (x < 1)
+        fun_l22_n266(x)
+    else
+        fun_l22_n924(x)
+    end
+end
+
+def fun_l21_n930(x)
+    if (x < 1)
+        fun_l22_n607(x)
+    else
+        fun_l22_n47(x)
+    end
+end
+
+def fun_l21_n931(x)
+    if (x < 1)
+        fun_l22_n241(x)
+    else
+        fun_l22_n983(x)
+    end
+end
+
+def fun_l21_n932(x)
+    if (x < 1)
+        fun_l22_n264(x)
+    else
+        fun_l22_n88(x)
+    end
+end
+
+def fun_l21_n933(x)
+    if (x < 1)
+        fun_l22_n26(x)
+    else
+        fun_l22_n940(x)
+    end
+end
+
+def fun_l21_n934(x)
+    if (x < 1)
+        fun_l22_n688(x)
+    else
+        fun_l22_n248(x)
+    end
+end
+
+def fun_l21_n935(x)
+    if (x < 1)
+        fun_l22_n704(x)
+    else
+        fun_l22_n808(x)
+    end
+end
+
+def fun_l21_n936(x)
+    if (x < 1)
+        fun_l22_n91(x)
+    else
+        fun_l22_n650(x)
+    end
+end
+
+def fun_l21_n937(x)
+    if (x < 1)
+        fun_l22_n308(x)
+    else
+        fun_l22_n389(x)
+    end
+end
+
+def fun_l21_n938(x)
+    if (x < 1)
+        fun_l22_n63(x)
+    else
+        fun_l22_n704(x)
+    end
+end
+
+def fun_l21_n939(x)
+    if (x < 1)
+        fun_l22_n785(x)
+    else
+        fun_l22_n852(x)
+    end
+end
+
+def fun_l21_n940(x)
+    if (x < 1)
+        fun_l22_n515(x)
+    else
+        fun_l22_n148(x)
+    end
+end
+
+def fun_l21_n941(x)
+    if (x < 1)
+        fun_l22_n607(x)
+    else
+        fun_l22_n162(x)
+    end
+end
+
+def fun_l21_n942(x)
+    if (x < 1)
+        fun_l22_n34(x)
+    else
+        fun_l22_n167(x)
+    end
+end
+
+def fun_l21_n943(x)
+    if (x < 1)
+        fun_l22_n239(x)
+    else
+        fun_l22_n100(x)
+    end
+end
+
+def fun_l21_n944(x)
+    if (x < 1)
+        fun_l22_n724(x)
+    else
+        fun_l22_n702(x)
+    end
+end
+
+def fun_l21_n945(x)
+    if (x < 1)
+        fun_l22_n121(x)
+    else
+        fun_l22_n89(x)
+    end
+end
+
+def fun_l21_n946(x)
+    if (x < 1)
+        fun_l22_n699(x)
+    else
+        fun_l22_n410(x)
+    end
+end
+
+def fun_l21_n947(x)
+    if (x < 1)
+        fun_l22_n33(x)
+    else
+        fun_l22_n843(x)
+    end
+end
+
+def fun_l21_n948(x)
+    if (x < 1)
+        fun_l22_n327(x)
+    else
+        fun_l22_n702(x)
+    end
+end
+
+def fun_l21_n949(x)
+    if (x < 1)
+        fun_l22_n191(x)
+    else
+        fun_l22_n137(x)
+    end
+end
+
+def fun_l21_n950(x)
+    if (x < 1)
+        fun_l22_n834(x)
+    else
+        fun_l22_n504(x)
+    end
+end
+
+def fun_l21_n951(x)
+    if (x < 1)
+        fun_l22_n444(x)
+    else
+        fun_l22_n857(x)
+    end
+end
+
+def fun_l21_n952(x)
+    if (x < 1)
+        fun_l22_n961(x)
+    else
+        fun_l22_n817(x)
+    end
+end
+
+def fun_l21_n953(x)
+    if (x < 1)
+        fun_l22_n166(x)
+    else
+        fun_l22_n538(x)
+    end
+end
+
+def fun_l21_n954(x)
+    if (x < 1)
+        fun_l22_n934(x)
+    else
+        fun_l22_n552(x)
+    end
+end
+
+def fun_l21_n955(x)
+    if (x < 1)
+        fun_l22_n144(x)
+    else
+        fun_l22_n814(x)
+    end
+end
+
+def fun_l21_n956(x)
+    if (x < 1)
+        fun_l22_n965(x)
+    else
+        fun_l22_n929(x)
+    end
+end
+
+def fun_l21_n957(x)
+    if (x < 1)
+        fun_l22_n812(x)
+    else
+        fun_l22_n529(x)
+    end
+end
+
+def fun_l21_n958(x)
+    if (x < 1)
+        fun_l22_n625(x)
+    else
+        fun_l22_n974(x)
+    end
+end
+
+def fun_l21_n959(x)
+    if (x < 1)
+        fun_l22_n627(x)
+    else
+        fun_l22_n262(x)
+    end
+end
+
+def fun_l21_n960(x)
+    if (x < 1)
+        fun_l22_n751(x)
+    else
+        fun_l22_n858(x)
+    end
+end
+
+def fun_l21_n961(x)
+    if (x < 1)
+        fun_l22_n819(x)
+    else
+        fun_l22_n408(x)
+    end
+end
+
+def fun_l21_n962(x)
+    if (x < 1)
+        fun_l22_n635(x)
+    else
+        fun_l22_n730(x)
+    end
+end
+
+def fun_l21_n963(x)
+    if (x < 1)
+        fun_l22_n865(x)
+    else
+        fun_l22_n919(x)
+    end
+end
+
+def fun_l21_n964(x)
+    if (x < 1)
+        fun_l22_n368(x)
+    else
+        fun_l22_n912(x)
+    end
+end
+
+def fun_l21_n965(x)
+    if (x < 1)
+        fun_l22_n202(x)
+    else
+        fun_l22_n493(x)
+    end
+end
+
+def fun_l21_n966(x)
+    if (x < 1)
+        fun_l22_n191(x)
+    else
+        fun_l22_n632(x)
+    end
+end
+
+def fun_l21_n967(x)
+    if (x < 1)
+        fun_l22_n96(x)
+    else
+        fun_l22_n329(x)
+    end
+end
+
+def fun_l21_n968(x)
+    if (x < 1)
+        fun_l22_n42(x)
+    else
+        fun_l22_n196(x)
+    end
+end
+
+def fun_l21_n969(x)
+    if (x < 1)
+        fun_l22_n521(x)
+    else
+        fun_l22_n875(x)
+    end
+end
+
+def fun_l21_n970(x)
+    if (x < 1)
+        fun_l22_n202(x)
+    else
+        fun_l22_n373(x)
+    end
+end
+
+def fun_l21_n971(x)
+    if (x < 1)
+        fun_l22_n647(x)
+    else
+        fun_l22_n591(x)
+    end
+end
+
+def fun_l21_n972(x)
+    if (x < 1)
+        fun_l22_n341(x)
+    else
+        fun_l22_n935(x)
+    end
+end
+
+def fun_l21_n973(x)
+    if (x < 1)
+        fun_l22_n151(x)
+    else
+        fun_l22_n396(x)
+    end
+end
+
+def fun_l21_n974(x)
+    if (x < 1)
+        fun_l22_n65(x)
+    else
+        fun_l22_n562(x)
+    end
+end
+
+def fun_l21_n975(x)
+    if (x < 1)
+        fun_l22_n450(x)
+    else
+        fun_l22_n482(x)
+    end
+end
+
+def fun_l21_n976(x)
+    if (x < 1)
+        fun_l22_n179(x)
+    else
+        fun_l22_n838(x)
+    end
+end
+
+def fun_l21_n977(x)
+    if (x < 1)
+        fun_l22_n571(x)
+    else
+        fun_l22_n703(x)
+    end
+end
+
+def fun_l21_n978(x)
+    if (x < 1)
+        fun_l22_n540(x)
+    else
+        fun_l22_n728(x)
+    end
+end
+
+def fun_l21_n979(x)
+    if (x < 1)
+        fun_l22_n170(x)
+    else
+        fun_l22_n487(x)
+    end
+end
+
+def fun_l21_n980(x)
+    if (x < 1)
+        fun_l22_n12(x)
+    else
+        fun_l22_n165(x)
+    end
+end
+
+def fun_l21_n981(x)
+    if (x < 1)
+        fun_l22_n722(x)
+    else
+        fun_l22_n456(x)
+    end
+end
+
+def fun_l21_n982(x)
+    if (x < 1)
+        fun_l22_n313(x)
+    else
+        fun_l22_n175(x)
+    end
+end
+
+def fun_l21_n983(x)
+    if (x < 1)
+        fun_l22_n473(x)
+    else
+        fun_l22_n840(x)
+    end
+end
+
+def fun_l21_n984(x)
+    if (x < 1)
+        fun_l22_n942(x)
+    else
+        fun_l22_n804(x)
+    end
+end
+
+def fun_l21_n985(x)
+    if (x < 1)
+        fun_l22_n116(x)
+    else
+        fun_l22_n117(x)
+    end
+end
+
+def fun_l21_n986(x)
+    if (x < 1)
+        fun_l22_n610(x)
+    else
+        fun_l22_n580(x)
+    end
+end
+
+def fun_l21_n987(x)
+    if (x < 1)
+        fun_l22_n299(x)
+    else
+        fun_l22_n416(x)
+    end
+end
+
+def fun_l21_n988(x)
+    if (x < 1)
+        fun_l22_n507(x)
+    else
+        fun_l22_n995(x)
+    end
+end
+
+def fun_l21_n989(x)
+    if (x < 1)
+        fun_l22_n239(x)
+    else
+        fun_l22_n414(x)
+    end
+end
+
+def fun_l21_n990(x)
+    if (x < 1)
+        fun_l22_n488(x)
+    else
+        fun_l22_n874(x)
+    end
+end
+
+def fun_l21_n991(x)
+    if (x < 1)
+        fun_l22_n586(x)
+    else
+        fun_l22_n88(x)
+    end
+end
+
+def fun_l21_n992(x)
+    if (x < 1)
+        fun_l22_n391(x)
+    else
+        fun_l22_n254(x)
+    end
+end
+
+def fun_l21_n993(x)
+    if (x < 1)
+        fun_l22_n64(x)
+    else
+        fun_l22_n485(x)
+    end
+end
+
+def fun_l21_n994(x)
+    if (x < 1)
+        fun_l22_n507(x)
+    else
+        fun_l22_n266(x)
+    end
+end
+
+def fun_l21_n995(x)
+    if (x < 1)
+        fun_l22_n660(x)
+    else
+        fun_l22_n208(x)
+    end
+end
+
+def fun_l21_n996(x)
+    if (x < 1)
+        fun_l22_n731(x)
+    else
+        fun_l22_n882(x)
+    end
+end
+
+def fun_l21_n997(x)
+    if (x < 1)
+        fun_l22_n283(x)
+    else
+        fun_l22_n719(x)
+    end
+end
+
+def fun_l21_n998(x)
+    if (x < 1)
+        fun_l22_n794(x)
+    else
+        fun_l22_n654(x)
+    end
+end
+
+def fun_l21_n999(x)
+    if (x < 1)
+        fun_l22_n642(x)
+    else
+        fun_l22_n158(x)
+    end
+end
+
+def fun_l22_n0(x)
+    if (x < 1)
+        fun_l23_n423(x)
+    else
+        fun_l23_n28(x)
+    end
+end
+
+def fun_l22_n1(x)
+    if (x < 1)
+        fun_l23_n494(x)
+    else
+        fun_l23_n894(x)
+    end
+end
+
+def fun_l22_n2(x)
+    if (x < 1)
+        fun_l23_n735(x)
+    else
+        fun_l23_n584(x)
+    end
+end
+
+def fun_l22_n3(x)
+    if (x < 1)
+        fun_l23_n982(x)
+    else
+        fun_l23_n790(x)
+    end
+end
+
+def fun_l22_n4(x)
+    if (x < 1)
+        fun_l23_n281(x)
+    else
+        fun_l23_n256(x)
+    end
+end
+
+def fun_l22_n5(x)
+    if (x < 1)
+        fun_l23_n286(x)
+    else
+        fun_l23_n48(x)
+    end
+end
+
+def fun_l22_n6(x)
+    if (x < 1)
+        fun_l23_n982(x)
+    else
+        fun_l23_n731(x)
+    end
+end
+
+def fun_l22_n7(x)
+    if (x < 1)
+        fun_l23_n83(x)
+    else
+        fun_l23_n267(x)
+    end
+end
+
+def fun_l22_n8(x)
+    if (x < 1)
+        fun_l23_n730(x)
+    else
+        fun_l23_n47(x)
+    end
+end
+
+def fun_l22_n9(x)
+    if (x < 1)
+        fun_l23_n106(x)
+    else
+        fun_l23_n125(x)
+    end
+end
+
+def fun_l22_n10(x)
+    if (x < 1)
+        fun_l23_n392(x)
+    else
+        fun_l23_n114(x)
+    end
+end
+
+def fun_l22_n11(x)
+    if (x < 1)
+        fun_l23_n778(x)
+    else
+        fun_l23_n103(x)
+    end
+end
+
+def fun_l22_n12(x)
+    if (x < 1)
+        fun_l23_n145(x)
+    else
+        fun_l23_n449(x)
+    end
+end
+
+def fun_l22_n13(x)
+    if (x < 1)
+        fun_l23_n106(x)
+    else
+        fun_l23_n67(x)
+    end
+end
+
+def fun_l22_n14(x)
+    if (x < 1)
+        fun_l23_n721(x)
+    else
+        fun_l23_n844(x)
+    end
+end
+
+def fun_l22_n15(x)
+    if (x < 1)
+        fun_l23_n411(x)
+    else
+        fun_l23_n479(x)
+    end
+end
+
+def fun_l22_n16(x)
+    if (x < 1)
+        fun_l23_n718(x)
+    else
+        fun_l23_n203(x)
+    end
+end
+
+def fun_l22_n17(x)
+    if (x < 1)
+        fun_l23_n660(x)
+    else
+        fun_l23_n606(x)
+    end
+end
+
+def fun_l22_n18(x)
+    if (x < 1)
+        fun_l23_n225(x)
+    else
+        fun_l23_n310(x)
+    end
+end
+
+def fun_l22_n19(x)
+    if (x < 1)
+        fun_l23_n923(x)
+    else
+        fun_l23_n10(x)
+    end
+end
+
+def fun_l22_n20(x)
+    if (x < 1)
+        fun_l23_n88(x)
+    else
+        fun_l23_n488(x)
+    end
+end
+
+def fun_l22_n21(x)
+    if (x < 1)
+        fun_l23_n986(x)
+    else
+        fun_l23_n123(x)
+    end
+end
+
+def fun_l22_n22(x)
+    if (x < 1)
+        fun_l23_n91(x)
+    else
+        fun_l23_n445(x)
+    end
+end
+
+def fun_l22_n23(x)
+    if (x < 1)
+        fun_l23_n525(x)
+    else
+        fun_l23_n454(x)
+    end
+end
+
+def fun_l22_n24(x)
+    if (x < 1)
+        fun_l23_n55(x)
+    else
+        fun_l23_n540(x)
+    end
+end
+
+def fun_l22_n25(x)
+    if (x < 1)
+        fun_l23_n562(x)
+    else
+        fun_l23_n323(x)
+    end
+end
+
+def fun_l22_n26(x)
+    if (x < 1)
+        fun_l23_n796(x)
+    else
+        fun_l23_n443(x)
+    end
+end
+
+def fun_l22_n27(x)
+    if (x < 1)
+        fun_l23_n421(x)
+    else
+        fun_l23_n654(x)
+    end
+end
+
+def fun_l22_n28(x)
+    if (x < 1)
+        fun_l23_n910(x)
+    else
+        fun_l23_n421(x)
+    end
+end
+
+def fun_l22_n29(x)
+    if (x < 1)
+        fun_l23_n184(x)
+    else
+        fun_l23_n24(x)
+    end
+end
+
+def fun_l22_n30(x)
+    if (x < 1)
+        fun_l23_n803(x)
+    else
+        fun_l23_n375(x)
+    end
+end
+
+def fun_l22_n31(x)
+    if (x < 1)
+        fun_l23_n662(x)
+    else
+        fun_l23_n50(x)
+    end
+end
+
+def fun_l22_n32(x)
+    if (x < 1)
+        fun_l23_n69(x)
+    else
+        fun_l23_n198(x)
+    end
+end
+
+def fun_l22_n33(x)
+    if (x < 1)
+        fun_l23_n465(x)
+    else
+        fun_l23_n979(x)
+    end
+end
+
+def fun_l22_n34(x)
+    if (x < 1)
+        fun_l23_n743(x)
+    else
+        fun_l23_n859(x)
+    end
+end
+
+def fun_l22_n35(x)
+    if (x < 1)
+        fun_l23_n524(x)
+    else
+        fun_l23_n157(x)
+    end
+end
+
+def fun_l22_n36(x)
+    if (x < 1)
+        fun_l23_n530(x)
+    else
+        fun_l23_n938(x)
+    end
+end
+
+def fun_l22_n37(x)
+    if (x < 1)
+        fun_l23_n386(x)
+    else
+        fun_l23_n882(x)
+    end
+end
+
+def fun_l22_n38(x)
+    if (x < 1)
+        fun_l23_n373(x)
+    else
+        fun_l23_n220(x)
+    end
+end
+
+def fun_l22_n39(x)
+    if (x < 1)
+        fun_l23_n783(x)
+    else
+        fun_l23_n731(x)
+    end
+end
+
+def fun_l22_n40(x)
+    if (x < 1)
+        fun_l23_n911(x)
+    else
+        fun_l23_n373(x)
+    end
+end
+
+def fun_l22_n41(x)
+    if (x < 1)
+        fun_l23_n516(x)
+    else
+        fun_l23_n586(x)
+    end
+end
+
+def fun_l22_n42(x)
+    if (x < 1)
+        fun_l23_n40(x)
+    else
+        fun_l23_n350(x)
+    end
+end
+
+def fun_l22_n43(x)
+    if (x < 1)
+        fun_l23_n690(x)
+    else
+        fun_l23_n349(x)
+    end
+end
+
+def fun_l22_n44(x)
+    if (x < 1)
+        fun_l23_n170(x)
+    else
+        fun_l23_n758(x)
+    end
+end
+
+def fun_l22_n45(x)
+    if (x < 1)
+        fun_l23_n317(x)
+    else
+        fun_l23_n856(x)
+    end
+end
+
+def fun_l22_n46(x)
+    if (x < 1)
+        fun_l23_n692(x)
+    else
+        fun_l23_n330(x)
+    end
+end
+
+def fun_l22_n47(x)
+    if (x < 1)
+        fun_l23_n848(x)
+    else
+        fun_l23_n767(x)
+    end
+end
+
+def fun_l22_n48(x)
+    if (x < 1)
+        fun_l23_n683(x)
+    else
+        fun_l23_n225(x)
+    end
+end
+
+def fun_l22_n49(x)
+    if (x < 1)
+        fun_l23_n967(x)
+    else
+        fun_l23_n872(x)
+    end
+end
+
+def fun_l22_n50(x)
+    if (x < 1)
+        fun_l23_n584(x)
+    else
+        fun_l23_n799(x)
+    end
+end
+
+def fun_l22_n51(x)
+    if (x < 1)
+        fun_l23_n156(x)
+    else
+        fun_l23_n710(x)
+    end
+end
+
+def fun_l22_n52(x)
+    if (x < 1)
+        fun_l23_n129(x)
+    else
+        fun_l23_n733(x)
+    end
+end
+
+def fun_l22_n53(x)
+    if (x < 1)
+        fun_l23_n364(x)
+    else
+        fun_l23_n460(x)
+    end
+end
+
+def fun_l22_n54(x)
+    if (x < 1)
+        fun_l23_n284(x)
+    else
+        fun_l23_n13(x)
+    end
+end
+
+def fun_l22_n55(x)
+    if (x < 1)
+        fun_l23_n734(x)
+    else
+        fun_l23_n498(x)
+    end
+end
+
+def fun_l22_n56(x)
+    if (x < 1)
+        fun_l23_n981(x)
+    else
+        fun_l23_n602(x)
+    end
+end
+
+def fun_l22_n57(x)
+    if (x < 1)
+        fun_l23_n632(x)
+    else
+        fun_l23_n123(x)
+    end
+end
+
+def fun_l22_n58(x)
+    if (x < 1)
+        fun_l23_n602(x)
+    else
+        fun_l23_n274(x)
+    end
+end
+
+def fun_l22_n59(x)
+    if (x < 1)
+        fun_l23_n718(x)
+    else
+        fun_l23_n351(x)
+    end
+end
+
+def fun_l22_n60(x)
+    if (x < 1)
+        fun_l23_n618(x)
+    else
+        fun_l23_n583(x)
+    end
+end
+
+def fun_l22_n61(x)
+    if (x < 1)
+        fun_l23_n63(x)
+    else
+        fun_l23_n573(x)
+    end
+end
+
+def fun_l22_n62(x)
+    if (x < 1)
+        fun_l23_n73(x)
+    else
+        fun_l23_n429(x)
+    end
+end
+
+def fun_l22_n63(x)
+    if (x < 1)
+        fun_l23_n969(x)
+    else
+        fun_l23_n518(x)
+    end
+end
+
+def fun_l22_n64(x)
+    if (x < 1)
+        fun_l23_n493(x)
+    else
+        fun_l23_n868(x)
+    end
+end
+
+def fun_l22_n65(x)
+    if (x < 1)
+        fun_l23_n31(x)
+    else
+        fun_l23_n366(x)
+    end
+end
+
+def fun_l22_n66(x)
+    if (x < 1)
+        fun_l23_n442(x)
+    else
+        fun_l23_n362(x)
+    end
+end
+
+def fun_l22_n67(x)
+    if (x < 1)
+        fun_l23_n804(x)
+    else
+        fun_l23_n513(x)
+    end
+end
+
+def fun_l22_n68(x)
+    if (x < 1)
+        fun_l23_n973(x)
+    else
+        fun_l23_n723(x)
+    end
+end
+
+def fun_l22_n69(x)
+    if (x < 1)
+        fun_l23_n424(x)
+    else
+        fun_l23_n247(x)
+    end
+end
+
+def fun_l22_n70(x)
+    if (x < 1)
+        fun_l23_n992(x)
+    else
+        fun_l23_n944(x)
+    end
+end
+
+def fun_l22_n71(x)
+    if (x < 1)
+        fun_l23_n209(x)
+    else
+        fun_l23_n645(x)
+    end
+end
+
+def fun_l22_n72(x)
+    if (x < 1)
+        fun_l23_n373(x)
+    else
+        fun_l23_n540(x)
+    end
+end
+
+def fun_l22_n73(x)
+    if (x < 1)
+        fun_l23_n785(x)
+    else
+        fun_l23_n840(x)
+    end
+end
+
+def fun_l22_n74(x)
+    if (x < 1)
+        fun_l23_n607(x)
+    else
+        fun_l23_n584(x)
+    end
+end
+
+def fun_l22_n75(x)
+    if (x < 1)
+        fun_l23_n331(x)
+    else
+        fun_l23_n196(x)
+    end
+end
+
+def fun_l22_n76(x)
+    if (x < 1)
+        fun_l23_n453(x)
+    else
+        fun_l23_n991(x)
+    end
+end
+
+def fun_l22_n77(x)
+    if (x < 1)
+        fun_l23_n689(x)
+    else
+        fun_l23_n222(x)
+    end
+end
+
+def fun_l22_n78(x)
+    if (x < 1)
+        fun_l23_n446(x)
+    else
+        fun_l23_n767(x)
+    end
+end
+
+def fun_l22_n79(x)
+    if (x < 1)
+        fun_l23_n648(x)
+    else
+        fun_l23_n811(x)
+    end
+end
+
+def fun_l22_n80(x)
+    if (x < 1)
+        fun_l23_n210(x)
+    else
+        fun_l23_n52(x)
+    end
+end
+
+def fun_l22_n81(x)
+    if (x < 1)
+        fun_l23_n786(x)
+    else
+        fun_l23_n984(x)
+    end
+end
+
+def fun_l22_n82(x)
+    if (x < 1)
+        fun_l23_n693(x)
+    else
+        fun_l23_n103(x)
+    end
+end
+
+def fun_l22_n83(x)
+    if (x < 1)
+        fun_l23_n768(x)
+    else
+        fun_l23_n794(x)
+    end
+end
+
+def fun_l22_n84(x)
+    if (x < 1)
+        fun_l23_n820(x)
+    else
+        fun_l23_n774(x)
+    end
+end
+
+def fun_l22_n85(x)
+    if (x < 1)
+        fun_l23_n972(x)
+    else
+        fun_l23_n254(x)
+    end
+end
+
+def fun_l22_n86(x)
+    if (x < 1)
+        fun_l23_n609(x)
+    else
+        fun_l23_n524(x)
+    end
+end
+
+def fun_l22_n87(x)
+    if (x < 1)
+        fun_l23_n486(x)
+    else
+        fun_l23_n173(x)
+    end
+end
+
+def fun_l22_n88(x)
+    if (x < 1)
+        fun_l23_n236(x)
+    else
+        fun_l23_n359(x)
+    end
+end
+
+def fun_l22_n89(x)
+    if (x < 1)
+        fun_l23_n292(x)
+    else
+        fun_l23_n232(x)
+    end
+end
+
+def fun_l22_n90(x)
+    if (x < 1)
+        fun_l23_n104(x)
+    else
+        fun_l23_n799(x)
+    end
+end
+
+def fun_l22_n91(x)
+    if (x < 1)
+        fun_l23_n957(x)
+    else
+        fun_l23_n836(x)
+    end
+end
+
+def fun_l22_n92(x)
+    if (x < 1)
+        fun_l23_n179(x)
+    else
+        fun_l23_n416(x)
+    end
+end
+
+def fun_l22_n93(x)
+    if (x < 1)
+        fun_l23_n281(x)
+    else
+        fun_l23_n530(x)
+    end
+end
+
+def fun_l22_n94(x)
+    if (x < 1)
+        fun_l23_n627(x)
+    else
+        fun_l23_n577(x)
+    end
+end
+
+def fun_l22_n95(x)
+    if (x < 1)
+        fun_l23_n594(x)
+    else
+        fun_l23_n949(x)
+    end
+end
+
+def fun_l22_n96(x)
+    if (x < 1)
+        fun_l23_n408(x)
+    else
+        fun_l23_n547(x)
+    end
+end
+
+def fun_l22_n97(x)
+    if (x < 1)
+        fun_l23_n276(x)
+    else
+        fun_l23_n105(x)
+    end
+end
+
+def fun_l22_n98(x)
+    if (x < 1)
+        fun_l23_n181(x)
+    else
+        fun_l23_n659(x)
+    end
+end
+
+def fun_l22_n99(x)
+    if (x < 1)
+        fun_l23_n7(x)
+    else
+        fun_l23_n423(x)
+    end
+end
+
+def fun_l22_n100(x)
+    if (x < 1)
+        fun_l23_n123(x)
+    else
+        fun_l23_n244(x)
+    end
+end
+
+def fun_l22_n101(x)
+    if (x < 1)
+        fun_l23_n476(x)
+    else
+        fun_l23_n319(x)
+    end
+end
+
+def fun_l22_n102(x)
+    if (x < 1)
+        fun_l23_n443(x)
+    else
+        fun_l23_n959(x)
+    end
+end
+
+def fun_l22_n103(x)
+    if (x < 1)
+        fun_l23_n78(x)
+    else
+        fun_l23_n490(x)
+    end
+end
+
+def fun_l22_n104(x)
+    if (x < 1)
+        fun_l23_n761(x)
+    else
+        fun_l23_n23(x)
+    end
+end
+
+def fun_l22_n105(x)
+    if (x < 1)
+        fun_l23_n126(x)
+    else
+        fun_l23_n426(x)
+    end
+end
+
+def fun_l22_n106(x)
+    if (x < 1)
+        fun_l23_n740(x)
+    else
+        fun_l23_n328(x)
+    end
+end
+
+def fun_l22_n107(x)
+    if (x < 1)
+        fun_l23_n249(x)
+    else
+        fun_l23_n890(x)
+    end
+end
+
+def fun_l22_n108(x)
+    if (x < 1)
+        fun_l23_n665(x)
+    else
+        fun_l23_n60(x)
+    end
+end
+
+def fun_l22_n109(x)
+    if (x < 1)
+        fun_l23_n617(x)
+    else
+        fun_l23_n42(x)
+    end
+end
+
+def fun_l22_n110(x)
+    if (x < 1)
+        fun_l23_n484(x)
+    else
+        fun_l23_n480(x)
+    end
+end
+
+def fun_l22_n111(x)
+    if (x < 1)
+        fun_l23_n135(x)
+    else
+        fun_l23_n447(x)
+    end
+end
+
+def fun_l22_n112(x)
+    if (x < 1)
+        fun_l23_n881(x)
+    else
+        fun_l23_n410(x)
+    end
+end
+
+def fun_l22_n113(x)
+    if (x < 1)
+        fun_l23_n989(x)
+    else
+        fun_l23_n849(x)
+    end
+end
+
+def fun_l22_n114(x)
+    if (x < 1)
+        fun_l23_n660(x)
+    else
+        fun_l23_n307(x)
+    end
+end
+
+def fun_l22_n115(x)
+    if (x < 1)
+        fun_l23_n372(x)
+    else
+        fun_l23_n150(x)
+    end
+end
+
+def fun_l22_n116(x)
+    if (x < 1)
+        fun_l23_n770(x)
+    else
+        fun_l23_n109(x)
+    end
+end
+
+def fun_l22_n117(x)
+    if (x < 1)
+        fun_l23_n364(x)
+    else
+        fun_l23_n321(x)
+    end
+end
+
+def fun_l22_n118(x)
+    if (x < 1)
+        fun_l23_n363(x)
+    else
+        fun_l23_n876(x)
+    end
+end
+
+def fun_l22_n119(x)
+    if (x < 1)
+        fun_l23_n114(x)
+    else
+        fun_l23_n25(x)
+    end
+end
+
+def fun_l22_n120(x)
+    if (x < 1)
+        fun_l23_n160(x)
+    else
+        fun_l23_n744(x)
+    end
+end
+
+def fun_l22_n121(x)
+    if (x < 1)
+        fun_l23_n265(x)
+    else
+        fun_l23_n972(x)
+    end
+end
+
+def fun_l22_n122(x)
+    if (x < 1)
+        fun_l23_n259(x)
+    else
+        fun_l23_n203(x)
+    end
+end
+
+def fun_l22_n123(x)
+    if (x < 1)
+        fun_l23_n865(x)
+    else
+        fun_l23_n137(x)
+    end
+end
+
+def fun_l22_n124(x)
+    if (x < 1)
+        fun_l23_n427(x)
+    else
+        fun_l23_n437(x)
+    end
+end
+
+def fun_l22_n125(x)
+    if (x < 1)
+        fun_l23_n405(x)
+    else
+        fun_l23_n603(x)
+    end
+end
+
+def fun_l22_n126(x)
+    if (x < 1)
+        fun_l23_n938(x)
+    else
+        fun_l23_n505(x)
+    end
+end
+
+def fun_l22_n127(x)
+    if (x < 1)
+        fun_l23_n307(x)
+    else
+        fun_l23_n26(x)
+    end
+end
+
+def fun_l22_n128(x)
+    if (x < 1)
+        fun_l23_n15(x)
+    else
+        fun_l23_n406(x)
+    end
+end
+
+def fun_l22_n129(x)
+    if (x < 1)
+        fun_l23_n633(x)
+    else
+        fun_l23_n831(x)
+    end
+end
+
+def fun_l22_n130(x)
+    if (x < 1)
+        fun_l23_n805(x)
+    else
+        fun_l23_n216(x)
+    end
+end
+
+def fun_l22_n131(x)
+    if (x < 1)
+        fun_l23_n552(x)
+    else
+        fun_l23_n864(x)
+    end
+end
+
+def fun_l22_n132(x)
+    if (x < 1)
+        fun_l23_n50(x)
+    else
+        fun_l23_n805(x)
+    end
+end
+
+def fun_l22_n133(x)
+    if (x < 1)
+        fun_l23_n823(x)
+    else
+        fun_l23_n427(x)
+    end
+end
+
+def fun_l22_n134(x)
+    if (x < 1)
+        fun_l23_n964(x)
+    else
+        fun_l23_n214(x)
+    end
+end
+
+def fun_l22_n135(x)
+    if (x < 1)
+        fun_l23_n267(x)
+    else
+        fun_l23_n351(x)
+    end
+end
+
+def fun_l22_n136(x)
+    if (x < 1)
+        fun_l23_n557(x)
+    else
+        fun_l23_n257(x)
+    end
+end
+
+def fun_l22_n137(x)
+    if (x < 1)
+        fun_l23_n966(x)
+    else
+        fun_l23_n248(x)
+    end
+end
+
+def fun_l22_n138(x)
+    if (x < 1)
+        fun_l23_n569(x)
+    else
+        fun_l23_n376(x)
+    end
+end
+
+def fun_l22_n139(x)
+    if (x < 1)
+        fun_l23_n198(x)
+    else
+        fun_l23_n595(x)
+    end
+end
+
+def fun_l22_n140(x)
+    if (x < 1)
+        fun_l23_n107(x)
+    else
+        fun_l23_n134(x)
+    end
+end
+
+def fun_l22_n141(x)
+    if (x < 1)
+        fun_l23_n113(x)
+    else
+        fun_l23_n290(x)
+    end
+end
+
+def fun_l22_n142(x)
+    if (x < 1)
+        fun_l23_n721(x)
+    else
+        fun_l23_n641(x)
+    end
+end
+
+def fun_l22_n143(x)
+    if (x < 1)
+        fun_l23_n535(x)
+    else
+        fun_l23_n103(x)
+    end
+end
+
+def fun_l22_n144(x)
+    if (x < 1)
+        fun_l23_n690(x)
+    else
+        fun_l23_n125(x)
+    end
+end
+
+def fun_l22_n145(x)
+    if (x < 1)
+        fun_l23_n514(x)
+    else
+        fun_l23_n999(x)
+    end
+end
+
+def fun_l22_n146(x)
+    if (x < 1)
+        fun_l23_n503(x)
+    else
+        fun_l23_n951(x)
+    end
+end
+
+def fun_l22_n147(x)
+    if (x < 1)
+        fun_l23_n413(x)
+    else
+        fun_l23_n634(x)
+    end
+end
+
+def fun_l22_n148(x)
+    if (x < 1)
+        fun_l23_n818(x)
+    else
+        fun_l23_n286(x)
+    end
+end
+
+def fun_l22_n149(x)
+    if (x < 1)
+        fun_l23_n768(x)
+    else
+        fun_l23_n832(x)
+    end
+end
+
+def fun_l22_n150(x)
+    if (x < 1)
+        fun_l23_n128(x)
+    else
+        fun_l23_n588(x)
+    end
+end
+
+def fun_l22_n151(x)
+    if (x < 1)
+        fun_l23_n787(x)
+    else
+        fun_l23_n742(x)
+    end
+end
+
+def fun_l22_n152(x)
+    if (x < 1)
+        fun_l23_n166(x)
+    else
+        fun_l23_n856(x)
+    end
+end
+
+def fun_l22_n153(x)
+    if (x < 1)
+        fun_l23_n377(x)
+    else
+        fun_l23_n90(x)
+    end
+end
+
+def fun_l22_n154(x)
+    if (x < 1)
+        fun_l23_n851(x)
+    else
+        fun_l23_n591(x)
+    end
+end
+
+def fun_l22_n155(x)
+    if (x < 1)
+        fun_l23_n896(x)
+    else
+        fun_l23_n372(x)
+    end
+end
+
+def fun_l22_n156(x)
+    if (x < 1)
+        fun_l23_n132(x)
+    else
+        fun_l23_n144(x)
+    end
+end
+
+def fun_l22_n157(x)
+    if (x < 1)
+        fun_l23_n251(x)
+    else
+        fun_l23_n620(x)
+    end
+end
+
+def fun_l22_n158(x)
+    if (x < 1)
+        fun_l23_n612(x)
+    else
+        fun_l23_n246(x)
+    end
+end
+
+def fun_l22_n159(x)
+    if (x < 1)
+        fun_l23_n530(x)
+    else
+        fun_l23_n94(x)
+    end
+end
+
+def fun_l22_n160(x)
+    if (x < 1)
+        fun_l23_n310(x)
+    else
+        fun_l23_n706(x)
+    end
+end
+
+def fun_l22_n161(x)
+    if (x < 1)
+        fun_l23_n420(x)
+    else
+        fun_l23_n576(x)
+    end
+end
+
+def fun_l22_n162(x)
+    if (x < 1)
+        fun_l23_n544(x)
+    else
+        fun_l23_n277(x)
+    end
+end
+
+def fun_l22_n163(x)
+    if (x < 1)
+        fun_l23_n770(x)
+    else
+        fun_l23_n94(x)
+    end
+end
+
+def fun_l22_n164(x)
+    if (x < 1)
+        fun_l23_n49(x)
+    else
+        fun_l23_n576(x)
+    end
+end
+
+def fun_l22_n165(x)
+    if (x < 1)
+        fun_l23_n610(x)
+    else
+        fun_l23_n184(x)
+    end
+end
+
+def fun_l22_n166(x)
+    if (x < 1)
+        fun_l23_n974(x)
+    else
+        fun_l23_n54(x)
+    end
+end
+
+def fun_l22_n167(x)
+    if (x < 1)
+        fun_l23_n179(x)
+    else
+        fun_l23_n485(x)
+    end
+end
+
+def fun_l22_n168(x)
+    if (x < 1)
+        fun_l23_n114(x)
+    else
+        fun_l23_n766(x)
+    end
+end
+
+def fun_l22_n169(x)
+    if (x < 1)
+        fun_l23_n399(x)
+    else
+        fun_l23_n830(x)
+    end
+end
+
+def fun_l22_n170(x)
+    if (x < 1)
+        fun_l23_n332(x)
+    else
+        fun_l23_n536(x)
+    end
+end
+
+def fun_l22_n171(x)
+    if (x < 1)
+        fun_l23_n384(x)
+    else
+        fun_l23_n773(x)
+    end
+end
+
+def fun_l22_n172(x)
+    if (x < 1)
+        fun_l23_n52(x)
+    else
+        fun_l23_n7(x)
+    end
+end
+
+def fun_l22_n173(x)
+    if (x < 1)
+        fun_l23_n85(x)
+    else
+        fun_l23_n803(x)
+    end
+end
+
+def fun_l22_n174(x)
+    if (x < 1)
+        fun_l23_n853(x)
+    else
+        fun_l23_n682(x)
+    end
+end
+
+def fun_l22_n175(x)
+    if (x < 1)
+        fun_l23_n112(x)
+    else
+        fun_l23_n295(x)
+    end
+end
+
+def fun_l22_n176(x)
+    if (x < 1)
+        fun_l23_n347(x)
+    else
+        fun_l23_n908(x)
+    end
+end
+
+def fun_l22_n177(x)
+    if (x < 1)
+        fun_l23_n267(x)
+    else
+        fun_l23_n19(x)
+    end
+end
+
+def fun_l22_n178(x)
+    if (x < 1)
+        fun_l23_n8(x)
+    else
+        fun_l23_n739(x)
+    end
+end
+
+def fun_l22_n179(x)
+    if (x < 1)
+        fun_l23_n201(x)
+    else
+        fun_l23_n321(x)
+    end
+end
+
+def fun_l22_n180(x)
+    if (x < 1)
+        fun_l23_n773(x)
+    else
+        fun_l23_n224(x)
+    end
+end
+
+def fun_l22_n181(x)
+    if (x < 1)
+        fun_l23_n966(x)
+    else
+        fun_l23_n324(x)
+    end
+end
+
+def fun_l22_n182(x)
+    if (x < 1)
+        fun_l23_n389(x)
+    else
+        fun_l23_n190(x)
+    end
+end
+
+def fun_l22_n183(x)
+    if (x < 1)
+        fun_l23_n918(x)
+    else
+        fun_l23_n512(x)
+    end
+end
+
+def fun_l22_n184(x)
+    if (x < 1)
+        fun_l23_n360(x)
+    else
+        fun_l23_n702(x)
+    end
+end
+
+def fun_l22_n185(x)
+    if (x < 1)
+        fun_l23_n794(x)
+    else
+        fun_l23_n51(x)
+    end
+end
+
+def fun_l22_n186(x)
+    if (x < 1)
+        fun_l23_n982(x)
+    else
+        fun_l23_n779(x)
+    end
+end
+
+def fun_l22_n187(x)
+    if (x < 1)
+        fun_l23_n263(x)
+    else
+        fun_l23_n659(x)
+    end
+end
+
+def fun_l22_n188(x)
+    if (x < 1)
+        fun_l23_n203(x)
+    else
+        fun_l23_n705(x)
+    end
+end
+
+def fun_l22_n189(x)
+    if (x < 1)
+        fun_l23_n976(x)
+    else
+        fun_l23_n307(x)
+    end
+end
+
+def fun_l22_n190(x)
+    if (x < 1)
+        fun_l23_n281(x)
+    else
+        fun_l23_n880(x)
+    end
+end
+
+def fun_l22_n191(x)
+    if (x < 1)
+        fun_l23_n238(x)
+    else
+        fun_l23_n752(x)
+    end
+end
+
+def fun_l22_n192(x)
+    if (x < 1)
+        fun_l23_n679(x)
+    else
+        fun_l23_n935(x)
+    end
+end
+
+def fun_l22_n193(x)
+    if (x < 1)
+        fun_l23_n823(x)
+    else
+        fun_l23_n340(x)
+    end
+end
+
+def fun_l22_n194(x)
+    if (x < 1)
+        fun_l23_n687(x)
+    else
+        fun_l23_n71(x)
+    end
+end
+
+def fun_l22_n195(x)
+    if (x < 1)
+        fun_l23_n47(x)
+    else
+        fun_l23_n119(x)
+    end
+end
+
+def fun_l22_n196(x)
+    if (x < 1)
+        fun_l23_n702(x)
+    else
+        fun_l23_n213(x)
+    end
+end
+
+def fun_l22_n197(x)
+    if (x < 1)
+        fun_l23_n300(x)
+    else
+        fun_l23_n52(x)
+    end
+end
+
+def fun_l22_n198(x)
+    if (x < 1)
+        fun_l23_n85(x)
+    else
+        fun_l23_n845(x)
+    end
+end
+
+def fun_l22_n199(x)
+    if (x < 1)
+        fun_l23_n503(x)
+    else
+        fun_l23_n322(x)
+    end
+end
+
+def fun_l22_n200(x)
+    if (x < 1)
+        fun_l23_n151(x)
+    else
+        fun_l23_n743(x)
+    end
+end
+
+def fun_l22_n201(x)
+    if (x < 1)
+        fun_l23_n531(x)
+    else
+        fun_l23_n597(x)
+    end
+end
+
+def fun_l22_n202(x)
+    if (x < 1)
+        fun_l23_n120(x)
+    else
+        fun_l23_n300(x)
+    end
+end
+
+def fun_l22_n203(x)
+    if (x < 1)
+        fun_l23_n124(x)
+    else
+        fun_l23_n609(x)
+    end
+end
+
+def fun_l22_n204(x)
+    if (x < 1)
+        fun_l23_n945(x)
+    else
+        fun_l23_n498(x)
+    end
+end
+
+def fun_l22_n205(x)
+    if (x < 1)
+        fun_l23_n983(x)
+    else
+        fun_l23_n16(x)
+    end
+end
+
+def fun_l22_n206(x)
+    if (x < 1)
+        fun_l23_n271(x)
+    else
+        fun_l23_n612(x)
+    end
+end
+
+def fun_l22_n207(x)
+    if (x < 1)
+        fun_l23_n762(x)
+    else
+        fun_l23_n596(x)
+    end
+end
+
+def fun_l22_n208(x)
+    if (x < 1)
+        fun_l23_n992(x)
+    else
+        fun_l23_n90(x)
+    end
+end
+
+def fun_l22_n209(x)
+    if (x < 1)
+        fun_l23_n994(x)
+    else
+        fun_l23_n265(x)
+    end
+end
+
+def fun_l22_n210(x)
+    if (x < 1)
+        fun_l23_n449(x)
+    else
+        fun_l23_n609(x)
+    end
+end
+
+def fun_l22_n211(x)
+    if (x < 1)
+        fun_l23_n816(x)
+    else
+        fun_l23_n8(x)
+    end
+end
+
+def fun_l22_n212(x)
+    if (x < 1)
+        fun_l23_n526(x)
+    else
+        fun_l23_n982(x)
+    end
+end
+
+def fun_l22_n213(x)
+    if (x < 1)
+        fun_l23_n25(x)
+    else
+        fun_l23_n302(x)
+    end
+end
+
+def fun_l22_n214(x)
+    if (x < 1)
+        fun_l23_n868(x)
+    else
+        fun_l23_n895(x)
+    end
+end
+
+def fun_l22_n215(x)
+    if (x < 1)
+        fun_l23_n3(x)
+    else
+        fun_l23_n914(x)
+    end
+end
+
+def fun_l22_n216(x)
+    if (x < 1)
+        fun_l23_n106(x)
+    else
+        fun_l23_n271(x)
+    end
+end
+
+def fun_l22_n217(x)
+    if (x < 1)
+        fun_l23_n567(x)
+    else
+        fun_l23_n931(x)
+    end
+end
+
+def fun_l22_n218(x)
+    if (x < 1)
+        fun_l23_n7(x)
+    else
+        fun_l23_n319(x)
+    end
+end
+
+def fun_l22_n219(x)
+    if (x < 1)
+        fun_l23_n510(x)
+    else
+        fun_l23_n753(x)
+    end
+end
+
+def fun_l22_n220(x)
+    if (x < 1)
+        fun_l23_n529(x)
+    else
+        fun_l23_n514(x)
+    end
+end
+
+def fun_l22_n221(x)
+    if (x < 1)
+        fun_l23_n871(x)
+    else
+        fun_l23_n571(x)
+    end
+end
+
+def fun_l22_n222(x)
+    if (x < 1)
+        fun_l23_n739(x)
+    else
+        fun_l23_n716(x)
+    end
+end
+
+def fun_l22_n223(x)
+    if (x < 1)
+        fun_l23_n781(x)
+    else
+        fun_l23_n730(x)
+    end
+end
+
+def fun_l22_n224(x)
+    if (x < 1)
+        fun_l23_n647(x)
+    else
+        fun_l23_n647(x)
+    end
+end
+
+def fun_l22_n225(x)
+    if (x < 1)
+        fun_l23_n968(x)
+    else
+        fun_l23_n680(x)
+    end
+end
+
+def fun_l22_n226(x)
+    if (x < 1)
+        fun_l23_n400(x)
+    else
+        fun_l23_n725(x)
+    end
+end
+
+def fun_l22_n227(x)
+    if (x < 1)
+        fun_l23_n386(x)
+    else
+        fun_l23_n859(x)
+    end
+end
+
+def fun_l22_n228(x)
+    if (x < 1)
+        fun_l23_n751(x)
+    else
+        fun_l23_n640(x)
+    end
+end
+
+def fun_l22_n229(x)
+    if (x < 1)
+        fun_l23_n273(x)
+    else
+        fun_l23_n754(x)
+    end
+end
+
+def fun_l22_n230(x)
+    if (x < 1)
+        fun_l23_n861(x)
+    else
+        fun_l23_n783(x)
+    end
+end
+
+def fun_l22_n231(x)
+    if (x < 1)
+        fun_l23_n665(x)
+    else
+        fun_l23_n18(x)
+    end
+end
+
+def fun_l22_n232(x)
+    if (x < 1)
+        fun_l23_n680(x)
+    else
+        fun_l23_n471(x)
+    end
+end
+
+def fun_l22_n233(x)
+    if (x < 1)
+        fun_l23_n400(x)
+    else
+        fun_l23_n935(x)
+    end
+end
+
+def fun_l22_n234(x)
+    if (x < 1)
+        fun_l23_n563(x)
+    else
+        fun_l23_n799(x)
+    end
+end
+
+def fun_l22_n235(x)
+    if (x < 1)
+        fun_l23_n712(x)
+    else
+        fun_l23_n20(x)
+    end
+end
+
+def fun_l22_n236(x)
+    if (x < 1)
+        fun_l23_n579(x)
+    else
+        fun_l23_n152(x)
+    end
+end
+
+def fun_l22_n237(x)
+    if (x < 1)
+        fun_l23_n752(x)
+    else
+        fun_l23_n282(x)
+    end
+end
+
+def fun_l22_n238(x)
+    if (x < 1)
+        fun_l23_n609(x)
+    else
+        fun_l23_n980(x)
+    end
+end
+
+def fun_l22_n239(x)
+    if (x < 1)
+        fun_l23_n916(x)
+    else
+        fun_l23_n52(x)
+    end
+end
+
+def fun_l22_n240(x)
+    if (x < 1)
+        fun_l23_n468(x)
+    else
+        fun_l23_n735(x)
+    end
+end
+
+def fun_l22_n241(x)
+    if (x < 1)
+        fun_l23_n894(x)
+    else
+        fun_l23_n776(x)
+    end
+end
+
+def fun_l22_n242(x)
+    if (x < 1)
+        fun_l23_n782(x)
+    else
+        fun_l23_n406(x)
+    end
+end
+
+def fun_l22_n243(x)
+    if (x < 1)
+        fun_l23_n90(x)
+    else
+        fun_l23_n226(x)
+    end
+end
+
+def fun_l22_n244(x)
+    if (x < 1)
+        fun_l23_n967(x)
+    else
+        fun_l23_n252(x)
+    end
+end
+
+def fun_l22_n245(x)
+    if (x < 1)
+        fun_l23_n189(x)
+    else
+        fun_l23_n252(x)
+    end
+end
+
+def fun_l22_n246(x)
+    if (x < 1)
+        fun_l23_n919(x)
+    else
+        fun_l23_n581(x)
+    end
+end
+
+def fun_l22_n247(x)
+    if (x < 1)
+        fun_l23_n212(x)
+    else
+        fun_l23_n465(x)
+    end
+end
+
+def fun_l22_n248(x)
+    if (x < 1)
+        fun_l23_n880(x)
+    else
+        fun_l23_n823(x)
+    end
+end
+
+def fun_l22_n249(x)
+    if (x < 1)
+        fun_l23_n227(x)
+    else
+        fun_l23_n620(x)
+    end
+end
+
+def fun_l22_n250(x)
+    if (x < 1)
+        fun_l23_n875(x)
+    else
+        fun_l23_n707(x)
+    end
+end
+
+def fun_l22_n251(x)
+    if (x < 1)
+        fun_l23_n623(x)
+    else
+        fun_l23_n132(x)
+    end
+end
+
+def fun_l22_n252(x)
+    if (x < 1)
+        fun_l23_n739(x)
+    else
+        fun_l23_n417(x)
+    end
+end
+
+def fun_l22_n253(x)
+    if (x < 1)
+        fun_l23_n977(x)
+    else
+        fun_l23_n216(x)
+    end
+end
+
+def fun_l22_n254(x)
+    if (x < 1)
+        fun_l23_n725(x)
+    else
+        fun_l23_n168(x)
+    end
+end
+
+def fun_l22_n255(x)
+    if (x < 1)
+        fun_l23_n878(x)
+    else
+        fun_l23_n699(x)
+    end
+end
+
+def fun_l22_n256(x)
+    if (x < 1)
+        fun_l23_n423(x)
+    else
+        fun_l23_n626(x)
+    end
+end
+
+def fun_l22_n257(x)
+    if (x < 1)
+        fun_l23_n29(x)
+    else
+        fun_l23_n248(x)
+    end
+end
+
+def fun_l22_n258(x)
+    if (x < 1)
+        fun_l23_n78(x)
+    else
+        fun_l23_n925(x)
+    end
+end
+
+def fun_l22_n259(x)
+    if (x < 1)
+        fun_l23_n798(x)
+    else
+        fun_l23_n220(x)
+    end
+end
+
+def fun_l22_n260(x)
+    if (x < 1)
+        fun_l23_n621(x)
+    else
+        fun_l23_n936(x)
+    end
+end
+
+def fun_l22_n261(x)
+    if (x < 1)
+        fun_l23_n894(x)
+    else
+        fun_l23_n463(x)
+    end
+end
+
+def fun_l22_n262(x)
+    if (x < 1)
+        fun_l23_n336(x)
+    else
+        fun_l23_n535(x)
+    end
+end
+
+def fun_l22_n263(x)
+    if (x < 1)
+        fun_l23_n246(x)
+    else
+        fun_l23_n676(x)
+    end
+end
+
+def fun_l22_n264(x)
+    if (x < 1)
+        fun_l23_n986(x)
+    else
+        fun_l23_n675(x)
+    end
+end
+
+def fun_l22_n265(x)
+    if (x < 1)
+        fun_l23_n92(x)
+    else
+        fun_l23_n380(x)
+    end
+end
+
+def fun_l22_n266(x)
+    if (x < 1)
+        fun_l23_n945(x)
+    else
+        fun_l23_n842(x)
+    end
+end
+
+def fun_l22_n267(x)
+    if (x < 1)
+        fun_l23_n351(x)
+    else
+        fun_l23_n261(x)
+    end
+end
+
+def fun_l22_n268(x)
+    if (x < 1)
+        fun_l23_n784(x)
+    else
+        fun_l23_n306(x)
+    end
+end
+
+def fun_l22_n269(x)
+    if (x < 1)
+        fun_l23_n940(x)
+    else
+        fun_l23_n129(x)
+    end
+end
+
+def fun_l22_n270(x)
+    if (x < 1)
+        fun_l23_n491(x)
+    else
+        fun_l23_n806(x)
+    end
+end
+
+def fun_l22_n271(x)
+    if (x < 1)
+        fun_l23_n68(x)
+    else
+        fun_l23_n91(x)
+    end
+end
+
+def fun_l22_n272(x)
+    if (x < 1)
+        fun_l23_n965(x)
+    else
+        fun_l23_n665(x)
+    end
+end
+
+def fun_l22_n273(x)
+    if (x < 1)
+        fun_l23_n461(x)
+    else
+        fun_l23_n619(x)
+    end
+end
+
+def fun_l22_n274(x)
+    if (x < 1)
+        fun_l23_n635(x)
+    else
+        fun_l23_n755(x)
+    end
+end
+
+def fun_l22_n275(x)
+    if (x < 1)
+        fun_l23_n192(x)
+    else
+        fun_l23_n729(x)
+    end
+end
+
+def fun_l22_n276(x)
+    if (x < 1)
+        fun_l23_n94(x)
+    else
+        fun_l23_n832(x)
+    end
+end
+
+def fun_l22_n277(x)
+    if (x < 1)
+        fun_l23_n619(x)
+    else
+        fun_l23_n444(x)
+    end
+end
+
+def fun_l22_n278(x)
+    if (x < 1)
+        fun_l23_n682(x)
+    else
+        fun_l23_n579(x)
+    end
+end
+
+def fun_l22_n279(x)
+    if (x < 1)
+        fun_l23_n889(x)
+    else
+        fun_l23_n425(x)
+    end
+end
+
+def fun_l22_n280(x)
+    if (x < 1)
+        fun_l23_n101(x)
+    else
+        fun_l23_n215(x)
+    end
+end
+
+def fun_l22_n281(x)
+    if (x < 1)
+        fun_l23_n747(x)
+    else
+        fun_l23_n436(x)
+    end
+end
+
+def fun_l22_n282(x)
+    if (x < 1)
+        fun_l23_n519(x)
+    else
+        fun_l23_n438(x)
+    end
+end
+
+def fun_l22_n283(x)
+    if (x < 1)
+        fun_l23_n312(x)
+    else
+        fun_l23_n804(x)
+    end
+end
+
+def fun_l22_n284(x)
+    if (x < 1)
+        fun_l23_n150(x)
+    else
+        fun_l23_n71(x)
+    end
+end
+
+def fun_l22_n285(x)
+    if (x < 1)
+        fun_l23_n698(x)
+    else
+        fun_l23_n254(x)
+    end
+end
+
+def fun_l22_n286(x)
+    if (x < 1)
+        fun_l23_n97(x)
+    else
+        fun_l23_n782(x)
+    end
+end
+
+def fun_l22_n287(x)
+    if (x < 1)
+        fun_l23_n315(x)
+    else
+        fun_l23_n164(x)
+    end
+end
+
+def fun_l22_n288(x)
+    if (x < 1)
+        fun_l23_n704(x)
+    else
+        fun_l23_n927(x)
+    end
+end
+
+def fun_l22_n289(x)
+    if (x < 1)
+        fun_l23_n447(x)
+    else
+        fun_l23_n104(x)
+    end
+end
+
+def fun_l22_n290(x)
+    if (x < 1)
+        fun_l23_n533(x)
+    else
+        fun_l23_n687(x)
+    end
+end
+
+def fun_l22_n291(x)
+    if (x < 1)
+        fun_l23_n897(x)
+    else
+        fun_l23_n692(x)
+    end
+end
+
+def fun_l22_n292(x)
+    if (x < 1)
+        fun_l23_n515(x)
+    else
+        fun_l23_n258(x)
+    end
+end
+
+def fun_l22_n293(x)
+    if (x < 1)
+        fun_l23_n25(x)
+    else
+        fun_l23_n608(x)
+    end
+end
+
+def fun_l22_n294(x)
+    if (x < 1)
+        fun_l23_n313(x)
+    else
+        fun_l23_n675(x)
+    end
+end
+
+def fun_l22_n295(x)
+    if (x < 1)
+        fun_l23_n154(x)
+    else
+        fun_l23_n779(x)
+    end
+end
+
+def fun_l22_n296(x)
+    if (x < 1)
+        fun_l23_n731(x)
+    else
+        fun_l23_n310(x)
+    end
+end
+
+def fun_l22_n297(x)
+    if (x < 1)
+        fun_l23_n443(x)
+    else
+        fun_l23_n709(x)
+    end
+end
+
+def fun_l22_n298(x)
+    if (x < 1)
+        fun_l23_n100(x)
+    else
+        fun_l23_n900(x)
+    end
+end
+
+def fun_l22_n299(x)
+    if (x < 1)
+        fun_l23_n64(x)
+    else
+        fun_l23_n80(x)
+    end
+end
+
+def fun_l22_n300(x)
+    if (x < 1)
+        fun_l23_n361(x)
+    else
+        fun_l23_n535(x)
+    end
+end
+
+def fun_l22_n301(x)
+    if (x < 1)
+        fun_l23_n628(x)
+    else
+        fun_l23_n272(x)
+    end
+end
+
+def fun_l22_n302(x)
+    if (x < 1)
+        fun_l23_n930(x)
+    else
+        fun_l23_n795(x)
+    end
+end
+
+def fun_l22_n303(x)
+    if (x < 1)
+        fun_l23_n642(x)
+    else
+        fun_l23_n766(x)
+    end
+end
+
+def fun_l22_n304(x)
+    if (x < 1)
+        fun_l23_n191(x)
+    else
+        fun_l23_n439(x)
+    end
+end
+
+def fun_l22_n305(x)
+    if (x < 1)
+        fun_l23_n387(x)
+    else
+        fun_l23_n999(x)
+    end
+end
+
+def fun_l22_n306(x)
+    if (x < 1)
+        fun_l23_n470(x)
+    else
+        fun_l23_n572(x)
+    end
+end
+
+def fun_l22_n307(x)
+    if (x < 1)
+        fun_l23_n942(x)
+    else
+        fun_l23_n254(x)
+    end
+end
+
+def fun_l22_n308(x)
+    if (x < 1)
+        fun_l23_n664(x)
+    else
+        fun_l23_n73(x)
+    end
+end
+
+def fun_l22_n309(x)
+    if (x < 1)
+        fun_l23_n63(x)
+    else
+        fun_l23_n321(x)
+    end
+end
+
+def fun_l22_n310(x)
+    if (x < 1)
+        fun_l23_n348(x)
+    else
+        fun_l23_n961(x)
+    end
+end
+
+def fun_l22_n311(x)
+    if (x < 1)
+        fun_l23_n555(x)
+    else
+        fun_l23_n315(x)
+    end
+end
+
+def fun_l22_n312(x)
+    if (x < 1)
+        fun_l23_n978(x)
+    else
+        fun_l23_n498(x)
+    end
+end
+
+def fun_l22_n313(x)
+    if (x < 1)
+        fun_l23_n880(x)
+    else
+        fun_l23_n696(x)
+    end
+end
+
+def fun_l22_n314(x)
+    if (x < 1)
+        fun_l23_n325(x)
+    else
+        fun_l23_n43(x)
+    end
+end
+
+def fun_l22_n315(x)
+    if (x < 1)
+        fun_l23_n848(x)
+    else
+        fun_l23_n314(x)
+    end
+end
+
+def fun_l22_n316(x)
+    if (x < 1)
+        fun_l23_n660(x)
+    else
+        fun_l23_n378(x)
+    end
+end
+
+def fun_l22_n317(x)
+    if (x < 1)
+        fun_l23_n975(x)
+    else
+        fun_l23_n503(x)
+    end
+end
+
+def fun_l22_n318(x)
+    if (x < 1)
+        fun_l23_n41(x)
+    else
+        fun_l23_n746(x)
+    end
+end
+
+def fun_l22_n319(x)
+    if (x < 1)
+        fun_l23_n325(x)
+    else
+        fun_l23_n565(x)
+    end
+end
+
+def fun_l22_n320(x)
+    if (x < 1)
+        fun_l23_n19(x)
+    else
+        fun_l23_n922(x)
+    end
+end
+
+def fun_l22_n321(x)
+    if (x < 1)
+        fun_l23_n235(x)
+    else
+        fun_l23_n284(x)
+    end
+end
+
+def fun_l22_n322(x)
+    if (x < 1)
+        fun_l23_n591(x)
+    else
+        fun_l23_n821(x)
+    end
+end
+
+def fun_l22_n323(x)
+    if (x < 1)
+        fun_l23_n23(x)
+    else
+        fun_l23_n151(x)
+    end
+end
+
+def fun_l22_n324(x)
+    if (x < 1)
+        fun_l23_n361(x)
+    else
+        fun_l23_n322(x)
+    end
+end
+
+def fun_l22_n325(x)
+    if (x < 1)
+        fun_l23_n245(x)
+    else
+        fun_l23_n205(x)
+    end
+end
+
+def fun_l22_n326(x)
+    if (x < 1)
+        fun_l23_n568(x)
+    else
+        fun_l23_n133(x)
+    end
+end
+
+def fun_l22_n327(x)
+    if (x < 1)
+        fun_l23_n895(x)
+    else
+        fun_l23_n315(x)
+    end
+end
+
+def fun_l22_n328(x)
+    if (x < 1)
+        fun_l23_n473(x)
+    else
+        fun_l23_n315(x)
+    end
+end
+
+def fun_l22_n329(x)
+    if (x < 1)
+        fun_l23_n618(x)
+    else
+        fun_l23_n196(x)
+    end
+end
+
+def fun_l22_n330(x)
+    if (x < 1)
+        fun_l23_n97(x)
+    else
+        fun_l23_n422(x)
+    end
+end
+
+def fun_l22_n331(x)
+    if (x < 1)
+        fun_l23_n101(x)
+    else
+        fun_l23_n447(x)
+    end
+end
+
+def fun_l22_n332(x)
+    if (x < 1)
+        fun_l23_n875(x)
+    else
+        fun_l23_n197(x)
+    end
+end
+
+def fun_l22_n333(x)
+    if (x < 1)
+        fun_l23_n25(x)
+    else
+        fun_l23_n499(x)
+    end
+end
+
+def fun_l22_n334(x)
+    if (x < 1)
+        fun_l23_n602(x)
+    else
+        fun_l23_n75(x)
+    end
+end
+
+def fun_l22_n335(x)
+    if (x < 1)
+        fun_l23_n370(x)
+    else
+        fun_l23_n150(x)
+    end
+end
+
+def fun_l22_n336(x)
+    if (x < 1)
+        fun_l23_n960(x)
+    else
+        fun_l23_n498(x)
+    end
+end
+
+def fun_l22_n337(x)
+    if (x < 1)
+        fun_l23_n675(x)
+    else
+        fun_l23_n525(x)
+    end
+end
+
+def fun_l22_n338(x)
+    if (x < 1)
+        fun_l23_n445(x)
+    else
+        fun_l23_n581(x)
+    end
+end
+
+def fun_l22_n339(x)
+    if (x < 1)
+        fun_l23_n718(x)
+    else
+        fun_l23_n995(x)
+    end
+end
+
+def fun_l22_n340(x)
+    if (x < 1)
+        fun_l23_n790(x)
+    else
+        fun_l23_n370(x)
+    end
+end
+
+def fun_l22_n341(x)
+    if (x < 1)
+        fun_l23_n234(x)
+    else
+        fun_l23_n187(x)
+    end
+end
+
+def fun_l22_n342(x)
+    if (x < 1)
+        fun_l23_n777(x)
+    else
+        fun_l23_n411(x)
+    end
+end
+
+def fun_l22_n343(x)
+    if (x < 1)
+        fun_l23_n258(x)
+    else
+        fun_l23_n129(x)
+    end
+end
+
+def fun_l22_n344(x)
+    if (x < 1)
+        fun_l23_n715(x)
+    else
+        fun_l23_n381(x)
+    end
+end
+
+def fun_l22_n345(x)
+    if (x < 1)
+        fun_l23_n495(x)
+    else
+        fun_l23_n892(x)
+    end
+end
+
+def fun_l22_n346(x)
+    if (x < 1)
+        fun_l23_n433(x)
+    else
+        fun_l23_n987(x)
+    end
+end
+
+def fun_l22_n347(x)
+    if (x < 1)
+        fun_l23_n569(x)
+    else
+        fun_l23_n832(x)
+    end
+end
+
+def fun_l22_n348(x)
+    if (x < 1)
+        fun_l23_n425(x)
+    else
+        fun_l23_n894(x)
+    end
+end
+
+def fun_l22_n349(x)
+    if (x < 1)
+        fun_l23_n186(x)
+    else
+        fun_l23_n211(x)
+    end
+end
+
+def fun_l22_n350(x)
+    if (x < 1)
+        fun_l23_n435(x)
+    else
+        fun_l23_n393(x)
+    end
+end
+
+def fun_l22_n351(x)
+    if (x < 1)
+        fun_l23_n942(x)
+    else
+        fun_l23_n364(x)
+    end
+end
+
+def fun_l22_n352(x)
+    if (x < 1)
+        fun_l23_n29(x)
+    else
+        fun_l23_n574(x)
+    end
+end
+
+def fun_l22_n353(x)
+    if (x < 1)
+        fun_l23_n548(x)
+    else
+        fun_l23_n663(x)
+    end
+end
+
+def fun_l22_n354(x)
+    if (x < 1)
+        fun_l23_n238(x)
+    else
+        fun_l23_n693(x)
+    end
+end
+
+def fun_l22_n355(x)
+    if (x < 1)
+        fun_l23_n459(x)
+    else
+        fun_l23_n197(x)
+    end
+end
+
+def fun_l22_n356(x)
+    if (x < 1)
+        fun_l23_n478(x)
+    else
+        fun_l23_n905(x)
+    end
+end
+
+def fun_l22_n357(x)
+    if (x < 1)
+        fun_l23_n732(x)
+    else
+        fun_l23_n124(x)
+    end
+end
+
+def fun_l22_n358(x)
+    if (x < 1)
+        fun_l23_n716(x)
+    else
+        fun_l23_n758(x)
+    end
+end
+
+def fun_l22_n359(x)
+    if (x < 1)
+        fun_l23_n376(x)
+    else
+        fun_l23_n883(x)
+    end
+end
+
+def fun_l22_n360(x)
+    if (x < 1)
+        fun_l23_n100(x)
+    else
+        fun_l23_n485(x)
+    end
+end
+
+def fun_l22_n361(x)
+    if (x < 1)
+        fun_l23_n62(x)
+    else
+        fun_l23_n794(x)
+    end
+end
+
+def fun_l22_n362(x)
+    if (x < 1)
+        fun_l23_n951(x)
+    else
+        fun_l23_n23(x)
+    end
+end
+
+def fun_l22_n363(x)
+    if (x < 1)
+        fun_l23_n298(x)
+    else
+        fun_l23_n775(x)
+    end
+end
+
+def fun_l22_n364(x)
+    if (x < 1)
+        fun_l23_n53(x)
+    else
+        fun_l23_n595(x)
+    end
+end
+
+def fun_l22_n365(x)
+    if (x < 1)
+        fun_l23_n695(x)
+    else
+        fun_l23_n401(x)
+    end
+end
+
+def fun_l22_n366(x)
+    if (x < 1)
+        fun_l23_n475(x)
+    else
+        fun_l23_n762(x)
+    end
+end
+
+def fun_l22_n367(x)
+    if (x < 1)
+        fun_l23_n706(x)
+    else
+        fun_l23_n527(x)
+    end
+end
+
+def fun_l22_n368(x)
+    if (x < 1)
+        fun_l23_n919(x)
+    else
+        fun_l23_n301(x)
+    end
+end
+
+def fun_l22_n369(x)
+    if (x < 1)
+        fun_l23_n755(x)
+    else
+        fun_l23_n256(x)
+    end
+end
+
+def fun_l22_n370(x)
+    if (x < 1)
+        fun_l23_n592(x)
+    else
+        fun_l23_n608(x)
+    end
+end
+
+def fun_l22_n371(x)
+    if (x < 1)
+        fun_l23_n192(x)
+    else
+        fun_l23_n10(x)
+    end
+end
+
+def fun_l22_n372(x)
+    if (x < 1)
+        fun_l23_n332(x)
+    else
+        fun_l23_n448(x)
+    end
+end
+
+def fun_l22_n373(x)
+    if (x < 1)
+        fun_l23_n135(x)
+    else
+        fun_l23_n793(x)
+    end
+end
+
+def fun_l22_n374(x)
+    if (x < 1)
+        fun_l23_n141(x)
+    else
+        fun_l23_n669(x)
+    end
+end
+
+def fun_l22_n375(x)
+    if (x < 1)
+        fun_l23_n474(x)
+    else
+        fun_l23_n356(x)
+    end
+end
+
+def fun_l22_n376(x)
+    if (x < 1)
+        fun_l23_n69(x)
+    else
+        fun_l23_n384(x)
+    end
+end
+
+def fun_l22_n377(x)
+    if (x < 1)
+        fun_l23_n386(x)
+    else
+        fun_l23_n552(x)
+    end
+end
+
+def fun_l22_n378(x)
+    if (x < 1)
+        fun_l23_n878(x)
+    else
+        fun_l23_n131(x)
+    end
+end
+
+def fun_l22_n379(x)
+    if (x < 1)
+        fun_l23_n929(x)
+    else
+        fun_l23_n479(x)
+    end
+end
+
+def fun_l22_n380(x)
+    if (x < 1)
+        fun_l23_n782(x)
+    else
+        fun_l23_n745(x)
+    end
+end
+
+def fun_l22_n381(x)
+    if (x < 1)
+        fun_l23_n126(x)
+    else
+        fun_l23_n732(x)
+    end
+end
+
+def fun_l22_n382(x)
+    if (x < 1)
+        fun_l23_n694(x)
+    else
+        fun_l23_n291(x)
+    end
+end
+
+def fun_l22_n383(x)
+    if (x < 1)
+        fun_l23_n165(x)
+    else
+        fun_l23_n49(x)
+    end
+end
+
+def fun_l22_n384(x)
+    if (x < 1)
+        fun_l23_n453(x)
+    else
+        fun_l23_n144(x)
+    end
+end
+
+def fun_l22_n385(x)
+    if (x < 1)
+        fun_l23_n182(x)
+    else
+        fun_l23_n974(x)
+    end
+end
+
+def fun_l22_n386(x)
+    if (x < 1)
+        fun_l23_n861(x)
+    else
+        fun_l23_n185(x)
+    end
+end
+
+def fun_l22_n387(x)
+    if (x < 1)
+        fun_l23_n962(x)
+    else
+        fun_l23_n578(x)
+    end
+end
+
+def fun_l22_n388(x)
+    if (x < 1)
+        fun_l23_n88(x)
+    else
+        fun_l23_n508(x)
+    end
+end
+
+def fun_l22_n389(x)
+    if (x < 1)
+        fun_l23_n421(x)
+    else
+        fun_l23_n886(x)
+    end
+end
+
+def fun_l22_n390(x)
+    if (x < 1)
+        fun_l23_n992(x)
+    else
+        fun_l23_n540(x)
+    end
+end
+
+def fun_l22_n391(x)
+    if (x < 1)
+        fun_l23_n996(x)
+    else
+        fun_l23_n533(x)
+    end
+end
+
+def fun_l22_n392(x)
+    if (x < 1)
+        fun_l23_n97(x)
+    else
+        fun_l23_n803(x)
+    end
+end
+
+def fun_l22_n393(x)
+    if (x < 1)
+        fun_l23_n505(x)
+    else
+        fun_l23_n263(x)
+    end
+end
+
+def fun_l22_n394(x)
+    if (x < 1)
+        fun_l23_n52(x)
+    else
+        fun_l23_n566(x)
+    end
+end
+
+def fun_l22_n395(x)
+    if (x < 1)
+        fun_l23_n290(x)
+    else
+        fun_l23_n558(x)
+    end
+end
+
+def fun_l22_n396(x)
+    if (x < 1)
+        fun_l23_n51(x)
+    else
+        fun_l23_n365(x)
+    end
+end
+
+def fun_l22_n397(x)
+    if (x < 1)
+        fun_l23_n505(x)
+    else
+        fun_l23_n461(x)
+    end
+end
+
+def fun_l22_n398(x)
+    if (x < 1)
+        fun_l23_n415(x)
+    else
+        fun_l23_n460(x)
+    end
+end
+
+def fun_l22_n399(x)
+    if (x < 1)
+        fun_l23_n370(x)
+    else
+        fun_l23_n377(x)
+    end
+end
+
+def fun_l22_n400(x)
+    if (x < 1)
+        fun_l23_n644(x)
+    else
+        fun_l23_n300(x)
+    end
+end
+
+def fun_l22_n401(x)
+    if (x < 1)
+        fun_l23_n22(x)
+    else
+        fun_l23_n348(x)
+    end
+end
+
+def fun_l22_n402(x)
+    if (x < 1)
+        fun_l23_n286(x)
+    else
+        fun_l23_n991(x)
+    end
+end
+
+def fun_l22_n403(x)
+    if (x < 1)
+        fun_l23_n928(x)
+    else
+        fun_l23_n627(x)
+    end
+end
+
+def fun_l22_n404(x)
+    if (x < 1)
+        fun_l23_n884(x)
+    else
+        fun_l23_n326(x)
+    end
+end
+
+def fun_l22_n405(x)
+    if (x < 1)
+        fun_l23_n586(x)
+    else
+        fun_l23_n913(x)
+    end
+end
+
+def fun_l22_n406(x)
+    if (x < 1)
+        fun_l23_n732(x)
+    else
+        fun_l23_n964(x)
+    end
+end
+
+def fun_l22_n407(x)
+    if (x < 1)
+        fun_l23_n301(x)
+    else
+        fun_l23_n946(x)
+    end
+end
+
+def fun_l22_n408(x)
+    if (x < 1)
+        fun_l23_n540(x)
+    else
+        fun_l23_n29(x)
+    end
+end
+
+def fun_l22_n409(x)
+    if (x < 1)
+        fun_l23_n793(x)
+    else
+        fun_l23_n420(x)
+    end
+end
+
+def fun_l22_n410(x)
+    if (x < 1)
+        fun_l23_n766(x)
+    else
+        fun_l23_n473(x)
+    end
+end
+
+def fun_l22_n411(x)
+    if (x < 1)
+        fun_l23_n683(x)
+    else
+        fun_l23_n12(x)
+    end
+end
+
+def fun_l22_n412(x)
+    if (x < 1)
+        fun_l23_n273(x)
+    else
+        fun_l23_n45(x)
+    end
+end
+
+def fun_l22_n413(x)
+    if (x < 1)
+        fun_l23_n732(x)
+    else
+        fun_l23_n313(x)
+    end
+end
+
+def fun_l22_n414(x)
+    if (x < 1)
+        fun_l23_n291(x)
+    else
+        fun_l23_n216(x)
+    end
+end
+
+def fun_l22_n415(x)
+    if (x < 1)
+        fun_l23_n6(x)
+    else
+        fun_l23_n482(x)
+    end
+end
+
+def fun_l22_n416(x)
+    if (x < 1)
+        fun_l23_n214(x)
+    else
+        fun_l23_n341(x)
+    end
+end
+
+def fun_l22_n417(x)
+    if (x < 1)
+        fun_l23_n690(x)
+    else
+        fun_l23_n773(x)
+    end
+end
+
+def fun_l22_n418(x)
+    if (x < 1)
+        fun_l23_n437(x)
+    else
+        fun_l23_n941(x)
+    end
+end
+
+def fun_l22_n419(x)
+    if (x < 1)
+        fun_l23_n131(x)
+    else
+        fun_l23_n14(x)
+    end
+end
+
+def fun_l22_n420(x)
+    if (x < 1)
+        fun_l23_n924(x)
+    else
+        fun_l23_n359(x)
+    end
+end
+
+def fun_l22_n421(x)
+    if (x < 1)
+        fun_l23_n653(x)
+    else
+        fun_l23_n875(x)
+    end
+end
+
+def fun_l22_n422(x)
+    if (x < 1)
+        fun_l23_n411(x)
+    else
+        fun_l23_n981(x)
+    end
+end
+
+def fun_l22_n423(x)
+    if (x < 1)
+        fun_l23_n258(x)
+    else
+        fun_l23_n876(x)
+    end
+end
+
+def fun_l22_n424(x)
+    if (x < 1)
+        fun_l23_n430(x)
+    else
+        fun_l23_n62(x)
+    end
+end
+
+def fun_l22_n425(x)
+    if (x < 1)
+        fun_l23_n444(x)
+    else
+        fun_l23_n48(x)
+    end
+end
+
+def fun_l22_n426(x)
+    if (x < 1)
+        fun_l23_n905(x)
+    else
+        fun_l23_n458(x)
+    end
+end
+
+def fun_l22_n427(x)
+    if (x < 1)
+        fun_l23_n440(x)
+    else
+        fun_l23_n411(x)
+    end
+end
+
+def fun_l22_n428(x)
+    if (x < 1)
+        fun_l23_n655(x)
+    else
+        fun_l23_n622(x)
+    end
+end
+
+def fun_l22_n429(x)
+    if (x < 1)
+        fun_l23_n587(x)
+    else
+        fun_l23_n638(x)
+    end
+end
+
+def fun_l22_n430(x)
+    if (x < 1)
+        fun_l23_n156(x)
+    else
+        fun_l23_n900(x)
+    end
+end
+
+def fun_l22_n431(x)
+    if (x < 1)
+        fun_l23_n136(x)
+    else
+        fun_l23_n562(x)
+    end
+end
+
+def fun_l22_n432(x)
+    if (x < 1)
+        fun_l23_n897(x)
+    else
+        fun_l23_n16(x)
+    end
+end
+
+def fun_l22_n433(x)
+    if (x < 1)
+        fun_l23_n28(x)
+    else
+        fun_l23_n504(x)
+    end
+end
+
+def fun_l22_n434(x)
+    if (x < 1)
+        fun_l23_n987(x)
+    else
+        fun_l23_n640(x)
+    end
+end
+
+def fun_l22_n435(x)
+    if (x < 1)
+        fun_l23_n395(x)
+    else
+        fun_l23_n922(x)
+    end
+end
+
+def fun_l22_n436(x)
+    if (x < 1)
+        fun_l23_n679(x)
+    else
+        fun_l23_n576(x)
+    end
+end
+
+def fun_l22_n437(x)
+    if (x < 1)
+        fun_l23_n915(x)
+    else
+        fun_l23_n240(x)
+    end
+end
+
+def fun_l22_n438(x)
+    if (x < 1)
+        fun_l23_n889(x)
+    else
+        fun_l23_n38(x)
+    end
+end
+
+def fun_l22_n439(x)
+    if (x < 1)
+        fun_l23_n522(x)
+    else
+        fun_l23_n481(x)
+    end
+end
+
+def fun_l22_n440(x)
+    if (x < 1)
+        fun_l23_n458(x)
+    else
+        fun_l23_n81(x)
+    end
+end
+
+def fun_l22_n441(x)
+    if (x < 1)
+        fun_l23_n220(x)
+    else
+        fun_l23_n393(x)
+    end
+end
+
+def fun_l22_n442(x)
+    if (x < 1)
+        fun_l23_n404(x)
+    else
+        fun_l23_n945(x)
+    end
+end
+
+def fun_l22_n443(x)
+    if (x < 1)
+        fun_l23_n347(x)
+    else
+        fun_l23_n377(x)
+    end
+end
+
+def fun_l22_n444(x)
+    if (x < 1)
+        fun_l23_n484(x)
+    else
+        fun_l23_n277(x)
+    end
+end
+
+def fun_l22_n445(x)
+    if (x < 1)
+        fun_l23_n118(x)
+    else
+        fun_l23_n578(x)
+    end
+end
+
+def fun_l22_n446(x)
+    if (x < 1)
+        fun_l23_n674(x)
+    else
+        fun_l23_n238(x)
+    end
+end
+
+def fun_l22_n447(x)
+    if (x < 1)
+        fun_l23_n290(x)
+    else
+        fun_l23_n275(x)
+    end
+end
+
+def fun_l22_n448(x)
+    if (x < 1)
+        fun_l23_n358(x)
+    else
+        fun_l23_n939(x)
+    end
+end
+
+def fun_l22_n449(x)
+    if (x < 1)
+        fun_l23_n38(x)
+    else
+        fun_l23_n122(x)
+    end
+end
+
+def fun_l22_n450(x)
+    if (x < 1)
+        fun_l23_n575(x)
+    else
+        fun_l23_n582(x)
+    end
+end
+
+def fun_l22_n451(x)
+    if (x < 1)
+        fun_l23_n657(x)
+    else
+        fun_l23_n986(x)
+    end
+end
+
+def fun_l22_n452(x)
+    if (x < 1)
+        fun_l23_n771(x)
+    else
+        fun_l23_n603(x)
+    end
+end
+
+def fun_l22_n453(x)
+    if (x < 1)
+        fun_l23_n981(x)
+    else
+        fun_l23_n762(x)
+    end
+end
+
+def fun_l22_n454(x)
+    if (x < 1)
+        fun_l23_n93(x)
+    else
+        fun_l23_n26(x)
+    end
+end
+
+def fun_l22_n455(x)
+    if (x < 1)
+        fun_l23_n675(x)
+    else
+        fun_l23_n332(x)
+    end
+end
+
+def fun_l22_n456(x)
+    if (x < 1)
+        fun_l23_n923(x)
+    else
+        fun_l23_n416(x)
+    end
+end
+
+def fun_l22_n457(x)
+    if (x < 1)
+        fun_l23_n179(x)
+    else
+        fun_l23_n485(x)
+    end
+end
+
+def fun_l22_n458(x)
+    if (x < 1)
+        fun_l23_n38(x)
+    else
+        fun_l23_n319(x)
+    end
+end
+
+def fun_l22_n459(x)
+    if (x < 1)
+        fun_l23_n22(x)
+    else
+        fun_l23_n747(x)
+    end
+end
+
+def fun_l22_n460(x)
+    if (x < 1)
+        fun_l23_n643(x)
+    else
+        fun_l23_n132(x)
+    end
+end
+
+def fun_l22_n461(x)
+    if (x < 1)
+        fun_l23_n165(x)
+    else
+        fun_l23_n673(x)
+    end
+end
+
+def fun_l22_n462(x)
+    if (x < 1)
+        fun_l23_n988(x)
+    else
+        fun_l23_n916(x)
+    end
+end
+
+def fun_l22_n463(x)
+    if (x < 1)
+        fun_l23_n331(x)
+    else
+        fun_l23_n853(x)
+    end
+end
+
+def fun_l22_n464(x)
+    if (x < 1)
+        fun_l23_n699(x)
+    else
+        fun_l23_n771(x)
+    end
+end
+
+def fun_l22_n465(x)
+    if (x < 1)
+        fun_l23_n358(x)
+    else
+        fun_l23_n966(x)
+    end
+end
+
+def fun_l22_n466(x)
+    if (x < 1)
+        fun_l23_n723(x)
+    else
+        fun_l23_n897(x)
+    end
+end
+
+def fun_l22_n467(x)
+    if (x < 1)
+        fun_l23_n69(x)
+    else
+        fun_l23_n186(x)
+    end
+end
+
+def fun_l22_n468(x)
+    if (x < 1)
+        fun_l23_n661(x)
+    else
+        fun_l23_n420(x)
+    end
+end
+
+def fun_l22_n469(x)
+    if (x < 1)
+        fun_l23_n175(x)
+    else
+        fun_l23_n270(x)
+    end
+end
+
+def fun_l22_n470(x)
+    if (x < 1)
+        fun_l23_n556(x)
+    else
+        fun_l23_n344(x)
+    end
+end
+
+def fun_l22_n471(x)
+    if (x < 1)
+        fun_l23_n413(x)
+    else
+        fun_l23_n338(x)
+    end
+end
+
+def fun_l22_n472(x)
+    if (x < 1)
+        fun_l23_n456(x)
+    else
+        fun_l23_n125(x)
+    end
+end
+
+def fun_l22_n473(x)
+    if (x < 1)
+        fun_l23_n364(x)
+    else
+        fun_l23_n347(x)
+    end
+end
+
+def fun_l22_n474(x)
+    if (x < 1)
+        fun_l23_n436(x)
+    else
+        fun_l23_n897(x)
+    end
+end
+
+def fun_l22_n475(x)
+    if (x < 1)
+        fun_l23_n613(x)
+    else
+        fun_l23_n851(x)
+    end
+end
+
+def fun_l22_n476(x)
+    if (x < 1)
+        fun_l23_n754(x)
+    else
+        fun_l23_n755(x)
+    end
+end
+
+def fun_l22_n477(x)
+    if (x < 1)
+        fun_l23_n899(x)
+    else
+        fun_l23_n496(x)
+    end
+end
+
+def fun_l22_n478(x)
+    if (x < 1)
+        fun_l23_n183(x)
+    else
+        fun_l23_n864(x)
+    end
+end
+
+def fun_l22_n479(x)
+    if (x < 1)
+        fun_l23_n11(x)
+    else
+        fun_l23_n679(x)
+    end
+end
+
+def fun_l22_n480(x)
+    if (x < 1)
+        fun_l23_n160(x)
+    else
+        fun_l23_n747(x)
+    end
+end
+
+def fun_l22_n481(x)
+    if (x < 1)
+        fun_l23_n138(x)
+    else
+        fun_l23_n762(x)
+    end
+end
+
+def fun_l22_n482(x)
+    if (x < 1)
+        fun_l23_n467(x)
+    else
+        fun_l23_n148(x)
+    end
+end
+
+def fun_l22_n483(x)
+    if (x < 1)
+        fun_l23_n97(x)
+    else
+        fun_l23_n826(x)
+    end
+end
+
+def fun_l22_n484(x)
+    if (x < 1)
+        fun_l23_n754(x)
+    else
+        fun_l23_n661(x)
+    end
+end
+
+def fun_l22_n485(x)
+    if (x < 1)
+        fun_l23_n415(x)
+    else
+        fun_l23_n531(x)
+    end
+end
+
+def fun_l22_n486(x)
+    if (x < 1)
+        fun_l23_n543(x)
+    else
+        fun_l23_n271(x)
+    end
+end
+
+def fun_l22_n487(x)
+    if (x < 1)
+        fun_l23_n240(x)
+    else
+        fun_l23_n221(x)
+    end
+end
+
+def fun_l22_n488(x)
+    if (x < 1)
+        fun_l23_n208(x)
+    else
+        fun_l23_n633(x)
+    end
+end
+
+def fun_l22_n489(x)
+    if (x < 1)
+        fun_l23_n539(x)
+    else
+        fun_l23_n925(x)
+    end
+end
+
+def fun_l22_n490(x)
+    if (x < 1)
+        fun_l23_n141(x)
+    else
+        fun_l23_n142(x)
+    end
+end
+
+def fun_l22_n491(x)
+    if (x < 1)
+        fun_l23_n899(x)
+    else
+        fun_l23_n407(x)
+    end
+end
+
+def fun_l22_n492(x)
+    if (x < 1)
+        fun_l23_n237(x)
+    else
+        fun_l23_n836(x)
+    end
+end
+
+def fun_l22_n493(x)
+    if (x < 1)
+        fun_l23_n23(x)
+    else
+        fun_l23_n266(x)
+    end
+end
+
+def fun_l22_n494(x)
+    if (x < 1)
+        fun_l23_n819(x)
+    else
+        fun_l23_n473(x)
+    end
+end
+
+def fun_l22_n495(x)
+    if (x < 1)
+        fun_l23_n182(x)
+    else
+        fun_l23_n253(x)
+    end
+end
+
+def fun_l22_n496(x)
+    if (x < 1)
+        fun_l23_n459(x)
+    else
+        fun_l23_n421(x)
+    end
+end
+
+def fun_l22_n497(x)
+    if (x < 1)
+        fun_l23_n553(x)
+    else
+        fun_l23_n207(x)
+    end
+end
+
+def fun_l22_n498(x)
+    if (x < 1)
+        fun_l23_n5(x)
+    else
+        fun_l23_n261(x)
+    end
+end
+
+def fun_l22_n499(x)
+    if (x < 1)
+        fun_l23_n53(x)
+    else
+        fun_l23_n478(x)
+    end
+end
+
+def fun_l22_n500(x)
+    if (x < 1)
+        fun_l23_n489(x)
+    else
+        fun_l23_n77(x)
+    end
+end
+
+def fun_l22_n501(x)
+    if (x < 1)
+        fun_l23_n551(x)
+    else
+        fun_l23_n854(x)
+    end
+end
+
+def fun_l22_n502(x)
+    if (x < 1)
+        fun_l23_n32(x)
+    else
+        fun_l23_n241(x)
+    end
+end
+
+def fun_l22_n503(x)
+    if (x < 1)
+        fun_l23_n536(x)
+    else
+        fun_l23_n820(x)
+    end
+end
+
+def fun_l22_n504(x)
+    if (x < 1)
+        fun_l23_n521(x)
+    else
+        fun_l23_n551(x)
+    end
+end
+
+def fun_l22_n505(x)
+    if (x < 1)
+        fun_l23_n812(x)
+    else
+        fun_l23_n885(x)
+    end
+end
+
+def fun_l22_n506(x)
+    if (x < 1)
+        fun_l23_n935(x)
+    else
+        fun_l23_n38(x)
+    end
+end
+
+def fun_l22_n507(x)
+    if (x < 1)
+        fun_l23_n99(x)
+    else
+        fun_l23_n907(x)
+    end
+end
+
+def fun_l22_n508(x)
+    if (x < 1)
+        fun_l23_n89(x)
+    else
+        fun_l23_n322(x)
+    end
+end
+
+def fun_l22_n509(x)
+    if (x < 1)
+        fun_l23_n279(x)
+    else
+        fun_l23_n103(x)
+    end
+end
+
+def fun_l22_n510(x)
+    if (x < 1)
+        fun_l23_n476(x)
+    else
+        fun_l23_n947(x)
+    end
+end
+
+def fun_l22_n511(x)
+    if (x < 1)
+        fun_l23_n872(x)
+    else
+        fun_l23_n497(x)
+    end
+end
+
+def fun_l22_n512(x)
+    if (x < 1)
+        fun_l23_n508(x)
+    else
+        fun_l23_n548(x)
+    end
+end
+
+def fun_l22_n513(x)
+    if (x < 1)
+        fun_l23_n640(x)
+    else
+        fun_l23_n696(x)
+    end
+end
+
+def fun_l22_n514(x)
+    if (x < 1)
+        fun_l23_n694(x)
+    else
+        fun_l23_n483(x)
+    end
+end
+
+def fun_l22_n515(x)
+    if (x < 1)
+        fun_l23_n914(x)
+    else
+        fun_l23_n772(x)
+    end
+end
+
+def fun_l22_n516(x)
+    if (x < 1)
+        fun_l23_n192(x)
+    else
+        fun_l23_n35(x)
+    end
+end
+
+def fun_l22_n517(x)
+    if (x < 1)
+        fun_l23_n597(x)
+    else
+        fun_l23_n473(x)
+    end
+end
+
+def fun_l22_n518(x)
+    if (x < 1)
+        fun_l23_n974(x)
+    else
+        fun_l23_n315(x)
+    end
+end
+
+def fun_l22_n519(x)
+    if (x < 1)
+        fun_l23_n391(x)
+    else
+        fun_l23_n800(x)
+    end
+end
+
+def fun_l22_n520(x)
+    if (x < 1)
+        fun_l23_n106(x)
+    else
+        fun_l23_n170(x)
+    end
+end
+
+def fun_l22_n521(x)
+    if (x < 1)
+        fun_l23_n926(x)
+    else
+        fun_l23_n495(x)
+    end
+end
+
+def fun_l22_n522(x)
+    if (x < 1)
+        fun_l23_n135(x)
+    else
+        fun_l23_n304(x)
+    end
+end
+
+def fun_l22_n523(x)
+    if (x < 1)
+        fun_l23_n765(x)
+    else
+        fun_l23_n53(x)
+    end
+end
+
+def fun_l22_n524(x)
+    if (x < 1)
+        fun_l23_n699(x)
+    else
+        fun_l23_n158(x)
+    end
+end
+
+def fun_l22_n525(x)
+    if (x < 1)
+        fun_l23_n759(x)
+    else
+        fun_l23_n34(x)
+    end
+end
+
+def fun_l22_n526(x)
+    if (x < 1)
+        fun_l23_n813(x)
+    else
+        fun_l23_n938(x)
+    end
+end
+
+def fun_l22_n527(x)
+    if (x < 1)
+        fun_l23_n207(x)
+    else
+        fun_l23_n549(x)
+    end
+end
+
+def fun_l22_n528(x)
+    if (x < 1)
+        fun_l23_n468(x)
+    else
+        fun_l23_n681(x)
+    end
+end
+
+def fun_l22_n529(x)
+    if (x < 1)
+        fun_l23_n643(x)
+    else
+        fun_l23_n652(x)
+    end
+end
+
+def fun_l22_n530(x)
+    if (x < 1)
+        fun_l23_n254(x)
+    else
+        fun_l23_n283(x)
+    end
+end
+
+def fun_l22_n531(x)
+    if (x < 1)
+        fun_l23_n750(x)
+    else
+        fun_l23_n969(x)
+    end
+end
+
+def fun_l22_n532(x)
+    if (x < 1)
+        fun_l23_n343(x)
+    else
+        fun_l23_n578(x)
+    end
+end
+
+def fun_l22_n533(x)
+    if (x < 1)
+        fun_l23_n240(x)
+    else
+        fun_l23_n698(x)
+    end
+end
+
+def fun_l22_n534(x)
+    if (x < 1)
+        fun_l23_n497(x)
+    else
+        fun_l23_n992(x)
+    end
+end
+
+def fun_l22_n535(x)
+    if (x < 1)
+        fun_l23_n554(x)
+    else
+        fun_l23_n53(x)
+    end
+end
+
+def fun_l22_n536(x)
+    if (x < 1)
+        fun_l23_n165(x)
+    else
+        fun_l23_n467(x)
+    end
+end
+
+def fun_l22_n537(x)
+    if (x < 1)
+        fun_l23_n2(x)
+    else
+        fun_l23_n560(x)
+    end
+end
+
+def fun_l22_n538(x)
+    if (x < 1)
+        fun_l23_n151(x)
+    else
+        fun_l23_n434(x)
+    end
+end
+
+def fun_l22_n539(x)
+    if (x < 1)
+        fun_l23_n108(x)
+    else
+        fun_l23_n108(x)
+    end
+end
+
+def fun_l22_n540(x)
+    if (x < 1)
+        fun_l23_n879(x)
+    else
+        fun_l23_n608(x)
+    end
+end
+
+def fun_l22_n541(x)
+    if (x < 1)
+        fun_l23_n160(x)
+    else
+        fun_l23_n820(x)
+    end
+end
+
+def fun_l22_n542(x)
+    if (x < 1)
+        fun_l23_n813(x)
+    else
+        fun_l23_n169(x)
+    end
+end
+
+def fun_l22_n543(x)
+    if (x < 1)
+        fun_l23_n151(x)
+    else
+        fun_l23_n420(x)
+    end
+end
+
+def fun_l22_n544(x)
+    if (x < 1)
+        fun_l23_n81(x)
+    else
+        fun_l23_n226(x)
+    end
+end
+
+def fun_l22_n545(x)
+    if (x < 1)
+        fun_l23_n464(x)
+    else
+        fun_l23_n602(x)
+    end
+end
+
+def fun_l22_n546(x)
+    if (x < 1)
+        fun_l23_n798(x)
+    else
+        fun_l23_n395(x)
+    end
+end
+
+def fun_l22_n547(x)
+    if (x < 1)
+        fun_l23_n597(x)
+    else
+        fun_l23_n147(x)
+    end
+end
+
+def fun_l22_n548(x)
+    if (x < 1)
+        fun_l23_n952(x)
+    else
+        fun_l23_n515(x)
+    end
+end
+
+def fun_l22_n549(x)
+    if (x < 1)
+        fun_l23_n134(x)
+    else
+        fun_l23_n154(x)
+    end
+end
+
+def fun_l22_n550(x)
+    if (x < 1)
+        fun_l23_n35(x)
+    else
+        fun_l23_n492(x)
+    end
+end
+
+def fun_l22_n551(x)
+    if (x < 1)
+        fun_l23_n878(x)
+    else
+        fun_l23_n899(x)
+    end
+end
+
+def fun_l22_n552(x)
+    if (x < 1)
+        fun_l23_n574(x)
+    else
+        fun_l23_n108(x)
+    end
+end
+
+def fun_l22_n553(x)
+    if (x < 1)
+        fun_l23_n386(x)
+    else
+        fun_l23_n565(x)
+    end
+end
+
+def fun_l22_n554(x)
+    if (x < 1)
+        fun_l23_n551(x)
+    else
+        fun_l23_n905(x)
+    end
+end
+
+def fun_l22_n555(x)
+    if (x < 1)
+        fun_l23_n680(x)
+    else
+        fun_l23_n367(x)
+    end
+end
+
+def fun_l22_n556(x)
+    if (x < 1)
+        fun_l23_n452(x)
+    else
+        fun_l23_n211(x)
+    end
+end
+
+def fun_l22_n557(x)
+    if (x < 1)
+        fun_l23_n597(x)
+    else
+        fun_l23_n112(x)
+    end
+end
+
+def fun_l22_n558(x)
+    if (x < 1)
+        fun_l23_n22(x)
+    else
+        fun_l23_n966(x)
+    end
+end
+
+def fun_l22_n559(x)
+    if (x < 1)
+        fun_l23_n512(x)
+    else
+        fun_l23_n337(x)
+    end
+end
+
+def fun_l22_n560(x)
+    if (x < 1)
+        fun_l23_n649(x)
+    else
+        fun_l23_n361(x)
+    end
+end
+
+def fun_l22_n561(x)
+    if (x < 1)
+        fun_l23_n500(x)
+    else
+        fun_l23_n113(x)
+    end
+end
+
+def fun_l22_n562(x)
+    if (x < 1)
+        fun_l23_n455(x)
+    else
+        fun_l23_n734(x)
+    end
+end
+
+def fun_l22_n563(x)
+    if (x < 1)
+        fun_l23_n847(x)
+    else
+        fun_l23_n86(x)
+    end
+end
+
+def fun_l22_n564(x)
+    if (x < 1)
+        fun_l23_n251(x)
+    else
+        fun_l23_n203(x)
+    end
+end
+
+def fun_l22_n565(x)
+    if (x < 1)
+        fun_l23_n977(x)
+    else
+        fun_l23_n893(x)
+    end
+end
+
+def fun_l22_n566(x)
+    if (x < 1)
+        fun_l23_n693(x)
+    else
+        fun_l23_n507(x)
+    end
+end
+
+def fun_l22_n567(x)
+    if (x < 1)
+        fun_l23_n194(x)
+    else
+        fun_l23_n972(x)
+    end
+end
+
+def fun_l22_n568(x)
+    if (x < 1)
+        fun_l23_n44(x)
+    else
+        fun_l23_n694(x)
+    end
+end
+
+def fun_l22_n569(x)
+    if (x < 1)
+        fun_l23_n277(x)
+    else
+        fun_l23_n317(x)
+    end
+end
+
+def fun_l22_n570(x)
+    if (x < 1)
+        fun_l23_n40(x)
+    else
+        fun_l23_n10(x)
+    end
+end
+
+def fun_l22_n571(x)
+    if (x < 1)
+        fun_l23_n199(x)
+    else
+        fun_l23_n454(x)
+    end
+end
+
+def fun_l22_n572(x)
+    if (x < 1)
+        fun_l23_n821(x)
+    else
+        fun_l23_n556(x)
+    end
+end
+
+def fun_l22_n573(x)
+    if (x < 1)
+        fun_l23_n142(x)
+    else
+        fun_l23_n307(x)
+    end
+end
+
+def fun_l22_n574(x)
+    if (x < 1)
+        fun_l23_n291(x)
+    else
+        fun_l23_n152(x)
+    end
+end
+
+def fun_l22_n575(x)
+    if (x < 1)
+        fun_l23_n547(x)
+    else
+        fun_l23_n580(x)
+    end
+end
+
+def fun_l22_n576(x)
+    if (x < 1)
+        fun_l23_n841(x)
+    else
+        fun_l23_n518(x)
+    end
+end
+
+def fun_l22_n577(x)
+    if (x < 1)
+        fun_l23_n91(x)
+    else
+        fun_l23_n730(x)
+    end
+end
+
+def fun_l22_n578(x)
+    if (x < 1)
+        fun_l23_n626(x)
+    else
+        fun_l23_n403(x)
+    end
+end
+
+def fun_l22_n579(x)
+    if (x < 1)
+        fun_l23_n12(x)
+    else
+        fun_l23_n863(x)
+    end
+end
+
+def fun_l22_n580(x)
+    if (x < 1)
+        fun_l23_n878(x)
+    else
+        fun_l23_n28(x)
+    end
+end
+
+def fun_l22_n581(x)
+    if (x < 1)
+        fun_l23_n793(x)
+    else
+        fun_l23_n942(x)
+    end
+end
+
+def fun_l22_n582(x)
+    if (x < 1)
+        fun_l23_n168(x)
+    else
+        fun_l23_n102(x)
+    end
+end
+
+def fun_l22_n583(x)
+    if (x < 1)
+        fun_l23_n40(x)
+    else
+        fun_l23_n231(x)
+    end
+end
+
+def fun_l22_n584(x)
+    if (x < 1)
+        fun_l23_n54(x)
+    else
+        fun_l23_n734(x)
+    end
+end
+
+def fun_l22_n585(x)
+    if (x < 1)
+        fun_l23_n878(x)
+    else
+        fun_l23_n938(x)
+    end
+end
+
+def fun_l22_n586(x)
+    if (x < 1)
+        fun_l23_n89(x)
+    else
+        fun_l23_n533(x)
+    end
+end
+
+def fun_l22_n587(x)
+    if (x < 1)
+        fun_l23_n289(x)
+    else
+        fun_l23_n587(x)
+    end
+end
+
+def fun_l22_n588(x)
+    if (x < 1)
+        fun_l23_n716(x)
+    else
+        fun_l23_n785(x)
+    end
+end
+
+def fun_l22_n589(x)
+    if (x < 1)
+        fun_l23_n22(x)
+    else
+        fun_l23_n820(x)
+    end
+end
+
+def fun_l22_n590(x)
+    if (x < 1)
+        fun_l23_n945(x)
+    else
+        fun_l23_n644(x)
+    end
+end
+
+def fun_l22_n591(x)
+    if (x < 1)
+        fun_l23_n209(x)
+    else
+        fun_l23_n86(x)
+    end
+end
+
+def fun_l22_n592(x)
+    if (x < 1)
+        fun_l23_n209(x)
+    else
+        fun_l23_n971(x)
+    end
+end
+
+def fun_l22_n593(x)
+    if (x < 1)
+        fun_l23_n489(x)
+    else
+        fun_l23_n725(x)
+    end
+end
+
+def fun_l22_n594(x)
+    if (x < 1)
+        fun_l23_n42(x)
+    else
+        fun_l23_n405(x)
+    end
+end
+
+def fun_l22_n595(x)
+    if (x < 1)
+        fun_l23_n162(x)
+    else
+        fun_l23_n222(x)
+    end
+end
+
+def fun_l22_n596(x)
+    if (x < 1)
+        fun_l23_n942(x)
+    else
+        fun_l23_n193(x)
+    end
+end
+
+def fun_l22_n597(x)
+    if (x < 1)
+        fun_l23_n616(x)
+    else
+        fun_l23_n806(x)
+    end
+end
+
+def fun_l22_n598(x)
+    if (x < 1)
+        fun_l23_n278(x)
+    else
+        fun_l23_n330(x)
+    end
+end
+
+def fun_l22_n599(x)
+    if (x < 1)
+        fun_l23_n863(x)
+    else
+        fun_l23_n428(x)
+    end
+end
+
+def fun_l22_n600(x)
+    if (x < 1)
+        fun_l23_n315(x)
+    else
+        fun_l23_n319(x)
+    end
+end
+
+def fun_l22_n601(x)
+    if (x < 1)
+        fun_l23_n409(x)
+    else
+        fun_l23_n682(x)
+    end
+end
+
+def fun_l22_n602(x)
+    if (x < 1)
+        fun_l23_n307(x)
+    else
+        fun_l23_n47(x)
+    end
+end
+
+def fun_l22_n603(x)
+    if (x < 1)
+        fun_l23_n578(x)
+    else
+        fun_l23_n762(x)
+    end
+end
+
+def fun_l22_n604(x)
+    if (x < 1)
+        fun_l23_n208(x)
+    else
+        fun_l23_n314(x)
+    end
+end
+
+def fun_l22_n605(x)
+    if (x < 1)
+        fun_l23_n259(x)
+    else
+        fun_l23_n720(x)
+    end
+end
+
+def fun_l22_n606(x)
+    if (x < 1)
+        fun_l23_n272(x)
+    else
+        fun_l23_n619(x)
+    end
+end
+
+def fun_l22_n607(x)
+    if (x < 1)
+        fun_l23_n550(x)
+    else
+        fun_l23_n850(x)
+    end
+end
+
+def fun_l22_n608(x)
+    if (x < 1)
+        fun_l23_n617(x)
+    else
+        fun_l23_n999(x)
+    end
+end
+
+def fun_l22_n609(x)
+    if (x < 1)
+        fun_l23_n203(x)
+    else
+        fun_l23_n597(x)
+    end
+end
+
+def fun_l22_n610(x)
+    if (x < 1)
+        fun_l23_n547(x)
+    else
+        fun_l23_n252(x)
+    end
+end
+
+def fun_l22_n611(x)
+    if (x < 1)
+        fun_l23_n427(x)
+    else
+        fun_l23_n16(x)
+    end
+end
+
+def fun_l22_n612(x)
+    if (x < 1)
+        fun_l23_n236(x)
+    else
+        fun_l23_n142(x)
+    end
+end
+
+def fun_l22_n613(x)
+    if (x < 1)
+        fun_l23_n94(x)
+    else
+        fun_l23_n739(x)
+    end
+end
+
+def fun_l22_n614(x)
+    if (x < 1)
+        fun_l23_n504(x)
+    else
+        fun_l23_n101(x)
+    end
+end
+
+def fun_l22_n615(x)
+    if (x < 1)
+        fun_l23_n469(x)
+    else
+        fun_l23_n650(x)
+    end
+end
+
+def fun_l22_n616(x)
+    if (x < 1)
+        fun_l23_n752(x)
+    else
+        fun_l23_n262(x)
+    end
+end
+
+def fun_l22_n617(x)
+    if (x < 1)
+        fun_l23_n256(x)
+    else
+        fun_l23_n269(x)
+    end
+end
+
+def fun_l22_n618(x)
+    if (x < 1)
+        fun_l23_n784(x)
+    else
+        fun_l23_n402(x)
+    end
+end
+
+def fun_l22_n619(x)
+    if (x < 1)
+        fun_l23_n405(x)
+    else
+        fun_l23_n585(x)
+    end
+end
+
+def fun_l22_n620(x)
+    if (x < 1)
+        fun_l23_n33(x)
+    else
+        fun_l23_n357(x)
+    end
+end
+
+def fun_l22_n621(x)
+    if (x < 1)
+        fun_l23_n448(x)
+    else
+        fun_l23_n618(x)
+    end
+end
+
+def fun_l22_n622(x)
+    if (x < 1)
+        fun_l23_n520(x)
+    else
+        fun_l23_n612(x)
+    end
+end
+
+def fun_l22_n623(x)
+    if (x < 1)
+        fun_l23_n54(x)
+    else
+        fun_l23_n872(x)
+    end
+end
+
+def fun_l22_n624(x)
+    if (x < 1)
+        fun_l23_n915(x)
+    else
+        fun_l23_n1(x)
+    end
+end
+
+def fun_l22_n625(x)
+    if (x < 1)
+        fun_l23_n274(x)
+    else
+        fun_l23_n509(x)
+    end
+end
+
+def fun_l22_n626(x)
+    if (x < 1)
+        fun_l23_n506(x)
+    else
+        fun_l23_n938(x)
+    end
+end
+
+def fun_l22_n627(x)
+    if (x < 1)
+        fun_l23_n463(x)
+    else
+        fun_l23_n436(x)
+    end
+end
+
+def fun_l22_n628(x)
+    if (x < 1)
+        fun_l23_n33(x)
+    else
+        fun_l23_n279(x)
+    end
+end
+
+def fun_l22_n629(x)
+    if (x < 1)
+        fun_l23_n825(x)
+    else
+        fun_l23_n11(x)
+    end
+end
+
+def fun_l22_n630(x)
+    if (x < 1)
+        fun_l23_n778(x)
+    else
+        fun_l23_n77(x)
+    end
+end
+
+def fun_l22_n631(x)
+    if (x < 1)
+        fun_l23_n826(x)
+    else
+        fun_l23_n601(x)
+    end
+end
+
+def fun_l22_n632(x)
+    if (x < 1)
+        fun_l23_n973(x)
+    else
+        fun_l23_n444(x)
+    end
+end
+
+def fun_l22_n633(x)
+    if (x < 1)
+        fun_l23_n59(x)
+    else
+        fun_l23_n578(x)
+    end
+end
+
+def fun_l22_n634(x)
+    if (x < 1)
+        fun_l23_n366(x)
+    else
+        fun_l23_n128(x)
+    end
+end
+
+def fun_l22_n635(x)
+    if (x < 1)
+        fun_l23_n733(x)
+    else
+        fun_l23_n486(x)
+    end
+end
+
+def fun_l22_n636(x)
+    if (x < 1)
+        fun_l23_n22(x)
+    else
+        fun_l23_n997(x)
+    end
+end
+
+def fun_l22_n637(x)
+    if (x < 1)
+        fun_l23_n286(x)
+    else
+        fun_l23_n609(x)
+    end
+end
+
+def fun_l22_n638(x)
+    if (x < 1)
+        fun_l23_n519(x)
+    else
+        fun_l23_n381(x)
+    end
+end
+
+def fun_l22_n639(x)
+    if (x < 1)
+        fun_l23_n697(x)
+    else
+        fun_l23_n954(x)
+    end
+end
+
+def fun_l22_n640(x)
+    if (x < 1)
+        fun_l23_n348(x)
+    else
+        fun_l23_n261(x)
+    end
+end
+
+def fun_l22_n641(x)
+    if (x < 1)
+        fun_l23_n426(x)
+    else
+        fun_l23_n166(x)
+    end
+end
+
+def fun_l22_n642(x)
+    if (x < 1)
+        fun_l23_n488(x)
+    else
+        fun_l23_n79(x)
+    end
+end
+
+def fun_l22_n643(x)
+    if (x < 1)
+        fun_l23_n186(x)
+    else
+        fun_l23_n723(x)
+    end
+end
+
+def fun_l22_n644(x)
+    if (x < 1)
+        fun_l23_n582(x)
+    else
+        fun_l23_n365(x)
+    end
+end
+
+def fun_l22_n645(x)
+    if (x < 1)
+        fun_l23_n36(x)
+    else
+        fun_l23_n726(x)
+    end
+end
+
+def fun_l22_n646(x)
+    if (x < 1)
+        fun_l23_n585(x)
+    else
+        fun_l23_n770(x)
+    end
+end
+
+def fun_l22_n647(x)
+    if (x < 1)
+        fun_l23_n68(x)
+    else
+        fun_l23_n261(x)
+    end
+end
+
+def fun_l22_n648(x)
+    if (x < 1)
+        fun_l23_n208(x)
+    else
+        fun_l23_n302(x)
+    end
+end
+
+def fun_l22_n649(x)
+    if (x < 1)
+        fun_l23_n539(x)
+    else
+        fun_l23_n731(x)
+    end
+end
+
+def fun_l22_n650(x)
+    if (x < 1)
+        fun_l23_n709(x)
+    else
+        fun_l23_n144(x)
+    end
+end
+
+def fun_l22_n651(x)
+    if (x < 1)
+        fun_l23_n802(x)
+    else
+        fun_l23_n886(x)
+    end
+end
+
+def fun_l22_n652(x)
+    if (x < 1)
+        fun_l23_n796(x)
+    else
+        fun_l23_n574(x)
+    end
+end
+
+def fun_l22_n653(x)
+    if (x < 1)
+        fun_l23_n755(x)
+    else
+        fun_l23_n960(x)
+    end
+end
+
+def fun_l22_n654(x)
+    if (x < 1)
+        fun_l23_n415(x)
+    else
+        fun_l23_n543(x)
+    end
+end
+
+def fun_l22_n655(x)
+    if (x < 1)
+        fun_l23_n932(x)
+    else
+        fun_l23_n412(x)
+    end
+end
+
+def fun_l22_n656(x)
+    if (x < 1)
+        fun_l23_n216(x)
+    else
+        fun_l23_n869(x)
+    end
+end
+
+def fun_l22_n657(x)
+    if (x < 1)
+        fun_l23_n750(x)
+    else
+        fun_l23_n66(x)
+    end
+end
+
+def fun_l22_n658(x)
+    if (x < 1)
+        fun_l23_n400(x)
+    else
+        fun_l23_n31(x)
+    end
+end
+
+def fun_l22_n659(x)
+    if (x < 1)
+        fun_l23_n815(x)
+    else
+        fun_l23_n866(x)
+    end
+end
+
+def fun_l22_n660(x)
+    if (x < 1)
+        fun_l23_n459(x)
+    else
+        fun_l23_n833(x)
+    end
+end
+
+def fun_l22_n661(x)
+    if (x < 1)
+        fun_l23_n167(x)
+    else
+        fun_l23_n861(x)
+    end
+end
+
+def fun_l22_n662(x)
+    if (x < 1)
+        fun_l23_n789(x)
+    else
+        fun_l23_n543(x)
+    end
+end
+
+def fun_l22_n663(x)
+    if (x < 1)
+        fun_l23_n850(x)
+    else
+        fun_l23_n899(x)
+    end
+end
+
+def fun_l22_n664(x)
+    if (x < 1)
+        fun_l23_n986(x)
+    else
+        fun_l23_n924(x)
+    end
+end
+
+def fun_l22_n665(x)
+    if (x < 1)
+        fun_l23_n667(x)
+    else
+        fun_l23_n510(x)
+    end
+end
+
+def fun_l22_n666(x)
+    if (x < 1)
+        fun_l23_n744(x)
+    else
+        fun_l23_n530(x)
+    end
+end
+
+def fun_l22_n667(x)
+    if (x < 1)
+        fun_l23_n930(x)
+    else
+        fun_l23_n693(x)
+    end
+end
+
+def fun_l22_n668(x)
+    if (x < 1)
+        fun_l23_n942(x)
+    else
+        fun_l23_n785(x)
+    end
+end
+
+def fun_l22_n669(x)
+    if (x < 1)
+        fun_l23_n520(x)
+    else
+        fun_l23_n342(x)
+    end
+end
+
+def fun_l22_n670(x)
+    if (x < 1)
+        fun_l23_n865(x)
+    else
+        fun_l23_n63(x)
+    end
+end
+
+def fun_l22_n671(x)
+    if (x < 1)
+        fun_l23_n173(x)
+    else
+        fun_l23_n142(x)
+    end
+end
+
+def fun_l22_n672(x)
+    if (x < 1)
+        fun_l23_n487(x)
+    else
+        fun_l23_n400(x)
+    end
+end
+
+def fun_l22_n673(x)
+    if (x < 1)
+        fun_l23_n330(x)
+    else
+        fun_l23_n639(x)
+    end
+end
+
+def fun_l22_n674(x)
+    if (x < 1)
+        fun_l23_n593(x)
+    else
+        fun_l23_n653(x)
+    end
+end
+
+def fun_l22_n675(x)
+    if (x < 1)
+        fun_l23_n167(x)
+    else
+        fun_l23_n173(x)
+    end
+end
+
+def fun_l22_n676(x)
+    if (x < 1)
+        fun_l23_n288(x)
+    else
+        fun_l23_n412(x)
+    end
+end
+
+def fun_l22_n677(x)
+    if (x < 1)
+        fun_l23_n266(x)
+    else
+        fun_l23_n728(x)
+    end
+end
+
+def fun_l22_n678(x)
+    if (x < 1)
+        fun_l23_n137(x)
+    else
+        fun_l23_n277(x)
+    end
+end
+
+def fun_l22_n679(x)
+    if (x < 1)
+        fun_l23_n732(x)
+    else
+        fun_l23_n760(x)
+    end
+end
+
+def fun_l22_n680(x)
+    if (x < 1)
+        fun_l23_n372(x)
+    else
+        fun_l23_n26(x)
+    end
+end
+
+def fun_l22_n681(x)
+    if (x < 1)
+        fun_l23_n156(x)
+    else
+        fun_l23_n449(x)
+    end
+end
+
+def fun_l22_n682(x)
+    if (x < 1)
+        fun_l23_n117(x)
+    else
+        fun_l23_n711(x)
+    end
+end
+
+def fun_l22_n683(x)
+    if (x < 1)
+        fun_l23_n732(x)
+    else
+        fun_l23_n922(x)
+    end
+end
+
+def fun_l22_n684(x)
+    if (x < 1)
+        fun_l23_n116(x)
+    else
+        fun_l23_n347(x)
+    end
+end
+
+def fun_l22_n685(x)
+    if (x < 1)
+        fun_l23_n277(x)
+    else
+        fun_l23_n837(x)
+    end
+end
+
+def fun_l22_n686(x)
+    if (x < 1)
+        fun_l23_n578(x)
+    else
+        fun_l23_n290(x)
+    end
+end
+
+def fun_l22_n687(x)
+    if (x < 1)
+        fun_l23_n858(x)
+    else
+        fun_l23_n390(x)
+    end
+end
+
+def fun_l22_n688(x)
+    if (x < 1)
+        fun_l23_n52(x)
+    else
+        fun_l23_n759(x)
+    end
+end
+
+def fun_l22_n689(x)
+    if (x < 1)
+        fun_l23_n873(x)
+    else
+        fun_l23_n25(x)
+    end
+end
+
+def fun_l22_n690(x)
+    if (x < 1)
+        fun_l23_n262(x)
+    else
+        fun_l23_n511(x)
+    end
+end
+
+def fun_l22_n691(x)
+    if (x < 1)
+        fun_l23_n654(x)
+    else
+        fun_l23_n359(x)
+    end
+end
+
+def fun_l22_n692(x)
+    if (x < 1)
+        fun_l23_n933(x)
+    else
+        fun_l23_n369(x)
+    end
+end
+
+def fun_l22_n693(x)
+    if (x < 1)
+        fun_l23_n845(x)
+    else
+        fun_l23_n999(x)
+    end
+end
+
+def fun_l22_n694(x)
+    if (x < 1)
+        fun_l23_n479(x)
+    else
+        fun_l23_n284(x)
+    end
+end
+
+def fun_l22_n695(x)
+    if (x < 1)
+        fun_l23_n383(x)
+    else
+        fun_l23_n91(x)
+    end
+end
+
+def fun_l22_n696(x)
+    if (x < 1)
+        fun_l23_n467(x)
+    else
+        fun_l23_n555(x)
+    end
+end
+
+def fun_l22_n697(x)
+    if (x < 1)
+        fun_l23_n590(x)
+    else
+        fun_l23_n372(x)
+    end
+end
+
+def fun_l22_n698(x)
+    if (x < 1)
+        fun_l23_n706(x)
+    else
+        fun_l23_n195(x)
+    end
+end
+
+def fun_l22_n699(x)
+    if (x < 1)
+        fun_l23_n621(x)
+    else
+        fun_l23_n265(x)
+    end
+end
+
+def fun_l22_n700(x)
+    if (x < 1)
+        fun_l23_n505(x)
+    else
+        fun_l23_n831(x)
+    end
+end
+
+def fun_l22_n701(x)
+    if (x < 1)
+        fun_l23_n361(x)
+    else
+        fun_l23_n74(x)
+    end
+end
+
+def fun_l22_n702(x)
+    if (x < 1)
+        fun_l23_n734(x)
+    else
+        fun_l23_n922(x)
+    end
+end
+
+def fun_l22_n703(x)
+    if (x < 1)
+        fun_l23_n457(x)
+    else
+        fun_l23_n219(x)
+    end
+end
+
+def fun_l22_n704(x)
+    if (x < 1)
+        fun_l23_n436(x)
+    else
+        fun_l23_n733(x)
+    end
+end
+
+def fun_l22_n705(x)
+    if (x < 1)
+        fun_l23_n150(x)
+    else
+        fun_l23_n463(x)
+    end
+end
+
+def fun_l22_n706(x)
+    if (x < 1)
+        fun_l23_n486(x)
+    else
+        fun_l23_n906(x)
+    end
+end
+
+def fun_l22_n707(x)
+    if (x < 1)
+        fun_l23_n826(x)
+    else
+        fun_l23_n829(x)
+    end
+end
+
+def fun_l22_n708(x)
+    if (x < 1)
+        fun_l23_n186(x)
+    else
+        fun_l23_n555(x)
+    end
+end
+
+def fun_l22_n709(x)
+    if (x < 1)
+        fun_l23_n186(x)
+    else
+        fun_l23_n739(x)
+    end
+end
+
+def fun_l22_n710(x)
+    if (x < 1)
+        fun_l23_n58(x)
+    else
+        fun_l23_n395(x)
+    end
+end
+
+def fun_l22_n711(x)
+    if (x < 1)
+        fun_l23_n916(x)
+    else
+        fun_l23_n546(x)
+    end
+end
+
+def fun_l22_n712(x)
+    if (x < 1)
+        fun_l23_n309(x)
+    else
+        fun_l23_n582(x)
+    end
+end
+
+def fun_l22_n713(x)
+    if (x < 1)
+        fun_l23_n460(x)
+    else
+        fun_l23_n1(x)
+    end
+end
+
+def fun_l22_n714(x)
+    if (x < 1)
+        fun_l23_n270(x)
+    else
+        fun_l23_n888(x)
+    end
+end
+
+def fun_l22_n715(x)
+    if (x < 1)
+        fun_l23_n564(x)
+    else
+        fun_l23_n652(x)
+    end
+end
+
+def fun_l22_n716(x)
+    if (x < 1)
+        fun_l23_n14(x)
+    else
+        fun_l23_n862(x)
+    end
+end
+
+def fun_l22_n717(x)
+    if (x < 1)
+        fun_l23_n15(x)
+    else
+        fun_l23_n366(x)
+    end
+end
+
+def fun_l22_n718(x)
+    if (x < 1)
+        fun_l23_n580(x)
+    else
+        fun_l23_n367(x)
+    end
+end
+
+def fun_l22_n719(x)
+    if (x < 1)
+        fun_l23_n256(x)
+    else
+        fun_l23_n385(x)
+    end
+end
+
+def fun_l22_n720(x)
+    if (x < 1)
+        fun_l23_n735(x)
+    else
+        fun_l23_n811(x)
+    end
+end
+
+def fun_l22_n721(x)
+    if (x < 1)
+        fun_l23_n348(x)
+    else
+        fun_l23_n681(x)
+    end
+end
+
+def fun_l22_n722(x)
+    if (x < 1)
+        fun_l23_n908(x)
+    else
+        fun_l23_n80(x)
+    end
+end
+
+def fun_l22_n723(x)
+    if (x < 1)
+        fun_l23_n523(x)
+    else
+        fun_l23_n91(x)
+    end
+end
+
+def fun_l22_n724(x)
+    if (x < 1)
+        fun_l23_n212(x)
+    else
+        fun_l23_n220(x)
+    end
+end
+
+def fun_l22_n725(x)
+    if (x < 1)
+        fun_l23_n396(x)
+    else
+        fun_l23_n855(x)
+    end
+end
+
+def fun_l22_n726(x)
+    if (x < 1)
+        fun_l23_n717(x)
+    else
+        fun_l23_n314(x)
+    end
+end
+
+def fun_l22_n727(x)
+    if (x < 1)
+        fun_l23_n152(x)
+    else
+        fun_l23_n374(x)
+    end
+end
+
+def fun_l22_n728(x)
+    if (x < 1)
+        fun_l23_n464(x)
+    else
+        fun_l23_n439(x)
+    end
+end
+
+def fun_l22_n729(x)
+    if (x < 1)
+        fun_l23_n631(x)
+    else
+        fun_l23_n601(x)
+    end
+end
+
+def fun_l22_n730(x)
+    if (x < 1)
+        fun_l23_n689(x)
+    else
+        fun_l23_n929(x)
+    end
+end
+
+def fun_l22_n731(x)
+    if (x < 1)
+        fun_l23_n691(x)
+    else
+        fun_l23_n868(x)
+    end
+end
+
+def fun_l22_n732(x)
+    if (x < 1)
+        fun_l23_n629(x)
+    else
+        fun_l23_n997(x)
+    end
+end
+
+def fun_l22_n733(x)
+    if (x < 1)
+        fun_l23_n815(x)
+    else
+        fun_l23_n696(x)
+    end
+end
+
+def fun_l22_n734(x)
+    if (x < 1)
+        fun_l23_n636(x)
+    else
+        fun_l23_n858(x)
+    end
+end
+
+def fun_l22_n735(x)
+    if (x < 1)
+        fun_l23_n131(x)
+    else
+        fun_l23_n350(x)
+    end
+end
+
+def fun_l22_n736(x)
+    if (x < 1)
+        fun_l23_n509(x)
+    else
+        fun_l23_n197(x)
+    end
+end
+
+def fun_l22_n737(x)
+    if (x < 1)
+        fun_l23_n549(x)
+    else
+        fun_l23_n16(x)
+    end
+end
+
+def fun_l22_n738(x)
+    if (x < 1)
+        fun_l23_n797(x)
+    else
+        fun_l23_n829(x)
+    end
+end
+
+def fun_l22_n739(x)
+    if (x < 1)
+        fun_l23_n78(x)
+    else
+        fun_l23_n299(x)
+    end
+end
+
+def fun_l22_n740(x)
+    if (x < 1)
+        fun_l23_n165(x)
+    else
+        fun_l23_n822(x)
+    end
+end
+
+def fun_l22_n741(x)
+    if (x < 1)
+        fun_l23_n494(x)
+    else
+        fun_l23_n226(x)
+    end
+end
+
+def fun_l22_n742(x)
+    if (x < 1)
+        fun_l23_n930(x)
+    else
+        fun_l23_n301(x)
+    end
+end
+
+def fun_l22_n743(x)
+    if (x < 1)
+        fun_l23_n357(x)
+    else
+        fun_l23_n399(x)
+    end
+end
+
+def fun_l22_n744(x)
+    if (x < 1)
+        fun_l23_n865(x)
+    else
+        fun_l23_n499(x)
+    end
+end
+
+def fun_l22_n745(x)
+    if (x < 1)
+        fun_l23_n437(x)
+    else
+        fun_l23_n145(x)
+    end
+end
+
+def fun_l22_n746(x)
+    if (x < 1)
+        fun_l23_n883(x)
+    else
+        fun_l23_n269(x)
+    end
+end
+
+def fun_l22_n747(x)
+    if (x < 1)
+        fun_l23_n323(x)
+    else
+        fun_l23_n199(x)
+    end
+end
+
+def fun_l22_n748(x)
+    if (x < 1)
+        fun_l23_n843(x)
+    else
+        fun_l23_n179(x)
+    end
+end
+
+def fun_l22_n749(x)
+    if (x < 1)
+        fun_l23_n413(x)
+    else
+        fun_l23_n195(x)
+    end
+end
+
+def fun_l22_n750(x)
+    if (x < 1)
+        fun_l23_n50(x)
+    else
+        fun_l23_n219(x)
+    end
+end
+
+def fun_l22_n751(x)
+    if (x < 1)
+        fun_l23_n574(x)
+    else
+        fun_l23_n649(x)
+    end
+end
+
+def fun_l22_n752(x)
+    if (x < 1)
+        fun_l23_n495(x)
+    else
+        fun_l23_n664(x)
+    end
+end
+
+def fun_l22_n753(x)
+    if (x < 1)
+        fun_l23_n899(x)
+    else
+        fun_l23_n14(x)
+    end
+end
+
+def fun_l22_n754(x)
+    if (x < 1)
+        fun_l23_n230(x)
+    else
+        fun_l23_n933(x)
+    end
+end
+
+def fun_l22_n755(x)
+    if (x < 1)
+        fun_l23_n236(x)
+    else
+        fun_l23_n854(x)
+    end
+end
+
+def fun_l22_n756(x)
+    if (x < 1)
+        fun_l23_n786(x)
+    else
+        fun_l23_n599(x)
+    end
+end
+
+def fun_l22_n757(x)
+    if (x < 1)
+        fun_l23_n921(x)
+    else
+        fun_l23_n805(x)
+    end
+end
+
+def fun_l22_n758(x)
+    if (x < 1)
+        fun_l23_n990(x)
+    else
+        fun_l23_n724(x)
+    end
+end
+
+def fun_l22_n759(x)
+    if (x < 1)
+        fun_l23_n376(x)
+    else
+        fun_l23_n568(x)
+    end
+end
+
+def fun_l22_n760(x)
+    if (x < 1)
+        fun_l23_n676(x)
+    else
+        fun_l23_n995(x)
+    end
+end
+
+def fun_l22_n761(x)
+    if (x < 1)
+        fun_l23_n144(x)
+    else
+        fun_l23_n104(x)
+    end
+end
+
+def fun_l22_n762(x)
+    if (x < 1)
+        fun_l23_n463(x)
+    else
+        fun_l23_n736(x)
+    end
+end
+
+def fun_l22_n763(x)
+    if (x < 1)
+        fun_l23_n436(x)
+    else
+        fun_l23_n475(x)
+    end
+end
+
+def fun_l22_n764(x)
+    if (x < 1)
+        fun_l23_n607(x)
+    else
+        fun_l23_n737(x)
+    end
+end
+
+def fun_l22_n765(x)
+    if (x < 1)
+        fun_l23_n108(x)
+    else
+        fun_l23_n396(x)
+    end
+end
+
+def fun_l22_n766(x)
+    if (x < 1)
+        fun_l23_n35(x)
+    else
+        fun_l23_n422(x)
+    end
+end
+
+def fun_l22_n767(x)
+    if (x < 1)
+        fun_l23_n541(x)
+    else
+        fun_l23_n756(x)
+    end
+end
+
+def fun_l22_n768(x)
+    if (x < 1)
+        fun_l23_n558(x)
+    else
+        fun_l23_n858(x)
+    end
+end
+
+def fun_l22_n769(x)
+    if (x < 1)
+        fun_l23_n153(x)
+    else
+        fun_l23_n544(x)
+    end
+end
+
+def fun_l22_n770(x)
+    if (x < 1)
+        fun_l23_n201(x)
+    else
+        fun_l23_n905(x)
+    end
+end
+
+def fun_l22_n771(x)
+    if (x < 1)
+        fun_l23_n373(x)
+    else
+        fun_l23_n420(x)
+    end
+end
+
+def fun_l22_n772(x)
+    if (x < 1)
+        fun_l23_n635(x)
+    else
+        fun_l23_n464(x)
+    end
+end
+
+def fun_l22_n773(x)
+    if (x < 1)
+        fun_l23_n822(x)
+    else
+        fun_l23_n803(x)
+    end
+end
+
+def fun_l22_n774(x)
+    if (x < 1)
+        fun_l23_n118(x)
+    else
+        fun_l23_n127(x)
+    end
+end
+
+def fun_l22_n775(x)
+    if (x < 1)
+        fun_l23_n364(x)
+    else
+        fun_l23_n512(x)
+    end
+end
+
+def fun_l22_n776(x)
+    if (x < 1)
+        fun_l23_n186(x)
+    else
+        fun_l23_n275(x)
+    end
+end
+
+def fun_l22_n777(x)
+    if (x < 1)
+        fun_l23_n803(x)
+    else
+        fun_l23_n105(x)
+    end
+end
+
+def fun_l22_n778(x)
+    if (x < 1)
+        fun_l23_n535(x)
+    else
+        fun_l23_n569(x)
+    end
+end
+
+def fun_l22_n779(x)
+    if (x < 1)
+        fun_l23_n847(x)
+    else
+        fun_l23_n505(x)
+    end
+end
+
+def fun_l22_n780(x)
+    if (x < 1)
+        fun_l23_n323(x)
+    else
+        fun_l23_n552(x)
+    end
+end
+
+def fun_l22_n781(x)
+    if (x < 1)
+        fun_l23_n294(x)
+    else
+        fun_l23_n914(x)
+    end
+end
+
+def fun_l22_n782(x)
+    if (x < 1)
+        fun_l23_n887(x)
+    else
+        fun_l23_n214(x)
+    end
+end
+
+def fun_l22_n783(x)
+    if (x < 1)
+        fun_l23_n900(x)
+    else
+        fun_l23_n729(x)
+    end
+end
+
+def fun_l22_n784(x)
+    if (x < 1)
+        fun_l23_n458(x)
+    else
+        fun_l23_n233(x)
+    end
+end
+
+def fun_l22_n785(x)
+    if (x < 1)
+        fun_l23_n553(x)
+    else
+        fun_l23_n306(x)
+    end
+end
+
+def fun_l22_n786(x)
+    if (x < 1)
+        fun_l23_n853(x)
+    else
+        fun_l23_n946(x)
+    end
+end
+
+def fun_l22_n787(x)
+    if (x < 1)
+        fun_l23_n595(x)
+    else
+        fun_l23_n288(x)
+    end
+end
+
+def fun_l22_n788(x)
+    if (x < 1)
+        fun_l23_n785(x)
+    else
+        fun_l23_n752(x)
+    end
+end
+
+def fun_l22_n789(x)
+    if (x < 1)
+        fun_l23_n787(x)
+    else
+        fun_l23_n788(x)
+    end
+end
+
+def fun_l22_n790(x)
+    if (x < 1)
+        fun_l23_n461(x)
+    else
+        fun_l23_n251(x)
+    end
+end
+
+def fun_l22_n791(x)
+    if (x < 1)
+        fun_l23_n523(x)
+    else
+        fun_l23_n328(x)
+    end
+end
+
+def fun_l22_n792(x)
+    if (x < 1)
+        fun_l23_n200(x)
+    else
+        fun_l23_n689(x)
+    end
+end
+
+def fun_l22_n793(x)
+    if (x < 1)
+        fun_l23_n612(x)
+    else
+        fun_l23_n398(x)
+    end
+end
+
+def fun_l22_n794(x)
+    if (x < 1)
+        fun_l23_n937(x)
+    else
+        fun_l23_n965(x)
+    end
+end
+
+def fun_l22_n795(x)
+    if (x < 1)
+        fun_l23_n362(x)
+    else
+        fun_l23_n789(x)
+    end
+end
+
+def fun_l22_n796(x)
+    if (x < 1)
+        fun_l23_n145(x)
+    else
+        fun_l23_n36(x)
+    end
+end
+
+def fun_l22_n797(x)
+    if (x < 1)
+        fun_l23_n923(x)
+    else
+        fun_l23_n251(x)
+    end
+end
+
+def fun_l22_n798(x)
+    if (x < 1)
+        fun_l23_n15(x)
+    else
+        fun_l23_n563(x)
+    end
+end
+
+def fun_l22_n799(x)
+    if (x < 1)
+        fun_l23_n554(x)
+    else
+        fun_l23_n336(x)
+    end
+end
+
+def fun_l22_n800(x)
+    if (x < 1)
+        fun_l23_n939(x)
+    else
+        fun_l23_n993(x)
+    end
+end
+
+def fun_l22_n801(x)
+    if (x < 1)
+        fun_l23_n506(x)
+    else
+        fun_l23_n656(x)
+    end
+end
+
+def fun_l22_n802(x)
+    if (x < 1)
+        fun_l23_n591(x)
+    else
+        fun_l23_n582(x)
+    end
+end
+
+def fun_l22_n803(x)
+    if (x < 1)
+        fun_l23_n707(x)
+    else
+        fun_l23_n235(x)
+    end
+end
+
+def fun_l22_n804(x)
+    if (x < 1)
+        fun_l23_n474(x)
+    else
+        fun_l23_n253(x)
+    end
+end
+
+def fun_l22_n805(x)
+    if (x < 1)
+        fun_l23_n707(x)
+    else
+        fun_l23_n885(x)
+    end
+end
+
+def fun_l22_n806(x)
+    if (x < 1)
+        fun_l23_n155(x)
+    else
+        fun_l23_n210(x)
+    end
+end
+
+def fun_l22_n807(x)
+    if (x < 1)
+        fun_l23_n489(x)
+    else
+        fun_l23_n249(x)
+    end
+end
+
+def fun_l22_n808(x)
+    if (x < 1)
+        fun_l23_n840(x)
+    else
+        fun_l23_n748(x)
+    end
+end
+
+def fun_l22_n809(x)
+    if (x < 1)
+        fun_l23_n910(x)
+    else
+        fun_l23_n884(x)
+    end
+end
+
+def fun_l22_n810(x)
+    if (x < 1)
+        fun_l23_n653(x)
+    else
+        fun_l23_n321(x)
+    end
+end
+
+def fun_l22_n811(x)
+    if (x < 1)
+        fun_l23_n310(x)
+    else
+        fun_l23_n366(x)
+    end
+end
+
+def fun_l22_n812(x)
+    if (x < 1)
+        fun_l23_n441(x)
+    else
+        fun_l23_n795(x)
+    end
+end
+
+def fun_l22_n813(x)
+    if (x < 1)
+        fun_l23_n666(x)
+    else
+        fun_l23_n631(x)
+    end
+end
+
+def fun_l22_n814(x)
+    if (x < 1)
+        fun_l23_n680(x)
+    else
+        fun_l23_n88(x)
+    end
+end
+
+def fun_l22_n815(x)
+    if (x < 1)
+        fun_l23_n80(x)
+    else
+        fun_l23_n989(x)
+    end
+end
+
+def fun_l22_n816(x)
+    if (x < 1)
+        fun_l23_n65(x)
+    else
+        fun_l23_n46(x)
+    end
+end
+
+def fun_l22_n817(x)
+    if (x < 1)
+        fun_l23_n427(x)
+    else
+        fun_l23_n868(x)
+    end
+end
+
+def fun_l22_n818(x)
+    if (x < 1)
+        fun_l23_n900(x)
+    else
+        fun_l23_n213(x)
+    end
+end
+
+def fun_l22_n819(x)
+    if (x < 1)
+        fun_l23_n394(x)
+    else
+        fun_l23_n647(x)
+    end
+end
+
+def fun_l22_n820(x)
+    if (x < 1)
+        fun_l23_n981(x)
+    else
+        fun_l23_n530(x)
+    end
+end
+
+def fun_l22_n821(x)
+    if (x < 1)
+        fun_l23_n806(x)
+    else
+        fun_l23_n511(x)
+    end
+end
+
+def fun_l22_n822(x)
+    if (x < 1)
+        fun_l23_n141(x)
+    else
+        fun_l23_n91(x)
+    end
+end
+
+def fun_l22_n823(x)
+    if (x < 1)
+        fun_l23_n604(x)
+    else
+        fun_l23_n270(x)
+    end
+end
+
+def fun_l22_n824(x)
+    if (x < 1)
+        fun_l23_n347(x)
+    else
+        fun_l23_n937(x)
+    end
+end
+
+def fun_l22_n825(x)
+    if (x < 1)
+        fun_l23_n302(x)
+    else
+        fun_l23_n659(x)
+    end
+end
+
+def fun_l22_n826(x)
+    if (x < 1)
+        fun_l23_n386(x)
+    else
+        fun_l23_n174(x)
+    end
+end
+
+def fun_l22_n827(x)
+    if (x < 1)
+        fun_l23_n347(x)
+    else
+        fun_l23_n659(x)
+    end
+end
+
+def fun_l22_n828(x)
+    if (x < 1)
+        fun_l23_n647(x)
+    else
+        fun_l23_n648(x)
+    end
+end
+
+def fun_l22_n829(x)
+    if (x < 1)
+        fun_l23_n892(x)
+    else
+        fun_l23_n910(x)
+    end
+end
+
+def fun_l22_n830(x)
+    if (x < 1)
+        fun_l23_n274(x)
+    else
+        fun_l23_n739(x)
+    end
+end
+
+def fun_l22_n831(x)
+    if (x < 1)
+        fun_l23_n211(x)
+    else
+        fun_l23_n658(x)
+    end
+end
+
+def fun_l22_n832(x)
+    if (x < 1)
+        fun_l23_n584(x)
+    else
+        fun_l23_n163(x)
+    end
+end
+
+def fun_l22_n833(x)
+    if (x < 1)
+        fun_l23_n598(x)
+    else
+        fun_l23_n735(x)
+    end
+end
+
+def fun_l22_n834(x)
+    if (x < 1)
+        fun_l23_n934(x)
+    else
+        fun_l23_n579(x)
+    end
+end
+
+def fun_l22_n835(x)
+    if (x < 1)
+        fun_l23_n483(x)
+    else
+        fun_l23_n632(x)
+    end
+end
+
+def fun_l22_n836(x)
+    if (x < 1)
+        fun_l23_n329(x)
+    else
+        fun_l23_n799(x)
+    end
+end
+
+def fun_l22_n837(x)
+    if (x < 1)
+        fun_l23_n699(x)
+    else
+        fun_l23_n846(x)
+    end
+end
+
+def fun_l22_n838(x)
+    if (x < 1)
+        fun_l23_n40(x)
+    else
+        fun_l23_n715(x)
+    end
+end
+
+def fun_l22_n839(x)
+    if (x < 1)
+        fun_l23_n917(x)
+    else
+        fun_l23_n595(x)
+    end
+end
+
+def fun_l22_n840(x)
+    if (x < 1)
+        fun_l23_n171(x)
+    else
+        fun_l23_n204(x)
+    end
+end
+
+def fun_l22_n841(x)
+    if (x < 1)
+        fun_l23_n652(x)
+    else
+        fun_l23_n342(x)
+    end
+end
+
+def fun_l22_n842(x)
+    if (x < 1)
+        fun_l23_n853(x)
+    else
+        fun_l23_n981(x)
+    end
+end
+
+def fun_l22_n843(x)
+    if (x < 1)
+        fun_l23_n673(x)
+    else
+        fun_l23_n2(x)
+    end
+end
+
+def fun_l22_n844(x)
+    if (x < 1)
+        fun_l23_n799(x)
+    else
+        fun_l23_n654(x)
+    end
+end
+
+def fun_l22_n845(x)
+    if (x < 1)
+        fun_l23_n989(x)
+    else
+        fun_l23_n563(x)
+    end
+end
+
+def fun_l22_n846(x)
+    if (x < 1)
+        fun_l23_n415(x)
+    else
+        fun_l23_n245(x)
+    end
+end
+
+def fun_l22_n847(x)
+    if (x < 1)
+        fun_l23_n836(x)
+    else
+        fun_l23_n347(x)
+    end
+end
+
+def fun_l22_n848(x)
+    if (x < 1)
+        fun_l23_n493(x)
+    else
+        fun_l23_n712(x)
+    end
+end
+
+def fun_l22_n849(x)
+    if (x < 1)
+        fun_l23_n780(x)
+    else
+        fun_l23_n43(x)
+    end
+end
+
+def fun_l22_n850(x)
+    if (x < 1)
+        fun_l23_n511(x)
+    else
+        fun_l23_n356(x)
+    end
+end
+
+def fun_l22_n851(x)
+    if (x < 1)
+        fun_l23_n229(x)
+    else
+        fun_l23_n355(x)
+    end
+end
+
+def fun_l22_n852(x)
+    if (x < 1)
+        fun_l23_n50(x)
+    else
+        fun_l23_n908(x)
+    end
+end
+
+def fun_l22_n853(x)
+    if (x < 1)
+        fun_l23_n156(x)
+    else
+        fun_l23_n422(x)
+    end
+end
+
+def fun_l22_n854(x)
+    if (x < 1)
+        fun_l23_n448(x)
+    else
+        fun_l23_n763(x)
+    end
+end
+
+def fun_l22_n855(x)
+    if (x < 1)
+        fun_l23_n662(x)
+    else
+        fun_l23_n887(x)
+    end
+end
+
+def fun_l22_n856(x)
+    if (x < 1)
+        fun_l23_n511(x)
+    else
+        fun_l23_n292(x)
+    end
+end
+
+def fun_l22_n857(x)
+    if (x < 1)
+        fun_l23_n313(x)
+    else
+        fun_l23_n207(x)
+    end
+end
+
+def fun_l22_n858(x)
+    if (x < 1)
+        fun_l23_n544(x)
+    else
+        fun_l23_n488(x)
+    end
+end
+
+def fun_l22_n859(x)
+    if (x < 1)
+        fun_l23_n34(x)
+    else
+        fun_l23_n133(x)
+    end
+end
+
+def fun_l22_n860(x)
+    if (x < 1)
+        fun_l23_n739(x)
+    else
+        fun_l23_n127(x)
+    end
+end
+
+def fun_l22_n861(x)
+    if (x < 1)
+        fun_l23_n727(x)
+    else
+        fun_l23_n339(x)
+    end
+end
+
+def fun_l22_n862(x)
+    if (x < 1)
+        fun_l23_n78(x)
+    else
+        fun_l23_n101(x)
+    end
+end
+
+def fun_l22_n863(x)
+    if (x < 1)
+        fun_l23_n310(x)
+    else
+        fun_l23_n884(x)
+    end
+end
+
+def fun_l22_n864(x)
+    if (x < 1)
+        fun_l23_n97(x)
+    else
+        fun_l23_n716(x)
+    end
+end
+
+def fun_l22_n865(x)
+    if (x < 1)
+        fun_l23_n63(x)
+    else
+        fun_l23_n654(x)
+    end
+end
+
+def fun_l22_n866(x)
+    if (x < 1)
+        fun_l23_n336(x)
+    else
+        fun_l23_n334(x)
+    end
+end
+
+def fun_l22_n867(x)
+    if (x < 1)
+        fun_l23_n317(x)
+    else
+        fun_l23_n197(x)
+    end
+end
+
+def fun_l22_n868(x)
+    if (x < 1)
+        fun_l23_n98(x)
+    else
+        fun_l23_n466(x)
+    end
+end
+
+def fun_l22_n869(x)
+    if (x < 1)
+        fun_l23_n157(x)
+    else
+        fun_l23_n43(x)
+    end
+end
+
+def fun_l22_n870(x)
+    if (x < 1)
+        fun_l23_n347(x)
+    else
+        fun_l23_n961(x)
+    end
+end
+
+def fun_l22_n871(x)
+    if (x < 1)
+        fun_l23_n460(x)
+    else
+        fun_l23_n820(x)
+    end
+end
+
+def fun_l22_n872(x)
+    if (x < 1)
+        fun_l23_n216(x)
+    else
+        fun_l23_n419(x)
+    end
+end
+
+def fun_l22_n873(x)
+    if (x < 1)
+        fun_l23_n879(x)
+    else
+        fun_l23_n343(x)
+    end
+end
+
+def fun_l22_n874(x)
+    if (x < 1)
+        fun_l23_n507(x)
+    else
+        fun_l23_n572(x)
+    end
+end
+
+def fun_l22_n875(x)
+    if (x < 1)
+        fun_l23_n959(x)
+    else
+        fun_l23_n750(x)
+    end
+end
+
+def fun_l22_n876(x)
+    if (x < 1)
+        fun_l23_n718(x)
+    else
+        fun_l23_n406(x)
+    end
+end
+
+def fun_l22_n877(x)
+    if (x < 1)
+        fun_l23_n733(x)
+    else
+        fun_l23_n486(x)
+    end
+end
+
+def fun_l22_n878(x)
+    if (x < 1)
+        fun_l23_n95(x)
+    else
+        fun_l23_n842(x)
+    end
+end
+
+def fun_l22_n879(x)
+    if (x < 1)
+        fun_l23_n626(x)
+    else
+        fun_l23_n428(x)
+    end
+end
+
+def fun_l22_n880(x)
+    if (x < 1)
+        fun_l23_n194(x)
+    else
+        fun_l23_n441(x)
+    end
+end
+
+def fun_l22_n881(x)
+    if (x < 1)
+        fun_l23_n10(x)
+    else
+        fun_l23_n727(x)
+    end
+end
+
+def fun_l22_n882(x)
+    if (x < 1)
+        fun_l23_n173(x)
+    else
+        fun_l23_n301(x)
+    end
+end
+
+def fun_l22_n883(x)
+    if (x < 1)
+        fun_l23_n338(x)
+    else
+        fun_l23_n420(x)
+    end
+end
+
+def fun_l22_n884(x)
+    if (x < 1)
+        fun_l23_n615(x)
+    else
+        fun_l23_n923(x)
+    end
+end
+
+def fun_l22_n885(x)
+    if (x < 1)
+        fun_l23_n547(x)
+    else
+        fun_l23_n979(x)
+    end
+end
+
+def fun_l22_n886(x)
+    if (x < 1)
+        fun_l23_n28(x)
+    else
+        fun_l23_n213(x)
+    end
+end
+
+def fun_l22_n887(x)
+    if (x < 1)
+        fun_l23_n919(x)
+    else
+        fun_l23_n228(x)
+    end
+end
+
+def fun_l22_n888(x)
+    if (x < 1)
+        fun_l23_n264(x)
+    else
+        fun_l23_n156(x)
+    end
+end
+
+def fun_l22_n889(x)
+    if (x < 1)
+        fun_l23_n137(x)
+    else
+        fun_l23_n582(x)
+    end
+end
+
+def fun_l22_n890(x)
+    if (x < 1)
+        fun_l23_n468(x)
+    else
+        fun_l23_n409(x)
+    end
+end
+
+def fun_l22_n891(x)
+    if (x < 1)
+        fun_l23_n823(x)
+    else
+        fun_l23_n999(x)
+    end
+end
+
+def fun_l22_n892(x)
+    if (x < 1)
+        fun_l23_n248(x)
+    else
+        fun_l23_n821(x)
+    end
+end
+
+def fun_l22_n893(x)
+    if (x < 1)
+        fun_l23_n117(x)
+    else
+        fun_l23_n127(x)
+    end
+end
+
+def fun_l22_n894(x)
+    if (x < 1)
+        fun_l23_n622(x)
+    else
+        fun_l23_n737(x)
+    end
+end
+
+def fun_l22_n895(x)
+    if (x < 1)
+        fun_l23_n66(x)
+    else
+        fun_l23_n261(x)
+    end
+end
+
+def fun_l22_n896(x)
+    if (x < 1)
+        fun_l23_n245(x)
+    else
+        fun_l23_n18(x)
+    end
+end
+
+def fun_l22_n897(x)
+    if (x < 1)
+        fun_l23_n269(x)
+    else
+        fun_l23_n666(x)
+    end
+end
+
+def fun_l22_n898(x)
+    if (x < 1)
+        fun_l23_n807(x)
+    else
+        fun_l23_n449(x)
+    end
+end
+
+def fun_l22_n899(x)
+    if (x < 1)
+        fun_l23_n801(x)
+    else
+        fun_l23_n34(x)
+    end
+end
+
+def fun_l22_n900(x)
+    if (x < 1)
+        fun_l23_n17(x)
+    else
+        fun_l23_n117(x)
+    end
+end
+
+def fun_l22_n901(x)
+    if (x < 1)
+        fun_l23_n677(x)
+    else
+        fun_l23_n872(x)
+    end
+end
+
+def fun_l22_n902(x)
+    if (x < 1)
+        fun_l23_n221(x)
+    else
+        fun_l23_n685(x)
+    end
+end
+
+def fun_l22_n903(x)
+    if (x < 1)
+        fun_l23_n224(x)
+    else
+        fun_l23_n15(x)
+    end
+end
+
+def fun_l22_n904(x)
+    if (x < 1)
+        fun_l23_n353(x)
+    else
+        fun_l23_n367(x)
+    end
+end
+
+def fun_l22_n905(x)
+    if (x < 1)
+        fun_l23_n466(x)
+    else
+        fun_l23_n466(x)
+    end
+end
+
+def fun_l22_n906(x)
+    if (x < 1)
+        fun_l23_n674(x)
+    else
+        fun_l23_n521(x)
+    end
+end
+
+def fun_l22_n907(x)
+    if (x < 1)
+        fun_l23_n978(x)
+    else
+        fun_l23_n79(x)
+    end
+end
+
+def fun_l22_n908(x)
+    if (x < 1)
+        fun_l23_n976(x)
+    else
+        fun_l23_n513(x)
+    end
+end
+
+def fun_l22_n909(x)
+    if (x < 1)
+        fun_l23_n478(x)
+    else
+        fun_l23_n524(x)
+    end
+end
+
+def fun_l22_n910(x)
+    if (x < 1)
+        fun_l23_n744(x)
+    else
+        fun_l23_n451(x)
+    end
+end
+
+def fun_l22_n911(x)
+    if (x < 1)
+        fun_l23_n524(x)
+    else
+        fun_l23_n409(x)
+    end
+end
+
+def fun_l22_n912(x)
+    if (x < 1)
+        fun_l23_n651(x)
+    else
+        fun_l23_n424(x)
+    end
+end
+
+def fun_l22_n913(x)
+    if (x < 1)
+        fun_l23_n740(x)
+    else
+        fun_l23_n841(x)
+    end
+end
+
+def fun_l22_n914(x)
+    if (x < 1)
+        fun_l23_n388(x)
+    else
+        fun_l23_n790(x)
+    end
+end
+
+def fun_l22_n915(x)
+    if (x < 1)
+        fun_l23_n625(x)
+    else
+        fun_l23_n276(x)
+    end
+end
+
+def fun_l22_n916(x)
+    if (x < 1)
+        fun_l23_n322(x)
+    else
+        fun_l23_n598(x)
+    end
+end
+
+def fun_l22_n917(x)
+    if (x < 1)
+        fun_l23_n51(x)
+    else
+        fun_l23_n286(x)
+    end
+end
+
+def fun_l22_n918(x)
+    if (x < 1)
+        fun_l23_n265(x)
+    else
+        fun_l23_n553(x)
+    end
+end
+
+def fun_l22_n919(x)
+    if (x < 1)
+        fun_l23_n525(x)
+    else
+        fun_l23_n825(x)
+    end
+end
+
+def fun_l22_n920(x)
+    if (x < 1)
+        fun_l23_n59(x)
+    else
+        fun_l23_n643(x)
+    end
+end
+
+def fun_l22_n921(x)
+    if (x < 1)
+        fun_l23_n135(x)
+    else
+        fun_l23_n811(x)
+    end
+end
+
+def fun_l22_n922(x)
+    if (x < 1)
+        fun_l23_n587(x)
+    else
+        fun_l23_n564(x)
+    end
+end
+
+def fun_l22_n923(x)
+    if (x < 1)
+        fun_l23_n235(x)
+    else
+        fun_l23_n337(x)
+    end
+end
+
+def fun_l22_n924(x)
+    if (x < 1)
+        fun_l23_n99(x)
+    else
+        fun_l23_n805(x)
+    end
+end
+
+def fun_l22_n925(x)
+    if (x < 1)
+        fun_l23_n360(x)
+    else
+        fun_l23_n67(x)
+    end
+end
+
+def fun_l22_n926(x)
+    if (x < 1)
+        fun_l23_n438(x)
+    else
+        fun_l23_n948(x)
+    end
+end
+
+def fun_l22_n927(x)
+    if (x < 1)
+        fun_l23_n545(x)
+    else
+        fun_l23_n287(x)
+    end
+end
+
+def fun_l22_n928(x)
+    if (x < 1)
+        fun_l23_n632(x)
+    else
+        fun_l23_n769(x)
+    end
+end
+
+def fun_l22_n929(x)
+    if (x < 1)
+        fun_l23_n17(x)
+    else
+        fun_l23_n240(x)
+    end
+end
+
+def fun_l22_n930(x)
+    if (x < 1)
+        fun_l23_n948(x)
+    else
+        fun_l23_n690(x)
+    end
+end
+
+def fun_l22_n931(x)
+    if (x < 1)
+        fun_l23_n12(x)
+    else
+        fun_l23_n640(x)
+    end
+end
+
+def fun_l22_n932(x)
+    if (x < 1)
+        fun_l23_n157(x)
+    else
+        fun_l23_n594(x)
+    end
+end
+
+def fun_l22_n933(x)
+    if (x < 1)
+        fun_l23_n96(x)
+    else
+        fun_l23_n771(x)
+    end
+end
+
+def fun_l22_n934(x)
+    if (x < 1)
+        fun_l23_n237(x)
+    else
+        fun_l23_n910(x)
+    end
+end
+
+def fun_l22_n935(x)
+    if (x < 1)
+        fun_l23_n553(x)
+    else
+        fun_l23_n300(x)
+    end
+end
+
+def fun_l22_n936(x)
+    if (x < 1)
+        fun_l23_n224(x)
+    else
+        fun_l23_n566(x)
+    end
+end
+
+def fun_l22_n937(x)
+    if (x < 1)
+        fun_l23_n314(x)
+    else
+        fun_l23_n328(x)
+    end
+end
+
+def fun_l22_n938(x)
+    if (x < 1)
+        fun_l23_n775(x)
+    else
+        fun_l23_n72(x)
+    end
+end
+
+def fun_l22_n939(x)
+    if (x < 1)
+        fun_l23_n273(x)
+    else
+        fun_l23_n43(x)
+    end
+end
+
+def fun_l22_n940(x)
+    if (x < 1)
+        fun_l23_n215(x)
+    else
+        fun_l23_n646(x)
+    end
+end
+
+def fun_l22_n941(x)
+    if (x < 1)
+        fun_l23_n925(x)
+    else
+        fun_l23_n97(x)
+    end
+end
+
+def fun_l22_n942(x)
+    if (x < 1)
+        fun_l23_n391(x)
+    else
+        fun_l23_n972(x)
+    end
+end
+
+def fun_l22_n943(x)
+    if (x < 1)
+        fun_l23_n276(x)
+    else
+        fun_l23_n725(x)
+    end
+end
+
+def fun_l22_n944(x)
+    if (x < 1)
+        fun_l23_n928(x)
+    else
+        fun_l23_n94(x)
+    end
+end
+
+def fun_l22_n945(x)
+    if (x < 1)
+        fun_l23_n176(x)
+    else
+        fun_l23_n598(x)
+    end
+end
+
+def fun_l22_n946(x)
+    if (x < 1)
+        fun_l23_n530(x)
+    else
+        fun_l23_n37(x)
+    end
+end
+
+def fun_l22_n947(x)
+    if (x < 1)
+        fun_l23_n412(x)
+    else
+        fun_l23_n718(x)
+    end
+end
+
+def fun_l22_n948(x)
+    if (x < 1)
+        fun_l23_n905(x)
+    else
+        fun_l23_n723(x)
+    end
+end
+
+def fun_l22_n949(x)
+    if (x < 1)
+        fun_l23_n451(x)
+    else
+        fun_l23_n232(x)
+    end
+end
+
+def fun_l22_n950(x)
+    if (x < 1)
+        fun_l23_n312(x)
+    else
+        fun_l23_n556(x)
+    end
+end
+
+def fun_l22_n951(x)
+    if (x < 1)
+        fun_l23_n906(x)
+    else
+        fun_l23_n33(x)
+    end
+end
+
+def fun_l22_n952(x)
+    if (x < 1)
+        fun_l23_n964(x)
+    else
+        fun_l23_n46(x)
+    end
+end
+
+def fun_l22_n953(x)
+    if (x < 1)
+        fun_l23_n813(x)
+    else
+        fun_l23_n494(x)
+    end
+end
+
+def fun_l22_n954(x)
+    if (x < 1)
+        fun_l23_n725(x)
+    else
+        fun_l23_n705(x)
+    end
+end
+
+def fun_l22_n955(x)
+    if (x < 1)
+        fun_l23_n525(x)
+    else
+        fun_l23_n370(x)
+    end
+end
+
+def fun_l22_n956(x)
+    if (x < 1)
+        fun_l23_n266(x)
+    else
+        fun_l23_n872(x)
+    end
+end
+
+def fun_l22_n957(x)
+    if (x < 1)
+        fun_l23_n492(x)
+    else
+        fun_l23_n730(x)
+    end
+end
+
+def fun_l22_n958(x)
+    if (x < 1)
+        fun_l23_n950(x)
+    else
+        fun_l23_n557(x)
+    end
+end
+
+def fun_l22_n959(x)
+    if (x < 1)
+        fun_l23_n156(x)
+    else
+        fun_l23_n379(x)
+    end
+end
+
+def fun_l22_n960(x)
+    if (x < 1)
+        fun_l23_n270(x)
+    else
+        fun_l23_n486(x)
+    end
+end
+
+def fun_l22_n961(x)
+    if (x < 1)
+        fun_l23_n789(x)
+    else
+        fun_l23_n316(x)
+    end
+end
+
+def fun_l22_n962(x)
+    if (x < 1)
+        fun_l23_n425(x)
+    else
+        fun_l23_n470(x)
+    end
+end
+
+def fun_l22_n963(x)
+    if (x < 1)
+        fun_l23_n598(x)
+    else
+        fun_l23_n304(x)
+    end
+end
+
+def fun_l22_n964(x)
+    if (x < 1)
+        fun_l23_n249(x)
+    else
+        fun_l23_n517(x)
+    end
+end
+
+def fun_l22_n965(x)
+    if (x < 1)
+        fun_l23_n775(x)
+    else
+        fun_l23_n892(x)
+    end
+end
+
+def fun_l22_n966(x)
+    if (x < 1)
+        fun_l23_n771(x)
+    else
+        fun_l23_n879(x)
+    end
+end
+
+def fun_l22_n967(x)
+    if (x < 1)
+        fun_l23_n596(x)
+    else
+        fun_l23_n22(x)
+    end
+end
+
+def fun_l22_n968(x)
+    if (x < 1)
+        fun_l23_n722(x)
+    else
+        fun_l23_n203(x)
+    end
+end
+
+def fun_l22_n969(x)
+    if (x < 1)
+        fun_l23_n912(x)
+    else
+        fun_l23_n216(x)
+    end
+end
+
+def fun_l22_n970(x)
+    if (x < 1)
+        fun_l23_n230(x)
+    else
+        fun_l23_n295(x)
+    end
+end
+
+def fun_l22_n971(x)
+    if (x < 1)
+        fun_l23_n255(x)
+    else
+        fun_l23_n407(x)
+    end
+end
+
+def fun_l22_n972(x)
+    if (x < 1)
+        fun_l23_n673(x)
+    else
+        fun_l23_n940(x)
+    end
+end
+
+def fun_l22_n973(x)
+    if (x < 1)
+        fun_l23_n793(x)
+    else
+        fun_l23_n776(x)
+    end
+end
+
+def fun_l22_n974(x)
+    if (x < 1)
+        fun_l23_n812(x)
+    else
+        fun_l23_n653(x)
+    end
+end
+
+def fun_l22_n975(x)
+    if (x < 1)
+        fun_l23_n866(x)
+    else
+        fun_l23_n25(x)
+    end
+end
+
+def fun_l22_n976(x)
+    if (x < 1)
+        fun_l23_n143(x)
+    else
+        fun_l23_n236(x)
+    end
+end
+
+def fun_l22_n977(x)
+    if (x < 1)
+        fun_l23_n274(x)
+    else
+        fun_l23_n414(x)
+    end
+end
+
+def fun_l22_n978(x)
+    if (x < 1)
+        fun_l23_n281(x)
+    else
+        fun_l23_n946(x)
+    end
+end
+
+def fun_l22_n979(x)
+    if (x < 1)
+        fun_l23_n255(x)
+    else
+        fun_l23_n585(x)
+    end
+end
+
+def fun_l22_n980(x)
+    if (x < 1)
+        fun_l23_n269(x)
+    else
+        fun_l23_n182(x)
+    end
+end
+
+def fun_l22_n981(x)
+    if (x < 1)
+        fun_l23_n340(x)
+    else
+        fun_l23_n262(x)
+    end
+end
+
+def fun_l22_n982(x)
+    if (x < 1)
+        fun_l23_n713(x)
+    else
+        fun_l23_n247(x)
+    end
+end
+
+def fun_l22_n983(x)
+    if (x < 1)
+        fun_l23_n827(x)
+    else
+        fun_l23_n821(x)
+    end
+end
+
+def fun_l22_n984(x)
+    if (x < 1)
+        fun_l23_n628(x)
+    else
+        fun_l23_n243(x)
+    end
+end
+
+def fun_l22_n985(x)
+    if (x < 1)
+        fun_l23_n479(x)
+    else
+        fun_l23_n440(x)
+    end
+end
+
+def fun_l22_n986(x)
+    if (x < 1)
+        fun_l23_n451(x)
+    else
+        fun_l23_n299(x)
+    end
+end
+
+def fun_l22_n987(x)
+    if (x < 1)
+        fun_l23_n528(x)
+    else
+        fun_l23_n336(x)
+    end
+end
+
+def fun_l22_n988(x)
+    if (x < 1)
+        fun_l23_n825(x)
+    else
+        fun_l23_n767(x)
+    end
+end
+
+def fun_l22_n989(x)
+    if (x < 1)
+        fun_l23_n427(x)
+    else
+        fun_l23_n996(x)
+    end
+end
+
+def fun_l22_n990(x)
+    if (x < 1)
+        fun_l23_n175(x)
+    else
+        fun_l23_n888(x)
+    end
+end
+
+def fun_l22_n991(x)
+    if (x < 1)
+        fun_l23_n351(x)
+    else
+        fun_l23_n982(x)
+    end
+end
+
+def fun_l22_n992(x)
+    if (x < 1)
+        fun_l23_n235(x)
+    else
+        fun_l23_n91(x)
+    end
+end
+
+def fun_l22_n993(x)
+    if (x < 1)
+        fun_l23_n966(x)
+    else
+        fun_l23_n520(x)
+    end
+end
+
+def fun_l22_n994(x)
+    if (x < 1)
+        fun_l23_n854(x)
+    else
+        fun_l23_n937(x)
+    end
+end
+
+def fun_l22_n995(x)
+    if (x < 1)
+        fun_l23_n922(x)
+    else
+        fun_l23_n176(x)
+    end
+end
+
+def fun_l22_n996(x)
+    if (x < 1)
+        fun_l23_n925(x)
+    else
+        fun_l23_n271(x)
+    end
+end
+
+def fun_l22_n997(x)
+    if (x < 1)
+        fun_l23_n513(x)
+    else
+        fun_l23_n195(x)
+    end
+end
+
+def fun_l22_n998(x)
+    if (x < 1)
+        fun_l23_n135(x)
+    else
+        fun_l23_n834(x)
+    end
+end
+
+def fun_l22_n999(x)
+    if (x < 1)
+        fun_l23_n664(x)
+    else
+        fun_l23_n861(x)
+    end
+end
+
+def fun_l23_n0(x)
+    if (x < 1)
+        fun_l24_n327(x)
+    else
+        fun_l24_n159(x)
+    end
+end
+
+def fun_l23_n1(x)
+    if (x < 1)
+        fun_l24_n433(x)
+    else
+        fun_l24_n862(x)
+    end
+end
+
+def fun_l23_n2(x)
+    if (x < 1)
+        fun_l24_n56(x)
+    else
+        fun_l24_n651(x)
+    end
+end
+
+def fun_l23_n3(x)
+    if (x < 1)
+        fun_l24_n267(x)
+    else
+        fun_l24_n566(x)
+    end
+end
+
+def fun_l23_n4(x)
+    if (x < 1)
+        fun_l24_n880(x)
+    else
+        fun_l24_n886(x)
+    end
+end
+
+def fun_l23_n5(x)
+    if (x < 1)
+        fun_l24_n66(x)
+    else
+        fun_l24_n894(x)
+    end
+end
+
+def fun_l23_n6(x)
+    if (x < 1)
+        fun_l24_n965(x)
+    else
+        fun_l24_n453(x)
+    end
+end
+
+def fun_l23_n7(x)
+    if (x < 1)
+        fun_l24_n250(x)
+    else
+        fun_l24_n42(x)
+    end
+end
+
+def fun_l23_n8(x)
+    if (x < 1)
+        fun_l24_n376(x)
+    else
+        fun_l24_n736(x)
+    end
+end
+
+def fun_l23_n9(x)
+    if (x < 1)
+        fun_l24_n434(x)
+    else
+        fun_l24_n334(x)
+    end
+end
+
+def fun_l23_n10(x)
+    if (x < 1)
+        fun_l24_n944(x)
+    else
+        fun_l24_n70(x)
+    end
+end
+
+def fun_l23_n11(x)
+    if (x < 1)
+        fun_l24_n38(x)
+    else
+        fun_l24_n532(x)
+    end
+end
+
+def fun_l23_n12(x)
+    if (x < 1)
+        fun_l24_n603(x)
+    else
+        fun_l24_n682(x)
+    end
+end
+
+def fun_l23_n13(x)
+    if (x < 1)
+        fun_l24_n716(x)
+    else
+        fun_l24_n754(x)
+    end
+end
+
+def fun_l23_n14(x)
+    if (x < 1)
+        fun_l24_n578(x)
+    else
+        fun_l24_n727(x)
+    end
+end
+
+def fun_l23_n15(x)
+    if (x < 1)
+        fun_l24_n166(x)
+    else
+        fun_l24_n224(x)
+    end
+end
+
+def fun_l23_n16(x)
+    if (x < 1)
+        fun_l24_n755(x)
+    else
+        fun_l24_n548(x)
+    end
+end
+
+def fun_l23_n17(x)
+    if (x < 1)
+        fun_l24_n355(x)
+    else
+        fun_l24_n625(x)
+    end
+end
+
+def fun_l23_n18(x)
+    if (x < 1)
+        fun_l24_n400(x)
+    else
+        fun_l24_n834(x)
+    end
+end
+
+def fun_l23_n19(x)
+    if (x < 1)
+        fun_l24_n188(x)
+    else
+        fun_l24_n305(x)
+    end
+end
+
+def fun_l23_n20(x)
+    if (x < 1)
+        fun_l24_n392(x)
+    else
+        fun_l24_n466(x)
+    end
+end
+
+def fun_l23_n21(x)
+    if (x < 1)
+        fun_l24_n937(x)
+    else
+        fun_l24_n603(x)
+    end
+end
+
+def fun_l23_n22(x)
+    if (x < 1)
+        fun_l24_n767(x)
+    else
+        fun_l24_n750(x)
+    end
+end
+
+def fun_l23_n23(x)
+    if (x < 1)
+        fun_l24_n888(x)
+    else
+        fun_l24_n472(x)
+    end
+end
+
+def fun_l23_n24(x)
+    if (x < 1)
+        fun_l24_n937(x)
+    else
+        fun_l24_n192(x)
+    end
+end
+
+def fun_l23_n25(x)
+    if (x < 1)
+        fun_l24_n704(x)
+    else
+        fun_l24_n839(x)
+    end
+end
+
+def fun_l23_n26(x)
+    if (x < 1)
+        fun_l24_n758(x)
+    else
+        fun_l24_n579(x)
+    end
+end
+
+def fun_l23_n27(x)
+    if (x < 1)
+        fun_l24_n161(x)
+    else
+        fun_l24_n268(x)
+    end
+end
+
+def fun_l23_n28(x)
+    if (x < 1)
+        fun_l24_n628(x)
+    else
+        fun_l24_n413(x)
+    end
+end
+
+def fun_l23_n29(x)
+    if (x < 1)
+        fun_l24_n954(x)
+    else
+        fun_l24_n962(x)
+    end
+end
+
+def fun_l23_n30(x)
+    if (x < 1)
+        fun_l24_n723(x)
+    else
+        fun_l24_n220(x)
+    end
+end
+
+def fun_l23_n31(x)
+    if (x < 1)
+        fun_l24_n841(x)
+    else
+        fun_l24_n331(x)
+    end
+end
+
+def fun_l23_n32(x)
+    if (x < 1)
+        fun_l24_n42(x)
+    else
+        fun_l24_n331(x)
+    end
+end
+
+def fun_l23_n33(x)
+    if (x < 1)
+        fun_l24_n873(x)
+    else
+        fun_l24_n58(x)
+    end
+end
+
+def fun_l23_n34(x)
+    if (x < 1)
+        fun_l24_n586(x)
+    else
+        fun_l24_n981(x)
+    end
+end
+
+def fun_l23_n35(x)
+    if (x < 1)
+        fun_l24_n455(x)
+    else
+        fun_l24_n279(x)
+    end
+end
+
+def fun_l23_n36(x)
+    if (x < 1)
+        fun_l24_n401(x)
+    else
+        fun_l24_n633(x)
+    end
+end
+
+def fun_l23_n37(x)
+    if (x < 1)
+        fun_l24_n432(x)
+    else
+        fun_l24_n389(x)
+    end
+end
+
+def fun_l23_n38(x)
+    if (x < 1)
+        fun_l24_n46(x)
+    else
+        fun_l24_n426(x)
+    end
+end
+
+def fun_l23_n39(x)
+    if (x < 1)
+        fun_l24_n679(x)
+    else
+        fun_l24_n222(x)
+    end
+end
+
+def fun_l23_n40(x)
+    if (x < 1)
+        fun_l24_n129(x)
+    else
+        fun_l24_n2(x)
+    end
+end
+
+def fun_l23_n41(x)
+    if (x < 1)
+        fun_l24_n228(x)
+    else
+        fun_l24_n386(x)
+    end
+end
+
+def fun_l23_n42(x)
+    if (x < 1)
+        fun_l24_n740(x)
+    else
+        fun_l24_n605(x)
+    end
+end
+
+def fun_l23_n43(x)
+    if (x < 1)
+        fun_l24_n686(x)
+    else
+        fun_l24_n755(x)
+    end
+end
+
+def fun_l23_n44(x)
+    if (x < 1)
+        fun_l24_n569(x)
+    else
+        fun_l24_n553(x)
+    end
+end
+
+def fun_l23_n45(x)
+    if (x < 1)
+        fun_l24_n908(x)
+    else
+        fun_l24_n388(x)
+    end
+end
+
+def fun_l23_n46(x)
+    if (x < 1)
+        fun_l24_n106(x)
+    else
+        fun_l24_n335(x)
+    end
+end
+
+def fun_l23_n47(x)
+    if (x < 1)
+        fun_l24_n876(x)
+    else
+        fun_l24_n813(x)
+    end
+end
+
+def fun_l23_n48(x)
+    if (x < 1)
+        fun_l24_n337(x)
+    else
+        fun_l24_n967(x)
+    end
+end
+
+def fun_l23_n49(x)
+    if (x < 1)
+        fun_l24_n309(x)
+    else
+        fun_l24_n988(x)
+    end
+end
+
+def fun_l23_n50(x)
+    if (x < 1)
+        fun_l24_n325(x)
+    else
+        fun_l24_n703(x)
+    end
+end
+
+def fun_l23_n51(x)
+    if (x < 1)
+        fun_l24_n755(x)
+    else
+        fun_l24_n146(x)
+    end
+end
+
+def fun_l23_n52(x)
+    if (x < 1)
+        fun_l24_n597(x)
+    else
+        fun_l24_n764(x)
+    end
+end
+
+def fun_l23_n53(x)
+    if (x < 1)
+        fun_l24_n259(x)
+    else
+        fun_l24_n9(x)
+    end
+end
+
+def fun_l23_n54(x)
+    if (x < 1)
+        fun_l24_n73(x)
+    else
+        fun_l24_n700(x)
+    end
+end
+
+def fun_l23_n55(x)
+    if (x < 1)
+        fun_l24_n369(x)
+    else
+        fun_l24_n632(x)
+    end
+end
+
+def fun_l23_n56(x)
+    if (x < 1)
+        fun_l24_n475(x)
+    else
+        fun_l24_n553(x)
+    end
+end
+
+def fun_l23_n57(x)
+    if (x < 1)
+        fun_l24_n473(x)
+    else
+        fun_l24_n84(x)
+    end
+end
+
+def fun_l23_n58(x)
+    if (x < 1)
+        fun_l24_n837(x)
+    else
+        fun_l24_n164(x)
+    end
+end
+
+def fun_l23_n59(x)
+    if (x < 1)
+        fun_l24_n129(x)
+    else
+        fun_l24_n993(x)
+    end
+end
+
+def fun_l23_n60(x)
+    if (x < 1)
+        fun_l24_n201(x)
+    else
+        fun_l24_n644(x)
+    end
+end
+
+def fun_l23_n61(x)
+    if (x < 1)
+        fun_l24_n825(x)
+    else
+        fun_l24_n513(x)
+    end
+end
+
+def fun_l23_n62(x)
+    if (x < 1)
+        fun_l24_n162(x)
+    else
+        fun_l24_n575(x)
+    end
+end
+
+def fun_l23_n63(x)
+    if (x < 1)
+        fun_l24_n959(x)
+    else
+        fun_l24_n514(x)
+    end
+end
+
+def fun_l23_n64(x)
+    if (x < 1)
+        fun_l24_n133(x)
+    else
+        fun_l24_n731(x)
+    end
+end
+
+def fun_l23_n65(x)
+    if (x < 1)
+        fun_l24_n370(x)
+    else
+        fun_l24_n903(x)
+    end
+end
+
+def fun_l23_n66(x)
+    if (x < 1)
+        fun_l24_n787(x)
+    else
+        fun_l24_n11(x)
+    end
+end
+
+def fun_l23_n67(x)
+    if (x < 1)
+        fun_l24_n307(x)
+    else
+        fun_l24_n7(x)
+    end
+end
+
+def fun_l23_n68(x)
+    if (x < 1)
+        fun_l24_n157(x)
+    else
+        fun_l24_n747(x)
+    end
+end
+
+def fun_l23_n69(x)
+    if (x < 1)
+        fun_l24_n435(x)
+    else
+        fun_l24_n763(x)
+    end
+end
+
+def fun_l23_n70(x)
+    if (x < 1)
+        fun_l24_n623(x)
+    else
+        fun_l24_n279(x)
+    end
+end
+
+def fun_l23_n71(x)
+    if (x < 1)
+        fun_l24_n456(x)
+    else
+        fun_l24_n465(x)
+    end
+end
+
+def fun_l23_n72(x)
+    if (x < 1)
+        fun_l24_n411(x)
+    else
+        fun_l24_n397(x)
+    end
+end
+
+def fun_l23_n73(x)
+    if (x < 1)
+        fun_l24_n964(x)
+    else
+        fun_l24_n144(x)
+    end
+end
+
+def fun_l23_n74(x)
+    if (x < 1)
+        fun_l24_n170(x)
+    else
+        fun_l24_n406(x)
+    end
+end
+
+def fun_l23_n75(x)
+    if (x < 1)
+        fun_l24_n838(x)
+    else
+        fun_l24_n295(x)
+    end
+end
+
+def fun_l23_n76(x)
+    if (x < 1)
+        fun_l24_n89(x)
+    else
+        fun_l24_n803(x)
+    end
+end
+
+def fun_l23_n77(x)
+    if (x < 1)
+        fun_l24_n580(x)
+    else
+        fun_l24_n931(x)
+    end
+end
+
+def fun_l23_n78(x)
+    if (x < 1)
+        fun_l24_n504(x)
+    else
+        fun_l24_n150(x)
+    end
+end
+
+def fun_l23_n79(x)
+    if (x < 1)
+        fun_l24_n363(x)
+    else
+        fun_l24_n717(x)
+    end
+end
+
+def fun_l23_n80(x)
+    if (x < 1)
+        fun_l24_n765(x)
+    else
+        fun_l24_n917(x)
+    end
+end
+
+def fun_l23_n81(x)
+    if (x < 1)
+        fun_l24_n673(x)
+    else
+        fun_l24_n549(x)
+    end
+end
+
+def fun_l23_n82(x)
+    if (x < 1)
+        fun_l24_n986(x)
+    else
+        fun_l24_n177(x)
+    end
+end
+
+def fun_l23_n83(x)
+    if (x < 1)
+        fun_l24_n821(x)
+    else
+        fun_l24_n302(x)
+    end
+end
+
+def fun_l23_n84(x)
+    if (x < 1)
+        fun_l24_n530(x)
+    else
+        fun_l24_n744(x)
+    end
+end
+
+def fun_l23_n85(x)
+    if (x < 1)
+        fun_l24_n456(x)
+    else
+        fun_l24_n964(x)
+    end
+end
+
+def fun_l23_n86(x)
+    if (x < 1)
+        fun_l24_n901(x)
+    else
+        fun_l24_n214(x)
+    end
+end
+
+def fun_l23_n87(x)
+    if (x < 1)
+        fun_l24_n308(x)
+    else
+        fun_l24_n329(x)
+    end
+end
+
+def fun_l23_n88(x)
+    if (x < 1)
+        fun_l24_n749(x)
+    else
+        fun_l24_n822(x)
+    end
+end
+
+def fun_l23_n89(x)
+    if (x < 1)
+        fun_l24_n283(x)
+    else
+        fun_l24_n865(x)
+    end
+end
+
+def fun_l23_n90(x)
+    if (x < 1)
+        fun_l24_n834(x)
+    else
+        fun_l24_n422(x)
+    end
+end
+
+def fun_l23_n91(x)
+    if (x < 1)
+        fun_l24_n920(x)
+    else
+        fun_l24_n799(x)
+    end
+end
+
+def fun_l23_n92(x)
+    if (x < 1)
+        fun_l24_n272(x)
+    else
+        fun_l24_n846(x)
+    end
+end
+
+def fun_l23_n93(x)
+    if (x < 1)
+        fun_l24_n447(x)
+    else
+        fun_l24_n809(x)
+    end
+end
+
+def fun_l23_n94(x)
+    if (x < 1)
+        fun_l24_n826(x)
+    else
+        fun_l24_n521(x)
+    end
+end
+
+def fun_l23_n95(x)
+    if (x < 1)
+        fun_l24_n934(x)
+    else
+        fun_l24_n774(x)
+    end
+end
+
+def fun_l23_n96(x)
+    if (x < 1)
+        fun_l24_n440(x)
+    else
+        fun_l24_n40(x)
+    end
+end
+
+def fun_l23_n97(x)
+    if (x < 1)
+        fun_l24_n980(x)
+    else
+        fun_l24_n801(x)
+    end
+end
+
+def fun_l23_n98(x)
+    if (x < 1)
+        fun_l24_n344(x)
+    else
+        fun_l24_n239(x)
+    end
+end
+
+def fun_l23_n99(x)
+    if (x < 1)
+        fun_l24_n918(x)
+    else
+        fun_l24_n241(x)
+    end
+end
+
+def fun_l23_n100(x)
+    if (x < 1)
+        fun_l24_n902(x)
+    else
+        fun_l24_n12(x)
+    end
+end
+
+def fun_l23_n101(x)
+    if (x < 1)
+        fun_l24_n533(x)
+    else
+        fun_l24_n510(x)
+    end
+end
+
+def fun_l23_n102(x)
+    if (x < 1)
+        fun_l24_n337(x)
+    else
+        fun_l24_n144(x)
+    end
+end
+
+def fun_l23_n103(x)
+    if (x < 1)
+        fun_l24_n835(x)
+    else
+        fun_l24_n268(x)
+    end
+end
+
+def fun_l23_n104(x)
+    if (x < 1)
+        fun_l24_n352(x)
+    else
+        fun_l24_n772(x)
+    end
+end
+
+def fun_l23_n105(x)
+    if (x < 1)
+        fun_l24_n135(x)
+    else
+        fun_l24_n97(x)
+    end
+end
+
+def fun_l23_n106(x)
+    if (x < 1)
+        fun_l24_n70(x)
+    else
+        fun_l24_n528(x)
+    end
+end
+
+def fun_l23_n107(x)
+    if (x < 1)
+        fun_l24_n945(x)
+    else
+        fun_l24_n85(x)
+    end
+end
+
+def fun_l23_n108(x)
+    if (x < 1)
+        fun_l24_n233(x)
+    else
+        fun_l24_n637(x)
+    end
+end
+
+def fun_l23_n109(x)
+    if (x < 1)
+        fun_l24_n715(x)
+    else
+        fun_l24_n111(x)
+    end
+end
+
+def fun_l23_n110(x)
+    if (x < 1)
+        fun_l24_n673(x)
+    else
+        fun_l24_n423(x)
+    end
+end
+
+def fun_l23_n111(x)
+    if (x < 1)
+        fun_l24_n408(x)
+    else
+        fun_l24_n5(x)
+    end
+end
+
+def fun_l23_n112(x)
+    if (x < 1)
+        fun_l24_n89(x)
+    else
+        fun_l24_n669(x)
+    end
+end
+
+def fun_l23_n113(x)
+    if (x < 1)
+        fun_l24_n733(x)
+    else
+        fun_l24_n76(x)
+    end
+end
+
+def fun_l23_n114(x)
+    if (x < 1)
+        fun_l24_n767(x)
+    else
+        fun_l24_n465(x)
+    end
+end
+
+def fun_l23_n115(x)
+    if (x < 1)
+        fun_l24_n428(x)
+    else
+        fun_l24_n948(x)
+    end
+end
+
+def fun_l23_n116(x)
+    if (x < 1)
+        fun_l24_n412(x)
+    else
+        fun_l24_n355(x)
+    end
+end
+
+def fun_l23_n117(x)
+    if (x < 1)
+        fun_l24_n550(x)
+    else
+        fun_l24_n616(x)
+    end
+end
+
+def fun_l23_n118(x)
+    if (x < 1)
+        fun_l24_n858(x)
+    else
+        fun_l24_n74(x)
+    end
+end
+
+def fun_l23_n119(x)
+    if (x < 1)
+        fun_l24_n709(x)
+    else
+        fun_l24_n939(x)
+    end
+end
+
+def fun_l23_n120(x)
+    if (x < 1)
+        fun_l24_n712(x)
+    else
+        fun_l24_n74(x)
+    end
+end
+
+def fun_l23_n121(x)
+    if (x < 1)
+        fun_l24_n34(x)
+    else
+        fun_l24_n532(x)
+    end
+end
+
+def fun_l23_n122(x)
+    if (x < 1)
+        fun_l24_n998(x)
+    else
+        fun_l24_n736(x)
+    end
+end
+
+def fun_l23_n123(x)
+    if (x < 1)
+        fun_l24_n33(x)
+    else
+        fun_l24_n561(x)
+    end
+end
+
+def fun_l23_n124(x)
+    if (x < 1)
+        fun_l24_n750(x)
+    else
+        fun_l24_n634(x)
+    end
+end
+
+def fun_l23_n125(x)
+    if (x < 1)
+        fun_l24_n935(x)
+    else
+        fun_l24_n29(x)
+    end
+end
+
+def fun_l23_n126(x)
+    if (x < 1)
+        fun_l24_n249(x)
+    else
+        fun_l24_n571(x)
+    end
+end
+
+def fun_l23_n127(x)
+    if (x < 1)
+        fun_l24_n827(x)
+    else
+        fun_l24_n892(x)
+    end
+end
+
+def fun_l23_n128(x)
+    if (x < 1)
+        fun_l24_n903(x)
+    else
+        fun_l24_n171(x)
+    end
+end
+
+def fun_l23_n129(x)
+    if (x < 1)
+        fun_l24_n725(x)
+    else
+        fun_l24_n358(x)
+    end
+end
+
+def fun_l23_n130(x)
+    if (x < 1)
+        fun_l24_n616(x)
+    else
+        fun_l24_n795(x)
+    end
+end
+
+def fun_l23_n131(x)
+    if (x < 1)
+        fun_l24_n942(x)
+    else
+        fun_l24_n574(x)
+    end
+end
+
+def fun_l23_n132(x)
+    if (x < 1)
+        fun_l24_n290(x)
+    else
+        fun_l24_n869(x)
+    end
+end
+
+def fun_l23_n133(x)
+    if (x < 1)
+        fun_l24_n73(x)
+    else
+        fun_l24_n542(x)
+    end
+end
+
+def fun_l23_n134(x)
+    if (x < 1)
+        fun_l24_n730(x)
+    else
+        fun_l24_n857(x)
+    end
+end
+
+def fun_l23_n135(x)
+    if (x < 1)
+        fun_l24_n754(x)
+    else
+        fun_l24_n579(x)
+    end
+end
+
+def fun_l23_n136(x)
+    if (x < 1)
+        fun_l24_n503(x)
+    else
+        fun_l24_n574(x)
+    end
+end
+
+def fun_l23_n137(x)
+    if (x < 1)
+        fun_l24_n682(x)
+    else
+        fun_l24_n630(x)
+    end
+end
+
+def fun_l23_n138(x)
+    if (x < 1)
+        fun_l24_n918(x)
+    else
+        fun_l24_n440(x)
+    end
+end
+
+def fun_l23_n139(x)
+    if (x < 1)
+        fun_l24_n938(x)
+    else
+        fun_l24_n524(x)
+    end
+end
+
+def fun_l23_n140(x)
+    if (x < 1)
+        fun_l24_n966(x)
+    else
+        fun_l24_n921(x)
+    end
+end
+
+def fun_l23_n141(x)
+    if (x < 1)
+        fun_l24_n87(x)
+    else
+        fun_l24_n548(x)
+    end
+end
+
+def fun_l23_n142(x)
+    if (x < 1)
+        fun_l24_n828(x)
+    else
+        fun_l24_n708(x)
+    end
+end
+
+def fun_l23_n143(x)
+    if (x < 1)
+        fun_l24_n655(x)
+    else
+        fun_l24_n322(x)
+    end
+end
+
+def fun_l23_n144(x)
+    if (x < 1)
+        fun_l24_n382(x)
+    else
+        fun_l24_n484(x)
+    end
+end
+
+def fun_l23_n145(x)
+    if (x < 1)
+        fun_l24_n830(x)
+    else
+        fun_l24_n755(x)
+    end
+end
+
+def fun_l23_n146(x)
+    if (x < 1)
+        fun_l24_n432(x)
+    else
+        fun_l24_n487(x)
+    end
+end
+
+def fun_l23_n147(x)
+    if (x < 1)
+        fun_l24_n954(x)
+    else
+        fun_l24_n453(x)
+    end
+end
+
+def fun_l23_n148(x)
+    if (x < 1)
+        fun_l24_n562(x)
+    else
+        fun_l24_n872(x)
+    end
+end
+
+def fun_l23_n149(x)
+    if (x < 1)
+        fun_l24_n929(x)
+    else
+        fun_l24_n212(x)
+    end
+end
+
+def fun_l23_n150(x)
+    if (x < 1)
+        fun_l24_n143(x)
+    else
+        fun_l24_n344(x)
+    end
+end
+
+def fun_l23_n151(x)
+    if (x < 1)
+        fun_l24_n475(x)
+    else
+        fun_l24_n379(x)
+    end
+end
+
+def fun_l23_n152(x)
+    if (x < 1)
+        fun_l24_n160(x)
+    else
+        fun_l24_n774(x)
+    end
+end
+
+def fun_l23_n153(x)
+    if (x < 1)
+        fun_l24_n689(x)
+    else
+        fun_l24_n19(x)
+    end
+end
+
+def fun_l23_n154(x)
+    if (x < 1)
+        fun_l24_n98(x)
+    else
+        fun_l24_n572(x)
+    end
+end
+
+def fun_l23_n155(x)
+    if (x < 1)
+        fun_l24_n104(x)
+    else
+        fun_l24_n797(x)
+    end
+end
+
+def fun_l23_n156(x)
+    if (x < 1)
+        fun_l24_n892(x)
+    else
+        fun_l24_n874(x)
+    end
+end
+
+def fun_l23_n157(x)
+    if (x < 1)
+        fun_l24_n900(x)
+    else
+        fun_l24_n458(x)
+    end
+end
+
+def fun_l23_n158(x)
+    if (x < 1)
+        fun_l24_n50(x)
+    else
+        fun_l24_n912(x)
+    end
+end
+
+def fun_l23_n159(x)
+    if (x < 1)
+        fun_l24_n303(x)
+    else
+        fun_l24_n373(x)
+    end
+end
+
+def fun_l23_n160(x)
+    if (x < 1)
+        fun_l24_n137(x)
+    else
+        fun_l24_n102(x)
+    end
+end
+
+def fun_l23_n161(x)
+    if (x < 1)
+        fun_l24_n263(x)
+    else
+        fun_l24_n818(x)
+    end
+end
+
+def fun_l23_n162(x)
+    if (x < 1)
+        fun_l24_n618(x)
+    else
+        fun_l24_n895(x)
+    end
+end
+
+def fun_l23_n163(x)
+    if (x < 1)
+        fun_l24_n845(x)
+    else
+        fun_l24_n26(x)
+    end
+end
+
+def fun_l23_n164(x)
+    if (x < 1)
+        fun_l24_n941(x)
+    else
+        fun_l24_n242(x)
+    end
+end
+
+def fun_l23_n165(x)
+    if (x < 1)
+        fun_l24_n145(x)
+    else
+        fun_l24_n492(x)
+    end
+end
+
+def fun_l23_n166(x)
+    if (x < 1)
+        fun_l24_n261(x)
+    else
+        fun_l24_n235(x)
+    end
+end
+
+def fun_l23_n167(x)
+    if (x < 1)
+        fun_l24_n941(x)
+    else
+        fun_l24_n618(x)
+    end
+end
+
+def fun_l23_n168(x)
+    if (x < 1)
+        fun_l24_n709(x)
+    else
+        fun_l24_n908(x)
+    end
+end
+
+def fun_l23_n169(x)
+    if (x < 1)
+        fun_l24_n746(x)
+    else
+        fun_l24_n116(x)
+    end
+end
+
+def fun_l23_n170(x)
+    if (x < 1)
+        fun_l24_n911(x)
+    else
+        fun_l24_n599(x)
+    end
+end
+
+def fun_l23_n171(x)
+    if (x < 1)
+        fun_l24_n526(x)
+    else
+        fun_l24_n275(x)
+    end
+end
+
+def fun_l23_n172(x)
+    if (x < 1)
+        fun_l24_n919(x)
+    else
+        fun_l24_n525(x)
+    end
+end
+
+def fun_l23_n173(x)
+    if (x < 1)
+        fun_l24_n945(x)
+    else
+        fun_l24_n894(x)
+    end
+end
+
+def fun_l23_n174(x)
+    if (x < 1)
+        fun_l24_n349(x)
+    else
+        fun_l24_n434(x)
+    end
+end
+
+def fun_l23_n175(x)
+    if (x < 1)
+        fun_l24_n498(x)
+    else
+        fun_l24_n679(x)
+    end
+end
+
+def fun_l23_n176(x)
+    if (x < 1)
+        fun_l24_n867(x)
+    else
+        fun_l24_n177(x)
+    end
+end
+
+def fun_l23_n177(x)
+    if (x < 1)
+        fun_l24_n680(x)
+    else
+        fun_l24_n601(x)
+    end
+end
+
+def fun_l23_n178(x)
+    if (x < 1)
+        fun_l24_n838(x)
+    else
+        fun_l24_n5(x)
+    end
+end
+
+def fun_l23_n179(x)
+    if (x < 1)
+        fun_l24_n418(x)
+    else
+        fun_l24_n780(x)
+    end
+end
+
+def fun_l23_n180(x)
+    if (x < 1)
+        fun_l24_n88(x)
+    else
+        fun_l24_n333(x)
+    end
+end
+
+def fun_l23_n181(x)
+    if (x < 1)
+        fun_l24_n657(x)
+    else
+        fun_l24_n787(x)
+    end
+end
+
+def fun_l23_n182(x)
+    if (x < 1)
+        fun_l24_n767(x)
+    else
+        fun_l24_n903(x)
+    end
+end
+
+def fun_l23_n183(x)
+    if (x < 1)
+        fun_l24_n878(x)
+    else
+        fun_l24_n426(x)
+    end
+end
+
+def fun_l23_n184(x)
+    if (x < 1)
+        fun_l24_n649(x)
+    else
+        fun_l24_n221(x)
+    end
+end
+
+def fun_l23_n185(x)
+    if (x < 1)
+        fun_l24_n315(x)
+    else
+        fun_l24_n955(x)
+    end
+end
+
+def fun_l23_n186(x)
+    if (x < 1)
+        fun_l24_n599(x)
+    else
+        fun_l24_n201(x)
+    end
+end
+
+def fun_l23_n187(x)
+    if (x < 1)
+        fun_l24_n851(x)
+    else
+        fun_l24_n294(x)
+    end
+end
+
+def fun_l23_n188(x)
+    if (x < 1)
+        fun_l24_n585(x)
+    else
+        fun_l24_n139(x)
+    end
+end
+
+def fun_l23_n189(x)
+    if (x < 1)
+        fun_l24_n893(x)
+    else
+        fun_l24_n159(x)
+    end
+end
+
+def fun_l23_n190(x)
+    if (x < 1)
+        fun_l24_n70(x)
+    else
+        fun_l24_n50(x)
+    end
+end
+
+def fun_l23_n191(x)
+    if (x < 1)
+        fun_l24_n111(x)
+    else
+        fun_l24_n967(x)
+    end
+end
+
+def fun_l23_n192(x)
+    if (x < 1)
+        fun_l24_n979(x)
+    else
+        fun_l24_n91(x)
+    end
+end
+
+def fun_l23_n193(x)
+    if (x < 1)
+        fun_l24_n651(x)
+    else
+        fun_l24_n321(x)
+    end
+end
+
+def fun_l23_n194(x)
+    if (x < 1)
+        fun_l24_n236(x)
+    else
+        fun_l24_n251(x)
+    end
+end
+
+def fun_l23_n195(x)
+    if (x < 1)
+        fun_l24_n947(x)
+    else
+        fun_l24_n116(x)
+    end
+end
+
+def fun_l23_n196(x)
+    if (x < 1)
+        fun_l24_n336(x)
+    else
+        fun_l24_n637(x)
+    end
+end
+
+def fun_l23_n197(x)
+    if (x < 1)
+        fun_l24_n192(x)
+    else
+        fun_l24_n824(x)
+    end
+end
+
+def fun_l23_n198(x)
+    if (x < 1)
+        fun_l24_n747(x)
+    else
+        fun_l24_n610(x)
+    end
+end
+
+def fun_l23_n199(x)
+    if (x < 1)
+        fun_l24_n735(x)
+    else
+        fun_l24_n347(x)
+    end
+end
+
+def fun_l23_n200(x)
+    if (x < 1)
+        fun_l24_n543(x)
+    else
+        fun_l24_n463(x)
+    end
+end
+
+def fun_l23_n201(x)
+    if (x < 1)
+        fun_l24_n933(x)
+    else
+        fun_l24_n185(x)
+    end
+end
+
+def fun_l23_n202(x)
+    if (x < 1)
+        fun_l24_n319(x)
+    else
+        fun_l24_n739(x)
+    end
+end
+
+def fun_l23_n203(x)
+    if (x < 1)
+        fun_l24_n994(x)
+    else
+        fun_l24_n248(x)
+    end
+end
+
+def fun_l23_n204(x)
+    if (x < 1)
+        fun_l24_n980(x)
+    else
+        fun_l24_n248(x)
+    end
+end
+
+def fun_l23_n205(x)
+    if (x < 1)
+        fun_l24_n427(x)
+    else
+        fun_l24_n670(x)
+    end
+end
+
+def fun_l23_n206(x)
+    if (x < 1)
+        fun_l24_n562(x)
+    else
+        fun_l24_n752(x)
+    end
+end
+
+def fun_l23_n207(x)
+    if (x < 1)
+        fun_l24_n424(x)
+    else
+        fun_l24_n310(x)
+    end
+end
+
+def fun_l23_n208(x)
+    if (x < 1)
+        fun_l24_n761(x)
+    else
+        fun_l24_n562(x)
+    end
+end
+
+def fun_l23_n209(x)
+    if (x < 1)
+        fun_l24_n264(x)
+    else
+        fun_l24_n20(x)
+    end
+end
+
+def fun_l23_n210(x)
+    if (x < 1)
+        fun_l24_n886(x)
+    else
+        fun_l24_n505(x)
+    end
+end
+
+def fun_l23_n211(x)
+    if (x < 1)
+        fun_l24_n715(x)
+    else
+        fun_l24_n641(x)
+    end
+end
+
+def fun_l23_n212(x)
+    if (x < 1)
+        fun_l24_n132(x)
+    else
+        fun_l24_n875(x)
+    end
+end
+
+def fun_l23_n213(x)
+    if (x < 1)
+        fun_l24_n121(x)
+    else
+        fun_l24_n38(x)
+    end
+end
+
+def fun_l23_n214(x)
+    if (x < 1)
+        fun_l24_n672(x)
+    else
+        fun_l24_n497(x)
+    end
+end
+
+def fun_l23_n215(x)
+    if (x < 1)
+        fun_l24_n36(x)
+    else
+        fun_l24_n696(x)
+    end
+end
+
+def fun_l23_n216(x)
+    if (x < 1)
+        fun_l24_n559(x)
+    else
+        fun_l24_n772(x)
+    end
+end
+
+def fun_l23_n217(x)
+    if (x < 1)
+        fun_l24_n63(x)
+    else
+        fun_l24_n990(x)
+    end
+end
+
+def fun_l23_n218(x)
+    if (x < 1)
+        fun_l24_n482(x)
+    else
+        fun_l24_n811(x)
+    end
+end
+
+def fun_l23_n219(x)
+    if (x < 1)
+        fun_l24_n572(x)
+    else
+        fun_l24_n651(x)
+    end
+end
+
+def fun_l23_n220(x)
+    if (x < 1)
+        fun_l24_n588(x)
+    else
+        fun_l24_n87(x)
+    end
+end
+
+def fun_l23_n221(x)
+    if (x < 1)
+        fun_l24_n462(x)
+    else
+        fun_l24_n909(x)
+    end
+end
+
+def fun_l23_n222(x)
+    if (x < 1)
+        fun_l24_n729(x)
+    else
+        fun_l24_n364(x)
+    end
+end
+
+def fun_l23_n223(x)
+    if (x < 1)
+        fun_l24_n259(x)
+    else
+        fun_l24_n661(x)
+    end
+end
+
+def fun_l23_n224(x)
+    if (x < 1)
+        fun_l24_n504(x)
+    else
+        fun_l24_n531(x)
+    end
+end
+
+def fun_l23_n225(x)
+    if (x < 1)
+        fun_l24_n114(x)
+    else
+        fun_l24_n292(x)
+    end
+end
+
+def fun_l23_n226(x)
+    if (x < 1)
+        fun_l24_n207(x)
+    else
+        fun_l24_n206(x)
+    end
+end
+
+def fun_l23_n227(x)
+    if (x < 1)
+        fun_l24_n153(x)
+    else
+        fun_l24_n572(x)
+    end
+end
+
+def fun_l23_n228(x)
+    if (x < 1)
+        fun_l24_n738(x)
+    else
+        fun_l24_n767(x)
+    end
+end
+
+def fun_l23_n229(x)
+    if (x < 1)
+        fun_l24_n374(x)
+    else
+        fun_l24_n336(x)
+    end
+end
+
+def fun_l23_n230(x)
+    if (x < 1)
+        fun_l24_n727(x)
+    else
+        fun_l24_n842(x)
+    end
+end
+
+def fun_l23_n231(x)
+    if (x < 1)
+        fun_l24_n506(x)
+    else
+        fun_l24_n8(x)
+    end
+end
+
+def fun_l23_n232(x)
+    if (x < 1)
+        fun_l24_n101(x)
+    else
+        fun_l24_n502(x)
+    end
+end
+
+def fun_l23_n233(x)
+    if (x < 1)
+        fun_l24_n469(x)
+    else
+        fun_l24_n274(x)
+    end
+end
+
+def fun_l23_n234(x)
+    if (x < 1)
+        fun_l24_n67(x)
+    else
+        fun_l24_n66(x)
+    end
+end
+
+def fun_l23_n235(x)
+    if (x < 1)
+        fun_l24_n874(x)
+    else
+        fun_l24_n104(x)
+    end
+end
+
+def fun_l23_n236(x)
+    if (x < 1)
+        fun_l24_n154(x)
+    else
+        fun_l24_n723(x)
+    end
+end
+
+def fun_l23_n237(x)
+    if (x < 1)
+        fun_l24_n300(x)
+    else
+        fun_l24_n0(x)
+    end
+end
+
+def fun_l23_n238(x)
+    if (x < 1)
+        fun_l24_n767(x)
+    else
+        fun_l24_n134(x)
+    end
+end
+
+def fun_l23_n239(x)
+    if (x < 1)
+        fun_l24_n647(x)
+    else
+        fun_l24_n890(x)
+    end
+end
+
+def fun_l23_n240(x)
+    if (x < 1)
+        fun_l24_n258(x)
+    else
+        fun_l24_n302(x)
+    end
+end
+
+def fun_l23_n241(x)
+    if (x < 1)
+        fun_l24_n104(x)
+    else
+        fun_l24_n335(x)
+    end
+end
+
+def fun_l23_n242(x)
+    if (x < 1)
+        fun_l24_n500(x)
+    else
+        fun_l24_n383(x)
+    end
+end
+
+def fun_l23_n243(x)
+    if (x < 1)
+        fun_l24_n63(x)
+    else
+        fun_l24_n421(x)
+    end
+end
+
+def fun_l23_n244(x)
+    if (x < 1)
+        fun_l24_n105(x)
+    else
+        fun_l24_n451(x)
+    end
+end
+
+def fun_l23_n245(x)
+    if (x < 1)
+        fun_l24_n729(x)
+    else
+        fun_l24_n333(x)
+    end
+end
+
+def fun_l23_n246(x)
+    if (x < 1)
+        fun_l24_n966(x)
+    else
+        fun_l24_n556(x)
+    end
+end
+
+def fun_l23_n247(x)
+    if (x < 1)
+        fun_l24_n118(x)
+    else
+        fun_l24_n565(x)
+    end
+end
+
+def fun_l23_n248(x)
+    if (x < 1)
+        fun_l24_n61(x)
+    else
+        fun_l24_n816(x)
+    end
+end
+
+def fun_l23_n249(x)
+    if (x < 1)
+        fun_l24_n769(x)
+    else
+        fun_l24_n183(x)
+    end
+end
+
+def fun_l23_n250(x)
+    if (x < 1)
+        fun_l24_n688(x)
+    else
+        fun_l24_n60(x)
+    end
+end
+
+def fun_l23_n251(x)
+    if (x < 1)
+        fun_l24_n859(x)
+    else
+        fun_l24_n434(x)
+    end
+end
+
+def fun_l23_n252(x)
+    if (x < 1)
+        fun_l24_n650(x)
+    else
+        fun_l24_n448(x)
+    end
+end
+
+def fun_l23_n253(x)
+    if (x < 1)
+        fun_l24_n519(x)
+    else
+        fun_l24_n963(x)
+    end
+end
+
+def fun_l23_n254(x)
+    if (x < 1)
+        fun_l24_n176(x)
+    else
+        fun_l24_n908(x)
+    end
+end
+
+def fun_l23_n255(x)
+    if (x < 1)
+        fun_l24_n146(x)
+    else
+        fun_l24_n751(x)
+    end
+end
+
+def fun_l23_n256(x)
+    if (x < 1)
+        fun_l24_n742(x)
+    else
+        fun_l24_n928(x)
+    end
+end
+
+def fun_l23_n257(x)
+    if (x < 1)
+        fun_l24_n22(x)
+    else
+        fun_l24_n48(x)
+    end
+end
+
+def fun_l23_n258(x)
+    if (x < 1)
+        fun_l24_n158(x)
+    else
+        fun_l24_n299(x)
+    end
+end
+
+def fun_l23_n259(x)
+    if (x < 1)
+        fun_l24_n247(x)
+    else
+        fun_l24_n419(x)
+    end
+end
+
+def fun_l23_n260(x)
+    if (x < 1)
+        fun_l24_n161(x)
+    else
+        fun_l24_n387(x)
+    end
+end
+
+def fun_l23_n261(x)
+    if (x < 1)
+        fun_l24_n627(x)
+    else
+        fun_l24_n321(x)
+    end
+end
+
+def fun_l23_n262(x)
+    if (x < 1)
+        fun_l24_n946(x)
+    else
+        fun_l24_n617(x)
+    end
+end
+
+def fun_l23_n263(x)
+    if (x < 1)
+        fun_l24_n853(x)
+    else
+        fun_l24_n208(x)
+    end
+end
+
+def fun_l23_n264(x)
+    if (x < 1)
+        fun_l24_n213(x)
+    else
+        fun_l24_n27(x)
+    end
+end
+
+def fun_l23_n265(x)
+    if (x < 1)
+        fun_l24_n819(x)
+    else
+        fun_l24_n438(x)
+    end
+end
+
+def fun_l23_n266(x)
+    if (x < 1)
+        fun_l24_n351(x)
+    else
+        fun_l24_n739(x)
+    end
+end
+
+def fun_l23_n267(x)
+    if (x < 1)
+        fun_l24_n333(x)
+    else
+        fun_l24_n179(x)
+    end
+end
+
+def fun_l23_n268(x)
+    if (x < 1)
+        fun_l24_n528(x)
+    else
+        fun_l24_n397(x)
+    end
+end
+
+def fun_l23_n269(x)
+    if (x < 1)
+        fun_l24_n655(x)
+    else
+        fun_l24_n994(x)
+    end
+end
+
+def fun_l23_n270(x)
+    if (x < 1)
+        fun_l24_n257(x)
+    else
+        fun_l24_n346(x)
+    end
+end
+
+def fun_l23_n271(x)
+    if (x < 1)
+        fun_l24_n183(x)
+    else
+        fun_l24_n908(x)
+    end
+end
+
+def fun_l23_n272(x)
+    if (x < 1)
+        fun_l24_n742(x)
+    else
+        fun_l24_n483(x)
+    end
+end
+
+def fun_l23_n273(x)
+    if (x < 1)
+        fun_l24_n803(x)
+    else
+        fun_l24_n318(x)
+    end
+end
+
+def fun_l23_n274(x)
+    if (x < 1)
+        fun_l24_n228(x)
+    else
+        fun_l24_n540(x)
+    end
+end
+
+def fun_l23_n275(x)
+    if (x < 1)
+        fun_l24_n999(x)
+    else
+        fun_l24_n55(x)
+    end
+end
+
+def fun_l23_n276(x)
+    if (x < 1)
+        fun_l24_n129(x)
+    else
+        fun_l24_n235(x)
+    end
+end
+
+def fun_l23_n277(x)
+    if (x < 1)
+        fun_l24_n320(x)
+    else
+        fun_l24_n211(x)
+    end
+end
+
+def fun_l23_n278(x)
+    if (x < 1)
+        fun_l24_n757(x)
+    else
+        fun_l24_n440(x)
+    end
+end
+
+def fun_l23_n279(x)
+    if (x < 1)
+        fun_l24_n784(x)
+    else
+        fun_l24_n117(x)
+    end
+end
+
+def fun_l23_n280(x)
+    if (x < 1)
+        fun_l24_n280(x)
+    else
+        fun_l24_n560(x)
+    end
+end
+
+def fun_l23_n281(x)
+    if (x < 1)
+        fun_l24_n981(x)
+    else
+        fun_l24_n939(x)
+    end
+end
+
+def fun_l23_n282(x)
+    if (x < 1)
+        fun_l24_n500(x)
+    else
+        fun_l24_n90(x)
+    end
+end
+
+def fun_l23_n283(x)
+    if (x < 1)
+        fun_l24_n958(x)
+    else
+        fun_l24_n415(x)
+    end
+end
+
+def fun_l23_n284(x)
+    if (x < 1)
+        fun_l24_n237(x)
+    else
+        fun_l24_n556(x)
+    end
+end
+
+def fun_l23_n285(x)
+    if (x < 1)
+        fun_l24_n87(x)
+    else
+        fun_l24_n630(x)
+    end
+end
+
+def fun_l23_n286(x)
+    if (x < 1)
+        fun_l24_n121(x)
+    else
+        fun_l24_n974(x)
+    end
+end
+
+def fun_l23_n287(x)
+    if (x < 1)
+        fun_l24_n491(x)
+    else
+        fun_l24_n505(x)
+    end
+end
+
+def fun_l23_n288(x)
+    if (x < 1)
+        fun_l24_n342(x)
+    else
+        fun_l24_n408(x)
+    end
+end
+
+def fun_l23_n289(x)
+    if (x < 1)
+        fun_l24_n456(x)
+    else
+        fun_l24_n768(x)
+    end
+end
+
+def fun_l23_n290(x)
+    if (x < 1)
+        fun_l24_n64(x)
+    else
+        fun_l24_n515(x)
+    end
+end
+
+def fun_l23_n291(x)
+    if (x < 1)
+        fun_l24_n86(x)
+    else
+        fun_l24_n420(x)
+    end
+end
+
+def fun_l23_n292(x)
+    if (x < 1)
+        fun_l24_n61(x)
+    else
+        fun_l24_n295(x)
+    end
+end
+
+def fun_l23_n293(x)
+    if (x < 1)
+        fun_l24_n893(x)
+    else
+        fun_l24_n680(x)
+    end
+end
+
+def fun_l23_n294(x)
+    if (x < 1)
+        fun_l24_n81(x)
+    else
+        fun_l24_n946(x)
+    end
+end
+
+def fun_l23_n295(x)
+    if (x < 1)
+        fun_l24_n444(x)
+    else
+        fun_l24_n205(x)
+    end
+end
+
+def fun_l23_n296(x)
+    if (x < 1)
+        fun_l24_n898(x)
+    else
+        fun_l24_n101(x)
+    end
+end
+
+def fun_l23_n297(x)
+    if (x < 1)
+        fun_l24_n617(x)
+    else
+        fun_l24_n660(x)
+    end
+end
+
+def fun_l23_n298(x)
+    if (x < 1)
+        fun_l24_n117(x)
+    else
+        fun_l24_n806(x)
+    end
+end
+
+def fun_l23_n299(x)
+    if (x < 1)
+        fun_l24_n92(x)
+    else
+        fun_l24_n660(x)
+    end
+end
+
+def fun_l23_n300(x)
+    if (x < 1)
+        fun_l24_n202(x)
+    else
+        fun_l24_n611(x)
+    end
+end
+
+def fun_l23_n301(x)
+    if (x < 1)
+        fun_l24_n852(x)
+    else
+        fun_l24_n569(x)
+    end
+end
+
+def fun_l23_n302(x)
+    if (x < 1)
+        fun_l24_n69(x)
+    else
+        fun_l24_n725(x)
+    end
+end
+
+def fun_l23_n303(x)
+    if (x < 1)
+        fun_l24_n183(x)
+    else
+        fun_l24_n406(x)
+    end
+end
+
+def fun_l23_n304(x)
+    if (x < 1)
+        fun_l24_n926(x)
+    else
+        fun_l24_n838(x)
+    end
+end
+
+def fun_l23_n305(x)
+    if (x < 1)
+        fun_l24_n16(x)
+    else
+        fun_l24_n681(x)
+    end
+end
+
+def fun_l23_n306(x)
+    if (x < 1)
+        fun_l24_n43(x)
+    else
+        fun_l24_n504(x)
+    end
+end
+
+def fun_l23_n307(x)
+    if (x < 1)
+        fun_l24_n417(x)
+    else
+        fun_l24_n239(x)
+    end
+end
+
+def fun_l23_n308(x)
+    if (x < 1)
+        fun_l24_n353(x)
+    else
+        fun_l24_n467(x)
+    end
+end
+
+def fun_l23_n309(x)
+    if (x < 1)
+        fun_l24_n633(x)
+    else
+        fun_l24_n593(x)
+    end
+end
+
+def fun_l23_n310(x)
+    if (x < 1)
+        fun_l24_n974(x)
+    else
+        fun_l24_n894(x)
+    end
+end
+
+def fun_l23_n311(x)
+    if (x < 1)
+        fun_l24_n3(x)
+    else
+        fun_l24_n751(x)
+    end
+end
+
+def fun_l23_n312(x)
+    if (x < 1)
+        fun_l24_n728(x)
+    else
+        fun_l24_n116(x)
+    end
+end
+
+def fun_l23_n313(x)
+    if (x < 1)
+        fun_l24_n588(x)
+    else
+        fun_l24_n636(x)
+    end
+end
+
+def fun_l23_n314(x)
+    if (x < 1)
+        fun_l24_n284(x)
+    else
+        fun_l24_n751(x)
+    end
+end
+
+def fun_l23_n315(x)
+    if (x < 1)
+        fun_l24_n567(x)
+    else
+        fun_l24_n356(x)
+    end
+end
+
+def fun_l23_n316(x)
+    if (x < 1)
+        fun_l24_n78(x)
+    else
+        fun_l24_n714(x)
+    end
+end
+
+def fun_l23_n317(x)
+    if (x < 1)
+        fun_l24_n592(x)
+    else
+        fun_l24_n720(x)
+    end
+end
+
+def fun_l23_n318(x)
+    if (x < 1)
+        fun_l24_n273(x)
+    else
+        fun_l24_n367(x)
+    end
+end
+
+def fun_l23_n319(x)
+    if (x < 1)
+        fun_l24_n816(x)
+    else
+        fun_l24_n964(x)
+    end
+end
+
+def fun_l23_n320(x)
+    if (x < 1)
+        fun_l24_n59(x)
+    else
+        fun_l24_n630(x)
+    end
+end
+
+def fun_l23_n321(x)
+    if (x < 1)
+        fun_l24_n298(x)
+    else
+        fun_l24_n639(x)
+    end
+end
+
+def fun_l23_n322(x)
+    if (x < 1)
+        fun_l24_n70(x)
+    else
+        fun_l24_n714(x)
+    end
+end
+
+def fun_l23_n323(x)
+    if (x < 1)
+        fun_l24_n495(x)
+    else
+        fun_l24_n630(x)
+    end
+end
+
+def fun_l23_n324(x)
+    if (x < 1)
+        fun_l24_n780(x)
+    else
+        fun_l24_n932(x)
+    end
+end
+
+def fun_l23_n325(x)
+    if (x < 1)
+        fun_l24_n494(x)
+    else
+        fun_l24_n610(x)
+    end
+end
+
+def fun_l23_n326(x)
+    if (x < 1)
+        fun_l24_n509(x)
+    else
+        fun_l24_n635(x)
+    end
+end
+
+def fun_l23_n327(x)
+    if (x < 1)
+        fun_l24_n991(x)
+    else
+        fun_l24_n355(x)
+    end
+end
+
+def fun_l23_n328(x)
+    if (x < 1)
+        fun_l24_n153(x)
+    else
+        fun_l24_n234(x)
+    end
+end
+
+def fun_l23_n329(x)
+    if (x < 1)
+        fun_l24_n483(x)
+    else
+        fun_l24_n812(x)
+    end
+end
+
+def fun_l23_n330(x)
+    if (x < 1)
+        fun_l24_n123(x)
+    else
+        fun_l24_n665(x)
+    end
+end
+
+def fun_l23_n331(x)
+    if (x < 1)
+        fun_l24_n752(x)
+    else
+        fun_l24_n471(x)
+    end
+end
+
+def fun_l23_n332(x)
+    if (x < 1)
+        fun_l24_n440(x)
+    else
+        fun_l24_n788(x)
+    end
+end
+
+def fun_l23_n333(x)
+    if (x < 1)
+        fun_l24_n381(x)
+    else
+        fun_l24_n95(x)
+    end
+end
+
+def fun_l23_n334(x)
+    if (x < 1)
+        fun_l24_n379(x)
+    else
+        fun_l24_n982(x)
+    end
+end
+
+def fun_l23_n335(x)
+    if (x < 1)
+        fun_l24_n766(x)
+    else
+        fun_l24_n14(x)
+    end
+end
+
+def fun_l23_n336(x)
+    if (x < 1)
+        fun_l24_n733(x)
+    else
+        fun_l24_n614(x)
+    end
+end
+
+def fun_l23_n337(x)
+    if (x < 1)
+        fun_l24_n946(x)
+    else
+        fun_l24_n408(x)
+    end
+end
+
+def fun_l23_n338(x)
+    if (x < 1)
+        fun_l24_n98(x)
+    else
+        fun_l24_n542(x)
+    end
+end
+
+def fun_l23_n339(x)
+    if (x < 1)
+        fun_l24_n60(x)
+    else
+        fun_l24_n970(x)
+    end
+end
+
+def fun_l23_n340(x)
+    if (x < 1)
+        fun_l24_n933(x)
+    else
+        fun_l24_n517(x)
+    end
+end
+
+def fun_l23_n341(x)
+    if (x < 1)
+        fun_l24_n634(x)
+    else
+        fun_l24_n943(x)
+    end
+end
+
+def fun_l23_n342(x)
+    if (x < 1)
+        fun_l24_n50(x)
+    else
+        fun_l24_n800(x)
+    end
+end
+
+def fun_l23_n343(x)
+    if (x < 1)
+        fun_l24_n352(x)
+    else
+        fun_l24_n450(x)
+    end
+end
+
+def fun_l23_n344(x)
+    if (x < 1)
+        fun_l24_n340(x)
+    else
+        fun_l24_n101(x)
+    end
+end
+
+def fun_l23_n345(x)
+    if (x < 1)
+        fun_l24_n383(x)
+    else
+        fun_l24_n493(x)
+    end
+end
+
+def fun_l23_n346(x)
+    if (x < 1)
+        fun_l24_n805(x)
+    else
+        fun_l24_n845(x)
+    end
+end
+
+def fun_l23_n347(x)
+    if (x < 1)
+        fun_l24_n491(x)
+    else
+        fun_l24_n756(x)
+    end
+end
+
+def fun_l23_n348(x)
+    if (x < 1)
+        fun_l24_n508(x)
+    else
+        fun_l24_n2(x)
+    end
+end
+
+def fun_l23_n349(x)
+    if (x < 1)
+        fun_l24_n865(x)
+    else
+        fun_l24_n55(x)
+    end
+end
+
+def fun_l23_n350(x)
+    if (x < 1)
+        fun_l24_n218(x)
+    else
+        fun_l24_n456(x)
+    end
+end
+
+def fun_l23_n351(x)
+    if (x < 1)
+        fun_l24_n162(x)
+    else
+        fun_l24_n312(x)
+    end
+end
+
+def fun_l23_n352(x)
+    if (x < 1)
+        fun_l24_n309(x)
+    else
+        fun_l24_n431(x)
+    end
+end
+
+def fun_l23_n353(x)
+    if (x < 1)
+        fun_l24_n411(x)
+    else
+        fun_l24_n684(x)
+    end
+end
+
+def fun_l23_n354(x)
+    if (x < 1)
+        fun_l24_n381(x)
+    else
+        fun_l24_n703(x)
+    end
+end
+
+def fun_l23_n355(x)
+    if (x < 1)
+        fun_l24_n189(x)
+    else
+        fun_l24_n217(x)
+    end
+end
+
+def fun_l23_n356(x)
+    if (x < 1)
+        fun_l24_n180(x)
+    else
+        fun_l24_n706(x)
+    end
+end
+
+def fun_l23_n357(x)
+    if (x < 1)
+        fun_l24_n76(x)
+    else
+        fun_l24_n575(x)
+    end
+end
+
+def fun_l23_n358(x)
+    if (x < 1)
+        fun_l24_n574(x)
+    else
+        fun_l24_n842(x)
+    end
+end
+
+def fun_l23_n359(x)
+    if (x < 1)
+        fun_l24_n281(x)
+    else
+        fun_l24_n572(x)
+    end
+end
+
+def fun_l23_n360(x)
+    if (x < 1)
+        fun_l24_n2(x)
+    else
+        fun_l24_n928(x)
+    end
+end
+
+def fun_l23_n361(x)
+    if (x < 1)
+        fun_l24_n840(x)
+    else
+        fun_l24_n794(x)
+    end
+end
+
+def fun_l23_n362(x)
+    if (x < 1)
+        fun_l24_n657(x)
+    else
+        fun_l24_n987(x)
+    end
+end
+
+def fun_l23_n363(x)
+    if (x < 1)
+        fun_l24_n400(x)
+    else
+        fun_l24_n151(x)
+    end
+end
+
+def fun_l23_n364(x)
+    if (x < 1)
+        fun_l24_n123(x)
+    else
+        fun_l24_n873(x)
+    end
+end
+
+def fun_l23_n365(x)
+    if (x < 1)
+        fun_l24_n51(x)
+    else
+        fun_l24_n52(x)
+    end
+end
+
+def fun_l23_n366(x)
+    if (x < 1)
+        fun_l24_n809(x)
+    else
+        fun_l24_n32(x)
+    end
+end
+
+def fun_l23_n367(x)
+    if (x < 1)
+        fun_l24_n928(x)
+    else
+        fun_l24_n618(x)
+    end
+end
+
+def fun_l23_n368(x)
+    if (x < 1)
+        fun_l24_n563(x)
+    else
+        fun_l24_n937(x)
+    end
+end
+
+def fun_l23_n369(x)
+    if (x < 1)
+        fun_l24_n312(x)
+    else
+        fun_l24_n918(x)
+    end
+end
+
+def fun_l23_n370(x)
+    if (x < 1)
+        fun_l24_n940(x)
+    else
+        fun_l24_n994(x)
+    end
+end
+
+def fun_l23_n371(x)
+    if (x < 1)
+        fun_l24_n788(x)
+    else
+        fun_l24_n187(x)
+    end
+end
+
+def fun_l23_n372(x)
+    if (x < 1)
+        fun_l24_n110(x)
+    else
+        fun_l24_n523(x)
+    end
+end
+
+def fun_l23_n373(x)
+    if (x < 1)
+        fun_l24_n158(x)
+    else
+        fun_l24_n656(x)
+    end
+end
+
+def fun_l23_n374(x)
+    if (x < 1)
+        fun_l24_n522(x)
+    else
+        fun_l24_n395(x)
+    end
+end
+
+def fun_l23_n375(x)
+    if (x < 1)
+        fun_l24_n90(x)
+    else
+        fun_l24_n732(x)
+    end
+end
+
+def fun_l23_n376(x)
+    if (x < 1)
+        fun_l24_n809(x)
+    else
+        fun_l24_n513(x)
+    end
+end
+
+def fun_l23_n377(x)
+    if (x < 1)
+        fun_l24_n916(x)
+    else
+        fun_l24_n962(x)
+    end
+end
+
+def fun_l23_n378(x)
+    if (x < 1)
+        fun_l24_n852(x)
+    else
+        fun_l24_n350(x)
+    end
+end
+
+def fun_l23_n379(x)
+    if (x < 1)
+        fun_l24_n555(x)
+    else
+        fun_l24_n375(x)
+    end
+end
+
+def fun_l23_n380(x)
+    if (x < 1)
+        fun_l24_n17(x)
+    else
+        fun_l24_n566(x)
+    end
+end
+
+def fun_l23_n381(x)
+    if (x < 1)
+        fun_l24_n332(x)
+    else
+        fun_l24_n35(x)
+    end
+end
+
+def fun_l23_n382(x)
+    if (x < 1)
+        fun_l24_n531(x)
+    else
+        fun_l24_n368(x)
+    end
+end
+
+def fun_l23_n383(x)
+    if (x < 1)
+        fun_l24_n712(x)
+    else
+        fun_l24_n32(x)
+    end
+end
+
+def fun_l23_n384(x)
+    if (x < 1)
+        fun_l24_n239(x)
+    else
+        fun_l24_n542(x)
+    end
+end
+
+def fun_l23_n385(x)
+    if (x < 1)
+        fun_l24_n914(x)
+    else
+        fun_l24_n820(x)
+    end
+end
+
+def fun_l23_n386(x)
+    if (x < 1)
+        fun_l24_n579(x)
+    else
+        fun_l24_n202(x)
+    end
+end
+
+def fun_l23_n387(x)
+    if (x < 1)
+        fun_l24_n36(x)
+    else
+        fun_l24_n591(x)
+    end
+end
+
+def fun_l23_n388(x)
+    if (x < 1)
+        fun_l24_n485(x)
+    else
+        fun_l24_n707(x)
+    end
+end
+
+def fun_l23_n389(x)
+    if (x < 1)
+        fun_l24_n587(x)
+    else
+        fun_l24_n588(x)
+    end
+end
+
+def fun_l23_n390(x)
+    if (x < 1)
+        fun_l24_n837(x)
+    else
+        fun_l24_n352(x)
+    end
+end
+
+def fun_l23_n391(x)
+    if (x < 1)
+        fun_l24_n926(x)
+    else
+        fun_l24_n553(x)
+    end
+end
+
+def fun_l23_n392(x)
+    if (x < 1)
+        fun_l24_n557(x)
+    else
+        fun_l24_n944(x)
+    end
+end
+
+def fun_l23_n393(x)
+    if (x < 1)
+        fun_l24_n870(x)
+    else
+        fun_l24_n632(x)
+    end
+end
+
+def fun_l23_n394(x)
+    if (x < 1)
+        fun_l24_n732(x)
+    else
+        fun_l24_n285(x)
+    end
+end
+
+def fun_l23_n395(x)
+    if (x < 1)
+        fun_l24_n249(x)
+    else
+        fun_l24_n709(x)
+    end
+end
+
+def fun_l23_n396(x)
+    if (x < 1)
+        fun_l24_n674(x)
+    else
+        fun_l24_n693(x)
+    end
+end
+
+def fun_l23_n397(x)
+    if (x < 1)
+        fun_l24_n20(x)
+    else
+        fun_l24_n367(x)
+    end
+end
+
+def fun_l23_n398(x)
+    if (x < 1)
+        fun_l24_n545(x)
+    else
+        fun_l24_n973(x)
+    end
+end
+
+def fun_l23_n399(x)
+    if (x < 1)
+        fun_l24_n460(x)
+    else
+        fun_l24_n627(x)
+    end
+end
+
+def fun_l23_n400(x)
+    if (x < 1)
+        fun_l24_n941(x)
+    else
+        fun_l24_n679(x)
+    end
+end
+
+def fun_l23_n401(x)
+    if (x < 1)
+        fun_l24_n161(x)
+    else
+        fun_l24_n518(x)
+    end
+end
+
+def fun_l23_n402(x)
+    if (x < 1)
+        fun_l24_n738(x)
+    else
+        fun_l24_n393(x)
+    end
+end
+
+def fun_l23_n403(x)
+    if (x < 1)
+        fun_l24_n75(x)
+    else
+        fun_l24_n776(x)
+    end
+end
+
+def fun_l23_n404(x)
+    if (x < 1)
+        fun_l24_n996(x)
+    else
+        fun_l24_n71(x)
+    end
+end
+
+def fun_l23_n405(x)
+    if (x < 1)
+        fun_l24_n732(x)
+    else
+        fun_l24_n649(x)
+    end
+end
+
+def fun_l23_n406(x)
+    if (x < 1)
+        fun_l24_n142(x)
+    else
+        fun_l24_n563(x)
+    end
+end
+
+def fun_l23_n407(x)
+    if (x < 1)
+        fun_l24_n63(x)
+    else
+        fun_l24_n629(x)
+    end
+end
+
+def fun_l23_n408(x)
+    if (x < 1)
+        fun_l24_n734(x)
+    else
+        fun_l24_n857(x)
+    end
+end
+
+def fun_l23_n409(x)
+    if (x < 1)
+        fun_l24_n100(x)
+    else
+        fun_l24_n340(x)
+    end
+end
+
+def fun_l23_n410(x)
+    if (x < 1)
+        fun_l24_n471(x)
+    else
+        fun_l24_n114(x)
+    end
+end
+
+def fun_l23_n411(x)
+    if (x < 1)
+        fun_l24_n316(x)
+    else
+        fun_l24_n965(x)
+    end
+end
+
+def fun_l23_n412(x)
+    if (x < 1)
+        fun_l24_n909(x)
+    else
+        fun_l24_n779(x)
+    end
+end
+
+def fun_l23_n413(x)
+    if (x < 1)
+        fun_l24_n846(x)
+    else
+        fun_l24_n473(x)
+    end
+end
+
+def fun_l23_n414(x)
+    if (x < 1)
+        fun_l24_n117(x)
+    else
+        fun_l24_n751(x)
+    end
+end
+
+def fun_l23_n415(x)
+    if (x < 1)
+        fun_l24_n360(x)
+    else
+        fun_l24_n285(x)
+    end
+end
+
+def fun_l23_n416(x)
+    if (x < 1)
+        fun_l24_n430(x)
+    else
+        fun_l24_n273(x)
+    end
+end
+
+def fun_l23_n417(x)
+    if (x < 1)
+        fun_l24_n925(x)
+    else
+        fun_l24_n928(x)
+    end
+end
+
+def fun_l23_n418(x)
+    if (x < 1)
+        fun_l24_n478(x)
+    else
+        fun_l24_n511(x)
+    end
+end
+
+def fun_l23_n419(x)
+    if (x < 1)
+        fun_l24_n415(x)
+    else
+        fun_l24_n127(x)
+    end
+end
+
+def fun_l23_n420(x)
+    if (x < 1)
+        fun_l24_n33(x)
+    else
+        fun_l24_n897(x)
+    end
+end
+
+def fun_l23_n421(x)
+    if (x < 1)
+        fun_l24_n112(x)
+    else
+        fun_l24_n87(x)
+    end
+end
+
+def fun_l23_n422(x)
+    if (x < 1)
+        fun_l24_n386(x)
+    else
+        fun_l24_n450(x)
+    end
+end
+
+def fun_l23_n423(x)
+    if (x < 1)
+        fun_l24_n430(x)
+    else
+        fun_l24_n517(x)
+    end
+end
+
+def fun_l23_n424(x)
+    if (x < 1)
+        fun_l24_n413(x)
+    else
+        fun_l24_n799(x)
+    end
+end
+
+def fun_l23_n425(x)
+    if (x < 1)
+        fun_l24_n744(x)
+    else
+        fun_l24_n218(x)
+    end
+end
+
+def fun_l23_n426(x)
+    if (x < 1)
+        fun_l24_n231(x)
+    else
+        fun_l24_n454(x)
+    end
+end
+
+def fun_l23_n427(x)
+    if (x < 1)
+        fun_l24_n693(x)
+    else
+        fun_l24_n28(x)
+    end
+end
+
+def fun_l23_n428(x)
+    if (x < 1)
+        fun_l24_n694(x)
+    else
+        fun_l24_n712(x)
+    end
+end
+
+def fun_l23_n429(x)
+    if (x < 1)
+        fun_l24_n949(x)
+    else
+        fun_l24_n983(x)
+    end
+end
+
+def fun_l23_n430(x)
+    if (x < 1)
+        fun_l24_n324(x)
+    else
+        fun_l24_n818(x)
+    end
+end
+
+def fun_l23_n431(x)
+    if (x < 1)
+        fun_l24_n820(x)
+    else
+        fun_l24_n662(x)
+    end
+end
+
+def fun_l23_n432(x)
+    if (x < 1)
+        fun_l24_n391(x)
+    else
+        fun_l24_n801(x)
+    end
+end
+
+def fun_l23_n433(x)
+    if (x < 1)
+        fun_l24_n285(x)
+    else
+        fun_l24_n79(x)
+    end
+end
+
+def fun_l23_n434(x)
+    if (x < 1)
+        fun_l24_n582(x)
+    else
+        fun_l24_n820(x)
+    end
+end
+
+def fun_l23_n435(x)
+    if (x < 1)
+        fun_l24_n324(x)
+    else
+        fun_l24_n348(x)
+    end
+end
+
+def fun_l23_n436(x)
+    if (x < 1)
+        fun_l24_n241(x)
+    else
+        fun_l24_n568(x)
+    end
+end
+
+def fun_l23_n437(x)
+    if (x < 1)
+        fun_l24_n261(x)
+    else
+        fun_l24_n374(x)
+    end
+end
+
+def fun_l23_n438(x)
+    if (x < 1)
+        fun_l24_n886(x)
+    else
+        fun_l24_n38(x)
+    end
+end
+
+def fun_l23_n439(x)
+    if (x < 1)
+        fun_l24_n344(x)
+    else
+        fun_l24_n991(x)
+    end
+end
+
+def fun_l23_n440(x)
+    if (x < 1)
+        fun_l24_n792(x)
+    else
+        fun_l24_n298(x)
+    end
+end
+
+def fun_l23_n441(x)
+    if (x < 1)
+        fun_l24_n728(x)
+    else
+        fun_l24_n575(x)
+    end
+end
+
+def fun_l23_n442(x)
+    if (x < 1)
+        fun_l24_n22(x)
+    else
+        fun_l24_n804(x)
+    end
+end
+
+def fun_l23_n443(x)
+    if (x < 1)
+        fun_l24_n406(x)
+    else
+        fun_l24_n723(x)
+    end
+end
+
+def fun_l23_n444(x)
+    if (x < 1)
+        fun_l24_n921(x)
+    else
+        fun_l24_n455(x)
+    end
+end
+
+def fun_l23_n445(x)
+    if (x < 1)
+        fun_l24_n725(x)
+    else
+        fun_l24_n799(x)
+    end
+end
+
+def fun_l23_n446(x)
+    if (x < 1)
+        fun_l24_n543(x)
+    else
+        fun_l24_n350(x)
+    end
+end
+
+def fun_l23_n447(x)
+    if (x < 1)
+        fun_l24_n849(x)
+    else
+        fun_l24_n447(x)
+    end
+end
+
+def fun_l23_n448(x)
+    if (x < 1)
+        fun_l24_n357(x)
+    else
+        fun_l24_n915(x)
+    end
+end
+
+def fun_l23_n449(x)
+    if (x < 1)
+        fun_l24_n143(x)
+    else
+        fun_l24_n164(x)
+    end
+end
+
+def fun_l23_n450(x)
+    if (x < 1)
+        fun_l24_n702(x)
+    else
+        fun_l24_n940(x)
+    end
+end
+
+def fun_l23_n451(x)
+    if (x < 1)
+        fun_l24_n76(x)
+    else
+        fun_l24_n229(x)
+    end
+end
+
+def fun_l23_n452(x)
+    if (x < 1)
+        fun_l24_n55(x)
+    else
+        fun_l24_n177(x)
+    end
+end
+
+def fun_l23_n453(x)
+    if (x < 1)
+        fun_l24_n65(x)
+    else
+        fun_l24_n310(x)
+    end
+end
+
+def fun_l23_n454(x)
+    if (x < 1)
+        fun_l24_n818(x)
+    else
+        fun_l24_n1(x)
+    end
+end
+
+def fun_l23_n455(x)
+    if (x < 1)
+        fun_l24_n555(x)
+    else
+        fun_l24_n475(x)
+    end
+end
+
+def fun_l23_n456(x)
+    if (x < 1)
+        fun_l24_n867(x)
+    else
+        fun_l24_n350(x)
+    end
+end
+
+def fun_l23_n457(x)
+    if (x < 1)
+        fun_l24_n953(x)
+    else
+        fun_l24_n932(x)
+    end
+end
+
+def fun_l23_n458(x)
+    if (x < 1)
+        fun_l24_n104(x)
+    else
+        fun_l24_n555(x)
+    end
+end
+
+def fun_l23_n459(x)
+    if (x < 1)
+        fun_l24_n259(x)
+    else
+        fun_l24_n196(x)
+    end
+end
+
+def fun_l23_n460(x)
+    if (x < 1)
+        fun_l24_n747(x)
+    else
+        fun_l24_n788(x)
+    end
+end
+
+def fun_l23_n461(x)
+    if (x < 1)
+        fun_l24_n302(x)
+    else
+        fun_l24_n479(x)
+    end
+end
+
+def fun_l23_n462(x)
+    if (x < 1)
+        fun_l24_n292(x)
+    else
+        fun_l24_n235(x)
+    end
+end
+
+def fun_l23_n463(x)
+    if (x < 1)
+        fun_l24_n589(x)
+    else
+        fun_l24_n277(x)
+    end
+end
+
+def fun_l23_n464(x)
+    if (x < 1)
+        fun_l24_n212(x)
+    else
+        fun_l24_n334(x)
+    end
+end
+
+def fun_l23_n465(x)
+    if (x < 1)
+        fun_l24_n878(x)
+    else
+        fun_l24_n111(x)
+    end
+end
+
+def fun_l23_n466(x)
+    if (x < 1)
+        fun_l24_n862(x)
+    else
+        fun_l24_n736(x)
+    end
+end
+
+def fun_l23_n467(x)
+    if (x < 1)
+        fun_l24_n257(x)
+    else
+        fun_l24_n745(x)
+    end
+end
+
+def fun_l23_n468(x)
+    if (x < 1)
+        fun_l24_n922(x)
+    else
+        fun_l24_n453(x)
+    end
+end
+
+def fun_l23_n469(x)
+    if (x < 1)
+        fun_l24_n334(x)
+    else
+        fun_l24_n23(x)
+    end
+end
+
+def fun_l23_n470(x)
+    if (x < 1)
+        fun_l24_n585(x)
+    else
+        fun_l24_n512(x)
+    end
+end
+
+def fun_l23_n471(x)
+    if (x < 1)
+        fun_l24_n135(x)
+    else
+        fun_l24_n244(x)
+    end
+end
+
+def fun_l23_n472(x)
+    if (x < 1)
+        fun_l24_n151(x)
+    else
+        fun_l24_n479(x)
+    end
+end
+
+def fun_l23_n473(x)
+    if (x < 1)
+        fun_l24_n192(x)
+    else
+        fun_l24_n748(x)
+    end
+end
+
+def fun_l23_n474(x)
+    if (x < 1)
+        fun_l24_n729(x)
+    else
+        fun_l24_n283(x)
+    end
+end
+
+def fun_l23_n475(x)
+    if (x < 1)
+        fun_l24_n453(x)
+    else
+        fun_l24_n244(x)
+    end
+end
+
+def fun_l23_n476(x)
+    if (x < 1)
+        fun_l24_n210(x)
+    else
+        fun_l24_n6(x)
+    end
+end
+
+def fun_l23_n477(x)
+    if (x < 1)
+        fun_l24_n387(x)
+    else
+        fun_l24_n857(x)
+    end
+end
+
+def fun_l23_n478(x)
+    if (x < 1)
+        fun_l24_n312(x)
+    else
+        fun_l24_n378(x)
+    end
+end
+
+def fun_l23_n479(x)
+    if (x < 1)
+        fun_l24_n553(x)
+    else
+        fun_l24_n264(x)
+    end
+end
+
+def fun_l23_n480(x)
+    if (x < 1)
+        fun_l24_n903(x)
+    else
+        fun_l24_n374(x)
+    end
+end
+
+def fun_l23_n481(x)
+    if (x < 1)
+        fun_l24_n9(x)
+    else
+        fun_l24_n494(x)
+    end
+end
+
+def fun_l23_n482(x)
+    if (x < 1)
+        fun_l24_n4(x)
+    else
+        fun_l24_n119(x)
+    end
+end
+
+def fun_l23_n483(x)
+    if (x < 1)
+        fun_l24_n969(x)
+    else
+        fun_l24_n716(x)
+    end
+end
+
+def fun_l23_n484(x)
+    if (x < 1)
+        fun_l24_n132(x)
+    else
+        fun_l24_n950(x)
+    end
+end
+
+def fun_l23_n485(x)
+    if (x < 1)
+        fun_l24_n641(x)
+    else
+        fun_l24_n134(x)
+    end
+end
+
+def fun_l23_n486(x)
+    if (x < 1)
+        fun_l24_n499(x)
+    else
+        fun_l24_n506(x)
+    end
+end
+
+def fun_l23_n487(x)
+    if (x < 1)
+        fun_l24_n594(x)
+    else
+        fun_l24_n508(x)
+    end
+end
+
+def fun_l23_n488(x)
+    if (x < 1)
+        fun_l24_n730(x)
+    else
+        fun_l24_n464(x)
+    end
+end
+
+def fun_l23_n489(x)
+    if (x < 1)
+        fun_l24_n564(x)
+    else
+        fun_l24_n716(x)
+    end
+end
+
+def fun_l23_n490(x)
+    if (x < 1)
+        fun_l24_n658(x)
+    else
+        fun_l24_n63(x)
+    end
+end
+
+def fun_l23_n491(x)
+    if (x < 1)
+        fun_l24_n404(x)
+    else
+        fun_l24_n982(x)
+    end
+end
+
+def fun_l23_n492(x)
+    if (x < 1)
+        fun_l24_n182(x)
+    else
+        fun_l24_n97(x)
+    end
+end
+
+def fun_l23_n493(x)
+    if (x < 1)
+        fun_l24_n97(x)
+    else
+        fun_l24_n765(x)
+    end
+end
+
+def fun_l23_n494(x)
+    if (x < 1)
+        fun_l24_n728(x)
+    else
+        fun_l24_n703(x)
+    end
+end
+
+def fun_l23_n495(x)
+    if (x < 1)
+        fun_l24_n327(x)
+    else
+        fun_l24_n484(x)
+    end
+end
+
+def fun_l23_n496(x)
+    if (x < 1)
+        fun_l24_n544(x)
+    else
+        fun_l24_n814(x)
+    end
+end
+
+def fun_l23_n497(x)
+    if (x < 1)
+        fun_l24_n555(x)
+    else
+        fun_l24_n160(x)
+    end
+end
+
+def fun_l23_n498(x)
+    if (x < 1)
+        fun_l24_n336(x)
+    else
+        fun_l24_n544(x)
+    end
+end
+
+def fun_l23_n499(x)
+    if (x < 1)
+        fun_l24_n242(x)
+    else
+        fun_l24_n337(x)
+    end
+end
+
+def fun_l23_n500(x)
+    if (x < 1)
+        fun_l24_n71(x)
+    else
+        fun_l24_n446(x)
+    end
+end
+
+def fun_l23_n501(x)
+    if (x < 1)
+        fun_l24_n726(x)
+    else
+        fun_l24_n127(x)
+    end
+end
+
+def fun_l23_n502(x)
+    if (x < 1)
+        fun_l24_n430(x)
+    else
+        fun_l24_n136(x)
+    end
+end
+
+def fun_l23_n503(x)
+    if (x < 1)
+        fun_l24_n140(x)
+    else
+        fun_l24_n942(x)
+    end
+end
+
+def fun_l23_n504(x)
+    if (x < 1)
+        fun_l24_n135(x)
+    else
+        fun_l24_n701(x)
+    end
+end
+
+def fun_l23_n505(x)
+    if (x < 1)
+        fun_l24_n409(x)
+    else
+        fun_l24_n825(x)
+    end
+end
+
+def fun_l23_n506(x)
+    if (x < 1)
+        fun_l24_n415(x)
+    else
+        fun_l24_n336(x)
+    end
+end
+
+def fun_l23_n507(x)
+    if (x < 1)
+        fun_l24_n118(x)
+    else
+        fun_l24_n904(x)
+    end
+end
+
+def fun_l23_n508(x)
+    if (x < 1)
+        fun_l24_n870(x)
+    else
+        fun_l24_n473(x)
+    end
+end
+
+def fun_l23_n509(x)
+    if (x < 1)
+        fun_l24_n99(x)
+    else
+        fun_l24_n157(x)
+    end
+end
+
+def fun_l23_n510(x)
+    if (x < 1)
+        fun_l24_n484(x)
+    else
+        fun_l24_n933(x)
+    end
+end
+
+def fun_l23_n511(x)
+    if (x < 1)
+        fun_l24_n204(x)
+    else
+        fun_l24_n95(x)
+    end
+end
+
+def fun_l23_n512(x)
+    if (x < 1)
+        fun_l24_n783(x)
+    else
+        fun_l24_n490(x)
+    end
+end
+
+def fun_l23_n513(x)
+    if (x < 1)
+        fun_l24_n642(x)
+    else
+        fun_l24_n622(x)
+    end
+end
+
+def fun_l23_n514(x)
+    if (x < 1)
+        fun_l24_n514(x)
+    else
+        fun_l24_n287(x)
+    end
+end
+
+def fun_l23_n515(x)
+    if (x < 1)
+        fun_l24_n174(x)
+    else
+        fun_l24_n19(x)
+    end
+end
+
+def fun_l23_n516(x)
+    if (x < 1)
+        fun_l24_n840(x)
+    else
+        fun_l24_n710(x)
+    end
+end
+
+def fun_l23_n517(x)
+    if (x < 1)
+        fun_l24_n921(x)
+    else
+        fun_l24_n11(x)
+    end
+end
+
+def fun_l23_n518(x)
+    if (x < 1)
+        fun_l24_n162(x)
+    else
+        fun_l24_n185(x)
+    end
+end
+
+def fun_l23_n519(x)
+    if (x < 1)
+        fun_l24_n654(x)
+    else
+        fun_l24_n514(x)
+    end
+end
+
+def fun_l23_n520(x)
+    if (x < 1)
+        fun_l24_n763(x)
+    else
+        fun_l24_n158(x)
+    end
+end
+
+def fun_l23_n521(x)
+    if (x < 1)
+        fun_l24_n471(x)
+    else
+        fun_l24_n617(x)
+    end
+end
+
+def fun_l23_n522(x)
+    if (x < 1)
+        fun_l24_n146(x)
+    else
+        fun_l24_n6(x)
+    end
+end
+
+def fun_l23_n523(x)
+    if (x < 1)
+        fun_l24_n447(x)
+    else
+        fun_l24_n981(x)
+    end
+end
+
+def fun_l23_n524(x)
+    if (x < 1)
+        fun_l24_n809(x)
+    else
+        fun_l24_n78(x)
+    end
+end
+
+def fun_l23_n525(x)
+    if (x < 1)
+        fun_l24_n554(x)
+    else
+        fun_l24_n50(x)
+    end
+end
+
+def fun_l23_n526(x)
+    if (x < 1)
+        fun_l24_n970(x)
+    else
+        fun_l24_n600(x)
+    end
+end
+
+def fun_l23_n527(x)
+    if (x < 1)
+        fun_l24_n700(x)
+    else
+        fun_l24_n982(x)
+    end
+end
+
+def fun_l23_n528(x)
+    if (x < 1)
+        fun_l24_n947(x)
+    else
+        fun_l24_n886(x)
+    end
+end
+
+def fun_l23_n529(x)
+    if (x < 1)
+        fun_l24_n198(x)
+    else
+        fun_l24_n283(x)
+    end
+end
+
+def fun_l23_n530(x)
+    if (x < 1)
+        fun_l24_n641(x)
+    else
+        fun_l24_n879(x)
+    end
+end
+
+def fun_l23_n531(x)
+    if (x < 1)
+        fun_l24_n393(x)
+    else
+        fun_l24_n451(x)
+    end
+end
+
+def fun_l23_n532(x)
+    if (x < 1)
+        fun_l24_n802(x)
+    else
+        fun_l24_n271(x)
+    end
+end
+
+def fun_l23_n533(x)
+    if (x < 1)
+        fun_l24_n926(x)
+    else
+        fun_l24_n315(x)
+    end
+end
+
+def fun_l23_n534(x)
+    if (x < 1)
+        fun_l24_n544(x)
+    else
+        fun_l24_n358(x)
+    end
+end
+
+def fun_l23_n535(x)
+    if (x < 1)
+        fun_l24_n456(x)
+    else
+        fun_l24_n569(x)
+    end
+end
+
+def fun_l23_n536(x)
+    if (x < 1)
+        fun_l24_n235(x)
+    else
+        fun_l24_n182(x)
+    end
+end
+
+def fun_l23_n537(x)
+    if (x < 1)
+        fun_l24_n159(x)
+    else
+        fun_l24_n674(x)
+    end
+end
+
+def fun_l23_n538(x)
+    if (x < 1)
+        fun_l24_n956(x)
+    else
+        fun_l24_n145(x)
+    end
+end
+
+def fun_l23_n539(x)
+    if (x < 1)
+        fun_l24_n294(x)
+    else
+        fun_l24_n910(x)
+    end
+end
+
+def fun_l23_n540(x)
+    if (x < 1)
+        fun_l24_n434(x)
+    else
+        fun_l24_n336(x)
+    end
+end
+
+def fun_l23_n541(x)
+    if (x < 1)
+        fun_l24_n635(x)
+    else
+        fun_l24_n182(x)
+    end
+end
+
+def fun_l23_n542(x)
+    if (x < 1)
+        fun_l24_n418(x)
+    else
+        fun_l24_n828(x)
+    end
+end
+
+def fun_l23_n543(x)
+    if (x < 1)
+        fun_l24_n337(x)
+    else
+        fun_l24_n740(x)
+    end
+end
+
+def fun_l23_n544(x)
+    if (x < 1)
+        fun_l24_n893(x)
+    else
+        fun_l24_n402(x)
+    end
+end
+
+def fun_l23_n545(x)
+    if (x < 1)
+        fun_l24_n407(x)
+    else
+        fun_l24_n124(x)
+    end
+end
+
+def fun_l23_n546(x)
+    if (x < 1)
+        fun_l24_n170(x)
+    else
+        fun_l24_n64(x)
+    end
+end
+
+def fun_l23_n547(x)
+    if (x < 1)
+        fun_l24_n936(x)
+    else
+        fun_l24_n876(x)
+    end
+end
+
+def fun_l23_n548(x)
+    if (x < 1)
+        fun_l24_n387(x)
+    else
+        fun_l24_n655(x)
+    end
+end
+
+def fun_l23_n549(x)
+    if (x < 1)
+        fun_l24_n162(x)
+    else
+        fun_l24_n210(x)
+    end
+end
+
+def fun_l23_n550(x)
+    if (x < 1)
+        fun_l24_n454(x)
+    else
+        fun_l24_n695(x)
+    end
+end
+
+def fun_l23_n551(x)
+    if (x < 1)
+        fun_l24_n410(x)
+    else
+        fun_l24_n529(x)
+    end
+end
+
+def fun_l23_n552(x)
+    if (x < 1)
+        fun_l24_n726(x)
+    else
+        fun_l24_n450(x)
+    end
+end
+
+def fun_l23_n553(x)
+    if (x < 1)
+        fun_l24_n39(x)
+    else
+        fun_l24_n37(x)
+    end
+end
+
+def fun_l23_n554(x)
+    if (x < 1)
+        fun_l24_n994(x)
+    else
+        fun_l24_n106(x)
+    end
+end
+
+def fun_l23_n555(x)
+    if (x < 1)
+        fun_l24_n929(x)
+    else
+        fun_l24_n766(x)
+    end
+end
+
+def fun_l23_n556(x)
+    if (x < 1)
+        fun_l24_n531(x)
+    else
+        fun_l24_n502(x)
+    end
+end
+
+def fun_l23_n557(x)
+    if (x < 1)
+        fun_l24_n890(x)
+    else
+        fun_l24_n919(x)
+    end
+end
+
+def fun_l23_n558(x)
+    if (x < 1)
+        fun_l24_n803(x)
+    else
+        fun_l24_n460(x)
+    end
+end
+
+def fun_l23_n559(x)
+    if (x < 1)
+        fun_l24_n5(x)
+    else
+        fun_l24_n464(x)
+    end
+end
+
+def fun_l23_n560(x)
+    if (x < 1)
+        fun_l24_n506(x)
+    else
+        fun_l24_n891(x)
+    end
+end
+
+def fun_l23_n561(x)
+    if (x < 1)
+        fun_l24_n98(x)
+    else
+        fun_l24_n534(x)
+    end
+end
+
+def fun_l23_n562(x)
+    if (x < 1)
+        fun_l24_n130(x)
+    else
+        fun_l24_n54(x)
+    end
+end
+
+def fun_l23_n563(x)
+    if (x < 1)
+        fun_l24_n881(x)
+    else
+        fun_l24_n699(x)
+    end
+end
+
+def fun_l23_n564(x)
+    if (x < 1)
+        fun_l24_n192(x)
+    else
+        fun_l24_n112(x)
+    end
+end
+
+def fun_l23_n565(x)
+    if (x < 1)
+        fun_l24_n249(x)
+    else
+        fun_l24_n796(x)
+    end
+end
+
+def fun_l23_n566(x)
+    if (x < 1)
+        fun_l24_n113(x)
+    else
+        fun_l24_n599(x)
+    end
+end
+
+def fun_l23_n567(x)
+    if (x < 1)
+        fun_l24_n334(x)
+    else
+        fun_l24_n80(x)
+    end
+end
+
+def fun_l23_n568(x)
+    if (x < 1)
+        fun_l24_n347(x)
+    else
+        fun_l24_n726(x)
+    end
+end
+
+def fun_l23_n569(x)
+    if (x < 1)
+        fun_l24_n60(x)
+    else
+        fun_l24_n249(x)
+    end
+end
+
+def fun_l23_n570(x)
+    if (x < 1)
+        fun_l24_n400(x)
+    else
+        fun_l24_n773(x)
+    end
+end
+
+def fun_l23_n571(x)
+    if (x < 1)
+        fun_l24_n172(x)
+    else
+        fun_l24_n787(x)
+    end
+end
+
+def fun_l23_n572(x)
+    if (x < 1)
+        fun_l24_n973(x)
+    else
+        fun_l24_n875(x)
+    end
+end
+
+def fun_l23_n573(x)
+    if (x < 1)
+        fun_l24_n290(x)
+    else
+        fun_l24_n225(x)
+    end
+end
+
+def fun_l23_n574(x)
+    if (x < 1)
+        fun_l24_n383(x)
+    else
+        fun_l24_n714(x)
+    end
+end
+
+def fun_l23_n575(x)
+    if (x < 1)
+        fun_l24_n32(x)
+    else
+        fun_l24_n508(x)
+    end
+end
+
+def fun_l23_n576(x)
+    if (x < 1)
+        fun_l24_n74(x)
+    else
+        fun_l24_n368(x)
+    end
+end
+
+def fun_l23_n577(x)
+    if (x < 1)
+        fun_l24_n431(x)
+    else
+        fun_l24_n2(x)
+    end
+end
+
+def fun_l23_n578(x)
+    if (x < 1)
+        fun_l24_n758(x)
+    else
+        fun_l24_n178(x)
+    end
+end
+
+def fun_l23_n579(x)
+    if (x < 1)
+        fun_l24_n130(x)
+    else
+        fun_l24_n512(x)
+    end
+end
+
+def fun_l23_n580(x)
+    if (x < 1)
+        fun_l24_n790(x)
+    else
+        fun_l24_n280(x)
+    end
+end
+
+def fun_l23_n581(x)
+    if (x < 1)
+        fun_l24_n76(x)
+    else
+        fun_l24_n596(x)
+    end
+end
+
+def fun_l23_n582(x)
+    if (x < 1)
+        fun_l24_n643(x)
+    else
+        fun_l24_n506(x)
+    end
+end
+
+def fun_l23_n583(x)
+    if (x < 1)
+        fun_l24_n392(x)
+    else
+        fun_l24_n671(x)
+    end
+end
+
+def fun_l23_n584(x)
+    if (x < 1)
+        fun_l24_n722(x)
+    else
+        fun_l24_n390(x)
+    end
+end
+
+def fun_l23_n585(x)
+    if (x < 1)
+        fun_l24_n613(x)
+    else
+        fun_l24_n461(x)
+    end
+end
+
+def fun_l23_n586(x)
+    if (x < 1)
+        fun_l24_n784(x)
+    else
+        fun_l24_n426(x)
+    end
+end
+
+def fun_l23_n587(x)
+    if (x < 1)
+        fun_l24_n351(x)
+    else
+        fun_l24_n68(x)
+    end
+end
+
+def fun_l23_n588(x)
+    if (x < 1)
+        fun_l24_n8(x)
+    else
+        fun_l24_n9(x)
+    end
+end
+
+def fun_l23_n589(x)
+    if (x < 1)
+        fun_l24_n984(x)
+    else
+        fun_l24_n704(x)
+    end
+end
+
+def fun_l23_n590(x)
+    if (x < 1)
+        fun_l24_n150(x)
+    else
+        fun_l24_n36(x)
+    end
+end
+
+def fun_l23_n591(x)
+    if (x < 1)
+        fun_l24_n232(x)
+    else
+        fun_l24_n293(x)
+    end
+end
+
+def fun_l23_n592(x)
+    if (x < 1)
+        fun_l24_n763(x)
+    else
+        fun_l24_n444(x)
+    end
+end
+
+def fun_l23_n593(x)
+    if (x < 1)
+        fun_l24_n246(x)
+    else
+        fun_l24_n101(x)
+    end
+end
+
+def fun_l23_n594(x)
+    if (x < 1)
+        fun_l24_n145(x)
+    else
+        fun_l24_n626(x)
+    end
+end
+
+def fun_l23_n595(x)
+    if (x < 1)
+        fun_l24_n835(x)
+    else
+        fun_l24_n827(x)
+    end
+end
+
+def fun_l23_n596(x)
+    if (x < 1)
+        fun_l24_n925(x)
+    else
+        fun_l24_n875(x)
+    end
+end
+
+def fun_l23_n597(x)
+    if (x < 1)
+        fun_l24_n600(x)
+    else
+        fun_l24_n817(x)
+    end
+end
+
+def fun_l23_n598(x)
+    if (x < 1)
+        fun_l24_n653(x)
+    else
+        fun_l24_n632(x)
+    end
+end
+
+def fun_l23_n599(x)
+    if (x < 1)
+        fun_l24_n103(x)
+    else
+        fun_l24_n675(x)
+    end
+end
+
+def fun_l23_n600(x)
+    if (x < 1)
+        fun_l24_n1(x)
+    else
+        fun_l24_n899(x)
+    end
+end
+
+def fun_l23_n601(x)
+    if (x < 1)
+        fun_l24_n357(x)
+    else
+        fun_l24_n88(x)
+    end
+end
+
+def fun_l23_n602(x)
+    if (x < 1)
+        fun_l24_n213(x)
+    else
+        fun_l24_n71(x)
+    end
+end
+
+def fun_l23_n603(x)
+    if (x < 1)
+        fun_l24_n299(x)
+    else
+        fun_l24_n283(x)
+    end
+end
+
+def fun_l23_n604(x)
+    if (x < 1)
+        fun_l24_n647(x)
+    else
+        fun_l24_n891(x)
+    end
+end
+
+def fun_l23_n605(x)
+    if (x < 1)
+        fun_l24_n86(x)
+    else
+        fun_l24_n581(x)
+    end
+end
+
+def fun_l23_n606(x)
+    if (x < 1)
+        fun_l24_n749(x)
+    else
+        fun_l24_n780(x)
+    end
+end
+
+def fun_l23_n607(x)
+    if (x < 1)
+        fun_l24_n537(x)
+    else
+        fun_l24_n22(x)
+    end
+end
+
+def fun_l23_n608(x)
+    if (x < 1)
+        fun_l24_n535(x)
+    else
+        fun_l24_n379(x)
+    end
+end
+
+def fun_l23_n609(x)
+    if (x < 1)
+        fun_l24_n860(x)
+    else
+        fun_l24_n220(x)
+    end
+end
+
+def fun_l23_n610(x)
+    if (x < 1)
+        fun_l24_n366(x)
+    else
+        fun_l24_n216(x)
+    end
+end
+
+def fun_l23_n611(x)
+    if (x < 1)
+        fun_l24_n79(x)
+    else
+        fun_l24_n506(x)
+    end
+end
+
+def fun_l23_n612(x)
+    if (x < 1)
+        fun_l24_n600(x)
+    else
+        fun_l24_n367(x)
+    end
+end
+
+def fun_l23_n613(x)
+    if (x < 1)
+        fun_l24_n764(x)
+    else
+        fun_l24_n167(x)
+    end
+end
+
+def fun_l23_n614(x)
+    if (x < 1)
+        fun_l24_n113(x)
+    else
+        fun_l24_n398(x)
+    end
+end
+
+def fun_l23_n615(x)
+    if (x < 1)
+        fun_l24_n292(x)
+    else
+        fun_l24_n1(x)
+    end
+end
+
+def fun_l23_n616(x)
+    if (x < 1)
+        fun_l24_n523(x)
+    else
+        fun_l24_n344(x)
+    end
+end
+
+def fun_l23_n617(x)
+    if (x < 1)
+        fun_l24_n60(x)
+    else
+        fun_l24_n618(x)
+    end
+end
+
+def fun_l23_n618(x)
+    if (x < 1)
+        fun_l24_n252(x)
+    else
+        fun_l24_n718(x)
+    end
+end
+
+def fun_l23_n619(x)
+    if (x < 1)
+        fun_l24_n962(x)
+    else
+        fun_l24_n69(x)
+    end
+end
+
+def fun_l23_n620(x)
+    if (x < 1)
+        fun_l24_n10(x)
+    else
+        fun_l24_n87(x)
+    end
+end
+
+def fun_l23_n621(x)
+    if (x < 1)
+        fun_l24_n128(x)
+    else
+        fun_l24_n958(x)
+    end
+end
+
+def fun_l23_n622(x)
+    if (x < 1)
+        fun_l24_n775(x)
+    else
+        fun_l24_n205(x)
+    end
+end
+
+def fun_l23_n623(x)
+    if (x < 1)
+        fun_l24_n121(x)
+    else
+        fun_l24_n69(x)
+    end
+end
+
+def fun_l23_n624(x)
+    if (x < 1)
+        fun_l24_n768(x)
+    else
+        fun_l24_n439(x)
+    end
+end
+
+def fun_l23_n625(x)
+    if (x < 1)
+        fun_l24_n332(x)
+    else
+        fun_l24_n73(x)
+    end
+end
+
+def fun_l23_n626(x)
+    if (x < 1)
+        fun_l24_n735(x)
+    else
+        fun_l24_n651(x)
+    end
+end
+
+def fun_l23_n627(x)
+    if (x < 1)
+        fun_l24_n661(x)
+    else
+        fun_l24_n827(x)
+    end
+end
+
+def fun_l23_n628(x)
+    if (x < 1)
+        fun_l24_n607(x)
+    else
+        fun_l24_n343(x)
+    end
+end
+
+def fun_l23_n629(x)
+    if (x < 1)
+        fun_l24_n868(x)
+    else
+        fun_l24_n633(x)
+    end
+end
+
+def fun_l23_n630(x)
+    if (x < 1)
+        fun_l24_n321(x)
+    else
+        fun_l24_n44(x)
+    end
+end
+
+def fun_l23_n631(x)
+    if (x < 1)
+        fun_l24_n840(x)
+    else
+        fun_l24_n265(x)
+    end
+end
+
+def fun_l23_n632(x)
+    if (x < 1)
+        fun_l24_n710(x)
+    else
+        fun_l24_n343(x)
+    end
+end
+
+def fun_l23_n633(x)
+    if (x < 1)
+        fun_l24_n640(x)
+    else
+        fun_l24_n112(x)
+    end
+end
+
+def fun_l23_n634(x)
+    if (x < 1)
+        fun_l24_n237(x)
+    else
+        fun_l24_n83(x)
+    end
+end
+
+def fun_l23_n635(x)
+    if (x < 1)
+        fun_l24_n235(x)
+    else
+        fun_l24_n970(x)
+    end
+end
+
+def fun_l23_n636(x)
+    if (x < 1)
+        fun_l24_n576(x)
+    else
+        fun_l24_n891(x)
+    end
+end
+
+def fun_l23_n637(x)
+    if (x < 1)
+        fun_l24_n489(x)
+    else
+        fun_l24_n136(x)
+    end
+end
+
+def fun_l23_n638(x)
+    if (x < 1)
+        fun_l24_n532(x)
+    else
+        fun_l24_n150(x)
+    end
+end
+
+def fun_l23_n639(x)
+    if (x < 1)
+        fun_l24_n496(x)
+    else
+        fun_l24_n57(x)
+    end
+end
+
+def fun_l23_n640(x)
+    if (x < 1)
+        fun_l24_n857(x)
+    else
+        fun_l24_n564(x)
+    end
+end
+
+def fun_l23_n641(x)
+    if (x < 1)
+        fun_l24_n203(x)
+    else
+        fun_l24_n730(x)
+    end
+end
+
+def fun_l23_n642(x)
+    if (x < 1)
+        fun_l24_n38(x)
+    else
+        fun_l24_n388(x)
+    end
+end
+
+def fun_l23_n643(x)
+    if (x < 1)
+        fun_l24_n650(x)
+    else
+        fun_l24_n672(x)
+    end
+end
+
+def fun_l23_n644(x)
+    if (x < 1)
+        fun_l24_n842(x)
+    else
+        fun_l24_n473(x)
+    end
+end
+
+def fun_l23_n645(x)
+    if (x < 1)
+        fun_l24_n650(x)
+    else
+        fun_l24_n36(x)
+    end
+end
+
+def fun_l23_n646(x)
+    if (x < 1)
+        fun_l24_n25(x)
+    else
+        fun_l24_n696(x)
+    end
+end
+
+def fun_l23_n647(x)
+    if (x < 1)
+        fun_l24_n24(x)
+    else
+        fun_l24_n414(x)
+    end
+end
+
+def fun_l23_n648(x)
+    if (x < 1)
+        fun_l24_n778(x)
+    else
+        fun_l24_n794(x)
+    end
+end
+
+def fun_l23_n649(x)
+    if (x < 1)
+        fun_l24_n132(x)
+    else
+        fun_l24_n833(x)
+    end
+end
+
+def fun_l23_n650(x)
+    if (x < 1)
+        fun_l24_n718(x)
+    else
+        fun_l24_n327(x)
+    end
+end
+
+def fun_l23_n651(x)
+    if (x < 1)
+        fun_l24_n969(x)
+    else
+        fun_l24_n865(x)
+    end
+end
+
+def fun_l23_n652(x)
+    if (x < 1)
+        fun_l24_n904(x)
+    else
+        fun_l24_n4(x)
+    end
+end
+
+def fun_l23_n653(x)
+    if (x < 1)
+        fun_l24_n342(x)
+    else
+        fun_l24_n953(x)
+    end
+end
+
+def fun_l23_n654(x)
+    if (x < 1)
+        fun_l24_n393(x)
+    else
+        fun_l24_n175(x)
+    end
+end
+
+def fun_l23_n655(x)
+    if (x < 1)
+        fun_l24_n241(x)
+    else
+        fun_l24_n835(x)
+    end
+end
+
+def fun_l23_n656(x)
+    if (x < 1)
+        fun_l24_n326(x)
+    else
+        fun_l24_n294(x)
+    end
+end
+
+def fun_l23_n657(x)
+    if (x < 1)
+        fun_l24_n8(x)
+    else
+        fun_l24_n327(x)
+    end
+end
+
+def fun_l23_n658(x)
+    if (x < 1)
+        fun_l24_n859(x)
+    else
+        fun_l24_n138(x)
+    end
+end
+
+def fun_l23_n659(x)
+    if (x < 1)
+        fun_l24_n389(x)
+    else
+        fun_l24_n840(x)
+    end
+end
+
+def fun_l23_n660(x)
+    if (x < 1)
+        fun_l24_n171(x)
+    else
+        fun_l24_n731(x)
+    end
+end
+
+def fun_l23_n661(x)
+    if (x < 1)
+        fun_l24_n284(x)
+    else
+        fun_l24_n358(x)
+    end
+end
+
+def fun_l23_n662(x)
+    if (x < 1)
+        fun_l24_n329(x)
+    else
+        fun_l24_n459(x)
+    end
+end
+
+def fun_l23_n663(x)
+    if (x < 1)
+        fun_l24_n6(x)
+    else
+        fun_l24_n29(x)
+    end
+end
+
+def fun_l23_n664(x)
+    if (x < 1)
+        fun_l24_n324(x)
+    else
+        fun_l24_n58(x)
+    end
+end
+
+def fun_l23_n665(x)
+    if (x < 1)
+        fun_l24_n473(x)
+    else
+        fun_l24_n932(x)
+    end
+end
+
+def fun_l23_n666(x)
+    if (x < 1)
+        fun_l24_n425(x)
+    else
+        fun_l24_n49(x)
+    end
+end
+
+def fun_l23_n667(x)
+    if (x < 1)
+        fun_l24_n122(x)
+    else
+        fun_l24_n515(x)
+    end
+end
+
+def fun_l23_n668(x)
+    if (x < 1)
+        fun_l24_n883(x)
+    else
+        fun_l24_n383(x)
+    end
+end
+
+def fun_l23_n669(x)
+    if (x < 1)
+        fun_l24_n316(x)
+    else
+        fun_l24_n456(x)
+    end
+end
+
+def fun_l23_n670(x)
+    if (x < 1)
+        fun_l24_n812(x)
+    else
+        fun_l24_n625(x)
+    end
+end
+
+def fun_l23_n671(x)
+    if (x < 1)
+        fun_l24_n431(x)
+    else
+        fun_l24_n685(x)
+    end
+end
+
+def fun_l23_n672(x)
+    if (x < 1)
+        fun_l24_n68(x)
+    else
+        fun_l24_n112(x)
+    end
+end
+
+def fun_l23_n673(x)
+    if (x < 1)
+        fun_l24_n137(x)
+    else
+        fun_l24_n349(x)
+    end
+end
+
+def fun_l23_n674(x)
+    if (x < 1)
+        fun_l24_n629(x)
+    else
+        fun_l24_n165(x)
+    end
+end
+
+def fun_l23_n675(x)
+    if (x < 1)
+        fun_l24_n484(x)
+    else
+        fun_l24_n102(x)
+    end
+end
+
+def fun_l23_n676(x)
+    if (x < 1)
+        fun_l24_n641(x)
+    else
+        fun_l24_n912(x)
+    end
+end
+
+def fun_l23_n677(x)
+    if (x < 1)
+        fun_l24_n817(x)
+    else
+        fun_l24_n975(x)
+    end
+end
+
+def fun_l23_n678(x)
+    if (x < 1)
+        fun_l24_n510(x)
+    else
+        fun_l24_n346(x)
+    end
+end
+
+def fun_l23_n679(x)
+    if (x < 1)
+        fun_l24_n129(x)
+    else
+        fun_l24_n602(x)
+    end
+end
+
+def fun_l23_n680(x)
+    if (x < 1)
+        fun_l24_n991(x)
+    else
+        fun_l24_n406(x)
+    end
+end
+
+def fun_l23_n681(x)
+    if (x < 1)
+        fun_l24_n433(x)
+    else
+        fun_l24_n998(x)
+    end
+end
+
+def fun_l23_n682(x)
+    if (x < 1)
+        fun_l24_n645(x)
+    else
+        fun_l24_n275(x)
+    end
+end
+
+def fun_l23_n683(x)
+    if (x < 1)
+        fun_l24_n832(x)
+    else
+        fun_l24_n346(x)
+    end
+end
+
+def fun_l23_n684(x)
+    if (x < 1)
+        fun_l24_n769(x)
+    else
+        fun_l24_n927(x)
+    end
+end
+
+def fun_l23_n685(x)
+    if (x < 1)
+        fun_l24_n389(x)
+    else
+        fun_l24_n777(x)
+    end
+end
+
+def fun_l23_n686(x)
+    if (x < 1)
+        fun_l24_n658(x)
+    else
+        fun_l24_n184(x)
+    end
+end
+
+def fun_l23_n687(x)
+    if (x < 1)
+        fun_l24_n134(x)
+    else
+        fun_l24_n517(x)
+    end
+end
+
+def fun_l23_n688(x)
+    if (x < 1)
+        fun_l24_n49(x)
+    else
+        fun_l24_n392(x)
+    end
+end
+
+def fun_l23_n689(x)
+    if (x < 1)
+        fun_l24_n23(x)
+    else
+        fun_l24_n402(x)
+    end
+end
+
+def fun_l23_n690(x)
+    if (x < 1)
+        fun_l24_n719(x)
+    else
+        fun_l24_n529(x)
+    end
+end
+
+def fun_l23_n691(x)
+    if (x < 1)
+        fun_l24_n543(x)
+    else
+        fun_l24_n789(x)
+    end
+end
+
+def fun_l23_n692(x)
+    if (x < 1)
+        fun_l24_n850(x)
+    else
+        fun_l24_n50(x)
+    end
+end
+
+def fun_l23_n693(x)
+    if (x < 1)
+        fun_l24_n728(x)
+    else
+        fun_l24_n730(x)
+    end
+end
+
+def fun_l23_n694(x)
+    if (x < 1)
+        fun_l24_n810(x)
+    else
+        fun_l24_n999(x)
+    end
+end
+
+def fun_l23_n695(x)
+    if (x < 1)
+        fun_l24_n856(x)
+    else
+        fun_l24_n404(x)
+    end
+end
+
+def fun_l23_n696(x)
+    if (x < 1)
+        fun_l24_n405(x)
+    else
+        fun_l24_n275(x)
+    end
+end
+
+def fun_l23_n697(x)
+    if (x < 1)
+        fun_l24_n446(x)
+    else
+        fun_l24_n773(x)
+    end
+end
+
+def fun_l23_n698(x)
+    if (x < 1)
+        fun_l24_n509(x)
+    else
+        fun_l24_n146(x)
+    end
+end
+
+def fun_l23_n699(x)
+    if (x < 1)
+        fun_l24_n770(x)
+    else
+        fun_l24_n275(x)
+    end
+end
+
+def fun_l23_n700(x)
+    if (x < 1)
+        fun_l24_n222(x)
+    else
+        fun_l24_n60(x)
+    end
+end
+
+def fun_l23_n701(x)
+    if (x < 1)
+        fun_l24_n380(x)
+    else
+        fun_l24_n654(x)
+    end
+end
+
+def fun_l23_n702(x)
+    if (x < 1)
+        fun_l24_n417(x)
+    else
+        fun_l24_n221(x)
+    end
+end
+
+def fun_l23_n703(x)
+    if (x < 1)
+        fun_l24_n283(x)
+    else
+        fun_l24_n171(x)
+    end
+end
+
+def fun_l23_n704(x)
+    if (x < 1)
+        fun_l24_n822(x)
+    else
+        fun_l24_n72(x)
+    end
+end
+
+def fun_l23_n705(x)
+    if (x < 1)
+        fun_l24_n171(x)
+    else
+        fun_l24_n258(x)
+    end
+end
+
+def fun_l23_n706(x)
+    if (x < 1)
+        fun_l24_n147(x)
+    else
+        fun_l24_n518(x)
+    end
+end
+
+def fun_l23_n707(x)
+    if (x < 1)
+        fun_l24_n479(x)
+    else
+        fun_l24_n267(x)
+    end
+end
+
+def fun_l23_n708(x)
+    if (x < 1)
+        fun_l24_n424(x)
+    else
+        fun_l24_n517(x)
+    end
+end
+
+def fun_l23_n709(x)
+    if (x < 1)
+        fun_l24_n816(x)
+    else
+        fun_l24_n329(x)
+    end
+end
+
+def fun_l23_n710(x)
+    if (x < 1)
+        fun_l24_n870(x)
+    else
+        fun_l24_n185(x)
+    end
+end
+
+def fun_l23_n711(x)
+    if (x < 1)
+        fun_l24_n726(x)
+    else
+        fun_l24_n950(x)
+    end
+end
+
+def fun_l23_n712(x)
+    if (x < 1)
+        fun_l24_n473(x)
+    else
+        fun_l24_n179(x)
+    end
+end
+
+def fun_l23_n713(x)
+    if (x < 1)
+        fun_l24_n345(x)
+    else
+        fun_l24_n872(x)
+    end
+end
+
+def fun_l23_n714(x)
+    if (x < 1)
+        fun_l24_n757(x)
+    else
+        fun_l24_n364(x)
+    end
+end
+
+def fun_l23_n715(x)
+    if (x < 1)
+        fun_l24_n91(x)
+    else
+        fun_l24_n999(x)
+    end
+end
+
+def fun_l23_n716(x)
+    if (x < 1)
+        fun_l24_n308(x)
+    else
+        fun_l24_n281(x)
+    end
+end
+
+def fun_l23_n717(x)
+    if (x < 1)
+        fun_l24_n855(x)
+    else
+        fun_l24_n175(x)
+    end
+end
+
+def fun_l23_n718(x)
+    if (x < 1)
+        fun_l24_n251(x)
+    else
+        fun_l24_n532(x)
+    end
+end
+
+def fun_l23_n719(x)
+    if (x < 1)
+        fun_l24_n261(x)
+    else
+        fun_l24_n755(x)
+    end
+end
+
+def fun_l23_n720(x)
+    if (x < 1)
+        fun_l24_n182(x)
+    else
+        fun_l24_n115(x)
+    end
+end
+
+def fun_l23_n721(x)
+    if (x < 1)
+        fun_l24_n648(x)
+    else
+        fun_l24_n728(x)
+    end
+end
+
+def fun_l23_n722(x)
+    if (x < 1)
+        fun_l24_n552(x)
+    else
+        fun_l24_n549(x)
+    end
+end
+
+def fun_l23_n723(x)
+    if (x < 1)
+        fun_l24_n24(x)
+    else
+        fun_l24_n794(x)
+    end
+end
+
+def fun_l23_n724(x)
+    if (x < 1)
+        fun_l24_n242(x)
+    else
+        fun_l24_n980(x)
+    end
+end
+
+def fun_l23_n725(x)
+    if (x < 1)
+        fun_l24_n931(x)
+    else
+        fun_l24_n711(x)
+    end
+end
+
+def fun_l23_n726(x)
+    if (x < 1)
+        fun_l24_n659(x)
+    else
+        fun_l24_n981(x)
+    end
+end
+
+def fun_l23_n727(x)
+    if (x < 1)
+        fun_l24_n258(x)
+    else
+        fun_l24_n915(x)
+    end
+end
+
+def fun_l23_n728(x)
+    if (x < 1)
+        fun_l24_n544(x)
+    else
+        fun_l24_n89(x)
+    end
+end
+
+def fun_l23_n729(x)
+    if (x < 1)
+        fun_l24_n497(x)
+    else
+        fun_l24_n320(x)
+    end
+end
+
+def fun_l23_n730(x)
+    if (x < 1)
+        fun_l24_n936(x)
+    else
+        fun_l24_n209(x)
+    end
+end
+
+def fun_l23_n731(x)
+    if (x < 1)
+        fun_l24_n763(x)
+    else
+        fun_l24_n836(x)
+    end
+end
+
+def fun_l23_n732(x)
+    if (x < 1)
+        fun_l24_n60(x)
+    else
+        fun_l24_n867(x)
+    end
+end
+
+def fun_l23_n733(x)
+    if (x < 1)
+        fun_l24_n146(x)
+    else
+        fun_l24_n294(x)
+    end
+end
+
+def fun_l23_n734(x)
+    if (x < 1)
+        fun_l24_n905(x)
+    else
+        fun_l24_n463(x)
+    end
+end
+
+def fun_l23_n735(x)
+    if (x < 1)
+        fun_l24_n566(x)
+    else
+        fun_l24_n240(x)
+    end
+end
+
+def fun_l23_n736(x)
+    if (x < 1)
+        fun_l24_n321(x)
+    else
+        fun_l24_n597(x)
+    end
+end
+
+def fun_l23_n737(x)
+    if (x < 1)
+        fun_l24_n169(x)
+    else
+        fun_l24_n201(x)
+    end
+end
+
+def fun_l23_n738(x)
+    if (x < 1)
+        fun_l24_n157(x)
+    else
+        fun_l24_n349(x)
+    end
+end
+
+def fun_l23_n739(x)
+    if (x < 1)
+        fun_l24_n503(x)
+    else
+        fun_l24_n342(x)
+    end
+end
+
+def fun_l23_n740(x)
+    if (x < 1)
+        fun_l24_n974(x)
+    else
+        fun_l24_n467(x)
+    end
+end
+
+def fun_l23_n741(x)
+    if (x < 1)
+        fun_l24_n566(x)
+    else
+        fun_l24_n162(x)
+    end
+end
+
+def fun_l23_n742(x)
+    if (x < 1)
+        fun_l24_n19(x)
+    else
+        fun_l24_n750(x)
+    end
+end
+
+def fun_l23_n743(x)
+    if (x < 1)
+        fun_l24_n409(x)
+    else
+        fun_l24_n362(x)
+    end
+end
+
+def fun_l23_n744(x)
+    if (x < 1)
+        fun_l24_n281(x)
+    else
+        fun_l24_n439(x)
+    end
+end
+
+def fun_l23_n745(x)
+    if (x < 1)
+        fun_l24_n808(x)
+    else
+        fun_l24_n794(x)
+    end
+end
+
+def fun_l23_n746(x)
+    if (x < 1)
+        fun_l24_n173(x)
+    else
+        fun_l24_n892(x)
+    end
+end
+
+def fun_l23_n747(x)
+    if (x < 1)
+        fun_l24_n762(x)
+    else
+        fun_l24_n339(x)
+    end
+end
+
+def fun_l23_n748(x)
+    if (x < 1)
+        fun_l24_n319(x)
+    else
+        fun_l24_n753(x)
+    end
+end
+
+def fun_l23_n749(x)
+    if (x < 1)
+        fun_l24_n546(x)
+    else
+        fun_l24_n727(x)
+    end
+end
+
+def fun_l23_n750(x)
+    if (x < 1)
+        fun_l24_n699(x)
+    else
+        fun_l24_n173(x)
+    end
+end
+
+def fun_l23_n751(x)
+    if (x < 1)
+        fun_l24_n280(x)
+    else
+        fun_l24_n468(x)
+    end
+end
+
+def fun_l23_n752(x)
+    if (x < 1)
+        fun_l24_n910(x)
+    else
+        fun_l24_n500(x)
+    end
+end
+
+def fun_l23_n753(x)
+    if (x < 1)
+        fun_l24_n463(x)
+    else
+        fun_l24_n81(x)
+    end
+end
+
+def fun_l23_n754(x)
+    if (x < 1)
+        fun_l24_n769(x)
+    else
+        fun_l24_n584(x)
+    end
+end
+
+def fun_l23_n755(x)
+    if (x < 1)
+        fun_l24_n702(x)
+    else
+        fun_l24_n337(x)
+    end
+end
+
+def fun_l23_n756(x)
+    if (x < 1)
+        fun_l24_n12(x)
+    else
+        fun_l24_n335(x)
+    end
+end
+
+def fun_l23_n757(x)
+    if (x < 1)
+        fun_l24_n100(x)
+    else
+        fun_l24_n743(x)
+    end
+end
+
+def fun_l23_n758(x)
+    if (x < 1)
+        fun_l24_n865(x)
+    else
+        fun_l24_n594(x)
+    end
+end
+
+def fun_l23_n759(x)
+    if (x < 1)
+        fun_l24_n948(x)
+    else
+        fun_l24_n32(x)
+    end
+end
+
+def fun_l23_n760(x)
+    if (x < 1)
+        fun_l24_n487(x)
+    else
+        fun_l24_n72(x)
+    end
+end
+
+def fun_l23_n761(x)
+    if (x < 1)
+        fun_l24_n566(x)
+    else
+        fun_l24_n290(x)
+    end
+end
+
+def fun_l23_n762(x)
+    if (x < 1)
+        fun_l24_n896(x)
+    else
+        fun_l24_n840(x)
+    end
+end
+
+def fun_l23_n763(x)
+    if (x < 1)
+        fun_l24_n175(x)
+    else
+        fun_l24_n50(x)
+    end
+end
+
+def fun_l23_n764(x)
+    if (x < 1)
+        fun_l24_n107(x)
+    else
+        fun_l24_n446(x)
+    end
+end
+
+def fun_l23_n765(x)
+    if (x < 1)
+        fun_l24_n238(x)
+    else
+        fun_l24_n944(x)
+    end
+end
+
+def fun_l23_n766(x)
+    if (x < 1)
+        fun_l24_n999(x)
+    else
+        fun_l24_n419(x)
+    end
+end
+
+def fun_l23_n767(x)
+    if (x < 1)
+        fun_l24_n476(x)
+    else
+        fun_l24_n976(x)
+    end
+end
+
+def fun_l23_n768(x)
+    if (x < 1)
+        fun_l24_n328(x)
+    else
+        fun_l24_n782(x)
+    end
+end
+
+def fun_l23_n769(x)
+    if (x < 1)
+        fun_l24_n875(x)
+    else
+        fun_l24_n847(x)
+    end
+end
+
+def fun_l23_n770(x)
+    if (x < 1)
+        fun_l24_n391(x)
+    else
+        fun_l24_n123(x)
+    end
+end
+
+def fun_l23_n771(x)
+    if (x < 1)
+        fun_l24_n968(x)
+    else
+        fun_l24_n915(x)
+    end
+end
+
+def fun_l23_n772(x)
+    if (x < 1)
+        fun_l24_n883(x)
+    else
+        fun_l24_n604(x)
+    end
+end
+
+def fun_l23_n773(x)
+    if (x < 1)
+        fun_l24_n307(x)
+    else
+        fun_l24_n70(x)
+    end
+end
+
+def fun_l23_n774(x)
+    if (x < 1)
+        fun_l24_n615(x)
+    else
+        fun_l24_n115(x)
+    end
+end
+
+def fun_l23_n775(x)
+    if (x < 1)
+        fun_l24_n250(x)
+    else
+        fun_l24_n178(x)
+    end
+end
+
+def fun_l23_n776(x)
+    if (x < 1)
+        fun_l24_n982(x)
+    else
+        fun_l24_n570(x)
+    end
+end
+
+def fun_l23_n777(x)
+    if (x < 1)
+        fun_l24_n317(x)
+    else
+        fun_l24_n170(x)
+    end
+end
+
+def fun_l23_n778(x)
+    if (x < 1)
+        fun_l24_n895(x)
+    else
+        fun_l24_n147(x)
+    end
+end
+
+def fun_l23_n779(x)
+    if (x < 1)
+        fun_l24_n393(x)
+    else
+        fun_l24_n513(x)
+    end
+end
+
+def fun_l23_n780(x)
+    if (x < 1)
+        fun_l24_n635(x)
+    else
+        fun_l24_n161(x)
+    end
+end
+
+def fun_l23_n781(x)
+    if (x < 1)
+        fun_l24_n189(x)
+    else
+        fun_l24_n225(x)
+    end
+end
+
+def fun_l23_n782(x)
+    if (x < 1)
+        fun_l24_n205(x)
+    else
+        fun_l24_n620(x)
+    end
+end
+
+def fun_l23_n783(x)
+    if (x < 1)
+        fun_l24_n203(x)
+    else
+        fun_l24_n58(x)
+    end
+end
+
+def fun_l23_n784(x)
+    if (x < 1)
+        fun_l24_n198(x)
+    else
+        fun_l24_n948(x)
+    end
+end
+
+def fun_l23_n785(x)
+    if (x < 1)
+        fun_l24_n60(x)
+    else
+        fun_l24_n406(x)
+    end
+end
+
+def fun_l23_n786(x)
+    if (x < 1)
+        fun_l24_n538(x)
+    else
+        fun_l24_n992(x)
+    end
+end
+
+def fun_l23_n787(x)
+    if (x < 1)
+        fun_l24_n83(x)
+    else
+        fun_l24_n544(x)
+    end
+end
+
+def fun_l23_n788(x)
+    if (x < 1)
+        fun_l24_n964(x)
+    else
+        fun_l24_n939(x)
+    end
+end
+
+def fun_l23_n789(x)
+    if (x < 1)
+        fun_l24_n120(x)
+    else
+        fun_l24_n843(x)
+    end
+end
+
+def fun_l23_n790(x)
+    if (x < 1)
+        fun_l24_n772(x)
+    else
+        fun_l24_n111(x)
+    end
+end
+
+def fun_l23_n791(x)
+    if (x < 1)
+        fun_l24_n983(x)
+    else
+        fun_l24_n934(x)
+    end
+end
+
+def fun_l23_n792(x)
+    if (x < 1)
+        fun_l24_n475(x)
+    else
+        fun_l24_n532(x)
+    end
+end
+
+def fun_l23_n793(x)
+    if (x < 1)
+        fun_l24_n316(x)
+    else
+        fun_l24_n400(x)
+    end
+end
+
+def fun_l23_n794(x)
+    if (x < 1)
+        fun_l24_n103(x)
+    else
+        fun_l24_n19(x)
+    end
+end
+
+def fun_l23_n795(x)
+    if (x < 1)
+        fun_l24_n371(x)
+    else
+        fun_l24_n176(x)
+    end
+end
+
+def fun_l23_n796(x)
+    if (x < 1)
+        fun_l24_n469(x)
+    else
+        fun_l24_n958(x)
+    end
+end
+
+def fun_l23_n797(x)
+    if (x < 1)
+        fun_l24_n706(x)
+    else
+        fun_l24_n953(x)
+    end
+end
+
+def fun_l23_n798(x)
+    if (x < 1)
+        fun_l24_n384(x)
+    else
+        fun_l24_n439(x)
+    end
+end
+
+def fun_l23_n799(x)
+    if (x < 1)
+        fun_l24_n352(x)
+    else
+        fun_l24_n36(x)
+    end
+end
+
+def fun_l23_n800(x)
+    if (x < 1)
+        fun_l24_n390(x)
+    else
+        fun_l24_n963(x)
+    end
+end
+
+def fun_l23_n801(x)
+    if (x < 1)
+        fun_l24_n470(x)
+    else
+        fun_l24_n818(x)
+    end
+end
+
+def fun_l23_n802(x)
+    if (x < 1)
+        fun_l24_n262(x)
+    else
+        fun_l24_n893(x)
+    end
+end
+
+def fun_l23_n803(x)
+    if (x < 1)
+        fun_l24_n118(x)
+    else
+        fun_l24_n684(x)
+    end
+end
+
+def fun_l23_n804(x)
+    if (x < 1)
+        fun_l24_n484(x)
+    else
+        fun_l24_n520(x)
+    end
+end
+
+def fun_l23_n805(x)
+    if (x < 1)
+        fun_l24_n370(x)
+    else
+        fun_l24_n80(x)
+    end
+end
+
+def fun_l23_n806(x)
+    if (x < 1)
+        fun_l24_n326(x)
+    else
+        fun_l24_n436(x)
+    end
+end
+
+def fun_l23_n807(x)
+    if (x < 1)
+        fun_l24_n490(x)
+    else
+        fun_l24_n811(x)
+    end
+end
+
+def fun_l23_n808(x)
+    if (x < 1)
+        fun_l24_n447(x)
+    else
+        fun_l24_n150(x)
+    end
+end
+
+def fun_l23_n809(x)
+    if (x < 1)
+        fun_l24_n339(x)
+    else
+        fun_l24_n367(x)
+    end
+end
+
+def fun_l23_n810(x)
+    if (x < 1)
+        fun_l24_n221(x)
+    else
+        fun_l24_n505(x)
+    end
+end
+
+def fun_l23_n811(x)
+    if (x < 1)
+        fun_l24_n637(x)
+    else
+        fun_l24_n101(x)
+    end
+end
+
+def fun_l23_n812(x)
+    if (x < 1)
+        fun_l24_n83(x)
+    else
+        fun_l24_n538(x)
+    end
+end
+
+def fun_l23_n813(x)
+    if (x < 1)
+        fun_l24_n927(x)
+    else
+        fun_l24_n513(x)
+    end
+end
+
+def fun_l23_n814(x)
+    if (x < 1)
+        fun_l24_n496(x)
+    else
+        fun_l24_n290(x)
+    end
+end
+
+def fun_l23_n815(x)
+    if (x < 1)
+        fun_l24_n640(x)
+    else
+        fun_l24_n796(x)
+    end
+end
+
+def fun_l23_n816(x)
+    if (x < 1)
+        fun_l24_n999(x)
+    else
+        fun_l24_n54(x)
+    end
+end
+
+def fun_l23_n817(x)
+    if (x < 1)
+        fun_l24_n162(x)
+    else
+        fun_l24_n617(x)
+    end
+end
+
+def fun_l23_n818(x)
+    if (x < 1)
+        fun_l24_n118(x)
+    else
+        fun_l24_n187(x)
+    end
+end
+
+def fun_l23_n819(x)
+    if (x < 1)
+        fun_l24_n334(x)
+    else
+        fun_l24_n901(x)
+    end
+end
+
+def fun_l23_n820(x)
+    if (x < 1)
+        fun_l24_n939(x)
+    else
+        fun_l24_n896(x)
+    end
+end
+
+def fun_l23_n821(x)
+    if (x < 1)
+        fun_l24_n970(x)
+    else
+        fun_l24_n725(x)
+    end
+end
+
+def fun_l23_n822(x)
+    if (x < 1)
+        fun_l24_n357(x)
+    else
+        fun_l24_n771(x)
+    end
+end
+
+def fun_l23_n823(x)
+    if (x < 1)
+        fun_l24_n8(x)
+    else
+        fun_l24_n214(x)
+    end
+end
+
+def fun_l23_n824(x)
+    if (x < 1)
+        fun_l24_n412(x)
+    else
+        fun_l24_n145(x)
+    end
+end
+
+def fun_l23_n825(x)
+    if (x < 1)
+        fun_l24_n218(x)
+    else
+        fun_l24_n700(x)
+    end
+end
+
+def fun_l23_n826(x)
+    if (x < 1)
+        fun_l24_n945(x)
+    else
+        fun_l24_n523(x)
+    end
+end
+
+def fun_l23_n827(x)
+    if (x < 1)
+        fun_l24_n251(x)
+    else
+        fun_l24_n854(x)
+    end
+end
+
+def fun_l23_n828(x)
+    if (x < 1)
+        fun_l24_n704(x)
+    else
+        fun_l24_n879(x)
+    end
+end
+
+def fun_l23_n829(x)
+    if (x < 1)
+        fun_l24_n161(x)
+    else
+        fun_l24_n529(x)
+    end
+end
+
+def fun_l23_n830(x)
+    if (x < 1)
+        fun_l24_n751(x)
+    else
+        fun_l24_n409(x)
+    end
+end
+
+def fun_l23_n831(x)
+    if (x < 1)
+        fun_l24_n883(x)
+    else
+        fun_l24_n1(x)
+    end
+end
+
+def fun_l23_n832(x)
+    if (x < 1)
+        fun_l24_n135(x)
+    else
+        fun_l24_n738(x)
+    end
+end
+
+def fun_l23_n833(x)
+    if (x < 1)
+        fun_l24_n507(x)
+    else
+        fun_l24_n727(x)
+    end
+end
+
+def fun_l23_n834(x)
+    if (x < 1)
+        fun_l24_n677(x)
+    else
+        fun_l24_n602(x)
+    end
+end
+
+def fun_l23_n835(x)
+    if (x < 1)
+        fun_l24_n197(x)
+    else
+        fun_l24_n481(x)
+    end
+end
+
+def fun_l23_n836(x)
+    if (x < 1)
+        fun_l24_n39(x)
+    else
+        fun_l24_n149(x)
+    end
+end
+
+def fun_l23_n837(x)
+    if (x < 1)
+        fun_l24_n950(x)
+    else
+        fun_l24_n455(x)
+    end
+end
+
+def fun_l23_n838(x)
+    if (x < 1)
+        fun_l24_n718(x)
+    else
+        fun_l24_n264(x)
+    end
+end
+
+def fun_l23_n839(x)
+    if (x < 1)
+        fun_l24_n831(x)
+    else
+        fun_l24_n576(x)
+    end
+end
+
+def fun_l23_n840(x)
+    if (x < 1)
+        fun_l24_n813(x)
+    else
+        fun_l24_n564(x)
+    end
+end
+
+def fun_l23_n841(x)
+    if (x < 1)
+        fun_l24_n537(x)
+    else
+        fun_l24_n880(x)
+    end
+end
+
+def fun_l23_n842(x)
+    if (x < 1)
+        fun_l24_n958(x)
+    else
+        fun_l24_n963(x)
+    end
+end
+
+def fun_l23_n843(x)
+    if (x < 1)
+        fun_l24_n879(x)
+    else
+        fun_l24_n281(x)
+    end
+end
+
+def fun_l23_n844(x)
+    if (x < 1)
+        fun_l24_n138(x)
+    else
+        fun_l24_n562(x)
+    end
+end
+
+def fun_l23_n845(x)
+    if (x < 1)
+        fun_l24_n804(x)
+    else
+        fun_l24_n283(x)
+    end
+end
+
+def fun_l23_n846(x)
+    if (x < 1)
+        fun_l24_n253(x)
+    else
+        fun_l24_n339(x)
+    end
+end
+
+def fun_l23_n847(x)
+    if (x < 1)
+        fun_l24_n99(x)
+    else
+        fun_l24_n623(x)
+    end
+end
+
+def fun_l23_n848(x)
+    if (x < 1)
+        fun_l24_n955(x)
+    else
+        fun_l24_n121(x)
+    end
+end
+
+def fun_l23_n849(x)
+    if (x < 1)
+        fun_l24_n437(x)
+    else
+        fun_l24_n387(x)
+    end
+end
+
+def fun_l23_n850(x)
+    if (x < 1)
+        fun_l24_n19(x)
+    else
+        fun_l24_n790(x)
+    end
+end
+
+def fun_l23_n851(x)
+    if (x < 1)
+        fun_l24_n11(x)
+    else
+        fun_l24_n931(x)
+    end
+end
+
+def fun_l23_n852(x)
+    if (x < 1)
+        fun_l24_n506(x)
+    else
+        fun_l24_n162(x)
+    end
+end
+
+def fun_l23_n853(x)
+    if (x < 1)
+        fun_l24_n262(x)
+    else
+        fun_l24_n1(x)
+    end
+end
+
+def fun_l23_n854(x)
+    if (x < 1)
+        fun_l24_n275(x)
+    else
+        fun_l24_n549(x)
+    end
+end
+
+def fun_l23_n855(x)
+    if (x < 1)
+        fun_l24_n865(x)
+    else
+        fun_l24_n472(x)
+    end
+end
+
+def fun_l23_n856(x)
+    if (x < 1)
+        fun_l24_n270(x)
+    else
+        fun_l24_n312(x)
+    end
+end
+
+def fun_l23_n857(x)
+    if (x < 1)
+        fun_l24_n261(x)
+    else
+        fun_l24_n240(x)
+    end
+end
+
+def fun_l23_n858(x)
+    if (x < 1)
+        fun_l24_n166(x)
+    else
+        fun_l24_n996(x)
+    end
+end
+
+def fun_l23_n859(x)
+    if (x < 1)
+        fun_l24_n653(x)
+    else
+        fun_l24_n464(x)
+    end
+end
+
+def fun_l23_n860(x)
+    if (x < 1)
+        fun_l24_n446(x)
+    else
+        fun_l24_n706(x)
+    end
+end
+
+def fun_l23_n861(x)
+    if (x < 1)
+        fun_l24_n744(x)
+    else
+        fun_l24_n53(x)
+    end
+end
+
+def fun_l23_n862(x)
+    if (x < 1)
+        fun_l24_n983(x)
+    else
+        fun_l24_n188(x)
+    end
+end
+
+def fun_l23_n863(x)
+    if (x < 1)
+        fun_l24_n399(x)
+    else
+        fun_l24_n582(x)
+    end
+end
+
+def fun_l23_n864(x)
+    if (x < 1)
+        fun_l24_n392(x)
+    else
+        fun_l24_n937(x)
+    end
+end
+
+def fun_l23_n865(x)
+    if (x < 1)
+        fun_l24_n495(x)
+    else
+        fun_l24_n557(x)
+    end
+end
+
+def fun_l23_n866(x)
+    if (x < 1)
+        fun_l24_n94(x)
+    else
+        fun_l24_n295(x)
+    end
+end
+
+def fun_l23_n867(x)
+    if (x < 1)
+        fun_l24_n628(x)
+    else
+        fun_l24_n432(x)
+    end
+end
+
+def fun_l23_n868(x)
+    if (x < 1)
+        fun_l24_n386(x)
+    else
+        fun_l24_n385(x)
+    end
+end
+
+def fun_l23_n869(x)
+    if (x < 1)
+        fun_l24_n376(x)
+    else
+        fun_l24_n469(x)
+    end
+end
+
+def fun_l23_n870(x)
+    if (x < 1)
+        fun_l24_n74(x)
+    else
+        fun_l24_n712(x)
+    end
+end
+
+def fun_l23_n871(x)
+    if (x < 1)
+        fun_l24_n72(x)
+    else
+        fun_l24_n642(x)
+    end
+end
+
+def fun_l23_n872(x)
+    if (x < 1)
+        fun_l24_n937(x)
+    else
+        fun_l24_n751(x)
+    end
+end
+
+def fun_l23_n873(x)
+    if (x < 1)
+        fun_l24_n385(x)
+    else
+        fun_l24_n404(x)
+    end
+end
+
+def fun_l23_n874(x)
+    if (x < 1)
+        fun_l24_n336(x)
+    else
+        fun_l24_n226(x)
+    end
+end
+
+def fun_l23_n875(x)
+    if (x < 1)
+        fun_l24_n289(x)
+    else
+        fun_l24_n989(x)
+    end
+end
+
+def fun_l23_n876(x)
+    if (x < 1)
+        fun_l24_n45(x)
+    else
+        fun_l24_n279(x)
+    end
+end
+
+def fun_l23_n877(x)
+    if (x < 1)
+        fun_l24_n683(x)
+    else
+        fun_l24_n342(x)
+    end
+end
+
+def fun_l23_n878(x)
+    if (x < 1)
+        fun_l24_n279(x)
+    else
+        fun_l24_n600(x)
+    end
+end
+
+def fun_l23_n879(x)
+    if (x < 1)
+        fun_l24_n82(x)
+    else
+        fun_l24_n177(x)
+    end
+end
+
+def fun_l23_n880(x)
+    if (x < 1)
+        fun_l24_n167(x)
+    else
+        fun_l24_n912(x)
+    end
+end
+
+def fun_l23_n881(x)
+    if (x < 1)
+        fun_l24_n311(x)
+    else
+        fun_l24_n634(x)
+    end
+end
+
+def fun_l23_n882(x)
+    if (x < 1)
+        fun_l24_n127(x)
+    else
+        fun_l24_n661(x)
+    end
+end
+
+def fun_l23_n883(x)
+    if (x < 1)
+        fun_l24_n199(x)
+    else
+        fun_l24_n999(x)
+    end
+end
+
+def fun_l23_n884(x)
+    if (x < 1)
+        fun_l24_n525(x)
+    else
+        fun_l24_n948(x)
+    end
+end
+
+def fun_l23_n885(x)
+    if (x < 1)
+        fun_l24_n590(x)
+    else
+        fun_l24_n822(x)
+    end
+end
+
+def fun_l23_n886(x)
+    if (x < 1)
+        fun_l24_n811(x)
+    else
+        fun_l24_n975(x)
+    end
+end
+
+def fun_l23_n887(x)
+    if (x < 1)
+        fun_l24_n446(x)
+    else
+        fun_l24_n710(x)
+    end
+end
+
+def fun_l23_n888(x)
+    if (x < 1)
+        fun_l24_n31(x)
+    else
+        fun_l24_n92(x)
+    end
+end
+
+def fun_l23_n889(x)
+    if (x < 1)
+        fun_l24_n535(x)
+    else
+        fun_l24_n819(x)
+    end
+end
+
+def fun_l23_n890(x)
+    if (x < 1)
+        fun_l24_n526(x)
+    else
+        fun_l24_n207(x)
+    end
+end
+
+def fun_l23_n891(x)
+    if (x < 1)
+        fun_l24_n752(x)
+    else
+        fun_l24_n994(x)
+    end
+end
+
+def fun_l23_n892(x)
+    if (x < 1)
+        fun_l24_n758(x)
+    else
+        fun_l24_n292(x)
+    end
+end
+
+def fun_l23_n893(x)
+    if (x < 1)
+        fun_l24_n106(x)
+    else
+        fun_l24_n742(x)
+    end
+end
+
+def fun_l23_n894(x)
+    if (x < 1)
+        fun_l24_n385(x)
+    else
+        fun_l24_n562(x)
+    end
+end
+
+def fun_l23_n895(x)
+    if (x < 1)
+        fun_l24_n565(x)
+    else
+        fun_l24_n242(x)
+    end
+end
+
+def fun_l23_n896(x)
+    if (x < 1)
+        fun_l24_n570(x)
+    else
+        fun_l24_n241(x)
+    end
+end
+
+def fun_l23_n897(x)
+    if (x < 1)
+        fun_l24_n840(x)
+    else
+        fun_l24_n681(x)
+    end
+end
+
+def fun_l23_n898(x)
+    if (x < 1)
+        fun_l24_n524(x)
+    else
+        fun_l24_n9(x)
+    end
+end
+
+def fun_l23_n899(x)
+    if (x < 1)
+        fun_l24_n161(x)
+    else
+        fun_l24_n795(x)
+    end
+end
+
+def fun_l23_n900(x)
+    if (x < 1)
+        fun_l24_n64(x)
+    else
+        fun_l24_n447(x)
+    end
+end
+
+def fun_l23_n901(x)
+    if (x < 1)
+        fun_l24_n676(x)
+    else
+        fun_l24_n286(x)
+    end
+end
+
+def fun_l23_n902(x)
+    if (x < 1)
+        fun_l24_n623(x)
+    else
+        fun_l24_n298(x)
+    end
+end
+
+def fun_l23_n903(x)
+    if (x < 1)
+        fun_l24_n795(x)
+    else
+        fun_l24_n646(x)
+    end
+end
+
+def fun_l23_n904(x)
+    if (x < 1)
+        fun_l24_n746(x)
+    else
+        fun_l24_n7(x)
+    end
+end
+
+def fun_l23_n905(x)
+    if (x < 1)
+        fun_l24_n311(x)
+    else
+        fun_l24_n417(x)
+    end
+end
+
+def fun_l23_n906(x)
+    if (x < 1)
+        fun_l24_n338(x)
+    else
+        fun_l24_n592(x)
+    end
+end
+
+def fun_l23_n907(x)
+    if (x < 1)
+        fun_l24_n667(x)
+    else
+        fun_l24_n370(x)
+    end
+end
+
+def fun_l23_n908(x)
+    if (x < 1)
+        fun_l24_n444(x)
+    else
+        fun_l24_n703(x)
+    end
+end
+
+def fun_l23_n909(x)
+    if (x < 1)
+        fun_l24_n325(x)
+    else
+        fun_l24_n977(x)
+    end
+end
+
+def fun_l23_n910(x)
+    if (x < 1)
+        fun_l24_n994(x)
+    else
+        fun_l24_n765(x)
+    end
+end
+
+def fun_l23_n911(x)
+    if (x < 1)
+        fun_l24_n327(x)
+    else
+        fun_l24_n657(x)
+    end
+end
+
+def fun_l23_n912(x)
+    if (x < 1)
+        fun_l24_n932(x)
+    else
+        fun_l24_n769(x)
+    end
+end
+
+def fun_l23_n913(x)
+    if (x < 1)
+        fun_l24_n263(x)
+    else
+        fun_l24_n729(x)
+    end
+end
+
+def fun_l23_n914(x)
+    if (x < 1)
+        fun_l24_n248(x)
+    else
+        fun_l24_n412(x)
+    end
+end
+
+def fun_l23_n915(x)
+    if (x < 1)
+        fun_l24_n793(x)
+    else
+        fun_l24_n329(x)
+    end
+end
+
+def fun_l23_n916(x)
+    if (x < 1)
+        fun_l24_n7(x)
+    else
+        fun_l24_n460(x)
+    end
+end
+
+def fun_l23_n917(x)
+    if (x < 1)
+        fun_l24_n612(x)
+    else
+        fun_l24_n79(x)
+    end
+end
+
+def fun_l23_n918(x)
+    if (x < 1)
+        fun_l24_n450(x)
+    else
+        fun_l24_n950(x)
+    end
+end
+
+def fun_l23_n919(x)
+    if (x < 1)
+        fun_l24_n72(x)
+    else
+        fun_l24_n550(x)
+    end
+end
+
+def fun_l23_n920(x)
+    if (x < 1)
+        fun_l24_n73(x)
+    else
+        fun_l24_n339(x)
+    end
+end
+
+def fun_l23_n921(x)
+    if (x < 1)
+        fun_l24_n6(x)
+    else
+        fun_l24_n865(x)
+    end
+end
+
+def fun_l23_n922(x)
+    if (x < 1)
+        fun_l24_n507(x)
+    else
+        fun_l24_n475(x)
+    end
+end
+
+def fun_l23_n923(x)
+    if (x < 1)
+        fun_l24_n579(x)
+    else
+        fun_l24_n832(x)
+    end
+end
+
+def fun_l23_n924(x)
+    if (x < 1)
+        fun_l24_n681(x)
+    else
+        fun_l24_n253(x)
+    end
+end
+
+def fun_l23_n925(x)
+    if (x < 1)
+        fun_l24_n611(x)
+    else
+        fun_l24_n831(x)
+    end
+end
+
+def fun_l23_n926(x)
+    if (x < 1)
+        fun_l24_n371(x)
+    else
+        fun_l24_n236(x)
+    end
+end
+
+def fun_l23_n927(x)
+    if (x < 1)
+        fun_l24_n941(x)
+    else
+        fun_l24_n905(x)
+    end
+end
+
+def fun_l23_n928(x)
+    if (x < 1)
+        fun_l24_n616(x)
+    else
+        fun_l24_n421(x)
+    end
+end
+
+def fun_l23_n929(x)
+    if (x < 1)
+        fun_l24_n469(x)
+    else
+        fun_l24_n405(x)
+    end
+end
+
+def fun_l23_n930(x)
+    if (x < 1)
+        fun_l24_n584(x)
+    else
+        fun_l24_n694(x)
+    end
+end
+
+def fun_l23_n931(x)
+    if (x < 1)
+        fun_l24_n530(x)
+    else
+        fun_l24_n112(x)
+    end
+end
+
+def fun_l23_n932(x)
+    if (x < 1)
+        fun_l24_n115(x)
+    else
+        fun_l24_n667(x)
+    end
+end
+
+def fun_l23_n933(x)
+    if (x < 1)
+        fun_l24_n23(x)
+    else
+        fun_l24_n68(x)
+    end
+end
+
+def fun_l23_n934(x)
+    if (x < 1)
+        fun_l24_n215(x)
+    else
+        fun_l24_n459(x)
+    end
+end
+
+def fun_l23_n935(x)
+    if (x < 1)
+        fun_l24_n533(x)
+    else
+        fun_l24_n882(x)
+    end
+end
+
+def fun_l23_n936(x)
+    if (x < 1)
+        fun_l24_n918(x)
+    else
+        fun_l24_n522(x)
+    end
+end
+
+def fun_l23_n937(x)
+    if (x < 1)
+        fun_l24_n472(x)
+    else
+        fun_l24_n322(x)
+    end
+end
+
+def fun_l23_n938(x)
+    if (x < 1)
+        fun_l24_n528(x)
+    else
+        fun_l24_n937(x)
+    end
+end
+
+def fun_l23_n939(x)
+    if (x < 1)
+        fun_l24_n426(x)
+    else
+        fun_l24_n904(x)
+    end
+end
+
+def fun_l23_n940(x)
+    if (x < 1)
+        fun_l24_n259(x)
+    else
+        fun_l24_n350(x)
+    end
+end
+
+def fun_l23_n941(x)
+    if (x < 1)
+        fun_l24_n770(x)
+    else
+        fun_l24_n449(x)
+    end
+end
+
+def fun_l23_n942(x)
+    if (x < 1)
+        fun_l24_n159(x)
+    else
+        fun_l24_n312(x)
+    end
+end
+
+def fun_l23_n943(x)
+    if (x < 1)
+        fun_l24_n168(x)
+    else
+        fun_l24_n820(x)
+    end
+end
+
+def fun_l23_n944(x)
+    if (x < 1)
+        fun_l24_n861(x)
+    else
+        fun_l24_n395(x)
+    end
+end
+
+def fun_l23_n945(x)
+    if (x < 1)
+        fun_l24_n802(x)
+    else
+        fun_l24_n651(x)
+    end
+end
+
+def fun_l23_n946(x)
+    if (x < 1)
+        fun_l24_n519(x)
+    else
+        fun_l24_n736(x)
+    end
+end
+
+def fun_l23_n947(x)
+    if (x < 1)
+        fun_l24_n277(x)
+    else
+        fun_l24_n705(x)
+    end
+end
+
+def fun_l23_n948(x)
+    if (x < 1)
+        fun_l24_n658(x)
+    else
+        fun_l24_n983(x)
+    end
+end
+
+def fun_l23_n949(x)
+    if (x < 1)
+        fun_l24_n390(x)
+    else
+        fun_l24_n365(x)
+    end
+end
+
+def fun_l23_n950(x)
+    if (x < 1)
+        fun_l24_n362(x)
+    else
+        fun_l24_n895(x)
+    end
+end
+
+def fun_l23_n951(x)
+    if (x < 1)
+        fun_l24_n431(x)
+    else
+        fun_l24_n240(x)
+    end
+end
+
+def fun_l23_n952(x)
+    if (x < 1)
+        fun_l24_n87(x)
+    else
+        fun_l24_n923(x)
+    end
+end
+
+def fun_l23_n953(x)
+    if (x < 1)
+        fun_l24_n605(x)
+    else
+        fun_l24_n369(x)
+    end
+end
+
+def fun_l23_n954(x)
+    if (x < 1)
+        fun_l24_n659(x)
+    else
+        fun_l24_n485(x)
+    end
+end
+
+def fun_l23_n955(x)
+    if (x < 1)
+        fun_l24_n204(x)
+    else
+        fun_l24_n719(x)
+    end
+end
+
+def fun_l23_n956(x)
+    if (x < 1)
+        fun_l24_n752(x)
+    else
+        fun_l24_n522(x)
+    end
+end
+
+def fun_l23_n957(x)
+    if (x < 1)
+        fun_l24_n827(x)
+    else
+        fun_l24_n740(x)
+    end
+end
+
+def fun_l23_n958(x)
+    if (x < 1)
+        fun_l24_n476(x)
+    else
+        fun_l24_n766(x)
+    end
+end
+
+def fun_l23_n959(x)
+    if (x < 1)
+        fun_l24_n167(x)
+    else
+        fun_l24_n552(x)
+    end
+end
+
+def fun_l23_n960(x)
+    if (x < 1)
+        fun_l24_n352(x)
+    else
+        fun_l24_n147(x)
+    end
+end
+
+def fun_l23_n961(x)
+    if (x < 1)
+        fun_l24_n641(x)
+    else
+        fun_l24_n263(x)
+    end
+end
+
+def fun_l23_n962(x)
+    if (x < 1)
+        fun_l24_n2(x)
+    else
+        fun_l24_n819(x)
+    end
+end
+
+def fun_l23_n963(x)
+    if (x < 1)
+        fun_l24_n649(x)
+    else
+        fun_l24_n589(x)
+    end
+end
+
+def fun_l23_n964(x)
+    if (x < 1)
+        fun_l24_n351(x)
+    else
+        fun_l24_n170(x)
+    end
+end
+
+def fun_l23_n965(x)
+    if (x < 1)
+        fun_l24_n913(x)
+    else
+        fun_l24_n141(x)
+    end
+end
+
+def fun_l23_n966(x)
+    if (x < 1)
+        fun_l24_n230(x)
+    else
+        fun_l24_n438(x)
+    end
+end
+
+def fun_l23_n967(x)
+    if (x < 1)
+        fun_l24_n649(x)
+    else
+        fun_l24_n867(x)
+    end
+end
+
+def fun_l23_n968(x)
+    if (x < 1)
+        fun_l24_n877(x)
+    else
+        fun_l24_n341(x)
+    end
+end
+
+def fun_l23_n969(x)
+    if (x < 1)
+        fun_l24_n802(x)
+    else
+        fun_l24_n409(x)
+    end
+end
+
+def fun_l23_n970(x)
+    if (x < 1)
+        fun_l24_n388(x)
+    else
+        fun_l24_n521(x)
+    end
+end
+
+def fun_l23_n971(x)
+    if (x < 1)
+        fun_l24_n533(x)
+    else
+        fun_l24_n856(x)
+    end
+end
+
+def fun_l23_n972(x)
+    if (x < 1)
+        fun_l24_n409(x)
+    else
+        fun_l24_n119(x)
+    end
+end
+
+def fun_l23_n973(x)
+    if (x < 1)
+        fun_l24_n774(x)
+    else
+        fun_l24_n561(x)
+    end
+end
+
+def fun_l23_n974(x)
+    if (x < 1)
+        fun_l24_n96(x)
+    else
+        fun_l24_n629(x)
+    end
+end
+
+def fun_l23_n975(x)
+    if (x < 1)
+        fun_l24_n985(x)
+    else
+        fun_l24_n651(x)
+    end
+end
+
+def fun_l23_n976(x)
+    if (x < 1)
+        fun_l24_n977(x)
+    else
+        fun_l24_n274(x)
+    end
+end
+
+def fun_l23_n977(x)
+    if (x < 1)
+        fun_l24_n85(x)
+    else
+        fun_l24_n337(x)
+    end
+end
+
+def fun_l23_n978(x)
+    if (x < 1)
+        fun_l24_n312(x)
+    else
+        fun_l24_n990(x)
+    end
+end
+
+def fun_l23_n979(x)
+    if (x < 1)
+        fun_l24_n438(x)
+    else
+        fun_l24_n42(x)
+    end
+end
+
+def fun_l23_n980(x)
+    if (x < 1)
+        fun_l24_n341(x)
+    else
+        fun_l24_n27(x)
+    end
+end
+
+def fun_l23_n981(x)
+    if (x < 1)
+        fun_l24_n300(x)
+    else
+        fun_l24_n669(x)
+    end
+end
+
+def fun_l23_n982(x)
+    if (x < 1)
+        fun_l24_n586(x)
+    else
+        fun_l24_n822(x)
+    end
+end
+
+def fun_l23_n983(x)
+    if (x < 1)
+        fun_l24_n388(x)
+    else
+        fun_l24_n966(x)
+    end
+end
+
+def fun_l23_n984(x)
+    if (x < 1)
+        fun_l24_n661(x)
+    else
+        fun_l24_n66(x)
+    end
+end
+
+def fun_l23_n985(x)
+    if (x < 1)
+        fun_l24_n384(x)
+    else
+        fun_l24_n419(x)
+    end
+end
+
+def fun_l23_n986(x)
+    if (x < 1)
+        fun_l24_n698(x)
+    else
+        fun_l24_n961(x)
+    end
+end
+
+def fun_l23_n987(x)
+    if (x < 1)
+        fun_l24_n820(x)
+    else
+        fun_l24_n112(x)
+    end
+end
+
+def fun_l23_n988(x)
+    if (x < 1)
+        fun_l24_n976(x)
+    else
+        fun_l24_n232(x)
+    end
+end
+
+def fun_l23_n989(x)
+    if (x < 1)
+        fun_l24_n292(x)
+    else
+        fun_l24_n77(x)
+    end
+end
+
+def fun_l23_n990(x)
+    if (x < 1)
+        fun_l24_n572(x)
+    else
+        fun_l24_n524(x)
+    end
+end
+
+def fun_l23_n991(x)
+    if (x < 1)
+        fun_l24_n226(x)
+    else
+        fun_l24_n821(x)
+    end
+end
+
+def fun_l23_n992(x)
+    if (x < 1)
+        fun_l24_n12(x)
+    else
+        fun_l24_n891(x)
+    end
+end
+
+def fun_l23_n993(x)
+    if (x < 1)
+        fun_l24_n101(x)
+    else
+        fun_l24_n592(x)
+    end
+end
+
+def fun_l23_n994(x)
+    if (x < 1)
+        fun_l24_n796(x)
+    else
+        fun_l24_n594(x)
+    end
+end
+
+def fun_l23_n995(x)
+    if (x < 1)
+        fun_l24_n707(x)
+    else
+        fun_l24_n577(x)
+    end
+end
+
+def fun_l23_n996(x)
+    if (x < 1)
+        fun_l24_n123(x)
+    else
+        fun_l24_n730(x)
+    end
+end
+
+def fun_l23_n997(x)
+    if (x < 1)
+        fun_l24_n520(x)
+    else
+        fun_l24_n888(x)
+    end
+end
+
+def fun_l23_n998(x)
+    if (x < 1)
+        fun_l24_n165(x)
+    else
+        fun_l24_n576(x)
+    end
+end
+
+def fun_l23_n999(x)
+    if (x < 1)
+        fun_l24_n496(x)
+    else
+        fun_l24_n722(x)
+    end
+end
+
+def fun_l24_n0(x)
+    if (x < 1)
+        fun_l25_n357(x)
+    else
+        fun_l25_n144(x)
+    end
+end
+
+def fun_l24_n1(x)
+    if (x < 1)
+        fun_l25_n49(x)
+    else
+        fun_l25_n870(x)
+    end
+end
+
+def fun_l24_n2(x)
+    if (x < 1)
+        fun_l25_n547(x)
+    else
+        fun_l25_n357(x)
+    end
+end
+
+def fun_l24_n3(x)
+    if (x < 1)
+        fun_l25_n167(x)
+    else
+        fun_l25_n908(x)
+    end
+end
+
+def fun_l24_n4(x)
+    if (x < 1)
+        fun_l25_n943(x)
+    else
+        fun_l25_n882(x)
+    end
+end
+
+def fun_l24_n5(x)
+    if (x < 1)
+        fun_l25_n635(x)
+    else
+        fun_l25_n988(x)
+    end
+end
+
+def fun_l24_n6(x)
+    if (x < 1)
+        fun_l25_n648(x)
+    else
+        fun_l25_n62(x)
+    end
+end
+
+def fun_l24_n7(x)
+    if (x < 1)
+        fun_l25_n896(x)
+    else
+        fun_l25_n636(x)
+    end
+end
+
+def fun_l24_n8(x)
+    if (x < 1)
+        fun_l25_n666(x)
+    else
+        fun_l25_n50(x)
+    end
+end
+
+def fun_l24_n9(x)
+    if (x < 1)
+        fun_l25_n42(x)
+    else
+        fun_l25_n216(x)
+    end
+end
+
+def fun_l24_n10(x)
+    if (x < 1)
+        fun_l25_n979(x)
+    else
+        fun_l25_n27(x)
+    end
+end
+
+def fun_l24_n11(x)
+    if (x < 1)
+        fun_l25_n421(x)
+    else
+        fun_l25_n239(x)
+    end
+end
+
+def fun_l24_n12(x)
+    if (x < 1)
+        fun_l25_n465(x)
+    else
+        fun_l25_n483(x)
+    end
+end
+
+def fun_l24_n13(x)
+    if (x < 1)
+        fun_l25_n172(x)
+    else
+        fun_l25_n918(x)
+    end
+end
+
+def fun_l24_n14(x)
+    if (x < 1)
+        fun_l25_n130(x)
+    else
+        fun_l25_n144(x)
+    end
+end
+
+def fun_l24_n15(x)
+    if (x < 1)
+        fun_l25_n569(x)
+    else
+        fun_l25_n319(x)
+    end
+end
+
+def fun_l24_n16(x)
+    if (x < 1)
+        fun_l25_n54(x)
+    else
+        fun_l25_n253(x)
+    end
+end
+
+def fun_l24_n17(x)
+    if (x < 1)
+        fun_l25_n127(x)
+    else
+        fun_l25_n594(x)
+    end
+end
+
+def fun_l24_n18(x)
+    if (x < 1)
+        fun_l25_n94(x)
+    else
+        fun_l25_n486(x)
+    end
+end
+
+def fun_l24_n19(x)
+    if (x < 1)
+        fun_l25_n322(x)
+    else
+        fun_l25_n731(x)
+    end
+end
+
+def fun_l24_n20(x)
+    if (x < 1)
+        fun_l25_n828(x)
+    else
+        fun_l25_n410(x)
+    end
+end
+
+def fun_l24_n21(x)
+    if (x < 1)
+        fun_l25_n422(x)
+    else
+        fun_l25_n265(x)
+    end
+end
+
+def fun_l24_n22(x)
+    if (x < 1)
+        fun_l25_n259(x)
+    else
+        fun_l25_n902(x)
+    end
+end
+
+def fun_l24_n23(x)
+    if (x < 1)
+        fun_l25_n660(x)
+    else
+        fun_l25_n525(x)
+    end
+end
+
+def fun_l24_n24(x)
+    if (x < 1)
+        fun_l25_n898(x)
+    else
+        fun_l25_n231(x)
+    end
+end
+
+def fun_l24_n25(x)
+    if (x < 1)
+        fun_l25_n319(x)
+    else
+        fun_l25_n306(x)
+    end
+end
+
+def fun_l24_n26(x)
+    if (x < 1)
+        fun_l25_n447(x)
+    else
+        fun_l25_n110(x)
+    end
+end
+
+def fun_l24_n27(x)
+    if (x < 1)
+        fun_l25_n416(x)
+    else
+        fun_l25_n335(x)
+    end
+end
+
+def fun_l24_n28(x)
+    if (x < 1)
+        fun_l25_n132(x)
+    else
+        fun_l25_n549(x)
+    end
+end
+
+def fun_l24_n29(x)
+    if (x < 1)
+        fun_l25_n878(x)
+    else
+        fun_l25_n790(x)
+    end
+end
+
+def fun_l24_n30(x)
+    if (x < 1)
+        fun_l25_n205(x)
+    else
+        fun_l25_n328(x)
+    end
+end
+
+def fun_l24_n31(x)
+    if (x < 1)
+        fun_l25_n448(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n32(x)
+    if (x < 1)
+        fun_l25_n800(x)
+    else
+        fun_l25_n254(x)
+    end
+end
+
+def fun_l24_n33(x)
+    if (x < 1)
+        fun_l25_n377(x)
+    else
+        fun_l25_n178(x)
+    end
+end
+
+def fun_l24_n34(x)
+    if (x < 1)
+        fun_l25_n317(x)
+    else
+        fun_l25_n271(x)
+    end
+end
+
+def fun_l24_n35(x)
+    if (x < 1)
+        fun_l25_n50(x)
+    else
+        fun_l25_n801(x)
+    end
+end
+
+def fun_l24_n36(x)
+    if (x < 1)
+        fun_l25_n720(x)
+    else
+        fun_l25_n267(x)
+    end
+end
+
+def fun_l24_n37(x)
+    if (x < 1)
+        fun_l25_n688(x)
+    else
+        fun_l25_n901(x)
+    end
+end
+
+def fun_l24_n38(x)
+    if (x < 1)
+        fun_l25_n752(x)
+    else
+        fun_l25_n541(x)
+    end
+end
+
+def fun_l24_n39(x)
+    if (x < 1)
+        fun_l25_n716(x)
+    else
+        fun_l25_n884(x)
+    end
+end
+
+def fun_l24_n40(x)
+    if (x < 1)
+        fun_l25_n138(x)
+    else
+        fun_l25_n536(x)
+    end
+end
+
+def fun_l24_n41(x)
+    if (x < 1)
+        fun_l25_n382(x)
+    else
+        fun_l25_n496(x)
+    end
+end
+
+def fun_l24_n42(x)
+    if (x < 1)
+        fun_l25_n729(x)
+    else
+        fun_l25_n443(x)
+    end
+end
+
+def fun_l24_n43(x)
+    if (x < 1)
+        fun_l25_n401(x)
+    else
+        fun_l25_n300(x)
+    end
+end
+
+def fun_l24_n44(x)
+    if (x < 1)
+        fun_l25_n695(x)
+    else
+        fun_l25_n139(x)
+    end
+end
+
+def fun_l24_n45(x)
+    if (x < 1)
+        fun_l25_n186(x)
+    else
+        fun_l25_n446(x)
+    end
+end
+
+def fun_l24_n46(x)
+    if (x < 1)
+        fun_l25_n102(x)
+    else
+        fun_l25_n415(x)
+    end
+end
+
+def fun_l24_n47(x)
+    if (x < 1)
+        fun_l25_n74(x)
+    else
+        fun_l25_n947(x)
+    end
+end
+
+def fun_l24_n48(x)
+    if (x < 1)
+        fun_l25_n720(x)
+    else
+        fun_l25_n873(x)
+    end
+end
+
+def fun_l24_n49(x)
+    if (x < 1)
+        fun_l25_n779(x)
+    else
+        fun_l25_n61(x)
+    end
+end
+
+def fun_l24_n50(x)
+    if (x < 1)
+        fun_l25_n889(x)
+    else
+        fun_l25_n620(x)
+    end
+end
+
+def fun_l24_n51(x)
+    if (x < 1)
+        fun_l25_n323(x)
+    else
+        fun_l25_n412(x)
+    end
+end
+
+def fun_l24_n52(x)
+    if (x < 1)
+        fun_l25_n986(x)
+    else
+        fun_l25_n950(x)
+    end
+end
+
+def fun_l24_n53(x)
+    if (x < 1)
+        fun_l25_n810(x)
+    else
+        fun_l25_n956(x)
+    end
+end
+
+def fun_l24_n54(x)
+    if (x < 1)
+        fun_l25_n89(x)
+    else
+        fun_l25_n110(x)
+    end
+end
+
+def fun_l24_n55(x)
+    if (x < 1)
+        fun_l25_n255(x)
+    else
+        fun_l25_n953(x)
+    end
+end
+
+def fun_l24_n56(x)
+    if (x < 1)
+        fun_l25_n200(x)
+    else
+        fun_l25_n366(x)
+    end
+end
+
+def fun_l24_n57(x)
+    if (x < 1)
+        fun_l25_n431(x)
+    else
+        fun_l25_n49(x)
+    end
+end
+
+def fun_l24_n58(x)
+    if (x < 1)
+        fun_l25_n705(x)
+    else
+        fun_l25_n362(x)
+    end
+end
+
+def fun_l24_n59(x)
+    if (x < 1)
+        fun_l25_n587(x)
+    else
+        fun_l25_n511(x)
+    end
+end
+
+def fun_l24_n60(x)
+    if (x < 1)
+        fun_l25_n72(x)
+    else
+        fun_l25_n560(x)
+    end
+end
+
+def fun_l24_n61(x)
+    if (x < 1)
+        fun_l25_n732(x)
+    else
+        fun_l25_n214(x)
+    end
+end
+
+def fun_l24_n62(x)
+    if (x < 1)
+        fun_l25_n348(x)
+    else
+        fun_l25_n70(x)
+    end
+end
+
+def fun_l24_n63(x)
+    if (x < 1)
+        fun_l25_n371(x)
+    else
+        fun_l25_n625(x)
+    end
+end
+
+def fun_l24_n64(x)
+    if (x < 1)
+        fun_l25_n204(x)
+    else
+        fun_l25_n249(x)
+    end
+end
+
+def fun_l24_n65(x)
+    if (x < 1)
+        fun_l25_n608(x)
+    else
+        fun_l25_n682(x)
+    end
+end
+
+def fun_l24_n66(x)
+    if (x < 1)
+        fun_l25_n450(x)
+    else
+        fun_l25_n951(x)
+    end
+end
+
+def fun_l24_n67(x)
+    if (x < 1)
+        fun_l25_n749(x)
+    else
+        fun_l25_n39(x)
+    end
+end
+
+def fun_l24_n68(x)
+    if (x < 1)
+        fun_l25_n169(x)
+    else
+        fun_l25_n801(x)
+    end
+end
+
+def fun_l24_n69(x)
+    if (x < 1)
+        fun_l25_n55(x)
+    else
+        fun_l25_n728(x)
+    end
+end
+
+def fun_l24_n70(x)
+    if (x < 1)
+        fun_l25_n115(x)
+    else
+        fun_l25_n689(x)
+    end
+end
+
+def fun_l24_n71(x)
+    if (x < 1)
+        fun_l25_n332(x)
+    else
+        fun_l25_n474(x)
+    end
+end
+
+def fun_l24_n72(x)
+    if (x < 1)
+        fun_l25_n846(x)
+    else
+        fun_l25_n808(x)
+    end
+end
+
+def fun_l24_n73(x)
+    if (x < 1)
+        fun_l25_n521(x)
+    else
+        fun_l25_n229(x)
+    end
+end
+
+def fun_l24_n74(x)
+    if (x < 1)
+        fun_l25_n307(x)
+    else
+        fun_l25_n992(x)
+    end
+end
+
+def fun_l24_n75(x)
+    if (x < 1)
+        fun_l25_n564(x)
+    else
+        fun_l25_n940(x)
+    end
+end
+
+def fun_l24_n76(x)
+    if (x < 1)
+        fun_l25_n348(x)
+    else
+        fun_l25_n453(x)
+    end
+end
+
+def fun_l24_n77(x)
+    if (x < 1)
+        fun_l25_n252(x)
+    else
+        fun_l25_n270(x)
+    end
+end
+
+def fun_l24_n78(x)
+    if (x < 1)
+        fun_l25_n333(x)
+    else
+        fun_l25_n980(x)
+    end
+end
+
+def fun_l24_n79(x)
+    if (x < 1)
+        fun_l25_n486(x)
+    else
+        fun_l25_n276(x)
+    end
+end
+
+def fun_l24_n80(x)
+    if (x < 1)
+        fun_l25_n45(x)
+    else
+        fun_l25_n930(x)
+    end
+end
+
+def fun_l24_n81(x)
+    if (x < 1)
+        fun_l25_n527(x)
+    else
+        fun_l25_n181(x)
+    end
+end
+
+def fun_l24_n82(x)
+    if (x < 1)
+        fun_l25_n768(x)
+    else
+        fun_l25_n869(x)
+    end
+end
+
+def fun_l24_n83(x)
+    if (x < 1)
+        fun_l25_n505(x)
+    else
+        fun_l25_n214(x)
+    end
+end
+
+def fun_l24_n84(x)
+    if (x < 1)
+        fun_l25_n41(x)
+    else
+        fun_l25_n873(x)
+    end
+end
+
+def fun_l24_n85(x)
+    if (x < 1)
+        fun_l25_n646(x)
+    else
+        fun_l25_n105(x)
+    end
+end
+
+def fun_l24_n86(x)
+    if (x < 1)
+        fun_l25_n675(x)
+    else
+        fun_l25_n830(x)
+    end
+end
+
+def fun_l24_n87(x)
+    if (x < 1)
+        fun_l25_n953(x)
+    else
+        fun_l25_n268(x)
+    end
+end
+
+def fun_l24_n88(x)
+    if (x < 1)
+        fun_l25_n36(x)
+    else
+        fun_l25_n31(x)
+    end
+end
+
+def fun_l24_n89(x)
+    if (x < 1)
+        fun_l25_n810(x)
+    else
+        fun_l25_n315(x)
+    end
+end
+
+def fun_l24_n90(x)
+    if (x < 1)
+        fun_l25_n100(x)
+    else
+        fun_l25_n882(x)
+    end
+end
+
+def fun_l24_n91(x)
+    if (x < 1)
+        fun_l25_n278(x)
+    else
+        fun_l25_n720(x)
+    end
+end
+
+def fun_l24_n92(x)
+    if (x < 1)
+        fun_l25_n472(x)
+    else
+        fun_l25_n615(x)
+    end
+end
+
+def fun_l24_n93(x)
+    if (x < 1)
+        fun_l25_n42(x)
+    else
+        fun_l25_n16(x)
+    end
+end
+
+def fun_l24_n94(x)
+    if (x < 1)
+        fun_l25_n905(x)
+    else
+        fun_l25_n988(x)
+    end
+end
+
+def fun_l24_n95(x)
+    if (x < 1)
+        fun_l25_n862(x)
+    else
+        fun_l25_n355(x)
+    end
+end
+
+def fun_l24_n96(x)
+    if (x < 1)
+        fun_l25_n931(x)
+    else
+        fun_l25_n539(x)
+    end
+end
+
+def fun_l24_n97(x)
+    if (x < 1)
+        fun_l25_n185(x)
+    else
+        fun_l25_n868(x)
+    end
+end
+
+def fun_l24_n98(x)
+    if (x < 1)
+        fun_l25_n276(x)
+    else
+        fun_l25_n591(x)
+    end
+end
+
+def fun_l24_n99(x)
+    if (x < 1)
+        fun_l25_n695(x)
+    else
+        fun_l25_n965(x)
+    end
+end
+
+def fun_l24_n100(x)
+    if (x < 1)
+        fun_l25_n293(x)
+    else
+        fun_l25_n127(x)
+    end
+end
+
+def fun_l24_n101(x)
+    if (x < 1)
+        fun_l25_n71(x)
+    else
+        fun_l25_n245(x)
+    end
+end
+
+def fun_l24_n102(x)
+    if (x < 1)
+        fun_l25_n397(x)
+    else
+        fun_l25_n893(x)
+    end
+end
+
+def fun_l24_n103(x)
+    if (x < 1)
+        fun_l25_n191(x)
+    else
+        fun_l25_n101(x)
+    end
+end
+
+def fun_l24_n104(x)
+    if (x < 1)
+        fun_l25_n982(x)
+    else
+        fun_l25_n101(x)
+    end
+end
+
+def fun_l24_n105(x)
+    if (x < 1)
+        fun_l25_n385(x)
+    else
+        fun_l25_n651(x)
+    end
+end
+
+def fun_l24_n106(x)
+    if (x < 1)
+        fun_l25_n577(x)
+    else
+        fun_l25_n241(x)
+    end
+end
+
+def fun_l24_n107(x)
+    if (x < 1)
+        fun_l25_n219(x)
+    else
+        fun_l25_n92(x)
+    end
+end
+
+def fun_l24_n108(x)
+    if (x < 1)
+        fun_l25_n202(x)
+    else
+        fun_l25_n133(x)
+    end
+end
+
+def fun_l24_n109(x)
+    if (x < 1)
+        fun_l25_n706(x)
+    else
+        fun_l25_n970(x)
+    end
+end
+
+def fun_l24_n110(x)
+    if (x < 1)
+        fun_l25_n948(x)
+    else
+        fun_l25_n595(x)
+    end
+end
+
+def fun_l24_n111(x)
+    if (x < 1)
+        fun_l25_n775(x)
+    else
+        fun_l25_n609(x)
+    end
+end
+
+def fun_l24_n112(x)
+    if (x < 1)
+        fun_l25_n905(x)
+    else
+        fun_l25_n11(x)
+    end
+end
+
+def fun_l24_n113(x)
+    if (x < 1)
+        fun_l25_n730(x)
+    else
+        fun_l25_n826(x)
+    end
+end
+
+def fun_l24_n114(x)
+    if (x < 1)
+        fun_l25_n403(x)
+    else
+        fun_l25_n562(x)
+    end
+end
+
+def fun_l24_n115(x)
+    if (x < 1)
+        fun_l25_n272(x)
+    else
+        fun_l25_n844(x)
+    end
+end
+
+def fun_l24_n116(x)
+    if (x < 1)
+        fun_l25_n907(x)
+    else
+        fun_l25_n797(x)
+    end
+end
+
+def fun_l24_n117(x)
+    if (x < 1)
+        fun_l25_n910(x)
+    else
+        fun_l25_n632(x)
+    end
+end
+
+def fun_l24_n118(x)
+    if (x < 1)
+        fun_l25_n570(x)
+    else
+        fun_l25_n645(x)
+    end
+end
+
+def fun_l24_n119(x)
+    if (x < 1)
+        fun_l25_n930(x)
+    else
+        fun_l25_n31(x)
+    end
+end
+
+def fun_l24_n120(x)
+    if (x < 1)
+        fun_l25_n228(x)
+    else
+        fun_l25_n340(x)
+    end
+end
+
+def fun_l24_n121(x)
+    if (x < 1)
+        fun_l25_n891(x)
+    else
+        fun_l25_n395(x)
+    end
+end
+
+def fun_l24_n122(x)
+    if (x < 1)
+        fun_l25_n340(x)
+    else
+        fun_l25_n966(x)
+    end
+end
+
+def fun_l24_n123(x)
+    if (x < 1)
+        fun_l25_n835(x)
+    else
+        fun_l25_n407(x)
+    end
+end
+
+def fun_l24_n124(x)
+    if (x < 1)
+        fun_l25_n156(x)
+    else
+        fun_l25_n151(x)
+    end
+end
+
+def fun_l24_n125(x)
+    if (x < 1)
+        fun_l25_n912(x)
+    else
+        fun_l25_n733(x)
+    end
+end
+
+def fun_l24_n126(x)
+    if (x < 1)
+        fun_l25_n385(x)
+    else
+        fun_l25_n406(x)
+    end
+end
+
+def fun_l24_n127(x)
+    if (x < 1)
+        fun_l25_n662(x)
+    else
+        fun_l25_n932(x)
+    end
+end
+
+def fun_l24_n128(x)
+    if (x < 1)
+        fun_l25_n418(x)
+    else
+        fun_l25_n445(x)
+    end
+end
+
+def fun_l24_n129(x)
+    if (x < 1)
+        fun_l25_n659(x)
+    else
+        fun_l25_n518(x)
+    end
+end
+
+def fun_l24_n130(x)
+    if (x < 1)
+        fun_l25_n784(x)
+    else
+        fun_l25_n342(x)
+    end
+end
+
+def fun_l24_n131(x)
+    if (x < 1)
+        fun_l25_n184(x)
+    else
+        fun_l25_n316(x)
+    end
+end
+
+def fun_l24_n132(x)
+    if (x < 1)
+        fun_l25_n76(x)
+    else
+        fun_l25_n156(x)
+    end
+end
+
+def fun_l24_n133(x)
+    if (x < 1)
+        fun_l25_n355(x)
+    else
+        fun_l25_n430(x)
+    end
+end
+
+def fun_l24_n134(x)
+    if (x < 1)
+        fun_l25_n643(x)
+    else
+        fun_l25_n109(x)
+    end
+end
+
+def fun_l24_n135(x)
+    if (x < 1)
+        fun_l25_n277(x)
+    else
+        fun_l25_n76(x)
+    end
+end
+
+def fun_l24_n136(x)
+    if (x < 1)
+        fun_l25_n898(x)
+    else
+        fun_l25_n870(x)
+    end
+end
+
+def fun_l24_n137(x)
+    if (x < 1)
+        fun_l25_n275(x)
+    else
+        fun_l25_n762(x)
+    end
+end
+
+def fun_l24_n138(x)
+    if (x < 1)
+        fun_l25_n109(x)
+    else
+        fun_l25_n913(x)
+    end
+end
+
+def fun_l24_n139(x)
+    if (x < 1)
+        fun_l25_n731(x)
+    else
+        fun_l25_n767(x)
+    end
+end
+
+def fun_l24_n140(x)
+    if (x < 1)
+        fun_l25_n385(x)
+    else
+        fun_l25_n743(x)
+    end
+end
+
+def fun_l24_n141(x)
+    if (x < 1)
+        fun_l25_n518(x)
+    else
+        fun_l25_n185(x)
+    end
+end
+
+def fun_l24_n142(x)
+    if (x < 1)
+        fun_l25_n656(x)
+    else
+        fun_l25_n614(x)
+    end
+end
+
+def fun_l24_n143(x)
+    if (x < 1)
+        fun_l25_n86(x)
+    else
+        fun_l25_n825(x)
+    end
+end
+
+def fun_l24_n144(x)
+    if (x < 1)
+        fun_l25_n982(x)
+    else
+        fun_l25_n970(x)
+    end
+end
+
+def fun_l24_n145(x)
+    if (x < 1)
+        fun_l25_n608(x)
+    else
+        fun_l25_n970(x)
+    end
+end
+
+def fun_l24_n146(x)
+    if (x < 1)
+        fun_l25_n273(x)
+    else
+        fun_l25_n4(x)
+    end
+end
+
+def fun_l24_n147(x)
+    if (x < 1)
+        fun_l25_n366(x)
+    else
+        fun_l25_n902(x)
+    end
+end
+
+def fun_l24_n148(x)
+    if (x < 1)
+        fun_l25_n682(x)
+    else
+        fun_l25_n210(x)
+    end
+end
+
+def fun_l24_n149(x)
+    if (x < 1)
+        fun_l25_n212(x)
+    else
+        fun_l25_n429(x)
+    end
+end
+
+def fun_l24_n150(x)
+    if (x < 1)
+        fun_l25_n680(x)
+    else
+        fun_l25_n959(x)
+    end
+end
+
+def fun_l24_n151(x)
+    if (x < 1)
+        fun_l25_n65(x)
+    else
+        fun_l25_n654(x)
+    end
+end
+
+def fun_l24_n152(x)
+    if (x < 1)
+        fun_l25_n465(x)
+    else
+        fun_l25_n24(x)
+    end
+end
+
+def fun_l24_n153(x)
+    if (x < 1)
+        fun_l25_n254(x)
+    else
+        fun_l25_n611(x)
+    end
+end
+
+def fun_l24_n154(x)
+    if (x < 1)
+        fun_l25_n525(x)
+    else
+        fun_l25_n25(x)
+    end
+end
+
+def fun_l24_n155(x)
+    if (x < 1)
+        fun_l25_n967(x)
+    else
+        fun_l25_n163(x)
+    end
+end
+
+def fun_l24_n156(x)
+    if (x < 1)
+        fun_l25_n191(x)
+    else
+        fun_l25_n603(x)
+    end
+end
+
+def fun_l24_n157(x)
+    if (x < 1)
+        fun_l25_n724(x)
+    else
+        fun_l25_n537(x)
+    end
+end
+
+def fun_l24_n158(x)
+    if (x < 1)
+        fun_l25_n115(x)
+    else
+        fun_l25_n967(x)
+    end
+end
+
+def fun_l24_n159(x)
+    if (x < 1)
+        fun_l25_n247(x)
+    else
+        fun_l25_n650(x)
+    end
+end
+
+def fun_l24_n160(x)
+    if (x < 1)
+        fun_l25_n681(x)
+    else
+        fun_l25_n754(x)
+    end
+end
+
+def fun_l24_n161(x)
+    if (x < 1)
+        fun_l25_n689(x)
+    else
+        fun_l25_n283(x)
+    end
+end
+
+def fun_l24_n162(x)
+    if (x < 1)
+        fun_l25_n697(x)
+    else
+        fun_l25_n262(x)
+    end
+end
+
+def fun_l24_n163(x)
+    if (x < 1)
+        fun_l25_n584(x)
+    else
+        fun_l25_n502(x)
+    end
+end
+
+def fun_l24_n164(x)
+    if (x < 1)
+        fun_l25_n949(x)
+    else
+        fun_l25_n738(x)
+    end
+end
+
+def fun_l24_n165(x)
+    if (x < 1)
+        fun_l25_n847(x)
+    else
+        fun_l25_n317(x)
+    end
+end
+
+def fun_l24_n166(x)
+    if (x < 1)
+        fun_l25_n827(x)
+    else
+        fun_l25_n831(x)
+    end
+end
+
+def fun_l24_n167(x)
+    if (x < 1)
+        fun_l25_n400(x)
+    else
+        fun_l25_n60(x)
+    end
+end
+
+def fun_l24_n168(x)
+    if (x < 1)
+        fun_l25_n411(x)
+    else
+        fun_l25_n333(x)
+    end
+end
+
+def fun_l24_n169(x)
+    if (x < 1)
+        fun_l25_n481(x)
+    else
+        fun_l25_n336(x)
+    end
+end
+
+def fun_l24_n170(x)
+    if (x < 1)
+        fun_l25_n551(x)
+    else
+        fun_l25_n184(x)
+    end
+end
+
+def fun_l24_n171(x)
+    if (x < 1)
+        fun_l25_n700(x)
+    else
+        fun_l25_n542(x)
+    end
+end
+
+def fun_l24_n172(x)
+    if (x < 1)
+        fun_l25_n496(x)
+    else
+        fun_l25_n494(x)
+    end
+end
+
+def fun_l24_n173(x)
+    if (x < 1)
+        fun_l25_n684(x)
+    else
+        fun_l25_n865(x)
+    end
+end
+
+def fun_l24_n174(x)
+    if (x < 1)
+        fun_l25_n304(x)
+    else
+        fun_l25_n641(x)
+    end
+end
+
+def fun_l24_n175(x)
+    if (x < 1)
+        fun_l25_n252(x)
+    else
+        fun_l25_n573(x)
+    end
+end
+
+def fun_l24_n176(x)
+    if (x < 1)
+        fun_l25_n463(x)
+    else
+        fun_l25_n596(x)
+    end
+end
+
+def fun_l24_n177(x)
+    if (x < 1)
+        fun_l25_n864(x)
+    else
+        fun_l25_n810(x)
+    end
+end
+
+def fun_l24_n178(x)
+    if (x < 1)
+        fun_l25_n182(x)
+    else
+        fun_l25_n900(x)
+    end
+end
+
+def fun_l24_n179(x)
+    if (x < 1)
+        fun_l25_n678(x)
+    else
+        fun_l25_n299(x)
+    end
+end
+
+def fun_l24_n180(x)
+    if (x < 1)
+        fun_l25_n423(x)
+    else
+        fun_l25_n791(x)
+    end
+end
+
+def fun_l24_n181(x)
+    if (x < 1)
+        fun_l25_n582(x)
+    else
+        fun_l25_n382(x)
+    end
+end
+
+def fun_l24_n182(x)
+    if (x < 1)
+        fun_l25_n498(x)
+    else
+        fun_l25_n247(x)
+    end
+end
+
+def fun_l24_n183(x)
+    if (x < 1)
+        fun_l25_n534(x)
+    else
+        fun_l25_n504(x)
+    end
+end
+
+def fun_l24_n184(x)
+    if (x < 1)
+        fun_l25_n947(x)
+    else
+        fun_l25_n708(x)
+    end
+end
+
+def fun_l24_n185(x)
+    if (x < 1)
+        fun_l25_n673(x)
+    else
+        fun_l25_n711(x)
+    end
+end
+
+def fun_l24_n186(x)
+    if (x < 1)
+        fun_l25_n155(x)
+    else
+        fun_l25_n233(x)
+    end
+end
+
+def fun_l24_n187(x)
+    if (x < 1)
+        fun_l25_n669(x)
+    else
+        fun_l25_n558(x)
+    end
+end
+
+def fun_l24_n188(x)
+    if (x < 1)
+        fun_l25_n307(x)
+    else
+        fun_l25_n839(x)
+    end
+end
+
+def fun_l24_n189(x)
+    if (x < 1)
+        fun_l25_n623(x)
+    else
+        fun_l25_n17(x)
+    end
+end
+
+def fun_l24_n190(x)
+    if (x < 1)
+        fun_l25_n468(x)
+    else
+        fun_l25_n391(x)
+    end
+end
+
+def fun_l24_n191(x)
+    if (x < 1)
+        fun_l25_n492(x)
+    else
+        fun_l25_n953(x)
+    end
+end
+
+def fun_l24_n192(x)
+    if (x < 1)
+        fun_l25_n644(x)
+    else
+        fun_l25_n724(x)
+    end
+end
+
+def fun_l24_n193(x)
+    if (x < 1)
+        fun_l25_n438(x)
+    else
+        fun_l25_n110(x)
+    end
+end
+
+def fun_l24_n194(x)
+    if (x < 1)
+        fun_l25_n763(x)
+    else
+        fun_l25_n0(x)
+    end
+end
+
+def fun_l24_n195(x)
+    if (x < 1)
+        fun_l25_n766(x)
+    else
+        fun_l25_n436(x)
+    end
+end
+
+def fun_l24_n196(x)
+    if (x < 1)
+        fun_l25_n646(x)
+    else
+        fun_l25_n264(x)
+    end
+end
+
+def fun_l24_n197(x)
+    if (x < 1)
+        fun_l25_n140(x)
+    else
+        fun_l25_n387(x)
+    end
+end
+
+def fun_l24_n198(x)
+    if (x < 1)
+        fun_l25_n890(x)
+    else
+        fun_l25_n756(x)
+    end
+end
+
+def fun_l24_n199(x)
+    if (x < 1)
+        fun_l25_n597(x)
+    else
+        fun_l25_n330(x)
+    end
+end
+
+def fun_l24_n200(x)
+    if (x < 1)
+        fun_l25_n656(x)
+    else
+        fun_l25_n292(x)
+    end
+end
+
+def fun_l24_n201(x)
+    if (x < 1)
+        fun_l25_n224(x)
+    else
+        fun_l25_n233(x)
+    end
+end
+
+def fun_l24_n202(x)
+    if (x < 1)
+        fun_l25_n153(x)
+    else
+        fun_l25_n926(x)
+    end
+end
+
+def fun_l24_n203(x)
+    if (x < 1)
+        fun_l25_n897(x)
+    else
+        fun_l25_n680(x)
+    end
+end
+
+def fun_l24_n204(x)
+    if (x < 1)
+        fun_l25_n610(x)
+    else
+        fun_l25_n154(x)
+    end
+end
+
+def fun_l24_n205(x)
+    if (x < 1)
+        fun_l25_n307(x)
+    else
+        fun_l25_n451(x)
+    end
+end
+
+def fun_l24_n206(x)
+    if (x < 1)
+        fun_l25_n138(x)
+    else
+        fun_l25_n875(x)
+    end
+end
+
+def fun_l24_n207(x)
+    if (x < 1)
+        fun_l25_n306(x)
+    else
+        fun_l25_n474(x)
+    end
+end
+
+def fun_l24_n208(x)
+    if (x < 1)
+        fun_l25_n771(x)
+    else
+        fun_l25_n105(x)
+    end
+end
+
+def fun_l24_n209(x)
+    if (x < 1)
+        fun_l25_n120(x)
+    else
+        fun_l25_n961(x)
+    end
+end
+
+def fun_l24_n210(x)
+    if (x < 1)
+        fun_l25_n455(x)
+    else
+        fun_l25_n244(x)
+    end
+end
+
+def fun_l24_n211(x)
+    if (x < 1)
+        fun_l25_n93(x)
+    else
+        fun_l25_n31(x)
+    end
+end
+
+def fun_l24_n212(x)
+    if (x < 1)
+        fun_l25_n69(x)
+    else
+        fun_l25_n39(x)
+    end
+end
+
+def fun_l24_n213(x)
+    if (x < 1)
+        fun_l25_n379(x)
+    else
+        fun_l25_n482(x)
+    end
+end
+
+def fun_l24_n214(x)
+    if (x < 1)
+        fun_l25_n839(x)
+    else
+        fun_l25_n669(x)
+    end
+end
+
+def fun_l24_n215(x)
+    if (x < 1)
+        fun_l25_n27(x)
+    else
+        fun_l25_n46(x)
+    end
+end
+
+def fun_l24_n216(x)
+    if (x < 1)
+        fun_l25_n290(x)
+    else
+        fun_l25_n908(x)
+    end
+end
+
+def fun_l24_n217(x)
+    if (x < 1)
+        fun_l25_n618(x)
+    else
+        fun_l25_n242(x)
+    end
+end
+
+def fun_l24_n218(x)
+    if (x < 1)
+        fun_l25_n42(x)
+    else
+        fun_l25_n674(x)
+    end
+end
+
+def fun_l24_n219(x)
+    if (x < 1)
+        fun_l25_n510(x)
+    else
+        fun_l25_n963(x)
+    end
+end
+
+def fun_l24_n220(x)
+    if (x < 1)
+        fun_l25_n345(x)
+    else
+        fun_l25_n666(x)
+    end
+end
+
+def fun_l24_n221(x)
+    if (x < 1)
+        fun_l25_n548(x)
+    else
+        fun_l25_n424(x)
+    end
+end
+
+def fun_l24_n222(x)
+    if (x < 1)
+        fun_l25_n387(x)
+    else
+        fun_l25_n30(x)
+    end
+end
+
+def fun_l24_n223(x)
+    if (x < 1)
+        fun_l25_n124(x)
+    else
+        fun_l25_n374(x)
+    end
+end
+
+def fun_l24_n224(x)
+    if (x < 1)
+        fun_l25_n200(x)
+    else
+        fun_l25_n108(x)
+    end
+end
+
+def fun_l24_n225(x)
+    if (x < 1)
+        fun_l25_n462(x)
+    else
+        fun_l25_n11(x)
+    end
+end
+
+def fun_l24_n226(x)
+    if (x < 1)
+        fun_l25_n930(x)
+    else
+        fun_l25_n791(x)
+    end
+end
+
+def fun_l24_n227(x)
+    if (x < 1)
+        fun_l25_n10(x)
+    else
+        fun_l25_n447(x)
+    end
+end
+
+def fun_l24_n228(x)
+    if (x < 1)
+        fun_l25_n858(x)
+    else
+        fun_l25_n472(x)
+    end
+end
+
+def fun_l24_n229(x)
+    if (x < 1)
+        fun_l25_n409(x)
+    else
+        fun_l25_n228(x)
+    end
+end
+
+def fun_l24_n230(x)
+    if (x < 1)
+        fun_l25_n82(x)
+    else
+        fun_l25_n665(x)
+    end
+end
+
+def fun_l24_n231(x)
+    if (x < 1)
+        fun_l25_n148(x)
+    else
+        fun_l25_n174(x)
+    end
+end
+
+def fun_l24_n232(x)
+    if (x < 1)
+        fun_l25_n785(x)
+    else
+        fun_l25_n996(x)
+    end
+end
+
+def fun_l24_n233(x)
+    if (x < 1)
+        fun_l25_n827(x)
+    else
+        fun_l25_n393(x)
+    end
+end
+
+def fun_l24_n234(x)
+    if (x < 1)
+        fun_l25_n619(x)
+    else
+        fun_l25_n361(x)
+    end
+end
+
+def fun_l24_n235(x)
+    if (x < 1)
+        fun_l25_n52(x)
+    else
+        fun_l25_n420(x)
+    end
+end
+
+def fun_l24_n236(x)
+    if (x < 1)
+        fun_l25_n355(x)
+    else
+        fun_l25_n561(x)
+    end
+end
+
+def fun_l24_n237(x)
+    if (x < 1)
+        fun_l25_n36(x)
+    else
+        fun_l25_n885(x)
+    end
+end
+
+def fun_l24_n238(x)
+    if (x < 1)
+        fun_l25_n15(x)
+    else
+        fun_l25_n19(x)
+    end
+end
+
+def fun_l24_n239(x)
+    if (x < 1)
+        fun_l25_n137(x)
+    else
+        fun_l25_n34(x)
+    end
+end
+
+def fun_l24_n240(x)
+    if (x < 1)
+        fun_l25_n776(x)
+    else
+        fun_l25_n199(x)
+    end
+end
+
+def fun_l24_n241(x)
+    if (x < 1)
+        fun_l25_n904(x)
+    else
+        fun_l25_n396(x)
+    end
+end
+
+def fun_l24_n242(x)
+    if (x < 1)
+        fun_l25_n122(x)
+    else
+        fun_l25_n720(x)
+    end
+end
+
+def fun_l24_n243(x)
+    if (x < 1)
+        fun_l25_n513(x)
+    else
+        fun_l25_n429(x)
+    end
+end
+
+def fun_l24_n244(x)
+    if (x < 1)
+        fun_l25_n289(x)
+    else
+        fun_l25_n265(x)
+    end
+end
+
+def fun_l24_n245(x)
+    if (x < 1)
+        fun_l25_n334(x)
+    else
+        fun_l25_n42(x)
+    end
+end
+
+def fun_l24_n246(x)
+    if (x < 1)
+        fun_l25_n55(x)
+    else
+        fun_l25_n67(x)
+    end
+end
+
+def fun_l24_n247(x)
+    if (x < 1)
+        fun_l25_n648(x)
+    else
+        fun_l25_n38(x)
+    end
+end
+
+def fun_l24_n248(x)
+    if (x < 1)
+        fun_l25_n904(x)
+    else
+        fun_l25_n732(x)
+    end
+end
+
+def fun_l24_n249(x)
+    if (x < 1)
+        fun_l25_n243(x)
+    else
+        fun_l25_n704(x)
+    end
+end
+
+def fun_l24_n250(x)
+    if (x < 1)
+        fun_l25_n513(x)
+    else
+        fun_l25_n326(x)
+    end
+end
+
+def fun_l24_n251(x)
+    if (x < 1)
+        fun_l25_n122(x)
+    else
+        fun_l25_n617(x)
+    end
+end
+
+def fun_l24_n252(x)
+    if (x < 1)
+        fun_l25_n837(x)
+    else
+        fun_l25_n891(x)
+    end
+end
+
+def fun_l24_n253(x)
+    if (x < 1)
+        fun_l25_n39(x)
+    else
+        fun_l25_n318(x)
+    end
+end
+
+def fun_l24_n254(x)
+    if (x < 1)
+        fun_l25_n79(x)
+    else
+        fun_l25_n195(x)
+    end
+end
+
+def fun_l24_n255(x)
+    if (x < 1)
+        fun_l25_n671(x)
+    else
+        fun_l25_n485(x)
+    end
+end
+
+def fun_l24_n256(x)
+    if (x < 1)
+        fun_l25_n775(x)
+    else
+        fun_l25_n187(x)
+    end
+end
+
+def fun_l24_n257(x)
+    if (x < 1)
+        fun_l25_n150(x)
+    else
+        fun_l25_n740(x)
+    end
+end
+
+def fun_l24_n258(x)
+    if (x < 1)
+        fun_l25_n131(x)
+    else
+        fun_l25_n960(x)
+    end
+end
+
+def fun_l24_n259(x)
+    if (x < 1)
+        fun_l25_n608(x)
+    else
+        fun_l25_n931(x)
+    end
+end
+
+def fun_l24_n260(x)
+    if (x < 1)
+        fun_l25_n846(x)
+    else
+        fun_l25_n278(x)
+    end
+end
+
+def fun_l24_n261(x)
+    if (x < 1)
+        fun_l25_n532(x)
+    else
+        fun_l25_n432(x)
+    end
+end
+
+def fun_l24_n262(x)
+    if (x < 1)
+        fun_l25_n367(x)
+    else
+        fun_l25_n847(x)
+    end
+end
+
+def fun_l24_n263(x)
+    if (x < 1)
+        fun_l25_n782(x)
+    else
+        fun_l25_n33(x)
+    end
+end
+
+def fun_l24_n264(x)
+    if (x < 1)
+        fun_l25_n822(x)
+    else
+        fun_l25_n711(x)
+    end
+end
+
+def fun_l24_n265(x)
+    if (x < 1)
+        fun_l25_n994(x)
+    else
+        fun_l25_n573(x)
+    end
+end
+
+def fun_l24_n266(x)
+    if (x < 1)
+        fun_l25_n234(x)
+    else
+        fun_l25_n617(x)
+    end
+end
+
+def fun_l24_n267(x)
+    if (x < 1)
+        fun_l25_n52(x)
+    else
+        fun_l25_n759(x)
+    end
+end
+
+def fun_l24_n268(x)
+    if (x < 1)
+        fun_l25_n161(x)
+    else
+        fun_l25_n167(x)
+    end
+end
+
+def fun_l24_n269(x)
+    if (x < 1)
+        fun_l25_n113(x)
+    else
+        fun_l25_n158(x)
+    end
+end
+
+def fun_l24_n270(x)
+    if (x < 1)
+        fun_l25_n151(x)
+    else
+        fun_l25_n127(x)
+    end
+end
+
+def fun_l24_n271(x)
+    if (x < 1)
+        fun_l25_n811(x)
+    else
+        fun_l25_n81(x)
+    end
+end
+
+def fun_l24_n272(x)
+    if (x < 1)
+        fun_l25_n622(x)
+    else
+        fun_l25_n796(x)
+    end
+end
+
+def fun_l24_n273(x)
+    if (x < 1)
+        fun_l25_n106(x)
+    else
+        fun_l25_n697(x)
+    end
+end
+
+def fun_l24_n274(x)
+    if (x < 1)
+        fun_l25_n63(x)
+    else
+        fun_l25_n599(x)
+    end
+end
+
+def fun_l24_n275(x)
+    if (x < 1)
+        fun_l25_n999(x)
+    else
+        fun_l25_n188(x)
+    end
+end
+
+def fun_l24_n276(x)
+    if (x < 1)
+        fun_l25_n491(x)
+    else
+        fun_l25_n614(x)
+    end
+end
+
+def fun_l24_n277(x)
+    if (x < 1)
+        fun_l25_n549(x)
+    else
+        fun_l25_n141(x)
+    end
+end
+
+def fun_l24_n278(x)
+    if (x < 1)
+        fun_l25_n442(x)
+    else
+        fun_l25_n900(x)
+    end
+end
+
+def fun_l24_n279(x)
+    if (x < 1)
+        fun_l25_n816(x)
+    else
+        fun_l25_n904(x)
+    end
+end
+
+def fun_l24_n280(x)
+    if (x < 1)
+        fun_l25_n508(x)
+    else
+        fun_l25_n569(x)
+    end
+end
+
+def fun_l24_n281(x)
+    if (x < 1)
+        fun_l25_n438(x)
+    else
+        fun_l25_n750(x)
+    end
+end
+
+def fun_l24_n282(x)
+    if (x < 1)
+        fun_l25_n984(x)
+    else
+        fun_l25_n573(x)
+    end
+end
+
+def fun_l24_n283(x)
+    if (x < 1)
+        fun_l25_n425(x)
+    else
+        fun_l25_n963(x)
+    end
+end
+
+def fun_l24_n284(x)
+    if (x < 1)
+        fun_l25_n213(x)
+    else
+        fun_l25_n344(x)
+    end
+end
+
+def fun_l24_n285(x)
+    if (x < 1)
+        fun_l25_n1(x)
+    else
+        fun_l25_n826(x)
+    end
+end
+
+def fun_l24_n286(x)
+    if (x < 1)
+        fun_l25_n297(x)
+    else
+        fun_l25_n266(x)
+    end
+end
+
+def fun_l24_n287(x)
+    if (x < 1)
+        fun_l25_n203(x)
+    else
+        fun_l25_n570(x)
+    end
+end
+
+def fun_l24_n288(x)
+    if (x < 1)
+        fun_l25_n849(x)
+    else
+        fun_l25_n336(x)
+    end
+end
+
+def fun_l24_n289(x)
+    if (x < 1)
+        fun_l25_n982(x)
+    else
+        fun_l25_n38(x)
+    end
+end
+
+def fun_l24_n290(x)
+    if (x < 1)
+        fun_l25_n687(x)
+    else
+        fun_l25_n906(x)
+    end
+end
+
+def fun_l24_n291(x)
+    if (x < 1)
+        fun_l25_n921(x)
+    else
+        fun_l25_n229(x)
+    end
+end
+
+def fun_l24_n292(x)
+    if (x < 1)
+        fun_l25_n494(x)
+    else
+        fun_l25_n138(x)
+    end
+end
+
+def fun_l24_n293(x)
+    if (x < 1)
+        fun_l25_n175(x)
+    else
+        fun_l25_n575(x)
+    end
+end
+
+def fun_l24_n294(x)
+    if (x < 1)
+        fun_l25_n126(x)
+    else
+        fun_l25_n902(x)
+    end
+end
+
+def fun_l24_n295(x)
+    if (x < 1)
+        fun_l25_n634(x)
+    else
+        fun_l25_n199(x)
+    end
+end
+
+def fun_l24_n296(x)
+    if (x < 1)
+        fun_l25_n929(x)
+    else
+        fun_l25_n468(x)
+    end
+end
+
+def fun_l24_n297(x)
+    if (x < 1)
+        fun_l25_n856(x)
+    else
+        fun_l25_n135(x)
+    end
+end
+
+def fun_l24_n298(x)
+    if (x < 1)
+        fun_l25_n655(x)
+    else
+        fun_l25_n545(x)
+    end
+end
+
+def fun_l24_n299(x)
+    if (x < 1)
+        fun_l25_n373(x)
+    else
+        fun_l25_n173(x)
+    end
+end
+
+def fun_l24_n300(x)
+    if (x < 1)
+        fun_l25_n874(x)
+    else
+        fun_l25_n85(x)
+    end
+end
+
+def fun_l24_n301(x)
+    if (x < 1)
+        fun_l25_n398(x)
+    else
+        fun_l25_n43(x)
+    end
+end
+
+def fun_l24_n302(x)
+    if (x < 1)
+        fun_l25_n995(x)
+    else
+        fun_l25_n890(x)
+    end
+end
+
+def fun_l24_n303(x)
+    if (x < 1)
+        fun_l25_n971(x)
+    else
+        fun_l25_n250(x)
+    end
+end
+
+def fun_l24_n304(x)
+    if (x < 1)
+        fun_l25_n752(x)
+    else
+        fun_l25_n681(x)
+    end
+end
+
+def fun_l24_n305(x)
+    if (x < 1)
+        fun_l25_n688(x)
+    else
+        fun_l25_n451(x)
+    end
+end
+
+def fun_l24_n306(x)
+    if (x < 1)
+        fun_l25_n167(x)
+    else
+        fun_l25_n784(x)
+    end
+end
+
+def fun_l24_n307(x)
+    if (x < 1)
+        fun_l25_n479(x)
+    else
+        fun_l25_n295(x)
+    end
+end
+
+def fun_l24_n308(x)
+    if (x < 1)
+        fun_l25_n779(x)
+    else
+        fun_l25_n472(x)
+    end
+end
+
+def fun_l24_n309(x)
+    if (x < 1)
+        fun_l25_n10(x)
+    else
+        fun_l25_n301(x)
+    end
+end
+
+def fun_l24_n310(x)
+    if (x < 1)
+        fun_l25_n197(x)
+    else
+        fun_l25_n152(x)
+    end
+end
+
+def fun_l24_n311(x)
+    if (x < 1)
+        fun_l25_n300(x)
+    else
+        fun_l25_n105(x)
+    end
+end
+
+def fun_l24_n312(x)
+    if (x < 1)
+        fun_l25_n1(x)
+    else
+        fun_l25_n956(x)
+    end
+end
+
+def fun_l24_n313(x)
+    if (x < 1)
+        fun_l25_n310(x)
+    else
+        fun_l25_n701(x)
+    end
+end
+
+def fun_l24_n314(x)
+    if (x < 1)
+        fun_l25_n0(x)
+    else
+        fun_l25_n58(x)
+    end
+end
+
+def fun_l24_n315(x)
+    if (x < 1)
+        fun_l25_n31(x)
+    else
+        fun_l25_n69(x)
+    end
+end
+
+def fun_l24_n316(x)
+    if (x < 1)
+        fun_l25_n967(x)
+    else
+        fun_l25_n130(x)
+    end
+end
+
+def fun_l24_n317(x)
+    if (x < 1)
+        fun_l25_n995(x)
+    else
+        fun_l25_n630(x)
+    end
+end
+
+def fun_l24_n318(x)
+    if (x < 1)
+        fun_l25_n349(x)
+    else
+        fun_l25_n916(x)
+    end
+end
+
+def fun_l24_n319(x)
+    if (x < 1)
+        fun_l25_n230(x)
+    else
+        fun_l25_n880(x)
+    end
+end
+
+def fun_l24_n320(x)
+    if (x < 1)
+        fun_l25_n452(x)
+    else
+        fun_l25_n316(x)
+    end
+end
+
+def fun_l24_n321(x)
+    if (x < 1)
+        fun_l25_n581(x)
+    else
+        fun_l25_n262(x)
+    end
+end
+
+def fun_l24_n322(x)
+    if (x < 1)
+        fun_l25_n70(x)
+    else
+        fun_l25_n674(x)
+    end
+end
+
+def fun_l24_n323(x)
+    if (x < 1)
+        fun_l25_n726(x)
+    else
+        fun_l25_n943(x)
+    end
+end
+
+def fun_l24_n324(x)
+    if (x < 1)
+        fun_l25_n779(x)
+    else
+        fun_l25_n209(x)
+    end
+end
+
+def fun_l24_n325(x)
+    if (x < 1)
+        fun_l25_n132(x)
+    else
+        fun_l25_n301(x)
+    end
+end
+
+def fun_l24_n326(x)
+    if (x < 1)
+        fun_l25_n255(x)
+    else
+        fun_l25_n154(x)
+    end
+end
+
+def fun_l24_n327(x)
+    if (x < 1)
+        fun_l25_n248(x)
+    else
+        fun_l25_n152(x)
+    end
+end
+
+def fun_l24_n328(x)
+    if (x < 1)
+        fun_l25_n536(x)
+    else
+        fun_l25_n703(x)
+    end
+end
+
+def fun_l24_n329(x)
+    if (x < 1)
+        fun_l25_n744(x)
+    else
+        fun_l25_n133(x)
+    end
+end
+
+def fun_l24_n330(x)
+    if (x < 1)
+        fun_l25_n455(x)
+    else
+        fun_l25_n576(x)
+    end
+end
+
+def fun_l24_n331(x)
+    if (x < 1)
+        fun_l25_n590(x)
+    else
+        fun_l25_n357(x)
+    end
+end
+
+def fun_l24_n332(x)
+    if (x < 1)
+        fun_l25_n151(x)
+    else
+        fun_l25_n969(x)
+    end
+end
+
+def fun_l24_n333(x)
+    if (x < 1)
+        fun_l25_n725(x)
+    else
+        fun_l25_n681(x)
+    end
+end
+
+def fun_l24_n334(x)
+    if (x < 1)
+        fun_l25_n157(x)
+    else
+        fun_l25_n643(x)
+    end
+end
+
+def fun_l24_n335(x)
+    if (x < 1)
+        fun_l25_n42(x)
+    else
+        fun_l25_n749(x)
+    end
+end
+
+def fun_l24_n336(x)
+    if (x < 1)
+        fun_l25_n831(x)
+    else
+        fun_l25_n126(x)
+    end
+end
+
+def fun_l24_n337(x)
+    if (x < 1)
+        fun_l25_n424(x)
+    else
+        fun_l25_n559(x)
+    end
+end
+
+def fun_l24_n338(x)
+    if (x < 1)
+        fun_l25_n897(x)
+    else
+        fun_l25_n89(x)
+    end
+end
+
+def fun_l24_n339(x)
+    if (x < 1)
+        fun_l25_n755(x)
+    else
+        fun_l25_n506(x)
+    end
+end
+
+def fun_l24_n340(x)
+    if (x < 1)
+        fun_l25_n387(x)
+    else
+        fun_l25_n631(x)
+    end
+end
+
+def fun_l24_n341(x)
+    if (x < 1)
+        fun_l25_n694(x)
+    else
+        fun_l25_n707(x)
+    end
+end
+
+def fun_l24_n342(x)
+    if (x < 1)
+        fun_l25_n65(x)
+    else
+        fun_l25_n687(x)
+    end
+end
+
+def fun_l24_n343(x)
+    if (x < 1)
+        fun_l25_n84(x)
+    else
+        fun_l25_n738(x)
+    end
+end
+
+def fun_l24_n344(x)
+    if (x < 1)
+        fun_l25_n729(x)
+    else
+        fun_l25_n639(x)
+    end
+end
+
+def fun_l24_n345(x)
+    if (x < 1)
+        fun_l25_n102(x)
+    else
+        fun_l25_n299(x)
+    end
+end
+
+def fun_l24_n346(x)
+    if (x < 1)
+        fun_l25_n604(x)
+    else
+        fun_l25_n94(x)
+    end
+end
+
+def fun_l24_n347(x)
+    if (x < 1)
+        fun_l25_n93(x)
+    else
+        fun_l25_n975(x)
+    end
+end
+
+def fun_l24_n348(x)
+    if (x < 1)
+        fun_l25_n124(x)
+    else
+        fun_l25_n927(x)
+    end
+end
+
+def fun_l24_n349(x)
+    if (x < 1)
+        fun_l25_n944(x)
+    else
+        fun_l25_n162(x)
+    end
+end
+
+def fun_l24_n350(x)
+    if (x < 1)
+        fun_l25_n623(x)
+    else
+        fun_l25_n5(x)
+    end
+end
+
+def fun_l24_n351(x)
+    if (x < 1)
+        fun_l25_n885(x)
+    else
+        fun_l25_n884(x)
+    end
+end
+
+def fun_l24_n352(x)
+    if (x < 1)
+        fun_l25_n1(x)
+    else
+        fun_l25_n366(x)
+    end
+end
+
+def fun_l24_n353(x)
+    if (x < 1)
+        fun_l25_n240(x)
+    else
+        fun_l25_n630(x)
+    end
+end
+
+def fun_l24_n354(x)
+    if (x < 1)
+        fun_l25_n232(x)
+    else
+        fun_l25_n758(x)
+    end
+end
+
+def fun_l24_n355(x)
+    if (x < 1)
+        fun_l25_n529(x)
+    else
+        fun_l25_n810(x)
+    end
+end
+
+def fun_l24_n356(x)
+    if (x < 1)
+        fun_l25_n438(x)
+    else
+        fun_l25_n146(x)
+    end
+end
+
+def fun_l24_n357(x)
+    if (x < 1)
+        fun_l25_n551(x)
+    else
+        fun_l25_n727(x)
+    end
+end
+
+def fun_l24_n358(x)
+    if (x < 1)
+        fun_l25_n764(x)
+    else
+        fun_l25_n379(x)
+    end
+end
+
+def fun_l24_n359(x)
+    if (x < 1)
+        fun_l25_n89(x)
+    else
+        fun_l25_n518(x)
+    end
+end
+
+def fun_l24_n360(x)
+    if (x < 1)
+        fun_l25_n567(x)
+    else
+        fun_l25_n98(x)
+    end
+end
+
+def fun_l24_n361(x)
+    if (x < 1)
+        fun_l25_n26(x)
+    else
+        fun_l25_n818(x)
+    end
+end
+
+def fun_l24_n362(x)
+    if (x < 1)
+        fun_l25_n205(x)
+    else
+        fun_l25_n460(x)
+    end
+end
+
+def fun_l24_n363(x)
+    if (x < 1)
+        fun_l25_n19(x)
+    else
+        fun_l25_n134(x)
+    end
+end
+
+def fun_l24_n364(x)
+    if (x < 1)
+        fun_l25_n221(x)
+    else
+        fun_l25_n391(x)
+    end
+end
+
+def fun_l24_n365(x)
+    if (x < 1)
+        fun_l25_n546(x)
+    else
+        fun_l25_n62(x)
+    end
+end
+
+def fun_l24_n366(x)
+    if (x < 1)
+        fun_l25_n412(x)
+    else
+        fun_l25_n593(x)
+    end
+end
+
+def fun_l24_n367(x)
+    if (x < 1)
+        fun_l25_n576(x)
+    else
+        fun_l25_n798(x)
+    end
+end
+
+def fun_l24_n368(x)
+    if (x < 1)
+        fun_l25_n528(x)
+    else
+        fun_l25_n575(x)
+    end
+end
+
+def fun_l24_n369(x)
+    if (x < 1)
+        fun_l25_n914(x)
+    else
+        fun_l25_n417(x)
+    end
+end
+
+def fun_l24_n370(x)
+    if (x < 1)
+        fun_l25_n397(x)
+    else
+        fun_l25_n684(x)
+    end
+end
+
+def fun_l24_n371(x)
+    if (x < 1)
+        fun_l25_n827(x)
+    else
+        fun_l25_n677(x)
+    end
+end
+
+def fun_l24_n372(x)
+    if (x < 1)
+        fun_l25_n256(x)
+    else
+        fun_l25_n841(x)
+    end
+end
+
+def fun_l24_n373(x)
+    if (x < 1)
+        fun_l25_n671(x)
+    else
+        fun_l25_n712(x)
+    end
+end
+
+def fun_l24_n374(x)
+    if (x < 1)
+        fun_l25_n696(x)
+    else
+        fun_l25_n598(x)
+    end
+end
+
+def fun_l24_n375(x)
+    if (x < 1)
+        fun_l25_n384(x)
+    else
+        fun_l25_n426(x)
+    end
+end
+
+def fun_l24_n376(x)
+    if (x < 1)
+        fun_l25_n578(x)
+    else
+        fun_l25_n555(x)
+    end
+end
+
+def fun_l24_n377(x)
+    if (x < 1)
+        fun_l25_n290(x)
+    else
+        fun_l25_n480(x)
+    end
+end
+
+def fun_l24_n378(x)
+    if (x < 1)
+        fun_l25_n481(x)
+    else
+        fun_l25_n647(x)
+    end
+end
+
+def fun_l24_n379(x)
+    if (x < 1)
+        fun_l25_n502(x)
+    else
+        fun_l25_n985(x)
+    end
+end
+
+def fun_l24_n380(x)
+    if (x < 1)
+        fun_l25_n275(x)
+    else
+        fun_l25_n575(x)
+    end
+end
+
+def fun_l24_n381(x)
+    if (x < 1)
+        fun_l25_n901(x)
+    else
+        fun_l25_n396(x)
+    end
+end
+
+def fun_l24_n382(x)
+    if (x < 1)
+        fun_l25_n283(x)
+    else
+        fun_l25_n544(x)
+    end
+end
+
+def fun_l24_n383(x)
+    if (x < 1)
+        fun_l25_n192(x)
+    else
+        fun_l25_n953(x)
+    end
+end
+
+def fun_l24_n384(x)
+    if (x < 1)
+        fun_l25_n862(x)
+    else
+        fun_l25_n264(x)
+    end
+end
+
+def fun_l24_n385(x)
+    if (x < 1)
+        fun_l25_n528(x)
+    else
+        fun_l25_n429(x)
+    end
+end
+
+def fun_l24_n386(x)
+    if (x < 1)
+        fun_l25_n29(x)
+    else
+        fun_l25_n831(x)
+    end
+end
+
+def fun_l24_n387(x)
+    if (x < 1)
+        fun_l25_n152(x)
+    else
+        fun_l25_n902(x)
+    end
+end
+
+def fun_l24_n388(x)
+    if (x < 1)
+        fun_l25_n538(x)
+    else
+        fun_l25_n468(x)
+    end
+end
+
+def fun_l24_n389(x)
+    if (x < 1)
+        fun_l25_n772(x)
+    else
+        fun_l25_n105(x)
+    end
+end
+
+def fun_l24_n390(x)
+    if (x < 1)
+        fun_l25_n875(x)
+    else
+        fun_l25_n723(x)
+    end
+end
+
+def fun_l24_n391(x)
+    if (x < 1)
+        fun_l25_n330(x)
+    else
+        fun_l25_n659(x)
+    end
+end
+
+def fun_l24_n392(x)
+    if (x < 1)
+        fun_l25_n168(x)
+    else
+        fun_l25_n68(x)
+    end
+end
+
+def fun_l24_n393(x)
+    if (x < 1)
+        fun_l25_n481(x)
+    else
+        fun_l25_n200(x)
+    end
+end
+
+def fun_l24_n394(x)
+    if (x < 1)
+        fun_l25_n391(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n395(x)
+    if (x < 1)
+        fun_l25_n383(x)
+    else
+        fun_l25_n250(x)
+    end
+end
+
+def fun_l24_n396(x)
+    if (x < 1)
+        fun_l25_n537(x)
+    else
+        fun_l25_n283(x)
+    end
+end
+
+def fun_l24_n397(x)
+    if (x < 1)
+        fun_l25_n504(x)
+    else
+        fun_l25_n916(x)
+    end
+end
+
+def fun_l24_n398(x)
+    if (x < 1)
+        fun_l25_n992(x)
+    else
+        fun_l25_n504(x)
+    end
+end
+
+def fun_l24_n399(x)
+    if (x < 1)
+        fun_l25_n294(x)
+    else
+        fun_l25_n412(x)
+    end
+end
+
+def fun_l24_n400(x)
+    if (x < 1)
+        fun_l25_n686(x)
+    else
+        fun_l25_n85(x)
+    end
+end
+
+def fun_l24_n401(x)
+    if (x < 1)
+        fun_l25_n874(x)
+    else
+        fun_l25_n980(x)
+    end
+end
+
+def fun_l24_n402(x)
+    if (x < 1)
+        fun_l25_n454(x)
+    else
+        fun_l25_n867(x)
+    end
+end
+
+def fun_l24_n403(x)
+    if (x < 1)
+        fun_l25_n594(x)
+    else
+        fun_l25_n970(x)
+    end
+end
+
+def fun_l24_n404(x)
+    if (x < 1)
+        fun_l25_n281(x)
+    else
+        fun_l25_n881(x)
+    end
+end
+
+def fun_l24_n405(x)
+    if (x < 1)
+        fun_l25_n713(x)
+    else
+        fun_l25_n530(x)
+    end
+end
+
+def fun_l24_n406(x)
+    if (x < 1)
+        fun_l25_n874(x)
+    else
+        fun_l25_n953(x)
+    end
+end
+
+def fun_l24_n407(x)
+    if (x < 1)
+        fun_l25_n569(x)
+    else
+        fun_l25_n991(x)
+    end
+end
+
+def fun_l24_n408(x)
+    if (x < 1)
+        fun_l25_n875(x)
+    else
+        fun_l25_n409(x)
+    end
+end
+
+def fun_l24_n409(x)
+    if (x < 1)
+        fun_l25_n604(x)
+    else
+        fun_l25_n454(x)
+    end
+end
+
+def fun_l24_n410(x)
+    if (x < 1)
+        fun_l25_n267(x)
+    else
+        fun_l25_n100(x)
+    end
+end
+
+def fun_l24_n411(x)
+    if (x < 1)
+        fun_l25_n966(x)
+    else
+        fun_l25_n537(x)
+    end
+end
+
+def fun_l24_n412(x)
+    if (x < 1)
+        fun_l25_n261(x)
+    else
+        fun_l25_n106(x)
+    end
+end
+
+def fun_l24_n413(x)
+    if (x < 1)
+        fun_l25_n869(x)
+    else
+        fun_l25_n890(x)
+    end
+end
+
+def fun_l24_n414(x)
+    if (x < 1)
+        fun_l25_n784(x)
+    else
+        fun_l25_n147(x)
+    end
+end
+
+def fun_l24_n415(x)
+    if (x < 1)
+        fun_l25_n6(x)
+    else
+        fun_l25_n808(x)
+    end
+end
+
+def fun_l24_n416(x)
+    if (x < 1)
+        fun_l25_n940(x)
+    else
+        fun_l25_n680(x)
+    end
+end
+
+def fun_l24_n417(x)
+    if (x < 1)
+        fun_l25_n3(x)
+    else
+        fun_l25_n799(x)
+    end
+end
+
+def fun_l24_n418(x)
+    if (x < 1)
+        fun_l25_n196(x)
+    else
+        fun_l25_n785(x)
+    end
+end
+
+def fun_l24_n419(x)
+    if (x < 1)
+        fun_l25_n786(x)
+    else
+        fun_l25_n607(x)
+    end
+end
+
+def fun_l24_n420(x)
+    if (x < 1)
+        fun_l25_n720(x)
+    else
+        fun_l25_n74(x)
+    end
+end
+
+def fun_l24_n421(x)
+    if (x < 1)
+        fun_l25_n962(x)
+    else
+        fun_l25_n489(x)
+    end
+end
+
+def fun_l24_n422(x)
+    if (x < 1)
+        fun_l25_n231(x)
+    else
+        fun_l25_n878(x)
+    end
+end
+
+def fun_l24_n423(x)
+    if (x < 1)
+        fun_l25_n720(x)
+    else
+        fun_l25_n988(x)
+    end
+end
+
+def fun_l24_n424(x)
+    if (x < 1)
+        fun_l25_n883(x)
+    else
+        fun_l25_n510(x)
+    end
+end
+
+def fun_l24_n425(x)
+    if (x < 1)
+        fun_l25_n443(x)
+    else
+        fun_l25_n533(x)
+    end
+end
+
+def fun_l24_n426(x)
+    if (x < 1)
+        fun_l25_n541(x)
+    else
+        fun_l25_n747(x)
+    end
+end
+
+def fun_l24_n427(x)
+    if (x < 1)
+        fun_l25_n308(x)
+    else
+        fun_l25_n373(x)
+    end
+end
+
+def fun_l24_n428(x)
+    if (x < 1)
+        fun_l25_n484(x)
+    else
+        fun_l25_n632(x)
+    end
+end
+
+def fun_l24_n429(x)
+    if (x < 1)
+        fun_l25_n777(x)
+    else
+        fun_l25_n128(x)
+    end
+end
+
+def fun_l24_n430(x)
+    if (x < 1)
+        fun_l25_n729(x)
+    else
+        fun_l25_n644(x)
+    end
+end
+
+def fun_l24_n431(x)
+    if (x < 1)
+        fun_l25_n330(x)
+    else
+        fun_l25_n947(x)
+    end
+end
+
+def fun_l24_n432(x)
+    if (x < 1)
+        fun_l25_n929(x)
+    else
+        fun_l25_n80(x)
+    end
+end
+
+def fun_l24_n433(x)
+    if (x < 1)
+        fun_l25_n269(x)
+    else
+        fun_l25_n307(x)
+    end
+end
+
+def fun_l24_n434(x)
+    if (x < 1)
+        fun_l25_n824(x)
+    else
+        fun_l25_n451(x)
+    end
+end
+
+def fun_l24_n435(x)
+    if (x < 1)
+        fun_l25_n93(x)
+    else
+        fun_l25_n198(x)
+    end
+end
+
+def fun_l24_n436(x)
+    if (x < 1)
+        fun_l25_n359(x)
+    else
+        fun_l25_n412(x)
+    end
+end
+
+def fun_l24_n437(x)
+    if (x < 1)
+        fun_l25_n427(x)
+    else
+        fun_l25_n321(x)
+    end
+end
+
+def fun_l24_n438(x)
+    if (x < 1)
+        fun_l25_n765(x)
+    else
+        fun_l25_n223(x)
+    end
+end
+
+def fun_l24_n439(x)
+    if (x < 1)
+        fun_l25_n918(x)
+    else
+        fun_l25_n902(x)
+    end
+end
+
+def fun_l24_n440(x)
+    if (x < 1)
+        fun_l25_n320(x)
+    else
+        fun_l25_n428(x)
+    end
+end
+
+def fun_l24_n441(x)
+    if (x < 1)
+        fun_l25_n159(x)
+    else
+        fun_l25_n857(x)
+    end
+end
+
+def fun_l24_n442(x)
+    if (x < 1)
+        fun_l25_n505(x)
+    else
+        fun_l25_n565(x)
+    end
+end
+
+def fun_l24_n443(x)
+    if (x < 1)
+        fun_l25_n214(x)
+    else
+        fun_l25_n861(x)
+    end
+end
+
+def fun_l24_n444(x)
+    if (x < 1)
+        fun_l25_n185(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n445(x)
+    if (x < 1)
+        fun_l25_n198(x)
+    else
+        fun_l25_n314(x)
+    end
+end
+
+def fun_l24_n446(x)
+    if (x < 1)
+        fun_l25_n334(x)
+    else
+        fun_l25_n633(x)
+    end
+end
+
+def fun_l24_n447(x)
+    if (x < 1)
+        fun_l25_n972(x)
+    else
+        fun_l25_n671(x)
+    end
+end
+
+def fun_l24_n448(x)
+    if (x < 1)
+        fun_l25_n608(x)
+    else
+        fun_l25_n720(x)
+    end
+end
+
+def fun_l24_n449(x)
+    if (x < 1)
+        fun_l25_n71(x)
+    else
+        fun_l25_n479(x)
+    end
+end
+
+def fun_l24_n450(x)
+    if (x < 1)
+        fun_l25_n689(x)
+    else
+        fun_l25_n716(x)
+    end
+end
+
+def fun_l24_n451(x)
+    if (x < 1)
+        fun_l25_n696(x)
+    else
+        fun_l25_n453(x)
+    end
+end
+
+def fun_l24_n452(x)
+    if (x < 1)
+        fun_l25_n804(x)
+    else
+        fun_l25_n508(x)
+    end
+end
+
+def fun_l24_n453(x)
+    if (x < 1)
+        fun_l25_n32(x)
+    else
+        fun_l25_n180(x)
+    end
+end
+
+def fun_l24_n454(x)
+    if (x < 1)
+        fun_l25_n493(x)
+    else
+        fun_l25_n200(x)
+    end
+end
+
+def fun_l24_n455(x)
+    if (x < 1)
+        fun_l25_n763(x)
+    else
+        fun_l25_n362(x)
+    end
+end
+
+def fun_l24_n456(x)
+    if (x < 1)
+        fun_l25_n488(x)
+    else
+        fun_l25_n202(x)
+    end
+end
+
+def fun_l24_n457(x)
+    if (x < 1)
+        fun_l25_n752(x)
+    else
+        fun_l25_n670(x)
+    end
+end
+
+def fun_l24_n458(x)
+    if (x < 1)
+        fun_l25_n462(x)
+    else
+        fun_l25_n457(x)
+    end
+end
+
+def fun_l24_n459(x)
+    if (x < 1)
+        fun_l25_n266(x)
+    else
+        fun_l25_n455(x)
+    end
+end
+
+def fun_l24_n460(x)
+    if (x < 1)
+        fun_l25_n173(x)
+    else
+        fun_l25_n873(x)
+    end
+end
+
+def fun_l24_n461(x)
+    if (x < 1)
+        fun_l25_n127(x)
+    else
+        fun_l25_n213(x)
+    end
+end
+
+def fun_l24_n462(x)
+    if (x < 1)
+        fun_l25_n579(x)
+    else
+        fun_l25_n44(x)
+    end
+end
+
+def fun_l24_n463(x)
+    if (x < 1)
+        fun_l25_n68(x)
+    else
+        fun_l25_n989(x)
+    end
+end
+
+def fun_l24_n464(x)
+    if (x < 1)
+        fun_l25_n826(x)
+    else
+        fun_l25_n883(x)
+    end
+end
+
+def fun_l24_n465(x)
+    if (x < 1)
+        fun_l25_n855(x)
+    else
+        fun_l25_n131(x)
+    end
+end
+
+def fun_l24_n466(x)
+    if (x < 1)
+        fun_l25_n923(x)
+    else
+        fun_l25_n433(x)
+    end
+end
+
+def fun_l24_n467(x)
+    if (x < 1)
+        fun_l25_n84(x)
+    else
+        fun_l25_n648(x)
+    end
+end
+
+def fun_l24_n468(x)
+    if (x < 1)
+        fun_l25_n53(x)
+    else
+        fun_l25_n766(x)
+    end
+end
+
+def fun_l24_n469(x)
+    if (x < 1)
+        fun_l25_n689(x)
+    else
+        fun_l25_n201(x)
+    end
+end
+
+def fun_l24_n470(x)
+    if (x < 1)
+        fun_l25_n361(x)
+    else
+        fun_l25_n459(x)
+    end
+end
+
+def fun_l24_n471(x)
+    if (x < 1)
+        fun_l25_n550(x)
+    else
+        fun_l25_n522(x)
+    end
+end
+
+def fun_l24_n472(x)
+    if (x < 1)
+        fun_l25_n128(x)
+    else
+        fun_l25_n417(x)
+    end
+end
+
+def fun_l24_n473(x)
+    if (x < 1)
+        fun_l25_n600(x)
+    else
+        fun_l25_n137(x)
+    end
+end
+
+def fun_l24_n474(x)
+    if (x < 1)
+        fun_l25_n72(x)
+    else
+        fun_l25_n548(x)
+    end
+end
+
+def fun_l24_n475(x)
+    if (x < 1)
+        fun_l25_n879(x)
+    else
+        fun_l25_n376(x)
+    end
+end
+
+def fun_l24_n476(x)
+    if (x < 1)
+        fun_l25_n822(x)
+    else
+        fun_l25_n695(x)
+    end
+end
+
+def fun_l24_n477(x)
+    if (x < 1)
+        fun_l25_n991(x)
+    else
+        fun_l25_n208(x)
+    end
+end
+
+def fun_l24_n478(x)
+    if (x < 1)
+        fun_l25_n17(x)
+    else
+        fun_l25_n332(x)
+    end
+end
+
+def fun_l24_n479(x)
+    if (x < 1)
+        fun_l25_n353(x)
+    else
+        fun_l25_n438(x)
+    end
+end
+
+def fun_l24_n480(x)
+    if (x < 1)
+        fun_l25_n109(x)
+    else
+        fun_l25_n360(x)
+    end
+end
+
+def fun_l24_n481(x)
+    if (x < 1)
+        fun_l25_n57(x)
+    else
+        fun_l25_n417(x)
+    end
+end
+
+def fun_l24_n482(x)
+    if (x < 1)
+        fun_l25_n903(x)
+    else
+        fun_l25_n486(x)
+    end
+end
+
+def fun_l24_n483(x)
+    if (x < 1)
+        fun_l25_n677(x)
+    else
+        fun_l25_n77(x)
+    end
+end
+
+def fun_l24_n484(x)
+    if (x < 1)
+        fun_l25_n117(x)
+    else
+        fun_l25_n582(x)
+    end
+end
+
+def fun_l24_n485(x)
+    if (x < 1)
+        fun_l25_n454(x)
+    else
+        fun_l25_n198(x)
+    end
+end
+
+def fun_l24_n486(x)
+    if (x < 1)
+        fun_l25_n779(x)
+    else
+        fun_l25_n301(x)
+    end
+end
+
+def fun_l24_n487(x)
+    if (x < 1)
+        fun_l25_n3(x)
+    else
+        fun_l25_n363(x)
+    end
+end
+
+def fun_l24_n488(x)
+    if (x < 1)
+        fun_l25_n84(x)
+    else
+        fun_l25_n793(x)
+    end
+end
+
+def fun_l24_n489(x)
+    if (x < 1)
+        fun_l25_n344(x)
+    else
+        fun_l25_n342(x)
+    end
+end
+
+def fun_l24_n490(x)
+    if (x < 1)
+        fun_l25_n365(x)
+    else
+        fun_l25_n546(x)
+    end
+end
+
+def fun_l24_n491(x)
+    if (x < 1)
+        fun_l25_n431(x)
+    else
+        fun_l25_n193(x)
+    end
+end
+
+def fun_l24_n492(x)
+    if (x < 1)
+        fun_l25_n763(x)
+    else
+        fun_l25_n174(x)
+    end
+end
+
+def fun_l24_n493(x)
+    if (x < 1)
+        fun_l25_n231(x)
+    else
+        fun_l25_n435(x)
+    end
+end
+
+def fun_l24_n494(x)
+    if (x < 1)
+        fun_l25_n408(x)
+    else
+        fun_l25_n848(x)
+    end
+end
+
+def fun_l24_n495(x)
+    if (x < 1)
+        fun_l25_n955(x)
+    else
+        fun_l25_n232(x)
+    end
+end
+
+def fun_l24_n496(x)
+    if (x < 1)
+        fun_l25_n72(x)
+    else
+        fun_l25_n11(x)
+    end
+end
+
+def fun_l24_n497(x)
+    if (x < 1)
+        fun_l25_n196(x)
+    else
+        fun_l25_n180(x)
+    end
+end
+
+def fun_l24_n498(x)
+    if (x < 1)
+        fun_l25_n102(x)
+    else
+        fun_l25_n360(x)
+    end
+end
+
+def fun_l24_n499(x)
+    if (x < 1)
+        fun_l25_n755(x)
+    else
+        fun_l25_n760(x)
+    end
+end
+
+def fun_l24_n500(x)
+    if (x < 1)
+        fun_l25_n676(x)
+    else
+        fun_l25_n825(x)
+    end
+end
+
+def fun_l24_n501(x)
+    if (x < 1)
+        fun_l25_n203(x)
+    else
+        fun_l25_n731(x)
+    end
+end
+
+def fun_l24_n502(x)
+    if (x < 1)
+        fun_l25_n551(x)
+    else
+        fun_l25_n165(x)
+    end
+end
+
+def fun_l24_n503(x)
+    if (x < 1)
+        fun_l25_n702(x)
+    else
+        fun_l25_n779(x)
+    end
+end
+
+def fun_l24_n504(x)
+    if (x < 1)
+        fun_l25_n525(x)
+    else
+        fun_l25_n846(x)
+    end
+end
+
+def fun_l24_n505(x)
+    if (x < 1)
+        fun_l25_n97(x)
+    else
+        fun_l25_n331(x)
+    end
+end
+
+def fun_l24_n506(x)
+    if (x < 1)
+        fun_l25_n572(x)
+    else
+        fun_l25_n759(x)
+    end
+end
+
+def fun_l24_n507(x)
+    if (x < 1)
+        fun_l25_n402(x)
+    else
+        fun_l25_n460(x)
+    end
+end
+
+def fun_l24_n508(x)
+    if (x < 1)
+        fun_l25_n640(x)
+    else
+        fun_l25_n833(x)
+    end
+end
+
+def fun_l24_n509(x)
+    if (x < 1)
+        fun_l25_n190(x)
+    else
+        fun_l25_n524(x)
+    end
+end
+
+def fun_l24_n510(x)
+    if (x < 1)
+        fun_l25_n307(x)
+    else
+        fun_l25_n92(x)
+    end
+end
+
+def fun_l24_n511(x)
+    if (x < 1)
+        fun_l25_n444(x)
+    else
+        fun_l25_n593(x)
+    end
+end
+
+def fun_l24_n512(x)
+    if (x < 1)
+        fun_l25_n684(x)
+    else
+        fun_l25_n163(x)
+    end
+end
+
+def fun_l24_n513(x)
+    if (x < 1)
+        fun_l25_n998(x)
+    else
+        fun_l25_n582(x)
+    end
+end
+
+def fun_l24_n514(x)
+    if (x < 1)
+        fun_l25_n767(x)
+    else
+        fun_l25_n557(x)
+    end
+end
+
+def fun_l24_n515(x)
+    if (x < 1)
+        fun_l25_n893(x)
+    else
+        fun_l25_n179(x)
+    end
+end
+
+def fun_l24_n516(x)
+    if (x < 1)
+        fun_l25_n726(x)
+    else
+        fun_l25_n651(x)
+    end
+end
+
+def fun_l24_n517(x)
+    if (x < 1)
+        fun_l25_n57(x)
+    else
+        fun_l25_n454(x)
+    end
+end
+
+def fun_l24_n518(x)
+    if (x < 1)
+        fun_l25_n598(x)
+    else
+        fun_l25_n554(x)
+    end
+end
+
+def fun_l24_n519(x)
+    if (x < 1)
+        fun_l25_n437(x)
+    else
+        fun_l25_n349(x)
+    end
+end
+
+def fun_l24_n520(x)
+    if (x < 1)
+        fun_l25_n754(x)
+    else
+        fun_l25_n259(x)
+    end
+end
+
+def fun_l24_n521(x)
+    if (x < 1)
+        fun_l25_n856(x)
+    else
+        fun_l25_n155(x)
+    end
+end
+
+def fun_l24_n522(x)
+    if (x < 1)
+        fun_l25_n607(x)
+    else
+        fun_l25_n751(x)
+    end
+end
+
+def fun_l24_n523(x)
+    if (x < 1)
+        fun_l25_n510(x)
+    else
+        fun_l25_n297(x)
+    end
+end
+
+def fun_l24_n524(x)
+    if (x < 1)
+        fun_l25_n433(x)
+    else
+        fun_l25_n102(x)
+    end
+end
+
+def fun_l24_n525(x)
+    if (x < 1)
+        fun_l25_n173(x)
+    else
+        fun_l25_n487(x)
+    end
+end
+
+def fun_l24_n526(x)
+    if (x < 1)
+        fun_l25_n716(x)
+    else
+        fun_l25_n230(x)
+    end
+end
+
+def fun_l24_n527(x)
+    if (x < 1)
+        fun_l25_n511(x)
+    else
+        fun_l25_n272(x)
+    end
+end
+
+def fun_l24_n528(x)
+    if (x < 1)
+        fun_l25_n974(x)
+    else
+        fun_l25_n954(x)
+    end
+end
+
+def fun_l24_n529(x)
+    if (x < 1)
+        fun_l25_n92(x)
+    else
+        fun_l25_n704(x)
+    end
+end
+
+def fun_l24_n530(x)
+    if (x < 1)
+        fun_l25_n117(x)
+    else
+        fun_l25_n725(x)
+    end
+end
+
+def fun_l24_n531(x)
+    if (x < 1)
+        fun_l25_n817(x)
+    else
+        fun_l25_n6(x)
+    end
+end
+
+def fun_l24_n532(x)
+    if (x < 1)
+        fun_l25_n27(x)
+    else
+        fun_l25_n438(x)
+    end
+end
+
+def fun_l24_n533(x)
+    if (x < 1)
+        fun_l25_n964(x)
+    else
+        fun_l25_n291(x)
+    end
+end
+
+def fun_l24_n534(x)
+    if (x < 1)
+        fun_l25_n786(x)
+    else
+        fun_l25_n871(x)
+    end
+end
+
+def fun_l24_n535(x)
+    if (x < 1)
+        fun_l25_n79(x)
+    else
+        fun_l25_n786(x)
+    end
+end
+
+def fun_l24_n536(x)
+    if (x < 1)
+        fun_l25_n403(x)
+    else
+        fun_l25_n78(x)
+    end
+end
+
+def fun_l24_n537(x)
+    if (x < 1)
+        fun_l25_n20(x)
+    else
+        fun_l25_n239(x)
+    end
+end
+
+def fun_l24_n538(x)
+    if (x < 1)
+        fun_l25_n818(x)
+    else
+        fun_l25_n917(x)
+    end
+end
+
+def fun_l24_n539(x)
+    if (x < 1)
+        fun_l25_n598(x)
+    else
+        fun_l25_n708(x)
+    end
+end
+
+def fun_l24_n540(x)
+    if (x < 1)
+        fun_l25_n802(x)
+    else
+        fun_l25_n208(x)
+    end
+end
+
+def fun_l24_n541(x)
+    if (x < 1)
+        fun_l25_n962(x)
+    else
+        fun_l25_n487(x)
+    end
+end
+
+def fun_l24_n542(x)
+    if (x < 1)
+        fun_l25_n690(x)
+    else
+        fun_l25_n503(x)
+    end
+end
+
+def fun_l24_n543(x)
+    if (x < 1)
+        fun_l25_n548(x)
+    else
+        fun_l25_n295(x)
+    end
+end
+
+def fun_l24_n544(x)
+    if (x < 1)
+        fun_l25_n373(x)
+    else
+        fun_l25_n896(x)
+    end
+end
+
+def fun_l24_n545(x)
+    if (x < 1)
+        fun_l25_n759(x)
+    else
+        fun_l25_n171(x)
+    end
+end
+
+def fun_l24_n546(x)
+    if (x < 1)
+        fun_l25_n269(x)
+    else
+        fun_l25_n153(x)
+    end
+end
+
+def fun_l24_n547(x)
+    if (x < 1)
+        fun_l25_n489(x)
+    else
+        fun_l25_n628(x)
+    end
+end
+
+def fun_l24_n548(x)
+    if (x < 1)
+        fun_l25_n540(x)
+    else
+        fun_l25_n7(x)
+    end
+end
+
+def fun_l24_n549(x)
+    if (x < 1)
+        fun_l25_n916(x)
+    else
+        fun_l25_n365(x)
+    end
+end
+
+def fun_l24_n550(x)
+    if (x < 1)
+        fun_l25_n377(x)
+    else
+        fun_l25_n420(x)
+    end
+end
+
+def fun_l24_n551(x)
+    if (x < 1)
+        fun_l25_n331(x)
+    else
+        fun_l25_n568(x)
+    end
+end
+
+def fun_l24_n552(x)
+    if (x < 1)
+        fun_l25_n348(x)
+    else
+        fun_l25_n934(x)
+    end
+end
+
+def fun_l24_n553(x)
+    if (x < 1)
+        fun_l25_n676(x)
+    else
+        fun_l25_n142(x)
+    end
+end
+
+def fun_l24_n554(x)
+    if (x < 1)
+        fun_l25_n913(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n555(x)
+    if (x < 1)
+        fun_l25_n873(x)
+    else
+        fun_l25_n951(x)
+    end
+end
+
+def fun_l24_n556(x)
+    if (x < 1)
+        fun_l25_n300(x)
+    else
+        fun_l25_n969(x)
+    end
+end
+
+def fun_l24_n557(x)
+    if (x < 1)
+        fun_l25_n674(x)
+    else
+        fun_l25_n290(x)
+    end
+end
+
+def fun_l24_n558(x)
+    if (x < 1)
+        fun_l25_n323(x)
+    else
+        fun_l25_n325(x)
+    end
+end
+
+def fun_l24_n559(x)
+    if (x < 1)
+        fun_l25_n547(x)
+    else
+        fun_l25_n207(x)
+    end
+end
+
+def fun_l24_n560(x)
+    if (x < 1)
+        fun_l25_n858(x)
+    else
+        fun_l25_n304(x)
+    end
+end
+
+def fun_l24_n561(x)
+    if (x < 1)
+        fun_l25_n831(x)
+    else
+        fun_l25_n840(x)
+    end
+end
+
+def fun_l24_n562(x)
+    if (x < 1)
+        fun_l25_n174(x)
+    else
+        fun_l25_n162(x)
+    end
+end
+
+def fun_l24_n563(x)
+    if (x < 1)
+        fun_l25_n662(x)
+    else
+        fun_l25_n676(x)
+    end
+end
+
+def fun_l24_n564(x)
+    if (x < 1)
+        fun_l25_n474(x)
+    else
+        fun_l25_n173(x)
+    end
+end
+
+def fun_l24_n565(x)
+    if (x < 1)
+        fun_l25_n232(x)
+    else
+        fun_l25_n57(x)
+    end
+end
+
+def fun_l24_n566(x)
+    if (x < 1)
+        fun_l25_n615(x)
+    else
+        fun_l25_n944(x)
+    end
+end
+
+def fun_l24_n567(x)
+    if (x < 1)
+        fun_l25_n586(x)
+    else
+        fun_l25_n183(x)
+    end
+end
+
+def fun_l24_n568(x)
+    if (x < 1)
+        fun_l25_n758(x)
+    else
+        fun_l25_n376(x)
+    end
+end
+
+def fun_l24_n569(x)
+    if (x < 1)
+        fun_l25_n755(x)
+    else
+        fun_l25_n903(x)
+    end
+end
+
+def fun_l24_n570(x)
+    if (x < 1)
+        fun_l25_n562(x)
+    else
+        fun_l25_n843(x)
+    end
+end
+
+def fun_l24_n571(x)
+    if (x < 1)
+        fun_l25_n369(x)
+    else
+        fun_l25_n712(x)
+    end
+end
+
+def fun_l24_n572(x)
+    if (x < 1)
+        fun_l25_n183(x)
+    else
+        fun_l25_n273(x)
+    end
+end
+
+def fun_l24_n573(x)
+    if (x < 1)
+        fun_l25_n150(x)
+    else
+        fun_l25_n309(x)
+    end
+end
+
+def fun_l24_n574(x)
+    if (x < 1)
+        fun_l25_n485(x)
+    else
+        fun_l25_n20(x)
+    end
+end
+
+def fun_l24_n575(x)
+    if (x < 1)
+        fun_l25_n325(x)
+    else
+        fun_l25_n770(x)
+    end
+end
+
+def fun_l24_n576(x)
+    if (x < 1)
+        fun_l25_n528(x)
+    else
+        fun_l25_n529(x)
+    end
+end
+
+def fun_l24_n577(x)
+    if (x < 1)
+        fun_l25_n557(x)
+    else
+        fun_l25_n416(x)
+    end
+end
+
+def fun_l24_n578(x)
+    if (x < 1)
+        fun_l25_n501(x)
+    else
+        fun_l25_n81(x)
+    end
+end
+
+def fun_l24_n579(x)
+    if (x < 1)
+        fun_l25_n355(x)
+    else
+        fun_l25_n391(x)
+    end
+end
+
+def fun_l24_n580(x)
+    if (x < 1)
+        fun_l25_n665(x)
+    else
+        fun_l25_n656(x)
+    end
+end
+
+def fun_l24_n581(x)
+    if (x < 1)
+        fun_l25_n496(x)
+    else
+        fun_l25_n933(x)
+    end
+end
+
+def fun_l24_n582(x)
+    if (x < 1)
+        fun_l25_n71(x)
+    else
+        fun_l25_n815(x)
+    end
+end
+
+def fun_l24_n583(x)
+    if (x < 1)
+        fun_l25_n488(x)
+    else
+        fun_l25_n587(x)
+    end
+end
+
+def fun_l24_n584(x)
+    if (x < 1)
+        fun_l25_n909(x)
+    else
+        fun_l25_n673(x)
+    end
+end
+
+def fun_l24_n585(x)
+    if (x < 1)
+        fun_l25_n452(x)
+    else
+        fun_l25_n774(x)
+    end
+end
+
+def fun_l24_n586(x)
+    if (x < 1)
+        fun_l25_n376(x)
+    else
+        fun_l25_n855(x)
+    end
+end
+
+def fun_l24_n587(x)
+    if (x < 1)
+        fun_l25_n452(x)
+    else
+        fun_l25_n331(x)
+    end
+end
+
+def fun_l24_n588(x)
+    if (x < 1)
+        fun_l25_n718(x)
+    else
+        fun_l25_n496(x)
+    end
+end
+
+def fun_l24_n589(x)
+    if (x < 1)
+        fun_l25_n923(x)
+    else
+        fun_l25_n633(x)
+    end
+end
+
+def fun_l24_n590(x)
+    if (x < 1)
+        fun_l25_n815(x)
+    else
+        fun_l25_n633(x)
+    end
+end
+
+def fun_l24_n591(x)
+    if (x < 1)
+        fun_l25_n699(x)
+    else
+        fun_l25_n609(x)
+    end
+end
+
+def fun_l24_n592(x)
+    if (x < 1)
+        fun_l25_n722(x)
+    else
+        fun_l25_n884(x)
+    end
+end
+
+def fun_l24_n593(x)
+    if (x < 1)
+        fun_l25_n580(x)
+    else
+        fun_l25_n48(x)
+    end
+end
+
+def fun_l24_n594(x)
+    if (x < 1)
+        fun_l25_n245(x)
+    else
+        fun_l25_n126(x)
+    end
+end
+
+def fun_l24_n595(x)
+    if (x < 1)
+        fun_l25_n778(x)
+    else
+        fun_l25_n989(x)
+    end
+end
+
+def fun_l24_n596(x)
+    if (x < 1)
+        fun_l25_n813(x)
+    else
+        fun_l25_n117(x)
+    end
+end
+
+def fun_l24_n597(x)
+    if (x < 1)
+        fun_l25_n622(x)
+    else
+        fun_l25_n293(x)
+    end
+end
+
+def fun_l24_n598(x)
+    if (x < 1)
+        fun_l25_n996(x)
+    else
+        fun_l25_n704(x)
+    end
+end
+
+def fun_l24_n599(x)
+    if (x < 1)
+        fun_l25_n173(x)
+    else
+        fun_l25_n336(x)
+    end
+end
+
+def fun_l24_n600(x)
+    if (x < 1)
+        fun_l25_n295(x)
+    else
+        fun_l25_n293(x)
+    end
+end
+
+def fun_l24_n601(x)
+    if (x < 1)
+        fun_l25_n104(x)
+    else
+        fun_l25_n907(x)
+    end
+end
+
+def fun_l24_n602(x)
+    if (x < 1)
+        fun_l25_n136(x)
+    else
+        fun_l25_n915(x)
+    end
+end
+
+def fun_l24_n603(x)
+    if (x < 1)
+        fun_l25_n19(x)
+    else
+        fun_l25_n113(x)
+    end
+end
+
+def fun_l24_n604(x)
+    if (x < 1)
+        fun_l25_n389(x)
+    else
+        fun_l25_n863(x)
+    end
+end
+
+def fun_l24_n605(x)
+    if (x < 1)
+        fun_l25_n20(x)
+    else
+        fun_l25_n830(x)
+    end
+end
+
+def fun_l24_n606(x)
+    if (x < 1)
+        fun_l25_n723(x)
+    else
+        fun_l25_n956(x)
+    end
+end
+
+def fun_l24_n607(x)
+    if (x < 1)
+        fun_l25_n765(x)
+    else
+        fun_l25_n27(x)
+    end
+end
+
+def fun_l24_n608(x)
+    if (x < 1)
+        fun_l25_n682(x)
+    else
+        fun_l25_n953(x)
+    end
+end
+
+def fun_l24_n609(x)
+    if (x < 1)
+        fun_l25_n501(x)
+    else
+        fun_l25_n81(x)
+    end
+end
+
+def fun_l24_n610(x)
+    if (x < 1)
+        fun_l25_n896(x)
+    else
+        fun_l25_n192(x)
+    end
+end
+
+def fun_l24_n611(x)
+    if (x < 1)
+        fun_l25_n605(x)
+    else
+        fun_l25_n443(x)
+    end
+end
+
+def fun_l24_n612(x)
+    if (x < 1)
+        fun_l25_n298(x)
+    else
+        fun_l25_n818(x)
+    end
+end
+
+def fun_l24_n613(x)
+    if (x < 1)
+        fun_l25_n289(x)
+    else
+        fun_l25_n227(x)
+    end
+end
+
+def fun_l24_n614(x)
+    if (x < 1)
+        fun_l25_n511(x)
+    else
+        fun_l25_n460(x)
+    end
+end
+
+def fun_l24_n615(x)
+    if (x < 1)
+        fun_l25_n774(x)
+    else
+        fun_l25_n794(x)
+    end
+end
+
+def fun_l24_n616(x)
+    if (x < 1)
+        fun_l25_n933(x)
+    else
+        fun_l25_n448(x)
+    end
+end
+
+def fun_l24_n617(x)
+    if (x < 1)
+        fun_l25_n239(x)
+    else
+        fun_l25_n156(x)
+    end
+end
+
+def fun_l24_n618(x)
+    if (x < 1)
+        fun_l25_n713(x)
+    else
+        fun_l25_n337(x)
+    end
+end
+
+def fun_l24_n619(x)
+    if (x < 1)
+        fun_l25_n450(x)
+    else
+        fun_l25_n282(x)
+    end
+end
+
+def fun_l24_n620(x)
+    if (x < 1)
+        fun_l25_n97(x)
+    else
+        fun_l25_n360(x)
+    end
+end
+
+def fun_l24_n621(x)
+    if (x < 1)
+        fun_l25_n197(x)
+    else
+        fun_l25_n406(x)
+    end
+end
+
+def fun_l24_n622(x)
+    if (x < 1)
+        fun_l25_n791(x)
+    else
+        fun_l25_n876(x)
+    end
+end
+
+def fun_l24_n623(x)
+    if (x < 1)
+        fun_l25_n989(x)
+    else
+        fun_l25_n616(x)
+    end
+end
+
+def fun_l24_n624(x)
+    if (x < 1)
+        fun_l25_n754(x)
+    else
+        fun_l25_n605(x)
+    end
+end
+
+def fun_l24_n625(x)
+    if (x < 1)
+        fun_l25_n113(x)
+    else
+        fun_l25_n400(x)
+    end
+end
+
+def fun_l24_n626(x)
+    if (x < 1)
+        fun_l25_n6(x)
+    else
+        fun_l25_n742(x)
+    end
+end
+
+def fun_l24_n627(x)
+    if (x < 1)
+        fun_l25_n916(x)
+    else
+        fun_l25_n5(x)
+    end
+end
+
+def fun_l24_n628(x)
+    if (x < 1)
+        fun_l25_n5(x)
+    else
+        fun_l25_n327(x)
+    end
+end
+
+def fun_l24_n629(x)
+    if (x < 1)
+        fun_l25_n867(x)
+    else
+        fun_l25_n37(x)
+    end
+end
+
+def fun_l24_n630(x)
+    if (x < 1)
+        fun_l25_n409(x)
+    else
+        fun_l25_n137(x)
+    end
+end
+
+def fun_l24_n631(x)
+    if (x < 1)
+        fun_l25_n128(x)
+    else
+        fun_l25_n499(x)
+    end
+end
+
+def fun_l24_n632(x)
+    if (x < 1)
+        fun_l25_n694(x)
+    else
+        fun_l25_n983(x)
+    end
+end
+
+def fun_l24_n633(x)
+    if (x < 1)
+        fun_l25_n62(x)
+    else
+        fun_l25_n538(x)
+    end
+end
+
+def fun_l24_n634(x)
+    if (x < 1)
+        fun_l25_n740(x)
+    else
+        fun_l25_n795(x)
+    end
+end
+
+def fun_l24_n635(x)
+    if (x < 1)
+        fun_l25_n597(x)
+    else
+        fun_l25_n557(x)
+    end
+end
+
+def fun_l24_n636(x)
+    if (x < 1)
+        fun_l25_n642(x)
+    else
+        fun_l25_n40(x)
+    end
+end
+
+def fun_l24_n637(x)
+    if (x < 1)
+        fun_l25_n303(x)
+    else
+        fun_l25_n931(x)
+    end
+end
+
+def fun_l24_n638(x)
+    if (x < 1)
+        fun_l25_n977(x)
+    else
+        fun_l25_n848(x)
+    end
+end
+
+def fun_l24_n639(x)
+    if (x < 1)
+        fun_l25_n983(x)
+    else
+        fun_l25_n11(x)
+    end
+end
+
+def fun_l24_n640(x)
+    if (x < 1)
+        fun_l25_n258(x)
+    else
+        fun_l25_n280(x)
+    end
+end
+
+def fun_l24_n641(x)
+    if (x < 1)
+        fun_l25_n553(x)
+    else
+        fun_l25_n351(x)
+    end
+end
+
+def fun_l24_n642(x)
+    if (x < 1)
+        fun_l25_n4(x)
+    else
+        fun_l25_n375(x)
+    end
+end
+
+def fun_l24_n643(x)
+    if (x < 1)
+        fun_l25_n678(x)
+    else
+        fun_l25_n139(x)
+    end
+end
+
+def fun_l24_n644(x)
+    if (x < 1)
+        fun_l25_n193(x)
+    else
+        fun_l25_n490(x)
+    end
+end
+
+def fun_l24_n645(x)
+    if (x < 1)
+        fun_l25_n146(x)
+    else
+        fun_l25_n450(x)
+    end
+end
+
+def fun_l24_n646(x)
+    if (x < 1)
+        fun_l25_n813(x)
+    else
+        fun_l25_n59(x)
+    end
+end
+
+def fun_l24_n647(x)
+    if (x < 1)
+        fun_l25_n726(x)
+    else
+        fun_l25_n792(x)
+    end
+end
+
+def fun_l24_n648(x)
+    if (x < 1)
+        fun_l25_n508(x)
+    else
+        fun_l25_n496(x)
+    end
+end
+
+def fun_l24_n649(x)
+    if (x < 1)
+        fun_l25_n231(x)
+    else
+        fun_l25_n688(x)
+    end
+end
+
+def fun_l24_n650(x)
+    if (x < 1)
+        fun_l25_n602(x)
+    else
+        fun_l25_n641(x)
+    end
+end
+
+def fun_l24_n651(x)
+    if (x < 1)
+        fun_l25_n101(x)
+    else
+        fun_l25_n394(x)
+    end
+end
+
+def fun_l24_n652(x)
+    if (x < 1)
+        fun_l25_n454(x)
+    else
+        fun_l25_n466(x)
+    end
+end
+
+def fun_l24_n653(x)
+    if (x < 1)
+        fun_l25_n147(x)
+    else
+        fun_l25_n116(x)
+    end
+end
+
+def fun_l24_n654(x)
+    if (x < 1)
+        fun_l25_n83(x)
+    else
+        fun_l25_n951(x)
+    end
+end
+
+def fun_l24_n655(x)
+    if (x < 1)
+        fun_l25_n667(x)
+    else
+        fun_l25_n293(x)
+    end
+end
+
+def fun_l24_n656(x)
+    if (x < 1)
+        fun_l25_n413(x)
+    else
+        fun_l25_n708(x)
+    end
+end
+
+def fun_l24_n657(x)
+    if (x < 1)
+        fun_l25_n495(x)
+    else
+        fun_l25_n277(x)
+    end
+end
+
+def fun_l24_n658(x)
+    if (x < 1)
+        fun_l25_n926(x)
+    else
+        fun_l25_n624(x)
+    end
+end
+
+def fun_l24_n659(x)
+    if (x < 1)
+        fun_l25_n612(x)
+    else
+        fun_l25_n666(x)
+    end
+end
+
+def fun_l24_n660(x)
+    if (x < 1)
+        fun_l25_n32(x)
+    else
+        fun_l25_n290(x)
+    end
+end
+
+def fun_l24_n661(x)
+    if (x < 1)
+        fun_l25_n674(x)
+    else
+        fun_l25_n937(x)
+    end
+end
+
+def fun_l24_n662(x)
+    if (x < 1)
+        fun_l25_n556(x)
+    else
+        fun_l25_n576(x)
+    end
+end
+
+def fun_l24_n663(x)
+    if (x < 1)
+        fun_l25_n763(x)
+    else
+        fun_l25_n898(x)
+    end
+end
+
+def fun_l24_n664(x)
+    if (x < 1)
+        fun_l25_n564(x)
+    else
+        fun_l25_n478(x)
+    end
+end
+
+def fun_l24_n665(x)
+    if (x < 1)
+        fun_l25_n515(x)
+    else
+        fun_l25_n991(x)
+    end
+end
+
+def fun_l24_n666(x)
+    if (x < 1)
+        fun_l25_n737(x)
+    else
+        fun_l25_n936(x)
+    end
+end
+
+def fun_l24_n667(x)
+    if (x < 1)
+        fun_l25_n829(x)
+    else
+        fun_l25_n350(x)
+    end
+end
+
+def fun_l24_n668(x)
+    if (x < 1)
+        fun_l25_n59(x)
+    else
+        fun_l25_n979(x)
+    end
+end
+
+def fun_l24_n669(x)
+    if (x < 1)
+        fun_l25_n866(x)
+    else
+        fun_l25_n624(x)
+    end
+end
+
+def fun_l24_n670(x)
+    if (x < 1)
+        fun_l25_n572(x)
+    else
+        fun_l25_n203(x)
+    end
+end
+
+def fun_l24_n671(x)
+    if (x < 1)
+        fun_l25_n96(x)
+    else
+        fun_l25_n862(x)
+    end
+end
+
+def fun_l24_n672(x)
+    if (x < 1)
+        fun_l25_n979(x)
+    else
+        fun_l25_n484(x)
+    end
+end
+
+def fun_l24_n673(x)
+    if (x < 1)
+        fun_l25_n20(x)
+    else
+        fun_l25_n201(x)
+    end
+end
+
+def fun_l24_n674(x)
+    if (x < 1)
+        fun_l25_n109(x)
+    else
+        fun_l25_n788(x)
+    end
+end
+
+def fun_l24_n675(x)
+    if (x < 1)
+        fun_l25_n792(x)
+    else
+        fun_l25_n132(x)
+    end
+end
+
+def fun_l24_n676(x)
+    if (x < 1)
+        fun_l25_n786(x)
+    else
+        fun_l25_n77(x)
+    end
+end
+
+def fun_l24_n677(x)
+    if (x < 1)
+        fun_l25_n21(x)
+    else
+        fun_l25_n96(x)
+    end
+end
+
+def fun_l24_n678(x)
+    if (x < 1)
+        fun_l25_n299(x)
+    else
+        fun_l25_n649(x)
+    end
+end
+
+def fun_l24_n679(x)
+    if (x < 1)
+        fun_l25_n247(x)
+    else
+        fun_l25_n607(x)
+    end
+end
+
+def fun_l24_n680(x)
+    if (x < 1)
+        fun_l25_n480(x)
+    else
+        fun_l25_n471(x)
+    end
+end
+
+def fun_l24_n681(x)
+    if (x < 1)
+        fun_l25_n277(x)
+    else
+        fun_l25_n460(x)
+    end
+end
+
+def fun_l24_n682(x)
+    if (x < 1)
+        fun_l25_n573(x)
+    else
+        fun_l25_n193(x)
+    end
+end
+
+def fun_l24_n683(x)
+    if (x < 1)
+        fun_l25_n741(x)
+    else
+        fun_l25_n441(x)
+    end
+end
+
+def fun_l24_n684(x)
+    if (x < 1)
+        fun_l25_n821(x)
+    else
+        fun_l25_n24(x)
+    end
+end
+
+def fun_l24_n685(x)
+    if (x < 1)
+        fun_l25_n150(x)
+    else
+        fun_l25_n530(x)
+    end
+end
+
+def fun_l24_n686(x)
+    if (x < 1)
+        fun_l25_n564(x)
+    else
+        fun_l25_n26(x)
+    end
+end
+
+def fun_l24_n687(x)
+    if (x < 1)
+        fun_l25_n872(x)
+    else
+        fun_l25_n522(x)
+    end
+end
+
+def fun_l24_n688(x)
+    if (x < 1)
+        fun_l25_n963(x)
+    else
+        fun_l25_n422(x)
+    end
+end
+
+def fun_l24_n689(x)
+    if (x < 1)
+        fun_l25_n418(x)
+    else
+        fun_l25_n900(x)
+    end
+end
+
+def fun_l24_n690(x)
+    if (x < 1)
+        fun_l25_n117(x)
+    else
+        fun_l25_n900(x)
+    end
+end
+
+def fun_l24_n691(x)
+    if (x < 1)
+        fun_l25_n412(x)
+    else
+        fun_l25_n466(x)
+    end
+end
+
+def fun_l24_n692(x)
+    if (x < 1)
+        fun_l25_n761(x)
+    else
+        fun_l25_n190(x)
+    end
+end
+
+def fun_l24_n693(x)
+    if (x < 1)
+        fun_l25_n875(x)
+    else
+        fun_l25_n222(x)
+    end
+end
+
+def fun_l24_n694(x)
+    if (x < 1)
+        fun_l25_n405(x)
+    else
+        fun_l25_n66(x)
+    end
+end
+
+def fun_l24_n695(x)
+    if (x < 1)
+        fun_l25_n570(x)
+    else
+        fun_l25_n801(x)
+    end
+end
+
+def fun_l24_n696(x)
+    if (x < 1)
+        fun_l25_n591(x)
+    else
+        fun_l25_n121(x)
+    end
+end
+
+def fun_l24_n697(x)
+    if (x < 1)
+        fun_l25_n27(x)
+    else
+        fun_l25_n610(x)
+    end
+end
+
+def fun_l24_n698(x)
+    if (x < 1)
+        fun_l25_n843(x)
+    else
+        fun_l25_n488(x)
+    end
+end
+
+def fun_l24_n699(x)
+    if (x < 1)
+        fun_l25_n946(x)
+    else
+        fun_l25_n164(x)
+    end
+end
+
+def fun_l24_n700(x)
+    if (x < 1)
+        fun_l25_n424(x)
+    else
+        fun_l25_n614(x)
+    end
+end
+
+def fun_l24_n701(x)
+    if (x < 1)
+        fun_l25_n692(x)
+    else
+        fun_l25_n893(x)
+    end
+end
+
+def fun_l24_n702(x)
+    if (x < 1)
+        fun_l25_n39(x)
+    else
+        fun_l25_n274(x)
+    end
+end
+
+def fun_l24_n703(x)
+    if (x < 1)
+        fun_l25_n814(x)
+    else
+        fun_l25_n281(x)
+    end
+end
+
+def fun_l24_n704(x)
+    if (x < 1)
+        fun_l25_n670(x)
+    else
+        fun_l25_n882(x)
+    end
+end
+
+def fun_l24_n705(x)
+    if (x < 1)
+        fun_l25_n498(x)
+    else
+        fun_l25_n881(x)
+    end
+end
+
+def fun_l24_n706(x)
+    if (x < 1)
+        fun_l25_n193(x)
+    else
+        fun_l25_n10(x)
+    end
+end
+
+def fun_l24_n707(x)
+    if (x < 1)
+        fun_l25_n531(x)
+    else
+        fun_l25_n870(x)
+    end
+end
+
+def fun_l24_n708(x)
+    if (x < 1)
+        fun_l25_n106(x)
+    else
+        fun_l25_n692(x)
+    end
+end
+
+def fun_l24_n709(x)
+    if (x < 1)
+        fun_l25_n484(x)
+    else
+        fun_l25_n700(x)
+    end
+end
+
+def fun_l24_n710(x)
+    if (x < 1)
+        fun_l25_n699(x)
+    else
+        fun_l25_n117(x)
+    end
+end
+
+def fun_l24_n711(x)
+    if (x < 1)
+        fun_l25_n138(x)
+    else
+        fun_l25_n532(x)
+    end
+end
+
+def fun_l24_n712(x)
+    if (x < 1)
+        fun_l25_n468(x)
+    else
+        fun_l25_n350(x)
+    end
+end
+
+def fun_l24_n713(x)
+    if (x < 1)
+        fun_l25_n906(x)
+    else
+        fun_l25_n25(x)
+    end
+end
+
+def fun_l24_n714(x)
+    if (x < 1)
+        fun_l25_n23(x)
+    else
+        fun_l25_n745(x)
+    end
+end
+
+def fun_l24_n715(x)
+    if (x < 1)
+        fun_l25_n917(x)
+    else
+        fun_l25_n942(x)
+    end
+end
+
+def fun_l24_n716(x)
+    if (x < 1)
+        fun_l25_n986(x)
+    else
+        fun_l25_n605(x)
+    end
+end
+
+def fun_l24_n717(x)
+    if (x < 1)
+        fun_l25_n771(x)
+    else
+        fun_l25_n100(x)
+    end
+end
+
+def fun_l24_n718(x)
+    if (x < 1)
+        fun_l25_n994(x)
+    else
+        fun_l25_n249(x)
+    end
+end
+
+def fun_l24_n719(x)
+    if (x < 1)
+        fun_l25_n368(x)
+    else
+        fun_l25_n657(x)
+    end
+end
+
+def fun_l24_n720(x)
+    if (x < 1)
+        fun_l25_n856(x)
+    else
+        fun_l25_n650(x)
+    end
+end
+
+def fun_l24_n721(x)
+    if (x < 1)
+        fun_l25_n667(x)
+    else
+        fun_l25_n609(x)
+    end
+end
+
+def fun_l24_n722(x)
+    if (x < 1)
+        fun_l25_n353(x)
+    else
+        fun_l25_n665(x)
+    end
+end
+
+def fun_l24_n723(x)
+    if (x < 1)
+        fun_l25_n520(x)
+    else
+        fun_l25_n771(x)
+    end
+end
+
+def fun_l24_n724(x)
+    if (x < 1)
+        fun_l25_n636(x)
+    else
+        fun_l25_n34(x)
+    end
+end
+
+def fun_l24_n725(x)
+    if (x < 1)
+        fun_l25_n222(x)
+    else
+        fun_l25_n444(x)
+    end
+end
+
+def fun_l24_n726(x)
+    if (x < 1)
+        fun_l25_n519(x)
+    else
+        fun_l25_n675(x)
+    end
+end
+
+def fun_l24_n727(x)
+    if (x < 1)
+        fun_l25_n739(x)
+    else
+        fun_l25_n910(x)
+    end
+end
+
+def fun_l24_n728(x)
+    if (x < 1)
+        fun_l25_n669(x)
+    else
+        fun_l25_n645(x)
+    end
+end
+
+def fun_l24_n729(x)
+    if (x < 1)
+        fun_l25_n358(x)
+    else
+        fun_l25_n316(x)
+    end
+end
+
+def fun_l24_n730(x)
+    if (x < 1)
+        fun_l25_n614(x)
+    else
+        fun_l25_n484(x)
+    end
+end
+
+def fun_l24_n731(x)
+    if (x < 1)
+        fun_l25_n640(x)
+    else
+        fun_l25_n613(x)
+    end
+end
+
+def fun_l24_n732(x)
+    if (x < 1)
+        fun_l25_n16(x)
+    else
+        fun_l25_n596(x)
+    end
+end
+
+def fun_l24_n733(x)
+    if (x < 1)
+        fun_l25_n780(x)
+    else
+        fun_l25_n673(x)
+    end
+end
+
+def fun_l24_n734(x)
+    if (x < 1)
+        fun_l25_n999(x)
+    else
+        fun_l25_n210(x)
+    end
+end
+
+def fun_l24_n735(x)
+    if (x < 1)
+        fun_l25_n915(x)
+    else
+        fun_l25_n788(x)
+    end
+end
+
+def fun_l24_n736(x)
+    if (x < 1)
+        fun_l25_n484(x)
+    else
+        fun_l25_n369(x)
+    end
+end
+
+def fun_l24_n737(x)
+    if (x < 1)
+        fun_l25_n851(x)
+    else
+        fun_l25_n674(x)
+    end
+end
+
+def fun_l24_n738(x)
+    if (x < 1)
+        fun_l25_n830(x)
+    else
+        fun_l25_n382(x)
+    end
+end
+
+def fun_l24_n739(x)
+    if (x < 1)
+        fun_l25_n861(x)
+    else
+        fun_l25_n482(x)
+    end
+end
+
+def fun_l24_n740(x)
+    if (x < 1)
+        fun_l25_n244(x)
+    else
+        fun_l25_n414(x)
+    end
+end
+
+def fun_l24_n741(x)
+    if (x < 1)
+        fun_l25_n829(x)
+    else
+        fun_l25_n846(x)
+    end
+end
+
+def fun_l24_n742(x)
+    if (x < 1)
+        fun_l25_n197(x)
+    else
+        fun_l25_n943(x)
+    end
+end
+
+def fun_l24_n743(x)
+    if (x < 1)
+        fun_l25_n290(x)
+    else
+        fun_l25_n394(x)
+    end
+end
+
+def fun_l24_n744(x)
+    if (x < 1)
+        fun_l25_n965(x)
+    else
+        fun_l25_n987(x)
+    end
+end
+
+def fun_l24_n745(x)
+    if (x < 1)
+        fun_l25_n104(x)
+    else
+        fun_l25_n369(x)
+    end
+end
+
+def fun_l24_n746(x)
+    if (x < 1)
+        fun_l25_n880(x)
+    else
+        fun_l25_n541(x)
+    end
+end
+
+def fun_l24_n747(x)
+    if (x < 1)
+        fun_l25_n345(x)
+    else
+        fun_l25_n155(x)
+    end
+end
+
+def fun_l24_n748(x)
+    if (x < 1)
+        fun_l25_n803(x)
+    else
+        fun_l25_n383(x)
+    end
+end
+
+def fun_l24_n749(x)
+    if (x < 1)
+        fun_l25_n848(x)
+    else
+        fun_l25_n340(x)
+    end
+end
+
+def fun_l24_n750(x)
+    if (x < 1)
+        fun_l25_n197(x)
+    else
+        fun_l25_n313(x)
+    end
+end
+
+def fun_l24_n751(x)
+    if (x < 1)
+        fun_l25_n253(x)
+    else
+        fun_l25_n99(x)
+    end
+end
+
+def fun_l24_n752(x)
+    if (x < 1)
+        fun_l25_n873(x)
+    else
+        fun_l25_n347(x)
+    end
+end
+
+def fun_l24_n753(x)
+    if (x < 1)
+        fun_l25_n849(x)
+    else
+        fun_l25_n627(x)
+    end
+end
+
+def fun_l24_n754(x)
+    if (x < 1)
+        fun_l25_n817(x)
+    else
+        fun_l25_n441(x)
+    end
+end
+
+def fun_l24_n755(x)
+    if (x < 1)
+        fun_l25_n235(x)
+    else
+        fun_l25_n602(x)
+    end
+end
+
+def fun_l24_n756(x)
+    if (x < 1)
+        fun_l25_n950(x)
+    else
+        fun_l25_n516(x)
+    end
+end
+
+def fun_l24_n757(x)
+    if (x < 1)
+        fun_l25_n646(x)
+    else
+        fun_l25_n996(x)
+    end
+end
+
+def fun_l24_n758(x)
+    if (x < 1)
+        fun_l25_n27(x)
+    else
+        fun_l25_n650(x)
+    end
+end
+
+def fun_l24_n759(x)
+    if (x < 1)
+        fun_l25_n290(x)
+    else
+        fun_l25_n852(x)
+    end
+end
+
+def fun_l24_n760(x)
+    if (x < 1)
+        fun_l25_n118(x)
+    else
+        fun_l25_n871(x)
+    end
+end
+
+def fun_l24_n761(x)
+    if (x < 1)
+        fun_l25_n372(x)
+    else
+        fun_l25_n537(x)
+    end
+end
+
+def fun_l24_n762(x)
+    if (x < 1)
+        fun_l25_n124(x)
+    else
+        fun_l25_n939(x)
+    end
+end
+
+def fun_l24_n763(x)
+    if (x < 1)
+        fun_l25_n163(x)
+    else
+        fun_l25_n787(x)
+    end
+end
+
+def fun_l24_n764(x)
+    if (x < 1)
+        fun_l25_n485(x)
+    else
+        fun_l25_n753(x)
+    end
+end
+
+def fun_l24_n765(x)
+    if (x < 1)
+        fun_l25_n181(x)
+    else
+        fun_l25_n595(x)
+    end
+end
+
+def fun_l24_n766(x)
+    if (x < 1)
+        fun_l25_n909(x)
+    else
+        fun_l25_n734(x)
+    end
+end
+
+def fun_l24_n767(x)
+    if (x < 1)
+        fun_l25_n980(x)
+    else
+        fun_l25_n673(x)
+    end
+end
+
+def fun_l24_n768(x)
+    if (x < 1)
+        fun_l25_n756(x)
+    else
+        fun_l25_n429(x)
+    end
+end
+
+def fun_l24_n769(x)
+    if (x < 1)
+        fun_l25_n301(x)
+    else
+        fun_l25_n197(x)
+    end
+end
+
+def fun_l24_n770(x)
+    if (x < 1)
+        fun_l25_n977(x)
+    else
+        fun_l25_n569(x)
+    end
+end
+
+def fun_l24_n771(x)
+    if (x < 1)
+        fun_l25_n829(x)
+    else
+        fun_l25_n34(x)
+    end
+end
+
+def fun_l24_n772(x)
+    if (x < 1)
+        fun_l25_n601(x)
+    else
+        fun_l25_n762(x)
+    end
+end
+
+def fun_l24_n773(x)
+    if (x < 1)
+        fun_l25_n790(x)
+    else
+        fun_l25_n282(x)
+    end
+end
+
+def fun_l24_n774(x)
+    if (x < 1)
+        fun_l25_n464(x)
+    else
+        fun_l25_n814(x)
+    end
+end
+
+def fun_l24_n775(x)
+    if (x < 1)
+        fun_l25_n562(x)
+    else
+        fun_l25_n543(x)
+    end
+end
+
+def fun_l24_n776(x)
+    if (x < 1)
+        fun_l25_n869(x)
+    else
+        fun_l25_n857(x)
+    end
+end
+
+def fun_l24_n777(x)
+    if (x < 1)
+        fun_l25_n206(x)
+    else
+        fun_l25_n369(x)
+    end
+end
+
+def fun_l24_n778(x)
+    if (x < 1)
+        fun_l25_n43(x)
+    else
+        fun_l25_n405(x)
+    end
+end
+
+def fun_l24_n779(x)
+    if (x < 1)
+        fun_l25_n116(x)
+    else
+        fun_l25_n644(x)
+    end
+end
+
+def fun_l24_n780(x)
+    if (x < 1)
+        fun_l25_n455(x)
+    else
+        fun_l25_n174(x)
+    end
+end
+
+def fun_l24_n781(x)
+    if (x < 1)
+        fun_l25_n234(x)
+    else
+        fun_l25_n887(x)
+    end
+end
+
+def fun_l24_n782(x)
+    if (x < 1)
+        fun_l25_n157(x)
+    else
+        fun_l25_n459(x)
+    end
+end
+
+def fun_l24_n783(x)
+    if (x < 1)
+        fun_l25_n441(x)
+    else
+        fun_l25_n830(x)
+    end
+end
+
+def fun_l24_n784(x)
+    if (x < 1)
+        fun_l25_n908(x)
+    else
+        fun_l25_n363(x)
+    end
+end
+
+def fun_l24_n785(x)
+    if (x < 1)
+        fun_l25_n495(x)
+    else
+        fun_l25_n790(x)
+    end
+end
+
+def fun_l24_n786(x)
+    if (x < 1)
+        fun_l25_n365(x)
+    else
+        fun_l25_n561(x)
+    end
+end
+
+def fun_l24_n787(x)
+    if (x < 1)
+        fun_l25_n419(x)
+    else
+        fun_l25_n471(x)
+    end
+end
+
+def fun_l24_n788(x)
+    if (x < 1)
+        fun_l25_n568(x)
+    else
+        fun_l25_n807(x)
+    end
+end
+
+def fun_l24_n789(x)
+    if (x < 1)
+        fun_l25_n148(x)
+    else
+        fun_l25_n476(x)
+    end
+end
+
+def fun_l24_n790(x)
+    if (x < 1)
+        fun_l25_n470(x)
+    else
+        fun_l25_n662(x)
+    end
+end
+
+def fun_l24_n791(x)
+    if (x < 1)
+        fun_l25_n307(x)
+    else
+        fun_l25_n828(x)
+    end
+end
+
+def fun_l24_n792(x)
+    if (x < 1)
+        fun_l25_n227(x)
+    else
+        fun_l25_n802(x)
+    end
+end
+
+def fun_l24_n793(x)
+    if (x < 1)
+        fun_l25_n891(x)
+    else
+        fun_l25_n561(x)
+    end
+end
+
+def fun_l24_n794(x)
+    if (x < 1)
+        fun_l25_n465(x)
+    else
+        fun_l25_n805(x)
+    end
+end
+
+def fun_l24_n795(x)
+    if (x < 1)
+        fun_l25_n869(x)
+    else
+        fun_l25_n250(x)
+    end
+end
+
+def fun_l24_n796(x)
+    if (x < 1)
+        fun_l25_n479(x)
+    else
+        fun_l25_n996(x)
+    end
+end
+
+def fun_l24_n797(x)
+    if (x < 1)
+        fun_l25_n773(x)
+    else
+        fun_l25_n294(x)
+    end
+end
+
+def fun_l24_n798(x)
+    if (x < 1)
+        fun_l25_n601(x)
+    else
+        fun_l25_n259(x)
+    end
+end
+
+def fun_l24_n799(x)
+    if (x < 1)
+        fun_l25_n334(x)
+    else
+        fun_l25_n696(x)
+    end
+end
+
+def fun_l24_n800(x)
+    if (x < 1)
+        fun_l25_n6(x)
+    else
+        fun_l25_n184(x)
+    end
+end
+
+def fun_l24_n801(x)
+    if (x < 1)
+        fun_l25_n345(x)
+    else
+        fun_l25_n476(x)
+    end
+end
+
+def fun_l24_n802(x)
+    if (x < 1)
+        fun_l25_n957(x)
+    else
+        fun_l25_n893(x)
+    end
+end
+
+def fun_l24_n803(x)
+    if (x < 1)
+        fun_l25_n541(x)
+    else
+        fun_l25_n562(x)
+    end
+end
+
+def fun_l24_n804(x)
+    if (x < 1)
+        fun_l25_n403(x)
+    else
+        fun_l25_n398(x)
+    end
+end
+
+def fun_l24_n805(x)
+    if (x < 1)
+        fun_l25_n759(x)
+    else
+        fun_l25_n861(x)
+    end
+end
+
+def fun_l24_n806(x)
+    if (x < 1)
+        fun_l25_n145(x)
+    else
+        fun_l25_n460(x)
+    end
+end
+
+def fun_l24_n807(x)
+    if (x < 1)
+        fun_l25_n960(x)
+    else
+        fun_l25_n865(x)
+    end
+end
+
+def fun_l24_n808(x)
+    if (x < 1)
+        fun_l25_n386(x)
+    else
+        fun_l25_n443(x)
+    end
+end
+
+def fun_l24_n809(x)
+    if (x < 1)
+        fun_l25_n789(x)
+    else
+        fun_l25_n295(x)
+    end
+end
+
+def fun_l24_n810(x)
+    if (x < 1)
+        fun_l25_n985(x)
+    else
+        fun_l25_n15(x)
+    end
+end
+
+def fun_l24_n811(x)
+    if (x < 1)
+        fun_l25_n976(x)
+    else
+        fun_l25_n636(x)
+    end
+end
+
+def fun_l24_n812(x)
+    if (x < 1)
+        fun_l25_n183(x)
+    else
+        fun_l25_n146(x)
+    end
+end
+
+def fun_l24_n813(x)
+    if (x < 1)
+        fun_l25_n457(x)
+    else
+        fun_l25_n141(x)
+    end
+end
+
+def fun_l24_n814(x)
+    if (x < 1)
+        fun_l25_n1(x)
+    else
+        fun_l25_n708(x)
+    end
+end
+
+def fun_l24_n815(x)
+    if (x < 1)
+        fun_l25_n696(x)
+    else
+        fun_l25_n898(x)
+    end
+end
+
+def fun_l24_n816(x)
+    if (x < 1)
+        fun_l25_n423(x)
+    else
+        fun_l25_n250(x)
+    end
+end
+
+def fun_l24_n817(x)
+    if (x < 1)
+        fun_l25_n432(x)
+    else
+        fun_l25_n918(x)
+    end
+end
+
+def fun_l24_n818(x)
+    if (x < 1)
+        fun_l25_n712(x)
+    else
+        fun_l25_n8(x)
+    end
+end
+
+def fun_l24_n819(x)
+    if (x < 1)
+        fun_l25_n331(x)
+    else
+        fun_l25_n194(x)
+    end
+end
+
+def fun_l24_n820(x)
+    if (x < 1)
+        fun_l25_n106(x)
+    else
+        fun_l25_n588(x)
+    end
+end
+
+def fun_l24_n821(x)
+    if (x < 1)
+        fun_l25_n662(x)
+    else
+        fun_l25_n365(x)
+    end
+end
+
+def fun_l24_n822(x)
+    if (x < 1)
+        fun_l25_n461(x)
+    else
+        fun_l25_n931(x)
+    end
+end
+
+def fun_l24_n823(x)
+    if (x < 1)
+        fun_l25_n243(x)
+    else
+        fun_l25_n26(x)
+    end
+end
+
+def fun_l24_n824(x)
+    if (x < 1)
+        fun_l25_n6(x)
+    else
+        fun_l25_n787(x)
+    end
+end
+
+def fun_l24_n825(x)
+    if (x < 1)
+        fun_l25_n536(x)
+    else
+        fun_l25_n721(x)
+    end
+end
+
+def fun_l24_n826(x)
+    if (x < 1)
+        fun_l25_n693(x)
+    else
+        fun_l25_n649(x)
+    end
+end
+
+def fun_l24_n827(x)
+    if (x < 1)
+        fun_l25_n662(x)
+    else
+        fun_l25_n981(x)
+    end
+end
+
+def fun_l24_n828(x)
+    if (x < 1)
+        fun_l25_n594(x)
+    else
+        fun_l25_n345(x)
+    end
+end
+
+def fun_l24_n829(x)
+    if (x < 1)
+        fun_l25_n917(x)
+    else
+        fun_l25_n665(x)
+    end
+end
+
+def fun_l24_n830(x)
+    if (x < 1)
+        fun_l25_n246(x)
+    else
+        fun_l25_n58(x)
+    end
+end
+
+def fun_l24_n831(x)
+    if (x < 1)
+        fun_l25_n415(x)
+    else
+        fun_l25_n617(x)
+    end
+end
+
+def fun_l24_n832(x)
+    if (x < 1)
+        fun_l25_n596(x)
+    else
+        fun_l25_n858(x)
+    end
+end
+
+def fun_l24_n833(x)
+    if (x < 1)
+        fun_l25_n810(x)
+    else
+        fun_l25_n532(x)
+    end
+end
+
+def fun_l24_n834(x)
+    if (x < 1)
+        fun_l25_n298(x)
+    else
+        fun_l25_n881(x)
+    end
+end
+
+def fun_l24_n835(x)
+    if (x < 1)
+        fun_l25_n791(x)
+    else
+        fun_l25_n344(x)
+    end
+end
+
+def fun_l24_n836(x)
+    if (x < 1)
+        fun_l25_n531(x)
+    else
+        fun_l25_n880(x)
+    end
+end
+
+def fun_l24_n837(x)
+    if (x < 1)
+        fun_l25_n571(x)
+    else
+        fun_l25_n306(x)
+    end
+end
+
+def fun_l24_n838(x)
+    if (x < 1)
+        fun_l25_n191(x)
+    else
+        fun_l25_n450(x)
+    end
+end
+
+def fun_l24_n839(x)
+    if (x < 1)
+        fun_l25_n777(x)
+    else
+        fun_l25_n234(x)
+    end
+end
+
+def fun_l24_n840(x)
+    if (x < 1)
+        fun_l25_n876(x)
+    else
+        fun_l25_n548(x)
+    end
+end
+
+def fun_l24_n841(x)
+    if (x < 1)
+        fun_l25_n83(x)
+    else
+        fun_l25_n346(x)
+    end
+end
+
+def fun_l24_n842(x)
+    if (x < 1)
+        fun_l25_n976(x)
+    else
+        fun_l25_n843(x)
+    end
+end
+
+def fun_l24_n843(x)
+    if (x < 1)
+        fun_l25_n559(x)
+    else
+        fun_l25_n424(x)
+    end
+end
+
+def fun_l24_n844(x)
+    if (x < 1)
+        fun_l25_n974(x)
+    else
+        fun_l25_n906(x)
+    end
+end
+
+def fun_l24_n845(x)
+    if (x < 1)
+        fun_l25_n274(x)
+    else
+        fun_l25_n528(x)
+    end
+end
+
+def fun_l24_n846(x)
+    if (x < 1)
+        fun_l25_n773(x)
+    else
+        fun_l25_n507(x)
+    end
+end
+
+def fun_l24_n847(x)
+    if (x < 1)
+        fun_l25_n80(x)
+    else
+        fun_l25_n274(x)
+    end
+end
+
+def fun_l24_n848(x)
+    if (x < 1)
+        fun_l25_n557(x)
+    else
+        fun_l25_n541(x)
+    end
+end
+
+def fun_l24_n849(x)
+    if (x < 1)
+        fun_l25_n208(x)
+    else
+        fun_l25_n765(x)
+    end
+end
+
+def fun_l24_n850(x)
+    if (x < 1)
+        fun_l25_n705(x)
+    else
+        fun_l25_n81(x)
+    end
+end
+
+def fun_l24_n851(x)
+    if (x < 1)
+        fun_l25_n151(x)
+    else
+        fun_l25_n706(x)
+    end
+end
+
+def fun_l24_n852(x)
+    if (x < 1)
+        fun_l25_n723(x)
+    else
+        fun_l25_n451(x)
+    end
+end
+
+def fun_l24_n853(x)
+    if (x < 1)
+        fun_l25_n155(x)
+    else
+        fun_l25_n48(x)
+    end
+end
+
+def fun_l24_n854(x)
+    if (x < 1)
+        fun_l25_n317(x)
+    else
+        fun_l25_n118(x)
+    end
+end
+
+def fun_l24_n855(x)
+    if (x < 1)
+        fun_l25_n794(x)
+    else
+        fun_l25_n880(x)
+    end
+end
+
+def fun_l24_n856(x)
+    if (x < 1)
+        fun_l25_n556(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n857(x)
+    if (x < 1)
+        fun_l25_n665(x)
+    else
+        fun_l25_n640(x)
+    end
+end
+
+def fun_l24_n858(x)
+    if (x < 1)
+        fun_l25_n732(x)
+    else
+        fun_l25_n771(x)
+    end
+end
+
+def fun_l24_n859(x)
+    if (x < 1)
+        fun_l25_n367(x)
+    else
+        fun_l25_n616(x)
+    end
+end
+
+def fun_l24_n860(x)
+    if (x < 1)
+        fun_l25_n184(x)
+    else
+        fun_l25_n912(x)
+    end
+end
+
+def fun_l24_n861(x)
+    if (x < 1)
+        fun_l25_n916(x)
+    else
+        fun_l25_n66(x)
+    end
+end
+
+def fun_l24_n862(x)
+    if (x < 1)
+        fun_l25_n526(x)
+    else
+        fun_l25_n807(x)
+    end
+end
+
+def fun_l24_n863(x)
+    if (x < 1)
+        fun_l25_n83(x)
+    else
+        fun_l25_n180(x)
+    end
+end
+
+def fun_l24_n864(x)
+    if (x < 1)
+        fun_l25_n199(x)
+    else
+        fun_l25_n471(x)
+    end
+end
+
+def fun_l24_n865(x)
+    if (x < 1)
+        fun_l25_n763(x)
+    else
+        fun_l25_n16(x)
+    end
+end
+
+def fun_l24_n866(x)
+    if (x < 1)
+        fun_l25_n280(x)
+    else
+        fun_l25_n66(x)
+    end
+end
+
+def fun_l24_n867(x)
+    if (x < 1)
+        fun_l25_n366(x)
+    else
+        fun_l25_n143(x)
+    end
+end
+
+def fun_l24_n868(x)
+    if (x < 1)
+        fun_l25_n110(x)
+    else
+        fun_l25_n151(x)
+    end
+end
+
+def fun_l24_n869(x)
+    if (x < 1)
+        fun_l25_n936(x)
+    else
+        fun_l25_n153(x)
+    end
+end
+
+def fun_l24_n870(x)
+    if (x < 1)
+        fun_l25_n555(x)
+    else
+        fun_l25_n915(x)
+    end
+end
+
+def fun_l24_n871(x)
+    if (x < 1)
+        fun_l25_n199(x)
+    else
+        fun_l25_n613(x)
+    end
+end
+
+def fun_l24_n872(x)
+    if (x < 1)
+        fun_l25_n381(x)
+    else
+        fun_l25_n899(x)
+    end
+end
+
+def fun_l24_n873(x)
+    if (x < 1)
+        fun_l25_n64(x)
+    else
+        fun_l25_n337(x)
+    end
+end
+
+def fun_l24_n874(x)
+    if (x < 1)
+        fun_l25_n753(x)
+    else
+        fun_l25_n981(x)
+    end
+end
+
+def fun_l24_n875(x)
+    if (x < 1)
+        fun_l25_n113(x)
+    else
+        fun_l25_n126(x)
+    end
+end
+
+def fun_l24_n876(x)
+    if (x < 1)
+        fun_l25_n3(x)
+    else
+        fun_l25_n288(x)
+    end
+end
+
+def fun_l24_n877(x)
+    if (x < 1)
+        fun_l25_n359(x)
+    else
+        fun_l25_n596(x)
+    end
+end
+
+def fun_l24_n878(x)
+    if (x < 1)
+        fun_l25_n937(x)
+    else
+        fun_l25_n72(x)
+    end
+end
+
+def fun_l24_n879(x)
+    if (x < 1)
+        fun_l25_n495(x)
+    else
+        fun_l25_n368(x)
+    end
+end
+
+def fun_l24_n880(x)
+    if (x < 1)
+        fun_l25_n524(x)
+    else
+        fun_l25_n228(x)
+    end
+end
+
+def fun_l24_n881(x)
+    if (x < 1)
+        fun_l25_n438(x)
+    else
+        fun_l25_n986(x)
+    end
+end
+
+def fun_l24_n882(x)
+    if (x < 1)
+        fun_l25_n334(x)
+    else
+        fun_l25_n54(x)
+    end
+end
+
+def fun_l24_n883(x)
+    if (x < 1)
+        fun_l25_n612(x)
+    else
+        fun_l25_n126(x)
+    end
+end
+
+def fun_l24_n884(x)
+    if (x < 1)
+        fun_l25_n316(x)
+    else
+        fun_l25_n222(x)
+    end
+end
+
+def fun_l24_n885(x)
+    if (x < 1)
+        fun_l25_n915(x)
+    else
+        fun_l25_n971(x)
+    end
+end
+
+def fun_l24_n886(x)
+    if (x < 1)
+        fun_l25_n987(x)
+    else
+        fun_l25_n499(x)
+    end
+end
+
+def fun_l24_n887(x)
+    if (x < 1)
+        fun_l25_n476(x)
+    else
+        fun_l25_n280(x)
+    end
+end
+
+def fun_l24_n888(x)
+    if (x < 1)
+        fun_l25_n420(x)
+    else
+        fun_l25_n584(x)
+    end
+end
+
+def fun_l24_n889(x)
+    if (x < 1)
+        fun_l25_n560(x)
+    else
+        fun_l25_n767(x)
+    end
+end
+
+def fun_l24_n890(x)
+    if (x < 1)
+        fun_l25_n26(x)
+    else
+        fun_l25_n431(x)
+    end
+end
+
+def fun_l24_n891(x)
+    if (x < 1)
+        fun_l25_n107(x)
+    else
+        fun_l25_n803(x)
+    end
+end
+
+def fun_l24_n892(x)
+    if (x < 1)
+        fun_l25_n225(x)
+    else
+        fun_l25_n665(x)
+    end
+end
+
+def fun_l24_n893(x)
+    if (x < 1)
+        fun_l25_n19(x)
+    else
+        fun_l25_n507(x)
+    end
+end
+
+def fun_l24_n894(x)
+    if (x < 1)
+        fun_l25_n44(x)
+    else
+        fun_l25_n420(x)
+    end
+end
+
+def fun_l24_n895(x)
+    if (x < 1)
+        fun_l25_n526(x)
+    else
+        fun_l25_n871(x)
+    end
+end
+
+def fun_l24_n896(x)
+    if (x < 1)
+        fun_l25_n900(x)
+    else
+        fun_l25_n824(x)
+    end
+end
+
+def fun_l24_n897(x)
+    if (x < 1)
+        fun_l25_n105(x)
+    else
+        fun_l25_n602(x)
+    end
+end
+
+def fun_l24_n898(x)
+    if (x < 1)
+        fun_l25_n228(x)
+    else
+        fun_l25_n993(x)
+    end
+end
+
+def fun_l24_n899(x)
+    if (x < 1)
+        fun_l25_n330(x)
+    else
+        fun_l25_n60(x)
+    end
+end
+
+def fun_l24_n900(x)
+    if (x < 1)
+        fun_l25_n512(x)
+    else
+        fun_l25_n708(x)
+    end
+end
+
+def fun_l24_n901(x)
+    if (x < 1)
+        fun_l25_n791(x)
+    else
+        fun_l25_n554(x)
+    end
+end
+
+def fun_l24_n902(x)
+    if (x < 1)
+        fun_l25_n204(x)
+    else
+        fun_l25_n439(x)
+    end
+end
+
+def fun_l24_n903(x)
+    if (x < 1)
+        fun_l25_n577(x)
+    else
+        fun_l25_n174(x)
+    end
+end
+
+def fun_l24_n904(x)
+    if (x < 1)
+        fun_l25_n713(x)
+    else
+        fun_l25_n35(x)
+    end
+end
+
+def fun_l24_n905(x)
+    if (x < 1)
+        fun_l25_n290(x)
+    else
+        fun_l25_n342(x)
+    end
+end
+
+def fun_l24_n906(x)
+    if (x < 1)
+        fun_l25_n607(x)
+    else
+        fun_l25_n52(x)
+    end
+end
+
+def fun_l24_n907(x)
+    if (x < 1)
+        fun_l25_n72(x)
+    else
+        fun_l25_n169(x)
+    end
+end
+
+def fun_l24_n908(x)
+    if (x < 1)
+        fun_l25_n179(x)
+    else
+        fun_l25_n383(x)
+    end
+end
+
+def fun_l24_n909(x)
+    if (x < 1)
+        fun_l25_n52(x)
+    else
+        fun_l25_n504(x)
+    end
+end
+
+def fun_l24_n910(x)
+    if (x < 1)
+        fun_l25_n346(x)
+    else
+        fun_l25_n775(x)
+    end
+end
+
+def fun_l24_n911(x)
+    if (x < 1)
+        fun_l25_n535(x)
+    else
+        fun_l25_n210(x)
+    end
+end
+
+def fun_l24_n912(x)
+    if (x < 1)
+        fun_l25_n937(x)
+    else
+        fun_l25_n409(x)
+    end
+end
+
+def fun_l24_n913(x)
+    if (x < 1)
+        fun_l25_n889(x)
+    else
+        fun_l25_n463(x)
+    end
+end
+
+def fun_l24_n914(x)
+    if (x < 1)
+        fun_l25_n75(x)
+    else
+        fun_l25_n817(x)
+    end
+end
+
+def fun_l24_n915(x)
+    if (x < 1)
+        fun_l25_n277(x)
+    else
+        fun_l25_n3(x)
+    end
+end
+
+def fun_l24_n916(x)
+    if (x < 1)
+        fun_l25_n97(x)
+    else
+        fun_l25_n819(x)
+    end
+end
+
+def fun_l24_n917(x)
+    if (x < 1)
+        fun_l25_n412(x)
+    else
+        fun_l25_n851(x)
+    end
+end
+
+def fun_l24_n918(x)
+    if (x < 1)
+        fun_l25_n803(x)
+    else
+        fun_l25_n429(x)
+    end
+end
+
+def fun_l24_n919(x)
+    if (x < 1)
+        fun_l25_n12(x)
+    else
+        fun_l25_n434(x)
+    end
+end
+
+def fun_l24_n920(x)
+    if (x < 1)
+        fun_l25_n721(x)
+    else
+        fun_l25_n553(x)
+    end
+end
+
+def fun_l24_n921(x)
+    if (x < 1)
+        fun_l25_n438(x)
+    else
+        fun_l25_n211(x)
+    end
+end
+
+def fun_l24_n922(x)
+    if (x < 1)
+        fun_l25_n123(x)
+    else
+        fun_l25_n89(x)
+    end
+end
+
+def fun_l24_n923(x)
+    if (x < 1)
+        fun_l25_n696(x)
+    else
+        fun_l25_n78(x)
+    end
+end
+
+def fun_l24_n924(x)
+    if (x < 1)
+        fun_l25_n556(x)
+    else
+        fun_l25_n788(x)
+    end
+end
+
+def fun_l24_n925(x)
+    if (x < 1)
+        fun_l25_n928(x)
+    else
+        fun_l25_n797(x)
+    end
+end
+
+def fun_l24_n926(x)
+    if (x < 1)
+        fun_l25_n796(x)
+    else
+        fun_l25_n84(x)
+    end
+end
+
+def fun_l24_n927(x)
+    if (x < 1)
+        fun_l25_n874(x)
+    else
+        fun_l25_n255(x)
+    end
+end
+
+def fun_l24_n928(x)
+    if (x < 1)
+        fun_l25_n715(x)
+    else
+        fun_l25_n812(x)
+    end
+end
+
+def fun_l24_n929(x)
+    if (x < 1)
+        fun_l25_n384(x)
+    else
+        fun_l25_n859(x)
+    end
+end
+
+def fun_l24_n930(x)
+    if (x < 1)
+        fun_l25_n133(x)
+    else
+        fun_l25_n923(x)
+    end
+end
+
+def fun_l24_n931(x)
+    if (x < 1)
+        fun_l25_n712(x)
+    else
+        fun_l25_n850(x)
+    end
+end
+
+def fun_l24_n932(x)
+    if (x < 1)
+        fun_l25_n301(x)
+    else
+        fun_l25_n743(x)
+    end
+end
+
+def fun_l24_n933(x)
+    if (x < 1)
+        fun_l25_n554(x)
+    else
+        fun_l25_n4(x)
+    end
+end
+
+def fun_l24_n934(x)
+    if (x < 1)
+        fun_l25_n407(x)
+    else
+        fun_l25_n656(x)
+    end
+end
+
+def fun_l24_n935(x)
+    if (x < 1)
+        fun_l25_n109(x)
+    else
+        fun_l25_n356(x)
+    end
+end
+
+def fun_l24_n936(x)
+    if (x < 1)
+        fun_l25_n985(x)
+    else
+        fun_l25_n183(x)
+    end
+end
+
+def fun_l24_n937(x)
+    if (x < 1)
+        fun_l25_n365(x)
+    else
+        fun_l25_n949(x)
+    end
+end
+
+def fun_l24_n938(x)
+    if (x < 1)
+        fun_l25_n672(x)
+    else
+        fun_l25_n417(x)
+    end
+end
+
+def fun_l24_n939(x)
+    if (x < 1)
+        fun_l25_n360(x)
+    else
+        fun_l25_n271(x)
+    end
+end
+
+def fun_l24_n940(x)
+    if (x < 1)
+        fun_l25_n654(x)
+    else
+        fun_l25_n365(x)
+    end
+end
+
+def fun_l24_n941(x)
+    if (x < 1)
+        fun_l25_n836(x)
+    else
+        fun_l25_n303(x)
+    end
+end
+
+def fun_l24_n942(x)
+    if (x < 1)
+        fun_l25_n299(x)
+    else
+        fun_l25_n130(x)
+    end
+end
+
+def fun_l24_n943(x)
+    if (x < 1)
+        fun_l25_n566(x)
+    else
+        fun_l25_n347(x)
+    end
+end
+
+def fun_l24_n944(x)
+    if (x < 1)
+        fun_l25_n754(x)
+    else
+        fun_l25_n670(x)
+    end
+end
+
+def fun_l24_n945(x)
+    if (x < 1)
+        fun_l25_n484(x)
+    else
+        fun_l25_n278(x)
+    end
+end
+
+def fun_l24_n946(x)
+    if (x < 1)
+        fun_l25_n35(x)
+    else
+        fun_l25_n915(x)
+    end
+end
+
+def fun_l24_n947(x)
+    if (x < 1)
+        fun_l25_n488(x)
+    else
+        fun_l25_n664(x)
+    end
+end
+
+def fun_l24_n948(x)
+    if (x < 1)
+        fun_l25_n249(x)
+    else
+        fun_l25_n931(x)
+    end
+end
+
+def fun_l24_n949(x)
+    if (x < 1)
+        fun_l25_n165(x)
+    else
+        fun_l25_n101(x)
+    end
+end
+
+def fun_l24_n950(x)
+    if (x < 1)
+        fun_l25_n304(x)
+    else
+        fun_l25_n668(x)
+    end
+end
+
+def fun_l24_n951(x)
+    if (x < 1)
+        fun_l25_n279(x)
+    else
+        fun_l25_n600(x)
+    end
+end
+
+def fun_l24_n952(x)
+    if (x < 1)
+        fun_l25_n70(x)
+    else
+        fun_l25_n852(x)
+    end
+end
+
+def fun_l24_n953(x)
+    if (x < 1)
+        fun_l25_n419(x)
+    else
+        fun_l25_n856(x)
+    end
+end
+
+def fun_l24_n954(x)
+    if (x < 1)
+        fun_l25_n55(x)
+    else
+        fun_l25_n857(x)
+    end
+end
+
+def fun_l24_n955(x)
+    if (x < 1)
+        fun_l25_n122(x)
+    else
+        fun_l25_n658(x)
+    end
+end
+
+def fun_l24_n956(x)
+    if (x < 1)
+        fun_l25_n973(x)
+    else
+        fun_l25_n421(x)
+    end
+end
+
+def fun_l24_n957(x)
+    if (x < 1)
+        fun_l25_n82(x)
+    else
+        fun_l25_n264(x)
+    end
+end
+
+def fun_l24_n958(x)
+    if (x < 1)
+        fun_l25_n608(x)
+    else
+        fun_l25_n469(x)
+    end
+end
+
+def fun_l24_n959(x)
+    if (x < 1)
+        fun_l25_n823(x)
+    else
+        fun_l25_n320(x)
+    end
+end
+
+def fun_l24_n960(x)
+    if (x < 1)
+        fun_l25_n765(x)
+    else
+        fun_l25_n461(x)
+    end
+end
+
+def fun_l24_n961(x)
+    if (x < 1)
+        fun_l25_n343(x)
+    else
+        fun_l25_n18(x)
+    end
+end
+
+def fun_l24_n962(x)
+    if (x < 1)
+        fun_l25_n346(x)
+    else
+        fun_l25_n821(x)
+    end
+end
+
+def fun_l24_n963(x)
+    if (x < 1)
+        fun_l25_n80(x)
+    else
+        fun_l25_n949(x)
+    end
+end
+
+def fun_l24_n964(x)
+    if (x < 1)
+        fun_l25_n171(x)
+    else
+        fun_l25_n514(x)
+    end
+end
+
+def fun_l24_n965(x)
+    if (x < 1)
+        fun_l25_n625(x)
+    else
+        fun_l25_n768(x)
+    end
+end
+
+def fun_l24_n966(x)
+    if (x < 1)
+        fun_l25_n390(x)
+    else
+        fun_l25_n195(x)
+    end
+end
+
+def fun_l24_n967(x)
+    if (x < 1)
+        fun_l25_n774(x)
+    else
+        fun_l25_n928(x)
+    end
+end
+
+def fun_l24_n968(x)
+    if (x < 1)
+        fun_l25_n997(x)
+    else
+        fun_l25_n441(x)
+    end
+end
+
+def fun_l24_n969(x)
+    if (x < 1)
+        fun_l25_n865(x)
+    else
+        fun_l25_n418(x)
+    end
+end
+
+def fun_l24_n970(x)
+    if (x < 1)
+        fun_l25_n238(x)
+    else
+        fun_l25_n816(x)
+    end
+end
+
+def fun_l24_n971(x)
+    if (x < 1)
+        fun_l25_n521(x)
+    else
+        fun_l25_n427(x)
+    end
+end
+
+def fun_l24_n972(x)
+    if (x < 1)
+        fun_l25_n214(x)
+    else
+        fun_l25_n282(x)
+    end
+end
+
+def fun_l24_n973(x)
+    if (x < 1)
+        fun_l25_n611(x)
+    else
+        fun_l25_n439(x)
+    end
+end
+
+def fun_l24_n974(x)
+    if (x < 1)
+        fun_l25_n395(x)
+    else
+        fun_l25_n593(x)
+    end
+end
+
+def fun_l24_n975(x)
+    if (x < 1)
+        fun_l25_n720(x)
+    else
+        fun_l25_n477(x)
+    end
+end
+
+def fun_l24_n976(x)
+    if (x < 1)
+        fun_l25_n204(x)
+    else
+        fun_l25_n912(x)
+    end
+end
+
+def fun_l24_n977(x)
+    if (x < 1)
+        fun_l25_n703(x)
+    else
+        fun_l25_n651(x)
+    end
+end
+
+def fun_l24_n978(x)
+    if (x < 1)
+        fun_l25_n247(x)
+    else
+        fun_l25_n917(x)
+    end
+end
+
+def fun_l24_n979(x)
+    if (x < 1)
+        fun_l25_n792(x)
+    else
+        fun_l25_n320(x)
+    end
+end
+
+def fun_l24_n980(x)
+    if (x < 1)
+        fun_l25_n480(x)
+    else
+        fun_l25_n128(x)
+    end
+end
+
+def fun_l24_n981(x)
+    if (x < 1)
+        fun_l25_n848(x)
+    else
+        fun_l25_n344(x)
+    end
+end
+
+def fun_l24_n982(x)
+    if (x < 1)
+        fun_l25_n84(x)
+    else
+        fun_l25_n977(x)
+    end
+end
+
+def fun_l24_n983(x)
+    if (x < 1)
+        fun_l25_n213(x)
+    else
+        fun_l25_n131(x)
+    end
+end
+
+def fun_l24_n984(x)
+    if (x < 1)
+        fun_l25_n2(x)
+    else
+        fun_l25_n21(x)
+    end
+end
+
+def fun_l24_n985(x)
+    if (x < 1)
+        fun_l25_n301(x)
+    else
+        fun_l25_n910(x)
+    end
+end
+
+def fun_l24_n986(x)
+    if (x < 1)
+        fun_l25_n533(x)
+    else
+        fun_l25_n397(x)
+    end
+end
+
+def fun_l24_n987(x)
+    if (x < 1)
+        fun_l25_n226(x)
+    else
+        fun_l25_n281(x)
+    end
+end
+
+def fun_l24_n988(x)
+    if (x < 1)
+        fun_l25_n402(x)
+    else
+        fun_l25_n70(x)
+    end
+end
+
+def fun_l24_n989(x)
+    if (x < 1)
+        fun_l25_n190(x)
+    else
+        fun_l25_n70(x)
+    end
+end
+
+def fun_l24_n990(x)
+    if (x < 1)
+        fun_l25_n376(x)
+    else
+        fun_l25_n331(x)
+    end
+end
+
+def fun_l24_n991(x)
+    if (x < 1)
+        fun_l25_n915(x)
+    else
+        fun_l25_n234(x)
+    end
+end
+
+def fun_l24_n992(x)
+    if (x < 1)
+        fun_l25_n146(x)
+    else
+        fun_l25_n825(x)
+    end
+end
+
+def fun_l24_n993(x)
+    if (x < 1)
+        fun_l25_n877(x)
+    else
+        fun_l25_n237(x)
+    end
+end
+
+def fun_l24_n994(x)
+    if (x < 1)
+        fun_l25_n454(x)
+    else
+        fun_l25_n852(x)
+    end
+end
+
+def fun_l24_n995(x)
+    if (x < 1)
+        fun_l25_n45(x)
+    else
+        fun_l25_n337(x)
+    end
+end
+
+def fun_l24_n996(x)
+    if (x < 1)
+        fun_l25_n491(x)
+    else
+        fun_l25_n319(x)
+    end
+end
+
+def fun_l24_n997(x)
+    if (x < 1)
+        fun_l25_n216(x)
+    else
+        fun_l25_n249(x)
+    end
+end
+
+def fun_l24_n998(x)
+    if (x < 1)
+        fun_l25_n370(x)
+    else
+        fun_l25_n747(x)
+    end
+end
+
+def fun_l24_n999(x)
+    if (x < 1)
+        fun_l25_n584(x)
+    else
+        fun_l25_n813(x)
+    end
+end
+
+def fun_l25_n0(x)
+    if (x < 1)
+        fun_l26_n818(x)
+    else
+        fun_l26_n750(x)
+    end
+end
+
+def fun_l25_n1(x)
+    if (x < 1)
+        fun_l26_n725(x)
+    else
+        fun_l26_n848(x)
+    end
+end
+
+def fun_l25_n2(x)
+    if (x < 1)
+        fun_l26_n716(x)
+    else
+        fun_l26_n190(x)
+    end
+end
+
+def fun_l25_n3(x)
+    if (x < 1)
+        fun_l26_n977(x)
+    else
+        fun_l26_n222(x)
+    end
+end
+
+def fun_l25_n4(x)
+    if (x < 1)
+        fun_l26_n931(x)
+    else
+        fun_l26_n615(x)
+    end
+end
+
+def fun_l25_n5(x)
+    if (x < 1)
+        fun_l26_n720(x)
+    else
+        fun_l26_n440(x)
+    end
+end
+
+def fun_l25_n6(x)
+    if (x < 1)
+        fun_l26_n400(x)
+    else
+        fun_l26_n336(x)
+    end
+end
+
+def fun_l25_n7(x)
+    if (x < 1)
+        fun_l26_n109(x)
+    else
+        fun_l26_n74(x)
+    end
+end
+
+def fun_l25_n8(x)
+    if (x < 1)
+        fun_l26_n12(x)
+    else
+        fun_l26_n857(x)
+    end
+end
+
+def fun_l25_n9(x)
+    if (x < 1)
+        fun_l26_n778(x)
+    else
+        fun_l26_n286(x)
+    end
+end
+
+def fun_l25_n10(x)
+    if (x < 1)
+        fun_l26_n857(x)
+    else
+        fun_l26_n311(x)
+    end
+end
+
+def fun_l25_n11(x)
+    if (x < 1)
+        fun_l26_n204(x)
+    else
+        fun_l26_n348(x)
+    end
+end
+
+def fun_l25_n12(x)
+    if (x < 1)
+        fun_l26_n626(x)
+    else
+        fun_l26_n983(x)
+    end
+end
+
+def fun_l25_n13(x)
+    if (x < 1)
+        fun_l26_n417(x)
+    else
+        fun_l26_n334(x)
+    end
+end
+
+def fun_l25_n14(x)
+    if (x < 1)
+        fun_l26_n34(x)
+    else
+        fun_l26_n269(x)
+    end
+end
+
+def fun_l25_n15(x)
+    if (x < 1)
+        fun_l26_n184(x)
+    else
+        fun_l26_n183(x)
+    end
+end
+
+def fun_l25_n16(x)
+    if (x < 1)
+        fun_l26_n744(x)
+    else
+        fun_l26_n450(x)
+    end
+end
+
+def fun_l25_n17(x)
+    if (x < 1)
+        fun_l26_n763(x)
+    else
+        fun_l26_n390(x)
+    end
+end
+
+def fun_l25_n18(x)
+    if (x < 1)
+        fun_l26_n926(x)
+    else
+        fun_l26_n379(x)
+    end
+end
+
+def fun_l25_n19(x)
+    if (x < 1)
+        fun_l26_n746(x)
+    else
+        fun_l26_n946(x)
+    end
+end
+
+def fun_l25_n20(x)
+    if (x < 1)
+        fun_l26_n500(x)
+    else
+        fun_l26_n599(x)
+    end
+end
+
+def fun_l25_n21(x)
+    if (x < 1)
+        fun_l26_n757(x)
+    else
+        fun_l26_n725(x)
+    end
+end
+
+def fun_l25_n22(x)
+    if (x < 1)
+        fun_l26_n738(x)
+    else
+        fun_l26_n24(x)
+    end
+end
+
+def fun_l25_n23(x)
+    if (x < 1)
+        fun_l26_n350(x)
+    else
+        fun_l26_n344(x)
+    end
+end
+
+def fun_l25_n24(x)
+    if (x < 1)
+        fun_l26_n521(x)
+    else
+        fun_l26_n680(x)
+    end
+end
+
+def fun_l25_n25(x)
+    if (x < 1)
+        fun_l26_n647(x)
+    else
+        fun_l26_n604(x)
+    end
+end
+
+def fun_l25_n26(x)
+    if (x < 1)
+        fun_l26_n990(x)
+    else
+        fun_l26_n262(x)
+    end
+end
+
+def fun_l25_n27(x)
+    if (x < 1)
+        fun_l26_n309(x)
+    else
+        fun_l26_n759(x)
+    end
+end
+
+def fun_l25_n28(x)
+    if (x < 1)
+        fun_l26_n720(x)
+    else
+        fun_l26_n11(x)
+    end
+end
+
+def fun_l25_n29(x)
+    if (x < 1)
+        fun_l26_n761(x)
+    else
+        fun_l26_n690(x)
+    end
+end
+
+def fun_l25_n30(x)
+    if (x < 1)
+        fun_l26_n729(x)
+    else
+        fun_l26_n577(x)
+    end
+end
+
+def fun_l25_n31(x)
+    if (x < 1)
+        fun_l26_n321(x)
+    else
+        fun_l26_n608(x)
+    end
+end
+
+def fun_l25_n32(x)
+    if (x < 1)
+        fun_l26_n325(x)
+    else
+        fun_l26_n541(x)
+    end
+end
+
+def fun_l25_n33(x)
+    if (x < 1)
+        fun_l26_n644(x)
+    else
+        fun_l26_n15(x)
+    end
+end
+
+def fun_l25_n34(x)
+    if (x < 1)
+        fun_l26_n53(x)
+    else
+        fun_l26_n887(x)
+    end
+end
+
+def fun_l25_n35(x)
+    if (x < 1)
+        fun_l26_n470(x)
+    else
+        fun_l26_n564(x)
+    end
+end
+
+def fun_l25_n36(x)
+    if (x < 1)
+        fun_l26_n198(x)
+    else
+        fun_l26_n542(x)
+    end
+end
+
+def fun_l25_n37(x)
+    if (x < 1)
+        fun_l26_n455(x)
+    else
+        fun_l26_n373(x)
+    end
+end
+
+def fun_l25_n38(x)
+    if (x < 1)
+        fun_l26_n216(x)
+    else
+        fun_l26_n86(x)
+    end
+end
+
+def fun_l25_n39(x)
+    if (x < 1)
+        fun_l26_n417(x)
+    else
+        fun_l26_n50(x)
+    end
+end
+
+def fun_l25_n40(x)
+    if (x < 1)
+        fun_l26_n955(x)
+    else
+        fun_l26_n979(x)
+    end
+end
+
+def fun_l25_n41(x)
+    if (x < 1)
+        fun_l26_n692(x)
+    else
+        fun_l26_n935(x)
+    end
+end
+
+def fun_l25_n42(x)
+    if (x < 1)
+        fun_l26_n360(x)
+    else
+        fun_l26_n246(x)
+    end
+end
+
+def fun_l25_n43(x)
+    if (x < 1)
+        fun_l26_n826(x)
+    else
+        fun_l26_n433(x)
+    end
+end
+
+def fun_l25_n44(x)
+    if (x < 1)
+        fun_l26_n222(x)
+    else
+        fun_l26_n101(x)
+    end
+end
+
+def fun_l25_n45(x)
+    if (x < 1)
+        fun_l26_n590(x)
+    else
+        fun_l26_n398(x)
+    end
+end
+
+def fun_l25_n46(x)
+    if (x < 1)
+        fun_l26_n959(x)
+    else
+        fun_l26_n620(x)
+    end
+end
+
+def fun_l25_n47(x)
+    if (x < 1)
+        fun_l26_n530(x)
+    else
+        fun_l26_n503(x)
+    end
+end
+
+def fun_l25_n48(x)
+    if (x < 1)
+        fun_l26_n615(x)
+    else
+        fun_l26_n640(x)
+    end
+end
+
+def fun_l25_n49(x)
+    if (x < 1)
+        fun_l26_n774(x)
+    else
+        fun_l26_n23(x)
+    end
+end
+
+def fun_l25_n50(x)
+    if (x < 1)
+        fun_l26_n344(x)
+    else
+        fun_l26_n303(x)
+    end
+end
+
+def fun_l25_n51(x)
+    if (x < 1)
+        fun_l26_n54(x)
+    else
+        fun_l26_n26(x)
+    end
+end
+
+def fun_l25_n52(x)
+    if (x < 1)
+        fun_l26_n545(x)
+    else
+        fun_l26_n791(x)
+    end
+end
+
+def fun_l25_n53(x)
+    if (x < 1)
+        fun_l26_n554(x)
+    else
+        fun_l26_n42(x)
+    end
+end
+
+def fun_l25_n54(x)
+    if (x < 1)
+        fun_l26_n419(x)
+    else
+        fun_l26_n179(x)
+    end
+end
+
+def fun_l25_n55(x)
+    if (x < 1)
+        fun_l26_n845(x)
+    else
+        fun_l26_n641(x)
+    end
+end
+
+def fun_l25_n56(x)
+    if (x < 1)
+        fun_l26_n389(x)
+    else
+        fun_l26_n547(x)
+    end
+end
+
+def fun_l25_n57(x)
+    if (x < 1)
+        fun_l26_n744(x)
+    else
+        fun_l26_n946(x)
+    end
+end
+
+def fun_l25_n58(x)
+    if (x < 1)
+        fun_l26_n410(x)
+    else
+        fun_l26_n909(x)
+    end
+end
+
+def fun_l25_n59(x)
+    if (x < 1)
+        fun_l26_n126(x)
+    else
+        fun_l26_n382(x)
+    end
+end
+
+def fun_l25_n60(x)
+    if (x < 1)
+        fun_l26_n355(x)
+    else
+        fun_l26_n902(x)
+    end
+end
+
+def fun_l25_n61(x)
+    if (x < 1)
+        fun_l26_n759(x)
+    else
+        fun_l26_n445(x)
+    end
+end
+
+def fun_l25_n62(x)
+    if (x < 1)
+        fun_l26_n859(x)
+    else
+        fun_l26_n362(x)
+    end
+end
+
+def fun_l25_n63(x)
+    if (x < 1)
+        fun_l26_n488(x)
+    else
+        fun_l26_n725(x)
+    end
+end
+
+def fun_l25_n64(x)
+    if (x < 1)
+        fun_l26_n268(x)
+    else
+        fun_l26_n865(x)
+    end
+end
+
+def fun_l25_n65(x)
+    if (x < 1)
+        fun_l26_n33(x)
+    else
+        fun_l26_n417(x)
+    end
+end
+
+def fun_l25_n66(x)
+    if (x < 1)
+        fun_l26_n281(x)
+    else
+        fun_l26_n485(x)
+    end
+end
+
+def fun_l25_n67(x)
+    if (x < 1)
+        fun_l26_n627(x)
+    else
+        fun_l26_n200(x)
+    end
+end
+
+def fun_l25_n68(x)
+    if (x < 1)
+        fun_l26_n392(x)
+    else
+        fun_l26_n639(x)
+    end
+end
+
+def fun_l25_n69(x)
+    if (x < 1)
+        fun_l26_n799(x)
+    else
+        fun_l26_n242(x)
+    end
+end
+
+def fun_l25_n70(x)
+    if (x < 1)
+        fun_l26_n783(x)
+    else
+        fun_l26_n564(x)
+    end
+end
+
+def fun_l25_n71(x)
+    if (x < 1)
+        fun_l26_n768(x)
+    else
+        fun_l26_n908(x)
+    end
+end
+
+def fun_l25_n72(x)
+    if (x < 1)
+        fun_l26_n567(x)
+    else
+        fun_l26_n365(x)
+    end
+end
+
+def fun_l25_n73(x)
+    if (x < 1)
+        fun_l26_n291(x)
+    else
+        fun_l26_n887(x)
+    end
+end
+
+def fun_l25_n74(x)
+    if (x < 1)
+        fun_l26_n889(x)
+    else
+        fun_l26_n180(x)
+    end
+end
+
+def fun_l25_n75(x)
+    if (x < 1)
+        fun_l26_n142(x)
+    else
+        fun_l26_n101(x)
+    end
+end
+
+def fun_l25_n76(x)
+    if (x < 1)
+        fun_l26_n108(x)
+    else
+        fun_l26_n863(x)
+    end
+end
+
+def fun_l25_n77(x)
+    if (x < 1)
+        fun_l26_n441(x)
+    else
+        fun_l26_n51(x)
+    end
+end
+
+def fun_l25_n78(x)
+    if (x < 1)
+        fun_l26_n787(x)
+    else
+        fun_l26_n543(x)
+    end
+end
+
+def fun_l25_n79(x)
+    if (x < 1)
+        fun_l26_n699(x)
+    else
+        fun_l26_n513(x)
+    end
+end
+
+def fun_l25_n80(x)
+    if (x < 1)
+        fun_l26_n400(x)
+    else
+        fun_l26_n72(x)
+    end
+end
+
+def fun_l25_n81(x)
+    if (x < 1)
+        fun_l26_n814(x)
+    else
+        fun_l26_n732(x)
+    end
+end
+
+def fun_l25_n82(x)
+    if (x < 1)
+        fun_l26_n755(x)
+    else
+        fun_l26_n606(x)
+    end
+end
+
+def fun_l25_n83(x)
+    if (x < 1)
+        fun_l26_n351(x)
+    else
+        fun_l26_n208(x)
+    end
+end
+
+def fun_l25_n84(x)
+    if (x < 1)
+        fun_l26_n124(x)
+    else
+        fun_l26_n554(x)
+    end
+end
+
+def fun_l25_n85(x)
+    if (x < 1)
+        fun_l26_n19(x)
+    else
+        fun_l26_n58(x)
+    end
+end
+
+def fun_l25_n86(x)
+    if (x < 1)
+        fun_l26_n710(x)
+    else
+        fun_l26_n300(x)
+    end
+end
+
+def fun_l25_n87(x)
+    if (x < 1)
+        fun_l26_n833(x)
+    else
+        fun_l26_n53(x)
+    end
+end
+
+def fun_l25_n88(x)
+    if (x < 1)
+        fun_l26_n923(x)
+    else
+        fun_l26_n445(x)
+    end
+end
+
+def fun_l25_n89(x)
+    if (x < 1)
+        fun_l26_n674(x)
+    else
+        fun_l26_n176(x)
+    end
+end
+
+def fun_l25_n90(x)
+    if (x < 1)
+        fun_l26_n78(x)
+    else
+        fun_l26_n506(x)
+    end
+end
+
+def fun_l25_n91(x)
+    if (x < 1)
+        fun_l26_n352(x)
+    else
+        fun_l26_n312(x)
+    end
+end
+
+def fun_l25_n92(x)
+    if (x < 1)
+        fun_l26_n400(x)
+    else
+        fun_l26_n787(x)
+    end
+end
+
+def fun_l25_n93(x)
+    if (x < 1)
+        fun_l26_n897(x)
+    else
+        fun_l26_n395(x)
+    end
+end
+
+def fun_l25_n94(x)
+    if (x < 1)
+        fun_l26_n267(x)
+    else
+        fun_l26_n974(x)
+    end
+end
+
+def fun_l25_n95(x)
+    if (x < 1)
+        fun_l26_n547(x)
+    else
+        fun_l26_n280(x)
+    end
+end
+
+def fun_l25_n96(x)
+    if (x < 1)
+        fun_l26_n281(x)
+    else
+        fun_l26_n222(x)
+    end
+end
+
+def fun_l25_n97(x)
+    if (x < 1)
+        fun_l26_n130(x)
+    else
+        fun_l26_n232(x)
+    end
+end
+
+def fun_l25_n98(x)
+    if (x < 1)
+        fun_l26_n863(x)
+    else
+        fun_l26_n970(x)
+    end
+end
+
+def fun_l25_n99(x)
+    if (x < 1)
+        fun_l26_n28(x)
+    else
+        fun_l26_n344(x)
+    end
+end
+
+def fun_l25_n100(x)
+    if (x < 1)
+        fun_l26_n906(x)
+    else
+        fun_l26_n818(x)
+    end
+end
+
+def fun_l25_n101(x)
+    if (x < 1)
+        fun_l26_n658(x)
+    else
+        fun_l26_n708(x)
+    end
+end
+
+def fun_l25_n102(x)
+    if (x < 1)
+        fun_l26_n545(x)
+    else
+        fun_l26_n627(x)
+    end
+end
+
+def fun_l25_n103(x)
+    if (x < 1)
+        fun_l26_n377(x)
+    else
+        fun_l26_n555(x)
+    end
+end
+
+def fun_l25_n104(x)
+    if (x < 1)
+        fun_l26_n628(x)
+    else
+        fun_l26_n465(x)
+    end
+end
+
+def fun_l25_n105(x)
+    if (x < 1)
+        fun_l26_n208(x)
+    else
+        fun_l26_n720(x)
+    end
+end
+
+def fun_l25_n106(x)
+    if (x < 1)
+        fun_l26_n203(x)
+    else
+        fun_l26_n984(x)
+    end
+end
+
+def fun_l25_n107(x)
+    if (x < 1)
+        fun_l26_n265(x)
+    else
+        fun_l26_n124(x)
+    end
+end
+
+def fun_l25_n108(x)
+    if (x < 1)
+        fun_l26_n786(x)
+    else
+        fun_l26_n305(x)
+    end
+end
+
+def fun_l25_n109(x)
+    if (x < 1)
+        fun_l26_n907(x)
+    else
+        fun_l26_n57(x)
+    end
+end
+
+def fun_l25_n110(x)
+    if (x < 1)
+        fun_l26_n883(x)
+    else
+        fun_l26_n107(x)
+    end
+end
+
+def fun_l25_n111(x)
+    if (x < 1)
+        fun_l26_n783(x)
+    else
+        fun_l26_n443(x)
+    end
+end
+
+def fun_l25_n112(x)
+    if (x < 1)
+        fun_l26_n309(x)
+    else
+        fun_l26_n127(x)
+    end
+end
+
+def fun_l25_n113(x)
+    if (x < 1)
+        fun_l26_n578(x)
+    else
+        fun_l26_n656(x)
+    end
+end
+
+def fun_l25_n114(x)
+    if (x < 1)
+        fun_l26_n352(x)
+    else
+        fun_l26_n610(x)
+    end
+end
+
+def fun_l25_n115(x)
+    if (x < 1)
+        fun_l26_n975(x)
+    else
+        fun_l26_n580(x)
+    end
+end
+
+def fun_l25_n116(x)
+    if (x < 1)
+        fun_l26_n892(x)
+    else
+        fun_l26_n596(x)
+    end
+end
+
+def fun_l25_n117(x)
+    if (x < 1)
+        fun_l26_n80(x)
+    else
+        fun_l26_n759(x)
+    end
+end
+
+def fun_l25_n118(x)
+    if (x < 1)
+        fun_l26_n866(x)
+    else
+        fun_l26_n964(x)
+    end
+end
+
+def fun_l25_n119(x)
+    if (x < 1)
+        fun_l26_n367(x)
+    else
+        fun_l26_n896(x)
+    end
+end
+
+def fun_l25_n120(x)
+    if (x < 1)
+        fun_l26_n787(x)
+    else
+        fun_l26_n17(x)
+    end
+end
+
+def fun_l25_n121(x)
+    if (x < 1)
+        fun_l26_n312(x)
+    else
+        fun_l26_n247(x)
+    end
+end
+
+def fun_l25_n122(x)
+    if (x < 1)
+        fun_l26_n163(x)
+    else
+        fun_l26_n906(x)
+    end
+end
+
+def fun_l25_n123(x)
+    if (x < 1)
+        fun_l26_n706(x)
+    else
+        fun_l26_n840(x)
+    end
+end
+
+def fun_l25_n124(x)
+    if (x < 1)
+        fun_l26_n85(x)
+    else
+        fun_l26_n200(x)
+    end
+end
+
+def fun_l25_n125(x)
+    if (x < 1)
+        fun_l26_n389(x)
+    else
+        fun_l26_n274(x)
+    end
+end
+
+def fun_l25_n126(x)
+    if (x < 1)
+        fun_l26_n509(x)
+    else
+        fun_l26_n471(x)
+    end
+end
+
+def fun_l25_n127(x)
+    if (x < 1)
+        fun_l26_n924(x)
+    else
+        fun_l26_n132(x)
+    end
+end
+
+def fun_l25_n128(x)
+    if (x < 1)
+        fun_l26_n496(x)
+    else
+        fun_l26_n865(x)
+    end
+end
+
+def fun_l25_n129(x)
+    if (x < 1)
+        fun_l26_n775(x)
+    else
+        fun_l26_n22(x)
+    end
+end
+
+def fun_l25_n130(x)
+    if (x < 1)
+        fun_l26_n875(x)
+    else
+        fun_l26_n771(x)
+    end
+end
+
+def fun_l25_n131(x)
+    if (x < 1)
+        fun_l26_n656(x)
+    else
+        fun_l26_n709(x)
+    end
+end
+
+def fun_l25_n132(x)
+    if (x < 1)
+        fun_l26_n733(x)
+    else
+        fun_l26_n343(x)
+    end
+end
+
+def fun_l25_n133(x)
+    if (x < 1)
+        fun_l26_n791(x)
+    else
+        fun_l26_n954(x)
+    end
+end
+
+def fun_l25_n134(x)
+    if (x < 1)
+        fun_l26_n792(x)
+    else
+        fun_l26_n118(x)
+    end
+end
+
+def fun_l25_n135(x)
+    if (x < 1)
+        fun_l26_n93(x)
+    else
+        fun_l26_n683(x)
+    end
+end
+
+def fun_l25_n136(x)
+    if (x < 1)
+        fun_l26_n290(x)
+    else
+        fun_l26_n787(x)
+    end
+end
+
+def fun_l25_n137(x)
+    if (x < 1)
+        fun_l26_n459(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n138(x)
+    if (x < 1)
+        fun_l26_n240(x)
+    else
+        fun_l26_n552(x)
+    end
+end
+
+def fun_l25_n139(x)
+    if (x < 1)
+        fun_l26_n323(x)
+    else
+        fun_l26_n157(x)
+    end
+end
+
+def fun_l25_n140(x)
+    if (x < 1)
+        fun_l26_n926(x)
+    else
+        fun_l26_n446(x)
+    end
+end
+
+def fun_l25_n141(x)
+    if (x < 1)
+        fun_l26_n382(x)
+    else
+        fun_l26_n317(x)
+    end
+end
+
+def fun_l25_n142(x)
+    if (x < 1)
+        fun_l26_n296(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n143(x)
+    if (x < 1)
+        fun_l26_n313(x)
+    else
+        fun_l26_n222(x)
+    end
+end
+
+def fun_l25_n144(x)
+    if (x < 1)
+        fun_l26_n25(x)
+    else
+        fun_l26_n260(x)
+    end
+end
+
+def fun_l25_n145(x)
+    if (x < 1)
+        fun_l26_n457(x)
+    else
+        fun_l26_n876(x)
+    end
+end
+
+def fun_l25_n146(x)
+    if (x < 1)
+        fun_l26_n503(x)
+    else
+        fun_l26_n850(x)
+    end
+end
+
+def fun_l25_n147(x)
+    if (x < 1)
+        fun_l26_n811(x)
+    else
+        fun_l26_n293(x)
+    end
+end
+
+def fun_l25_n148(x)
+    if (x < 1)
+        fun_l26_n433(x)
+    else
+        fun_l26_n582(x)
+    end
+end
+
+def fun_l25_n149(x)
+    if (x < 1)
+        fun_l26_n860(x)
+    else
+        fun_l26_n663(x)
+    end
+end
+
+def fun_l25_n150(x)
+    if (x < 1)
+        fun_l26_n293(x)
+    else
+        fun_l26_n341(x)
+    end
+end
+
+def fun_l25_n151(x)
+    if (x < 1)
+        fun_l26_n187(x)
+    else
+        fun_l26_n430(x)
+    end
+end
+
+def fun_l25_n152(x)
+    if (x < 1)
+        fun_l26_n914(x)
+    else
+        fun_l26_n250(x)
+    end
+end
+
+def fun_l25_n153(x)
+    if (x < 1)
+        fun_l26_n370(x)
+    else
+        fun_l26_n378(x)
+    end
+end
+
+def fun_l25_n154(x)
+    if (x < 1)
+        fun_l26_n238(x)
+    else
+        fun_l26_n743(x)
+    end
+end
+
+def fun_l25_n155(x)
+    if (x < 1)
+        fun_l26_n149(x)
+    else
+        fun_l26_n556(x)
+    end
+end
+
+def fun_l25_n156(x)
+    if (x < 1)
+        fun_l26_n530(x)
+    else
+        fun_l26_n543(x)
+    end
+end
+
+def fun_l25_n157(x)
+    if (x < 1)
+        fun_l26_n230(x)
+    else
+        fun_l26_n600(x)
+    end
+end
+
+def fun_l25_n158(x)
+    if (x < 1)
+        fun_l26_n110(x)
+    else
+        fun_l26_n954(x)
+    end
+end
+
+def fun_l25_n159(x)
+    if (x < 1)
+        fun_l26_n952(x)
+    else
+        fun_l26_n110(x)
+    end
+end
+
+def fun_l25_n160(x)
+    if (x < 1)
+        fun_l26_n525(x)
+    else
+        fun_l26_n435(x)
+    end
+end
+
+def fun_l25_n161(x)
+    if (x < 1)
+        fun_l26_n511(x)
+    else
+        fun_l26_n10(x)
+    end
+end
+
+def fun_l25_n162(x)
+    if (x < 1)
+        fun_l26_n755(x)
+    else
+        fun_l26_n567(x)
+    end
+end
+
+def fun_l25_n163(x)
+    if (x < 1)
+        fun_l26_n618(x)
+    else
+        fun_l26_n249(x)
+    end
+end
+
+def fun_l25_n164(x)
+    if (x < 1)
+        fun_l26_n803(x)
+    else
+        fun_l26_n512(x)
+    end
+end
+
+def fun_l25_n165(x)
+    if (x < 1)
+        fun_l26_n234(x)
+    else
+        fun_l26_n806(x)
+    end
+end
+
+def fun_l25_n166(x)
+    if (x < 1)
+        fun_l26_n442(x)
+    else
+        fun_l26_n904(x)
+    end
+end
+
+def fun_l25_n167(x)
+    if (x < 1)
+        fun_l26_n369(x)
+    else
+        fun_l26_n910(x)
+    end
+end
+
+def fun_l25_n168(x)
+    if (x < 1)
+        fun_l26_n107(x)
+    else
+        fun_l26_n125(x)
+    end
+end
+
+def fun_l25_n169(x)
+    if (x < 1)
+        fun_l26_n415(x)
+    else
+        fun_l26_n37(x)
+    end
+end
+
+def fun_l25_n170(x)
+    if (x < 1)
+        fun_l26_n315(x)
+    else
+        fun_l26_n977(x)
+    end
+end
+
+def fun_l25_n171(x)
+    if (x < 1)
+        fun_l26_n106(x)
+    else
+        fun_l26_n908(x)
+    end
+end
+
+def fun_l25_n172(x)
+    if (x < 1)
+        fun_l26_n870(x)
+    else
+        fun_l26_n74(x)
+    end
+end
+
+def fun_l25_n173(x)
+    if (x < 1)
+        fun_l26_n290(x)
+    else
+        fun_l26_n938(x)
+    end
+end
+
+def fun_l25_n174(x)
+    if (x < 1)
+        fun_l26_n908(x)
+    else
+        fun_l26_n215(x)
+    end
+end
+
+def fun_l25_n175(x)
+    if (x < 1)
+        fun_l26_n671(x)
+    else
+        fun_l26_n976(x)
+    end
+end
+
+def fun_l25_n176(x)
+    if (x < 1)
+        fun_l26_n727(x)
+    else
+        fun_l26_n559(x)
+    end
+end
+
+def fun_l25_n177(x)
+    if (x < 1)
+        fun_l26_n684(x)
+    else
+        fun_l26_n353(x)
+    end
+end
+
+def fun_l25_n178(x)
+    if (x < 1)
+        fun_l26_n353(x)
+    else
+        fun_l26_n327(x)
+    end
+end
+
+def fun_l25_n179(x)
+    if (x < 1)
+        fun_l26_n393(x)
+    else
+        fun_l26_n774(x)
+    end
+end
+
+def fun_l25_n180(x)
+    if (x < 1)
+        fun_l26_n500(x)
+    else
+        fun_l26_n23(x)
+    end
+end
+
+def fun_l25_n181(x)
+    if (x < 1)
+        fun_l26_n49(x)
+    else
+        fun_l26_n504(x)
+    end
+end
+
+def fun_l25_n182(x)
+    if (x < 1)
+        fun_l26_n631(x)
+    else
+        fun_l26_n147(x)
+    end
+end
+
+def fun_l25_n183(x)
+    if (x < 1)
+        fun_l26_n353(x)
+    else
+        fun_l26_n64(x)
+    end
+end
+
+def fun_l25_n184(x)
+    if (x < 1)
+        fun_l26_n215(x)
+    else
+        fun_l26_n416(x)
+    end
+end
+
+def fun_l25_n185(x)
+    if (x < 1)
+        fun_l26_n701(x)
+    else
+        fun_l26_n809(x)
+    end
+end
+
+def fun_l25_n186(x)
+    if (x < 1)
+        fun_l26_n267(x)
+    else
+        fun_l26_n197(x)
+    end
+end
+
+def fun_l25_n187(x)
+    if (x < 1)
+        fun_l26_n436(x)
+    else
+        fun_l26_n609(x)
+    end
+end
+
+def fun_l25_n188(x)
+    if (x < 1)
+        fun_l26_n993(x)
+    else
+        fun_l26_n740(x)
+    end
+end
+
+def fun_l25_n189(x)
+    if (x < 1)
+        fun_l26_n742(x)
+    else
+        fun_l26_n507(x)
+    end
+end
+
+def fun_l25_n190(x)
+    if (x < 1)
+        fun_l26_n850(x)
+    else
+        fun_l26_n394(x)
+    end
+end
+
+def fun_l25_n191(x)
+    if (x < 1)
+        fun_l26_n494(x)
+    else
+        fun_l26_n219(x)
+    end
+end
+
+def fun_l25_n192(x)
+    if (x < 1)
+        fun_l26_n477(x)
+    else
+        fun_l26_n115(x)
+    end
+end
+
+def fun_l25_n193(x)
+    if (x < 1)
+        fun_l26_n629(x)
+    else
+        fun_l26_n772(x)
+    end
+end
+
+def fun_l25_n194(x)
+    if (x < 1)
+        fun_l26_n995(x)
+    else
+        fun_l26_n75(x)
+    end
+end
+
+def fun_l25_n195(x)
+    if (x < 1)
+        fun_l26_n34(x)
+    else
+        fun_l26_n590(x)
+    end
+end
+
+def fun_l25_n196(x)
+    if (x < 1)
+        fun_l26_n767(x)
+    else
+        fun_l26_n468(x)
+    end
+end
+
+def fun_l25_n197(x)
+    if (x < 1)
+        fun_l26_n883(x)
+    else
+        fun_l26_n757(x)
+    end
+end
+
+def fun_l25_n198(x)
+    if (x < 1)
+        fun_l26_n687(x)
+    else
+        fun_l26_n288(x)
+    end
+end
+
+def fun_l25_n199(x)
+    if (x < 1)
+        fun_l26_n328(x)
+    else
+        fun_l26_n556(x)
+    end
+end
+
+def fun_l25_n200(x)
+    if (x < 1)
+        fun_l26_n894(x)
+    else
+        fun_l26_n854(x)
+    end
+end
+
+def fun_l25_n201(x)
+    if (x < 1)
+        fun_l26_n343(x)
+    else
+        fun_l26_n889(x)
+    end
+end
+
+def fun_l25_n202(x)
+    if (x < 1)
+        fun_l26_n430(x)
+    else
+        fun_l26_n935(x)
+    end
+end
+
+def fun_l25_n203(x)
+    if (x < 1)
+        fun_l26_n384(x)
+    else
+        fun_l26_n37(x)
+    end
+end
+
+def fun_l25_n204(x)
+    if (x < 1)
+        fun_l26_n821(x)
+    else
+        fun_l26_n509(x)
+    end
+end
+
+def fun_l25_n205(x)
+    if (x < 1)
+        fun_l26_n985(x)
+    else
+        fun_l26_n877(x)
+    end
+end
+
+def fun_l25_n206(x)
+    if (x < 1)
+        fun_l26_n184(x)
+    else
+        fun_l26_n568(x)
+    end
+end
+
+def fun_l25_n207(x)
+    if (x < 1)
+        fun_l26_n753(x)
+    else
+        fun_l26_n922(x)
+    end
+end
+
+def fun_l25_n208(x)
+    if (x < 1)
+        fun_l26_n454(x)
+    else
+        fun_l26_n499(x)
+    end
+end
+
+def fun_l25_n209(x)
+    if (x < 1)
+        fun_l26_n695(x)
+    else
+        fun_l26_n181(x)
+    end
+end
+
+def fun_l25_n210(x)
+    if (x < 1)
+        fun_l26_n139(x)
+    else
+        fun_l26_n456(x)
+    end
+end
+
+def fun_l25_n211(x)
+    if (x < 1)
+        fun_l26_n745(x)
+    else
+        fun_l26_n447(x)
+    end
+end
+
+def fun_l25_n212(x)
+    if (x < 1)
+        fun_l26_n785(x)
+    else
+        fun_l26_n946(x)
+    end
+end
+
+def fun_l25_n213(x)
+    if (x < 1)
+        fun_l26_n161(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n214(x)
+    if (x < 1)
+        fun_l26_n16(x)
+    else
+        fun_l26_n450(x)
+    end
+end
+
+def fun_l25_n215(x)
+    if (x < 1)
+        fun_l26_n818(x)
+    else
+        fun_l26_n2(x)
+    end
+end
+
+def fun_l25_n216(x)
+    if (x < 1)
+        fun_l26_n242(x)
+    else
+        fun_l26_n691(x)
+    end
+end
+
+def fun_l25_n217(x)
+    if (x < 1)
+        fun_l26_n18(x)
+    else
+        fun_l26_n522(x)
+    end
+end
+
+def fun_l25_n218(x)
+    if (x < 1)
+        fun_l26_n87(x)
+    else
+        fun_l26_n888(x)
+    end
+end
+
+def fun_l25_n219(x)
+    if (x < 1)
+        fun_l26_n317(x)
+    else
+        fun_l26_n593(x)
+    end
+end
+
+def fun_l25_n220(x)
+    if (x < 1)
+        fun_l26_n650(x)
+    else
+        fun_l26_n258(x)
+    end
+end
+
+def fun_l25_n221(x)
+    if (x < 1)
+        fun_l26_n381(x)
+    else
+        fun_l26_n500(x)
+    end
+end
+
+def fun_l25_n222(x)
+    if (x < 1)
+        fun_l26_n607(x)
+    else
+        fun_l26_n138(x)
+    end
+end
+
+def fun_l25_n223(x)
+    if (x < 1)
+        fun_l26_n595(x)
+    else
+        fun_l26_n657(x)
+    end
+end
+
+def fun_l25_n224(x)
+    if (x < 1)
+        fun_l26_n166(x)
+    else
+        fun_l26_n420(x)
+    end
+end
+
+def fun_l25_n225(x)
+    if (x < 1)
+        fun_l26_n744(x)
+    else
+        fun_l26_n684(x)
+    end
+end
+
+def fun_l25_n226(x)
+    if (x < 1)
+        fun_l26_n225(x)
+    else
+        fun_l26_n264(x)
+    end
+end
+
+def fun_l25_n227(x)
+    if (x < 1)
+        fun_l26_n140(x)
+    else
+        fun_l26_n387(x)
+    end
+end
+
+def fun_l25_n228(x)
+    if (x < 1)
+        fun_l26_n563(x)
+    else
+        fun_l26_n83(x)
+    end
+end
+
+def fun_l25_n229(x)
+    if (x < 1)
+        fun_l26_n392(x)
+    else
+        fun_l26_n130(x)
+    end
+end
+
+def fun_l25_n230(x)
+    if (x < 1)
+        fun_l26_n687(x)
+    else
+        fun_l26_n970(x)
+    end
+end
+
+def fun_l25_n231(x)
+    if (x < 1)
+        fun_l26_n328(x)
+    else
+        fun_l26_n809(x)
+    end
+end
+
+def fun_l25_n232(x)
+    if (x < 1)
+        fun_l26_n963(x)
+    else
+        fun_l26_n429(x)
+    end
+end
+
+def fun_l25_n233(x)
+    if (x < 1)
+        fun_l26_n290(x)
+    else
+        fun_l26_n131(x)
+    end
+end
+
+def fun_l25_n234(x)
+    if (x < 1)
+        fun_l26_n877(x)
+    else
+        fun_l26_n729(x)
+    end
+end
+
+def fun_l25_n235(x)
+    if (x < 1)
+        fun_l26_n916(x)
+    else
+        fun_l26_n694(x)
+    end
+end
+
+def fun_l25_n236(x)
+    if (x < 1)
+        fun_l26_n901(x)
+    else
+        fun_l26_n226(x)
+    end
+end
+
+def fun_l25_n237(x)
+    if (x < 1)
+        fun_l26_n65(x)
+    else
+        fun_l26_n748(x)
+    end
+end
+
+def fun_l25_n238(x)
+    if (x < 1)
+        fun_l26_n171(x)
+    else
+        fun_l26_n858(x)
+    end
+end
+
+def fun_l25_n239(x)
+    if (x < 1)
+        fun_l26_n391(x)
+    else
+        fun_l26_n809(x)
+    end
+end
+
+def fun_l25_n240(x)
+    if (x < 1)
+        fun_l26_n336(x)
+    else
+        fun_l26_n391(x)
+    end
+end
+
+def fun_l25_n241(x)
+    if (x < 1)
+        fun_l26_n418(x)
+    else
+        fun_l26_n133(x)
+    end
+end
+
+def fun_l25_n242(x)
+    if (x < 1)
+        fun_l26_n617(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n243(x)
+    if (x < 1)
+        fun_l26_n962(x)
+    else
+        fun_l26_n763(x)
+    end
+end
+
+def fun_l25_n244(x)
+    if (x < 1)
+        fun_l26_n34(x)
+    else
+        fun_l26_n629(x)
+    end
+end
+
+def fun_l25_n245(x)
+    if (x < 1)
+        fun_l26_n444(x)
+    else
+        fun_l26_n271(x)
+    end
+end
+
+def fun_l25_n246(x)
+    if (x < 1)
+        fun_l26_n478(x)
+    else
+        fun_l26_n541(x)
+    end
+end
+
+def fun_l25_n247(x)
+    if (x < 1)
+        fun_l26_n796(x)
+    else
+        fun_l26_n673(x)
+    end
+end
+
+def fun_l25_n248(x)
+    if (x < 1)
+        fun_l26_n400(x)
+    else
+        fun_l26_n602(x)
+    end
+end
+
+def fun_l25_n249(x)
+    if (x < 1)
+        fun_l26_n70(x)
+    else
+        fun_l26_n796(x)
+    end
+end
+
+def fun_l25_n250(x)
+    if (x < 1)
+        fun_l26_n187(x)
+    else
+        fun_l26_n602(x)
+    end
+end
+
+def fun_l25_n251(x)
+    if (x < 1)
+        fun_l26_n29(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n252(x)
+    if (x < 1)
+        fun_l26_n49(x)
+    else
+        fun_l26_n522(x)
+    end
+end
+
+def fun_l25_n253(x)
+    if (x < 1)
+        fun_l26_n998(x)
+    else
+        fun_l26_n986(x)
+    end
+end
+
+def fun_l25_n254(x)
+    if (x < 1)
+        fun_l26_n586(x)
+    else
+        fun_l26_n566(x)
+    end
+end
+
+def fun_l25_n255(x)
+    if (x < 1)
+        fun_l26_n474(x)
+    else
+        fun_l26_n279(x)
+    end
+end
+
+def fun_l25_n256(x)
+    if (x < 1)
+        fun_l26_n769(x)
+    else
+        fun_l26_n240(x)
+    end
+end
+
+def fun_l25_n257(x)
+    if (x < 1)
+        fun_l26_n212(x)
+    else
+        fun_l26_n512(x)
+    end
+end
+
+def fun_l25_n258(x)
+    if (x < 1)
+        fun_l26_n980(x)
+    else
+        fun_l26_n715(x)
+    end
+end
+
+def fun_l25_n259(x)
+    if (x < 1)
+        fun_l26_n237(x)
+    else
+        fun_l26_n355(x)
+    end
+end
+
+def fun_l25_n260(x)
+    if (x < 1)
+        fun_l26_n406(x)
+    else
+        fun_l26_n584(x)
+    end
+end
+
+def fun_l25_n261(x)
+    if (x < 1)
+        fun_l26_n632(x)
+    else
+        fun_l26_n28(x)
+    end
+end
+
+def fun_l25_n262(x)
+    if (x < 1)
+        fun_l26_n481(x)
+    else
+        fun_l26_n303(x)
+    end
+end
+
+def fun_l25_n263(x)
+    if (x < 1)
+        fun_l26_n676(x)
+    else
+        fun_l26_n220(x)
+    end
+end
+
+def fun_l25_n264(x)
+    if (x < 1)
+        fun_l26_n757(x)
+    else
+        fun_l26_n58(x)
+    end
+end
+
+def fun_l25_n265(x)
+    if (x < 1)
+        fun_l26_n525(x)
+    else
+        fun_l26_n168(x)
+    end
+end
+
+def fun_l25_n266(x)
+    if (x < 1)
+        fun_l26_n832(x)
+    else
+        fun_l26_n754(x)
+    end
+end
+
+def fun_l25_n267(x)
+    if (x < 1)
+        fun_l26_n723(x)
+    else
+        fun_l26_n830(x)
+    end
+end
+
+def fun_l25_n268(x)
+    if (x < 1)
+        fun_l26_n171(x)
+    else
+        fun_l26_n411(x)
+    end
+end
+
+def fun_l25_n269(x)
+    if (x < 1)
+        fun_l26_n150(x)
+    else
+        fun_l26_n360(x)
+    end
+end
+
+def fun_l25_n270(x)
+    if (x < 1)
+        fun_l26_n401(x)
+    else
+        fun_l26_n767(x)
+    end
+end
+
+def fun_l25_n271(x)
+    if (x < 1)
+        fun_l26_n462(x)
+    else
+        fun_l26_n305(x)
+    end
+end
+
+def fun_l25_n272(x)
+    if (x < 1)
+        fun_l26_n989(x)
+    else
+        fun_l26_n780(x)
+    end
+end
+
+def fun_l25_n273(x)
+    if (x < 1)
+        fun_l26_n2(x)
+    else
+        fun_l26_n735(x)
+    end
+end
+
+def fun_l25_n274(x)
+    if (x < 1)
+        fun_l26_n646(x)
+    else
+        fun_l26_n30(x)
+    end
+end
+
+def fun_l25_n275(x)
+    if (x < 1)
+        fun_l26_n197(x)
+    else
+        fun_l26_n262(x)
+    end
+end
+
+def fun_l25_n276(x)
+    if (x < 1)
+        fun_l26_n647(x)
+    else
+        fun_l26_n715(x)
+    end
+end
+
+def fun_l25_n277(x)
+    if (x < 1)
+        fun_l26_n597(x)
+    else
+        fun_l26_n228(x)
+    end
+end
+
+def fun_l25_n278(x)
+    if (x < 1)
+        fun_l26_n880(x)
+    else
+        fun_l26_n324(x)
+    end
+end
+
+def fun_l25_n279(x)
+    if (x < 1)
+        fun_l26_n40(x)
+    else
+        fun_l26_n615(x)
+    end
+end
+
+def fun_l25_n280(x)
+    if (x < 1)
+        fun_l26_n697(x)
+    else
+        fun_l26_n671(x)
+    end
+end
+
+def fun_l25_n281(x)
+    if (x < 1)
+        fun_l26_n819(x)
+    else
+        fun_l26_n469(x)
+    end
+end
+
+def fun_l25_n282(x)
+    if (x < 1)
+        fun_l26_n427(x)
+    else
+        fun_l26_n295(x)
+    end
+end
+
+def fun_l25_n283(x)
+    if (x < 1)
+        fun_l26_n35(x)
+    else
+        fun_l26_n432(x)
+    end
+end
+
+def fun_l25_n284(x)
+    if (x < 1)
+        fun_l26_n691(x)
+    else
+        fun_l26_n846(x)
+    end
+end
+
+def fun_l25_n285(x)
+    if (x < 1)
+        fun_l26_n353(x)
+    else
+        fun_l26_n473(x)
+    end
+end
+
+def fun_l25_n286(x)
+    if (x < 1)
+        fun_l26_n959(x)
+    else
+        fun_l26_n608(x)
+    end
+end
+
+def fun_l25_n287(x)
+    if (x < 1)
+        fun_l26_n728(x)
+    else
+        fun_l26_n993(x)
+    end
+end
+
+def fun_l25_n288(x)
+    if (x < 1)
+        fun_l26_n836(x)
+    else
+        fun_l26_n587(x)
+    end
+end
+
+def fun_l25_n289(x)
+    if (x < 1)
+        fun_l26_n300(x)
+    else
+        fun_l26_n965(x)
+    end
+end
+
+def fun_l25_n290(x)
+    if (x < 1)
+        fun_l26_n925(x)
+    else
+        fun_l26_n180(x)
+    end
+end
+
+def fun_l25_n291(x)
+    if (x < 1)
+        fun_l26_n934(x)
+    else
+        fun_l26_n579(x)
+    end
+end
+
+def fun_l25_n292(x)
+    if (x < 1)
+        fun_l26_n97(x)
+    else
+        fun_l26_n33(x)
+    end
+end
+
+def fun_l25_n293(x)
+    if (x < 1)
+        fun_l26_n653(x)
+    else
+        fun_l26_n968(x)
+    end
+end
+
+def fun_l25_n294(x)
+    if (x < 1)
+        fun_l26_n264(x)
+    else
+        fun_l26_n68(x)
+    end
+end
+
+def fun_l25_n295(x)
+    if (x < 1)
+        fun_l26_n420(x)
+    else
+        fun_l26_n450(x)
+    end
+end
+
+def fun_l25_n296(x)
+    if (x < 1)
+        fun_l26_n200(x)
+    else
+        fun_l26_n599(x)
+    end
+end
+
+def fun_l25_n297(x)
+    if (x < 1)
+        fun_l26_n922(x)
+    else
+        fun_l26_n36(x)
+    end
+end
+
+def fun_l25_n298(x)
+    if (x < 1)
+        fun_l26_n741(x)
+    else
+        fun_l26_n743(x)
+    end
+end
+
+def fun_l25_n299(x)
+    if (x < 1)
+        fun_l26_n989(x)
+    else
+        fun_l26_n777(x)
+    end
+end
+
+def fun_l25_n300(x)
+    if (x < 1)
+        fun_l26_n600(x)
+    else
+        fun_l26_n228(x)
+    end
+end
+
+def fun_l25_n301(x)
+    if (x < 1)
+        fun_l26_n493(x)
+    else
+        fun_l26_n852(x)
+    end
+end
+
+def fun_l25_n302(x)
+    if (x < 1)
+        fun_l26_n552(x)
+    else
+        fun_l26_n305(x)
+    end
+end
+
+def fun_l25_n303(x)
+    if (x < 1)
+        fun_l26_n280(x)
+    else
+        fun_l26_n373(x)
+    end
+end
+
+def fun_l25_n304(x)
+    if (x < 1)
+        fun_l26_n379(x)
+    else
+        fun_l26_n877(x)
+    end
+end
+
+def fun_l25_n305(x)
+    if (x < 1)
+        fun_l26_n562(x)
+    else
+        fun_l26_n165(x)
+    end
+end
+
+def fun_l25_n306(x)
+    if (x < 1)
+        fun_l26_n890(x)
+    else
+        fun_l26_n24(x)
+    end
+end
+
+def fun_l25_n307(x)
+    if (x < 1)
+        fun_l26_n881(x)
+    else
+        fun_l26_n936(x)
+    end
+end
+
+def fun_l25_n308(x)
+    if (x < 1)
+        fun_l26_n31(x)
+    else
+        fun_l26_n851(x)
+    end
+end
+
+def fun_l25_n309(x)
+    if (x < 1)
+        fun_l26_n894(x)
+    else
+        fun_l26_n496(x)
+    end
+end
+
+def fun_l25_n310(x)
+    if (x < 1)
+        fun_l26_n477(x)
+    else
+        fun_l26_n436(x)
+    end
+end
+
+def fun_l25_n311(x)
+    if (x < 1)
+        fun_l26_n943(x)
+    else
+        fun_l26_n565(x)
+    end
+end
+
+def fun_l25_n312(x)
+    if (x < 1)
+        fun_l26_n795(x)
+    else
+        fun_l26_n416(x)
+    end
+end
+
+def fun_l25_n313(x)
+    if (x < 1)
+        fun_l26_n264(x)
+    else
+        fun_l26_n528(x)
+    end
+end
+
+def fun_l25_n314(x)
+    if (x < 1)
+        fun_l26_n269(x)
+    else
+        fun_l26_n666(x)
+    end
+end
+
+def fun_l25_n315(x)
+    if (x < 1)
+        fun_l26_n166(x)
+    else
+        fun_l26_n633(x)
+    end
+end
+
+def fun_l25_n316(x)
+    if (x < 1)
+        fun_l26_n463(x)
+    else
+        fun_l26_n82(x)
+    end
+end
+
+def fun_l25_n317(x)
+    if (x < 1)
+        fun_l26_n379(x)
+    else
+        fun_l26_n429(x)
+    end
+end
+
+def fun_l25_n318(x)
+    if (x < 1)
+        fun_l26_n538(x)
+    else
+        fun_l26_n714(x)
+    end
+end
+
+def fun_l25_n319(x)
+    if (x < 1)
+        fun_l26_n913(x)
+    else
+        fun_l26_n584(x)
+    end
+end
+
+def fun_l25_n320(x)
+    if (x < 1)
+        fun_l26_n833(x)
+    else
+        fun_l26_n887(x)
+    end
+end
+
+def fun_l25_n321(x)
+    if (x < 1)
+        fun_l26_n332(x)
+    else
+        fun_l26_n720(x)
+    end
+end
+
+def fun_l25_n322(x)
+    if (x < 1)
+        fun_l26_n409(x)
+    else
+        fun_l26_n924(x)
+    end
+end
+
+def fun_l25_n323(x)
+    if (x < 1)
+        fun_l26_n201(x)
+    else
+        fun_l26_n15(x)
+    end
+end
+
+def fun_l25_n324(x)
+    if (x < 1)
+        fun_l26_n454(x)
+    else
+        fun_l26_n348(x)
+    end
+end
+
+def fun_l25_n325(x)
+    if (x < 1)
+        fun_l26_n798(x)
+    else
+        fun_l26_n310(x)
+    end
+end
+
+def fun_l25_n326(x)
+    if (x < 1)
+        fun_l26_n70(x)
+    else
+        fun_l26_n973(x)
+    end
+end
+
+def fun_l25_n327(x)
+    if (x < 1)
+        fun_l26_n683(x)
+    else
+        fun_l26_n857(x)
+    end
+end
+
+def fun_l25_n328(x)
+    if (x < 1)
+        fun_l26_n885(x)
+    else
+        fun_l26_n855(x)
+    end
+end
+
+def fun_l25_n329(x)
+    if (x < 1)
+        fun_l26_n725(x)
+    else
+        fun_l26_n625(x)
+    end
+end
+
+def fun_l25_n330(x)
+    if (x < 1)
+        fun_l26_n960(x)
+    else
+        fun_l26_n710(x)
+    end
+end
+
+def fun_l25_n331(x)
+    if (x < 1)
+        fun_l26_n899(x)
+    else
+        fun_l26_n671(x)
+    end
+end
+
+def fun_l25_n332(x)
+    if (x < 1)
+        fun_l26_n743(x)
+    else
+        fun_l26_n541(x)
+    end
+end
+
+def fun_l25_n333(x)
+    if (x < 1)
+        fun_l26_n353(x)
+    else
+        fun_l26_n336(x)
+    end
+end
+
+def fun_l25_n334(x)
+    if (x < 1)
+        fun_l26_n53(x)
+    else
+        fun_l26_n422(x)
+    end
+end
+
+def fun_l25_n335(x)
+    if (x < 1)
+        fun_l26_n291(x)
+    else
+        fun_l26_n586(x)
+    end
+end
+
+def fun_l25_n336(x)
+    if (x < 1)
+        fun_l26_n395(x)
+    else
+        fun_l26_n716(x)
+    end
+end
+
+def fun_l25_n337(x)
+    if (x < 1)
+        fun_l26_n655(x)
+    else
+        fun_l26_n590(x)
+    end
+end
+
+def fun_l25_n338(x)
+    if (x < 1)
+        fun_l26_n443(x)
+    else
+        fun_l26_n680(x)
+    end
+end
+
+def fun_l25_n339(x)
+    if (x < 1)
+        fun_l26_n930(x)
+    else
+        fun_l26_n828(x)
+    end
+end
+
+def fun_l25_n340(x)
+    if (x < 1)
+        fun_l26_n488(x)
+    else
+        fun_l26_n514(x)
+    end
+end
+
+def fun_l25_n341(x)
+    if (x < 1)
+        fun_l26_n504(x)
+    else
+        fun_l26_n592(x)
+    end
+end
+
+def fun_l25_n342(x)
+    if (x < 1)
+        fun_l26_n695(x)
+    else
+        fun_l26_n945(x)
+    end
+end
+
+def fun_l25_n343(x)
+    if (x < 1)
+        fun_l26_n483(x)
+    else
+        fun_l26_n511(x)
+    end
+end
+
+def fun_l25_n344(x)
+    if (x < 1)
+        fun_l26_n958(x)
+    else
+        fun_l26_n316(x)
+    end
+end
+
+def fun_l25_n345(x)
+    if (x < 1)
+        fun_l26_n481(x)
+    else
+        fun_l26_n473(x)
+    end
+end
+
+def fun_l25_n346(x)
+    if (x < 1)
+        fun_l26_n340(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n347(x)
+    if (x < 1)
+        fun_l26_n222(x)
+    else
+        fun_l26_n232(x)
+    end
+end
+
+def fun_l25_n348(x)
+    if (x < 1)
+        fun_l26_n162(x)
+    else
+        fun_l26_n846(x)
+    end
+end
+
+def fun_l25_n349(x)
+    if (x < 1)
+        fun_l26_n56(x)
+    else
+        fun_l26_n93(x)
+    end
+end
+
+def fun_l25_n350(x)
+    if (x < 1)
+        fun_l26_n191(x)
+    else
+        fun_l26_n245(x)
+    end
+end
+
+def fun_l25_n351(x)
+    if (x < 1)
+        fun_l26_n294(x)
+    else
+        fun_l26_n494(x)
+    end
+end
+
+def fun_l25_n352(x)
+    if (x < 1)
+        fun_l26_n591(x)
+    else
+        fun_l26_n524(x)
+    end
+end
+
+def fun_l25_n353(x)
+    if (x < 1)
+        fun_l26_n904(x)
+    else
+        fun_l26_n793(x)
+    end
+end
+
+def fun_l25_n354(x)
+    if (x < 1)
+        fun_l26_n1(x)
+    else
+        fun_l26_n432(x)
+    end
+end
+
+def fun_l25_n355(x)
+    if (x < 1)
+        fun_l26_n757(x)
+    else
+        fun_l26_n733(x)
+    end
+end
+
+def fun_l25_n356(x)
+    if (x < 1)
+        fun_l26_n987(x)
+    else
+        fun_l26_n425(x)
+    end
+end
+
+def fun_l25_n357(x)
+    if (x < 1)
+        fun_l26_n288(x)
+    else
+        fun_l26_n587(x)
+    end
+end
+
+def fun_l25_n358(x)
+    if (x < 1)
+        fun_l26_n843(x)
+    else
+        fun_l26_n731(x)
+    end
+end
+
+def fun_l25_n359(x)
+    if (x < 1)
+        fun_l26_n433(x)
+    else
+        fun_l26_n208(x)
+    end
+end
+
+def fun_l25_n360(x)
+    if (x < 1)
+        fun_l26_n473(x)
+    else
+        fun_l26_n992(x)
+    end
+end
+
+def fun_l25_n361(x)
+    if (x < 1)
+        fun_l26_n210(x)
+    else
+        fun_l26_n704(x)
+    end
+end
+
+def fun_l25_n362(x)
+    if (x < 1)
+        fun_l26_n625(x)
+    else
+        fun_l26_n365(x)
+    end
+end
+
+def fun_l25_n363(x)
+    if (x < 1)
+        fun_l26_n55(x)
+    else
+        fun_l26_n555(x)
+    end
+end
+
+def fun_l25_n364(x)
+    if (x < 1)
+        fun_l26_n763(x)
+    else
+        fun_l26_n417(x)
+    end
+end
+
+def fun_l25_n365(x)
+    if (x < 1)
+        fun_l26_n557(x)
+    else
+        fun_l26_n24(x)
+    end
+end
+
+def fun_l25_n366(x)
+    if (x < 1)
+        fun_l26_n791(x)
+    else
+        fun_l26_n753(x)
+    end
+end
+
+def fun_l25_n367(x)
+    if (x < 1)
+        fun_l26_n490(x)
+    else
+        fun_l26_n765(x)
+    end
+end
+
+def fun_l25_n368(x)
+    if (x < 1)
+        fun_l26_n875(x)
+    else
+        fun_l26_n628(x)
+    end
+end
+
+def fun_l25_n369(x)
+    if (x < 1)
+        fun_l26_n544(x)
+    else
+        fun_l26_n234(x)
+    end
+end
+
+def fun_l25_n370(x)
+    if (x < 1)
+        fun_l26_n288(x)
+    else
+        fun_l26_n524(x)
+    end
+end
+
+def fun_l25_n371(x)
+    if (x < 1)
+        fun_l26_n548(x)
+    else
+        fun_l26_n782(x)
+    end
+end
+
+def fun_l25_n372(x)
+    if (x < 1)
+        fun_l26_n112(x)
+    else
+        fun_l26_n861(x)
+    end
+end
+
+def fun_l25_n373(x)
+    if (x < 1)
+        fun_l26_n565(x)
+    else
+        fun_l26_n442(x)
+    end
+end
+
+def fun_l25_n374(x)
+    if (x < 1)
+        fun_l26_n37(x)
+    else
+        fun_l26_n810(x)
+    end
+end
+
+def fun_l25_n375(x)
+    if (x < 1)
+        fun_l26_n384(x)
+    else
+        fun_l26_n103(x)
+    end
+end
+
+def fun_l25_n376(x)
+    if (x < 1)
+        fun_l26_n371(x)
+    else
+        fun_l26_n219(x)
+    end
+end
+
+def fun_l25_n377(x)
+    if (x < 1)
+        fun_l26_n964(x)
+    else
+        fun_l26_n542(x)
+    end
+end
+
+def fun_l25_n378(x)
+    if (x < 1)
+        fun_l26_n617(x)
+    else
+        fun_l26_n616(x)
+    end
+end
+
+def fun_l25_n379(x)
+    if (x < 1)
+        fun_l26_n94(x)
+    else
+        fun_l26_n870(x)
+    end
+end
+
+def fun_l25_n380(x)
+    if (x < 1)
+        fun_l26_n538(x)
+    else
+        fun_l26_n483(x)
+    end
+end
+
+def fun_l25_n381(x)
+    if (x < 1)
+        fun_l26_n395(x)
+    else
+        fun_l26_n873(x)
+    end
+end
+
+def fun_l25_n382(x)
+    if (x < 1)
+        fun_l26_n406(x)
+    else
+        fun_l26_n843(x)
+    end
+end
+
+def fun_l25_n383(x)
+    if (x < 1)
+        fun_l26_n422(x)
+    else
+        fun_l26_n367(x)
+    end
+end
+
+def fun_l25_n384(x)
+    if (x < 1)
+        fun_l26_n472(x)
+    else
+        fun_l26_n676(x)
+    end
+end
+
+def fun_l25_n385(x)
+    if (x < 1)
+        fun_l26_n782(x)
+    else
+        fun_l26_n995(x)
+    end
+end
+
+def fun_l25_n386(x)
+    if (x < 1)
+        fun_l26_n655(x)
+    else
+        fun_l26_n758(x)
+    end
+end
+
+def fun_l25_n387(x)
+    if (x < 1)
+        fun_l26_n665(x)
+    else
+        fun_l26_n775(x)
+    end
+end
+
+def fun_l25_n388(x)
+    if (x < 1)
+        fun_l26_n168(x)
+    else
+        fun_l26_n604(x)
+    end
+end
+
+def fun_l25_n389(x)
+    if (x < 1)
+        fun_l26_n31(x)
+    else
+        fun_l26_n681(x)
+    end
+end
+
+def fun_l25_n390(x)
+    if (x < 1)
+        fun_l26_n758(x)
+    else
+        fun_l26_n596(x)
+    end
+end
+
+def fun_l25_n391(x)
+    if (x < 1)
+        fun_l26_n413(x)
+    else
+        fun_l26_n528(x)
+    end
+end
+
+def fun_l25_n392(x)
+    if (x < 1)
+        fun_l26_n136(x)
+    else
+        fun_l26_n408(x)
+    end
+end
+
+def fun_l25_n393(x)
+    if (x < 1)
+        fun_l26_n493(x)
+    else
+        fun_l26_n182(x)
+    end
+end
+
+def fun_l25_n394(x)
+    if (x < 1)
+        fun_l26_n156(x)
+    else
+        fun_l26_n775(x)
+    end
+end
+
+def fun_l25_n395(x)
+    if (x < 1)
+        fun_l26_n839(x)
+    else
+        fun_l26_n823(x)
+    end
+end
+
+def fun_l25_n396(x)
+    if (x < 1)
+        fun_l26_n248(x)
+    else
+        fun_l26_n679(x)
+    end
+end
+
+def fun_l25_n397(x)
+    if (x < 1)
+        fun_l26_n594(x)
+    else
+        fun_l26_n117(x)
+    end
+end
+
+def fun_l25_n398(x)
+    if (x < 1)
+        fun_l26_n82(x)
+    else
+        fun_l26_n595(x)
+    end
+end
+
+def fun_l25_n399(x)
+    if (x < 1)
+        fun_l26_n978(x)
+    else
+        fun_l26_n391(x)
+    end
+end
+
+def fun_l25_n400(x)
+    if (x < 1)
+        fun_l26_n731(x)
+    else
+        fun_l26_n252(x)
+    end
+end
+
+def fun_l25_n401(x)
+    if (x < 1)
+        fun_l26_n297(x)
+    else
+        fun_l26_n918(x)
+    end
+end
+
+def fun_l25_n402(x)
+    if (x < 1)
+        fun_l26_n745(x)
+    else
+        fun_l26_n972(x)
+    end
+end
+
+def fun_l25_n403(x)
+    if (x < 1)
+        fun_l26_n685(x)
+    else
+        fun_l26_n555(x)
+    end
+end
+
+def fun_l25_n404(x)
+    if (x < 1)
+        fun_l26_n667(x)
+    else
+        fun_l26_n384(x)
+    end
+end
+
+def fun_l25_n405(x)
+    if (x < 1)
+        fun_l26_n330(x)
+    else
+        fun_l26_n440(x)
+    end
+end
+
+def fun_l25_n406(x)
+    if (x < 1)
+        fun_l26_n911(x)
+    else
+        fun_l26_n580(x)
+    end
+end
+
+def fun_l25_n407(x)
+    if (x < 1)
+        fun_l26_n789(x)
+    else
+        fun_l26_n297(x)
+    end
+end
+
+def fun_l25_n408(x)
+    if (x < 1)
+        fun_l26_n879(x)
+    else
+        fun_l26_n201(x)
+    end
+end
+
+def fun_l25_n409(x)
+    if (x < 1)
+        fun_l26_n36(x)
+    else
+        fun_l26_n885(x)
+    end
+end
+
+def fun_l25_n410(x)
+    if (x < 1)
+        fun_l26_n224(x)
+    else
+        fun_l26_n571(x)
+    end
+end
+
+def fun_l25_n411(x)
+    if (x < 1)
+        fun_l26_n395(x)
+    else
+        fun_l26_n640(x)
+    end
+end
+
+def fun_l25_n412(x)
+    if (x < 1)
+        fun_l26_n754(x)
+    else
+        fun_l26_n754(x)
+    end
+end
+
+def fun_l25_n413(x)
+    if (x < 1)
+        fun_l26_n885(x)
+    else
+        fun_l26_n857(x)
+    end
+end
+
+def fun_l25_n414(x)
+    if (x < 1)
+        fun_l26_n464(x)
+    else
+        fun_l26_n44(x)
+    end
+end
+
+def fun_l25_n415(x)
+    if (x < 1)
+        fun_l26_n13(x)
+    else
+        fun_l26_n546(x)
+    end
+end
+
+def fun_l25_n416(x)
+    if (x < 1)
+        fun_l26_n318(x)
+    else
+        fun_l26_n313(x)
+    end
+end
+
+def fun_l25_n417(x)
+    if (x < 1)
+        fun_l26_n98(x)
+    else
+        fun_l26_n139(x)
+    end
+end
+
+def fun_l25_n418(x)
+    if (x < 1)
+        fun_l26_n654(x)
+    else
+        fun_l26_n602(x)
+    end
+end
+
+def fun_l25_n419(x)
+    if (x < 1)
+        fun_l26_n808(x)
+    else
+        fun_l26_n987(x)
+    end
+end
+
+def fun_l25_n420(x)
+    if (x < 1)
+        fun_l26_n878(x)
+    else
+        fun_l26_n36(x)
+    end
+end
+
+def fun_l25_n421(x)
+    if (x < 1)
+        fun_l26_n427(x)
+    else
+        fun_l26_n620(x)
+    end
+end
+
+def fun_l25_n422(x)
+    if (x < 1)
+        fun_l26_n118(x)
+    else
+        fun_l26_n145(x)
+    end
+end
+
+def fun_l25_n423(x)
+    if (x < 1)
+        fun_l26_n131(x)
+    else
+        fun_l26_n520(x)
+    end
+end
+
+def fun_l25_n424(x)
+    if (x < 1)
+        fun_l26_n295(x)
+    else
+        fun_l26_n197(x)
+    end
+end
+
+def fun_l25_n425(x)
+    if (x < 1)
+        fun_l26_n632(x)
+    else
+        fun_l26_n951(x)
+    end
+end
+
+def fun_l25_n426(x)
+    if (x < 1)
+        fun_l26_n92(x)
+    else
+        fun_l26_n96(x)
+    end
+end
+
+def fun_l25_n427(x)
+    if (x < 1)
+        fun_l26_n677(x)
+    else
+        fun_l26_n5(x)
+    end
+end
+
+def fun_l25_n428(x)
+    if (x < 1)
+        fun_l26_n425(x)
+    else
+        fun_l26_n864(x)
+    end
+end
+
+def fun_l25_n429(x)
+    if (x < 1)
+        fun_l26_n187(x)
+    else
+        fun_l26_n62(x)
+    end
+end
+
+def fun_l25_n430(x)
+    if (x < 1)
+        fun_l26_n964(x)
+    else
+        fun_l26_n704(x)
+    end
+end
+
+def fun_l25_n431(x)
+    if (x < 1)
+        fun_l26_n109(x)
+    else
+        fun_l26_n181(x)
+    end
+end
+
+def fun_l25_n432(x)
+    if (x < 1)
+        fun_l26_n620(x)
+    else
+        fun_l26_n484(x)
+    end
+end
+
+def fun_l25_n433(x)
+    if (x < 1)
+        fun_l26_n283(x)
+    else
+        fun_l26_n622(x)
+    end
+end
+
+def fun_l25_n434(x)
+    if (x < 1)
+        fun_l26_n377(x)
+    else
+        fun_l26_n357(x)
+    end
+end
+
+def fun_l25_n435(x)
+    if (x < 1)
+        fun_l26_n375(x)
+    else
+        fun_l26_n346(x)
+    end
+end
+
+def fun_l25_n436(x)
+    if (x < 1)
+        fun_l26_n50(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n437(x)
+    if (x < 1)
+        fun_l26_n348(x)
+    else
+        fun_l26_n465(x)
+    end
+end
+
+def fun_l25_n438(x)
+    if (x < 1)
+        fun_l26_n206(x)
+    else
+        fun_l26_n968(x)
+    end
+end
+
+def fun_l25_n439(x)
+    if (x < 1)
+        fun_l26_n878(x)
+    else
+        fun_l26_n248(x)
+    end
+end
+
+def fun_l25_n440(x)
+    if (x < 1)
+        fun_l26_n469(x)
+    else
+        fun_l26_n842(x)
+    end
+end
+
+def fun_l25_n441(x)
+    if (x < 1)
+        fun_l26_n476(x)
+    else
+        fun_l26_n666(x)
+    end
+end
+
+def fun_l25_n442(x)
+    if (x < 1)
+        fun_l26_n491(x)
+    else
+        fun_l26_n365(x)
+    end
+end
+
+def fun_l25_n443(x)
+    if (x < 1)
+        fun_l26_n412(x)
+    else
+        fun_l26_n308(x)
+    end
+end
+
+def fun_l25_n444(x)
+    if (x < 1)
+        fun_l26_n750(x)
+    else
+        fun_l26_n82(x)
+    end
+end
+
+def fun_l25_n445(x)
+    if (x < 1)
+        fun_l26_n434(x)
+    else
+        fun_l26_n711(x)
+    end
+end
+
+def fun_l25_n446(x)
+    if (x < 1)
+        fun_l26_n698(x)
+    else
+        fun_l26_n407(x)
+    end
+end
+
+def fun_l25_n447(x)
+    if (x < 1)
+        fun_l26_n992(x)
+    else
+        fun_l26_n404(x)
+    end
+end
+
+def fun_l25_n448(x)
+    if (x < 1)
+        fun_l26_n723(x)
+    else
+        fun_l26_n317(x)
+    end
+end
+
+def fun_l25_n449(x)
+    if (x < 1)
+        fun_l26_n582(x)
+    else
+        fun_l26_n384(x)
+    end
+end
+
+def fun_l25_n450(x)
+    if (x < 1)
+        fun_l26_n956(x)
+    else
+        fun_l26_n111(x)
+    end
+end
+
+def fun_l25_n451(x)
+    if (x < 1)
+        fun_l26_n506(x)
+    else
+        fun_l26_n775(x)
+    end
+end
+
+def fun_l25_n452(x)
+    if (x < 1)
+        fun_l26_n857(x)
+    else
+        fun_l26_n884(x)
+    end
+end
+
+def fun_l25_n453(x)
+    if (x < 1)
+        fun_l26_n889(x)
+    else
+        fun_l26_n471(x)
+    end
+end
+
+def fun_l25_n454(x)
+    if (x < 1)
+        fun_l26_n850(x)
+    else
+        fun_l26_n204(x)
+    end
+end
+
+def fun_l25_n455(x)
+    if (x < 1)
+        fun_l26_n244(x)
+    else
+        fun_l26_n507(x)
+    end
+end
+
+def fun_l25_n456(x)
+    if (x < 1)
+        fun_l26_n875(x)
+    else
+        fun_l26_n694(x)
+    end
+end
+
+def fun_l25_n457(x)
+    if (x < 1)
+        fun_l26_n517(x)
+    else
+        fun_l26_n64(x)
+    end
+end
+
+def fun_l25_n458(x)
+    if (x < 1)
+        fun_l26_n870(x)
+    else
+        fun_l26_n495(x)
+    end
+end
+
+def fun_l25_n459(x)
+    if (x < 1)
+        fun_l26_n577(x)
+    else
+        fun_l26_n42(x)
+    end
+end
+
+def fun_l25_n460(x)
+    if (x < 1)
+        fun_l26_n919(x)
+    else
+        fun_l26_n508(x)
+    end
+end
+
+def fun_l25_n461(x)
+    if (x < 1)
+        fun_l26_n334(x)
+    else
+        fun_l26_n720(x)
+    end
+end
+
+def fun_l25_n462(x)
+    if (x < 1)
+        fun_l26_n682(x)
+    else
+        fun_l26_n422(x)
+    end
+end
+
+def fun_l25_n463(x)
+    if (x < 1)
+        fun_l26_n415(x)
+    else
+        fun_l26_n505(x)
+    end
+end
+
+def fun_l25_n464(x)
+    if (x < 1)
+        fun_l26_n783(x)
+    else
+        fun_l26_n269(x)
+    end
+end
+
+def fun_l25_n465(x)
+    if (x < 1)
+        fun_l26_n797(x)
+    else
+        fun_l26_n780(x)
+    end
+end
+
+def fun_l25_n466(x)
+    if (x < 1)
+        fun_l26_n806(x)
+    else
+        fun_l26_n773(x)
+    end
+end
+
+def fun_l25_n467(x)
+    if (x < 1)
+        fun_l26_n922(x)
+    else
+        fun_l26_n45(x)
+    end
+end
+
+def fun_l25_n468(x)
+    if (x < 1)
+        fun_l26_n919(x)
+    else
+        fun_l26_n780(x)
+    end
+end
+
+def fun_l25_n469(x)
+    if (x < 1)
+        fun_l26_n354(x)
+    else
+        fun_l26_n360(x)
+    end
+end
+
+def fun_l25_n470(x)
+    if (x < 1)
+        fun_l26_n492(x)
+    else
+        fun_l26_n230(x)
+    end
+end
+
+def fun_l25_n471(x)
+    if (x < 1)
+        fun_l26_n1(x)
+    else
+        fun_l26_n845(x)
+    end
+end
+
+def fun_l25_n472(x)
+    if (x < 1)
+        fun_l26_n854(x)
+    else
+        fun_l26_n408(x)
+    end
+end
+
+def fun_l25_n473(x)
+    if (x < 1)
+        fun_l26_n17(x)
+    else
+        fun_l26_n570(x)
+    end
+end
+
+def fun_l25_n474(x)
+    if (x < 1)
+        fun_l26_n485(x)
+    else
+        fun_l26_n953(x)
+    end
+end
+
+def fun_l25_n475(x)
+    if (x < 1)
+        fun_l26_n398(x)
+    else
+        fun_l26_n712(x)
+    end
+end
+
+def fun_l25_n476(x)
+    if (x < 1)
+        fun_l26_n499(x)
+    else
+        fun_l26_n218(x)
+    end
+end
+
+def fun_l25_n477(x)
+    if (x < 1)
+        fun_l26_n107(x)
+    else
+        fun_l26_n38(x)
+    end
+end
+
+def fun_l25_n478(x)
+    if (x < 1)
+        fun_l26_n234(x)
+    else
+        fun_l26_n718(x)
+    end
+end
+
+def fun_l25_n479(x)
+    if (x < 1)
+        fun_l26_n396(x)
+    else
+        fun_l26_n247(x)
+    end
+end
+
+def fun_l25_n480(x)
+    if (x < 1)
+        fun_l26_n457(x)
+    else
+        fun_l26_n259(x)
+    end
+end
+
+def fun_l25_n481(x)
+    if (x < 1)
+        fun_l26_n581(x)
+    else
+        fun_l26_n512(x)
+    end
+end
+
+def fun_l25_n482(x)
+    if (x < 1)
+        fun_l26_n262(x)
+    else
+        fun_l26_n790(x)
+    end
+end
+
+def fun_l25_n483(x)
+    if (x < 1)
+        fun_l26_n140(x)
+    else
+        fun_l26_n821(x)
+    end
+end
+
+def fun_l25_n484(x)
+    if (x < 1)
+        fun_l26_n133(x)
+    else
+        fun_l26_n863(x)
+    end
+end
+
+def fun_l25_n485(x)
+    if (x < 1)
+        fun_l26_n440(x)
+    else
+        fun_l26_n265(x)
+    end
+end
+
+def fun_l25_n486(x)
+    if (x < 1)
+        fun_l26_n913(x)
+    else
+        fun_l26_n994(x)
+    end
+end
+
+def fun_l25_n487(x)
+    if (x < 1)
+        fun_l26_n186(x)
+    else
+        fun_l26_n433(x)
+    end
+end
+
+def fun_l25_n488(x)
+    if (x < 1)
+        fun_l26_n357(x)
+    else
+        fun_l26_n16(x)
+    end
+end
+
+def fun_l25_n489(x)
+    if (x < 1)
+        fun_l26_n165(x)
+    else
+        fun_l26_n674(x)
+    end
+end
+
+def fun_l25_n490(x)
+    if (x < 1)
+        fun_l26_n772(x)
+    else
+        fun_l26_n749(x)
+    end
+end
+
+def fun_l25_n491(x)
+    if (x < 1)
+        fun_l26_n677(x)
+    else
+        fun_l26_n36(x)
+    end
+end
+
+def fun_l25_n492(x)
+    if (x < 1)
+        fun_l26_n962(x)
+    else
+        fun_l26_n750(x)
+    end
+end
+
+def fun_l25_n493(x)
+    if (x < 1)
+        fun_l26_n22(x)
+    else
+        fun_l26_n657(x)
+    end
+end
+
+def fun_l25_n494(x)
+    if (x < 1)
+        fun_l26_n302(x)
+    else
+        fun_l26_n394(x)
+    end
+end
+
+def fun_l25_n495(x)
+    if (x < 1)
+        fun_l26_n313(x)
+    else
+        fun_l26_n552(x)
+    end
+end
+
+def fun_l25_n496(x)
+    if (x < 1)
+        fun_l26_n946(x)
+    else
+        fun_l26_n447(x)
+    end
+end
+
+def fun_l25_n497(x)
+    if (x < 1)
+        fun_l26_n565(x)
+    else
+        fun_l26_n242(x)
+    end
+end
+
+def fun_l25_n498(x)
+    if (x < 1)
+        fun_l26_n932(x)
+    else
+        fun_l26_n413(x)
+    end
+end
+
+def fun_l25_n499(x)
+    if (x < 1)
+        fun_l26_n751(x)
+    else
+        fun_l26_n921(x)
+    end
+end
+
+def fun_l25_n500(x)
+    if (x < 1)
+        fun_l26_n1(x)
+    else
+        fun_l26_n722(x)
+    end
+end
+
+def fun_l25_n501(x)
+    if (x < 1)
+        fun_l26_n63(x)
+    else
+        fun_l26_n205(x)
+    end
+end
+
+def fun_l25_n502(x)
+    if (x < 1)
+        fun_l26_n67(x)
+    else
+        fun_l26_n638(x)
+    end
+end
+
+def fun_l25_n503(x)
+    if (x < 1)
+        fun_l26_n762(x)
+    else
+        fun_l26_n688(x)
+    end
+end
+
+def fun_l25_n504(x)
+    if (x < 1)
+        fun_l26_n839(x)
+    else
+        fun_l26_n775(x)
+    end
+end
+
+def fun_l25_n505(x)
+    if (x < 1)
+        fun_l26_n773(x)
+    else
+        fun_l26_n986(x)
+    end
+end
+
+def fun_l25_n506(x)
+    if (x < 1)
+        fun_l26_n934(x)
+    else
+        fun_l26_n117(x)
+    end
+end
+
+def fun_l25_n507(x)
+    if (x < 1)
+        fun_l26_n507(x)
+    else
+        fun_l26_n217(x)
+    end
+end
+
+def fun_l25_n508(x)
+    if (x < 1)
+        fun_l26_n833(x)
+    else
+        fun_l26_n779(x)
+    end
+end
+
+def fun_l25_n509(x)
+    if (x < 1)
+        fun_l26_n244(x)
+    else
+        fun_l26_n71(x)
+    end
+end
+
+def fun_l25_n510(x)
+    if (x < 1)
+        fun_l26_n466(x)
+    else
+        fun_l26_n440(x)
+    end
+end
+
+def fun_l25_n511(x)
+    if (x < 1)
+        fun_l26_n829(x)
+    else
+        fun_l26_n459(x)
+    end
+end
+
+def fun_l25_n512(x)
+    if (x < 1)
+        fun_l26_n923(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n513(x)
+    if (x < 1)
+        fun_l26_n925(x)
+    else
+        fun_l26_n758(x)
+    end
+end
+
+def fun_l25_n514(x)
+    if (x < 1)
+        fun_l26_n782(x)
+    else
+        fun_l26_n157(x)
+    end
+end
+
+def fun_l25_n515(x)
+    if (x < 1)
+        fun_l26_n987(x)
+    else
+        fun_l26_n407(x)
+    end
+end
+
+def fun_l25_n516(x)
+    if (x < 1)
+        fun_l26_n224(x)
+    else
+        fun_l26_n531(x)
+    end
+end
+
+def fun_l25_n517(x)
+    if (x < 1)
+        fun_l26_n222(x)
+    else
+        fun_l26_n141(x)
+    end
+end
+
+def fun_l25_n518(x)
+    if (x < 1)
+        fun_l26_n723(x)
+    else
+        fun_l26_n787(x)
+    end
+end
+
+def fun_l25_n519(x)
+    if (x < 1)
+        fun_l26_n802(x)
+    else
+        fun_l26_n448(x)
+    end
+end
+
+def fun_l25_n520(x)
+    if (x < 1)
+        fun_l26_n152(x)
+    else
+        fun_l26_n666(x)
+    end
+end
+
+def fun_l25_n521(x)
+    if (x < 1)
+        fun_l26_n476(x)
+    else
+        fun_l26_n7(x)
+    end
+end
+
+def fun_l25_n522(x)
+    if (x < 1)
+        fun_l26_n523(x)
+    else
+        fun_l26_n326(x)
+    end
+end
+
+def fun_l25_n523(x)
+    if (x < 1)
+        fun_l26_n432(x)
+    else
+        fun_l26_n525(x)
+    end
+end
+
+def fun_l25_n524(x)
+    if (x < 1)
+        fun_l26_n403(x)
+    else
+        fun_l26_n983(x)
+    end
+end
+
+def fun_l25_n525(x)
+    if (x < 1)
+        fun_l26_n681(x)
+    else
+        fun_l26_n326(x)
+    end
+end
+
+def fun_l25_n526(x)
+    if (x < 1)
+        fun_l26_n352(x)
+    else
+        fun_l26_n402(x)
+    end
+end
+
+def fun_l25_n527(x)
+    if (x < 1)
+        fun_l26_n870(x)
+    else
+        fun_l26_n181(x)
+    end
+end
+
+def fun_l25_n528(x)
+    if (x < 1)
+        fun_l26_n382(x)
+    else
+        fun_l26_n880(x)
+    end
+end
+
+def fun_l25_n529(x)
+    if (x < 1)
+        fun_l26_n337(x)
+    else
+        fun_l26_n616(x)
+    end
+end
+
+def fun_l25_n530(x)
+    if (x < 1)
+        fun_l26_n959(x)
+    else
+        fun_l26_n239(x)
+    end
+end
+
+def fun_l25_n531(x)
+    if (x < 1)
+        fun_l26_n57(x)
+    else
+        fun_l26_n896(x)
+    end
+end
+
+def fun_l25_n532(x)
+    if (x < 1)
+        fun_l26_n456(x)
+    else
+        fun_l26_n365(x)
+    end
+end
+
+def fun_l25_n533(x)
+    if (x < 1)
+        fun_l26_n73(x)
+    else
+        fun_l26_n420(x)
+    end
+end
+
+def fun_l25_n534(x)
+    if (x < 1)
+        fun_l26_n295(x)
+    else
+        fun_l26_n663(x)
+    end
+end
+
+def fun_l25_n535(x)
+    if (x < 1)
+        fun_l26_n881(x)
+    else
+        fun_l26_n391(x)
+    end
+end
+
+def fun_l25_n536(x)
+    if (x < 1)
+        fun_l26_n775(x)
+    else
+        fun_l26_n19(x)
+    end
+end
+
+def fun_l25_n537(x)
+    if (x < 1)
+        fun_l26_n954(x)
+    else
+        fun_l26_n97(x)
+    end
+end
+
+def fun_l25_n538(x)
+    if (x < 1)
+        fun_l26_n764(x)
+    else
+        fun_l26_n353(x)
+    end
+end
+
+def fun_l25_n539(x)
+    if (x < 1)
+        fun_l26_n220(x)
+    else
+        fun_l26_n958(x)
+    end
+end
+
+def fun_l25_n540(x)
+    if (x < 1)
+        fun_l26_n915(x)
+    else
+        fun_l26_n792(x)
+    end
+end
+
+def fun_l25_n541(x)
+    if (x < 1)
+        fun_l26_n880(x)
+    else
+        fun_l26_n374(x)
+    end
+end
+
+def fun_l25_n542(x)
+    if (x < 1)
+        fun_l26_n655(x)
+    else
+        fun_l26_n578(x)
+    end
+end
+
+def fun_l25_n543(x)
+    if (x < 1)
+        fun_l26_n862(x)
+    else
+        fun_l26_n177(x)
+    end
+end
+
+def fun_l25_n544(x)
+    if (x < 1)
+        fun_l26_n286(x)
+    else
+        fun_l26_n670(x)
+    end
+end
+
+def fun_l25_n545(x)
+    if (x < 1)
+        fun_l26_n862(x)
+    else
+        fun_l26_n45(x)
+    end
+end
+
+def fun_l25_n546(x)
+    if (x < 1)
+        fun_l26_n743(x)
+    else
+        fun_l26_n575(x)
+    end
+end
+
+def fun_l25_n547(x)
+    if (x < 1)
+        fun_l26_n909(x)
+    else
+        fun_l26_n457(x)
+    end
+end
+
+def fun_l25_n548(x)
+    if (x < 1)
+        fun_l26_n784(x)
+    else
+        fun_l26_n482(x)
+    end
+end
+
+def fun_l25_n549(x)
+    if (x < 1)
+        fun_l26_n381(x)
+    else
+        fun_l26_n560(x)
+    end
+end
+
+def fun_l25_n550(x)
+    if (x < 1)
+        fun_l26_n62(x)
+    else
+        fun_l26_n640(x)
+    end
+end
+
+def fun_l25_n551(x)
+    if (x < 1)
+        fun_l26_n714(x)
+    else
+        fun_l26_n898(x)
+    end
+end
+
+def fun_l25_n552(x)
+    if (x < 1)
+        fun_l26_n515(x)
+    else
+        fun_l26_n221(x)
+    end
+end
+
+def fun_l25_n553(x)
+    if (x < 1)
+        fun_l26_n217(x)
+    else
+        fun_l26_n932(x)
+    end
+end
+
+def fun_l25_n554(x)
+    if (x < 1)
+        fun_l26_n583(x)
+    else
+        fun_l26_n722(x)
+    end
+end
+
+def fun_l25_n555(x)
+    if (x < 1)
+        fun_l26_n398(x)
+    else
+        fun_l26_n503(x)
+    end
+end
+
+def fun_l25_n556(x)
+    if (x < 1)
+        fun_l26_n891(x)
+    else
+        fun_l26_n72(x)
+    end
+end
+
+def fun_l25_n557(x)
+    if (x < 1)
+        fun_l26_n367(x)
+    else
+        fun_l26_n141(x)
+    end
+end
+
+def fun_l25_n558(x)
+    if (x < 1)
+        fun_l26_n477(x)
+    else
+        fun_l26_n40(x)
+    end
+end
+
+def fun_l25_n559(x)
+    if (x < 1)
+        fun_l26_n156(x)
+    else
+        fun_l26_n491(x)
+    end
+end
+
+def fun_l25_n560(x)
+    if (x < 1)
+        fun_l26_n859(x)
+    else
+        fun_l26_n423(x)
+    end
+end
+
+def fun_l25_n561(x)
+    if (x < 1)
+        fun_l26_n693(x)
+    else
+        fun_l26_n281(x)
+    end
+end
+
+def fun_l25_n562(x)
+    if (x < 1)
+        fun_l26_n460(x)
+    else
+        fun_l26_n151(x)
+    end
+end
+
+def fun_l25_n563(x)
+    if (x < 1)
+        fun_l26_n14(x)
+    else
+        fun_l26_n395(x)
+    end
+end
+
+def fun_l25_n564(x)
+    if (x < 1)
+        fun_l26_n423(x)
+    else
+        fun_l26_n198(x)
+    end
+end
+
+def fun_l25_n565(x)
+    if (x < 1)
+        fun_l26_n911(x)
+    else
+        fun_l26_n841(x)
+    end
+end
+
+def fun_l25_n566(x)
+    if (x < 1)
+        fun_l26_n273(x)
+    else
+        fun_l26_n361(x)
+    end
+end
+
+def fun_l25_n567(x)
+    if (x < 1)
+        fun_l26_n94(x)
+    else
+        fun_l26_n932(x)
+    end
+end
+
+def fun_l25_n568(x)
+    if (x < 1)
+        fun_l26_n734(x)
+    else
+        fun_l26_n191(x)
+    end
+end
+
+def fun_l25_n569(x)
+    if (x < 1)
+        fun_l26_n699(x)
+    else
+        fun_l26_n496(x)
+    end
+end
+
+def fun_l25_n570(x)
+    if (x < 1)
+        fun_l26_n90(x)
+    else
+        fun_l26_n574(x)
+    end
+end
+
+def fun_l25_n571(x)
+    if (x < 1)
+        fun_l26_n818(x)
+    else
+        fun_l26_n529(x)
+    end
+end
+
+def fun_l25_n572(x)
+    if (x < 1)
+        fun_l26_n459(x)
+    else
+        fun_l26_n770(x)
+    end
+end
+
+def fun_l25_n573(x)
+    if (x < 1)
+        fun_l26_n725(x)
+    else
+        fun_l26_n896(x)
+    end
+end
+
+def fun_l25_n574(x)
+    if (x < 1)
+        fun_l26_n773(x)
+    else
+        fun_l26_n8(x)
+    end
+end
+
+def fun_l25_n575(x)
+    if (x < 1)
+        fun_l26_n582(x)
+    else
+        fun_l26_n274(x)
+    end
+end
+
+def fun_l25_n576(x)
+    if (x < 1)
+        fun_l26_n529(x)
+    else
+        fun_l26_n434(x)
+    end
+end
+
+def fun_l25_n577(x)
+    if (x < 1)
+        fun_l26_n197(x)
+    else
+        fun_l26_n88(x)
+    end
+end
+
+def fun_l25_n578(x)
+    if (x < 1)
+        fun_l26_n938(x)
+    else
+        fun_l26_n184(x)
+    end
+end
+
+def fun_l25_n579(x)
+    if (x < 1)
+        fun_l26_n801(x)
+    else
+        fun_l26_n990(x)
+    end
+end
+
+def fun_l25_n580(x)
+    if (x < 1)
+        fun_l26_n732(x)
+    else
+        fun_l26_n955(x)
+    end
+end
+
+def fun_l25_n581(x)
+    if (x < 1)
+        fun_l26_n130(x)
+    else
+        fun_l26_n167(x)
+    end
+end
+
+def fun_l25_n582(x)
+    if (x < 1)
+        fun_l26_n942(x)
+    else
+        fun_l26_n352(x)
+    end
+end
+
+def fun_l25_n583(x)
+    if (x < 1)
+        fun_l26_n673(x)
+    else
+        fun_l26_n613(x)
+    end
+end
+
+def fun_l25_n584(x)
+    if (x < 1)
+        fun_l26_n386(x)
+    else
+        fun_l26_n840(x)
+    end
+end
+
+def fun_l25_n585(x)
+    if (x < 1)
+        fun_l26_n847(x)
+    else
+        fun_l26_n372(x)
+    end
+end
+
+def fun_l25_n586(x)
+    if (x < 1)
+        fun_l26_n0(x)
+    else
+        fun_l26_n717(x)
+    end
+end
+
+def fun_l25_n587(x)
+    if (x < 1)
+        fun_l26_n403(x)
+    else
+        fun_l26_n689(x)
+    end
+end
+
+def fun_l25_n588(x)
+    if (x < 1)
+        fun_l26_n325(x)
+    else
+        fun_l26_n75(x)
+    end
+end
+
+def fun_l25_n589(x)
+    if (x < 1)
+        fun_l26_n653(x)
+    else
+        fun_l26_n993(x)
+    end
+end
+
+def fun_l25_n590(x)
+    if (x < 1)
+        fun_l26_n413(x)
+    else
+        fun_l26_n428(x)
+    end
+end
+
+def fun_l25_n591(x)
+    if (x < 1)
+        fun_l26_n93(x)
+    else
+        fun_l26_n264(x)
+    end
+end
+
+def fun_l25_n592(x)
+    if (x < 1)
+        fun_l26_n117(x)
+    else
+        fun_l26_n466(x)
+    end
+end
+
+def fun_l25_n593(x)
+    if (x < 1)
+        fun_l26_n463(x)
+    else
+        fun_l26_n270(x)
+    end
+end
+
+def fun_l25_n594(x)
+    if (x < 1)
+        fun_l26_n348(x)
+    else
+        fun_l26_n844(x)
+    end
+end
+
+def fun_l25_n595(x)
+    if (x < 1)
+        fun_l26_n939(x)
+    else
+        fun_l26_n891(x)
+    end
+end
+
+def fun_l25_n596(x)
+    if (x < 1)
+        fun_l26_n949(x)
+    else
+        fun_l26_n743(x)
+    end
+end
+
+def fun_l25_n597(x)
+    if (x < 1)
+        fun_l26_n884(x)
+    else
+        fun_l26_n831(x)
+    end
+end
+
+def fun_l25_n598(x)
+    if (x < 1)
+        fun_l26_n910(x)
+    else
+        fun_l26_n79(x)
+    end
+end
+
+def fun_l25_n599(x)
+    if (x < 1)
+        fun_l26_n491(x)
+    else
+        fun_l26_n727(x)
+    end
+end
+
+def fun_l25_n600(x)
+    if (x < 1)
+        fun_l26_n295(x)
+    else
+        fun_l26_n929(x)
+    end
+end
+
+def fun_l25_n601(x)
+    if (x < 1)
+        fun_l26_n130(x)
+    else
+        fun_l26_n35(x)
+    end
+end
+
+def fun_l25_n602(x)
+    if (x < 1)
+        fun_l26_n673(x)
+    else
+        fun_l26_n103(x)
+    end
+end
+
+def fun_l25_n603(x)
+    if (x < 1)
+        fun_l26_n669(x)
+    else
+        fun_l26_n449(x)
+    end
+end
+
+def fun_l25_n604(x)
+    if (x < 1)
+        fun_l26_n201(x)
+    else
+        fun_l26_n616(x)
+    end
+end
+
+def fun_l25_n605(x)
+    if (x < 1)
+        fun_l26_n326(x)
+    else
+        fun_l26_n718(x)
+    end
+end
+
+def fun_l25_n606(x)
+    if (x < 1)
+        fun_l26_n857(x)
+    else
+        fun_l26_n188(x)
+    end
+end
+
+def fun_l25_n607(x)
+    if (x < 1)
+        fun_l26_n351(x)
+    else
+        fun_l26_n688(x)
+    end
+end
+
+def fun_l25_n608(x)
+    if (x < 1)
+        fun_l26_n652(x)
+    else
+        fun_l26_n280(x)
+    end
+end
+
+def fun_l25_n609(x)
+    if (x < 1)
+        fun_l26_n994(x)
+    else
+        fun_l26_n341(x)
+    end
+end
+
+def fun_l25_n610(x)
+    if (x < 1)
+        fun_l26_n876(x)
+    else
+        fun_l26_n643(x)
+    end
+end
+
+def fun_l25_n611(x)
+    if (x < 1)
+        fun_l26_n825(x)
+    else
+        fun_l26_n306(x)
+    end
+end
+
+def fun_l25_n612(x)
+    if (x < 1)
+        fun_l26_n139(x)
+    else
+        fun_l26_n452(x)
+    end
+end
+
+def fun_l25_n613(x)
+    if (x < 1)
+        fun_l26_n689(x)
+    else
+        fun_l26_n818(x)
+    end
+end
+
+def fun_l25_n614(x)
+    if (x < 1)
+        fun_l26_n171(x)
+    else
+        fun_l26_n366(x)
+    end
+end
+
+def fun_l25_n615(x)
+    if (x < 1)
+        fun_l26_n658(x)
+    else
+        fun_l26_n603(x)
+    end
+end
+
+def fun_l25_n616(x)
+    if (x < 1)
+        fun_l26_n150(x)
+    else
+        fun_l26_n603(x)
+    end
+end
+
+def fun_l25_n617(x)
+    if (x < 1)
+        fun_l26_n432(x)
+    else
+        fun_l26_n391(x)
+    end
+end
+
+def fun_l25_n618(x)
+    if (x < 1)
+        fun_l26_n79(x)
+    else
+        fun_l26_n416(x)
+    end
+end
+
+def fun_l25_n619(x)
+    if (x < 1)
+        fun_l26_n494(x)
+    else
+        fun_l26_n355(x)
+    end
+end
+
+def fun_l25_n620(x)
+    if (x < 1)
+        fun_l26_n868(x)
+    else
+        fun_l26_n461(x)
+    end
+end
+
+def fun_l25_n621(x)
+    if (x < 1)
+        fun_l26_n954(x)
+    else
+        fun_l26_n31(x)
+    end
+end
+
+def fun_l25_n622(x)
+    if (x < 1)
+        fun_l26_n620(x)
+    else
+        fun_l26_n777(x)
+    end
+end
+
+def fun_l25_n623(x)
+    if (x < 1)
+        fun_l26_n938(x)
+    else
+        fun_l26_n339(x)
+    end
+end
+
+def fun_l25_n624(x)
+    if (x < 1)
+        fun_l26_n385(x)
+    else
+        fun_l26_n462(x)
+    end
+end
+
+def fun_l25_n625(x)
+    if (x < 1)
+        fun_l26_n83(x)
+    else
+        fun_l26_n351(x)
+    end
+end
+
+def fun_l25_n626(x)
+    if (x < 1)
+        fun_l26_n317(x)
+    else
+        fun_l26_n16(x)
+    end
+end
+
+def fun_l25_n627(x)
+    if (x < 1)
+        fun_l26_n321(x)
+    else
+        fun_l26_n955(x)
+    end
+end
+
+def fun_l25_n628(x)
+    if (x < 1)
+        fun_l26_n649(x)
+    else
+        fun_l26_n195(x)
+    end
+end
+
+def fun_l25_n629(x)
+    if (x < 1)
+        fun_l26_n351(x)
+    else
+        fun_l26_n429(x)
+    end
+end
+
+def fun_l25_n630(x)
+    if (x < 1)
+        fun_l26_n338(x)
+    else
+        fun_l26_n334(x)
+    end
+end
+
+def fun_l25_n631(x)
+    if (x < 1)
+        fun_l26_n355(x)
+    else
+        fun_l26_n782(x)
+    end
+end
+
+def fun_l25_n632(x)
+    if (x < 1)
+        fun_l26_n619(x)
+    else
+        fun_l26_n189(x)
+    end
+end
+
+def fun_l25_n633(x)
+    if (x < 1)
+        fun_l26_n818(x)
+    else
+        fun_l26_n740(x)
+    end
+end
+
+def fun_l25_n634(x)
+    if (x < 1)
+        fun_l26_n725(x)
+    else
+        fun_l26_n114(x)
+    end
+end
+
+def fun_l25_n635(x)
+    if (x < 1)
+        fun_l26_n948(x)
+    else
+        fun_l26_n587(x)
+    end
+end
+
+def fun_l25_n636(x)
+    if (x < 1)
+        fun_l26_n268(x)
+    else
+        fun_l26_n871(x)
+    end
+end
+
+def fun_l25_n637(x)
+    if (x < 1)
+        fun_l26_n128(x)
+    else
+        fun_l26_n5(x)
+    end
+end
+
+def fun_l25_n638(x)
+    if (x < 1)
+        fun_l26_n981(x)
+    else
+        fun_l26_n209(x)
+    end
+end
+
+def fun_l25_n639(x)
+    if (x < 1)
+        fun_l26_n729(x)
+    else
+        fun_l26_n786(x)
+    end
+end
+
+def fun_l25_n640(x)
+    if (x < 1)
+        fun_l26_n86(x)
+    else
+        fun_l26_n320(x)
+    end
+end
+
+def fun_l25_n641(x)
+    if (x < 1)
+        fun_l26_n59(x)
+    else
+        fun_l26_n457(x)
+    end
+end
+
+def fun_l25_n642(x)
+    if (x < 1)
+        fun_l26_n517(x)
+    else
+        fun_l26_n249(x)
+    end
+end
+
+def fun_l25_n643(x)
+    if (x < 1)
+        fun_l26_n528(x)
+    else
+        fun_l26_n754(x)
+    end
+end
+
+def fun_l25_n644(x)
+    if (x < 1)
+        fun_l26_n254(x)
+    else
+        fun_l26_n886(x)
+    end
+end
+
+def fun_l25_n645(x)
+    if (x < 1)
+        fun_l26_n244(x)
+    else
+        fun_l26_n364(x)
+    end
+end
+
+def fun_l25_n646(x)
+    if (x < 1)
+        fun_l26_n550(x)
+    else
+        fun_l26_n877(x)
+    end
+end
+
+def fun_l25_n647(x)
+    if (x < 1)
+        fun_l26_n274(x)
+    else
+        fun_l26_n712(x)
+    end
+end
+
+def fun_l25_n648(x)
+    if (x < 1)
+        fun_l26_n299(x)
+    else
+        fun_l26_n957(x)
+    end
+end
+
+def fun_l25_n649(x)
+    if (x < 1)
+        fun_l26_n996(x)
+    else
+        fun_l26_n671(x)
+    end
+end
+
+def fun_l25_n650(x)
+    if (x < 1)
+        fun_l26_n91(x)
+    else
+        fun_l26_n867(x)
+    end
+end
+
+def fun_l25_n651(x)
+    if (x < 1)
+        fun_l26_n987(x)
+    else
+        fun_l26_n643(x)
+    end
+end
+
+def fun_l25_n652(x)
+    if (x < 1)
+        fun_l26_n429(x)
+    else
+        fun_l26_n802(x)
+    end
+end
+
+def fun_l25_n653(x)
+    if (x < 1)
+        fun_l26_n967(x)
+    else
+        fun_l26_n590(x)
+    end
+end
+
+def fun_l25_n654(x)
+    if (x < 1)
+        fun_l26_n404(x)
+    else
+        fun_l26_n283(x)
+    end
+end
+
+def fun_l25_n655(x)
+    if (x < 1)
+        fun_l26_n438(x)
+    else
+        fun_l26_n232(x)
+    end
+end
+
+def fun_l25_n656(x)
+    if (x < 1)
+        fun_l26_n295(x)
+    else
+        fun_l26_n559(x)
+    end
+end
+
+def fun_l25_n657(x)
+    if (x < 1)
+        fun_l26_n892(x)
+    else
+        fun_l26_n46(x)
+    end
+end
+
+def fun_l25_n658(x)
+    if (x < 1)
+        fun_l26_n30(x)
+    else
+        fun_l26_n640(x)
+    end
+end
+
+def fun_l25_n659(x)
+    if (x < 1)
+        fun_l26_n323(x)
+    else
+        fun_l26_n583(x)
+    end
+end
+
+def fun_l25_n660(x)
+    if (x < 1)
+        fun_l26_n682(x)
+    else
+        fun_l26_n668(x)
+    end
+end
+
+def fun_l25_n661(x)
+    if (x < 1)
+        fun_l26_n78(x)
+    else
+        fun_l26_n83(x)
+    end
+end
+
+def fun_l25_n662(x)
+    if (x < 1)
+        fun_l26_n457(x)
+    else
+        fun_l26_n289(x)
+    end
+end
+
+def fun_l25_n663(x)
+    if (x < 1)
+        fun_l26_n444(x)
+    else
+        fun_l26_n159(x)
+    end
+end
+
+def fun_l25_n664(x)
+    if (x < 1)
+        fun_l26_n10(x)
+    else
+        fun_l26_n925(x)
+    end
+end
+
+def fun_l25_n665(x)
+    if (x < 1)
+        fun_l26_n870(x)
+    else
+        fun_l26_n253(x)
+    end
+end
+
+def fun_l25_n666(x)
+    if (x < 1)
+        fun_l26_n55(x)
+    else
+        fun_l26_n705(x)
+    end
+end
+
+def fun_l25_n667(x)
+    if (x < 1)
+        fun_l26_n179(x)
+    else
+        fun_l26_n607(x)
+    end
+end
+
+def fun_l25_n668(x)
+    if (x < 1)
+        fun_l26_n359(x)
+    else
+        fun_l26_n56(x)
+    end
+end
+
+def fun_l25_n669(x)
+    if (x < 1)
+        fun_l26_n908(x)
+    else
+        fun_l26_n997(x)
+    end
+end
+
+def fun_l25_n670(x)
+    if (x < 1)
+        fun_l26_n469(x)
+    else
+        fun_l26_n438(x)
+    end
+end
+
+def fun_l25_n671(x)
+    if (x < 1)
+        fun_l26_n740(x)
+    else
+        fun_l26_n847(x)
+    end
+end
+
+def fun_l25_n672(x)
+    if (x < 1)
+        fun_l26_n123(x)
+    else
+        fun_l26_n636(x)
+    end
+end
+
+def fun_l25_n673(x)
+    if (x < 1)
+        fun_l26_n654(x)
+    else
+        fun_l26_n221(x)
+    end
+end
+
+def fun_l25_n674(x)
+    if (x < 1)
+        fun_l26_n14(x)
+    else
+        fun_l26_n792(x)
+    end
+end
+
+def fun_l25_n675(x)
+    if (x < 1)
+        fun_l26_n424(x)
+    else
+        fun_l26_n999(x)
+    end
+end
+
+def fun_l25_n676(x)
+    if (x < 1)
+        fun_l26_n491(x)
+    else
+        fun_l26_n698(x)
+    end
+end
+
+def fun_l25_n677(x)
+    if (x < 1)
+        fun_l26_n859(x)
+    else
+        fun_l26_n749(x)
+    end
+end
+
+def fun_l25_n678(x)
+    if (x < 1)
+        fun_l26_n357(x)
+    else
+        fun_l26_n861(x)
+    end
+end
+
+def fun_l25_n679(x)
+    if (x < 1)
+        fun_l26_n144(x)
+    else
+        fun_l26_n347(x)
+    end
+end
+
+def fun_l25_n680(x)
+    if (x < 1)
+        fun_l26_n42(x)
+    else
+        fun_l26_n168(x)
+    end
+end
+
+def fun_l25_n681(x)
+    if (x < 1)
+        fun_l26_n808(x)
+    else
+        fun_l26_n639(x)
+    end
+end
+
+def fun_l25_n682(x)
+    if (x < 1)
+        fun_l26_n943(x)
+    else
+        fun_l26_n152(x)
+    end
+end
+
+def fun_l25_n683(x)
+    if (x < 1)
+        fun_l26_n668(x)
+    else
+        fun_l26_n186(x)
+    end
+end
+
+def fun_l25_n684(x)
+    if (x < 1)
+        fun_l26_n607(x)
+    else
+        fun_l26_n141(x)
+    end
+end
+
+def fun_l25_n685(x)
+    if (x < 1)
+        fun_l26_n221(x)
+    else
+        fun_l26_n960(x)
+    end
+end
+
+def fun_l25_n686(x)
+    if (x < 1)
+        fun_l26_n85(x)
+    else
+        fun_l26_n285(x)
+    end
+end
+
+def fun_l25_n687(x)
+    if (x < 1)
+        fun_l26_n707(x)
+    else
+        fun_l26_n638(x)
+    end
+end
+
+def fun_l25_n688(x)
+    if (x < 1)
+        fun_l26_n288(x)
+    else
+        fun_l26_n318(x)
+    end
+end
+
+def fun_l25_n689(x)
+    if (x < 1)
+        fun_l26_n505(x)
+    else
+        fun_l26_n802(x)
+    end
+end
+
+def fun_l25_n690(x)
+    if (x < 1)
+        fun_l26_n757(x)
+    else
+        fun_l26_n988(x)
+    end
+end
+
+def fun_l25_n691(x)
+    if (x < 1)
+        fun_l26_n211(x)
+    else
+        fun_l26_n868(x)
+    end
+end
+
+def fun_l25_n692(x)
+    if (x < 1)
+        fun_l26_n945(x)
+    else
+        fun_l26_n689(x)
+    end
+end
+
+def fun_l25_n693(x)
+    if (x < 1)
+        fun_l26_n65(x)
+    else
+        fun_l26_n326(x)
+    end
+end
+
+def fun_l25_n694(x)
+    if (x < 1)
+        fun_l26_n905(x)
+    else
+        fun_l26_n912(x)
+    end
+end
+
+def fun_l25_n695(x)
+    if (x < 1)
+        fun_l26_n408(x)
+    else
+        fun_l26_n834(x)
+    end
+end
+
+def fun_l25_n696(x)
+    if (x < 1)
+        fun_l26_n862(x)
+    else
+        fun_l26_n827(x)
+    end
+end
+
+def fun_l25_n697(x)
+    if (x < 1)
+        fun_l26_n356(x)
+    else
+        fun_l26_n201(x)
+    end
+end
+
+def fun_l25_n698(x)
+    if (x < 1)
+        fun_l26_n819(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n699(x)
+    if (x < 1)
+        fun_l26_n252(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n700(x)
+    if (x < 1)
+        fun_l26_n620(x)
+    else
+        fun_l26_n693(x)
+    end
+end
+
+def fun_l25_n701(x)
+    if (x < 1)
+        fun_l26_n393(x)
+    else
+        fun_l26_n246(x)
+    end
+end
+
+def fun_l25_n702(x)
+    if (x < 1)
+        fun_l26_n601(x)
+    else
+        fun_l26_n230(x)
+    end
+end
+
+def fun_l25_n703(x)
+    if (x < 1)
+        fun_l26_n583(x)
+    else
+        fun_l26_n503(x)
+    end
+end
+
+def fun_l25_n704(x)
+    if (x < 1)
+        fun_l26_n156(x)
+    else
+        fun_l26_n951(x)
+    end
+end
+
+def fun_l25_n705(x)
+    if (x < 1)
+        fun_l26_n681(x)
+    else
+        fun_l26_n692(x)
+    end
+end
+
+def fun_l25_n706(x)
+    if (x < 1)
+        fun_l26_n176(x)
+    else
+        fun_l26_n158(x)
+    end
+end
+
+def fun_l25_n707(x)
+    if (x < 1)
+        fun_l26_n607(x)
+    else
+        fun_l26_n3(x)
+    end
+end
+
+def fun_l25_n708(x)
+    if (x < 1)
+        fun_l26_n999(x)
+    else
+        fun_l26_n614(x)
+    end
+end
+
+def fun_l25_n709(x)
+    if (x < 1)
+        fun_l26_n930(x)
+    else
+        fun_l26_n888(x)
+    end
+end
+
+def fun_l25_n710(x)
+    if (x < 1)
+        fun_l26_n347(x)
+    else
+        fun_l26_n106(x)
+    end
+end
+
+def fun_l25_n711(x)
+    if (x < 1)
+        fun_l26_n425(x)
+    else
+        fun_l26_n474(x)
+    end
+end
+
+def fun_l25_n712(x)
+    if (x < 1)
+        fun_l26_n265(x)
+    else
+        fun_l26_n519(x)
+    end
+end
+
+def fun_l25_n713(x)
+    if (x < 1)
+        fun_l26_n205(x)
+    else
+        fun_l26_n76(x)
+    end
+end
+
+def fun_l25_n714(x)
+    if (x < 1)
+        fun_l26_n628(x)
+    else
+        fun_l26_n784(x)
+    end
+end
+
+def fun_l25_n715(x)
+    if (x < 1)
+        fun_l26_n217(x)
+    else
+        fun_l26_n484(x)
+    end
+end
+
+def fun_l25_n716(x)
+    if (x < 1)
+        fun_l26_n883(x)
+    else
+        fun_l26_n5(x)
+    end
+end
+
+def fun_l25_n717(x)
+    if (x < 1)
+        fun_l26_n23(x)
+    else
+        fun_l26_n457(x)
+    end
+end
+
+def fun_l25_n718(x)
+    if (x < 1)
+        fun_l26_n370(x)
+    else
+        fun_l26_n789(x)
+    end
+end
+
+def fun_l25_n719(x)
+    if (x < 1)
+        fun_l26_n636(x)
+    else
+        fun_l26_n776(x)
+    end
+end
+
+def fun_l25_n720(x)
+    if (x < 1)
+        fun_l26_n558(x)
+    else
+        fun_l26_n491(x)
+    end
+end
+
+def fun_l25_n721(x)
+    if (x < 1)
+        fun_l26_n867(x)
+    else
+        fun_l26_n49(x)
+    end
+end
+
+def fun_l25_n722(x)
+    if (x < 1)
+        fun_l26_n178(x)
+    else
+        fun_l26_n835(x)
+    end
+end
+
+def fun_l25_n723(x)
+    if (x < 1)
+        fun_l26_n967(x)
+    else
+        fun_l26_n266(x)
+    end
+end
+
+def fun_l25_n724(x)
+    if (x < 1)
+        fun_l26_n191(x)
+    else
+        fun_l26_n58(x)
+    end
+end
+
+def fun_l25_n725(x)
+    if (x < 1)
+        fun_l26_n536(x)
+    else
+        fun_l26_n78(x)
+    end
+end
+
+def fun_l25_n726(x)
+    if (x < 1)
+        fun_l26_n128(x)
+    else
+        fun_l26_n764(x)
+    end
+end
+
+def fun_l25_n727(x)
+    if (x < 1)
+        fun_l26_n243(x)
+    else
+        fun_l26_n217(x)
+    end
+end
+
+def fun_l25_n728(x)
+    if (x < 1)
+        fun_l26_n608(x)
+    else
+        fun_l26_n613(x)
+    end
+end
+
+def fun_l25_n729(x)
+    if (x < 1)
+        fun_l26_n765(x)
+    else
+        fun_l26_n822(x)
+    end
+end
+
+def fun_l25_n730(x)
+    if (x < 1)
+        fun_l26_n445(x)
+    else
+        fun_l26_n160(x)
+    end
+end
+
+def fun_l25_n731(x)
+    if (x < 1)
+        fun_l26_n209(x)
+    else
+        fun_l26_n980(x)
+    end
+end
+
+def fun_l25_n732(x)
+    if (x < 1)
+        fun_l26_n888(x)
+    else
+        fun_l26_n726(x)
+    end
+end
+
+def fun_l25_n733(x)
+    if (x < 1)
+        fun_l26_n232(x)
+    else
+        fun_l26_n47(x)
+    end
+end
+
+def fun_l25_n734(x)
+    if (x < 1)
+        fun_l26_n278(x)
+    else
+        fun_l26_n878(x)
+    end
+end
+
+def fun_l25_n735(x)
+    if (x < 1)
+        fun_l26_n894(x)
+    else
+        fun_l26_n523(x)
+    end
+end
+
+def fun_l25_n736(x)
+    if (x < 1)
+        fun_l26_n334(x)
+    else
+        fun_l26_n270(x)
+    end
+end
+
+def fun_l25_n737(x)
+    if (x < 1)
+        fun_l26_n877(x)
+    else
+        fun_l26_n105(x)
+    end
+end
+
+def fun_l25_n738(x)
+    if (x < 1)
+        fun_l26_n761(x)
+    else
+        fun_l26_n187(x)
+    end
+end
+
+def fun_l25_n739(x)
+    if (x < 1)
+        fun_l26_n668(x)
+    else
+        fun_l26_n592(x)
+    end
+end
+
+def fun_l25_n740(x)
+    if (x < 1)
+        fun_l26_n497(x)
+    else
+        fun_l26_n98(x)
+    end
+end
+
+def fun_l25_n741(x)
+    if (x < 1)
+        fun_l26_n415(x)
+    else
+        fun_l26_n85(x)
+    end
+end
+
+def fun_l25_n742(x)
+    if (x < 1)
+        fun_l26_n883(x)
+    else
+        fun_l26_n505(x)
+    end
+end
+
+def fun_l25_n743(x)
+    if (x < 1)
+        fun_l26_n12(x)
+    else
+        fun_l26_n91(x)
+    end
+end
+
+def fun_l25_n744(x)
+    if (x < 1)
+        fun_l26_n487(x)
+    else
+        fun_l26_n336(x)
+    end
+end
+
+def fun_l25_n745(x)
+    if (x < 1)
+        fun_l26_n489(x)
+    else
+        fun_l26_n186(x)
+    end
+end
+
+def fun_l25_n746(x)
+    if (x < 1)
+        fun_l26_n783(x)
+    else
+        fun_l26_n233(x)
+    end
+end
+
+def fun_l25_n747(x)
+    if (x < 1)
+        fun_l26_n171(x)
+    else
+        fun_l26_n574(x)
+    end
+end
+
+def fun_l25_n748(x)
+    if (x < 1)
+        fun_l26_n171(x)
+    else
+        fun_l26_n61(x)
+    end
+end
+
+def fun_l25_n749(x)
+    if (x < 1)
+        fun_l26_n444(x)
+    else
+        fun_l26_n89(x)
+    end
+end
+
+def fun_l25_n750(x)
+    if (x < 1)
+        fun_l26_n609(x)
+    else
+        fun_l26_n998(x)
+    end
+end
+
+def fun_l25_n751(x)
+    if (x < 1)
+        fun_l26_n914(x)
+    else
+        fun_l26_n893(x)
+    end
+end
+
+def fun_l25_n752(x)
+    if (x < 1)
+        fun_l26_n782(x)
+    else
+        fun_l26_n984(x)
+    end
+end
+
+def fun_l25_n753(x)
+    if (x < 1)
+        fun_l26_n351(x)
+    else
+        fun_l26_n370(x)
+    end
+end
+
+def fun_l25_n754(x)
+    if (x < 1)
+        fun_l26_n689(x)
+    else
+        fun_l26_n234(x)
+    end
+end
+
+def fun_l25_n755(x)
+    if (x < 1)
+        fun_l26_n131(x)
+    else
+        fun_l26_n960(x)
+    end
+end
+
+def fun_l25_n756(x)
+    if (x < 1)
+        fun_l26_n635(x)
+    else
+        fun_l26_n89(x)
+    end
+end
+
+def fun_l25_n757(x)
+    if (x < 1)
+        fun_l26_n309(x)
+    else
+        fun_l26_n74(x)
+    end
+end
+
+def fun_l25_n758(x)
+    if (x < 1)
+        fun_l26_n818(x)
+    else
+        fun_l26_n520(x)
+    end
+end
+
+def fun_l25_n759(x)
+    if (x < 1)
+        fun_l26_n873(x)
+    else
+        fun_l26_n761(x)
+    end
+end
+
+def fun_l25_n760(x)
+    if (x < 1)
+        fun_l26_n216(x)
+    else
+        fun_l26_n449(x)
+    end
+end
+
+def fun_l25_n761(x)
+    if (x < 1)
+        fun_l26_n596(x)
+    else
+        fun_l26_n617(x)
+    end
+end
+
+def fun_l25_n762(x)
+    if (x < 1)
+        fun_l26_n485(x)
+    else
+        fun_l26_n164(x)
+    end
+end
+
+def fun_l25_n763(x)
+    if (x < 1)
+        fun_l26_n434(x)
+    else
+        fun_l26_n422(x)
+    end
+end
+
+def fun_l25_n764(x)
+    if (x < 1)
+        fun_l26_n845(x)
+    else
+        fun_l26_n678(x)
+    end
+end
+
+def fun_l25_n765(x)
+    if (x < 1)
+        fun_l26_n376(x)
+    else
+        fun_l26_n128(x)
+    end
+end
+
+def fun_l25_n766(x)
+    if (x < 1)
+        fun_l26_n217(x)
+    else
+        fun_l26_n721(x)
+    end
+end
+
+def fun_l25_n767(x)
+    if (x < 1)
+        fun_l26_n929(x)
+    else
+        fun_l26_n425(x)
+    end
+end
+
+def fun_l25_n768(x)
+    if (x < 1)
+        fun_l26_n420(x)
+    else
+        fun_l26_n990(x)
+    end
+end
+
+def fun_l25_n769(x)
+    if (x < 1)
+        fun_l26_n310(x)
+    else
+        fun_l26_n901(x)
+    end
+end
+
+def fun_l25_n770(x)
+    if (x < 1)
+        fun_l26_n667(x)
+    else
+        fun_l26_n627(x)
+    end
+end
+
+def fun_l25_n771(x)
+    if (x < 1)
+        fun_l26_n265(x)
+    else
+        fun_l26_n852(x)
+    end
+end
+
+def fun_l25_n772(x)
+    if (x < 1)
+        fun_l26_n520(x)
+    else
+        fun_l26_n596(x)
+    end
+end
+
+def fun_l25_n773(x)
+    if (x < 1)
+        fun_l26_n280(x)
+    else
+        fun_l26_n0(x)
+    end
+end
+
+def fun_l25_n774(x)
+    if (x < 1)
+        fun_l26_n451(x)
+    else
+        fun_l26_n828(x)
+    end
+end
+
+def fun_l25_n775(x)
+    if (x < 1)
+        fun_l26_n814(x)
+    else
+        fun_l26_n797(x)
+    end
+end
+
+def fun_l25_n776(x)
+    if (x < 1)
+        fun_l26_n345(x)
+    else
+        fun_l26_n223(x)
+    end
+end
+
+def fun_l25_n777(x)
+    if (x < 1)
+        fun_l26_n392(x)
+    else
+        fun_l26_n847(x)
+    end
+end
+
+def fun_l25_n778(x)
+    if (x < 1)
+        fun_l26_n957(x)
+    else
+        fun_l26_n474(x)
+    end
+end
+
+def fun_l25_n779(x)
+    if (x < 1)
+        fun_l26_n950(x)
+    else
+        fun_l26_n804(x)
+    end
+end
+
+def fun_l25_n780(x)
+    if (x < 1)
+        fun_l26_n939(x)
+    else
+        fun_l26_n133(x)
+    end
+end
+
+def fun_l25_n781(x)
+    if (x < 1)
+        fun_l26_n176(x)
+    else
+        fun_l26_n237(x)
+    end
+end
+
+def fun_l25_n782(x)
+    if (x < 1)
+        fun_l26_n156(x)
+    else
+        fun_l26_n268(x)
+    end
+end
+
+def fun_l25_n783(x)
+    if (x < 1)
+        fun_l26_n750(x)
+    else
+        fun_l26_n88(x)
+    end
+end
+
+def fun_l25_n784(x)
+    if (x < 1)
+        fun_l26_n638(x)
+    else
+        fun_l26_n147(x)
+    end
+end
+
+def fun_l25_n785(x)
+    if (x < 1)
+        fun_l26_n570(x)
+    else
+        fun_l26_n698(x)
+    end
+end
+
+def fun_l25_n786(x)
+    if (x < 1)
+        fun_l26_n749(x)
+    else
+        fun_l26_n728(x)
+    end
+end
+
+def fun_l25_n787(x)
+    if (x < 1)
+        fun_l26_n183(x)
+    else
+        fun_l26_n649(x)
+    end
+end
+
+def fun_l25_n788(x)
+    if (x < 1)
+        fun_l26_n157(x)
+    else
+        fun_l26_n55(x)
+    end
+end
+
+def fun_l25_n789(x)
+    if (x < 1)
+        fun_l26_n559(x)
+    else
+        fun_l26_n228(x)
+    end
+end
+
+def fun_l25_n790(x)
+    if (x < 1)
+        fun_l26_n690(x)
+    else
+        fun_l26_n214(x)
+    end
+end
+
+def fun_l25_n791(x)
+    if (x < 1)
+        fun_l26_n621(x)
+    else
+        fun_l26_n184(x)
+    end
+end
+
+def fun_l25_n792(x)
+    if (x < 1)
+        fun_l26_n13(x)
+    else
+        fun_l26_n610(x)
+    end
+end
+
+def fun_l25_n793(x)
+    if (x < 1)
+        fun_l26_n709(x)
+    else
+        fun_l26_n40(x)
+    end
+end
+
+def fun_l25_n794(x)
+    if (x < 1)
+        fun_l26_n51(x)
+    else
+        fun_l26_n288(x)
+    end
+end
+
+def fun_l25_n795(x)
+    if (x < 1)
+        fun_l26_n526(x)
+    else
+        fun_l26_n237(x)
+    end
+end
+
+def fun_l25_n796(x)
+    if (x < 1)
+        fun_l26_n279(x)
+    else
+        fun_l26_n157(x)
+    end
+end
+
+def fun_l25_n797(x)
+    if (x < 1)
+        fun_l26_n299(x)
+    else
+        fun_l26_n999(x)
+    end
+end
+
+def fun_l25_n798(x)
+    if (x < 1)
+        fun_l26_n547(x)
+    else
+        fun_l26_n41(x)
+    end
+end
+
+def fun_l25_n799(x)
+    if (x < 1)
+        fun_l26_n522(x)
+    else
+        fun_l26_n544(x)
+    end
+end
+
+def fun_l25_n800(x)
+    if (x < 1)
+        fun_l26_n509(x)
+    else
+        fun_l26_n364(x)
+    end
+end
+
+def fun_l25_n801(x)
+    if (x < 1)
+        fun_l26_n412(x)
+    else
+        fun_l26_n719(x)
+    end
+end
+
+def fun_l25_n802(x)
+    if (x < 1)
+        fun_l26_n844(x)
+    else
+        fun_l26_n452(x)
+    end
+end
+
+def fun_l25_n803(x)
+    if (x < 1)
+        fun_l26_n681(x)
+    else
+        fun_l26_n217(x)
+    end
+end
+
+def fun_l25_n804(x)
+    if (x < 1)
+        fun_l26_n855(x)
+    else
+        fun_l26_n97(x)
+    end
+end
+
+def fun_l25_n805(x)
+    if (x < 1)
+        fun_l26_n32(x)
+    else
+        fun_l26_n512(x)
+    end
+end
+
+def fun_l25_n806(x)
+    if (x < 1)
+        fun_l26_n674(x)
+    else
+        fun_l26_n675(x)
+    end
+end
+
+def fun_l25_n807(x)
+    if (x < 1)
+        fun_l26_n684(x)
+    else
+        fun_l26_n848(x)
+    end
+end
+
+def fun_l25_n808(x)
+    if (x < 1)
+        fun_l26_n784(x)
+    else
+        fun_l26_n603(x)
+    end
+end
+
+def fun_l25_n809(x)
+    if (x < 1)
+        fun_l26_n58(x)
+    else
+        fun_l26_n20(x)
+    end
+end
+
+def fun_l25_n810(x)
+    if (x < 1)
+        fun_l26_n654(x)
+    else
+        fun_l26_n230(x)
+    end
+end
+
+def fun_l25_n811(x)
+    if (x < 1)
+        fun_l26_n627(x)
+    else
+        fun_l26_n812(x)
+    end
+end
+
+def fun_l25_n812(x)
+    if (x < 1)
+        fun_l26_n30(x)
+    else
+        fun_l26_n315(x)
+    end
+end
+
+def fun_l25_n813(x)
+    if (x < 1)
+        fun_l26_n690(x)
+    else
+        fun_l26_n755(x)
+    end
+end
+
+def fun_l25_n814(x)
+    if (x < 1)
+        fun_l26_n566(x)
+    else
+        fun_l26_n44(x)
+    end
+end
+
+def fun_l25_n815(x)
+    if (x < 1)
+        fun_l26_n884(x)
+    else
+        fun_l26_n954(x)
+    end
+end
+
+def fun_l25_n816(x)
+    if (x < 1)
+        fun_l26_n64(x)
+    else
+        fun_l26_n179(x)
+    end
+end
+
+def fun_l25_n817(x)
+    if (x < 1)
+        fun_l26_n341(x)
+    else
+        fun_l26_n440(x)
+    end
+end
+
+def fun_l25_n818(x)
+    if (x < 1)
+        fun_l26_n934(x)
+    else
+        fun_l26_n678(x)
+    end
+end
+
+def fun_l25_n819(x)
+    if (x < 1)
+        fun_l26_n225(x)
+    else
+        fun_l26_n807(x)
+    end
+end
+
+def fun_l25_n820(x)
+    if (x < 1)
+        fun_l26_n625(x)
+    else
+        fun_l26_n63(x)
+    end
+end
+
+def fun_l25_n821(x)
+    if (x < 1)
+        fun_l26_n744(x)
+    else
+        fun_l26_n68(x)
+    end
+end
+
+def fun_l25_n822(x)
+    if (x < 1)
+        fun_l26_n962(x)
+    else
+        fun_l26_n205(x)
+    end
+end
+
+def fun_l25_n823(x)
+    if (x < 1)
+        fun_l26_n715(x)
+    else
+        fun_l26_n130(x)
+    end
+end
+
+def fun_l25_n824(x)
+    if (x < 1)
+        fun_l26_n843(x)
+    else
+        fun_l26_n853(x)
+    end
+end
+
+def fun_l25_n825(x)
+    if (x < 1)
+        fun_l26_n34(x)
+    else
+        fun_l26_n665(x)
+    end
+end
+
+def fun_l25_n826(x)
+    if (x < 1)
+        fun_l26_n540(x)
+    else
+        fun_l26_n693(x)
+    end
+end
+
+def fun_l25_n827(x)
+    if (x < 1)
+        fun_l26_n482(x)
+    else
+        fun_l26_n527(x)
+    end
+end
+
+def fun_l25_n828(x)
+    if (x < 1)
+        fun_l26_n98(x)
+    else
+        fun_l26_n888(x)
+    end
+end
+
+def fun_l25_n829(x)
+    if (x < 1)
+        fun_l26_n681(x)
+    else
+        fun_l26_n176(x)
+    end
+end
+
+def fun_l25_n830(x)
+    if (x < 1)
+        fun_l26_n453(x)
+    else
+        fun_l26_n455(x)
+    end
+end
+
+def fun_l25_n831(x)
+    if (x < 1)
+        fun_l26_n587(x)
+    else
+        fun_l26_n501(x)
+    end
+end
+
+def fun_l25_n832(x)
+    if (x < 1)
+        fun_l26_n725(x)
+    else
+        fun_l26_n608(x)
+    end
+end
+
+def fun_l25_n833(x)
+    if (x < 1)
+        fun_l26_n589(x)
+    else
+        fun_l26_n945(x)
+    end
+end
+
+def fun_l25_n834(x)
+    if (x < 1)
+        fun_l26_n41(x)
+    else
+        fun_l26_n925(x)
+    end
+end
+
+def fun_l25_n835(x)
+    if (x < 1)
+        fun_l26_n858(x)
+    else
+        fun_l26_n840(x)
+    end
+end
+
+def fun_l25_n836(x)
+    if (x < 1)
+        fun_l26_n572(x)
+    else
+        fun_l26_n360(x)
+    end
+end
+
+def fun_l25_n837(x)
+    if (x < 1)
+        fun_l26_n446(x)
+    else
+        fun_l26_n912(x)
+    end
+end
+
+def fun_l25_n838(x)
+    if (x < 1)
+        fun_l26_n104(x)
+    else
+        fun_l26_n795(x)
+    end
+end
+
+def fun_l25_n839(x)
+    if (x < 1)
+        fun_l26_n607(x)
+    else
+        fun_l26_n803(x)
+    end
+end
+
+def fun_l25_n840(x)
+    if (x < 1)
+        fun_l26_n156(x)
+    else
+        fun_l26_n874(x)
+    end
+end
+
+def fun_l25_n841(x)
+    if (x < 1)
+        fun_l26_n314(x)
+    else
+        fun_l26_n28(x)
+    end
+end
+
+def fun_l25_n842(x)
+    if (x < 1)
+        fun_l26_n683(x)
+    else
+        fun_l26_n695(x)
+    end
+end
+
+def fun_l25_n843(x)
+    if (x < 1)
+        fun_l26_n881(x)
+    else
+        fun_l26_n272(x)
+    end
+end
+
+def fun_l25_n844(x)
+    if (x < 1)
+        fun_l26_n354(x)
+    else
+        fun_l26_n993(x)
+    end
+end
+
+def fun_l25_n845(x)
+    if (x < 1)
+        fun_l26_n686(x)
+    else
+        fun_l26_n594(x)
+    end
+end
+
+def fun_l25_n846(x)
+    if (x < 1)
+        fun_l26_n644(x)
+    else
+        fun_l26_n930(x)
+    end
+end
+
+def fun_l25_n847(x)
+    if (x < 1)
+        fun_l26_n417(x)
+    else
+        fun_l26_n705(x)
+    end
+end
+
+def fun_l25_n848(x)
+    if (x < 1)
+        fun_l26_n694(x)
+    else
+        fun_l26_n331(x)
+    end
+end
+
+def fun_l25_n849(x)
+    if (x < 1)
+        fun_l26_n546(x)
+    else
+        fun_l26_n848(x)
+    end
+end
+
+def fun_l25_n850(x)
+    if (x < 1)
+        fun_l26_n199(x)
+    else
+        fun_l26_n49(x)
+    end
+end
+
+def fun_l25_n851(x)
+    if (x < 1)
+        fun_l26_n439(x)
+    else
+        fun_l26_n406(x)
+    end
+end
+
+def fun_l25_n852(x)
+    if (x < 1)
+        fun_l26_n355(x)
+    else
+        fun_l26_n582(x)
+    end
+end
+
+def fun_l25_n853(x)
+    if (x < 1)
+        fun_l26_n839(x)
+    else
+        fun_l26_n485(x)
+    end
+end
+
+def fun_l25_n854(x)
+    if (x < 1)
+        fun_l26_n952(x)
+    else
+        fun_l26_n781(x)
+    end
+end
+
+def fun_l25_n855(x)
+    if (x < 1)
+        fun_l26_n616(x)
+    else
+        fun_l26_n811(x)
+    end
+end
+
+def fun_l25_n856(x)
+    if (x < 1)
+        fun_l26_n590(x)
+    else
+        fun_l26_n977(x)
+    end
+end
+
+def fun_l25_n857(x)
+    if (x < 1)
+        fun_l26_n167(x)
+    else
+        fun_l26_n329(x)
+    end
+end
+
+def fun_l25_n858(x)
+    if (x < 1)
+        fun_l26_n732(x)
+    else
+        fun_l26_n707(x)
+    end
+end
+
+def fun_l25_n859(x)
+    if (x < 1)
+        fun_l26_n956(x)
+    else
+        fun_l26_n955(x)
+    end
+end
+
+def fun_l25_n860(x)
+    if (x < 1)
+        fun_l26_n443(x)
+    else
+        fun_l26_n816(x)
+    end
+end
+
+def fun_l25_n861(x)
+    if (x < 1)
+        fun_l26_n584(x)
+    else
+        fun_l26_n671(x)
+    end
+end
+
+def fun_l25_n862(x)
+    if (x < 1)
+        fun_l26_n43(x)
+    else
+        fun_l26_n0(x)
+    end
+end
+
+def fun_l25_n863(x)
+    if (x < 1)
+        fun_l26_n697(x)
+    else
+        fun_l26_n842(x)
+    end
+end
+
+def fun_l25_n864(x)
+    if (x < 1)
+        fun_l26_n423(x)
+    else
+        fun_l26_n509(x)
+    end
+end
+
+def fun_l25_n865(x)
+    if (x < 1)
+        fun_l26_n239(x)
+    else
+        fun_l26_n257(x)
+    end
+end
+
+def fun_l25_n866(x)
+    if (x < 1)
+        fun_l26_n78(x)
+    else
+        fun_l26_n450(x)
+    end
+end
+
+def fun_l25_n867(x)
+    if (x < 1)
+        fun_l26_n121(x)
+    else
+        fun_l26_n453(x)
+    end
+end
+
+def fun_l25_n868(x)
+    if (x < 1)
+        fun_l26_n844(x)
+    else
+        fun_l26_n977(x)
+    end
+end
+
+def fun_l25_n869(x)
+    if (x < 1)
+        fun_l26_n54(x)
+    else
+        fun_l26_n869(x)
+    end
+end
+
+def fun_l25_n870(x)
+    if (x < 1)
+        fun_l26_n18(x)
+    else
+        fun_l26_n799(x)
+    end
+end
+
+def fun_l25_n871(x)
+    if (x < 1)
+        fun_l26_n990(x)
+    else
+        fun_l26_n53(x)
+    end
+end
+
+def fun_l25_n872(x)
+    if (x < 1)
+        fun_l26_n607(x)
+    else
+        fun_l26_n822(x)
+    end
+end
+
+def fun_l25_n873(x)
+    if (x < 1)
+        fun_l26_n378(x)
+    else
+        fun_l26_n158(x)
+    end
+end
+
+def fun_l25_n874(x)
+    if (x < 1)
+        fun_l26_n206(x)
+    else
+        fun_l26_n271(x)
+    end
+end
+
+def fun_l25_n875(x)
+    if (x < 1)
+        fun_l26_n536(x)
+    else
+        fun_l26_n850(x)
+    end
+end
+
+def fun_l25_n876(x)
+    if (x < 1)
+        fun_l26_n129(x)
+    else
+        fun_l26_n750(x)
+    end
+end
+
+def fun_l25_n877(x)
+    if (x < 1)
+        fun_l26_n553(x)
+    else
+        fun_l26_n815(x)
+    end
+end
+
+def fun_l25_n878(x)
+    if (x < 1)
+        fun_l26_n619(x)
+    else
+        fun_l26_n182(x)
+    end
+end
+
+def fun_l25_n879(x)
+    if (x < 1)
+        fun_l26_n529(x)
+    else
+        fun_l26_n541(x)
+    end
+end
+
+def fun_l25_n880(x)
+    if (x < 1)
+        fun_l26_n228(x)
+    else
+        fun_l26_n672(x)
+    end
+end
+
+def fun_l25_n881(x)
+    if (x < 1)
+        fun_l26_n834(x)
+    else
+        fun_l26_n830(x)
+    end
+end
+
+def fun_l25_n882(x)
+    if (x < 1)
+        fun_l26_n80(x)
+    else
+        fun_l26_n257(x)
+    end
+end
+
+def fun_l25_n883(x)
+    if (x < 1)
+        fun_l26_n805(x)
+    else
+        fun_l26_n589(x)
+    end
+end
+
+def fun_l25_n884(x)
+    if (x < 1)
+        fun_l26_n20(x)
+    else
+        fun_l26_n880(x)
+    end
+end
+
+def fun_l25_n885(x)
+    if (x < 1)
+        fun_l26_n924(x)
+    else
+        fun_l26_n832(x)
+    end
+end
+
+def fun_l25_n886(x)
+    if (x < 1)
+        fun_l26_n262(x)
+    else
+        fun_l26_n928(x)
+    end
+end
+
+def fun_l25_n887(x)
+    if (x < 1)
+        fun_l26_n461(x)
+    else
+        fun_l26_n81(x)
+    end
+end
+
+def fun_l25_n888(x)
+    if (x < 1)
+        fun_l26_n484(x)
+    else
+        fun_l26_n376(x)
+    end
+end
+
+def fun_l25_n889(x)
+    if (x < 1)
+        fun_l26_n26(x)
+    else
+        fun_l26_n28(x)
+    end
+end
+
+def fun_l25_n890(x)
+    if (x < 1)
+        fun_l26_n184(x)
+    else
+        fun_l26_n623(x)
+    end
+end
+
+def fun_l25_n891(x)
+    if (x < 1)
+        fun_l26_n326(x)
+    else
+        fun_l26_n441(x)
+    end
+end
+
+def fun_l25_n892(x)
+    if (x < 1)
+        fun_l26_n35(x)
+    else
+        fun_l26_n543(x)
+    end
+end
+
+def fun_l25_n893(x)
+    if (x < 1)
+        fun_l26_n568(x)
+    else
+        fun_l26_n229(x)
+    end
+end
+
+def fun_l25_n894(x)
+    if (x < 1)
+        fun_l26_n163(x)
+    else
+        fun_l26_n505(x)
+    end
+end
+
+def fun_l25_n895(x)
+    if (x < 1)
+        fun_l26_n675(x)
+    else
+        fun_l26_n508(x)
+    end
+end
+
+def fun_l25_n896(x)
+    if (x < 1)
+        fun_l26_n285(x)
+    else
+        fun_l26_n936(x)
+    end
+end
+
+def fun_l25_n897(x)
+    if (x < 1)
+        fun_l26_n848(x)
+    else
+        fun_l26_n169(x)
+    end
+end
+
+def fun_l25_n898(x)
+    if (x < 1)
+        fun_l26_n139(x)
+    else
+        fun_l26_n479(x)
+    end
+end
+
+def fun_l25_n899(x)
+    if (x < 1)
+        fun_l26_n355(x)
+    else
+        fun_l26_n49(x)
+    end
+end
+
+def fun_l25_n900(x)
+    if (x < 1)
+        fun_l26_n918(x)
+    else
+        fun_l26_n215(x)
+    end
+end
+
+def fun_l25_n901(x)
+    if (x < 1)
+        fun_l26_n55(x)
+    else
+        fun_l26_n550(x)
+    end
+end
+
+def fun_l25_n902(x)
+    if (x < 1)
+        fun_l26_n660(x)
+    else
+        fun_l26_n117(x)
+    end
+end
+
+def fun_l25_n903(x)
+    if (x < 1)
+        fun_l26_n968(x)
+    else
+        fun_l26_n279(x)
+    end
+end
+
+def fun_l25_n904(x)
+    if (x < 1)
+        fun_l26_n693(x)
+    else
+        fun_l26_n57(x)
+    end
+end
+
+def fun_l25_n905(x)
+    if (x < 1)
+        fun_l26_n248(x)
+    else
+        fun_l26_n154(x)
+    end
+end
+
+def fun_l25_n906(x)
+    if (x < 1)
+        fun_l26_n837(x)
+    else
+        fun_l26_n698(x)
+    end
+end
+
+def fun_l25_n907(x)
+    if (x < 1)
+        fun_l26_n630(x)
+    else
+        fun_l26_n460(x)
+    end
+end
+
+def fun_l25_n908(x)
+    if (x < 1)
+        fun_l26_n424(x)
+    else
+        fun_l26_n243(x)
+    end
+end
+
+def fun_l25_n909(x)
+    if (x < 1)
+        fun_l26_n897(x)
+    else
+        fun_l26_n736(x)
+    end
+end
+
+def fun_l25_n910(x)
+    if (x < 1)
+        fun_l26_n573(x)
+    else
+        fun_l26_n205(x)
+    end
+end
+
+def fun_l25_n911(x)
+    if (x < 1)
+        fun_l26_n535(x)
+    else
+        fun_l26_n970(x)
+    end
+end
+
+def fun_l25_n912(x)
+    if (x < 1)
+        fun_l26_n826(x)
+    else
+        fun_l26_n744(x)
+    end
+end
+
+def fun_l25_n913(x)
+    if (x < 1)
+        fun_l26_n244(x)
+    else
+        fun_l26_n216(x)
+    end
+end
+
+def fun_l25_n914(x)
+    if (x < 1)
+        fun_l26_n958(x)
+    else
+        fun_l26_n617(x)
+    end
+end
+
+def fun_l25_n915(x)
+    if (x < 1)
+        fun_l26_n911(x)
+    else
+        fun_l26_n684(x)
+    end
+end
+
+def fun_l25_n916(x)
+    if (x < 1)
+        fun_l26_n294(x)
+    else
+        fun_l26_n319(x)
+    end
+end
+
+def fun_l25_n917(x)
+    if (x < 1)
+        fun_l26_n665(x)
+    else
+        fun_l26_n867(x)
+    end
+end
+
+def fun_l25_n918(x)
+    if (x < 1)
+        fun_l26_n733(x)
+    else
+        fun_l26_n746(x)
+    end
+end
+
+def fun_l25_n919(x)
+    if (x < 1)
+        fun_l26_n243(x)
+    else
+        fun_l26_n328(x)
+    end
+end
+
+def fun_l25_n920(x)
+    if (x < 1)
+        fun_l26_n897(x)
+    else
+        fun_l26_n197(x)
+    end
+end
+
+def fun_l25_n921(x)
+    if (x < 1)
+        fun_l26_n528(x)
+    else
+        fun_l26_n229(x)
+    end
+end
+
+def fun_l25_n922(x)
+    if (x < 1)
+        fun_l26_n897(x)
+    else
+        fun_l26_n547(x)
+    end
+end
+
+def fun_l25_n923(x)
+    if (x < 1)
+        fun_l26_n234(x)
+    else
+        fun_l26_n920(x)
+    end
+end
+
+def fun_l25_n924(x)
+    if (x < 1)
+        fun_l26_n827(x)
+    else
+        fun_l26_n257(x)
+    end
+end
+
+def fun_l25_n925(x)
+    if (x < 1)
+        fun_l26_n847(x)
+    else
+        fun_l26_n469(x)
+    end
+end
+
+def fun_l25_n926(x)
+    if (x < 1)
+        fun_l26_n27(x)
+    else
+        fun_l26_n974(x)
+    end
+end
+
+def fun_l25_n927(x)
+    if (x < 1)
+        fun_l26_n872(x)
+    else
+        fun_l26_n535(x)
+    end
+end
+
+def fun_l25_n928(x)
+    if (x < 1)
+        fun_l26_n870(x)
+    else
+        fun_l26_n783(x)
+    end
+end
+
+def fun_l25_n929(x)
+    if (x < 1)
+        fun_l26_n993(x)
+    else
+        fun_l26_n168(x)
+    end
+end
+
+def fun_l25_n930(x)
+    if (x < 1)
+        fun_l26_n852(x)
+    else
+        fun_l26_n41(x)
+    end
+end
+
+def fun_l25_n931(x)
+    if (x < 1)
+        fun_l26_n290(x)
+    else
+        fun_l26_n249(x)
+    end
+end
+
+def fun_l25_n932(x)
+    if (x < 1)
+        fun_l26_n446(x)
+    else
+        fun_l26_n841(x)
+    end
+end
+
+def fun_l25_n933(x)
+    if (x < 1)
+        fun_l26_n303(x)
+    else
+        fun_l26_n779(x)
+    end
+end
+
+def fun_l25_n934(x)
+    if (x < 1)
+        fun_l26_n352(x)
+    else
+        fun_l26_n731(x)
+    end
+end
+
+def fun_l25_n935(x)
+    if (x < 1)
+        fun_l26_n377(x)
+    else
+        fun_l26_n214(x)
+    end
+end
+
+def fun_l25_n936(x)
+    if (x < 1)
+        fun_l26_n374(x)
+    else
+        fun_l26_n793(x)
+    end
+end
+
+def fun_l25_n937(x)
+    if (x < 1)
+        fun_l26_n656(x)
+    else
+        fun_l26_n575(x)
+    end
+end
+
+def fun_l25_n938(x)
+    if (x < 1)
+        fun_l26_n777(x)
+    else
+        fun_l26_n773(x)
+    end
+end
+
+def fun_l25_n939(x)
+    if (x < 1)
+        fun_l26_n5(x)
+    else
+        fun_l26_n206(x)
+    end
+end
+
+def fun_l25_n940(x)
+    if (x < 1)
+        fun_l26_n780(x)
+    else
+        fun_l26_n486(x)
+    end
+end
+
+def fun_l25_n941(x)
+    if (x < 1)
+        fun_l26_n634(x)
+    else
+        fun_l26_n727(x)
+    end
+end
+
+def fun_l25_n942(x)
+    if (x < 1)
+        fun_l26_n78(x)
+    else
+        fun_l26_n918(x)
+    end
+end
+
+def fun_l25_n943(x)
+    if (x < 1)
+        fun_l26_n616(x)
+    else
+        fun_l26_n35(x)
+    end
+end
+
+def fun_l25_n944(x)
+    if (x < 1)
+        fun_l26_n540(x)
+    else
+        fun_l26_n837(x)
+    end
+end
+
+def fun_l25_n945(x)
+    if (x < 1)
+        fun_l26_n365(x)
+    else
+        fun_l26_n561(x)
+    end
+end
+
+def fun_l25_n946(x)
+    if (x < 1)
+        fun_l26_n519(x)
+    else
+        fun_l26_n440(x)
+    end
+end
+
+def fun_l25_n947(x)
+    if (x < 1)
+        fun_l26_n144(x)
+    else
+        fun_l26_n426(x)
+    end
+end
+
+def fun_l25_n948(x)
+    if (x < 1)
+        fun_l26_n973(x)
+    else
+        fun_l26_n63(x)
+    end
+end
+
+def fun_l25_n949(x)
+    if (x < 1)
+        fun_l26_n258(x)
+    else
+        fun_l26_n690(x)
+    end
+end
+
+def fun_l25_n950(x)
+    if (x < 1)
+        fun_l26_n368(x)
+    else
+        fun_l26_n307(x)
+    end
+end
+
+def fun_l25_n951(x)
+    if (x < 1)
+        fun_l26_n133(x)
+    else
+        fun_l26_n774(x)
+    end
+end
+
+def fun_l25_n952(x)
+    if (x < 1)
+        fun_l26_n866(x)
+    else
+        fun_l26_n299(x)
+    end
+end
+
+def fun_l25_n953(x)
+    if (x < 1)
+        fun_l26_n72(x)
+    else
+        fun_l26_n421(x)
+    end
+end
+
+def fun_l25_n954(x)
+    if (x < 1)
+        fun_l26_n990(x)
+    else
+        fun_l26_n716(x)
+    end
+end
+
+def fun_l25_n955(x)
+    if (x < 1)
+        fun_l26_n138(x)
+    else
+        fun_l26_n387(x)
+    end
+end
+
+def fun_l25_n956(x)
+    if (x < 1)
+        fun_l26_n451(x)
+    else
+        fun_l26_n965(x)
+    end
+end
+
+def fun_l25_n957(x)
+    if (x < 1)
+        fun_l26_n292(x)
+    else
+        fun_l26_n741(x)
+    end
+end
+
+def fun_l25_n958(x)
+    if (x < 1)
+        fun_l26_n835(x)
+    else
+        fun_l26_n82(x)
+    end
+end
+
+def fun_l25_n959(x)
+    if (x < 1)
+        fun_l26_n73(x)
+    else
+        fun_l26_n987(x)
+    end
+end
+
+def fun_l25_n960(x)
+    if (x < 1)
+        fun_l26_n465(x)
+    else
+        fun_l26_n893(x)
+    end
+end
+
+def fun_l25_n961(x)
+    if (x < 1)
+        fun_l26_n277(x)
+    else
+        fun_l26_n846(x)
+    end
+end
+
+def fun_l25_n962(x)
+    if (x < 1)
+        fun_l26_n1(x)
+    else
+        fun_l26_n408(x)
+    end
+end
+
+def fun_l25_n963(x)
+    if (x < 1)
+        fun_l26_n139(x)
+    else
+        fun_l26_n43(x)
+    end
+end
+
+def fun_l25_n964(x)
+    if (x < 1)
+        fun_l26_n238(x)
+    else
+        fun_l26_n427(x)
+    end
+end
+
+def fun_l25_n965(x)
+    if (x < 1)
+        fun_l26_n150(x)
+    else
+        fun_l26_n60(x)
+    end
+end
+
+def fun_l25_n966(x)
+    if (x < 1)
+        fun_l26_n423(x)
+    else
+        fun_l26_n166(x)
+    end
+end
+
+def fun_l25_n967(x)
+    if (x < 1)
+        fun_l26_n102(x)
+    else
+        fun_l26_n679(x)
+    end
+end
+
+def fun_l25_n968(x)
+    if (x < 1)
+        fun_l26_n41(x)
+    else
+        fun_l26_n553(x)
+    end
+end
+
+def fun_l25_n969(x)
+    if (x < 1)
+        fun_l26_n577(x)
+    else
+        fun_l26_n589(x)
+    end
+end
+
+def fun_l25_n970(x)
+    if (x < 1)
+        fun_l26_n569(x)
+    else
+        fun_l26_n677(x)
+    end
+end
+
+def fun_l25_n971(x)
+    if (x < 1)
+        fun_l26_n845(x)
+    else
+        fun_l26_n237(x)
+    end
+end
+
+def fun_l25_n972(x)
+    if (x < 1)
+        fun_l26_n33(x)
+    else
+        fun_l26_n281(x)
+    end
+end
+
+def fun_l25_n973(x)
+    if (x < 1)
+        fun_l26_n432(x)
+    else
+        fun_l26_n800(x)
+    end
+end
+
+def fun_l25_n974(x)
+    if (x < 1)
+        fun_l26_n49(x)
+    else
+        fun_l26_n864(x)
+    end
+end
+
+def fun_l25_n975(x)
+    if (x < 1)
+        fun_l26_n379(x)
+    else
+        fun_l26_n704(x)
+    end
+end
+
+def fun_l25_n976(x)
+    if (x < 1)
+        fun_l26_n778(x)
+    else
+        fun_l26_n310(x)
+    end
+end
+
+def fun_l25_n977(x)
+    if (x < 1)
+        fun_l26_n137(x)
+    else
+        fun_l26_n261(x)
+    end
+end
+
+def fun_l25_n978(x)
+    if (x < 1)
+        fun_l26_n38(x)
+    else
+        fun_l26_n244(x)
+    end
+end
+
+def fun_l25_n979(x)
+    if (x < 1)
+        fun_l26_n665(x)
+    else
+        fun_l26_n883(x)
+    end
+end
+
+def fun_l25_n980(x)
+    if (x < 1)
+        fun_l26_n448(x)
+    else
+        fun_l26_n619(x)
+    end
+end
+
+def fun_l25_n981(x)
+    if (x < 1)
+        fun_l26_n652(x)
+    else
+        fun_l26_n804(x)
+    end
+end
+
+def fun_l25_n982(x)
+    if (x < 1)
+        fun_l26_n804(x)
+    else
+        fun_l26_n110(x)
+    end
+end
+
+def fun_l25_n983(x)
+    if (x < 1)
+        fun_l26_n151(x)
+    else
+        fun_l26_n588(x)
+    end
+end
+
+def fun_l25_n984(x)
+    if (x < 1)
+        fun_l26_n379(x)
+    else
+        fun_l26_n156(x)
+    end
+end
+
+def fun_l25_n985(x)
+    if (x < 1)
+        fun_l26_n936(x)
+    else
+        fun_l26_n31(x)
+    end
+end
+
+def fun_l25_n986(x)
+    if (x < 1)
+        fun_l26_n65(x)
+    else
+        fun_l26_n303(x)
+    end
+end
+
+def fun_l25_n987(x)
+    if (x < 1)
+        fun_l26_n273(x)
+    else
+        fun_l26_n4(x)
+    end
+end
+
+def fun_l25_n988(x)
+    if (x < 1)
+        fun_l26_n538(x)
+    else
+        fun_l26_n357(x)
+    end
+end
+
+def fun_l25_n989(x)
+    if (x < 1)
+        fun_l26_n922(x)
+    else
+        fun_l26_n457(x)
+    end
+end
+
+def fun_l25_n990(x)
+    if (x < 1)
+        fun_l26_n250(x)
+    else
+        fun_l26_n945(x)
+    end
+end
+
+def fun_l25_n991(x)
+    if (x < 1)
+        fun_l26_n878(x)
+    else
+        fun_l26_n992(x)
+    end
+end
+
+def fun_l25_n992(x)
+    if (x < 1)
+        fun_l26_n767(x)
+    else
+        fun_l26_n132(x)
+    end
+end
+
+def fun_l25_n993(x)
+    if (x < 1)
+        fun_l26_n737(x)
+    else
+        fun_l26_n323(x)
+    end
+end
+
+def fun_l25_n994(x)
+    if (x < 1)
+        fun_l26_n173(x)
+    else
+        fun_l26_n424(x)
+    end
+end
+
+def fun_l25_n995(x)
+    if (x < 1)
+        fun_l26_n860(x)
+    else
+        fun_l26_n390(x)
+    end
+end
+
+def fun_l25_n996(x)
+    if (x < 1)
+        fun_l26_n794(x)
+    else
+        fun_l26_n613(x)
+    end
+end
+
+def fun_l25_n997(x)
+    if (x < 1)
+        fun_l26_n807(x)
+    else
+        fun_l26_n277(x)
+    end
+end
+
+def fun_l25_n998(x)
+    if (x < 1)
+        fun_l26_n418(x)
+    else
+        fun_l26_n830(x)
+    end
+end
+
+def fun_l25_n999(x)
+    if (x < 1)
+        fun_l26_n212(x)
+    else
+        fun_l26_n863(x)
+    end
+end
+
+def fun_l26_n0(x)
+    if (x < 1)
+        fun_l27_n276(x)
+    else
+        fun_l27_n243(x)
+    end
+end
+
+def fun_l26_n1(x)
+    if (x < 1)
+        fun_l27_n136(x)
+    else
+        fun_l27_n625(x)
+    end
+end
+
+def fun_l26_n2(x)
+    if (x < 1)
+        fun_l27_n205(x)
+    else
+        fun_l27_n576(x)
+    end
+end
+
+def fun_l26_n3(x)
+    if (x < 1)
+        fun_l27_n97(x)
+    else
+        fun_l27_n753(x)
+    end
+end
+
+def fun_l26_n4(x)
+    if (x < 1)
+        fun_l27_n984(x)
+    else
+        fun_l27_n827(x)
+    end
+end
+
+def fun_l26_n5(x)
+    if (x < 1)
+        fun_l27_n428(x)
+    else
+        fun_l27_n559(x)
+    end
+end
+
+def fun_l26_n6(x)
+    if (x < 1)
+        fun_l27_n148(x)
+    else
+        fun_l27_n351(x)
+    end
+end
+
+def fun_l26_n7(x)
+    if (x < 1)
+        fun_l27_n90(x)
+    else
+        fun_l27_n241(x)
+    end
+end
+
+def fun_l26_n8(x)
+    if (x < 1)
+        fun_l27_n860(x)
+    else
+        fun_l27_n495(x)
+    end
+end
+
+def fun_l26_n9(x)
+    if (x < 1)
+        fun_l27_n245(x)
+    else
+        fun_l27_n429(x)
+    end
+end
+
+def fun_l26_n10(x)
+    if (x < 1)
+        fun_l27_n999(x)
+    else
+        fun_l27_n536(x)
+    end
+end
+
+def fun_l26_n11(x)
+    if (x < 1)
+        fun_l27_n777(x)
+    else
+        fun_l27_n823(x)
+    end
+end
+
+def fun_l26_n12(x)
+    if (x < 1)
+        fun_l27_n158(x)
+    else
+        fun_l27_n249(x)
+    end
+end
+
+def fun_l26_n13(x)
+    if (x < 1)
+        fun_l27_n781(x)
+    else
+        fun_l27_n710(x)
+    end
+end
+
+def fun_l26_n14(x)
+    if (x < 1)
+        fun_l27_n784(x)
+    else
+        fun_l27_n728(x)
+    end
+end
+
+def fun_l26_n15(x)
+    if (x < 1)
+        fun_l27_n225(x)
+    else
+        fun_l27_n216(x)
+    end
+end
+
+def fun_l26_n16(x)
+    if (x < 1)
+        fun_l27_n228(x)
+    else
+        fun_l27_n219(x)
+    end
+end
+
+def fun_l26_n17(x)
+    if (x < 1)
+        fun_l27_n849(x)
+    else
+        fun_l27_n348(x)
+    end
+end
+
+def fun_l26_n18(x)
+    if (x < 1)
+        fun_l27_n722(x)
+    else
+        fun_l27_n884(x)
+    end
+end
+
+def fun_l26_n19(x)
+    if (x < 1)
+        fun_l27_n756(x)
+    else
+        fun_l27_n715(x)
+    end
+end
+
+def fun_l26_n20(x)
+    if (x < 1)
+        fun_l27_n217(x)
+    else
+        fun_l27_n909(x)
+    end
+end
+
+def fun_l26_n21(x)
+    if (x < 1)
+        fun_l27_n239(x)
+    else
+        fun_l27_n370(x)
+    end
+end
+
+def fun_l26_n22(x)
+    if (x < 1)
+        fun_l27_n954(x)
+    else
+        fun_l27_n223(x)
+    end
+end
+
+def fun_l26_n23(x)
+    if (x < 1)
+        fun_l27_n781(x)
+    else
+        fun_l27_n845(x)
+    end
+end
+
+def fun_l26_n24(x)
+    if (x < 1)
+        fun_l27_n80(x)
+    else
+        fun_l27_n71(x)
+    end
+end
+
+def fun_l26_n25(x)
+    if (x < 1)
+        fun_l27_n850(x)
+    else
+        fun_l27_n715(x)
+    end
+end
+
+def fun_l26_n26(x)
+    if (x < 1)
+        fun_l27_n632(x)
+    else
+        fun_l27_n624(x)
+    end
+end
+
+def fun_l26_n27(x)
+    if (x < 1)
+        fun_l27_n342(x)
+    else
+        fun_l27_n999(x)
+    end
+end
+
+def fun_l26_n28(x)
+    if (x < 1)
+        fun_l27_n105(x)
+    else
+        fun_l27_n390(x)
+    end
+end
+
+def fun_l26_n29(x)
+    if (x < 1)
+        fun_l27_n972(x)
+    else
+        fun_l27_n451(x)
+    end
+end
+
+def fun_l26_n30(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n392(x)
+    end
+end
+
+def fun_l26_n31(x)
+    if (x < 1)
+        fun_l27_n892(x)
+    else
+        fun_l27_n874(x)
+    end
+end
+
+def fun_l26_n32(x)
+    if (x < 1)
+        fun_l27_n783(x)
+    else
+        fun_l27_n456(x)
+    end
+end
+
+def fun_l26_n33(x)
+    if (x < 1)
+        fun_l27_n491(x)
+    else
+        fun_l27_n479(x)
+    end
+end
+
+def fun_l26_n34(x)
+    if (x < 1)
+        fun_l27_n799(x)
+    else
+        fun_l27_n438(x)
+    end
+end
+
+def fun_l26_n35(x)
+    if (x < 1)
+        fun_l27_n335(x)
+    else
+        fun_l27_n263(x)
+    end
+end
+
+def fun_l26_n36(x)
+    if (x < 1)
+        fun_l27_n935(x)
+    else
+        fun_l27_n715(x)
+    end
+end
+
+def fun_l26_n37(x)
+    if (x < 1)
+        fun_l27_n2(x)
+    else
+        fun_l27_n13(x)
+    end
+end
+
+def fun_l26_n38(x)
+    if (x < 1)
+        fun_l27_n567(x)
+    else
+        fun_l27_n878(x)
+    end
+end
+
+def fun_l26_n39(x)
+    if (x < 1)
+        fun_l27_n144(x)
+    else
+        fun_l27_n349(x)
+    end
+end
+
+def fun_l26_n40(x)
+    if (x < 1)
+        fun_l27_n957(x)
+    else
+        fun_l27_n990(x)
+    end
+end
+
+def fun_l26_n41(x)
+    if (x < 1)
+        fun_l27_n501(x)
+    else
+        fun_l27_n752(x)
+    end
+end
+
+def fun_l26_n42(x)
+    if (x < 1)
+        fun_l27_n23(x)
+    else
+        fun_l27_n200(x)
+    end
+end
+
+def fun_l26_n43(x)
+    if (x < 1)
+        fun_l27_n61(x)
+    else
+        fun_l27_n306(x)
+    end
+end
+
+def fun_l26_n44(x)
+    if (x < 1)
+        fun_l27_n336(x)
+    else
+        fun_l27_n468(x)
+    end
+end
+
+def fun_l26_n45(x)
+    if (x < 1)
+        fun_l27_n350(x)
+    else
+        fun_l27_n359(x)
+    end
+end
+
+def fun_l26_n46(x)
+    if (x < 1)
+        fun_l27_n574(x)
+    else
+        fun_l27_n791(x)
+    end
+end
+
+def fun_l26_n47(x)
+    if (x < 1)
+        fun_l27_n859(x)
+    else
+        fun_l27_n524(x)
+    end
+end
+
+def fun_l26_n48(x)
+    if (x < 1)
+        fun_l27_n530(x)
+    else
+        fun_l27_n387(x)
+    end
+end
+
+def fun_l26_n49(x)
+    if (x < 1)
+        fun_l27_n174(x)
+    else
+        fun_l27_n673(x)
+    end
+end
+
+def fun_l26_n50(x)
+    if (x < 1)
+        fun_l27_n457(x)
+    else
+        fun_l27_n996(x)
+    end
+end
+
+def fun_l26_n51(x)
+    if (x < 1)
+        fun_l27_n757(x)
+    else
+        fun_l27_n84(x)
+    end
+end
+
+def fun_l26_n52(x)
+    if (x < 1)
+        fun_l27_n315(x)
+    else
+        fun_l27_n790(x)
+    end
+end
+
+def fun_l26_n53(x)
+    if (x < 1)
+        fun_l27_n452(x)
+    else
+        fun_l27_n201(x)
+    end
+end
+
+def fun_l26_n54(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n143(x)
+    end
+end
+
+def fun_l26_n55(x)
+    if (x < 1)
+        fun_l27_n476(x)
+    else
+        fun_l27_n149(x)
+    end
+end
+
+def fun_l26_n56(x)
+    if (x < 1)
+        fun_l27_n737(x)
+    else
+        fun_l27_n628(x)
+    end
+end
+
+def fun_l26_n57(x)
+    if (x < 1)
+        fun_l27_n780(x)
+    else
+        fun_l27_n906(x)
+    end
+end
+
+def fun_l26_n58(x)
+    if (x < 1)
+        fun_l27_n914(x)
+    else
+        fun_l27_n197(x)
+    end
+end
+
+def fun_l26_n59(x)
+    if (x < 1)
+        fun_l27_n816(x)
+    else
+        fun_l27_n16(x)
+    end
+end
+
+def fun_l26_n60(x)
+    if (x < 1)
+        fun_l27_n643(x)
+    else
+        fun_l27_n90(x)
+    end
+end
+
+def fun_l26_n61(x)
+    if (x < 1)
+        fun_l27_n514(x)
+    else
+        fun_l27_n156(x)
+    end
+end
+
+def fun_l26_n62(x)
+    if (x < 1)
+        fun_l27_n261(x)
+    else
+        fun_l27_n410(x)
+    end
+end
+
+def fun_l26_n63(x)
+    if (x < 1)
+        fun_l27_n82(x)
+    else
+        fun_l27_n817(x)
+    end
+end
+
+def fun_l26_n64(x)
+    if (x < 1)
+        fun_l27_n755(x)
+    else
+        fun_l27_n438(x)
+    end
+end
+
+def fun_l26_n65(x)
+    if (x < 1)
+        fun_l27_n960(x)
+    else
+        fun_l27_n600(x)
+    end
+end
+
+def fun_l26_n66(x)
+    if (x < 1)
+        fun_l27_n100(x)
+    else
+        fun_l27_n699(x)
+    end
+end
+
+def fun_l26_n67(x)
+    if (x < 1)
+        fun_l27_n367(x)
+    else
+        fun_l27_n783(x)
+    end
+end
+
+def fun_l26_n68(x)
+    if (x < 1)
+        fun_l27_n691(x)
+    else
+        fun_l27_n996(x)
+    end
+end
+
+def fun_l26_n69(x)
+    if (x < 1)
+        fun_l27_n989(x)
+    else
+        fun_l27_n628(x)
+    end
+end
+
+def fun_l26_n70(x)
+    if (x < 1)
+        fun_l27_n139(x)
+    else
+        fun_l27_n4(x)
+    end
+end
+
+def fun_l26_n71(x)
+    if (x < 1)
+        fun_l27_n890(x)
+    else
+        fun_l27_n88(x)
+    end
+end
+
+def fun_l26_n72(x)
+    if (x < 1)
+        fun_l27_n35(x)
+    else
+        fun_l27_n991(x)
+    end
+end
+
+def fun_l26_n73(x)
+    if (x < 1)
+        fun_l27_n613(x)
+    else
+        fun_l27_n836(x)
+    end
+end
+
+def fun_l26_n74(x)
+    if (x < 1)
+        fun_l27_n739(x)
+    else
+        fun_l27_n455(x)
+    end
+end
+
+def fun_l26_n75(x)
+    if (x < 1)
+        fun_l27_n382(x)
+    else
+        fun_l27_n909(x)
+    end
+end
+
+def fun_l26_n76(x)
+    if (x < 1)
+        fun_l27_n480(x)
+    else
+        fun_l27_n178(x)
+    end
+end
+
+def fun_l26_n77(x)
+    if (x < 1)
+        fun_l27_n180(x)
+    else
+        fun_l27_n577(x)
+    end
+end
+
+def fun_l26_n78(x)
+    if (x < 1)
+        fun_l27_n910(x)
+    else
+        fun_l27_n659(x)
+    end
+end
+
+def fun_l26_n79(x)
+    if (x < 1)
+        fun_l27_n710(x)
+    else
+        fun_l27_n159(x)
+    end
+end
+
+def fun_l26_n80(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n367(x)
+    end
+end
+
+def fun_l26_n81(x)
+    if (x < 1)
+        fun_l27_n935(x)
+    else
+        fun_l27_n389(x)
+    end
+end
+
+def fun_l26_n82(x)
+    if (x < 1)
+        fun_l27_n782(x)
+    else
+        fun_l27_n333(x)
+    end
+end
+
+def fun_l26_n83(x)
+    if (x < 1)
+        fun_l27_n85(x)
+    else
+        fun_l27_n122(x)
+    end
+end
+
+def fun_l26_n84(x)
+    if (x < 1)
+        fun_l27_n722(x)
+    else
+        fun_l27_n937(x)
+    end
+end
+
+def fun_l26_n85(x)
+    if (x < 1)
+        fun_l27_n403(x)
+    else
+        fun_l27_n270(x)
+    end
+end
+
+def fun_l26_n86(x)
+    if (x < 1)
+        fun_l27_n987(x)
+    else
+        fun_l27_n622(x)
+    end
+end
+
+def fun_l26_n87(x)
+    if (x < 1)
+        fun_l27_n316(x)
+    else
+        fun_l27_n519(x)
+    end
+end
+
+def fun_l26_n88(x)
+    if (x < 1)
+        fun_l27_n503(x)
+    else
+        fun_l27_n320(x)
+    end
+end
+
+def fun_l26_n89(x)
+    if (x < 1)
+        fun_l27_n936(x)
+    else
+        fun_l27_n77(x)
+    end
+end
+
+def fun_l26_n90(x)
+    if (x < 1)
+        fun_l27_n875(x)
+    else
+        fun_l27_n857(x)
+    end
+end
+
+def fun_l26_n91(x)
+    if (x < 1)
+        fun_l27_n277(x)
+    else
+        fun_l27_n231(x)
+    end
+end
+
+def fun_l26_n92(x)
+    if (x < 1)
+        fun_l27_n743(x)
+    else
+        fun_l27_n468(x)
+    end
+end
+
+def fun_l26_n93(x)
+    if (x < 1)
+        fun_l27_n997(x)
+    else
+        fun_l27_n49(x)
+    end
+end
+
+def fun_l26_n94(x)
+    if (x < 1)
+        fun_l27_n410(x)
+    else
+        fun_l27_n123(x)
+    end
+end
+
+def fun_l26_n95(x)
+    if (x < 1)
+        fun_l27_n696(x)
+    else
+        fun_l27_n799(x)
+    end
+end
+
+def fun_l26_n96(x)
+    if (x < 1)
+        fun_l27_n47(x)
+    else
+        fun_l27_n195(x)
+    end
+end
+
+def fun_l26_n97(x)
+    if (x < 1)
+        fun_l27_n559(x)
+    else
+        fun_l27_n242(x)
+    end
+end
+
+def fun_l26_n98(x)
+    if (x < 1)
+        fun_l27_n407(x)
+    else
+        fun_l27_n797(x)
+    end
+end
+
+def fun_l26_n99(x)
+    if (x < 1)
+        fun_l27_n886(x)
+    else
+        fun_l27_n253(x)
+    end
+end
+
+def fun_l26_n100(x)
+    if (x < 1)
+        fun_l27_n753(x)
+    else
+        fun_l27_n103(x)
+    end
+end
+
+def fun_l26_n101(x)
+    if (x < 1)
+        fun_l27_n717(x)
+    else
+        fun_l27_n596(x)
+    end
+end
+
+def fun_l26_n102(x)
+    if (x < 1)
+        fun_l27_n88(x)
+    else
+        fun_l27_n916(x)
+    end
+end
+
+def fun_l26_n103(x)
+    if (x < 1)
+        fun_l27_n504(x)
+    else
+        fun_l27_n91(x)
+    end
+end
+
+def fun_l26_n104(x)
+    if (x < 1)
+        fun_l27_n418(x)
+    else
+        fun_l27_n810(x)
+    end
+end
+
+def fun_l26_n105(x)
+    if (x < 1)
+        fun_l27_n736(x)
+    else
+        fun_l27_n515(x)
+    end
+end
+
+def fun_l26_n106(x)
+    if (x < 1)
+        fun_l27_n450(x)
+    else
+        fun_l27_n778(x)
+    end
+end
+
+def fun_l26_n107(x)
+    if (x < 1)
+        fun_l27_n670(x)
+    else
+        fun_l27_n483(x)
+    end
+end
+
+def fun_l26_n108(x)
+    if (x < 1)
+        fun_l27_n592(x)
+    else
+        fun_l27_n638(x)
+    end
+end
+
+def fun_l26_n109(x)
+    if (x < 1)
+        fun_l27_n803(x)
+    else
+        fun_l27_n865(x)
+    end
+end
+
+def fun_l26_n110(x)
+    if (x < 1)
+        fun_l27_n555(x)
+    else
+        fun_l27_n123(x)
+    end
+end
+
+def fun_l26_n111(x)
+    if (x < 1)
+        fun_l27_n5(x)
+    else
+        fun_l27_n768(x)
+    end
+end
+
+def fun_l26_n112(x)
+    if (x < 1)
+        fun_l27_n452(x)
+    else
+        fun_l27_n356(x)
+    end
+end
+
+def fun_l26_n113(x)
+    if (x < 1)
+        fun_l27_n353(x)
+    else
+        fun_l27_n513(x)
+    end
+end
+
+def fun_l26_n114(x)
+    if (x < 1)
+        fun_l27_n859(x)
+    else
+        fun_l27_n851(x)
+    end
+end
+
+def fun_l26_n115(x)
+    if (x < 1)
+        fun_l27_n47(x)
+    else
+        fun_l27_n206(x)
+    end
+end
+
+def fun_l26_n116(x)
+    if (x < 1)
+        fun_l27_n260(x)
+    else
+        fun_l27_n746(x)
+    end
+end
+
+def fun_l26_n117(x)
+    if (x < 1)
+        fun_l27_n733(x)
+    else
+        fun_l27_n906(x)
+    end
+end
+
+def fun_l26_n118(x)
+    if (x < 1)
+        fun_l27_n40(x)
+    else
+        fun_l27_n467(x)
+    end
+end
+
+def fun_l26_n119(x)
+    if (x < 1)
+        fun_l27_n764(x)
+    else
+        fun_l27_n69(x)
+    end
+end
+
+def fun_l26_n120(x)
+    if (x < 1)
+        fun_l27_n851(x)
+    else
+        fun_l27_n905(x)
+    end
+end
+
+def fun_l26_n121(x)
+    if (x < 1)
+        fun_l27_n793(x)
+    else
+        fun_l27_n169(x)
+    end
+end
+
+def fun_l26_n122(x)
+    if (x < 1)
+        fun_l27_n126(x)
+    else
+        fun_l27_n440(x)
+    end
+end
+
+def fun_l26_n123(x)
+    if (x < 1)
+        fun_l27_n147(x)
+    else
+        fun_l27_n720(x)
+    end
+end
+
+def fun_l26_n124(x)
+    if (x < 1)
+        fun_l27_n843(x)
+    else
+        fun_l27_n789(x)
+    end
+end
+
+def fun_l26_n125(x)
+    if (x < 1)
+        fun_l27_n927(x)
+    else
+        fun_l27_n364(x)
+    end
+end
+
+def fun_l26_n126(x)
+    if (x < 1)
+        fun_l27_n203(x)
+    else
+        fun_l27_n344(x)
+    end
+end
+
+def fun_l26_n127(x)
+    if (x < 1)
+        fun_l27_n398(x)
+    else
+        fun_l27_n202(x)
+    end
+end
+
+def fun_l26_n128(x)
+    if (x < 1)
+        fun_l27_n216(x)
+    else
+        fun_l27_n344(x)
+    end
+end
+
+def fun_l26_n129(x)
+    if (x < 1)
+        fun_l27_n496(x)
+    else
+        fun_l27_n40(x)
+    end
+end
+
+def fun_l26_n130(x)
+    if (x < 1)
+        fun_l27_n615(x)
+    else
+        fun_l27_n762(x)
+    end
+end
+
+def fun_l26_n131(x)
+    if (x < 1)
+        fun_l27_n642(x)
+    else
+        fun_l27_n329(x)
+    end
+end
+
+def fun_l26_n132(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n436(x)
+    end
+end
+
+def fun_l26_n133(x)
+    if (x < 1)
+        fun_l27_n502(x)
+    else
+        fun_l27_n176(x)
+    end
+end
+
+def fun_l26_n134(x)
+    if (x < 1)
+        fun_l27_n591(x)
+    else
+        fun_l27_n119(x)
+    end
+end
+
+def fun_l26_n135(x)
+    if (x < 1)
+        fun_l27_n946(x)
+    else
+        fun_l27_n963(x)
+    end
+end
+
+def fun_l26_n136(x)
+    if (x < 1)
+        fun_l27_n688(x)
+    else
+        fun_l27_n44(x)
+    end
+end
+
+def fun_l26_n137(x)
+    if (x < 1)
+        fun_l27_n786(x)
+    else
+        fun_l27_n965(x)
+    end
+end
+
+def fun_l26_n138(x)
+    if (x < 1)
+        fun_l27_n259(x)
+    else
+        fun_l27_n63(x)
+    end
+end
+
+def fun_l26_n139(x)
+    if (x < 1)
+        fun_l27_n568(x)
+    else
+        fun_l27_n129(x)
+    end
+end
+
+def fun_l26_n140(x)
+    if (x < 1)
+        fun_l27_n255(x)
+    else
+        fun_l27_n873(x)
+    end
+end
+
+def fun_l26_n141(x)
+    if (x < 1)
+        fun_l27_n777(x)
+    else
+        fun_l27_n86(x)
+    end
+end
+
+def fun_l26_n142(x)
+    if (x < 1)
+        fun_l27_n134(x)
+    else
+        fun_l27_n569(x)
+    end
+end
+
+def fun_l26_n143(x)
+    if (x < 1)
+        fun_l27_n147(x)
+    else
+        fun_l27_n388(x)
+    end
+end
+
+def fun_l26_n144(x)
+    if (x < 1)
+        fun_l27_n633(x)
+    else
+        fun_l27_n256(x)
+    end
+end
+
+def fun_l26_n145(x)
+    if (x < 1)
+        fun_l27_n38(x)
+    else
+        fun_l27_n94(x)
+    end
+end
+
+def fun_l26_n146(x)
+    if (x < 1)
+        fun_l27_n710(x)
+    else
+        fun_l27_n489(x)
+    end
+end
+
+def fun_l26_n147(x)
+    if (x < 1)
+        fun_l27_n187(x)
+    else
+        fun_l27_n252(x)
+    end
+end
+
+def fun_l26_n148(x)
+    if (x < 1)
+        fun_l27_n978(x)
+    else
+        fun_l27_n835(x)
+    end
+end
+
+def fun_l26_n149(x)
+    if (x < 1)
+        fun_l27_n759(x)
+    else
+        fun_l27_n742(x)
+    end
+end
+
+def fun_l26_n150(x)
+    if (x < 1)
+        fun_l27_n438(x)
+    else
+        fun_l27_n808(x)
+    end
+end
+
+def fun_l26_n151(x)
+    if (x < 1)
+        fun_l27_n424(x)
+    else
+        fun_l27_n54(x)
+    end
+end
+
+def fun_l26_n152(x)
+    if (x < 1)
+        fun_l27_n455(x)
+    else
+        fun_l27_n953(x)
+    end
+end
+
+def fun_l26_n153(x)
+    if (x < 1)
+        fun_l27_n13(x)
+    else
+        fun_l27_n330(x)
+    end
+end
+
+def fun_l26_n154(x)
+    if (x < 1)
+        fun_l27_n399(x)
+    else
+        fun_l27_n81(x)
+    end
+end
+
+def fun_l26_n155(x)
+    if (x < 1)
+        fun_l27_n356(x)
+    else
+        fun_l27_n237(x)
+    end
+end
+
+def fun_l26_n156(x)
+    if (x < 1)
+        fun_l27_n636(x)
+    else
+        fun_l27_n446(x)
+    end
+end
+
+def fun_l26_n157(x)
+    if (x < 1)
+        fun_l27_n715(x)
+    else
+        fun_l27_n800(x)
+    end
+end
+
+def fun_l26_n158(x)
+    if (x < 1)
+        fun_l27_n284(x)
+    else
+        fun_l27_n280(x)
+    end
+end
+
+def fun_l26_n159(x)
+    if (x < 1)
+        fun_l27_n41(x)
+    else
+        fun_l27_n65(x)
+    end
+end
+
+def fun_l26_n160(x)
+    if (x < 1)
+        fun_l27_n691(x)
+    else
+        fun_l27_n76(x)
+    end
+end
+
+def fun_l26_n161(x)
+    if (x < 1)
+        fun_l27_n863(x)
+    else
+        fun_l27_n878(x)
+    end
+end
+
+def fun_l26_n162(x)
+    if (x < 1)
+        fun_l27_n694(x)
+    else
+        fun_l27_n5(x)
+    end
+end
+
+def fun_l26_n163(x)
+    if (x < 1)
+        fun_l27_n16(x)
+    else
+        fun_l27_n644(x)
+    end
+end
+
+def fun_l26_n164(x)
+    if (x < 1)
+        fun_l27_n760(x)
+    else
+        fun_l27_n167(x)
+    end
+end
+
+def fun_l26_n165(x)
+    if (x < 1)
+        fun_l27_n884(x)
+    else
+        fun_l27_n297(x)
+    end
+end
+
+def fun_l26_n166(x)
+    if (x < 1)
+        fun_l27_n707(x)
+    else
+        fun_l27_n456(x)
+    end
+end
+
+def fun_l26_n167(x)
+    if (x < 1)
+        fun_l27_n140(x)
+    else
+        fun_l27_n143(x)
+    end
+end
+
+def fun_l26_n168(x)
+    if (x < 1)
+        fun_l27_n581(x)
+    else
+        fun_l27_n369(x)
+    end
+end
+
+def fun_l26_n169(x)
+    if (x < 1)
+        fun_l27_n538(x)
+    else
+        fun_l27_n276(x)
+    end
+end
+
+def fun_l26_n170(x)
+    if (x < 1)
+        fun_l27_n984(x)
+    else
+        fun_l27_n729(x)
+    end
+end
+
+def fun_l26_n171(x)
+    if (x < 1)
+        fun_l27_n274(x)
+    else
+        fun_l27_n519(x)
+    end
+end
+
+def fun_l26_n172(x)
+    if (x < 1)
+        fun_l27_n597(x)
+    else
+        fun_l27_n632(x)
+    end
+end
+
+def fun_l26_n173(x)
+    if (x < 1)
+        fun_l27_n485(x)
+    else
+        fun_l27_n130(x)
+    end
+end
+
+def fun_l26_n174(x)
+    if (x < 1)
+        fun_l27_n460(x)
+    else
+        fun_l27_n133(x)
+    end
+end
+
+def fun_l26_n175(x)
+    if (x < 1)
+        fun_l27_n512(x)
+    else
+        fun_l27_n252(x)
+    end
+end
+
+def fun_l26_n176(x)
+    if (x < 1)
+        fun_l27_n429(x)
+    else
+        fun_l27_n297(x)
+    end
+end
+
+def fun_l26_n177(x)
+    if (x < 1)
+        fun_l27_n497(x)
+    else
+        fun_l27_n845(x)
+    end
+end
+
+def fun_l26_n178(x)
+    if (x < 1)
+        fun_l27_n930(x)
+    else
+        fun_l27_n923(x)
+    end
+end
+
+def fun_l26_n179(x)
+    if (x < 1)
+        fun_l27_n218(x)
+    else
+        fun_l27_n921(x)
+    end
+end
+
+def fun_l26_n180(x)
+    if (x < 1)
+        fun_l27_n793(x)
+    else
+        fun_l27_n278(x)
+    end
+end
+
+def fun_l26_n181(x)
+    if (x < 1)
+        fun_l27_n606(x)
+    else
+        fun_l27_n9(x)
+    end
+end
+
+def fun_l26_n182(x)
+    if (x < 1)
+        fun_l27_n297(x)
+    else
+        fun_l27_n62(x)
+    end
+end
+
+def fun_l26_n183(x)
+    if (x < 1)
+        fun_l27_n174(x)
+    else
+        fun_l27_n698(x)
+    end
+end
+
+def fun_l26_n184(x)
+    if (x < 1)
+        fun_l27_n773(x)
+    else
+        fun_l27_n312(x)
+    end
+end
+
+def fun_l26_n185(x)
+    if (x < 1)
+        fun_l27_n75(x)
+    else
+        fun_l27_n65(x)
+    end
+end
+
+def fun_l26_n186(x)
+    if (x < 1)
+        fun_l27_n389(x)
+    else
+        fun_l27_n27(x)
+    end
+end
+
+def fun_l26_n187(x)
+    if (x < 1)
+        fun_l27_n674(x)
+    else
+        fun_l27_n70(x)
+    end
+end
+
+def fun_l26_n188(x)
+    if (x < 1)
+        fun_l27_n157(x)
+    else
+        fun_l27_n160(x)
+    end
+end
+
+def fun_l26_n189(x)
+    if (x < 1)
+        fun_l27_n401(x)
+    else
+        fun_l27_n340(x)
+    end
+end
+
+def fun_l26_n190(x)
+    if (x < 1)
+        fun_l27_n550(x)
+    else
+        fun_l27_n551(x)
+    end
+end
+
+def fun_l26_n191(x)
+    if (x < 1)
+        fun_l27_n971(x)
+    else
+        fun_l27_n925(x)
+    end
+end
+
+def fun_l26_n192(x)
+    if (x < 1)
+        fun_l27_n370(x)
+    else
+        fun_l27_n697(x)
+    end
+end
+
+def fun_l26_n193(x)
+    if (x < 1)
+        fun_l27_n188(x)
+    else
+        fun_l27_n989(x)
+    end
+end
+
+def fun_l26_n194(x)
+    if (x < 1)
+        fun_l27_n848(x)
+    else
+        fun_l27_n288(x)
+    end
+end
+
+def fun_l26_n195(x)
+    if (x < 1)
+        fun_l27_n886(x)
+    else
+        fun_l27_n554(x)
+    end
+end
+
+def fun_l26_n196(x)
+    if (x < 1)
+        fun_l27_n989(x)
+    else
+        fun_l27_n577(x)
+    end
+end
+
+def fun_l26_n197(x)
+    if (x < 1)
+        fun_l27_n55(x)
+    else
+        fun_l27_n951(x)
+    end
+end
+
+def fun_l26_n198(x)
+    if (x < 1)
+        fun_l27_n750(x)
+    else
+        fun_l27_n941(x)
+    end
+end
+
+def fun_l26_n199(x)
+    if (x < 1)
+        fun_l27_n468(x)
+    else
+        fun_l27_n64(x)
+    end
+end
+
+def fun_l26_n200(x)
+    if (x < 1)
+        fun_l27_n617(x)
+    else
+        fun_l27_n156(x)
+    end
+end
+
+def fun_l26_n201(x)
+    if (x < 1)
+        fun_l27_n119(x)
+    else
+        fun_l27_n63(x)
+    end
+end
+
+def fun_l26_n202(x)
+    if (x < 1)
+        fun_l27_n524(x)
+    else
+        fun_l27_n455(x)
+    end
+end
+
+def fun_l26_n203(x)
+    if (x < 1)
+        fun_l27_n489(x)
+    else
+        fun_l27_n328(x)
+    end
+end
+
+def fun_l26_n204(x)
+    if (x < 1)
+        fun_l27_n854(x)
+    else
+        fun_l27_n605(x)
+    end
+end
+
+def fun_l26_n205(x)
+    if (x < 1)
+        fun_l27_n591(x)
+    else
+        fun_l27_n787(x)
+    end
+end
+
+def fun_l26_n206(x)
+    if (x < 1)
+        fun_l27_n122(x)
+    else
+        fun_l27_n977(x)
+    end
+end
+
+def fun_l26_n207(x)
+    if (x < 1)
+        fun_l27_n204(x)
+    else
+        fun_l27_n652(x)
+    end
+end
+
+def fun_l26_n208(x)
+    if (x < 1)
+        fun_l27_n213(x)
+    else
+        fun_l27_n699(x)
+    end
+end
+
+def fun_l26_n209(x)
+    if (x < 1)
+        fun_l27_n731(x)
+    else
+        fun_l27_n910(x)
+    end
+end
+
+def fun_l26_n210(x)
+    if (x < 1)
+        fun_l27_n398(x)
+    else
+        fun_l27_n2(x)
+    end
+end
+
+def fun_l26_n211(x)
+    if (x < 1)
+        fun_l27_n132(x)
+    else
+        fun_l27_n574(x)
+    end
+end
+
+def fun_l26_n212(x)
+    if (x < 1)
+        fun_l27_n701(x)
+    else
+        fun_l27_n617(x)
+    end
+end
+
+def fun_l26_n213(x)
+    if (x < 1)
+        fun_l27_n486(x)
+    else
+        fun_l27_n861(x)
+    end
+end
+
+def fun_l26_n214(x)
+    if (x < 1)
+        fun_l27_n305(x)
+    else
+        fun_l27_n20(x)
+    end
+end
+
+def fun_l26_n215(x)
+    if (x < 1)
+        fun_l27_n598(x)
+    else
+        fun_l27_n842(x)
+    end
+end
+
+def fun_l26_n216(x)
+    if (x < 1)
+        fun_l27_n948(x)
+    else
+        fun_l27_n669(x)
+    end
+end
+
+def fun_l26_n217(x)
+    if (x < 1)
+        fun_l27_n344(x)
+    else
+        fun_l27_n101(x)
+    end
+end
+
+def fun_l26_n218(x)
+    if (x < 1)
+        fun_l27_n527(x)
+    else
+        fun_l27_n930(x)
+    end
+end
+
+def fun_l26_n219(x)
+    if (x < 1)
+        fun_l27_n889(x)
+    else
+        fun_l27_n380(x)
+    end
+end
+
+def fun_l26_n220(x)
+    if (x < 1)
+        fun_l27_n873(x)
+    else
+        fun_l27_n925(x)
+    end
+end
+
+def fun_l26_n221(x)
+    if (x < 1)
+        fun_l27_n403(x)
+    else
+        fun_l27_n280(x)
+    end
+end
+
+def fun_l26_n222(x)
+    if (x < 1)
+        fun_l27_n614(x)
+    else
+        fun_l27_n370(x)
+    end
+end
+
+def fun_l26_n223(x)
+    if (x < 1)
+        fun_l27_n543(x)
+    else
+        fun_l27_n543(x)
+    end
+end
+
+def fun_l26_n224(x)
+    if (x < 1)
+        fun_l27_n873(x)
+    else
+        fun_l27_n895(x)
+    end
+end
+
+def fun_l26_n225(x)
+    if (x < 1)
+        fun_l27_n665(x)
+    else
+        fun_l27_n259(x)
+    end
+end
+
+def fun_l26_n226(x)
+    if (x < 1)
+        fun_l27_n663(x)
+    else
+        fun_l27_n271(x)
+    end
+end
+
+def fun_l26_n227(x)
+    if (x < 1)
+        fun_l27_n816(x)
+    else
+        fun_l27_n353(x)
+    end
+end
+
+def fun_l26_n228(x)
+    if (x < 1)
+        fun_l27_n941(x)
+    else
+        fun_l27_n484(x)
+    end
+end
+
+def fun_l26_n229(x)
+    if (x < 1)
+        fun_l27_n455(x)
+    else
+        fun_l27_n385(x)
+    end
+end
+
+def fun_l26_n230(x)
+    if (x < 1)
+        fun_l27_n398(x)
+    else
+        fun_l27_n888(x)
+    end
+end
+
+def fun_l26_n231(x)
+    if (x < 1)
+        fun_l27_n93(x)
+    else
+        fun_l27_n297(x)
+    end
+end
+
+def fun_l26_n232(x)
+    if (x < 1)
+        fun_l27_n197(x)
+    else
+        fun_l27_n779(x)
+    end
+end
+
+def fun_l26_n233(x)
+    if (x < 1)
+        fun_l27_n826(x)
+    else
+        fun_l27_n835(x)
+    end
+end
+
+def fun_l26_n234(x)
+    if (x < 1)
+        fun_l27_n32(x)
+    else
+        fun_l27_n430(x)
+    end
+end
+
+def fun_l26_n235(x)
+    if (x < 1)
+        fun_l27_n133(x)
+    else
+        fun_l27_n743(x)
+    end
+end
+
+def fun_l26_n236(x)
+    if (x < 1)
+        fun_l27_n763(x)
+    else
+        fun_l27_n683(x)
+    end
+end
+
+def fun_l26_n237(x)
+    if (x < 1)
+        fun_l27_n211(x)
+    else
+        fun_l27_n726(x)
+    end
+end
+
+def fun_l26_n238(x)
+    if (x < 1)
+        fun_l27_n19(x)
+    else
+        fun_l27_n404(x)
+    end
+end
+
+def fun_l26_n239(x)
+    if (x < 1)
+        fun_l27_n635(x)
+    else
+        fun_l27_n427(x)
+    end
+end
+
+def fun_l26_n240(x)
+    if (x < 1)
+        fun_l27_n102(x)
+    else
+        fun_l27_n875(x)
+    end
+end
+
+def fun_l26_n241(x)
+    if (x < 1)
+        fun_l27_n930(x)
+    else
+        fun_l27_n189(x)
+    end
+end
+
+def fun_l26_n242(x)
+    if (x < 1)
+        fun_l27_n860(x)
+    else
+        fun_l27_n347(x)
+    end
+end
+
+def fun_l26_n243(x)
+    if (x < 1)
+        fun_l27_n826(x)
+    else
+        fun_l27_n848(x)
+    end
+end
+
+def fun_l26_n244(x)
+    if (x < 1)
+        fun_l27_n491(x)
+    else
+        fun_l27_n797(x)
+    end
+end
+
+def fun_l26_n245(x)
+    if (x < 1)
+        fun_l27_n361(x)
+    else
+        fun_l27_n382(x)
+    end
+end
+
+def fun_l26_n246(x)
+    if (x < 1)
+        fun_l27_n391(x)
+    else
+        fun_l27_n907(x)
+    end
+end
+
+def fun_l26_n247(x)
+    if (x < 1)
+        fun_l27_n352(x)
+    else
+        fun_l27_n501(x)
+    end
+end
+
+def fun_l26_n248(x)
+    if (x < 1)
+        fun_l27_n235(x)
+    else
+        fun_l27_n610(x)
+    end
+end
+
+def fun_l26_n249(x)
+    if (x < 1)
+        fun_l27_n970(x)
+    else
+        fun_l27_n561(x)
+    end
+end
+
+def fun_l26_n250(x)
+    if (x < 1)
+        fun_l27_n625(x)
+    else
+        fun_l27_n526(x)
+    end
+end
+
+def fun_l26_n251(x)
+    if (x < 1)
+        fun_l27_n185(x)
+    else
+        fun_l27_n911(x)
+    end
+end
+
+def fun_l26_n252(x)
+    if (x < 1)
+        fun_l27_n426(x)
+    else
+        fun_l27_n247(x)
+    end
+end
+
+def fun_l26_n253(x)
+    if (x < 1)
+        fun_l27_n874(x)
+    else
+        fun_l27_n28(x)
+    end
+end
+
+def fun_l26_n254(x)
+    if (x < 1)
+        fun_l27_n178(x)
+    else
+        fun_l27_n290(x)
+    end
+end
+
+def fun_l26_n255(x)
+    if (x < 1)
+        fun_l27_n218(x)
+    else
+        fun_l27_n816(x)
+    end
+end
+
+def fun_l26_n256(x)
+    if (x < 1)
+        fun_l27_n27(x)
+    else
+        fun_l27_n896(x)
+    end
+end
+
+def fun_l26_n257(x)
+    if (x < 1)
+        fun_l27_n690(x)
+    else
+        fun_l27_n27(x)
+    end
+end
+
+def fun_l26_n258(x)
+    if (x < 1)
+        fun_l27_n549(x)
+    else
+        fun_l27_n481(x)
+    end
+end
+
+def fun_l26_n259(x)
+    if (x < 1)
+        fun_l27_n357(x)
+    else
+        fun_l27_n604(x)
+    end
+end
+
+def fun_l26_n260(x)
+    if (x < 1)
+        fun_l27_n731(x)
+    else
+        fun_l27_n111(x)
+    end
+end
+
+def fun_l26_n261(x)
+    if (x < 1)
+        fun_l27_n849(x)
+    else
+        fun_l27_n91(x)
+    end
+end
+
+def fun_l26_n262(x)
+    if (x < 1)
+        fun_l27_n686(x)
+    else
+        fun_l27_n969(x)
+    end
+end
+
+def fun_l26_n263(x)
+    if (x < 1)
+        fun_l27_n17(x)
+    else
+        fun_l27_n424(x)
+    end
+end
+
+def fun_l26_n264(x)
+    if (x < 1)
+        fun_l27_n25(x)
+    else
+        fun_l27_n487(x)
+    end
+end
+
+def fun_l26_n265(x)
+    if (x < 1)
+        fun_l27_n715(x)
+    else
+        fun_l27_n210(x)
+    end
+end
+
+def fun_l26_n266(x)
+    if (x < 1)
+        fun_l27_n997(x)
+    else
+        fun_l27_n563(x)
+    end
+end
+
+def fun_l26_n267(x)
+    if (x < 1)
+        fun_l27_n489(x)
+    else
+        fun_l27_n666(x)
+    end
+end
+
+def fun_l26_n268(x)
+    if (x < 1)
+        fun_l27_n85(x)
+    else
+        fun_l27_n780(x)
+    end
+end
+
+def fun_l26_n269(x)
+    if (x < 1)
+        fun_l27_n420(x)
+    else
+        fun_l27_n897(x)
+    end
+end
+
+def fun_l26_n270(x)
+    if (x < 1)
+        fun_l27_n152(x)
+    else
+        fun_l27_n841(x)
+    end
+end
+
+def fun_l26_n271(x)
+    if (x < 1)
+        fun_l27_n60(x)
+    else
+        fun_l27_n808(x)
+    end
+end
+
+def fun_l26_n272(x)
+    if (x < 1)
+        fun_l27_n27(x)
+    else
+        fun_l27_n69(x)
+    end
+end
+
+def fun_l26_n273(x)
+    if (x < 1)
+        fun_l27_n992(x)
+    else
+        fun_l27_n306(x)
+    end
+end
+
+def fun_l26_n274(x)
+    if (x < 1)
+        fun_l27_n893(x)
+    else
+        fun_l27_n837(x)
+    end
+end
+
+def fun_l26_n275(x)
+    if (x < 1)
+        fun_l27_n617(x)
+    else
+        fun_l27_n628(x)
+    end
+end
+
+def fun_l26_n276(x)
+    if (x < 1)
+        fun_l27_n402(x)
+    else
+        fun_l27_n766(x)
+    end
+end
+
+def fun_l26_n277(x)
+    if (x < 1)
+        fun_l27_n692(x)
+    else
+        fun_l27_n999(x)
+    end
+end
+
+def fun_l26_n278(x)
+    if (x < 1)
+        fun_l27_n896(x)
+    else
+        fun_l27_n941(x)
+    end
+end
+
+def fun_l26_n279(x)
+    if (x < 1)
+        fun_l27_n440(x)
+    else
+        fun_l27_n888(x)
+    end
+end
+
+def fun_l26_n280(x)
+    if (x < 1)
+        fun_l27_n350(x)
+    else
+        fun_l27_n19(x)
+    end
+end
+
+def fun_l26_n281(x)
+    if (x < 1)
+        fun_l27_n324(x)
+    else
+        fun_l27_n63(x)
+    end
+end
+
+def fun_l26_n282(x)
+    if (x < 1)
+        fun_l27_n422(x)
+    else
+        fun_l27_n369(x)
+    end
+end
+
+def fun_l26_n283(x)
+    if (x < 1)
+        fun_l27_n629(x)
+    else
+        fun_l27_n200(x)
+    end
+end
+
+def fun_l26_n284(x)
+    if (x < 1)
+        fun_l27_n466(x)
+    else
+        fun_l27_n392(x)
+    end
+end
+
+def fun_l26_n285(x)
+    if (x < 1)
+        fun_l27_n995(x)
+    else
+        fun_l27_n374(x)
+    end
+end
+
+def fun_l26_n286(x)
+    if (x < 1)
+        fun_l27_n808(x)
+    else
+        fun_l27_n529(x)
+    end
+end
+
+def fun_l26_n287(x)
+    if (x < 1)
+        fun_l27_n764(x)
+    else
+        fun_l27_n155(x)
+    end
+end
+
+def fun_l26_n288(x)
+    if (x < 1)
+        fun_l27_n282(x)
+    else
+        fun_l27_n676(x)
+    end
+end
+
+def fun_l26_n289(x)
+    if (x < 1)
+        fun_l27_n797(x)
+    else
+        fun_l27_n462(x)
+    end
+end
+
+def fun_l26_n290(x)
+    if (x < 1)
+        fun_l27_n572(x)
+    else
+        fun_l27_n909(x)
+    end
+end
+
+def fun_l26_n291(x)
+    if (x < 1)
+        fun_l27_n401(x)
+    else
+        fun_l27_n906(x)
+    end
+end
+
+def fun_l26_n292(x)
+    if (x < 1)
+        fun_l27_n680(x)
+    else
+        fun_l27_n922(x)
+    end
+end
+
+def fun_l26_n293(x)
+    if (x < 1)
+        fun_l27_n876(x)
+    else
+        fun_l27_n882(x)
+    end
+end
+
+def fun_l26_n294(x)
+    if (x < 1)
+        fun_l27_n40(x)
+    else
+        fun_l27_n752(x)
+    end
+end
+
+def fun_l26_n295(x)
+    if (x < 1)
+        fun_l27_n164(x)
+    else
+        fun_l27_n479(x)
+    end
+end
+
+def fun_l26_n296(x)
+    if (x < 1)
+        fun_l27_n836(x)
+    else
+        fun_l27_n956(x)
+    end
+end
+
+def fun_l26_n297(x)
+    if (x < 1)
+        fun_l27_n197(x)
+    else
+        fun_l27_n135(x)
+    end
+end
+
+def fun_l26_n298(x)
+    if (x < 1)
+        fun_l27_n289(x)
+    else
+        fun_l27_n314(x)
+    end
+end
+
+def fun_l26_n299(x)
+    if (x < 1)
+        fun_l27_n942(x)
+    else
+        fun_l27_n747(x)
+    end
+end
+
+def fun_l26_n300(x)
+    if (x < 1)
+        fun_l27_n4(x)
+    else
+        fun_l27_n355(x)
+    end
+end
+
+def fun_l26_n301(x)
+    if (x < 1)
+        fun_l27_n616(x)
+    else
+        fun_l27_n681(x)
+    end
+end
+
+def fun_l26_n302(x)
+    if (x < 1)
+        fun_l27_n175(x)
+    else
+        fun_l27_n859(x)
+    end
+end
+
+def fun_l26_n303(x)
+    if (x < 1)
+        fun_l27_n323(x)
+    else
+        fun_l27_n491(x)
+    end
+end
+
+def fun_l26_n304(x)
+    if (x < 1)
+        fun_l27_n630(x)
+    else
+        fun_l27_n821(x)
+    end
+end
+
+def fun_l26_n305(x)
+    if (x < 1)
+        fun_l27_n416(x)
+    else
+        fun_l27_n927(x)
+    end
+end
+
+def fun_l26_n306(x)
+    if (x < 1)
+        fun_l27_n80(x)
+    else
+        fun_l27_n69(x)
+    end
+end
+
+def fun_l26_n307(x)
+    if (x < 1)
+        fun_l27_n209(x)
+    else
+        fun_l27_n476(x)
+    end
+end
+
+def fun_l26_n308(x)
+    if (x < 1)
+        fun_l27_n201(x)
+    else
+        fun_l27_n18(x)
+    end
+end
+
+def fun_l26_n309(x)
+    if (x < 1)
+        fun_l27_n712(x)
+    else
+        fun_l27_n697(x)
+    end
+end
+
+def fun_l26_n310(x)
+    if (x < 1)
+        fun_l27_n815(x)
+    else
+        fun_l27_n626(x)
+    end
+end
+
+def fun_l26_n311(x)
+    if (x < 1)
+        fun_l27_n159(x)
+    else
+        fun_l27_n483(x)
+    end
+end
+
+def fun_l26_n312(x)
+    if (x < 1)
+        fun_l27_n304(x)
+    else
+        fun_l27_n260(x)
+    end
+end
+
+def fun_l26_n313(x)
+    if (x < 1)
+        fun_l27_n15(x)
+    else
+        fun_l27_n50(x)
+    end
+end
+
+def fun_l26_n314(x)
+    if (x < 1)
+        fun_l27_n748(x)
+    else
+        fun_l27_n71(x)
+    end
+end
+
+def fun_l26_n315(x)
+    if (x < 1)
+        fun_l27_n957(x)
+    else
+        fun_l27_n90(x)
+    end
+end
+
+def fun_l26_n316(x)
+    if (x < 1)
+        fun_l27_n189(x)
+    else
+        fun_l27_n276(x)
+    end
+end
+
+def fun_l26_n317(x)
+    if (x < 1)
+        fun_l27_n926(x)
+    else
+        fun_l27_n916(x)
+    end
+end
+
+def fun_l26_n318(x)
+    if (x < 1)
+        fun_l27_n74(x)
+    else
+        fun_l27_n395(x)
+    end
+end
+
+def fun_l26_n319(x)
+    if (x < 1)
+        fun_l27_n424(x)
+    else
+        fun_l27_n826(x)
+    end
+end
+
+def fun_l26_n320(x)
+    if (x < 1)
+        fun_l27_n321(x)
+    else
+        fun_l27_n553(x)
+    end
+end
+
+def fun_l26_n321(x)
+    if (x < 1)
+        fun_l27_n906(x)
+    else
+        fun_l27_n344(x)
+    end
+end
+
+def fun_l26_n322(x)
+    if (x < 1)
+        fun_l27_n706(x)
+    else
+        fun_l27_n189(x)
+    end
+end
+
+def fun_l26_n323(x)
+    if (x < 1)
+        fun_l27_n303(x)
+    else
+        fun_l27_n135(x)
+    end
+end
+
+def fun_l26_n324(x)
+    if (x < 1)
+        fun_l27_n103(x)
+    else
+        fun_l27_n579(x)
+    end
+end
+
+def fun_l26_n325(x)
+    if (x < 1)
+        fun_l27_n655(x)
+    else
+        fun_l27_n619(x)
+    end
+end
+
+def fun_l26_n326(x)
+    if (x < 1)
+        fun_l27_n119(x)
+    else
+        fun_l27_n950(x)
+    end
+end
+
+def fun_l26_n327(x)
+    if (x < 1)
+        fun_l27_n402(x)
+    else
+        fun_l27_n490(x)
+    end
+end
+
+def fun_l26_n328(x)
+    if (x < 1)
+        fun_l27_n6(x)
+    else
+        fun_l27_n844(x)
+    end
+end
+
+def fun_l26_n329(x)
+    if (x < 1)
+        fun_l27_n297(x)
+    else
+        fun_l27_n879(x)
+    end
+end
+
+def fun_l26_n330(x)
+    if (x < 1)
+        fun_l27_n747(x)
+    else
+        fun_l27_n701(x)
+    end
+end
+
+def fun_l26_n331(x)
+    if (x < 1)
+        fun_l27_n714(x)
+    else
+        fun_l27_n770(x)
+    end
+end
+
+def fun_l26_n332(x)
+    if (x < 1)
+        fun_l27_n377(x)
+    else
+        fun_l27_n434(x)
+    end
+end
+
+def fun_l26_n333(x)
+    if (x < 1)
+        fun_l27_n530(x)
+    else
+        fun_l27_n678(x)
+    end
+end
+
+def fun_l26_n334(x)
+    if (x < 1)
+        fun_l27_n28(x)
+    else
+        fun_l27_n154(x)
+    end
+end
+
+def fun_l26_n335(x)
+    if (x < 1)
+        fun_l27_n905(x)
+    else
+        fun_l27_n207(x)
+    end
+end
+
+def fun_l26_n336(x)
+    if (x < 1)
+        fun_l27_n537(x)
+    else
+        fun_l27_n426(x)
+    end
+end
+
+def fun_l26_n337(x)
+    if (x < 1)
+        fun_l27_n284(x)
+    else
+        fun_l27_n118(x)
+    end
+end
+
+def fun_l26_n338(x)
+    if (x < 1)
+        fun_l27_n40(x)
+    else
+        fun_l27_n123(x)
+    end
+end
+
+def fun_l26_n339(x)
+    if (x < 1)
+        fun_l27_n620(x)
+    else
+        fun_l27_n370(x)
+    end
+end
+
+def fun_l26_n340(x)
+    if (x < 1)
+        fun_l27_n946(x)
+    else
+        fun_l27_n994(x)
+    end
+end
+
+def fun_l26_n341(x)
+    if (x < 1)
+        fun_l27_n685(x)
+    else
+        fun_l27_n911(x)
+    end
+end
+
+def fun_l26_n342(x)
+    if (x < 1)
+        fun_l27_n641(x)
+    else
+        fun_l27_n339(x)
+    end
+end
+
+def fun_l26_n343(x)
+    if (x < 1)
+        fun_l27_n936(x)
+    else
+        fun_l27_n344(x)
+    end
+end
+
+def fun_l26_n344(x)
+    if (x < 1)
+        fun_l27_n822(x)
+    else
+        fun_l27_n939(x)
+    end
+end
+
+def fun_l26_n345(x)
+    if (x < 1)
+        fun_l27_n608(x)
+    else
+        fun_l27_n870(x)
+    end
+end
+
+def fun_l26_n346(x)
+    if (x < 1)
+        fun_l27_n211(x)
+    else
+        fun_l27_n124(x)
+    end
+end
+
+def fun_l26_n347(x)
+    if (x < 1)
+        fun_l27_n71(x)
+    else
+        fun_l27_n9(x)
+    end
+end
+
+def fun_l26_n348(x)
+    if (x < 1)
+        fun_l27_n68(x)
+    else
+        fun_l27_n51(x)
+    end
+end
+
+def fun_l26_n349(x)
+    if (x < 1)
+        fun_l27_n641(x)
+    else
+        fun_l27_n665(x)
+    end
+end
+
+def fun_l26_n350(x)
+    if (x < 1)
+        fun_l27_n516(x)
+    else
+        fun_l27_n364(x)
+    end
+end
+
+def fun_l26_n351(x)
+    if (x < 1)
+        fun_l27_n104(x)
+    else
+        fun_l27_n569(x)
+    end
+end
+
+def fun_l26_n352(x)
+    if (x < 1)
+        fun_l27_n90(x)
+    else
+        fun_l27_n565(x)
+    end
+end
+
+def fun_l26_n353(x)
+    if (x < 1)
+        fun_l27_n647(x)
+    else
+        fun_l27_n124(x)
+    end
+end
+
+def fun_l26_n354(x)
+    if (x < 1)
+        fun_l27_n332(x)
+    else
+        fun_l27_n368(x)
+    end
+end
+
+def fun_l26_n355(x)
+    if (x < 1)
+        fun_l27_n547(x)
+    else
+        fun_l27_n797(x)
+    end
+end
+
+def fun_l26_n356(x)
+    if (x < 1)
+        fun_l27_n462(x)
+    else
+        fun_l27_n503(x)
+    end
+end
+
+def fun_l26_n357(x)
+    if (x < 1)
+        fun_l27_n25(x)
+    else
+        fun_l27_n920(x)
+    end
+end
+
+def fun_l26_n358(x)
+    if (x < 1)
+        fun_l27_n891(x)
+    else
+        fun_l27_n136(x)
+    end
+end
+
+def fun_l26_n359(x)
+    if (x < 1)
+        fun_l27_n785(x)
+    else
+        fun_l27_n600(x)
+    end
+end
+
+def fun_l26_n360(x)
+    if (x < 1)
+        fun_l27_n945(x)
+    else
+        fun_l27_n617(x)
+    end
+end
+
+def fun_l26_n361(x)
+    if (x < 1)
+        fun_l27_n995(x)
+    else
+        fun_l27_n781(x)
+    end
+end
+
+def fun_l26_n362(x)
+    if (x < 1)
+        fun_l27_n553(x)
+    else
+        fun_l27_n650(x)
+    end
+end
+
+def fun_l26_n363(x)
+    if (x < 1)
+        fun_l27_n937(x)
+    else
+        fun_l27_n382(x)
+    end
+end
+
+def fun_l26_n364(x)
+    if (x < 1)
+        fun_l27_n946(x)
+    else
+        fun_l27_n980(x)
+    end
+end
+
+def fun_l26_n365(x)
+    if (x < 1)
+        fun_l27_n293(x)
+    else
+        fun_l27_n225(x)
+    end
+end
+
+def fun_l26_n366(x)
+    if (x < 1)
+        fun_l27_n872(x)
+    else
+        fun_l27_n535(x)
+    end
+end
+
+def fun_l26_n367(x)
+    if (x < 1)
+        fun_l27_n427(x)
+    else
+        fun_l27_n175(x)
+    end
+end
+
+def fun_l26_n368(x)
+    if (x < 1)
+        fun_l27_n111(x)
+    else
+        fun_l27_n379(x)
+    end
+end
+
+def fun_l26_n369(x)
+    if (x < 1)
+        fun_l27_n735(x)
+    else
+        fun_l27_n921(x)
+    end
+end
+
+def fun_l26_n370(x)
+    if (x < 1)
+        fun_l27_n818(x)
+    else
+        fun_l27_n189(x)
+    end
+end
+
+def fun_l26_n371(x)
+    if (x < 1)
+        fun_l27_n932(x)
+    else
+        fun_l27_n884(x)
+    end
+end
+
+def fun_l26_n372(x)
+    if (x < 1)
+        fun_l27_n40(x)
+    else
+        fun_l27_n732(x)
+    end
+end
+
+def fun_l26_n373(x)
+    if (x < 1)
+        fun_l27_n54(x)
+    else
+        fun_l27_n365(x)
+    end
+end
+
+def fun_l26_n374(x)
+    if (x < 1)
+        fun_l27_n742(x)
+    else
+        fun_l27_n319(x)
+    end
+end
+
+def fun_l26_n375(x)
+    if (x < 1)
+        fun_l27_n149(x)
+    else
+        fun_l27_n504(x)
+    end
+end
+
+def fun_l26_n376(x)
+    if (x < 1)
+        fun_l27_n185(x)
+    else
+        fun_l27_n458(x)
+    end
+end
+
+def fun_l26_n377(x)
+    if (x < 1)
+        fun_l27_n107(x)
+    else
+        fun_l27_n201(x)
+    end
+end
+
+def fun_l26_n378(x)
+    if (x < 1)
+        fun_l27_n94(x)
+    else
+        fun_l27_n173(x)
+    end
+end
+
+def fun_l26_n379(x)
+    if (x < 1)
+        fun_l27_n198(x)
+    else
+        fun_l27_n885(x)
+    end
+end
+
+def fun_l26_n380(x)
+    if (x < 1)
+        fun_l27_n164(x)
+    else
+        fun_l27_n23(x)
+    end
+end
+
+def fun_l26_n381(x)
+    if (x < 1)
+        fun_l27_n170(x)
+    else
+        fun_l27_n431(x)
+    end
+end
+
+def fun_l26_n382(x)
+    if (x < 1)
+        fun_l27_n679(x)
+    else
+        fun_l27_n613(x)
+    end
+end
+
+def fun_l26_n383(x)
+    if (x < 1)
+        fun_l27_n981(x)
+    else
+        fun_l27_n69(x)
+    end
+end
+
+def fun_l26_n384(x)
+    if (x < 1)
+        fun_l27_n600(x)
+    else
+        fun_l27_n544(x)
+    end
+end
+
+def fun_l26_n385(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n332(x)
+    end
+end
+
+def fun_l26_n386(x)
+    if (x < 1)
+        fun_l27_n63(x)
+    else
+        fun_l27_n597(x)
+    end
+end
+
+def fun_l26_n387(x)
+    if (x < 1)
+        fun_l27_n259(x)
+    else
+        fun_l27_n33(x)
+    end
+end
+
+def fun_l26_n388(x)
+    if (x < 1)
+        fun_l27_n363(x)
+    else
+        fun_l27_n765(x)
+    end
+end
+
+def fun_l26_n389(x)
+    if (x < 1)
+        fun_l27_n495(x)
+    else
+        fun_l27_n133(x)
+    end
+end
+
+def fun_l26_n390(x)
+    if (x < 1)
+        fun_l27_n62(x)
+    else
+        fun_l27_n462(x)
+    end
+end
+
+def fun_l26_n391(x)
+    if (x < 1)
+        fun_l27_n811(x)
+    else
+        fun_l27_n30(x)
+    end
+end
+
+def fun_l26_n392(x)
+    if (x < 1)
+        fun_l27_n222(x)
+    else
+        fun_l27_n451(x)
+    end
+end
+
+def fun_l26_n393(x)
+    if (x < 1)
+        fun_l27_n286(x)
+    else
+        fun_l27_n664(x)
+    end
+end
+
+def fun_l26_n394(x)
+    if (x < 1)
+        fun_l27_n935(x)
+    else
+        fun_l27_n392(x)
+    end
+end
+
+def fun_l26_n395(x)
+    if (x < 1)
+        fun_l27_n621(x)
+    else
+        fun_l27_n434(x)
+    end
+end
+
+def fun_l26_n396(x)
+    if (x < 1)
+        fun_l27_n318(x)
+    else
+        fun_l27_n410(x)
+    end
+end
+
+def fun_l26_n397(x)
+    if (x < 1)
+        fun_l27_n847(x)
+    else
+        fun_l27_n727(x)
+    end
+end
+
+def fun_l26_n398(x)
+    if (x < 1)
+        fun_l27_n705(x)
+    else
+        fun_l27_n453(x)
+    end
+end
+
+def fun_l26_n399(x)
+    if (x < 1)
+        fun_l27_n787(x)
+    else
+        fun_l27_n442(x)
+    end
+end
+
+def fun_l26_n400(x)
+    if (x < 1)
+        fun_l27_n854(x)
+    else
+        fun_l27_n885(x)
+    end
+end
+
+def fun_l26_n401(x)
+    if (x < 1)
+        fun_l27_n825(x)
+    else
+        fun_l27_n399(x)
+    end
+end
+
+def fun_l26_n402(x)
+    if (x < 1)
+        fun_l27_n420(x)
+    else
+        fun_l27_n747(x)
+    end
+end
+
+def fun_l26_n403(x)
+    if (x < 1)
+        fun_l27_n985(x)
+    else
+        fun_l27_n875(x)
+    end
+end
+
+def fun_l26_n404(x)
+    if (x < 1)
+        fun_l27_n193(x)
+    else
+        fun_l27_n448(x)
+    end
+end
+
+def fun_l26_n405(x)
+    if (x < 1)
+        fun_l27_n594(x)
+    else
+        fun_l27_n769(x)
+    end
+end
+
+def fun_l26_n406(x)
+    if (x < 1)
+        fun_l27_n774(x)
+    else
+        fun_l27_n44(x)
+    end
+end
+
+def fun_l26_n407(x)
+    if (x < 1)
+        fun_l27_n563(x)
+    else
+        fun_l27_n979(x)
+    end
+end
+
+def fun_l26_n408(x)
+    if (x < 1)
+        fun_l27_n369(x)
+    else
+        fun_l27_n825(x)
+    end
+end
+
+def fun_l26_n409(x)
+    if (x < 1)
+        fun_l27_n70(x)
+    else
+        fun_l27_n894(x)
+    end
+end
+
+def fun_l26_n410(x)
+    if (x < 1)
+        fun_l27_n651(x)
+    else
+        fun_l27_n224(x)
+    end
+end
+
+def fun_l26_n411(x)
+    if (x < 1)
+        fun_l27_n219(x)
+    else
+        fun_l27_n193(x)
+    end
+end
+
+def fun_l26_n412(x)
+    if (x < 1)
+        fun_l27_n16(x)
+    else
+        fun_l27_n113(x)
+    end
+end
+
+def fun_l26_n413(x)
+    if (x < 1)
+        fun_l27_n653(x)
+    else
+        fun_l27_n754(x)
+    end
+end
+
+def fun_l26_n414(x)
+    if (x < 1)
+        fun_l27_n682(x)
+    else
+        fun_l27_n378(x)
+    end
+end
+
+def fun_l26_n415(x)
+    if (x < 1)
+        fun_l27_n326(x)
+    else
+        fun_l27_n534(x)
+    end
+end
+
+def fun_l26_n416(x)
+    if (x < 1)
+        fun_l27_n552(x)
+    else
+        fun_l27_n627(x)
+    end
+end
+
+def fun_l26_n417(x)
+    if (x < 1)
+        fun_l27_n486(x)
+    else
+        fun_l27_n729(x)
+    end
+end
+
+def fun_l26_n418(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n220(x)
+    end
+end
+
+def fun_l26_n419(x)
+    if (x < 1)
+        fun_l27_n636(x)
+    else
+        fun_l27_n492(x)
+    end
+end
+
+def fun_l26_n420(x)
+    if (x < 1)
+        fun_l27_n692(x)
+    else
+        fun_l27_n7(x)
+    end
+end
+
+def fun_l26_n421(x)
+    if (x < 1)
+        fun_l27_n303(x)
+    else
+        fun_l27_n396(x)
+    end
+end
+
+def fun_l26_n422(x)
+    if (x < 1)
+        fun_l27_n937(x)
+    else
+        fun_l27_n940(x)
+    end
+end
+
+def fun_l26_n423(x)
+    if (x < 1)
+        fun_l27_n581(x)
+    else
+        fun_l27_n355(x)
+    end
+end
+
+def fun_l26_n424(x)
+    if (x < 1)
+        fun_l27_n743(x)
+    else
+        fun_l27_n636(x)
+    end
+end
+
+def fun_l26_n425(x)
+    if (x < 1)
+        fun_l27_n385(x)
+    else
+        fun_l27_n573(x)
+    end
+end
+
+def fun_l26_n426(x)
+    if (x < 1)
+        fun_l27_n595(x)
+    else
+        fun_l27_n873(x)
+    end
+end
+
+def fun_l26_n427(x)
+    if (x < 1)
+        fun_l27_n700(x)
+    else
+        fun_l27_n541(x)
+    end
+end
+
+def fun_l26_n428(x)
+    if (x < 1)
+        fun_l27_n445(x)
+    else
+        fun_l27_n239(x)
+    end
+end
+
+def fun_l26_n429(x)
+    if (x < 1)
+        fun_l27_n500(x)
+    else
+        fun_l27_n7(x)
+    end
+end
+
+def fun_l26_n430(x)
+    if (x < 1)
+        fun_l27_n615(x)
+    else
+        fun_l27_n383(x)
+    end
+end
+
+def fun_l26_n431(x)
+    if (x < 1)
+        fun_l27_n962(x)
+    else
+        fun_l27_n424(x)
+    end
+end
+
+def fun_l26_n432(x)
+    if (x < 1)
+        fun_l27_n289(x)
+    else
+        fun_l27_n142(x)
+    end
+end
+
+def fun_l26_n433(x)
+    if (x < 1)
+        fun_l27_n527(x)
+    else
+        fun_l27_n112(x)
+    end
+end
+
+def fun_l26_n434(x)
+    if (x < 1)
+        fun_l27_n884(x)
+    else
+        fun_l27_n509(x)
+    end
+end
+
+def fun_l26_n435(x)
+    if (x < 1)
+        fun_l27_n65(x)
+    else
+        fun_l27_n431(x)
+    end
+end
+
+def fun_l26_n436(x)
+    if (x < 1)
+        fun_l27_n324(x)
+    else
+        fun_l27_n885(x)
+    end
+end
+
+def fun_l26_n437(x)
+    if (x < 1)
+        fun_l27_n826(x)
+    else
+        fun_l27_n372(x)
+    end
+end
+
+def fun_l26_n438(x)
+    if (x < 1)
+        fun_l27_n291(x)
+    else
+        fun_l27_n793(x)
+    end
+end
+
+def fun_l26_n439(x)
+    if (x < 1)
+        fun_l27_n677(x)
+    else
+        fun_l27_n31(x)
+    end
+end
+
+def fun_l26_n440(x)
+    if (x < 1)
+        fun_l27_n948(x)
+    else
+        fun_l27_n320(x)
+    end
+end
+
+def fun_l26_n441(x)
+    if (x < 1)
+        fun_l27_n951(x)
+    else
+        fun_l27_n504(x)
+    end
+end
+
+def fun_l26_n442(x)
+    if (x < 1)
+        fun_l27_n388(x)
+    else
+        fun_l27_n1(x)
+    end
+end
+
+def fun_l26_n443(x)
+    if (x < 1)
+        fun_l27_n92(x)
+    else
+        fun_l27_n570(x)
+    end
+end
+
+def fun_l26_n444(x)
+    if (x < 1)
+        fun_l27_n956(x)
+    else
+        fun_l27_n120(x)
+    end
+end
+
+def fun_l26_n445(x)
+    if (x < 1)
+        fun_l27_n985(x)
+    else
+        fun_l27_n233(x)
+    end
+end
+
+def fun_l26_n446(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n590(x)
+    end
+end
+
+def fun_l26_n447(x)
+    if (x < 1)
+        fun_l27_n793(x)
+    else
+        fun_l27_n675(x)
+    end
+end
+
+def fun_l26_n448(x)
+    if (x < 1)
+        fun_l27_n351(x)
+    else
+        fun_l27_n781(x)
+    end
+end
+
+def fun_l26_n449(x)
+    if (x < 1)
+        fun_l27_n137(x)
+    else
+        fun_l27_n147(x)
+    end
+end
+
+def fun_l26_n450(x)
+    if (x < 1)
+        fun_l27_n138(x)
+    else
+        fun_l27_n636(x)
+    end
+end
+
+def fun_l26_n451(x)
+    if (x < 1)
+        fun_l27_n154(x)
+    else
+        fun_l27_n755(x)
+    end
+end
+
+def fun_l26_n452(x)
+    if (x < 1)
+        fun_l27_n665(x)
+    else
+        fun_l27_n65(x)
+    end
+end
+
+def fun_l26_n453(x)
+    if (x < 1)
+        fun_l27_n769(x)
+    else
+        fun_l27_n847(x)
+    end
+end
+
+def fun_l26_n454(x)
+    if (x < 1)
+        fun_l27_n959(x)
+    else
+        fun_l27_n731(x)
+    end
+end
+
+def fun_l26_n455(x)
+    if (x < 1)
+        fun_l27_n565(x)
+    else
+        fun_l27_n916(x)
+    end
+end
+
+def fun_l26_n456(x)
+    if (x < 1)
+        fun_l27_n421(x)
+    else
+        fun_l27_n57(x)
+    end
+end
+
+def fun_l26_n457(x)
+    if (x < 1)
+        fun_l27_n595(x)
+    else
+        fun_l27_n920(x)
+    end
+end
+
+def fun_l26_n458(x)
+    if (x < 1)
+        fun_l27_n660(x)
+    else
+        fun_l27_n835(x)
+    end
+end
+
+def fun_l26_n459(x)
+    if (x < 1)
+        fun_l27_n114(x)
+    else
+        fun_l27_n418(x)
+    end
+end
+
+def fun_l26_n460(x)
+    if (x < 1)
+        fun_l27_n744(x)
+    else
+        fun_l27_n674(x)
+    end
+end
+
+def fun_l26_n461(x)
+    if (x < 1)
+        fun_l27_n436(x)
+    else
+        fun_l27_n448(x)
+    end
+end
+
+def fun_l26_n462(x)
+    if (x < 1)
+        fun_l27_n796(x)
+    else
+        fun_l27_n960(x)
+    end
+end
+
+def fun_l26_n463(x)
+    if (x < 1)
+        fun_l27_n871(x)
+    else
+        fun_l27_n300(x)
+    end
+end
+
+def fun_l26_n464(x)
+    if (x < 1)
+        fun_l27_n942(x)
+    else
+        fun_l27_n625(x)
+    end
+end
+
+def fun_l26_n465(x)
+    if (x < 1)
+        fun_l27_n219(x)
+    else
+        fun_l27_n383(x)
+    end
+end
+
+def fun_l26_n466(x)
+    if (x < 1)
+        fun_l27_n440(x)
+    else
+        fun_l27_n177(x)
+    end
+end
+
+def fun_l26_n467(x)
+    if (x < 1)
+        fun_l27_n958(x)
+    else
+        fun_l27_n441(x)
+    end
+end
+
+def fun_l26_n468(x)
+    if (x < 1)
+        fun_l27_n899(x)
+    else
+        fun_l27_n613(x)
+    end
+end
+
+def fun_l26_n469(x)
+    if (x < 1)
+        fun_l27_n535(x)
+    else
+        fun_l27_n439(x)
+    end
+end
+
+def fun_l26_n470(x)
+    if (x < 1)
+        fun_l27_n18(x)
+    else
+        fun_l27_n716(x)
+    end
+end
+
+def fun_l26_n471(x)
+    if (x < 1)
+        fun_l27_n768(x)
+    else
+        fun_l27_n374(x)
+    end
+end
+
+def fun_l26_n472(x)
+    if (x < 1)
+        fun_l27_n537(x)
+    else
+        fun_l27_n434(x)
+    end
+end
+
+def fun_l26_n473(x)
+    if (x < 1)
+        fun_l27_n632(x)
+    else
+        fun_l27_n733(x)
+    end
+end
+
+def fun_l26_n474(x)
+    if (x < 1)
+        fun_l27_n347(x)
+    else
+        fun_l27_n562(x)
+    end
+end
+
+def fun_l26_n475(x)
+    if (x < 1)
+        fun_l27_n741(x)
+    else
+        fun_l27_n684(x)
+    end
+end
+
+def fun_l26_n476(x)
+    if (x < 1)
+        fun_l27_n222(x)
+    else
+        fun_l27_n41(x)
+    end
+end
+
+def fun_l26_n477(x)
+    if (x < 1)
+        fun_l27_n23(x)
+    else
+        fun_l27_n541(x)
+    end
+end
+
+def fun_l26_n478(x)
+    if (x < 1)
+        fun_l27_n588(x)
+    else
+        fun_l27_n394(x)
+    end
+end
+
+def fun_l26_n479(x)
+    if (x < 1)
+        fun_l27_n526(x)
+    else
+        fun_l27_n974(x)
+    end
+end
+
+def fun_l26_n480(x)
+    if (x < 1)
+        fun_l27_n845(x)
+    else
+        fun_l27_n528(x)
+    end
+end
+
+def fun_l26_n481(x)
+    if (x < 1)
+        fun_l27_n505(x)
+    else
+        fun_l27_n913(x)
+    end
+end
+
+def fun_l26_n482(x)
+    if (x < 1)
+        fun_l27_n100(x)
+    else
+        fun_l27_n233(x)
+    end
+end
+
+def fun_l26_n483(x)
+    if (x < 1)
+        fun_l27_n87(x)
+    else
+        fun_l27_n339(x)
+    end
+end
+
+def fun_l26_n484(x)
+    if (x < 1)
+        fun_l27_n744(x)
+    else
+        fun_l27_n404(x)
+    end
+end
+
+def fun_l26_n485(x)
+    if (x < 1)
+        fun_l27_n965(x)
+    else
+        fun_l27_n86(x)
+    end
+end
+
+def fun_l26_n486(x)
+    if (x < 1)
+        fun_l27_n826(x)
+    else
+        fun_l27_n25(x)
+    end
+end
+
+def fun_l26_n487(x)
+    if (x < 1)
+        fun_l27_n950(x)
+    else
+        fun_l27_n876(x)
+    end
+end
+
+def fun_l26_n488(x)
+    if (x < 1)
+        fun_l27_n964(x)
+    else
+        fun_l27_n60(x)
+    end
+end
+
+def fun_l26_n489(x)
+    if (x < 1)
+        fun_l27_n171(x)
+    else
+        fun_l27_n768(x)
+    end
+end
+
+def fun_l26_n490(x)
+    if (x < 1)
+        fun_l27_n391(x)
+    else
+        fun_l27_n308(x)
+    end
+end
+
+def fun_l26_n491(x)
+    if (x < 1)
+        fun_l27_n440(x)
+    else
+        fun_l27_n51(x)
+    end
+end
+
+def fun_l26_n492(x)
+    if (x < 1)
+        fun_l27_n403(x)
+    else
+        fun_l27_n956(x)
+    end
+end
+
+def fun_l26_n493(x)
+    if (x < 1)
+        fun_l27_n802(x)
+    else
+        fun_l27_n931(x)
+    end
+end
+
+def fun_l26_n494(x)
+    if (x < 1)
+        fun_l27_n7(x)
+    else
+        fun_l27_n291(x)
+    end
+end
+
+def fun_l26_n495(x)
+    if (x < 1)
+        fun_l27_n149(x)
+    else
+        fun_l27_n173(x)
+    end
+end
+
+def fun_l26_n496(x)
+    if (x < 1)
+        fun_l27_n864(x)
+    else
+        fun_l27_n488(x)
+    end
+end
+
+def fun_l26_n497(x)
+    if (x < 1)
+        fun_l27_n290(x)
+    else
+        fun_l27_n431(x)
+    end
+end
+
+def fun_l26_n498(x)
+    if (x < 1)
+        fun_l27_n269(x)
+    else
+        fun_l27_n622(x)
+    end
+end
+
+def fun_l26_n499(x)
+    if (x < 1)
+        fun_l27_n168(x)
+    else
+        fun_l27_n225(x)
+    end
+end
+
+def fun_l26_n500(x)
+    if (x < 1)
+        fun_l27_n512(x)
+    else
+        fun_l27_n363(x)
+    end
+end
+
+def fun_l26_n501(x)
+    if (x < 1)
+        fun_l27_n844(x)
+    else
+        fun_l27_n15(x)
+    end
+end
+
+def fun_l26_n502(x)
+    if (x < 1)
+        fun_l27_n242(x)
+    else
+        fun_l27_n479(x)
+    end
+end
+
+def fun_l26_n503(x)
+    if (x < 1)
+        fun_l27_n285(x)
+    else
+        fun_l27_n202(x)
+    end
+end
+
+def fun_l26_n504(x)
+    if (x < 1)
+        fun_l27_n64(x)
+    else
+        fun_l27_n223(x)
+    end
+end
+
+def fun_l26_n505(x)
+    if (x < 1)
+        fun_l27_n85(x)
+    else
+        fun_l27_n477(x)
+    end
+end
+
+def fun_l26_n506(x)
+    if (x < 1)
+        fun_l27_n360(x)
+    else
+        fun_l27_n406(x)
+    end
+end
+
+def fun_l26_n507(x)
+    if (x < 1)
+        fun_l27_n515(x)
+    else
+        fun_l27_n599(x)
+    end
+end
+
+def fun_l26_n508(x)
+    if (x < 1)
+        fun_l27_n848(x)
+    else
+        fun_l27_n832(x)
+    end
+end
+
+def fun_l26_n509(x)
+    if (x < 1)
+        fun_l27_n831(x)
+    else
+        fun_l27_n334(x)
+    end
+end
+
+def fun_l26_n510(x)
+    if (x < 1)
+        fun_l27_n53(x)
+    else
+        fun_l27_n937(x)
+    end
+end
+
+def fun_l26_n511(x)
+    if (x < 1)
+        fun_l27_n583(x)
+    else
+        fun_l27_n901(x)
+    end
+end
+
+def fun_l26_n512(x)
+    if (x < 1)
+        fun_l27_n394(x)
+    else
+        fun_l27_n135(x)
+    end
+end
+
+def fun_l26_n513(x)
+    if (x < 1)
+        fun_l27_n175(x)
+    else
+        fun_l27_n339(x)
+    end
+end
+
+def fun_l26_n514(x)
+    if (x < 1)
+        fun_l27_n200(x)
+    else
+        fun_l27_n124(x)
+    end
+end
+
+def fun_l26_n515(x)
+    if (x < 1)
+        fun_l27_n145(x)
+    else
+        fun_l27_n426(x)
+    end
+end
+
+def fun_l26_n516(x)
+    if (x < 1)
+        fun_l27_n803(x)
+    else
+        fun_l27_n466(x)
+    end
+end
+
+def fun_l26_n517(x)
+    if (x < 1)
+        fun_l27_n773(x)
+    else
+        fun_l27_n296(x)
+    end
+end
+
+def fun_l26_n518(x)
+    if (x < 1)
+        fun_l27_n957(x)
+    else
+        fun_l27_n373(x)
+    end
+end
+
+def fun_l26_n519(x)
+    if (x < 1)
+        fun_l27_n887(x)
+    else
+        fun_l27_n498(x)
+    end
+end
+
+def fun_l26_n520(x)
+    if (x < 1)
+        fun_l27_n629(x)
+    else
+        fun_l27_n477(x)
+    end
+end
+
+def fun_l26_n521(x)
+    if (x < 1)
+        fun_l27_n634(x)
+    else
+        fun_l27_n138(x)
+    end
+end
+
+def fun_l26_n522(x)
+    if (x < 1)
+        fun_l27_n942(x)
+    else
+        fun_l27_n853(x)
+    end
+end
+
+def fun_l26_n523(x)
+    if (x < 1)
+        fun_l27_n453(x)
+    else
+        fun_l27_n520(x)
+    end
+end
+
+def fun_l26_n524(x)
+    if (x < 1)
+        fun_l27_n125(x)
+    else
+        fun_l27_n922(x)
+    end
+end
+
+def fun_l26_n525(x)
+    if (x < 1)
+        fun_l27_n629(x)
+    else
+        fun_l27_n711(x)
+    end
+end
+
+def fun_l26_n526(x)
+    if (x < 1)
+        fun_l27_n243(x)
+    else
+        fun_l27_n374(x)
+    end
+end
+
+def fun_l26_n527(x)
+    if (x < 1)
+        fun_l27_n476(x)
+    else
+        fun_l27_n348(x)
+    end
+end
+
+def fun_l26_n528(x)
+    if (x < 1)
+        fun_l27_n532(x)
+    else
+        fun_l27_n156(x)
+    end
+end
+
+def fun_l26_n529(x)
+    if (x < 1)
+        fun_l27_n139(x)
+    else
+        fun_l27_n976(x)
+    end
+end
+
+def fun_l26_n530(x)
+    if (x < 1)
+        fun_l27_n323(x)
+    else
+        fun_l27_n48(x)
+    end
+end
+
+def fun_l26_n531(x)
+    if (x < 1)
+        fun_l27_n626(x)
+    else
+        fun_l27_n913(x)
+    end
+end
+
+def fun_l26_n532(x)
+    if (x < 1)
+        fun_l27_n98(x)
+    else
+        fun_l27_n369(x)
+    end
+end
+
+def fun_l26_n533(x)
+    if (x < 1)
+        fun_l27_n50(x)
+    else
+        fun_l27_n41(x)
+    end
+end
+
+def fun_l26_n534(x)
+    if (x < 1)
+        fun_l27_n163(x)
+    else
+        fun_l27_n722(x)
+    end
+end
+
+def fun_l26_n535(x)
+    if (x < 1)
+        fun_l27_n640(x)
+    else
+        fun_l27_n622(x)
+    end
+end
+
+def fun_l26_n536(x)
+    if (x < 1)
+        fun_l27_n98(x)
+    else
+        fun_l27_n970(x)
+    end
+end
+
+def fun_l26_n537(x)
+    if (x < 1)
+        fun_l27_n828(x)
+    else
+        fun_l27_n240(x)
+    end
+end
+
+def fun_l26_n538(x)
+    if (x < 1)
+        fun_l27_n303(x)
+    else
+        fun_l27_n116(x)
+    end
+end
+
+def fun_l26_n539(x)
+    if (x < 1)
+        fun_l27_n341(x)
+    else
+        fun_l27_n545(x)
+    end
+end
+
+def fun_l26_n540(x)
+    if (x < 1)
+        fun_l27_n476(x)
+    else
+        fun_l27_n943(x)
+    end
+end
+
+def fun_l26_n541(x)
+    if (x < 1)
+        fun_l27_n380(x)
+    else
+        fun_l27_n894(x)
+    end
+end
+
+def fun_l26_n542(x)
+    if (x < 1)
+        fun_l27_n330(x)
+    else
+        fun_l27_n96(x)
+    end
+end
+
+def fun_l26_n543(x)
+    if (x < 1)
+        fun_l27_n676(x)
+    else
+        fun_l27_n876(x)
+    end
+end
+
+def fun_l26_n544(x)
+    if (x < 1)
+        fun_l27_n396(x)
+    else
+        fun_l27_n116(x)
+    end
+end
+
+def fun_l26_n545(x)
+    if (x < 1)
+        fun_l27_n691(x)
+    else
+        fun_l27_n178(x)
+    end
+end
+
+def fun_l26_n546(x)
+    if (x < 1)
+        fun_l27_n118(x)
+    else
+        fun_l27_n956(x)
+    end
+end
+
+def fun_l26_n547(x)
+    if (x < 1)
+        fun_l27_n20(x)
+    else
+        fun_l27_n777(x)
+    end
+end
+
+def fun_l26_n548(x)
+    if (x < 1)
+        fun_l27_n522(x)
+    else
+        fun_l27_n808(x)
+    end
+end
+
+def fun_l26_n549(x)
+    if (x < 1)
+        fun_l27_n624(x)
+    else
+        fun_l27_n54(x)
+    end
+end
+
+def fun_l26_n550(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n243(x)
+    end
+end
+
+def fun_l26_n551(x)
+    if (x < 1)
+        fun_l27_n283(x)
+    else
+        fun_l27_n913(x)
+    end
+end
+
+def fun_l26_n552(x)
+    if (x < 1)
+        fun_l27_n101(x)
+    else
+        fun_l27_n136(x)
+    end
+end
+
+def fun_l26_n553(x)
+    if (x < 1)
+        fun_l27_n965(x)
+    else
+        fun_l27_n453(x)
+    end
+end
+
+def fun_l26_n554(x)
+    if (x < 1)
+        fun_l27_n807(x)
+    else
+        fun_l27_n442(x)
+    end
+end
+
+def fun_l26_n555(x)
+    if (x < 1)
+        fun_l27_n987(x)
+    else
+        fun_l27_n883(x)
+    end
+end
+
+def fun_l26_n556(x)
+    if (x < 1)
+        fun_l27_n475(x)
+    else
+        fun_l27_n439(x)
+    end
+end
+
+def fun_l26_n557(x)
+    if (x < 1)
+        fun_l27_n580(x)
+    else
+        fun_l27_n301(x)
+    end
+end
+
+def fun_l26_n558(x)
+    if (x < 1)
+        fun_l27_n91(x)
+    else
+        fun_l27_n514(x)
+    end
+end
+
+def fun_l26_n559(x)
+    if (x < 1)
+        fun_l27_n395(x)
+    else
+        fun_l27_n583(x)
+    end
+end
+
+def fun_l26_n560(x)
+    if (x < 1)
+        fun_l27_n81(x)
+    else
+        fun_l27_n817(x)
+    end
+end
+
+def fun_l26_n561(x)
+    if (x < 1)
+        fun_l27_n816(x)
+    else
+        fun_l27_n423(x)
+    end
+end
+
+def fun_l26_n562(x)
+    if (x < 1)
+        fun_l27_n513(x)
+    else
+        fun_l27_n577(x)
+    end
+end
+
+def fun_l26_n563(x)
+    if (x < 1)
+        fun_l27_n864(x)
+    else
+        fun_l27_n249(x)
+    end
+end
+
+def fun_l26_n564(x)
+    if (x < 1)
+        fun_l27_n408(x)
+    else
+        fun_l27_n281(x)
+    end
+end
+
+def fun_l26_n565(x)
+    if (x < 1)
+        fun_l27_n963(x)
+    else
+        fun_l27_n736(x)
+    end
+end
+
+def fun_l26_n566(x)
+    if (x < 1)
+        fun_l27_n366(x)
+    else
+        fun_l27_n774(x)
+    end
+end
+
+def fun_l26_n567(x)
+    if (x < 1)
+        fun_l27_n239(x)
+    else
+        fun_l27_n473(x)
+    end
+end
+
+def fun_l26_n568(x)
+    if (x < 1)
+        fun_l27_n272(x)
+    else
+        fun_l27_n790(x)
+    end
+end
+
+def fun_l26_n569(x)
+    if (x < 1)
+        fun_l27_n225(x)
+    else
+        fun_l27_n970(x)
+    end
+end
+
+def fun_l26_n570(x)
+    if (x < 1)
+        fun_l27_n631(x)
+    else
+        fun_l27_n988(x)
+    end
+end
+
+def fun_l26_n571(x)
+    if (x < 1)
+        fun_l27_n224(x)
+    else
+        fun_l27_n286(x)
+    end
+end
+
+def fun_l26_n572(x)
+    if (x < 1)
+        fun_l27_n141(x)
+    else
+        fun_l27_n573(x)
+    end
+end
+
+def fun_l26_n573(x)
+    if (x < 1)
+        fun_l27_n493(x)
+    else
+        fun_l27_n288(x)
+    end
+end
+
+def fun_l26_n574(x)
+    if (x < 1)
+        fun_l27_n573(x)
+    else
+        fun_l27_n88(x)
+    end
+end
+
+def fun_l26_n575(x)
+    if (x < 1)
+        fun_l27_n174(x)
+    else
+        fun_l27_n635(x)
+    end
+end
+
+def fun_l26_n576(x)
+    if (x < 1)
+        fun_l27_n146(x)
+    else
+        fun_l27_n48(x)
+    end
+end
+
+def fun_l26_n577(x)
+    if (x < 1)
+        fun_l27_n344(x)
+    else
+        fun_l27_n668(x)
+    end
+end
+
+def fun_l26_n578(x)
+    if (x < 1)
+        fun_l27_n624(x)
+    else
+        fun_l27_n516(x)
+    end
+end
+
+def fun_l26_n579(x)
+    if (x < 1)
+        fun_l27_n349(x)
+    else
+        fun_l27_n510(x)
+    end
+end
+
+def fun_l26_n580(x)
+    if (x < 1)
+        fun_l27_n625(x)
+    else
+        fun_l27_n474(x)
+    end
+end
+
+def fun_l26_n581(x)
+    if (x < 1)
+        fun_l27_n473(x)
+    else
+        fun_l27_n785(x)
+    end
+end
+
+def fun_l26_n582(x)
+    if (x < 1)
+        fun_l27_n246(x)
+    else
+        fun_l27_n803(x)
+    end
+end
+
+def fun_l26_n583(x)
+    if (x < 1)
+        fun_l27_n232(x)
+    else
+        fun_l27_n981(x)
+    end
+end
+
+def fun_l26_n584(x)
+    if (x < 1)
+        fun_l27_n825(x)
+    else
+        fun_l27_n65(x)
+    end
+end
+
+def fun_l26_n585(x)
+    if (x < 1)
+        fun_l27_n258(x)
+    else
+        fun_l27_n700(x)
+    end
+end
+
+def fun_l26_n586(x)
+    if (x < 1)
+        fun_l27_n404(x)
+    else
+        fun_l27_n124(x)
+    end
+end
+
+def fun_l26_n587(x)
+    if (x < 1)
+        fun_l27_n390(x)
+    else
+        fun_l27_n812(x)
+    end
+end
+
+def fun_l26_n588(x)
+    if (x < 1)
+        fun_l27_n874(x)
+    else
+        fun_l27_n249(x)
+    end
+end
+
+def fun_l26_n589(x)
+    if (x < 1)
+        fun_l27_n837(x)
+    else
+        fun_l27_n480(x)
+    end
+end
+
+def fun_l26_n590(x)
+    if (x < 1)
+        fun_l27_n126(x)
+    else
+        fun_l27_n446(x)
+    end
+end
+
+def fun_l26_n591(x)
+    if (x < 1)
+        fun_l27_n838(x)
+    else
+        fun_l27_n285(x)
+    end
+end
+
+def fun_l26_n592(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n821(x)
+    end
+end
+
+def fun_l26_n593(x)
+    if (x < 1)
+        fun_l27_n781(x)
+    else
+        fun_l27_n310(x)
+    end
+end
+
+def fun_l26_n594(x)
+    if (x < 1)
+        fun_l27_n343(x)
+    else
+        fun_l27_n853(x)
+    end
+end
+
+def fun_l26_n595(x)
+    if (x < 1)
+        fun_l27_n216(x)
+    else
+        fun_l27_n334(x)
+    end
+end
+
+def fun_l26_n596(x)
+    if (x < 1)
+        fun_l27_n866(x)
+    else
+        fun_l27_n981(x)
+    end
+end
+
+def fun_l26_n597(x)
+    if (x < 1)
+        fun_l27_n551(x)
+    else
+        fun_l27_n184(x)
+    end
+end
+
+def fun_l26_n598(x)
+    if (x < 1)
+        fun_l27_n538(x)
+    else
+        fun_l27_n878(x)
+    end
+end
+
+def fun_l26_n599(x)
+    if (x < 1)
+        fun_l27_n909(x)
+    else
+        fun_l27_n435(x)
+    end
+end
+
+def fun_l26_n600(x)
+    if (x < 1)
+        fun_l27_n695(x)
+    else
+        fun_l27_n886(x)
+    end
+end
+
+def fun_l26_n601(x)
+    if (x < 1)
+        fun_l27_n927(x)
+    else
+        fun_l27_n303(x)
+    end
+end
+
+def fun_l26_n602(x)
+    if (x < 1)
+        fun_l27_n323(x)
+    else
+        fun_l27_n534(x)
+    end
+end
+
+def fun_l26_n603(x)
+    if (x < 1)
+        fun_l27_n803(x)
+    else
+        fun_l27_n34(x)
+    end
+end
+
+def fun_l26_n604(x)
+    if (x < 1)
+        fun_l27_n266(x)
+    else
+        fun_l27_n800(x)
+    end
+end
+
+def fun_l26_n605(x)
+    if (x < 1)
+        fun_l27_n831(x)
+    else
+        fun_l27_n338(x)
+    end
+end
+
+def fun_l26_n606(x)
+    if (x < 1)
+        fun_l27_n97(x)
+    else
+        fun_l27_n772(x)
+    end
+end
+
+def fun_l26_n607(x)
+    if (x < 1)
+        fun_l27_n291(x)
+    else
+        fun_l27_n756(x)
+    end
+end
+
+def fun_l26_n608(x)
+    if (x < 1)
+        fun_l27_n906(x)
+    else
+        fun_l27_n861(x)
+    end
+end
+
+def fun_l26_n609(x)
+    if (x < 1)
+        fun_l27_n793(x)
+    else
+        fun_l27_n845(x)
+    end
+end
+
+def fun_l26_n610(x)
+    if (x < 1)
+        fun_l27_n83(x)
+    else
+        fun_l27_n359(x)
+    end
+end
+
+def fun_l26_n611(x)
+    if (x < 1)
+        fun_l27_n911(x)
+    else
+        fun_l27_n526(x)
+    end
+end
+
+def fun_l26_n612(x)
+    if (x < 1)
+        fun_l27_n377(x)
+    else
+        fun_l27_n387(x)
+    end
+end
+
+def fun_l26_n613(x)
+    if (x < 1)
+        fun_l27_n809(x)
+    else
+        fun_l27_n802(x)
+    end
+end
+
+def fun_l26_n614(x)
+    if (x < 1)
+        fun_l27_n984(x)
+    else
+        fun_l27_n683(x)
+    end
+end
+
+def fun_l26_n615(x)
+    if (x < 1)
+        fun_l27_n330(x)
+    else
+        fun_l27_n439(x)
+    end
+end
+
+def fun_l26_n616(x)
+    if (x < 1)
+        fun_l27_n16(x)
+    else
+        fun_l27_n831(x)
+    end
+end
+
+def fun_l26_n617(x)
+    if (x < 1)
+        fun_l27_n149(x)
+    else
+        fun_l27_n934(x)
+    end
+end
+
+def fun_l26_n618(x)
+    if (x < 1)
+        fun_l27_n383(x)
+    else
+        fun_l27_n439(x)
+    end
+end
+
+def fun_l26_n619(x)
+    if (x < 1)
+        fun_l27_n599(x)
+    else
+        fun_l27_n855(x)
+    end
+end
+
+def fun_l26_n620(x)
+    if (x < 1)
+        fun_l27_n202(x)
+    else
+        fun_l27_n902(x)
+    end
+end
+
+def fun_l26_n621(x)
+    if (x < 1)
+        fun_l27_n219(x)
+    else
+        fun_l27_n13(x)
+    end
+end
+
+def fun_l26_n622(x)
+    if (x < 1)
+        fun_l27_n473(x)
+    else
+        fun_l27_n12(x)
+    end
+end
+
+def fun_l26_n623(x)
+    if (x < 1)
+        fun_l27_n918(x)
+    else
+        fun_l27_n50(x)
+    end
+end
+
+def fun_l26_n624(x)
+    if (x < 1)
+        fun_l27_n585(x)
+    else
+        fun_l27_n902(x)
+    end
+end
+
+def fun_l26_n625(x)
+    if (x < 1)
+        fun_l27_n676(x)
+    else
+        fun_l27_n533(x)
+    end
+end
+
+def fun_l26_n626(x)
+    if (x < 1)
+        fun_l27_n122(x)
+    else
+        fun_l27_n823(x)
+    end
+end
+
+def fun_l26_n627(x)
+    if (x < 1)
+        fun_l27_n214(x)
+    else
+        fun_l27_n485(x)
+    end
+end
+
+def fun_l26_n628(x)
+    if (x < 1)
+        fun_l27_n453(x)
+    else
+        fun_l27_n312(x)
+    end
+end
+
+def fun_l26_n629(x)
+    if (x < 1)
+        fun_l27_n929(x)
+    else
+        fun_l27_n272(x)
+    end
+end
+
+def fun_l26_n630(x)
+    if (x < 1)
+        fun_l27_n546(x)
+    else
+        fun_l27_n950(x)
+    end
+end
+
+def fun_l26_n631(x)
+    if (x < 1)
+        fun_l27_n222(x)
+    else
+        fun_l27_n780(x)
+    end
+end
+
+def fun_l26_n632(x)
+    if (x < 1)
+        fun_l27_n878(x)
+    else
+        fun_l27_n721(x)
+    end
+end
+
+def fun_l26_n633(x)
+    if (x < 1)
+        fun_l27_n611(x)
+    else
+        fun_l27_n15(x)
+    end
+end
+
+def fun_l26_n634(x)
+    if (x < 1)
+        fun_l27_n728(x)
+    else
+        fun_l27_n848(x)
+    end
+end
+
+def fun_l26_n635(x)
+    if (x < 1)
+        fun_l27_n489(x)
+    else
+        fun_l27_n3(x)
+    end
+end
+
+def fun_l26_n636(x)
+    if (x < 1)
+        fun_l27_n138(x)
+    else
+        fun_l27_n231(x)
+    end
+end
+
+def fun_l26_n637(x)
+    if (x < 1)
+        fun_l27_n861(x)
+    else
+        fun_l27_n115(x)
+    end
+end
+
+def fun_l26_n638(x)
+    if (x < 1)
+        fun_l27_n7(x)
+    else
+        fun_l27_n894(x)
+    end
+end
+
+def fun_l26_n639(x)
+    if (x < 1)
+        fun_l27_n683(x)
+    else
+        fun_l27_n964(x)
+    end
+end
+
+def fun_l26_n640(x)
+    if (x < 1)
+        fun_l27_n100(x)
+    else
+        fun_l27_n40(x)
+    end
+end
+
+def fun_l26_n641(x)
+    if (x < 1)
+        fun_l27_n744(x)
+    else
+        fun_l27_n855(x)
+    end
+end
+
+def fun_l26_n642(x)
+    if (x < 1)
+        fun_l27_n923(x)
+    else
+        fun_l27_n664(x)
+    end
+end
+
+def fun_l26_n643(x)
+    if (x < 1)
+        fun_l27_n150(x)
+    else
+        fun_l27_n713(x)
+    end
+end
+
+def fun_l26_n644(x)
+    if (x < 1)
+        fun_l27_n95(x)
+    else
+        fun_l27_n566(x)
+    end
+end
+
+def fun_l26_n645(x)
+    if (x < 1)
+        fun_l27_n886(x)
+    else
+        fun_l27_n811(x)
+    end
+end
+
+def fun_l26_n646(x)
+    if (x < 1)
+        fun_l27_n547(x)
+    else
+        fun_l27_n412(x)
+    end
+end
+
+def fun_l26_n647(x)
+    if (x < 1)
+        fun_l27_n570(x)
+    else
+        fun_l27_n606(x)
+    end
+end
+
+def fun_l26_n648(x)
+    if (x < 1)
+        fun_l27_n181(x)
+    else
+        fun_l27_n216(x)
+    end
+end
+
+def fun_l26_n649(x)
+    if (x < 1)
+        fun_l27_n198(x)
+    else
+        fun_l27_n988(x)
+    end
+end
+
+def fun_l26_n650(x)
+    if (x < 1)
+        fun_l27_n503(x)
+    else
+        fun_l27_n257(x)
+    end
+end
+
+def fun_l26_n651(x)
+    if (x < 1)
+        fun_l27_n799(x)
+    else
+        fun_l27_n175(x)
+    end
+end
+
+def fun_l26_n652(x)
+    if (x < 1)
+        fun_l27_n338(x)
+    else
+        fun_l27_n560(x)
+    end
+end
+
+def fun_l26_n653(x)
+    if (x < 1)
+        fun_l27_n597(x)
+    else
+        fun_l27_n988(x)
+    end
+end
+
+def fun_l26_n654(x)
+    if (x < 1)
+        fun_l27_n319(x)
+    else
+        fun_l27_n299(x)
+    end
+end
+
+def fun_l26_n655(x)
+    if (x < 1)
+        fun_l27_n510(x)
+    else
+        fun_l27_n375(x)
+    end
+end
+
+def fun_l26_n656(x)
+    if (x < 1)
+        fun_l27_n808(x)
+    else
+        fun_l27_n289(x)
+    end
+end
+
+def fun_l26_n657(x)
+    if (x < 1)
+        fun_l27_n170(x)
+    else
+        fun_l27_n64(x)
+    end
+end
+
+def fun_l26_n658(x)
+    if (x < 1)
+        fun_l27_n966(x)
+    else
+        fun_l27_n487(x)
+    end
+end
+
+def fun_l26_n659(x)
+    if (x < 1)
+        fun_l27_n238(x)
+    else
+        fun_l27_n638(x)
+    end
+end
+
+def fun_l26_n660(x)
+    if (x < 1)
+        fun_l27_n814(x)
+    else
+        fun_l27_n203(x)
+    end
+end
+
+def fun_l26_n661(x)
+    if (x < 1)
+        fun_l27_n840(x)
+    else
+        fun_l27_n867(x)
+    end
+end
+
+def fun_l26_n662(x)
+    if (x < 1)
+        fun_l27_n753(x)
+    else
+        fun_l27_n543(x)
+    end
+end
+
+def fun_l26_n663(x)
+    if (x < 1)
+        fun_l27_n850(x)
+    else
+        fun_l27_n539(x)
+    end
+end
+
+def fun_l26_n664(x)
+    if (x < 1)
+        fun_l27_n878(x)
+    else
+        fun_l27_n648(x)
+    end
+end
+
+def fun_l26_n665(x)
+    if (x < 1)
+        fun_l27_n256(x)
+    else
+        fun_l27_n243(x)
+    end
+end
+
+def fun_l26_n666(x)
+    if (x < 1)
+        fun_l27_n833(x)
+    else
+        fun_l27_n251(x)
+    end
+end
+
+def fun_l26_n667(x)
+    if (x < 1)
+        fun_l27_n26(x)
+    else
+        fun_l27_n206(x)
+    end
+end
+
+def fun_l26_n668(x)
+    if (x < 1)
+        fun_l27_n860(x)
+    else
+        fun_l27_n736(x)
+    end
+end
+
+def fun_l26_n669(x)
+    if (x < 1)
+        fun_l27_n794(x)
+    else
+        fun_l27_n185(x)
+    end
+end
+
+def fun_l26_n670(x)
+    if (x < 1)
+        fun_l27_n849(x)
+    else
+        fun_l27_n218(x)
+    end
+end
+
+def fun_l26_n671(x)
+    if (x < 1)
+        fun_l27_n423(x)
+    else
+        fun_l27_n163(x)
+    end
+end
+
+def fun_l26_n672(x)
+    if (x < 1)
+        fun_l27_n94(x)
+    else
+        fun_l27_n341(x)
+    end
+end
+
+def fun_l26_n673(x)
+    if (x < 1)
+        fun_l27_n927(x)
+    else
+        fun_l27_n721(x)
+    end
+end
+
+def fun_l26_n674(x)
+    if (x < 1)
+        fun_l27_n390(x)
+    else
+        fun_l27_n807(x)
+    end
+end
+
+def fun_l26_n675(x)
+    if (x < 1)
+        fun_l27_n818(x)
+    else
+        fun_l27_n532(x)
+    end
+end
+
+def fun_l26_n676(x)
+    if (x < 1)
+        fun_l27_n513(x)
+    else
+        fun_l27_n414(x)
+    end
+end
+
+def fun_l26_n677(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n940(x)
+    end
+end
+
+def fun_l26_n678(x)
+    if (x < 1)
+        fun_l27_n178(x)
+    else
+        fun_l27_n857(x)
+    end
+end
+
+def fun_l26_n679(x)
+    if (x < 1)
+        fun_l27_n806(x)
+    else
+        fun_l27_n838(x)
+    end
+end
+
+def fun_l26_n680(x)
+    if (x < 1)
+        fun_l27_n216(x)
+    else
+        fun_l27_n774(x)
+    end
+end
+
+def fun_l26_n681(x)
+    if (x < 1)
+        fun_l27_n969(x)
+    else
+        fun_l27_n247(x)
+    end
+end
+
+def fun_l26_n682(x)
+    if (x < 1)
+        fun_l27_n175(x)
+    else
+        fun_l27_n588(x)
+    end
+end
+
+def fun_l26_n683(x)
+    if (x < 1)
+        fun_l27_n310(x)
+    else
+        fun_l27_n48(x)
+    end
+end
+
+def fun_l26_n684(x)
+    if (x < 1)
+        fun_l27_n669(x)
+    else
+        fun_l27_n428(x)
+    end
+end
+
+def fun_l26_n685(x)
+    if (x < 1)
+        fun_l27_n592(x)
+    else
+        fun_l27_n535(x)
+    end
+end
+
+def fun_l26_n686(x)
+    if (x < 1)
+        fun_l27_n81(x)
+    else
+        fun_l27_n259(x)
+    end
+end
+
+def fun_l26_n687(x)
+    if (x < 1)
+        fun_l27_n498(x)
+    else
+        fun_l27_n859(x)
+    end
+end
+
+def fun_l26_n688(x)
+    if (x < 1)
+        fun_l27_n695(x)
+    else
+        fun_l27_n67(x)
+    end
+end
+
+def fun_l26_n689(x)
+    if (x < 1)
+        fun_l27_n97(x)
+    else
+        fun_l27_n11(x)
+    end
+end
+
+def fun_l26_n690(x)
+    if (x < 1)
+        fun_l27_n901(x)
+    else
+        fun_l27_n525(x)
+    end
+end
+
+def fun_l26_n691(x)
+    if (x < 1)
+        fun_l27_n545(x)
+    else
+        fun_l27_n649(x)
+    end
+end
+
+def fun_l26_n692(x)
+    if (x < 1)
+        fun_l27_n866(x)
+    else
+        fun_l27_n379(x)
+    end
+end
+
+def fun_l26_n693(x)
+    if (x < 1)
+        fun_l27_n475(x)
+    else
+        fun_l27_n504(x)
+    end
+end
+
+def fun_l26_n694(x)
+    if (x < 1)
+        fun_l27_n527(x)
+    else
+        fun_l27_n701(x)
+    end
+end
+
+def fun_l26_n695(x)
+    if (x < 1)
+        fun_l27_n159(x)
+    else
+        fun_l27_n946(x)
+    end
+end
+
+def fun_l26_n696(x)
+    if (x < 1)
+        fun_l27_n850(x)
+    else
+        fun_l27_n200(x)
+    end
+end
+
+def fun_l26_n697(x)
+    if (x < 1)
+        fun_l27_n318(x)
+    else
+        fun_l27_n55(x)
+    end
+end
+
+def fun_l26_n698(x)
+    if (x < 1)
+        fun_l27_n563(x)
+    else
+        fun_l27_n413(x)
+    end
+end
+
+def fun_l26_n699(x)
+    if (x < 1)
+        fun_l27_n976(x)
+    else
+        fun_l27_n42(x)
+    end
+end
+
+def fun_l26_n700(x)
+    if (x < 1)
+        fun_l27_n112(x)
+    else
+        fun_l27_n764(x)
+    end
+end
+
+def fun_l26_n701(x)
+    if (x < 1)
+        fun_l27_n519(x)
+    else
+        fun_l27_n800(x)
+    end
+end
+
+def fun_l26_n702(x)
+    if (x < 1)
+        fun_l27_n701(x)
+    else
+        fun_l27_n102(x)
+    end
+end
+
+def fun_l26_n703(x)
+    if (x < 1)
+        fun_l27_n200(x)
+    else
+        fun_l27_n685(x)
+    end
+end
+
+def fun_l26_n704(x)
+    if (x < 1)
+        fun_l27_n770(x)
+    else
+        fun_l27_n47(x)
+    end
+end
+
+def fun_l26_n705(x)
+    if (x < 1)
+        fun_l27_n479(x)
+    else
+        fun_l27_n875(x)
+    end
+end
+
+def fun_l26_n706(x)
+    if (x < 1)
+        fun_l27_n369(x)
+    else
+        fun_l27_n53(x)
+    end
+end
+
+def fun_l26_n707(x)
+    if (x < 1)
+        fun_l27_n16(x)
+    else
+        fun_l27_n612(x)
+    end
+end
+
+def fun_l26_n708(x)
+    if (x < 1)
+        fun_l27_n235(x)
+    else
+        fun_l27_n211(x)
+    end
+end
+
+def fun_l26_n709(x)
+    if (x < 1)
+        fun_l27_n636(x)
+    else
+        fun_l27_n890(x)
+    end
+end
+
+def fun_l26_n710(x)
+    if (x < 1)
+        fun_l27_n877(x)
+    else
+        fun_l27_n301(x)
+    end
+end
+
+def fun_l26_n711(x)
+    if (x < 1)
+        fun_l27_n783(x)
+    else
+        fun_l27_n409(x)
+    end
+end
+
+def fun_l26_n712(x)
+    if (x < 1)
+        fun_l27_n595(x)
+    else
+        fun_l27_n968(x)
+    end
+end
+
+def fun_l26_n713(x)
+    if (x < 1)
+        fun_l27_n858(x)
+    else
+        fun_l27_n879(x)
+    end
+end
+
+def fun_l26_n714(x)
+    if (x < 1)
+        fun_l27_n66(x)
+    else
+        fun_l27_n107(x)
+    end
+end
+
+def fun_l26_n715(x)
+    if (x < 1)
+        fun_l27_n636(x)
+    else
+        fun_l27_n912(x)
+    end
+end
+
+def fun_l26_n716(x)
+    if (x < 1)
+        fun_l27_n605(x)
+    else
+        fun_l27_n935(x)
+    end
+end
+
+def fun_l26_n717(x)
+    if (x < 1)
+        fun_l27_n186(x)
+    else
+        fun_l27_n664(x)
+    end
+end
+
+def fun_l26_n718(x)
+    if (x < 1)
+        fun_l27_n865(x)
+    else
+        fun_l27_n462(x)
+    end
+end
+
+def fun_l26_n719(x)
+    if (x < 1)
+        fun_l27_n783(x)
+    else
+        fun_l27_n668(x)
+    end
+end
+
+def fun_l26_n720(x)
+    if (x < 1)
+        fun_l27_n697(x)
+    else
+        fun_l27_n850(x)
+    end
+end
+
+def fun_l26_n721(x)
+    if (x < 1)
+        fun_l27_n668(x)
+    else
+        fun_l27_n493(x)
+    end
+end
+
+def fun_l26_n722(x)
+    if (x < 1)
+        fun_l27_n25(x)
+    else
+        fun_l27_n473(x)
+    end
+end
+
+def fun_l26_n723(x)
+    if (x < 1)
+        fun_l27_n311(x)
+    else
+        fun_l27_n380(x)
+    end
+end
+
+def fun_l26_n724(x)
+    if (x < 1)
+        fun_l27_n766(x)
+    else
+        fun_l27_n303(x)
+    end
+end
+
+def fun_l26_n725(x)
+    if (x < 1)
+        fun_l27_n97(x)
+    else
+        fun_l27_n306(x)
+    end
+end
+
+def fun_l26_n726(x)
+    if (x < 1)
+        fun_l27_n333(x)
+    else
+        fun_l27_n590(x)
+    end
+end
+
+def fun_l26_n727(x)
+    if (x < 1)
+        fun_l27_n596(x)
+    else
+        fun_l27_n509(x)
+    end
+end
+
+def fun_l26_n728(x)
+    if (x < 1)
+        fun_l27_n234(x)
+    else
+        fun_l27_n583(x)
+    end
+end
+
+def fun_l26_n729(x)
+    if (x < 1)
+        fun_l27_n692(x)
+    else
+        fun_l27_n890(x)
+    end
+end
+
+def fun_l26_n730(x)
+    if (x < 1)
+        fun_l27_n864(x)
+    else
+        fun_l27_n433(x)
+    end
+end
+
+def fun_l26_n731(x)
+    if (x < 1)
+        fun_l27_n866(x)
+    else
+        fun_l27_n350(x)
+    end
+end
+
+def fun_l26_n732(x)
+    if (x < 1)
+        fun_l27_n913(x)
+    else
+        fun_l27_n651(x)
+    end
+end
+
+def fun_l26_n733(x)
+    if (x < 1)
+        fun_l27_n919(x)
+    else
+        fun_l27_n902(x)
+    end
+end
+
+def fun_l26_n734(x)
+    if (x < 1)
+        fun_l27_n731(x)
+    else
+        fun_l27_n768(x)
+    end
+end
+
+def fun_l26_n735(x)
+    if (x < 1)
+        fun_l27_n613(x)
+    else
+        fun_l27_n550(x)
+    end
+end
+
+def fun_l26_n736(x)
+    if (x < 1)
+        fun_l27_n795(x)
+    else
+        fun_l27_n152(x)
+    end
+end
+
+def fun_l26_n737(x)
+    if (x < 1)
+        fun_l27_n214(x)
+    else
+        fun_l27_n990(x)
+    end
+end
+
+def fun_l26_n738(x)
+    if (x < 1)
+        fun_l27_n521(x)
+    else
+        fun_l27_n773(x)
+    end
+end
+
+def fun_l26_n739(x)
+    if (x < 1)
+        fun_l27_n44(x)
+    else
+        fun_l27_n580(x)
+    end
+end
+
+def fun_l26_n740(x)
+    if (x < 1)
+        fun_l27_n800(x)
+    else
+        fun_l27_n385(x)
+    end
+end
+
+def fun_l26_n741(x)
+    if (x < 1)
+        fun_l27_n412(x)
+    else
+        fun_l27_n979(x)
+    end
+end
+
+def fun_l26_n742(x)
+    if (x < 1)
+        fun_l27_n392(x)
+    else
+        fun_l27_n627(x)
+    end
+end
+
+def fun_l26_n743(x)
+    if (x < 1)
+        fun_l27_n348(x)
+    else
+        fun_l27_n141(x)
+    end
+end
+
+def fun_l26_n744(x)
+    if (x < 1)
+        fun_l27_n199(x)
+    else
+        fun_l27_n327(x)
+    end
+end
+
+def fun_l26_n745(x)
+    if (x < 1)
+        fun_l27_n302(x)
+    else
+        fun_l27_n708(x)
+    end
+end
+
+def fun_l26_n746(x)
+    if (x < 1)
+        fun_l27_n431(x)
+    else
+        fun_l27_n362(x)
+    end
+end
+
+def fun_l26_n747(x)
+    if (x < 1)
+        fun_l27_n409(x)
+    else
+        fun_l27_n102(x)
+    end
+end
+
+def fun_l26_n748(x)
+    if (x < 1)
+        fun_l27_n631(x)
+    else
+        fun_l27_n415(x)
+    end
+end
+
+def fun_l26_n749(x)
+    if (x < 1)
+        fun_l27_n196(x)
+    else
+        fun_l27_n835(x)
+    end
+end
+
+def fun_l26_n750(x)
+    if (x < 1)
+        fun_l27_n731(x)
+    else
+        fun_l27_n400(x)
+    end
+end
+
+def fun_l26_n751(x)
+    if (x < 1)
+        fun_l27_n561(x)
+    else
+        fun_l27_n444(x)
+    end
+end
+
+def fun_l26_n752(x)
+    if (x < 1)
+        fun_l27_n444(x)
+    else
+        fun_l27_n245(x)
+    end
+end
+
+def fun_l26_n753(x)
+    if (x < 1)
+        fun_l27_n784(x)
+    else
+        fun_l27_n640(x)
+    end
+end
+
+def fun_l26_n754(x)
+    if (x < 1)
+        fun_l27_n988(x)
+    else
+        fun_l27_n335(x)
+    end
+end
+
+def fun_l26_n755(x)
+    if (x < 1)
+        fun_l27_n188(x)
+    else
+        fun_l27_n584(x)
+    end
+end
+
+def fun_l26_n756(x)
+    if (x < 1)
+        fun_l27_n356(x)
+    else
+        fun_l27_n989(x)
+    end
+end
+
+def fun_l26_n757(x)
+    if (x < 1)
+        fun_l27_n687(x)
+    else
+        fun_l27_n409(x)
+    end
+end
+
+def fun_l26_n758(x)
+    if (x < 1)
+        fun_l27_n383(x)
+    else
+        fun_l27_n502(x)
+    end
+end
+
+def fun_l26_n759(x)
+    if (x < 1)
+        fun_l27_n507(x)
+    else
+        fun_l27_n868(x)
+    end
+end
+
+def fun_l26_n760(x)
+    if (x < 1)
+        fun_l27_n109(x)
+    else
+        fun_l27_n641(x)
+    end
+end
+
+def fun_l26_n761(x)
+    if (x < 1)
+        fun_l27_n831(x)
+    else
+        fun_l27_n248(x)
+    end
+end
+
+def fun_l26_n762(x)
+    if (x < 1)
+        fun_l27_n150(x)
+    else
+        fun_l27_n116(x)
+    end
+end
+
+def fun_l26_n763(x)
+    if (x < 1)
+        fun_l27_n811(x)
+    else
+        fun_l27_n680(x)
+    end
+end
+
+def fun_l26_n764(x)
+    if (x < 1)
+        fun_l27_n593(x)
+    else
+        fun_l27_n756(x)
+    end
+end
+
+def fun_l26_n765(x)
+    if (x < 1)
+        fun_l27_n468(x)
+    else
+        fun_l27_n888(x)
+    end
+end
+
+def fun_l26_n766(x)
+    if (x < 1)
+        fun_l27_n154(x)
+    else
+        fun_l27_n65(x)
+    end
+end
+
+def fun_l26_n767(x)
+    if (x < 1)
+        fun_l27_n709(x)
+    else
+        fun_l27_n878(x)
+    end
+end
+
+def fun_l26_n768(x)
+    if (x < 1)
+        fun_l27_n270(x)
+    else
+        fun_l27_n393(x)
+    end
+end
+
+def fun_l26_n769(x)
+    if (x < 1)
+        fun_l27_n315(x)
+    else
+        fun_l27_n46(x)
+    end
+end
+
+def fun_l26_n770(x)
+    if (x < 1)
+        fun_l27_n448(x)
+    else
+        fun_l27_n364(x)
+    end
+end
+
+def fun_l26_n771(x)
+    if (x < 1)
+        fun_l27_n865(x)
+    else
+        fun_l27_n842(x)
+    end
+end
+
+def fun_l26_n772(x)
+    if (x < 1)
+        fun_l27_n231(x)
+    else
+        fun_l27_n731(x)
+    end
+end
+
+def fun_l26_n773(x)
+    if (x < 1)
+        fun_l27_n303(x)
+    else
+        fun_l27_n769(x)
+    end
+end
+
+def fun_l26_n774(x)
+    if (x < 1)
+        fun_l27_n257(x)
+    else
+        fun_l27_n513(x)
+    end
+end
+
+def fun_l26_n775(x)
+    if (x < 1)
+        fun_l27_n805(x)
+    else
+        fun_l27_n947(x)
+    end
+end
+
+def fun_l26_n776(x)
+    if (x < 1)
+        fun_l27_n199(x)
+    else
+        fun_l27_n413(x)
+    end
+end
+
+def fun_l26_n777(x)
+    if (x < 1)
+        fun_l27_n631(x)
+    else
+        fun_l27_n734(x)
+    end
+end
+
+def fun_l26_n778(x)
+    if (x < 1)
+        fun_l27_n978(x)
+    else
+        fun_l27_n638(x)
+    end
+end
+
+def fun_l26_n779(x)
+    if (x < 1)
+        fun_l27_n441(x)
+    else
+        fun_l27_n936(x)
+    end
+end
+
+def fun_l26_n780(x)
+    if (x < 1)
+        fun_l27_n120(x)
+    else
+        fun_l27_n37(x)
+    end
+end
+
+def fun_l26_n781(x)
+    if (x < 1)
+        fun_l27_n44(x)
+    else
+        fun_l27_n240(x)
+    end
+end
+
+def fun_l26_n782(x)
+    if (x < 1)
+        fun_l27_n920(x)
+    else
+        fun_l27_n54(x)
+    end
+end
+
+def fun_l26_n783(x)
+    if (x < 1)
+        fun_l27_n488(x)
+    else
+        fun_l27_n965(x)
+    end
+end
+
+def fun_l26_n784(x)
+    if (x < 1)
+        fun_l27_n226(x)
+    else
+        fun_l27_n449(x)
+    end
+end
+
+def fun_l26_n785(x)
+    if (x < 1)
+        fun_l27_n794(x)
+    else
+        fun_l27_n469(x)
+    end
+end
+
+def fun_l26_n786(x)
+    if (x < 1)
+        fun_l27_n287(x)
+    else
+        fun_l27_n863(x)
+    end
+end
+
+def fun_l26_n787(x)
+    if (x < 1)
+        fun_l27_n714(x)
+    else
+        fun_l27_n606(x)
+    end
+end
+
+def fun_l26_n788(x)
+    if (x < 1)
+        fun_l27_n649(x)
+    else
+        fun_l27_n347(x)
+    end
+end
+
+def fun_l26_n789(x)
+    if (x < 1)
+        fun_l27_n176(x)
+    else
+        fun_l27_n410(x)
+    end
+end
+
+def fun_l26_n790(x)
+    if (x < 1)
+        fun_l27_n688(x)
+    else
+        fun_l27_n248(x)
+    end
+end
+
+def fun_l26_n791(x)
+    if (x < 1)
+        fun_l27_n157(x)
+    else
+        fun_l27_n119(x)
+    end
+end
+
+def fun_l26_n792(x)
+    if (x < 1)
+        fun_l27_n470(x)
+    else
+        fun_l27_n657(x)
+    end
+end
+
+def fun_l26_n793(x)
+    if (x < 1)
+        fun_l27_n246(x)
+    else
+        fun_l27_n262(x)
+    end
+end
+
+def fun_l26_n794(x)
+    if (x < 1)
+        fun_l27_n142(x)
+    else
+        fun_l27_n524(x)
+    end
+end
+
+def fun_l26_n795(x)
+    if (x < 1)
+        fun_l27_n695(x)
+    else
+        fun_l27_n88(x)
+    end
+end
+
+def fun_l26_n796(x)
+    if (x < 1)
+        fun_l27_n599(x)
+    else
+        fun_l27_n776(x)
+    end
+end
+
+def fun_l26_n797(x)
+    if (x < 1)
+        fun_l27_n364(x)
+    else
+        fun_l27_n616(x)
+    end
+end
+
+def fun_l26_n798(x)
+    if (x < 1)
+        fun_l27_n793(x)
+    else
+        fun_l27_n416(x)
+    end
+end
+
+def fun_l26_n799(x)
+    if (x < 1)
+        fun_l27_n552(x)
+    else
+        fun_l27_n490(x)
+    end
+end
+
+def fun_l26_n800(x)
+    if (x < 1)
+        fun_l27_n691(x)
+    else
+        fun_l27_n743(x)
+    end
+end
+
+def fun_l26_n801(x)
+    if (x < 1)
+        fun_l27_n257(x)
+    else
+        fun_l27_n687(x)
+    end
+end
+
+def fun_l26_n802(x)
+    if (x < 1)
+        fun_l27_n877(x)
+    else
+        fun_l27_n273(x)
+    end
+end
+
+def fun_l26_n803(x)
+    if (x < 1)
+        fun_l27_n398(x)
+    else
+        fun_l27_n874(x)
+    end
+end
+
+def fun_l26_n804(x)
+    if (x < 1)
+        fun_l27_n114(x)
+    else
+        fun_l27_n96(x)
+    end
+end
+
+def fun_l26_n805(x)
+    if (x < 1)
+        fun_l27_n489(x)
+    else
+        fun_l27_n537(x)
+    end
+end
+
+def fun_l26_n806(x)
+    if (x < 1)
+        fun_l27_n619(x)
+    else
+        fun_l27_n813(x)
+    end
+end
+
+def fun_l26_n807(x)
+    if (x < 1)
+        fun_l27_n335(x)
+    else
+        fun_l27_n467(x)
+    end
+end
+
+def fun_l26_n808(x)
+    if (x < 1)
+        fun_l27_n17(x)
+    else
+        fun_l27_n133(x)
+    end
+end
+
+def fun_l26_n809(x)
+    if (x < 1)
+        fun_l27_n266(x)
+    else
+        fun_l27_n383(x)
+    end
+end
+
+def fun_l26_n810(x)
+    if (x < 1)
+        fun_l27_n391(x)
+    else
+        fun_l27_n326(x)
+    end
+end
+
+def fun_l26_n811(x)
+    if (x < 1)
+        fun_l27_n292(x)
+    else
+        fun_l27_n444(x)
+    end
+end
+
+def fun_l26_n812(x)
+    if (x < 1)
+        fun_l27_n920(x)
+    else
+        fun_l27_n909(x)
+    end
+end
+
+def fun_l26_n813(x)
+    if (x < 1)
+        fun_l27_n575(x)
+    else
+        fun_l27_n221(x)
+    end
+end
+
+def fun_l26_n814(x)
+    if (x < 1)
+        fun_l27_n66(x)
+    else
+        fun_l27_n241(x)
+    end
+end
+
+def fun_l26_n815(x)
+    if (x < 1)
+        fun_l27_n552(x)
+    else
+        fun_l27_n906(x)
+    end
+end
+
+def fun_l26_n816(x)
+    if (x < 1)
+        fun_l27_n301(x)
+    else
+        fun_l27_n656(x)
+    end
+end
+
+def fun_l26_n817(x)
+    if (x < 1)
+        fun_l27_n472(x)
+    else
+        fun_l27_n688(x)
+    end
+end
+
+def fun_l26_n818(x)
+    if (x < 1)
+        fun_l27_n712(x)
+    else
+        fun_l27_n830(x)
+    end
+end
+
+def fun_l26_n819(x)
+    if (x < 1)
+        fun_l27_n102(x)
+    else
+        fun_l27_n146(x)
+    end
+end
+
+def fun_l26_n820(x)
+    if (x < 1)
+        fun_l27_n448(x)
+    else
+        fun_l27_n207(x)
+    end
+end
+
+def fun_l26_n821(x)
+    if (x < 1)
+        fun_l27_n732(x)
+    else
+        fun_l27_n285(x)
+    end
+end
+
+def fun_l26_n822(x)
+    if (x < 1)
+        fun_l27_n973(x)
+    else
+        fun_l27_n395(x)
+    end
+end
+
+def fun_l26_n823(x)
+    if (x < 1)
+        fun_l27_n329(x)
+    else
+        fun_l27_n748(x)
+    end
+end
+
+def fun_l26_n824(x)
+    if (x < 1)
+        fun_l27_n280(x)
+    else
+        fun_l27_n676(x)
+    end
+end
+
+def fun_l26_n825(x)
+    if (x < 1)
+        fun_l27_n867(x)
+    else
+        fun_l27_n285(x)
+    end
+end
+
+def fun_l26_n826(x)
+    if (x < 1)
+        fun_l27_n380(x)
+    else
+        fun_l27_n720(x)
+    end
+end
+
+def fun_l26_n827(x)
+    if (x < 1)
+        fun_l27_n595(x)
+    else
+        fun_l27_n740(x)
+    end
+end
+
+def fun_l26_n828(x)
+    if (x < 1)
+        fun_l27_n356(x)
+    else
+        fun_l27_n878(x)
+    end
+end
+
+def fun_l26_n829(x)
+    if (x < 1)
+        fun_l27_n453(x)
+    else
+        fun_l27_n234(x)
+    end
+end
+
+def fun_l26_n830(x)
+    if (x < 1)
+        fun_l27_n775(x)
+    else
+        fun_l27_n13(x)
+    end
+end
+
+def fun_l26_n831(x)
+    if (x < 1)
+        fun_l27_n242(x)
+    else
+        fun_l27_n144(x)
+    end
+end
+
+def fun_l26_n832(x)
+    if (x < 1)
+        fun_l27_n734(x)
+    else
+        fun_l27_n432(x)
+    end
+end
+
+def fun_l26_n833(x)
+    if (x < 1)
+        fun_l27_n996(x)
+    else
+        fun_l27_n396(x)
+    end
+end
+
+def fun_l26_n834(x)
+    if (x < 1)
+        fun_l27_n367(x)
+    else
+        fun_l27_n991(x)
+    end
+end
+
+def fun_l26_n835(x)
+    if (x < 1)
+        fun_l27_n285(x)
+    else
+        fun_l27_n526(x)
+    end
+end
+
+def fun_l26_n836(x)
+    if (x < 1)
+        fun_l27_n945(x)
+    else
+        fun_l27_n418(x)
+    end
+end
+
+def fun_l26_n837(x)
+    if (x < 1)
+        fun_l27_n622(x)
+    else
+        fun_l27_n922(x)
+    end
+end
+
+def fun_l26_n838(x)
+    if (x < 1)
+        fun_l27_n997(x)
+    else
+        fun_l27_n786(x)
+    end
+end
+
+def fun_l26_n839(x)
+    if (x < 1)
+        fun_l27_n478(x)
+    else
+        fun_l27_n991(x)
+    end
+end
+
+def fun_l26_n840(x)
+    if (x < 1)
+        fun_l27_n473(x)
+    else
+        fun_l27_n801(x)
+    end
+end
+
+def fun_l26_n841(x)
+    if (x < 1)
+        fun_l27_n675(x)
+    else
+        fun_l27_n486(x)
+    end
+end
+
+def fun_l26_n842(x)
+    if (x < 1)
+        fun_l27_n170(x)
+    else
+        fun_l27_n27(x)
+    end
+end
+
+def fun_l26_n843(x)
+    if (x < 1)
+        fun_l27_n699(x)
+    else
+        fun_l27_n536(x)
+    end
+end
+
+def fun_l26_n844(x)
+    if (x < 1)
+        fun_l27_n388(x)
+    else
+        fun_l27_n431(x)
+    end
+end
+
+def fun_l26_n845(x)
+    if (x < 1)
+        fun_l27_n248(x)
+    else
+        fun_l27_n64(x)
+    end
+end
+
+def fun_l26_n846(x)
+    if (x < 1)
+        fun_l27_n64(x)
+    else
+        fun_l27_n829(x)
+    end
+end
+
+def fun_l26_n847(x)
+    if (x < 1)
+        fun_l27_n850(x)
+    else
+        fun_l27_n626(x)
+    end
+end
+
+def fun_l26_n848(x)
+    if (x < 1)
+        fun_l27_n889(x)
+    else
+        fun_l27_n504(x)
+    end
+end
+
+def fun_l26_n849(x)
+    if (x < 1)
+        fun_l27_n121(x)
+    else
+        fun_l27_n864(x)
+    end
+end
+
+def fun_l26_n850(x)
+    if (x < 1)
+        fun_l27_n985(x)
+    else
+        fun_l27_n447(x)
+    end
+end
+
+def fun_l26_n851(x)
+    if (x < 1)
+        fun_l27_n952(x)
+    else
+        fun_l27_n30(x)
+    end
+end
+
+def fun_l26_n852(x)
+    if (x < 1)
+        fun_l27_n444(x)
+    else
+        fun_l27_n780(x)
+    end
+end
+
+def fun_l26_n853(x)
+    if (x < 1)
+        fun_l27_n969(x)
+    else
+        fun_l27_n400(x)
+    end
+end
+
+def fun_l26_n854(x)
+    if (x < 1)
+        fun_l27_n711(x)
+    else
+        fun_l27_n165(x)
+    end
+end
+
+def fun_l26_n855(x)
+    if (x < 1)
+        fun_l27_n514(x)
+    else
+        fun_l27_n464(x)
+    end
+end
+
+def fun_l26_n856(x)
+    if (x < 1)
+        fun_l27_n531(x)
+    else
+        fun_l27_n548(x)
+    end
+end
+
+def fun_l26_n857(x)
+    if (x < 1)
+        fun_l27_n996(x)
+    else
+        fun_l27_n63(x)
+    end
+end
+
+def fun_l26_n858(x)
+    if (x < 1)
+        fun_l27_n516(x)
+    else
+        fun_l27_n905(x)
+    end
+end
+
+def fun_l26_n859(x)
+    if (x < 1)
+        fun_l27_n42(x)
+    else
+        fun_l27_n327(x)
+    end
+end
+
+def fun_l26_n860(x)
+    if (x < 1)
+        fun_l27_n300(x)
+    else
+        fun_l27_n276(x)
+    end
+end
+
+def fun_l26_n861(x)
+    if (x < 1)
+        fun_l27_n734(x)
+    else
+        fun_l27_n859(x)
+    end
+end
+
+def fun_l26_n862(x)
+    if (x < 1)
+        fun_l27_n135(x)
+    else
+        fun_l27_n821(x)
+    end
+end
+
+def fun_l26_n863(x)
+    if (x < 1)
+        fun_l27_n645(x)
+    else
+        fun_l27_n287(x)
+    end
+end
+
+def fun_l26_n864(x)
+    if (x < 1)
+        fun_l27_n243(x)
+    else
+        fun_l27_n844(x)
+    end
+end
+
+def fun_l26_n865(x)
+    if (x < 1)
+        fun_l27_n909(x)
+    else
+        fun_l27_n291(x)
+    end
+end
+
+def fun_l26_n866(x)
+    if (x < 1)
+        fun_l27_n925(x)
+    else
+        fun_l27_n484(x)
+    end
+end
+
+def fun_l26_n867(x)
+    if (x < 1)
+        fun_l27_n678(x)
+    else
+        fun_l27_n205(x)
+    end
+end
+
+def fun_l26_n868(x)
+    if (x < 1)
+        fun_l27_n612(x)
+    else
+        fun_l27_n339(x)
+    end
+end
+
+def fun_l26_n869(x)
+    if (x < 1)
+        fun_l27_n622(x)
+    else
+        fun_l27_n246(x)
+    end
+end
+
+def fun_l26_n870(x)
+    if (x < 1)
+        fun_l27_n431(x)
+    else
+        fun_l27_n635(x)
+    end
+end
+
+def fun_l26_n871(x)
+    if (x < 1)
+        fun_l27_n89(x)
+    else
+        fun_l27_n969(x)
+    end
+end
+
+def fun_l26_n872(x)
+    if (x < 1)
+        fun_l27_n839(x)
+    else
+        fun_l27_n398(x)
+    end
+end
+
+def fun_l26_n873(x)
+    if (x < 1)
+        fun_l27_n230(x)
+    else
+        fun_l27_n885(x)
+    end
+end
+
+def fun_l26_n874(x)
+    if (x < 1)
+        fun_l27_n202(x)
+    else
+        fun_l27_n530(x)
+    end
+end
+
+def fun_l26_n875(x)
+    if (x < 1)
+        fun_l27_n153(x)
+    else
+        fun_l27_n959(x)
+    end
+end
+
+def fun_l26_n876(x)
+    if (x < 1)
+        fun_l27_n891(x)
+    else
+        fun_l27_n307(x)
+    end
+end
+
+def fun_l26_n877(x)
+    if (x < 1)
+        fun_l27_n648(x)
+    else
+        fun_l27_n767(x)
+    end
+end
+
+def fun_l26_n878(x)
+    if (x < 1)
+        fun_l27_n120(x)
+    else
+        fun_l27_n614(x)
+    end
+end
+
+def fun_l26_n879(x)
+    if (x < 1)
+        fun_l27_n46(x)
+    else
+        fun_l27_n766(x)
+    end
+end
+
+def fun_l26_n880(x)
+    if (x < 1)
+        fun_l27_n882(x)
+    else
+        fun_l27_n745(x)
+    end
+end
+
+def fun_l26_n881(x)
+    if (x < 1)
+        fun_l27_n966(x)
+    else
+        fun_l27_n699(x)
+    end
+end
+
+def fun_l26_n882(x)
+    if (x < 1)
+        fun_l27_n354(x)
+    else
+        fun_l27_n698(x)
+    end
+end
+
+def fun_l26_n883(x)
+    if (x < 1)
+        fun_l27_n723(x)
+    else
+        fun_l27_n507(x)
+    end
+end
+
+def fun_l26_n884(x)
+    if (x < 1)
+        fun_l27_n705(x)
+    else
+        fun_l27_n865(x)
+    end
+end
+
+def fun_l26_n885(x)
+    if (x < 1)
+        fun_l27_n609(x)
+    else
+        fun_l27_n830(x)
+    end
+end
+
+def fun_l26_n886(x)
+    if (x < 1)
+        fun_l27_n679(x)
+    else
+        fun_l27_n359(x)
+    end
+end
+
+def fun_l26_n887(x)
+    if (x < 1)
+        fun_l27_n830(x)
+    else
+        fun_l27_n59(x)
+    end
+end
+
+def fun_l26_n888(x)
+    if (x < 1)
+        fun_l27_n160(x)
+    else
+        fun_l27_n559(x)
+    end
+end
+
+def fun_l26_n889(x)
+    if (x < 1)
+        fun_l27_n233(x)
+    else
+        fun_l27_n148(x)
+    end
+end
+
+def fun_l26_n890(x)
+    if (x < 1)
+        fun_l27_n520(x)
+    else
+        fun_l27_n104(x)
+    end
+end
+
+def fun_l26_n891(x)
+    if (x < 1)
+        fun_l27_n826(x)
+    else
+        fun_l27_n884(x)
+    end
+end
+
+def fun_l26_n892(x)
+    if (x < 1)
+        fun_l27_n546(x)
+    else
+        fun_l27_n651(x)
+    end
+end
+
+def fun_l26_n893(x)
+    if (x < 1)
+        fun_l27_n181(x)
+    else
+        fun_l27_n430(x)
+    end
+end
+
+def fun_l26_n894(x)
+    if (x < 1)
+        fun_l27_n540(x)
+    else
+        fun_l27_n424(x)
+    end
+end
+
+def fun_l26_n895(x)
+    if (x < 1)
+        fun_l27_n321(x)
+    else
+        fun_l27_n72(x)
+    end
+end
+
+def fun_l26_n896(x)
+    if (x < 1)
+        fun_l27_n532(x)
+    else
+        fun_l27_n535(x)
+    end
+end
+
+def fun_l26_n897(x)
+    if (x < 1)
+        fun_l27_n171(x)
+    else
+        fun_l27_n575(x)
+    end
+end
+
+def fun_l26_n898(x)
+    if (x < 1)
+        fun_l27_n150(x)
+    else
+        fun_l27_n539(x)
+    end
+end
+
+def fun_l26_n899(x)
+    if (x < 1)
+        fun_l27_n27(x)
+    else
+        fun_l27_n487(x)
+    end
+end
+
+def fun_l26_n900(x)
+    if (x < 1)
+        fun_l27_n484(x)
+    else
+        fun_l27_n366(x)
+    end
+end
+
+def fun_l26_n901(x)
+    if (x < 1)
+        fun_l27_n708(x)
+    else
+        fun_l27_n624(x)
+    end
+end
+
+def fun_l26_n902(x)
+    if (x < 1)
+        fun_l27_n811(x)
+    else
+        fun_l27_n905(x)
+    end
+end
+
+def fun_l26_n903(x)
+    if (x < 1)
+        fun_l27_n474(x)
+    else
+        fun_l27_n252(x)
+    end
+end
+
+def fun_l26_n904(x)
+    if (x < 1)
+        fun_l27_n765(x)
+    else
+        fun_l27_n86(x)
+    end
+end
+
+def fun_l26_n905(x)
+    if (x < 1)
+        fun_l27_n120(x)
+    else
+        fun_l27_n868(x)
+    end
+end
+
+def fun_l26_n906(x)
+    if (x < 1)
+        fun_l27_n824(x)
+    else
+        fun_l27_n167(x)
+    end
+end
+
+def fun_l26_n907(x)
+    if (x < 1)
+        fun_l27_n874(x)
+    else
+        fun_l27_n428(x)
+    end
+end
+
+def fun_l26_n908(x)
+    if (x < 1)
+        fun_l27_n270(x)
+    else
+        fun_l27_n539(x)
+    end
+end
+
+def fun_l26_n909(x)
+    if (x < 1)
+        fun_l27_n451(x)
+    else
+        fun_l27_n64(x)
+    end
+end
+
+def fun_l26_n910(x)
+    if (x < 1)
+        fun_l27_n680(x)
+    else
+        fun_l27_n556(x)
+    end
+end
+
+def fun_l26_n911(x)
+    if (x < 1)
+        fun_l27_n480(x)
+    else
+        fun_l27_n599(x)
+    end
+end
+
+def fun_l26_n912(x)
+    if (x < 1)
+        fun_l27_n861(x)
+    else
+        fun_l27_n768(x)
+    end
+end
+
+def fun_l26_n913(x)
+    if (x < 1)
+        fun_l27_n679(x)
+    else
+        fun_l27_n541(x)
+    end
+end
+
+def fun_l26_n914(x)
+    if (x < 1)
+        fun_l27_n69(x)
+    else
+        fun_l27_n904(x)
+    end
+end
+
+def fun_l26_n915(x)
+    if (x < 1)
+        fun_l27_n658(x)
+    else
+        fun_l27_n580(x)
+    end
+end
+
+def fun_l26_n916(x)
+    if (x < 1)
+        fun_l27_n595(x)
+    else
+        fun_l27_n194(x)
+    end
+end
+
+def fun_l26_n917(x)
+    if (x < 1)
+        fun_l27_n518(x)
+    else
+        fun_l27_n613(x)
+    end
+end
+
+def fun_l26_n918(x)
+    if (x < 1)
+        fun_l27_n46(x)
+    else
+        fun_l27_n910(x)
+    end
+end
+
+def fun_l26_n919(x)
+    if (x < 1)
+        fun_l27_n471(x)
+    else
+        fun_l27_n562(x)
+    end
+end
+
+def fun_l26_n920(x)
+    if (x < 1)
+        fun_l27_n637(x)
+    else
+        fun_l27_n638(x)
+    end
+end
+
+def fun_l26_n921(x)
+    if (x < 1)
+        fun_l27_n77(x)
+    else
+        fun_l27_n100(x)
+    end
+end
+
+def fun_l26_n922(x)
+    if (x < 1)
+        fun_l27_n382(x)
+    else
+        fun_l27_n235(x)
+    end
+end
+
+def fun_l26_n923(x)
+    if (x < 1)
+        fun_l27_n576(x)
+    else
+        fun_l27_n404(x)
+    end
+end
+
+def fun_l26_n924(x)
+    if (x < 1)
+        fun_l27_n338(x)
+    else
+        fun_l27_n919(x)
+    end
+end
+
+def fun_l26_n925(x)
+    if (x < 1)
+        fun_l27_n758(x)
+    else
+        fun_l27_n141(x)
+    end
+end
+
+def fun_l26_n926(x)
+    if (x < 1)
+        fun_l27_n904(x)
+    else
+        fun_l27_n965(x)
+    end
+end
+
+def fun_l26_n927(x)
+    if (x < 1)
+        fun_l27_n149(x)
+    else
+        fun_l27_n707(x)
+    end
+end
+
+def fun_l26_n928(x)
+    if (x < 1)
+        fun_l27_n337(x)
+    else
+        fun_l27_n601(x)
+    end
+end
+
+def fun_l26_n929(x)
+    if (x < 1)
+        fun_l27_n34(x)
+    else
+        fun_l27_n383(x)
+    end
+end
+
+def fun_l26_n930(x)
+    if (x < 1)
+        fun_l27_n937(x)
+    else
+        fun_l27_n656(x)
+    end
+end
+
+def fun_l26_n931(x)
+    if (x < 1)
+        fun_l27_n786(x)
+    else
+        fun_l27_n73(x)
+    end
+end
+
+def fun_l26_n932(x)
+    if (x < 1)
+        fun_l27_n568(x)
+    else
+        fun_l27_n465(x)
+    end
+end
+
+def fun_l26_n933(x)
+    if (x < 1)
+        fun_l27_n552(x)
+    else
+        fun_l27_n557(x)
+    end
+end
+
+def fun_l26_n934(x)
+    if (x < 1)
+        fun_l27_n261(x)
+    else
+        fun_l27_n612(x)
+    end
+end
+
+def fun_l26_n935(x)
+    if (x < 1)
+        fun_l27_n707(x)
+    else
+        fun_l27_n955(x)
+    end
+end
+
+def fun_l26_n936(x)
+    if (x < 1)
+        fun_l27_n948(x)
+    else
+        fun_l27_n78(x)
+    end
+end
+
+def fun_l26_n937(x)
+    if (x < 1)
+        fun_l27_n963(x)
+    else
+        fun_l27_n203(x)
+    end
+end
+
+def fun_l26_n938(x)
+    if (x < 1)
+        fun_l27_n779(x)
+    else
+        fun_l27_n393(x)
+    end
+end
+
+def fun_l26_n939(x)
+    if (x < 1)
+        fun_l27_n403(x)
+    else
+        fun_l27_n303(x)
+    end
+end
+
+def fun_l26_n940(x)
+    if (x < 1)
+        fun_l27_n779(x)
+    else
+        fun_l27_n934(x)
+    end
+end
+
+def fun_l26_n941(x)
+    if (x < 1)
+        fun_l27_n191(x)
+    else
+        fun_l27_n414(x)
+    end
+end
+
+def fun_l26_n942(x)
+    if (x < 1)
+        fun_l27_n22(x)
+    else
+        fun_l27_n101(x)
+    end
+end
+
+def fun_l26_n943(x)
+    if (x < 1)
+        fun_l27_n501(x)
+    else
+        fun_l27_n43(x)
+    end
+end
+
+def fun_l26_n944(x)
+    if (x < 1)
+        fun_l27_n154(x)
+    else
+        fun_l27_n659(x)
+    end
+end
+
+def fun_l26_n945(x)
+    if (x < 1)
+        fun_l27_n346(x)
+    else
+        fun_l27_n380(x)
+    end
+end
+
+def fun_l26_n946(x)
+    if (x < 1)
+        fun_l27_n653(x)
+    else
+        fun_l27_n762(x)
+    end
+end
+
+def fun_l26_n947(x)
+    if (x < 1)
+        fun_l27_n191(x)
+    else
+        fun_l27_n649(x)
+    end
+end
+
+def fun_l26_n948(x)
+    if (x < 1)
+        fun_l27_n645(x)
+    else
+        fun_l27_n199(x)
+    end
+end
+
+def fun_l26_n949(x)
+    if (x < 1)
+        fun_l27_n251(x)
+    else
+        fun_l27_n461(x)
+    end
+end
+
+def fun_l26_n950(x)
+    if (x < 1)
+        fun_l27_n720(x)
+    else
+        fun_l27_n645(x)
+    end
+end
+
+def fun_l26_n951(x)
+    if (x < 1)
+        fun_l27_n200(x)
+    else
+        fun_l27_n73(x)
+    end
+end
+
+def fun_l26_n952(x)
+    if (x < 1)
+        fun_l27_n86(x)
+    else
+        fun_l27_n526(x)
+    end
+end
+
+def fun_l26_n953(x)
+    if (x < 1)
+        fun_l27_n448(x)
+    else
+        fun_l27_n108(x)
+    end
+end
+
+def fun_l26_n954(x)
+    if (x < 1)
+        fun_l27_n931(x)
+    else
+        fun_l27_n540(x)
+    end
+end
+
+def fun_l26_n955(x)
+    if (x < 1)
+        fun_l27_n298(x)
+    else
+        fun_l27_n836(x)
+    end
+end
+
+def fun_l26_n956(x)
+    if (x < 1)
+        fun_l27_n232(x)
+    else
+        fun_l27_n200(x)
+    end
+end
+
+def fun_l26_n957(x)
+    if (x < 1)
+        fun_l27_n342(x)
+    else
+        fun_l27_n885(x)
+    end
+end
+
+def fun_l26_n958(x)
+    if (x < 1)
+        fun_l27_n254(x)
+    else
+        fun_l27_n764(x)
+    end
+end
+
+def fun_l26_n959(x)
+    if (x < 1)
+        fun_l27_n765(x)
+    else
+        fun_l27_n264(x)
+    end
+end
+
+def fun_l26_n960(x)
+    if (x < 1)
+        fun_l27_n45(x)
+    else
+        fun_l27_n993(x)
+    end
+end
+
+def fun_l26_n961(x)
+    if (x < 1)
+        fun_l27_n105(x)
+    else
+        fun_l27_n100(x)
+    end
+end
+
+def fun_l26_n962(x)
+    if (x < 1)
+        fun_l27_n979(x)
+    else
+        fun_l27_n87(x)
+    end
+end
+
+def fun_l26_n963(x)
+    if (x < 1)
+        fun_l27_n103(x)
+    else
+        fun_l27_n927(x)
+    end
+end
+
+def fun_l26_n964(x)
+    if (x < 1)
+        fun_l27_n635(x)
+    else
+        fun_l27_n489(x)
+    end
+end
+
+def fun_l26_n965(x)
+    if (x < 1)
+        fun_l27_n565(x)
+    else
+        fun_l27_n70(x)
+    end
+end
+
+def fun_l26_n966(x)
+    if (x < 1)
+        fun_l27_n370(x)
+    else
+        fun_l27_n975(x)
+    end
+end
+
+def fun_l26_n967(x)
+    if (x < 1)
+        fun_l27_n997(x)
+    else
+        fun_l27_n132(x)
+    end
+end
+
+def fun_l26_n968(x)
+    if (x < 1)
+        fun_l27_n964(x)
+    else
+        fun_l27_n201(x)
+    end
+end
+
+def fun_l26_n969(x)
+    if (x < 1)
+        fun_l27_n710(x)
+    else
+        fun_l27_n875(x)
+    end
+end
+
+def fun_l26_n970(x)
+    if (x < 1)
+        fun_l27_n736(x)
+    else
+        fun_l27_n338(x)
+    end
+end
+
+def fun_l26_n971(x)
+    if (x < 1)
+        fun_l27_n429(x)
+    else
+        fun_l27_n64(x)
+    end
+end
+
+def fun_l26_n972(x)
+    if (x < 1)
+        fun_l27_n986(x)
+    else
+        fun_l27_n27(x)
+    end
+end
+
+def fun_l26_n973(x)
+    if (x < 1)
+        fun_l27_n419(x)
+    else
+        fun_l27_n579(x)
+    end
+end
+
+def fun_l26_n974(x)
+    if (x < 1)
+        fun_l27_n479(x)
+    else
+        fun_l27_n709(x)
+    end
+end
+
+def fun_l26_n975(x)
+    if (x < 1)
+        fun_l27_n524(x)
+    else
+        fun_l27_n550(x)
+    end
+end
+
+def fun_l26_n976(x)
+    if (x < 1)
+        fun_l27_n679(x)
+    else
+        fun_l27_n822(x)
+    end
+end
+
+def fun_l26_n977(x)
+    if (x < 1)
+        fun_l27_n535(x)
+    else
+        fun_l27_n198(x)
+    end
+end
+
+def fun_l26_n978(x)
+    if (x < 1)
+        fun_l27_n226(x)
+    else
+        fun_l27_n610(x)
+    end
+end
+
+def fun_l26_n979(x)
+    if (x < 1)
+        fun_l27_n460(x)
+    else
+        fun_l27_n562(x)
+    end
+end
+
+def fun_l26_n980(x)
+    if (x < 1)
+        fun_l27_n109(x)
+    else
+        fun_l27_n632(x)
+    end
+end
+
+def fun_l26_n981(x)
+    if (x < 1)
+        fun_l27_n936(x)
+    else
+        fun_l27_n288(x)
+    end
+end
+
+def fun_l26_n982(x)
+    if (x < 1)
+        fun_l27_n668(x)
+    else
+        fun_l27_n5(x)
+    end
+end
+
+def fun_l26_n983(x)
+    if (x < 1)
+        fun_l27_n458(x)
+    else
+        fun_l27_n861(x)
+    end
+end
+
+def fun_l26_n984(x)
+    if (x < 1)
+        fun_l27_n722(x)
+    else
+        fun_l27_n838(x)
+    end
+end
+
+def fun_l26_n985(x)
+    if (x < 1)
+        fun_l27_n883(x)
+    else
+        fun_l27_n124(x)
+    end
+end
+
+def fun_l26_n986(x)
+    if (x < 1)
+        fun_l27_n873(x)
+    else
+        fun_l27_n399(x)
+    end
+end
+
+def fun_l26_n987(x)
+    if (x < 1)
+        fun_l27_n449(x)
+    else
+        fun_l27_n34(x)
+    end
+end
+
+def fun_l26_n988(x)
+    if (x < 1)
+        fun_l27_n549(x)
+    else
+        fun_l27_n304(x)
+    end
+end
+
+def fun_l26_n989(x)
+    if (x < 1)
+        fun_l27_n287(x)
+    else
+        fun_l27_n270(x)
+    end
+end
+
+def fun_l26_n990(x)
+    if (x < 1)
+        fun_l27_n950(x)
+    else
+        fun_l27_n203(x)
+    end
+end
+
+def fun_l26_n991(x)
+    if (x < 1)
+        fun_l27_n39(x)
+    else
+        fun_l27_n284(x)
+    end
+end
+
+def fun_l26_n992(x)
+    if (x < 1)
+        fun_l27_n944(x)
+    else
+        fun_l27_n420(x)
+    end
+end
+
+def fun_l26_n993(x)
+    if (x < 1)
+        fun_l27_n254(x)
+    else
+        fun_l27_n960(x)
+    end
+end
+
+def fun_l26_n994(x)
+    if (x < 1)
+        fun_l27_n374(x)
+    else
+        fun_l27_n354(x)
+    end
+end
+
+def fun_l26_n995(x)
+    if (x < 1)
+        fun_l27_n766(x)
+    else
+        fun_l27_n937(x)
+    end
+end
+
+def fun_l26_n996(x)
+    if (x < 1)
+        fun_l27_n299(x)
+    else
+        fun_l27_n565(x)
+    end
+end
+
+def fun_l26_n997(x)
+    if (x < 1)
+        fun_l27_n390(x)
+    else
+        fun_l27_n924(x)
+    end
+end
+
+def fun_l26_n998(x)
+    if (x < 1)
+        fun_l27_n452(x)
+    else
+        fun_l27_n653(x)
+    end
+end
+
+def fun_l26_n999(x)
+    if (x < 1)
+        fun_l27_n110(x)
+    else
+        fun_l27_n781(x)
+    end
+end
+
+def fun_l27_n0(x)
+    if (x < 1)
+        fun_l28_n77(x)
+    else
+        fun_l28_n170(x)
+    end
+end
+
+def fun_l27_n1(x)
+    if (x < 1)
+        fun_l28_n420(x)
+    else
+        fun_l28_n414(x)
+    end
+end
+
+def fun_l27_n2(x)
+    if (x < 1)
+        fun_l28_n802(x)
+    else
+        fun_l28_n702(x)
+    end
+end
+
+def fun_l27_n3(x)
+    if (x < 1)
+        fun_l28_n742(x)
+    else
+        fun_l28_n819(x)
+    end
+end
+
+def fun_l27_n4(x)
+    if (x < 1)
+        fun_l28_n75(x)
+    else
+        fun_l28_n675(x)
+    end
+end
+
+def fun_l27_n5(x)
+    if (x < 1)
+        fun_l28_n276(x)
+    else
+        fun_l28_n554(x)
+    end
+end
+
+def fun_l27_n6(x)
+    if (x < 1)
+        fun_l28_n505(x)
+    else
+        fun_l28_n462(x)
+    end
+end
+
+def fun_l27_n7(x)
+    if (x < 1)
+        fun_l28_n401(x)
+    else
+        fun_l28_n437(x)
+    end
+end
+
+def fun_l27_n8(x)
+    if (x < 1)
+        fun_l28_n987(x)
+    else
+        fun_l28_n911(x)
+    end
+end
+
+def fun_l27_n9(x)
+    if (x < 1)
+        fun_l28_n196(x)
+    else
+        fun_l28_n507(x)
+    end
+end
+
+def fun_l27_n10(x)
+    if (x < 1)
+        fun_l28_n676(x)
+    else
+        fun_l28_n612(x)
+    end
+end
+
+def fun_l27_n11(x)
+    if (x < 1)
+        fun_l28_n630(x)
+    else
+        fun_l28_n897(x)
+    end
+end
+
+def fun_l27_n12(x)
+    if (x < 1)
+        fun_l28_n655(x)
+    else
+        fun_l28_n58(x)
+    end
+end
+
+def fun_l27_n13(x)
+    if (x < 1)
+        fun_l28_n777(x)
+    else
+        fun_l28_n138(x)
+    end
+end
+
+def fun_l27_n14(x)
+    if (x < 1)
+        fun_l28_n233(x)
+    else
+        fun_l28_n296(x)
+    end
+end
+
+def fun_l27_n15(x)
+    if (x < 1)
+        fun_l28_n580(x)
+    else
+        fun_l28_n538(x)
+    end
+end
+
+def fun_l27_n16(x)
+    if (x < 1)
+        fun_l28_n124(x)
+    else
+        fun_l28_n285(x)
+    end
+end
+
+def fun_l27_n17(x)
+    if (x < 1)
+        fun_l28_n250(x)
+    else
+        fun_l28_n255(x)
+    end
+end
+
+def fun_l27_n18(x)
+    if (x < 1)
+        fun_l28_n872(x)
+    else
+        fun_l28_n242(x)
+    end
+end
+
+def fun_l27_n19(x)
+    if (x < 1)
+        fun_l28_n548(x)
+    else
+        fun_l28_n30(x)
+    end
+end
+
+def fun_l27_n20(x)
+    if (x < 1)
+        fun_l28_n411(x)
+    else
+        fun_l28_n997(x)
+    end
+end
+
+def fun_l27_n21(x)
+    if (x < 1)
+        fun_l28_n860(x)
+    else
+        fun_l28_n22(x)
+    end
+end
+
+def fun_l27_n22(x)
+    if (x < 1)
+        fun_l28_n147(x)
+    else
+        fun_l28_n210(x)
+    end
+end
+
+def fun_l27_n23(x)
+    if (x < 1)
+        fun_l28_n763(x)
+    else
+        fun_l28_n652(x)
+    end
+end
+
+def fun_l27_n24(x)
+    if (x < 1)
+        fun_l28_n678(x)
+    else
+        fun_l28_n637(x)
+    end
+end
+
+def fun_l27_n25(x)
+    if (x < 1)
+        fun_l28_n748(x)
+    else
+        fun_l28_n445(x)
+    end
+end
+
+def fun_l27_n26(x)
+    if (x < 1)
+        fun_l28_n796(x)
+    else
+        fun_l28_n780(x)
+    end
+end
+
+def fun_l27_n27(x)
+    if (x < 1)
+        fun_l28_n26(x)
+    else
+        fun_l28_n737(x)
+    end
+end
+
+def fun_l27_n28(x)
+    if (x < 1)
+        fun_l28_n779(x)
+    else
+        fun_l28_n206(x)
+    end
+end
+
+def fun_l27_n29(x)
+    if (x < 1)
+        fun_l28_n236(x)
+    else
+        fun_l28_n864(x)
+    end
+end
+
+def fun_l27_n30(x)
+    if (x < 1)
+        fun_l28_n937(x)
+    else
+        fun_l28_n524(x)
+    end
+end
+
+def fun_l27_n31(x)
+    if (x < 1)
+        fun_l28_n61(x)
+    else
+        fun_l28_n791(x)
+    end
+end
+
+def fun_l27_n32(x)
+    if (x < 1)
+        fun_l28_n891(x)
+    else
+        fun_l28_n424(x)
+    end
+end
+
+def fun_l27_n33(x)
+    if (x < 1)
+        fun_l28_n856(x)
+    else
+        fun_l28_n544(x)
+    end
+end
+
+def fun_l27_n34(x)
+    if (x < 1)
+        fun_l28_n575(x)
+    else
+        fun_l28_n608(x)
+    end
+end
+
+def fun_l27_n35(x)
+    if (x < 1)
+        fun_l28_n546(x)
+    else
+        fun_l28_n164(x)
+    end
+end
+
+def fun_l27_n36(x)
+    if (x < 1)
+        fun_l28_n482(x)
+    else
+        fun_l28_n854(x)
+    end
+end
+
+def fun_l27_n37(x)
+    if (x < 1)
+        fun_l28_n667(x)
+    else
+        fun_l28_n568(x)
+    end
+end
+
+def fun_l27_n38(x)
+    if (x < 1)
+        fun_l28_n8(x)
+    else
+        fun_l28_n794(x)
+    end
+end
+
+def fun_l27_n39(x)
+    if (x < 1)
+        fun_l28_n504(x)
+    else
+        fun_l28_n199(x)
+    end
+end
+
+def fun_l27_n40(x)
+    if (x < 1)
+        fun_l28_n360(x)
+    else
+        fun_l28_n714(x)
+    end
+end
+
+def fun_l27_n41(x)
+    if (x < 1)
+        fun_l28_n758(x)
+    else
+        fun_l28_n499(x)
+    end
+end
+
+def fun_l27_n42(x)
+    if (x < 1)
+        fun_l28_n617(x)
+    else
+        fun_l28_n239(x)
+    end
+end
+
+def fun_l27_n43(x)
+    if (x < 1)
+        fun_l28_n357(x)
+    else
+        fun_l28_n950(x)
+    end
+end
+
+def fun_l27_n44(x)
+    if (x < 1)
+        fun_l28_n308(x)
+    else
+        fun_l28_n248(x)
+    end
+end
+
+def fun_l27_n45(x)
+    if (x < 1)
+        fun_l28_n887(x)
+    else
+        fun_l28_n541(x)
+    end
+end
+
+def fun_l27_n46(x)
+    if (x < 1)
+        fun_l28_n922(x)
+    else
+        fun_l28_n21(x)
+    end
+end
+
+def fun_l27_n47(x)
+    if (x < 1)
+        fun_l28_n398(x)
+    else
+        fun_l28_n781(x)
+    end
+end
+
+def fun_l27_n48(x)
+    if (x < 1)
+        fun_l28_n573(x)
+    else
+        fun_l28_n22(x)
+    end
+end
+
+def fun_l27_n49(x)
+    if (x < 1)
+        fun_l28_n324(x)
+    else
+        fun_l28_n764(x)
+    end
+end
+
+def fun_l27_n50(x)
+    if (x < 1)
+        fun_l28_n428(x)
+    else
+        fun_l28_n3(x)
+    end
+end
+
+def fun_l27_n51(x)
+    if (x < 1)
+        fun_l28_n637(x)
+    else
+        fun_l28_n871(x)
+    end
+end
+
+def fun_l27_n52(x)
+    if (x < 1)
+        fun_l28_n547(x)
+    else
+        fun_l28_n370(x)
+    end
+end
+
+def fun_l27_n53(x)
+    if (x < 1)
+        fun_l28_n864(x)
+    else
+        fun_l28_n360(x)
+    end
+end
+
+def fun_l27_n54(x)
+    if (x < 1)
+        fun_l28_n960(x)
+    else
+        fun_l28_n80(x)
+    end
+end
+
+def fun_l27_n55(x)
+    if (x < 1)
+        fun_l28_n339(x)
+    else
+        fun_l28_n828(x)
+    end
+end
+
+def fun_l27_n56(x)
+    if (x < 1)
+        fun_l28_n613(x)
+    else
+        fun_l28_n109(x)
+    end
+end
+
+def fun_l27_n57(x)
+    if (x < 1)
+        fun_l28_n458(x)
+    else
+        fun_l28_n339(x)
+    end
+end
+
+def fun_l27_n58(x)
+    if (x < 1)
+        fun_l28_n313(x)
+    else
+        fun_l28_n20(x)
+    end
+end
+
+def fun_l27_n59(x)
+    if (x < 1)
+        fun_l28_n642(x)
+    else
+        fun_l28_n582(x)
+    end
+end
+
+def fun_l27_n60(x)
+    if (x < 1)
+        fun_l28_n407(x)
+    else
+        fun_l28_n182(x)
+    end
+end
+
+def fun_l27_n61(x)
+    if (x < 1)
+        fun_l28_n475(x)
+    else
+        fun_l28_n865(x)
+    end
+end
+
+def fun_l27_n62(x)
+    if (x < 1)
+        fun_l28_n867(x)
+    else
+        fun_l28_n935(x)
+    end
+end
+
+def fun_l27_n63(x)
+    if (x < 1)
+        fun_l28_n361(x)
+    else
+        fun_l28_n675(x)
+    end
+end
+
+def fun_l27_n64(x)
+    if (x < 1)
+        fun_l28_n583(x)
+    else
+        fun_l28_n990(x)
+    end
+end
+
+def fun_l27_n65(x)
+    if (x < 1)
+        fun_l28_n305(x)
+    else
+        fun_l28_n918(x)
+    end
+end
+
+def fun_l27_n66(x)
+    if (x < 1)
+        fun_l28_n449(x)
+    else
+        fun_l28_n172(x)
+    end
+end
+
+def fun_l27_n67(x)
+    if (x < 1)
+        fun_l28_n384(x)
+    else
+        fun_l28_n102(x)
+    end
+end
+
+def fun_l27_n68(x)
+    if (x < 1)
+        fun_l28_n27(x)
+    else
+        fun_l28_n638(x)
+    end
+end
+
+def fun_l27_n69(x)
+    if (x < 1)
+        fun_l28_n370(x)
+    else
+        fun_l28_n305(x)
+    end
+end
+
+def fun_l27_n70(x)
+    if (x < 1)
+        fun_l28_n91(x)
+    else
+        fun_l28_n516(x)
+    end
+end
+
+def fun_l27_n71(x)
+    if (x < 1)
+        fun_l28_n835(x)
+    else
+        fun_l28_n422(x)
+    end
+end
+
+def fun_l27_n72(x)
+    if (x < 1)
+        fun_l28_n528(x)
+    else
+        fun_l28_n924(x)
+    end
+end
+
+def fun_l27_n73(x)
+    if (x < 1)
+        fun_l28_n910(x)
+    else
+        fun_l28_n177(x)
+    end
+end
+
+def fun_l27_n74(x)
+    if (x < 1)
+        fun_l28_n424(x)
+    else
+        fun_l28_n133(x)
+    end
+end
+
+def fun_l27_n75(x)
+    if (x < 1)
+        fun_l28_n207(x)
+    else
+        fun_l28_n206(x)
+    end
+end
+
+def fun_l27_n76(x)
+    if (x < 1)
+        fun_l28_n285(x)
+    else
+        fun_l28_n513(x)
+    end
+end
+
+def fun_l27_n77(x)
+    if (x < 1)
+        fun_l28_n446(x)
+    else
+        fun_l28_n985(x)
+    end
+end
+
+def fun_l27_n78(x)
+    if (x < 1)
+        fun_l28_n814(x)
+    else
+        fun_l28_n43(x)
+    end
+end
+
+def fun_l27_n79(x)
+    if (x < 1)
+        fun_l28_n155(x)
+    else
+        fun_l28_n944(x)
+    end
+end
+
+def fun_l27_n80(x)
+    if (x < 1)
+        fun_l28_n22(x)
+    else
+        fun_l28_n815(x)
+    end
+end
+
+def fun_l27_n81(x)
+    if (x < 1)
+        fun_l28_n465(x)
+    else
+        fun_l28_n132(x)
+    end
+end
+
+def fun_l27_n82(x)
+    if (x < 1)
+        fun_l28_n540(x)
+    else
+        fun_l28_n199(x)
+    end
+end
+
+def fun_l27_n83(x)
+    if (x < 1)
+        fun_l28_n28(x)
+    else
+        fun_l28_n64(x)
+    end
+end
+
+def fun_l27_n84(x)
+    if (x < 1)
+        fun_l28_n4(x)
+    else
+        fun_l28_n782(x)
+    end
+end
+
+def fun_l27_n85(x)
+    if (x < 1)
+        fun_l28_n685(x)
+    else
+        fun_l28_n57(x)
+    end
+end
+
+def fun_l27_n86(x)
+    if (x < 1)
+        fun_l28_n755(x)
+    else
+        fun_l28_n317(x)
+    end
+end
+
+def fun_l27_n87(x)
+    if (x < 1)
+        fun_l28_n298(x)
+    else
+        fun_l28_n645(x)
+    end
+end
+
+def fun_l27_n88(x)
+    if (x < 1)
+        fun_l28_n489(x)
+    else
+        fun_l28_n357(x)
+    end
+end
+
+def fun_l27_n89(x)
+    if (x < 1)
+        fun_l28_n225(x)
+    else
+        fun_l28_n465(x)
+    end
+end
+
+def fun_l27_n90(x)
+    if (x < 1)
+        fun_l28_n729(x)
+    else
+        fun_l28_n688(x)
+    end
+end
+
+def fun_l27_n91(x)
+    if (x < 1)
+        fun_l28_n936(x)
+    else
+        fun_l28_n62(x)
+    end
+end
+
+def fun_l27_n92(x)
+    if (x < 1)
+        fun_l28_n564(x)
+    else
+        fun_l28_n497(x)
+    end
+end
+
+def fun_l27_n93(x)
+    if (x < 1)
+        fun_l28_n78(x)
+    else
+        fun_l28_n167(x)
+    end
+end
+
+def fun_l27_n94(x)
+    if (x < 1)
+        fun_l28_n24(x)
+    else
+        fun_l28_n543(x)
+    end
+end
+
+def fun_l27_n95(x)
+    if (x < 1)
+        fun_l28_n56(x)
+    else
+        fun_l28_n796(x)
+    end
+end
+
+def fun_l27_n96(x)
+    if (x < 1)
+        fun_l28_n768(x)
+    else
+        fun_l28_n909(x)
+    end
+end
+
+def fun_l27_n97(x)
+    if (x < 1)
+        fun_l28_n72(x)
+    else
+        fun_l28_n604(x)
+    end
+end
+
+def fun_l27_n98(x)
+    if (x < 1)
+        fun_l28_n903(x)
+    else
+        fun_l28_n998(x)
+    end
+end
+
+def fun_l27_n99(x)
+    if (x < 1)
+        fun_l28_n525(x)
+    else
+        fun_l28_n158(x)
+    end
+end
+
+def fun_l27_n100(x)
+    if (x < 1)
+        fun_l28_n54(x)
+    else
+        fun_l28_n667(x)
+    end
+end
+
+def fun_l27_n101(x)
+    if (x < 1)
+        fun_l28_n894(x)
+    else
+        fun_l28_n807(x)
+    end
+end
+
+def fun_l27_n102(x)
+    if (x < 1)
+        fun_l28_n334(x)
+    else
+        fun_l28_n479(x)
+    end
+end
+
+def fun_l27_n103(x)
+    if (x < 1)
+        fun_l28_n211(x)
+    else
+        fun_l28_n383(x)
+    end
+end
+
+def fun_l27_n104(x)
+    if (x < 1)
+        fun_l28_n598(x)
+    else
+        fun_l28_n793(x)
+    end
+end
+
+def fun_l27_n105(x)
+    if (x < 1)
+        fun_l28_n812(x)
+    else
+        fun_l28_n806(x)
+    end
+end
+
+def fun_l27_n106(x)
+    if (x < 1)
+        fun_l28_n726(x)
+    else
+        fun_l28_n769(x)
+    end
+end
+
+def fun_l27_n107(x)
+    if (x < 1)
+        fun_l28_n593(x)
+    else
+        fun_l28_n173(x)
+    end
+end
+
+def fun_l27_n108(x)
+    if (x < 1)
+        fun_l28_n490(x)
+    else
+        fun_l28_n681(x)
+    end
+end
+
+def fun_l27_n109(x)
+    if (x < 1)
+        fun_l28_n691(x)
+    else
+        fun_l28_n323(x)
+    end
+end
+
+def fun_l27_n110(x)
+    if (x < 1)
+        fun_l28_n710(x)
+    else
+        fun_l28_n624(x)
+    end
+end
+
+def fun_l27_n111(x)
+    if (x < 1)
+        fun_l28_n563(x)
+    else
+        fun_l28_n335(x)
+    end
+end
+
+def fun_l27_n112(x)
+    if (x < 1)
+        fun_l28_n510(x)
+    else
+        fun_l28_n879(x)
+    end
+end
+
+def fun_l27_n113(x)
+    if (x < 1)
+        fun_l28_n900(x)
+    else
+        fun_l28_n119(x)
+    end
+end
+
+def fun_l27_n114(x)
+    if (x < 1)
+        fun_l28_n17(x)
+    else
+        fun_l28_n8(x)
+    end
+end
+
+def fun_l27_n115(x)
+    if (x < 1)
+        fun_l28_n813(x)
+    else
+        fun_l28_n948(x)
+    end
+end
+
+def fun_l27_n116(x)
+    if (x < 1)
+        fun_l28_n644(x)
+    else
+        fun_l28_n177(x)
+    end
+end
+
+def fun_l27_n117(x)
+    if (x < 1)
+        fun_l28_n635(x)
+    else
+        fun_l28_n489(x)
+    end
+end
+
+def fun_l27_n118(x)
+    if (x < 1)
+        fun_l28_n520(x)
+    else
+        fun_l28_n127(x)
+    end
+end
+
+def fun_l27_n119(x)
+    if (x < 1)
+        fun_l28_n859(x)
+    else
+        fun_l28_n264(x)
+    end
+end
+
+def fun_l27_n120(x)
+    if (x < 1)
+        fun_l28_n29(x)
+    else
+        fun_l28_n984(x)
+    end
+end
+
+def fun_l27_n121(x)
+    if (x < 1)
+        fun_l28_n2(x)
+    else
+        fun_l28_n858(x)
+    end
+end
+
+def fun_l27_n122(x)
+    if (x < 1)
+        fun_l28_n907(x)
+    else
+        fun_l28_n34(x)
+    end
+end
+
+def fun_l27_n123(x)
+    if (x < 1)
+        fun_l28_n495(x)
+    else
+        fun_l28_n144(x)
+    end
+end
+
+def fun_l27_n124(x)
+    if (x < 1)
+        fun_l28_n160(x)
+    else
+        fun_l28_n987(x)
+    end
+end
+
+def fun_l27_n125(x)
+    if (x < 1)
+        fun_l28_n60(x)
+    else
+        fun_l28_n415(x)
+    end
+end
+
+def fun_l27_n126(x)
+    if (x < 1)
+        fun_l28_n473(x)
+    else
+        fun_l28_n461(x)
+    end
+end
+
+def fun_l27_n127(x)
+    if (x < 1)
+        fun_l28_n664(x)
+    else
+        fun_l28_n764(x)
+    end
+end
+
+def fun_l27_n128(x)
+    if (x < 1)
+        fun_l28_n815(x)
+    else
+        fun_l28_n677(x)
+    end
+end
+
+def fun_l27_n129(x)
+    if (x < 1)
+        fun_l28_n828(x)
+    else
+        fun_l28_n575(x)
+    end
+end
+
+def fun_l27_n130(x)
+    if (x < 1)
+        fun_l28_n100(x)
+    else
+        fun_l28_n811(x)
+    end
+end
+
+def fun_l27_n131(x)
+    if (x < 1)
+        fun_l28_n789(x)
+    else
+        fun_l28_n246(x)
+    end
+end
+
+def fun_l27_n132(x)
+    if (x < 1)
+        fun_l28_n506(x)
+    else
+        fun_l28_n555(x)
+    end
+end
+
+def fun_l27_n133(x)
+    if (x < 1)
+        fun_l28_n272(x)
+    else
+        fun_l28_n115(x)
+    end
+end
+
+def fun_l27_n134(x)
+    if (x < 1)
+        fun_l28_n925(x)
+    else
+        fun_l28_n34(x)
+    end
+end
+
+def fun_l27_n135(x)
+    if (x < 1)
+        fun_l28_n844(x)
+    else
+        fun_l28_n725(x)
+    end
+end
+
+def fun_l27_n136(x)
+    if (x < 1)
+        fun_l28_n825(x)
+    else
+        fun_l28_n38(x)
+    end
+end
+
+def fun_l27_n137(x)
+    if (x < 1)
+        fun_l28_n607(x)
+    else
+        fun_l28_n343(x)
+    end
+end
+
+def fun_l27_n138(x)
+    if (x < 1)
+        fun_l28_n874(x)
+    else
+        fun_l28_n449(x)
+    end
+end
+
+def fun_l27_n139(x)
+    if (x < 1)
+        fun_l28_n632(x)
+    else
+        fun_l28_n454(x)
+    end
+end
+
+def fun_l27_n140(x)
+    if (x < 1)
+        fun_l28_n902(x)
+    else
+        fun_l28_n301(x)
+    end
+end
+
+def fun_l27_n141(x)
+    if (x < 1)
+        fun_l28_n395(x)
+    else
+        fun_l28_n890(x)
+    end
+end
+
+def fun_l27_n142(x)
+    if (x < 1)
+        fun_l28_n625(x)
+    else
+        fun_l28_n246(x)
+    end
+end
+
+def fun_l27_n143(x)
+    if (x < 1)
+        fun_l28_n312(x)
+    else
+        fun_l28_n975(x)
+    end
+end
+
+def fun_l27_n144(x)
+    if (x < 1)
+        fun_l28_n974(x)
+    else
+        fun_l28_n451(x)
+    end
+end
+
+def fun_l27_n145(x)
+    if (x < 1)
+        fun_l28_n541(x)
+    else
+        fun_l28_n566(x)
+    end
+end
+
+def fun_l27_n146(x)
+    if (x < 1)
+        fun_l28_n285(x)
+    else
+        fun_l28_n443(x)
+    end
+end
+
+def fun_l27_n147(x)
+    if (x < 1)
+        fun_l28_n71(x)
+    else
+        fun_l28_n200(x)
+    end
+end
+
+def fun_l27_n148(x)
+    if (x < 1)
+        fun_l28_n681(x)
+    else
+        fun_l28_n561(x)
+    end
+end
+
+def fun_l27_n149(x)
+    if (x < 1)
+        fun_l28_n470(x)
+    else
+        fun_l28_n529(x)
+    end
+end
+
+def fun_l27_n150(x)
+    if (x < 1)
+        fun_l28_n83(x)
+    else
+        fun_l28_n755(x)
+    end
+end
+
+def fun_l27_n151(x)
+    if (x < 1)
+        fun_l28_n142(x)
+    else
+        fun_l28_n631(x)
+    end
+end
+
+def fun_l27_n152(x)
+    if (x < 1)
+        fun_l28_n49(x)
+    else
+        fun_l28_n531(x)
+    end
+end
+
+def fun_l27_n153(x)
+    if (x < 1)
+        fun_l28_n237(x)
+    else
+        fun_l28_n241(x)
+    end
+end
+
+def fun_l27_n154(x)
+    if (x < 1)
+        fun_l28_n36(x)
+    else
+        fun_l28_n862(x)
+    end
+end
+
+def fun_l27_n155(x)
+    if (x < 1)
+        fun_l28_n310(x)
+    else
+        fun_l28_n387(x)
+    end
+end
+
+def fun_l27_n156(x)
+    if (x < 1)
+        fun_l28_n1(x)
+    else
+        fun_l28_n131(x)
+    end
+end
+
+def fun_l27_n157(x)
+    if (x < 1)
+        fun_l28_n232(x)
+    else
+        fun_l28_n503(x)
+    end
+end
+
+def fun_l27_n158(x)
+    if (x < 1)
+        fun_l28_n48(x)
+    else
+        fun_l28_n68(x)
+    end
+end
+
+def fun_l27_n159(x)
+    if (x < 1)
+        fun_l28_n98(x)
+    else
+        fun_l28_n82(x)
+    end
+end
+
+def fun_l27_n160(x)
+    if (x < 1)
+        fun_l28_n175(x)
+    else
+        fun_l28_n466(x)
+    end
+end
+
+def fun_l27_n161(x)
+    if (x < 1)
+        fun_l28_n105(x)
+    else
+        fun_l28_n159(x)
+    end
+end
+
+def fun_l27_n162(x)
+    if (x < 1)
+        fun_l28_n336(x)
+    else
+        fun_l28_n314(x)
+    end
+end
+
+def fun_l27_n163(x)
+    if (x < 1)
+        fun_l28_n458(x)
+    else
+        fun_l28_n901(x)
+    end
+end
+
+def fun_l27_n164(x)
+    if (x < 1)
+        fun_l28_n621(x)
+    else
+        fun_l28_n876(x)
+    end
+end
+
+def fun_l27_n165(x)
+    if (x < 1)
+        fun_l28_n830(x)
+    else
+        fun_l28_n468(x)
+    end
+end
+
+def fun_l27_n166(x)
+    if (x < 1)
+        fun_l28_n606(x)
+    else
+        fun_l28_n253(x)
+    end
+end
+
+def fun_l27_n167(x)
+    if (x < 1)
+        fun_l28_n905(x)
+    else
+        fun_l28_n582(x)
+    end
+end
+
+def fun_l27_n168(x)
+    if (x < 1)
+        fun_l28_n882(x)
+    else
+        fun_l28_n280(x)
+    end
+end
+
+def fun_l27_n169(x)
+    if (x < 1)
+        fun_l28_n824(x)
+    else
+        fun_l28_n672(x)
+    end
+end
+
+def fun_l27_n170(x)
+    if (x < 1)
+        fun_l28_n455(x)
+    else
+        fun_l28_n621(x)
+    end
+end
+
+def fun_l27_n171(x)
+    if (x < 1)
+        fun_l28_n594(x)
+    else
+        fun_l28_n143(x)
+    end
+end
+
+def fun_l27_n172(x)
+    if (x < 1)
+        fun_l28_n414(x)
+    else
+        fun_l28_n371(x)
+    end
+end
+
+def fun_l27_n173(x)
+    if (x < 1)
+        fun_l28_n2(x)
+    else
+        fun_l28_n883(x)
+    end
+end
+
+def fun_l27_n174(x)
+    if (x < 1)
+        fun_l28_n710(x)
+    else
+        fun_l28_n322(x)
+    end
+end
+
+def fun_l27_n175(x)
+    if (x < 1)
+        fun_l28_n271(x)
+    else
+        fun_l28_n110(x)
+    end
+end
+
+def fun_l27_n176(x)
+    if (x < 1)
+        fun_l28_n100(x)
+    else
+        fun_l28_n870(x)
+    end
+end
+
+def fun_l27_n177(x)
+    if (x < 1)
+        fun_l28_n446(x)
+    else
+        fun_l28_n742(x)
+    end
+end
+
+def fun_l27_n178(x)
+    if (x < 1)
+        fun_l28_n175(x)
+    else
+        fun_l28_n170(x)
+    end
+end
+
+def fun_l27_n179(x)
+    if (x < 1)
+        fun_l28_n724(x)
+    else
+        fun_l28_n364(x)
+    end
+end
+
+def fun_l27_n180(x)
+    if (x < 1)
+        fun_l28_n167(x)
+    else
+        fun_l28_n826(x)
+    end
+end
+
+def fun_l27_n181(x)
+    if (x < 1)
+        fun_l28_n65(x)
+    else
+        fun_l28_n375(x)
+    end
+end
+
+def fun_l27_n182(x)
+    if (x < 1)
+        fun_l28_n709(x)
+    else
+        fun_l28_n62(x)
+    end
+end
+
+def fun_l27_n183(x)
+    if (x < 1)
+        fun_l28_n584(x)
+    else
+        fun_l28_n611(x)
+    end
+end
+
+def fun_l27_n184(x)
+    if (x < 1)
+        fun_l28_n442(x)
+    else
+        fun_l28_n174(x)
+    end
+end
+
+def fun_l27_n185(x)
+    if (x < 1)
+        fun_l28_n684(x)
+    else
+        fun_l28_n768(x)
+    end
+end
+
+def fun_l27_n186(x)
+    if (x < 1)
+        fun_l28_n424(x)
+    else
+        fun_l28_n207(x)
+    end
+end
+
+def fun_l27_n187(x)
+    if (x < 1)
+        fun_l28_n670(x)
+    else
+        fun_l28_n970(x)
+    end
+end
+
+def fun_l27_n188(x)
+    if (x < 1)
+        fun_l28_n470(x)
+    else
+        fun_l28_n774(x)
+    end
+end
+
+def fun_l27_n189(x)
+    if (x < 1)
+        fun_l28_n58(x)
+    else
+        fun_l28_n578(x)
+    end
+end
+
+def fun_l27_n190(x)
+    if (x < 1)
+        fun_l28_n697(x)
+    else
+        fun_l28_n310(x)
+    end
+end
+
+def fun_l27_n191(x)
+    if (x < 1)
+        fun_l28_n493(x)
+    else
+        fun_l28_n56(x)
+    end
+end
+
+def fun_l27_n192(x)
+    if (x < 1)
+        fun_l28_n12(x)
+    else
+        fun_l28_n471(x)
+    end
+end
+
+def fun_l27_n193(x)
+    if (x < 1)
+        fun_l28_n306(x)
+    else
+        fun_l28_n10(x)
+    end
+end
+
+def fun_l27_n194(x)
+    if (x < 1)
+        fun_l28_n87(x)
+    else
+        fun_l28_n59(x)
+    end
+end
+
+def fun_l27_n195(x)
+    if (x < 1)
+        fun_l28_n207(x)
+    else
+        fun_l28_n555(x)
+    end
+end
+
+def fun_l27_n196(x)
+    if (x < 1)
+        fun_l28_n563(x)
+    else
+        fun_l28_n256(x)
+    end
+end
+
+def fun_l27_n197(x)
+    if (x < 1)
+        fun_l28_n14(x)
+    else
+        fun_l28_n895(x)
+    end
+end
+
+def fun_l27_n198(x)
+    if (x < 1)
+        fun_l28_n986(x)
+    else
+        fun_l28_n287(x)
+    end
+end
+
+def fun_l27_n199(x)
+    if (x < 1)
+        fun_l28_n810(x)
+    else
+        fun_l28_n66(x)
+    end
+end
+
+def fun_l27_n200(x)
+    if (x < 1)
+        fun_l28_n457(x)
+    else
+        fun_l28_n186(x)
+    end
+end
+
+def fun_l27_n201(x)
+    if (x < 1)
+        fun_l28_n580(x)
+    else
+        fun_l28_n248(x)
+    end
+end
+
+def fun_l27_n202(x)
+    if (x < 1)
+        fun_l28_n9(x)
+    else
+        fun_l28_n66(x)
+    end
+end
+
+def fun_l27_n203(x)
+    if (x < 1)
+        fun_l28_n659(x)
+    else
+        fun_l28_n403(x)
+    end
+end
+
+def fun_l27_n204(x)
+    if (x < 1)
+        fun_l28_n66(x)
+    else
+        fun_l28_n524(x)
+    end
+end
+
+def fun_l27_n205(x)
+    if (x < 1)
+        fun_l28_n754(x)
+    else
+        fun_l28_n46(x)
+    end
+end
+
+def fun_l27_n206(x)
+    if (x < 1)
+        fun_l28_n32(x)
+    else
+        fun_l28_n655(x)
+    end
+end
+
+def fun_l27_n207(x)
+    if (x < 1)
+        fun_l28_n559(x)
+    else
+        fun_l28_n619(x)
+    end
+end
+
+def fun_l27_n208(x)
+    if (x < 1)
+        fun_l28_n251(x)
+    else
+        fun_l28_n410(x)
+    end
+end
+
+def fun_l27_n209(x)
+    if (x < 1)
+        fun_l28_n339(x)
+    else
+        fun_l28_n726(x)
+    end
+end
+
+def fun_l27_n210(x)
+    if (x < 1)
+        fun_l28_n104(x)
+    else
+        fun_l28_n733(x)
+    end
+end
+
+def fun_l27_n211(x)
+    if (x < 1)
+        fun_l28_n500(x)
+    else
+        fun_l28_n654(x)
+    end
+end
+
+def fun_l27_n212(x)
+    if (x < 1)
+        fun_l28_n244(x)
+    else
+        fun_l28_n471(x)
+    end
+end
+
+def fun_l27_n213(x)
+    if (x < 1)
+        fun_l28_n692(x)
+    else
+        fun_l28_n56(x)
+    end
+end
+
+def fun_l27_n214(x)
+    if (x < 1)
+        fun_l28_n54(x)
+    else
+        fun_l28_n753(x)
+    end
+end
+
+def fun_l27_n215(x)
+    if (x < 1)
+        fun_l28_n770(x)
+    else
+        fun_l28_n756(x)
+    end
+end
+
+def fun_l27_n216(x)
+    if (x < 1)
+        fun_l28_n771(x)
+    else
+        fun_l28_n407(x)
+    end
+end
+
+def fun_l27_n217(x)
+    if (x < 1)
+        fun_l28_n728(x)
+    else
+        fun_l28_n361(x)
+    end
+end
+
+def fun_l27_n218(x)
+    if (x < 1)
+        fun_l28_n983(x)
+    else
+        fun_l28_n440(x)
+    end
+end
+
+def fun_l27_n219(x)
+    if (x < 1)
+        fun_l28_n105(x)
+    else
+        fun_l28_n906(x)
+    end
+end
+
+def fun_l27_n220(x)
+    if (x < 1)
+        fun_l28_n694(x)
+    else
+        fun_l28_n792(x)
+    end
+end
+
+def fun_l27_n221(x)
+    if (x < 1)
+        fun_l28_n325(x)
+    else
+        fun_l28_n98(x)
+    end
+end
+
+def fun_l27_n222(x)
+    if (x < 1)
+        fun_l28_n354(x)
+    else
+        fun_l28_n683(x)
+    end
+end
+
+def fun_l27_n223(x)
+    if (x < 1)
+        fun_l28_n236(x)
+    else
+        fun_l28_n999(x)
+    end
+end
+
+def fun_l27_n224(x)
+    if (x < 1)
+        fun_l28_n671(x)
+    else
+        fun_l28_n621(x)
+    end
+end
+
+def fun_l27_n225(x)
+    if (x < 1)
+        fun_l28_n113(x)
+    else
+        fun_l28_n532(x)
+    end
+end
+
+def fun_l27_n226(x)
+    if (x < 1)
+        fun_l28_n43(x)
+    else
+        fun_l28_n449(x)
+    end
+end
+
+def fun_l27_n227(x)
+    if (x < 1)
+        fun_l28_n402(x)
+    else
+        fun_l28_n298(x)
+    end
+end
+
+def fun_l27_n228(x)
+    if (x < 1)
+        fun_l28_n858(x)
+    else
+        fun_l28_n626(x)
+    end
+end
+
+def fun_l27_n229(x)
+    if (x < 1)
+        fun_l28_n596(x)
+    else
+        fun_l28_n21(x)
+    end
+end
+
+def fun_l27_n230(x)
+    if (x < 1)
+        fun_l28_n713(x)
+    else
+        fun_l28_n755(x)
+    end
+end
+
+def fun_l27_n231(x)
+    if (x < 1)
+        fun_l28_n59(x)
+    else
+        fun_l28_n695(x)
+    end
+end
+
+def fun_l27_n232(x)
+    if (x < 1)
+        fun_l28_n715(x)
+    else
+        fun_l28_n614(x)
+    end
+end
+
+def fun_l27_n233(x)
+    if (x < 1)
+        fun_l28_n124(x)
+    else
+        fun_l28_n877(x)
+    end
+end
+
+def fun_l27_n234(x)
+    if (x < 1)
+        fun_l28_n563(x)
+    else
+        fun_l28_n273(x)
+    end
+end
+
+def fun_l27_n235(x)
+    if (x < 1)
+        fun_l28_n331(x)
+    else
+        fun_l28_n866(x)
+    end
+end
+
+def fun_l27_n236(x)
+    if (x < 1)
+        fun_l28_n950(x)
+    else
+        fun_l28_n765(x)
+    end
+end
+
+def fun_l27_n237(x)
+    if (x < 1)
+        fun_l28_n550(x)
+    else
+        fun_l28_n133(x)
+    end
+end
+
+def fun_l27_n238(x)
+    if (x < 1)
+        fun_l28_n0(x)
+    else
+        fun_l28_n749(x)
+    end
+end
+
+def fun_l27_n239(x)
+    if (x < 1)
+        fun_l28_n578(x)
+    else
+        fun_l28_n692(x)
+    end
+end
+
+def fun_l27_n240(x)
+    if (x < 1)
+        fun_l28_n111(x)
+    else
+        fun_l28_n301(x)
+    end
+end
+
+def fun_l27_n241(x)
+    if (x < 1)
+        fun_l28_n191(x)
+    else
+        fun_l28_n272(x)
+    end
+end
+
+def fun_l27_n242(x)
+    if (x < 1)
+        fun_l28_n547(x)
+    else
+        fun_l28_n425(x)
+    end
+end
+
+def fun_l27_n243(x)
+    if (x < 1)
+        fun_l28_n173(x)
+    else
+        fun_l28_n101(x)
+    end
+end
+
+def fun_l27_n244(x)
+    if (x < 1)
+        fun_l28_n511(x)
+    else
+        fun_l28_n758(x)
+    end
+end
+
+def fun_l27_n245(x)
+    if (x < 1)
+        fun_l28_n272(x)
+    else
+        fun_l28_n497(x)
+    end
+end
+
+def fun_l27_n246(x)
+    if (x < 1)
+        fun_l28_n59(x)
+    else
+        fun_l28_n348(x)
+    end
+end
+
+def fun_l27_n247(x)
+    if (x < 1)
+        fun_l28_n583(x)
+    else
+        fun_l28_n730(x)
+    end
+end
+
+def fun_l27_n248(x)
+    if (x < 1)
+        fun_l28_n635(x)
+    else
+        fun_l28_n714(x)
+    end
+end
+
+def fun_l27_n249(x)
+    if (x < 1)
+        fun_l28_n815(x)
+    else
+        fun_l28_n844(x)
+    end
+end
+
+def fun_l27_n250(x)
+    if (x < 1)
+        fun_l28_n694(x)
+    else
+        fun_l28_n869(x)
+    end
+end
+
+def fun_l27_n251(x)
+    if (x < 1)
+        fun_l28_n681(x)
+    else
+        fun_l28_n894(x)
+    end
+end
+
+def fun_l27_n252(x)
+    if (x < 1)
+        fun_l28_n756(x)
+    else
+        fun_l28_n657(x)
+    end
+end
+
+def fun_l27_n253(x)
+    if (x < 1)
+        fun_l28_n392(x)
+    else
+        fun_l28_n706(x)
+    end
+end
+
+def fun_l27_n254(x)
+    if (x < 1)
+        fun_l28_n267(x)
+    else
+        fun_l28_n238(x)
+    end
+end
+
+def fun_l27_n255(x)
+    if (x < 1)
+        fun_l28_n914(x)
+    else
+        fun_l28_n574(x)
+    end
+end
+
+def fun_l27_n256(x)
+    if (x < 1)
+        fun_l28_n872(x)
+    else
+        fun_l28_n269(x)
+    end
+end
+
+def fun_l27_n257(x)
+    if (x < 1)
+        fun_l28_n454(x)
+    else
+        fun_l28_n485(x)
+    end
+end
+
+def fun_l27_n258(x)
+    if (x < 1)
+        fun_l28_n994(x)
+    else
+        fun_l28_n83(x)
+    end
+end
+
+def fun_l27_n259(x)
+    if (x < 1)
+        fun_l28_n41(x)
+    else
+        fun_l28_n495(x)
+    end
+end
+
+def fun_l27_n260(x)
+    if (x < 1)
+        fun_l28_n75(x)
+    else
+        fun_l28_n508(x)
+    end
+end
+
+def fun_l27_n261(x)
+    if (x < 1)
+        fun_l28_n684(x)
+    else
+        fun_l28_n524(x)
+    end
+end
+
+def fun_l27_n262(x)
+    if (x < 1)
+        fun_l28_n78(x)
+    else
+        fun_l28_n563(x)
+    end
+end
+
+def fun_l27_n263(x)
+    if (x < 1)
+        fun_l28_n227(x)
+    else
+        fun_l28_n359(x)
+    end
+end
+
+def fun_l27_n264(x)
+    if (x < 1)
+        fun_l28_n679(x)
+    else
+        fun_l28_n711(x)
+    end
+end
+
+def fun_l27_n265(x)
+    if (x < 1)
+        fun_l28_n0(x)
+    else
+        fun_l28_n720(x)
+    end
+end
+
+def fun_l27_n266(x)
+    if (x < 1)
+        fun_l28_n384(x)
+    else
+        fun_l28_n915(x)
+    end
+end
+
+def fun_l27_n267(x)
+    if (x < 1)
+        fun_l28_n912(x)
+    else
+        fun_l28_n24(x)
+    end
+end
+
+def fun_l27_n268(x)
+    if (x < 1)
+        fun_l28_n337(x)
+    else
+        fun_l28_n880(x)
+    end
+end
+
+def fun_l27_n269(x)
+    if (x < 1)
+        fun_l28_n84(x)
+    else
+        fun_l28_n387(x)
+    end
+end
+
+def fun_l27_n270(x)
+    if (x < 1)
+        fun_l28_n155(x)
+    else
+        fun_l28_n705(x)
+    end
+end
+
+def fun_l27_n271(x)
+    if (x < 1)
+        fun_l28_n159(x)
+    else
+        fun_l28_n815(x)
+    end
+end
+
+def fun_l27_n272(x)
+    if (x < 1)
+        fun_l28_n182(x)
+    else
+        fun_l28_n210(x)
+    end
+end
+
+def fun_l27_n273(x)
+    if (x < 1)
+        fun_l28_n446(x)
+    else
+        fun_l28_n524(x)
+    end
+end
+
+def fun_l27_n274(x)
+    if (x < 1)
+        fun_l28_n828(x)
+    else
+        fun_l28_n14(x)
+    end
+end
+
+def fun_l27_n275(x)
+    if (x < 1)
+        fun_l28_n176(x)
+    else
+        fun_l28_n857(x)
+    end
+end
+
+def fun_l27_n276(x)
+    if (x < 1)
+        fun_l28_n39(x)
+    else
+        fun_l28_n973(x)
+    end
+end
+
+def fun_l27_n277(x)
+    if (x < 1)
+        fun_l28_n310(x)
+    else
+        fun_l28_n900(x)
+    end
+end
+
+def fun_l27_n278(x)
+    if (x < 1)
+        fun_l28_n729(x)
+    else
+        fun_l28_n544(x)
+    end
+end
+
+def fun_l27_n279(x)
+    if (x < 1)
+        fun_l28_n111(x)
+    else
+        fun_l28_n939(x)
+    end
+end
+
+def fun_l27_n280(x)
+    if (x < 1)
+        fun_l28_n102(x)
+    else
+        fun_l28_n658(x)
+    end
+end
+
+def fun_l27_n281(x)
+    if (x < 1)
+        fun_l28_n186(x)
+    else
+        fun_l28_n939(x)
+    end
+end
+
+def fun_l27_n282(x)
+    if (x < 1)
+        fun_l28_n276(x)
+    else
+        fun_l28_n428(x)
+    end
+end
+
+def fun_l27_n283(x)
+    if (x < 1)
+        fun_l28_n137(x)
+    else
+        fun_l28_n876(x)
+    end
+end
+
+def fun_l27_n284(x)
+    if (x < 1)
+        fun_l28_n31(x)
+    else
+        fun_l28_n351(x)
+    end
+end
+
+def fun_l27_n285(x)
+    if (x < 1)
+        fun_l28_n143(x)
+    else
+        fun_l28_n192(x)
+    end
+end
+
+def fun_l27_n286(x)
+    if (x < 1)
+        fun_l28_n63(x)
+    else
+        fun_l28_n764(x)
+    end
+end
+
+def fun_l27_n287(x)
+    if (x < 1)
+        fun_l28_n361(x)
+    else
+        fun_l28_n512(x)
+    end
+end
+
+def fun_l27_n288(x)
+    if (x < 1)
+        fun_l28_n817(x)
+    else
+        fun_l28_n997(x)
+    end
+end
+
+def fun_l27_n289(x)
+    if (x < 1)
+        fun_l28_n837(x)
+    else
+        fun_l28_n834(x)
+    end
+end
+
+def fun_l27_n290(x)
+    if (x < 1)
+        fun_l28_n436(x)
+    else
+        fun_l28_n873(x)
+    end
+end
+
+def fun_l27_n291(x)
+    if (x < 1)
+        fun_l28_n412(x)
+    else
+        fun_l28_n494(x)
+    end
+end
+
+def fun_l27_n292(x)
+    if (x < 1)
+        fun_l28_n794(x)
+    else
+        fun_l28_n972(x)
+    end
+end
+
+def fun_l27_n293(x)
+    if (x < 1)
+        fun_l28_n486(x)
+    else
+        fun_l28_n401(x)
+    end
+end
+
+def fun_l27_n294(x)
+    if (x < 1)
+        fun_l28_n171(x)
+    else
+        fun_l28_n334(x)
+    end
+end
+
+def fun_l27_n295(x)
+    if (x < 1)
+        fun_l28_n681(x)
+    else
+        fun_l28_n753(x)
+    end
+end
+
+def fun_l27_n296(x)
+    if (x < 1)
+        fun_l28_n541(x)
+    else
+        fun_l28_n855(x)
+    end
+end
+
+def fun_l27_n297(x)
+    if (x < 1)
+        fun_l28_n270(x)
+    else
+        fun_l28_n257(x)
+    end
+end
+
+def fun_l27_n298(x)
+    if (x < 1)
+        fun_l28_n923(x)
+    else
+        fun_l28_n997(x)
+    end
+end
+
+def fun_l27_n299(x)
+    if (x < 1)
+        fun_l28_n508(x)
+    else
+        fun_l28_n649(x)
+    end
+end
+
+def fun_l27_n300(x)
+    if (x < 1)
+        fun_l28_n351(x)
+    else
+        fun_l28_n966(x)
+    end
+end
+
+def fun_l27_n301(x)
+    if (x < 1)
+        fun_l28_n622(x)
+    else
+        fun_l28_n436(x)
+    end
+end
+
+def fun_l27_n302(x)
+    if (x < 1)
+        fun_l28_n723(x)
+    else
+        fun_l28_n261(x)
+    end
+end
+
+def fun_l27_n303(x)
+    if (x < 1)
+        fun_l28_n269(x)
+    else
+        fun_l28_n483(x)
+    end
+end
+
+def fun_l27_n304(x)
+    if (x < 1)
+        fun_l28_n449(x)
+    else
+        fun_l28_n5(x)
+    end
+end
+
+def fun_l27_n305(x)
+    if (x < 1)
+        fun_l28_n967(x)
+    else
+        fun_l28_n967(x)
+    end
+end
+
+def fun_l27_n306(x)
+    if (x < 1)
+        fun_l28_n866(x)
+    else
+        fun_l28_n590(x)
+    end
+end
+
+def fun_l27_n307(x)
+    if (x < 1)
+        fun_l28_n145(x)
+    else
+        fun_l28_n75(x)
+    end
+end
+
+def fun_l27_n308(x)
+    if (x < 1)
+        fun_l28_n329(x)
+    else
+        fun_l28_n834(x)
+    end
+end
+
+def fun_l27_n309(x)
+    if (x < 1)
+        fun_l28_n668(x)
+    else
+        fun_l28_n909(x)
+    end
+end
+
+def fun_l27_n310(x)
+    if (x < 1)
+        fun_l28_n70(x)
+    else
+        fun_l28_n311(x)
+    end
+end
+
+def fun_l27_n311(x)
+    if (x < 1)
+        fun_l28_n669(x)
+    else
+        fun_l28_n90(x)
+    end
+end
+
+def fun_l27_n312(x)
+    if (x < 1)
+        fun_l28_n805(x)
+    else
+        fun_l28_n558(x)
+    end
+end
+
+def fun_l27_n313(x)
+    if (x < 1)
+        fun_l28_n493(x)
+    else
+        fun_l28_n642(x)
+    end
+end
+
+def fun_l27_n314(x)
+    if (x < 1)
+        fun_l28_n285(x)
+    else
+        fun_l28_n968(x)
+    end
+end
+
+def fun_l27_n315(x)
+    if (x < 1)
+        fun_l28_n806(x)
+    else
+        fun_l28_n731(x)
+    end
+end
+
+def fun_l27_n316(x)
+    if (x < 1)
+        fun_l28_n284(x)
+    else
+        fun_l28_n441(x)
+    end
+end
+
+def fun_l27_n317(x)
+    if (x < 1)
+        fun_l28_n644(x)
+    else
+        fun_l28_n16(x)
+    end
+end
+
+def fun_l27_n318(x)
+    if (x < 1)
+        fun_l28_n411(x)
+    else
+        fun_l28_n739(x)
+    end
+end
+
+def fun_l27_n319(x)
+    if (x < 1)
+        fun_l28_n462(x)
+    else
+        fun_l28_n680(x)
+    end
+end
+
+def fun_l27_n320(x)
+    if (x < 1)
+        fun_l28_n126(x)
+    else
+        fun_l28_n558(x)
+    end
+end
+
+def fun_l27_n321(x)
+    if (x < 1)
+        fun_l28_n869(x)
+    else
+        fun_l28_n581(x)
+    end
+end
+
+def fun_l27_n322(x)
+    if (x < 1)
+        fun_l28_n25(x)
+    else
+        fun_l28_n352(x)
+    end
+end
+
+def fun_l27_n323(x)
+    if (x < 1)
+        fun_l28_n203(x)
+    else
+        fun_l28_n776(x)
+    end
+end
+
+def fun_l27_n324(x)
+    if (x < 1)
+        fun_l28_n6(x)
+    else
+        fun_l28_n833(x)
+    end
+end
+
+def fun_l27_n325(x)
+    if (x < 1)
+        fun_l28_n817(x)
+    else
+        fun_l28_n258(x)
+    end
+end
+
+def fun_l27_n326(x)
+    if (x < 1)
+        fun_l28_n607(x)
+    else
+        fun_l28_n813(x)
+    end
+end
+
+def fun_l27_n327(x)
+    if (x < 1)
+        fun_l28_n761(x)
+    else
+        fun_l28_n893(x)
+    end
+end
+
+def fun_l27_n328(x)
+    if (x < 1)
+        fun_l28_n861(x)
+    else
+        fun_l28_n879(x)
+    end
+end
+
+def fun_l27_n329(x)
+    if (x < 1)
+        fun_l28_n682(x)
+    else
+        fun_l28_n680(x)
+    end
+end
+
+def fun_l27_n330(x)
+    if (x < 1)
+        fun_l28_n61(x)
+    else
+        fun_l28_n481(x)
+    end
+end
+
+def fun_l27_n331(x)
+    if (x < 1)
+        fun_l28_n738(x)
+    else
+        fun_l28_n230(x)
+    end
+end
+
+def fun_l27_n332(x)
+    if (x < 1)
+        fun_l28_n45(x)
+    else
+        fun_l28_n279(x)
+    end
+end
+
+def fun_l27_n333(x)
+    if (x < 1)
+        fun_l28_n24(x)
+    else
+        fun_l28_n561(x)
+    end
+end
+
+def fun_l27_n334(x)
+    if (x < 1)
+        fun_l28_n459(x)
+    else
+        fun_l28_n594(x)
+    end
+end
+
+def fun_l27_n335(x)
+    if (x < 1)
+        fun_l28_n695(x)
+    else
+        fun_l28_n513(x)
+    end
+end
+
+def fun_l27_n336(x)
+    if (x < 1)
+        fun_l28_n729(x)
+    else
+        fun_l28_n89(x)
+    end
+end
+
+def fun_l27_n337(x)
+    if (x < 1)
+        fun_l28_n509(x)
+    else
+        fun_l28_n574(x)
+    end
+end
+
+def fun_l27_n338(x)
+    if (x < 1)
+        fun_l28_n80(x)
+    else
+        fun_l28_n448(x)
+    end
+end
+
+def fun_l27_n339(x)
+    if (x < 1)
+        fun_l28_n279(x)
+    else
+        fun_l28_n177(x)
+    end
+end
+
+def fun_l27_n340(x)
+    if (x < 1)
+        fun_l28_n508(x)
+    else
+        fun_l28_n706(x)
+    end
+end
+
+def fun_l27_n341(x)
+    if (x < 1)
+        fun_l28_n790(x)
+    else
+        fun_l28_n774(x)
+    end
+end
+
+def fun_l27_n342(x)
+    if (x < 1)
+        fun_l28_n606(x)
+    else
+        fun_l28_n642(x)
+    end
+end
+
+def fun_l27_n343(x)
+    if (x < 1)
+        fun_l28_n108(x)
+    else
+        fun_l28_n539(x)
+    end
+end
+
+def fun_l27_n344(x)
+    if (x < 1)
+        fun_l28_n418(x)
+    else
+        fun_l28_n687(x)
+    end
+end
+
+def fun_l27_n345(x)
+    if (x < 1)
+        fun_l28_n386(x)
+    else
+        fun_l28_n170(x)
+    end
+end
+
+def fun_l27_n346(x)
+    if (x < 1)
+        fun_l28_n648(x)
+    else
+        fun_l28_n340(x)
+    end
+end
+
+def fun_l27_n347(x)
+    if (x < 1)
+        fun_l28_n516(x)
+    else
+        fun_l28_n586(x)
+    end
+end
+
+def fun_l27_n348(x)
+    if (x < 1)
+        fun_l28_n646(x)
+    else
+        fun_l28_n448(x)
+    end
+end
+
+def fun_l27_n349(x)
+    if (x < 1)
+        fun_l28_n378(x)
+    else
+        fun_l28_n413(x)
+    end
+end
+
+def fun_l27_n350(x)
+    if (x < 1)
+        fun_l28_n885(x)
+    else
+        fun_l28_n932(x)
+    end
+end
+
+def fun_l27_n351(x)
+    if (x < 1)
+        fun_l28_n9(x)
+    else
+        fun_l28_n843(x)
+    end
+end
+
+def fun_l27_n352(x)
+    if (x < 1)
+        fun_l28_n502(x)
+    else
+        fun_l28_n229(x)
+    end
+end
+
+def fun_l27_n353(x)
+    if (x < 1)
+        fun_l28_n752(x)
+    else
+        fun_l28_n677(x)
+    end
+end
+
+def fun_l27_n354(x)
+    if (x < 1)
+        fun_l28_n246(x)
+    else
+        fun_l28_n32(x)
+    end
+end
+
+def fun_l27_n355(x)
+    if (x < 1)
+        fun_l28_n969(x)
+    else
+        fun_l28_n933(x)
+    end
+end
+
+def fun_l27_n356(x)
+    if (x < 1)
+        fun_l28_n44(x)
+    else
+        fun_l28_n704(x)
+    end
+end
+
+def fun_l27_n357(x)
+    if (x < 1)
+        fun_l28_n863(x)
+    else
+        fun_l28_n324(x)
+    end
+end
+
+def fun_l27_n358(x)
+    if (x < 1)
+        fun_l28_n467(x)
+    else
+        fun_l28_n418(x)
+    end
+end
+
+def fun_l27_n359(x)
+    if (x < 1)
+        fun_l28_n222(x)
+    else
+        fun_l28_n138(x)
+    end
+end
+
+def fun_l27_n360(x)
+    if (x < 1)
+        fun_l28_n261(x)
+    else
+        fun_l28_n605(x)
+    end
+end
+
+def fun_l27_n361(x)
+    if (x < 1)
+        fun_l28_n470(x)
+    else
+        fun_l28_n519(x)
+    end
+end
+
+def fun_l27_n362(x)
+    if (x < 1)
+        fun_l28_n717(x)
+    else
+        fun_l28_n817(x)
+    end
+end
+
+def fun_l27_n363(x)
+    if (x < 1)
+        fun_l28_n591(x)
+    else
+        fun_l28_n537(x)
+    end
+end
+
+def fun_l27_n364(x)
+    if (x < 1)
+        fun_l28_n733(x)
+    else
+        fun_l28_n222(x)
+    end
+end
+
+def fun_l27_n365(x)
+    if (x < 1)
+        fun_l28_n137(x)
+    else
+        fun_l28_n225(x)
+    end
+end
+
+def fun_l27_n366(x)
+    if (x < 1)
+        fun_l28_n610(x)
+    else
+        fun_l28_n870(x)
+    end
+end
+
+def fun_l27_n367(x)
+    if (x < 1)
+        fun_l28_n697(x)
+    else
+        fun_l28_n866(x)
+    end
+end
+
+def fun_l27_n368(x)
+    if (x < 1)
+        fun_l28_n902(x)
+    else
+        fun_l28_n827(x)
+    end
+end
+
+def fun_l27_n369(x)
+    if (x < 1)
+        fun_l28_n769(x)
+    else
+        fun_l28_n238(x)
+    end
+end
+
+def fun_l27_n370(x)
+    if (x < 1)
+        fun_l28_n66(x)
+    else
+        fun_l28_n958(x)
+    end
+end
+
+def fun_l27_n371(x)
+    if (x < 1)
+        fun_l28_n847(x)
+    else
+        fun_l28_n177(x)
+    end
+end
+
+def fun_l27_n372(x)
+    if (x < 1)
+        fun_l28_n64(x)
+    else
+        fun_l28_n198(x)
+    end
+end
+
+def fun_l27_n373(x)
+    if (x < 1)
+        fun_l28_n36(x)
+    else
+        fun_l28_n282(x)
+    end
+end
+
+def fun_l27_n374(x)
+    if (x < 1)
+        fun_l28_n647(x)
+    else
+        fun_l28_n228(x)
+    end
+end
+
+def fun_l27_n375(x)
+    if (x < 1)
+        fun_l28_n737(x)
+    else
+        fun_l28_n689(x)
+    end
+end
+
+def fun_l27_n376(x)
+    if (x < 1)
+        fun_l28_n336(x)
+    else
+        fun_l28_n20(x)
+    end
+end
+
+def fun_l27_n377(x)
+    if (x < 1)
+        fun_l28_n859(x)
+    else
+        fun_l28_n661(x)
+    end
+end
+
+def fun_l27_n378(x)
+    if (x < 1)
+        fun_l28_n148(x)
+    else
+        fun_l28_n197(x)
+    end
+end
+
+def fun_l27_n379(x)
+    if (x < 1)
+        fun_l28_n986(x)
+    else
+        fun_l28_n441(x)
+    end
+end
+
+def fun_l27_n380(x)
+    if (x < 1)
+        fun_l28_n966(x)
+    else
+        fun_l28_n994(x)
+    end
+end
+
+def fun_l27_n381(x)
+    if (x < 1)
+        fun_l28_n546(x)
+    else
+        fun_l28_n687(x)
+    end
+end
+
+def fun_l27_n382(x)
+    if (x < 1)
+        fun_l28_n63(x)
+    else
+        fun_l28_n366(x)
+    end
+end
+
+def fun_l27_n383(x)
+    if (x < 1)
+        fun_l28_n146(x)
+    else
+        fun_l28_n96(x)
+    end
+end
+
+def fun_l27_n384(x)
+    if (x < 1)
+        fun_l28_n747(x)
+    else
+        fun_l28_n168(x)
+    end
+end
+
+def fun_l27_n385(x)
+    if (x < 1)
+        fun_l28_n556(x)
+    else
+        fun_l28_n194(x)
+    end
+end
+
+def fun_l27_n386(x)
+    if (x < 1)
+        fun_l28_n180(x)
+    else
+        fun_l28_n648(x)
+    end
+end
+
+def fun_l27_n387(x)
+    if (x < 1)
+        fun_l28_n898(x)
+    else
+        fun_l28_n499(x)
+    end
+end
+
+def fun_l27_n388(x)
+    if (x < 1)
+        fun_l28_n720(x)
+    else
+        fun_l28_n996(x)
+    end
+end
+
+def fun_l27_n389(x)
+    if (x < 1)
+        fun_l28_n743(x)
+    else
+        fun_l28_n781(x)
+    end
+end
+
+def fun_l27_n390(x)
+    if (x < 1)
+        fun_l28_n372(x)
+    else
+        fun_l28_n907(x)
+    end
+end
+
+def fun_l27_n391(x)
+    if (x < 1)
+        fun_l28_n893(x)
+    else
+        fun_l28_n911(x)
+    end
+end
+
+def fun_l27_n392(x)
+    if (x < 1)
+        fun_l28_n304(x)
+    else
+        fun_l28_n164(x)
+    end
+end
+
+def fun_l27_n393(x)
+    if (x < 1)
+        fun_l28_n212(x)
+    else
+        fun_l28_n575(x)
+    end
+end
+
+def fun_l27_n394(x)
+    if (x < 1)
+        fun_l28_n279(x)
+    else
+        fun_l28_n306(x)
+    end
+end
+
+def fun_l27_n395(x)
+    if (x < 1)
+        fun_l28_n662(x)
+    else
+        fun_l28_n838(x)
+    end
+end
+
+def fun_l27_n396(x)
+    if (x < 1)
+        fun_l28_n882(x)
+    else
+        fun_l28_n321(x)
+    end
+end
+
+def fun_l27_n397(x)
+    if (x < 1)
+        fun_l28_n996(x)
+    else
+        fun_l28_n170(x)
+    end
+end
+
+def fun_l27_n398(x)
+    if (x < 1)
+        fun_l28_n309(x)
+    else
+        fun_l28_n805(x)
+    end
+end
+
+def fun_l27_n399(x)
+    if (x < 1)
+        fun_l28_n584(x)
+    else
+        fun_l28_n304(x)
+    end
+end
+
+def fun_l27_n400(x)
+    if (x < 1)
+        fun_l28_n575(x)
+    else
+        fun_l28_n405(x)
+    end
+end
+
+def fun_l27_n401(x)
+    if (x < 1)
+        fun_l28_n507(x)
+    else
+        fun_l28_n773(x)
+    end
+end
+
+def fun_l27_n402(x)
+    if (x < 1)
+        fun_l28_n759(x)
+    else
+        fun_l28_n583(x)
+    end
+end
+
+def fun_l27_n403(x)
+    if (x < 1)
+        fun_l28_n689(x)
+    else
+        fun_l28_n511(x)
+    end
+end
+
+def fun_l27_n404(x)
+    if (x < 1)
+        fun_l28_n706(x)
+    else
+        fun_l28_n258(x)
+    end
+end
+
+def fun_l27_n405(x)
+    if (x < 1)
+        fun_l28_n736(x)
+    else
+        fun_l28_n482(x)
+    end
+end
+
+def fun_l27_n406(x)
+    if (x < 1)
+        fun_l28_n851(x)
+    else
+        fun_l28_n898(x)
+    end
+end
+
+def fun_l27_n407(x)
+    if (x < 1)
+        fun_l28_n86(x)
+    else
+        fun_l28_n913(x)
+    end
+end
+
+def fun_l27_n408(x)
+    if (x < 1)
+        fun_l28_n277(x)
+    else
+        fun_l28_n960(x)
+    end
+end
+
+def fun_l27_n409(x)
+    if (x < 1)
+        fun_l28_n137(x)
+    else
+        fun_l28_n789(x)
+    end
+end
+
+def fun_l27_n410(x)
+    if (x < 1)
+        fun_l28_n23(x)
+    else
+        fun_l28_n633(x)
+    end
+end
+
+def fun_l27_n411(x)
+    if (x < 1)
+        fun_l28_n246(x)
+    else
+        fun_l28_n560(x)
+    end
+end
+
+def fun_l27_n412(x)
+    if (x < 1)
+        fun_l28_n218(x)
+    else
+        fun_l28_n66(x)
+    end
+end
+
+def fun_l27_n413(x)
+    if (x < 1)
+        fun_l28_n680(x)
+    else
+        fun_l28_n9(x)
+    end
+end
+
+def fun_l27_n414(x)
+    if (x < 1)
+        fun_l28_n693(x)
+    else
+        fun_l28_n625(x)
+    end
+end
+
+def fun_l27_n415(x)
+    if (x < 1)
+        fun_l28_n560(x)
+    else
+        fun_l28_n739(x)
+    end
+end
+
+def fun_l27_n416(x)
+    if (x < 1)
+        fun_l28_n467(x)
+    else
+        fun_l28_n542(x)
+    end
+end
+
+def fun_l27_n417(x)
+    if (x < 1)
+        fun_l28_n364(x)
+    else
+        fun_l28_n468(x)
+    end
+end
+
+def fun_l27_n418(x)
+    if (x < 1)
+        fun_l28_n123(x)
+    else
+        fun_l28_n775(x)
+    end
+end
+
+def fun_l27_n419(x)
+    if (x < 1)
+        fun_l28_n17(x)
+    else
+        fun_l28_n875(x)
+    end
+end
+
+def fun_l27_n420(x)
+    if (x < 1)
+        fun_l28_n596(x)
+    else
+        fun_l28_n163(x)
+    end
+end
+
+def fun_l27_n421(x)
+    if (x < 1)
+        fun_l28_n638(x)
+    else
+        fun_l28_n426(x)
+    end
+end
+
+def fun_l27_n422(x)
+    if (x < 1)
+        fun_l28_n637(x)
+    else
+        fun_l28_n696(x)
+    end
+end
+
+def fun_l27_n423(x)
+    if (x < 1)
+        fun_l28_n299(x)
+    else
+        fun_l28_n218(x)
+    end
+end
+
+def fun_l27_n424(x)
+    if (x < 1)
+        fun_l28_n683(x)
+    else
+        fun_l28_n248(x)
+    end
+end
+
+def fun_l27_n425(x)
+    if (x < 1)
+        fun_l28_n272(x)
+    else
+        fun_l28_n359(x)
+    end
+end
+
+def fun_l27_n426(x)
+    if (x < 1)
+        fun_l28_n327(x)
+    else
+        fun_l28_n984(x)
+    end
+end
+
+def fun_l27_n427(x)
+    if (x < 1)
+        fun_l28_n912(x)
+    else
+        fun_l28_n393(x)
+    end
+end
+
+def fun_l27_n428(x)
+    if (x < 1)
+        fun_l28_n842(x)
+    else
+        fun_l28_n919(x)
+    end
+end
+
+def fun_l27_n429(x)
+    if (x < 1)
+        fun_l28_n721(x)
+    else
+        fun_l28_n36(x)
+    end
+end
+
+def fun_l27_n430(x)
+    if (x < 1)
+        fun_l28_n16(x)
+    else
+        fun_l28_n418(x)
+    end
+end
+
+def fun_l27_n431(x)
+    if (x < 1)
+        fun_l28_n747(x)
+    else
+        fun_l28_n132(x)
+    end
+end
+
+def fun_l27_n432(x)
+    if (x < 1)
+        fun_l28_n906(x)
+    else
+        fun_l28_n718(x)
+    end
+end
+
+def fun_l27_n433(x)
+    if (x < 1)
+        fun_l28_n508(x)
+    else
+        fun_l28_n862(x)
+    end
+end
+
+def fun_l27_n434(x)
+    if (x < 1)
+        fun_l28_n478(x)
+    else
+        fun_l28_n542(x)
+    end
+end
+
+def fun_l27_n435(x)
+    if (x < 1)
+        fun_l28_n186(x)
+    else
+        fun_l28_n976(x)
+    end
+end
+
+def fun_l27_n436(x)
+    if (x < 1)
+        fun_l28_n637(x)
+    else
+        fun_l28_n49(x)
+    end
+end
+
+def fun_l27_n437(x)
+    if (x < 1)
+        fun_l28_n242(x)
+    else
+        fun_l28_n774(x)
+    end
+end
+
+def fun_l27_n438(x)
+    if (x < 1)
+        fun_l28_n303(x)
+    else
+        fun_l28_n175(x)
+    end
+end
+
+def fun_l27_n439(x)
+    if (x < 1)
+        fun_l28_n851(x)
+    else
+        fun_l28_n908(x)
+    end
+end
+
+def fun_l27_n440(x)
+    if (x < 1)
+        fun_l28_n139(x)
+    else
+        fun_l28_n473(x)
+    end
+end
+
+def fun_l27_n441(x)
+    if (x < 1)
+        fun_l28_n70(x)
+    else
+        fun_l28_n406(x)
+    end
+end
+
+def fun_l27_n442(x)
+    if (x < 1)
+        fun_l28_n368(x)
+    else
+        fun_l28_n624(x)
+    end
+end
+
+def fun_l27_n443(x)
+    if (x < 1)
+        fun_l28_n900(x)
+    else
+        fun_l28_n173(x)
+    end
+end
+
+def fun_l27_n444(x)
+    if (x < 1)
+        fun_l28_n646(x)
+    else
+        fun_l28_n733(x)
+    end
+end
+
+def fun_l27_n445(x)
+    if (x < 1)
+        fun_l28_n859(x)
+    else
+        fun_l28_n100(x)
+    end
+end
+
+def fun_l27_n446(x)
+    if (x < 1)
+        fun_l28_n418(x)
+    else
+        fun_l28_n765(x)
+    end
+end
+
+def fun_l27_n447(x)
+    if (x < 1)
+        fun_l28_n204(x)
+    else
+        fun_l28_n541(x)
+    end
+end
+
+def fun_l27_n448(x)
+    if (x < 1)
+        fun_l28_n192(x)
+    else
+        fun_l28_n414(x)
+    end
+end
+
+def fun_l27_n449(x)
+    if (x < 1)
+        fun_l28_n904(x)
+    else
+        fun_l28_n247(x)
+    end
+end
+
+def fun_l27_n450(x)
+    if (x < 1)
+        fun_l28_n528(x)
+    else
+        fun_l28_n24(x)
+    end
+end
+
+def fun_l27_n451(x)
+    if (x < 1)
+        fun_l28_n312(x)
+    else
+        fun_l28_n48(x)
+    end
+end
+
+def fun_l27_n452(x)
+    if (x < 1)
+        fun_l28_n169(x)
+    else
+        fun_l28_n37(x)
+    end
+end
+
+def fun_l27_n453(x)
+    if (x < 1)
+        fun_l28_n713(x)
+    else
+        fun_l28_n168(x)
+    end
+end
+
+def fun_l27_n454(x)
+    if (x < 1)
+        fun_l28_n748(x)
+    else
+        fun_l28_n213(x)
+    end
+end
+
+def fun_l27_n455(x)
+    if (x < 1)
+        fun_l28_n157(x)
+    else
+        fun_l28_n444(x)
+    end
+end
+
+def fun_l27_n456(x)
+    if (x < 1)
+        fun_l28_n32(x)
+    else
+        fun_l28_n475(x)
+    end
+end
+
+def fun_l27_n457(x)
+    if (x < 1)
+        fun_l28_n252(x)
+    else
+        fun_l28_n730(x)
+    end
+end
+
+def fun_l27_n458(x)
+    if (x < 1)
+        fun_l28_n261(x)
+    else
+        fun_l28_n576(x)
+    end
+end
+
+def fun_l27_n459(x)
+    if (x < 1)
+        fun_l28_n859(x)
+    else
+        fun_l28_n401(x)
+    end
+end
+
+def fun_l27_n460(x)
+    if (x < 1)
+        fun_l28_n394(x)
+    else
+        fun_l28_n10(x)
+    end
+end
+
+def fun_l27_n461(x)
+    if (x < 1)
+        fun_l28_n89(x)
+    else
+        fun_l28_n402(x)
+    end
+end
+
+def fun_l27_n462(x)
+    if (x < 1)
+        fun_l28_n100(x)
+    else
+        fun_l28_n207(x)
+    end
+end
+
+def fun_l27_n463(x)
+    if (x < 1)
+        fun_l28_n907(x)
+    else
+        fun_l28_n354(x)
+    end
+end
+
+def fun_l27_n464(x)
+    if (x < 1)
+        fun_l28_n612(x)
+    else
+        fun_l28_n31(x)
+    end
+end
+
+def fun_l27_n465(x)
+    if (x < 1)
+        fun_l28_n622(x)
+    else
+        fun_l28_n342(x)
+    end
+end
+
+def fun_l27_n466(x)
+    if (x < 1)
+        fun_l28_n373(x)
+    else
+        fun_l28_n831(x)
+    end
+end
+
+def fun_l27_n467(x)
+    if (x < 1)
+        fun_l28_n858(x)
+    else
+        fun_l28_n233(x)
+    end
+end
+
+def fun_l27_n468(x)
+    if (x < 1)
+        fun_l28_n104(x)
+    else
+        fun_l28_n918(x)
+    end
+end
+
+def fun_l27_n469(x)
+    if (x < 1)
+        fun_l28_n778(x)
+    else
+        fun_l28_n758(x)
+    end
+end
+
+def fun_l27_n470(x)
+    if (x < 1)
+        fun_l28_n695(x)
+    else
+        fun_l28_n217(x)
+    end
+end
+
+def fun_l27_n471(x)
+    if (x < 1)
+        fun_l28_n781(x)
+    else
+        fun_l28_n584(x)
+    end
+end
+
+def fun_l27_n472(x)
+    if (x < 1)
+        fun_l28_n883(x)
+    else
+        fun_l28_n152(x)
+    end
+end
+
+def fun_l27_n473(x)
+    if (x < 1)
+        fun_l28_n525(x)
+    else
+        fun_l28_n369(x)
+    end
+end
+
+def fun_l27_n474(x)
+    if (x < 1)
+        fun_l28_n42(x)
+    else
+        fun_l28_n299(x)
+    end
+end
+
+def fun_l27_n475(x)
+    if (x < 1)
+        fun_l28_n174(x)
+    else
+        fun_l28_n664(x)
+    end
+end
+
+def fun_l27_n476(x)
+    if (x < 1)
+        fun_l28_n489(x)
+    else
+        fun_l28_n296(x)
+    end
+end
+
+def fun_l27_n477(x)
+    if (x < 1)
+        fun_l28_n725(x)
+    else
+        fun_l28_n384(x)
+    end
+end
+
+def fun_l27_n478(x)
+    if (x < 1)
+        fun_l28_n138(x)
+    else
+        fun_l28_n812(x)
+    end
+end
+
+def fun_l27_n479(x)
+    if (x < 1)
+        fun_l28_n161(x)
+    else
+        fun_l28_n786(x)
+    end
+end
+
+def fun_l27_n480(x)
+    if (x < 1)
+        fun_l28_n751(x)
+    else
+        fun_l28_n91(x)
+    end
+end
+
+def fun_l27_n481(x)
+    if (x < 1)
+        fun_l28_n434(x)
+    else
+        fun_l28_n507(x)
+    end
+end
+
+def fun_l27_n482(x)
+    if (x < 1)
+        fun_l28_n101(x)
+    else
+        fun_l28_n809(x)
+    end
+end
+
+def fun_l27_n483(x)
+    if (x < 1)
+        fun_l28_n79(x)
+    else
+        fun_l28_n565(x)
+    end
+end
+
+def fun_l27_n484(x)
+    if (x < 1)
+        fun_l28_n681(x)
+    else
+        fun_l28_n390(x)
+    end
+end
+
+def fun_l27_n485(x)
+    if (x < 1)
+        fun_l28_n950(x)
+    else
+        fun_l28_n262(x)
+    end
+end
+
+def fun_l27_n486(x)
+    if (x < 1)
+        fun_l28_n188(x)
+    else
+        fun_l28_n731(x)
+    end
+end
+
+def fun_l27_n487(x)
+    if (x < 1)
+        fun_l28_n724(x)
+    else
+        fun_l28_n806(x)
+    end
+end
+
+def fun_l27_n488(x)
+    if (x < 1)
+        fun_l28_n680(x)
+    else
+        fun_l28_n475(x)
+    end
+end
+
+def fun_l27_n489(x)
+    if (x < 1)
+        fun_l28_n662(x)
+    else
+        fun_l28_n242(x)
+    end
+end
+
+def fun_l27_n490(x)
+    if (x < 1)
+        fun_l28_n578(x)
+    else
+        fun_l28_n534(x)
+    end
+end
+
+def fun_l27_n491(x)
+    if (x < 1)
+        fun_l28_n173(x)
+    else
+        fun_l28_n239(x)
+    end
+end
+
+def fun_l27_n492(x)
+    if (x < 1)
+        fun_l28_n724(x)
+    else
+        fun_l28_n579(x)
+    end
+end
+
+def fun_l27_n493(x)
+    if (x < 1)
+        fun_l28_n449(x)
+    else
+        fun_l28_n44(x)
+    end
+end
+
+def fun_l27_n494(x)
+    if (x < 1)
+        fun_l28_n180(x)
+    else
+        fun_l28_n836(x)
+    end
+end
+
+def fun_l27_n495(x)
+    if (x < 1)
+        fun_l28_n232(x)
+    else
+        fun_l28_n371(x)
+    end
+end
+
+def fun_l27_n496(x)
+    if (x < 1)
+        fun_l28_n558(x)
+    else
+        fun_l28_n904(x)
+    end
+end
+
+def fun_l27_n497(x)
+    if (x < 1)
+        fun_l28_n324(x)
+    else
+        fun_l28_n85(x)
+    end
+end
+
+def fun_l27_n498(x)
+    if (x < 1)
+        fun_l28_n272(x)
+    else
+        fun_l28_n469(x)
+    end
+end
+
+def fun_l27_n499(x)
+    if (x < 1)
+        fun_l28_n232(x)
+    else
+        fun_l28_n899(x)
+    end
+end
+
+def fun_l27_n500(x)
+    if (x < 1)
+        fun_l28_n654(x)
+    else
+        fun_l28_n390(x)
+    end
+end
+
+def fun_l27_n501(x)
+    if (x < 1)
+        fun_l28_n84(x)
+    else
+        fun_l28_n74(x)
+    end
+end
+
+def fun_l27_n502(x)
+    if (x < 1)
+        fun_l28_n799(x)
+    else
+        fun_l28_n224(x)
+    end
+end
+
+def fun_l27_n503(x)
+    if (x < 1)
+        fun_l28_n635(x)
+    else
+        fun_l28_n770(x)
+    end
+end
+
+def fun_l27_n504(x)
+    if (x < 1)
+        fun_l28_n734(x)
+    else
+        fun_l28_n451(x)
+    end
+end
+
+def fun_l27_n505(x)
+    if (x < 1)
+        fun_l28_n340(x)
+    else
+        fun_l28_n318(x)
+    end
+end
+
+def fun_l27_n506(x)
+    if (x < 1)
+        fun_l28_n521(x)
+    else
+        fun_l28_n590(x)
+    end
+end
+
+def fun_l27_n507(x)
+    if (x < 1)
+        fun_l28_n727(x)
+    else
+        fun_l28_n825(x)
+    end
+end
+
+def fun_l27_n508(x)
+    if (x < 1)
+        fun_l28_n923(x)
+    else
+        fun_l28_n413(x)
+    end
+end
+
+def fun_l27_n509(x)
+    if (x < 1)
+        fun_l28_n825(x)
+    else
+        fun_l28_n235(x)
+    end
+end
+
+def fun_l27_n510(x)
+    if (x < 1)
+        fun_l28_n212(x)
+    else
+        fun_l28_n509(x)
+    end
+end
+
+def fun_l27_n511(x)
+    if (x < 1)
+        fun_l28_n6(x)
+    else
+        fun_l28_n16(x)
+    end
+end
+
+def fun_l27_n512(x)
+    if (x < 1)
+        fun_l28_n409(x)
+    else
+        fun_l28_n473(x)
+    end
+end
+
+def fun_l27_n513(x)
+    if (x < 1)
+        fun_l28_n220(x)
+    else
+        fun_l28_n383(x)
+    end
+end
+
+def fun_l27_n514(x)
+    if (x < 1)
+        fun_l28_n338(x)
+    else
+        fun_l28_n32(x)
+    end
+end
+
+def fun_l27_n515(x)
+    if (x < 1)
+        fun_l28_n218(x)
+    else
+        fun_l28_n307(x)
+    end
+end
+
+def fun_l27_n516(x)
+    if (x < 1)
+        fun_l28_n591(x)
+    else
+        fun_l28_n545(x)
+    end
+end
+
+def fun_l27_n517(x)
+    if (x < 1)
+        fun_l28_n405(x)
+    else
+        fun_l28_n241(x)
+    end
+end
+
+def fun_l27_n518(x)
+    if (x < 1)
+        fun_l28_n545(x)
+    else
+        fun_l28_n215(x)
+    end
+end
+
+def fun_l27_n519(x)
+    if (x < 1)
+        fun_l28_n989(x)
+    else
+        fun_l28_n480(x)
+    end
+end
+
+def fun_l27_n520(x)
+    if (x < 1)
+        fun_l28_n479(x)
+    else
+        fun_l28_n869(x)
+    end
+end
+
+def fun_l27_n521(x)
+    if (x < 1)
+        fun_l28_n376(x)
+    else
+        fun_l28_n216(x)
+    end
+end
+
+def fun_l27_n522(x)
+    if (x < 1)
+        fun_l28_n74(x)
+    else
+        fun_l28_n370(x)
+    end
+end
+
+def fun_l27_n523(x)
+    if (x < 1)
+        fun_l28_n665(x)
+    else
+        fun_l28_n982(x)
+    end
+end
+
+def fun_l27_n524(x)
+    if (x < 1)
+        fun_l28_n412(x)
+    else
+        fun_l28_n515(x)
+    end
+end
+
+def fun_l27_n525(x)
+    if (x < 1)
+        fun_l28_n421(x)
+    else
+        fun_l28_n718(x)
+    end
+end
+
+def fun_l27_n526(x)
+    if (x < 1)
+        fun_l28_n914(x)
+    else
+        fun_l28_n297(x)
+    end
+end
+
+def fun_l27_n527(x)
+    if (x < 1)
+        fun_l28_n134(x)
+    else
+        fun_l28_n602(x)
+    end
+end
+
+def fun_l27_n528(x)
+    if (x < 1)
+        fun_l28_n0(x)
+    else
+        fun_l28_n23(x)
+    end
+end
+
+def fun_l27_n529(x)
+    if (x < 1)
+        fun_l28_n610(x)
+    else
+        fun_l28_n736(x)
+    end
+end
+
+def fun_l27_n530(x)
+    if (x < 1)
+        fun_l28_n350(x)
+    else
+        fun_l28_n51(x)
+    end
+end
+
+def fun_l27_n531(x)
+    if (x < 1)
+        fun_l28_n648(x)
+    else
+        fun_l28_n382(x)
+    end
+end
+
+def fun_l27_n532(x)
+    if (x < 1)
+        fun_l28_n432(x)
+    else
+        fun_l28_n872(x)
+    end
+end
+
+def fun_l27_n533(x)
+    if (x < 1)
+        fun_l28_n747(x)
+    else
+        fun_l28_n588(x)
+    end
+end
+
+def fun_l27_n534(x)
+    if (x < 1)
+        fun_l28_n763(x)
+    else
+        fun_l28_n846(x)
+    end
+end
+
+def fun_l27_n535(x)
+    if (x < 1)
+        fun_l28_n300(x)
+    else
+        fun_l28_n26(x)
+    end
+end
+
+def fun_l27_n536(x)
+    if (x < 1)
+        fun_l28_n851(x)
+    else
+        fun_l28_n907(x)
+    end
+end
+
+def fun_l27_n537(x)
+    if (x < 1)
+        fun_l28_n759(x)
+    else
+        fun_l28_n927(x)
+    end
+end
+
+def fun_l27_n538(x)
+    if (x < 1)
+        fun_l28_n188(x)
+    else
+        fun_l28_n199(x)
+    end
+end
+
+def fun_l27_n539(x)
+    if (x < 1)
+        fun_l28_n496(x)
+    else
+        fun_l28_n664(x)
+    end
+end
+
+def fun_l27_n540(x)
+    if (x < 1)
+        fun_l28_n595(x)
+    else
+        fun_l28_n651(x)
+    end
+end
+
+def fun_l27_n541(x)
+    if (x < 1)
+        fun_l28_n678(x)
+    else
+        fun_l28_n172(x)
+    end
+end
+
+def fun_l27_n542(x)
+    if (x < 1)
+        fun_l28_n37(x)
+    else
+        fun_l28_n255(x)
+    end
+end
+
+def fun_l27_n543(x)
+    if (x < 1)
+        fun_l28_n58(x)
+    else
+        fun_l28_n367(x)
+    end
+end
+
+def fun_l27_n544(x)
+    if (x < 1)
+        fun_l28_n275(x)
+    else
+        fun_l28_n925(x)
+    end
+end
+
+def fun_l27_n545(x)
+    if (x < 1)
+        fun_l28_n469(x)
+    else
+        fun_l28_n774(x)
+    end
+end
+
+def fun_l27_n546(x)
+    if (x < 1)
+        fun_l28_n508(x)
+    else
+        fun_l28_n267(x)
+    end
+end
+
+def fun_l27_n547(x)
+    if (x < 1)
+        fun_l28_n288(x)
+    else
+        fun_l28_n64(x)
+    end
+end
+
+def fun_l27_n548(x)
+    if (x < 1)
+        fun_l28_n941(x)
+    else
+        fun_l28_n632(x)
+    end
+end
+
+def fun_l27_n549(x)
+    if (x < 1)
+        fun_l28_n816(x)
+    else
+        fun_l28_n551(x)
+    end
+end
+
+def fun_l27_n550(x)
+    if (x < 1)
+        fun_l28_n848(x)
+    else
+        fun_l28_n778(x)
+    end
+end
+
+def fun_l27_n551(x)
+    if (x < 1)
+        fun_l28_n273(x)
+    else
+        fun_l28_n846(x)
+    end
+end
+
+def fun_l27_n552(x)
+    if (x < 1)
+        fun_l28_n18(x)
+    else
+        fun_l28_n530(x)
+    end
+end
+
+def fun_l27_n553(x)
+    if (x < 1)
+        fun_l28_n673(x)
+    else
+        fun_l28_n824(x)
+    end
+end
+
+def fun_l27_n554(x)
+    if (x < 1)
+        fun_l28_n376(x)
+    else
+        fun_l28_n32(x)
+    end
+end
+
+def fun_l27_n555(x)
+    if (x < 1)
+        fun_l28_n500(x)
+    else
+        fun_l28_n389(x)
+    end
+end
+
+def fun_l27_n556(x)
+    if (x < 1)
+        fun_l28_n712(x)
+    else
+        fun_l28_n729(x)
+    end
+end
+
+def fun_l27_n557(x)
+    if (x < 1)
+        fun_l28_n951(x)
+    else
+        fun_l28_n846(x)
+    end
+end
+
+def fun_l27_n558(x)
+    if (x < 1)
+        fun_l28_n269(x)
+    else
+        fun_l28_n538(x)
+    end
+end
+
+def fun_l27_n559(x)
+    if (x < 1)
+        fun_l28_n72(x)
+    else
+        fun_l28_n711(x)
+    end
+end
+
+def fun_l27_n560(x)
+    if (x < 1)
+        fun_l28_n510(x)
+    else
+        fun_l28_n718(x)
+    end
+end
+
+def fun_l27_n561(x)
+    if (x < 1)
+        fun_l28_n123(x)
+    else
+        fun_l28_n983(x)
+    end
+end
+
+def fun_l27_n562(x)
+    if (x < 1)
+        fun_l28_n486(x)
+    else
+        fun_l28_n796(x)
+    end
+end
+
+def fun_l27_n563(x)
+    if (x < 1)
+        fun_l28_n925(x)
+    else
+        fun_l28_n499(x)
+    end
+end
+
+def fun_l27_n564(x)
+    if (x < 1)
+        fun_l28_n811(x)
+    else
+        fun_l28_n604(x)
+    end
+end
+
+def fun_l27_n565(x)
+    if (x < 1)
+        fun_l28_n685(x)
+    else
+        fun_l28_n721(x)
+    end
+end
+
+def fun_l27_n566(x)
+    if (x < 1)
+        fun_l28_n946(x)
+    else
+        fun_l28_n890(x)
+    end
+end
+
+def fun_l27_n567(x)
+    if (x < 1)
+        fun_l28_n646(x)
+    else
+        fun_l28_n2(x)
+    end
+end
+
+def fun_l27_n568(x)
+    if (x < 1)
+        fun_l28_n570(x)
+    else
+        fun_l28_n427(x)
+    end
+end
+
+def fun_l27_n569(x)
+    if (x < 1)
+        fun_l28_n435(x)
+    else
+        fun_l28_n877(x)
+    end
+end
+
+def fun_l27_n570(x)
+    if (x < 1)
+        fun_l28_n67(x)
+    else
+        fun_l28_n879(x)
+    end
+end
+
+def fun_l27_n571(x)
+    if (x < 1)
+        fun_l28_n278(x)
+    else
+        fun_l28_n90(x)
+    end
+end
+
+def fun_l27_n572(x)
+    if (x < 1)
+        fun_l28_n748(x)
+    else
+        fun_l28_n202(x)
+    end
+end
+
+def fun_l27_n573(x)
+    if (x < 1)
+        fun_l28_n795(x)
+    else
+        fun_l28_n862(x)
+    end
+end
+
+def fun_l27_n574(x)
+    if (x < 1)
+        fun_l28_n208(x)
+    else
+        fun_l28_n979(x)
+    end
+end
+
+def fun_l27_n575(x)
+    if (x < 1)
+        fun_l28_n134(x)
+    else
+        fun_l28_n208(x)
+    end
+end
+
+def fun_l27_n576(x)
+    if (x < 1)
+        fun_l28_n591(x)
+    else
+        fun_l28_n400(x)
+    end
+end
+
+def fun_l27_n577(x)
+    if (x < 1)
+        fun_l28_n579(x)
+    else
+        fun_l28_n675(x)
+    end
+end
+
+def fun_l27_n578(x)
+    if (x < 1)
+        fun_l28_n186(x)
+    else
+        fun_l28_n643(x)
+    end
+end
+
+def fun_l27_n579(x)
+    if (x < 1)
+        fun_l28_n974(x)
+    else
+        fun_l28_n716(x)
+    end
+end
+
+def fun_l27_n580(x)
+    if (x < 1)
+        fun_l28_n168(x)
+    else
+        fun_l28_n10(x)
+    end
+end
+
+def fun_l27_n581(x)
+    if (x < 1)
+        fun_l28_n124(x)
+    else
+        fun_l28_n657(x)
+    end
+end
+
+def fun_l27_n582(x)
+    if (x < 1)
+        fun_l28_n240(x)
+    else
+        fun_l28_n335(x)
+    end
+end
+
+def fun_l27_n583(x)
+    if (x < 1)
+        fun_l28_n346(x)
+    else
+        fun_l28_n170(x)
+    end
+end
+
+def fun_l27_n584(x)
+    if (x < 1)
+        fun_l28_n854(x)
+    else
+        fun_l28_n681(x)
+    end
+end
+
+def fun_l27_n585(x)
+    if (x < 1)
+        fun_l28_n515(x)
+    else
+        fun_l28_n884(x)
+    end
+end
+
+def fun_l27_n586(x)
+    if (x < 1)
+        fun_l28_n901(x)
+    else
+        fun_l28_n12(x)
+    end
+end
+
+def fun_l27_n587(x)
+    if (x < 1)
+        fun_l28_n300(x)
+    else
+        fun_l28_n205(x)
+    end
+end
+
+def fun_l27_n588(x)
+    if (x < 1)
+        fun_l28_n52(x)
+    else
+        fun_l28_n823(x)
+    end
+end
+
+def fun_l27_n589(x)
+    if (x < 1)
+        fun_l28_n170(x)
+    else
+        fun_l28_n588(x)
+    end
+end
+
+def fun_l27_n590(x)
+    if (x < 1)
+        fun_l28_n777(x)
+    else
+        fun_l28_n232(x)
+    end
+end
+
+def fun_l27_n591(x)
+    if (x < 1)
+        fun_l28_n234(x)
+    else
+        fun_l28_n552(x)
+    end
+end
+
+def fun_l27_n592(x)
+    if (x < 1)
+        fun_l28_n83(x)
+    else
+        fun_l28_n736(x)
+    end
+end
+
+def fun_l27_n593(x)
+    if (x < 1)
+        fun_l28_n623(x)
+    else
+        fun_l28_n663(x)
+    end
+end
+
+def fun_l27_n594(x)
+    if (x < 1)
+        fun_l28_n137(x)
+    else
+        fun_l28_n858(x)
+    end
+end
+
+def fun_l27_n595(x)
+    if (x < 1)
+        fun_l28_n238(x)
+    else
+        fun_l28_n11(x)
+    end
+end
+
+def fun_l27_n596(x)
+    if (x < 1)
+        fun_l28_n692(x)
+    else
+        fun_l28_n815(x)
+    end
+end
+
+def fun_l27_n597(x)
+    if (x < 1)
+        fun_l28_n259(x)
+    else
+        fun_l28_n535(x)
+    end
+end
+
+def fun_l27_n598(x)
+    if (x < 1)
+        fun_l28_n135(x)
+    else
+        fun_l28_n567(x)
+    end
+end
+
+def fun_l27_n599(x)
+    if (x < 1)
+        fun_l28_n725(x)
+    else
+        fun_l28_n393(x)
+    end
+end
+
+def fun_l27_n600(x)
+    if (x < 1)
+        fun_l28_n790(x)
+    else
+        fun_l28_n478(x)
+    end
+end
+
+def fun_l27_n601(x)
+    if (x < 1)
+        fun_l28_n248(x)
+    else
+        fun_l28_n62(x)
+    end
+end
+
+def fun_l27_n602(x)
+    if (x < 1)
+        fun_l28_n790(x)
+    else
+        fun_l28_n854(x)
+    end
+end
+
+def fun_l27_n603(x)
+    if (x < 1)
+        fun_l28_n345(x)
+    else
+        fun_l28_n795(x)
+    end
+end
+
+def fun_l27_n604(x)
+    if (x < 1)
+        fun_l28_n689(x)
+    else
+        fun_l28_n357(x)
+    end
+end
+
+def fun_l27_n605(x)
+    if (x < 1)
+        fun_l28_n314(x)
+    else
+        fun_l28_n886(x)
+    end
+end
+
+def fun_l27_n606(x)
+    if (x < 1)
+        fun_l28_n401(x)
+    else
+        fun_l28_n688(x)
+    end
+end
+
+def fun_l27_n607(x)
+    if (x < 1)
+        fun_l28_n386(x)
+    else
+        fun_l28_n126(x)
+    end
+end
+
+def fun_l27_n608(x)
+    if (x < 1)
+        fun_l28_n232(x)
+    else
+        fun_l28_n387(x)
+    end
+end
+
+def fun_l27_n609(x)
+    if (x < 1)
+        fun_l28_n938(x)
+    else
+        fun_l28_n657(x)
+    end
+end
+
+def fun_l27_n610(x)
+    if (x < 1)
+        fun_l28_n40(x)
+    else
+        fun_l28_n141(x)
+    end
+end
+
+def fun_l27_n611(x)
+    if (x < 1)
+        fun_l28_n909(x)
+    else
+        fun_l28_n265(x)
+    end
+end
+
+def fun_l27_n612(x)
+    if (x < 1)
+        fun_l28_n486(x)
+    else
+        fun_l28_n470(x)
+    end
+end
+
+def fun_l27_n613(x)
+    if (x < 1)
+        fun_l28_n959(x)
+    else
+        fun_l28_n793(x)
+    end
+end
+
+def fun_l27_n614(x)
+    if (x < 1)
+        fun_l28_n422(x)
+    else
+        fun_l28_n246(x)
+    end
+end
+
+def fun_l27_n615(x)
+    if (x < 1)
+        fun_l28_n860(x)
+    else
+        fun_l28_n315(x)
+    end
+end
+
+def fun_l27_n616(x)
+    if (x < 1)
+        fun_l28_n529(x)
+    else
+        fun_l28_n647(x)
+    end
+end
+
+def fun_l27_n617(x)
+    if (x < 1)
+        fun_l28_n860(x)
+    else
+        fun_l28_n860(x)
+    end
+end
+
+def fun_l27_n618(x)
+    if (x < 1)
+        fun_l28_n147(x)
+    else
+        fun_l28_n814(x)
+    end
+end
+
+def fun_l27_n619(x)
+    if (x < 1)
+        fun_l28_n828(x)
+    else
+        fun_l28_n854(x)
+    end
+end
+
+def fun_l27_n620(x)
+    if (x < 1)
+        fun_l28_n464(x)
+    else
+        fun_l28_n838(x)
+    end
+end
+
+def fun_l27_n621(x)
+    if (x < 1)
+        fun_l28_n89(x)
+    else
+        fun_l28_n884(x)
+    end
+end
+
+def fun_l27_n622(x)
+    if (x < 1)
+        fun_l28_n933(x)
+    else
+        fun_l28_n889(x)
+    end
+end
+
+def fun_l27_n623(x)
+    if (x < 1)
+        fun_l28_n638(x)
+    else
+        fun_l28_n246(x)
+    end
+end
+
+def fun_l27_n624(x)
+    if (x < 1)
+        fun_l28_n724(x)
+    else
+        fun_l28_n305(x)
+    end
+end
+
+def fun_l27_n625(x)
+    if (x < 1)
+        fun_l28_n927(x)
+    else
+        fun_l28_n772(x)
+    end
+end
+
+def fun_l27_n626(x)
+    if (x < 1)
+        fun_l28_n612(x)
+    else
+        fun_l28_n953(x)
+    end
+end
+
+def fun_l27_n627(x)
+    if (x < 1)
+        fun_l28_n694(x)
+    else
+        fun_l28_n529(x)
+    end
+end
+
+def fun_l27_n628(x)
+    if (x < 1)
+        fun_l28_n136(x)
+    else
+        fun_l28_n977(x)
+    end
+end
+
+def fun_l27_n629(x)
+    if (x < 1)
+        fun_l28_n108(x)
+    else
+        fun_l28_n940(x)
+    end
+end
+
+def fun_l27_n630(x)
+    if (x < 1)
+        fun_l28_n773(x)
+    else
+        fun_l28_n62(x)
+    end
+end
+
+def fun_l27_n631(x)
+    if (x < 1)
+        fun_l28_n531(x)
+    else
+        fun_l28_n68(x)
+    end
+end
+
+def fun_l27_n632(x)
+    if (x < 1)
+        fun_l28_n910(x)
+    else
+        fun_l28_n638(x)
+    end
+end
+
+def fun_l27_n633(x)
+    if (x < 1)
+        fun_l28_n943(x)
+    else
+        fun_l28_n530(x)
+    end
+end
+
+def fun_l27_n634(x)
+    if (x < 1)
+        fun_l28_n161(x)
+    else
+        fun_l28_n842(x)
+    end
+end
+
+def fun_l27_n635(x)
+    if (x < 1)
+        fun_l28_n252(x)
+    else
+        fun_l28_n659(x)
+    end
+end
+
+def fun_l27_n636(x)
+    if (x < 1)
+        fun_l28_n739(x)
+    else
+        fun_l28_n116(x)
+    end
+end
+
+def fun_l27_n637(x)
+    if (x < 1)
+        fun_l28_n528(x)
+    else
+        fun_l28_n451(x)
+    end
+end
+
+def fun_l27_n638(x)
+    if (x < 1)
+        fun_l28_n772(x)
+    else
+        fun_l28_n163(x)
+    end
+end
+
+def fun_l27_n639(x)
+    if (x < 1)
+        fun_l28_n300(x)
+    else
+        fun_l28_n174(x)
+    end
+end
+
+def fun_l27_n640(x)
+    if (x < 1)
+        fun_l28_n967(x)
+    else
+        fun_l28_n437(x)
+    end
+end
+
+def fun_l27_n641(x)
+    if (x < 1)
+        fun_l28_n716(x)
+    else
+        fun_l28_n855(x)
+    end
+end
+
+def fun_l27_n642(x)
+    if (x < 1)
+        fun_l28_n510(x)
+    else
+        fun_l28_n958(x)
+    end
+end
+
+def fun_l27_n643(x)
+    if (x < 1)
+        fun_l28_n57(x)
+    else
+        fun_l28_n347(x)
+    end
+end
+
+def fun_l27_n644(x)
+    if (x < 1)
+        fun_l28_n145(x)
+    else
+        fun_l28_n652(x)
+    end
+end
+
+def fun_l27_n645(x)
+    if (x < 1)
+        fun_l28_n730(x)
+    else
+        fun_l28_n388(x)
+    end
+end
+
+def fun_l27_n646(x)
+    if (x < 1)
+        fun_l28_n409(x)
+    else
+        fun_l28_n394(x)
+    end
+end
+
+def fun_l27_n647(x)
+    if (x < 1)
+        fun_l28_n484(x)
+    else
+        fun_l28_n754(x)
+    end
+end
+
+def fun_l27_n648(x)
+    if (x < 1)
+        fun_l28_n888(x)
+    else
+        fun_l28_n229(x)
+    end
+end
+
+def fun_l27_n649(x)
+    if (x < 1)
+        fun_l28_n1(x)
+    else
+        fun_l28_n995(x)
+    end
+end
+
+def fun_l27_n650(x)
+    if (x < 1)
+        fun_l28_n992(x)
+    else
+        fun_l28_n522(x)
+    end
+end
+
+def fun_l27_n651(x)
+    if (x < 1)
+        fun_l28_n69(x)
+    else
+        fun_l28_n696(x)
+    end
+end
+
+def fun_l27_n652(x)
+    if (x < 1)
+        fun_l28_n496(x)
+    else
+        fun_l28_n47(x)
+    end
+end
+
+def fun_l27_n653(x)
+    if (x < 1)
+        fun_l28_n176(x)
+    else
+        fun_l28_n830(x)
+    end
+end
+
+def fun_l27_n654(x)
+    if (x < 1)
+        fun_l28_n277(x)
+    else
+        fun_l28_n311(x)
+    end
+end
+
+def fun_l27_n655(x)
+    if (x < 1)
+        fun_l28_n994(x)
+    else
+        fun_l28_n518(x)
+    end
+end
+
+def fun_l27_n656(x)
+    if (x < 1)
+        fun_l28_n238(x)
+    else
+        fun_l28_n99(x)
+    end
+end
+
+def fun_l27_n657(x)
+    if (x < 1)
+        fun_l28_n636(x)
+    else
+        fun_l28_n734(x)
+    end
+end
+
+def fun_l27_n658(x)
+    if (x < 1)
+        fun_l28_n796(x)
+    else
+        fun_l28_n109(x)
+    end
+end
+
+def fun_l27_n659(x)
+    if (x < 1)
+        fun_l28_n271(x)
+    else
+        fun_l28_n348(x)
+    end
+end
+
+def fun_l27_n660(x)
+    if (x < 1)
+        fun_l28_n847(x)
+    else
+        fun_l28_n926(x)
+    end
+end
+
+def fun_l27_n661(x)
+    if (x < 1)
+        fun_l28_n559(x)
+    else
+        fun_l28_n636(x)
+    end
+end
+
+def fun_l27_n662(x)
+    if (x < 1)
+        fun_l28_n528(x)
+    else
+        fun_l28_n0(x)
+    end
+end
+
+def fun_l27_n663(x)
+    if (x < 1)
+        fun_l28_n835(x)
+    else
+        fun_l28_n41(x)
+    end
+end
+
+def fun_l27_n664(x)
+    if (x < 1)
+        fun_l28_n135(x)
+    else
+        fun_l28_n356(x)
+    end
+end
+
+def fun_l27_n665(x)
+    if (x < 1)
+        fun_l28_n825(x)
+    else
+        fun_l28_n55(x)
+    end
+end
+
+def fun_l27_n666(x)
+    if (x < 1)
+        fun_l28_n659(x)
+    else
+        fun_l28_n384(x)
+    end
+end
+
+def fun_l27_n667(x)
+    if (x < 1)
+        fun_l28_n604(x)
+    else
+        fun_l28_n870(x)
+    end
+end
+
+def fun_l27_n668(x)
+    if (x < 1)
+        fun_l28_n136(x)
+    else
+        fun_l28_n343(x)
+    end
+end
+
+def fun_l27_n669(x)
+    if (x < 1)
+        fun_l28_n206(x)
+    else
+        fun_l28_n341(x)
+    end
+end
+
+def fun_l27_n670(x)
+    if (x < 1)
+        fun_l28_n947(x)
+    else
+        fun_l28_n926(x)
+    end
+end
+
+def fun_l27_n671(x)
+    if (x < 1)
+        fun_l28_n303(x)
+    else
+        fun_l28_n79(x)
+    end
+end
+
+def fun_l27_n672(x)
+    if (x < 1)
+        fun_l28_n181(x)
+    else
+        fun_l28_n937(x)
+    end
+end
+
+def fun_l27_n673(x)
+    if (x < 1)
+        fun_l28_n301(x)
+    else
+        fun_l28_n687(x)
+    end
+end
+
+def fun_l27_n674(x)
+    if (x < 1)
+        fun_l28_n992(x)
+    else
+        fun_l28_n814(x)
+    end
+end
+
+def fun_l27_n675(x)
+    if (x < 1)
+        fun_l28_n239(x)
+    else
+        fun_l28_n248(x)
+    end
+end
+
+def fun_l27_n676(x)
+    if (x < 1)
+        fun_l28_n728(x)
+    else
+        fun_l28_n368(x)
+    end
+end
+
+def fun_l27_n677(x)
+    if (x < 1)
+        fun_l28_n411(x)
+    else
+        fun_l28_n773(x)
+    end
+end
+
+def fun_l27_n678(x)
+    if (x < 1)
+        fun_l28_n522(x)
+    else
+        fun_l28_n754(x)
+    end
+end
+
+def fun_l27_n679(x)
+    if (x < 1)
+        fun_l28_n538(x)
+    else
+        fun_l28_n976(x)
+    end
+end
+
+def fun_l27_n680(x)
+    if (x < 1)
+        fun_l28_n744(x)
+    else
+        fun_l28_n752(x)
+    end
+end
+
+def fun_l27_n681(x)
+    if (x < 1)
+        fun_l28_n658(x)
+    else
+        fun_l28_n19(x)
+    end
+end
+
+def fun_l27_n682(x)
+    if (x < 1)
+        fun_l28_n843(x)
+    else
+        fun_l28_n657(x)
+    end
+end
+
+def fun_l27_n683(x)
+    if (x < 1)
+        fun_l28_n256(x)
+    else
+        fun_l28_n744(x)
+    end
+end
+
+def fun_l27_n684(x)
+    if (x < 1)
+        fun_l28_n380(x)
+    else
+        fun_l28_n223(x)
+    end
+end
+
+def fun_l27_n685(x)
+    if (x < 1)
+        fun_l28_n762(x)
+    else
+        fun_l28_n122(x)
+    end
+end
+
+def fun_l27_n686(x)
+    if (x < 1)
+        fun_l28_n860(x)
+    else
+        fun_l28_n51(x)
+    end
+end
+
+def fun_l27_n687(x)
+    if (x < 1)
+        fun_l28_n210(x)
+    else
+        fun_l28_n658(x)
+    end
+end
+
+def fun_l27_n688(x)
+    if (x < 1)
+        fun_l28_n250(x)
+    else
+        fun_l28_n165(x)
+    end
+end
+
+def fun_l27_n689(x)
+    if (x < 1)
+        fun_l28_n955(x)
+    else
+        fun_l28_n862(x)
+    end
+end
+
+def fun_l27_n690(x)
+    if (x < 1)
+        fun_l28_n592(x)
+    else
+        fun_l28_n54(x)
+    end
+end
+
+def fun_l27_n691(x)
+    if (x < 1)
+        fun_l28_n558(x)
+    else
+        fun_l28_n750(x)
+    end
+end
+
+def fun_l27_n692(x)
+    if (x < 1)
+        fun_l28_n307(x)
+    else
+        fun_l28_n143(x)
+    end
+end
+
+def fun_l27_n693(x)
+    if (x < 1)
+        fun_l28_n625(x)
+    else
+        fun_l28_n743(x)
+    end
+end
+
+def fun_l27_n694(x)
+    if (x < 1)
+        fun_l28_n883(x)
+    else
+        fun_l28_n567(x)
+    end
+end
+
+def fun_l27_n695(x)
+    if (x < 1)
+        fun_l28_n889(x)
+    else
+        fun_l28_n805(x)
+    end
+end
+
+def fun_l27_n696(x)
+    if (x < 1)
+        fun_l28_n366(x)
+    else
+        fun_l28_n112(x)
+    end
+end
+
+def fun_l27_n697(x)
+    if (x < 1)
+        fun_l28_n746(x)
+    else
+        fun_l28_n924(x)
+    end
+end
+
+def fun_l27_n698(x)
+    if (x < 1)
+        fun_l28_n694(x)
+    else
+        fun_l28_n703(x)
+    end
+end
+
+def fun_l27_n699(x)
+    if (x < 1)
+        fun_l28_n304(x)
+    else
+        fun_l28_n200(x)
+    end
+end
+
+def fun_l27_n700(x)
+    if (x < 1)
+        fun_l28_n477(x)
+    else
+        fun_l28_n851(x)
+    end
+end
+
+def fun_l27_n701(x)
+    if (x < 1)
+        fun_l28_n940(x)
+    else
+        fun_l28_n8(x)
+    end
+end
+
+def fun_l27_n702(x)
+    if (x < 1)
+        fun_l28_n675(x)
+    else
+        fun_l28_n631(x)
+    end
+end
+
+def fun_l27_n703(x)
+    if (x < 1)
+        fun_l28_n683(x)
+    else
+        fun_l28_n191(x)
+    end
+end
+
+def fun_l27_n704(x)
+    if (x < 1)
+        fun_l28_n431(x)
+    else
+        fun_l28_n573(x)
+    end
+end
+
+def fun_l27_n705(x)
+    if (x < 1)
+        fun_l28_n86(x)
+    else
+        fun_l28_n89(x)
+    end
+end
+
+def fun_l27_n706(x)
+    if (x < 1)
+        fun_l28_n315(x)
+    else
+        fun_l28_n388(x)
+    end
+end
+
+def fun_l27_n707(x)
+    if (x < 1)
+        fun_l28_n94(x)
+    else
+        fun_l28_n176(x)
+    end
+end
+
+def fun_l27_n708(x)
+    if (x < 1)
+        fun_l28_n391(x)
+    else
+        fun_l28_n187(x)
+    end
+end
+
+def fun_l27_n709(x)
+    if (x < 1)
+        fun_l28_n845(x)
+    else
+        fun_l28_n497(x)
+    end
+end
+
+def fun_l27_n710(x)
+    if (x < 1)
+        fun_l28_n195(x)
+    else
+        fun_l28_n242(x)
+    end
+end
+
+def fun_l27_n711(x)
+    if (x < 1)
+        fun_l28_n276(x)
+    else
+        fun_l28_n856(x)
+    end
+end
+
+def fun_l27_n712(x)
+    if (x < 1)
+        fun_l28_n42(x)
+    else
+        fun_l28_n184(x)
+    end
+end
+
+def fun_l27_n713(x)
+    if (x < 1)
+        fun_l28_n270(x)
+    else
+        fun_l28_n813(x)
+    end
+end
+
+def fun_l27_n714(x)
+    if (x < 1)
+        fun_l28_n281(x)
+    else
+        fun_l28_n54(x)
+    end
+end
+
+def fun_l27_n715(x)
+    if (x < 1)
+        fun_l28_n226(x)
+    else
+        fun_l28_n202(x)
+    end
+end
+
+def fun_l27_n716(x)
+    if (x < 1)
+        fun_l28_n391(x)
+    else
+        fun_l28_n143(x)
+    end
+end
+
+def fun_l27_n717(x)
+    if (x < 1)
+        fun_l28_n449(x)
+    else
+        fun_l28_n530(x)
+    end
+end
+
+def fun_l27_n718(x)
+    if (x < 1)
+        fun_l28_n198(x)
+    else
+        fun_l28_n342(x)
+    end
+end
+
+def fun_l27_n719(x)
+    if (x < 1)
+        fun_l28_n741(x)
+    else
+        fun_l28_n703(x)
+    end
+end
+
+def fun_l27_n720(x)
+    if (x < 1)
+        fun_l28_n779(x)
+    else
+        fun_l28_n706(x)
+    end
+end
+
+def fun_l27_n721(x)
+    if (x < 1)
+        fun_l28_n184(x)
+    else
+        fun_l28_n472(x)
+    end
+end
+
+def fun_l27_n722(x)
+    if (x < 1)
+        fun_l28_n752(x)
+    else
+        fun_l28_n230(x)
+    end
+end
+
+def fun_l27_n723(x)
+    if (x < 1)
+        fun_l28_n137(x)
+    else
+        fun_l28_n228(x)
+    end
+end
+
+def fun_l27_n724(x)
+    if (x < 1)
+        fun_l28_n360(x)
+    else
+        fun_l28_n186(x)
+    end
+end
+
+def fun_l27_n725(x)
+    if (x < 1)
+        fun_l28_n791(x)
+    else
+        fun_l28_n752(x)
+    end
+end
+
+def fun_l27_n726(x)
+    if (x < 1)
+        fun_l28_n162(x)
+    else
+        fun_l28_n492(x)
+    end
+end
+
+def fun_l27_n727(x)
+    if (x < 1)
+        fun_l28_n329(x)
+    else
+        fun_l28_n286(x)
+    end
+end
+
+def fun_l27_n728(x)
+    if (x < 1)
+        fun_l28_n262(x)
+    else
+        fun_l28_n775(x)
+    end
+end
+
+def fun_l27_n729(x)
+    if (x < 1)
+        fun_l28_n773(x)
+    else
+        fun_l28_n424(x)
+    end
+end
+
+def fun_l27_n730(x)
+    if (x < 1)
+        fun_l28_n202(x)
+    else
+        fun_l28_n379(x)
+    end
+end
+
+def fun_l27_n731(x)
+    if (x < 1)
+        fun_l28_n761(x)
+    else
+        fun_l28_n759(x)
+    end
+end
+
+def fun_l27_n732(x)
+    if (x < 1)
+        fun_l28_n544(x)
+    else
+        fun_l28_n980(x)
+    end
+end
+
+def fun_l27_n733(x)
+    if (x < 1)
+        fun_l28_n75(x)
+    else
+        fun_l28_n786(x)
+    end
+end
+
+def fun_l27_n734(x)
+    if (x < 1)
+        fun_l28_n708(x)
+    else
+        fun_l28_n92(x)
+    end
+end
+
+def fun_l27_n735(x)
+    if (x < 1)
+        fun_l28_n213(x)
+    else
+        fun_l28_n966(x)
+    end
+end
+
+def fun_l27_n736(x)
+    if (x < 1)
+        fun_l28_n298(x)
+    else
+        fun_l28_n517(x)
+    end
+end
+
+def fun_l27_n737(x)
+    if (x < 1)
+        fun_l28_n665(x)
+    else
+        fun_l28_n960(x)
+    end
+end
+
+def fun_l27_n738(x)
+    if (x < 1)
+        fun_l28_n51(x)
+    else
+        fun_l28_n605(x)
+    end
+end
+
+def fun_l27_n739(x)
+    if (x < 1)
+        fun_l28_n931(x)
+    else
+        fun_l28_n697(x)
+    end
+end
+
+def fun_l27_n740(x)
+    if (x < 1)
+        fun_l28_n341(x)
+    else
+        fun_l28_n57(x)
+    end
+end
+
+def fun_l27_n741(x)
+    if (x < 1)
+        fun_l28_n614(x)
+    else
+        fun_l28_n623(x)
+    end
+end
+
+def fun_l27_n742(x)
+    if (x < 1)
+        fun_l28_n466(x)
+    else
+        fun_l28_n260(x)
+    end
+end
+
+def fun_l27_n743(x)
+    if (x < 1)
+        fun_l28_n741(x)
+    else
+        fun_l28_n337(x)
+    end
+end
+
+def fun_l27_n744(x)
+    if (x < 1)
+        fun_l28_n414(x)
+    else
+        fun_l28_n277(x)
+    end
+end
+
+def fun_l27_n745(x)
+    if (x < 1)
+        fun_l28_n377(x)
+    else
+        fun_l28_n245(x)
+    end
+end
+
+def fun_l27_n746(x)
+    if (x < 1)
+        fun_l28_n441(x)
+    else
+        fun_l28_n347(x)
+    end
+end
+
+def fun_l27_n747(x)
+    if (x < 1)
+        fun_l28_n473(x)
+    else
+        fun_l28_n54(x)
+    end
+end
+
+def fun_l27_n748(x)
+    if (x < 1)
+        fun_l28_n140(x)
+    else
+        fun_l28_n680(x)
+    end
+end
+
+def fun_l27_n749(x)
+    if (x < 1)
+        fun_l28_n491(x)
+    else
+        fun_l28_n830(x)
+    end
+end
+
+def fun_l27_n750(x)
+    if (x < 1)
+        fun_l28_n803(x)
+    else
+        fun_l28_n917(x)
+    end
+end
+
+def fun_l27_n751(x)
+    if (x < 1)
+        fun_l28_n97(x)
+    else
+        fun_l28_n702(x)
+    end
+end
+
+def fun_l27_n752(x)
+    if (x < 1)
+        fun_l28_n113(x)
+    else
+        fun_l28_n447(x)
+    end
+end
+
+def fun_l27_n753(x)
+    if (x < 1)
+        fun_l28_n589(x)
+    else
+        fun_l28_n933(x)
+    end
+end
+
+def fun_l27_n754(x)
+    if (x < 1)
+        fun_l28_n610(x)
+    else
+        fun_l28_n365(x)
+    end
+end
+
+def fun_l27_n755(x)
+    if (x < 1)
+        fun_l28_n813(x)
+    else
+        fun_l28_n930(x)
+    end
+end
+
+def fun_l27_n756(x)
+    if (x < 1)
+        fun_l28_n997(x)
+    else
+        fun_l28_n112(x)
+    end
+end
+
+def fun_l27_n757(x)
+    if (x < 1)
+        fun_l28_n635(x)
+    else
+        fun_l28_n852(x)
+    end
+end
+
+def fun_l27_n758(x)
+    if (x < 1)
+        fun_l28_n735(x)
+    else
+        fun_l28_n3(x)
+    end
+end
+
+def fun_l27_n759(x)
+    if (x < 1)
+        fun_l28_n473(x)
+    else
+        fun_l28_n276(x)
+    end
+end
+
+def fun_l27_n760(x)
+    if (x < 1)
+        fun_l28_n708(x)
+    else
+        fun_l28_n602(x)
+    end
+end
+
+def fun_l27_n761(x)
+    if (x < 1)
+        fun_l28_n178(x)
+    else
+        fun_l28_n766(x)
+    end
+end
+
+def fun_l27_n762(x)
+    if (x < 1)
+        fun_l28_n968(x)
+    else
+        fun_l28_n935(x)
+    end
+end
+
+def fun_l27_n763(x)
+    if (x < 1)
+        fun_l28_n17(x)
+    else
+        fun_l28_n680(x)
+    end
+end
+
+def fun_l27_n764(x)
+    if (x < 1)
+        fun_l28_n465(x)
+    else
+        fun_l28_n484(x)
+    end
+end
+
+def fun_l27_n765(x)
+    if (x < 1)
+        fun_l28_n157(x)
+    else
+        fun_l28_n33(x)
+    end
+end
+
+def fun_l27_n766(x)
+    if (x < 1)
+        fun_l28_n306(x)
+    else
+        fun_l28_n588(x)
+    end
+end
+
+def fun_l27_n767(x)
+    if (x < 1)
+        fun_l28_n73(x)
+    else
+        fun_l28_n144(x)
+    end
+end
+
+def fun_l27_n768(x)
+    if (x < 1)
+        fun_l28_n838(x)
+    else
+        fun_l28_n984(x)
+    end
+end
+
+def fun_l27_n769(x)
+    if (x < 1)
+        fun_l28_n541(x)
+    else
+        fun_l28_n687(x)
+    end
+end
+
+def fun_l27_n770(x)
+    if (x < 1)
+        fun_l28_n129(x)
+    else
+        fun_l28_n256(x)
+    end
+end
+
+def fun_l27_n771(x)
+    if (x < 1)
+        fun_l28_n78(x)
+    else
+        fun_l28_n617(x)
+    end
+end
+
+def fun_l27_n772(x)
+    if (x < 1)
+        fun_l28_n590(x)
+    else
+        fun_l28_n78(x)
+    end
+end
+
+def fun_l27_n773(x)
+    if (x < 1)
+        fun_l28_n609(x)
+    else
+        fun_l28_n942(x)
+    end
+end
+
+def fun_l27_n774(x)
+    if (x < 1)
+        fun_l28_n794(x)
+    else
+        fun_l28_n361(x)
+    end
+end
+
+def fun_l27_n775(x)
+    if (x < 1)
+        fun_l28_n632(x)
+    else
+        fun_l28_n722(x)
+    end
+end
+
+def fun_l27_n776(x)
+    if (x < 1)
+        fun_l28_n655(x)
+    else
+        fun_l28_n944(x)
+    end
+end
+
+def fun_l27_n777(x)
+    if (x < 1)
+        fun_l28_n117(x)
+    else
+        fun_l28_n725(x)
+    end
+end
+
+def fun_l27_n778(x)
+    if (x < 1)
+        fun_l28_n511(x)
+    else
+        fun_l28_n934(x)
+    end
+end
+
+def fun_l27_n779(x)
+    if (x < 1)
+        fun_l28_n11(x)
+    else
+        fun_l28_n421(x)
+    end
+end
+
+def fun_l27_n780(x)
+    if (x < 1)
+        fun_l28_n957(x)
+    else
+        fun_l28_n941(x)
+    end
+end
+
+def fun_l27_n781(x)
+    if (x < 1)
+        fun_l28_n899(x)
+    else
+        fun_l28_n122(x)
+    end
+end
+
+def fun_l27_n782(x)
+    if (x < 1)
+        fun_l28_n42(x)
+    else
+        fun_l28_n885(x)
+    end
+end
+
+def fun_l27_n783(x)
+    if (x < 1)
+        fun_l28_n696(x)
+    else
+        fun_l28_n25(x)
+    end
+end
+
+def fun_l27_n784(x)
+    if (x < 1)
+        fun_l28_n683(x)
+    else
+        fun_l28_n201(x)
+    end
+end
+
+def fun_l27_n785(x)
+    if (x < 1)
+        fun_l28_n337(x)
+    else
+        fun_l28_n977(x)
+    end
+end
+
+def fun_l27_n786(x)
+    if (x < 1)
+        fun_l28_n113(x)
+    else
+        fun_l28_n946(x)
+    end
+end
+
+def fun_l27_n787(x)
+    if (x < 1)
+        fun_l28_n311(x)
+    else
+        fun_l28_n396(x)
+    end
+end
+
+def fun_l27_n788(x)
+    if (x < 1)
+        fun_l28_n963(x)
+    else
+        fun_l28_n592(x)
+    end
+end
+
+def fun_l27_n789(x)
+    if (x < 1)
+        fun_l28_n647(x)
+    else
+        fun_l28_n614(x)
+    end
+end
+
+def fun_l27_n790(x)
+    if (x < 1)
+        fun_l28_n15(x)
+    else
+        fun_l28_n602(x)
+    end
+end
+
+def fun_l27_n791(x)
+    if (x < 1)
+        fun_l28_n648(x)
+    else
+        fun_l28_n921(x)
+    end
+end
+
+def fun_l27_n792(x)
+    if (x < 1)
+        fun_l28_n272(x)
+    else
+        fun_l28_n585(x)
+    end
+end
+
+def fun_l27_n793(x)
+    if (x < 1)
+        fun_l28_n74(x)
+    else
+        fun_l28_n412(x)
+    end
+end
+
+def fun_l27_n794(x)
+    if (x < 1)
+        fun_l28_n610(x)
+    else
+        fun_l28_n121(x)
+    end
+end
+
+def fun_l27_n795(x)
+    if (x < 1)
+        fun_l28_n905(x)
+    else
+        fun_l28_n620(x)
+    end
+end
+
+def fun_l27_n796(x)
+    if (x < 1)
+        fun_l28_n691(x)
+    else
+        fun_l28_n833(x)
+    end
+end
+
+def fun_l27_n797(x)
+    if (x < 1)
+        fun_l28_n148(x)
+    else
+        fun_l28_n223(x)
+    end
+end
+
+def fun_l27_n798(x)
+    if (x < 1)
+        fun_l28_n835(x)
+    else
+        fun_l28_n59(x)
+    end
+end
+
+def fun_l27_n799(x)
+    if (x < 1)
+        fun_l28_n317(x)
+    else
+        fun_l28_n39(x)
+    end
+end
+
+def fun_l27_n800(x)
+    if (x < 1)
+        fun_l28_n694(x)
+    else
+        fun_l28_n833(x)
+    end
+end
+
+def fun_l27_n801(x)
+    if (x < 1)
+        fun_l28_n280(x)
+    else
+        fun_l28_n322(x)
+    end
+end
+
+def fun_l27_n802(x)
+    if (x < 1)
+        fun_l28_n612(x)
+    else
+        fun_l28_n866(x)
+    end
+end
+
+def fun_l27_n803(x)
+    if (x < 1)
+        fun_l28_n114(x)
+    else
+        fun_l28_n901(x)
+    end
+end
+
+def fun_l27_n804(x)
+    if (x < 1)
+        fun_l28_n983(x)
+    else
+        fun_l28_n837(x)
+    end
+end
+
+def fun_l27_n805(x)
+    if (x < 1)
+        fun_l28_n225(x)
+    else
+        fun_l28_n345(x)
+    end
+end
+
+def fun_l27_n806(x)
+    if (x < 1)
+        fun_l28_n879(x)
+    else
+        fun_l28_n929(x)
+    end
+end
+
+def fun_l27_n807(x)
+    if (x < 1)
+        fun_l28_n41(x)
+    else
+        fun_l28_n670(x)
+    end
+end
+
+def fun_l27_n808(x)
+    if (x < 1)
+        fun_l28_n407(x)
+    else
+        fun_l28_n46(x)
+    end
+end
+
+def fun_l27_n809(x)
+    if (x < 1)
+        fun_l28_n377(x)
+    else
+        fun_l28_n646(x)
+    end
+end
+
+def fun_l27_n810(x)
+    if (x < 1)
+        fun_l28_n293(x)
+    else
+        fun_l28_n40(x)
+    end
+end
+
+def fun_l27_n811(x)
+    if (x < 1)
+        fun_l28_n150(x)
+    else
+        fun_l28_n743(x)
+    end
+end
+
+def fun_l27_n812(x)
+    if (x < 1)
+        fun_l28_n285(x)
+    else
+        fun_l28_n124(x)
+    end
+end
+
+def fun_l27_n813(x)
+    if (x < 1)
+        fun_l28_n861(x)
+    else
+        fun_l28_n641(x)
+    end
+end
+
+def fun_l27_n814(x)
+    if (x < 1)
+        fun_l28_n917(x)
+    else
+        fun_l28_n51(x)
+    end
+end
+
+def fun_l27_n815(x)
+    if (x < 1)
+        fun_l28_n573(x)
+    else
+        fun_l28_n551(x)
+    end
+end
+
+def fun_l27_n816(x)
+    if (x < 1)
+        fun_l28_n420(x)
+    else
+        fun_l28_n155(x)
+    end
+end
+
+def fun_l27_n817(x)
+    if (x < 1)
+        fun_l28_n283(x)
+    else
+        fun_l28_n797(x)
+    end
+end
+
+def fun_l27_n818(x)
+    if (x < 1)
+        fun_l28_n744(x)
+    else
+        fun_l28_n22(x)
+    end
+end
+
+def fun_l27_n819(x)
+    if (x < 1)
+        fun_l28_n370(x)
+    else
+        fun_l28_n287(x)
+    end
+end
+
+def fun_l27_n820(x)
+    if (x < 1)
+        fun_l28_n435(x)
+    else
+        fun_l28_n23(x)
+    end
+end
+
+def fun_l27_n821(x)
+    if (x < 1)
+        fun_l28_n947(x)
+    else
+        fun_l28_n200(x)
+    end
+end
+
+def fun_l27_n822(x)
+    if (x < 1)
+        fun_l28_n259(x)
+    else
+        fun_l28_n444(x)
+    end
+end
+
+def fun_l27_n823(x)
+    if (x < 1)
+        fun_l28_n663(x)
+    else
+        fun_l28_n755(x)
+    end
+end
+
+def fun_l27_n824(x)
+    if (x < 1)
+        fun_l28_n564(x)
+    else
+        fun_l28_n572(x)
+    end
+end
+
+def fun_l27_n825(x)
+    if (x < 1)
+        fun_l28_n679(x)
+    else
+        fun_l28_n351(x)
+    end
+end
+
+def fun_l27_n826(x)
+    if (x < 1)
+        fun_l28_n654(x)
+    else
+        fun_l28_n393(x)
+    end
+end
+
+def fun_l27_n827(x)
+    if (x < 1)
+        fun_l28_n454(x)
+    else
+        fun_l28_n698(x)
+    end
+end
+
+def fun_l27_n828(x)
+    if (x < 1)
+        fun_l28_n389(x)
+    else
+        fun_l28_n118(x)
+    end
+end
+
+def fun_l27_n829(x)
+    if (x < 1)
+        fun_l28_n918(x)
+    else
+        fun_l28_n176(x)
+    end
+end
+
+def fun_l27_n830(x)
+    if (x < 1)
+        fun_l28_n158(x)
+    else
+        fun_l28_n309(x)
+    end
+end
+
+def fun_l27_n831(x)
+    if (x < 1)
+        fun_l28_n86(x)
+    else
+        fun_l28_n250(x)
+    end
+end
+
+def fun_l27_n832(x)
+    if (x < 1)
+        fun_l28_n21(x)
+    else
+        fun_l28_n688(x)
+    end
+end
+
+def fun_l27_n833(x)
+    if (x < 1)
+        fun_l28_n587(x)
+    else
+        fun_l28_n484(x)
+    end
+end
+
+def fun_l27_n834(x)
+    if (x < 1)
+        fun_l28_n886(x)
+    else
+        fun_l28_n579(x)
+    end
+end
+
+def fun_l27_n835(x)
+    if (x < 1)
+        fun_l28_n923(x)
+    else
+        fun_l28_n140(x)
+    end
+end
+
+def fun_l27_n836(x)
+    if (x < 1)
+        fun_l28_n120(x)
+    else
+        fun_l28_n704(x)
+    end
+end
+
+def fun_l27_n837(x)
+    if (x < 1)
+        fun_l28_n905(x)
+    else
+        fun_l28_n918(x)
+    end
+end
+
+def fun_l27_n838(x)
+    if (x < 1)
+        fun_l28_n679(x)
+    else
+        fun_l28_n588(x)
+    end
+end
+
+def fun_l27_n839(x)
+    if (x < 1)
+        fun_l28_n445(x)
+    else
+        fun_l28_n187(x)
+    end
+end
+
+def fun_l27_n840(x)
+    if (x < 1)
+        fun_l28_n695(x)
+    else
+        fun_l28_n86(x)
+    end
+end
+
+def fun_l27_n841(x)
+    if (x < 1)
+        fun_l28_n784(x)
+    else
+        fun_l28_n802(x)
+    end
+end
+
+def fun_l27_n842(x)
+    if (x < 1)
+        fun_l28_n854(x)
+    else
+        fun_l28_n617(x)
+    end
+end
+
+def fun_l27_n843(x)
+    if (x < 1)
+        fun_l28_n466(x)
+    else
+        fun_l28_n261(x)
+    end
+end
+
+def fun_l27_n844(x)
+    if (x < 1)
+        fun_l28_n326(x)
+    else
+        fun_l28_n517(x)
+    end
+end
+
+def fun_l27_n845(x)
+    if (x < 1)
+        fun_l28_n686(x)
+    else
+        fun_l28_n81(x)
+    end
+end
+
+def fun_l27_n846(x)
+    if (x < 1)
+        fun_l28_n71(x)
+    else
+        fun_l28_n685(x)
+    end
+end
+
+def fun_l27_n847(x)
+    if (x < 1)
+        fun_l28_n622(x)
+    else
+        fun_l28_n469(x)
+    end
+end
+
+def fun_l27_n848(x)
+    if (x < 1)
+        fun_l28_n125(x)
+    else
+        fun_l28_n252(x)
+    end
+end
+
+def fun_l27_n849(x)
+    if (x < 1)
+        fun_l28_n820(x)
+    else
+        fun_l28_n752(x)
+    end
+end
+
+def fun_l27_n850(x)
+    if (x < 1)
+        fun_l28_n278(x)
+    else
+        fun_l28_n198(x)
+    end
+end
+
+def fun_l27_n851(x)
+    if (x < 1)
+        fun_l28_n631(x)
+    else
+        fun_l28_n241(x)
+    end
+end
+
+def fun_l27_n852(x)
+    if (x < 1)
+        fun_l28_n917(x)
+    else
+        fun_l28_n95(x)
+    end
+end
+
+def fun_l27_n853(x)
+    if (x < 1)
+        fun_l28_n271(x)
+    else
+        fun_l28_n493(x)
+    end
+end
+
+def fun_l27_n854(x)
+    if (x < 1)
+        fun_l28_n578(x)
+    else
+        fun_l28_n31(x)
+    end
+end
+
+def fun_l27_n855(x)
+    if (x < 1)
+        fun_l28_n407(x)
+    else
+        fun_l28_n694(x)
+    end
+end
+
+def fun_l27_n856(x)
+    if (x < 1)
+        fun_l28_n541(x)
+    else
+        fun_l28_n81(x)
+    end
+end
+
+def fun_l27_n857(x)
+    if (x < 1)
+        fun_l28_n144(x)
+    else
+        fun_l28_n965(x)
+    end
+end
+
+def fun_l27_n858(x)
+    if (x < 1)
+        fun_l28_n476(x)
+    else
+        fun_l28_n44(x)
+    end
+end
+
+def fun_l27_n859(x)
+    if (x < 1)
+        fun_l28_n647(x)
+    else
+        fun_l28_n973(x)
+    end
+end
+
+def fun_l27_n860(x)
+    if (x < 1)
+        fun_l28_n641(x)
+    else
+        fun_l28_n331(x)
+    end
+end
+
+def fun_l27_n861(x)
+    if (x < 1)
+        fun_l28_n75(x)
+    else
+        fun_l28_n10(x)
+    end
+end
+
+def fun_l27_n862(x)
+    if (x < 1)
+        fun_l28_n435(x)
+    else
+        fun_l28_n182(x)
+    end
+end
+
+def fun_l27_n863(x)
+    if (x < 1)
+        fun_l28_n244(x)
+    else
+        fun_l28_n135(x)
+    end
+end
+
+def fun_l27_n864(x)
+    if (x < 1)
+        fun_l28_n598(x)
+    else
+        fun_l28_n495(x)
+    end
+end
+
+def fun_l27_n865(x)
+    if (x < 1)
+        fun_l28_n456(x)
+    else
+        fun_l28_n16(x)
+    end
+end
+
+def fun_l27_n866(x)
+    if (x < 1)
+        fun_l28_n43(x)
+    else
+        fun_l28_n279(x)
+    end
+end
+
+def fun_l27_n867(x)
+    if (x < 1)
+        fun_l28_n853(x)
+    else
+        fun_l28_n906(x)
+    end
+end
+
+def fun_l27_n868(x)
+    if (x < 1)
+        fun_l28_n641(x)
+    else
+        fun_l28_n479(x)
+    end
+end
+
+def fun_l27_n869(x)
+    if (x < 1)
+        fun_l28_n78(x)
+    else
+        fun_l28_n727(x)
+    end
+end
+
+def fun_l27_n870(x)
+    if (x < 1)
+        fun_l28_n815(x)
+    else
+        fun_l28_n803(x)
+    end
+end
+
+def fun_l27_n871(x)
+    if (x < 1)
+        fun_l28_n343(x)
+    else
+        fun_l28_n665(x)
+    end
+end
+
+def fun_l27_n872(x)
+    if (x < 1)
+        fun_l28_n907(x)
+    else
+        fun_l28_n410(x)
+    end
+end
+
+def fun_l27_n873(x)
+    if (x < 1)
+        fun_l28_n797(x)
+    else
+        fun_l28_n626(x)
+    end
+end
+
+def fun_l27_n874(x)
+    if (x < 1)
+        fun_l28_n784(x)
+    else
+        fun_l28_n679(x)
+    end
+end
+
+def fun_l27_n875(x)
+    if (x < 1)
+        fun_l28_n247(x)
+    else
+        fun_l28_n89(x)
+    end
+end
+
+def fun_l27_n876(x)
+    if (x < 1)
+        fun_l28_n911(x)
+    else
+        fun_l28_n503(x)
+    end
+end
+
+def fun_l27_n877(x)
+    if (x < 1)
+        fun_l28_n233(x)
+    else
+        fun_l28_n437(x)
+    end
+end
+
+def fun_l27_n878(x)
+    if (x < 1)
+        fun_l28_n913(x)
+    else
+        fun_l28_n984(x)
+    end
+end
+
+def fun_l27_n879(x)
+    if (x < 1)
+        fun_l28_n690(x)
+    else
+        fun_l28_n642(x)
+    end
+end
+
+def fun_l27_n880(x)
+    if (x < 1)
+        fun_l28_n222(x)
+    else
+        fun_l28_n400(x)
+    end
+end
+
+def fun_l27_n881(x)
+    if (x < 1)
+        fun_l28_n611(x)
+    else
+        fun_l28_n446(x)
+    end
+end
+
+def fun_l27_n882(x)
+    if (x < 1)
+        fun_l28_n821(x)
+    else
+        fun_l28_n784(x)
+    end
+end
+
+def fun_l27_n883(x)
+    if (x < 1)
+        fun_l28_n849(x)
+    else
+        fun_l28_n83(x)
+    end
+end
+
+def fun_l27_n884(x)
+    if (x < 1)
+        fun_l28_n366(x)
+    else
+        fun_l28_n822(x)
+    end
+end
+
+def fun_l27_n885(x)
+    if (x < 1)
+        fun_l28_n40(x)
+    else
+        fun_l28_n626(x)
+    end
+end
+
+def fun_l27_n886(x)
+    if (x < 1)
+        fun_l28_n280(x)
+    else
+        fun_l28_n957(x)
+    end
+end
+
+def fun_l27_n887(x)
+    if (x < 1)
+        fun_l28_n466(x)
+    else
+        fun_l28_n377(x)
+    end
+end
+
+def fun_l27_n888(x)
+    if (x < 1)
+        fun_l28_n258(x)
+    else
+        fun_l28_n816(x)
+    end
+end
+
+def fun_l27_n889(x)
+    if (x < 1)
+        fun_l28_n893(x)
+    else
+        fun_l28_n263(x)
+    end
+end
+
+def fun_l27_n890(x)
+    if (x < 1)
+        fun_l28_n366(x)
+    else
+        fun_l28_n890(x)
+    end
+end
+
+def fun_l27_n891(x)
+    if (x < 1)
+        fun_l28_n692(x)
+    else
+        fun_l28_n781(x)
+    end
+end
+
+def fun_l27_n892(x)
+    if (x < 1)
+        fun_l28_n301(x)
+    else
+        fun_l28_n142(x)
+    end
+end
+
+def fun_l27_n893(x)
+    if (x < 1)
+        fun_l28_n275(x)
+    else
+        fun_l28_n302(x)
+    end
+end
+
+def fun_l27_n894(x)
+    if (x < 1)
+        fun_l28_n726(x)
+    else
+        fun_l28_n445(x)
+    end
+end
+
+def fun_l27_n895(x)
+    if (x < 1)
+        fun_l28_n859(x)
+    else
+        fun_l28_n839(x)
+    end
+end
+
+def fun_l27_n896(x)
+    if (x < 1)
+        fun_l28_n252(x)
+    else
+        fun_l28_n844(x)
+    end
+end
+
+def fun_l27_n897(x)
+    if (x < 1)
+        fun_l28_n245(x)
+    else
+        fun_l28_n133(x)
+    end
+end
+
+def fun_l27_n898(x)
+    if (x < 1)
+        fun_l28_n233(x)
+    else
+        fun_l28_n417(x)
+    end
+end
+
+def fun_l27_n899(x)
+    if (x < 1)
+        fun_l28_n171(x)
+    else
+        fun_l28_n479(x)
+    end
+end
+
+def fun_l27_n900(x)
+    if (x < 1)
+        fun_l28_n528(x)
+    else
+        fun_l28_n196(x)
+    end
+end
+
+def fun_l27_n901(x)
+    if (x < 1)
+        fun_l28_n243(x)
+    else
+        fun_l28_n270(x)
+    end
+end
+
+def fun_l27_n902(x)
+    if (x < 1)
+        fun_l28_n319(x)
+    else
+        fun_l28_n885(x)
+    end
+end
+
+def fun_l27_n903(x)
+    if (x < 1)
+        fun_l28_n570(x)
+    else
+        fun_l28_n321(x)
+    end
+end
+
+def fun_l27_n904(x)
+    if (x < 1)
+        fun_l28_n522(x)
+    else
+        fun_l28_n720(x)
+    end
+end
+
+def fun_l27_n905(x)
+    if (x < 1)
+        fun_l28_n820(x)
+    else
+        fun_l28_n789(x)
+    end
+end
+
+def fun_l27_n906(x)
+    if (x < 1)
+        fun_l28_n592(x)
+    else
+        fun_l28_n113(x)
+    end
+end
+
+def fun_l27_n907(x)
+    if (x < 1)
+        fun_l28_n432(x)
+    else
+        fun_l28_n591(x)
+    end
+end
+
+def fun_l27_n908(x)
+    if (x < 1)
+        fun_l28_n538(x)
+    else
+        fun_l28_n701(x)
+    end
+end
+
+def fun_l27_n909(x)
+    if (x < 1)
+        fun_l28_n963(x)
+    else
+        fun_l28_n756(x)
+    end
+end
+
+def fun_l27_n910(x)
+    if (x < 1)
+        fun_l28_n871(x)
+    else
+        fun_l28_n387(x)
+    end
+end
+
+def fun_l27_n911(x)
+    if (x < 1)
+        fun_l28_n779(x)
+    else
+        fun_l28_n862(x)
+    end
+end
+
+def fun_l27_n912(x)
+    if (x < 1)
+        fun_l28_n0(x)
+    else
+        fun_l28_n208(x)
+    end
+end
+
+def fun_l27_n913(x)
+    if (x < 1)
+        fun_l28_n994(x)
+    else
+        fun_l28_n756(x)
+    end
+end
+
+def fun_l27_n914(x)
+    if (x < 1)
+        fun_l28_n950(x)
+    else
+        fun_l28_n770(x)
+    end
+end
+
+def fun_l27_n915(x)
+    if (x < 1)
+        fun_l28_n922(x)
+    else
+        fun_l28_n372(x)
+    end
+end
+
+def fun_l27_n916(x)
+    if (x < 1)
+        fun_l28_n786(x)
+    else
+        fun_l28_n786(x)
+    end
+end
+
+def fun_l27_n917(x)
+    if (x < 1)
+        fun_l28_n745(x)
+    else
+        fun_l28_n822(x)
+    end
+end
+
+def fun_l27_n918(x)
+    if (x < 1)
+        fun_l28_n69(x)
+    else
+        fun_l28_n669(x)
+    end
+end
+
+def fun_l27_n919(x)
+    if (x < 1)
+        fun_l28_n714(x)
+    else
+        fun_l28_n777(x)
+    end
+end
+
+def fun_l27_n920(x)
+    if (x < 1)
+        fun_l28_n934(x)
+    else
+        fun_l28_n392(x)
+    end
+end
+
+def fun_l27_n921(x)
+    if (x < 1)
+        fun_l28_n746(x)
+    else
+        fun_l28_n355(x)
+    end
+end
+
+def fun_l27_n922(x)
+    if (x < 1)
+        fun_l28_n645(x)
+    else
+        fun_l28_n351(x)
+    end
+end
+
+def fun_l27_n923(x)
+    if (x < 1)
+        fun_l28_n48(x)
+    else
+        fun_l28_n826(x)
+    end
+end
+
+def fun_l27_n924(x)
+    if (x < 1)
+        fun_l28_n531(x)
+    else
+        fun_l28_n577(x)
+    end
+end
+
+def fun_l27_n925(x)
+    if (x < 1)
+        fun_l28_n907(x)
+    else
+        fun_l28_n136(x)
+    end
+end
+
+def fun_l27_n926(x)
+    if (x < 1)
+        fun_l28_n256(x)
+    else
+        fun_l28_n527(x)
+    end
+end
+
+def fun_l27_n927(x)
+    if (x < 1)
+        fun_l28_n870(x)
+    else
+        fun_l28_n475(x)
+    end
+end
+
+def fun_l27_n928(x)
+    if (x < 1)
+        fun_l28_n184(x)
+    else
+        fun_l28_n397(x)
+    end
+end
+
+def fun_l27_n929(x)
+    if (x < 1)
+        fun_l28_n99(x)
+    else
+        fun_l28_n363(x)
+    end
+end
+
+def fun_l27_n930(x)
+    if (x < 1)
+        fun_l28_n217(x)
+    else
+        fun_l28_n978(x)
+    end
+end
+
+def fun_l27_n931(x)
+    if (x < 1)
+        fun_l28_n372(x)
+    else
+        fun_l28_n542(x)
+    end
+end
+
+def fun_l27_n932(x)
+    if (x < 1)
+        fun_l28_n337(x)
+    else
+        fun_l28_n150(x)
+    end
+end
+
+def fun_l27_n933(x)
+    if (x < 1)
+        fun_l28_n81(x)
+    else
+        fun_l28_n206(x)
+    end
+end
+
+def fun_l27_n934(x)
+    if (x < 1)
+        fun_l28_n984(x)
+    else
+        fun_l28_n748(x)
+    end
+end
+
+def fun_l27_n935(x)
+    if (x < 1)
+        fun_l28_n746(x)
+    else
+        fun_l28_n824(x)
+    end
+end
+
+def fun_l27_n936(x)
+    if (x < 1)
+        fun_l28_n737(x)
+    else
+        fun_l28_n353(x)
+    end
+end
+
+def fun_l27_n937(x)
+    if (x < 1)
+        fun_l28_n681(x)
+    else
+        fun_l28_n518(x)
+    end
+end
+
+def fun_l27_n938(x)
+    if (x < 1)
+        fun_l28_n401(x)
+    else
+        fun_l28_n99(x)
+    end
+end
+
+def fun_l27_n939(x)
+    if (x < 1)
+        fun_l28_n821(x)
+    else
+        fun_l28_n456(x)
+    end
+end
+
+def fun_l27_n940(x)
+    if (x < 1)
+        fun_l28_n411(x)
+    else
+        fun_l28_n578(x)
+    end
+end
+
+def fun_l27_n941(x)
+    if (x < 1)
+        fun_l28_n318(x)
+    else
+        fun_l28_n479(x)
+    end
+end
+
+def fun_l27_n942(x)
+    if (x < 1)
+        fun_l28_n229(x)
+    else
+        fun_l28_n338(x)
+    end
+end
+
+def fun_l27_n943(x)
+    if (x < 1)
+        fun_l28_n195(x)
+    else
+        fun_l28_n667(x)
+    end
+end
+
+def fun_l27_n944(x)
+    if (x < 1)
+        fun_l28_n256(x)
+    else
+        fun_l28_n309(x)
+    end
+end
+
+def fun_l27_n945(x)
+    if (x < 1)
+        fun_l28_n939(x)
+    else
+        fun_l28_n284(x)
+    end
+end
+
+def fun_l27_n946(x)
+    if (x < 1)
+        fun_l28_n70(x)
+    else
+        fun_l28_n408(x)
+    end
+end
+
+def fun_l27_n947(x)
+    if (x < 1)
+        fun_l28_n586(x)
+    else
+        fun_l28_n931(x)
+    end
+end
+
+def fun_l27_n948(x)
+    if (x < 1)
+        fun_l28_n878(x)
+    else
+        fun_l28_n95(x)
+    end
+end
+
+def fun_l27_n949(x)
+    if (x < 1)
+        fun_l28_n749(x)
+    else
+        fun_l28_n414(x)
+    end
+end
+
+def fun_l27_n950(x)
+    if (x < 1)
+        fun_l28_n913(x)
+    else
+        fun_l28_n933(x)
+    end
+end
+
+def fun_l27_n951(x)
+    if (x < 1)
+        fun_l28_n394(x)
+    else
+        fun_l28_n121(x)
+    end
+end
+
+def fun_l27_n952(x)
+    if (x < 1)
+        fun_l28_n381(x)
+    else
+        fun_l28_n279(x)
+    end
+end
+
+def fun_l27_n953(x)
+    if (x < 1)
+        fun_l28_n302(x)
+    else
+        fun_l28_n710(x)
+    end
+end
+
+def fun_l27_n954(x)
+    if (x < 1)
+        fun_l28_n765(x)
+    else
+        fun_l28_n254(x)
+    end
+end
+
+def fun_l27_n955(x)
+    if (x < 1)
+        fun_l28_n736(x)
+    else
+        fun_l28_n67(x)
+    end
+end
+
+def fun_l27_n956(x)
+    if (x < 1)
+        fun_l28_n61(x)
+    else
+        fun_l28_n873(x)
+    end
+end
+
+def fun_l27_n957(x)
+    if (x < 1)
+        fun_l28_n920(x)
+    else
+        fun_l28_n261(x)
+    end
+end
+
+def fun_l27_n958(x)
+    if (x < 1)
+        fun_l28_n350(x)
+    else
+        fun_l28_n545(x)
+    end
+end
+
+def fun_l27_n959(x)
+    if (x < 1)
+        fun_l28_n538(x)
+    else
+        fun_l28_n829(x)
+    end
+end
+
+def fun_l27_n960(x)
+    if (x < 1)
+        fun_l28_n920(x)
+    else
+        fun_l28_n534(x)
+    end
+end
+
+def fun_l27_n961(x)
+    if (x < 1)
+        fun_l28_n730(x)
+    else
+        fun_l28_n19(x)
+    end
+end
+
+def fun_l27_n962(x)
+    if (x < 1)
+        fun_l28_n293(x)
+    else
+        fun_l28_n187(x)
+    end
+end
+
+def fun_l27_n963(x)
+    if (x < 1)
+        fun_l28_n169(x)
+    else
+        fun_l28_n751(x)
+    end
+end
+
+def fun_l27_n964(x)
+    if (x < 1)
+        fun_l28_n195(x)
+    else
+        fun_l28_n112(x)
+    end
+end
+
+def fun_l27_n965(x)
+    if (x < 1)
+        fun_l28_n756(x)
+    else
+        fun_l28_n700(x)
+    end
+end
+
+def fun_l27_n966(x)
+    if (x < 1)
+        fun_l28_n739(x)
+    else
+        fun_l28_n320(x)
+    end
+end
+
+def fun_l27_n967(x)
+    if (x < 1)
+        fun_l28_n693(x)
+    else
+        fun_l28_n101(x)
+    end
+end
+
+def fun_l27_n968(x)
+    if (x < 1)
+        fun_l28_n94(x)
+    else
+        fun_l28_n131(x)
+    end
+end
+
+def fun_l27_n969(x)
+    if (x < 1)
+        fun_l28_n142(x)
+    else
+        fun_l28_n839(x)
+    end
+end
+
+def fun_l27_n970(x)
+    if (x < 1)
+        fun_l28_n792(x)
+    else
+        fun_l28_n243(x)
+    end
+end
+
+def fun_l27_n971(x)
+    if (x < 1)
+        fun_l28_n268(x)
+    else
+        fun_l28_n525(x)
+    end
+end
+
+def fun_l27_n972(x)
+    if (x < 1)
+        fun_l28_n776(x)
+    else
+        fun_l28_n117(x)
+    end
+end
+
+def fun_l27_n973(x)
+    if (x < 1)
+        fun_l28_n401(x)
+    else
+        fun_l28_n571(x)
+    end
+end
+
+def fun_l27_n974(x)
+    if (x < 1)
+        fun_l28_n515(x)
+    else
+        fun_l28_n5(x)
+    end
+end
+
+def fun_l27_n975(x)
+    if (x < 1)
+        fun_l28_n225(x)
+    else
+        fun_l28_n956(x)
+    end
+end
+
+def fun_l27_n976(x)
+    if (x < 1)
+        fun_l28_n536(x)
+    else
+        fun_l28_n379(x)
+    end
+end
+
+def fun_l27_n977(x)
+    if (x < 1)
+        fun_l28_n942(x)
+    else
+        fun_l28_n665(x)
+    end
+end
+
+def fun_l27_n978(x)
+    if (x < 1)
+        fun_l28_n753(x)
+    else
+        fun_l28_n807(x)
+    end
+end
+
+def fun_l27_n979(x)
+    if (x < 1)
+        fun_l28_n206(x)
+    else
+        fun_l28_n548(x)
+    end
+end
+
+def fun_l27_n980(x)
+    if (x < 1)
+        fun_l28_n149(x)
+    else
+        fun_l28_n126(x)
+    end
+end
+
+def fun_l27_n981(x)
+    if (x < 1)
+        fun_l28_n829(x)
+    else
+        fun_l28_n384(x)
+    end
+end
+
+def fun_l27_n982(x)
+    if (x < 1)
+        fun_l28_n764(x)
+    else
+        fun_l28_n554(x)
+    end
+end
+
+def fun_l27_n983(x)
+    if (x < 1)
+        fun_l28_n868(x)
+    else
+        fun_l28_n933(x)
+    end
+end
+
+def fun_l27_n984(x)
+    if (x < 1)
+        fun_l28_n627(x)
+    else
+        fun_l28_n791(x)
+    end
+end
+
+def fun_l27_n985(x)
+    if (x < 1)
+        fun_l28_n796(x)
+    else
+        fun_l28_n352(x)
+    end
+end
+
+def fun_l27_n986(x)
+    if (x < 1)
+        fun_l28_n213(x)
+    else
+        fun_l28_n282(x)
+    end
+end
+
+def fun_l27_n987(x)
+    if (x < 1)
+        fun_l28_n403(x)
+    else
+        fun_l28_n504(x)
+    end
+end
+
+def fun_l27_n988(x)
+    if (x < 1)
+        fun_l28_n78(x)
+    else
+        fun_l28_n283(x)
+    end
+end
+
+def fun_l27_n989(x)
+    if (x < 1)
+        fun_l28_n364(x)
+    else
+        fun_l28_n802(x)
+    end
+end
+
+def fun_l27_n990(x)
+    if (x < 1)
+        fun_l28_n508(x)
+    else
+        fun_l28_n561(x)
+    end
+end
+
+def fun_l27_n991(x)
+    if (x < 1)
+        fun_l28_n922(x)
+    else
+        fun_l28_n901(x)
+    end
+end
+
+def fun_l27_n992(x)
+    if (x < 1)
+        fun_l28_n103(x)
+    else
+        fun_l28_n275(x)
+    end
+end
+
+def fun_l27_n993(x)
+    if (x < 1)
+        fun_l28_n566(x)
+    else
+        fun_l28_n88(x)
+    end
+end
+
+def fun_l27_n994(x)
+    if (x < 1)
+        fun_l28_n174(x)
+    else
+        fun_l28_n741(x)
+    end
+end
+
+def fun_l27_n995(x)
+    if (x < 1)
+        fun_l28_n40(x)
+    else
+        fun_l28_n426(x)
+    end
+end
+
+def fun_l27_n996(x)
+    if (x < 1)
+        fun_l28_n941(x)
+    else
+        fun_l28_n941(x)
+    end
+end
+
+def fun_l27_n997(x)
+    if (x < 1)
+        fun_l28_n651(x)
+    else
+        fun_l28_n301(x)
+    end
+end
+
+def fun_l27_n998(x)
+    if (x < 1)
+        fun_l28_n789(x)
+    else
+        fun_l28_n720(x)
+    end
+end
+
+def fun_l27_n999(x)
+    if (x < 1)
+        fun_l28_n536(x)
+    else
+        fun_l28_n903(x)
+    end
+end
+
+def fun_l28_n0(x)
+    if (x < 1)
+        fun_l29_n585(x)
+    else
+        fun_l29_n979(x)
+    end
+end
+
+def fun_l28_n1(x)
+    if (x < 1)
+        fun_l29_n182(x)
+    else
+        fun_l29_n513(x)
+    end
+end
+
+def fun_l28_n2(x)
+    if (x < 1)
+        fun_l29_n975(x)
+    else
+        fun_l29_n445(x)
+    end
+end
+
+def fun_l28_n3(x)
+    if (x < 1)
+        fun_l29_n7(x)
+    else
+        fun_l29_n958(x)
+    end
+end
+
+def fun_l28_n4(x)
+    if (x < 1)
+        fun_l29_n751(x)
+    else
+        fun_l29_n426(x)
+    end
+end
+
+def fun_l28_n5(x)
+    if (x < 1)
+        fun_l29_n29(x)
+    else
+        fun_l29_n840(x)
+    end
+end
+
+def fun_l28_n6(x)
+    if (x < 1)
+        fun_l29_n571(x)
+    else
+        fun_l29_n971(x)
+    end
+end
+
+def fun_l28_n7(x)
+    if (x < 1)
+        fun_l29_n384(x)
+    else
+        fun_l29_n495(x)
+    end
+end
+
+def fun_l28_n8(x)
+    if (x < 1)
+        fun_l29_n185(x)
+    else
+        fun_l29_n507(x)
+    end
+end
+
+def fun_l28_n9(x)
+    if (x < 1)
+        fun_l29_n496(x)
+    else
+        fun_l29_n241(x)
+    end
+end
+
+def fun_l28_n10(x)
+    if (x < 1)
+        fun_l29_n494(x)
+    else
+        fun_l29_n473(x)
+    end
+end
+
+def fun_l28_n11(x)
+    if (x < 1)
+        fun_l29_n851(x)
+    else
+        fun_l29_n809(x)
+    end
+end
+
+def fun_l28_n12(x)
+    if (x < 1)
+        fun_l29_n875(x)
+    else
+        fun_l29_n135(x)
+    end
+end
+
+def fun_l28_n13(x)
+    if (x < 1)
+        fun_l29_n957(x)
+    else
+        fun_l29_n337(x)
+    end
+end
+
+def fun_l28_n14(x)
+    if (x < 1)
+        fun_l29_n82(x)
+    else
+        fun_l29_n901(x)
+    end
+end
+
+def fun_l28_n15(x)
+    if (x < 1)
+        fun_l29_n608(x)
+    else
+        fun_l29_n334(x)
+    end
+end
+
+def fun_l28_n16(x)
+    if (x < 1)
+        fun_l29_n772(x)
+    else
+        fun_l29_n912(x)
+    end
+end
+
+def fun_l28_n17(x)
+    if (x < 1)
+        fun_l29_n971(x)
+    else
+        fun_l29_n127(x)
+    end
+end
+
+def fun_l28_n18(x)
+    if (x < 1)
+        fun_l29_n667(x)
+    else
+        fun_l29_n347(x)
+    end
+end
+
+def fun_l28_n19(x)
+    if (x < 1)
+        fun_l29_n453(x)
+    else
+        fun_l29_n39(x)
+    end
+end
+
+def fun_l28_n20(x)
+    if (x < 1)
+        fun_l29_n853(x)
+    else
+        fun_l29_n747(x)
+    end
+end
+
+def fun_l28_n21(x)
+    if (x < 1)
+        fun_l29_n433(x)
+    else
+        fun_l29_n298(x)
+    end
+end
+
+def fun_l28_n22(x)
+    if (x < 1)
+        fun_l29_n94(x)
+    else
+        fun_l29_n307(x)
+    end
+end
+
+def fun_l28_n23(x)
+    if (x < 1)
+        fun_l29_n424(x)
+    else
+        fun_l29_n599(x)
+    end
+end
+
+def fun_l28_n24(x)
+    if (x < 1)
+        fun_l29_n986(x)
+    else
+        fun_l29_n232(x)
+    end
+end
+
+def fun_l28_n25(x)
+    if (x < 1)
+        fun_l29_n658(x)
+    else
+        fun_l29_n744(x)
+    end
+end
+
+def fun_l28_n26(x)
+    if (x < 1)
+        fun_l29_n151(x)
+    else
+        fun_l29_n855(x)
+    end
+end
+
+def fun_l28_n27(x)
+    if (x < 1)
+        fun_l29_n416(x)
+    else
+        fun_l29_n763(x)
+    end
+end
+
+def fun_l28_n28(x)
+    if (x < 1)
+        fun_l29_n489(x)
+    else
+        fun_l29_n55(x)
+    end
+end
+
+def fun_l28_n29(x)
+    if (x < 1)
+        fun_l29_n714(x)
+    else
+        fun_l29_n489(x)
+    end
+end
+
+def fun_l28_n30(x)
+    if (x < 1)
+        fun_l29_n328(x)
+    else
+        fun_l29_n476(x)
+    end
+end
+
+def fun_l28_n31(x)
+    if (x < 1)
+        fun_l29_n317(x)
+    else
+        fun_l29_n836(x)
+    end
+end
+
+def fun_l28_n32(x)
+    if (x < 1)
+        fun_l29_n970(x)
+    else
+        fun_l29_n48(x)
+    end
+end
+
+def fun_l28_n33(x)
+    if (x < 1)
+        fun_l29_n159(x)
+    else
+        fun_l29_n449(x)
+    end
+end
+
+def fun_l28_n34(x)
+    if (x < 1)
+        fun_l29_n80(x)
+    else
+        fun_l29_n994(x)
+    end
+end
+
+def fun_l28_n35(x)
+    if (x < 1)
+        fun_l29_n413(x)
+    else
+        fun_l29_n718(x)
+    end
+end
+
+def fun_l28_n36(x)
+    if (x < 1)
+        fun_l29_n196(x)
+    else
+        fun_l29_n713(x)
+    end
+end
+
+def fun_l28_n37(x)
+    if (x < 1)
+        fun_l29_n815(x)
+    else
+        fun_l29_n595(x)
+    end
+end
+
+def fun_l28_n38(x)
+    if (x < 1)
+        fun_l29_n862(x)
+    else
+        fun_l29_n546(x)
+    end
+end
+
+def fun_l28_n39(x)
+    if (x < 1)
+        fun_l29_n875(x)
+    else
+        fun_l29_n456(x)
+    end
+end
+
+def fun_l28_n40(x)
+    if (x < 1)
+        fun_l29_n424(x)
+    else
+        fun_l29_n445(x)
+    end
+end
+
+def fun_l28_n41(x)
+    if (x < 1)
+        fun_l29_n743(x)
+    else
+        fun_l29_n498(x)
+    end
+end
+
+def fun_l28_n42(x)
+    if (x < 1)
+        fun_l29_n950(x)
+    else
+        fun_l29_n497(x)
+    end
+end
+
+def fun_l28_n43(x)
+    if (x < 1)
+        fun_l29_n792(x)
+    else
+        fun_l29_n487(x)
+    end
+end
+
+def fun_l28_n44(x)
+    if (x < 1)
+        fun_l29_n421(x)
+    else
+        fun_l29_n484(x)
+    end
+end
+
+def fun_l28_n45(x)
+    if (x < 1)
+        fun_l29_n862(x)
+    else
+        fun_l29_n824(x)
+    end
+end
+
+def fun_l28_n46(x)
+    if (x < 1)
+        fun_l29_n163(x)
+    else
+        fun_l29_n184(x)
+    end
+end
+
+def fun_l28_n47(x)
+    if (x < 1)
+        fun_l29_n374(x)
+    else
+        fun_l29_n954(x)
+    end
+end
+
+def fun_l28_n48(x)
+    if (x < 1)
+        fun_l29_n422(x)
+    else
+        fun_l29_n223(x)
+    end
+end
+
+def fun_l28_n49(x)
+    if (x < 1)
+        fun_l29_n885(x)
+    else
+        fun_l29_n527(x)
+    end
+end
+
+def fun_l28_n50(x)
+    if (x < 1)
+        fun_l29_n694(x)
+    else
+        fun_l29_n702(x)
+    end
+end
+
+def fun_l28_n51(x)
+    if (x < 1)
+        fun_l29_n273(x)
+    else
+        fun_l29_n504(x)
+    end
+end
+
+def fun_l28_n52(x)
+    if (x < 1)
+        fun_l29_n330(x)
+    else
+        fun_l29_n267(x)
+    end
+end
+
+def fun_l28_n53(x)
+    if (x < 1)
+        fun_l29_n103(x)
+    else
+        fun_l29_n407(x)
+    end
+end
+
+def fun_l28_n54(x)
+    if (x < 1)
+        fun_l29_n210(x)
+    else
+        fun_l29_n645(x)
+    end
+end
+
+def fun_l28_n55(x)
+    if (x < 1)
+        fun_l29_n871(x)
+    else
+        fun_l29_n641(x)
+    end
+end
+
+def fun_l28_n56(x)
+    if (x < 1)
+        fun_l29_n233(x)
+    else
+        fun_l29_n715(x)
+    end
+end
+
+def fun_l28_n57(x)
+    if (x < 1)
+        fun_l29_n742(x)
+    else
+        fun_l29_n104(x)
+    end
+end
+
+def fun_l28_n58(x)
+    if (x < 1)
+        fun_l29_n713(x)
+    else
+        fun_l29_n919(x)
+    end
+end
+
+def fun_l28_n59(x)
+    if (x < 1)
+        fun_l29_n192(x)
+    else
+        fun_l29_n988(x)
+    end
+end
+
+def fun_l28_n60(x)
+    if (x < 1)
+        fun_l29_n533(x)
+    else
+        fun_l29_n972(x)
+    end
+end
+
+def fun_l28_n61(x)
+    if (x < 1)
+        fun_l29_n286(x)
+    else
+        fun_l29_n129(x)
+    end
+end
+
+def fun_l28_n62(x)
+    if (x < 1)
+        fun_l29_n208(x)
+    else
+        fun_l29_n715(x)
+    end
+end
+
+def fun_l28_n63(x)
+    if (x < 1)
+        fun_l29_n588(x)
+    else
+        fun_l29_n975(x)
+    end
+end
+
+def fun_l28_n64(x)
+    if (x < 1)
+        fun_l29_n202(x)
+    else
+        fun_l29_n784(x)
+    end
+end
+
+def fun_l28_n65(x)
+    if (x < 1)
+        fun_l29_n531(x)
+    else
+        fun_l29_n758(x)
+    end
+end
+
+def fun_l28_n66(x)
+    if (x < 1)
+        fun_l29_n102(x)
+    else
+        fun_l29_n23(x)
+    end
+end
+
+def fun_l28_n67(x)
+    if (x < 1)
+        fun_l29_n546(x)
+    else
+        fun_l29_n964(x)
+    end
+end
+
+def fun_l28_n68(x)
+    if (x < 1)
+        fun_l29_n31(x)
+    else
+        fun_l29_n223(x)
+    end
+end
+
+def fun_l28_n69(x)
+    if (x < 1)
+        fun_l29_n344(x)
+    else
+        fun_l29_n250(x)
+    end
+end
+
+def fun_l28_n70(x)
+    if (x < 1)
+        fun_l29_n910(x)
+    else
+        fun_l29_n880(x)
+    end
+end
+
+def fun_l28_n71(x)
+    if (x < 1)
+        fun_l29_n181(x)
+    else
+        fun_l29_n950(x)
+    end
+end
+
+def fun_l28_n72(x)
+    if (x < 1)
+        fun_l29_n405(x)
+    else
+        fun_l29_n105(x)
+    end
+end
+
+def fun_l28_n73(x)
+    if (x < 1)
+        fun_l29_n419(x)
+    else
+        fun_l29_n120(x)
+    end
+end
+
+def fun_l28_n74(x)
+    if (x < 1)
+        fun_l29_n485(x)
+    else
+        fun_l29_n616(x)
+    end
+end
+
+def fun_l28_n75(x)
+    if (x < 1)
+        fun_l29_n690(x)
+    else
+        fun_l29_n581(x)
+    end
+end
+
+def fun_l28_n76(x)
+    if (x < 1)
+        fun_l29_n68(x)
+    else
+        fun_l29_n47(x)
+    end
+end
+
+def fun_l28_n77(x)
+    if (x < 1)
+        fun_l29_n324(x)
+    else
+        fun_l29_n102(x)
+    end
+end
+
+def fun_l28_n78(x)
+    if (x < 1)
+        fun_l29_n416(x)
+    else
+        fun_l29_n965(x)
+    end
+end
+
+def fun_l28_n79(x)
+    if (x < 1)
+        fun_l29_n584(x)
+    else
+        fun_l29_n901(x)
+    end
+end
+
+def fun_l28_n80(x)
+    if (x < 1)
+        fun_l29_n914(x)
+    else
+        fun_l29_n890(x)
+    end
+end
+
+def fun_l28_n81(x)
+    if (x < 1)
+        fun_l29_n85(x)
+    else
+        fun_l29_n822(x)
+    end
+end
+
+def fun_l28_n82(x)
+    if (x < 1)
+        fun_l29_n311(x)
+    else
+        fun_l29_n621(x)
+    end
+end
+
+def fun_l28_n83(x)
+    if (x < 1)
+        fun_l29_n361(x)
+    else
+        fun_l29_n336(x)
+    end
+end
+
+def fun_l28_n84(x)
+    if (x < 1)
+        fun_l29_n642(x)
+    else
+        fun_l29_n495(x)
+    end
+end
+
+def fun_l28_n85(x)
+    if (x < 1)
+        fun_l29_n688(x)
+    else
+        fun_l29_n20(x)
+    end
+end
+
+def fun_l28_n86(x)
+    if (x < 1)
+        fun_l29_n805(x)
+    else
+        fun_l29_n363(x)
+    end
+end
+
+def fun_l28_n87(x)
+    if (x < 1)
+        fun_l29_n215(x)
+    else
+        fun_l29_n530(x)
+    end
+end
+
+def fun_l28_n88(x)
+    if (x < 1)
+        fun_l29_n355(x)
+    else
+        fun_l29_n820(x)
+    end
+end
+
+def fun_l28_n89(x)
+    if (x < 1)
+        fun_l29_n593(x)
+    else
+        fun_l29_n443(x)
+    end
+end
+
+def fun_l28_n90(x)
+    if (x < 1)
+        fun_l29_n917(x)
+    else
+        fun_l29_n920(x)
+    end
+end
+
+def fun_l28_n91(x)
+    if (x < 1)
+        fun_l29_n571(x)
+    else
+        fun_l29_n545(x)
+    end
+end
+
+def fun_l28_n92(x)
+    if (x < 1)
+        fun_l29_n871(x)
+    else
+        fun_l29_n497(x)
+    end
+end
+
+def fun_l28_n93(x)
+    if (x < 1)
+        fun_l29_n433(x)
+    else
+        fun_l29_n899(x)
+    end
+end
+
+def fun_l28_n94(x)
+    if (x < 1)
+        fun_l29_n139(x)
+    else
+        fun_l29_n836(x)
+    end
+end
+
+def fun_l28_n95(x)
+    if (x < 1)
+        fun_l29_n265(x)
+    else
+        fun_l29_n297(x)
+    end
+end
+
+def fun_l28_n96(x)
+    if (x < 1)
+        fun_l29_n554(x)
+    else
+        fun_l29_n345(x)
+    end
+end
+
+def fun_l28_n97(x)
+    if (x < 1)
+        fun_l29_n674(x)
+    else
+        fun_l29_n632(x)
+    end
+end
+
+def fun_l28_n98(x)
+    if (x < 1)
+        fun_l29_n287(x)
+    else
+        fun_l29_n606(x)
+    end
+end
+
+def fun_l28_n99(x)
+    if (x < 1)
+        fun_l29_n288(x)
+    else
+        fun_l29_n751(x)
+    end
+end
+
+def fun_l28_n100(x)
+    if (x < 1)
+        fun_l29_n673(x)
+    else
+        fun_l29_n461(x)
+    end
+end
+
+def fun_l28_n101(x)
+    if (x < 1)
+        fun_l29_n633(x)
+    else
+        fun_l29_n688(x)
+    end
+end
+
+def fun_l28_n102(x)
+    if (x < 1)
+        fun_l29_n487(x)
+    else
+        fun_l29_n879(x)
+    end
+end
+
+def fun_l28_n103(x)
+    if (x < 1)
+        fun_l29_n12(x)
+    else
+        fun_l29_n808(x)
+    end
+end
+
+def fun_l28_n104(x)
+    if (x < 1)
+        fun_l29_n560(x)
+    else
+        fun_l29_n174(x)
+    end
+end
+
+def fun_l28_n105(x)
+    if (x < 1)
+        fun_l29_n379(x)
+    else
+        fun_l29_n509(x)
+    end
+end
+
+def fun_l28_n106(x)
+    if (x < 1)
+        fun_l29_n848(x)
+    else
+        fun_l29_n783(x)
+    end
+end
+
+def fun_l28_n107(x)
+    if (x < 1)
+        fun_l29_n564(x)
+    else
+        fun_l29_n584(x)
+    end
+end
+
+def fun_l28_n108(x)
+    if (x < 1)
+        fun_l29_n251(x)
+    else
+        fun_l29_n77(x)
+    end
+end
+
+def fun_l28_n109(x)
+    if (x < 1)
+        fun_l29_n588(x)
+    else
+        fun_l29_n351(x)
+    end
+end
+
+def fun_l28_n110(x)
+    if (x < 1)
+        fun_l29_n43(x)
+    else
+        fun_l29_n102(x)
+    end
+end
+
+def fun_l28_n111(x)
+    if (x < 1)
+        fun_l29_n33(x)
+    else
+        fun_l29_n168(x)
+    end
+end
+
+def fun_l28_n112(x)
+    if (x < 1)
+        fun_l29_n977(x)
+    else
+        fun_l29_n832(x)
+    end
+end
+
+def fun_l28_n113(x)
+    if (x < 1)
+        fun_l29_n189(x)
+    else
+        fun_l29_n657(x)
+    end
+end
+
+def fun_l28_n114(x)
+    if (x < 1)
+        fun_l29_n833(x)
+    else
+        fun_l29_n237(x)
+    end
+end
+
+def fun_l28_n115(x)
+    if (x < 1)
+        fun_l29_n621(x)
+    else
+        fun_l29_n675(x)
+    end
+end
+
+def fun_l28_n116(x)
+    if (x < 1)
+        fun_l29_n944(x)
+    else
+        fun_l29_n469(x)
+    end
+end
+
+def fun_l28_n117(x)
+    if (x < 1)
+        fun_l29_n2(x)
+    else
+        fun_l29_n959(x)
+    end
+end
+
+def fun_l28_n118(x)
+    if (x < 1)
+        fun_l29_n260(x)
+    else
+        fun_l29_n580(x)
+    end
+end
+
+def fun_l28_n119(x)
+    if (x < 1)
+        fun_l29_n464(x)
+    else
+        fun_l29_n411(x)
+    end
+end
+
+def fun_l28_n120(x)
+    if (x < 1)
+        fun_l29_n973(x)
+    else
+        fun_l29_n837(x)
+    end
+end
+
+def fun_l28_n121(x)
+    if (x < 1)
+        fun_l29_n511(x)
+    else
+        fun_l29_n896(x)
+    end
+end
+
+def fun_l28_n122(x)
+    if (x < 1)
+        fun_l29_n621(x)
+    else
+        fun_l29_n952(x)
+    end
+end
+
+def fun_l28_n123(x)
+    if (x < 1)
+        fun_l29_n250(x)
+    else
+        fun_l29_n551(x)
+    end
+end
+
+def fun_l28_n124(x)
+    if (x < 1)
+        fun_l29_n761(x)
+    else
+        fun_l29_n659(x)
+    end
+end
+
+def fun_l28_n125(x)
+    if (x < 1)
+        fun_l29_n43(x)
+    else
+        fun_l29_n265(x)
+    end
+end
+
+def fun_l28_n126(x)
+    if (x < 1)
+        fun_l29_n794(x)
+    else
+        fun_l29_n953(x)
+    end
+end
+
+def fun_l28_n127(x)
+    if (x < 1)
+        fun_l29_n858(x)
+    else
+        fun_l29_n582(x)
+    end
+end
+
+def fun_l28_n128(x)
+    if (x < 1)
+        fun_l29_n762(x)
+    else
+        fun_l29_n710(x)
+    end
+end
+
+def fun_l28_n129(x)
+    if (x < 1)
+        fun_l29_n541(x)
+    else
+        fun_l29_n182(x)
+    end
+end
+
+def fun_l28_n130(x)
+    if (x < 1)
+        fun_l29_n325(x)
+    else
+        fun_l29_n318(x)
+    end
+end
+
+def fun_l28_n131(x)
+    if (x < 1)
+        fun_l29_n751(x)
+    else
+        fun_l29_n499(x)
+    end
+end
+
+def fun_l28_n132(x)
+    if (x < 1)
+        fun_l29_n185(x)
+    else
+        fun_l29_n547(x)
+    end
+end
+
+def fun_l28_n133(x)
+    if (x < 1)
+        fun_l29_n155(x)
+    else
+        fun_l29_n691(x)
+    end
+end
+
+def fun_l28_n134(x)
+    if (x < 1)
+        fun_l29_n326(x)
+    else
+        fun_l29_n950(x)
+    end
+end
+
+def fun_l28_n135(x)
+    if (x < 1)
+        fun_l29_n782(x)
+    else
+        fun_l29_n968(x)
+    end
+end
+
+def fun_l28_n136(x)
+    if (x < 1)
+        fun_l29_n349(x)
+    else
+        fun_l29_n668(x)
+    end
+end
+
+def fun_l28_n137(x)
+    if (x < 1)
+        fun_l29_n897(x)
+    else
+        fun_l29_n243(x)
+    end
+end
+
+def fun_l28_n138(x)
+    if (x < 1)
+        fun_l29_n994(x)
+    else
+        fun_l29_n84(x)
+    end
+end
+
+def fun_l28_n139(x)
+    if (x < 1)
+        fun_l29_n95(x)
+    else
+        fun_l29_n705(x)
+    end
+end
+
+def fun_l28_n140(x)
+    if (x < 1)
+        fun_l29_n864(x)
+    else
+        fun_l29_n636(x)
+    end
+end
+
+def fun_l28_n141(x)
+    if (x < 1)
+        fun_l29_n587(x)
+    else
+        fun_l29_n908(x)
+    end
+end
+
+def fun_l28_n142(x)
+    if (x < 1)
+        fun_l29_n255(x)
+    else
+        fun_l29_n633(x)
+    end
+end
+
+def fun_l28_n143(x)
+    if (x < 1)
+        fun_l29_n142(x)
+    else
+        fun_l29_n305(x)
+    end
+end
+
+def fun_l28_n144(x)
+    if (x < 1)
+        fun_l29_n735(x)
+    else
+        fun_l29_n637(x)
+    end
+end
+
+def fun_l28_n145(x)
+    if (x < 1)
+        fun_l29_n637(x)
+    else
+        fun_l29_n975(x)
+    end
+end
+
+def fun_l28_n146(x)
+    if (x < 1)
+        fun_l29_n560(x)
+    else
+        fun_l29_n534(x)
+    end
+end
+
+def fun_l28_n147(x)
+    if (x < 1)
+        fun_l29_n829(x)
+    else
+        fun_l29_n344(x)
+    end
+end
+
+def fun_l28_n148(x)
+    if (x < 1)
+        fun_l29_n38(x)
+    else
+        fun_l29_n339(x)
+    end
+end
+
+def fun_l28_n149(x)
+    if (x < 1)
+        fun_l29_n178(x)
+    else
+        fun_l29_n178(x)
+    end
+end
+
+def fun_l28_n150(x)
+    if (x < 1)
+        fun_l29_n434(x)
+    else
+        fun_l29_n677(x)
+    end
+end
+
+def fun_l28_n151(x)
+    if (x < 1)
+        fun_l29_n910(x)
+    else
+        fun_l29_n230(x)
+    end
+end
+
+def fun_l28_n152(x)
+    if (x < 1)
+        fun_l29_n750(x)
+    else
+        fun_l29_n534(x)
+    end
+end
+
+def fun_l28_n153(x)
+    if (x < 1)
+        fun_l29_n550(x)
+    else
+        fun_l29_n757(x)
+    end
+end
+
+def fun_l28_n154(x)
+    if (x < 1)
+        fun_l29_n832(x)
+    else
+        fun_l29_n177(x)
+    end
+end
+
+def fun_l28_n155(x)
+    if (x < 1)
+        fun_l29_n724(x)
+    else
+        fun_l29_n669(x)
+    end
+end
+
+def fun_l28_n156(x)
+    if (x < 1)
+        fun_l29_n362(x)
+    else
+        fun_l29_n882(x)
+    end
+end
+
+def fun_l28_n157(x)
+    if (x < 1)
+        fun_l29_n164(x)
+    else
+        fun_l29_n919(x)
+    end
+end
+
+def fun_l28_n158(x)
+    if (x < 1)
+        fun_l29_n300(x)
+    else
+        fun_l29_n343(x)
+    end
+end
+
+def fun_l28_n159(x)
+    if (x < 1)
+        fun_l29_n395(x)
+    else
+        fun_l29_n535(x)
+    end
+end
+
+def fun_l28_n160(x)
+    if (x < 1)
+        fun_l29_n127(x)
+    else
+        fun_l29_n666(x)
+    end
+end
+
+def fun_l28_n161(x)
+    if (x < 1)
+        fun_l29_n207(x)
+    else
+        fun_l29_n935(x)
+    end
+end
+
+def fun_l28_n162(x)
+    if (x < 1)
+        fun_l29_n865(x)
+    else
+        fun_l29_n692(x)
+    end
+end
+
+def fun_l28_n163(x)
+    if (x < 1)
+        fun_l29_n429(x)
+    else
+        fun_l29_n329(x)
+    end
+end
+
+def fun_l28_n164(x)
+    if (x < 1)
+        fun_l29_n874(x)
+    else
+        fun_l29_n650(x)
+    end
+end
+
+def fun_l28_n165(x)
+    if (x < 1)
+        fun_l29_n985(x)
+    else
+        fun_l29_n488(x)
+    end
+end
+
+def fun_l28_n166(x)
+    if (x < 1)
+        fun_l29_n425(x)
+    else
+        fun_l29_n297(x)
+    end
+end
+
+def fun_l28_n167(x)
+    if (x < 1)
+        fun_l29_n468(x)
+    else
+        fun_l29_n331(x)
+    end
+end
+
+def fun_l28_n168(x)
+    if (x < 1)
+        fun_l29_n991(x)
+    else
+        fun_l29_n399(x)
+    end
+end
+
+def fun_l28_n169(x)
+    if (x < 1)
+        fun_l29_n402(x)
+    else
+        fun_l29_n931(x)
+    end
+end
+
+def fun_l28_n170(x)
+    if (x < 1)
+        fun_l29_n984(x)
+    else
+        fun_l29_n586(x)
+    end
+end
+
+def fun_l28_n171(x)
+    if (x < 1)
+        fun_l29_n305(x)
+    else
+        fun_l29_n638(x)
+    end
+end
+
+def fun_l28_n172(x)
+    if (x < 1)
+        fun_l29_n251(x)
+    else
+        fun_l29_n94(x)
+    end
+end
+
+def fun_l28_n173(x)
+    if (x < 1)
+        fun_l29_n225(x)
+    else
+        fun_l29_n466(x)
+    end
+end
+
+def fun_l28_n174(x)
+    if (x < 1)
+        fun_l29_n643(x)
+    else
+        fun_l29_n974(x)
+    end
+end
+
+def fun_l28_n175(x)
+    if (x < 1)
+        fun_l29_n634(x)
+    else
+        fun_l29_n321(x)
+    end
+end
+
+def fun_l28_n176(x)
+    if (x < 1)
+        fun_l29_n269(x)
+    else
+        fun_l29_n237(x)
+    end
+end
+
+def fun_l28_n177(x)
+    if (x < 1)
+        fun_l29_n649(x)
+    else
+        fun_l29_n661(x)
+    end
+end
+
+def fun_l28_n178(x)
+    if (x < 1)
+        fun_l29_n919(x)
+    else
+        fun_l29_n997(x)
+    end
+end
+
+def fun_l28_n179(x)
+    if (x < 1)
+        fun_l29_n634(x)
+    else
+        fun_l29_n967(x)
+    end
+end
+
+def fun_l28_n180(x)
+    if (x < 1)
+        fun_l29_n798(x)
+    else
+        fun_l29_n733(x)
+    end
+end
+
+def fun_l28_n181(x)
+    if (x < 1)
+        fun_l29_n975(x)
+    else
+        fun_l29_n28(x)
+    end
+end
+
+def fun_l28_n182(x)
+    if (x < 1)
+        fun_l29_n973(x)
+    else
+        fun_l29_n616(x)
+    end
+end
+
+def fun_l28_n183(x)
+    if (x < 1)
+        fun_l29_n360(x)
+    else
+        fun_l29_n18(x)
+    end
+end
+
+def fun_l28_n184(x)
+    if (x < 1)
+        fun_l29_n281(x)
+    else
+        fun_l29_n271(x)
+    end
+end
+
+def fun_l28_n185(x)
+    if (x < 1)
+        fun_l29_n216(x)
+    else
+        fun_l29_n193(x)
+    end
+end
+
+def fun_l28_n186(x)
+    if (x < 1)
+        fun_l29_n262(x)
+    else
+        fun_l29_n509(x)
+    end
+end
+
+def fun_l28_n187(x)
+    if (x < 1)
+        fun_l29_n160(x)
+    else
+        fun_l29_n770(x)
+    end
+end
+
+def fun_l28_n188(x)
+    if (x < 1)
+        fun_l29_n411(x)
+    else
+        fun_l29_n605(x)
+    end
+end
+
+def fun_l28_n189(x)
+    if (x < 1)
+        fun_l29_n397(x)
+    else
+        fun_l29_n205(x)
+    end
+end
+
+def fun_l28_n190(x)
+    if (x < 1)
+        fun_l29_n529(x)
+    else
+        fun_l29_n545(x)
+    end
+end
+
+def fun_l28_n191(x)
+    if (x < 1)
+        fun_l29_n528(x)
+    else
+        fun_l29_n472(x)
+    end
+end
+
+def fun_l28_n192(x)
+    if (x < 1)
+        fun_l29_n843(x)
+    else
+        fun_l29_n88(x)
+    end
+end
+
+def fun_l28_n193(x)
+    if (x < 1)
+        fun_l29_n827(x)
+    else
+        fun_l29_n6(x)
+    end
+end
+
+def fun_l28_n194(x)
+    if (x < 1)
+        fun_l29_n567(x)
+    else
+        fun_l29_n622(x)
+    end
+end
+
+def fun_l28_n195(x)
+    if (x < 1)
+        fun_l29_n799(x)
+    else
+        fun_l29_n605(x)
+    end
+end
+
+def fun_l28_n196(x)
+    if (x < 1)
+        fun_l29_n930(x)
+    else
+        fun_l29_n643(x)
+    end
+end
+
+def fun_l28_n197(x)
+    if (x < 1)
+        fun_l29_n445(x)
+    else
+        fun_l29_n226(x)
+    end
+end
+
+def fun_l28_n198(x)
+    if (x < 1)
+        fun_l29_n453(x)
+    else
+        fun_l29_n941(x)
+    end
+end
+
+def fun_l28_n199(x)
+    if (x < 1)
+        fun_l29_n40(x)
+    else
+        fun_l29_n602(x)
+    end
+end
+
+def fun_l28_n200(x)
+    if (x < 1)
+        fun_l29_n804(x)
+    else
+        fun_l29_n355(x)
+    end
+end
+
+def fun_l28_n201(x)
+    if (x < 1)
+        fun_l29_n894(x)
+    else
+        fun_l29_n749(x)
+    end
+end
+
+def fun_l28_n202(x)
+    if (x < 1)
+        fun_l29_n105(x)
+    else
+        fun_l29_n182(x)
+    end
+end
+
+def fun_l28_n203(x)
+    if (x < 1)
+        fun_l29_n106(x)
+    else
+        fun_l29_n670(x)
+    end
+end
+
+def fun_l28_n204(x)
+    if (x < 1)
+        fun_l29_n897(x)
+    else
+        fun_l29_n337(x)
+    end
+end
+
+def fun_l28_n205(x)
+    if (x < 1)
+        fun_l29_n149(x)
+    else
+        fun_l29_n822(x)
+    end
+end
+
+def fun_l28_n206(x)
+    if (x < 1)
+        fun_l29_n2(x)
+    else
+        fun_l29_n370(x)
+    end
+end
+
+def fun_l28_n207(x)
+    if (x < 1)
+        fun_l29_n430(x)
+    else
+        fun_l29_n262(x)
+    end
+end
+
+def fun_l28_n208(x)
+    if (x < 1)
+        fun_l29_n275(x)
+    else
+        fun_l29_n156(x)
+    end
+end
+
+def fun_l28_n209(x)
+    if (x < 1)
+        fun_l29_n677(x)
+    else
+        fun_l29_n620(x)
+    end
+end
+
+def fun_l28_n210(x)
+    if (x < 1)
+        fun_l29_n732(x)
+    else
+        fun_l29_n533(x)
+    end
+end
+
+def fun_l28_n211(x)
+    if (x < 1)
+        fun_l29_n934(x)
+    else
+        fun_l29_n334(x)
+    end
+end
+
+def fun_l28_n212(x)
+    if (x < 1)
+        fun_l29_n656(x)
+    else
+        fun_l29_n889(x)
+    end
+end
+
+def fun_l28_n213(x)
+    if (x < 1)
+        fun_l29_n210(x)
+    else
+        fun_l29_n225(x)
+    end
+end
+
+def fun_l28_n214(x)
+    if (x < 1)
+        fun_l29_n496(x)
+    else
+        fun_l29_n901(x)
+    end
+end
+
+def fun_l28_n215(x)
+    if (x < 1)
+        fun_l29_n190(x)
+    else
+        fun_l29_n254(x)
+    end
+end
+
+def fun_l28_n216(x)
+    if (x < 1)
+        fun_l29_n708(x)
+    else
+        fun_l29_n680(x)
+    end
+end
+
+def fun_l28_n217(x)
+    if (x < 1)
+        fun_l29_n616(x)
+    else
+        fun_l29_n942(x)
+    end
+end
+
+def fun_l28_n218(x)
+    if (x < 1)
+        fun_l29_n515(x)
+    else
+        fun_l29_n269(x)
+    end
+end
+
+def fun_l28_n219(x)
+    if (x < 1)
+        fun_l29_n422(x)
+    else
+        fun_l29_n644(x)
+    end
+end
+
+def fun_l28_n220(x)
+    if (x < 1)
+        fun_l29_n114(x)
+    else
+        fun_l29_n566(x)
+    end
+end
+
+def fun_l28_n221(x)
+    if (x < 1)
+        fun_l29_n750(x)
+    else
+        fun_l29_n799(x)
+    end
+end
+
+def fun_l28_n222(x)
+    if (x < 1)
+        fun_l29_n121(x)
+    else
+        fun_l29_n556(x)
+    end
+end
+
+def fun_l28_n223(x)
+    if (x < 1)
+        fun_l29_n161(x)
+    else
+        fun_l29_n422(x)
+    end
+end
+
+def fun_l28_n224(x)
+    if (x < 1)
+        fun_l29_n779(x)
+    else
+        fun_l29_n214(x)
+    end
+end
+
+def fun_l28_n225(x)
+    if (x < 1)
+        fun_l29_n355(x)
+    else
+        fun_l29_n10(x)
+    end
+end
+
+def fun_l28_n226(x)
+    if (x < 1)
+        fun_l29_n923(x)
+    else
+        fun_l29_n672(x)
+    end
+end
+
+def fun_l28_n227(x)
+    if (x < 1)
+        fun_l29_n578(x)
+    else
+        fun_l29_n809(x)
+    end
+end
+
+def fun_l28_n228(x)
+    if (x < 1)
+        fun_l29_n277(x)
+    else
+        fun_l29_n979(x)
+    end
+end
+
+def fun_l28_n229(x)
+    if (x < 1)
+        fun_l29_n248(x)
+    else
+        fun_l29_n731(x)
+    end
+end
+
+def fun_l28_n230(x)
+    if (x < 1)
+        fun_l29_n374(x)
+    else
+        fun_l29_n675(x)
+    end
+end
+
+def fun_l28_n231(x)
+    if (x < 1)
+        fun_l29_n339(x)
+    else
+        fun_l29_n62(x)
+    end
+end
+
+def fun_l28_n232(x)
+    if (x < 1)
+        fun_l29_n350(x)
+    else
+        fun_l29_n51(x)
+    end
+end
+
+def fun_l28_n233(x)
+    if (x < 1)
+        fun_l29_n606(x)
+    else
+        fun_l29_n460(x)
+    end
+end
+
+def fun_l28_n234(x)
+    if (x < 1)
+        fun_l29_n266(x)
+    else
+        fun_l29_n843(x)
+    end
+end
+
+def fun_l28_n235(x)
+    if (x < 1)
+        fun_l29_n762(x)
+    else
+        fun_l29_n1(x)
+    end
+end
+
+def fun_l28_n236(x)
+    if (x < 1)
+        fun_l29_n405(x)
+    else
+        fun_l29_n867(x)
+    end
+end
+
+def fun_l28_n237(x)
+    if (x < 1)
+        fun_l29_n62(x)
+    else
+        fun_l29_n288(x)
+    end
+end
+
+def fun_l28_n238(x)
+    if (x < 1)
+        fun_l29_n120(x)
+    else
+        fun_l29_n346(x)
+    end
+end
+
+def fun_l28_n239(x)
+    if (x < 1)
+        fun_l29_n789(x)
+    else
+        fun_l29_n633(x)
+    end
+end
+
+def fun_l28_n240(x)
+    if (x < 1)
+        fun_l29_n467(x)
+    else
+        fun_l29_n150(x)
+    end
+end
+
+def fun_l28_n241(x)
+    if (x < 1)
+        fun_l29_n487(x)
+    else
+        fun_l29_n671(x)
+    end
+end
+
+def fun_l28_n242(x)
+    if (x < 1)
+        fun_l29_n147(x)
+    else
+        fun_l29_n636(x)
+    end
+end
+
+def fun_l28_n243(x)
+    if (x < 1)
+        fun_l29_n710(x)
+    else
+        fun_l29_n196(x)
+    end
+end
+
+def fun_l28_n244(x)
+    if (x < 1)
+        fun_l29_n943(x)
+    else
+        fun_l29_n768(x)
+    end
+end
+
+def fun_l28_n245(x)
+    if (x < 1)
+        fun_l29_n670(x)
+    else
+        fun_l29_n522(x)
+    end
+end
+
+def fun_l28_n246(x)
+    if (x < 1)
+        fun_l29_n12(x)
+    else
+        fun_l29_n459(x)
+    end
+end
+
+def fun_l28_n247(x)
+    if (x < 1)
+        fun_l29_n901(x)
+    else
+        fun_l29_n726(x)
+    end
+end
+
+def fun_l28_n248(x)
+    if (x < 1)
+        fun_l29_n824(x)
+    else
+        fun_l29_n327(x)
+    end
+end
+
+def fun_l28_n249(x)
+    if (x < 1)
+        fun_l29_n327(x)
+    else
+        fun_l29_n343(x)
+    end
+end
+
+def fun_l28_n250(x)
+    if (x < 1)
+        fun_l29_n242(x)
+    else
+        fun_l29_n764(x)
+    end
+end
+
+def fun_l28_n251(x)
+    if (x < 1)
+        fun_l29_n780(x)
+    else
+        fun_l29_n117(x)
+    end
+end
+
+def fun_l28_n252(x)
+    if (x < 1)
+        fun_l29_n309(x)
+    else
+        fun_l29_n821(x)
+    end
+end
+
+def fun_l28_n253(x)
+    if (x < 1)
+        fun_l29_n250(x)
+    else
+        fun_l29_n933(x)
+    end
+end
+
+def fun_l28_n254(x)
+    if (x < 1)
+        fun_l29_n470(x)
+    else
+        fun_l29_n808(x)
+    end
+end
+
+def fun_l28_n255(x)
+    if (x < 1)
+        fun_l29_n425(x)
+    else
+        fun_l29_n800(x)
+    end
+end
+
+def fun_l28_n256(x)
+    if (x < 1)
+        fun_l29_n913(x)
+    else
+        fun_l29_n199(x)
+    end
+end
+
+def fun_l28_n257(x)
+    if (x < 1)
+        fun_l29_n25(x)
+    else
+        fun_l29_n412(x)
+    end
+end
+
+def fun_l28_n258(x)
+    if (x < 1)
+        fun_l29_n194(x)
+    else
+        fun_l29_n606(x)
+    end
+end
+
+def fun_l28_n259(x)
+    if (x < 1)
+        fun_l29_n653(x)
+    else
+        fun_l29_n72(x)
+    end
+end
+
+def fun_l28_n260(x)
+    if (x < 1)
+        fun_l29_n198(x)
+    else
+        fun_l29_n742(x)
+    end
+end
+
+def fun_l28_n261(x)
+    if (x < 1)
+        fun_l29_n452(x)
+    else
+        fun_l29_n522(x)
+    end
+end
+
+def fun_l28_n262(x)
+    if (x < 1)
+        fun_l29_n214(x)
+    else
+        fun_l29_n131(x)
+    end
+end
+
+def fun_l28_n263(x)
+    if (x < 1)
+        fun_l29_n481(x)
+    else
+        fun_l29_n848(x)
+    end
+end
+
+def fun_l28_n264(x)
+    if (x < 1)
+        fun_l29_n147(x)
+    else
+        fun_l29_n187(x)
+    end
+end
+
+def fun_l28_n265(x)
+    if (x < 1)
+        fun_l29_n476(x)
+    else
+        fun_l29_n859(x)
+    end
+end
+
+def fun_l28_n266(x)
+    if (x < 1)
+        fun_l29_n130(x)
+    else
+        fun_l29_n356(x)
+    end
+end
+
+def fun_l28_n267(x)
+    if (x < 1)
+        fun_l29_n427(x)
+    else
+        fun_l29_n578(x)
+    end
+end
+
+def fun_l28_n268(x)
+    if (x < 1)
+        fun_l29_n810(x)
+    else
+        fun_l29_n483(x)
+    end
+end
+
+def fun_l28_n269(x)
+    if (x < 1)
+        fun_l29_n496(x)
+    else
+        fun_l29_n548(x)
+    end
+end
+
+def fun_l28_n270(x)
+    if (x < 1)
+        fun_l29_n159(x)
+    else
+        fun_l29_n184(x)
+    end
+end
+
+def fun_l28_n271(x)
+    if (x < 1)
+        fun_l29_n407(x)
+    else
+        fun_l29_n855(x)
+    end
+end
+
+def fun_l28_n272(x)
+    if (x < 1)
+        fun_l29_n41(x)
+    else
+        fun_l29_n493(x)
+    end
+end
+
+def fun_l28_n273(x)
+    if (x < 1)
+        fun_l29_n853(x)
+    else
+        fun_l29_n711(x)
+    end
+end
+
+def fun_l28_n274(x)
+    if (x < 1)
+        fun_l29_n397(x)
+    else
+        fun_l29_n68(x)
+    end
+end
+
+def fun_l28_n275(x)
+    if (x < 1)
+        fun_l29_n744(x)
+    else
+        fun_l29_n944(x)
+    end
+end
+
+def fun_l28_n276(x)
+    if (x < 1)
+        fun_l29_n641(x)
+    else
+        fun_l29_n766(x)
+    end
+end
+
+def fun_l28_n277(x)
+    if (x < 1)
+        fun_l29_n983(x)
+    else
+        fun_l29_n587(x)
+    end
+end
+
+def fun_l28_n278(x)
+    if (x < 1)
+        fun_l29_n683(x)
+    else
+        fun_l29_n192(x)
+    end
+end
+
+def fun_l28_n279(x)
+    if (x < 1)
+        fun_l29_n252(x)
+    else
+        fun_l29_n30(x)
+    end
+end
+
+def fun_l28_n280(x)
+    if (x < 1)
+        fun_l29_n129(x)
+    else
+        fun_l29_n561(x)
+    end
+end
+
+def fun_l28_n281(x)
+    if (x < 1)
+        fun_l29_n828(x)
+    else
+        fun_l29_n697(x)
+    end
+end
+
+def fun_l28_n282(x)
+    if (x < 1)
+        fun_l29_n492(x)
+    else
+        fun_l29_n243(x)
+    end
+end
+
+def fun_l28_n283(x)
+    if (x < 1)
+        fun_l29_n642(x)
+    else
+        fun_l29_n736(x)
+    end
+end
+
+def fun_l28_n284(x)
+    if (x < 1)
+        fun_l29_n448(x)
+    else
+        fun_l29_n838(x)
+    end
+end
+
+def fun_l28_n285(x)
+    if (x < 1)
+        fun_l29_n133(x)
+    else
+        fun_l29_n372(x)
+    end
+end
+
+def fun_l28_n286(x)
+    if (x < 1)
+        fun_l29_n318(x)
+    else
+        fun_l29_n739(x)
+    end
+end
+
+def fun_l28_n287(x)
+    if (x < 1)
+        fun_l29_n449(x)
+    else
+        fun_l29_n743(x)
+    end
+end
+
+def fun_l28_n288(x)
+    if (x < 1)
+        fun_l29_n769(x)
+    else
+        fun_l29_n496(x)
+    end
+end
+
+def fun_l28_n289(x)
+    if (x < 1)
+        fun_l29_n455(x)
+    else
+        fun_l29_n893(x)
+    end
+end
+
+def fun_l28_n290(x)
+    if (x < 1)
+        fun_l29_n651(x)
+    else
+        fun_l29_n865(x)
+    end
+end
+
+def fun_l28_n291(x)
+    if (x < 1)
+        fun_l29_n194(x)
+    else
+        fun_l29_n491(x)
+    end
+end
+
+def fun_l28_n292(x)
+    if (x < 1)
+        fun_l29_n178(x)
+    else
+        fun_l29_n96(x)
+    end
+end
+
+def fun_l28_n293(x)
+    if (x < 1)
+        fun_l29_n32(x)
+    else
+        fun_l29_n262(x)
+    end
+end
+
+def fun_l28_n294(x)
+    if (x < 1)
+        fun_l29_n706(x)
+    else
+        fun_l29_n864(x)
+    end
+end
+
+def fun_l28_n295(x)
+    if (x < 1)
+        fun_l29_n209(x)
+    else
+        fun_l29_n220(x)
+    end
+end
+
+def fun_l28_n296(x)
+    if (x < 1)
+        fun_l29_n970(x)
+    else
+        fun_l29_n194(x)
+    end
+end
+
+def fun_l28_n297(x)
+    if (x < 1)
+        fun_l29_n959(x)
+    else
+        fun_l29_n472(x)
+    end
+end
+
+def fun_l28_n298(x)
+    if (x < 1)
+        fun_l29_n778(x)
+    else
+        fun_l29_n66(x)
+    end
+end
+
+def fun_l28_n299(x)
+    if (x < 1)
+        fun_l29_n942(x)
+    else
+        fun_l29_n461(x)
+    end
+end
+
+def fun_l28_n300(x)
+    if (x < 1)
+        fun_l29_n563(x)
+    else
+        fun_l29_n426(x)
+    end
+end
+
+def fun_l28_n301(x)
+    if (x < 1)
+        fun_l29_n603(x)
+    else
+        fun_l29_n968(x)
+    end
+end
+
+def fun_l28_n302(x)
+    if (x < 1)
+        fun_l29_n908(x)
+    else
+        fun_l29_n767(x)
+    end
+end
+
+def fun_l28_n303(x)
+    if (x < 1)
+        fun_l29_n387(x)
+    else
+        fun_l29_n484(x)
+    end
+end
+
+def fun_l28_n304(x)
+    if (x < 1)
+        fun_l29_n744(x)
+    else
+        fun_l29_n463(x)
+    end
+end
+
+def fun_l28_n305(x)
+    if (x < 1)
+        fun_l29_n964(x)
+    else
+        fun_l29_n43(x)
+    end
+end
+
+def fun_l28_n306(x)
+    if (x < 1)
+        fun_l29_n65(x)
+    else
+        fun_l29_n910(x)
+    end
+end
+
+def fun_l28_n307(x)
+    if (x < 1)
+        fun_l29_n318(x)
+    else
+        fun_l29_n375(x)
+    end
+end
+
+def fun_l28_n308(x)
+    if (x < 1)
+        fun_l29_n775(x)
+    else
+        fun_l29_n588(x)
+    end
+end
+
+def fun_l28_n309(x)
+    if (x < 1)
+        fun_l29_n977(x)
+    else
+        fun_l29_n299(x)
+    end
+end
+
+def fun_l28_n310(x)
+    if (x < 1)
+        fun_l29_n497(x)
+    else
+        fun_l29_n792(x)
+    end
+end
+
+def fun_l28_n311(x)
+    if (x < 1)
+        fun_l29_n909(x)
+    else
+        fun_l29_n740(x)
+    end
+end
+
+def fun_l28_n312(x)
+    if (x < 1)
+        fun_l29_n967(x)
+    else
+        fun_l29_n4(x)
+    end
+end
+
+def fun_l28_n313(x)
+    if (x < 1)
+        fun_l29_n455(x)
+    else
+        fun_l29_n11(x)
+    end
+end
+
+def fun_l28_n314(x)
+    if (x < 1)
+        fun_l29_n996(x)
+    else
+        fun_l29_n851(x)
+    end
+end
+
+def fun_l28_n315(x)
+    if (x < 1)
+        fun_l29_n110(x)
+    else
+        fun_l29_n517(x)
+    end
+end
+
+def fun_l28_n316(x)
+    if (x < 1)
+        fun_l29_n648(x)
+    else
+        fun_l29_n279(x)
+    end
+end
+
+def fun_l28_n317(x)
+    if (x < 1)
+        fun_l29_n820(x)
+    else
+        fun_l29_n157(x)
+    end
+end
+
+def fun_l28_n318(x)
+    if (x < 1)
+        fun_l29_n957(x)
+    else
+        fun_l29_n93(x)
+    end
+end
+
+def fun_l28_n319(x)
+    if (x < 1)
+        fun_l29_n681(x)
+    else
+        fun_l29_n508(x)
+    end
+end
+
+def fun_l28_n320(x)
+    if (x < 1)
+        fun_l29_n613(x)
+    else
+        fun_l29_n274(x)
+    end
+end
+
+def fun_l28_n321(x)
+    if (x < 1)
+        fun_l29_n239(x)
+    else
+        fun_l29_n862(x)
+    end
+end
+
+def fun_l28_n322(x)
+    if (x < 1)
+        fun_l29_n101(x)
+    else
+        fun_l29_n81(x)
+    end
+end
+
+def fun_l28_n323(x)
+    if (x < 1)
+        fun_l29_n96(x)
+    else
+        fun_l29_n908(x)
+    end
+end
+
+def fun_l28_n324(x)
+    if (x < 1)
+        fun_l29_n443(x)
+    else
+        fun_l29_n78(x)
+    end
+end
+
+def fun_l28_n325(x)
+    if (x < 1)
+        fun_l29_n857(x)
+    else
+        fun_l29_n210(x)
+    end
+end
+
+def fun_l28_n326(x)
+    if (x < 1)
+        fun_l29_n51(x)
+    else
+        fun_l29_n524(x)
+    end
+end
+
+def fun_l28_n327(x)
+    if (x < 1)
+        fun_l29_n381(x)
+    else
+        fun_l29_n309(x)
+    end
+end
+
+def fun_l28_n328(x)
+    if (x < 1)
+        fun_l29_n787(x)
+    else
+        fun_l29_n176(x)
+    end
+end
+
+def fun_l28_n329(x)
+    if (x < 1)
+        fun_l29_n568(x)
+    else
+        fun_l29_n652(x)
+    end
+end
+
+def fun_l28_n330(x)
+    if (x < 1)
+        fun_l29_n1(x)
+    else
+        fun_l29_n634(x)
+    end
+end
+
+def fun_l28_n331(x)
+    if (x < 1)
+        fun_l29_n491(x)
+    else
+        fun_l29_n365(x)
+    end
+end
+
+def fun_l28_n332(x)
+    if (x < 1)
+        fun_l29_n604(x)
+    else
+        fun_l29_n586(x)
+    end
+end
+
+def fun_l28_n333(x)
+    if (x < 1)
+        fun_l29_n811(x)
+    else
+        fun_l29_n981(x)
+    end
+end
+
+def fun_l28_n334(x)
+    if (x < 1)
+        fun_l29_n485(x)
+    else
+        fun_l29_n843(x)
+    end
+end
+
+def fun_l28_n335(x)
+    if (x < 1)
+        fun_l29_n188(x)
+    else
+        fun_l29_n805(x)
+    end
+end
+
+def fun_l28_n336(x)
+    if (x < 1)
+        fun_l29_n818(x)
+    else
+        fun_l29_n650(x)
+    end
+end
+
+def fun_l28_n337(x)
+    if (x < 1)
+        fun_l29_n829(x)
+    else
+        fun_l29_n13(x)
+    end
+end
+
+def fun_l28_n338(x)
+    if (x < 1)
+        fun_l29_n665(x)
+    else
+        fun_l29_n7(x)
+    end
+end
+
+def fun_l28_n339(x)
+    if (x < 1)
+        fun_l29_n347(x)
+    else
+        fun_l29_n914(x)
+    end
+end
+
+def fun_l28_n340(x)
+    if (x < 1)
+        fun_l29_n819(x)
+    else
+        fun_l29_n7(x)
+    end
+end
+
+def fun_l28_n341(x)
+    if (x < 1)
+        fun_l29_n108(x)
+    else
+        fun_l29_n838(x)
+    end
+end
+
+def fun_l28_n342(x)
+    if (x < 1)
+        fun_l29_n292(x)
+    else
+        fun_l29_n831(x)
+    end
+end
+
+def fun_l28_n343(x)
+    if (x < 1)
+        fun_l29_n892(x)
+    else
+        fun_l29_n717(x)
+    end
+end
+
+def fun_l28_n344(x)
+    if (x < 1)
+        fun_l29_n664(x)
+    else
+        fun_l29_n422(x)
+    end
+end
+
+def fun_l28_n345(x)
+    if (x < 1)
+        fun_l29_n59(x)
+    else
+        fun_l29_n858(x)
+    end
+end
+
+def fun_l28_n346(x)
+    if (x < 1)
+        fun_l29_n88(x)
+    else
+        fun_l29_n97(x)
+    end
+end
+
+def fun_l28_n347(x)
+    if (x < 1)
+        fun_l29_n852(x)
+    else
+        fun_l29_n37(x)
+    end
+end
+
+def fun_l28_n348(x)
+    if (x < 1)
+        fun_l29_n201(x)
+    else
+        fun_l29_n663(x)
+    end
+end
+
+def fun_l28_n349(x)
+    if (x < 1)
+        fun_l29_n928(x)
+    else
+        fun_l29_n743(x)
+    end
+end
+
+def fun_l28_n350(x)
+    if (x < 1)
+        fun_l29_n206(x)
+    else
+        fun_l29_n609(x)
+    end
+end
+
+def fun_l28_n351(x)
+    if (x < 1)
+        fun_l29_n98(x)
+    else
+        fun_l29_n659(x)
+    end
+end
+
+def fun_l28_n352(x)
+    if (x < 1)
+        fun_l29_n350(x)
+    else
+        fun_l29_n604(x)
+    end
+end
+
+def fun_l28_n353(x)
+    if (x < 1)
+        fun_l29_n273(x)
+    else
+        fun_l29_n831(x)
+    end
+end
+
+def fun_l28_n354(x)
+    if (x < 1)
+        fun_l29_n377(x)
+    else
+        fun_l29_n926(x)
+    end
+end
+
+def fun_l28_n355(x)
+    if (x < 1)
+        fun_l29_n783(x)
+    else
+        fun_l29_n646(x)
+    end
+end
+
+def fun_l28_n356(x)
+    if (x < 1)
+        fun_l29_n968(x)
+    else
+        fun_l29_n587(x)
+    end
+end
+
+def fun_l28_n357(x)
+    if (x < 1)
+        fun_l29_n813(x)
+    else
+        fun_l29_n791(x)
+    end
+end
+
+def fun_l28_n358(x)
+    if (x < 1)
+        fun_l29_n130(x)
+    else
+        fun_l29_n851(x)
+    end
+end
+
+def fun_l28_n359(x)
+    if (x < 1)
+        fun_l29_n858(x)
+    else
+        fun_l29_n112(x)
+    end
+end
+
+def fun_l28_n360(x)
+    if (x < 1)
+        fun_l29_n349(x)
+    else
+        fun_l29_n612(x)
+    end
+end
+
+def fun_l28_n361(x)
+    if (x < 1)
+        fun_l29_n282(x)
+    else
+        fun_l29_n357(x)
+    end
+end
+
+def fun_l28_n362(x)
+    if (x < 1)
+        fun_l29_n144(x)
+    else
+        fun_l29_n426(x)
+    end
+end
+
+def fun_l28_n363(x)
+    if (x < 1)
+        fun_l29_n438(x)
+    else
+        fun_l29_n539(x)
+    end
+end
+
+def fun_l28_n364(x)
+    if (x < 1)
+        fun_l29_n321(x)
+    else
+        fun_l29_n874(x)
+    end
+end
+
+def fun_l28_n365(x)
+    if (x < 1)
+        fun_l29_n443(x)
+    else
+        fun_l29_n985(x)
+    end
+end
+
+def fun_l28_n366(x)
+    if (x < 1)
+        fun_l29_n436(x)
+    else
+        fun_l29_n787(x)
+    end
+end
+
+def fun_l28_n367(x)
+    if (x < 1)
+        fun_l29_n354(x)
+    else
+        fun_l29_n75(x)
+    end
+end
+
+def fun_l28_n368(x)
+    if (x < 1)
+        fun_l29_n515(x)
+    else
+        fun_l29_n57(x)
+    end
+end
+
+def fun_l28_n369(x)
+    if (x < 1)
+        fun_l29_n222(x)
+    else
+        fun_l29_n954(x)
+    end
+end
+
+def fun_l28_n370(x)
+    if (x < 1)
+        fun_l29_n37(x)
+    else
+        fun_l29_n683(x)
+    end
+end
+
+def fun_l28_n371(x)
+    if (x < 1)
+        fun_l29_n104(x)
+    else
+        fun_l29_n721(x)
+    end
+end
+
+def fun_l28_n372(x)
+    if (x < 1)
+        fun_l29_n763(x)
+    else
+        fun_l29_n173(x)
+    end
+end
+
+def fun_l28_n373(x)
+    if (x < 1)
+        fun_l29_n693(x)
+    else
+        fun_l29_n132(x)
+    end
+end
+
+def fun_l28_n374(x)
+    if (x < 1)
+        fun_l29_n586(x)
+    else
+        fun_l29_n992(x)
+    end
+end
+
+def fun_l28_n375(x)
+    if (x < 1)
+        fun_l29_n815(x)
+    else
+        fun_l29_n721(x)
+    end
+end
+
+def fun_l28_n376(x)
+    if (x < 1)
+        fun_l29_n653(x)
+    else
+        fun_l29_n67(x)
+    end
+end
+
+def fun_l28_n377(x)
+    if (x < 1)
+        fun_l29_n710(x)
+    else
+        fun_l29_n787(x)
+    end
+end
+
+def fun_l28_n378(x)
+    if (x < 1)
+        fun_l29_n448(x)
+    else
+        fun_l29_n170(x)
+    end
+end
+
+def fun_l28_n379(x)
+    if (x < 1)
+        fun_l29_n433(x)
+    else
+        fun_l29_n970(x)
+    end
+end
+
+def fun_l28_n380(x)
+    if (x < 1)
+        fun_l29_n933(x)
+    else
+        fun_l29_n995(x)
+    end
+end
+
+def fun_l28_n381(x)
+    if (x < 1)
+        fun_l29_n78(x)
+    else
+        fun_l29_n791(x)
+    end
+end
+
+def fun_l28_n382(x)
+    if (x < 1)
+        fun_l29_n101(x)
+    else
+        fun_l29_n592(x)
+    end
+end
+
+def fun_l28_n383(x)
+    if (x < 1)
+        fun_l29_n470(x)
+    else
+        fun_l29_n988(x)
+    end
+end
+
+def fun_l28_n384(x)
+    if (x < 1)
+        fun_l29_n260(x)
+    else
+        fun_l29_n359(x)
+    end
+end
+
+def fun_l28_n385(x)
+    if (x < 1)
+        fun_l29_n743(x)
+    else
+        fun_l29_n373(x)
+    end
+end
+
+def fun_l28_n386(x)
+    if (x < 1)
+        fun_l29_n49(x)
+    else
+        fun_l29_n591(x)
+    end
+end
+
+def fun_l28_n387(x)
+    if (x < 1)
+        fun_l29_n271(x)
+    else
+        fun_l29_n924(x)
+    end
+end
+
+def fun_l28_n388(x)
+    if (x < 1)
+        fun_l29_n876(x)
+    else
+        fun_l29_n219(x)
+    end
+end
+
+def fun_l28_n389(x)
+    if (x < 1)
+        fun_l29_n262(x)
+    else
+        fun_l29_n857(x)
+    end
+end
+
+def fun_l28_n390(x)
+    if (x < 1)
+        fun_l29_n217(x)
+    else
+        fun_l29_n198(x)
+    end
+end
+
+def fun_l28_n391(x)
+    if (x < 1)
+        fun_l29_n603(x)
+    else
+        fun_l29_n87(x)
+    end
+end
+
+def fun_l28_n392(x)
+    if (x < 1)
+        fun_l29_n498(x)
+    else
+        fun_l29_n913(x)
+    end
+end
+
+def fun_l28_n393(x)
+    if (x < 1)
+        fun_l29_n795(x)
+    else
+        fun_l29_n87(x)
+    end
+end
+
+def fun_l28_n394(x)
+    if (x < 1)
+        fun_l29_n528(x)
+    else
+        fun_l29_n217(x)
+    end
+end
+
+def fun_l28_n395(x)
+    if (x < 1)
+        fun_l29_n300(x)
+    else
+        fun_l29_n725(x)
+    end
+end
+
+def fun_l28_n396(x)
+    if (x < 1)
+        fun_l29_n538(x)
+    else
+        fun_l29_n812(x)
+    end
+end
+
+def fun_l28_n397(x)
+    if (x < 1)
+        fun_l29_n179(x)
+    else
+        fun_l29_n765(x)
+    end
+end
+
+def fun_l28_n398(x)
+    if (x < 1)
+        fun_l29_n28(x)
+    else
+        fun_l29_n475(x)
+    end
+end
+
+def fun_l28_n399(x)
+    if (x < 1)
+        fun_l29_n471(x)
+    else
+        fun_l29_n368(x)
+    end
+end
+
+def fun_l28_n400(x)
+    if (x < 1)
+        fun_l29_n241(x)
+    else
+        fun_l29_n461(x)
+    end
+end
+
+def fun_l28_n401(x)
+    if (x < 1)
+        fun_l29_n707(x)
+    else
+        fun_l29_n502(x)
+    end
+end
+
+def fun_l28_n402(x)
+    if (x < 1)
+        fun_l29_n129(x)
+    else
+        fun_l29_n176(x)
+    end
+end
+
+def fun_l28_n403(x)
+    if (x < 1)
+        fun_l29_n410(x)
+    else
+        fun_l29_n954(x)
+    end
+end
+
+def fun_l28_n404(x)
+    if (x < 1)
+        fun_l29_n203(x)
+    else
+        fun_l29_n455(x)
+    end
+end
+
+def fun_l28_n405(x)
+    if (x < 1)
+        fun_l29_n238(x)
+    else
+        fun_l29_n865(x)
+    end
+end
+
+def fun_l28_n406(x)
+    if (x < 1)
+        fun_l29_n836(x)
+    else
+        fun_l29_n778(x)
+    end
+end
+
+def fun_l28_n407(x)
+    if (x < 1)
+        fun_l29_n620(x)
+    else
+        fun_l29_n879(x)
+    end
+end
+
+def fun_l28_n408(x)
+    if (x < 1)
+        fun_l29_n656(x)
+    else
+        fun_l29_n594(x)
+    end
+end
+
+def fun_l28_n409(x)
+    if (x < 1)
+        fun_l29_n382(x)
+    else
+        fun_l29_n51(x)
+    end
+end
+
+def fun_l28_n410(x)
+    if (x < 1)
+        fun_l29_n357(x)
+    else
+        fun_l29_n660(x)
+    end
+end
+
+def fun_l28_n411(x)
+    if (x < 1)
+        fun_l29_n900(x)
+    else
+        fun_l29_n902(x)
+    end
+end
+
+def fun_l28_n412(x)
+    if (x < 1)
+        fun_l29_n645(x)
+    else
+        fun_l29_n0(x)
+    end
+end
+
+def fun_l28_n413(x)
+    if (x < 1)
+        fun_l29_n250(x)
+    else
+        fun_l29_n499(x)
+    end
+end
+
+def fun_l28_n414(x)
+    if (x < 1)
+        fun_l29_n700(x)
+    else
+        fun_l29_n301(x)
+    end
+end
+
+def fun_l28_n415(x)
+    if (x < 1)
+        fun_l29_n711(x)
+    else
+        fun_l29_n83(x)
+    end
+end
+
+def fun_l28_n416(x)
+    if (x < 1)
+        fun_l29_n332(x)
+    else
+        fun_l29_n237(x)
+    end
+end
+
+def fun_l28_n417(x)
+    if (x < 1)
+        fun_l29_n573(x)
+    else
+        fun_l29_n822(x)
+    end
+end
+
+def fun_l28_n418(x)
+    if (x < 1)
+        fun_l29_n766(x)
+    else
+        fun_l29_n131(x)
+    end
+end
+
+def fun_l28_n419(x)
+    if (x < 1)
+        fun_l29_n696(x)
+    else
+        fun_l29_n772(x)
+    end
+end
+
+def fun_l28_n420(x)
+    if (x < 1)
+        fun_l29_n361(x)
+    else
+        fun_l29_n598(x)
+    end
+end
+
+def fun_l28_n421(x)
+    if (x < 1)
+        fun_l29_n941(x)
+    else
+        fun_l29_n403(x)
+    end
+end
+
+def fun_l28_n422(x)
+    if (x < 1)
+        fun_l29_n471(x)
+    else
+        fun_l29_n636(x)
+    end
+end
+
+def fun_l28_n423(x)
+    if (x < 1)
+        fun_l29_n650(x)
+    else
+        fun_l29_n787(x)
+    end
+end
+
+def fun_l28_n424(x)
+    if (x < 1)
+        fun_l29_n982(x)
+    else
+        fun_l29_n51(x)
+    end
+end
+
+def fun_l28_n425(x)
+    if (x < 1)
+        fun_l29_n140(x)
+    else
+        fun_l29_n255(x)
+    end
+end
+
+def fun_l28_n426(x)
+    if (x < 1)
+        fun_l29_n694(x)
+    else
+        fun_l29_n777(x)
+    end
+end
+
+def fun_l28_n427(x)
+    if (x < 1)
+        fun_l29_n984(x)
+    else
+        fun_l29_n118(x)
+    end
+end
+
+def fun_l28_n428(x)
+    if (x < 1)
+        fun_l29_n641(x)
+    else
+        fun_l29_n904(x)
+    end
+end
+
+def fun_l28_n429(x)
+    if (x < 1)
+        fun_l29_n537(x)
+    else
+        fun_l29_n950(x)
+    end
+end
+
+def fun_l28_n430(x)
+    if (x < 1)
+        fun_l29_n844(x)
+    else
+        fun_l29_n350(x)
+    end
+end
+
+def fun_l28_n431(x)
+    if (x < 1)
+        fun_l29_n223(x)
+    else
+        fun_l29_n711(x)
+    end
+end
+
+def fun_l28_n432(x)
+    if (x < 1)
+        fun_l29_n287(x)
+    else
+        fun_l29_n424(x)
+    end
+end
+
+def fun_l28_n433(x)
+    if (x < 1)
+        fun_l29_n447(x)
+    else
+        fun_l29_n253(x)
+    end
+end
+
+def fun_l28_n434(x)
+    if (x < 1)
+        fun_l29_n484(x)
+    else
+        fun_l29_n377(x)
+    end
+end
+
+def fun_l28_n435(x)
+    if (x < 1)
+        fun_l29_n899(x)
+    else
+        fun_l29_n385(x)
+    end
+end
+
+def fun_l28_n436(x)
+    if (x < 1)
+        fun_l29_n13(x)
+    else
+        fun_l29_n910(x)
+    end
+end
+
+def fun_l28_n437(x)
+    if (x < 1)
+        fun_l29_n431(x)
+    else
+        fun_l29_n505(x)
+    end
+end
+
+def fun_l28_n438(x)
+    if (x < 1)
+        fun_l29_n974(x)
+    else
+        fun_l29_n162(x)
+    end
+end
+
+def fun_l28_n439(x)
+    if (x < 1)
+        fun_l29_n833(x)
+    else
+        fun_l29_n26(x)
+    end
+end
+
+def fun_l28_n440(x)
+    if (x < 1)
+        fun_l29_n576(x)
+    else
+        fun_l29_n783(x)
+    end
+end
+
+def fun_l28_n441(x)
+    if (x < 1)
+        fun_l29_n580(x)
+    else
+        fun_l29_n476(x)
+    end
+end
+
+def fun_l28_n442(x)
+    if (x < 1)
+        fun_l29_n415(x)
+    else
+        fun_l29_n695(x)
+    end
+end
+
+def fun_l28_n443(x)
+    if (x < 1)
+        fun_l29_n279(x)
+    else
+        fun_l29_n442(x)
+    end
+end
+
+def fun_l28_n444(x)
+    if (x < 1)
+        fun_l29_n784(x)
+    else
+        fun_l29_n25(x)
+    end
+end
+
+def fun_l28_n445(x)
+    if (x < 1)
+        fun_l29_n682(x)
+    else
+        fun_l29_n632(x)
+    end
+end
+
+def fun_l28_n446(x)
+    if (x < 1)
+        fun_l29_n793(x)
+    else
+        fun_l29_n199(x)
+    end
+end
+
+def fun_l28_n447(x)
+    if (x < 1)
+        fun_l29_n885(x)
+    else
+        fun_l29_n590(x)
+    end
+end
+
+def fun_l28_n448(x)
+    if (x < 1)
+        fun_l29_n457(x)
+    else
+        fun_l29_n664(x)
+    end
+end
+
+def fun_l28_n449(x)
+    if (x < 1)
+        fun_l29_n272(x)
+    else
+        fun_l29_n207(x)
+    end
+end
+
+def fun_l28_n450(x)
+    if (x < 1)
+        fun_l29_n73(x)
+    else
+        fun_l29_n598(x)
+    end
+end
+
+def fun_l28_n451(x)
+    if (x < 1)
+        fun_l29_n674(x)
+    else
+        fun_l29_n305(x)
+    end
+end
+
+def fun_l28_n452(x)
+    if (x < 1)
+        fun_l29_n97(x)
+    else
+        fun_l29_n472(x)
+    end
+end
+
+def fun_l28_n453(x)
+    if (x < 1)
+        fun_l29_n995(x)
+    else
+        fun_l29_n156(x)
+    end
+end
+
+def fun_l28_n454(x)
+    if (x < 1)
+        fun_l29_n890(x)
+    else
+        fun_l29_n885(x)
+    end
+end
+
+def fun_l28_n455(x)
+    if (x < 1)
+        fun_l29_n481(x)
+    else
+        fun_l29_n712(x)
+    end
+end
+
+def fun_l28_n456(x)
+    if (x < 1)
+        fun_l29_n34(x)
+    else
+        fun_l29_n186(x)
+    end
+end
+
+def fun_l28_n457(x)
+    if (x < 1)
+        fun_l29_n767(x)
+    else
+        fun_l29_n769(x)
+    end
+end
+
+def fun_l28_n458(x)
+    if (x < 1)
+        fun_l29_n185(x)
+    else
+        fun_l29_n55(x)
+    end
+end
+
+def fun_l28_n459(x)
+    if (x < 1)
+        fun_l29_n826(x)
+    else
+        fun_l29_n954(x)
+    end
+end
+
+def fun_l28_n460(x)
+    if (x < 1)
+        fun_l29_n111(x)
+    else
+        fun_l29_n374(x)
+    end
+end
+
+def fun_l28_n461(x)
+    if (x < 1)
+        fun_l29_n988(x)
+    else
+        fun_l29_n719(x)
+    end
+end
+
+def fun_l28_n462(x)
+    if (x < 1)
+        fun_l29_n355(x)
+    else
+        fun_l29_n772(x)
+    end
+end
+
+def fun_l28_n463(x)
+    if (x < 1)
+        fun_l29_n348(x)
+    else
+        fun_l29_n973(x)
+    end
+end
+
+def fun_l28_n464(x)
+    if (x < 1)
+        fun_l29_n466(x)
+    else
+        fun_l29_n661(x)
+    end
+end
+
+def fun_l28_n465(x)
+    if (x < 1)
+        fun_l29_n95(x)
+    else
+        fun_l29_n300(x)
+    end
+end
+
+def fun_l28_n466(x)
+    if (x < 1)
+        fun_l29_n373(x)
+    else
+        fun_l29_n425(x)
+    end
+end
+
+def fun_l28_n467(x)
+    if (x < 1)
+        fun_l29_n669(x)
+    else
+        fun_l29_n990(x)
+    end
+end
+
+def fun_l28_n468(x)
+    if (x < 1)
+        fun_l29_n908(x)
+    else
+        fun_l29_n416(x)
+    end
+end
+
+def fun_l28_n469(x)
+    if (x < 1)
+        fun_l29_n795(x)
+    else
+        fun_l29_n7(x)
+    end
+end
+
+def fun_l28_n470(x)
+    if (x < 1)
+        fun_l29_n660(x)
+    else
+        fun_l29_n938(x)
+    end
+end
+
+def fun_l28_n471(x)
+    if (x < 1)
+        fun_l29_n816(x)
+    else
+        fun_l29_n857(x)
+    end
+end
+
+def fun_l28_n472(x)
+    if (x < 1)
+        fun_l29_n685(x)
+    else
+        fun_l29_n631(x)
+    end
+end
+
+def fun_l28_n473(x)
+    if (x < 1)
+        fun_l29_n521(x)
+    else
+        fun_l29_n21(x)
+    end
+end
+
+def fun_l28_n474(x)
+    if (x < 1)
+        fun_l29_n994(x)
+    else
+        fun_l29_n888(x)
+    end
+end
+
+def fun_l28_n475(x)
+    if (x < 1)
+        fun_l29_n819(x)
+    else
+        fun_l29_n735(x)
+    end
+end
+
+def fun_l28_n476(x)
+    if (x < 1)
+        fun_l29_n809(x)
+    else
+        fun_l29_n265(x)
+    end
+end
+
+def fun_l28_n477(x)
+    if (x < 1)
+        fun_l29_n99(x)
+    else
+        fun_l29_n484(x)
+    end
+end
+
+def fun_l28_n478(x)
+    if (x < 1)
+        fun_l29_n985(x)
+    else
+        fun_l29_n922(x)
+    end
+end
+
+def fun_l28_n479(x)
+    if (x < 1)
+        fun_l29_n502(x)
+    else
+        fun_l29_n475(x)
+    end
+end
+
+def fun_l28_n480(x)
+    if (x < 1)
+        fun_l29_n104(x)
+    else
+        fun_l29_n168(x)
+    end
+end
+
+def fun_l28_n481(x)
+    if (x < 1)
+        fun_l29_n176(x)
+    else
+        fun_l29_n736(x)
+    end
+end
+
+def fun_l28_n482(x)
+    if (x < 1)
+        fun_l29_n817(x)
+    else
+        fun_l29_n155(x)
+    end
+end
+
+def fun_l28_n483(x)
+    if (x < 1)
+        fun_l29_n162(x)
+    else
+        fun_l29_n45(x)
+    end
+end
+
+def fun_l28_n484(x)
+    if (x < 1)
+        fun_l29_n733(x)
+    else
+        fun_l29_n438(x)
+    end
+end
+
+def fun_l28_n485(x)
+    if (x < 1)
+        fun_l29_n323(x)
+    else
+        fun_l29_n410(x)
+    end
+end
+
+def fun_l28_n486(x)
+    if (x < 1)
+        fun_l29_n141(x)
+    else
+        fun_l29_n327(x)
+    end
+end
+
+def fun_l28_n487(x)
+    if (x < 1)
+        fun_l29_n122(x)
+    else
+        fun_l29_n280(x)
+    end
+end
+
+def fun_l28_n488(x)
+    if (x < 1)
+        fun_l29_n966(x)
+    else
+        fun_l29_n407(x)
+    end
+end
+
+def fun_l28_n489(x)
+    if (x < 1)
+        fun_l29_n826(x)
+    else
+        fun_l29_n852(x)
+    end
+end
+
+def fun_l28_n490(x)
+    if (x < 1)
+        fun_l29_n823(x)
+    else
+        fun_l29_n724(x)
+    end
+end
+
+def fun_l28_n491(x)
+    if (x < 1)
+        fun_l29_n291(x)
+    else
+        fun_l29_n151(x)
+    end
+end
+
+def fun_l28_n492(x)
+    if (x < 1)
+        fun_l29_n944(x)
+    else
+        fun_l29_n663(x)
+    end
+end
+
+def fun_l28_n493(x)
+    if (x < 1)
+        fun_l29_n552(x)
+    else
+        fun_l29_n954(x)
+    end
+end
+
+def fun_l28_n494(x)
+    if (x < 1)
+        fun_l29_n622(x)
+    else
+        fun_l29_n378(x)
+    end
+end
+
+def fun_l28_n495(x)
+    if (x < 1)
+        fun_l29_n824(x)
+    else
+        fun_l29_n377(x)
+    end
+end
+
+def fun_l28_n496(x)
+    if (x < 1)
+        fun_l29_n939(x)
+    else
+        fun_l29_n927(x)
+    end
+end
+
+def fun_l28_n497(x)
+    if (x < 1)
+        fun_l29_n760(x)
+    else
+        fun_l29_n215(x)
+    end
+end
+
+def fun_l28_n498(x)
+    if (x < 1)
+        fun_l29_n208(x)
+    else
+        fun_l29_n256(x)
+    end
+end
+
+def fun_l28_n499(x)
+    if (x < 1)
+        fun_l29_n19(x)
+    else
+        fun_l29_n956(x)
+    end
+end
+
+def fun_l28_n500(x)
+    if (x < 1)
+        fun_l29_n963(x)
+    else
+        fun_l29_n322(x)
+    end
+end
+
+def fun_l28_n501(x)
+    if (x < 1)
+        fun_l29_n564(x)
+    else
+        fun_l29_n261(x)
+    end
+end
+
+def fun_l28_n502(x)
+    if (x < 1)
+        fun_l29_n105(x)
+    else
+        fun_l29_n82(x)
+    end
+end
+
+def fun_l28_n503(x)
+    if (x < 1)
+        fun_l29_n165(x)
+    else
+        fun_l29_n101(x)
+    end
+end
+
+def fun_l28_n504(x)
+    if (x < 1)
+        fun_l29_n619(x)
+    else
+        fun_l29_n453(x)
+    end
+end
+
+def fun_l28_n505(x)
+    if (x < 1)
+        fun_l29_n20(x)
+    else
+        fun_l29_n329(x)
+    end
+end
+
+def fun_l28_n506(x)
+    if (x < 1)
+        fun_l29_n889(x)
+    else
+        fun_l29_n392(x)
+    end
+end
+
+def fun_l28_n507(x)
+    if (x < 1)
+        fun_l29_n824(x)
+    else
+        fun_l29_n709(x)
+    end
+end
+
+def fun_l28_n508(x)
+    if (x < 1)
+        fun_l29_n838(x)
+    else
+        fun_l29_n384(x)
+    end
+end
+
+def fun_l28_n509(x)
+    if (x < 1)
+        fun_l29_n364(x)
+    else
+        fun_l29_n789(x)
+    end
+end
+
+def fun_l28_n510(x)
+    if (x < 1)
+        fun_l29_n824(x)
+    else
+        fun_l29_n4(x)
+    end
+end
+
+def fun_l28_n511(x)
+    if (x < 1)
+        fun_l29_n481(x)
+    else
+        fun_l29_n883(x)
+    end
+end
+
+def fun_l28_n512(x)
+    if (x < 1)
+        fun_l29_n842(x)
+    else
+        fun_l29_n959(x)
+    end
+end
+
+def fun_l28_n513(x)
+    if (x < 1)
+        fun_l29_n989(x)
+    else
+        fun_l29_n400(x)
+    end
+end
+
+def fun_l28_n514(x)
+    if (x < 1)
+        fun_l29_n952(x)
+    else
+        fun_l29_n245(x)
+    end
+end
+
+def fun_l28_n515(x)
+    if (x < 1)
+        fun_l29_n966(x)
+    else
+        fun_l29_n91(x)
+    end
+end
+
+def fun_l28_n516(x)
+    if (x < 1)
+        fun_l29_n489(x)
+    else
+        fun_l29_n280(x)
+    end
+end
+
+def fun_l28_n517(x)
+    if (x < 1)
+        fun_l29_n128(x)
+    else
+        fun_l29_n722(x)
+    end
+end
+
+def fun_l28_n518(x)
+    if (x < 1)
+        fun_l29_n429(x)
+    else
+        fun_l29_n412(x)
+    end
+end
+
+def fun_l28_n519(x)
+    if (x < 1)
+        fun_l29_n884(x)
+    else
+        fun_l29_n993(x)
+    end
+end
+
+def fun_l28_n520(x)
+    if (x < 1)
+        fun_l29_n470(x)
+    else
+        fun_l29_n308(x)
+    end
+end
+
+def fun_l28_n521(x)
+    if (x < 1)
+        fun_l29_n583(x)
+    else
+        fun_l29_n683(x)
+    end
+end
+
+def fun_l28_n522(x)
+    if (x < 1)
+        fun_l29_n400(x)
+    else
+        fun_l29_n643(x)
+    end
+end
+
+def fun_l28_n523(x)
+    if (x < 1)
+        fun_l29_n750(x)
+    else
+        fun_l29_n388(x)
+    end
+end
+
+def fun_l28_n524(x)
+    if (x < 1)
+        fun_l29_n252(x)
+    else
+        fun_l29_n426(x)
+    end
+end
+
+def fun_l28_n525(x)
+    if (x < 1)
+        fun_l29_n51(x)
+    else
+        fun_l29_n720(x)
+    end
+end
+
+def fun_l28_n526(x)
+    if (x < 1)
+        fun_l29_n633(x)
+    else
+        fun_l29_n160(x)
+    end
+end
+
+def fun_l28_n527(x)
+    if (x < 1)
+        fun_l29_n507(x)
+    else
+        fun_l29_n630(x)
+    end
+end
+
+def fun_l28_n528(x)
+    if (x < 1)
+        fun_l29_n53(x)
+    else
+        fun_l29_n189(x)
+    end
+end
+
+def fun_l28_n529(x)
+    if (x < 1)
+        fun_l29_n191(x)
+    else
+        fun_l29_n767(x)
+    end
+end
+
+def fun_l28_n530(x)
+    if (x < 1)
+        fun_l29_n265(x)
+    else
+        fun_l29_n130(x)
+    end
+end
+
+def fun_l28_n531(x)
+    if (x < 1)
+        fun_l29_n936(x)
+    else
+        fun_l29_n270(x)
+    end
+end
+
+def fun_l28_n532(x)
+    if (x < 1)
+        fun_l29_n910(x)
+    else
+        fun_l29_n144(x)
+    end
+end
+
+def fun_l28_n533(x)
+    if (x < 1)
+        fun_l29_n155(x)
+    else
+        fun_l29_n947(x)
+    end
+end
+
+def fun_l28_n534(x)
+    if (x < 1)
+        fun_l29_n977(x)
+    else
+        fun_l29_n372(x)
+    end
+end
+
+def fun_l28_n535(x)
+    if (x < 1)
+        fun_l29_n728(x)
+    else
+        fun_l29_n657(x)
+    end
+end
+
+def fun_l28_n536(x)
+    if (x < 1)
+        fun_l29_n360(x)
+    else
+        fun_l29_n154(x)
+    end
+end
+
+def fun_l28_n537(x)
+    if (x < 1)
+        fun_l29_n934(x)
+    else
+        fun_l29_n93(x)
+    end
+end
+
+def fun_l28_n538(x)
+    if (x < 1)
+        fun_l29_n254(x)
+    else
+        fun_l29_n201(x)
+    end
+end
+
+def fun_l28_n539(x)
+    if (x < 1)
+        fun_l29_n310(x)
+    else
+        fun_l29_n104(x)
+    end
+end
+
+def fun_l28_n540(x)
+    if (x < 1)
+        fun_l29_n197(x)
+    else
+        fun_l29_n332(x)
+    end
+end
+
+def fun_l28_n541(x)
+    if (x < 1)
+        fun_l29_n144(x)
+    else
+        fun_l29_n519(x)
+    end
+end
+
+def fun_l28_n542(x)
+    if (x < 1)
+        fun_l29_n582(x)
+    else
+        fun_l29_n257(x)
+    end
+end
+
+def fun_l28_n543(x)
+    if (x < 1)
+        fun_l29_n984(x)
+    else
+        fun_l29_n375(x)
+    end
+end
+
+def fun_l28_n544(x)
+    if (x < 1)
+        fun_l29_n201(x)
+    else
+        fun_l29_n746(x)
+    end
+end
+
+def fun_l28_n545(x)
+    if (x < 1)
+        fun_l29_n530(x)
+    else
+        fun_l29_n209(x)
+    end
+end
+
+def fun_l28_n546(x)
+    if (x < 1)
+        fun_l29_n764(x)
+    else
+        fun_l29_n858(x)
+    end
+end
+
+def fun_l28_n547(x)
+    if (x < 1)
+        fun_l29_n830(x)
+    else
+        fun_l29_n58(x)
+    end
+end
+
+def fun_l28_n548(x)
+    if (x < 1)
+        fun_l29_n746(x)
+    else
+        fun_l29_n374(x)
+    end
+end
+
+def fun_l28_n549(x)
+    if (x < 1)
+        fun_l29_n923(x)
+    else
+        fun_l29_n489(x)
+    end
+end
+
+def fun_l28_n550(x)
+    if (x < 1)
+        fun_l29_n188(x)
+    else
+        fun_l29_n866(x)
+    end
+end
+
+def fun_l28_n551(x)
+    if (x < 1)
+        fun_l29_n959(x)
+    else
+        fun_l29_n493(x)
+    end
+end
+
+def fun_l28_n552(x)
+    if (x < 1)
+        fun_l29_n568(x)
+    else
+        fun_l29_n747(x)
+    end
+end
+
+def fun_l28_n553(x)
+    if (x < 1)
+        fun_l29_n972(x)
+    else
+        fun_l29_n507(x)
+    end
+end
+
+def fun_l28_n554(x)
+    if (x < 1)
+        fun_l29_n557(x)
+    else
+        fun_l29_n765(x)
+    end
+end
+
+def fun_l28_n555(x)
+    if (x < 1)
+        fun_l29_n430(x)
+    else
+        fun_l29_n941(x)
+    end
+end
+
+def fun_l28_n556(x)
+    if (x < 1)
+        fun_l29_n631(x)
+    else
+        fun_l29_n384(x)
+    end
+end
+
+def fun_l28_n557(x)
+    if (x < 1)
+        fun_l29_n681(x)
+    else
+        fun_l29_n976(x)
+    end
+end
+
+def fun_l28_n558(x)
+    if (x < 1)
+        fun_l29_n326(x)
+    else
+        fun_l29_n481(x)
+    end
+end
+
+def fun_l28_n559(x)
+    if (x < 1)
+        fun_l29_n882(x)
+    else
+        fun_l29_n129(x)
+    end
+end
+
+def fun_l28_n560(x)
+    if (x < 1)
+        fun_l29_n471(x)
+    else
+        fun_l29_n156(x)
+    end
+end
+
+def fun_l28_n561(x)
+    if (x < 1)
+        fun_l29_n692(x)
+    else
+        fun_l29_n968(x)
+    end
+end
+
+def fun_l28_n562(x)
+    if (x < 1)
+        fun_l29_n207(x)
+    else
+        fun_l29_n251(x)
+    end
+end
+
+def fun_l28_n563(x)
+    if (x < 1)
+        fun_l29_n519(x)
+    else
+        fun_l29_n749(x)
+    end
+end
+
+def fun_l28_n564(x)
+    if (x < 1)
+        fun_l29_n609(x)
+    else
+        fun_l29_n657(x)
+    end
+end
+
+def fun_l28_n565(x)
+    if (x < 1)
+        fun_l29_n100(x)
+    else
+        fun_l29_n932(x)
+    end
+end
+
+def fun_l28_n566(x)
+    if (x < 1)
+        fun_l29_n499(x)
+    else
+        fun_l29_n455(x)
+    end
+end
+
+def fun_l28_n567(x)
+    if (x < 1)
+        fun_l29_n486(x)
+    else
+        fun_l29_n13(x)
+    end
+end
+
+def fun_l28_n568(x)
+    if (x < 1)
+        fun_l29_n855(x)
+    else
+        fun_l29_n809(x)
+    end
+end
+
+def fun_l28_n569(x)
+    if (x < 1)
+        fun_l29_n295(x)
+    else
+        fun_l29_n576(x)
+    end
+end
+
+def fun_l28_n570(x)
+    if (x < 1)
+        fun_l29_n354(x)
+    else
+        fun_l29_n430(x)
+    end
+end
+
+def fun_l28_n571(x)
+    if (x < 1)
+        fun_l29_n307(x)
+    else
+        fun_l29_n560(x)
+    end
+end
+
+def fun_l28_n572(x)
+    if (x < 1)
+        fun_l29_n528(x)
+    else
+        fun_l29_n642(x)
+    end
+end
+
+def fun_l28_n573(x)
+    if (x < 1)
+        fun_l29_n552(x)
+    else
+        fun_l29_n421(x)
+    end
+end
+
+def fun_l28_n574(x)
+    if (x < 1)
+        fun_l29_n238(x)
+    else
+        fun_l29_n471(x)
+    end
+end
+
+def fun_l28_n575(x)
+    if (x < 1)
+        fun_l29_n748(x)
+    else
+        fun_l29_n381(x)
+    end
+end
+
+def fun_l28_n576(x)
+    if (x < 1)
+        fun_l29_n75(x)
+    else
+        fun_l29_n994(x)
+    end
+end
+
+def fun_l28_n577(x)
+    if (x < 1)
+        fun_l29_n159(x)
+    else
+        fun_l29_n923(x)
+    end
+end
+
+def fun_l28_n578(x)
+    if (x < 1)
+        fun_l29_n657(x)
+    else
+        fun_l29_n984(x)
+    end
+end
+
+def fun_l28_n579(x)
+    if (x < 1)
+        fun_l29_n150(x)
+    else
+        fun_l29_n887(x)
+    end
+end
+
+def fun_l28_n580(x)
+    if (x < 1)
+        fun_l29_n362(x)
+    else
+        fun_l29_n574(x)
+    end
+end
+
+def fun_l28_n581(x)
+    if (x < 1)
+        fun_l29_n95(x)
+    else
+        fun_l29_n258(x)
+    end
+end
+
+def fun_l28_n582(x)
+    if (x < 1)
+        fun_l29_n123(x)
+    else
+        fun_l29_n501(x)
+    end
+end
+
+def fun_l28_n583(x)
+    if (x < 1)
+        fun_l29_n934(x)
+    else
+        fun_l29_n94(x)
+    end
+end
+
+def fun_l28_n584(x)
+    if (x < 1)
+        fun_l29_n764(x)
+    else
+        fun_l29_n350(x)
+    end
+end
+
+def fun_l28_n585(x)
+    if (x < 1)
+        fun_l29_n328(x)
+    else
+        fun_l29_n483(x)
+    end
+end
+
+def fun_l28_n586(x)
+    if (x < 1)
+        fun_l29_n533(x)
+    else
+        fun_l29_n956(x)
+    end
+end
+
+def fun_l28_n587(x)
+    if (x < 1)
+        fun_l29_n632(x)
+    else
+        fun_l29_n243(x)
+    end
+end
+
+def fun_l28_n588(x)
+    if (x < 1)
+        fun_l29_n897(x)
+    else
+        fun_l29_n894(x)
+    end
+end
+
+def fun_l28_n589(x)
+    if (x < 1)
+        fun_l29_n867(x)
+    else
+        fun_l29_n68(x)
+    end
+end
+
+def fun_l28_n590(x)
+    if (x < 1)
+        fun_l29_n266(x)
+    else
+        fun_l29_n763(x)
+    end
+end
+
+def fun_l28_n591(x)
+    if (x < 1)
+        fun_l29_n104(x)
+    else
+        fun_l29_n940(x)
+    end
+end
+
+def fun_l28_n592(x)
+    if (x < 1)
+        fun_l29_n409(x)
+    else
+        fun_l29_n561(x)
+    end
+end
+
+def fun_l28_n593(x)
+    if (x < 1)
+        fun_l29_n485(x)
+    else
+        fun_l29_n780(x)
+    end
+end
+
+def fun_l28_n594(x)
+    if (x < 1)
+        fun_l29_n925(x)
+    else
+        fun_l29_n581(x)
+    end
+end
+
+def fun_l28_n595(x)
+    if (x < 1)
+        fun_l29_n566(x)
+    else
+        fun_l29_n288(x)
+    end
+end
+
+def fun_l28_n596(x)
+    if (x < 1)
+        fun_l29_n166(x)
+    else
+        fun_l29_n702(x)
+    end
+end
+
+def fun_l28_n597(x)
+    if (x < 1)
+        fun_l29_n82(x)
+    else
+        fun_l29_n815(x)
+    end
+end
+
+def fun_l28_n598(x)
+    if (x < 1)
+        fun_l29_n913(x)
+    else
+        fun_l29_n623(x)
+    end
+end
+
+def fun_l28_n599(x)
+    if (x < 1)
+        fun_l29_n431(x)
+    else
+        fun_l29_n216(x)
+    end
+end
+
+def fun_l28_n600(x)
+    if (x < 1)
+        fun_l29_n260(x)
+    else
+        fun_l29_n907(x)
+    end
+end
+
+def fun_l28_n601(x)
+    if (x < 1)
+        fun_l29_n232(x)
+    else
+        fun_l29_n504(x)
+    end
+end
+
+def fun_l28_n602(x)
+    if (x < 1)
+        fun_l29_n25(x)
+    else
+        fun_l29_n844(x)
+    end
+end
+
+def fun_l28_n603(x)
+    if (x < 1)
+        fun_l29_n997(x)
+    else
+        fun_l29_n821(x)
+    end
+end
+
+def fun_l28_n604(x)
+    if (x < 1)
+        fun_l29_n732(x)
+    else
+        fun_l29_n301(x)
+    end
+end
+
+def fun_l28_n605(x)
+    if (x < 1)
+        fun_l29_n971(x)
+    else
+        fun_l29_n522(x)
+    end
+end
+
+def fun_l28_n606(x)
+    if (x < 1)
+        fun_l29_n518(x)
+    else
+        fun_l29_n874(x)
+    end
+end
+
+def fun_l28_n607(x)
+    if (x < 1)
+        fun_l29_n104(x)
+    else
+        fun_l29_n529(x)
+    end
+end
+
+def fun_l28_n608(x)
+    if (x < 1)
+        fun_l29_n662(x)
+    else
+        fun_l29_n830(x)
+    end
+end
+
+def fun_l28_n609(x)
+    if (x < 1)
+        fun_l29_n521(x)
+    else
+        fun_l29_n944(x)
+    end
+end
+
+def fun_l28_n610(x)
+    if (x < 1)
+        fun_l29_n231(x)
+    else
+        fun_l29_n92(x)
+    end
+end
+
+def fun_l28_n611(x)
+    if (x < 1)
+        fun_l29_n290(x)
+    else
+        fun_l29_n261(x)
+    end
+end
+
+def fun_l28_n612(x)
+    if (x < 1)
+        fun_l29_n490(x)
+    else
+        fun_l29_n621(x)
+    end
+end
+
+def fun_l28_n613(x)
+    if (x < 1)
+        fun_l29_n131(x)
+    else
+        fun_l29_n946(x)
+    end
+end
+
+def fun_l28_n614(x)
+    if (x < 1)
+        fun_l29_n34(x)
+    else
+        fun_l29_n159(x)
+    end
+end
+
+def fun_l28_n615(x)
+    if (x < 1)
+        fun_l29_n811(x)
+    else
+        fun_l29_n895(x)
+    end
+end
+
+def fun_l28_n616(x)
+    if (x < 1)
+        fun_l29_n713(x)
+    else
+        fun_l29_n686(x)
+    end
+end
+
+def fun_l28_n617(x)
+    if (x < 1)
+        fun_l29_n650(x)
+    else
+        fun_l29_n256(x)
+    end
+end
+
+def fun_l28_n618(x)
+    if (x < 1)
+        fun_l29_n815(x)
+    else
+        fun_l29_n537(x)
+    end
+end
+
+def fun_l28_n619(x)
+    if (x < 1)
+        fun_l29_n739(x)
+    else
+        fun_l29_n735(x)
+    end
+end
+
+def fun_l28_n620(x)
+    if (x < 1)
+        fun_l29_n857(x)
+    else
+        fun_l29_n863(x)
+    end
+end
+
+def fun_l28_n621(x)
+    if (x < 1)
+        fun_l29_n81(x)
+    else
+        fun_l29_n755(x)
+    end
+end
+
+def fun_l28_n622(x)
+    if (x < 1)
+        fun_l29_n841(x)
+    else
+        fun_l29_n597(x)
+    end
+end
+
+def fun_l28_n623(x)
+    if (x < 1)
+        fun_l29_n87(x)
+    else
+        fun_l29_n676(x)
+    end
+end
+
+def fun_l28_n624(x)
+    if (x < 1)
+        fun_l29_n67(x)
+    else
+        fun_l29_n883(x)
+    end
+end
+
+def fun_l28_n625(x)
+    if (x < 1)
+        fun_l29_n223(x)
+    else
+        fun_l29_n139(x)
+    end
+end
+
+def fun_l28_n626(x)
+    if (x < 1)
+        fun_l29_n351(x)
+    else
+        fun_l29_n11(x)
+    end
+end
+
+def fun_l28_n627(x)
+    if (x < 1)
+        fun_l29_n281(x)
+    else
+        fun_l29_n138(x)
+    end
+end
+
+def fun_l28_n628(x)
+    if (x < 1)
+        fun_l29_n118(x)
+    else
+        fun_l29_n44(x)
+    end
+end
+
+def fun_l28_n629(x)
+    if (x < 1)
+        fun_l29_n55(x)
+    else
+        fun_l29_n249(x)
+    end
+end
+
+def fun_l28_n630(x)
+    if (x < 1)
+        fun_l29_n636(x)
+    else
+        fun_l29_n717(x)
+    end
+end
+
+def fun_l28_n631(x)
+    if (x < 1)
+        fun_l29_n88(x)
+    else
+        fun_l29_n670(x)
+    end
+end
+
+def fun_l28_n632(x)
+    if (x < 1)
+        fun_l29_n311(x)
+    else
+        fun_l29_n337(x)
+    end
+end
+
+def fun_l28_n633(x)
+    if (x < 1)
+        fun_l29_n67(x)
+    else
+        fun_l29_n12(x)
+    end
+end
+
+def fun_l28_n634(x)
+    if (x < 1)
+        fun_l29_n581(x)
+    else
+        fun_l29_n618(x)
+    end
+end
+
+def fun_l28_n635(x)
+    if (x < 1)
+        fun_l29_n709(x)
+    else
+        fun_l29_n120(x)
+    end
+end
+
+def fun_l28_n636(x)
+    if (x < 1)
+        fun_l29_n904(x)
+    else
+        fun_l29_n987(x)
+    end
+end
+
+def fun_l28_n637(x)
+    if (x < 1)
+        fun_l29_n274(x)
+    else
+        fun_l29_n219(x)
+    end
+end
+
+def fun_l28_n638(x)
+    if (x < 1)
+        fun_l29_n444(x)
+    else
+        fun_l29_n609(x)
+    end
+end
+
+def fun_l28_n639(x)
+    if (x < 1)
+        fun_l29_n473(x)
+    else
+        fun_l29_n433(x)
+    end
+end
+
+def fun_l28_n640(x)
+    if (x < 1)
+        fun_l29_n344(x)
+    else
+        fun_l29_n59(x)
+    end
+end
+
+def fun_l28_n641(x)
+    if (x < 1)
+        fun_l29_n973(x)
+    else
+        fun_l29_n506(x)
+    end
+end
+
+def fun_l28_n642(x)
+    if (x < 1)
+        fun_l29_n387(x)
+    else
+        fun_l29_n347(x)
+    end
+end
+
+def fun_l28_n643(x)
+    if (x < 1)
+        fun_l29_n138(x)
+    else
+        fun_l29_n597(x)
+    end
+end
+
+def fun_l28_n644(x)
+    if (x < 1)
+        fun_l29_n622(x)
+    else
+        fun_l29_n276(x)
+    end
+end
+
+def fun_l28_n645(x)
+    if (x < 1)
+        fun_l29_n454(x)
+    else
+        fun_l29_n930(x)
+    end
+end
+
+def fun_l28_n646(x)
+    if (x < 1)
+        fun_l29_n586(x)
+    else
+        fun_l29_n3(x)
+    end
+end
+
+def fun_l28_n647(x)
+    if (x < 1)
+        fun_l29_n508(x)
+    else
+        fun_l29_n489(x)
+    end
+end
+
+def fun_l28_n648(x)
+    if (x < 1)
+        fun_l29_n549(x)
+    else
+        fun_l29_n57(x)
+    end
+end
+
+def fun_l28_n649(x)
+    if (x < 1)
+        fun_l29_n32(x)
+    else
+        fun_l29_n487(x)
+    end
+end
+
+def fun_l28_n650(x)
+    if (x < 1)
+        fun_l29_n567(x)
+    else
+        fun_l29_n733(x)
+    end
+end
+
+def fun_l28_n651(x)
+    if (x < 1)
+        fun_l29_n401(x)
+    else
+        fun_l29_n234(x)
+    end
+end
+
+def fun_l28_n652(x)
+    if (x < 1)
+        fun_l29_n124(x)
+    else
+        fun_l29_n387(x)
+    end
+end
+
+def fun_l28_n653(x)
+    if (x < 1)
+        fun_l29_n517(x)
+    else
+        fun_l29_n150(x)
+    end
+end
+
+def fun_l28_n654(x)
+    if (x < 1)
+        fun_l29_n502(x)
+    else
+        fun_l29_n139(x)
+    end
+end
+
+def fun_l28_n655(x)
+    if (x < 1)
+        fun_l29_n304(x)
+    else
+        fun_l29_n871(x)
+    end
+end
+
+def fun_l28_n656(x)
+    if (x < 1)
+        fun_l29_n413(x)
+    else
+        fun_l29_n759(x)
+    end
+end
+
+def fun_l28_n657(x)
+    if (x < 1)
+        fun_l29_n810(x)
+    else
+        fun_l29_n274(x)
+    end
+end
+
+def fun_l28_n658(x)
+    if (x < 1)
+        fun_l29_n706(x)
+    else
+        fun_l29_n564(x)
+    end
+end
+
+def fun_l28_n659(x)
+    if (x < 1)
+        fun_l29_n205(x)
+    else
+        fun_l29_n857(x)
+    end
+end
+
+def fun_l28_n660(x)
+    if (x < 1)
+        fun_l29_n534(x)
+    else
+        fun_l29_n853(x)
+    end
+end
+
+def fun_l28_n661(x)
+    if (x < 1)
+        fun_l29_n436(x)
+    else
+        fun_l29_n227(x)
+    end
+end
+
+def fun_l28_n662(x)
+    if (x < 1)
+        fun_l29_n784(x)
+    else
+        fun_l29_n352(x)
+    end
+end
+
+def fun_l28_n663(x)
+    if (x < 1)
+        fun_l29_n889(x)
+    else
+        fun_l29_n186(x)
+    end
+end
+
+def fun_l28_n664(x)
+    if (x < 1)
+        fun_l29_n872(x)
+    else
+        fun_l29_n217(x)
+    end
+end
+
+def fun_l28_n665(x)
+    if (x < 1)
+        fun_l29_n111(x)
+    else
+        fun_l29_n355(x)
+    end
+end
+
+def fun_l28_n666(x)
+    if (x < 1)
+        fun_l29_n175(x)
+    else
+        fun_l29_n971(x)
+    end
+end
+
+def fun_l28_n667(x)
+    if (x < 1)
+        fun_l29_n823(x)
+    else
+        fun_l29_n123(x)
+    end
+end
+
+def fun_l28_n668(x)
+    if (x < 1)
+        fun_l29_n239(x)
+    else
+        fun_l29_n58(x)
+    end
+end
+
+def fun_l28_n669(x)
+    if (x < 1)
+        fun_l29_n127(x)
+    else
+        fun_l29_n628(x)
+    end
+end
+
+def fun_l28_n670(x)
+    if (x < 1)
+        fun_l29_n967(x)
+    else
+        fun_l29_n575(x)
+    end
+end
+
+def fun_l28_n671(x)
+    if (x < 1)
+        fun_l29_n994(x)
+    else
+        fun_l29_n352(x)
+    end
+end
+
+def fun_l28_n672(x)
+    if (x < 1)
+        fun_l29_n598(x)
+    else
+        fun_l29_n620(x)
+    end
+end
+
+def fun_l28_n673(x)
+    if (x < 1)
+        fun_l29_n407(x)
+    else
+        fun_l29_n132(x)
+    end
+end
+
+def fun_l28_n674(x)
+    if (x < 1)
+        fun_l29_n553(x)
+    else
+        fun_l29_n807(x)
+    end
+end
+
+def fun_l28_n675(x)
+    if (x < 1)
+        fun_l29_n918(x)
+    else
+        fun_l29_n462(x)
+    end
+end
+
+def fun_l28_n676(x)
+    if (x < 1)
+        fun_l29_n340(x)
+    else
+        fun_l29_n905(x)
+    end
+end
+
+def fun_l28_n677(x)
+    if (x < 1)
+        fun_l29_n322(x)
+    else
+        fun_l29_n657(x)
+    end
+end
+
+def fun_l28_n678(x)
+    if (x < 1)
+        fun_l29_n249(x)
+    else
+        fun_l29_n691(x)
+    end
+end
+
+def fun_l28_n679(x)
+    if (x < 1)
+        fun_l29_n227(x)
+    else
+        fun_l29_n559(x)
+    end
+end
+
+def fun_l28_n680(x)
+    if (x < 1)
+        fun_l29_n151(x)
+    else
+        fun_l29_n191(x)
+    end
+end
+
+def fun_l28_n681(x)
+    if (x < 1)
+        fun_l29_n211(x)
+    else
+        fun_l29_n400(x)
+    end
+end
+
+def fun_l28_n682(x)
+    if (x < 1)
+        fun_l29_n124(x)
+    else
+        fun_l29_n334(x)
+    end
+end
+
+def fun_l28_n683(x)
+    if (x < 1)
+        fun_l29_n876(x)
+    else
+        fun_l29_n839(x)
+    end
+end
+
+def fun_l28_n684(x)
+    if (x < 1)
+        fun_l29_n764(x)
+    else
+        fun_l29_n449(x)
+    end
+end
+
+def fun_l28_n685(x)
+    if (x < 1)
+        fun_l29_n316(x)
+    else
+        fun_l29_n730(x)
+    end
+end
+
+def fun_l28_n686(x)
+    if (x < 1)
+        fun_l29_n557(x)
+    else
+        fun_l29_n851(x)
+    end
+end
+
+def fun_l28_n687(x)
+    if (x < 1)
+        fun_l29_n315(x)
+    else
+        fun_l29_n280(x)
+    end
+end
+
+def fun_l28_n688(x)
+    if (x < 1)
+        fun_l29_n467(x)
+    else
+        fun_l29_n593(x)
+    end
+end
+
+def fun_l28_n689(x)
+    if (x < 1)
+        fun_l29_n537(x)
+    else
+        fun_l29_n37(x)
+    end
+end
+
+def fun_l28_n690(x)
+    if (x < 1)
+        fun_l29_n582(x)
+    else
+        fun_l29_n205(x)
+    end
+end
+
+def fun_l28_n691(x)
+    if (x < 1)
+        fun_l29_n672(x)
+    else
+        fun_l29_n656(x)
+    end
+end
+
+def fun_l28_n692(x)
+    if (x < 1)
+        fun_l29_n280(x)
+    else
+        fun_l29_n404(x)
+    end
+end
+
+def fun_l28_n693(x)
+    if (x < 1)
+        fun_l29_n609(x)
+    else
+        fun_l29_n914(x)
+    end
+end
+
+def fun_l28_n694(x)
+    if (x < 1)
+        fun_l29_n563(x)
+    else
+        fun_l29_n215(x)
+    end
+end
+
+def fun_l28_n695(x)
+    if (x < 1)
+        fun_l29_n207(x)
+    else
+        fun_l29_n548(x)
+    end
+end
+
+def fun_l28_n696(x)
+    if (x < 1)
+        fun_l29_n981(x)
+    else
+        fun_l29_n79(x)
+    end
+end
+
+def fun_l28_n697(x)
+    if (x < 1)
+        fun_l29_n747(x)
+    else
+        fun_l29_n687(x)
+    end
+end
+
+def fun_l28_n698(x)
+    if (x < 1)
+        fun_l29_n30(x)
+    else
+        fun_l29_n104(x)
+    end
+end
+
+def fun_l28_n699(x)
+    if (x < 1)
+        fun_l29_n587(x)
+    else
+        fun_l29_n414(x)
+    end
+end
+
+def fun_l28_n700(x)
+    if (x < 1)
+        fun_l29_n956(x)
+    else
+        fun_l29_n601(x)
+    end
+end
+
+def fun_l28_n701(x)
+    if (x < 1)
+        fun_l29_n276(x)
+    else
+        fun_l29_n815(x)
+    end
+end
+
+def fun_l28_n702(x)
+    if (x < 1)
+        fun_l29_n294(x)
+    else
+        fun_l29_n94(x)
+    end
+end
+
+def fun_l28_n703(x)
+    if (x < 1)
+        fun_l29_n161(x)
+    else
+        fun_l29_n133(x)
+    end
+end
+
+def fun_l28_n704(x)
+    if (x < 1)
+        fun_l29_n898(x)
+    else
+        fun_l29_n483(x)
+    end
+end
+
+def fun_l28_n705(x)
+    if (x < 1)
+        fun_l29_n651(x)
+    else
+        fun_l29_n577(x)
+    end
+end
+
+def fun_l28_n706(x)
+    if (x < 1)
+        fun_l29_n389(x)
+    else
+        fun_l29_n595(x)
+    end
+end
+
+def fun_l28_n707(x)
+    if (x < 1)
+        fun_l29_n856(x)
+    else
+        fun_l29_n65(x)
+    end
+end
+
+def fun_l28_n708(x)
+    if (x < 1)
+        fun_l29_n77(x)
+    else
+        fun_l29_n687(x)
+    end
+end
+
+def fun_l28_n709(x)
+    if (x < 1)
+        fun_l29_n962(x)
+    else
+        fun_l29_n517(x)
+    end
+end
+
+def fun_l28_n710(x)
+    if (x < 1)
+        fun_l29_n934(x)
+    else
+        fun_l29_n804(x)
+    end
+end
+
+def fun_l28_n711(x)
+    if (x < 1)
+        fun_l29_n267(x)
+    else
+        fun_l29_n557(x)
+    end
+end
+
+def fun_l28_n712(x)
+    if (x < 1)
+        fun_l29_n691(x)
+    else
+        fun_l29_n558(x)
+    end
+end
+
+def fun_l28_n713(x)
+    if (x < 1)
+        fun_l29_n420(x)
+    else
+        fun_l29_n150(x)
+    end
+end
+
+def fun_l28_n714(x)
+    if (x < 1)
+        fun_l29_n289(x)
+    else
+        fun_l29_n814(x)
+    end
+end
+
+def fun_l28_n715(x)
+    if (x < 1)
+        fun_l29_n579(x)
+    else
+        fun_l29_n730(x)
+    end
+end
+
+def fun_l28_n716(x)
+    if (x < 1)
+        fun_l29_n331(x)
+    else
+        fun_l29_n178(x)
+    end
+end
+
+def fun_l28_n717(x)
+    if (x < 1)
+        fun_l29_n914(x)
+    else
+        fun_l29_n176(x)
+    end
+end
+
+def fun_l28_n718(x)
+    if (x < 1)
+        fun_l29_n261(x)
+    else
+        fun_l29_n203(x)
+    end
+end
+
+def fun_l28_n719(x)
+    if (x < 1)
+        fun_l29_n621(x)
+    else
+        fun_l29_n236(x)
+    end
+end
+
+def fun_l28_n720(x)
+    if (x < 1)
+        fun_l29_n453(x)
+    else
+        fun_l29_n420(x)
+    end
+end
+
+def fun_l28_n721(x)
+    if (x < 1)
+        fun_l29_n39(x)
+    else
+        fun_l29_n499(x)
+    end
+end
+
+def fun_l28_n722(x)
+    if (x < 1)
+        fun_l29_n629(x)
+    else
+        fun_l29_n23(x)
+    end
+end
+
+def fun_l28_n723(x)
+    if (x < 1)
+        fun_l29_n55(x)
+    else
+        fun_l29_n497(x)
+    end
+end
+
+def fun_l28_n724(x)
+    if (x < 1)
+        fun_l29_n934(x)
+    else
+        fun_l29_n891(x)
+    end
+end
+
+def fun_l28_n725(x)
+    if (x < 1)
+        fun_l29_n532(x)
+    else
+        fun_l29_n959(x)
+    end
+end
+
+def fun_l28_n726(x)
+    if (x < 1)
+        fun_l29_n510(x)
+    else
+        fun_l29_n171(x)
+    end
+end
+
+def fun_l28_n727(x)
+    if (x < 1)
+        fun_l29_n42(x)
+    else
+        fun_l29_n680(x)
+    end
+end
+
+def fun_l28_n728(x)
+    if (x < 1)
+        fun_l29_n488(x)
+    else
+        fun_l29_n994(x)
+    end
+end
+
+def fun_l28_n729(x)
+    if (x < 1)
+        fun_l29_n347(x)
+    else
+        fun_l29_n135(x)
+    end
+end
+
+def fun_l28_n730(x)
+    if (x < 1)
+        fun_l29_n97(x)
+    else
+        fun_l29_n176(x)
+    end
+end
+
+def fun_l28_n731(x)
+    if (x < 1)
+        fun_l29_n4(x)
+    else
+        fun_l29_n330(x)
+    end
+end
+
+def fun_l28_n732(x)
+    if (x < 1)
+        fun_l29_n808(x)
+    else
+        fun_l29_n491(x)
+    end
+end
+
+def fun_l28_n733(x)
+    if (x < 1)
+        fun_l29_n147(x)
+    else
+        fun_l29_n520(x)
+    end
+end
+
+def fun_l28_n734(x)
+    if (x < 1)
+        fun_l29_n510(x)
+    else
+        fun_l29_n980(x)
+    end
+end
+
+def fun_l28_n735(x)
+    if (x < 1)
+        fun_l29_n656(x)
+    else
+        fun_l29_n861(x)
+    end
+end
+
+def fun_l28_n736(x)
+    if (x < 1)
+        fun_l29_n445(x)
+    else
+        fun_l29_n625(x)
+    end
+end
+
+def fun_l28_n737(x)
+    if (x < 1)
+        fun_l29_n101(x)
+    else
+        fun_l29_n874(x)
+    end
+end
+
+def fun_l28_n738(x)
+    if (x < 1)
+        fun_l29_n337(x)
+    else
+        fun_l29_n231(x)
+    end
+end
+
+def fun_l28_n739(x)
+    if (x < 1)
+        fun_l29_n518(x)
+    else
+        fun_l29_n575(x)
+    end
+end
+
+def fun_l28_n740(x)
+    if (x < 1)
+        fun_l29_n472(x)
+    else
+        fun_l29_n401(x)
+    end
+end
+
+def fun_l28_n741(x)
+    if (x < 1)
+        fun_l29_n47(x)
+    else
+        fun_l29_n435(x)
+    end
+end
+
+def fun_l28_n742(x)
+    if (x < 1)
+        fun_l29_n113(x)
+    else
+        fun_l29_n56(x)
+    end
+end
+
+def fun_l28_n743(x)
+    if (x < 1)
+        fun_l29_n435(x)
+    else
+        fun_l29_n972(x)
+    end
+end
+
+def fun_l28_n744(x)
+    if (x < 1)
+        fun_l29_n692(x)
+    else
+        fun_l29_n328(x)
+    end
+end
+
+def fun_l28_n745(x)
+    if (x < 1)
+        fun_l29_n830(x)
+    else
+        fun_l29_n92(x)
+    end
+end
+
+def fun_l28_n746(x)
+    if (x < 1)
+        fun_l29_n921(x)
+    else
+        fun_l29_n340(x)
+    end
+end
+
+def fun_l28_n747(x)
+    if (x < 1)
+        fun_l29_n346(x)
+    else
+        fun_l29_n654(x)
+    end
+end
+
+def fun_l28_n748(x)
+    if (x < 1)
+        fun_l29_n850(x)
+    else
+        fun_l29_n40(x)
+    end
+end
+
+def fun_l28_n749(x)
+    if (x < 1)
+        fun_l29_n432(x)
+    else
+        fun_l29_n445(x)
+    end
+end
+
+def fun_l28_n750(x)
+    if (x < 1)
+        fun_l29_n28(x)
+    else
+        fun_l29_n537(x)
+    end
+end
+
+def fun_l28_n751(x)
+    if (x < 1)
+        fun_l29_n858(x)
+    else
+        fun_l29_n375(x)
+    end
+end
+
+def fun_l28_n752(x)
+    if (x < 1)
+        fun_l29_n625(x)
+    else
+        fun_l29_n581(x)
+    end
+end
+
+def fun_l28_n753(x)
+    if (x < 1)
+        fun_l29_n223(x)
+    else
+        fun_l29_n509(x)
+    end
+end
+
+def fun_l28_n754(x)
+    if (x < 1)
+        fun_l29_n655(x)
+    else
+        fun_l29_n218(x)
+    end
+end
+
+def fun_l28_n755(x)
+    if (x < 1)
+        fun_l29_n998(x)
+    else
+        fun_l29_n177(x)
+    end
+end
+
+def fun_l28_n756(x)
+    if (x < 1)
+        fun_l29_n66(x)
+    else
+        fun_l29_n763(x)
+    end
+end
+
+def fun_l28_n757(x)
+    if (x < 1)
+        fun_l29_n112(x)
+    else
+        fun_l29_n494(x)
+    end
+end
+
+def fun_l28_n758(x)
+    if (x < 1)
+        fun_l29_n144(x)
+    else
+        fun_l29_n402(x)
+    end
+end
+
+def fun_l28_n759(x)
+    if (x < 1)
+        fun_l29_n162(x)
+    else
+        fun_l29_n338(x)
+    end
+end
+
+def fun_l28_n760(x)
+    if (x < 1)
+        fun_l29_n975(x)
+    else
+        fun_l29_n431(x)
+    end
+end
+
+def fun_l28_n761(x)
+    if (x < 1)
+        fun_l29_n676(x)
+    else
+        fun_l29_n787(x)
+    end
+end
+
+def fun_l28_n762(x)
+    if (x < 1)
+        fun_l29_n90(x)
+    else
+        fun_l29_n828(x)
+    end
+end
+
+def fun_l28_n763(x)
+    if (x < 1)
+        fun_l29_n816(x)
+    else
+        fun_l29_n119(x)
+    end
+end
+
+def fun_l28_n764(x)
+    if (x < 1)
+        fun_l29_n624(x)
+    else
+        fun_l29_n885(x)
+    end
+end
+
+def fun_l28_n765(x)
+    if (x < 1)
+        fun_l29_n933(x)
+    else
+        fun_l29_n378(x)
+    end
+end
+
+def fun_l28_n766(x)
+    if (x < 1)
+        fun_l29_n967(x)
+    else
+        fun_l29_n580(x)
+    end
+end
+
+def fun_l28_n767(x)
+    if (x < 1)
+        fun_l29_n752(x)
+    else
+        fun_l29_n607(x)
+    end
+end
+
+def fun_l28_n768(x)
+    if (x < 1)
+        fun_l29_n333(x)
+    else
+        fun_l29_n339(x)
+    end
+end
+
+def fun_l28_n769(x)
+    if (x < 1)
+        fun_l29_n720(x)
+    else
+        fun_l29_n952(x)
+    end
+end
+
+def fun_l28_n770(x)
+    if (x < 1)
+        fun_l29_n323(x)
+    else
+        fun_l29_n542(x)
+    end
+end
+
+def fun_l28_n771(x)
+    if (x < 1)
+        fun_l29_n472(x)
+    else
+        fun_l29_n4(x)
+    end
+end
+
+def fun_l28_n772(x)
+    if (x < 1)
+        fun_l29_n962(x)
+    else
+        fun_l29_n345(x)
+    end
+end
+
+def fun_l28_n773(x)
+    if (x < 1)
+        fun_l29_n305(x)
+    else
+        fun_l29_n106(x)
+    end
+end
+
+def fun_l28_n774(x)
+    if (x < 1)
+        fun_l29_n880(x)
+    else
+        fun_l29_n731(x)
+    end
+end
+
+def fun_l28_n775(x)
+    if (x < 1)
+        fun_l29_n760(x)
+    else
+        fun_l29_n460(x)
+    end
+end
+
+def fun_l28_n776(x)
+    if (x < 1)
+        fun_l29_n445(x)
+    else
+        fun_l29_n725(x)
+    end
+end
+
+def fun_l28_n777(x)
+    if (x < 1)
+        fun_l29_n850(x)
+    else
+        fun_l29_n121(x)
+    end
+end
+
+def fun_l28_n778(x)
+    if (x < 1)
+        fun_l29_n270(x)
+    else
+        fun_l29_n85(x)
+    end
+end
+
+def fun_l28_n779(x)
+    if (x < 1)
+        fun_l29_n208(x)
+    else
+        fun_l29_n822(x)
+    end
+end
+
+def fun_l28_n780(x)
+    if (x < 1)
+        fun_l29_n832(x)
+    else
+        fun_l29_n712(x)
+    end
+end
+
+def fun_l28_n781(x)
+    if (x < 1)
+        fun_l29_n456(x)
+    else
+        fun_l29_n947(x)
+    end
+end
+
+def fun_l28_n782(x)
+    if (x < 1)
+        fun_l29_n973(x)
+    else
+        fun_l29_n912(x)
+    end
+end
+
+def fun_l28_n783(x)
+    if (x < 1)
+        fun_l29_n365(x)
+    else
+        fun_l29_n496(x)
+    end
+end
+
+def fun_l28_n784(x)
+    if (x < 1)
+        fun_l29_n717(x)
+    else
+        fun_l29_n157(x)
+    end
+end
+
+def fun_l28_n785(x)
+    if (x < 1)
+        fun_l29_n754(x)
+    else
+        fun_l29_n462(x)
+    end
+end
+
+def fun_l28_n786(x)
+    if (x < 1)
+        fun_l29_n470(x)
+    else
+        fun_l29_n528(x)
+    end
+end
+
+def fun_l28_n787(x)
+    if (x < 1)
+        fun_l29_n463(x)
+    else
+        fun_l29_n107(x)
+    end
+end
+
+def fun_l28_n788(x)
+    if (x < 1)
+        fun_l29_n583(x)
+    else
+        fun_l29_n387(x)
+    end
+end
+
+def fun_l28_n789(x)
+    if (x < 1)
+        fun_l29_n55(x)
+    else
+        fun_l29_n694(x)
+    end
+end
+
+def fun_l28_n790(x)
+    if (x < 1)
+        fun_l29_n834(x)
+    else
+        fun_l29_n306(x)
+    end
+end
+
+def fun_l28_n791(x)
+    if (x < 1)
+        fun_l29_n374(x)
+    else
+        fun_l29_n502(x)
+    end
+end
+
+def fun_l28_n792(x)
+    if (x < 1)
+        fun_l29_n462(x)
+    else
+        fun_l29_n221(x)
+    end
+end
+
+def fun_l28_n793(x)
+    if (x < 1)
+        fun_l29_n680(x)
+    else
+        fun_l29_n966(x)
+    end
+end
+
+def fun_l28_n794(x)
+    if (x < 1)
+        fun_l29_n936(x)
+    else
+        fun_l29_n911(x)
+    end
+end
+
+def fun_l28_n795(x)
+    if (x < 1)
+        fun_l29_n863(x)
+    else
+        fun_l29_n978(x)
+    end
+end
+
+def fun_l28_n796(x)
+    if (x < 1)
+        fun_l29_n1(x)
+    else
+        fun_l29_n399(x)
+    end
+end
+
+def fun_l28_n797(x)
+    if (x < 1)
+        fun_l29_n628(x)
+    else
+        fun_l29_n603(x)
+    end
+end
+
+def fun_l28_n798(x)
+    if (x < 1)
+        fun_l29_n799(x)
+    else
+        fun_l29_n979(x)
+    end
+end
+
+def fun_l28_n799(x)
+    if (x < 1)
+        fun_l29_n856(x)
+    else
+        fun_l29_n946(x)
+    end
+end
+
+def fun_l28_n800(x)
+    if (x < 1)
+        fun_l29_n556(x)
+    else
+        fun_l29_n816(x)
+    end
+end
+
+def fun_l28_n801(x)
+    if (x < 1)
+        fun_l29_n619(x)
+    else
+        fun_l29_n19(x)
+    end
+end
+
+def fun_l28_n802(x)
+    if (x < 1)
+        fun_l29_n143(x)
+    else
+        fun_l29_n287(x)
+    end
+end
+
+def fun_l28_n803(x)
+    if (x < 1)
+        fun_l29_n816(x)
+    else
+        fun_l29_n271(x)
+    end
+end
+
+def fun_l28_n804(x)
+    if (x < 1)
+        fun_l29_n517(x)
+    else
+        fun_l29_n931(x)
+    end
+end
+
+def fun_l28_n805(x)
+    if (x < 1)
+        fun_l29_n298(x)
+    else
+        fun_l29_n509(x)
+    end
+end
+
+def fun_l28_n806(x)
+    if (x < 1)
+        fun_l29_n493(x)
+    else
+        fun_l29_n341(x)
+    end
+end
+
+def fun_l28_n807(x)
+    if (x < 1)
+        fun_l29_n270(x)
+    else
+        fun_l29_n82(x)
+    end
+end
+
+def fun_l28_n808(x)
+    if (x < 1)
+        fun_l29_n980(x)
+    else
+        fun_l29_n771(x)
+    end
+end
+
+def fun_l28_n809(x)
+    if (x < 1)
+        fun_l29_n784(x)
+    else
+        fun_l29_n696(x)
+    end
+end
+
+def fun_l28_n810(x)
+    if (x < 1)
+        fun_l29_n966(x)
+    else
+        fun_l29_n216(x)
+    end
+end
+
+def fun_l28_n811(x)
+    if (x < 1)
+        fun_l29_n374(x)
+    else
+        fun_l29_n482(x)
+    end
+end
+
+def fun_l28_n812(x)
+    if (x < 1)
+        fun_l29_n682(x)
+    else
+        fun_l29_n42(x)
+    end
+end
+
+def fun_l28_n813(x)
+    if (x < 1)
+        fun_l29_n254(x)
+    else
+        fun_l29_n899(x)
+    end
+end
+
+def fun_l28_n814(x)
+    if (x < 1)
+        fun_l29_n115(x)
+    else
+        fun_l29_n336(x)
+    end
+end
+
+def fun_l28_n815(x)
+    if (x < 1)
+        fun_l29_n842(x)
+    else
+        fun_l29_n201(x)
+    end
+end
+
+def fun_l28_n816(x)
+    if (x < 1)
+        fun_l29_n258(x)
+    else
+        fun_l29_n675(x)
+    end
+end
+
+def fun_l28_n817(x)
+    if (x < 1)
+        fun_l29_n594(x)
+    else
+        fun_l29_n61(x)
+    end
+end
+
+def fun_l28_n818(x)
+    if (x < 1)
+        fun_l29_n691(x)
+    else
+        fun_l29_n627(x)
+    end
+end
+
+def fun_l28_n819(x)
+    if (x < 1)
+        fun_l29_n963(x)
+    else
+        fun_l29_n611(x)
+    end
+end
+
+def fun_l28_n820(x)
+    if (x < 1)
+        fun_l29_n455(x)
+    else
+        fun_l29_n829(x)
+    end
+end
+
+def fun_l28_n821(x)
+    if (x < 1)
+        fun_l29_n818(x)
+    else
+        fun_l29_n242(x)
+    end
+end
+
+def fun_l28_n822(x)
+    if (x < 1)
+        fun_l29_n242(x)
+    else
+        fun_l29_n474(x)
+    end
+end
+
+def fun_l28_n823(x)
+    if (x < 1)
+        fun_l29_n847(x)
+    else
+        fun_l29_n119(x)
+    end
+end
+
+def fun_l28_n824(x)
+    if (x < 1)
+        fun_l29_n141(x)
+    else
+        fun_l29_n371(x)
+    end
+end
+
+def fun_l28_n825(x)
+    if (x < 1)
+        fun_l29_n913(x)
+    else
+        fun_l29_n129(x)
+    end
+end
+
+def fun_l28_n826(x)
+    if (x < 1)
+        fun_l29_n440(x)
+    else
+        fun_l29_n860(x)
+    end
+end
+
+def fun_l28_n827(x)
+    if (x < 1)
+        fun_l29_n194(x)
+    else
+        fun_l29_n940(x)
+    end
+end
+
+def fun_l28_n828(x)
+    if (x < 1)
+        fun_l29_n444(x)
+    else
+        fun_l29_n332(x)
+    end
+end
+
+def fun_l28_n829(x)
+    if (x < 1)
+        fun_l29_n435(x)
+    else
+        fun_l29_n559(x)
+    end
+end
+
+def fun_l28_n830(x)
+    if (x < 1)
+        fun_l29_n898(x)
+    else
+        fun_l29_n418(x)
+    end
+end
+
+def fun_l28_n831(x)
+    if (x < 1)
+        fun_l29_n13(x)
+    else
+        fun_l29_n917(x)
+    end
+end
+
+def fun_l28_n832(x)
+    if (x < 1)
+        fun_l29_n705(x)
+    else
+        fun_l29_n738(x)
+    end
+end
+
+def fun_l28_n833(x)
+    if (x < 1)
+        fun_l29_n519(x)
+    else
+        fun_l29_n35(x)
+    end
+end
+
+def fun_l28_n834(x)
+    if (x < 1)
+        fun_l29_n205(x)
+    else
+        fun_l29_n928(x)
+    end
+end
+
+def fun_l28_n835(x)
+    if (x < 1)
+        fun_l29_n401(x)
+    else
+        fun_l29_n191(x)
+    end
+end
+
+def fun_l28_n836(x)
+    if (x < 1)
+        fun_l29_n497(x)
+    else
+        fun_l29_n789(x)
+    end
+end
+
+def fun_l28_n837(x)
+    if (x < 1)
+        fun_l29_n745(x)
+    else
+        fun_l29_n714(x)
+    end
+end
+
+def fun_l28_n838(x)
+    if (x < 1)
+        fun_l29_n885(x)
+    else
+        fun_l29_n845(x)
+    end
+end
+
+def fun_l28_n839(x)
+    if (x < 1)
+        fun_l29_n423(x)
+    else
+        fun_l29_n835(x)
+    end
+end
+
+def fun_l28_n840(x)
+    if (x < 1)
+        fun_l29_n844(x)
+    else
+        fun_l29_n296(x)
+    end
+end
+
+def fun_l28_n841(x)
+    if (x < 1)
+        fun_l29_n980(x)
+    else
+        fun_l29_n298(x)
+    end
+end
+
+def fun_l28_n842(x)
+    if (x < 1)
+        fun_l29_n169(x)
+    else
+        fun_l29_n613(x)
+    end
+end
+
+def fun_l28_n843(x)
+    if (x < 1)
+        fun_l29_n323(x)
+    else
+        fun_l29_n437(x)
+    end
+end
+
+def fun_l28_n844(x)
+    if (x < 1)
+        fun_l29_n532(x)
+    else
+        fun_l29_n841(x)
+    end
+end
+
+def fun_l28_n845(x)
+    if (x < 1)
+        fun_l29_n984(x)
+    else
+        fun_l29_n696(x)
+    end
+end
+
+def fun_l28_n846(x)
+    if (x < 1)
+        fun_l29_n474(x)
+    else
+        fun_l29_n346(x)
+    end
+end
+
+def fun_l28_n847(x)
+    if (x < 1)
+        fun_l29_n725(x)
+    else
+        fun_l29_n994(x)
+    end
+end
+
+def fun_l28_n848(x)
+    if (x < 1)
+        fun_l29_n650(x)
+    else
+        fun_l29_n920(x)
+    end
+end
+
+def fun_l28_n849(x)
+    if (x < 1)
+        fun_l29_n626(x)
+    else
+        fun_l29_n704(x)
+    end
+end
+
+def fun_l28_n850(x)
+    if (x < 1)
+        fun_l29_n506(x)
+    else
+        fun_l29_n440(x)
+    end
+end
+
+def fun_l28_n851(x)
+    if (x < 1)
+        fun_l29_n512(x)
+    else
+        fun_l29_n811(x)
+    end
+end
+
+def fun_l28_n852(x)
+    if (x < 1)
+        fun_l29_n763(x)
+    else
+        fun_l29_n986(x)
+    end
+end
+
+def fun_l28_n853(x)
+    if (x < 1)
+        fun_l29_n866(x)
+    else
+        fun_l29_n972(x)
+    end
+end
+
+def fun_l28_n854(x)
+    if (x < 1)
+        fun_l29_n71(x)
+    else
+        fun_l29_n347(x)
+    end
+end
+
+def fun_l28_n855(x)
+    if (x < 1)
+        fun_l29_n380(x)
+    else
+        fun_l29_n809(x)
+    end
+end
+
+def fun_l28_n856(x)
+    if (x < 1)
+        fun_l29_n802(x)
+    else
+        fun_l29_n13(x)
+    end
+end
+
+def fun_l28_n857(x)
+    if (x < 1)
+        fun_l29_n631(x)
+    else
+        fun_l29_n636(x)
+    end
+end
+
+def fun_l28_n858(x)
+    if (x < 1)
+        fun_l29_n542(x)
+    else
+        fun_l29_n166(x)
+    end
+end
+
+def fun_l28_n859(x)
+    if (x < 1)
+        fun_l29_n393(x)
+    else
+        fun_l29_n317(x)
+    end
+end
+
+def fun_l28_n860(x)
+    if (x < 1)
+        fun_l29_n833(x)
+    else
+        fun_l29_n424(x)
+    end
+end
+
+def fun_l28_n861(x)
+    if (x < 1)
+        fun_l29_n62(x)
+    else
+        fun_l29_n78(x)
+    end
+end
+
+def fun_l28_n862(x)
+    if (x < 1)
+        fun_l29_n145(x)
+    else
+        fun_l29_n322(x)
+    end
+end
+
+def fun_l28_n863(x)
+    if (x < 1)
+        fun_l29_n733(x)
+    else
+        fun_l29_n171(x)
+    end
+end
+
+def fun_l28_n864(x)
+    if (x < 1)
+        fun_l29_n35(x)
+    else
+        fun_l29_n626(x)
+    end
+end
+
+def fun_l28_n865(x)
+    if (x < 1)
+        fun_l29_n356(x)
+    else
+        fun_l29_n832(x)
+    end
+end
+
+def fun_l28_n866(x)
+    if (x < 1)
+        fun_l29_n823(x)
+    else
+        fun_l29_n480(x)
+    end
+end
+
+def fun_l28_n867(x)
+    if (x < 1)
+        fun_l29_n397(x)
+    else
+        fun_l29_n245(x)
+    end
+end
+
+def fun_l28_n868(x)
+    if (x < 1)
+        fun_l29_n403(x)
+    else
+        fun_l29_n682(x)
+    end
+end
+
+def fun_l28_n869(x)
+    if (x < 1)
+        fun_l29_n481(x)
+    else
+        fun_l29_n543(x)
+    end
+end
+
+def fun_l28_n870(x)
+    if (x < 1)
+        fun_l29_n759(x)
+    else
+        fun_l29_n281(x)
+    end
+end
+
+def fun_l28_n871(x)
+    if (x < 1)
+        fun_l29_n671(x)
+    else
+        fun_l29_n644(x)
+    end
+end
+
+def fun_l28_n872(x)
+    if (x < 1)
+        fun_l29_n210(x)
+    else
+        fun_l29_n76(x)
+    end
+end
+
+def fun_l28_n873(x)
+    if (x < 1)
+        fun_l29_n823(x)
+    else
+        fun_l29_n461(x)
+    end
+end
+
+def fun_l28_n874(x)
+    if (x < 1)
+        fun_l29_n269(x)
+    else
+        fun_l29_n368(x)
+    end
+end
+
+def fun_l28_n875(x)
+    if (x < 1)
+        fun_l29_n727(x)
+    else
+        fun_l29_n37(x)
+    end
+end
+
+def fun_l28_n876(x)
+    if (x < 1)
+        fun_l29_n670(x)
+    else
+        fun_l29_n389(x)
+    end
+end
+
+def fun_l28_n877(x)
+    if (x < 1)
+        fun_l29_n844(x)
+    else
+        fun_l29_n424(x)
+    end
+end
+
+def fun_l28_n878(x)
+    if (x < 1)
+        fun_l29_n612(x)
+    else
+        fun_l29_n201(x)
+    end
+end
+
+def fun_l28_n879(x)
+    if (x < 1)
+        fun_l29_n790(x)
+    else
+        fun_l29_n270(x)
+    end
+end
+
+def fun_l28_n880(x)
+    if (x < 1)
+        fun_l29_n976(x)
+    else
+        fun_l29_n362(x)
+    end
+end
+
+def fun_l28_n881(x)
+    if (x < 1)
+        fun_l29_n701(x)
+    else
+        fun_l29_n846(x)
+    end
+end
+
+def fun_l28_n882(x)
+    if (x < 1)
+        fun_l29_n354(x)
+    else
+        fun_l29_n803(x)
+    end
+end
+
+def fun_l28_n883(x)
+    if (x < 1)
+        fun_l29_n40(x)
+    else
+        fun_l29_n168(x)
+    end
+end
+
+def fun_l28_n884(x)
+    if (x < 1)
+        fun_l29_n471(x)
+    else
+        fun_l29_n15(x)
+    end
+end
+
+def fun_l28_n885(x)
+    if (x < 1)
+        fun_l29_n87(x)
+    else
+        fun_l29_n287(x)
+    end
+end
+
+def fun_l28_n886(x)
+    if (x < 1)
+        fun_l29_n659(x)
+    else
+        fun_l29_n623(x)
+    end
+end
+
+def fun_l28_n887(x)
+    if (x < 1)
+        fun_l29_n318(x)
+    else
+        fun_l29_n377(x)
+    end
+end
+
+def fun_l28_n888(x)
+    if (x < 1)
+        fun_l29_n996(x)
+    else
+        fun_l29_n393(x)
+    end
+end
+
+def fun_l28_n889(x)
+    if (x < 1)
+        fun_l29_n999(x)
+    else
+        fun_l29_n370(x)
+    end
+end
+
+def fun_l28_n890(x)
+    if (x < 1)
+        fun_l29_n900(x)
+    else
+        fun_l29_n902(x)
+    end
+end
+
+def fun_l28_n891(x)
+    if (x < 1)
+        fun_l29_n180(x)
+    else
+        fun_l29_n477(x)
+    end
+end
+
+def fun_l28_n892(x)
+    if (x < 1)
+        fun_l29_n254(x)
+    else
+        fun_l29_n762(x)
+    end
+end
+
+def fun_l28_n893(x)
+    if (x < 1)
+        fun_l29_n36(x)
+    else
+        fun_l29_n198(x)
+    end
+end
+
+def fun_l28_n894(x)
+    if (x < 1)
+        fun_l29_n811(x)
+    else
+        fun_l29_n667(x)
+    end
+end
+
+def fun_l28_n895(x)
+    if (x < 1)
+        fun_l29_n711(x)
+    else
+        fun_l29_n462(x)
+    end
+end
+
+def fun_l28_n896(x)
+    if (x < 1)
+        fun_l29_n535(x)
+    else
+        fun_l29_n759(x)
+    end
+end
+
+def fun_l28_n897(x)
+    if (x < 1)
+        fun_l29_n336(x)
+    else
+        fun_l29_n72(x)
+    end
+end
+
+def fun_l28_n898(x)
+    if (x < 1)
+        fun_l29_n556(x)
+    else
+        fun_l29_n324(x)
+    end
+end
+
+def fun_l28_n899(x)
+    if (x < 1)
+        fun_l29_n821(x)
+    else
+        fun_l29_n520(x)
+    end
+end
+
+def fun_l28_n900(x)
+    if (x < 1)
+        fun_l29_n820(x)
+    else
+        fun_l29_n581(x)
+    end
+end
+
+def fun_l28_n901(x)
+    if (x < 1)
+        fun_l29_n416(x)
+    else
+        fun_l29_n662(x)
+    end
+end
+
+def fun_l28_n902(x)
+    if (x < 1)
+        fun_l29_n574(x)
+    else
+        fun_l29_n472(x)
+    end
+end
+
+def fun_l28_n903(x)
+    if (x < 1)
+        fun_l29_n140(x)
+    else
+        fun_l29_n608(x)
+    end
+end
+
+def fun_l28_n904(x)
+    if (x < 1)
+        fun_l29_n492(x)
+    else
+        fun_l29_n50(x)
+    end
+end
+
+def fun_l28_n905(x)
+    if (x < 1)
+        fun_l29_n240(x)
+    else
+        fun_l29_n308(x)
+    end
+end
+
+def fun_l28_n906(x)
+    if (x < 1)
+        fun_l29_n400(x)
+    else
+        fun_l29_n560(x)
+    end
+end
+
+def fun_l28_n907(x)
+    if (x < 1)
+        fun_l29_n974(x)
+    else
+        fun_l29_n580(x)
+    end
+end
+
+def fun_l28_n908(x)
+    if (x < 1)
+        fun_l29_n234(x)
+    else
+        fun_l29_n921(x)
+    end
+end
+
+def fun_l28_n909(x)
+    if (x < 1)
+        fun_l29_n712(x)
+    else
+        fun_l29_n861(x)
+    end
+end
+
+def fun_l28_n910(x)
+    if (x < 1)
+        fun_l29_n716(x)
+    else
+        fun_l29_n818(x)
+    end
+end
+
+def fun_l28_n911(x)
+    if (x < 1)
+        fun_l29_n574(x)
+    else
+        fun_l29_n668(x)
+    end
+end
+
+def fun_l28_n912(x)
+    if (x < 1)
+        fun_l29_n259(x)
+    else
+        fun_l29_n573(x)
+    end
+end
+
+def fun_l28_n913(x)
+    if (x < 1)
+        fun_l29_n427(x)
+    else
+        fun_l29_n572(x)
+    end
+end
+
+def fun_l28_n914(x)
+    if (x < 1)
+        fun_l29_n449(x)
+    else
+        fun_l29_n25(x)
+    end
+end
+
+def fun_l28_n915(x)
+    if (x < 1)
+        fun_l29_n234(x)
+    else
+        fun_l29_n391(x)
+    end
+end
+
+def fun_l28_n916(x)
+    if (x < 1)
+        fun_l29_n115(x)
+    else
+        fun_l29_n918(x)
+    end
+end
+
+def fun_l28_n917(x)
+    if (x < 1)
+        fun_l29_n83(x)
+    else
+        fun_l29_n295(x)
+    end
+end
+
+def fun_l28_n918(x)
+    if (x < 1)
+        fun_l29_n917(x)
+    else
+        fun_l29_n542(x)
+    end
+end
+
+def fun_l28_n919(x)
+    if (x < 1)
+        fun_l29_n836(x)
+    else
+        fun_l29_n460(x)
+    end
+end
+
+def fun_l28_n920(x)
+    if (x < 1)
+        fun_l29_n333(x)
+    else
+        fun_l29_n622(x)
+    end
+end
+
+def fun_l28_n921(x)
+    if (x < 1)
+        fun_l29_n717(x)
+    else
+        fun_l29_n342(x)
+    end
+end
+
+def fun_l28_n922(x)
+    if (x < 1)
+        fun_l29_n670(x)
+    else
+        fun_l29_n735(x)
+    end
+end
+
+def fun_l28_n923(x)
+    if (x < 1)
+        fun_l29_n723(x)
+    else
+        fun_l29_n994(x)
+    end
+end
+
+def fun_l28_n924(x)
+    if (x < 1)
+        fun_l29_n477(x)
+    else
+        fun_l29_n234(x)
+    end
+end
+
+def fun_l28_n925(x)
+    if (x < 1)
+        fun_l29_n514(x)
+    else
+        fun_l29_n194(x)
+    end
+end
+
+def fun_l28_n926(x)
+    if (x < 1)
+        fun_l29_n33(x)
+    else
+        fun_l29_n149(x)
+    end
+end
+
+def fun_l28_n927(x)
+    if (x < 1)
+        fun_l29_n805(x)
+    else
+        fun_l29_n9(x)
+    end
+end
+
+def fun_l28_n928(x)
+    if (x < 1)
+        fun_l29_n351(x)
+    else
+        fun_l29_n250(x)
+    end
+end
+
+def fun_l28_n929(x)
+    if (x < 1)
+        fun_l29_n22(x)
+    else
+        fun_l29_n294(x)
+    end
+end
+
+def fun_l28_n930(x)
+    if (x < 1)
+        fun_l29_n456(x)
+    else
+        fun_l29_n194(x)
+    end
+end
+
+def fun_l28_n931(x)
+    if (x < 1)
+        fun_l29_n354(x)
+    else
+        fun_l29_n341(x)
+    end
+end
+
+def fun_l28_n932(x)
+    if (x < 1)
+        fun_l29_n782(x)
+    else
+        fun_l29_n159(x)
+    end
+end
+
+def fun_l28_n933(x)
+    if (x < 1)
+        fun_l29_n636(x)
+    else
+        fun_l29_n588(x)
+    end
+end
+
+def fun_l28_n934(x)
+    if (x < 1)
+        fun_l29_n473(x)
+    else
+        fun_l29_n527(x)
+    end
+end
+
+def fun_l28_n935(x)
+    if (x < 1)
+        fun_l29_n776(x)
+    else
+        fun_l29_n349(x)
+    end
+end
+
+def fun_l28_n936(x)
+    if (x < 1)
+        fun_l29_n786(x)
+    else
+        fun_l29_n95(x)
+    end
+end
+
+def fun_l28_n937(x)
+    if (x < 1)
+        fun_l29_n276(x)
+    else
+        fun_l29_n952(x)
+    end
+end
+
+def fun_l28_n938(x)
+    if (x < 1)
+        fun_l29_n826(x)
+    else
+        fun_l29_n183(x)
+    end
+end
+
+def fun_l28_n939(x)
+    if (x < 1)
+        fun_l29_n11(x)
+    else
+        fun_l29_n775(x)
+    end
+end
+
+def fun_l28_n940(x)
+    if (x < 1)
+        fun_l29_n161(x)
+    else
+        fun_l29_n255(x)
+    end
+end
+
+def fun_l28_n941(x)
+    if (x < 1)
+        fun_l29_n77(x)
+    else
+        fun_l29_n673(x)
+    end
+end
+
+def fun_l28_n942(x)
+    if (x < 1)
+        fun_l29_n659(x)
+    else
+        fun_l29_n413(x)
+    end
+end
+
+def fun_l28_n943(x)
+    if (x < 1)
+        fun_l29_n827(x)
+    else
+        fun_l29_n262(x)
+    end
+end
+
+def fun_l28_n944(x)
+    if (x < 1)
+        fun_l29_n720(x)
+    else
+        fun_l29_n476(x)
+    end
+end
+
+def fun_l28_n945(x)
+    if (x < 1)
+        fun_l29_n457(x)
+    else
+        fun_l29_n613(x)
+    end
+end
+
+def fun_l28_n946(x)
+    if (x < 1)
+        fun_l29_n137(x)
+    else
+        fun_l29_n763(x)
+    end
+end
+
+def fun_l28_n947(x)
+    if (x < 1)
+        fun_l29_n569(x)
+    else
+        fun_l29_n331(x)
+    end
+end
+
+def fun_l28_n948(x)
+    if (x < 1)
+        fun_l29_n687(x)
+    else
+        fun_l29_n684(x)
+    end
+end
+
+def fun_l28_n949(x)
+    if (x < 1)
+        fun_l29_n532(x)
+    else
+        fun_l29_n203(x)
+    end
+end
+
+def fun_l28_n950(x)
+    if (x < 1)
+        fun_l29_n211(x)
+    else
+        fun_l29_n606(x)
+    end
+end
+
+def fun_l28_n951(x)
+    if (x < 1)
+        fun_l29_n522(x)
+    else
+        fun_l29_n907(x)
+    end
+end
+
+def fun_l28_n952(x)
+    if (x < 1)
+        fun_l29_n64(x)
+    else
+        fun_l29_n742(x)
+    end
+end
+
+def fun_l28_n953(x)
+    if (x < 1)
+        fun_l29_n28(x)
+    else
+        fun_l29_n712(x)
+    end
+end
+
+def fun_l28_n954(x)
+    if (x < 1)
+        fun_l29_n177(x)
+    else
+        fun_l29_n327(x)
+    end
+end
+
+def fun_l28_n955(x)
+    if (x < 1)
+        fun_l29_n274(x)
+    else
+        fun_l29_n830(x)
+    end
+end
+
+def fun_l28_n956(x)
+    if (x < 1)
+        fun_l29_n709(x)
+    else
+        fun_l29_n115(x)
+    end
+end
+
+def fun_l28_n957(x)
+    if (x < 1)
+        fun_l29_n72(x)
+    else
+        fun_l29_n849(x)
+    end
+end
+
+def fun_l28_n958(x)
+    if (x < 1)
+        fun_l29_n347(x)
+    else
+        fun_l29_n317(x)
+    end
+end
+
+def fun_l28_n959(x)
+    if (x < 1)
+        fun_l29_n540(x)
+    else
+        fun_l29_n226(x)
+    end
+end
+
+def fun_l28_n960(x)
+    if (x < 1)
+        fun_l29_n383(x)
+    else
+        fun_l29_n634(x)
+    end
+end
+
+def fun_l28_n961(x)
+    if (x < 1)
+        fun_l29_n616(x)
+    else
+        fun_l29_n300(x)
+    end
+end
+
+def fun_l28_n962(x)
+    if (x < 1)
+        fun_l29_n955(x)
+    else
+        fun_l29_n861(x)
+    end
+end
+
+def fun_l28_n963(x)
+    if (x < 1)
+        fun_l29_n143(x)
+    else
+        fun_l29_n106(x)
+    end
+end
+
+def fun_l28_n964(x)
+    if (x < 1)
+        fun_l29_n883(x)
+    else
+        fun_l29_n997(x)
+    end
+end
+
+def fun_l28_n965(x)
+    if (x < 1)
+        fun_l29_n247(x)
+    else
+        fun_l29_n471(x)
+    end
+end
+
+def fun_l28_n966(x)
+    if (x < 1)
+        fun_l29_n237(x)
+    else
+        fun_l29_n107(x)
+    end
+end
+
+def fun_l28_n967(x)
+    if (x < 1)
+        fun_l29_n754(x)
+    else
+        fun_l29_n996(x)
+    end
+end
+
+def fun_l28_n968(x)
+    if (x < 1)
+        fun_l29_n951(x)
+    else
+        fun_l29_n216(x)
+    end
+end
+
+def fun_l28_n969(x)
+    if (x < 1)
+        fun_l29_n36(x)
+    else
+        fun_l29_n815(x)
+    end
+end
+
+def fun_l28_n970(x)
+    if (x < 1)
+        fun_l29_n362(x)
+    else
+        fun_l29_n27(x)
+    end
+end
+
+def fun_l28_n971(x)
+    if (x < 1)
+        fun_l29_n837(x)
+    else
+        fun_l29_n230(x)
+    end
+end
+
+def fun_l28_n972(x)
+    if (x < 1)
+        fun_l29_n295(x)
+    else
+        fun_l29_n772(x)
+    end
+end
+
+def fun_l28_n973(x)
+    if (x < 1)
+        fun_l29_n570(x)
+    else
+        fun_l29_n514(x)
+    end
+end
+
+def fun_l28_n974(x)
+    if (x < 1)
+        fun_l29_n151(x)
+    else
+        fun_l29_n368(x)
+    end
+end
+
+def fun_l28_n975(x)
+    if (x < 1)
+        fun_l29_n229(x)
+    else
+        fun_l29_n408(x)
+    end
+end
+
+def fun_l28_n976(x)
+    if (x < 1)
+        fun_l29_n209(x)
+    else
+        fun_l29_n513(x)
+    end
+end
+
+def fun_l28_n977(x)
+    if (x < 1)
+        fun_l29_n753(x)
+    else
+        fun_l29_n36(x)
+    end
+end
+
+def fun_l28_n978(x)
+    if (x < 1)
+        fun_l29_n887(x)
+    else
+        fun_l29_n330(x)
+    end
+end
+
+def fun_l28_n979(x)
+    if (x < 1)
+        fun_l29_n880(x)
+    else
+        fun_l29_n6(x)
+    end
+end
+
+def fun_l28_n980(x)
+    if (x < 1)
+        fun_l29_n953(x)
+    else
+        fun_l29_n573(x)
+    end
+end
+
+def fun_l28_n981(x)
+    if (x < 1)
+        fun_l29_n960(x)
+    else
+        fun_l29_n774(x)
+    end
+end
+
+def fun_l28_n982(x)
+    if (x < 1)
+        fun_l29_n769(x)
+    else
+        fun_l29_n43(x)
+    end
+end
+
+def fun_l28_n983(x)
+    if (x < 1)
+        fun_l29_n43(x)
+    else
+        fun_l29_n168(x)
+    end
+end
+
+def fun_l28_n984(x)
+    if (x < 1)
+        fun_l29_n70(x)
+    else
+        fun_l29_n695(x)
+    end
+end
+
+def fun_l28_n985(x)
+    if (x < 1)
+        fun_l29_n421(x)
+    else
+        fun_l29_n9(x)
+    end
+end
+
+def fun_l28_n986(x)
+    if (x < 1)
+        fun_l29_n588(x)
+    else
+        fun_l29_n916(x)
+    end
+end
+
+def fun_l28_n987(x)
+    if (x < 1)
+        fun_l29_n693(x)
+    else
+        fun_l29_n979(x)
+    end
+end
+
+def fun_l28_n988(x)
+    if (x < 1)
+        fun_l29_n684(x)
+    else
+        fun_l29_n342(x)
+    end
+end
+
+def fun_l28_n989(x)
+    if (x < 1)
+        fun_l29_n148(x)
+    else
+        fun_l29_n348(x)
+    end
+end
+
+def fun_l28_n990(x)
+    if (x < 1)
+        fun_l29_n740(x)
+    else
+        fun_l29_n120(x)
+    end
+end
+
+def fun_l28_n991(x)
+    if (x < 1)
+        fun_l29_n258(x)
+    else
+        fun_l29_n670(x)
+    end
+end
+
+def fun_l28_n992(x)
+    if (x < 1)
+        fun_l29_n514(x)
+    else
+        fun_l29_n198(x)
+    end
+end
+
+def fun_l28_n993(x)
+    if (x < 1)
+        fun_l29_n563(x)
+    else
+        fun_l29_n174(x)
+    end
+end
+
+def fun_l28_n994(x)
+    if (x < 1)
+        fun_l29_n391(x)
+    else
+        fun_l29_n689(x)
+    end
+end
+
+def fun_l28_n995(x)
+    if (x < 1)
+        fun_l29_n156(x)
+    else
+        fun_l29_n579(x)
+    end
+end
+
+def fun_l28_n996(x)
+    if (x < 1)
+        fun_l29_n411(x)
+    else
+        fun_l29_n212(x)
+    end
+end
+
+def fun_l28_n997(x)
+    if (x < 1)
+        fun_l29_n709(x)
+    else
+        fun_l29_n735(x)
+    end
+end
+
+def fun_l28_n998(x)
+    if (x < 1)
+        fun_l29_n960(x)
+    else
+        fun_l29_n813(x)
+    end
+end
+
+def fun_l28_n999(x)
+    if (x < 1)
+        fun_l29_n553(x)
+    else
+        fun_l29_n875(x)
+    end
+end
+
+def fun_l29_n0(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n1(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n2(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n3(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n4(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n5(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n6(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n7(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n8(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n9(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n10(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n11(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n12(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n13(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n14(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n15(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n16(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n17(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n18(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n19(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n20(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n21(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n22(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n23(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n24(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n25(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n26(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n27(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n28(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n29(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n30(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n31(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n32(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n33(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n34(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n35(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n36(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n37(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n38(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n39(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n40(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n41(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n42(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n43(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n44(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n45(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n46(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n47(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n48(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n49(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n50(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n51(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n52(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n53(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n54(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n55(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n56(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n57(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n58(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n59(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n60(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n61(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n62(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n63(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n64(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n65(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n66(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n67(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n68(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n69(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n70(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n71(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n72(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n73(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n74(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n75(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n76(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n77(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n78(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n79(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n80(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n81(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n82(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n83(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n84(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n85(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n86(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n87(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n88(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n89(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n90(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n91(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n92(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n93(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n94(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n95(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n96(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n97(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n98(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n99(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n100(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n101(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n102(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n103(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n104(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n105(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n106(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n107(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n108(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n109(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n110(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n111(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n112(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n113(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n114(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n115(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n116(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n117(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n118(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n119(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n120(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n121(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n122(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n123(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n124(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n125(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n126(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n127(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n128(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n129(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n130(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n131(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n132(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n133(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n134(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n135(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n136(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n137(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n138(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n139(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n140(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n141(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n142(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n143(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n144(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n145(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n146(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n147(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n148(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n149(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n150(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n151(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n152(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n153(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n154(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n155(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n156(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n157(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n158(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n159(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n160(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n161(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n162(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n163(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n164(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n165(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n166(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n167(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n168(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n169(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n170(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n171(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n172(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n173(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n174(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n175(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n176(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n177(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n178(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n179(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n180(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n181(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n182(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n183(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n184(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n185(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n186(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n187(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n188(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n189(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n190(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n191(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n192(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n193(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n194(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n195(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n196(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n197(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n198(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n199(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n200(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n201(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n202(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n203(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n204(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n205(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n206(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n207(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n208(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n209(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n210(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n211(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n212(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n213(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n214(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n215(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n216(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n217(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n218(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n219(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n220(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n221(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n222(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n223(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n224(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n225(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n226(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n227(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n228(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n229(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n230(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n231(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n232(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n233(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n234(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n235(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n236(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n237(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n238(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n239(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n240(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n241(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n242(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n243(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n244(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n245(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n246(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n247(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n248(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n249(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n250(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n251(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n252(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n253(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n254(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n255(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n256(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n257(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n258(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n259(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n260(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n261(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n262(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n263(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n264(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n265(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n266(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n267(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n268(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n269(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n270(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n271(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n272(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n273(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n274(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n275(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n276(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n277(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n278(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n279(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n280(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n281(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n282(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n283(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n284(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n285(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n286(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n287(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n288(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n289(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n290(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n291(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n292(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n293(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n294(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n295(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n296(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n297(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n298(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n299(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n300(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n301(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n302(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n303(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n304(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n305(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n306(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n307(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n308(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n309(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n310(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n311(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n312(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n313(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n314(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n315(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n316(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n317(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n318(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n319(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n320(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n321(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n322(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n323(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n324(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n325(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n326(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n327(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n328(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n329(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n330(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n331(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n332(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n333(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n334(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n335(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n336(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n337(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n338(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n339(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n340(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n341(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n342(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n343(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n344(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n345(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n346(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n347(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n348(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n349(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n350(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n351(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n352(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n353(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n354(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n355(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n356(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n357(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n358(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n359(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n360(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n361(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n362(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n363(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n364(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n365(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n366(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n367(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n368(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n369(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n370(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n371(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n372(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n373(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n374(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n375(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n376(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n377(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n378(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n379(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n380(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n381(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n382(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n383(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n384(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n385(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n386(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n387(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n388(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n389(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n390(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n391(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n392(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n393(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n394(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n395(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n396(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n397(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n398(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n399(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n400(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n401(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n402(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n403(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n404(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n405(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n406(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n407(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n408(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n409(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n410(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n411(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n412(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n413(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n414(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n415(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n416(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n417(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n418(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n419(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n420(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n421(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n422(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n423(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n424(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n425(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n426(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n427(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n428(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n429(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n430(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n431(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n432(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n433(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n434(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n435(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n436(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n437(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n438(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n439(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n440(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n441(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n442(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n443(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n444(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n445(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n446(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n447(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n448(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n449(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n450(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n451(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n452(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n453(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n454(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n455(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n456(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n457(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n458(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n459(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n460(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n461(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n462(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n463(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n464(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n465(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n466(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n467(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n468(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n469(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n470(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n471(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n472(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n473(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n474(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n475(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n476(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n477(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n478(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n479(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n480(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n481(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n482(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n483(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n484(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n485(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n486(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n487(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n488(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n489(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n490(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n491(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n492(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n493(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n494(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n495(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n496(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n497(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n498(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n499(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n500(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n501(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n502(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n503(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n504(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n505(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n506(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n507(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n508(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n509(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n510(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n511(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n512(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n513(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n514(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n515(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n516(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n517(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n518(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n519(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n520(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n521(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n522(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n523(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n524(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n525(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n526(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n527(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n528(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n529(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n530(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n531(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n532(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n533(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n534(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n535(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n536(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n537(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n538(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n539(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n540(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n541(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n542(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n543(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n544(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n545(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n546(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n547(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n548(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n549(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n550(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n551(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n552(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n553(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n554(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n555(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n556(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n557(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n558(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n559(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n560(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n561(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n562(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n563(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n564(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n565(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n566(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n567(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n568(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n569(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n570(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n571(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n572(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n573(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n574(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n575(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n576(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n577(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n578(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n579(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n580(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n581(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n582(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n583(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n584(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n585(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n586(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n587(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n588(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n589(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n590(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n591(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n592(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n593(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n594(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n595(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n596(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n597(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n598(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n599(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n600(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n601(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n602(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n603(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n604(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n605(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n606(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n607(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n608(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n609(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n610(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n611(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n612(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n613(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n614(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n615(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n616(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n617(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n618(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n619(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n620(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n621(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n622(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n623(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n624(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n625(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n626(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n627(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n628(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n629(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n630(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n631(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n632(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n633(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n634(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n635(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n636(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n637(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n638(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n639(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n640(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n641(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n642(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n643(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n644(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n645(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n646(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n647(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n648(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n649(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n650(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n651(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n652(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n653(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n654(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n655(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n656(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n657(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n658(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n659(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n660(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n661(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n662(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n663(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n664(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n665(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n666(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n667(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n668(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n669(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n670(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n671(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n672(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n673(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n674(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n675(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n676(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n677(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n678(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n679(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n680(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n681(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n682(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n683(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n684(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n685(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n686(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n687(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n688(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n689(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n690(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n691(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n692(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n693(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n694(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n695(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n696(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n697(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n698(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n699(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n700(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n701(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n702(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n703(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n704(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n705(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n706(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n707(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n708(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n709(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n710(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n711(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n712(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n713(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n714(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n715(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n716(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n717(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n718(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n719(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n720(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n721(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n722(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n723(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n724(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n725(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n726(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n727(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n728(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n729(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n730(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n731(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n732(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n733(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n734(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n735(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n736(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n737(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n738(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n739(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n740(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n741(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n742(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n743(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n744(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n745(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n746(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n747(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n748(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n749(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n750(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n751(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n752(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n753(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n754(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n755(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n756(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n757(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n758(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n759(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n760(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n761(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n762(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n763(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n764(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n765(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n766(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n767(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n768(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n769(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n770(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n771(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n772(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n773(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n774(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n775(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n776(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n777(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n778(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n779(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n780(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n781(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n782(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n783(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n784(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n785(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n786(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n787(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n788(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n789(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n790(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n791(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n792(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n793(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n794(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n795(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n796(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n797(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n798(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n799(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n800(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n801(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n802(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n803(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n804(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n805(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n806(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n807(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n808(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n809(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n810(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n811(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n812(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n813(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n814(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n815(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n816(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n817(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n818(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n819(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n820(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n821(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n822(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n823(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n824(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n825(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n826(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n827(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n828(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n829(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n830(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n831(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n832(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n833(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n834(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n835(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n836(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n837(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n838(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n839(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n840(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n841(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n842(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n843(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n844(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n845(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n846(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n847(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n848(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n849(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n850(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n851(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n852(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n853(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n854(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n855(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n856(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n857(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n858(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n859(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n860(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n861(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n862(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n863(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n864(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n865(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n866(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n867(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n868(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n869(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n870(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n871(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n872(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n873(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n874(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n875(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n876(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n877(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n878(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n879(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n880(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n881(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n882(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n883(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n884(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n885(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n886(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n887(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n888(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n889(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n890(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n891(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n892(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n893(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n894(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n895(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n896(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n897(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n898(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n899(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n900(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n901(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n902(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n903(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n904(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n905(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n906(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n907(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n908(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n909(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n910(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n911(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n912(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n913(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n914(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n915(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n916(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n917(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n918(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n919(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n920(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n921(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n922(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n923(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n924(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n925(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n926(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n927(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n928(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n929(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n930(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n931(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n932(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n933(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n934(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n935(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n936(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n937(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n938(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n939(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n940(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n941(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n942(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n943(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n944(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n945(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n946(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n947(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n948(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n949(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n950(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n951(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n952(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n953(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n954(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n955(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n956(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n957(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n958(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n959(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n960(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n961(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n962(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n963(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n964(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n965(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n966(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n967(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n968(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n969(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n970(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n971(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n972(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n973(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n974(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n975(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n976(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n977(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n978(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n979(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n980(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n981(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n982(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n983(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n984(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n985(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n986(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n987(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n988(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n989(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n990(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n991(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n992(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n993(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n994(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n995(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n996(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n997(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n998(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+def fun_l29_n999(x)
+    if (x < 1)
+        inc(x)
+    else
+        inc(x)
+    end
+end
+
+@a = 0
+@b = 0
+@c = 0
+@d = 0
+
+@count = 0
+def inc(x)
+    @count += 1
+end
+
+@x = 0
+
+100.times do
+    @x = (@x < 1)? 1:0
+    fun_l0_n0(@x)
+    fun_l0_n1(@x)
+    fun_l0_n2(@x)
+    fun_l0_n3(@x)
+    fun_l0_n4(@x)
+    fun_l0_n5(@x)
+    fun_l0_n6(@x)
+    fun_l0_n7(@x)
+    fun_l0_n8(@x)
+    fun_l0_n9(@x)
+    fun_l0_n10(@x)
+    fun_l0_n11(@x)
+    fun_l0_n12(@x)
+    fun_l0_n13(@x)
+    fun_l0_n14(@x)
+    fun_l0_n15(@x)
+    fun_l0_n16(@x)
+    fun_l0_n17(@x)
+    fun_l0_n18(@x)
+    fun_l0_n19(@x)
+    fun_l0_n20(@x)
+    fun_l0_n21(@x)
+    fun_l0_n22(@x)
+    fun_l0_n23(@x)
+    fun_l0_n24(@x)
+    fun_l0_n25(@x)
+    fun_l0_n26(@x)
+    fun_l0_n27(@x)
+    fun_l0_n28(@x)
+    fun_l0_n29(@x)
+    fun_l0_n30(@x)
+    fun_l0_n31(@x)
+    fun_l0_n32(@x)
+    fun_l0_n33(@x)
+    fun_l0_n34(@x)
+    fun_l0_n35(@x)
+    fun_l0_n36(@x)
+    fun_l0_n37(@x)
+    fun_l0_n38(@x)
+    fun_l0_n39(@x)
+    fun_l0_n40(@x)
+    fun_l0_n41(@x)
+    fun_l0_n42(@x)
+    fun_l0_n43(@x)
+    fun_l0_n44(@x)
+    fun_l0_n45(@x)
+    fun_l0_n46(@x)
+    fun_l0_n47(@x)
+    fun_l0_n48(@x)
+    fun_l0_n49(@x)
+    fun_l0_n50(@x)
+    fun_l0_n51(@x)
+    fun_l0_n52(@x)
+    fun_l0_n53(@x)
+    fun_l0_n54(@x)
+    fun_l0_n55(@x)
+    fun_l0_n56(@x)
+    fun_l0_n57(@x)
+    fun_l0_n58(@x)
+    fun_l0_n59(@x)
+    fun_l0_n60(@x)
+    fun_l0_n61(@x)
+    fun_l0_n62(@x)
+    fun_l0_n63(@x)
+    fun_l0_n64(@x)
+    fun_l0_n65(@x)
+    fun_l0_n66(@x)
+    fun_l0_n67(@x)
+    fun_l0_n68(@x)
+    fun_l0_n69(@x)
+    fun_l0_n70(@x)
+    fun_l0_n71(@x)
+    fun_l0_n72(@x)
+    fun_l0_n73(@x)
+    fun_l0_n74(@x)
+    fun_l0_n75(@x)
+    fun_l0_n76(@x)
+    fun_l0_n77(@x)
+    fun_l0_n78(@x)
+    fun_l0_n79(@x)
+    fun_l0_n80(@x)
+    fun_l0_n81(@x)
+    fun_l0_n82(@x)
+    fun_l0_n83(@x)
+    fun_l0_n84(@x)
+    fun_l0_n85(@x)
+    fun_l0_n86(@x)
+    fun_l0_n87(@x)
+    fun_l0_n88(@x)
+    fun_l0_n89(@x)
+    fun_l0_n90(@x)
+    fun_l0_n91(@x)
+    fun_l0_n92(@x)
+    fun_l0_n93(@x)
+    fun_l0_n94(@x)
+    fun_l0_n95(@x)
+    fun_l0_n96(@x)
+    fun_l0_n97(@x)
+    fun_l0_n98(@x)
+    fun_l0_n99(@x)
+    fun_l0_n100(@x)
+    fun_l0_n101(@x)
+    fun_l0_n102(@x)
+    fun_l0_n103(@x)
+    fun_l0_n104(@x)
+    fun_l0_n105(@x)
+    fun_l0_n106(@x)
+    fun_l0_n107(@x)
+    fun_l0_n108(@x)
+    fun_l0_n109(@x)
+    fun_l0_n110(@x)
+    fun_l0_n111(@x)
+    fun_l0_n112(@x)
+    fun_l0_n113(@x)
+    fun_l0_n114(@x)
+    fun_l0_n115(@x)
+    fun_l0_n116(@x)
+    fun_l0_n117(@x)
+    fun_l0_n118(@x)
+    fun_l0_n119(@x)
+    fun_l0_n120(@x)
+    fun_l0_n121(@x)
+    fun_l0_n122(@x)
+    fun_l0_n123(@x)
+    fun_l0_n124(@x)
+    fun_l0_n125(@x)
+    fun_l0_n126(@x)
+    fun_l0_n127(@x)
+    fun_l0_n128(@x)
+    fun_l0_n129(@x)
+    fun_l0_n130(@x)
+    fun_l0_n131(@x)
+    fun_l0_n132(@x)
+    fun_l0_n133(@x)
+    fun_l0_n134(@x)
+    fun_l0_n135(@x)
+    fun_l0_n136(@x)
+    fun_l0_n137(@x)
+    fun_l0_n138(@x)
+    fun_l0_n139(@x)
+    fun_l0_n140(@x)
+    fun_l0_n141(@x)
+    fun_l0_n142(@x)
+    fun_l0_n143(@x)
+    fun_l0_n144(@x)
+    fun_l0_n145(@x)
+    fun_l0_n146(@x)
+    fun_l0_n147(@x)
+    fun_l0_n148(@x)
+    fun_l0_n149(@x)
+    fun_l0_n150(@x)
+    fun_l0_n151(@x)
+    fun_l0_n152(@x)
+    fun_l0_n153(@x)
+    fun_l0_n154(@x)
+    fun_l0_n155(@x)
+    fun_l0_n156(@x)
+    fun_l0_n157(@x)
+    fun_l0_n158(@x)
+    fun_l0_n159(@x)
+    fun_l0_n160(@x)
+    fun_l0_n161(@x)
+    fun_l0_n162(@x)
+    fun_l0_n163(@x)
+    fun_l0_n164(@x)
+    fun_l0_n165(@x)
+    fun_l0_n166(@x)
+    fun_l0_n167(@x)
+    fun_l0_n168(@x)
+    fun_l0_n169(@x)
+    fun_l0_n170(@x)
+    fun_l0_n171(@x)
+    fun_l0_n172(@x)
+    fun_l0_n173(@x)
+    fun_l0_n174(@x)
+    fun_l0_n175(@x)
+    fun_l0_n176(@x)
+    fun_l0_n177(@x)
+    fun_l0_n178(@x)
+    fun_l0_n179(@x)
+    fun_l0_n180(@x)
+    fun_l0_n181(@x)
+    fun_l0_n182(@x)
+    fun_l0_n183(@x)
+    fun_l0_n184(@x)
+    fun_l0_n185(@x)
+    fun_l0_n186(@x)
+    fun_l0_n187(@x)
+    fun_l0_n188(@x)
+    fun_l0_n189(@x)
+    fun_l0_n190(@x)
+    fun_l0_n191(@x)
+    fun_l0_n192(@x)
+    fun_l0_n193(@x)
+    fun_l0_n194(@x)
+    fun_l0_n195(@x)
+    fun_l0_n196(@x)
+    fun_l0_n197(@x)
+    fun_l0_n198(@x)
+    fun_l0_n199(@x)
+    fun_l0_n200(@x)
+    fun_l0_n201(@x)
+    fun_l0_n202(@x)
+    fun_l0_n203(@x)
+    fun_l0_n204(@x)
+    fun_l0_n205(@x)
+    fun_l0_n206(@x)
+    fun_l0_n207(@x)
+    fun_l0_n208(@x)
+    fun_l0_n209(@x)
+    fun_l0_n210(@x)
+    fun_l0_n211(@x)
+    fun_l0_n212(@x)
+    fun_l0_n213(@x)
+    fun_l0_n214(@x)
+    fun_l0_n215(@x)
+    fun_l0_n216(@x)
+    fun_l0_n217(@x)
+    fun_l0_n218(@x)
+    fun_l0_n219(@x)
+    fun_l0_n220(@x)
+    fun_l0_n221(@x)
+    fun_l0_n222(@x)
+    fun_l0_n223(@x)
+    fun_l0_n224(@x)
+    fun_l0_n225(@x)
+    fun_l0_n226(@x)
+    fun_l0_n227(@x)
+    fun_l0_n228(@x)
+    fun_l0_n229(@x)
+    fun_l0_n230(@x)
+    fun_l0_n231(@x)
+    fun_l0_n232(@x)
+    fun_l0_n233(@x)
+    fun_l0_n234(@x)
+    fun_l0_n235(@x)
+    fun_l0_n236(@x)
+    fun_l0_n237(@x)
+    fun_l0_n238(@x)
+    fun_l0_n239(@x)
+    fun_l0_n240(@x)
+    fun_l0_n241(@x)
+    fun_l0_n242(@x)
+    fun_l0_n243(@x)
+    fun_l0_n244(@x)
+    fun_l0_n245(@x)
+    fun_l0_n246(@x)
+    fun_l0_n247(@x)
+    fun_l0_n248(@x)
+    fun_l0_n249(@x)
+    fun_l0_n250(@x)
+    fun_l0_n251(@x)
+    fun_l0_n252(@x)
+    fun_l0_n253(@x)
+    fun_l0_n254(@x)
+    fun_l0_n255(@x)
+    fun_l0_n256(@x)
+    fun_l0_n257(@x)
+    fun_l0_n258(@x)
+    fun_l0_n259(@x)
+    fun_l0_n260(@x)
+    fun_l0_n261(@x)
+    fun_l0_n262(@x)
+    fun_l0_n263(@x)
+    fun_l0_n264(@x)
+    fun_l0_n265(@x)
+    fun_l0_n266(@x)
+    fun_l0_n267(@x)
+    fun_l0_n268(@x)
+    fun_l0_n269(@x)
+    fun_l0_n270(@x)
+    fun_l0_n271(@x)
+    fun_l0_n272(@x)
+    fun_l0_n273(@x)
+    fun_l0_n274(@x)
+    fun_l0_n275(@x)
+    fun_l0_n276(@x)
+    fun_l0_n277(@x)
+    fun_l0_n278(@x)
+    fun_l0_n279(@x)
+    fun_l0_n280(@x)
+    fun_l0_n281(@x)
+    fun_l0_n282(@x)
+    fun_l0_n283(@x)
+    fun_l0_n284(@x)
+    fun_l0_n285(@x)
+    fun_l0_n286(@x)
+    fun_l0_n287(@x)
+    fun_l0_n288(@x)
+    fun_l0_n289(@x)
+    fun_l0_n290(@x)
+    fun_l0_n291(@x)
+    fun_l0_n292(@x)
+    fun_l0_n293(@x)
+    fun_l0_n294(@x)
+    fun_l0_n295(@x)
+    fun_l0_n296(@x)
+    fun_l0_n297(@x)
+    fun_l0_n298(@x)
+    fun_l0_n299(@x)
+    fun_l0_n300(@x)
+    fun_l0_n301(@x)
+    fun_l0_n302(@x)
+    fun_l0_n303(@x)
+    fun_l0_n304(@x)
+    fun_l0_n305(@x)
+    fun_l0_n306(@x)
+    fun_l0_n307(@x)
+    fun_l0_n308(@x)
+    fun_l0_n309(@x)
+    fun_l0_n310(@x)
+    fun_l0_n311(@x)
+    fun_l0_n312(@x)
+    fun_l0_n313(@x)
+    fun_l0_n314(@x)
+    fun_l0_n315(@x)
+    fun_l0_n316(@x)
+    fun_l0_n317(@x)
+    fun_l0_n318(@x)
+    fun_l0_n319(@x)
+    fun_l0_n320(@x)
+    fun_l0_n321(@x)
+    fun_l0_n322(@x)
+    fun_l0_n323(@x)
+    fun_l0_n324(@x)
+    fun_l0_n325(@x)
+    fun_l0_n326(@x)
+    fun_l0_n327(@x)
+    fun_l0_n328(@x)
+    fun_l0_n329(@x)
+    fun_l0_n330(@x)
+    fun_l0_n331(@x)
+    fun_l0_n332(@x)
+    fun_l0_n333(@x)
+    fun_l0_n334(@x)
+    fun_l0_n335(@x)
+    fun_l0_n336(@x)
+    fun_l0_n337(@x)
+    fun_l0_n338(@x)
+    fun_l0_n339(@x)
+    fun_l0_n340(@x)
+    fun_l0_n341(@x)
+    fun_l0_n342(@x)
+    fun_l0_n343(@x)
+    fun_l0_n344(@x)
+    fun_l0_n345(@x)
+    fun_l0_n346(@x)
+    fun_l0_n347(@x)
+    fun_l0_n348(@x)
+    fun_l0_n349(@x)
+    fun_l0_n350(@x)
+    fun_l0_n351(@x)
+    fun_l0_n352(@x)
+    fun_l0_n353(@x)
+    fun_l0_n354(@x)
+    fun_l0_n355(@x)
+    fun_l0_n356(@x)
+    fun_l0_n357(@x)
+    fun_l0_n358(@x)
+    fun_l0_n359(@x)
+    fun_l0_n360(@x)
+    fun_l0_n361(@x)
+    fun_l0_n362(@x)
+    fun_l0_n363(@x)
+    fun_l0_n364(@x)
+    fun_l0_n365(@x)
+    fun_l0_n366(@x)
+    fun_l0_n367(@x)
+    fun_l0_n368(@x)
+    fun_l0_n369(@x)
+    fun_l0_n370(@x)
+    fun_l0_n371(@x)
+    fun_l0_n372(@x)
+    fun_l0_n373(@x)
+    fun_l0_n374(@x)
+    fun_l0_n375(@x)
+    fun_l0_n376(@x)
+    fun_l0_n377(@x)
+    fun_l0_n378(@x)
+    fun_l0_n379(@x)
+    fun_l0_n380(@x)
+    fun_l0_n381(@x)
+    fun_l0_n382(@x)
+    fun_l0_n383(@x)
+    fun_l0_n384(@x)
+    fun_l0_n385(@x)
+    fun_l0_n386(@x)
+    fun_l0_n387(@x)
+    fun_l0_n388(@x)
+    fun_l0_n389(@x)
+    fun_l0_n390(@x)
+    fun_l0_n391(@x)
+    fun_l0_n392(@x)
+    fun_l0_n393(@x)
+    fun_l0_n394(@x)
+    fun_l0_n395(@x)
+    fun_l0_n396(@x)
+    fun_l0_n397(@x)
+    fun_l0_n398(@x)
+    fun_l0_n399(@x)
+    fun_l0_n400(@x)
+    fun_l0_n401(@x)
+    fun_l0_n402(@x)
+    fun_l0_n403(@x)
+    fun_l0_n404(@x)
+    fun_l0_n405(@x)
+    fun_l0_n406(@x)
+    fun_l0_n407(@x)
+    fun_l0_n408(@x)
+    fun_l0_n409(@x)
+    fun_l0_n410(@x)
+    fun_l0_n411(@x)
+    fun_l0_n412(@x)
+    fun_l0_n413(@x)
+    fun_l0_n414(@x)
+    fun_l0_n415(@x)
+    fun_l0_n416(@x)
+    fun_l0_n417(@x)
+    fun_l0_n418(@x)
+    fun_l0_n419(@x)
+    fun_l0_n420(@x)
+    fun_l0_n421(@x)
+    fun_l0_n422(@x)
+    fun_l0_n423(@x)
+    fun_l0_n424(@x)
+    fun_l0_n425(@x)
+    fun_l0_n426(@x)
+    fun_l0_n427(@x)
+    fun_l0_n428(@x)
+    fun_l0_n429(@x)
+    fun_l0_n430(@x)
+    fun_l0_n431(@x)
+    fun_l0_n432(@x)
+    fun_l0_n433(@x)
+    fun_l0_n434(@x)
+    fun_l0_n435(@x)
+    fun_l0_n436(@x)
+    fun_l0_n437(@x)
+    fun_l0_n438(@x)
+    fun_l0_n439(@x)
+    fun_l0_n440(@x)
+    fun_l0_n441(@x)
+    fun_l0_n442(@x)
+    fun_l0_n443(@x)
+    fun_l0_n444(@x)
+    fun_l0_n445(@x)
+    fun_l0_n446(@x)
+    fun_l0_n447(@x)
+    fun_l0_n448(@x)
+    fun_l0_n449(@x)
+    fun_l0_n450(@x)
+    fun_l0_n451(@x)
+    fun_l0_n452(@x)
+    fun_l0_n453(@x)
+    fun_l0_n454(@x)
+    fun_l0_n455(@x)
+    fun_l0_n456(@x)
+    fun_l0_n457(@x)
+    fun_l0_n458(@x)
+    fun_l0_n459(@x)
+    fun_l0_n460(@x)
+    fun_l0_n461(@x)
+    fun_l0_n462(@x)
+    fun_l0_n463(@x)
+    fun_l0_n464(@x)
+    fun_l0_n465(@x)
+    fun_l0_n466(@x)
+    fun_l0_n467(@x)
+    fun_l0_n468(@x)
+    fun_l0_n469(@x)
+    fun_l0_n470(@x)
+    fun_l0_n471(@x)
+    fun_l0_n472(@x)
+    fun_l0_n473(@x)
+    fun_l0_n474(@x)
+    fun_l0_n475(@x)
+    fun_l0_n476(@x)
+    fun_l0_n477(@x)
+    fun_l0_n478(@x)
+    fun_l0_n479(@x)
+    fun_l0_n480(@x)
+    fun_l0_n481(@x)
+    fun_l0_n482(@x)
+    fun_l0_n483(@x)
+    fun_l0_n484(@x)
+    fun_l0_n485(@x)
+    fun_l0_n486(@x)
+    fun_l0_n487(@x)
+    fun_l0_n488(@x)
+    fun_l0_n489(@x)
+    fun_l0_n490(@x)
+    fun_l0_n491(@x)
+    fun_l0_n492(@x)
+    fun_l0_n493(@x)
+    fun_l0_n494(@x)
+    fun_l0_n495(@x)
+    fun_l0_n496(@x)
+    fun_l0_n497(@x)
+    fun_l0_n498(@x)
+    fun_l0_n499(@x)
+    fun_l0_n500(@x)
+    fun_l0_n501(@x)
+    fun_l0_n502(@x)
+    fun_l0_n503(@x)
+    fun_l0_n504(@x)
+    fun_l0_n505(@x)
+    fun_l0_n506(@x)
+    fun_l0_n507(@x)
+    fun_l0_n508(@x)
+    fun_l0_n509(@x)
+    fun_l0_n510(@x)
+    fun_l0_n511(@x)
+    fun_l0_n512(@x)
+    fun_l0_n513(@x)
+    fun_l0_n514(@x)
+    fun_l0_n515(@x)
+    fun_l0_n516(@x)
+    fun_l0_n517(@x)
+    fun_l0_n518(@x)
+    fun_l0_n519(@x)
+    fun_l0_n520(@x)
+    fun_l0_n521(@x)
+    fun_l0_n522(@x)
+    fun_l0_n523(@x)
+    fun_l0_n524(@x)
+    fun_l0_n525(@x)
+    fun_l0_n526(@x)
+    fun_l0_n527(@x)
+    fun_l0_n528(@x)
+    fun_l0_n529(@x)
+    fun_l0_n530(@x)
+    fun_l0_n531(@x)
+    fun_l0_n532(@x)
+    fun_l0_n533(@x)
+    fun_l0_n534(@x)
+    fun_l0_n535(@x)
+    fun_l0_n536(@x)
+    fun_l0_n537(@x)
+    fun_l0_n538(@x)
+    fun_l0_n539(@x)
+    fun_l0_n540(@x)
+    fun_l0_n541(@x)
+    fun_l0_n542(@x)
+    fun_l0_n543(@x)
+    fun_l0_n544(@x)
+    fun_l0_n545(@x)
+    fun_l0_n546(@x)
+    fun_l0_n547(@x)
+    fun_l0_n548(@x)
+    fun_l0_n549(@x)
+    fun_l0_n550(@x)
+    fun_l0_n551(@x)
+    fun_l0_n552(@x)
+    fun_l0_n553(@x)
+    fun_l0_n554(@x)
+    fun_l0_n555(@x)
+    fun_l0_n556(@x)
+    fun_l0_n557(@x)
+    fun_l0_n558(@x)
+    fun_l0_n559(@x)
+    fun_l0_n560(@x)
+    fun_l0_n561(@x)
+    fun_l0_n562(@x)
+    fun_l0_n563(@x)
+    fun_l0_n564(@x)
+    fun_l0_n565(@x)
+    fun_l0_n566(@x)
+    fun_l0_n567(@x)
+    fun_l0_n568(@x)
+    fun_l0_n569(@x)
+    fun_l0_n570(@x)
+    fun_l0_n571(@x)
+    fun_l0_n572(@x)
+    fun_l0_n573(@x)
+    fun_l0_n574(@x)
+    fun_l0_n575(@x)
+    fun_l0_n576(@x)
+    fun_l0_n577(@x)
+    fun_l0_n578(@x)
+    fun_l0_n579(@x)
+    fun_l0_n580(@x)
+    fun_l0_n581(@x)
+    fun_l0_n582(@x)
+    fun_l0_n583(@x)
+    fun_l0_n584(@x)
+    fun_l0_n585(@x)
+    fun_l0_n586(@x)
+    fun_l0_n587(@x)
+    fun_l0_n588(@x)
+    fun_l0_n589(@x)
+    fun_l0_n590(@x)
+    fun_l0_n591(@x)
+    fun_l0_n592(@x)
+    fun_l0_n593(@x)
+    fun_l0_n594(@x)
+    fun_l0_n595(@x)
+    fun_l0_n596(@x)
+    fun_l0_n597(@x)
+    fun_l0_n598(@x)
+    fun_l0_n599(@x)
+    fun_l0_n600(@x)
+    fun_l0_n601(@x)
+    fun_l0_n602(@x)
+    fun_l0_n603(@x)
+    fun_l0_n604(@x)
+    fun_l0_n605(@x)
+    fun_l0_n606(@x)
+    fun_l0_n607(@x)
+    fun_l0_n608(@x)
+    fun_l0_n609(@x)
+    fun_l0_n610(@x)
+    fun_l0_n611(@x)
+    fun_l0_n612(@x)
+    fun_l0_n613(@x)
+    fun_l0_n614(@x)
+    fun_l0_n615(@x)
+    fun_l0_n616(@x)
+    fun_l0_n617(@x)
+    fun_l0_n618(@x)
+    fun_l0_n619(@x)
+    fun_l0_n620(@x)
+    fun_l0_n621(@x)
+    fun_l0_n622(@x)
+    fun_l0_n623(@x)
+    fun_l0_n624(@x)
+    fun_l0_n625(@x)
+    fun_l0_n626(@x)
+    fun_l0_n627(@x)
+    fun_l0_n628(@x)
+    fun_l0_n629(@x)
+    fun_l0_n630(@x)
+    fun_l0_n631(@x)
+    fun_l0_n632(@x)
+    fun_l0_n633(@x)
+    fun_l0_n634(@x)
+    fun_l0_n635(@x)
+    fun_l0_n636(@x)
+    fun_l0_n637(@x)
+    fun_l0_n638(@x)
+    fun_l0_n639(@x)
+    fun_l0_n640(@x)
+    fun_l0_n641(@x)
+    fun_l0_n642(@x)
+    fun_l0_n643(@x)
+    fun_l0_n644(@x)
+    fun_l0_n645(@x)
+    fun_l0_n646(@x)
+    fun_l0_n647(@x)
+    fun_l0_n648(@x)
+    fun_l0_n649(@x)
+    fun_l0_n650(@x)
+    fun_l0_n651(@x)
+    fun_l0_n652(@x)
+    fun_l0_n653(@x)
+    fun_l0_n654(@x)
+    fun_l0_n655(@x)
+    fun_l0_n656(@x)
+    fun_l0_n657(@x)
+    fun_l0_n658(@x)
+    fun_l0_n659(@x)
+    fun_l0_n660(@x)
+    fun_l0_n661(@x)
+    fun_l0_n662(@x)
+    fun_l0_n663(@x)
+    fun_l0_n664(@x)
+    fun_l0_n665(@x)
+    fun_l0_n666(@x)
+    fun_l0_n667(@x)
+    fun_l0_n668(@x)
+    fun_l0_n669(@x)
+    fun_l0_n670(@x)
+    fun_l0_n671(@x)
+    fun_l0_n672(@x)
+    fun_l0_n673(@x)
+    fun_l0_n674(@x)
+    fun_l0_n675(@x)
+    fun_l0_n676(@x)
+    fun_l0_n677(@x)
+    fun_l0_n678(@x)
+    fun_l0_n679(@x)
+    fun_l0_n680(@x)
+    fun_l0_n681(@x)
+    fun_l0_n682(@x)
+    fun_l0_n683(@x)
+    fun_l0_n684(@x)
+    fun_l0_n685(@x)
+    fun_l0_n686(@x)
+    fun_l0_n687(@x)
+    fun_l0_n688(@x)
+    fun_l0_n689(@x)
+    fun_l0_n690(@x)
+    fun_l0_n691(@x)
+    fun_l0_n692(@x)
+    fun_l0_n693(@x)
+    fun_l0_n694(@x)
+    fun_l0_n695(@x)
+    fun_l0_n696(@x)
+    fun_l0_n697(@x)
+    fun_l0_n698(@x)
+    fun_l0_n699(@x)
+    fun_l0_n700(@x)
+    fun_l0_n701(@x)
+    fun_l0_n702(@x)
+    fun_l0_n703(@x)
+    fun_l0_n704(@x)
+    fun_l0_n705(@x)
+    fun_l0_n706(@x)
+    fun_l0_n707(@x)
+    fun_l0_n708(@x)
+    fun_l0_n709(@x)
+    fun_l0_n710(@x)
+    fun_l0_n711(@x)
+    fun_l0_n712(@x)
+    fun_l0_n713(@x)
+    fun_l0_n714(@x)
+    fun_l0_n715(@x)
+    fun_l0_n716(@x)
+    fun_l0_n717(@x)
+    fun_l0_n718(@x)
+    fun_l0_n719(@x)
+    fun_l0_n720(@x)
+    fun_l0_n721(@x)
+    fun_l0_n722(@x)
+    fun_l0_n723(@x)
+    fun_l0_n724(@x)
+    fun_l0_n725(@x)
+    fun_l0_n726(@x)
+    fun_l0_n727(@x)
+    fun_l0_n728(@x)
+    fun_l0_n729(@x)
+    fun_l0_n730(@x)
+    fun_l0_n731(@x)
+    fun_l0_n732(@x)
+    fun_l0_n733(@x)
+    fun_l0_n734(@x)
+    fun_l0_n735(@x)
+    fun_l0_n736(@x)
+    fun_l0_n737(@x)
+    fun_l0_n738(@x)
+    fun_l0_n739(@x)
+    fun_l0_n740(@x)
+    fun_l0_n741(@x)
+    fun_l0_n742(@x)
+    fun_l0_n743(@x)
+    fun_l0_n744(@x)
+    fun_l0_n745(@x)
+    fun_l0_n746(@x)
+    fun_l0_n747(@x)
+    fun_l0_n748(@x)
+    fun_l0_n749(@x)
+    fun_l0_n750(@x)
+    fun_l0_n751(@x)
+    fun_l0_n752(@x)
+    fun_l0_n753(@x)
+    fun_l0_n754(@x)
+    fun_l0_n755(@x)
+    fun_l0_n756(@x)
+    fun_l0_n757(@x)
+    fun_l0_n758(@x)
+    fun_l0_n759(@x)
+    fun_l0_n760(@x)
+    fun_l0_n761(@x)
+    fun_l0_n762(@x)
+    fun_l0_n763(@x)
+    fun_l0_n764(@x)
+    fun_l0_n765(@x)
+    fun_l0_n766(@x)
+    fun_l0_n767(@x)
+    fun_l0_n768(@x)
+    fun_l0_n769(@x)
+    fun_l0_n770(@x)
+    fun_l0_n771(@x)
+    fun_l0_n772(@x)
+    fun_l0_n773(@x)
+    fun_l0_n774(@x)
+    fun_l0_n775(@x)
+    fun_l0_n776(@x)
+    fun_l0_n777(@x)
+    fun_l0_n778(@x)
+    fun_l0_n779(@x)
+    fun_l0_n780(@x)
+    fun_l0_n781(@x)
+    fun_l0_n782(@x)
+    fun_l0_n783(@x)
+    fun_l0_n784(@x)
+    fun_l0_n785(@x)
+    fun_l0_n786(@x)
+    fun_l0_n787(@x)
+    fun_l0_n788(@x)
+    fun_l0_n789(@x)
+    fun_l0_n790(@x)
+    fun_l0_n791(@x)
+    fun_l0_n792(@x)
+    fun_l0_n793(@x)
+    fun_l0_n794(@x)
+    fun_l0_n795(@x)
+    fun_l0_n796(@x)
+    fun_l0_n797(@x)
+    fun_l0_n798(@x)
+    fun_l0_n799(@x)
+    fun_l0_n800(@x)
+    fun_l0_n801(@x)
+    fun_l0_n802(@x)
+    fun_l0_n803(@x)
+    fun_l0_n804(@x)
+    fun_l0_n805(@x)
+    fun_l0_n806(@x)
+    fun_l0_n807(@x)
+    fun_l0_n808(@x)
+    fun_l0_n809(@x)
+    fun_l0_n810(@x)
+    fun_l0_n811(@x)
+    fun_l0_n812(@x)
+    fun_l0_n813(@x)
+    fun_l0_n814(@x)
+    fun_l0_n815(@x)
+    fun_l0_n816(@x)
+    fun_l0_n817(@x)
+    fun_l0_n818(@x)
+    fun_l0_n819(@x)
+    fun_l0_n820(@x)
+    fun_l0_n821(@x)
+    fun_l0_n822(@x)
+    fun_l0_n823(@x)
+    fun_l0_n824(@x)
+    fun_l0_n825(@x)
+    fun_l0_n826(@x)
+    fun_l0_n827(@x)
+    fun_l0_n828(@x)
+    fun_l0_n829(@x)
+    fun_l0_n830(@x)
+    fun_l0_n831(@x)
+    fun_l0_n832(@x)
+    fun_l0_n833(@x)
+    fun_l0_n834(@x)
+    fun_l0_n835(@x)
+    fun_l0_n836(@x)
+    fun_l0_n837(@x)
+    fun_l0_n838(@x)
+    fun_l0_n839(@x)
+    fun_l0_n840(@x)
+    fun_l0_n841(@x)
+    fun_l0_n842(@x)
+    fun_l0_n843(@x)
+    fun_l0_n844(@x)
+    fun_l0_n845(@x)
+    fun_l0_n846(@x)
+    fun_l0_n847(@x)
+    fun_l0_n848(@x)
+    fun_l0_n849(@x)
+    fun_l0_n850(@x)
+    fun_l0_n851(@x)
+    fun_l0_n852(@x)
+    fun_l0_n853(@x)
+    fun_l0_n854(@x)
+    fun_l0_n855(@x)
+    fun_l0_n856(@x)
+    fun_l0_n857(@x)
+    fun_l0_n858(@x)
+    fun_l0_n859(@x)
+    fun_l0_n860(@x)
+    fun_l0_n861(@x)
+    fun_l0_n862(@x)
+    fun_l0_n863(@x)
+    fun_l0_n864(@x)
+    fun_l0_n865(@x)
+    fun_l0_n866(@x)
+    fun_l0_n867(@x)
+    fun_l0_n868(@x)
+    fun_l0_n869(@x)
+    fun_l0_n870(@x)
+    fun_l0_n871(@x)
+    fun_l0_n872(@x)
+    fun_l0_n873(@x)
+    fun_l0_n874(@x)
+    fun_l0_n875(@x)
+    fun_l0_n876(@x)
+    fun_l0_n877(@x)
+    fun_l0_n878(@x)
+    fun_l0_n879(@x)
+    fun_l0_n880(@x)
+    fun_l0_n881(@x)
+    fun_l0_n882(@x)
+    fun_l0_n883(@x)
+    fun_l0_n884(@x)
+    fun_l0_n885(@x)
+    fun_l0_n886(@x)
+    fun_l0_n887(@x)
+    fun_l0_n888(@x)
+    fun_l0_n889(@x)
+    fun_l0_n890(@x)
+    fun_l0_n891(@x)
+    fun_l0_n892(@x)
+    fun_l0_n893(@x)
+    fun_l0_n894(@x)
+    fun_l0_n895(@x)
+    fun_l0_n896(@x)
+    fun_l0_n897(@x)
+    fun_l0_n898(@x)
+    fun_l0_n899(@x)
+    fun_l0_n900(@x)
+    fun_l0_n901(@x)
+    fun_l0_n902(@x)
+    fun_l0_n903(@x)
+    fun_l0_n904(@x)
+    fun_l0_n905(@x)
+    fun_l0_n906(@x)
+    fun_l0_n907(@x)
+    fun_l0_n908(@x)
+    fun_l0_n909(@x)
+    fun_l0_n910(@x)
+    fun_l0_n911(@x)
+    fun_l0_n912(@x)
+    fun_l0_n913(@x)
+    fun_l0_n914(@x)
+    fun_l0_n915(@x)
+    fun_l0_n916(@x)
+    fun_l0_n917(@x)
+    fun_l0_n918(@x)
+    fun_l0_n919(@x)
+    fun_l0_n920(@x)
+    fun_l0_n921(@x)
+    fun_l0_n922(@x)
+    fun_l0_n923(@x)
+    fun_l0_n924(@x)
+    fun_l0_n925(@x)
+    fun_l0_n926(@x)
+    fun_l0_n927(@x)
+    fun_l0_n928(@x)
+    fun_l0_n929(@x)
+    fun_l0_n930(@x)
+    fun_l0_n931(@x)
+    fun_l0_n932(@x)
+    fun_l0_n933(@x)
+    fun_l0_n934(@x)
+    fun_l0_n935(@x)
+    fun_l0_n936(@x)
+    fun_l0_n937(@x)
+    fun_l0_n938(@x)
+    fun_l0_n939(@x)
+    fun_l0_n940(@x)
+    fun_l0_n941(@x)
+    fun_l0_n942(@x)
+    fun_l0_n943(@x)
+    fun_l0_n944(@x)
+    fun_l0_n945(@x)
+    fun_l0_n946(@x)
+    fun_l0_n947(@x)
+    fun_l0_n948(@x)
+    fun_l0_n949(@x)
+    fun_l0_n950(@x)
+    fun_l0_n951(@x)
+    fun_l0_n952(@x)
+    fun_l0_n953(@x)
+    fun_l0_n954(@x)
+    fun_l0_n955(@x)
+    fun_l0_n956(@x)
+    fun_l0_n957(@x)
+    fun_l0_n958(@x)
+    fun_l0_n959(@x)
+    fun_l0_n960(@x)
+    fun_l0_n961(@x)
+    fun_l0_n962(@x)
+    fun_l0_n963(@x)
+    fun_l0_n964(@x)
+    fun_l0_n965(@x)
+    fun_l0_n966(@x)
+    fun_l0_n967(@x)
+    fun_l0_n968(@x)
+    fun_l0_n969(@x)
+    fun_l0_n970(@x)
+    fun_l0_n971(@x)
+    fun_l0_n972(@x)
+    fun_l0_n973(@x)
+    fun_l0_n974(@x)
+    fun_l0_n975(@x)
+    fun_l0_n976(@x)
+    fun_l0_n977(@x)
+    fun_l0_n978(@x)
+    fun_l0_n979(@x)
+    fun_l0_n980(@x)
+    fun_l0_n981(@x)
+    fun_l0_n982(@x)
+    fun_l0_n983(@x)
+    fun_l0_n984(@x)
+    fun_l0_n985(@x)
+    fun_l0_n986(@x)
+    fun_l0_n987(@x)
+    fun_l0_n988(@x)
+    fun_l0_n989(@x)
+    fun_l0_n990(@x)
+    fun_l0_n991(@x)
+    fun_l0_n992(@x)
+    fun_l0_n993(@x)
+    fun_l0_n994(@x)
+    fun_l0_n995(@x)
+    fun_l0_n996(@x)
+    fun_l0_n997(@x)
+    fun_l0_n998(@x)
+    fun_l0_n999(@x)
+end
+
+@count
+
+}
diff --git a/bootstraptest/test_yjit_30k_methods.rb b/bootstraptest/test_yjit_30k_methods.rb
new file mode 100644
index 0000000000..f2acea4ce5
--- /dev/null
+++ b/bootstraptest/test_yjit_30k_methods.rb
@@ -0,0 +1,121018 @@
+# This is a torture test for the JIT.
+# There are 30K tiny methods in a 30-deep call hierarchy.
+assert_equal '1000000', %q{
+
+def fun_l0_n0()
+    fun_l1_n758
+end
+
+def fun_l0_n1()
+    fun_l1_n491
+end
+
+def fun_l0_n2()
+    fun_l1_n804
+end
+
+def fun_l0_n3()
+    fun_l1_n253
+end
+
+def fun_l0_n4()
+    fun_l1_n409
+end
+
+def fun_l0_n5()
+    fun_l1_n383
+end
+
+def fun_l0_n6()
+    fun_l1_n170
+end
+
+def fun_l0_n7()
+    fun_l1_n821
+end
+
+def fun_l0_n8()
+    fun_l1_n424
+end
+
+def fun_l0_n9()
+    fun_l1_n328
+end
+
+def fun_l0_n10()
+    fun_l1_n326
+end
+
+def fun_l0_n11()
+    fun_l1_n879
+end
+
+def fun_l0_n12()
+    fun_l1_n509
+end
+
+def fun_l0_n13()
+    fun_l1_n464
+end
+
+def fun_l0_n14()
+    fun_l1_n806
+end
+
+def fun_l0_n15()
+    fun_l1_n277
+end
+
+def fun_l0_n16()
+    fun_l1_n684
+end
+
+def fun_l0_n17()
+    fun_l1_n54
+end
+
+def fun_l0_n18()
+    fun_l1_n514
+end
+
+def fun_l0_n19()
+    fun_l1_n967
+end
+
+def fun_l0_n20()
+    fun_l1_n50
+end
+
+def fun_l0_n21()
+    fun_l1_n248
+end
+
+def fun_l0_n22()
+    fun_l1_n410
+end
+
+def fun_l0_n23()
+    fun_l1_n411
+end
+
+def fun_l0_n24()
+    fun_l1_n422
+end
+
+def fun_l0_n25()
+    fun_l1_n427
+end
+
+def fun_l0_n26()
+    fun_l1_n929
+end
+
+def fun_l0_n27()
+    fun_l1_n93
+end
+
+def fun_l0_n28()
+    fun_l1_n790
+end
+
+def fun_l0_n29()
+    fun_l1_n107
+end
+
+def fun_l0_n30()
+    fun_l1_n29
+end
+
+def fun_l0_n31()
+    fun_l1_n164
+end
+
+def fun_l0_n32()
+    fun_l1_n720
+end
+
+def fun_l0_n33()
+    fun_l1_n30
+end
+
+def fun_l0_n34()
+    fun_l1_n133
+end
+
+def fun_l0_n35()
+    fun_l1_n122
+end
+
+def fun_l0_n36()
+    fun_l1_n101
+end
+
+def fun_l0_n37()
+    fun_l1_n80
+end
+
+def fun_l0_n38()
+    fun_l1_n759
+end
+
+def fun_l0_n39()
+    fun_l1_n315
+end
+
+def fun_l0_n40()
+    fun_l1_n508
+end
+
+def fun_l0_n41()
+    fun_l1_n750
+end
+
+def fun_l0_n42()
+    fun_l1_n200
+end
+
+def fun_l0_n43()
+    fun_l1_n662
+end
+
+def fun_l0_n44()
+    fun_l1_n2
+end
+
+def fun_l0_n45()
+    fun_l1_n864
+end
+
+def fun_l0_n46()
+    fun_l1_n482
+end
+
+def fun_l0_n47()
+    fun_l1_n196
+end
+
+def fun_l0_n48()
+    fun_l1_n867
+end
+
+def fun_l0_n49()
+    fun_l1_n942
+end
+
+def fun_l0_n50()
+    fun_l1_n179
+end
+
+def fun_l0_n51()
+    fun_l1_n442
+end
+
+def fun_l0_n52()
+    fun_l1_n613
+end
+
+def fun_l0_n53()
+    fun_l1_n282
+end
+
+def fun_l0_n54()
+    fun_l1_n624
+end
+
+def fun_l0_n55()
+    fun_l1_n514
+end
+
+def fun_l0_n56()
+    fun_l1_n59
+end
+
+def fun_l0_n57()
+    fun_l1_n401
+end
+
+def fun_l0_n58()
+    fun_l1_n693
+end
+
+def fun_l0_n59()
+    fun_l1_n643
+end
+
+def fun_l0_n60()
+    fun_l1_n104
+end
+
+def fun_l0_n61()
+    fun_l1_n407
+end
+
+def fun_l0_n62()
+    fun_l1_n418
+end
+
+def fun_l0_n63()
+    fun_l1_n775
+end
+
+def fun_l0_n64()
+    fun_l1_n351
+end
+
+def fun_l0_n65()
+    fun_l1_n320
+end
+
+def fun_l0_n66()
+    fun_l1_n181
+end
+
+def fun_l0_n67()
+    fun_l1_n878
+end
+
+def fun_l0_n68()
+    fun_l1_n404
+end
+
+def fun_l0_n69()
+    fun_l1_n660
+end
+
+def fun_l0_n70()
+    fun_l1_n644
+end
+
+def fun_l0_n71()
+    fun_l1_n416
+end
+
+def fun_l0_n72()
+    fun_l1_n372
+end
+
+def fun_l0_n73()
+    fun_l1_n525
+end
+
+def fun_l0_n74()
+    fun_l1_n468
+end
+
+def fun_l0_n75()
+    fun_l1_n652
+end
+
+def fun_l0_n76()
+    fun_l1_n418
+end
+
+def fun_l0_n77()
+    fun_l1_n935
+end
+
+def fun_l0_n78()
+    fun_l1_n170
+end
+
+def fun_l0_n79()
+    fun_l1_n805
+end
+
+def fun_l0_n80()
+    fun_l1_n405
+end
+
+def fun_l0_n81()
+    fun_l1_n994
+end
+
+def fun_l0_n82()
+    fun_l1_n395
+end
+
+def fun_l0_n83()
+    fun_l1_n399
+end
+
+def fun_l0_n84()
+    fun_l1_n503
+end
+
+def fun_l0_n85()
+    fun_l1_n451
+end
+
+def fun_l0_n86()
+    fun_l1_n920
+end
+
+def fun_l0_n87()
+    fun_l1_n446
+end
+
+def fun_l0_n88()
+    fun_l1_n637
+end
+
+def fun_l0_n89()
+    fun_l1_n732
+end
+
+def fun_l0_n90()
+    fun_l1_n823
+end
+
+def fun_l0_n91()
+    fun_l1_n347
+end
+
+def fun_l0_n92()
+    fun_l1_n808
+end
+
+def fun_l0_n93()
+    fun_l1_n941
+end
+
+def fun_l0_n94()
+    fun_l1_n808
+end
+
+def fun_l0_n95()
+    fun_l1_n575
+end
+
+def fun_l0_n96()
+    fun_l1_n835
+end
+
+def fun_l0_n97()
+    fun_l1_n601
+end
+
+def fun_l0_n98()
+    fun_l1_n522
+end
+
+def fun_l0_n99()
+    fun_l1_n884
+end
+
+def fun_l0_n100()
+    fun_l1_n234
+end
+
+def fun_l0_n101()
+    fun_l1_n58
+end
+
+def fun_l0_n102()
+    fun_l1_n702
+end
+
+def fun_l0_n103()
+    fun_l1_n816
+end
+
+def fun_l0_n104()
+    fun_l1_n92
+end
+
+def fun_l0_n105()
+    fun_l1_n673
+end
+
+def fun_l0_n106()
+    fun_l1_n360
+end
+
+def fun_l0_n107()
+    fun_l1_n305
+end
+
+def fun_l0_n108()
+    fun_l1_n202
+end
+
+def fun_l0_n109()
+    fun_l1_n879
+end
+
+def fun_l0_n110()
+    fun_l1_n84
+end
+
+def fun_l0_n111()
+    fun_l1_n50
+end
+
+def fun_l0_n112()
+    fun_l1_n648
+end
+
+def fun_l0_n113()
+    fun_l1_n786
+end
+
+def fun_l0_n114()
+    fun_l1_n627
+end
+
+def fun_l0_n115()
+    fun_l1_n404
+end
+
+def fun_l0_n116()
+    fun_l1_n496
+end
+
+def fun_l0_n117()
+    fun_l1_n778
+end
+
+def fun_l0_n118()
+    fun_l1_n119
+end
+
+def fun_l0_n119()
+    fun_l1_n350
+end
+
+def fun_l0_n120()
+    fun_l1_n767
+end
+
+def fun_l0_n121()
+    fun_l1_n463
+end
+
+def fun_l0_n122()
+    fun_l1_n481
+end
+
+def fun_l0_n123()
+    fun_l1_n80
+end
+
+def fun_l0_n124()
+    fun_l1_n271
+end
+
+def fun_l0_n125()
+    fun_l1_n315
+end
+
+def fun_l0_n126()
+    fun_l1_n545
+end
+
+def fun_l0_n127()
+    fun_l1_n598
+end
+
+def fun_l0_n128()
+    fun_l1_n599
+end
+
+def fun_l0_n129()
+    fun_l1_n263
+end
+
+def fun_l0_n130()
+    fun_l1_n514
+end
+
+def fun_l0_n131()
+    fun_l1_n779
+end
+
+def fun_l0_n132()
+    fun_l1_n585
+end
+
+def fun_l0_n133()
+    fun_l1_n919
+end
+
+def fun_l0_n134()
+    fun_l1_n665
+end
+
+def fun_l0_n135()
+    fun_l1_n442
+end
+
+def fun_l0_n136()
+    fun_l1_n84
+end
+
+def fun_l0_n137()
+    fun_l1_n74
+end
+
+def fun_l0_n138()
+    fun_l1_n606
+end
+
+def fun_l0_n139()
+    fun_l1_n655
+end
+
+def fun_l0_n140()
+    fun_l1_n130
+end
+
+def fun_l0_n141()
+    fun_l1_n626
+end
+
+def fun_l0_n142()
+    fun_l1_n605
+end
+
+def fun_l0_n143()
+    fun_l1_n420
+end
+
+def fun_l0_n144()
+    fun_l1_n100
+end
+
+def fun_l0_n145()
+    fun_l1_n961
+end
+
+def fun_l0_n146()
+    fun_l1_n721
+end
+
+def fun_l0_n147()
+    fun_l1_n453
+end
+
+def fun_l0_n148()
+    fun_l1_n737
+end
+
+def fun_l0_n149()
+    fun_l1_n230
+end
+
+def fun_l0_n150()
+    fun_l1_n881
+end
+
+def fun_l0_n151()
+    fun_l1_n471
+end
+
+def fun_l0_n152()
+    fun_l1_n72
+end
+
+def fun_l0_n153()
+    fun_l1_n221
+end
+
+def fun_l0_n154()
+    fun_l1_n504
+end
+
+def fun_l0_n155()
+    fun_l1_n222
+end
+
+def fun_l0_n156()
+    fun_l1_n348
+end
+
+def fun_l0_n157()
+    fun_l1_n738
+end
+
+def fun_l0_n158()
+    fun_l1_n588
+end
+
+def fun_l0_n159()
+    fun_l1_n64
+end
+
+def fun_l0_n160()
+    fun_l1_n829
+end
+
+def fun_l0_n161()
+    fun_l1_n265
+end
+
+def fun_l0_n162()
+    fun_l1_n471
+end
+
+def fun_l0_n163()
+    fun_l1_n304
+end
+
+def fun_l0_n164()
+    fun_l1_n518
+end
+
+def fun_l0_n165()
+    fun_l1_n89
+end
+
+def fun_l0_n166()
+    fun_l1_n728
+end
+
+def fun_l0_n167()
+    fun_l1_n292
+end
+
+def fun_l0_n168()
+    fun_l1_n142
+end
+
+def fun_l0_n169()
+    fun_l1_n374
+end
+
+def fun_l0_n170()
+    fun_l1_n371
+end
+
+def fun_l0_n171()
+    fun_l1_n904
+end
+
+def fun_l0_n172()
+    fun_l1_n519
+end
+
+def fun_l0_n173()
+    fun_l1_n239
+end
+
+def fun_l0_n174()
+    fun_l1_n664
+end
+
+def fun_l0_n175()
+    fun_l1_n701
+end
+
+def fun_l0_n176()
+    fun_l1_n586
+end
+
+def fun_l0_n177()
+    fun_l1_n78
+end
+
+def fun_l0_n178()
+    fun_l1_n663
+end
+
+def fun_l0_n179()
+    fun_l1_n46
+end
+
+def fun_l0_n180()
+    fun_l1_n273
+end
+
+def fun_l0_n181()
+    fun_l1_n250
+end
+
+def fun_l0_n182()
+    fun_l1_n362
+end
+
+def fun_l0_n183()
+    fun_l1_n69
+end
+
+def fun_l0_n184()
+    fun_l1_n874
+end
+
+def fun_l0_n185()
+    fun_l1_n135
+end
+
+def fun_l0_n186()
+    fun_l1_n634
+end
+
+def fun_l0_n187()
+    fun_l1_n885
+end
+
+def fun_l0_n188()
+    fun_l1_n589
+end
+
+def fun_l0_n189()
+    fun_l1_n21
+end
+
+def fun_l0_n190()
+    fun_l1_n962
+end
+
+def fun_l0_n191()
+    fun_l1_n267
+end
+
+def fun_l0_n192()
+    fun_l1_n569
+end
+
+def fun_l0_n193()
+    fun_l1_n921
+end
+
+def fun_l0_n194()
+    fun_l1_n535
+end
+
+def fun_l0_n195()
+    fun_l1_n362
+end
+
+def fun_l0_n196()
+    fun_l1_n862
+end
+
+def fun_l0_n197()
+    fun_l1_n565
+end
+
+def fun_l0_n198()
+    fun_l1_n779
+end
+
+def fun_l0_n199()
+    fun_l1_n848
+end
+
+def fun_l0_n200()
+    fun_l1_n755
+end
+
+def fun_l0_n201()
+    fun_l1_n493
+end
+
+def fun_l0_n202()
+    fun_l1_n574
+end
+
+def fun_l0_n203()
+    fun_l1_n172
+end
+
+def fun_l0_n204()
+    fun_l1_n388
+end
+
+def fun_l0_n205()
+    fun_l1_n67
+end
+
+def fun_l0_n206()
+    fun_l1_n449
+end
+
+def fun_l0_n207()
+    fun_l1_n883
+end
+
+def fun_l0_n208()
+    fun_l1_n749
+end
+
+def fun_l0_n209()
+    fun_l1_n425
+end
+
+def fun_l0_n210()
+    fun_l1_n848
+end
+
+def fun_l0_n211()
+    fun_l1_n320
+end
+
+def fun_l0_n212()
+    fun_l1_n122
+end
+
+def fun_l0_n213()
+    fun_l1_n878
+end
+
+def fun_l0_n214()
+    fun_l1_n763
+end
+
+def fun_l0_n215()
+    fun_l1_n70
+end
+
+def fun_l0_n216()
+    fun_l1_n494
+end
+
+def fun_l0_n217()
+    fun_l1_n13
+end
+
+def fun_l0_n218()
+    fun_l1_n907
+end
+
+def fun_l0_n219()
+    fun_l1_n775
+end
+
+def fun_l0_n220()
+    fun_l1_n633
+end
+
+def fun_l0_n221()
+    fun_l1_n371
+end
+
+def fun_l0_n222()
+    fun_l1_n691
+end
+
+def fun_l0_n223()
+    fun_l1_n994
+end
+
+def fun_l0_n224()
+    fun_l1_n268
+end
+
+def fun_l0_n225()
+    fun_l1_n52
+end
+
+def fun_l0_n226()
+    fun_l1_n291
+end
+
+def fun_l0_n227()
+    fun_l1_n903
+end
+
+def fun_l0_n228()
+    fun_l1_n369
+end
+
+def fun_l0_n229()
+    fun_l1_n232
+end
+
+def fun_l0_n230()
+    fun_l1_n554
+end
+
+def fun_l0_n231()
+    fun_l1_n479
+end
+
+def fun_l0_n232()
+    fun_l1_n838
+end
+
+def fun_l0_n233()
+    fun_l1_n316
+end
+
+def fun_l0_n234()
+    fun_l1_n685
+end
+
+def fun_l0_n235()
+    fun_l1_n95
+end
+
+def fun_l0_n236()
+    fun_l1_n629
+end
+
+def fun_l0_n237()
+    fun_l1_n218
+end
+
+def fun_l0_n238()
+    fun_l1_n406
+end
+
+def fun_l0_n239()
+    fun_l1_n187
+end
+
+def fun_l0_n240()
+    fun_l1_n905
+end
+
+def fun_l0_n241()
+    fun_l1_n262
+end
+
+def fun_l0_n242()
+    fun_l1_n314
+end
+
+def fun_l0_n243()
+    fun_l1_n669
+end
+
+def fun_l0_n244()
+    fun_l1_n112
+end
+
+def fun_l0_n245()
+    fun_l1_n744
+end
+
+def fun_l0_n246()
+    fun_l1_n637
+end
+
+def fun_l0_n247()
+    fun_l1_n409
+end
+
+def fun_l0_n248()
+    fun_l1_n706
+end
+
+def fun_l0_n249()
+    fun_l1_n150
+end
+
+def fun_l0_n250()
+    fun_l1_n863
+end
+
+def fun_l0_n251()
+    fun_l1_n364
+end
+
+def fun_l0_n252()
+    fun_l1_n989
+end
+
+def fun_l0_n253()
+    fun_l1_n565
+end
+
+def fun_l0_n254()
+    fun_l1_n701
+end
+
+def fun_l0_n255()
+    fun_l1_n48
+end
+
+def fun_l0_n256()
+    fun_l1_n278
+end
+
+def fun_l0_n257()
+    fun_l1_n816
+end
+
+def fun_l0_n258()
+    fun_l1_n981
+end
+
+def fun_l0_n259()
+    fun_l1_n556
+end
+
+def fun_l0_n260()
+    fun_l1_n887
+end
+
+def fun_l0_n261()
+    fun_l1_n193
+end
+
+def fun_l0_n262()
+    fun_l1_n690
+end
+
+def fun_l0_n263()
+    fun_l1_n144
+end
+
+def fun_l0_n264()
+    fun_l1_n577
+end
+
+def fun_l0_n265()
+    fun_l1_n949
+end
+
+def fun_l0_n266()
+    fun_l1_n320
+end
+
+def fun_l0_n267()
+    fun_l1_n857
+end
+
+def fun_l0_n268()
+    fun_l1_n676
+end
+
+def fun_l0_n269()
+    fun_l1_n683
+end
+
+def fun_l0_n270()
+    fun_l1_n303
+end
+
+def fun_l0_n271()
+    fun_l1_n847
+end
+
+def fun_l0_n272()
+    fun_l1_n588
+end
+
+def fun_l0_n273()
+    fun_l1_n456
+end
+
+def fun_l0_n274()
+    fun_l1_n355
+end
+
+def fun_l0_n275()
+    fun_l1_n183
+end
+
+def fun_l0_n276()
+    fun_l1_n271
+end
+
+def fun_l0_n277()
+    fun_l1_n746
+end
+
+def fun_l0_n278()
+    fun_l1_n885
+end
+
+def fun_l0_n279()
+    fun_l1_n951
+end
+
+def fun_l0_n280()
+    fun_l1_n935
+end
+
+def fun_l0_n281()
+    fun_l1_n445
+end
+
+def fun_l0_n282()
+    fun_l1_n2
+end
+
+def fun_l0_n283()
+    fun_l1_n52
+end
+
+def fun_l0_n284()
+    fun_l1_n208
+end
+
+def fun_l0_n285()
+    fun_l1_n27
+end
+
+def fun_l0_n286()
+    fun_l1_n657
+end
+
+def fun_l0_n287()
+    fun_l1_n373
+end
+
+def fun_l0_n288()
+    fun_l1_n439
+end
+
+def fun_l0_n289()
+    fun_l1_n974
+end
+
+def fun_l0_n290()
+    fun_l1_n834
+end
+
+def fun_l0_n291()
+    fun_l1_n673
+end
+
+def fun_l0_n292()
+    fun_l1_n978
+end
+
+def fun_l0_n293()
+    fun_l1_n123
+end
+
+def fun_l0_n294()
+    fun_l1_n644
+end
+
+def fun_l0_n295()
+    fun_l1_n715
+end
+
+def fun_l0_n296()
+    fun_l1_n912
+end
+
+def fun_l0_n297()
+    fun_l1_n954
+end
+
+def fun_l0_n298()
+    fun_l1_n519
+end
+
+def fun_l0_n299()
+    fun_l1_n726
+end
+
+def fun_l0_n300()
+    fun_l1_n417
+end
+
+def fun_l0_n301()
+    fun_l1_n199
+end
+
+def fun_l0_n302()
+    fun_l1_n157
+end
+
+def fun_l0_n303()
+    fun_l1_n432
+end
+
+def fun_l0_n304()
+    fun_l1_n59
+end
+
+def fun_l0_n305()
+    fun_l1_n604
+end
+
+def fun_l0_n306()
+    fun_l1_n301
+end
+
+def fun_l0_n307()
+    fun_l1_n558
+end
+
+def fun_l0_n308()
+    fun_l1_n443
+end
+
+def fun_l0_n309()
+    fun_l1_n873
+end
+
+def fun_l0_n310()
+    fun_l1_n415
+end
+
+def fun_l0_n311()
+    fun_l1_n907
+end
+
+def fun_l0_n312()
+    fun_l1_n159
+end
+
+def fun_l0_n313()
+    fun_l1_n695
+end
+
+def fun_l0_n314()
+    fun_l1_n679
+end
+
+def fun_l0_n315()
+    fun_l1_n788
+end
+
+def fun_l0_n316()
+    fun_l1_n510
+end
+
+def fun_l0_n317()
+    fun_l1_n997
+end
+
+def fun_l0_n318()
+    fun_l1_n821
+end
+
+def fun_l0_n319()
+    fun_l1_n554
+end
+
+def fun_l0_n320()
+    fun_l1_n982
+end
+
+def fun_l0_n321()
+    fun_l1_n996
+end
+
+def fun_l0_n322()
+    fun_l1_n73
+end
+
+def fun_l0_n323()
+    fun_l1_n951
+end
+
+def fun_l0_n324()
+    fun_l1_n597
+end
+
+def fun_l0_n325()
+    fun_l1_n502
+end
+
+def fun_l0_n326()
+    fun_l1_n150
+end
+
+def fun_l0_n327()
+    fun_l1_n979
+end
+
+def fun_l0_n328()
+    fun_l1_n81
+end
+
+def fun_l0_n329()
+    fun_l1_n87
+end
+
+def fun_l0_n330()
+    fun_l1_n726
+end
+
+def fun_l0_n331()
+    fun_l1_n159
+end
+
+def fun_l0_n332()
+    fun_l1_n799
+end
+
+def fun_l0_n333()
+    fun_l1_n202
+end
+
+def fun_l0_n334()
+    fun_l1_n904
+end
+
+def fun_l0_n335()
+    fun_l1_n14
+end
+
+def fun_l0_n336()
+    fun_l1_n136
+end
+
+def fun_l0_n337()
+    fun_l1_n865
+end
+
+def fun_l0_n338()
+    fun_l1_n307
+end
+
+def fun_l0_n339()
+    fun_l1_n827
+end
+
+def fun_l0_n340()
+    fun_l1_n518
+end
+
+def fun_l0_n341()
+    fun_l1_n416
+end
+
+def fun_l0_n342()
+    fun_l1_n277
+end
+
+def fun_l0_n343()
+    fun_l1_n609
+end
+
+def fun_l0_n344()
+    fun_l1_n328
+end
+
+def fun_l0_n345()
+    fun_l1_n941
+end
+
+def fun_l0_n346()
+    fun_l1_n707
+end
+
+def fun_l0_n347()
+    fun_l1_n452
+end
+
+def fun_l0_n348()
+    fun_l1_n874
+end
+
+def fun_l0_n349()
+    fun_l1_n117
+end
+
+def fun_l0_n350()
+    fun_l1_n739
+end
+
+def fun_l0_n351()
+    fun_l1_n202
+end
+
+def fun_l0_n352()
+    fun_l1_n80
+end
+
+def fun_l0_n353()
+    fun_l1_n373
+end
+
+def fun_l0_n354()
+    fun_l1_n747
+end
+
+def fun_l0_n355()
+    fun_l1_n949
+end
+
+def fun_l0_n356()
+    fun_l1_n901
+end
+
+def fun_l0_n357()
+    fun_l1_n512
+end
+
+def fun_l0_n358()
+    fun_l1_n528
+end
+
+def fun_l0_n359()
+    fun_l1_n895
+end
+
+def fun_l0_n360()
+    fun_l1_n683
+end
+
+def fun_l0_n361()
+    fun_l1_n80
+end
+
+def fun_l0_n362()
+    fun_l1_n718
+end
+
+def fun_l0_n363()
+    fun_l1_n388
+end
+
+def fun_l0_n364()
+    fun_l1_n701
+end
+
+def fun_l0_n365()
+    fun_l1_n146
+end
+
+def fun_l0_n366()
+    fun_l1_n143
+end
+
+def fun_l0_n367()
+    fun_l1_n872
+end
+
+def fun_l0_n368()
+    fun_l1_n818
+end
+
+def fun_l0_n369()
+    fun_l1_n821
+end
+
+def fun_l0_n370()
+    fun_l1_n180
+end
+
+def fun_l0_n371()
+    fun_l1_n346
+end
+
+def fun_l0_n372()
+    fun_l1_n524
+end
+
+def fun_l0_n373()
+    fun_l1_n451
+end
+
+def fun_l0_n374()
+    fun_l1_n592
+end
+
+def fun_l0_n375()
+    fun_l1_n215
+end
+
+def fun_l0_n376()
+    fun_l1_n737
+end
+
+def fun_l0_n377()
+    fun_l1_n631
+end
+
+def fun_l0_n378()
+    fun_l1_n385
+end
+
+def fun_l0_n379()
+    fun_l1_n593
+end
+
+def fun_l0_n380()
+    fun_l1_n484
+end
+
+def fun_l0_n381()
+    fun_l1_n979
+end
+
+def fun_l0_n382()
+    fun_l1_n491
+end
+
+def fun_l0_n383()
+    fun_l1_n632
+end
+
+def fun_l0_n384()
+    fun_l1_n939
+end
+
+def fun_l0_n385()
+    fun_l1_n932
+end
+
+def fun_l0_n386()
+    fun_l1_n816
+end
+
+def fun_l0_n387()
+    fun_l1_n308
+end
+
+def fun_l0_n388()
+    fun_l1_n525
+end
+
+def fun_l0_n389()
+    fun_l1_n160
+end
+
+def fun_l0_n390()
+    fun_l1_n313
+end
+
+def fun_l0_n391()
+    fun_l1_n816
+end
+
+def fun_l0_n392()
+    fun_l1_n641
+end
+
+def fun_l0_n393()
+    fun_l1_n319
+end
+
+def fun_l0_n394()
+    fun_l1_n559
+end
+
+def fun_l0_n395()
+    fun_l1_n520
+end
+
+def fun_l0_n396()
+    fun_l1_n277
+end
+
+def fun_l0_n397()
+    fun_l1_n410
+end
+
+def fun_l0_n398()
+    fun_l1_n956
+end
+
+def fun_l0_n399()
+    fun_l1_n101
+end
+
+def fun_l0_n400()
+    fun_l1_n33
+end
+
+def fun_l0_n401()
+    fun_l1_n554
+end
+
+def fun_l0_n402()
+    fun_l1_n821
+end
+
+def fun_l0_n403()
+    fun_l1_n230
+end
+
+def fun_l0_n404()
+    fun_l1_n185
+end
+
+def fun_l0_n405()
+    fun_l1_n430
+end
+
+def fun_l0_n406()
+    fun_l1_n94
+end
+
+def fun_l0_n407()
+    fun_l1_n776
+end
+
+def fun_l0_n408()
+    fun_l1_n981
+end
+
+def fun_l0_n409()
+    fun_l1_n414
+end
+
+def fun_l0_n410()
+    fun_l1_n421
+end
+
+def fun_l0_n411()
+    fun_l1_n343
+end
+
+def fun_l0_n412()
+    fun_l1_n484
+end
+
+def fun_l0_n413()
+    fun_l1_n818
+end
+
+def fun_l0_n414()
+    fun_l1_n860
+end
+
+def fun_l0_n415()
+    fun_l1_n70
+end
+
+def fun_l0_n416()
+    fun_l1_n643
+end
+
+def fun_l0_n417()
+    fun_l1_n382
+end
+
+def fun_l0_n418()
+    fun_l1_n174
+end
+
+def fun_l0_n419()
+    fun_l1_n500
+end
+
+def fun_l0_n420()
+    fun_l1_n904
+end
+
+def fun_l0_n421()
+    fun_l1_n971
+end
+
+def fun_l0_n422()
+    fun_l1_n438
+end
+
+def fun_l0_n423()
+    fun_l1_n524
+end
+
+def fun_l0_n424()
+    fun_l1_n537
+end
+
+def fun_l0_n425()
+    fun_l1_n564
+end
+
+def fun_l0_n426()
+    fun_l1_n378
+end
+
+def fun_l0_n427()
+    fun_l1_n603
+end
+
+def fun_l0_n428()
+    fun_l1_n442
+end
+
+def fun_l0_n429()
+    fun_l1_n687
+end
+
+def fun_l0_n430()
+    fun_l1_n682
+end
+
+def fun_l0_n431()
+    fun_l1_n664
+end
+
+def fun_l0_n432()
+    fun_l1_n319
+end
+
+def fun_l0_n433()
+    fun_l1_n671
+end
+
+def fun_l0_n434()
+    fun_l1_n211
+end
+
+def fun_l0_n435()
+    fun_l1_n65
+end
+
+def fun_l0_n436()
+    fun_l1_n2
+end
+
+def fun_l0_n437()
+    fun_l1_n36
+end
+
+def fun_l0_n438()
+    fun_l1_n270
+end
+
+def fun_l0_n439()
+    fun_l1_n793
+end
+
+def fun_l0_n440()
+    fun_l1_n312
+end
+
+def fun_l0_n441()
+    fun_l1_n134
+end
+
+def fun_l0_n442()
+    fun_l1_n246
+end
+
+def fun_l0_n443()
+    fun_l1_n498
+end
+
+def fun_l0_n444()
+    fun_l1_n606
+end
+
+def fun_l0_n445()
+    fun_l1_n986
+end
+
+def fun_l0_n446()
+    fun_l1_n659
+end
+
+def fun_l0_n447()
+    fun_l1_n823
+end
+
+def fun_l0_n448()
+    fun_l1_n635
+end
+
+def fun_l0_n449()
+    fun_l1_n388
+end
+
+def fun_l0_n450()
+    fun_l1_n474
+end
+
+def fun_l0_n451()
+    fun_l1_n742
+end
+
+def fun_l0_n452()
+    fun_l1_n605
+end
+
+def fun_l0_n453()
+    fun_l1_n0
+end
+
+def fun_l0_n454()
+    fun_l1_n691
+end
+
+def fun_l0_n455()
+    fun_l1_n791
+end
+
+def fun_l0_n456()
+    fun_l1_n363
+end
+
+def fun_l0_n457()
+    fun_l1_n370
+end
+
+def fun_l0_n458()
+    fun_l1_n168
+end
+
+def fun_l0_n459()
+    fun_l1_n626
+end
+
+def fun_l0_n460()
+    fun_l1_n139
+end
+
+def fun_l0_n461()
+    fun_l1_n708
+end
+
+def fun_l0_n462()
+    fun_l1_n77
+end
+
+def fun_l0_n463()
+    fun_l1_n27
+end
+
+def fun_l0_n464()
+    fun_l1_n706
+end
+
+def fun_l0_n465()
+    fun_l1_n29
+end
+
+def fun_l0_n466()
+    fun_l1_n470
+end
+
+def fun_l0_n467()
+    fun_l1_n606
+end
+
+def fun_l0_n468()
+    fun_l1_n458
+end
+
+def fun_l0_n469()
+    fun_l1_n465
+end
+
+def fun_l0_n470()
+    fun_l1_n23
+end
+
+def fun_l0_n471()
+    fun_l1_n364
+end
+
+def fun_l0_n472()
+    fun_l1_n606
+end
+
+def fun_l0_n473()
+    fun_l1_n109
+end
+
+def fun_l0_n474()
+    fun_l1_n904
+end
+
+def fun_l0_n475()
+    fun_l1_n923
+end
+
+def fun_l0_n476()
+    fun_l1_n19
+end
+
+def fun_l0_n477()
+    fun_l1_n871
+end
+
+def fun_l0_n478()
+    fun_l1_n422
+end
+
+def fun_l0_n479()
+    fun_l1_n72
+end
+
+def fun_l0_n480()
+    fun_l1_n528
+end
+
+def fun_l0_n481()
+    fun_l1_n181
+end
+
+def fun_l0_n482()
+    fun_l1_n33
+end
+
+def fun_l0_n483()
+    fun_l1_n951
+end
+
+def fun_l0_n484()
+    fun_l1_n747
+end
+
+def fun_l0_n485()
+    fun_l1_n200
+end
+
+def fun_l0_n486()
+    fun_l1_n474
+end
+
+def fun_l0_n487()
+    fun_l1_n126
+end
+
+def fun_l0_n488()
+    fun_l1_n757
+end
+
+def fun_l0_n489()
+    fun_l1_n101
+end
+
+def fun_l0_n490()
+    fun_l1_n925
+end
+
+def fun_l0_n491()
+    fun_l1_n791
+end
+
+def fun_l0_n492()
+    fun_l1_n404
+end
+
+def fun_l0_n493()
+    fun_l1_n841
+end
+
+def fun_l0_n494()
+    fun_l1_n774
+end
+
+def fun_l0_n495()
+    fun_l1_n230
+end
+
+def fun_l0_n496()
+    fun_l1_n796
+end
+
+def fun_l0_n497()
+    fun_l1_n270
+end
+
+def fun_l0_n498()
+    fun_l1_n795
+end
+
+def fun_l0_n499()
+    fun_l1_n628
+end
+
+def fun_l0_n500()
+    fun_l1_n865
+end
+
+def fun_l0_n501()
+    fun_l1_n105
+end
+
+def fun_l0_n502()
+    fun_l1_n538
+end
+
+def fun_l0_n503()
+    fun_l1_n769
+end
+
+def fun_l0_n504()
+    fun_l1_n714
+end
+
+def fun_l0_n505()
+    fun_l1_n889
+end
+
+def fun_l0_n506()
+    fun_l1_n191
+end
+
+def fun_l0_n507()
+    fun_l1_n966
+end
+
+def fun_l0_n508()
+    fun_l1_n196
+end
+
+def fun_l0_n509()
+    fun_l1_n878
+end
+
+def fun_l0_n510()
+    fun_l1_n487
+end
+
+def fun_l0_n511()
+    fun_l1_n242
+end
+
+def fun_l0_n512()
+    fun_l1_n740
+end
+
+def fun_l0_n513()
+    fun_l1_n938
+end
+
+def fun_l0_n514()
+    fun_l1_n485
+end
+
+def fun_l0_n515()
+    fun_l1_n380
+end
+
+def fun_l0_n516()
+    fun_l1_n936
+end
+
+def fun_l0_n517()
+    fun_l1_n237
+end
+
+def fun_l0_n518()
+    fun_l1_n79
+end
+
+def fun_l0_n519()
+    fun_l1_n501
+end
+
+def fun_l0_n520()
+    fun_l1_n966
+end
+
+def fun_l0_n521()
+    fun_l1_n741
+end
+
+def fun_l0_n522()
+    fun_l1_n170
+end
+
+def fun_l0_n523()
+    fun_l1_n183
+end
+
+def fun_l0_n524()
+    fun_l1_n556
+end
+
+def fun_l0_n525()
+    fun_l1_n865
+end
+
+def fun_l0_n526()
+    fun_l1_n884
+end
+
+def fun_l0_n527()
+    fun_l1_n725
+end
+
+def fun_l0_n528()
+    fun_l1_n205
+end
+
+def fun_l0_n529()
+    fun_l1_n72
+end
+
+def fun_l0_n530()
+    fun_l1_n432
+end
+
+def fun_l0_n531()
+    fun_l1_n90
+end
+
+def fun_l0_n532()
+    fun_l1_n189
+end
+
+def fun_l0_n533()
+    fun_l1_n395
+end
+
+def fun_l0_n534()
+    fun_l1_n201
+end
+
+def fun_l0_n535()
+    fun_l1_n534
+end
+
+def fun_l0_n536()
+    fun_l1_n748
+end
+
+def fun_l0_n537()
+    fun_l1_n439
+end
+
+def fun_l0_n538()
+    fun_l1_n495
+end
+
+def fun_l0_n539()
+    fun_l1_n904
+end
+
+def fun_l0_n540()
+    fun_l1_n525
+end
+
+def fun_l0_n541()
+    fun_l1_n924
+end
+
+def fun_l0_n542()
+    fun_l1_n549
+end
+
+def fun_l0_n543()
+    fun_l1_n2
+end
+
+def fun_l0_n544()
+    fun_l1_n257
+end
+
+def fun_l0_n545()
+    fun_l1_n921
+end
+
+def fun_l0_n546()
+    fun_l1_n82
+end
+
+def fun_l0_n547()
+    fun_l1_n384
+end
+
+def fun_l0_n548()
+    fun_l1_n219
+end
+
+def fun_l0_n549()
+    fun_l1_n379
+end
+
+def fun_l0_n550()
+    fun_l1_n488
+end
+
+def fun_l0_n551()
+    fun_l1_n4
+end
+
+def fun_l0_n552()
+    fun_l1_n150
+end
+
+def fun_l0_n553()
+    fun_l1_n168
+end
+
+def fun_l0_n554()
+    fun_l1_n773
+end
+
+def fun_l0_n555()
+    fun_l1_n444
+end
+
+def fun_l0_n556()
+    fun_l1_n201
+end
+
+def fun_l0_n557()
+    fun_l1_n333
+end
+
+def fun_l0_n558()
+    fun_l1_n556
+end
+
+def fun_l0_n559()
+    fun_l1_n394
+end
+
+def fun_l0_n560()
+    fun_l1_n540
+end
+
+def fun_l0_n561()
+    fun_l1_n640
+end
+
+def fun_l0_n562()
+    fun_l1_n321
+end
+
+def fun_l0_n563()
+    fun_l1_n286
+end
+
+def fun_l0_n564()
+    fun_l1_n320
+end
+
+def fun_l0_n565()
+    fun_l1_n2
+end
+
+def fun_l0_n566()
+    fun_l1_n50
+end
+
+def fun_l0_n567()
+    fun_l1_n269
+end
+
+def fun_l0_n568()
+    fun_l1_n412
+end
+
+def fun_l0_n569()
+    fun_l1_n984
+end
+
+def fun_l0_n570()
+    fun_l1_n307
+end
+
+def fun_l0_n571()
+    fun_l1_n954
+end
+
+def fun_l0_n572()
+    fun_l1_n728
+end
+
+def fun_l0_n573()
+    fun_l1_n227
+end
+
+def fun_l0_n574()
+    fun_l1_n917
+end
+
+def fun_l0_n575()
+    fun_l1_n974
+end
+
+def fun_l0_n576()
+    fun_l1_n995
+end
+
+def fun_l0_n577()
+    fun_l1_n593
+end
+
+def fun_l0_n578()
+    fun_l1_n704
+end
+
+def fun_l0_n579()
+    fun_l1_n142
+end
+
+def fun_l0_n580()
+    fun_l1_n585
+end
+
+def fun_l0_n581()
+    fun_l1_n634
+end
+
+def fun_l0_n582()
+    fun_l1_n888
+end
+
+def fun_l0_n583()
+    fun_l1_n873
+end
+
+def fun_l0_n584()
+    fun_l1_n674
+end
+
+def fun_l0_n585()
+    fun_l1_n657
+end
+
+def fun_l0_n586()
+    fun_l1_n248
+end
+
+def fun_l0_n587()
+    fun_l1_n478
+end
+
+def fun_l0_n588()
+    fun_l1_n263
+end
+
+def fun_l0_n589()
+    fun_l1_n908
+end
+
+def fun_l0_n590()
+    fun_l1_n741
+end
+
+def fun_l0_n591()
+    fun_l1_n299
+end
+
+def fun_l0_n592()
+    fun_l1_n763
+end
+
+def fun_l0_n593()
+    fun_l1_n746
+end
+
+def fun_l0_n594()
+    fun_l1_n367
+end
+
+def fun_l0_n595()
+    fun_l1_n394
+end
+
+def fun_l0_n596()
+    fun_l1_n304
+end
+
+def fun_l0_n597()
+    fun_l1_n939
+end
+
+def fun_l0_n598()
+    fun_l1_n392
+end
+
+def fun_l0_n599()
+    fun_l1_n758
+end
+
+def fun_l0_n600()
+    fun_l1_n133
+end
+
+def fun_l0_n601()
+    fun_l1_n212
+end
+
+def fun_l0_n602()
+    fun_l1_n719
+end
+
+def fun_l0_n603()
+    fun_l1_n952
+end
+
+def fun_l0_n604()
+    fun_l1_n818
+end
+
+def fun_l0_n605()
+    fun_l1_n216
+end
+
+def fun_l0_n606()
+    fun_l1_n438
+end
+
+def fun_l0_n607()
+    fun_l1_n315
+end
+
+def fun_l0_n608()
+    fun_l1_n450
+end
+
+def fun_l0_n609()
+    fun_l1_n420
+end
+
+def fun_l0_n610()
+    fun_l1_n917
+end
+
+def fun_l0_n611()
+    fun_l1_n921
+end
+
+def fun_l0_n612()
+    fun_l1_n596
+end
+
+def fun_l0_n613()
+    fun_l1_n253
+end
+
+def fun_l0_n614()
+    fun_l1_n395
+end
+
+def fun_l0_n615()
+    fun_l1_n120
+end
+
+def fun_l0_n616()
+    fun_l1_n742
+end
+
+def fun_l0_n617()
+    fun_l1_n489
+end
+
+def fun_l0_n618()
+    fun_l1_n338
+end
+
+def fun_l0_n619()
+    fun_l1_n351
+end
+
+def fun_l0_n620()
+    fun_l1_n384
+end
+
+def fun_l0_n621()
+    fun_l1_n581
+end
+
+def fun_l0_n622()
+    fun_l1_n667
+end
+
+def fun_l0_n623()
+    fun_l1_n956
+end
+
+def fun_l0_n624()
+    fun_l1_n156
+end
+
+def fun_l0_n625()
+    fun_l1_n909
+end
+
+def fun_l0_n626()
+    fun_l1_n548
+end
+
+def fun_l0_n627()
+    fun_l1_n293
+end
+
+def fun_l0_n628()
+    fun_l1_n997
+end
+
+def fun_l0_n629()
+    fun_l1_n950
+end
+
+def fun_l0_n630()
+    fun_l1_n761
+end
+
+def fun_l0_n631()
+    fun_l1_n72
+end
+
+def fun_l0_n632()
+    fun_l1_n213
+end
+
+def fun_l0_n633()
+    fun_l1_n746
+end
+
+def fun_l0_n634()
+    fun_l1_n327
+end
+
+def fun_l0_n635()
+    fun_l1_n166
+end
+
+def fun_l0_n636()
+    fun_l1_n749
+end
+
+def fun_l0_n637()
+    fun_l1_n196
+end
+
+def fun_l0_n638()
+    fun_l1_n786
+end
+
+def fun_l0_n639()
+    fun_l1_n613
+end
+
+def fun_l0_n640()
+    fun_l1_n903
+end
+
+def fun_l0_n641()
+    fun_l1_n836
+end
+
+def fun_l0_n642()
+    fun_l1_n687
+end
+
+def fun_l0_n643()
+    fun_l1_n533
+end
+
+def fun_l0_n644()
+    fun_l1_n544
+end
+
+def fun_l0_n645()
+    fun_l1_n637
+end
+
+def fun_l0_n646()
+    fun_l1_n859
+end
+
+def fun_l0_n647()
+    fun_l1_n917
+end
+
+def fun_l0_n648()
+    fun_l1_n119
+end
+
+def fun_l0_n649()
+    fun_l1_n327
+end
+
+def fun_l0_n650()
+    fun_l1_n759
+end
+
+def fun_l0_n651()
+    fun_l1_n169
+end
+
+def fun_l0_n652()
+    fun_l1_n497
+end
+
+def fun_l0_n653()
+    fun_l1_n441
+end
+
+def fun_l0_n654()
+    fun_l1_n151
+end
+
+def fun_l0_n655()
+    fun_l1_n553
+end
+
+def fun_l0_n656()
+    fun_l1_n441
+end
+
+def fun_l0_n657()
+    fun_l1_n390
+end
+
+def fun_l0_n658()
+    fun_l1_n615
+end
+
+def fun_l0_n659()
+    fun_l1_n578
+end
+
+def fun_l0_n660()
+    fun_l1_n873
+end
+
+def fun_l0_n661()
+    fun_l1_n608
+end
+
+def fun_l0_n662()
+    fun_l1_n446
+end
+
+def fun_l0_n663()
+    fun_l1_n647
+end
+
+def fun_l0_n664()
+    fun_l1_n601
+end
+
+def fun_l0_n665()
+    fun_l1_n945
+end
+
+def fun_l0_n666()
+    fun_l1_n172
+end
+
+def fun_l0_n667()
+    fun_l1_n547
+end
+
+def fun_l0_n668()
+    fun_l1_n977
+end
+
+def fun_l0_n669()
+    fun_l1_n419
+end
+
+def fun_l0_n670()
+    fun_l1_n626
+end
+
+def fun_l0_n671()
+    fun_l1_n345
+end
+
+def fun_l0_n672()
+    fun_l1_n899
+end
+
+def fun_l0_n673()
+    fun_l1_n442
+end
+
+def fun_l0_n674()
+    fun_l1_n296
+end
+
+def fun_l0_n675()
+    fun_l1_n303
+end
+
+def fun_l0_n676()
+    fun_l1_n679
+end
+
+def fun_l0_n677()
+    fun_l1_n655
+end
+
+def fun_l0_n678()
+    fun_l1_n998
+end
+
+def fun_l0_n679()
+    fun_l1_n157
+end
+
+def fun_l0_n680()
+    fun_l1_n705
+end
+
+def fun_l0_n681()
+    fun_l1_n832
+end
+
+def fun_l0_n682()
+    fun_l1_n113
+end
+
+def fun_l0_n683()
+    fun_l1_n550
+end
+
+def fun_l0_n684()
+    fun_l1_n21
+end
+
+def fun_l0_n685()
+    fun_l1_n21
+end
+
+def fun_l0_n686()
+    fun_l1_n195
+end
+
+def fun_l0_n687()
+    fun_l1_n269
+end
+
+def fun_l0_n688()
+    fun_l1_n12
+end
+
+def fun_l0_n689()
+    fun_l1_n49
+end
+
+def fun_l0_n690()
+    fun_l1_n836
+end
+
+def fun_l0_n691()
+    fun_l1_n808
+end
+
+def fun_l0_n692()
+    fun_l1_n938
+end
+
+def fun_l0_n693()
+    fun_l1_n531
+end
+
+def fun_l0_n694()
+    fun_l1_n296
+end
+
+def fun_l0_n695()
+    fun_l1_n32
+end
+
+def fun_l0_n696()
+    fun_l1_n641
+end
+
+def fun_l0_n697()
+    fun_l1_n549
+end
+
+def fun_l0_n698()
+    fun_l1_n437
+end
+
+def fun_l0_n699()
+    fun_l1_n133
+end
+
+def fun_l0_n700()
+    fun_l1_n734
+end
+
+def fun_l0_n701()
+    fun_l1_n340
+end
+
+def fun_l0_n702()
+    fun_l1_n768
+end
+
+def fun_l0_n703()
+    fun_l1_n97
+end
+
+def fun_l0_n704()
+    fun_l1_n52
+end
+
+def fun_l0_n705()
+    fun_l1_n121
+end
+
+def fun_l0_n706()
+    fun_l1_n471
+end
+
+def fun_l0_n707()
+    fun_l1_n94
+end
+
+def fun_l0_n708()
+    fun_l1_n946
+end
+
+def fun_l0_n709()
+    fun_l1_n151
+end
+
+def fun_l0_n710()
+    fun_l1_n946
+end
+
+def fun_l0_n711()
+    fun_l1_n191
+end
+
+def fun_l0_n712()
+    fun_l1_n552
+end
+
+def fun_l0_n713()
+    fun_l1_n733
+end
+
+def fun_l0_n714()
+    fun_l1_n895
+end
+
+def fun_l0_n715()
+    fun_l1_n850
+end
+
+def fun_l0_n716()
+    fun_l1_n113
+end
+
+def fun_l0_n717()
+    fun_l1_n69
+end
+
+def fun_l0_n718()
+    fun_l1_n862
+end
+
+def fun_l0_n719()
+    fun_l1_n635
+end
+
+def fun_l0_n720()
+    fun_l1_n714
+end
+
+def fun_l0_n721()
+    fun_l1_n179
+end
+
+def fun_l0_n722()
+    fun_l1_n17
+end
+
+def fun_l0_n723()
+    fun_l1_n299
+end
+
+def fun_l0_n724()
+    fun_l1_n141
+end
+
+def fun_l0_n725()
+    fun_l1_n338
+end
+
+def fun_l0_n726()
+    fun_l1_n650
+end
+
+def fun_l0_n727()
+    fun_l1_n784
+end
+
+def fun_l0_n728()
+    fun_l1_n333
+end
+
+def fun_l0_n729()
+    fun_l1_n10
+end
+
+def fun_l0_n730()
+    fun_l1_n271
+end
+
+def fun_l0_n731()
+    fun_l1_n882
+end
+
+def fun_l0_n732()
+    fun_l1_n512
+end
+
+def fun_l0_n733()
+    fun_l1_n932
+end
+
+def fun_l0_n734()
+    fun_l1_n68
+end
+
+def fun_l0_n735()
+    fun_l1_n111
+end
+
+def fun_l0_n736()
+    fun_l1_n649
+end
+
+def fun_l0_n737()
+    fun_l1_n512
+end
+
+def fun_l0_n738()
+    fun_l1_n551
+end
+
+def fun_l0_n739()
+    fun_l1_n153
+end
+
+def fun_l0_n740()
+    fun_l1_n582
+end
+
+def fun_l0_n741()
+    fun_l1_n366
+end
+
+def fun_l0_n742()
+    fun_l1_n135
+end
+
+def fun_l0_n743()
+    fun_l1_n136
+end
+
+def fun_l0_n744()
+    fun_l1_n782
+end
+
+def fun_l0_n745()
+    fun_l1_n258
+end
+
+def fun_l0_n746()
+    fun_l1_n44
+end
+
+def fun_l0_n747()
+    fun_l1_n379
+end
+
+def fun_l0_n748()
+    fun_l1_n14
+end
+
+def fun_l0_n749()
+    fun_l1_n563
+end
+
+def fun_l0_n750()
+    fun_l1_n361
+end
+
+def fun_l0_n751()
+    fun_l1_n624
+end
+
+def fun_l0_n752()
+    fun_l1_n516
+end
+
+def fun_l0_n753()
+    fun_l1_n944
+end
+
+def fun_l0_n754()
+    fun_l1_n783
+end
+
+def fun_l0_n755()
+    fun_l1_n744
+end
+
+def fun_l0_n756()
+    fun_l1_n500
+end
+
+def fun_l0_n757()
+    fun_l1_n809
+end
+
+def fun_l0_n758()
+    fun_l1_n757
+end
+
+def fun_l0_n759()
+    fun_l1_n995
+end
+
+def fun_l0_n760()
+    fun_l1_n114
+end
+
+def fun_l0_n761()
+    fun_l1_n802
+end
+
+def fun_l0_n762()
+    fun_l1_n114
+end
+
+def fun_l0_n763()
+    fun_l1_n683
+end
+
+def fun_l0_n764()
+    fun_l1_n775
+end
+
+def fun_l0_n765()
+    fun_l1_n967
+end
+
+def fun_l0_n766()
+    fun_l1_n499
+end
+
+def fun_l0_n767()
+    fun_l1_n561
+end
+
+def fun_l0_n768()
+    fun_l1_n206
+end
+
+def fun_l0_n769()
+    fun_l1_n738
+end
+
+def fun_l0_n770()
+    fun_l1_n953
+end
+
+def fun_l0_n771()
+    fun_l1_n394
+end
+
+def fun_l0_n772()
+    fun_l1_n393
+end
+
+def fun_l0_n773()
+    fun_l1_n226
+end
+
+def fun_l0_n774()
+    fun_l1_n363
+end
+
+def fun_l0_n775()
+    fun_l1_n928
+end
+
+def fun_l0_n776()
+    fun_l1_n213
+end
+
+def fun_l0_n777()
+    fun_l1_n3
+end
+
+def fun_l0_n778()
+    fun_l1_n656
+end
+
+def fun_l0_n779()
+    fun_l1_n927
+end
+
+def fun_l0_n780()
+    fun_l1_n406
+end
+
+def fun_l0_n781()
+    fun_l1_n589
+end
+
+def fun_l0_n782()
+    fun_l1_n56
+end
+
+def fun_l0_n783()
+    fun_l1_n280
+end
+
+def fun_l0_n784()
+    fun_l1_n156
+end
+
+def fun_l0_n785()
+    fun_l1_n257
+end
+
+def fun_l0_n786()
+    fun_l1_n269
+end
+
+def fun_l0_n787()
+    fun_l1_n453
+end
+
+def fun_l0_n788()
+    fun_l1_n293
+end
+
+def fun_l0_n789()
+    fun_l1_n570
+end
+
+def fun_l0_n790()
+    fun_l1_n194
+end
+
+def fun_l0_n791()
+    fun_l1_n120
+end
+
+def fun_l0_n792()
+    fun_l1_n976
+end
+
+def fun_l0_n793()
+    fun_l1_n115
+end
+
+def fun_l0_n794()
+    fun_l1_n74
+end
+
+def fun_l0_n795()
+    fun_l1_n25
+end
+
+def fun_l0_n796()
+    fun_l1_n288
+end
+
+def fun_l0_n797()
+    fun_l1_n49
+end
+
+def fun_l0_n798()
+    fun_l1_n237
+end
+
+def fun_l0_n799()
+    fun_l1_n481
+end
+
+def fun_l0_n800()
+    fun_l1_n329
+end
+
+def fun_l0_n801()
+    fun_l1_n907
+end
+
+def fun_l0_n802()
+    fun_l1_n804
+end
+
+def fun_l0_n803()
+    fun_l1_n8
+end
+
+def fun_l0_n804()
+    fun_l1_n270
+end
+
+def fun_l0_n805()
+    fun_l1_n315
+end
+
+def fun_l0_n806()
+    fun_l1_n941
+end
+
+def fun_l0_n807()
+    fun_l1_n343
+end
+
+def fun_l0_n808()
+    fun_l1_n817
+end
+
+def fun_l0_n809()
+    fun_l1_n315
+end
+
+def fun_l0_n810()
+    fun_l1_n156
+end
+
+def fun_l0_n811()
+    fun_l1_n689
+end
+
+def fun_l0_n812()
+    fun_l1_n644
+end
+
+def fun_l0_n813()
+    fun_l1_n158
+end
+
+def fun_l0_n814()
+    fun_l1_n588
+end
+
+def fun_l0_n815()
+    fun_l1_n820
+end
+
+def fun_l0_n816()
+    fun_l1_n86
+end
+
+def fun_l0_n817()
+    fun_l1_n176
+end
+
+def fun_l0_n818()
+    fun_l1_n611
+end
+
+def fun_l0_n819()
+    fun_l1_n816
+end
+
+def fun_l0_n820()
+    fun_l1_n332
+end
+
+def fun_l0_n821()
+    fun_l1_n170
+end
+
+def fun_l0_n822()
+    fun_l1_n483
+end
+
+def fun_l0_n823()
+    fun_l1_n768
+end
+
+def fun_l0_n824()
+    fun_l1_n825
+end
+
+def fun_l0_n825()
+    fun_l1_n114
+end
+
+def fun_l0_n826()
+    fun_l1_n102
+end
+
+def fun_l0_n827()
+    fun_l1_n963
+end
+
+def fun_l0_n828()
+    fun_l1_n202
+end
+
+def fun_l0_n829()
+    fun_l1_n708
+end
+
+def fun_l0_n830()
+    fun_l1_n350
+end
+
+def fun_l0_n831()
+    fun_l1_n976
+end
+
+def fun_l0_n832()
+    fun_l1_n834
+end
+
+def fun_l0_n833()
+    fun_l1_n342
+end
+
+def fun_l0_n834()
+    fun_l1_n764
+end
+
+def fun_l0_n835()
+    fun_l1_n211
+end
+
+def fun_l0_n836()
+    fun_l1_n173
+end
+
+def fun_l0_n837()
+    fun_l1_n988
+end
+
+def fun_l0_n838()
+    fun_l1_n369
+end
+
+def fun_l0_n839()
+    fun_l1_n481
+end
+
+def fun_l0_n840()
+    fun_l1_n580
+end
+
+def fun_l0_n841()
+    fun_l1_n255
+end
+
+def fun_l0_n842()
+    fun_l1_n476
+end
+
+def fun_l0_n843()
+    fun_l1_n795
+end
+
+def fun_l0_n844()
+    fun_l1_n296
+end
+
+def fun_l0_n845()
+    fun_l1_n880
+end
+
+def fun_l0_n846()
+    fun_l1_n457
+end
+
+def fun_l0_n847()
+    fun_l1_n88
+end
+
+def fun_l0_n848()
+    fun_l1_n901
+end
+
+def fun_l0_n849()
+    fun_l1_n988
+end
+
+def fun_l0_n850()
+    fun_l1_n396
+end
+
+def fun_l0_n851()
+    fun_l1_n60
+end
+
+def fun_l0_n852()
+    fun_l1_n738
+end
+
+def fun_l0_n853()
+    fun_l1_n2
+end
+
+def fun_l0_n854()
+    fun_l1_n652
+end
+
+def fun_l0_n855()
+    fun_l1_n982
+end
+
+def fun_l0_n856()
+    fun_l1_n987
+end
+
+def fun_l0_n857()
+    fun_l1_n488
+end
+
+def fun_l0_n858()
+    fun_l1_n354
+end
+
+def fun_l0_n859()
+    fun_l1_n320
+end
+
+def fun_l0_n860()
+    fun_l1_n378
+end
+
+def fun_l0_n861()
+    fun_l1_n965
+end
+
+def fun_l0_n862()
+    fun_l1_n858
+end
+
+def fun_l0_n863()
+    fun_l1_n360
+end
+
+def fun_l0_n864()
+    fun_l1_n812
+end
+
+def fun_l0_n865()
+    fun_l1_n590
+end
+
+def fun_l0_n866()
+    fun_l1_n339
+end
+
+def fun_l0_n867()
+    fun_l1_n365
+end
+
+def fun_l0_n868()
+    fun_l1_n190
+end
+
+def fun_l0_n869()
+    fun_l1_n555
+end
+
+def fun_l0_n870()
+    fun_l1_n676
+end
+
+def fun_l0_n871()
+    fun_l1_n681
+end
+
+def fun_l0_n872()
+    fun_l1_n283
+end
+
+def fun_l0_n873()
+    fun_l1_n865
+end
+
+def fun_l0_n874()
+    fun_l1_n402
+end
+
+def fun_l0_n875()
+    fun_l1_n530
+end
+
+def fun_l0_n876()
+    fun_l1_n25
+end
+
+def fun_l0_n877()
+    fun_l1_n10
+end
+
+def fun_l0_n878()
+    fun_l1_n252
+end
+
+def fun_l0_n879()
+    fun_l1_n174
+end
+
+def fun_l0_n880()
+    fun_l1_n449
+end
+
+def fun_l0_n881()
+    fun_l1_n385
+end
+
+def fun_l0_n882()
+    fun_l1_n689
+end
+
+def fun_l0_n883()
+    fun_l1_n492
+end
+
+def fun_l0_n884()
+    fun_l1_n949
+end
+
+def fun_l0_n885()
+    fun_l1_n912
+end
+
+def fun_l0_n886()
+    fun_l1_n131
+end
+
+def fun_l0_n887()
+    fun_l1_n484
+end
+
+def fun_l0_n888()
+    fun_l1_n647
+end
+
+def fun_l0_n889()
+    fun_l1_n679
+end
+
+def fun_l0_n890()
+    fun_l1_n16
+end
+
+def fun_l0_n891()
+    fun_l1_n745
+end
+
+def fun_l0_n892()
+    fun_l1_n490
+end
+
+def fun_l0_n893()
+    fun_l1_n104
+end
+
+def fun_l0_n894()
+    fun_l1_n91
+end
+
+def fun_l0_n895()
+    fun_l1_n368
+end
+
+def fun_l0_n896()
+    fun_l1_n439
+end
+
+def fun_l0_n897()
+    fun_l1_n23
+end
+
+def fun_l0_n898()
+    fun_l1_n277
+end
+
+def fun_l0_n899()
+    fun_l1_n597
+end
+
+def fun_l0_n900()
+    fun_l1_n644
+end
+
+def fun_l0_n901()
+    fun_l1_n255
+end
+
+def fun_l0_n902()
+    fun_l1_n767
+end
+
+def fun_l0_n903()
+    fun_l1_n417
+end
+
+def fun_l0_n904()
+    fun_l1_n517
+end
+
+def fun_l0_n905()
+    fun_l1_n609
+end
+
+def fun_l0_n906()
+    fun_l1_n498
+end
+
+def fun_l0_n907()
+    fun_l1_n24
+end
+
+def fun_l0_n908()
+    fun_l1_n722
+end
+
+def fun_l0_n909()
+    fun_l1_n494
+end
+
+def fun_l0_n910()
+    fun_l1_n450
+end
+
+def fun_l0_n911()
+    fun_l1_n302
+end
+
+def fun_l0_n912()
+    fun_l1_n801
+end
+
+def fun_l0_n913()
+    fun_l1_n709
+end
+
+def fun_l0_n914()
+    fun_l1_n555
+end
+
+def fun_l0_n915()
+    fun_l1_n955
+end
+
+def fun_l0_n916()
+    fun_l1_n310
+end
+
+def fun_l0_n917()
+    fun_l1_n839
+end
+
+def fun_l0_n918()
+    fun_l1_n590
+end
+
+def fun_l0_n919()
+    fun_l1_n83
+end
+
+def fun_l0_n920()
+    fun_l1_n335
+end
+
+def fun_l0_n921()
+    fun_l1_n740
+end
+
+def fun_l0_n922()
+    fun_l1_n357
+end
+
+def fun_l0_n923()
+    fun_l1_n312
+end
+
+def fun_l0_n924()
+    fun_l1_n544
+end
+
+def fun_l0_n925()
+    fun_l1_n611
+end
+
+def fun_l0_n926()
+    fun_l1_n651
+end
+
+def fun_l0_n927()
+    fun_l1_n730
+end
+
+def fun_l0_n928()
+    fun_l1_n623
+end
+
+def fun_l0_n929()
+    fun_l1_n337
+end
+
+def fun_l0_n930()
+    fun_l1_n574
+end
+
+def fun_l0_n931()
+    fun_l1_n795
+end
+
+def fun_l0_n932()
+    fun_l1_n224
+end
+
+def fun_l0_n933()
+    fun_l1_n355
+end
+
+def fun_l0_n934()
+    fun_l1_n286
+end
+
+def fun_l0_n935()
+    fun_l1_n893
+end
+
+def fun_l0_n936()
+    fun_l1_n278
+end
+
+def fun_l0_n937()
+    fun_l1_n970
+end
+
+def fun_l0_n938()
+    fun_l1_n761
+end
+
+def fun_l0_n939()
+    fun_l1_n244
+end
+
+def fun_l0_n940()
+    fun_l1_n381
+end
+
+def fun_l0_n941()
+    fun_l1_n661
+end
+
+def fun_l0_n942()
+    fun_l1_n543
+end
+
+def fun_l0_n943()
+    fun_l1_n432
+end
+
+def fun_l0_n944()
+    fun_l1_n237
+end
+
+def fun_l0_n945()
+    fun_l1_n815
+end
+
+def fun_l0_n946()
+    fun_l1_n580
+end
+
+def fun_l0_n947()
+    fun_l1_n99
+end
+
+def fun_l0_n948()
+    fun_l1_n492
+end
+
+def fun_l0_n949()
+    fun_l1_n799
+end
+
+def fun_l0_n950()
+    fun_l1_n727
+end
+
+def fun_l0_n951()
+    fun_l1_n632
+end
+
+def fun_l0_n952()
+    fun_l1_n689
+end
+
+def fun_l0_n953()
+    fun_l1_n69
+end
+
+def fun_l0_n954()
+    fun_l1_n782
+end
+
+def fun_l0_n955()
+    fun_l1_n140
+end
+
+def fun_l0_n956()
+    fun_l1_n451
+end
+
+def fun_l0_n957()
+    fun_l1_n440
+end
+
+def fun_l0_n958()
+    fun_l1_n88
+end
+
+def fun_l0_n959()
+    fun_l1_n775
+end
+
+def fun_l0_n960()
+    fun_l1_n455
+end
+
+def fun_l0_n961()
+    fun_l1_n402
+end
+
+def fun_l0_n962()
+    fun_l1_n906
+end
+
+def fun_l0_n963()
+    fun_l1_n990
+end
+
+def fun_l0_n964()
+    fun_l1_n432
+end
+
+def fun_l0_n965()
+    fun_l1_n419
+end
+
+def fun_l0_n966()
+    fun_l1_n568
+end
+
+def fun_l0_n967()
+    fun_l1_n177
+end
+
+def fun_l0_n968()
+    fun_l1_n206
+end
+
+def fun_l0_n969()
+    fun_l1_n170
+end
+
+def fun_l0_n970()
+    fun_l1_n216
+end
+
+def fun_l0_n971()
+    fun_l1_n700
+end
+
+def fun_l0_n972()
+    fun_l1_n286
+end
+
+def fun_l0_n973()
+    fun_l1_n817
+end
+
+def fun_l0_n974()
+    fun_l1_n605
+end
+
+def fun_l0_n975()
+    fun_l1_n400
+end
+
+def fun_l0_n976()
+    fun_l1_n282
+end
+
+def fun_l0_n977()
+    fun_l1_n978
+end
+
+def fun_l0_n978()
+    fun_l1_n661
+end
+
+def fun_l0_n979()
+    fun_l1_n42
+end
+
+def fun_l0_n980()
+    fun_l1_n1
+end
+
+def fun_l0_n981()
+    fun_l1_n864
+end
+
+def fun_l0_n982()
+    fun_l1_n829
+end
+
+def fun_l0_n983()
+    fun_l1_n713
+end
+
+def fun_l0_n984()
+    fun_l1_n653
+end
+
+def fun_l0_n985()
+    fun_l1_n332
+end
+
+def fun_l0_n986()
+    fun_l1_n21
+end
+
+def fun_l0_n987()
+    fun_l1_n532
+end
+
+def fun_l0_n988()
+    fun_l1_n163
+end
+
+def fun_l0_n989()
+    fun_l1_n154
+end
+
+def fun_l0_n990()
+    fun_l1_n351
+end
+
+def fun_l0_n991()
+    fun_l1_n708
+end
+
+def fun_l0_n992()
+    fun_l1_n955
+end
+
+def fun_l0_n993()
+    fun_l1_n250
+end
+
+def fun_l0_n994()
+    fun_l1_n645
+end
+
+def fun_l0_n995()
+    fun_l1_n668
+end
+
+def fun_l0_n996()
+    fun_l1_n764
+end
+
+def fun_l0_n997()
+    fun_l1_n79
+end
+
+def fun_l0_n998()
+    fun_l1_n251
+end
+
+def fun_l0_n999()
+    fun_l1_n586
+end
+
+def fun_l1_n0()
+    fun_l2_n188
+end
+
+def fun_l1_n1()
+    fun_l2_n165
+end
+
+def fun_l1_n2()
+    fun_l2_n875
+end
+
+def fun_l1_n3()
+    fun_l2_n246
+end
+
+def fun_l1_n4()
+    fun_l2_n887
+end
+
+def fun_l1_n5()
+    fun_l2_n191
+end
+
+def fun_l1_n6()
+    fun_l2_n187
+end
+
+def fun_l1_n7()
+    fun_l2_n138
+end
+
+def fun_l1_n8()
+    fun_l2_n455
+end
+
+def fun_l1_n9()
+    fun_l2_n861
+end
+
+def fun_l1_n10()
+    fun_l2_n588
+end
+
+def fun_l1_n11()
+    fun_l2_n157
+end
+
+def fun_l1_n12()
+    fun_l2_n903
+end
+
+def fun_l1_n13()
+    fun_l2_n655
+end
+
+def fun_l1_n14()
+    fun_l2_n252
+end
+
+def fun_l1_n15()
+    fun_l2_n894
+end
+
+def fun_l1_n16()
+    fun_l2_n908
+end
+
+def fun_l1_n17()
+    fun_l2_n649
+end
+
+def fun_l1_n18()
+    fun_l2_n890
+end
+
+def fun_l1_n19()
+    fun_l2_n451
+end
+
+def fun_l1_n20()
+    fun_l2_n775
+end
+
+def fun_l1_n21()
+    fun_l2_n522
+end
+
+def fun_l1_n22()
+    fun_l2_n666
+end
+
+def fun_l1_n23()
+    fun_l2_n784
+end
+
+def fun_l1_n24()
+    fun_l2_n204
+end
+
+def fun_l1_n25()
+    fun_l2_n310
+end
+
+def fun_l1_n26()
+    fun_l2_n740
+end
+
+def fun_l1_n27()
+    fun_l2_n22
+end
+
+def fun_l1_n28()
+    fun_l2_n114
+end
+
+def fun_l1_n29()
+    fun_l2_n132
+end
+
+def fun_l1_n30()
+    fun_l2_n935
+end
+
+def fun_l1_n31()
+    fun_l2_n459
+end
+
+def fun_l1_n32()
+    fun_l2_n262
+end
+
+def fun_l1_n33()
+    fun_l2_n22
+end
+
+def fun_l1_n34()
+    fun_l2_n649
+end
+
+def fun_l1_n35()
+    fun_l2_n817
+end
+
+def fun_l1_n36()
+    fun_l2_n17
+end
+
+def fun_l1_n37()
+    fun_l2_n685
+end
+
+def fun_l1_n38()
+    fun_l2_n118
+end
+
+def fun_l1_n39()
+    fun_l2_n285
+end
+
+def fun_l1_n40()
+    fun_l2_n186
+end
+
+def fun_l1_n41()
+    fun_l2_n318
+end
+
+def fun_l1_n42()
+    fun_l2_n133
+end
+
+def fun_l1_n43()
+    fun_l2_n364
+end
+
+def fun_l1_n44()
+    fun_l2_n672
+end
+
+def fun_l1_n45()
+    fun_l2_n710
+end
+
+def fun_l1_n46()
+    fun_l2_n568
+end
+
+def fun_l1_n47()
+    fun_l2_n923
+end
+
+def fun_l1_n48()
+    fun_l2_n664
+end
+
+def fun_l1_n49()
+    fun_l2_n460
+end
+
+def fun_l1_n50()
+    fun_l2_n900
+end
+
+def fun_l1_n51()
+    fun_l2_n144
+end
+
+def fun_l1_n52()
+    fun_l2_n798
+end
+
+def fun_l1_n53()
+    fun_l2_n529
+end
+
+def fun_l1_n54()
+    fun_l2_n547
+end
+
+def fun_l1_n55()
+    fun_l2_n643
+end
+
+def fun_l1_n56()
+    fun_l2_n454
+end
+
+def fun_l1_n57()
+    fun_l2_n210
+end
+
+def fun_l1_n58()
+    fun_l2_n69
+end
+
+def fun_l1_n59()
+    fun_l2_n140
+end
+
+def fun_l1_n60()
+    fun_l2_n844
+end
+
+def fun_l1_n61()
+    fun_l2_n933
+end
+
+def fun_l1_n62()
+    fun_l2_n569
+end
+
+def fun_l1_n63()
+    fun_l2_n596
+end
+
+def fun_l1_n64()
+    fun_l2_n254
+end
+
+def fun_l1_n65()
+    fun_l2_n838
+end
+
+def fun_l1_n66()
+    fun_l2_n796
+end
+
+def fun_l1_n67()
+    fun_l2_n262
+end
+
+def fun_l1_n68()
+    fun_l2_n379
+end
+
+def fun_l1_n69()
+    fun_l2_n700
+end
+
+def fun_l1_n70()
+    fun_l2_n947
+end
+
+def fun_l1_n71()
+    fun_l2_n226
+end
+
+def fun_l1_n72()
+    fun_l2_n550
+end
+
+def fun_l1_n73()
+    fun_l2_n791
+end
+
+def fun_l1_n74()
+    fun_l2_n252
+end
+
+def fun_l1_n75()
+    fun_l2_n347
+end
+
+def fun_l1_n76()
+    fun_l2_n812
+end
+
+def fun_l1_n77()
+    fun_l2_n14
+end
+
+def fun_l1_n78()
+    fun_l2_n19
+end
+
+def fun_l1_n79()
+    fun_l2_n296
+end
+
+def fun_l1_n80()
+    fun_l2_n217
+end
+
+def fun_l1_n81()
+    fun_l2_n979
+end
+
+def fun_l1_n82()
+    fun_l2_n815
+end
+
+def fun_l1_n83()
+    fun_l2_n879
+end
+
+def fun_l1_n84()
+    fun_l2_n311
+end
+
+def fun_l1_n85()
+    fun_l2_n351
+end
+
+def fun_l1_n86()
+    fun_l2_n997
+end
+
+def fun_l1_n87()
+    fun_l2_n551
+end
+
+def fun_l1_n88()
+    fun_l2_n221
+end
+
+def fun_l1_n89()
+    fun_l2_n869
+end
+
+def fun_l1_n90()
+    fun_l2_n700
+end
+
+def fun_l1_n91()
+    fun_l2_n627
+end
+
+def fun_l1_n92()
+    fun_l2_n106
+end
+
+def fun_l1_n93()
+    fun_l2_n731
+end
+
+def fun_l1_n94()
+    fun_l2_n61
+end
+
+def fun_l1_n95()
+    fun_l2_n386
+end
+
+def fun_l1_n96()
+    fun_l2_n960
+end
+
+def fun_l1_n97()
+    fun_l2_n75
+end
+
+def fun_l1_n98()
+    fun_l2_n896
+end
+
+def fun_l1_n99()
+    fun_l2_n597
+end
+
+def fun_l1_n100()
+    fun_l2_n73
+end
+
+def fun_l1_n101()
+    fun_l2_n78
+end
+
+def fun_l1_n102()
+    fun_l2_n919
+end
+
+def fun_l1_n103()
+    fun_l2_n784
+end
+
+def fun_l1_n104()
+    fun_l2_n798
+end
+
+def fun_l1_n105()
+    fun_l2_n478
+end
+
+def fun_l1_n106()
+    fun_l2_n883
+end
+
+def fun_l1_n107()
+    fun_l2_n855
+end
+
+def fun_l1_n108()
+    fun_l2_n581
+end
+
+def fun_l1_n109()
+    fun_l2_n694
+end
+
+def fun_l1_n110()
+    fun_l2_n490
+end
+
+def fun_l1_n111()
+    fun_l2_n44
+end
+
+def fun_l1_n112()
+    fun_l2_n537
+end
+
+def fun_l1_n113()
+    fun_l2_n21
+end
+
+def fun_l1_n114()
+    fun_l2_n312
+end
+
+def fun_l1_n115()
+    fun_l2_n700
+end
+
+def fun_l1_n116()
+    fun_l2_n227
+end
+
+def fun_l1_n117()
+    fun_l2_n689
+end
+
+def fun_l1_n118()
+    fun_l2_n664
+end
+
+def fun_l1_n119()
+    fun_l2_n669
+end
+
+def fun_l1_n120()
+    fun_l2_n306
+end
+
+def fun_l1_n121()
+    fun_l2_n278
+end
+
+def fun_l1_n122()
+    fun_l2_n312
+end
+
+def fun_l1_n123()
+    fun_l2_n416
+end
+
+def fun_l1_n124()
+    fun_l2_n912
+end
+
+def fun_l1_n125()
+    fun_l2_n135
+end
+
+def fun_l1_n126()
+    fun_l2_n814
+end
+
+def fun_l1_n127()
+    fun_l2_n468
+end
+
+def fun_l1_n128()
+    fun_l2_n342
+end
+
+def fun_l1_n129()
+    fun_l2_n584
+end
+
+def fun_l1_n130()
+    fun_l2_n826
+end
+
+def fun_l1_n131()
+    fun_l2_n361
+end
+
+def fun_l1_n132()
+    fun_l2_n517
+end
+
+def fun_l1_n133()
+    fun_l2_n894
+end
+
+def fun_l1_n134()
+    fun_l2_n40
+end
+
+def fun_l1_n135()
+    fun_l2_n674
+end
+
+def fun_l1_n136()
+    fun_l2_n137
+end
+
+def fun_l1_n137()
+    fun_l2_n915
+end
+
+def fun_l1_n138()
+    fun_l2_n990
+end
+
+def fun_l1_n139()
+    fun_l2_n86
+end
+
+def fun_l1_n140()
+    fun_l2_n692
+end
+
+def fun_l1_n141()
+    fun_l2_n977
+end
+
+def fun_l1_n142()
+    fun_l2_n956
+end
+
+def fun_l1_n143()
+    fun_l2_n909
+end
+
+def fun_l1_n144()
+    fun_l2_n854
+end
+
+def fun_l1_n145()
+    fun_l2_n223
+end
+
+def fun_l1_n146()
+    fun_l2_n873
+end
+
+def fun_l1_n147()
+    fun_l2_n962
+end
+
+def fun_l1_n148()
+    fun_l2_n441
+end
+
+def fun_l1_n149()
+    fun_l2_n598
+end
+
+def fun_l1_n150()
+    fun_l2_n329
+end
+
+def fun_l1_n151()
+    fun_l2_n749
+end
+
+def fun_l1_n152()
+    fun_l2_n756
+end
+
+def fun_l1_n153()
+    fun_l2_n567
+end
+
+def fun_l1_n154()
+    fun_l2_n23
+end
+
+def fun_l1_n155()
+    fun_l2_n626
+end
+
+def fun_l1_n156()
+    fun_l2_n368
+end
+
+def fun_l1_n157()
+    fun_l2_n169
+end
+
+def fun_l1_n158()
+    fun_l2_n496
+end
+
+def fun_l1_n159()
+    fun_l2_n582
+end
+
+def fun_l1_n160()
+    fun_l2_n443
+end
+
+def fun_l1_n161()
+    fun_l2_n406
+end
+
+def fun_l1_n162()
+    fun_l2_n97
+end
+
+def fun_l1_n163()
+    fun_l2_n293
+end
+
+def fun_l1_n164()
+    fun_l2_n608
+end
+
+def fun_l1_n165()
+    fun_l2_n255
+end
+
+def fun_l1_n166()
+    fun_l2_n421
+end
+
+def fun_l1_n167()
+    fun_l2_n126
+end
+
+def fun_l1_n168()
+    fun_l2_n894
+end
+
+def fun_l1_n169()
+    fun_l2_n486
+end
+
+def fun_l1_n170()
+    fun_l2_n219
+end
+
+def fun_l1_n171()
+    fun_l2_n343
+end
+
+def fun_l1_n172()
+    fun_l2_n914
+end
+
+def fun_l1_n173()
+    fun_l2_n815
+end
+
+def fun_l1_n174()
+    fun_l2_n436
+end
+
+def fun_l1_n175()
+    fun_l2_n923
+end
+
+def fun_l1_n176()
+    fun_l2_n706
+end
+
+def fun_l1_n177()
+    fun_l2_n769
+end
+
+def fun_l1_n178()
+    fun_l2_n271
+end
+
+def fun_l1_n179()
+    fun_l2_n489
+end
+
+def fun_l1_n180()
+    fun_l2_n724
+end
+
+def fun_l1_n181()
+    fun_l2_n202
+end
+
+def fun_l1_n182()
+    fun_l2_n884
+end
+
+def fun_l1_n183()
+    fun_l2_n957
+end
+
+def fun_l1_n184()
+    fun_l2_n690
+end
+
+def fun_l1_n185()
+    fun_l2_n468
+end
+
+def fun_l1_n186()
+    fun_l2_n6
+end
+
+def fun_l1_n187()
+    fun_l2_n94
+end
+
+def fun_l1_n188()
+    fun_l2_n226
+end
+
+def fun_l1_n189()
+    fun_l2_n462
+end
+
+def fun_l1_n190()
+    fun_l2_n228
+end
+
+def fun_l1_n191()
+    fun_l2_n497
+end
+
+def fun_l1_n192()
+    fun_l2_n246
+end
+
+def fun_l1_n193()
+    fun_l2_n960
+end
+
+def fun_l1_n194()
+    fun_l2_n492
+end
+
+def fun_l1_n195()
+    fun_l2_n485
+end
+
+def fun_l1_n196()
+    fun_l2_n18
+end
+
+def fun_l1_n197()
+    fun_l2_n536
+end
+
+def fun_l1_n198()
+    fun_l2_n802
+end
+
+def fun_l1_n199()
+    fun_l2_n151
+end
+
+def fun_l1_n200()
+    fun_l2_n82
+end
+
+def fun_l1_n201()
+    fun_l2_n266
+end
+
+def fun_l1_n202()
+    fun_l2_n445
+end
+
+def fun_l1_n203()
+    fun_l2_n64
+end
+
+def fun_l1_n204()
+    fun_l2_n11
+end
+
+def fun_l1_n205()
+    fun_l2_n351
+end
+
+def fun_l1_n206()
+    fun_l2_n994
+end
+
+def fun_l1_n207()
+    fun_l2_n305
+end
+
+def fun_l1_n208()
+    fun_l2_n258
+end
+
+def fun_l1_n209()
+    fun_l2_n122
+end
+
+def fun_l1_n210()
+    fun_l2_n426
+end
+
+def fun_l1_n211()
+    fun_l2_n385
+end
+
+def fun_l1_n212()
+    fun_l2_n556
+end
+
+def fun_l1_n213()
+    fun_l2_n490
+end
+
+def fun_l1_n214()
+    fun_l2_n809
+end
+
+def fun_l1_n215()
+    fun_l2_n547
+end
+
+def fun_l1_n216()
+    fun_l2_n62
+end
+
+def fun_l1_n217()
+    fun_l2_n675
+end
+
+def fun_l1_n218()
+    fun_l2_n923
+end
+
+def fun_l1_n219()
+    fun_l2_n746
+end
+
+def fun_l1_n220()
+    fun_l2_n222
+end
+
+def fun_l1_n221()
+    fun_l2_n962
+end
+
+def fun_l1_n222()
+    fun_l2_n925
+end
+
+def fun_l1_n223()
+    fun_l2_n908
+end
+
+def fun_l1_n224()
+    fun_l2_n593
+end
+
+def fun_l1_n225()
+    fun_l2_n653
+end
+
+def fun_l1_n226()
+    fun_l2_n21
+end
+
+def fun_l1_n227()
+    fun_l2_n135
+end
+
+def fun_l1_n228()
+    fun_l2_n892
+end
+
+def fun_l1_n229()
+    fun_l2_n976
+end
+
+def fun_l1_n230()
+    fun_l2_n20
+end
+
+def fun_l1_n231()
+    fun_l2_n469
+end
+
+def fun_l1_n232()
+    fun_l2_n741
+end
+
+def fun_l1_n233()
+    fun_l2_n259
+end
+
+def fun_l1_n234()
+    fun_l2_n638
+end
+
+def fun_l1_n235()
+    fun_l2_n335
+end
+
+def fun_l1_n236()
+    fun_l2_n775
+end
+
+def fun_l1_n237()
+    fun_l2_n228
+end
+
+def fun_l1_n238()
+    fun_l2_n287
+end
+
+def fun_l1_n239()
+    fun_l2_n690
+end
+
+def fun_l1_n240()
+    fun_l2_n241
+end
+
+def fun_l1_n241()
+    fun_l2_n728
+end
+
+def fun_l1_n242()
+    fun_l2_n507
+end
+
+def fun_l1_n243()
+    fun_l2_n631
+end
+
+def fun_l1_n244()
+    fun_l2_n338
+end
+
+def fun_l1_n245()
+    fun_l2_n41
+end
+
+def fun_l1_n246()
+    fun_l2_n744
+end
+
+def fun_l1_n247()
+    fun_l2_n52
+end
+
+def fun_l1_n248()
+    fun_l2_n406
+end
+
+def fun_l1_n249()
+    fun_l2_n619
+end
+
+def fun_l1_n250()
+    fun_l2_n710
+end
+
+def fun_l1_n251()
+    fun_l2_n54
+end
+
+def fun_l1_n252()
+    fun_l2_n162
+end
+
+def fun_l1_n253()
+    fun_l2_n952
+end
+
+def fun_l1_n254()
+    fun_l2_n909
+end
+
+def fun_l1_n255()
+    fun_l2_n270
+end
+
+def fun_l1_n256()
+    fun_l2_n752
+end
+
+def fun_l1_n257()
+    fun_l2_n377
+end
+
+def fun_l1_n258()
+    fun_l2_n606
+end
+
+def fun_l1_n259()
+    fun_l2_n368
+end
+
+def fun_l1_n260()
+    fun_l2_n165
+end
+
+def fun_l1_n261()
+    fun_l2_n353
+end
+
+def fun_l1_n262()
+    fun_l2_n199
+end
+
+def fun_l1_n263()
+    fun_l2_n17
+end
+
+def fun_l1_n264()
+    fun_l2_n613
+end
+
+def fun_l1_n265()
+    fun_l2_n329
+end
+
+def fun_l1_n266()
+    fun_l2_n827
+end
+
+def fun_l1_n267()
+    fun_l2_n415
+end
+
+def fun_l1_n268()
+    fun_l2_n835
+end
+
+def fun_l1_n269()
+    fun_l2_n267
+end
+
+def fun_l1_n270()
+    fun_l2_n911
+end
+
+def fun_l1_n271()
+    fun_l2_n640
+end
+
+def fun_l1_n272()
+    fun_l2_n810
+end
+
+def fun_l1_n273()
+    fun_l2_n469
+end
+
+def fun_l1_n274()
+    fun_l2_n121
+end
+
+def fun_l1_n275()
+    fun_l2_n661
+end
+
+def fun_l1_n276()
+    fun_l2_n882
+end
+
+def fun_l1_n277()
+    fun_l2_n469
+end
+
+def fun_l1_n278()
+    fun_l2_n356
+end
+
+def fun_l1_n279()
+    fun_l2_n328
+end
+
+def fun_l1_n280()
+    fun_l2_n155
+end
+
+def fun_l1_n281()
+    fun_l2_n386
+end
+
+def fun_l1_n282()
+    fun_l2_n974
+end
+
+def fun_l1_n283()
+    fun_l2_n126
+end
+
+def fun_l1_n284()
+    fun_l2_n294
+end
+
+def fun_l1_n285()
+    fun_l2_n338
+end
+
+def fun_l1_n286()
+    fun_l2_n366
+end
+
+def fun_l1_n287()
+    fun_l2_n159
+end
+
+def fun_l1_n288()
+    fun_l2_n729
+end
+
+def fun_l1_n289()
+    fun_l2_n422
+end
+
+def fun_l1_n290()
+    fun_l2_n865
+end
+
+def fun_l1_n291()
+    fun_l2_n930
+end
+
+def fun_l1_n292()
+    fun_l2_n469
+end
+
+def fun_l1_n293()
+    fun_l2_n567
+end
+
+def fun_l1_n294()
+    fun_l2_n521
+end
+
+def fun_l1_n295()
+    fun_l2_n208
+end
+
+def fun_l1_n296()
+    fun_l2_n778
+end
+
+def fun_l1_n297()
+    fun_l2_n898
+end
+
+def fun_l1_n298()
+    fun_l2_n523
+end
+
+def fun_l1_n299()
+    fun_l2_n475
+end
+
+def fun_l1_n300()
+    fun_l2_n0
+end
+
+def fun_l1_n301()
+    fun_l2_n818
+end
+
+def fun_l1_n302()
+    fun_l2_n278
+end
+
+def fun_l1_n303()
+    fun_l2_n420
+end
+
+def fun_l1_n304()
+    fun_l2_n988
+end
+
+def fun_l1_n305()
+    fun_l2_n311
+end
+
+def fun_l1_n306()
+    fun_l2_n258
+end
+
+def fun_l1_n307()
+    fun_l2_n41
+end
+
+def fun_l1_n308()
+    fun_l2_n654
+end
+
+def fun_l1_n309()
+    fun_l2_n1
+end
+
+def fun_l1_n310()
+    fun_l2_n161
+end
+
+def fun_l1_n311()
+    fun_l2_n438
+end
+
+def fun_l1_n312()
+    fun_l2_n615
+end
+
+def fun_l1_n313()
+    fun_l2_n461
+end
+
+def fun_l1_n314()
+    fun_l2_n617
+end
+
+def fun_l1_n315()
+    fun_l2_n589
+end
+
+def fun_l1_n316()
+    fun_l2_n793
+end
+
+def fun_l1_n317()
+    fun_l2_n955
+end
+
+def fun_l1_n318()
+    fun_l2_n570
+end
+
+def fun_l1_n319()
+    fun_l2_n15
+end
+
+def fun_l1_n320()
+    fun_l2_n422
+end
+
+def fun_l1_n321()
+    fun_l2_n736
+end
+
+def fun_l1_n322()
+    fun_l2_n726
+end
+
+def fun_l1_n323()
+    fun_l2_n704
+end
+
+def fun_l1_n324()
+    fun_l2_n141
+end
+
+def fun_l1_n325()
+    fun_l2_n262
+end
+
+def fun_l1_n326()
+    fun_l2_n426
+end
+
+def fun_l1_n327()
+    fun_l2_n525
+end
+
+def fun_l1_n328()
+    fun_l2_n806
+end
+
+def fun_l1_n329()
+    fun_l2_n450
+end
+
+def fun_l1_n330()
+    fun_l2_n326
+end
+
+def fun_l1_n331()
+    fun_l2_n760
+end
+
+def fun_l1_n332()
+    fun_l2_n51
+end
+
+def fun_l1_n333()
+    fun_l2_n456
+end
+
+def fun_l1_n334()
+    fun_l2_n94
+end
+
+def fun_l1_n335()
+    fun_l2_n503
+end
+
+def fun_l1_n336()
+    fun_l2_n499
+end
+
+def fun_l1_n337()
+    fun_l2_n645
+end
+
+def fun_l1_n338()
+    fun_l2_n279
+end
+
+def fun_l1_n339()
+    fun_l2_n665
+end
+
+def fun_l1_n340()
+    fun_l2_n153
+end
+
+def fun_l1_n341()
+    fun_l2_n184
+end
+
+def fun_l1_n342()
+    fun_l2_n630
+end
+
+def fun_l1_n343()
+    fun_l2_n59
+end
+
+def fun_l1_n344()
+    fun_l2_n745
+end
+
+def fun_l1_n345()
+    fun_l2_n310
+end
+
+def fun_l1_n346()
+    fun_l2_n380
+end
+
+def fun_l1_n347()
+    fun_l2_n11
+end
+
+def fun_l1_n348()
+    fun_l2_n424
+end
+
+def fun_l1_n349()
+    fun_l2_n484
+end
+
+def fun_l1_n350()
+    fun_l2_n255
+end
+
+def fun_l1_n351()
+    fun_l2_n350
+end
+
+def fun_l1_n352()
+    fun_l2_n672
+end
+
+def fun_l1_n353()
+    fun_l2_n835
+end
+
+def fun_l1_n354()
+    fun_l2_n380
+end
+
+def fun_l1_n355()
+    fun_l2_n897
+end
+
+def fun_l1_n356()
+    fun_l2_n963
+end
+
+def fun_l1_n357()
+    fun_l2_n16
+end
+
+def fun_l1_n358()
+    fun_l2_n584
+end
+
+def fun_l1_n359()
+    fun_l2_n684
+end
+
+def fun_l1_n360()
+    fun_l2_n582
+end
+
+def fun_l1_n361()
+    fun_l2_n982
+end
+
+def fun_l1_n362()
+    fun_l2_n224
+end
+
+def fun_l1_n363()
+    fun_l2_n143
+end
+
+def fun_l1_n364()
+    fun_l2_n809
+end
+
+def fun_l1_n365()
+    fun_l2_n94
+end
+
+def fun_l1_n366()
+    fun_l2_n643
+end
+
+def fun_l1_n367()
+    fun_l2_n511
+end
+
+def fun_l1_n368()
+    fun_l2_n858
+end
+
+def fun_l1_n369()
+    fun_l2_n649
+end
+
+def fun_l1_n370()
+    fun_l2_n98
+end
+
+def fun_l1_n371()
+    fun_l2_n537
+end
+
+def fun_l1_n372()
+    fun_l2_n418
+end
+
+def fun_l1_n373()
+    fun_l2_n456
+end
+
+def fun_l1_n374()
+    fun_l2_n694
+end
+
+def fun_l1_n375()
+    fun_l2_n37
+end
+
+def fun_l1_n376()
+    fun_l2_n152
+end
+
+def fun_l1_n377()
+    fun_l2_n916
+end
+
+def fun_l1_n378()
+    fun_l2_n926
+end
+
+def fun_l1_n379()
+    fun_l2_n978
+end
+
+def fun_l1_n380()
+    fun_l2_n706
+end
+
+def fun_l1_n381()
+    fun_l2_n666
+end
+
+def fun_l1_n382()
+    fun_l2_n407
+end
+
+def fun_l1_n383()
+    fun_l2_n839
+end
+
+def fun_l1_n384()
+    fun_l2_n936
+end
+
+def fun_l1_n385()
+    fun_l2_n122
+end
+
+def fun_l1_n386()
+    fun_l2_n189
+end
+
+def fun_l1_n387()
+    fun_l2_n799
+end
+
+def fun_l1_n388()
+    fun_l2_n494
+end
+
+def fun_l1_n389()
+    fun_l2_n534
+end
+
+def fun_l1_n390()
+    fun_l2_n986
+end
+
+def fun_l1_n391()
+    fun_l2_n870
+end
+
+def fun_l1_n392()
+    fun_l2_n341
+end
+
+def fun_l1_n393()
+    fun_l2_n251
+end
+
+def fun_l1_n394()
+    fun_l2_n95
+end
+
+def fun_l1_n395()
+    fun_l2_n127
+end
+
+def fun_l1_n396()
+    fun_l2_n496
+end
+
+def fun_l1_n397()
+    fun_l2_n81
+end
+
+def fun_l1_n398()
+    fun_l2_n628
+end
+
+def fun_l1_n399()
+    fun_l2_n212
+end
+
+def fun_l1_n400()
+    fun_l2_n968
+end
+
+def fun_l1_n401()
+    fun_l2_n3
+end
+
+def fun_l1_n402()
+    fun_l2_n266
+end
+
+def fun_l1_n403()
+    fun_l2_n227
+end
+
+def fun_l1_n404()
+    fun_l2_n311
+end
+
+def fun_l1_n405()
+    fun_l2_n977
+end
+
+def fun_l1_n406()
+    fun_l2_n298
+end
+
+def fun_l1_n407()
+    fun_l2_n619
+end
+
+def fun_l1_n408()
+    fun_l2_n11
+end
+
+def fun_l1_n409()
+    fun_l2_n40
+end
+
+def fun_l1_n410()
+    fun_l2_n238
+end
+
+def fun_l1_n411()
+    fun_l2_n378
+end
+
+def fun_l1_n412()
+    fun_l2_n166
+end
+
+def fun_l1_n413()
+    fun_l2_n392
+end
+
+def fun_l1_n414()
+    fun_l2_n374
+end
+
+def fun_l1_n415()
+    fun_l2_n195
+end
+
+def fun_l1_n416()
+    fun_l2_n627
+end
+
+def fun_l1_n417()
+    fun_l2_n795
+end
+
+def fun_l1_n418()
+    fun_l2_n79
+end
+
+def fun_l1_n419()
+    fun_l2_n425
+end
+
+def fun_l1_n420()
+    fun_l2_n733
+end
+
+def fun_l1_n421()
+    fun_l2_n974
+end
+
+def fun_l1_n422()
+    fun_l2_n697
+end
+
+def fun_l1_n423()
+    fun_l2_n997
+end
+
+def fun_l1_n424()
+    fun_l2_n860
+end
+
+def fun_l1_n425()
+    fun_l2_n446
+end
+
+def fun_l1_n426()
+    fun_l2_n250
+end
+
+def fun_l1_n427()
+    fun_l2_n556
+end
+
+def fun_l1_n428()
+    fun_l2_n945
+end
+
+def fun_l1_n429()
+    fun_l2_n307
+end
+
+def fun_l1_n430()
+    fun_l2_n541
+end
+
+def fun_l1_n431()
+    fun_l2_n171
+end
+
+def fun_l1_n432()
+    fun_l2_n859
+end
+
+def fun_l1_n433()
+    fun_l2_n351
+end
+
+def fun_l1_n434()
+    fun_l2_n218
+end
+
+def fun_l1_n435()
+    fun_l2_n456
+end
+
+def fun_l1_n436()
+    fun_l2_n418
+end
+
+def fun_l1_n437()
+    fun_l2_n611
+end
+
+def fun_l1_n438()
+    fun_l2_n797
+end
+
+def fun_l1_n439()
+    fun_l2_n738
+end
+
+def fun_l1_n440()
+    fun_l2_n796
+end
+
+def fun_l1_n441()
+    fun_l2_n978
+end
+
+def fun_l1_n442()
+    fun_l2_n400
+end
+
+def fun_l1_n443()
+    fun_l2_n295
+end
+
+def fun_l1_n444()
+    fun_l2_n749
+end
+
+def fun_l1_n445()
+    fun_l2_n401
+end
+
+def fun_l1_n446()
+    fun_l2_n96
+end
+
+def fun_l1_n447()
+    fun_l2_n134
+end
+
+def fun_l1_n448()
+    fun_l2_n149
+end
+
+def fun_l1_n449()
+    fun_l2_n306
+end
+
+def fun_l1_n450()
+    fun_l2_n125
+end
+
+def fun_l1_n451()
+    fun_l2_n34
+end
+
+def fun_l1_n452()
+    fun_l2_n891
+end
+
+def fun_l1_n453()
+    fun_l2_n260
+end
+
+def fun_l1_n454()
+    fun_l2_n104
+end
+
+def fun_l1_n455()
+    fun_l2_n766
+end
+
+def fun_l1_n456()
+    fun_l2_n246
+end
+
+def fun_l1_n457()
+    fun_l2_n292
+end
+
+def fun_l1_n458()
+    fun_l2_n730
+end
+
+def fun_l1_n459()
+    fun_l2_n536
+end
+
+def fun_l1_n460()
+    fun_l2_n139
+end
+
+def fun_l1_n461()
+    fun_l2_n433
+end
+
+def fun_l1_n462()
+    fun_l2_n983
+end
+
+def fun_l1_n463()
+    fun_l2_n730
+end
+
+def fun_l1_n464()
+    fun_l2_n543
+end
+
+def fun_l1_n465()
+    fun_l2_n499
+end
+
+def fun_l1_n466()
+    fun_l2_n180
+end
+
+def fun_l1_n467()
+    fun_l2_n242
+end
+
+def fun_l1_n468()
+    fun_l2_n351
+end
+
+def fun_l1_n469()
+    fun_l2_n229
+end
+
+def fun_l1_n470()
+    fun_l2_n999
+end
+
+def fun_l1_n471()
+    fun_l2_n261
+end
+
+def fun_l1_n472()
+    fun_l2_n738
+end
+
+def fun_l1_n473()
+    fun_l2_n406
+end
+
+def fun_l1_n474()
+    fun_l2_n672
+end
+
+def fun_l1_n475()
+    fun_l2_n86
+end
+
+def fun_l1_n476()
+    fun_l2_n616
+end
+
+def fun_l1_n477()
+    fun_l2_n555
+end
+
+def fun_l1_n478()
+    fun_l2_n686
+end
+
+def fun_l1_n479()
+    fun_l2_n964
+end
+
+def fun_l1_n480()
+    fun_l2_n171
+end
+
+def fun_l1_n481()
+    fun_l2_n525
+end
+
+def fun_l1_n482()
+    fun_l2_n106
+end
+
+def fun_l1_n483()
+    fun_l2_n992
+end
+
+def fun_l1_n484()
+    fun_l2_n988
+end
+
+def fun_l1_n485()
+    fun_l2_n657
+end
+
+def fun_l1_n486()
+    fun_l2_n464
+end
+
+def fun_l1_n487()
+    fun_l2_n55
+end
+
+def fun_l1_n488()
+    fun_l2_n416
+end
+
+def fun_l1_n489()
+    fun_l2_n582
+end
+
+def fun_l1_n490()
+    fun_l2_n873
+end
+
+def fun_l1_n491()
+    fun_l2_n629
+end
+
+def fun_l1_n492()
+    fun_l2_n156
+end
+
+def fun_l1_n493()
+    fun_l2_n68
+end
+
+def fun_l1_n494()
+    fun_l2_n239
+end
+
+def fun_l1_n495()
+    fun_l2_n319
+end
+
+def fun_l1_n496()
+    fun_l2_n539
+end
+
+def fun_l1_n497()
+    fun_l2_n237
+end
+
+def fun_l1_n498()
+    fun_l2_n241
+end
+
+def fun_l1_n499()
+    fun_l2_n34
+end
+
+def fun_l1_n500()
+    fun_l2_n588
+end
+
+def fun_l1_n501()
+    fun_l2_n540
+end
+
+def fun_l1_n502()
+    fun_l2_n591
+end
+
+def fun_l1_n503()
+    fun_l2_n199
+end
+
+def fun_l1_n504()
+    fun_l2_n265
+end
+
+def fun_l1_n505()
+    fun_l2_n170
+end
+
+def fun_l1_n506()
+    fun_l2_n29
+end
+
+def fun_l1_n507()
+    fun_l2_n741
+end
+
+def fun_l1_n508()
+    fun_l2_n877
+end
+
+def fun_l1_n509()
+    fun_l2_n710
+end
+
+def fun_l1_n510()
+    fun_l2_n197
+end
+
+def fun_l1_n511()
+    fun_l2_n319
+end
+
+def fun_l1_n512()
+    fun_l2_n60
+end
+
+def fun_l1_n513()
+    fun_l2_n753
+end
+
+def fun_l1_n514()
+    fun_l2_n492
+end
+
+def fun_l1_n515()
+    fun_l2_n961
+end
+
+def fun_l1_n516()
+    fun_l2_n227
+end
+
+def fun_l1_n517()
+    fun_l2_n361
+end
+
+def fun_l1_n518()
+    fun_l2_n265
+end
+
+def fun_l1_n519()
+    fun_l2_n392
+end
+
+def fun_l1_n520()
+    fun_l2_n425
+end
+
+def fun_l1_n521()
+    fun_l2_n869
+end
+
+def fun_l1_n522()
+    fun_l2_n859
+end
+
+def fun_l1_n523()
+    fun_l2_n140
+end
+
+def fun_l1_n524()
+    fun_l2_n451
+end
+
+def fun_l1_n525()
+    fun_l2_n274
+end
+
+def fun_l1_n526()
+    fun_l2_n358
+end
+
+def fun_l1_n527()
+    fun_l2_n475
+end
+
+def fun_l1_n528()
+    fun_l2_n948
+end
+
+def fun_l1_n529()
+    fun_l2_n866
+end
+
+def fun_l1_n530()
+    fun_l2_n70
+end
+
+def fun_l1_n531()
+    fun_l2_n756
+end
+
+def fun_l1_n532()
+    fun_l2_n704
+end
+
+def fun_l1_n533()
+    fun_l2_n59
+end
+
+def fun_l1_n534()
+    fun_l2_n174
+end
+
+def fun_l1_n535()
+    fun_l2_n476
+end
+
+def fun_l1_n536()
+    fun_l2_n269
+end
+
+def fun_l1_n537()
+    fun_l2_n897
+end
+
+def fun_l1_n538()
+    fun_l2_n550
+end
+
+def fun_l1_n539()
+    fun_l2_n404
+end
+
+def fun_l1_n540()
+    fun_l2_n167
+end
+
+def fun_l1_n541()
+    fun_l2_n332
+end
+
+def fun_l1_n542()
+    fun_l2_n853
+end
+
+def fun_l1_n543()
+    fun_l2_n621
+end
+
+def fun_l1_n544()
+    fun_l2_n36
+end
+
+def fun_l1_n545()
+    fun_l2_n978
+end
+
+def fun_l1_n546()
+    fun_l2_n295
+end
+
+def fun_l1_n547()
+    fun_l2_n537
+end
+
+def fun_l1_n548()
+    fun_l2_n315
+end
+
+def fun_l1_n549()
+    fun_l2_n944
+end
+
+def fun_l1_n550()
+    fun_l2_n933
+end
+
+def fun_l1_n551()
+    fun_l2_n209
+end
+
+def fun_l1_n552()
+    fun_l2_n524
+end
+
+def fun_l1_n553()
+    fun_l2_n115
+end
+
+def fun_l1_n554()
+    fun_l2_n475
+end
+
+def fun_l1_n555()
+    fun_l2_n417
+end
+
+def fun_l1_n556()
+    fun_l2_n507
+end
+
+def fun_l1_n557()
+    fun_l2_n812
+end
+
+def fun_l1_n558()
+    fun_l2_n261
+end
+
+def fun_l1_n559()
+    fun_l2_n268
+end
+
+def fun_l1_n560()
+    fun_l2_n34
+end
+
+def fun_l1_n561()
+    fun_l2_n774
+end
+
+def fun_l1_n562()
+    fun_l2_n102
+end
+
+def fun_l1_n563()
+    fun_l2_n791
+end
+
+def fun_l1_n564()
+    fun_l2_n760
+end
+
+def fun_l1_n565()
+    fun_l2_n376
+end
+
+def fun_l1_n566()
+    fun_l2_n897
+end
+
+def fun_l1_n567()
+    fun_l2_n456
+end
+
+def fun_l1_n568()
+    fun_l2_n120
+end
+
+def fun_l1_n569()
+    fun_l2_n892
+end
+
+def fun_l1_n570()
+    fun_l2_n948
+end
+
+def fun_l1_n571()
+    fun_l2_n586
+end
+
+def fun_l1_n572()
+    fun_l2_n428
+end
+
+def fun_l1_n573()
+    fun_l2_n182
+end
+
+def fun_l1_n574()
+    fun_l2_n980
+end
+
+def fun_l1_n575()
+    fun_l2_n192
+end
+
+def fun_l1_n576()
+    fun_l2_n440
+end
+
+def fun_l1_n577()
+    fun_l2_n381
+end
+
+def fun_l1_n578()
+    fun_l2_n508
+end
+
+def fun_l1_n579()
+    fun_l2_n560
+end
+
+def fun_l1_n580()
+    fun_l2_n673
+end
+
+def fun_l1_n581()
+    fun_l2_n236
+end
+
+def fun_l1_n582()
+    fun_l2_n936
+end
+
+def fun_l1_n583()
+    fun_l2_n104
+end
+
+def fun_l1_n584()
+    fun_l2_n439
+end
+
+def fun_l1_n585()
+    fun_l2_n844
+end
+
+def fun_l1_n586()
+    fun_l2_n115
+end
+
+def fun_l1_n587()
+    fun_l2_n114
+end
+
+def fun_l1_n588()
+    fun_l2_n963
+end
+
+def fun_l1_n589()
+    fun_l2_n972
+end
+
+def fun_l1_n590()
+    fun_l2_n333
+end
+
+def fun_l1_n591()
+    fun_l2_n624
+end
+
+def fun_l1_n592()
+    fun_l2_n478
+end
+
+def fun_l1_n593()
+    fun_l2_n581
+end
+
+def fun_l1_n594()
+    fun_l2_n199
+end
+
+def fun_l1_n595()
+    fun_l2_n596
+end
+
+def fun_l1_n596()
+    fun_l2_n458
+end
+
+def fun_l1_n597()
+    fun_l2_n729
+end
+
+def fun_l1_n598()
+    fun_l2_n545
+end
+
+def fun_l1_n599()
+    fun_l2_n60
+end
+
+def fun_l1_n600()
+    fun_l2_n801
+end
+
+def fun_l1_n601()
+    fun_l2_n164
+end
+
+def fun_l1_n602()
+    fun_l2_n3
+end
+
+def fun_l1_n603()
+    fun_l2_n334
+end
+
+def fun_l1_n604()
+    fun_l2_n887
+end
+
+def fun_l1_n605()
+    fun_l2_n777
+end
+
+def fun_l1_n606()
+    fun_l2_n765
+end
+
+def fun_l1_n607()
+    fun_l2_n529
+end
+
+def fun_l1_n608()
+    fun_l2_n233
+end
+
+def fun_l1_n609()
+    fun_l2_n164
+end
+
+def fun_l1_n610()
+    fun_l2_n289
+end
+
+def fun_l1_n611()
+    fun_l2_n918
+end
+
+def fun_l1_n612()
+    fun_l2_n13
+end
+
+def fun_l1_n613()
+    fun_l2_n530
+end
+
+def fun_l1_n614()
+    fun_l2_n574
+end
+
+def fun_l1_n615()
+    fun_l2_n383
+end
+
+def fun_l1_n616()
+    fun_l2_n470
+end
+
+def fun_l1_n617()
+    fun_l2_n551
+end
+
+def fun_l1_n618()
+    fun_l2_n539
+end
+
+def fun_l1_n619()
+    fun_l2_n858
+end
+
+def fun_l1_n620()
+    fun_l2_n523
+end
+
+def fun_l1_n621()
+    fun_l2_n439
+end
+
+def fun_l1_n622()
+    fun_l2_n909
+end
+
+def fun_l1_n623()
+    fun_l2_n686
+end
+
+def fun_l1_n624()
+    fun_l2_n133
+end
+
+def fun_l1_n625()
+    fun_l2_n92
+end
+
+def fun_l1_n626()
+    fun_l2_n443
+end
+
+def fun_l1_n627()
+    fun_l2_n682
+end
+
+def fun_l1_n628()
+    fun_l2_n113
+end
+
+def fun_l1_n629()
+    fun_l2_n353
+end
+
+def fun_l1_n630()
+    fun_l2_n631
+end
+
+def fun_l1_n631()
+    fun_l2_n858
+end
+
+def fun_l1_n632()
+    fun_l2_n816
+end
+
+def fun_l1_n633()
+    fun_l2_n683
+end
+
+def fun_l1_n634()
+    fun_l2_n32
+end
+
+def fun_l1_n635()
+    fun_l2_n983
+end
+
+def fun_l1_n636()
+    fun_l2_n587
+end
+
+def fun_l1_n637()
+    fun_l2_n17
+end
+
+def fun_l1_n638()
+    fun_l2_n129
+end
+
+def fun_l1_n639()
+    fun_l2_n166
+end
+
+def fun_l1_n640()
+    fun_l2_n742
+end
+
+def fun_l1_n641()
+    fun_l2_n8
+end
+
+def fun_l1_n642()
+    fun_l2_n119
+end
+
+def fun_l1_n643()
+    fun_l2_n615
+end
+
+def fun_l1_n644()
+    fun_l2_n419
+end
+
+def fun_l1_n645()
+    fun_l2_n324
+end
+
+def fun_l1_n646()
+    fun_l2_n806
+end
+
+def fun_l1_n647()
+    fun_l2_n722
+end
+
+def fun_l1_n648()
+    fun_l2_n462
+end
+
+def fun_l1_n649()
+    fun_l2_n602
+end
+
+def fun_l1_n650()
+    fun_l2_n39
+end
+
+def fun_l1_n651()
+    fun_l2_n53
+end
+
+def fun_l1_n652()
+    fun_l2_n201
+end
+
+def fun_l1_n653()
+    fun_l2_n403
+end
+
+def fun_l1_n654()
+    fun_l2_n595
+end
+
+def fun_l1_n655()
+    fun_l2_n467
+end
+
+def fun_l1_n656()
+    fun_l2_n904
+end
+
+def fun_l1_n657()
+    fun_l2_n429
+end
+
+def fun_l1_n658()
+    fun_l2_n463
+end
+
+def fun_l1_n659()
+    fun_l2_n470
+end
+
+def fun_l1_n660()
+    fun_l2_n0
+end
+
+def fun_l1_n661()
+    fun_l2_n258
+end
+
+def fun_l1_n662()
+    fun_l2_n950
+end
+
+def fun_l1_n663()
+    fun_l2_n953
+end
+
+def fun_l1_n664()
+    fun_l2_n664
+end
+
+def fun_l1_n665()
+    fun_l2_n12
+end
+
+def fun_l1_n666()
+    fun_l2_n317
+end
+
+def fun_l1_n667()
+    fun_l2_n526
+end
+
+def fun_l1_n668()
+    fun_l2_n984
+end
+
+def fun_l1_n669()
+    fun_l2_n273
+end
+
+def fun_l1_n670()
+    fun_l2_n822
+end
+
+def fun_l1_n671()
+    fun_l2_n759
+end
+
+def fun_l1_n672()
+    fun_l2_n927
+end
+
+def fun_l1_n673()
+    fun_l2_n419
+end
+
+def fun_l1_n674()
+    fun_l2_n546
+end
+
+def fun_l1_n675()
+    fun_l2_n879
+end
+
+def fun_l1_n676()
+    fun_l2_n659
+end
+
+def fun_l1_n677()
+    fun_l2_n317
+end
+
+def fun_l1_n678()
+    fun_l2_n234
+end
+
+def fun_l1_n679()
+    fun_l2_n416
+end
+
+def fun_l1_n680()
+    fun_l2_n890
+end
+
+def fun_l1_n681()
+    fun_l2_n401
+end
+
+def fun_l1_n682()
+    fun_l2_n271
+end
+
+def fun_l1_n683()
+    fun_l2_n915
+end
+
+def fun_l1_n684()
+    fun_l2_n666
+end
+
+def fun_l1_n685()
+    fun_l2_n151
+end
+
+def fun_l1_n686()
+    fun_l2_n786
+end
+
+def fun_l1_n687()
+    fun_l2_n82
+end
+
+def fun_l1_n688()
+    fun_l2_n831
+end
+
+def fun_l1_n689()
+    fun_l2_n830
+end
+
+def fun_l1_n690()
+    fun_l2_n221
+end
+
+def fun_l1_n691()
+    fun_l2_n530
+end
+
+def fun_l1_n692()
+    fun_l2_n131
+end
+
+def fun_l1_n693()
+    fun_l2_n17
+end
+
+def fun_l1_n694()
+    fun_l2_n265
+end
+
+def fun_l1_n695()
+    fun_l2_n111
+end
+
+def fun_l1_n696()
+    fun_l2_n39
+end
+
+def fun_l1_n697()
+    fun_l2_n326
+end
+
+def fun_l1_n698()
+    fun_l2_n713
+end
+
+def fun_l1_n699()
+    fun_l2_n960
+end
+
+def fun_l1_n700()
+    fun_l2_n633
+end
+
+def fun_l1_n701()
+    fun_l2_n291
+end
+
+def fun_l1_n702()
+    fun_l2_n746
+end
+
+def fun_l1_n703()
+    fun_l2_n316
+end
+
+def fun_l1_n704()
+    fun_l2_n116
+end
+
+def fun_l1_n705()
+    fun_l2_n195
+end
+
+def fun_l1_n706()
+    fun_l2_n614
+end
+
+def fun_l1_n707()
+    fun_l2_n591
+end
+
+def fun_l1_n708()
+    fun_l2_n879
+end
+
+def fun_l1_n709()
+    fun_l2_n770
+end
+
+def fun_l1_n710()
+    fun_l2_n332
+end
+
+def fun_l1_n711()
+    fun_l2_n696
+end
+
+def fun_l1_n712()
+    fun_l2_n42
+end
+
+def fun_l1_n713()
+    fun_l2_n126
+end
+
+def fun_l1_n714()
+    fun_l2_n486
+end
+
+def fun_l1_n715()
+    fun_l2_n259
+end
+
+def fun_l1_n716()
+    fun_l2_n390
+end
+
+def fun_l1_n717()
+    fun_l2_n590
+end
+
+def fun_l1_n718()
+    fun_l2_n180
+end
+
+def fun_l1_n719()
+    fun_l2_n673
+end
+
+def fun_l1_n720()
+    fun_l2_n565
+end
+
+def fun_l1_n721()
+    fun_l2_n504
+end
+
+def fun_l1_n722()
+    fun_l2_n585
+end
+
+def fun_l1_n723()
+    fun_l2_n746
+end
+
+def fun_l1_n724()
+    fun_l2_n797
+end
+
+def fun_l1_n725()
+    fun_l2_n281
+end
+
+def fun_l1_n726()
+    fun_l2_n670
+end
+
+def fun_l1_n727()
+    fun_l2_n678
+end
+
+def fun_l1_n728()
+    fun_l2_n329
+end
+
+def fun_l1_n729()
+    fun_l2_n581
+end
+
+def fun_l1_n730()
+    fun_l2_n313
+end
+
+def fun_l1_n731()
+    fun_l2_n893
+end
+
+def fun_l1_n732()
+    fun_l2_n773
+end
+
+def fun_l1_n733()
+    fun_l2_n527
+end
+
+def fun_l1_n734()
+    fun_l2_n473
+end
+
+def fun_l1_n735()
+    fun_l2_n242
+end
+
+def fun_l1_n736()
+    fun_l2_n681
+end
+
+def fun_l1_n737()
+    fun_l2_n593
+end
+
+def fun_l1_n738()
+    fun_l2_n214
+end
+
+def fun_l1_n739()
+    fun_l2_n931
+end
+
+def fun_l1_n740()
+    fun_l2_n157
+end
+
+def fun_l1_n741()
+    fun_l2_n207
+end
+
+def fun_l1_n742()
+    fun_l2_n583
+end
+
+def fun_l1_n743()
+    fun_l2_n978
+end
+
+def fun_l1_n744()
+    fun_l2_n220
+end
+
+def fun_l1_n745()
+    fun_l2_n0
+end
+
+def fun_l1_n746()
+    fun_l2_n871
+end
+
+def fun_l1_n747()
+    fun_l2_n344
+end
+
+def fun_l1_n748()
+    fun_l2_n445
+end
+
+def fun_l1_n749()
+    fun_l2_n682
+end
+
+def fun_l1_n750()
+    fun_l2_n553
+end
+
+def fun_l1_n751()
+    fun_l2_n616
+end
+
+def fun_l1_n752()
+    fun_l2_n93
+end
+
+def fun_l1_n753()
+    fun_l2_n297
+end
+
+def fun_l1_n754()
+    fun_l2_n653
+end
+
+def fun_l1_n755()
+    fun_l2_n730
+end
+
+def fun_l1_n756()
+    fun_l2_n375
+end
+
+def fun_l1_n757()
+    fun_l2_n522
+end
+
+def fun_l1_n758()
+    fun_l2_n855
+end
+
+def fun_l1_n759()
+    fun_l2_n727
+end
+
+def fun_l1_n760()
+    fun_l2_n516
+end
+
+def fun_l1_n761()
+    fun_l2_n322
+end
+
+def fun_l1_n762()
+    fun_l2_n84
+end
+
+def fun_l1_n763()
+    fun_l2_n704
+end
+
+def fun_l1_n764()
+    fun_l2_n516
+end
+
+def fun_l1_n765()
+    fun_l2_n97
+end
+
+def fun_l1_n766()
+    fun_l2_n678
+end
+
+def fun_l1_n767()
+    fun_l2_n690
+end
+
+def fun_l1_n768()
+    fun_l2_n704
+end
+
+def fun_l1_n769()
+    fun_l2_n664
+end
+
+def fun_l1_n770()
+    fun_l2_n157
+end
+
+def fun_l1_n771()
+    fun_l2_n24
+end
+
+def fun_l1_n772()
+    fun_l2_n399
+end
+
+def fun_l1_n773()
+    fun_l2_n362
+end
+
+def fun_l1_n774()
+    fun_l2_n687
+end
+
+def fun_l1_n775()
+    fun_l2_n228
+end
+
+def fun_l1_n776()
+    fun_l2_n781
+end
+
+def fun_l1_n777()
+    fun_l2_n112
+end
+
+def fun_l1_n778()
+    fun_l2_n126
+end
+
+def fun_l1_n779()
+    fun_l2_n298
+end
+
+def fun_l1_n780()
+    fun_l2_n779
+end
+
+def fun_l1_n781()
+    fun_l2_n354
+end
+
+def fun_l1_n782()
+    fun_l2_n357
+end
+
+def fun_l1_n783()
+    fun_l2_n814
+end
+
+def fun_l1_n784()
+    fun_l2_n975
+end
+
+def fun_l1_n785()
+    fun_l2_n853
+end
+
+def fun_l1_n786()
+    fun_l2_n58
+end
+
+def fun_l1_n787()
+    fun_l2_n455
+end
+
+def fun_l1_n788()
+    fun_l2_n31
+end
+
+def fun_l1_n789()
+    fun_l2_n621
+end
+
+def fun_l1_n790()
+    fun_l2_n714
+end
+
+def fun_l1_n791()
+    fun_l2_n931
+end
+
+def fun_l1_n792()
+    fun_l2_n511
+end
+
+def fun_l1_n793()
+    fun_l2_n128
+end
+
+def fun_l1_n794()
+    fun_l2_n750
+end
+
+def fun_l1_n795()
+    fun_l2_n121
+end
+
+def fun_l1_n796()
+    fun_l2_n226
+end
+
+def fun_l1_n797()
+    fun_l2_n515
+end
+
+def fun_l1_n798()
+    fun_l2_n8
+end
+
+def fun_l1_n799()
+    fun_l2_n372
+end
+
+def fun_l1_n800()
+    fun_l2_n646
+end
+
+def fun_l1_n801()
+    fun_l2_n722
+end
+
+def fun_l1_n802()
+    fun_l2_n932
+end
+
+def fun_l1_n803()
+    fun_l2_n992
+end
+
+def fun_l1_n804()
+    fun_l2_n628
+end
+
+def fun_l1_n805()
+    fun_l2_n97
+end
+
+def fun_l1_n806()
+    fun_l2_n113
+end
+
+def fun_l1_n807()
+    fun_l2_n249
+end
+
+def fun_l1_n808()
+    fun_l2_n211
+end
+
+def fun_l1_n809()
+    fun_l2_n40
+end
+
+def fun_l1_n810()
+    fun_l2_n608
+end
+
+def fun_l1_n811()
+    fun_l2_n560
+end
+
+def fun_l1_n812()
+    fun_l2_n182
+end
+
+def fun_l1_n813()
+    fun_l2_n7
+end
+
+def fun_l1_n814()
+    fun_l2_n641
+end
+
+def fun_l1_n815()
+    fun_l2_n541
+end
+
+def fun_l1_n816()
+    fun_l2_n951
+end
+
+def fun_l1_n817()
+    fun_l2_n122
+end
+
+def fun_l1_n818()
+    fun_l2_n270
+end
+
+def fun_l1_n819()
+    fun_l2_n631
+end
+
+def fun_l1_n820()
+    fun_l2_n787
+end
+
+def fun_l1_n821()
+    fun_l2_n543
+end
+
+def fun_l1_n822()
+    fun_l2_n599
+end
+
+def fun_l1_n823()
+    fun_l2_n686
+end
+
+def fun_l1_n824()
+    fun_l2_n11
+end
+
+def fun_l1_n825()
+    fun_l2_n379
+end
+
+def fun_l1_n826()
+    fun_l2_n190
+end
+
+def fun_l1_n827()
+    fun_l2_n815
+end
+
+def fun_l1_n828()
+    fun_l2_n117
+end
+
+def fun_l1_n829()
+    fun_l2_n465
+end
+
+def fun_l1_n830()
+    fun_l2_n333
+end
+
+def fun_l1_n831()
+    fun_l2_n928
+end
+
+def fun_l1_n832()
+    fun_l2_n565
+end
+
+def fun_l1_n833()
+    fun_l2_n83
+end
+
+def fun_l1_n834()
+    fun_l2_n364
+end
+
+def fun_l1_n835()
+    fun_l2_n93
+end
+
+def fun_l1_n836()
+    fun_l2_n20
+end
+
+def fun_l1_n837()
+    fun_l2_n223
+end
+
+def fun_l1_n838()
+    fun_l2_n720
+end
+
+def fun_l1_n839()
+    fun_l2_n848
+end
+
+def fun_l1_n840()
+    fun_l2_n228
+end
+
+def fun_l1_n841()
+    fun_l2_n607
+end
+
+def fun_l1_n842()
+    fun_l2_n253
+end
+
+def fun_l1_n843()
+    fun_l2_n426
+end
+
+def fun_l1_n844()
+    fun_l2_n295
+end
+
+def fun_l1_n845()
+    fun_l2_n213
+end
+
+def fun_l1_n846()
+    fun_l2_n991
+end
+
+def fun_l1_n847()
+    fun_l2_n169
+end
+
+def fun_l1_n848()
+    fun_l2_n32
+end
+
+def fun_l1_n849()
+    fun_l2_n495
+end
+
+def fun_l1_n850()
+    fun_l2_n528
+end
+
+def fun_l1_n851()
+    fun_l2_n862
+end
+
+def fun_l1_n852()
+    fun_l2_n712
+end
+
+def fun_l1_n853()
+    fun_l2_n234
+end
+
+def fun_l1_n854()
+    fun_l2_n646
+end
+
+def fun_l1_n855()
+    fun_l2_n720
+end
+
+def fun_l1_n856()
+    fun_l2_n605
+end
+
+def fun_l1_n857()
+    fun_l2_n966
+end
+
+def fun_l1_n858()
+    fun_l2_n68
+end
+
+def fun_l1_n859()
+    fun_l2_n914
+end
+
+def fun_l1_n860()
+    fun_l2_n234
+end
+
+def fun_l1_n861()
+    fun_l2_n410
+end
+
+def fun_l1_n862()
+    fun_l2_n370
+end
+
+def fun_l1_n863()
+    fun_l2_n127
+end
+
+def fun_l1_n864()
+    fun_l2_n187
+end
+
+def fun_l1_n865()
+    fun_l2_n98
+end
+
+def fun_l1_n866()
+    fun_l2_n256
+end
+
+def fun_l1_n867()
+    fun_l2_n747
+end
+
+def fun_l1_n868()
+    fun_l2_n344
+end
+
+def fun_l1_n869()
+    fun_l2_n570
+end
+
+def fun_l1_n870()
+    fun_l2_n552
+end
+
+def fun_l1_n871()
+    fun_l2_n499
+end
+
+def fun_l1_n872()
+    fun_l2_n763
+end
+
+def fun_l1_n873()
+    fun_l2_n35
+end
+
+def fun_l1_n874()
+    fun_l2_n229
+end
+
+def fun_l1_n875()
+    fun_l2_n124
+end
+
+def fun_l1_n876()
+    fun_l2_n258
+end
+
+def fun_l1_n877()
+    fun_l2_n280
+end
+
+def fun_l1_n878()
+    fun_l2_n899
+end
+
+def fun_l1_n879()
+    fun_l2_n211
+end
+
+def fun_l1_n880()
+    fun_l2_n741
+end
+
+def fun_l1_n881()
+    fun_l2_n32
+end
+
+def fun_l1_n882()
+    fun_l2_n212
+end
+
+def fun_l1_n883()
+    fun_l2_n661
+end
+
+def fun_l1_n884()
+    fun_l2_n889
+end
+
+def fun_l1_n885()
+    fun_l2_n975
+end
+
+def fun_l1_n886()
+    fun_l2_n288
+end
+
+def fun_l1_n887()
+    fun_l2_n448
+end
+
+def fun_l1_n888()
+    fun_l2_n520
+end
+
+def fun_l1_n889()
+    fun_l2_n284
+end
+
+def fun_l1_n890()
+    fun_l2_n254
+end
+
+def fun_l1_n891()
+    fun_l2_n703
+end
+
+def fun_l1_n892()
+    fun_l2_n706
+end
+
+def fun_l1_n893()
+    fun_l2_n9
+end
+
+def fun_l1_n894()
+    fun_l2_n717
+end
+
+def fun_l1_n895()
+    fun_l2_n290
+end
+
+def fun_l1_n896()
+    fun_l2_n657
+end
+
+def fun_l1_n897()
+    fun_l2_n452
+end
+
+def fun_l1_n898()
+    fun_l2_n493
+end
+
+def fun_l1_n899()
+    fun_l2_n308
+end
+
+def fun_l1_n900()
+    fun_l2_n781
+end
+
+def fun_l1_n901()
+    fun_l2_n970
+end
+
+def fun_l1_n902()
+    fun_l2_n371
+end
+
+def fun_l1_n903()
+    fun_l2_n195
+end
+
+def fun_l1_n904()
+    fun_l2_n662
+end
+
+def fun_l1_n905()
+    fun_l2_n172
+end
+
+def fun_l1_n906()
+    fun_l2_n579
+end
+
+def fun_l1_n907()
+    fun_l2_n913
+end
+
+def fun_l1_n908()
+    fun_l2_n949
+end
+
+def fun_l1_n909()
+    fun_l2_n386
+end
+
+def fun_l1_n910()
+    fun_l2_n727
+end
+
+def fun_l1_n911()
+    fun_l2_n283
+end
+
+def fun_l1_n912()
+    fun_l2_n136
+end
+
+def fun_l1_n913()
+    fun_l2_n818
+end
+
+def fun_l1_n914()
+    fun_l2_n118
+end
+
+def fun_l1_n915()
+    fun_l2_n366
+end
+
+def fun_l1_n916()
+    fun_l2_n362
+end
+
+def fun_l1_n917()
+    fun_l2_n854
+end
+
+def fun_l1_n918()
+    fun_l2_n272
+end
+
+def fun_l1_n919()
+    fun_l2_n754
+end
+
+def fun_l1_n920()
+    fun_l2_n145
+end
+
+def fun_l1_n921()
+    fun_l2_n631
+end
+
+def fun_l1_n922()
+    fun_l2_n131
+end
+
+def fun_l1_n923()
+    fun_l2_n862
+end
+
+def fun_l1_n924()
+    fun_l2_n930
+end
+
+def fun_l1_n925()
+    fun_l2_n24
+end
+
+def fun_l1_n926()
+    fun_l2_n336
+end
+
+def fun_l1_n927()
+    fun_l2_n438
+end
+
+def fun_l1_n928()
+    fun_l2_n306
+end
+
+def fun_l1_n929()
+    fun_l2_n897
+end
+
+def fun_l1_n930()
+    fun_l2_n186
+end
+
+def fun_l1_n931()
+    fun_l2_n227
+end
+
+def fun_l1_n932()
+    fun_l2_n462
+end
+
+def fun_l1_n933()
+    fun_l2_n224
+end
+
+def fun_l1_n934()
+    fun_l2_n210
+end
+
+def fun_l1_n935()
+    fun_l2_n315
+end
+
+def fun_l1_n936()
+    fun_l2_n850
+end
+
+def fun_l1_n937()
+    fun_l2_n997
+end
+
+def fun_l1_n938()
+    fun_l2_n703
+end
+
+def fun_l1_n939()
+    fun_l2_n635
+end
+
+def fun_l1_n940()
+    fun_l2_n507
+end
+
+def fun_l1_n941()
+    fun_l2_n202
+end
+
+def fun_l1_n942()
+    fun_l2_n319
+end
+
+def fun_l1_n943()
+    fun_l2_n785
+end
+
+def fun_l1_n944()
+    fun_l2_n26
+end
+
+def fun_l1_n945()
+    fun_l2_n777
+end
+
+def fun_l1_n946()
+    fun_l2_n235
+end
+
+def fun_l1_n947()
+    fun_l2_n845
+end
+
+def fun_l1_n948()
+    fun_l2_n515
+end
+
+def fun_l1_n949()
+    fun_l2_n427
+end
+
+def fun_l1_n950()
+    fun_l2_n34
+end
+
+def fun_l1_n951()
+    fun_l2_n905
+end
+
+def fun_l1_n952()
+    fun_l2_n683
+end
+
+def fun_l1_n953()
+    fun_l2_n171
+end
+
+def fun_l1_n954()
+    fun_l2_n593
+end
+
+def fun_l1_n955()
+    fun_l2_n191
+end
+
+def fun_l1_n956()
+    fun_l2_n370
+end
+
+def fun_l1_n957()
+    fun_l2_n911
+end
+
+def fun_l1_n958()
+    fun_l2_n813
+end
+
+def fun_l1_n959()
+    fun_l2_n765
+end
+
+def fun_l1_n960()
+    fun_l2_n434
+end
+
+def fun_l1_n961()
+    fun_l2_n442
+end
+
+def fun_l1_n962()
+    fun_l2_n390
+end
+
+def fun_l1_n963()
+    fun_l2_n549
+end
+
+def fun_l1_n964()
+    fun_l2_n757
+end
+
+def fun_l1_n965()
+    fun_l2_n12
+end
+
+def fun_l1_n966()
+    fun_l2_n456
+end
+
+def fun_l1_n967()
+    fun_l2_n889
+end
+
+def fun_l1_n968()
+    fun_l2_n933
+end
+
+def fun_l1_n969()
+    fun_l2_n695
+end
+
+def fun_l1_n970()
+    fun_l2_n628
+end
+
+def fun_l1_n971()
+    fun_l2_n265
+end
+
+def fun_l1_n972()
+    fun_l2_n634
+end
+
+def fun_l1_n973()
+    fun_l2_n31
+end
+
+def fun_l1_n974()
+    fun_l2_n49
+end
+
+def fun_l1_n975()
+    fun_l2_n872
+end
+
+def fun_l1_n976()
+    fun_l2_n475
+end
+
+def fun_l1_n977()
+    fun_l2_n927
+end
+
+def fun_l1_n978()
+    fun_l2_n459
+end
+
+def fun_l1_n979()
+    fun_l2_n364
+end
+
+def fun_l1_n980()
+    fun_l2_n246
+end
+
+def fun_l1_n981()
+    fun_l2_n693
+end
+
+def fun_l1_n982()
+    fun_l2_n218
+end
+
+def fun_l1_n983()
+    fun_l2_n21
+end
+
+def fun_l1_n984()
+    fun_l2_n967
+end
+
+def fun_l1_n985()
+    fun_l2_n81
+end
+
+def fun_l1_n986()
+    fun_l2_n753
+end
+
+def fun_l1_n987()
+    fun_l2_n386
+end
+
+def fun_l1_n988()
+    fun_l2_n394
+end
+
+def fun_l1_n989()
+    fun_l2_n804
+end
+
+def fun_l1_n990()
+    fun_l2_n55
+end
+
+def fun_l1_n991()
+    fun_l2_n359
+end
+
+def fun_l1_n992()
+    fun_l2_n883
+end
+
+def fun_l1_n993()
+    fun_l2_n404
+end
+
+def fun_l1_n994()
+    fun_l2_n145
+end
+
+def fun_l1_n995()
+    fun_l2_n684
+end
+
+def fun_l1_n996()
+    fun_l2_n38
+end
+
+def fun_l1_n997()
+    fun_l2_n309
+end
+
+def fun_l1_n998()
+    fun_l2_n560
+end
+
+def fun_l1_n999()
+    fun_l2_n95
+end
+
+def fun_l2_n0()
+    fun_l3_n813
+end
+
+def fun_l2_n1()
+    fun_l3_n785
+end
+
+def fun_l2_n2()
+    fun_l3_n218
+end
+
+def fun_l2_n3()
+    fun_l3_n111
+end
+
+def fun_l2_n4()
+    fun_l3_n581
+end
+
+def fun_l2_n5()
+    fun_l3_n873
+end
+
+def fun_l2_n6()
+    fun_l3_n123
+end
+
+def fun_l2_n7()
+    fun_l3_n576
+end
+
+def fun_l2_n8()
+    fun_l3_n543
+end
+
+def fun_l2_n9()
+    fun_l3_n720
+end
+
+def fun_l2_n10()
+    fun_l3_n970
+end
+
+def fun_l2_n11()
+    fun_l3_n663
+end
+
+def fun_l2_n12()
+    fun_l3_n549
+end
+
+def fun_l2_n13()
+    fun_l3_n787
+end
+
+def fun_l2_n14()
+    fun_l3_n15
+end
+
+def fun_l2_n15()
+    fun_l3_n858
+end
+
+def fun_l2_n16()
+    fun_l3_n873
+end
+
+def fun_l2_n17()
+    fun_l3_n482
+end
+
+def fun_l2_n18()
+    fun_l3_n26
+end
+
+def fun_l2_n19()
+    fun_l3_n591
+end
+
+def fun_l2_n20()
+    fun_l3_n879
+end
+
+def fun_l2_n21()
+    fun_l3_n891
+end
+
+def fun_l2_n22()
+    fun_l3_n381
+end
+
+def fun_l2_n23()
+    fun_l3_n504
+end
+
+def fun_l2_n24()
+    fun_l3_n595
+end
+
+def fun_l2_n25()
+    fun_l3_n985
+end
+
+def fun_l2_n26()
+    fun_l3_n77
+end
+
+def fun_l2_n27()
+    fun_l3_n144
+end
+
+def fun_l2_n28()
+    fun_l3_n912
+end
+
+def fun_l2_n29()
+    fun_l3_n1
+end
+
+def fun_l2_n30()
+    fun_l3_n816
+end
+
+def fun_l2_n31()
+    fun_l3_n246
+end
+
+def fun_l2_n32()
+    fun_l3_n599
+end
+
+def fun_l2_n33()
+    fun_l3_n961
+end
+
+def fun_l2_n34()
+    fun_l3_n392
+end
+
+def fun_l2_n35()
+    fun_l3_n437
+end
+
+def fun_l2_n36()
+    fun_l3_n520
+end
+
+def fun_l2_n37()
+    fun_l3_n146
+end
+
+def fun_l2_n38()
+    fun_l3_n186
+end
+
+def fun_l2_n39()
+    fun_l3_n699
+end
+
+def fun_l2_n40()
+    fun_l3_n863
+end
+
+def fun_l2_n41()
+    fun_l3_n539
+end
+
+def fun_l2_n42()
+    fun_l3_n581
+end
+
+def fun_l2_n43()
+    fun_l3_n325
+end
+
+def fun_l2_n44()
+    fun_l3_n604
+end
+
+def fun_l2_n45()
+    fun_l3_n79
+end
+
+def fun_l2_n46()
+    fun_l3_n530
+end
+
+def fun_l2_n47()
+    fun_l3_n344
+end
+
+def fun_l2_n48()
+    fun_l3_n92
+end
+
+def fun_l2_n49()
+    fun_l3_n826
+end
+
+def fun_l2_n50()
+    fun_l3_n283
+end
+
+def fun_l2_n51()
+    fun_l3_n220
+end
+
+def fun_l2_n52()
+    fun_l3_n96
+end
+
+def fun_l2_n53()
+    fun_l3_n647
+end
+
+def fun_l2_n54()
+    fun_l3_n664
+end
+
+def fun_l2_n55()
+    fun_l3_n718
+end
+
+def fun_l2_n56()
+    fun_l3_n281
+end
+
+def fun_l2_n57()
+    fun_l3_n214
+end
+
+def fun_l2_n58()
+    fun_l3_n143
+end
+
+def fun_l2_n59()
+    fun_l3_n423
+end
+
+def fun_l2_n60()
+    fun_l3_n815
+end
+
+def fun_l2_n61()
+    fun_l3_n561
+end
+
+def fun_l2_n62()
+    fun_l3_n634
+end
+
+def fun_l2_n63()
+    fun_l3_n354
+end
+
+def fun_l2_n64()
+    fun_l3_n39
+end
+
+def fun_l2_n65()
+    fun_l3_n704
+end
+
+def fun_l2_n66()
+    fun_l3_n193
+end
+
+def fun_l2_n67()
+    fun_l3_n267
+end
+
+def fun_l2_n68()
+    fun_l3_n225
+end
+
+def fun_l2_n69()
+    fun_l3_n253
+end
+
+def fun_l2_n70()
+    fun_l3_n97
+end
+
+def fun_l2_n71()
+    fun_l3_n312
+end
+
+def fun_l2_n72()
+    fun_l3_n663
+end
+
+def fun_l2_n73()
+    fun_l3_n730
+end
+
+def fun_l2_n74()
+    fun_l3_n31
+end
+
+def fun_l2_n75()
+    fun_l3_n94
+end
+
+def fun_l2_n76()
+    fun_l3_n719
+end
+
+def fun_l2_n77()
+    fun_l3_n72
+end
+
+def fun_l2_n78()
+    fun_l3_n593
+end
+
+def fun_l2_n79()
+    fun_l3_n586
+end
+
+def fun_l2_n80()
+    fun_l3_n477
+end
+
+def fun_l2_n81()
+    fun_l3_n406
+end
+
+def fun_l2_n82()
+    fun_l3_n624
+end
+
+def fun_l2_n83()
+    fun_l3_n127
+end
+
+def fun_l2_n84()
+    fun_l3_n993
+end
+
+def fun_l2_n85()
+    fun_l3_n764
+end
+
+def fun_l2_n86()
+    fun_l3_n892
+end
+
+def fun_l2_n87()
+    fun_l3_n147
+end
+
+def fun_l2_n88()
+    fun_l3_n971
+end
+
+def fun_l2_n89()
+    fun_l3_n239
+end
+
+def fun_l2_n90()
+    fun_l3_n96
+end
+
+def fun_l2_n91()
+    fun_l3_n686
+end
+
+def fun_l2_n92()
+    fun_l3_n388
+end
+
+def fun_l2_n93()
+    fun_l3_n848
+end
+
+def fun_l2_n94()
+    fun_l3_n415
+end
+
+def fun_l2_n95()
+    fun_l3_n155
+end
+
+def fun_l2_n96()
+    fun_l3_n245
+end
+
+def fun_l2_n97()
+    fun_l3_n103
+end
+
+def fun_l2_n98()
+    fun_l3_n591
+end
+
+def fun_l2_n99()
+    fun_l3_n610
+end
+
+def fun_l2_n100()
+    fun_l3_n925
+end
+
+def fun_l2_n101()
+    fun_l3_n435
+end
+
+def fun_l2_n102()
+    fun_l3_n580
+end
+
+def fun_l2_n103()
+    fun_l3_n116
+end
+
+def fun_l2_n104()
+    fun_l3_n160
+end
+
+def fun_l2_n105()
+    fun_l3_n245
+end
+
+def fun_l2_n106()
+    fun_l3_n970
+end
+
+def fun_l2_n107()
+    fun_l3_n540
+end
+
+def fun_l2_n108()
+    fun_l3_n385
+end
+
+def fun_l2_n109()
+    fun_l3_n292
+end
+
+def fun_l2_n110()
+    fun_l3_n785
+end
+
+def fun_l2_n111()
+    fun_l3_n310
+end
+
+def fun_l2_n112()
+    fun_l3_n983
+end
+
+def fun_l2_n113()
+    fun_l3_n378
+end
+
+def fun_l2_n114()
+    fun_l3_n538
+end
+
+def fun_l2_n115()
+    fun_l3_n161
+end
+
+def fun_l2_n116()
+    fun_l3_n537
+end
+
+def fun_l2_n117()
+    fun_l3_n1
+end
+
+def fun_l2_n118()
+    fun_l3_n606
+end
+
+def fun_l2_n119()
+    fun_l3_n377
+end
+
+def fun_l2_n120()
+    fun_l3_n839
+end
+
+def fun_l2_n121()
+    fun_l3_n174
+end
+
+def fun_l2_n122()
+    fun_l3_n709
+end
+
+def fun_l2_n123()
+    fun_l3_n384
+end
+
+def fun_l2_n124()
+    fun_l3_n566
+end
+
+def fun_l2_n125()
+    fun_l3_n329
+end
+
+def fun_l2_n126()
+    fun_l3_n238
+end
+
+def fun_l2_n127()
+    fun_l3_n366
+end
+
+def fun_l2_n128()
+    fun_l3_n443
+end
+
+def fun_l2_n129()
+    fun_l3_n901
+end
+
+def fun_l2_n130()
+    fun_l3_n16
+end
+
+def fun_l2_n131()
+    fun_l3_n959
+end
+
+def fun_l2_n132()
+    fun_l3_n460
+end
+
+def fun_l2_n133()
+    fun_l3_n26
+end
+
+def fun_l2_n134()
+    fun_l3_n552
+end
+
+def fun_l2_n135()
+    fun_l3_n207
+end
+
+def fun_l2_n136()
+    fun_l3_n804
+end
+
+def fun_l2_n137()
+    fun_l3_n178
+end
+
+def fun_l2_n138()
+    fun_l3_n826
+end
+
+def fun_l2_n139()
+    fun_l3_n421
+end
+
+def fun_l2_n140()
+    fun_l3_n101
+end
+
+def fun_l2_n141()
+    fun_l3_n529
+end
+
+def fun_l2_n142()
+    fun_l3_n594
+end
+
+def fun_l2_n143()
+    fun_l3_n977
+end
+
+def fun_l2_n144()
+    fun_l3_n859
+end
+
+def fun_l2_n145()
+    fun_l3_n24
+end
+
+def fun_l2_n146()
+    fun_l3_n806
+end
+
+def fun_l2_n147()
+    fun_l3_n355
+end
+
+def fun_l2_n148()
+    fun_l3_n648
+end
+
+def fun_l2_n149()
+    fun_l3_n554
+end
+
+def fun_l2_n150()
+    fun_l3_n188
+end
+
+def fun_l2_n151()
+    fun_l3_n711
+end
+
+def fun_l2_n152()
+    fun_l3_n574
+end
+
+def fun_l2_n153()
+    fun_l3_n667
+end
+
+def fun_l2_n154()
+    fun_l3_n638
+end
+
+def fun_l2_n155()
+    fun_l3_n283
+end
+
+def fun_l2_n156()
+    fun_l3_n999
+end
+
+def fun_l2_n157()
+    fun_l3_n412
+end
+
+def fun_l2_n158()
+    fun_l3_n621
+end
+
+def fun_l2_n159()
+    fun_l3_n821
+end
+
+def fun_l2_n160()
+    fun_l3_n857
+end
+
+def fun_l2_n161()
+    fun_l3_n73
+end
+
+def fun_l2_n162()
+    fun_l3_n768
+end
+
+def fun_l2_n163()
+    fun_l3_n929
+end
+
+def fun_l2_n164()
+    fun_l3_n205
+end
+
+def fun_l2_n165()
+    fun_l3_n120
+end
+
+def fun_l2_n166()
+    fun_l3_n787
+end
+
+def fun_l2_n167()
+    fun_l3_n69
+end
+
+def fun_l2_n168()
+    fun_l3_n567
+end
+
+def fun_l2_n169()
+    fun_l3_n106
+end
+
+def fun_l2_n170()
+    fun_l3_n751
+end
+
+def fun_l2_n171()
+    fun_l3_n642
+end
+
+def fun_l2_n172()
+    fun_l3_n744
+end
+
+def fun_l2_n173()
+    fun_l3_n730
+end
+
+def fun_l2_n174()
+    fun_l3_n681
+end
+
+def fun_l2_n175()
+    fun_l3_n493
+end
+
+def fun_l2_n176()
+    fun_l3_n773
+end
+
+def fun_l2_n177()
+    fun_l3_n393
+end
+
+def fun_l2_n178()
+    fun_l3_n702
+end
+
+def fun_l2_n179()
+    fun_l3_n353
+end
+
+def fun_l2_n180()
+    fun_l3_n21
+end
+
+def fun_l2_n181()
+    fun_l3_n575
+end
+
+def fun_l2_n182()
+    fun_l3_n975
+end
+
+def fun_l2_n183()
+    fun_l3_n969
+end
+
+def fun_l2_n184()
+    fun_l3_n8
+end
+
+def fun_l2_n185()
+    fun_l3_n81
+end
+
+def fun_l2_n186()
+    fun_l3_n650
+end
+
+def fun_l2_n187()
+    fun_l3_n257
+end
+
+def fun_l2_n188()
+    fun_l3_n443
+end
+
+def fun_l2_n189()
+    fun_l3_n647
+end
+
+def fun_l2_n190()
+    fun_l3_n783
+end
+
+def fun_l2_n191()
+    fun_l3_n447
+end
+
+def fun_l2_n192()
+    fun_l3_n50
+end
+
+def fun_l2_n193()
+    fun_l3_n25
+end
+
+def fun_l2_n194()
+    fun_l3_n646
+end
+
+def fun_l2_n195()
+    fun_l3_n878
+end
+
+def fun_l2_n196()
+    fun_l3_n156
+end
+
+def fun_l2_n197()
+    fun_l3_n999
+end
+
+def fun_l2_n198()
+    fun_l3_n292
+end
+
+def fun_l2_n199()
+    fun_l3_n386
+end
+
+def fun_l2_n200()
+    fun_l3_n3
+end
+
+def fun_l2_n201()
+    fun_l3_n111
+end
+
+def fun_l2_n202()
+    fun_l3_n89
+end
+
+def fun_l2_n203()
+    fun_l3_n628
+end
+
+def fun_l2_n204()
+    fun_l3_n384
+end
+
+def fun_l2_n205()
+    fun_l3_n951
+end
+
+def fun_l2_n206()
+    fun_l3_n662
+end
+
+def fun_l2_n207()
+    fun_l3_n607
+end
+
+def fun_l2_n208()
+    fun_l3_n245
+end
+
+def fun_l2_n209()
+    fun_l3_n875
+end
+
+def fun_l2_n210()
+    fun_l3_n493
+end
+
+def fun_l2_n211()
+    fun_l3_n639
+end
+
+def fun_l2_n212()
+    fun_l3_n257
+end
+
+def fun_l2_n213()
+    fun_l3_n710
+end
+
+def fun_l2_n214()
+    fun_l3_n848
+end
+
+def fun_l2_n215()
+    fun_l3_n86
+end
+
+def fun_l2_n216()
+    fun_l3_n269
+end
+
+def fun_l2_n217()
+    fun_l3_n907
+end
+
+def fun_l2_n218()
+    fun_l3_n491
+end
+
+def fun_l2_n219()
+    fun_l3_n194
+end
+
+def fun_l2_n220()
+    fun_l3_n204
+end
+
+def fun_l2_n221()
+    fun_l3_n647
+end
+
+def fun_l2_n222()
+    fun_l3_n277
+end
+
+def fun_l2_n223()
+    fun_l3_n687
+end
+
+def fun_l2_n224()
+    fun_l3_n438
+end
+
+def fun_l2_n225()
+    fun_l3_n634
+end
+
+def fun_l2_n226()
+    fun_l3_n826
+end
+
+def fun_l2_n227()
+    fun_l3_n702
+end
+
+def fun_l2_n228()
+    fun_l3_n541
+end
+
+def fun_l2_n229()
+    fun_l3_n741
+end
+
+def fun_l2_n230()
+    fun_l3_n886
+end
+
+def fun_l2_n231()
+    fun_l3_n243
+end
+
+def fun_l2_n232()
+    fun_l3_n313
+end
+
+def fun_l2_n233()
+    fun_l3_n499
+end
+
+def fun_l2_n234()
+    fun_l3_n100
+end
+
+def fun_l2_n235()
+    fun_l3_n958
+end
+
+def fun_l2_n236()
+    fun_l3_n192
+end
+
+def fun_l2_n237()
+    fun_l3_n529
+end
+
+def fun_l2_n238()
+    fun_l3_n761
+end
+
+def fun_l2_n239()
+    fun_l3_n558
+end
+
+def fun_l2_n240()
+    fun_l3_n58
+end
+
+def fun_l2_n241()
+    fun_l3_n65
+end
+
+def fun_l2_n242()
+    fun_l3_n685
+end
+
+def fun_l2_n243()
+    fun_l3_n418
+end
+
+def fun_l2_n244()
+    fun_l3_n206
+end
+
+def fun_l2_n245()
+    fun_l3_n147
+end
+
+def fun_l2_n246()
+    fun_l3_n98
+end
+
+def fun_l2_n247()
+    fun_l3_n104
+end
+
+def fun_l2_n248()
+    fun_l3_n336
+end
+
+def fun_l2_n249()
+    fun_l3_n406
+end
+
+def fun_l2_n250()
+    fun_l3_n835
+end
+
+def fun_l2_n251()
+    fun_l3_n611
+end
+
+def fun_l2_n252()
+    fun_l3_n890
+end
+
+def fun_l2_n253()
+    fun_l3_n272
+end
+
+def fun_l2_n254()
+    fun_l3_n962
+end
+
+def fun_l2_n255()
+    fun_l3_n960
+end
+
+def fun_l2_n256()
+    fun_l3_n675
+end
+
+def fun_l2_n257()
+    fun_l3_n161
+end
+
+def fun_l2_n258()
+    fun_l3_n509
+end
+
+def fun_l2_n259()
+    fun_l3_n36
+end
+
+def fun_l2_n260()
+    fun_l3_n381
+end
+
+def fun_l2_n261()
+    fun_l3_n721
+end
+
+def fun_l2_n262()
+    fun_l3_n807
+end
+
+def fun_l2_n263()
+    fun_l3_n424
+end
+
+def fun_l2_n264()
+    fun_l3_n733
+end
+
+def fun_l2_n265()
+    fun_l3_n417
+end
+
+def fun_l2_n266()
+    fun_l3_n630
+end
+
+def fun_l2_n267()
+    fun_l3_n733
+end
+
+def fun_l2_n268()
+    fun_l3_n797
+end
+
+def fun_l2_n269()
+    fun_l3_n446
+end
+
+def fun_l2_n270()
+    fun_l3_n877
+end
+
+def fun_l2_n271()
+    fun_l3_n64
+end
+
+def fun_l2_n272()
+    fun_l3_n553
+end
+
+def fun_l2_n273()
+    fun_l3_n369
+end
+
+def fun_l2_n274()
+    fun_l3_n261
+end
+
+def fun_l2_n275()
+    fun_l3_n244
+end
+
+def fun_l2_n276()
+    fun_l3_n544
+end
+
+def fun_l2_n277()
+    fun_l3_n779
+end
+
+def fun_l2_n278()
+    fun_l3_n864
+end
+
+def fun_l2_n279()
+    fun_l3_n235
+end
+
+def fun_l2_n280()
+    fun_l3_n343
+end
+
+def fun_l2_n281()
+    fun_l3_n601
+end
+
+def fun_l2_n282()
+    fun_l3_n925
+end
+
+def fun_l2_n283()
+    fun_l3_n822
+end
+
+def fun_l2_n284()
+    fun_l3_n675
+end
+
+def fun_l2_n285()
+    fun_l3_n791
+end
+
+def fun_l2_n286()
+    fun_l3_n359
+end
+
+def fun_l2_n287()
+    fun_l3_n596
+end
+
+def fun_l2_n288()
+    fun_l3_n153
+end
+
+def fun_l2_n289()
+    fun_l3_n420
+end
+
+def fun_l2_n290()
+    fun_l3_n464
+end
+
+def fun_l2_n291()
+    fun_l3_n393
+end
+
+def fun_l2_n292()
+    fun_l3_n614
+end
+
+def fun_l2_n293()
+    fun_l3_n449
+end
+
+def fun_l2_n294()
+    fun_l3_n561
+end
+
+def fun_l2_n295()
+    fun_l3_n119
+end
+
+def fun_l2_n296()
+    fun_l3_n82
+end
+
+def fun_l2_n297()
+    fun_l3_n932
+end
+
+def fun_l2_n298()
+    fun_l3_n505
+end
+
+def fun_l2_n299()
+    fun_l3_n664
+end
+
+def fun_l2_n300()
+    fun_l3_n222
+end
+
+def fun_l2_n301()
+    fun_l3_n428
+end
+
+def fun_l2_n302()
+    fun_l3_n975
+end
+
+def fun_l2_n303()
+    fun_l3_n481
+end
+
+def fun_l2_n304()
+    fun_l3_n263
+end
+
+def fun_l2_n305()
+    fun_l3_n816
+end
+
+def fun_l2_n306()
+    fun_l3_n58
+end
+
+def fun_l2_n307()
+    fun_l3_n89
+end
+
+def fun_l2_n308()
+    fun_l3_n509
+end
+
+def fun_l2_n309()
+    fun_l3_n162
+end
+
+def fun_l2_n310()
+    fun_l3_n222
+end
+
+def fun_l2_n311()
+    fun_l3_n999
+end
+
+def fun_l2_n312()
+    fun_l3_n26
+end
+
+def fun_l2_n313()
+    fun_l3_n857
+end
+
+def fun_l2_n314()
+    fun_l3_n485
+end
+
+def fun_l2_n315()
+    fun_l3_n935
+end
+
+def fun_l2_n316()
+    fun_l3_n159
+end
+
+def fun_l2_n317()
+    fun_l3_n987
+end
+
+def fun_l2_n318()
+    fun_l3_n122
+end
+
+def fun_l2_n319()
+    fun_l3_n675
+end
+
+def fun_l2_n320()
+    fun_l3_n88
+end
+
+def fun_l2_n321()
+    fun_l3_n84
+end
+
+def fun_l2_n322()
+    fun_l3_n17
+end
+
+def fun_l2_n323()
+    fun_l3_n859
+end
+
+def fun_l2_n324()
+    fun_l3_n340
+end
+
+def fun_l2_n325()
+    fun_l3_n122
+end
+
+def fun_l2_n326()
+    fun_l3_n675
+end
+
+def fun_l2_n327()
+    fun_l3_n502
+end
+
+def fun_l2_n328()
+    fun_l3_n56
+end
+
+def fun_l2_n329()
+    fun_l3_n398
+end
+
+def fun_l2_n330()
+    fun_l3_n985
+end
+
+def fun_l2_n331()
+    fun_l3_n117
+end
+
+def fun_l2_n332()
+    fun_l3_n264
+end
+
+def fun_l2_n333()
+    fun_l3_n664
+end
+
+def fun_l2_n334()
+    fun_l3_n958
+end
+
+def fun_l2_n335()
+    fun_l3_n495
+end
+
+def fun_l2_n336()
+    fun_l3_n794
+end
+
+def fun_l2_n337()
+    fun_l3_n95
+end
+
+def fun_l2_n338()
+    fun_l3_n202
+end
+
+def fun_l2_n339()
+    fun_l3_n510
+end
+
+def fun_l2_n340()
+    fun_l3_n919
+end
+
+def fun_l2_n341()
+    fun_l3_n602
+end
+
+def fun_l2_n342()
+    fun_l3_n750
+end
+
+def fun_l2_n343()
+    fun_l3_n122
+end
+
+def fun_l2_n344()
+    fun_l3_n358
+end
+
+def fun_l2_n345()
+    fun_l3_n539
+end
+
+def fun_l2_n346()
+    fun_l3_n67
+end
+
+def fun_l2_n347()
+    fun_l3_n881
+end
+
+def fun_l2_n348()
+    fun_l3_n257
+end
+
+def fun_l2_n349()
+    fun_l3_n987
+end
+
+def fun_l2_n350()
+    fun_l3_n482
+end
+
+def fun_l2_n351()
+    fun_l3_n803
+end
+
+def fun_l2_n352()
+    fun_l3_n172
+end
+
+def fun_l2_n353()
+    fun_l3_n826
+end
+
+def fun_l2_n354()
+    fun_l3_n977
+end
+
+def fun_l2_n355()
+    fun_l3_n976
+end
+
+def fun_l2_n356()
+    fun_l3_n970
+end
+
+def fun_l2_n357()
+    fun_l3_n904
+end
+
+def fun_l2_n358()
+    fun_l3_n735
+end
+
+def fun_l2_n359()
+    fun_l3_n146
+end
+
+def fun_l2_n360()
+    fun_l3_n810
+end
+
+def fun_l2_n361()
+    fun_l3_n591
+end
+
+def fun_l2_n362()
+    fun_l3_n882
+end
+
+def fun_l2_n363()
+    fun_l3_n980
+end
+
+def fun_l2_n364()
+    fun_l3_n594
+end
+
+def fun_l2_n365()
+    fun_l3_n431
+end
+
+def fun_l2_n366()
+    fun_l3_n225
+end
+
+def fun_l2_n367()
+    fun_l3_n11
+end
+
+def fun_l2_n368()
+    fun_l3_n283
+end
+
+def fun_l2_n369()
+    fun_l3_n476
+end
+
+def fun_l2_n370()
+    fun_l3_n382
+end
+
+def fun_l2_n371()
+    fun_l3_n422
+end
+
+def fun_l2_n372()
+    fun_l3_n272
+end
+
+def fun_l2_n373()
+    fun_l3_n911
+end
+
+def fun_l2_n374()
+    fun_l3_n282
+end
+
+def fun_l2_n375()
+    fun_l3_n388
+end
+
+def fun_l2_n376()
+    fun_l3_n928
+end
+
+def fun_l2_n377()
+    fun_l3_n784
+end
+
+def fun_l2_n378()
+    fun_l3_n817
+end
+
+def fun_l2_n379()
+    fun_l3_n799
+end
+
+def fun_l2_n380()
+    fun_l3_n538
+end
+
+def fun_l2_n381()
+    fun_l3_n24
+end
+
+def fun_l2_n382()
+    fun_l3_n726
+end
+
+def fun_l2_n383()
+    fun_l3_n213
+end
+
+def fun_l2_n384()
+    fun_l3_n15
+end
+
+def fun_l2_n385()
+    fun_l3_n915
+end
+
+def fun_l2_n386()
+    fun_l3_n357
+end
+
+def fun_l2_n387()
+    fun_l3_n343
+end
+
+def fun_l2_n388()
+    fun_l3_n258
+end
+
+def fun_l2_n389()
+    fun_l3_n396
+end
+
+def fun_l2_n390()
+    fun_l3_n478
+end
+
+def fun_l2_n391()
+    fun_l3_n122
+end
+
+def fun_l2_n392()
+    fun_l3_n925
+end
+
+def fun_l2_n393()
+    fun_l3_n6
+end
+
+def fun_l2_n394()
+    fun_l3_n251
+end
+
+def fun_l2_n395()
+    fun_l3_n21
+end
+
+def fun_l2_n396()
+    fun_l3_n781
+end
+
+def fun_l2_n397()
+    fun_l3_n765
+end
+
+def fun_l2_n398()
+    fun_l3_n574
+end
+
+def fun_l2_n399()
+    fun_l3_n347
+end
+
+def fun_l2_n400()
+    fun_l3_n409
+end
+
+def fun_l2_n401()
+    fun_l3_n343
+end
+
+def fun_l2_n402()
+    fun_l3_n580
+end
+
+def fun_l2_n403()
+    fun_l3_n878
+end
+
+def fun_l2_n404()
+    fun_l3_n150
+end
+
+def fun_l2_n405()
+    fun_l3_n900
+end
+
+def fun_l2_n406()
+    fun_l3_n19
+end
+
+def fun_l2_n407()
+    fun_l3_n671
+end
+
+def fun_l2_n408()
+    fun_l3_n714
+end
+
+def fun_l2_n409()
+    fun_l3_n865
+end
+
+def fun_l2_n410()
+    fun_l3_n634
+end
+
+def fun_l2_n411()
+    fun_l3_n780
+end
+
+def fun_l2_n412()
+    fun_l3_n404
+end
+
+def fun_l2_n413()
+    fun_l3_n506
+end
+
+def fun_l2_n414()
+    fun_l3_n503
+end
+
+def fun_l2_n415()
+    fun_l3_n120
+end
+
+def fun_l2_n416()
+    fun_l3_n603
+end
+
+def fun_l2_n417()
+    fun_l3_n263
+end
+
+def fun_l2_n418()
+    fun_l3_n142
+end
+
+def fun_l2_n419()
+    fun_l3_n174
+end
+
+def fun_l2_n420()
+    fun_l3_n474
+end
+
+def fun_l2_n421()
+    fun_l3_n980
+end
+
+def fun_l2_n422()
+    fun_l3_n302
+end
+
+def fun_l2_n423()
+    fun_l3_n850
+end
+
+def fun_l2_n424()
+    fun_l3_n395
+end
+
+def fun_l2_n425()
+    fun_l3_n49
+end
+
+def fun_l2_n426()
+    fun_l3_n732
+end
+
+def fun_l2_n427()
+    fun_l3_n473
+end
+
+def fun_l2_n428()
+    fun_l3_n906
+end
+
+def fun_l2_n429()
+    fun_l3_n120
+end
+
+def fun_l2_n430()
+    fun_l3_n818
+end
+
+def fun_l2_n431()
+    fun_l3_n177
+end
+
+def fun_l2_n432()
+    fun_l3_n47
+end
+
+def fun_l2_n433()
+    fun_l3_n423
+end
+
+def fun_l2_n434()
+    fun_l3_n435
+end
+
+def fun_l2_n435()
+    fun_l3_n748
+end
+
+def fun_l2_n436()
+    fun_l3_n953
+end
+
+def fun_l2_n437()
+    fun_l3_n78
+end
+
+def fun_l2_n438()
+    fun_l3_n184
+end
+
+def fun_l2_n439()
+    fun_l3_n533
+end
+
+def fun_l2_n440()
+    fun_l3_n184
+end
+
+def fun_l2_n441()
+    fun_l3_n698
+end
+
+def fun_l2_n442()
+    fun_l3_n752
+end
+
+def fun_l2_n443()
+    fun_l3_n448
+end
+
+def fun_l2_n444()
+    fun_l3_n307
+end
+
+def fun_l2_n445()
+    fun_l3_n333
+end
+
+def fun_l2_n446()
+    fun_l3_n237
+end
+
+def fun_l2_n447()
+    fun_l3_n550
+end
+
+def fun_l2_n448()
+    fun_l3_n951
+end
+
+def fun_l2_n449()
+    fun_l3_n341
+end
+
+def fun_l2_n450()
+    fun_l3_n188
+end
+
+def fun_l2_n451()
+    fun_l3_n505
+end
+
+def fun_l2_n452()
+    fun_l3_n779
+end
+
+def fun_l2_n453()
+    fun_l3_n368
+end
+
+def fun_l2_n454()
+    fun_l3_n191
+end
+
+def fun_l2_n455()
+    fun_l3_n952
+end
+
+def fun_l2_n456()
+    fun_l3_n472
+end
+
+def fun_l2_n457()
+    fun_l3_n294
+end
+
+def fun_l2_n458()
+    fun_l3_n280
+end
+
+def fun_l2_n459()
+    fun_l3_n794
+end
+
+def fun_l2_n460()
+    fun_l3_n780
+end
+
+def fun_l2_n461()
+    fun_l3_n527
+end
+
+def fun_l2_n462()
+    fun_l3_n129
+end
+
+def fun_l2_n463()
+    fun_l3_n365
+end
+
+def fun_l2_n464()
+    fun_l3_n898
+end
+
+def fun_l2_n465()
+    fun_l3_n932
+end
+
+def fun_l2_n466()
+    fun_l3_n616
+end
+
+def fun_l2_n467()
+    fun_l3_n828
+end
+
+def fun_l2_n468()
+    fun_l3_n660
+end
+
+def fun_l2_n469()
+    fun_l3_n255
+end
+
+def fun_l2_n470()
+    fun_l3_n845
+end
+
+def fun_l2_n471()
+    fun_l3_n347
+end
+
+def fun_l2_n472()
+    fun_l3_n154
+end
+
+def fun_l2_n473()
+    fun_l3_n349
+end
+
+def fun_l2_n474()
+    fun_l3_n276
+end
+
+def fun_l2_n475()
+    fun_l3_n962
+end
+
+def fun_l2_n476()
+    fun_l3_n195
+end
+
+def fun_l2_n477()
+    fun_l3_n648
+end
+
+def fun_l2_n478()
+    fun_l3_n692
+end
+
+def fun_l2_n479()
+    fun_l3_n294
+end
+
+def fun_l2_n480()
+    fun_l3_n144
+end
+
+def fun_l2_n481()
+    fun_l3_n702
+end
+
+def fun_l2_n482()
+    fun_l3_n110
+end
+
+def fun_l2_n483()
+    fun_l3_n169
+end
+
+def fun_l2_n484()
+    fun_l3_n140
+end
+
+def fun_l2_n485()
+    fun_l3_n614
+end
+
+def fun_l2_n486()
+    fun_l3_n309
+end
+
+def fun_l2_n487()
+    fun_l3_n792
+end
+
+def fun_l2_n488()
+    fun_l3_n465
+end
+
+def fun_l2_n489()
+    fun_l3_n892
+end
+
+def fun_l2_n490()
+    fun_l3_n205
+end
+
+def fun_l2_n491()
+    fun_l3_n267
+end
+
+def fun_l2_n492()
+    fun_l3_n743
+end
+
+def fun_l2_n493()
+    fun_l3_n669
+end
+
+def fun_l2_n494()
+    fun_l3_n882
+end
+
+def fun_l2_n495()
+    fun_l3_n654
+end
+
+def fun_l2_n496()
+    fun_l3_n885
+end
+
+def fun_l2_n497()
+    fun_l3_n955
+end
+
+def fun_l2_n498()
+    fun_l3_n251
+end
+
+def fun_l2_n499()
+    fun_l3_n521
+end
+
+def fun_l2_n500()
+    fun_l3_n484
+end
+
+def fun_l2_n501()
+    fun_l3_n525
+end
+
+def fun_l2_n502()
+    fun_l3_n493
+end
+
+def fun_l2_n503()
+    fun_l3_n161
+end
+
+def fun_l2_n504()
+    fun_l3_n447
+end
+
+def fun_l2_n505()
+    fun_l3_n339
+end
+
+def fun_l2_n506()
+    fun_l3_n946
+end
+
+def fun_l2_n507()
+    fun_l3_n564
+end
+
+def fun_l2_n508()
+    fun_l3_n586
+end
+
+def fun_l2_n509()
+    fun_l3_n345
+end
+
+def fun_l2_n510()
+    fun_l3_n814
+end
+
+def fun_l2_n511()
+    fun_l3_n946
+end
+
+def fun_l2_n512()
+    fun_l3_n629
+end
+
+def fun_l2_n513()
+    fun_l3_n726
+end
+
+def fun_l2_n514()
+    fun_l3_n91
+end
+
+def fun_l2_n515()
+    fun_l3_n393
+end
+
+def fun_l2_n516()
+    fun_l3_n620
+end
+
+def fun_l2_n517()
+    fun_l3_n907
+end
+
+def fun_l2_n518()
+    fun_l3_n911
+end
+
+def fun_l2_n519()
+    fun_l3_n361
+end
+
+def fun_l2_n520()
+    fun_l3_n420
+end
+
+def fun_l2_n521()
+    fun_l3_n479
+end
+
+def fun_l2_n522()
+    fun_l3_n686
+end
+
+def fun_l2_n523()
+    fun_l3_n888
+end
+
+def fun_l2_n524()
+    fun_l3_n141
+end
+
+def fun_l2_n525()
+    fun_l3_n830
+end
+
+def fun_l2_n526()
+    fun_l3_n681
+end
+
+def fun_l2_n527()
+    fun_l3_n58
+end
+
+def fun_l2_n528()
+    fun_l3_n835
+end
+
+def fun_l2_n529()
+    fun_l3_n390
+end
+
+def fun_l2_n530()
+    fun_l3_n930
+end
+
+def fun_l2_n531()
+    fun_l3_n569
+end
+
+def fun_l2_n532()
+    fun_l3_n943
+end
+
+def fun_l2_n533()
+    fun_l3_n888
+end
+
+def fun_l2_n534()
+    fun_l3_n220
+end
+
+def fun_l2_n535()
+    fun_l3_n809
+end
+
+def fun_l2_n536()
+    fun_l3_n382
+end
+
+def fun_l2_n537()
+    fun_l3_n356
+end
+
+def fun_l2_n538()
+    fun_l3_n912
+end
+
+def fun_l2_n539()
+    fun_l3_n151
+end
+
+def fun_l2_n540()
+    fun_l3_n740
+end
+
+def fun_l2_n541()
+    fun_l3_n925
+end
+
+def fun_l2_n542()
+    fun_l3_n776
+end
+
+def fun_l2_n543()
+    fun_l3_n4
+end
+
+def fun_l2_n544()
+    fun_l3_n549
+end
+
+def fun_l2_n545()
+    fun_l3_n220
+end
+
+def fun_l2_n546()
+    fun_l3_n932
+end
+
+def fun_l2_n547()
+    fun_l3_n267
+end
+
+def fun_l2_n548()
+    fun_l3_n646
+end
+
+def fun_l2_n549()
+    fun_l3_n217
+end
+
+def fun_l2_n550()
+    fun_l3_n217
+end
+
+def fun_l2_n551()
+    fun_l3_n197
+end
+
+def fun_l2_n552()
+    fun_l3_n419
+end
+
+def fun_l2_n553()
+    fun_l3_n232
+end
+
+def fun_l2_n554()
+    fun_l3_n327
+end
+
+def fun_l2_n555()
+    fun_l3_n201
+end
+
+def fun_l2_n556()
+    fun_l3_n567
+end
+
+def fun_l2_n557()
+    fun_l3_n870
+end
+
+def fun_l2_n558()
+    fun_l3_n222
+end
+
+def fun_l2_n559()
+    fun_l3_n792
+end
+
+def fun_l2_n560()
+    fun_l3_n157
+end
+
+def fun_l2_n561()
+    fun_l3_n870
+end
+
+def fun_l2_n562()
+    fun_l3_n564
+end
+
+def fun_l2_n563()
+    fun_l3_n571
+end
+
+def fun_l2_n564()
+    fun_l3_n211
+end
+
+def fun_l2_n565()
+    fun_l3_n657
+end
+
+def fun_l2_n566()
+    fun_l3_n869
+end
+
+def fun_l2_n567()
+    fun_l3_n288
+end
+
+def fun_l2_n568()
+    fun_l3_n736
+end
+
+def fun_l2_n569()
+    fun_l3_n273
+end
+
+def fun_l2_n570()
+    fun_l3_n194
+end
+
+def fun_l2_n571()
+    fun_l3_n435
+end
+
+def fun_l2_n572()
+    fun_l3_n775
+end
+
+def fun_l2_n573()
+    fun_l3_n342
+end
+
+def fun_l2_n574()
+    fun_l3_n843
+end
+
+def fun_l2_n575()
+    fun_l3_n585
+end
+
+def fun_l2_n576()
+    fun_l3_n518
+end
+
+def fun_l2_n577()
+    fun_l3_n524
+end
+
+def fun_l2_n578()
+    fun_l3_n457
+end
+
+def fun_l2_n579()
+    fun_l3_n905
+end
+
+def fun_l2_n580()
+    fun_l3_n346
+end
+
+def fun_l2_n581()
+    fun_l3_n412
+end
+
+def fun_l2_n582()
+    fun_l3_n970
+end
+
+def fun_l2_n583()
+    fun_l3_n648
+end
+
+def fun_l2_n584()
+    fun_l3_n870
+end
+
+def fun_l2_n585()
+    fun_l3_n783
+end
+
+def fun_l2_n586()
+    fun_l3_n856
+end
+
+def fun_l2_n587()
+    fun_l3_n708
+end
+
+def fun_l2_n588()
+    fun_l3_n473
+end
+
+def fun_l2_n589()
+    fun_l3_n277
+end
+
+def fun_l2_n590()
+    fun_l3_n112
+end
+
+def fun_l2_n591()
+    fun_l3_n785
+end
+
+def fun_l2_n592()
+    fun_l3_n283
+end
+
+def fun_l2_n593()
+    fun_l3_n720
+end
+
+def fun_l2_n594()
+    fun_l3_n195
+end
+
+def fun_l2_n595()
+    fun_l3_n923
+end
+
+def fun_l2_n596()
+    fun_l3_n306
+end
+
+def fun_l2_n597()
+    fun_l3_n108
+end
+
+def fun_l2_n598()
+    fun_l3_n615
+end
+
+def fun_l2_n599()
+    fun_l3_n135
+end
+
+def fun_l2_n600()
+    fun_l3_n710
+end
+
+def fun_l2_n601()
+    fun_l3_n722
+end
+
+def fun_l2_n602()
+    fun_l3_n943
+end
+
+def fun_l2_n603()
+    fun_l3_n626
+end
+
+def fun_l2_n604()
+    fun_l3_n702
+end
+
+def fun_l2_n605()
+    fun_l3_n812
+end
+
+def fun_l2_n606()
+    fun_l3_n551
+end
+
+def fun_l2_n607()
+    fun_l3_n497
+end
+
+def fun_l2_n608()
+    fun_l3_n123
+end
+
+def fun_l2_n609()
+    fun_l3_n302
+end
+
+def fun_l2_n610()
+    fun_l3_n850
+end
+
+def fun_l2_n611()
+    fun_l3_n327
+end
+
+def fun_l2_n612()
+    fun_l3_n529
+end
+
+def fun_l2_n613()
+    fun_l3_n441
+end
+
+def fun_l2_n614()
+    fun_l3_n26
+end
+
+def fun_l2_n615()
+    fun_l3_n275
+end
+
+def fun_l2_n616()
+    fun_l3_n211
+end
+
+def fun_l2_n617()
+    fun_l3_n253
+end
+
+def fun_l2_n618()
+    fun_l3_n767
+end
+
+def fun_l2_n619()
+    fun_l3_n601
+end
+
+def fun_l2_n620()
+    fun_l3_n350
+end
+
+def fun_l2_n621()
+    fun_l3_n407
+end
+
+def fun_l2_n622()
+    fun_l3_n12
+end
+
+def fun_l2_n623()
+    fun_l3_n378
+end
+
+def fun_l2_n624()
+    fun_l3_n159
+end
+
+def fun_l2_n625()
+    fun_l3_n521
+end
+
+def fun_l2_n626()
+    fun_l3_n657
+end
+
+def fun_l2_n627()
+    fun_l3_n997
+end
+
+def fun_l2_n628()
+    fun_l3_n504
+end
+
+def fun_l2_n629()
+    fun_l3_n177
+end
+
+def fun_l2_n630()
+    fun_l3_n352
+end
+
+def fun_l2_n631()
+    fun_l3_n579
+end
+
+def fun_l2_n632()
+    fun_l3_n607
+end
+
+def fun_l2_n633()
+    fun_l3_n430
+end
+
+def fun_l2_n634()
+    fun_l3_n437
+end
+
+def fun_l2_n635()
+    fun_l3_n495
+end
+
+def fun_l2_n636()
+    fun_l3_n247
+end
+
+def fun_l2_n637()
+    fun_l3_n68
+end
+
+def fun_l2_n638()
+    fun_l3_n815
+end
+
+def fun_l2_n639()
+    fun_l3_n477
+end
+
+def fun_l2_n640()
+    fun_l3_n894
+end
+
+def fun_l2_n641()
+    fun_l3_n804
+end
+
+def fun_l2_n642()
+    fun_l3_n198
+end
+
+def fun_l2_n643()
+    fun_l3_n676
+end
+
+def fun_l2_n644()
+    fun_l3_n306
+end
+
+def fun_l2_n645()
+    fun_l3_n545
+end
+
+def fun_l2_n646()
+    fun_l3_n519
+end
+
+def fun_l2_n647()
+    fun_l3_n328
+end
+
+def fun_l2_n648()
+    fun_l3_n654
+end
+
+def fun_l2_n649()
+    fun_l3_n879
+end
+
+def fun_l2_n650()
+    fun_l3_n224
+end
+
+def fun_l2_n651()
+    fun_l3_n826
+end
+
+def fun_l2_n652()
+    fun_l3_n976
+end
+
+def fun_l2_n653()
+    fun_l3_n287
+end
+
+def fun_l2_n654()
+    fun_l3_n471
+end
+
+def fun_l2_n655()
+    fun_l3_n738
+end
+
+def fun_l2_n656()
+    fun_l3_n545
+end
+
+def fun_l2_n657()
+    fun_l3_n819
+end
+
+def fun_l2_n658()
+    fun_l3_n866
+end
+
+def fun_l2_n659()
+    fun_l3_n215
+end
+
+def fun_l2_n660()
+    fun_l3_n656
+end
+
+def fun_l2_n661()
+    fun_l3_n519
+end
+
+def fun_l2_n662()
+    fun_l3_n812
+end
+
+def fun_l2_n663()
+    fun_l3_n241
+end
+
+def fun_l2_n664()
+    fun_l3_n245
+end
+
+def fun_l2_n665()
+    fun_l3_n60
+end
+
+def fun_l2_n666()
+    fun_l3_n516
+end
+
+def fun_l2_n667()
+    fun_l3_n264
+end
+
+def fun_l2_n668()
+    fun_l3_n254
+end
+
+def fun_l2_n669()
+    fun_l3_n952
+end
+
+def fun_l2_n670()
+    fun_l3_n928
+end
+
+def fun_l2_n671()
+    fun_l3_n718
+end
+
+def fun_l2_n672()
+    fun_l3_n937
+end
+
+def fun_l2_n673()
+    fun_l3_n549
+end
+
+def fun_l2_n674()
+    fun_l3_n138
+end
+
+def fun_l2_n675()
+    fun_l3_n441
+end
+
+def fun_l2_n676()
+    fun_l3_n641
+end
+
+def fun_l2_n677()
+    fun_l3_n611
+end
+
+def fun_l2_n678()
+    fun_l3_n711
+end
+
+def fun_l2_n679()
+    fun_l3_n60
+end
+
+def fun_l2_n680()
+    fun_l3_n894
+end
+
+def fun_l2_n681()
+    fun_l3_n957
+end
+
+def fun_l2_n682()
+    fun_l3_n516
+end
+
+def fun_l2_n683()
+    fun_l3_n348
+end
+
+def fun_l2_n684()
+    fun_l3_n600
+end
+
+def fun_l2_n685()
+    fun_l3_n955
+end
+
+def fun_l2_n686()
+    fun_l3_n842
+end
+
+def fun_l2_n687()
+    fun_l3_n126
+end
+
+def fun_l2_n688()
+    fun_l3_n739
+end
+
+def fun_l2_n689()
+    fun_l3_n435
+end
+
+def fun_l2_n690()
+    fun_l3_n445
+end
+
+def fun_l2_n691()
+    fun_l3_n973
+end
+
+def fun_l2_n692()
+    fun_l3_n54
+end
+
+def fun_l2_n693()
+    fun_l3_n629
+end
+
+def fun_l2_n694()
+    fun_l3_n83
+end
+
+def fun_l2_n695()
+    fun_l3_n887
+end
+
+def fun_l2_n696()
+    fun_l3_n552
+end
+
+def fun_l2_n697()
+    fun_l3_n263
+end
+
+def fun_l2_n698()
+    fun_l3_n532
+end
+
+def fun_l2_n699()
+    fun_l3_n462
+end
+
+def fun_l2_n700()
+    fun_l3_n319
+end
+
+def fun_l2_n701()
+    fun_l3_n464
+end
+
+def fun_l2_n702()
+    fun_l3_n340
+end
+
+def fun_l2_n703()
+    fun_l3_n188
+end
+
+def fun_l2_n704()
+    fun_l3_n157
+end
+
+def fun_l2_n705()
+    fun_l3_n345
+end
+
+def fun_l2_n706()
+    fun_l3_n637
+end
+
+def fun_l2_n707()
+    fun_l3_n157
+end
+
+def fun_l2_n708()
+    fun_l3_n270
+end
+
+def fun_l2_n709()
+    fun_l3_n13
+end
+
+def fun_l2_n710()
+    fun_l3_n360
+end
+
+def fun_l2_n711()
+    fun_l3_n890
+end
+
+def fun_l2_n712()
+    fun_l3_n539
+end
+
+def fun_l2_n713()
+    fun_l3_n582
+end
+
+def fun_l2_n714()
+    fun_l3_n466
+end
+
+def fun_l2_n715()
+    fun_l3_n623
+end
+
+def fun_l2_n716()
+    fun_l3_n995
+end
+
+def fun_l2_n717()
+    fun_l3_n810
+end
+
+def fun_l2_n718()
+    fun_l3_n95
+end
+
+def fun_l2_n719()
+    fun_l3_n103
+end
+
+def fun_l2_n720()
+    fun_l3_n755
+end
+
+def fun_l2_n721()
+    fun_l3_n858
+end
+
+def fun_l2_n722()
+    fun_l3_n519
+end
+
+def fun_l2_n723()
+    fun_l3_n489
+end
+
+def fun_l2_n724()
+    fun_l3_n578
+end
+
+def fun_l2_n725()
+    fun_l3_n176
+end
+
+def fun_l2_n726()
+    fun_l3_n58
+end
+
+def fun_l2_n727()
+    fun_l3_n817
+end
+
+def fun_l2_n728()
+    fun_l3_n612
+end
+
+def fun_l2_n729()
+    fun_l3_n510
+end
+
+def fun_l2_n730()
+    fun_l3_n934
+end
+
+def fun_l2_n731()
+    fun_l3_n691
+end
+
+def fun_l2_n732()
+    fun_l3_n697
+end
+
+def fun_l2_n733()
+    fun_l3_n667
+end
+
+def fun_l2_n734()
+    fun_l3_n49
+end
+
+def fun_l2_n735()
+    fun_l3_n113
+end
+
+def fun_l2_n736()
+    fun_l3_n157
+end
+
+def fun_l2_n737()
+    fun_l3_n756
+end
+
+def fun_l2_n738()
+    fun_l3_n888
+end
+
+def fun_l2_n739()
+    fun_l3_n847
+end
+
+def fun_l2_n740()
+    fun_l3_n693
+end
+
+def fun_l2_n741()
+    fun_l3_n116
+end
+
+def fun_l2_n742()
+    fun_l3_n95
+end
+
+def fun_l2_n743()
+    fun_l3_n662
+end
+
+def fun_l2_n744()
+    fun_l3_n744
+end
+
+def fun_l2_n745()
+    fun_l3_n800
+end
+
+def fun_l2_n746()
+    fun_l3_n732
+end
+
+def fun_l2_n747()
+    fun_l3_n278
+end
+
+def fun_l2_n748()
+    fun_l3_n441
+end
+
+def fun_l2_n749()
+    fun_l3_n838
+end
+
+def fun_l2_n750()
+    fun_l3_n616
+end
+
+def fun_l2_n751()
+    fun_l3_n438
+end
+
+def fun_l2_n752()
+    fun_l3_n271
+end
+
+def fun_l2_n753()
+    fun_l3_n527
+end
+
+def fun_l2_n754()
+    fun_l3_n568
+end
+
+def fun_l2_n755()
+    fun_l3_n584
+end
+
+def fun_l2_n756()
+    fun_l3_n514
+end
+
+def fun_l2_n757()
+    fun_l3_n599
+end
+
+def fun_l2_n758()
+    fun_l3_n878
+end
+
+def fun_l2_n759()
+    fun_l3_n314
+end
+
+def fun_l2_n760()
+    fun_l3_n277
+end
+
+def fun_l2_n761()
+    fun_l3_n296
+end
+
+def fun_l2_n762()
+    fun_l3_n729
+end
+
+def fun_l2_n763()
+    fun_l3_n192
+end
+
+def fun_l2_n764()
+    fun_l3_n549
+end
+
+def fun_l2_n765()
+    fun_l3_n304
+end
+
+def fun_l2_n766()
+    fun_l3_n133
+end
+
+def fun_l2_n767()
+    fun_l3_n678
+end
+
+def fun_l2_n768()
+    fun_l3_n608
+end
+
+def fun_l2_n769()
+    fun_l3_n830
+end
+
+def fun_l2_n770()
+    fun_l3_n419
+end
+
+def fun_l2_n771()
+    fun_l3_n174
+end
+
+def fun_l2_n772()
+    fun_l3_n806
+end
+
+def fun_l2_n773()
+    fun_l3_n257
+end
+
+def fun_l2_n774()
+    fun_l3_n203
+end
+
+def fun_l2_n775()
+    fun_l3_n572
+end
+
+def fun_l2_n776()
+    fun_l3_n665
+end
+
+def fun_l2_n777()
+    fun_l3_n417
+end
+
+def fun_l2_n778()
+    fun_l3_n44
+end
+
+def fun_l2_n779()
+    fun_l3_n202
+end
+
+def fun_l2_n780()
+    fun_l3_n343
+end
+
+def fun_l2_n781()
+    fun_l3_n343
+end
+
+def fun_l2_n782()
+    fun_l3_n57
+end
+
+def fun_l2_n783()
+    fun_l3_n836
+end
+
+def fun_l2_n784()
+    fun_l3_n634
+end
+
+def fun_l2_n785()
+    fun_l3_n788
+end
+
+def fun_l2_n786()
+    fun_l3_n541
+end
+
+def fun_l2_n787()
+    fun_l3_n906
+end
+
+def fun_l2_n788()
+    fun_l3_n12
+end
+
+def fun_l2_n789()
+    fun_l3_n682
+end
+
+def fun_l2_n790()
+    fun_l3_n80
+end
+
+def fun_l2_n791()
+    fun_l3_n594
+end
+
+def fun_l2_n792()
+    fun_l3_n120
+end
+
+def fun_l2_n793()
+    fun_l3_n551
+end
+
+def fun_l2_n794()
+    fun_l3_n164
+end
+
+def fun_l2_n795()
+    fun_l3_n817
+end
+
+def fun_l2_n796()
+    fun_l3_n611
+end
+
+def fun_l2_n797()
+    fun_l3_n878
+end
+
+def fun_l2_n798()
+    fun_l3_n235
+end
+
+def fun_l2_n799()
+    fun_l3_n210
+end
+
+def fun_l2_n800()
+    fun_l3_n343
+end
+
+def fun_l2_n801()
+    fun_l3_n445
+end
+
+def fun_l2_n802()
+    fun_l3_n549
+end
+
+def fun_l2_n803()
+    fun_l3_n992
+end
+
+def fun_l2_n804()
+    fun_l3_n751
+end
+
+def fun_l2_n805()
+    fun_l3_n514
+end
+
+def fun_l2_n806()
+    fun_l3_n593
+end
+
+def fun_l2_n807()
+    fun_l3_n876
+end
+
+def fun_l2_n808()
+    fun_l3_n612
+end
+
+def fun_l2_n809()
+    fun_l3_n184
+end
+
+def fun_l2_n810()
+    fun_l3_n34
+end
+
+def fun_l2_n811()
+    fun_l3_n703
+end
+
+def fun_l2_n812()
+    fun_l3_n296
+end
+
+def fun_l2_n813()
+    fun_l3_n815
+end
+
+def fun_l2_n814()
+    fun_l3_n417
+end
+
+def fun_l2_n815()
+    fun_l3_n230
+end
+
+def fun_l2_n816()
+    fun_l3_n140
+end
+
+def fun_l2_n817()
+    fun_l3_n772
+end
+
+def fun_l2_n818()
+    fun_l3_n671
+end
+
+def fun_l2_n819()
+    fun_l3_n670
+end
+
+def fun_l2_n820()
+    fun_l3_n286
+end
+
+def fun_l2_n821()
+    fun_l3_n406
+end
+
+def fun_l2_n822()
+    fun_l3_n757
+end
+
+def fun_l2_n823()
+    fun_l3_n995
+end
+
+def fun_l2_n824()
+    fun_l3_n816
+end
+
+def fun_l2_n825()
+    fun_l3_n624
+end
+
+def fun_l2_n826()
+    fun_l3_n625
+end
+
+def fun_l2_n827()
+    fun_l3_n559
+end
+
+def fun_l2_n828()
+    fun_l3_n224
+end
+
+def fun_l2_n829()
+    fun_l3_n437
+end
+
+def fun_l2_n830()
+    fun_l3_n745
+end
+
+def fun_l2_n831()
+    fun_l3_n289
+end
+
+def fun_l2_n832()
+    fun_l3_n555
+end
+
+def fun_l2_n833()
+    fun_l3_n477
+end
+
+def fun_l2_n834()
+    fun_l3_n545
+end
+
+def fun_l2_n835()
+    fun_l3_n87
+end
+
+def fun_l2_n836()
+    fun_l3_n100
+end
+
+def fun_l2_n837()
+    fun_l3_n796
+end
+
+def fun_l2_n838()
+    fun_l3_n166
+end
+
+def fun_l2_n839()
+    fun_l3_n91
+end
+
+def fun_l2_n840()
+    fun_l3_n325
+end
+
+def fun_l2_n841()
+    fun_l3_n717
+end
+
+def fun_l2_n842()
+    fun_l3_n522
+end
+
+def fun_l2_n843()
+    fun_l3_n560
+end
+
+def fun_l2_n844()
+    fun_l3_n811
+end
+
+def fun_l2_n845()
+    fun_l3_n451
+end
+
+def fun_l2_n846()
+    fun_l3_n45
+end
+
+def fun_l2_n847()
+    fun_l3_n410
+end
+
+def fun_l2_n848()
+    fun_l3_n976
+end
+
+def fun_l2_n849()
+    fun_l3_n873
+end
+
+def fun_l2_n850()
+    fun_l3_n302
+end
+
+def fun_l2_n851()
+    fun_l3_n346
+end
+
+def fun_l2_n852()
+    fun_l3_n314
+end
+
+def fun_l2_n853()
+    fun_l3_n829
+end
+
+def fun_l2_n854()
+    fun_l3_n259
+end
+
+def fun_l2_n855()
+    fun_l3_n799
+end
+
+def fun_l2_n856()
+    fun_l3_n451
+end
+
+def fun_l2_n857()
+    fun_l3_n154
+end
+
+def fun_l2_n858()
+    fun_l3_n867
+end
+
+def fun_l2_n859()
+    fun_l3_n806
+end
+
+def fun_l2_n860()
+    fun_l3_n138
+end
+
+def fun_l2_n861()
+    fun_l3_n508
+end
+
+def fun_l2_n862()
+    fun_l3_n627
+end
+
+def fun_l2_n863()
+    fun_l3_n931
+end
+
+def fun_l2_n864()
+    fun_l3_n95
+end
+
+def fun_l2_n865()
+    fun_l3_n533
+end
+
+def fun_l2_n866()
+    fun_l3_n425
+end
+
+def fun_l2_n867()
+    fun_l3_n996
+end
+
+def fun_l2_n868()
+    fun_l3_n331
+end
+
+def fun_l2_n869()
+    fun_l3_n126
+end
+
+def fun_l2_n870()
+    fun_l3_n848
+end
+
+def fun_l2_n871()
+    fun_l3_n174
+end
+
+def fun_l2_n872()
+    fun_l3_n867
+end
+
+def fun_l2_n873()
+    fun_l3_n800
+end
+
+def fun_l2_n874()
+    fun_l3_n526
+end
+
+def fun_l2_n875()
+    fun_l3_n250
+end
+
+def fun_l2_n876()
+    fun_l3_n896
+end
+
+def fun_l2_n877()
+    fun_l3_n229
+end
+
+def fun_l2_n878()
+    fun_l3_n290
+end
+
+def fun_l2_n879()
+    fun_l3_n130
+end
+
+def fun_l2_n880()
+    fun_l3_n437
+end
+
+def fun_l2_n881()
+    fun_l3_n654
+end
+
+def fun_l2_n882()
+    fun_l3_n93
+end
+
+def fun_l2_n883()
+    fun_l3_n632
+end
+
+def fun_l2_n884()
+    fun_l3_n772
+end
+
+def fun_l2_n885()
+    fun_l3_n597
+end
+
+def fun_l2_n886()
+    fun_l3_n668
+end
+
+def fun_l2_n887()
+    fun_l3_n969
+end
+
+def fun_l2_n888()
+    fun_l3_n908
+end
+
+def fun_l2_n889()
+    fun_l3_n10
+end
+
+def fun_l2_n890()
+    fun_l3_n676
+end
+
+def fun_l2_n891()
+    fun_l3_n729
+end
+
+def fun_l2_n892()
+    fun_l3_n659
+end
+
+def fun_l2_n893()
+    fun_l3_n121
+end
+
+def fun_l2_n894()
+    fun_l3_n543
+end
+
+def fun_l2_n895()
+    fun_l3_n931
+end
+
+def fun_l2_n896()
+    fun_l3_n64
+end
+
+def fun_l2_n897()
+    fun_l3_n500
+end
+
+def fun_l2_n898()
+    fun_l3_n664
+end
+
+def fun_l2_n899()
+    fun_l3_n929
+end
+
+def fun_l2_n900()
+    fun_l3_n772
+end
+
+def fun_l2_n901()
+    fun_l3_n309
+end
+
+def fun_l2_n902()
+    fun_l3_n284
+end
+
+def fun_l2_n903()
+    fun_l3_n304
+end
+
+def fun_l2_n904()
+    fun_l3_n18
+end
+
+def fun_l2_n905()
+    fun_l3_n715
+end
+
+def fun_l2_n906()
+    fun_l3_n469
+end
+
+def fun_l2_n907()
+    fun_l3_n524
+end
+
+def fun_l2_n908()
+    fun_l3_n476
+end
+
+def fun_l2_n909()
+    fun_l3_n90
+end
+
+def fun_l2_n910()
+    fun_l3_n471
+end
+
+def fun_l2_n911()
+    fun_l3_n885
+end
+
+def fun_l2_n912()
+    fun_l3_n696
+end
+
+def fun_l2_n913()
+    fun_l3_n393
+end
+
+def fun_l2_n914()
+    fun_l3_n987
+end
+
+def fun_l2_n915()
+    fun_l3_n830
+end
+
+def fun_l2_n916()
+    fun_l3_n684
+end
+
+def fun_l2_n917()
+    fun_l3_n379
+end
+
+def fun_l2_n918()
+    fun_l3_n237
+end
+
+def fun_l2_n919()
+    fun_l3_n115
+end
+
+def fun_l2_n920()
+    fun_l3_n499
+end
+
+def fun_l2_n921()
+    fun_l3_n88
+end
+
+def fun_l2_n922()
+    fun_l3_n563
+end
+
+def fun_l2_n923()
+    fun_l3_n280
+end
+
+def fun_l2_n924()
+    fun_l3_n400
+end
+
+def fun_l2_n925()
+    fun_l3_n750
+end
+
+def fun_l2_n926()
+    fun_l3_n429
+end
+
+def fun_l2_n927()
+    fun_l3_n669
+end
+
+def fun_l2_n928()
+    fun_l3_n275
+end
+
+def fun_l2_n929()
+    fun_l3_n468
+end
+
+def fun_l2_n930()
+    fun_l3_n617
+end
+
+def fun_l2_n931()
+    fun_l3_n291
+end
+
+def fun_l2_n932()
+    fun_l3_n870
+end
+
+def fun_l2_n933()
+    fun_l3_n169
+end
+
+def fun_l2_n934()
+    fun_l3_n603
+end
+
+def fun_l2_n935()
+    fun_l3_n669
+end
+
+def fun_l2_n936()
+    fun_l3_n738
+end
+
+def fun_l2_n937()
+    fun_l3_n417
+end
+
+def fun_l2_n938()
+    fun_l3_n339
+end
+
+def fun_l2_n939()
+    fun_l3_n660
+end
+
+def fun_l2_n940()
+    fun_l3_n253
+end
+
+def fun_l2_n941()
+    fun_l3_n598
+end
+
+def fun_l2_n942()
+    fun_l3_n369
+end
+
+def fun_l2_n943()
+    fun_l3_n453
+end
+
+def fun_l2_n944()
+    fun_l3_n535
+end
+
+def fun_l2_n945()
+    fun_l3_n492
+end
+
+def fun_l2_n946()
+    fun_l3_n950
+end
+
+def fun_l2_n947()
+    fun_l3_n939
+end
+
+def fun_l2_n948()
+    fun_l3_n607
+end
+
+def fun_l2_n949()
+    fun_l3_n440
+end
+
+def fun_l2_n950()
+    fun_l3_n615
+end
+
+def fun_l2_n951()
+    fun_l3_n690
+end
+
+def fun_l2_n952()
+    fun_l3_n205
+end
+
+def fun_l2_n953()
+    fun_l3_n831
+end
+
+def fun_l2_n954()
+    fun_l3_n56
+end
+
+def fun_l2_n955()
+    fun_l3_n695
+end
+
+def fun_l2_n956()
+    fun_l3_n358
+end
+
+def fun_l2_n957()
+    fun_l3_n2
+end
+
+def fun_l2_n958()
+    fun_l3_n663
+end
+
+def fun_l2_n959()
+    fun_l3_n829
+end
+
+def fun_l2_n960()
+    fun_l3_n627
+end
+
+def fun_l2_n961()
+    fun_l3_n43
+end
+
+def fun_l2_n962()
+    fun_l3_n293
+end
+
+def fun_l2_n963()
+    fun_l3_n982
+end
+
+def fun_l2_n964()
+    fun_l3_n472
+end
+
+def fun_l2_n965()
+    fun_l3_n703
+end
+
+def fun_l2_n966()
+    fun_l3_n884
+end
+
+def fun_l2_n967()
+    fun_l3_n395
+end
+
+def fun_l2_n968()
+    fun_l3_n398
+end
+
+def fun_l2_n969()
+    fun_l3_n251
+end
+
+def fun_l2_n970()
+    fun_l3_n52
+end
+
+def fun_l2_n971()
+    fun_l3_n263
+end
+
+def fun_l2_n972()
+    fun_l3_n172
+end
+
+def fun_l2_n973()
+    fun_l3_n334
+end
+
+def fun_l2_n974()
+    fun_l3_n552
+end
+
+def fun_l2_n975()
+    fun_l3_n898
+end
+
+def fun_l2_n976()
+    fun_l3_n55
+end
+
+def fun_l2_n977()
+    fun_l3_n556
+end
+
+def fun_l2_n978()
+    fun_l3_n852
+end
+
+def fun_l2_n979()
+    fun_l3_n681
+end
+
+def fun_l2_n980()
+    fun_l3_n470
+end
+
+def fun_l2_n981()
+    fun_l3_n807
+end
+
+def fun_l2_n982()
+    fun_l3_n411
+end
+
+def fun_l2_n983()
+    fun_l3_n251
+end
+
+def fun_l2_n984()
+    fun_l3_n302
+end
+
+def fun_l2_n985()
+    fun_l3_n598
+end
+
+def fun_l2_n986()
+    fun_l3_n897
+end
+
+def fun_l2_n987()
+    fun_l3_n449
+end
+
+def fun_l2_n988()
+    fun_l3_n178
+end
+
+def fun_l2_n989()
+    fun_l3_n208
+end
+
+def fun_l2_n990()
+    fun_l3_n287
+end
+
+def fun_l2_n991()
+    fun_l3_n237
+end
+
+def fun_l2_n992()
+    fun_l3_n56
+end
+
+def fun_l2_n993()
+    fun_l3_n66
+end
+
+def fun_l2_n994()
+    fun_l3_n838
+end
+
+def fun_l2_n995()
+    fun_l3_n726
+end
+
+def fun_l2_n996()
+    fun_l3_n758
+end
+
+def fun_l2_n997()
+    fun_l3_n850
+end
+
+def fun_l2_n998()
+    fun_l3_n132
+end
+
+def fun_l2_n999()
+    fun_l3_n477
+end
+
+def fun_l3_n0()
+    fun_l4_n984
+end
+
+def fun_l3_n1()
+    fun_l4_n136
+end
+
+def fun_l3_n2()
+    fun_l4_n494
+end
+
+def fun_l3_n3()
+    fun_l4_n267
+end
+
+def fun_l3_n4()
+    fun_l4_n305
+end
+
+def fun_l3_n5()
+    fun_l4_n646
+end
+
+def fun_l3_n6()
+    fun_l4_n144
+end
+
+def fun_l3_n7()
+    fun_l4_n341
+end
+
+def fun_l3_n8()
+    fun_l4_n142
+end
+
+def fun_l3_n9()
+    fun_l4_n382
+end
+
+def fun_l3_n10()
+    fun_l4_n726
+end
+
+def fun_l3_n11()
+    fun_l4_n23
+end
+
+def fun_l3_n12()
+    fun_l4_n911
+end
+
+def fun_l3_n13()
+    fun_l4_n221
+end
+
+def fun_l3_n14()
+    fun_l4_n554
+end
+
+def fun_l3_n15()
+    fun_l4_n602
+end
+
+def fun_l3_n16()
+    fun_l4_n893
+end
+
+def fun_l3_n17()
+    fun_l4_n943
+end
+
+def fun_l3_n18()
+    fun_l4_n523
+end
+
+def fun_l3_n19()
+    fun_l4_n896
+end
+
+def fun_l3_n20()
+    fun_l4_n539
+end
+
+def fun_l3_n21()
+    fun_l4_n333
+end
+
+def fun_l3_n22()
+    fun_l4_n230
+end
+
+def fun_l3_n23()
+    fun_l4_n256
+end
+
+def fun_l3_n24()
+    fun_l4_n278
+end
+
+def fun_l3_n25()
+    fun_l4_n699
+end
+
+def fun_l3_n26()
+    fun_l4_n584
+end
+
+def fun_l3_n27()
+    fun_l4_n259
+end
+
+def fun_l3_n28()
+    fun_l4_n993
+end
+
+def fun_l3_n29()
+    fun_l4_n183
+end
+
+def fun_l3_n30()
+    fun_l4_n249
+end
+
+def fun_l3_n31()
+    fun_l4_n253
+end
+
+def fun_l3_n32()
+    fun_l4_n507
+end
+
+def fun_l3_n33()
+    fun_l4_n507
+end
+
+def fun_l3_n34()
+    fun_l4_n142
+end
+
+def fun_l3_n35()
+    fun_l4_n392
+end
+
+def fun_l3_n36()
+    fun_l4_n962
+end
+
+def fun_l3_n37()
+    fun_l4_n799
+end
+
+def fun_l3_n38()
+    fun_l4_n110
+end
+
+def fun_l3_n39()
+    fun_l4_n623
+end
+
+def fun_l3_n40()
+    fun_l4_n508
+end
+
+def fun_l3_n41()
+    fun_l4_n726
+end
+
+def fun_l3_n42()
+    fun_l4_n282
+end
+
+def fun_l3_n43()
+    fun_l4_n942
+end
+
+def fun_l3_n44()
+    fun_l4_n711
+end
+
+def fun_l3_n45()
+    fun_l4_n926
+end
+
+def fun_l3_n46()
+    fun_l4_n793
+end
+
+def fun_l3_n47()
+    fun_l4_n658
+end
+
+def fun_l3_n48()
+    fun_l4_n802
+end
+
+def fun_l3_n49()
+    fun_l4_n499
+end
+
+def fun_l3_n50()
+    fun_l4_n648
+end
+
+def fun_l3_n51()
+    fun_l4_n465
+end
+
+def fun_l3_n52()
+    fun_l4_n460
+end
+
+def fun_l3_n53()
+    fun_l4_n904
+end
+
+def fun_l3_n54()
+    fun_l4_n939
+end
+
+def fun_l3_n55()
+    fun_l4_n306
+end
+
+def fun_l3_n56()
+    fun_l4_n235
+end
+
+def fun_l3_n57()
+    fun_l4_n783
+end
+
+def fun_l3_n58()
+    fun_l4_n992
+end
+
+def fun_l3_n59()
+    fun_l4_n196
+end
+
+def fun_l3_n60()
+    fun_l4_n637
+end
+
+def fun_l3_n61()
+    fun_l4_n512
+end
+
+def fun_l3_n62()
+    fun_l4_n480
+end
+
+def fun_l3_n63()
+    fun_l4_n31
+end
+
+def fun_l3_n64()
+    fun_l4_n277
+end
+
+def fun_l3_n65()
+    fun_l4_n814
+end
+
+def fun_l3_n66()
+    fun_l4_n170
+end
+
+def fun_l3_n67()
+    fun_l4_n604
+end
+
+def fun_l3_n68()
+    fun_l4_n794
+end
+
+def fun_l3_n69()
+    fun_l4_n530
+end
+
+def fun_l3_n70()
+    fun_l4_n291
+end
+
+def fun_l3_n71()
+    fun_l4_n146
+end
+
+def fun_l3_n72()
+    fun_l4_n588
+end
+
+def fun_l3_n73()
+    fun_l4_n624
+end
+
+def fun_l3_n74()
+    fun_l4_n210
+end
+
+def fun_l3_n75()
+    fun_l4_n924
+end
+
+def fun_l3_n76()
+    fun_l4_n77
+end
+
+def fun_l3_n77()
+    fun_l4_n727
+end
+
+def fun_l3_n78()
+    fun_l4_n840
+end
+
+def fun_l3_n79()
+    fun_l4_n257
+end
+
+def fun_l3_n80()
+    fun_l4_n654
+end
+
+def fun_l3_n81()
+    fun_l4_n498
+end
+
+def fun_l3_n82()
+    fun_l4_n445
+end
+
+def fun_l3_n83()
+    fun_l4_n820
+end
+
+def fun_l3_n84()
+    fun_l4_n376
+end
+
+def fun_l3_n85()
+    fun_l4_n702
+end
+
+def fun_l3_n86()
+    fun_l4_n22
+end
+
+def fun_l3_n87()
+    fun_l4_n278
+end
+
+def fun_l3_n88()
+    fun_l4_n399
+end
+
+def fun_l3_n89()
+    fun_l4_n166
+end
+
+def fun_l3_n90()
+    fun_l4_n461
+end
+
+def fun_l3_n91()
+    fun_l4_n992
+end
+
+def fun_l3_n92()
+    fun_l4_n207
+end
+
+def fun_l3_n93()
+    fun_l4_n915
+end
+
+def fun_l3_n94()
+    fun_l4_n852
+end
+
+def fun_l3_n95()
+    fun_l4_n591
+end
+
+def fun_l3_n96()
+    fun_l4_n74
+end
+
+def fun_l3_n97()
+    fun_l4_n735
+end
+
+def fun_l3_n98()
+    fun_l4_n863
+end
+
+def fun_l3_n99()
+    fun_l4_n692
+end
+
+def fun_l3_n100()
+    fun_l4_n633
+end
+
+def fun_l3_n101()
+    fun_l4_n618
+end
+
+def fun_l3_n102()
+    fun_l4_n306
+end
+
+def fun_l3_n103()
+    fun_l4_n620
+end
+
+def fun_l3_n104()
+    fun_l4_n981
+end
+
+def fun_l3_n105()
+    fun_l4_n763
+end
+
+def fun_l3_n106()
+    fun_l4_n727
+end
+
+def fun_l3_n107()
+    fun_l4_n173
+end
+
+def fun_l3_n108()
+    fun_l4_n645
+end
+
+def fun_l3_n109()
+    fun_l4_n333
+end
+
+def fun_l3_n110()
+    fun_l4_n847
+end
+
+def fun_l3_n111()
+    fun_l4_n905
+end
+
+def fun_l3_n112()
+    fun_l4_n753
+end
+
+def fun_l3_n113()
+    fun_l4_n294
+end
+
+def fun_l3_n114()
+    fun_l4_n891
+end
+
+def fun_l3_n115()
+    fun_l4_n495
+end
+
+def fun_l3_n116()
+    fun_l4_n683
+end
+
+def fun_l3_n117()
+    fun_l4_n925
+end
+
+def fun_l3_n118()
+    fun_l4_n630
+end
+
+def fun_l3_n119()
+    fun_l4_n548
+end
+
+def fun_l3_n120()
+    fun_l4_n767
+end
+
+def fun_l3_n121()
+    fun_l4_n623
+end
+
+def fun_l3_n122()
+    fun_l4_n0
+end
+
+def fun_l3_n123()
+    fun_l4_n849
+end
+
+def fun_l3_n124()
+    fun_l4_n643
+end
+
+def fun_l3_n125()
+    fun_l4_n559
+end
+
+def fun_l3_n126()
+    fun_l4_n533
+end
+
+def fun_l3_n127()
+    fun_l4_n287
+end
+
+def fun_l3_n128()
+    fun_l4_n146
+end
+
+def fun_l3_n129()
+    fun_l4_n636
+end
+
+def fun_l3_n130()
+    fun_l4_n914
+end
+
+def fun_l3_n131()
+    fun_l4_n274
+end
+
+def fun_l3_n132()
+    fun_l4_n60
+end
+
+def fun_l3_n133()
+    fun_l4_n858
+end
+
+def fun_l3_n134()
+    fun_l4_n334
+end
+
+def fun_l3_n135()
+    fun_l4_n892
+end
+
+def fun_l3_n136()
+    fun_l4_n81
+end
+
+def fun_l3_n137()
+    fun_l4_n567
+end
+
+def fun_l3_n138()
+    fun_l4_n456
+end
+
+def fun_l3_n139()
+    fun_l4_n625
+end
+
+def fun_l3_n140()
+    fun_l4_n690
+end
+
+def fun_l3_n141()
+    fun_l4_n919
+end
+
+def fun_l3_n142()
+    fun_l4_n504
+end
+
+def fun_l3_n143()
+    fun_l4_n986
+end
+
+def fun_l3_n144()
+    fun_l4_n99
+end
+
+def fun_l3_n145()
+    fun_l4_n312
+end
+
+def fun_l3_n146()
+    fun_l4_n36
+end
+
+def fun_l3_n147()
+    fun_l4_n3
+end
+
+def fun_l3_n148()
+    fun_l4_n328
+end
+
+def fun_l3_n149()
+    fun_l4_n978
+end
+
+def fun_l3_n150()
+    fun_l4_n474
+end
+
+def fun_l3_n151()
+    fun_l4_n985
+end
+
+def fun_l3_n152()
+    fun_l4_n809
+end
+
+def fun_l3_n153()
+    fun_l4_n379
+end
+
+def fun_l3_n154()
+    fun_l4_n589
+end
+
+def fun_l3_n155()
+    fun_l4_n625
+end
+
+def fun_l3_n156()
+    fun_l4_n937
+end
+
+def fun_l3_n157()
+    fun_l4_n774
+end
+
+def fun_l3_n158()
+    fun_l4_n465
+end
+
+def fun_l3_n159()
+    fun_l4_n315
+end
+
+def fun_l3_n160()
+    fun_l4_n733
+end
+
+def fun_l3_n161()
+    fun_l4_n572
+end
+
+def fun_l3_n162()
+    fun_l4_n794
+end
+
+def fun_l3_n163()
+    fun_l4_n76
+end
+
+def fun_l3_n164()
+    fun_l4_n550
+end
+
+def fun_l3_n165()
+    fun_l4_n913
+end
+
+def fun_l3_n166()
+    fun_l4_n553
+end
+
+def fun_l3_n167()
+    fun_l4_n383
+end
+
+def fun_l3_n168()
+    fun_l4_n118
+end
+
+def fun_l3_n169()
+    fun_l4_n561
+end
+
+def fun_l3_n170()
+    fun_l4_n517
+end
+
+def fun_l3_n171()
+    fun_l4_n680
+end
+
+def fun_l3_n172()
+    fun_l4_n466
+end
+
+def fun_l3_n173()
+    fun_l4_n629
+end
+
+def fun_l3_n174()
+    fun_l4_n469
+end
+
+def fun_l3_n175()
+    fun_l4_n731
+end
+
+def fun_l3_n176()
+    fun_l4_n579
+end
+
+def fun_l3_n177()
+    fun_l4_n574
+end
+
+def fun_l3_n178()
+    fun_l4_n936
+end
+
+def fun_l3_n179()
+    fun_l4_n405
+end
+
+def fun_l3_n180()
+    fun_l4_n667
+end
+
+def fun_l3_n181()
+    fun_l4_n369
+end
+
+def fun_l3_n182()
+    fun_l4_n852
+end
+
+def fun_l3_n183()
+    fun_l4_n861
+end
+
+def fun_l3_n184()
+    fun_l4_n425
+end
+
+def fun_l3_n185()
+    fun_l4_n4
+end
+
+def fun_l3_n186()
+    fun_l4_n28
+end
+
+def fun_l3_n187()
+    fun_l4_n470
+end
+
+def fun_l3_n188()
+    fun_l4_n568
+end
+
+def fun_l3_n189()
+    fun_l4_n83
+end
+
+def fun_l3_n190()
+    fun_l4_n981
+end
+
+def fun_l3_n191()
+    fun_l4_n526
+end
+
+def fun_l3_n192()
+    fun_l4_n496
+end
+
+def fun_l3_n193()
+    fun_l4_n954
+end
+
+def fun_l3_n194()
+    fun_l4_n340
+end
+
+def fun_l3_n195()
+    fun_l4_n343
+end
+
+def fun_l3_n196()
+    fun_l4_n964
+end
+
+def fun_l3_n197()
+    fun_l4_n58
+end
+
+def fun_l3_n198()
+    fun_l4_n317
+end
+
+def fun_l3_n199()
+    fun_l4_n255
+end
+
+def fun_l3_n200()
+    fun_l4_n546
+end
+
+def fun_l3_n201()
+    fun_l4_n933
+end
+
+def fun_l3_n202()
+    fun_l4_n387
+end
+
+def fun_l3_n203()
+    fun_l4_n32
+end
+
+def fun_l3_n204()
+    fun_l4_n514
+end
+
+def fun_l3_n205()
+    fun_l4_n175
+end
+
+def fun_l3_n206()
+    fun_l4_n813
+end
+
+def fun_l3_n207()
+    fun_l4_n881
+end
+
+def fun_l3_n208()
+    fun_l4_n52
+end
+
+def fun_l3_n209()
+    fun_l4_n839
+end
+
+def fun_l3_n210()
+    fun_l4_n919
+end
+
+def fun_l3_n211()
+    fun_l4_n208
+end
+
+def fun_l3_n212()
+    fun_l4_n111
+end
+
+def fun_l3_n213()
+    fun_l4_n878
+end
+
+def fun_l3_n214()
+    fun_l4_n110
+end
+
+def fun_l3_n215()
+    fun_l4_n701
+end
+
+def fun_l3_n216()
+    fun_l4_n769
+end
+
+def fun_l3_n217()
+    fun_l4_n487
+end
+
+def fun_l3_n218()
+    fun_l4_n940
+end
+
+def fun_l3_n219()
+    fun_l4_n427
+end
+
+def fun_l3_n220()
+    fun_l4_n731
+end
+
+def fun_l3_n221()
+    fun_l4_n92
+end
+
+def fun_l3_n222()
+    fun_l4_n246
+end
+
+def fun_l3_n223()
+    fun_l4_n574
+end
+
+def fun_l3_n224()
+    fun_l4_n297
+end
+
+def fun_l3_n225()
+    fun_l4_n48
+end
+
+def fun_l3_n226()
+    fun_l4_n433
+end
+
+def fun_l3_n227()
+    fun_l4_n628
+end
+
+def fun_l3_n228()
+    fun_l4_n426
+end
+
+def fun_l3_n229()
+    fun_l4_n22
+end
+
+def fun_l3_n230()
+    fun_l4_n878
+end
+
+def fun_l3_n231()
+    fun_l4_n905
+end
+
+def fun_l3_n232()
+    fun_l4_n222
+end
+
+def fun_l3_n233()
+    fun_l4_n523
+end
+
+def fun_l3_n234()
+    fun_l4_n9
+end
+
+def fun_l3_n235()
+    fun_l4_n705
+end
+
+def fun_l3_n236()
+    fun_l4_n811
+end
+
+def fun_l3_n237()
+    fun_l4_n987
+end
+
+def fun_l3_n238()
+    fun_l4_n915
+end
+
+def fun_l3_n239()
+    fun_l4_n302
+end
+
+def fun_l3_n240()
+    fun_l4_n766
+end
+
+def fun_l3_n241()
+    fun_l4_n29
+end
+
+def fun_l3_n242()
+    fun_l4_n154
+end
+
+def fun_l3_n243()
+    fun_l4_n853
+end
+
+def fun_l3_n244()
+    fun_l4_n619
+end
+
+def fun_l3_n245()
+    fun_l4_n739
+end
+
+def fun_l3_n246()
+    fun_l4_n814
+end
+
+def fun_l3_n247()
+    fun_l4_n768
+end
+
+def fun_l3_n248()
+    fun_l4_n2
+end
+
+def fun_l3_n249()
+    fun_l4_n595
+end
+
+def fun_l3_n250()
+    fun_l4_n606
+end
+
+def fun_l3_n251()
+    fun_l4_n144
+end
+
+def fun_l3_n252()
+    fun_l4_n550
+end
+
+def fun_l3_n253()
+    fun_l4_n268
+end
+
+def fun_l3_n254()
+    fun_l4_n320
+end
+
+def fun_l3_n255()
+    fun_l4_n59
+end
+
+def fun_l3_n256()
+    fun_l4_n586
+end
+
+def fun_l3_n257()
+    fun_l4_n766
+end
+
+def fun_l3_n258()
+    fun_l4_n96
+end
+
+def fun_l3_n259()
+    fun_l4_n964
+end
+
+def fun_l3_n260()
+    fun_l4_n163
+end
+
+def fun_l3_n261()
+    fun_l4_n305
+end
+
+def fun_l3_n262()
+    fun_l4_n155
+end
+
+def fun_l3_n263()
+    fun_l4_n249
+end
+
+def fun_l3_n264()
+    fun_l4_n887
+end
+
+def fun_l3_n265()
+    fun_l4_n625
+end
+
+def fun_l3_n266()
+    fun_l4_n241
+end
+
+def fun_l3_n267()
+    fun_l4_n385
+end
+
+def fun_l3_n268()
+    fun_l4_n287
+end
+
+def fun_l3_n269()
+    fun_l4_n375
+end
+
+def fun_l3_n270()
+    fun_l4_n13
+end
+
+def fun_l3_n271()
+    fun_l4_n44
+end
+
+def fun_l3_n272()
+    fun_l4_n259
+end
+
+def fun_l3_n273()
+    fun_l4_n231
+end
+
+def fun_l3_n274()
+    fun_l4_n692
+end
+
+def fun_l3_n275()
+    fun_l4_n279
+end
+
+def fun_l3_n276()
+    fun_l4_n353
+end
+
+def fun_l3_n277()
+    fun_l4_n287
+end
+
+def fun_l3_n278()
+    fun_l4_n254
+end
+
+def fun_l3_n279()
+    fun_l4_n717
+end
+
+def fun_l3_n280()
+    fun_l4_n635
+end
+
+def fun_l3_n281()
+    fun_l4_n264
+end
+
+def fun_l3_n282()
+    fun_l4_n390
+end
+
+def fun_l3_n283()
+    fun_l4_n824
+end
+
+def fun_l3_n284()
+    fun_l4_n919
+end
+
+def fun_l3_n285()
+    fun_l4_n273
+end
+
+def fun_l3_n286()
+    fun_l4_n566
+end
+
+def fun_l3_n287()
+    fun_l4_n6
+end
+
+def fun_l3_n288()
+    fun_l4_n28
+end
+
+def fun_l3_n289()
+    fun_l4_n602
+end
+
+def fun_l3_n290()
+    fun_l4_n209
+end
+
+def fun_l3_n291()
+    fun_l4_n753
+end
+
+def fun_l3_n292()
+    fun_l4_n914
+end
+
+def fun_l3_n293()
+    fun_l4_n345
+end
+
+def fun_l3_n294()
+    fun_l4_n616
+end
+
+def fun_l3_n295()
+    fun_l4_n640
+end
+
+def fun_l3_n296()
+    fun_l4_n47
+end
+
+def fun_l3_n297()
+    fun_l4_n542
+end
+
+def fun_l3_n298()
+    fun_l4_n379
+end
+
+def fun_l3_n299()
+    fun_l4_n14
+end
+
+def fun_l3_n300()
+    fun_l4_n126
+end
+
+def fun_l3_n301()
+    fun_l4_n913
+end
+
+def fun_l3_n302()
+    fun_l4_n933
+end
+
+def fun_l3_n303()
+    fun_l4_n429
+end
+
+def fun_l3_n304()
+    fun_l4_n175
+end
+
+def fun_l3_n305()
+    fun_l4_n152
+end
+
+def fun_l3_n306()
+    fun_l4_n556
+end
+
+def fun_l3_n307()
+    fun_l4_n799
+end
+
+def fun_l3_n308()
+    fun_l4_n865
+end
+
+def fun_l3_n309()
+    fun_l4_n501
+end
+
+def fun_l3_n310()
+    fun_l4_n148
+end
+
+def fun_l3_n311()
+    fun_l4_n160
+end
+
+def fun_l3_n312()
+    fun_l4_n333
+end
+
+def fun_l3_n313()
+    fun_l4_n987
+end
+
+def fun_l3_n314()
+    fun_l4_n449
+end
+
+def fun_l3_n315()
+    fun_l4_n460
+end
+
+def fun_l3_n316()
+    fun_l4_n866
+end
+
+def fun_l3_n317()
+    fun_l4_n554
+end
+
+def fun_l3_n318()
+    fun_l4_n497
+end
+
+def fun_l3_n319()
+    fun_l4_n25
+end
+
+def fun_l3_n320()
+    fun_l4_n483
+end
+
+def fun_l3_n321()
+    fun_l4_n412
+end
+
+def fun_l3_n322()
+    fun_l4_n594
+end
+
+def fun_l3_n323()
+    fun_l4_n727
+end
+
+def fun_l3_n324()
+    fun_l4_n209
+end
+
+def fun_l3_n325()
+    fun_l4_n956
+end
+
+def fun_l3_n326()
+    fun_l4_n127
+end
+
+def fun_l3_n327()
+    fun_l4_n942
+end
+
+def fun_l3_n328()
+    fun_l4_n984
+end
+
+def fun_l3_n329()
+    fun_l4_n387
+end
+
+def fun_l3_n330()
+    fun_l4_n834
+end
+
+def fun_l3_n331()
+    fun_l4_n723
+end
+
+def fun_l3_n332()
+    fun_l4_n576
+end
+
+def fun_l3_n333()
+    fun_l4_n949
+end
+
+def fun_l3_n334()
+    fun_l4_n792
+end
+
+def fun_l3_n335()
+    fun_l4_n28
+end
+
+def fun_l3_n336()
+    fun_l4_n805
+end
+
+def fun_l3_n337()
+    fun_l4_n469
+end
+
+def fun_l3_n338()
+    fun_l4_n651
+end
+
+def fun_l3_n339()
+    fun_l4_n672
+end
+
+def fun_l3_n340()
+    fun_l4_n835
+end
+
+def fun_l3_n341()
+    fun_l4_n902
+end
+
+def fun_l3_n342()
+    fun_l4_n9
+end
+
+def fun_l3_n343()
+    fun_l4_n111
+end
+
+def fun_l3_n344()
+    fun_l4_n234
+end
+
+def fun_l3_n345()
+    fun_l4_n608
+end
+
+def fun_l3_n346()
+    fun_l4_n577
+end
+
+def fun_l3_n347()
+    fun_l4_n966
+end
+
+def fun_l3_n348()
+    fun_l4_n777
+end
+
+def fun_l3_n349()
+    fun_l4_n387
+end
+
+def fun_l3_n350()
+    fun_l4_n27
+end
+
+def fun_l3_n351()
+    fun_l4_n94
+end
+
+def fun_l3_n352()
+    fun_l4_n12
+end
+
+def fun_l3_n353()
+    fun_l4_n632
+end
+
+def fun_l3_n354()
+    fun_l4_n314
+end
+
+def fun_l3_n355()
+    fun_l4_n472
+end
+
+def fun_l3_n356()
+    fun_l4_n737
+end
+
+def fun_l3_n357()
+    fun_l4_n775
+end
+
+def fun_l3_n358()
+    fun_l4_n255
+end
+
+def fun_l3_n359()
+    fun_l4_n474
+end
+
+def fun_l3_n360()
+    fun_l4_n668
+end
+
+def fun_l3_n361()
+    fun_l4_n907
+end
+
+def fun_l3_n362()
+    fun_l4_n608
+end
+
+def fun_l3_n363()
+    fun_l4_n885
+end
+
+def fun_l3_n364()
+    fun_l4_n63
+end
+
+def fun_l3_n365()
+    fun_l4_n432
+end
+
+def fun_l3_n366()
+    fun_l4_n748
+end
+
+def fun_l3_n367()
+    fun_l4_n741
+end
+
+def fun_l3_n368()
+    fun_l4_n799
+end
+
+def fun_l3_n369()
+    fun_l4_n747
+end
+
+def fun_l3_n370()
+    fun_l4_n939
+end
+
+def fun_l3_n371()
+    fun_l4_n569
+end
+
+def fun_l3_n372()
+    fun_l4_n267
+end
+
+def fun_l3_n373()
+    fun_l4_n640
+end
+
+def fun_l3_n374()
+    fun_l4_n647
+end
+
+def fun_l3_n375()
+    fun_l4_n658
+end
+
+def fun_l3_n376()
+    fun_l4_n346
+end
+
+def fun_l3_n377()
+    fun_l4_n781
+end
+
+def fun_l3_n378()
+    fun_l4_n820
+end
+
+def fun_l3_n379()
+    fun_l4_n11
+end
+
+def fun_l3_n380()
+    fun_l4_n238
+end
+
+def fun_l3_n381()
+    fun_l4_n78
+end
+
+def fun_l3_n382()
+    fun_l4_n497
+end
+
+def fun_l3_n383()
+    fun_l4_n815
+end
+
+def fun_l3_n384()
+    fun_l4_n876
+end
+
+def fun_l3_n385()
+    fun_l4_n392
+end
+
+def fun_l3_n386()
+    fun_l4_n228
+end
+
+def fun_l3_n387()
+    fun_l4_n230
+end
+
+def fun_l3_n388()
+    fun_l4_n216
+end
+
+def fun_l3_n389()
+    fun_l4_n661
+end
+
+def fun_l3_n390()
+    fun_l4_n831
+end
+
+def fun_l3_n391()
+    fun_l4_n588
+end
+
+def fun_l3_n392()
+    fun_l4_n377
+end
+
+def fun_l3_n393()
+    fun_l4_n245
+end
+
+def fun_l3_n394()
+    fun_l4_n546
+end
+
+def fun_l3_n395()
+    fun_l4_n48
+end
+
+def fun_l3_n396()
+    fun_l4_n109
+end
+
+def fun_l3_n397()
+    fun_l4_n958
+end
+
+def fun_l3_n398()
+    fun_l4_n779
+end
+
+def fun_l3_n399()
+    fun_l4_n942
+end
+
+def fun_l3_n400()
+    fun_l4_n436
+end
+
+def fun_l3_n401()
+    fun_l4_n321
+end
+
+def fun_l3_n402()
+    fun_l4_n789
+end
+
+def fun_l3_n403()
+    fun_l4_n96
+end
+
+def fun_l3_n404()
+    fun_l4_n101
+end
+
+def fun_l3_n405()
+    fun_l4_n373
+end
+
+def fun_l3_n406()
+    fun_l4_n143
+end
+
+def fun_l3_n407()
+    fun_l4_n869
+end
+
+def fun_l3_n408()
+    fun_l4_n836
+end
+
+def fun_l3_n409()
+    fun_l4_n278
+end
+
+def fun_l3_n410()
+    fun_l4_n819
+end
+
+def fun_l3_n411()
+    fun_l4_n716
+end
+
+def fun_l3_n412()
+    fun_l4_n729
+end
+
+def fun_l3_n413()
+    fun_l4_n565
+end
+
+def fun_l3_n414()
+    fun_l4_n258
+end
+
+def fun_l3_n415()
+    fun_l4_n187
+end
+
+def fun_l3_n416()
+    fun_l4_n425
+end
+
+def fun_l3_n417()
+    fun_l4_n239
+end
+
+def fun_l3_n418()
+    fun_l4_n352
+end
+
+def fun_l3_n419()
+    fun_l4_n747
+end
+
+def fun_l3_n420()
+    fun_l4_n103
+end
+
+def fun_l3_n421()
+    fun_l4_n276
+end
+
+def fun_l3_n422()
+    fun_l4_n348
+end
+
+def fun_l3_n423()
+    fun_l4_n737
+end
+
+def fun_l3_n424()
+    fun_l4_n615
+end
+
+def fun_l3_n425()
+    fun_l4_n305
+end
+
+def fun_l3_n426()
+    fun_l4_n474
+end
+
+def fun_l3_n427()
+    fun_l4_n304
+end
+
+def fun_l3_n428()
+    fun_l4_n607
+end
+
+def fun_l3_n429()
+    fun_l4_n202
+end
+
+def fun_l3_n430()
+    fun_l4_n370
+end
+
+def fun_l3_n431()
+    fun_l4_n580
+end
+
+def fun_l3_n432()
+    fun_l4_n752
+end
+
+def fun_l3_n433()
+    fun_l4_n720
+end
+
+def fun_l3_n434()
+    fun_l4_n916
+end
+
+def fun_l3_n435()
+    fun_l4_n424
+end
+
+def fun_l3_n436()
+    fun_l4_n922
+end
+
+def fun_l3_n437()
+    fun_l4_n885
+end
+
+def fun_l3_n438()
+    fun_l4_n849
+end
+
+def fun_l3_n439()
+    fun_l4_n595
+end
+
+def fun_l3_n440()
+    fun_l4_n753
+end
+
+def fun_l3_n441()
+    fun_l4_n871
+end
+
+def fun_l3_n442()
+    fun_l4_n979
+end
+
+def fun_l3_n443()
+    fun_l4_n217
+end
+
+def fun_l3_n444()
+    fun_l4_n249
+end
+
+def fun_l3_n445()
+    fun_l4_n181
+end
+
+def fun_l3_n446()
+    fun_l4_n283
+end
+
+def fun_l3_n447()
+    fun_l4_n495
+end
+
+def fun_l3_n448()
+    fun_l4_n701
+end
+
+def fun_l3_n449()
+    fun_l4_n897
+end
+
+def fun_l3_n450()
+    fun_l4_n479
+end
+
+def fun_l3_n451()
+    fun_l4_n410
+end
+
+def fun_l3_n452()
+    fun_l4_n842
+end
+
+def fun_l3_n453()
+    fun_l4_n700
+end
+
+def fun_l3_n454()
+    fun_l4_n855
+end
+
+def fun_l3_n455()
+    fun_l4_n743
+end
+
+def fun_l3_n456()
+    fun_l4_n842
+end
+
+def fun_l3_n457()
+    fun_l4_n575
+end
+
+def fun_l3_n458()
+    fun_l4_n48
+end
+
+def fun_l3_n459()
+    fun_l4_n650
+end
+
+def fun_l3_n460()
+    fun_l4_n714
+end
+
+def fun_l3_n461()
+    fun_l4_n409
+end
+
+def fun_l3_n462()
+    fun_l4_n225
+end
+
+def fun_l3_n463()
+    fun_l4_n419
+end
+
+def fun_l3_n464()
+    fun_l4_n563
+end
+
+def fun_l3_n465()
+    fun_l4_n416
+end
+
+def fun_l3_n466()
+    fun_l4_n738
+end
+
+def fun_l3_n467()
+    fun_l4_n955
+end
+
+def fun_l3_n468()
+    fun_l4_n406
+end
+
+def fun_l3_n469()
+    fun_l4_n157
+end
+
+def fun_l3_n470()
+    fun_l4_n732
+end
+
+def fun_l3_n471()
+    fun_l4_n567
+end
+
+def fun_l3_n472()
+    fun_l4_n895
+end
+
+def fun_l3_n473()
+    fun_l4_n377
+end
+
+def fun_l3_n474()
+    fun_l4_n105
+end
+
+def fun_l3_n475()
+    fun_l4_n640
+end
+
+def fun_l3_n476()
+    fun_l4_n617
+end
+
+def fun_l3_n477()
+    fun_l4_n109
+end
+
+def fun_l3_n478()
+    fun_l4_n358
+end
+
+def fun_l3_n479()
+    fun_l4_n522
+end
+
+def fun_l3_n480()
+    fun_l4_n550
+end
+
+def fun_l3_n481()
+    fun_l4_n648
+end
+
+def fun_l3_n482()
+    fun_l4_n533
+end
+
+def fun_l3_n483()
+    fun_l4_n782
+end
+
+def fun_l3_n484()
+    fun_l4_n369
+end
+
+def fun_l3_n485()
+    fun_l4_n644
+end
+
+def fun_l3_n486()
+    fun_l4_n989
+end
+
+def fun_l3_n487()
+    fun_l4_n434
+end
+
+def fun_l3_n488()
+    fun_l4_n914
+end
+
+def fun_l3_n489()
+    fun_l4_n2
+end
+
+def fun_l3_n490()
+    fun_l4_n494
+end
+
+def fun_l3_n491()
+    fun_l4_n479
+end
+
+def fun_l3_n492()
+    fun_l4_n733
+end
+
+def fun_l3_n493()
+    fun_l4_n394
+end
+
+def fun_l3_n494()
+    fun_l4_n39
+end
+
+def fun_l3_n495()
+    fun_l4_n866
+end
+
+def fun_l3_n496()
+    fun_l4_n151
+end
+
+def fun_l3_n497()
+    fun_l4_n155
+end
+
+def fun_l3_n498()
+    fun_l4_n417
+end
+
+def fun_l3_n499()
+    fun_l4_n933
+end
+
+def fun_l3_n500()
+    fun_l4_n44
+end
+
+def fun_l3_n501()
+    fun_l4_n738
+end
+
+def fun_l3_n502()
+    fun_l4_n859
+end
+
+def fun_l3_n503()
+    fun_l4_n124
+end
+
+def fun_l3_n504()
+    fun_l4_n344
+end
+
+def fun_l3_n505()
+    fun_l4_n921
+end
+
+def fun_l3_n506()
+    fun_l4_n168
+end
+
+def fun_l3_n507()
+    fun_l4_n135
+end
+
+def fun_l3_n508()
+    fun_l4_n730
+end
+
+def fun_l3_n509()
+    fun_l4_n671
+end
+
+def fun_l3_n510()
+    fun_l4_n899
+end
+
+def fun_l3_n511()
+    fun_l4_n630
+end
+
+def fun_l3_n512()
+    fun_l4_n228
+end
+
+def fun_l3_n513()
+    fun_l4_n429
+end
+
+def fun_l3_n514()
+    fun_l4_n723
+end
+
+def fun_l3_n515()
+    fun_l4_n185
+end
+
+def fun_l3_n516()
+    fun_l4_n161
+end
+
+def fun_l3_n517()
+    fun_l4_n491
+end
+
+def fun_l3_n518()
+    fun_l4_n643
+end
+
+def fun_l3_n519()
+    fun_l4_n3
+end
+
+def fun_l3_n520()
+    fun_l4_n399
+end
+
+def fun_l3_n521()
+    fun_l4_n927
+end
+
+def fun_l3_n522()
+    fun_l4_n501
+end
+
+def fun_l3_n523()
+    fun_l4_n729
+end
+
+def fun_l3_n524()
+    fun_l4_n628
+end
+
+def fun_l3_n525()
+    fun_l4_n469
+end
+
+def fun_l3_n526()
+    fun_l4_n754
+end
+
+def fun_l3_n527()
+    fun_l4_n448
+end
+
+def fun_l3_n528()
+    fun_l4_n562
+end
+
+def fun_l3_n529()
+    fun_l4_n779
+end
+
+def fun_l3_n530()
+    fun_l4_n452
+end
+
+def fun_l3_n531()
+    fun_l4_n756
+end
+
+def fun_l3_n532()
+    fun_l4_n107
+end
+
+def fun_l3_n533()
+    fun_l4_n311
+end
+
+def fun_l3_n534()
+    fun_l4_n169
+end
+
+def fun_l3_n535()
+    fun_l4_n956
+end
+
+def fun_l3_n536()
+    fun_l4_n754
+end
+
+def fun_l3_n537()
+    fun_l4_n675
+end
+
+def fun_l3_n538()
+    fun_l4_n636
+end
+
+def fun_l3_n539()
+    fun_l4_n691
+end
+
+def fun_l3_n540()
+    fun_l4_n867
+end
+
+def fun_l3_n541()
+    fun_l4_n179
+end
+
+def fun_l3_n542()
+    fun_l4_n153
+end
+
+def fun_l3_n543()
+    fun_l4_n133
+end
+
+def fun_l3_n544()
+    fun_l4_n592
+end
+
+def fun_l3_n545()
+    fun_l4_n71
+end
+
+def fun_l3_n546()
+    fun_l4_n87
+end
+
+def fun_l3_n547()
+    fun_l4_n740
+end
+
+def fun_l3_n548()
+    fun_l4_n436
+end
+
+def fun_l3_n549()
+    fun_l4_n59
+end
+
+def fun_l3_n550()
+    fun_l4_n252
+end
+
+def fun_l3_n551()
+    fun_l4_n596
+end
+
+def fun_l3_n552()
+    fun_l4_n851
+end
+
+def fun_l3_n553()
+    fun_l4_n708
+end
+
+def fun_l3_n554()
+    fun_l4_n210
+end
+
+def fun_l3_n555()
+    fun_l4_n931
+end
+
+def fun_l3_n556()
+    fun_l4_n293
+end
+
+def fun_l3_n557()
+    fun_l4_n413
+end
+
+def fun_l3_n558()
+    fun_l4_n547
+end
+
+def fun_l3_n559()
+    fun_l4_n338
+end
+
+def fun_l3_n560()
+    fun_l4_n194
+end
+
+def fun_l3_n561()
+    fun_l4_n937
+end
+
+def fun_l3_n562()
+    fun_l4_n19
+end
+
+def fun_l3_n563()
+    fun_l4_n651
+end
+
+def fun_l3_n564()
+    fun_l4_n364
+end
+
+def fun_l3_n565()
+    fun_l4_n295
+end
+
+def fun_l3_n566()
+    fun_l4_n946
+end
+
+def fun_l3_n567()
+    fun_l4_n712
+end
+
+def fun_l3_n568()
+    fun_l4_n243
+end
+
+def fun_l3_n569()
+    fun_l4_n563
+end
+
+def fun_l3_n570()
+    fun_l4_n651
+end
+
+def fun_l3_n571()
+    fun_l4_n645
+end
+
+def fun_l3_n572()
+    fun_l4_n46
+end
+
+def fun_l3_n573()
+    fun_l4_n971
+end
+
+def fun_l3_n574()
+    fun_l4_n769
+end
+
+def fun_l3_n575()
+    fun_l4_n315
+end
+
+def fun_l3_n576()
+    fun_l4_n657
+end
+
+def fun_l3_n577()
+    fun_l4_n607
+end
+
+def fun_l3_n578()
+    fun_l4_n352
+end
+
+def fun_l3_n579()
+    fun_l4_n346
+end
+
+def fun_l3_n580()
+    fun_l4_n424
+end
+
+def fun_l3_n581()
+    fun_l4_n703
+end
+
+def fun_l3_n582()
+    fun_l4_n872
+end
+
+def fun_l3_n583()
+    fun_l4_n828
+end
+
+def fun_l3_n584()
+    fun_l4_n283
+end
+
+def fun_l3_n585()
+    fun_l4_n557
+end
+
+def fun_l3_n586()
+    fun_l4_n942
+end
+
+def fun_l3_n587()
+    fun_l4_n121
+end
+
+def fun_l3_n588()
+    fun_l4_n866
+end
+
+def fun_l3_n589()
+    fun_l4_n539
+end
+
+def fun_l3_n590()
+    fun_l4_n240
+end
+
+def fun_l3_n591()
+    fun_l4_n438
+end
+
+def fun_l3_n592()
+    fun_l4_n652
+end
+
+def fun_l3_n593()
+    fun_l4_n540
+end
+
+def fun_l3_n594()
+    fun_l4_n122
+end
+
+def fun_l3_n595()
+    fun_l4_n877
+end
+
+def fun_l3_n596()
+    fun_l4_n30
+end
+
+def fun_l3_n597()
+    fun_l4_n465
+end
+
+def fun_l3_n598()
+    fun_l4_n964
+end
+
+def fun_l3_n599()
+    fun_l4_n123
+end
+
+def fun_l3_n600()
+    fun_l4_n365
+end
+
+def fun_l3_n601()
+    fun_l4_n531
+end
+
+def fun_l3_n602()
+    fun_l4_n774
+end
+
+def fun_l3_n603()
+    fun_l4_n961
+end
+
+def fun_l3_n604()
+    fun_l4_n360
+end
+
+def fun_l3_n605()
+    fun_l4_n640
+end
+
+def fun_l3_n606()
+    fun_l4_n785
+end
+
+def fun_l3_n607()
+    fun_l4_n433
+end
+
+def fun_l3_n608()
+    fun_l4_n528
+end
+
+def fun_l3_n609()
+    fun_l4_n125
+end
+
+def fun_l3_n610()
+    fun_l4_n179
+end
+
+def fun_l3_n611()
+    fun_l4_n946
+end
+
+def fun_l3_n612()
+    fun_l4_n899
+end
+
+def fun_l3_n613()
+    fun_l4_n917
+end
+
+def fun_l3_n614()
+    fun_l4_n444
+end
+
+def fun_l3_n615()
+    fun_l4_n823
+end
+
+def fun_l3_n616()
+    fun_l4_n221
+end
+
+def fun_l3_n617()
+    fun_l4_n483
+end
+
+def fun_l3_n618()
+    fun_l4_n112
+end
+
+def fun_l3_n619()
+    fun_l4_n814
+end
+
+def fun_l3_n620()
+    fun_l4_n648
+end
+
+def fun_l3_n621()
+    fun_l4_n823
+end
+
+def fun_l3_n622()
+    fun_l4_n457
+end
+
+def fun_l3_n623()
+    fun_l4_n92
+end
+
+def fun_l3_n624()
+    fun_l4_n8
+end
+
+def fun_l3_n625()
+    fun_l4_n297
+end
+
+def fun_l3_n626()
+    fun_l4_n517
+end
+
+def fun_l3_n627()
+    fun_l4_n159
+end
+
+def fun_l3_n628()
+    fun_l4_n79
+end
+
+def fun_l3_n629()
+    fun_l4_n791
+end
+
+def fun_l3_n630()
+    fun_l4_n692
+end
+
+def fun_l3_n631()
+    fun_l4_n554
+end
+
+def fun_l3_n632()
+    fun_l4_n872
+end
+
+def fun_l3_n633()
+    fun_l4_n871
+end
+
+def fun_l3_n634()
+    fun_l4_n524
+end
+
+def fun_l3_n635()
+    fun_l4_n588
+end
+
+def fun_l3_n636()
+    fun_l4_n596
+end
+
+def fun_l3_n637()
+    fun_l4_n936
+end
+
+def fun_l3_n638()
+    fun_l4_n478
+end
+
+def fun_l3_n639()
+    fun_l4_n893
+end
+
+def fun_l3_n640()
+    fun_l4_n348
+end
+
+def fun_l3_n641()
+    fun_l4_n806
+end
+
+def fun_l3_n642()
+    fun_l4_n522
+end
+
+def fun_l3_n643()
+    fun_l4_n249
+end
+
+def fun_l3_n644()
+    fun_l4_n208
+end
+
+def fun_l3_n645()
+    fun_l4_n989
+end
+
+def fun_l3_n646()
+    fun_l4_n194
+end
+
+def fun_l3_n647()
+    fun_l4_n157
+end
+
+def fun_l3_n648()
+    fun_l4_n395
+end
+
+def fun_l3_n649()
+    fun_l4_n191
+end
+
+def fun_l3_n650()
+    fun_l4_n292
+end
+
+def fun_l3_n651()
+    fun_l4_n640
+end
+
+def fun_l3_n652()
+    fun_l4_n818
+end
+
+def fun_l3_n653()
+    fun_l4_n481
+end
+
+def fun_l3_n654()
+    fun_l4_n304
+end
+
+def fun_l3_n655()
+    fun_l4_n102
+end
+
+def fun_l3_n656()
+    fun_l4_n51
+end
+
+def fun_l3_n657()
+    fun_l4_n110
+end
+
+def fun_l3_n658()
+    fun_l4_n226
+end
+
+def fun_l3_n659()
+    fun_l4_n48
+end
+
+def fun_l3_n660()
+    fun_l4_n112
+end
+
+def fun_l3_n661()
+    fun_l4_n677
+end
+
+def fun_l3_n662()
+    fun_l4_n168
+end
+
+def fun_l3_n663()
+    fun_l4_n15
+end
+
+def fun_l3_n664()
+    fun_l4_n311
+end
+
+def fun_l3_n665()
+    fun_l4_n935
+end
+
+def fun_l3_n666()
+    fun_l4_n861
+end
+
+def fun_l3_n667()
+    fun_l4_n169
+end
+
+def fun_l3_n668()
+    fun_l4_n395
+end
+
+def fun_l3_n669()
+    fun_l4_n371
+end
+
+def fun_l3_n670()
+    fun_l4_n625
+end
+
+def fun_l3_n671()
+    fun_l4_n183
+end
+
+def fun_l3_n672()
+    fun_l4_n299
+end
+
+def fun_l3_n673()
+    fun_l4_n104
+end
+
+def fun_l3_n674()
+    fun_l4_n413
+end
+
+def fun_l3_n675()
+    fun_l4_n957
+end
+
+def fun_l3_n676()
+    fun_l4_n878
+end
+
+def fun_l3_n677()
+    fun_l4_n222
+end
+
+def fun_l3_n678()
+    fun_l4_n832
+end
+
+def fun_l3_n679()
+    fun_l4_n406
+end
+
+def fun_l3_n680()
+    fun_l4_n779
+end
+
+def fun_l3_n681()
+    fun_l4_n874
+end
+
+def fun_l3_n682()
+    fun_l4_n328
+end
+
+def fun_l3_n683()
+    fun_l4_n412
+end
+
+def fun_l3_n684()
+    fun_l4_n46
+end
+
+def fun_l3_n685()
+    fun_l4_n799
+end
+
+def fun_l3_n686()
+    fun_l4_n751
+end
+
+def fun_l3_n687()
+    fun_l4_n32
+end
+
+def fun_l3_n688()
+    fun_l4_n237
+end
+
+def fun_l3_n689()
+    fun_l4_n770
+end
+
+def fun_l3_n690()
+    fun_l4_n120
+end
+
+def fun_l3_n691()
+    fun_l4_n977
+end
+
+def fun_l3_n692()
+    fun_l4_n35
+end
+
+def fun_l3_n693()
+    fun_l4_n398
+end
+
+def fun_l3_n694()
+    fun_l4_n551
+end
+
+def fun_l3_n695()
+    fun_l4_n122
+end
+
+def fun_l3_n696()
+    fun_l4_n268
+end
+
+def fun_l3_n697()
+    fun_l4_n628
+end
+
+def fun_l3_n698()
+    fun_l4_n611
+end
+
+def fun_l3_n699()
+    fun_l4_n382
+end
+
+def fun_l3_n700()
+    fun_l4_n819
+end
+
+def fun_l3_n701()
+    fun_l4_n124
+end
+
+def fun_l3_n702()
+    fun_l4_n529
+end
+
+def fun_l3_n703()
+    fun_l4_n838
+end
+
+def fun_l3_n704()
+    fun_l4_n181
+end
+
+def fun_l3_n705()
+    fun_l4_n123
+end
+
+def fun_l3_n706()
+    fun_l4_n646
+end
+
+def fun_l3_n707()
+    fun_l4_n193
+end
+
+def fun_l3_n708()
+    fun_l4_n233
+end
+
+def fun_l3_n709()
+    fun_l4_n621
+end
+
+def fun_l3_n710()
+    fun_l4_n772
+end
+
+def fun_l3_n711()
+    fun_l4_n461
+end
+
+def fun_l3_n712()
+    fun_l4_n673
+end
+
+def fun_l3_n713()
+    fun_l4_n101
+end
+
+def fun_l3_n714()
+    fun_l4_n467
+end
+
+def fun_l3_n715()
+    fun_l4_n211
+end
+
+def fun_l3_n716()
+    fun_l4_n554
+end
+
+def fun_l3_n717()
+    fun_l4_n276
+end
+
+def fun_l3_n718()
+    fun_l4_n655
+end
+
+def fun_l3_n719()
+    fun_l4_n425
+end
+
+def fun_l3_n720()
+    fun_l4_n241
+end
+
+def fun_l3_n721()
+    fun_l4_n904
+end
+
+def fun_l3_n722()
+    fun_l4_n839
+end
+
+def fun_l3_n723()
+    fun_l4_n991
+end
+
+def fun_l3_n724()
+    fun_l4_n556
+end
+
+def fun_l3_n725()
+    fun_l4_n86
+end
+
+def fun_l3_n726()
+    fun_l4_n953
+end
+
+def fun_l3_n727()
+    fun_l4_n18
+end
+
+def fun_l3_n728()
+    fun_l4_n374
+end
+
+def fun_l3_n729()
+    fun_l4_n712
+end
+
+def fun_l3_n730()
+    fun_l4_n228
+end
+
+def fun_l3_n731()
+    fun_l4_n830
+end
+
+def fun_l3_n732()
+    fun_l4_n49
+end
+
+def fun_l3_n733()
+    fun_l4_n987
+end
+
+def fun_l3_n734()
+    fun_l4_n815
+end
+
+def fun_l3_n735()
+    fun_l4_n386
+end
+
+def fun_l3_n736()
+    fun_l4_n843
+end
+
+def fun_l3_n737()
+    fun_l4_n958
+end
+
+def fun_l3_n738()
+    fun_l4_n317
+end
+
+def fun_l3_n739()
+    fun_l4_n361
+end
+
+def fun_l3_n740()
+    fun_l4_n392
+end
+
+def fun_l3_n741()
+    fun_l4_n888
+end
+
+def fun_l3_n742()
+    fun_l4_n186
+end
+
+def fun_l3_n743()
+    fun_l4_n493
+end
+
+def fun_l3_n744()
+    fun_l4_n302
+end
+
+def fun_l3_n745()
+    fun_l4_n690
+end
+
+def fun_l3_n746()
+    fun_l4_n601
+end
+
+def fun_l3_n747()
+    fun_l4_n975
+end
+
+def fun_l3_n748()
+    fun_l4_n543
+end
+
+def fun_l3_n749()
+    fun_l4_n8
+end
+
+def fun_l3_n750()
+    fun_l4_n905
+end
+
+def fun_l3_n751()
+    fun_l4_n964
+end
+
+def fun_l3_n752()
+    fun_l4_n739
+end
+
+def fun_l3_n753()
+    fun_l4_n24
+end
+
+def fun_l3_n754()
+    fun_l4_n806
+end
+
+def fun_l3_n755()
+    fun_l4_n704
+end
+
+def fun_l3_n756()
+    fun_l4_n579
+end
+
+def fun_l3_n757()
+    fun_l4_n264
+end
+
+def fun_l3_n758()
+    fun_l4_n357
+end
+
+def fun_l3_n759()
+    fun_l4_n333
+end
+
+def fun_l3_n760()
+    fun_l4_n309
+end
+
+def fun_l3_n761()
+    fun_l4_n419
+end
+
+def fun_l3_n762()
+    fun_l4_n347
+end
+
+def fun_l3_n763()
+    fun_l4_n132
+end
+
+def fun_l3_n764()
+    fun_l4_n45
+end
+
+def fun_l3_n765()
+    fun_l4_n740
+end
+
+def fun_l3_n766()
+    fun_l4_n332
+end
+
+def fun_l3_n767()
+    fun_l4_n600
+end
+
+def fun_l3_n768()
+    fun_l4_n343
+end
+
+def fun_l3_n769()
+    fun_l4_n872
+end
+
+def fun_l3_n770()
+    fun_l4_n326
+end
+
+def fun_l3_n771()
+    fun_l4_n862
+end
+
+def fun_l3_n772()
+    fun_l4_n800
+end
+
+def fun_l3_n773()
+    fun_l4_n616
+end
+
+def fun_l3_n774()
+    fun_l4_n392
+end
+
+def fun_l3_n775()
+    fun_l4_n252
+end
+
+def fun_l3_n776()
+    fun_l4_n289
+end
+
+def fun_l3_n777()
+    fun_l4_n789
+end
+
+def fun_l3_n778()
+    fun_l4_n370
+end
+
+def fun_l3_n779()
+    fun_l4_n969
+end
+
+def fun_l3_n780()
+    fun_l4_n444
+end
+
+def fun_l3_n781()
+    fun_l4_n671
+end
+
+def fun_l3_n782()
+    fun_l4_n301
+end
+
+def fun_l3_n783()
+    fun_l4_n418
+end
+
+def fun_l3_n784()
+    fun_l4_n491
+end
+
+def fun_l3_n785()
+    fun_l4_n746
+end
+
+def fun_l3_n786()
+    fun_l4_n212
+end
+
+def fun_l3_n787()
+    fun_l4_n856
+end
+
+def fun_l3_n788()
+    fun_l4_n155
+end
+
+def fun_l3_n789()
+    fun_l4_n685
+end
+
+def fun_l3_n790()
+    fun_l4_n879
+end
+
+def fun_l3_n791()
+    fun_l4_n363
+end
+
+def fun_l3_n792()
+    fun_l4_n231
+end
+
+def fun_l3_n793()
+    fun_l4_n727
+end
+
+def fun_l3_n794()
+    fun_l4_n355
+end
+
+def fun_l3_n795()
+    fun_l4_n671
+end
+
+def fun_l3_n796()
+    fun_l4_n20
+end
+
+def fun_l3_n797()
+    fun_l4_n523
+end
+
+def fun_l3_n798()
+    fun_l4_n26
+end
+
+def fun_l3_n799()
+    fun_l4_n785
+end
+
+def fun_l3_n800()
+    fun_l4_n458
+end
+
+def fun_l3_n801()
+    fun_l4_n160
+end
+
+def fun_l3_n802()
+    fun_l4_n543
+end
+
+def fun_l3_n803()
+    fun_l4_n292
+end
+
+def fun_l3_n804()
+    fun_l4_n64
+end
+
+def fun_l3_n805()
+    fun_l4_n851
+end
+
+def fun_l3_n806()
+    fun_l4_n369
+end
+
+def fun_l3_n807()
+    fun_l4_n827
+end
+
+def fun_l3_n808()
+    fun_l4_n420
+end
+
+def fun_l3_n809()
+    fun_l4_n98
+end
+
+def fun_l3_n810()
+    fun_l4_n508
+end
+
+def fun_l3_n811()
+    fun_l4_n366
+end
+
+def fun_l3_n812()
+    fun_l4_n795
+end
+
+def fun_l3_n813()
+    fun_l4_n345
+end
+
+def fun_l3_n814()
+    fun_l4_n505
+end
+
+def fun_l3_n815()
+    fun_l4_n302
+end
+
+def fun_l3_n816()
+    fun_l4_n561
+end
+
+def fun_l3_n817()
+    fun_l4_n781
+end
+
+def fun_l3_n818()
+    fun_l4_n599
+end
+
+def fun_l3_n819()
+    fun_l4_n967
+end
+
+def fun_l3_n820()
+    fun_l4_n691
+end
+
+def fun_l3_n821()
+    fun_l4_n563
+end
+
+def fun_l3_n822()
+    fun_l4_n769
+end
+
+def fun_l3_n823()
+    fun_l4_n531
+end
+
+def fun_l3_n824()
+    fun_l4_n957
+end
+
+def fun_l3_n825()
+    fun_l4_n395
+end
+
+def fun_l3_n826()
+    fun_l4_n92
+end
+
+def fun_l3_n827()
+    fun_l4_n781
+end
+
+def fun_l3_n828()
+    fun_l4_n758
+end
+
+def fun_l3_n829()
+    fun_l4_n648
+end
+
+def fun_l3_n830()
+    fun_l4_n799
+end
+
+def fun_l3_n831()
+    fun_l4_n922
+end
+
+def fun_l3_n832()
+    fun_l4_n808
+end
+
+def fun_l3_n833()
+    fun_l4_n180
+end
+
+def fun_l3_n834()
+    fun_l4_n126
+end
+
+def fun_l3_n835()
+    fun_l4_n261
+end
+
+def fun_l3_n836()
+    fun_l4_n470
+end
+
+def fun_l3_n837()
+    fun_l4_n441
+end
+
+def fun_l3_n838()
+    fun_l4_n505
+end
+
+def fun_l3_n839()
+    fun_l4_n490
+end
+
+def fun_l3_n840()
+    fun_l4_n663
+end
+
+def fun_l3_n841()
+    fun_l4_n256
+end
+
+def fun_l3_n842()
+    fun_l4_n797
+end
+
+def fun_l3_n843()
+    fun_l4_n836
+end
+
+def fun_l3_n844()
+    fun_l4_n868
+end
+
+def fun_l3_n845()
+    fun_l4_n927
+end
+
+def fun_l3_n846()
+    fun_l4_n746
+end
+
+def fun_l3_n847()
+    fun_l4_n143
+end
+
+def fun_l3_n848()
+    fun_l4_n90
+end
+
+def fun_l3_n849()
+    fun_l4_n63
+end
+
+def fun_l3_n850()
+    fun_l4_n629
+end
+
+def fun_l3_n851()
+    fun_l4_n66
+end
+
+def fun_l3_n852()
+    fun_l4_n192
+end
+
+def fun_l3_n853()
+    fun_l4_n780
+end
+
+def fun_l3_n854()
+    fun_l4_n744
+end
+
+def fun_l3_n855()
+    fun_l4_n989
+end
+
+def fun_l3_n856()
+    fun_l4_n609
+end
+
+def fun_l3_n857()
+    fun_l4_n534
+end
+
+def fun_l3_n858()
+    fun_l4_n961
+end
+
+def fun_l3_n859()
+    fun_l4_n605
+end
+
+def fun_l3_n860()
+    fun_l4_n675
+end
+
+def fun_l3_n861()
+    fun_l4_n520
+end
+
+def fun_l3_n862()
+    fun_l4_n656
+end
+
+def fun_l3_n863()
+    fun_l4_n917
+end
+
+def fun_l3_n864()
+    fun_l4_n291
+end
+
+def fun_l3_n865()
+    fun_l4_n343
+end
+
+def fun_l3_n866()
+    fun_l4_n704
+end
+
+def fun_l3_n867()
+    fun_l4_n368
+end
+
+def fun_l3_n868()
+    fun_l4_n678
+end
+
+def fun_l3_n869()
+    fun_l4_n788
+end
+
+def fun_l3_n870()
+    fun_l4_n458
+end
+
+def fun_l3_n871()
+    fun_l4_n882
+end
+
+def fun_l3_n872()
+    fun_l4_n830
+end
+
+def fun_l3_n873()
+    fun_l4_n434
+end
+
+def fun_l3_n874()
+    fun_l4_n92
+end
+
+def fun_l3_n875()
+    fun_l4_n633
+end
+
+def fun_l3_n876()
+    fun_l4_n243
+end
+
+def fun_l3_n877()
+    fun_l4_n641
+end
+
+def fun_l3_n878()
+    fun_l4_n114
+end
+
+def fun_l3_n879()
+    fun_l4_n696
+end
+
+def fun_l3_n880()
+    fun_l4_n354
+end
+
+def fun_l3_n881()
+    fun_l4_n644
+end
+
+def fun_l3_n882()
+    fun_l4_n771
+end
+
+def fun_l3_n883()
+    fun_l4_n196
+end
+
+def fun_l3_n884()
+    fun_l4_n202
+end
+
+def fun_l3_n885()
+    fun_l4_n322
+end
+
+def fun_l3_n886()
+    fun_l4_n125
+end
+
+def fun_l3_n887()
+    fun_l4_n760
+end
+
+def fun_l3_n888()
+    fun_l4_n69
+end
+
+def fun_l3_n889()
+    fun_l4_n101
+end
+
+def fun_l3_n890()
+    fun_l4_n108
+end
+
+def fun_l3_n891()
+    fun_l4_n929
+end
+
+def fun_l3_n892()
+    fun_l4_n766
+end
+
+def fun_l3_n893()
+    fun_l4_n811
+end
+
+def fun_l3_n894()
+    fun_l4_n169
+end
+
+def fun_l3_n895()
+    fun_l4_n613
+end
+
+def fun_l3_n896()
+    fun_l4_n145
+end
+
+def fun_l3_n897()
+    fun_l4_n780
+end
+
+def fun_l3_n898()
+    fun_l4_n972
+end
+
+def fun_l3_n899()
+    fun_l4_n508
+end
+
+def fun_l3_n900()
+    fun_l4_n468
+end
+
+def fun_l3_n901()
+    fun_l4_n968
+end
+
+def fun_l3_n902()
+    fun_l4_n714
+end
+
+def fun_l3_n903()
+    fun_l4_n817
+end
+
+def fun_l3_n904()
+    fun_l4_n111
+end
+
+def fun_l3_n905()
+    fun_l4_n115
+end
+
+def fun_l3_n906()
+    fun_l4_n593
+end
+
+def fun_l3_n907()
+    fun_l4_n961
+end
+
+def fun_l3_n908()
+    fun_l4_n362
+end
+
+def fun_l3_n909()
+    fun_l4_n251
+end
+
+def fun_l3_n910()
+    fun_l4_n532
+end
+
+def fun_l3_n911()
+    fun_l4_n252
+end
+
+def fun_l3_n912()
+    fun_l4_n751
+end
+
+def fun_l3_n913()
+    fun_l4_n962
+end
+
+def fun_l3_n914()
+    fun_l4_n151
+end
+
+def fun_l3_n915()
+    fun_l4_n91
+end
+
+def fun_l3_n916()
+    fun_l4_n164
+end
+
+def fun_l3_n917()
+    fun_l4_n714
+end
+
+def fun_l3_n918()
+    fun_l4_n496
+end
+
+def fun_l3_n919()
+    fun_l4_n833
+end
+
+def fun_l3_n920()
+    fun_l4_n315
+end
+
+def fun_l3_n921()
+    fun_l4_n551
+end
+
+def fun_l3_n922()
+    fun_l4_n986
+end
+
+def fun_l3_n923()
+    fun_l4_n924
+end
+
+def fun_l3_n924()
+    fun_l4_n670
+end
+
+def fun_l3_n925()
+    fun_l4_n611
+end
+
+def fun_l3_n926()
+    fun_l4_n590
+end
+
+def fun_l3_n927()
+    fun_l4_n951
+end
+
+def fun_l3_n928()
+    fun_l4_n438
+end
+
+def fun_l3_n929()
+    fun_l4_n914
+end
+
+def fun_l3_n930()
+    fun_l4_n357
+end
+
+def fun_l3_n931()
+    fun_l4_n330
+end
+
+def fun_l3_n932()
+    fun_l4_n737
+end
+
+def fun_l3_n933()
+    fun_l4_n857
+end
+
+def fun_l3_n934()
+    fun_l4_n32
+end
+
+def fun_l3_n935()
+    fun_l4_n980
+end
+
+def fun_l3_n936()
+    fun_l4_n229
+end
+
+def fun_l3_n937()
+    fun_l4_n779
+end
+
+def fun_l3_n938()
+    fun_l4_n365
+end
+
+def fun_l3_n939()
+    fun_l4_n681
+end
+
+def fun_l3_n940()
+    fun_l4_n55
+end
+
+def fun_l3_n941()
+    fun_l4_n324
+end
+
+def fun_l3_n942()
+    fun_l4_n630
+end
+
+def fun_l3_n943()
+    fun_l4_n910
+end
+
+def fun_l3_n944()
+    fun_l4_n590
+end
+
+def fun_l3_n945()
+    fun_l4_n798
+end
+
+def fun_l3_n946()
+    fun_l4_n973
+end
+
+def fun_l3_n947()
+    fun_l4_n180
+end
+
+def fun_l3_n948()
+    fun_l4_n425
+end
+
+def fun_l3_n949()
+    fun_l4_n446
+end
+
+def fun_l3_n950()
+    fun_l4_n296
+end
+
+def fun_l3_n951()
+    fun_l4_n61
+end
+
+def fun_l3_n952()
+    fun_l4_n797
+end
+
+def fun_l3_n953()
+    fun_l4_n824
+end
+
+def fun_l3_n954()
+    fun_l4_n336
+end
+
+def fun_l3_n955()
+    fun_l4_n82
+end
+
+def fun_l3_n956()
+    fun_l4_n310
+end
+
+def fun_l3_n957()
+    fun_l4_n983
+end
+
+def fun_l3_n958()
+    fun_l4_n780
+end
+
+def fun_l3_n959()
+    fun_l4_n697
+end
+
+def fun_l3_n960()
+    fun_l4_n822
+end
+
+def fun_l3_n961()
+    fun_l4_n209
+end
+
+def fun_l3_n962()
+    fun_l4_n549
+end
+
+def fun_l3_n963()
+    fun_l4_n226
+end
+
+def fun_l3_n964()
+    fun_l4_n324
+end
+
+def fun_l3_n965()
+    fun_l4_n63
+end
+
+def fun_l3_n966()
+    fun_l4_n430
+end
+
+def fun_l3_n967()
+    fun_l4_n645
+end
+
+def fun_l3_n968()
+    fun_l4_n875
+end
+
+def fun_l3_n969()
+    fun_l4_n713
+end
+
+def fun_l3_n970()
+    fun_l4_n457
+end
+
+def fun_l3_n971()
+    fun_l4_n768
+end
+
+def fun_l3_n972()
+    fun_l4_n548
+end
+
+def fun_l3_n973()
+    fun_l4_n577
+end
+
+def fun_l3_n974()
+    fun_l4_n109
+end
+
+def fun_l3_n975()
+    fun_l4_n460
+end
+
+def fun_l3_n976()
+    fun_l4_n83
+end
+
+def fun_l3_n977()
+    fun_l4_n152
+end
+
+def fun_l3_n978()
+    fun_l4_n224
+end
+
+def fun_l3_n979()
+    fun_l4_n897
+end
+
+def fun_l3_n980()
+    fun_l4_n830
+end
+
+def fun_l3_n981()
+    fun_l4_n747
+end
+
+def fun_l3_n982()
+    fun_l4_n21
+end
+
+def fun_l3_n983()
+    fun_l4_n84
+end
+
+def fun_l3_n984()
+    fun_l4_n342
+end
+
+def fun_l3_n985()
+    fun_l4_n950
+end
+
+def fun_l3_n986()
+    fun_l4_n33
+end
+
+def fun_l3_n987()
+    fun_l4_n388
+end
+
+def fun_l3_n988()
+    fun_l4_n766
+end
+
+def fun_l3_n989()
+    fun_l4_n708
+end
+
+def fun_l3_n990()
+    fun_l4_n392
+end
+
+def fun_l3_n991()
+    fun_l4_n782
+end
+
+def fun_l3_n992()
+    fun_l4_n223
+end
+
+def fun_l3_n993()
+    fun_l4_n416
+end
+
+def fun_l3_n994()
+    fun_l4_n609
+end
+
+def fun_l3_n995()
+    fun_l4_n158
+end
+
+def fun_l3_n996()
+    fun_l4_n246
+end
+
+def fun_l3_n997()
+    fun_l4_n667
+end
+
+def fun_l3_n998()
+    fun_l4_n126
+end
+
+def fun_l3_n999()
+    fun_l4_n726
+end
+
+def fun_l4_n0()
+    fun_l5_n544
+end
+
+def fun_l4_n1()
+    fun_l5_n456
+end
+
+def fun_l4_n2()
+    fun_l5_n364
+end
+
+def fun_l4_n3()
+    fun_l5_n929
+end
+
+def fun_l4_n4()
+    fun_l5_n593
+end
+
+def fun_l4_n5()
+    fun_l5_n287
+end
+
+def fun_l4_n6()
+    fun_l5_n272
+end
+
+def fun_l4_n7()
+    fun_l5_n71
+end
+
+def fun_l4_n8()
+    fun_l5_n704
+end
+
+def fun_l4_n9()
+    fun_l5_n462
+end
+
+def fun_l4_n10()
+    fun_l5_n239
+end
+
+def fun_l4_n11()
+    fun_l5_n853
+end
+
+def fun_l4_n12()
+    fun_l5_n217
+end
+
+def fun_l4_n13()
+    fun_l5_n822
+end
+
+def fun_l4_n14()
+    fun_l5_n663
+end
+
+def fun_l4_n15()
+    fun_l5_n400
+end
+
+def fun_l4_n16()
+    fun_l5_n307
+end
+
+def fun_l4_n17()
+    fun_l5_n820
+end
+
+def fun_l4_n18()
+    fun_l5_n885
+end
+
+def fun_l4_n19()
+    fun_l5_n680
+end
+
+def fun_l4_n20()
+    fun_l5_n592
+end
+
+def fun_l4_n21()
+    fun_l5_n615
+end
+
+def fun_l4_n22()
+    fun_l5_n669
+end
+
+def fun_l4_n23()
+    fun_l5_n978
+end
+
+def fun_l4_n24()
+    fun_l5_n946
+end
+
+def fun_l4_n25()
+    fun_l5_n915
+end
+
+def fun_l4_n26()
+    fun_l5_n286
+end
+
+def fun_l4_n27()
+    fun_l5_n466
+end
+
+def fun_l4_n28()
+    fun_l5_n970
+end
+
+def fun_l4_n29()
+    fun_l5_n822
+end
+
+def fun_l4_n30()
+    fun_l5_n883
+end
+
+def fun_l4_n31()
+    fun_l5_n137
+end
+
+def fun_l4_n32()
+    fun_l5_n957
+end
+
+def fun_l4_n33()
+    fun_l5_n912
+end
+
+def fun_l4_n34()
+    fun_l5_n156
+end
+
+def fun_l4_n35()
+    fun_l5_n207
+end
+
+def fun_l4_n36()
+    fun_l5_n525
+end
+
+def fun_l4_n37()
+    fun_l5_n673
+end
+
+def fun_l4_n38()
+    fun_l5_n151
+end
+
+def fun_l4_n39()
+    fun_l5_n517
+end
+
+def fun_l4_n40()
+    fun_l5_n459
+end
+
+def fun_l4_n41()
+    fun_l5_n738
+end
+
+def fun_l4_n42()
+    fun_l5_n809
+end
+
+def fun_l4_n43()
+    fun_l5_n853
+end
+
+def fun_l4_n44()
+    fun_l5_n653
+end
+
+def fun_l4_n45()
+    fun_l5_n346
+end
+
+def fun_l4_n46()
+    fun_l5_n704
+end
+
+def fun_l4_n47()
+    fun_l5_n662
+end
+
+def fun_l4_n48()
+    fun_l5_n990
+end
+
+def fun_l4_n49()
+    fun_l5_n731
+end
+
+def fun_l4_n50()
+    fun_l5_n305
+end
+
+def fun_l4_n51()
+    fun_l5_n238
+end
+
+def fun_l4_n52()
+    fun_l5_n710
+end
+
+def fun_l4_n53()
+    fun_l5_n61
+end
+
+def fun_l4_n54()
+    fun_l5_n572
+end
+
+def fun_l4_n55()
+    fun_l5_n939
+end
+
+def fun_l4_n56()
+    fun_l5_n223
+end
+
+def fun_l4_n57()
+    fun_l5_n466
+end
+
+def fun_l4_n58()
+    fun_l5_n442
+end
+
+def fun_l4_n59()
+    fun_l5_n971
+end
+
+def fun_l4_n60()
+    fun_l5_n42
+end
+
+def fun_l4_n61()
+    fun_l5_n390
+end
+
+def fun_l4_n62()
+    fun_l5_n254
+end
+
+def fun_l4_n63()
+    fun_l5_n522
+end
+
+def fun_l4_n64()
+    fun_l5_n16
+end
+
+def fun_l4_n65()
+    fun_l5_n567
+end
+
+def fun_l4_n66()
+    fun_l5_n353
+end
+
+def fun_l4_n67()
+    fun_l5_n676
+end
+
+def fun_l4_n68()
+    fun_l5_n526
+end
+
+def fun_l4_n69()
+    fun_l5_n140
+end
+
+def fun_l4_n70()
+    fun_l5_n829
+end
+
+def fun_l4_n71()
+    fun_l5_n562
+end
+
+def fun_l4_n72()
+    fun_l5_n489
+end
+
+def fun_l4_n73()
+    fun_l5_n205
+end
+
+def fun_l4_n74()
+    fun_l5_n558
+end
+
+def fun_l4_n75()
+    fun_l5_n689
+end
+
+def fun_l4_n76()
+    fun_l5_n803
+end
+
+def fun_l4_n77()
+    fun_l5_n222
+end
+
+def fun_l4_n78()
+    fun_l5_n696
+end
+
+def fun_l4_n79()
+    fun_l5_n457
+end
+
+def fun_l4_n80()
+    fun_l5_n794
+end
+
+def fun_l4_n81()
+    fun_l5_n886
+end
+
+def fun_l4_n82()
+    fun_l5_n742
+end
+
+def fun_l4_n83()
+    fun_l5_n560
+end
+
+def fun_l4_n84()
+    fun_l5_n207
+end
+
+def fun_l4_n85()
+    fun_l5_n265
+end
+
+def fun_l4_n86()
+    fun_l5_n871
+end
+
+def fun_l4_n87()
+    fun_l5_n113
+end
+
+def fun_l4_n88()
+    fun_l5_n141
+end
+
+def fun_l4_n89()
+    fun_l5_n231
+end
+
+def fun_l4_n90()
+    fun_l5_n980
+end
+
+def fun_l4_n91()
+    fun_l5_n586
+end
+
+def fun_l4_n92()
+    fun_l5_n961
+end
+
+def fun_l4_n93()
+    fun_l5_n128
+end
+
+def fun_l4_n94()
+    fun_l5_n395
+end
+
+def fun_l4_n95()
+    fun_l5_n810
+end
+
+def fun_l4_n96()
+    fun_l5_n337
+end
+
+def fun_l4_n97()
+    fun_l5_n256
+end
+
+def fun_l4_n98()
+    fun_l5_n188
+end
+
+def fun_l4_n99()
+    fun_l5_n358
+end
+
+def fun_l4_n100()
+    fun_l5_n751
+end
+
+def fun_l4_n101()
+    fun_l5_n898
+end
+
+def fun_l4_n102()
+    fun_l5_n323
+end
+
+def fun_l4_n103()
+    fun_l5_n455
+end
+
+def fun_l4_n104()
+    fun_l5_n976
+end
+
+def fun_l4_n105()
+    fun_l5_n962
+end
+
+def fun_l4_n106()
+    fun_l5_n781
+end
+
+def fun_l4_n107()
+    fun_l5_n277
+end
+
+def fun_l4_n108()
+    fun_l5_n146
+end
+
+def fun_l4_n109()
+    fun_l5_n793
+end
+
+def fun_l4_n110()
+    fun_l5_n787
+end
+
+def fun_l4_n111()
+    fun_l5_n597
+end
+
+def fun_l4_n112()
+    fun_l5_n799
+end
+
+def fun_l4_n113()
+    fun_l5_n598
+end
+
+def fun_l4_n114()
+    fun_l5_n456
+end
+
+def fun_l4_n115()
+    fun_l5_n45
+end
+
+def fun_l4_n116()
+    fun_l5_n265
+end
+
+def fun_l4_n117()
+    fun_l5_n661
+end
+
+def fun_l4_n118()
+    fun_l5_n657
+end
+
+def fun_l4_n119()
+    fun_l5_n703
+end
+
+def fun_l4_n120()
+    fun_l5_n164
+end
+
+def fun_l4_n121()
+    fun_l5_n182
+end
+
+def fun_l4_n122()
+    fun_l5_n605
+end
+
+def fun_l4_n123()
+    fun_l5_n237
+end
+
+def fun_l4_n124()
+    fun_l5_n582
+end
+
+def fun_l4_n125()
+    fun_l5_n381
+end
+
+def fun_l4_n126()
+    fun_l5_n244
+end
+
+def fun_l4_n127()
+    fun_l5_n272
+end
+
+def fun_l4_n128()
+    fun_l5_n989
+end
+
+def fun_l4_n129()
+    fun_l5_n366
+end
+
+def fun_l4_n130()
+    fun_l5_n640
+end
+
+def fun_l4_n131()
+    fun_l5_n953
+end
+
+def fun_l4_n132()
+    fun_l5_n990
+end
+
+def fun_l4_n133()
+    fun_l5_n497
+end
+
+def fun_l4_n134()
+    fun_l5_n12
+end
+
+def fun_l4_n135()
+    fun_l5_n993
+end
+
+def fun_l4_n136()
+    fun_l5_n802
+end
+
+def fun_l4_n137()
+    fun_l5_n411
+end
+
+def fun_l4_n138()
+    fun_l5_n154
+end
+
+def fun_l4_n139()
+    fun_l5_n924
+end
+
+def fun_l4_n140()
+    fun_l5_n772
+end
+
+def fun_l4_n141()
+    fun_l5_n972
+end
+
+def fun_l4_n142()
+    fun_l5_n847
+end
+
+def fun_l4_n143()
+    fun_l5_n481
+end
+
+def fun_l4_n144()
+    fun_l5_n52
+end
+
+def fun_l4_n145()
+    fun_l5_n451
+end
+
+def fun_l4_n146()
+    fun_l5_n339
+end
+
+def fun_l4_n147()
+    fun_l5_n531
+end
+
+def fun_l4_n148()
+    fun_l5_n735
+end
+
+def fun_l4_n149()
+    fun_l5_n747
+end
+
+def fun_l4_n150()
+    fun_l5_n750
+end
+
+def fun_l4_n151()
+    fun_l5_n762
+end
+
+def fun_l4_n152()
+    fun_l5_n131
+end
+
+def fun_l4_n153()
+    fun_l5_n532
+end
+
+def fun_l4_n154()
+    fun_l5_n398
+end
+
+def fun_l4_n155()
+    fun_l5_n660
+end
+
+def fun_l4_n156()
+    fun_l5_n374
+end
+
+def fun_l4_n157()
+    fun_l5_n245
+end
+
+def fun_l4_n158()
+    fun_l5_n850
+end
+
+def fun_l4_n159()
+    fun_l5_n518
+end
+
+def fun_l4_n160()
+    fun_l5_n607
+end
+
+def fun_l4_n161()
+    fun_l5_n823
+end
+
+def fun_l4_n162()
+    fun_l5_n816
+end
+
+def fun_l4_n163()
+    fun_l5_n735
+end
+
+def fun_l4_n164()
+    fun_l5_n802
+end
+
+def fun_l4_n165()
+    fun_l5_n398
+end
+
+def fun_l4_n166()
+    fun_l5_n149
+end
+
+def fun_l4_n167()
+    fun_l5_n292
+end
+
+def fun_l4_n168()
+    fun_l5_n733
+end
+
+def fun_l4_n169()
+    fun_l5_n145
+end
+
+def fun_l4_n170()
+    fun_l5_n288
+end
+
+def fun_l4_n171()
+    fun_l5_n131
+end
+
+def fun_l4_n172()
+    fun_l5_n31
+end
+
+def fun_l4_n173()
+    fun_l5_n253
+end
+
+def fun_l4_n174()
+    fun_l5_n41
+end
+
+def fun_l4_n175()
+    fun_l5_n403
+end
+
+def fun_l4_n176()
+    fun_l5_n859
+end
+
+def fun_l4_n177()
+    fun_l5_n804
+end
+
+def fun_l4_n178()
+    fun_l5_n26
+end
+
+def fun_l4_n179()
+    fun_l5_n729
+end
+
+def fun_l4_n180()
+    fun_l5_n978
+end
+
+def fun_l4_n181()
+    fun_l5_n42
+end
+
+def fun_l4_n182()
+    fun_l5_n38
+end
+
+def fun_l4_n183()
+    fun_l5_n758
+end
+
+def fun_l4_n184()
+    fun_l5_n885
+end
+
+def fun_l4_n185()
+    fun_l5_n473
+end
+
+def fun_l4_n186()
+    fun_l5_n737
+end
+
+def fun_l4_n187()
+    fun_l5_n889
+end
+
+def fun_l4_n188()
+    fun_l5_n398
+end
+
+def fun_l4_n189()
+    fun_l5_n72
+end
+
+def fun_l4_n190()
+    fun_l5_n725
+end
+
+def fun_l4_n191()
+    fun_l5_n774
+end
+
+def fun_l4_n192()
+    fun_l5_n453
+end
+
+def fun_l4_n193()
+    fun_l5_n370
+end
+
+def fun_l4_n194()
+    fun_l5_n648
+end
+
+def fun_l4_n195()
+    fun_l5_n882
+end
+
+def fun_l4_n196()
+    fun_l5_n745
+end
+
+def fun_l4_n197()
+    fun_l5_n529
+end
+
+def fun_l4_n198()
+    fun_l5_n957
+end
+
+def fun_l4_n199()
+    fun_l5_n423
+end
+
+def fun_l4_n200()
+    fun_l5_n399
+end
+
+def fun_l4_n201()
+    fun_l5_n917
+end
+
+def fun_l4_n202()
+    fun_l5_n634
+end
+
+def fun_l4_n203()
+    fun_l5_n868
+end
+
+def fun_l4_n204()
+    fun_l5_n627
+end
+
+def fun_l4_n205()
+    fun_l5_n514
+end
+
+def fun_l4_n206()
+    fun_l5_n61
+end
+
+def fun_l4_n207()
+    fun_l5_n848
+end
+
+def fun_l4_n208()
+    fun_l5_n611
+end
+
+def fun_l4_n209()
+    fun_l5_n417
+end
+
+def fun_l4_n210()
+    fun_l5_n423
+end
+
+def fun_l4_n211()
+    fun_l5_n247
+end
+
+def fun_l4_n212()
+    fun_l5_n208
+end
+
+def fun_l4_n213()
+    fun_l5_n253
+end
+
+def fun_l4_n214()
+    fun_l5_n833
+end
+
+def fun_l4_n215()
+    fun_l5_n351
+end
+
+def fun_l4_n216()
+    fun_l5_n326
+end
+
+def fun_l4_n217()
+    fun_l5_n741
+end
+
+def fun_l4_n218()
+    fun_l5_n958
+end
+
+def fun_l4_n219()
+    fun_l5_n347
+end
+
+def fun_l4_n220()
+    fun_l5_n317
+end
+
+def fun_l4_n221()
+    fun_l5_n291
+end
+
+def fun_l4_n222()
+    fun_l5_n863
+end
+
+def fun_l4_n223()
+    fun_l5_n30
+end
+
+def fun_l4_n224()
+    fun_l5_n413
+end
+
+def fun_l4_n225()
+    fun_l5_n352
+end
+
+def fun_l4_n226()
+    fun_l5_n125
+end
+
+def fun_l4_n227()
+    fun_l5_n266
+end
+
+def fun_l4_n228()
+    fun_l5_n264
+end
+
+def fun_l4_n229()
+    fun_l5_n745
+end
+
+def fun_l4_n230()
+    fun_l5_n622
+end
+
+def fun_l4_n231()
+    fun_l5_n160
+end
+
+def fun_l4_n232()
+    fun_l5_n121
+end
+
+def fun_l4_n233()
+    fun_l5_n150
+end
+
+def fun_l4_n234()
+    fun_l5_n495
+end
+
+def fun_l4_n235()
+    fun_l5_n905
+end
+
+def fun_l4_n236()
+    fun_l5_n886
+end
+
+def fun_l4_n237()
+    fun_l5_n221
+end
+
+def fun_l4_n238()
+    fun_l5_n912
+end
+
+def fun_l4_n239()
+    fun_l5_n834
+end
+
+def fun_l4_n240()
+    fun_l5_n703
+end
+
+def fun_l4_n241()
+    fun_l5_n651
+end
+
+def fun_l4_n242()
+    fun_l5_n404
+end
+
+def fun_l4_n243()
+    fun_l5_n213
+end
+
+def fun_l4_n244()
+    fun_l5_n342
+end
+
+def fun_l4_n245()
+    fun_l5_n887
+end
+
+def fun_l4_n246()
+    fun_l5_n69
+end
+
+def fun_l4_n247()
+    fun_l5_n835
+end
+
+def fun_l4_n248()
+    fun_l5_n856
+end
+
+def fun_l4_n249()
+    fun_l5_n485
+end
+
+def fun_l4_n250()
+    fun_l5_n441
+end
+
+def fun_l4_n251()
+    fun_l5_n976
+end
+
+def fun_l4_n252()
+    fun_l5_n586
+end
+
+def fun_l4_n253()
+    fun_l5_n728
+end
+
+def fun_l4_n254()
+    fun_l5_n377
+end
+
+def fun_l4_n255()
+    fun_l5_n293
+end
+
+def fun_l4_n256()
+    fun_l5_n149
+end
+
+def fun_l4_n257()
+    fun_l5_n205
+end
+
+def fun_l4_n258()
+    fun_l5_n301
+end
+
+def fun_l4_n259()
+    fun_l5_n528
+end
+
+def fun_l4_n260()
+    fun_l5_n642
+end
+
+def fun_l4_n261()
+    fun_l5_n430
+end
+
+def fun_l4_n262()
+    fun_l5_n14
+end
+
+def fun_l4_n263()
+    fun_l5_n796
+end
+
+def fun_l4_n264()
+    fun_l5_n849
+end
+
+def fun_l4_n265()
+    fun_l5_n547
+end
+
+def fun_l4_n266()
+    fun_l5_n946
+end
+
+def fun_l4_n267()
+    fun_l5_n131
+end
+
+def fun_l4_n268()
+    fun_l5_n141
+end
+
+def fun_l4_n269()
+    fun_l5_n9
+end
+
+def fun_l4_n270()
+    fun_l5_n884
+end
+
+def fun_l4_n271()
+    fun_l5_n978
+end
+
+def fun_l4_n272()
+    fun_l5_n47
+end
+
+def fun_l4_n273()
+    fun_l5_n100
+end
+
+def fun_l4_n274()
+    fun_l5_n254
+end
+
+def fun_l4_n275()
+    fun_l5_n972
+end
+
+def fun_l4_n276()
+    fun_l5_n705
+end
+
+def fun_l4_n277()
+    fun_l5_n504
+end
+
+def fun_l4_n278()
+    fun_l5_n854
+end
+
+def fun_l4_n279()
+    fun_l5_n331
+end
+
+def fun_l4_n280()
+    fun_l5_n394
+end
+
+def fun_l4_n281()
+    fun_l5_n922
+end
+
+def fun_l4_n282()
+    fun_l5_n503
+end
+
+def fun_l4_n283()
+    fun_l5_n854
+end
+
+def fun_l4_n284()
+    fun_l5_n679
+end
+
+def fun_l4_n285()
+    fun_l5_n317
+end
+
+def fun_l4_n286()
+    fun_l5_n753
+end
+
+def fun_l4_n287()
+    fun_l5_n154
+end
+
+def fun_l4_n288()
+    fun_l5_n184
+end
+
+def fun_l4_n289()
+    fun_l5_n416
+end
+
+def fun_l4_n290()
+    fun_l5_n426
+end
+
+def fun_l4_n291()
+    fun_l5_n186
+end
+
+def fun_l4_n292()
+    fun_l5_n527
+end
+
+def fun_l4_n293()
+    fun_l5_n483
+end
+
+def fun_l4_n294()
+    fun_l5_n718
+end
+
+def fun_l4_n295()
+    fun_l5_n469
+end
+
+def fun_l4_n296()
+    fun_l5_n842
+end
+
+def fun_l4_n297()
+    fun_l5_n998
+end
+
+def fun_l4_n298()
+    fun_l5_n964
+end
+
+def fun_l4_n299()
+    fun_l5_n377
+end
+
+def fun_l4_n300()
+    fun_l5_n9
+end
+
+def fun_l4_n301()
+    fun_l5_n234
+end
+
+def fun_l4_n302()
+    fun_l5_n813
+end
+
+def fun_l4_n303()
+    fun_l5_n211
+end
+
+def fun_l4_n304()
+    fun_l5_n593
+end
+
+def fun_l4_n305()
+    fun_l5_n847
+end
+
+def fun_l4_n306()
+    fun_l5_n628
+end
+
+def fun_l4_n307()
+    fun_l5_n827
+end
+
+def fun_l4_n308()
+    fun_l5_n417
+end
+
+def fun_l4_n309()
+    fun_l5_n958
+end
+
+def fun_l4_n310()
+    fun_l5_n838
+end
+
+def fun_l4_n311()
+    fun_l5_n712
+end
+
+def fun_l4_n312()
+    fun_l5_n615
+end
+
+def fun_l4_n313()
+    fun_l5_n693
+end
+
+def fun_l4_n314()
+    fun_l5_n708
+end
+
+def fun_l4_n315()
+    fun_l5_n525
+end
+
+def fun_l4_n316()
+    fun_l5_n943
+end
+
+def fun_l4_n317()
+    fun_l5_n959
+end
+
+def fun_l4_n318()
+    fun_l5_n316
+end
+
+def fun_l4_n319()
+    fun_l5_n424
+end
+
+def fun_l4_n320()
+    fun_l5_n391
+end
+
+def fun_l4_n321()
+    fun_l5_n303
+end
+
+def fun_l4_n322()
+    fun_l5_n159
+end
+
+def fun_l4_n323()
+    fun_l5_n853
+end
+
+def fun_l4_n324()
+    fun_l5_n525
+end
+
+def fun_l4_n325()
+    fun_l5_n390
+end
+
+def fun_l4_n326()
+    fun_l5_n225
+end
+
+def fun_l4_n327()
+    fun_l5_n983
+end
+
+def fun_l4_n328()
+    fun_l5_n509
+end
+
+def fun_l4_n329()
+    fun_l5_n141
+end
+
+def fun_l4_n330()
+    fun_l5_n92
+end
+
+def fun_l4_n331()
+    fun_l5_n288
+end
+
+def fun_l4_n332()
+    fun_l5_n213
+end
+
+def fun_l4_n333()
+    fun_l5_n830
+end
+
+def fun_l4_n334()
+    fun_l5_n512
+end
+
+def fun_l4_n335()
+    fun_l5_n449
+end
+
+def fun_l4_n336()
+    fun_l5_n148
+end
+
+def fun_l4_n337()
+    fun_l5_n829
+end
+
+def fun_l4_n338()
+    fun_l5_n232
+end
+
+def fun_l4_n339()
+    fun_l5_n989
+end
+
+def fun_l4_n340()
+    fun_l5_n226
+end
+
+def fun_l4_n341()
+    fun_l5_n187
+end
+
+def fun_l4_n342()
+    fun_l5_n874
+end
+
+def fun_l4_n343()
+    fun_l5_n621
+end
+
+def fun_l4_n344()
+    fun_l5_n861
+end
+
+def fun_l4_n345()
+    fun_l5_n22
+end
+
+def fun_l4_n346()
+    fun_l5_n6
+end
+
+def fun_l4_n347()
+    fun_l5_n580
+end
+
+def fun_l4_n348()
+    fun_l5_n56
+end
+
+def fun_l4_n349()
+    fun_l5_n834
+end
+
+def fun_l4_n350()
+    fun_l5_n460
+end
+
+def fun_l4_n351()
+    fun_l5_n697
+end
+
+def fun_l4_n352()
+    fun_l5_n792
+end
+
+def fun_l4_n353()
+    fun_l5_n777
+end
+
+def fun_l4_n354()
+    fun_l5_n73
+end
+
+def fun_l4_n355()
+    fun_l5_n555
+end
+
+def fun_l4_n356()
+    fun_l5_n32
+end
+
+def fun_l4_n357()
+    fun_l5_n242
+end
+
+def fun_l4_n358()
+    fun_l5_n791
+end
+
+def fun_l4_n359()
+    fun_l5_n570
+end
+
+def fun_l4_n360()
+    fun_l5_n272
+end
+
+def fun_l4_n361()
+    fun_l5_n757
+end
+
+def fun_l4_n362()
+    fun_l5_n946
+end
+
+def fun_l4_n363()
+    fun_l5_n127
+end
+
+def fun_l4_n364()
+    fun_l5_n940
+end
+
+def fun_l4_n365()
+    fun_l5_n662
+end
+
+def fun_l4_n366()
+    fun_l5_n99
+end
+
+def fun_l4_n367()
+    fun_l5_n107
+end
+
+def fun_l4_n368()
+    fun_l5_n370
+end
+
+def fun_l4_n369()
+    fun_l5_n738
+end
+
+def fun_l4_n370()
+    fun_l5_n346
+end
+
+def fun_l4_n371()
+    fun_l5_n63
+end
+
+def fun_l4_n372()
+    fun_l5_n274
+end
+
+def fun_l4_n373()
+    fun_l5_n936
+end
+
+def fun_l4_n374()
+    fun_l5_n602
+end
+
+def fun_l4_n375()
+    fun_l5_n362
+end
+
+def fun_l4_n376()
+    fun_l5_n605
+end
+
+def fun_l4_n377()
+    fun_l5_n477
+end
+
+def fun_l4_n378()
+    fun_l5_n349
+end
+
+def fun_l4_n379()
+    fun_l5_n241
+end
+
+def fun_l4_n380()
+    fun_l5_n913
+end
+
+def fun_l4_n381()
+    fun_l5_n392
+end
+
+def fun_l4_n382()
+    fun_l5_n669
+end
+
+def fun_l4_n383()
+    fun_l5_n41
+end
+
+def fun_l4_n384()
+    fun_l5_n928
+end
+
+def fun_l4_n385()
+    fun_l5_n646
+end
+
+def fun_l4_n386()
+    fun_l5_n23
+end
+
+def fun_l4_n387()
+    fun_l5_n815
+end
+
+def fun_l4_n388()
+    fun_l5_n595
+end
+
+def fun_l4_n389()
+    fun_l5_n210
+end
+
+def fun_l4_n390()
+    fun_l5_n247
+end
+
+def fun_l4_n391()
+    fun_l5_n914
+end
+
+def fun_l4_n392()
+    fun_l5_n882
+end
+
+def fun_l4_n393()
+    fun_l5_n319
+end
+
+def fun_l4_n394()
+    fun_l5_n764
+end
+
+def fun_l4_n395()
+    fun_l5_n282
+end
+
+def fun_l4_n396()
+    fun_l5_n585
+end
+
+def fun_l4_n397()
+    fun_l5_n551
+end
+
+def fun_l4_n398()
+    fun_l5_n56
+end
+
+def fun_l4_n399()
+    fun_l5_n807
+end
+
+def fun_l4_n400()
+    fun_l5_n678
+end
+
+def fun_l4_n401()
+    fun_l5_n153
+end
+
+def fun_l4_n402()
+    fun_l5_n993
+end
+
+def fun_l4_n403()
+    fun_l5_n835
+end
+
+def fun_l4_n404()
+    fun_l5_n642
+end
+
+def fun_l4_n405()
+    fun_l5_n460
+end
+
+def fun_l4_n406()
+    fun_l5_n135
+end
+
+def fun_l4_n407()
+    fun_l5_n199
+end
+
+def fun_l4_n408()
+    fun_l5_n782
+end
+
+def fun_l4_n409()
+    fun_l5_n723
+end
+
+def fun_l4_n410()
+    fun_l5_n638
+end
+
+def fun_l4_n411()
+    fun_l5_n157
+end
+
+def fun_l4_n412()
+    fun_l5_n840
+end
+
+def fun_l4_n413()
+    fun_l5_n11
+end
+
+def fun_l4_n414()
+    fun_l5_n148
+end
+
+def fun_l4_n415()
+    fun_l5_n577
+end
+
+def fun_l4_n416()
+    fun_l5_n403
+end
+
+def fun_l4_n417()
+    fun_l5_n971
+end
+
+def fun_l4_n418()
+    fun_l5_n951
+end
+
+def fun_l4_n419()
+    fun_l5_n620
+end
+
+def fun_l4_n420()
+    fun_l5_n120
+end
+
+def fun_l4_n421()
+    fun_l5_n981
+end
+
+def fun_l4_n422()
+    fun_l5_n543
+end
+
+def fun_l4_n423()
+    fun_l5_n543
+end
+
+def fun_l4_n424()
+    fun_l5_n161
+end
+
+def fun_l4_n425()
+    fun_l5_n308
+end
+
+def fun_l4_n426()
+    fun_l5_n94
+end
+
+def fun_l4_n427()
+    fun_l5_n209
+end
+
+def fun_l4_n428()
+    fun_l5_n543
+end
+
+def fun_l4_n429()
+    fun_l5_n825
+end
+
+def fun_l4_n430()
+    fun_l5_n808
+end
+
+def fun_l4_n431()
+    fun_l5_n315
+end
+
+def fun_l4_n432()
+    fun_l5_n846
+end
+
+def fun_l4_n433()
+    fun_l5_n448
+end
+
+def fun_l4_n434()
+    fun_l5_n903
+end
+
+def fun_l4_n435()
+    fun_l5_n933
+end
+
+def fun_l4_n436()
+    fun_l5_n872
+end
+
+def fun_l4_n437()
+    fun_l5_n297
+end
+
+def fun_l4_n438()
+    fun_l5_n689
+end
+
+def fun_l4_n439()
+    fun_l5_n700
+end
+
+def fun_l4_n440()
+    fun_l5_n316
+end
+
+def fun_l4_n441()
+    fun_l5_n983
+end
+
+def fun_l4_n442()
+    fun_l5_n32
+end
+
+def fun_l4_n443()
+    fun_l5_n404
+end
+
+def fun_l4_n444()
+    fun_l5_n770
+end
+
+def fun_l4_n445()
+    fun_l5_n497
+end
+
+def fun_l4_n446()
+    fun_l5_n762
+end
+
+def fun_l4_n447()
+    fun_l5_n402
+end
+
+def fun_l4_n448()
+    fun_l5_n773
+end
+
+def fun_l4_n449()
+    fun_l5_n264
+end
+
+def fun_l4_n450()
+    fun_l5_n373
+end
+
+def fun_l4_n451()
+    fun_l5_n907
+end
+
+def fun_l4_n452()
+    fun_l5_n477
+end
+
+def fun_l4_n453()
+    fun_l5_n15
+end
+
+def fun_l4_n454()
+    fun_l5_n550
+end
+
+def fun_l4_n455()
+    fun_l5_n973
+end
+
+def fun_l4_n456()
+    fun_l5_n247
+end
+
+def fun_l4_n457()
+    fun_l5_n231
+end
+
+def fun_l4_n458()
+    fun_l5_n431
+end
+
+def fun_l4_n459()
+    fun_l5_n549
+end
+
+def fun_l4_n460()
+    fun_l5_n251
+end
+
+def fun_l4_n461()
+    fun_l5_n313
+end
+
+def fun_l4_n462()
+    fun_l5_n826
+end
+
+def fun_l4_n463()
+    fun_l5_n454
+end
+
+def fun_l4_n464()
+    fun_l5_n329
+end
+
+def fun_l4_n465()
+    fun_l5_n502
+end
+
+def fun_l4_n466()
+    fun_l5_n786
+end
+
+def fun_l4_n467()
+    fun_l5_n195
+end
+
+def fun_l4_n468()
+    fun_l5_n710
+end
+
+def fun_l4_n469()
+    fun_l5_n970
+end
+
+def fun_l4_n470()
+    fun_l5_n925
+end
+
+def fun_l4_n471()
+    fun_l5_n420
+end
+
+def fun_l4_n472()
+    fun_l5_n231
+end
+
+def fun_l4_n473()
+    fun_l5_n867
+end
+
+def fun_l4_n474()
+    fun_l5_n798
+end
+
+def fun_l4_n475()
+    fun_l5_n697
+end
+
+def fun_l4_n476()
+    fun_l5_n767
+end
+
+def fun_l4_n477()
+    fun_l5_n199
+end
+
+def fun_l4_n478()
+    fun_l5_n190
+end
+
+def fun_l4_n479()
+    fun_l5_n524
+end
+
+def fun_l4_n480()
+    fun_l5_n451
+end
+
+def fun_l4_n481()
+    fun_l5_n182
+end
+
+def fun_l4_n482()
+    fun_l5_n906
+end
+
+def fun_l4_n483()
+    fun_l5_n806
+end
+
+def fun_l4_n484()
+    fun_l5_n871
+end
+
+def fun_l4_n485()
+    fun_l5_n947
+end
+
+def fun_l4_n486()
+    fun_l5_n599
+end
+
+def fun_l4_n487()
+    fun_l5_n266
+end
+
+def fun_l4_n488()
+    fun_l5_n20
+end
+
+def fun_l4_n489()
+    fun_l5_n875
+end
+
+def fun_l4_n490()
+    fun_l5_n393
+end
+
+def fun_l4_n491()
+    fun_l5_n673
+end
+
+def fun_l4_n492()
+    fun_l5_n159
+end
+
+def fun_l4_n493()
+    fun_l5_n327
+end
+
+def fun_l4_n494()
+    fun_l5_n71
+end
+
+def fun_l4_n495()
+    fun_l5_n146
+end
+
+def fun_l4_n496()
+    fun_l5_n372
+end
+
+def fun_l4_n497()
+    fun_l5_n654
+end
+
+def fun_l4_n498()
+    fun_l5_n1
+end
+
+def fun_l4_n499()
+    fun_l5_n448
+end
+
+def fun_l4_n500()
+    fun_l5_n684
+end
+
+def fun_l4_n501()
+    fun_l5_n561
+end
+
+def fun_l4_n502()
+    fun_l5_n47
+end
+
+def fun_l4_n503()
+    fun_l5_n313
+end
+
+def fun_l4_n504()
+    fun_l5_n380
+end
+
+def fun_l4_n505()
+    fun_l5_n416
+end
+
+def fun_l4_n506()
+    fun_l5_n90
+end
+
+def fun_l4_n507()
+    fun_l5_n65
+end
+
+def fun_l4_n508()
+    fun_l5_n61
+end
+
+def fun_l4_n509()
+    fun_l5_n451
+end
+
+def fun_l4_n510()
+    fun_l5_n174
+end
+
+def fun_l4_n511()
+    fun_l5_n236
+end
+
+def fun_l4_n512()
+    fun_l5_n470
+end
+
+def fun_l4_n513()
+    fun_l5_n304
+end
+
+def fun_l4_n514()
+    fun_l5_n146
+end
+
+def fun_l4_n515()
+    fun_l5_n671
+end
+
+def fun_l4_n516()
+    fun_l5_n626
+end
+
+def fun_l4_n517()
+    fun_l5_n164
+end
+
+def fun_l4_n518()
+    fun_l5_n308
+end
+
+def fun_l4_n519()
+    fun_l5_n799
+end
+
+def fun_l4_n520()
+    fun_l5_n521
+end
+
+def fun_l4_n521()
+    fun_l5_n675
+end
+
+def fun_l4_n522()
+    fun_l5_n110
+end
+
+def fun_l4_n523()
+    fun_l5_n726
+end
+
+def fun_l4_n524()
+    fun_l5_n189
+end
+
+def fun_l4_n525()
+    fun_l5_n303
+end
+
+def fun_l4_n526()
+    fun_l5_n571
+end
+
+def fun_l4_n527()
+    fun_l5_n693
+end
+
+def fun_l4_n528()
+    fun_l5_n782
+end
+
+def fun_l4_n529()
+    fun_l5_n764
+end
+
+def fun_l4_n530()
+    fun_l5_n629
+end
+
+def fun_l4_n531()
+    fun_l5_n677
+end
+
+def fun_l4_n532()
+    fun_l5_n745
+end
+
+def fun_l4_n533()
+    fun_l5_n868
+end
+
+def fun_l4_n534()
+    fun_l5_n771
+end
+
+def fun_l4_n535()
+    fun_l5_n248
+end
+
+def fun_l4_n536()
+    fun_l5_n412
+end
+
+def fun_l4_n537()
+    fun_l5_n736
+end
+
+def fun_l4_n538()
+    fun_l5_n296
+end
+
+def fun_l4_n539()
+    fun_l5_n847
+end
+
+def fun_l4_n540()
+    fun_l5_n188
+end
+
+def fun_l4_n541()
+    fun_l5_n131
+end
+
+def fun_l4_n542()
+    fun_l5_n31
+end
+
+def fun_l4_n543()
+    fun_l5_n563
+end
+
+def fun_l4_n544()
+    fun_l5_n479
+end
+
+def fun_l4_n545()
+    fun_l5_n243
+end
+
+def fun_l4_n546()
+    fun_l5_n471
+end
+
+def fun_l4_n547()
+    fun_l5_n237
+end
+
+def fun_l4_n548()
+    fun_l5_n772
+end
+
+def fun_l4_n549()
+    fun_l5_n723
+end
+
+def fun_l4_n550()
+    fun_l5_n733
+end
+
+def fun_l4_n551()
+    fun_l5_n274
+end
+
+def fun_l4_n552()
+    fun_l5_n351
+end
+
+def fun_l4_n553()
+    fun_l5_n30
+end
+
+def fun_l4_n554()
+    fun_l5_n112
+end
+
+def fun_l4_n555()
+    fun_l5_n438
+end
+
+def fun_l4_n556()
+    fun_l5_n969
+end
+
+def fun_l4_n557()
+    fun_l5_n57
+end
+
+def fun_l4_n558()
+    fun_l5_n971
+end
+
+def fun_l4_n559()
+    fun_l5_n831
+end
+
+def fun_l4_n560()
+    fun_l5_n833
+end
+
+def fun_l4_n561()
+    fun_l5_n896
+end
+
+def fun_l4_n562()
+    fun_l5_n607
+end
+
+def fun_l4_n563()
+    fun_l5_n793
+end
+
+def fun_l4_n564()
+    fun_l5_n711
+end
+
+def fun_l4_n565()
+    fun_l5_n570
+end
+
+def fun_l4_n566()
+    fun_l5_n933
+end
+
+def fun_l4_n567()
+    fun_l5_n917
+end
+
+def fun_l4_n568()
+    fun_l5_n811
+end
+
+def fun_l4_n569()
+    fun_l5_n414
+end
+
+def fun_l4_n570()
+    fun_l5_n14
+end
+
+def fun_l4_n571()
+    fun_l5_n911
+end
+
+def fun_l4_n572()
+    fun_l5_n114
+end
+
+def fun_l4_n573()
+    fun_l5_n732
+end
+
+def fun_l4_n574()
+    fun_l5_n913
+end
+
+def fun_l4_n575()
+    fun_l5_n66
+end
+
+def fun_l4_n576()
+    fun_l5_n330
+end
+
+def fun_l4_n577()
+    fun_l5_n892
+end
+
+def fun_l4_n578()
+    fun_l5_n329
+end
+
+def fun_l4_n579()
+    fun_l5_n539
+end
+
+def fun_l4_n580()
+    fun_l5_n268
+end
+
+def fun_l4_n581()
+    fun_l5_n357
+end
+
+def fun_l4_n582()
+    fun_l5_n259
+end
+
+def fun_l4_n583()
+    fun_l5_n968
+end
+
+def fun_l4_n584()
+    fun_l5_n873
+end
+
+def fun_l4_n585()
+    fun_l5_n644
+end
+
+def fun_l4_n586()
+    fun_l5_n659
+end
+
+def fun_l4_n587()
+    fun_l5_n906
+end
+
+def fun_l4_n588()
+    fun_l5_n746
+end
+
+def fun_l4_n589()
+    fun_l5_n802
+end
+
+def fun_l4_n590()
+    fun_l5_n9
+end
+
+def fun_l4_n591()
+    fun_l5_n620
+end
+
+def fun_l4_n592()
+    fun_l5_n507
+end
+
+def fun_l4_n593()
+    fun_l5_n338
+end
+
+def fun_l4_n594()
+    fun_l5_n396
+end
+
+def fun_l4_n595()
+    fun_l5_n627
+end
+
+def fun_l4_n596()
+    fun_l5_n621
+end
+
+def fun_l4_n597()
+    fun_l5_n597
+end
+
+def fun_l4_n598()
+    fun_l5_n496
+end
+
+def fun_l4_n599()
+    fun_l5_n265
+end
+
+def fun_l4_n600()
+    fun_l5_n897
+end
+
+def fun_l4_n601()
+    fun_l5_n142
+end
+
+def fun_l4_n602()
+    fun_l5_n614
+end
+
+def fun_l4_n603()
+    fun_l5_n565
+end
+
+def fun_l4_n604()
+    fun_l5_n653
+end
+
+def fun_l4_n605()
+    fun_l5_n728
+end
+
+def fun_l4_n606()
+    fun_l5_n799
+end
+
+def fun_l4_n607()
+    fun_l5_n714
+end
+
+def fun_l4_n608()
+    fun_l5_n448
+end
+
+def fun_l4_n609()
+    fun_l5_n778
+end
+
+def fun_l4_n610()
+    fun_l5_n508
+end
+
+def fun_l4_n611()
+    fun_l5_n216
+end
+
+def fun_l4_n612()
+    fun_l5_n604
+end
+
+def fun_l4_n613()
+    fun_l5_n231
+end
+
+def fun_l4_n614()
+    fun_l5_n696
+end
+
+def fun_l4_n615()
+    fun_l5_n354
+end
+
+def fun_l4_n616()
+    fun_l5_n595
+end
+
+def fun_l4_n617()
+    fun_l5_n747
+end
+
+def fun_l4_n618()
+    fun_l5_n377
+end
+
+def fun_l4_n619()
+    fun_l5_n852
+end
+
+def fun_l4_n620()
+    fun_l5_n381
+end
+
+def fun_l4_n621()
+    fun_l5_n674
+end
+
+def fun_l4_n622()
+    fun_l5_n696
+end
+
+def fun_l4_n623()
+    fun_l5_n25
+end
+
+def fun_l4_n624()
+    fun_l5_n133
+end
+
+def fun_l4_n625()
+    fun_l5_n419
+end
+
+def fun_l4_n626()
+    fun_l5_n612
+end
+
+def fun_l4_n627()
+    fun_l5_n798
+end
+
+def fun_l4_n628()
+    fun_l5_n702
+end
+
+def fun_l4_n629()
+    fun_l5_n125
+end
+
+def fun_l4_n630()
+    fun_l5_n567
+end
+
+def fun_l4_n631()
+    fun_l5_n825
+end
+
+def fun_l4_n632()
+    fun_l5_n794
+end
+
+def fun_l4_n633()
+    fun_l5_n802
+end
+
+def fun_l4_n634()
+    fun_l5_n297
+end
+
+def fun_l4_n635()
+    fun_l5_n366
+end
+
+def fun_l4_n636()
+    fun_l5_n149
+end
+
+def fun_l4_n637()
+    fun_l5_n648
+end
+
+def fun_l4_n638()
+    fun_l5_n997
+end
+
+def fun_l4_n639()
+    fun_l5_n569
+end
+
+def fun_l4_n640()
+    fun_l5_n917
+end
+
+def fun_l4_n641()
+    fun_l5_n172
+end
+
+def fun_l4_n642()
+    fun_l5_n353
+end
+
+def fun_l4_n643()
+    fun_l5_n940
+end
+
+def fun_l4_n644()
+    fun_l5_n255
+end
+
+def fun_l4_n645()
+    fun_l5_n690
+end
+
+def fun_l4_n646()
+    fun_l5_n17
+end
+
+def fun_l4_n647()
+    fun_l5_n320
+end
+
+def fun_l4_n648()
+    fun_l5_n328
+end
+
+def fun_l4_n649()
+    fun_l5_n467
+end
+
+def fun_l4_n650()
+    fun_l5_n352
+end
+
+def fun_l4_n651()
+    fun_l5_n671
+end
+
+def fun_l4_n652()
+    fun_l5_n104
+end
+
+def fun_l4_n653()
+    fun_l5_n40
+end
+
+def fun_l4_n654()
+    fun_l5_n445
+end
+
+def fun_l4_n655()
+    fun_l5_n703
+end
+
+def fun_l4_n656()
+    fun_l5_n699
+end
+
+def fun_l4_n657()
+    fun_l5_n156
+end
+
+def fun_l4_n658()
+    fun_l5_n1
+end
+
+def fun_l4_n659()
+    fun_l5_n728
+end
+
+def fun_l4_n660()
+    fun_l5_n200
+end
+
+def fun_l4_n661()
+    fun_l5_n369
+end
+
+def fun_l4_n662()
+    fun_l5_n621
+end
+
+def fun_l4_n663()
+    fun_l5_n600
+end
+
+def fun_l4_n664()
+    fun_l5_n342
+end
+
+def fun_l4_n665()
+    fun_l5_n129
+end
+
+def fun_l4_n666()
+    fun_l5_n627
+end
+
+def fun_l4_n667()
+    fun_l5_n44
+end
+
+def fun_l4_n668()
+    fun_l5_n43
+end
+
+def fun_l4_n669()
+    fun_l5_n708
+end
+
+def fun_l4_n670()
+    fun_l5_n378
+end
+
+def fun_l4_n671()
+    fun_l5_n320
+end
+
+def fun_l4_n672()
+    fun_l5_n896
+end
+
+def fun_l4_n673()
+    fun_l5_n185
+end
+
+def fun_l4_n674()
+    fun_l5_n456
+end
+
+def fun_l4_n675()
+    fun_l5_n520
+end
+
+def fun_l4_n676()
+    fun_l5_n633
+end
+
+def fun_l4_n677()
+    fun_l5_n122
+end
+
+def fun_l4_n678()
+    fun_l5_n333
+end
+
+def fun_l4_n679()
+    fun_l5_n100
+end
+
+def fun_l4_n680()
+    fun_l5_n941
+end
+
+def fun_l4_n681()
+    fun_l5_n468
+end
+
+def fun_l4_n682()
+    fun_l5_n45
+end
+
+def fun_l4_n683()
+    fun_l5_n295
+end
+
+def fun_l4_n684()
+    fun_l5_n400
+end
+
+def fun_l4_n685()
+    fun_l5_n999
+end
+
+def fun_l4_n686()
+    fun_l5_n294
+end
+
+def fun_l4_n687()
+    fun_l5_n575
+end
+
+def fun_l4_n688()
+    fun_l5_n372
+end
+
+def fun_l4_n689()
+    fun_l5_n777
+end
+
+def fun_l4_n690()
+    fun_l5_n795
+end
+
+def fun_l4_n691()
+    fun_l5_n44
+end
+
+def fun_l4_n692()
+    fun_l5_n27
+end
+
+def fun_l4_n693()
+    fun_l5_n488
+end
+
+def fun_l4_n694()
+    fun_l5_n932
+end
+
+def fun_l4_n695()
+    fun_l5_n104
+end
+
+def fun_l4_n696()
+    fun_l5_n552
+end
+
+def fun_l4_n697()
+    fun_l5_n830
+end
+
+def fun_l4_n698()
+    fun_l5_n612
+end
+
+def fun_l4_n699()
+    fun_l5_n889
+end
+
+def fun_l4_n700()
+    fun_l5_n205
+end
+
+def fun_l4_n701()
+    fun_l5_n90
+end
+
+def fun_l4_n702()
+    fun_l5_n210
+end
+
+def fun_l4_n703()
+    fun_l5_n514
+end
+
+def fun_l4_n704()
+    fun_l5_n374
+end
+
+def fun_l4_n705()
+    fun_l5_n176
+end
+
+def fun_l4_n706()
+    fun_l5_n465
+end
+
+def fun_l4_n707()
+    fun_l5_n542
+end
+
+def fun_l4_n708()
+    fun_l5_n175
+end
+
+def fun_l4_n709()
+    fun_l5_n148
+end
+
+def fun_l4_n710()
+    fun_l5_n212
+end
+
+def fun_l4_n711()
+    fun_l5_n418
+end
+
+def fun_l4_n712()
+    fun_l5_n401
+end
+
+def fun_l4_n713()
+    fun_l5_n14
+end
+
+def fun_l4_n714()
+    fun_l5_n965
+end
+
+def fun_l4_n715()
+    fun_l5_n783
+end
+
+def fun_l4_n716()
+    fun_l5_n421
+end
+
+def fun_l4_n717()
+    fun_l5_n346
+end
+
+def fun_l4_n718()
+    fun_l5_n176
+end
+
+def fun_l4_n719()
+    fun_l5_n522
+end
+
+def fun_l4_n720()
+    fun_l5_n207
+end
+
+def fun_l4_n721()
+    fun_l5_n707
+end
+
+def fun_l4_n722()
+    fun_l5_n593
+end
+
+def fun_l4_n723()
+    fun_l5_n609
+end
+
+def fun_l4_n724()
+    fun_l5_n798
+end
+
+def fun_l4_n725()
+    fun_l5_n744
+end
+
+def fun_l4_n726()
+    fun_l5_n514
+end
+
+def fun_l4_n727()
+    fun_l5_n278
+end
+
+def fun_l4_n728()
+    fun_l5_n425
+end
+
+def fun_l4_n729()
+    fun_l5_n147
+end
+
+def fun_l4_n730()
+    fun_l5_n676
+end
+
+def fun_l4_n731()
+    fun_l5_n887
+end
+
+def fun_l4_n732()
+    fun_l5_n865
+end
+
+def fun_l4_n733()
+    fun_l5_n811
+end
+
+def fun_l4_n734()
+    fun_l5_n545
+end
+
+def fun_l4_n735()
+    fun_l5_n219
+end
+
+def fun_l4_n736()
+    fun_l5_n121
+end
+
+def fun_l4_n737()
+    fun_l5_n253
+end
+
+def fun_l4_n738()
+    fun_l5_n349
+end
+
+def fun_l4_n739()
+    fun_l5_n540
+end
+
+def fun_l4_n740()
+    fun_l5_n301
+end
+
+def fun_l4_n741()
+    fun_l5_n367
+end
+
+def fun_l4_n742()
+    fun_l5_n989
+end
+
+def fun_l4_n743()
+    fun_l5_n454
+end
+
+def fun_l4_n744()
+    fun_l5_n390
+end
+
+def fun_l4_n745()
+    fun_l5_n650
+end
+
+def fun_l4_n746()
+    fun_l5_n403
+end
+
+def fun_l4_n747()
+    fun_l5_n807
+end
+
+def fun_l4_n748()
+    fun_l5_n219
+end
+
+def fun_l4_n749()
+    fun_l5_n756
+end
+
+def fun_l4_n750()
+    fun_l5_n730
+end
+
+def fun_l4_n751()
+    fun_l5_n923
+end
+
+def fun_l4_n752()
+    fun_l5_n407
+end
+
+def fun_l4_n753()
+    fun_l5_n734
+end
+
+def fun_l4_n754()
+    fun_l5_n192
+end
+
+def fun_l4_n755()
+    fun_l5_n26
+end
+
+def fun_l4_n756()
+    fun_l5_n571
+end
+
+def fun_l4_n757()
+    fun_l5_n515
+end
+
+def fun_l4_n758()
+    fun_l5_n701
+end
+
+def fun_l4_n759()
+    fun_l5_n808
+end
+
+def fun_l4_n760()
+    fun_l5_n607
+end
+
+def fun_l4_n761()
+    fun_l5_n231
+end
+
+def fun_l4_n762()
+    fun_l5_n144
+end
+
+def fun_l4_n763()
+    fun_l5_n829
+end
+
+def fun_l4_n764()
+    fun_l5_n939
+end
+
+def fun_l4_n765()
+    fun_l5_n486
+end
+
+def fun_l4_n766()
+    fun_l5_n73
+end
+
+def fun_l4_n767()
+    fun_l5_n409
+end
+
+def fun_l4_n768()
+    fun_l5_n197
+end
+
+def fun_l4_n769()
+    fun_l5_n803
+end
+
+def fun_l4_n770()
+    fun_l5_n877
+end
+
+def fun_l4_n771()
+    fun_l5_n739
+end
+
+def fun_l4_n772()
+    fun_l5_n500
+end
+
+def fun_l4_n773()
+    fun_l5_n104
+end
+
+def fun_l4_n774()
+    fun_l5_n526
+end
+
+def fun_l4_n775()
+    fun_l5_n443
+end
+
+def fun_l4_n776()
+    fun_l5_n397
+end
+
+def fun_l4_n777()
+    fun_l5_n496
+end
+
+def fun_l4_n778()
+    fun_l5_n360
+end
+
+def fun_l4_n779()
+    fun_l5_n93
+end
+
+def fun_l4_n780()
+    fun_l5_n635
+end
+
+def fun_l4_n781()
+    fun_l5_n724
+end
+
+def fun_l4_n782()
+    fun_l5_n445
+end
+
+def fun_l4_n783()
+    fun_l5_n546
+end
+
+def fun_l4_n784()
+    fun_l5_n353
+end
+
+def fun_l4_n785()
+    fun_l5_n546
+end
+
+def fun_l4_n786()
+    fun_l5_n243
+end
+
+def fun_l4_n787()
+    fun_l5_n614
+end
+
+def fun_l4_n788()
+    fun_l5_n249
+end
+
+def fun_l4_n789()
+    fun_l5_n281
+end
+
+def fun_l4_n790()
+    fun_l5_n22
+end
+
+def fun_l4_n791()
+    fun_l5_n857
+end
+
+def fun_l4_n792()
+    fun_l5_n685
+end
+
+def fun_l4_n793()
+    fun_l5_n784
+end
+
+def fun_l4_n794()
+    fun_l5_n522
+end
+
+def fun_l4_n795()
+    fun_l5_n970
+end
+
+def fun_l4_n796()
+    fun_l5_n734
+end
+
+def fun_l4_n797()
+    fun_l5_n36
+end
+
+def fun_l4_n798()
+    fun_l5_n257
+end
+
+def fun_l4_n799()
+    fun_l5_n677
+end
+
+def fun_l4_n800()
+    fun_l5_n556
+end
+
+def fun_l4_n801()
+    fun_l5_n783
+end
+
+def fun_l4_n802()
+    fun_l5_n501
+end
+
+def fun_l4_n803()
+    fun_l5_n731
+end
+
+def fun_l4_n804()
+    fun_l5_n175
+end
+
+def fun_l4_n805()
+    fun_l5_n712
+end
+
+def fun_l4_n806()
+    fun_l5_n566
+end
+
+def fun_l4_n807()
+    fun_l5_n158
+end
+
+def fun_l4_n808()
+    fun_l5_n63
+end
+
+def fun_l4_n809()
+    fun_l5_n354
+end
+
+def fun_l4_n810()
+    fun_l5_n552
+end
+
+def fun_l4_n811()
+    fun_l5_n255
+end
+
+def fun_l4_n812()
+    fun_l5_n830
+end
+
+def fun_l4_n813()
+    fun_l5_n792
+end
+
+def fun_l4_n814()
+    fun_l5_n214
+end
+
+def fun_l4_n815()
+    fun_l5_n906
+end
+
+def fun_l4_n816()
+    fun_l5_n852
+end
+
+def fun_l4_n817()
+    fun_l5_n286
+end
+
+def fun_l4_n818()
+    fun_l5_n704
+end
+
+def fun_l4_n819()
+    fun_l5_n860
+end
+
+def fun_l4_n820()
+    fun_l5_n150
+end
+
+def fun_l4_n821()
+    fun_l5_n793
+end
+
+def fun_l4_n822()
+    fun_l5_n356
+end
+
+def fun_l4_n823()
+    fun_l5_n369
+end
+
+def fun_l4_n824()
+    fun_l5_n519
+end
+
+def fun_l4_n825()
+    fun_l5_n765
+end
+
+def fun_l4_n826()
+    fun_l5_n974
+end
+
+def fun_l4_n827()
+    fun_l5_n265
+end
+
+def fun_l4_n828()
+    fun_l5_n948
+end
+
+def fun_l4_n829()
+    fun_l5_n2
+end
+
+def fun_l4_n830()
+    fun_l5_n269
+end
+
+def fun_l4_n831()
+    fun_l5_n96
+end
+
+def fun_l4_n832()
+    fun_l5_n964
+end
+
+def fun_l4_n833()
+    fun_l5_n362
+end
+
+def fun_l4_n834()
+    fun_l5_n915
+end
+
+def fun_l4_n835()
+    fun_l5_n179
+end
+
+def fun_l4_n836()
+    fun_l5_n128
+end
+
+def fun_l4_n837()
+    fun_l5_n195
+end
+
+def fun_l4_n838()
+    fun_l5_n393
+end
+
+def fun_l4_n839()
+    fun_l5_n120
+end
+
+def fun_l4_n840()
+    fun_l5_n239
+end
+
+def fun_l4_n841()
+    fun_l5_n669
+end
+
+def fun_l4_n842()
+    fun_l5_n234
+end
+
+def fun_l4_n843()
+    fun_l5_n60
+end
+
+def fun_l4_n844()
+    fun_l5_n962
+end
+
+def fun_l4_n845()
+    fun_l5_n770
+end
+
+def fun_l4_n846()
+    fun_l5_n207
+end
+
+def fun_l4_n847()
+    fun_l5_n46
+end
+
+def fun_l4_n848()
+    fun_l5_n615
+end
+
+def fun_l4_n849()
+    fun_l5_n709
+end
+
+def fun_l4_n850()
+    fun_l5_n198
+end
+
+def fun_l4_n851()
+    fun_l5_n639
+end
+
+def fun_l4_n852()
+    fun_l5_n125
+end
+
+def fun_l4_n853()
+    fun_l5_n193
+end
+
+def fun_l4_n854()
+    fun_l5_n806
+end
+
+def fun_l4_n855()
+    fun_l5_n237
+end
+
+def fun_l4_n856()
+    fun_l5_n319
+end
+
+def fun_l4_n857()
+    fun_l5_n533
+end
+
+def fun_l4_n858()
+    fun_l5_n320
+end
+
+def fun_l4_n859()
+    fun_l5_n501
+end
+
+def fun_l4_n860()
+    fun_l5_n404
+end
+
+def fun_l4_n861()
+    fun_l5_n849
+end
+
+def fun_l4_n862()
+    fun_l5_n743
+end
+
+def fun_l4_n863()
+    fun_l5_n764
+end
+
+def fun_l4_n864()
+    fun_l5_n956
+end
+
+def fun_l4_n865()
+    fun_l5_n914
+end
+
+def fun_l4_n866()
+    fun_l5_n652
+end
+
+def fun_l4_n867()
+    fun_l5_n30
+end
+
+def fun_l4_n868()
+    fun_l5_n330
+end
+
+def fun_l4_n869()
+    fun_l5_n677
+end
+
+def fun_l4_n870()
+    fun_l5_n988
+end
+
+def fun_l4_n871()
+    fun_l5_n676
+end
+
+def fun_l4_n872()
+    fun_l5_n752
+end
+
+def fun_l4_n873()
+    fun_l5_n636
+end
+
+def fun_l4_n874()
+    fun_l5_n395
+end
+
+def fun_l4_n875()
+    fun_l5_n428
+end
+
+def fun_l4_n876()
+    fun_l5_n83
+end
+
+def fun_l4_n877()
+    fun_l5_n712
+end
+
+def fun_l4_n878()
+    fun_l5_n708
+end
+
+def fun_l4_n879()
+    fun_l5_n418
+end
+
+def fun_l4_n880()
+    fun_l5_n265
+end
+
+def fun_l4_n881()
+    fun_l5_n379
+end
+
+def fun_l4_n882()
+    fun_l5_n758
+end
+
+def fun_l4_n883()
+    fun_l5_n251
+end
+
+def fun_l4_n884()
+    fun_l5_n723
+end
+
+def fun_l4_n885()
+    fun_l5_n216
+end
+
+def fun_l4_n886()
+    fun_l5_n197
+end
+
+def fun_l4_n887()
+    fun_l5_n261
+end
+
+def fun_l4_n888()
+    fun_l5_n62
+end
+
+def fun_l4_n889()
+    fun_l5_n941
+end
+
+def fun_l4_n890()
+    fun_l5_n535
+end
+
+def fun_l4_n891()
+    fun_l5_n727
+end
+
+def fun_l4_n892()
+    fun_l5_n279
+end
+
+def fun_l4_n893()
+    fun_l5_n541
+end
+
+def fun_l4_n894()
+    fun_l5_n684
+end
+
+def fun_l4_n895()
+    fun_l5_n649
+end
+
+def fun_l4_n896()
+    fun_l5_n396
+end
+
+def fun_l4_n897()
+    fun_l5_n992
+end
+
+def fun_l4_n898()
+    fun_l5_n160
+end
+
+def fun_l4_n899()
+    fun_l5_n84
+end
+
+def fun_l4_n900()
+    fun_l5_n318
+end
+
+def fun_l4_n901()
+    fun_l5_n428
+end
+
+def fun_l4_n902()
+    fun_l5_n534
+end
+
+def fun_l4_n903()
+    fun_l5_n25
+end
+
+def fun_l4_n904()
+    fun_l5_n392
+end
+
+def fun_l4_n905()
+    fun_l5_n926
+end
+
+def fun_l4_n906()
+    fun_l5_n724
+end
+
+def fun_l4_n907()
+    fun_l5_n311
+end
+
+def fun_l4_n908()
+    fun_l5_n535
+end
+
+def fun_l4_n909()
+    fun_l5_n179
+end
+
+def fun_l4_n910()
+    fun_l5_n533
+end
+
+def fun_l4_n911()
+    fun_l5_n875
+end
+
+def fun_l4_n912()
+    fun_l5_n105
+end
+
+def fun_l4_n913()
+    fun_l5_n618
+end
+
+def fun_l4_n914()
+    fun_l5_n827
+end
+
+def fun_l4_n915()
+    fun_l5_n555
+end
+
+def fun_l4_n916()
+    fun_l5_n339
+end
+
+def fun_l4_n917()
+    fun_l5_n848
+end
+
+def fun_l4_n918()
+    fun_l5_n676
+end
+
+def fun_l4_n919()
+    fun_l5_n204
+end
+
+def fun_l4_n920()
+    fun_l5_n769
+end
+
+def fun_l4_n921()
+    fun_l5_n229
+end
+
+def fun_l4_n922()
+    fun_l5_n92
+end
+
+def fun_l4_n923()
+    fun_l5_n973
+end
+
+def fun_l4_n924()
+    fun_l5_n700
+end
+
+def fun_l4_n925()
+    fun_l5_n581
+end
+
+def fun_l4_n926()
+    fun_l5_n138
+end
+
+def fun_l4_n927()
+    fun_l5_n43
+end
+
+def fun_l4_n928()
+    fun_l5_n537
+end
+
+def fun_l4_n929()
+    fun_l5_n882
+end
+
+def fun_l4_n930()
+    fun_l5_n871
+end
+
+def fun_l4_n931()
+    fun_l5_n158
+end
+
+def fun_l4_n932()
+    fun_l5_n542
+end
+
+def fun_l4_n933()
+    fun_l5_n468
+end
+
+def fun_l4_n934()
+    fun_l5_n28
+end
+
+def fun_l4_n935()
+    fun_l5_n976
+end
+
+def fun_l4_n936()
+    fun_l5_n632
+end
+
+def fun_l4_n937()
+    fun_l5_n857
+end
+
+def fun_l4_n938()
+    fun_l5_n841
+end
+
+def fun_l4_n939()
+    fun_l5_n762
+end
+
+def fun_l4_n940()
+    fun_l5_n522
+end
+
+def fun_l4_n941()
+    fun_l5_n841
+end
+
+def fun_l4_n942()
+    fun_l5_n42
+end
+
+def fun_l4_n943()
+    fun_l5_n771
+end
+
+def fun_l4_n944()
+    fun_l5_n145
+end
+
+def fun_l4_n945()
+    fun_l5_n435
+end
+
+def fun_l4_n946()
+    fun_l5_n573
+end
+
+def fun_l4_n947()
+    fun_l5_n422
+end
+
+def fun_l4_n948()
+    fun_l5_n34
+end
+
+def fun_l4_n949()
+    fun_l5_n577
+end
+
+def fun_l4_n950()
+    fun_l5_n156
+end
+
+def fun_l4_n951()
+    fun_l5_n707
+end
+
+def fun_l4_n952()
+    fun_l5_n198
+end
+
+def fun_l4_n953()
+    fun_l5_n950
+end
+
+def fun_l4_n954()
+    fun_l5_n474
+end
+
+def fun_l4_n955()
+    fun_l5_n319
+end
+
+def fun_l4_n956()
+    fun_l5_n208
+end
+
+def fun_l4_n957()
+    fun_l5_n360
+end
+
+def fun_l4_n958()
+    fun_l5_n101
+end
+
+def fun_l4_n959()
+    fun_l5_n37
+end
+
+def fun_l4_n960()
+    fun_l5_n20
+end
+
+def fun_l4_n961()
+    fun_l5_n897
+end
+
+def fun_l4_n962()
+    fun_l5_n92
+end
+
+def fun_l4_n963()
+    fun_l5_n105
+end
+
+def fun_l4_n964()
+    fun_l5_n255
+end
+
+def fun_l4_n965()
+    fun_l5_n97
+end
+
+def fun_l4_n966()
+    fun_l5_n398
+end
+
+def fun_l4_n967()
+    fun_l5_n393
+end
+
+def fun_l4_n968()
+    fun_l5_n135
+end
+
+def fun_l4_n969()
+    fun_l5_n306
+end
+
+def fun_l4_n970()
+    fun_l5_n202
+end
+
+def fun_l4_n971()
+    fun_l5_n832
+end
+
+def fun_l4_n972()
+    fun_l5_n444
+end
+
+def fun_l4_n973()
+    fun_l5_n768
+end
+
+def fun_l4_n974()
+    fun_l5_n384
+end
+
+def fun_l4_n975()
+    fun_l5_n142
+end
+
+def fun_l4_n976()
+    fun_l5_n208
+end
+
+def fun_l4_n977()
+    fun_l5_n818
+end
+
+def fun_l4_n978()
+    fun_l5_n5
+end
+
+def fun_l4_n979()
+    fun_l5_n410
+end
+
+def fun_l4_n980()
+    fun_l5_n713
+end
+
+def fun_l4_n981()
+    fun_l5_n42
+end
+
+def fun_l4_n982()
+    fun_l5_n335
+end
+
+def fun_l4_n983()
+    fun_l5_n446
+end
+
+def fun_l4_n984()
+    fun_l5_n957
+end
+
+def fun_l4_n985()
+    fun_l5_n652
+end
+
+def fun_l4_n986()
+    fun_l5_n341
+end
+
+def fun_l4_n987()
+    fun_l5_n300
+end
+
+def fun_l4_n988()
+    fun_l5_n859
+end
+
+def fun_l4_n989()
+    fun_l5_n467
+end
+
+def fun_l4_n990()
+    fun_l5_n182
+end
+
+def fun_l4_n991()
+    fun_l5_n755
+end
+
+def fun_l4_n992()
+    fun_l5_n925
+end
+
+def fun_l4_n993()
+    fun_l5_n695
+end
+
+def fun_l4_n994()
+    fun_l5_n901
+end
+
+def fun_l4_n995()
+    fun_l5_n844
+end
+
+def fun_l4_n996()
+    fun_l5_n430
+end
+
+def fun_l4_n997()
+    fun_l5_n568
+end
+
+def fun_l4_n998()
+    fun_l5_n472
+end
+
+def fun_l4_n999()
+    fun_l5_n871
+end
+
+def fun_l5_n0()
+    fun_l6_n383
+end
+
+def fun_l5_n1()
+    fun_l6_n172
+end
+
+def fun_l5_n2()
+    fun_l6_n405
+end
+
+def fun_l5_n3()
+    fun_l6_n960
+end
+
+def fun_l5_n4()
+    fun_l6_n846
+end
+
+def fun_l5_n5()
+    fun_l6_n207
+end
+
+def fun_l5_n6()
+    fun_l6_n217
+end
+
+def fun_l5_n7()
+    fun_l6_n317
+end
+
+def fun_l5_n8()
+    fun_l6_n628
+end
+
+def fun_l5_n9()
+    fun_l6_n407
+end
+
+def fun_l5_n10()
+    fun_l6_n933
+end
+
+def fun_l5_n11()
+    fun_l6_n318
+end
+
+def fun_l5_n12()
+    fun_l6_n349
+end
+
+def fun_l5_n13()
+    fun_l6_n559
+end
+
+def fun_l5_n14()
+    fun_l6_n352
+end
+
+def fun_l5_n15()
+    fun_l6_n531
+end
+
+def fun_l5_n16()
+    fun_l6_n6
+end
+
+def fun_l5_n17()
+    fun_l6_n285
+end
+
+def fun_l5_n18()
+    fun_l6_n419
+end
+
+def fun_l5_n19()
+    fun_l6_n232
+end
+
+def fun_l5_n20()
+    fun_l6_n285
+end
+
+def fun_l5_n21()
+    fun_l6_n814
+end
+
+def fun_l5_n22()
+    fun_l6_n773
+end
+
+def fun_l5_n23()
+    fun_l6_n771
+end
+
+def fun_l5_n24()
+    fun_l6_n903
+end
+
+def fun_l5_n25()
+    fun_l6_n116
+end
+
+def fun_l5_n26()
+    fun_l6_n116
+end
+
+def fun_l5_n27()
+    fun_l6_n531
+end
+
+def fun_l5_n28()
+    fun_l6_n418
+end
+
+def fun_l5_n29()
+    fun_l6_n564
+end
+
+def fun_l5_n30()
+    fun_l6_n691
+end
+
+def fun_l5_n31()
+    fun_l6_n267
+end
+
+def fun_l5_n32()
+    fun_l6_n209
+end
+
+def fun_l5_n33()
+    fun_l6_n27
+end
+
+def fun_l5_n34()
+    fun_l6_n312
+end
+
+def fun_l5_n35()
+    fun_l6_n240
+end
+
+def fun_l5_n36()
+    fun_l6_n507
+end
+
+def fun_l5_n37()
+    fun_l6_n808
+end
+
+def fun_l5_n38()
+    fun_l6_n28
+end
+
+def fun_l5_n39()
+    fun_l6_n33
+end
+
+def fun_l5_n40()
+    fun_l6_n808
+end
+
+def fun_l5_n41()
+    fun_l6_n15
+end
+
+def fun_l5_n42()
+    fun_l6_n995
+end
+
+def fun_l5_n43()
+    fun_l6_n886
+end
+
+def fun_l5_n44()
+    fun_l6_n164
+end
+
+def fun_l5_n45()
+    fun_l6_n804
+end
+
+def fun_l5_n46()
+    fun_l6_n776
+end
+
+def fun_l5_n47()
+    fun_l6_n584
+end
+
+def fun_l5_n48()
+    fun_l6_n220
+end
+
+def fun_l5_n49()
+    fun_l6_n680
+end
+
+def fun_l5_n50()
+    fun_l6_n438
+end
+
+def fun_l5_n51()
+    fun_l6_n565
+end
+
+def fun_l5_n52()
+    fun_l6_n394
+end
+
+def fun_l5_n53()
+    fun_l6_n867
+end
+
+def fun_l5_n54()
+    fun_l6_n468
+end
+
+def fun_l5_n55()
+    fun_l6_n622
+end
+
+def fun_l5_n56()
+    fun_l6_n846
+end
+
+def fun_l5_n57()
+    fun_l6_n718
+end
+
+def fun_l5_n58()
+    fun_l6_n367
+end
+
+def fun_l5_n59()
+    fun_l6_n284
+end
+
+def fun_l5_n60()
+    fun_l6_n350
+end
+
+def fun_l5_n61()
+    fun_l6_n849
+end
+
+def fun_l5_n62()
+    fun_l6_n537
+end
+
+def fun_l5_n63()
+    fun_l6_n475
+end
+
+def fun_l5_n64()
+    fun_l6_n525
+end
+
+def fun_l5_n65()
+    fun_l6_n416
+end
+
+def fun_l5_n66()
+    fun_l6_n261
+end
+
+def fun_l5_n67()
+    fun_l6_n528
+end
+
+def fun_l5_n68()
+    fun_l6_n331
+end
+
+def fun_l5_n69()
+    fun_l6_n387
+end
+
+def fun_l5_n70()
+    fun_l6_n780
+end
+
+def fun_l5_n71()
+    fun_l6_n542
+end
+
+def fun_l5_n72()
+    fun_l6_n930
+end
+
+def fun_l5_n73()
+    fun_l6_n79
+end
+
+def fun_l5_n74()
+    fun_l6_n351
+end
+
+def fun_l5_n75()
+    fun_l6_n290
+end
+
+def fun_l5_n76()
+    fun_l6_n659
+end
+
+def fun_l5_n77()
+    fun_l6_n421
+end
+
+def fun_l5_n78()
+    fun_l6_n454
+end
+
+def fun_l5_n79()
+    fun_l6_n78
+end
+
+def fun_l5_n80()
+    fun_l6_n63
+end
+
+def fun_l5_n81()
+    fun_l6_n555
+end
+
+def fun_l5_n82()
+    fun_l6_n54
+end
+
+def fun_l5_n83()
+    fun_l6_n46
+end
+
+def fun_l5_n84()
+    fun_l6_n225
+end
+
+def fun_l5_n85()
+    fun_l6_n330
+end
+
+def fun_l5_n86()
+    fun_l6_n772
+end
+
+def fun_l5_n87()
+    fun_l6_n654
+end
+
+def fun_l5_n88()
+    fun_l6_n281
+end
+
+def fun_l5_n89()
+    fun_l6_n857
+end
+
+def fun_l5_n90()
+    fun_l6_n453
+end
+
+def fun_l5_n91()
+    fun_l6_n504
+end
+
+def fun_l5_n92()
+    fun_l6_n649
+end
+
+def fun_l5_n93()
+    fun_l6_n90
+end
+
+def fun_l5_n94()
+    fun_l6_n520
+end
+
+def fun_l5_n95()
+    fun_l6_n251
+end
+
+def fun_l5_n96()
+    fun_l6_n738
+end
+
+def fun_l5_n97()
+    fun_l6_n837
+end
+
+def fun_l5_n98()
+    fun_l6_n98
+end
+
+def fun_l5_n99()
+    fun_l6_n844
+end
+
+def fun_l5_n100()
+    fun_l6_n699
+end
+
+def fun_l5_n101()
+    fun_l6_n901
+end
+
+def fun_l5_n102()
+    fun_l6_n342
+end
+
+def fun_l5_n103()
+    fun_l6_n856
+end
+
+def fun_l5_n104()
+    fun_l6_n113
+end
+
+def fun_l5_n105()
+    fun_l6_n530
+end
+
+def fun_l5_n106()
+    fun_l6_n445
+end
+
+def fun_l5_n107()
+    fun_l6_n515
+end
+
+def fun_l5_n108()
+    fun_l6_n958
+end
+
+def fun_l5_n109()
+    fun_l6_n561
+end
+
+def fun_l5_n110()
+    fun_l6_n130
+end
+
+def fun_l5_n111()
+    fun_l6_n653
+end
+
+def fun_l5_n112()
+    fun_l6_n367
+end
+
+def fun_l5_n113()
+    fun_l6_n515
+end
+
+def fun_l5_n114()
+    fun_l6_n50
+end
+
+def fun_l5_n115()
+    fun_l6_n259
+end
+
+def fun_l5_n116()
+    fun_l6_n280
+end
+
+def fun_l5_n117()
+    fun_l6_n589
+end
+
+def fun_l5_n118()
+    fun_l6_n988
+end
+
+def fun_l5_n119()
+    fun_l6_n544
+end
+
+def fun_l5_n120()
+    fun_l6_n564
+end
+
+def fun_l5_n121()
+    fun_l6_n468
+end
+
+def fun_l5_n122()
+    fun_l6_n586
+end
+
+def fun_l5_n123()
+    fun_l6_n705
+end
+
+def fun_l5_n124()
+    fun_l6_n510
+end
+
+def fun_l5_n125()
+    fun_l6_n995
+end
+
+def fun_l5_n126()
+    fun_l6_n576
+end
+
+def fun_l5_n127()
+    fun_l6_n221
+end
+
+def fun_l5_n128()
+    fun_l6_n498
+end
+
+def fun_l5_n129()
+    fun_l6_n113
+end
+
+def fun_l5_n130()
+    fun_l6_n916
+end
+
+def fun_l5_n131()
+    fun_l6_n626
+end
+
+def fun_l5_n132()
+    fun_l6_n635
+end
+
+def fun_l5_n133()
+    fun_l6_n605
+end
+
+def fun_l5_n134()
+    fun_l6_n931
+end
+
+def fun_l5_n135()
+    fun_l6_n282
+end
+
+def fun_l5_n136()
+    fun_l6_n904
+end
+
+def fun_l5_n137()
+    fun_l6_n522
+end
+
+def fun_l5_n138()
+    fun_l6_n255
+end
+
+def fun_l5_n139()
+    fun_l6_n308
+end
+
+def fun_l5_n140()
+    fun_l6_n482
+end
+
+def fun_l5_n141()
+    fun_l6_n911
+end
+
+def fun_l5_n142()
+    fun_l6_n640
+end
+
+def fun_l5_n143()
+    fun_l6_n783
+end
+
+def fun_l5_n144()
+    fun_l6_n980
+end
+
+def fun_l5_n145()
+    fun_l6_n85
+end
+
+def fun_l5_n146()
+    fun_l6_n181
+end
+
+def fun_l5_n147()
+    fun_l6_n963
+end
+
+def fun_l5_n148()
+    fun_l6_n516
+end
+
+def fun_l5_n149()
+    fun_l6_n315
+end
+
+def fun_l5_n150()
+    fun_l6_n822
+end
+
+def fun_l5_n151()
+    fun_l6_n528
+end
+
+def fun_l5_n152()
+    fun_l6_n220
+end
+
+def fun_l5_n153()
+    fun_l6_n13
+end
+
+def fun_l5_n154()
+    fun_l6_n172
+end
+
+def fun_l5_n155()
+    fun_l6_n987
+end
+
+def fun_l5_n156()
+    fun_l6_n414
+end
+
+def fun_l5_n157()
+    fun_l6_n758
+end
+
+def fun_l5_n158()
+    fun_l6_n889
+end
+
+def fun_l5_n159()
+    fun_l6_n526
+end
+
+def fun_l5_n160()
+    fun_l6_n576
+end
+
+def fun_l5_n161()
+    fun_l6_n35
+end
+
+def fun_l5_n162()
+    fun_l6_n382
+end
+
+def fun_l5_n163()
+    fun_l6_n503
+end
+
+def fun_l5_n164()
+    fun_l6_n950
+end
+
+def fun_l5_n165()
+    fun_l6_n796
+end
+
+def fun_l5_n166()
+    fun_l6_n72
+end
+
+def fun_l5_n167()
+    fun_l6_n258
+end
+
+def fun_l5_n168()
+    fun_l6_n624
+end
+
+def fun_l5_n169()
+    fun_l6_n146
+end
+
+def fun_l5_n170()
+    fun_l6_n202
+end
+
+def fun_l5_n171()
+    fun_l6_n18
+end
+
+def fun_l5_n172()
+    fun_l6_n822
+end
+
+def fun_l5_n173()
+    fun_l6_n839
+end
+
+def fun_l5_n174()
+    fun_l6_n201
+end
+
+def fun_l5_n175()
+    fun_l6_n109
+end
+
+def fun_l5_n176()
+    fun_l6_n265
+end
+
+def fun_l5_n177()
+    fun_l6_n899
+end
+
+def fun_l5_n178()
+    fun_l6_n805
+end
+
+def fun_l5_n179()
+    fun_l6_n245
+end
+
+def fun_l5_n180()
+    fun_l6_n309
+end
+
+def fun_l5_n181()
+    fun_l6_n31
+end
+
+def fun_l5_n182()
+    fun_l6_n642
+end
+
+def fun_l5_n183()
+    fun_l6_n552
+end
+
+def fun_l5_n184()
+    fun_l6_n217
+end
+
+def fun_l5_n185()
+    fun_l6_n382
+end
+
+def fun_l5_n186()
+    fun_l6_n642
+end
+
+def fun_l5_n187()
+    fun_l6_n415
+end
+
+def fun_l5_n188()
+    fun_l6_n246
+end
+
+def fun_l5_n189()
+    fun_l6_n754
+end
+
+def fun_l5_n190()
+    fun_l6_n869
+end
+
+def fun_l5_n191()
+    fun_l6_n944
+end
+
+def fun_l5_n192()
+    fun_l6_n558
+end
+
+def fun_l5_n193()
+    fun_l6_n548
+end
+
+def fun_l5_n194()
+    fun_l6_n156
+end
+
+def fun_l5_n195()
+    fun_l6_n507
+end
+
+def fun_l5_n196()
+    fun_l6_n897
+end
+
+def fun_l5_n197()
+    fun_l6_n297
+end
+
+def fun_l5_n198()
+    fun_l6_n775
+end
+
+def fun_l5_n199()
+    fun_l6_n897
+end
+
+def fun_l5_n200()
+    fun_l6_n232
+end
+
+def fun_l5_n201()
+    fun_l6_n341
+end
+
+def fun_l5_n202()
+    fun_l6_n881
+end
+
+def fun_l5_n203()
+    fun_l6_n757
+end
+
+def fun_l5_n204()
+    fun_l6_n673
+end
+
+def fun_l5_n205()
+    fun_l6_n753
+end
+
+def fun_l5_n206()
+    fun_l6_n191
+end
+
+def fun_l5_n207()
+    fun_l6_n768
+end
+
+def fun_l5_n208()
+    fun_l6_n963
+end
+
+def fun_l5_n209()
+    fun_l6_n102
+end
+
+def fun_l5_n210()
+    fun_l6_n355
+end
+
+def fun_l5_n211()
+    fun_l6_n838
+end
+
+def fun_l5_n212()
+    fun_l6_n388
+end
+
+def fun_l5_n213()
+    fun_l6_n840
+end
+
+def fun_l5_n214()
+    fun_l6_n501
+end
+
+def fun_l5_n215()
+    fun_l6_n792
+end
+
+def fun_l5_n216()
+    fun_l6_n360
+end
+
+def fun_l5_n217()
+    fun_l6_n70
+end
+
+def fun_l5_n218()
+    fun_l6_n887
+end
+
+def fun_l5_n219()
+    fun_l6_n57
+end
+
+def fun_l5_n220()
+    fun_l6_n595
+end
+
+def fun_l5_n221()
+    fun_l6_n988
+end
+
+def fun_l5_n222()
+    fun_l6_n191
+end
+
+def fun_l5_n223()
+    fun_l6_n667
+end
+
+def fun_l5_n224()
+    fun_l6_n410
+end
+
+def fun_l5_n225()
+    fun_l6_n636
+end
+
+def fun_l5_n226()
+    fun_l6_n669
+end
+
+def fun_l5_n227()
+    fun_l6_n980
+end
+
+def fun_l5_n228()
+    fun_l6_n521
+end
+
+def fun_l5_n229()
+    fun_l6_n707
+end
+
+def fun_l5_n230()
+    fun_l6_n757
+end
+
+def fun_l5_n231()
+    fun_l6_n360
+end
+
+def fun_l5_n232()
+    fun_l6_n480
+end
+
+def fun_l5_n233()
+    fun_l6_n8
+end
+
+def fun_l5_n234()
+    fun_l6_n47
+end
+
+def fun_l5_n235()
+    fun_l6_n985
+end
+
+def fun_l5_n236()
+    fun_l6_n331
+end
+
+def fun_l5_n237()
+    fun_l6_n314
+end
+
+def fun_l5_n238()
+    fun_l6_n666
+end
+
+def fun_l5_n239()
+    fun_l6_n289
+end
+
+def fun_l5_n240()
+    fun_l6_n487
+end
+
+def fun_l5_n241()
+    fun_l6_n298
+end
+
+def fun_l5_n242()
+    fun_l6_n460
+end
+
+def fun_l5_n243()
+    fun_l6_n63
+end
+
+def fun_l5_n244()
+    fun_l6_n898
+end
+
+def fun_l5_n245()
+    fun_l6_n706
+end
+
+def fun_l5_n246()
+    fun_l6_n276
+end
+
+def fun_l5_n247()
+    fun_l6_n709
+end
+
+def fun_l5_n248()
+    fun_l6_n60
+end
+
+def fun_l5_n249()
+    fun_l6_n53
+end
+
+def fun_l5_n250()
+    fun_l6_n396
+end
+
+def fun_l5_n251()
+    fun_l6_n124
+end
+
+def fun_l5_n252()
+    fun_l6_n713
+end
+
+def fun_l5_n253()
+    fun_l6_n208
+end
+
+def fun_l5_n254()
+    fun_l6_n345
+end
+
+def fun_l5_n255()
+    fun_l6_n976
+end
+
+def fun_l5_n256()
+    fun_l6_n775
+end
+
+def fun_l5_n257()
+    fun_l6_n20
+end
+
+def fun_l5_n258()
+    fun_l6_n476
+end
+
+def fun_l5_n259()
+    fun_l6_n80
+end
+
+def fun_l5_n260()
+    fun_l6_n160
+end
+
+def fun_l5_n261()
+    fun_l6_n624
+end
+
+def fun_l5_n262()
+    fun_l6_n275
+end
+
+def fun_l5_n263()
+    fun_l6_n301
+end
+
+def fun_l5_n264()
+    fun_l6_n640
+end
+
+def fun_l5_n265()
+    fun_l6_n473
+end
+
+def fun_l5_n266()
+    fun_l6_n991
+end
+
+def fun_l5_n267()
+    fun_l6_n458
+end
+
+def fun_l5_n268()
+    fun_l6_n128
+end
+
+def fun_l5_n269()
+    fun_l6_n28
+end
+
+def fun_l5_n270()
+    fun_l6_n40
+end
+
+def fun_l5_n271()
+    fun_l6_n48
+end
+
+def fun_l5_n272()
+    fun_l6_n916
+end
+
+def fun_l5_n273()
+    fun_l6_n114
+end
+
+def fun_l5_n274()
+    fun_l6_n747
+end
+
+def fun_l5_n275()
+    fun_l6_n239
+end
+
+def fun_l5_n276()
+    fun_l6_n151
+end
+
+def fun_l5_n277()
+    fun_l6_n820
+end
+
+def fun_l5_n278()
+    fun_l6_n684
+end
+
+def fun_l5_n279()
+    fun_l6_n628
+end
+
+def fun_l5_n280()
+    fun_l6_n248
+end
+
+def fun_l5_n281()
+    fun_l6_n793
+end
+
+def fun_l5_n282()
+    fun_l6_n137
+end
+
+def fun_l5_n283()
+    fun_l6_n520
+end
+
+def fun_l5_n284()
+    fun_l6_n750
+end
+
+def fun_l5_n285()
+    fun_l6_n445
+end
+
+def fun_l5_n286()
+    fun_l6_n419
+end
+
+def fun_l5_n287()
+    fun_l6_n681
+end
+
+def fun_l5_n288()
+    fun_l6_n16
+end
+
+def fun_l5_n289()
+    fun_l6_n939
+end
+
+def fun_l5_n290()
+    fun_l6_n664
+end
+
+def fun_l5_n291()
+    fun_l6_n580
+end
+
+def fun_l5_n292()
+    fun_l6_n945
+end
+
+def fun_l5_n293()
+    fun_l6_n129
+end
+
+def fun_l5_n294()
+    fun_l6_n142
+end
+
+def fun_l5_n295()
+    fun_l6_n774
+end
+
+def fun_l5_n296()
+    fun_l6_n667
+end
+
+def fun_l5_n297()
+    fun_l6_n659
+end
+
+def fun_l5_n298()
+    fun_l6_n82
+end
+
+def fun_l5_n299()
+    fun_l6_n452
+end
+
+def fun_l5_n300()
+    fun_l6_n340
+end
+
+def fun_l5_n301()
+    fun_l6_n675
+end
+
+def fun_l5_n302()
+    fun_l6_n506
+end
+
+def fun_l5_n303()
+    fun_l6_n166
+end
+
+def fun_l5_n304()
+    fun_l6_n220
+end
+
+def fun_l5_n305()
+    fun_l6_n894
+end
+
+def fun_l5_n306()
+    fun_l6_n467
+end
+
+def fun_l5_n307()
+    fun_l6_n204
+end
+
+def fun_l5_n308()
+    fun_l6_n580
+end
+
+def fun_l5_n309()
+    fun_l6_n90
+end
+
+def fun_l5_n310()
+    fun_l6_n854
+end
+
+def fun_l5_n311()
+    fun_l6_n384
+end
+
+def fun_l5_n312()
+    fun_l6_n540
+end
+
+def fun_l5_n313()
+    fun_l6_n314
+end
+
+def fun_l5_n314()
+    fun_l6_n90
+end
+
+def fun_l5_n315()
+    fun_l6_n106
+end
+
+def fun_l5_n316()
+    fun_l6_n404
+end
+
+def fun_l5_n317()
+    fun_l6_n396
+end
+
+def fun_l5_n318()
+    fun_l6_n229
+end
+
+def fun_l5_n319()
+    fun_l6_n137
+end
+
+def fun_l5_n320()
+    fun_l6_n781
+end
+
+def fun_l5_n321()
+    fun_l6_n949
+end
+
+def fun_l5_n322()
+    fun_l6_n810
+end
+
+def fun_l5_n323()
+    fun_l6_n574
+end
+
+def fun_l5_n324()
+    fun_l6_n465
+end
+
+def fun_l5_n325()
+    fun_l6_n785
+end
+
+def fun_l5_n326()
+    fun_l6_n408
+end
+
+def fun_l5_n327()
+    fun_l6_n658
+end
+
+def fun_l5_n328()
+    fun_l6_n1
+end
+
+def fun_l5_n329()
+    fun_l6_n586
+end
+
+def fun_l5_n330()
+    fun_l6_n375
+end
+
+def fun_l5_n331()
+    fun_l6_n950
+end
+
+def fun_l5_n332()
+    fun_l6_n924
+end
+
+def fun_l5_n333()
+    fun_l6_n224
+end
+
+def fun_l5_n334()
+    fun_l6_n786
+end
+
+def fun_l5_n335()
+    fun_l6_n184
+end
+
+def fun_l5_n336()
+    fun_l6_n125
+end
+
+def fun_l5_n337()
+    fun_l6_n215
+end
+
+def fun_l5_n338()
+    fun_l6_n110
+end
+
+def fun_l5_n339()
+    fun_l6_n16
+end
+
+def fun_l5_n340()
+    fun_l6_n746
+end
+
+def fun_l5_n341()
+    fun_l6_n50
+end
+
+def fun_l5_n342()
+    fun_l6_n198
+end
+
+def fun_l5_n343()
+    fun_l6_n735
+end
+
+def fun_l5_n344()
+    fun_l6_n260
+end
+
+def fun_l5_n345()
+    fun_l6_n481
+end
+
+def fun_l5_n346()
+    fun_l6_n100
+end
+
+def fun_l5_n347()
+    fun_l6_n581
+end
+
+def fun_l5_n348()
+    fun_l6_n803
+end
+
+def fun_l5_n349()
+    fun_l6_n495
+end
+
+def fun_l5_n350()
+    fun_l6_n316
+end
+
+def fun_l5_n351()
+    fun_l6_n810
+end
+
+def fun_l5_n352()
+    fun_l6_n21
+end
+
+def fun_l5_n353()
+    fun_l6_n409
+end
+
+def fun_l5_n354()
+    fun_l6_n814
+end
+
+def fun_l5_n355()
+    fun_l6_n525
+end
+
+def fun_l5_n356()
+    fun_l6_n445
+end
+
+def fun_l5_n357()
+    fun_l6_n940
+end
+
+def fun_l5_n358()
+    fun_l6_n508
+end
+
+def fun_l5_n359()
+    fun_l6_n511
+end
+
+def fun_l5_n360()
+    fun_l6_n29
+end
+
+def fun_l5_n361()
+    fun_l6_n272
+end
+
+def fun_l5_n362()
+    fun_l6_n715
+end
+
+def fun_l5_n363()
+    fun_l6_n518
+end
+
+def fun_l5_n364()
+    fun_l6_n392
+end
+
+def fun_l5_n365()
+    fun_l6_n762
+end
+
+def fun_l5_n366()
+    fun_l6_n250
+end
+
+def fun_l5_n367()
+    fun_l6_n192
+end
+
+def fun_l5_n368()
+    fun_l6_n741
+end
+
+def fun_l5_n369()
+    fun_l6_n340
+end
+
+def fun_l5_n370()
+    fun_l6_n891
+end
+
+def fun_l5_n371()
+    fun_l6_n22
+end
+
+def fun_l5_n372()
+    fun_l6_n369
+end
+
+def fun_l5_n373()
+    fun_l6_n653
+end
+
+def fun_l5_n374()
+    fun_l6_n282
+end
+
+def fun_l5_n375()
+    fun_l6_n7
+end
+
+def fun_l5_n376()
+    fun_l6_n511
+end
+
+def fun_l5_n377()
+    fun_l6_n511
+end
+
+def fun_l5_n378()
+    fun_l6_n718
+end
+
+def fun_l5_n379()
+    fun_l6_n521
+end
+
+def fun_l5_n380()
+    fun_l6_n331
+end
+
+def fun_l5_n381()
+    fun_l6_n343
+end
+
+def fun_l5_n382()
+    fun_l6_n411
+end
+
+def fun_l5_n383()
+    fun_l6_n780
+end
+
+def fun_l5_n384()
+    fun_l6_n398
+end
+
+def fun_l5_n385()
+    fun_l6_n173
+end
+
+def fun_l5_n386()
+    fun_l6_n693
+end
+
+def fun_l5_n387()
+    fun_l6_n360
+end
+
+def fun_l5_n388()
+    fun_l6_n146
+end
+
+def fun_l5_n389()
+    fun_l6_n796
+end
+
+def fun_l5_n390()
+    fun_l6_n403
+end
+
+def fun_l5_n391()
+    fun_l6_n662
+end
+
+def fun_l5_n392()
+    fun_l6_n281
+end
+
+def fun_l5_n393()
+    fun_l6_n617
+end
+
+def fun_l5_n394()
+    fun_l6_n367
+end
+
+def fun_l5_n395()
+    fun_l6_n433
+end
+
+def fun_l5_n396()
+    fun_l6_n748
+end
+
+def fun_l5_n397()
+    fun_l6_n600
+end
+
+def fun_l5_n398()
+    fun_l6_n490
+end
+
+def fun_l5_n399()
+    fun_l6_n120
+end
+
+def fun_l5_n400()
+    fun_l6_n549
+end
+
+def fun_l5_n401()
+    fun_l6_n148
+end
+
+def fun_l5_n402()
+    fun_l6_n488
+end
+
+def fun_l5_n403()
+    fun_l6_n316
+end
+
+def fun_l5_n404()
+    fun_l6_n106
+end
+
+def fun_l5_n405()
+    fun_l6_n702
+end
+
+def fun_l5_n406()
+    fun_l6_n787
+end
+
+def fun_l5_n407()
+    fun_l6_n9
+end
+
+def fun_l5_n408()
+    fun_l6_n338
+end
+
+def fun_l5_n409()
+    fun_l6_n83
+end
+
+def fun_l5_n410()
+    fun_l6_n234
+end
+
+def fun_l5_n411()
+    fun_l6_n147
+end
+
+def fun_l5_n412()
+    fun_l6_n602
+end
+
+def fun_l5_n413()
+    fun_l6_n173
+end
+
+def fun_l5_n414()
+    fun_l6_n420
+end
+
+def fun_l5_n415()
+    fun_l6_n214
+end
+
+def fun_l5_n416()
+    fun_l6_n400
+end
+
+def fun_l5_n417()
+    fun_l6_n35
+end
+
+def fun_l5_n418()
+    fun_l6_n545
+end
+
+def fun_l5_n419()
+    fun_l6_n823
+end
+
+def fun_l5_n420()
+    fun_l6_n401
+end
+
+def fun_l5_n421()
+    fun_l6_n447
+end
+
+def fun_l5_n422()
+    fun_l6_n461
+end
+
+def fun_l5_n423()
+    fun_l6_n447
+end
+
+def fun_l5_n424()
+    fun_l6_n530
+end
+
+def fun_l5_n425()
+    fun_l6_n104
+end
+
+def fun_l5_n426()
+    fun_l6_n206
+end
+
+def fun_l5_n427()
+    fun_l6_n25
+end
+
+def fun_l5_n428()
+    fun_l6_n867
+end
+
+def fun_l5_n429()
+    fun_l6_n160
+end
+
+def fun_l5_n430()
+    fun_l6_n152
+end
+
+def fun_l5_n431()
+    fun_l6_n308
+end
+
+def fun_l5_n432()
+    fun_l6_n603
+end
+
+def fun_l5_n433()
+    fun_l6_n270
+end
+
+def fun_l5_n434()
+    fun_l6_n397
+end
+
+def fun_l5_n435()
+    fun_l6_n819
+end
+
+def fun_l5_n436()
+    fun_l6_n476
+end
+
+def fun_l5_n437()
+    fun_l6_n533
+end
+
+def fun_l5_n438()
+    fun_l6_n989
+end
+
+def fun_l5_n439()
+    fun_l6_n329
+end
+
+def fun_l5_n440()
+    fun_l6_n216
+end
+
+def fun_l5_n441()
+    fun_l6_n54
+end
+
+def fun_l5_n442()
+    fun_l6_n374
+end
+
+def fun_l5_n443()
+    fun_l6_n544
+end
+
+def fun_l5_n444()
+    fun_l6_n586
+end
+
+def fun_l5_n445()
+    fun_l6_n137
+end
+
+def fun_l5_n446()
+    fun_l6_n115
+end
+
+def fun_l5_n447()
+    fun_l6_n908
+end
+
+def fun_l5_n448()
+    fun_l6_n657
+end
+
+def fun_l5_n449()
+    fun_l6_n876
+end
+
+def fun_l5_n450()
+    fun_l6_n585
+end
+
+def fun_l5_n451()
+    fun_l6_n159
+end
+
+def fun_l5_n452()
+    fun_l6_n66
+end
+
+def fun_l5_n453()
+    fun_l6_n327
+end
+
+def fun_l5_n454()
+    fun_l6_n441
+end
+
+def fun_l5_n455()
+    fun_l6_n399
+end
+
+def fun_l5_n456()
+    fun_l6_n335
+end
+
+def fun_l5_n457()
+    fun_l6_n820
+end
+
+def fun_l5_n458()
+    fun_l6_n494
+end
+
+def fun_l5_n459()
+    fun_l6_n683
+end
+
+def fun_l5_n460()
+    fun_l6_n453
+end
+
+def fun_l5_n461()
+    fun_l6_n202
+end
+
+def fun_l5_n462()
+    fun_l6_n274
+end
+
+def fun_l5_n463()
+    fun_l6_n493
+end
+
+def fun_l5_n464()
+    fun_l6_n874
+end
+
+def fun_l5_n465()
+    fun_l6_n882
+end
+
+def fun_l5_n466()
+    fun_l6_n706
+end
+
+def fun_l5_n467()
+    fun_l6_n356
+end
+
+def fun_l5_n468()
+    fun_l6_n21
+end
+
+def fun_l5_n469()
+    fun_l6_n131
+end
+
+def fun_l5_n470()
+    fun_l6_n818
+end
+
+def fun_l5_n471()
+    fun_l6_n58
+end
+
+def fun_l5_n472()
+    fun_l6_n606
+end
+
+def fun_l5_n473()
+    fun_l6_n368
+end
+
+def fun_l5_n474()
+    fun_l6_n266
+end
+
+def fun_l5_n475()
+    fun_l6_n910
+end
+
+def fun_l5_n476()
+    fun_l6_n406
+end
+
+def fun_l5_n477()
+    fun_l6_n522
+end
+
+def fun_l5_n478()
+    fun_l6_n479
+end
+
+def fun_l5_n479()
+    fun_l6_n247
+end
+
+def fun_l5_n480()
+    fun_l6_n785
+end
+
+def fun_l5_n481()
+    fun_l6_n953
+end
+
+def fun_l5_n482()
+    fun_l6_n443
+end
+
+def fun_l5_n483()
+    fun_l6_n834
+end
+
+def fun_l5_n484()
+    fun_l6_n494
+end
+
+def fun_l5_n485()
+    fun_l6_n65
+end
+
+def fun_l5_n486()
+    fun_l6_n93
+end
+
+def fun_l5_n487()
+    fun_l6_n702
+end
+
+def fun_l5_n488()
+    fun_l6_n571
+end
+
+def fun_l5_n489()
+    fun_l6_n233
+end
+
+def fun_l5_n490()
+    fun_l6_n106
+end
+
+def fun_l5_n491()
+    fun_l6_n806
+end
+
+def fun_l5_n492()
+    fun_l6_n795
+end
+
+def fun_l5_n493()
+    fun_l6_n273
+end
+
+def fun_l5_n494()
+    fun_l6_n943
+end
+
+def fun_l5_n495()
+    fun_l6_n710
+end
+
+def fun_l5_n496()
+    fun_l6_n419
+end
+
+def fun_l5_n497()
+    fun_l6_n758
+end
+
+def fun_l5_n498()
+    fun_l6_n677
+end
+
+def fun_l5_n499()
+    fun_l6_n573
+end
+
+def fun_l5_n500()
+    fun_l6_n576
+end
+
+def fun_l5_n501()
+    fun_l6_n654
+end
+
+def fun_l5_n502()
+    fun_l6_n497
+end
+
+def fun_l5_n503()
+    fun_l6_n75
+end
+
+def fun_l5_n504()
+    fun_l6_n660
+end
+
+def fun_l5_n505()
+    fun_l6_n923
+end
+
+def fun_l5_n506()
+    fun_l6_n250
+end
+
+def fun_l5_n507()
+    fun_l6_n648
+end
+
+def fun_l5_n508()
+    fun_l6_n785
+end
+
+def fun_l5_n509()
+    fun_l6_n158
+end
+
+def fun_l5_n510()
+    fun_l6_n564
+end
+
+def fun_l5_n511()
+    fun_l6_n916
+end
+
+def fun_l5_n512()
+    fun_l6_n943
+end
+
+def fun_l5_n513()
+    fun_l6_n468
+end
+
+def fun_l5_n514()
+    fun_l6_n165
+end
+
+def fun_l5_n515()
+    fun_l6_n566
+end
+
+def fun_l5_n516()
+    fun_l6_n280
+end
+
+def fun_l5_n517()
+    fun_l6_n998
+end
+
+def fun_l5_n518()
+    fun_l6_n282
+end
+
+def fun_l5_n519()
+    fun_l6_n419
+end
+
+def fun_l5_n520()
+    fun_l6_n10
+end
+
+def fun_l5_n521()
+    fun_l6_n298
+end
+
+def fun_l5_n522()
+    fun_l6_n571
+end
+
+def fun_l5_n523()
+    fun_l6_n873
+end
+
+def fun_l5_n524()
+    fun_l6_n165
+end
+
+def fun_l5_n525()
+    fun_l6_n807
+end
+
+def fun_l5_n526()
+    fun_l6_n194
+end
+
+def fun_l5_n527()
+    fun_l6_n410
+end
+
+def fun_l5_n528()
+    fun_l6_n377
+end
+
+def fun_l5_n529()
+    fun_l6_n328
+end
+
+def fun_l5_n530()
+    fun_l6_n322
+end
+
+def fun_l5_n531()
+    fun_l6_n760
+end
+
+def fun_l5_n532()
+    fun_l6_n738
+end
+
+def fun_l5_n533()
+    fun_l6_n388
+end
+
+def fun_l5_n534()
+    fun_l6_n609
+end
+
+def fun_l5_n535()
+    fun_l6_n808
+end
+
+def fun_l5_n536()
+    fun_l6_n686
+end
+
+def fun_l5_n537()
+    fun_l6_n825
+end
+
+def fun_l5_n538()
+    fun_l6_n940
+end
+
+def fun_l5_n539()
+    fun_l6_n147
+end
+
+def fun_l5_n540()
+    fun_l6_n851
+end
+
+def fun_l5_n541()
+    fun_l6_n983
+end
+
+def fun_l5_n542()
+    fun_l6_n938
+end
+
+def fun_l5_n543()
+    fun_l6_n323
+end
+
+def fun_l5_n544()
+    fun_l6_n662
+end
+
+def fun_l5_n545()
+    fun_l6_n611
+end
+
+def fun_l5_n546()
+    fun_l6_n185
+end
+
+def fun_l5_n547()
+    fun_l6_n321
+end
+
+def fun_l5_n548()
+    fun_l6_n353
+end
+
+def fun_l5_n549()
+    fun_l6_n240
+end
+
+def fun_l5_n550()
+    fun_l6_n69
+end
+
+def fun_l5_n551()
+    fun_l6_n58
+end
+
+def fun_l5_n552()
+    fun_l6_n108
+end
+
+def fun_l5_n553()
+    fun_l6_n169
+end
+
+def fun_l5_n554()
+    fun_l6_n649
+end
+
+def fun_l5_n555()
+    fun_l6_n28
+end
+
+def fun_l5_n556()
+    fun_l6_n136
+end
+
+def fun_l5_n557()
+    fun_l6_n958
+end
+
+def fun_l5_n558()
+    fun_l6_n107
+end
+
+def fun_l5_n559()
+    fun_l6_n495
+end
+
+def fun_l5_n560()
+    fun_l6_n927
+end
+
+def fun_l5_n561()
+    fun_l6_n994
+end
+
+def fun_l5_n562()
+    fun_l6_n134
+end
+
+def fun_l5_n563()
+    fun_l6_n393
+end
+
+def fun_l5_n564()
+    fun_l6_n73
+end
+
+def fun_l5_n565()
+    fun_l6_n860
+end
+
+def fun_l5_n566()
+    fun_l6_n763
+end
+
+def fun_l5_n567()
+    fun_l6_n545
+end
+
+def fun_l5_n568()
+    fun_l6_n429
+end
+
+def fun_l5_n569()
+    fun_l6_n430
+end
+
+def fun_l5_n570()
+    fun_l6_n50
+end
+
+def fun_l5_n571()
+    fun_l6_n574
+end
+
+def fun_l5_n572()
+    fun_l6_n195
+end
+
+def fun_l5_n573()
+    fun_l6_n327
+end
+
+def fun_l5_n574()
+    fun_l6_n207
+end
+
+def fun_l5_n575()
+    fun_l6_n669
+end
+
+def fun_l5_n576()
+    fun_l6_n978
+end
+
+def fun_l5_n577()
+    fun_l6_n60
+end
+
+def fun_l5_n578()
+    fun_l6_n561
+end
+
+def fun_l5_n579()
+    fun_l6_n298
+end
+
+def fun_l5_n580()
+    fun_l6_n790
+end
+
+def fun_l5_n581()
+    fun_l6_n887
+end
+
+def fun_l5_n582()
+    fun_l6_n516
+end
+
+def fun_l5_n583()
+    fun_l6_n895
+end
+
+def fun_l5_n584()
+    fun_l6_n345
+end
+
+def fun_l5_n585()
+    fun_l6_n117
+end
+
+def fun_l5_n586()
+    fun_l6_n493
+end
+
+def fun_l5_n587()
+    fun_l6_n84
+end
+
+def fun_l5_n588()
+    fun_l6_n62
+end
+
+def fun_l5_n589()
+    fun_l6_n91
+end
+
+def fun_l5_n590()
+    fun_l6_n113
+end
+
+def fun_l5_n591()
+    fun_l6_n568
+end
+
+def fun_l5_n592()
+    fun_l6_n273
+end
+
+def fun_l5_n593()
+    fun_l6_n557
+end
+
+def fun_l5_n594()
+    fun_l6_n528
+end
+
+def fun_l5_n595()
+    fun_l6_n283
+end
+
+def fun_l5_n596()
+    fun_l6_n962
+end
+
+def fun_l5_n597()
+    fun_l6_n140
+end
+
+def fun_l5_n598()
+    fun_l6_n780
+end
+
+def fun_l5_n599()
+    fun_l6_n220
+end
+
+def fun_l5_n600()
+    fun_l6_n43
+end
+
+def fun_l5_n601()
+    fun_l6_n256
+end
+
+def fun_l5_n602()
+    fun_l6_n619
+end
+
+def fun_l5_n603()
+    fun_l6_n873
+end
+
+def fun_l5_n604()
+    fun_l6_n975
+end
+
+def fun_l5_n605()
+    fun_l6_n308
+end
+
+def fun_l5_n606()
+    fun_l6_n519
+end
+
+def fun_l5_n607()
+    fun_l6_n356
+end
+
+def fun_l5_n608()
+    fun_l6_n7
+end
+
+def fun_l5_n609()
+    fun_l6_n161
+end
+
+def fun_l5_n610()
+    fun_l6_n122
+end
+
+def fun_l5_n611()
+    fun_l6_n311
+end
+
+def fun_l5_n612()
+    fun_l6_n130
+end
+
+def fun_l5_n613()
+    fun_l6_n603
+end
+
+def fun_l5_n614()
+    fun_l6_n53
+end
+
+def fun_l5_n615()
+    fun_l6_n478
+end
+
+def fun_l5_n616()
+    fun_l6_n585
+end
+
+def fun_l5_n617()
+    fun_l6_n639
+end
+
+def fun_l5_n618()
+    fun_l6_n943
+end
+
+def fun_l5_n619()
+    fun_l6_n432
+end
+
+def fun_l5_n620()
+    fun_l6_n959
+end
+
+def fun_l5_n621()
+    fun_l6_n220
+end
+
+def fun_l5_n622()
+    fun_l6_n243
+end
+
+def fun_l5_n623()
+    fun_l6_n755
+end
+
+def fun_l5_n624()
+    fun_l6_n312
+end
+
+def fun_l5_n625()
+    fun_l6_n61
+end
+
+def fun_l5_n626()
+    fun_l6_n290
+end
+
+def fun_l5_n627()
+    fun_l6_n452
+end
+
+def fun_l5_n628()
+    fun_l6_n225
+end
+
+def fun_l5_n629()
+    fun_l6_n69
+end
+
+def fun_l5_n630()
+    fun_l6_n329
+end
+
+def fun_l5_n631()
+    fun_l6_n24
+end
+
+def fun_l5_n632()
+    fun_l6_n798
+end
+
+def fun_l5_n633()
+    fun_l6_n931
+end
+
+def fun_l5_n634()
+    fun_l6_n801
+end
+
+def fun_l5_n635()
+    fun_l6_n725
+end
+
+def fun_l5_n636()
+    fun_l6_n839
+end
+
+def fun_l5_n637()
+    fun_l6_n870
+end
+
+def fun_l5_n638()
+    fun_l6_n847
+end
+
+def fun_l5_n639()
+    fun_l6_n448
+end
+
+def fun_l5_n640()
+    fun_l6_n46
+end
+
+def fun_l5_n641()
+    fun_l6_n359
+end
+
+def fun_l5_n642()
+    fun_l6_n102
+end
+
+def fun_l5_n643()
+    fun_l6_n149
+end
+
+def fun_l5_n644()
+    fun_l6_n126
+end
+
+def fun_l5_n645()
+    fun_l6_n72
+end
+
+def fun_l5_n646()
+    fun_l6_n320
+end
+
+def fun_l5_n647()
+    fun_l6_n483
+end
+
+def fun_l5_n648()
+    fun_l6_n797
+end
+
+def fun_l5_n649()
+    fun_l6_n130
+end
+
+def fun_l5_n650()
+    fun_l6_n711
+end
+
+def fun_l5_n651()
+    fun_l6_n979
+end
+
+def fun_l5_n652()
+    fun_l6_n534
+end
+
+def fun_l5_n653()
+    fun_l6_n335
+end
+
+def fun_l5_n654()
+    fun_l6_n181
+end
+
+def fun_l5_n655()
+    fun_l6_n435
+end
+
+def fun_l5_n656()
+    fun_l6_n412
+end
+
+def fun_l5_n657()
+    fun_l6_n247
+end
+
+def fun_l5_n658()
+    fun_l6_n450
+end
+
+def fun_l5_n659()
+    fun_l6_n367
+end
+
+def fun_l5_n660()
+    fun_l6_n220
+end
+
+def fun_l5_n661()
+    fun_l6_n410
+end
+
+def fun_l5_n662()
+    fun_l6_n739
+end
+
+def fun_l5_n663()
+    fun_l6_n846
+end
+
+def fun_l5_n664()
+    fun_l6_n238
+end
+
+def fun_l5_n665()
+    fun_l6_n419
+end
+
+def fun_l5_n666()
+    fun_l6_n687
+end
+
+def fun_l5_n667()
+    fun_l6_n229
+end
+
+def fun_l5_n668()
+    fun_l6_n129
+end
+
+def fun_l5_n669()
+    fun_l6_n767
+end
+
+def fun_l5_n670()
+    fun_l6_n809
+end
+
+def fun_l5_n671()
+    fun_l6_n301
+end
+
+def fun_l5_n672()
+    fun_l6_n268
+end
+
+def fun_l5_n673()
+    fun_l6_n635
+end
+
+def fun_l5_n674()
+    fun_l6_n623
+end
+
+def fun_l5_n675()
+    fun_l6_n601
+end
+
+def fun_l5_n676()
+    fun_l6_n464
+end
+
+def fun_l5_n677()
+    fun_l6_n285
+end
+
+def fun_l5_n678()
+    fun_l6_n536
+end
+
+def fun_l5_n679()
+    fun_l6_n233
+end
+
+def fun_l5_n680()
+    fun_l6_n78
+end
+
+def fun_l5_n681()
+    fun_l6_n644
+end
+
+def fun_l5_n682()
+    fun_l6_n289
+end
+
+def fun_l5_n683()
+    fun_l6_n314
+end
+
+def fun_l5_n684()
+    fun_l6_n743
+end
+
+def fun_l5_n685()
+    fun_l6_n444
+end
+
+def fun_l5_n686()
+    fun_l6_n645
+end
+
+def fun_l5_n687()
+    fun_l6_n800
+end
+
+def fun_l5_n688()
+    fun_l6_n507
+end
+
+def fun_l5_n689()
+    fun_l6_n675
+end
+
+def fun_l5_n690()
+    fun_l6_n231
+end
+
+def fun_l5_n691()
+    fun_l6_n595
+end
+
+def fun_l5_n692()
+    fun_l6_n675
+end
+
+def fun_l5_n693()
+    fun_l6_n555
+end
+
+def fun_l5_n694()
+    fun_l6_n35
+end
+
+def fun_l5_n695()
+    fun_l6_n342
+end
+
+def fun_l5_n696()
+    fun_l6_n250
+end
+
+def fun_l5_n697()
+    fun_l6_n706
+end
+
+def fun_l5_n698()
+    fun_l6_n550
+end
+
+def fun_l5_n699()
+    fun_l6_n446
+end
+
+def fun_l5_n700()
+    fun_l6_n190
+end
+
+def fun_l5_n701()
+    fun_l6_n404
+end
+
+def fun_l5_n702()
+    fun_l6_n545
+end
+
+def fun_l5_n703()
+    fun_l6_n721
+end
+
+def fun_l5_n704()
+    fun_l6_n681
+end
+
+def fun_l5_n705()
+    fun_l6_n760
+end
+
+def fun_l5_n706()
+    fun_l6_n853
+end
+
+def fun_l5_n707()
+    fun_l6_n847
+end
+
+def fun_l5_n708()
+    fun_l6_n661
+end
+
+def fun_l5_n709()
+    fun_l6_n257
+end
+
+def fun_l5_n710()
+    fun_l6_n151
+end
+
+def fun_l5_n711()
+    fun_l6_n120
+end
+
+def fun_l5_n712()
+    fun_l6_n701
+end
+
+def fun_l5_n713()
+    fun_l6_n89
+end
+
+def fun_l5_n714()
+    fun_l6_n443
+end
+
+def fun_l5_n715()
+    fun_l6_n969
+end
+
+def fun_l5_n716()
+    fun_l6_n879
+end
+
+def fun_l5_n717()
+    fun_l6_n525
+end
+
+def fun_l5_n718()
+    fun_l6_n471
+end
+
+def fun_l5_n719()
+    fun_l6_n762
+end
+
+def fun_l5_n720()
+    fun_l6_n803
+end
+
+def fun_l5_n721()
+    fun_l6_n741
+end
+
+def fun_l5_n722()
+    fun_l6_n279
+end
+
+def fun_l5_n723()
+    fun_l6_n903
+end
+
+def fun_l5_n724()
+    fun_l6_n20
+end
+
+def fun_l5_n725()
+    fun_l6_n930
+end
+
+def fun_l5_n726()
+    fun_l6_n504
+end
+
+def fun_l5_n727()
+    fun_l6_n978
+end
+
+def fun_l5_n728()
+    fun_l6_n304
+end
+
+def fun_l5_n729()
+    fun_l6_n133
+end
+
+def fun_l5_n730()
+    fun_l6_n430
+end
+
+def fun_l5_n731()
+    fun_l6_n917
+end
+
+def fun_l5_n732()
+    fun_l6_n987
+end
+
+def fun_l5_n733()
+    fun_l6_n24
+end
+
+def fun_l5_n734()
+    fun_l6_n884
+end
+
+def fun_l5_n735()
+    fun_l6_n928
+end
+
+def fun_l5_n736()
+    fun_l6_n126
+end
+
+def fun_l5_n737()
+    fun_l6_n425
+end
+
+def fun_l5_n738()
+    fun_l6_n113
+end
+
+def fun_l5_n739()
+    fun_l6_n779
+end
+
+def fun_l5_n740()
+    fun_l6_n649
+end
+
+def fun_l5_n741()
+    fun_l6_n352
+end
+
+def fun_l5_n742()
+    fun_l6_n369
+end
+
+def fun_l5_n743()
+    fun_l6_n13
+end
+
+def fun_l5_n744()
+    fun_l6_n460
+end
+
+def fun_l5_n745()
+    fun_l6_n476
+end
+
+def fun_l5_n746()
+    fun_l6_n146
+end
+
+def fun_l5_n747()
+    fun_l6_n38
+end
+
+def fun_l5_n748()
+    fun_l6_n86
+end
+
+def fun_l5_n749()
+    fun_l6_n875
+end
+
+def fun_l5_n750()
+    fun_l6_n812
+end
+
+def fun_l5_n751()
+    fun_l6_n282
+end
+
+def fun_l5_n752()
+    fun_l6_n474
+end
+
+def fun_l5_n753()
+    fun_l6_n546
+end
+
+def fun_l5_n754()
+    fun_l6_n107
+end
+
+def fun_l5_n755()
+    fun_l6_n550
+end
+
+def fun_l5_n756()
+    fun_l6_n868
+end
+
+def fun_l5_n757()
+    fun_l6_n149
+end
+
+def fun_l5_n758()
+    fun_l6_n662
+end
+
+def fun_l5_n759()
+    fun_l6_n642
+end
+
+def fun_l5_n760()
+    fun_l6_n760
+end
+
+def fun_l5_n761()
+    fun_l6_n530
+end
+
+def fun_l5_n762()
+    fun_l6_n765
+end
+
+def fun_l5_n763()
+    fun_l6_n634
+end
+
+def fun_l5_n764()
+    fun_l6_n946
+end
+
+def fun_l5_n765()
+    fun_l6_n423
+end
+
+def fun_l5_n766()
+    fun_l6_n478
+end
+
+def fun_l5_n767()
+    fun_l6_n142
+end
+
+def fun_l5_n768()
+    fun_l6_n550
+end
+
+def fun_l5_n769()
+    fun_l6_n610
+end
+
+def fun_l5_n770()
+    fun_l6_n340
+end
+
+def fun_l5_n771()
+    fun_l6_n29
+end
+
+def fun_l5_n772()
+    fun_l6_n164
+end
+
+def fun_l5_n773()
+    fun_l6_n476
+end
+
+def fun_l5_n774()
+    fun_l6_n48
+end
+
+def fun_l5_n775()
+    fun_l6_n123
+end
+
+def fun_l5_n776()
+    fun_l6_n879
+end
+
+def fun_l5_n777()
+    fun_l6_n958
+end
+
+def fun_l5_n778()
+    fun_l6_n100
+end
+
+def fun_l5_n779()
+    fun_l6_n927
+end
+
+def fun_l5_n780()
+    fun_l6_n105
+end
+
+def fun_l5_n781()
+    fun_l6_n360
+end
+
+def fun_l5_n782()
+    fun_l6_n327
+end
+
+def fun_l5_n783()
+    fun_l6_n677
+end
+
+def fun_l5_n784()
+    fun_l6_n378
+end
+
+def fun_l5_n785()
+    fun_l6_n9
+end
+
+def fun_l5_n786()
+    fun_l6_n692
+end
+
+def fun_l5_n787()
+    fun_l6_n952
+end
+
+def fun_l5_n788()
+    fun_l6_n156
+end
+
+def fun_l5_n789()
+    fun_l6_n222
+end
+
+def fun_l5_n790()
+    fun_l6_n419
+end
+
+def fun_l5_n791()
+    fun_l6_n128
+end
+
+def fun_l5_n792()
+    fun_l6_n311
+end
+
+def fun_l5_n793()
+    fun_l6_n610
+end
+
+def fun_l5_n794()
+    fun_l6_n897
+end
+
+def fun_l5_n795()
+    fun_l6_n806
+end
+
+def fun_l5_n796()
+    fun_l6_n291
+end
+
+def fun_l5_n797()
+    fun_l6_n942
+end
+
+def fun_l5_n798()
+    fun_l6_n208
+end
+
+def fun_l5_n799()
+    fun_l6_n776
+end
+
+def fun_l5_n800()
+    fun_l6_n866
+end
+
+def fun_l5_n801()
+    fun_l6_n132
+end
+
+def fun_l5_n802()
+    fun_l6_n436
+end
+
+def fun_l5_n803()
+    fun_l6_n804
+end
+
+def fun_l5_n804()
+    fun_l6_n810
+end
+
+def fun_l5_n805()
+    fun_l6_n302
+end
+
+def fun_l5_n806()
+    fun_l6_n501
+end
+
+def fun_l5_n807()
+    fun_l6_n812
+end
+
+def fun_l5_n808()
+    fun_l6_n861
+end
+
+def fun_l5_n809()
+    fun_l6_n359
+end
+
+def fun_l5_n810()
+    fun_l6_n366
+end
+
+def fun_l5_n811()
+    fun_l6_n855
+end
+
+def fun_l5_n812()
+    fun_l6_n960
+end
+
+def fun_l5_n813()
+    fun_l6_n868
+end
+
+def fun_l5_n814()
+    fun_l6_n101
+end
+
+def fun_l5_n815()
+    fun_l6_n540
+end
+
+def fun_l5_n816()
+    fun_l6_n486
+end
+
+def fun_l5_n817()
+    fun_l6_n896
+end
+
+def fun_l5_n818()
+    fun_l6_n240
+end
+
+def fun_l5_n819()
+    fun_l6_n425
+end
+
+def fun_l5_n820()
+    fun_l6_n408
+end
+
+def fun_l5_n821()
+    fun_l6_n779
+end
+
+def fun_l5_n822()
+    fun_l6_n486
+end
+
+def fun_l5_n823()
+    fun_l6_n903
+end
+
+def fun_l5_n824()
+    fun_l6_n957
+end
+
+def fun_l5_n825()
+    fun_l6_n213
+end
+
+def fun_l5_n826()
+    fun_l6_n326
+end
+
+def fun_l5_n827()
+    fun_l6_n944
+end
+
+def fun_l5_n828()
+    fun_l6_n772
+end
+
+def fun_l5_n829()
+    fun_l6_n879
+end
+
+def fun_l5_n830()
+    fun_l6_n406
+end
+
+def fun_l5_n831()
+    fun_l6_n488
+end
+
+def fun_l5_n832()
+    fun_l6_n615
+end
+
+def fun_l5_n833()
+    fun_l6_n113
+end
+
+def fun_l5_n834()
+    fun_l6_n826
+end
+
+def fun_l5_n835()
+    fun_l6_n621
+end
+
+def fun_l5_n836()
+    fun_l6_n520
+end
+
+def fun_l5_n837()
+    fun_l6_n729
+end
+
+def fun_l5_n838()
+    fun_l6_n83
+end
+
+def fun_l5_n839()
+    fun_l6_n616
+end
+
+def fun_l5_n840()
+    fun_l6_n477
+end
+
+def fun_l5_n841()
+    fun_l6_n25
+end
+
+def fun_l5_n842()
+    fun_l6_n391
+end
+
+def fun_l5_n843()
+    fun_l6_n974
+end
+
+def fun_l5_n844()
+    fun_l6_n970
+end
+
+def fun_l5_n845()
+    fun_l6_n316
+end
+
+def fun_l5_n846()
+    fun_l6_n596
+end
+
+def fun_l5_n847()
+    fun_l6_n518
+end
+
+def fun_l5_n848()
+    fun_l6_n437
+end
+
+def fun_l5_n849()
+    fun_l6_n268
+end
+
+def fun_l5_n850()
+    fun_l6_n347
+end
+
+def fun_l5_n851()
+    fun_l6_n110
+end
+
+def fun_l5_n852()
+    fun_l6_n783
+end
+
+def fun_l5_n853()
+    fun_l6_n503
+end
+
+def fun_l5_n854()
+    fun_l6_n56
+end
+
+def fun_l5_n855()
+    fun_l6_n294
+end
+
+def fun_l5_n856()
+    fun_l6_n145
+end
+
+def fun_l5_n857()
+    fun_l6_n627
+end
+
+def fun_l5_n858()
+    fun_l6_n917
+end
+
+def fun_l5_n859()
+    fun_l6_n242
+end
+
+def fun_l5_n860()
+    fun_l6_n35
+end
+
+def fun_l5_n861()
+    fun_l6_n883
+end
+
+def fun_l5_n862()
+    fun_l6_n766
+end
+
+def fun_l5_n863()
+    fun_l6_n877
+end
+
+def fun_l5_n864()
+    fun_l6_n974
+end
+
+def fun_l5_n865()
+    fun_l6_n525
+end
+
+def fun_l5_n866()
+    fun_l6_n490
+end
+
+def fun_l5_n867()
+    fun_l6_n920
+end
+
+def fun_l5_n868()
+    fun_l6_n28
+end
+
+def fun_l5_n869()
+    fun_l6_n855
+end
+
+def fun_l5_n870()
+    fun_l6_n246
+end
+
+def fun_l5_n871()
+    fun_l6_n60
+end
+
+def fun_l5_n872()
+    fun_l6_n868
+end
+
+def fun_l5_n873()
+    fun_l6_n706
+end
+
+def fun_l5_n874()
+    fun_l6_n629
+end
+
+def fun_l5_n875()
+    fun_l6_n44
+end
+
+def fun_l5_n876()
+    fun_l6_n521
+end
+
+def fun_l5_n877()
+    fun_l6_n607
+end
+
+def fun_l5_n878()
+    fun_l6_n385
+end
+
+def fun_l5_n879()
+    fun_l6_n109
+end
+
+def fun_l5_n880()
+    fun_l6_n296
+end
+
+def fun_l5_n881()
+    fun_l6_n466
+end
+
+def fun_l5_n882()
+    fun_l6_n933
+end
+
+def fun_l5_n883()
+    fun_l6_n529
+end
+
+def fun_l5_n884()
+    fun_l6_n863
+end
+
+def fun_l5_n885()
+    fun_l6_n112
+end
+
+def fun_l5_n886()
+    fun_l6_n262
+end
+
+def fun_l5_n887()
+    fun_l6_n853
+end
+
+def fun_l5_n888()
+    fun_l6_n657
+end
+
+def fun_l5_n889()
+    fun_l6_n860
+end
+
+def fun_l5_n890()
+    fun_l6_n878
+end
+
+def fun_l5_n891()
+    fun_l6_n810
+end
+
+def fun_l5_n892()
+    fun_l6_n285
+end
+
+def fun_l5_n893()
+    fun_l6_n319
+end
+
+def fun_l5_n894()
+    fun_l6_n927
+end
+
+def fun_l5_n895()
+    fun_l6_n530
+end
+
+def fun_l5_n896()
+    fun_l6_n874
+end
+
+def fun_l5_n897()
+    fun_l6_n522
+end
+
+def fun_l5_n898()
+    fun_l6_n31
+end
+
+def fun_l5_n899()
+    fun_l6_n292
+end
+
+def fun_l5_n900()
+    fun_l6_n847
+end
+
+def fun_l5_n901()
+    fun_l6_n989
+end
+
+def fun_l5_n902()
+    fun_l6_n435
+end
+
+def fun_l5_n903()
+    fun_l6_n368
+end
+
+def fun_l5_n904()
+    fun_l6_n320
+end
+
+def fun_l5_n905()
+    fun_l6_n889
+end
+
+def fun_l5_n906()
+    fun_l6_n101
+end
+
+def fun_l5_n907()
+    fun_l6_n717
+end
+
+def fun_l5_n908()
+    fun_l6_n456
+end
+
+def fun_l5_n909()
+    fun_l6_n448
+end
+
+def fun_l5_n910()
+    fun_l6_n523
+end
+
+def fun_l5_n911()
+    fun_l6_n604
+end
+
+def fun_l5_n912()
+    fun_l6_n429
+end
+
+def fun_l5_n913()
+    fun_l6_n947
+end
+
+def fun_l5_n914()
+    fun_l6_n804
+end
+
+def fun_l5_n915()
+    fun_l6_n665
+end
+
+def fun_l5_n916()
+    fun_l6_n195
+end
+
+def fun_l5_n917()
+    fun_l6_n803
+end
+
+def fun_l5_n918()
+    fun_l6_n957
+end
+
+def fun_l5_n919()
+    fun_l6_n187
+end
+
+def fun_l5_n920()
+    fun_l6_n489
+end
+
+def fun_l5_n921()
+    fun_l6_n315
+end
+
+def fun_l5_n922()
+    fun_l6_n216
+end
+
+def fun_l5_n923()
+    fun_l6_n482
+end
+
+def fun_l5_n924()
+    fun_l6_n20
+end
+
+def fun_l5_n925()
+    fun_l6_n941
+end
+
+def fun_l5_n926()
+    fun_l6_n73
+end
+
+def fun_l5_n927()
+    fun_l6_n563
+end
+
+def fun_l5_n928()
+    fun_l6_n179
+end
+
+def fun_l5_n929()
+    fun_l6_n861
+end
+
+def fun_l5_n930()
+    fun_l6_n811
+end
+
+def fun_l5_n931()
+    fun_l6_n996
+end
+
+def fun_l5_n932()
+    fun_l6_n25
+end
+
+def fun_l5_n933()
+    fun_l6_n232
+end
+
+def fun_l5_n934()
+    fun_l6_n671
+end
+
+def fun_l5_n935()
+    fun_l6_n162
+end
+
+def fun_l5_n936()
+    fun_l6_n363
+end
+
+def fun_l5_n937()
+    fun_l6_n517
+end
+
+def fun_l5_n938()
+    fun_l6_n655
+end
+
+def fun_l5_n939()
+    fun_l6_n825
+end
+
+def fun_l5_n940()
+    fun_l6_n58
+end
+
+def fun_l5_n941()
+    fun_l6_n440
+end
+
+def fun_l5_n942()
+    fun_l6_n106
+end
+
+def fun_l5_n943()
+    fun_l6_n218
+end
+
+def fun_l5_n944()
+    fun_l6_n580
+end
+
+def fun_l5_n945()
+    fun_l6_n63
+end
+
+def fun_l5_n946()
+    fun_l6_n116
+end
+
+def fun_l5_n947()
+    fun_l6_n329
+end
+
+def fun_l5_n948()
+    fun_l6_n511
+end
+
+def fun_l5_n949()
+    fun_l6_n499
+end
+
+def fun_l5_n950()
+    fun_l6_n469
+end
+
+def fun_l5_n951()
+    fun_l6_n18
+end
+
+def fun_l5_n952()
+    fun_l6_n200
+end
+
+def fun_l5_n953()
+    fun_l6_n924
+end
+
+def fun_l5_n954()
+    fun_l6_n879
+end
+
+def fun_l5_n955()
+    fun_l6_n959
+end
+
+def fun_l5_n956()
+    fun_l6_n867
+end
+
+def fun_l5_n957()
+    fun_l6_n650
+end
+
+def fun_l5_n958()
+    fun_l6_n481
+end
+
+def fun_l5_n959()
+    fun_l6_n892
+end
+
+def fun_l5_n960()
+    fun_l6_n499
+end
+
+def fun_l5_n961()
+    fun_l6_n406
+end
+
+def fun_l5_n962()
+    fun_l6_n762
+end
+
+def fun_l5_n963()
+    fun_l6_n479
+end
+
+def fun_l5_n964()
+    fun_l6_n869
+end
+
+def fun_l5_n965()
+    fun_l6_n321
+end
+
+def fun_l5_n966()
+    fun_l6_n722
+end
+
+def fun_l5_n967()
+    fun_l6_n834
+end
+
+def fun_l5_n968()
+    fun_l6_n873
+end
+
+def fun_l5_n969()
+    fun_l6_n295
+end
+
+def fun_l5_n970()
+    fun_l6_n394
+end
+
+def fun_l5_n971()
+    fun_l6_n944
+end
+
+def fun_l5_n972()
+    fun_l6_n335
+end
+
+def fun_l5_n973()
+    fun_l6_n958
+end
+
+def fun_l5_n974()
+    fun_l6_n159
+end
+
+def fun_l5_n975()
+    fun_l6_n336
+end
+
+def fun_l5_n976()
+    fun_l6_n979
+end
+
+def fun_l5_n977()
+    fun_l6_n106
+end
+
+def fun_l5_n978()
+    fun_l6_n587
+end
+
+def fun_l5_n979()
+    fun_l6_n693
+end
+
+def fun_l5_n980()
+    fun_l6_n633
+end
+
+def fun_l5_n981()
+    fun_l6_n359
+end
+
+def fun_l5_n982()
+    fun_l6_n118
+end
+
+def fun_l5_n983()
+    fun_l6_n689
+end
+
+def fun_l5_n984()
+    fun_l6_n398
+end
+
+def fun_l5_n985()
+    fun_l6_n985
+end
+
+def fun_l5_n986()
+    fun_l6_n381
+end
+
+def fun_l5_n987()
+    fun_l6_n322
+end
+
+def fun_l5_n988()
+    fun_l6_n817
+end
+
+def fun_l5_n989()
+    fun_l6_n793
+end
+
+def fun_l5_n990()
+    fun_l6_n619
+end
+
+def fun_l5_n991()
+    fun_l6_n876
+end
+
+def fun_l5_n992()
+    fun_l6_n390
+end
+
+def fun_l5_n993()
+    fun_l6_n58
+end
+
+def fun_l5_n994()
+    fun_l6_n545
+end
+
+def fun_l5_n995()
+    fun_l6_n364
+end
+
+def fun_l5_n996()
+    fun_l6_n849
+end
+
+def fun_l5_n997()
+    fun_l6_n185
+end
+
+def fun_l5_n998()
+    fun_l6_n56
+end
+
+def fun_l5_n999()
+    fun_l6_n156
+end
+
+def fun_l6_n0()
+    fun_l7_n367
+end
+
+def fun_l6_n1()
+    fun_l7_n681
+end
+
+def fun_l6_n2()
+    fun_l7_n170
+end
+
+def fun_l6_n3()
+    fun_l7_n39
+end
+
+def fun_l6_n4()
+    fun_l7_n320
+end
+
+def fun_l6_n5()
+    fun_l7_n862
+end
+
+def fun_l6_n6()
+    fun_l7_n604
+end
+
+def fun_l6_n7()
+    fun_l7_n816
+end
+
+def fun_l6_n8()
+    fun_l7_n31
+end
+
+def fun_l6_n9()
+    fun_l7_n285
+end
+
+def fun_l6_n10()
+    fun_l7_n74
+end
+
+def fun_l6_n11()
+    fun_l7_n638
+end
+
+def fun_l6_n12()
+    fun_l7_n471
+end
+
+def fun_l6_n13()
+    fun_l7_n909
+end
+
+def fun_l6_n14()
+    fun_l7_n677
+end
+
+def fun_l6_n15()
+    fun_l7_n603
+end
+
+def fun_l6_n16()
+    fun_l7_n670
+end
+
+def fun_l6_n17()
+    fun_l7_n270
+end
+
+def fun_l6_n18()
+    fun_l7_n10
+end
+
+def fun_l6_n19()
+    fun_l7_n963
+end
+
+def fun_l6_n20()
+    fun_l7_n517
+end
+
+def fun_l6_n21()
+    fun_l7_n956
+end
+
+def fun_l6_n22()
+    fun_l7_n13
+end
+
+def fun_l6_n23()
+    fun_l7_n157
+end
+
+def fun_l6_n24()
+    fun_l7_n828
+end
+
+def fun_l6_n25()
+    fun_l7_n895
+end
+
+def fun_l6_n26()
+    fun_l7_n48
+end
+
+def fun_l6_n27()
+    fun_l7_n760
+end
+
+def fun_l6_n28()
+    fun_l7_n674
+end
+
+def fun_l6_n29()
+    fun_l7_n639
+end
+
+def fun_l6_n30()
+    fun_l7_n395
+end
+
+def fun_l6_n31()
+    fun_l7_n541
+end
+
+def fun_l6_n32()
+    fun_l7_n548
+end
+
+def fun_l6_n33()
+    fun_l7_n348
+end
+
+def fun_l6_n34()
+    fun_l7_n257
+end
+
+def fun_l6_n35()
+    fun_l7_n531
+end
+
+def fun_l6_n36()
+    fun_l7_n210
+end
+
+def fun_l6_n37()
+    fun_l7_n56
+end
+
+def fun_l6_n38()
+    fun_l7_n466
+end
+
+def fun_l6_n39()
+    fun_l7_n369
+end
+
+def fun_l6_n40()
+    fun_l7_n465
+end
+
+def fun_l6_n41()
+    fun_l7_n665
+end
+
+def fun_l6_n42()
+    fun_l7_n662
+end
+
+def fun_l6_n43()
+    fun_l7_n205
+end
+
+def fun_l6_n44()
+    fun_l7_n997
+end
+
+def fun_l6_n45()
+    fun_l7_n840
+end
+
+def fun_l6_n46()
+    fun_l7_n998
+end
+
+def fun_l6_n47()
+    fun_l7_n563
+end
+
+def fun_l6_n48()
+    fun_l7_n442
+end
+
+def fun_l6_n49()
+    fun_l7_n768
+end
+
+def fun_l6_n50()
+    fun_l7_n948
+end
+
+def fun_l6_n51()
+    fun_l7_n773
+end
+
+def fun_l6_n52()
+    fun_l7_n910
+end
+
+def fun_l6_n53()
+    fun_l7_n152
+end
+
+def fun_l6_n54()
+    fun_l7_n277
+end
+
+def fun_l6_n55()
+    fun_l7_n139
+end
+
+def fun_l6_n56()
+    fun_l7_n530
+end
+
+def fun_l6_n57()
+    fun_l7_n587
+end
+
+def fun_l6_n58()
+    fun_l7_n650
+end
+
+def fun_l6_n59()
+    fun_l7_n30
+end
+
+def fun_l6_n60()
+    fun_l7_n31
+end
+
+def fun_l6_n61()
+    fun_l7_n908
+end
+
+def fun_l6_n62()
+    fun_l7_n228
+end
+
+def fun_l6_n63()
+    fun_l7_n210
+end
+
+def fun_l6_n64()
+    fun_l7_n854
+end
+
+def fun_l6_n65()
+    fun_l7_n198
+end
+
+def fun_l6_n66()
+    fun_l7_n183
+end
+
+def fun_l6_n67()
+    fun_l7_n633
+end
+
+def fun_l6_n68()
+    fun_l7_n523
+end
+
+def fun_l6_n69()
+    fun_l7_n392
+end
+
+def fun_l6_n70()
+    fun_l7_n293
+end
+
+def fun_l6_n71()
+    fun_l7_n523
+end
+
+def fun_l6_n72()
+    fun_l7_n314
+end
+
+def fun_l6_n73()
+    fun_l7_n500
+end
+
+def fun_l6_n74()
+    fun_l7_n685
+end
+
+def fun_l6_n75()
+    fun_l7_n692
+end
+
+def fun_l6_n76()
+    fun_l7_n773
+end
+
+def fun_l6_n77()
+    fun_l7_n582
+end
+
+def fun_l6_n78()
+    fun_l7_n934
+end
+
+def fun_l6_n79()
+    fun_l7_n829
+end
+
+def fun_l6_n80()
+    fun_l7_n603
+end
+
+def fun_l6_n81()
+    fun_l7_n735
+end
+
+def fun_l6_n82()
+    fun_l7_n906
+end
+
+def fun_l6_n83()
+    fun_l7_n828
+end
+
+def fun_l6_n84()
+    fun_l7_n945
+end
+
+def fun_l6_n85()
+    fun_l7_n316
+end
+
+def fun_l6_n86()
+    fun_l7_n135
+end
+
+def fun_l6_n87()
+    fun_l7_n444
+end
+
+def fun_l6_n88()
+    fun_l7_n300
+end
+
+def fun_l6_n89()
+    fun_l7_n975
+end
+
+def fun_l6_n90()
+    fun_l7_n385
+end
+
+def fun_l6_n91()
+    fun_l7_n885
+end
+
+def fun_l6_n92()
+    fun_l7_n838
+end
+
+def fun_l6_n93()
+    fun_l7_n769
+end
+
+def fun_l6_n94()
+    fun_l7_n263
+end
+
+def fun_l6_n95()
+    fun_l7_n719
+end
+
+def fun_l6_n96()
+    fun_l7_n585
+end
+
+def fun_l6_n97()
+    fun_l7_n238
+end
+
+def fun_l6_n98()
+    fun_l7_n366
+end
+
+def fun_l6_n99()
+    fun_l7_n498
+end
+
+def fun_l6_n100()
+    fun_l7_n596
+end
+
+def fun_l6_n101()
+    fun_l7_n437
+end
+
+def fun_l6_n102()
+    fun_l7_n441
+end
+
+def fun_l6_n103()
+    fun_l7_n721
+end
+
+def fun_l6_n104()
+    fun_l7_n9
+end
+
+def fun_l6_n105()
+    fun_l7_n412
+end
+
+def fun_l6_n106()
+    fun_l7_n981
+end
+
+def fun_l6_n107()
+    fun_l7_n824
+end
+
+def fun_l6_n108()
+    fun_l7_n255
+end
+
+def fun_l6_n109()
+    fun_l7_n608
+end
+
+def fun_l6_n110()
+    fun_l7_n481
+end
+
+def fun_l6_n111()
+    fun_l7_n804
+end
+
+def fun_l6_n112()
+    fun_l7_n316
+end
+
+def fun_l6_n113()
+    fun_l7_n446
+end
+
+def fun_l6_n114()
+    fun_l7_n123
+end
+
+def fun_l6_n115()
+    fun_l7_n522
+end
+
+def fun_l6_n116()
+    fun_l7_n52
+end
+
+def fun_l6_n117()
+    fun_l7_n559
+end
+
+def fun_l6_n118()
+    fun_l7_n937
+end
+
+def fun_l6_n119()
+    fun_l7_n425
+end
+
+def fun_l6_n120()
+    fun_l7_n112
+end
+
+def fun_l6_n121()
+    fun_l7_n83
+end
+
+def fun_l6_n122()
+    fun_l7_n305
+end
+
+def fun_l6_n123()
+    fun_l7_n157
+end
+
+def fun_l6_n124()
+    fun_l7_n944
+end
+
+def fun_l6_n125()
+    fun_l7_n356
+end
+
+def fun_l6_n126()
+    fun_l7_n69
+end
+
+def fun_l6_n127()
+    fun_l7_n689
+end
+
+def fun_l6_n128()
+    fun_l7_n145
+end
+
+def fun_l6_n129()
+    fun_l7_n633
+end
+
+def fun_l6_n130()
+    fun_l7_n389
+end
+
+def fun_l6_n131()
+    fun_l7_n646
+end
+
+def fun_l6_n132()
+    fun_l7_n684
+end
+
+def fun_l6_n133()
+    fun_l7_n38
+end
+
+def fun_l6_n134()
+    fun_l7_n104
+end
+
+def fun_l6_n135()
+    fun_l7_n856
+end
+
+def fun_l6_n136()
+    fun_l7_n237
+end
+
+def fun_l6_n137()
+    fun_l7_n594
+end
+
+def fun_l6_n138()
+    fun_l7_n929
+end
+
+def fun_l6_n139()
+    fun_l7_n686
+end
+
+def fun_l6_n140()
+    fun_l7_n501
+end
+
+def fun_l6_n141()
+    fun_l7_n309
+end
+
+def fun_l6_n142()
+    fun_l7_n567
+end
+
+def fun_l6_n143()
+    fun_l7_n451
+end
+
+def fun_l6_n144()
+    fun_l7_n325
+end
+
+def fun_l6_n145()
+    fun_l7_n363
+end
+
+def fun_l6_n146()
+    fun_l7_n650
+end
+
+def fun_l6_n147()
+    fun_l7_n551
+end
+
+def fun_l6_n148()
+    fun_l7_n495
+end
+
+def fun_l6_n149()
+    fun_l7_n998
+end
+
+def fun_l6_n150()
+    fun_l7_n584
+end
+
+def fun_l6_n151()
+    fun_l7_n36
+end
+
+def fun_l6_n152()
+    fun_l7_n109
+end
+
+def fun_l6_n153()
+    fun_l7_n855
+end
+
+def fun_l6_n154()
+    fun_l7_n544
+end
+
+def fun_l6_n155()
+    fun_l7_n580
+end
+
+def fun_l6_n156()
+    fun_l7_n872
+end
+
+def fun_l6_n157()
+    fun_l7_n954
+end
+
+def fun_l6_n158()
+    fun_l7_n14
+end
+
+def fun_l6_n159()
+    fun_l7_n802
+end
+
+def fun_l6_n160()
+    fun_l7_n298
+end
+
+def fun_l6_n161()
+    fun_l7_n876
+end
+
+def fun_l6_n162()
+    fun_l7_n694
+end
+
+def fun_l6_n163()
+    fun_l7_n538
+end
+
+def fun_l6_n164()
+    fun_l7_n325
+end
+
+def fun_l6_n165()
+    fun_l7_n47
+end
+
+def fun_l6_n166()
+    fun_l7_n433
+end
+
+def fun_l6_n167()
+    fun_l7_n356
+end
+
+def fun_l6_n168()
+    fun_l7_n81
+end
+
+def fun_l6_n169()
+    fun_l7_n10
+end
+
+def fun_l6_n170()
+    fun_l7_n391
+end
+
+def fun_l6_n171()
+    fun_l7_n770
+end
+
+def fun_l6_n172()
+    fun_l7_n45
+end
+
+def fun_l6_n173()
+    fun_l7_n808
+end
+
+def fun_l6_n174()
+    fun_l7_n722
+end
+
+def fun_l6_n175()
+    fun_l7_n532
+end
+
+def fun_l6_n176()
+    fun_l7_n983
+end
+
+def fun_l6_n177()
+    fun_l7_n666
+end
+
+def fun_l6_n178()
+    fun_l7_n505
+end
+
+def fun_l6_n179()
+    fun_l7_n200
+end
+
+def fun_l6_n180()
+    fun_l7_n57
+end
+
+def fun_l6_n181()
+    fun_l7_n888
+end
+
+def fun_l6_n182()
+    fun_l7_n288
+end
+
+def fun_l6_n183()
+    fun_l7_n435
+end
+
+def fun_l6_n184()
+    fun_l7_n330
+end
+
+def fun_l6_n185()
+    fun_l7_n432
+end
+
+def fun_l6_n186()
+    fun_l7_n321
+end
+
+def fun_l6_n187()
+    fun_l7_n160
+end
+
+def fun_l6_n188()
+    fun_l7_n806
+end
+
+def fun_l6_n189()
+    fun_l7_n929
+end
+
+def fun_l6_n190()
+    fun_l7_n49
+end
+
+def fun_l6_n191()
+    fun_l7_n642
+end
+
+def fun_l6_n192()
+    fun_l7_n551
+end
+
+def fun_l6_n193()
+    fun_l7_n243
+end
+
+def fun_l6_n194()
+    fun_l7_n126
+end
+
+def fun_l6_n195()
+    fun_l7_n594
+end
+
+def fun_l6_n196()
+    fun_l7_n166
+end
+
+def fun_l6_n197()
+    fun_l7_n610
+end
+
+def fun_l6_n198()
+    fun_l7_n730
+end
+
+def fun_l6_n199()
+    fun_l7_n770
+end
+
+def fun_l6_n200()
+    fun_l7_n873
+end
+
+def fun_l6_n201()
+    fun_l7_n833
+end
+
+def fun_l6_n202()
+    fun_l7_n883
+end
+
+def fun_l6_n203()
+    fun_l7_n639
+end
+
+def fun_l6_n204()
+    fun_l7_n563
+end
+
+def fun_l6_n205()
+    fun_l7_n437
+end
+
+def fun_l6_n206()
+    fun_l7_n722
+end
+
+def fun_l6_n207()
+    fun_l7_n785
+end
+
+def fun_l6_n208()
+    fun_l7_n241
+end
+
+def fun_l6_n209()
+    fun_l7_n42
+end
+
+def fun_l6_n210()
+    fun_l7_n352
+end
+
+def fun_l6_n211()
+    fun_l7_n633
+end
+
+def fun_l6_n212()
+    fun_l7_n758
+end
+
+def fun_l6_n213()
+    fun_l7_n194
+end
+
+def fun_l6_n214()
+    fun_l7_n864
+end
+
+def fun_l6_n215()
+    fun_l7_n407
+end
+
+def fun_l6_n216()
+    fun_l7_n78
+end
+
+def fun_l6_n217()
+    fun_l7_n723
+end
+
+def fun_l6_n218()
+    fun_l7_n98
+end
+
+def fun_l6_n219()
+    fun_l7_n909
+end
+
+def fun_l6_n220()
+    fun_l7_n380
+end
+
+def fun_l6_n221()
+    fun_l7_n348
+end
+
+def fun_l6_n222()
+    fun_l7_n934
+end
+
+def fun_l6_n223()
+    fun_l7_n114
+end
+
+def fun_l6_n224()
+    fun_l7_n34
+end
+
+def fun_l6_n225()
+    fun_l7_n774
+end
+
+def fun_l6_n226()
+    fun_l7_n681
+end
+
+def fun_l6_n227()
+    fun_l7_n215
+end
+
+def fun_l6_n228()
+    fun_l7_n526
+end
+
+def fun_l6_n229()
+    fun_l7_n38
+end
+
+def fun_l6_n230()
+    fun_l7_n506
+end
+
+def fun_l6_n231()
+    fun_l7_n456
+end
+
+def fun_l6_n232()
+    fun_l7_n476
+end
+
+def fun_l6_n233()
+    fun_l7_n183
+end
+
+def fun_l6_n234()
+    fun_l7_n73
+end
+
+def fun_l6_n235()
+    fun_l7_n639
+end
+
+def fun_l6_n236()
+    fun_l7_n344
+end
+
+def fun_l6_n237()
+    fun_l7_n656
+end
+
+def fun_l6_n238()
+    fun_l7_n887
+end
+
+def fun_l6_n239()
+    fun_l7_n705
+end
+
+def fun_l6_n240()
+    fun_l7_n342
+end
+
+def fun_l6_n241()
+    fun_l7_n461
+end
+
+def fun_l6_n242()
+    fun_l7_n215
+end
+
+def fun_l6_n243()
+    fun_l7_n74
+end
+
+def fun_l6_n244()
+    fun_l7_n715
+end
+
+def fun_l6_n245()
+    fun_l7_n317
+end
+
+def fun_l6_n246()
+    fun_l7_n238
+end
+
+def fun_l6_n247()
+    fun_l7_n899
+end
+
+def fun_l6_n248()
+    fun_l7_n360
+end
+
+def fun_l6_n249()
+    fun_l7_n753
+end
+
+def fun_l6_n250()
+    fun_l7_n722
+end
+
+def fun_l6_n251()
+    fun_l7_n649
+end
+
+def fun_l6_n252()
+    fun_l7_n640
+end
+
+def fun_l6_n253()
+    fun_l7_n146
+end
+
+def fun_l6_n254()
+    fun_l7_n385
+end
+
+def fun_l6_n255()
+    fun_l7_n483
+end
+
+def fun_l6_n256()
+    fun_l7_n142
+end
+
+def fun_l6_n257()
+    fun_l7_n815
+end
+
+def fun_l6_n258()
+    fun_l7_n499
+end
+
+def fun_l6_n259()
+    fun_l7_n827
+end
+
+def fun_l6_n260()
+    fun_l7_n799
+end
+
+def fun_l6_n261()
+    fun_l7_n633
+end
+
+def fun_l6_n262()
+    fun_l7_n399
+end
+
+def fun_l6_n263()
+    fun_l7_n123
+end
+
+def fun_l6_n264()
+    fun_l7_n94
+end
+
+def fun_l6_n265()
+    fun_l7_n799
+end
+
+def fun_l6_n266()
+    fun_l7_n884
+end
+
+def fun_l6_n267()
+    fun_l7_n983
+end
+
+def fun_l6_n268()
+    fun_l7_n880
+end
+
+def fun_l6_n269()
+    fun_l7_n58
+end
+
+def fun_l6_n270()
+    fun_l7_n181
+end
+
+def fun_l6_n271()
+    fun_l7_n241
+end
+
+def fun_l6_n272()
+    fun_l7_n971
+end
+
+def fun_l6_n273()
+    fun_l7_n297
+end
+
+def fun_l6_n274()
+    fun_l7_n435
+end
+
+def fun_l6_n275()
+    fun_l7_n57
+end
+
+def fun_l6_n276()
+    fun_l7_n665
+end
+
+def fun_l6_n277()
+    fun_l7_n725
+end
+
+def fun_l6_n278()
+    fun_l7_n258
+end
+
+def fun_l6_n279()
+    fun_l7_n680
+end
+
+def fun_l6_n280()
+    fun_l7_n969
+end
+
+def fun_l6_n281()
+    fun_l7_n714
+end
+
+def fun_l6_n282()
+    fun_l7_n166
+end
+
+def fun_l6_n283()
+    fun_l7_n876
+end
+
+def fun_l6_n284()
+    fun_l7_n893
+end
+
+def fun_l6_n285()
+    fun_l7_n530
+end
+
+def fun_l6_n286()
+    fun_l7_n552
+end
+
+def fun_l6_n287()
+    fun_l7_n212
+end
+
+def fun_l6_n288()
+    fun_l7_n194
+end
+
+def fun_l6_n289()
+    fun_l7_n375
+end
+
+def fun_l6_n290()
+    fun_l7_n726
+end
+
+def fun_l6_n291()
+    fun_l7_n498
+end
+
+def fun_l6_n292()
+    fun_l7_n630
+end
+
+def fun_l6_n293()
+    fun_l7_n781
+end
+
+def fun_l6_n294()
+    fun_l7_n122
+end
+
+def fun_l6_n295()
+    fun_l7_n864
+end
+
+def fun_l6_n296()
+    fun_l7_n931
+end
+
+def fun_l6_n297()
+    fun_l7_n561
+end
+
+def fun_l6_n298()
+    fun_l7_n891
+end
+
+def fun_l6_n299()
+    fun_l7_n149
+end
+
+def fun_l6_n300()
+    fun_l7_n697
+end
+
+def fun_l6_n301()
+    fun_l7_n152
+end
+
+def fun_l6_n302()
+    fun_l7_n973
+end
+
+def fun_l6_n303()
+    fun_l7_n32
+end
+
+def fun_l6_n304()
+    fun_l7_n254
+end
+
+def fun_l6_n305()
+    fun_l7_n68
+end
+
+def fun_l6_n306()
+    fun_l7_n46
+end
+
+def fun_l6_n307()
+    fun_l7_n2
+end
+
+def fun_l6_n308()
+    fun_l7_n862
+end
+
+def fun_l6_n309()
+    fun_l7_n722
+end
+
+def fun_l6_n310()
+    fun_l7_n501
+end
+
+def fun_l6_n311()
+    fun_l7_n779
+end
+
+def fun_l6_n312()
+    fun_l7_n899
+end
+
+def fun_l6_n313()
+    fun_l7_n209
+end
+
+def fun_l6_n314()
+    fun_l7_n445
+end
+
+def fun_l6_n315()
+    fun_l7_n882
+end
+
+def fun_l6_n316()
+    fun_l7_n825
+end
+
+def fun_l6_n317()
+    fun_l7_n52
+end
+
+def fun_l6_n318()
+    fun_l7_n813
+end
+
+def fun_l6_n319()
+    fun_l7_n103
+end
+
+def fun_l6_n320()
+    fun_l7_n480
+end
+
+def fun_l6_n321()
+    fun_l7_n357
+end
+
+def fun_l6_n322()
+    fun_l7_n138
+end
+
+def fun_l6_n323()
+    fun_l7_n277
+end
+
+def fun_l6_n324()
+    fun_l7_n287
+end
+
+def fun_l6_n325()
+    fun_l7_n822
+end
+
+def fun_l6_n326()
+    fun_l7_n299
+end
+
+def fun_l6_n327()
+    fun_l7_n617
+end
+
+def fun_l6_n328()
+    fun_l7_n618
+end
+
+def fun_l6_n329()
+    fun_l7_n721
+end
+
+def fun_l6_n330()
+    fun_l7_n600
+end
+
+def fun_l6_n331()
+    fun_l7_n349
+end
+
+def fun_l6_n332()
+    fun_l7_n978
+end
+
+def fun_l6_n333()
+    fun_l7_n889
+end
+
+def fun_l6_n334()
+    fun_l7_n129
+end
+
+def fun_l6_n335()
+    fun_l7_n404
+end
+
+def fun_l6_n336()
+    fun_l7_n169
+end
+
+def fun_l6_n337()
+    fun_l7_n498
+end
+
+def fun_l6_n338()
+    fun_l7_n428
+end
+
+def fun_l6_n339()
+    fun_l7_n910
+end
+
+def fun_l6_n340()
+    fun_l7_n441
+end
+
+def fun_l6_n341()
+    fun_l7_n649
+end
+
+def fun_l6_n342()
+    fun_l7_n251
+end
+
+def fun_l6_n343()
+    fun_l7_n146
+end
+
+def fun_l6_n344()
+    fun_l7_n979
+end
+
+def fun_l6_n345()
+    fun_l7_n561
+end
+
+def fun_l6_n346()
+    fun_l7_n667
+end
+
+def fun_l6_n347()
+    fun_l7_n50
+end
+
+def fun_l6_n348()
+    fun_l7_n324
+end
+
+def fun_l6_n349()
+    fun_l7_n60
+end
+
+def fun_l6_n350()
+    fun_l7_n292
+end
+
+def fun_l6_n351()
+    fun_l7_n227
+end
+
+def fun_l6_n352()
+    fun_l7_n99
+end
+
+def fun_l6_n353()
+    fun_l7_n124
+end
+
+def fun_l6_n354()
+    fun_l7_n519
+end
+
+def fun_l6_n355()
+    fun_l7_n245
+end
+
+def fun_l6_n356()
+    fun_l7_n438
+end
+
+def fun_l6_n357()
+    fun_l7_n916
+end
+
+def fun_l6_n358()
+    fun_l7_n865
+end
+
+def fun_l6_n359()
+    fun_l7_n886
+end
+
+def fun_l6_n360()
+    fun_l7_n432
+end
+
+def fun_l6_n361()
+    fun_l7_n406
+end
+
+def fun_l6_n362()
+    fun_l7_n709
+end
+
+def fun_l6_n363()
+    fun_l7_n271
+end
+
+def fun_l6_n364()
+    fun_l7_n320
+end
+
+def fun_l6_n365()
+    fun_l7_n3
+end
+
+def fun_l6_n366()
+    fun_l7_n831
+end
+
+def fun_l6_n367()
+    fun_l7_n417
+end
+
+def fun_l6_n368()
+    fun_l7_n949
+end
+
+def fun_l6_n369()
+    fun_l7_n941
+end
+
+def fun_l6_n370()
+    fun_l7_n404
+end
+
+def fun_l6_n371()
+    fun_l7_n715
+end
+
+def fun_l6_n372()
+    fun_l7_n223
+end
+
+def fun_l6_n373()
+    fun_l7_n813
+end
+
+def fun_l6_n374()
+    fun_l7_n594
+end
+
+def fun_l6_n375()
+    fun_l7_n949
+end
+
+def fun_l6_n376()
+    fun_l7_n107
+end
+
+def fun_l6_n377()
+    fun_l7_n951
+end
+
+def fun_l6_n378()
+    fun_l7_n940
+end
+
+def fun_l6_n379()
+    fun_l7_n224
+end
+
+def fun_l6_n380()
+    fun_l7_n82
+end
+
+def fun_l6_n381()
+    fun_l7_n815
+end
+
+def fun_l6_n382()
+    fun_l7_n443
+end
+
+def fun_l6_n383()
+    fun_l7_n566
+end
+
+def fun_l6_n384()
+    fun_l7_n954
+end
+
+def fun_l6_n385()
+    fun_l7_n562
+end
+
+def fun_l6_n386()
+    fun_l7_n9
+end
+
+def fun_l6_n387()
+    fun_l7_n233
+end
+
+def fun_l6_n388()
+    fun_l7_n510
+end
+
+def fun_l6_n389()
+    fun_l7_n616
+end
+
+def fun_l6_n390()
+    fun_l7_n991
+end
+
+def fun_l6_n391()
+    fun_l7_n184
+end
+
+def fun_l6_n392()
+    fun_l7_n288
+end
+
+def fun_l6_n393()
+    fun_l7_n282
+end
+
+def fun_l6_n394()
+    fun_l7_n81
+end
+
+def fun_l6_n395()
+    fun_l7_n567
+end
+
+def fun_l6_n396()
+    fun_l7_n465
+end
+
+def fun_l6_n397()
+    fun_l7_n856
+end
+
+def fun_l6_n398()
+    fun_l7_n268
+end
+
+def fun_l6_n399()
+    fun_l7_n695
+end
+
+def fun_l6_n400()
+    fun_l7_n403
+end
+
+def fun_l6_n401()
+    fun_l7_n153
+end
+
+def fun_l6_n402()
+    fun_l7_n321
+end
+
+def fun_l6_n403()
+    fun_l7_n233
+end
+
+def fun_l6_n404()
+    fun_l7_n218
+end
+
+def fun_l6_n405()
+    fun_l7_n285
+end
+
+def fun_l6_n406()
+    fun_l7_n829
+end
+
+def fun_l6_n407()
+    fun_l7_n218
+end
+
+def fun_l6_n408()
+    fun_l7_n457
+end
+
+def fun_l6_n409()
+    fun_l7_n513
+end
+
+def fun_l6_n410()
+    fun_l7_n677
+end
+
+def fun_l6_n411()
+    fun_l7_n849
+end
+
+def fun_l6_n412()
+    fun_l7_n579
+end
+
+def fun_l6_n413()
+    fun_l7_n160
+end
+
+def fun_l6_n414()
+    fun_l7_n567
+end
+
+def fun_l6_n415()
+    fun_l7_n394
+end
+
+def fun_l6_n416()
+    fun_l7_n480
+end
+
+def fun_l6_n417()
+    fun_l7_n234
+end
+
+def fun_l6_n418()
+    fun_l7_n410
+end
+
+def fun_l6_n419()
+    fun_l7_n405
+end
+
+def fun_l6_n420()
+    fun_l7_n497
+end
+
+def fun_l6_n421()
+    fun_l7_n242
+end
+
+def fun_l6_n422()
+    fun_l7_n190
+end
+
+def fun_l6_n423()
+    fun_l7_n513
+end
+
+def fun_l6_n424()
+    fun_l7_n790
+end
+
+def fun_l6_n425()
+    fun_l7_n112
+end
+
+def fun_l6_n426()
+    fun_l7_n792
+end
+
+def fun_l6_n427()
+    fun_l7_n209
+end
+
+def fun_l6_n428()
+    fun_l7_n451
+end
+
+def fun_l6_n429()
+    fun_l7_n897
+end
+
+def fun_l6_n430()
+    fun_l7_n884
+end
+
+def fun_l6_n431()
+    fun_l7_n81
+end
+
+def fun_l6_n432()
+    fun_l7_n764
+end
+
+def fun_l6_n433()
+    fun_l7_n204
+end
+
+def fun_l6_n434()
+    fun_l7_n56
+end
+
+def fun_l6_n435()
+    fun_l7_n394
+end
+
+def fun_l6_n436()
+    fun_l7_n903
+end
+
+def fun_l6_n437()
+    fun_l7_n423
+end
+
+def fun_l6_n438()
+    fun_l7_n899
+end
+
+def fun_l6_n439()
+    fun_l7_n40
+end
+
+def fun_l6_n440()
+    fun_l7_n145
+end
+
+def fun_l6_n441()
+    fun_l7_n811
+end
+
+def fun_l6_n442()
+    fun_l7_n821
+end
+
+def fun_l6_n443()
+    fun_l7_n675
+end
+
+def fun_l6_n444()
+    fun_l7_n665
+end
+
+def fun_l6_n445()
+    fun_l7_n1
+end
+
+def fun_l6_n446()
+    fun_l7_n936
+end
+
+def fun_l6_n447()
+    fun_l7_n838
+end
+
+def fun_l6_n448()
+    fun_l7_n820
+end
+
+def fun_l6_n449()
+    fun_l7_n206
+end
+
+def fun_l6_n450()
+    fun_l7_n234
+end
+
+def fun_l6_n451()
+    fun_l7_n150
+end
+
+def fun_l6_n452()
+    fun_l7_n699
+end
+
+def fun_l6_n453()
+    fun_l7_n369
+end
+
+def fun_l6_n454()
+    fun_l7_n759
+end
+
+def fun_l6_n455()
+    fun_l7_n836
+end
+
+def fun_l6_n456()
+    fun_l7_n55
+end
+
+def fun_l6_n457()
+    fun_l7_n457
+end
+
+def fun_l6_n458()
+    fun_l7_n623
+end
+
+def fun_l6_n459()
+    fun_l7_n679
+end
+
+def fun_l6_n460()
+    fun_l7_n199
+end
+
+def fun_l6_n461()
+    fun_l7_n738
+end
+
+def fun_l6_n462()
+    fun_l7_n479
+end
+
+def fun_l6_n463()
+    fun_l7_n673
+end
+
+def fun_l6_n464()
+    fun_l7_n323
+end
+
+def fun_l6_n465()
+    fun_l7_n652
+end
+
+def fun_l6_n466()
+    fun_l7_n470
+end
+
+def fun_l6_n467()
+    fun_l7_n133
+end
+
+def fun_l6_n468()
+    fun_l7_n179
+end
+
+def fun_l6_n469()
+    fun_l7_n647
+end
+
+def fun_l6_n470()
+    fun_l7_n869
+end
+
+def fun_l6_n471()
+    fun_l7_n553
+end
+
+def fun_l6_n472()
+    fun_l7_n173
+end
+
+def fun_l6_n473()
+    fun_l7_n188
+end
+
+def fun_l6_n474()
+    fun_l7_n530
+end
+
+def fun_l6_n475()
+    fun_l7_n233
+end
+
+def fun_l6_n476()
+    fun_l7_n46
+end
+
+def fun_l6_n477()
+    fun_l7_n892
+end
+
+def fun_l6_n478()
+    fun_l7_n879
+end
+
+def fun_l6_n479()
+    fun_l7_n507
+end
+
+def fun_l6_n480()
+    fun_l7_n383
+end
+
+def fun_l6_n481()
+    fun_l7_n500
+end
+
+def fun_l6_n482()
+    fun_l7_n595
+end
+
+def fun_l6_n483()
+    fun_l7_n225
+end
+
+def fun_l6_n484()
+    fun_l7_n396
+end
+
+def fun_l6_n485()
+    fun_l7_n61
+end
+
+def fun_l6_n486()
+    fun_l7_n953
+end
+
+def fun_l6_n487()
+    fun_l7_n891
+end
+
+def fun_l6_n488()
+    fun_l7_n620
+end
+
+def fun_l6_n489()
+    fun_l7_n672
+end
+
+def fun_l6_n490()
+    fun_l7_n824
+end
+
+def fun_l6_n491()
+    fun_l7_n216
+end
+
+def fun_l6_n492()
+    fun_l7_n404
+end
+
+def fun_l6_n493()
+    fun_l7_n428
+end
+
+def fun_l6_n494()
+    fun_l7_n907
+end
+
+def fun_l6_n495()
+    fun_l7_n297
+end
+
+def fun_l6_n496()
+    fun_l7_n349
+end
+
+def fun_l6_n497()
+    fun_l7_n291
+end
+
+def fun_l6_n498()
+    fun_l7_n642
+end
+
+def fun_l6_n499()
+    fun_l7_n906
+end
+
+def fun_l6_n500()
+    fun_l7_n78
+end
+
+def fun_l6_n501()
+    fun_l7_n568
+end
+
+def fun_l6_n502()
+    fun_l7_n591
+end
+
+def fun_l6_n503()
+    fun_l7_n921
+end
+
+def fun_l6_n504()
+    fun_l7_n832
+end
+
+def fun_l6_n505()
+    fun_l7_n826
+end
+
+def fun_l6_n506()
+    fun_l7_n930
+end
+
+def fun_l6_n507()
+    fun_l7_n791
+end
+
+def fun_l6_n508()
+    fun_l7_n608
+end
+
+def fun_l6_n509()
+    fun_l7_n144
+end
+
+def fun_l6_n510()
+    fun_l7_n202
+end
+
+def fun_l6_n511()
+    fun_l7_n379
+end
+
+def fun_l6_n512()
+    fun_l7_n354
+end
+
+def fun_l6_n513()
+    fun_l7_n245
+end
+
+def fun_l6_n514()
+    fun_l7_n402
+end
+
+def fun_l6_n515()
+    fun_l7_n875
+end
+
+def fun_l6_n516()
+    fun_l7_n847
+end
+
+def fun_l6_n517()
+    fun_l7_n736
+end
+
+def fun_l6_n518()
+    fun_l7_n325
+end
+
+def fun_l6_n519()
+    fun_l7_n949
+end
+
+def fun_l6_n520()
+    fun_l7_n993
+end
+
+def fun_l6_n521()
+    fun_l7_n271
+end
+
+def fun_l6_n522()
+    fun_l7_n799
+end
+
+def fun_l6_n523()
+    fun_l7_n861
+end
+
+def fun_l6_n524()
+    fun_l7_n164
+end
+
+def fun_l6_n525()
+    fun_l7_n293
+end
+
+def fun_l6_n526()
+    fun_l7_n948
+end
+
+def fun_l6_n527()
+    fun_l7_n682
+end
+
+def fun_l6_n528()
+    fun_l7_n914
+end
+
+def fun_l6_n529()
+    fun_l7_n395
+end
+
+def fun_l6_n530()
+    fun_l7_n399
+end
+
+def fun_l6_n531()
+    fun_l7_n220
+end
+
+def fun_l6_n532()
+    fun_l7_n874
+end
+
+def fun_l6_n533()
+    fun_l7_n504
+end
+
+def fun_l6_n534()
+    fun_l7_n713
+end
+
+def fun_l6_n535()
+    fun_l7_n185
+end
+
+def fun_l6_n536()
+    fun_l7_n229
+end
+
+def fun_l6_n537()
+    fun_l7_n696
+end
+
+def fun_l6_n538()
+    fun_l7_n840
+end
+
+def fun_l6_n539()
+    fun_l7_n323
+end
+
+def fun_l6_n540()
+    fun_l7_n342
+end
+
+def fun_l6_n541()
+    fun_l7_n60
+end
+
+def fun_l6_n542()
+    fun_l7_n149
+end
+
+def fun_l6_n543()
+    fun_l7_n465
+end
+
+def fun_l6_n544()
+    fun_l7_n392
+end
+
+def fun_l6_n545()
+    fun_l7_n210
+end
+
+def fun_l6_n546()
+    fun_l7_n565
+end
+
+def fun_l6_n547()
+    fun_l7_n63
+end
+
+def fun_l6_n548()
+    fun_l7_n722
+end
+
+def fun_l6_n549()
+    fun_l7_n119
+end
+
+def fun_l6_n550()
+    fun_l7_n933
+end
+
+def fun_l6_n551()
+    fun_l7_n612
+end
+
+def fun_l6_n552()
+    fun_l7_n479
+end
+
+def fun_l6_n553()
+    fun_l7_n866
+end
+
+def fun_l6_n554()
+    fun_l7_n268
+end
+
+def fun_l6_n555()
+    fun_l7_n547
+end
+
+def fun_l6_n556()
+    fun_l7_n621
+end
+
+def fun_l6_n557()
+    fun_l7_n461
+end
+
+def fun_l6_n558()
+    fun_l7_n907
+end
+
+def fun_l6_n559()
+    fun_l7_n660
+end
+
+def fun_l6_n560()
+    fun_l7_n857
+end
+
+def fun_l6_n561()
+    fun_l7_n398
+end
+
+def fun_l6_n562()
+    fun_l7_n484
+end
+
+def fun_l6_n563()
+    fun_l7_n16
+end
+
+def fun_l6_n564()
+    fun_l7_n697
+end
+
+def fun_l6_n565()
+    fun_l7_n135
+end
+
+def fun_l6_n566()
+    fun_l7_n265
+end
+
+def fun_l6_n567()
+    fun_l7_n627
+end
+
+def fun_l6_n568()
+    fun_l7_n345
+end
+
+def fun_l6_n569()
+    fun_l7_n528
+end
+
+def fun_l6_n570()
+    fun_l7_n926
+end
+
+def fun_l6_n571()
+    fun_l7_n198
+end
+
+def fun_l6_n572()
+    fun_l7_n837
+end
+
+def fun_l6_n573()
+    fun_l7_n95
+end
+
+def fun_l6_n574()
+    fun_l7_n802
+end
+
+def fun_l6_n575()
+    fun_l7_n265
+end
+
+def fun_l6_n576()
+    fun_l7_n884
+end
+
+def fun_l6_n577()
+    fun_l7_n227
+end
+
+def fun_l6_n578()
+    fun_l7_n915
+end
+
+def fun_l6_n579()
+    fun_l7_n221
+end
+
+def fun_l6_n580()
+    fun_l7_n718
+end
+
+def fun_l6_n581()
+    fun_l7_n179
+end
+
+def fun_l6_n582()
+    fun_l7_n975
+end
+
+def fun_l6_n583()
+    fun_l7_n207
+end
+
+def fun_l6_n584()
+    fun_l7_n874
+end
+
+def fun_l6_n585()
+    fun_l7_n540
+end
+
+def fun_l6_n586()
+    fun_l7_n765
+end
+
+def fun_l6_n587()
+    fun_l7_n613
+end
+
+def fun_l6_n588()
+    fun_l7_n853
+end
+
+def fun_l6_n589()
+    fun_l7_n241
+end
+
+def fun_l6_n590()
+    fun_l7_n91
+end
+
+def fun_l6_n591()
+    fun_l7_n383
+end
+
+def fun_l6_n592()
+    fun_l7_n567
+end
+
+def fun_l6_n593()
+    fun_l7_n144
+end
+
+def fun_l6_n594()
+    fun_l7_n663
+end
+
+def fun_l6_n595()
+    fun_l7_n674
+end
+
+def fun_l6_n596()
+    fun_l7_n407
+end
+
+def fun_l6_n597()
+    fun_l7_n207
+end
+
+def fun_l6_n598()
+    fun_l7_n746
+end
+
+def fun_l6_n599()
+    fun_l7_n24
+end
+
+def fun_l6_n600()
+    fun_l7_n150
+end
+
+def fun_l6_n601()
+    fun_l7_n317
+end
+
+def fun_l6_n602()
+    fun_l7_n773
+end
+
+def fun_l6_n603()
+    fun_l7_n932
+end
+
+def fun_l6_n604()
+    fun_l7_n772
+end
+
+def fun_l6_n605()
+    fun_l7_n495
+end
+
+def fun_l6_n606()
+    fun_l7_n526
+end
+
+def fun_l6_n607()
+    fun_l7_n758
+end
+
+def fun_l6_n608()
+    fun_l7_n941
+end
+
+def fun_l6_n609()
+    fun_l7_n998
+end
+
+def fun_l6_n610()
+    fun_l7_n543
+end
+
+def fun_l6_n611()
+    fun_l7_n216
+end
+
+def fun_l6_n612()
+    fun_l7_n445
+end
+
+def fun_l6_n613()
+    fun_l7_n314
+end
+
+def fun_l6_n614()
+    fun_l7_n840
+end
+
+def fun_l6_n615()
+    fun_l7_n722
+end
+
+def fun_l6_n616()
+    fun_l7_n89
+end
+
+def fun_l6_n617()
+    fun_l7_n353
+end
+
+def fun_l6_n618()
+    fun_l7_n800
+end
+
+def fun_l6_n619()
+    fun_l7_n736
+end
+
+def fun_l6_n620()
+    fun_l7_n376
+end
+
+def fun_l6_n621()
+    fun_l7_n24
+end
+
+def fun_l6_n622()
+    fun_l7_n258
+end
+
+def fun_l6_n623()
+    fun_l7_n943
+end
+
+def fun_l6_n624()
+    fun_l7_n963
+end
+
+def fun_l6_n625()
+    fun_l7_n709
+end
+
+def fun_l6_n626()
+    fun_l7_n350
+end
+
+def fun_l6_n627()
+    fun_l7_n322
+end
+
+def fun_l6_n628()
+    fun_l7_n717
+end
+
+def fun_l6_n629()
+    fun_l7_n529
+end
+
+def fun_l6_n630()
+    fun_l7_n365
+end
+
+def fun_l6_n631()
+    fun_l7_n977
+end
+
+def fun_l6_n632()
+    fun_l7_n606
+end
+
+def fun_l6_n633()
+    fun_l7_n712
+end
+
+def fun_l6_n634()
+    fun_l7_n559
+end
+
+def fun_l6_n635()
+    fun_l7_n499
+end
+
+def fun_l6_n636()
+    fun_l7_n871
+end
+
+def fun_l6_n637()
+    fun_l7_n684
+end
+
+def fun_l6_n638()
+    fun_l7_n558
+end
+
+def fun_l6_n639()
+    fun_l7_n333
+end
+
+def fun_l6_n640()
+    fun_l7_n37
+end
+
+def fun_l6_n641()
+    fun_l7_n559
+end
+
+def fun_l6_n642()
+    fun_l7_n17
+end
+
+def fun_l6_n643()
+    fun_l7_n913
+end
+
+def fun_l6_n644()
+    fun_l7_n79
+end
+
+def fun_l6_n645()
+    fun_l7_n402
+end
+
+def fun_l6_n646()
+    fun_l7_n268
+end
+
+def fun_l6_n647()
+    fun_l7_n797
+end
+
+def fun_l6_n648()
+    fun_l7_n985
+end
+
+def fun_l6_n649()
+    fun_l7_n192
+end
+
+def fun_l6_n650()
+    fun_l7_n774
+end
+
+def fun_l6_n651()
+    fun_l7_n805
+end
+
+def fun_l6_n652()
+    fun_l7_n208
+end
+
+def fun_l6_n653()
+    fun_l7_n608
+end
+
+def fun_l6_n654()
+    fun_l7_n714
+end
+
+def fun_l6_n655()
+    fun_l7_n883
+end
+
+def fun_l6_n656()
+    fun_l7_n841
+end
+
+def fun_l6_n657()
+    fun_l7_n646
+end
+
+def fun_l6_n658()
+    fun_l7_n39
+end
+
+def fun_l6_n659()
+    fun_l7_n432
+end
+
+def fun_l6_n660()
+    fun_l7_n177
+end
+
+def fun_l6_n661()
+    fun_l7_n700
+end
+
+def fun_l6_n662()
+    fun_l7_n815
+end
+
+def fun_l6_n663()
+    fun_l7_n553
+end
+
+def fun_l6_n664()
+    fun_l7_n540
+end
+
+def fun_l6_n665()
+    fun_l7_n853
+end
+
+def fun_l6_n666()
+    fun_l7_n526
+end
+
+def fun_l6_n667()
+    fun_l7_n670
+end
+
+def fun_l6_n668()
+    fun_l7_n753
+end
+
+def fun_l6_n669()
+    fun_l7_n811
+end
+
+def fun_l6_n670()
+    fun_l7_n782
+end
+
+def fun_l6_n671()
+    fun_l7_n275
+end
+
+def fun_l6_n672()
+    fun_l7_n884
+end
+
+def fun_l6_n673()
+    fun_l7_n984
+end
+
+def fun_l6_n674()
+    fun_l7_n980
+end
+
+def fun_l6_n675()
+    fun_l7_n341
+end
+
+def fun_l6_n676()
+    fun_l7_n346
+end
+
+def fun_l6_n677()
+    fun_l7_n164
+end
+
+def fun_l6_n678()
+    fun_l7_n600
+end
+
+def fun_l6_n679()
+    fun_l7_n351
+end
+
+def fun_l6_n680()
+    fun_l7_n527
+end
+
+def fun_l6_n681()
+    fun_l7_n206
+end
+
+def fun_l6_n682()
+    fun_l7_n50
+end
+
+def fun_l6_n683()
+    fun_l7_n476
+end
+
+def fun_l6_n684()
+    fun_l7_n684
+end
+
+def fun_l6_n685()
+    fun_l7_n883
+end
+
+def fun_l6_n686()
+    fun_l7_n41
+end
+
+def fun_l6_n687()
+    fun_l7_n382
+end
+
+def fun_l6_n688()
+    fun_l7_n418
+end
+
+def fun_l6_n689()
+    fun_l7_n22
+end
+
+def fun_l6_n690()
+    fun_l7_n543
+end
+
+def fun_l6_n691()
+    fun_l7_n143
+end
+
+def fun_l6_n692()
+    fun_l7_n120
+end
+
+def fun_l6_n693()
+    fun_l7_n431
+end
+
+def fun_l6_n694()
+    fun_l7_n405
+end
+
+def fun_l6_n695()
+    fun_l7_n474
+end
+
+def fun_l6_n696()
+    fun_l7_n117
+end
+
+def fun_l6_n697()
+    fun_l7_n475
+end
+
+def fun_l6_n698()
+    fun_l7_n674
+end
+
+def fun_l6_n699()
+    fun_l7_n398
+end
+
+def fun_l6_n700()
+    fun_l7_n709
+end
+
+def fun_l6_n701()
+    fun_l7_n360
+end
+
+def fun_l6_n702()
+    fun_l7_n241
+end
+
+def fun_l6_n703()
+    fun_l7_n837
+end
+
+def fun_l6_n704()
+    fun_l7_n483
+end
+
+def fun_l6_n705()
+    fun_l7_n943
+end
+
+def fun_l6_n706()
+    fun_l7_n292
+end
+
+def fun_l6_n707()
+    fun_l7_n659
+end
+
+def fun_l6_n708()
+    fun_l7_n657
+end
+
+def fun_l6_n709()
+    fun_l7_n143
+end
+
+def fun_l6_n710()
+    fun_l7_n883
+end
+
+def fun_l6_n711()
+    fun_l7_n764
+end
+
+def fun_l6_n712()
+    fun_l7_n421
+end
+
+def fun_l6_n713()
+    fun_l7_n611
+end
+
+def fun_l6_n714()
+    fun_l7_n657
+end
+
+def fun_l6_n715()
+    fun_l7_n765
+end
+
+def fun_l6_n716()
+    fun_l7_n793
+end
+
+def fun_l6_n717()
+    fun_l7_n752
+end
+
+def fun_l6_n718()
+    fun_l7_n713
+end
+
+def fun_l6_n719()
+    fun_l7_n577
+end
+
+def fun_l6_n720()
+    fun_l7_n422
+end
+
+def fun_l6_n721()
+    fun_l7_n368
+end
+
+def fun_l6_n722()
+    fun_l7_n2
+end
+
+def fun_l6_n723()
+    fun_l7_n739
+end
+
+def fun_l6_n724()
+    fun_l7_n481
+end
+
+def fun_l6_n725()
+    fun_l7_n516
+end
+
+def fun_l6_n726()
+    fun_l7_n266
+end
+
+def fun_l6_n727()
+    fun_l7_n269
+end
+
+def fun_l6_n728()
+    fun_l7_n308
+end
+
+def fun_l6_n729()
+    fun_l7_n915
+end
+
+def fun_l6_n730()
+    fun_l7_n603
+end
+
+def fun_l6_n731()
+    fun_l7_n585
+end
+
+def fun_l6_n732()
+    fun_l7_n182
+end
+
+def fun_l6_n733()
+    fun_l7_n28
+end
+
+def fun_l6_n734()
+    fun_l7_n829
+end
+
+def fun_l6_n735()
+    fun_l7_n365
+end
+
+def fun_l6_n736()
+    fun_l7_n208
+end
+
+def fun_l6_n737()
+    fun_l7_n395
+end
+
+def fun_l6_n738()
+    fun_l7_n745
+end
+
+def fun_l6_n739()
+    fun_l7_n90
+end
+
+def fun_l6_n740()
+    fun_l7_n696
+end
+
+def fun_l6_n741()
+    fun_l7_n730
+end
+
+def fun_l6_n742()
+    fun_l7_n143
+end
+
+def fun_l6_n743()
+    fun_l7_n753
+end
+
+def fun_l6_n744()
+    fun_l7_n484
+end
+
+def fun_l6_n745()
+    fun_l7_n779
+end
+
+def fun_l6_n746()
+    fun_l7_n668
+end
+
+def fun_l6_n747()
+    fun_l7_n331
+end
+
+def fun_l6_n748()
+    fun_l7_n961
+end
+
+def fun_l6_n749()
+    fun_l7_n875
+end
+
+def fun_l6_n750()
+    fun_l7_n541
+end
+
+def fun_l6_n751()
+    fun_l7_n122
+end
+
+def fun_l6_n752()
+    fun_l7_n278
+end
+
+def fun_l6_n753()
+    fun_l7_n510
+end
+
+def fun_l6_n754()
+    fun_l7_n619
+end
+
+def fun_l6_n755()
+    fun_l7_n165
+end
+
+def fun_l6_n756()
+    fun_l7_n537
+end
+
+def fun_l6_n757()
+    fun_l7_n917
+end
+
+def fun_l6_n758()
+    fun_l7_n102
+end
+
+def fun_l6_n759()
+    fun_l7_n504
+end
+
+def fun_l6_n760()
+    fun_l7_n768
+end
+
+def fun_l6_n761()
+    fun_l7_n259
+end
+
+def fun_l6_n762()
+    fun_l7_n371
+end
+
+def fun_l6_n763()
+    fun_l7_n727
+end
+
+def fun_l6_n764()
+    fun_l7_n959
+end
+
+def fun_l6_n765()
+    fun_l7_n191
+end
+
+def fun_l6_n766()
+    fun_l7_n570
+end
+
+def fun_l6_n767()
+    fun_l7_n746
+end
+
+def fun_l6_n768()
+    fun_l7_n133
+end
+
+def fun_l6_n769()
+    fun_l7_n520
+end
+
+def fun_l6_n770()
+    fun_l7_n602
+end
+
+def fun_l6_n771()
+    fun_l7_n722
+end
+
+def fun_l6_n772()
+    fun_l7_n165
+end
+
+def fun_l6_n773()
+    fun_l7_n132
+end
+
+def fun_l6_n774()
+    fun_l7_n328
+end
+
+def fun_l6_n775()
+    fun_l7_n88
+end
+
+def fun_l6_n776()
+    fun_l7_n296
+end
+
+def fun_l6_n777()
+    fun_l7_n389
+end
+
+def fun_l6_n778()
+    fun_l7_n433
+end
+
+def fun_l6_n779()
+    fun_l7_n525
+end
+
+def fun_l6_n780()
+    fun_l7_n736
+end
+
+def fun_l6_n781()
+    fun_l7_n300
+end
+
+def fun_l6_n782()
+    fun_l7_n663
+end
+
+def fun_l6_n783()
+    fun_l7_n33
+end
+
+def fun_l6_n784()
+    fun_l7_n964
+end
+
+def fun_l6_n785()
+    fun_l7_n459
+end
+
+def fun_l6_n786()
+    fun_l7_n397
+end
+
+def fun_l6_n787()
+    fun_l7_n453
+end
+
+def fun_l6_n788()
+    fun_l7_n951
+end
+
+def fun_l6_n789()
+    fun_l7_n485
+end
+
+def fun_l6_n790()
+    fun_l7_n480
+end
+
+def fun_l6_n791()
+    fun_l7_n663
+end
+
+def fun_l6_n792()
+    fun_l7_n245
+end
+
+def fun_l6_n793()
+    fun_l7_n933
+end
+
+def fun_l6_n794()
+    fun_l7_n253
+end
+
+def fun_l6_n795()
+    fun_l7_n746
+end
+
+def fun_l6_n796()
+    fun_l7_n242
+end
+
+def fun_l6_n797()
+    fun_l7_n435
+end
+
+def fun_l6_n798()
+    fun_l7_n982
+end
+
+def fun_l6_n799()
+    fun_l7_n516
+end
+
+def fun_l6_n800()
+    fun_l7_n118
+end
+
+def fun_l6_n801()
+    fun_l7_n787
+end
+
+def fun_l6_n802()
+    fun_l7_n13
+end
+
+def fun_l6_n803()
+    fun_l7_n381
+end
+
+def fun_l6_n804()
+    fun_l7_n601
+end
+
+def fun_l6_n805()
+    fun_l7_n95
+end
+
+def fun_l6_n806()
+    fun_l7_n589
+end
+
+def fun_l6_n807()
+    fun_l7_n33
+end
+
+def fun_l6_n808()
+    fun_l7_n801
+end
+
+def fun_l6_n809()
+    fun_l7_n857
+end
+
+def fun_l6_n810()
+    fun_l7_n23
+end
+
+def fun_l6_n811()
+    fun_l7_n998
+end
+
+def fun_l6_n812()
+    fun_l7_n424
+end
+
+def fun_l6_n813()
+    fun_l7_n525
+end
+
+def fun_l6_n814()
+    fun_l7_n428
+end
+
+def fun_l6_n815()
+    fun_l7_n509
+end
+
+def fun_l6_n816()
+    fun_l7_n599
+end
+
+def fun_l6_n817()
+    fun_l7_n642
+end
+
+def fun_l6_n818()
+    fun_l7_n381
+end
+
+def fun_l6_n819()
+    fun_l7_n802
+end
+
+def fun_l6_n820()
+    fun_l7_n324
+end
+
+def fun_l6_n821()
+    fun_l7_n804
+end
+
+def fun_l6_n822()
+    fun_l7_n743
+end
+
+def fun_l6_n823()
+    fun_l7_n961
+end
+
+def fun_l6_n824()
+    fun_l7_n222
+end
+
+def fun_l6_n825()
+    fun_l7_n184
+end
+
+def fun_l6_n826()
+    fun_l7_n157
+end
+
+def fun_l6_n827()
+    fun_l7_n387
+end
+
+def fun_l6_n828()
+    fun_l7_n963
+end
+
+def fun_l6_n829()
+    fun_l7_n817
+end
+
+def fun_l6_n830()
+    fun_l7_n673
+end
+
+def fun_l6_n831()
+    fun_l7_n471
+end
+
+def fun_l6_n832()
+    fun_l7_n662
+end
+
+def fun_l6_n833()
+    fun_l7_n385
+end
+
+def fun_l6_n834()
+    fun_l7_n802
+end
+
+def fun_l6_n835()
+    fun_l7_n827
+end
+
+def fun_l6_n836()
+    fun_l7_n495
+end
+
+def fun_l6_n837()
+    fun_l7_n44
+end
+
+def fun_l6_n838()
+    fun_l7_n958
+end
+
+def fun_l6_n839()
+    fun_l7_n436
+end
+
+def fun_l6_n840()
+    fun_l7_n210
+end
+
+def fun_l6_n841()
+    fun_l7_n14
+end
+
+def fun_l6_n842()
+    fun_l7_n67
+end
+
+def fun_l6_n843()
+    fun_l7_n0
+end
+
+def fun_l6_n844()
+    fun_l7_n50
+end
+
+def fun_l6_n845()
+    fun_l7_n398
+end
+
+def fun_l6_n846()
+    fun_l7_n269
+end
+
+def fun_l6_n847()
+    fun_l7_n478
+end
+
+def fun_l6_n848()
+    fun_l7_n879
+end
+
+def fun_l6_n849()
+    fun_l7_n713
+end
+
+def fun_l6_n850()
+    fun_l7_n496
+end
+
+def fun_l6_n851()
+    fun_l7_n995
+end
+
+def fun_l6_n852()
+    fun_l7_n973
+end
+
+def fun_l6_n853()
+    fun_l7_n990
+end
+
+def fun_l6_n854()
+    fun_l7_n193
+end
+
+def fun_l6_n855()
+    fun_l7_n200
+end
+
+def fun_l6_n856()
+    fun_l7_n377
+end
+
+def fun_l6_n857()
+    fun_l7_n82
+end
+
+def fun_l6_n858()
+    fun_l7_n261
+end
+
+def fun_l6_n859()
+    fun_l7_n464
+end
+
+def fun_l6_n860()
+    fun_l7_n358
+end
+
+def fun_l6_n861()
+    fun_l7_n920
+end
+
+def fun_l6_n862()
+    fun_l7_n724
+end
+
+def fun_l6_n863()
+    fun_l7_n536
+end
+
+def fun_l6_n864()
+    fun_l7_n127
+end
+
+def fun_l6_n865()
+    fun_l7_n919
+end
+
+def fun_l6_n866()
+    fun_l7_n972
+end
+
+def fun_l6_n867()
+    fun_l7_n773
+end
+
+def fun_l6_n868()
+    fun_l7_n444
+end
+
+def fun_l6_n869()
+    fun_l7_n242
+end
+
+def fun_l6_n870()
+    fun_l7_n910
+end
+
+def fun_l6_n871()
+    fun_l7_n396
+end
+
+def fun_l6_n872()
+    fun_l7_n110
+end
+
+def fun_l6_n873()
+    fun_l7_n393
+end
+
+def fun_l6_n874()
+    fun_l7_n295
+end
+
+def fun_l6_n875()
+    fun_l7_n998
+end
+
+def fun_l6_n876()
+    fun_l7_n357
+end
+
+def fun_l6_n877()
+    fun_l7_n586
+end
+
+def fun_l6_n878()
+    fun_l7_n752
+end
+
+def fun_l6_n879()
+    fun_l7_n998
+end
+
+def fun_l6_n880()
+    fun_l7_n33
+end
+
+def fun_l6_n881()
+    fun_l7_n472
+end
+
+def fun_l6_n882()
+    fun_l7_n511
+end
+
+def fun_l6_n883()
+    fun_l7_n677
+end
+
+def fun_l6_n884()
+    fun_l7_n562
+end
+
+def fun_l6_n885()
+    fun_l7_n100
+end
+
+def fun_l6_n886()
+    fun_l7_n964
+end
+
+def fun_l6_n887()
+    fun_l7_n306
+end
+
+def fun_l6_n888()
+    fun_l7_n295
+end
+
+def fun_l6_n889()
+    fun_l7_n323
+end
+
+def fun_l6_n890()
+    fun_l7_n559
+end
+
+def fun_l6_n891()
+    fun_l7_n872
+end
+
+def fun_l6_n892()
+    fun_l7_n236
+end
+
+def fun_l6_n893()
+    fun_l7_n845
+end
+
+def fun_l6_n894()
+    fun_l7_n853
+end
+
+def fun_l6_n895()
+    fun_l7_n333
+end
+
+def fun_l6_n896()
+    fun_l7_n404
+end
+
+def fun_l6_n897()
+    fun_l7_n17
+end
+
+def fun_l6_n898()
+    fun_l7_n997
+end
+
+def fun_l6_n899()
+    fun_l7_n844
+end
+
+def fun_l6_n900()
+    fun_l7_n327
+end
+
+def fun_l6_n901()
+    fun_l7_n863
+end
+
+def fun_l6_n902()
+    fun_l7_n516
+end
+
+def fun_l6_n903()
+    fun_l7_n298
+end
+
+def fun_l6_n904()
+    fun_l7_n171
+end
+
+def fun_l6_n905()
+    fun_l7_n908
+end
+
+def fun_l6_n906()
+    fun_l7_n934
+end
+
+def fun_l6_n907()
+    fun_l7_n361
+end
+
+def fun_l6_n908()
+    fun_l7_n901
+end
+
+def fun_l6_n909()
+    fun_l7_n830
+end
+
+def fun_l6_n910()
+    fun_l7_n313
+end
+
+def fun_l6_n911()
+    fun_l7_n799
+end
+
+def fun_l6_n912()
+    fun_l7_n223
+end
+
+def fun_l6_n913()
+    fun_l7_n108
+end
+
+def fun_l6_n914()
+    fun_l7_n822
+end
+
+def fun_l6_n915()
+    fun_l7_n42
+end
+
+def fun_l6_n916()
+    fun_l7_n276
+end
+
+def fun_l6_n917()
+    fun_l7_n535
+end
+
+def fun_l6_n918()
+    fun_l7_n586
+end
+
+def fun_l6_n919()
+    fun_l7_n847
+end
+
+def fun_l6_n920()
+    fun_l7_n851
+end
+
+def fun_l6_n921()
+    fun_l7_n544
+end
+
+def fun_l6_n922()
+    fun_l7_n416
+end
+
+def fun_l6_n923()
+    fun_l7_n670
+end
+
+def fun_l6_n924()
+    fun_l7_n366
+end
+
+def fun_l6_n925()
+    fun_l7_n94
+end
+
+def fun_l6_n926()
+    fun_l7_n187
+end
+
+def fun_l6_n927()
+    fun_l7_n72
+end
+
+def fun_l6_n928()
+    fun_l7_n19
+end
+
+def fun_l6_n929()
+    fun_l7_n424
+end
+
+def fun_l6_n930()
+    fun_l7_n833
+end
+
+def fun_l6_n931()
+    fun_l7_n438
+end
+
+def fun_l6_n932()
+    fun_l7_n9
+end
+
+def fun_l6_n933()
+    fun_l7_n967
+end
+
+def fun_l6_n934()
+    fun_l7_n155
+end
+
+def fun_l6_n935()
+    fun_l7_n119
+end
+
+def fun_l6_n936()
+    fun_l7_n916
+end
+
+def fun_l6_n937()
+    fun_l7_n232
+end
+
+def fun_l6_n938()
+    fun_l7_n880
+end
+
+def fun_l6_n939()
+    fun_l7_n456
+end
+
+def fun_l6_n940()
+    fun_l7_n764
+end
+
+def fun_l6_n941()
+    fun_l7_n525
+end
+
+def fun_l6_n942()
+    fun_l7_n794
+end
+
+def fun_l6_n943()
+    fun_l7_n887
+end
+
+def fun_l6_n944()
+    fun_l7_n756
+end
+
+def fun_l6_n945()
+    fun_l7_n863
+end
+
+def fun_l6_n946()
+    fun_l7_n959
+end
+
+def fun_l6_n947()
+    fun_l7_n597
+end
+
+def fun_l6_n948()
+    fun_l7_n919
+end
+
+def fun_l6_n949()
+    fun_l7_n196
+end
+
+def fun_l6_n950()
+    fun_l7_n505
+end
+
+def fun_l6_n951()
+    fun_l7_n374
+end
+
+def fun_l6_n952()
+    fun_l7_n272
+end
+
+def fun_l6_n953()
+    fun_l7_n317
+end
+
+def fun_l6_n954()
+    fun_l7_n149
+end
+
+def fun_l6_n955()
+    fun_l7_n885
+end
+
+def fun_l6_n956()
+    fun_l7_n174
+end
+
+def fun_l6_n957()
+    fun_l7_n234
+end
+
+def fun_l6_n958()
+    fun_l7_n848
+end
+
+def fun_l6_n959()
+    fun_l7_n18
+end
+
+def fun_l6_n960()
+    fun_l7_n111
+end
+
+def fun_l6_n961()
+    fun_l7_n355
+end
+
+def fun_l6_n962()
+    fun_l7_n640
+end
+
+def fun_l6_n963()
+    fun_l7_n486
+end
+
+def fun_l6_n964()
+    fun_l7_n940
+end
+
+def fun_l6_n965()
+    fun_l7_n54
+end
+
+def fun_l6_n966()
+    fun_l7_n970
+end
+
+def fun_l6_n967()
+    fun_l7_n127
+end
+
+def fun_l6_n968()
+    fun_l7_n581
+end
+
+def fun_l6_n969()
+    fun_l7_n921
+end
+
+def fun_l6_n970()
+    fun_l7_n837
+end
+
+def fun_l6_n971()
+    fun_l7_n933
+end
+
+def fun_l6_n972()
+    fun_l7_n109
+end
+
+def fun_l6_n973()
+    fun_l7_n846
+end
+
+def fun_l6_n974()
+    fun_l7_n178
+end
+
+def fun_l6_n975()
+    fun_l7_n278
+end
+
+def fun_l6_n976()
+    fun_l7_n404
+end
+
+def fun_l6_n977()
+    fun_l7_n456
+end
+
+def fun_l6_n978()
+    fun_l7_n860
+end
+
+def fun_l6_n979()
+    fun_l7_n637
+end
+
+def fun_l6_n980()
+    fun_l7_n201
+end
+
+def fun_l6_n981()
+    fun_l7_n836
+end
+
+def fun_l6_n982()
+    fun_l7_n172
+end
+
+def fun_l6_n983()
+    fun_l7_n935
+end
+
+def fun_l6_n984()
+    fun_l7_n937
+end
+
+def fun_l6_n985()
+    fun_l7_n817
+end
+
+def fun_l6_n986()
+    fun_l7_n16
+end
+
+def fun_l6_n987()
+    fun_l7_n152
+end
+
+def fun_l6_n988()
+    fun_l7_n359
+end
+
+def fun_l6_n989()
+    fun_l7_n357
+end
+
+def fun_l6_n990()
+    fun_l7_n609
+end
+
+def fun_l6_n991()
+    fun_l7_n604
+end
+
+def fun_l6_n992()
+    fun_l7_n998
+end
+
+def fun_l6_n993()
+    fun_l7_n366
+end
+
+def fun_l6_n994()
+    fun_l7_n150
+end
+
+def fun_l6_n995()
+    fun_l7_n823
+end
+
+def fun_l6_n996()
+    fun_l7_n476
+end
+
+def fun_l6_n997()
+    fun_l7_n535
+end
+
+def fun_l6_n998()
+    fun_l7_n222
+end
+
+def fun_l6_n999()
+    fun_l7_n238
+end
+
+def fun_l7_n0()
+    fun_l8_n3
+end
+
+def fun_l7_n1()
+    fun_l8_n706
+end
+
+def fun_l7_n2()
+    fun_l8_n887
+end
+
+def fun_l7_n3()
+    fun_l8_n693
+end
+
+def fun_l7_n4()
+    fun_l8_n11
+end
+
+def fun_l7_n5()
+    fun_l8_n155
+end
+
+def fun_l7_n6()
+    fun_l8_n604
+end
+
+def fun_l7_n7()
+    fun_l8_n616
+end
+
+def fun_l7_n8()
+    fun_l8_n686
+end
+
+def fun_l7_n9()
+    fun_l8_n257
+end
+
+def fun_l7_n10()
+    fun_l8_n594
+end
+
+def fun_l7_n11()
+    fun_l8_n548
+end
+
+def fun_l7_n12()
+    fun_l8_n305
+end
+
+def fun_l7_n13()
+    fun_l8_n125
+end
+
+def fun_l7_n14()
+    fun_l8_n183
+end
+
+def fun_l7_n15()
+    fun_l8_n799
+end
+
+def fun_l7_n16()
+    fun_l8_n333
+end
+
+def fun_l7_n17()
+    fun_l8_n873
+end
+
+def fun_l7_n18()
+    fun_l8_n110
+end
+
+def fun_l7_n19()
+    fun_l8_n578
+end
+
+def fun_l7_n20()
+    fun_l8_n423
+end
+
+def fun_l7_n21()
+    fun_l8_n686
+end
+
+def fun_l7_n22()
+    fun_l8_n162
+end
+
+def fun_l7_n23()
+    fun_l8_n277
+end
+
+def fun_l7_n24()
+    fun_l8_n651
+end
+
+def fun_l7_n25()
+    fun_l8_n575
+end
+
+def fun_l7_n26()
+    fun_l8_n937
+end
+
+def fun_l7_n27()
+    fun_l8_n636
+end
+
+def fun_l7_n28()
+    fun_l8_n1
+end
+
+def fun_l7_n29()
+    fun_l8_n83
+end
+
+def fun_l7_n30()
+    fun_l8_n318
+end
+
+def fun_l7_n31()
+    fun_l8_n675
+end
+
+def fun_l7_n32()
+    fun_l8_n118
+end
+
+def fun_l7_n33()
+    fun_l8_n522
+end
+
+def fun_l7_n34()
+    fun_l8_n507
+end
+
+def fun_l7_n35()
+    fun_l8_n846
+end
+
+def fun_l7_n36()
+    fun_l8_n584
+end
+
+def fun_l7_n37()
+    fun_l8_n816
+end
+
+def fun_l7_n38()
+    fun_l8_n217
+end
+
+def fun_l7_n39()
+    fun_l8_n366
+end
+
+def fun_l7_n40()
+    fun_l8_n283
+end
+
+def fun_l7_n41()
+    fun_l8_n536
+end
+
+def fun_l7_n42()
+    fun_l8_n414
+end
+
+def fun_l7_n43()
+    fun_l8_n216
+end
+
+def fun_l7_n44()
+    fun_l8_n743
+end
+
+def fun_l7_n45()
+    fun_l8_n449
+end
+
+def fun_l7_n46()
+    fun_l8_n629
+end
+
+def fun_l7_n47()
+    fun_l8_n711
+end
+
+def fun_l7_n48()
+    fun_l8_n113
+end
+
+def fun_l7_n49()
+    fun_l8_n440
+end
+
+def fun_l7_n50()
+    fun_l8_n822
+end
+
+def fun_l7_n51()
+    fun_l8_n567
+end
+
+def fun_l7_n52()
+    fun_l8_n854
+end
+
+def fun_l7_n53()
+    fun_l8_n204
+end
+
+def fun_l7_n54()
+    fun_l8_n796
+end
+
+def fun_l7_n55()
+    fun_l8_n989
+end
+
+def fun_l7_n56()
+    fun_l8_n504
+end
+
+def fun_l7_n57()
+    fun_l8_n952
+end
+
+def fun_l7_n58()
+    fun_l8_n797
+end
+
+def fun_l7_n59()
+    fun_l8_n492
+end
+
+def fun_l7_n60()
+    fun_l8_n949
+end
+
+def fun_l7_n61()
+    fun_l8_n215
+end
+
+def fun_l7_n62()
+    fun_l8_n306
+end
+
+def fun_l7_n63()
+    fun_l8_n632
+end
+
+def fun_l7_n64()
+    fun_l8_n572
+end
+
+def fun_l7_n65()
+    fun_l8_n69
+end
+
+def fun_l7_n66()
+    fun_l8_n97
+end
+
+def fun_l7_n67()
+    fun_l8_n708
+end
+
+def fun_l7_n68()
+    fun_l8_n548
+end
+
+def fun_l7_n69()
+    fun_l8_n999
+end
+
+def fun_l7_n70()
+    fun_l8_n872
+end
+
+def fun_l7_n71()
+    fun_l8_n20
+end
+
+def fun_l7_n72()
+    fun_l8_n220
+end
+
+def fun_l7_n73()
+    fun_l8_n28
+end
+
+def fun_l7_n74()
+    fun_l8_n79
+end
+
+def fun_l7_n75()
+    fun_l8_n248
+end
+
+def fun_l7_n76()
+    fun_l8_n601
+end
+
+def fun_l7_n77()
+    fun_l8_n469
+end
+
+def fun_l7_n78()
+    fun_l8_n315
+end
+
+def fun_l7_n79()
+    fun_l8_n712
+end
+
+def fun_l7_n80()
+    fun_l8_n177
+end
+
+def fun_l7_n81()
+    fun_l8_n106
+end
+
+def fun_l7_n82()
+    fun_l8_n668
+end
+
+def fun_l7_n83()
+    fun_l8_n299
+end
+
+def fun_l7_n84()
+    fun_l8_n59
+end
+
+def fun_l7_n85()
+    fun_l8_n120
+end
+
+def fun_l7_n86()
+    fun_l8_n209
+end
+
+def fun_l7_n87()
+    fun_l8_n502
+end
+
+def fun_l7_n88()
+    fun_l8_n935
+end
+
+def fun_l7_n89()
+    fun_l8_n697
+end
+
+def fun_l7_n90()
+    fun_l8_n231
+end
+
+def fun_l7_n91()
+    fun_l8_n47
+end
+
+def fun_l7_n92()
+    fun_l8_n125
+end
+
+def fun_l7_n93()
+    fun_l8_n975
+end
+
+def fun_l7_n94()
+    fun_l8_n627
+end
+
+def fun_l7_n95()
+    fun_l8_n898
+end
+
+def fun_l7_n96()
+    fun_l8_n124
+end
+
+def fun_l7_n97()
+    fun_l8_n722
+end
+
+def fun_l7_n98()
+    fun_l8_n745
+end
+
+def fun_l7_n99()
+    fun_l8_n999
+end
+
+def fun_l7_n100()
+    fun_l8_n791
+end
+
+def fun_l7_n101()
+    fun_l8_n360
+end
+
+def fun_l7_n102()
+    fun_l8_n755
+end
+
+def fun_l7_n103()
+    fun_l8_n718
+end
+
+def fun_l7_n104()
+    fun_l8_n495
+end
+
+def fun_l7_n105()
+    fun_l8_n19
+end
+
+def fun_l7_n106()
+    fun_l8_n280
+end
+
+def fun_l7_n107()
+    fun_l8_n710
+end
+
+def fun_l7_n108()
+    fun_l8_n871
+end
+
+def fun_l7_n109()
+    fun_l8_n727
+end
+
+def fun_l7_n110()
+    fun_l8_n807
+end
+
+def fun_l7_n111()
+    fun_l8_n170
+end
+
+def fun_l7_n112()
+    fun_l8_n661
+end
+
+def fun_l7_n113()
+    fun_l8_n684
+end
+
+def fun_l7_n114()
+    fun_l8_n202
+end
+
+def fun_l7_n115()
+    fun_l8_n679
+end
+
+def fun_l7_n116()
+    fun_l8_n773
+end
+
+def fun_l7_n117()
+    fun_l8_n538
+end
+
+def fun_l7_n118()
+    fun_l8_n411
+end
+
+def fun_l7_n119()
+    fun_l8_n264
+end
+
+def fun_l7_n120()
+    fun_l8_n487
+end
+
+def fun_l7_n121()
+    fun_l8_n906
+end
+
+def fun_l7_n122()
+    fun_l8_n833
+end
+
+def fun_l7_n123()
+    fun_l8_n721
+end
+
+def fun_l7_n124()
+    fun_l8_n792
+end
+
+def fun_l7_n125()
+    fun_l8_n852
+end
+
+def fun_l7_n126()
+    fun_l8_n876
+end
+
+def fun_l7_n127()
+    fun_l8_n489
+end
+
+def fun_l7_n128()
+    fun_l8_n715
+end
+
+def fun_l7_n129()
+    fun_l8_n863
+end
+
+def fun_l7_n130()
+    fun_l8_n842
+end
+
+def fun_l7_n131()
+    fun_l8_n99
+end
+
+def fun_l7_n132()
+    fun_l8_n472
+end
+
+def fun_l7_n133()
+    fun_l8_n826
+end
+
+def fun_l7_n134()
+    fun_l8_n805
+end
+
+def fun_l7_n135()
+    fun_l8_n914
+end
+
+def fun_l7_n136()
+    fun_l8_n691
+end
+
+def fun_l7_n137()
+    fun_l8_n880
+end
+
+def fun_l7_n138()
+    fun_l8_n708
+end
+
+def fun_l7_n139()
+    fun_l8_n445
+end
+
+def fun_l7_n140()
+    fun_l8_n173
+end
+
+def fun_l7_n141()
+    fun_l8_n785
+end
+
+def fun_l7_n142()
+    fun_l8_n638
+end
+
+def fun_l7_n143()
+    fun_l8_n319
+end
+
+def fun_l7_n144()
+    fun_l8_n825
+end
+
+def fun_l7_n145()
+    fun_l8_n497
+end
+
+def fun_l7_n146()
+    fun_l8_n941
+end
+
+def fun_l7_n147()
+    fun_l8_n164
+end
+
+def fun_l7_n148()
+    fun_l8_n773
+end
+
+def fun_l7_n149()
+    fun_l8_n603
+end
+
+def fun_l7_n150()
+    fun_l8_n701
+end
+
+def fun_l7_n151()
+    fun_l8_n279
+end
+
+def fun_l7_n152()
+    fun_l8_n120
+end
+
+def fun_l7_n153()
+    fun_l8_n352
+end
+
+def fun_l7_n154()
+    fun_l8_n401
+end
+
+def fun_l7_n155()
+    fun_l8_n195
+end
+
+def fun_l7_n156()
+    fun_l8_n206
+end
+
+def fun_l7_n157()
+    fun_l8_n209
+end
+
+def fun_l7_n158()
+    fun_l8_n594
+end
+
+def fun_l7_n159()
+    fun_l8_n49
+end
+
+def fun_l7_n160()
+    fun_l8_n835
+end
+
+def fun_l7_n161()
+    fun_l8_n108
+end
+
+def fun_l7_n162()
+    fun_l8_n499
+end
+
+def fun_l7_n163()
+    fun_l8_n822
+end
+
+def fun_l7_n164()
+    fun_l8_n712
+end
+
+def fun_l7_n165()
+    fun_l8_n757
+end
+
+def fun_l7_n166()
+    fun_l8_n706
+end
+
+def fun_l7_n167()
+    fun_l8_n517
+end
+
+def fun_l7_n168()
+    fun_l8_n74
+end
+
+def fun_l7_n169()
+    fun_l8_n292
+end
+
+def fun_l7_n170()
+    fun_l8_n560
+end
+
+def fun_l7_n171()
+    fun_l8_n476
+end
+
+def fun_l7_n172()
+    fun_l8_n818
+end
+
+def fun_l7_n173()
+    fun_l8_n91
+end
+
+def fun_l7_n174()
+    fun_l8_n835
+end
+
+def fun_l7_n175()
+    fun_l8_n84
+end
+
+def fun_l7_n176()
+    fun_l8_n506
+end
+
+def fun_l7_n177()
+    fun_l8_n602
+end
+
+def fun_l7_n178()
+    fun_l8_n758
+end
+
+def fun_l7_n179()
+    fun_l8_n591
+end
+
+def fun_l7_n180()
+    fun_l8_n757
+end
+
+def fun_l7_n181()
+    fun_l8_n127
+end
+
+def fun_l7_n182()
+    fun_l8_n287
+end
+
+def fun_l7_n183()
+    fun_l8_n672
+end
+
+def fun_l7_n184()
+    fun_l8_n870
+end
+
+def fun_l7_n185()
+    fun_l8_n267
+end
+
+def fun_l7_n186()
+    fun_l8_n396
+end
+
+def fun_l7_n187()
+    fun_l8_n128
+end
+
+def fun_l7_n188()
+    fun_l8_n670
+end
+
+def fun_l7_n189()
+    fun_l8_n142
+end
+
+def fun_l7_n190()
+    fun_l8_n320
+end
+
+def fun_l7_n191()
+    fun_l8_n829
+end
+
+def fun_l7_n192()
+    fun_l8_n788
+end
+
+def fun_l7_n193()
+    fun_l8_n174
+end
+
+def fun_l7_n194()
+    fun_l8_n526
+end
+
+def fun_l7_n195()
+    fun_l8_n185
+end
+
+def fun_l7_n196()
+    fun_l8_n746
+end
+
+def fun_l7_n197()
+    fun_l8_n889
+end
+
+def fun_l7_n198()
+    fun_l8_n154
+end
+
+def fun_l7_n199()
+    fun_l8_n19
+end
+
+def fun_l7_n200()
+    fun_l8_n913
+end
+
+def fun_l7_n201()
+    fun_l8_n560
+end
+
+def fun_l7_n202()
+    fun_l8_n768
+end
+
+def fun_l7_n203()
+    fun_l8_n412
+end
+
+def fun_l7_n204()
+    fun_l8_n394
+end
+
+def fun_l7_n205()
+    fun_l8_n641
+end
+
+def fun_l7_n206()
+    fun_l8_n83
+end
+
+def fun_l7_n207()
+    fun_l8_n39
+end
+
+def fun_l7_n208()
+    fun_l8_n502
+end
+
+def fun_l7_n209()
+    fun_l8_n904
+end
+
+def fun_l7_n210()
+    fun_l8_n639
+end
+
+def fun_l7_n211()
+    fun_l8_n873
+end
+
+def fun_l7_n212()
+    fun_l8_n940
+end
+
+def fun_l7_n213()
+    fun_l8_n594
+end
+
+def fun_l7_n214()
+    fun_l8_n397
+end
+
+def fun_l7_n215()
+    fun_l8_n318
+end
+
+def fun_l7_n216()
+    fun_l8_n116
+end
+
+def fun_l7_n217()
+    fun_l8_n888
+end
+
+def fun_l7_n218()
+    fun_l8_n148
+end
+
+def fun_l7_n219()
+    fun_l8_n329
+end
+
+def fun_l7_n220()
+    fun_l8_n973
+end
+
+def fun_l7_n221()
+    fun_l8_n913
+end
+
+def fun_l7_n222()
+    fun_l8_n170
+end
+
+def fun_l7_n223()
+    fun_l8_n103
+end
+
+def fun_l7_n224()
+    fun_l8_n835
+end
+
+def fun_l7_n225()
+    fun_l8_n104
+end
+
+def fun_l7_n226()
+    fun_l8_n111
+end
+
+def fun_l7_n227()
+    fun_l8_n12
+end
+
+def fun_l7_n228()
+    fun_l8_n299
+end
+
+def fun_l7_n229()
+    fun_l8_n639
+end
+
+def fun_l7_n230()
+    fun_l8_n789
+end
+
+def fun_l7_n231()
+    fun_l8_n968
+end
+
+def fun_l7_n232()
+    fun_l8_n905
+end
+
+def fun_l7_n233()
+    fun_l8_n325
+end
+
+def fun_l7_n234()
+    fun_l8_n841
+end
+
+def fun_l7_n235()
+    fun_l8_n605
+end
+
+def fun_l7_n236()
+    fun_l8_n495
+end
+
+def fun_l7_n237()
+    fun_l8_n154
+end
+
+def fun_l7_n238()
+    fun_l8_n331
+end
+
+def fun_l7_n239()
+    fun_l8_n30
+end
+
+def fun_l7_n240()
+    fun_l8_n170
+end
+
+def fun_l7_n241()
+    fun_l8_n376
+end
+
+def fun_l7_n242()
+    fun_l8_n49
+end
+
+def fun_l7_n243()
+    fun_l8_n463
+end
+
+def fun_l7_n244()
+    fun_l8_n269
+end
+
+def fun_l7_n245()
+    fun_l8_n573
+end
+
+def fun_l7_n246()
+    fun_l8_n782
+end
+
+def fun_l7_n247()
+    fun_l8_n85
+end
+
+def fun_l7_n248()
+    fun_l8_n667
+end
+
+def fun_l7_n249()
+    fun_l8_n686
+end
+
+def fun_l7_n250()
+    fun_l8_n575
+end
+
+def fun_l7_n251()
+    fun_l8_n349
+end
+
+def fun_l7_n252()
+    fun_l8_n252
+end
+
+def fun_l7_n253()
+    fun_l8_n490
+end
+
+def fun_l7_n254()
+    fun_l8_n600
+end
+
+def fun_l7_n255()
+    fun_l8_n772
+end
+
+def fun_l7_n256()
+    fun_l8_n645
+end
+
+def fun_l7_n257()
+    fun_l8_n633
+end
+
+def fun_l7_n258()
+    fun_l8_n323
+end
+
+def fun_l7_n259()
+    fun_l8_n590
+end
+
+def fun_l7_n260()
+    fun_l8_n77
+end
+
+def fun_l7_n261()
+    fun_l8_n349
+end
+
+def fun_l7_n262()
+    fun_l8_n98
+end
+
+def fun_l7_n263()
+    fun_l8_n312
+end
+
+def fun_l7_n264()
+    fun_l8_n449
+end
+
+def fun_l7_n265()
+    fun_l8_n550
+end
+
+def fun_l7_n266()
+    fun_l8_n717
+end
+
+def fun_l7_n267()
+    fun_l8_n249
+end
+
+def fun_l7_n268()
+    fun_l8_n940
+end
+
+def fun_l7_n269()
+    fun_l8_n243
+end
+
+def fun_l7_n270()
+    fun_l8_n392
+end
+
+def fun_l7_n271()
+    fun_l8_n129
+end
+
+def fun_l7_n272()
+    fun_l8_n704
+end
+
+def fun_l7_n273()
+    fun_l8_n815
+end
+
+def fun_l7_n274()
+    fun_l8_n123
+end
+
+def fun_l7_n275()
+    fun_l8_n281
+end
+
+def fun_l7_n276()
+    fun_l8_n110
+end
+
+def fun_l7_n277()
+    fun_l8_n250
+end
+
+def fun_l7_n278()
+    fun_l8_n245
+end
+
+def fun_l7_n279()
+    fun_l8_n612
+end
+
+def fun_l7_n280()
+    fun_l8_n693
+end
+
+def fun_l7_n281()
+    fun_l8_n441
+end
+
+def fun_l7_n282()
+    fun_l8_n716
+end
+
+def fun_l7_n283()
+    fun_l8_n467
+end
+
+def fun_l7_n284()
+    fun_l8_n944
+end
+
+def fun_l7_n285()
+    fun_l8_n14
+end
+
+def fun_l7_n286()
+    fun_l8_n453
+end
+
+def fun_l7_n287()
+    fun_l8_n342
+end
+
+def fun_l7_n288()
+    fun_l8_n666
+end
+
+def fun_l7_n289()
+    fun_l8_n111
+end
+
+def fun_l7_n290()
+    fun_l8_n353
+end
+
+def fun_l7_n291()
+    fun_l8_n279
+end
+
+def fun_l7_n292()
+    fun_l8_n556
+end
+
+def fun_l7_n293()
+    fun_l8_n780
+end
+
+def fun_l7_n294()
+    fun_l8_n137
+end
+
+def fun_l7_n295()
+    fun_l8_n760
+end
+
+def fun_l7_n296()
+    fun_l8_n56
+end
+
+def fun_l7_n297()
+    fun_l8_n927
+end
+
+def fun_l7_n298()
+    fun_l8_n861
+end
+
+def fun_l7_n299()
+    fun_l8_n653
+end
+
+def fun_l7_n300()
+    fun_l8_n948
+end
+
+def fun_l7_n301()
+    fun_l8_n159
+end
+
+def fun_l7_n302()
+    fun_l8_n426
+end
+
+def fun_l7_n303()
+    fun_l8_n175
+end
+
+def fun_l7_n304()
+    fun_l8_n35
+end
+
+def fun_l7_n305()
+    fun_l8_n700
+end
+
+def fun_l7_n306()
+    fun_l8_n603
+end
+
+def fun_l7_n307()
+    fun_l8_n600
+end
+
+def fun_l7_n308()
+    fun_l8_n280
+end
+
+def fun_l7_n309()
+    fun_l8_n599
+end
+
+def fun_l7_n310()
+    fun_l8_n404
+end
+
+def fun_l7_n311()
+    fun_l8_n475
+end
+
+def fun_l7_n312()
+    fun_l8_n837
+end
+
+def fun_l7_n313()
+    fun_l8_n61
+end
+
+def fun_l7_n314()
+    fun_l8_n571
+end
+
+def fun_l7_n315()
+    fun_l8_n442
+end
+
+def fun_l7_n316()
+    fun_l8_n256
+end
+
+def fun_l7_n317()
+    fun_l8_n751
+end
+
+def fun_l7_n318()
+    fun_l8_n672
+end
+
+def fun_l7_n319()
+    fun_l8_n953
+end
+
+def fun_l7_n320()
+    fun_l8_n330
+end
+
+def fun_l7_n321()
+    fun_l8_n54
+end
+
+def fun_l7_n322()
+    fun_l8_n11
+end
+
+def fun_l7_n323()
+    fun_l8_n504
+end
+
+def fun_l7_n324()
+    fun_l8_n786
+end
+
+def fun_l7_n325()
+    fun_l8_n32
+end
+
+def fun_l7_n326()
+    fun_l8_n85
+end
+
+def fun_l7_n327()
+    fun_l8_n727
+end
+
+def fun_l7_n328()
+    fun_l8_n445
+end
+
+def fun_l7_n329()
+    fun_l8_n787
+end
+
+def fun_l7_n330()
+    fun_l8_n663
+end
+
+def fun_l7_n331()
+    fun_l8_n461
+end
+
+def fun_l7_n332()
+    fun_l8_n82
+end
+
+def fun_l7_n333()
+    fun_l8_n974
+end
+
+def fun_l7_n334()
+    fun_l8_n511
+end
+
+def fun_l7_n335()
+    fun_l8_n827
+end
+
+def fun_l7_n336()
+    fun_l8_n12
+end
+
+def fun_l7_n337()
+    fun_l8_n696
+end
+
+def fun_l7_n338()
+    fun_l8_n325
+end
+
+def fun_l7_n339()
+    fun_l8_n148
+end
+
+def fun_l7_n340()
+    fun_l8_n609
+end
+
+def fun_l7_n341()
+    fun_l8_n471
+end
+
+def fun_l7_n342()
+    fun_l8_n63
+end
+
+def fun_l7_n343()
+    fun_l8_n358
+end
+
+def fun_l7_n344()
+    fun_l8_n658
+end
+
+def fun_l7_n345()
+    fun_l8_n730
+end
+
+def fun_l7_n346()
+    fun_l8_n139
+end
+
+def fun_l7_n347()
+    fun_l8_n951
+end
+
+def fun_l7_n348()
+    fun_l8_n113
+end
+
+def fun_l7_n349()
+    fun_l8_n695
+end
+
+def fun_l7_n350()
+    fun_l8_n803
+end
+
+def fun_l7_n351()
+    fun_l8_n93
+end
+
+def fun_l7_n352()
+    fun_l8_n340
+end
+
+def fun_l7_n353()
+    fun_l8_n551
+end
+
+def fun_l7_n354()
+    fun_l8_n5
+end
+
+def fun_l7_n355()
+    fun_l8_n960
+end
+
+def fun_l7_n356()
+    fun_l8_n76
+end
+
+def fun_l7_n357()
+    fun_l8_n142
+end
+
+def fun_l7_n358()
+    fun_l8_n305
+end
+
+def fun_l7_n359()
+    fun_l8_n739
+end
+
+def fun_l7_n360()
+    fun_l8_n293
+end
+
+def fun_l7_n361()
+    fun_l8_n812
+end
+
+def fun_l7_n362()
+    fun_l8_n635
+end
+
+def fun_l7_n363()
+    fun_l8_n239
+end
+
+def fun_l7_n364()
+    fun_l8_n880
+end
+
+def fun_l7_n365()
+    fun_l8_n999
+end
+
+def fun_l7_n366()
+    fun_l8_n997
+end
+
+def fun_l7_n367()
+    fun_l8_n190
+end
+
+def fun_l7_n368()
+    fun_l8_n763
+end
+
+def fun_l7_n369()
+    fun_l8_n369
+end
+
+def fun_l7_n370()
+    fun_l8_n538
+end
+
+def fun_l7_n371()
+    fun_l8_n553
+end
+
+def fun_l7_n372()
+    fun_l8_n844
+end
+
+def fun_l7_n373()
+    fun_l8_n773
+end
+
+def fun_l7_n374()
+    fun_l8_n589
+end
+
+def fun_l7_n375()
+    fun_l8_n492
+end
+
+def fun_l7_n376()
+    fun_l8_n848
+end
+
+def fun_l7_n377()
+    fun_l8_n715
+end
+
+def fun_l7_n378()
+    fun_l8_n82
+end
+
+def fun_l7_n379()
+    fun_l8_n267
+end
+
+def fun_l7_n380()
+    fun_l8_n84
+end
+
+def fun_l7_n381()
+    fun_l8_n996
+end
+
+def fun_l7_n382()
+    fun_l8_n536
+end
+
+def fun_l7_n383()
+    fun_l8_n518
+end
+
+def fun_l7_n384()
+    fun_l8_n70
+end
+
+def fun_l7_n385()
+    fun_l8_n545
+end
+
+def fun_l7_n386()
+    fun_l8_n156
+end
+
+def fun_l7_n387()
+    fun_l8_n558
+end
+
+def fun_l7_n388()
+    fun_l8_n519
+end
+
+def fun_l7_n389()
+    fun_l8_n321
+end
+
+def fun_l7_n390()
+    fun_l8_n133
+end
+
+def fun_l7_n391()
+    fun_l8_n253
+end
+
+def fun_l7_n392()
+    fun_l8_n969
+end
+
+def fun_l7_n393()
+    fun_l8_n986
+end
+
+def fun_l7_n394()
+    fun_l8_n991
+end
+
+def fun_l7_n395()
+    fun_l8_n757
+end
+
+def fun_l7_n396()
+    fun_l8_n496
+end
+
+def fun_l7_n397()
+    fun_l8_n841
+end
+
+def fun_l7_n398()
+    fun_l8_n922
+end
+
+def fun_l7_n399()
+    fun_l8_n51
+end
+
+def fun_l7_n400()
+    fun_l8_n961
+end
+
+def fun_l7_n401()
+    fun_l8_n82
+end
+
+def fun_l7_n402()
+    fun_l8_n190
+end
+
+def fun_l7_n403()
+    fun_l8_n543
+end
+
+def fun_l7_n404()
+    fun_l8_n768
+end
+
+def fun_l7_n405()
+    fun_l8_n810
+end
+
+def fun_l7_n406()
+    fun_l8_n714
+end
+
+def fun_l7_n407()
+    fun_l8_n692
+end
+
+def fun_l7_n408()
+    fun_l8_n357
+end
+
+def fun_l7_n409()
+    fun_l8_n380
+end
+
+def fun_l7_n410()
+    fun_l8_n958
+end
+
+def fun_l7_n411()
+    fun_l8_n992
+end
+
+def fun_l7_n412()
+    fun_l8_n819
+end
+
+def fun_l7_n413()
+    fun_l8_n4
+end
+
+def fun_l7_n414()
+    fun_l8_n429
+end
+
+def fun_l7_n415()
+    fun_l8_n56
+end
+
+def fun_l7_n416()
+    fun_l8_n212
+end
+
+def fun_l7_n417()
+    fun_l8_n267
+end
+
+def fun_l7_n418()
+    fun_l8_n948
+end
+
+def fun_l7_n419()
+    fun_l8_n221
+end
+
+def fun_l7_n420()
+    fun_l8_n711
+end
+
+def fun_l7_n421()
+    fun_l8_n307
+end
+
+def fun_l7_n422()
+    fun_l8_n482
+end
+
+def fun_l7_n423()
+    fun_l8_n522
+end
+
+def fun_l7_n424()
+    fun_l8_n166
+end
+
+def fun_l7_n425()
+    fun_l8_n410
+end
+
+def fun_l7_n426()
+    fun_l8_n143
+end
+
+def fun_l7_n427()
+    fun_l8_n54
+end
+
+def fun_l7_n428()
+    fun_l8_n217
+end
+
+def fun_l7_n429()
+    fun_l8_n423
+end
+
+def fun_l7_n430()
+    fun_l8_n181
+end
+
+def fun_l7_n431()
+    fun_l8_n456
+end
+
+def fun_l7_n432()
+    fun_l8_n640
+end
+
+def fun_l7_n433()
+    fun_l8_n588
+end
+
+def fun_l7_n434()
+    fun_l8_n49
+end
+
+def fun_l7_n435()
+    fun_l8_n373
+end
+
+def fun_l7_n436()
+    fun_l8_n668
+end
+
+def fun_l7_n437()
+    fun_l8_n478
+end
+
+def fun_l7_n438()
+    fun_l8_n468
+end
+
+def fun_l7_n439()
+    fun_l8_n230
+end
+
+def fun_l7_n440()
+    fun_l8_n361
+end
+
+def fun_l7_n441()
+    fun_l8_n770
+end
+
+def fun_l7_n442()
+    fun_l8_n876
+end
+
+def fun_l7_n443()
+    fun_l8_n383
+end
+
+def fun_l7_n444()
+    fun_l8_n568
+end
+
+def fun_l7_n445()
+    fun_l8_n236
+end
+
+def fun_l7_n446()
+    fun_l8_n136
+end
+
+def fun_l7_n447()
+    fun_l8_n883
+end
+
+def fun_l7_n448()
+    fun_l8_n227
+end
+
+def fun_l7_n449()
+    fun_l8_n634
+end
+
+def fun_l7_n450()
+    fun_l8_n985
+end
+
+def fun_l7_n451()
+    fun_l8_n314
+end
+
+def fun_l7_n452()
+    fun_l8_n90
+end
+
+def fun_l7_n453()
+    fun_l8_n31
+end
+
+def fun_l7_n454()
+    fun_l8_n226
+end
+
+def fun_l7_n455()
+    fun_l8_n309
+end
+
+def fun_l7_n456()
+    fun_l8_n912
+end
+
+def fun_l7_n457()
+    fun_l8_n7
+end
+
+def fun_l7_n458()
+    fun_l8_n304
+end
+
+def fun_l7_n459()
+    fun_l8_n488
+end
+
+def fun_l7_n460()
+    fun_l8_n576
+end
+
+def fun_l7_n461()
+    fun_l8_n854
+end
+
+def fun_l7_n462()
+    fun_l8_n164
+end
+
+def fun_l7_n463()
+    fun_l8_n381
+end
+
+def fun_l7_n464()
+    fun_l8_n241
+end
+
+def fun_l7_n465()
+    fun_l8_n330
+end
+
+def fun_l7_n466()
+    fun_l8_n517
+end
+
+def fun_l7_n467()
+    fun_l8_n647
+end
+
+def fun_l7_n468()
+    fun_l8_n320
+end
+
+def fun_l7_n469()
+    fun_l8_n479
+end
+
+def fun_l7_n470()
+    fun_l8_n913
+end
+
+def fun_l7_n471()
+    fun_l8_n13
+end
+
+def fun_l7_n472()
+    fun_l8_n601
+end
+
+def fun_l7_n473()
+    fun_l8_n364
+end
+
+def fun_l7_n474()
+    fun_l8_n360
+end
+
+def fun_l7_n475()
+    fun_l8_n374
+end
+
+def fun_l7_n476()
+    fun_l8_n651
+end
+
+def fun_l7_n477()
+    fun_l8_n579
+end
+
+def fun_l7_n478()
+    fun_l8_n583
+end
+
+def fun_l7_n479()
+    fun_l8_n693
+end
+
+def fun_l7_n480()
+    fun_l8_n941
+end
+
+def fun_l7_n481()
+    fun_l8_n743
+end
+
+def fun_l7_n482()
+    fun_l8_n511
+end
+
+def fun_l7_n483()
+    fun_l8_n528
+end
+
+def fun_l7_n484()
+    fun_l8_n898
+end
+
+def fun_l7_n485()
+    fun_l8_n175
+end
+
+def fun_l7_n486()
+    fun_l8_n45
+end
+
+def fun_l7_n487()
+    fun_l8_n871
+end
+
+def fun_l7_n488()
+    fun_l8_n464
+end
+
+def fun_l7_n489()
+    fun_l8_n69
+end
+
+def fun_l7_n490()
+    fun_l8_n334
+end
+
+def fun_l7_n491()
+    fun_l8_n687
+end
+
+def fun_l7_n492()
+    fun_l8_n729
+end
+
+def fun_l7_n493()
+    fun_l8_n47
+end
+
+def fun_l7_n494()
+    fun_l8_n905
+end
+
+def fun_l7_n495()
+    fun_l8_n586
+end
+
+def fun_l7_n496()
+    fun_l8_n657
+end
+
+def fun_l7_n497()
+    fun_l8_n673
+end
+
+def fun_l7_n498()
+    fun_l8_n173
+end
+
+def fun_l7_n499()
+    fun_l8_n333
+end
+
+def fun_l7_n500()
+    fun_l8_n712
+end
+
+def fun_l7_n501()
+    fun_l8_n349
+end
+
+def fun_l7_n502()
+    fun_l8_n969
+end
+
+def fun_l7_n503()
+    fun_l8_n678
+end
+
+def fun_l7_n504()
+    fun_l8_n507
+end
+
+def fun_l7_n505()
+    fun_l8_n206
+end
+
+def fun_l7_n506()
+    fun_l8_n370
+end
+
+def fun_l7_n507()
+    fun_l8_n270
+end
+
+def fun_l7_n508()
+    fun_l8_n20
+end
+
+def fun_l7_n509()
+    fun_l8_n545
+end
+
+def fun_l7_n510()
+    fun_l8_n926
+end
+
+def fun_l7_n511()
+    fun_l8_n882
+end
+
+def fun_l7_n512()
+    fun_l8_n630
+end
+
+def fun_l7_n513()
+    fun_l8_n51
+end
+
+def fun_l7_n514()
+    fun_l8_n69
+end
+
+def fun_l7_n515()
+    fun_l8_n859
+end
+
+def fun_l7_n516()
+    fun_l8_n808
+end
+
+def fun_l7_n517()
+    fun_l8_n800
+end
+
+def fun_l7_n518()
+    fun_l8_n226
+end
+
+def fun_l7_n519()
+    fun_l8_n340
+end
+
+def fun_l7_n520()
+    fun_l8_n391
+end
+
+def fun_l7_n521()
+    fun_l8_n538
+end
+
+def fun_l7_n522()
+    fun_l8_n458
+end
+
+def fun_l7_n523()
+    fun_l8_n114
+end
+
+def fun_l7_n524()
+    fun_l8_n593
+end
+
+def fun_l7_n525()
+    fun_l8_n276
+end
+
+def fun_l7_n526()
+    fun_l8_n276
+end
+
+def fun_l7_n527()
+    fun_l8_n719
+end
+
+def fun_l7_n528()
+    fun_l8_n75
+end
+
+def fun_l7_n529()
+    fun_l8_n855
+end
+
+def fun_l7_n530()
+    fun_l8_n731
+end
+
+def fun_l7_n531()
+    fun_l8_n257
+end
+
+def fun_l7_n532()
+    fun_l8_n572
+end
+
+def fun_l7_n533()
+    fun_l8_n483
+end
+
+def fun_l7_n534()
+    fun_l8_n548
+end
+
+def fun_l7_n535()
+    fun_l8_n867
+end
+
+def fun_l7_n536()
+    fun_l8_n923
+end
+
+def fun_l7_n537()
+    fun_l8_n988
+end
+
+def fun_l7_n538()
+    fun_l8_n813
+end
+
+def fun_l7_n539()
+    fun_l8_n503
+end
+
+def fun_l7_n540()
+    fun_l8_n326
+end
+
+def fun_l7_n541()
+    fun_l8_n521
+end
+
+def fun_l7_n542()
+    fun_l8_n804
+end
+
+def fun_l7_n543()
+    fun_l8_n693
+end
+
+def fun_l7_n544()
+    fun_l8_n887
+end
+
+def fun_l7_n545()
+    fun_l8_n543
+end
+
+def fun_l7_n546()
+    fun_l8_n438
+end
+
+def fun_l7_n547()
+    fun_l8_n295
+end
+
+def fun_l7_n548()
+    fun_l8_n361
+end
+
+def fun_l7_n549()
+    fun_l8_n495
+end
+
+def fun_l7_n550()
+    fun_l8_n34
+end
+
+def fun_l7_n551()
+    fun_l8_n491
+end
+
+def fun_l7_n552()
+    fun_l8_n659
+end
+
+def fun_l7_n553()
+    fun_l8_n589
+end
+
+def fun_l7_n554()
+    fun_l8_n450
+end
+
+def fun_l7_n555()
+    fun_l8_n365
+end
+
+def fun_l7_n556()
+    fun_l8_n171
+end
+
+def fun_l7_n557()
+    fun_l8_n145
+end
+
+def fun_l7_n558()
+    fun_l8_n760
+end
+
+def fun_l7_n559()
+    fun_l8_n767
+end
+
+def fun_l7_n560()
+    fun_l8_n51
+end
+
+def fun_l7_n561()
+    fun_l8_n596
+end
+
+def fun_l7_n562()
+    fun_l8_n744
+end
+
+def fun_l7_n563()
+    fun_l8_n80
+end
+
+def fun_l7_n564()
+    fun_l8_n787
+end
+
+def fun_l7_n565()
+    fun_l8_n783
+end
+
+def fun_l7_n566()
+    fun_l8_n310
+end
+
+def fun_l7_n567()
+    fun_l8_n703
+end
+
+def fun_l7_n568()
+    fun_l8_n665
+end
+
+def fun_l7_n569()
+    fun_l8_n866
+end
+
+def fun_l7_n570()
+    fun_l8_n80
+end
+
+def fun_l7_n571()
+    fun_l8_n694
+end
+
+def fun_l7_n572()
+    fun_l8_n970
+end
+
+def fun_l7_n573()
+    fun_l8_n102
+end
+
+def fun_l7_n574()
+    fun_l8_n362
+end
+
+def fun_l7_n575()
+    fun_l8_n119
+end
+
+def fun_l7_n576()
+    fun_l8_n772
+end
+
+def fun_l7_n577()
+    fun_l8_n715
+end
+
+def fun_l7_n578()
+    fun_l8_n487
+end
+
+def fun_l7_n579()
+    fun_l8_n48
+end
+
+def fun_l7_n580()
+    fun_l8_n824
+end
+
+def fun_l7_n581()
+    fun_l8_n208
+end
+
+def fun_l7_n582()
+    fun_l8_n494
+end
+
+def fun_l7_n583()
+    fun_l8_n138
+end
+
+def fun_l7_n584()
+    fun_l8_n961
+end
+
+def fun_l7_n585()
+    fun_l8_n553
+end
+
+def fun_l7_n586()
+    fun_l8_n302
+end
+
+def fun_l7_n587()
+    fun_l8_n266
+end
+
+def fun_l7_n588()
+    fun_l8_n589
+end
+
+def fun_l7_n589()
+    fun_l8_n964
+end
+
+def fun_l7_n590()
+    fun_l8_n238
+end
+
+def fun_l7_n591()
+    fun_l8_n139
+end
+
+def fun_l7_n592()
+    fun_l8_n680
+end
+
+def fun_l7_n593()
+    fun_l8_n252
+end
+
+def fun_l7_n594()
+    fun_l8_n701
+end
+
+def fun_l7_n595()
+    fun_l8_n100
+end
+
+def fun_l7_n596()
+    fun_l8_n358
+end
+
+def fun_l7_n597()
+    fun_l8_n770
+end
+
+def fun_l7_n598()
+    fun_l8_n880
+end
+
+def fun_l7_n599()
+    fun_l8_n761
+end
+
+def fun_l7_n600()
+    fun_l8_n876
+end
+
+def fun_l7_n601()
+    fun_l8_n373
+end
+
+def fun_l7_n602()
+    fun_l8_n775
+end
+
+def fun_l7_n603()
+    fun_l8_n317
+end
+
+def fun_l7_n604()
+    fun_l8_n456
+end
+
+def fun_l7_n605()
+    fun_l8_n343
+end
+
+def fun_l7_n606()
+    fun_l8_n68
+end
+
+def fun_l7_n607()
+    fun_l8_n25
+end
+
+def fun_l7_n608()
+    fun_l8_n399
+end
+
+def fun_l7_n609()
+    fun_l8_n14
+end
+
+def fun_l7_n610()
+    fun_l8_n549
+end
+
+def fun_l7_n611()
+    fun_l8_n45
+end
+
+def fun_l7_n612()
+    fun_l8_n516
+end
+
+def fun_l7_n613()
+    fun_l8_n345
+end
+
+def fun_l7_n614()
+    fun_l8_n909
+end
+
+def fun_l7_n615()
+    fun_l8_n954
+end
+
+def fun_l7_n616()
+    fun_l8_n893
+end
+
+def fun_l7_n617()
+    fun_l8_n57
+end
+
+def fun_l7_n618()
+    fun_l8_n83
+end
+
+def fun_l7_n619()
+    fun_l8_n658
+end
+
+def fun_l7_n620()
+    fun_l8_n585
+end
+
+def fun_l7_n621()
+    fun_l8_n260
+end
+
+def fun_l7_n622()
+    fun_l8_n226
+end
+
+def fun_l7_n623()
+    fun_l8_n186
+end
+
+def fun_l7_n624()
+    fun_l8_n994
+end
+
+def fun_l7_n625()
+    fun_l8_n408
+end
+
+def fun_l7_n626()
+    fun_l8_n878
+end
+
+def fun_l7_n627()
+    fun_l8_n473
+end
+
+def fun_l7_n628()
+    fun_l8_n153
+end
+
+def fun_l7_n629()
+    fun_l8_n590
+end
+
+def fun_l7_n630()
+    fun_l8_n610
+end
+
+def fun_l7_n631()
+    fun_l8_n438
+end
+
+def fun_l7_n632()
+    fun_l8_n484
+end
+
+def fun_l7_n633()
+    fun_l8_n908
+end
+
+def fun_l7_n634()
+    fun_l8_n992
+end
+
+def fun_l7_n635()
+    fun_l8_n556
+end
+
+def fun_l7_n636()
+    fun_l8_n929
+end
+
+def fun_l7_n637()
+    fun_l8_n128
+end
+
+def fun_l7_n638()
+    fun_l8_n372
+end
+
+def fun_l7_n639()
+    fun_l8_n36
+end
+
+def fun_l7_n640()
+    fun_l8_n545
+end
+
+def fun_l7_n641()
+    fun_l8_n801
+end
+
+def fun_l7_n642()
+    fun_l8_n444
+end
+
+def fun_l7_n643()
+    fun_l8_n822
+end
+
+def fun_l7_n644()
+    fun_l8_n587
+end
+
+def fun_l7_n645()
+    fun_l8_n418
+end
+
+def fun_l7_n646()
+    fun_l8_n539
+end
+
+def fun_l7_n647()
+    fun_l8_n266
+end
+
+def fun_l7_n648()
+    fun_l8_n869
+end
+
+def fun_l7_n649()
+    fun_l8_n84
+end
+
+def fun_l7_n650()
+    fun_l8_n265
+end
+
+def fun_l7_n651()
+    fun_l8_n551
+end
+
+def fun_l7_n652()
+    fun_l8_n35
+end
+
+def fun_l7_n653()
+    fun_l8_n606
+end
+
+def fun_l7_n654()
+    fun_l8_n379
+end
+
+def fun_l7_n655()
+    fun_l8_n417
+end
+
+def fun_l7_n656()
+    fun_l8_n641
+end
+
+def fun_l7_n657()
+    fun_l8_n889
+end
+
+def fun_l7_n658()
+    fun_l8_n232
+end
+
+def fun_l7_n659()
+    fun_l8_n957
+end
+
+def fun_l7_n660()
+    fun_l8_n666
+end
+
+def fun_l7_n661()
+    fun_l8_n588
+end
+
+def fun_l7_n662()
+    fun_l8_n591
+end
+
+def fun_l7_n663()
+    fun_l8_n489
+end
+
+def fun_l7_n664()
+    fun_l8_n927
+end
+
+def fun_l7_n665()
+    fun_l8_n304
+end
+
+def fun_l7_n666()
+    fun_l8_n856
+end
+
+def fun_l7_n667()
+    fun_l8_n969
+end
+
+def fun_l7_n668()
+    fun_l8_n36
+end
+
+def fun_l7_n669()
+    fun_l8_n335
+end
+
+def fun_l7_n670()
+    fun_l8_n51
+end
+
+def fun_l7_n671()
+    fun_l8_n765
+end
+
+def fun_l7_n672()
+    fun_l8_n262
+end
+
+def fun_l7_n673()
+    fun_l8_n858
+end
+
+def fun_l7_n674()
+    fun_l8_n412
+end
+
+def fun_l7_n675()
+    fun_l8_n789
+end
+
+def fun_l7_n676()
+    fun_l8_n290
+end
+
+def fun_l7_n677()
+    fun_l8_n935
+end
+
+def fun_l7_n678()
+    fun_l8_n212
+end
+
+def fun_l7_n679()
+    fun_l8_n35
+end
+
+def fun_l7_n680()
+    fun_l8_n141
+end
+
+def fun_l7_n681()
+    fun_l8_n985
+end
+
+def fun_l7_n682()
+    fun_l8_n626
+end
+
+def fun_l7_n683()
+    fun_l8_n996
+end
+
+def fun_l7_n684()
+    fun_l8_n906
+end
+
+def fun_l7_n685()
+    fun_l8_n242
+end
+
+def fun_l7_n686()
+    fun_l8_n431
+end
+
+def fun_l7_n687()
+    fun_l8_n494
+end
+
+def fun_l7_n688()
+    fun_l8_n564
+end
+
+def fun_l7_n689()
+    fun_l8_n737
+end
+
+def fun_l7_n690()
+    fun_l8_n366
+end
+
+def fun_l7_n691()
+    fun_l8_n763
+end
+
+def fun_l7_n692()
+    fun_l8_n556
+end
+
+def fun_l7_n693()
+    fun_l8_n436
+end
+
+def fun_l7_n694()
+    fun_l8_n17
+end
+
+def fun_l7_n695()
+    fun_l8_n283
+end
+
+def fun_l7_n696()
+    fun_l8_n641
+end
+
+def fun_l7_n697()
+    fun_l8_n298
+end
+
+def fun_l7_n698()
+    fun_l8_n819
+end
+
+def fun_l7_n699()
+    fun_l8_n858
+end
+
+def fun_l7_n700()
+    fun_l8_n161
+end
+
+def fun_l7_n701()
+    fun_l8_n813
+end
+
+def fun_l7_n702()
+    fun_l8_n604
+end
+
+def fun_l7_n703()
+    fun_l8_n878
+end
+
+def fun_l7_n704()
+    fun_l8_n880
+end
+
+def fun_l7_n705()
+    fun_l8_n431
+end
+
+def fun_l7_n706()
+    fun_l8_n944
+end
+
+def fun_l7_n707()
+    fun_l8_n672
+end
+
+def fun_l7_n708()
+    fun_l8_n983
+end
+
+def fun_l7_n709()
+    fun_l8_n224
+end
+
+def fun_l7_n710()
+    fun_l8_n915
+end
+
+def fun_l7_n711()
+    fun_l8_n699
+end
+
+def fun_l7_n712()
+    fun_l8_n112
+end
+
+def fun_l7_n713()
+    fun_l8_n64
+end
+
+def fun_l7_n714()
+    fun_l8_n3
+end
+
+def fun_l7_n715()
+    fun_l8_n508
+end
+
+def fun_l7_n716()
+    fun_l8_n172
+end
+
+def fun_l7_n717()
+    fun_l8_n777
+end
+
+def fun_l7_n718()
+    fun_l8_n328
+end
+
+def fun_l7_n719()
+    fun_l8_n338
+end
+
+def fun_l7_n720()
+    fun_l8_n897
+end
+
+def fun_l7_n721()
+    fun_l8_n373
+end
+
+def fun_l7_n722()
+    fun_l8_n91
+end
+
+def fun_l7_n723()
+    fun_l8_n149
+end
+
+def fun_l7_n724()
+    fun_l8_n65
+end
+
+def fun_l7_n725()
+    fun_l8_n685
+end
+
+def fun_l7_n726()
+    fun_l8_n939
+end
+
+def fun_l7_n727()
+    fun_l8_n427
+end
+
+def fun_l7_n728()
+    fun_l8_n606
+end
+
+def fun_l7_n729()
+    fun_l8_n818
+end
+
+def fun_l7_n730()
+    fun_l8_n24
+end
+
+def fun_l7_n731()
+    fun_l8_n901
+end
+
+def fun_l7_n732()
+    fun_l8_n979
+end
+
+def fun_l7_n733()
+    fun_l8_n88
+end
+
+def fun_l7_n734()
+    fun_l8_n516
+end
+
+def fun_l7_n735()
+    fun_l8_n44
+end
+
+def fun_l7_n736()
+    fun_l8_n540
+end
+
+def fun_l7_n737()
+    fun_l8_n586
+end
+
+def fun_l7_n738()
+    fun_l8_n695
+end
+
+def fun_l7_n739()
+    fun_l8_n774
+end
+
+def fun_l7_n740()
+    fun_l8_n797
+end
+
+def fun_l7_n741()
+    fun_l8_n524
+end
+
+def fun_l7_n742()
+    fun_l8_n784
+end
+
+def fun_l7_n743()
+    fun_l8_n203
+end
+
+def fun_l7_n744()
+    fun_l8_n808
+end
+
+def fun_l7_n745()
+    fun_l8_n216
+end
+
+def fun_l7_n746()
+    fun_l8_n14
+end
+
+def fun_l7_n747()
+    fun_l8_n799
+end
+
+def fun_l7_n748()
+    fun_l8_n660
+end
+
+def fun_l7_n749()
+    fun_l8_n417
+end
+
+def fun_l7_n750()
+    fun_l8_n573
+end
+
+def fun_l7_n751()
+    fun_l8_n919
+end
+
+def fun_l7_n752()
+    fun_l8_n956
+end
+
+def fun_l7_n753()
+    fun_l8_n475
+end
+
+def fun_l7_n754()
+    fun_l8_n941
+end
+
+def fun_l7_n755()
+    fun_l8_n629
+end
+
+def fun_l7_n756()
+    fun_l8_n745
+end
+
+def fun_l7_n757()
+    fun_l8_n656
+end
+
+def fun_l7_n758()
+    fun_l8_n315
+end
+
+def fun_l7_n759()
+    fun_l8_n952
+end
+
+def fun_l7_n760()
+    fun_l8_n241
+end
+
+def fun_l7_n761()
+    fun_l8_n341
+end
+
+def fun_l7_n762()
+    fun_l8_n156
+end
+
+def fun_l7_n763()
+    fun_l8_n258
+end
+
+def fun_l7_n764()
+    fun_l8_n275
+end
+
+def fun_l7_n765()
+    fun_l8_n950
+end
+
+def fun_l7_n766()
+    fun_l8_n715
+end
+
+def fun_l7_n767()
+    fun_l8_n746
+end
+
+def fun_l7_n768()
+    fun_l8_n428
+end
+
+def fun_l7_n769()
+    fun_l8_n176
+end
+
+def fun_l7_n770()
+    fun_l8_n586
+end
+
+def fun_l7_n771()
+    fun_l8_n912
+end
+
+def fun_l7_n772()
+    fun_l8_n484
+end
+
+def fun_l7_n773()
+    fun_l8_n155
+end
+
+def fun_l7_n774()
+    fun_l8_n648
+end
+
+def fun_l7_n775()
+    fun_l8_n27
+end
+
+def fun_l7_n776()
+    fun_l8_n188
+end
+
+def fun_l7_n777()
+    fun_l8_n804
+end
+
+def fun_l7_n778()
+    fun_l8_n646
+end
+
+def fun_l7_n779()
+    fun_l8_n884
+end
+
+def fun_l7_n780()
+    fun_l8_n332
+end
+
+def fun_l7_n781()
+    fun_l8_n28
+end
+
+def fun_l7_n782()
+    fun_l8_n966
+end
+
+def fun_l7_n783()
+    fun_l8_n531
+end
+
+def fun_l7_n784()
+    fun_l8_n955
+end
+
+def fun_l7_n785()
+    fun_l8_n264
+end
+
+def fun_l7_n786()
+    fun_l8_n387
+end
+
+def fun_l7_n787()
+    fun_l8_n274
+end
+
+def fun_l7_n788()
+    fun_l8_n790
+end
+
+def fun_l7_n789()
+    fun_l8_n80
+end
+
+def fun_l7_n790()
+    fun_l8_n551
+end
+
+def fun_l7_n791()
+    fun_l8_n762
+end
+
+def fun_l7_n792()
+    fun_l8_n777
+end
+
+def fun_l7_n793()
+    fun_l8_n120
+end
+
+def fun_l7_n794()
+    fun_l8_n189
+end
+
+def fun_l7_n795()
+    fun_l8_n241
+end
+
+def fun_l7_n796()
+    fun_l8_n608
+end
+
+def fun_l7_n797()
+    fun_l8_n689
+end
+
+def fun_l7_n798()
+    fun_l8_n406
+end
+
+def fun_l7_n799()
+    fun_l8_n853
+end
+
+def fun_l7_n800()
+    fun_l8_n606
+end
+
+def fun_l7_n801()
+    fun_l8_n723
+end
+
+def fun_l7_n802()
+    fun_l8_n498
+end
+
+def fun_l7_n803()
+    fun_l8_n109
+end
+
+def fun_l7_n804()
+    fun_l8_n400
+end
+
+def fun_l7_n805()
+    fun_l8_n266
+end
+
+def fun_l7_n806()
+    fun_l8_n661
+end
+
+def fun_l7_n807()
+    fun_l8_n107
+end
+
+def fun_l7_n808()
+    fun_l8_n541
+end
+
+def fun_l7_n809()
+    fun_l8_n44
+end
+
+def fun_l7_n810()
+    fun_l8_n184
+end
+
+def fun_l7_n811()
+    fun_l8_n516
+end
+
+def fun_l7_n812()
+    fun_l8_n706
+end
+
+def fun_l7_n813()
+    fun_l8_n714
+end
+
+def fun_l7_n814()
+    fun_l8_n399
+end
+
+def fun_l7_n815()
+    fun_l8_n877
+end
+
+def fun_l7_n816()
+    fun_l8_n301
+end
+
+def fun_l7_n817()
+    fun_l8_n75
+end
+
+def fun_l7_n818()
+    fun_l8_n169
+end
+
+def fun_l7_n819()
+    fun_l8_n99
+end
+
+def fun_l7_n820()
+    fun_l8_n155
+end
+
+def fun_l7_n821()
+    fun_l8_n281
+end
+
+def fun_l7_n822()
+    fun_l8_n210
+end
+
+def fun_l7_n823()
+    fun_l8_n835
+end
+
+def fun_l7_n824()
+    fun_l8_n700
+end
+
+def fun_l7_n825()
+    fun_l8_n231
+end
+
+def fun_l7_n826()
+    fun_l8_n967
+end
+
+def fun_l7_n827()
+    fun_l8_n818
+end
+
+def fun_l7_n828()
+    fun_l8_n670
+end
+
+def fun_l7_n829()
+    fun_l8_n311
+end
+
+def fun_l7_n830()
+    fun_l8_n919
+end
+
+def fun_l7_n831()
+    fun_l8_n949
+end
+
+def fun_l7_n832()
+    fun_l8_n677
+end
+
+def fun_l7_n833()
+    fun_l8_n626
+end
+
+def fun_l7_n834()
+    fun_l8_n171
+end
+
+def fun_l7_n835()
+    fun_l8_n723
+end
+
+def fun_l7_n836()
+    fun_l8_n606
+end
+
+def fun_l7_n837()
+    fun_l8_n580
+end
+
+def fun_l7_n838()
+    fun_l8_n369
+end
+
+ @@ ossl_ocspbres_add_nonce(int argc, VALUE *argv, VALUE self)
 
     rb_scan_args(argc, argv, "01", &val);
     if(NIL_P(val)) {
-	GetOCSPBasicRes(self, bs);
-	ret = OCSP_basic_add1_nonce(bs, NULL, -1);
+        GetOCSPBasicRes(self, bs);
+        ret = OCSP_basic_add1_nonce(bs, NULL, -1);
     }
     else{
-	StringValue(val);
-	GetOCSPBasicRes(self, bs);
-	ret = OCSP_basic_add1_nonce(bs, (unsigned char *)RSTRING_PTR(val), RSTRING_LENINT(val));
+        StringValue(val);
+        GetOCSPBasicRes(self, bs);
+        ret = OCSP_basic_add1_nonce(bs, (unsigned char *)RSTRING_PTR(val), RSTRING_LENINT(val));
     }
     if(!ret) ossl_raise(eOCSPError, NULL);
 
@@ -777,12 +780,12 @@ add_status_convert_time(VALUE obj)
     ASN1_TIME *time;
 
     if (RB_INTEGER_TYPE_P(obj))
-	time = X509_gmtime_adj(NULL, NUM2INT(obj));
+        time = X509_gmtime_adj(NULL, NUM2INT(obj));
     else
-	time = ossl_x509_time_adjust(NULL, obj);
+        time = ossl_x509_time_adjust(NULL, obj);
 
     if (!time)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
 
     return (VALUE)time;
 }
@@ -816,8 +819,8 @@ add_status_convert_time(VALUE obj)
  */
 static VALUE
 ossl_ocspbres_add_status(VALUE self, VALUE cid, VALUE status,
-			 VALUE reason, VALUE revtime,
-			 VALUE thisupd, VALUE nextupd, VALUE ext)
+                         VALUE reason, VALUE revtime,
+                         VALUE thisupd, VALUE nextupd, VALUE ext)
 {
     OCSP_BASICRESP *bs;
     OCSP_SINGLERESP *single;
@@ -831,16 +834,16 @@ ossl_ocspbres_add_status(VALUE self, VALUE cid, VALUE status,
     GetOCSPCertId(cid, id);
     st = NUM2INT(status);
     if (!NIL_P(ext)) { /* All ext's members must be X509::Extension */
-	ext = rb_check_array_type(ext);
-	for (i = 0; i < RARRAY_LEN(ext); i++)
-	    OSSL_Check_Kind(RARRAY_AREF(ext, i), cX509Ext);
+        ext = rb_check_array_type(ext);
+        for (i = 0; i < RARRAY_LEN(ext); i++)
+            OSSL_Check_Kind(RARRAY_AREF(ext, i), cX509Ext);
     }
 
     if (st == V_OCSP_CERTSTATUS_REVOKED) {
-	rsn = NUM2INT(reason);
-	tmp = rb_protect(add_status_convert_time, revtime, &rstatus);
-	if (rstatus) goto err;
-	rev = (ASN1_TIME *)tmp;
+        rsn = NUM2INT(reason);
+        tmp = rb_protect(add_status_convert_time, revtime, &rstatus);
+        if (rstatus) goto err;
+        rev = (ASN1_TIME *)tmp;
     }
 
     tmp = rb_protect(add_status_convert_time, thisupd, &rstatus);
@@ -848,29 +851,29 @@ ossl_ocspbres_add_status(VALUE self, VALUE cid, VALUE status,
     ths = (ASN1_TIME *)tmp;
 
     if (!NIL_P(nextupd)) {
-	tmp = rb_protect(add_status_convert_time, nextupd, &rstatus);
-	if (rstatus) goto err;
-	nxt = (ASN1_TIME *)tmp;
+        tmp = rb_protect(add_status_convert_time, nextupd, &rstatus);
+        if (rstatus) goto err;
+        nxt = (ASN1_TIME *)tmp;
     }
 
     if(!(single = OCSP_basic_add1_status(bs, id, st, rsn, rev, ths, nxt))){
-	error = 1;
-	goto err;
+        error = 1;
+        goto err;
     }
 
     if(!NIL_P(ext)){
-	X509_EXTENSION *x509ext;
-
-	for(i = 0; i < RARRAY_LEN(ext); i++){
-	    x509ext = GetX509ExtPtr(RARRAY_AREF(ext, i));
-	    if(!OCSP_SINGLERESP_add_ext(single, x509ext, -1)){
-		error = 1;
-		goto err;
-	    }
-	}
+        X509_EXTENSION *x509ext;
+
+        for(i = 0; i < RARRAY_LEN(ext); i++){
+            x509ext = GetX509ExtPtr(RARRAY_AREF(ext, i));
+            if(!OCSP_SINGLERESP_add_ext(single, x509ext, -1)){
+                error = 1;
+                goto err;
+            }
+        }
     }
 
- err:
+  err:
     ASN1_TIME_free(ths);
     ASN1_TIME_free(nxt);
     ASN1_TIME_free(rev);
@@ -896,48 +899,40 @@ static VALUE
 ossl_ocspbres_get_status(VALUE self)
 {
     OCSP_BASICRESP *bs;
-    OCSP_SINGLERESP *single;
-    OCSP_CERTID *cid;
-    ASN1_TIME *revtime, *thisupd, *nextupd;
-    int status, reason;
-    X509_EXTENSION *x509ext;
-    VALUE ret, ary, ext;
-    int count, ext_count, i, j;
 
     GetOCSPBasicRes(self, bs);
-    ret = rb_ary_new();
-    count = OCSP_resp_count(bs);
-    for(i = 0; i < count; i++){
-	single = OCSP_resp_get0(bs, i);
-	if(!single) continue;
-
-	revtime = thisupd = nextupd = NULL;
-	status = OCSP_single_get0_status(single, &reason, &revtime,
-					 &thisupd, &nextupd);
-	if(status < 0) continue;
-	if(!(cid = OCSP_CERTID_dup((OCSP_CERTID *)OCSP_SINGLERESP_get0_id(single)))) /* FIXME */
-	    ossl_raise(eOCSPError, NULL);
-	ary = rb_ary_new();
-	rb_ary_push(ary, ossl_ocspcertid_new(cid));
-	rb_ary_push(ary, INT2NUM(status));
-	rb_ary_push(ary, INT2NUM(reason));
-	rb_ary_push(ary, revtime ? asn1time_to_time(revtime) : Qnil);
-	rb_ary_push(ary, thisupd ? asn1time_to_time(thisupd) : Qnil);
-	rb_ary_push(ary, nextupd ? asn1time_to_time(nextupd) : Qnil);
-	ext = rb_ary_new();
-	ext_count = OCSP_SINGLERESP_get_ext_count(single);
-	for(j = 0; j < ext_count; j++){
-	    x509ext = OCSP_SINGLERESP_get_ext(single, j);
-	    rb_ary_push(ext, ossl_x509ext_new(x509ext));
-	}
-	rb_ary_push(ary, ext);
-	rb_ary_push(ret, ary);
+    VALUE ret = rb_ary_new();
+    int count = OCSP_resp_count(bs);
+    for (int i = 0; i < count; i++) {
+        OCSP_SINGLERESP *single = OCSP_resp_get0(bs, i);
+        ASN1_TIME *revtime = NULL, *thisupd = NULL, *nextupd = NULL;
+        int reason = -1;
+
+        int status = OCSP_single_get0_status(single, &reason, &revtime, &thisupd, &nextupd);
+        if (status < 0)
+            ossl_raise(eOCSPError, "OCSP_single_get0_status");
+
+        VALUE ary = rb_ary_new();
+        rb_ary_push(ary, ossl_ocspcid_new(OCSP_SINGLERESP_get0_id(single)));
+        rb_ary_push(ary, INT2NUM(status));
+        rb_ary_push(ary, INT2NUM(reason));
+        rb_ary_push(ary, revtime ? asn1time_to_time(revtime) : Qnil);
+        rb_ary_push(ary, thisupd ? asn1time_to_time(thisupd) : Qnil);
+        rb_ary_push(ary, nextupd ? asn1time_to_time(nextupd) : Qnil);
+        VALUE ext = rb_ary_new();
+        int ext_count = OCSP_SINGLERESP_get_ext_count(single);
+        for (int j = 0; j < ext_count; j++) {
+            const X509_EXTENSION *x509ext = OCSP_SINGLERESP_get_ext(single, j);
+            rb_ary_push(ext, ossl_x509ext_new(x509ext));
+        }
+        rb_ary_push(ary, ext);
+        rb_ary_push(ret, ary);
     }
 
     return ret;
 }
 
-static VALUE ossl_ocspsres_new(OCSP_SINGLERESP *);
+static VALUE ossl_ocspsres_new(const OCSP_SINGLERESP *);
 
 /*
  * call-seq:
@@ -955,17 +950,10 @@ ossl_ocspbres_get_responses(VALUE self)
 
     GetOCSPBasicRes(self, bs);
     count = OCSP_resp_count(bs);
-    ret = rb_ary_new2(count);
+    ret = rb_ary_new_capa(count);
 
     for (i = 0; i < count; i++) {
-	OCSP_SINGLERESP *sres, *sres_new;
-
-	sres = OCSP_resp_get0(bs, i);
-	sres_new = ASN1_item_dup(ASN1_ITEM_rptr(OCSP_SINGLERESP), sres);
-	if (!sres_new)
-	    ossl_raise(eOCSPError, "ASN1_item_dup");
-
-	rb_ary_push(ret, ossl_ocspsres_new(sres_new));
+        rb_ary_push(ret, ossl_ocspsres_new(OCSP_resp_get0(bs, i)));
     }
 
     return ret;
@@ -983,7 +971,6 @@ static VALUE
 ossl_ocspbres_find_response(VALUE self, VALUE target)
 {
     OCSP_BASICRESP *bs;
-    OCSP_SINGLERESP *sres, *sres_new;
     OCSP_CERTID *id;
     int n;
 
@@ -991,14 +978,8 @@ ossl_ocspbres_find_response(VALUE self, VALUE target)
     GetOCSPBasicRes(self, bs);
 
     if ((n = OCSP_resp_find(bs, id, -1)) == -1)
-	return Qnil;
-
-    sres = OCSP_resp_get0(bs, n);
-    sres_new = ASN1_item_dup(ASN1_ITEM_rptr(OCSP_SINGLERESP), sres);
-    if (!sres_new)
-	ossl_raise(eOCSPError, "ASN1_item_dup");
-
-    return ossl_ocspsres_new(sres_new);
+        return Qnil;
+    return ossl_ocspsres_new(OCSP_resp_get0(bs, n));
 }
 
 /*
@@ -1017,7 +998,7 @@ ossl_ocspbres_find_response(VALUE self, VALUE target)
 static VALUE
 ossl_ocspbres_sign(int argc, VALUE *argv, VALUE self)
 {
-    VALUE signer_cert, signer_key, certs, flags, digest;
+    VALUE signer_cert, signer_key, certs, flags, digest, md_holder;
     OCSP_BASICRESP *bs;
     X509 *signer;
     EVP_PKEY *key;
@@ -1031,19 +1012,17 @@ ossl_ocspbres_sign(int argc, VALUE *argv, VALUE self)
     signer = GetX509CertPtr(signer_cert);
     key = GetPrivPKeyPtr(signer_key);
     if (!NIL_P(flags))
-	flg = NUM2INT(flags);
-    if (NIL_P(digest))
-	md = NULL;
-    else
-	md = ossl_evp_get_digestbyname(digest);
+        flg = NUM2INT(flags);
+    md = NIL_P(digest) ? NULL : ossl_evp_md_fetch(digest, &md_holder);
     if (NIL_P(certs))
-	flg |= OCSP_NOCERTS;
+        flg |= OCSP_NOCERTS;
     else
-	x509s = ossl_x509_ary2sk(certs);
+        x509s = ossl_x509_ary2sk(certs);
 
     ret = OCSP_basic_sign(bs, signer, key, md, x509s, flg);
     sk_X509_pop_free(x509s, X509_free);
-    if (!ret) ossl_raise(eOCSPError, NULL);
+    if (!ret)
+        ossl_raise(eOCSPError, "OCSP_basic_sign");
 
     return self;
 }
@@ -1072,7 +1051,7 @@ ossl_ocspbres_verify(int argc, VALUE *argv, VALUE self)
     result = OCSP_basic_verify(bs, x509s, x509st, flg);
     sk_X509_pop_free(x509s, X509_free);
     if (result <= 0)
-	ossl_clear_error();
+        ossl_clear_error();
 
     return result > 0 ? Qtrue : Qfalse;
 }
@@ -1093,11 +1072,11 @@ ossl_ocspbres_to_der(VALUE self)
 
     GetOCSPBasicRes(self, res);
     if ((len = i2d_OCSP_BASICRESP(res, NULL)) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_OCSP_BASICRESP(res, &p) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -1107,12 +1086,18 @@ ossl_ocspbres_to_der(VALUE self)
  * OCSP::SingleResponse
  */
 static VALUE
-ossl_ocspsres_new(OCSP_SINGLERESP *sres)
+ossl_ocspsres_new(const OCSP_SINGLERESP *sres)
 {
     VALUE obj;
+    OCSP_SINGLERESP *sres_new;
 
     obj = NewOCSPSingleRes(cOCSPSingleRes);
-    SetOCSPSingleRes(obj, sres);
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    sres_new = ASN1_item_dup(ASN1_ITEM_rptr(OCSP_SINGLERESP),
+                             (OCSP_SINGLERESP *)sres);
+    if (!sres_new)
+        ossl_raise(eOCSPError, "ASN1_item_dup");
+    SetOCSPSingleRes(obj, sres_new);
 
     return obj;
 }
@@ -1125,7 +1110,7 @@ ossl_ocspsres_alloc(VALUE klass)
 
     obj = NewOCSPSingleRes(klass);
     if (!(sres = OCSP_SINGLERESP_new()))
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     SetOCSPSingleRes(obj, sres);
 
     return obj;
@@ -1150,13 +1135,14 @@ ossl_ocspsres_initialize(VALUE self, VALUE arg)
     p = (unsigned char*)RSTRING_PTR(arg);
     res_new = d2i_OCSP_SINGLERESP(NULL, &p, RSTRING_LEN(arg));
     if (!res_new)
-	ossl_raise(eOCSPError, "d2i_OCSP_SINGLERESP");
+        ossl_raise(eOCSPError, "d2i_OCSP_SINGLERESP");
     SetOCSPSingleRes(self, res_new);
     OCSP_SINGLERESP_free(res);
 
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_ocspsres_initialize_copy(VALUE self, VALUE other)
 {
@@ -1168,7 +1154,7 @@ ossl_ocspsres_initialize_copy(VALUE self, VALUE other)
 
     sres_new = ASN1_item_dup(ASN1_ITEM_rptr(OCSP_SINGLERESP), sres);
     if (!sres_new)
-	ossl_raise(eOCSPError, "ASN1_item_dup");
+        ossl_raise(eOCSPError, "ASN1_item_dup");
 
     SetOCSPSingleRes(self, sres_new);
     OCSP_SINGLERESP_free(sres_old);
@@ -1207,15 +1193,15 @@ ossl_ocspsres_check_validity(int argc, VALUE *argv, VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, NULL, NULL, &this_update, &next_update);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
 
     ret = OCSP_check_validity(this_update, next_update, nsec, maxsec);
 
     if (ret)
-	return Qtrue;
+        return Qtrue;
     else {
-	ossl_clear_error();
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
     }
 }
 
@@ -1229,12 +1215,9 @@ static VALUE
 ossl_ocspsres_get_certid(VALUE self)
 {
     OCSP_SINGLERESP *sres;
-    OCSP_CERTID *id;
 
     GetOCSPSingleRes(self, sres);
-    id = OCSP_CERTID_dup((OCSP_CERTID *)OCSP_SINGLERESP_get0_id(sres)); /* FIXME */
-
-    return ossl_ocspcertid_new(id);
+    return ossl_ocspcid_new(OCSP_SINGLERESP_get0_id(sres));
 }
 
 /*
@@ -1260,7 +1243,7 @@ ossl_ocspsres_get_cert_status(VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, NULL, NULL, NULL, NULL);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
 
     return INT2NUM(status);
 }
@@ -1279,9 +1262,9 @@ ossl_ocspsres_get_this_update(VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, NULL, NULL, &time, NULL);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -1300,9 +1283,9 @@ ossl_ocspsres_get_next_update(VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, NULL, NULL, NULL, &time);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -1321,11 +1304,11 @@ ossl_ocspsres_get_revocation_time(VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, NULL, &time, NULL, NULL);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
     if (status != V_OCSP_CERTSTATUS_REVOKED)
-	ossl_raise(eOCSPError, "certificate is not revoked");
+        ossl_raise(eOCSPError, "certificate is not revoked");
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -1343,9 +1326,9 @@ ossl_ocspsres_get_revocation_reason(VALUE self)
     GetOCSPSingleRes(self, sres);
     status = OCSP_single_get0_status(sres, &reason, NULL, NULL, NULL);
     if (status < 0)
-	ossl_raise(eOCSPError, "OCSP_single_get0_status");
+        ossl_raise(eOCSPError, "OCSP_single_get0_status");
     if (status != V_OCSP_CERTSTATUS_REVOKED)
-	ossl_raise(eOCSPError, "certificate is not revoked");
+        ossl_raise(eOCSPError, "certificate is not revoked");
 
     return INT2NUM(reason);
 }
@@ -1358,7 +1341,6 @@ static VALUE
 ossl_ocspsres_get_extensions(VALUE self)
 {
     OCSP_SINGLERESP *sres;
-    X509_EXTENSION *ext;
     int count, i;
     VALUE ary;
 
@@ -1367,8 +1349,8 @@ ossl_ocspsres_get_extensions(VALUE self)
     count = OCSP_SINGLERESP_get_ext_count(sres);
     ary = rb_ary_new2(count);
     for (i = 0; i < count; i++) {
-	ext = OCSP_SINGLERESP_get_ext(sres, i);
-	rb_ary_push(ary, ossl_x509ext_new(ext)); /* will dup */
+        const X509_EXTENSION *ext = OCSP_SINGLERESP_get_ext(sres, i);
+        rb_ary_push(ary, ossl_x509ext_new(ext)); /* will dup */
     }
 
     return ary;
@@ -1390,11 +1372,11 @@ ossl_ocspsres_to_der(VALUE self)
 
     GetOCSPSingleRes(self, sres);
     if ((len = i2d_OCSP_SINGLERESP(sres, NULL)) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_OCSP_SINGLERESP(sres, &p) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -1412,12 +1394,13 @@ ossl_ocspcid_alloc(VALUE klass)
 
     obj = NewOCSPCertId(klass);
     if(!(id = OCSP_CERTID_new()))
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     SetOCSPCertId(obj, id);
 
     return obj;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_ocspcid_initialize_copy(VALUE self, VALUE other)
 {
@@ -1429,7 +1412,7 @@ ossl_ocspcid_initialize_copy(VALUE self, VALUE other)
 
     cid_new = OCSP_CERTID_dup(cid);
     if (!cid_new)
-	ossl_raise(eOCSPError, "OCSP_CERTID_dup");
+        ossl_raise(eOCSPError, "OCSP_CERTID_dup");
 
     SetOCSPCertId(self, cid_new);
     OCSP_CERTID_free(cid_old);
@@ -1459,27 +1442,28 @@ ossl_ocspcid_initialize(int argc, VALUE *argv, VALUE self)
 
     GetOCSPCertId(self, id);
     if (rb_scan_args(argc, argv, "12", &subject, &issuer, &digest) == 1) {
-	VALUE arg;
-	const unsigned char *p;
-
-	arg = ossl_to_der_if_possible(subject);
-	StringValue(arg);
-	p = (unsigned char *)RSTRING_PTR(arg);
-	newid = d2i_OCSP_CERTID(NULL, &p, RSTRING_LEN(arg));
-	if (!newid)
-	    ossl_raise(eOCSPError, "d2i_OCSP_CERTID");
+        VALUE arg;
+        const unsigned char *p;
+
+        arg = ossl_to_der_if_possible(subject);
+        StringValue(arg);
+        p = (unsigned char *)RSTRING_PTR(arg);
+        newid = d2i_OCSP_CERTID(NULL, &p, RSTRING_LEN(arg));
+        if (!newid)
+            ossl_raise(eOCSPError, "d2i_OCSP_CERTID");
     }
     else {
-	X509 *x509s, *x509i;
-	const EVP_MD *md;
+        X509 *x509s, *x509i;
+        const EVP_MD *md;
+        VALUE md_holder;
 
-	x509s = GetX509CertPtr(subject); /* NO NEED TO DUP */
-	x509i = GetX509CertPtr(issuer); /* NO NEED TO DUP */
-	md = !NIL_P(digest) ? ossl_evp_get_digestbyname(digest) : NULL;
+        x509s = GetX509CertPtr(subject); /* NO NEED TO DUP */
+        x509i = GetX509CertPtr(issuer); /* NO NEED TO DUP */
+        md = NIL_P(digest) ? NULL : ossl_evp_md_fetch(digest, &md_holder);
 
-	newid = OCSP_cert_to_id(md, x509s, x509i);
-	if (!newid)
-	    ossl_raise(eOCSPError, "OCSP_cert_to_id");
+        newid = OCSP_cert_to_id(md, x509s, x509i);
+        if (!newid)
+            ossl_raise(eOCSPError, "OCSP_cert_to_id");
     }
 
     SetOCSPCertId(self, newid);
@@ -1565,8 +1549,9 @@ ossl_ocspcid_get_issuer_name_hash(VALUE self)
     GetOCSPCertId(self, id);
     OCSP_id_get0_info(&name_hash, NULL, NULL, NULL, id);
 
-    ret = rb_str_new(NULL, name_hash->length * 2);
-    ossl_bin2hex(name_hash->data, RSTRING_PTR(ret), name_hash->length);
+    ret = rb_str_new(NULL, ASN1_STRING_length(name_hash) * 2);
+    ossl_bin2hex(ASN1_STRING_get0_data(name_hash), RSTRING_PTR(ret),
+                 ASN1_STRING_length(name_hash));
 
     return ret;
 }
@@ -1588,8 +1573,9 @@ ossl_ocspcid_get_issuer_key_hash(VALUE self)
     GetOCSPCertId(self, id);
     OCSP_id_get0_info(NULL, NULL, &key_hash, NULL, id);
 
-    ret = rb_str_new(NULL, key_hash->length * 2);
-    ossl_bin2hex(key_hash->data, RSTRING_PTR(ret), key_hash->length);
+    ret = rb_str_new(NULL, ASN1_STRING_length(key_hash) * 2);
+    ossl_bin2hex(ASN1_STRING_get0_data(key_hash), RSTRING_PTR(ret),
+                 ASN1_STRING_length(key_hash));
 
     return ret;
 }
@@ -1606,19 +1592,10 @@ ossl_ocspcid_get_hash_algorithm(VALUE self)
 {
     OCSP_CERTID *id;
     ASN1_OBJECT *oid;
-    BIO *out;
 
     GetOCSPCertId(self, id);
     OCSP_id_get0_info(NULL, &oid, NULL, NULL, id);
-
-    if (!(out = BIO_new(BIO_s_mem())))
-	ossl_raise(eOCSPError, "BIO_new");
-
-    if (!i2a_ASN1_OBJECT(out, oid)) {
-	BIO_free(out);
-	ossl_raise(eOCSPError, "i2a_ASN1_OBJECT");
-    }
-    return ossl_membio2str(out);
+    return ossl_asn1obj_to_string_long_name(oid);
 }
 
 /*
@@ -1637,11 +1614,11 @@ ossl_ocspcid_to_der(VALUE self)
 
     GetOCSPCertId(self, id);
     if ((len = i2d_OCSP_CERTID(id, NULL)) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_OCSP_CERTID(id, &p) <= 0)
-	ossl_raise(eOCSPError, NULL);
+        ossl_raise(eOCSPError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -1650,11 +1627,6 @@ ossl_ocspcid_to_der(VALUE self)
 void
 Init_ossl_ocsp(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     /*
      * OpenSSL::OCSP implements Online Certificate Status Protocol requests
      * and responses.
diff --git a/ext/openssl/ossl_ocsp.h b/ext/openssl/ossl_ocsp.h
index 6d2aac8657..becd70ffed 100644
--- a/ext/openssl/ossl_ocsp.h
+++ b/ext/openssl/ossl_ocsp.h
@@ -6,18 +6,11 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_OCSP_H_)
 #define _OSSL_OCSP_H_
 
-#if !defined(OPENSSL_NO_OCSP)
-extern VALUE mOCSP;
-extern VALUE cOCSPReq;
-extern VALUE cOCSPRes;
-extern VALUE cOCSPBasicRes;
-#endif
-
 void Init_ossl_ocsp(void);
 
 #endif /* _OSSL_OCSP_H_ */
diff --git a/ext/openssl/ossl_pkcs12.c b/ext/openssl/ossl_pkcs12.c
index 164b2da465..a47c81354c 100644
--- a/ext/openssl/ossl_pkcs12.c
+++ b/ext/openssl/ossl_pkcs12.c
@@ -1,6 +1,6 @@
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -27,8 +27,8 @@
 /*
  * Classes
  */
-VALUE cPKCS12;
-VALUE ePKCS12Error;
+static VALUE cPKCS12;
+static VALUE ePKCS12Error;
 
 /*
  * Private
@@ -42,7 +42,7 @@ ossl_pkcs12_free(void *ptr)
 static const rb_data_type_t ossl_pkcs12_type = {
     "OpenSSL/PKCS12",
     {
-	0, ossl_pkcs12_free,
+        0, ossl_pkcs12_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -60,6 +60,7 @@ ossl_pkcs12_s_allocate(VALUE klass)
     return obj;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_pkcs12_initialize_copy(VALUE self, VALUE other)
 {
@@ -71,7 +72,7 @@ ossl_pkcs12_initialize_copy(VALUE self, VALUE other)
 
     p12_new = ASN1_dup((i2d_of_void *)i2d_PKCS12, (d2i_of_void *)d2i_PKCS12, (char *)p12);
     if (!p12_new)
-	ossl_raise(ePKCS12Error, "ASN1_dup");
+        ossl_raise(ePKCS12Error, "ASN1_dup");
 
     SetPKCS12(self, p12_new);
     PKCS12_free(p12_old);
@@ -121,11 +122,11 @@ ossl_pkcs12_s_create(int argc, VALUE *argv, VALUE self)
 /* TODO: make a VALUE to nid function */
     if (!NIL_P(key_nid)) {
         if ((nkey = OBJ_txt2nid(StringValueCStr(key_nid))) == NID_undef)
-	    ossl_raise(rb_eArgError, "Unknown PBE algorithm %"PRIsVALUE, key_nid);
+            ossl_raise(rb_eArgError, "Unknown PBE algorithm %"PRIsVALUE, key_nid);
     }
     if (!NIL_P(cert_nid)) {
         if ((ncert = OBJ_txt2nid(StringValueCStr(cert_nid))) == NID_undef)
-	    ossl_raise(rb_eArgError, "Unknown PBE algorithm %"PRIsVALUE, cert_nid);
+            ossl_raise(rb_eArgError, "Unknown PBE algorithm %"PRIsVALUE, cert_nid);
     }
     if (!NIL_P(key_iter))
         kiter = NUM2INT(key_iter);
@@ -134,6 +135,16 @@ ossl_pkcs12_s_create(int argc, VALUE *argv, VALUE self)
     if (!NIL_P(keytype))
         ktype = NUM2INT(keytype);
 
+#if defined(OPENSSL_IS_AWSLC)
+    if (ktype != 0) {
+        ossl_raise(rb_eArgError, "Unknown key usage type %"PRIsVALUE, INT2NUM(ktype));
+    }
+#else
+    if (ktype != 0 && ktype != KEY_SIG && ktype != KEY_EX) {
+        ossl_raise(rb_eArgError, "Unknown key usage type %"PRIsVALUE, INT2NUM(ktype));
+    }
+#endif
+
     obj = NewPKCS12(cPKCS12);
     x509s = NIL_P(ca) ? NULL : ossl_x509_ary2sk(ca);
     p12 = PKCS12_create(passphrase, friendlyname, key, x509, x509s,
@@ -150,9 +161,9 @@ ossl_pkcs12_s_create(int argc, VALUE *argv, VALUE self)
 }
 
 static VALUE
-ossl_pkey_new_i(VALUE arg)
+ossl_pkey_wrap_i(VALUE arg)
 {
-    return ossl_pkey_new((EVP_PKEY *)arg);
+    return ossl_pkey_wrap((EVP_PKEY *)arg);
 }
 
 static VALUE
@@ -180,6 +191,7 @@ ossl_x509_sk2ary_i(VALUE arg)
 static VALUE
 ossl_pkcs12_initialize(int argc, VALUE *argv, VALUE self)
 {
+    PKCS12 *p12, *p12_orig = DATA_PTR(self);
     BIO *in;
     VALUE arg, pass, pkey, cert, ca;
     char *passphrase;
@@ -187,33 +199,31 @@ ossl_pkcs12_initialize(int argc, VALUE *argv, VALUE self)
     X509 *x509;
     STACK_OF(X509) *x509s = NULL;
     int st = 0;
-    PKCS12 *pkcs = DATA_PTR(self);
 
     if(rb_scan_args(argc, argv, "02", &arg, &pass) == 0) return self;
     passphrase = NIL_P(pass) ? NULL : StringValueCStr(pass);
     in = ossl_obj2bio(&arg);
-    d2i_PKCS12_bio(in, &pkcs);
-    DATA_PTR(self) = pkcs;
+    p12 = d2i_PKCS12_bio(in, NULL);
     BIO_free(in);
+    if (!p12)
+        ossl_raise(ePKCS12Error, "d2i_PKCS12_bio");
+    PKCS12_free(p12_orig);
+    RTYPEDDATA_DATA(self) = p12;
 
     pkey = cert = ca = Qnil;
-    /* OpenSSL's bug; PKCS12_parse() puts errors even if it succeeds.
-     * Fixed in OpenSSL 1.0.0t, 1.0.1p, 1.0.2d */
-    ERR_set_mark();
-    if(!PKCS12_parse(pkcs, passphrase, &key, &x509, &x509s))
-	ossl_raise(ePKCS12Error, "PKCS12_parse");
-    ERR_pop_to_mark();
+    if (!PKCS12_parse(p12, passphrase, &key, &x509, &x509s))
+        ossl_raise(ePKCS12Error, "PKCS12_parse");
     if (key) {
-	pkey = rb_protect(ossl_pkey_new_i, (VALUE)key, &st);
-	if (st) goto err;
+        pkey = rb_protect(ossl_pkey_wrap_i, (VALUE)key, &st);
+        if (st) goto err;
     }
     if (x509) {
-	cert = rb_protect(ossl_x509_new_i, (VALUE)x509, &st);
-	if (st) goto err;
+        cert = rb_protect(ossl_x509_new_i, (VALUE)x509, &st);
+        if (st) goto err;
     }
     if (x509s) {
-	ca = rb_protect(ossl_x509_sk2ary_i, (VALUE)x509s, &st);
-	if (st) goto err;
+        ca = rb_protect(ossl_x509_sk2ary_i, (VALUE)x509s, &st);
+        if (st) goto err;
     }
 
   err:
@@ -237,25 +247,62 @@ ossl_pkcs12_to_der(VALUE self)
 
     GetPKCS12(self, p12);
     if((len = i2d_PKCS12(p12, NULL)) <= 0)
-	ossl_raise(ePKCS12Error, NULL);
+        ossl_raise(ePKCS12Error, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_PKCS12(p12, &p) <= 0)
-	ossl_raise(ePKCS12Error, NULL);
+        ossl_raise(ePKCS12Error, NULL);
     ossl_str_adjust(str, p);
 
     return str;
 }
 
+/*
+ * call-seq:
+ *    pkcs12.set_mac(pass, salt = nil, iter = nil, md_type = nil)
+ *
+ * Sets MAC parameters and generates MAC over the PKCS #12 structure.
+ *
+ * This method uses HMAC and the PKCS #12 specific password-based KDF as
+ * specified in the original PKCS #12.
+ *
+ * See also the man page PKCS12_set_mac(3).
+ *
+ * Added in version 3.3.0.
+ */
+static VALUE
+pkcs12_set_mac(int argc, VALUE *argv, VALUE self)
+{
+    PKCS12 *p12;
+    VALUE pass, salt, iter, md_name, md_holder = Qnil;
+    int iter_i = 0;
+    const EVP_MD *md_type = NULL;
+
+    rb_scan_args(argc, argv, "13", &pass, &salt, &iter, &md_name);
+    rb_check_frozen(self);
+    GetPKCS12(self, p12);
+
+    StringValue(pass);
+    if (!NIL_P(salt))
+        StringValue(salt);
+    if (!NIL_P(iter))
+        iter_i = NUM2INT(iter);
+    if (!NIL_P(md_name))
+        md_type = ossl_evp_md_fetch(md_name, &md_holder);
+
+    if (!PKCS12_set_mac(p12, RSTRING_PTR(pass), RSTRING_LENINT(pass),
+                        !NIL_P(salt) ? (unsigned char *)RSTRING_PTR(salt) : NULL,
+                        !NIL_P(salt) ? RSTRING_LENINT(salt) : 0,
+                        iter_i, md_type))
+        ossl_raise(ePKCS12Error, "PKCS12_set_mac");
+
+    return Qnil;
+}
+
 void
 Init_ossl_pkcs12(void)
 {
 #undef rb_intern
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     /*
      * Defines a file format commonly used to store private keys with
      * accompanying public key certificates, protected with a password-based
@@ -272,4 +319,11 @@ Init_ossl_pkcs12(void)
     rb_attr(cPKCS12, rb_intern("ca_certs"), 1, 0, Qfalse);
     rb_define_method(cPKCS12, "initialize", ossl_pkcs12_initialize, -1);
     rb_define_method(cPKCS12, "to_der", ossl_pkcs12_to_der, 0);
+    rb_define_method(cPKCS12, "set_mac", pkcs12_set_mac, -1);
+
+#if !defined(OPENSSL_IS_AWSLC)
+    /* MSIE specific PKCS12 key usage extensions */
+    rb_define_const(cPKCS12, "KEY_EX", INT2NUM(KEY_EX));
+    rb_define_const(cPKCS12, "KEY_SIG", INT2NUM(KEY_SIG));
+#endif
 }
diff --git a/ext/openssl/ossl_pkcs12.h b/ext/openssl/ossl_pkcs12.h
index fe4f15ef60..6d2cd901cb 100644
--- a/ext/openssl/ossl_pkcs12.h
+++ b/ext/openssl/ossl_pkcs12.h
@@ -1,13 +1,10 @@
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_PKCS12_H_)
 #define _OSSL_PKCS12_H_
 
-extern VALUE cPKCS12;
-extern VALUE ePKCS12Error;
-
 void Init_ossl_pkcs12(void);
 
 #endif /* _OSSL_PKCS12_H_ */
diff --git a/ext/openssl/ossl_pkcs7.c b/ext/openssl/ossl_pkcs7.c
index 446df4c075..44e8cb305b 100644
--- a/ext/openssl/ossl_pkcs7.c
+++ b/ext/openssl/ossl_pkcs7.c
@@ -5,22 +5,37 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
+#define NewPKCS7(klass) \
+    TypedData_Wrap_Struct((klass), &ossl_pkcs7_type, 0)
+#define SetPKCS7(obj, pkcs7) do { \
+    if (!(pkcs7)) { \
+        ossl_raise(rb_eRuntimeError, "PKCS7 wasn't initialized."); \
+    } \
+    RTYPEDDATA_DATA(obj) = (pkcs7); \
+} while (0)
+#define GetPKCS7(obj, pkcs7) do { \
+    TypedData_Get_Struct((obj), PKCS7, &ossl_pkcs7_type, (pkcs7)); \
+    if (!(pkcs7)) { \
+        ossl_raise(rb_eRuntimeError, "PKCS7 wasn't initialized."); \
+    } \
+} while (0)
+
 #define NewPKCS7si(klass) \
     TypedData_Wrap_Struct((klass), &ossl_pkcs7_signer_info_type, 0)
 #define SetPKCS7si(obj, p7si) do { \
     if (!(p7si)) { \
-	ossl_raise(rb_eRuntimeError, "PKCS7si wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "PKCS7si wasn't initialized."); \
     } \
     RTYPEDDATA_DATA(obj) = (p7si); \
 } while (0)
 #define GetPKCS7si(obj, p7si) do { \
     TypedData_Get_Struct((obj), PKCS7_SIGNER_INFO, &ossl_pkcs7_signer_info_type, (p7si)); \
     if (!(p7si)) { \
-	ossl_raise(rb_eRuntimeError, "PKCS7si wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "PKCS7si wasn't initialized."); \
     } \
 } while (0)
 
@@ -28,14 +43,14 @@
     TypedData_Wrap_Struct((klass), &ossl_pkcs7_recip_info_type, 0)
 #define SetPKCS7ri(obj, p7ri) do { \
     if (!(p7ri)) { \
-	ossl_raise(rb_eRuntimeError, "PKCS7ri wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "PKCS7ri wasn't initialized."); \
     } \
     RTYPEDDATA_DATA(obj) = (p7ri); \
 } while (0)
 #define GetPKCS7ri(obj, p7ri) do { \
     TypedData_Get_Struct((obj), PKCS7_RECIP_INFO, &ossl_pkcs7_recip_info_type, (p7ri)); \
     if (!(p7ri)) { \
-	ossl_raise(rb_eRuntimeError, "PKCS7ri wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "PKCS7ri wasn't initialized."); \
     } \
 } while (0)
 
@@ -49,10 +64,11 @@
 /*
  * Classes
  */
-VALUE cPKCS7;
-VALUE cPKCS7Signer;
-VALUE cPKCS7Recipient;
-VALUE ePKCS7Error;
+static VALUE cPKCS7;
+static VALUE cPKCS7Signer;
+static VALUE cPKCS7Recipient;
+static VALUE ePKCS7Error;
+static ID id_md_holder, id_cipher_holder;
 
 static void
 ossl_pkcs7_free(void *ptr)
@@ -60,14 +76,28 @@ ossl_pkcs7_free(void *ptr)
     PKCS7_free(ptr);
 }
 
-const rb_data_type_t ossl_pkcs7_type = {
+static const rb_data_type_t ossl_pkcs7_type = {
     "OpenSSL/PKCS7",
     {
-	0, ossl_pkcs7_free,
+        0, ossl_pkcs7_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
 
+VALUE
+ossl_pkcs7_new(PKCS7 *p7)
+{
+    PKCS7 *new;
+    VALUE obj = NewPKCS7(cPKCS7);
+
+    new = PKCS7_dup(p7);
+    if (!new)
+        ossl_raise(ePKCS7Error, "PKCS7_dup");
+    SetPKCS7(obj, new);
+
+    return obj;
+}
+
 static void
 ossl_pkcs7_signer_info_free(void *ptr)
 {
@@ -77,7 +107,7 @@ ossl_pkcs7_signer_info_free(void *ptr)
 static const rb_data_type_t ossl_pkcs7_signer_info_type = {
     "OpenSSL/PKCS7/SIGNER_INFO",
     {
-	0, ossl_pkcs7_signer_info_free,
+        0, ossl_pkcs7_signer_info_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -91,7 +121,7 @@ ossl_pkcs7_recip_info_free(void *ptr)
 static const rb_data_type_t ossl_pkcs7_recip_info_type = {
     "OpenSSL/PKCS7/RECIP_INFO",
     {
-	0, ossl_pkcs7_recip_info_free,
+        0, ossl_pkcs7_recip_info_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -114,23 +144,32 @@ ossl_PKCS7_SIGNER_INFO_dup(PKCS7_SIGNER_INFO *si)
 }
 
 static PKCS7_RECIP_INFO *
-ossl_PKCS7_RECIP_INFO_dup(PKCS7_RECIP_INFO *si)
+ossl_PKCS7_RECIP_INFO_dup(PKCS7_RECIP_INFO *ri)
 {
-    return ASN1_dup((i2d_of_void *)i2d_PKCS7_RECIP_INFO,
-                    (d2i_of_void *)d2i_PKCS7_RECIP_INFO,
-                    si);
+    PKCS7_RECIP_INFO *ri_new = ASN1_dup((i2d_of_void *)i2d_PKCS7_RECIP_INFO,
+                                        (d2i_of_void *)d2i_PKCS7_RECIP_INFO,
+                                        ri);
+    if (ri_new && ri->cert) {
+        if (!X509_up_ref(ri->cert)) {
+            PKCS7_RECIP_INFO_free(ri_new);
+            return NULL;
+        }
+        ri_new->cert = ri->cert;
+    }
+    return ri_new;
 }
 
 static VALUE
 ossl_pkcs7si_new(PKCS7_SIGNER_INFO *p7si)
 {
-    PKCS7_SIGNER_INFO *pkcs7;
+    PKCS7_SIGNER_INFO *p7si_new;
     VALUE obj;
 
     obj = NewPKCS7si(cPKCS7Signer);
-    pkcs7 = p7si ? ossl_PKCS7_SIGNER_INFO_dup(p7si) : PKCS7_SIGNER_INFO_new();
-    if (!pkcs7) ossl_raise(ePKCS7Error, NULL);
-    SetPKCS7si(obj, pkcs7);
+    p7si_new = ossl_PKCS7_SIGNER_INFO_dup(p7si);
+    if (!p7si_new)
+        ossl_raise(ePKCS7Error, "ASN1_dup");
+    SetPKCS7si(obj, p7si_new);
 
     return obj;
 }
@@ -138,13 +177,14 @@ ossl_pkcs7si_new(PKCS7_SIGNER_INFO *p7si)
 static VALUE
 ossl_pkcs7ri_new(PKCS7_RECIP_INFO *p7ri)
 {
-    PKCS7_RECIP_INFO *pkcs7;
+    PKCS7_RECIP_INFO *p7ri_new;
     VALUE obj;
 
     obj = NewPKCS7ri(cPKCS7Recipient);
-    pkcs7 = p7ri ? ossl_PKCS7_RECIP_INFO_dup(p7ri) : PKCS7_RECIP_INFO_new();
-    if (!pkcs7) ossl_raise(ePKCS7Error, NULL);
-    SetPKCS7ri(obj, pkcs7);
+    p7ri_new = ossl_PKCS7_RECIP_INFO_dup(p7ri);
+    if (!p7ri_new)
+        ossl_raise(ePKCS7Error,"ASN1_dup");
+    SetPKCS7ri(obj, p7ri_new);
 
     return obj;
 }
@@ -167,8 +207,10 @@ ossl_pkcs7_s_read_smime(VALUE klass, VALUE arg)
     BIO_free(in);
     if (!pkcs7)
         ossl_raise(ePKCS7Error, "Could not parse the PKCS7");
-    if (!pkcs7->d.ptr)
+    if (!pkcs7->d.ptr) {
+        PKCS7_free(pkcs7);
         ossl_raise(ePKCS7Error, "No content in PKCS7");
+    }
 
     data = out ? ossl_membio2str(out) : Qnil;
     SetPKCS7(ret, pkcs7);
@@ -196,7 +238,7 @@ ossl_pkcs7_s_write_smime(int argc, VALUE *argv, VALUE klass)
     if(NIL_P(data)) data = ossl_pkcs7_get_data(pkcs7);
     GetPKCS7(pkcs7, p7);
     if(!NIL_P(data) && PKCS7_is_detached(p7))
-	flg |= PKCS7_DETACHED;
+        flg |= PKCS7_DETACHED;
     in = NIL_P(data) ? NULL : ossl_obj2bio(&data);
     if(!(out = BIO_new(BIO_s_mem()))){
         BIO_free(in);
@@ -237,16 +279,16 @@ ossl_pkcs7_s_sign(int argc, VALUE *argv, VALUE klass)
     in = ossl_obj2bio(&data);
     if(NIL_P(certs)) x509s = NULL;
     else{
-	x509s = ossl_protect_x509_ary2sk(certs, &status);
-	if(status){
-	    BIO_free(in);
-	    rb_jump_tag(status);
-	}
+        x509s = ossl_protect_x509_ary2sk(certs, &status);
+        if(status){
+            BIO_free(in);
+            rb_jump_tag(status);
+        }
     }
     if(!(pkcs7 = PKCS7_sign(x509, pkey, x509s, in, flg))){
-	BIO_free(in);
-	sk_X509_pop_free(x509s, X509_free);
-	ossl_raise(ePKCS7Error, NULL);
+        BIO_free(in);
+        sk_X509_pop_free(x509s, X509_free);
+        ossl_raise(ePKCS7Error, NULL);
     }
     SetPKCS7(ret, pkcs7);
     ossl_pkcs7_set_data(ret, data);
@@ -259,12 +301,19 @@ ossl_pkcs7_s_sign(int argc, VALUE *argv, VALUE klass)
 
 /*
  * call-seq:
- *    PKCS7.encrypt(certs, data, [, cipher [, flags]]) => pkcs7
+ *    PKCS7.encrypt(certs, data, cipher, flags = 0) => pkcs7
+ *
+ * Creates a PKCS #7 enveloped-data structure.
+ *
+ * Before version 3.3.0, +cipher+ was optional and defaulted to
+ * <tt>"RC2-40-CBC"</tt>.
+ *
+ * See also the man page PKCS7_encrypt(3).
  */
 static VALUE
 ossl_pkcs7_s_encrypt(int argc, VALUE *argv, VALUE klass)
 {
-    VALUE certs, data, cipher, flags;
+    VALUE certs, data, cipher, flags, cipher_holder;
     STACK_OF(X509) *x509s;
     BIO *in;
     const EVP_CIPHER *ciph;
@@ -273,37 +322,29 @@ ossl_pkcs7_s_encrypt(int argc, VALUE *argv, VALUE klass)
     PKCS7 *p7;
 
     rb_scan_args(argc, argv, "22", &certs, &data, &cipher, &flags);
-    if(NIL_P(cipher)){
-#if !defined(OPENSSL_NO_RC2)
-	ciph = EVP_rc2_40_cbc();
-#elif !defined(OPENSSL_NO_DES)
-	ciph = EVP_des_ede3_cbc();
-#elif !defined(OPENSSL_NO_RC2)
-	ciph = EVP_rc2_40_cbc();
-#elif !defined(OPENSSL_NO_AES)
-	ciph = EVP_EVP_aes_128_cbc();
-#else
-	ossl_raise(ePKCS7Error, "Must specify cipher");
-#endif
-
+    if (NIL_P(cipher)) {
+        rb_raise(rb_eArgError,
+                 "cipher must be specified. Before version 3.3, " \
+                 "the default cipher was RC2-40-CBC.");
     }
-    else ciph = ossl_evp_get_cipherbyname(cipher);
+    ciph = ossl_evp_cipher_fetch(cipher, &cipher_holder);
     flg = NIL_P(flags) ? 0 : NUM2INT(flags);
     ret = NewPKCS7(cPKCS7);
     in = ossl_obj2bio(&data);
     x509s = ossl_protect_x509_ary2sk(certs, &status);
     if(status){
-	BIO_free(in);
-	rb_jump_tag(status);
+        BIO_free(in);
+        rb_jump_tag(status);
     }
-    if(!(p7 = PKCS7_encrypt(x509s, in, (EVP_CIPHER*)ciph, flg))){
-	BIO_free(in);
-	sk_X509_pop_free(x509s, X509_free);
-	ossl_raise(ePKCS7Error, NULL);
+    if (!(p7 = PKCS7_encrypt(x509s, in, ciph, flg))) {
+        BIO_free(in);
+        sk_X509_pop_free(x509s, X509_free);
+        ossl_raise(ePKCS7Error, NULL);
     }
     BIO_free(in);
     SetPKCS7(ret, p7);
     ossl_pkcs7_set_data(ret, data);
+    rb_ivar_set(ret, id_cipher_holder, cipher_holder);
     sk_X509_pop_free(x509s, X509_free);
 
     return ret;
@@ -317,7 +358,7 @@ ossl_pkcs7_alloc(VALUE klass)
 
     obj = NewPKCS7(klass);
     if (!(pkcs7 = PKCS7_new())) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     SetPKCS7(obj, pkcs7);
 
@@ -339,7 +380,7 @@ ossl_pkcs7_initialize(int argc, VALUE *argv, VALUE self)
     VALUE arg;
 
     if(rb_scan_args(argc, argv, "01", &arg) == 0)
-	return self;
+        return self;
     arg = ossl_to_der_if_possible(arg);
     in = ossl_obj2bio(&arg);
     p7 = d2i_PKCS7_bio(in, NULL);
@@ -349,9 +390,11 @@ ossl_pkcs7_initialize(int argc, VALUE *argv, VALUE self)
     }
     BIO_free(in);
     if (!p7)
-        ossl_raise(rb_eArgError, "Could not parse the PKCS7");
-    if (!p7->d.ptr)
-        ossl_raise(rb_eArgError, "No content in PKCS7");
+        ossl_raise(ePKCS7Error, "Could not parse the PKCS7");
+    if (!p7->d.ptr) {
+        PKCS7_free(p7);
+        ossl_raise(ePKCS7Error, "No content in PKCS7");
+    }
 
     RTYPEDDATA_DATA(self) = p7;
     PKCS7_free(p7_orig);
@@ -361,6 +404,7 @@ ossl_pkcs7_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_pkcs7_copy(VALUE self, VALUE other)
 {
@@ -374,7 +418,7 @@ ossl_pkcs7_copy(VALUE self, VALUE other)
 
     pkcs7 = PKCS7_dup(b);
     if (!pkcs7) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     DATA_PTR(self) = pkcs7;
     PKCS7_free(a);
@@ -406,13 +450,13 @@ ossl_pkcs7_sym2typeid(VALUE sym)
     RSTRING_GETMEM(sym, s, l);
 
     for(i = 0; ; i++){
-	if(i == numberof(p7_type_tab))
-	    ossl_raise(ePKCS7Error, "unknown type \"%"PRIsVALUE"\"", sym);
-	if(strlen(p7_type_tab[i].name) != l) continue;
-	if(strcmp(p7_type_tab[i].name, s) == 0){
-	    ret = p7_type_tab[i].nid;
-	    break;
-	}
+        if(i == numberof(p7_type_tab))
+            ossl_raise(ePKCS7Error, "unknown type \"%"PRIsVALUE"\"", sym);
+        if(strlen(p7_type_tab[i].name) != l) continue;
+        if(memcmp(p7_type_tab[i].name, s, l) == 0){
+            ret = p7_type_tab[i].nid;
+            break;
+        }
     }
 
     return ret;
@@ -429,7 +473,7 @@ ossl_pkcs7_set_type(VALUE self, VALUE type)
 
     GetPKCS7(self, p7);
     if(!PKCS7_set_type(p7, ossl_pkcs7_sym2typeid(type)))
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
 
     return type;
 }
@@ -445,15 +489,15 @@ ossl_pkcs7_get_type(VALUE self)
 
     GetPKCS7(self, p7);
     if(PKCS7_type_is_signed(p7))
-	return ID2SYM(rb_intern("signed"));
+        return ID2SYM(rb_intern("signed"));
     if(PKCS7_type_is_encrypted(p7))
-	return ID2SYM(rb_intern("encrypted"));
+        return ID2SYM(rb_intern("encrypted"));
     if(PKCS7_type_is_enveloped(p7))
-	return ID2SYM(rb_intern("enveloped"));
+        return ID2SYM(rb_intern("enveloped"));
     if(PKCS7_type_is_signedAndEnveloped(p7))
-	return ID2SYM(rb_intern("signedAndEnveloped"));
+        return ID2SYM(rb_intern("signedAndEnveloped"));
     if(PKCS7_type_is_data(p7))
-	return ID2SYM(rb_intern("data"));
+        return ID2SYM(rb_intern("data"));
     return Qnil;
 }
 
@@ -464,9 +508,9 @@ ossl_pkcs7_set_detached(VALUE self, VALUE flag)
 
     GetPKCS7(self, p7);
     if(flag != Qtrue && flag != Qfalse)
-	ossl_raise(ePKCS7Error, "must specify a boolean");
+        ossl_raise(ePKCS7Error, "must specify a boolean");
     if(!PKCS7_set_detached(p7, flag == Qtrue ? 1 : 0))
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
 
     return flag;
 }
@@ -476,6 +520,8 @@ ossl_pkcs7_get_detached(VALUE self)
 {
     PKCS7 *p7;
     GetPKCS7(self, p7);
+    if (!PKCS7_type_is_signed(p7))
+        return Qfalse;
     return PKCS7_get_detached(p7) ? Qtrue : Qfalse;
 }
 
@@ -491,11 +537,14 @@ static VALUE
 ossl_pkcs7_set_cipher(VALUE self, VALUE cipher)
 {
     PKCS7 *pkcs7;
+    const EVP_CIPHER *ciph;
+    VALUE cipher_holder;
 
     GetPKCS7(self, pkcs7);
-    if (!PKCS7_set_cipher(pkcs7, ossl_evp_get_cipherbyname(cipher))) {
-	ossl_raise(ePKCS7Error, NULL);
-    }
+    ciph = ossl_evp_cipher_fetch(cipher, &cipher_holder);
+    if (!PKCS7_set_cipher(pkcs7, ciph))
+        ossl_raise(ePKCS7Error, "PKCS7_set_cipher");
+    rb_ivar_set(self, id_cipher_holder, cipher_holder);
 
     return cipher;
 }
@@ -526,22 +575,17 @@ ossl_pkcs7_get_signer(VALUE self)
 {
     PKCS7 *pkcs7;
     STACK_OF(PKCS7_SIGNER_INFO) *sk;
-    PKCS7_SIGNER_INFO *si;
     int num, i;
     VALUE ary;
 
     GetPKCS7(self, pkcs7);
-    if (!(sk = PKCS7_get_signer_info(pkcs7))) {
-	OSSL_Debug("OpenSSL::PKCS7#get_signer_info == NULL!");
-	return rb_ary_new();
-    }
-    if ((num = sk_PKCS7_SIGNER_INFO_num(sk)) < 0) {
-	ossl_raise(ePKCS7Error, "Negative number of signers!");
-    }
-    ary = rb_ary_new2(num);
+    if (!(sk = PKCS7_get_signer_info(pkcs7)))
+        return rb_ary_new();
+    num = sk_PKCS7_SIGNER_INFO_num(sk);
+    ary = rb_ary_new_capa(num);
     for (i=0; i<num; i++) {
-	si = sk_PKCS7_SIGNER_INFO_value(sk, i);
-	rb_ary_push(ary, ossl_pkcs7si_new(si));
+        PKCS7_SIGNER_INFO *si = sk_PKCS7_SIGNER_INFO_value(sk, i);
+        rb_ary_push(ary, ossl_pkcs7si_new(si));
     }
 
     return ary;
@@ -573,24 +617,21 @@ ossl_pkcs7_get_recipient(VALUE self)
 {
     PKCS7 *pkcs7;
     STACK_OF(PKCS7_RECIP_INFO) *sk;
-    PKCS7_RECIP_INFO *si;
     int num, i;
     VALUE ary;
 
     GetPKCS7(self, pkcs7);
     if (PKCS7_type_is_enveloped(pkcs7))
-	sk = pkcs7->d.enveloped->recipientinfo;
+        sk = pkcs7->d.enveloped->recipientinfo;
     else if (PKCS7_type_is_signedAndEnveloped(pkcs7))
-	sk = pkcs7->d.signed_and_enveloped->recipientinfo;
+        sk = pkcs7->d.signed_and_enveloped->recipientinfo;
     else sk = NULL;
     if (!sk) return rb_ary_new();
-    if ((num = sk_PKCS7_RECIP_INFO_num(sk)) < 0) {
-	ossl_raise(ePKCS7Error, "Negative number of recipient!");
-    }
-    ary = rb_ary_new2(num);
+    num = sk_PKCS7_RECIP_INFO_num(sk);
+    ary = rb_ary_new_capa(num);
     for (i=0; i<num; i++) {
-	si = sk_PKCS7_RECIP_INFO_value(sk, i);
-	rb_ary_push(ary, ossl_pkcs7ri_new(si));
+        PKCS7_RECIP_INFO *ri = sk_PKCS7_RECIP_INFO_value(sk, i);
+        rb_ary_push(ary, ossl_pkcs7ri_new(ri));
     }
 
     return ary;
@@ -605,7 +646,7 @@ ossl_pkcs7_add_certificate(VALUE self, VALUE cert)
     GetPKCS7(self, pkcs7);
     x509 = GetX509CertPtr(cert);  /* NO NEED TO DUP */
     if (!PKCS7_add_certificate(pkcs7, x509)){
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
 
     return self;
@@ -621,13 +662,13 @@ pkcs7_get_certs(VALUE self)
     GetPKCS7(self, pkcs7);
     i = OBJ_obj2nid(pkcs7->type);
     switch(i){
-    case NID_pkcs7_signed:
+      case NID_pkcs7_signed:
         certs = pkcs7->d.sign->cert;
         break;
-    case NID_pkcs7_signedAndEnveloped:
+      case NID_pkcs7_signedAndEnveloped:
         certs = pkcs7->d.signed_and_enveloped->cert;
         break;
-    default:
+      default:
         certs = NULL;
     }
 
@@ -644,13 +685,13 @@ pkcs7_get_crls(VALUE self)
     GetPKCS7(self, pkcs7);
     i = OBJ_obj2nid(pkcs7->type);
     switch(i){
-    case NID_pkcs7_signed:
+      case NID_pkcs7_signed:
         crls = pkcs7->d.sign->crl;
         break;
-    case NID_pkcs7_signedAndEnveloped:
+      case NID_pkcs7_signedAndEnveloped:
         crls = pkcs7->d.signed_and_enveloped->crl;
         break;
-    default:
+      default:
         crls = NULL;
     }
 
@@ -670,7 +711,10 @@ ossl_pkcs7_set_certificates(VALUE self, VALUE ary)
     X509 *cert;
 
     certs = pkcs7_get_certs(self);
-    while((cert = sk_X509_pop(certs))) X509_free(cert);
+    if (certs) {
+        while ((cert = sk_X509_pop(certs)))
+            X509_free(cert);
+    }
     rb_block_call(ary, rb_intern("each"), 0, 0, ossl_pkcs7_set_certs_i, self);
 
     return ary;
@@ -679,7 +723,10 @@ ossl_pkcs7_set_certificates(VALUE self, VALUE ary)
 static VALUE
 ossl_pkcs7_get_certificates(VALUE self)
 {
-    return ossl_x509_sk2ary(pkcs7_get_certs(self));
+    STACK_OF(X509) *certs = pkcs7_get_certs(self);
+    if (!certs)
+        return Qnil;
+    return ossl_x509_sk2ary(certs);
 }
 
 static VALUE
@@ -691,7 +738,7 @@ ossl_pkcs7_add_crl(VALUE self, VALUE crl)
     GetPKCS7(self, pkcs7); /* NO DUP needed! */
     x509crl = GetX509CRLPtr(crl);
     if (!PKCS7_add_crl(pkcs7, x509crl)) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
 
     return self;
@@ -710,7 +757,10 @@ ossl_pkcs7_set_crls(VALUE self, VALUE ary)
     X509_CRL *crl;
 
     crls = pkcs7_get_crls(self);
-    while((crl = sk_X509_CRL_pop(crls))) X509_CRL_free(crl);
+    if (crls) {
+        while ((crl = sk_X509_CRL_pop(crls)))
+            X509_CRL_free(crl);
+    }
     rb_block_call(ary, rb_intern("each"), 0, 0, ossl_pkcs7_set_crls_i, self);
 
     return ary;
@@ -719,7 +769,10 @@ ossl_pkcs7_set_crls(VALUE self, VALUE ary)
 static VALUE
 ossl_pkcs7_get_crls(VALUE self)
 {
-    return ossl_x509crl_sk2ary(pkcs7_get_crls(self));
+    STACK_OF(X509_CRL) *crls = pkcs7_get_crls(self);
+    if (!crls)
+        return Qnil;
+    return ossl_x509crl_sk2ary(crls);
 }
 
 static VALUE
@@ -732,7 +785,6 @@ ossl_pkcs7_verify(int argc, VALUE *argv, VALUE self)
     BIO *in, *out;
     PKCS7 *p7;
     VALUE data;
-    const char *msg;
 
     GetPKCS7(self, p7);
     rb_scan_args(argc, argv, "22", &certs, &store, &indata, &flags);
@@ -742,28 +794,30 @@ ossl_pkcs7_verify(int argc, VALUE *argv, VALUE self)
     in = NIL_P(indata) ? NULL : ossl_obj2bio(&indata);
     if(NIL_P(certs)) x509s = NULL;
     else{
-	x509s = ossl_protect_x509_ary2sk(certs, &status);
-	if(status){
-	    BIO_free(in);
-	    rb_jump_tag(status);
-	}
+        x509s = ossl_protect_x509_ary2sk(certs, &status);
+        if(status){
+            BIO_free(in);
+            rb_jump_tag(status);
+        }
     }
     if(!(out = BIO_new(BIO_s_mem()))){
-	BIO_free(in);
-	sk_X509_pop_free(x509s, X509_free);
-	ossl_raise(ePKCS7Error, NULL);
+        BIO_free(in);
+        sk_X509_pop_free(x509s, X509_free);
+        ossl_raise(ePKCS7Error, NULL);
     }
     ok = PKCS7_verify(p7, x509s, x509st, in, out, flg);
     BIO_free(in);
     sk_X509_pop_free(x509s, X509_free);
-    if (ok < 0) ossl_raise(ePKCS7Error, "PKCS7_verify");
-    msg = ERR_reason_error_string(ERR_peek_error());
-    ossl_pkcs7_set_err_string(self, msg ? rb_str_new2(msg) : Qnil);
-    ossl_clear_error();
     data = ossl_membio2str(out);
     ossl_pkcs7_set_data(self, data);
-
-    return (ok == 1) ? Qtrue : Qfalse;
+    if (ok != 1) {
+        const char *msg = ERR_reason_error_string(ERR_peek_error());
+        ossl_pkcs7_set_err_string(self, msg ? rb_str_new_cstr(msg) : Qnil);
+        ossl_clear_error();
+        return Qfalse;
+    }
+    ossl_pkcs7_set_err_string(self, Qnil);
+    return Qtrue;
 }
 
 static VALUE
@@ -783,10 +837,10 @@ ossl_pkcs7_decrypt(int argc, VALUE *argv, VALUE self)
     flg = NIL_P(flags) ? 0 : NUM2INT(flags);
     GetPKCS7(self, p7);
     if(!(out = BIO_new(BIO_s_mem())))
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     if(!PKCS7_decrypt(p7, key, x509, out, flg)){
-	BIO_free(out);
-	ossl_raise(ePKCS7Error, NULL);
+        BIO_free(out);
+        ossl_raise(ePKCS7Error, NULL);
     }
     str = ossl_membio2str(out); /* out will be free */
 
@@ -799,30 +853,38 @@ ossl_pkcs7_add_data(VALUE self, VALUE data)
     PKCS7 *pkcs7;
     BIO *out, *in;
     char buf[4096];
-    int len;
+    int len, ret;
 
     GetPKCS7(self, pkcs7);
-    if(PKCS7_type_is_signed(pkcs7)){
-	if(!PKCS7_content_new(pkcs7, NID_pkcs7_data))
-	    ossl_raise(ePKCS7Error, NULL);
+    if (PKCS7_type_is_signed(pkcs7)) {
+        if (!PKCS7_content_new(pkcs7, NID_pkcs7_data))
+            ossl_raise(ePKCS7Error, "PKCS7_content_new");
     }
     in = ossl_obj2bio(&data);
-    if(!(out = PKCS7_dataInit(pkcs7, NULL))) goto err;
-    for(;;){
-	if((len = BIO_read(in, buf, sizeof(buf))) <= 0)
-	    break;
-	if(BIO_write(out, buf, len) != len)
-	    goto err;
+    if (!(out = PKCS7_dataInit(pkcs7, NULL))) {
+        BIO_free(in);
+        ossl_raise(ePKCS7Error, "PKCS7_dataInit");
     }
-    if(!PKCS7_dataFinal(pkcs7, out)) goto err;
-    ossl_pkcs7_set_data(self, Qnil);
-
- err:
+    for (;;) {
+        if ((len = BIO_read(in, buf, sizeof(buf))) <= 0)
+            break;
+        if (BIO_write(out, buf, len) != len) {
+            BIO_free_all(out);
+            BIO_free(in);
+            ossl_raise(ePKCS7Error, "BIO_write");
+        }
+    }
+    if (BIO_flush(out) <= 0) {
+        BIO_free_all(out);
+        BIO_free(in);
+        ossl_raise(ePKCS7Error, "BIO_flush");
+    }
+    ret = PKCS7_dataFinal(pkcs7, out);
     BIO_free_all(out);
     BIO_free(in);
-    if(ERR_peek_error()){
-	ossl_raise(ePKCS7Error, NULL);
-    }
+    if (!ret)
+        ossl_raise(ePKCS7Error, "PKCS7_dataFinal");
+    ossl_pkcs7_set_data(self, Qnil);
 
     return data;
 }
@@ -837,11 +899,11 @@ ossl_pkcs7_to_der(VALUE self)
 
     GetPKCS7(self, pkcs7);
     if((len = i2d_PKCS7(pkcs7, NULL)) <= 0)
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_PKCS7(pkcs7, &p) <= 0)
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -875,11 +937,11 @@ ossl_pkcs7_to_pem(VALUE self)
 
     GetPKCS7(self, pkcs7);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     if (!PEM_write_bio_PKCS7(out, pkcs7)) {
-	BIO_free(out);
-	ossl_raise(ePKCS7Error, NULL);
+        BIO_free(out);
+        ossl_raise(ePKCS7Error, NULL);
     }
     str = ossl_membio2str(out);
 
@@ -897,7 +959,7 @@ ossl_pkcs7si_alloc(VALUE klass)
 
     obj = NewPKCS7si(klass);
     if (!(p7si = PKCS7_SIGNER_INFO_new())) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     SetPKCS7si(obj, p7si);
 
@@ -911,14 +973,15 @@ ossl_pkcs7si_initialize(VALUE self, VALUE cert, VALUE key, VALUE digest)
     EVP_PKEY *pkey;
     X509 *x509;
     const EVP_MD *md;
+    VALUE md_holder;
 
     pkey = GetPrivPKeyPtr(key); /* NO NEED TO DUP */
     x509 = GetX509CertPtr(cert); /* NO NEED TO DUP */
-    md = ossl_evp_get_digestbyname(digest);
+    md = ossl_evp_md_fetch(digest, &md_holder);
     GetPKCS7si(self, p7si);
-    if (!(PKCS7_SIGNER_INFO_set(p7si, x509, pkey, (EVP_MD*)md))) {
-	ossl_raise(ePKCS7Error, NULL);
-    }
+    if (PKCS7_SIGNER_INFO_set(p7si, x509, pkey, md) <= 0)
+        ossl_raise(ePKCS7Error, "PKCS7_SIGNER_INFO_set");
+    rb_ivar_set(self, id_md_holder, md_holder);
 
     return self;
 }
@@ -947,15 +1010,15 @@ static VALUE
 ossl_pkcs7si_get_signed_time(VALUE self)
 {
     PKCS7_SIGNER_INFO *p7si;
-    ASN1_TYPE *asn1obj;
+    const ASN1_TYPE *asn1obj;
 
     GetPKCS7si(self, p7si);
 
     if (!(asn1obj = PKCS7_get_signed_attribute(p7si, NID_pkcs9_signingTime))) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     if (asn1obj->type == V_ASN1_UTCTIME) {
-	return asn1time_to_time(asn1obj->value.utctime);
+        return asn1time_to_time(asn1obj->value.utctime);
     }
     /*
      * OR
@@ -977,7 +1040,7 @@ ossl_pkcs7ri_alloc(VALUE klass)
 
     obj = NewPKCS7ri(klass);
     if (!(p7ri = PKCS7_RECIP_INFO_new())) {
-	ossl_raise(ePKCS7Error, NULL);
+        ossl_raise(ePKCS7Error, NULL);
     }
     SetPKCS7ri(obj, p7ri);
 
@@ -992,8 +1055,8 @@ ossl_pkcs7ri_initialize(VALUE self, VALUE cert)
 
     x509 = GetX509CertPtr(cert); /* NO NEED TO DUP */
     GetPKCS7ri(self, p7ri);
-    if (!PKCS7_RECIP_INFO_set(p7ri, x509)) {
-	ossl_raise(ePKCS7Error, NULL);
+    if (PKCS7_RECIP_INFO_set(p7ri, x509) <= 0) {
+        ossl_raise(ePKCS7Error, NULL);
     }
 
     return self;
@@ -1036,11 +1099,6 @@ void
 Init_ossl_pkcs7(void)
 {
 #undef rb_intern
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     cPKCS7 = rb_define_class_under(mOSSL, "PKCS7", rb_cObject);
     ePKCS7Error = rb_define_class_under(cPKCS7, "PKCS7Error", eOSSLError);
     rb_define_singleton_method(cPKCS7, "read_smime", ossl_pkcs7_s_read_smime, 1);
@@ -1104,4 +1162,7 @@ Init_ossl_pkcs7(void)
     DefPKCS7Const(BINARY);
     DefPKCS7Const(NOATTR);
     DefPKCS7Const(NOSMIMECAP);
+
+    id_md_holder = rb_intern_const("EVP_MD_holder");
+    id_cipher_holder = rb_intern_const("EVP_CIPHER_holder");
 }
diff --git a/ext/openssl/ossl_pkcs7.h b/ext/openssl/ossl_pkcs7.h
index 3e1b094670..140fda1835 100644
--- a/ext/openssl/ossl_pkcs7.h
+++ b/ext/openssl/ossl_pkcs7.h
@@ -5,32 +5,12 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_PKCS7_H_)
 #define _OSSL_PKCS7_H_
 
-#define NewPKCS7(klass) \
-    TypedData_Wrap_Struct((klass), &ossl_pkcs7_type, 0)
-#define SetPKCS7(obj, pkcs7) do { \
-    if (!(pkcs7)) { \
-        ossl_raise(rb_eRuntimeError, "PKCS7 wasn't initialized."); \
-    } \
-    RTYPEDDATA_DATA(obj) = (pkcs7); \
-} while (0)
-#define GetPKCS7(obj, pkcs7) do { \
-    TypedData_Get_Struct((obj), PKCS7, &ossl_pkcs7_type, (pkcs7)); \
-    if (!(pkcs7)) { \
-        ossl_raise(rb_eRuntimeError, "PKCS7 wasn't initialized."); \
-    } \
-} while (0)
-
-extern const rb_data_type_t ossl_pkcs7_type;
-extern VALUE cPKCS7;
-extern VALUE cPKCS7Signer;
-extern VALUE cPKCS7Recipient;
-extern VALUE ePKCS7Error;
-
+VALUE ossl_pkcs7_new(PKCS7 *p7);
 void Init_ossl_pkcs7(void);
 
 #endif /* _OSSL_PKCS7_H_ */
diff --git a/ext/openssl/ossl_pkey.c b/ext/openssl/ossl_pkey.c
index 013412c27f..a53332b17e 100644
--- a/ext/openssl/ossl_pkey.c
+++ b/ext/openssl/ossl_pkey.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -33,13 +33,13 @@ ossl_evp_pkey_free(void *ptr)
 const rb_data_type_t ossl_evp_pkey_type = {
     "OpenSSL/EVP_PKEY",
     {
-	0, ossl_evp_pkey_free,
+        0, ossl_evp_pkey_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
 
 static VALUE
-pkey_new0(VALUE arg)
+pkey_wrap0(VALUE arg)
 {
     EVP_PKEY *pkey = (EVP_PKEY *)arg;
     VALUE klass, obj;
@@ -65,15 +65,15 @@ pkey_new0(VALUE arg)
 }
 
 VALUE
-ossl_pkey_new(EVP_PKEY *pkey)
+ossl_pkey_wrap(EVP_PKEY *pkey)
 {
     VALUE obj;
     int status;
 
-    obj = rb_protect(pkey_new0, (VALUE)pkey, &status);
+    obj = rb_protect(pkey_wrap0, (VALUE)pkey, &status);
     if (status) {
-	EVP_PKEY_free(pkey);
-	rb_jump_tag(status);
+        EVP_PKEY_free(pkey);
+        rb_jump_tag(status);
     }
 
     return obj;
@@ -94,7 +94,8 @@ ossl_pkey_read(BIO *bio, const char *input_type, int selection, VALUE pass)
                                          selection, NULL, NULL);
     if (!dctx)
         goto out;
-    if (OSSL_DECODER_CTX_set_pem_password_cb(dctx, ossl_pem_passwd_cb,
+    if (selection == EVP_PKEY_KEYPAIR &&
+        OSSL_DECODER_CTX_set_pem_password_cb(dctx, ossl_pem_passwd_cb,
                                              ppass) != 1)
         goto out;
     while (1) {
@@ -187,23 +188,23 @@ ossl_pkey_read_generic(BIO *bio, VALUE pass)
     EVP_PKEY *pkey;
 
     if ((pkey = d2i_PrivateKey_bio(bio, NULL)))
-	goto out;
+        goto out;
     OSSL_BIO_reset(bio);
     if ((pkey = d2i_PKCS8PrivateKey_bio(bio, NULL, ossl_pem_passwd_cb, ppass)))
-	goto out;
+        goto out;
     OSSL_BIO_reset(bio);
     if ((pkey = d2i_PUBKEY_bio(bio, NULL)))
-	goto out;
+        goto out;
     OSSL_BIO_reset(bio);
     /* PEM_read_bio_PrivateKey() also parses PKCS #8 formats */
     if ((pkey = PEM_read_bio_PrivateKey(bio, NULL, ossl_pem_passwd_cb, ppass)))
-	goto out;
+        goto out;
     OSSL_BIO_reset(bio);
     if ((pkey = PEM_read_bio_PUBKEY(bio, NULL, NULL, NULL)))
-	goto out;
+        goto out;
     OSSL_BIO_reset(bio);
     if ((pkey = PEM_read_bio_Parameters(bio, NULL)))
-	goto out;
+        goto out;
 
   out:
     return pkey;
@@ -238,8 +239,8 @@ ossl_pkey_new_from_data(int argc, VALUE *argv, VALUE self)
     pkey = ossl_pkey_read_generic(bio, ossl_pem_passwd_value(pass));
     BIO_free(bio);
     if (!pkey)
-	ossl_raise(ePKeyError, "Could not parse PKey");
-    return ossl_pkey_new(pkey);
+        ossl_raise(ePKeyError, "Could not parse PKey");
+    return ossl_pkey_wrap(pkey);
 }
 
 static VALUE
@@ -443,7 +444,7 @@ pkey_generate(int argc, VALUE *argv, VALUE self, int genparam)
         }
     }
 
-    return ossl_pkey_new(gen_arg.pkey);
+    return ossl_pkey_wrap(gen_arg.pkey);
 }
 
 /*
@@ -507,7 +508,7 @@ ossl_pkey_s_generate_key(int argc, VALUE *argv, VALUE self)
 void
 ossl_pkey_check_public_key(const EVP_PKEY *pkey)
 {
-#if OSSL_OPENSSL_PREREQ(3, 0, 0)
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
     if (EVP_PKEY_missing_parameters(pkey))
         ossl_raise(ePKeyError, "parameters missing");
 #else
@@ -515,35 +516,34 @@ ossl_pkey_check_public_key(const EVP_PKEY *pkey)
     const BIGNUM *n, *e, *pubkey;
 
     if (EVP_PKEY_missing_parameters(pkey))
-	ossl_raise(ePKeyError, "parameters missing");
+        ossl_raise(ePKeyError, "parameters missing");
 
-    /* OpenSSL < 1.1.0 takes non-const pointer */
-    ptr = EVP_PKEY_get0((EVP_PKEY *)pkey);
+    ptr = EVP_PKEY_get0(pkey);
     switch (EVP_PKEY_base_id(pkey)) {
       case EVP_PKEY_RSA:
-	RSA_get0_key(ptr, &n, &e, NULL);
-	if (n && e)
-	    return;
-	break;
+        RSA_get0_key(ptr, &n, &e, NULL);
+        if (n && e)
+            return;
+        break;
       case EVP_PKEY_DSA:
-	DSA_get0_key(ptr, &pubkey, NULL);
-	if (pubkey)
-	    return;
-	break;
+        DSA_get0_key(ptr, &pubkey, NULL);
+        if (pubkey)
+            return;
+        break;
       case EVP_PKEY_DH:
-	DH_get0_key(ptr, &pubkey, NULL);
-	if (pubkey)
-	    return;
-	break;
+        DH_get0_key(ptr, &pubkey, NULL);
+        if (pubkey)
+            return;
+        break;
 #if !defined(OPENSSL_NO_EC)
       case EVP_PKEY_EC:
-	if (EC_KEY_get0_public_key(ptr))
-	    return;
-	break;
+        if (EC_KEY_get0_public_key(ptr))
+            return;
+        break;
 #endif
       default:
-	/* unsupported type; assuming ok */
-	return;
+        /* unsupported type; assuming ok */
+        return;
     }
     ossl_raise(ePKeyError, "public key missing");
 #endif
@@ -610,12 +610,13 @@ static VALUE
 ossl_pkey_initialize(VALUE self)
 {
     if (rb_obj_is_instance_of(self, cPKey)) {
-	ossl_raise(rb_eTypeError, "OpenSSL::PKey::PKey can't be instantiated directly");
+        ossl_raise(rb_eTypeError, "OpenSSL::PKey::PKey can't be instantiated directly");
     }
     return self;
 }
 
 #ifdef HAVE_EVP_PKEY_DUP
+/* :nodoc: */
 static VALUE
 ossl_pkey_initialize_copy(VALUE self, VALUE other)
 {
@@ -635,7 +636,29 @@ ossl_pkey_initialize_copy(VALUE self, VALUE other)
 }
 #endif
 
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
+#ifndef OSSL_USE_PROVIDER
+static int
+lookup_pkey_type(VALUE type)
+{
+    const EVP_PKEY_ASN1_METHOD *ameth;
+    int pkey_id;
+
+    StringValue(type);
+    /*
+     * XXX: EVP_PKEY_asn1_find_str() looks up a PEM type string. Should we use
+     * OBJ_txt2nid() instead (and then somehow check if the NID is an acceptable
+     * EVP_PKEY type)?
+     * It is probably fine, though, since it can handle all algorithms that
+     * support raw keys in 1.1.1: { X25519, X448, ED25519, ED448, HMAC }.
+     */
+    ameth = EVP_PKEY_asn1_find_str(NULL, RSTRING_PTR(type), RSTRING_LENINT(type));
+    if (!ameth)
+        ossl_raise(ePKeyError, "algorithm %"PRIsVALUE" not found", type);
+    EVP_PKEY_asn1_get0_info(&pkey_id, NULL, NULL, NULL, NULL, ameth);
+    return pkey_id;
+}
+#endif
+
 /*
  *  call-seq:
  *      OpenSSL::PKey.new_raw_private_key(algo, string) -> PKey
@@ -647,28 +670,27 @@ static VALUE
 ossl_pkey_new_raw_private_key(VALUE self, VALUE type, VALUE key)
 {
     EVP_PKEY *pkey;
-    const EVP_PKEY_ASN1_METHOD *ameth;
-    int pkey_id;
     size_t keylen;
 
-    StringValue(type);
     StringValue(key);
-    ameth = EVP_PKEY_asn1_find_str(NULL, RSTRING_PTR(type), RSTRING_LENINT(type));
-    if (!ameth)
-        ossl_raise(ePKeyError, "algorithm %"PRIsVALUE" not found", type);
-    EVP_PKEY_asn1_get0_info(&pkey_id, NULL, NULL, NULL, NULL, ameth);
-
     keylen = RSTRING_LEN(key);
 
+#ifdef OSSL_USE_PROVIDER
+    pkey = EVP_PKEY_new_raw_private_key_ex(NULL, StringValueCStr(type), NULL,
+                                           (unsigned char *)RSTRING_PTR(key),
+                                           keylen);
+    if (!pkey)
+        ossl_raise(ePKeyError, "EVP_PKEY_new_raw_private_key_ex");
+#else
+    int pkey_id = lookup_pkey_type(type);
     pkey = EVP_PKEY_new_raw_private_key(pkey_id, NULL, (unsigned char *)RSTRING_PTR(key), keylen);
     if (!pkey)
         ossl_raise(ePKeyError, "EVP_PKEY_new_raw_private_key");
+#endif
 
-    return ossl_pkey_new(pkey);
+    return ossl_pkey_wrap(pkey);
 }
-#endif
 
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
 /*
  *  call-seq:
  *      OpenSSL::PKey.new_raw_public_key(algo, string) -> PKey
@@ -680,26 +702,26 @@ static VALUE
 ossl_pkey_new_raw_public_key(VALUE self, VALUE type, VALUE key)
 {
     EVP_PKEY *pkey;
-    const EVP_PKEY_ASN1_METHOD *ameth;
-    int pkey_id;
     size_t keylen;
 
-    StringValue(type);
     StringValue(key);
-    ameth = EVP_PKEY_asn1_find_str(NULL, RSTRING_PTR(type), RSTRING_LENINT(type));
-    if (!ameth)
-        ossl_raise(ePKeyError, "algorithm %"PRIsVALUE" not found", type);
-    EVP_PKEY_asn1_get0_info(&pkey_id, NULL, NULL, NULL, NULL, ameth);
-
     keylen = RSTRING_LEN(key);
 
+#ifdef OSSL_USE_PROVIDER
+    pkey = EVP_PKEY_new_raw_public_key_ex(NULL, StringValueCStr(type), NULL,
+                                          (unsigned char *)RSTRING_PTR(key),
+                                          keylen);
+    if (!pkey)
+        ossl_raise(ePKeyError, "EVP_PKEY_new_raw_public_key_ex");
+#else
+    int pkey_id = lookup_pkey_type(type);
     pkey = EVP_PKEY_new_raw_public_key(pkey_id, NULL, (unsigned char *)RSTRING_PTR(key), keylen);
     if (!pkey)
         ossl_raise(ePKeyError, "EVP_PKEY_new_raw_public_key");
+#endif
 
-    return ossl_pkey_new(pkey);
+    return ossl_pkey_wrap(pkey);
 }
-#endif
 
 /*
  * call-seq:
@@ -715,6 +737,10 @@ ossl_pkey_oid(VALUE self)
 
     GetPKey(self, pkey);
     nid = EVP_PKEY_id(pkey);
+#ifdef OSSL_USE_PROVIDER
+    if (nid == EVP_PKEY_KEYMGMT)
+        ossl_raise(ePKeyError, "EVP_PKEY_id");
+#endif
     return rb_str_new_cstr(OBJ_nid2sn(nid));
 }
 
@@ -728,13 +754,23 @@ static VALUE
 ossl_pkey_inspect(VALUE self)
 {
     EVP_PKEY *pkey;
-    int nid;
 
     GetPKey(self, pkey);
-    nid = EVP_PKEY_id(pkey);
-    return rb_sprintf("#<%"PRIsVALUE":%p oid=%s>",
-                      rb_class_name(CLASS_OF(self)), (void *)self,
-                      OBJ_nid2sn(nid));
+    VALUE str = rb_sprintf("#<%"PRIsVALUE":%p",
+                           rb_obj_class(self), (void *)self);
+    int nid = EVP_PKEY_id(pkey);
+#ifdef OSSL_USE_PROVIDER
+    if (nid != EVP_PKEY_KEYMGMT)
+#endif
+    rb_str_catf(str, " oid=%s", OBJ_nid2sn(nid));
+#ifdef OSSL_USE_PROVIDER
+    rb_str_catf(str, " type_name=%s", EVP_PKEY_get0_type_name(pkey));
+    const OSSL_PROVIDER *prov = EVP_PKEY_get0_provider(pkey);
+    if (prov)
+        rb_str_catf(str, " provider=%s", OSSL_PROVIDER_get0_name(prov));
+#endif
+    rb_str_catf(str, ">");
+    return str;
 }
 
 /*
@@ -778,44 +814,33 @@ VALUE
 ossl_pkey_export_traditional(int argc, VALUE *argv, VALUE self, int to_der)
 {
     EVP_PKEY *pkey;
-    VALUE cipher, pass;
+    VALUE cipher, pass, cipher_holder;
     const EVP_CIPHER *enc = NULL;
     BIO *bio;
 
     GetPKey(self, pkey);
     rb_scan_args(argc, argv, "02", &cipher, &pass);
     if (!NIL_P(cipher)) {
-	enc = ossl_evp_get_cipherbyname(cipher);
-	pass = ossl_pem_passwd_value(pass);
+        enc = ossl_evp_cipher_fetch(cipher, &cipher_holder);
+        pass = ossl_pem_passwd_value(pass);
     }
 
     bio = BIO_new(BIO_s_mem());
     if (!bio)
-	ossl_raise(ePKeyError, "BIO_new");
+        ossl_raise(ePKeyError, "BIO_new");
     if (to_der) {
-	if (!i2d_PrivateKey_bio(bio, pkey)) {
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "i2d_PrivateKey_bio");
-	}
+        if (!i2d_PrivateKey_bio(bio, pkey)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "i2d_PrivateKey_bio");
+        }
     }
     else {
-#if OSSL_OPENSSL_PREREQ(1, 1, 0) || OSSL_LIBRESSL_PREREQ(3, 5, 0)
-	if (!PEM_write_bio_PrivateKey_traditional(bio, pkey, enc, NULL, 0,
-						  ossl_pem_passwd_cb,
-						  (void *)pass)) {
-#else
-	char pem_str[80];
-	const char *aname;
-
-	EVP_PKEY_asn1_get0_info(NULL, NULL, NULL, NULL, &aname, pkey->ameth);
-	snprintf(pem_str, sizeof(pem_str), "%s PRIVATE KEY", aname);
-	if (!PEM_ASN1_write_bio((i2d_of_void *)i2d_PrivateKey, pem_str, bio,
-				pkey, enc, NULL, 0, ossl_pem_passwd_cb,
-				(void *)pass)) {
-#endif
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "PEM_write_bio_PrivateKey_traditional");
-	}
+        if (!PEM_write_bio_PrivateKey_traditional(bio, pkey, enc, NULL, 0,
+                                                  ossl_pem_passwd_cb,
+                                                  (void *)pass)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "PEM_write_bio_PrivateKey_traditional");
+        }
     }
     return ossl_membio2str(bio);
 }
@@ -824,37 +849,37 @@ static VALUE
 do_pkcs8_export(int argc, VALUE *argv, VALUE self, int to_der)
 {
     EVP_PKEY *pkey;
-    VALUE cipher, pass;
+    VALUE cipher, pass, cipher_holder;
     const EVP_CIPHER *enc = NULL;
     BIO *bio;
 
     GetPKey(self, pkey);
     rb_scan_args(argc, argv, "02", &cipher, &pass);
     if (argc > 0) {
-	/*
-	 * TODO: EncryptedPrivateKeyInfo actually has more options.
-	 * Should they be exposed?
-	 */
-	enc = ossl_evp_get_cipherbyname(cipher);
-	pass = ossl_pem_passwd_value(pass);
+        /*
+         * TODO: EncryptedPrivateKeyInfo actually has more options.
+         * Should they be exposed?
+         */
+        enc = ossl_evp_cipher_fetch(cipher, &cipher_holder);
+        pass = ossl_pem_passwd_value(pass);
     }
 
     bio = BIO_new(BIO_s_mem());
     if (!bio)
-	ossl_raise(ePKeyError, "BIO_new");
+        ossl_raise(ePKeyError, "BIO_new");
     if (to_der) {
-	if (!i2d_PKCS8PrivateKey_bio(bio, pkey, enc, NULL, 0,
-				     ossl_pem_passwd_cb, (void *)pass)) {
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "i2d_PKCS8PrivateKey_bio");
-	}
+        if (!i2d_PKCS8PrivateKey_bio(bio, pkey, enc, NULL, 0,
+                                     ossl_pem_passwd_cb, (void *)pass)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "i2d_PKCS8PrivateKey_bio");
+        }
     }
     else {
-	if (!PEM_write_bio_PKCS8PrivateKey(bio, pkey, enc, NULL, 0,
-					   ossl_pem_passwd_cb, (void *)pass)) {
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "PEM_write_bio_PKCS8PrivateKey");
-	}
+        if (!PEM_write_bio_PKCS8PrivateKey(bio, pkey, enc, NULL, 0,
+                                           ossl_pem_passwd_cb, (void *)pass)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "PEM_write_bio_PKCS8PrivateKey");
+        }
     }
     return ossl_membio2str(bio);
 }
@@ -901,7 +926,6 @@ ossl_pkey_private_to_pem(int argc, VALUE *argv, VALUE self)
     return do_pkcs8_export(argc, argv, self, 0);
 }
 
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
 /*
  *  call-seq:
  *     pkey.raw_private_key   => string
@@ -928,7 +952,6 @@ ossl_pkey_raw_private_key(VALUE self)
 
     return str;
 }
-#endif
 
 VALUE
 ossl_pkey_export_spki(VALUE self, int to_der)
@@ -937,20 +960,21 @@ ossl_pkey_export_spki(VALUE self, int to_der)
     BIO *bio;
 
     GetPKey(self, pkey);
+    ossl_pkey_check_public_key(pkey);
     bio = BIO_new(BIO_s_mem());
     if (!bio)
-	ossl_raise(ePKeyError, "BIO_new");
+        ossl_raise(ePKeyError, "BIO_new");
     if (to_der) {
-	if (!i2d_PUBKEY_bio(bio, pkey)) {
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "i2d_PUBKEY_bio");
-	}
+        if (!i2d_PUBKEY_bio(bio, pkey)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "i2d_PUBKEY_bio");
+        }
     }
     else {
-	if (!PEM_write_bio_PUBKEY(bio, pkey)) {
-	    BIO_free(bio);
-	    ossl_raise(ePKeyError, "PEM_write_bio_PUBKEY");
-	}
+        if (!PEM_write_bio_PUBKEY(bio, pkey)) {
+            BIO_free(bio);
+            ossl_raise(ePKeyError, "PEM_write_bio_PUBKEY");
+        }
     }
     return ossl_membio2str(bio);
 }
@@ -985,7 +1009,6 @@ ossl_pkey_public_to_pem(VALUE self)
     return ossl_pkey_export_spki(self, 0);
 }
 
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
 /*
  *  call-seq:
  *     pkey.raw_public_key   => string
@@ -1012,7 +1035,6 @@ ossl_pkey_raw_public_key(VALUE self)
 
     return str;
 }
-#endif
 
 /*
  *  call-seq:
@@ -1089,7 +1111,7 @@ static VALUE
 ossl_pkey_sign(int argc, VALUE *argv, VALUE self)
 {
     EVP_PKEY *pkey;
-    VALUE digest, data, options, sig;
+    VALUE digest, data, options, sig, md_holder;
     const EVP_MD *md = NULL;
     EVP_MD_CTX *ctx;
     EVP_PKEY_CTX *pctx;
@@ -1099,7 +1121,7 @@ ossl_pkey_sign(int argc, VALUE *argv, VALUE self)
     pkey = GetPrivPKeyPtr(self);
     rb_scan_args(argc, argv, "21", &digest, &data, &options);
     if (!NIL_P(digest))
-        md = ossl_evp_get_digestbyname(digest);
+        md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(data);
 
     ctx = EVP_MD_CTX_new();
@@ -1116,7 +1138,6 @@ ossl_pkey_sign(int argc, VALUE *argv, VALUE self)
             rb_jump_tag(state);
         }
     }
-#if OSSL_OPENSSL_PREREQ(1, 1, 1) || OSSL_LIBRESSL_PREREQ(3, 4, 0)
     if (EVP_DigestSign(ctx, NULL, &siglen, (unsigned char *)RSTRING_PTR(data),
                        RSTRING_LEN(data)) < 1) {
         EVP_MD_CTX_free(ctx);
@@ -1137,30 +1158,6 @@ ossl_pkey_sign(int argc, VALUE *argv, VALUE self)
         EVP_MD_CTX_free(ctx);
         ossl_raise(ePKeyError, "EVP_DigestSign");
     }
-#else
-    if (EVP_DigestSignUpdate(ctx, RSTRING_PTR(data), RSTRING_LEN(data)) < 1) {
-        EVP_MD_CTX_free(ctx);
-        ossl_raise(ePKeyError, "EVP_DigestSignUpdate");
-    }
-    if (EVP_DigestSignFinal(ctx, NULL, &siglen) < 1) {
-        EVP_MD_CTX_free(ctx);
-        ossl_raise(ePKeyError, "EVP_DigestSignFinal");
-    }
-    if (siglen > LONG_MAX) {
-        EVP_MD_CTX_free(ctx);
-        rb_raise(ePKeyError, "signature would be too large");
-    }
-    sig = ossl_str_new(NULL, (long)siglen, &state);
-    if (state) {
-        EVP_MD_CTX_free(ctx);
-        rb_jump_tag(state);
-    }
-    if (EVP_DigestSignFinal(ctx, (unsigned char *)RSTRING_PTR(sig),
-                            &siglen) < 1) {
-        EVP_MD_CTX_free(ctx);
-        ossl_raise(ePKeyError, "EVP_DigestSignFinal");
-    }
-#endif
     EVP_MD_CTX_free(ctx);
     rb_str_set_len(sig, siglen);
     return sig;
@@ -1193,7 +1190,7 @@ static VALUE
 ossl_pkey_verify(int argc, VALUE *argv, VALUE self)
 {
     EVP_PKEY *pkey;
-    VALUE digest, sig, data, options;
+    VALUE digest, sig, data, options, md_holder;
     const EVP_MD *md = NULL;
     EVP_MD_CTX *ctx;
     EVP_PKEY_CTX *pctx;
@@ -1203,7 +1200,7 @@ ossl_pkey_verify(int argc, VALUE *argv, VALUE self)
     rb_scan_args(argc, argv, "31", &digest, &sig, &data, &options);
     ossl_pkey_check_public_key(pkey);
     if (!NIL_P(digest))
-        md = ossl_evp_get_digestbyname(digest);
+        md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(sig);
     StringValue(data);
 
@@ -1221,24 +1218,12 @@ ossl_pkey_verify(int argc, VALUE *argv, VALUE self)
             rb_jump_tag(state);
         }
     }
-#if OSSL_OPENSSL_PREREQ(1, 1, 1) || OSSL_LIBRESSL_PREREQ(3, 4, 0)
     ret = EVP_DigestVerify(ctx, (unsigned char *)RSTRING_PTR(sig),
                            RSTRING_LEN(sig), (unsigned char *)RSTRING_PTR(data),
                            RSTRING_LEN(data));
     EVP_MD_CTX_free(ctx);
     if (ret < 0)
         ossl_raise(ePKeyError, "EVP_DigestVerify");
-#else
-    if (EVP_DigestVerifyUpdate(ctx, RSTRING_PTR(data), RSTRING_LEN(data)) < 1) {
-        EVP_MD_CTX_free(ctx);
-        ossl_raise(ePKeyError, "EVP_DigestVerifyUpdate");
-    }
-    ret = EVP_DigestVerifyFinal(ctx, (unsigned char *)RSTRING_PTR(sig),
-                                RSTRING_LEN(sig));
-    EVP_MD_CTX_free(ctx);
-    if (ret < 0)
-        ossl_raise(ePKeyError, "EVP_DigestVerifyFinal");
-#endif
     if (ret)
         return Qtrue;
     else {
@@ -1284,7 +1269,7 @@ static VALUE
 ossl_pkey_sign_raw(int argc, VALUE *argv, VALUE self)
 {
     EVP_PKEY *pkey;
-    VALUE digest, data, options, sig;
+    VALUE digest, data, options, sig, md_holder;
     const EVP_MD *md = NULL;
     EVP_PKEY_CTX *ctx;
     size_t outlen;
@@ -1293,7 +1278,7 @@ ossl_pkey_sign_raw(int argc, VALUE *argv, VALUE self)
     GetPKey(self, pkey);
     rb_scan_args(argc, argv, "21", &digest, &data, &options);
     if (!NIL_P(digest))
-        md = ossl_evp_get_digestbyname(digest);
+        md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(data);
 
     ctx = EVP_PKEY_CTX_new(pkey, /* engine */NULL);
@@ -1360,7 +1345,7 @@ static VALUE
 ossl_pkey_verify_raw(int argc, VALUE *argv, VALUE self)
 {
     EVP_PKEY *pkey;
-    VALUE digest, sig, data, options;
+    VALUE digest, sig, data, options, md_holder;
     const EVP_MD *md = NULL;
     EVP_PKEY_CTX *ctx;
     int state, ret;
@@ -1369,7 +1354,7 @@ ossl_pkey_verify_raw(int argc, VALUE *argv, VALUE self)
     rb_scan_args(argc, argv, "31", &digest, &sig, &data, &options);
     ossl_pkey_check_public_key(pkey);
     if (!NIL_P(digest))
-        md = ossl_evp_get_digestbyname(digest);
+        md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(sig);
     StringValue(data);
 
@@ -1423,7 +1408,7 @@ static VALUE
 ossl_pkey_verify_recover(int argc, VALUE *argv, VALUE self)
 {
     EVP_PKEY *pkey;
-    VALUE digest, sig, options, out;
+    VALUE digest, sig, options, out, md_holder;
     const EVP_MD *md = NULL;
     EVP_PKEY_CTX *ctx;
     int state;
@@ -1433,7 +1418,7 @@ ossl_pkey_verify_recover(int argc, VALUE *argv, VALUE self)
     rb_scan_args(argc, argv, "21", &digest, &sig, &options);
     ossl_pkey_check_public_key(pkey);
     if (!NIL_P(digest))
-        md = ossl_evp_get_digestbyname(digest);
+        md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(sig);
 
     ctx = EVP_PKEY_CTX_new(pkey, /* engine */NULL);
@@ -1511,8 +1496,10 @@ ossl_pkey_derive(int argc, VALUE *argv, VALUE self)
         EVP_PKEY_CTX_free(ctx);
         ossl_raise(ePKeyError, "EVP_PKEY_derive");
     }
-    if (keylen > LONG_MAX)
+    if (keylen > LONG_MAX) {
+        EVP_PKEY_CTX_free(ctx);
         rb_raise(ePKeyError, "derived key would be too large");
+    }
     str = ossl_str_new(NULL, (long)keylen, &state);
     if (state) {
         EVP_PKEY_CTX_free(ctx);
@@ -1673,11 +1660,6 @@ void
 Init_ossl_pkey(void)
 {
 #undef rb_intern
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     /* Document-module: OpenSSL::PKey
      *
      * == Asymmetric Public Key Algorithms
@@ -1733,7 +1715,16 @@ Init_ossl_pkey(void)
 
     /* Document-class: OpenSSL::PKey::PKeyError
      *
-     *Raised when errors occur during PKey#sign or PKey#verify.
+     * Raised when errors occur during PKey#sign or PKey#verify.
+     *
+     * Before version 4.0.0, OpenSSL::PKey::PKeyError had the following
+     * subclasses. These subclasses have been removed and the constants are
+     * now defined as aliases of OpenSSL::PKey::PKeyError.
+     *
+     * * OpenSSL::PKey::DHError
+     * * OpenSSL::PKey::DSAError
+     * * OpenSSL::PKey::ECError
+     * * OpenSSL::PKey::RSAError
      */
     ePKeyError = rb_define_class_under(mPKey, "PKeyError", eOSSLError);
 
@@ -1751,10 +1742,8 @@ Init_ossl_pkey(void)
     rb_define_module_function(mPKey, "read", ossl_pkey_new_from_data, -1);
     rb_define_module_function(mPKey, "generate_parameters", ossl_pkey_s_generate_parameters, -1);
     rb_define_module_function(mPKey, "generate_key", ossl_pkey_s_generate_key, -1);
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
     rb_define_module_function(mPKey, "new_raw_private_key", ossl_pkey_new_raw_private_key, 2);
     rb_define_module_function(mPKey, "new_raw_public_key", ossl_pkey_new_raw_public_key, 2);
-#endif
 
     rb_define_alloc_func(cPKey, ossl_pkey_alloc);
     rb_define_method(cPKey, "initialize", ossl_pkey_initialize, 0);
@@ -1770,10 +1759,8 @@ Init_ossl_pkey(void)
     rb_define_method(cPKey, "private_to_pem", ossl_pkey_private_to_pem, -1);
     rb_define_method(cPKey, "public_to_der", ossl_pkey_public_to_der, 0);
     rb_define_method(cPKey, "public_to_pem", ossl_pkey_public_to_pem, 0);
-#ifdef HAVE_EVP_PKEY_NEW_RAW_PRIVATE_KEY
     rb_define_method(cPKey, "raw_private_key", ossl_pkey_raw_private_key, 0);
     rb_define_method(cPKey, "raw_public_key", ossl_pkey_raw_public_key, 0);
-#endif
     rb_define_method(cPKey, "compare?", ossl_pkey_compare, 1);
 
     rb_define_method(cPKey, "sign", ossl_pkey_sign, -1);
diff --git a/ext/openssl/ossl_pkey.h b/ext/openssl/ossl_pkey.h
index 10669b824c..efba33b752 100644
--- a/ext/openssl/ossl_pkey.h
+++ b/ext/openssl/ossl_pkey.h
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(OSSL_PKEY_H)
 #define OSSL_PKEY_H
@@ -22,12 +22,12 @@ extern const rb_data_type_t ossl_evp_pkey_type;
 #define GetPKey(obj, pkey) do {\
     TypedData_Get_Struct((obj), EVP_PKEY, &ossl_evp_pkey_type, (pkey)); \
     if (!(pkey)) { \
-	rb_raise(rb_eRuntimeError, "PKEY wasn't initialized!");\
+        rb_raise(rb_eRuntimeError, "PKEY wasn't initialized!");\
     } \
 } while (0)
 
 /* Takes ownership of the EVP_PKEY */
-VALUE ossl_pkey_new(EVP_PKEY *);
+VALUE ossl_pkey_wrap(EVP_PKEY *);
 void ossl_pkey_check_public_key(const EVP_PKEY *);
 EVP_PKEY *ossl_pkey_read_generic(BIO *, VALUE);
 EVP_PKEY *GetPKeyPtr(VALUE);
@@ -45,7 +45,7 @@ VALUE ossl_pkey_export_spki(VALUE self, int to_der);
  * #to_der.
  */
 VALUE ossl_pkey_export_traditional(int argc, VALUE *argv, VALUE self,
-				   int to_der);
+                                   int to_der);
 
 void Init_ossl_pkey(void);
 
@@ -53,152 +53,140 @@ void Init_ossl_pkey(void);
  * RSA
  */
 extern VALUE cRSA;
-extern VALUE eRSAError;
-
 void Init_ossl_rsa(void);
 
 /*
  * DSA
  */
 extern VALUE cDSA;
-extern VALUE eDSAError;
-
 void Init_ossl_dsa(void);
 
 /*
  * DH
  */
 extern VALUE cDH;
-extern VALUE eDHError;
-
 void Init_ossl_dh(void);
 
 /*
  * EC
  */
 extern VALUE cEC;
-extern VALUE eECError;
-extern VALUE cEC_GROUP;
-extern VALUE eEC_GROUP;
-extern VALUE cEC_POINT;
-extern VALUE eEC_POINT;
-VALUE ossl_ec_new(EVP_PKEY *);
 void Init_ossl_ec(void);
 
-#define OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, _name, _get)		\
-/*									\
- *  call-seq:								\
- *     _keytype##.##_name -> aBN					\
- */									\
-static VALUE ossl_##_keytype##_get_##_name(VALUE self)			\
-{									\
-	const _type *obj;						\
-	const BIGNUM *bn;						\
-									\
-	Get##_type(self, obj);						\
-	_get;								\
-	if (bn == NULL)							\
-		return Qnil;						\
-	return ossl_bn_new(bn);						\
+#define OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, _name, _get)          \
+/*                                                                      \
+ *  call-seq:                                                           \
+ *     _keytype##.##_name -> aBN                                        \
+ */                                                                     \
+static VALUE ossl_##_keytype##_get_##_name(VALUE self)                  \
+{                                                                       \
+        const _type *obj;                                               \
+        const BIGNUM *bn;                                               \
+                                                                        \
+        Get##_type(self, obj);                                          \
+        _get;                                                           \
+        if (bn == NULL)                                                 \
+                return Qnil;                                            \
+        return ossl_bn_new(bn);                                         \
 }
 
-#define OSSL_PKEY_BN_DEF_GETTER3(_keytype, _type, _group, a1, a2, a3)	\
-	OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a1,			\
-		_type##_get0_##_group(obj, &bn, NULL, NULL))		\
-	OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a2,			\
-		_type##_get0_##_group(obj, NULL, &bn, NULL))		\
-	OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a3,			\
-		_type##_get0_##_group(obj, NULL, NULL, &bn))
-
-#define OSSL_PKEY_BN_DEF_GETTER2(_keytype, _type, _group, a1, a2)	\
-	OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a1,			\
-		_type##_get0_##_group(obj, &bn, NULL))			\
-	OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a2,			\
-		_type##_get0_##_group(obj, NULL, &bn))
-
-#if !OSSL_OPENSSL_PREREQ(3, 0, 0)
-#define OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)	\
-/*									\
- *  call-seq:								\
- *     _keytype##.set_##_group(a1, a2, a3) -> self			\
- */									\
+#define OSSL_PKEY_BN_DEF_GETTER3(_keytype, _type, _group, a1, a2, a3)   \
+        OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a1,                   \
+                _type##_get0_##_group(obj, &bn, NULL, NULL))            \
+        OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a2,                   \
+                _type##_get0_##_group(obj, NULL, &bn, NULL))            \
+        OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a3,                   \
+                _type##_get0_##_group(obj, NULL, NULL, &bn))
+
+#define OSSL_PKEY_BN_DEF_GETTER2(_keytype, _type, _group, a1, a2)       \
+        OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a1,                   \
+                _type##_get0_##_group(obj, &bn, NULL))                  \
+        OSSL_PKEY_BN_DEF_GETTER0(_keytype, _type, a2,                   \
+                _type##_get0_##_group(obj, NULL, &bn))
+
+#ifndef OSSL_HAVE_IMMUTABLE_PKEY
+#define OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)   \
+/*                                                                      \
+ *  call-seq:                                                           \
+ *     _keytype##.set_##_group(a1, a2, a3) -> self                      \
+ */                                                                     \
 static VALUE ossl_##_keytype##_set_##_group(VALUE self, VALUE v1, VALUE v2, VALUE v3) \
-{									\
-	_type *obj;							\
-	BIGNUM *bn1 = NULL, *orig_bn1 = NIL_P(v1) ? NULL : GetBNPtr(v1);\
-	BIGNUM *bn2 = NULL, *orig_bn2 = NIL_P(v2) ? NULL : GetBNPtr(v2);\
-	BIGNUM *bn3 = NULL, *orig_bn3 = NIL_P(v3) ? NULL : GetBNPtr(v3);\
-									\
-	Get##_type(self, obj);						\
-        if ((orig_bn1 && !(bn1 = BN_dup(orig_bn1))) ||			\
-            (orig_bn2 && !(bn2 = BN_dup(orig_bn2))) ||			\
-            (orig_bn3 && !(bn3 = BN_dup(orig_bn3)))) {			\
-		BN_clear_free(bn1);					\
-		BN_clear_free(bn2);					\
-		BN_clear_free(bn3);					\
-		ossl_raise(eBNError, NULL);				\
-	}								\
-									\
-	if (!_type##_set0_##_group(obj, bn1, bn2, bn3)) {		\
-		BN_clear_free(bn1);					\
-		BN_clear_free(bn2);					\
-		BN_clear_free(bn3);					\
-		ossl_raise(ePKeyError, #_type"_set0_"#_group);		\
-	}								\
-	return self;							\
+{                                                                       \
+        _type *obj;                                                     \
+        BIGNUM *bn1 = NULL, *orig_bn1 = NIL_P(v1) ? NULL : GetBNPtr(v1);\
+        BIGNUM *bn2 = NULL, *orig_bn2 = NIL_P(v2) ? NULL : GetBNPtr(v2);\
+        BIGNUM *bn3 = NULL, *orig_bn3 = NIL_P(v3) ? NULL : GetBNPtr(v3);\
+                                                                        \
+        Get##_type(self, obj);                                          \
+        if ((orig_bn1 && !(bn1 = BN_dup(orig_bn1))) ||                  \
+            (orig_bn2 && !(bn2 = BN_dup(orig_bn2))) ||                  \
+            (orig_bn3 && !(bn3 = BN_dup(orig_bn3)))) {                  \
+                BN_clear_free(bn1);                                     \
+                BN_clear_free(bn2);                                     \
+                BN_clear_free(bn3);                                     \
+                ossl_raise(ePKeyError, "BN_dup");                       \
+        }                                                               \
+                                                                        \
+        if (!_type##_set0_##_group(obj, bn1, bn2, bn3)) {               \
+                BN_clear_free(bn1);                                     \
+                BN_clear_free(bn2);                                     \
+                BN_clear_free(bn3);                                     \
+                ossl_raise(ePKeyError, #_type"_set0_"#_group);          \
+        }                                                               \
+        return self;                                                    \
 }
 
-#define OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)	\
-/*									\
- *  call-seq:								\
- *     _keytype##.set_##_group(a1, a2) -> self				\
- */									\
+#define OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)       \
+/*                                                                      \
+ *  call-seq:                                                           \
+ *     _keytype##.set_##_group(a1, a2) -> self                          \
+ */                                                                     \
 static VALUE ossl_##_keytype##_set_##_group(VALUE self, VALUE v1, VALUE v2) \
-{									\
-	_type *obj;							\
-	BIGNUM *bn1 = NULL, *orig_bn1 = NIL_P(v1) ? NULL : GetBNPtr(v1);\
-	BIGNUM *bn2 = NULL, *orig_bn2 = NIL_P(v2) ? NULL : GetBNPtr(v2);\
-									\
-	Get##_type(self, obj);						\
-        if ((orig_bn1 && !(bn1 = BN_dup(orig_bn1))) ||			\
-            (orig_bn2 && !(bn2 = BN_dup(orig_bn2)))) {			\
-		BN_clear_free(bn1);					\
-		BN_clear_free(bn2);					\
-		ossl_raise(eBNError, NULL);				\
-	}								\
-									\
-	if (!_type##_set0_##_group(obj, bn1, bn2)) {			\
-		BN_clear_free(bn1);					\
-		BN_clear_free(bn2);					\
-		ossl_raise(ePKeyError, #_type"_set0_"#_group);		\
-	}								\
-	return self;							\
+{                                                                       \
+        _type *obj;                                                     \
+        BIGNUM *bn1 = NULL, *orig_bn1 = NIL_P(v1) ? NULL : GetBNPtr(v1);\
+        BIGNUM *bn2 = NULL, *orig_bn2 = NIL_P(v2) ? NULL : GetBNPtr(v2);\
+                                                                        \
+        Get##_type(self, obj);                                          \
+        if ((orig_bn1 && !(bn1 = BN_dup(orig_bn1))) ||                  \
+            (orig_bn2 && !(bn2 = BN_dup(orig_bn2)))) {                  \
+                BN_clear_free(bn1);                                     \
+                BN_clear_free(bn2);                                     \
+                ossl_raise(ePKeyError, "BN_dup");                       \
+        }                                                               \
+                                                                        \
+        if (!_type##_set0_##_group(obj, bn1, bn2)) {                    \
+                BN_clear_free(bn1);                                     \
+                BN_clear_free(bn2);                                     \
+                ossl_raise(ePKeyError, #_type"_set0_"#_group);          \
+        }                                                               \
+        return self;                                                    \
 }
 #else
-#define OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)	\
+#define OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)   \
 static VALUE ossl_##_keytype##_set_##_group(VALUE self, VALUE v1, VALUE v2, VALUE v3) \
-{									\
-        rb_raise(ePKeyError,						\
+{                                                                       \
+        rb_raise(ePKeyError,                                            \
                  #_keytype"#set_"#_group"= is incompatible with OpenSSL 3.0"); \
 }
 
-#define OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)	\
+#define OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)       \
 static VALUE ossl_##_keytype##_set_##_group(VALUE self, VALUE v1, VALUE v2) \
-{									\
-        rb_raise(ePKeyError,						\
+{                                                                       \
+        rb_raise(ePKeyError,                                            \
                  #_keytype"#set_"#_group"= is incompatible with OpenSSL 3.0"); \
 }
 #endif
 
-#define OSSL_PKEY_BN_DEF3(_keytype, _type, _group, a1, a2, a3)		\
-	OSSL_PKEY_BN_DEF_GETTER3(_keytype, _type, _group, a1, a2, a3)	\
-	OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)
+#define OSSL_PKEY_BN_DEF3(_keytype, _type, _group, a1, a2, a3)          \
+        OSSL_PKEY_BN_DEF_GETTER3(_keytype, _type, _group, a1, a2, a3)   \
+        OSSL_PKEY_BN_DEF_SETTER3(_keytype, _type, _group, a1, a2, a3)
 
-#define OSSL_PKEY_BN_DEF2(_keytype, _type, _group, a1, a2)		\
-	OSSL_PKEY_BN_DEF_GETTER2(_keytype, _type, _group, a1, a2)	\
-	OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)
+#define OSSL_PKEY_BN_DEF2(_keytype, _type, _group, a1, a2)              \
+        OSSL_PKEY_BN_DEF_GETTER2(_keytype, _type, _group, a1, a2)       \
+        OSSL_PKEY_BN_DEF_SETTER2(_keytype, _type, _group, a1, a2)
 
-#define DEF_OSSL_PKEY_BN(class, keytype, name)				\
-	rb_define_method((class), #name, ossl_##keytype##_get_##name, 0)
+#define DEF_OSSL_PKEY_BN(class, keytype, name)                          \
+        rb_define_method((class), #name, ossl_##keytype##_get_##name, 0)
 
 #endif /* OSSL_PKEY_H */
diff --git a/ext/openssl/ossl_pkey_dh.c b/ext/openssl/ossl_pkey_dh.c
index a231814a99..3f2975c5a3 100644
--- a/ext/openssl/ossl_pkey_dh.c
+++ b/ext/openssl/ossl_pkey_dh.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -14,20 +14,21 @@
 #define GetPKeyDH(obj, pkey) do { \
     GetPKey((obj), (pkey)); \
     if (EVP_PKEY_base_id(pkey) != EVP_PKEY_DH) { /* PARANOIA? */ \
-	ossl_raise(rb_eRuntimeError, "THIS IS NOT A DH!") ; \
+        ossl_raise(rb_eRuntimeError, "THIS IS NOT A DH!") ; \
     } \
 } while (0)
 #define GetDH(obj, dh) do { \
     EVP_PKEY *_pkey; \
     GetPKeyDH((obj), _pkey); \
     (dh) = EVP_PKEY_get0_DH(_pkey); \
+    if ((dh) == NULL) \
+        ossl_raise(ePKeyError, "failed to get DH from EVP_PKEY"); \
 } while (0)
 
 /*
  * Classes
  */
 VALUE cDH;
-VALUE eDHError;
 
 /*
  * Private
@@ -43,6 +44,7 @@ VALUE eDHError;
  * If called without arguments, an empty instance without any parameter or key
  * components is created. Use #set_pqg to manually set the parameters afterwards
  * (and optionally #set_key to set private and public key components).
+ * This form is not compatible with OpenSSL 3.0 or later.
  *
  * If a String is given, tries to parse it as a DER- or PEM- encoded parameters.
  * See also OpenSSL::PKey.read which can parse keys of any kinds.
@@ -58,14 +60,15 @@ VALUE eDHError;
  *
  * Examples:
  *   # Creating an instance from scratch
- *   # Note that this is deprecated and will not work on OpenSSL 3.0 or later.
+ *   # Note that this is deprecated and will result in ArgumentError when
+ *   # using OpenSSL 3.0 or later.
  *   dh = OpenSSL::PKey::DH.new
  *   dh.set_pqg(bn_p, nil, bn_g)
  *
  *   # Generating a parameters and a key pair
  *   dh = OpenSSL::PKey::DH.new(2048) # An alias of OpenSSL::PKey::DH.generate(2048)
  *
- *   # Reading DH parameters
+ *   # Reading DH parameters from a PEM-encoded string
  *   dh_params = OpenSSL::PKey::DH.new(File.read('parameters.pem')) # loads parameters only
  *   dh = OpenSSL::PKey.generate_key(dh_params) # generates a key pair
  */
@@ -84,10 +87,15 @@ ossl_dh_initialize(int argc, VALUE *argv, VALUE self)
 
     /* The DH.new(size, generator) form is handled by lib/openssl/pkey.rb */
     if (rb_scan_args(argc, argv, "01", &arg) == 0) {
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
+        rb_raise(rb_eArgError, "OpenSSL::PKey::DH.new cannot be called " \
+                 "without arguments; pkeys are immutable with OpenSSL 3.0");
+#else
         dh = DH_new();
         if (!dh)
-            ossl_raise(eDHError, "DH_new");
+            ossl_raise(ePKeyError, "DH_new");
         goto legacy;
+#endif
     }
 
     arg = ossl_to_der_if_possible(arg);
@@ -105,12 +113,12 @@ ossl_dh_initialize(int argc, VALUE *argv, VALUE self)
     pkey = ossl_pkey_read_generic(in, Qnil);
     BIO_free(in);
     if (!pkey)
-        ossl_raise(eDHError, "could not parse pkey");
+        ossl_raise(ePKeyError, "could not parse pkey");
 
     type = EVP_PKEY_base_id(pkey);
     if (type != EVP_PKEY_DH) {
         EVP_PKEY_free(pkey);
-        rb_raise(eDHError, "incorrect pkey type: %s", OBJ_nid2sn(type));
+        rb_raise(ePKeyError, "incorrect pkey type: %s", OBJ_nid2sn(type));
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
@@ -121,13 +129,14 @@ ossl_dh_initialize(int argc, VALUE *argv, VALUE self)
     if (!pkey || EVP_PKEY_assign_DH(pkey, dh) != 1) {
         EVP_PKEY_free(pkey);
         DH_free(dh);
-        ossl_raise(eDHError, "EVP_PKEY_assign_DH");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_DH");
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
 }
 
 #ifndef HAVE_EVP_PKEY_DUP
+/* :nodoc: */
 static VALUE
 ossl_dh_initialize_copy(VALUE self, VALUE other)
 {
@@ -142,26 +151,26 @@ ossl_dh_initialize_copy(VALUE self, VALUE other)
 
     dh = DHparams_dup(dh_other);
     if (!dh)
-	ossl_raise(eDHError, "DHparams_dup");
+        ossl_raise(ePKeyError, "DHparams_dup");
 
     DH_get0_key(dh_other, &pub, &priv);
     if (pub) {
-	BIGNUM *pub2 = BN_dup(pub);
-	BIGNUM *priv2 = BN_dup(priv);
+        BIGNUM *pub2 = BN_dup(pub);
+        BIGNUM *priv2 = BN_dup(priv);
 
         if (!pub2 || (priv && !priv2)) {
-	    BN_clear_free(pub2);
-	    BN_clear_free(priv2);
-	    ossl_raise(eDHError, "BN_dup");
-	}
-	DH_set0_key(dh, pub2, priv2);
+            BN_clear_free(pub2);
+            BN_clear_free(priv2);
+            ossl_raise(ePKeyError, "BN_dup");
+        }
+        DH_set0_key(dh, pub2, priv2);
     }
 
     pkey = EVP_PKEY_new();
     if (!pkey || EVP_PKEY_assign_DH(pkey, dh) != 1) {
         EVP_PKEY_free(pkey);
         DH_free(dh);
-        ossl_raise(eDHError, "EVP_PKEY_assign_DH");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_DH");
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
@@ -240,11 +249,11 @@ ossl_dh_export(VALUE self)
 
     GetDH(self, dh);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eDHError, NULL);
+        ossl_raise(ePKeyError, NULL);
     }
     if (!PEM_write_bio_DHparams(out, dh)) {
-	BIO_free(out);
-	ossl_raise(eDHError, NULL);
+        BIO_free(out);
+        ossl_raise(ePKeyError, NULL);
     }
     str = ossl_membio2str(out);
 
@@ -274,11 +283,11 @@ ossl_dh_to_der(VALUE self)
 
     GetDH(self, dh);
     if((len = i2d_DHparams(dh, NULL)) <= 0)
-	ossl_raise(eDHError, NULL);
+        ossl_raise(ePKeyError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_DHparams(dh, &p) < 0)
-	ossl_raise(eDHError, NULL);
+        ossl_raise(ePKeyError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -286,35 +295,6 @@ ossl_dh_to_der(VALUE self)
 
 /*
  *  call-seq:
- *     dh.params -> hash
- *
- * Stores all parameters of key to the hash
- * INSECURE: PRIVATE INFORMATIONS CAN LEAK OUT!!!
- * Don't use :-)) (I's up to you)
- */
-static VALUE
-ossl_dh_get_params(VALUE self)
-{
-    OSSL_3_const DH *dh;
-    VALUE hash;
-    const BIGNUM *p, *q, *g, *pub_key, *priv_key;
-
-    GetDH(self, dh);
-    DH_get0_pqg(dh, &p, &q, &g);
-    DH_get0_key(dh, &pub_key, &priv_key);
-
-    hash = rb_hash_new();
-    rb_hash_aset(hash, rb_str_new2("p"), ossl_bn_new(p));
-    rb_hash_aset(hash, rb_str_new2("q"), ossl_bn_new(q));
-    rb_hash_aset(hash, rb_str_new2("g"), ossl_bn_new(g));
-    rb_hash_aset(hash, rb_str_new2("pub_key"), ossl_bn_new(pub_key));
-    rb_hash_aset(hash, rb_str_new2("priv_key"), ossl_bn_new(priv_key));
-
-    return hash;
-}
-
-/*
- *  call-seq:
  *     dh.params_ok? -> true | false
  *
  * Validates the Diffie-Hellman parameters associated with this instance.
@@ -334,7 +314,7 @@ ossl_dh_check_params(VALUE self)
     GetPKey(self, pkey);
     pctx = EVP_PKEY_CTX_new(pkey, /* engine */NULL);
     if (!pctx)
-        ossl_raise(eDHError, "EVP_PKEY_CTX_new");
+        ossl_raise(ePKeyError, "EVP_PKEY_CTX_new");
     ret = EVP_PKEY_param_check(pctx);
     EVP_PKEY_CTX_free(pctx);
 #else
@@ -377,19 +357,6 @@ OSSL_PKEY_BN_DEF2(dh, DH, key, pub_key, priv_key)
 void
 Init_ossl_dh(void)
 {
-#if 0
-    mPKey = rb_define_module_under(mOSSL, "PKey");
-    cPKey = rb_define_class_under(mPKey, "PKey", rb_cObject);
-    ePKeyError = rb_define_class_under(mPKey, "PKeyError", eOSSLError);
-#endif
-
-    /* Document-class: OpenSSL::PKey::DHError
-     *
-     * Generic exception that is raised if an operation on a DH PKey
-     * fails unexpectedly or in case an instantiation of an instance of DH
-     * fails due to non-conformant input data.
-     */
-    eDHError = rb_define_class_under(mPKey, "DHError", ePKeyError);
     /* Document-class: OpenSSL::PKey::DH
      *
      * An implementation of the Diffie-Hellman key exchange protocol based on
@@ -443,8 +410,6 @@ Init_ossl_dh(void)
     DEF_OSSL_PKEY_BN(cDH, dh, priv_key);
     rb_define_method(cDH, "set_pqg", ossl_dh_set_pqg, 3);
     rb_define_method(cDH, "set_key", ossl_dh_set_key, 2);
-
-    rb_define_method(cDH, "params", ossl_dh_get_params, 0);
 }
 
 #else /* defined NO_DH */
diff --git a/ext/openssl/ossl_pkey_dsa.c b/ext/openssl/ossl_pkey_dsa.c
index 058ce73888..041646a058 100644
--- a/ext/openssl/ossl_pkey_dsa.c
+++ b/ext/openssl/ossl_pkey_dsa.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -14,13 +14,15 @@
 #define GetPKeyDSA(obj, pkey) do { \
     GetPKey((obj), (pkey)); \
     if (EVP_PKEY_base_id(pkey) != EVP_PKEY_DSA) { /* PARANOIA? */ \
-	ossl_raise(rb_eRuntimeError, "THIS IS NOT A DSA!"); \
+        ossl_raise(rb_eRuntimeError, "THIS IS NOT A DSA!"); \
     } \
 } while (0)
 #define GetDSA(obj, dsa) do { \
     EVP_PKEY *_pkey; \
     GetPKeyDSA((obj), _pkey); \
     (dsa) = EVP_PKEY_get0_DSA(_pkey); \
+    if ((dsa) == NULL) \
+        ossl_raise(ePKeyError, "failed to get DSA from EVP_PKEY"); \
 } while (0)
 
 static inline int
@@ -41,7 +43,6 @@ DSA_PRIVATE(VALUE obj, OSSL_3_const DSA *dsa)
  * Classes
  */
 VALUE cDSA;
-VALUE eDSAError;
 
 /*
  * Private
@@ -56,6 +57,7 @@ VALUE eDSAError;
  *
  * If called without arguments, creates a new instance with no key components
  * set. They can be set individually by #set_pqg and #set_key.
+ * This form is not compatible with OpenSSL 3.0 or later.
  *
  * If called with a String, tries to parse as DER or PEM encoding of a \DSA key.
  * See also OpenSSL::PKey.read which can parse keys of any kinds.
@@ -96,10 +98,15 @@ ossl_dsa_initialize(int argc, VALUE *argv, VALUE self)
     /* The DSA.new(size, generator) form is handled by lib/openssl/pkey.rb */
     rb_scan_args(argc, argv, "02", &arg, &pass);
     if (argc == 0) {
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
+        rb_raise(rb_eArgError, "OpenSSL::PKey::DSA.new cannot be called " \
+                 "without arguments; pkeys are immutable with OpenSSL 3.0");
+#else
         dsa = DSA_new();
         if (!dsa)
-            ossl_raise(eDSAError, "DSA_new");
+            ossl_raise(ePKeyError, "DSA_new");
         goto legacy;
+#endif
     }
 
     pass = ossl_pem_passwd_value(pass);
@@ -117,12 +124,12 @@ ossl_dsa_initialize(int argc, VALUE *argv, VALUE self)
     pkey = ossl_pkey_read_generic(in, pass);
     BIO_free(in);
     if (!pkey)
-        ossl_raise(eDSAError, "Neither PUB key nor PRIV key");
+        ossl_raise(ePKeyError, "Neither PUB key nor PRIV key");
 
     type = EVP_PKEY_base_id(pkey);
     if (type != EVP_PKEY_DSA) {
         EVP_PKEY_free(pkey);
-        rb_raise(eDSAError, "incorrect pkey type: %s", OBJ_nid2sn(type));
+        rb_raise(ePKeyError, "incorrect pkey type: %s", OBJ_nid2sn(type));
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
@@ -133,13 +140,14 @@ ossl_dsa_initialize(int argc, VALUE *argv, VALUE self)
     if (!pkey || EVP_PKEY_assign_DSA(pkey, dsa) != 1) {
         EVP_PKEY_free(pkey);
         DSA_free(dsa);
-        ossl_raise(eDSAError, "EVP_PKEY_assign_DSA");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_DSA");
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
 }
 
 #ifndef HAVE_EVP_PKEY_DUP
+/* :nodoc: */
 static VALUE
 ossl_dsa_initialize_copy(VALUE self, VALUE other)
 {
@@ -155,13 +163,13 @@ ossl_dsa_initialize_copy(VALUE self, VALUE other)
                               (d2i_of_void *)d2i_DSAPrivateKey,
                               (char *)dsa);
     if (!dsa_new)
-	ossl_raise(eDSAError, "ASN1_dup");
+        ossl_raise(ePKeyError, "ASN1_dup");
 
     pkey = EVP_PKEY_new();
     if (!pkey || EVP_PKEY_assign_DSA(pkey, dsa_new) != 1) {
         EVP_PKEY_free(pkey);
         DSA_free(dsa_new);
-        ossl_raise(eDSAError, "EVP_PKEY_assign_DSA");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_DSA");
     }
     RTYPEDDATA_DATA(self) = pkey;
 
@@ -304,35 +312,6 @@ ossl_dsa_to_der(VALUE self)
 
 
 /*
- *  call-seq:
- *    dsa.params -> hash
- *
- * Stores all parameters of key to the hash
- * INSECURE: PRIVATE INFORMATIONS CAN LEAK OUT!!!
- * Don't use :-)) (I's up to you)
- */
-static VALUE
-ossl_dsa_get_params(VALUE self)
-{
-    OSSL_3_const DSA *dsa;
-    VALUE hash;
-    const BIGNUM *p, *q, *g, *pub_key, *priv_key;
-
-    GetDSA(self, dsa);
-    DSA_get0_pqg(dsa, &p, &q, &g);
-    DSA_get0_key(dsa, &pub_key, &priv_key);
-
-    hash = rb_hash_new();
-    rb_hash_aset(hash, rb_str_new2("p"), ossl_bn_new(p));
-    rb_hash_aset(hash, rb_str_new2("q"), ossl_bn_new(q));
-    rb_hash_aset(hash, rb_str_new2("g"), ossl_bn_new(g));
-    rb_hash_aset(hash, rb_str_new2("pub_key"), ossl_bn_new(pub_key));
-    rb_hash_aset(hash, rb_str_new2("priv_key"), ossl_bn_new(priv_key));
-
-    return hash;
-}
-
-/*
  * Document-method: OpenSSL::PKey::DSA#set_pqg
  * call-seq:
  *   dsa.set_pqg(p, q, g) -> self
@@ -355,20 +334,6 @@ OSSL_PKEY_BN_DEF2(dsa, DSA, key, pub_key, priv_key)
 void
 Init_ossl_dsa(void)
 {
-#if 0
-    mPKey = rb_define_module_under(mOSSL, "PKey");
-    cPKey = rb_define_class_under(mPKey, "PKey", rb_cObject);
-    ePKeyError = rb_define_class_under(mPKey, "PKeyError", eOSSLError);
-#endif
-
-    /* Document-class: OpenSSL::PKey::DSAError
-     *
-     * Generic exception that is raised if an operation on a DSA PKey
-     * fails unexpectedly or in case an instantiation of an instance of DSA
-     * fails due to non-conformant input data.
-     */
-    eDSAError = rb_define_class_under(mPKey, "DSAError", ePKeyError);
-
     /* Document-class: OpenSSL::PKey::DSA
      *
      * DSA, the Digital Signature Algorithm, is specified in NIST's
@@ -396,8 +361,6 @@ Init_ossl_dsa(void)
     DEF_OSSL_PKEY_BN(cDSA, dsa, priv_key);
     rb_define_method(cDSA, "set_pqg", ossl_dsa_set_pqg, 3);
     rb_define_method(cDSA, "set_key", ossl_dsa_set_key, 2);
-
-    rb_define_method(cDSA, "params", ossl_dsa_get_params, 0);
 }
 
 #else /* defined NO_DSA */
diff --git a/ext/openssl/ossl_pkey_ec.c b/ext/openssl/ossl_pkey_ec.c
index 4b3a1fd0fe..35f031819d 100644
--- a/ext/openssl/ossl_pkey_ec.c
+++ b/ext/openssl/ossl_pkey_ec.c
@@ -15,25 +15,27 @@ static const rb_data_type_t ossl_ec_point_type;
 #define GetPKeyEC(obj, pkey) do { \
     GetPKey((obj), (pkey)); \
     if (EVP_PKEY_base_id(pkey) != EVP_PKEY_EC) { \
-	ossl_raise(rb_eRuntimeError, "THIS IS NOT A EC PKEY!"); \
+        ossl_raise(rb_eRuntimeError, "THIS IS NOT A EC PKEY!"); \
     } \
 } while (0)
 #define GetEC(obj, key) do { \
     EVP_PKEY *_pkey; \
     GetPKeyEC(obj, _pkey); \
     (key) = EVP_PKEY_get0_EC_KEY(_pkey); \
+    if ((key) == NULL) \
+        ossl_raise(ePKeyError, "failed to get EC_KEY from EVP_PKEY"); \
 } while (0)
 
 #define GetECGroup(obj, group) do { \
     TypedData_Get_Struct(obj, EC_GROUP, &ossl_ec_group_type, group); \
     if ((group) == NULL) \
-	ossl_raise(eEC_GROUP, "EC_GROUP is not initialized"); \
+        ossl_raise(eEC_GROUP, "EC_GROUP is not initialized"); \
 } while (0)
 
 #define GetECPoint(obj, point) do { \
     TypedData_Get_Struct(obj, EC_POINT, &ossl_ec_point_type, point); \
     if ((point) == NULL) \
-	ossl_raise(eEC_POINT, "EC_POINT is not initialized"); \
+        ossl_raise(eEC_POINT, "EC_POINT is not initialized"); \
 } while (0)
 #define GetECPointGroup(obj, group) do { \
     VALUE _group = rb_attr_get(obj, id_i_group); \
@@ -41,17 +43,13 @@ static const rb_data_type_t ossl_ec_point_type;
 } while (0)
 
 VALUE cEC;
-VALUE eECError;
-VALUE cEC_GROUP;
-VALUE eEC_GROUP;
-VALUE cEC_POINT;
-VALUE eEC_POINT;
+static VALUE cEC_GROUP;
+static VALUE eEC_GROUP;
+static VALUE cEC_POINT;
+static VALUE eEC_POINT;
 
-static ID s_GFp, s_GF2m;
-
-static ID ID_uncompressed;
-static ID ID_compressed;
-static ID ID_hybrid;
+static VALUE sym_GFp, sym_GF2m;
+static VALUE sym_uncompressed, sym_compressed, sym_hybrid;
 
 static ID id_i_group;
 
@@ -68,27 +66,27 @@ ec_key_new_from_group(VALUE arg)
     EC_KEY *ec;
 
     if (rb_obj_is_kind_of(arg, cEC_GROUP)) {
-	EC_GROUP *group;
+        EC_GROUP *group;
 
-	GetECGroup(arg, group);
-	if (!(ec = EC_KEY_new()))
-	    ossl_raise(eECError, NULL);
+        GetECGroup(arg, group);
+        if (!(ec = EC_KEY_new()))
+            ossl_raise(ePKeyError, NULL);
 
-	if (!EC_KEY_set_group(ec, group)) {
-	    EC_KEY_free(ec);
-	    ossl_raise(eECError, NULL);
-	}
+        if (!EC_KEY_set_group(ec, group)) {
+            EC_KEY_free(ec);
+            ossl_raise(ePKeyError, NULL);
+        }
     } else {
-	int nid = OBJ_sn2nid(StringValueCStr(arg));
+        int nid = OBJ_sn2nid(StringValueCStr(arg));
 
-	if (nid == NID_undef)
-	    ossl_raise(eECError, "invalid curve name");
+        if (nid == NID_undef)
+            ossl_raise(ePKeyError, "invalid curve name");
 
-	if (!(ec = EC_KEY_new_by_curve_name(nid)))
-	    ossl_raise(eECError, NULL);
+        if (!(ec = EC_KEY_new_by_curve_name(nid)))
+            ossl_raise(ePKeyError, NULL);
 
-	EC_KEY_set_asn1_flag(ec, OPENSSL_EC_NAMED_CURVE);
-	EC_KEY_set_conv_form(ec, POINT_CONVERSION_UNCOMPRESSED);
+        EC_KEY_set_asn1_flag(ec, OPENSSL_EC_NAMED_CURVE);
+        EC_KEY_set_conv_form(ec, POINT_CONVERSION_UNCOMPRESSED);
     }
 
     return ec;
@@ -115,12 +113,12 @@ ossl_ec_key_s_generate(VALUE klass, VALUE arg)
     if (!pkey || EVP_PKEY_assign_EC_KEY(pkey, ec) != 1) {
         EVP_PKEY_free(pkey);
         EC_KEY_free(ec);
-        ossl_raise(eECError, "EVP_PKEY_assign_EC_KEY");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_EC_KEY");
     }
     RTYPEDDATA_DATA(obj) = pkey;
 
     if (!EC_KEY_generate_key(ec))
-	ossl_raise(eECError, "EC_KEY_generate_key");
+        ossl_raise(ePKeyError, "EC_KEY_generate_key");
 
     return obj;
 }
@@ -150,9 +148,14 @@ static VALUE ossl_ec_key_initialize(int argc, VALUE *argv, VALUE self)
 
     rb_scan_args(argc, argv, "02", &arg, &pass);
     if (NIL_P(arg)) {
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
+        rb_raise(rb_eArgError, "OpenSSL::PKey::EC.new cannot be called " \
+                 "without arguments; pkeys are immutable with OpenSSL 3.0");
+#else
         if (!(ec = EC_KEY_new()))
-            ossl_raise(eECError, "EC_KEY_new");
+            ossl_raise(ePKeyError, "EC_KEY_new");
         goto legacy;
+#endif
     }
     else if (rb_obj_is_kind_of(arg, cEC_GROUP)) {
         ec = ec_key_new_from_group(arg);
@@ -174,7 +177,7 @@ static VALUE ossl_ec_key_initialize(int argc, VALUE *argv, VALUE self)
     type = EVP_PKEY_base_id(pkey);
     if (type != EVP_PKEY_EC) {
         EVP_PKEY_free(pkey);
-        rb_raise(eDSAError, "incorrect pkey type: %s", OBJ_nid2sn(type));
+        rb_raise(ePKeyError, "incorrect pkey type: %s", OBJ_nid2sn(type));
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
@@ -184,13 +187,14 @@ static VALUE ossl_ec_key_initialize(int argc, VALUE *argv, VALUE self)
     if (!pkey || EVP_PKEY_assign_EC_KEY(pkey, ec) != 1) {
         EVP_PKEY_free(pkey);
         EC_KEY_free(ec);
-        ossl_raise(eECError, "EVP_PKEY_assign_EC_KEY");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_EC_KEY");
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
 }
 
 #ifndef HAVE_EVP_PKEY_DUP
+/* :nodoc: */
 static VALUE
 ossl_ec_key_initialize_copy(VALUE self, VALUE other)
 {
@@ -204,12 +208,12 @@ ossl_ec_key_initialize_copy(VALUE self, VALUE other)
 
     ec_new = EC_KEY_dup(ec);
     if (!ec_new)
-	ossl_raise(eECError, "EC_KEY_dup");
+        ossl_raise(ePKeyError, "EC_KEY_dup");
 
     pkey = EVP_PKEY_new();
     if (!pkey || EVP_PKEY_assign_EC_KEY(pkey, ec_new) != 1) {
         EC_KEY_free(ec_new);
-        ossl_raise(eECError, "EVP_PKEY_assign_EC_KEY");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_EC_KEY");
     }
     RTYPEDDATA_DATA(self) = pkey;
 
@@ -233,7 +237,7 @@ ossl_ec_key_get_group(VALUE self)
     GetEC(self, ec);
     group = EC_KEY_get0_group(ec);
     if (!group)
-	return Qnil;
+        return Qnil;
 
     return ec_group_new(group);
 }
@@ -248,7 +252,7 @@ ossl_ec_key_get_group(VALUE self)
 static VALUE
 ossl_ec_key_set_group(VALUE self, VALUE group_v)
 {
-#if OSSL_OPENSSL_PREREQ(3, 0, 0)
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
     rb_raise(ePKeyError, "pkeys are immutable on OpenSSL 3.0");
 #else
     EC_KEY *ec;
@@ -258,7 +262,7 @@ ossl_ec_key_set_group(VALUE self, VALUE group_v)
     GetECGroup(group_v, group);
 
     if (EC_KEY_set_group(ec, group) != 1)
-        ossl_raise(eECError, "EC_KEY_set_group");
+        ossl_raise(ePKeyError, "EC_KEY_set_group");
 
     return group_v;
 #endif
@@ -290,7 +294,7 @@ static VALUE ossl_ec_key_get_private_key(VALUE self)
  */
 static VALUE ossl_ec_key_set_private_key(VALUE self, VALUE private_key)
 {
-#if OSSL_OPENSSL_PREREQ(3, 0, 0)
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
     rb_raise(ePKeyError, "pkeys are immutable on OpenSSL 3.0");
 #else
     EC_KEY *ec;
@@ -301,14 +305,14 @@ static VALUE ossl_ec_key_set_private_key(VALUE self, VALUE private_key)
         bn = GetBNPtr(private_key);
 
     switch (EC_KEY_set_private_key(ec, bn)) {
-    case 1:
+      case 1:
         break;
-    case 0:
+      case 0:
         if (bn == NULL)
             break;
-	/* fallthrough */
-    default:
-        ossl_raise(eECError, "EC_KEY_set_private_key");
+        /* fallthrough */
+      default:
+        ossl_raise(ePKeyError, "EC_KEY_set_private_key");
     }
 
     return private_key;
@@ -341,7 +345,7 @@ static VALUE ossl_ec_key_get_public_key(VALUE self)
  */
 static VALUE ossl_ec_key_set_public_key(VALUE self, VALUE public_key)
 {
-#if OSSL_OPENSSL_PREREQ(3, 0, 0)
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
     rb_raise(ePKeyError, "pkeys are immutable on OpenSSL 3.0");
 #else
     EC_KEY *ec;
@@ -352,14 +356,14 @@ static VALUE ossl_ec_key_set_public_key(VALUE self, VALUE public_key)
         GetECPoint(public_key, point);
 
     switch (EC_KEY_set_public_key(ec, point)) {
-    case 1:
+      case 1:
         break;
-    case 0:
+      case 0:
         if (point == NULL)
             break;
-	/* fallthrough */
-    default:
-        ossl_raise(eECError, "EC_KEY_set_public_key");
+        /* fallthrough */
+      default:
+        ossl_raise(ePKeyError, "EC_KEY_set_public_key");
     }
 
     return public_key;
@@ -463,7 +467,7 @@ ossl_ec_key_export(int argc, VALUE *argv, VALUE self)
 
     GetEC(self, ec);
     if (EC_KEY_get0_public_key(ec) == NULL)
-        ossl_raise(eECError, "can't export - no public key set");
+        ossl_raise(ePKeyError, "can't export - no public key set");
     if (EC_KEY_get0_private_key(ec))
         return ossl_pkey_export_traditional(argc, argv, self, 0);
     else
@@ -491,7 +495,7 @@ ossl_ec_key_to_der(VALUE self)
 
     GetEC(self, ec);
     if (EC_KEY_get0_public_key(ec) == NULL)
-        ossl_raise(eECError, "can't export - no public key set");
+        ossl_raise(ePKeyError, "can't export - no public key set");
     if (EC_KEY_get0_private_key(ec))
         return ossl_pkey_export_traditional(0, NULL, self, 1);
     else
@@ -513,14 +517,14 @@ ossl_ec_key_to_der(VALUE self)
  */
 static VALUE ossl_ec_key_generate_key(VALUE self)
 {
-#if OSSL_OPENSSL_PREREQ(3, 0, 0)
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
     rb_raise(ePKeyError, "pkeys are immutable on OpenSSL 3.0");
 #else
     EC_KEY *ec;
 
     GetEC(self, ec);
     if (EC_KEY_generate_key(ec) != 1)
-	ossl_raise(eECError, "EC_KEY_generate_key");
+        ossl_raise(ePKeyError, "EC_KEY_generate_key");
 
     return self;
 #endif
@@ -545,18 +549,18 @@ static VALUE ossl_ec_key_check_key(VALUE self)
     GetEC(self, ec);
     pctx = EVP_PKEY_CTX_new(pkey, /* engine */NULL);
     if (!pctx)
-        ossl_raise(eECError, "EVP_PKEY_CTX_new");
+        ossl_raise(ePKeyError, "EVP_PKEY_CTX_new");
 
     if (EC_KEY_get0_private_key(ec) != NULL) {
         if (EVP_PKEY_check(pctx) != 1) {
             EVP_PKEY_CTX_free(pctx);
-            ossl_raise(eECError, "EVP_PKEY_check");
+            ossl_raise(ePKeyError, "EVP_PKEY_check");
         }
     }
     else {
         if (EVP_PKEY_public_check(pctx) != 1) {
             EVP_PKEY_CTX_free(pctx);
-            ossl_raise(eECError, "EVP_PKEY_public_check");
+            ossl_raise(ePKeyError, "EVP_PKEY_public_check");
         }
     }
 
@@ -566,7 +570,7 @@ static VALUE ossl_ec_key_check_key(VALUE self)
 
     GetEC(self, ec);
     if (EC_KEY_check_key(ec) != 1)
-	ossl_raise(eECError, "EC_KEY_check_key");
+        ossl_raise(ePKeyError, "EC_KEY_check_key");
 #endif
 
     return Qtrue;
@@ -584,7 +588,7 @@ ossl_ec_group_free(void *ptr)
 static const rb_data_type_t ossl_ec_group_type = {
     "OpenSSL/ec_group",
     {
-	0, ossl_ec_group_free,
+        0, ossl_ec_group_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -604,7 +608,7 @@ ec_group_new(const EC_GROUP *group)
     obj = ossl_ec_group_alloc(cEC_GROUP);
     group_new = EC_GROUP_dup(group);
     if (!group_new)
-	ossl_raise(eEC_GROUP, "EC_GROUP_dup");
+        ossl_raise(eEC_GROUP, "EC_GROUP_dup");
     RTYPEDDATA_DATA(obj) = group_new;
 
     return obj;
@@ -632,7 +636,7 @@ static VALUE ossl_ec_group_initialize(int argc, VALUE *argv, VALUE self)
         ossl_raise(rb_eRuntimeError, "EC_GROUP is already initialized");
 
     switch (rb_scan_args(argc, argv, "13", &arg1, &arg2, &arg3, &arg4)) {
-    case 1:
+      case 1:
         if (rb_obj_is_kind_of(arg1, cEC_GROUP)) {
             const EC_GROUP *arg1_group;
 
@@ -644,7 +648,7 @@ static VALUE ossl_ec_group_initialize(int argc, VALUE *argv, VALUE self)
 
             group = PEM_read_bio_ECPKParameters(in, NULL, NULL, NULL);
             if (!group) {
-		OSSL_BIO_reset(in);
+                OSSL_BIO_reset(in);
                 group = d2i_ECPKParameters_bio(in, NULL);
             }
 
@@ -654,11 +658,14 @@ static VALUE ossl_ec_group_initialize(int argc, VALUE *argv, VALUE self)
                 const char *name = StringValueCStr(arg1);
                 int nid = OBJ_sn2nid(name);
 
-		ossl_clear_error(); /* ignore errors in d2i_ECPKParameters_bio() */
+                ossl_clear_error(); /* ignore errors in d2i_ECPKParameters_bio() */
                 if (nid == NID_undef)
                     ossl_raise(eEC_GROUP, "unknown curve name (%"PRIsVALUE")", arg1);
-
+#if !defined(OPENSSL_IS_AWSLC)
                 group = EC_GROUP_new_by_curve_name(nid);
+#else /* EC_GROUPs are static and immutable by default in AWS-LC. */
+                group = EC_GROUP_new_by_curve_name_mutable(nid);
+#endif
                 if (group == NULL)
                     ossl_raise(eEC_GROUP, "unable to create curve (%"PRIsVALUE")", arg1);
 
@@ -668,33 +675,34 @@ static VALUE ossl_ec_group_initialize(int argc, VALUE *argv, VALUE self)
         }
 
         break;
-    case 4:
+      case 4:
         if (SYMBOL_P(arg1)) {
-            ID id = SYM2ID(arg1);
             EC_GROUP *(*new_curve)(const BIGNUM *, const BIGNUM *, const BIGNUM *, BN_CTX *) = NULL;
             const BIGNUM *p = GetBNPtr(arg2);
             const BIGNUM *a = GetBNPtr(arg3);
             const BIGNUM *b = GetBNPtr(arg4);
 
-            if (id == s_GFp) {
+            if (arg1 == sym_GFp) {
                 new_curve = EC_GROUP_new_curve_GFp;
+            }
 #if !defined(OPENSSL_NO_EC2M)
-            } else if (id == s_GF2m) {
+            else if (arg1 == sym_GF2m) {
                 new_curve = EC_GROUP_new_curve_GF2m;
+            }
 #endif
-            } else {
+            else {
                 ossl_raise(rb_eArgError, "unknown symbol, must be :GFp or :GF2m");
             }
 
             if ((group = new_curve(p, a, b, ossl_bn_ctx)) == NULL)
                 ossl_raise(eEC_GROUP, "EC_GROUP_new_by_GF*");
         } else {
-             ossl_raise(rb_eArgError, "unknown argument, must be :GFp or :GF2m");
+            ossl_raise(rb_eArgError, "unknown argument, must be :GFp or :GF2m");
         }
 
         break;
-    default:
-        ossl_raise(rb_eArgError, "wrong number of arguments");
+      default:
+        ossl_raise(rb_eArgError, "wrong number of arguments (given %d, expected 1 or 4)", argc);
     }
 
     ASSUME(group);
@@ -703,6 +711,7 @@ static VALUE ossl_ec_group_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_ec_group_initialize_copy(VALUE self, VALUE other)
 {
@@ -710,12 +719,12 @@ ossl_ec_group_initialize_copy(VALUE self, VALUE other)
 
     TypedData_Get_Struct(self, EC_GROUP, &ossl_ec_group_type, group_new);
     if (group_new)
-	ossl_raise(eEC_GROUP, "EC::Group already initialized");
+        ossl_raise(eEC_GROUP, "EC::Group already initialized");
     GetECGroup(other, group);
 
     group_new = EC_GROUP_dup(group);
     if (!group_new)
-	ossl_raise(eEC_GROUP, "EC_GROUP_dup");
+        ossl_raise(eEC_GROUP, "EC_GROUP_dup");
     RTYPEDDATA_DATA(self) = group_new;
 
     return self;
@@ -737,9 +746,9 @@ static VALUE ossl_ec_group_eql(VALUE a, VALUE b)
     GetECGroup(b, group2);
 
     switch (EC_GROUP_cmp(group1, group2, ossl_bn_ctx)) {
-    case 0: return Qtrue;
-    case 1: return Qfalse;
-    default: ossl_raise(eEC_GROUP, "EC_GROUP_cmp");
+      case 0: return Qtrue;
+      case 1: return Qfalse;
+      default: ossl_raise(eEC_GROUP, "EC_GROUP_cmp");
     }
 }
 
@@ -759,7 +768,7 @@ static VALUE ossl_ec_group_get_generator(VALUE self)
     GetECGroup(self, group);
     generator = EC_GROUP_get0_generator(group);
     if (!generator)
-	return Qnil;
+        return Qnil;
 
     return ec_point_new(generator, group);
 }
@@ -802,11 +811,10 @@ static VALUE ossl_ec_group_get_order(VALUE self)
 {
     VALUE bn_obj;
     BIGNUM *bn;
-    EC_GROUP *group = NULL;
+    EC_GROUP *group;
 
     GetECGroup(self, group);
-
-    bn_obj = ossl_bn_new(NULL);
+    bn_obj = ossl_bn_new(BN_value_one());
     bn = GetBNPtr(bn_obj);
 
     if (EC_GROUP_get_order(group, bn, ossl_bn_ctx) != 1)
@@ -827,11 +835,10 @@ static VALUE ossl_ec_group_get_cofactor(VALUE self)
 {
     VALUE bn_obj;
     BIGNUM *bn;
-    EC_GROUP *group = NULL;
+    EC_GROUP *group;
 
     GetECGroup(self, group);
-
-    bn_obj = ossl_bn_new(NULL);
+    bn_obj = ossl_bn_new(BN_value_one());
     bn = GetBNPtr(bn_obj);
 
     if (EC_GROUP_get_cofactor(group, bn, ossl_bn_ctx) != 1)
@@ -842,25 +849,23 @@ static VALUE ossl_ec_group_get_cofactor(VALUE self)
 
 /*
  * call-seq:
- *   group.curve_name  => String
+ *    group.curve_name -> string or nil
  *
- * Returns the curve name (sn).
+ * Returns the curve name (short name) corresponding to this group, or +nil+
+ * if \OpenSSL does not have an OID associated with the group.
  *
  * See the OpenSSL documentation for EC_GROUP_get_curve_name()
  */
 static VALUE ossl_ec_group_get_curve_name(VALUE self)
 {
-    EC_GROUP *group = NULL;
+    EC_GROUP *group;
     int nid;
 
     GetECGroup(self, group);
-    if (group == NULL)
-        return Qnil;
-
     nid = EC_GROUP_get_curve_name(group);
-
-/* BUG: an nid or asn1 object should be returned, maybe. */
-    return rb_str_new2(OBJ_nid2sn(nid));
+    if (nid == NID_undef)
+        return Qnil;
+    return rb_str_new_cstr(OBJ_nid2sn(nid));
 }
 
 /*
@@ -953,37 +958,36 @@ static VALUE ossl_ec_group_set_asn1_flag(VALUE self, VALUE flag_v)
  */
 static VALUE ossl_ec_group_get_point_conversion_form(VALUE self)
 {
-    EC_GROUP *group = NULL;
+    EC_GROUP *group;
     point_conversion_form_t form;
-    VALUE ret;
 
     GetECGroup(self, group);
     form = EC_GROUP_get_point_conversion_form(group);
 
     switch (form) {
-    case POINT_CONVERSION_UNCOMPRESSED:	ret = ID_uncompressed; break;
-    case POINT_CONVERSION_COMPRESSED:	ret = ID_compressed; break;
-    case POINT_CONVERSION_HYBRID:	ret = ID_hybrid; break;
-    default:	ossl_raise(eEC_GROUP, "unsupported point conversion form: %d, this module should be updated", form);
+      case POINT_CONVERSION_UNCOMPRESSED:
+        return sym_uncompressed;
+      case POINT_CONVERSION_COMPRESSED:
+        return sym_compressed;
+      case POINT_CONVERSION_HYBRID:
+        return sym_hybrid;
+      default:
+        ossl_raise(eEC_GROUP, "unsupported point conversion form: %d, " \
+                   "this module should be updated", form);
     }
-
-   return ID2SYM(ret);
 }
 
 static point_conversion_form_t
 parse_point_conversion_form_symbol(VALUE sym)
 {
-    ID id = SYM2ID(sym);
-
-    if (id == ID_uncompressed)
-	return POINT_CONVERSION_UNCOMPRESSED;
-    else if (id == ID_compressed)
-	return POINT_CONVERSION_COMPRESSED;
-    else if (id == ID_hybrid)
-	return POINT_CONVERSION_HYBRID;
-    else
-	ossl_raise(rb_eArgError, "unsupported point conversion form %+"PRIsVALUE
-		   " (expected :compressed, :uncompressed, or :hybrid)", sym);
+    if (sym == sym_uncompressed)
+        return POINT_CONVERSION_UNCOMPRESSED;
+    if (sym == sym_compressed)
+        return POINT_CONVERSION_COMPRESSED;
+    if (sym == sym_hybrid)
+        return POINT_CONVERSION_HYBRID;
+    ossl_raise(rb_eArgError, "unsupported point conversion form %+"PRIsVALUE
+               " (expected :compressed, :uncompressed, or :hybrid)", sym);
 }
 
 /*
@@ -1088,20 +1092,20 @@ static VALUE ossl_ec_group_to_string(VALUE self, int format)
         ossl_raise(eEC_GROUP, "BIO_new(BIO_s_mem())");
 
     switch(format) {
-    case EXPORT_PEM:
+      case EXPORT_PEM:
         i = PEM_write_bio_ECPKParameters(out, group);
-    	break;
-    case EXPORT_DER:
+        break;
+      case EXPORT_DER:
         i = i2d_ECPKParameters_bio(out, group);
-    	break;
-    default:
+        break;
+      default:
         BIO_free(out);
-    	ossl_raise(rb_eRuntimeError, "unknown format (internal error)");
+        ossl_raise(rb_eRuntimeError, "unknown format (internal error)");
     }
 
     if (i != 1) {
         BIO_free(out);
-        ossl_raise(eECError, NULL);
+        ossl_raise(ePKeyError, NULL);
     }
 
     str = ossl_membio2str(out);
@@ -1145,11 +1149,11 @@ static VALUE ossl_ec_group_to_text(VALUE self)
 
     GetECGroup(self, group);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eEC_GROUP, "BIO_new(BIO_s_mem())");
+        ossl_raise(eEC_GROUP, "BIO_new(BIO_s_mem())");
     }
     if (!ECPKParameters_print(out, group, 0)) {
-	BIO_free(out);
-	ossl_raise(eEC_GROUP, NULL);
+        BIO_free(out);
+        ossl_raise(eEC_GROUP, NULL);
     }
     str = ossl_membio2str(out);
 
@@ -1169,7 +1173,7 @@ ossl_ec_point_free(void *ptr)
 static const rb_data_type_t ossl_ec_point_type = {
     "OpenSSL/EC_POINT",
     {
-	0, ossl_ec_point_free,
+        0, ossl_ec_point_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -1189,7 +1193,7 @@ ec_point_new(const EC_POINT *point, const EC_GROUP *group)
     obj = ossl_ec_point_alloc(cEC_POINT);
     point_new = EC_POINT_dup(point, group);
     if (!point_new)
-	ossl_raise(eEC_POINT, "EC_POINT_dup");
+        ossl_raise(eEC_POINT, "EC_POINT_dup");
     RTYPEDDATA_DATA(obj) = point_new;
     rb_ivar_set(obj, id_i_group, ec_group_new(group));
 
@@ -1217,39 +1221,39 @@ static VALUE ossl_ec_point_initialize(int argc, VALUE *argv, VALUE self)
 
     TypedData_Get_Struct(self, EC_POINT, &ossl_ec_point_type, point);
     if (point)
-	rb_raise(eEC_POINT, "EC_POINT already initialized");
+        rb_raise(eEC_POINT, "EC_POINT already initialized");
 
     rb_scan_args(argc, argv, "11", &group_v, &arg2);
     if (rb_obj_is_kind_of(group_v, cEC_POINT)) {
-	if (argc != 1)
-	    rb_raise(rb_eArgError, "invalid second argument");
-	return ossl_ec_point_initialize_copy(self, group_v);
+        if (argc != 1)
+            rb_raise(rb_eArgError, "invalid second argument");
+        return ossl_ec_point_initialize_copy(self, group_v);
     }
 
     GetECGroup(group_v, group);
     if (argc == 1) {
-	point = EC_POINT_new(group);
-	if (!point)
-	    ossl_raise(eEC_POINT, "EC_POINT_new");
+        point = EC_POINT_new(group);
+        if (!point)
+            ossl_raise(eEC_POINT, "EC_POINT_new");
     }
     else {
-	if (rb_obj_is_kind_of(arg2, cBN)) {
-	    point = EC_POINT_bn2point(group, GetBNPtr(arg2), NULL, ossl_bn_ctx);
-	    if (!point)
-		ossl_raise(eEC_POINT, "EC_POINT_bn2point");
-	}
-	else {
-	    StringValue(arg2);
-	    point = EC_POINT_new(group);
-	    if (!point)
-		ossl_raise(eEC_POINT, "EC_POINT_new");
-	    if (!EC_POINT_oct2point(group, point,
-				    (unsigned char *)RSTRING_PTR(arg2),
-				    RSTRING_LEN(arg2), ossl_bn_ctx)) {
-		EC_POINT_free(point);
-		ossl_raise(eEC_POINT, "EC_POINT_oct2point");
-	    }
-	}
+        if (rb_obj_is_kind_of(arg2, cBN)) {
+            point = EC_POINT_bn2point(group, GetBNPtr(arg2), NULL, ossl_bn_ctx);
+            if (!point)
+                ossl_raise(eEC_POINT, "EC_POINT_bn2point");
+        }
+        else {
+            StringValue(arg2);
+            point = EC_POINT_new(group);
+            if (!point)
+                ossl_raise(eEC_POINT, "EC_POINT_new");
+            if (!EC_POINT_oct2point(group, point,
+                                    (unsigned char *)RSTRING_PTR(arg2),
+                                    RSTRING_LEN(arg2), ossl_bn_ctx)) {
+                EC_POINT_free(point);
+                ossl_raise(eEC_POINT, "EC_POINT_oct2point");
+            }
+        }
     }
 
     RTYPEDDATA_DATA(self) = point;
@@ -1258,6 +1262,7 @@ static VALUE ossl_ec_point_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_ec_point_initialize_copy(VALUE self, VALUE other)
 {
@@ -1267,7 +1272,7 @@ ossl_ec_point_initialize_copy(VALUE self, VALUE other)
 
     TypedData_Get_Struct(self, EC_POINT, &ossl_ec_point_type, point_new);
     if (point_new)
-	ossl_raise(eEC_POINT, "EC::Point already initialized");
+        ossl_raise(eEC_POINT, "EC::Point already initialized");
     GetECPoint(other, point);
 
     group_v = rb_obj_dup(rb_attr_get(other, id_i_group));
@@ -1275,7 +1280,7 @@ ossl_ec_point_initialize_copy(VALUE self, VALUE other)
 
     point_new = EC_POINT_dup(point, group);
     if (!point_new)
-	ossl_raise(eEC_POINT, "EC_POINT_dup");
+        ossl_raise(eEC_POINT, "EC_POINT_dup");
     RTYPEDDATA_DATA(self) = point_new;
     rb_ivar_set(self, id_i_group, group_v);
 
@@ -1302,9 +1307,9 @@ static VALUE ossl_ec_point_eql(VALUE a, VALUE b)
     GetECGroup(group_v1, group);
 
     switch (EC_POINT_cmp(group, point1, point2, ossl_bn_ctx)) {
-    case 0: return Qtrue;
-    case 1: return Qfalse;
-    default: ossl_raise(eEC_POINT, "EC_POINT_cmp");
+      case 0: return Qtrue;
+      case 1: return Qfalse;
+      default: ossl_raise(eEC_POINT, "EC_POINT_cmp");
     }
 
     UNREACHABLE;
@@ -1323,9 +1328,9 @@ static VALUE ossl_ec_point_is_at_infinity(VALUE self)
     GetECPointGroup(self, group);
 
     switch (EC_POINT_is_at_infinity(group, point)) {
-    case 1: return Qtrue;
-    case 0: return Qfalse;
-    default: ossl_raise(eEC_POINT, "EC_POINT_is_at_infinity");
+      case 1: return Qtrue;
+      case 0: return Qfalse;
+      default: ossl_raise(eEC_POINT, "EC_POINT_is_at_infinity");
     }
 
     UNREACHABLE;
@@ -1344,9 +1349,9 @@ static VALUE ossl_ec_point_is_on_curve(VALUE self)
     GetECPointGroup(self, group);
 
     switch (EC_POINT_is_on_curve(group, point, ossl_bn_ctx)) {
-    case 1: return Qtrue;
-    case 0: return Qfalse;
-    default: ossl_raise(eEC_POINT, "EC_POINT_is_on_curve");
+      case 1: return Qtrue;
+      case 0: return Qfalse;
+      default: ossl_raise(eEC_POINT, "EC_POINT_is_on_curve");
     }
 
     UNREACHABLE;
@@ -1367,7 +1372,7 @@ static VALUE ossl_ec_point_make_affine(VALUE self)
     GetECPointGroup(self, group);
 
     rb_warn("OpenSSL::PKey::EC::Point#make_affine! is deprecated");
-#if !OSSL_OPENSSL_PREREQ(3, 0, 0)
+#if !defined(OSSL_HAVE_IMMUTABLE_PKEY) && !defined(OPENSSL_IS_AWSLC)
     if (EC_POINT_make_affine(group, point, ossl_bn_ctx) != 1)
         ossl_raise(eEC_POINT, "EC_POINT_make_affine");
 #endif
@@ -1438,12 +1443,12 @@ ossl_ec_point_to_octet_string(VALUE self, VALUE conversion_form)
 
     len = EC_POINT_point2oct(group, point, form, NULL, 0, ossl_bn_ctx);
     if (!len)
-	ossl_raise(eEC_POINT, "EC_POINT_point2oct");
+        ossl_raise(eEC_POINT, "EC_POINT_point2oct");
     str = rb_str_new(NULL, (long)len);
     if (!EC_POINT_point2oct(group, point, form,
-			    (unsigned char *)RSTRING_PTR(str), len,
-			    ossl_bn_ctx))
-	ossl_raise(eEC_POINT, "EC_POINT_point2oct");
+                            (unsigned char *)RSTRING_PTR(str), len,
+                            ossl_bn_ctx))
+        ossl_raise(eEC_POINT, "EC_POINT_point2oct");
     return str;
 }
 
@@ -1478,7 +1483,6 @@ static VALUE ossl_ec_point_add(VALUE self, VALUE other)
 /*
  * call-seq:
  *   point.mul(bn1 [, bn2]) => point
- *   point.mul(bns, points [, bn2]) => point
  *
  * Performs elliptic curve point multiplication.
  *
@@ -1486,11 +1490,9 @@ static VALUE ossl_ec_point_add(VALUE self, VALUE other)
  * generator of the group of _point_. _bn2_ may be omitted, and in that case,
  * the result is just <tt>bn1 * point</tt>.
  *
- * The second form calculates <tt>bns[0] * point + bns[1] * points[0] + ...
- * + bns[-1] * points[-1] + bn2 * G</tt>. _bn2_ may be omitted. _bns_ must be
- * an array of OpenSSL::BN. _points_ must be an array of
- * OpenSSL::PKey::EC::Point. Please note that <tt>points[0]</tt> is not
- * multiplied by <tt>bns[0]</tt>, but <tt>bns[1]</tt>.
+ * Before version 4.0.0, and when compiled with OpenSSL 1.1.1 or older, this
+ * method allowed another form:
+ *   point.mul(bns, points [, bn2]) => point
  */
 static VALUE ossl_ec_point_mul(int argc, VALUE *argv, VALUE self)
 {
@@ -1508,62 +1510,15 @@ static VALUE ossl_ec_point_mul(int argc, VALUE *argv, VALUE self)
     GetECPoint(result, point_result);
 
     rb_scan_args(argc, argv, "12", &arg1, &arg2, &arg3);
-    if (!RB_TYPE_P(arg1, T_ARRAY)) {
-	BIGNUM *bn = GetBNPtr(arg1);
+    if (RB_TYPE_P(arg1, T_ARRAY) || argc > 2)
+        rb_raise(rb_eNotImpError, "OpenSSL::PKey::EC::Point#mul with arrays " \
+                 "is no longer supported");
 
-	if (!NIL_P(arg2))
-	    bn_g = GetBNPtr(arg2);
-	if (EC_POINT_mul(group, point_result, bn_g, point_self, bn, ossl_bn_ctx) != 1)
-	    ossl_raise(eEC_POINT, NULL);
-    } else {
-#if (defined(OPENSSL_VERSION_MAJOR) && OPENSSL_VERSION_MAJOR >= 3) || defined(LIBRESSL_VERSION_NUMBER)
-        rb_raise(rb_eNotImpError, "calling #mul with arrays is not" \
-                 "supported by this OpenSSL version");
-#else
-	/*
-	 * bignums | arg1[0] | arg1[1] | arg1[2] | ...
-	 * points  | self    | arg2[0] | arg2[1] | ...
-	 */
-	long i, num;
-	VALUE bns_tmp, tmp_p, tmp_b;
-	const EC_POINT **points;
-	const BIGNUM **bignums;
-
-	Check_Type(arg1, T_ARRAY);
-	Check_Type(arg2, T_ARRAY);
-	if (RARRAY_LEN(arg1) != RARRAY_LEN(arg2) + 1) /* arg2 must be 1 larger */
-	    ossl_raise(rb_eArgError, "bns must be 1 longer than points; see the documentation");
-
-        rb_warning("OpenSSL::PKey::EC::Point#mul(ary, ary) is deprecated; " \
-                   "use #mul(bn) form instead");
-
-	num = RARRAY_LEN(arg1);
-	bns_tmp = rb_ary_tmp_new(num);
-	bignums = ALLOCV_N(const BIGNUM *, tmp_b, num);
-	for (i = 0; i < num; i++) {
-	    VALUE item = RARRAY_AREF(arg1, i);
-	    bignums[i] = GetBNPtr(item);
-	    rb_ary_push(bns_tmp, item);
-	}
-
-	points = ALLOCV_N(const EC_POINT *, tmp_p, num);
-	points[0] = point_self; /* self */
-	for (i = 0; i < num - 1; i++)
-	    GetECPoint(RARRAY_AREF(arg2, i), points[i + 1]);
-
-	if (!NIL_P(arg3))
-	    bn_g = GetBNPtr(arg3);
-
-	if (EC_POINTs_mul(group, point_result, bn_g, num, points, bignums, ossl_bn_ctx) != 1) {
-	    ALLOCV_END(tmp_b);
-	    ALLOCV_END(tmp_p);
-	    ossl_raise(eEC_POINT, NULL);
-	}
-
-	ALLOCV_END(tmp_b);
-	ALLOCV_END(tmp_p);
-#endif
-    }
+    BIGNUM *bn = GetBNPtr(arg1);
+    if (!NIL_P(arg2))
+        bn_g = GetBNPtr(arg2);
+    if (EC_POINT_mul(group, point_result, bn_g, point_self, bn, ossl_bn_ctx) != 1)
+        ossl_raise(eEC_POINT, NULL);
 
     return result;
 }
@@ -1571,15 +1526,6 @@ static VALUE ossl_ec_point_mul(int argc, VALUE *argv, VALUE self)
 void Init_ossl_ec(void)
 {
 #undef rb_intern
-#if 0
-    mPKey = rb_define_module_under(mOSSL, "PKey");
-    cPKey = rb_define_class_under(mPKey, "PKey", rb_cObject);
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    ePKeyError = rb_define_class_under(mPKey, "PKeyError", eOSSLError);
-#endif
-
-    eECError = rb_define_class_under(mPKey, "ECError", ePKeyError);
-
     /*
      * Document-class: OpenSSL::PKey::EC
      *
@@ -1601,17 +1547,15 @@ void Init_ossl_ec(void)
     eEC_GROUP = rb_define_class_under(cEC_GROUP, "Error", eOSSLError);
     eEC_POINT = rb_define_class_under(cEC_POINT, "Error", eOSSLError);
 
-    s_GFp = rb_intern("GFp");
-    s_GF2m = rb_intern("GF2m");
+    sym_GFp = ID2SYM(rb_intern_const("GFp"));
+    sym_GF2m = ID2SYM(rb_intern_const("GF2m"));
 
-    ID_uncompressed = rb_intern("uncompressed");
-    ID_compressed = rb_intern("compressed");
-    ID_hybrid = rb_intern("hybrid");
+    sym_uncompressed = ID2SYM(rb_intern_const("uncompressed"));
+    sym_compressed = ID2SYM(rb_intern_const("compressed"));
+    sym_hybrid = ID2SYM(rb_intern_const("hybrid"));
 
     rb_define_const(cEC, "NAMED_CURVE", INT2NUM(OPENSSL_EC_NAMED_CURVE));
-#if defined(OPENSSL_EC_EXPLICIT_CURVE)
     rb_define_const(cEC, "EXPLICIT_CURVE", INT2NUM(OPENSSL_EC_EXPLICIT_CURVE));
-#endif
 
     rb_define_singleton_method(cEC, "builtin_curves", ossl_s_builtin_curves, 0);
 
diff --git a/ext/openssl/ossl_pkey_rsa.c b/ext/openssl/ossl_pkey_rsa.c
index 389f76f309..039b2c6a34 100644
--- a/ext/openssl/ossl_pkey_rsa.c
+++ b/ext/openssl/ossl_pkey_rsa.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -14,13 +14,15 @@
 #define GetPKeyRSA(obj, pkey) do { \
     GetPKey((obj), (pkey)); \
     if (EVP_PKEY_base_id(pkey) != EVP_PKEY_RSA) { /* PARANOIA? */ \
-	ossl_raise(rb_eRuntimeError, "THIS IS NOT A RSA!") ; \
+        ossl_raise(rb_eRuntimeError, "THIS IS NOT A RSA!") ; \
     } \
 } while (0)
 #define GetRSA(obj, rsa) do { \
     EVP_PKEY *_pkey; \
     GetPKeyRSA((obj), _pkey); \
     (rsa) = EVP_PKEY_get0_RSA(_pkey); \
+    if ((rsa) == NULL) \
+        ossl_raise(ePKeyError, "failed to get RSA from EVP_PKEY"); \
 } while (0)
 
 static inline int
@@ -42,7 +44,6 @@ RSA_PRIVATE(VALUE obj, OSSL_3_const RSA *rsa)
  * Classes
  */
 VALUE cRSA;
-VALUE eRSAError;
 
 /*
  * Private
@@ -59,6 +60,7 @@ VALUE eRSAError;
  * If called without arguments, creates a new instance with no key components
  * set. They can be set individually by #set_key, #set_factors, and
  * #set_crt_params.
+ * This form is not compatible with OpenSSL 3.0 or later.
  *
  * If called with a String, tries to parse as DER or PEM encoding of an \RSA key.
  * Note that if _password_ is not specified, but the key is encrypted with a
@@ -89,10 +91,15 @@ ossl_rsa_initialize(int argc, VALUE *argv, VALUE self)
     /* The RSA.new(size, generator) form is handled by lib/openssl/pkey.rb */
     rb_scan_args(argc, argv, "02", &arg, &pass);
     if (argc == 0) {
-	rsa = RSA_new();
+#ifdef OSSL_HAVE_IMMUTABLE_PKEY
+        rb_raise(rb_eArgError, "OpenSSL::PKey::RSA.new cannot be called " \
+                 "without arguments; pkeys are immutable with OpenSSL 3.0");
+#else
+        rsa = RSA_new();
         if (!rsa)
-            ossl_raise(eRSAError, "RSA_new");
+            ossl_raise(ePKeyError, "RSA_new");
         goto legacy;
+#endif
     }
 
     pass = ossl_pem_passwd_value(pass);
@@ -113,12 +120,12 @@ ossl_rsa_initialize(int argc, VALUE *argv, VALUE self)
     pkey = ossl_pkey_read_generic(in, pass);
     BIO_free(in);
     if (!pkey)
-        ossl_raise(eRSAError, "Neither PUB key nor PRIV key");
+        ossl_raise(ePKeyError, "Neither PUB key nor PRIV key");
 
     type = EVP_PKEY_base_id(pkey);
     if (type != EVP_PKEY_RSA) {
         EVP_PKEY_free(pkey);
-        rb_raise(eRSAError, "incorrect pkey type: %s", OBJ_nid2sn(type));
+        rb_raise(ePKeyError, "incorrect pkey type: %s", OBJ_nid2sn(type));
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
@@ -129,13 +136,14 @@ ossl_rsa_initialize(int argc, VALUE *argv, VALUE self)
     if (!pkey || EVP_PKEY_assign_RSA(pkey, rsa) != 1) {
         EVP_PKEY_free(pkey);
         RSA_free(rsa);
-        ossl_raise(eRSAError, "EVP_PKEY_assign_RSA");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_RSA");
     }
     RTYPEDDATA_DATA(self) = pkey;
     return self;
 }
 
 #ifndef HAVE_EVP_PKEY_DUP
+/* :nodoc: */
 static VALUE
 ossl_rsa_initialize_copy(VALUE self, VALUE other)
 {
@@ -151,12 +159,12 @@ ossl_rsa_initialize_copy(VALUE self, VALUE other)
                               (d2i_of_void *)d2i_RSAPrivateKey,
                               (char *)rsa);
     if (!rsa_new)
-	ossl_raise(eRSAError, "ASN1_dup");
+        ossl_raise(ePKeyError, "ASN1_dup");
 
     pkey = EVP_PKEY_new();
     if (!pkey || EVP_PKEY_assign_RSA(pkey, rsa_new) != 1) {
         RSA_free(rsa_new);
-        ossl_raise(eRSAError, "EVP_PKEY_assign_RSA");
+        ossl_raise(ePKeyError, "EVP_PKEY_assign_RSA");
     }
     RTYPEDDATA_DATA(self) = pkey;
 
@@ -311,7 +319,7 @@ ossl_rsa_to_der(VALUE self)
  * Signs _data_ using the Probabilistic Signature Scheme (RSA-PSS) and returns
  * the calculated signature.
  *
- * RSAError will be raised if an error occurs.
+ * PKeyError will be raised if an error occurs.
  *
  * See #verify_pss for the verification operation.
  *
@@ -340,7 +348,7 @@ ossl_rsa_to_der(VALUE self)
 static VALUE
 ossl_rsa_sign_pss(int argc, VALUE *argv, VALUE self)
 {
-    VALUE digest, data, options, kwargs[2], signature;
+    VALUE digest, data, options, kwargs[2], signature, mgf1md_holder, md_holder;
     static ID kwargs_ids[2];
     EVP_PKEY *pkey;
     EVP_PKEY_CTX *pkey_ctx;
@@ -350,46 +358,46 @@ ossl_rsa_sign_pss(int argc, VALUE *argv, VALUE self)
     int salt_len;
 
     if (!kwargs_ids[0]) {
-	kwargs_ids[0] = rb_intern_const("salt_length");
-	kwargs_ids[1] = rb_intern_const("mgf1_hash");
+        kwargs_ids[0] = rb_intern_const("salt_length");
+        kwargs_ids[1] = rb_intern_const("mgf1_hash");
     }
     rb_scan_args(argc, argv, "2:", &digest, &data, &options);
     rb_get_kwargs(options, kwargs_ids, 2, 0, kwargs);
     if (kwargs[0] == ID2SYM(rb_intern("max")))
-	salt_len = -2; /* RSA_PSS_SALTLEN_MAX_SIGN */
+        salt_len = -2; /* RSA_PSS_SALTLEN_MAX_SIGN */
     else if (kwargs[0] == ID2SYM(rb_intern("digest")))
-	salt_len = -1; /* RSA_PSS_SALTLEN_DIGEST */
+        salt_len = -1; /* RSA_PSS_SALTLEN_DIGEST */
     else
-	salt_len = NUM2INT(kwargs[0]);
-    mgf1md = ossl_evp_get_digestbyname(kwargs[1]);
+        salt_len = NUM2INT(kwargs[0]);
+    mgf1md = ossl_evp_md_fetch(kwargs[1], &mgf1md_holder);
 
     pkey = GetPrivPKeyPtr(self);
     buf_len = EVP_PKEY_size(pkey);
-    md = ossl_evp_get_digestbyname(digest);
+    md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(data);
     signature = rb_str_new(NULL, (long)buf_len);
 
     md_ctx = EVP_MD_CTX_new();
     if (!md_ctx)
-	goto err;
+        goto err;
 
     if (EVP_DigestSignInit(md_ctx, &pkey_ctx, md, NULL, pkey) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_padding(pkey_ctx, RSA_PKCS1_PSS_PADDING) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_pss_saltlen(pkey_ctx, salt_len) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_mgf1_md(pkey_ctx, mgf1md) != 1)
-	goto err;
+        goto err;
 
     if (EVP_DigestSignUpdate(md_ctx, RSTRING_PTR(data), RSTRING_LEN(data)) != 1)
-	goto err;
+        goto err;
 
     if (EVP_DigestSignFinal(md_ctx, (unsigned char *)RSTRING_PTR(signature), &buf_len) != 1)
-	goto err;
+        goto err;
 
     rb_str_set_len(signature, (long)buf_len);
 
@@ -398,7 +406,7 @@ ossl_rsa_sign_pss(int argc, VALUE *argv, VALUE self)
 
   err:
     EVP_MD_CTX_free(md_ctx);
-    ossl_raise(eRSAError, NULL);
+    ossl_raise(ePKeyError, NULL);
 }
 
 /*
@@ -408,7 +416,7 @@ ossl_rsa_sign_pss(int argc, VALUE *argv, VALUE self)
  * Verifies _data_ using the Probabilistic Signature Scheme (RSA-PSS).
  *
  * The return value is +true+ if the signature is valid, +false+ otherwise.
- * RSAError will be raised if an error occurs.
+ * PKeyError will be raised if an error occurs.
  *
  * See #sign_pss for the signing operation and an example code.
  *
@@ -427,7 +435,7 @@ ossl_rsa_sign_pss(int argc, VALUE *argv, VALUE self)
 static VALUE
 ossl_rsa_verify_pss(int argc, VALUE *argv, VALUE self)
 {
-    VALUE digest, signature, data, options, kwargs[2];
+    VALUE digest, signature, data, options, kwargs[2], mgf1md_holder, md_holder;
     static ID kwargs_ids[2];
     EVP_PKEY *pkey;
     EVP_PKEY_CTX *pkey_ctx;
@@ -436,98 +444,61 @@ ossl_rsa_verify_pss(int argc, VALUE *argv, VALUE self)
     int result, salt_len;
 
     if (!kwargs_ids[0]) {
-	kwargs_ids[0] = rb_intern_const("salt_length");
-	kwargs_ids[1] = rb_intern_const("mgf1_hash");
+        kwargs_ids[0] = rb_intern_const("salt_length");
+        kwargs_ids[1] = rb_intern_const("mgf1_hash");
     }
     rb_scan_args(argc, argv, "3:", &digest, &signature, &data, &options);
     rb_get_kwargs(options, kwargs_ids, 2, 0, kwargs);
     if (kwargs[0] == ID2SYM(rb_intern("auto")))
-	salt_len = -2; /* RSA_PSS_SALTLEN_AUTO */
+        salt_len = -2; /* RSA_PSS_SALTLEN_AUTO */
     else if (kwargs[0] == ID2SYM(rb_intern("digest")))
-	salt_len = -1; /* RSA_PSS_SALTLEN_DIGEST */
+        salt_len = -1; /* RSA_PSS_SALTLEN_DIGEST */
     else
-	salt_len = NUM2INT(kwargs[0]);
-    mgf1md = ossl_evp_get_digestbyname(kwargs[1]);
+        salt_len = NUM2INT(kwargs[0]);
+    mgf1md = ossl_evp_md_fetch(kwargs[1], &mgf1md_holder);
 
     GetPKey(self, pkey);
-    md = ossl_evp_get_digestbyname(digest);
+    md = ossl_evp_md_fetch(digest, &md_holder);
     StringValue(signature);
     StringValue(data);
 
     md_ctx = EVP_MD_CTX_new();
     if (!md_ctx)
-	goto err;
+        goto err;
 
     if (EVP_DigestVerifyInit(md_ctx, &pkey_ctx, md, NULL, pkey) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_padding(pkey_ctx, RSA_PKCS1_PSS_PADDING) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_pss_saltlen(pkey_ctx, salt_len) != 1)
-	goto err;
+        goto err;
 
     if (EVP_PKEY_CTX_set_rsa_mgf1_md(pkey_ctx, mgf1md) != 1)
-	goto err;
+        goto err;
 
     if (EVP_DigestVerifyUpdate(md_ctx, RSTRING_PTR(data), RSTRING_LEN(data)) != 1)
-	goto err;
+        goto err;
 
     result = EVP_DigestVerifyFinal(md_ctx,
-				   (unsigned char *)RSTRING_PTR(signature),
-				   RSTRING_LEN(signature));
+                                   (unsigned char *)RSTRING_PTR(signature),
+                                   RSTRING_LEN(signature));
+    EVP_MD_CTX_free(md_ctx);
 
     switch (result) {
       case 0:
-	ossl_clear_error();
-	EVP_MD_CTX_free(md_ctx);
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
       case 1:
-	EVP_MD_CTX_free(md_ctx);
-	return Qtrue;
+        return Qtrue;
       default:
-	goto err;
+        ossl_raise(ePKeyError, "EVP_DigestVerifyFinal");
     }
 
   err:
     EVP_MD_CTX_free(md_ctx);
-    ossl_raise(eRSAError, NULL);
-}
-
-/*
- * call-seq:
- *   rsa.params => hash
- *
- * THIS METHOD IS INSECURE, PRIVATE INFORMATION CAN LEAK OUT!!!
- *
- * Stores all parameters of key to the hash.  The hash has keys 'n', 'e', 'd',
- * 'p', 'q', 'dmp1', 'dmq1', 'iqmp'.
- *
- * Don't use :-)) (It's up to you)
- */
-static VALUE
-ossl_rsa_get_params(VALUE self)
-{
-    OSSL_3_const RSA *rsa;
-    VALUE hash;
-    const BIGNUM *n, *e, *d, *p, *q, *dmp1, *dmq1, *iqmp;
-
-    GetRSA(self, rsa);
-    RSA_get0_key(rsa, &n, &e, &d);
-    RSA_get0_factors(rsa, &p, &q);
-    RSA_get0_crt_params(rsa, &dmp1, &dmq1, &iqmp);
-
-    hash = rb_hash_new();
-    rb_hash_aset(hash, rb_str_new2("n"), ossl_bn_new(n));
-    rb_hash_aset(hash, rb_str_new2("e"), ossl_bn_new(e));
-    rb_hash_aset(hash, rb_str_new2("d"), ossl_bn_new(d));
-    rb_hash_aset(hash, rb_str_new2("p"), ossl_bn_new(p));
-    rb_hash_aset(hash, rb_str_new2("q"), ossl_bn_new(q));
-    rb_hash_aset(hash, rb_str_new2("dmp1"), ossl_bn_new(dmp1));
-    rb_hash_aset(hash, rb_str_new2("dmq1"), ossl_bn_new(dmq1));
-    rb_hash_aset(hash, rb_str_new2("iqmp"), ossl_bn_new(iqmp));
-
-    return hash;
+    ossl_raise(ePKeyError, NULL);
 }
 
 /*
@@ -565,20 +536,6 @@ OSSL_PKEY_BN_DEF3(rsa, RSA, crt_params, dmp1, dmq1, iqmp)
 void
 Init_ossl_rsa(void)
 {
-#if 0
-    mPKey = rb_define_module_under(mOSSL, "PKey");
-    cPKey = rb_define_class_under(mPKey, "PKey", rb_cObject);
-    ePKeyError = rb_define_class_under(mPKey, "PKeyError", eOSSLError);
-#endif
-
-    /* Document-class: OpenSSL::PKey::RSAError
-     *
-     * Generic exception that is raised if an operation on an RSA PKey
-     * fails unexpectedly or in case an instantiation of an instance of RSA
-     * fails due to non-conformant input data.
-     */
-    eRSAError = rb_define_class_under(mPKey, "RSAError", ePKeyError);
-
     /* Document-class: OpenSSL::PKey::RSA
      *
      * RSA is an asymmetric public key algorithm that has been formalized in
@@ -617,8 +574,6 @@ Init_ossl_rsa(void)
     rb_define_method(cRSA, "set_factors", ossl_rsa_set_factors, 2);
     rb_define_method(cRSA, "set_crt_params", ossl_rsa_set_crt_params, 3);
 
-    rb_define_method(cRSA, "params", ossl_rsa_get_params, 0);
-
 /*
  * TODO: Test it
     rb_define_method(cRSA, "blinding_on!", ossl_rsa_blinding_on, 0);
diff --git a/ext/openssl/ossl_provider.c b/ext/openssl/ossl_provider.c
index 981c6ccdc7..ea5abb8e48 100644
--- a/ext/openssl/ossl_provider.c
+++ b/ext/openssl/ossl_provider.c
@@ -1,12 +1,10 @@
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
 #ifdef OSSL_USE_PROVIDER
-# include <openssl/provider.h>
-
 #define NewProvider(klass) \
     TypedData_Wrap_Struct((klass), &ossl_provider_type, 0)
 #define SetProvider(obj, provider) do { \
@@ -187,11 +185,6 @@ ossl_provider_inspect(VALUE self)
 void
 Init_ossl_provider(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     cProvider = rb_define_class_under(mOSSL, "Provider", rb_cObject);
     eProviderError = rb_define_class_under(cProvider, "ProviderError", eOSSLError);
 
diff --git a/ext/openssl/ossl_rand.c b/ext/openssl/ossl_rand.c
index 659dc818b6..753f8b25f7 100644
--- a/ext/openssl/ossl_rand.c
+++ b/ext/openssl/ossl_rand.c
@@ -5,12 +5,12 @@
  * All rights reserved.
  *
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
-VALUE mRandom;
-VALUE eRandomError;
+static VALUE mRandom;
+static VALUE eRandomError;
 
 /*
  *  call-seq:
@@ -68,7 +68,7 @@ static VALUE
 ossl_rand_load_file(VALUE self, VALUE filename)
 {
     if(!RAND_load_file(StringValueCStr(filename), -1)) {
-	ossl_raise(eRandomError, NULL);
+        ossl_raise(eRandomError, NULL);
     }
     return Qtrue;
 }
@@ -85,14 +85,14 @@ static VALUE
 ossl_rand_write_file(VALUE self, VALUE filename)
 {
     if (RAND_write_file(StringValueCStr(filename)) == -1) {
-	ossl_raise(eRandomError, NULL);
+        ossl_raise(eRandomError, NULL);
     }
     return Qtrue;
 }
 
 /*
  *  call-seq:
- *	random_bytes(length) -> string
+ *      random_bytes(length) -> string
  *
  * Generates a String with _length_ number of cryptographically strong
  * pseudo-random bytes.
@@ -112,9 +112,9 @@ ossl_rand_bytes(VALUE self, VALUE len)
     str = rb_str_new(0, n);
     ret = RAND_bytes((unsigned char *)RSTRING_PTR(str), n);
     if (ret == 0) {
-	ossl_raise(eRandomError, "RAND_bytes");
+        ossl_raise(eRandomError, "RAND_bytes");
     } else if (ret == -1) {
-	ossl_raise(eRandomError, "RAND_bytes is not supported");
+        ossl_raise(eRandomError, "RAND_bytes is not supported");
     }
 
     return str;
@@ -131,7 +131,7 @@ static VALUE
 ossl_rand_egd(VALUE self, VALUE filename)
 {
     if (RAND_egd(StringValueCStr(filename)) == -1) {
-	ossl_raise(eRandomError, NULL);
+        ossl_raise(eRandomError, NULL);
     }
     return Qtrue;
 }
@@ -151,7 +151,7 @@ ossl_rand_egd_bytes(VALUE self, VALUE filename, VALUE len)
     int n = NUM2INT(len);
 
     if (RAND_egd_bytes(StringValueCStr(filename), n) == -1) {
-	ossl_raise(eRandomError, NULL);
+        ossl_raise(eRandomError, NULL);
     }
     return Qtrue;
 }
@@ -175,11 +175,6 @@ ossl_rand_status(VALUE self)
 void
 Init_ossl_rand(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
-
     mRandom = rb_define_module_under(mOSSL, "Random");
 
     eRandomError = rb_define_class_under(mRandom, "RandomError", eOSSLError);
@@ -189,9 +184,7 @@ Init_ossl_rand(void)
     rb_define_module_function(mRandom, "load_random_file", ossl_rand_load_file, 1);
     rb_define_module_function(mRandom, "write_random_file", ossl_rand_write_file, 1);
     rb_define_module_function(mRandom, "random_bytes", ossl_rand_bytes, 1);
-#if OPENSSL_VERSION_NUMBER < 0x10101000 || defined(LIBRESSL_VERSION_NUMBER)
     rb_define_alias(rb_singleton_class(mRandom), "pseudo_bytes", "random_bytes");
-#endif
 #ifdef HAVE_RAND_EGD
     rb_define_module_function(mRandom, "egd", ossl_rand_egd, 1);
     rb_define_module_function(mRandom, "egd_bytes", ossl_rand_egd_bytes, 2);
diff --git a/ext/openssl/ossl_rand.h b/ext/openssl/ossl_rand.h
index 8f77a3b239..294986d017 100644
--- a/ext/openssl/ossl_rand.h
+++ b/ext/openssl/ossl_rand.h
@@ -5,14 +5,11 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_RAND_H_)
 #define _OSSL_RAND_H_
 
-extern VALUE mRandom;
-extern VALUE eRandomError;
-
 void Init_ossl_rand(void);
 
 #endif /* _OSSL_RAND_H_ */
diff --git a/ext/openssl/ossl_ssl.c b/ext/openssl/ossl_ssl.c
index d68c64d5fb..3d913a3968 100644
--- a/ext/openssl/ossl_ssl.c
+++ b/ext/openssl/ossl_ssl.c
@@ -7,7 +7,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -18,11 +18,6 @@
 # define OSSL_USE_NEXTPROTONEG
 #endif
 
-#if !defined(TLS1_3_VERSION) && \
-    OSSL_LIBRESSL_PREREQ(3, 2, 0) && !OSSL_LIBRESSL_PREREQ(3, 4, 0)
-#  define TLS1_3_VERSION 0x0304
-#endif
-
 #ifdef _WIN32
 #  define TO_SOCKET(s) _get_osfhandle(s)
 #else
@@ -30,32 +25,30 @@
 #endif
 
 #define GetSSLCTX(obj, ctx) do { \
-	TypedData_Get_Struct((obj), SSL_CTX, &ossl_sslctx_type, (ctx));	\
+    TypedData_Get_Struct((obj), SSL_CTX, &ossl_sslctx_type, (ctx)); \
 } while (0)
 
 VALUE mSSL;
 static VALUE eSSLError;
-VALUE cSSLContext;
+static VALUE cSSLContext;
 VALUE cSSLSocket;
 
 static VALUE eSSLErrorWaitReadable;
 static VALUE eSSLErrorWaitWritable;
 
-static ID id_call, ID_callback_state, id_tmp_dh_callback,
-	  id_npn_protocols_encoded, id_each;
+static ID id_call, ID_callback_state, id_npn_protocols_encoded, id_each;
 static VALUE sym_exception, sym_wait_readable, sym_wait_writable;
 
 static ID id_i_cert_store, id_i_ca_file, id_i_ca_path, id_i_verify_mode,
-	  id_i_verify_depth, id_i_verify_callback, id_i_client_ca,
-	  id_i_renegotiation_cb, id_i_cert, id_i_key, id_i_extra_chain_cert,
-	  id_i_client_cert_cb, id_i_timeout,
-	  id_i_session_id_context, id_i_session_get_cb, id_i_session_new_cb,
-	  id_i_session_remove_cb, id_i_npn_select_cb, id_i_npn_protocols,
-	  id_i_alpn_select_cb, id_i_alpn_protocols, id_i_servername_cb,
-	  id_i_verify_hostname, id_i_keylog_cb;
-static ID id_i_io, id_i_context, id_i_hostname;
-
-static int ossl_ssl_ex_vcb_idx;
+          id_i_verify_depth, id_i_verify_callback, id_i_client_ca,
+          id_i_renegotiation_cb, id_i_cert, id_i_key, id_i_extra_chain_cert,
+          id_i_client_cert_cb, id_i_timeout,
+          id_i_session_id_context, id_i_session_get_cb, id_i_session_new_cb,
+          id_i_session_remove_cb, id_i_npn_select_cb, id_i_npn_protocols,
+          id_i_alpn_select_cb, id_i_alpn_protocols, id_i_servername_cb,
+          id_i_verify_hostname, id_i_keylog_cb, id_i_tmp_dh_callback;
+static ID id_i_io, id_i_context, id_i_hostname, id_i_sync_close;
+
 static int ossl_ssl_ex_ptr_idx;
 static int ossl_sslctx_ex_ptr_idx;
 
@@ -85,127 +78,25 @@ ossl_sslctx_s_alloc(VALUE klass)
 {
     SSL_CTX *ctx;
     long mode = 0 |
-	SSL_MODE_ENABLE_PARTIAL_WRITE |
-	SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER |
-	SSL_MODE_RELEASE_BUFFERS;
+        SSL_MODE_ENABLE_PARTIAL_WRITE |
+        SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER |
+        SSL_MODE_RELEASE_BUFFERS;
     VALUE obj;
 
     obj = TypedData_Wrap_Struct(klass, &ossl_sslctx_type, 0);
-#if OPENSSL_VERSION_NUMBER >= 0x10100000 || defined(LIBRESSL_VERSION_NUMBER)
     ctx = SSL_CTX_new(TLS_method());
-#else
-    ctx = SSL_CTX_new(SSLv23_method());
-#endif
     if (!ctx) {
         ossl_raise(eSSLError, "SSL_CTX_new");
     }
     SSL_CTX_set_mode(ctx, mode);
+    SSL_CTX_set_dh_auto(ctx, 1);
     RTYPEDDATA_DATA(obj) = ctx;
-    SSL_CTX_set_ex_data(ctx, ossl_sslctx_ex_ptr_idx, (void *)obj);
-
-#if !defined(OPENSSL_NO_EC) && OPENSSL_VERSION_NUMBER < 0x10100000 && \
-    !defined(LIBRESSL_VERSION_NUMBER)
-    /* We use SSL_CTX_set1_curves_list() to specify the curve used in ECDH. It
-     * allows to specify multiple curve names and OpenSSL will select
-     * automatically from them. In OpenSSL 1.0.2, the automatic selection has to
-     * be enabled explicitly. OpenSSL 1.1.0 and LibreSSL 2.6.1 removed the knob
-     * and it is always enabled. To uniform the behavior, we enable the
-     * automatic selection also in 1.0.2. Users can still disable ECDH by
-     * removing ECDH cipher suites by SSLContext#ciphers=. */
-    if (!SSL_CTX_set_ecdh_auto(ctx, 1))
-	ossl_raise(eSSLError, "SSL_CTX_set_ecdh_auto");
-#endif
+    if (!SSL_CTX_set_ex_data(ctx, ossl_sslctx_ex_ptr_idx, (void *)obj))
+        ossl_raise(eSSLError, "SSL_CTX_set_ex_data");
 
     return obj;
 }
 
-static int
-parse_proto_version(VALUE str)
-{
-    int i;
-    static const struct {
-	const char *name;
-	int version;
-    } map[] = {
-	{ "SSL2", SSL2_VERSION },
-	{ "SSL3", SSL3_VERSION },
-	{ "TLS1", TLS1_VERSION },
-	{ "TLS1_1", TLS1_1_VERSION },
-	{ "TLS1_2", TLS1_2_VERSION },
-#ifdef TLS1_3_VERSION
-	{ "TLS1_3", TLS1_3_VERSION },
-#endif
-    };
-
-    if (NIL_P(str))
-	return 0;
-    if (RB_INTEGER_TYPE_P(str))
-	return NUM2INT(str);
-
-    if (SYMBOL_P(str))
-	str = rb_sym2str(str);
-    StringValue(str);
-    for (i = 0; i < numberof(map); i++)
-	if (!strncmp(map[i].name, RSTRING_PTR(str), RSTRING_LEN(str)))
-	    return map[i].version;
-    rb_raise(rb_eArgError, "unrecognized version %+"PRIsVALUE, str);
-}
-
-/*
- * call-seq:
- *    ctx.set_minmax_proto_version(min, max) -> nil
- *
- * Sets the minimum and maximum supported protocol versions. See #min_version=
- * and #max_version=.
- */
-static VALUE
-ossl_sslctx_set_minmax_proto_version(VALUE self, VALUE min_v, VALUE max_v)
-{
-    SSL_CTX *ctx;
-    int min, max;
-
-    GetSSLCTX(self, ctx);
-    min = parse_proto_version(min_v);
-    max = parse_proto_version(max_v);
-
-#ifdef HAVE_SSL_CTX_SET_MIN_PROTO_VERSION
-    if (!SSL_CTX_set_min_proto_version(ctx, min))
-	ossl_raise(eSSLError, "SSL_CTX_set_min_proto_version");
-    if (!SSL_CTX_set_max_proto_version(ctx, max))
-	ossl_raise(eSSLError, "SSL_CTX_set_max_proto_version");
-#else
-    {
-	unsigned long sum = 0, opts = 0;
-	int i;
-	static const struct {
-	    int ver;
-	    unsigned long opts;
-	} options_map[] = {
-	    { SSL2_VERSION, SSL_OP_NO_SSLv2 },
-	    { SSL3_VERSION, SSL_OP_NO_SSLv3 },
-	    { TLS1_VERSION, SSL_OP_NO_TLSv1 },
-	    { TLS1_1_VERSION, SSL_OP_NO_TLSv1_1 },
-	    { TLS1_2_VERSION, SSL_OP_NO_TLSv1_2 },
-# if defined(TLS1_3_VERSION)
-	    { TLS1_3_VERSION, SSL_OP_NO_TLSv1_3 },
-# endif
-	};
-
-	for (i = 0; i < numberof(options_map); i++) {
-	    sum |= options_map[i].opts;
-            if ((min && min > options_map[i].ver) ||
-                (max && max < options_map[i].ver)) {
-		opts |= options_map[i].opts;
-            }
-	}
-	SSL_CTX_clear_options(ctx, sum);
-	SSL_CTX_set_options(ctx, opts);
-    }
-#endif
-
-    return Qnil;
-}
-
 static VALUE
 ossl_call_client_cert_cb(VALUE obj)
 {
@@ -214,7 +105,7 @@ ossl_call_client_cert_cb(VALUE obj)
     ctx_obj = rb_attr_get(obj, id_i_context);
     cb = rb_attr_get(ctx_obj, id_i_client_cert_cb);
     if (NIL_P(cb))
-	return Qnil;
+        return Qnil;
 
     ary = rb_funcallv(cb, id_call, 1, &obj);
     Check_Type(ary, T_ARRAY);
@@ -232,7 +123,7 @@ ossl_client_cert_cb(SSL *ssl, X509 **x509, EVP_PKEY **pkey)
     obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
     ret = rb_protect(ossl_call_client_cert_cb, obj, NULL);
     if (NIL_P(ret))
-	return 0;
+        return 0;
 
     *x509 = DupX509CertPtr(RARRAY_AREF(ret, 0));
     *pkey = DupPKeyPtr(RARRAY_AREF(ret, 1));
@@ -243,8 +134,6 @@ ossl_client_cert_cb(SSL *ssl, X509 **x509, EVP_PKEY **pkey)
 #if !defined(OPENSSL_NO_DH)
 struct tmp_dh_callback_args {
     VALUE ssl_obj;
-    ID id;
-    int type;
     int is_export;
     int keylength;
 };
@@ -253,48 +142,36 @@ static VALUE
 ossl_call_tmp_dh_callback(VALUE arg)
 {
     struct tmp_dh_callback_args *args = (struct tmp_dh_callback_args *)arg;
-    VALUE cb, dh;
-    EVP_PKEY *pkey;
+    VALUE ctx_obj, cb, obj;
+    const DH *dh;
 
-    cb = rb_funcall(args->ssl_obj, args->id, 0);
+    ctx_obj = rb_attr_get(args->ssl_obj, id_i_context);
+    cb = rb_attr_get(ctx_obj, id_i_tmp_dh_callback);
     if (NIL_P(cb))
-	return (VALUE)NULL;
-    dh = rb_funcall(cb, id_call, 3, args->ssl_obj, INT2NUM(args->is_export),
-		    INT2NUM(args->keylength));
-    pkey = GetPKeyPtr(dh);
-    if (EVP_PKEY_base_id(pkey) != args->type)
-	return (VALUE)NULL;
+        return (VALUE)NULL;
 
-    return (VALUE)pkey;
+    obj = rb_funcall(cb, id_call, 3, args->ssl_obj, INT2NUM(args->is_export),
+                     INT2NUM(args->keylength));
+    // TODO: We should riase if obj is not DH
+    dh = EVP_PKEY_get0_DH(GetPKeyPtr(obj));
+    if (!dh)
+        ossl_clear_error();
+
+    return (VALUE)dh;
 }
-#endif
 
-#if !defined(OPENSSL_NO_DH)
 static DH *
 ossl_tmp_dh_callback(SSL *ssl, int is_export, int keylength)
 {
-    VALUE rb_ssl;
-    EVP_PKEY *pkey;
-    struct tmp_dh_callback_args args;
     int state;
-
-    rb_ssl = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
-    args.ssl_obj = rb_ssl;
-    args.id = id_tmp_dh_callback;
-    args.is_export = is_export;
-    args.keylength = keylength;
-    args.type = EVP_PKEY_DH;
-
-    pkey = (EVP_PKEY *)rb_protect(ossl_call_tmp_dh_callback,
-				  (VALUE)&args, &state);
+    VALUE rb_ssl = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
+    struct tmp_dh_callback_args args = {rb_ssl, is_export, keylength};
+    VALUE ret = rb_protect(ossl_call_tmp_dh_callback, (VALUE)&args, &state);
     if (state) {
-	rb_ivar_set(rb_ssl, ID_callback_state, INT2NUM(state));
-	return NULL;
+        rb_ivar_set(rb_ssl, ID_callback_state, INT2NUM(state));
+        return NULL;
     }
-    if (!pkey)
-	return NULL;
-
-    return (DH *)EVP_PKEY_get0_DH(pkey);
+    return (DH *)ret;
 }
 #endif /* OPENSSL_NO_DH */
 
@@ -310,13 +187,13 @@ call_verify_certificate_identity(VALUE ctx_v)
     hostname = rb_attr_get(ssl_obj, id_i_hostname);
 
     if (!RTEST(hostname)) {
-	rb_warning("verify_hostname requires hostname to be set");
-	return Qtrue;
+        rb_warning("verify_hostname requires hostname to be set");
+        return Qtrue;
     }
 
     cert_obj = ossl_x509_new(X509_STORE_CTX_get_current_cert(ctx));
     return rb_funcall(mSSL, rb_intern("verify_certificate_identity"), 2,
-		      cert_obj, hostname);
+                      cert_obj, hostname);
 }
 
 static int
@@ -327,25 +204,21 @@ ossl_ssl_verify_callback(int preverify_ok, X509_STORE_CTX *ctx)
     int status;
 
     ssl = X509_STORE_CTX_get_ex_data(ctx, SSL_get_ex_data_X509_STORE_CTX_idx());
-    cb = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_vcb_idx);
     ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
     sslctx_obj = rb_attr_get(ssl_obj, id_i_context);
+    cb = rb_attr_get(sslctx_obj, id_i_verify_callback);
     verify_hostname = rb_attr_get(sslctx_obj, id_i_verify_hostname);
 
     if (preverify_ok && RTEST(verify_hostname) && !SSL_is_server(ssl) &&
-	!X509_STORE_CTX_get_error_depth(ctx)) {
-	ret = rb_protect(call_verify_certificate_identity, (VALUE)ctx, &status);
-	if (status) {
-	    rb_ivar_set(ssl_obj, ID_callback_state, INT2NUM(status));
-	    return 0;
-	}
+        !X509_STORE_CTX_get_error_depth(ctx)) {
+        ret = rb_protect(call_verify_certificate_identity, (VALUE)ctx, &status);
+        if (status) {
+            rb_ivar_set(ssl_obj, ID_callback_state, INT2NUM(status));
+            return 0;
+        }
         if (ret != Qtrue) {
             preverify_ok = 0;
-#if defined(X509_V_ERR_HOSTNAME_MISMATCH)
             X509_STORE_CTX_set_error(ctx, X509_V_ERR_HOSTNAME_MISMATCH);
-#else
-            X509_STORE_CTX_set_error(ctx, X509_V_ERR_CERT_REJECTED);
-#endif
         }
     }
 
@@ -367,11 +240,7 @@ ossl_call_session_get_cb(VALUE ary)
 }
 
 static SSL_SESSION *
-#if defined(LIBRESSL_VERSION_NUMBER) || OPENSSL_VERSION_NUMBER >= 0x10100000
 ossl_sslctx_session_get_cb(SSL *ssl, const unsigned char *buf, int len, int *copy)
-#else
-ossl_sslctx_session_get_cb(SSL *ssl, unsigned char *buf, int len, int *copy)
-#endif
 {
     VALUE ary, ssl_obj, ret_obj;
     SSL_SESSION *sess;
@@ -444,7 +313,7 @@ ossl_sslctx_session_new_cb(SSL *ssl, SSL_SESSION *sess)
     return 0;
 }
 
-#if OPENSSL_VERSION_NUMBER >= 0x10101000 && !defined(LIBRESSL_VERSION_NUMBER)
+#if !OSSL_IS_LIBRESSL
 /*
  * It is only compatible with OpenSSL >= 1.1.1. Even if LibreSSL implements
  * SSL_CTX_set_keylog_callback() from v3.4.2, it does nothing (see
@@ -517,7 +386,7 @@ ossl_sslctx_session_remove_cb(SSL_CTX *ctx, SSL_SESSION *sess)
      * when SSL_CTX_free() is called.
      */
     if (rb_during_gc())
-	return;
+        return;
 
     OSSL_Debug("SSL SESSION remove callback entered");
 
@@ -548,8 +417,9 @@ ossl_sslctx_add_extra_chain_cert_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, arg))
 
     GetSSLCTX(arg, ctx);
     x509 = DupX509CertPtr(i);
-    if(!SSL_CTX_add_extra_chain_cert(ctx, x509)){
-	ossl_raise(eSSLError, NULL);
+    if (!SSL_CTX_add_extra_chain_cert(ctx, x509)) {
+        X509_free(x509);
+        ossl_raise(eSSLError, "SSL_CTX_add_extra_chain_cert");
     }
 
     return i;
@@ -558,52 +428,42 @@ ossl_sslctx_add_extra_chain_cert_i(RB_BLOCK_CALL_FUNC_ARGLIST(i, arg))
 static VALUE ossl_sslctx_setup(VALUE self);
 
 static VALUE
-ossl_call_servername_cb(VALUE ary)
+ossl_call_servername_cb(VALUE arg)
 {
-    VALUE ssl_obj, sslctx_obj, cb, ret_obj;
-
-    Check_Type(ary, T_ARRAY);
-    ssl_obj = rb_ary_entry(ary, 0);
+    SSL *ssl = (void *)arg;
+    const char *servername = SSL_get_servername(ssl, TLSEXT_NAMETYPE_host_name);
+    if (!servername)
+        return Qnil;
 
-    sslctx_obj = rb_attr_get(ssl_obj, id_i_context);
-    cb = rb_attr_get(sslctx_obj, id_i_servername_cb);
-    if (NIL_P(cb)) return Qnil;
+    VALUE ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
+    VALUE sslctx_obj = rb_attr_get(ssl_obj, id_i_context);
+    VALUE cb = rb_attr_get(sslctx_obj, id_i_servername_cb);
+    VALUE ary = rb_assoc_new(ssl_obj, rb_str_new_cstr(servername));
 
-    ret_obj = rb_funcallv(cb, id_call, 1, &ary);
+    VALUE ret_obj = rb_funcallv(cb, id_call, 1, &ary);
     if (rb_obj_is_kind_of(ret_obj, cSSLContext)) {
-        SSL *ssl;
         SSL_CTX *ctx2;
-
         ossl_sslctx_setup(ret_obj);
-        GetSSL(ssl_obj, ssl);
         GetSSLCTX(ret_obj, ctx2);
-        SSL_set_SSL_CTX(ssl, ctx2);
+        if (!SSL_set_SSL_CTX(ssl, ctx2))
+            ossl_raise(eSSLError, "SSL_set_SSL_CTX");
         rb_ivar_set(ssl_obj, id_i_context, ret_obj);
     } else if (!NIL_P(ret_obj)) {
-	ossl_raise(rb_eArgError, "servername_cb must return an "
-		   "OpenSSL::SSL::SSLContext object or nil");
+        ossl_raise(rb_eArgError, "servername_cb must return an "
+                   "OpenSSL::SSL::SSLContext object or nil");
     }
 
-    return ret_obj;
+    return Qnil;
 }
 
 static int
 ssl_servername_cb(SSL *ssl, int *ad, void *arg)
 {
-    VALUE ary, ssl_obj;
-    int state = 0;
-    const char *servername = SSL_get_servername(ssl, TLSEXT_NAMETYPE_host_name);
-
-    if (!servername)
-        return SSL_TLSEXT_ERR_OK;
-
-    ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
-    ary = rb_ary_new2(2);
-    rb_ary_push(ary, ssl_obj);
-    rb_ary_push(ary, rb_str_new2(servername));
+    int state;
 
-    rb_protect(ossl_call_servername_cb, ary, &state);
+    rb_protect(ossl_call_servername_cb, (VALUE)ssl, &state);
     if (state) {
+        VALUE ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
         rb_ivar_set(ssl_obj, ID_callback_state, INT2NUM(state));
         return SSL_TLSEXT_ERR_ALERT_FATAL;
     }
@@ -630,7 +490,7 @@ ssl_npn_encode_protocol_i(RB_BLOCK_CALL_FUNC_ARGLIST(cur, encoded))
     int len = RSTRING_LENINT(cur);
     char len_byte;
     if (len < 1 || len > 255)
-	ossl_raise(eSSLError, "Advertised protocol must have length 1..255");
+        ossl_raise(eSSLError, "Advertised protocol must have length 1..255");
     /* Encode the length byte */
     len_byte = len;
     rb_str_buf_cat(encoded, &len_byte, 1);
@@ -664,16 +524,16 @@ npn_select_cb_common_i(VALUE tmp)
     /* assume OpenSSL verifies this format */
     /* The format is len_1|proto_1|...|len_n|proto_n */
     while (in < in_end) {
-	l = *in++;
-	rb_ary_push(protocols, rb_str_new((const char *)in, l));
-	in += l;
+        l = *in++;
+        rb_ary_push(protocols, rb_str_new((const char *)in, l));
+        in += l;
     }
 
     selected = rb_funcallv(args->cb, id_call, 1, &protocols);
     StringValue(selected);
     len = RSTRING_LEN(selected);
     if (len < 1 || len >= 256) {
-	ossl_raise(eSSLError, "Selected protocol name must have length 1..255");
+        ossl_raise(eSSLError, "Selected protocol name must have length 1..255");
     }
 
     return selected;
@@ -681,8 +541,8 @@ npn_select_cb_common_i(VALUE tmp)
 
 static int
 ssl_npn_select_cb_common(SSL *ssl, VALUE cb, const unsigned char **out,
-			 unsigned char *outlen, const unsigned char *in,
-			 unsigned int inlen)
+                         unsigned char *outlen, const unsigned char *in,
+                         unsigned int inlen)
 {
     VALUE selected;
     int status;
@@ -694,10 +554,10 @@ ssl_npn_select_cb_common(SSL *ssl, VALUE cb, const unsigned char **out,
 
     selected = rb_protect(npn_select_cb_common_i, (VALUE)&args, &status);
     if (status) {
-	VALUE ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
+        VALUE ssl_obj = (VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx);
 
-	rb_ivar_set(ssl_obj, ID_callback_state, INT2NUM(status));
-	return SSL_TLSEXT_ERR_ALERT_FATAL;
+        rb_ivar_set(ssl_obj, ID_callback_state, INT2NUM(status));
+        return SSL_TLSEXT_ERR_ALERT_FATAL;
     }
 
     *out = (unsigned char *)RSTRING_PTR(selected);
@@ -709,7 +569,7 @@ ssl_npn_select_cb_common(SSL *ssl, VALUE cb, const unsigned char **out,
 #ifdef OSSL_USE_NEXTPROTONEG
 static int
 ssl_npn_advertise_cb(SSL *ssl, const unsigned char **out, unsigned int *outlen,
-		     void *arg)
+                     void *arg)
 {
     VALUE protocols = rb_attr_get((VALUE)arg, id_npn_protocols_encoded);
 
@@ -721,7 +581,7 @@ ssl_npn_advertise_cb(SSL *ssl, const unsigned char **out, unsigned int *outlen,
 
 static int
 ssl_npn_select_cb(SSL *ssl, unsigned char **out, unsigned char *outlen,
-		  const unsigned char *in, unsigned int inlen, void *arg)
+                  const unsigned char *in, unsigned int inlen, void *arg)
 {
     VALUE sslctx_obj, cb;
 
@@ -729,13 +589,13 @@ ssl_npn_select_cb(SSL *ssl, unsigned char **out, unsigned char *outlen,
     cb = rb_attr_get(sslctx_obj, id_i_npn_select_cb);
 
     return ssl_npn_select_cb_common(ssl, cb, (const unsigned char **)out,
-				    outlen, in, inlen);
+                                    outlen, in, inlen);
 }
 #endif
 
 static int
 ssl_alpn_select_cb(SSL *ssl, const unsigned char **out, unsigned char *outlen,
-		   const unsigned char *in, unsigned int inlen, void *arg)
+                   const unsigned char *in, unsigned int inlen, void *arg)
 {
     VALUE sslctx_obj, cb;
 
@@ -752,12 +612,15 @@ ssl_info_cb(const SSL *ssl, int where, int val)
     int is_server = SSL_is_server((SSL *)ssl);
 
     if (is_server && where & SSL_CB_HANDSHAKE_START) {
-	ssl_renegotiation_cb(ssl);
+        ssl_renegotiation_cb(ssl);
     }
 }
 
 /*
- * Gets various OpenSSL options.
+ * call-seq:
+ *    ctx.options -> integer
+ *
+ * Gets various \OpenSSL options.
  */
 static VALUE
 ossl_sslctx_get_options(VALUE self)
@@ -772,7 +635,17 @@ ossl_sslctx_get_options(VALUE self)
 }
 
 /*
- * Sets various OpenSSL options.
+ * call-seq:
+ *    ctx.options = integer
+ *
+ * Sets various \OpenSSL options. The options are a bit field and can be
+ * combined with the bitwise OR operator (<tt>|</tt>). Available options are
+ * defined as constants in OpenSSL::SSL that begin with +OP_+.
+ *
+ * For backwards compatibility, passing +nil+ has the same effect as passing
+ * OpenSSL::SSL::OP_ALL.
+ *
+ * See also man page SSL_CTX_set_options(3).
  */
 static VALUE
 ossl_sslctx_set_options(VALUE self, VALUE options)
@@ -785,9 +658,9 @@ ossl_sslctx_set_options(VALUE self, VALUE options)
     SSL_CTX_clear_options(ctx, SSL_CTX_get_options(ctx));
 
     if (NIL_P(options)) {
-	SSL_CTX_set_options(ctx, SSL_OP_ALL);
+        SSL_CTX_set_options(ctx, SSL_OP_ALL);
     } else {
-	SSL_CTX_set_options(ctx, NUM2ULONG(options));
+        SSL_CTX_set_options(ctx, NUM2ULONG(options));
     }
 
     return self;
@@ -817,23 +690,26 @@ ossl_sslctx_setup(VALUE self)
     GetSSLCTX(self, ctx);
 
 #if !defined(OPENSSL_NO_DH)
-    SSL_CTX_set_tmp_dh_callback(ctx, ossl_tmp_dh_callback);
+    if (!NIL_P(rb_attr_get(self, id_i_tmp_dh_callback))) {
+        SSL_CTX_set_tmp_dh_callback(ctx, ossl_tmp_dh_callback);
+        SSL_CTX_set_dh_auto(ctx, 0);
+    }
 #endif
 
-#ifdef HAVE_SSL_CTX_SET_POST_HANDSHAKE_AUTH
+#if !defined(OPENSSL_IS_AWSLC) /* AWS-LC has no support for TLS 1.3 PHA. */
     SSL_CTX_set_post_handshake_auth(ctx, 1);
 #endif
 
     val = rb_attr_get(self, id_i_cert_store);
     if (!NIL_P(val)) {
-	X509_STORE *store = GetX509StorePtr(val); /* NO NEED TO DUP */
-	SSL_CTX_set_cert_store(ctx, store);
-	X509_STORE_up_ref(store);
+        X509_STORE *store = GetX509StorePtr(val); /* NO NEED TO DUP */
+        SSL_CTX_set_cert_store(ctx, store);
+        X509_STORE_up_ref(store);
     }
 
     val = rb_attr_get(self, id_i_extra_chain_cert);
     if(!NIL_P(val)){
-	rb_block_call(val, rb_intern("each"), 0, 0, ossl_sslctx_add_extra_chain_cert_i, self);
+        rb_block_call(val, rb_intern("each"), 0, 0, ossl_sslctx_add_extra_chain_cert_i, self);
     }
 
     /* private key may be bundled in certificate file. */
@@ -857,22 +733,22 @@ ossl_sslctx_setup(VALUE self)
 
     val = rb_attr_get(self, id_i_client_ca);
     if(!NIL_P(val)){
-	if (RB_TYPE_P(val, T_ARRAY)) {
-	    for(i = 0; i < RARRAY_LEN(val); i++){
-		client_ca = GetX509CertPtr(RARRAY_AREF(val, i));
-        	if (!SSL_CTX_add_client_CA(ctx, client_ca)){
-		    /* Copies X509_NAME => FREE it. */
-        	    ossl_raise(eSSLError, "SSL_CTX_add_client_CA");
-        	}
-	    }
+        if (RB_TYPE_P(val, T_ARRAY)) {
+            for(i = 0; i < RARRAY_LEN(val); i++){
+                client_ca = GetX509CertPtr(RARRAY_AREF(val, i));
+                if (!SSL_CTX_add_client_CA(ctx, client_ca)){
+                    /* Copies X509_NAME => FREE it. */
+                    ossl_raise(eSSLError, "SSL_CTX_add_client_CA");
+                }
+            }
         }
-	else{
-	    client_ca = GetX509CertPtr(val); /* NO DUP NEEDED. */
+        else{
+            client_ca = GetX509CertPtr(val); /* NO DUP NEEDED. */
             if (!SSL_CTX_add_client_CA(ctx, client_ca)){
-		/* Copies X509_NAME => FREE it. */
-        	ossl_raise(eSSLError, "SSL_CTX_add_client_CA");
+                /* Copies X509_NAME => FREE it. */
+                ossl_raise(eSSLError, "SSL_CTX_add_client_CA");
             }
-	}
+        }
     }
 
     val = rb_attr_get(self, id_i_ca_file);
@@ -895,7 +771,7 @@ ossl_sslctx_setup(VALUE self)
     verify_mode = NIL_P(val) ? SSL_VERIFY_NONE : NUM2INT(val);
     SSL_CTX_set_verify(ctx, verify_mode, ossl_ssl_verify_callback);
     if (RTEST(rb_attr_get(self, id_i_client_cert_cb)))
-	SSL_CTX_set_client_cert_cb(ctx, ossl_client_cert_cb);
+        SSL_CTX_set_client_cert_cb(ctx, ossl_client_cert_cb);
 
     val = rb_attr_get(self, id_i_timeout);
     if(!NIL_P(val)) SSL_CTX_set_timeout(ctx, NUM2LONG(val));
@@ -906,63 +782,63 @@ ossl_sslctx_setup(VALUE self)
 #ifdef OSSL_USE_NEXTPROTONEG
     val = rb_attr_get(self, id_i_npn_protocols);
     if (!NIL_P(val)) {
-	VALUE encoded = ssl_encode_npn_protocols(val);
-	rb_ivar_set(self, id_npn_protocols_encoded, encoded);
-	SSL_CTX_set_next_protos_advertised_cb(ctx, ssl_npn_advertise_cb, (void *)self);
-	OSSL_Debug("SSL NPN advertise callback added");
+        VALUE encoded = ssl_encode_npn_protocols(val);
+        rb_ivar_set(self, id_npn_protocols_encoded, encoded);
+        SSL_CTX_set_next_protos_advertised_cb(ctx, ssl_npn_advertise_cb, (void *)self);
+        OSSL_Debug("SSL NPN advertise callback added");
     }
     if (RTEST(rb_attr_get(self, id_i_npn_select_cb))) {
-	SSL_CTX_set_next_proto_select_cb(ctx, ssl_npn_select_cb, (void *) self);
-	OSSL_Debug("SSL NPN select callback added");
+        SSL_CTX_set_next_proto_select_cb(ctx, ssl_npn_select_cb, (void *) self);
+        OSSL_Debug("SSL NPN select callback added");
     }
 #endif
 
     val = rb_attr_get(self, id_i_alpn_protocols);
     if (!NIL_P(val)) {
-	VALUE rprotos = ssl_encode_npn_protocols(val);
+        VALUE rprotos = ssl_encode_npn_protocols(val);
 
-	/* returns 0 on success */
-	if (SSL_CTX_set_alpn_protos(ctx, (unsigned char *)RSTRING_PTR(rprotos),
-				    RSTRING_LENINT(rprotos)))
-	    ossl_raise(eSSLError, "SSL_CTX_set_alpn_protos");
-	OSSL_Debug("SSL ALPN values added");
+        /* returns 0 on success */
+        if (SSL_CTX_set_alpn_protos(ctx, (unsigned char *)RSTRING_PTR(rprotos),
+                                    RSTRING_LENINT(rprotos)))
+            ossl_raise(eSSLError, "SSL_CTX_set_alpn_protos");
+        OSSL_Debug("SSL ALPN values added");
     }
     if (RTEST(rb_attr_get(self, id_i_alpn_select_cb))) {
-	SSL_CTX_set_alpn_select_cb(ctx, ssl_alpn_select_cb, (void *) self);
-	OSSL_Debug("SSL ALPN select callback added");
+        SSL_CTX_set_alpn_select_cb(ctx, ssl_alpn_select_cb, (void *) self);
+        OSSL_Debug("SSL ALPN select callback added");
     }
 
     rb_obj_freeze(self);
 
     val = rb_attr_get(self, id_i_session_id_context);
     if (!NIL_P(val)){
-	StringValue(val);
-	if (!SSL_CTX_set_session_id_context(ctx, (unsigned char *)RSTRING_PTR(val),
-					    RSTRING_LENINT(val))){
-	    ossl_raise(eSSLError, "SSL_CTX_set_session_id_context");
-	}
+        StringValue(val);
+        if (!SSL_CTX_set_session_id_context(ctx, (unsigned char *)RSTRING_PTR(val),
+                                            RSTRING_LENINT(val))){
+            ossl_raise(eSSLError, "SSL_CTX_set_session_id_context");
+        }
     }
 
     if (RTEST(rb_attr_get(self, id_i_session_get_cb))) {
-	SSL_CTX_sess_set_get_cb(ctx, ossl_sslctx_session_get_cb);
-	OSSL_Debug("SSL SESSION get callback added");
+        SSL_CTX_sess_set_get_cb(ctx, ossl_sslctx_session_get_cb);
+        OSSL_Debug("SSL SESSION get callback added");
     }
     if (RTEST(rb_attr_get(self, id_i_session_new_cb))) {
-	SSL_CTX_sess_set_new_cb(ctx, ossl_sslctx_session_new_cb);
-	OSSL_Debug("SSL SESSION new callback added");
+        SSL_CTX_sess_set_new_cb(ctx, ossl_sslctx_session_new_cb);
+        OSSL_Debug("SSL SESSION new callback added");
     }
     if (RTEST(rb_attr_get(self, id_i_session_remove_cb))) {
-	SSL_CTX_sess_set_remove_cb(ctx, ossl_sslctx_session_remove_cb);
-	OSSL_Debug("SSL SESSION remove callback added");
+        SSL_CTX_sess_set_remove_cb(ctx, ossl_sslctx_session_remove_cb);
+        OSSL_Debug("SSL SESSION remove callback added");
     }
 
     val = rb_attr_get(self, id_i_servername_cb);
     if (!NIL_P(val)) {
         SSL_CTX_set_tlsext_servername_callback(ctx, ssl_servername_cb);
-	OSSL_Debug("SSL TLSEXT servername callback added");
+        OSSL_Debug("SSL TLSEXT servername callback added");
     }
 
-#if OPENSSL_VERSION_NUMBER >= 0x10101000 && !defined(LIBRESSL_VERSION_NUMBER)
+#if !OSSL_IS_LIBRESSL
     /*
      * It is only compatible with OpenSSL >= 1.1.1. Even if LibreSSL implements
      * SSL_CTX_set_keylog_callback() from v3.4.2, it does nothing (see
@@ -977,6 +853,93 @@ ossl_sslctx_setup(VALUE self)
     return Qtrue;
 }
 
+static int
+parse_proto_version(VALUE str)
+{
+    int i;
+    static const struct {
+        const char *name;
+        int version;
+    } map[] = {
+        { "SSL2", SSL2_VERSION },
+        { "SSL3", SSL3_VERSION },
+        { "TLS1", TLS1_VERSION },
+        { "TLS1_1", TLS1_1_VERSION },
+        { "TLS1_2", TLS1_2_VERSION },
+        { "TLS1_3", TLS1_3_VERSION },
+    };
+
+    if (NIL_P(str))
+        return 0;
+    if (RB_INTEGER_TYPE_P(str))
+        return NUM2INT(str);
+
+    if (SYMBOL_P(str))
+        str = rb_sym2str(str);
+    StringValue(str);
+    for (i = 0; i < numberof(map); i++)
+        if (!strncmp(map[i].name, RSTRING_PTR(str), RSTRING_LEN(str)))
+            return map[i].version;
+    rb_raise(rb_eArgError, "unrecognized version %+"PRIsVALUE, str);
+}
+
+/*
+ * call-seq:
+ *    ctx.min_version = OpenSSL::SSL::TLS1_2_VERSION
+ *    ctx.min_version = :TLS1_2
+ *    ctx.min_version = nil
+ *
+ * Sets the lower bound on the supported SSL/TLS protocol version. The
+ * version may be specified by an integer constant named
+ * OpenSSL::SSL::*_VERSION, a Symbol, or +nil+ which means "any version".
+ *
+ * === Example
+ *   ctx = OpenSSL::SSL::SSLContext.new
+ *   ctx.min_version = OpenSSL::SSL::TLS1_1_VERSION
+ *   ctx.max_version = OpenSSL::SSL::TLS1_2_VERSION
+ *
+ *   sock = OpenSSL::SSL::SSLSocket.new(tcp_sock, ctx)
+ *   sock.connect # Initiates a connection using either TLS 1.1 or TLS 1.2
+ */
+static VALUE
+ossl_sslctx_set_min_version(VALUE self, VALUE v)
+{
+    SSL_CTX *ctx;
+    int version;
+
+    rb_check_frozen(self);
+    GetSSLCTX(self, ctx);
+    version = parse_proto_version(v);
+
+    if (!SSL_CTX_set_min_proto_version(ctx, version))
+        ossl_raise(eSSLError, "SSL_CTX_set_min_proto_version");
+    return v;
+}
+
+/*
+ * call-seq:
+ *    ctx.max_version = OpenSSL::SSL::TLS1_2_VERSION
+ *    ctx.max_version = :TLS1_2
+ *    ctx.max_version = nil
+ *
+ * Sets the upper bound of the supported SSL/TLS protocol version. See
+ * #min_version= for the possible values.
+ */
+static VALUE
+ossl_sslctx_set_max_version(VALUE self, VALUE v)
+{
+    SSL_CTX *ctx;
+    int version;
+
+    rb_check_frozen(self);
+    GetSSLCTX(self, ctx);
+    version = parse_proto_version(v);
+
+    if (!SSL_CTX_set_max_proto_version(ctx, version))
+        ossl_raise(eSSLError, "SSL_CTX_set_max_proto_version");
+    return v;
+}
+
 static VALUE
 ossl_ssl_cipher_to_ary(const SSL_CIPHER *cipher)
 {
@@ -1026,11 +989,10 @@ static VALUE
 build_cipher_string(VALUE v)
 {
     VALUE str, elem;
-    int i;
 
     if (RB_TYPE_P(v, T_ARRAY)) {
         str = rb_str_new(0, 0);
-        for (i = 0; i < RARRAY_LEN(v); i++) {
+        for (long i = 0; i < RARRAY_LEN(v); i++) {
             elem = rb_ary_entry(v, i);
             if (RB_TYPE_P(elem, T_ARRAY)) elem = rb_ary_entry(elem, 0);
             elem = rb_String(elem);
@@ -1051,9 +1013,14 @@ build_cipher_string(VALUE v)
  *    ctx.ciphers = [name, ...]
  *    ctx.ciphers = [[name, version, bits, alg_bits], ...]
  *
- * Sets the list of available cipher suites for this context.  Note in a server
- * context some ciphers require the appropriate certificates.  For example, an
- * RSA cipher suite can only be chosen when an RSA certificate is available.
+ * Sets the list of available cipher suites for TLS 1.2 and below for this
+ * context.
+ *
+ * Note in a server context some ciphers require the appropriate certificates.
+ * For example, an RSA cipher suite can only be chosen when an RSA certificate
+ * is available.
+ *
+ * This method does not affect TLS 1.3 connections. See also #ciphersuites=.
  */
 static VALUE
 ossl_sslctx_set_ciphers(VALUE self, VALUE v)
@@ -1062,6 +1029,7 @@ ossl_sslctx_set_ciphers(VALUE self, VALUE v)
     VALUE str;
 
     rb_check_frozen(self);
+    // Assigning nil is a no-op for compatibility
     if (NIL_P(v))
         return v;
 
@@ -1074,14 +1042,12 @@ ossl_sslctx_set_ciphers(VALUE self, VALUE v)
     return v;
 }
 
-#ifdef HAVE_SSL_CTX_SET_CIPHERSUITES
 /*
  * call-seq:
  *    ctx.ciphersuites = "cipher1:cipher2:..."
  *    ctx.ciphersuites = [name, ...]
- *    ctx.ciphersuites = [[name, version, bits, alg_bits], ...]
  *
- * Sets the list of available TLSv1.3 cipher suites for this context.
+ * Sets the list of available TLS 1.3 cipher suites for this context.
  */
 static VALUE
 ossl_sslctx_set_ciphersuites(VALUE self, VALUE v)
@@ -1090,6 +1056,7 @@ ossl_sslctx_set_ciphersuites(VALUE self, VALUE v)
     VALUE str;
 
     rb_check_frozen(self);
+    // Assigning nil is a no-op for compatibility
     if (NIL_P(v))
         return v;
 
@@ -1101,6 +1068,62 @@ ossl_sslctx_set_ciphersuites(VALUE self, VALUE v)
 
     return v;
 }
+
+#ifdef HAVE_SSL_CTX_SET1_SIGALGS_LIST
+/*
+ * call-seq:
+ *    ctx.sigalgs = "sigalg1:sigalg2:..."
+ *
+ * Sets the list of "supported signature algorithms" for this context.
+ *
+ * For a TLS client, the list is used in the "signature_algorithms" extension
+ * in the ClientHello message. For a server, the list is used by OpenSSL to
+ * determine the set of shared signature algorithms. OpenSSL will pick the most
+ * appropriate one from it.
+ *
+ * See also #client_sigalgs= for the client authentication equivalent.
+ */
+static VALUE
+ossl_sslctx_set_sigalgs(VALUE self, VALUE v)
+{
+    SSL_CTX *ctx;
+
+    rb_check_frozen(self);
+    GetSSLCTX(self, ctx);
+
+    if (!SSL_CTX_set1_sigalgs_list(ctx, StringValueCStr(v)))
+        ossl_raise(eSSLError, "SSL_CTX_set1_sigalgs_list");
+
+    return v;
+}
+#endif
+
+#ifdef HAVE_SSL_CTX_SET1_CLIENT_SIGALGS_LIST
+/*
+ * call-seq:
+ *    ctx.client_sigalgs = "sigalg1:sigalg2:..."
+ *
+ * Sets the list of "supported signature algorithms" for client authentication
+ * for this context.
+ *
+ * For a TLS server, the list is sent to the client as part of the
+ * CertificateRequest message.
+ *
+ * See also #sigalgs= for the server authentication equivalent.
+ */
+static VALUE
+ossl_sslctx_set_client_sigalgs(VALUE self, VALUE v)
+{
+    SSL_CTX *ctx;
+
+    rb_check_frozen(self);
+    GetSSLCTX(self, ctx);
+
+    if (!SSL_CTX_set1_client_sigalgs_list(ctx, StringValueCStr(v)))
+        ossl_raise(eSSLError, "SSL_CTX_set1_client_sigalgs_list");
+
+    return v;
+}
 #endif
 
 #ifndef OPENSSL_NO_DH
@@ -1115,7 +1138,7 @@ ossl_sslctx_set_ciphersuites(VALUE self, VALUE v)
  * contained in the key object, if any, are ignored. The server will always
  * generate a new key pair for each handshake.
  *
- * Added in version 3.0. See also the man page SSL_set0_tmp_dh_pkey(3).
+ * Added in version 3.0. See also the man page SSL_CTX_set0_tmp_dh_pkey(3).
  *
  * Example:
  *   ctx = OpenSSL::SSL::SSLContext.new
@@ -1136,7 +1159,7 @@ ossl_sslctx_set_tmp_dh(VALUE self, VALUE arg)
     if (EVP_PKEY_base_id(pkey) != EVP_PKEY_DH)
         rb_raise(eSSLError, "invalid pkey type %s (expected DH)",
                  OBJ_nid2sn(EVP_PKEY_base_id(pkey)));
-#ifdef HAVE_SSL_SET0_TMP_DH_PKEY
+#ifdef HAVE_SSL_CTX_SET0_TMP_DH_PKEY
     if (!SSL_CTX_set0_tmp_dh_pkey(ctx, pkey))
         ossl_raise(eSSLError, "SSL_CTX_set0_tmp_dh_pkey");
     EVP_PKEY_up_ref(pkey);
@@ -1145,29 +1168,36 @@ ossl_sslctx_set_tmp_dh(VALUE self, VALUE arg)
         ossl_raise(eSSLError, "SSL_CTX_set_tmp_dh");
 #endif
 
+    // Turn off the "auto" DH parameters set by ossl_sslctx_s_alloc()
+    SSL_CTX_set_dh_auto(ctx, 0);
+
     return arg;
 }
 #endif
 
-#if !defined(OPENSSL_NO_EC)
 /*
  * call-seq:
- *    ctx.ecdh_curves = curve_list -> curve_list
+ *    ctx.groups = groups_list
+ *    ctx.ecdh_curves = groups_list
+ *
+ * Sets the list of supported groups for key agreement for this context.
  *
- * Sets the list of "supported elliptic curves" for this context.
+ * For a TLS client, the list is directly used in the "supported_groups"
+ * extension. For a server, the list is used by OpenSSL to determine the set of
+ * shared supported groups. OpenSSL will pick the most appropriate one from it.
  *
- * For a TLS client, the list is directly used in the Supported Elliptic Curves
- * Extension. For a server, the list is used by OpenSSL to determine the set of
- * shared curves. OpenSSL will pick the most appropriate one from it.
+ * #ecdh_curves= is a deprecated alias for #groups=.
+ *
+ * See also the man page SSL_CTX_set1_groups_list(3).
  *
  * === Example
  *   ctx1 = OpenSSL::SSL::SSLContext.new
- *   ctx1.ecdh_curves = "X25519:P-256:P-224"
+ *   ctx1.groups = "X25519:P-256:P-224"
  *   svr = OpenSSL::SSL::SSLServer.new(tcp_svr, ctx1)
  *   Thread.new { svr.accept }
  *
  *   ctx2 = OpenSSL::SSL::SSLContext.new
- *   ctx2.ecdh_curves = "P-256"
+ *   ctx2.groups = "P-256"
  *   cli = OpenSSL::SSL::SSLSocket.new(tcp_sock, ctx2)
  *   cli.connect
  *
@@ -1175,7 +1205,7 @@ ossl_sslctx_set_tmp_dh(VALUE self, VALUE arg)
  *   # => "prime256v1" (is an alias for NIST P-256)
  */
 static VALUE
-ossl_sslctx_set_ecdh_curves(VALUE self, VALUE arg)
+ossl_sslctx_set_groups(VALUE self, VALUE arg)
 {
     SSL_CTX *ctx;
 
@@ -1183,13 +1213,10 @@ ossl_sslctx_set_ecdh_curves(VALUE self, VALUE arg)
     GetSSLCTX(self, ctx);
     StringValueCStr(arg);
 
-    if (!SSL_CTX_set1_curves_list(ctx, RSTRING_PTR(arg)))
-	ossl_raise(eSSLError, NULL);
+    if (!SSL_CTX_set1_groups_list(ctx, RSTRING_PTR(arg)))
+        ossl_raise(eSSLError, "SSL_CTX_set1_groups_list");
     return arg;
 }
-#else
-#define ossl_sslctx_set_ecdh_curves rb_f_notimplement
-#endif
 
 /*
  * call-seq:
@@ -1206,12 +1233,7 @@ ossl_sslctx_get_security_level(VALUE self)
 
     GetSSLCTX(self, ctx);
 
-#if defined(HAVE_SSL_CTX_GET_SECURITY_LEVEL)
     return INT2NUM(SSL_CTX_get_security_level(ctx));
-#else
-    (void)ctx;
-    return INT2FIX(0);
-#endif
 }
 
 /*
@@ -1241,14 +1263,7 @@ ossl_sslctx_set_security_level(VALUE self, VALUE value)
     rb_check_frozen(self);
     GetSSLCTX(self, ctx);
 
-#if defined(HAVE_SSL_CTX_GET_SECURITY_LEVEL)
     SSL_CTX_set_security_level(ctx, NUM2INT(value));
-#else
-    (void)ctx;
-    if (NUM2INT(value) != 0)
-	ossl_raise(rb_eNotImpError, "setting security level to other than 0 is "
-		   "not supported in this version of OpenSSL");
-#endif
 
     return value;
 }
@@ -1330,20 +1345,20 @@ ossl_sslctx_add_certificate(int argc, VALUE *argv, VALUE self)
     pub_pkey = X509_get_pubkey(x509);
     EVP_PKEY_free(pub_pkey);
     if (!pub_pkey)
-	rb_raise(rb_eArgError, "certificate does not contain public key");
+        rb_raise(rb_eArgError, "certificate does not contain public key");
     if (EVP_PKEY_eq(pub_pkey, pkey) != 1)
-	rb_raise(rb_eArgError, "public key mismatch");
+        rb_raise(rb_eArgError, "public key mismatch");
 
     if (argc >= 3)
-	extra_chain = ossl_x509_ary2sk(extra_chain_ary);
+        extra_chain = ossl_x509_ary2sk(extra_chain_ary);
 
     if (!SSL_CTX_use_certificate(ctx, x509)) {
-	sk_X509_pop_free(extra_chain, X509_free);
-	ossl_raise(eSSLError, "SSL_CTX_use_certificate");
+        sk_X509_pop_free(extra_chain, X509_free);
+        ossl_raise(eSSLError, "SSL_CTX_use_certificate");
     }
     if (!SSL_CTX_use_PrivateKey(ctx, pkey)) {
-	sk_X509_pop_free(extra_chain, X509_free);
-	ossl_raise(eSSLError, "SSL_CTX_use_PrivateKey");
+        sk_X509_pop_free(extra_chain, X509_free);
+        ossl_raise(eSSLError, "SSL_CTX_use_PrivateKey");
     }
     if (extra_chain && !SSL_CTX_set0_chain(ctx, extra_chain)) {
         sk_X509_pop_free(extra_chain, X509_free);
@@ -1553,11 +1568,6 @@ ossl_ssl_mark(void *ptr)
 {
     SSL *ssl = ptr;
     rb_gc_mark((VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_ptr_idx));
-
-    // Note: this reference is stored as @verify_callback so we don't need to mark it.
-    // However we do need to ensure GC compaction won't move it, hence why
-    // we call rb_gc_mark here.
-    rb_gc_mark((VALUE)SSL_get_ex_data(ssl, ossl_ssl_ex_vcb_idx));
 }
 
 static void
@@ -1581,32 +1591,31 @@ ossl_ssl_s_alloc(VALUE klass)
 }
 
 static VALUE
-peer_ip_address(VALUE self)
+peer_ip_address(VALUE io)
 {
-    VALUE remote_address = rb_funcall(rb_attr_get(self, id_i_io), rb_intern("remote_address"), 0);
+    VALUE remote_address = rb_funcall(io, rb_intern("remote_address"), 0);
 
     return rb_funcall(remote_address, rb_intern("inspect_sockaddr"), 0);
 }
 
 static VALUE
-fallback_peer_ip_address(VALUE self, VALUE args)
+fallback_peer_ip_address(VALUE self, VALUE exc)
 {
     return rb_str_new_cstr("(null)");
 }
 
 static VALUE
-peeraddr_ip_str(VALUE self)
+peeraddr_ip_str(VALUE io)
 {
-    VALUE rb_mErrno = rb_const_get(rb_cObject, rb_intern("Errno"));
-    VALUE rb_eSystemCallError = rb_const_get(rb_mErrno, rb_intern("SystemCallError"));
-
-    return rb_rescue2(peer_ip_address, self, fallback_peer_ip_address, (VALUE)0, rb_eSystemCallError, NULL);
+    return rb_rescue2(peer_ip_address, io, fallback_peer_ip_address, Qnil,
+                      rb_eSystemCallError, (VALUE)0);
 }
 
 /*
  * call-seq:
  *    SSLSocket.new(io) => aSSLSocket
  *    SSLSocket.new(io, ctx) => aSSLSocket
+ *    SSLSocket.new(io, ctx, sync_close:) => aSSLSocket
  *
  * Creates a new SSL socket from _io_ which must be a real IO object (not an
  * IO-like object that responds to read/write).
@@ -1614,6 +1623,10 @@ peeraddr_ip_str(VALUE self)
  * If _ctx_ is provided the SSL Sockets initial params will be taken from
  * the context.
  *
+ * The optional _sync_close_ keyword parameter sets the _sync_close_ instance
+ * variable. Setting this to +true+ will cause the underlying socket to be
+ * closed when the SSL/TLS connection is shut down.
+ *
  * The OpenSSL::Buffering module provides additional IO methods.
  *
  * This method will freeze the SSLContext if one is provided;
@@ -1622,37 +1635,47 @@ peeraddr_ip_str(VALUE self)
 static VALUE
 ossl_ssl_initialize(int argc, VALUE *argv, VALUE self)
 {
-    VALUE io, v_ctx, verify_cb;
+    static ID kw_ids[1];
+    VALUE kw_args[1];
+    VALUE opts;
+
+    VALUE io, v_ctx;
     SSL *ssl;
     SSL_CTX *ctx;
 
     TypedData_Get_Struct(self, SSL, &ossl_ssl_type, ssl);
     if (ssl)
-	ossl_raise(eSSLError, "SSL already initialized");
+        ossl_raise(eSSLError, "SSL already initialized");
+
+    if (rb_scan_args(argc, argv, "11:", &io, &v_ctx, &opts) == 1)
+        v_ctx = rb_funcall(cSSLContext, rb_intern("new"), 0);
+
+    if (!kw_ids[0]) {
+        kw_ids[0] = rb_intern_const("sync_close");
+    }
 
-    if (rb_scan_args(argc, argv, "11", &io, &v_ctx) == 1)
-	v_ctx = rb_funcall(cSSLContext, rb_intern("new"), 0);
+    rb_get_kwargs(opts, kw_ids, 0, 1, kw_args);
+    if (kw_args[0] != Qundef) {
+        rb_ivar_set(self, id_i_sync_close, kw_args[0]);
+    }
 
     GetSSLCTX(v_ctx, ctx);
     rb_ivar_set(self, id_i_context, v_ctx);
     ossl_sslctx_setup(v_ctx);
 
     if (rb_respond_to(io, rb_intern("nonblock=")))
-	rb_funcall(io, rb_intern("nonblock="), 1, Qtrue);
+        rb_funcall(io, rb_intern("nonblock="), 1, Qtrue);
     Check_Type(io, T_FILE);
     rb_ivar_set(self, id_i_io, io);
 
     ssl = SSL_new(ctx);
     if (!ssl)
-	ossl_raise(eSSLError, NULL);
+        ossl_raise(eSSLError, NULL);
     RTYPEDDATA_DATA(self) = ssl;
 
-    SSL_set_ex_data(ssl, ossl_ssl_ex_ptr_idx, (void *)self);
+    if (!SSL_set_ex_data(ssl, ossl_ssl_ex_ptr_idx, (void *)self))
+        ossl_raise(eSSLError, "SSL_set_ex_data");
     SSL_set_info_callback(ssl, ssl_info_cb);
-    verify_cb = rb_attr_get(v_ctx, id_i_verify_callback);
-    // We don't need to trigger a write barrier because it's already
-    // an instance variable of this object.
-    SSL_set_ex_data(ssl, ossl_ssl_ex_vcb_idx, (void *)verify_cb);
 
     rb_call_super(0, NULL);
 
@@ -1679,7 +1702,7 @@ ossl_ssl_setup(VALUE self)
 
     GetSSL(self, ssl);
     if (ssl_started(ssl))
-	return Qtrue;
+        return Qtrue;
 
     io = rb_attr_get(self, id_i_io);
     GetOpenFile(io, fptr);
@@ -1691,24 +1714,28 @@ ossl_ssl_setup(VALUE self)
     return Qtrue;
 }
 
+static int
+errno_mapped(void)
+{
 #ifdef _WIN32
-#define ssl_get_error(ssl, ret) (errno = rb_w32_map_errno(WSAGetLastError()), SSL_get_error((ssl), (ret)))
+    return rb_w32_map_errno(WSAGetLastError());
 #else
-#define ssl_get_error(ssl, ret) SSL_get_error((ssl), (ret))
+    return errno;
 #endif
+}
 
 static void
 write_would_block(int nonblock)
 {
     if (nonblock)
-	ossl_raise(eSSLErrorWaitWritable, "write would block");
+        ossl_raise(eSSLErrorWaitWritable, "write would block");
 }
 
 static void
 read_would_block(int nonblock)
 {
     if (nonblock)
-	ossl_raise(eSSLErrorWaitReadable, "read would block");
+        ossl_raise(eSSLErrorWaitReadable, "read would block");
 }
 
 static int
@@ -1716,7 +1743,7 @@ no_exception_p(VALUE opts)
 {
     if (RB_TYPE_P(opts, T_HASH) &&
           rb_hash_lookup2(opts, sym_exception, Qundef) == Qfalse)
-	return 1;
+        return 1;
     return 0;
 }
 
@@ -1736,13 +1763,13 @@ static void
 io_wait_writable(VALUE io)
 {
 #ifdef HAVE_RB_IO_MAYBE_WAIT
-    if (!rb_io_maybe_wait_writable(errno, io, RUBY_IO_TIMEOUT_DEFAULT)) {
+    if (!rb_io_wait(io, INT2NUM(RUBY_IO_WRITABLE), RUBY_IO_TIMEOUT_DEFAULT)) {
         rb_raise(IO_TIMEOUT_ERROR, "Timed out while waiting to become writable!");
     }
 #else
     rb_io_t *fptr;
     GetOpenFile(io, fptr);
-    rb_io_wait_writable(fptr->fd);
+    rb_thread_fd_writable(fptr->fd);
 #endif
 }
 
@@ -1750,13 +1777,13 @@ static void
 io_wait_readable(VALUE io)
 {
 #ifdef HAVE_RB_IO_MAYBE_WAIT
-    if (!rb_io_maybe_wait_readable(errno, io, RUBY_IO_TIMEOUT_DEFAULT)) {
+    if (!rb_io_wait(io, INT2NUM(RUBY_IO_READABLE), RUBY_IO_TIMEOUT_DEFAULT)) {
         rb_raise(IO_TIMEOUT_ERROR, "Timed out while waiting to become readable!");
     }
 #else
     rb_io_t *fptr;
     GetOpenFile(io, fptr);
-    rb_io_wait_readable(fptr->fd);
+    rb_thread_wait_fd(fptr->fd);
 #endif
 }
 
@@ -1764,7 +1791,6 @@ static VALUE
 ossl_start_ssl(VALUE self, int (*func)(SSL *), const char *funcname, VALUE opts)
 {
     SSL *ssl;
-    int ret, ret2;
     VALUE cb_state;
     int nonblock = opts != Qfalse;
 
@@ -1774,7 +1800,8 @@ ossl_start_ssl(VALUE self, int (*func)(SSL *), const char *funcname, VALUE opts)
 
     VALUE io = rb_attr_get(self, id_i_io);
     for (;;) {
-        ret = func(ssl);
+        int ret = func(ssl);
+        int saved_errno = errno_mapped();
 
         cb_state = rb_attr_get(self, ID_callback_state);
         if (!NIL_P(cb_state)) {
@@ -1786,7 +1813,8 @@ ossl_start_ssl(VALUE self, int (*func)(SSL *), const char *funcname, VALUE opts)
         if (ret > 0)
             break;
 
-        switch ((ret2 = ssl_get_error(ssl, ret))) {
+        int code = SSL_get_error(ssl, ret);
+        switch (code) {
           case SSL_ERROR_WANT_WRITE:
             if (no_exception_p(opts)) { return sym_wait_writable; }
             write_would_block(nonblock);
@@ -1800,10 +1828,11 @@ ossl_start_ssl(VALUE self, int (*func)(SSL *), const char *funcname, VALUE opts)
           case SSL_ERROR_SYSCALL:
 #ifdef __APPLE__
             /* See ossl_ssl_write_internal() */
-            if (errno == EPROTOTYPE)
+            if (saved_errno == EPROTOTYPE)
                 continue;
 #endif
-            if (errno) rb_sys_fail(funcname);
+            if (saved_errno)
+                rb_exc_raise(rb_syserr_new(saved_errno, funcname));
             /* fallthrough */
           default: {
               VALUE error_append = Qnil;
@@ -1824,10 +1853,10 @@ ossl_start_ssl(VALUE self, int (*func)(SSL *), const char *funcname, VALUE opts)
               ossl_raise(eSSLError,
                          "%s%s returned=%d errno=%d peeraddr=%"PRIsVALUE" state=%s%"PRIsVALUE,
                          funcname,
-                         ret2 == SSL_ERROR_SYSCALL ? " SYSCALL" : "",
-                         ret2,
-                         errno,
-                         peeraddr_ip_str(self),
+                         code == SSL_ERROR_SYSCALL ? " SYSCALL" : "",
+                         code,
+                         saved_errno,
+                         peeraddr_ip_str(io),
                          SSL_state_string_long(ssl),
                          error_append);
           }
@@ -1936,13 +1965,13 @@ ossl_ssl_read_internal(int argc, VALUE *argv, VALUE self, int nonblock)
 {
     SSL *ssl;
     int ilen;
-    VALUE len, str;
+    VALUE len, str, cb_state;
     VALUE opts = Qnil;
 
     if (nonblock) {
-	rb_scan_args(argc, argv, "11:", &len, &str, &opts);
+        rb_scan_args(argc, argv, "11:", &len, &str, &opts);
     } else {
-	rb_scan_args(argc, argv, "11", &len, &str);
+        rb_scan_args(argc, argv, "11", &len, &str);
     }
     GetSSL(self, ssl);
     if (!ssl_started(ssl))
@@ -1950,13 +1979,13 @@ ossl_ssl_read_internal(int argc, VALUE *argv, VALUE self, int nonblock)
 
     ilen = NUM2INT(len);
     if (NIL_P(str))
-	str = rb_str_new(0, ilen);
+        str = rb_str_new(0, ilen);
     else {
-	StringValue(str);
-	if (RSTRING_LEN(str) >= ilen)
-	    rb_str_modify(str);
-	else
-	    rb_str_modify_expand(str, ilen - RSTRING_LEN(str));
+        StringValue(str);
+        if (RSTRING_LEN(str) >= ilen)
+            rb_str_modify(str);
+        else
+            rb_str_modify_expand(str, ilen - RSTRING_LEN(str));
     }
 
     if (ilen == 0) {
@@ -1966,39 +1995,44 @@ ossl_ssl_read_internal(int argc, VALUE *argv, VALUE self, int nonblock)
 
     VALUE io = rb_attr_get(self, id_i_io);
 
-    rb_str_locktmp(str);
     for (;;) {
+        rb_str_locktmp(str);
         int nread = SSL_read(ssl, RSTRING_PTR(str), ilen);
-        switch (ssl_get_error(ssl, nread)) {
+        int saved_errno = errno_mapped();
+        rb_str_unlocktmp(str);
+
+        cb_state = rb_attr_get(self, ID_callback_state);
+        if (!NIL_P(cb_state)) {
+            rb_ivar_set(self, ID_callback_state, Qnil);
+            ossl_clear_error();
+            rb_jump_tag(NUM2INT(cb_state));
+        }
+
+        switch (SSL_get_error(ssl, nread)) {
           case SSL_ERROR_NONE:
-            rb_str_unlocktmp(str);
             rb_str_set_len(str, nread);
             return str;
           case SSL_ERROR_ZERO_RETURN:
-            rb_str_unlocktmp(str);
             if (no_exception_p(opts)) { return Qnil; }
             rb_eof_error();
           case SSL_ERROR_WANT_WRITE:
             if (nonblock) {
-                rb_str_unlocktmp(str);
                 if (no_exception_p(opts)) { return sym_wait_writable; }
                 write_would_block(nonblock);
             }
             io_wait_writable(io);
-            continue;
+            break;
           case SSL_ERROR_WANT_READ:
             if (nonblock) {
-                rb_str_unlocktmp(str);
                 if (no_exception_p(opts)) { return sym_wait_readable; }
                 read_would_block(nonblock);
             }
             io_wait_readable(io);
-            continue;
+            break;
           case SSL_ERROR_SYSCALL:
             if (!ERR_peek_error()) {
-                rb_str_unlocktmp(str);
-                if (errno)
-                    rb_sys_fail(0);
+                if (saved_errno)
+                    rb_exc_raise(rb_syserr_new(saved_errno, "SSL_read"));
                 else {
                     /*
                      * The underlying BIO returned 0. This is actually a
@@ -2013,9 +2047,13 @@ ossl_ssl_read_internal(int argc, VALUE *argv, VALUE self, int nonblock)
             }
             /* fall through */
           default:
-            rb_str_unlocktmp(str);
             ossl_raise(eSSLError, "SSL_read");
         }
+
+        // Ensure the buffer is not modified during io_wait_*able()
+        rb_str_modify(str);
+        if (rb_str_capacity(str) < (size_t)ilen)
+            rb_raise(eSSLError, "read buffer was modified");
     }
 }
 
@@ -2053,29 +2091,42 @@ ossl_ssl_read_nonblock(int argc, VALUE *argv, VALUE self)
 }
 
 static VALUE
-ossl_ssl_write_internal(VALUE self, VALUE str, VALUE opts)
+ossl_ssl_write_internal_safe(VALUE _args)
 {
+    VALUE *args = (VALUE*)_args;
+    VALUE self = args[0];
+    VALUE str = args[1];
+    VALUE opts = args[2];
+
     SSL *ssl;
     rb_io_t *fptr;
     int num, nonblock = opts != Qfalse;
-    VALUE tmp;
+    VALUE cb_state;
 
     GetSSL(self, ssl);
     if (!ssl_started(ssl))
         rb_raise(eSSLError, "SSL session is not started yet");
 
-    tmp = rb_str_new_frozen(StringValue(str));
     VALUE io = rb_attr_get(self, id_i_io);
     GetOpenFile(io, fptr);
 
     /* SSL_write(3ssl) manpage states num == 0 is undefined */
-    num = RSTRING_LENINT(tmp);
+    num = RSTRING_LENINT(str);
     if (num == 0)
         return INT2FIX(0);
 
     for (;;) {
-        int nwritten = SSL_write(ssl, RSTRING_PTR(tmp), num);
-        switch (ssl_get_error(ssl, nwritten)) {
+        int nwritten = SSL_write(ssl, RSTRING_PTR(str), num);
+        int saved_errno = errno_mapped();
+
+        cb_state = rb_attr_get(self, ID_callback_state);
+        if (!NIL_P(cb_state)) {
+            rb_ivar_set(self, ID_callback_state, Qnil);
+            ossl_clear_error();
+            rb_jump_tag(NUM2INT(cb_state));
+        }
+
+        switch (SSL_get_error(ssl, nwritten)) {
           case SSL_ERROR_NONE:
             return INT2NUM(nwritten);
           case SSL_ERROR_WANT_WRITE:
@@ -2096,10 +2147,11 @@ ossl_ssl_write_internal(VALUE self, VALUE str, VALUE opts)
              * make the error handling in line with the socket library.
              * [Bug #14713] https://bugs.ruby-lang.org/issues/14713
              */
-            if (errno == EPROTOTYPE)
+            if (saved_errno == EPROTOTYPE)
                 continue;
 #endif
-            if (errno) rb_sys_fail(0);
+            if (saved_errno)
+                rb_exc_raise(rb_syserr_new(saved_errno, "SSL_write"));
             /* fallthrough */
           default:
             ossl_raise(eSSLError, "SSL_write");
@@ -2107,6 +2159,28 @@ ossl_ssl_write_internal(VALUE self, VALUE str, VALUE opts)
     }
 }
 
+
+static VALUE
+ossl_ssl_write_internal(VALUE self, VALUE str, VALUE opts)
+{
+    StringValue(str);
+    int frozen = RB_OBJ_FROZEN(str);
+    if (!frozen) {
+        rb_str_locktmp(str);
+    }
+    int state;
+    VALUE args[3] = {self, str, opts};
+    VALUE result = rb_protect(ossl_ssl_write_internal_safe, (VALUE)args, &state);
+    if (!frozen) {
+        rb_str_unlocktmp(str);
+    }
+
+    if (state) {
+        rb_jump_tag(state);
+    }
+    return result;
+}
+
 /*
  * call-seq:
  *    ssl.syswrite(string) => Integer
@@ -2122,9 +2196,12 @@ ossl_ssl_write(VALUE self, VALUE str)
 /*
  * call-seq:
  *    ssl.syswrite_nonblock(string) => Integer
+ *    ssl.syswrite_nonblock(string, opts) => Integer
  *
  * Writes _string_ to the SSL connection in a non-blocking manner.  Raises an
- * SSLError if writing would block.
+ * SSLError if writing would block.  If "exception: false" is passed, this
+ * method returns a symbol of :wait_readable or :wait_writable, rather than
+ * raising an exception.
  */
 static VALUE
 ossl_ssl_write_nonblock(int argc, VALUE *argv, VALUE self)
@@ -2151,12 +2228,12 @@ ossl_ssl_stop(VALUE self)
 
     GetSSL(self, ssl);
     if (!ssl_started(ssl))
-	return Qnil;
+        return Qnil;
     ret = SSL_shutdown(ssl);
     if (ret == 1) /* Have already received close_notify */
-	return Qnil;
+        return Qnil;
     if (ret == 0) /* Sent close_notify, but we don't wait for reply */
-	return Qnil;
+        return Qnil;
 
     /*
      * XXX: Something happened. Possibly it failed because the underlying socket
@@ -2242,20 +2319,20 @@ ossl_ssl_get_peer_cert_chain(VALUE self)
     num = sk_X509_num(chain);
     ary = rb_ary_new2(num);
     for (i = 0; i < num; i++){
-	cert = sk_X509_value(chain, i);
-	rb_ary_push(ary, ossl_x509_new(cert));
+        cert = sk_X509_value(chain, i);
+        rb_ary_push(ary, ossl_x509_new(cert));
     }
 
     return ary;
 }
 
 /*
-* call-seq:
-*    ssl.ssl_version => String
-*
-* Returns a String representing the SSL/TLS version that was negotiated
-* for the connection, for example "TLSv1.2".
-*/
+ * call-seq:
+ *    ssl.ssl_version => String
+ *
+ * Returns a String representing the SSL/TLS version that was negotiated
+ * for the connection, for example "TLSv1.2".
+ */
 static VALUE
 ossl_ssl_get_version(VALUE self)
 {
@@ -2376,10 +2453,10 @@ ossl_ssl_set_hostname(VALUE self, VALUE arg)
     GetSSL(self, ssl);
 
     if (!NIL_P(arg))
-	hostname = StringValueCStr(arg);
+        hostname = StringValueCStr(arg);
 
     if (!SSL_set_tlsext_host_name(ssl, hostname))
-	ossl_raise(eSSLError, NULL);
+        ossl_raise(eSSLError, NULL);
 
     /* for SSLSocket#hostname */
     rb_ivar_set(self, id_i_hostname, arg);
@@ -2408,16 +2485,15 @@ ossl_ssl_get_verify_result(VALUE self)
 
 /*
  * call-seq:
- *    ssl.finished_message => "finished message"
- *
- * Returns the last *Finished* message sent
+ *    ssl.finished_message -> string or nil
  *
+ * Returns the contents of the last +Finished+ message sent to the peer.
  */
 static VALUE
 ossl_ssl_get_finished(VALUE self)
 {
     SSL *ssl;
-    char sizer[1], *buf;
+    char sizer[1];
     size_t len;
 
     GetSSL(self, ssl);
@@ -2426,23 +2502,23 @@ ossl_ssl_get_finished(VALUE self)
     if (len == 0)
         return Qnil;
 
-    buf = ALLOCA_N(char, len);
-    SSL_get_finished(ssl, buf, len);
-    return rb_str_new(buf, len);
+    VALUE str = rb_str_new(NULL, len);
+    SSL_get_finished(ssl, RSTRING_PTR(str), len);
+    return str;
 }
 
 /*
  * call-seq:
- *    ssl.peer_finished_message => "peer finished message"
- *
- * Returns the last *Finished* message received
+ *    ssl.peer_finished_message -> string or nil
  *
+ * Returns the contents of the last +Finished+ message expected to be sent
+ * by the peer.
  */
 static VALUE
 ossl_ssl_get_peer_finished(VALUE self)
 {
     SSL *ssl;
-    char sizer[1], *buf;
+    char sizer[1];
     size_t len;
 
     GetSSL(self, ssl);
@@ -2451,14 +2527,14 @@ ossl_ssl_get_peer_finished(VALUE self)
     if (len == 0)
         return Qnil;
 
-    buf = ALLOCA_N(char, len);
-    SSL_get_peer_finished(ssl, buf, len);
-    return rb_str_new(buf, len);
+    VALUE str = rb_str_new(NULL, len);
+    SSL_get_peer_finished(ssl, RSTRING_PTR(str), len);
+    return str;
 }
 
 /*
  * call-seq:
- *    ssl.client_ca => [x509name, ...]
+ *    ssl.client_ca => [x509name, ...] or nil
  *
  * Returns the list of client CAs. Please note that in contrast to
  * SSLContext#client_ca= no array of X509::Certificate is returned but
@@ -2476,6 +2552,8 @@ ossl_ssl_get_client_ca_list(VALUE self)
     GetSSL(self, ssl);
 
     ca = SSL_get_client_CA_list(ssl);
+    if (!ca)
+        return Qnil;
     return ossl_x509name_sk2ary(ca);
 }
 
@@ -2498,9 +2576,9 @@ ossl_ssl_npn_protocol(VALUE self)
 
     SSL_get0_next_proto_negotiated(ssl, &out, &outlen);
     if (!outlen)
-	return Qnil;
+        return Qnil;
     else
-	return rb_str_new((const char *) out, outlen);
+        return rb_str_new((const char *) out, outlen);
 }
 # endif
 
@@ -2522,9 +2600,9 @@ ossl_ssl_alpn_protocol(VALUE self)
 
     SSL_get0_alpn_selected(ssl, &out, &outlen);
     if (!outlen)
-	return Qnil;
+        return Qnil;
     else
-	return rb_str_new((const char *) out, outlen);
+        return rb_str_new((const char *) out, outlen);
 }
 
 /*
@@ -2557,15 +2635,15 @@ ossl_ssl_export_keying_material(int argc, VALUE *argv, VALUE self)
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (!NIL_P(context)) {
-	use_ctx = 1;
-	StringValue(context);
-	ctx = (unsigned char *)RSTRING_PTR(context);
-	ctx_len = RSTRING_LEN(context);
+        use_ctx = 1;
+        StringValue(context);
+        ctx = (unsigned char *)RSTRING_PTR(context);
+        ctx_len = RSTRING_LEN(context);
     }
     ret = SSL_export_keying_material(ssl, p, len, (char *)RSTRING_PTR(label),
-				     RSTRING_LENINT(label), ctx, ctx_len, use_ctx);
+                                     RSTRING_LENINT(label), ctx, ctx_len, use_ctx);
     if (ret == 0 || ret == -1) {
-	ossl_raise(eSSLError, "SSL_export_keying_material");
+        ossl_raise(eSSLError, "SSL_export_keying_material");
     }
     return str;
 }
@@ -2584,17 +2662,77 @@ ossl_ssl_tmp_key(VALUE self)
 
     GetSSL(self, ssl);
     if (!SSL_get_server_tmp_key(ssl, &key))
-	return Qnil;
-    return ossl_pkey_new(key);
+        return Qnil;
+    return ossl_pkey_wrap(key);
 }
+
+#ifdef HAVE_SSL_GET0_PEER_SIGNATURE_NAME
+/*
+ * call-seq:
+ *    ssl.sigalg => String or nil
+ *
+ * Returns the signature algorithm name, the IANA name of the signature scheme
+ * used by the local to sign the TLS handshake.
+ */
+static VALUE
+ossl_ssl_get_sigalg(VALUE self)
+{
+    SSL *ssl;
+    const char *name;
+
+    GetSSL(self, ssl);
+    if (!SSL_get0_signature_name(ssl, &name))
+        return Qnil;
+    return rb_str_new_cstr(name);
+}
+
+/*
+ * call-seq:
+ *    ssl.peer_sigalg => String or nil
+ *
+ * Returns the signature algorithm name, the IANA name of the signature scheme
+ * used by the peer to sign the TLS handshake.
+ */
+static VALUE
+ossl_ssl_get_peer_sigalg(VALUE self)
+{
+    SSL *ssl;
+    const char *name;
+
+    GetSSL(self, ssl);
+    if (!SSL_get0_peer_signature_name(ssl, &name))
+        return Qnil;
+    return rb_str_new_cstr(name);
+}
+#endif
+
+#ifdef HAVE_SSL_GET0_GROUP_NAME
+/*
+ * call-seq:
+ *    ssl.group => String or nil
+ *
+ * Returns the name of the group that was used for the key agreement of the
+ * current TLS session establishment.
+ */
+static VALUE
+ossl_ssl_get_group(VALUE self)
+{
+    SSL *ssl;
+    const char *name;
+
+    GetSSL(self, ssl);
+    if (!(name = SSL_get0_group_name(ssl)))
+        return Qnil;
+    return rb_str_new_cstr(name);
+}
+#endif
+
 #endif /* !defined(OPENSSL_NO_SOCK) */
 
 void
 Init_ossl_ssl(void)
 {
 #if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
     rb_mWaitReadable = rb_define_module_under(rb_cIO, "WaitReadable");
     rb_mWaitWritable = rb_define_module_under(rb_cIO, "WaitWritable");
 #endif
@@ -2603,15 +2741,12 @@ Init_ossl_ssl(void)
     id_call = rb_intern_const("call");
     ID_callback_state = rb_intern_const("callback_state");
 
-    ossl_ssl_ex_vcb_idx = SSL_get_ex_new_index(0, (void *)"ossl_ssl_ex_vcb_idx", 0, 0, 0);
-    if (ossl_ssl_ex_vcb_idx < 0)
-	ossl_raise(rb_eRuntimeError, "SSL_get_ex_new_index");
     ossl_ssl_ex_ptr_idx = SSL_get_ex_new_index(0, (void *)"ossl_ssl_ex_ptr_idx", 0, 0, 0);
     if (ossl_ssl_ex_ptr_idx < 0)
-	ossl_raise(rb_eRuntimeError, "SSL_get_ex_new_index");
+        ossl_raise(rb_eRuntimeError, "SSL_get_ex_new_index");
     ossl_sslctx_ex_ptr_idx = SSL_CTX_get_ex_new_index(0, (void *)"ossl_sslctx_ex_ptr_idx", 0, 0, 0);
     if (ossl_sslctx_ex_ptr_idx < 0)
-	ossl_raise(rb_eRuntimeError, "SSL_CTX_get_ex_new_index");
+        ossl_raise(rb_eRuntimeError, "SSL_CTX_get_ex_new_index");
 
     /* Document-module: OpenSSL::SSL
      *
@@ -2749,6 +2884,23 @@ Init_ossl_ssl(void)
      */
     rb_attr(cSSLContext, rb_intern_const("client_cert_cb"), 1, 1, Qfalse);
 
+#ifndef OPENSSL_NO_DH
+    /*
+     * A callback invoked when DH parameters are required for ephemeral DH key
+     * exchange.
+     *
+     * The callback is invoked with the SSLSocket, a
+     * flag indicating the use of an export cipher and the keylength
+     * required.
+     *
+     * The callback must return an OpenSSL::PKey::DH instance of the correct
+     * key length.
+     *
+     * <b>Deprecated in version 3.0.</b> Use #tmp_dh= instead.
+     */
+    rb_attr(cSSLContext, rb_intern_const("tmp_dh_callback"), 1, 1, Qfalse);
+#endif
+
     /*
      * Sets the context in which a session can be reused.  This allows
      * sessions for multiple applications to be distinguished, for example, by
@@ -2891,17 +3043,22 @@ Init_ossl_ssl(void)
 
     rb_define_alias(cSSLContext, "ssl_timeout", "timeout");
     rb_define_alias(cSSLContext, "ssl_timeout=", "timeout=");
-    rb_define_private_method(cSSLContext, "set_minmax_proto_version",
-			     ossl_sslctx_set_minmax_proto_version, 2);
+    rb_define_method(cSSLContext, "min_version=", ossl_sslctx_set_min_version, 1);
+    rb_define_method(cSSLContext, "max_version=", ossl_sslctx_set_max_version, 1);
     rb_define_method(cSSLContext, "ciphers",     ossl_sslctx_get_ciphers, 0);
     rb_define_method(cSSLContext, "ciphers=",    ossl_sslctx_set_ciphers, 1);
-#ifdef HAVE_SSL_CTX_SET_CIPHERSUITES
     rb_define_method(cSSLContext, "ciphersuites=", ossl_sslctx_set_ciphersuites, 1);
+#ifdef HAVE_SSL_CTX_SET1_SIGALGS_LIST // Not in LibreSSL yet
+    rb_define_method(cSSLContext, "sigalgs=", ossl_sslctx_set_sigalgs, 1);
+#endif
+#ifdef HAVE_SSL_CTX_SET1_CLIENT_SIGALGS_LIST // Not in LibreSSL or AWS-LC yet
+    rb_define_method(cSSLContext, "client_sigalgs=", ossl_sslctx_set_client_sigalgs, 1);
 #endif
 #ifndef OPENSSL_NO_DH
     rb_define_method(cSSLContext, "tmp_dh=", ossl_sslctx_set_tmp_dh, 1);
 #endif
-    rb_define_method(cSSLContext, "ecdh_curves=", ossl_sslctx_set_ecdh_curves, 1);
+    rb_define_method(cSSLContext, "groups=", ossl_sslctx_set_groups, 1);
+    rb_define_alias(cSSLContext, "ecdh_curves=", "groups=");
     rb_define_method(cSSLContext, "security_level", ossl_sslctx_get_security_level, 0);
     rb_define_method(cSSLContext, "security_level=", ossl_sslctx_set_security_level, 1);
 #ifdef SSL_MODE_SEND_FALLBACK_SCSV
@@ -3008,6 +3165,13 @@ Init_ossl_ssl(void)
 # ifdef OSSL_USE_NEXTPROTONEG
     rb_define_method(cSSLSocket, "npn_protocol", ossl_ssl_npn_protocol, 0);
 # endif
+#ifdef HAVE_SSL_GET0_PEER_SIGNATURE_NAME
+    rb_define_method(cSSLSocket, "sigalg", ossl_ssl_get_sigalg, 0);
+    rb_define_method(cSSLSocket, "peer_sigalg", ossl_ssl_get_peer_sigalg, 0);
+#endif
+#ifdef HAVE_SSL_GET0_GROUP_NAME
+    rb_define_method(cSSLSocket, "group", ossl_ssl_get_group, 0);
+#endif
 
     rb_define_const(mSSL, "VERIFY_NONE", INT2NUM(SSL_VERIFY_NONE));
     rb_define_const(mSSL, "VERIFY_PEER", INT2NUM(SSL_VERIFY_PEER));
@@ -3033,7 +3197,7 @@ Init_ossl_ssl(void)
 #ifdef SSL_OP_DISABLE_TLSEXT_CA_NAMES /* OpenSSL 3.0 */
     rb_define_const(mSSL, "OP_DISABLE_TLSEXT_CA_NAMES", ULONG2NUM(SSL_OP_DISABLE_TLSEXT_CA_NAMES));
 #endif
-#ifdef SSL_OP_ALLOW_NO_DHE_KEX /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_ALLOW_NO_DHE_KEX /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_ALLOW_NO_DHE_KEX", ULONG2NUM(SSL_OP_ALLOW_NO_DHE_KEX));
 #endif
     rb_define_const(mSSL, "OP_DONT_INSERT_EMPTY_FRAGMENTS", ULONG2NUM(SSL_OP_DONT_INSERT_EMPTY_FRAGMENTS));
@@ -3041,28 +3205,26 @@ Init_ossl_ssl(void)
     rb_define_const(mSSL, "OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION", ULONG2NUM(SSL_OP_NO_SESSION_RESUMPTION_ON_RENEGOTIATION));
     rb_define_const(mSSL, "OP_NO_COMPRESSION", ULONG2NUM(SSL_OP_NO_COMPRESSION));
     rb_define_const(mSSL, "OP_ALLOW_UNSAFE_LEGACY_RENEGOTIATION", ULONG2NUM(SSL_OP_ALLOW_UNSAFE_LEGACY_RENEGOTIATION));
-#ifdef SSL_OP_NO_ENCRYPT_THEN_MAC /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_NO_ENCRYPT_THEN_MAC /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_NO_ENCRYPT_THEN_MAC", ULONG2NUM(SSL_OP_NO_ENCRYPT_THEN_MAC));
 #endif
-#ifdef SSL_OP_ENABLE_MIDDLEBOX_COMPAT /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_ENABLE_MIDDLEBOX_COMPAT /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_ENABLE_MIDDLEBOX_COMPAT", ULONG2NUM(SSL_OP_ENABLE_MIDDLEBOX_COMPAT));
 #endif
-#ifdef SSL_OP_PRIORITIZE_CHACHA /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_PRIORITIZE_CHACHA /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_PRIORITIZE_CHACHA", ULONG2NUM(SSL_OP_PRIORITIZE_CHACHA));
 #endif
-#ifdef SSL_OP_NO_ANTI_REPLAY /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_NO_ANTI_REPLAY /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_NO_ANTI_REPLAY", ULONG2NUM(SSL_OP_NO_ANTI_REPLAY));
 #endif
     rb_define_const(mSSL, "OP_NO_SSLv3", ULONG2NUM(SSL_OP_NO_SSLv3));
     rb_define_const(mSSL, "OP_NO_TLSv1", ULONG2NUM(SSL_OP_NO_TLSv1));
     rb_define_const(mSSL, "OP_NO_TLSv1_1", ULONG2NUM(SSL_OP_NO_TLSv1_1));
     rb_define_const(mSSL, "OP_NO_TLSv1_2", ULONG2NUM(SSL_OP_NO_TLSv1_2));
-#ifdef SSL_OP_NO_TLSv1_3 /* OpenSSL 1.1.1 */
     rb_define_const(mSSL, "OP_NO_TLSv1_3", ULONG2NUM(SSL_OP_NO_TLSv1_3));
-#endif
     rb_define_const(mSSL, "OP_CIPHER_SERVER_PREFERENCE", ULONG2NUM(SSL_OP_CIPHER_SERVER_PREFERENCE));
     rb_define_const(mSSL, "OP_TLS_ROLLBACK_BUG", ULONG2NUM(SSL_OP_TLS_ROLLBACK_BUG));
-#ifdef SSL_OP_NO_RENEGOTIATION /* OpenSSL 1.1.1 */
+#ifdef SSL_OP_NO_RENEGOTIATION /* OpenSSL 1.1.1, missing in LibreSSL */
     rb_define_const(mSSL, "OP_NO_RENEGOTIATION", ULONG2NUM(SSL_OP_NO_RENEGOTIATION));
 #endif
     rb_define_const(mSSL, "OP_CRYPTOPRO_TLSEXT_BUG", ULONG2NUM(SSL_OP_CRYPTOPRO_TLSEXT_BUG));
@@ -3124,17 +3286,14 @@ Init_ossl_ssl(void)
     rb_define_const(mSSL, "TLS1_1_VERSION", INT2NUM(TLS1_1_VERSION));
     /* TLS 1.2 */
     rb_define_const(mSSL, "TLS1_2_VERSION", INT2NUM(TLS1_2_VERSION));
-#ifdef TLS1_3_VERSION /* OpenSSL 1.1.1 */
     /* TLS 1.3 */
     rb_define_const(mSSL, "TLS1_3_VERSION", INT2NUM(TLS1_3_VERSION));
-#endif
 
 
     sym_exception = ID2SYM(rb_intern_const("exception"));
     sym_wait_readable = ID2SYM(rb_intern_const("wait_readable"));
     sym_wait_writable = ID2SYM(rb_intern_const("wait_writable"));
 
-    id_tmp_dh_callback = rb_intern_const("tmp_dh_callback");
     id_npn_protocols_encoded = rb_intern_const("npn_protocols_encoded");
     id_each = rb_intern_const("each");
 
@@ -3165,9 +3324,11 @@ Init_ossl_ssl(void)
     DefIVarID(servername_cb);
     DefIVarID(verify_hostname);
     DefIVarID(keylog_cb);
+    DefIVarID(tmp_dh_callback);
 
     DefIVarID(io);
     DefIVarID(context);
     DefIVarID(hostname);
+    DefIVarID(sync_close);
 #endif /* !defined(OPENSSL_NO_SOCK) */
 }
diff --git a/ext/openssl/ossl_ssl.h b/ext/openssl/ossl_ssl.h
index 535c56097c..a87e62d450 100644
--- a/ext/openssl/ossl_ssl.h
+++ b/ext/openssl/ossl_ssl.h
@@ -5,23 +5,23 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_SSL_H_)
 #define _OSSL_SSL_H_
 
 #define GetSSL(obj, ssl) do { \
-	TypedData_Get_Struct((obj), SSL, &ossl_ssl_type, (ssl)); \
-	if (!(ssl)) { \
-		ossl_raise(rb_eRuntimeError, "SSL is not initialized"); \
-	} \
+    TypedData_Get_Struct((obj), SSL, &ossl_ssl_type, (ssl)); \
+    if (!(ssl)) { \
+        ossl_raise(rb_eRuntimeError, "SSL is not initialized"); \
+    } \
 } while (0)
 
 #define GetSSLSession(obj, sess) do { \
-	TypedData_Get_Struct((obj), SSL_SESSION, &ossl_ssl_session_type, (sess)); \
-	if (!(sess)) { \
-		ossl_raise(rb_eRuntimeError, "SSL Session wasn't initialized."); \
-	} \
+    TypedData_Get_Struct((obj), SSL_SESSION, &ossl_ssl_session_type, (sess)); \
+    if (!(sess)) { \
+        ossl_raise(rb_eRuntimeError, "SSL Session wasn't initialized."); \
+    } \
 } while (0)
 
 extern const rb_data_type_t ossl_ssl_type;
diff --git a/ext/openssl/ossl_ssl_session.c b/ext/openssl/ossl_ssl_session.c
index c5df902c60..8a2fbf4100 100644
--- a/ext/openssl/ossl_ssl_session.c
+++ b/ext/openssl/ossl_ssl_session.c
@@ -17,14 +17,14 @@ ossl_ssl_session_free(void *ptr)
 const rb_data_type_t ossl_ssl_session_type = {
     "OpenSSL/SSL/Session",
     {
-	0, ossl_ssl_session_free,
+        0, ossl_ssl_session_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
 
 static VALUE ossl_ssl_session_alloc(VALUE klass)
 {
-	return TypedData_Wrap_Struct(klass, &ossl_ssl_session_type, NULL);
+    return TypedData_Wrap_Struct(klass, &ossl_ssl_session_type, NULL);
 }
 
 /*
@@ -69,6 +69,7 @@ ossl_ssl_session_initialize(VALUE self, VALUE arg1)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_ssl_session_initialize_copy(VALUE self, VALUE other)
 {
@@ -79,9 +80,9 @@ ossl_ssl_session_initialize_copy(VALUE self, VALUE other)
     GetSSLSession(other, sess_other);
 
     sess_new = ASN1_dup((i2d_of_void *)i2d_SSL_SESSION, (d2i_of_void *)d2i_SSL_SESSION,
-			(char *)sess_other);
+                        (char *)sess_other);
     if (!sess_new)
-	ossl_raise(eSSLSession, "ASN1_dup");
+        ossl_raise(eSSLSession, "ASN1_dup");
 
     RTYPEDDATA_DATA(self) = sess_new;
     SSL_SESSION_free(sess);
@@ -98,9 +99,9 @@ ossl_SSL_SESSION_cmp(const SSL_SESSION *a, const SSL_SESSION *b)
     const unsigned char *b_sid = SSL_SESSION_get_id(b, &b_len);
 
     if (SSL_SESSION_get_protocol_version(a) != SSL_SESSION_get_protocol_version(b))
-	return 1;
+        return 1;
     if (a_len != b_len)
-	return 1;
+        return 1;
 
     return CRYPTO_memcmp(a_sid, b_sid, a_len);
 }
@@ -113,15 +114,15 @@ ossl_SSL_SESSION_cmp(const SSL_SESSION *a, const SSL_SESSION *b)
  */
 static VALUE ossl_ssl_session_eq(VALUE val1, VALUE val2)
 {
-	SSL_SESSION *ctx1, *ctx2;
+    SSL_SESSION *ctx1, *ctx2;
 
-	GetSSLSession(val1, ctx1);
-	GetSSLSession(val2, ctx2);
+    GetSSLSession(val1, ctx1);
+    GetSSLSession(val2, ctx2);
 
-	switch (ossl_SSL_SESSION_cmp(ctx1, ctx2)) {
-	case 0:		return Qtrue;
-	default:	return Qfalse;
-	}
+    switch (ossl_SSL_SESSION_cmp(ctx1, ctx2)) {
+      case 0:         return Qtrue;
+      default:        return Qfalse;
+    }
 }
 
 /*
@@ -139,7 +140,7 @@ ossl_ssl_session_get_time(VALUE self)
     GetSSLSession(self, ctx);
     t = SSL_SESSION_get_time(ctx);
     if (t == 0)
-	return Qnil;
+        return Qnil;
 
     return rb_funcall(rb_cTime, rb_intern("at"), 1, LONG2NUM(t));
 }
@@ -174,16 +175,16 @@ ossl_ssl_session_get_timeout(VALUE self)
  */
 static VALUE ossl_ssl_session_set_time(VALUE self, VALUE time_v)
 {
-	SSL_SESSION *ctx;
-	long t;
-
-	GetSSLSession(self, ctx);
-	if (rb_obj_is_instance_of(time_v, rb_cTime)) {
-		time_v = rb_funcall(time_v, rb_intern("to_i"), 0);
-	}
-	t = NUM2LONG(time_v);
-	SSL_SESSION_set_time(ctx, t);
-	return ossl_ssl_session_get_time(self);
+    SSL_SESSION *ctx;
+    long t;
+
+    GetSSLSession(self, ctx);
+    if (rb_obj_is_instance_of(time_v, rb_cTime)) {
+        time_v = rb_funcall(time_v, rb_intern("to_i"), 0);
+    }
+    t = NUM2LONG(time_v);
+    SSL_SESSION_set_time(ctx, t);
+    return ossl_ssl_session_get_time(self);
 }
 
 /*
@@ -194,13 +195,13 @@ static VALUE ossl_ssl_session_set_time(VALUE self, VALUE time_v)
  */
 static VALUE ossl_ssl_session_set_timeout(VALUE self, VALUE time_v)
 {
-	SSL_SESSION *ctx;
-	long t;
+    SSL_SESSION *ctx;
+    long t;
 
-	GetSSLSession(self, ctx);
-	t = NUM2LONG(time_v);
-	SSL_SESSION_set_timeout(ctx, t);
-	return ossl_ssl_session_get_timeout(self);
+    GetSSLSession(self, ctx);
+    t = NUM2LONG(time_v);
+    SSL_SESSION_set_timeout(ctx, t);
+    return ossl_ssl_session_get_timeout(self);
 }
 
 /*
@@ -208,18 +209,18 @@ static VALUE ossl_ssl_session_set_timeout(VALUE self, VALUE time_v)
  *    session.id -> String
  *
  * Returns the Session ID.
-*/
+ */
 static VALUE ossl_ssl_session_get_id(VALUE self)
 {
-	SSL_SESSION *ctx;
-	const unsigned char *p = NULL;
-	unsigned int i = 0;
+    SSL_SESSION *ctx;
+    const unsigned char *p = NULL;
+    unsigned int i = 0;
 
-	GetSSLSession(self, ctx);
+    GetSSLSession(self, ctx);
 
-	p = SSL_SESSION_get_id(ctx, &i);
+    p = SSL_SESSION_get_id(ctx, &i);
 
-	return rb_str_new((const char *) p, i);
+    return rb_str_new((const char *) p, i);
 }
 
 /*
@@ -230,22 +231,22 @@ static VALUE ossl_ssl_session_get_id(VALUE self)
  */
 static VALUE ossl_ssl_session_to_der(VALUE self)
 {
-	SSL_SESSION *ctx;
-	unsigned char *p;
-	int len;
-	VALUE str;
-
-	GetSSLSession(self, ctx);
-	len = i2d_SSL_SESSION(ctx, NULL);
-	if (len <= 0) {
-		ossl_raise(eSSLSession, "i2d_SSL_SESSION");
-	}
-
-	str = rb_str_new(0, len);
-	p = (unsigned char *)RSTRING_PTR(str);
-	i2d_SSL_SESSION(ctx, &p);
-	ossl_str_adjust(str, p);
-	return str;
+    SSL_SESSION *ctx;
+    unsigned char *p;
+    int len;
+    VALUE str;
+
+    GetSSLSession(self, ctx);
+    len = i2d_SSL_SESSION(ctx, NULL);
+    if (len <= 0) {
+        ossl_raise(eSSLSession, "i2d_SSL_SESSION");
+    }
+
+    str = rb_str_new(0, len);
+    p = (unsigned char *)RSTRING_PTR(str);
+    i2d_SSL_SESSION(ctx, &p);
+    ossl_str_adjust(str, p);
+    return str;
 }
 
 /*
@@ -256,22 +257,22 @@ static VALUE ossl_ssl_session_to_der(VALUE self)
  */
 static VALUE ossl_ssl_session_to_pem(VALUE self)
 {
-	SSL_SESSION *ctx;
-	BIO *out;
+    SSL_SESSION *ctx;
+    BIO *out;
 
-	GetSSLSession(self, ctx);
+    GetSSLSession(self, ctx);
 
-	if (!(out = BIO_new(BIO_s_mem()))) {
-		ossl_raise(eSSLSession, "BIO_s_mem()");
-	}
+    if (!(out = BIO_new(BIO_s_mem()))) {
+        ossl_raise(eSSLSession, "BIO_s_mem()");
+    }
 
-	if (!PEM_write_bio_SSL_SESSION(out, ctx)) {
-		BIO_free(out);
-		ossl_raise(eSSLSession, "SSL_SESSION_print()");
-	}
+    if (!PEM_write_bio_SSL_SESSION(out, ctx)) {
+        BIO_free(out);
+        ossl_raise(eSSLSession, "SSL_SESSION_print()");
+    }
 
 
-	return ossl_membio2str(out);
+    return ossl_membio2str(out);
 }
 
 
@@ -283,49 +284,44 @@ static VALUE ossl_ssl_session_to_pem(VALUE self)
  */
 static VALUE ossl_ssl_session_to_text(VALUE self)
 {
-	SSL_SESSION *ctx;
-	BIO *out;
+    SSL_SESSION *ctx;
+    BIO *out;
 
-	GetSSLSession(self, ctx);
+    GetSSLSession(self, ctx);
 
-	if (!(out = BIO_new(BIO_s_mem()))) {
-		ossl_raise(eSSLSession, "BIO_s_mem()");
-	}
+    if (!(out = BIO_new(BIO_s_mem()))) {
+        ossl_raise(eSSLSession, "BIO_s_mem()");
+    }
 
-	if (!SSL_SESSION_print(out, ctx)) {
-		BIO_free(out);
-		ossl_raise(eSSLSession, "SSL_SESSION_print()");
-	}
+    if (!SSL_SESSION_print(out, ctx)) {
+        BIO_free(out);
+        ossl_raise(eSSLSession, "SSL_SESSION_print()");
+    }
 
-	return ossl_membio2str(out);
+    return ossl_membio2str(out);
 }
 
 #endif /* !defined(OPENSSL_NO_SOCK) */
 
 void Init_ossl_ssl_session(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    mSSL = rb_define_module_under(mOSSL, "SSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-#endif
 #ifndef OPENSSL_NO_SOCK
-	cSSLSession = rb_define_class_under(mSSL, "Session", rb_cObject);
-	eSSLSession = rb_define_class_under(cSSLSession, "SessionError", eOSSLError);
-
-	rb_define_alloc_func(cSSLSession, ossl_ssl_session_alloc);
-	rb_define_method(cSSLSession, "initialize", ossl_ssl_session_initialize, 1);
-	rb_define_method(cSSLSession, "initialize_copy", ossl_ssl_session_initialize_copy, 1);
-
-	rb_define_method(cSSLSession, "==", ossl_ssl_session_eq, 1);
-
-	rb_define_method(cSSLSession, "time", ossl_ssl_session_get_time, 0);
-	rb_define_method(cSSLSession, "time=", ossl_ssl_session_set_time, 1);
-	rb_define_method(cSSLSession, "timeout", ossl_ssl_session_get_timeout, 0);
-	rb_define_method(cSSLSession, "timeout=", ossl_ssl_session_set_timeout, 1);
-	rb_define_method(cSSLSession, "id", ossl_ssl_session_get_id, 0);
-	rb_define_method(cSSLSession, "to_der", ossl_ssl_session_to_der, 0);
-	rb_define_method(cSSLSession, "to_pem", ossl_ssl_session_to_pem, 0);
-	rb_define_method(cSSLSession, "to_text", ossl_ssl_session_to_text, 0);
+    cSSLSession = rb_define_class_under(mSSL, "Session", rb_cObject);
+    eSSLSession = rb_define_class_under(cSSLSession, "SessionError", eOSSLError);
+
+    rb_define_alloc_func(cSSLSession, ossl_ssl_session_alloc);
+    rb_define_method(cSSLSession, "initialize", ossl_ssl_session_initialize, 1);
+    rb_define_method(cSSLSession, "initialize_copy", ossl_ssl_session_initialize_copy, 1);
+
+    rb_define_method(cSSLSession, "==", ossl_ssl_session_eq, 1);
+
+    rb_define_method(cSSLSession, "time", ossl_ssl_session_get_time, 0);
+    rb_define_method(cSSLSession, "time=", ossl_ssl_session_set_time, 1);
+    rb_define_method(cSSLSession, "timeout", ossl_ssl_session_get_timeout, 0);
+    rb_define_method(cSSLSession, "timeout=", ossl_ssl_session_set_timeout, 1);
+    rb_define_method(cSSLSession, "id", ossl_ssl_session_get_id, 0);
+    rb_define_method(cSSLSession, "to_der", ossl_ssl_session_to_der, 0);
+    rb_define_method(cSSLSession, "to_pem", ossl_ssl_session_to_pem, 0);
+    rb_define_method(cSSLSession, "to_text", ossl_ssl_session_to_text, 0);
 #endif /* !defined(OPENSSL_NO_SOCK) */
 }
diff --git a/ext/openssl/ossl_ts.c b/ext/openssl/ossl_ts.c
index b18a86aad9..317f7786aa 100644
--- a/ext/openssl/ossl_ts.c
+++ b/ext/openssl/ossl_ts.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licenced under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -103,7 +103,7 @@ static  const rb_data_type_t ossl_ts_resp_type = {
 static void
 ossl_ts_token_info_free(void *ptr)
 {
-        TS_TST_INFO_free(ptr);
+    TS_TST_INFO_free(ptr);
 }
 
 static const rb_data_type_t ossl_ts_token_info_type = {
@@ -132,41 +132,10 @@ asn1_to_der(void *template, int (*i2d)(void *template, unsigned char **pp))
     return str;
 }
 
-static ASN1_OBJECT*
-obj_to_asn1obj(VALUE obj)
-{
-    ASN1_OBJECT *a1obj;
-
-    StringValue(obj);
-    a1obj = OBJ_txt2obj(RSTRING_PTR(obj), 0);
-    if(!a1obj) a1obj = OBJ_txt2obj(RSTRING_PTR(obj), 1);
-    if(!a1obj) ossl_raise(eASN1Error, "invalid OBJECT ID");
-
-    return a1obj;
-}
-
 static VALUE
 obj_to_asn1obj_i(VALUE obj)
 {
-    return (VALUE)obj_to_asn1obj(obj);
-}
-
-static VALUE
-get_asn1obj(ASN1_OBJECT *obj)
-{
-    BIO *out;
-    VALUE ret;
-    int nid;
-    if ((nid = OBJ_obj2nid(obj)) != NID_undef)
-        ret = rb_str_new2(OBJ_nid2sn(nid));
-    else{
-        if (!(out = BIO_new(BIO_s_mem())))
-            ossl_raise(eX509AttrError, NULL);
-        i2a_ASN1_OBJECT(out, obj);
-        ret = ossl_membio2str(out);
-    }
-
-    return ret;
+    return (VALUE)ossl_to_asn1obj(obj);
 }
 
 static VALUE
@@ -199,7 +168,7 @@ ossl_ts_req_alloc(VALUE klass)
 static VALUE
 ossl_ts_req_initialize(int argc, VALUE *argv, VALUE self)
 {
-    TS_REQ *ts_req = DATA_PTR(self);
+    TS_REQ *req, *req_orig = DATA_PTR(self);
     BIO *in;
     VALUE arg;
 
@@ -209,13 +178,14 @@ ossl_ts_req_initialize(int argc, VALUE *argv, VALUE self)
 
     arg = ossl_to_der_if_possible(arg);
     in = ossl_obj2bio(&arg);
-    ts_req = d2i_TS_REQ_bio(in, &ts_req);
+    req = d2i_TS_REQ_bio(in, NULL);
     BIO_free(in);
-    if (!ts_req) {
-        DATA_PTR(self) = NULL;
-        ossl_raise(eTimestampError, "Error when decoding the timestamp request");
+    if (!req) {
+        ossl_raise(eTimestampError,
+                   "Error when decoding the timestamp request");
     }
-    DATA_PTR(self) = ts_req;
+    TS_REQ_free(req_orig);
+    RTYPEDDATA_DATA(self) = req;
 
     return self;
 }
@@ -233,11 +203,13 @@ ossl_ts_req_get_algorithm(VALUE self)
     TS_REQ *req;
     TS_MSG_IMPRINT *mi;
     X509_ALGOR *algor;
+    const ASN1_OBJECT *obj;
 
     GetTSRequest(self, req);
     mi = TS_REQ_get_msg_imprint(req);
     algor = TS_MSG_IMPRINT_get_algo(mi);
-    return get_asn1obj(algor->algorithm);
+    X509_ALGOR_get0(&obj, NULL, NULL, algor);
+    return ossl_asn1obj_to_string(obj);
 }
 
 /*
@@ -259,7 +231,7 @@ ossl_ts_req_set_algorithm(VALUE self, VALUE algo)
     X509_ALGOR *algor;
 
     GetTSRequest(self, req);
-    obj = obj_to_asn1obj(algo);
+    obj = ossl_to_asn1obj(algo);
     mi = TS_REQ_get_msg_imprint(req);
     algor = TS_MSG_IMPRINT_get_algo(mi);
     if (!X509_ALGOR_set0(algor, obj, V_ASN1_NULL, NULL)) {
@@ -288,7 +260,7 @@ ossl_ts_req_get_msg_imprint(VALUE self)
     mi = TS_REQ_get_msg_imprint(req);
     hashed_msg = TS_MSG_IMPRINT_get_msg(mi);
 
-    ret = rb_str_new((const char *)hashed_msg->data, hashed_msg->length);
+    ret = asn1str_to_str(hashed_msg);
 
     return ret;
 }
@@ -366,7 +338,7 @@ ossl_ts_req_get_policy_id(VALUE self)
     GetTSRequest(self, req);
     if (!TS_REQ_get_policy_id(req))
         return Qnil;
-    return get_asn1obj(TS_REQ_get_policy_id(req));
+    return ossl_asn1obj_to_string(TS_REQ_get_policy_id(req));
 }
 
 /*
@@ -389,7 +361,7 @@ ossl_ts_req_set_policy_id(VALUE self, VALUE oid)
     int ok;
 
     GetTSRequest(self, req);
-    obj = obj_to_asn1obj(oid);
+    obj = ossl_to_asn1obj(oid);
     ok = TS_REQ_set_policy_id(req, obj);
     ASN1_OBJECT_free(obj);
     if (!ok)
@@ -487,17 +459,19 @@ ossl_ts_req_to_der(VALUE self)
     TS_REQ *req;
     TS_MSG_IMPRINT *mi;
     X509_ALGOR *algo;
+    const ASN1_OBJECT *obj;
     ASN1_OCTET_STRING *hashed_msg;
 
     GetTSRequest(self, req);
     mi = TS_REQ_get_msg_imprint(req);
 
     algo = TS_MSG_IMPRINT_get_algo(mi);
-    if (OBJ_obj2nid(algo->algorithm) == NID_undef)
+    X509_ALGOR_get0(&obj, NULL, NULL, algo);
+    if (OBJ_obj2nid(obj) == NID_undef)
         ossl_raise(eTimestampError, "Message imprint missing algorithm");
 
     hashed_msg = TS_MSG_IMPRINT_get_msg(mi);
-    if (!hashed_msg->length)
+    if (!ASN1_STRING_length(hashed_msg))
         ossl_raise(eTimestampError, "Message imprint missing hashed message");
 
     return asn1_to_der((void *)req, (int (*)(void *, unsigned char **))i2d_TS_REQ);
@@ -549,18 +523,19 @@ ossl_ts_resp_alloc(VALUE klass)
 static VALUE
 ossl_ts_resp_initialize(VALUE self, VALUE der)
 {
-    TS_RESP *ts_resp = DATA_PTR(self);
+    TS_RESP *resp, *resp_orig = DATA_PTR(self);
     BIO *in;
 
     der = ossl_to_der_if_possible(der);
-    in  = ossl_obj2bio(&der);
-    ts_resp = d2i_TS_RESP_bio(in, &ts_resp);
+    in = ossl_obj2bio(&der);
+    resp = d2i_TS_RESP_bio(in, NULL);
     BIO_free(in);
-    if (!ts_resp) {
-        DATA_PTR(self) = NULL;
-        ossl_raise(eTimestampError, "Error when decoding the timestamp response");
+    if (!resp) {
+        ossl_raise(eTimestampError,
+                   "Error when decoding the timestamp response");
     }
-    DATA_PTR(self) = ts_resp;
+    TS_RESP_free(resp_orig);
+    RTYPEDDATA_DATA(self) = resp;
 
     return self;
 }
@@ -617,14 +592,7 @@ ossl_ts_resp_get_failure_info(VALUE self)
 {
     TS_RESP *resp;
     TS_STATUS_INFO *si;
-
-    /* The ASN1_BIT_STRING_get_bit changed from 1.0.0. to 1.1.0, making this
-     * const. */
-    #if defined(HAVE_TS_STATUS_INFO_GET0_FAILURE_INFO)
     const ASN1_BIT_STRING *fi;
-    #else
-    ASN1_BIT_STRING *fi;
-    #endif
 
     GetTSResponse(self, resp);
     si = TS_RESP_get_status_info(resp);
@@ -691,21 +659,12 @@ static VALUE
 ossl_ts_resp_get_token(VALUE self)
 {
     TS_RESP *resp;
-    PKCS7 *p7, *copy;
-    VALUE obj;
+    PKCS7 *p7;
 
     GetTSResponse(self, resp);
     if (!(p7 = TS_RESP_get_token(resp)))
         return Qnil;
-
-    obj = NewPKCS7(cPKCS7);
-
-    if (!(copy = PKCS7_dup(p7)))
-        ossl_raise(eTimestampError, NULL);
-
-    SetPKCS7(obj, copy);
-
-    return obj;
+    return ossl_pkcs7_new(p7);
 }
 
 /*
@@ -749,7 +708,7 @@ ossl_ts_resp_get_tsa_certificate(VALUE self)
     TS_RESP *resp;
     PKCS7 *p7;
     PKCS7_SIGNER_INFO *ts_info;
-    X509 *cert;
+    const X509 *cert;
 
     GetTSResponse(self, resp);
     if (!(p7 = TS_RESP_get_token(resp)))
@@ -864,16 +823,26 @@ ossl_ts_resp_verify(int argc, VALUE *argv, VALUE self)
         X509_up_ref(cert);
     }
 
+    if (!X509_STORE_up_ref(x509st)) {
+        sk_X509_pop_free(x509inter, X509_free);
+        TS_VERIFY_CTX_free(ctx);
+        ossl_raise(eTimestampError, "X509_STORE_up_ref");
+    }
+
+#ifdef HAVE_TS_VERIFY_CTX_SET0_CERTS
+    TS_VERIFY_CTX_set0_certs(ctx, x509inter);
+    TS_VERIFY_CTX_set0_store(ctx, x509st);
+#else
+# if OSSL_OPENSSL_PREREQ(3, 0, 0) || OSSL_IS_LIBRESSL
     TS_VERIFY_CTX_set_certs(ctx, x509inter);
-    TS_VERIFY_CTX_add_flags(ctx, TS_VFY_SIGNATURE);
+# else
+    TS_VERIFY_CTS_set_certs(ctx, x509inter);
+# endif
     TS_VERIFY_CTX_set_store(ctx, x509st);
+#endif
+    TS_VERIFY_CTX_add_flags(ctx, TS_VFY_SIGNATURE);
 
     ok = TS_RESP_verify_response(ctx, resp);
-    /*
-     * TS_VERIFY_CTX_set_store() call above does not increment the reference
-     * counter, so it must be unset before TS_VERIFY_CTX_free() is called.
-     */
-    TS_VERIFY_CTX_set_store(ctx, NULL);
     TS_VERIFY_CTX_free(ctx);
 
     if (!ok)
@@ -909,18 +878,19 @@ ossl_ts_token_info_alloc(VALUE klass)
 static VALUE
 ossl_ts_token_info_initialize(VALUE self, VALUE der)
 {
-    TS_TST_INFO *info = DATA_PTR(self);
+    TS_TST_INFO *info, *info_orig = DATA_PTR(self);
     BIO *in;
 
     der = ossl_to_der_if_possible(der);
-    in  = ossl_obj2bio(&der);
-    info = d2i_TS_TST_INFO_bio(in, &info);
+    in = ossl_obj2bio(&der);
+    info = d2i_TS_TST_INFO_bio(in, NULL);
     BIO_free(in);
     if (!info) {
-        DATA_PTR(self) = NULL;
-        ossl_raise(eTimestampError, "Error when decoding the timestamp token info");
+        ossl_raise(eTimestampError,
+                   "Error when decoding the timestamp token info");
     }
-    DATA_PTR(self) = info;
+    TS_TST_INFO_free(info_orig);
+    RTYPEDDATA_DATA(self) = info;
 
     return self;
 }
@@ -960,7 +930,7 @@ ossl_ts_token_info_get_policy_id(VALUE self)
     TS_TST_INFO *info;
 
     GetTSTokenInfo(self, info);
-    return get_asn1obj(TS_TST_INFO_get_policy_id(info));
+    return ossl_asn1obj_to_string(TS_TST_INFO_get_policy_id(info));
 }
 
 /*
@@ -982,11 +952,13 @@ ossl_ts_token_info_get_algorithm(VALUE self)
     TS_TST_INFO *info;
     TS_MSG_IMPRINT *mi;
     X509_ALGOR *algo;
+    const ASN1_OBJECT *obj;
 
     GetTSTokenInfo(self, info);
     mi = TS_TST_INFO_get_msg_imprint(info);
     algo = TS_MSG_IMPRINT_get_algo(mi);
-    return get_asn1obj(algo->algorithm);
+    X509_ALGOR_get0(&obj, NULL, NULL, algo);
+    return ossl_asn1obj_to_string(obj);
 }
 
 /*
@@ -1012,7 +984,7 @@ ossl_ts_token_info_get_msg_imprint(VALUE self)
     GetTSTokenInfo(self, info);
     mi = TS_TST_INFO_get_msg_imprint(info);
     hashed_msg = TS_MSG_IMPRINT_get_msg(mi);
-    ret = rb_str_new((const char *)hashed_msg->data, hashed_msg->length);
+    ret = asn1str_to_str(hashed_msg);
 
     return ret;
 }
@@ -1152,9 +1124,14 @@ ossl_tsfac_time_cb(struct TS_resp_ctx *ctx, void *data, time_t *sec, long *usec)
 }
 
 static VALUE
-ossl_evp_get_digestbyname_i(VALUE arg)
+ossl_evp_md_fetch_i(VALUE args_)
 {
-    return (VALUE)ossl_evp_get_digestbyname(arg);
+    VALUE *args = (VALUE *)args_, md_holder;
+    const EVP_MD *md;
+
+    md = ossl_evp_md_fetch(args[1], &md_holder);
+    rb_ary_push(args[0], md_holder);
+    return (VALUE)md;
 }
 
 static VALUE
@@ -1190,7 +1167,8 @@ ossl_obj2bio_i(VALUE arg)
 static VALUE
 ossl_tsfac_create_ts(VALUE self, VALUE key, VALUE certificate, VALUE request)
 {
-    VALUE serial_number, def_policy_id, gen_time, additional_certs, allowed_digests;
+    VALUE serial_number, def_policy_id, gen_time, additional_certs,
+          allowed_digests, allowed_digests_tmp = Qnil;
     VALUE str;
     STACK_OF(X509) *inter_certs;
     VALUE tsresp, ret = Qnil;
@@ -1251,7 +1229,7 @@ ossl_tsfac_create_ts(VALUE self, VALUE key, VALUE certificate, VALUE request)
     if (rb_obj_is_kind_of(additional_certs, rb_cArray)) {
         inter_certs = ossl_protect_x509_ary2sk(additional_certs, &status);
         if (status)
-                goto end;
+            goto end;
 
         /* this dups the sk_X509 and ups each cert's ref count */
         TS_RESP_CTX_set_certs(ctx, inter_certs);
@@ -1267,16 +1245,18 @@ ossl_tsfac_create_ts(VALUE self, VALUE key, VALUE certificate, VALUE request)
 
     allowed_digests = ossl_tsfac_get_allowed_digests(self);
     if (rb_obj_is_kind_of(allowed_digests, rb_cArray)) {
-        int i;
-        VALUE rbmd;
-        const EVP_MD *md;
-
-        for (i = 0; i < RARRAY_LEN(allowed_digests); i++) {
-            rbmd = rb_ary_entry(allowed_digests, i);
-            md = (const EVP_MD *)rb_protect(ossl_evp_get_digestbyname_i, rbmd, &status);
+        allowed_digests_tmp = rb_ary_new_capa(RARRAY_LEN(allowed_digests));
+        for (long i = 0; i < RARRAY_LEN(allowed_digests); i++) {
+            VALUE args[] = {
+                allowed_digests_tmp,
+                rb_ary_entry(allowed_digests, i),
+            };
+            const EVP_MD *md = (const EVP_MD *)rb_protect(ossl_evp_md_fetch_i,
+                                                          (VALUE)args, &status);
             if (status)
                 goto end;
-            TS_RESP_CTX_add_md(ctx, md);
+            if (!TS_RESP_CTX_add_md(ctx, md))
+                goto end;
         }
     }
 
@@ -1290,6 +1270,7 @@ ossl_tsfac_create_ts(VALUE self, VALUE key, VALUE certificate, VALUE request)
 
     response = TS_RESP_create_response(ctx, req_bio);
     BIO_free(req_bio);
+    RB_GC_GUARD(allowed_digests_tmp);
 
     if (!response) {
         err_msg = "Error during response generation";
@@ -1303,7 +1284,7 @@ ossl_tsfac_create_ts(VALUE self, VALUE key, VALUE certificate, VALUE request)
     SetTSResponse(tsresp, response);
     ret = tsresp;
 
-end:
+  end:
     ASN1_INTEGER_free(asn1_serial);
     ASN1_OBJECT_free(def_policy_id_obj);
     TS_RESP_CTX_free(ctx);
@@ -1320,10 +1301,6 @@ end:
 void
 Init_ossl_ts(void)
 {
-    #if 0
-    mOSSL = rb_define_module("OpenSSL"); /* let rdoc know about mOSSL */
-    #endif
-
     /*
      * Possible return value for +Response#failure_info+. Indicates that the
      * timestamp server rejects the message imprint algorithm used in the
@@ -1533,67 +1510,45 @@ Init_ossl_ts(void)
      *      fac.default_policy_id = '1.2.3.4.5'
      *      fac.additional_certificates = [ inter1, inter2 ]
      *      timestamp = fac.create_timestamp(p12.key, p12.certificate, req)
-     *
-     * ==Attributes
-     *
-     * ===default_policy_id
+     */
+    cTimestampFactory = rb_define_class_under(mTimestamp, "Factory", rb_cObject);
+    /*
+     * The list of digest algorithms that the factory is allowed
+     * create timestamps for. Known vulnerable or weak algorithms should not be
+     * allowed where possible. Must be an Array of String or OpenSSL::Digest
+     * subclass instances.
+     */
+    rb_attr(cTimestampFactory, rb_intern_const("allowed_digests"), 1, 1, 0);
+    /*
+     * A String representing the default policy object identifier, or +nil+.
      *
      * Request#policy_id will always be preferred over this if present in the
-     * Request, only if Request#policy_id is nil default_policy will be used.
+     * Request, only if Request#policy_id is +nil+ default_policy will be used.
      * If none of both is present, a TimestampError will be raised when trying
      * to create a Response.
-     *
-     * call-seq:
-     *       factory.default_policy_id = "string" -> string
-     *       factory.default_policy_id            -> string or nil
-     *
-     * ===serial_number
-     *
-     * Sets or retrieves the serial number to be used for timestamp creation.
-     * Must be present for timestamp creation.
-     *
-     * call-seq:
-     *       factory.serial_number = number -> number
-     *       factory.serial_number          -> number or nil
-     *
-     * ===gen_time
-     *
-     * Sets or retrieves the Time value to be used in the Response. Must be
-     * present for timestamp creation.
-     *
-     * call-seq:
-     *       factory.gen_time = Time -> Time
-     *       factory.gen_time        -> Time or nil
-     *
-     * ===additional_certs
-     *
-     * Sets or retrieves additional certificates apart from the timestamp
-     * certificate (e.g. intermediate certificates) to be added to the Response.
-     * Must be an Array of OpenSSL::X509::Certificate.
-     *
-     * call-seq:
-     *       factory.additional_certs = [cert1, cert2] -> [ cert1, cert2 ]
-     *       factory.additional_certs                  -> array or nil
-     *
-     * ===allowed_digests
-     *
-     * Sets or retrieves the digest algorithms that the factory is allowed
-     * create timestamps for. Known vulnerable or weak algorithms should not be
-     * allowed where possible.
-     * Must be an Array of String or OpenSSL::Digest subclass instances.
-     *
-     * call-seq:
-     *       factory.allowed_digests = ["sha1", OpenSSL::Digest.new('SHA256').new] -> [ "sha1", OpenSSL::Digest) ]
-     *       factory.allowed_digests                                               -> array or nil
-     *
      */
-    cTimestampFactory = rb_define_class_under(mTimestamp, "Factory", rb_cObject);
-    rb_attr(cTimestampFactory, rb_intern_const("allowed_digests"), 1, 1, 0);
     rb_attr(cTimestampFactory, rb_intern_const("default_policy_id"), 1, 1, 0);
+    /*
+     * The serial number to be used for timestamp creation. Must be present for
+     * timestamp creation. Must be an instance of OpenSSL::BN or Integer.
+     */
     rb_attr(cTimestampFactory, rb_intern_const("serial_number"), 1, 1, 0);
+    /*
+     * The Time value to be used in the Response. Must be present for timestamp
+     * creation.
+     */
     rb_attr(cTimestampFactory, rb_intern_const("gen_time"), 1, 1, 0);
+    /*
+     * Additional certificates apart from the timestamp certificate (e.g.
+     * intermediate certificates) to be added to the Response.
+     * Must be an Array of OpenSSL::X509::Certificate, or +nil+.
+     */
     rb_attr(cTimestampFactory, rb_intern_const("additional_certs"), 1, 1, 0);
     rb_define_method(cTimestampFactory, "create_timestamp", ossl_tsfac_create_ts, 3);
 }
-
+#else /* OPENSSL_NO_TS */
+void
+Init_ossl_ts(void)
+{
+}
 #endif
diff --git a/ext/openssl/ossl_ts.h b/ext/openssl/ossl_ts.h
index 25fb0e1d64..eeca3046eb 100644
--- a/ext/openssl/ossl_ts.h
+++ b/ext/openssl/ossl_ts.h
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licenced under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 
 #if !defined(_OSSL_TS_H_)
diff --git a/ext/openssl/ossl_x509.c b/ext/openssl/ossl_x509.c
index f8470703fc..bc3914fda2 100644
--- a/ext/openssl/ossl_x509.c
+++ b/ext/openssl/ossl_x509.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,7 +13,8 @@ VALUE mX509;
 
 #define DefX509Const(x) rb_define_const(mX509, #x, INT2NUM(X509_##x))
 #define DefX509Default(x,i) \
-  rb_define_const(mX509, "DEFAULT_" #x, rb_str_new2(X509_get_default_##i()))
+    rb_define_const(mX509, "DEFAULT_" #x, \
+                    rb_obj_freeze(rb_str_new_cstr(X509_get_default_##i())))
 
 ASN1_TIME *
 ossl_x509_time_adjust(ASN1_TIME *s, VALUE time)
@@ -29,10 +30,6 @@ ossl_x509_time_adjust(ASN1_TIME *s, VALUE time)
 void
 Init_ossl_x509(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-#endif
-
     mX509 = rb_define_module_under(mOSSL, "X509");
 
     Init_ossl_x509attr();
@@ -48,9 +45,7 @@ Init_ossl_x509(void)
 
     /* Certificate verification error code */
     DefX509Const(V_OK);
-#if defined(X509_V_ERR_UNSPECIFIED) /* 1.0.1r, 1.0.2f, 1.1.0 */
     DefX509Const(V_ERR_UNSPECIFIED);
-#endif
     DefX509Const(V_ERR_UNABLE_TO_GET_ISSUER_CERT);
     DefX509Const(V_ERR_UNABLE_TO_GET_CRL);
     DefX509Const(V_ERR_UNABLE_TO_DECRYPT_CERT_SIGNATURE);
@@ -104,10 +99,10 @@ Init_ossl_x509(void)
     DefX509Const(V_ERR_UNSUPPORTED_CONSTRAINT_SYNTAX);
     DefX509Const(V_ERR_UNSUPPORTED_NAME_SYNTAX);
     DefX509Const(V_ERR_CRL_PATH_VALIDATION_ERROR);
-#if defined(X509_V_ERR_PATH_LOOP)
+#if defined(X509_V_ERR_PATH_LOOP) /* OpenSSL 1.1.0, missing in LibreSSL */
     DefX509Const(V_ERR_PATH_LOOP);
 #endif
-#if defined(X509_V_ERR_SUITE_B_INVALID_VERSION)
+#if defined(X509_V_ERR_SUITE_B_INVALID_VERSION) /* OpenSSL 1.1.0, missing in LibreSSL */
     DefX509Const(V_ERR_SUITE_B_INVALID_VERSION);
     DefX509Const(V_ERR_SUITE_B_INVALID_ALGORITHM);
     DefX509Const(V_ERR_SUITE_B_INVALID_CURVE);
@@ -118,27 +113,21 @@ Init_ossl_x509(void)
     DefX509Const(V_ERR_HOSTNAME_MISMATCH);
     DefX509Const(V_ERR_EMAIL_MISMATCH);
     DefX509Const(V_ERR_IP_ADDRESS_MISMATCH);
-#if defined(X509_V_ERR_DANE_NO_MATCH)
+#if defined(X509_V_ERR_DANE_NO_MATCH) /* OpenSSL 1.1.0, missing in LibreSSL */
     DefX509Const(V_ERR_DANE_NO_MATCH);
 #endif
-#if defined(X509_V_ERR_EE_KEY_TOO_SMALL)
     DefX509Const(V_ERR_EE_KEY_TOO_SMALL);
     DefX509Const(V_ERR_CA_KEY_TOO_SMALL);
     DefX509Const(V_ERR_CA_MD_TOO_WEAK);
-#endif
-#if defined(X509_V_ERR_INVALID_CALL)
     DefX509Const(V_ERR_INVALID_CALL);
-#endif
-#if defined(X509_V_ERR_STORE_LOOKUP)
     DefX509Const(V_ERR_STORE_LOOKUP);
-#endif
-#if defined(X509_V_ERR_NO_VALID_SCTS)
+#if defined(X509_V_ERR_NO_VALID_SCTS) /* OpenSSL 1.1.0, missing in LibreSSL */
     DefX509Const(V_ERR_NO_VALID_SCTS);
 #endif
-#if defined(X509_V_ERR_PROXY_SUBJECT_NAME_VIOLATION)
+#if defined(X509_V_ERR_PROXY_SUBJECT_NAME_VIOLATION) /* OpenSSL 1.1.0, missing in LibreSSL */
     DefX509Const(V_ERR_PROXY_SUBJECT_NAME_VIOLATION);
 #endif
-#if defined(X509_V_ERR_OCSP_VERIFY_NEEDED)
+#if defined(X509_V_ERR_OCSP_VERIFY_NEEDED) /* OpenSSL 1.1.1, missing in LibreSSL */
     DefX509Const(V_ERR_OCSP_VERIFY_NEEDED);
     DefX509Const(V_ERR_OCSP_VERIFY_FAILED);
     DefX509Const(V_ERR_OCSP_CERT_UNKNOWN);
@@ -189,17 +178,13 @@ Init_ossl_x509(void)
      * certificate chain, search the Store first for the issuer certificate.
      * Enabled by default in OpenSSL >= 1.1.0. */
     DefX509Const(V_FLAG_TRUSTED_FIRST);
-#if defined(X509_V_FLAG_SUITEB_128_LOS_ONLY)
+#if defined(X509_V_FLAG_SUITEB_128_LOS_ONLY) /* OpenSSL 1.1.0, missing in LibreSSL */
     /* Set by Store#flags= and StoreContext#flags=.
      * Enables Suite B 128 bit only mode. */
     DefX509Const(V_FLAG_SUITEB_128_LOS_ONLY);
-#endif
-#if defined(X509_V_FLAG_SUITEB_192_LOS)
     /* Set by Store#flags= and StoreContext#flags=.
      * Enables Suite B 192 bit only mode. */
     DefX509Const(V_FLAG_SUITEB_192_LOS);
-#endif
-#if defined(X509_V_FLAG_SUITEB_128_LOS)
     /* Set by Store#flags= and StoreContext#flags=.
      * Enables Suite B 128 bit mode allowing 192 bit algorithms. */
     DefX509Const(V_FLAG_SUITEB_128_LOS);
@@ -207,17 +192,13 @@ Init_ossl_x509(void)
     /* Set by Store#flags= and StoreContext#flags=.
      * Allows partial chains if at least one certificate is in trusted store. */
     DefX509Const(V_FLAG_PARTIAL_CHAIN);
-#if defined(X509_V_FLAG_NO_ALT_CHAINS)
     /* Set by Store#flags= and StoreContext#flags=. Suppresses searching for
      * a alternative chain. No effect in OpenSSL >= 1.1.0. */
     DefX509Const(V_FLAG_NO_ALT_CHAINS);
-#endif
-#if defined(X509_V_FLAG_NO_CHECK_TIME)
     /* Set by Store#flags= and StoreContext#flags=. Suppresses checking the
      * validity period of certificates and CRLs. No effect when the current
      * time is explicitly set by Store#time= or StoreContext#time=. */
     DefX509Const(V_FLAG_NO_CHECK_TIME);
-#endif
 
     /* Set by Store#purpose=. SSL/TLS client. */
     DefX509Const(PURPOSE_SSL_CLIENT);
diff --git a/ext/openssl/ossl_x509.h b/ext/openssl/ossl_x509.h
index 4fadfa6b82..71932ef1a9 100644
--- a/ext/openssl/ossl_x509.h
+++ b/ext/openssl/ossl_x509.h
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #if !defined(_OSSL_X509_H_)
 #define _OSSL_X509_H_
@@ -28,9 +28,8 @@ void Init_ossl_x509(void);
  * X509Attr
  */
 extern VALUE cX509Attr;
-extern VALUE eX509AttrError;
 
-VALUE ossl_x509attr_new(X509_ATTRIBUTE *);
+VALUE ossl_x509attr_new(const X509_ATTRIBUTE *);
 X509_ATTRIBUTE *GetX509AttrPtr(VALUE);
 void Init_ossl_x509attr(void);
 
@@ -38,9 +37,8 @@ void Init_ossl_x509attr(void);
  * X509Cert
  */
 extern VALUE cX509Cert;
-extern VALUE eX509CertError;
 
-VALUE ossl_x509_new(X509 *);
+VALUE ossl_x509_new(const X509 *);
 X509 *GetX509CertPtr(VALUE);
 X509 *DupX509CertPtr(VALUE);
 void Init_ossl_x509cert(void);
@@ -48,10 +46,7 @@ void Init_ossl_x509cert(void);
 /*
  * X509CRL
  */
-extern VALUE cX509CRL;
-extern VALUE eX509CRLError;
-
-VALUE ossl_x509crl_new(X509_CRL *);
+VALUE ossl_x509crl_new(const X509_CRL *);
 X509_CRL *GetX509CRLPtr(VALUE);
 void Init_ossl_x509crl(void);
 
@@ -59,29 +54,21 @@ void Init_ossl_x509crl(void);
  * X509Extension
  */
 extern VALUE cX509Ext;
-extern VALUE cX509ExtFactory;
-extern VALUE eX509ExtError;
 
-VALUE ossl_x509ext_new(X509_EXTENSION *);
+VALUE ossl_x509ext_new(const X509_EXTENSION *);
 X509_EXTENSION *GetX509ExtPtr(VALUE);
 void Init_ossl_x509ext(void);
 
 /*
  * X509Name
  */
-extern VALUE cX509Name;
-extern VALUE eX509NameError;
-
-VALUE ossl_x509name_new(X509_NAME *);
+VALUE ossl_x509name_new(const X509_NAME *);
 X509_NAME *GetX509NamePtr(VALUE);
 void Init_ossl_x509name(void);
 
 /*
  * X509Request
  */
-extern VALUE cX509Req;
-extern VALUE eX509ReqError;
-
 X509_REQ *GetX509ReqPtr(VALUE);
 void Init_ossl_x509req(void);
 
@@ -89,21 +76,15 @@ void Init_ossl_x509req(void);
  * X509Revoked
  */
 extern VALUE cX509Rev;
-extern VALUE eX509RevError;
 
-VALUE ossl_x509revoked_new(X509_REVOKED *);
+VALUE ossl_x509revoked_new(const X509_REVOKED *);
 X509_REVOKED *DupX509RevokedPtr(VALUE);
 void Init_ossl_x509revoked(void);
 
 /*
  * X509Store and X509StoreContext
  */
-extern VALUE cX509Store;
-extern VALUE cX509StoreContext;
-extern VALUE eX509StoreError;
-
 X509_STORE *GetX509StorePtr(VALUE);
-
 void Init_ossl_x509store(void);
 
 /*
diff --git a/ext/openssl/ossl_x509attr.c b/ext/openssl/ossl_x509attr.c
index d1d8bb5e95..38600b9b00 100644
--- a/ext/openssl/ossl_x509attr.c
+++ b/ext/openssl/ossl_x509attr.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,14 +13,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509attr_type, 0)
 #define SetX509Attr(obj, attr) do { \
     if (!(attr)) { \
-	ossl_raise(rb_eRuntimeError, "ATTR wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "ATTR wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (attr); \
 } while (0)
 #define GetX509Attr(obj, attr) do { \
     TypedData_Get_Struct((obj), X509_ATTRIBUTE, &ossl_x509attr_type, (attr)); \
     if (!(attr)) { \
-	ossl_raise(rb_eRuntimeError, "ATTR wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "ATTR wasn't initialized!"); \
     } \
 } while (0)
 
@@ -28,7 +28,7 @@
  * Classes
  */
 VALUE cX509Attr;
-VALUE eX509AttrError;
+static VALUE eX509AttrError;
 
 static void
 ossl_x509attr_free(void *ptr)
@@ -39,7 +39,7 @@ ossl_x509attr_free(void *ptr)
 static const rb_data_type_t ossl_x509attr_type = {
     "OpenSSL/X509/ATTRIBUTE",
     {
-	0, ossl_x509attr_free,
+        0, ossl_x509attr_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -48,20 +48,16 @@ static const rb_data_type_t ossl_x509attr_type = {
  * Public
  */
 VALUE
-ossl_x509attr_new(X509_ATTRIBUTE *attr)
+ossl_x509attr_new(const X509_ATTRIBUTE *attr)
 {
     X509_ATTRIBUTE *new;
     VALUE obj;
 
     obj = NewX509Attr(cX509Attr);
-    if (!attr) {
-	new = X509_ATTRIBUTE_new();
-    } else {
-	new = X509_ATTRIBUTE_dup(attr);
-    }
-    if (!new) {
-	ossl_raise(eX509AttrError, NULL);
-    }
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    new = X509_ATTRIBUTE_dup((X509_ATTRIBUTE *)attr);
+    if (!new)
+        ossl_raise(eX509AttrError, "X509_ATTRIBUTE_dup");
     SetX509Attr(obj, new);
 
     return obj;
@@ -88,7 +84,7 @@ ossl_x509attr_alloc(VALUE klass)
 
     obj = NewX509Attr(klass);
     if (!(attr = X509_ATTRIBUTE_new()))
-	ossl_raise(eX509AttrError, NULL);
+        ossl_raise(eX509AttrError, NULL);
     SetX509Attr(obj, attr);
 
     return obj;
@@ -107,15 +103,15 @@ ossl_x509attr_initialize(int argc, VALUE *argv, VALUE self)
 
     GetX509Attr(self, attr);
     if(rb_scan_args(argc, argv, "11", &oid, &value) == 1){
-	oid = ossl_to_der_if_possible(oid);
-	StringValue(oid);
-	p = (unsigned char *)RSTRING_PTR(oid);
-	x = d2i_X509_ATTRIBUTE(&attr, &p, RSTRING_LEN(oid));
-	DATA_PTR(self) = attr;
-	if(!x){
-	    ossl_raise(eX509AttrError, NULL);
-	}
-	return self;
+        oid = ossl_to_der_if_possible(oid);
+        StringValue(oid);
+        p = (unsigned char *)RSTRING_PTR(oid);
+        x = d2i_X509_ATTRIBUTE(&attr, &p, RSTRING_LEN(oid));
+        DATA_PTR(self) = attr;
+        if(!x){
+            ossl_raise(eX509AttrError, NULL);
+        }
+        return self;
     }
     rb_funcall(self, rb_intern("oid="), 1, oid);
     rb_funcall(self, rb_intern("value="), 1, value);
@@ -123,6 +119,7 @@ ossl_x509attr_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509attr_initialize_copy(VALUE self, VALUE other)
 {
@@ -134,7 +131,7 @@ ossl_x509attr_initialize_copy(VALUE self, VALUE other)
 
     attr_new = X509_ATTRIBUTE_dup(attr_other);
     if (!attr_new)
-	ossl_raise(eX509AttrError, "X509_ATTRIBUTE_dup");
+        ossl_raise(eX509AttrError, "X509_ATTRIBUTE_dup");
 
     SetX509Attr(self, attr_new);
     X509_ATTRIBUTE_free(attr);
@@ -158,8 +155,8 @@ ossl_x509attr_set_oid(VALUE self, VALUE oid)
     obj = OBJ_txt2obj(s, 0);
     if(!obj) ossl_raise(eX509AttrError, NULL);
     if (!X509_ATTRIBUTE_set1_object(attr, obj)) {
-	ASN1_OBJECT_free(obj);
-	ossl_raise(eX509AttrError, "X509_ATTRIBUTE_set1_object");
+        ASN1_OBJECT_free(obj);
+        ossl_raise(eX509AttrError, "X509_ATTRIBUTE_set1_object");
     }
     ASN1_OBJECT_free(obj);
 
@@ -168,29 +165,18 @@ ossl_x509attr_set_oid(VALUE self, VALUE oid)
 
 /*
  * call-seq:
- *    attr.oid => string
+ *    attr.oid -> string
+ *
+ * Returns the OID of the attribute. Returns the short name or the dotted
+ * decimal notation.
  */
 static VALUE
 ossl_x509attr_get_oid(VALUE self)
 {
     X509_ATTRIBUTE *attr;
-    ASN1_OBJECT *oid;
-    BIO *out;
-    VALUE ret;
-    int nid;
 
     GetX509Attr(self, attr);
-    oid = X509_ATTRIBUTE_get0_object(attr);
-    if ((nid = OBJ_obj2nid(oid)) != NID_undef)
-	ret = rb_str_new2(OBJ_nid2sn(nid));
-    else{
-	if (!(out = BIO_new(BIO_s_mem())))
-	    ossl_raise(eX509AttrError, NULL);
-	i2a_ASN1_OBJECT(out, oid);
-	ret = ossl_membio2str(out);
-    }
-
-    return ret;
+    return ossl_asn1obj_to_string(X509_ATTRIBUTE_get0_object(attr));
 }
 
 /*
@@ -201,37 +187,36 @@ static VALUE
 ossl_x509attr_set_value(VALUE self, VALUE value)
 {
     X509_ATTRIBUTE *attr;
-    VALUE asn1_value;
-    int i, asn1_tag;
+    GetX509Attr(self, attr);
 
     OSSL_Check_Kind(value, cASN1Data);
-    asn1_tag = NUM2INT(rb_attr_get(value, rb_intern("@tag")));
-    asn1_value = rb_attr_get(value, rb_intern("@value"));
-    if (asn1_tag != V_ASN1_SET)
-	ossl_raise(eASN1Error, "argument must be ASN1::Set");
-    if (!RB_TYPE_P(asn1_value, T_ARRAY))
-	ossl_raise(eASN1Error, "ASN1::Set has non-array value");
+    VALUE der = ossl_to_der(value);
+    const unsigned char *p = (const unsigned char *)RSTRING_PTR(der);
+    STACK_OF(ASN1_TYPE) *sk = d2i_ASN1_SET_ANY(NULL, &p, RSTRING_LEN(der));
+    if (!sk)
+        ossl_raise(eX509AttrError, "attribute value must be ASN1::Set");
 
-    GetX509Attr(self, attr);
     if (X509_ATTRIBUTE_count(attr)) { /* populated, reset first */
-	ASN1_OBJECT *obj = X509_ATTRIBUTE_get0_object(attr);
-	X509_ATTRIBUTE *new_attr = X509_ATTRIBUTE_create_by_OBJ(NULL, obj, 0, NULL, -1);
-	if (!new_attr)
-	    ossl_raise(eX509AttrError, NULL);
-	SetX509Attr(self, new_attr);
-	X509_ATTRIBUTE_free(attr);
-	attr = new_attr;
+        const ASN1_OBJECT *obj = X509_ATTRIBUTE_get0_object(attr);
+        X509_ATTRIBUTE *new_attr = X509_ATTRIBUTE_create_by_OBJ(NULL, obj, 0, NULL, -1);
+        if (!new_attr) {
+            sk_ASN1_TYPE_pop_free(sk, ASN1_TYPE_free);
+            ossl_raise(eX509AttrError, "X509_ATTRIBUTE_create_by_OBJ");
+        }
+        SetX509Attr(self, new_attr);
+        X509_ATTRIBUTE_free(attr);
+        attr = new_attr;
     }
 
-    for (i = 0; i < RARRAY_LEN(asn1_value); i++) {
-	ASN1_TYPE *a1type = ossl_asn1_get_asn1type(RARRAY_AREF(asn1_value, i));
-	if (!X509_ATTRIBUTE_set1_data(attr, ASN1_TYPE_get(a1type),
-				      a1type->value.ptr, -1)) {
-	    ASN1_TYPE_free(a1type);
-	    ossl_raise(eX509AttrError, NULL);
-	}
-	ASN1_TYPE_free(a1type);
+    for (int i = 0; i < sk_ASN1_TYPE_num(sk); i++) {
+        ASN1_TYPE *a1type = sk_ASN1_TYPE_value(sk, i);
+        if (!X509_ATTRIBUTE_set1_data(attr, ASN1_TYPE_get(a1type),
+                                      a1type->value.ptr, -1)) {
+            sk_ASN1_TYPE_pop_free(sk, ASN1_TYPE_free);
+            ossl_raise(eX509AttrError, "X509_ATTRIBUTE_set1_data");
+        }
     }
+    sk_ASN1_TYPE_pop_free(sk, ASN1_TYPE_free);
 
     return value;
 }
@@ -250,23 +235,32 @@ ossl_x509attr_get_value(VALUE self)
     unsigned char *p;
 
     GetX509Attr(self, attr);
+    count = X509_ATTRIBUTE_count(attr);
     /* there is no X509_ATTRIBUTE_get0_set() :( */
+#ifdef HAVE_OPENSSL_SK_NEW_RESERVE
+    if (!(sk = sk_ASN1_TYPE_new_reserve(NULL, count)))
+        ossl_raise(eX509AttrError, "sk_new_reserve");
+#else
     if (!(sk = sk_ASN1_TYPE_new_null()))
-	ossl_raise(eX509AttrError, "sk_new");
+        ossl_raise(eX509AttrError, "sk_new");
+#endif
 
-    count = X509_ATTRIBUTE_count(attr);
-    for (i = 0; i < count; i++)
-	sk_ASN1_TYPE_push(sk, X509_ATTRIBUTE_get0_type(attr, i));
+    for (i = 0; i < count; i++) {
+        if (!sk_ASN1_TYPE_push(sk, (ASN1_TYPE *)X509_ATTRIBUTE_get0_type(attr, i))) {
+            sk_ASN1_TYPE_free(sk);
+            ossl_raise(eX509AttrError, NULL);
+        }
+    }
 
     if ((len = i2d_ASN1_SET_ANY(sk, NULL)) <= 0) {
-	sk_ASN1_TYPE_free(sk);
-	ossl_raise(eX509AttrError, NULL);
+        sk_ASN1_TYPE_free(sk);
+        ossl_raise(eX509AttrError, NULL);
     }
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_ASN1_SET_ANY(sk, &p) <= 0) {
-	sk_ASN1_TYPE_free(sk);
-	ossl_raise(eX509AttrError, NULL);
+        sk_ASN1_TYPE_free(sk);
+        ossl_raise(eX509AttrError, NULL);
     }
     ossl_str_adjust(str, p);
     sk_ASN1_TYPE_free(sk);
@@ -288,11 +282,11 @@ ossl_x509attr_to_der(VALUE self)
 
     GetX509Attr(self, attr);
     if((len = i2d_X509_ATTRIBUTE(attr, NULL)) <= 0)
-	ossl_raise(eX509AttrError, NULL);
+        ossl_raise(eX509AttrError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_X509_ATTRIBUTE(attr, &p) <= 0)
-	ossl_raise(eX509AttrError, NULL);
+        ossl_raise(eX509AttrError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -304,12 +298,6 @@ ossl_x509attr_to_der(VALUE self)
 void
 Init_ossl_x509attr(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509AttrError = rb_define_class_under(mX509, "AttributeError", eOSSLError);
 
     cX509Attr = rb_define_class_under(mX509, "Attribute", rb_cObject);
diff --git a/ext/openssl/ossl_x509cert.c b/ext/openssl/ossl_x509cert.c
index aa6b9bb7ce..08dd184a0c 100644
--- a/ext/openssl/ossl_x509cert.c
+++ b/ext/openssl/ossl_x509cert.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,14 +13,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509_type, 0)
 #define SetX509(obj, x509) do { \
     if (!(x509)) { \
-	ossl_raise(rb_eRuntimeError, "CERT wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "CERT wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (x509); \
 } while (0)
 #define GetX509(obj, x509) do { \
     TypedData_Get_Struct((obj), X509, &ossl_x509_type, (x509)); \
     if (!(x509)) { \
-	ossl_raise(rb_eRuntimeError, "CERT wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "CERT wasn't initialized!"); \
     } \
 } while (0)
 
@@ -28,7 +28,7 @@
  * Classes
  */
 VALUE cX509Cert;
-VALUE eX509CertError;
+static VALUE eX509CertError;
 
 static void
 ossl_x509_free(void *ptr)
@@ -39,7 +39,7 @@ ossl_x509_free(void *ptr)
 static const rb_data_type_t ossl_x509_type = {
     "OpenSSL/X509",
     {
-	0, ossl_x509_free,
+        0, ossl_x509_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -48,20 +48,16 @@ static const rb_data_type_t ossl_x509_type = {
  * Public
  */
 VALUE
-ossl_x509_new(X509 *x509)
+ossl_x509_new(const X509 *x509)
 {
     X509 *new;
     VALUE obj;
 
     obj = NewX509(cX509Cert);
-    if (!x509) {
-	new = X509_new();
-    } else {
-	new = X509_dup(x509);
-    }
-    if (!new) {
-	ossl_raise(eX509CertError, NULL);
-    }
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    new = X509_dup((X509 *)x509);
+    if (!new)
+        ossl_raise(eX509CertError, "X509_dup");
     SetX509(obj, new);
 
     return obj;
@@ -120,8 +116,8 @@ ossl_x509_initialize(int argc, VALUE *argv, VALUE self)
 
     rb_check_frozen(self);
     if (rb_scan_args(argc, argv, "01", &arg) == 0) {
-	/* create just empty X509Cert */
-	return self;
+        /* create just empty X509Cert */
+        return self;
     }
     arg = ossl_to_der_if_possible(arg);
     in = ossl_obj2bio(&arg);
@@ -140,6 +136,7 @@ ossl_x509_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509_copy(VALUE self, VALUE other)
 {
@@ -174,11 +171,11 @@ ossl_x509_to_der(VALUE self)
 
     GetX509(self, x509);
     if ((len = i2d_X509(x509, NULL)) <= 0)
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_X509(x509, &p) <= 0)
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -200,8 +197,8 @@ ossl_x509_to_pem(VALUE self)
     if (!out) ossl_raise(eX509CertError, NULL);
 
     if (!PEM_write_bio_X509(out, x509)) {
-	BIO_free(out);
-	ossl_raise(eX509CertError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509CertError, NULL);
     }
     str = ossl_membio2str(out);
 
@@ -225,8 +222,8 @@ ossl_x509_to_text(VALUE self)
     if (!out) ossl_raise(eX509CertError, NULL);
 
     if (!X509_print(out, x509)) {
-	BIO_free(out);
-	ossl_raise(eX509CertError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509CertError, NULL);
     }
     str = ossl_membio2str(out);
 
@@ -246,7 +243,7 @@ ossl_x509_to_req(VALUE self)
 
     GetX509(self, x509);
     if (!(req = X509_to_X509_REQ(x509, NULL, EVP_md5()))) {
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
     obj = ossl_x509req_new(req);
     X509_REQ_free(req);
@@ -280,11 +277,11 @@ ossl_x509_set_version(VALUE self, VALUE version)
     long ver;
 
     if ((ver = NUM2LONG(version)) < 0) {
-	ossl_raise(eX509CertError, "version must be >= 0!");
+        ossl_raise(eX509CertError, "version must be >= 0!");
     }
     GetX509(self, x509);
     if (!X509_set_version(x509, ver)) {
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return version;
@@ -314,7 +311,9 @@ ossl_x509_set_serial(VALUE self, VALUE num)
     X509 *x509;
 
     GetX509(self, x509);
-    X509_set_serialNumber(x509, num_to_asn1integer(num, X509_get_serialNumber(x509)));
+    if (!X509_set_serialNumber(x509, num_to_asn1integer(num, X509_get_serialNumber(x509)))) {
+        ossl_raise(eX509CertError, NULL);
+    }
 
     return num;
 }
@@ -322,25 +321,23 @@ ossl_x509_set_serial(VALUE self, VALUE num)
 /*
  * call-seq:
  *    cert.signature_algorithm => string
+ *
+ * Returns the signature algorithm used to sign this certificate. This returns
+ * the algorithm name found in the TBSCertificate structure, not the outer
+ * \Certificate structure.
+ *
+ * Returns the long name of the signature algorithm, or the dotted decimal
+ * notation if \OpenSSL does not define a long name for it.
  */
 static VALUE
 ossl_x509_get_signature_algorithm(VALUE self)
 {
     X509 *x509;
-    BIO *out;
-    VALUE str;
+    const ASN1_OBJECT *obj;
 
     GetX509(self, x509);
-    out = BIO_new(BIO_s_mem());
-    if (!out) ossl_raise(eX509CertError, NULL);
-
-    if (!i2a_ASN1_OBJECT(out, X509_get0_tbs_sigalg(x509)->algorithm)) {
-	BIO_free(out);
-	ossl_raise(eX509CertError, NULL);
-    }
-    str = ossl_membio2str(out);
-
-    return str;
+    X509_ALGOR_get0(&obj, NULL, NULL, X509_get0_tbs_sigalg(x509));
+    return ossl_asn1obj_to_string_long_name(obj);
 }
 
 /*
@@ -351,11 +348,11 @@ static VALUE
 ossl_x509_get_subject(VALUE self)
 {
     X509 *x509;
-    X509_NAME *name;
+    const X509_NAME *name;
 
     GetX509(self, x509);
     if (!(name = X509_get_subject_name(x509))) { /* NO DUP - don't free! */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return ossl_x509name_new(name);
@@ -372,7 +369,7 @@ ossl_x509_set_subject(VALUE self, VALUE subject)
 
     GetX509(self, x509);
     if (!X509_set_subject_name(x509, GetX509NamePtr(subject))) { /* DUPs name */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return subject;
@@ -386,11 +383,11 @@ static VALUE
 ossl_x509_get_issuer(VALUE self)
 {
     X509 *x509;
-    X509_NAME *name;
+    const X509_NAME *name;
 
     GetX509(self, x509);
     if(!(name = X509_get_issuer_name(x509))) { /* NO DUP - don't free! */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return ossl_x509name_new(name);
@@ -407,7 +404,7 @@ ossl_x509_set_issuer(VALUE self, VALUE issuer)
 
     GetX509(self, x509);
     if (!X509_set_issuer_name(x509, GetX509NamePtr(issuer))) { /* DUPs name */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return issuer;
@@ -425,7 +422,7 @@ ossl_x509_get_not_before(VALUE self)
 
     GetX509(self, x509);
     if (!(asn1time = X509_get0_notBefore(x509))) {
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return asn1time_to_time(asn1time);
@@ -444,8 +441,8 @@ ossl_x509_set_not_before(VALUE self, VALUE time)
     GetX509(self, x509);
     asn1time = ossl_x509_time_adjust(NULL, time);
     if (!X509_set1_notBefore(x509, asn1time)) {
-	ASN1_TIME_free(asn1time);
-	ossl_raise(eX509CertError, "X509_set_notBefore");
+        ASN1_TIME_free(asn1time);
+        ossl_raise(eX509CertError, "X509_set_notBefore");
     }
     ASN1_TIME_free(asn1time);
 
@@ -464,7 +461,7 @@ ossl_x509_get_not_after(VALUE self)
 
     GetX509(self, x509);
     if (!(asn1time = X509_get0_notAfter(x509))) {
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return asn1time_to_time(asn1time);
@@ -483,8 +480,8 @@ ossl_x509_set_not_after(VALUE self, VALUE time)
     GetX509(self, x509);
     asn1time = ossl_x509_time_adjust(NULL, time);
     if (!X509_set1_notAfter(x509, asn1time)) {
-	ASN1_TIME_free(asn1time);
-	ossl_raise(eX509CertError, "X509_set_notAfter");
+        ASN1_TIME_free(asn1time);
+        ossl_raise(eX509CertError, "X509_set_notAfter");
     }
     ASN1_TIME_free(asn1time);
 
@@ -503,10 +500,10 @@ ossl_x509_get_public_key(VALUE self)
 
     GetX509(self, x509);
     if (!(pkey = X509_get_pubkey(x509))) { /* adds an reference */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
-    return ossl_pkey_new(pkey); /* NO DUP - OK */
+    return ossl_pkey_wrap(pkey);
 }
 
 /*
@@ -523,7 +520,7 @@ ossl_x509_set_public_key(VALUE self, VALUE key)
     pkey = GetPKeyPtr(key);
     ossl_pkey_check_public_key(pkey);
     if (!X509_set_pubkey(x509, pkey))
-	ossl_raise(eX509CertError, "X509_set_pubkey");
+        ossl_raise(eX509CertError, "X509_set_pubkey");
     return key;
 }
 
@@ -537,13 +534,14 @@ ossl_x509_sign(VALUE self, VALUE key, VALUE digest)
     X509 *x509;
     EVP_PKEY *pkey;
     const EVP_MD *md;
+    VALUE md_holder;
 
     pkey = GetPrivPKeyPtr(key); /* NO NEED TO DUP */
-    md = ossl_evp_get_digestbyname(digest);
+    /* NULL needed for some key types, e.g. Ed25519 */
+    md = NIL_P(digest) ? NULL : ossl_evp_md_fetch(digest, &md_holder);
     GetX509(self, x509);
-    if (!X509_sign(x509, pkey, md)) {
-	ossl_raise(eX509CertError, NULL);
-    }
+    if (!X509_sign(x509, pkey, md))
+        ossl_raise(eX509CertError, "X509_sign");
 
     return self;
 }
@@ -566,12 +564,12 @@ ossl_x509_verify(VALUE self, VALUE key)
     ossl_pkey_check_public_key(pkey);
     switch (X509_verify(x509, pkey)) {
       case 1:
-	return Qtrue;
+        return Qtrue;
       case 0:
-	ossl_clear_error();
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
       default:
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 }
 
@@ -592,8 +590,8 @@ ossl_x509_check_private_key(VALUE self, VALUE key)
     pkey = GetPrivPKeyPtr(key); /* NO NEED TO DUP */
     GetX509(self, x509);
     if (!X509_check_private_key(x509, pkey)) {
-	ossl_clear_error();
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
     }
 
     return Qtrue;
@@ -608,18 +606,14 @@ ossl_x509_get_extensions(VALUE self)
 {
     X509 *x509;
     int count, i;
-    X509_EXTENSION *ext;
     VALUE ary;
 
     GetX509(self, x509);
     count = X509_get_ext_count(x509);
-    if (count < 0) {
-	return rb_ary_new();
-    }
-    ary = rb_ary_new2(count);
+    ary = rb_ary_new_capa(count);
     for (i=0; i<count; i++) {
-	ext = X509_get_ext(x509, i); /* NO DUP - don't free! */
-	rb_ary_push(ary, ossl_x509ext_new(ext));
+        const X509_EXTENSION *ext = X509_get_ext(x509, i);
+        rb_ary_push(ary, ossl_x509ext_new(ext));
     }
 
     return ary;
@@ -639,16 +633,16 @@ ossl_x509_set_extensions(VALUE self, VALUE ary)
     Check_Type(ary, T_ARRAY);
     /* All ary's members should be X509Extension */
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
+        OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
     }
     GetX509(self, x509);
     for (i = X509_get_ext_count(x509); i > 0; i--)
         X509_EXTENSION_free(X509_delete_ext(x509, 0));
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	ext = GetX509ExtPtr(RARRAY_AREF(ary, i));
-	if (!X509_add_ext(x509, ext, -1)) { /* DUPs ext */
-	    ossl_raise(eX509CertError, "X509_add_ext");
-	}
+        ext = GetX509ExtPtr(RARRAY_AREF(ary, i));
+        if (!X509_add_ext(x509, ext, -1)) { /* DUPs ext */
+            ossl_raise(eX509CertError, "X509_add_ext");
+        }
     }
 
     return ary;
@@ -667,32 +661,24 @@ ossl_x509_add_extension(VALUE self, VALUE extension)
     GetX509(self, x509);
     ext = GetX509ExtPtr(extension);
     if (!X509_add_ext(x509, ext, -1)) { /* DUPs ext - FREE it */
-	ossl_raise(eX509CertError, NULL);
+        ossl_raise(eX509CertError, NULL);
     }
 
     return extension;
 }
 
-static VALUE
-ossl_x509_inspect(VALUE self)
-{
-    return rb_sprintf("#<%"PRIsVALUE": subject=%+"PRIsVALUE", "
-		      "issuer=%+"PRIsVALUE", serial=%+"PRIsVALUE", "
-		      "not_before=%+"PRIsVALUE", not_after=%+"PRIsVALUE">",
-		      rb_obj_class(self),
-		      ossl_x509_get_subject(self),
-		      ossl_x509_get_issuer(self),
-		      ossl_x509_get_serial(self),
-		      ossl_x509_get_not_before(self),
-		      ossl_x509_get_not_after(self));
-}
-
 /*
  * call-seq:
  *    cert1 == cert2 -> true | false
  *
  * Compares the two certificates. Note that this takes into account all fields,
  * not just the issuer name and the serial number.
+ *
+ * This method uses X509_cmp() from OpenSSL, which compares certificates based
+ * on their cached DER encodings. The comparison can be unreliable if a
+ * certificate is incomplete.
+ *
+ * See also the man page X509_cmp(3).
  */
 static VALUE
 ossl_x509_eq(VALUE self, VALUE other)
@@ -701,12 +687,42 @@ ossl_x509_eq(VALUE self, VALUE other)
 
     GetX509(self, a);
     if (!rb_obj_is_kind_of(other, cX509Cert))
-	return Qfalse;
+        return Qfalse;
     GetX509(other, b);
 
     return !X509_cmp(a, b) ? Qtrue : Qfalse;
 }
 
+/*
+ * call-seq:
+ *    cert.tbs_bytes => string
+ *
+ * Returns the DER-encoded bytes of the certificate's to be signed certificate.
+ * This is mainly useful for validating embedded certificate transparency signatures.
+ */
+static VALUE
+ossl_x509_tbs_bytes(VALUE self)
+{
+    X509 *x509;
+    int len;
+    unsigned char *p0;
+    VALUE str;
+
+    GetX509(self, x509);
+    len = i2d_re_X509_tbs(x509, NULL);
+    if (len <= 0) {
+        ossl_raise(eX509CertError, "i2d_re_X509_tbs");
+    }
+    str = rb_str_new(NULL, len);
+    p0 = (unsigned char *)RSTRING_PTR(str);
+    if (i2d_re_X509_tbs(x509, &p0) <= 0) {
+        ossl_raise(eX509CertError, "i2d_re_X509_tbs");
+    }
+    ossl_str_adjust(str, p0);
+
+    return str;
+}
+
 struct load_chained_certificates_arguments {
     VALUE certificates;
     X509 *certificate;
@@ -766,7 +782,7 @@ load_chained_certificates_PEM(BIO *in) {
     certificates = load_chained_certificates_append(Qnil, certificate);
 
     while ((certificate = PEM_read_bio_X509(in, NULL, NULL, NULL))) {
-      load_chained_certificates_append(certificates, certificate);
+        load_chained_certificates_append(certificates, certificate);
     }
 
     /* We tried to read one more certificate but could not read start line: */
@@ -864,12 +880,6 @@ ossl_x509_load(VALUE klass, VALUE buffer)
 void
 Init_ossl_x509cert(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509CertError = rb_define_class_under(mX509, "CertificateError", eOSSLError);
 
     /* Document-class: OpenSSL::X509::Certificate
@@ -997,6 +1007,6 @@ Init_ossl_x509cert(void)
     rb_define_method(cX509Cert, "extensions", ossl_x509_get_extensions, 0);
     rb_define_method(cX509Cert, "extensions=", ossl_x509_set_extensions, 1);
     rb_define_method(cX509Cert, "add_extension", ossl_x509_add_extension, 1);
-    rb_define_method(cX509Cert, "inspect", ossl_x509_inspect, 0);
     rb_define_method(cX509Cert, "==", ossl_x509_eq, 1);
+    rb_define_method(cX509Cert, "tbs_bytes", ossl_x509_tbs_bytes, 0);
 }
diff --git a/ext/openssl/ossl_x509crl.c b/ext/openssl/ossl_x509crl.c
index 80e29f9df2..9b59bda9e2 100644
--- a/ext/openssl/ossl_x509crl.c
+++ b/ext/openssl/ossl_x509crl.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,22 +13,22 @@
     TypedData_Wrap_Struct((klass), &ossl_x509crl_type, 0)
 #define SetX509CRL(obj, crl) do { \
     if (!(crl)) { \
-	ossl_raise(rb_eRuntimeError, "CRL wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "CRL wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (crl); \
 } while (0)
 #define GetX509CRL(obj, crl) do { \
     TypedData_Get_Struct((obj), X509_CRL, &ossl_x509crl_type, (crl)); \
     if (!(crl)) { \
-	ossl_raise(rb_eRuntimeError, "CRL wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "CRL wasn't initialized!"); \
     } \
 } while (0)
 
 /*
  * Classes
  */
-VALUE cX509CRL;
-VALUE eX509CRLError;
+static VALUE cX509CRL;
+static VALUE eX509CRLError;
 
 static void
 ossl_x509crl_free(void *ptr)
@@ -39,7 +39,7 @@ ossl_x509crl_free(void *ptr)
 static const rb_data_type_t ossl_x509crl_type = {
     "OpenSSL/X509/CRL",
     {
-	0, ossl_x509crl_free,
+        0, ossl_x509crl_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -58,14 +58,16 @@ GetX509CRLPtr(VALUE obj)
 }
 
 VALUE
-ossl_x509crl_new(X509_CRL *crl)
+ossl_x509crl_new(const X509_CRL *crl)
 {
     X509_CRL *tmp;
     VALUE obj;
 
     obj = NewX509CRL(cX509CRL);
-    tmp = crl ? X509_CRL_dup(crl) : X509_CRL_new();
-    if(!tmp) ossl_raise(eX509CRLError, NULL);
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    tmp = X509_CRL_dup((X509_CRL *)crl);
+    if (!tmp)
+        ossl_raise(eX509CRLError, "X509_CRL_dup");
     SetX509CRL(obj, tmp);
 
     return obj;
@@ -82,7 +84,7 @@ ossl_x509crl_alloc(VALUE klass)
 
     obj = NewX509CRL(klass);
     if (!(crl = X509_CRL_new())) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     SetX509CRL(obj, crl);
 
@@ -98,7 +100,7 @@ ossl_x509crl_initialize(int argc, VALUE *argv, VALUE self)
 
     rb_check_frozen(self);
     if (rb_scan_args(argc, argv, "01", &arg) == 0) {
-	return self;
+        return self;
     }
     arg = ossl_to_der_if_possible(arg);
     in = ossl_obj2bio(&arg);
@@ -117,6 +119,7 @@ ossl_x509crl_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509crl_copy(VALUE self, VALUE other)
 {
@@ -127,7 +130,7 @@ ossl_x509crl_copy(VALUE self, VALUE other)
     GetX509CRL(self, a);
     GetX509CRL(other, b);
     if (!(crl = X509_CRL_dup(b))) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     X509_CRL_free(a);
     DATA_PTR(self) = crl;
@@ -154,34 +157,36 @@ ossl_x509crl_set_version(VALUE self, VALUE version)
     long ver;
 
     if ((ver = NUM2LONG(version)) < 0) {
-	ossl_raise(eX509CRLError, "version must be >= 0!");
+        ossl_raise(eX509CRLError, "version must be >= 0!");
     }
     GetX509CRL(self, crl);
     if (!X509_CRL_set_version(crl, ver)) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
 
     return version;
 }
 
+/*
+ * call-seq:
+ *    crl.signature_algorithm -> string
+ *
+ * Returns the signature algorithm used to sign this CRL.
+ *
+ * Returns the long name of the signature algorithm, or the dotted decimal
+ * notation if \OpenSSL does not define a long name for it.
+ */
 static VALUE
 ossl_x509crl_get_signature_algorithm(VALUE self)
 {
     X509_CRL *crl;
     const X509_ALGOR *alg;
-    BIO *out;
+    const ASN1_OBJECT *obj;
 
     GetX509CRL(self, crl);
-    if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509CRLError, NULL);
-    }
     X509_CRL_get0_signature(crl, NULL, &alg);
-    if (!i2a_ASN1_OBJECT(out, alg->algorithm)) {
-	BIO_free(out);
-	ossl_raise(eX509CRLError, NULL);
-    }
-
-    return ossl_membio2str(out);
+    X509_ALGOR_get0(&obj, NULL, NULL, alg);
+    return ossl_asn1obj_to_string_long_name(obj);
 }
 
 static VALUE
@@ -202,7 +207,7 @@ ossl_x509crl_set_issuer(VALUE self, VALUE issuer)
     GetX509CRL(self, crl);
 
     if (!X509_CRL_set_issuer_name(crl, GetX509NamePtr(issuer))) { /* DUPs name */
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     return issuer;
 }
@@ -216,7 +221,7 @@ ossl_x509crl_get_last_update(VALUE self)
     GetX509CRL(self, crl);
     time = X509_CRL_get0_lastUpdate(crl);
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -230,8 +235,8 @@ ossl_x509crl_set_last_update(VALUE self, VALUE time)
     GetX509CRL(self, crl);
     asn1time = ossl_x509_time_adjust(NULL, time);
     if (!X509_CRL_set1_lastUpdate(crl, asn1time)) {
-	ASN1_TIME_free(asn1time);
-	ossl_raise(eX509CRLError, "X509_CRL_set_lastUpdate");
+        ASN1_TIME_free(asn1time);
+        ossl_raise(eX509CRLError, "X509_CRL_set_lastUpdate");
     }
     ASN1_TIME_free(asn1time);
 
@@ -247,7 +252,7 @@ ossl_x509crl_get_next_update(VALUE self)
     GetX509CRL(self, crl);
     time = X509_CRL_get0_nextUpdate(crl);
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -261,8 +266,8 @@ ossl_x509crl_set_next_update(VALUE self, VALUE time)
     GetX509CRL(self, crl);
     asn1time = ossl_x509_time_adjust(NULL, time);
     if (!X509_CRL_set1_nextUpdate(crl, asn1time)) {
-	ASN1_TIME_free(asn1time);
-	ossl_raise(eX509CRLError, "X509_CRL_set_nextUpdate");
+        ASN1_TIME_free(asn1time);
+        ossl_raise(eX509CRLError, "X509_CRL_set_nextUpdate");
     }
     ASN1_TIME_free(asn1time);
 
@@ -274,21 +279,19 @@ ossl_x509crl_get_revoked(VALUE self)
 {
     X509_CRL *crl;
     int i, num;
-    X509_REVOKED *rev;
-    VALUE ary, revoked;
+    STACK_OF(X509_REVOKED) *sk;
+    VALUE ary;
 
     GetX509CRL(self, crl);
-    num = sk_X509_REVOKED_num(X509_CRL_get_REVOKED(crl));
-    if (num < 0) {
-	OSSL_Debug("num < 0???");
-	return rb_ary_new();
-    }
-    ary = rb_ary_new2(num);
+    sk = X509_CRL_get_REVOKED(crl);
+    if (!sk)
+        return rb_ary_new();
+
+    num = sk_X509_REVOKED_num(sk);
+    ary = rb_ary_new_capa(num);
     for(i=0; i<num; i++) {
-	/* NO DUP - don't free! */
-	rev = sk_X509_REVOKED_value(X509_CRL_get_REVOKED(crl), i);
-	revoked = ossl_x509revoked_new(rev);
-	rb_ary_push(ary, revoked);
+        const X509_REVOKED *rev = sk_X509_REVOKED_value(sk, i);
+        rb_ary_push(ary, ossl_x509revoked_new(rev));
     }
 
     return ary;
@@ -305,19 +308,19 @@ ossl_x509crl_set_revoked(VALUE self, VALUE ary)
     Check_Type(ary, T_ARRAY);
     /* All ary members should be X509 Revoked */
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Rev);
+        OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Rev);
     }
     GetX509CRL(self, crl);
     if ((sk = X509_CRL_get_REVOKED(crl))) {
-	while ((rev = sk_X509_REVOKED_pop(sk)))
-	    X509_REVOKED_free(rev);
+        while ((rev = sk_X509_REVOKED_pop(sk)))
+            X509_REVOKED_free(rev);
     }
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	rev = DupX509RevokedPtr(RARRAY_AREF(ary, i));
-	if (!X509_CRL_add0_revoked(crl, rev)) { /* NO DUP - don't free! */
-	    X509_REVOKED_free(rev);
-	    ossl_raise(eX509CRLError, "X509_CRL_add0_revoked");
-	}
+        rev = DupX509RevokedPtr(RARRAY_AREF(ary, i));
+        if (!X509_CRL_add0_revoked(crl, rev)) { /* NO DUP - don't free! */
+            X509_REVOKED_free(rev);
+            ossl_raise(eX509CRLError, "X509_CRL_add0_revoked");
+        }
     }
     X509_CRL_sort(crl);
 
@@ -333,8 +336,8 @@ ossl_x509crl_add_revoked(VALUE self, VALUE revoked)
     GetX509CRL(self, crl);
     rev = DupX509RevokedPtr(revoked);
     if (!X509_CRL_add0_revoked(crl, rev)) { /* NO DUP - don't free! */
-	X509_REVOKED_free(rev);
-	ossl_raise(eX509CRLError, "X509_CRL_add0_revoked");
+        X509_REVOKED_free(rev);
+        ossl_raise(eX509CRLError, "X509_CRL_add0_revoked");
     }
     X509_CRL_sort(crl);
 
@@ -347,13 +350,14 @@ ossl_x509crl_sign(VALUE self, VALUE key, VALUE digest)
     X509_CRL *crl;
     EVP_PKEY *pkey;
     const EVP_MD *md;
+    VALUE md_holder;
 
     GetX509CRL(self, crl);
     pkey = GetPrivPKeyPtr(key); /* NO NEED TO DUP */
-    md = ossl_evp_get_digestbyname(digest);
-    if (!X509_CRL_sign(crl, pkey, md)) {
-	ossl_raise(eX509CRLError, NULL);
-    }
+    /* NULL needed for some key types, e.g. Ed25519 */
+    md = NIL_P(digest) ? NULL : ossl_evp_md_fetch(digest, &md_holder);
+    if (!X509_CRL_sign(crl, pkey, md))
+        ossl_raise(eX509CRLError, "X509_CRL_sign");
 
     return self;
 }
@@ -369,12 +373,12 @@ ossl_x509crl_verify(VALUE self, VALUE key)
     ossl_pkey_check_public_key(pkey);
     switch (X509_CRL_verify(crl, pkey)) {
       case 1:
-	return Qtrue;
+        return Qtrue;
       case 0:
-	ossl_clear_error();
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
       default:
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
 }
 
@@ -386,11 +390,11 @@ ossl_x509crl_to_der(VALUE self)
 
     GetX509CRL(self, crl);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     if (!i2d_X509_CRL_bio(out, crl)) {
-	BIO_free(out);
-	ossl_raise(eX509CRLError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509CRLError, NULL);
     }
 
     return ossl_membio2str(out);
@@ -404,11 +408,11 @@ ossl_x509crl_to_pem(VALUE self)
 
     GetX509CRL(self, crl);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     if (!PEM_write_bio_X509_CRL(out, crl)) {
-	BIO_free(out);
-	ossl_raise(eX509CRLError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509CRLError, NULL);
     }
 
     return ossl_membio2str(out);
@@ -422,11 +426,11 @@ ossl_x509crl_to_text(VALUE self)
 
     GetX509CRL(self, crl);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
     if (!X509_CRL_print(out, crl)) {
-	BIO_free(out);
-	ossl_raise(eX509CRLError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509CRLError, NULL);
     }
 
     return ossl_membio2str(out);
@@ -440,19 +444,14 @@ ossl_x509crl_get_extensions(VALUE self)
 {
     X509_CRL *crl;
     int count, i;
-    X509_EXTENSION *ext;
     VALUE ary;
 
     GetX509CRL(self, crl);
     count = X509_CRL_get_ext_count(crl);
-    if (count < 0) {
-	OSSL_Debug("count < 0???");
-	return rb_ary_new();
-    }
-    ary = rb_ary_new2(count);
+    ary = rb_ary_new_capa(count);
     for (i=0; i<count; i++) {
-	ext = X509_CRL_get_ext(crl, i); /* NO DUP - don't free! */
-	rb_ary_push(ary, ossl_x509ext_new(ext));
+        const X509_EXTENSION *ext = X509_CRL_get_ext(crl, i);
+        rb_ary_push(ary, ossl_x509ext_new(ext));
     }
 
     return ary;
@@ -471,16 +470,16 @@ ossl_x509crl_set_extensions(VALUE self, VALUE ary)
     Check_Type(ary, T_ARRAY);
     /* All ary members should be X509 Extensions */
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
+        OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
     }
     GetX509CRL(self, crl);
     for (i = X509_CRL_get_ext_count(crl); i > 0; i--)
         X509_EXTENSION_free(X509_CRL_delete_ext(crl, 0));
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	ext = GetX509ExtPtr(RARRAY_AREF(ary, i)); /* NO NEED TO DUP */
-	if (!X509_CRL_add_ext(crl, ext, -1)) {
-	    ossl_raise(eX509CRLError, "X509_CRL_add_ext");
-	}
+        ext = GetX509ExtPtr(RARRAY_AREF(ary, i)); /* NO NEED TO DUP */
+        if (!X509_CRL_add_ext(crl, ext, -1)) {
+            ossl_raise(eX509CRLError, "X509_CRL_add_ext");
+        }
     }
 
     return ary;
@@ -495,7 +494,7 @@ ossl_x509crl_add_extension(VALUE self, VALUE extension)
     GetX509CRL(self, crl);
     ext = GetX509ExtPtr(extension);
     if (!X509_CRL_add_ext(crl, ext, -1)) {
-	ossl_raise(eX509CRLError, NULL);
+        ossl_raise(eX509CRLError, NULL);
     }
 
     return extension;
@@ -507,12 +506,6 @@ ossl_x509crl_add_extension(VALUE self, VALUE extension)
 void
 Init_ossl_x509crl(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509CRLError = rb_define_class_under(mX509, "CRLError", eOSSLError);
 
     cX509CRL = rb_define_class_under(mX509, "CRL", rb_cObject);
diff --git a/ext/openssl/ossl_x509ext.c b/ext/openssl/ossl_x509ext.c
index 192d09bd3f..1fe727d3f1 100644
--- a/ext/openssl/ossl_x509ext.c
+++ b/ext/openssl/ossl_x509ext.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,14 +13,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509ext_type, 0)
 #define SetX509Ext(obj, ext) do { \
     if (!(ext)) { \
-	ossl_raise(rb_eRuntimeError, "EXT wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "EXT wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (ext); \
 } while (0)
 #define GetX509Ext(obj, ext) do { \
     TypedData_Get_Struct((obj), X509_EXTENSION, &ossl_x509ext_type, (ext)); \
     if (!(ext)) { \
-	ossl_raise(rb_eRuntimeError, "EXT wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "EXT wasn't initialized!"); \
     } \
 } while (0)
 #define MakeX509ExtFactory(klass, obj, ctx) do { \
@@ -33,7 +33,7 @@
 #define GetX509ExtFactory(obj, ctx) do { \
     TypedData_Get_Struct((obj), X509V3_CTX, &ossl_x509extfactory_type, (ctx)); \
     if (!(ctx)) { \
-	ossl_raise(rb_eRuntimeError, "CTX wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "CTX wasn't initialized!"); \
     } \
 } while (0)
 
@@ -41,8 +41,8 @@
  * Classes
  */
 VALUE cX509Ext;
-VALUE cX509ExtFactory;
-VALUE eX509ExtError;
+static VALUE cX509ExtFactory;
+static VALUE eX509ExtError;
 
 static void
 ossl_x509ext_free(void *ptr)
@@ -53,7 +53,7 @@ ossl_x509ext_free(void *ptr)
 static const rb_data_type_t ossl_x509ext_type = {
     "OpenSSL/X509/EXTENSION",
     {
-	0, ossl_x509ext_free,
+        0, ossl_x509ext_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -62,20 +62,16 @@ static const rb_data_type_t ossl_x509ext_type = {
  * Public
  */
 VALUE
-ossl_x509ext_new(X509_EXTENSION *ext)
+ossl_x509ext_new(const X509_EXTENSION *ext)
 {
     X509_EXTENSION *new;
     VALUE obj;
 
     obj = NewX509Ext(cX509Ext);
-    if (!ext) {
-	new = X509_EXTENSION_new();
-    } else {
-	new = X509_EXTENSION_dup(ext);
-    }
-    if (!new) {
-	ossl_raise(eX509ExtError, NULL);
-    }
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    new = X509_EXTENSION_dup((X509_EXTENSION *)ext);
+    if (!new)
+        ossl_raise(eX509ExtError, "X509_EXTENSION_dup");
     SetX509Ext(obj, new);
 
     return obj;
@@ -106,7 +102,7 @@ ossl_x509extfactory_free(void *ctx)
 static const rb_data_type_t ossl_x509extfactory_type = {
     "OpenSSL/X509/EXTENSION/Factory",
     {
-	0, ossl_x509extfactory_free,
+        0, ossl_x509extfactory_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -180,15 +176,15 @@ ossl_x509extfactory_initialize(int argc, VALUE *argv, VALUE self)
     /*GetX509ExtFactory(self, ctx);*/
 
     rb_scan_args(argc, argv, "04",
-		 &issuer_cert, &subject_cert, &subject_req, &crl);
+                 &issuer_cert, &subject_cert, &subject_req, &crl);
     if (!NIL_P(issuer_cert))
-	ossl_x509extfactory_set_issuer_cert(self, issuer_cert);
+        ossl_x509extfactory_set_issuer_cert(self, issuer_cert);
     if (!NIL_P(subject_cert))
-	ossl_x509extfactory_set_subject_cert(self, subject_cert);
+        ossl_x509extfactory_set_subject_cert(self, subject_cert);
     if (!NIL_P(subject_req))
-	ossl_x509extfactory_set_subject_req(self, subject_req);
+        ossl_x509extfactory_set_subject_req(self, subject_req);
     if (!NIL_P(crl))
-	ossl_x509extfactory_set_crl(self, crl);
+        ossl_x509extfactory_set_crl(self, crl);
 
     return self;
 }
@@ -218,7 +214,7 @@ ossl_x509extfactory_create_ext(int argc, VALUE *argv, VALUE self)
     oid_cstr = StringValueCStr(oid);
     nid = OBJ_ln2nid(oid_cstr);
     if (nid != NID_undef)
-      oid_cstr = OBJ_nid2sn(nid);
+        oid_cstr = OBJ_nid2sn(nid);
 
     valstr = rb_str_new2(RTEST(critical) ? "critical," : "");
     rb_str_append(valstr, value);
@@ -230,14 +226,10 @@ ossl_x509extfactory_create_ext(int argc, VALUE *argv, VALUE self)
     conf = NIL_P(rconf) ? NULL : GetConfig(rconf);
     X509V3_set_nconf(ctx, conf);
 
-#if OSSL_OPENSSL_PREREQ(1, 1, 0) || OSSL_IS_LIBRESSL
     ext = X509V3_EXT_nconf(conf, ctx, oid_cstr, RSTRING_PTR(valstr));
-#else
-    ext = X509V3_EXT_nconf(conf, ctx, (char *)oid_cstr, RSTRING_PTR(valstr));
-#endif
     X509V3_set_ctx_nodb(ctx);
     if (!ext){
-	ossl_raise(eX509ExtError, "%"PRIsVALUE" = %"PRIsVALUE, oid, valstr);
+        ossl_raise(eX509ExtError, "%"PRIsVALUE" = %"PRIsVALUE, oid, valstr);
     }
     SetX509Ext(obj, ext);
 
@@ -255,7 +247,7 @@ ossl_x509ext_alloc(VALUE klass)
 
     obj = NewX509Ext(klass);
     if(!(ext = X509_EXTENSION_new())){
-	ossl_raise(eX509ExtError, NULL);
+        ossl_raise(eX509ExtError, NULL);
     }
     SetX509Ext(obj, ext);
 
@@ -283,14 +275,14 @@ ossl_x509ext_initialize(int argc, VALUE *argv, VALUE self)
 
     GetX509Ext(self, ext);
     if(rb_scan_args(argc, argv, "12", &oid, &value, &critical) == 1){
-	oid = ossl_to_der_if_possible(oid);
-	StringValue(oid);
-	p = (unsigned char *)RSTRING_PTR(oid);
-	x = d2i_X509_EXTENSION(&ext, &p, RSTRING_LEN(oid));
-	DATA_PTR(self) = ext;
-	if(!x)
-	    ossl_raise(eX509ExtError, NULL);
-	return self;
+        oid = ossl_to_der_if_possible(oid);
+        StringValue(oid);
+        p = (unsigned char *)RSTRING_PTR(oid);
+        x = d2i_X509_EXTENSION(&ext, &p, RSTRING_LEN(oid));
+        DATA_PTR(self) = ext;
+        if(!x)
+            ossl_raise(eX509ExtError, NULL);
+        return self;
     }
     rb_funcall(self, rb_intern("oid="), 1, oid);
     rb_funcall(self, rb_intern("value="), 1, value);
@@ -299,6 +291,7 @@ ossl_x509ext_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509ext_initialize_copy(VALUE self, VALUE other)
 {
@@ -310,7 +303,7 @@ ossl_x509ext_initialize_copy(VALUE self, VALUE other)
 
     ext_new = X509_EXTENSION_dup(ext_other);
     if (!ext_new)
-	ossl_raise(eX509ExtError, "X509_EXTENSION_dup");
+        ossl_raise(eX509ExtError, "X509_EXTENSION_dup");
 
     SetX509Ext(self, ext_new);
     X509_EXTENSION_free(ext);
@@ -327,10 +320,10 @@ ossl_x509ext_set_oid(VALUE self, VALUE oid)
     GetX509Ext(self, ext);
     obj = OBJ_txt2obj(StringValueCStr(oid), 0);
     if (!obj)
-	ossl_raise(eX509ExtError, "OBJ_txt2obj");
+        ossl_raise(eX509ExtError, "OBJ_txt2obj");
     if (!X509_EXTENSION_set_object(ext, obj)) {
-	ASN1_OBJECT_free(obj);
-	ossl_raise(eX509ExtError, "X509_EXTENSION_set_object");
+        ASN1_OBJECT_free(obj);
+        ossl_raise(eX509ExtError, "X509_EXTENSION_set_object");
     }
     ASN1_OBJECT_free(obj);
 
@@ -346,12 +339,20 @@ ossl_x509ext_set_value(VALUE self, VALUE data)
     GetX509Ext(self, ext);
     data = ossl_to_der_if_possible(data);
     StringValue(data);
-    asn1s = X509_EXTENSION_get_data(ext);
 
+    asn1s = ASN1_OCTET_STRING_new();
+    if (!asn1s)
+        ossl_raise(eX509ExtError, "ASN1_OCTET_STRING_new");
     if (!ASN1_OCTET_STRING_set(asn1s, (unsigned char *)RSTRING_PTR(data),
-			       RSTRING_LENINT(data))) {
-	ossl_raise(eX509ExtError, "ASN1_OCTET_STRING_set");
+                               RSTRING_LENINT(data))) {
+        ASN1_OCTET_STRING_free(asn1s);
+        ossl_raise(eX509ExtError, "ASN1_OCTET_STRING_set");
     }
+    if (!X509_EXTENSION_set_data(ext, asn1s)) {
+        ASN1_OCTET_STRING_free(asn1s);
+        ossl_raise(eX509ExtError, "X509_EXTENSION_set_data");
+    }
+    ASN1_OCTET_STRING_free(asn1s);
 
     return data;
 }
@@ -367,27 +368,20 @@ ossl_x509ext_set_critical(VALUE self, VALUE flag)
     return flag;
 }
 
+/*
+ * call-seq:
+ *    ext.oid -> string
+ *
+ * Returns the OID of the extension. Returns the short name or the dotted
+ * decimal notation.
+ */
 static VALUE
 ossl_x509ext_get_oid(VALUE obj)
 {
     X509_EXTENSION *ext;
-    ASN1_OBJECT *extobj;
-    BIO *out;
-    VALUE ret;
-    int nid;
 
     GetX509Ext(obj, ext);
-    extobj = X509_EXTENSION_get_object(ext);
-    if ((nid = OBJ_obj2nid(extobj)) != NID_undef)
-	ret = rb_str_new2(OBJ_nid2sn(nid));
-    else{
-	if (!(out = BIO_new(BIO_s_mem())))
-	    ossl_raise(eX509ExtError, NULL);
-	i2a_ASN1_OBJECT(out, extobj);
-	ret = ossl_membio2str(out);
-    }
-
-    return ret;
+    return ossl_asn1obj_to_string(X509_EXTENSION_get_object(ext));
 }
 
 static VALUE
@@ -399,9 +393,9 @@ ossl_x509ext_get_value(VALUE obj)
 
     GetX509Ext(obj, ext);
     if (!(out = BIO_new(BIO_s_mem())))
-	ossl_raise(eX509ExtError, NULL);
+        ossl_raise(eX509ExtError, NULL);
     if (!X509V3_EXT_print(out, ext, 0, 0))
-	ASN1_STRING_print(out, (ASN1_STRING *)X509_EXTENSION_get_data(ext));
+        ASN1_STRING_print(out, X509_EXTENSION_get_data(ext));
     ret = ossl_membio2str(out);
 
     return ret;
@@ -411,13 +405,13 @@ static VALUE
 ossl_x509ext_get_value_der(VALUE obj)
 {
     X509_EXTENSION *ext;
-    ASN1_OCTET_STRING *value;
+    const ASN1_OCTET_STRING *value;
 
     GetX509Ext(obj, ext);
     if ((value = X509_EXTENSION_get_data(ext)) == NULL)
-	ossl_raise(eX509ExtError, NULL);
+        ossl_raise(eX509ExtError, NULL);
 
-    return rb_str_new((const char *)value->data, value->length);
+    return asn1str_to_str(value);
 }
 
 static VALUE
@@ -439,11 +433,11 @@ ossl_x509ext_to_der(VALUE obj)
 
     GetX509Ext(obj, ext);
     if((len = i2d_X509_EXTENSION(ext, NULL)) <= 0)
-	ossl_raise(eX509ExtError, NULL);
+        ossl_raise(eX509ExtError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_X509_EXTENSION(ext, &p) < 0)
-	ossl_raise(eX509ExtError, NULL);
+        ossl_raise(eX509ExtError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -456,12 +450,6 @@ void
 Init_ossl_x509ext(void)
 {
 #undef rb_intern
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509ExtError = rb_define_class_under(mX509, "ExtensionError", eOSSLError);
 
     cX509ExtFactory = rb_define_class_under(mX509, "ExtensionFactory", rb_cObject);
diff --git a/ext/openssl/ossl_x509name.c b/ext/openssl/ossl_x509name.c
index 9591912f70..eb97b23c02 100644
--- a/ext/openssl/ossl_x509name.c
+++ b/ext/openssl/ossl_x509name.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,27 +13,27 @@
     TypedData_Wrap_Struct((klass), &ossl_x509name_type, 0)
 #define SetX509Name(obj, name) do { \
     if (!(name)) { \
-	ossl_raise(rb_eRuntimeError, "Name wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "Name wasn't initialized."); \
     } \
     RTYPEDDATA_DATA(obj) = (name); \
 } while (0)
 #define GetX509Name(obj, name) do { \
     TypedData_Get_Struct((obj), X509_NAME, &ossl_x509name_type, (name)); \
     if (!(name)) { \
-	ossl_raise(rb_eRuntimeError, "Name wasn't initialized."); \
+        ossl_raise(rb_eRuntimeError, "Name wasn't initialized."); \
     } \
 } while (0)
 
 #define OBJECT_TYPE_TEMPLATE \
-  rb_const_get(cX509Name, rb_intern("OBJECT_TYPE_TEMPLATE"))
+    rb_const_get(cX509Name, rb_intern("OBJECT_TYPE_TEMPLATE"))
 #define DEFAULT_OBJECT_TYPE \
-  rb_const_get(cX509Name, rb_intern("DEFAULT_OBJECT_TYPE"))
+    rb_const_get(cX509Name, rb_intern("DEFAULT_OBJECT_TYPE"))
 
 /*
  * Classes
  */
-VALUE cX509Name;
-VALUE eX509NameError;
+static VALUE cX509Name;
+static VALUE eX509NameError;
 
 static void
 ossl_x509name_free(void *ptr)
@@ -44,7 +44,7 @@ ossl_x509name_free(void *ptr)
 static const rb_data_type_t ossl_x509name_type = {
     "OpenSSL/X509/NAME",
     {
-	0, ossl_x509name_free,
+        0, ossl_x509name_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -53,20 +53,16 @@ static const rb_data_type_t ossl_x509name_type = {
  * Public
  */
 VALUE
-ossl_x509name_new(X509_NAME *name)
+ossl_x509name_new(const X509_NAME *name)
 {
     X509_NAME *new;
     VALUE obj;
 
     obj = NewX509Name(cX509Name);
-    if (!name) {
-	new = X509_NAME_new();
-    } else {
-	new = X509_NAME_dup(name);
-    }
-    if (!new) {
-	ossl_raise(eX509NameError, NULL);
-    }
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    new = X509_NAME_dup((X509_NAME *)name);
+    if (!new)
+        ossl_raise(eX509NameError, "X509_NAME_dup");
     SetX509Name(obj, new);
 
     return obj;
@@ -93,7 +89,7 @@ ossl_x509name_alloc(VALUE klass)
 
     obj = NewX509Name(klass);
     if (!(name = X509_NAME_new())) {
-	ossl_raise(eX509NameError, NULL);
+        ossl_raise(eX509NameError, NULL);
     }
     SetX509Name(obj, name);
 
@@ -150,33 +146,34 @@ ossl_x509name_initialize(int argc, VALUE *argv, VALUE self)
 
     GetX509Name(self, name);
     if (rb_scan_args(argc, argv, "02", &arg, &template) == 0) {
-	return self;
+        return self;
     }
     else {
-	VALUE tmp = rb_check_array_type(arg);
-	if (!NIL_P(tmp)) {
-	    VALUE args;
-	    if(NIL_P(template)) template = OBJECT_TYPE_TEMPLATE;
-	    args = rb_ary_new3(2, self, template);
-	    rb_block_call(tmp, rb_intern("each"), 0, 0, ossl_x509name_init_i, args);
-	}
-	else{
-	    const unsigned char *p;
-	    VALUE str = ossl_to_der_if_possible(arg);
-	    X509_NAME *x;
-	    StringValue(str);
-	    p = (unsigned char *)RSTRING_PTR(str);
-	    x = d2i_X509_NAME(&name, &p, RSTRING_LEN(str));
-	    DATA_PTR(self) = name;
-	    if(!x){
-		ossl_raise(eX509NameError, NULL);
-	    }
-	}
+        VALUE tmp = rb_check_array_type(arg);
+        if (!NIL_P(tmp)) {
+            VALUE args;
+            if(NIL_P(template)) template = OBJECT_TYPE_TEMPLATE;
+            args = rb_ary_new3(2, self, template);
+            rb_block_call(tmp, rb_intern("each"), 0, 0, ossl_x509name_init_i, args);
+        }
+        else{
+            const unsigned char *p;
+            VALUE str = ossl_to_der_if_possible(arg);
+            X509_NAME *x;
+            StringValue(str);
+            p = (unsigned char *)RSTRING_PTR(str);
+            x = d2i_X509_NAME(&name, &p, RSTRING_LEN(str));
+            DATA_PTR(self) = name;
+            if(!x){
+                ossl_raise(eX509NameError, NULL);
+            }
+        }
     }
 
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509name_initialize_copy(VALUE self, VALUE other)
 {
@@ -188,7 +185,7 @@ ossl_x509name_initialize_copy(VALUE self, VALUE other)
 
     name_new = X509_NAME_dup(name_other);
     if (!name_new)
-	ossl_raise(eX509NameError, "X509_NAME_dup");
+        ossl_raise(eX509NameError, "X509_NAME_dup");
 
     SetX509Name(self, name_new);
     X509_NAME_free(name);
@@ -225,8 +222,8 @@ VALUE ossl_x509name_add_entry(int argc, VALUE *argv, VALUE self)
     int loc = -1, set = 0;
 
     if (!kwargs_ids[0]) {
-	kwargs_ids[0] = rb_intern_const("loc");
-	kwargs_ids[1] = rb_intern_const("set");
+        kwargs_ids[0] = rb_intern_const("loc");
+        kwargs_ids[1] = rb_intern_const("set");
     }
     rb_scan_args(argc, argv, "21:", &oid, &value, &type, &opts);
     rb_get_kwargs(opts, kwargs_ids, 0, 2, kwargs);
@@ -234,14 +231,14 @@ VALUE ossl_x509name_add_entry(int argc, VALUE *argv, VALUE self)
     StringValue(value);
     if(NIL_P(type)) type = rb_aref(OBJECT_TYPE_TEMPLATE, oid);
     if (kwargs[0] != Qundef)
-	loc = NUM2INT(kwargs[0]);
+        loc = NUM2INT(kwargs[0]);
     if (kwargs[1] != Qundef)
-	set = NUM2INT(kwargs[1]);
+        set = NUM2INT(kwargs[1]);
     GetX509Name(self, name);
     if (!X509_NAME_add_entry_by_txt(name, oid_name, NUM2INT(type),
-				    (unsigned char *)RSTRING_PTR(value),
-				    RSTRING_LENINT(value), loc, set))
-	ossl_raise(eX509NameError, "X509_NAME_add_entry_by_txt");
+                                    (unsigned char *)RSTRING_PTR(value),
+                                    RSTRING_LENINT(value), loc, set))
+        ossl_raise(eX509NameError, "X509_NAME_add_entry_by_txt");
     return self;
 }
 
@@ -254,7 +251,7 @@ ossl_x509name_to_s_old(VALUE self)
     GetX509Name(self, name);
     buf = X509_NAME_oneline(name, NULL, 0);
     if (!buf)
-	ossl_raise(eX509NameError, "X509_NAME_oneline");
+        ossl_raise(eX509NameError, "X509_NAME_oneline");
     return ossl_buf2str(buf, rb_long2int(strlen(buf)));
 }
 
@@ -268,11 +265,11 @@ x509name_print(VALUE self, unsigned long iflag)
     GetX509Name(self, name);
     out = BIO_new(BIO_s_mem());
     if (!out)
-	ossl_raise(eX509NameError, NULL);
+        ossl_raise(eX509NameError, NULL);
     ret = X509_NAME_print_ex(out, name, 0, iflag);
     if (ret < 0 || (iflag == XN_FLAG_COMPAT && ret == 0)) {
-	BIO_free(out);
-	ossl_raise(eX509NameError, "X509_NAME_print_ex");
+        BIO_free(out);
+        ossl_raise(eX509NameError, "X509_NAME_print_ex");
     }
     return ossl_membio2str(out);
 }
@@ -306,9 +303,9 @@ ossl_x509name_to_s(int argc, VALUE *argv, VALUE self)
     rb_check_arity(argc, 0, 1);
     /* name.to_s(nil) was allowed */
     if (!argc || NIL_P(argv[0]))
-	return ossl_x509name_to_s_old(self);
+        return ossl_x509name_to_s_old(self);
     else
-	return x509name_print(self, NUM2ULONG(argv[0]));
+        return x509name_print(self, NUM2ULONG(argv[0]));
 }
 
 /*
@@ -331,7 +328,7 @@ static VALUE
 ossl_x509name_inspect(VALUE self)
 {
     return rb_enc_sprintf(rb_utf8_encoding(), "#<%"PRIsVALUE" %"PRIsVALUE">",
-			  rb_obj_class(self), ossl_x509name_to_utf8(self));
+                          rb_obj_class(self), ossl_x509name_to_utf8(self));
 }
 
 /*
@@ -345,38 +342,22 @@ static VALUE
 ossl_x509name_to_a(VALUE self)
 {
     X509_NAME *name;
-    X509_NAME_ENTRY *entry;
-    int i,entries,nid;
-    char long_name[512];
-    const char *short_name;
-    VALUE ary, vname, ret;
-    ASN1_STRING *value;
+    int entries;
+    VALUE ret;
 
     GetX509Name(self, name);
     entries = X509_NAME_entry_count(name);
-    if (entries < 0) {
-	OSSL_Debug("name entries < 0!");
-	return rb_ary_new();
-    }
-    ret = rb_ary_new2(entries);
-    for (i=0; i<entries; i++) {
-	if (!(entry = X509_NAME_get_entry(name, i))) {
-	    ossl_raise(eX509NameError, NULL);
-	}
-	if (!i2t_ASN1_OBJECT(long_name, sizeof(long_name),
-			     X509_NAME_ENTRY_get_object(entry))) {
-	    ossl_raise(eX509NameError, NULL);
-	}
-	nid = OBJ_ln2nid(long_name);
-	if (nid == NID_undef) {
-	    vname = rb_str_new2((const char *) &long_name);
-	} else {
-	    short_name = OBJ_nid2sn(nid);
-	    vname = rb_str_new2(short_name); /*do not free*/
-	}
-	value = X509_NAME_ENTRY_get_data(entry);
-	ary = rb_ary_new3(3, vname, asn1str_to_str(value), INT2NUM(value->type));
-	rb_ary_push(ret, ary);
+    ret = rb_ary_new_capa(entries);
+    for (int i = 0; i < entries; i++) {
+        const X509_NAME_ENTRY *entry = X509_NAME_get_entry(name, i);
+        if (!entry)
+            ossl_raise(eX509NameError, "X509_NAME_get_entry");
+        const ASN1_OBJECT *obj = X509_NAME_ENTRY_get_object(entry);
+        VALUE vname = ossl_asn1obj_to_string(obj);
+        const ASN1_STRING *data = X509_NAME_ENTRY_get_data(entry);
+        VALUE vdata = asn1str_to_str(data);
+        VALUE type = INT2NUM(ASN1_STRING_type(data));
+        rb_ary_push(ret, rb_ary_new_from_args(3, vname, vdata, type));
     }
     return ret;
 }
@@ -385,11 +366,17 @@ static int
 ossl_x509name_cmp0(VALUE self, VALUE other)
 {
     X509_NAME *name1, *name2;
+    int result;
 
     GetX509Name(self, name1);
     GetX509Name(other, name2);
 
-    return X509_NAME_cmp(name1, name2);
+    result = X509_NAME_cmp(name1, name2);
+    if (result == -2) {
+        ossl_raise(eX509NameError, NULL);
+    }
+
+    return result;
 }
 
 /*
@@ -407,7 +394,7 @@ ossl_x509name_cmp(VALUE self, VALUE other)
     int result;
 
     if (!rb_obj_is_kind_of(other, cX509Name))
-	return Qnil;
+        return Qnil;
 
     result = ossl_x509name_cmp0(self, other);
     if (result < 0) return INT2FIX(-1);
@@ -426,7 +413,7 @@ static VALUE
 ossl_x509name_eql(VALUE self, VALUE other)
 {
     if (!rb_obj_is_kind_of(other, cX509Name))
-	return Qfalse;
+        return Qfalse;
 
     return ossl_x509name_cmp0(self, other) == 0 ? Qtrue : Qfalse;
 }
@@ -486,11 +473,11 @@ ossl_x509name_to_der(VALUE self)
 
     GetX509Name(self, name);
     if((len = i2d_X509_NAME(name, NULL)) <= 0)
-	ossl_raise(eX509NameError, NULL);
+        ossl_raise(eX509NameError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if(i2d_X509_NAME(name, &p) <= 0)
-	ossl_raise(eX509NameError, NULL);
+        ossl_raise(eX509NameError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -516,12 +503,6 @@ Init_ossl_x509name(void)
 #undef rb_intern
     VALUE utf8str, ptrstr, ia5str, hash;
 
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     id_aref = rb_intern("[]");
     eX509NameError = rb_define_class_under(mX509, "NameError", eOSSLError);
     cX509Name = rb_define_class_under(mX509, "Name", rb_cObject);
@@ -560,6 +541,7 @@ Init_ossl_x509name(void)
     rb_hash_aset(hash, rb_str_new2("DC"), ia5str);
     rb_hash_aset(hash, rb_str_new2("domainComponent"), ia5str);
     rb_hash_aset(hash, rb_str_new2("emailAddress"), ia5str);
+    rb_obj_freeze(hash);
 
     /*
      * The default object type template for name entries.
diff --git a/ext/openssl/ossl_x509req.c b/ext/openssl/ossl_x509req.c
index f058185151..ad5dd08033 100644
--- a/ext/openssl/ossl_x509req.c
+++ b/ext/openssl/ossl_x509req.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,22 +13,22 @@
     TypedData_Wrap_Struct((klass), &ossl_x509req_type, 0)
 #define SetX509Req(obj, req) do { \
     if (!(req)) { \
-	ossl_raise(rb_eRuntimeError, "Req wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "Req wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (req); \
 } while (0)
 #define GetX509Req(obj, req) do { \
     TypedData_Get_Struct((obj), X509_REQ, &ossl_x509req_type, (req)); \
     if (!(req)) { \
-	ossl_raise(rb_eRuntimeError, "Req wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "Req wasn't initialized!"); \
     } \
 } while (0)
 
 /*
  * Classes
  */
-VALUE cX509Req;
-VALUE eX509ReqError;
+static VALUE cX509Req;
+static VALUE eX509ReqError;
 
 static void
 ossl_x509req_free(void *ptr)
@@ -39,7 +39,7 @@ ossl_x509req_free(void *ptr)
 static const rb_data_type_t ossl_x509req_type = {
     "OpenSSL/X509/REQ",
     {
-	0, ossl_x509req_free,
+        0, ossl_x509req_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -68,7 +68,7 @@ ossl_x509req_alloc(VALUE klass)
 
     obj = NewX509Req(klass);
     if (!(req = X509_REQ_new())) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
     SetX509Req(obj, req);
 
@@ -84,7 +84,7 @@ ossl_x509req_initialize(int argc, VALUE *argv, VALUE self)
 
     rb_check_frozen(self);
     if (rb_scan_args(argc, argv, "01", &arg) == 0) {
-	return self;
+        return self;
     }
     arg = ossl_to_der_if_possible(arg);
     in = ossl_obj2bio(&arg);
@@ -103,6 +103,7 @@ ossl_x509req_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509req_copy(VALUE self, VALUE other)
 {
@@ -113,7 +114,7 @@ ossl_x509req_copy(VALUE self, VALUE other)
     GetX509Req(self, a);
     GetX509Req(other, b);
     if (!(req = X509_REQ_dup(b))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
     X509_REQ_free(a);
     DATA_PTR(self) = req;
@@ -129,11 +130,11 @@ ossl_x509req_to_pem(VALUE self)
 
     GetX509Req(self, req);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
     if (!PEM_write_bio_X509_REQ(out, req)) {
-	BIO_free(out);
-	ossl_raise(eX509ReqError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return ossl_membio2str(out);
@@ -149,11 +150,11 @@ ossl_x509req_to_der(VALUE self)
 
     GetX509Req(self, req);
     if ((len = i2d_X509_REQ(req, NULL)) <= 0)
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     str = rb_str_new(0, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_X509_REQ(req, &p) <= 0)
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     ossl_str_adjust(str, p);
 
     return str;
@@ -167,11 +168,11 @@ ossl_x509req_to_text(VALUE self)
 
     GetX509Req(self, req);
     if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
     if (!X509_REQ_print(out, req)) {
-	BIO_free(out);
-	ossl_raise(eX509ReqError, NULL);
+        BIO_free(out);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return ossl_membio2str(out);
@@ -190,7 +191,7 @@ ossl_x509req_to_x509(VALUE self, VALUE days, VALUE key)
     GetX509Req(self, req);
     ...
     if (!(x509 = X509_REQ_to_X509(req, d, pkey))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return ossl_x509_new(x509);
@@ -216,11 +217,11 @@ ossl_x509req_set_version(VALUE self, VALUE version)
     long ver;
 
     if ((ver = NUM2LONG(version)) < 0) {
-	ossl_raise(eX509ReqError, "version must be >= 0!");
+        ossl_raise(eX509ReqError, "version must be >= 0!");
     }
     GetX509Req(self, req);
     if (!X509_REQ_set_version(req, ver)) {
-	ossl_raise(eX509ReqError, "X509_REQ_set_version");
+        ossl_raise(eX509ReqError, "X509_REQ_set_version");
     }
 
     return version;
@@ -230,11 +231,11 @@ static VALUE
 ossl_x509req_get_subject(VALUE self)
 {
     X509_REQ *req;
-    X509_NAME *name;
+    const X509_NAME *name;
 
     GetX509Req(self, req);
     if (!(name = X509_REQ_get_subject_name(req))) { /* NO DUP - don't free */
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return ossl_x509name_new(name);
@@ -248,31 +249,32 @@ ossl_x509req_set_subject(VALUE self, VALUE subject)
     GetX509Req(self, req);
     /* DUPs name */
     if (!X509_REQ_set_subject_name(req, GetX509NamePtr(subject))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return subject;
 }
 
+/*
+ * call-seq:
+ *    req.signature_algorithm -> string
+ *
+ * Returns the signature algorithm used to sign this request.
+ *
+ * Returns the long name of the signature algorithm, or the dotted decimal
+ * notation if \OpenSSL does not define a long name for it.
+ */
 static VALUE
 ossl_x509req_get_signature_algorithm(VALUE self)
 {
     X509_REQ *req;
     const X509_ALGOR *alg;
-    BIO *out;
+    const ASN1_OBJECT *obj;
 
     GetX509Req(self, req);
-
-    if (!(out = BIO_new(BIO_s_mem()))) {
-	ossl_raise(eX509ReqError, NULL);
-    }
     X509_REQ_get0_signature(req, NULL, &alg);
-    if (!i2a_ASN1_OBJECT(out, alg->algorithm)) {
-	BIO_free(out);
-	ossl_raise(eX509ReqError, NULL);
-    }
-
-    return ossl_membio2str(out);
+    X509_ALGOR_get0(&obj, NULL, NULL, alg);
+    return ossl_asn1obj_to_string_long_name(obj);
 }
 
 static VALUE
@@ -283,10 +285,10 @@ ossl_x509req_get_public_key(VALUE self)
 
     GetX509Req(self, req);
     if (!(pkey = X509_REQ_get_pubkey(req))) { /* adds reference */
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 
-    return ossl_pkey_new(pkey); /* NO DUP - OK */
+    return ossl_pkey_wrap(pkey);
 }
 
 static VALUE
@@ -299,7 +301,7 @@ ossl_x509req_set_public_key(VALUE self, VALUE key)
     pkey = GetPKeyPtr(key);
     ossl_pkey_check_public_key(pkey);
     if (!X509_REQ_set_pubkey(req, pkey))
-	ossl_raise(eX509ReqError, "X509_REQ_set_pubkey");
+        ossl_raise(eX509ReqError, "X509_REQ_set_pubkey");
     return key;
 }
 
@@ -309,13 +311,14 @@ ossl_x509req_sign(VALUE self, VALUE key, VALUE digest)
     X509_REQ *req;
     EVP_PKEY *pkey;
     const EVP_MD *md;
+    VALUE md_holder;
 
     GetX509Req(self, req);
     pkey = GetPrivPKeyPtr(key); /* NO NEED TO DUP */
-    md = ossl_evp_get_digestbyname(digest);
-    if (!X509_REQ_sign(req, pkey, md)) {
-	ossl_raise(eX509ReqError, NULL);
-    }
+    /* NULL needed for some key types, e.g. Ed25519 */
+    md = NIL_P(digest) ? NULL : ossl_evp_md_fetch(digest, &md_holder);
+    if (!X509_REQ_sign(req, pkey, md))
+        ossl_raise(eX509ReqError, "X509_REQ_sign");
 
     return self;
 }
@@ -334,12 +337,12 @@ ossl_x509req_verify(VALUE self, VALUE key)
     ossl_pkey_check_public_key(pkey);
     switch (X509_REQ_verify(req, pkey)) {
       case 1:
-	return Qtrue;
+        return Qtrue;
       case 0:
-	ossl_clear_error();
-	return Qfalse;
+        ossl_clear_error();
+        return Qfalse;
       default:
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 }
 
@@ -348,20 +351,20 @@ ossl_x509req_get_attributes(VALUE self)
 {
     X509_REQ *req;
     int count, i;
-    X509_ATTRIBUTE *attr;
+    const X509_ATTRIBUTE *attr;
     VALUE ary;
 
     GetX509Req(self, req);
 
     count = X509_REQ_get_attr_count(req);
     if (count < 0) {
-	OSSL_Debug("count < 0???");
-	return rb_ary_new();
+        OSSL_Debug("count < 0???");
+        return rb_ary_new();
     }
     ary = rb_ary_new2(count);
     for (i=0; i<count; i++) {
-	attr = X509_REQ_get_attr(req, i);
-	rb_ary_push(ary, ossl_x509attr_new(attr));
+        attr = X509_REQ_get_attr(req, i);
+        rb_ary_push(ary, ossl_x509attr_new(attr));
     }
 
     return ary;
@@ -377,17 +380,17 @@ ossl_x509req_set_attributes(VALUE self, VALUE ary)
 
     Check_Type(ary, T_ARRAY);
     for (i=0;i<RARRAY_LEN(ary); i++) {
-	OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Attr);
+        OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Attr);
     }
     GetX509Req(self, req);
     for (i = X509_REQ_get_attr_count(req); i > 0; i--)
         X509_ATTRIBUTE_free(X509_REQ_delete_attr(req, 0));
     for (i=0;i<RARRAY_LEN(ary); i++) {
-	item = RARRAY_AREF(ary, i);
-	attr = GetX509AttrPtr(item);
-	if (!X509_REQ_add1_attr(req, attr)) {
-	    ossl_raise(eX509ReqError, "X509_REQ_add1_attr");
-	}
+        item = RARRAY_AREF(ary, i);
+        attr = GetX509AttrPtr(item);
+        if (!X509_REQ_add1_attr(req, attr)) {
+            ossl_raise(eX509ReqError, "X509_REQ_add1_attr");
+        }
     }
     return ary;
 }
@@ -399,7 +402,7 @@ ossl_x509req_add_attribute(VALUE self, VALUE attr)
 
     GetX509Req(self, req);
     if (!X509_REQ_add1_attr(req, GetX509AttrPtr(attr))) {
-	ossl_raise(eX509ReqError, NULL);
+        ossl_raise(eX509ReqError, NULL);
     }
 
     return attr;
@@ -411,12 +414,6 @@ ossl_x509req_add_attribute(VALUE self, VALUE attr)
 void
 Init_ossl_x509req(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509ReqError = rb_define_class_under(mX509, "RequestError", eOSSLError);
 
     cX509Req = rb_define_class_under(mX509, "Request", rb_cObject);
diff --git a/ext/openssl/ossl_x509revoked.c b/ext/openssl/ossl_x509revoked.c
index 108447c868..0151961e9f 100644
--- a/ext/openssl/ossl_x509revoked.c
+++ b/ext/openssl/ossl_x509revoked.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,14 +13,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509rev_type, 0)
 #define SetX509Rev(obj, rev) do { \
     if (!(rev)) { \
-	ossl_raise(rb_eRuntimeError, "REV wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "REV wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (rev); \
 } while (0)
 #define GetX509Rev(obj, rev) do { \
     TypedData_Get_Struct((obj), X509_REVOKED, &ossl_x509rev_type, (rev)); \
     if (!(rev)) { \
-	ossl_raise(rb_eRuntimeError, "REV wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "REV wasn't initialized!"); \
     } \
 } while (0)
 
@@ -28,7 +28,7 @@
  * Classes
  */
 VALUE cX509Rev;
-VALUE eX509RevError;
+static VALUE eX509RevError;
 
 static void
 ossl_x509rev_free(void *ptr)
@@ -39,7 +39,7 @@ ossl_x509rev_free(void *ptr)
 static const rb_data_type_t ossl_x509rev_type = {
     "OpenSSL/X509/REV",
     {
-	0, ossl_x509rev_free,
+        0, ossl_x509rev_free,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
 };
@@ -48,20 +48,16 @@ static const rb_data_type_t ossl_x509rev_type = {
  * PUBLIC
  */
 VALUE
-ossl_x509revoked_new(X509_REVOKED *rev)
+ossl_x509revoked_new(const X509_REVOKED *rev)
 {
     X509_REVOKED *new;
     VALUE obj;
 
     obj = NewX509Rev(cX509Rev);
-    if (!rev) {
-	new = X509_REVOKED_new();
-    } else {
-	new = X509_REVOKED_dup(rev);
-    }
-    if (!new) {
-	ossl_raise(eX509RevError, NULL);
-    }
+    /* OpenSSL 1.1.1 takes a non-const pointer */
+    new = X509_REVOKED_dup((X509_REVOKED *)rev);
+    if (!new)
+        ossl_raise(eX509RevError, "X509_REVOKED_dup");
     SetX509Rev(obj, new);
 
     return obj;
@@ -74,7 +70,7 @@ DupX509RevokedPtr(VALUE obj)
 
     GetX509Rev(obj, rev);
     if (!(new = X509_REVOKED_dup(rev))) {
-	ossl_raise(eX509RevError, NULL);
+        ossl_raise(eX509RevError, NULL);
     }
 
     return new;
@@ -91,7 +87,7 @@ ossl_x509revoked_alloc(VALUE klass)
 
     obj = NewX509Rev(klass);
     if (!(rev = X509_REVOKED_new())) {
-	ossl_raise(eX509RevError, NULL);
+        ossl_raise(eX509RevError, NULL);
     }
     SetX509Rev(obj, rev);
 
@@ -105,6 +101,7 @@ ossl_x509revoked_initialize(int argc, VALUE *argv, VALUE self)
     return self;
 }
 
+/* :nodoc: */
 static VALUE
 ossl_x509revoked_initialize_copy(VALUE self, VALUE other)
 {
@@ -116,7 +113,7 @@ ossl_x509revoked_initialize_copy(VALUE self, VALUE other)
 
     rev_new = X509_REVOKED_dup(rev_other);
     if (!rev_new)
-	ossl_raise(eX509RevError, "X509_REVOKED_dup");
+        ossl_raise(eX509RevError, "X509_REVOKED_dup");
 
     SetX509Rev(self, rev_new);
     X509_REVOKED_free(rev);
@@ -143,8 +140,8 @@ ossl_x509revoked_set_serial(VALUE self, VALUE num)
     GetX509Rev(self, rev);
     asn1int = num_to_asn1integer(num, NULL);
     if (!X509_REVOKED_set_serialNumber(rev, asn1int)) {
-	ASN1_INTEGER_free(asn1int);
-	ossl_raise(eX509RevError, "X509_REVOKED_set_serialNumber");
+        ASN1_INTEGER_free(asn1int);
+        ossl_raise(eX509RevError, "X509_REVOKED_set_serialNumber");
     }
     ASN1_INTEGER_free(asn1int);
 
@@ -160,7 +157,7 @@ ossl_x509revoked_get_time(VALUE self)
     GetX509Rev(self, rev);
     time = X509_REVOKED_get0_revocationDate(rev);
     if (!time)
-	return Qnil;
+        return Qnil;
 
     return asn1time_to_time(time);
 }
@@ -174,8 +171,8 @@ ossl_x509revoked_set_time(VALUE self, VALUE time)
     GetX509Rev(self, rev);
     asn1time = ossl_x509_time_adjust(NULL, time);
     if (!X509_REVOKED_set_revocationDate(rev, asn1time)) {
-	ASN1_TIME_free(asn1time);
-	ossl_raise(eX509RevError, "X509_REVOKED_set_revocationDate");
+        ASN1_TIME_free(asn1time);
+        ossl_raise(eX509RevError, "X509_REVOKED_set_revocationDate");
     }
     ASN1_TIME_free(asn1time);
 
@@ -189,19 +186,15 @@ ossl_x509revoked_get_extensions(VALUE self)
 {
     X509_REVOKED *rev;
     int count, i;
-    X509_EXTENSION *ext;
+    const X509_EXTENSION *ext;
     VALUE ary;
 
     GetX509Rev(self, rev);
     count = X509_REVOKED_get_ext_count(rev);
-    if (count < 0) {
-	OSSL_Debug("count < 0???");
-	return rb_ary_new();
-    }
-    ary = rb_ary_new2(count);
+    ary = rb_ary_new_capa(count);
     for (i=0; i<count; i++) {
-	ext = X509_REVOKED_get_ext(rev, i);
-	rb_ary_push(ary, ossl_x509ext_new(ext));
+        ext = X509_REVOKED_get_ext(rev, i);
+        rb_ary_push(ary, ossl_x509ext_new(ext));
     }
 
     return ary;
@@ -220,17 +213,17 @@ ossl_x509revoked_set_extensions(VALUE self, VALUE ary)
 
     Check_Type(ary, T_ARRAY);
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
+        OSSL_Check_Kind(RARRAY_AREF(ary, i), cX509Ext);
     }
     GetX509Rev(self, rev);
     for (i = X509_REVOKED_get_ext_count(rev); i > 0; i--)
         X509_EXTENSION_free(X509_REVOKED_delete_ext(rev, 0));
     for (i=0; i<RARRAY_LEN(ary); i++) {
-	item = RARRAY_AREF(ary, i);
-	ext = GetX509ExtPtr(item);
-	if(!X509_REVOKED_add_ext(rev, ext, -1)) {
-	    ossl_raise(eX509RevError, "X509_REVOKED_add_ext");
-	}
+        item = RARRAY_AREF(ary, i);
+        ext = GetX509ExtPtr(item);
+        if(!X509_REVOKED_add_ext(rev, ext, -1)) {
+            ossl_raise(eX509RevError, "X509_REVOKED_add_ext");
+        }
     }
 
     return ary;
@@ -243,7 +236,7 @@ ossl_x509revoked_add_extension(VALUE self, VALUE ext)
 
     GetX509Rev(self, rev);
     if (!X509_REVOKED_add_ext(rev, GetX509ExtPtr(ext), -1)) {
-	ossl_raise(eX509RevError, NULL);
+        ossl_raise(eX509RevError, NULL);
     }
 
     return ext;
@@ -260,11 +253,11 @@ ossl_x509revoked_to_der(VALUE self)
     GetX509Rev(self, rev);
     len = i2d_X509_REVOKED(rev, NULL);
     if (len <= 0)
-	ossl_raise(eX509RevError, "i2d_X509_REVOKED");
+        ossl_raise(eX509RevError, "i2d_X509_REVOKED");
     str = rb_str_new(NULL, len);
     p = (unsigned char *)RSTRING_PTR(str);
     if (i2d_X509_REVOKED(rev, &p) <= 0)
-	ossl_raise(eX509RevError, "i2d_X509_REVOKED");
+        ossl_raise(eX509RevError, "i2d_X509_REVOKED");
     ossl_str_adjust(str, p);
     return str;
 }
@@ -275,12 +268,6 @@ ossl_x509revoked_to_der(VALUE self)
 void
 Init_ossl_x509revoked(void)
 {
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     eX509RevError = rb_define_class_under(mX509, "RevokedError", eOSSLError);
 
     cX509Rev = rb_define_class_under(mX509, "Revoked", rb_cObject);
diff --git a/ext/openssl/ossl_x509store.c b/ext/openssl/ossl_x509store.c
index f27381ca90..9e43336c44 100644
--- a/ext/openssl/ossl_x509store.c
+++ b/ext/openssl/ossl_x509store.c
@@ -5,7 +5,7 @@
  */
 /*
  * This program is licensed under the same licence as Ruby.
- * (See the file 'LICENCE'.)
+ * (See the file 'COPYING'.)
  */
 #include "ossl.h"
 
@@ -13,14 +13,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509store_type, 0)
 #define SetX509Store(obj, st) do { \
     if (!(st)) { \
-	ossl_raise(rb_eRuntimeError, "STORE wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "STORE wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (st); \
 } while (0)
 #define GetX509Store(obj, st) do { \
     TypedData_Get_Struct((obj), X509_STORE, &ossl_x509store_type, (st)); \
     if (!(st)) { \
-	ossl_raise(rb_eRuntimeError, "STORE wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "STORE wasn't initialized!"); \
     } \
 } while (0)
 
@@ -28,14 +28,14 @@
     TypedData_Wrap_Struct((klass), &ossl_x509stctx_type, 0)
 #define SetX509StCtx(obj, ctx) do { \
     if (!(ctx)) { \
-	ossl_raise(rb_eRuntimeError, "STORE_CTX wasn't initialized!"); \
+        ossl_raise(rb_eRuntimeError, "STORE_CTX wasn't initialized!"); \
     } \
     RTYPEDDATA_DATA(obj) = (ctx); \
 } while (0)
 #define GetX509StCtx(obj, ctx) do { \
     TypedData_Get_Struct((obj), X509_STORE_CTX, &ossl_x509stctx_type, (ctx)); \
     if (!(ctx)) { \
-	ossl_raise(rb_eRuntimeError, "STORE_CTX is out of scope!"); \
+        ossl_raise(rb_eRuntimeError, "STORE_CTX is out of scope!"); \
     } \
 } while (0)
 
@@ -62,7 +62,7 @@ call_verify_cb_proc(VALUE arg)
 {
     struct ossl_verify_cb_args *args = (struct ossl_verify_cb_args *)arg;
     return rb_funcall(args->proc, rb_intern("call"), 2,
-		      args->preverify_ok, args->store_ctx);
+                      args->preverify_ok, args->store_ctx);
 }
 
 int
@@ -73,33 +73,33 @@ ossl_verify_cb_call(VALUE proc, int ok, X509_STORE_CTX *ctx)
     int state;
 
     if (NIL_P(proc))
-	return ok;
+        return ok;
 
     ret = Qfalse;
     rctx = rb_protect(ossl_x509stctx_new_i, (VALUE)ctx, &state);
     if (state) {
-	rb_set_errinfo(Qnil);
-	rb_warn("StoreContext initialization failure");
+        rb_set_errinfo(Qnil);
+        rb_warn("StoreContext initialization failure");
     }
     else {
-	args.proc = proc;
-	args.preverify_ok = ok ? Qtrue : Qfalse;
-	args.store_ctx = rctx;
-	ret = rb_protect(call_verify_cb_proc, (VALUE)&args, &state);
-	if (state) {
-	    rb_set_errinfo(Qnil);
-	    rb_warn("exception in verify_callback is ignored");
-	}
-	RTYPEDDATA_DATA(rctx) = NULL;
+        args.proc = proc;
+        args.preverify_ok = ok ? Qtrue : Qfalse;
+        args.store_ctx = rctx;
+        ret = rb_protect(call_verify_cb_proc, (VALUE)&args, &state);
+        if (state) {
+            rb_set_errinfo(Qnil);
+            rb_warn("exception in verify_callback is ignored");
+        }
+        RTYPEDDATA_DATA(rctx) = NULL;
     }
     if (ret == Qtrue) {
-	X509_STORE_CTX_set_error(ctx, X509_V_OK);
-	ok = 1;
+        X509_STORE_CTX_set_error(ctx, X509_V_OK);
+        ok = 1;
     }
     else {
-	if (X509_STORE_CTX_get_error(ctx) == X509_V_OK)
-	    X509_STORE_CTX_set_error(ctx, X509_V_ERR_CERT_REJECTED);
-	ok = 0;
+        if (X509_STORE_CTX_get_error(ctx) == X509_V_OK)
+            X509_STORE_CTX_set_error(ctx, X509_V_ERR_CERT_REJECTED);
+        ok = 0;
     }
 
     return ok;
@@ -108,9 +108,9 @@ ossl_verify_cb_call(VALUE proc, int ok, X509_STORE_CTX *ctx)
 /*
  * Classes
  */
-VALUE cX509Store;
-VALUE cX509StoreContext;
-VALUE eX509StoreError;
+static VALUE cX509Store;
+static VALUE cX509StoreContext;
+static VALUE eX509StoreError;
 
 static void
 ossl_x509store_mark(void *ptr)
@@ -159,10 +159,10 @@ x509store_verify_cb(int ok, X509_STORE_CTX *ctx)
 
     proc = (VALUE)X509_STORE_CTX_get_ex_data(ctx, stctx_ex_verify_cb_idx);
     if (!proc)
-	proc = (VALUE)X509_STORE_get_ex_data(X509_STORE_CTX_get0_store(ctx),
-					     store_ex_verify_cb_idx);
+        proc = (VALUE)X509_STORE_get_ex_data(X509_STORE_CTX_get0_store(ctx),
+                                             store_ex_verify_cb_idx);
     if (!proc)
-	return ok;
+        return ok;
 
     return ossl_verify_cb_call(proc, ok, ctx);
 }
@@ -190,9 +190,10 @@ ossl_x509store_set_vfy_cb(VALUE self, VALUE cb)
     X509_STORE *store;
 
     GetX509Store(self, store);
+    if (!X509_STORE_set_ex_data(store, store_ex_verify_cb_idx, (void *)cb))
+        ossl_raise(eX509StoreError, "X509_STORE_set_ex_data");
     rb_iv_set(self, "@verify_callback", cb);
-    // We don't need to trigger a write barrier because `rb_iv_set` did it.
-    X509_STORE_set_ex_data(store, store_ex_verify_cb_idx, (void *)cb);
+    RB_OBJ_WRITTEN(self, Qundef, cb);
 
     return cb;
 }
@@ -212,10 +213,6 @@ ossl_x509store_initialize(int argc, VALUE *argv, VALUE self)
     GetX509Store(self, store);
     if (argc != 0)
         rb_warn("OpenSSL::X509::Store.new does not take any arguments");
-#if !defined(HAVE_OPAQUE_OPENSSL)
-    /* [Bug #405] [Bug #1678] [Bug #3000]; already fixed? */
-    store->ex_data.sk = NULL;
-#endif
     X509_STORE_set_verify_cb(store, x509store_verify_cb);
     ossl_x509store_set_vfy_cb(self, Qnil);
 
@@ -223,7 +220,6 @@ ossl_x509store_initialize(int argc, VALUE *argv, VALUE self)
     rb_iv_set(self, "@error", Qnil);
     rb_iv_set(self, "@error_string", Qnil);
     rb_iv_set(self, "@chain", Qnil);
-    rb_iv_set(self, "@time", Qnil);
 
     return self;
 }
@@ -329,7 +325,12 @@ ossl_x509store_set_trust(VALUE self, VALUE trust)
 static VALUE
 ossl_x509store_set_time(VALUE self, VALUE time)
 {
-    rb_iv_set(self, "@time", time);
+    X509_STORE *store;
+    X509_VERIFY_PARAM *param;
+
+    GetX509Store(self, store);
+    param = X509_STORE_get0_param(store);
+    X509_VERIFY_PARAM_set_time(param, NUM2LONG(rb_Integer(time)));
     return time;
 }
 
@@ -357,15 +358,6 @@ ossl_x509store_add_file(VALUE self, VALUE file)
         ossl_raise(eX509StoreError, "X509_STORE_add_lookup");
     if (X509_LOOKUP_load_file(lookup, path, X509_FILETYPE_PEM) != 1)
         ossl_raise(eX509StoreError, "X509_LOOKUP_load_file");
-#if OPENSSL_VERSION_NUMBER < 0x10101000 || defined(LIBRESSL_VERSION_NUMBER)
-    /*
-     * X509_load_cert_crl_file() which is called from X509_LOOKUP_load_file()
-     * did not check the return value of X509_STORE_add_{cert,crl}(), leaking
-     * "cert already in hash table" errors on the error queue, if duplicate
-     * certificates are found. This will be fixed by OpenSSL 1.1.1.
-     */
-    ossl_clear_error();
-#endif
 
     return self;
 }
@@ -493,7 +485,7 @@ ossl_x509store_verify(int argc, VALUE *argv, VALUE self)
     rb_scan_args(argc, argv, "11", &cert, &chain);
     ctx = rb_funcall(cX509StoreContext, rb_intern("new"), 3, self, cert, chain);
     proc = rb_block_given_p() ?  rb_block_proc() :
-	   rb_iv_get(self, "@verify_callback");
+           rb_iv_get(self, "@verify_callback");
     rb_iv_set(ctx, "@verify_callback", proc);
     result = rb_funcall(ctx, rb_intern("verify"), 0);
 
@@ -521,10 +513,8 @@ static void
 ossl_x509stctx_free(void *ptr)
 {
     X509_STORE_CTX *ctx = ptr;
-    if (X509_STORE_CTX_get0_untrusted(ctx))
-	sk_X509_pop_free(X509_STORE_CTX_get0_untrusted(ctx), X509_free);
-    if (X509_STORE_CTX_get0_cert(ctx))
-	X509_free(X509_STORE_CTX_get0_cert(ctx));
+    sk_X509_pop_free(X509_STORE_CTX_get0_untrusted(ctx), X509_free);
+    X509_free((X509 *)X509_STORE_CTX_get0_cert(ctx));
     X509_STORE_CTX_free(ctx);
 }
 
@@ -564,7 +554,6 @@ ossl_x509stctx_new(X509_STORE_CTX *ctx)
 static VALUE ossl_x509stctx_set_flags(VALUE, VALUE);
 static VALUE ossl_x509stctx_set_purpose(VALUE, VALUE);
 static VALUE ossl_x509stctx_set_trust(VALUE, VALUE);
-static VALUE ossl_x509stctx_set_time(VALUE, VALUE);
 
 /*
  * call-seq:
@@ -575,7 +564,7 @@ static VALUE ossl_x509stctx_set_time(VALUE, VALUE);
 static VALUE
 ossl_x509stctx_initialize(int argc, VALUE *argv, VALUE self)
 {
-    VALUE store, cert, chain, t;
+    VALUE store, cert, chain;
     X509_STORE_CTX *ctx;
     X509_STORE *x509st;
     X509 *x509 = NULL;
@@ -599,8 +588,6 @@ ossl_x509stctx_initialize(int argc, VALUE *argv, VALUE self)
         sk_X509_pop_free(x509s, X509_free);
         ossl_raise(eX509StoreError, "X509_STORE_CTX_init");
     }
-    if (!NIL_P(t = rb_iv_get(store, "@time")))
-	ossl_x509stctx_set_time(self, t);
     rb_iv_set(self, "@verify_callback", rb_iv_get(store, "@verify_callback"));
     rb_iv_set(self, "@cert", cert);
 
@@ -622,7 +609,9 @@ ossl_x509stctx_verify(VALUE self)
 
     GetX509StCtx(self, ctx);
     VALUE cb = rb_iv_get(self, "@verify_callback");
-    X509_STORE_CTX_set_ex_data(ctx, stctx_ex_verify_cb_idx, (void *)cb);
+    if (!X509_STORE_CTX_set_ex_data(ctx, stctx_ex_verify_cb_idx, (void *)cb))
+        ossl_raise(eX509StoreError, "X509_STORE_CTX_set_ex_data");
+    RB_OBJ_WRITTEN(self, Qundef, cb);
 
     switch (X509_verify_cert(ctx)) {
       case 1:
@@ -631,7 +620,7 @@ ossl_x509stctx_verify(VALUE self)
         ossl_clear_error();
         return Qfalse;
       default:
-        ossl_raise(eX509CertError, "X509_verify_cert");
+        ossl_raise(eX509StoreError, "X509_verify_cert");
     }
 }
 
@@ -747,10 +736,14 @@ static VALUE
 ossl_x509stctx_get_curr_cert(VALUE self)
 {
     X509_STORE_CTX *ctx;
+    const X509 *x509;
 
     GetX509StCtx(self, ctx);
+    x509 = X509_STORE_CTX_get_current_cert(ctx);
+    if (!x509)
+        return Qnil;
 
-    return ossl_x509_new(X509_STORE_CTX_get_current_cert(ctx));
+    return ossl_x509_new(x509);
 }
 
 /*
@@ -765,12 +758,12 @@ static VALUE
 ossl_x509stctx_get_curr_crl(VALUE self)
 {
     X509_STORE_CTX *ctx;
-    X509_CRL *crl;
+    const X509_CRL *crl;
 
     GetX509StCtx(self, ctx);
     crl = X509_STORE_CTX_get0_current_crl(ctx);
     if (!crl)
-	return Qnil;
+        return Qnil;
 
     return ossl_x509crl_new(crl);
 }
@@ -866,19 +859,13 @@ void
 Init_ossl_x509store(void)
 {
 #undef rb_intern
-#if 0
-    mOSSL = rb_define_module("OpenSSL");
-    eOSSLError = rb_define_class_under(mOSSL, "OpenSSLError", rb_eStandardError);
-    mX509 = rb_define_module_under(mOSSL, "X509");
-#endif
-
     /* Register ext_data slot for verify callback Proc */
     stctx_ex_verify_cb_idx = X509_STORE_CTX_get_ex_new_index(0, (void *)"stctx_ex_verify_cb_idx", 0, 0, 0);
     if (stctx_ex_verify_cb_idx < 0)
-	ossl_raise(eOSSLError, "X509_STORE_CTX_get_ex_new_index");
+        ossl_raise(eOSSLError, "X509_STORE_CTX_get_ex_new_index");
     store_ex_verify_cb_idx = X509_STORE_get_ex_new_index(0, (void *)"store_ex_verify_cb_idx", 0, 0, 0);
     if (store_ex_verify_cb_idx < 0)
-	ossl_raise(eOSSLError, "X509_STORE_get_ex_new_index");
+        ossl_raise(eOSSLError, "X509_STORE_get_ex_new_index");
 
     eX509StoreError = rb_define_class_under(mX509, "StoreError", eOSSLError);
 
diff --git a/ext/pathname/depend b/ext/pathname/depend
deleted file mode 100644
index cca7877dad..0000000000
--- a/ext/pathname/depend
+++ /dev/null
@@ -1,174 +0,0 @@
-# AUTOGENERATED DEPENDENCIES START
-pathname.o: $(RUBY_EXTCONF_H)
-pathname.o: $(arch_hdrdir)/ruby/config.h
-pathname.o: $(hdrdir)/ruby.h
-pathname.o: $(hdrdir)/ruby/assert.h
-pathname.o: $(hdrdir)/ruby/backward.h
-pathname.o: $(hdrdir)/ruby/backward/2/assume.h
-pathname.o: $(hdrdir)/ruby/backward/2/attributes.h
-pathname.o: $(hdrdir)/ruby/backward/2/bool.h
-pathname.o: $(hdrdir)/ruby/backward/2/inttypes.h
-pathname.o: $(hdrdir)/ruby/backward/2/limits.h
-pathname.o: $(hdrdir)/ruby/backward/2/long_long.h
-pathname.o: $(hdrdir)/ruby/backward/2/stdalign.h
-pathname.o: $(hdrdir)/ruby/backward/2/stdarg.h
-pathname.o: $(hdrdir)/ruby/defines.h
-pathname.o: $(hdrdir)/ruby/encoding.h
-pathname.o: $(hdrdir)/ruby/intern.h
-pathname.o: $(hdrdir)/ruby/internal/abi.h
-pathname.o: $(hdrdir)/ruby/internal/anyargs.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/char.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/double.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/fixnum.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/gid_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/int.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/intptr_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/long.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/long_long.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/mode_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/off_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/pid_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/short.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/size_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/st_data_t.h
-pathname.o: $(hdrdir)/ruby/internal/arithmetic/uid_t.h
-pathname.o: $(hdrdir)/ruby/internal/assume.h
-pathname.o: $(hdrdir)/ruby/internal/attr/alloc_size.h
-pathname.o: $(hdrdir)/ruby/internal/attr/artificial.h
-pathname.o: $(hdrdir)/ruby/internal/attr/cold.h
-pathname.o: $(hdrdir)/ruby/internal/attr/const.h
-pathname.o: $(hdrdir)/ruby/internal/attr/constexpr.h
-pathname.o: $(hdrdir)/ruby/internal/attr/deprecated.h
-pathname.o: $(hdrdir)/ruby/internal/attr/diagnose_if.h
-pathname.o: $(hdrdir)/ruby/internal/attr/enum_extensibility.h
-pathname.o: $(hdrdir)/ruby/internal/attr/error.h
-pathname.o: $(hdrdir)/ruby/internal/attr/flag_enum.h
-pathname.o: $(hdrdir)/ruby/internal/attr/forceinline.h
-pathname.o: $(hdrdir)/ruby/internal/attr/format.h
-pathname.o: $(hdrdir)/ruby/internal/attr/maybe_unused.h
-pathname.o: $(hdrdir)/ruby/internal/attr/noalias.h
-pathname.o: $(hdrdir)/ruby/internal/attr/nodiscard.h
-pathname.o: $(hdrdir)/ruby/internal/attr/noexcept.h
-pathname.o: $(hdrdir)/ruby/internal/attr/noinline.h
-pathname.o: $(hdrdir)/ruby/internal/attr/nonnull.h
-pathname.o: $(hdrdir)/ruby/internal/attr/noreturn.h
-pathname.o: $(hdrdir)/ruby/internal/attr/packed_struct.h
-pathname.o: $(hdrdir)/ruby/internal/attr/pure.h
-pathname.o: $(hdrdir)/ruby/internal/attr/restrict.h
-pathname.o: $(hdrdir)/ruby/internal/attr/returns_nonnull.h
-pathname.o: $(hdrdir)/ruby/internal/attr/warning.h
-pathname.o: $(hdrdir)/ruby/internal/attr/weakref.h
-pathname.o: $(hdrdir)/ruby/internal/cast.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/apple.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/clang.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/gcc.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/intel.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/msvc.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_is/sunpro.h
-pathname.o: $(hdrdir)/ruby/internal/compiler_since.h
-pathname.o: $(hdrdir)/ruby/internal/config.h
-pathname.o: $(hdrdir)/ruby/internal/constant_p.h
-pathname.o: $(hdrdir)/ruby/internal/core.h
-pathname.o: $(hdrdir)/ruby/internal/core/rarray.h
-pathname.o: $(hdrdir)/ruby/internal/core/rbasic.h
-pathname.o: $(hdrdir)/ruby/internal/core/rbignum.h
-pathname.o: $(hdrdir)/ruby/internal/core/rclass.h
-pathname.o: $(hdrdir)/ruby/internal/core/rdata.h
-pathname.o: $(hdrdir)/ruby/internal/core/rfile.h
-pathname.o: $(hdrdir)/ruby/internal/core/rhash.h
-pathname.o: $(hdrdir)/ruby/internal/core/robject.h
-pathname.o: $(hdrdir)/ruby/internal/core/rregexp.h
-pathname.o: $(hdrdir)/ruby/internal/core/rstring.h
-pathname.o: $(hdrdir)/ruby/internal/core/rstruct.h
-pathname.o: $(hdrdir)/ruby/internal/core/rtypeddata.h
-pathname.o: $(hdrdir)/ruby/internal/ctype.h
-pathname.o: $(hdrdir)/ruby/internal/dllexport.h
-pathname.o: $(hdrdir)/ruby/internal/dosish.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/coderange.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/ctype.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/encoding.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/pathname.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/re.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/sprintf.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/string.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/symbol.h
-pathname.o: $(hdrdir)/ruby/internal/encoding/transcode.h
-pathname.o: $(hdrdir)/ruby/internal/error.h
-pathname.o: $(hdrdir)/ruby/internal/eval.h
-pathname.o: $(hdrdir)/ruby/internal/event.h
-pathname.o: $(hdrdir)/ruby/internal/fl_type.h
-pathname.o: $(hdrdir)/ruby/internal/gc.h
-pathname.o: $(hdrdir)/ruby/internal/glob.h
-pathname.o: $(hdrdir)/ruby/internal/globals.h
-pathname.o: $(hdrdir)/ruby/internal/has/attribute.h
-pathname.o: $(hdrdir)/ruby/internal/has/builtin.h
-pathname.o: $(hdrdir)/ruby/internal/has/c_attribute.h
-pathname.o: $(hdrdir)/ruby/internal/has/cpp_attribute.h
-pathname.o: $(hdrdir)/ruby/internal/has/declspec_attribute.h
-pathname.o: $(hdrdir)/ruby/internal/has/extension.h
-pathname.o: $(hdrdir)/ruby/internal/has/feature.h
-pathname.o: $(hdrdir)/ruby/internal/has/warning.h
-pathname.o: $(hdrdir)/ruby/internal/intern/array.h
-pathname.o: $(hdrdir)/ruby/internal/intern/bignum.h
-pathname.o: $(hdrdir)/ruby/internal/intern/class.h
-pathname.o: $(hdrdir)/ruby/internal/intern/compar.h
-pathname.o: $(hdrdir)/ruby/internal/intern/complex.h
-pathname.o: $(hdrdir)/ruby/internal/intern/cont.h
-pathname.o: $(hdrdir)/ruby/internal/intern/dir.h
-pathname.o: $(hdrdir)/ruby/internal/intern/enum.h
-pathname.o: $(hdrdir)/ruby/internal/intern/enumerator.h
-pathname.o: $(hdrdir)/ruby/internal/intern/error.h
-pathname.o: $(hdrdir)/ruby/internal/intern/eval.h
-pathname.o: $(hdrdir)/ruby/internal/intern/file.h
-pathname.o: $(hdrdir)/ruby/internal/intern/hash.h
-pathname.o: $(hdrdir)/ruby/internal/intern/io.h
-pathname.o: $(hdrdir)/ruby/internal/intern/load.h
-pathname.o: $(hdrdir)/ruby/internal/intern/marshal.h
-pathname.o: $(hdrdir)/ruby/internal/intern/numeric.h
-pathname.o: $(hdrdir)/ruby/internal/intern/object.h
-pathname.o: $(hdrdir)/ruby/internal/intern/parse.h
-pathname.o: $(hdrdir)/ruby/internal/intern/proc.h
-pathname.o: $(hdrdir)/ruby/internal/intern/process.h
-pathname.o: $(hdrdir)/ruby/internal/intern/random.h
-pathname.o: $(hdrdir)/ruby/internal/intern/range.h
-pathname.o: $(hdrdir)/ruby/internal/intern/rational.h
-pathname.o: $(hdrdir)/ruby/internal/intern/re.h
-pathname.o: $(hdrdir)/ruby/internal/intern/ruby.h
-pathname.o: $(hdrdir)/ruby/internal/intern/select.h
-pathname.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
-pathname.o: $(hdrdir)/ruby/internal/intern/signal.h
-pathname.o: $(hdrdir)/ruby/internal/intern/sprintf.h
-pathname.o: $(hdrdir)/ruby/internal/intern/string.h
-pathname.o: $(hdrdir)/ruby/internal/intern/struct.h
-pathname.o: $(hdrdir)/ruby/internal/intern/thread.h
-pathname.o: $(hdrdir)/ruby/internal/intern/time.h
-pathname.o: $(hdrdir)/ruby/internal/intern/variable.h
-pathname.o: $(hdrdir)/ruby/internal/intern/vm.h
-pathname.o: $(hdrdir)/ruby/internal/interpreter.h
-pathname.o: $(hdrdir)/ruby/internal/iterator.h
-pathname.o: $(hdrdir)/ruby/internal/memory.h
-pathname.o: $(hdrdir)/ruby/internal/method.h
-pathname.o: $(hdrdir)/ruby/internal/module.h
-pathname.o: $(hdrdir)/ruby/internal/newobj.h
-pathname.o: $(hdrdir)/ruby/internal/scan_args.h
-pathname.o: $(hdrdir)/ruby/internal/special_consts.h
-pathname.o: $(hdrdir)/ruby/internal/static_assert.h
-pathname.o: $(hdrdir)/ruby/internal/stdalign.h
-pathname.o: $(hdrdir)/ruby/internal/stdbool.h
-pathname.o: $(hdrdir)/ruby/internal/stdckdint.h
-pathname.o: $(hdrdir)/ruby/internal/symbol.h
-pathname.o: $(hdrdir)/ruby/internal/value.h
-pathname.o: $(hdrdir)/ruby/internal/value_type.h
-pathname.o: $(hdrdir)/ruby/internal/variable.h
-pathname.o: $(hdrdir)/ruby/internal/warning_push.h
-pathname.o: $(hdrdir)/ruby/internal/xmalloc.h
-pathname.o: $(hdrdir)/ruby/missing.h
-pathname.o: $(hdrdir)/ruby/onigmo.h
-pathname.o: $(hdrdir)/ruby/oniguruma.h
-pathname.o: $(hdrdir)/ruby/ruby.h
-pathname.o: $(hdrdir)/ruby/st.h
-pathname.o: $(hdrdir)/ruby/subst.h
-pathname.o: pathname.c
-# AUTOGENERATED DEPENDENCIES END
diff --git a/ext/pathname/extconf.rb b/ext/pathname/extconf.rb
deleted file mode 100644
index b4e1617b9e..0000000000
--- a/ext/pathname/extconf.rb
+++ /dev/null
@@ -1,3 +0,0 @@
-# frozen_string_literal: false
-require 'mkmf'
-create_makefile('pathname')
diff --git a/ext/pathname/lib/pathname.rb b/ext/pathname/lib/pathname.rb
deleted file mode 100644
index dc639174d5..0000000000
--- a/ext/pathname/lib/pathname.rb
+++ /dev/null
@@ -1,605 +0,0 @@
-# frozen_string_literal: true
-#
-# = pathname.rb
-#
-# Object-Oriented Pathname Class
-#
-# Author:: Tanaka Akira <akr@m17n.org>
-# Documentation:: Author and Gavin Sinclair
-#
-# For documentation, see class Pathname.
-#
-
-require 'pathname.so'
-
-class Pathname
-
-  VERSION = "0.3.0"
-
-  # :stopdoc:
-
-  # to_path is implemented so Pathname objects are usable with File.open, etc.
-  TO_PATH = :to_path
-
-  SAME_PATHS = if File::FNM_SYSCASE.nonzero?
-    # Avoid #zero? here because #casecmp can return nil.
-    proc {|a, b| a.casecmp(b) == 0}
-  else
-    proc {|a, b| a == b}
-  end
-
-
-  if File::ALT_SEPARATOR
-    SEPARATOR_LIST = "#{Regexp.quote File::ALT_SEPARATOR}#{Regexp.quote File::SEPARATOR}"
-    SEPARATOR_PAT = /[#{SEPARATOR_LIST}]/
-  else
-    SEPARATOR_LIST = "#{Regexp.quote File::SEPARATOR}"
-    SEPARATOR_PAT = /#{Regexp.quote File::SEPARATOR}/
-  end
-
-  if File.dirname('A:') == 'A:.' # DOSish drive letter
-    ABSOLUTE_PATH = /\A(?:[A-Za-z]:|#{SEPARATOR_PAT})/o
-  else
-    ABSOLUTE_PATH = /\A#{SEPARATOR_PAT}/o
-  end
-  private_constant :ABSOLUTE_PATH
-
-  # :startdoc:
-
-  # chop_basename(path) -> [pre-basename, basename] or nil
-  def chop_basename(path) # :nodoc:
-    base = File.basename(path)
-    if /\A#{SEPARATOR_PAT}?\z/o.match?(base)
-      return nil
-    else
-      return path[0, path.rindex(base)], base
-    end
-  end
-  private :chop_basename
-
-  # split_names(path) -> prefix, [name, ...]
-  def split_names(path) # :nodoc:
-    names = []
-    while r = chop_basename(path)
-      path, basename = r
-      names.unshift basename
-    end
-    return path, names
-  end
-  private :split_names
-
-  def prepend_prefix(prefix, relpath) # :nodoc:
-    if relpath.empty?
-      File.dirname(prefix)
-    elsif /#{SEPARATOR_PAT}/o.match?(prefix)
-      prefix = File.dirname(prefix)
-      prefix = File.join(prefix, "") if File.basename(prefix + 'a') != 'a'
-      prefix + relpath
-    else
-      prefix + relpath
-    end
-  end
-  private :prepend_prefix
-
-  # Returns clean pathname of +self+ with consecutive slashes and useless dots
-  # removed.  The filesystem is not accessed.
-  #
-  # If +consider_symlink+ is +true+, then a more conservative algorithm is used
-  # to avoid breaking symbolic linkages.  This may retain more +..+
-  # entries than absolutely necessary, but without accessing the filesystem,
-  # this can't be avoided.
-  #
-  # See Pathname#realpath.
-  #
-  def cleanpath(consider_symlink=false)
-    if consider_symlink
-      cleanpath_conservative
-    else
-      cleanpath_aggressive
-    end
-  end
-
-  #
-  # Clean the path simply by resolving and removing excess +.+ and +..+ entries.
-  # Nothing more, nothing less.
-  #
-  def cleanpath_aggressive # :nodoc:
-    path = @path
-    names = []
-    pre = path
-    while r = chop_basename(pre)
-      pre, base = r
-      case base
-      when '.'
-      when '..'
-        names.unshift base
-      else
-        if names[0] == '..'
-          names.shift
-        else
-          names.unshift base
-        end
-      end
-    end
-    pre.tr!(File::ALT_SEPARATOR, File::SEPARATOR) if File::ALT_SEPARATOR
-    if /#{SEPARATOR_PAT}/o.match?(File.basename(pre))
-      names.shift while names[0] == '..'
-    end
-    self.class.new(prepend_prefix(pre, File.join(*names)))
-  end
-  private :cleanpath_aggressive
-
-  # has_trailing_separator?(path) -> bool
-  def has_trailing_separator?(path) # :nodoc:
-    if r = chop_basename(path)
-      pre, basename = r
-      pre.length + basename.length < path.length
-    else
-      false
-    end
-  end
-  private :has_trailing_separator?
-
-  # add_trailing_separator(path) -> path
-  def add_trailing_separator(path) # :nodoc:
-    if File.basename(path + 'a') == 'a'
-      path
-    else
-      File.join(path, "") # xxx: Is File.join is appropriate to add separator?
-    end
-  end
-  private :add_trailing_separator
-
-  def del_trailing_separator(path) # :nodoc:
-    if r = chop_basename(path)
-      pre, basename = r
-      pre + basename
-    elsif /#{SEPARATOR_PAT}+\z/o =~ path
-      $` + File.dirname(path)[/#{SEPARATOR_PAT}*\z/o]
-    else
-      path
-    end
-  end
-  private :del_trailing_separator
-
-  def cleanpath_conservative # :nodoc:
-    path = @path
-    names = []
-    pre = path
-    while r = chop_basename(pre)
-      pre, base = r
-      names.unshift base if base != '.'
-    end
-    pre.tr!(File::ALT_SEPARATOR, File::SEPARATOR) if File::ALT_SEPARATOR
-    if /#{SEPARATOR_PAT}/o.match?(File.basename(pre))
-      names.shift while names[0] == '..'
-    end
-    if names.empty?
-      self.class.new(File.dirname(pre))
-    else
-      if names.last != '..' && File.basename(path) == '.'
-        names << '.'
-      end
-      result = prepend_prefix(pre, File.join(*names))
-      if /\A(?:\.|\.\.)\z/ !~ names.last && has_trailing_separator?(path)
-        self.class.new(add_trailing_separator(result))
-      else
-        self.class.new(result)
-      end
-    end
-  end
-  private :cleanpath_conservative
-
-  # Returns the parent directory.
-  #
-  # This is same as <code>self + '..'</code>.
-  def parent
-    self + '..'
-  end
-
-  # Returns +true+ if +self+ points to a mountpoint.
-  def mountpoint?
-    begin
-      stat1 = self.lstat
-      stat2 = self.parent.lstat
-      stat1.dev != stat2.dev || stat1.ino == stat2.ino
-    rescue Errno::ENOENT
-      false
-    end
-  end
-
-  #
-  # Predicate method for root directories.  Returns +true+ if the
-  # pathname consists of consecutive slashes.
-  #
-  # It doesn't access the filesystem.  So it may return +false+ for some
-  # pathnames which points to roots such as <tt>/usr/..</tt>.
-  #
-  def root?
-    chop_basename(@path) == nil && /#{SEPARATOR_PAT}/o.match?(@path)
-  end
-
-  # Predicate method for testing whether a path is absolute.
-  #
-  # It returns +true+ if the pathname begins with a slash.
-  #
-  #   p = Pathname.new('/im/sure')
-  #   p.absolute?
-  #       #=> true
-  #
-  #   p = Pathname.new('not/so/sure')
-  #   p.absolute?
-  #       #=> false
-  def absolute?
-    ABSOLUTE_PATH.match? @path
-  end
-
-  # The opposite of Pathname#absolute?
-  #
-  # It returns +false+ if the pathname begins with a slash.
-  #
-  #   p = Pathname.new('/im/sure')
-  #   p.relative?
-  #       #=> false
-  #
-  #   p = Pathname.new('not/so/sure')
-  #   p.relative?
-  #       #=> true
-  def relative?
-    !absolute?
-  end
-
-  #
-  # Iterates over each component of the path.
-  #
-  #   Pathname.new("/usr/bin/ruby").each_filename {|filename| ... }
-  #     # yields "usr", "bin", and "ruby".
-  #
-  # Returns an Enumerator if no block was given.
-  #
-  #   enum = Pathname.new("/usr/bin/ruby").each_filename
-  #     # ... do stuff ...
-  #   enum.each { |e| ... }
-  #     # yields "usr", "bin", and "ruby".
-  #
-  def each_filename # :yield: filename
-    return to_enum(__method__) unless block_given?
-    _, names = split_names(@path)
-    names.each {|filename| yield filename }
-    nil
-  end
-
-  # Iterates over and yields a new Pathname object
-  # for each element in the given path in descending order.
-  #
-  #  Pathname.new('/path/to/some/file.rb').descend {|v| p v}
-  #     #<Pathname:/>
-  #     #<Pathname:/path>
-  #     #<Pathname:/path/to>
-  #     #<Pathname:/path/to/some>
-  #     #<Pathname:/path/to/some/file.rb>
-  #
-  #  Pathname.new('path/to/some/file.rb').descend {|v| p v}
-  #     #<Pathname:path>
-  #     #<Pathname:path/to>
-  #     #<Pathname:path/to/some>
-  #     #<Pathname:path/to/some/file.rb>
-  #
-  # Returns an Enumerator if no block was given.
-  #
-  #   enum = Pathname.new("/usr/bin/ruby").descend
-  #     # ... do stuff ...
-  #   enum.each { |e| ... }
-  #     # yields Pathnames /, /usr, /usr/bin, and /usr/bin/ruby.
-  #
-  # It doesn't access the filesystem.
-  #
-  def descend
-    return to_enum(__method__) unless block_given?
-    vs = []
-    ascend {|v| vs << v }
-    vs.reverse_each {|v| yield v }
-    nil
-  end
-
-  # Iterates over and yields a new Pathname object
-  # for each element in the given path in ascending order.
-  #
-  #  Pathname.new('/path/to/some/file.rb').ascend {|v| p v}
-  #     #<Pathname:/path/to/some/file.rb>
-  #     #<Pathname:/path/to/some>
-  #     #<Pathname:/path/to>
-  #     #<Pathname:/path>
-  #     #<Pathname:/>
-  #
-  #  Pathname.new('path/to/some/file.rb').ascend {|v| p v}
-  #     #<Pathname:path/to/some/file.rb>
-  #     #<Pathname:path/to/some>
-  #     #<Pathname:path/to>
-  #     #<Pathname:path>
-  #
-  # Returns an Enumerator if no block was given.
-  #
-  #   enum = Pathname.new("/usr/bin/ruby").ascend
-  #     # ... do stuff ...
-  #   enum.each { |e| ... }
-  #     # yields Pathnames /usr/bin/ruby, /usr/bin, /usr, and /.
-  #
-  # It doesn't access the filesystem.
-  #
-  def ascend
-    return to_enum(__method__) unless block_given?
-    path = @path
-    yield self
-    while r = chop_basename(path)
-      path, = r
-      break if path.empty?
-      yield self.class.new(del_trailing_separator(path))
-    end
-  end
-
-  #
-  # Appends a pathname fragment to +self+ to produce a new Pathname object.
-  # Since +other+ is considered as a path relative to +self+, if +other+ is
-  # an absolute path, the new Pathname object is created from just +other+.
-  #
-  #   p1 = Pathname.new("/usr")      # Pathname:/usr
-  #   p2 = p1 + "bin/ruby"           # Pathname:/usr/bin/ruby
-  #   p3 = p1 + "/etc/passwd"        # Pathname:/etc/passwd
-  #
-  #   # / is aliased to +.
-  #   p4 = p1 / "bin/ruby"           # Pathname:/usr/bin/ruby
-  #   p5 = p1 / "/etc/passwd"        # Pathname:/etc/passwd
-  #
-  # This method doesn't access the file system; it is pure string manipulation.
-  #
-  def +(other)
-    other = Pathname.new(other) unless Pathname === other
-    Pathname.new(plus(@path, other.to_s))
-  end
-  alias / +
-
-  def plus(path1, path2) # -> path # :nodoc:
-    prefix2 = path2
-    index_list2 = []
-    basename_list2 = []
-    while r2 = chop_basename(prefix2)
-      prefix2, basename2 = r2
-      index_list2.unshift prefix2.length
-      basename_list2.unshift basename2
-    end
-    return path2 if prefix2 != ''
-    prefix1 = path1
-    while true
-      while !basename_list2.empty? && basename_list2.first == '.'
-        index_list2.shift
-        basename_list2.shift
-      end
-      break unless r1 = chop_basename(prefix1)
-      prefix1, basename1 = r1
-      next if basename1 == '.'
-      if basename1 == '..' || basename_list2.empty? || basename_list2.first != '..'
-        prefix1 = prefix1 + basename1
-        break
-      end
-      index_list2.shift
-      basename_list2.shift
-    end
-    r1 = chop_basename(prefix1)
-    if !r1 && (r1 = /#{SEPARATOR_PAT}/o.match?(File.basename(prefix1)))
-      while !basename_list2.empty? && basename_list2.first == '..'
-        index_list2.shift
-        basename_list2.shift
-      end
-    end
-    if !basename_list2.empty?
-      suffix2 = path2[index_list2.first..-1]
-      r1 ? File.join(prefix1, suffix2) : prefix1 + suffix2
-    else
-      r1 ? prefix1 : File.dirname(prefix1)
-    end
-  end
-  private :plus
-
-  #
-  # Joins the given pathnames onto +self+ to create a new Pathname object.
-  # This is effectively the same as using Pathname#+ to append +self+ and
-  # all arguments sequentially.
-  #
-  #   path0 = Pathname.new("/usr")                # Pathname:/usr
-  #   path0 = path0.join("bin/ruby")              # Pathname:/usr/bin/ruby
-  #       # is the same as
-  #   path1 = Pathname.new("/usr") + "bin/ruby"   # Pathname:/usr/bin/ruby
-  #   path0 == path1
-  #       #=> true
-  #
-  def join(*args)
-    return self if args.empty?
-    result = args.pop
-    result = Pathname.new(result) unless Pathname === result
-    return result if result.absolute?
-    args.reverse_each {|arg|
-      arg = Pathname.new(arg) unless Pathname === arg
-      result = arg + result
-      return result if result.absolute?
-    }
-    self + result
-  end
-
-  #
-  # Returns the children of the directory (files and subdirectories, not
-  # recursive) as an array of Pathname objects.
-  #
-  # By default, the returned pathnames will have enough information to access
-  # the files. If you set +with_directory+ to +false+, then the returned
-  # pathnames will contain the filename only.
-  #
-  # For example:
-  #   pn = Pathname("/usr/lib/ruby/1.8")
-  #   pn.children
-  #       # -> [ Pathname:/usr/lib/ruby/1.8/English.rb,
-  #              Pathname:/usr/lib/ruby/1.8/Env.rb,
-  #              Pathname:/usr/lib/ruby/1.8/abbrev.rb, ... ]
-  #   pn.children(false)
-  #       # -> [ Pathname:English.rb, Pathname:Env.rb, Pathname:abbrev.rb, ... ]
-  #
-  # Note that the results never contain the entries +.+ and +..+ in
-  # the directory because they are not children.
-  #
-  def children(with_directory=true)
-    with_directory = false if @path == '.'
-    result = []
-    Dir.foreach(@path) {|e|
-      next if e == '.' || e == '..'
-      if with_directory
-        result << self.class.new(File.join(@path, e))
-      else
-        result << self.class.new(e)
-      end
-    }
-    result
-  end
-
-  # Iterates over the children of the directory
-  # (files and subdirectories, not recursive).
-  #
-  # It yields Pathname object for each child.
-  #
-  # By default, the yielded pathnames will have enough information to access
-  # the files.
-  #
-  # If you set +with_directory+ to +false+, then the returned pathnames will
-  # contain the filename only.
-  #
-  #   Pathname("/usr/local").each_child {|f| p f }
-  #   #=> #<Pathname:/usr/local/share>
-  #   #   #<Pathname:/usr/local/bin>
-  #   #   #<Pathname:/usr/local/games>
-  #   #   #<Pathname:/usr/local/lib>
-  #   #   #<Pathname:/usr/local/include>
-  #   #   #<Pathname:/usr/local/sbin>
-  #   #   #<Pathname:/usr/local/src>
-  #   #   #<Pathname:/usr/local/man>
-  #
-  #   Pathname("/usr/local").each_child(false) {|f| p f }
-  #   #=> #<Pathname:share>
-  #   #   #<Pathname:bin>
-  #   #   #<Pathname:games>
-  #   #   #<Pathname:lib>
-  #   #   #<Pathname:include>
-  #   #   #<Pathname:sbin>
-  #   #   #<Pathname:src>
-  #   #   #<Pathname:man>
-  #
-  # Note that the results never contain the entries +.+ and +..+ in
-  # the directory because they are not children.
-  #
-  # See Pathname#children
-  #
-  def each_child(with_directory=true, &b)
-    children(with_directory).each(&b)
-  end
-
-  #
-  # Returns a relative path from the given +base_directory+ to the receiver.
-  #
-  # If +self+ is absolute, then +base_directory+ must be absolute too.
-  #
-  # If +self+ is relative, then +base_directory+ must be relative too.
-  #
-  # This method doesn't access the filesystem.  It assumes no symlinks.
-  #
-  # ArgumentError is raised when it cannot find a relative path.
-  #
-  # Note that this method does not handle situations where the case sensitivity
-  # of the filesystem in use differs from the operating system default.
-  #
-  def relative_path_from(base_directory)
-    base_directory = Pathname.new(base_directory) unless base_directory.is_a? Pathname
-    dest_directory = self.cleanpath.to_s
-    base_directory = base_directory.cleanpath.to_s
-    dest_prefix = dest_directory
-    dest_names = []
-    while r = chop_basename(dest_prefix)
-      dest_prefix, basename = r
-      dest_names.unshift basename if basename != '.'
-    end
-    base_prefix = base_directory
-    base_names = []
-    while r = chop_basename(base_prefix)
-      base_prefix, basename = r
-      base_names.unshift basename if basename != '.'
-    end
-    unless SAME_PATHS[dest_prefix, base_prefix]
-      raise ArgumentError, "different prefix: #{dest_prefix.inspect} and #{base_directory.inspect}"
-    end
-    while !dest_names.empty? &&
-          !base_names.empty? &&
-          SAME_PATHS[dest_names.first, base_names.first]
-      dest_names.shift
-      base_names.shift
-    end
-    if base_names.include? '..'
-      raise ArgumentError, "base_directory has ..: #{base_directory.inspect}"
-    end
-    base_names.fill('..')
-    relpath_names = base_names + dest_names
-    if relpath_names.empty?
-      Pathname.new('.')
-    else
-      Pathname.new(File.join(*relpath_names))
-    end
-  end
-end
-
-
-class Pathname    # * Find *
-  #
-  # Iterates over the directory tree in a depth first manner, yielding a
-  # Pathname for each file under "this" directory.
-  #
-  # Returns an Enumerator if no block is given.
-  #
-  # Since it is implemented by the standard library module Find, Find.prune can
-  # be used to control the traversal.
-  #
-  # If +self+ is +.+, yielded pathnames begin with a filename in the
-  # current directory, not +./+.
-  #
-  # See Find.find
-  #
-  def find(ignore_error: true) # :yield: pathname
-    return to_enum(__method__, ignore_error: ignore_error) unless block_given?
-    require 'find'
-    if @path == '.'
-      Find.find(@path, ignore_error: ignore_error) {|f| yield self.class.new(f.sub(%r{\A\./}, '')) }
-    else
-      Find.find(@path, ignore_error: ignore_error) {|f| yield self.class.new(f) }
-    end
-  end
-end
-
-
-class Pathname    # * FileUtils *
-  # Creates a full path, including any intermediate directories that don't yet
-  # exist.
-  #
-  # See FileUtils.mkpath and FileUtils.mkdir_p
-  def mkpath(mode: nil)
-    require 'fileutils'
-    FileUtils.mkpath(@path, mode: mode)
-    nil
-  end
-
-  # Recursively deletes a directory, including all directories beneath it.
-  #
-  # See FileUtils.rm_rf
-  def rmtree(noop: nil, verbose: nil, secure: nil)
-    # The name "rmtree" is borrowed from File::Path of Perl.
-    # File::Path provides "mkpath" and "rmtree".
-    require 'fileutils'
-    FileUtils.rm_rf(@path, noop: noop, verbose: verbose, secure: secure)
-    nil
-  end
-end
-
diff --git a/ext/pathname/pathname.c b/ext/pathname/pathname.c
deleted file mode 100644
index cdecb3f897..0000000000
--- a/ext/pathname/pathname.c
+++ /dev/null
@@ -1,1668 +0,0 @@
-#include "ruby.h"
-#include "ruby/encoding.h"
-
-static VALUE rb_cPathname;
-static ID id_ENOTDIR;
-static ID id_at_path;
-static ID id_atime;
-static ID id_base;
-static ID id_basename;
-static ID id_binread;
-static ID id_binwrite;
-static ID id_birthtime;
-static ID id_blockdev_p;
-static ID id_chardev_p;
-static ID id_chmod;
-static ID id_chown;
-static ID id_ctime;
-static ID id_directory_p;
-static ID id_dirname;
-static ID id_empty_p;
-static ID id_entries;
-static ID id_executable_p;
-static ID id_executable_real_p;
-static ID id_exist_p;
-static ID id_expand_path;
-static ID id_extname;
-static ID id_file_p;
-static ID id_fnmatch;
-static ID id_foreach;
-static ID id_ftype;
-static ID id_getwd;
-static ID id_glob;
-static ID id_grpowned_p;
-static ID id_lchmod;
-static ID id_lchown;
-static ID id_link;
-static ID id_lstat;
-static ID id_lutime;
-static ID id_mkdir;
-static ID id_mtime;
-static ID id_open;
-static ID id_owned_p;
-static ID id_pipe_p;
-static ID id_read;
-static ID id_readable_p;
-static ID id_readable_real_p;
-static ID id_readlines;
-static ID id_readlink;
-static ID id_realdirpath;
-static ID id_realpath;
-static ID id_rename;
-static ID id_rmdir;
-static ID id_setgid_p;
-static ID id_setuid_p;
-static ID id_size;
-static ID id_size_p;
-static ID id_socket_p;
-static ID id_split;
-static ID id_stat;
-static ID id_sticky_p;
-static ID id_sub;
-static ID id_symlink;
-static ID id_symlink_p;
-static ID id_sysopen;
-static ID id_to_path;
-static ID id_truncate;
-static ID id_unlink;
-static ID id_utime;
-static ID id_world_readable_p;
-static ID id_world_writable_p;
-static ID id_writable_p;
-static ID id_writable_real_p;
-static ID id_write;
-static ID id_zero_p;
-
-static VALUE
-get_strpath(VALUE obj)
-{
-    VALUE strpath;
-    strpath = rb_ivar_get(obj, id_at_path);
-    if (!RB_TYPE_P(strpath, T_STRING))
-        rb_raise(rb_eTypeError, "unexpected @path");
-    return strpath;
-}
-
-static void
-set_strpath(VALUE obj, VALUE val)
-{
-    rb_ivar_set(obj, id_at_path, val);
-}
-
-/*
- * Create a Pathname object from the given String (or String-like object).
- * If +path+ contains a NULL character (<tt>\0</tt>), an ArgumentError is raised.
- */
-static VALUE
-path_initialize(VALUE self, VALUE arg)
-{
-    VALUE str;
-    if (RB_TYPE_P(arg, T_STRING)) {
-        str = arg;
-    }
-    else {
-        str = rb_check_funcall(arg, id_to_path, 0, NULL);
-        if (str == Qundef)
-            str = arg;
-        StringValue(str);
-    }
-    if (memchr(RSTRING_PTR(str), '\0', RSTRING_LEN(str)))
-        rb_raise(rb_eArgError, "pathname contains null byte");
-    str = rb_obj_dup(str);
-
-    set_strpath(self, str);
-    return self;
-}
-
-/*
- * call-seq:
- *   pathname.freeze -> obj
- *
- * Freezes this Pathname.
- *
- * See Object.freeze.
- */
-static VALUE
-path_freeze(VALUE self)
-{
-    rb_call_super(0, 0);
-    rb_str_freeze(get_strpath(self));
-    return self;
-}
-
-/*
- *  Compare this pathname with +other+.  The comparison is string-based.
- *  Be aware that two different paths (<tt>foo.txt</tt> and <tt>./foo.txt</tt>)
- *  can refer to the same file.
- */
-static VALUE
-path_eq(VALUE self, VALUE other)
-{
-    if (!rb_obj_is_kind_of(other, rb_cPathname))
-        return Qfalse;
-    return rb_str_equal(get_strpath(self), get_strpath(other));
-}
-
-/*
- *  Provides a case-sensitive comparison operator for pathnames.
- *
- *	Pathname.new('/usr') <=> Pathname.new('/usr/bin')
- *	    #=> -1
- *	Pathname.new('/usr/bin') <=> Pathname.new('/usr/bin')
- *	    #=> 0
- *	Pathname.new('/usr/bin') <=> Pathname.new('/USR/BIN')
- *	    #=> 1
- *
- *  It will return +-1+, +0+ or +1+ depending on the value of the left argument
- *  relative to the right argument. Or it will return +nil+ if the arguments
- *  are not comparable.
- */
-static VALUE
-path_cmp(VALUE self, VALUE other)
-{
-    VALUE s1, s2;
-    char *p1, *p2;
-    char *e1, *e2;
-    if (!rb_obj_is_kind_of(other, rb_cPathname))
-        return Qnil;
-    s1 = get_strpath(self);
-    s2 = get_strpath(other);
-    p1 = RSTRING_PTR(s1);
-    p2 = RSTRING_PTR(s2);
-    e1 = p1 + RSTRING_LEN(s1);
-    e2 = p2 + RSTRING_LEN(s2);
-    while (p1 < e1 && p2 < e2) {
-        int c1, c2;
-        c1 = (unsigned char)*p1++;
-        c2 = (unsigned char)*p2++;
-        if (c1 == '/') c1 = '\0';
-        if (c2 == '/') c2 = '\0';
-        if (c1 != c2) {
-            if (c1 < c2)
-                return INT2FIX(-1);
-            else
-                return INT2FIX(1);
-        }
-    }
-    if (p1 < e1)
-        return INT2FIX(1);
-    if (p2 < e2)
-        return INT2FIX(-1);
-    return INT2FIX(0);
-}
-
-#ifndef ST2FIX
-#define ST2FIX(h) LONG2FIX((long)(h))
-#endif
-
-/* :nodoc: */
-static VALUE
-path_hash(VALUE self)
-{
-    return ST2FIX(rb_str_hash(get_strpath(self)));
-}
-
-/*
- *  call-seq:
- *    pathname.to_s             -> string
- *    pathname.to_path          -> string
- *
- *  Return the path as a String.
- *
- *  to_path is implemented so Pathname objects are usable with File.open, etc.
- */
-static VALUE
-path_to_s(VALUE self)
-{
-    return rb_obj_dup(get_strpath(self));
-}
-
-/* :nodoc: */
-static VALUE
-path_inspect(VALUE self)
-{
-    const char *c = rb_obj_classname(self);
-    VALUE str = get_strpath(self);
-    return rb_sprintf("#<%s:%"PRIsVALUE">", c, str);
-}
-
-/*
- * Return a pathname which is substituted by String#sub.
- *
- *	path1 = Pathname.new('/usr/bin/perl')
- *	path1.sub('perl', 'ruby')
- *	    #=> #<Pathname:/usr/bin/ruby>
- */
-static VALUE
-path_sub(int argc, VALUE *argv, VALUE self)
-{
-    VALUE str = get_strpath(self);
-
-    if (rb_block_given_p()) {
-        str = rb_block_call(str, id_sub, argc, argv, 0, 0);
-    }
-    else {
-        str = rb_funcallv(str, id_sub, argc, argv);
-    }
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Return a pathname with +repl+ added as a suffix to the basename.
- *
- * If self has no extension part, +repl+ is appended.
- *
- *	Pathname.new('/usr/bin/shutdown').sub_ext('.rb')
- *	    #=> #<Pathname:/usr/bin/shutdown.rb>
- */
-static VALUE
-path_sub_ext(VALUE self, VALUE repl)
-{
-    VALUE str = get_strpath(self);
-    VALUE str2;
-    long extlen;
-    const char *ext;
-    const char *p;
-
-    StringValue(repl);
-    p = RSTRING_PTR(str);
-    extlen = RSTRING_LEN(str);
-    ext = ruby_enc_find_extname(p, &extlen, rb_enc_get(str));
-    if (ext == NULL) {
-        ext = p + RSTRING_LEN(str);
-    }
-    else if (extlen <= 1) {
-        ext += extlen;
-    }
-    str2 = rb_str_subseq(str, 0, ext-p);
-    rb_str_append(str2, repl);
-    return rb_class_new_instance(1, &str2, rb_obj_class(self));
-}
-
-/* Facade for File */
-
-/*
- * Returns the real (absolute) pathname for +self+ in the actual
- * filesystem.
- *
- * Does not contain symlinks or useless dots, +..+ and +.+.
- *
- * All components of the pathname must exist when this method is
- * called.
- *
- */
-static VALUE
-path_realpath(int argc, VALUE *argv, VALUE self)
-{
-    VALUE basedir, str;
-    rb_scan_args(argc, argv, "01", &basedir);
-    str = rb_funcall(rb_cFile, id_realpath, 2, get_strpath(self), basedir);
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Returns the real (absolute) pathname of +self+ in the actual filesystem.
- *
- * Does not contain symlinks or useless dots, +..+ and +.+.
- *
- * The last component of the real pathname can be nonexistent.
- */
-static VALUE
-path_realdirpath(int argc, VALUE *argv, VALUE self)
-{
-    VALUE basedir, str;
-    rb_scan_args(argc, argv, "01", &basedir);
-    str = rb_funcall(rb_cFile, id_realdirpath, 2, get_strpath(self), basedir);
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * call-seq:
- *   pathname.each_line {|line| ... }
- *   pathname.each_line(sep=$/ [, open_args]) {|line| block }     -> nil
- *   pathname.each_line(limit [, open_args]) {|line| block }      -> nil
- *   pathname.each_line(sep, limit [, open_args]) {|line| block } -> nil
- *   pathname.each_line(...)                                      -> an_enumerator
- *
- * Iterates over each line in the file and yields a String object for each.
- */
-static VALUE
-path_each_line(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    if (rb_block_given_p()) {
-        return rb_block_call_kw(rb_cFile, id_foreach, 1+n, args, 0, 0, RB_PASS_CALLED_KEYWORDS);
-    }
-    else {
-        return rb_funcallv_kw(rb_cFile, id_foreach, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-    }
-}
-
-/*
- * call-seq:
- *   pathname.read([length [, offset]]) -> string
- *   pathname.read([length [, offset]], open_args) -> string
- *
- * Returns all data from the file, or the first +N+ bytes if specified.
- *
- * See File.read.
- *
- */
-static VALUE
-path_read(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    return rb_funcallv_kw(rb_cFile, id_read, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-}
-
-/*
- * call-seq:
- *   pathname.binread([length [, offset]]) -> string
- *
- * Returns all the bytes from the file, or the first +N+ if specified.
- *
- * See File.binread.
- *
- */
-static VALUE
-path_binread(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[3];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "02", &args[1], &args[2]);
-    return rb_funcallv(rb_cFile, id_binread, 1+n, args);
-}
-
-/*
- * call-seq:
- *   pathname.write(string, [offset] )   => fixnum
- *   pathname.write(string, [offset], open_args )   => fixnum
- *
- * Writes +contents+ to the file.
- *
- * See File.write.
- *
- */
-static VALUE
-path_write(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    return rb_funcallv_kw(rb_cFile, id_write, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-}
-
-/*
- * call-seq:
- *   pathname.binwrite(string, [offset] )   => fixnum
- *   pathname.binwrite(string, [offset], open_args )   => fixnum
- *
- * Writes +contents+ to the file, opening it in binary mode.
- *
- * See File.binwrite.
- *
- */
-static VALUE
-path_binwrite(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    return rb_funcallv_kw(rb_cFile, id_binwrite, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-}
-
-/*
- * call-seq:
- *   pathname.readlines(sep=$/ [, open_args])     -> array
- *   pathname.readlines(limit [, open_args])      -> array
- *   pathname.readlines(sep, limit [, open_args]) -> array
- *
- * Returns all the lines from the file.
- *
- * See File.readlines.
- *
- */
-static VALUE
-path_readlines(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    return rb_funcallv_kw(rb_cFile, id_readlines, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-}
-
-/*
- * call-seq:
- *   pathname.sysopen([mode, [perm]])  -> fixnum
- *
- * See IO.sysopen.
- *
- */
-static VALUE
-path_sysopen(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[3];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "02", &args[1], &args[2]);
-    return rb_funcallv(rb_cIO, id_sysopen, 1+n, args);
-}
-
-/*
- * call-seq:
- *   pathname.atime	-> time
- *
- * Returns the last access time for the file.
- *
- * See File.atime.
- */
-static VALUE
-path_atime(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_atime, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.birthtime	-> time
- *
- * Returns the birth time for the file.
- * If the platform doesn't have birthtime, raises NotImplementedError.
- *
- * See File.birthtime.
- */
-static VALUE
-path_birthtime(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_birthtime, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.ctime	-> time
- *
- * Returns the last change time, using directory information, not the file itself.
- *
- * See File.ctime.
- */
-static VALUE
-path_ctime(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_ctime, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.mtime	-> time
- *
- * Returns the last modified time of the file.
- *
- * See File.mtime.
- */
-static VALUE
-path_mtime(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_mtime, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.chmod(mode_int)	-> integer
- *
- * Changes file permissions.
- *
- * See File.chmod.
- */
-static VALUE
-path_chmod(VALUE self, VALUE mode)
-{
-    return rb_funcall(rb_cFile, id_chmod, 2, mode, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.lchmod(mode_int)	-> integer
- *
- * Same as Pathname.chmod, but does not follow symbolic links.
- *
- * See File.lchmod.
- */
-static VALUE
-path_lchmod(VALUE self, VALUE mode)
-{
-    return rb_funcall(rb_cFile, id_lchmod, 2, mode, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.chown(owner_int, group_int)	-> integer
- *
- * Change owner and group of the file.
- *
- * See File.chown.
- */
-static VALUE
-path_chown(VALUE self, VALUE owner, VALUE group)
-{
-    return rb_funcall(rb_cFile, id_chown, 3, owner, group, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.lchown(owner_int, group_int)	-> integer
- *
- * Same as Pathname.chown, but does not follow symbolic links.
- *
- * See File.lchown.
- */
-static VALUE
-path_lchown(VALUE self, VALUE owner, VALUE group)
-{
-    return rb_funcall(rb_cFile, id_lchown, 3, owner, group, get_strpath(self));
-}
-
-/*
- * call-seq:
- *    pathname.fnmatch(pattern, [flags])        -> true or false
- *    pathname.fnmatch?(pattern, [flags])       -> true or false
- *
- * Return +true+ if the receiver matches the given pattern.
- *
- * See File.fnmatch.
- */
-static VALUE
-path_fnmatch(int argc, VALUE *argv, VALUE self)
-{
-    VALUE str = get_strpath(self);
-    VALUE pattern, flags;
-    if (rb_scan_args(argc, argv, "11", &pattern, &flags) == 1)
-        return rb_funcall(rb_cFile, id_fnmatch, 2, pattern, str);
-    else
-        return rb_funcall(rb_cFile, id_fnmatch, 3, pattern, str, flags);
-}
-
-/*
- * call-seq:
- *   pathname.ftype	-> string
- *
- * Returns "type" of file ("file", "directory", etc).
- *
- * See File.ftype.
- */
-static VALUE
-path_ftype(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_ftype, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.make_link(old)
- *
- * Creates a hard link at _pathname_.
- *
- * See File.link.
- */
-static VALUE
-path_make_link(VALUE self, VALUE old)
-{
-    return rb_funcall(rb_cFile, id_link, 2, old, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.open()
- *   pathname.open(mode="r" [, opt])                        -> file
- *   pathname.open([mode [, perm]] [, opt])                 -> file
- *   pathname.open(mode="r" [, opt]) {|file| block }        -> obj
- *   pathname.open([mode [, perm]] [, opt]) {|file| block } -> obj
- *
- * Opens the file for reading or writing.
- *
- * See File.open.
- */
-static VALUE
-path_open(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[4];
-    int n;
-
-    args[0] = get_strpath(self);
-    n = rb_scan_args(argc, argv, "03", &args[1], &args[2], &args[3]);
-    if (rb_block_given_p()) {
-        return rb_block_call_kw(rb_cFile, id_open, 1+n, args, 0, 0, RB_PASS_CALLED_KEYWORDS);
-    }
-    else {
-        return rb_funcallv_kw(rb_cFile, id_open, 1+n, args, RB_PASS_CALLED_KEYWORDS);
-    }
-}
-
-/*
- * Read symbolic link.
- *
- * See File.readlink.
- */
-static VALUE
-path_readlink(VALUE self)
-{
-    VALUE str;
-    str = rb_funcall(rb_cFile, id_readlink, 1, get_strpath(self));
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Rename the file.
- *
- * See File.rename.
- */
-static VALUE
-path_rename(VALUE self, VALUE to)
-{
-    return rb_funcall(rb_cFile, id_rename, 2, get_strpath(self), to);
-}
-
-/*
- * Returns a File::Stat object.
- *
- * See File.stat.
- */
-static VALUE
-path_stat(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_stat, 1, get_strpath(self));
-}
-
-/*
- * See File.lstat.
- */
-static VALUE
-path_lstat(VALUE self)
-{
-    return rb_funcall(rb_cFile, id_lstat, 1, get_strpath(self));
-}
-
-/*
- * call-seq:
- *   pathname.make_symlink(old)
- *
- * Creates a symbolic link.
- *
- * See File.symlink.
- */
-static VALUE
-path_make_symlink(VALUE self, VALUE old)
-{
-    return rb_funcall(rb_cFile, id_symlink, 2, old, get_strpath(self));
-}
-
-/*
- * Truncates the file to +length+ bytes.
- *
- * See File.truncate.
- */
-static VALUE
-path_truncate(VALUE self, VALUE length)
-{
-    return rb_funcall(rb_cFile, id_truncate, 2, get_strpath(self), length);
-}
-
-/*
- * Update the access and modification times of the file.
- *
- * See File.utime.
- */
-static VALUE
-path_utime(VALUE self, VALUE atime, VALUE mtime)
-{
-    return rb_funcall(rb_cFile, id_utime, 3, atime, mtime, get_strpath(self));
-}
-
-/*
- * Update the access and modification times of the file.
- *
- * Same as Pathname#utime, but does not follow symbolic links.
- *
- * See File.lutime.
- */
-static VALUE
-path_lutime(VALUE self, VALUE atime, VALUE mtime)
-{
-    return rb_funcall(rb_cFile, id_lutime, 3, atime, mtime, get_strpath(self));
-}
-
-/*
- * Returns the last component of the path.
- *
- * See File.basename.
- */
-static VALUE
-path_basename(int argc, VALUE *argv, VALUE self)
-{
-    VALUE str = get_strpath(self);
-    VALUE fext;
-    if (rb_scan_args(argc, argv, "01", &fext) == 0)
-        str = rb_funcall(rb_cFile, id_basename, 1, str);
-    else
-        str = rb_funcall(rb_cFile, id_basename, 2, str, fext);
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Returns all but the last component of the path.
- *
- * See File.dirname.
- */
-static VALUE
-path_dirname(VALUE self)
-{
-    VALUE str = get_strpath(self);
-    str = rb_funcall(rb_cFile, id_dirname, 1, str);
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Returns the file's extension.
- *
- * See File.extname.
- */
-static VALUE
-path_extname(VALUE self)
-{
-    VALUE str = get_strpath(self);
-    return rb_funcall(rb_cFile, id_extname, 1, str);
-}
-
-/*
- * Returns the absolute path for the file.
- *
- * See File.expand_path.
- */
-static VALUE
-path_expand_path(int argc, VALUE *argv, VALUE self)
-{
-    VALUE str = get_strpath(self);
-    VALUE dname;
-    if (rb_scan_args(argc, argv, "01", &dname) == 0)
-        str = rb_funcall(rb_cFile, id_expand_path, 1, str);
-    else
-        str = rb_funcall(rb_cFile, id_expand_path, 2, str, dname);
-    return rb_class_new_instance(1, &str, rb_obj_class(self));
-}
-
-/*
- * Returns the #dirname and the #basename in an Array.
- *
- * See File.split.
- */
-static VALUE
-path_split(VALUE self)
-{
-    VALUE str = get_strpath(self);
-    VALUE ary, dirname, basename;
-    ary = rb_funcall(rb_cFile, id_split, 1, str);
-    Check_Type(ary, T_ARRAY);
-    dirname = rb_ary_entry(ary, 0);
-    basename = rb_ary_entry(ary, 1);
-    dirname = rb_class_new_instance(1, &dirname, rb_obj_class(self));
-    basename = rb_class_new_instance(1, &basename, rb_obj_class(self));
-    return rb_ary_new3(2, dirname, basename);
-}
-
-/*
- * See FileTest.blockdev?.
- */
-static VALUE
-path_blockdev_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_blockdev_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.chardev?.
- */
-static VALUE
-path_chardev_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_chardev_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.executable?.
- */
-static VALUE
-path_executable_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_executable_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.executable_real?.
- */
-static VALUE
-path_executable_real_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_executable_real_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.exist?.
- */
-static VALUE
-path_exist_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_exist_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.grpowned?.
- */
-static VALUE
-path_grpowned_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_grpowned_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.directory?.
- */
-static VALUE
-path_directory_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_directory_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.file?.
- */
-static VALUE
-path_file_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_file_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.pipe?.
- */
-static VALUE
-path_pipe_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_pipe_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.socket?.
- */
-static VALUE
-path_socket_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_socket_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.owned?.
- */
-static VALUE
-path_owned_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_owned_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.readable?.
- */
-static VALUE
-path_readable_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_readable_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.world_readable?.
- */
-static VALUE
-path_world_readable_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_world_readable_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.readable_real?.
- */
-static VALUE
-path_readable_real_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_readable_real_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.setuid?.
- */
-static VALUE
-path_setuid_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_setuid_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.setgid?.
- */
-static VALUE
-path_setgid_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_setgid_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.size.
- */
-static VALUE
-path_size(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_size, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.size?.
- */
-static VALUE
-path_size_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_size_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.sticky?.
- */
-static VALUE
-path_sticky_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_sticky_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.symlink?.
- */
-static VALUE
-path_symlink_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_symlink_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.writable?.
- */
-static VALUE
-path_writable_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_writable_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.world_writable?.
- */
-static VALUE
-path_world_writable_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_world_writable_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.writable_real?.
- */
-static VALUE
-path_writable_real_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_writable_real_p, 1, get_strpath(self));
-}
-
-/*
- * See FileTest.zero?.
- */
-static VALUE
-path_zero_p(VALUE self)
-{
-    return rb_funcall(rb_mFileTest, id_zero_p, 1, get_strpath(self));
-}
-
-/*
- * Tests the file is empty.
- *
- * See Dir#empty? and FileTest.empty?.
- */
-static VALUE
-path_empty_p(VALUE self)
-{
-
-    VALUE path = get_strpath(self);
-    if (RTEST(rb_funcall(rb_mFileTest, id_directory_p, 1, path)))
-        return rb_funcall(rb_cDir, id_empty_p, 1, path);
-    else
-        return rb_funcall(rb_mFileTest, id_empty_p, 1, path);
-}
-
-static VALUE
-s_glob_i(RB_BLOCK_CALL_FUNC_ARGLIST(elt, klass))
-{
-    return rb_yield(rb_class_new_instance(1, &elt, klass));
-}
-
-/*
- * Returns or yields Pathname objects.
- *
- *  Pathname.glob("lib/i*.rb")
- *	#=> [#<Pathname:lib/ipaddr.rb>, #<Pathname:lib/irb.rb>]
- *
- * See Dir.glob.
- */
-static VALUE
-path_s_glob(int argc, VALUE *argv, VALUE klass)
-{
-    VALUE args[3];
-    int n;
-
-    n = rb_scan_args(argc, argv, "12", &args[0], &args[1], &args[2]);
-    if (rb_block_given_p()) {
-        return rb_block_call_kw(rb_cDir, id_glob, n, args, s_glob_i, klass, RB_PASS_CALLED_KEYWORDS);
-    }
-    else {
-        VALUE ary;
-        long i;
-        ary = rb_funcallv_kw(rb_cDir, id_glob, n, args, RB_PASS_CALLED_KEYWORDS);
-        ary = rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
-        for (i = 0; i < RARRAY_LEN(ary); i++) {
-            VALUE elt = RARRAY_AREF(ary, i);
-            elt = rb_class_new_instance(1, &elt, klass);
-            rb_ary_store(ary, i, elt);
-        }
-        return ary;
-    }
-}
-
-static VALUE
-glob_i(RB_BLOCK_CALL_FUNC_ARGLIST(elt, self))
-{
-    elt = rb_funcall(self, '+', 1, elt);
-    return rb_yield(elt);
-}
-
-/*
- * Returns or yields Pathname objects.
- *
- *  Pathname("ruby-2.4.2").glob("R*.md")
- *  #=> [#<Pathname:ruby-2.4.2/README.md>, #<Pathname:ruby-2.4.2/README.ja.md>]
- *
- * See Dir.glob.
- * This method uses the +base+ keyword argument of Dir.glob.
- */
-static VALUE
-path_glob(int argc, VALUE *argv, VALUE self)
-{
-    VALUE args[3];
-    int n;
-
-    n = rb_scan_args(argc, argv, "11", &args[0], &args[1]);
-    if (n == 1)
-      args[1] = INT2FIX(0);
-
-    args[2] = rb_hash_new();
-    rb_hash_aset(args[2], ID2SYM(id_base), get_strpath(self));
-
-    n = 3;
-
-    if (rb_block_given_p()) {
-        return rb_block_call_kw(rb_cDir, id_glob, n, args, glob_i, self, RB_PASS_KEYWORDS);
-    }
-    else {
-        VALUE ary;
-        long i;
-        ary = rb_funcallv_kw(rb_cDir, id_glob, n, args, RB_PASS_KEYWORDS);
-        ary = rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
-        for (i = 0; i < RARRAY_LEN(ary); i++) {
-            VALUE elt = RARRAY_AREF(ary, i);
-            elt = rb_funcall(self, '+', 1, elt);
-            rb_ary_store(ary, i, elt);
-        }
-        return ary;
-    }
-}
-
-/*
- * Returns the current working directory as a Pathname.
- *
- *	Pathname.getwd
- *	    #=> #<Pathname:/home/zzak/projects/ruby>
- *
- * See Dir.getwd.
- */
-static VALUE
-path_s_getwd(VALUE klass)
-{
-    VALUE str;
-    str = rb_funcall(rb_cDir, id_getwd, 0);
-    return rb_class_new_instance(1, &str, klass);
-}
-
-/*
- * Return the entries (files and subdirectories) in the directory, each as a
- * Pathname object.
- *
- * The results contains just the names in the directory, without any trailing
- * slashes or recursive look-up.
- *
- *   pp Pathname.new('/usr/local').entries
- *   #=> [#<Pathname:share>,
- *   #    #<Pathname:lib>,
- *   #    #<Pathname:..>,
- *   #    #<Pathname:include>,
- *   #    #<Pathname:etc>,
- *   #    #<Pathname:bin>,
- *   #    #<Pathname:man>,
- *   #    #<Pathname:games>,
- *   #    #<Pathname:.>,
- *   #    #<Pathname:sbin>,
- *   #    #<Pathname:src>]
- *
- * The result may contain the current directory <code>#<Pathname:.></code> and
- * the parent directory <code>#<Pathname:..></code>.
- *
- * If you don't want +.+ and +..+ and
- * want directories, consider Pathname#children.
- */
-static VALUE
-path_entries(VALUE self)
-{
-    VALUE klass, str, ary;
-    long i;
-    klass = rb_obj_class(self);
-    str = get_strpath(self);
-    ary = rb_funcall(rb_cDir, id_entries, 1, str);
-    ary = rb_convert_type(ary, T_ARRAY, "Array", "to_ary");
-    for (i = 0; i < RARRAY_LEN(ary); i++) {
-        VALUE elt = RARRAY_AREF(ary, i);
-        elt = rb_class_new_instance(1, &elt, klass);
-        rb_ary_store(ary, i, elt);
-    }
-    return ary;
-}
-
-/*
- * Create the referenced directory.
- *
- * See Dir.mkdir.
- */
-static VALUE
-path_mkdir(int argc, VALUE *argv, VALUE self)
-{
-    VALUE str = get_strpath(self);
-    VALUE vmode;
-    if (rb_scan_args(argc, argv, "01", &vmode) == 0)
-        return rb_funcall(rb_cDir, id_mkdir, 1, str);
-    else
-        return rb_funcall(rb_cDir, id_mkdir, 2, str, vmode);
-}
-
-/*
- * Remove the referenced directory.
- *
- * See Dir.rmdir.
- */
-static VALUE
-path_rmdir(VALUE self)
-{
-    return rb_funcall(rb_cDir, id_rmdir, 1, get_strpath(self));
-}
-
-/*
- * Opens the referenced directory.
- *
- * See Dir.open.
- */
-static VALUE
-path_opendir(VALUE self)
-{
-    VALUE args[1];
-
-    args[0] = get_strpath(self);
-    return rb_block_call(rb_cDir, id_open, 1, args, 0, 0);
-}
-
-static VALUE
-each_entry_i(RB_BLOCK_CALL_FUNC_ARGLIST(elt, klass))
-{
-    return rb_yield(rb_class_new_instance(1, &elt, klass));
-}
-
-/*
- * Iterates over the entries (files and subdirectories) in the directory,
- * yielding a Pathname object for each entry.
- */
-static VALUE
-path_each_entry(VALUE self)
-{
-    VALUE args[1];
-    RETURN_ENUMERATOR(self, 0, 0);
-
-    args[0] = get_strpath(self);
-    return rb_block_call(rb_cDir, id_foreach, 1, args, each_entry_i, rb_obj_class(self));
-}
-
-static VALUE
-unlink_body(VALUE str)
-{
-    return rb_funcall(rb_cDir, id_unlink, 1, str);
-}
-
-static VALUE
-unlink_rescue(VALUE str, VALUE errinfo)
-{
-    return rb_funcall(rb_cFile, id_unlink, 1, str);
-}
-
-/*
- * Removes a file or directory, using File.unlink if +self+ is a file, or
- * Dir.unlink as necessary.
- */
-static VALUE
-path_unlink(VALUE self)
-{
-    VALUE eENOTDIR = rb_const_get_at(rb_mErrno, id_ENOTDIR);
-    VALUE str = get_strpath(self);
-    return rb_rescue2(unlink_body, str, unlink_rescue, str, eENOTDIR, (VALUE)0);
-}
-
-/*
- * :call-seq:
- *  Pathname(path)  -> pathname
- *
- * Creates a new Pathname object from the given string, +path+, and returns
- * pathname object.
- *
- * In order to use this constructor, you must first require the Pathname
- * standard library extension.
- *
- *	require 'pathname'
- *	Pathname("/home/zzak")
- *	#=> #<Pathname:/home/zzak>
- *
- * See also Pathname::new for more information.
- */
-static VALUE
-path_f_pathname(VALUE self, VALUE str)
-{
-    if (CLASS_OF(str) == rb_cPathname)
-        return str;
-    return rb_class_new_instance(1, &str, rb_cPathname);
-}
-
-/*
- *
- * Pathname represents the name of a file or directory on the filesystem,
- * but not the file itself.
- *
- * The pathname depends on the Operating System: Unix, Windows, etc.
- * This library works with pathnames of local OS, however non-Unix pathnames
- * are supported experimentally.
- *
- * A Pathname can be relative or absolute.  It's not until you try to
- * reference the file that it even matters whether the file exists or not.
- *
- * Pathname is immutable.  It has no method for destructive update.
- *
- * The goal of this class is to manipulate file path information in a neater
- * way than standard Ruby provides.  The examples below demonstrate the
- * difference.
- *
- * *All* functionality from File, FileTest, and some from Dir and FileUtils is
- * included, in an unsurprising way.  It is essentially a facade for all of
- * these, and more.
- *
- * == Examples
- *
- * === Example 1: Using Pathname
- *
- *   require 'pathname'
- *   pn = Pathname.new("/usr/bin/ruby")
- *   size = pn.size              # 27662
- *   isdir = pn.directory?       # false
- *   dir  = pn.dirname           # Pathname:/usr/bin
- *   base = pn.basename          # Pathname:ruby
- *   dir, base = pn.split        # [Pathname:/usr/bin, Pathname:ruby]
- *   data = pn.read
- *   pn.open { |f| _ }
- *   pn.each_line { |line| _ }
- *
- * === Example 2: Using standard Ruby
- *
- *   pn = "/usr/bin/ruby"
- *   size = File.size(pn)        # 27662
- *   isdir = File.directory?(pn) # false
- *   dir  = File.dirname(pn)     # "/usr/bin"
- *   base = File.basename(pn)    # "ruby"
- *   dir, base = File.split(pn)  # ["/usr/bin", "ruby"]
- *   data = File.read(pn)
- *   File.open(pn) { |f| _ }
- *   File.foreach(pn) { |line| _ }
- *
- * === Example 3: Special features
- *
- *   p1 = Pathname.new("/usr/lib")   # Pathname:/usr/lib
- *   p2 = p1 + "ruby/1.8"            # Pathname:/usr/lib/ruby/1.8
- *   p3 = p1.parent                  # Pathname:/usr
- *   p4 = p2.relative_path_from(p3)  # Pathname:lib/ruby/1.8
- *   pwd = Pathname.pwd              # Pathname:/home/gavin
- *   pwd.absolute?                   # true
- *   p5 = Pathname.new "."           # Pathname:.
- *   p5 = p5 + "music/../articles"   # Pathname:music/../articles
- *   p5.cleanpath                    # Pathname:articles
- *   p5.realpath                     # Pathname:/home/gavin/articles
- *   p5.children                     # [Pathname:/home/gavin/articles/linux, ...]
- *
- * == Breakdown of functionality
- *
- * === Core methods
- *
- * These methods are effectively manipulating a String, because that's
- * all a path is.  None of these access the file system except for
- * #mountpoint?, #children, #each_child, #realdirpath and #realpath.
- *
- * - +
- * - #join
- * - #parent
- * - #root?
- * - #absolute?
- * - #relative?
- * - #relative_path_from
- * - #each_filename
- * - #cleanpath
- * - #realpath
- * - #realdirpath
- * - #children
- * - #each_child
- * - #mountpoint?
- *
- * === File status predicate methods
- *
- * These methods are a facade for FileTest:
- * - #blockdev?
- * - #chardev?
- * - #directory?
- * - #executable?
- * - #executable_real?
- * - #exist?
- * - #file?
- * - #grpowned?
- * - #owned?
- * - #pipe?
- * - #readable?
- * - #world_readable?
- * - #readable_real?
- * - #setgid?
- * - #setuid?
- * - #size
- * - #size?
- * - #socket?
- * - #sticky?
- * - #symlink?
- * - #writable?
- * - #world_writable?
- * - #writable_real?
- * - #zero?
- *
- * === File property and manipulation methods
- *
- * These methods are a facade for File:
- * - #atime
- * - #birthtime
- * - #ctime
- * - #mtime
- * - #chmod(mode)
- * - #lchmod(mode)
- * - #chown(owner, group)
- * - #lchown(owner, group)
- * - #fnmatch(pattern, *args)
- * - #fnmatch?(pattern, *args)
- * - #ftype
- * - #make_link(old)
- * - #open(*args, &block)
- * - #readlink
- * - #rename(to)
- * - #stat
- * - #lstat
- * - #make_symlink(old)
- * - #truncate(length)
- * - #utime(atime, mtime)
- * - #lutime(atime, mtime)
- * - #basename(*args)
- * - #dirname
- * - #extname
- * - #expand_path(*args)
- * - #split
- *
- * === Directory methods
- *
- * These methods are a facade for Dir:
- * - Pathname.glob(*args)
- * - Pathname.getwd / Pathname.pwd
- * - #rmdir
- * - #entries
- * - #each_entry(&block)
- * - #mkdir(*args)
- * - #opendir(*args)
- *
- * === IO
- *
- * These methods are a facade for IO:
- * - #each_line(*args, &block)
- * - #read(*args)
- * - #binread(*args)
- * - #readlines(*args)
- * - #sysopen(*args)
- * - #write(*args)
- * - #binwrite(*args)
- *
- * === Utilities
- *
- * These methods are a mixture of Find, FileUtils, and others:
- * - #find(&block)
- * - #mkpath
- * - #rmtree
- * - #unlink / #delete
- *
- *
- * == Method documentation
- *
- * As the above section shows, most of the methods in Pathname are facades.  The
- * documentation for these methods generally just says, for instance, "See
- * FileTest.writable?", as you should be familiar with the original method
- * anyway, and its documentation (e.g. through +ri+) will contain more
- * information.  In some cases, a brief description will follow.
- */
-void
-Init_pathname(void)
-{
-#ifdef HAVE_RB_EXT_RACTOR_SAFE
-    rb_ext_ractor_safe(true);
-#endif
-
-    InitVM(pathname);
-
-    rb_cPathname = rb_define_class("Pathname", rb_cObject);
-    rb_define_method(rb_cPathname, "initialize", path_initialize, 1);
-    rb_define_method(rb_cPathname, "freeze", path_freeze, 0);
-    rb_define_method(rb_cPathname, "==", path_eq, 1);
-    rb_define_method(rb_cPathname, "===", path_eq, 1);
-    rb_define_method(rb_cPathname, "eql?", path_eq, 1);
-    rb_define_method(rb_cPathname, "<=>", path_cmp, 1);
-    rb_define_method(rb_cPathname, "hash", path_hash, 0);
-    rb_define_method(rb_cPathname, "to_s", path_to_s, 0);
-    rb_define_method(rb_cPathname, "to_path", path_to_s, 0);
-    rb_define_method(rb_cPathname, "inspect", path_inspect, 0);
-    rb_define_method(rb_cPathname, "sub", path_sub, -1);
-    rb_define_method(rb_cPathname, "sub_ext", path_sub_ext, 1);
-    rb_define_method(rb_cPathname, "realpath", path_realpath, -1);
-    rb_define_method(rb_cPathname, "realdirpath", path_realdirpath, -1);
-    rb_define_method(rb_cPathname, "each_line", path_each_line, -1);
-    rb_define_method(rb_cPathname, "read", path_read, -1);
-    rb_define_method(rb_cPathname, "binread", path_binread, -1);
-    rb_define_method(rb_cPathname, "readlines", path_readlines, -1);
-    rb_define_method(rb_cPathname, "write", path_write, -1);
-    rb_define_method(rb_cPathname, "binwrite", path_binwrite, -1);
-    rb_define_method(rb_cPathname, "sysopen", path_sysopen, -1);
-    rb_define_method(rb_cPathname, "atime", path_atime, 0);
-    rb_define_method(rb_cPathname, "birthtime", path_birthtime, 0);
-    rb_define_method(rb_cPathname, "ctime", path_ctime, 0);
-    rb_define_method(rb_cPathname, "mtime", path_mtime, 0);
-    rb_define_method(rb_cPathname, "chmod", path_chmod, 1);
-    rb_define_method(rb_cPathname, "lchmod", path_lchmod, 1);
-    rb_define_method(rb_cPathname, "chown", path_chown, 2);
-    rb_define_method(rb_cPathname, "lchown", path_lchown, 2);
-    rb_define_method(rb_cPathname, "fnmatch", path_fnmatch, -1);
-    rb_define_method(rb_cPathname, "fnmatch?", path_fnmatch, -1);
-    rb_define_method(rb_cPathname, "ftype", path_ftype, 0);
-    rb_define_method(rb_cPathname, "make_link", path_make_link, 1);
-    rb_define_method(rb_cPathname, "open", path_open, -1);
-    rb_define_method(rb_cPathname, "readlink", path_readlink, 0);
-    rb_define_method(rb_cPathname, "rename", path_rename, 1);
-    rb_define_method(rb_cPathname, "stat", path_stat, 0);
-    rb_define_method(rb_cPathname, "lstat", path_lstat, 0);
-    rb_define_method(rb_cPathname, "make_symlink", path_make_symlink, 1);
-    rb_define_method(rb_cPathname, "truncate", path_truncate, 1);
-    rb_define_method(rb_cPathname, "utime", path_utime, 2);
-    rb_define_method(rb_cPathname, "lutime", path_lutime, 2);
-    rb_define_method(rb_cPathname, "basename", path_basename, -1);
-    rb_define_method(rb_cPathname, "dirname", path_dirname, 0);
-    rb_define_method(rb_cPathname, "extname", path_extname, 0);
-    rb_define_method(rb_cPathname, "expand_path", path_expand_path, -1);
-    rb_define_method(rb_cPathname, "split", path_split, 0);
-    rb_define_method(rb_cPathname, "blockdev?", path_blockdev_p, 0);
-    rb_define_method(rb_cPathname, "chardev?", path_chardev_p, 0);
-    rb_define_method(rb_cPathname, "executable?", path_executable_p, 0);
-    rb_define_method(rb_cPathname, "executable_real?", path_executable_real_p, 0);
-    rb_define_method(rb_cPathname, "exist?", path_exist_p, 0);
-    rb_define_method(rb_cPathname, "grpowned?", path_grpowned_p, 0);
-    rb_define_method(rb_cPathname, "directory?", path_directory_p, 0);
-    rb_define_method(rb_cPathname, "file?", path_file_p, 0);
-    rb_define_method(rb_cPathname, "pipe?", path_pipe_p, 0);
-    rb_define_method(rb_cPathname, "socket?", path_socket_p, 0);
-    rb_define_method(rb_cPathname, "owned?", path_owned_p, 0);
-    rb_define_method(rb_cPathname, "readable?", path_readable_p, 0);
-    rb_define_method(rb_cPathname, "world_readable?", path_world_readable_p, 0);
-    rb_define_method(rb_cPathname, "readable_real?", path_readable_real_p, 0);
-    rb_define_method(rb_cPathname, "setuid?", path_setuid_p, 0);
-    rb_define_method(rb_cPathname, "setgid?", path_setgid_p, 0);
-    rb_define_method(rb_cPathname, "size", path_size, 0);
-    rb_define_method(rb_cPathname, "size?", path_size_p, 0);
-    rb_define_method(rb_cPathname, "sticky?", path_sticky_p, 0);
-    rb_define_method(rb_cPathname, "symlink?", path_symlink_p, 0);
-    rb_define_method(rb_cPathname, "writable?", path_writable_p, 0);
-    rb_define_method(rb_cPathname, "world_writable?", path_world_writable_p, 0);
-    rb_define_method(rb_cPathname, "writable_real?", path_writable_real_p, 0);
-    rb_define_method(rb_cPathname, "zero?", path_zero_p, 0);
-    rb_define_method(rb_cPathname, "empty?", path_empty_p, 0);
-    rb_define_singleton_method(rb_cPathname, "glob", path_s_glob, -1);
-    rb_define_singleton_method(rb_cPathname, "getwd", path_s_getwd, 0);
-    rb_define_singleton_method(rb_cPathname, "pwd", path_s_getwd, 0);
-    rb_define_method(rb_cPathname, "glob", path_glob, -1);
-    rb_define_method(rb_cPathname, "entries", path_entries, 0);
-    rb_define_method(rb_cPathname, "mkdir", path_mkdir, -1);
-    rb_define_method(rb_cPathname, "rmdir", path_rmdir, 0);
-    rb_define_method(rb_cPathname, "opendir", path_opendir, 0);
-    rb_define_method(rb_cPathname, "each_entry", path_each_entry, 0);
-    rb_define_method(rb_cPathname, "unlink", path_unlink, 0);
-    rb_define_method(rb_cPathname, "delete", path_unlink, 0);
-    rb_undef_method(rb_cPathname, "=~");
-    rb_define_global_function("Pathname", path_f_pathname, 1);
-}
-
-void
-InitVM_pathname(void)
-{
-#undef rb_intern
-    id_at_path = rb_intern("@path");
-    id_to_path = rb_intern("to_path");
-    id_ENOTDIR = rb_intern("ENOTDIR");
-    id_atime = rb_intern("atime");
-    id_basename = rb_intern("basename");
-    id_base = rb_intern("base");
-    id_binread = rb_intern("binread");
-    id_binwrite = rb_intern("binwrite");
-    id_birthtime = rb_intern("birthtime");
-    id_blockdev_p = rb_intern("blockdev?");
-    id_chardev_p = rb_intern("chardev?");
-    id_chmod = rb_intern("chmod");
-    id_chown = rb_intern("chown");
-    id_ctime = rb_intern("ctime");
-    id_directory_p = rb_intern("directory?");
-    id_dirname = rb_intern("dirname");
-    id_empty_p = rb_intern("empty?");
-    id_entries = rb_intern("entries");
-    id_executable_p = rb_intern("executable?");
-    id_executable_real_p = rb_intern("executable_real?");
-    id_exist_p = rb_intern("exist?");
-    id_expand_path = rb_intern("expand_path");
-    id_extname = rb_intern("extname");
-    id_file_p = rb_intern("file?");
-    id_fnmatch = rb_intern("fnmatch");
-    id_foreach = rb_intern("foreach");
-    id_ftype = rb_intern("ftype");
-    id_getwd = rb_intern("getwd");
-    id_glob = rb_intern("glob");
-    id_grpowned_p = rb_intern("grpowned?");
-    id_lchmod = rb_intern("lchmod");
-    id_lchown = rb_intern("lchown");
-    id_link = rb_intern("link");
-    id_lstat = rb_intern("lstat");
-    id_lutime = rb_intern("lutime");
-    id_mkdir = rb_intern("mkdir");
-    id_mtime = rb_intern("mtime");
-    id_open = rb_intern("open");
-    id_owned_p = rb_intern("owned?");
-    id_pipe_p = rb_intern("pipe?");
-    id_read = rb_intern("read");
-    id_readable_p = rb_intern("readable?");
-    id_readable_real_p = rb_intern("readable_real?");
-    id_readlines = rb_intern("readlines");
-    id_readlink = rb_intern("readlink");
-    id_realdirpath = rb_intern("realdirpath");
-    id_realpath = rb_intern("realpath");
-    id_rename = rb_intern("rename");
-    id_rmdir = rb_intern("rmdir");
-    id_setgid_p = rb_intern("setgid?");
-    id_setuid_p = rb_intern("setuid?");
-    id_size = rb_intern("size");
-    id_size_p = rb_intern("size?");
-    id_socket_p = rb_intern("socket?");
-    id_split = rb_intern("split");
-    id_stat = rb_intern("stat");
-    id_sticky_p = rb_intern("sticky?");
-    id_sub = rb_intern("sub");
-    id_symlink = rb_intern("symlink");
-    id_symlink_p = rb_intern("symlink?");
-    id_sysopen = rb_intern("sysopen");
-    id_truncate = rb_intern("truncate");
-    id_unlink = rb_intern("unlink");
-    id_utime = rb_intern("utime");
-    id_world_readable_p = rb_intern("world_readable?");
-    id_world_writable_p = rb_intern("world_writable?");
-    id_writable_p = rb_intern("writable?");
-    id_writable_real_p = rb_intern("writable_real?");
-    id_write = rb_intern("write");
-    id_zero_p = rb_intern("zero?");
-}
diff --git a/ext/pathname/pathname.gemspec b/ext/pathname/pathname.gemspec
deleted file mode 100644
index 890bc2fde9..0000000000
--- a/ext/pathname/pathname.gemspec
+++ /dev/null
@@ -1,32 +0,0 @@
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", "ext/lib"].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Tanaka Akira"]
-  spec.email         = ["akr@fsij.org"]
-
-  spec.summary       = %q{Representation of the name of a file or directory on the filesystem}
-  spec.description   = %q{Representation of the name of a file or directory on the filesystem}
-  spec.homepage      = "https://github.com/ruby/pathname"
-  spec.required_ruby_version = Gem::Requirement.new(">= 2.7.0")
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = "exe"
-  spec.executables   = []
-  spec.require_paths = ["lib"]
-  spec.extensions    = %w[ext/pathname/extconf.rb]
-end
diff --git a/ext/psych/depend b/ext/psych/depend
index a4d9ca9a6a..95175841a2 100644
--- a/ext/psych/depend
+++ b/ext/psych/depend
@@ -152,6 +152,7 @@ psych.o: $(hdrdir)/ruby/internal/intern/re.h
 psych.o: $(hdrdir)/ruby/internal/intern/ruby.h
 psych.o: $(hdrdir)/ruby/internal/intern/select.h
 psych.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+psych.o: $(hdrdir)/ruby/internal/intern/set.h
 psych.o: $(hdrdir)/ruby/internal/intern/signal.h
 psych.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 psych.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -329,6 +330,7 @@ psych_emitter.o: $(hdrdir)/ruby/internal/intern/re.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/ruby.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/select.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+psych_emitter.o: $(hdrdir)/ruby/internal/intern/set.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/signal.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 psych_emitter.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -506,6 +508,7 @@ psych_parser.o: $(hdrdir)/ruby/internal/intern/re.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/ruby.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/select.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+psych_parser.o: $(hdrdir)/ruby/internal/intern/set.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/signal.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 psych_parser.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -683,6 +686,7 @@ psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/re.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/ruby.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/select.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/set.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/signal.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 psych_to_ruby.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -860,6 +864,7 @@ psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/re.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/ruby.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/select.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/set.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/signal.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 psych_yaml_tree.o: $(hdrdir)/ruby/internal/intern/string.h
diff --git a/ext/psych/extconf.rb b/ext/psych/extconf.rb
index e7dd0bb60a..589e201c1c 100644
--- a/ext/psych/extconf.rb
+++ b/ext/psych/extconf.rb
@@ -36,8 +36,11 @@ if yaml_source
   libyaml = "libyaml.#$LIBEXT"
   $cleanfiles << libyaml
   $LOCAL_LIBS.prepend("$(LIBYAML) ")
-else # default to pre-installed libyaml
-  pkg_config('yaml-0.1')
+
+  # default to pre-installed libyaml
+elsif pkg_config('yaml-0.1')
+  # found with pkg-config
+else
   dir_config('libyaml')
   find_header('yaml.h') or abort "yaml.h not found"
   find_library('yaml', 'yaml_get_version') or abort "libyaml not found"
diff --git a/ext/psych/lib/psych.rb b/ext/psych/lib/psych.rb
index d87bd9040a..850a6d1937 100644
--- a/ext/psych/lib/psych.rb
+++ b/ext/psych/lib/psych.rb
@@ -1,4 +1,6 @@
 # frozen_string_literal: true
+require 'date'
+
 require_relative 'psych/versions'
 case RUBY_ENGINE
 when 'jruby'
@@ -21,7 +23,6 @@ require_relative 'psych/parser'
 require_relative 'psych/omap'
 require_relative 'psych/set'
 require_relative 'psych/coder'
-require_relative 'psych/core_ext'
 require_relative 'psych/stream'
 require_relative 'psych/json/tree_builder'
 require_relative 'psych/json/stream'
@@ -84,7 +85,7 @@ require_relative 'psych/class_loader'
 #   Psych.safe_load_file("data.yml", permitted_classes: [Date])
 #   Psych.load_file("trusted_database.yml")
 #
-# ==== Exception handling
+# ==== \Exception handling
 #
 #   begin
 #     # The second argument changes only the exception contents
@@ -148,7 +149,7 @@ require_relative 'psych/class_loader'
 #   # Returns Psych::Nodes::Document
 #   Psych.parse_file('database.yml')
 #
-# ==== Exception handling
+# ==== \Exception handling
 #
 #   begin
 #     # The second argument changes only the exception contents
@@ -268,10 +269,10 @@ module Psych
   # YAML documents that are supplied via user input.  Instead, please use the
   # load method or the safe_load method.
   #
-  def self.unsafe_load yaml, filename: nil, fallback: false, symbolize_names: false, freeze: false, strict_integer: false
+  def self.unsafe_load yaml, filename: nil, fallback: false, symbolize_names: false, freeze: false, strict_integer: false, parse_symbols: true
     result = parse(yaml, filename: filename)
     return fallback unless result
-    result.to_ruby(symbolize_names: symbolize_names, freeze: freeze, strict_integer: strict_integer)
+    result.to_ruby(symbolize_names: symbolize_names, freeze: freeze, strict_integer: strict_integer, parse_symbols: parse_symbols)
   end
 
   ###
@@ -319,13 +320,13 @@ module Psych
   #   Psych.safe_load("---\n foo: bar")                         # => {"foo"=>"bar"}
   #   Psych.safe_load("---\n foo: bar", symbolize_names: true)  # => {:foo=>"bar"}
   #
-  def self.safe_load yaml, permitted_classes: [], permitted_symbols: [], aliases: false, filename: nil, fallback: nil, symbolize_names: false, freeze: false, strict_integer: false
+  def self.safe_load yaml, permitted_classes: [], permitted_symbols: [], aliases: false, filename: nil, fallback: nil, symbolize_names: false, freeze: false, strict_integer: false, parse_symbols: true
     result = parse(yaml, filename: filename)
     return fallback unless result
 
     class_loader = ClassLoader::Restricted.new(permitted_classes.map(&:to_s),
                                                permitted_symbols.map(&:to_s))
-    scanner      = ScalarScanner.new class_loader, strict_integer: strict_integer
+    scanner      = ScalarScanner.new class_loader, strict_integer: strict_integer, parse_symbols: parse_symbols
     visitor = if aliases
                 Visitors::ToRuby.new scanner, class_loader, symbolize_names: symbolize_names, freeze: freeze
               else
@@ -340,7 +341,7 @@ module Psych
   # provided, the object contained in the first document will be returned.
   # +filename+ will be used in the exception message if any exception
   # is raised while parsing.  If +yaml+ is empty, it returns
-  # the specified +fallback+ return value, which defaults to +false+.
+  # the specified +fallback+ return value, which defaults to +nil+.
   #
   # Raises a Psych::SyntaxError when a YAML syntax error is detected.
   #
@@ -365,7 +366,7 @@ module Psych
   # Raises a TypeError when `yaml` parameter is NilClass.  This method is
   # similar to `safe_load` except that `Symbol` objects are allowed by default.
   #
-  def self.load yaml, permitted_classes: [Symbol], permitted_symbols: [], aliases: false, filename: nil, fallback: nil, symbolize_names: false, freeze: false, strict_integer: false
+  def self.load yaml, permitted_classes: [Symbol], permitted_symbols: [], aliases: false, filename: nil, fallback: nil, symbolize_names: false, freeze: false, strict_integer: false, parse_symbols: true
     safe_load yaml, permitted_classes: permitted_classes,
                     permitted_symbols: permitted_symbols,
                     aliases: aliases,
@@ -373,7 +374,8 @@ module Psych
                     fallback: fallback,
                     symbolize_names: symbolize_names,
                     freeze: freeze,
-                    strict_integer: strict_integer
+                    strict_integer: strict_integer,
+                    parse_symbols: parse_symbols
   end
 
   ###
@@ -479,6 +481,7 @@ module Psych
   #
   #                           Default: <tt>2</tt>.
   # [<tt>:line_width</tt>]    Max character to wrap line at.
+  #                           For unlimited line width use <tt>-1</tt>.
   #
   #                           Default: <tt>0</tt> (meaning "wrap at 81").
   # [<tt>:canonical</tt>]     Write "canonical" YAML form (very verbose, yet
@@ -559,6 +562,7 @@ module Psych
   #
   #                           Default: <tt>2</tt>.
   # [<tt>:line_width</tt>]    Max character to wrap line at.
+  #                           For unlimited line width use <tt>-1</tt>.
   #
   #                           Default: <tt>0</tt> (meaning "wrap at 81").
   # [<tt>:canonical</tt>]     Write "canonical" YAML form (very verbose, yet
@@ -651,6 +655,35 @@ module Psych
   end
 
   ###
+  # Load multiple documents given in +yaml+. Returns the parsed documents
+  # as a list.
+  #
+  # Example:
+  #
+  #   Psych.safe_load_stream("--- foo\n...\n--- bar\n...") # => ['foo', 'bar']
+  #
+  #   list = []
+  #   Psych.safe_load_stream("--- foo\n...\n--- bar\n...") do |ruby|
+  #     list << ruby
+  #   end
+  #   list # => ['foo', 'bar']
+  #
+  def self.safe_load_stream yaml, filename: nil, permitted_classes: [], aliases: false
+    documents = parse_stream(yaml, filename: filename).children.map do |child|
+      stream = Psych::Nodes::Stream.new
+      stream.children << child
+      safe_load(stream.to_yaml, permitted_classes: permitted_classes, aliases: aliases)
+    end
+
+    if block_given?
+      documents.each { |doc| yield doc }
+      nil
+    else
+      documents
+    end
+  end
+
+  ###
   # Load the document contained in +filename+.  Returns the yaml contained in
   # +filename+ as a Ruby object, or if the file is empty, it returns
   # the specified +fallback+ return value, which defaults to +false+.
@@ -667,7 +700,7 @@ module Psych
   ###
   # Safely loads the document contained in +filename+.  Returns the yaml contained in
   # +filename+ as a Ruby object, or if the file is empty, it returns
-  # the specified +fallback+ return value, which defaults to +false+.
+  # the specified +fallback+ return value, which defaults to +nil+.
   # See safe_load for options.
   def self.safe_load_file filename, **kwargs
     File.open(filename, 'r:bom|utf-8') { |f|
@@ -678,7 +711,7 @@ module Psych
   ###
   # Loads the document contained in +filename+.  Returns the yaml contained in
   # +filename+ as a Ruby object, or if the file is empty, it returns
-  # the specified +fallback+ return value, which defaults to +false+.
+  # the specified +fallback+ return value, which defaults to +nil+.
   # See load for options.
   def self.load_file filename, **kwargs
     File.open(filename, 'r:bom|utf-8') { |f|
@@ -757,3 +790,5 @@ module Psych
   self.domain_types = {}
   # :startdoc:
 end
+
+require_relative 'psych/core_ext'
diff --git a/ext/psych/lib/psych/class_loader.rb b/ext/psych/lib/psych/class_loader.rb
index 50efc35ee2..c8f509720a 100644
--- a/ext/psych/lib/psych/class_loader.rb
+++ b/ext/psych/lib/psych/class_loader.rb
@@ -6,6 +6,7 @@ module Psych
   class ClassLoader # :nodoc:
     BIG_DECIMAL = 'BigDecimal'
     COMPLEX     = 'Complex'
+    DATA        = 'Data' unless RUBY_VERSION < "3.2"
     DATE        = 'Date'
     DATE_TIME   = 'DateTime'
     EXCEPTION   = 'Exception'
diff --git a/ext/psych/lib/psych/core_ext.rb b/ext/psych/lib/psych/core_ext.rb
index 0721a133c3..6dfd0f1696 100644
--- a/ext/psych/lib/psych/core_ext.rb
+++ b/ext/psych/lib/psych/core_ext.rb
@@ -14,6 +14,23 @@ class Object
   end
 end
 
-if defined?(::IRB)
-  require_relative 'y'
+# Up to Ruby 3.4, Set was a regular object and was dumped as such
+# by Pysch.
+# Starting from Ruby 4.0 it's a core class written in C, so we have to implement
+# #encode_with / #init_with to preserve backward compatibility.
+if defined?(::Set) && Set.new.instance_variables.empty?
+  class Set
+    def encode_with(coder)
+      hash = {}
+      each do |m|
+        hash[m] = true
+      end
+      coder["hash"] = hash
+      coder
+    end
+
+    def init_with(coder)
+      replace(coder["hash"].keys)
+    end
+  end
 end
diff --git a/ext/psych/lib/psych/nodes/node.rb b/ext/psych/lib/psych/nodes/node.rb
index f44fce5f05..fc27448f2e 100644
--- a/ext/psych/lib/psych/nodes/node.rb
+++ b/ext/psych/lib/psych/nodes/node.rb
@@ -1,5 +1,4 @@
 # frozen_string_literal: true
-require 'stringio'
 require_relative '../class_loader'
 require_relative '../scalar_scanner'
 
@@ -46,8 +45,8 @@ module Psych
       # Convert this node to Ruby.
       #
       # See also Psych::Visitors::ToRuby
-      def to_ruby(symbolize_names: false, freeze: false, strict_integer: false)
-        Visitors::ToRuby.create(symbolize_names: symbolize_names, freeze: freeze, strict_integer: strict_integer).accept(self)
+      def to_ruby(symbolize_names: false, freeze: false, strict_integer: false, parse_symbols: true)
+        Visitors::ToRuby.create(symbolize_names: symbolize_names, freeze: freeze, strict_integer: strict_integer, parse_symbols: parse_symbols).accept(self)
       end
       alias :transform :to_ruby
 
@@ -56,6 +55,8 @@ module Psych
       #
       # See also Psych::Visitors::Emitter
       def yaml io = nil, options = {}
+        require "stringio" unless defined?(StringIO)
+
         real_io = io || StringIO.new(''.encode('utf-8'))
 
         Visitors::Emitter.new(real_io, options).accept self
diff --git a/ext/psych/lib/psych/scalar_scanner.rb b/ext/psych/lib/psych/scalar_scanner.rb
index 3cb4bf3c7e..6a556fb3b8 100644
--- a/ext/psych/lib/psych/scalar_scanner.rb
+++ b/ext/psych/lib/psych/scalar_scanner.rb
@@ -11,26 +11,27 @@ module Psych
     # Base 60, [-+]inf and NaN are handled separately
     FLOAT = /^(?:[-+]?([0-9][0-9_,]*)?\.[0-9]*([eE][-+][0-9]+)?(?# base 10))$/x
 
-    # Taken from http://yaml.org/type/int.html
-    INTEGER_STRICT = /^(?:[-+]?0b[0-1_]+                  (?# base 2)
-                         |[-+]?0[0-7_]+                   (?# base 8)
-                         |[-+]?(0|[1-9][0-9_]*)           (?# base 10)
-                         |[-+]?0x[0-9a-fA-F_]+            (?# base 16))$/x
+    # Taken from http://yaml.org/type/int.html and modified to ensure at least one numerical symbol exists
+    INTEGER_STRICT = /^(?:[-+]?0b[_]*[0-1][0-1_]*             (?# base 2)
+                         |[-+]?0[_]*[0-7][0-7_]*              (?# base 8)
+                         |[-+]?(0|[1-9][0-9_]*)               (?# base 10)
+                         |[-+]?0x[_]*[0-9a-fA-F][0-9a-fA-F_]* (?# base 16))$/x
 
     # Same as above, but allows commas.
     # Not to YML spec, but kept for backwards compatibility
-    INTEGER_LEGACY = /^(?:[-+]?0b[0-1_,]+                        (?# base 2)
-                         |[-+]?0[0-7_,]+                         (?# base 8)
+    INTEGER_LEGACY = /^(?:[-+]?0b[_,]*[0-1][0-1_,]*                (?# base 2)
+                         |[-+]?0[_,]*[0-7][0-7_,]*                 (?# base 8)
                          |[-+]?(?:0|[1-9](?:[0-9]|,[0-9]|_[0-9])*) (?# base 10)
-                         |[-+]?0x[0-9a-fA-F_,]+                  (?# base 16))$/x
+                         |[-+]?0x[_,]*[0-9a-fA-F][0-9a-fA-F_,]*    (?# base 16))$/x
 
     attr_reader :class_loader
 
     # Create a new scanner
-    def initialize class_loader, strict_integer: false
+    def initialize class_loader, strict_integer: false, parse_symbols: true
       @symbol_cache = {}
       @class_loader = class_loader
       @strict_integer = strict_integer
+      @parse_symbols = parse_symbols
     end
 
     # Tokenize +string+ returning the Ruby object
@@ -61,7 +62,6 @@ module Psych
           string
         end
       elsif string.match?(/^\d{4}-(?:1[012]|0\d|\d)-(?:[12]\d|3[01]|0\d|\d)$/)
-        require 'date'
         begin
           class_loader.date.strptime(string, '%F', Date::GREGORIAN)
         rescue ArgumentError
@@ -73,7 +73,7 @@ module Psych
         -Float::INFINITY
       elsif string.match?(/^\.nan$/i)
         Float::NAN
-      elsif string.match?(/^:./)
+      elsif @parse_symbols && string.match?(/^:./)
         if string =~ /^:(["'])(.*)\1/
           @symbol_cache[string] = class_loader.symbolize($2.sub(/^:/, ''))
         else
diff --git a/ext/psych/lib/psych/versions.rb b/ext/psych/lib/psych/versions.rb
index b9e8d9ef11..6c1679bf65 100644
--- a/ext/psych/lib/psych/versions.rb
+++ b/ext/psych/lib/psych/versions.rb
@@ -2,9 +2,9 @@
 
 module Psych
   # The version of Psych you are using
-  VERSION = '5.1.2'
+  VERSION = '5.4.0'
 
   if RUBY_ENGINE == 'jruby'
-    DEFAULT_SNAKEYAML_VERSION = '2.7'.freeze
+    DEFAULT_SNAKEYAML_VERSION = '2.10'.freeze
   end
 end
diff --git a/ext/psych/lib/psych/visitors/to_ruby.rb b/ext/psych/lib/psych/visitors/to_ruby.rb
index f0fda9bdbc..475444e589 100644
--- a/ext/psych/lib/psych/visitors/to_ruby.rb
+++ b/ext/psych/lib/psych/visitors/to_ruby.rb
@@ -12,9 +12,13 @@ module Psych
     ###
     # This class walks a YAML AST, converting each node to Ruby
     class ToRuby < Psych::Visitors::Visitor
-      def self.create(symbolize_names: false, freeze: false, strict_integer: false)
+      unless RUBY_VERSION < "3.2"
+        DATA_INITIALIZE = Data.instance_method(:initialize)
+      end
+
+      def self.create(symbolize_names: false, freeze: false, strict_integer: false, parse_symbols: true)
         class_loader = ClassLoader.new
-        scanner      = ScalarScanner.new class_loader, strict_integer: strict_integer
+        scanner      = ScalarScanner.new class_loader, strict_integer: strict_integer, parse_symbols: parse_symbols
         new(scanner, class_loader, symbolize_names: symbolize_names, freeze: freeze)
       end
 
@@ -36,7 +40,7 @@ module Psych
 
         unless @domain_types.empty? || !target.tag
           key = target.tag.sub(/^[!\/]*/, '').sub(/(,\d+)\//, '\1:')
-          key = "tag:#{key}" unless key =~ /^(?:tag:|x-private)/
+          key = "tag:#{key}" unless key.match?(/^(?:tag:|x-private)/)
 
           if @domain_types.key? key
             value, block = @domain_types[key]
@@ -79,7 +83,6 @@ module Psych
           class_loader.big_decimal._load o.value
         when "!ruby/object:DateTime"
           class_loader.date_time
-          require 'date' unless defined? DateTime
           t = @ss.parse_time(o.value)
           DateTime.civil(*t.to_a[0, 6].reverse, Rational(t.utc_offset, 86400)) +
             (t.subsec/86400)
@@ -97,11 +100,11 @@ module Psych
           Float(@ss.tokenize(o.value))
         when "!ruby/regexp"
           klass = class_loader.regexp
-          o.value =~ /^\/(.*)\/([mixn]*)$/m
-          source  = $1
+          matches = /^\/(?<string>.*)\/(?<options>[mixn]*)$/m.match(o.value)
+          source  = matches[:string].gsub('\/', '/')
           options = 0
           lang    = nil
-          $2&.each_char do |option|
+          matches[:options].each_char do |option|
             case option
             when 'x' then options |= Regexp::EXTENDED
             when 'i' then options |= Regexp::IGNORECASE
@@ -198,6 +201,32 @@ module Psych
             s
           end
 
+        when /^!ruby\/data(-with-ivars)?(?::(.*))?$/
+          data = register(o, resolve_class($2).allocate) if $2
+          members = {}
+
+          if $1 # data-with-ivars
+            ivars   = {}
+            o.children.each_slice(2) do |type, vars|
+              case accept(type)
+              when 'members'
+                revive_data_members(members, vars)
+                data ||= allocate_anon_data(o, members)
+              when 'ivars'
+                revive_hash(ivars, vars)
+              end
+            end
+            ivars.each do |ivar, v|
+              data.instance_variable_set ivar, v
+            end
+          else
+            revive_data_members(members, o)
+          end
+          data ||= allocate_anon_data(o, members)
+          DATA_INITIALIZE.bind_call(data, **members)
+          data.freeze
+          data
+
         when /^!ruby\/object:?(.*)?$/
           name = $1 || 'Object'
 
@@ -341,6 +370,20 @@ module Psych
         list
       end
 
+      def allocate_anon_data node, members
+        klass = class_loader.data.define(*members.keys)
+        register(node, klass.allocate)
+      end
+
+      def revive_data_members hash, o
+        o.children.each_slice(2) do |k,v|
+          name  = accept(k)
+          value = accept(v)
+          hash[class_loader.symbolize(name)] = value
+        end
+        hash
+      end
+
       def revive_hash hash, o, tagged= false
         o.children.each_slice(2) { |k,v|
           key = accept(k)
diff --git a/ext/psych/lib/psych/visitors/yaml_tree.rb b/ext/psych/lib/psych/visitors/yaml_tree.rb
index a2ebc4d781..b6c86f4c94 100644
--- a/ext/psych/lib/psych/visitors/yaml_tree.rb
+++ b/ext/psych/lib/psych/visitors/yaml_tree.rb
@@ -73,7 +73,7 @@ module Psych
 
           method = respond_to?(method) ? method : h[klass.superclass]
 
-          raise(TypeError, "Can't dump #{target.class}") unless method
+          raise(TypeError, "can't dump #{klass.name}") unless method
 
           h[klass] = method
         end.compare_by_identity
@@ -162,6 +162,44 @@ module Psych
 
       alias :visit_Delegator :visit_Object
 
+      def visit_Data o
+        ivars = o.instance_variables
+        if ivars.empty?
+          tag = ['!ruby/data', o.class.name].compact.join(':')
+          register o, @emitter.start_mapping(nil, tag, false, Nodes::Mapping::BLOCK)
+          o.members.each do |member|
+            @emitter.scalar member.to_s, nil, nil, true, false, Nodes::Scalar::ANY
+            accept o.send member
+          end
+          @emitter.end_mapping
+
+        else
+          tag = ['!ruby/data-with-ivars', o.class.name].compact.join(':')
+          node = @emitter.start_mapping(nil, tag, false, Psych::Nodes::Mapping::BLOCK)
+          register(o, node)
+
+          # Dump the members
+          accept 'members'
+          @emitter.start_mapping nil, nil, true, Nodes::Mapping::BLOCK
+          o.members.each do |member|
+            @emitter.scalar member.to_s, nil, nil, true, false, Nodes::Scalar::ANY
+            accept o.send member
+          end
+          @emitter.end_mapping
+
+          # Dump the ivars
+          accept 'ivars'
+          @emitter.start_mapping nil, nil, true, Nodes::Mapping::BLOCK
+          ivars.each do |ivar|
+            accept ivar.to_s
+            accept o.instance_variable_get ivar
+          end
+          @emitter.end_mapping
+
+          @emitter.end_mapping
+        end
+      end unless RUBY_VERSION < "3.2"
+
       def visit_Struct o
         tag = ['!ruby/struct', o.class.name].compact.join(':')
 
@@ -189,7 +227,8 @@ module Psych
       end
 
       def visit_Date o
-        register o, visit_Integer(o.gregorian)
+        formatted = format_date o
+        register o, @emitter.scalar(formatted, nil, nil, true, false, Nodes::Scalar::ANY)
       end
 
       def visit_DateTime o
@@ -261,7 +300,7 @@ module Psych
           style = Nodes::Scalar::LITERAL
           plain = false
           quote = false
-        elsif o =~ /\n(?!\Z)/  # match \n except blank line at the end of string
+        elsif o.match?(/\n(?!\Z)/)  # match \n except blank line at the end of string
           style = Nodes::Scalar::LITERAL
         elsif o == '<<'
           style = Nodes::Scalar::SINGLE_QUOTED
@@ -272,9 +311,9 @@ module Psych
           style = Nodes::Scalar::DOUBLE_QUOTED
         elsif @line_width && o.length > @line_width
           style = Nodes::Scalar::FOLDED
-        elsif o =~ /^[^[:word:]][^"]*$/
+        elsif o.match?(/^[^[:word:]][^"]*$/)
           style = Nodes::Scalar::DOUBLE_QUOTED
-        elsif not String === @ss.tokenize(o) or /\A0[0-7]*[89]/ =~ o
+        elsif not String === @ss.tokenize(o) or /\A0[0-7]*[89]/.match?(o)
           style = Nodes::Scalar::SINGLE_QUOTED
         end
 
@@ -486,6 +525,10 @@ module Psych
         end
       end
 
+      def format_date date
+        date.strftime("%Y-%m-%d")
+      end
+
       def register target, yaml_obj
         @st.register target, yaml_obj
         yaml_obj
diff --git a/ext/psych/psych.c b/ext/psych/psych.c
index 8af0bb6a5a..afbd7a3571 100644
--- a/ext/psych/psych.c
+++ b/ext/psych/psych.c
@@ -23,7 +23,7 @@ VALUE mPsych;
 void Init_psych(void)
 {
     #ifdef HAVE_RB_EXT_RACTOR_SAFE
-	RB_EXT_RACTOR_SAFE(true);
+        RB_EXT_RACTOR_SAFE(true);
     #endif
     mPsych = rb_define_module("Psych");
 
@@ -34,4 +34,3 @@ void Init_psych(void)
     Init_psych_to_ruby();
     Init_psych_yaml_tree();
 }
-/* vim: set noet sws=4 sw=4: */
diff --git a/ext/psych/psych.gemspec b/ext/psych/psych.gemspec
index a3fc53a8b9..a32f79bc16 100644
--- a/ext/psych/psych.gemspec
+++ b/ext/psych/psych.gemspec
@@ -75,6 +75,8 @@ DESCRIPTION
     s.add_dependency 'stringio'
   end
 
+  s.add_dependency 'date'
+
   s.metadata['msys2_mingw_dependencies'] = 'libyaml'
   s.metadata['changelog_uri'] = s.homepage + '/releases'
 end
diff --git a/ext/psych/psych_emitter.c b/ext/psych/psych_emitter.c
index 022ffa0946..624ab7c528 100644
--- a/ext/psych/psych_emitter.c
+++ b/ext/psych/psych_emitter.c
@@ -17,7 +17,7 @@ static ID id_canonical;
 static void emit(yaml_emitter_t * emitter, yaml_event_t * event)
 {
     if(!yaml_emitter_emit(emitter, event))
-	rb_raise(rb_eRuntimeError, "%s", emitter->problem);
+        rb_raise(rb_eRuntimeError, "%s", emitter->problem);
 }
 
 static int writer(void *ctx, unsigned char *buffer, size_t size)
@@ -82,13 +82,13 @@ static VALUE initialize(int argc, VALUE *argv, VALUE self)
     TypedData_Get_Struct(self, yaml_emitter_t, &psych_emitter_type, emitter);
 
     if (rb_scan_args(argc, argv, "11", &io, &options) == 2) {
-	line_width = rb_funcall(options, id_line_width, 0);
-	indent     = rb_funcall(options, id_indentation, 0);
-	canonical  = rb_funcall(options, id_canonical, 0);
+        line_width = rb_funcall(options, id_line_width, 0);
+        indent     = rb_funcall(options, id_indentation, 0);
+        canonical  = rb_funcall(options, id_canonical, 0);
 
-	yaml_emitter_set_width(emitter, NUM2INT(line_width));
-	yaml_emitter_set_indent(emitter, NUM2INT(indent));
-	yaml_emitter_set_canonical(emitter, Qtrue == canonical ? 1 : 0);
+        yaml_emitter_set_width(emitter, NUM2INT(line_width));
+        yaml_emitter_set_indent(emitter, NUM2INT(indent));
+        yaml_emitter_set_canonical(emitter, Qtrue == canonical ? 1 : 0);
     }
 
     rb_ivar_set(self, id_io, io);
@@ -136,84 +136,118 @@ static VALUE end_stream(VALUE self)
     return self;
 }
 
-/* call-seq: emitter.start_document(version, tags, implicit)
- *
- * Start a document emission with YAML +version+, +tags+, and an +implicit+
- * start.
- *
- * See Psych::Handler#start_document
- */
-static VALUE start_document(VALUE self, VALUE version, VALUE tags, VALUE imp)
+struct start_document_data {
+    VALUE self;
+    VALUE version;
+    VALUE tags;
+    VALUE imp;
+
+    yaml_tag_directive_t * head;
+};
+
+static VALUE start_document_try(VALUE d)
 {
+    struct start_document_data * data = (struct start_document_data *)d;
+    VALUE self = data->self;
+    VALUE version = data->version;
+    VALUE tags = data->tags;
+    VALUE imp = data->imp;
+
     yaml_emitter_t * emitter;
-    yaml_tag_directive_t * head = NULL;
     yaml_tag_directive_t * tail = NULL;
     yaml_event_t event;
     yaml_version_directive_t version_directive;
     TypedData_Get_Struct(self, yaml_emitter_t, &psych_emitter_type, emitter);
 
-
     Check_Type(version, T_ARRAY);
 
     if(RARRAY_LEN(version) > 0) {
-	VALUE major = rb_ary_entry(version, (long)0);
-	VALUE minor = rb_ary_entry(version, (long)1);
+        VALUE major = rb_ary_entry(version, (long)0);
+        VALUE minor = rb_ary_entry(version, (long)1);
 
-	version_directive.major = NUM2INT(major);
-	version_directive.minor = NUM2INT(minor);
+        version_directive.major = NUM2INT(major);
+        version_directive.minor = NUM2INT(minor);
     }
 
     if(RTEST(tags)) {
-	long i = 0;
-	long len;
-	rb_encoding * encoding = rb_utf8_encoding();
-
-	Check_Type(tags, T_ARRAY);
-
-	len = RARRAY_LEN(tags);
-	head  = xcalloc((size_t)len, sizeof(yaml_tag_directive_t));
-	tail  = head;
-
-	for(i = 0; i < len && i < RARRAY_LEN(tags); i++) {
-	    VALUE tuple = RARRAY_AREF(tags, i);
-	    VALUE name;
-	    VALUE value;
-
-	    Check_Type(tuple, T_ARRAY);
-
-	    if(RARRAY_LEN(tuple) < 2) {
-		xfree(head);
-		rb_raise(rb_eRuntimeError, "tag tuple must be of length 2");
-	    }
-	    name  = RARRAY_AREF(tuple, 0);
-	    value = RARRAY_AREF(tuple, 1);
-	    StringValue(name);
-	    StringValue(value);
-	    name = rb_str_export_to_enc(name, encoding);
-	    value = rb_str_export_to_enc(value, encoding);
-
-	    tail->handle = (yaml_char_t *)StringValueCStr(name);
-	    tail->prefix = (yaml_char_t *)StringValueCStr(value);
-
-	    tail++;
-	}
+        long i = 0;
+        long len;
+        rb_encoding * encoding = rb_utf8_encoding();
+
+        Check_Type(tags, T_ARRAY);
+
+        len = RARRAY_LEN(tags);
+        data->head = xcalloc((size_t)len, sizeof(yaml_tag_directive_t));
+        tail = data->head;
+
+        for(i = 0; i < len && i < RARRAY_LEN(tags); i++) {
+            VALUE tuple = RARRAY_AREF(tags, i);
+            VALUE name;
+            VALUE value;
+
+            Check_Type(tuple, T_ARRAY);
+
+            if(RARRAY_LEN(tuple) < 2) {
+                rb_raise(rb_eRuntimeError, "tag tuple must be of length 2");
+            }
+
+            name  = RARRAY_AREF(tuple, 0);
+            value = RARRAY_AREF(tuple, 1);
+            StringValue(name);
+            StringValue(value);
+            name = rb_str_export_to_enc(name, encoding);
+            value = rb_str_export_to_enc(value, encoding);
+
+            tail->handle = (yaml_char_t *)StringValueCStr(name);
+            tail->prefix = (yaml_char_t *)StringValueCStr(value);
+
+            tail++;
+        }
     }
 
     yaml_document_start_event_initialize(
-	    &event,
-	    (RARRAY_LEN(version) > 0) ? &version_directive : NULL,
-	    head,
-	    tail,
-	    imp ? 1 : 0
-	    );
+            &event,
+            (RARRAY_LEN(version) > 0) ? &version_directive : NULL,
+            data->head,
+            tail,
+            imp ? 1 : 0
+            );
 
     emit(emitter, &event);
 
-    if(head) xfree(head);
-
     return self;
 }
 
+static VALUE start_document_ensure(VALUE d)
+{
+    struct start_document_data * data = (struct start_document_data *)d;
+
+    xfree(data->head);
+
+    return Qnil;
+}
+
+/* call-seq: emitter.start_document(version, tags, implicit)
+ *
+ * Start a document emission with YAML +version+, +tags+, and an +implicit+
+ * start.
+ *
+ * See Psych::Handler#start_document
+ */
+static VALUE start_document(VALUE self, VALUE version, VALUE tags, VALUE imp)
+{
+    struct start_document_data data = {
+        .self = self,
+        .version = version,
+        .tags = tags,
+        .imp = imp,
+
+        .head = NULL,
+    };
+
+    return rb_ensure(start_document_try, (VALUE)&data, start_document_ensure, (VALUE)&data);
+}
+
 /* call-seq: emitter.end_document(implicit)
  *
  * End a document emission with an +implicit+ ending.
@@ -241,14 +275,14 @@ static VALUE end_document(VALUE self, VALUE imp)
  * See Psych::Handler#scalar
  */
 static VALUE scalar(
-	VALUE self,
-	VALUE value,
-	VALUE anchor,
-	VALUE tag,
-	VALUE plain,
-	VALUE quoted,
-	VALUE style
-	) {
+        VALUE self,
+        VALUE value,
+        VALUE anchor,
+        VALUE tag,
+        VALUE plain,
+        VALUE quoted,
+        VALUE style
+        ) {
     yaml_emitter_t * emitter;
     yaml_event_t event;
     rb_encoding *encoding;
@@ -261,25 +295,26 @@ static VALUE scalar(
     value = rb_str_export_to_enc(value, encoding);
 
     if(!NIL_P(anchor)) {
-	Check_Type(anchor, T_STRING);
-	anchor = rb_str_export_to_enc(anchor, encoding);
+        Check_Type(anchor, T_STRING);
+        anchor = rb_str_export_to_enc(anchor, encoding);
     }
 
     if(!NIL_P(tag)) {
-	Check_Type(tag, T_STRING);
-	tag = rb_str_export_to_enc(tag, encoding);
+        Check_Type(tag, T_STRING);
+        tag = rb_str_export_to_enc(tag, encoding);
     }
 
+    const char *value_ptr = StringValuePtr(value);
     yaml_scalar_event_initialize(
-	    &event,
-	    (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
-	    (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
-	    (yaml_char_t*)StringValuePtr(value),
-	    (int)RSTRING_LEN(value),
-	    plain ? 1 : 0,
-	    quoted ? 1 : 0,
-	    (yaml_scalar_style_t)NUM2INT(style)
-	    );
+            &event,
+            (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
+            (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
+            (yaml_char_t*)value_ptr,
+            (int)RSTRING_LEN(value),
+            plain ? 1 : 0,
+            quoted ? 1 : 0,
+            (yaml_scalar_style_t)NUM2INT(style)
+            );
 
     emit(emitter, &event);
 
@@ -294,36 +329,36 @@ static VALUE scalar(
  * See Psych::Handler#start_sequence
  */
 static VALUE start_sequence(
-	VALUE self,
-	VALUE anchor,
-	VALUE tag,
-	VALUE implicit,
-	VALUE style
-	) {
+        VALUE self,
+        VALUE anchor,
+        VALUE tag,
+        VALUE implicit,
+        VALUE style
+        ) {
     yaml_emitter_t * emitter;
     yaml_event_t event;
 
     rb_encoding * encoding = rb_utf8_encoding();
 
     if(!NIL_P(anchor)) {
-	Check_Type(anchor, T_STRING);
-	anchor = rb_str_export_to_enc(anchor, encoding);
+        Check_Type(anchor, T_STRING);
+        anchor = rb_str_export_to_enc(anchor, encoding);
     }
 
     if(!NIL_P(tag)) {
-	Check_Type(tag, T_STRING);
-	tag = rb_str_export_to_enc(tag, encoding);
+        Check_Type(tag, T_STRING);
+        tag = rb_str_export_to_enc(tag, encoding);
     }
 
     TypedData_Get_Struct(self, yaml_emitter_t, &psych_emitter_type, emitter);
 
     yaml_sequence_start_event_initialize(
-	    &event,
-	    (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
-	    (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
-	    implicit ? 1 : 0,
-	    (yaml_sequence_style_t)NUM2INT(style)
-	    );
+            &event,
+            (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
+            (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
+            implicit ? 1 : 0,
+            (yaml_sequence_style_t)NUM2INT(style)
+            );
 
     emit(emitter, &event);
 
@@ -357,12 +392,12 @@ static VALUE end_sequence(VALUE self)
  * See Psych::Handler#start_mapping
  */
 static VALUE start_mapping(
-	VALUE self,
-	VALUE anchor,
-	VALUE tag,
-	VALUE implicit,
-	VALUE style
-	) {
+        VALUE self,
+        VALUE anchor,
+        VALUE tag,
+        VALUE implicit,
+        VALUE style
+        ) {
     yaml_emitter_t * emitter;
     yaml_event_t event;
     rb_encoding *encoding;
@@ -372,22 +407,22 @@ static VALUE start_mapping(
     encoding = rb_utf8_encoding();
 
     if(!NIL_P(anchor)) {
-	Check_Type(anchor, T_STRING);
-	anchor = rb_str_export_to_enc(anchor, encoding);
+        Check_Type(anchor, T_STRING);
+        anchor = rb_str_export_to_enc(anchor, encoding);
     }
 
     if(!NIL_P(tag)) {
-	Check_Type(tag, T_STRING);
-	tag = rb_str_export_to_enc(tag, encoding);
+        Check_Type(tag, T_STRING);
+        tag = rb_str_export_to_enc(tag, encoding);
     }
 
     yaml_mapping_start_event_initialize(
-	    &event,
-	    (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
-	    (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
-	    implicit ? 1 : 0,
-	    (yaml_mapping_style_t)NUM2INT(style)
-	    );
+            &event,
+            (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor)),
+            (yaml_char_t *)(NIL_P(tag) ? NULL : StringValueCStr(tag)),
+            implicit ? 1 : 0,
+            (yaml_mapping_style_t)NUM2INT(style)
+            );
 
     emit(emitter, &event);
 
@@ -426,14 +461,14 @@ static VALUE alias(VALUE self, VALUE anchor)
     TypedData_Get_Struct(self, yaml_emitter_t, &psych_emitter_type, emitter);
 
     if(!NIL_P(anchor)) {
-	Check_Type(anchor, T_STRING);
-	anchor = rb_str_export_to_enc(anchor, rb_utf8_encoding());
+        Check_Type(anchor, T_STRING);
+        anchor = rb_str_export_to_enc(anchor, rb_utf8_encoding());
     }
 
     yaml_alias_event_initialize(
-	    &event,
-	    (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor))
-	    );
+            &event,
+            (yaml_char_t *)(NIL_P(anchor) ? NULL : StringValueCStr(anchor))
+            );
 
     emit(emitter, &event);
 
@@ -552,4 +587,3 @@ void Init_psych_emitter(void)
     id_indentation = rb_intern("indentation");
     id_canonical   = rb_intern("canonical");
 }
-/* vim: set noet sws=4 sw=4: */
diff --git a/ext/psych/psych_parser.c b/ext/psych/psych_parser.c
index 9c5179cc44..00a2207b58 100644
--- a/ext/psych/psych_parser.c
+++ b/ext/psych/psych_parser.c
@@ -32,9 +32,20 @@ static int io_reader(void * data, unsigned char *buf, size_t size, size_t *read)
     *read = 0;
 
     if(! NIL_P(string)) {
-	void * str = (void *)StringValuePtr(string);
-	*read = (size_t)RSTRING_LEN(string);
-	memcpy(buf, str, *read);
+        char * str = StringValuePtr(string);
+        size_t len = (size_t)RSTRING_LEN(string);
+
+        /* IO#read(size) is documented to return at most `size` bytes, but a
+         * misbehaving IO-like object may return more. Clamp the copy to the
+         * buffer libyaml gave us to avoid writing past its end, rounding down
+         * to a character boundary so a multibyte character is never split. */
+        if(len > size) {
+            rb_encoding * enc = rb_enc_get(string);
+            len = (size_t)(rb_enc_left_char_head(str, str + size, str + len, enc) - str);
+        }
+
+        *read = len;
+        memcpy(buf, str, len);
     }
 
     return 1;
@@ -80,23 +91,23 @@ static VALUE allocate(VALUE klass)
 static VALUE make_exception(yaml_parser_t * parser, VALUE path)
 {
     if (parser->error == YAML_MEMORY_ERROR) {
-	return rb_eNoMemError;
+        return rb_eNoMemError;
     } else {
-	size_t line, column;
-	VALUE ePsychSyntaxError;
+        size_t line, column;
+        VALUE ePsychSyntaxError;
 
-	line = parser->context_mark.line + 1;
-	column = parser->context_mark.column + 1;
+        line = parser->context_mark.line + 1;
+        column = parser->context_mark.column + 1;
 
-	ePsychSyntaxError = rb_const_get(mPsych, rb_intern("SyntaxError"));
+        ePsychSyntaxError = rb_const_get(mPsych, rb_intern("SyntaxError"));
 
-	return rb_funcall(ePsychSyntaxError, rb_intern("new"), 6,
-		path,
-		SIZET2NUM(line),
-		SIZET2NUM(column),
-		SIZET2NUM(parser->problem_offset),
-		parser->problem ? rb_usascii_str_new2(parser->problem) : Qnil,
-		parser->context ? rb_usascii_str_new2(parser->context) : Qnil);
+        return rb_funcall(ePsychSyntaxError, rb_intern("new"), 6,
+                path,
+                SIZET2NUM(line),
+                SIZET2NUM(column),
+                SIZET2NUM(parser->problem_offset),
+                parser->problem ? rb_usascii_str_new2(parser->problem) : Qnil,
+                parser->context ? rb_usascii_str_new2(parser->context) : Qnil);
     }
 }
 
@@ -108,18 +119,18 @@ static VALUE transcode_string(VALUE src, int * parser_encoding)
     int source_encoding = rb_enc_get_index(src);
 
     if (source_encoding == utf8) {
-	*parser_encoding = YAML_UTF8_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF8_ENCODING;
+        return src;
     }
 
     if (source_encoding == utf16le) {
-	*parser_encoding = YAML_UTF16LE_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF16LE_ENCODING;
+        return src;
     }
 
     if (source_encoding == utf16be) {
-	*parser_encoding = YAML_UTF16BE_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF16BE_ENCODING;
+        return src;
     }
 
     src = rb_str_export_to_enc(src, rb_utf8_encoding());
@@ -138,36 +149,36 @@ static VALUE transcode_io(VALUE src, int * parser_encoding)
 
     /* if no encoding is returned, assume ascii8bit. */
     if (NIL_P(io_external_encoding)) {
-	io_external_enc_index = rb_ascii8bit_encindex();
+        io_external_enc_index = rb_ascii8bit_encindex();
     } else {
-	io_external_enc_index = rb_to_encoding_index(io_external_encoding);
+        io_external_enc_index = rb_to_encoding_index(io_external_encoding);
     }
 
     /* Treat US-ASCII as utf_8 */
     if (io_external_enc_index == rb_usascii_encindex()) {
-	*parser_encoding = YAML_UTF8_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF8_ENCODING;
+        return src;
     }
 
     if (io_external_enc_index == rb_utf8_encindex()) {
-	*parser_encoding = YAML_UTF8_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF8_ENCODING;
+        return src;
     }
 
     if (io_external_enc_index == rb_enc_find_index("UTF-16LE")) {
-	*parser_encoding = YAML_UTF16LE_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF16LE_ENCODING;
+        return src;
     }
 
     if (io_external_enc_index == rb_enc_find_index("UTF-16BE")) {
-	*parser_encoding = YAML_UTF16BE_ENCODING;
-	return src;
+        *parser_encoding = YAML_UTF16BE_ENCODING;
+        return src;
     }
 
     /* Just guess on ASCII-8BIT */
     if (io_external_enc_index == rb_ascii8bit_encindex()) {
-	*parser_encoding = YAML_ANY_ENCODING;
-	return src;
+        *parser_encoding = YAML_ANY_ENCODING;
+        return src;
     }
 
     /* If the external encoding is something we don't know how to handle,
@@ -261,238 +272,238 @@ static VALUE parse(VALUE self, VALUE handler, VALUE yaml, VALUE path)
     yaml_parser_initialize(parser);
 
     if (rb_respond_to(yaml, id_read)) {
-	yaml = transcode_io(yaml, &parser_encoding);
-	yaml_parser_set_encoding(parser, parser_encoding);
-	yaml_parser_set_input(parser, io_reader, (void *)yaml);
+        yaml = transcode_io(yaml, &parser_encoding);
+        yaml_parser_set_encoding(parser, parser_encoding);
+        yaml_parser_set_input(parser, io_reader, (void *)yaml);
     } else {
-	StringValue(yaml);
-	yaml = transcode_string(yaml, &parser_encoding);
-	yaml_parser_set_encoding(parser, parser_encoding);
-	yaml_parser_set_input_string(
-		parser,
-		(const unsigned char *)RSTRING_PTR(yaml),
-		(size_t)RSTRING_LEN(yaml)
-		);
+        StringValue(yaml);
+        yaml = transcode_string(yaml, &parser_encoding);
+        yaml_parser_set_encoding(parser, parser_encoding);
+        yaml_parser_set_input_string(
+                parser,
+                (const unsigned char *)RSTRING_PTR(yaml),
+                (size_t)RSTRING_LEN(yaml)
+                );
     }
 
     while(!done) {
-	VALUE event_args[5];
-	VALUE start_line, start_column, end_line, end_column;
-
-	if(parser->error || !yaml_parser_parse(parser, &event)) {
-	    VALUE exception;
-
-	    exception = make_exception(parser, path);
-	    yaml_parser_delete(parser);
-	    yaml_parser_initialize(parser);
-
-	    rb_exc_raise(exception);
-	}
-
-	start_line = SIZET2NUM(event.start_mark.line);
-	start_column = SIZET2NUM(event.start_mark.column);
-	end_line = SIZET2NUM(event.end_mark.line);
-	end_column = SIZET2NUM(event.end_mark.column);
-
-	event_args[0] = handler;
-	event_args[1] = start_line;
-	event_args[2] = start_column;
-	event_args[3] = end_line;
-	event_args[4] = end_column;
-	rb_protect(protected_event_location, (VALUE)event_args, &state);
-
-	switch(event.type) {
-	    case YAML_STREAM_START_EVENT:
-	      {
-		  VALUE args[2];
-
-		  args[0] = handler;
-		  args[1] = INT2NUM(event.data.stream_start.encoding);
-		  rb_protect(protected_start_stream, (VALUE)args, &state);
-	      }
-	      break;
-	  case YAML_DOCUMENT_START_EVENT:
-	    {
-		VALUE args[4];
-		/* Get a list of tag directives (if any) */
-		VALUE tag_directives = rb_ary_new();
-		/* Grab the document version */
-		VALUE version = event.data.document_start.version_directive ?
-		    rb_ary_new3(
-			(long)2,
-			INT2NUM(event.data.document_start.version_directive->major),
-			INT2NUM(event.data.document_start.version_directive->minor)
-			) : rb_ary_new();
-
-		if(event.data.document_start.tag_directives.start) {
-		    yaml_tag_directive_t *start =
-			event.data.document_start.tag_directives.start;
-		    yaml_tag_directive_t *end =
-			event.data.document_start.tag_directives.end;
-		    for(; start != end; start++) {
-			VALUE handle = Qnil;
-			VALUE prefix = Qnil;
-			if(start->handle) {
-			    handle = rb_str_new2((const char *)start->handle);
-			    PSYCH_TRANSCODE(handle, encoding, internal_enc);
-			}
-
-			if(start->prefix) {
-			    prefix = rb_str_new2((const char *)start->prefix);
-			    PSYCH_TRANSCODE(prefix, encoding, internal_enc);
-			}
-
-			rb_ary_push(tag_directives, rb_ary_new3((long)2, handle, prefix));
-		    }
-		}
-		args[0] = handler;
-		args[1] = version;
-		args[2] = tag_directives;
-		args[3] = event.data.document_start.implicit == 1 ? Qtrue : Qfalse;
-		rb_protect(protected_start_document, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_DOCUMENT_END_EVENT:
-	    {
-		VALUE args[2];
-
-		args[0] = handler;
-		args[1] = event.data.document_end.implicit == 1 ? Qtrue : Qfalse;
-		rb_protect(protected_end_document, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_ALIAS_EVENT:
-	    {
-		VALUE args[2];
-		VALUE alias = Qnil;
-		if(event.data.alias.anchor) {
-		    alias = rb_str_new2((const char *)event.data.alias.anchor);
-		    PSYCH_TRANSCODE(alias, encoding, internal_enc);
-		}
-
-		args[0] = handler;
-		args[1] = alias;
-		rb_protect(protected_alias, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_SCALAR_EVENT:
-	    {
-		VALUE args[7];
-		VALUE anchor = Qnil;
-		VALUE tag = Qnil;
-		VALUE plain_implicit, quoted_implicit, style;
-		VALUE val = rb_str_new(
-		    (const char *)event.data.scalar.value,
-		    (long)event.data.scalar.length
-		    );
-
-		PSYCH_TRANSCODE(val, encoding, internal_enc);
-
-		if(event.data.scalar.anchor) {
-		    anchor = rb_str_new2((const char *)event.data.scalar.anchor);
-		    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
-		}
-
-		if(event.data.scalar.tag) {
-		    tag = rb_str_new2((const char *)event.data.scalar.tag);
-		    PSYCH_TRANSCODE(tag, encoding, internal_enc);
-		}
-
-		plain_implicit =
-		    event.data.scalar.plain_implicit == 0 ? Qfalse : Qtrue;
-
-		quoted_implicit =
-		    event.data.scalar.quoted_implicit == 0 ? Qfalse : Qtrue;
-
-		style = INT2NUM(event.data.scalar.style);
-
-		args[0] = handler;
-		args[1] = val;
-		args[2] = anchor;
-		args[3] = tag;
-		args[4] = plain_implicit;
-		args[5] = quoted_implicit;
-		args[6] = style;
-		rb_protect(protected_scalar, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_SEQUENCE_START_EVENT:
-	    {
-		VALUE args[5];
-		VALUE anchor = Qnil;
-		VALUE tag = Qnil;
-		VALUE implicit, style;
-		if(event.data.sequence_start.anchor) {
-		    anchor = rb_str_new2((const char *)event.data.sequence_start.anchor);
-		    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
-		}
-
-		tag = Qnil;
-		if(event.data.sequence_start.tag) {
-		    tag = rb_str_new2((const char *)event.data.sequence_start.tag);
-		    PSYCH_TRANSCODE(tag, encoding, internal_enc);
-		}
-
-		implicit =
-		    event.data.sequence_start.implicit == 0 ? Qfalse : Qtrue;
-
-		style = INT2NUM(event.data.sequence_start.style);
-
-		args[0] = handler;
-		args[1] = anchor;
-		args[2] = tag;
-		args[3] = implicit;
-		args[4] = style;
-
-		rb_protect(protected_start_sequence, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_SEQUENCE_END_EVENT:
-	    rb_protect(protected_end_sequence, handler, &state);
-	    break;
-	  case YAML_MAPPING_START_EVENT:
-	    {
-		VALUE args[5];
-		VALUE anchor = Qnil;
-		VALUE tag = Qnil;
-		VALUE implicit, style;
-		if(event.data.mapping_start.anchor) {
-		    anchor = rb_str_new2((const char *)event.data.mapping_start.anchor);
-		    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
-		}
-
-		if(event.data.mapping_start.tag) {
-		    tag = rb_str_new2((const char *)event.data.mapping_start.tag);
-		    PSYCH_TRANSCODE(tag, encoding, internal_enc);
-		}
-
-		implicit =
-		    event.data.mapping_start.implicit == 0 ? Qfalse : Qtrue;
-
-		style = INT2NUM(event.data.mapping_start.style);
-
-		args[0] = handler;
-		args[1] = anchor;
-		args[2] = tag;
-		args[3] = implicit;
-		args[4] = style;
-
-		rb_protect(protected_start_mapping, (VALUE)args, &state);
-	    }
-	    break;
-	  case YAML_MAPPING_END_EVENT:
-	    rb_protect(protected_end_mapping, handler, &state);
-	    break;
-	  case YAML_NO_EVENT:
-	    rb_protect(protected_empty, handler, &state);
-	    break;
-	  case YAML_STREAM_END_EVENT:
-	    rb_protect(protected_end_stream, handler, &state);
-	    done = 1;
-	    break;
-	}
-	yaml_event_delete(&event);
-	if (state) rb_jump_tag(state);
+        VALUE event_args[5];
+        VALUE start_line, start_column, end_line, end_column;
+
+        if(parser->error || !yaml_parser_parse(parser, &event)) {
+            VALUE exception;
+
+            exception = make_exception(parser, path);
+            yaml_parser_delete(parser);
+            yaml_parser_initialize(parser);
+
+            rb_exc_raise(exception);
+        }
+
+        start_line = SIZET2NUM(event.start_mark.line);
+        start_column = SIZET2NUM(event.start_mark.column);
+        end_line = SIZET2NUM(event.end_mark.line);
+        end_column = SIZET2NUM(event.end_mark.column);
+
+        event_args[0] = handler;
+        event_args[1] = start_line;
+        event_args[2] = start_column;
+        event_args[3] = end_line;
+        event_args[4] = end_column;
+        rb_protect(protected_event_location, (VALUE)event_args, &state);
+
+        switch(event.type) {
+            case YAML_STREAM_START_EVENT:
+              {
+                  VALUE args[2];
+
+                  args[0] = handler;
+                  args[1] = INT2NUM(event.data.stream_start.encoding);
+                  rb_protect(protected_start_stream, (VALUE)args, &state);
+              }
+              break;
+          case YAML_DOCUMENT_START_EVENT:
+            {
+                VALUE args[4];
+                /* Get a list of tag directives (if any) */
+                VALUE tag_directives = rb_ary_new();
+                /* Grab the document version */
+                VALUE version = event.data.document_start.version_directive ?
+                    rb_ary_new3(
+                        (long)2,
+                        INT2NUM(event.data.document_start.version_directive->major),
+                        INT2NUM(event.data.document_start.version_directive->minor)
+                        ) : rb_ary_new();
+
+                if(event.data.document_start.tag_directives.start) {
+                    yaml_tag_directive_t *start =
+                        event.data.document_start.tag_directives.start;
+                    yaml_tag_directive_t *end =
+                        event.data.document_start.tag_directives.end;
+                    for(; start != end; start++) {
+                        VALUE handle = Qnil;
+                        VALUE prefix = Qnil;
+                        if(start->handle) {
+                            handle = rb_str_new2((const char *)start->handle);
+                            PSYCH_TRANSCODE(handle, encoding, internal_enc);
+                        }
+
+                        if(start->prefix) {
+                            prefix = rb_str_new2((const char *)start->prefix);
+                            PSYCH_TRANSCODE(prefix, encoding, internal_enc);
+                        }
+
+                        rb_ary_push(tag_directives, rb_ary_new3((long)2, handle, prefix));
+                    }
+                }
+                args[0] = handler;
+                args[1] = version;
+                args[2] = tag_directives;
+                args[3] = event.data.document_start.implicit == 1 ? Qtrue : Qfalse;
+                rb_protect(protected_start_document, (VALUE)args, &state);
+            }
+            break;
+          case YAML_DOCUMENT_END_EVENT:
+            {
+                VALUE args[2];
+
+                args[0] = handler;
+                args[1] = event.data.document_end.implicit == 1 ? Qtrue : Qfalse;
+                rb_protect(protected_end_document, (VALUE)args, &state);
+            }
+            break;
+          case YAML_ALIAS_EVENT:
+            {
+                VALUE args[2];
+                VALUE alias = Qnil;
+                if(event.data.alias.anchor) {
+                    alias = rb_str_new2((const char *)event.data.alias.anchor);
+                    PSYCH_TRANSCODE(alias, encoding, internal_enc);
+                }
+
+                args[0] = handler;
+                args[1] = alias;
+                rb_protect(protected_alias, (VALUE)args, &state);
+            }
+            break;
+          case YAML_SCALAR_EVENT:
+            {
+                VALUE args[7];
+                VALUE anchor = Qnil;
+                VALUE tag = Qnil;
+                VALUE plain_implicit, quoted_implicit, style;
+                VALUE val = rb_str_new(
+                    (const char *)event.data.scalar.value,
+                    (long)event.data.scalar.length
+                    );
+
+                PSYCH_TRANSCODE(val, encoding, internal_enc);
+
+                if(event.data.scalar.anchor) {
+                    anchor = rb_str_new2((const char *)event.data.scalar.anchor);
+                    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
+                }
+
+                if(event.data.scalar.tag) {
+                    tag = rb_str_new2((const char *)event.data.scalar.tag);
+                    PSYCH_TRANSCODE(tag, encoding, internal_enc);
+                }
+
+                plain_implicit =
+                    event.data.scalar.plain_implicit == 0 ? Qfalse : Qtrue;
+
+                quoted_implicit =
+                    event.data.scalar.quoted_implicit == 0 ? Qfalse : Qtrue;
+
+                style = INT2NUM(event.data.scalar.style);
+
+                args[0] = handler;
+                args[1] = val;
+                args[2] = anchor;
+                args[3] = tag;
+                args[4] = plain_implicit;
+                args[5] = quoted_implicit;
+                args[6] = style;
+                rb_protect(protected_scalar, (VALUE)args, &state);
+            }
+            break;
+          case YAML_SEQUENCE_START_EVENT:
+            {
+                VALUE args[5];
+                VALUE anchor = Qnil;
+                VALUE tag = Qnil;
+                VALUE implicit, style;
+                if(event.data.sequence_start.anchor) {
+                    anchor = rb_str_new2((const char *)event.data.sequence_start.anchor);
+                    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
+                }
+
+                tag = Qnil;
+                if(event.data.sequence_start.tag) {
+                    tag = rb_str_new2((const char *)event.data.sequence_start.tag);
+                    PSYCH_TRANSCODE(tag, encoding, internal_enc);
+                }
+
+                implicit =
+                    event.data.sequence_start.implicit == 0 ? Qfalse : Qtrue;
+
+                style = INT2NUM(event.data.sequence_start.style);
+
+                args[0] = handler;
+                args[1] = anchor;
+                args[2] = tag;
+                args[3] = implicit;
+                args[4] = style;
+
+                rb_protect(protected_start_sequence, (VALUE)args, &state);
+            }
+            break;
+          case YAML_SEQUENCE_END_EVENT:
+            rb_protect(protected_end_sequence, handler, &state);
+            break;
+          case YAML_MAPPING_START_EVENT:
+            {
+                VALUE args[5];
+                VALUE anchor = Qnil;
+                VALUE tag = Qnil;
+                VALUE implicit, style;
+                if(event.data.mapping_start.anchor) {
+                    anchor = rb_str_new2((const char *)event.data.mapping_start.anchor);
+                    PSYCH_TRANSCODE(anchor, encoding, internal_enc);
+                }
+
+                if(event.data.mapping_start.tag) {
+                    tag = rb_str_new2((const char *)event.data.mapping_start.tag);
+                    PSYCH_TRANSCODE(tag, encoding, internal_enc);
+                }
+
+                implicit =
+                    event.data.mapping_start.implicit == 0 ? Qfalse : Qtrue;
+
+                style = INT2NUM(event.data.mapping_start.style);
+
+                args[0] = handler;
+                args[1] = anchor;
+                args[2] = tag;
+                args[3] = implicit;
+                args[4] = style;
+
+                rb_protect(protected_start_mapping, (VALUE)args, &state);
+            }
+            break;
+          case YAML_MAPPING_END_EVENT:
+            rb_protect(protected_end_mapping, handler, &state);
+            break;
+          case YAML_NO_EVENT:
+            rb_protect(protected_empty, handler, &state);
+            break;
+          case YAML_STREAM_END_EVENT:
+            rb_protect(protected_end_stream, handler, &state);
+            done = 1;
+            break;
+        }
+        yaml_event_delete(&event);
+        if (state) rb_jump_tag(state);
     }
 
     return self;
@@ -562,4 +573,3 @@ void Init_psych_parser(void)
     id_end_mapping     = rb_intern("end_mapping");
     id_event_location  = rb_intern("event_location");
 }
-/* vim: set noet sws=4 sw=4: */
diff --git a/ext/psych/psych_to_ruby.c b/ext/psych/psych_to_ruby.c
index b388ff7754..3ab0138b52 100644
--- a/ext/psych/psych_to_ruby.c
+++ b/ext/psych/psych_to_ruby.c
@@ -10,7 +10,11 @@ static VALUE build_exception(VALUE self, VALUE klass, VALUE mesg)
 {
     VALUE e = rb_obj_alloc(klass);
 
+#ifdef TRUFFLERUBY
+    rb_exc_set_message(e, mesg);
+#else
     rb_iv_set(e, "mesg", mesg);
+#endif
 
     return e;
 }
@@ -36,4 +40,3 @@ void Init_psych_to_ruby(void)
     rb_define_private_method(cPsychVisitorsToRuby, "build_exception", build_exception, 2);
     rb_define_private_method(class_loader, "path2class", path2class, 1);
 }
-/* vim: set noet sws=4 sw=4: */
diff --git a/ext/psych/psych_yaml_tree.c b/ext/psych/psych_yaml_tree.c
index 225655d127..bbd93f874d 100644
--- a/ext/psych/psych_yaml_tree.c
+++ b/ext/psych/psych_yaml_tree.c
@@ -9,4 +9,3 @@ void Init_psych_yaml_tree(void)
     VALUE visitor   = rb_define_class_under(visitors, "Visitor", rb_cObject);
     cPsychVisitorsYamlTree = rb_define_class_under(visitors, "YAMLTree", visitor);
 }
-/* vim: set noet sws=4 sw=4: */
diff --git a/ext/pty/depend b/ext/pty/depend
index adecfff862..8fa018d084 100644
--- a/ext/pty/depend
+++ b/ext/pty/depend
@@ -138,6 +138,7 @@ pty.o: $(hdrdir)/ruby/internal/intern/re.h
 pty.o: $(hdrdir)/ruby/internal/intern/ruby.h
 pty.o: $(hdrdir)/ruby/internal/intern/select.h
 pty.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+pty.o: $(hdrdir)/ruby/internal/intern/set.h
 pty.o: $(hdrdir)/ruby/internal/intern/signal.h
 pty.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 pty.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -172,6 +173,7 @@ pty.o: $(hdrdir)/ruby/ruby.h
 pty.o: $(hdrdir)/ruby/st.h
 pty.o: $(hdrdir)/ruby/subst.h
 pty.o: $(hdrdir)/ruby/util.h
+pty.o: $(top_srcdir)/id_table.h
 pty.o: $(top_srcdir)/internal.h
 pty.o: $(top_srcdir)/internal/array.h
 pty.o: $(top_srcdir)/internal/compilers.h
diff --git a/ext/pty/extconf.rb b/ext/pty/extconf.rb
index da3655cf4d..ae2cb45d3c 100644
--- a/ext/pty/extconf.rb
+++ b/ext/pty/extconf.rb
@@ -21,6 +21,8 @@ if /mswin|mingw|bccwin/ !~ RUBY_PLATFORM
       (util or have_func("openpty")) or
       have_func("_getpty") or
       have_func("ioctl")
+    have_macro("HAVE_FCHMOD") or have_func("fchmod")
+    have_macro("HAVE_FCHOWN") or have_func("fchown")
     create_makefile('pty')
   end
 end
diff --git a/ext/pty/pty.c b/ext/pty/pty.c
index 5ca55e41d6..3d5977707f 100644
--- a/ext/pty/pty.c
+++ b/ext/pty/pty.c
@@ -94,7 +94,7 @@ static void getDevice(int*, int*, char [DEVICELEN], int);
 
 static int start_new_session(char *errbuf, size_t errbuf_len);
 static int obtain_ctty(int master, int slave, const char *slavename, char *errbuf, size_t errbuf_len);
-static int drop_privilige(char *errbuf, size_t errbuf_len);
+static int drop_privilege(char *errbuf, size_t errbuf_len);
 
 struct child_info {
     int master, slave;
@@ -117,7 +117,7 @@ chfunc(void *data, char *errbuf, size_t errbuf_len)
     if (obtain_ctty(master, slave, slavename, errbuf, errbuf_len))
         return -1;
 
-    if (drop_privilige(errbuf, errbuf_len))
+    if (drop_privilege(errbuf, errbuf_len))
         return -1;
 
     return rb_exec_async_signal_safe(carg->eargp, errbuf, errbuf_len);
@@ -180,12 +180,12 @@ obtain_ctty(int master, int slave, const char *slavename, char *errbuf, size_t e
     dup2(slave,0);
     dup2(slave,1);
     dup2(slave,2);
-    if (slave < 0 || slave > 2) (void)!close(slave);
+    if (slave > 2) (void)!close(slave);
     return 0;
 }
 
 static int
-drop_privilige(char *errbuf, size_t errbuf_len)
+drop_privilege(char *errbuf, size_t errbuf_len)
 {
 #if defined(HAVE_SETEUID) || defined(HAVE_SETREUID) || defined(HAVE_SETRESUID)
     if (seteuid(getuid())) ERROR_EXIT("seteuid()");
@@ -215,9 +215,13 @@ establishShell(int argc, VALUE *argv, struct pty_info *info,
         else {
 #if defined HAVE_PWD_H
             const char *username = getenv("USER");
-            struct passwd *pwent = getpwnam(username ? username : getlogin());
-            if (pwent && pwent->pw_shell)
-                shellname = pwent->pw_shell;
+            if (username == NULL)
+                username = getlogin();
+            if (username != NULL) {
+                struct passwd *pwent = getpwnam(username);
+                if (pwent && pwent->pw_shell)
+                    shellname = pwent->pw_shell;
+            }
 #endif
         }
         v = rb_str_new2(shellname);
@@ -270,12 +274,23 @@ ptsname_r(int fd, char *buf, size_t buflen)
 # define HAVE_PTSNAME_R 1
 #endif
 
+#ifdef HAVE_FCHMOD
+# define change_mode(name, fd, mode) fchmod(fd, mode)
+#else
+# define change_mode(name, fd, mode) chmod(name, mode)
+#endif
+#ifdef HAVE_FCHOWN
+# define change_owner(name, fd, uid, gid) fchown(fd, uid, gid)
+#else
+# define change_owner(name, fd, uid, gid) chown(name, uid, gid)
+#endif
+
 #if defined(HAVE_POSIX_OPENPT) || defined(HAVE_OPENPTY) || defined(HAVE_PTSNAME_R)
-static int
-no_mesg(char *slavedevice, int nomesg)
+static inline int
+prevent_messages(const char *slavedevice, int fd, int nomesg)
 {
     if (nomesg)
-        return chmod(slavedevice, 0600);
+        return change_mode(slavedevice, fd, 0600);
     else
         return 0;
 }
@@ -336,8 +351,8 @@ get_device_once(int *master, int *slave, char SlaveName[DEVICELEN], int nomesg,
     if (unlockpt(masterfd) == -1) goto error;
     if (ptsname_r(masterfd, SlaveName, DEVICELEN) != 0) goto error;
     slavedevice = SlaveName;
-    if (no_mesg(slavedevice, nomesg) == -1) goto error;
     if ((slavefd = rb_cloexec_open(slavedevice, O_RDWR|O_NOCTTY, 0)) == -1) goto error;
+    if (prevent_messages(slavedevice, slavefd, nomesg) == -1) goto error;
     rb_update_max_fd(slavefd);
 
 #if defined(I_PUSH) && !defined(__linux__) && !defined(_AIX)
@@ -371,7 +386,9 @@ get_device_once(int *master, int *slave, char SlaveName[DEVICELEN], int nomesg,
     }
     rb_fd_fix_cloexec(*master);
     rb_fd_fix_cloexec(*slave);
-    if (no_mesg(SlaveName, nomesg) == -1) {
+    if (prevent_messages(SlaveName, *slave, nomesg) == -1) {
+        close(*master);
+        close(*slave);
         if (!fail) return -1;
         rb_raise(rb_eRuntimeError, "can't chmod slave pty");
     }
@@ -420,8 +437,8 @@ get_device_once(int *master, int *slave, char SlaveName[DEVICELEN], int nomesg,
     if(unlockpt(masterfd) == -1) goto error;
     if (ptsname_r(masterfd, SlaveName, DEVICELEN) != 0) goto error;
     slavedevice = SlaveName;
-    if (no_mesg(slavedevice, nomesg) == -1) goto error;
     if((slavefd = rb_cloexec_open(slavedevice, O_RDWR, 0)) == -1) goto error;
+    if (prevent_messages(slavedevice, slavefd, nomesg) == -1) goto error;
     rb_update_max_fd(slavefd);
 #if defined(I_PUSH) && !defined(__linux__) && !defined(_AIX)
     if(ioctl_I_PUSH(slavefd, "ptem") == -1) goto error;
@@ -474,8 +491,8 @@ get_device_once(int *master, int *slave, char SlaveName[DEVICELEN], int nomesg,
             if ((slavefd = rb_cloexec_open(SlaveName,O_RDWR,0)) >= 0) {
                 rb_update_max_fd(slavefd);
                 *slave = slavefd;
-                if (chown(SlaveName, getuid(), getgid()) != 0) goto error;
-                if (chmod(SlaveName, nomesg ? 0600 : 0622) != 0) goto error;
+                if (change_owner(SlaveName, slavefd, getuid(), getgid()) != 0) goto error;
+                if (change_mode(SlaveName, slavefd, nomesg ? 0600 : 0622) != 0) goto error;
                 return 0;
             }
             close(masterfd);
@@ -606,9 +623,17 @@ pty_detach_process(VALUE v)
  * +env+ is an optional hash that provides additional environment variables to the spawned pty.
  *
  *   # sets FOO to "bar"
- *   PTY.spawn({"FOO"=>"bar"}, "printenv", "FOO") { |r,w,pid| p r.read } #=> "bar\r\n"
+ *   PTY.spawn({"FOO"=>"bar"}, "printenv", "FOO") do |r, w, pid|
+ *     p r.read #=> "bar\r\n"
+ *   ensure
+ *     r.close; w.close; Process.wait(pid)
+ *   end
  *   # unsets FOO
- *   PTY.spawn({"FOO"=>nil}, "printenv", "FOO") { |r,w,pid| p r.read } #=> ""
+ *   PTY.spawn({"FOO"=>nil}, "printenv", "FOO") do |r, w, pid|
+ *     p r.read #=> ""
+ *   ensure
+ *     r.close; w.close; Process.wait(pid)
+ *   end
  *
  * +command+ and +command_line+ are the full commands to run, given a String.
  * Any additional +arguments+ will be passed to the command.
@@ -624,6 +649,15 @@ pty_detach_process(VALUE v)
  *       standard output and standard error
  * +w+:: A writable IO that is the command's standard input
  * +pid+:: The process identifier for the command.
+ *
+ * === Clean up
+ *
+ * This method does not clean up like closing IOs or waiting for child
+ * process, except that the process is detached in the block form to
+ * prevent it from becoming a zombie (see Process.detach).  Any other
+ * cleanup is the responsibility of the caller.  If waiting for +pid+,
+ * be sure to close both +r+ and +w+ before doing so; doing it in the
+ * reverse order may cause deadlock on some OSes.
  */
 static VALUE
 pty_getpty(int argc, VALUE *argv, VALUE self)
diff --git a/ext/rbconfig/sizeof/depend b/ext/rbconfig/sizeof/depend
index 5f75fa8c76..7e6c950769 100644
--- a/ext/rbconfig/sizeof/depend
+++ b/ext/rbconfig/sizeof/depend
@@ -142,6 +142,7 @@ limits.o: $(hdrdir)/ruby/internal/intern/re.h
 limits.o: $(hdrdir)/ruby/internal/intern/ruby.h
 limits.o: $(hdrdir)/ruby/internal/intern/select.h
 limits.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+limits.o: $(hdrdir)/ruby/internal/intern/set.h
 limits.o: $(hdrdir)/ruby/internal/intern/signal.h
 limits.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 limits.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -301,6 +302,7 @@ sizes.o: $(hdrdir)/ruby/internal/intern/re.h
 sizes.o: $(hdrdir)/ruby/internal/intern/ruby.h
 sizes.o: $(hdrdir)/ruby/internal/intern/select.h
 sizes.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+sizes.o: $(hdrdir)/ruby/internal/intern/set.h
 sizes.o: $(hdrdir)/ruby/internal/intern/signal.h
 sizes.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 sizes.o: $(hdrdir)/ruby/internal/intern/string.h
diff --git a/ext/ripper/depend b/ext/ripper/depend
index fe6bd872bd..db83378a1d 100644
--- a/ext/ripper/depend
+++ b/ext/ripper/depend
@@ -1,7 +1,7 @@
 GEN  = $(srcdir)/tools/generate.rb
 SRC1 = $(top_srcdir)/parse.y
 SRC2 = $(srcdir)/eventids2.c
-BISON = $(BASERUBY) $(top_srcdir)/tool/lrama/exe/lrama
+LRAMA = $(BASERUBY) $(top_srcdir)/tool/lrama/exe/lrama
 
 .SUFFIXES: .y
 
@@ -12,7 +12,7 @@ ripper.o: ripper.c
 
 .y.c:
 	$(ECHO) compiling compiler $<
-	$(Q) $(BISON) -t -v -o$@ - $< < $<
+	$(Q) $(LRAMA) -o$@ - $< < $<
 
 all: check
 static: check
@@ -181,6 +181,7 @@ eventids1.o: $(hdrdir)/ruby/internal/intern/re.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/ruby.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/select.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+eventids1.o: $(hdrdir)/ruby/internal/intern/set.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/signal.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 eventids1.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -352,6 +353,7 @@ eventids2.o: $(hdrdir)/ruby/internal/intern/re.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/ruby.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/select.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+eventids2.o: $(hdrdir)/ruby/internal/intern/set.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/signal.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 eventids2.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -472,6 +474,7 @@ ripper.o: $(hdrdir)/ruby/internal/core/rclass.h
 ripper.o: $(hdrdir)/ruby/internal/core/rdata.h
 ripper.o: $(hdrdir)/ruby/internal/core/rfile.h
 ripper.o: $(hdrdir)/ruby/internal/core/rhash.h
+ripper.o: $(hdrdir)/ruby/internal/core/rmatch.h
 ripper.o: $(hdrdir)/ruby/internal/core/robject.h
 ripper.o: $(hdrdir)/ruby/internal/core/rregexp.h
 ripper.o: $(hdrdir)/ruby/internal/core/rstring.h
@@ -532,6 +535,7 @@ ripper.o: $(hdrdir)/ruby/internal/intern/re.h
 ripper.o: $(hdrdir)/ruby/internal/intern/ruby.h
 ripper.o: $(hdrdir)/ruby/internal/intern/select.h
 ripper.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+ripper.o: $(hdrdir)/ruby/internal/intern/set.h
 ripper.o: $(hdrdir)/ruby/internal/intern/signal.h
 ripper.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 ripper.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -563,6 +567,7 @@ ripper.o: $(hdrdir)/ruby/missing.h
 ripper.o: $(hdrdir)/ruby/onigmo.h
 ripper.o: $(hdrdir)/ruby/oniguruma.h
 ripper.o: $(hdrdir)/ruby/ractor.h
+ripper.o: $(hdrdir)/ruby/re.h
 ripper.o: $(hdrdir)/ruby/regex.h
 ripper.o: $(hdrdir)/ruby/ruby.h
 ripper.o: $(hdrdir)/ruby/st.h
@@ -575,12 +580,15 @@ ripper.o: $(top_srcdir)/ccan/container_of/container_of.h
 ripper.o: $(top_srcdir)/ccan/list/list.h
 ripper.o: $(top_srcdir)/ccan/str/str.h
 ripper.o: $(top_srcdir)/constant.h
+ripper.o: $(top_srcdir)/encindex.h
 ripper.o: $(top_srcdir)/id_table.h
 ripper.o: $(top_srcdir)/internal.h
 ripper.o: $(top_srcdir)/internal/array.h
 ripper.o: $(top_srcdir)/internal/basic_operators.h
 ripper.o: $(top_srcdir)/internal/bignum.h
 ripper.o: $(top_srcdir)/internal/bits.h
+ripper.o: $(top_srcdir)/internal/box.h
+ripper.o: $(top_srcdir)/internal/compar.h
 ripper.o: $(top_srcdir)/internal/compile.h
 ripper.o: $(top_srcdir)/internal/compilers.h
 ripper.o: $(top_srcdir)/internal/complex.h
@@ -598,8 +606,10 @@ ripper.o: $(top_srcdir)/internal/re.h
 ripper.o: $(top_srcdir)/internal/ruby_parser.h
 ripper.o: $(top_srcdir)/internal/sanitizers.h
 ripper.o: $(top_srcdir)/internal/serial.h
+ripper.o: $(top_srcdir)/internal/set_table.h
 ripper.o: $(top_srcdir)/internal/static_assert.h
 ripper.o: $(top_srcdir)/internal/string.h
+ripper.o: $(top_srcdir)/internal/struct.h
 ripper.o: $(top_srcdir)/internal/symbol.h
 ripper.o: $(top_srcdir)/internal/thread.h
 ripper.o: $(top_srcdir)/internal/variable.h
@@ -770,6 +780,7 @@ ripper_init.o: $(hdrdir)/ruby/internal/intern/re.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/ruby.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/select.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+ripper_init.o: $(hdrdir)/ruby/internal/intern/set.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/signal.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 ripper_init.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -804,8 +815,10 @@ ripper_init.o: $(hdrdir)/ruby/st.h
 ripper_init.o: $(hdrdir)/ruby/subst.h
 ripper_init.o: $(top_srcdir)/internal.h
 ripper_init.o: $(top_srcdir)/internal/array.h
+ripper_init.o: $(top_srcdir)/internal/basic_operators.h
 ripper_init.o: $(top_srcdir)/internal/bignum.h
 ripper_init.o: $(top_srcdir)/internal/bits.h
+ripper_init.o: $(top_srcdir)/internal/compar.h
 ripper_init.o: $(top_srcdir)/internal/compilers.h
 ripper_init.o: $(top_srcdir)/internal/complex.h
 ripper_init.o: $(top_srcdir)/internal/fixnum.h
diff --git a/ext/ripper/eventids2.c b/ext/ripper/eventids2.c
index 439663f0fd..87f2f588ec 100644
--- a/ext/ripper/eventids2.c
+++ b/ext/ripper/eventids2.c
@@ -255,7 +255,6 @@ ripper_token2eventid(enum yytokentype tok)
         [tRATIONAL]		= O(rational),
         [tREGEXP_BEG]		= O(regexp_beg),
         [tREGEXP_END]		= O(regexp_end),
-        [tRPAREN]		= O(rparen),
         [tRSHFT]		= O(op),
         [tSTAR] 		= O(op),
         [tDSTAR]		= O(op),
diff --git a/ext/ripper/lib/ripper/lexer.rb b/ext/ripper/lib/ripper/lexer.rb
index 6a3c04af30..9b849dfeae 100644
--- a/ext/ripper/lib/ripper/lexer.rb
+++ b/ext/ripper/lib/ripper/lexer.rb
@@ -53,6 +53,7 @@ class Ripper
   end
 
   class Lexer < ::Ripper   #:nodoc: internal use only
+    # :stopdoc:
     class State
       attr_reader :to_int, :to_s
 
@@ -67,7 +68,7 @@ class Ripper
         when 0, :to_int
           @to_int
         when 1, :to_s
-          @event
+          @to_s
         else
           nil
         end
@@ -242,7 +243,12 @@ class Ripper
     end
 
     def on_error2(mesg, elem)
-      @errors.push Elem.new(elem.pos, __callee__, elem.tok, elem.state, mesg)
+      if elem
+        elem = Elem.new(elem.pos, __callee__, elem.tok, elem.state, mesg)
+      else
+        elem = Elem.new([lineno(), column()], __callee__, token(), state(), mesg)
+      end
+      @errors.push elem
     end
     PARSER_EVENTS.grep(/_error\z/) do |e|
       arity = PARSER_EVENT_TABLE.fetch(e)
@@ -253,6 +259,7 @@ class Ripper
     (SCANNER_EVENTS.map {|event|:"on_#{event}"} - private_instance_methods(false)).each do |event|
       alias_method event, :_push_token
     end
+    # :startdoc:
   end
 
   # [EXPERIMENTAL]
diff --git a/ext/ripper/ripper_init.c.tmpl b/ext/ripper/ripper_init.c.tmpl
index fc98c067b8..11e432423d 100644
--- a/ext/ripper/ripper_init.c.tmpl
+++ b/ext/ripper/ripper_init.c.tmpl
@@ -252,6 +252,18 @@ ripper_parser_set_debug_output(VALUE self, VALUE output)
     return output;
 }
 
+static int
+ripper_parser_dedent_string(struct parser_params *p, VALUE string, int width)
+{
+    int col;
+    rb_parser_string_t *str;
+    str = rb_str_to_parser_string(p, string);
+    col = rb_ruby_ripper_dedent_string(p, str, width);
+    rb_str_replace(string, rb_str_new_parser_string(str));
+    rb_parser_string_free(p, str);
+    return col;
+}
+
 #ifdef UNIVERSAL_PARSER
 struct dedent_string_arg {
     struct parser_params *p;
@@ -267,7 +279,7 @@ parser_dedent_string0(VALUE a)
 
     StringValue(arg->input);
     wid = NUM2UINT(arg->width);
-    col = rb_ruby_ripper_dedent_string(arg->p, arg->input, wid);
+    col = ripper_parser_dedent_string(arg->p, arg->input, wid);
     return INT2NUM(col);
 }
 
@@ -312,7 +324,7 @@ parser_dedent_string(VALUE self, VALUE input, VALUE width)
 
     StringValue(input);
     wid = NUM2UINT(width);
-    col = rb_ruby_ripper_dedent_string(0, input, wid);
+    col = ripper_parser_dedent_string(0, input, wid);
     return INT2NUM(col);
 }
 #endif
diff --git a/ext/ripper/tools/generate.rb b/ext/ripper/tools/generate.rb
index 92ced37f04..57ecac0b39 100644
--- a/ext/ripper/tools/generate.rb
+++ b/ext/ripper/tools/generate.rb
@@ -75,6 +75,7 @@ def generate_eventids1_h(ids)
   buf << %Q[#ifndef RIPPER_EVENTIDS1\n]
   buf << %Q[#define RIPPER_EVENTIDS1\n]
   buf << %Q[\n]
+  buf << %Q[#define RIPPER_ID(n) ripper_parser_ids.id_ ## n\n]
   buf << %Q[void ripper_init_eventids1(void);\n]
   buf << %Q[void ripper_init_eventids1_table(VALUE self);\n]
   buf << %Q[\n]
@@ -84,9 +85,6 @@ def generate_eventids1_h(ids)
   end
   buf << %Q[};\n]
   buf << %Q[\n]
-  ids.each do |id, arity|
-    buf << %Q[#define ripper_id_#{id} ripper_parser_ids.id_#{id}\n]
-  end
   buf << %Q[#endif /* RIPPER_EVENTIDS1 */\n]
   buf << %Q[\n]
 end
@@ -101,7 +99,7 @@ def generate_eventids1(ids)
   buf << %Q[void\n]
   buf << %Q[ripper_init_eventids1(void)\n]
   buf << %Q[{\n]
-  buf << %Q[#define set_id1(name) ripper_id_##name = rb_intern_const("on_"#name)\n]
+  buf << %Q[#define set_id1(name) RIPPER_ID(name) = rb_intern_const("on_"#name)\n]
   ids.each do |id, arity|
     buf << %Q[    set_id1(#{id});\n]
   end
diff --git a/ext/socket/ancdata.c b/ext/socket/ancdata.c
index 6ef040b692..0e17d9e873 100644
--- a/ext/socket/ancdata.c
+++ b/ext/socket/ancdata.c
@@ -711,6 +711,9 @@ anc_inspect_passcred_credentials(int level, int type, VALUE data, VALUE ret)
 static int
 anc_inspect_socket_creds(int level, int type, VALUE data, VALUE ret)
 {
+    long len;
+    const char *ptr;
+
     if (level != SOL_SOCKET && type != SCM_CREDS)
         return 0;
 
@@ -725,48 +728,59 @@ anc_inspect_socket_creds(int level, int type, VALUE data, VALUE ret)
      * This heuristics works well except when sc_ngroups == CMGROUP_MAX.
      */
 
+    RSTRING_GETMEM(data, ptr, len);
 #if defined(HAVE_TYPE_STRUCT_CMSGCRED) /* FreeBSD */
-    if (RSTRING_LEN(data) == sizeof(struct cmsgcred)) {
+    if (len == sizeof(struct cmsgcred)) {
         struct cmsgcred cred;
-        memcpy(&cred, RSTRING_PTR(data), sizeof(struct cmsgcred));
+        int ngroups;
+        memcpy(&cred, ptr, sizeof(struct cmsgcred));
         rb_str_catf(ret, " pid=%u", cred.cmcred_pid);
         rb_str_catf(ret, " uid=%u", cred.cmcred_uid);
         rb_str_catf(ret, " euid=%u", cred.cmcred_euid);
         rb_str_catf(ret, " gid=%u", cred.cmcred_gid);
-        if (cred.cmcred_ngroups) {
+        rb_str_catf(ret, " groups[%d]=[", cred.cmcred_ngroups);
+        ngroups = cred.cmcred_ngroups;
+        if (ngroups > 0) {
             int i;
-            const char *sep = " groups=";
-            for (i = 0; i < cred.cmcred_ngroups; i++) {
-                rb_str_catf(ret, "%s%u", sep, cred.cmcred_groups[i]);
-                sep = ",";
+            rb_str_catf(ret, "%u", cred.cmcred_groups[0]);
+            if (ngroups > CMGROUP_MAX) ngroups = CMGROUP_MAX;
+            for (i = 1; i < ngroups; i++) {
+                rb_str_catf(ret, ",%u", cred.cmcred_groups[i]);
             }
         }
-        rb_str_cat2(ret, " (cmsgcred)");
+        rb_str_cat2(ret, "] (cmsgcred)");
         return 1;
     }
 #endif
 #if defined(HAVE_TYPE_STRUCT_SOCKCRED) /* FreeBSD, NetBSD */
-    if ((size_t)RSTRING_LEN(data) >= SOCKCREDSIZE(0)) {
-        struct sockcred cred0, *cred;
-        memcpy(&cred0, RSTRING_PTR(data), SOCKCREDSIZE(0));
-        if ((size_t)RSTRING_LEN(data) == SOCKCREDSIZE(cred0.sc_ngroups)) {
-            cred = (struct sockcred *)ALLOCA_N(char, SOCKCREDSIZE(cred0.sc_ngroups));
-            memcpy(cred, RSTRING_PTR(data), SOCKCREDSIZE(cred0.sc_ngroups));
-            rb_str_catf(ret, " uid=%u", cred->sc_uid);
-            rb_str_catf(ret, " euid=%u", cred->sc_euid);
-            rb_str_catf(ret, " gid=%u", cred->sc_gid);
-            rb_str_catf(ret, " egid=%u", cred->sc_egid);
-            if (cred0.sc_ngroups) {
-                int i;
-                const char *sep = " groups=";
-                for (i = 0; i < cred0.sc_ngroups; i++) {
-                    rb_str_catf(ret, "%s%u", sep, cred->sc_groups[i]);
-                    sep = ",";
-                }
+    if ((size_t)len >= SOCKCREDSIZE(0)) {
+        struct sockcred cred;
+        int ngroups;
+        memcpy(&cred, ptr, SOCKCREDSIZE(0));
+        rb_str_catf(ret, " uid=%u", cred.sc_uid);
+        rb_str_catf(ret, " euid=%u", cred.sc_euid);
+        rb_str_catf(ret, " gid=%u", cred.sc_gid);
+        rb_str_catf(ret, " egid=%u", cred.sc_egid);
+        rb_str_catf(ret, " groups[%d]=[", cred.sc_ngroups);
+        ngroups = cred.sc_ngroups;
+        if (ngroups <= 0) {
+            ngroups = 0;
+        }
+        else {
+            size_t max = ((size_t)len - SOCKCREDSIZE(0)) / sizeof(gid_t);
+            if ((size_t)ngroups > max) ngroups = (int)max;
+        }
+        if (ngroups > 0) {
+            int i;
+            const void *gp = ptr + offsetof(struct sockcred, sc_groups);
+            const gid_t *groups = MEMCPY(ALLOCA_N(gid_t, ngroups), gp, gid_t, ngroups);
+            rb_str_catf(ret, "%u", groups[0]);
+            for (i = 1; i < ngroups; i++) {
+                rb_str_catf(ret, ",%u", groups[i]);
             }
-            rb_str_cat2(ret, " (sockcred)");
-            return 1;
         }
+        rb_str_cat2(ret, "] (sockcred)");
+        return 1;
     }
 #endif
     return 0;
@@ -1000,6 +1014,7 @@ ancillary_inspect(VALUE self)
             rb_str_catf(ret, " %"PRIsVALUE, rb_sym2str(vtype));
         else
             rb_str_catf(ret, " cmsg_type:%d", type);
+        RB_GC_GUARD(vtype);
     }
     else {
         rb_str_catf(ret, " cmsg_level:%d", level);
@@ -1643,14 +1658,14 @@ bsock_recvmsg_internal(VALUE sock,
         rb_obj_reveal(dat_str, rb_cString);
     }
 
-    ret = rb_ary_new3(3, dat_str,
-                         rsock_io_socket_addrinfo(sock, mh.msg_name, mh.msg_namelen),
 #if defined(HAVE_STRUCT_MSGHDR_MSG_CONTROL)
-                         INT2NUM(mh.msg_flags)
+    VALUE msg_flags = INT2NUM(mh.msg_flags);
 #else
-                         Qnil
+    VALUE msg_flags = Qnil;
 #endif
-                         );
+    ret = rb_ary_new3(3, dat_str,
+                         rsock_io_socket_addrinfo(sock, mh.msg_name, mh.msg_namelen),
+                         msg_flags);
 
 #if defined(HAVE_STRUCT_MSGHDR_MSG_CONTROL)
     family = rsock_getfamily(fptr);
diff --git a/ext/socket/basicsocket.c b/ext/socket/basicsocket.c
index 54c369f6fc..2fcae8eb54 100644
--- a/ext/socket/basicsocket.c
+++ b/ext/socket/basicsocket.c
@@ -124,7 +124,7 @@ bsock_close_read(VALUE sock)
     rb_io_t *fptr;
 
     GetOpenFile(sock, fptr);
-    shutdown(fptr->fd, 0);
+    shutdown(fptr->fd, SHUT_RD);
     if (!(fptr->mode & FMODE_WRITABLE)) {
         return rb_io_close(sock);
     }
@@ -157,7 +157,7 @@ bsock_close_write(VALUE sock)
     if (!(fptr->mode & FMODE_READABLE)) {
         return rb_io_close(sock);
     }
-    shutdown(fptr->fd, 1);
+    shutdown(fptr->fd, SHUT_WR);
     fptr->mode &= ~FMODE_WRITABLE;
 
     return Qnil;
@@ -597,7 +597,7 @@ rsock_bsock_send(int argc, VALUE *argv, VALUE socket)
         rb_io_wait(socket, RB_INT2NUM(RUBY_IO_WRITABLE), Qnil);
 #endif
 
-        ssize_t n = (ssize_t)BLOCKING_REGION_FD(func, &arg);
+        ssize_t n = (ssize_t)rb_io_blocking_region(fptr, func, &arg);
 
         if (n >= 0) return SSIZET2NUM(n);
 
diff --git a/ext/socket/depend b/ext/socket/depend
index 750bb0734f..77f6239a3d 100644
--- a/ext/socket/depend
+++ b/ext/socket/depend
@@ -151,6 +151,7 @@ ancdata.o: $(hdrdir)/ruby/internal/intern/re.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/ruby.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/select.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+ancdata.o: $(hdrdir)/ruby/internal/intern/set.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/signal.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 ancdata.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -192,9 +193,12 @@ ancdata.o: $(top_srcdir)/ccan/check_type/check_type.h
 ancdata.o: $(top_srcdir)/ccan/container_of/container_of.h
 ancdata.o: $(top_srcdir)/ccan/list/list.h
 ancdata.o: $(top_srcdir)/ccan/str/str.h
+ancdata.o: $(top_srcdir)/encindex.h
+ancdata.o: $(top_srcdir)/id_table.h
 ancdata.o: $(top_srcdir)/internal.h
 ancdata.o: $(top_srcdir)/internal/array.h
 ancdata.o: $(top_srcdir)/internal/basic_operators.h
+ancdata.o: $(top_srcdir)/internal/box.h
 ancdata.o: $(top_srcdir)/internal/compilers.h
 ancdata.o: $(top_srcdir)/internal/error.h
 ancdata.o: $(top_srcdir)/internal/gc.h
@@ -202,6 +206,7 @@ ancdata.o: $(top_srcdir)/internal/imemo.h
 ancdata.o: $(top_srcdir)/internal/io.h
 ancdata.o: $(top_srcdir)/internal/sanitizers.h
 ancdata.o: $(top_srcdir)/internal/serial.h
+ancdata.o: $(top_srcdir)/internal/set_table.h
 ancdata.o: $(top_srcdir)/internal/static_assert.h
 ancdata.o: $(top_srcdir)/internal/string.h
 ancdata.o: $(top_srcdir)/internal/thread.h
@@ -362,6 +367,7 @@ basicsocket.o: $(hdrdir)/ruby/internal/intern/re.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/select.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+basicsocket.o: $(hdrdir)/ruby/internal/intern/set.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 basicsocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -403,9 +409,12 @@ basicsocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 basicsocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 basicsocket.o: $(top_srcdir)/ccan/list/list.h
 basicsocket.o: $(top_srcdir)/ccan/str/str.h
+basicsocket.o: $(top_srcdir)/encindex.h
+basicsocket.o: $(top_srcdir)/id_table.h
 basicsocket.o: $(top_srcdir)/internal.h
 basicsocket.o: $(top_srcdir)/internal/array.h
 basicsocket.o: $(top_srcdir)/internal/basic_operators.h
+basicsocket.o: $(top_srcdir)/internal/box.h
 basicsocket.o: $(top_srcdir)/internal/compilers.h
 basicsocket.o: $(top_srcdir)/internal/error.h
 basicsocket.o: $(top_srcdir)/internal/gc.h
@@ -413,6 +422,7 @@ basicsocket.o: $(top_srcdir)/internal/imemo.h
 basicsocket.o: $(top_srcdir)/internal/io.h
 basicsocket.o: $(top_srcdir)/internal/sanitizers.h
 basicsocket.o: $(top_srcdir)/internal/serial.h
+basicsocket.o: $(top_srcdir)/internal/set_table.h
 basicsocket.o: $(top_srcdir)/internal/static_assert.h
 basicsocket.o: $(top_srcdir)/internal/string.h
 basicsocket.o: $(top_srcdir)/internal/thread.h
@@ -573,6 +583,7 @@ constants.o: $(hdrdir)/ruby/internal/intern/re.h
 constants.o: $(hdrdir)/ruby/internal/intern/ruby.h
 constants.o: $(hdrdir)/ruby/internal/intern/select.h
 constants.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+constants.o: $(hdrdir)/ruby/internal/intern/set.h
 constants.o: $(hdrdir)/ruby/internal/intern/signal.h
 constants.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 constants.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -614,9 +625,12 @@ constants.o: $(top_srcdir)/ccan/check_type/check_type.h
 constants.o: $(top_srcdir)/ccan/container_of/container_of.h
 constants.o: $(top_srcdir)/ccan/list/list.h
 constants.o: $(top_srcdir)/ccan/str/str.h
+constants.o: $(top_srcdir)/encindex.h
+constants.o: $(top_srcdir)/id_table.h
 constants.o: $(top_srcdir)/internal.h
 constants.o: $(top_srcdir)/internal/array.h
 constants.o: $(top_srcdir)/internal/basic_operators.h
+constants.o: $(top_srcdir)/internal/box.h
 constants.o: $(top_srcdir)/internal/compilers.h
 constants.o: $(top_srcdir)/internal/error.h
 constants.o: $(top_srcdir)/internal/gc.h
@@ -624,6 +638,7 @@ constants.o: $(top_srcdir)/internal/imemo.h
 constants.o: $(top_srcdir)/internal/io.h
 constants.o: $(top_srcdir)/internal/sanitizers.h
 constants.o: $(top_srcdir)/internal/serial.h
+constants.o: $(top_srcdir)/internal/set_table.h
 constants.o: $(top_srcdir)/internal/static_assert.h
 constants.o: $(top_srcdir)/internal/string.h
 constants.o: $(top_srcdir)/internal/thread.h
@@ -785,6 +800,7 @@ ifaddr.o: $(hdrdir)/ruby/internal/intern/re.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/ruby.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/select.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+ifaddr.o: $(hdrdir)/ruby/internal/intern/set.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/signal.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 ifaddr.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -826,9 +842,12 @@ ifaddr.o: $(top_srcdir)/ccan/check_type/check_type.h
 ifaddr.o: $(top_srcdir)/ccan/container_of/container_of.h
 ifaddr.o: $(top_srcdir)/ccan/list/list.h
 ifaddr.o: $(top_srcdir)/ccan/str/str.h
+ifaddr.o: $(top_srcdir)/encindex.h
+ifaddr.o: $(top_srcdir)/id_table.h
 ifaddr.o: $(top_srcdir)/internal.h
 ifaddr.o: $(top_srcdir)/internal/array.h
 ifaddr.o: $(top_srcdir)/internal/basic_operators.h
+ifaddr.o: $(top_srcdir)/internal/box.h
 ifaddr.o: $(top_srcdir)/internal/compilers.h
 ifaddr.o: $(top_srcdir)/internal/error.h
 ifaddr.o: $(top_srcdir)/internal/gc.h
@@ -836,6 +855,7 @@ ifaddr.o: $(top_srcdir)/internal/imemo.h
 ifaddr.o: $(top_srcdir)/internal/io.h
 ifaddr.o: $(top_srcdir)/internal/sanitizers.h
 ifaddr.o: $(top_srcdir)/internal/serial.h
+ifaddr.o: $(top_srcdir)/internal/set_table.h
 ifaddr.o: $(top_srcdir)/internal/static_assert.h
 ifaddr.o: $(top_srcdir)/internal/string.h
 ifaddr.o: $(top_srcdir)/internal/thread.h
@@ -996,6 +1016,7 @@ init.o: $(hdrdir)/ruby/internal/intern/re.h
 init.o: $(hdrdir)/ruby/internal/intern/ruby.h
 init.o: $(hdrdir)/ruby/internal/intern/select.h
 init.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+init.o: $(hdrdir)/ruby/internal/intern/set.h
 init.o: $(hdrdir)/ruby/internal/intern/signal.h
 init.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 init.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -1037,9 +1058,12 @@ init.o: $(top_srcdir)/ccan/check_type/check_type.h
 init.o: $(top_srcdir)/ccan/container_of/container_of.h
 init.o: $(top_srcdir)/ccan/list/list.h
 init.o: $(top_srcdir)/ccan/str/str.h
+init.o: $(top_srcdir)/encindex.h
+init.o: $(top_srcdir)/id_table.h
 init.o: $(top_srcdir)/internal.h
 init.o: $(top_srcdir)/internal/array.h
 init.o: $(top_srcdir)/internal/basic_operators.h
+init.o: $(top_srcdir)/internal/box.h
 init.o: $(top_srcdir)/internal/compilers.h
 init.o: $(top_srcdir)/internal/error.h
 init.o: $(top_srcdir)/internal/gc.h
@@ -1047,6 +1071,7 @@ init.o: $(top_srcdir)/internal/imemo.h
 init.o: $(top_srcdir)/internal/io.h
 init.o: $(top_srcdir)/internal/sanitizers.h
 init.o: $(top_srcdir)/internal/serial.h
+init.o: $(top_srcdir)/internal/set_table.h
 init.o: $(top_srcdir)/internal/static_assert.h
 init.o: $(top_srcdir)/internal/string.h
 init.o: $(top_srcdir)/internal/thread.h
@@ -1207,6 +1232,7 @@ ipsocket.o: $(hdrdir)/ruby/internal/intern/re.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/select.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+ipsocket.o: $(hdrdir)/ruby/internal/intern/set.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 ipsocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -1248,9 +1274,12 @@ ipsocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 ipsocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 ipsocket.o: $(top_srcdir)/ccan/list/list.h
 ipsocket.o: $(top_srcdir)/ccan/str/str.h
+ipsocket.o: $(top_srcdir)/encindex.h
+ipsocket.o: $(top_srcdir)/id_table.h
 ipsocket.o: $(top_srcdir)/internal.h
 ipsocket.o: $(top_srcdir)/internal/array.h
 ipsocket.o: $(top_srcdir)/internal/basic_operators.h
+ipsocket.o: $(top_srcdir)/internal/box.h
 ipsocket.o: $(top_srcdir)/internal/compilers.h
 ipsocket.o: $(top_srcdir)/internal/error.h
 ipsocket.o: $(top_srcdir)/internal/gc.h
@@ -1258,6 +1287,7 @@ ipsocket.o: $(top_srcdir)/internal/imemo.h
 ipsocket.o: $(top_srcdir)/internal/io.h
 ipsocket.o: $(top_srcdir)/internal/sanitizers.h
 ipsocket.o: $(top_srcdir)/internal/serial.h
+ipsocket.o: $(top_srcdir)/internal/set_table.h
 ipsocket.o: $(top_srcdir)/internal/static_assert.h
 ipsocket.o: $(top_srcdir)/internal/string.h
 ipsocket.o: $(top_srcdir)/internal/thread.h
@@ -1418,6 +1448,7 @@ option.o: $(hdrdir)/ruby/internal/intern/re.h
 option.o: $(hdrdir)/ruby/internal/intern/ruby.h
 option.o: $(hdrdir)/ruby/internal/intern/select.h
 option.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+option.o: $(hdrdir)/ruby/internal/intern/set.h
 option.o: $(hdrdir)/ruby/internal/intern/signal.h
 option.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 option.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -1459,9 +1490,12 @@ option.o: $(top_srcdir)/ccan/check_type/check_type.h
 option.o: $(top_srcdir)/ccan/container_of/container_of.h
 option.o: $(top_srcdir)/ccan/list/list.h
 option.o: $(top_srcdir)/ccan/str/str.h
+option.o: $(top_srcdir)/encindex.h
+option.o: $(top_srcdir)/id_table.h
 option.o: $(top_srcdir)/internal.h
 option.o: $(top_srcdir)/internal/array.h
 option.o: $(top_srcdir)/internal/basic_operators.h
+option.o: $(top_srcdir)/internal/box.h
 option.o: $(top_srcdir)/internal/compilers.h
 option.o: $(top_srcdir)/internal/error.h
 option.o: $(top_srcdir)/internal/gc.h
@@ -1469,6 +1503,7 @@ option.o: $(top_srcdir)/internal/imemo.h
 option.o: $(top_srcdir)/internal/io.h
 option.o: $(top_srcdir)/internal/sanitizers.h
 option.o: $(top_srcdir)/internal/serial.h
+option.o: $(top_srcdir)/internal/set_table.h
 option.o: $(top_srcdir)/internal/static_assert.h
 option.o: $(top_srcdir)/internal/string.h
 option.o: $(top_srcdir)/internal/thread.h
@@ -1629,6 +1664,7 @@ raddrinfo.o: $(hdrdir)/ruby/internal/intern/re.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/ruby.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/select.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+raddrinfo.o: $(hdrdir)/ruby/internal/intern/set.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/signal.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 raddrinfo.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -1670,9 +1706,12 @@ raddrinfo.o: $(top_srcdir)/ccan/check_type/check_type.h
 raddrinfo.o: $(top_srcdir)/ccan/container_of/container_of.h
 raddrinfo.o: $(top_srcdir)/ccan/list/list.h
 raddrinfo.o: $(top_srcdir)/ccan/str/str.h
+raddrinfo.o: $(top_srcdir)/encindex.h
+raddrinfo.o: $(top_srcdir)/id_table.h
 raddrinfo.o: $(top_srcdir)/internal.h
 raddrinfo.o: $(top_srcdir)/internal/array.h
 raddrinfo.o: $(top_srcdir)/internal/basic_operators.h
+raddrinfo.o: $(top_srcdir)/internal/box.h
 raddrinfo.o: $(top_srcdir)/internal/compilers.h
 raddrinfo.o: $(top_srcdir)/internal/error.h
 raddrinfo.o: $(top_srcdir)/internal/gc.h
@@ -1680,6 +1719,7 @@ raddrinfo.o: $(top_srcdir)/internal/imemo.h
 raddrinfo.o: $(top_srcdir)/internal/io.h
 raddrinfo.o: $(top_srcdir)/internal/sanitizers.h
 raddrinfo.o: $(top_srcdir)/internal/serial.h
+raddrinfo.o: $(top_srcdir)/internal/set_table.h
 raddrinfo.o: $(top_srcdir)/internal/static_assert.h
 raddrinfo.o: $(top_srcdir)/internal/string.h
 raddrinfo.o: $(top_srcdir)/internal/thread.h
@@ -1840,6 +1880,7 @@ socket.o: $(hdrdir)/ruby/internal/intern/re.h
 socket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 socket.o: $(hdrdir)/ruby/internal/intern/select.h
 socket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+socket.o: $(hdrdir)/ruby/internal/intern/set.h
 socket.o: $(hdrdir)/ruby/internal/intern/signal.h
 socket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 socket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -1881,9 +1922,12 @@ socket.o: $(top_srcdir)/ccan/check_type/check_type.h
 socket.o: $(top_srcdir)/ccan/container_of/container_of.h
 socket.o: $(top_srcdir)/ccan/list/list.h
 socket.o: $(top_srcdir)/ccan/str/str.h
+socket.o: $(top_srcdir)/encindex.h
+socket.o: $(top_srcdir)/id_table.h
 socket.o: $(top_srcdir)/internal.h
 socket.o: $(top_srcdir)/internal/array.h
 socket.o: $(top_srcdir)/internal/basic_operators.h
+socket.o: $(top_srcdir)/internal/box.h
 socket.o: $(top_srcdir)/internal/compilers.h
 socket.o: $(top_srcdir)/internal/error.h
 socket.o: $(top_srcdir)/internal/gc.h
@@ -1891,6 +1935,7 @@ socket.o: $(top_srcdir)/internal/imemo.h
 socket.o: $(top_srcdir)/internal/io.h
 socket.o: $(top_srcdir)/internal/sanitizers.h
 socket.o: $(top_srcdir)/internal/serial.h
+socket.o: $(top_srcdir)/internal/set_table.h
 socket.o: $(top_srcdir)/internal/static_assert.h
 socket.o: $(top_srcdir)/internal/string.h
 socket.o: $(top_srcdir)/internal/thread.h
@@ -2051,6 +2096,7 @@ sockssocket.o: $(hdrdir)/ruby/internal/intern/re.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/select.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+sockssocket.o: $(hdrdir)/ruby/internal/intern/set.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 sockssocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -2092,9 +2138,12 @@ sockssocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 sockssocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 sockssocket.o: $(top_srcdir)/ccan/list/list.h
 sockssocket.o: $(top_srcdir)/ccan/str/str.h
+sockssocket.o: $(top_srcdir)/encindex.h
+sockssocket.o: $(top_srcdir)/id_table.h
 sockssocket.o: $(top_srcdir)/internal.h
 sockssocket.o: $(top_srcdir)/internal/array.h
 sockssocket.o: $(top_srcdir)/internal/basic_operators.h
+sockssocket.o: $(top_srcdir)/internal/box.h
 sockssocket.o: $(top_srcdir)/internal/compilers.h
 sockssocket.o: $(top_srcdir)/internal/error.h
 sockssocket.o: $(top_srcdir)/internal/gc.h
@@ -2102,6 +2151,7 @@ sockssocket.o: $(top_srcdir)/internal/imemo.h
 sockssocket.o: $(top_srcdir)/internal/io.h
 sockssocket.o: $(top_srcdir)/internal/sanitizers.h
 sockssocket.o: $(top_srcdir)/internal/serial.h
+sockssocket.o: $(top_srcdir)/internal/set_table.h
 sockssocket.o: $(top_srcdir)/internal/static_assert.h
 sockssocket.o: $(top_srcdir)/internal/string.h
 sockssocket.o: $(top_srcdir)/internal/thread.h
@@ -2262,6 +2312,7 @@ tcpserver.o: $(hdrdir)/ruby/internal/intern/re.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/ruby.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/select.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+tcpserver.o: $(hdrdir)/ruby/internal/intern/set.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/signal.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 tcpserver.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -2303,9 +2354,12 @@ tcpserver.o: $(top_srcdir)/ccan/check_type/check_type.h
 tcpserver.o: $(top_srcdir)/ccan/container_of/container_of.h
 tcpserver.o: $(top_srcdir)/ccan/list/list.h
 tcpserver.o: $(top_srcdir)/ccan/str/str.h
+tcpserver.o: $(top_srcdir)/encindex.h
+tcpserver.o: $(top_srcdir)/id_table.h
 tcpserver.o: $(top_srcdir)/internal.h
 tcpserver.o: $(top_srcdir)/internal/array.h
 tcpserver.o: $(top_srcdir)/internal/basic_operators.h
+tcpserver.o: $(top_srcdir)/internal/box.h
 tcpserver.o: $(top_srcdir)/internal/compilers.h
 tcpserver.o: $(top_srcdir)/internal/error.h
 tcpserver.o: $(top_srcdir)/internal/gc.h
@@ -2313,6 +2367,7 @@ tcpserver.o: $(top_srcdir)/internal/imemo.h
 tcpserver.o: $(top_srcdir)/internal/io.h
 tcpserver.o: $(top_srcdir)/internal/sanitizers.h
 tcpserver.o: $(top_srcdir)/internal/serial.h
+tcpserver.o: $(top_srcdir)/internal/set_table.h
 tcpserver.o: $(top_srcdir)/internal/static_assert.h
 tcpserver.o: $(top_srcdir)/internal/string.h
 tcpserver.o: $(top_srcdir)/internal/thread.h
@@ -2473,6 +2528,7 @@ tcpsocket.o: $(hdrdir)/ruby/internal/intern/re.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/select.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+tcpsocket.o: $(hdrdir)/ruby/internal/intern/set.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 tcpsocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -2514,9 +2570,12 @@ tcpsocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 tcpsocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 tcpsocket.o: $(top_srcdir)/ccan/list/list.h
 tcpsocket.o: $(top_srcdir)/ccan/str/str.h
+tcpsocket.o: $(top_srcdir)/encindex.h
+tcpsocket.o: $(top_srcdir)/id_table.h
 tcpsocket.o: $(top_srcdir)/internal.h
 tcpsocket.o: $(top_srcdir)/internal/array.h
 tcpsocket.o: $(top_srcdir)/internal/basic_operators.h
+tcpsocket.o: $(top_srcdir)/internal/box.h
 tcpsocket.o: $(top_srcdir)/internal/compilers.h
 tcpsocket.o: $(top_srcdir)/internal/error.h
 tcpsocket.o: $(top_srcdir)/internal/gc.h
@@ -2524,6 +2583,7 @@ tcpsocket.o: $(top_srcdir)/internal/imemo.h
 tcpsocket.o: $(top_srcdir)/internal/io.h
 tcpsocket.o: $(top_srcdir)/internal/sanitizers.h
 tcpsocket.o: $(top_srcdir)/internal/serial.h
+tcpsocket.o: $(top_srcdir)/internal/set_table.h
 tcpsocket.o: $(top_srcdir)/internal/static_assert.h
 tcpsocket.o: $(top_srcdir)/internal/string.h
 tcpsocket.o: $(top_srcdir)/internal/thread.h
@@ -2684,6 +2744,7 @@ udpsocket.o: $(hdrdir)/ruby/internal/intern/re.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/select.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+udpsocket.o: $(hdrdir)/ruby/internal/intern/set.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 udpsocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -2725,9 +2786,12 @@ udpsocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 udpsocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 udpsocket.o: $(top_srcdir)/ccan/list/list.h
 udpsocket.o: $(top_srcdir)/ccan/str/str.h
+udpsocket.o: $(top_srcdir)/encindex.h
+udpsocket.o: $(top_srcdir)/id_table.h
 udpsocket.o: $(top_srcdir)/internal.h
 udpsocket.o: $(top_srcdir)/internal/array.h
 udpsocket.o: $(top_srcdir)/internal/basic_operators.h
+udpsocket.o: $(top_srcdir)/internal/box.h
 udpsocket.o: $(top_srcdir)/internal/compilers.h
 udpsocket.o: $(top_srcdir)/internal/error.h
 udpsocket.o: $(top_srcdir)/internal/gc.h
@@ -2735,6 +2799,7 @@ udpsocket.o: $(top_srcdir)/internal/imemo.h
 udpsocket.o: $(top_srcdir)/internal/io.h
 udpsocket.o: $(top_srcdir)/internal/sanitizers.h
 udpsocket.o: $(top_srcdir)/internal/serial.h
+udpsocket.o: $(top_srcdir)/internal/set_table.h
 udpsocket.o: $(top_srcdir)/internal/static_assert.h
 udpsocket.o: $(top_srcdir)/internal/string.h
 udpsocket.o: $(top_srcdir)/internal/thread.h
@@ -2895,6 +2960,7 @@ unixserver.o: $(hdrdir)/ruby/internal/intern/re.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/ruby.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/select.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+unixserver.o: $(hdrdir)/ruby/internal/intern/set.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/signal.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 unixserver.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -2936,9 +3002,12 @@ unixserver.o: $(top_srcdir)/ccan/check_type/check_type.h
 unixserver.o: $(top_srcdir)/ccan/container_of/container_of.h
 unixserver.o: $(top_srcdir)/ccan/list/list.h
 unixserver.o: $(top_srcdir)/ccan/str/str.h
+unixserver.o: $(top_srcdir)/encindex.h
+unixserver.o: $(top_srcdir)/id_table.h
 unixserver.o: $(top_srcdir)/internal.h
 unixserver.o: $(top_srcdir)/internal/array.h
 unixserver.o: $(top_srcdir)/internal/basic_operators.h
+unixserver.o: $(top_srcdir)/internal/box.h
 unixserver.o: $(top_srcdir)/internal/compilers.h
 unixserver.o: $(top_srcdir)/internal/error.h
 unixserver.o: $(top_srcdir)/internal/gc.h
@@ -2946,6 +3015,7 @@ unixserver.o: $(top_srcdir)/internal/imemo.h
 unixserver.o: $(top_srcdir)/internal/io.h
 unixserver.o: $(top_srcdir)/internal/sanitizers.h
 unixserver.o: $(top_srcdir)/internal/serial.h
+unixserver.o: $(top_srcdir)/internal/set_table.h
 unixserver.o: $(top_srcdir)/internal/static_assert.h
 unixserver.o: $(top_srcdir)/internal/string.h
 unixserver.o: $(top_srcdir)/internal/thread.h
@@ -3106,6 +3176,7 @@ unixsocket.o: $(hdrdir)/ruby/internal/intern/re.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/ruby.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/select.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+unixsocket.o: $(hdrdir)/ruby/internal/intern/set.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/signal.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 unixsocket.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -3147,9 +3218,12 @@ unixsocket.o: $(top_srcdir)/ccan/check_type/check_type.h
 unixsocket.o: $(top_srcdir)/ccan/container_of/container_of.h
 unixsocket.o: $(top_srcdir)/ccan/list/list.h
 unixsocket.o: $(top_srcdir)/ccan/str/str.h
+unixsocket.o: $(top_srcdir)/encindex.h
+unixsocket.o: $(top_srcdir)/id_table.h
 unixsocket.o: $(top_srcdir)/internal.h
 unixsocket.o: $(top_srcdir)/internal/array.h
 unixsocket.o: $(top_srcdir)/internal/basic_operators.h
+unixsocket.o: $(top_srcdir)/internal/box.h
 unixsocket.o: $(top_srcdir)/internal/compilers.h
 unixsocket.o: $(top_srcdir)/internal/error.h
 unixsocket.o: $(top_srcdir)/internal/gc.h
@@ -3157,6 +3231,7 @@ unixsocket.o: $(top_srcdir)/internal/imemo.h
 unixsocket.o: $(top_srcdir)/internal/io.h
 unixsocket.o: $(top_srcdir)/internal/sanitizers.h
 unixsocket.o: $(top_srcdir)/internal/serial.h
+unixsocket.o: $(top_srcdir)/internal/set_table.h
 unixsocket.o: $(top_srcdir)/internal/static_assert.h
 unixsocket.o: $(top_srcdir)/internal/string.h
 unixsocket.o: $(top_srcdir)/internal/thread.h
diff --git a/ext/socket/extconf.rb b/ext/socket/extconf.rb
index d44ce31b0a..a814e21c3a 100644
--- a/ext/socket/extconf.rb
+++ b/ext/socket/extconf.rb
@@ -704,6 +704,7 @@ SRC
 
   have_func("pthread_create")
   have_func("pthread_detach")
+  have_func("pthread_attr_setdetachstate")
 
   $VPATH << '$(topdir)' << '$(top_srcdir)'
   create_makefile("socket")
diff --git a/ext/socket/getaddrinfo.c b/ext/socket/getaddrinfo.c
index bf0d90129f..9a65490b1d 100644
--- a/ext/socket/getaddrinfo.c
+++ b/ext/socket/getaddrinfo.c
@@ -62,9 +62,6 @@
 #endif
 #include <unistd.h>
 #else
-#if defined(_MSC_VER) && _MSC_VER <= 1200
-#include <windows.h>
-#endif
 #include <winsock2.h>
 #include <ws2tcpip.h>
 #include <io.h>
@@ -171,9 +168,7 @@ static const char *const ai_errlist[] = {
 
 #define GET_CANONNAME(ai, str) \
 if (pai->ai_flags & AI_CANONNAME) {\
-        if (((ai)->ai_canonname = (char *)malloc(strlen(str) + 1)) != NULL) {\
-                strcpy((ai)->ai_canonname, (str));\
-        } else {\
+        if (((ai)->ai_canonname = strdup(str)) == NULL) {\
                 error = EAI_MEMORY;\
                 goto free;\
         }\
diff --git a/ext/socket/getnameinfo.c b/ext/socket/getnameinfo.c
index ae5284fab6..98da8c1647 100644
--- a/ext/socket/getnameinfo.c
+++ b/ext/socket/getnameinfo.c
@@ -55,9 +55,6 @@
 #endif
 #endif
 #ifdef _WIN32
-#if defined(_MSC_VER) && _MSC_VER <= 1200
-#include <windows.h>
-#endif
 #include <winsock2.h>
 #include <ws2tcpip.h>
 #define snprintf _snprintf
@@ -158,16 +155,14 @@ getnameinfo(const struct sockaddr *sa, socklen_t salen, char *host, socklen_t ho
                 /* what we should do? */
         } else if (flags & NI_NUMERICSERV) {
                 snprintf(numserv, sizeof(numserv), "%d", ntohs(port));
-                if (strlen(numserv) + 1 > servlen)
+                if (strlcpy(serv, numserv, servlen) >= servlen)
                         return ENI_MEMORY;
-                strcpy(serv, numserv);
         } else {
 #if defined(HAVE_GETSERVBYPORT)
                 struct servent *sp = getservbyport(port, (flags & NI_DGRAM) ? "udp" : "tcp");
                 if (sp) {
-                        if (strlen(sp->s_name) + 1 > servlen)
+                        if (strlcpy(serv, sp->s_name, servlen) >= servlen)
                                 return ENI_MEMORY;
-                        strcpy(serv, sp->s_name);
                 } else
                         return ENI_NOSERVNAME;
 #else
@@ -202,9 +197,8 @@ getnameinfo(const struct sockaddr *sa, socklen_t salen, char *host, socklen_t ho
                 if (inet_ntop(afd->a_af, addr, numaddr, sizeof(numaddr))
                     == NULL)
                         return ENI_SYSTEM;
-                if (strlen(numaddr) > hostlen)
+                if (strlcpy(host, numaddr, hostlen) >= hostlen)
                         return ENI_MEMORY;
-                strcpy(host, numaddr);
         } else {
 #ifdef INET6
                 hp = getipnodebyaddr(addr, afd->a_addrlen, afd->a_af, &h_error);
@@ -218,13 +212,12 @@ getnameinfo(const struct sockaddr *sa, socklen_t salen, char *host, socklen_t ho
                                 p = strchr(hp->h_name, '.');
                                 if (p) *p = '\0';
                         }
-                        if (strlen(hp->h_name) + 1 > hostlen) {
+                        if (strlcpy(host, hp->h_name, hostlen) >= hostlen) {
 #ifdef INET6
                                 freehostent(hp);
 #endif
                                 return ENI_MEMORY;
                         }
-                        strcpy(host, hp->h_name);
 #ifdef INET6
                         freehostent(hp);
 #endif
@@ -234,9 +227,8 @@ getnameinfo(const struct sockaddr *sa, socklen_t salen, char *host, socklen_t ho
                         if (inet_ntop(afd->a_af, addr, numaddr, sizeof(numaddr))
                             == NULL)
                                 return ENI_NOHOSTNAME;
-                        if (strlen(numaddr) > hostlen)
+                        if (strlcpy(host, numaddr, hostlen) >= hostlen)
                                 return ENI_MEMORY;
-                        strcpy(host, numaddr);
                 }
         }
         return SUCCESS;
diff --git a/ext/socket/ifaddr.c b/ext/socket/ifaddr.c
index ab163dcc8f..3596c40a11 100644
--- a/ext/socket/ifaddr.c
+++ b/ext/socket/ifaddr.c
@@ -177,6 +177,8 @@ ifaddr_ifindex(VALUE self)
  *   ifaddr.flags => integer
  *
  * Returns the flags of _ifaddr_.
+ *
+ * The value is bitwise-or of Socket::IFF_* constants such as Socket::IFF_LOOPBACK.
  */
 
 static VALUE
diff --git a/ext/socket/init.c b/ext/socket/init.c
index 0e312b540e..6091385561 100644
--- a/ext/socket/init.c
+++ b/ext/socket/init.c
@@ -107,6 +107,7 @@ rsock_send_blocking(void *data)
 }
 
 struct recvfrom_arg {
+    rb_io_t *fptr;
     int fd, flags;
     VALUE str;
     size_t length;
@@ -151,7 +152,7 @@ recvfrom_locktmp(VALUE v)
 {
     struct recvfrom_arg *arg = (struct recvfrom_arg *)v;
 
-    return rb_thread_io_blocking_region(recvfrom_blocking, arg, arg->fd);
+    return rb_io_blocking_region(arg->fptr, recvfrom_blocking, arg);
 }
 
 int
@@ -192,6 +193,7 @@ rsock_s_recvfrom(VALUE socket, int argc, VALUE *argv, enum sock_recv_type from)
         rb_raise(rb_eIOError, "recv for buffered IO");
     }
 
+    arg.fptr = fptr;
     arg.fd = fptr->fd;
     arg.alen = (socklen_t)sizeof(arg.buf);
     arg.str = str;
@@ -471,10 +473,11 @@ rsock_socket(int domain, int type, int proto)
 
 /* emulate blocking connect behavior on EINTR or non-blocking socket */
 static int
-wait_connectable(int fd, struct timeval *timeout)
+wait_connectable(VALUE self, VALUE timeout, const struct sockaddr *sockaddr, int len)
 {
-    int sockerr, revents;
+    int sockerr;
     socklen_t sockerrlen;
+    int fd = rb_io_descriptor(self);
 
     sockerrlen = (socklen_t)sizeof(sockerr);
     if (getsockopt(fd, SOL_SOCKET, SO_ERROR, (void *)&sockerr, &sockerrlen) < 0)
@@ -508,7 +511,15 @@ wait_connectable(int fd, struct timeval *timeout)
      *
      * Note: rb_wait_for_single_fd already retries on EINTR/ERESTART
      */
-    revents = rb_wait_for_single_fd(fd, RB_WAITFD_IN|RB_WAITFD_OUT, timeout);
+    VALUE result = rb_io_wait(self, RB_INT2NUM(RUBY_IO_READABLE|RUBY_IO_WRITABLE), timeout);
+
+    if (result == Qfalse) {
+        VALUE rai = rsock_addrinfo_new((struct sockaddr *)sockaddr, len, PF_UNSPEC, 0, 0, Qnil, Qnil);
+        VALUE addr_str = rsock_addrinfo_inspect_sockaddr(rai);
+        rb_raise(rb_eIOTimeoutError, "user specified timeout for %" PRIsVALUE, addr_str);
+    }
+
+    int revents = RB_NUM2INT(result);
 
     if (revents < 0)
         return -1;
@@ -523,12 +534,6 @@ wait_connectable(int fd, struct timeval *timeout)
          * be defensive in case some platforms set SO_ERROR on the original,
          * interrupted connect()
          */
-
-        /* when the connection timed out, no errno is set and revents is 0. */
-        if (timeout && revents == 0) {
-            errno = ETIMEDOUT;
-            return -1;
-        }
       case EINTR:
 #ifdef ERESTART
       case ERESTART:
@@ -576,19 +581,19 @@ socks_connect_blocking(void *data)
 #endif
 
 int
-rsock_connect(int fd, const struct sockaddr *sockaddr, int len, int socks, struct timeval *timeout)
+rsock_connect(VALUE self, const struct sockaddr *sockaddr, int len, int socks, VALUE timeout)
 {
-    int status;
+    int descriptor = rb_io_descriptor(self);
     rb_blocking_function_t *func = connect_blocking;
-    struct connect_arg arg;
+    struct connect_arg arg = {.fd = descriptor, .sockaddr = sockaddr, .len = len};
+
+    rb_io_t *fptr;
+    RB_IO_POINTER(self, fptr);
 
-    arg.fd = fd;
-    arg.sockaddr = sockaddr;
-    arg.len = len;
 #if defined(SOCKS) && !defined(SOCKS5)
     if (socks) func = socks_connect_blocking;
 #endif
-    status = (int)BLOCKING_REGION_FD(func, &arg);
+    int status = (int)rb_io_blocking_region(fptr, func, &arg);
 
     if (status < 0) {
         switch (errno) {
@@ -600,7 +605,7 @@ rsock_connect(int fd, const struct sockaddr *sockaddr, int len, int socks, struc
 #ifdef EINPROGRESS
           case EINPROGRESS:
 #endif
-            return wait_connectable(fd, timeout);
+            return wait_connectable(self, timeout, sockaddr, len);
         }
     }
     return status;
@@ -719,7 +724,7 @@ rsock_s_accept(VALUE klass, VALUE io, struct sockaddr *sockaddr, socklen_t *len)
 #ifdef RSOCK_WAIT_BEFORE_BLOCKING
     rb_io_wait(fptr->self, RB_INT2NUM(RUBY_IO_READABLE), Qnil);
 #endif
-    peer = (int)BLOCKING_REGION_FD(accept_blocking, &accept_arg);
+    peer = (int)rb_io_blocking_region(fptr, accept_blocking, &accept_arg);
     if (peer < 0) {
         int error = errno;
 
@@ -783,7 +788,17 @@ rsock_getfamily(rb_io_t *fptr)
  * call-seq:
  *   error_code     -> integer
  *
- * Returns the raw error code occurred at name resolution.
+ * Returns the raw error code indicating the cause of the hostname resolution failure.
+ *
+ *    begin
+ *      Addrinfo.getaddrinfo("ruby-lang.org", nil)
+ *    rescue Socket::ResolutionError => e
+ *      if e.error_code == Socket::EAI_AGAIN
+ *        puts "Temporary failure in name resolution."
+ *      end
+ *    end
+ *
+ * Note that error codes depend on the operating system.
  */
 static VALUE
 sock_resolv_error_code(VALUE self)
@@ -799,7 +814,7 @@ rsock_init_socket_init(void)
      */
     rb_eSocket = rb_define_class("SocketError", rb_eStandardError);
     /*
-     * ResolutionError is the error class for socket name resolution.
+     * Socket::ResolutionError is the error class for hostname resolution.
      */
     rb_eResolution = rb_define_class_under(rb_cSocket, "ResolutionError", rb_eSocket);
     rb_define_method(rb_eResolution, "error_code", sock_resolv_error_code, 0);
diff --git a/ext/socket/ipsocket.c b/ext/socket/ipsocket.c
index 0c13620258..e1943b8496 100644
--- a/ext/socket/ipsocket.c
+++ b/ext/socket/ipsocket.c
@@ -9,20 +9,39 @@
 ************************************************/
 
 #include "rubysocket.h"
+#include <stdio.h>
 
 struct inetsock_arg
 {
-    VALUE sock;
+    VALUE self;
+    VALUE io;
+
     struct {
         VALUE host, serv;
         struct rb_addrinfo *res;
     } remote, local;
     int type;
-    int fd;
     VALUE resolv_timeout;
     VALUE connect_timeout;
+    VALUE open_timeout;
 };
 
+void
+rsock_raise_user_specified_timeout(struct addrinfo *ai, VALUE host, VALUE port)
+{
+    VALUE message;
+
+    if (ai && ai->ai_addr) {
+        VALUE rai = rsock_addrinfo_new((struct sockaddr *)ai->ai_addr, (socklen_t)ai->ai_addrlen, PF_UNSPEC, 0, 0, Qnil, Qnil);
+        VALUE addr_str = rsock_addrinfo_inspect_sockaddr(rai);
+        message = rb_sprintf("user specified timeout for %" PRIsVALUE, addr_str);
+    } else {
+        message = rb_sprintf("user specified timeout for %" PRIsVALUE " port %" PRIsVALUE, host, port);
+    }
+
+    rb_exc_raise(rb_exc_new_str(rb_eIOTimeoutError, message));
+}
+
 static VALUE
 inetsock_cleanup(VALUE v)
 {
@@ -35,35 +54,42 @@ inetsock_cleanup(VALUE v)
         rb_freeaddrinfo(arg->local.res);
         arg->local.res = 0;
     }
-    if (arg->fd >= 0) {
-        close(arg->fd);
+    if (arg->io != Qnil) {
+        rb_io_close(arg->io);
+        arg->io = Qnil;
     }
     return Qnil;
 }
 
 static VALUE
+current_clocktime(void)
+{
+    VALUE clock_monotnic_const = rb_const_get(rb_mProcess, rb_intern("CLOCK_MONOTONIC"));
+    return rb_funcall(rb_mProcess, rb_intern("clock_gettime"), 1, clock_monotnic_const);
+}
+
+static VALUE
 init_inetsock_internal(VALUE v)
 {
     struct inetsock_arg *arg = (void *)v;
     int error = 0;
     int type = arg->type;
     struct addrinfo *res, *lres;
-    int fd, status = 0, local = 0;
+    int status = 0, local = 0;
     int family = AF_UNSPEC;
     const char *syscall = 0;
+    VALUE resolv_timeout = arg->resolv_timeout;
     VALUE connect_timeout = arg->connect_timeout;
-    struct timeval tv_storage;
-    struct timeval *tv = NULL;
+    VALUE open_timeout = arg->open_timeout;
+    VALUE timeout;
+    VALUE starts_at;
 
-    if (!NIL_P(connect_timeout)) {
-        tv_storage = rb_time_interval(connect_timeout);
-        tv = &tv_storage;
-    }
+    timeout = NIL_P(open_timeout) ? resolv_timeout : open_timeout;
+    starts_at = current_clocktime();
 
     arg->remote.res = rsock_addrinfo(arg->remote.host, arg->remote.serv,
                                      family, SOCK_STREAM,
-                                     (type == INET_SERVER) ? AI_PASSIVE : 0);
-
+                                     (type == INET_SERVER) ? AI_PASSIVE : 0, timeout);
 
     /*
      * Maybe also accept a local address
@@ -71,10 +97,11 @@ init_inetsock_internal(VALUE v)
 
     if (type != INET_SERVER && (!NIL_P(arg->local.host) || !NIL_P(arg->local.serv))) {
         arg->local.res = rsock_addrinfo(arg->local.host, arg->local.serv,
-                                        family, SOCK_STREAM, 0);
+                                        family, SOCK_STREAM, 0, timeout);
     }
 
-    arg->fd = fd = -1;
+    VALUE io = Qnil;
+
     for (res = arg->remote.res->ai; res; res = res->ai_next) {
 #if !defined(INET6) && defined(AF_INET6)
         if (res->ai_family == AF_INET6)
@@ -96,12 +123,14 @@ init_inetsock_internal(VALUE v)
         }
         status = rsock_socket(res->ai_family,res->ai_socktype,res->ai_protocol);
         syscall = "socket(2)";
-        fd = status;
-        if (fd < 0) {
+        if (status < 0) {
             error = errno;
             continue;
         }
-        arg->fd = fd;
+
+        int fd = status;
+        io = arg->io = rsock_init_sock(arg->self, fd);
+
         if (type == INET_SERVER) {
 #if !defined(_WIN32) && !defined(__CYGWIN__)
             status = 1;
@@ -123,21 +152,33 @@ init_inetsock_internal(VALUE v)
                 syscall = "bind(2)";
             }
 
+            if (NIL_P(open_timeout)) {
+                timeout = connect_timeout;
+            } else {
+                VALUE elapsed = rb_funcall(current_clocktime(), '-', 1, starts_at);
+                timeout = rb_funcall(open_timeout, '-', 1, elapsed);
+                if (rb_funcall(timeout, '<', 1, INT2FIX(0)) == Qtrue) {
+                    rsock_raise_user_specified_timeout(res, arg->remote.host, arg->remote.serv);
+                }
+            }
+
             if (status >= 0) {
-                status = rsock_connect(fd, res->ai_addr, res->ai_addrlen,
-                                       (type == INET_SOCKS), tv);
+                status = rsock_connect(io, res->ai_addr, res->ai_addrlen, (type == INET_SOCKS), timeout);
                 syscall = "connect(2)";
             }
         }
 
         if (status < 0) {
             error = errno;
-            close(fd);
-            arg->fd = fd = -1;
+            arg->io = Qnil;
+            rb_io_close(io);
+            io = Qnil;
             continue;
-        } else
+        } else {
             break;
+        }
     }
+
     if (status < 0) {
         VALUE host, port;
 
@@ -152,28 +193,38 @@ init_inetsock_internal(VALUE v)
         rsock_syserr_fail_host_port(error, syscall, host, port);
     }
 
-    arg->fd = -1;
+    // Don't close the socket in `inetsock_cleanup` if we are returning it:
+    arg->io = Qnil;
 
-    if (type == INET_SERVER) {
-        status = listen(fd, SOMAXCONN);
+    if (type == INET_SERVER && io != Qnil) {
+        status = listen(rb_io_descriptor(io), SOMAXCONN);
         if (status < 0) {
             error = errno;
-            close(fd);
+            rb_io_close(io);
             rb_syserr_fail(error, "listen(2)");
         }
     }
 
     /* create new instance */
-    return rsock_init_sock(arg->sock, fd);
+    return io;
 }
 
+#if FAST_FALLBACK_INIT_INETSOCK_IMPL == 0
+
 VALUE
-rsock_init_inetsock(VALUE sock, VALUE remote_host, VALUE remote_serv,
-                    VALUE local_host, VALUE local_serv, int type,
-                    VALUE resolv_timeout, VALUE connect_timeout)
+rsock_init_inetsock(
+    VALUE self, VALUE remote_host, VALUE remote_serv,
+    VALUE local_host, VALUE local_serv, int type,
+    VALUE resolv_timeout, VALUE connect_timeout, VALUE open_timeout,
+    VALUE _fast_fallback, VALUE _test_mode_settings)
 {
+    if (!NIL_P(open_timeout) && (!NIL_P(resolv_timeout) || !NIL_P(connect_timeout))) {
+        rb_raise(rb_eArgError, "Cannot specify open_timeout along with connect_timeout or resolv_timeout");
+    }
+
     struct inetsock_arg arg;
-    arg.sock = sock;
+    arg.self = self;
+    arg.io = Qnil;
     arg.remote.host = remote_host;
     arg.remote.serv = remote_serv;
     arg.remote.res = 0;
@@ -181,13 +232,1205 @@ rsock_init_inetsock(VALUE sock, VALUE remote_host, VALUE remote_serv,
     arg.local.serv = local_serv;
     arg.local.res = 0;
     arg.type = type;
-    arg.fd = -1;
     arg.resolv_timeout = resolv_timeout;
     arg.connect_timeout = connect_timeout;
+    arg.open_timeout = open_timeout;
     return rb_ensure(init_inetsock_internal, (VALUE)&arg,
                      inetsock_cleanup, (VALUE)&arg);
 }
 
+#elif FAST_FALLBACK_INIT_INETSOCK_IMPL == 1
+
+#define IPV6_ENTRY_POS 0
+#define IPV4_ENTRY_POS 1
+#define RESOLUTION_ERROR 0
+#define SYSCALL_ERROR 1
+
+static int
+is_specified_ip_address(const char *hostname)
+{
+    if (!hostname) return false;
+
+    struct in_addr ipv4addr;
+    struct in6_addr ipv6addr;
+
+    return (inet_pton(AF_INET6, hostname, &ipv6addr) == 1 ||
+            inet_pton(AF_INET, hostname, &ipv4addr) == 1);
+}
+
+static int
+is_local_port_fixed(const char *portp)
+{
+    if (!portp) return 0;
+
+    char *endp;
+    errno = 0;
+    long port = strtol(portp, &endp, 10);
+
+    if (endp == portp) return 0;
+    if (errno == ERANGE) return 0;
+
+    return port > 0;
+}
+
+struct fast_fallback_inetsock_arg
+{
+    VALUE self;
+    VALUE io;
+
+    struct {
+        VALUE host, serv;
+        struct rb_addrinfo *res;
+    } remote, local;
+    int type;
+    VALUE resolv_timeout;
+    VALUE connect_timeout;
+    VALUE open_timeout;
+
+    const char *hostp, *portp;
+    int *families;
+    int family_size;
+    int additional_flags;
+    struct fast_fallback_getaddrinfo_entry *getaddrinfo_entries[2];
+    struct fast_fallback_getaddrinfo_shared *getaddrinfo_shared;
+    rb_fdset_t readfds, writefds;
+    int wait;
+    int connection_attempt_fds_size;
+    int *connection_attempt_fds;
+    VALUE test_mode_settings;
+};
+
+static struct fast_fallback_getaddrinfo_shared *
+allocate_fast_fallback_getaddrinfo_shared(int family_size)
+{
+    struct fast_fallback_getaddrinfo_shared *shared;
+
+    shared = (struct fast_fallback_getaddrinfo_shared *)calloc(
+        1,
+        sizeof(struct fast_fallback_getaddrinfo_shared) + (family_size == 1 ? 0 : 2) * sizeof(struct fast_fallback_getaddrinfo_entry)
+    );
+
+    return shared;
+}
+
+static void
+allocate_fast_fallback_getaddrinfo_hints(struct addrinfo *hints, int family, int remote_addrinfo_hints, int additional_flags)
+{
+    MEMZERO(hints, struct addrinfo, 1);
+    hints->ai_family = family;
+    hints->ai_socktype = SOCK_STREAM;
+    hints->ai_protocol = IPPROTO_TCP;
+    hints->ai_flags = remote_addrinfo_hints;
+    hints->ai_flags |= additional_flags;
+}
+
+static int*
+allocate_connection_attempt_fds(int additional_capacity)
+{
+    int *fds = (int *)malloc(additional_capacity * sizeof(int));
+    if (!fds) rb_syserr_fail(errno, "malloc(3)");
+    for (int i = 0; i < additional_capacity; i++) fds[i] = -1;
+    return fds;
+}
+
+static int
+reallocate_connection_attempt_fds(int **fds, int current_capacity, int additional_capacity)
+{
+    int new_capacity = current_capacity + additional_capacity;
+    int *new_fds;
+
+    new_fds = realloc(*fds, new_capacity * sizeof(int));
+    if (new_fds == NULL) {
+        rb_syserr_fail(errno, "realloc(3)");
+    }
+    *fds = new_fds;
+
+    for (int i = current_capacity; i < new_capacity; i++) (*fds)[i] = -1;
+    return new_capacity;
+}
+
+struct hostname_resolution_result
+{
+    struct addrinfo *ai;
+    int finished;
+    int has_error;
+};
+
+struct hostname_resolution_store
+{
+    struct hostname_resolution_result v6;
+    struct hostname_resolution_result v4;
+    int is_all_finished;
+};
+
+static int
+any_addrinfos(struct hostname_resolution_store *resolution_store)
+{
+    return resolution_store->v6.ai || resolution_store->v4.ai;
+}
+
+static struct timespec
+current_clocktime_ts(void)
+{
+    struct timespec ts;
+    if ((clock_gettime(CLOCK_MONOTONIC, &ts)) < 0) {
+        rb_syserr_fail(errno, "clock_gettime(2)");
+    }
+    return ts;
+}
+
+static void
+set_timeout_tv(struct timeval *tv, long ms, struct timespec from)
+{
+    long sec = ms / 1000;
+    long nsec = (ms % 1000) * 1000000;
+    long result_sec = from.tv_sec + sec;
+    long result_nsec = from.tv_nsec + nsec;
+
+    result_sec += result_nsec / 1000000000;
+    result_nsec = result_nsec % 1000000000;
+
+    tv->tv_sec = result_sec;
+    tv->tv_usec = (int)(result_nsec / 1000);
+}
+
+static struct timeval
+add_ts_to_tv(struct timeval tv, struct timespec ts)
+{
+    long ts_usec = ts.tv_nsec / 1000;
+    tv.tv_sec += ts.tv_sec;
+    tv.tv_usec += ts_usec;
+
+    if (tv.tv_usec >= 1000000) {
+        tv.tv_sec += tv.tv_usec / 1000000;
+        tv.tv_usec = tv.tv_usec % 1000000;
+    }
+
+    return tv;
+}
+
+static VALUE
+tv_to_seconds(struct timeval *timeout) {
+    if (timeout == NULL) return Qnil;
+
+    double seconds = (double)timeout->tv_sec + (double)timeout->tv_usec / 1000000.0;
+
+    return DBL2NUM(seconds);
+}
+
+static int
+is_infinity(struct timeval tv)
+{
+    // { -1, -1 } as infinity
+    return tv.tv_sec == -1 || tv.tv_usec == -1;
+}
+
+static int
+is_timeout_tv(struct timeval *timeout_tv, struct timespec now) {
+    if (!timeout_tv) return false;
+    if (timeout_tv->tv_sec == -1 && timeout_tv->tv_usec == -1) return false;
+
+    struct timespec ts;
+    ts.tv_sec = timeout_tv->tv_sec;
+    ts.tv_nsec = timeout_tv->tv_usec * 1000;
+
+    if (now.tv_sec > ts.tv_sec) return true;
+    if (now.tv_sec == ts.tv_sec && now.tv_nsec >= ts.tv_nsec) return true;
+    return false;
+}
+
+static struct timeval *
+select_expires_at(
+    struct hostname_resolution_store *resolution_store,
+    struct timeval *resolution_delay,
+    struct timeval *connection_attempt_delay,
+    struct timeval *user_specified_resolv_timeout_at,
+    struct timeval *user_specified_connect_timeout_at,
+    struct timeval *user_specified_open_timeout_at)
+{
+    if (any_addrinfos(resolution_store)) {
+        struct timeval *delay;
+        delay = resolution_delay ? resolution_delay : connection_attempt_delay;
+
+        if (user_specified_open_timeout_at &&
+            timercmp(user_specified_open_timeout_at, delay, <)) {
+            return user_specified_open_timeout_at;
+        }
+        return delay;
+    }
+
+    if (user_specified_open_timeout_at) return user_specified_open_timeout_at;
+
+    struct timeval *timeout = NULL;
+
+    if (user_specified_resolv_timeout_at) {
+        if (is_infinity(*user_specified_resolv_timeout_at)) return NULL;
+        timeout = user_specified_resolv_timeout_at;
+    }
+
+    if (user_specified_connect_timeout_at) {
+        if (is_infinity(*user_specified_connect_timeout_at)) return NULL;
+        if (!timeout || timercmp(user_specified_connect_timeout_at, timeout, >)) {
+            return user_specified_connect_timeout_at;
+        }
+    }
+
+    return timeout;
+}
+
+static struct timeval
+tv_to_timeout(struct timeval *ends_at, struct timespec now)
+{
+    struct timeval delay;
+    struct timespec expires_at;
+    expires_at.tv_sec = ends_at->tv_sec;
+    expires_at.tv_nsec = ends_at->tv_usec * 1000;
+
+    struct timespec diff;
+    diff.tv_sec = expires_at.tv_sec - now.tv_sec;
+
+    if (expires_at.tv_nsec >= now.tv_nsec) {
+        diff.tv_nsec = expires_at.tv_nsec - now.tv_nsec;
+    } else {
+        diff.tv_sec -= 1;
+        diff.tv_nsec = (1000000000 + expires_at.tv_nsec) - now.tv_nsec;
+    }
+
+    delay.tv_sec = diff.tv_sec;
+    delay.tv_usec = (int)diff.tv_nsec / 1000;
+
+    return delay;
+}
+
+static struct addrinfo *
+pick_addrinfo(struct hostname_resolution_store *resolution_store, int last_family)
+{
+    int priority_on_v6[2] = { AF_INET6, AF_INET };
+    int priority_on_v4[2] = { AF_INET, AF_INET6 };
+    int *precedences = last_family == AF_INET6 ? priority_on_v4 : priority_on_v6;
+    struct addrinfo *selected_ai = NULL;
+
+    for (int i = 0; i < 2; i++) {
+        if (precedences[i] == AF_INET6) {
+            selected_ai = resolution_store->v6.ai;
+            if (selected_ai) {
+                resolution_store->v6.ai = selected_ai->ai_next;
+                break;
+            }
+        } else {
+            selected_ai = resolution_store->v4.ai;
+            if (selected_ai) {
+                resolution_store->v4.ai = selected_ai->ai_next;
+                break;
+            }
+        }
+    }
+    return selected_ai;
+}
+
+static void
+socket_nonblock_set(int fd)
+{
+    int flags = fcntl(fd, F_GETFL);
+
+    if (flags < 0) rb_syserr_fail(errno, "fcntl(2)");
+    if ((flags & O_NONBLOCK) != 0) return;
+
+    flags |= O_NONBLOCK;
+
+    if (fcntl(fd, F_SETFL, flags) < 0) rb_syserr_fail(errno, "fcntl(2)");
+    return;
+}
+
+static int
+in_progress_fds(int fds_size)
+{
+    return fds_size > 0;
+}
+
+static void
+remove_connection_attempt_fd(int *fds, int *fds_size, int removing_fd)
+{
+    int i, j;
+
+    for (i = 0; i < *fds_size; i++) {
+        if (fds[i] != removing_fd) continue;
+
+        for (j = i; j < *fds_size - 1; j++) {
+            fds[j] = fds[j + 1];
+        }
+
+        (*fds_size)--;
+        fds[*fds_size] = -1;
+        break;
+    }
+}
+
+struct fast_fallback_error
+{
+    int type;
+    int ecode;
+};
+
+static VALUE
+init_fast_fallback_inetsock_internal(VALUE v)
+{
+    struct fast_fallback_inetsock_arg *arg = (void *)v;
+    VALUE io = arg->io;
+    VALUE resolv_timeout = arg->resolv_timeout;
+    VALUE connect_timeout = arg->connect_timeout;
+    VALUE open_timeout = arg->open_timeout;
+    VALUE test_mode_settings = arg->test_mode_settings;
+    struct addrinfo *remote_ai = NULL, *local_ai = NULL;
+    int connected_fd = -1, status = 0, local_status = 0;
+    int remote_addrinfo_hints = 0;
+    struct fast_fallback_error last_error = { 0, 0 };
+    const char *syscall = 0;
+    VALUE host, serv;
+
+    #ifdef HAVE_CONST_AI_ADDRCONFIG
+    remote_addrinfo_hints |= AI_ADDRCONFIG;
+    #endif
+
+    pthread_t threads[arg->family_size];
+    char resolved_type[2];
+    ssize_t resolved_type_size;
+    int hostname_resolution_waiter = -1, hostname_resolution_notifier = -1;
+    int pipefd[2];
+
+    int nfds = 0;
+    struct timeval *ends_at = NULL;
+    struct timeval delay = (struct timeval){ -1, -1 };
+    struct timeval *delay_p = NULL;
+
+    struct hostname_resolution_store resolution_store;
+    resolution_store.is_all_finished = false;
+    resolution_store.v6.ai = NULL;
+    resolution_store.v6.finished = false;
+    resolution_store.v6.has_error = false;
+    resolution_store.v4.ai = NULL;
+    resolution_store.v4.finished = false;
+    resolution_store.v4.has_error = false;
+
+    int last_family = 0;
+    int additional_capacity = 10;
+    int current_capacity = additional_capacity;
+    arg->connection_attempt_fds = allocate_connection_attempt_fds(additional_capacity);
+    arg->connection_attempt_fds_size = 0;
+
+    struct timeval resolution_delay_storage;
+    struct timeval *resolution_delay_expires_at = NULL;
+    struct timeval connection_attempt_delay_strage;
+    struct timeval *connection_attempt_delay_expires_at = NULL;
+    struct timeval user_specified_resolv_timeout_storage;
+    struct timeval *user_specified_resolv_timeout_at = NULL;
+    struct timeval user_specified_connect_timeout_storage;
+    struct timeval *user_specified_connect_timeout_at = NULL;
+    struct timeval user_specified_open_timeout_storage;
+    struct timeval *user_specified_open_timeout_at = NULL;
+    struct timespec now = current_clocktime_ts();
+    VALUE starts_at = current_clocktime();
+
+    if (!NIL_P(open_timeout)) {
+        struct timeval open_timeout_tv = rb_time_interval(open_timeout);
+        user_specified_open_timeout_storage = add_ts_to_tv(open_timeout_tv, now);
+        user_specified_open_timeout_at = &user_specified_open_timeout_storage;
+    }
+
+    /* start of hostname resolution */
+    if (arg->family_size == 1) {
+        arg->wait = -1;
+        arg->getaddrinfo_shared = NULL;
+
+        int family = arg->families[0];
+        VALUE t = NIL_P(open_timeout) ? resolv_timeout : open_timeout;
+
+        arg->remote.res = rsock_addrinfo(
+            arg->remote.host,
+            arg->remote.serv,
+            family,
+            SOCK_STREAM,
+            0,
+            t
+        );
+
+        if (family == AF_INET6) {
+            resolution_store.v6.ai = arg->remote.res->ai;
+            resolution_store.v6.finished = true;
+            resolution_store.v4.finished = true;
+        } else if (family == AF_INET) {
+            resolution_store.v4.ai = arg->remote.res->ai;
+            resolution_store.v4.finished = true;
+            resolution_store.v6.finished = true;
+        }
+        resolution_store.is_all_finished = true;
+    } else {
+        if (pipe(pipefd) != 0) rb_syserr_fail(errno, "pipe(2)");
+        hostname_resolution_waiter = pipefd[0];
+        int waiter_flags = fcntl(hostname_resolution_waiter, F_GETFL, 0);
+        if (waiter_flags < 0) rb_syserr_fail(errno, "fcntl(2)");
+        if ((fcntl(hostname_resolution_waiter, F_SETFL, waiter_flags | O_NONBLOCK)) < 0) {
+            rb_syserr_fail(errno, "fcntl(2)");
+        }
+        arg->wait = hostname_resolution_waiter;
+        hostname_resolution_notifier = pipefd[1];
+
+        arg->getaddrinfo_shared = allocate_fast_fallback_getaddrinfo_shared(arg->family_size);
+        if (!arg->getaddrinfo_shared) rb_syserr_fail(errno, "calloc(3)");
+
+        rb_nativethread_lock_initialize(&arg->getaddrinfo_shared->lock);
+        arg->getaddrinfo_shared->notify = hostname_resolution_notifier;
+
+        arg->getaddrinfo_shared->node = arg->hostp ? ruby_strdup(arg->hostp) : NULL;
+        arg->getaddrinfo_shared->service = arg->portp ? ruby_strdup(arg->portp) : NULL;
+        arg->getaddrinfo_shared->refcount = arg->family_size + 1;
+
+        for (int i = 0; i < arg->family_size; i++) {
+            arg->getaddrinfo_entries[i] = &arg->getaddrinfo_shared->getaddrinfo_entries[i];
+            arg->getaddrinfo_entries[i]->shared = arg->getaddrinfo_shared;
+
+            struct addrinfo getaddrinfo_hints[arg->family_size];
+
+            allocate_fast_fallback_getaddrinfo_hints(
+                &getaddrinfo_hints[i],
+                arg->families[i],
+                remote_addrinfo_hints,
+                arg->additional_flags
+            );
+
+            arg->getaddrinfo_entries[i]->hints = getaddrinfo_hints[i];
+            arg->getaddrinfo_entries[i]->ai = NULL;
+            arg->getaddrinfo_entries[i]->family = arg->families[i];
+            arg->getaddrinfo_entries[i]->refcount = 2;
+            arg->getaddrinfo_entries[i]->has_syserr = false;
+            arg->getaddrinfo_entries[i]->test_sleep_ms = 0;
+            arg->getaddrinfo_entries[i]->test_ecode = 0;
+
+            /* for testing HEv2 */
+            if (!NIL_P(test_mode_settings) && RB_TYPE_P(test_mode_settings, T_HASH)) {
+                const char *family_sym = arg->families[i] == AF_INET6 ? "ipv6" : "ipv4";
+
+                VALUE test_delay_setting = rb_hash_aref(test_mode_settings, ID2SYM(rb_intern("delay")));
+                if (!NIL_P(test_delay_setting)) {
+                    VALUE rb_test_delay_ms = rb_hash_aref(test_delay_setting, ID2SYM(rb_intern(family_sym)));
+                    long test_delay_ms = NIL_P(rb_test_delay_ms) ? 0 : rb_test_delay_ms;
+                    arg->getaddrinfo_entries[i]->test_sleep_ms = test_delay_ms;
+                }
+
+                VALUE test_error_setting = rb_hash_aref(test_mode_settings, ID2SYM(rb_intern("error")));
+                if (!NIL_P(test_error_setting)) {
+                    VALUE rb_test_ecode = rb_hash_aref(test_error_setting, ID2SYM(rb_intern(family_sym)));
+                    if (!NIL_P(rb_test_ecode)) {
+                        arg->getaddrinfo_entries[i]->test_ecode = NUM2INT(rb_test_ecode);
+                    }
+                }
+            }
+
+            if (raddrinfo_pthread_create(&threads[i], fork_safe_do_fast_fallback_getaddrinfo, arg->getaddrinfo_entries[i]) != 0) {
+                rsock_raise_resolution_error("getaddrinfo(3)", EAI_AGAIN);
+            }
+        }
+
+        if (NIL_P(resolv_timeout)) {
+            user_specified_resolv_timeout_storage = (struct timeval){ -1, -1 };
+        } else {
+            struct timeval resolv_timeout_tv = rb_time_interval(resolv_timeout);
+            user_specified_resolv_timeout_storage = add_ts_to_tv(resolv_timeout_tv, now);
+        }
+        user_specified_resolv_timeout_at = &user_specified_resolv_timeout_storage;
+    }
+
+    while (true) {
+        /* start of connection */
+        if (any_addrinfos(&resolution_store) &&
+            !resolution_delay_expires_at &&
+            !connection_attempt_delay_expires_at) {
+            while ((remote_ai = pick_addrinfo(&resolution_store, last_family))) {
+                int fd = -1;
+
+                #if !defined(INET6) && defined(AF_INET6)
+                if (remote_ai->ai_family == AF_INET6) {
+                    if (any_addrinfos(&resolution_store)) continue;
+                    if (!in_progress_fds(arg->connection_attempt_fds_size)) break;
+                    if (resolution_store.is_all_finished) break;
+
+                    if (local_status < 0) {
+                        host = arg->local.host;
+                        serv = arg->local.serv;
+                    } else {
+                        host = arg->remote.host;
+                        serv = arg->remote.serv;
+                    }
+                    if (last_error.type == RESOLUTION_ERROR) {
+                        rsock_raise_resolution_error(syscall, last_error.ecode);
+                    } else {
+                        rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                    }
+                }
+                #endif
+
+                local_ai = NULL;
+
+                if (arg->local.res) {
+                    for (local_ai = arg->local.res->ai; local_ai; local_ai = local_ai->ai_next) {
+                        if (local_ai->ai_family == remote_ai->ai_family) break;
+                    }
+                    if (!local_ai) {
+                        if (any_addrinfos(&resolution_store)) continue;
+                        if (in_progress_fds(arg->connection_attempt_fds_size)) break;
+                        if (!resolution_store.is_all_finished) break;
+
+                        /* Use a different family local address if no choice, this
+                         * will cause EAFNOSUPPORT. */
+                        rsock_syserr_fail_host_port(EAFNOSUPPORT, syscall, arg->local.host, arg->local.serv);
+                    }
+                }
+
+                status = rsock_socket(remote_ai->ai_family, remote_ai->ai_socktype, remote_ai->ai_protocol);
+                syscall = "socket(2)";
+
+                if (status < 0) {
+                    last_error.type = SYSCALL_ERROR;
+                    last_error.ecode = errno;
+
+                    if (any_addrinfos(&resolution_store)) continue;
+                    if (in_progress_fds(arg->connection_attempt_fds_size)) break;
+                    if (!resolution_store.is_all_finished) break;
+
+                    if (local_status < 0) {
+                        host = arg->local.host;
+                        serv = arg->local.serv;
+                    } else {
+                        host = arg->remote.host;
+                        serv = arg->remote.serv;
+                    }
+                    if (last_error.type == RESOLUTION_ERROR) {
+                        rsock_raise_resolution_error(syscall, last_error.ecode);
+                    } else {
+                        rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                    }
+                }
+
+                fd = status;
+
+                if (local_ai) {
+                    #if !defined(_WIN32) && !defined(__CYGWIN__)
+                    status = 1;
+                    if ((setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (char*)&status, (socklen_t)sizeof(status))) < 0) {
+                        rb_syserr_fail(errno, "setsockopt(2)");
+                    }
+                    #endif
+                    status = bind(fd, local_ai->ai_addr, local_ai->ai_addrlen);
+                    local_status = status;
+                    syscall = "bind(2)";
+
+                    if (status < 0) {
+                        last_error.type = SYSCALL_ERROR;
+                        last_error.ecode = errno;
+                        close(fd);
+
+                        if (any_addrinfos(&resolution_store)) continue;
+                        if (in_progress_fds(arg->connection_attempt_fds_size)) break;
+                        if (!resolution_store.is_all_finished) break;
+
+                        if (local_status < 0) {
+                            host = arg->local.host;
+                            serv = arg->local.serv;
+                        } else {
+                            host = arg->remote.host;
+                            serv = arg->remote.serv;
+                        }
+                        if (last_error.type == RESOLUTION_ERROR) {
+                            rsock_raise_resolution_error(syscall, last_error.ecode);
+                        } else {
+                            rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                        }
+                    }
+                }
+
+                syscall = "connect(2)";
+
+                if (any_addrinfos(&resolution_store) ||
+                    in_progress_fds(arg->connection_attempt_fds_size) ||
+                    !resolution_store.is_all_finished) {
+                    socket_nonblock_set(fd);
+                    status = connect(fd, remote_ai->ai_addr, remote_ai->ai_addrlen);
+                    last_family = remote_ai->ai_family;
+                } else {
+                    VALUE timeout = Qnil;
+
+                    if (!NIL_P(open_timeout)) {
+                        VALUE elapsed = rb_funcall(current_clocktime(), '-', 1, starts_at);
+                        timeout = rb_funcall(open_timeout, '-', 1, elapsed);
+
+                        if (rb_funcall(timeout, '<', 1, INT2FIX(0)) == Qtrue) {
+                            rsock_raise_user_specified_timeout(NULL, arg->remote.host, arg->remote.serv);
+                        }
+                    }
+                    if (NIL_P(timeout)) {
+                        if (!NIL_P(connect_timeout)) {
+                            user_specified_connect_timeout_storage = rb_time_interval(connect_timeout);
+                            user_specified_connect_timeout_at = &user_specified_connect_timeout_storage;
+                        }
+                        timeout =
+                          (user_specified_connect_timeout_at && is_infinity(*user_specified_connect_timeout_at)) ?
+                          Qnil : tv_to_seconds(user_specified_connect_timeout_at);
+                    }
+
+                    io = arg->io = rsock_init_sock(arg->self, fd);
+                    status = rsock_connect(io, remote_ai->ai_addr, remote_ai->ai_addrlen, 0, timeout);
+                }
+
+                if (status == 0) {
+                    connected_fd = fd;
+                    break;
+                }
+
+                if (errno == EINPROGRESS) {
+                    if (current_capacity == arg->connection_attempt_fds_size) {
+                        current_capacity = reallocate_connection_attempt_fds(
+                            &arg->connection_attempt_fds,
+                            current_capacity,
+                            additional_capacity
+                        );
+                    }
+                    arg->connection_attempt_fds[arg->connection_attempt_fds_size] = fd;
+                    (arg->connection_attempt_fds_size)++;
+
+                    set_timeout_tv(&connection_attempt_delay_strage, 250, now);
+                    connection_attempt_delay_expires_at = &connection_attempt_delay_strage;
+
+                    if (!any_addrinfos(&resolution_store)) {
+                        if (NIL_P(connect_timeout)) {
+                            user_specified_connect_timeout_storage = (struct timeval){ -1, -1 };
+                        } else {
+                            struct timeval connect_timeout_tv = rb_time_interval(connect_timeout);
+                            user_specified_connect_timeout_storage = add_ts_to_tv(connect_timeout_tv, now);
+                        }
+                        user_specified_connect_timeout_at = &user_specified_connect_timeout_storage;
+                    }
+
+                    break;
+                }
+
+                last_error.type = SYSCALL_ERROR;
+                last_error.ecode = errno;
+
+                if (NIL_P(io)) {
+                    close(fd);
+                } else {
+                    rb_io_close(io);
+                }
+
+                if (any_addrinfos(&resolution_store)) continue;
+                if (in_progress_fds(arg->connection_attempt_fds_size)) break;
+                if (!resolution_store.is_all_finished) break;
+
+                if (local_status < 0) {
+                    host = arg->local.host;
+                    serv = arg->local.serv;
+                } else {
+                    host = arg->remote.host;
+                    serv = arg->remote.serv;
+                }
+                if (last_error.type == RESOLUTION_ERROR) {
+                    rsock_raise_resolution_error(syscall, last_error.ecode);
+                } else {
+                    rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                }
+            }
+        }
+
+        if (connected_fd >= 0) break;
+
+        ends_at = select_expires_at(
+            &resolution_store,
+            resolution_delay_expires_at,
+            connection_attempt_delay_expires_at,
+            user_specified_resolv_timeout_at,
+            user_specified_connect_timeout_at,
+            user_specified_open_timeout_at
+        );
+        if (ends_at) {
+            delay = tv_to_timeout(ends_at, now);
+            delay_p = &delay;
+        } else {
+            if (((resolution_store.v6.finished && !resolution_store.v4.finished) ||
+                (resolution_store.v4.finished && !resolution_store.v6.finished)) &&
+                !any_addrinfos(&resolution_store) &&
+                !in_progress_fds(arg->connection_attempt_fds_size)) {
+                /* A limited timeout is introduced to prevent select(2) from hanging when it is exclusively
+                 * waiting for name resolution and write(2) failure occurs in a child thread. */
+                delay.tv_sec = 0;
+                delay.tv_usec = 50000;
+                delay_p = &delay;
+            } else {
+                delay_p = NULL;
+            }
+        }
+
+        nfds = 0;
+        rb_fd_zero(&arg->writefds);
+        if (in_progress_fds(arg->connection_attempt_fds_size)) {
+            int n = 0;
+            for (int i = 0; i < arg->connection_attempt_fds_size; i++) {
+                int cfd = arg->connection_attempt_fds[i];
+                if (cfd < 0) continue;
+                if (cfd > n) n = cfd;
+                rb_fd_set(cfd, &arg->writefds);
+            }
+            if (n > 0) n++;
+            nfds = n;
+        }
+
+        rb_fd_zero(&arg->readfds);
+        if (arg->family_size > 1) {
+            rb_fd_set(hostname_resolution_waiter, &arg->readfds);
+
+            if ((hostname_resolution_waiter + 1) > nfds) {
+                nfds = hostname_resolution_waiter + 1;
+            }
+        }
+
+        status = rb_thread_fd_select(nfds, &arg->readfds, &arg->writefds, NULL, delay_p);
+
+        now = current_clocktime_ts();
+        if (is_timeout_tv(resolution_delay_expires_at, now)) {
+            resolution_delay_expires_at = NULL;
+        }
+        if (is_timeout_tv(connection_attempt_delay_expires_at, now)) {
+            connection_attempt_delay_expires_at = NULL;
+        }
+
+        if (status < 0 && (errno && errno != EINTR)) rb_syserr_fail(errno, "select(2)");
+
+        if (status > 0) {
+            /* check for connection */
+            if (in_progress_fds(arg->connection_attempt_fds_size)) {
+                for (int i = 0; i < arg->connection_attempt_fds_size; i++) {
+                    int fd = arg->connection_attempt_fds[i];
+                    if (fd < 0 || !rb_fd_isset(fd, &arg->writefds)) continue;
+
+                    int err;
+                    socklen_t len = sizeof(err);
+
+                    status = getsockopt(fd, SOL_SOCKET, SO_ERROR, &err, &len);
+
+                    if (status < 0) {
+                        last_error.type = SYSCALL_ERROR;
+                        last_error.ecode = errno;
+                        close(fd);
+
+                        if (any_addrinfos(&resolution_store)) continue;
+                        if (in_progress_fds(arg->connection_attempt_fds_size)) break;
+                        if (!resolution_store.is_all_finished) break;
+
+                        if (local_status < 0) {
+                            host = arg->local.host;
+                            serv = arg->local.serv;
+                        } else {
+                            host = arg->remote.host;
+                            serv = arg->remote.serv;
+                        }
+                        if (last_error.type == RESOLUTION_ERROR) {
+                            rsock_raise_resolution_error(syscall, last_error.ecode);
+                        } else {
+                            rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                        }
+                    }
+
+                    if (err == 0) { /* success */
+                        remove_connection_attempt_fd(
+                            arg->connection_attempt_fds,
+                            &arg->connection_attempt_fds_size,
+                            fd
+                        );
+                        connected_fd = fd;
+                        break;
+                    } else { /* fail */
+                        close(fd);
+                        remove_connection_attempt_fd(
+                            arg->connection_attempt_fds,
+                            &arg->connection_attempt_fds_size,
+                            fd
+                        );
+                        last_error.type = SYSCALL_ERROR;
+                        last_error.ecode = err;
+                    }
+                }
+
+                if (connected_fd >= 0) break;
+
+                if (!in_progress_fds(arg->connection_attempt_fds_size)) {
+                    if (!any_addrinfos(&resolution_store) && resolution_store.is_all_finished) {
+                        if (local_status < 0) {
+                            host = arg->local.host;
+                            serv = arg->local.serv;
+                        } else {
+                            host = arg->remote.host;
+                            serv = arg->remote.serv;
+                        }
+                        if (last_error.type == RESOLUTION_ERROR) {
+                            rsock_raise_resolution_error(syscall, last_error.ecode);
+                        } else {
+                            rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                        }
+                    }
+                    connection_attempt_delay_expires_at = NULL;
+                    user_specified_connect_timeout_at = NULL;
+                }
+            }
+
+            /* check for hostname resolution */
+            if (!resolution_store.is_all_finished && rb_fd_isset(hostname_resolution_waiter, &arg->readfds)) {
+                while (true) {
+                    resolved_type_size = read(
+                        hostname_resolution_waiter,
+                        resolved_type,
+                        sizeof(resolved_type) - 1
+                    );
+
+                    if (resolved_type_size > 0) {
+                        resolved_type[resolved_type_size] = '\0';
+
+                        if (resolved_type[0] == IPV6_HOSTNAME_RESOLVED) {
+                            resolution_store.v6.finished = true;
+
+                            if (arg->getaddrinfo_entries[IPV6_ENTRY_POS]->err &&
+                                arg->getaddrinfo_entries[IPV6_ENTRY_POS]->err != EAI_ADDRFAMILY) {
+                                if (!resolution_store.v4.finished || resolution_store.v4.has_error) {
+                                    last_error.type = RESOLUTION_ERROR;
+                                    last_error.ecode = arg->getaddrinfo_entries[IPV6_ENTRY_POS]->err;
+                                    syscall = "getaddrinfo(3)";
+                                }
+                                resolution_store.v6.has_error = true;
+                            } else {
+                                resolution_store.v6.ai = arg->getaddrinfo_entries[IPV6_ENTRY_POS]->ai;
+                            }
+                            if (resolution_store.v4.finished) {
+                                resolution_store.is_all_finished = true;
+                                resolution_delay_expires_at = NULL;
+                                user_specified_resolv_timeout_at = NULL;
+                                break;
+                            }
+                        } else if (resolved_type[0] == IPV4_HOSTNAME_RESOLVED) {
+                            resolution_store.v4.finished = true;
+
+                            if (arg->getaddrinfo_entries[IPV4_ENTRY_POS]->err) {
+                                if (!resolution_store.v6.finished || resolution_store.v6.has_error) {
+                                    last_error.type = RESOLUTION_ERROR;
+                                    last_error.ecode = arg->getaddrinfo_entries[IPV4_ENTRY_POS]->err;
+                                    syscall = "getaddrinfo(3)";
+                                }
+                                resolution_store.v4.has_error = true;
+                            } else {
+                                resolution_store.v4.ai = arg->getaddrinfo_entries[IPV4_ENTRY_POS]->ai;
+                            }
+
+                            if (resolution_store.v6.finished) {
+                                resolution_store.is_all_finished = true;
+                                resolution_delay_expires_at = NULL;
+                                user_specified_resolv_timeout_at = NULL;
+                                break;
+                            }
+                        } else {
+                            /* Retry to read from hostname_resolution_waiter */
+                        }
+                    } else if (resolved_type_size < 0 && (errno == EAGAIN || errno == EWOULDBLOCK)) {
+                        errno = 0;
+                        break;
+                    } else {
+                        /* Retry to read from hostname_resolution_waiter */
+                    }
+
+                    if (!resolution_store.v6.finished &&
+                        resolution_store.v4.finished &&
+                        !resolution_store.v4.has_error) {
+                        set_timeout_tv(&resolution_delay_storage, 50, now);
+                        resolution_delay_expires_at = &resolution_delay_storage;
+                    }
+                }
+            }
+
+            status = 0;
+        }
+
+        /* For cases where write(2) fails in child threads */
+        if (!resolution_store.is_all_finished) {
+            if (!resolution_store.v6.finished && arg->getaddrinfo_entries[IPV6_ENTRY_POS]->has_syserr) {
+                resolution_store.v6.finished = true;
+
+                if (arg->getaddrinfo_entries[IPV6_ENTRY_POS]->err) {
+                    if (!resolution_store.v4.finished || resolution_store.v4.has_error) {
+                        last_error.type = RESOLUTION_ERROR;
+                        last_error.ecode = arg->getaddrinfo_entries[IPV6_ENTRY_POS]->err;
+                        syscall = "getaddrinfo(3)";
+                    }
+                    resolution_store.v6.has_error = true;
+                } else {
+                    resolution_store.v6.ai = arg->getaddrinfo_entries[IPV6_ENTRY_POS]->ai;
+                }
+
+                if (resolution_store.v4.finished) {
+                    resolution_store.is_all_finished = true;
+                    resolution_delay_expires_at = NULL;
+                    user_specified_resolv_timeout_at = NULL;
+                }
+            }
+            if (!resolution_store.v4.finished && arg->getaddrinfo_entries[IPV4_ENTRY_POS]->has_syserr) {
+                resolution_store.v4.finished = true;
+
+                if (arg->getaddrinfo_entries[IPV4_ENTRY_POS]->err) {
+                    if (!resolution_store.v6.finished || resolution_store.v6.has_error) {
+                        last_error.type = RESOLUTION_ERROR;
+                        last_error.ecode = arg->getaddrinfo_entries[IPV4_ENTRY_POS]->err;
+                        syscall = "getaddrinfo(3)";
+                    }
+                    resolution_store.v4.has_error = true;
+                } else {
+                    resolution_store.v4.ai = arg->getaddrinfo_entries[IPV4_ENTRY_POS]->ai;
+                }
+
+                if (resolution_store.v6.finished) {
+                    resolution_store.is_all_finished = true;
+                    resolution_delay_expires_at = NULL;
+                    user_specified_resolv_timeout_at = NULL;
+                } else {
+                    set_timeout_tv(&resolution_delay_storage, 50, now);
+                    resolution_delay_expires_at = &resolution_delay_storage;
+                }
+            }
+        }
+
+        if (is_timeout_tv(user_specified_open_timeout_at, now)) {
+            rsock_raise_user_specified_timeout(NULL, arg->remote.host, arg->remote.serv);
+        }
+
+        if (!any_addrinfos(&resolution_store)) {
+            if (!in_progress_fds(arg->connection_attempt_fds_size) &&
+                resolution_store.is_all_finished) {
+                if (local_status < 0) {
+                    host = arg->local.host;
+                    serv = arg->local.serv;
+                } else {
+                    host = arg->remote.host;
+                    serv = arg->remote.serv;
+                }
+                if (last_error.type == RESOLUTION_ERROR) {
+                    rsock_raise_resolution_error(syscall, last_error.ecode);
+                } else {
+                    rsock_syserr_fail_host_port(last_error.ecode, syscall, host, serv);
+                }
+            }
+
+            if ((is_timeout_tv(user_specified_resolv_timeout_at, now) ||
+                resolution_store.is_all_finished) &&
+                (is_timeout_tv(user_specified_connect_timeout_at, now) ||
+                !in_progress_fds(arg->connection_attempt_fds_size))) {
+                rsock_raise_user_specified_timeout(NULL, arg->remote.host, arg->remote.serv);
+            }
+        }
+    }
+
+    if (NIL_P(arg->io)) {
+        /* create new instance */
+        arg->io = rsock_init_sock(arg->self, connected_fd);
+    }
+
+    return arg->io;
+}
+
+static VALUE
+fast_fallback_inetsock_cleanup(VALUE v)
+{
+    struct fast_fallback_inetsock_arg *arg = (void *)v;
+    struct fast_fallback_getaddrinfo_shared *getaddrinfo_shared = arg->getaddrinfo_shared;
+
+    if (arg->remote.res) {
+        rb_freeaddrinfo(arg->remote.res);
+        arg->remote.res = 0;
+    }
+    if (arg->local.res) {
+        rb_freeaddrinfo(arg->local.res);
+        arg->local.res = 0;
+    }
+
+    if (arg->wait != -1) close(arg->wait);
+
+    if (getaddrinfo_shared) {
+        if (getaddrinfo_shared->notify != -1) close(getaddrinfo_shared->notify);
+        getaddrinfo_shared->notify = -1;
+
+        int shared_need_free = 0;
+        struct addrinfo *ais[arg->family_size];
+        for (int i = 0; i < arg->family_size; i++) ais[i] = NULL;
+
+        rb_nativethread_lock_lock(&getaddrinfo_shared->lock);
+        {
+            for (int i = 0; i < arg->family_size; i++) {
+                struct fast_fallback_getaddrinfo_entry *getaddrinfo_entry = arg->getaddrinfo_entries[i];
+
+                if (!getaddrinfo_entry) continue;
+
+                if (--(getaddrinfo_entry->refcount) == 0) {
+                    ais[i] = getaddrinfo_entry->ai;
+                    getaddrinfo_entry->ai = NULL;
+                }
+            }
+            if (--(getaddrinfo_shared->refcount) == 0) {
+                shared_need_free = 1;
+            }
+        }
+        rb_nativethread_lock_unlock(&getaddrinfo_shared->lock);
+
+        for (int i = 0; i < arg->family_size; i++) {
+            if (ais[i]) freeaddrinfo(ais[i]);
+        }
+        if (getaddrinfo_shared && shared_need_free) {
+            free_fast_fallback_getaddrinfo_shared(&getaddrinfo_shared);
+        }
+    }
+
+    int connection_attempt_fd;
+
+    for (int i = 0; i < arg->connection_attempt_fds_size; i++) {
+        connection_attempt_fd = arg->connection_attempt_fds[i];
+
+        if (connection_attempt_fd >= 0) {
+            int error = 0;
+            socklen_t len = sizeof(error);
+            getsockopt(connection_attempt_fd, SOL_SOCKET, SO_ERROR, &error, &len);
+            if (error == 0) shutdown(connection_attempt_fd, SHUT_RDWR);
+            close(connection_attempt_fd);
+       }
+    }
+
+    if (arg->readfds.fdset) rb_fd_term(&arg->readfds);
+    if (arg->writefds.fdset) rb_fd_term(&arg->writefds);
+
+    if (arg->connection_attempt_fds) {
+        free(arg->connection_attempt_fds);
+        arg->connection_attempt_fds = NULL;
+    }
+
+    return Qnil;
+}
+
+VALUE
+rsock_init_inetsock(
+    VALUE self, VALUE remote_host, VALUE remote_serv,
+    VALUE local_host, VALUE local_serv, int type,
+    VALUE resolv_timeout, VALUE connect_timeout, VALUE open_timeout,
+    VALUE fast_fallback, VALUE test_mode_settings)
+{
+    if (!NIL_P(open_timeout) && (!NIL_P(resolv_timeout) || !NIL_P(connect_timeout))) {
+        rb_raise(rb_eArgError, "Cannot specify open_timeout along with connect_timeout or resolv_timeout");
+    }
+
+    if (type == INET_CLIENT && FAST_FALLBACK_INIT_INETSOCK_IMPL == 1 && RTEST(fast_fallback)) {
+        struct rb_addrinfo *local_res = NULL;
+        char *hostp, *portp, *local_portp;
+        char hbuf[NI_MAXHOST], pbuf[NI_MAXSERV], local_pbuf[NI_MAXSERV];
+        int additional_flags = 0;
+        int local_flags = 0;
+        hostp = raddrinfo_host_str(remote_host, hbuf, sizeof(hbuf), &additional_flags);
+        portp = raddrinfo_port_str(remote_serv, pbuf, sizeof(pbuf), &additional_flags);
+        local_portp = raddrinfo_port_str(local_serv, local_pbuf, sizeof(local_pbuf), &local_flags);
+
+        if (!is_specified_ip_address(hostp) && !is_local_port_fixed(local_portp)) {
+            int target_families[2] = { 0, 0 };
+            int resolving_family_size = 0;
+
+            /*
+             * Maybe also accept a local address
+             */
+            if (!NIL_P(local_host) || !NIL_P(local_serv)) {
+                VALUE t = NIL_P(open_timeout) ? resolv_timeout : open_timeout;
+                local_res = rsock_addrinfo(
+                    local_host,
+                    local_serv,
+                    AF_UNSPEC,
+                    SOCK_STREAM,
+                    0,
+                    t
+                );
+
+                struct addrinfo *tmp_p = local_res->ai;
+                for (; tmp_p != NULL; tmp_p = tmp_p->ai_next) {
+                    if (target_families[0] == 0 && tmp_p->ai_family == AF_INET6) {
+                        target_families[0] = AF_INET6;
+                        resolving_family_size++;
+                    }
+                    if (target_families[1] == 0 && tmp_p->ai_family == AF_INET) {
+                        target_families[1] = AF_INET;
+                        resolving_family_size++;
+                    }
+                }
+            }  else {
+                resolving_family_size = 2;
+                target_families[0] = AF_INET6;
+                target_families[1] = AF_INET;
+            }
+
+            struct fast_fallback_inetsock_arg fast_fallback_arg;
+            memset(&fast_fallback_arg, 0, sizeof(fast_fallback_arg));
+
+            fast_fallback_arg.self = self;
+            fast_fallback_arg.io = Qnil;
+            fast_fallback_arg.remote.host = remote_host;
+            fast_fallback_arg.remote.serv = remote_serv;
+            fast_fallback_arg.remote.res = 0;
+            fast_fallback_arg.local.host = local_host;
+            fast_fallback_arg.local.serv = local_serv;
+            fast_fallback_arg.local.res = local_res;
+            fast_fallback_arg.type = type;
+            fast_fallback_arg.resolv_timeout = resolv_timeout;
+            fast_fallback_arg.connect_timeout = connect_timeout;
+            fast_fallback_arg.open_timeout = open_timeout;
+            fast_fallback_arg.hostp = hostp;
+            fast_fallback_arg.portp = portp;
+            fast_fallback_arg.additional_flags = additional_flags;
+
+            int resolving_families[resolving_family_size];
+            int resolving_family_index = 0;
+            for (int i = 0; 2 > i; i++) {
+                if (target_families[i] != 0) {
+                    resolving_families[resolving_family_index] = target_families[i];
+                    resolving_family_index++;
+                }
+            }
+            fast_fallback_arg.families = resolving_families;
+            fast_fallback_arg.family_size = resolving_family_size;
+            fast_fallback_arg.test_mode_settings = test_mode_settings;
+
+            rb_fd_init(&fast_fallback_arg.readfds);
+            rb_fd_init(&fast_fallback_arg.writefds);
+
+            return rb_ensure(init_fast_fallback_inetsock_internal, (VALUE)&fast_fallback_arg,
+                             fast_fallback_inetsock_cleanup, (VALUE)&fast_fallback_arg);
+        }
+    }
+
+    struct inetsock_arg arg;
+    arg.self = self;
+    arg.io = Qnil;
+    arg.remote.host = remote_host;
+    arg.remote.serv = remote_serv;
+    arg.remote.res = 0;
+    arg.local.host = local_host;
+    arg.local.serv = local_serv;
+    arg.local.res = 0;
+    arg.type = type;
+    arg.resolv_timeout = resolv_timeout;
+    arg.connect_timeout = connect_timeout;
+    arg.open_timeout = open_timeout;
+
+    return rb_ensure(init_inetsock_internal, (VALUE)&arg,
+                     inetsock_cleanup, (VALUE)&arg);
+}
+
+#endif
+
 static ID id_numeric, id_hostname;
 
 int
@@ -274,16 +1517,13 @@ ip_inspect(VALUE sock)
 static VALUE
 ip_addr(int argc, VALUE *argv, VALUE sock)
 {
-    rb_io_t *fptr;
     union_sockaddr addr;
     socklen_t len = (socklen_t)sizeof addr;
     int norevlookup;
 
-    GetOpenFile(sock, fptr);
-
     if (argc < 1 || !rsock_revlookup_flag(argv[0], &norevlookup))
-        norevlookup = fptr->mode & FMODE_NOREVLOOKUP;
-    if (getsockname(fptr->fd, &addr.addr, &len) < 0)
+        norevlookup = rb_io_mode(sock) & FMODE_NOREVLOOKUP;
+    if (getsockname(rb_io_descriptor(sock), &addr.addr, &len) < 0)
         rb_sys_fail("getsockname(2)");
     return rsock_ipaddr(&addr.addr, len, norevlookup);
 }
@@ -315,16 +1555,13 @@ ip_addr(int argc, VALUE *argv, VALUE sock)
 static VALUE
 ip_peeraddr(int argc, VALUE *argv, VALUE sock)
 {
-    rb_io_t *fptr;
     union_sockaddr addr;
     socklen_t len = (socklen_t)sizeof addr;
     int norevlookup;
 
-    GetOpenFile(sock, fptr);
-
     if (argc < 1 || !rsock_revlookup_flag(argv[0], &norevlookup))
-        norevlookup = fptr->mode & FMODE_NOREVLOOKUP;
-    if (getpeername(fptr->fd, &addr.addr, &len) < 0)
+        norevlookup = rb_io_mode(sock) & FMODE_NOREVLOOKUP;
+    if (getpeername(rb_io_descriptor(sock), &addr.addr, &len) < 0)
         rb_sys_fail("getpeername(2)");
     return rsock_ipaddr(&addr.addr, len, norevlookup);
 }
@@ -372,7 +1609,7 @@ static VALUE
 ip_s_getaddress(VALUE obj, VALUE host)
 {
     union_sockaddr addr;
-    struct rb_addrinfo *res = rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, 0);
+    struct rb_addrinfo *res = rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, 0, Qnil);
     socklen_t len = res->ai->ai_addrlen;
 
     /* just take the first one */
diff --git a/ext/socket/lib/socket.rb b/ext/socket/lib/socket.rb
index e953077fe6..465b74964f 100644
--- a/ext/socket/lib/socket.rb
+++ b/ext/socket/lib/socket.rb
@@ -62,7 +62,7 @@ class Addrinfo
           break
         when :wait_writable
           sock.wait_writable(timeout) or
-            raise Errno::ETIMEDOUT, 'user specified timeout'
+            raise Errno::ETIMEDOUT, "user specified timeout for #{self.ip_address}:#{self.ip_port}"
         end while true
       else
         sock.connect(self)
@@ -599,6 +599,7 @@ class Socket < BasicSocket
     __accept_nonblock(exception)
   end
 
+  # :stopdoc:
   RESOLUTION_DELAY = 0.05
   private_constant :RESOLUTION_DELAY
 
@@ -614,14 +615,9 @@ class Socket < BasicSocket
   HOSTNAME_RESOLUTION_QUEUE_UPDATED = 0
   private_constant :HOSTNAME_RESOLUTION_QUEUE_UPDATED
 
-  IPV6_ADRESS_FORMAT = /(?i)(?:(?:[0-9A-F]{1,4}:){7}(?:[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){6}(?:[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,5}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){5}(?::[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,4}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){4}(?::[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,3}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){3}(?::[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,2}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){2}(?::[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:)[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){1}(?::[0-9A-F]{1,4}::[0-9A-F]{1,4}|::(?:[0-9A-F]{1,4}:){1,5}[0-9A-F]{1,4}|:)|::(?:[0-9A-F]{1,4}::[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,6}[0-9A-F]{1,4}|:))(?:%.+)?/
-  private_constant :IPV6_ADRESS_FORMAT
-
-  @tcp_fast_fallback = true
-
-  class << self
-    attr_accessor :tcp_fast_fallback
-  end
+  IPV6_ADDRESS_FORMAT = /\A(?i:(?:(?:[0-9A-F]{1,4}:){7}(?:[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){6}(?:[0-9A-F]{1,4}|:(?:[0-9A-F]{1,4}:){1,5}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){5}(?:(?::[0-9A-F]{1,4}){1,2}|:(?:[0-9A-F]{1,4}:){1,4}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){4}(?:(?::[0-9A-F]{1,4}){1,3}|:(?:[0-9A-F]{1,4}:){1,3}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){3}(?:(?::[0-9A-F]{1,4}){1,4}|:(?:[0-9A-F]{1,4}:){1,2}[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){2}(?:(?::[0-9A-F]{1,4}){1,5}|:(?:[0-9A-F]{1,4}:)[0-9A-F]{1,4}|:)|(?:[0-9A-F]{1,4}:){1}(?:(?::[0-9A-F]{1,4}){1,6}|:(?:[0-9A-F]{1,4}:){0,5}[0-9A-F]{1,4}|:)|(?:::(?:[0-9A-F]{1,4}:){0,7}[0-9A-F]{1,4}|::)))(?:%.+)?\z/
+  private_constant :IPV6_ADDRESS_FORMAT
+  # :startdoc:
 
   # :call-seq:
   #   Socket.tcp(host, port, local_host=nil, local_port=nil, [opts]) {|socket| ... }
@@ -629,13 +625,28 @@ class Socket < BasicSocket
   #
   # creates a new socket object connected to host:port using TCP/IP.
   #
+  # Starting from Ruby 3.4, this method operates according to the
+  # Happy Eyeballs Version 2 ({RFC 8305}[https://datatracker.ietf.org/doc/html/rfc8305])
+  # algorithm by default.
+  #
+  # For details on Happy Eyeballs Version 2,
+  # see {Socket.tcp_fast_fallback=}[rdoc-ref:Socket.tcp_fast_fallback=].
+  #
+  # To make it behave the same as in Ruby 3.3 and earlier,
+  # explicitly specify the option fast_fallback:false.
+  # Or, setting Socket.tcp_fast_fallback=false will disable
+  # Happy Eyeballs Version 2 not only for this method but for all Socket globally.
+  #
   # If local_host:local_port is given,
   # the socket is bound to it.
   #
   # The optional last argument _opts_ is options represented by a hash.
   # _opts_ may have following options:
   #
-  # [:connect_timeout] specify the timeout in seconds.
+  # [:resolv_timeout] Specifies the timeout in seconds from when the hostname resolution starts.
+  # [:connect_timeout] This method sequentially attempts connecting to all candidate destination addresses.<br>The +connect_timeout+ specifies the timeout in seconds from the start of the connection attempt to the last candidate.<br>By default, all connection attempts continue until the timeout occurs.<br>When +fast_fallback:false+ is explicitly specified,<br>a timeout is set for each connection attempt and any connection attempt that exceeds its timeout will be canceled.
+  # [:open_timeout] Specifies the timeout in seconds from the start of the method execution.<br>If this timeout is reached while there are still addresses that have not yet been attempted for connection, no further attempts will be made.<br>If this option is specified together with other timeout options, an +ArgumentError+ will be raised.
+  # [:fast_fallback] Enables the Happy Eyeballs Version 2 algorithm (enabled by default).
   #
   # If a block is given, the block is called with the socket.
   # The value of the block is returned.
@@ -648,537 +659,468 @@ class Socket < BasicSocket
   #     sock.close_write
   #     puts sock.read
   #   }
-  def self.tcp(host, port, local_host = nil, local_port = nil, connect_timeout: nil, resolv_timeout: nil, fast_fallback: tcp_fast_fallback, &block) # :yield: socket
-    unless fast_fallback
-      return tcp_without_fast_fallback(host, port, local_host, local_port, connect_timeout:, resolv_timeout:, &block)
+  def self.tcp(host, port, local_host = nil, local_port = nil, connect_timeout: nil, resolv_timeout: nil, open_timeout: nil, fast_fallback: tcp_fast_fallback, &) # :yield: socket
+    if open_timeout && (connect_timeout || resolv_timeout)
+      raise ArgumentError, "Cannot specify open_timeout along with connect_timeout or resolv_timeout"
     end
 
-    # Happy Eyeballs' states
-    # - :start
-    # - :v6c
-    # - :v4w
-    # - :v4c
-    # - :v46c
-    # - :v46w
-    # - :success
-    # - :failure
-    # - :timeout
-
-    specified_family_name = nil
-    hostname_resolution_threads = []
-    hostname_resolution_queue = nil
-    hostname_resolution_waiting = nil
-    hostname_resolution_expires_at = nil
-    selectable_addrinfos = SelectableAddrinfos.new
-    connecting_sockets = ConnectingSockets.new
-    local_addrinfos = []
-    connection_attempt_delay_expires_at = nil
-    connection_attempt_started_at = nil
-    state = :start
-    connected_socket = nil
-    last_error = nil
-    is_windows_environment ||= (RUBY_PLATFORM =~ /mswin|mingw|cygwin/)
+    sock = if fast_fallback && !(host && ip_address?(host)) && !(local_port && local_port.to_i != 0)
+      tcp_with_fast_fallback(host, port, local_host, local_port, connect_timeout:, resolv_timeout:, open_timeout:)
+    else
+      tcp_without_fast_fallback(host, port, local_host, local_port, connect_timeout:, resolv_timeout:, open_timeout:)
+    end
 
-    ret = loop do
-      case state
-      when :start
-        specified_family_name, next_state = host && specified_family_name_and_next_state(host)
+    if block_given?
+      begin
+        yield sock
+      ensure
+        sock.close
+      end
+    else
+      sock
+    end
+  end
 
-        if local_host && local_port
-          specified_family_name, next_state = specified_family_name_and_next_state(local_host) unless specified_family_name
-          local_addrinfos = Addrinfo.getaddrinfo(local_host, local_port, ADDRESS_FAMILIES[specified_family_name], :STREAM, timeout: resolv_timeout)
-        end
+  # :stopdoc:
+  def self.tcp_with_fast_fallback(host, port, local_host = nil, local_port = nil, connect_timeout: nil, resolv_timeout: nil, open_timeout: nil)
+    if local_host || local_port
+      local_addrinfos = Addrinfo.getaddrinfo(local_host, local_port, nil, :STREAM, timeout: open_timeout || resolv_timeout)
+      resolving_family_names = local_addrinfos.map { |lai| ADDRESS_FAMILIES.key(lai.afamily) }.uniq
+    else
+      local_addrinfos = []
+      resolving_family_names = ADDRESS_FAMILIES.keys
+    end
 
-        if specified_family_name
-          addrinfos = Addrinfo.getaddrinfo(host, port, ADDRESS_FAMILIES[specified_family_name], :STREAM, timeout: resolv_timeout)
-          selectable_addrinfos.add(specified_family_name, addrinfos)
-          hostname_resolution_queue = NoHostnameResolutionQueue.new
-          state = next_state
-          next
-        end
+    hostname_resolution_threads = []
+    resolution_store = HostnameResolutionStore.new(resolving_family_names)
+    connecting_sockets = {}
+    is_windows_environment ||= (RUBY_PLATFORM =~ /mswin|mingw|cygwin/)
 
-        resolving_family_names = ADDRESS_FAMILIES.keys
-        hostname_resolution_queue = HostnameResolutionQueue.new(resolving_family_names.size)
-        hostname_resolution_waiting = hostname_resolution_queue.waiting_pipe
-        hostname_resolution_started_at = current_clocktime if resolv_timeout
-        hostname_resolution_args = [host, port, hostname_resolution_queue]
-
-        hostname_resolution_threads.concat(
-          resolving_family_names.map { |family|
-            thread_args = [family, *hostname_resolution_args]
-            thread = Thread.new(*thread_args) { |*thread_args| hostname_resolution(*thread_args) }
-            Thread.pass
-            thread
-          }
-        )
-
-        hostname_resolution_retry_count = resolving_family_names.size - 1
-        hostname_resolution_expires_at = hostname_resolution_started_at + resolv_timeout if resolv_timeout
-
-        while hostname_resolution_retry_count >= 0
-          remaining = resolv_timeout ? second_to_timeout(hostname_resolution_started_at + resolv_timeout) : nil
-          hostname_resolved, _, = IO.select(hostname_resolution_waiting, nil, nil, remaining)
-
-          unless hostname_resolved
-            state = :timeout
-            break
-          end
+    now = current_clock_time
+    starts_at = now
+    resolution_delay_expires_at = nil
+    connection_attempt_delay_expires_at = nil
+    user_specified_connect_timeout_at = nil
+    user_specified_open_timeout_at = open_timeout ? now + open_timeout : nil
+    last_error = nil
+    last_error_from_thread = false
+
+    if resolving_family_names.size == 1
+      family_name = resolving_family_names.first
+      addrinfos = Addrinfo.getaddrinfo(host, port, ADDRESS_FAMILIES[:family_name], :STREAM, timeout: open_timeout || resolv_timeout)
+      resolution_store.add_resolved(family_name, addrinfos)
+      hostname_resolution_result = nil
+      hostname_resolution_notifier = nil
+      user_specified_resolv_timeout_at = nil
+    else
+      hostname_resolution_result = HostnameResolutionResult.new(resolving_family_names.size)
+      hostname_resolution_notifier = hostname_resolution_result.notifier
+
+      hostname_resolution_threads.concat(
+        resolving_family_names.map { |family|
+          thread_args = [family, host, port, hostname_resolution_result]
+          thread = Thread.new(*thread_args) { |*thread_args| resolve_hostname(*thread_args) }
+          Thread.pass
+          thread
+        }
+      )
+      user_specified_resolv_timeout_at = resolv_timeout ? now + resolv_timeout : Float::INFINITY
+    end
 
-          family_name, res = hostname_resolution_queue.get
+    loop do
+      if resolution_store.any_addrinfos? &&
+          !resolution_delay_expires_at &&
+          !connection_attempt_delay_expires_at
+        while (addrinfo = resolution_store.get_addrinfo)
+          if local_addrinfos.any?
+            local_addrinfo = local_addrinfos.find { |lai| lai.afamily == addrinfo.afamily }
+
+            if local_addrinfo.nil?
+              if resolution_store.any_addrinfos?
+                # Try other Addrinfo in next "while"
+                next
+              elsif connecting_sockets.any? || resolution_store.any_unresolved_family?
+                # Exit this "while" and wait for connections to be established or hostname resolution in next loop
+                # Or exit this "while" and wait for hostname resolution in next loop
+                break
+              else
+                raise SocketError.new 'no appropriate local address'
+              end
+            end
+          end
 
-          if res.is_a? Exception
-            unless (Socket.const_defined?(:EAI_ADDRFAMILY)) &&
-                (res.is_a?(Socket::ResolutionError)) &&
-                (res.error_code == Socket::EAI_ADDRFAMILY)
-              last_error = res
+          begin
+            if resolution_store.any_addrinfos? ||
+               connecting_sockets.any? ||
+               resolution_store.any_unresolved_family?
+              socket = Socket.new(addrinfo.pfamily, addrinfo.socktype, addrinfo.protocol)
+              socket.bind(local_addrinfo) if local_addrinfo
+              result = socket.connect_nonblock(addrinfo, exception: false)
+            else
+              timeout =
+                if open_timeout
+                  t = open_timeout - (current_clock_time - starts_at)
+                  t.negative? ? 0 : t
+                else
+                  connect_timeout
+                end
+              result = socket = local_addrinfo ?
+                addrinfo.connect_from(local_addrinfo, timeout:) :
+                addrinfo.connect(timeout:)
             end
 
-            if hostname_resolution_retry_count.zero?
-              state = :failure
+            if result == :wait_writable
+              connection_attempt_delay_expires_at = now + CONNECTION_ATTEMPT_DELAY
+              if resolution_store.empty_addrinfos?
+                user_specified_connect_timeout_at = connect_timeout ? now + connect_timeout : Float::INFINITY
+              end
+
+              connecting_sockets[socket] = addrinfo
               break
+            else
+              return socket # connection established
+            end
+          rescue SystemCallError => e
+            socket&.close
+            last_error = e
+
+            if resolution_store.any_addrinfos?
+              # Try other Addrinfo in next "while"
+              next
+            elsif connecting_sockets.any? || resolution_store.any_unresolved_family?
+              # Exit this "while" and wait for connections to be established or hostname resolution in next loop
+              # Or exit this "while" and wait for hostname resolution in next loop
+              break
+            else
+              raise last_error
             end
-            hostname_resolution_retry_count -= 1
-          else
-            state = case family_name
-                    when :ipv6 then :v6c
-                    when :ipv4 then hostname_resolution_queue.closed? ? :v4c : :v4w
-                    end
-            selectable_addrinfos.add(family_name, res)
-            last_error = nil
-            break
           end
         end
+      end
 
-        next
-      when :v4w
-        ipv6_resolved, _, = IO.select(hostname_resolution_waiting, nil, nil, RESOLUTION_DELAY)
-
-        if ipv6_resolved
-          family_name, res = hostname_resolution_queue.get
-          selectable_addrinfos.add(family_name, res) unless res.is_a? Exception
-          state = :v46c
+      ends_at =
+        if resolution_store.any_addrinfos?
+          [(resolution_delay_expires_at || connection_attempt_delay_expires_at),
+           user_specified_open_timeout_at].compact.min
+        elsif user_specified_open_timeout_at
+          user_specified_open_timeout_at
         else
-          state = :v4c
+          [user_specified_resolv_timeout_at, user_specified_connect_timeout_at].compact.max
         end
 
-        next
-      when :v4c, :v6c, :v46c
-        connection_attempt_started_at = current_clocktime unless connection_attempt_started_at
-        addrinfo = selectable_addrinfos.get
-
-        if local_addrinfos.any?
-          local_addrinfo = local_addrinfos.find { |lai| lai.afamily == addrinfo.afamily }
-
-          if local_addrinfo.nil?
-            if selectable_addrinfos.empty? && connecting_sockets.empty? && hostname_resolution_queue.closed?
-              last_error = SocketError.new 'no appropriate local address'
-              state = :failure
-            elsif selectable_addrinfos.any?
-              # Try other Addrinfo in next loop
+      hostname_resolved, writable_sockets, except_sockets = IO.select(
+        hostname_resolution_notifier,
+        connecting_sockets.keys,
+        # Use errorfds to wait for non-blocking connect failures on Windows
+        is_windows_environment ? connecting_sockets.keys : nil,
+        second_to_timeout(current_clock_time, ends_at),
+      )
+      now = current_clock_time
+      resolution_delay_expires_at = nil if expired?(now, resolution_delay_expires_at)
+      connection_attempt_delay_expires_at = nil if expired?(now, connection_attempt_delay_expires_at)
+
+      if writable_sockets&.any?
+        while (writable_socket = writable_sockets.pop)
+          is_connected = is_windows_environment || (
+            sockopt = writable_socket.getsockopt(Socket::SOL_SOCKET, Socket::SO_ERROR)
+            sockopt.int.zero?
+          )
+
+          if is_connected
+            connecting_sockets.delete writable_socket
+            return writable_socket
+          else
+            failed_ai = connecting_sockets.delete writable_socket
+            writable_socket.close
+            ip_address = failed_ai.ipv6? ? "[#{failed_ai.ip_address}]" : failed_ai.ip_address
+            last_error = SystemCallError.new("connect(2) for #{ip_address}:#{failed_ai.ip_port}", sockopt.int)
+
+            if writable_sockets.any? || connecting_sockets.any?
+              # Try other writable socket in next "while"
+              # Or exit this "while" and wait for connections to be established or hostname resolution in next loop
+            elsif resolution_store.any_addrinfos? || resolution_store.any_unresolved_family?
+              # Exit this "while" and try other connection attempt
+              # Or exit this "while" and wait for hostname resolution in next loop
+              connection_attempt_delay_expires_at = nil
+              user_specified_connect_timeout_at = nil
             else
-              if resolv_timeout && hostname_resolution_queue.opened? &&
-                  (current_clocktime >= hostname_resolution_expires_at)
-                state = :timeout
-              else
-                # Wait for connection to be established or hostname resolution in next loop
-                connection_attempt_delay_expires_at = nil
-                state = :v46w
-              end
+              raise last_error
             end
-            next
           end
         end
+      end
 
-        connection_attempt_delay_expires_at = current_clocktime + CONNECTION_ATTEMPT_DELAY
-
-        begin
-          result = if specified_family_name && selectable_addrinfos.empty? &&
-                       connecting_sockets.empty? && hostname_resolution_queue.closed?
-                     local_addrinfo ?
-                       addrinfo.connect_from(local_addrinfo, timeout: connect_timeout) :
-                       addrinfo.connect(timeout: connect_timeout)
-                   else
-                     socket = Socket.new(addrinfo.pfamily, addrinfo.socktype, addrinfo.protocol)
-                     socket.bind(local_addrinfo) if local_addrinfo
-                     socket.connect_nonblock(addrinfo, exception: false)
-                   end
-
-          case result
-          when 0
-            connected_socket = socket
-            state = :success
-          when Socket
-            connected_socket = result
-            state = :success
-          when :wait_writable
-            connecting_sockets.add(socket, addrinfo)
-            state = :v46w
-          end
-        rescue SystemCallError => e
-          last_error = e
-          socket.close if socket && !socket.closed?
-
-          if selectable_addrinfos.empty? && connecting_sockets.empty? && hostname_resolution_queue.closed?
-            state = :failure
-          elsif selectable_addrinfos.any?
-            # Try other Addrinfo in next loop
+      if except_sockets&.any?
+        except_sockets.each do |except_socket|
+          failed_ai = connecting_sockets.delete except_socket
+          sockopt = except_socket.getsockopt(Socket::SOL_SOCKET, Socket::SO_ERROR)
+          except_socket.close
+          ip_address = failed_ai.ipv6? ? "[#{failed_ai.ip_address}]" : failed_ai.ip_address
+          last_error = SystemCallError.new("connect(2) for #{ip_address}:#{failed_ai.ip_port}", sockopt.int)
+
+          if except_sockets.any? || connecting_sockets.any?
+            # Cleanup other except socket in next "each"
+            # Or exit this "while" and wait for connections to be established or hostname resolution in next loop
+          elsif resolution_store.any_addrinfos? || resolution_store.any_unresolved_family?
+            # Exit this "while" and try other connection attempt
+            # Or exit this "while" and wait for hostname resolution in next loop
+            connection_attempt_delay_expires_at = nil
+            user_specified_connect_timeout_at = nil
           else
-            if resolv_timeout && hostname_resolution_queue.opened? &&
-                (current_clocktime >= hostname_resolution_expires_at)
-              state = :timeout
-            else
-              # Wait for connection to be established or hostname resolution in next loop
-              connection_attempt_delay_expires_at = nil
-              state = :v46w
-            end
+            raise last_error
           end
         end
+      end
 
-        next
-      when :v46w
-        if connect_timeout && second_to_timeout(connection_attempt_started_at + connect_timeout).zero?
-          state = :timeout
-          next
-        end
-
-        remaining = second_to_timeout(connection_attempt_delay_expires_at)
-        hostname_resolution_waiting = hostname_resolution_waiting && hostname_resolution_queue.closed? ? nil : hostname_resolution_waiting
-        hostname_resolved, connectable_sockets, = IO.select(hostname_resolution_waiting, connecting_sockets.all, nil, remaining)
-
-        if connectable_sockets&.any?
-          while (connectable_socket = connectable_sockets.pop)
-            is_connected =
-              if is_windows_environment
-                sockopt = connectable_socket.getsockopt(Socket::SOL_SOCKET, Socket::SO_CONNECT_TIME)
-                sockopt.unpack('i').first >= 0
-              else
-                sockopt = connectable_socket.getsockopt(Socket::SOL_SOCKET, Socket::SO_ERROR)
-                sockopt.int.zero?
-              end
-
-            if is_connected
-              connected_socket = connectable_socket
-              connecting_sockets.delete connectable_socket
-              connectable_sockets.each do |other_connectable_socket|
-                other_connectable_socket.close unless other_connectable_socket.closed?
-              end
-              state = :success
-              break
-            else
-              failed_ai = connecting_sockets.delete connectable_socket
-              inspected_ip_address = failed_ai.ipv6? ? "[#{failed_ai.ip_address}]" : failed_ai.ip_address
-              last_error = SystemCallError.new("connect(2) for #{inspected_ip_address}:#{failed_ai.ip_port}", sockopt.int)
-              connectable_socket.close unless connectable_socket.closed?
+      if hostname_resolved&.any?
+        while (family_and_result = hostname_resolution_result.get)
+          family_name, result = family_and_result
 
-              next if connectable_sockets.any?
+          if result.is_a? Exception
+            resolution_store.add_error(family_name, result)
 
-              if selectable_addrinfos.empty? && connecting_sockets.empty? && hostname_resolution_queue.closed?
-                state = :failure
-              elsif selectable_addrinfos.any?
-                # Wait for connection attempt delay timeout in next loop
-              else
-                if resolv_timeout && hostname_resolution_queue.opened? &&
-                    (current_clocktime >= hostname_resolution_expires_at)
-                  state = :timeout
-                else
-                  # Wait for connection to be established or hostname resolution in next loop
-                  connection_attempt_delay_expires_at = nil
-                end
+            unless (Socket.const_defined?(:EAI_ADDRFAMILY)) &&
+              (result.is_a?(Socket::ResolutionError)) &&
+              (result.error_code == Socket::EAI_ADDRFAMILY)
+              other = family_name == :ipv6 ? :ipv4 : :ipv6
+              if !resolution_store.resolved?(other) || !resolution_store.resolved_successfully?(other)
+                last_error = result
+                last_error_from_thread = true
               end
             end
-          end
-        elsif hostname_resolved&.any?
-          family_name, res = hostname_resolution_queue.get
-          selectable_addrinfos.add(family_name, res) unless res.is_a? Exception
-        else
-          if selectable_addrinfos.empty? && connecting_sockets.empty? && hostname_resolution_queue.closed?
-            state = :failure
-          elsif selectable_addrinfos.any?
-            # Try other Addrinfo in next loop
-            state = :v46c
           else
-            if resolv_timeout && hostname_resolution_queue.opened? &&
-                (current_clocktime >= hostname_resolution_expires_at)
-              state = :timeout
-            else
-              # Wait for connection to be established or hostname resolution in next loop
-              connection_attempt_delay_expires_at = nil
-            end
+            resolution_store.add_resolved(family_name, result)
           end
         end
 
-        next
-      when :success
-        break connected_socket
-      when :failure
-        raise last_error
-      when :timeout
-        raise Errno::ETIMEDOUT, 'user specified timeout'
+        if resolution_store.resolved?(:ipv4)
+          if resolution_store.resolved?(:ipv6)
+            hostname_resolution_notifier = nil
+            resolution_delay_expires_at = nil
+            user_specified_resolv_timeout_at = nil
+          elsif resolution_store.resolved_successfully?(:ipv4)
+            resolution_delay_expires_at = now + RESOLUTION_DELAY
+          end
+        end
       end
-    end
 
-    if block_given?
-      begin
-        yield ret
-      ensure
-        ret.close
-      end
-    else
-      ret
-    end
-  ensure
-    if fast_fallback
-      hostname_resolution_threads.each do |thread|
-        thread&.exit
+      if expired?(now, user_specified_open_timeout_at)
+        raise(IO::TimeoutError, "user specified timeout for #{host}:#{port}")
       end
 
-      hostname_resolution_queue&.close_all
+      if resolution_store.empty_addrinfos?
+        if connecting_sockets.empty? && resolution_store.resolved_all_families?
+          if last_error_from_thread
+            raise last_error.class, last_error.message, cause: last_error
+          else
+            raise last_error
+          end
+        end
 
-      connecting_sockets.each do |connecting_socket|
-        connecting_socket.close unless connecting_socket.closed?
+        if (expired?(now, user_specified_resolv_timeout_at) || resolution_store.resolved_all_families?) &&
+           (expired?(now, user_specified_connect_timeout_at) || connecting_sockets.empty?)
+          raise(IO::TimeoutError, "user specified timeout for #{host}:#{port}")
+        end
       end
     end
-  end
-
-  def self.specified_family_name_and_next_state(hostname)
-    if    hostname.match?(IPV6_ADRESS_FORMAT)              then [:ipv6, :v6c]
-    elsif hostname.match?(/^([0-9]{1,3}\.){3}[0-9]{1,3}$/) then [:ipv4, :v4c]
-    end
-  end
-  private_class_method :specified_family_name_and_next_state
-
-  def self.hostname_resolution(family, host, port, hostname_resolution_queue)
-    begin
-      resolved_addrinfos = Addrinfo.getaddrinfo(host, port, ADDRESS_FAMILIES[family], :STREAM)
-      hostname_resolution_queue.add_resolved(family, resolved_addrinfos)
-    rescue => e
-      hostname_resolution_queue.add_error(family, e)
-    end
-  end
-  private_class_method :hostname_resolution
-
-  def self.second_to_timeout(ends_at)
-    return 0 unless ends_at
+  ensure
+    hostname_resolution_threads.each(&:exit).each(&:join)
 
-    remaining = (ends_at - current_clocktime)
-    remaining.negative? ? 0 : remaining
-  end
-  private_class_method :second_to_timeout
+    hostname_resolution_result&.close
 
-  def self.current_clocktime
-    Process.clock_gettime(Process::CLOCK_MONOTONIC)
+    connecting_sockets.each_key(&:close)
   end
-  private_class_method :current_clocktime
+  private_class_method :tcp_with_fast_fallback
 
-  class SelectableAddrinfos
-    PRIORITY_ON_V6 = [:ipv6, :ipv4]
-    PRIORITY_ON_V4 = [:ipv4, :ipv6]
-
-    def initialize
-      @addrinfo_dict = {}
-      @last_family = nil
-    end
+  def self.tcp_without_fast_fallback(host, port, local_host, local_port, connect_timeout:, resolv_timeout:, open_timeout:)
+    last_error = nil
+    ret = nil
 
-    def add(family_name, addrinfos)
-      @addrinfo_dict[family_name] = addrinfos
+    local_addr_list = nil
+    if local_host != nil || local_port != nil
+      local_addr_list = Addrinfo.getaddrinfo(local_host, local_port, nil, :STREAM, nil, timeout: open_timeout || resolv_timeout)
     end
 
-    def get
-      return nil if empty?
+    timeout = open_timeout ? open_timeout : resolv_timeout
+    starts_at = current_clock_time
 
-      if @addrinfo_dict.size == 1
-        @addrinfo_dict.each { |_, addrinfos| return addrinfos.shift }
+    Addrinfo.foreach(host, port, nil, :STREAM, timeout:) {|ai|
+      if local_addr_list
+        local_addr = local_addr_list.find {|local_ai| local_ai.afamily == ai.afamily }
+        next unless local_addr
+      else
+        local_addr = nil
       end
+      begin
+        timeout =
+          if open_timeout
+            t = open_timeout - (current_clock_time - starts_at)
+            t.negative? ? 0 : t
+          else
+            connect_timeout
+          end
 
-      precedences = case @last_family
-                    when :ipv4, nil then PRIORITY_ON_V6
-                    when :ipv6      then PRIORITY_ON_V4
-                    end
-
-      precedences.each do |family_name|
-        addrinfo = @addrinfo_dict[family_name]&.shift
-        next unless addrinfo
-
-        @last_family = family_name
-        return addrinfo
+        sock = local_addr ?
+          ai.connect_from(local_addr, timeout:) :
+          ai.connect(timeout:)
+      rescue SystemCallError
+        last_error = $!
+        next
+      end
+      ret = sock
+      break
+    }
+    unless ret
+      if last_error
+        raise last_error
+      else
+        raise SocketError, "no appropriate local address"
       end
     end
 
-    def empty?
-      @addrinfo_dict.all? { |_, addrinfos| addrinfos.empty? }
-    end
-
-    def any?
-      !empty?
-    end
+    ret
   end
-  private_constant :SelectableAddrinfos
-
-  class NoHostnameResolutionQueue
-    def waiting_pipe
-      nil
-    end
+  private_class_method :tcp_without_fast_fallback
 
-    def add_resolved(_, _)
-      raise StandardError, "This #{self.class} cannot respond to:"
-    end
+  def self.ip_address?(hostname)
+    hostname.match?(IPV6_ADDRESS_FORMAT) || hostname.match?(/\A([0-9]{1,3}\.){3}[0-9]{1,3}\z/)
+  end
+  private_class_method :ip_address?
 
-    def add_error(_, _)
-      raise StandardError, "This #{self.class} cannot respond to:"
+  def self.resolve_hostname(family, host, port, hostname_resolution_result)
+    begin
+      resolved_addrinfos = Addrinfo.getaddrinfo(host, port, ADDRESS_FAMILIES[family], :STREAM)
+      hostname_resolution_result.add(family, resolved_addrinfos)
+    rescue => e
+      hostname_resolution_result.add(family, e)
     end
+  end
+  private_class_method :resolve_hostname
 
-    def get
-      nil
-    end
+  def self.current_clock_time
+    Process.clock_gettime(Process::CLOCK_MONOTONIC)
+  end
+  private_class_method :current_clock_time
 
-    def opened?
-      false
-    end
+  def self.second_to_timeout(started_at, ends_at)
+    return nil if ends_at == Float::INFINITY || ends_at.nil?
 
-    def closed?
-      true
-    end
+    remaining = (ends_at - started_at)
+    remaining.negative? ? 0 : remaining
+  end
+  private_class_method :second_to_timeout
 
-    def close_all
-      # Do nothing
-    end
+  def self.expired?(started_at, ends_at)
+    second_to_timeout(started_at, ends_at)&.zero?
   end
-  private_constant :NoHostnameResolutionQueue
+  private_class_method :expired?
 
-  class HostnameResolutionQueue
+  class HostnameResolutionResult
     def initialize(size)
       @size = size
       @taken_count = 0
       @rpipe, @wpipe = IO.pipe
-      @queue = Queue.new
+      @results = []
       @mutex = Mutex.new
     end
 
-    def waiting_pipe
+    def notifier
       [@rpipe]
     end
 
-    def add_resolved(family, resolved_addrinfos)
+    def add(family, result)
       @mutex.synchronize do
-        @queue.push [family, resolved_addrinfos]
-        @wpipe.putc HOSTNAME_RESOLUTION_QUEUE_UPDATED
-      end
-    end
-
-    def add_error(family, error)
-      @mutex.synchronize do
-        @queue.push [family, error]
+        @results.push [family, result]
         @wpipe.putc HOSTNAME_RESOLUTION_QUEUE_UPDATED
       end
     end
 
     def get
-      return nil if @queue.empty?
+      return nil if @results.empty?
 
       res = nil
 
       @mutex.synchronize do
         @rpipe.getbyte
-        res = @queue.pop
+        res = @results.shift
       end
 
       @taken_count += 1
-      close_all if @taken_count == @size
+      close if @taken_count == @size
       res
     end
 
-    def closed?
-      @rpipe.closed?
+    def close
+      @rpipe.close
+      @wpipe.close
     end
+  end
+  private_constant :HostnameResolutionResult
 
-    def opened?
-      !closed?
-    end
+  class HostnameResolutionStore
+    PRIORITY_ON_V6 = [:ipv6, :ipv4].freeze
+    PRIORITY_ON_V4 = [:ipv4, :ipv6].freeze
 
-    def close_all
-      @queue.close unless @queue.closed?
-      @rpipe.close unless @rpipe.closed?
-      @wpipe.close unless @wpipe.closed?
+    def initialize(family_names)
+      @family_names = family_names
+      @addrinfo_dict = {}
+      @error_dict = {}
+      @last_family = nil
     end
-  end
-  private_constant :HostnameResolutionQueue
 
-  class ConnectingSockets
-    def initialize
-      @socket_dict = {}
+    def add_resolved(family_name, addrinfos)
+      @addrinfo_dict[family_name] = addrinfos
     end
 
-    def all
-      @socket_dict.keys
+    def add_error(family_name, error)
+      @addrinfo_dict[family_name] = []
+      @error_dict[family_name] = error
     end
 
-    def add(socket, addrinfo)
-      @socket_dict[socket] = addrinfo
-    end
+    def get_addrinfo
+      precedences =
+        case @last_family
+        when :ipv4, nil then PRIORITY_ON_V6
+        when :ipv6      then PRIORITY_ON_V4
+        end
+
+      precedences.each do |family_name|
+        addrinfo = @addrinfo_dict[family_name]&.shift
+        next unless addrinfo
+
+        @last_family = family_name
+        return addrinfo
+      end
 
-    def delete(socket)
-      @socket_dict.delete socket
+      nil
     end
 
-    def empty?
-      @socket_dict.empty?
+    def empty_addrinfos?
+      @addrinfo_dict.all? { |_, addrinfos| addrinfos.empty? }
     end
 
-    def each
-      @socket_dict.keys.each do |socket|
-        yield socket
-      end
+    def any_addrinfos?
+      !empty_addrinfos?
     end
-  end
-  private_constant :ConnectingSockets
 
-  def self.tcp_without_fast_fallback(host, port, local_host, local_port, connect_timeout:, resolv_timeout:, &block)
-    last_error = nil
-    ret = nil
+    def resolved?(family)
+      @addrinfo_dict.has_key? family
+    end
 
-    local_addr_list = nil
-    if local_host != nil || local_port != nil
-      local_addr_list = Addrinfo.getaddrinfo(local_host, local_port, nil, :STREAM, nil)
+    def resolved_successfully?(family)
+      resolved?(family) && !@error_dict[family]
     end
 
-    Addrinfo.foreach(host, port, nil, :STREAM, timeout: resolv_timeout) {|ai|
-      if local_addr_list
-        local_addr = local_addr_list.find {|local_ai| local_ai.afamily == ai.afamily }
-        next unless local_addr
-      else
-        local_addr = nil
-      end
-      begin
-        sock = local_addr ?
-          ai.connect_from(local_addr, timeout: connect_timeout) :
-          ai.connect(timeout: connect_timeout)
-      rescue SystemCallError
-        last_error = $!
-        next
-      end
-      ret = sock
-      break
-    }
-    unless ret
-      if last_error
-        raise last_error
-      else
-        raise SocketError, "no appropriate local address"
-      end
+    def resolved_all_families?
+      (@family_names - @addrinfo_dict.keys).empty?
     end
-    if block_given?
-      begin
-        yield ret
-      ensure
-        ret.close
-      end
-    else
-      ret
+
+    def any_unresolved_family?
+      !resolved_all_families?
     end
   end
-  private_class_method :tcp_without_fast_fallback
+  private_constant :HostnameResolutionStore
 
-  # :stopdoc:
   def self.ip_sockets_port0(ai_list, reuseaddr)
     sockets = []
     begin
@@ -1211,9 +1153,7 @@ class Socket < BasicSocket
     end
     sockets
   end
-  class << self
-    private :ip_sockets_port0
-  end
+  private_class_method :ip_sockets_port0
 
   def self.tcp_server_sockets_port0(host)
     ai_list = Addrinfo.getaddrinfo(host, 0, nil, :STREAM, nil, Socket::AI_PASSIVE)
@@ -1641,13 +1581,18 @@ class Socket < BasicSocket
     end
   end
 
-  class << self
-    private
-
-    def unix_socket_abstract_name?(path)
-      /linux/ =~ RUBY_PLATFORM && /\A(\0|\z)/ =~ path
+  # :stopdoc:
+  if RUBY_PLATFORM.include?("linux")
+    def self.unix_socket_abstract_name?(path)
+      path.empty? or path.start_with?("\0")
+    end
+  else
+    def self.unix_socket_abstract_name?(path)
+      false
     end
   end
+  private_class_method :unix_socket_abstract_name?
+  # :startdoc:
 
   # creates a UNIX socket server on _path_.
   # It calls the block for each socket accepted.
@@ -1687,7 +1632,7 @@ class Socket < BasicSocket
   # Returns 0 if successful, otherwise an exception is raised.
   #
   # === Parameter
-  #  # +remote_sockaddr+ - the +struct+ sockaddr contained in a string or Addrinfo object
+  # * +remote_sockaddr+ - the +struct+ sockaddr contained in a string or Addrinfo object
   #
   # === Example:
   #   # Pull down Google's web page
@@ -1722,7 +1667,7 @@ class Socket < BasicSocket
   # return the symbol +:wait_writable+ instead.
   #
   # === See
-  #  # Socket#connect
+  # * Socket#connect
   def connect_nonblock(addr, exception: true)
     __connect_nonblock(addr, exception)
   end
diff --git a/ext/socket/raddrinfo.c b/ext/socket/raddrinfo.c
index 090ba1a0c0..f1fbcc35de 100644
--- a/ext/socket/raddrinfo.c
+++ b/ext/socket/raddrinfo.c
@@ -277,8 +277,9 @@ numeric_getaddrinfo(const char *node, const char *service,
 void
 rb_freeaddrinfo(struct rb_addrinfo *ai)
 {
-    if (!ai->allocated_by_malloc)
-        freeaddrinfo(ai->ai);
+    if (!ai->allocated_by_malloc) {
+        if (ai->ai) freeaddrinfo(ai->ai);
+    }
     else {
         struct addrinfo *ai1, *ai2;
         ai1 = ai->ai;
@@ -292,10 +293,22 @@ rb_freeaddrinfo(struct rb_addrinfo *ai)
     xfree(ai);
 }
 
+static int
+rsock_value_timeout_to_msec(VALUE timeout)
+{
+    double seconds = NUM2DBL(timeout);
+    if (seconds < 0) rb_raise(rb_eArgError, "timeout must not be negative");
+
+    double msec = seconds * 1000.0;
+    if (msec > UINT_MAX) rb_raise(rb_eArgError, "timeout too large");
+
+    return (unsigned int)(msec + 0.5);
+}
+
 #if GETADDRINFO_IMPL == 0
 
 static int
-rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai)
+rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai, int _timeout)
 {
     return getaddrinfo(hostp, portp, hints, ai);
 }
@@ -326,8 +339,14 @@ nogvl_getaddrinfo(void *arg)
     return (void *)(VALUE)ret;
 }
 
+static void *
+fork_safe_getaddrinfo(void *arg)
+{
+    return rb_thread_prevent_fork(nogvl_getaddrinfo, arg);
+}
+
 static int
-rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai)
+rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai, int _timeout)
 {
     struct getaddrinfo_arg arg;
     MEMZERO(&arg, struct getaddrinfo_arg, 1);
@@ -335,7 +354,7 @@ rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hint
     arg.service = portp;
     arg.hints = hints;
     arg.res = ai;
-    return (int)(VALUE)rb_thread_call_without_gvl(nogvl_getaddrinfo, &arg, RUBY_UBF_IO, 0);
+    return (int)(VALUE)rb_thread_call_without_gvl(fork_safe_getaddrinfo, &arg, RUBY_UBF_IO, 0);
 }
 
 #elif GETADDRINFO_IMPL == 2
@@ -345,13 +364,14 @@ struct getaddrinfo_arg
     char *node, *service;
     struct addrinfo hints;
     struct addrinfo *ai;
-    int err, gai_errno, refcount, done, cancelled;
+    int err, gai_errno, refcount, done, cancelled, timedout;
     rb_nativethread_lock_t lock;
     rb_nativethread_cond_t cond;
+    int timeout;
 };
 
 static struct getaddrinfo_arg *
-allocate_getaddrinfo_arg(const char *hostp, const char *portp, const struct addrinfo *hints)
+allocate_getaddrinfo_arg(const char *hostp, const char *portp, const struct addrinfo *hints, int timeout)
 {
     size_t hostp_offset = sizeof(struct getaddrinfo_arg);
     size_t portp_offset = hostp_offset + (hostp ? strlen(hostp) + 1 : 0);
@@ -367,7 +387,7 @@ allocate_getaddrinfo_arg(const char *hostp, const char *portp, const struct addr
 
     if (hostp) {
         arg->node = buf + hostp_offset;
-        strcpy(arg->node, hostp);
+        memcpy(arg->node, hostp, portp_offset - hostp_offset);
     }
     else {
         arg->node = NULL;
@@ -375,7 +395,7 @@ allocate_getaddrinfo_arg(const char *hostp, const char *portp, const struct addr
 
     if (portp) {
         arg->service = buf + portp_offset;
-        strcpy(arg->service, portp);
+        memcpy(arg->service, portp, bufsize - portp_offset);
     }
     else {
         arg->service = NULL;
@@ -385,7 +405,8 @@ allocate_getaddrinfo_arg(const char *hostp, const char *portp, const struct addr
     arg->ai = NULL;
 
     arg->refcount = 2;
-    arg->done = arg->cancelled = 0;
+    arg->done = arg->cancelled = arg->timedout = 0;
+    arg->timeout = timeout;
 
     rb_nativethread_lock_initialize(&arg->lock);
     rb_native_cond_initialize(&arg->cond);
@@ -423,7 +444,7 @@ do_getaddrinfo(void *ptr)
         arg->err = err;
         arg->gai_errno = gai_errno;
         if (arg->cancelled) {
-            freeaddrinfo(arg->ai);
+            if (arg->ai) freeaddrinfo(arg->ai);
         }
         else {
             arg->done = 1;
@@ -444,7 +465,19 @@ wait_getaddrinfo(void *ptr)
     struct getaddrinfo_arg *arg = (struct getaddrinfo_arg *)ptr;
     rb_nativethread_lock_lock(&arg->lock);
     while (!arg->done && !arg->cancelled) {
-        rb_native_cond_wait(&arg->cond, &arg->lock);
+        long msec = arg->timeout;
+        if (msec == 0) {
+            arg->cancelled = 1;
+            arg->timedout = 1;
+        } else if (msec > 0) {
+            rb_native_cond_timedwait(&arg->cond, &arg->lock, msec);
+            if (!arg->done) {
+                arg->cancelled = 1;
+                arg->timedout = 1;
+            }
+        } else {
+            rb_native_cond_wait(&arg->cond, &arg->lock);
+        }
     }
     rb_nativethread_lock_unlock(&arg->lock);
     return 0;
@@ -462,43 +495,84 @@ cancel_getaddrinfo(void *ptr)
     rb_nativethread_lock_unlock(&arg->lock);
 }
 
-static int
-do_pthread_create(pthread_t *th, void *(*start_routine) (void *), void *arg)
+int
+raddrinfo_pthread_create(pthread_t *th, void *(*start_routine) (void *), void *arg)
 {
     int limit = 3, ret;
+    int saved_errno;
+#ifdef HAVE_PTHREAD_ATTR_SETDETACHSTATE
+    pthread_attr_t attr;
+    pthread_attr_t *attr_p = &attr;
+    int err;
+    int init_retries = 0;
+    int init_retries_max = 3;
+retry_attr_init:
+    if ((err = pthread_attr_init(attr_p)) != 0) {
+        if (err == ENOMEM && init_retries < init_retries_max) {
+            init_retries++;
+            rb_gc();
+            goto retry_attr_init;
+        }
+        return err;
+    }
+    if ((err = pthread_attr_setdetachstate(attr_p, PTHREAD_CREATE_DETACHED)) != 0) {
+        saved_errno = errno;
+        pthread_attr_destroy(attr_p);
+        errno = saved_errno;
+        return err; // EINVAL - shouldn't happen
+    }
+#else
+    pthread_attr_t *attr_p = NULL;
+#endif
     do {
         // It is said that pthread_create may fail spuriously, so we follow the JDK and retry several times.
         //
         // https://bugs.openjdk.org/browse/JDK-8268605
         // https://github.com/openjdk/jdk/commit/e35005d5ce383ddd108096a3079b17cb0bcf76f1
-        ret = pthread_create(th, 0, start_routine, arg);
+        ret = pthread_create(th, attr_p, start_routine, arg);
     } while (ret == EAGAIN && limit-- > 0);
+#ifdef HAVE_PTHREAD_ATTR_SETDETACHSTATE
+    saved_errno = errno;
+    pthread_attr_destroy(attr_p);
+    if (ret != 0) {
+        errno = saved_errno;
+    }
+#else
+    if (ret == 0) {
+        pthread_detach(th); // this can race with shutdown routine of thread in some glibc versions
+    }
+#endif
     return ret;
 }
 
+static void *
+fork_safe_do_getaddrinfo(void *ptr)
+{
+    return rb_thread_prevent_fork(do_getaddrinfo, ptr);
+}
+
 static int
-rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai)
+rb_getaddrinfo(const char *hostp, const char *portp, const struct addrinfo *hints, struct addrinfo **ai, int timeout)
 {
     int retry;
     struct getaddrinfo_arg *arg;
-    int err = 0, gai_errno = 0;
+    int err = 0, gai_errno = 0, timedout = 0;
 
 start:
     retry = 0;
 
-    arg = allocate_getaddrinfo_arg(hostp, portp, hints);
+    arg = allocate_getaddrinfo_arg(hostp, portp, hints, timeout);
     if (!arg) {
         return EAI_MEMORY;
     }
 
     pthread_t th;
-    if (do_pthread_create(&th, do_getaddrinfo, arg) != 0) {
+    if (raddrinfo_pthread_create(&th, fork_safe_do_getaddrinfo, arg) != 0) {
         int err = errno;
         free_getaddrinfo_arg(arg);
         errno = err;
         return EAI_SYSTEM;
     }
-    pthread_detach(th);
 
     rb_thread_call_without_gvl2(wait_getaddrinfo, arg, cancel_getaddrinfo, arg);
 
@@ -511,7 +585,8 @@ start:
             if (err == 0) *ai = arg->ai;
         }
         else if (arg->cancelled) {
-            err = EAI_AGAIN;
+            retry = 1;
+            timedout = arg->timedout;
         }
         else {
             // If already interrupted, rb_thread_call_without_gvl2 may return without calling wait_getaddrinfo.
@@ -525,6 +600,12 @@ start:
 
     if (need_free) free_getaddrinfo_arg(arg);
 
+    if (timedout) {
+        VALUE host = rb_str_new_cstr(hostp);
+        VALUE port = rb_str_new_cstr(portp);
+        rsock_raise_user_specified_timeout(NULL, host, port);
+    }
+
     // If the current thread is interrupted by asynchronous exception, the following raises the exception.
     // But if the current thread is interrupted by timer thread, the following returns; we need to manually retry.
     rb_thread_check_ints();
@@ -539,6 +620,10 @@ start:
 
 #endif
 
+#define GETNAMEINFO_WONT_BLOCK(host, serv, flags) \
+    ((!(host) || ((flags) & NI_NUMERICHOST)) && \
+     (!(serv) || ((flags) & NI_NUMERICSERV)))
+
 #if GETADDRINFO_IMPL == 0
 
 int
@@ -546,7 +631,7 @@ rb_getnameinfo(const struct sockaddr *sa, socklen_t salen,
            char *host, size_t hostlen,
            char *serv, size_t servlen, int flags)
 {
-    return getnameinfo(sa, salen, host, hostlen, serv, servlen, flags);
+    return getnameinfo(sa, salen, host, (socklen_t)hostlen, serv, (socklen_t)servlen, flags);
 }
 
 #elif GETADDRINFO_IMPL == 1
@@ -576,6 +661,10 @@ rb_getnameinfo(const struct sockaddr *sa, socklen_t salen,
                char *host, size_t hostlen,
                char *serv, size_t servlen, int flags)
 {
+    if (GETNAMEINFO_WONT_BLOCK(host, serv, flags)) {
+        return getnameinfo(sa, salen, host, hostlen, serv, servlen, flags);
+    }
+
     struct getnameinfo_arg arg;
     int ret;
     arg.sa = sa;
@@ -702,7 +791,11 @@ rb_getnameinfo(const struct sockaddr *sa, socklen_t salen,
 {
     int retry;
     struct getnameinfo_arg *arg;
-    int err, gni_errno = 0;
+    int err = 0, gni_errno = 0;
+
+    if (GETNAMEINFO_WONT_BLOCK(host, serv, flags)) {
+        return getnameinfo(sa, salen, host, (socklen_t)hostlen, serv, (socklen_t)servlen, flags);
+    }
 
 start:
     retry = 0;
@@ -713,13 +806,12 @@ start:
     }
 
     pthread_t th;
-    if (do_pthread_create(&th, do_getnameinfo, arg) != 0) {
+    if (raddrinfo_pthread_create(&th, do_getnameinfo, arg) != 0) {
         int err = errno;
         free_getnameinfo_arg(arg);
         errno = err;
         return EAI_SYSTEM;
     }
-    pthread_detach(th);
 
     rb_thread_call_without_gvl2(wait_getnameinfo, arg, cancel_getnameinfo, arg);
 
@@ -734,7 +826,7 @@ start:
         }
     }
     else if (arg->cancelled) {
-        err = EAI_AGAIN;
+        retry = 1;
     }
     else {
         // If already interrupted, rb_thread_call_without_gvl2 may return without calling wait_getnameinfo.
@@ -809,8 +901,8 @@ str_is_number(const char *p)
     ((ptr)[0] == name[0] && \
      rb_strlen_lit(name) == (len) && memcmp(ptr, name, len) == 0)
 
-static char*
-host_str(VALUE host, char *hbuf, size_t hbuflen, int *flags_ptr)
+char*
+raddrinfo_host_str(VALUE host, char *hbuf, size_t hbuflen, int *flags_ptr)
 {
     if (NIL_P(host)) {
         return NULL;
@@ -848,8 +940,8 @@ host_str(VALUE host, char *hbuf, size_t hbuflen, int *flags_ptr)
     }
 }
 
-static char*
-port_str(VALUE port, char *pbuf, size_t pbuflen, int *flags_ptr)
+char*
+raddrinfo_port_str(VALUE port, char *pbuf, size_t pbuflen, int *flags_ptr)
 {
     if (NIL_P(port)) {
         return 0;
@@ -901,7 +993,7 @@ rb_scheduler_getaddrinfo(VALUE scheduler, VALUE host, const char *service,
 
     for(i=0; i<len; i++) {
         ip_address = rb_ary_entry(ip_addresses_array, i);
-        hostp = host_str(ip_address, _hbuf, sizeof(_hbuf), &_additional_flags);
+        hostp = raddrinfo_host_str(ip_address, _hbuf, sizeof(_hbuf), &_additional_flags);
         error = numeric_getaddrinfo(hostp, service, hints, &ai);
         if (error == 0) {
             if (!res_allocated) {
@@ -928,7 +1020,7 @@ rb_scheduler_getaddrinfo(VALUE scheduler, VALUE host, const char *service,
 }
 
 struct rb_addrinfo*
-rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_hack)
+rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_hack, VALUE timeout)
 {
     struct rb_addrinfo* res = NULL;
     struct addrinfo *ai;
@@ -937,8 +1029,8 @@ rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_h
     char hbuf[NI_MAXHOST], pbuf[NI_MAXSERV];
     int additional_flags = 0;
 
-    hostp = host_str(host, hbuf, sizeof(hbuf), &additional_flags);
-    portp = port_str(port, pbuf, sizeof(pbuf), &additional_flags);
+    hostp = raddrinfo_host_str(host, hbuf, sizeof(hbuf), &additional_flags);
+    portp = raddrinfo_port_str(port, pbuf, sizeof(pbuf), &additional_flags);
 
     if (socktype_hack && hints->ai_socktype == 0 && str_is_number(portp)) {
         hints->ai_socktype = SOCK_DGRAM;
@@ -963,7 +1055,8 @@ rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_h
         }
 
         if (!resolved) {
-            error = rb_getaddrinfo(hostp, portp, hints, &ai);
+            int t = NIL_P(timeout) ? -1 : rsock_value_timeout_to_msec(timeout);
+            error = rb_getaddrinfo(hostp, portp, hints, &ai, t);
             if (error == 0) {
                 res = (struct rb_addrinfo *)xmalloc(sizeof(struct rb_addrinfo));
                 res->allocated_by_malloc = 0;
@@ -996,7 +1089,7 @@ rsock_fd_family(int fd)
 }
 
 struct rb_addrinfo*
-rsock_addrinfo(VALUE host, VALUE port, int family, int socktype, int flags)
+rsock_addrinfo(VALUE host, VALUE port, int family, int socktype, int flags, VALUE timeout)
 {
     struct addrinfo hints;
 
@@ -1004,7 +1097,7 @@ rsock_addrinfo(VALUE host, VALUE port, int family, int socktype, int flags)
     hints.ai_family = family;
     hints.ai_socktype = socktype;
     hints.ai_flags = flags;
-    return rsock_getaddrinfo(host, port, &hints, 1);
+    return rsock_getaddrinfo(host, port, &hints, 1, timeout);
 }
 
 VALUE
@@ -1124,7 +1217,7 @@ make_hostent_internal(VALUE v)
         hostp = addr->ai_canonname;
     }
     else {
-        hostp = host_str(host, hbuf, sizeof(hbuf), NULL);
+        hostp = raddrinfo_host_str(host, hbuf, sizeof(hbuf), NULL);
     }
     rb_ary_push(ary, rb_str_new2(hostp));
 
@@ -1198,6 +1291,7 @@ addrinfo_memsize(const void *ptr)
 static const rb_data_type_t addrinfo_type = {
     "socket/addrinfo",
     {addrinfo_mark, addrinfo_free, addrinfo_memsize,},
+    0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_FROZEN_SHAREABLE | RUBY_TYPED_WB_PROTECTED,
 };
 
 static VALUE
@@ -1235,7 +1329,7 @@ alloc_addrinfo(void)
 }
 
 static void
-init_addrinfo(rb_addrinfo_t *rai, struct sockaddr *sa, socklen_t len,
+init_addrinfo(VALUE self, rb_addrinfo_t *rai, struct sockaddr *sa, socklen_t len,
               int pfamily, int socktype, int protocol,
               VALUE canonname, VALUE inspectname)
 {
@@ -1247,8 +1341,8 @@ init_addrinfo(rb_addrinfo_t *rai, struct sockaddr *sa, socklen_t len,
     rai->pfamily = pfamily;
     rai->socktype = socktype;
     rai->protocol = protocol;
-    rai->canonname = canonname;
-    rai->inspectname = inspectname;
+    RB_OBJ_WRITE(self, &rai->canonname, canonname);
+    RB_OBJ_WRITE(self, &rai->inspectname, inspectname);
 }
 
 VALUE
@@ -1261,7 +1355,7 @@ rsock_addrinfo_new(struct sockaddr *addr, socklen_t len,
 
     a = addrinfo_s_allocate(rb_cAddrinfo);
     DATA_PTR(a) = rai = alloc_addrinfo();
-    init_addrinfo(rai, addr, len, family, socktype, protocol, canonname, inspectname);
+    init_addrinfo(a, rai, addr, len, family, socktype, protocol, canonname, inspectname);
     return a;
 }
 
@@ -1286,7 +1380,7 @@ call_getaddrinfo(VALUE node, VALUE service,
         hints.ai_flags = NUM2INT(flags);
     }
 
-    res = rsock_getaddrinfo(node, service, &hints, socktype_hack);
+    res = rsock_getaddrinfo(node, service, &hints, socktype_hack, timeout);
 
     if (res == NULL)
         rb_raise(rb_eSocket, "host not found");
@@ -1296,7 +1390,7 @@ call_getaddrinfo(VALUE node, VALUE service,
 static VALUE make_inspectname(VALUE node, VALUE service, struct addrinfo *res);
 
 static void
-init_addrinfo_getaddrinfo(rb_addrinfo_t *rai, VALUE node, VALUE service,
+init_addrinfo_getaddrinfo(VALUE self, rb_addrinfo_t *rai, VALUE node, VALUE service,
                           VALUE family, VALUE socktype, VALUE protocol, VALUE flags,
                           VALUE inspectnode, VALUE inspectservice)
 {
@@ -1310,7 +1404,7 @@ init_addrinfo_getaddrinfo(rb_addrinfo_t *rai, VALUE node, VALUE service,
         OBJ_FREEZE(canonname);
     }
 
-    init_addrinfo(rai, res->ai->ai_addr, res->ai->ai_addrlen,
+    init_addrinfo(self, rai, res->ai->ai_addr, res->ai->ai_addrlen,
                   NUM2INT(family), NUM2INT(socktype), NUM2INT(protocol),
                   canonname, inspectname);
 
@@ -1422,7 +1516,7 @@ addrinfo_list_new(VALUE node, VALUE service, VALUE family, VALUE socktype, VALUE
 
 #ifdef HAVE_TYPE_STRUCT_SOCKADDR_UN
 static void
-init_unix_addrinfo(rb_addrinfo_t *rai, VALUE path, int socktype)
+init_unix_addrinfo(VALUE self, rb_addrinfo_t *rai, VALUE path, int socktype)
 {
     struct sockaddr_un un;
     socklen_t len;
@@ -1438,7 +1532,7 @@ init_unix_addrinfo(rb_addrinfo_t *rai, VALUE path, int socktype)
     memcpy((void*)&un.sun_path, RSTRING_PTR(path), RSTRING_LEN(path));
 
     len = rsock_unix_sockaddr_len(path);
-    init_addrinfo(rai, (struct sockaddr *)&un, len,
+    init_addrinfo(self, rai, (struct sockaddr *)&un, len,
                   PF_UNIX, socktype, 0, Qnil, Qnil);
 }
 
@@ -1542,7 +1636,7 @@ addrinfo_initialize(int argc, VALUE *argv, VALUE self)
             flags |= AI_NUMERICSERV;
 #endif
 
-            init_addrinfo_getaddrinfo(rai, numericnode, service,
+            init_addrinfo_getaddrinfo(self, rai, numericnode, service,
                     INT2NUM(i_pfamily ? i_pfamily : af), INT2NUM(i_socktype), INT2NUM(i_protocol),
                     INT2NUM(flags),
                     nodename, service);
@@ -1554,7 +1648,7 @@ addrinfo_initialize(int argc, VALUE *argv, VALUE self)
           {
             VALUE path = rb_ary_entry(sockaddr_ary, 1);
             StringValue(path);
-            init_unix_addrinfo(rai, path, SOCK_STREAM);
+            init_unix_addrinfo(self, rai, path, SOCK_STREAM);
             break;
           }
 #endif
@@ -1567,7 +1661,7 @@ addrinfo_initialize(int argc, VALUE *argv, VALUE self)
         StringValue(sockaddr_arg);
         sockaddr_ptr = (struct sockaddr *)RSTRING_PTR(sockaddr_arg);
         sockaddr_len = RSTRING_SOCKLEN(sockaddr_arg);
-        init_addrinfo(rai, sockaddr_ptr, sockaddr_len,
+        init_addrinfo(self, rai, sockaddr_ptr, sockaddr_len,
                       i_pfamily, i_socktype, i_protocol,
                       canonname, inspectname);
     }
@@ -2156,7 +2250,7 @@ addrinfo_mload(VALUE self, VALUE ary)
     }
 
     DATA_PTR(self) = rai = alloc_addrinfo();
-    init_addrinfo(rai, &ss.addr, len,
+    init_addrinfo(self, rai, &ss.addr, len,
                   pfamily, socktype, protocol,
                   canonname, inspectname);
     return self;
@@ -2924,7 +3018,7 @@ addrinfo_s_unix(int argc, VALUE *argv, VALUE self)
 
     addr = addrinfo_s_allocate(rb_cAddrinfo);
     DATA_PTR(addr) = rai = alloc_addrinfo();
-    init_unix_addrinfo(rai, path, socktype);
+    init_unix_addrinfo(self, rai, path, socktype);
     return addr;
 }
 
@@ -3011,6 +3105,99 @@ rsock_io_socket_addrinfo(VALUE io, struct sockaddr *addr, socklen_t len)
     UNREACHABLE_RETURN(Qnil);
 }
 
+#if FAST_FALLBACK_INIT_INETSOCK_IMPL == 1
+
+void
+free_fast_fallback_getaddrinfo_shared(struct fast_fallback_getaddrinfo_shared **shared)
+{
+    xfree((*shared)->node);
+    (*shared)->node = NULL;
+    xfree((*shared)->service);
+    (*shared)->service = NULL;
+    rb_nativethread_lock_destroy(&(*shared)->lock);
+    free(*shared);
+    *shared = NULL;
+}
+
+static void *
+do_fast_fallback_getaddrinfo(void *ptr)
+{
+    struct fast_fallback_getaddrinfo_entry *entry = (struct fast_fallback_getaddrinfo_entry *)ptr;
+    struct fast_fallback_getaddrinfo_shared *shared = entry->shared;
+    int err = 0, shared_need_free = 0;
+    struct addrinfo *ai = NULL;
+
+    sigset_t set;
+    sigemptyset(&set);
+    sigaddset(&set, SIGPIPE);
+    pthread_sigmask(SIG_BLOCK, &set, NULL);
+
+    err = numeric_getaddrinfo(shared->node, shared->service, &entry->hints, &entry->ai);
+
+    if (err != 0) {
+        err = getaddrinfo(shared->node, shared->service, &entry->hints, &entry->ai);
+       #ifdef __linux__
+       /* On Linux (mainly Ubuntu 13.04) /etc/nsswitch.conf has mdns4 and
+        * it cause getaddrinfo to return EAI_SYSTEM/ENOENT. [ruby-list:49420]
+        */
+       if (err == EAI_SYSTEM && errno == ENOENT)
+           err = EAI_NONAME;
+       #endif
+    }
+
+    /* for testing HEv2 */
+    if (entry->test_sleep_ms > 0) {
+        struct timespec sleep_ts;
+        sleep_ts.tv_sec = entry->test_sleep_ms / 1000;
+        sleep_ts.tv_nsec = (entry->test_sleep_ms % 1000) * 1000000L;
+        if (sleep_ts.tv_nsec >= 1000000000L) {
+            sleep_ts.tv_sec += sleep_ts.tv_nsec / 1000000000L;
+            sleep_ts.tv_nsec = sleep_ts.tv_nsec % 1000000000L;
+        }
+        nanosleep(&sleep_ts, NULL);
+    }
+    if (entry->test_ecode != 0) {
+        err = entry->test_ecode;
+        if (entry->ai) {
+            freeaddrinfo(entry->ai);
+            entry->ai = NULL;
+        }
+    }
+
+    rb_nativethread_lock_lock(&shared->lock);
+    {
+        entry->err = err;
+        const char notification = entry->family == AF_INET6 ?
+        IPV6_HOSTNAME_RESOLVED : IPV4_HOSTNAME_RESOLVED;
+
+        if (shared->notify != -1 && (write(shared->notify, &notification, 1)) < 0) {
+            entry->err = errno;
+            entry->has_syserr = true;
+        }
+        if (--(entry->refcount) == 0) {
+            ai = entry->ai;
+            entry->ai = NULL;
+        }
+        if (--(shared->refcount) == 0) shared_need_free = 1;
+    }
+    rb_nativethread_lock_unlock(&shared->lock);
+
+    if (ai) freeaddrinfo(ai);
+    if (shared_need_free && shared) {
+        free_fast_fallback_getaddrinfo_shared(&shared);
+    }
+
+    return 0;
+}
+
+void *
+fork_safe_do_fast_fallback_getaddrinfo(void *ptr)
+{
+    return rb_thread_prevent_fork(do_fast_fallback_getaddrinfo, ptr);
+}
+
+#endif
+
 /*
  * Addrinfo class
  */
diff --git a/ext/socket/rubysocket.h b/ext/socket/rubysocket.h
index f486db4262..2ec3ab335a 100644
--- a/ext/socket/rubysocket.h
+++ b/ext/socket/rubysocket.h
@@ -138,6 +138,7 @@
 
 #include "internal.h"
 #include "internal/array.h"
+#include "internal/compilers.h"
 #include "internal/error.h"
 #include "internal/gc.h"
 #include "internal/io.h"
@@ -291,15 +292,13 @@ extern VALUE rb_eResolution;
 #ifdef SOCKS
 extern VALUE rb_cSOCKSSocket;
 #  ifndef SOCKS5
-void SOCKSinit();
-int Rconnect();
+void SOCKSinit(char *);
+int Rconnect(int, const struct sockaddr *, socklen_t);
 #  endif
 #endif
 
 #include "constdefs.h"
 
-#define BLOCKING_REGION_FD(func, arg) (long)rb_thread_io_blocking_region((func), (arg), (arg)->fd)
-
 #define SockAddrStringValue(v) rsock_sockaddr_string_value(&(v))
 #define SockAddrStringValuePtr(v) rsock_sockaddr_string_value_ptr(&(v))
 #define SockAddrStringValueWithAddrinfo(v, rai_ret) rsock_sockaddr_string_value_with_addrinfo(&(v), &(rai_ret))
@@ -328,8 +327,8 @@ void rb_freeaddrinfo(struct rb_addrinfo *ai);
 VALUE rsock_freeaddrinfo(VALUE arg);
 int rb_getnameinfo(const struct sockaddr *sa, socklen_t salen, char *host, size_t hostlen, char *serv, size_t servlen, int flags);
 int rsock_fd_family(int fd);
-struct rb_addrinfo *rsock_addrinfo(VALUE host, VALUE port, int family, int socktype, int flags);
-struct rb_addrinfo *rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_hack);
+struct rb_addrinfo *rsock_addrinfo(VALUE host, VALUE port, int family, int socktype, int flags, VALUE timeout);
+struct rb_addrinfo *rsock_getaddrinfo(VALUE host, VALUE port, struct addrinfo *hints, int socktype_hack, VALUE timeout);
 
 VALUE rsock_fd_socket_addrinfo(int fd, struct sockaddr *addr, socklen_t len);
 VALUE rsock_io_socket_addrinfo(VALUE io, struct sockaddr *addr, socklen_t len);
@@ -356,7 +355,7 @@ int rsock_socket(int domain, int type, int proto);
 int rsock_detect_cloexec(int fd);
 VALUE rsock_init_sock(VALUE sock, int fd);
 VALUE rsock_sock_s_socketpair(int argc, VALUE *argv, VALUE klass);
-VALUE rsock_init_inetsock(VALUE sock, VALUE remote_host, VALUE remote_serv, VALUE local_host, VALUE local_serv, int type, VALUE resolv_timeout, VALUE connect_timeout);
+VALUE rsock_init_inetsock(VALUE sock, VALUE remote_host, VALUE remote_serv, VALUE local_host, VALUE local_serv, int type, VALUE resolv_timeout, VALUE connect_timeout, VALUE open_timeout, VALUE fast_fallback, VALUE test_mode_settings);
 VALUE rsock_init_unixsock(VALUE sock, VALUE path, int server);
 
 struct rsock_send_arg {
@@ -381,7 +380,7 @@ VALUE rsock_s_recvfrom_nonblock(VALUE sock, VALUE len, VALUE flg, VALUE str,
                                 VALUE ex, enum sock_recv_type from);
 VALUE rsock_s_recvfrom(VALUE sock, int argc, VALUE *argv, enum sock_recv_type from);
 
-int rsock_connect(int fd, const struct sockaddr *sockaddr, int len, int socks, struct timeval *timeout);
+int rsock_connect(VALUE self, const struct sockaddr *sockaddr, int len, int socks, VALUE timeout);
 
 VALUE rsock_s_accept(VALUE klass, VALUE io, struct sockaddr *sockaddr, socklen_t *len);
 VALUE rsock_s_accept_nonblock(VALUE klass, VALUE ex, rb_io_t *fptr,
@@ -415,6 +414,47 @@ ssize_t rsock_recvmsg(int socket, struct msghdr *message, int flags);
 void rsock_discard_cmsg_resource(struct msghdr *mh, int msg_peek_p);
 #endif
 
+char *raddrinfo_host_str(VALUE host, char *hbuf, size_t hbuflen, int *flags_ptr);
+char *raddrinfo_port_str(VALUE port, char *pbuf, size_t pbuflen, int *flags_ptr);
+
+#ifndef FAST_FALLBACK_INIT_INETSOCK_IMPL
+#  if !defined(HAVE_PTHREAD_CREATE) || !defined(HAVE_PTHREAD_DETACH) || defined(__MINGW32__) || defined(__MINGW64__)
+#    define FAST_FALLBACK_INIT_INETSOCK_IMPL 0
+#  else
+#    include "ruby/thread_native.h"
+#    define FAST_FALLBACK_INIT_INETSOCK_IMPL 1
+#    define IPV6_HOSTNAME_RESOLVED '1'
+#    define IPV4_HOSTNAME_RESOLVED '2'
+#    define SELECT_CANCELLED '3'
+
+struct fast_fallback_getaddrinfo_entry
+{
+    int family, err, refcount;
+    struct addrinfo hints;
+    struct addrinfo *ai;
+    struct fast_fallback_getaddrinfo_shared *shared;
+    int has_syserr;
+    long test_sleep_ms;
+    int test_ecode;
+};
+
+struct fast_fallback_getaddrinfo_shared
+{
+    int notify, refcount;
+    char *node, *service;
+    rb_nativethread_lock_t lock;
+    struct fast_fallback_getaddrinfo_entry getaddrinfo_entries[FLEX_ARY_LEN];
+};
+
+int raddrinfo_pthread_create(pthread_t *th, void *(*start_routine) (void *), void *arg);
+void *fork_safe_do_fast_fallback_getaddrinfo(void *ptr);
+void free_fast_fallback_getaddrinfo_entry(struct fast_fallback_getaddrinfo_entry **entry);
+void free_fast_fallback_getaddrinfo_shared(struct fast_fallback_getaddrinfo_shared **shared);
+#  endif
+#endif
+
+NORETURN(void rsock_raise_user_specified_timeout(struct addrinfo *ai, VALUE host, VALUE port));
+
 void rsock_init_basicsocket(void);
 void rsock_init_ipsocket(void);
 void rsock_init_tcpsocket(void);
@@ -463,12 +503,12 @@ void rsock_make_fd_nonblock(int fd);
 
 int rsock_is_dgram(rb_io_t *fptr);
 
+extern ID tcp_fast_fallback;
+
 #if !defined HAVE_INET_NTOP && ! defined _WIN32
 const char *inet_ntop(int, const void *, char *, size_t);
 #elif defined __MINGW32__
 # define inet_ntop(f,a,n,l)      rb_w32_inet_ntop(f,a,n,l)
-#elif defined _MSC_VER && RUBY_MSVCRT_VERSION < 90
-const char *WSAAPI inet_ntop(int, const void *, char *, size_t);
 #endif
 
 #endif
diff --git a/ext/socket/socket.c b/ext/socket/socket.c
index c780d77cf6..a8e5ae8119 100644
--- a/ext/socket/socket.c
+++ b/ext/socket/socket.c
@@ -14,6 +14,8 @@ static VALUE sym_wait_writable;
 
 static VALUE sock_s_unpack_sockaddr_in(VALUE, VALUE);
 
+ID tcp_fast_fallback;
+
 void
 rsock_sys_fail_host_port(const char *mesg, VALUE host, VALUE port)
 {
@@ -387,22 +389,20 @@ rsock_sock_s_socketpair(int argc, VALUE *argv, VALUE klass)
  * * connect function in Microsoft's Winsock functions reference
  */
 static VALUE
-sock_connect(VALUE sock, VALUE addr)
+sock_connect(VALUE self, VALUE addr)
 {
     VALUE rai;
-    rb_io_t *fptr;
-    int fd, n;
 
     SockAddrStringValueWithAddrinfo(addr, rai);
     addr = rb_str_new4(addr);
-    GetOpenFile(sock, fptr);
-    fd = fptr->fd;
-    n = rsock_connect(fd, (struct sockaddr*)RSTRING_PTR(addr), RSTRING_SOCKLEN(addr), 0, NULL);
-    if (n < 0) {
+
+    int result = rsock_connect(self, (struct sockaddr*)RSTRING_PTR(addr), RSTRING_SOCKLEN(addr), 0, RUBY_IO_TIMEOUT_DEFAULT);
+
+    if (result < 0) {
         rsock_sys_fail_raddrinfo_or_sockaddr("connect(2)", addr, rai);
     }
 
-    return INT2FIX(n);
+    return INT2FIX(result);
 }
 
 /* :nodoc: */
@@ -965,7 +965,7 @@ sock_s_gethostbyname(VALUE obj, VALUE host)
 {
     rb_warn("Socket.gethostbyname is deprecated; use Addrinfo.getaddrinfo instead.");
     struct rb_addrinfo *res =
-        rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, AI_CANONNAME);
+        rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, AI_CANONNAME, Qnil);
     return rsock_make_hostent(host, res, sock_sockaddr);
 }
 
@@ -1183,7 +1183,7 @@ sock_s_getaddrinfo(int argc, VALUE *argv, VALUE _)
         norevlookup = rsock_do_not_reverse_lookup;
     }
 
-    res = rsock_getaddrinfo(host, port, &hints, 0);
+    res = rsock_getaddrinfo(host, port, &hints, 0, Qnil);
 
     ret = make_addrinfo(res, norevlookup);
     rb_freeaddrinfo(res);
@@ -1279,7 +1279,7 @@ sock_s_getnameinfo(int argc, VALUE *argv, VALUE _)
         hints.ai_socktype = (fl & NI_DGRAM) ? SOCK_DGRAM : SOCK_STREAM;
         /* af */
         hints.ai_family = NIL_P(af) ? PF_UNSPEC : rsock_family_arg(af);
-        res = rsock_getaddrinfo(host, port, &hints, 0);
+        res = rsock_getaddrinfo(host, port, &hints, 0, Qnil);
         sap = res->ai->ai_addr;
         salen = res->ai->ai_addrlen;
     }
@@ -1335,7 +1335,7 @@ sock_s_getnameinfo(int argc, VALUE *argv, VALUE _)
 static VALUE
 sock_s_pack_sockaddr_in(VALUE self, VALUE port, VALUE host)
 {
-    struct rb_addrinfo *res = rsock_addrinfo(host, port, AF_UNSPEC, 0, 0);
+    struct rb_addrinfo *res = rsock_addrinfo(host, port, AF_UNSPEC, 0, 0, Qnil);
     VALUE addr = rb_str_new((char*)res->ai->ai_addr, res->ai->ai_addrlen);
 
     rb_freeaddrinfo(res);
@@ -1856,6 +1856,67 @@ socket_s_ip_address_list(VALUE self)
 #define socket_s_ip_address_list rb_f_notimplement
 #endif
 
+/*
+ * call-seq:
+ *   Socket.tcp_fast_fallback -> true or false
+ *
+ * Returns whether Happy Eyeballs Version 2 ({RFC 8305}[https://datatracker.ietf.org/doc/html/rfc8305]),
+ * which is provided starting from Ruby 3.4 when using TCPSocket.new and Socket.tcp,
+ * is enabled or disabled.
+ *
+ * If true, it is enabled for TCPSocket.new and Socket.tcp.
+ * (Note: Happy Eyeballs Version 2 is not provided when using TCPSocket.new on Windows.)
+ *
+ * If false, Happy Eyeballs Version 2 is disabled.
+ *
+ * For details on Happy Eyeballs Version 2,
+ * see {Socket.tcp_fast_fallback=}[rdoc-ref:Socket.tcp_fast_fallback=].
+ */
+VALUE socket_s_tcp_fast_fallback(VALUE self) {
+    return rb_ivar_get(rb_cSocket, tcp_fast_fallback);
+}
+
+/*
+ * call-seq:
+ *   Socket.tcp_fast_fallback= -> true or false
+ *
+ * Enable or disable Happy Eyeballs Version 2 ({RFC 8305}[https://datatracker.ietf.org/doc/html/rfc8305])
+ * globally, which is provided starting from Ruby 3.4 when using TCPSocket.new and Socket.tcp.
+ *
+ * When set to true, the feature is enabled for both `TCPSocket.new` and `Socket.tcp`.
+ * (Note: This feature is not available when using TCPSocket.new on Windows.)
+ *
+ * When set to false, the behavior reverts to that of Ruby 3.3 or earlier.
+ *
+ * The default value is true if no value is explicitly set by calling this method.
+ * However, when the environment variable RUBY_TCP_NO_FAST_FALLBACK=1 is set,
+ * the default is false.
+ *
+ * To control the setting on a per-method basis, use the fast_fallback keyword argument for each method.
+ *
+ * === Happy Eyeballs Version 2
+ * Happy Eyeballs Version 2 ({RFC 8305}[https://datatracker.ietf.org/doc/html/rfc8305])
+ * is an algorithm designed to improve client socket connectivity.<br>
+ * It aims for more reliable and efficient connections by performing hostname resolution
+ * and connection attempts in parallel, instead of serially.
+ *
+ * Starting from Ruby 3.4, this method operates as follows with this algorithm:
+ *
+ * 1. Start resolving both IPv6 and IPv4 addresses concurrently.
+ * 2. Start connecting to the one of the addresses that are obtained first.<br>If IPv4 addresses are obtained first,
+ *    the method waits 50 ms for IPv6 name resolution to prioritize IPv6 connections.
+ * 3. After starting a connection attempt, wait 250 ms for the connection to be established.<br>
+ *    If no connection is established within this time, a new connection is started every 250 ms<br>
+ *    until a connection is  established or there are no more candidate addresses.<br>
+ *    (Although RFC 8305 strictly specifies sorting addresses,<br>
+ *    this method only alternates between IPv6 / IPv4 addresses due to the performance concerns)
+ * 4. Once a connection is established, all remaining connection attempts are canceled.
+ */
+VALUE socket_s_tcp_fast_fallback_set(VALUE self, VALUE value) {
+    rb_ivar_set(rb_cSocket, tcp_fast_fallback, value);
+    return value;
+}
+
 void
 Init_socket(void)
 {
@@ -1984,6 +2045,16 @@ Init_socket(void)
 
     rsock_init_socket_init();
 
+    const char *tcp_no_fast_fallback_config = getenv("RUBY_TCP_NO_FAST_FALLBACK");
+    VALUE fast_fallback_default;
+    if (tcp_no_fast_fallback_config == NULL || strcmp(tcp_no_fast_fallback_config, "0") == 0) {
+        fast_fallback_default = Qtrue;
+    } else {
+        fast_fallback_default = Qfalse;
+    }
+    tcp_fast_fallback = rb_intern_const("tcp_fast_fallback");
+    rb_ivar_set(rb_cSocket, tcp_fast_fallback, fast_fallback_default);
+
     rb_define_method(rb_cSocket, "initialize", sock_initialize, -1);
     rb_define_method(rb_cSocket, "connect", sock_connect, 1);
 
@@ -2027,6 +2098,9 @@ Init_socket(void)
 
     rb_define_singleton_method(rb_cSocket, "ip_address_list", socket_s_ip_address_list, 0);
 
+    rb_define_singleton_method(rb_cSocket, "tcp_fast_fallback", socket_s_tcp_fast_fallback, 0);
+    rb_define_singleton_method(rb_cSocket, "tcp_fast_fallback=", socket_s_tcp_fast_fallback_set, 1);
+
 #undef rb_intern
     sym_wait_writable = ID2SYM(rb_intern("wait_writable"));
 }
diff --git a/ext/socket/sockssocket.c b/ext/socket/sockssocket.c
index f263ac3804..30860ea257 100644
--- a/ext/socket/sockssocket.c
+++ b/ext/socket/sockssocket.c
@@ -30,11 +30,12 @@ socks_init(VALUE sock, VALUE host, VALUE port)
     static int init = 0;
 
     if (init == 0) {
-        SOCKSinit("ruby");
+        char progname[] = "ruby";
+        SOCKSinit(progname);
         init = 1;
     }
 
-    return rsock_init_inetsock(sock, host, port, Qnil, Qnil, INET_SOCKS, Qnil, Qnil);
+    return rsock_init_inetsock(sock, host, port, Qnil, Qnil, INET_SOCKS, Qnil, Qnil, Qnil, Qfalse, Qnil);
 }
 
 #ifdef SOCKS5
@@ -48,7 +49,7 @@ socks_s_close(VALUE sock)
     rb_io_t *fptr;
 
     GetOpenFile(sock, fptr);
-    shutdown(fptr->fd, 2);
+    shutdown(fptr->fd, SHUT_RDWR);
     return rb_io_close(sock);
 }
 #endif
diff --git a/ext/socket/tcpserver.c b/ext/socket/tcpserver.c
index 04e5a0bb51..0069f3c703 100644
--- a/ext/socket/tcpserver.c
+++ b/ext/socket/tcpserver.c
@@ -36,7 +36,7 @@ tcp_svr_init(int argc, VALUE *argv, VALUE sock)
     VALUE hostname, port;
 
     rb_scan_args(argc, argv, "011", &hostname, &port);
-    return rsock_init_inetsock(sock, hostname, port, Qnil, Qnil, INET_SERVER, Qnil, Qnil);
+    return rsock_init_inetsock(sock, hostname, port, Qnil, Qnil, INET_SERVER, Qnil, Qnil, Qnil, Qfalse, Qnil);
 }
 
 /*
diff --git a/ext/socket/tcpsocket.c b/ext/socket/tcpsocket.c
index 03787272f3..7ce536e0af 100644
--- a/ext/socket/tcpsocket.c
+++ b/ext/socket/tcpsocket.c
@@ -12,13 +12,31 @@
 
 /*
  * call-seq:
- *    TCPSocket.new(remote_host, remote_port, local_host=nil, local_port=nil, connect_timeout: nil)
+ *    TCPSocket.new(remote_host, remote_port, local_host=nil, local_port=nil, resolv_timeout: nil, connect_timeout: nil, open_timeout: nil, fast_fallback: true)
  *
  * Opens a TCP connection to +remote_host+ on +remote_port+.  If +local_host+
  * and +local_port+ are specified, then those parameters are used on the local
  * end to establish the connection.
  *
- * [:connect_timeout] specify the timeout in seconds.
+ * Starting from Ruby 3.4, this method operates according to the
+ * Happy Eyeballs Version 2 ({RFC 8305}[https://datatracker.ietf.org/doc/html/rfc8305])
+ * algorithm by default, except on Windows.
+ *
+ * For details on Happy Eyeballs Version 2,
+ * see {Socket.tcp_fast_fallback=}[rdoc-ref:Socket.tcp_fast_fallback=].
+ *
+ * To make it behave the same as in Ruby 3.3 and earlier,
+ * explicitly specify the option fast_fallback:false.
+ * Or, setting Socket.tcp_fast_fallback=false will disable
+ * Happy Eyeballs Version 2 not only for this method but for all Socket globally.
+ *
+ * When using TCPSocket.new on Windows, Happy Eyeballs Version 2 is not provided,
+ * and it behaves the same as in Ruby 3.3 and earlier.
+ *
+ * [:resolv_timeout] Specifies the timeout in seconds from when the hostname resolution starts.
+ * [:connect_timeout] This method sequentially attempts connecting to all candidate destination addresses.<br>The +connect_timeout+ specifies the timeout in seconds from the start of the connection attempt to the last candidate.<br>By default, all connection attempts continue until the timeout occurs.<br>When +fast_fallback:false+ is explicitly specified,<br>a timeout is set for each connection attempt and any connection attempt that exceeds its timeout will be canceled.
+ * [:open_timeout] Specifies the timeout in seconds from the start of the method execution.<br>If this timeout is reached while there are still addresses that have not yet been attempted for connection, no further attempts will be made.<br>If this option is specified together with other timeout options, an +ArgumentError+ will be raised.
+ * [:fast_fallback] Enables the Happy Eyeballs Version 2 algorithm (enabled by default).
  */
 static VALUE
 tcp_init(int argc, VALUE *argv, VALUE sock)
@@ -26,28 +44,43 @@ tcp_init(int argc, VALUE *argv, VALUE sock)
     VALUE remote_host, remote_serv;
     VALUE local_host, local_serv;
     VALUE opt;
-    static ID keyword_ids[2];
-    VALUE kwargs[2];
+    static ID keyword_ids[5];
+    VALUE kwargs[5];
     VALUE resolv_timeout = Qnil;
     VALUE connect_timeout = Qnil;
+    VALUE open_timeout = Qnil;
+    VALUE fast_fallback = Qnil;
+    VALUE test_mode_settings = Qnil;
 
     if (!keyword_ids[0]) {
         CONST_ID(keyword_ids[0], "resolv_timeout");
         CONST_ID(keyword_ids[1], "connect_timeout");
+        CONST_ID(keyword_ids[2], "open_timeout");
+        CONST_ID(keyword_ids[3], "fast_fallback");
+        CONST_ID(keyword_ids[4], "test_mode_settings");
     }
 
     rb_scan_args(argc, argv, "22:", &remote_host, &remote_serv,
                         &local_host, &local_serv, &opt);
 
     if (!NIL_P(opt)) {
-        rb_get_kwargs(opt, keyword_ids, 0, 2, kwargs);
+        rb_get_kwargs(opt, keyword_ids, 0, 5, kwargs);
         if (kwargs[0] != Qundef) { resolv_timeout = kwargs[0]; }
         if (kwargs[1] != Qundef) { connect_timeout = kwargs[1]; }
+        if (kwargs[2] != Qundef) { open_timeout = kwargs[2]; }
+        if (kwargs[3] != Qundef) { fast_fallback = kwargs[3]; }
+        if (kwargs[4] != Qundef) { test_mode_settings = kwargs[4]; }
+    }
+
+    if (fast_fallback == Qnil) {
+        fast_fallback = rb_ivar_get(rb_cSocket, tcp_fast_fallback);
+        if (fast_fallback == Qnil) fast_fallback = Qtrue;
     }
 
     return rsock_init_inetsock(sock, remote_host, remote_serv,
                                local_host, local_serv, INET_CLIENT,
-                               resolv_timeout, connect_timeout);
+                               resolv_timeout, connect_timeout, open_timeout,
+                               fast_fallback, test_mode_settings);
 }
 
 static VALUE
@@ -80,7 +113,7 @@ tcp_s_gethostbyname(VALUE obj, VALUE host)
 {
     rb_warn("TCPSocket.gethostbyname is deprecated; use Addrinfo.getaddrinfo instead.");
     struct rb_addrinfo *res =
-        rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, AI_CANONNAME);
+        rsock_addrinfo(host, Qnil, AF_UNSPEC, SOCK_STREAM, AI_CANONNAME, Qnil);
     return rsock_make_hostent(host, res, tcp_sockaddr);
 }
 
diff --git a/ext/socket/udpsocket.c b/ext/socket/udpsocket.c
index 5224e48a96..b2bc925538 100644
--- a/ext/socket/udpsocket.c
+++ b/ext/socket/udpsocket.c
@@ -45,22 +45,18 @@ udp_init(int argc, VALUE *argv, VALUE sock)
 
 struct udp_arg
 {
+    VALUE io;
     struct rb_addrinfo *res;
-    rb_io_t *fptr;
 };
 
 static VALUE
 udp_connect_internal(VALUE v)
 {
     struct udp_arg *arg = (void *)v;
-    rb_io_t *fptr;
-    int fd;
     struct addrinfo *res;
 
-    rb_io_check_closed(fptr = arg->fptr);
-    fd = fptr->fd;
     for (res = arg->res->ai; res; res = res->ai_next) {
-        if (rsock_connect(fd, res->ai_addr, res->ai_addrlen, 0, NULL) >= 0) {
+        if (rsock_connect(arg->io, res->ai_addr, res->ai_addrlen, 0, RUBY_IO_TIMEOUT_DEFAULT) >= 0) {
             return Qtrue;
         }
     }
@@ -84,16 +80,17 @@ udp_connect_internal(VALUE v)
  *
  */
 static VALUE
-udp_connect(VALUE sock, VALUE host, VALUE port)
+udp_connect(VALUE self, VALUE host, VALUE port)
 {
-    struct udp_arg arg;
-    VALUE ret;
+    struct udp_arg arg = {.io = self};
+
+    arg.res = rsock_addrinfo(host, port, rsock_fd_family(rb_io_descriptor(self)), SOCK_DGRAM, 0, Qnil);
+
+    int result = (int)rb_ensure(udp_connect_internal, (VALUE)&arg, rsock_freeaddrinfo, (VALUE)arg.res);
+    if (!result) {
+        rsock_sys_fail_host_port("connect(2)", host, port);
+    }
 
-    GetOpenFile(sock, arg.fptr);
-    arg.res = rsock_addrinfo(host, port, rsock_fd_family(arg.fptr->fd), SOCK_DGRAM, 0);
-    ret = rb_ensure(udp_connect_internal, (VALUE)&arg,
-                    rsock_freeaddrinfo, (VALUE)arg.res);
-    if (!ret) rsock_sys_fail_host_port("connect(2)", host, port);
     return INT2FIX(0);
 }
 
@@ -101,14 +98,13 @@ static VALUE
 udp_bind_internal(VALUE v)
 {
     struct udp_arg *arg = (void *)v;
-    rb_io_t *fptr;
-    int fd;
     struct addrinfo *res;
 
-    rb_io_check_closed(fptr = arg->fptr);
-    fd = fptr->fd;
+    rb_io_t *fptr;
+    RB_IO_POINTER(arg->io, fptr);
+
     for (res = arg->res->ai; res; res = res->ai_next) {
-        if (bind(fd, res->ai_addr, res->ai_addrlen) < 0) {
+        if (bind(fptr->fd, res->ai_addr, res->ai_addrlen) < 0) {
             continue;
         }
         return Qtrue;
@@ -129,22 +125,23 @@ udp_bind_internal(VALUE v)
  *
  */
 static VALUE
-udp_bind(VALUE sock, VALUE host, VALUE port)
+udp_bind(VALUE self, VALUE host, VALUE port)
 {
-    struct udp_arg arg;
-    VALUE ret;
+    struct udp_arg arg = {.io = self};
+
+    arg.res = rsock_addrinfo(host, port, rsock_fd_family(rb_io_descriptor(self)), SOCK_DGRAM, 0, Qnil);
+
+    VALUE result = rb_ensure(udp_bind_internal, (VALUE)&arg, rsock_freeaddrinfo, (VALUE)arg.res);
+    if (!result) {
+        rsock_sys_fail_host_port("bind(2)", host, port);
+    }
 
-    GetOpenFile(sock, arg.fptr);
-    arg.res = rsock_addrinfo(host, port, rsock_fd_family(arg.fptr->fd), SOCK_DGRAM, 0);
-    ret = rb_ensure(udp_bind_internal, (VALUE)&arg,
-                    rsock_freeaddrinfo, (VALUE)arg.res);
-    if (!ret) rsock_sys_fail_host_port("bind(2)", host, port);
     return INT2FIX(0);
 }
 
 struct udp_send_arg {
-    struct rb_addrinfo *res;
     rb_io_t *fptr;
+    struct rb_addrinfo *res;
     struct rsock_send_arg sarg;
 };
 
@@ -166,7 +163,7 @@ udp_send_internal(VALUE v)
         rb_io_wait(fptr->self, RB_INT2NUM(RUBY_IO_WRITABLE), Qnil);
 #endif
 
-        ssize_t n = (ssize_t)BLOCKING_REGION_FD(rsock_sendto_blocking, &arg->sarg);
+        ssize_t n = (ssize_t)rb_io_blocking_region(fptr, rsock_sendto_blocking, &arg->sarg);
 
         if (n >= 0) return RB_SSIZE2NUM(n);
 
@@ -215,7 +212,7 @@ udp_send(int argc, VALUE *argv, VALUE sock)
     GetOpenFile(sock, arg.fptr);
     arg.sarg.fd = arg.fptr->fd;
     arg.sarg.flags = NUM2INT(flags);
-    arg.res = rsock_addrinfo(host, port, rsock_fd_family(arg.fptr->fd), SOCK_DGRAM, 0);
+    arg.res = rsock_addrinfo(host, port, rsock_fd_family(arg.fptr->fd), SOCK_DGRAM, 0, Qnil);
     ret = rb_ensure(udp_send_internal, (VALUE)&arg,
                     rsock_freeaddrinfo, (VALUE)arg.res);
     if (!ret) rsock_sys_fail_host_port("sendto(2)", host, port);
diff --git a/ext/socket/unixsocket.c b/ext/socket/unixsocket.c
index a8475e3e60..2ec9376074 100644
--- a/ext/socket/unixsocket.c
+++ b/ext/socket/unixsocket.c
@@ -14,15 +14,14 @@
 struct unixsock_arg {
     struct sockaddr_un *sockaddr;
     socklen_t sockaddrlen;
-    int fd;
+    VALUE io;
 };
 
 static VALUE
 unixsock_connect_internal(VALUE a)
 {
     struct unixsock_arg *arg = (struct unixsock_arg *)a;
-    return (VALUE)rsock_connect(arg->fd, (struct sockaddr*)arg->sockaddr,
-                                arg->sockaddrlen, 0, NULL);
+    return (VALUE)rsock_connect(arg->io, (struct sockaddr*)arg->sockaddr, arg->sockaddrlen, 0, RUBY_IO_TIMEOUT_DEFAULT);
 }
 
 static VALUE
@@ -43,15 +42,16 @@ unixsock_path_value(VALUE path)
         }
     }
 #endif
+    path = rb_get_path(path);
 #ifdef _WIN32
     /* UNIXSocket requires UTF-8 per spec. */
     path = rb_str_export_to_enc(path, rb_utf8_encoding());
 #endif
-    return rb_get_path(path);
+    return path;
 }
 
 VALUE
-rsock_init_unixsock(VALUE sock, VALUE path, int server)
+rsock_init_unixsock(VALUE self, VALUE path, int server)
 {
     struct sockaddr_un sockaddr;
     socklen_t sockaddrlen;
@@ -73,43 +73,46 @@ rsock_init_unixsock(VALUE sock, VALUE path, int server)
         rsock_sys_fail_path("socket(2)", path);
     }
 
+    VALUE io = rsock_init_sock(self, fd);
+    RB_IO_POINTER(io, fptr);
+
     if (server) {
         status = bind(fd, (struct sockaddr*)&sockaddr, sockaddrlen);
     }
     else {
-        int prot;
+        int error_tag;
         struct unixsock_arg arg;
         arg.sockaddr = &sockaddr;
         arg.sockaddrlen = sockaddrlen;
-        arg.fd = fd;
-        status = (int)rb_protect(unixsock_connect_internal, (VALUE)&arg, &prot);
-        if (prot) {
-            close(fd);
-            rb_jump_tag(prot);
+        arg.io = io;
+
+        status = (int)rb_protect(unixsock_connect_internal, (VALUE)&arg, &error_tag);
+
+        if (error_tag) {
+            rb_io_close(io);
+            rb_jump_tag(error_tag);
         }
     }
 
     if (status < 0) {
         int e = errno;
-        close(fd);
+        rb_io_close(io);
         rsock_syserr_fail_path(e, "connect(2)", path);
     }
 
     if (server) {
         if (listen(fd, SOMAXCONN) < 0) {
             int e = errno;
-            close(fd);
+            rb_io_close(io);
             rsock_syserr_fail_path(e, "listen(2)", path);
         }
     }
 
-    rsock_init_sock(sock, fd);
     if (server) {
-        GetOpenFile(sock, fptr);
         fptr->pathv = rb_str_new_frozen(path);
     }
 
-    return sock;
+    return io;
 }
 
 /*
@@ -125,9 +128,9 @@ rsock_init_unixsock(VALUE sock, VALUE path, int server)
  *
  */
 static VALUE
-unix_init(VALUE sock, VALUE path)
+unix_init(VALUE self, VALUE path)
 {
-    return rsock_init_unixsock(sock, path, 0);
+    return rsock_init_unixsock(self, path, 0);
 }
 
 /*
@@ -288,7 +291,7 @@ unix_send_io(VALUE sock, VALUE val)
 #endif
 
     arg.fd = fptr->fd;
-    while ((int)BLOCKING_REGION_FD(sendmsg_blocking, &arg) == -1) {
+    while ((int)rb_io_blocking_region(fptr, sendmsg_blocking, &arg) == -1) {
         if (!rb_io_wait_writable(arg.fd))
             rsock_sys_fail_path("sendmsg(2)", fptr->pathv);
     }
@@ -390,7 +393,7 @@ retry:
 #endif
 
     arg.fd = fptr->fd;
-    while ((int)BLOCKING_REGION_FD(recvmsg_blocking, &arg) == -1) {
+    while ((int)rb_io_blocking_region(fptr, recvmsg_blocking, &arg) == -1) {
         int e = errno;
         if (e == EMSGSIZE && !(gc_reason & GC_REASON_EMSGSIZE)) {
             /* FreeBSD gets here when we're out of FDs */
diff --git a/ext/stringio/depend b/ext/stringio/depend
index b9fba7e9fa..3a82ad0a11 100644
--- a/ext/stringio/depend
+++ b/ext/stringio/depend
@@ -138,6 +138,7 @@ stringio.o: $(hdrdir)/ruby/internal/intern/re.h
 stringio.o: $(hdrdir)/ruby/internal/intern/ruby.h
 stringio.o: $(hdrdir)/ruby/internal/intern/select.h
 stringio.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+stringio.o: $(hdrdir)/ruby/internal/intern/set.h
 stringio.o: $(hdrdir)/ruby/internal/intern/signal.h
 stringio.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 stringio.o: $(hdrdir)/ruby/internal/intern/string.h
@@ -171,5 +172,6 @@ stringio.o: $(hdrdir)/ruby/oniguruma.h
 stringio.o: $(hdrdir)/ruby/ruby.h
 stringio.o: $(hdrdir)/ruby/st.h
 stringio.o: $(hdrdir)/ruby/subst.h
+stringio.o: $(hdrdir)/ruby/version.h
 stringio.o: stringio.c
 # AUTOGENERATED DEPENDENCIES END
diff --git a/ext/stringio/extconf.rb b/ext/stringio/extconf.rb
index 553732f79c..0089766983 100644
--- a/ext/stringio/extconf.rb
+++ b/ext/stringio/extconf.rb
@@ -1,6 +1,8 @@
 # frozen_string_literal: false
 require 'mkmf'
 if RUBY_ENGINE == 'ruby'
+  have_type("rb_io_mode_t", "ruby/io.h")
+
   create_makefile('stringio')
 else
   File.write('Makefile', dummy_makefile("").join)
diff --git a/ext/stringio/stringio.c b/ext/stringio/stringio.c
index c149811e05..41aa71f893 100644
--- a/ext/stringio/stringio.c
+++ b/ext/stringio/stringio.c
@@ -13,13 +13,14 @@
 **********************************************************************/
 
 static const char *const
-STRINGIO_VERSION = "3.1.1";
+STRINGIO_VERSION = "3.2.1.dev";
 
 #include <stdbool.h>
 
 #include "ruby.h"
 #include "ruby/io.h"
 #include "ruby/encoding.h"
+#include "ruby/version.h"
 #if defined(HAVE_FCNTL_H) || defined(_WIN32)
 #include <fcntl.h>
 #elif defined(HAVE_SYS_FCNTL_H)
@@ -35,15 +36,33 @@ STRINGIO_VERSION = "3.1.1";
 # define rb_class_new_instance_kw(argc, argv, klass, kw_splat) rb_class_new_instance(argc, argv, klass)
 #endif
 
+static inline bool
+str_chilled_p(VALUE str)
+{
+#if (RUBY_API_VERSION_MAJOR == 3 && RUBY_API_VERSION_MINOR >= 4) || RUBY_API_VERSION_MAJOR >= 4
+    // Do not attempt to modify chilled strings on Ruby 3.4+
+    // RUBY_FL_USER2 == STR_CHILLED_LITERAL
+    // RUBY_FL_USER3 == STR_CHILLED_SYMBOL_TO_S
+    return FL_TEST_RAW(str, RUBY_FL_USER2 | RUBY_FL_USER3);
+#else
+    return false;
+#endif
+}
+
+#ifndef HAVE_TYPE_RB_IO_MODE_T
+typedef int rb_io_mode_t;
+#endif
+
 struct StringIO {
     VALUE string;
     rb_encoding *enc;
     long pos;
     long lineno;
-    int flags;
+    rb_io_mode_t flags;
     int count;
 };
 
+static struct StringIO *get_strio_for_read(VALUE self);
 static VALUE strio_init(int, VALUE *, struct StringIO *, VALUE);
 static VALUE strio_unget_bytes(struct StringIO *, const char *, long);
 static long strio_write(VALUE self, VALUE str);
@@ -108,8 +127,14 @@ static const rb_data_type_t strio_data_type = {
 static struct StringIO*
 get_strio(VALUE self)
 {
-    struct StringIO *ptr = check_strio(rb_io_taint_check(self));
+    rb_check_frozen(self);
+    return get_strio_for_read(self);
+}
 
+static struct StringIO*
+get_strio_for_read(VALUE self)
+{
+    struct StringIO *ptr = check_strio(self);
     if (!ptr) {
 	rb_raise(rb_eIOError, "uninitialized stream");
     }
@@ -136,14 +161,38 @@ strio_substr(struct StringIO *ptr, long pos, long len, rb_encoding *enc)
     return enc_subseq(str, pos, len, enc);
 }
 
+static VALUE
+strio_readbuf(struct StringIO *ptr, VALUE str)
+{
+    if (!NIL_P(str)) {
+	StringValue(str);
+	rb_str_modify(str);
+	if (str == ptr->string) {
+	    rb_raise(rb_eArgError, "cannot read into the underlying string");
+	}
+    }
+    return str;
+}
+
 #define StringIO(obj) get_strio(obj)
+#define StringIOForRead(obj) get_strio_for_read(obj)
 
 #define STRIO_READABLE FL_USER4
 #define STRIO_WRITABLE FL_USER5
 #define STRIO_READWRITE (STRIO_READABLE|STRIO_WRITABLE)
 typedef char strio_flags_check[(STRIO_READABLE/FMODE_READABLE == STRIO_WRITABLE/FMODE_WRITABLE) * 2 - 1];
+#ifndef RB_FL_TEST_RAW
+# define RB_FL_TEST_RAW(obj, bits) (RBASIC(obj)->flags & (bits))
+#endif
+#ifndef RB_FL_SET_RAW
+# define RB_FL_SET_RAW(obj, bits) (RBASIC(obj)->flags |= (bits))
+#endif
+#ifndef RB_FL_UNSET_RAW
+# define RB_FL_UNSET_RAW(obj, bits) (RBASIC(obj)->flags &= ~(bits))
+#endif
+
 #define STRIO_MODE_SET_P(strio, mode) \
-    ((RBASIC(strio)->flags & STRIO_##mode) && \
+    (RB_FL_TEST_RAW(strio, STRIO_##mode) && \
      ((struct StringIO*)DATA_PTR(strio))->flags & FMODE_##mode)
 #define CLOSED(strio) (!STRIO_MODE_SET_P(strio, READWRITE))
 #define READABLE(strio) STRIO_MODE_SET_P(strio, READABLE)
@@ -154,7 +203,7 @@ static VALUE sym_exception;
 static struct StringIO*
 readable(VALUE strio)
 {
-    struct StringIO *ptr = StringIO(strio);
+    struct StringIO *ptr = StringIOForRead(strio);
     if (!READABLE(strio)) {
 	rb_raise(rb_eIOError, "not opened for reading");
     }
@@ -180,6 +229,21 @@ check_modifiable(struct StringIO *ptr)
     else if (OBJ_FROZEN_RAW(ptr->string)) {
 	rb_raise(rb_eIOError, "not modifiable string");
     }
+    else {
+	rb_str_modify(ptr->string);
+    }
+}
+
+static inline bool
+outside_p(struct StringIO *ptr, long pos)
+{
+    return NIL_P(ptr->string) || pos >= RSTRING_LEN(ptr->string);
+}
+
+static inline bool
+eos_p(struct StringIO *ptr)
+{
+    return outside_p(ptr, ptr->pos);
 }
 
 static VALUE
@@ -192,17 +256,32 @@ strio_s_allocate(VALUE klass)
  * call-seq:
  *   StringIO.new(string = '', mode = 'r+') -> new_stringio
  *
- * Note that +mode+ defaults to <tt>'r'</tt> if +string+ is frozen.
- *
  * Returns a new \StringIO instance formed from +string+ and +mode+;
- * see {Access Modes}[rdoc-ref:File@Access+Modes]:
+ * the instance should be closed when no longer needed:
  *
- *   strio = StringIO.new # => #<StringIO>
+ *   strio = StringIO.new
+ *   strio.string        # => ""
+ *   strio.closed_read?  # => false
+ *   strio.closed_write? # => false
  *   strio.close
  *
- * The instance should be closed when no longer needed.
+ * If +string+ is frozen, the default +mode+ is <tt>'r'</tt>:
+ *
+ *   strio = StringIO.new('foo'.freeze)
+ *   strio.string        # => "foo"
+ *   strio.closed_read?  # => false
+ *   strio.closed_write? # => true
+ *   strio.close
  *
- * Related: StringIO.open (accepts block; closes automatically).
+ * Argument +mode+ must be a valid
+ * {Access Mode}[rdoc-ref:File@Access+Modes],
+ * which may be a string or an integer constant:
+ *
+ *   StringIO.new('foo', 'w+')
+ *   StringIO.new('foo', File::RDONLY)
+ *
+ * Related: StringIO.open
+ * (passes the \StringIO object to the block; closes the object automatically on block exit).
  */
 static VALUE
 strio_initialize(int argc, VALUE *argv, VALUE self)
@@ -322,14 +401,15 @@ strio_init(int argc, VALUE *argv, struct StringIO *ptr, VALUE self)
     ptr->pos = 0;
     ptr->lineno = 0;
     if (ptr->flags & FMODE_SETENC_BY_BOM) set_encoding_by_bom(ptr);
-    RBASIC(self)->flags |= (ptr->flags & FMODE_READWRITE) * (STRIO_READABLE / FMODE_READABLE);
+    RB_FL_SET_RAW(self, (ptr->flags & FMODE_READWRITE) * (STRIO_READABLE / FMODE_READABLE));
     return self;
 }
 
 static VALUE
 strio_finalize(VALUE self)
 {
-    struct StringIO *ptr = StringIO(self);
+    struct StringIO *ptr = check_strio(self);
+    if (!ptr) return Qnil;
     RB_OBJ_WRITE(self, &ptr->string, Qnil);
     ptr->flags &= ~FMODE_READWRITE;
     return self;
@@ -337,23 +417,20 @@ strio_finalize(VALUE self)
 
 /*
  * call-seq:
- *   StringIO.open(string = '', mode = 'r+') {|strio| ... }
- *
- * Note that +mode+ defaults to <tt>'r'</tt> if +string+ is frozen.
+ *   StringIO.open(string = '', mode = 'r+') -> new_stringio
+ *   StringIO.open(string = '', mode = 'r+') {|strio| ... } -> object
  *
- * Creates a new \StringIO instance formed from +string+ and +mode+;
- * see {Access Modes}[rdoc-ref:File@Access+Modes].
+ * Creates new \StringIO instance by calling <tt>StringIO.new(string, mode)</tt>.
  *
- * With no block, returns the new instance:
+ * With no block given, returns the new instance:
  *
  *   strio = StringIO.open # => #<StringIO>
  *
- * With a block, calls the block with the new instance
+ * With a block given, calls the block with the new instance
  * and returns the block's value;
- * closes the instance on block exit.
+ * closes the instance on block exit:
  *
- *   StringIO.open {|strio| p strio }
- *   # => #<StringIO>
+ *   StringIO.open('foo') {|strio| strio.string.upcase } # => "FOO"
  *
  * Related: StringIO.new.
  */
@@ -379,42 +456,42 @@ strio_s_new(int argc, VALUE *argv, VALUE klass)
 }
 
 /*
- * Returns +false+.  Just for compatibility to IO.
+ * Returns +false+; for compatibility with IO.
  */
 static VALUE
 strio_false(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return Qfalse;
 }
 
 /*
- * Returns +nil+.  Just for compatibility to IO.
+ * Returns +nil+; for compatibility with IO.
  */
 static VALUE
 strio_nil(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return Qnil;
 }
 
 /*
- * Returns an object itself.  Just for compatibility to IO.
+ * Returns +self+; for compatibility with IO.
  */
 static VALUE
 strio_self(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return self;
 }
 
 /*
- * Returns 0.  Just for compatibility to IO.
+ * Returns 0; for compatibility with IO.
  */
 static VALUE
 strio_0(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return INT2FIX(0);
 }
 
@@ -424,7 +501,7 @@ strio_0(VALUE self)
 static VALUE
 strio_first(VALUE self, VALUE arg)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return arg;
 }
 
@@ -434,7 +511,7 @@ strio_first(VALUE self, VALUE arg)
 static VALUE
 strio_unimpl(int argc, VALUE *argv, VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     rb_notimplement();
 
     UNREACHABLE;
@@ -462,14 +539,14 @@ strio_unimpl(int argc, VALUE *argv, VALUE self)
 static VALUE
 strio_get_string(VALUE self)
 {
-    return StringIO(self)->string;
+    return StringIOForRead(self)->string;
 }
 
 /*
  * call-seq:
  *   string = other_string -> other_string
  *
- * Assigns the underlying string as +other_string+, and sets position to zero;
+ * Replaces the stored string with +other_string+, and sets the position to zero;
  * returns +other_string+:
  *
  *   StringIO.open('foo') do |strio|
@@ -483,7 +560,7 @@ strio_get_string(VALUE self)
  *   "foo"
  *   "bar"
  *
- * Related: StringIO#string (returns the underlying string).
+ * Related: StringIO#string (returns the stored string).
  */
 static VALUE
 strio_set_string(VALUE self, VALUE string)
@@ -504,17 +581,22 @@ strio_set_string(VALUE self, VALUE string)
  * call-seq:
  *   close -> nil
  *
- * Closes +self+ for both reading and writing.
+ * Closes +self+ for both reading and writing; returns +nil+:
  *
- * Raises IOError if reading or writing is attempted.
+ *   strio = StringIO.new
+ *   strio.closed? # => false
+ *   strio.close   # => nil
+ *   strio.closed? # => true
+ *   strio.read    # Raises IOError: not opened for reading
+ *   strio.write   # Raises IOError: not opened for writing
  *
- * Related: StringIO#close_read, StringIO#close_write.
+ * Related: StringIO#close_read, StringIO#close_write, StringIO.closed?.
  */
 static VALUE
 strio_close(VALUE self)
 {
     StringIO(self);
-    RBASIC(self)->flags &= ~STRIO_READWRITE;
+    RB_FL_UNSET_RAW(self, STRIO_READWRITE);
     return Qnil;
 }
 
@@ -522,9 +604,16 @@ strio_close(VALUE self)
  * call-seq:
  *   close_read -> nil
  *
- * Closes +self+ for reading; closed-write setting remains unchanged.
+ * Closes +self+ for reading;
+ * closed-write setting remains unchanged;
+ * returns +nil+:
  *
- * Raises IOError if reading is attempted.
+ *   strio = StringIO.new
+ *   strio.closed_read?  # => false
+ *   strio.close_read    # => nil
+ *   strio.closed_read?  # => true
+ *   strio.closed_write? # => false
+ *   strio.read          # Raises IOError: not opened for reading
  *
  * Related: StringIO#close, StringIO#close_write.
  */
@@ -535,7 +624,7 @@ strio_close_read(VALUE self)
     if (!(ptr->flags & FMODE_READABLE)) {
 	rb_raise(rb_eIOError, "closing non-duplex IO for reading");
     }
-    RBASIC(self)->flags &= ~STRIO_READABLE;
+    RB_FL_UNSET_RAW(self, STRIO_READABLE);
     return Qnil;
 }
 
@@ -543,11 +632,16 @@ strio_close_read(VALUE self)
  * call-seq:
  *   close_write -> nil
  *
- * Closes +self+ for writing; closed-read setting remains unchanged.
+ * Closes +self+ for writing; closed-read setting remains unchanged; returns +nil+:
  *
- * Raises IOError if writing is attempted.
+ *   strio = StringIO.new
+ *   strio.closed_write? # => false
+ *   strio.close_write   # => nil
+ *   strio.closed_write? # => true
+ *   strio.closed_read?  # => false
+ *   strio.write('foo')  # Raises IOError: not opened for writing
  *
- * Related: StringIO#close, StringIO#close_read.
+ * Related: StringIO#close, StringIO#close_read, StringIO#closed_write?.
  */
 static VALUE
 strio_close_write(VALUE self)
@@ -556,7 +650,7 @@ strio_close_write(VALUE self)
     if (!(ptr->flags & FMODE_WRITABLE)) {
 	rb_raise(rb_eIOError, "closing non-duplex IO for writing");
     }
-    RBASIC(self)->flags &= ~STRIO_WRITABLE;
+    RB_FL_UNSET_RAW(self, STRIO_WRITABLE);
     return Qnil;
 }
 
@@ -564,13 +658,21 @@ strio_close_write(VALUE self)
  * call-seq:
  *   closed? -> true or false
  *
- * Returns +true+ if +self+ is closed for both reading and writing,
- * +false+ otherwise.
+ * Returns whether +self+ is closed for both reading and writing:
+ *
+ *   strio = StringIO.new
+ *   strio.closed?     # => false  # Open for reading and writing.
+ *   strio.close_read
+ *   strio.closed?     # => false  # Still open for writing.
+ *   strio.close_write
+ *   strio.closed?     # => true   # Now closed for both.
+ *
+ * Related: StringIO.closed_read?, StringIO.closed_write?.
  */
 static VALUE
 strio_closed(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     if (!CLOSED(self)) return Qfalse;
     return Qtrue;
 }
@@ -579,12 +681,19 @@ strio_closed(VALUE self)
  * call-seq:
  *   closed_read? -> true or false
  *
- * Returns +true+ if +self+ is closed for reading, +false+ otherwise.
+ * Returns whether +self+ is closed for reading:
+ *
+ *   strio = StringIO.new
+ *   strio.closed_read?   # => false
+ *   strio.close_read
+ *   strio.closed_read?   # => true
+ *
+ * Related: StringIO#closed?, StringIO#closed_write?, StringIO#close_read.
  */
 static VALUE
 strio_closed_read(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     if (READABLE(self)) return Qfalse;
     return Qtrue;
 }
@@ -593,12 +702,19 @@ strio_closed_read(VALUE self)
  * call-seq:
  *   closed_write? -> true or false
  *
- * Returns +true+ if +self+ is closed for writing, +false+ otherwise.
+ * Returns whether +self+ is closed for writing:
+ *
+ *   strio = StringIO.new
+ *   strio.closed_write? # => false
+ *   strio.close_write
+ *   strio.closed_write? # => true
+ *
+ * Related: StringIO#close_write, StringIO#closed?, StringIO#closed_read?.
  */
 static VALUE
 strio_closed_write(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     if (WRITABLE(self)) return Qfalse;
     return Qtrue;
 }
@@ -607,19 +723,26 @@ static struct StringIO *
 strio_to_read(VALUE self)
 {
     struct StringIO *ptr = readable(self);
-    if (NIL_P(ptr->string)) return NULL;
-    if (ptr->pos < RSTRING_LEN(ptr->string)) return ptr;
-    return NULL;
+    if (eos_p(ptr)) return NULL;
+    return ptr;
 }
 
 /*
  * call-seq:
  *   eof? -> true or false
  *
- * Returns +true+ if positioned at end-of-stream, +false+ otherwise;
- * see {Position}[rdoc-ref:IO@Position].
+ * Returns whether +self+ is positioned at end-of-stream:
  *
- * Raises IOError if the stream is not opened for reading.
+ *   strio = StringIO.new('foo')
+ *   strio.pos  # => 0
+ *   strio.eof? # => false
+ *   strio.read # => "foo"
+ *   strio.pos  # => 3
+ *   strio.eof? # => true
+ *   strio.close_read
+ *   strio.eof? # Raises IOError: not opened for reading
+ *
+ * Related: StringIO#pos.
  */
 static VALUE
 strio_eof(VALUE self)
@@ -637,7 +760,7 @@ strio_copy(VALUE copy, VALUE orig)
 
     orig = rb_convert_type(orig, T_DATA, "StringIO", "to_strio");
     if (copy == orig) return copy;
-    ptr = StringIO(orig);
+    ptr = StringIOForRead(orig);
     old_ptr = check_strio(copy);
     if (old_ptr) {
 	old_string = old_ptr->string;
@@ -645,8 +768,8 @@ strio_copy(VALUE copy, VALUE orig)
     }
     DATA_PTR(copy) = ptr;
     RB_OBJ_WRITTEN(copy, old_string, ptr->string);
-    RBASIC(copy)->flags &= ~STRIO_READWRITE;
-    RBASIC(copy)->flags |= RBASIC(orig)->flags & STRIO_READWRITE;
+    RB_FL_UNSET_RAW(copy, STRIO_READWRITE);
+    RB_FL_SET_RAW(copy, RB_FL_TEST_RAW(orig, STRIO_READWRITE));
     ++ptr->count;
     return copy;
 }
@@ -656,12 +779,12 @@ strio_copy(VALUE copy, VALUE orig)
  *   lineno -> current_line_number
  *
  * Returns the current line number in +self+;
- * see {Line Number}[rdoc-ref:IO@Line+Number].
+ * see {Line Number}[rdoc-ref:StringIO@Line+Number].
  */
 static VALUE
 strio_get_lineno(VALUE self)
 {
-    return LONG2NUM(StringIO(self)->lineno);
+    return LONG2NUM(StringIOForRead(self)->lineno);
 }
 
 /*
@@ -669,7 +792,7 @@ strio_get_lineno(VALUE self)
  *   lineno = new_line_number -> new_line_number
  *
  * Sets the current line number in +self+ to the given +new_line_number+;
- * see {Line Number}[rdoc-ref:IO@Line+Number].
+ * see {Line Number}[rdoc-ref:StringIO@Line+Number].
  */
 static VALUE
 strio_set_lineno(VALUE self, VALUE lineno)
@@ -683,7 +806,7 @@ strio_set_lineno(VALUE self, VALUE lineno)
  *   binmode -> self
  *
  * Sets the data mode in +self+ to binary mode;
- * see {Data Mode}[rdoc-ref:File@Data+Mode].
+ * see {Data Mode}[rdoc-ref:StringIO@Data+Mode].
  *
  */
 static VALUE
@@ -744,12 +867,12 @@ strio_reopen(int argc, VALUE *argv, VALUE self)
  *   pos -> stream_position
  *
  * Returns the current position (in bytes);
- * see {Position}[rdoc-ref:IO@Position].
+ * see {Position}[rdoc-ref:StringIO@Position].
  */
 static VALUE
 strio_get_pos(VALUE self)
 {
-    return LONG2NUM(StringIO(self)->pos);
+    return LONG2NUM(StringIOForRead(self)->pos);
 }
 
 /*
@@ -757,7 +880,7 @@ strio_get_pos(VALUE self)
  *   pos = new_position -> new_position
  *
  * Sets the current position (in bytes);
- * see {Position}[rdoc-ref:IO@Position].
+ * see {Position}[rdoc-ref:StringIO@Position].
  */
 static VALUE
 strio_set_pos(VALUE self, VALUE pos)
@@ -792,9 +915,9 @@ strio_rewind(VALUE self)
  * call-seq:
  *   seek(offset, whence = SEEK_SET) -> 0
  *
- * Sets the current position to the given integer +offset+ (in bytes),
+ * Sets the position to the given integer +offset+ (in bytes),
  * with respect to a given constant +whence+;
- * see {Position}[rdoc-ref:IO@Position].
+ * see {IO#seek}[rdoc-ref:IO#seek].
  */
 static VALUE
 strio_seek(int argc, VALUE *argv, VALUE self)
@@ -816,7 +939,11 @@ strio_seek(int argc, VALUE *argv, VALUE self)
 	offset = ptr->pos;
 	break;
       case 2:
-	offset = RSTRING_LEN(ptr->string);
+	if (NIL_P(ptr->string)) {
+	    offset = 0;
+	} else {
+	    offset = RSTRING_LEN(ptr->string);
+	}
 	break;
       default:
 	error_inval("invalid whence");
@@ -837,7 +964,7 @@ strio_seek(int argc, VALUE *argv, VALUE self)
 static VALUE
 strio_get_sync(VALUE self)
 {
-    StringIO(self);
+    StringIOForRead(self);
     return Qtrue;
 }
 
@@ -849,10 +976,9 @@ strio_get_sync(VALUE self)
  * call-seq:
  *   each_byte {|byte| ... } -> self
  *
- * With a block given, calls the block with each remaining byte in the stream;
- * see {Byte IO}[rdoc-ref:IO@Byte+IO].
+ * :include: stringio/each_byte.rdoc
  *
- * With no block given, returns an enumerator.
+ * Related: StringIO#each_char, StringIO#each_codepoint, StringIO#each_line.
  */
 static VALUE
 strio_each_byte(VALUE self)
@@ -870,10 +996,10 @@ strio_each_byte(VALUE self)
 
 /*
  * call-seq:
- *   getc -> character or nil
+ *   getc -> character, byte, or nil
+ *
+ * :include: stringio/getc.rdoc
  *
- * Reads and returns the next character from the stream;
- * see {Character IO}[rdoc-ref:IO@Character+IO].
  */
 static VALUE
 strio_getc(VALUE self)
@@ -885,7 +1011,7 @@ strio_getc(VALUE self)
     int len;
     char *p;
 
-    if (NIL_P(str) || pos >= RSTRING_LEN(str)) {
+    if (eos_p(ptr)) {
 	return Qnil;
     }
     p = RSTRING_PTR(str)+pos;
@@ -896,17 +1022,17 @@ strio_getc(VALUE self)
 
 /*
  * call-seq:
- *   getbyte -> byte or nil
+ *   getbyte -> integer or nil
+ *
+ * :include: stringio/getbyte.rdoc
  *
- * Reads and returns the next 8-bit byte from the stream;
- * see {Byte IO}[rdoc-ref:IO@Byte+IO].
  */
 static VALUE
 strio_getbyte(VALUE self)
 {
     struct StringIO *ptr = readable(self);
     int c;
-    if (NIL_P(ptr->string) || ptr->pos >= RSTRING_LEN(ptr->string)) {
+    if (eos_p(ptr)) {
 	return Qnil;
     }
     c = RSTRING_PTR(ptr->string)[ptr->pos++];
@@ -930,6 +1056,18 @@ strio_extend(struct StringIO *ptr, long pos, long len)
     }
 }
 
+static void
+strio_unget_string(struct StringIO *ptr, VALUE c)
+{
+    const char *cp = NULL;
+    long cl = RSTRING_LEN(c);
+    if (cl > 0) {
+	if (c != ptr->string) cp = RSTRING_PTR(c);
+	strio_unget_bytes(ptr, cp, cl);
+	RB_GC_GUARD(c);
+    }
+}
+
 /*
  * call-seq:
  *   ungetc(character) -> nil
@@ -952,19 +1090,22 @@ strio_ungetc(VALUE self, VALUE c)
 
 	enc = rb_enc_get(ptr->string);
 	len = rb_enc_codelen(cc, enc);
-	if (len <= 0) rb_enc_uint_chr(cc, enc);
+	if (len <= 0) {
+	    rb_enc_uint_chr(cc, enc); /* to raise an exception */
+	    UNREACHABLE;
+	}
 	rb_enc_mbcput(cc, buf, enc);
 	return strio_unget_bytes(ptr, buf, len);
     }
     else {
-	SafeStringValue(c);
+	StringValue(c);
+	if (RSTRING_LEN(c) == 0) return Qnil;
 	enc = rb_enc_get(ptr->string);
 	enc2 = rb_enc_get(c);
 	if (enc != enc2 && enc != rb_ascii8bit_encoding()) {
 	    c = rb_str_conv_enc(c, enc2, enc);
 	}
-	strio_unget_bytes(ptr, RSTRING_PTR(c), RSTRING_LEN(c));
-	RB_GC_GUARD(c);
+	strio_unget_string(ptr, c);
 	return Qnil;
     }
 }
@@ -991,13 +1132,8 @@ strio_ungetbyte(VALUE self, VALUE c)
 	strio_unget_bytes(ptr, &cc, 1);
     }
     else {
-	long cl;
-	SafeStringValue(c);
-	cl = RSTRING_LEN(c);
-	if (cl > 0) {
-	    strio_unget_bytes(ptr, RSTRING_PTR(c), cl);
-	    RB_GC_GUARD(c);
-	}
+	StringValue(c);
+	strio_unget_string(ptr, c);
     }
     return Qnil;
 }
@@ -1028,7 +1164,7 @@ strio_unget_bytes(struct StringIO *ptr, const char *cp, long cl)
 	if (rest > cl) memset(s + len, 0, rest - cl);
 	pos -= cl;
     }
-    memcpy(s + pos, cp, cl);
+    memcpy(s + pos, (cp ? cp : s), cl);
     ptr->pos = pos;
     return Qnil;
 }
@@ -1065,12 +1201,11 @@ strio_readbyte(VALUE self)
 
 /*
  * call-seq:
- *   each_char {|c| ... } -> self
+ *   each_char {|char| ... } -> self
  *
- * With a block given, calls the block with each remaining character in the stream;
- * see {Character IO}[rdoc-ref:IO@Character+IO].
+ * :include: stringio/each_char.rdoc
  *
- * With no block given, returns an enumerator.
+ * Related: StringIO#each_byte, StringIO#each_codepoint, StringIO#each_line.
  */
 static VALUE
 strio_each_char(VALUE self)
@@ -1089,10 +1224,9 @@ strio_each_char(VALUE self)
  * call-seq:
  *   each_codepoint {|codepoint| ... } -> self
  *
- * With a block given, calls the block with each remaining codepoint in the stream;
- * see {Codepoint IO}[rdoc-ref:IO@Codepoint+IO].
+ * :include: stringio/each_codepoint.rdoc
  *
- * With no block given, returns an enumerator.
+ * Related: StringIO#each_byte, StringIO#each_char, StringIO#each_line.
  */
 static VALUE
 strio_each_codepoint(VALUE self)
@@ -1326,9 +1460,8 @@ strio_getline(struct getline_arg *arg, struct StringIO *ptr)
  *   gets(limit, chomp: false) -> string or nil
  *   gets(sep, limit, chomp: false) -> string or nil
  *
- * Reads and returns a line from the stream;
- * assigns the return value to <tt>$_</tt>;
- * see {Line IO}[rdoc-ref:IO@Line+IO].
+ * :include: stringio/gets.rdoc
+ *
  */
 static VALUE
 strio_gets(int argc, VALUE *argv, VALUE self)
@@ -1365,15 +1498,15 @@ strio_readline(int argc, VALUE *argv, VALUE self)
 }
 
 /*
+ * :markup: markdown
+ *
  * call-seq:
  *   each_line(sep = $/, chomp: false) {|line| ... }   -> self
  *   each_line(limit, chomp: false) {|line| ... }      -> self
  *   each_line(sep, limit, chomp: false) {|line| ... } -> self
  *
- * Calls the block with each remaining line read from the stream;
- * does nothing if already at end-of-file;
- * returns +self+.
- * See {Line IO}[rdoc-ref:IO@Line+IO].
+ * :include: stringio/each_line.md
+ *
  */
 static VALUE
 strio_each(int argc, VALUE *argv, VALUE self)
@@ -1514,9 +1647,10 @@ strio_write(VALUE self, VALUE str)
 
 /*
  * call-seq:
- *   strio.putc(obj)    -> obj
+ *   putc(object) -> object
+ *
+ * :include: stringio/putc.rdoc
  *
- * See IO#putc.
  */
 static VALUE
 strio_putc(VALUE self, VALUE ch)
@@ -1548,9 +1682,10 @@ strio_putc(VALUE self, VALUE ch)
 
 /*
  * call-seq:
- *   strio.read([length [, outbuf]])    -> string, outbuf, or nil
+ *   read(maxlen = nil, out_string = nil) → new_string, out_string, or nil
+ *
+ * :include: stringio/read.rdoc
  *
- * See IO#read.
  */
 static VALUE
 strio_read(int argc, VALUE *argv, VALUE self)
@@ -1562,11 +1697,7 @@ strio_read(int argc, VALUE *argv, VALUE self)
 
     switch (argc) {
       case 2:
-	str = argv[1];
-	if (!NIL_P(str)) {
-	    StringValue(str);
-	    rb_str_modify(str);
-	}
+	str = strio_readbuf(ptr, argv[1]);
 	/* fall through */
       case 1:
 	if (!NIL_P(argv[0])) {
@@ -1574,10 +1705,9 @@ strio_read(int argc, VALUE *argv, VALUE self)
 	    if (len < 0) {
 		rb_raise(rb_eArgError, "negative length %ld given", len);
 	    }
-	    if (len > 0 &&
-		(NIL_P(ptr->string) || ptr->pos >= RSTRING_LEN(ptr->string))) {
+	    if (eos_p(ptr)) {
 		if (!NIL_P(str)) rb_str_resize(str, 0);
-		return Qnil;
+		return len > 0 ? Qnil : rb_str_new(0, 0);
 	    }
 	    binary = 1;
 	    break;
@@ -1623,15 +1753,17 @@ strio_read(int argc, VALUE *argv, VALUE self)
 
 /*
  *  call-seq:
- *    pread(maxlen, offset)             -> string
- *    pread(maxlen, offset, out_string) -> string
+ *    pread(maxlen, offset, out_string = nil) -> new_string or out_string
+ *
+ *  :include: stringio/pread.rdoc
  *
- *  See IO#pread.
  */
 static VALUE
 strio_pread(int argc, VALUE *argv, VALUE self)
 {
     VALUE rb_len, rb_offset, rb_buf;
+    struct StringIO *ptr = readable(self);
+
     rb_scan_args(argc, argv, "21", &rb_len, &rb_offset, &rb_buf);
     long len = NUM2LONG(rb_len);
     long offset = NUM2LONG(rb_offset);
@@ -1640,6 +1772,12 @@ strio_pread(int argc, VALUE *argv, VALUE self)
 	rb_raise(rb_eArgError, "negative string size (or size too big): %" PRIsVALUE, rb_len);
     }
 
+    if (offset < 0) {
+	rb_syserr_fail_str(EINVAL, rb_sprintf("pread: Invalid offset argument: %" PRIsVALUE, rb_offset));
+    }
+
+    rb_buf = strio_readbuf(ptr, rb_buf);
+
     if (len == 0) {
 	if (NIL_P(rb_buf)) {
 	    return rb_str_new("", 0);
@@ -1647,13 +1785,7 @@ strio_pread(int argc, VALUE *argv, VALUE self)
 	return rb_buf;
     }
 
-    if (offset < 0) {
-	rb_syserr_fail_str(EINVAL, rb_sprintf("pread: Invalid offset argument: %" PRIsVALUE, rb_offset));
-    }
-
-    struct StringIO *ptr = readable(self);
-
-    if (offset >= RSTRING_LEN(ptr->string)) {
+    if (outside_p(ptr, offset)) {
 	rb_eof_error();
     }
 
@@ -1743,15 +1875,15 @@ strio_syswrite_nonblock(int argc, VALUE *argv, VALUE self)
 
 /*
  * call-seq:
- *   strio.length -> integer
- *   strio.size   -> integer
+ *   size -> integer
+ *
+ * :include: stringio/size.rdoc
  *
- * Returns the size of the buffer string.
  */
 static VALUE
 strio_size(VALUE self)
 {
-    VALUE string = StringIO(self)->string;
+    VALUE string = StringIOForRead(self)->string;
     if (NIL_P(string)) {
 	return INT2FIX(0);
     }
@@ -1784,27 +1916,34 @@ strio_truncate(VALUE self, VALUE len)
 }
 
 /*
- *  call-seq:
- *     strio.external_encoding   => encoding
+ * call-seq:
+ *   external_encoding -> encoding or nil
+ *
+ * Returns an Encoding object that represents the encoding of the string;
+ * see {Encodings}[rdoc-ref:StringIO@Encodings]:
+ *
+ *   strio = StringIO.new('foo')
+ *   strio.external_encoding # => #<Encoding:UTF-8>
+ *
+ * Returns +nil+ if +self+ has no string and is in write mode:
+ *
+ *   strio = StringIO.new(nil, 'w+')
+ *   strio.external_encoding # => nil
  *
- *  Returns the Encoding object that represents the encoding of the file.
- *  If the stream is write mode and no encoding is specified, returns
- *  +nil+.
  */
 
 static VALUE
 strio_external_encoding(VALUE self)
 {
-    struct StringIO *ptr = StringIO(self);
+    struct StringIO *ptr = StringIOForRead(self);
     return rb_enc_from_encoding(get_enc(ptr));
 }
 
 /*
  *  call-seq:
- *     strio.internal_encoding   => encoding
+ *     internal_encoding -> nil
  *
- *  Returns the Encoding of the internal string if conversion is
- *  specified.  Otherwise returns +nil+.
+ *  Returns +nil+; for compatibility with IO.
  */
 
 static VALUE
@@ -1839,14 +1978,15 @@ strio_set_encoding(int argc, VALUE *argv, VALUE self)
 	enc = rb_find_encoding(ext_enc);
 	if (!enc) {
 	    rb_io_enc_t convconfig;
-	    int oflags, fmode;
+	    int oflags;
+	    rb_io_mode_t fmode;
 	    VALUE vmode = rb_str_append(rb_str_new_cstr("r:"), ext_enc);
 	    rb_io_extract_modeenc(&vmode, 0, Qnil, &oflags, &fmode, &convconfig);
 	    enc = convconfig.enc2;
 	}
     }
     ptr->enc = enc;
-    if (!NIL_P(ptr->string) && WRITABLE(self)) {
+    if (!NIL_P(ptr->string) && WRITABLE(self) && !str_chilled_p(ptr->string)) {
 	rb_enc_associate(ptr->string, enc);
     }
 
@@ -1872,16 +2012,9 @@ strio_set_encoding_by_bom(VALUE self)
 }
 
 /*
- * \IO streams for strings, with access similar to
- * {IO}[rdoc-ref:IO];
- * see {IO}[rdoc-ref:IO].
- *
- * === About the Examples
- *
- * Examples on this page assume that \StringIO has been required:
- *
- *   require 'stringio'
+ * :markup: markdown
  *
+ * :include: stringio/stringio.md
  */
 void
 Init_stringio(void)
@@ -1889,7 +2022,7 @@ Init_stringio(void)
 #undef rb_intern
 
 #ifdef HAVE_RB_EXT_RACTOR_SAFE
-  rb_ext_ractor_safe(true);
+    rb_ext_ractor_safe(true);
 #endif
 
     VALUE StringIO = rb_define_class("StringIO", rb_cObject);
@@ -1981,7 +2114,9 @@ Init_stringio(void)
     rb_define_method(StringIO, "set_encoding_by_bom", strio_set_encoding_by_bom, 0);
 
     {
+	/* :stopdoc: */
 	VALUE mReadable = rb_define_module_under(rb_cIO, "generic_readable");
+	/* :startdoc: */
 	rb_define_method(mReadable, "readchar", strio_readchar, 0);
 	rb_define_method(mReadable, "readbyte", strio_readbyte, 0);
 	rb_define_method(mReadable, "readline", strio_readline, -1);
@@ -1991,7 +2126,9 @@ Init_stringio(void)
 	rb_include_module(StringIO, mReadable);
     }
     {
+	/* :stopdoc: */
 	VALUE mWritable = rb_define_module_under(rb_cIO, "generic_writable");
+	/* :startdoc: */
 	rb_define_method(mWritable, "<<", strio_addstr, 1);
 	rb_define_method(mWritable, "print", strio_print, -1);
 	rb_define_method(mWritable, "printf", strio_printf, -1);
diff --git a/ext/stringio/stringio.gemspec b/ext/stringio/stringio.gemspec
index b40b7fc824..f9a0742049 100644
--- a/ext/stringio/stringio.gemspec
+++ b/ext/stringio/stringio.gemspec
@@ -39,6 +39,8 @@ Gem::Specification.new do |s|
   s.required_ruby_version = ">= 2.7"
   s.summary = "Pseudo IO on String"
 
+  s.metadata["changelog_uri"] = "#{s.homepage}/releases/tag/v#{s.version}"
+
   # s.cert_chain  = %w[certs/nobu.pem]
   # s.signing_key = File.expand_path("~/.ssh/gem-private_key.pem") if $0 =~ /gem\z/
 end
diff --git a/ext/strscan/depend b/ext/strscan/depend
index 8dbae206d4..b40a025230 100644
--- a/ext/strscan/depend
+++ b/ext/strscan/depend
@@ -138,6 +138,7 @@ strscan.o: $(hdrdir)/ruby/internal/intern/re.h
 strscan.o: $(hdrdir)/ruby/internal/intern/ruby.h
 strscan.o: $(hdrdir)/ruby/internal/intern/select.h
 strscan.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+strscan.o: $(hdrdir)/ruby/internal/intern/set.h
 strscan.o: $(hdrdir)/ruby/internal/intern/signal.h
 strscan.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 strscan.o: $(hdrdir)/ruby/internal/intern/string.h
diff --git a/ext/strscan/extconf.rb b/ext/strscan/extconf.rb
index bd65606a4e..4e8d851fdb 100644
--- a/ext/strscan/extconf.rb
+++ b/ext/strscan/extconf.rb
@@ -2,8 +2,12 @@
 require 'mkmf'
 if RUBY_ENGINE == 'ruby'
   $INCFLAGS << " -I$(top_srcdir)" if $extmk
-  have_func("onig_region_memsize", "ruby.h")
-  have_func("rb_reg_onig_match", "ruby.h")
+  have_func("onig_region_memsize(NULL)")
+  have_func("rb_reg_onig_match", "ruby/re.h")
+  have_func("rb_deprecate_constant")
+  have_func("rb_int_parse_cstr", "ruby.h") # RUBY_VERSION >= 2.5
+  have_func("rb_gc_location", "ruby.h") # RUBY_VERSION >= 2.7
+  have_const("RUBY_TYPED_EMBEDDABLE", "ruby.h") # RUBY_VERSION >= 3.3
   create_makefile 'strscan'
 else
   File.write('Makefile', dummy_makefile("").join)
diff --git a/ext/strscan/lib/strscan.rb b/ext/strscan/lib/strscan.rb
new file mode 100644
index 0000000000..4e8910d141
--- /dev/null
+++ b/ext/strscan/lib/strscan.rb
@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+case RUBY_ENGINE
+when 'ruby'
+  require 'strscan.so'
+  require_relative 'strscan/strscan'
+when 'jruby'
+  require 'strscan.jar'
+  JRuby::Util.load_ext('org.jruby.ext.strscan.StringScannerLibrary')
+  require_relative 'strscan/strscan'
+when 'truffleruby'
+  if RUBY_ENGINE_VERSION.to_i >= 34
+    require 'strscan/truffleruby'
+  else
+    $LOAD_PATH.delete __dir__
+    require 'strscan'
+  end
+else
+  raise NotImplementedError, "Unknown Ruby: #{RUBY_ENGINE}"
+end
diff --git a/ext/strscan/lib/strscan/strscan.rb b/ext/strscan/lib/strscan/strscan.rb
new file mode 100644
index 0000000000..5e262f4007
--- /dev/null
+++ b/ext/strscan/lib/strscan/strscan.rb
@@ -0,0 +1,55 @@
+# frozen_string_literal: true
+
+class StringScanner
+  unless method_defined?(:integer_at) # For JRuby
+    def integer_at(specifier, *to_i_args)
+      self[specifier]&.to_i(*to_i_args)
+    end
+  end
+
+  # :markup: markdown
+  #
+  # call-seq:
+  #   scan_integer(base: 10) -> integer or nil
+  #
+  # Returns an integer scanned from `self`,
+  # beginning at the current position;
+  # returns `nil` if no such integer was available.
+  #
+  # When `base` is `10` (the default),
+  # equivalent to calling #scan with argument +pattern+
+  # as `'[+-]?\d+'`:
+  #
+  # ```ruby
+  # scanner = StringScanner.new('Form 27B/6')
+  # scanner.scan_integer # => nil # No integer at position 0.
+  # scanner.pos = 5
+  # scanner.scan_integer # => 27
+  # scanner.matched      # => "27"
+  # scanner.pos          # => 7
+  # ```
+  #
+  # When `base` is `16` (the only other value allowed),
+  # equivalent to calling #scan with argument `pattern`
+  # as `'[+-]?(0x)?[0-9a-fA-F]+'`:
+  #
+  # ```ruby
+  # scanner.pos = 5
+  # scanner.scan_integer(base: 16) # => 635
+  # scanner.matched                # => "27B"
+  # scanner.pos                    # => 8
+  # ```
+  #
+  # Raises Encoding::CompatibilityError if `self` does not have
+  # an ASCII compatible encoding.
+  def scan_integer(base: 10)
+    case base
+    when 10
+      scan_base10_integer
+    when 16
+      scan_base16_integer
+    else
+      raise ArgumentError, "Unsupported integer base: #{base.inspect}, expected 10 or 16"
+    end
+  end
+end
diff --git a/ext/strscan/strscan.c b/ext/strscan/strscan.c
index fad35925a8..dede57218b 100644
--- a/ext/strscan/strscan.c
+++ b/ext/strscan/strscan.c
@@ -22,7 +22,15 @@ extern size_t onig_region_memsize(const struct re_registers *regs);
 
 #include <stdbool.h>
 
-#define STRSCAN_VERSION "3.1.1"
+#define STRSCAN_VERSION "3.1.9.dev"
+
+
+#ifdef HAVE_RB_DEPRECATE_CONSTANT
+/* In ruby 3.0, defined but exposed in external headers */
+extern void rb_deprecate_constant(VALUE mod, const char *name);
+#else
+# define rb_deprecate_constant(mod, name) ((void)0)
+#endif
 
 /* =======================================================================
                          Data Type Definitions
@@ -30,7 +38,8 @@ extern size_t onig_region_memsize(const struct re_registers *regs);
 
 static VALUE StringScanner;
 static VALUE ScanError;
-static ID id_byteslice;
+
+static int usascii_encindex, utf8_encindex, binary_encindex;
 
 struct strscanner
 {
@@ -56,8 +65,13 @@ struct strscanner
 };
 
 #define MATCHED_P(s)          ((s)->flags & FLAG_MATCHED)
-#define MATCHED(s)             (s)->flags |= FLAG_MATCHED
-#define CLEAR_MATCH_STATUS(s)  (s)->flags &= ~FLAG_MATCHED
+#define MATCHED(s)            ((s)->flags |= FLAG_MATCHED)
+#define CLEAR_MATCHED(s)      ((s)->flags &= ~FLAG_MATCHED)
+#define CLEAR_NAMED_CAPTURES(s) ((s)->regex = Qnil)
+#define CLEAR_MATCH_STATUS(s) do {\
+    CLEAR_MATCHED(s);\
+    CLEAR_NAMED_CAPTURES(s);\
+} while (0)
 
 #define S_PBEG(s)  (RSTRING_PTR((s)->str))
 #define S_LEN(s)  (RSTRING_LEN((s)->str))
@@ -90,7 +104,6 @@ static VALUE strscan_init_copy _((VALUE vself, VALUE vorig));
 
 static VALUE strscan_s_mustc _((VALUE self));
 static VALUE strscan_terminate _((VALUE self));
-static VALUE strscan_clear _((VALUE self));
 static VALUE strscan_get_string _((VALUE self));
 static VALUE strscan_set_string _((VALUE self, VALUE str));
 static VALUE strscan_concat _((VALUE self, VALUE str));
@@ -112,13 +125,11 @@ static VALUE strscan_search_full _((VALUE self, VALUE re,
 static void adjust_registers_to_matched _((struct strscanner *p));
 static VALUE strscan_getch _((VALUE self));
 static VALUE strscan_get_byte _((VALUE self));
-static VALUE strscan_getbyte _((VALUE self));
 static VALUE strscan_peek _((VALUE self, VALUE len));
-static VALUE strscan_peep _((VALUE self, VALUE len));
+static VALUE strscan_scan_base10_integer _((VALUE self));
 static VALUE strscan_unscan _((VALUE self));
 static VALUE strscan_bol_p _((VALUE self));
 static VALUE strscan_eos_p _((VALUE self));
-static VALUE strscan_empty_p _((VALUE self));
 static VALUE strscan_rest_p _((VALUE self));
 static VALUE strscan_matched_p _((VALUE self));
 static VALUE strscan_matched _((VALUE self));
@@ -171,12 +182,35 @@ extract_beg_len(struct strscanner *p, long beg_i, long len)
                                Constructor
    ======================================================================= */
 
+#ifdef RUBY_TYPED_EMBEDDABLE
+#  define HAVE_RUBY_TYPED_EMBEDDABLE 1
+#else
+# ifdef HAVE_CONST_RUBY_TYPED_EMBEDDABLE
+#  define RUBY_TYPED_EMBEDDABLE RUBY_TYPED_EMBEDDABLE
+#  define HAVE_RUBY_TYPED_EMBEDDABLE 1
+# else
+#  define RUBY_TYPED_EMBEDDABLE 0
+# endif
+#endif
+
+#ifdef HAVE_RB_GC_LOCATION
+static void
+strscan_compact(void *ptr)
+{
+    struct strscanner *p = ptr;
+    p->str = rb_gc_location(p->str);
+    p->regex = rb_gc_location(p->regex);
+}
+#else
+#define rb_gc_mark_movable rb_gc_mark
+#endif
+
 static void
 strscan_mark(void *ptr)
 {
     struct strscanner *p = ptr;
-    rb_gc_mark(p->str);
-    rb_gc_mark(p->regex);
+    rb_gc_mark_movable(p->str);
+    rb_gc_mark_movable(p->regex);
 }
 
 static void
@@ -184,24 +218,37 @@ strscan_free(void *ptr)
 {
     struct strscanner *p = ptr;
     onig_region_free(&(p->regs), 0);
+#ifndef HAVE_RUBY_TYPED_EMBEDDABLE
     ruby_xfree(p);
+#endif
 }
 
 static size_t
 strscan_memsize(const void *ptr)
 {
-    const struct strscanner *p = ptr;
-    size_t size = sizeof(*p) - sizeof(p->regs);
+    size_t size = 0;
+#ifndef HAVE_RUBY_TYPED_EMBEDDABLE
+    size += sizeof(struct strscanner);
+#endif
+
 #ifdef HAVE_ONIG_REGION_MEMSIZE
-    size += onig_region_memsize(&p->regs);
+    const struct strscanner *p = ptr;
+    size += onig_region_memsize(&p->regs) - sizeof(p->regs);
 #endif
     return size;
 }
 
 static const rb_data_type_t strscanner_type = {
-    "StringScanner",
-    {strscan_mark, strscan_free, strscan_memsize},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
+    .wrap_struct_name = "StringScanner",
+    .function = {
+        .dmark = strscan_mark,
+        .dfree = strscan_free,
+        .dsize = strscan_memsize,
+#ifdef HAVE_RB_GC_LOCATION
+        .dcompact = strscan_compact,
+#endif
+    },
+    .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
 };
 
 static VALUE
@@ -213,7 +260,6 @@ strscan_s_allocate(VALUE klass)
     CLEAR_MATCH_STATUS(p);
     onig_region_init(&(p->regs));
     p->str = Qnil;
-    p->regex = Qnil;
     return obj;
 }
 
@@ -228,7 +274,7 @@ strscan_s_allocate(VALUE klass)
  * is the given `string`;
  * sets the [fixed-anchor property][10]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.string        # => "foobarbaz"
  * scanner.fixed_anchor? # => false
@@ -266,7 +312,7 @@ strscan_initialize(int argc, VALUE *argv, VALUE self)
         p->fixed_anchor_p = false;
     }
     StringValue(str);
-    p->str = str;
+    RB_OBJ_WRITE(self, &p->str, str);
 
     return self;
 }
@@ -296,7 +342,7 @@ strscan_init_copy(VALUE vself, VALUE vorig)
     orig = check_strscan(vorig);
     if (self != orig) {
 	self->flags = orig->flags;
-	self->str = orig->str;
+	RB_OBJ_WRITE(vself, &self->str, orig->str);
 	self->prev = orig->prev;
 	self->curr = orig->curr;
 	if (rb_reg_region_copy(&self->regs, &orig->regs))
@@ -336,7 +382,7 @@ strscan_s_mustc(VALUE self)
  * and clears [match values][9];
  * returns +self+:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.exist?(/bar/)          # => 6
  * scanner.reset                  # => #<StringScanner 0/9 @ "fooba...">
@@ -364,6 +410,9 @@ strscan_reset(VALUE self)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   terminate -> self
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/terminate.md
  */
@@ -379,21 +428,6 @@ strscan_terminate(VALUE self)
 }
 
 /*
- * call-seq:
- *   clear -> self
- *
- * This method is obsolete; use the equivalent method StringScanner#terminate.
- */
-
- /* :nodoc: */
-static VALUE
-strscan_clear(VALUE self)
-{
-    rb_warning("StringScanner#clear is obsolete; use #terminate instead");
-    return strscan_terminate(self);
-}
-
-/*
  * :markup: markdown
  * :include: strscan/link_refs.txt
  *
@@ -402,7 +436,7 @@ strscan_clear(VALUE self)
  *
  * Returns the [stored string][1]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobar')
  * scanner.string # => "foobar"
  * scanner.concat('baz')
@@ -432,7 +466,7 @@ strscan_get_string(VALUE self)
  * - Clears [match values][9].
  * - Returns `other_string`.
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobar')
  * scanner.scan(/foo/)
  * put_situation(scanner)
@@ -460,7 +494,7 @@ strscan_set_string(VALUE self, VALUE str)
     struct strscanner *p = check_strscan(self);
 
     StringValue(str);
-    p->str = str;
+    RB_OBJ_WRITE(self, &p->str, str);
     p->curr = 0;
     CLEAR_MATCH_STATUS(p);
     return str;
@@ -480,7 +514,7 @@ strscan_set_string(VALUE self, VALUE str)
  *   or [match values][9].
  *
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foo')
  * scanner.string           # => "foo"
  * scanner.terminate
@@ -508,6 +542,9 @@ strscan_concat(VALUE self, VALUE str)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   pos -> byte_position
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/get_pos.md
  */
@@ -517,11 +554,14 @@ strscan_get_pos(VALUE self)
     struct strscanner *p;
 
     GET_SCANNER(self, p);
-    return INT2FIX(p->curr);
+    return LONG2NUM(p->curr);
 }
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   charpos -> character_position
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/get_charpos.md
  */
@@ -537,6 +577,10 @@ strscan_get_charpos(VALUE self)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   pos = n -> n
+ *   pointer = n -> n
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/set_pos.md
  */
@@ -547,7 +591,7 @@ strscan_set_pos(VALUE self, VALUE v)
     long i;
 
     GET_SCANNER(self, p);
-    i = NUM2INT(v);
+    i = NUM2LONG(v);
     if (i < 0) i += S_LEN(p);
     if (i < 0) rb_raise(rb_eRangeError, "index out of range");
     if (i > S_LEN(p)) rb_raise(rb_eRangeError, "index out of range");
@@ -568,19 +612,20 @@ match_target(struct strscanner *p)
 }
 
 static inline void
-set_registers(struct strscanner *p, size_t length)
+set_registers(struct strscanner *p, size_t pos, size_t length)
 {
     const int at = 0;
     OnigRegion *regs = &(p->regs);
     onig_region_clear(regs);
     if (onig_region_set(regs, at, 0, 0)) return;
     if (p->fixed_anchor_p) {
-        regs->beg[at] = p->curr;
-        regs->end[at] = p->curr + length;
+        regs->beg[at] = pos + p->curr;
+        regs->end[at] = pos + p->curr + length;
     }
     else
     {
-        regs->end[at] = length;
+        regs->beg[at] = pos;
+        regs->end[at] = pos + length;
     }
 }
 
@@ -626,12 +671,13 @@ rb_reg_onig_match(VALUE re, VALUE str,
                   OnigPosition (*match)(regex_t *reg, VALUE str, struct re_registers *regs, void *args),
                   void *args, struct re_registers *regs)
 {
+    OnigPosition result;
     regex_t *reg = rb_reg_prepare_re(re, str);
 
     bool tmpreg = reg != RREGEXP_PTR(re);
     if (!tmpreg) RREGEXP(re)->usecnt++;
 
-    OnigPosition result = match(reg, str, regs, args);
+    result = match(reg, str, regs, args);
 
     if (!tmpreg) RREGEXP(re)->usecnt--;
     if (tmpreg) {
@@ -681,19 +727,19 @@ strscan_search(regex_t *reg, VALUE str, struct re_registers *regs, void *args_pt
                        ONIG_OPTION_NONE);
 }
 
+static void
+strscan_enc_check(VALUE str1, VALUE str2)
+{
+    if (RB_ENCODING_GET(str1) != RB_ENCODING_GET(str2)) {
+        rb_enc_check(str1, str2);
+    }
+}
+
 static VALUE
 strscan_do_scan(VALUE self, VALUE pattern, int succptr, int getstr, int headonly)
 {
     struct strscanner *p;
 
-    if (headonly) {
-        if (!RB_TYPE_P(pattern, T_REGEXP)) {
-            StringValue(pattern);
-        }
-    }
-    else {
-        Check_Type(pattern, T_REGEXP);
-    }
     GET_SCANNER(self, p);
 
     CLEAR_MATCH_STATUS(p);
@@ -702,26 +748,42 @@ strscan_do_scan(VALUE self, VALUE pattern, int succptr, int getstr, int headonly
     }
 
     if (RB_TYPE_P(pattern, T_REGEXP)) {
-        p->regex = pattern;
-        OnigPosition ret = rb_reg_onig_match(pattern,
-                                             p->str,
-                                             headonly ? strscan_match : strscan_search,
-                                             (void *)p,
-                                             &(p->regs));
+        OnigPosition ret;
+        RB_OBJ_WRITE(self, &p->regex, pattern);
+        ret = rb_reg_onig_match(p->regex,
+                                p->str,
+                                headonly ? strscan_match : strscan_search,
+                                (void *)p,
+                                &(p->regs));
 
         if (ret == ONIG_MISMATCH) {
             return Qnil;
         }
     }
     else {
-        rb_enc_check(p->str, pattern);
+        StringValue(pattern);
         if (S_RESTLEN(p) < RSTRING_LEN(pattern)) {
+            strscan_enc_check(p->str, pattern);
             return Qnil;
         }
-        if (memcmp(CURPTR(p), RSTRING_PTR(pattern), RSTRING_LEN(pattern)) != 0) {
-            return Qnil;
+
+        if (headonly) {
+            strscan_enc_check(p->str, pattern);
+
+            if (memcmp(CURPTR(p), RSTRING_PTR(pattern), RSTRING_LEN(pattern)) != 0) {
+                return Qnil;
+            }
+            set_registers(p, 0, RSTRING_LEN(pattern));
+        }
+        else {
+            rb_encoding *enc = rb_enc_check(p->str, pattern);
+            long pos = rb_memsearch(RSTRING_PTR(pattern), RSTRING_LEN(pattern),
+                                    CURPTR(p), S_RESTLEN(p), enc);
+            if (pos == -1) {
+                return Qnil;
+            }
+            set_registers(p, pos, RSTRING_LEN(pattern));
         }
-        set_registers(p, RSTRING_LEN(pattern));
     }
 
     MATCHED(p);
@@ -743,6 +805,9 @@ strscan_do_scan(VALUE self, VALUE pattern, int succptr, int getstr, int headonly
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   scan(pattern) -> substring or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/scan.md
  */
@@ -757,7 +822,7 @@ strscan_scan(VALUE self, VALUE re)
  * :include: strscan/link_refs.txt
  *
  * call-seq:
- *   match?(pattern) -> updated_position or nil
+ *   match?(pattern) -> match_size or nil
  *
  * Attempts to [match][17] the given `pattern`
  * at the beginning of the [target substring][3];
@@ -769,7 +834,7 @@ strscan_scan(VALUE self, VALUE re)
  * - Returns the size in bytes of the matched substring.
  *
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.pos = 3
  * scanner.match?(/bar/) => 3
@@ -802,7 +867,7 @@ strscan_scan(VALUE self, VALUE re)
  * - Returns `nil`.
  * - Does not increment positions.
  *
- * ```
+ * ```rb
  * scanner.match?(/nope/)         # => nil
  * match_values_cleared?(scanner) # => true
  * ```
@@ -816,6 +881,9 @@ strscan_match_p(VALUE self, VALUE re)
 
 /*
  * :markup: markdown
+ * call-seq:
+ *   skip(pattern) -> match_size or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/skip.md
  */
@@ -841,7 +909,7 @@ strscan_skip(VALUE self, VALUE re)
  * - Returns the matched substring.
  * - Sets all [match values][9].
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.pos = 3
  * scanner.check('bar') # => "bar"
@@ -874,7 +942,7 @@ strscan_skip(VALUE self, VALUE re)
  * - Returns `nil`.
  * - Clears all [match values][9].
  *
- * ```
+ * ```rb
  * scanner.check(/nope/)          # => nil
  * match_values_cleared?(scanner) # => true
  * ```
@@ -888,7 +956,7 @@ strscan_check(VALUE self, VALUE re)
 
 /*
  * call-seq:
- *   scan_full(pattern, advance_pointer_p, return_string_p) -> matched_substring or nil
+ *   scan_full(pattern, advance_pointer_p, return_string_p) -> matched_substring or length or nil
  *
  * Equivalent to one of the following:
  *
@@ -913,6 +981,9 @@ strscan_scan_full(VALUE self, VALUE re, VALUE s, VALUE f)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   scan_until(pattern) -> substring or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/scan_until.md
  */
@@ -941,7 +1012,7 @@ strscan_scan_until(VALUE self, VALUE re)
  *   and the end of the matched substring.
  * - Sets all [match values][9].
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbazbatbam')
  * scanner.pos = 6
  * scanner.exist?(/bat/) # => 6
@@ -973,7 +1044,7 @@ strscan_scan_until(VALUE self, VALUE re)
  * - Returns `nil`.
  * - Clears all [match values][9].
  *
- * ```
+ * ```rb
  * scanner.exist?(/nope/)         # => nil
  * match_values_cleared?(scanner) # => true
  * ```
@@ -987,6 +1058,9 @@ strscan_exist_p(VALUE self, VALUE re)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   skip_until(pattern) -> matched_substring_size or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/skip_until.md
  */
@@ -1015,7 +1089,7 @@ strscan_skip_until(VALUE self, VALUE re)
  *   which extends from the current [position][2]
  *   to the end of the matched substring.
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbazbatbam')
  * scanner.pos = 6
  * scanner.check_until(/bat/) # => "bazbat"
@@ -1047,7 +1121,7 @@ strscan_skip_until(VALUE self, VALUE re)
  * - Clears all [match values][9].
  * - Returns `nil`.
  *
- * ```
+ * ```rb
  * scanner.check_until(/nope/)    # => nil
  * match_values_cleared?(scanner) # => true
  * ```
@@ -1098,6 +1172,9 @@ adjust_registers_to_matched(struct strscanner *p)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   getch -> character or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/getch.md
  */
@@ -1125,7 +1202,7 @@ strscan_getch(VALUE self)
 
 /*
  * call-seq:
- *   scan_byte -> integer_byte
+ *   scan_byte -> integer_byte or nil
  *
  * Scans one byte and returns it as an integer.
  * This method is not multibyte character sensitive.
@@ -1136,13 +1213,14 @@ static VALUE
 strscan_scan_byte(VALUE self)
 {
     struct strscanner *p;
+    VALUE byte;
 
     GET_SCANNER(self, p);
     CLEAR_MATCH_STATUS(p);
     if (EOS_P(p))
         return Qnil;
 
-    VALUE byte = INT2FIX((unsigned char)*CURPTR(p));
+    byte = INT2FIX((unsigned char)*CURPTR(p));
     p->prev = p->curr;
     p->curr++;
     MATCHED(p);
@@ -1170,6 +1248,9 @@ strscan_peek_byte(VALUE self)
 
 /*
  * :markup: markdown
+ * :call-seq:
+ *   get_byte -> byte_as_character or nil
+ *
  * :include: strscan/link_refs.txt
  * :include: strscan/methods/get_byte.md
  */
@@ -1193,22 +1274,6 @@ strscan_get_byte(VALUE self)
 }
 
 /*
- * call-seq:
- *   getbyte
- *
- * Equivalent to #get_byte.
- * This method is obsolete; use #get_byte instead.
- */
-
- /* :nodoc: */
-static VALUE
-strscan_getbyte(VALUE self)
-{
-    rb_warning("StringScanner#getbyte is obsolete; use #get_byte instead");
-    return strscan_get_byte(self);
-}
-
-/*
  * :markup: markdown
  * :include: strscan/link_refs.txt
  *
@@ -1218,7 +1283,7 @@ strscan_getbyte(VALUE self)
  * Returns the substring `string[pos, length]`;
  * does not update [match values][9] or [positions][11]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.pos = 3
  * scanner.peek(3)   # => "bar"
@@ -1243,20 +1308,122 @@ strscan_peek(VALUE self, VALUE vlen)
     return extract_beg_len(p, p->curr, len);
 }
 
-/*
- * call-seq:
- *   peep
- *
- * Equivalent to #peek.
- * This method is obsolete; use #peek instead.
- */
+static VALUE
+strscan_parse_integer(struct strscanner *p, int base, long len)
+{
+    VALUE buffer_v, integer;
 
- /* :nodoc: */
+    char *buffer = RB_ALLOCV_N(char, buffer_v, len + 1);
+
+    MEMCPY(buffer, CURPTR(p), char, len);
+    buffer[len] = '\0';
+    integer = rb_cstr2inum(buffer, base);
+    RB_ALLOCV_END(buffer_v);
+    p->curr += len;
+
+    MATCHED(p);
+    adjust_registers_to_matched(p);
+
+    return integer;
+}
+
+static inline bool
+strscan_ascii_compat_fastpath(VALUE str)
+{
+    int encindex = ENCODING_GET_INLINED(str);
+    /* The overwhelming majority of strings are in one of these 3 encodings. */
+    return encindex == utf8_encindex || encindex == binary_encindex || encindex == usascii_encindex;
+}
+
+static inline void
+strscan_must_ascii_compat(VALUE str)
+{
+    /* The overwhelming majority of strings are in one of these 3 encodings. */
+    if (RB_LIKELY(strscan_ascii_compat_fastpath(str))) {
+        return;
+    }
+
+    rb_must_asciicompat(str);
+}
+
+/* :nodoc: */
+static VALUE
+strscan_scan_base10_integer(VALUE self)
+{
+    char *ptr;
+    long len = 0, remaining_len;
+    struct strscanner *p;
+
+    GET_SCANNER(self, p);
+    CLEAR_MATCH_STATUS(p);
+
+    strscan_must_ascii_compat(p->str);
+
+    ptr = CURPTR(p);
+
+    remaining_len = S_RESTLEN(p);
+
+    if (remaining_len <= 0) {
+        return Qnil;
+    }
+
+    if (ptr[len] == '-' || ptr[len] == '+') {
+        len++;
+    }
+
+    if (!rb_isdigit(ptr[len])) {
+        return Qnil;
+    }
+
+    p->prev = p->curr;
+
+    while (len < remaining_len && rb_isdigit(ptr[len])) {
+        len++;
+    }
+
+    return strscan_parse_integer(p, 10, len);
+}
+
+/* :nodoc: */
 static VALUE
-strscan_peep(VALUE self, VALUE vlen)
+strscan_scan_base16_integer(VALUE self)
 {
-    rb_warning("StringScanner#peep is obsolete; use #peek instead");
-    return strscan_peek(self, vlen);
+    char *ptr;
+    long len = 0, remaining_len;
+    struct strscanner *p;
+
+    GET_SCANNER(self, p);
+    CLEAR_MATCH_STATUS(p);
+
+    strscan_must_ascii_compat(p->str);
+
+    ptr = CURPTR(p);
+
+    remaining_len = S_RESTLEN(p);
+
+    if (remaining_len <= 0) {
+        return Qnil;
+    }
+
+    if (ptr[len] == '-' || ptr[len] == '+') {
+        len++;
+    }
+
+    if ((remaining_len >= (len + 3)) && ptr[len] == '0' && ptr[len + 1] == 'x' && rb_isxdigit(ptr[len + 2])) {
+        len += 2;
+    }
+
+    if (len >= remaining_len || !rb_isxdigit(ptr[len])) {
+        return Qnil;
+    }
+
+    p->prev = p->curr;
+
+    while (len < remaining_len && rb_isxdigit(ptr[len])) {
+        len++;
+    }
+
+    return strscan_parse_integer(p, 16, len);
 }
 
 /*
@@ -1269,7 +1436,7 @@ strscan_peep(VALUE self, VALUE vlen)
  * Sets the [position][2] to its value previous to the recent successful
  * [match][17] attempt:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.scan(/foo/)
  * put_situation(scanner)
@@ -1290,7 +1457,7 @@ strscan_peep(VALUE self, VALUE vlen)
  *
  * Raises an exception if match values are clear:
  *
- * ```
+ * ```rb
  * scanner.scan(/nope/)           # => nil
  * match_values_cleared?(scanner) # => true
  * scanner.unscan                 # Raises StringScanner::Error.
@@ -1364,7 +1531,7 @@ strscan_bol_p(VALUE self)
  * Returns whether the [position][2]
  * is at the end of the [stored string][1]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.eos? # => false
  * pos = 3
@@ -1385,26 +1552,9 @@ strscan_eos_p(VALUE self)
 
 /*
  * call-seq:
- *   empty?
- *
- * Equivalent to #eos?.
- * This method is obsolete, use #eos? instead.
- */
-
- /* :nodoc: */
-static VALUE
-strscan_empty_p(VALUE self)
-{
-    rb_warning("StringScanner#empty? is obsolete; use #eos? instead");
-    return strscan_eos_p(self);
-}
-
-/*
- * call-seq:
  *   rest?
  *
  * Returns true if and only if there is more data in the string.  See #eos?.
- * This method is obsolete; use #eos? instead.
  *
  *   s = StringScanner.new('test string')
  *   # These two are opposites
@@ -1433,7 +1583,7 @@ strscan_rest_p(VALUE self)
  * `false` otherwise;
  * see [Basic Matched Values][18]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.matched?       # => false
  * scanner.pos = 3
@@ -1465,7 +1615,7 @@ strscan_matched_p(VALUE self)
  * or `nil` otherwise;
  * see [Basic Matched Values][18]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.matched        # => nil
  * scanner.pos = 3
@@ -1500,7 +1650,7 @@ strscan_matched(VALUE self)
  * or `nil` otherwise;
  * see [Basic Matched Values][18]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.matched_size   # => nil
  *
@@ -1526,19 +1676,49 @@ strscan_matched_size(VALUE self)
 static int
 name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name, const char* name_end, rb_encoding *enc)
 {
-    int num;
-
-    num = onig_name_to_backref_number(RREGEXP_PTR(regexp),
-	(const unsigned char* )name, (const unsigned char* )name_end, regs);
-    if (num >= 1) {
-	return num;
-    }
-    else {
-	rb_enc_raise(enc, rb_eIndexError, "undefined group name reference: %.*s",
-					  rb_long2int(name_end - name), name);
+    if (RTEST(regexp)) {
+        int num = onig_name_to_backref_number(RREGEXP_PTR(regexp),
+                                              (const unsigned char* )name,
+                                              (const unsigned char* )name_end,
+                                              regs);
+        if (num >= 1) {
+	    return num;
+        }
     }
+    rb_enc_raise(enc, rb_eIndexError, "undefined group name reference: %.*s",
+                 rb_long2int(name_end - name), name);
+}
 
-    UNREACHABLE;
+/*
+ * Resolve capture group index from Integer, Symbol, or String.
+ * Returns the resolved register index, or -1 if unmatched/out of range.
+ * For Symbol/String specifiers, raises IndexError if the named group
+ * does not exist.
+ */
+static long
+resolve_capture_index(struct strscanner *p, VALUE specifier)
+{
+    const char *name;
+    long i;
+    if (! MATCHED_P(p)) return -1;
+    switch (TYPE(specifier)) {
+        case T_SYMBOL:
+            specifier = rb_sym2str(specifier);
+            /* fall through */
+        case T_STRING:
+            RSTRING_GETMEM(specifier, name, i);
+            i = name_to_backref_number(&(p->regs), p->regex, name, name + i,
+                                       rb_enc_get(specifier));
+            break;
+        default:
+            i = NUM2LONG(specifier);
+    }
+    if (i < 0)
+        i += p->regs.num_regs;
+    if (i < 0)                 return -1;
+    if (i >= p->regs.num_regs) return -1;
+    if (p->regs.beg[i] == -1)  return -1;
+    return i;
 }
 
 /*
@@ -1554,14 +1734,14 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * When there are captures:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('Fri Dec 12 1975 14:39')
  * scanner.scan(/(?<wday>\w+) (?<month>\w+) (?<day>\d+) /)
  * ```
  *
  * - `specifier` zero: returns the entire matched substring:
  *
- *     ```
+ *     ```rb
  *     scanner[0]         # => "Fri Dec 12 "
  *     scanner.pre_match  # => ""
  *     scanner.post_match # => "1975 14:39"
@@ -1569,7 +1749,7 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * - `specifier` positive integer. returns the `n`th capture, or `nil` if out of range:
  *
- *     ```
+ *     ```rb
  *     scanner[1] # => "Fri"
  *     scanner[2] # => "Dec"
  *     scanner[3] # => "12"
@@ -1578,7 +1758,7 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * - `specifier` negative integer. counts backward from the last subgroup:
  *
- *     ```
+ *     ```rb
  *     scanner[-1] # => "12"
  *     scanner[-4] # => "Fri Dec 12 "
  *     scanner[-5] # => nil
@@ -1586,7 +1766,7 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * - `specifier` symbol or string. returns the named subgroup, or `nil` if no such:
  *
- *     ```
+ *     ```rb
  *     scanner[:wday]  # => "Fri"
  *     scanner['wday'] # => "Fri"
  *     scanner[:month] # => "Dec"
@@ -1596,7 +1776,7 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * When there are no captures, only `[0]` returns non-`nil`:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.exist?(/bar/)
  * scanner[0] # => "bar"
@@ -1605,7 +1785,7 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
  *
  * For a failed match, even `[0]` returns `nil`:
  *
- * ```
+ * ```rb
  * scanner.scan(/nope/) # => nil
  * scanner[0]           # => nil
  * scanner[1]           # => nil
@@ -1615,31 +1795,12 @@ name_to_backref_number(struct re_registers *regs, VALUE regexp, const char* name
 static VALUE
 strscan_aref(VALUE self, VALUE idx)
 {
-    const char *name;
     struct strscanner *p;
     long i;
 
     GET_SCANNER(self, p);
-    if (! MATCHED_P(p))        return Qnil;
-
-    switch (TYPE(idx)) {
-        case T_SYMBOL:
-            idx = rb_sym2str(idx);
-            /* fall through */
-        case T_STRING:
-            if (!RTEST(p->regex)) return Qnil;
-            RSTRING_GETMEM(idx, name, i);
-            i = name_to_backref_number(&(p->regs), p->regex, name, name + i, rb_enc_get(idx));
-            break;
-        default:
-            i = NUM2LONG(idx);
-    }
-
-    if (i < 0)
-        i += p->regs.num_regs;
-    if (i < 0)                 return Qnil;
-    if (i >= p->regs.num_regs) return Qnil;
-    if (p->regs.beg[i] == -1)  return Qnil;
+    i = resolve_capture_index(p, idx);
+    if (i < 0) return Qnil;
 
     return extract_range(p,
                          adjust_register_position(p, p->regs.beg[i]),
@@ -1648,6 +1809,81 @@ strscan_aref(VALUE self, VALUE idx)
 
 /*
  * :markup: markdown
+ *
+ * call-seq:
+ *   integer_at(specifier, base=10) -> integer or nil
+ *
+ * Returns the captured substring at the given `specifier` as an Integer,
+ * following the behavior of `String#to_i(base)`.
+ *
+ * `specifier` can be an Integer (positive, negative, or zero), a Symbol,
+ * or a String for named capture groups.
+ *
+ * Returns `nil` if:
+ * - No match has been performed or the last match failed
+ * - The `specifier` is an Integer and is out of range
+ * - The group at `specifier` did not participate in the match
+ *
+ * Raises IndexError if `specifier` is a Symbol or String that does not
+ * correspond to a named capture group, consistent with
+ * `StringScanner#[]`.
+ *
+ * This is semantically equivalent to `self[specifier]&.to_i(base)`
+ * but avoids the allocation of a temporary String when possible.
+ *
+ * ```rb
+ * scanner = StringScanner.new("2024-06-15")
+ * scanner.scan(/(\d{4})-(\d{2})-(\d{2})/)
+ * scanner.integer_at(1)       # => 2024
+ * scanner.integer_at(1, 16)   # => 8228
+ * ```
+ */
+static VALUE
+strscan_integer_at(int argc, VALUE *argv, VALUE self)
+{
+    struct strscanner *p;
+    long i;
+    long beg, end, len;
+    const char *ptr;
+    VALUE rb_specifier;
+    VALUE rb_base;
+    int base = 10;
+
+    GET_SCANNER(self, p);
+    rb_scan_args(argc, argv, "11", &rb_specifier, &rb_base);
+    if (argc > 1)
+        base = NUM2INT(rb_base);
+    i = resolve_capture_index(p, rb_specifier);
+    if (i < 0)
+        return Qnil;
+
+    beg = adjust_register_position(p, p->regs.beg[i]);
+    end = adjust_register_position(p, p->regs.end[i]);
+    len = end - beg;
+    ptr = S_PBEG(p) + beg;
+#ifdef HAVE_RB_INT_PARSE_CSTR
+    {
+      /*
+       * Ruby 2.5 or later export the rb_int_parse_cstr() symbol but
+       * prototype definition isn't provided. Ruby 4.1 or later
+       * provide prototype definition.
+       */
+#  ifndef RB_INT_PARSE_DEFAULT
+        VALUE rb_int_parse_cstr(const char *str, ssize_t len, char **endp,
+                                size_t *ndigits, int base, int flags);
+#    define RB_INT_PARSE_DEFAULT 0x07
+#  endif
+        char *endp;
+        return rb_int_parse_cstr(ptr, len, &endp, NULL, base,
+                                 RB_INT_PARSE_DEFAULT);
+    }
+#else
+    return rb_str_to_inum(rb_str_new(ptr, len), base, 0);
+#endif
+}
+
+/*
+ * :markup: markdown
  * :include: strscan/link_refs.txt
  *
  * call-seq:
@@ -1656,7 +1892,7 @@ strscan_aref(VALUE self, VALUE idx)
  * Returns the count of captures if the most recent match attempt succeeded, `nil` otherwise;
  * see [Captures Match Values][13]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('Fri Dec 12 1975 14:39')
  * scanner.size                        # => nil
  *
@@ -1690,7 +1926,7 @@ strscan_size(VALUE self)
  * Returns the array of [captured match values][13] at indexes `(1..)`
  * if the most recent match attempt succeeded, or `nil` otherwise:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('Fri Dec 12 1975 14:39')
  * scanner.captures         # => nil
  *
@@ -1745,7 +1981,7 @@ strscan_captures(VALUE self)
  * For each `specifier`, the returned substring is `[specifier]`;
  * see #[].
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('Fri Dec 12 1975 14:39')
  * pattern = /(?<wday>\w+) (?<month>\w+) (?<day>\d+) /
  * scanner.match?(pattern)
@@ -1785,7 +2021,7 @@ strscan_values_at(int argc, VALUE *argv, VALUE self)
  * or `nil` otherwise;
  * see [Basic Match Values][18]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.pre_match      # => nil
  *
@@ -1822,7 +2058,7 @@ strscan_pre_match(VALUE self)
  * or `nil` otherwise;
  * see [Basic Match Values][18]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.post_match     # => nil
  *
@@ -1857,7 +2093,7 @@ strscan_post_match(VALUE self)
  * Returns the 'rest' of the [stored string][1] (all after the current [position][2]),
  * which is the [target substring][3]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.rest # => "foobarbaz"
  * scanner.pos = 3
@@ -1888,7 +2124,7 @@ strscan_rest(VALUE self)
  *
  * Returns the size (in bytes) of the #rest of the [stored string][1]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('foobarbaz')
  * scanner.rest      # => "foobarbaz"
  * scanner.rest_size # => 9
@@ -1915,22 +2151,6 @@ strscan_rest_size(VALUE self)
     return INT2FIX(i);
 }
 
-/*
- * call-seq:
- *   restsize
- *
- * <tt>s.restsize</tt> is equivalent to <tt>s.rest_size</tt>.
- * This method is obsolete; use #rest_size instead.
- */
-
- /* :nodoc: */
-static VALUE
-strscan_restsize(VALUE self)
-{
-    rb_warning("StringScanner#restsize is obsolete; use #rest_size instead");
-    return strscan_rest_size(self);
-}
-
 #define INSPECT_LENGTH 5
 
 /*
@@ -1947,7 +2167,7 @@ strscan_restsize(VALUE self)
  * 3. The substring preceding the current position.
  * 4. The substring following the current position (which is also the [target substring][3]).
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new("Fri Dec 12 1975 14:39")
  * scanner.pos = 11
  * scanner.inspect # => "#<StringScanner 11/21 \"...c 12 \" @ \"1975 ...\">"
@@ -1955,14 +2175,14 @@ strscan_restsize(VALUE self)
  *
  * If at beginning-of-string, item 4 above (following substring) is omitted:
  *
- * ```
+ * ```rb
  * scanner.reset
  * scanner.inspect # => "#<StringScanner 0/21 @ \"Fri D...\">"
  * ```
  *
  * If at end-of-string, all items above are omitted:
  *
- * ```
+ * ```rb
  * scanner.terminate
  * scanner.inspect # => "#<StringScanner fin>"
  * ```
@@ -2073,7 +2293,10 @@ named_captures_iter(const OnigUChar *name,
     VALUE value = RUBY_Qnil;
     int i;
     for (i = 0; i < back_num; i++) {
-        value = strscan_aref(data->self, INT2NUM(back_refs[i]));
+        VALUE v = strscan_aref(data->self, INT2NUM(back_refs[i]));
+        if (!RB_NIL_P(v)) {
+            value = v;
+        }
     }
     rb_hash_aset(data->captures, key, value);
     return 0;
@@ -2086,11 +2309,11 @@ named_captures_iter(const OnigUChar *name,
  * call-seq:
  *   named_captures -> hash
  *
- * Returns the array of captured match values at indexes (1..)
- * if the most recent match attempt succeeded, or nil otherwise;
+ * Returns a hash of named captures for the most recent regexp match,
+ * or an empty hash if there are no named captures;
  * see [Captured Match Values][13]:
  *
- * ```
+ * ```rb
  * scanner = StringScanner.new('Fri Dec 12 1975 14:39')
  * scanner.named_captures # => {}
  *
@@ -2111,8 +2334,8 @@ static VALUE
 strscan_named_captures(VALUE self)
 {
     struct strscanner *p;
-    GET_SCANNER(self, p);
     named_captures_data data;
+    GET_SCANNER(self, p);
     data.self = self;
     data.captures = rb_hash_new();
     if (!RB_NIL_P(p->regex)) {
@@ -2127,6 +2350,13 @@ strscan_named_captures(VALUE self)
    ======================================================================= */
 
 /*
+ * Document-class: StringScanner::Error
+ *
+ * The error class for StringScanner.
+ * See StringScanner#unscan.
+ */
+
+/*
  * Document-class: StringScanner
  *
  * :markup: markdown
@@ -2146,12 +2376,15 @@ Init_strscan(void)
     ID id_scanerr = rb_intern("ScanError");
     VALUE tmp;
 
-    id_byteslice = rb_intern("byteslice");
+    usascii_encindex = rb_usascii_encindex();
+    utf8_encindex = rb_utf8_encindex();
+    binary_encindex = rb_ascii8bit_encindex();
 
     StringScanner = rb_define_class("StringScanner", rb_cObject);
     ScanError = rb_define_class_under(StringScanner, "Error", rb_eStandardError);
     if (!rb_const_defined(rb_cObject, id_scanerr)) {
 	rb_const_set(rb_cObject, id_scanerr, ScanError);
+	rb_deprecate_constant(rb_cObject, "ScanError");
     }
     tmp = rb_str_new2(STRSCAN_VERSION);
     rb_obj_freeze(tmp);
@@ -2159,6 +2392,7 @@ Init_strscan(void)
     tmp = rb_str_new2("$Id$");
     rb_obj_freeze(tmp);
     rb_const_set(StringScanner, rb_intern("Id"), tmp);
+    rb_deprecate_constant(StringScanner, "Id");
 
     rb_define_alloc_func(StringScanner, strscan_s_allocate);
     rb_define_private_method(StringScanner, "initialize", strscan_initialize, -1);
@@ -2166,7 +2400,6 @@ Init_strscan(void)
     rb_define_singleton_method(StringScanner, "must_C_version", strscan_s_mustc, 0);
     rb_define_method(StringScanner, "reset",       strscan_reset,       0);
     rb_define_method(StringScanner, "terminate",   strscan_terminate,   0);
-    rb_define_method(StringScanner, "clear",       strscan_clear,       0);
     rb_define_method(StringScanner, "string",      strscan_get_string,  0);
     rb_define_method(StringScanner, "string=",     strscan_set_string,  1);
     rb_define_method(StringScanner, "concat",      strscan_concat,      1);
@@ -2191,24 +2424,25 @@ Init_strscan(void)
 
     rb_define_method(StringScanner, "getch",       strscan_getch,       0);
     rb_define_method(StringScanner, "get_byte",    strscan_get_byte,    0);
-    rb_define_method(StringScanner, "getbyte",     strscan_getbyte,     0);
     rb_define_method(StringScanner, "scan_byte",   strscan_scan_byte,   0);
     rb_define_method(StringScanner, "peek",        strscan_peek,        1);
     rb_define_method(StringScanner, "peek_byte",   strscan_peek_byte,   0);
-    rb_define_method(StringScanner, "peep",        strscan_peep,        1);
+
+    rb_define_private_method(StringScanner, "scan_base10_integer", strscan_scan_base10_integer, 0);
+    rb_define_private_method(StringScanner, "scan_base16_integer", strscan_scan_base16_integer, 0);
 
     rb_define_method(StringScanner, "unscan",      strscan_unscan,      0);
 
     rb_define_method(StringScanner, "beginning_of_line?", strscan_bol_p, 0);
     rb_alias(StringScanner, rb_intern("bol?"), rb_intern("beginning_of_line?"));
     rb_define_method(StringScanner, "eos?",        strscan_eos_p,       0);
-    rb_define_method(StringScanner, "empty?",      strscan_empty_p,     0);
     rb_define_method(StringScanner, "rest?",       strscan_rest_p,      0);
 
     rb_define_method(StringScanner, "matched?",    strscan_matched_p,   0);
     rb_define_method(StringScanner, "matched",     strscan_matched,     0);
     rb_define_method(StringScanner, "matched_size", strscan_matched_size, 0);
     rb_define_method(StringScanner, "[]",          strscan_aref,        1);
+    rb_define_method(StringScanner, "integer_at",  strscan_integer_at, -1);
     rb_define_method(StringScanner, "pre_match",   strscan_pre_match,   0);
     rb_define_method(StringScanner, "post_match",  strscan_post_match,  0);
     rb_define_method(StringScanner, "size",        strscan_size,        0);
@@ -2217,7 +2451,6 @@ Init_strscan(void)
 
     rb_define_method(StringScanner, "rest",        strscan_rest,        0);
     rb_define_method(StringScanner, "rest_size",   strscan_rest_size,   0);
-    rb_define_method(StringScanner, "restsize",    strscan_restsize,    0);
 
     rb_define_method(StringScanner, "inspect",     strscan_inspect,     0);
 
diff --git a/ext/strscan/strscan.gemspec b/ext/strscan/strscan.gemspec
index 925edcd2d3..a51285fa7e 100644
--- a/ext/strscan/strscan.gemspec
+++ b/ext/strscan/strscan.gemspec
@@ -16,17 +16,20 @@ Gem::Specification.new do |s|
   s.summary = "Provides lexical scanning operations on a String."
   s.description = "Provides lexical scanning operations on a String."
 
-  files = [
-    "COPYING",
-    "LICENSE.txt",
+  files = %w[
+    COPYING
+    LICENSE.txt
+    lib/strscan.rb
+    lib/strscan/strscan.rb
+    lib/strscan/truffleruby.rb
   ]
+
+  s.require_paths = %w{lib}
+
   if RUBY_ENGINE == "jruby"
-    s.require_paths = %w{ext/jruby/lib lib}
-    files << "ext/jruby/lib/strscan.rb"
     files << "lib/strscan.jar"
     s.platform = "java"
   else
-    s.require_paths = %w{lib}
     files << "ext/strscan/extconf.rb"
     files << "ext/strscan/strscan.c"
     s.rdoc_options << "-idoc"
diff --git a/ext/win32/lib/win32/registry.rb b/ext/win32/lib/win32/registry.rb
deleted file mode 100644
index 92b95d1bf7..0000000000
--- a/ext/win32/lib/win32/registry.rb
+++ /dev/null
@@ -1,912 +0,0 @@
-# frozen_string_literal: true
-require 'fiddle/import'
-
-module Win32
-
-=begin rdoc
-= Win32 Registry
-
-win32/registry is registry accessor library for Win32 platform.
-It uses importer to call Win32 Registry APIs.
-
-== example
-  Win32::Registry::HKEY_CURRENT_USER.open('SOFTWARE\foo') do |reg|
-    value = reg['foo']                               # read a value
-    value = reg['foo', Win32::Registry::REG_SZ]      # read a value with type
-    type, value = reg.read('foo')                    # read a value
-    reg['foo'] = 'bar'                               # write a value
-    reg['foo', Win32::Registry::REG_SZ] = 'bar'      # write a value with type
-    reg.write('foo', Win32::Registry::REG_SZ, 'bar') # write a value
-
-    reg.each_value { |name, type, data| ... }        # Enumerate values
-    reg.each_key { |key, wtime| ... }                # Enumerate subkeys
-
-    reg.delete_value(name)                         # Delete a value
-    reg.delete_key(name)                           # Delete a subkey
-    reg.delete_key(name, true)                     # Delete a subkey recursively
-  end
-
-= Reference
-
-== Win32::Registry class
-
---- info
-
---- num_keys
-
---- max_key_length
-
---- num_values
-
---- max_value_name_length
-
---- max_value_length
-
---- descriptor_length
-
---- wtime
-    Returns an item of key information.
-
-=== constants
---- HKEY_CLASSES_ROOT
-
---- HKEY_CURRENT_USER
-
---- HKEY_LOCAL_MACHINE
-
---- HKEY_PERFORMANCE_DATA
-
---- HKEY_CURRENT_CONFIG
-
---- HKEY_DYN_DATA
-
-    Win32::Registry object whose key is predefined key.
-For detail, see the MSDN[http://msdn.microsoft.com/library/en-us/sysinfo/base/predefined_keys.asp] article.
-
-=end rdoc
-
-  WCHAR = Encoding::UTF_16LE
-  WCHAR_NUL = "\0".encode(WCHAR).freeze
-  WCHAR_CR = "\r".encode(WCHAR).freeze
-  WCHAR_SIZE = WCHAR_NUL.bytesize
-  LOCALE = Encoding.find(Encoding.locale_charmap)
-
-  class Registry
-
-    #
-    # For detail, see the MSDN[http://msdn.microsoft.com/library/en-us/sysinfo/base/registry.asp].
-    #
-    # --- HKEY_*
-    #
-    #     Predefined key ((*handle*)).
-    #     These are Integer, not Win32::Registry.
-    #
-    # --- REG_*
-    #
-    #     Registry value type.
-    #
-    # --- KEY_*
-    #
-    #     Security access mask.
-    #
-    # --- KEY_OPTIONS_*
-    #
-    #     Key options.
-    #
-    # --- REG_CREATED_NEW_KEY
-    #
-    # --- REG_OPENED_EXISTING_KEY
-    #
-    #     If the key is created newly or opened existing key.
-    #     See also Registry#disposition method.
-    module Constants
-      HKEY_CLASSES_ROOT = 0x80000000
-      HKEY_CURRENT_USER = 0x80000001
-      HKEY_LOCAL_MACHINE = 0x80000002
-      HKEY_USERS = 0x80000003
-      HKEY_PERFORMANCE_DATA = 0x80000004
-      HKEY_PERFORMANCE_TEXT = 0x80000050
-      HKEY_PERFORMANCE_NLSTEXT = 0x80000060
-      HKEY_CURRENT_CONFIG = 0x80000005
-      HKEY_DYN_DATA = 0x80000006
-
-      REG_NONE = 0
-      REG_SZ = 1
-      REG_EXPAND_SZ = 2
-      REG_BINARY = 3
-      REG_DWORD = 4
-      REG_DWORD_LITTLE_ENDIAN = 4
-      REG_DWORD_BIG_ENDIAN = 5
-      REG_LINK = 6
-      REG_MULTI_SZ = 7
-      REG_RESOURCE_LIST = 8
-      REG_FULL_RESOURCE_DESCRIPTOR = 9
-      REG_RESOURCE_REQUIREMENTS_LIST = 10
-      REG_QWORD = 11
-      REG_QWORD_LITTLE_ENDIAN = 11
-
-      STANDARD_RIGHTS_READ = 0x00020000
-      STANDARD_RIGHTS_WRITE = 0x00020000
-      KEY_QUERY_VALUE = 0x0001
-      KEY_SET_VALUE = 0x0002
-      KEY_CREATE_SUB_KEY = 0x0004
-      KEY_ENUMERATE_SUB_KEYS = 0x0008
-      KEY_NOTIFY = 0x0010
-      KEY_CREATE_LINK = 0x0020
-      KEY_READ = STANDARD_RIGHTS_READ |
-        KEY_QUERY_VALUE | KEY_ENUMERATE_SUB_KEYS | KEY_NOTIFY
-      KEY_WRITE = STANDARD_RIGHTS_WRITE |
-        KEY_SET_VALUE | KEY_CREATE_SUB_KEY
-      KEY_EXECUTE = KEY_READ
-      KEY_ALL_ACCESS = KEY_READ | KEY_WRITE | KEY_CREATE_LINK
-
-      REG_OPTION_RESERVED = 0x0000
-      REG_OPTION_NON_VOLATILE = 0x0000
-      REG_OPTION_VOLATILE = 0x0001
-      REG_OPTION_CREATE_LINK = 0x0002
-      REG_OPTION_BACKUP_RESTORE = 0x0004
-      REG_OPTION_OPEN_LINK = 0x0008
-      REG_LEGAL_OPTION = REG_OPTION_RESERVED |
-        REG_OPTION_NON_VOLATILE | REG_OPTION_CREATE_LINK |
-        REG_OPTION_BACKUP_RESTORE | REG_OPTION_OPEN_LINK
-
-      REG_CREATED_NEW_KEY = 1
-      REG_OPENED_EXISTING_KEY = 2
-
-      REG_WHOLE_HIVE_VOLATILE = 0x0001
-      REG_REFRESH_HIVE = 0x0002
-      REG_NO_LAZY_FLUSH = 0x0004
-      REG_FORCE_RESTORE = 0x0008
-
-      MAX_KEY_LENGTH = 514
-      MAX_VALUE_LENGTH = 32768
-    end
-    include Constants
-    include Enumerable
-
-    #
-    # Error
-    #
-    class Error < ::StandardError
-      module Kernel32
-        extend Fiddle::Importer
-        dlload "kernel32.dll"
-      end
-      FormatMessageW = Kernel32.extern "int FormatMessageW(int, void *, int, int, void *, int, void *)", :stdcall
-      def initialize(code)
-        @code = code
-        buff = WCHAR_NUL * 1024
-        lang = 0
-        begin
-          len = FormatMessageW.call(0x1200, 0, code, lang, buff, 1024, 0)
-          msg = buff.byteslice(0, len * WCHAR_SIZE)
-          msg.delete!(WCHAR_CR)
-          msg.chomp!
-          msg.encode!(LOCALE)
-        rescue EncodingError
-          raise unless lang == 0
-          lang = 0x0409         # en_US
-          retry
-        end
-        super msg
-      end
-      attr_reader :code
-    end
-
-    #
-    # Predefined Keys
-    #
-    class PredefinedKey < Registry
-      def initialize(hkey, keyname)
-        @hkey = hkey
-        @parent = nil
-        @keyname = keyname
-        @disposition = REG_OPENED_EXISTING_KEY
-      end
-
-      # Predefined keys cannot be closed
-      def close
-        raise Error.new(5) ## ERROR_ACCESS_DENIED
-      end
-
-      # Fake #class method for Registry#open, Registry#create
-      def class
-        Registry
-      end
-
-      # Make all
-      Constants.constants.grep(/^HKEY_/) do |c|
-        Registry.const_set c, new(Constants.const_get(c), c.to_s)
-      end
-    end
-
-    #
-    # Win32 APIs
-    #
-    module API
-      include Constants
-      extend Fiddle::Importer
-      dlload "advapi32.dll"
-      [
-        "long RegOpenKeyExW(void *, void *, long, long, void *)",
-        "long RegCreateKeyExW(void *, void *, long, long, long, long, void *, void *, void *)",
-        "long RegEnumValueW(void *, long, void *, void *, void *, void *, void *, void *)",
-        "long RegEnumKeyExW(void *, long, void *, void *, void *, void *, void *, void *)",
-        "long RegQueryValueExW(void *, void *, void *, void *, void *, void *)",
-        "long RegSetValueExW(void *, void *, long, long, void *, long)",
-        "long RegDeleteValueW(void *, void *)",
-        "long RegDeleteKeyW(void *, void *)",
-        "long RegFlushKey(void *)",
-        "long RegCloseKey(void *)",
-        "long RegQueryInfoKey(void *, void *, void *, void *, void *, void *, void *, void *, void *, void *, void *, void *)",
-      ].each do |fn|
-        cfunc = extern fn, :stdcall
-        const_set cfunc.name.intern, cfunc
-      end
-
-      module_function
-
-      def check(result)
-        raise Error, result, caller(1) if result != 0
-      end
-
-      def win64?
-        /^(?:x64|x86_64)/ =~ RUBY_PLATFORM
-      end
-
-      TEMPLATE_HANDLE = 'J<'
-
-      def packhandle(h)
-        [h].pack(TEMPLATE_HANDLE)
-      end
-
-      def unpackhandle(h)
-        (h + [0].pack(TEMPLATE_HANDLE)).unpack1(TEMPLATE_HANDLE)
-      end
-
-      TEMPLATE_DWORD = 'V'
-
-      def packdw(dw)
-        [dw].pack(TEMPLATE_DWORD)
-      end
-
-      def unpackdw(dw)
-        (dw + [0].pack(TEMPLATE_DWORD)).unpack1(TEMPLATE_DWORD)
-      end
-
-      TEMPLATE_QWORD = 'Q<'
-
-      def packqw(qw)
-        [qw].pack(TEMPLATE_QWORD)
-      end
-
-      def unpackqw(qw)
-        (qw + [0].pack(TEMPLATE_QWORD)).unpack1(TEMPLATE_QWORD)
-      end
-
-      def make_wstr(str)
-        str.encode(WCHAR)
-      end
-
-      def OpenKey(hkey, name, opt, desired)
-        result = packhandle(0)
-        check RegOpenKeyExW.call(hkey, make_wstr(name), opt, desired, result)
-        unpackhandle(result)
-      end
-
-      def CreateKey(hkey, name, opt, desired)
-        result = packhandle(0)
-        disp = packdw(0)
-        check RegCreateKeyExW.call(hkey, make_wstr(name), 0, 0, opt, desired,
-                                   0, result, disp)
-        [ unpackhandle(result), unpackdw(disp) ]
-      end
-
-      def EnumValue(hkey, index)
-        name = WCHAR_NUL * Constants::MAX_KEY_LENGTH
-        size = packdw(Constants::MAX_KEY_LENGTH)
-        check RegEnumValueW.call(hkey, index, name, size, 0, 0, 0, 0)
-        name.byteslice(0, unpackdw(size) * WCHAR_SIZE)
-      end
-
-      def EnumKey(hkey, index)
-        name = WCHAR_NUL * Constants::MAX_KEY_LENGTH
-        size = packdw(Constants::MAX_KEY_LENGTH)
-        wtime = ' ' * 8
-        check RegEnumKeyExW.call(hkey, index, name, size, 0, 0, 0, wtime)
-        [ name.byteslice(0, unpackdw(size) * WCHAR_SIZE), unpackqw(wtime) ]
-      end
-
-      def QueryValue(hkey, name)
-        type = packdw(0)
-        size = packdw(0)
-        name = make_wstr(name)
-        check RegQueryValueExW.call(hkey, name, 0, type, 0, size)
-        data = "\0".b * unpackdw(size)
-        check RegQueryValueExW.call(hkey, name, 0, type, data, size)
-        [ unpackdw(type), data[0, unpackdw(size)] ]
-      end
-
-      def SetValue(hkey, name, type, data, size)
-        case type
-        when REG_SZ, REG_EXPAND_SZ, REG_MULTI_SZ
-          data = data.encode(WCHAR)
-          size ||= data.bytesize + WCHAR_SIZE
-        end
-        check RegSetValueExW.call(hkey, make_wstr(name), 0, type, data, size)
-      end
-
-      def DeleteValue(hkey, name)
-        check RegDeleteValueW.call(hkey, make_wstr(name))
-      end
-
-      def DeleteKey(hkey, name)
-        check RegDeleteKeyW.call(hkey, make_wstr(name))
-      end
-
-      def FlushKey(hkey)
-        check RegFlushKey.call(hkey)
-      end
-
-      def CloseKey(hkey)
-        check RegCloseKey.call(hkey)
-      end
-
-      def QueryInfoKey(hkey)
-        subkeys = packdw(0)
-        maxsubkeylen = packdw(0)
-        values = packdw(0)
-        maxvaluenamelen = packdw(0)
-        maxvaluelen = packdw(0)
-        secdescs = packdw(0)
-        wtime = ' ' * 8
-        check RegQueryInfoKey.call(hkey, 0, 0, 0, subkeys, maxsubkeylen, 0,
-          values, maxvaluenamelen, maxvaluelen, secdescs, wtime)
-        [ unpackdw(subkeys), unpackdw(maxsubkeylen), unpackdw(values),
-          unpackdw(maxvaluenamelen), unpackdw(maxvaluelen),
-          unpackdw(secdescs), unpackqw(wtime) ]
-      end
-    end
-
-    #
-    # Replace %\w+% into the environment value of what is contained between the %'s
-    # This method is used for REG_EXPAND_SZ.
-    #
-    # For detail, see expandEnvironmentStrings[http://msdn.microsoft.com/library/en-us/sysinfo/base/expandenvironmentstrings.asp] \Win32 \API.
-    #
-    def self.expand_environ(str)
-      str.gsub(Regexp.compile("%([^%]+)%".encode(str.encoding))) {
-        v = $1.encode(LOCALE)
-        (ENV[v] || ENV[v.upcase])&.encode(str.encoding) || $&
-      }
-    end
-
-    @@type2name = %w[
-      REG_NONE REG_SZ REG_EXPAND_SZ REG_BINARY REG_DWORD
-      REG_DWORD_BIG_ENDIAN REG_LINK REG_MULTI_SZ
-      REG_RESOURCE_LIST REG_FULL_RESOURCE_DESCRIPTOR
-      REG_RESOURCE_REQUIREMENTS_LIST REG_QWORD
-    ].inject([]) do |ary, type|
-      ary[Constants.const_get(type)] = type
-      ary
-    end.freeze
-
-    #
-    # Convert registry type value to readable string.
-    #
-    def self.type2name(type)
-      @@type2name[type] || type.to_s
-    end
-
-    #
-    # Convert 64-bit FILETIME integer into Time object.
-    #
-    def self.wtime2time(wtime)
-      Time.at((wtime - 116444736000000000) / 10000000)
-    end
-
-    #
-    # Convert Time object or Integer object into 64-bit FILETIME.
-    #
-    def self.time2wtime(time)
-      time.to_i * 10000000 + 116444736000000000
-    end
-
-    #
-    # constructor
-    #
-    private_class_method :new
-
-    #
-    # --- Registry.open(key, subkey, desired = KEY_READ, opt = REG_OPTION_RESERVED)
-    #
-    # --- Registry.open(key, subkey, desired = KEY_READ, opt = REG_OPTION_RESERVED) { |reg| ... }
-    #
-    # Open the registry key subkey under key.
-    # key is Win32::Registry object of parent key.
-    # You can use predefined key HKEY_* (see Constants)
-    # desired and opt is access mask and key option.
-    # For detail, see the MSDN[http://msdn.microsoft.com/library/en-us/sysinfo/base/regopenkeyex.asp].
-    # If block is given, the key is closed automatically.
-    def self.open(hkey, subkey, desired = KEY_READ, opt = REG_OPTION_RESERVED)
-      subkey = subkey.chomp('\\')
-      newkey = API.OpenKey(hkey.hkey, subkey, opt, desired)
-      obj = new(newkey, hkey, subkey, REG_OPENED_EXISTING_KEY)
-      if block_given?
-        begin
-          yield obj
-        ensure
-          obj.close
-        end
-      else
-        obj
-      end
-    end
-
-    #
-    # --- Registry.create(key, subkey, desired = KEY_ALL_ACCESS, opt = REG_OPTION_RESERVED)
-    #
-    # --- Registry.create(key, subkey, desired = KEY_ALL_ACCESS, opt = REG_OPTION_RESERVED) { |reg| ... }
-    #
-    # Create or open the registry key subkey under key.
-    # You can use predefined key HKEY_* (see Constants)
-    #
-    # If subkey is already exists, key is opened and Registry#created?
-    # method will return false.
-    #
-    # If block is given, the key is closed automatically.
-    #
-    def self.create(hkey, subkey, desired = KEY_ALL_ACCESS, opt = REG_OPTION_RESERVED)
-      newkey, disp = API.CreateKey(hkey.hkey, subkey, opt, desired)
-      obj = new(newkey, hkey, subkey, disp)
-      if block_given?
-        begin
-          yield obj
-        ensure
-          obj.close
-        end
-      else
-        obj
-      end
-    end
-
-    #
-    # finalizer
-    #
-    @@final = proc { |hkey| proc { API.CloseKey(hkey[0]) if hkey[0] } }
-
-    #
-    # initialize
-    #
-    def initialize(hkey, parent, keyname, disposition)
-      @hkey = hkey
-      @parent = parent
-      @keyname = keyname
-      @disposition = disposition
-      @hkeyfinal = [ hkey ]
-      ObjectSpace.define_finalizer self, @@final.call(@hkeyfinal)
-    end
-
-    #  Returns key handle value.
-    attr_reader :hkey
-    # Win32::Registry object of parent key, or nil if predefeined key.
-    attr_reader :parent
-    # Same as subkey value of Registry.open or
-    # Registry.create method.
-    attr_reader :keyname
-    #  Disposition value (REG_CREATED_NEW_KEY or REG_OPENED_EXISTING_KEY).
-    attr_reader :disposition
-
-    #
-    # Returns if key is created ((*newly*)).
-    # (see Registry.create) -- basically you call create
-    # then when you call created? on the instance returned
-    # it will tell if it was successful or not
-    #
-    def created?
-      @disposition == REG_CREATED_NEW_KEY
-    end
-
-    #
-    # Returns if key is not closed.
-    #
-    def open?
-      !@hkey.nil?
-    end
-
-    #
-    # Full path of key such as 'HKEY_CURRENT_USER\SOFTWARE\foo\bar'.
-    #
-    def name
-      parent = self
-      name = @keyname
-      while parent = parent.parent
-        name = parent.keyname + '\\' + name
-      end
-      name
-    end
-
-    def inspect
-      "\#<Win32::Registry key=#{name.inspect}>"
-    end
-
-    #
-    # marshalling is not allowed
-    #
-    def _dump(depth)
-      raise TypeError, "can't dump Win32::Registry"
-    end
-
-    #
-    # Same as Win32::Registry.open (self, subkey, desired, opt)
-    #
-    def open(subkey, desired = KEY_READ, opt = REG_OPTION_RESERVED, &blk)
-      self.class.open(self, subkey, desired, opt, &blk)
-    end
-
-    #
-    # Same as Win32::Registry.create (self, subkey, desired, opt)
-    #
-    def create(subkey, desired = KEY_ALL_ACCESS, opt = REG_OPTION_RESERVED, &blk)
-      self.class.create(self, subkey, desired, opt, &blk)
-    end
-
-    #
-    # Close key.
-    #
-    # After close, most method raise an error.
-    #
-    def close
-      API.CloseKey(@hkey)
-      @hkey = @parent = @keyname = nil
-      @hkeyfinal[0] = nil
-    end
-
-    #
-    # Enumerate values.
-    #
-    def each_value
-      index = 0
-      while true
-        begin
-          subkey = API.EnumValue(@hkey, index)
-        rescue Error
-          break
-        end
-        subkey = export_string(subkey)
-        begin
-          type, data = read(subkey)
-        rescue Error
-        else
-          yield subkey, type, data
-        end
-        index += 1
-      end
-      index
-    end
-    alias each each_value
-
-    #
-    # return values as an array
-    #
-    def values
-      vals_ary = []
-      each_value { |*, val| vals_ary << val }
-      vals_ary
-    end
-
-    #
-    # Enumerate subkeys.
-    #
-    # subkey is String which contains name of subkey.
-    # wtime is last write time as FILETIME (64-bit integer).
-    # (see Registry.wtime2time)
-    #
-    def each_key
-      index = 0
-      while true
-        begin
-          subkey, wtime = API.EnumKey(@hkey, index)
-        rescue Error
-          break
-        end
-        subkey = export_string(subkey)
-        yield subkey, wtime
-        index += 1
-      end
-      index
-    end
-
-    #
-    # return keys as an array
-    #
-    def keys
-      keys_ary = []
-      each_key { |key,| keys_ary << key }
-      keys_ary
-    end
-
-    # Read a registry value named name and return array of
-    # [ type, data ].
-    # When name is nil, the `default' value is read.
-    # type is value type. (see Win32::Registry::Constants module)
-    # data is value data, its class is:
-    # :REG_SZ, REG_EXPAND_SZ
-    #    String
-    # :REG_MULTI_SZ
-    #    Array of String
-    # :REG_DWORD, REG_DWORD_BIG_ENDIAN, REG_QWORD
-    #    Integer
-    # :REG_BINARY, REG_NONE
-    #    String (contains binary data)
-    #
-    # When rtype is specified, the value type must be included by
-    # rtype array, or TypeError is raised.
-    def read(name, *rtype)
-      type, data = API.QueryValue(@hkey, name)
-      unless rtype.empty? or rtype.include?(type)
-        raise TypeError, "Type mismatch (expect [#{
-          rtype.map{|t|Registry.type2name(t)}.join(', ')}] but #{
-          Registry.type2name(type)} present)"
-      end
-      case type
-      when REG_SZ, REG_EXPAND_SZ
-        [ type, data.encode(name.encoding, WCHAR).chop ]
-      when REG_MULTI_SZ
-        [ type, data.encode(name.encoding, WCHAR).split(/\0/) ]
-      when REG_BINARY, REG_NONE
-        [ type, data ]
-      when REG_DWORD
-        [ type, API.unpackdw(data) ]
-      when REG_DWORD_BIG_ENDIAN
-        [ type, data.unpack1('N') ]
-      when REG_QWORD
-        [ type, API.unpackqw(data) ]
-      else
-        raise TypeError, "Type #{Registry.type2name(type)} is not supported."
-      end
-    end
-
-    #
-    # Read a registry value named name and return its value data.
-    # The class of the value is the same as the #read method returns.
-    #
-    # If the value type is REG_EXPAND_SZ, returns value data whose environment
-    # variables are replaced.
-    # If the value type is neither REG_SZ, REG_MULTI_SZ, REG_DWORD,
-    # REG_DWORD_BIG_ENDIAN, nor REG_QWORD, TypeError is raised.
-    #
-    # The meaning of rtype is the same as for the #read method.
-    #
-    def [](name, *rtype)
-      type, data = read(name, *rtype)
-      case type
-      when REG_SZ, REG_DWORD, REG_QWORD, REG_MULTI_SZ
-        data
-      when REG_EXPAND_SZ
-        Registry.expand_environ(data)
-      else
-        raise TypeError, "Type #{Registry.type2name(type)} is not supported."
-      end
-    end
-
-    # Read a REG_SZ(read_s), REG_DWORD(read_i), or REG_BINARY(read_bin)
-    # registry value named name.
-    #
-    # If the values type does not match, TypeError is raised.
-    def read_s(name)
-      read(name, REG_SZ)[1]
-    end
-
-    #
-    # Read a REG_SZ or REG_EXPAND_SZ registry value named name.
-    #
-    # If the value type is REG_EXPAND_SZ, environment variables are replaced.
-    # Unless the value type is REG_SZ or REG_EXPAND_SZ, TypeError is raised.
-    #
-    def read_s_expand(name)
-      type, data = read(name, REG_SZ, REG_EXPAND_SZ)
-      if type == REG_EXPAND_SZ
-        Registry.expand_environ(data)
-      else
-        data
-      end
-    end
-
-    #
-    # Read a REG_SZ(read_s), REG_DWORD(read_i), or REG_BINARY(read_bin)
-    # registry value named name.
-    #
-    # If the values type does not match, TypeError is raised.
-    #
-    def read_i(name)
-      read(name, REG_DWORD, REG_DWORD_BIG_ENDIAN, REG_QWORD)[1]
-    end
-
-    #
-    # Read a REG_SZ(read_s), REG_DWORD(read_i), or REG_BINARY(read_bin)
-    # registry value named name.
-    #
-    # If the values type does not match, TypeError is raised.
-    #
-    def read_bin(name)
-      read(name, REG_BINARY)[1]
-    end
-
-    #
-    # Write data to a registry value named name.
-    # When name is nil, write to the `default' value.
-    #
-    # type is type value. (see Registry::Constants module)
-    # Class of data must be same as which #read
-    # method returns.
-    #
-    def write(name, type, data)
-      case type
-      when REG_SZ, REG_EXPAND_SZ
-        data = data.encode(WCHAR) << WCHAR_NUL
-      when REG_MULTI_SZ
-        data = data.to_a.map {|s| s.encode(WCHAR)}.join(WCHAR_NUL) << WCHAR_NUL
-      when REG_BINARY, REG_NONE
-        data = data.to_s
-      when REG_DWORD
-        data = API.packdw(data.to_i)
-      when REG_DWORD_BIG_ENDIAN
-        data = [data.to_i].pack('N')
-      when REG_QWORD
-        data = API.packqw(data.to_i)
-      else
-        raise TypeError, "Unsupported type #{Registry.type2name(type)}"
-      end
-      API.SetValue(@hkey, name, type, data, data.bytesize)
-    end
-
-    #
-    # Write value to a registry value named name.
-    #
-    # If wtype is specified, the value type is it.
-    # Otherwise, the value type is depend on class of value:
-    # :Integer
-    #   REG_DWORD
-    # :String
-    #   REG_SZ
-    # :Array
-    #   REG_MULTI_SZ
-    #
-    def []=(name, rtype, value = nil)
-      if value
-        write name, rtype, value
-      else
-        case value = rtype
-        when Integer
-          write name, REG_DWORD, value
-        when String
-          write name, REG_SZ, value
-        when Array
-          write name, REG_MULTI_SZ, value
-        else
-          raise TypeError, "Unexpected type #{value.class}"
-        end
-      end
-      value
-    end
-
-    #
-    # Write value to a registry value named name.
-    #
-    # The value type is REG_SZ(write_s), REG_DWORD(write_i), or
-    # REG_BINARY(write_bin).
-    #
-    def write_s(name, value)
-      write name, REG_SZ, value.to_s
-    end
-
-    #
-    # Write value to a registry value named name.
-    #
-    # The value type is REG_SZ(write_s), REG_DWORD(write_i), or
-    # REG_BINARY(write_bin).
-    #
-    def write_i(name, value)
-      write name, REG_DWORD, value.to_i
-    end
-
-    #
-    # Write value to a registry value named name.
-    #
-    # The value type is REG_SZ(write_s), REG_DWORD(write_i), or
-    # REG_BINARY(write_bin).
-    #
-    def write_bin(name, value)
-      write name, REG_BINARY, value.to_s
-    end
-
-    #
-    # Delete a registry value named name.
-    # We can not delete the `default' value.
-    #
-    def delete_value(name)
-      API.DeleteValue(@hkey, name)
-    end
-    alias delete delete_value
-
-    #
-    # Delete a subkey named name and all its values.
-    #
-    # If recursive is false, the subkey must not have subkeys.
-    # Otherwise, this method deletes all subkeys and values recursively.
-    #
-    def delete_key(name, recursive = false)
-      if recursive
-        open(name, KEY_ALL_ACCESS) do |reg|
-          reg.keys.each do |key|
-            begin
-              reg.delete_key(key, true)
-            rescue Error
-              #
-            end
-          end
-        end
-        API.DeleteKey(@hkey, name)
-      else
-        begin
-          API.EnumKey @hkey, 0
-        rescue Error
-          return API.DeleteKey(@hkey, name)
-        end
-        raise Error.new(5) ## ERROR_ACCESS_DENIED
-      end
-    end
-
-    #
-    # Write all the attributes into the registry file.
-    #
-    def flush
-      API.FlushKey @hkey
-    end
-
-    #
-    # Returns key information as Array of:
-    # :num_keys
-    #   The number of subkeys.
-    # :max_key_length
-    #   Maximum length of name of subkeys.
-    # :num_values
-    #   The number of values.
-    # :max_value_name_length
-    #   Maximum length of name of values.
-    # :max_value_length
-    #   Maximum length of value of values.
-    # :descriptor_length
-    #   Length of security descriptor.
-    # :wtime
-    #   Last write time as FILETIME(64-bit integer)
-    #
-    # For detail, see RegQueryInfoKey[http://msdn.microsoft.com/library/en-us/sysinfo/base/regqueryinfokey.asp] Win32 API.
-    #
-    def info
-      API.QueryInfoKey(@hkey)
-    end
-
-    #
-    # Returns an item of key information.
-    #
-    %w[
-      num_keys max_key_length
-      num_values max_value_name_length max_value_length
-      descriptor_length wtime
-    ].each_with_index do |s, i|
-      eval <<-__END__
-        def #{s}
-          info[#{i}]
-        end
-      __END__
-    end
-
-    private
-
-    def export_string(str, enc = Encoding.default_internal || LOCALE) # :nodoc:
-      str.encode(enc)
-    end
-  end
-end
diff --git a/ext/win32/lib/win32/resolv.rb b/ext/win32/lib/win32/resolv.rb
index d06658f0aa..08fed08563 100644
--- a/ext/win32/lib/win32/resolv.rb
+++ b/ext/win32/lib/win32/resolv.rb
@@ -4,12 +4,23 @@
 
 =end
 
-require 'win32/registry'
+require 'win32/resolv.so'
 
+# Generic namespace for Windows platform-specific features.
 module Win32
-  module Resolv
-    API = Registry::API
-    Error = Registry::Error
+  module Resolv # :nodoc:
+    # Error at Win32 API
+    class Error < StandardError
+      # +code+ Win32 Error code
+      # +message+ Formatted message for +code+
+      def initialize(code, message)
+        super(message)
+        @code = code
+      end
+
+      # Win32 error code
+      attr_reader :code
+    end
 
     def self.get_hosts_path
       path = get_hosts_dir
@@ -34,98 +45,59 @@ module Win32
       end
       [ search, nameserver ]
     end
-  end
-end
-
-begin
-  require 'win32/resolv.so'
-rescue LoadError
-end
-
-module Win32
-#====================================================================
-# Windows NT
-#====================================================================
-  module Resolv
-    module SZ
-      refine Registry do
-        # ad hoc workaround for broken registry
-        def read_s(key)
-          type, str = read(key)
-          unless type == Registry::REG_SZ
-            warn "Broken registry, #{name}\\#{key} was #{Registry.type2name(type)}, ignored"
-            return String.new
-          end
-          str
-        end
-      end
-    end
-    using SZ
-
-    TCPIP_NT = 'SYSTEM\CurrentControlSet\Services\Tcpip\Parameters'
 
     class << self
       private
       def get_hosts_dir
-        Registry::HKEY_LOCAL_MACHINE.open(TCPIP_NT) do |reg|
-          reg.read_s_expand('DataBasePath')
+        tcpip_params do |params|
+          params.value('DataBasePath')
         end
       end
 
       def get_info
         search = nil
         nameserver = get_dns_server_list
-        Registry::HKEY_LOCAL_MACHINE.open(TCPIP_NT) do |reg|
-          begin
-            slist = reg.read_s('SearchList')
-            search = slist.split(/,\s*/) unless slist.empty?
-          rescue Registry::Error
-          end
+
+        tcpip_params do |params|
+          slist = params.value('SearchList')
+          search = slist.split(/,\s*/) if slist and !slist.empty?
 
           if add_search = search.nil?
             search = []
-            begin
-              nvdom = reg.read_s('NV Domain')
-              unless nvdom.empty?
-                @search = [ nvdom ]
-                if reg.read_i('UseDomainNameDevolution') != 0
-                  if /^\w+\./ =~ nvdom
-                    devo = $'
-                  end
+            domain = params.value('Domain')
+
+            if domain and !domain.empty?
+              search = [ domain ]
+              udmnd = params.value('UseDomainNameDevolution')
+              if udmnd&.nonzero?
+                if /^\w+\./ =~ domain
+                  devo = $'
                 end
               end
-            rescue Registry::Error
             end
           end
 
-          reg.open('Interfaces') do |h|
-            h.each_key do |iface, |
-              h.open(iface) do |regif|
-                next unless ns = %w[NameServer DhcpNameServer].find do |key|
-                  begin
-                    ns = regif.read_s(key)
-                  rescue Registry::Error
-                  else
-                    break ns.split(/[,\s]\s*/) unless ns.empty?
-                  end
-                end
-                next if (nameserver & ns).empty?
+          params.open('Interfaces') do |reg|
+            reg.each_key do |iface|
+              next unless ns = %w[NameServer DhcpNameServer].find do |key|
+                ns = iface.value(key)
+                break ns.split(/[,\s]\s*/) if ns and !ns.empty?
+              end
 
-                if add_search
-                  begin
-                    [ 'Domain', 'DhcpDomain' ].each do |key|
-                      dom = regif.read_s(key)
-                      unless dom.empty?
-                        search.concat(dom.split(/,\s*/))
-                        break
-                      end
-                    end
-                  rescue Registry::Error
+              next if (nameserver & ns).empty?
+
+              if add_search
+                [ 'Domain', 'DhcpDomain' ].each do |key|
+                  dom = iface.value(key)
+                  if dom and !dom.empty?
+                    search.concat(dom.split(/,\s*/))
+                    break
                   end
                 end
               end
             end
           end
+
           search << devo if add_search and devo
         end
         [ search.uniq, nameserver.uniq ]
diff --git a/ext/win32/lib/win32/sspi.rb b/ext/win32/lib/win32/sspi.rb
deleted file mode 100644
index 20205fd4d6..0000000000
--- a/ext/win32/lib/win32/sspi.rb
+++ /dev/null
@@ -1,338 +0,0 @@
-# frozen_string_literal: false
-#
-# = win32/sspi.rb
-#
-# Copyright (c) 2006-2007 Justin Bailey
-#
-# Written and maintained by Justin Bailey <jgbailey@gmail.com>.
-#
-# This program is free software. You can re-distribute and/or
-# modify this program under the same terms of ruby itself ---
-# Ruby Distribution License or GNU General Public License.
-#
-
-require 'fiddle/import'
-
-# Implements bindings to Win32 SSPI functions, focused on authentication to a proxy server over HTTP.
-module Win32
-  module SSPI
-    # Specifies how credential structure requested will be used. Only SECPKG_CRED_OUTBOUND is used
-    # here.
-    SECPKG_CRED_INBOUND = 0x00000001
-    SECPKG_CRED_OUTBOUND = 0x00000002
-    SECPKG_CRED_BOTH = 0x00000003
-
-    # Format of token. NETWORK format is used here.
-    SECURITY_NATIVE_DREP = 0x00000010
-    SECURITY_NETWORK_DREP = 0x00000000
-
-    # InitializeSecurityContext Requirement flags
-    ISC_REQ_REPLAY_DETECT = 0x00000004
-    ISC_REQ_SEQUENCE_DETECT = 0x00000008
-    ISC_REQ_CONFIDENTIALITY = 0x00000010
-    ISC_REQ_USE_SESSION_KEY = 0x00000020
-    ISC_REQ_PROMPT_FOR_CREDS = 0x00000040
-    ISC_REQ_CONNECTION = 0x00000800
-
-    # Win32 API Functions. Uses Win32API to bind methods to constants contained in class.
-    module API
-      extend Fiddle::Importer
-      dlload "secur32.dll"
-      [
-        # Can be called with AcquireCredentialsHandleA.call()
-        "unsigned long AcquireCredentialsHandleA(void *, void *, unsigned long, void *, void *, void *, void *, void *, void *)",
-        # Can be called with InitializeSecurityContextA.call()
-        "unsigned long InitializeSecurityContextA(void *, void *, void *, unsigned long, unsigned long, unsigned long, void *, unsigned long, void *, void *, void *, void *)",
-        # Can be called with DeleteSecurityContext.call()
-        "unsigned long DeleteSecurityContext(void *)",
-        # Can be called with FreeCredentialsHandle.call()
-        "unsigned long FreeCredentialsHandle(void *)"
-      ].each do |fn|
-        cfunc = extern fn, :stdcall
-        const_set cfunc.name.intern, cfunc
-      end
-    end
-
-    # SecHandle struct
-    class SecurityHandle
-      def upper
-        @struct.unpack("LL")[1]
-      end
-
-      def lower
-        @struct.unpack("LL")[0]
-      end
-
-      def to_p
-        @struct ||= "\0" * 8
-      end
-    end
-
-    # Some familiar aliases for the SecHandle structure
-    CredHandle = CtxtHandle = SecurityHandle
-
-    # TimeStamp struct
-    class TimeStamp
-      attr_reader :struct
-
-      def to_p
-        @struct ||= "\0" * 8
-      end
-    end
-
-    # Creates binary representations of a SecBufferDesc structure,
-    # including the SecBuffer contained inside.
-    class SecurityBuffer
-
-      SECBUFFER_TOKEN = 2   # Security token
-
-      TOKENBUFSIZE = 12288
-      SECBUFFER_VERSION = 0
-
-      def initialize(buffer = nil)
-        @buffer = buffer || "\0" * TOKENBUFSIZE
-        @bufferSize = @buffer.length
-        @type = SECBUFFER_TOKEN
-      end
-
-      def bufferSize
-        unpack
-        @bufferSize
-      end
-
-      def bufferType
-        unpack
-        @type
-      end
-
-      def token
-        unpack
-        @buffer
-      end
-
-      def to_p
-        # Assumption is that when to_p is called we are going to get a packed structure. Therefore,
-        # set @unpacked back to nil so we know to unpack when accessors are next accessed.
-        @unpacked = nil
-        # Assignment of inner structure to variable is very important here. Without it,
-        # will not be able to unpack changes to the structure. Alternative, nested unpacks,
-        # does not work (i.e. @struct.unpack("LLP12")[2].unpack("LLP12") results in "no associated pointer")
-        @sec_buffer ||= [@bufferSize, @type, @buffer].pack("LLP")
-        @struct ||= [SECBUFFER_VERSION, 1, @sec_buffer].pack("LLP")
-      end
-
-    private
-
-      # Unpacks the SecurityBufferDesc structure into member variables. We
-      # only want to do this once per struct, so the struct is deleted
-      # after unpacking.
-      def unpack
-        if ! @unpacked && @sec_buffer && @struct
-          @bufferSize, @type = @sec_buffer.unpack("LL")
-          @buffer = @sec_buffer.unpack("LLP#{@bufferSize}")[2]
-          @struct = nil
-          @sec_buffer = nil
-          @unpacked = true
-        end
-      end
-    end
-
-    # SEC_WINNT_AUTH_IDENTITY structure
-    class Identity
-      SEC_WINNT_AUTH_IDENTITY_ANSI = 0x1
-
-      attr_accessor :user, :domain, :password
-
-      def initialize(user = nil, domain = nil, password = nil)
-        @user = user
-        @domain = domain
-        @password = password
-        @flags = SEC_WINNT_AUTH_IDENTITY_ANSI
-      end
-
-      def to_p
-        [@user, @user ? @user.length : 0,
-         @domain, @domain ? @domain.length : 0,
-         @password, @password ? @password.length : 0,
-         @flags].pack("PLPLPLL")
-      end
-    end
-
-    # Takes a return result from an SSPI function and interprets the value.
-    class SSPIResult
-      # Good results
-      SEC_E_OK = 0x00000000
-      SEC_I_CONTINUE_NEEDED = 0x00090312
-
-      # These are generally returned by InitializeSecurityContext
-      SEC_E_INSUFFICIENT_MEMORY = 0x80090300
-      SEC_E_INTERNAL_ERROR = 0x80090304
-      SEC_E_INVALID_HANDLE = 0x80090301
-      SEC_E_INVALID_TOKEN = 0x80090308
-      SEC_E_LOGON_DENIED = 0x8009030C
-      SEC_E_NO_AUTHENTICATING_AUTHORITY = 0x80090311
-      SEC_E_NO_CREDENTIALS = 0x8009030E
-      SEC_E_TARGET_UNKNOWN = 0x80090303
-      SEC_E_UNSUPPORTED_FUNCTION = 0x80090302
-      SEC_E_WRONG_PRINCIPAL = 0x80090322
-
-      # These are generally returned by AcquireCredentialsHandle
-      SEC_E_NOT_OWNER = 0x80090306
-      SEC_E_SECPKG_NOT_FOUND = 0x80090305
-      SEC_E_UNKNOWN_CREDENTIALS = 0x8009030D
-
-      @@map = {}
-      constants.each { |v| @@map[self.const_get(v.to_s)] = v }
-
-      attr_reader :value
-
-      def initialize(value)
-        # convert to unsigned long
-        value = [value].pack("L").unpack("L").first
-        raise "#{value.to_s(16)} is not a recognized result" unless @@map.has_key? value
-        @value = value
-      end
-
-      def to_s
-        @@map[@value].to_s
-      end
-
-      def ok?
-        @value == SEC_I_CONTINUE_NEEDED || @value == SEC_E_OK
-      end
-
-      def ==(other)
-        if other.is_a?(SSPIResult)
-          @value == other.value
-        elsif other.is_a?(Fixnum)
-          @value == @@map[other]
-        else
-          false
-        end
-      end
-    end
-
-    # Handles "Negotiate" type authentication. Geared towards authenticating with a proxy server over HTTP
-    class NegotiateAuth
-      attr_accessor :credentials, :context, :contextAttributes, :user, :domain
-
-      # Default request flags for SSPI functions
-      REQUEST_FLAGS = ISC_REQ_CONFIDENTIALITY | ISC_REQ_REPLAY_DETECT | ISC_REQ_CONNECTION
-
-      # NTLM tokens start with this header always. Encoding alone adds "==" and newline, so remove those
-      B64_TOKEN_PREFIX = ["NTLMSSP"].pack("m").delete("=\n")
-
-      # Given a connection and a request path, performs authentication as the current user and returns
-      # the response from a GET request. The connection should be a Net::HTTP object, and it should
-      # have been constructed using the Net::HTTP.Proxy method, but anything that responds to "get" will work.
-      # If a user and domain are given, will authenticate as the given user.
-      # Returns the response received from the get method (usually Net::HTTPResponse)
-      def NegotiateAuth.proxy_auth_get(http, path, user = nil, domain = nil)
-        raise "http must respond to :get" unless http.respond_to?(:get)
-        nego_auth = self.new user, domain
-
-        resp = http.get path, { "Proxy-Authorization" => "Negotiate " + nego_auth.get_initial_token }
-        if resp["Proxy-Authenticate"]
-          resp = http.get path, { "Proxy-Authorization" => "Negotiate " + nego_auth.complete_authentication(resp["Proxy-Authenticate"].split(" ").last.strip) }
-        end
-
-        resp
-      end
-
-      # Creates a new instance ready for authentication as the given user in the given domain.
-      # Defaults to current user and domain as defined by ENV["USERDOMAIN"] and ENV["USERNAME"] if
-      # no arguments are supplied.
-      def initialize(user = nil, domain = nil)
-        if user.nil? && domain.nil? && ENV["USERNAME"].nil? && ENV["USERDOMAIN"].nil?
-          raise "A username or domain must be supplied since they cannot be retrieved from the environment"
-        end
-
-        @user = user || ENV["USERNAME"]
-        @domain = domain || ENV["USERDOMAIN"]
-      end
-
-      # Gets the initial Negotiate token. Returns it as a base64 encoded string suitable for use in HTTP. Can
-      # be easily decoded, however.
-      def get_initial_token
-        raise "This object is no longer usable because its resources have been freed." if @cleaned_up
-        get_credentials
-
-        outputBuffer = SecurityBuffer.new
-        @context = CtxtHandle.new
-        @contextAttributes = "\0" * 4
-
-        result = SSPIResult.new(API::InitializeSecurityContextA.call(@credentials.to_p, nil, nil,
-          REQUEST_FLAGS,0, SECURITY_NETWORK_DREP, nil, 0, @context.to_p, outputBuffer.to_p, @contextAttributes, TimeStamp.new.to_p))
-
-        if result.ok? then
-          return encode_token(outputBuffer.token)
-        else
-          raise "Error: #{result.to_s}"
-        end
-      end
-
-      # Takes a token and gets the next token in the Negotiate authentication chain. Token can be Base64 encoded or not.
-      # The token can include the "Negotiate" header and it will be stripped.
-      # Does not indicate if SEC_I_CONTINUE or SEC_E_OK was returned.
-      # Token returned is Base64 encoded w/ all new lines removed.
-      def complete_authentication(token)
-        raise "This object is no longer usable because its resources have been freed." if @cleaned_up
-
-        # Nil token OK, just set it to empty string
-        token = "" if token.nil?
-
-        if token.include? "Negotiate"
-          # If the Negotiate prefix is passed in, assume we are seeing "Negotiate <token>" and get the token.
-          token = token.split(" ").last
-        end
-
-        if token.include? B64_TOKEN_PREFIX
-          # indicates base64 encoded token
-          token = token.strip.unpack("m")[0]
-        end
-
-        outputBuffer = SecurityBuffer.new
-        result = SSPIResult.new(API::InitializeSecurityContext.call(@credentials.to_p, @context.to_p, nil,
-          REQUEST_FLAGS, 0, SECURITY_NETWORK_DREP, SecurityBuffer.new(token).to_p, 0,
-          @context.to_p,
-          outputBuffer.to_p, @contextAttributes, TimeStamp.new.to_p))
-
-        if result.ok? then
-          return encode_token(outputBuffer.token)
-        else
-          raise "Error: #{result.to_s}"
-        end
-      ensure
-        # need to make sure we don't clean up if we've already cleaned up.
-        clean_up unless @cleaned_up
-      end
-
-     private
-
-      def clean_up
-        # free structures allocated
-        @cleaned_up = true
-        API::FreeCredentialsHandle.call(@credentials.to_p)
-        API::DeleteSecurityContext.call(@context.to_p)
-        @context = nil
-        @credentials = nil
-        @contextAttributes = nil
-      end
-
-      # Gets credentials based on user, domain or both. If both are nil, an error occurs
-      def get_credentials
-        @credentials = CredHandle.new
-        ts = TimeStamp.new
-        @identity = Identity.new @user, @domain
-        result = SSPIResult.new(API::AcquireCredentialsHandleA.call(nil, "Negotiate", SECPKG_CRED_OUTBOUND, nil, @identity.to_p,
-          nil, nil, @credentials.to_p, ts.to_p))
-        raise "Error acquire credentials: #{result}" unless result.ok?
-      end
-
-      def encode_token(t)
-        # encode64 will add newlines every 60 characters so we need to remove those.
-        [t].pack("m").delete("\n")
-      end
-    end
-  end
-end
diff --git a/ext/win32/resolv/extconf.rb b/ext/win32/resolv/extconf.rb
index 01f3df730a..5ee4c0d7c4 100644
--- a/ext/win32/resolv/extconf.rb
+++ b/ext/win32/resolv/extconf.rb
@@ -1,3 +1,7 @@
-if have_library('iphlpapi', 'GetNetworkParams')
+require 'mkmf'
+if RUBY_ENGINE == "ruby" and have_library('iphlpapi', 'GetNetworkParams', ['windows.h', 'iphlpapi.h'])
+  have_library('advapi32', 'RegGetValueW', ['windows.h'])
   create_makefile('win32/resolv')
+else
+  File.write('Makefile', "all clean install:\n\t@echo Done: $(@)\n")
 end
diff --git a/ext/win32/resolv/resolv.c b/ext/win32/resolv/resolv.c
index 8a50ef7824..9150df5dc1 100644
--- a/ext/win32/resolv/resolv.c
+++ b/ext/win32/resolv/resolv.c
@@ -1,24 +1,59 @@
 #include <ruby.h>
 #include <ruby/encoding.h>
 #include <windows.h>
+#include <windns.h>
 #ifndef NTDDI_VERSION
 #define NTDDI_VERSION 0x06000000
 #endif
 #include <iphlpapi.h>
 
+#ifndef numberof
+#define numberof(array) ((int)(sizeof(array) / sizeof((array)[0])))
+#endif
+
 static VALUE
 w32error_make_error(DWORD e)
 {
-    VALUE code = ULONG2NUM(e);
-    return rb_class_new_instance(1, &code, rb_path2class("Win32::Resolv::Error"));
+    char buffer[512], *p;
+    DWORD source = 0;
+    VALUE args[2];
+    if (!FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM |
+                       FORMAT_MESSAGE_IGNORE_INSERTS, &source, e,
+                       MAKELANGID(LANG_ENGLISH, SUBLANG_ENGLISH_US),
+                       buffer, sizeof(buffer), NULL)) {
+        snprintf(buffer, sizeof(buffer), "Unknown Error %lu", (unsigned long)e);
+    }
+    p = buffer;
+    while ((p = strpbrk(p, "\r\n")) != NULL) {
+        memmove(p, p + 1, strlen(p));
+        if (!p[1]) {
+            p[0] = '\0';
+            break;
+        }
+    }
+    args[0] = ULONG2NUM(e);
+    args[1] = rb_str_new_cstr(buffer);
+    return rb_class_new_instance(2, args, rb_path2class("Win32::Resolv::Error"));
 }
 
 static void
-w32error_raise(DWORD e)
+w32error_check(DWORD e)
+{
+    if (e != NO_ERROR) {
+        rb_exc_raise(w32error_make_error(e));
+    }
+}
+
+static VALUE
+wchar_to_utf8(const WCHAR *w, int n)
 {
-    rb_exc_raise(w32error_make_error(e));
+    int clen = WideCharToMultiByte(CP_UTF8, 0, w, n, NULL, 0, NULL, NULL);
+    VALUE str = rb_enc_str_new(NULL, clen, rb_utf8_encoding());
+    WideCharToMultiByte(CP_UTF8, 0, w, n, RSTRING_PTR(str), clen, NULL, NULL);
+    return str;
 }
 
+/* :nodoc: */
 static VALUE
 get_dns_server_list(VALUE self)
 {
@@ -28,9 +63,7 @@ get_dns_server_list(VALUE self)
     VALUE buf, nameservers = Qnil;
 
     ret = GetNetworkParams(NULL, &buflen);
-    if (ret != NO_ERROR && ret != ERROR_BUFFER_OVERFLOW) {
-        w32error_raise(ret);
-    }
+    if (ret != ERROR_BUFFER_OVERFLOW) w32error_check(ret);
     fixedinfo = ALLOCV(buf, buflen);
     ret = GetNetworkParams(fixedinfo, &buflen);
     if (ret == NO_ERROR) {
@@ -44,18 +77,181 @@ get_dns_server_list(VALUE self)
         } while ((ipaddr = ipaddr->Next) != NULL);
     }
     ALLOCV_END(buf);
-    if (ret != NO_ERROR) w32error_raise(ret);
+    w32error_check(ret);
 
     return nameservers;
 }
 
+static const WCHAR TCPIP_Params[] = L"SYSTEM\\CurrentControlSet\\Services\\Tcpip\\Parameters";
+
+static void
+hkey_finalize(void *p)
+{
+    RegCloseKey((HKEY)p);
+}
+
+static const rb_data_type_t hkey_type = {
+    "RegKey",
+    {0, hkey_finalize},
+    0, 0, RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+static VALUE
+hkey_close(VALUE self)
+{
+    RegCloseKey((HKEY)DATA_PTR(self));
+    DATA_PTR(self) = 0;
+    return self;
+}
+
+static VALUE reg_key_class;
+
+static VALUE
+reg_open_key(VALUE klass, HKEY hkey, const WCHAR *wname)
+{
+    VALUE k = TypedData_Wrap_Struct(klass, &hkey_type, NULL);
+    DWORD e = RegOpenKeyExW(hkey, wname, 0, KEY_READ, (HKEY *)&DATA_PTR(k));
+    if (e == ERROR_FILE_NOT_FOUND) return Qnil;
+    w32error_check(e);
+    return rb_ensure(rb_yield, k, hkey_close, k);
+}
+
+/* :nodoc: */
+static VALUE
+tcpip_params_open(VALUE klass)
+{
+    return reg_open_key(reg_key_class, HKEY_LOCAL_MACHINE, TCPIP_Params);
+}
+
+static int
+to_wname(VALUE *name, WCHAR *wname, int wlen)
+{
+    const char *n = StringValueCStr(*name);
+    int nlen = RSTRING_LEN(*name);
+    int len = MultiByteToWideChar(CP_UTF8, 0, n, nlen, wname, wlen - 1);
+    if (len == 0) w32error_check(GetLastError());
+    if (len >= wlen) rb_raise(rb_eArgError, "too long name");
+    wname[len] = L'\0';
+    return len;
+}
+
+static VALUE
+reg_open(VALUE self, VALUE name)
+{
+    HKEY hkey = DATA_PTR(self);
+    WCHAR wname[256];
+    to_wname(&name, wname, numberof(wname));
+    return reg_open_key(CLASS_OF(self), hkey, wname);
+}
+
+
+static VALUE
+reg_each_key(VALUE self)
+{
+    WCHAR wname[256];
+    HKEY hkey = DATA_PTR(self);
+    VALUE k = TypedData_Wrap_Struct(CLASS_OF(self), &hkey_type, NULL);
+    DWORD i, e, n;
+    for (i = 0; n = numberof(wname), (e = RegEnumKeyExW(hkey, i, wname, &n, NULL, NULL, NULL, NULL)) == ERROR_SUCCESS; i++) {
+        e = RegOpenKeyExW(hkey, wname, 0, KEY_READ, (HKEY *)&DATA_PTR(k));
+        w32error_check(e);
+        rb_ensure(rb_yield, k, hkey_close, k);
+    }
+    if (e != ERROR_NO_MORE_ITEMS) w32error_check(e);
+    return self;
+}
+
+static inline DWORD
+swap_dw(DWORD x)
+{
+#if defined(_MSC_VER)
+    return _byteswap_ulong(x);
+#else
+    return __builtin_bswap32(x);
+#endif
+}
+
+static VALUE
+reg_value(VALUE self, VALUE name)
+{
+    HKEY hkey = DATA_PTR(self);
+    DWORD type = 0, size = 0, e;
+    VALUE result, value_buffer;
+    void *buffer;
+    WCHAR wname[256];
+    to_wname(&name, wname, numberof(wname));
+    e = RegGetValueW(hkey, NULL, wname, RRF_RT_ANY, &type, NULL, &size);
+    if (e == ERROR_FILE_NOT_FOUND) return Qnil;
+    w32error_check(e);
+# define get_value_2nd(data, dsize) do { \
+        DWORD type2 = type; \
+        w32error_check(RegGetValueW(hkey, NULL, wname, RRF_RT_ANY, &type2, data, dsize)); \
+        if (type != type2) { \
+            rb_raise(rb_eRuntimeError, "registry value type changed %lu -> %lu", \
+                     (unsigned long)type, (unsigned long)type2); \
+        } \
+    } while (0)
+
+    switch (type) {
+      case REG_DWORD: case REG_DWORD_BIG_ENDIAN:
+        {
+            DWORD d;
+            if (size != sizeof(d)) rb_raise(rb_eRuntimeError, "invalid size returned: %lu", (unsigned long)size);
+            w32error_check(RegGetValueW(hkey, NULL, wname, RRF_RT_REG_DWORD, &type, &d, &size));
+            if (type == REG_DWORD_BIG_ENDIAN) d = swap_dw(d);
+            return ULONG2NUM(d);
+        }
+      case REG_QWORD:
+        {
+            QWORD q;
+            if (size != sizeof(q)) rb_raise(rb_eRuntimeError, "invalid size returned: %lu", (unsigned long)size);
+            w32error_check(RegGetValueW(hkey, NULL, wname, RRF_RT_REG_QWORD, &type, &q, &size));
+            return ULL2NUM(q);
+        }
+      case REG_SZ: case REG_MULTI_SZ: case REG_EXPAND_SZ:
+        if (size % sizeof(WCHAR)) rb_raise(rb_eRuntimeError, "invalid size returned: %lu", (unsigned long)size);
+        buffer = ALLOCV_N(char, value_buffer, size);
+        get_value_2nd(buffer, &size);
+        if (type == REG_MULTI_SZ) {
+            const WCHAR *w = (WCHAR *)buffer;
+            result = rb_ary_new();
+            size /= sizeof(WCHAR);
+            size -= 1;
+            for (size_t i = 0; i < size; ++i) {
+                int n = lstrlenW(w+i);
+                rb_ary_push(result, wchar_to_utf8(w+i, n));
+                i += n;
+            }
+        }
+        else {
+            result = wchar_to_utf8((WCHAR *)buffer, lstrlenW((WCHAR *)buffer));
+        }
+        ALLOCV_END(value_buffer);
+        break;
+      default:
+        result = rb_str_new(0, size);
+        get_value_2nd(RSTRING_PTR(result), &size);
+        rb_str_set_len(result, size);
+        break;
+    }
+    return result;
+}
+
 void
 InitVM_resolv(void)
 {
     VALUE mWin32 = rb_define_module("Win32");
     VALUE resolv = rb_define_module_under(mWin32, "Resolv");
     VALUE singl = rb_singleton_class(resolv);
+    VALUE regkey = rb_define_class_under(resolv, "registry key", rb_cObject);
+
+    reg_key_class = regkey;
+    rb_undef_alloc_func(regkey);
     rb_define_private_method(singl, "get_dns_server_list", get_dns_server_list, 0);
+    rb_define_private_method(singl, "tcpip_params", tcpip_params_open, 0);
+    rb_define_method(regkey, "open", reg_open, 1);
+    rb_define_method(regkey, "each_key", reg_each_key, 0);
+    rb_define_method(regkey, "value", reg_value, 1);
 }
 
 void
diff --git a/ext/win32ole/.document b/ext/win32ole/.document
deleted file mode 100644
index decba0135a..0000000000
--- a/ext/win32ole/.document
+++ /dev/null
@@ -1 +0,0 @@
-*.[ch]
diff --git a/ext/win32ole/depend b/ext/win32ole/depend
deleted file mode 100644
index c8445ad5fa..0000000000
--- a/ext/win32ole/depend
+++ /dev/null
@@ -1,12 +0,0 @@
-WIN32OLE_HEADERS = $(HDRS) $(ruby_headers)
-win32ole.o : win32ole.c $(WIN32OLE_HEADERS)
-win32ole_variant_m.o : win32ole_variant_m.c $(WIN32OLE_HEADERS)
-win32ole_typelib.o : win32ole_typelib.c $(WIN32OLE_HEADERS)
-win32ole_type.o : win32ole_type.c $(WIN32OLE_HEADERS)
-win32ole_variable.o : win32ole_variable.c $(WIN32OLE_HEADERS)
-win32ole_method.o : win32ole_method.c $(WIN32OLE_HEADERS)
-win32ole_param.o : win32ole_param.c $(WIN32OLE_HEADERS)
-win32ole_variant.o : win32ole_variant.c $(WIN32OLE_HEADERS)
-win32ole_event.o : win32ole_event.c $(WIN32OLE_HEADERS)
-win32ole_record.o : win32ole_record.c $(WIN32OLE_HEADERS)
-win32ole_error.o : win32ole_error.c $(WIN32OLE_HEADERS)
diff --git a/ext/win32ole/extconf.rb b/ext/win32ole/extconf.rb
deleted file mode 100644
index d2044663a9..0000000000
--- a/ext/win32ole/extconf.rb
+++ /dev/null
@@ -1,45 +0,0 @@
-# frozen_string_literal: false
-#----------------------------------
-# extconf.rb
-# $Revision$
-#----------------------------------
-require 'mkmf'
-
-case RUBY_PLATFORM
-when /cygwin/
-  inc = nil
-  lib = '/usr/lib/w32api'
-end
-
-dir_config("win32", inc, lib)
-
-def create_win32ole_makefile
-  if have_library("ole32") and
-     have_library("oleaut32") and
-     have_library("uuid", "&CLSID_CMultiLanguage", "mlang.h") and
-     have_library("user32") and
-     have_library("kernel32") and
-     have_library("advapi32") and
-     have_header("windows.h")
-    unless have_type("IMultiLanguage2", "mlang.h")
-      have_type("IMultiLanguage", "mlang.h")
-    end
-    spec = nil
-    checking_for('thread_specific', '%s') do
-      spec = %w[__declspec(thread) __thread].find {|th|
-        try_compile("#{th} int foo;", "", :werror => true)
-      }
-      spec or 'no'
-    end
-    $defs << "-DRB_THREAD_SPECIFIC=#{spec}" if spec
-    create_makefile("win32ole")
-  end
-end
-
-
-case RUBY_PLATFORM
-when /mswin/
-  $CFLAGS.sub!(/((?:\A|\s)[-\/])W\d(?=\z|\s)/, '\1W3') or
-    $CFLAGS += ' -W3'
-end
-create_win32ole_makefile
diff --git a/ext/win32ole/lib/win32ole.rb b/ext/win32ole/lib/win32ole.rb
deleted file mode 100644
index f5c8a52c4a..0000000000
--- a/ext/win32ole/lib/win32ole.rb
+++ /dev/null
@@ -1,32 +0,0 @@
-begin
-  require 'win32ole.so'
-rescue LoadError
-  # do nothing
-end
-
-if defined?(WIN32OLE)
-  class WIN32OLE
-
-    #
-    # By overriding Object#methods, WIN32OLE might
-    # work well with did_you_mean gem.
-    # This is experimental.
-    #
-    #  require 'win32ole'
-    #  dict = WIN32OLE.new('Scripting.Dictionary')
-    #  dict.Ade('a', 1)
-    #  #=> Did you mean?  Add
-    #
-    def methods(*args)
-      super + ole_methods_safely.map(&:name).map(&:to_sym)
-    end
-
-    private
-
-    def ole_methods_safely
-      ole_methods
-    rescue WIN32OLE::QueryInterfaceError
-      []
-    end
-  end
-end
diff --git a/ext/win32ole/lib/win32ole/property.rb b/ext/win32ole/lib/win32ole/property.rb
deleted file mode 100644
index 558056b32b..0000000000
--- a/ext/win32ole/lib/win32ole/property.rb
+++ /dev/null
@@ -1,29 +0,0 @@
-# frozen_string_literal: false
-
-class WIN32OLE
-end
-
-# OLEProperty is a helper class of Property with arguments, used by
-# `olegen.rb`-generated files.
-class WIN32OLE::Property
-  # :stopdoc:
-  def initialize(obj, dispid, gettypes, settypes)
-    @obj = obj
-    @dispid = dispid
-    @gettypes = gettypes
-    @settypes = settypes
-  end
-  def [](*args)
-    @obj._getproperty(@dispid, args, @gettypes)
-  end
-  def []=(*args)
-    @obj._setproperty(@dispid, args, @settypes)
-  end
-  # :stopdoc:
-end
-
-module WIN32OLE::VariantType
-  # Alias for `olegen.rb`-generated files, that should include
-  # WIN32OLE::VARIANT.
-  OLEProperty = WIN32OLE::Property
-end
diff --git a/ext/win32ole/win32ole.c b/ext/win32ole/win32ole.c
deleted file mode 100644
index e0342d1e9d..0000000000
--- a/ext/win32ole/win32ole.c
+++ /dev/null
@@ -1,4142 +0,0 @@
-/*
- *  (c) 1995 Microsoft Corporation. All rights reserved.
- *  Developed by ActiveWare Internet Corp., now known as
- *  ActiveState Tool Corp., http://www.ActiveState.com
- *
- *  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.
- *
- */
-
-/*
-  modified for win32ole (ruby) by Masaki.Suketa <masaki.suketa@nifty.ne.jp>
- */
-
-#include "win32ole.h"
-
-/*
- * unfortunately IID_IMultiLanguage2 is not included in any libXXX.a
- * in Cygwin(mingw32).
- */
-#if defined(__CYGWIN__) ||  defined(__MINGW32__)
-#undef IID_IMultiLanguage2
-const IID IID_IMultiLanguage2 = {0xDCCFC164, 0x2B38, 0x11d2, {0xB7, 0xEC, 0x00, 0xC0, 0x4F, 0x8F, 0x5D, 0x9A}};
-#endif
-
-#define WIN32OLE_VERSION "1.8.10"
-
-typedef HRESULT (STDAPICALLTYPE FNCOCREATEINSTANCEEX)
-    (REFCLSID, IUnknown*, DWORD, COSERVERINFO*, DWORD, MULTI_QI*);
-
-typedef HWND (WINAPI FNHTMLHELP)(HWND hwndCaller, LPCSTR pszFile,
-                                 UINT uCommand, DWORD dwData);
-typedef BOOL (FNENUMSYSEMCODEPAGES) (CODEPAGE_ENUMPROC, DWORD);
-VALUE cWIN32OLE;
-
-#if defined(RB_THREAD_SPECIFIC) && (defined(__CYGWIN__))
-static RB_THREAD_SPECIFIC BOOL g_ole_initialized;
-# define g_ole_initialized_init() ((void)0)
-# define g_ole_initialized_set(val) (g_ole_initialized = (val))
-#else
-static volatile DWORD g_ole_initialized_key = TLS_OUT_OF_INDEXES;
-# define g_ole_initialized (TlsGetValue(g_ole_initialized_key)!=0)
-# define g_ole_initialized_init() (g_ole_initialized_key = TlsAlloc())
-# define g_ole_initialized_set(val) TlsSetValue(g_ole_initialized_key, (void*)(val))
-#endif
-
-static BOOL g_uninitialize_hooked = FALSE;
-static BOOL g_cp_installed = FALSE;
-static BOOL g_lcid_installed = FALSE;
-static BOOL g_running_nano = FALSE;
-static HINSTANCE ghhctrl = NULL;
-static HINSTANCE gole32 = NULL;
-static FNCOCREATEINSTANCEEX *gCoCreateInstanceEx = NULL;
-static VALUE com_hash;
-static VALUE enc2cp_hash;
-static IDispatchVtbl com_vtbl;
-static UINT cWIN32OLE_cp = CP_ACP;
-static rb_encoding *cWIN32OLE_enc;
-static UINT g_cp_to_check = CP_ACP;
-static char g_lcid_to_check[8 + 1];
-static VARTYPE g_nil_to = VT_ERROR;
-static IMessageFilterVtbl message_filter;
-static IMessageFilter imessage_filter = { &message_filter };
-static IMessageFilter* previous_filter;
-
-#if defined(HAVE_TYPE_IMULTILANGUAGE2)
-static IMultiLanguage2 *pIMultiLanguage = NULL;
-#elif defined(HAVE_TYPE_IMULTILANGUAGE)
-static IMultiLanguage *pIMultiLanguage = NULL;
-#else
-#define pIMultiLanguage NULL /* dummy */
-#endif
-
-struct oleparam {
-    DISPPARAMS dp;
-    OLECHAR** pNamedArgs;
-};
-
-static HRESULT ( STDMETHODCALLTYPE QueryInterface )(IDispatch __RPC_FAR *, REFIID riid, void __RPC_FAR *__RPC_FAR *ppvObject);
-static ULONG ( STDMETHODCALLTYPE AddRef )(IDispatch __RPC_FAR * This);
-static ULONG ( STDMETHODCALLTYPE Release )(IDispatch __RPC_FAR * This);
-static HRESULT ( STDMETHODCALLTYPE GetTypeInfoCount )(IDispatch __RPC_FAR * This, UINT __RPC_FAR *pctinfo);
-static HRESULT ( STDMETHODCALLTYPE GetTypeInfo )(IDispatch __RPC_FAR * This, UINT iTInfo, LCID lcid, ITypeInfo __RPC_FAR *__RPC_FAR *ppTInfo);
-static HRESULT ( STDMETHODCALLTYPE GetIDsOfNames )(IDispatch __RPC_FAR * This, REFIID riid, LPOLESTR __RPC_FAR *rgszNames, UINT cNames, LCID lcid, DISPID __RPC_FAR *rgDispId);
-static HRESULT ( STDMETHODCALLTYPE Invoke )( IDispatch __RPC_FAR * This, DISPID dispIdMember, REFIID riid, LCID lcid, WORD wFlags, DISPPARAMS __RPC_FAR *pDispParams, VARIANT __RPC_FAR *pVarResult, EXCEPINFO __RPC_FAR *pExcepInfo, UINT __RPC_FAR *puArgErr);
-static IDispatch* val2dispatch(VALUE val);
-static double rbtime2vtdate(VALUE tmobj);
-static VALUE vtdate2rbtime(double date);
-static rb_encoding *ole_cp2encoding(UINT cp);
-static UINT ole_encoding2cp(rb_encoding *enc);
-NORETURN(static void failed_load_conv51932(void));
-#ifndef pIMultiLanguage
-static void load_conv_function51932(void);
-#endif
-static UINT ole_init_cp(void);
-static void ole_freeexceptinfo(EXCEPINFO *pExInfo);
-static VALUE ole_excepinfo2msg(EXCEPINFO *pExInfo);
-static void ole_free(void *ptr);
-static size_t ole_size(const void *ptr);
-static LPWSTR ole_mb2wc(char *pm, int len, UINT cp);
-static VALUE ole_ary_m_entry(VALUE val, LONG *pid);
-static VALUE is_all_index_under(LONG *pid, long *pub, long dim);
-static void * get_ptr_of_variant(VARIANT *pvar);
-static void ole_set_safe_array(long n, SAFEARRAY *psa, LONG *pid, long *pub, VALUE val, long dim,  VARTYPE vt);
-static long dimension(VALUE val);
-static long ary_len_of_dim(VALUE ary, long dim);
-static VALUE ole_set_member(VALUE self, IDispatch *dispatch);
-static VALUE fole_s_allocate(VALUE klass);
-static VALUE create_win32ole_object(VALUE klass, IDispatch *pDispatch, int argc, VALUE *argv);
-static VALUE ary_new_dim(VALUE myary, LONG *pid, LONG *plb, LONG dim);
-static void ary_store_dim(VALUE myary, LONG *pid, LONG *plb, LONG dim, VALUE val);
-static void ole_const_load(ITypeLib *pTypeLib, VALUE klass, VALUE self);
-static HRESULT clsid_from_remote(VALUE host, VALUE com, CLSID *pclsid);
-static VALUE ole_create_dcom(VALUE self, VALUE ole, VALUE host, VALUE others);
-static VALUE ole_bind_obj(VALUE moniker, int argc, VALUE *argv, VALUE self);
-static VALUE fole_s_connect(int argc, VALUE *argv, VALUE self);
-static VALUE fole_s_const_load(int argc, VALUE *argv, VALUE self);
-static ULONG reference_count(struct oledata * pole);
-static VALUE fole_s_reference_count(VALUE self, VALUE obj);
-static VALUE fole_s_free(VALUE self, VALUE obj);
-static HWND ole_show_help(VALUE helpfile, VALUE helpcontext);
-static VALUE fole_s_show_help(int argc, VALUE *argv, VALUE self);
-static VALUE fole_s_get_code_page(VALUE self);
-static BOOL CALLBACK installed_code_page_proc(LPTSTR str);
-static BOOL code_page_installed(UINT cp);
-static VALUE fole_s_set_code_page(VALUE self, VALUE vcp);
-static VALUE fole_s_get_locale(VALUE self);
-static BOOL CALLBACK installed_lcid_proc(LPTSTR str);
-static BOOL lcid_installed(LCID lcid);
-static VALUE fole_s_set_locale(VALUE self, VALUE vlcid);
-static VALUE fole_s_create_guid(VALUE self);
-static VALUE fole_s_ole_initialize(VALUE self);
-static VALUE fole_s_ole_uninitialize(VALUE self);
-static VALUE fole_initialize(int argc, VALUE *argv, VALUE self);
-static int hash2named_arg(VALUE key, VALUE val, VALUE pop);
-static VALUE set_argv(VARIANTARG* realargs, unsigned int beg, unsigned int end);
-static VALUE ole_invoke(int argc, VALUE *argv, VALUE self, USHORT wFlags, BOOL is_bracket);
-static VALUE fole_invoke(int argc, VALUE *argv, VALUE self);
-static VALUE ole_invoke2(VALUE self, VALUE dispid, VALUE args, VALUE types, USHORT dispkind);
-static VALUE fole_invoke2(VALUE self, VALUE dispid, VALUE args, VALUE types);
-static VALUE fole_getproperty2(VALUE self, VALUE dispid, VALUE args, VALUE types);
-static VALUE fole_setproperty2(VALUE self, VALUE dispid, VALUE args, VALUE types);
-static VALUE fole_setproperty_with_bracket(int argc, VALUE *argv, VALUE self);
-static VALUE fole_setproperty(int argc, VALUE *argv, VALUE self);
-static VALUE fole_getproperty_with_bracket(int argc, VALUE *argv, VALUE self);
-static VALUE ole_propertyput(VALUE self, VALUE property, VALUE value);
-static VALUE fole_free(VALUE self);
-static VALUE ole_each_sub(VALUE pEnumV);
-static VALUE ole_ienum_free(VALUE pEnumV);
-static VALUE fole_each(VALUE self);
-static VALUE fole_missing(int argc, VALUE *argv, VALUE self);
-static HRESULT typeinfo_from_ole(struct oledata *pole, ITypeInfo **ppti);
-static VALUE ole_methods(VALUE self, int mask);
-static VALUE fole_methods(VALUE self);
-static VALUE fole_get_methods(VALUE self);
-static VALUE fole_put_methods(VALUE self);
-static VALUE fole_func_methods(VALUE self);
-static VALUE fole_type(VALUE self);
-static VALUE fole_typelib(VALUE self);
-static VALUE fole_query_interface(VALUE self, VALUE str_iid);
-static VALUE fole_respond_to(VALUE self, VALUE method);
-static VALUE ole_usertype2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails);
-static VALUE ole_ptrtype2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails);
-static VALUE fole_method_help(VALUE self, VALUE cmdname);
-static VALUE fole_activex_initialize(VALUE self);
-
-static void com_hash_free(void *ptr);
-static void com_hash_mark(void *ptr);
-static size_t com_hash_size(const void *ptr);
-static void check_nano_server(void);
-
-static const rb_data_type_t ole_datatype = {
-    "win32ole",
-    {NULL, ole_free, ole_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static const rb_data_type_t win32ole_hash_datatype = {
-    "win32ole_hash",
-    {com_hash_mark, com_hash_free, com_hash_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static HRESULT (STDMETHODCALLTYPE mf_QueryInterface)(
-    IMessageFilter __RPC_FAR * This,
-    /* [in] */ REFIID riid,
-    /* [iid_is][out] */ void __RPC_FAR *__RPC_FAR *ppvObject)
-{
-    if (MEMCMP(riid, &IID_IUnknown, GUID, 1) == 0
-        || MEMCMP(riid, &IID_IMessageFilter, GUID, 1) == 0)
-    {
-        *ppvObject = &message_filter;
-        return S_OK;
-    }
-    return E_NOINTERFACE;
-}
-
-static ULONG (STDMETHODCALLTYPE mf_AddRef)(
-    IMessageFilter __RPC_FAR * This)
-{
-    return 1;
-}
-
-static ULONG (STDMETHODCALLTYPE mf_Release)(
-    IMessageFilter __RPC_FAR * This)
-{
-    return 1;
-}
-
-static DWORD (STDMETHODCALLTYPE mf_HandleInComingCall)(
-    IMessageFilter __RPC_FAR * pThis,
-    DWORD dwCallType,      //Type of incoming call
-    HTASK threadIDCaller,  //Task handle calling this task
-    DWORD dwTickCount,     //Elapsed tick count
-    LPINTERFACEINFO lpInterfaceInfo //Pointer to INTERFACEINFO structure
-    )
-{
-#ifdef DEBUG_MESSAGEFILTER
-    printf("incoming %08X, %08X, %d\n", dwCallType, threadIDCaller, dwTickCount);
-    fflush(stdout);
-#endif
-    switch (dwCallType)
-    {
-    case CALLTYPE_ASYNC:
-    case CALLTYPE_TOPLEVEL_CALLPENDING:
-    case CALLTYPE_ASYNC_CALLPENDING:
-        if (rb_during_gc()) {
-            return SERVERCALL_RETRYLATER;
-        }
-        break;
-    default:
-        break;
-    }
-    if (previous_filter) {
-        return previous_filter->lpVtbl->HandleInComingCall(previous_filter,
-                                                   dwCallType,
-                                                   threadIDCaller,
-                                                   dwTickCount,
-                                                   lpInterfaceInfo);
-    }
-    return SERVERCALL_ISHANDLED;
-}
-
-static DWORD (STDMETHODCALLTYPE mf_RetryRejectedCall)(
-    IMessageFilter* pThis,
-    HTASK threadIDCallee,  //Server task handle
-    DWORD dwTickCount,     //Elapsed tick count
-    DWORD dwRejectType     //Returned rejection message
-    )
-{
-    if (previous_filter) {
-        return previous_filter->lpVtbl->RetryRejectedCall(previous_filter,
-                                                  threadIDCallee,
-                                                  dwTickCount,
-                                                  dwRejectType);
-    }
-    return 1000;
-}
-
-static DWORD (STDMETHODCALLTYPE mf_MessagePending)(
-    IMessageFilter* pThis,
-    HTASK threadIDCallee,  //Called applications task handle
-    DWORD dwTickCount,     //Elapsed tick count
-    DWORD dwPendingType    //Call type
-    )
-{
-    if (rb_during_gc()) {
-        return PENDINGMSG_WAITNOPROCESS;
-    }
-    if (previous_filter) {
-        return previous_filter->lpVtbl->MessagePending(previous_filter,
-                                               threadIDCallee,
-                                               dwTickCount,
-                                               dwPendingType);
-    }
-    return PENDINGMSG_WAITNOPROCESS;
-}
-
-typedef struct _Win32OLEIDispatch
-{
-    IDispatch dispatch;
-    ULONG refcount;
-    VALUE obj;
-} Win32OLEIDispatch;
-
-static HRESULT ( STDMETHODCALLTYPE QueryInterface )(
-    IDispatch __RPC_FAR * This,
-    /* [in] */ REFIID riid,
-    /* [iid_is][out] */ void __RPC_FAR *__RPC_FAR *ppvObject)
-{
-    if (MEMCMP(riid, &IID_IUnknown, GUID, 1) == 0
-        || MEMCMP(riid, &IID_IDispatch, GUID, 1) == 0)
-    {
-        Win32OLEIDispatch* p = (Win32OLEIDispatch*)This;
-        p->refcount++;
-        *ppvObject = This;
-        return S_OK;
-    }
-    return E_NOINTERFACE;
-}
-
-static ULONG ( STDMETHODCALLTYPE AddRef )(
-    IDispatch __RPC_FAR * This)
-{
-    Win32OLEIDispatch* p = (Win32OLEIDispatch*)This;
-    return ++(p->refcount);
-}
-
-static ULONG ( STDMETHODCALLTYPE Release )(
-    IDispatch __RPC_FAR * This)
-{
-    Win32OLEIDispatch* p = (Win32OLEIDispatch*)This;
-    ULONG u = --(p->refcount);
-    if (u == 0) {
-        st_data_t key = p->obj;
-        st_delete(DATA_PTR(com_hash), &key, 0);
-        free(p);
-    }
-    return u;
-}
-
-static HRESULT ( STDMETHODCALLTYPE GetTypeInfoCount )(
-    IDispatch __RPC_FAR * This,
-    /* [out] */ UINT __RPC_FAR *pctinfo)
-{
-    return E_NOTIMPL;
-}
-
-static HRESULT ( STDMETHODCALLTYPE GetTypeInfo )(
-    IDispatch __RPC_FAR * This,
-    /* [in] */ UINT iTInfo,
-    /* [in] */ LCID lcid,
-    /* [out] */ ITypeInfo __RPC_FAR *__RPC_FAR *ppTInfo)
-{
-    return E_NOTIMPL;
-}
-
-
-static HRESULT ( STDMETHODCALLTYPE GetIDsOfNames )(
-    IDispatch __RPC_FAR * This,
-    /* [in] */ REFIID riid,
-    /* [size_is][in] */ LPOLESTR __RPC_FAR *rgszNames,
-    /* [in] */ UINT cNames,
-    /* [in] */ LCID lcid,
-    /* [size_is][out] */ DISPID __RPC_FAR *rgDispId)
-{
-    /*
-    Win32OLEIDispatch* p = (Win32OLEIDispatch*)This;
-    */
-    char* psz = ole_wc2mb(*rgszNames); // support only one method
-    ID nameid = rb_check_id_cstr(psz, (long)strlen(psz), cWIN32OLE_enc);
-    free(psz);
-    if ((ID)(DISPID)nameid != nameid) return E_NOINTERFACE;
-    *rgDispId = (DISPID)nameid;
-    return S_OK;
-}
-
-static /* [local] */ HRESULT ( STDMETHODCALLTYPE Invoke )(
-    IDispatch __RPC_FAR * This,
-    /* [in] */ DISPID dispIdMember,
-    /* [in] */ REFIID riid,
-    /* [in] */ LCID lcid,
-    /* [in] */ WORD wFlags,
-    /* [out][in] */ DISPPARAMS __RPC_FAR *pDispParams,
-    /* [out] */ VARIANT __RPC_FAR *pVarResult,
-    /* [out] */ EXCEPINFO __RPC_FAR *pExcepInfo,
-    /* [out] */ UINT __RPC_FAR *puArgErr)
-{
-    VALUE v;
-    int i;
-    int args = pDispParams->cArgs;
-    Win32OLEIDispatch* p = (Win32OLEIDispatch*)This;
-    VALUE* parg = ALLOCA_N(VALUE, args);
-    ID mid = (ID)dispIdMember;
-    for (i = 0; i < args; i++) {
-        *(parg + i) = ole_variant2val(&pDispParams->rgvarg[args - i - 1]);
-    }
-    if (dispIdMember == DISPID_VALUE) {
-        if (wFlags == DISPATCH_METHOD) {
-            mid = rb_intern("call");
-        } else if (wFlags & DISPATCH_PROPERTYGET) {
-            mid = rb_intern("value");
-        }
-    }
-    v = rb_funcallv(p->obj, mid, args, parg);
-    ole_val2variant(v, pVarResult);
-    return S_OK;
-}
-
-BOOL
-ole_initialized(void)
-{
-    return g_ole_initialized;
-}
-
-static IDispatch*
-val2dispatch(VALUE val)
-{
-    struct st_table *tbl = DATA_PTR(com_hash);
-    Win32OLEIDispatch* pdisp;
-    st_data_t data;
-    if (st_lookup(tbl, val, &data)) {
-        pdisp = (Win32OLEIDispatch *)(data & ~FIXNUM_FLAG);
-        pdisp->refcount++;
-    }
-    else {
-        pdisp = ALLOC(Win32OLEIDispatch);
-        pdisp->dispatch.lpVtbl = &com_vtbl;
-        pdisp->refcount = 1;
-        pdisp->obj = val;
-        st_insert(tbl, val, (VALUE)pdisp | FIXNUM_FLAG);
-    }
-    return &pdisp->dispatch;
-}
-
-static double
-rbtime2vtdate(VALUE tmobj)
-{
-    SYSTEMTIME st;
-    double t;
-    double nsec;
-
-    st.wYear = RB_FIX2INT(rb_funcall(tmobj, rb_intern("year"), 0));
-    st.wMonth = RB_FIX2INT(rb_funcall(tmobj, rb_intern("month"), 0));
-    st.wDay = RB_FIX2INT(rb_funcall(tmobj, rb_intern("mday"), 0));
-    st.wHour = RB_FIX2INT(rb_funcall(tmobj, rb_intern("hour"), 0));
-    st.wMinute = RB_FIX2INT(rb_funcall(tmobj, rb_intern("min"), 0));
-    st.wSecond = RB_FIX2INT(rb_funcall(tmobj, rb_intern("sec"), 0));
-    st.wMilliseconds = 0;
-    SystemTimeToVariantTime(&st, &t);
-
-    /*
-     * Unfortunately SystemTimeToVariantTime function always ignores the
-     * wMilliseconds of SYSTEMTIME struct.
-     * So, we need to calculate milliseconds by ourselves.
-     */
-    nsec =  RB_FIX2INT(rb_funcall(tmobj, rb_intern("nsec"), 0));
-    nsec /= 1000000.0;
-    nsec /= (24.0 * 3600.0);
-    nsec /= 1000;
-    return t + nsec;
-}
-
-static VALUE
-vtdate2rbtime(double date)
-{
-    SYSTEMTIME st;
-    VALUE v;
-    double msec;
-    double sec;
-    VariantTimeToSystemTime(date, &st);
-    v = rb_funcall(rb_cTime, rb_intern("new"), 6,
-                      RB_INT2FIX(st.wYear),
-                      RB_INT2FIX(st.wMonth),
-                      RB_INT2FIX(st.wDay),
-                      RB_INT2FIX(st.wHour),
-                      RB_INT2FIX(st.wMinute),
-                      RB_INT2FIX(st.wSecond));
-    st.wYear = RB_FIX2INT(rb_funcall(v, rb_intern("year"), 0));
-    st.wMonth = RB_FIX2INT(rb_funcall(v, rb_intern("month"), 0));
-    st.wDay = RB_FIX2INT(rb_funcall(v, rb_intern("mday"), 0));
-    st.wHour = RB_FIX2INT(rb_funcall(v, rb_intern("hour"), 0));
-    st.wMinute = RB_FIX2INT(rb_funcall(v, rb_intern("min"), 0));
-    st.wSecond = RB_FIX2INT(rb_funcall(v, rb_intern("sec"), 0));
-    st.wMilliseconds = 0;
-    SystemTimeToVariantTime(&st, &sec);
-    /*
-     * Unfortunately VariantTimeToSystemTime always ignores the
-     * wMilliseconds of SYSTEMTIME struct(The wMilliseconds is 0).
-     * So, we need to calculate milliseconds by ourselves.
-     */
-    msec = date - sec;
-    msec *= 24 * 60;
-    msec -= floor(msec);
-    msec *= 60;
-    if (msec >= 59) {
-        msec -= 60;
-    }
-    if (msec != 0) {
-        return rb_funcall(v, rb_intern("+"), 1, rb_float_new(msec));
-    }
-    return v;
-}
-
-#define ENC_MACHING_CP(enc,encname,cp) if(strcasecmp(rb_enc_name((enc)),(encname)) == 0) return cp
-
-static UINT ole_encoding2cp(rb_encoding *enc)
-{
-    /*
-     * Is there any better solution to convert
-     * Ruby encoding to Windows codepage???
-     */
-    ENC_MACHING_CP(enc, "Big5", 950);
-    ENC_MACHING_CP(enc, "CP51932", 51932);
-    ENC_MACHING_CP(enc, "CP850", 850);
-    ENC_MACHING_CP(enc, "CP852", 852);
-    ENC_MACHING_CP(enc, "CP855", 855);
-    ENC_MACHING_CP(enc, "CP949", 949);
-    ENC_MACHING_CP(enc, "EUC-JP", 20932);
-    ENC_MACHING_CP(enc, "EUC-KR", 51949);
-    ENC_MACHING_CP(enc, "EUC-TW", 51950);
-    ENC_MACHING_CP(enc, "GB18030", 54936);
-    ENC_MACHING_CP(enc, "GB2312", 20936);
-    ENC_MACHING_CP(enc, "GBK", 936);
-    ENC_MACHING_CP(enc, "IBM437", 437);
-    ENC_MACHING_CP(enc, "IBM720", 720);
-    ENC_MACHING_CP(enc, "IBM737", 737);
-    ENC_MACHING_CP(enc, "IBM775", 775);
-    ENC_MACHING_CP(enc, "IBM852", 852);
-    ENC_MACHING_CP(enc, "IBM855", 855);
-    ENC_MACHING_CP(enc, "IBM857", 857);
-    ENC_MACHING_CP(enc, "IBM860", 860);
-    ENC_MACHING_CP(enc, "IBM861", 861);
-    ENC_MACHING_CP(enc, "IBM862", 862);
-    ENC_MACHING_CP(enc, "IBM863", 863);
-    ENC_MACHING_CP(enc, "IBM864", 864);
-    ENC_MACHING_CP(enc, "IBM865", 865);
-    ENC_MACHING_CP(enc, "IBM866", 866);
-    ENC_MACHING_CP(enc, "IBM869", 869);
-    ENC_MACHING_CP(enc, "ISO-2022-JP", 50220);
-    ENC_MACHING_CP(enc, "ISO-8859-1", 28591);
-    ENC_MACHING_CP(enc, "ISO-8859-15", 28605);
-    ENC_MACHING_CP(enc, "ISO-8859-2", 28592);
-    ENC_MACHING_CP(enc, "ISO-8859-3", 28593);
-    ENC_MACHING_CP(enc, "ISO-8859-4", 28594);
-    ENC_MACHING_CP(enc, "ISO-8859-5", 28595);
-    ENC_MACHING_CP(enc, "ISO-8859-6", 28596);
-    ENC_MACHING_CP(enc, "ISO-8859-7", 28597);
-    ENC_MACHING_CP(enc, "ISO-8859-8", 28598);
-    ENC_MACHING_CP(enc, "ISO-8859-9", 28599);
-    ENC_MACHING_CP(enc, "KOI8-R", 20866);
-    ENC_MACHING_CP(enc, "KOI8-U", 21866);
-    ENC_MACHING_CP(enc, "Shift_JIS", 932);
-    ENC_MACHING_CP(enc, "UTF-16BE", 1201);
-    ENC_MACHING_CP(enc, "UTF-16LE", 1200);
-    ENC_MACHING_CP(enc, "UTF-7", 65000);
-    ENC_MACHING_CP(enc, "UTF-8", 65001);
-    ENC_MACHING_CP(enc, "Windows-1250", 1250);
-    ENC_MACHING_CP(enc, "Windows-1251", 1251);
-    ENC_MACHING_CP(enc, "Windows-1252", 1252);
-    ENC_MACHING_CP(enc, "Windows-1253", 1253);
-    ENC_MACHING_CP(enc, "Windows-1254", 1254);
-    ENC_MACHING_CP(enc, "Windows-1255", 1255);
-    ENC_MACHING_CP(enc, "Windows-1256", 1256);
-    ENC_MACHING_CP(enc, "Windows-1257", 1257);
-    ENC_MACHING_CP(enc, "Windows-1258", 1258);
-    ENC_MACHING_CP(enc, "Windows-31J", 932);
-    ENC_MACHING_CP(enc, "Windows-874", 874);
-    ENC_MACHING_CP(enc, "eucJP-ms", 20932);
-    return CP_ACP;
-}
-
-static void
-failed_load_conv51932(void)
-{
-    rb_raise(eWIN32OLERuntimeError, "fail to load convert function for CP51932");
-}
-
-#ifndef pIMultiLanguage
-static void
-load_conv_function51932(void)
-{
-    HRESULT hr = E_NOINTERFACE;
-    void *p;
-    if (!pIMultiLanguage) {
-#if defined(HAVE_TYPE_IMULTILANGUAGE2)
-        hr = CoCreateInstance(&CLSID_CMultiLanguage, NULL, CLSCTX_INPROC_SERVER,
-                              &IID_IMultiLanguage2, &p);
-#elif defined(HAVE_TYPE_IMULTILANGUAGE)
-        hr = CoCreateInstance(&CLSID_CMultiLanguage, NULL, CLSCTX_INPROC_SERVER,
-                              &IID_IMultiLanguage, &p);
-#endif
-        if (FAILED(hr)) {
-            failed_load_conv51932();
-        }
-        pIMultiLanguage = p;
-    }
-}
-#define need_conv_function51932() (load_conv_function51932(), 1)
-#else
-#define load_conv_function51932() failed_load_conv51932()
-#define need_conv_function51932() (failed_load_conv51932(), 0)
-#endif
-
-#define conv_51932(cp) ((cp) == 51932 && need_conv_function51932())
-
-static void
-set_ole_codepage(UINT cp)
-{
-    if (code_page_installed(cp)) {
-        cWIN32OLE_cp = cp;
-    } else {
-        switch(cp) {
-        case CP_ACP:
-        case CP_OEMCP:
-        case CP_MACCP:
-        case CP_THREAD_ACP:
-        case CP_SYMBOL:
-        case CP_UTF7:
-        case CP_UTF8:
-            cWIN32OLE_cp = cp;
-            break;
-        case 51932:
-            cWIN32OLE_cp = cp;
-            load_conv_function51932();
-            break;
-        default:
-            rb_raise(eWIN32OLERuntimeError, "codepage should be WIN32OLE::CP_ACP, WIN32OLE::CP_OEMCP, WIN32OLE::CP_MACCP, WIN32OLE::CP_THREAD_ACP, WIN32OLE::CP_SYMBOL, WIN32OLE::CP_UTF7, WIN32OLE::CP_UTF8, or installed codepage.");
-            break;
-        }
-    }
-    cWIN32OLE_enc = ole_cp2encoding(cWIN32OLE_cp);
-}
-
-
-static UINT
-ole_init_cp(void)
-{
-    UINT cp;
-    rb_encoding *encdef;
-    encdef = rb_default_internal_encoding();
-    if (!encdef) {
-        encdef = rb_default_external_encoding();
-    }
-    cp = ole_encoding2cp(encdef);
-    set_ole_codepage(cp);
-    return cp;
-}
-
-struct myCPINFOEX {
-  UINT MaxCharSize;
-  BYTE DefaultChar[2];
-  BYTE LeadByte[12];
-  WCHAR UnicodeDefaultChar;
-  UINT CodePage;
-  char CodePageName[MAX_PATH];
-};
-
-static rb_encoding *
-ole_cp2encoding(UINT cp)
-{
-    static BOOL (*pGetCPInfoEx)(UINT, DWORD, struct myCPINFOEX *) = NULL;
-    struct myCPINFOEX* buf;
-    VALUE enc_name;
-    char *enc_cstr;
-    int idx;
-
-    if (!code_page_installed(cp)) {
-        switch(cp) {
-          case CP_ACP:
-            cp = GetACP();
-            break;
-          case CP_OEMCP:
-            cp = GetOEMCP();
-            break;
-          case CP_MACCP:
-          case CP_THREAD_ACP:
-            if (!pGetCPInfoEx) {
-                pGetCPInfoEx = (BOOL (*)(UINT, DWORD, struct myCPINFOEX *))
-                    GetProcAddress(GetModuleHandle("kernel32"), "GetCPInfoEx");
-                if (!pGetCPInfoEx) {
-                    pGetCPInfoEx = (void*)-1;
-                }
-            }
-            buf = ALLOCA_N(struct myCPINFOEX, 1);
-            ZeroMemory(buf, sizeof(struct myCPINFOEX));
-            if (pGetCPInfoEx == (void*)-1 || !pGetCPInfoEx(cp, 0, buf)) {
-                rb_raise(eWIN32OLERuntimeError, "cannot map codepage to encoding.");
-                break;	/* never reach here */
-            }
-            cp = buf->CodePage;
-            break;
-          case CP_SYMBOL:
-          case CP_UTF7:
-          case CP_UTF8:
-            break;
-          case 51932:
-            load_conv_function51932();
-            break;
-          default:
-            rb_raise(eWIN32OLERuntimeError, "codepage should be WIN32OLE::CP_ACP, WIN32OLE::CP_OEMCP, WIN32OLE::CP_MACCP, WIN32OLE::CP_THREAD_ACP, WIN32OLE::CP_SYMBOL, WIN32OLE::CP_UTF7, WIN32OLE::CP_UTF8, or installed codepage.");
-            break;
-        }
-    }
-
-    enc_name = rb_sprintf("CP%d", cp);
-    idx = rb_enc_find_index(enc_cstr = StringValueCStr(enc_name));
-    if (idx < 0)
-        idx = rb_define_dummy_encoding(enc_cstr);
-    return rb_enc_from_index(idx);
-}
-
-#ifndef pIMultiLanguage
-static HRESULT
-ole_ml_wc2mb_conv0(LPWSTR pw, LPSTR pm, UINT *size)
-{
-    DWORD dw = 0;
-    return pIMultiLanguage->lpVtbl->ConvertStringFromUnicode(pIMultiLanguage,
-                    &dw, cWIN32OLE_cp, pw, NULL, pm, size);
-}
-#define ole_ml_wc2mb_conv(pw, pm, size, onfailure) do { \
-        HRESULT hr = ole_ml_wc2mb_conv0(pw, pm, &size); \
-        if (FAILED(hr)) { \
-            onfailure; \
-            ole_raise(hr, eWIN32OLERuntimeError, "fail to convert Unicode to CP%d", cWIN32OLE_cp); \
-        } \
-    } while (0)
-#endif
-
-#define ole_wc2mb_conv(pw, pm, size) WideCharToMultiByte(cWIN32OLE_cp, 0, (pw), -1, (pm), (size), NULL, NULL)
-
-static char *
-ole_wc2mb_alloc(LPWSTR pw, char *(alloc)(UINT size, void *arg), void *arg)
-{
-    LPSTR pm;
-    UINT size = 0;
-    if (conv_51932(cWIN32OLE_cp)) {
-#ifndef pIMultiLanguage
-        ole_ml_wc2mb_conv(pw, NULL, size, {});
-        pm = alloc(size, arg);
-        if (size) ole_ml_wc2mb_conv(pw, pm, size, xfree(pm));
-        pm[size] = '\0';
-        return pm;
-#endif
-    }
-    size = ole_wc2mb_conv(pw, NULL, 0);
-    pm = alloc(size, arg);
-    if (size) ole_wc2mb_conv(pw, pm, size);
-    pm[size] = '\0';
-    return pm;
-}
-
-static char *
-ole_alloc_str(UINT size, void *arg)
-{
-    return ALLOC_N(char, size + 1);
-}
-
-char *
-ole_wc2mb(LPWSTR pw)
-{
-    return ole_wc2mb_alloc(pw, ole_alloc_str, NULL);
-}
-
-static void
-ole_freeexceptinfo(EXCEPINFO *pExInfo)
-{
-    SysFreeString(pExInfo->bstrDescription);
-    SysFreeString(pExInfo->bstrSource);
-    SysFreeString(pExInfo->bstrHelpFile);
-}
-
-static VALUE
-ole_excepinfo2msg(EXCEPINFO *pExInfo)
-{
-    char error_code[40];
-    char *pSource = NULL;
-    char *pDescription = NULL;
-    VALUE error_msg;
-    if(pExInfo->pfnDeferredFillIn != NULL) {
-        (*pExInfo->pfnDeferredFillIn)(pExInfo);
-    }
-    if (pExInfo->bstrSource != NULL) {
-        pSource = ole_wc2mb(pExInfo->bstrSource);
-    }
-    if (pExInfo->bstrDescription != NULL) {
-        pDescription = ole_wc2mb(pExInfo->bstrDescription);
-    }
-    if(pExInfo->wCode == 0) {
-        sprintf(error_code, "\n    OLE error code:%lX in ", (unsigned long)pExInfo->scode);
-    }
-    else{
-        sprintf(error_code, "\n    OLE error code:%u in ", pExInfo->wCode);
-    }
-    error_msg = rb_str_new2(error_code);
-    if(pSource != NULL) {
-        rb_str_cat2(error_msg, pSource);
-    }
-    else {
-        rb_str_cat(error_msg, "<Unknown>", 9);
-    }
-    rb_str_cat2(error_msg, "\n      ");
-    if(pDescription != NULL) {
-        rb_str_cat2(error_msg, pDescription);
-    }
-    else {
-        rb_str_cat2(error_msg, "<No Description>");
-    }
-    if(pSource) free(pSource);
-    if(pDescription) free(pDescription);
-    ole_freeexceptinfo(pExInfo);
-    return error_msg;
-}
-
-void
-ole_uninitialize(void)
-{
-    if (!g_ole_initialized) return;
-    OleUninitialize();
-    g_ole_initialized_set(FALSE);
-}
-
-static void
-ole_uninitialize_hook(rb_event_flag_t evflag, VALUE data, VALUE self, ID mid, VALUE klass)
-{
-    ole_uninitialize();
-}
-
-void
-ole_initialize(void)
-{
-    HRESULT hr;
-
-    if(!g_uninitialize_hooked) {
-        rb_add_event_hook(ole_uninitialize_hook, RUBY_EVENT_THREAD_END, Qnil);
-        g_uninitialize_hooked = TRUE;
-    }
-
-    if(g_ole_initialized == FALSE) {
-        if(g_running_nano) {
-            hr = CoInitializeEx(NULL, COINIT_MULTITHREADED);
-        } else {
-            hr = OleInitialize(NULL);
-        }
-        if(FAILED(hr)) {
-            ole_raise(hr, rb_eRuntimeError, "fail: OLE initialize");
-        }
-        g_ole_initialized_set(TRUE);
-
-        if (g_running_nano == FALSE) {
-            hr = CoRegisterMessageFilter(&imessage_filter, &previous_filter);
-            if(FAILED(hr)) {
-                previous_filter = NULL;
-                ole_raise(hr, rb_eRuntimeError, "fail: install OLE MessageFilter");
-            }
-        }
-    }
-}
-
-static void
-ole_free(void *ptr)
-{
-    struct oledata *pole = ptr;
-    OLE_FREE(pole->pDispatch);
-    free(pole);
-}
-
-static size_t ole_size(const void *ptr)
-{
-    return ptr ? sizeof(struct oledata) : 0;
-}
-
-struct oledata *
-oledata_get_struct(VALUE ole)
-{
-    struct oledata *pole;
-    TypedData_Get_Struct(ole, struct oledata, &ole_datatype, pole);
-    return pole;
-}
-
-LPWSTR
-ole_vstr2wc(VALUE vstr)
-{
-    rb_encoding *enc;
-    int cp;
-    LPWSTR pw;
-    st_data_t data;
-    struct st_table *tbl = DATA_PTR(enc2cp_hash);
-
-    /* do not type-conversion here to prevent from other arguments
-     * changing (if exist) */
-    Check_Type(vstr, T_STRING);
-    if (RSTRING_LEN(vstr) == 0) {
-        return NULL;
-    }
-
-    enc = rb_enc_get(vstr);
-
-    if (st_lookup(tbl, (VALUE)enc | FIXNUM_FLAG, &data)) {
-        cp = RB_FIX2INT((VALUE)data);
-    } else {
-        cp = ole_encoding2cp(enc);
-        if (code_page_installed(cp) ||
-            cp == CP_ACP ||
-            cp == CP_OEMCP ||
-            cp == CP_MACCP ||
-            cp == CP_THREAD_ACP ||
-            cp == CP_SYMBOL ||
-            cp == CP_UTF7 ||
-            cp == CP_UTF8 ||
-            cp == 51932) {
-            st_insert(tbl, (VALUE)enc | FIXNUM_FLAG, RB_INT2FIX(cp));
-        } else {
-            rb_raise(eWIN32OLERuntimeError, "not installed Windows codepage(%d) according to `%s'", cp, rb_enc_name(enc));
-        }
-    }
-    pw = ole_mb2wc(RSTRING_PTR(vstr), RSTRING_LENINT(vstr), cp);
-    RB_GC_GUARD(vstr);
-    return pw;
-}
-
-static LPWSTR
-ole_mb2wc(char *pm, int len, UINT cp)
-{
-    UINT size = 0;
-    LPWSTR pw;
-
-    if (conv_51932(cp)) {
-#ifndef pIMultiLanguage
-        DWORD dw = 0;
-        UINT n = len;
-        HRESULT hr = pIMultiLanguage->lpVtbl->ConvertStringToUnicode(pIMultiLanguage,
-                &dw, cp, pm, &n, NULL, &size);
-        if (FAILED(hr)) {
-            ole_raise(hr, eWIN32OLERuntimeError, "fail to convert CP%d to Unicode", cp);
-        }
-        pw = SysAllocStringLen(NULL, size);
-        n = len;
-        hr = pIMultiLanguage->lpVtbl->ConvertStringToUnicode(pIMultiLanguage,
-                &dw, cp, pm, &n, pw, &size);
-        if (FAILED(hr)) {
-            ole_raise(hr, eWIN32OLERuntimeError, "fail to convert CP%d to Unicode", cp);
-        }
-        return pw;
-#endif
-    }
-    size = MultiByteToWideChar(cp, 0, pm, len, NULL, 0);
-    pw = SysAllocStringLen(NULL, size);
-    pw[size-1] = 0;
-    MultiByteToWideChar(cp, 0, pm, len, pw, size);
-    return pw;
-}
-
-static char *
-ole_alloc_vstr(UINT size, void *arg)
-{
-    VALUE str = rb_enc_str_new(NULL, size, cWIN32OLE_enc);
-    *(VALUE *)arg = str;
-    return RSTRING_PTR(str);
-}
-
-VALUE
-ole_wc2vstr(LPWSTR pw, BOOL isfree)
-{
-    VALUE vstr;
-    ole_wc2mb_alloc(pw, ole_alloc_vstr, &vstr);
-    rb_str_set_len(vstr, (long)strlen(RSTRING_PTR(vstr)));
-    if(isfree)
-        SysFreeString(pw);
-    return vstr;
-}
-
-static VALUE
-ole_ary_m_entry(VALUE val, LONG *pid)
-{
-    VALUE obj = Qnil;
-    int i = 0;
-    obj = val;
-    while(RB_TYPE_P(obj, T_ARRAY)) {
-        obj = rb_ary_entry(obj, pid[i]);
-        i++;
-    }
-    return obj;
-}
-
-static VALUE
-is_all_index_under(LONG *pid, long *pub, long dim)
-{
-  long i = 0;
-  for (i = 0; i < dim; i++) {
-    if (pid[i] > pub[i]) {
-      return Qfalse;
-    }
-  }
-  return Qtrue;
-}
-
-void
-ole_val2variant_ex(VALUE val, VARIANT *var, VARTYPE vt)
-{
-    if (val == Qnil) {
-        if (vt == VT_VARIANT) {
-            ole_val2variant2(val, var);
-        } else {
-            V_VT(var) = (vt & ~VT_BYREF);
-            if (V_VT(var) == VT_DISPATCH) {
-                V_DISPATCH(var) = NULL;
-            } else if (V_VT(var) == VT_UNKNOWN) {
-                V_UNKNOWN(var) = NULL;
-            }
-        }
-        return;
-    }
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    switch(vt & ~VT_BYREF) {
-    case VT_I8:
-        V_VT(var) = VT_I8;
-        V_I8(var) = NUM2I8 (val);
-        break;
-    case VT_UI8:
-        V_VT(var) = VT_UI8;
-        V_UI8(var) = NUM2UI8(val);
-        break;
-    default:
-        ole_val2variant2(val, var);
-        break;
-    }
-#else  /* (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__) */
-    ole_val2variant2(val, var);
-#endif
-}
-
-VOID *
-val2variant_ptr(VALUE val, VARIANT *var, VARTYPE vt)
-{
-    VOID *p = NULL;
-    HRESULT hr = S_OK;
-    ole_val2variant_ex(val, var, vt);
-    if ((vt & ~VT_BYREF) == VT_VARIANT) {
-        p = var;
-    } else {
-        if ( (vt & ~VT_BYREF) != V_VT(var)) {
-            hr = VariantChangeTypeEx(var, var,
-                    cWIN32OLE_lcid, 0, (VARTYPE)(vt & ~VT_BYREF));
-            if (FAILED(hr)) {
-                ole_raise(hr, rb_eRuntimeError, "failed to change type");
-            }
-        }
-        p = get_ptr_of_variant(var);
-    }
-    if (p == NULL) {
-        rb_raise(rb_eRuntimeError, "failed to get pointer of variant");
-    }
-    return p;
-}
-
-static void *
-get_ptr_of_variant(VARIANT *pvar)
-{
-    switch(V_VT(pvar)) {
-    case VT_UI1:
-        return &V_UI1(pvar);
-        break;
-    case VT_I2:
-        return &V_I2(pvar);
-        break;
-    case VT_UI2:
-        return &V_UI2(pvar);
-        break;
-    case VT_I4:
-        return &V_I4(pvar);
-        break;
-    case VT_UI4:
-        return &V_UI4(pvar);
-        break;
-    case VT_R4:
-        return &V_R4(pvar);
-        break;
-    case VT_R8:
-        return &V_R8(pvar);
-        break;
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    case VT_I8:
-        return &V_I8(pvar);
-        break;
-    case VT_UI8:
-        return &V_UI8(pvar);
-        break;
-#endif
-    case VT_INT:
-        return &V_INT(pvar);
-        break;
-    case VT_UINT:
-        return &V_UINT(pvar);
-        break;
-    case VT_CY:
-        return &V_CY(pvar);
-        break;
-    case VT_DATE:
-        return &V_DATE(pvar);
-        break;
-    case VT_BSTR:
-        return V_BSTR(pvar);
-        break;
-    case VT_DISPATCH:
-        return V_DISPATCH(pvar);
-        break;
-    case VT_ERROR:
-        return &V_ERROR(pvar);
-        break;
-    case VT_BOOL:
-        return &V_BOOL(pvar);
-        break;
-    case VT_UNKNOWN:
-        return V_UNKNOWN(pvar);
-        break;
-    case VT_ARRAY:
-        return &V_ARRAY(pvar);
-        break;
-    default:
-        return NULL;
-        break;
-    }
-}
-
-static void
-ole_set_safe_array(long n, SAFEARRAY *psa, LONG *pid, long *pub, VALUE val, long dim,  VARTYPE vt)
-{
-    VALUE val1;
-    HRESULT hr = S_OK;
-    VARIANT var;
-    VOID *p = NULL;
-    long i = n;
-    while(i >= 0) {
-        val1 = ole_ary_m_entry(val, pid);
-        VariantInit(&var);
-        p = val2variant_ptr(val1, &var, vt);
-        if (is_all_index_under(pid, pub, dim) == Qtrue) {
-            if ((V_VT(&var) == VT_DISPATCH && V_DISPATCH(&var) == NULL) ||
-                (V_VT(&var) == VT_UNKNOWN && V_UNKNOWN(&var) == NULL)) {
-                rb_raise(eWIN32OLERuntimeError, "element of array does not have IDispatch or IUnknown Interface");
-            }
-            hr = SafeArrayPutElement(psa, pid, p);
-        }
-        if (FAILED(hr)) {
-            ole_raise(hr, rb_eRuntimeError, "failed to SafeArrayPutElement");
-        }
-        pid[i] += 1;
-        if (pid[i] > pub[i]) {
-            pid[i] = 0;
-            i -= 1;
-        } else {
-            i = dim - 1;
-        }
-    }
-}
-
-static long
-dimension(VALUE val) {
-    long dim = 0;
-    long dim1 = 0;
-    long len = 0;
-    long i = 0;
-    if (RB_TYPE_P(val, T_ARRAY)) {
-        len = RARRAY_LEN(val);
-        for (i = 0; i < len; i++) {
-            dim1 = dimension(rb_ary_entry(val, i));
-            if (dim < dim1) {
-                dim = dim1;
-            }
-        }
-        dim += 1;
-    }
-    return dim;
-}
-
-static long
-ary_len_of_dim(VALUE ary, long dim) {
-    long ary_len = 0;
-    long ary_len1 = 0;
-    long len = 0;
-    long i = 0;
-    VALUE val;
-    if (dim == 0) {
-        if (RB_TYPE_P(ary, T_ARRAY)) {
-            ary_len = RARRAY_LEN(ary);
-        }
-    } else {
-        if (RB_TYPE_P(ary, T_ARRAY)) {
-            len = RARRAY_LEN(ary);
-            for (i = 0; i < len; i++) {
-                val = rb_ary_entry(ary, i);
-                ary_len1 = ary_len_of_dim(val, dim-1);
-                if (ary_len < ary_len1) {
-                    ary_len = ary_len1;
-                }
-            }
-        }
-    }
-    return ary_len;
-}
-
-HRESULT
-ole_val_ary2variant_ary(VALUE val, VARIANT *var, VARTYPE vt)
-{
-    long dim = 0;
-    int  i = 0;
-    HRESULT hr = S_OK;
-
-    SAFEARRAYBOUND *psab = NULL;
-    SAFEARRAY *psa = NULL;
-    long      *pub;
-    LONG      *pid;
-
-    Check_Type(val, T_ARRAY);
-
-    dim = dimension(val);
-
-    psab = ALLOC_N(SAFEARRAYBOUND, dim);
-    pub  = ALLOC_N(long, dim);
-    pid  = ALLOC_N(LONG, dim);
-
-    if(!psab || !pub || !pid) {
-        if(pub) free(pub);
-        if(psab) free(psab);
-        if(pid) free(pid);
-        rb_raise(rb_eRuntimeError, "memory allocation error");
-    }
-
-    for (i = 0; i < dim; i++) {
-        psab[i].cElements = ary_len_of_dim(val, i);
-        psab[i].lLbound = 0;
-        pub[i] = psab[i].cElements - 1;
-        pid[i] = 0;
-    }
-    /* Create and fill VARIANT array */
-    if ((vt & ~VT_BYREF) == VT_ARRAY) {
-        vt = (vt | VT_VARIANT);
-    }
-    psa = SafeArrayCreate((VARTYPE)(vt & VT_TYPEMASK), dim, psab);
-    if (psa == NULL)
-        hr = E_OUTOFMEMORY;
-    else
-        hr = SafeArrayLock(psa);
-    if (SUCCEEDED(hr)) {
-        ole_set_safe_array(dim-1, psa, pid, pub, val, dim, (VARTYPE)(vt & VT_TYPEMASK));
-        hr = SafeArrayUnlock(psa);
-    }
-
-    if(pub) free(pub);
-    if(psab) free(psab);
-    if(pid) free(pid);
-
-    if (SUCCEEDED(hr)) {
-        V_VT(var) = vt;
-        V_ARRAY(var) = psa;
-    }
-    else {
-        if (psa != NULL)
-            SafeArrayDestroy(psa);
-    }
-    return hr;
-}
-
-void
-ole_val2variant(VALUE val, VARIANT *var)
-{
-    struct oledata *pole = NULL;
-    if(rb_obj_is_kind_of(val, cWIN32OLE)) {
-        pole = oledata_get_struct(val);
-        OLE_ADDREF(pole->pDispatch);
-        V_VT(var) = VT_DISPATCH;
-        V_DISPATCH(var) = pole->pDispatch;
-        return;
-    }
-    if (rb_obj_is_kind_of(val, cWIN32OLE_VARIANT)) {
-        ole_variant2variant(val, var);
-        return;
-    }
-    if (rb_obj_is_kind_of(val, cWIN32OLE_RECORD)) {
-        ole_rec2variant(val, var);
-        return;
-    }
-    if (rb_obj_is_kind_of(val, rb_cTime)) {
-        V_VT(var) = VT_DATE;
-        V_DATE(var) = rbtime2vtdate(val);
-        return;
-    }
-    switch (TYPE(val)) {
-    case T_ARRAY:
-        ole_val_ary2variant_ary(val, var, VT_VARIANT|VT_ARRAY);
-        break;
-    case T_STRING:
-        V_VT(var) = VT_BSTR;
-        V_BSTR(var) = ole_vstr2wc(val);
-        break;
-    case T_FIXNUM:
-        V_VT(var) = VT_I4;
-        {
-            long v = RB_NUM2LONG(val);
-            V_I4(var) = (LONG)v;
-#if SIZEOF_LONG > 4
-            if (V_I4(var) != v) {
-                V_I8(var) = v;
-                V_VT(var) = VT_I8;
-            }
-#endif
-        }
-        break;
-    case T_BIGNUM:
-        V_VT(var) = VT_R8;
-        V_R8(var) = rb_big2dbl(val);
-        break;
-    case T_FLOAT:
-        V_VT(var) = VT_R8;
-        V_R8(var) = NUM2DBL(val);
-        break;
-    case T_TRUE:
-        V_VT(var) = VT_BOOL;
-        V_BOOL(var) = VARIANT_TRUE;
-        break;
-    case T_FALSE:
-        V_VT(var) = VT_BOOL;
-        V_BOOL(var) = VARIANT_FALSE;
-        break;
-    case T_NIL:
-        if (g_nil_to == VT_ERROR) {
-            V_VT(var) = VT_ERROR;
-            V_ERROR(var) = DISP_E_PARAMNOTFOUND;
-        }else {
-            V_VT(var) = VT_EMPTY;
-        }
-        break;
-    default:
-        V_VT(var) = VT_DISPATCH;
-        V_DISPATCH(var) = val2dispatch(val);
-        break;
-    }
-}
-
-void
-ole_val2variant2(VALUE val, VARIANT *var)
-{
-    g_nil_to = VT_EMPTY;
-    ole_val2variant(val, var);
-    g_nil_to = VT_ERROR;
-}
-
-VALUE
-make_inspect(const char *class_name, VALUE detail)
-{
-    VALUE str;
-    str = rb_str_new2("#<");
-    rb_str_cat2(str, class_name);
-    rb_str_cat2(str, ":");
-    rb_str_concat(str, detail);
-    rb_str_cat2(str, ">");
-    return str;
-}
-
-VALUE
-default_inspect(VALUE self, const char *class_name)
-{
-    VALUE detail = rb_funcall(self, rb_intern("to_s"), 0);
-    return make_inspect(class_name, detail);
-}
-
-static VALUE
-ole_set_member(VALUE self, IDispatch *dispatch)
-{
-    struct oledata *pole = NULL;
-    pole = oledata_get_struct(self);
-    if (pole->pDispatch) {
-        OLE_RELEASE(pole->pDispatch);
-        pole->pDispatch = NULL;
-    }
-    pole->pDispatch = dispatch;
-    return self;
-}
-
-
-static VALUE
-fole_s_allocate(VALUE klass)
-{
-    struct oledata *pole;
-    VALUE obj;
-    ole_initialize();
-    obj = TypedData_Make_Struct(klass, struct oledata, &ole_datatype, pole);
-    pole->pDispatch = NULL;
-    return obj;
-}
-
-static VALUE
-create_win32ole_object(VALUE klass, IDispatch *pDispatch, int argc, VALUE *argv)
-{
-    VALUE obj = fole_s_allocate(klass);
-    ole_set_member(obj, pDispatch);
-    return obj;
-}
-
-static VALUE
-ary_new_dim(VALUE myary, LONG *pid, LONG *plb, LONG dim) {
-    long i;
-    VALUE obj = Qnil;
-    VALUE pobj = Qnil;
-    long *ids = ALLOC_N(long, dim);
-    if (!ids) {
-        rb_raise(rb_eRuntimeError, "memory allocation error");
-    }
-    for(i = 0; i < dim; i++) {
-        ids[i] = pid[i] - plb[i];
-    }
-    obj = myary;
-    pobj = myary;
-    for(i = 0; i < dim-1; i++) {
-        obj = rb_ary_entry(pobj, ids[i]);
-        if (obj == Qnil) {
-            rb_ary_store(pobj, ids[i], rb_ary_new());
-        }
-        obj = rb_ary_entry(pobj, ids[i]);
-        pobj = obj;
-    }
-    if (ids) free(ids);
-    return obj;
-}
-
-static void
-ary_store_dim(VALUE myary, LONG *pid, LONG *plb, LONG dim, VALUE val) {
-    long id = pid[dim - 1] - plb[dim - 1];
-    VALUE obj = ary_new_dim(myary, pid, plb, dim);
-    rb_ary_store(obj, id, val);
-}
-
-VALUE
-ole_variant2val(VARIANT *pvar)
-{
-    VALUE obj = Qnil;
-    VARTYPE vt = V_VT(pvar);
-    HRESULT hr;
-    while ( vt == (VT_BYREF | VT_VARIANT) ) {
-        pvar = V_VARIANTREF(pvar);
-        vt = V_VT(pvar);
-    }
-
-    if(V_ISARRAY(pvar)) {
-        VARTYPE vt_base = vt & VT_TYPEMASK;
-        SAFEARRAY *psa = V_ISBYREF(pvar) ? *V_ARRAYREF(pvar) : V_ARRAY(pvar);
-        UINT i = 0;
-        LONG *pid, *plb, *pub;
-        VARIANT variant;
-        VALUE val;
-        UINT dim = 0;
-        if (!psa) {
-            return obj;
-        }
-        dim = SafeArrayGetDim(psa);
-        pid = ALLOC_N(LONG, dim);
-        plb = ALLOC_N(LONG, dim);
-        pub = ALLOC_N(LONG, dim);
-
-        if(!pid || !plb || !pub) {
-            if(pid) free(pid);
-            if(plb) free(plb);
-            if(pub) free(pub);
-            rb_raise(rb_eRuntimeError, "memory allocation error");
-        }
-
-        for(i = 0; i < dim; ++i) {
-            SafeArrayGetLBound(psa, i+1, &plb[i]);
-            SafeArrayGetLBound(psa, i+1, &pid[i]);
-            SafeArrayGetUBound(psa, i+1, &pub[i]);
-        }
-        hr = SafeArrayLock(psa);
-        if (SUCCEEDED(hr)) {
-            obj = rb_ary_new();
-            i = 0;
-            VariantInit(&variant);
-            V_VT(&variant) = vt_base | VT_BYREF;
-            if (vt_base == VT_RECORD) {
-                hr = SafeArrayGetRecordInfo(psa, &V_RECORDINFO(&variant));
-                if (SUCCEEDED(hr)) {
-                    V_VT(&variant) = VT_RECORD;
-                }
-            }
-            while (i < dim) {
-                ary_new_dim(obj, pid, plb, dim);
-                if (vt_base == VT_RECORD)
-                    hr = SafeArrayPtrOfIndex(psa, pid, &V_RECORD(&variant));
-                else
-                    hr = SafeArrayPtrOfIndex(psa, pid, &V_BYREF(&variant));
-                if (SUCCEEDED(hr)) {
-                    val = ole_variant2val(&variant);
-                    ary_store_dim(obj, pid, plb, dim, val);
-                }
-                for (i = 0; i < dim; ++i) {
-                    if (++pid[i] <= pub[i])
-                        break;
-                    pid[i] = plb[i];
-                }
-            }
-            SafeArrayUnlock(psa);
-        }
-        if(pid) free(pid);
-        if(plb) free(plb);
-        if(pub) free(pub);
-        return obj;
-    }
-    switch(V_VT(pvar) & ~VT_BYREF){
-    case VT_EMPTY:
-        break;
-    case VT_NULL:
-        break;
-    case VT_I1:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_I1REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_I1(pvar));
-        break;
-
-    case VT_UI1:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_UI1REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_UI1(pvar));
-        break;
-
-    case VT_I2:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_I2REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_I2(pvar));
-        break;
-
-    case VT_UI2:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_UI2REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_UI2(pvar));
-        break;
-
-    case VT_I4:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_I4REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_I4(pvar));
-        break;
-
-    case VT_UI4:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_UI4REF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_UI4(pvar));
-        break;
-
-    case VT_INT:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_INTREF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_INT(pvar));
-        break;
-
-    case VT_UINT:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM((long)*V_UINTREF(pvar));
-        else
-            obj = RB_INT2NUM((long)V_UINT(pvar));
-        break;
-
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    case VT_I8:
-        if(V_ISBYREF(pvar))
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-#ifdef V_I8REF
-            obj = I8_2_NUM(*V_I8REF(pvar));
-#endif
-#else
-            obj = Qnil;
-#endif
-        else
-            obj = I8_2_NUM(V_I8(pvar));
-        break;
-    case VT_UI8:
-        if(V_ISBYREF(pvar))
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-#ifdef V_UI8REF
-            obj = UI8_2_NUM(*V_UI8REF(pvar));
-#endif
-#else
-            obj = Qnil;
-#endif
-        else
-            obj = UI8_2_NUM(V_UI8(pvar));
-        break;
-#endif  /* (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__) */
-
-    case VT_R4:
-        if(V_ISBYREF(pvar))
-            obj = rb_float_new(*V_R4REF(pvar));
-        else
-            obj = rb_float_new(V_R4(pvar));
-        break;
-
-    case VT_R8:
-        if(V_ISBYREF(pvar))
-            obj = rb_float_new(*V_R8REF(pvar));
-        else
-            obj = rb_float_new(V_R8(pvar));
-        break;
-
-    case VT_BSTR:
-    {
-        BSTR bstr;
-        if(V_ISBYREF(pvar))
-            bstr = *V_BSTRREF(pvar);
-        else
-            bstr = V_BSTR(pvar);
-        obj = (SysStringLen(bstr) == 0)
-            ? rb_str_new2("")
-            : ole_wc2vstr(bstr, FALSE);
-        break;
-    }
-
-    case VT_ERROR:
-        if(V_ISBYREF(pvar))
-            obj = RB_INT2NUM(*V_ERRORREF(pvar));
-        else
-            obj = RB_INT2NUM(V_ERROR(pvar));
-        break;
-
-    case VT_BOOL:
-        if (V_ISBYREF(pvar))
-            obj = (*V_BOOLREF(pvar) ? Qtrue : Qfalse);
-        else
-            obj = (V_BOOL(pvar) ? Qtrue : Qfalse);
-        break;
-
-    case VT_DISPATCH:
-    {
-        IDispatch *pDispatch;
-
-        if (V_ISBYREF(pvar))
-            pDispatch = *V_DISPATCHREF(pvar);
-        else
-            pDispatch = V_DISPATCH(pvar);
-
-        if (pDispatch != NULL ) {
-            OLE_ADDREF(pDispatch);
-            obj = create_win32ole_object(cWIN32OLE, pDispatch, 0, 0);
-        }
-        break;
-    }
-
-    case VT_UNKNOWN:
-    {
-        /* get IDispatch interface from IUnknown interface */
-        IUnknown *punk;
-        IDispatch *pDispatch;
-        void *p;
-        HRESULT hr;
-
-        if (V_ISBYREF(pvar))
-            punk = *V_UNKNOWNREF(pvar);
-        else
-            punk = V_UNKNOWN(pvar);
-
-        if(punk != NULL) {
-           hr = punk->lpVtbl->QueryInterface(punk, &IID_IDispatch, &p);
-           if(SUCCEEDED(hr)) {
-               pDispatch = p;
-               obj = create_win32ole_object(cWIN32OLE, pDispatch, 0, 0);
-           }
-        }
-        break;
-    }
-
-    case VT_DATE:
-    {
-        DATE date;
-        if(V_ISBYREF(pvar))
-            date = *V_DATEREF(pvar);
-        else
-            date = V_DATE(pvar);
-
-        obj =  vtdate2rbtime(date);
-        break;
-    }
-
-    case VT_RECORD:
-    {
-        IRecordInfo *pri = V_RECORDINFO(pvar);
-        void *prec = V_RECORD(pvar);
-        obj = create_win32ole_record(pri, prec);
-        break;
-    }
-
-    case VT_CY:
-    default:
-        {
-        HRESULT hr;
-        VARIANT variant;
-        VariantInit(&variant);
-        hr = VariantChangeTypeEx(&variant, pvar,
-                                  cWIN32OLE_lcid, 0, VT_BSTR);
-        if (SUCCEEDED(hr) && V_VT(&variant) == VT_BSTR) {
-            obj = ole_wc2vstr(V_BSTR(&variant), FALSE);
-        }
-        VariantClear(&variant);
-        break;
-        }
-    }
-    return obj;
-}
-
-LONG
-reg_open_key(HKEY hkey, const char *name, HKEY *phkey)
-{
-    return RegOpenKeyEx(hkey, name, 0, KEY_READ, phkey);
-}
-
-LONG
-reg_open_vkey(HKEY hkey, VALUE key, HKEY *phkey)
-{
-    return reg_open_key(hkey, StringValuePtr(key), phkey);
-}
-
-VALUE
-reg_enum_key(HKEY hkey, DWORD i)
-{
-    char buf[BUFSIZ + 1];
-    DWORD size_buf = sizeof(buf);
-    FILETIME ft;
-    LONG err = RegEnumKeyEx(hkey, i, buf, &size_buf,
-                            NULL, NULL, NULL, &ft);
-    if(err == ERROR_SUCCESS) {
-        buf[BUFSIZ] = '\0';
-        return rb_str_new2(buf);
-    }
-    return Qnil;
-}
-
-VALUE
-reg_get_val(HKEY hkey, const char *subkey)
-{
-    char *pbuf;
-    DWORD dwtype = 0;
-    DWORD size = 0;
-    VALUE val = Qnil;
-    LONG err = RegQueryValueEx(hkey, subkey, NULL, &dwtype, NULL, &size);
-
-    if (err == ERROR_SUCCESS) {
-        pbuf = ALLOC_N(char, size + 1);
-        err = RegQueryValueEx(hkey, subkey, NULL, &dwtype, (BYTE *)pbuf, &size);
-        if (err == ERROR_SUCCESS) {
-            pbuf[size] = '\0';
-            if (dwtype == REG_EXPAND_SZ) {
-                char* pbuf2 = (char *)pbuf;
-                DWORD len = ExpandEnvironmentStrings(pbuf2, NULL, 0);
-                pbuf = ALLOC_N(char, len + 1);
-                ExpandEnvironmentStrings(pbuf2, pbuf, len + 1);
-                free(pbuf2);
-            }
-            val = rb_str_new2((char *)pbuf);
-        }
-        free(pbuf);
-    }
-    return val;
-}
-
-VALUE
-reg_get_val2(HKEY hkey, const char *subkey)
-{
-    HKEY hsubkey;
-    LONG err;
-    VALUE val = Qnil;
-    err = RegOpenKeyEx(hkey, subkey, 0, KEY_READ, &hsubkey);
-    if (err == ERROR_SUCCESS) {
-        val = reg_get_val(hsubkey, NULL);
-        RegCloseKey(hsubkey);
-    }
-    if (val == Qnil) {
-        val = reg_get_val(hkey, subkey);
-    }
-    return val;
-}
-
-static void
-ole_const_load(ITypeLib *pTypeLib, VALUE klass, VALUE self)
-{
-    unsigned int count;
-    unsigned int index;
-    int iVar;
-    ITypeInfo *pTypeInfo;
-    TYPEATTR  *pTypeAttr;
-    VARDESC   *pVarDesc;
-    HRESULT hr;
-    unsigned int len;
-    BSTR bstr;
-    char *pName = NULL;
-    VALUE val;
-    VALUE constant;
-    ID id;
-    constant = rb_hash_new();
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (index = 0; index < count; index++) {
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, index, &pTypeInfo);
-        if (FAILED(hr))
-            continue;
-        hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-        if(FAILED(hr)) {
-            OLE_RELEASE(pTypeInfo);
-            continue;
-        }
-        for(iVar = 0; iVar < pTypeAttr->cVars; iVar++) {
-            hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, iVar, &pVarDesc);
-            if(FAILED(hr))
-                continue;
-            if(pVarDesc->varkind == VAR_CONST &&
-               !(pVarDesc->wVarFlags & (VARFLAG_FHIDDEN |
-                                        VARFLAG_FRESTRICTED |
-                                        VARFLAG_FNONBROWSABLE))) {
-                hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, pVarDesc->memid, &bstr,
-                                                 1, &len);
-                if(FAILED(hr) || len == 0 || !bstr)
-                    continue;
-                pName = ole_wc2mb(bstr);
-                val = ole_variant2val(V_UNION1(pVarDesc, lpvarValue));
-                *pName = toupper((int)*pName);
-                id = rb_intern(pName);
-                if (rb_is_const_id(id)) {
-                    if(!rb_const_defined_at(klass, id)) {
-                        rb_define_const(klass, pName, val);
-                    }
-                }
-                else {
-                    rb_hash_aset(constant, rb_str_new2(pName), val);
-                }
-                SysFreeString(bstr);
-                if(pName) {
-                    free(pName);
-                    pName = NULL;
-                }
-            }
-            pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-        }
-        pTypeInfo->lpVtbl->ReleaseTypeAttr(pTypeInfo, pTypeAttr);
-        OLE_RELEASE(pTypeInfo);
-    }
-    rb_define_const(klass, "CONSTANTS", constant);
-}
-
-static HRESULT
-clsid_from_remote(VALUE host, VALUE com, CLSID *pclsid)
-{
-    HKEY hlm;
-    HKEY hpid;
-    VALUE subkey;
-    LONG err;
-    char clsid[100];
-    OLECHAR *pbuf;
-    DWORD len;
-    DWORD dwtype;
-    HRESULT hr = S_OK;
-    err = RegConnectRegistry(StringValuePtr(host), HKEY_LOCAL_MACHINE, &hlm);
-    if (err != ERROR_SUCCESS)
-        return HRESULT_FROM_WIN32(err);
-    subkey = rb_str_new2("SOFTWARE\\Classes\\");
-    rb_str_concat(subkey, com);
-    rb_str_cat2(subkey, "\\CLSID");
-    err = RegOpenKeyEx(hlm, StringValuePtr(subkey), 0, KEY_READ, &hpid);
-    if (err != ERROR_SUCCESS)
-        hr = HRESULT_FROM_WIN32(err);
-    else {
-        len = sizeof(clsid);
-        err = RegQueryValueEx(hpid, "", NULL, &dwtype, (BYTE *)clsid, &len);
-        if (err == ERROR_SUCCESS && dwtype == REG_SZ) {
-            pbuf = ole_mb2wc(clsid, -1, cWIN32OLE_cp);
-            hr = CLSIDFromString(pbuf, pclsid);
-            SysFreeString(pbuf);
-        }
-        else {
-            hr = HRESULT_FROM_WIN32(err);
-        }
-        RegCloseKey(hpid);
-    }
-    RegCloseKey(hlm);
-    return hr;
-}
-
-static VALUE
-ole_create_dcom(VALUE self, VALUE ole, VALUE host, VALUE others)
-{
-    HRESULT hr;
-    CLSID   clsid;
-    OLECHAR *pbuf;
-
-    COSERVERINFO serverinfo;
-    MULTI_QI multi_qi;
-    DWORD clsctx = CLSCTX_REMOTE_SERVER;
-
-    if (!gole32)
-        gole32 = LoadLibrary("OLE32");
-    if (!gole32)
-        rb_raise(rb_eRuntimeError, "failed to load OLE32");
-    if (!gCoCreateInstanceEx)
-        gCoCreateInstanceEx = (FNCOCREATEINSTANCEEX*)
-            GetProcAddress(gole32, "CoCreateInstanceEx");
-    if (!gCoCreateInstanceEx)
-        rb_raise(rb_eRuntimeError, "CoCreateInstanceEx is not supported in this environment");
-
-    pbuf  = ole_vstr2wc(ole);
-    hr = CLSIDFromProgID(pbuf, &clsid);
-    if (FAILED(hr))
-        hr = clsid_from_remote(host, ole, &clsid);
-    if (FAILED(hr))
-        hr = CLSIDFromString(pbuf, &clsid);
-    SysFreeString(pbuf);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "unknown OLE server: `%s'",
-                  StringValuePtr(ole));
-    memset(&serverinfo, 0, sizeof(COSERVERINFO));
-    serverinfo.pwszName = ole_vstr2wc(host);
-    memset(&multi_qi, 0, sizeof(MULTI_QI));
-    multi_qi.pIID = &IID_IDispatch;
-    hr = gCoCreateInstanceEx(&clsid, NULL, clsctx, &serverinfo, 1, &multi_qi);
-    SysFreeString(serverinfo.pwszName);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to create DCOM server `%s' in `%s'",
-                  StringValuePtr(ole),
-                  StringValuePtr(host));
-
-    ole_set_member(self, (IDispatch*)multi_qi.pItf);
-    return self;
-}
-
-static VALUE
-ole_bind_obj(VALUE moniker, int argc, VALUE *argv, VALUE self)
-{
-    IBindCtx *pBindCtx;
-    IMoniker *pMoniker;
-    IDispatch *pDispatch;
-    void *p;
-    HRESULT hr;
-    OLECHAR *pbuf;
-    ULONG eaten = 0;
-
-    ole_initialize();
-
-    hr = CreateBindCtx(0, &pBindCtx);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to create bind context");
-    }
-
-    pbuf  = ole_vstr2wc(moniker);
-    hr = MkParseDisplayName(pBindCtx, pbuf, &eaten, &pMoniker);
-    SysFreeString(pbuf);
-    if(FAILED(hr)) {
-        OLE_RELEASE(pBindCtx);
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to parse display name of moniker `%s'",
-                  StringValuePtr(moniker));
-    }
-    hr = pMoniker->lpVtbl->BindToObject(pMoniker, pBindCtx, NULL,
-                                        &IID_IDispatch, &p);
-    pDispatch = p;
-    OLE_RELEASE(pMoniker);
-    OLE_RELEASE(pBindCtx);
-
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to bind moniker `%s'",
-                  StringValuePtr(moniker));
-    }
-    return create_win32ole_object(self, pDispatch, argc, argv);
-}
-
-/*
- *  call-seq:
- *     connect(ole) --> aWIN32OLE
- *
- *  Returns running OLE Automation object or WIN32OLE object from moniker.
- *  1st argument should be OLE program id or class id or moniker.
- *
- *     WIN32OLE.connect('Excel.Application') # => WIN32OLE object which represents running Excel.
- */
-static VALUE
-fole_s_connect(int argc, VALUE *argv, VALUE self)
-{
-    VALUE svr_name;
-    VALUE others;
-    HRESULT hr;
-    CLSID   clsid;
-    OLECHAR *pBuf;
-    IDispatch *pDispatch;
-    void *p;
-    IUnknown *pUnknown;
-
-    /* initialize to use OLE */
-    ole_initialize();
-
-    rb_scan_args(argc, argv, "1*", &svr_name, &others);
-    StringValue(svr_name);
-
-    /* get CLSID from OLE server name */
-    pBuf = ole_vstr2wc(svr_name);
-    hr = CLSIDFromProgID(pBuf, &clsid);
-    if(FAILED(hr)) {
-        hr = CLSIDFromString(pBuf, &clsid);
-    }
-    SysFreeString(pBuf);
-    if(FAILED(hr)) {
-        return ole_bind_obj(svr_name, argc, argv, self);
-    }
-
-    hr = GetActiveObject(&clsid, 0, &pUnknown);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "OLE server `%s' not running", StringValuePtr(svr_name));
-    }
-    hr = pUnknown->lpVtbl->QueryInterface(pUnknown, &IID_IDispatch, &p);
-    pDispatch = p;
-    if(FAILED(hr)) {
-        OLE_RELEASE(pUnknown);
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to create WIN32OLE server `%s'",
-                  StringValuePtr(svr_name));
-    }
-
-    OLE_RELEASE(pUnknown);
-
-    return create_win32ole_object(self, pDispatch, argc, argv);
-}
-
-/*
- *  call-seq:
- *     const_load(ole, mod = WIN32OLE)
- *
- *  Defines the constants of OLE Automation server as mod's constants.
- *  The first argument is WIN32OLE object or type library name.
- *  If 2nd argument is omitted, the default is WIN32OLE.
- *  The first letter of Ruby's constant variable name is upper case,
- *  so constant variable name of WIN32OLE object is capitalized.
- *  For example, the 'xlTop' constant of Excel is changed to 'XlTop'
- *  in WIN32OLE.
- *  If the first letter of constant variable is not [A-Z], then
- *  the constant is defined as CONSTANTS hash element.
- *
- *     module EXCEL_CONST
- *     end
- *     excel = WIN32OLE.new('Excel.Application')
- *     WIN32OLE.const_load(excel, EXCEL_CONST)
- *     puts EXCEL_CONST::XlTop # => -4160
- *     puts EXCEL_CONST::CONSTANTS['_xlDialogChartSourceData'] # => 541
- *
- *     WIN32OLE.const_load(excel)
- *     puts WIN32OLE::XlTop # => -4160
- *
- *     module MSO
- *     end
- *     WIN32OLE.const_load('Microsoft Office 9.0 Object Library', MSO)
- *     puts MSO::MsoLineSingle # => 1
- */
-static VALUE
-fole_s_const_load(int argc, VALUE *argv, VALUE self)
-{
-    VALUE ole;
-    VALUE klass;
-    struct oledata *pole = NULL;
-    ITypeInfo *pTypeInfo;
-    ITypeLib *pTypeLib;
-    unsigned int index;
-    HRESULT hr;
-    OLECHAR *pBuf;
-    VALUE file;
-    LCID    lcid = cWIN32OLE_lcid;
-
-    rb_scan_args(argc, argv, "11", &ole, &klass);
-    if (!RB_TYPE_P(klass, T_CLASS) &&
-        !RB_TYPE_P(klass, T_MODULE) &&
-        !RB_TYPE_P(klass, T_NIL)) {
-        rb_raise(rb_eTypeError, "2nd parameter must be Class or Module");
-    }
-    if (rb_obj_is_kind_of(ole, cWIN32OLE)) {
-        pole = oledata_get_struct(ole);
-        hr = pole->pDispatch->lpVtbl->GetTypeInfo(pole->pDispatch,
-                                                  0, lcid, &pTypeInfo);
-        if(FAILED(hr)) {
-            ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeInfo");
-        }
-        hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, &pTypeLib, &index);
-        if(FAILED(hr)) {
-            OLE_RELEASE(pTypeInfo);
-            ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetContainingTypeLib");
-        }
-        OLE_RELEASE(pTypeInfo);
-        if(!RB_TYPE_P(klass, T_NIL)) {
-            ole_const_load(pTypeLib, klass, self);
-        }
-        else {
-            ole_const_load(pTypeLib, cWIN32OLE, self);
-        }
-        OLE_RELEASE(pTypeLib);
-    }
-    else if(RB_TYPE_P(ole, T_STRING)) {
-        file = typelib_file(ole);
-        if (file == Qnil) {
-            file = ole;
-        }
-        pBuf = ole_vstr2wc(file);
-        hr = LoadTypeLibEx(pBuf, REGKIND_NONE, &pTypeLib);
-        SysFreeString(pBuf);
-        if (FAILED(hr))
-          ole_raise(hr, eWIN32OLERuntimeError, "failed to LoadTypeLibEx");
-        if(!RB_TYPE_P(klass, T_NIL)) {
-            ole_const_load(pTypeLib, klass, self);
-        }
-        else {
-            ole_const_load(pTypeLib, cWIN32OLE, self);
-        }
-        OLE_RELEASE(pTypeLib);
-    }
-    else {
-        rb_raise(rb_eTypeError, "1st parameter must be WIN32OLE instance");
-    }
-    return Qnil;
-}
-
-static ULONG
-reference_count(struct oledata * pole)
-{
-    ULONG n = 0;
-    if(pole->pDispatch) {
-        OLE_ADDREF(pole->pDispatch);
-        n = OLE_RELEASE(pole->pDispatch);
-    }
-    return n;
-}
-
-/*
- *  call-seq:
- *     ole_reference_count(aWIN32OLE) --> number
- *
- *  Returns reference counter of Dispatch interface of WIN32OLE object.
- *  You should not use this method because this method
- *  exists only for debugging WIN32OLE.
- */
-static VALUE
-fole_s_reference_count(VALUE self, VALUE obj)
-{
-    struct oledata * pole = NULL;
-    pole = oledata_get_struct(obj);
-    return RB_INT2NUM(reference_count(pole));
-}
-
-/*
- *  call-seq:
- *     ole_free(aWIN32OLE) --> number
- *
- *  Invokes Release method of Dispatch interface of WIN32OLE object.
- *  You should not use this method because this method
- *  exists only for debugging WIN32OLE.
- *  The return value is reference counter of OLE object.
- */
-static VALUE
-fole_s_free(VALUE self, VALUE obj)
-{
-    ULONG n = 0;
-    struct oledata * pole = NULL;
-    pole = oledata_get_struct(obj);
-    if(pole->pDispatch) {
-        if (reference_count(pole) > 0) {
-            n = OLE_RELEASE(pole->pDispatch);
-        }
-    }
-    return RB_INT2NUM(n);
-}
-
-static HWND
-ole_show_help(VALUE helpfile, VALUE helpcontext)
-{
-    FNHTMLHELP *pfnHtmlHelp;
-    HWND hwnd = 0;
-
-    if(!ghhctrl)
-        ghhctrl = LoadLibrary("HHCTRL.OCX");
-    if (!ghhctrl)
-        return hwnd;
-    pfnHtmlHelp = (FNHTMLHELP*)GetProcAddress(ghhctrl, "HtmlHelpA");
-    if (!pfnHtmlHelp)
-        return hwnd;
-    hwnd = pfnHtmlHelp(GetDesktopWindow(), StringValuePtr(helpfile),
-                    0x0f, RB_NUM2INT(helpcontext));
-    if (hwnd == 0)
-        hwnd = pfnHtmlHelp(GetDesktopWindow(), StringValuePtr(helpfile),
-                 0,  RB_NUM2INT(helpcontext));
-    return hwnd;
-}
-
-/*
- *  call-seq:
- *     ole_show_help(obj [,helpcontext])
- *
- *  Displays helpfile. The 1st argument specifies WIN32OLE::Type
- *  object or WIN32OLE::Method object or helpfile.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     typeobj = excel.ole_type
- *     WIN32OLE.ole_show_help(typeobj)
- */
-static VALUE
-fole_s_show_help(int argc, VALUE *argv, VALUE self)
-{
-    VALUE target;
-    VALUE helpcontext;
-    VALUE helpfile;
-    VALUE name;
-    HWND  hwnd;
-    rb_scan_args(argc, argv, "11", &target, &helpcontext);
-    if (rb_obj_is_kind_of(target, cWIN32OLE_TYPE) ||
-        rb_obj_is_kind_of(target, cWIN32OLE_METHOD)) {
-        helpfile = rb_funcall(target, rb_intern("helpfile"), 0);
-        if(strlen(StringValuePtr(helpfile)) == 0) {
-            name = rb_ivar_get(target, rb_intern("name"));
-            rb_raise(rb_eRuntimeError, "no helpfile of `%s'",
-                     StringValuePtr(name));
-        }
-        helpcontext = rb_funcall(target, rb_intern("helpcontext"), 0);
-    } else {
-        helpfile = target;
-    }
-    if (!RB_TYPE_P(helpfile, T_STRING)) {
-        rb_raise(rb_eTypeError, "1st parameter must be (String|WIN32OLE::Type|WIN32OLE::Method)");
-    }
-    hwnd = ole_show_help(helpfile, helpcontext);
-    if(hwnd == 0) {
-        rb_raise(rb_eRuntimeError, "failed to open help file `%s'",
-                 StringValuePtr(helpfile));
-    }
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     codepage
- *
- *  Returns current codepage.
- *     WIN32OLE.codepage # => WIN32OLE::CP_ACP
- */
-static VALUE
-fole_s_get_code_page(VALUE self)
-{
-    return RB_INT2FIX(cWIN32OLE_cp);
-}
-
-static BOOL CALLBACK
-installed_code_page_proc(LPTSTR str) {
-    if (strtoul(str, NULL, 10) == g_cp_to_check) {
-        g_cp_installed = TRUE;
-        return FALSE;
-    }
-    return TRUE;
-}
-
-static BOOL
-code_page_installed(UINT cp)
-{
-    g_cp_installed = FALSE;
-    g_cp_to_check = cp;
-    EnumSystemCodePages(installed_code_page_proc, CP_INSTALLED);
-    return g_cp_installed;
-}
-
-/*
- *  call-seq:
- *     codepage = CP
- *
- *  Sets current codepage.
- *  The WIN32OLE.codepage is initialized according to
- *  Encoding.default_internal.
- *  If Encoding.default_internal is nil then WIN32OLE.codepage
- *  is initialized according to Encoding.default_external.
- *
- *     WIN32OLE.codepage = WIN32OLE::CP_UTF8
- *     WIN32OLE.codepage = 65001
- */
-static VALUE
-fole_s_set_code_page(VALUE self, VALUE vcp)
-{
-    UINT cp = RB_FIX2INT(vcp);
-    set_ole_codepage(cp);
-    /*
-     * Should this method return old codepage?
-     */
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     locale -> locale id.
- *
- *  Returns current locale id (lcid). The default locale is
- *  WIN32OLE::LOCALE_SYSTEM_DEFAULT.
- *
- *     lcid = WIN32OLE.locale
- */
-static VALUE
-fole_s_get_locale(VALUE self)
-{
-    return RB_INT2FIX(cWIN32OLE_lcid);
-}
-
-static BOOL
-CALLBACK installed_lcid_proc(LPTSTR str)
-{
-    if (strcmp(str, g_lcid_to_check) == 0) {
-        g_lcid_installed = TRUE;
-        return FALSE;
-    }
-    return TRUE;
-}
-
-static BOOL
-lcid_installed(LCID lcid)
-{
-    g_lcid_installed = FALSE;
-    snprintf(g_lcid_to_check, sizeof(g_lcid_to_check), "%08lx", (unsigned long)lcid);
-    EnumSystemLocales(installed_lcid_proc, LCID_INSTALLED);
-    return g_lcid_installed;
-}
-
-/*
- *  call-seq:
- *     locale = lcid
- *
- *  Sets current locale id (lcid).
- *
- *     WIN32OLE.locale = 1033 # set locale English(U.S)
- *     obj = WIN32OLE::Variant.new("$100,000", WIN32OLE::VARIANT::VT_CY)
- *
- */
-static VALUE
-fole_s_set_locale(VALUE self, VALUE vlcid)
-{
-    LCID lcid = RB_FIX2INT(vlcid);
-    if (lcid_installed(lcid)) {
-        cWIN32OLE_lcid = lcid;
-    } else {
-        switch (lcid) {
-        case LOCALE_SYSTEM_DEFAULT:
-        case LOCALE_USER_DEFAULT:
-            cWIN32OLE_lcid = lcid;
-            break;
-        default:
-            rb_raise(eWIN32OLERuntimeError, "not installed locale: %u", (unsigned int)lcid);
-        }
-    }
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     create_guid
- *
- *  Creates GUID.
- *     WIN32OLE.create_guid # => {1CB530F1-F6B1-404D-BCE6-1959BF91F4A8}
- */
-static VALUE
-fole_s_create_guid(VALUE self)
-{
-    GUID guid;
-    HRESULT hr;
-    OLECHAR bstr[80];
-    int len = 0;
-    hr = CoCreateGuid(&guid);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to create GUID");
-    }
-    len = StringFromGUID2(&guid, bstr, sizeof(bstr)/sizeof(OLECHAR));
-    if (len == 0) {
-        rb_raise(rb_eRuntimeError, "failed to create GUID(buffer over)");
-    }
-    return ole_wc2vstr(bstr, FALSE);
-}
-
-/*
- * WIN32OLE.ole_initialize and WIN32OLE.ole_uninitialize
- * are used in win32ole.rb to fix the issue bug #2618 (ruby-core:27634).
- * You must not use these method.
- */
-
-/* :nodoc: */
-static VALUE
-fole_s_ole_initialize(VALUE self)
-{
-    ole_initialize();
-    return Qnil;
-}
-
-/* :nodoc: */
-static VALUE
-fole_s_ole_uninitialize(VALUE self)
-{
-    ole_uninitialize();
-    return Qnil;
-}
-
-/*
- * Document-class: WIN32OLE
- *
- *   +WIN32OLE+ objects represent OLE Automation object in Ruby.
- *
- *   By using +WIN32OLE+, you can access OLE server like VBScript.
- *
- *   Here is sample script.
- *
- *     require 'win32ole'
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     excel.visible = true
- *     workbook = excel.Workbooks.Add();
- *     worksheet = workbook.Worksheets(1);
- *     worksheet.Range("A1:D1").value = ["North","South","East","West"];
- *     worksheet.Range("A2:B2").value = [5.2, 10];
- *     worksheet.Range("C2").value = 8;
- *     worksheet.Range("D2").value = 20;
- *
- *     range = worksheet.Range("A1:D2");
- *     range.select
- *     chart = workbook.Charts.Add;
- *
- *     workbook.saved = true;
- *
- *     excel.ActiveWorkbook.Close(0);
- *     excel.Quit();
- *
- *   Unfortunately, +WIN32OLE+ doesn't support the argument passed by
- *   reference directly.
- *   Instead, +WIN32OLE+ provides WIN32OLE::ARGV or WIN32OLE::Variant object.
- *   If you want to get the result value of argument passed by reference,
- *   you can use WIN32OLE::ARGV or WIN32OLE::Variant.
- *
- *     oleobj.method(arg1, arg2, refargv3)
- *     puts WIN32OLE::ARGV[2]   # the value of refargv3 after called oleobj.method
- *
- *   or
- *
- *     refargv3 = WIN32OLE::Variant.new(XXX,
- *                 WIN32OLE::VARIANT::VT_BYREF|WIN32OLE::VARIANT::VT_XXX)
- *     oleobj.method(arg1, arg2, refargv3)
- *     p refargv3.value # the value of refargv3 after called oleobj.method.
- *
- */
-
-/*
- *  call-seq:
- *     new(server, [host]) -> WIN32OLE object
- *     WIN32OLE.new(server, license: 'key') -> WIN32OLE object
- *
- *  Returns a new WIN32OLE object(OLE Automation object).
- *  The first argument server specifies OLE Automation server.
- *  The first argument should be CLSID or PROGID.
- *  If second argument host specified, then returns OLE Automation
- *  object on host.
- *  If :license keyword argument is provided,
- *  IClassFactory2::CreateInstanceLic is used to create instance of
- *  licensed server.
- *
- *      WIN32OLE.new('Excel.Application') # => Excel OLE Automation WIN32OLE object.
- *      WIN32OLE.new('{00024500-0000-0000-C000-000000000046}') # => Excel OLE Automation WIN32OLE object.
- */
-static VALUE
-fole_initialize(int argc, VALUE *argv, VALUE self)
-{
-    VALUE svr_name;
-    VALUE host;
-    VALUE others;
-    VALUE opts;
-    HRESULT hr;
-    CLSID   clsid;
-    OLECHAR *pBuf;
-    OLECHAR *key_buf;
-    IDispatch *pDispatch;
-    IClassFactory2 * pIClassFactory2;
-    void *p;
-    static ID keyword_ids[1];
-    VALUE kwargs[1];
-
-    rb_call_super(0, 0);
-    rb_scan_args(argc, argv, "11*:", &svr_name, &host, &others, &opts);
-
-    StringValue(svr_name);
-    if (!NIL_P(host)) {
-        StringValue(host);
-        return ole_create_dcom(self, svr_name, host, others);
-    }
-
-    /* get CLSID from OLE server name */
-    pBuf  = ole_vstr2wc(svr_name);
-    hr = CLSIDFromProgID(pBuf, &clsid);
-    if(FAILED(hr)) {
-        hr = CLSIDFromString(pBuf, &clsid);
-    }
-    SysFreeString(pBuf);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "unknown OLE server: `%s'",
-                  StringValuePtr(svr_name));
-    }
-
-    if (!keyword_ids[0]) {
-        keyword_ids[0] = rb_intern_const("license");
-    }
-    rb_get_kwargs(opts, keyword_ids, 0, 1, kwargs);
-
-    if (kwargs[0] == Qundef) {
-        /* get IDispatch interface */
-        hr = CoCreateInstance(
-            &clsid,
-            NULL,
-            CLSCTX_INPROC_SERVER | CLSCTX_LOCAL_SERVER,
-            &IID_IDispatch,
-            &p
-        );
-    } else {
-        hr = CoGetClassObject(
-            &clsid,
-            CLSCTX_INPROC_SERVER | CLSCTX_LOCAL_SERVER,
-            NULL,
-            &IID_IClassFactory2,
-            (LPVOID)&pIClassFactory2
-        );
-        if (hr == S_OK) {
-            key_buf = ole_vstr2wc(kwargs[0]);
-            hr = pIClassFactory2->lpVtbl->CreateInstanceLic(pIClassFactory2, NULL, NULL, &IID_IDispatch, key_buf, &p);
-            SysFreeString(key_buf);
-            OLE_RELEASE(pIClassFactory2);
-        }
-    }
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to create WIN32OLE object from `%s'",
-                  StringValuePtr(svr_name));
-    }
-    pDispatch = p;
-
-    ole_set_member(self, pDispatch);
-    return self;
-}
-
-static int
-hash2named_arg(VALUE key, VALUE val, VALUE pop)
-{
-    struct oleparam* pOp = (struct oleparam *)pop;
-    unsigned int index, i;
-    index = pOp->dp.cNamedArgs;
-    /*---------------------------------------------
-      the data-type of key must be String or Symbol
-    -----------------------------------------------*/
-    if(!RB_TYPE_P(key, T_STRING) && !RB_TYPE_P(key, T_SYMBOL)) {
-        /* clear name of dispatch parameters */
-        for(i = 1; i < index + 1; i++) {
-            SysFreeString(pOp->pNamedArgs[i]);
-        }
-        /* clear dispatch parameters */
-        for(i = 0; i < index; i++ ) {
-            VariantClear(&(pOp->dp.rgvarg[i]));
-        }
-        /* raise an exception */
-        rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-    }
-    if (RB_TYPE_P(key, T_SYMBOL)) {
-        key = rb_sym2str(key);
-    }
-
-    /* pNamedArgs[0] is <method name>, so "index + 1" */
-    pOp->pNamedArgs[index + 1] = ole_vstr2wc(key);
-
-    VariantInit(&(pOp->dp.rgvarg[index]));
-    ole_val2variant(val, &(pOp->dp.rgvarg[index]));
-
-    pOp->dp.cNamedArgs += 1;
-    return ST_CONTINUE;
-}
-
-static VALUE
-set_argv(VARIANTARG* realargs, unsigned int beg, unsigned int end)
-{
-    VALUE argv = rb_const_get(cWIN32OLE, rb_intern("ARGV"));
-
-    Check_Type(argv, T_ARRAY);
-    rb_ary_clear(argv);
-    while (end-- > beg) {
-        rb_ary_push(argv, ole_variant2val(&realargs[end]));
-        if (V_VT(&realargs[end]) != VT_RECORD) {
-            VariantClear(&realargs[end]);
-        }
-    }
-    return argv;
-}
-
-static VALUE
-ole_invoke(int argc, VALUE *argv, VALUE self, USHORT wFlags, BOOL is_bracket)
-{
-    LCID    lcid = cWIN32OLE_lcid;
-    struct oledata *pole = NULL;
-    HRESULT hr;
-    VALUE cmd;
-    VALUE paramS;
-    VALUE param;
-    VALUE obj;
-    VALUE v;
-
-    BSTR wcmdname;
-
-    DISPID DispID;
-    DISPID* pDispID;
-    EXCEPINFO excepinfo;
-    VARIANT result;
-    VARIANTARG* realargs = NULL;
-    unsigned int argErr = 0;
-    unsigned int i;
-    unsigned int cNamedArgs;
-    int n;
-    struct oleparam op;
-    memset(&excepinfo, 0, sizeof(EXCEPINFO));
-
-    VariantInit(&result);
-
-    op.dp.rgvarg = NULL;
-    op.dp.rgdispidNamedArgs = NULL;
-    op.dp.cNamedArgs = 0;
-    op.dp.cArgs = 0;
-
-    rb_scan_args(argc, argv, "1*", &cmd, &paramS);
-    if(!RB_TYPE_P(cmd, T_STRING) && !RB_TYPE_P(cmd, T_SYMBOL) && !is_bracket) {
-        rb_raise(rb_eTypeError, "method is wrong type (expected String or Symbol)");
-    }
-    if (RB_TYPE_P(cmd, T_SYMBOL)) {
-        cmd = rb_sym2str(cmd);
-    }
-    pole = oledata_get_struct(self);
-    if(!pole->pDispatch) {
-        rb_raise(rb_eRuntimeError, "failed to get dispatch interface");
-    }
-    if (is_bracket) {
-        DispID = DISPID_VALUE;
-        argc += 1;
-        rb_ary_unshift(paramS, cmd);
-    } else {
-        wcmdname = ole_vstr2wc(cmd);
-        hr = pole->pDispatch->lpVtbl->GetIDsOfNames( pole->pDispatch, &IID_NULL,
-                &wcmdname, 1, lcid, &DispID);
-        SysFreeString(wcmdname);
-        if(FAILED(hr)) {
-            return rb_eNoMethodError;
-        }
-    }
-
-    /* pick up last argument of method */
-    param = rb_ary_entry(paramS, argc-2);
-
-    op.dp.cNamedArgs = 0;
-
-    /* if last arg is hash object */
-    if(RB_TYPE_P(param, T_HASH)) {
-        /*------------------------------------------
-          hash object ==> named dispatch parameters
-        --------------------------------------------*/
-        cNamedArgs = rb_long2int((long)RHASH_SIZE(param));
-        op.dp.cArgs = cNamedArgs + argc - 2;
-        op.pNamedArgs = ALLOCA_N(OLECHAR*, cNamedArgs + 1);
-        op.dp.rgvarg = ALLOCA_N(VARIANTARG, op.dp.cArgs);
-
-        rb_hash_foreach(param, hash2named_arg, (VALUE)&op);
-
-        pDispID = ALLOCA_N(DISPID, cNamedArgs + 1);
-        op.pNamedArgs[0] = ole_vstr2wc(cmd);
-        hr = pole->pDispatch->lpVtbl->GetIDsOfNames(pole->pDispatch,
-                                                    &IID_NULL,
-                                                    op.pNamedArgs,
-                                                    op.dp.cNamedArgs + 1,
-                                                    lcid, pDispID);
-        for(i = 0; i < op.dp.cNamedArgs + 1; i++) {
-            SysFreeString(op.pNamedArgs[i]);
-            op.pNamedArgs[i] = NULL;
-        }
-        if(FAILED(hr)) {
-            /* clear dispatch parameters */
-            for(i = 0; i < op.dp.cArgs; i++ ) {
-                VariantClear(&op.dp.rgvarg[i]);
-            }
-            ole_raise(hr, eWIN32OLERuntimeError,
-                      "failed to get named argument info: `%s'",
-                      StringValuePtr(cmd));
-        }
-        op.dp.rgdispidNamedArgs = &(pDispID[1]);
-    }
-    else {
-        cNamedArgs = 0;
-        op.dp.cArgs = argc - 1;
-        op.pNamedArgs = ALLOCA_N(OLECHAR*, cNamedArgs + 1);
-        if (op.dp.cArgs > 0) {
-            op.dp.rgvarg  = ALLOCA_N(VARIANTARG, op.dp.cArgs);
-        }
-    }
-    /*--------------------------------------
-      non hash args ==> dispatch parameters
-     ----------------------------------------*/
-    if(op.dp.cArgs > cNamedArgs) {
-        realargs = ALLOCA_N(VARIANTARG, op.dp.cArgs-cNamedArgs+1);
-        for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-            n = op.dp.cArgs - i + cNamedArgs - 1;
-            VariantInit(&realargs[n]);
-            VariantInit(&op.dp.rgvarg[n]);
-            param = rb_ary_entry(paramS, i-cNamedArgs);
-            if (rb_obj_is_kind_of(param, cWIN32OLE_VARIANT)) {
-                ole_variant2variant(param, &op.dp.rgvarg[n]);
-            } else if (rb_obj_is_kind_of(param, cWIN32OLE_RECORD)) {
-                ole_val2variant(param, &realargs[n]);
-                op.dp.rgvarg[n] = realargs[n];
-                V_VT(&op.dp.rgvarg[n]) = VT_RECORD | VT_BYREF;
-            } else {
-                ole_val2variant(param, &realargs[n]);
-                V_VT(&op.dp.rgvarg[n]) = VT_VARIANT | VT_BYREF;
-                V_VARIANTREF(&op.dp.rgvarg[n]) = &realargs[n];
-            }
-        }
-    }
-    /* apparent you need to call propput, you need this */
-    if (wFlags & DISPATCH_PROPERTYPUT) {
-        if (op.dp.cArgs == 0)
-            ole_raise(ResultFromScode(E_INVALIDARG), eWIN32OLERuntimeError, "argument error");
-
-        op.dp.cNamedArgs = 1;
-        op.dp.rgdispidNamedArgs = ALLOCA_N( DISPID, 1 );
-        op.dp.rgdispidNamedArgs[0] = DISPID_PROPERTYPUT;
-    }
-    hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, DispID,
-                                         &IID_NULL, lcid, wFlags, &op.dp,
-                                         &result, &excepinfo, &argErr);
-
-    if (FAILED(hr)) {
-        /* retry to call args by value */
-        if(op.dp.cArgs >= cNamedArgs) {
-            for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-                n = op.dp.cArgs - i + cNamedArgs - 1;
-                param = rb_ary_entry(paramS, i-cNamedArgs);
-                ole_val2variant(param, &op.dp.rgvarg[n]);
-            }
-            if (hr == DISP_E_EXCEPTION) {
-                ole_freeexceptinfo(&excepinfo);
-            }
-            memset(&excepinfo, 0, sizeof(EXCEPINFO));
-            VariantInit(&result);
-            hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, DispID,
-                                                 &IID_NULL, lcid, wFlags,
-                                                 &op.dp, &result,
-                                                 &excepinfo, &argErr);
-
-            /* mega kludge. if a method in WORD is called and we ask
-             * for a result when one is not returned then
-             * hResult == DISP_E_EXCEPTION. this only happens on
-             * functions whose DISPID > 0x8000 */
-            if ((hr == DISP_E_EXCEPTION || hr == DISP_E_MEMBERNOTFOUND) && DispID > 0x8000) {
-                if (hr == DISP_E_EXCEPTION) {
-                    ole_freeexceptinfo(&excepinfo);
-                }
-                memset(&excepinfo, 0, sizeof(EXCEPINFO));
-                hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, DispID,
-                        &IID_NULL, lcid, wFlags,
-                        &op.dp, NULL,
-                        &excepinfo, &argErr);
-
-            }
-            for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-                n = op.dp.cArgs - i + cNamedArgs - 1;
-                if (V_VT(&op.dp.rgvarg[n]) != VT_RECORD) {
-                    VariantClear(&op.dp.rgvarg[n]);
-                }
-            }
-        }
-
-        if (FAILED(hr)) {
-            /* retry after converting nil to VT_EMPTY */
-            if (op.dp.cArgs > cNamedArgs) {
-                for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-                    n = op.dp.cArgs - i + cNamedArgs - 1;
-                    param = rb_ary_entry(paramS, i-cNamedArgs);
-                    ole_val2variant2(param, &op.dp.rgvarg[n]);
-                }
-                if (hr == DISP_E_EXCEPTION) {
-                    ole_freeexceptinfo(&excepinfo);
-                }
-                memset(&excepinfo, 0, sizeof(EXCEPINFO));
-                VariantInit(&result);
-                hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, DispID,
-                        &IID_NULL, lcid, wFlags,
-                        &op.dp, &result,
-                        &excepinfo, &argErr);
-                for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-                    n = op.dp.cArgs - i + cNamedArgs - 1;
-                    if (V_VT(&op.dp.rgvarg[n]) != VT_RECORD) {
-                        VariantClear(&op.dp.rgvarg[n]);
-                    }
-                }
-            }
-        }
-
-    }
-    /* clear dispatch parameter */
-    if(op.dp.cArgs > cNamedArgs) {
-        for(i = cNamedArgs; i < op.dp.cArgs; i++) {
-            n = op.dp.cArgs - i + cNamedArgs - 1;
-            param = rb_ary_entry(paramS, i-cNamedArgs);
-            if (rb_obj_is_kind_of(param, cWIN32OLE_VARIANT)) {
-                ole_val2variant(param, &realargs[n]);
-            } else if ( rb_obj_is_kind_of(param, cWIN32OLE_RECORD) &&
-                        V_VT(&realargs[n]) == VT_RECORD ) {
-                olerecord_set_ivar(param, V_RECORDINFO(&realargs[n]), V_RECORD(&realargs[n]));
-            }
-        }
-        set_argv(realargs, cNamedArgs, op.dp.cArgs);
-    }
-    else {
-        for(i = 0; i < op.dp.cArgs; i++) {
-            VariantClear(&op.dp.rgvarg[i]);
-        }
-    }
-
-    if (FAILED(hr)) {
-        v = ole_excepinfo2msg(&excepinfo);
-        ole_raise(hr, eWIN32OLERuntimeError, "(in OLE method `%s': )%s",
-                  StringValuePtr(cmd),
-                  StringValuePtr(v));
-    }
-    obj = ole_variant2val(&result);
-    VariantClear(&result);
-    return obj;
-}
-
-/*
- *  call-seq:
- *     invoke(method, [arg1,...])  => return value of method.
- *
- *  Runs OLE method.
- *  The first argument specifies the method name of OLE Automation object.
- *  The others specify argument of the <i>method</i>.
- *  If you can not execute <i>method</i> directly, then use this method instead.
- *
- *    excel = WIN32OLE.new('Excel.Application')
- *    excel.invoke('Quit')  # => same as excel.Quit
- *
- */
-static VALUE
-fole_invoke(int argc, VALUE *argv, VALUE self)
-{
-    VALUE v = ole_invoke(argc, argv, self, DISPATCH_METHOD|DISPATCH_PROPERTYGET, FALSE);
-    if (v == rb_eNoMethodError) {
-        return rb_call_super(argc, argv);
-    }
-    return v;
-}
-
-static VALUE
-ole_invoke2(VALUE self, VALUE dispid, VALUE args, VALUE types, USHORT dispkind)
-{
-    HRESULT hr;
-    struct oledata *pole = NULL;
-    unsigned int argErr = 0;
-    EXCEPINFO excepinfo;
-    VARIANT result;
-    DISPPARAMS dispParams;
-    VARIANTARG* realargs = NULL;
-    int i, j; VALUE obj = Qnil;
-    VALUE tp, param;
-    VALUE v;
-    VARTYPE vt;
-
-    Check_Type(args, T_ARRAY);
-    Check_Type(types, T_ARRAY);
-
-    memset(&excepinfo, 0, sizeof(EXCEPINFO));
-    memset(&dispParams, 0, sizeof(DISPPARAMS));
-    VariantInit(&result);
-    pole = oledata_get_struct(self);
-
-    dispParams.cArgs = RARRAY_LEN(args);
-    dispParams.rgvarg = ALLOCA_N(VARIANTARG, dispParams.cArgs);
-    realargs = ALLOCA_N(VARIANTARG, dispParams.cArgs);
-    for (i = 0, j = dispParams.cArgs - 1; i < (int)dispParams.cArgs; i++, j--)
-    {
-        VariantInit(&realargs[i]);
-        VariantInit(&dispParams.rgvarg[i]);
-        tp = rb_ary_entry(types, j);
-        vt = (VARTYPE)RB_FIX2INT(tp);
-        V_VT(&dispParams.rgvarg[i]) = vt;
-        param = rb_ary_entry(args, j);
-        if (param == Qnil)
-        {
-
-            V_VT(&dispParams.rgvarg[i]) = V_VT(&realargs[i]) = VT_ERROR;
-            V_ERROR(&dispParams.rgvarg[i]) = V_ERROR(&realargs[i]) = DISP_E_PARAMNOTFOUND;
-        }
-        else
-        {
-            if (vt & VT_ARRAY)
-            {
-                int ent;
-                LPBYTE pb;
-                short* ps;
-                LPLONG pl;
-                VARIANT* pv;
-                CY *py;
-                VARTYPE v;
-                SAFEARRAYBOUND rgsabound[1];
-                Check_Type(param, T_ARRAY);
-                rgsabound[0].lLbound = 0;
-                rgsabound[0].cElements = RARRAY_LEN(param);
-                v = vt & ~(VT_ARRAY | VT_BYREF);
-                V_ARRAY(&realargs[i]) = SafeArrayCreate(v, 1, rgsabound);
-                V_VT(&realargs[i]) = VT_ARRAY | v;
-                SafeArrayLock(V_ARRAY(&realargs[i]));
-                pb = V_ARRAY(&realargs[i])->pvData;
-                ps = V_ARRAY(&realargs[i])->pvData;
-                pl = V_ARRAY(&realargs[i])->pvData;
-                py = V_ARRAY(&realargs[i])->pvData;
-                pv = V_ARRAY(&realargs[i])->pvData;
-                for (ent = 0; ent < (int)rgsabound[0].cElements; ent++)
-                {
-                    VARIANT velem;
-                    VALUE elem = rb_ary_entry(param, ent);
-                    ole_val2variant(elem, &velem);
-                    if (v != VT_VARIANT)
-                    {
-                        VariantChangeTypeEx(&velem, &velem,
-                            cWIN32OLE_lcid, 0, v);
-                    }
-                    switch (v)
-                    {
-                    /* 128 bits */
-                    case VT_VARIANT:
-                        *pv++ = velem;
-                        break;
-                    /* 64 bits */
-                    case VT_R8:
-                    case VT_CY:
-                    case VT_DATE:
-                        *py++ = V_CY(&velem);
-                        break;
-                    /* 16 bits */
-                    case VT_BOOL:
-                    case VT_I2:
-                    case VT_UI2:
-                        *ps++ = V_I2(&velem);
-                        break;
-                    /* 8 bites */
-                    case VT_UI1:
-                    case VT_I1:
-                        *pb++ = V_UI1(&velem);
-                        break;
-                    /* 32 bits */
-                    default:
-                        *pl++ = V_I4(&velem);
-                        break;
-                    }
-                }
-                SafeArrayUnlock(V_ARRAY(&realargs[i]));
-            }
-            else
-            {
-                ole_val2variant(param, &realargs[i]);
-                if ((vt & (~VT_BYREF)) != VT_VARIANT)
-                {
-                    hr = VariantChangeTypeEx(&realargs[i], &realargs[i],
-                                             cWIN32OLE_lcid, 0,
-                                             (VARTYPE)(vt & (~VT_BYREF)));
-                    if (hr != S_OK)
-                    {
-                        rb_raise(rb_eTypeError, "not valid value");
-                    }
-                }
-            }
-            if ((vt & VT_BYREF) || vt == VT_VARIANT)
-            {
-                if (vt == VT_VARIANT)
-                    V_VT(&dispParams.rgvarg[i]) = VT_VARIANT | VT_BYREF;
-                switch (vt & (~VT_BYREF))
-                {
-                /* 128 bits */
-                case VT_VARIANT:
-                    V_VARIANTREF(&dispParams.rgvarg[i]) = &realargs[i];
-                    break;
-                /* 64 bits */
-                case VT_R8:
-                case VT_CY:
-                case VT_DATE:
-                    V_CYREF(&dispParams.rgvarg[i]) = &V_CY(&realargs[i]);
-                    break;
-                /* 16 bits */
-                case VT_BOOL:
-                case VT_I2:
-                case VT_UI2:
-                    V_I2REF(&dispParams.rgvarg[i]) = &V_I2(&realargs[i]);
-                    break;
-                /* 8 bites */
-                case VT_UI1:
-                case VT_I1:
-                    V_UI1REF(&dispParams.rgvarg[i]) = &V_UI1(&realargs[i]);
-                    break;
-                /* 32 bits */
-                default:
-                    V_I4REF(&dispParams.rgvarg[i]) = &V_I4(&realargs[i]);
-                    break;
-                }
-            }
-            else
-            {
-                /* copy 64 bits of data */
-                V_CY(&dispParams.rgvarg[i]) = V_CY(&realargs[i]);
-            }
-        }
-    }
-
-    if (dispkind & DISPATCH_PROPERTYPUT) {
-        dispParams.cNamedArgs = 1;
-        dispParams.rgdispidNamedArgs = ALLOCA_N( DISPID, 1 );
-        dispParams.rgdispidNamedArgs[0] = DISPID_PROPERTYPUT;
-    }
-
-    hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, RB_NUM2INT(dispid),
-                                         &IID_NULL, cWIN32OLE_lcid,
-                                         dispkind,
-                                         &dispParams, &result,
-                                         &excepinfo, &argErr);
-
-    if (FAILED(hr)) {
-        v = ole_excepinfo2msg(&excepinfo);
-        ole_raise(hr, eWIN32OLERuntimeError, "(in OLE method `<dispatch id:%d>': )%s",
-                  RB_NUM2INT(dispid),
-                  StringValuePtr(v));
-    }
-
-    /* clear dispatch parameter */
-    if(dispParams.cArgs > 0) {
-        set_argv(realargs, 0, dispParams.cArgs);
-    }
-
-    obj = ole_variant2val(&result);
-    VariantClear(&result);
-    return obj;
-}
-
-/*
- *   call-seq:
- *      _invoke(dispid, args, types)
- *
- *   Runs the early binding method.
- *   The 1st argument specifies dispatch ID,
- *   the 2nd argument specifies the array of arguments,
- *   the 3rd argument specifies the array of the type of arguments.
- *
- *      excel = WIN32OLE.new('Excel.Application')
- *      excel._invoke(302, [], []) #  same effect as excel.Quit
- */
-static VALUE
-fole_invoke2(VALUE self, VALUE dispid, VALUE args, VALUE types)
-{
-    return ole_invoke2(self, dispid, args, types, DISPATCH_METHOD);
-}
-
-/*
- *  call-seq:
- *     _getproperty(dispid, args, types)
- *
- *  Runs the early binding method to get property.
- *  The 1st argument specifies dispatch ID,
- *  the 2nd argument specifies the array of arguments,
- *  the 3rd argument specifies the array of the type of arguments.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     puts excel._getproperty(558, [], []) # same effect as puts excel.visible
- */
-static VALUE
-fole_getproperty2(VALUE self, VALUE dispid, VALUE args, VALUE types)
-{
-    return ole_invoke2(self, dispid, args, types, DISPATCH_PROPERTYGET);
-}
-
-/*
- *   call-seq:
- *      _setproperty(dispid, args, types)
- *
- *   Runs the early binding method to set property.
- *   The 1st argument specifies dispatch ID,
- *   the 2nd argument specifies the array of arguments,
- *   the 3rd argument specifies the array of the type of arguments.
- *
- *      excel = WIN32OLE.new('Excel.Application')
- *      excel._setproperty(558, [true], [WIN32OLE::VARIANT::VT_BOOL]) # same effect as excel.visible = true
- */
-static VALUE
-fole_setproperty2(VALUE self, VALUE dispid, VALUE args, VALUE types)
-{
-    return ole_invoke2(self, dispid, args, types, DISPATCH_PROPERTYPUT);
-}
-
-/*
- *  call-seq:
- *     WIN32OLE[a1, a2, ...]=val
- *
- *  Sets the value to WIN32OLE object specified by a1, a2, ...
- *
- *     dict = WIN32OLE.new('Scripting.Dictionary')
- *     dict.add('ruby', 'RUBY')
- *     dict['ruby'] = 'Ruby'
- *     puts dict['ruby'] # => 'Ruby'
- *
- *  Remark: You can not use this method to set the property value.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     # excel['Visible'] = true # This is error !!!
- *     excel.Visible = true # You should to use this style to set the property.
- *
- */
-static VALUE
-fole_setproperty_with_bracket(int argc, VALUE *argv, VALUE self)
-{
-    VALUE v = ole_invoke(argc, argv, self, DISPATCH_PROPERTYPUT, TRUE);
-    if (v == rb_eNoMethodError) {
-        return rb_call_super(argc, argv);
-    }
-    return v;
-}
-
-/*
- *  call-seq:
- *     setproperty('property', [arg1, arg2,...] val)
- *
- *  Sets property of OLE object.
- *  When you want to set property with argument, you can use this method.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     excel.Visible = true
- *     book = excel.workbooks.add
- *     sheet = book.worksheets(1)
- *     sheet.setproperty('Cells', 1, 2, 10) # => The B1 cell value is 10.
- */
-static VALUE
-fole_setproperty(int argc, VALUE *argv, VALUE self)
-{
-    VALUE v = ole_invoke(argc, argv, self, DISPATCH_PROPERTYPUT, FALSE);
-    if (v == rb_eNoMethodError) {
-        return rb_call_super(argc, argv);
-    }
-    return v;
-}
-
-/*
- *  call-seq:
- *     WIN32OLE[a1,a2,...]
- *
- *  Returns the value of Collection specified by a1, a2,....
- *
- *     dict = WIN32OLE.new('Scripting.Dictionary')
- *     dict.add('ruby', 'Ruby')
- *     puts dict['ruby'] # => 'Ruby' (same as `puts dict.item('ruby')')
- *
- *  Remark: You can not use this method to get the property.
- *     excel = WIN32OLE.new('Excel.Application')
- *     # puts excel['Visible']  This is error !!!
- *     puts excel.Visible # You should to use this style to get the property.
- *
- */
-static VALUE
-fole_getproperty_with_bracket(int argc, VALUE *argv, VALUE self)
-{
-    VALUE v = ole_invoke(argc, argv, self, DISPATCH_PROPERTYGET, TRUE);
-    if (v == rb_eNoMethodError) {
-        return rb_call_super(argc, argv);
-    }
-    return v;
-}
-
-static VALUE
-ole_propertyput(VALUE self, VALUE property, VALUE value)
-{
-    struct oledata *pole = NULL;
-    unsigned argErr;
-    unsigned int index;
-    HRESULT hr;
-    EXCEPINFO excepinfo;
-    DISPID dispID = DISPID_VALUE;
-    DISPID dispIDParam = DISPID_PROPERTYPUT;
-    USHORT wFlags = DISPATCH_PROPERTYPUT|DISPATCH_PROPERTYPUTREF;
-    DISPPARAMS dispParams;
-    VARIANTARG propertyValue[2];
-    OLECHAR* pBuf[1];
-    VALUE v;
-    LCID    lcid = cWIN32OLE_lcid;
-    dispParams.rgdispidNamedArgs = &dispIDParam;
-    dispParams.rgvarg = propertyValue;
-    dispParams.cNamedArgs = 1;
-    dispParams.cArgs = 1;
-
-    VariantInit(&propertyValue[0]);
-    VariantInit(&propertyValue[1]);
-    memset(&excepinfo, 0, sizeof(excepinfo));
-
-    pole = oledata_get_struct(self);
-
-    /* get ID from property name */
-    pBuf[0]  = ole_vstr2wc(property);
-    hr = pole->pDispatch->lpVtbl->GetIDsOfNames(pole->pDispatch, &IID_NULL,
-                                                pBuf, 1, lcid, &dispID);
-    SysFreeString(pBuf[0]);
-    pBuf[0] = NULL;
-
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "unknown property or method: `%s'",
-                  StringValuePtr(property));
-    }
-    /* set property value */
-    ole_val2variant(value, &propertyValue[0]);
-    hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, dispID, &IID_NULL,
-                                         lcid, wFlags, &dispParams,
-                                         NULL, &excepinfo, &argErr);
-
-    for(index = 0; index < dispParams.cArgs; ++index) {
-        VariantClear(&propertyValue[index]);
-    }
-    if (FAILED(hr)) {
-        v = ole_excepinfo2msg(&excepinfo);
-        ole_raise(hr, eWIN32OLERuntimeError, "(in setting property `%s': )%s",
-                  StringValuePtr(property),
-                  StringValuePtr(v));
-    }
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     ole_free
- *
- *  invokes Release method of Dispatch interface of WIN32OLE object.
- *  Usually, you do not need to call this method because Release method
- *  called automatically when WIN32OLE object garbaged.
- *
- */
-static VALUE
-fole_free(VALUE self)
-{
-    struct oledata *pole = NULL;
-    pole = oledata_get_struct(self);
-    OLE_FREE(pole->pDispatch);
-    pole->pDispatch = NULL;
-    return Qnil;
-}
-
-static VALUE
-ole_each_sub(VALUE pEnumV)
-{
-    VARIANT variant;
-    VALUE obj = Qnil;
-    IEnumVARIANT *pEnum = (IEnumVARIANT *)pEnumV;
-    VariantInit(&variant);
-    while(pEnum->lpVtbl->Next(pEnum, 1, &variant, NULL) == S_OK) {
-        obj = ole_variant2val(&variant);
-        VariantClear(&variant);
-        VariantInit(&variant);
-        rb_yield(obj);
-    }
-    return Qnil;
-}
-
-static VALUE
-ole_ienum_free(VALUE pEnumV)
-{
-    IEnumVARIANT *pEnum = (IEnumVARIANT *)pEnumV;
-    OLE_RELEASE(pEnum);
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     each {|i|...}
- *
- *  Iterates over each item of OLE collection which has IEnumVARIANT interface.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     book = excel.workbooks.add
- *     sheets = book.worksheets(1)
- *     cells = sheets.cells("A1:A5")
- *     cells.each do |cell|
- *       cell.value = 10
- *     end
- */
-static VALUE
-fole_each(VALUE self)
-{
-    LCID    lcid = cWIN32OLE_lcid;
-
-    struct oledata *pole = NULL;
-
-    unsigned int argErr;
-    EXCEPINFO excepinfo;
-    DISPPARAMS dispParams;
-    VARIANT result;
-    HRESULT hr;
-    IEnumVARIANT *pEnum = NULL;
-    void *p;
-
-    RETURN_ENUMERATOR(self, 0, 0);
-
-    VariantInit(&result);
-    dispParams.rgvarg = NULL;
-    dispParams.rgdispidNamedArgs = NULL;
-    dispParams.cNamedArgs = 0;
-    dispParams.cArgs = 0;
-    memset(&excepinfo, 0, sizeof(excepinfo));
-
-    pole = oledata_get_struct(self);
-    hr = pole->pDispatch->lpVtbl->Invoke(pole->pDispatch, DISPID_NEWENUM,
-                                         &IID_NULL, lcid,
-                                         DISPATCH_METHOD | DISPATCH_PROPERTYGET,
-                                         &dispParams, &result,
-                                         &excepinfo, &argErr);
-
-    if (FAILED(hr)) {
-        VariantClear(&result);
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to get IEnum Interface");
-    }
-
-    if (V_VT(&result) == VT_UNKNOWN) {
-        hr = V_UNKNOWN(&result)->lpVtbl->QueryInterface(V_UNKNOWN(&result),
-                                                        &IID_IEnumVARIANT,
-                                                        &p);
-        pEnum = p;
-    } else if (V_VT(&result) == VT_DISPATCH) {
-        hr = V_DISPATCH(&result)->lpVtbl->QueryInterface(V_DISPATCH(&result),
-                                                         &IID_IEnumVARIANT,
-                                                         &p);
-        pEnum = p;
-    }
-    if (FAILED(hr) || !pEnum) {
-        VariantClear(&result);
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to get IEnum Interface");
-    }
-
-    VariantClear(&result);
-    rb_ensure(ole_each_sub, (VALUE)pEnum, ole_ienum_free, (VALUE)pEnum);
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     method_missing(id [,arg1, arg2, ...])
- *
- *  Calls WIN32OLE#invoke method.
- */
-static VALUE
-fole_missing(int argc, VALUE *argv, VALUE self)
-{
-    VALUE mid, org_mid, sym, v;
-    const char* mname;
-    long n;
-    rb_check_arity(argc, 1, UNLIMITED_ARGUMENTS);
-    mid = org_mid = argv[0];
-    sym = rb_check_symbol(&mid);
-    if (!NIL_P(sym)) mid = rb_sym2str(sym);
-    mname = StringValueCStr(mid);
-    if(!mname) {
-        rb_raise(rb_eRuntimeError, "fail: unknown method or property");
-    }
-    n = RSTRING_LEN(mid);
-    if(mname[n-1] == '=') {
-        rb_check_arity(argc, 2, 2);
-        argv[0] = rb_enc_associate(rb_str_subseq(mid, 0, n-1), cWIN32OLE_enc);
-
-        return ole_propertyput(self, argv[0], argv[1]);
-    }
-    else {
-        argv[0] = rb_enc_associate(rb_str_dup(mid), cWIN32OLE_enc);
-        v = ole_invoke(argc, argv, self, DISPATCH_METHOD|DISPATCH_PROPERTYGET, FALSE);
-        if (v == rb_eNoMethodError) {
-            argv[0] = org_mid;
-            return rb_call_super(argc, argv);
-        }
-        return v;
-    }
-}
-
-static HRESULT
-typeinfo_from_ole(struct oledata *pole, ITypeInfo **ppti)
-{
-    ITypeInfo *pTypeInfo;
-    ITypeLib *pTypeLib;
-    BSTR bstr;
-    VALUE type;
-    UINT i;
-    UINT count;
-    LCID    lcid = cWIN32OLE_lcid;
-    HRESULT hr = pole->pDispatch->lpVtbl->GetTypeInfo(pole->pDispatch,
-                                                      0, lcid, &pTypeInfo);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeInfo");
-    }
-    hr = pTypeInfo->lpVtbl->GetDocumentation(pTypeInfo,
-                                             -1,
-                                             &bstr,
-                                             NULL, NULL, NULL);
-    type = WC2VSTR(bstr);
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, &pTypeLib, &i);
-    OLE_RELEASE(pTypeInfo);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetContainingTypeLib");
-    }
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (i = 0; i < count; i++) {
-        hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, i,
-                                                &bstr, NULL, NULL, NULL);
-        if (SUCCEEDED(hr) && rb_str_cmp(WC2VSTR(bstr), type) == 0) {
-            hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, i, &pTypeInfo);
-            if (SUCCEEDED(hr)) {
-                *ppti = pTypeInfo;
-                break;
-            }
-        }
-    }
-    OLE_RELEASE(pTypeLib);
-    return hr;
-}
-
-static VALUE
-ole_methods(VALUE self, int mask)
-{
-    ITypeInfo *pTypeInfo;
-    HRESULT hr;
-    VALUE methods;
-    struct oledata *pole = NULL;
-
-    pole = oledata_get_struct(self);
-    methods = rb_ary_new();
-
-    hr = typeinfo_from_ole(pole, &pTypeInfo);
-    if(FAILED(hr))
-        return methods;
-    rb_ary_concat(methods, ole_methods_from_typeinfo(pTypeInfo, mask));
-    OLE_RELEASE(pTypeInfo);
-    return methods;
-}
-
-/*
- *  call-seq:
- *     ole_methods
- *
- *  Returns the array of WIN32OLE::Method object.
- *  The element is OLE method of WIN32OLE object.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     methods = excel.ole_methods
- *
- */
-static VALUE
-fole_methods(VALUE self)
-{
-    return ole_methods( self, INVOKE_FUNC | INVOKE_PROPERTYGET | INVOKE_PROPERTYPUT | INVOKE_PROPERTYPUTREF);
-}
-
-/*
- *  call-seq:
- *     ole_get_methods
- *
- *  Returns the array of WIN32OLE::Method object .
- *  The element of the array is property (gettable) of WIN32OLE object.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     properties = excel.ole_get_methods
- */
-static VALUE
-fole_get_methods(VALUE self)
-{
-    return ole_methods( self, INVOKE_PROPERTYGET);
-}
-
-/*
- *  call-seq:
- *     ole_put_methods
- *
- *  Returns the array of WIN32OLE::Method object .
- *  The element of the array is property (settable) of WIN32OLE object.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     properties = excel.ole_put_methods
- */
-static VALUE
-fole_put_methods(VALUE self)
-{
-    return ole_methods( self, INVOKE_PROPERTYPUT|INVOKE_PROPERTYPUTREF);
-}
-
-/*
- *  call-seq:
- *     ole_func_methods
- *
- *  Returns the array of WIN32OLE::Method object .
- *  The element of the array is property (settable) of WIN32OLE object.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     properties = excel.ole_func_methods
- *
- */
-static VALUE
-fole_func_methods(VALUE self)
-{
-    return ole_methods( self, INVOKE_FUNC);
-}
-
-/*
- *   call-seq:
- *      ole_type
- *
- *   Returns WIN32OLE::Type object.
- *
- *      excel = WIN32OLE.new('Excel.Application')
- *      tobj = excel.ole_type
- */
-static VALUE
-fole_type(VALUE self)
-{
-    ITypeInfo *pTypeInfo;
-    HRESULT hr;
-    struct oledata *pole = NULL;
-    LCID  lcid = cWIN32OLE_lcid;
-    VALUE type = Qnil;
-
-    pole = oledata_get_struct(self);
-
-    hr = pole->pDispatch->lpVtbl->GetTypeInfo( pole->pDispatch, 0, lcid, &pTypeInfo );
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeInfo");
-    }
-    type = ole_type_from_itypeinfo(pTypeInfo);
-    OLE_RELEASE(pTypeInfo);
-    if (type == Qnil) {
-        rb_raise(rb_eRuntimeError, "failed to create WIN32OLE::Type obj from ITypeInfo");
-    }
-    return type;
-}
-
-/*
- *  call-seq:
- *     ole_typelib -> The WIN32OLE_TYPELIB object
- *
- *  Returns the WIN32OLE::TypeLib object. The object represents the
- *  type library which contains the WIN32OLE object.
- *
- *     excel = WIN32OLE.new('Excel.Application')
- *     tlib = excel.ole_typelib
- *     puts tlib.name  # -> 'Microsoft Excel 9.0 Object Library'
- */
-static VALUE
-fole_typelib(VALUE self)
-{
-    struct oledata *pole = NULL;
-    HRESULT hr;
-    ITypeInfo *pTypeInfo;
-    LCID  lcid = cWIN32OLE_lcid;
-    VALUE vtlib = Qnil;
-
-    pole = oledata_get_struct(self);
-    hr = pole->pDispatch->lpVtbl->GetTypeInfo(pole->pDispatch,
-                                              0, lcid, &pTypeInfo);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeInfo");
-    }
-    vtlib = ole_typelib_from_itypeinfo(pTypeInfo);
-    OLE_RELEASE(pTypeInfo);
-    if (vtlib == Qnil) {
-        rb_raise(rb_eRuntimeError, "failed to get type library info.");
-    }
-    return vtlib;
-}
-
-/*
- *  call-seq:
- *     ole_query_interface(iid) -> WIN32OLE object
- *
- *  Returns WIN32OLE object for a specific dispatch or dual
- *  interface specified by iid.
- *
- *      ie = WIN32OLE.new('InternetExplorer.Application')
- *      ie_web_app = ie.ole_query_interface('{0002DF05-0000-0000-C000-000000000046}') # => WIN32OLE object for dispinterface IWebBrowserApp
- */
-static VALUE
-fole_query_interface(VALUE self, VALUE str_iid)
-{
-    HRESULT hr;
-    OLECHAR *pBuf;
-    IID iid;
-    struct oledata *pole = NULL;
-    IDispatch *pDispatch;
-    void *p;
-
-    pBuf  = ole_vstr2wc(str_iid);
-    hr = CLSIDFromString(pBuf, &iid);
-    SysFreeString(pBuf);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "invalid iid: `%s'",
-                  StringValuePtr(str_iid));
-    }
-
-    pole = oledata_get_struct(self);
-    if(!pole->pDispatch) {
-        rb_raise(rb_eRuntimeError, "failed to get dispatch interface");
-    }
-
-    hr = pole->pDispatch->lpVtbl->QueryInterface(pole->pDispatch, &iid,
-                                                 &p);
-    if(FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError,
-                  "failed to get interface `%s'",
-                  StringValuePtr(str_iid));
-    }
-
-    pDispatch = p;
-    return create_win32ole_object(cWIN32OLE, pDispatch, 0, 0);
-}
-
-/*
- *  call-seq:
- *     ole_respond_to?(method) -> true or false
- *
- *  Returns true when OLE object has OLE method, otherwise returns false.
- *
- *      ie = WIN32OLE.new('InternetExplorer.Application')
- *      ie.ole_respond_to?("gohome") => true
- */
-static VALUE
-fole_respond_to(VALUE self, VALUE method)
-{
-    struct oledata *pole = NULL;
-    BSTR wcmdname;
-    DISPID DispID;
-    HRESULT hr;
-    if(!RB_TYPE_P(method, T_STRING) && !RB_TYPE_P(method, T_SYMBOL)) {
-        rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-    }
-    if (RB_TYPE_P(method, T_SYMBOL)) {
-        method = rb_sym2str(method);
-    }
-    pole = oledata_get_struct(self);
-    wcmdname = ole_vstr2wc(method);
-    hr = pole->pDispatch->lpVtbl->GetIDsOfNames( pole->pDispatch, &IID_NULL,
-            &wcmdname, 1, cWIN32OLE_lcid, &DispID);
-    SysFreeString(wcmdname);
-    return SUCCEEDED(hr) ? Qtrue : Qfalse;
-}
-
-HRESULT
-ole_docinfo_from_type(ITypeInfo *pTypeInfo, BSTR *name, BSTR *helpstr, DWORD *helpcontext, BSTR *helpfile)
-{
-    HRESULT hr;
-    ITypeLib *pTypeLib;
-    UINT i;
-
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, &pTypeLib, &i);
-    if (FAILED(hr)) {
-        return hr;
-    }
-
-    hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, i,
-                                            name, helpstr,
-                                            helpcontext, helpfile);
-    if (FAILED(hr)) {
-        OLE_RELEASE(pTypeLib);
-        return hr;
-    }
-    OLE_RELEASE(pTypeLib);
-    return hr;
-}
-
-static VALUE
-ole_usertype2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails)
-{
-    HRESULT hr;
-    BSTR bstr;
-    ITypeInfo *pRefTypeInfo;
-    VALUE type = Qnil;
-
-    hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo,
-                                           V_UNION1(pTypeDesc, hreftype),
-                                           &pRefTypeInfo);
-    if(FAILED(hr))
-        return Qnil;
-    hr = ole_docinfo_from_type(pRefTypeInfo, &bstr, NULL, NULL, NULL);
-    if(FAILED(hr)) {
-        OLE_RELEASE(pRefTypeInfo);
-        return Qnil;
-    }
-    OLE_RELEASE(pRefTypeInfo);
-    type = WC2VSTR(bstr);
-    if(typedetails != Qnil)
-        rb_ary_push(typedetails, type);
-    return type;
-}
-
-static VALUE
-ole_ptrtype2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails)
-{
-    TYPEDESC *p = pTypeDesc;
-    VALUE type = rb_str_new2("");
-
-    if (p->vt == VT_PTR || p->vt == VT_SAFEARRAY) {
-        p = V_UNION1(p, lptdesc);
-        type = ole_typedesc2val(pTypeInfo, p, typedetails);
-    }
-    return type;
-}
-
-VALUE
-ole_typedesc2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails)
-{
-    VALUE str;
-    VALUE typestr = Qnil;
-    switch(pTypeDesc->vt) {
-    case VT_I2:
-        typestr = rb_str_new2("I2");
-        break;
-    case VT_I4:
-        typestr = rb_str_new2("I4");
-        break;
-    case VT_R4:
-        typestr = rb_str_new2("R4");
-        break;
-    case VT_R8:
-        typestr = rb_str_new2("R8");
-        break;
-    case VT_CY:
-        typestr = rb_str_new2("CY");
-        break;
-    case VT_DATE:
-        typestr = rb_str_new2("DATE");
-        break;
-    case VT_BSTR:
-        typestr = rb_str_new2("BSTR");
-        break;
-    case VT_BOOL:
-        typestr = rb_str_new2("BOOL");
-        break;
-    case VT_VARIANT:
-        typestr = rb_str_new2("VARIANT");
-        break;
-    case VT_DECIMAL:
-        typestr = rb_str_new2("DECIMAL");
-        break;
-    case VT_I1:
-        typestr = rb_str_new2("I1");
-        break;
-    case VT_UI1:
-        typestr = rb_str_new2("UI1");
-        break;
-    case VT_UI2:
-        typestr = rb_str_new2("UI2");
-        break;
-    case VT_UI4:
-        typestr = rb_str_new2("UI4");
-        break;
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    case VT_I8:
-        typestr = rb_str_new2("I8");
-        break;
-    case VT_UI8:
-        typestr = rb_str_new2("UI8");
-        break;
-#endif
-    case VT_INT:
-        typestr = rb_str_new2("INT");
-        break;
-    case VT_UINT:
-        typestr = rb_str_new2("UINT");
-        break;
-    case VT_VOID:
-        typestr = rb_str_new2("VOID");
-        break;
-    case VT_HRESULT:
-        typestr = rb_str_new2("HRESULT");
-        break;
-    case VT_PTR:
-        typestr = rb_str_new2("PTR");
-        if(typedetails != Qnil)
-            rb_ary_push(typedetails, typestr);
-        return ole_ptrtype2val(pTypeInfo, pTypeDesc, typedetails);
-    case VT_SAFEARRAY:
-        typestr = rb_str_new2("SAFEARRAY");
-        if(typedetails != Qnil)
-            rb_ary_push(typedetails, typestr);
-        return ole_ptrtype2val(pTypeInfo, pTypeDesc, typedetails);
-    case VT_CARRAY:
-        typestr = rb_str_new2("CARRAY");
-        break;
-    case VT_USERDEFINED:
-        typestr = rb_str_new2("USERDEFINED");
-        if (typedetails != Qnil)
-            rb_ary_push(typedetails, typestr);
-        str = ole_usertype2val(pTypeInfo, pTypeDesc, typedetails);
-        if (str != Qnil) {
-            return str;
-        }
-        return typestr;
-    case VT_UNKNOWN:
-        typestr = rb_str_new2("UNKNOWN");
-        break;
-    case VT_DISPATCH:
-        typestr = rb_str_new2("DISPATCH");
-        break;
-    case VT_ERROR:
-        typestr = rb_str_new2("ERROR");
-        break;
-    case VT_LPWSTR:
-        typestr = rb_str_new2("LPWSTR");
-        break;
-    case VT_LPSTR:
-        typestr = rb_str_new2("LPSTR");
-        break;
-    case VT_RECORD:
-        typestr = rb_str_new2("RECORD");
-        break;
-    default:
-        typestr = rb_str_new2("Unknown Type ");
-        rb_str_concat(typestr, rb_fix2str(RB_INT2FIX(pTypeDesc->vt), 10));
-        break;
-    }
-    if (typedetails != Qnil)
-        rb_ary_push(typedetails, typestr);
-    return typestr;
-}
-
-/*
- *   call-seq:
- *      ole_method_help(method)
- *
- *   Returns WIN32OLE::Method object corresponding with method
- *   specified by 1st argument.
- *
- *      excel = WIN32OLE.new('Excel.Application')
- *      method = excel.ole_method_help('Quit')
- *
- */
-static VALUE
-fole_method_help(VALUE self, VALUE cmdname)
-{
-    ITypeInfo *pTypeInfo;
-    HRESULT hr;
-    struct oledata *pole = NULL;
-    VALUE obj;
-
-    SafeStringValue(cmdname);
-    pole = oledata_get_struct(self);
-    hr = typeinfo_from_ole(pole, &pTypeInfo);
-    if(FAILED(hr))
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to get ITypeInfo");
-
-    obj = create_win32ole_method(pTypeInfo, cmdname);
-
-    OLE_RELEASE(pTypeInfo);
-    if (obj == Qnil)
-        rb_raise(eWIN32OLERuntimeError, "not found %s",
-                 StringValuePtr(cmdname));
-    return obj;
-}
-
-/*
- *  call-seq:
- *     ole_activex_initialize() -> Qnil
- *
- *  Initialize WIN32OLE object(ActiveX Control) by calling
- *  IPersistMemory::InitNew.
- *
- *  Before calling OLE method, some kind of the ActiveX controls
- *  created with MFC should be initialized by calling
- *  IPersistXXX::InitNew.
- *
- *  If and only if you received the exception "HRESULT error code:
- *  0x8000ffff catastrophic failure", try this method before
- *  invoking any ole_method.
- *
- *     obj = WIN32OLE.new("ProgID_or_GUID_of_ActiveX_Control")
- *     obj.ole_activex_initialize
- *     obj.method(...)
- *
- */
-static VALUE
-fole_activex_initialize(VALUE self)
-{
-    struct oledata *pole = NULL;
-    IPersistMemory *pPersistMemory;
-    void *p;
-
-    HRESULT hr = S_OK;
-
-    pole = oledata_get_struct(self);
-
-    hr = pole->pDispatch->lpVtbl->QueryInterface(pole->pDispatch, &IID_IPersistMemory, &p);
-    pPersistMemory = p;
-    if (SUCCEEDED(hr)) {
-        hr = pPersistMemory->lpVtbl->InitNew(pPersistMemory);
-        OLE_RELEASE(pPersistMemory);
-        if (SUCCEEDED(hr)) {
-            return Qnil;
-        }
-    }
-
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "fail to initialize ActiveX control");
-    }
-
-    return Qnil;
-}
-
-HRESULT
-typelib_from_val(VALUE obj, ITypeLib **pTypeLib)
-{
-    LCID lcid = cWIN32OLE_lcid;
-    HRESULT hr;
-    struct oledata *pole = NULL;
-    unsigned int index;
-    ITypeInfo *pTypeInfo;
-    pole = oledata_get_struct(obj);
-    hr = pole->pDispatch->lpVtbl->GetTypeInfo(pole->pDispatch,
-                                              0, lcid, &pTypeInfo);
-    if (FAILED(hr)) {
-        return hr;
-    }
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, pTypeLib, &index);
-    OLE_RELEASE(pTypeInfo);
-    return hr;
-}
-
-static void
-com_hash_free(void *ptr)
-{
-    st_table *tbl = ptr;
-    st_free_table(tbl);
-}
-
-static void
-com_hash_mark(void *ptr)
-{
-    st_table *tbl = ptr;
-    rb_mark_hash(tbl);
-}
-
-static size_t
-com_hash_size(const void *ptr)
-{
-    const st_table *tbl = ptr;
-    return st_memsize(tbl);
-}
-
-static void
-check_nano_server(void)
-{
-    HKEY hsubkey;
-    LONG err;
-    const char * subkey = "SOFTWARE\\Microsoft\\Windows NT\\CurrentVersion\\Server\\ServerLevels";
-    const char * regval = "NanoServer";
-
-    err = RegOpenKeyEx(HKEY_LOCAL_MACHINE, subkey, 0, KEY_READ, &hsubkey);
-    if (err == ERROR_SUCCESS) {
-        err = RegQueryValueEx(hsubkey, regval, NULL, NULL, NULL, NULL);
-        if (err == ERROR_SUCCESS) {
-            g_running_nano = TRUE;
-        }
-        RegCloseKey(hsubkey);
-    }
-}
-
-LCID cWIN32OLE_lcid;
-
-void
-Init_win32ole(void)
-{
-    cWIN32OLE_lcid = LOCALE_SYSTEM_DEFAULT;
-    g_ole_initialized_init();
-    check_nano_server();
-
-    com_vtbl.QueryInterface = QueryInterface;
-    com_vtbl.AddRef = AddRef;
-    com_vtbl.Release = Release;
-    com_vtbl.GetTypeInfoCount = GetTypeInfoCount;
-    com_vtbl.GetTypeInfo = GetTypeInfo;
-    com_vtbl.GetIDsOfNames = GetIDsOfNames;
-    com_vtbl.Invoke = Invoke;
-
-    message_filter.QueryInterface = mf_QueryInterface;
-    message_filter.AddRef = mf_AddRef;
-    message_filter.Release = mf_Release;
-    message_filter.HandleInComingCall = mf_HandleInComingCall;
-    message_filter.RetryRejectedCall = mf_RetryRejectedCall;
-    message_filter.MessagePending = mf_MessagePending;
-
-    enc2cp_hash = TypedData_Wrap_Struct(0, &win32ole_hash_datatype, 0);
-    RTYPEDDATA_DATA(enc2cp_hash) = st_init_numtable();
-    rb_gc_register_mark_object(enc2cp_hash);
-
-    com_hash = TypedData_Wrap_Struct(0, &win32ole_hash_datatype, 0);
-    RTYPEDDATA_DATA(com_hash) = st_init_numtable();
-    rb_gc_register_mark_object(com_hash);
-
-    cWIN32OLE = rb_define_class("WIN32OLE", rb_cObject);
-
-    rb_define_alloc_func(cWIN32OLE, fole_s_allocate);
-
-    rb_define_method(cWIN32OLE, "initialize", fole_initialize, -1);
-
-    rb_define_singleton_method(cWIN32OLE, "connect", fole_s_connect, -1);
-    rb_define_singleton_method(cWIN32OLE, "const_load", fole_s_const_load, -1);
-
-    rb_define_singleton_method(cWIN32OLE, "ole_free", fole_s_free, 1);
-    rb_define_singleton_method(cWIN32OLE, "ole_reference_count", fole_s_reference_count, 1);
-    rb_define_singleton_method(cWIN32OLE, "ole_show_help", fole_s_show_help, -1);
-    rb_define_singleton_method(cWIN32OLE, "codepage", fole_s_get_code_page, 0);
-    rb_define_singleton_method(cWIN32OLE, "codepage=", fole_s_set_code_page, 1);
-    rb_define_singleton_method(cWIN32OLE, "locale", fole_s_get_locale, 0);
-    rb_define_singleton_method(cWIN32OLE, "locale=", fole_s_set_locale, 1);
-    rb_define_singleton_method(cWIN32OLE, "create_guid", fole_s_create_guid, 0);
-    rb_define_singleton_method(cWIN32OLE, "ole_initialize", fole_s_ole_initialize, 0);
-    rb_define_singleton_method(cWIN32OLE, "ole_uninitialize", fole_s_ole_uninitialize, 0);
-
-    rb_define_method(cWIN32OLE, "invoke", fole_invoke, -1);
-    rb_define_method(cWIN32OLE, "[]", fole_getproperty_with_bracket, -1);
-    rb_define_method(cWIN32OLE, "_invoke", fole_invoke2, 3);
-    rb_define_method(cWIN32OLE, "_getproperty", fole_getproperty2, 3);
-    rb_define_method(cWIN32OLE, "_setproperty", fole_setproperty2, 3);
-
-    /* support propput method that takes an argument */
-    rb_define_method(cWIN32OLE, "[]=", fole_setproperty_with_bracket, -1);
-
-    rb_define_method(cWIN32OLE, "ole_free", fole_free, 0);
-
-    rb_define_method(cWIN32OLE, "each", fole_each, 0);
-    rb_define_method(cWIN32OLE, "method_missing", fole_missing, -1);
-
-    /* support setproperty method much like Perl ;-) */
-    rb_define_method(cWIN32OLE, "setproperty", fole_setproperty, -1);
-
-    rb_define_method(cWIN32OLE, "ole_methods", fole_methods, 0);
-    rb_define_method(cWIN32OLE, "ole_get_methods", fole_get_methods, 0);
-    rb_define_method(cWIN32OLE, "ole_put_methods", fole_put_methods, 0);
-    rb_define_method(cWIN32OLE, "ole_func_methods", fole_func_methods, 0);
-
-    rb_define_method(cWIN32OLE, "ole_method", fole_method_help, 1);
-    rb_define_alias(cWIN32OLE, "ole_method_help", "ole_method");
-    rb_define_method(cWIN32OLE, "ole_activex_initialize", fole_activex_initialize, 0);
-    rb_define_method(cWIN32OLE, "ole_type", fole_type, 0);
-    rb_define_alias(cWIN32OLE, "ole_obj_help", "ole_type");
-    rb_define_method(cWIN32OLE, "ole_typelib", fole_typelib, 0);
-    rb_define_method(cWIN32OLE, "ole_query_interface", fole_query_interface, 1);
-    rb_define_method(cWIN32OLE, "ole_respond_to?", fole_respond_to, 1);
-
-    /* Constants definition */
-
-    /*
-     * Version string of WIN32OLE.
-     */
-    rb_define_const(cWIN32OLE, "VERSION", rb_str_new2(WIN32OLE_VERSION));
-
-    /*
-     * After invoking OLE methods with reference arguments, you can access
-     * the value of arguments by using ARGV.
-     *
-     * If the method of OLE(COM) server written by C#.NET is following:
-     *
-     *   void calcsum(int a, int b, out int c) {
-     *       c = a + b;
-     *   }
-     *
-     * then, the Ruby OLE(COM) client script to retrieve the value of
-     * argument c after invoking calcsum method is following:
-     *
-     *   a = 10
-     *   b = 20
-     *   c = 0
-     *   comserver.calcsum(a, b, c)
-     *   p c # => 0
-     *   p WIN32OLE::ARGV # => [10, 20, 30]
-     *
-     * You can use WIN32OLE::Variant object to retrieve the value of reference
-     * arguments instead of referring WIN32OLE::ARGV.
-     *
-     */
-    rb_define_const(cWIN32OLE, "ARGV", rb_ary_new());
-
-    /*
-     * 0: ANSI code page. See WIN32OLE.codepage and WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_ACP", RB_INT2FIX(CP_ACP));
-
-    /*
-     * 1: OEM code page. See WIN32OLE.codepage and WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_OEMCP", RB_INT2FIX(CP_OEMCP));
-
-    /*
-     * 2
-     */
-    rb_define_const(cWIN32OLE, "CP_MACCP", RB_INT2FIX(CP_MACCP));
-
-    /*
-     * 3: current thread ANSI code page. See WIN32OLE.codepage and
-     * WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_THREAD_ACP", RB_INT2FIX(CP_THREAD_ACP));
-
-    /*
-     * 42: symbol code page. See WIN32OLE.codepage and WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_SYMBOL", RB_INT2FIX(CP_SYMBOL));
-
-    /*
-     * 65000: UTF-7 code page. See WIN32OLE.codepage and WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_UTF7", RB_INT2FIX(CP_UTF7));
-
-    /*
-     * 65001: UTF-8 code page. See WIN32OLE.codepage and WIN32OLE.codepage=.
-     */
-    rb_define_const(cWIN32OLE, "CP_UTF8", RB_INT2FIX(CP_UTF8));
-
-    /*
-     * 0x0800: default locale for the operating system. See WIN32OLE.locale
-     * and WIN32OLE.locale=.
-     */
-    rb_define_const(cWIN32OLE, "LOCALE_SYSTEM_DEFAULT", RB_INT2FIX(LOCALE_SYSTEM_DEFAULT));
-
-    /*
-     * 0x0400: default locale for the user or process. See WIN32OLE.locale
-     * and WIN32OLE.locale=.
-     */
-    rb_define_const(cWIN32OLE, "LOCALE_USER_DEFAULT", RB_INT2FIX(LOCALE_USER_DEFAULT));
-
-    Init_win32ole_variant_m();
-    Init_win32ole_typelib();
-    Init_win32ole_type();
-    Init_win32ole_variable();
-    Init_win32ole_method();
-    Init_win32ole_param();
-    Init_win32ole_event();
-    Init_win32ole_variant();
-    Init_win32ole_record();
-    Init_win32ole_error();
-
-    ole_init_cp();
-}
diff --git a/ext/win32ole/win32ole.gemspec b/ext/win32ole/win32ole.gemspec
deleted file mode 100644
index 425942d5a0..0000000000
--- a/ext/win32ole/win32ole.gemspec
+++ /dev/null
@@ -1,35 +0,0 @@
-source_version = ["", "ext/win32ole/"].find do |dir|
-  begin
-    break File.open(File.join(__dir__, "#{dir}win32ole.c")) {|f|
-      f.gets("\n#define WIN32OLE_VERSION ")
-      f.gets[/\s*"(.+)"/, 1]
-    }
-  rescue Errno::ENOENT
-  end
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = "win32ole"
-  spec.version       = source_version
-  spec.authors       = ["Masaki Suketa"]
-  spec.email         = ["suke@ruby-lang.org"]
-
-  spec.summary       = %q{Provides an interface for OLE Automation in Ruby}
-  spec.description   = spec.summary
-  spec.homepage      = "https://github.com/ruby/win32ole"
-  spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-
-  pathspecs = %W[
-    :(exclude,literal)#{File.basename(__FILE__)}
-    :^/bin/ :^/test/ :^/rakelib/ :^/.git* :^/Gemfile* :^/Rakefile*
-  ]
-  spec.files = IO.popen(%w[git ls-files -z --] + pathspecs, chdir: __dir__, err: IO::NULL, exception: false, &:read).split("\x0")
-  spec.bindir        = "exe"
-  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.extensions    = "ext/win32ole/extconf.rb"
-  spec.require_paths = ["lib"]
-end
diff --git a/ext/win32ole/win32ole.h b/ext/win32ole/win32ole.h
deleted file mode 100644
index cd627ef765..0000000000
--- a/ext/win32ole/win32ole.h
+++ /dev/null
@@ -1,155 +0,0 @@
-#ifndef WIN32OLE_H
-#define WIN32OLE_H 1
-#include "ruby/ruby.h"
-#include "ruby/st.h"
-#include "ruby/encoding.h"
-
-#define GNUC_OLDER_3_4_4 \
-    ((__GNUC__ < 3) || \
-     ((__GNUC__ <= 3) && (__GNUC_MINOR__ < 4)) || \
-     ((__GNUC__ <= 3) && (__GNUC_MINOR__ <= 4) && (__GNUC_PATCHLEVEL__ <= 4)))
-
-#if (defined(__GNUC__)) && (GNUC_OLDER_3_4_4)
-#ifndef NONAMELESSUNION
-#define NONAMELESSUNION 1
-#endif
-#endif
-
-#include <ctype.h>
-
-#include <windows.h>
-#include <ocidl.h>
-#include <olectl.h>
-#include <ole2.h>
-#if defined(HAVE_TYPE_IMULTILANGUAGE2) || defined(HAVE_TYPE_IMULTILANGUAGE)
-#include <mlang.h>
-#endif
-#include <stdlib.h>
-#include <math.h>
-#ifdef HAVE_STDARG_PROTOTYPES
-#include <stdarg.h>
-#define va_init_list(a,b) va_start(a,b)
-#else
-#include <varargs.h>
-#define va_init_list(a,b) va_start(a)
-#endif
-#include <objidl.h>
-
-#define DOUT fprintf(stderr,"%s(%d)\n", __FILE__, __LINE__)
-#define DOUTS(x) fprintf(stderr,"%s(%d):" #x "=%s\n",__FILE__, __LINE__,x)
-#define DOUTMSG(x) fprintf(stderr, "%s(%d):" #x "\n",__FILE__, __LINE__)
-#define DOUTI(x) fprintf(stderr, "%s(%d):" #x "=%d\n",__FILE__, __LINE__,x)
-#define DOUTD(x) fprintf(stderr, "%s(%d):" #x "=%f\n",__FILE__, __LINE__,x)
-
-#if (defined(__GNUC__)) && (GNUC_OLDER_3_4_4)
-#define V_UNION1(X, Y) ((X)->u.Y)
-#else
-#define V_UNION1(X, Y) ((X)->Y)
-#endif
-
-#if (defined(__GNUC__)) && (GNUC_OLDER_3_4_4)
-#undef V_UNION
-#define V_UNION(X,Y) ((X)->n1.n2.n3.Y)
-
-#undef V_VT
-#define V_VT(X) ((X)->n1.n2.vt)
-
-#undef V_BOOL
-#define V_BOOL(X) V_UNION(X,boolVal)
-#endif
-
-#ifndef V_I1REF
-#define V_I1REF(X) V_UNION(X, pcVal)
-#endif
-
-#ifndef V_UI2REF
-#define V_UI2REF(X) V_UNION(X, puiVal)
-#endif
-
-#ifndef V_INT
-#define V_INT(X) V_UNION(X, intVal)
-#endif
-
-#ifndef V_INTREF
-#define V_INTREF(X) V_UNION(X, pintVal)
-#endif
-
-#ifndef V_UINT
-#define V_UINT(X) V_UNION(X, uintVal)
-#endif
-
-#ifndef V_UINTREF
-#define V_UINTREF(X) V_UNION(X, puintVal)
-#endif
-
-#ifdef HAVE_LONG_LONG
-#define I8_2_NUM LL2NUM
-#define UI8_2_NUM ULL2NUM
-#define NUM2I8  RB_NUM2LL
-#define NUM2UI8 RB_NUM2ULL
-#else
-#define I8_2_NUM RB_INT2NUM
-#define UI8_2_NUM RB_UINT2NUM
-#define NUM2I8  RB_NUM2INT
-#define NUM2UI8 RB_NUM2UINT
-#endif
-
-#define OLE_ADDREF(X) (X) ? ((X)->lpVtbl->AddRef(X)) : 0
-#define OLE_RELEASE(X) (X) ? ((X)->lpVtbl->Release(X)) : 0
-#define OLE_FREE(x) {\
-    if(ole_initialized() == TRUE) {\
-        if(x) {\
-            OLE_RELEASE(x);\
-            (x) = 0;\
-        }\
-    }\
-}
-
-#define OLE_GET_TYPEATTR(X, Y) ((X)->lpVtbl->GetTypeAttr((X), (Y)))
-#define OLE_RELEASE_TYPEATTR(X, Y) ((X)->lpVtbl->ReleaseTypeAttr((X), (Y)))
-
-struct oledata {
-    IDispatch *pDispatch;
-};
-
-extern VALUE cWIN32OLE;
-extern LCID cWIN32OLE_lcid;
-
-struct oledata *oledata_get_struct(VALUE obj);
-LPWSTR ole_vstr2wc(VALUE vstr);
-LONG reg_open_key(HKEY hkey, const char *name, HKEY *phkey);
-LONG reg_open_vkey(HKEY hkey, VALUE key, HKEY *phkey);
-VALUE reg_enum_key(HKEY hkey, DWORD i);
-VALUE reg_get_val(HKEY hkey, const char *subkey);
-VALUE reg_get_val2(HKEY hkey, const char *subkey);
-void ole_initialize(void);
-VALUE default_inspect(VALUE self, const char *class_name);
-char *ole_wc2mb(LPWSTR pw);
-VALUE ole_wc2vstr(LPWSTR pw, BOOL isfree);
-
-#define WC2VSTR(x) ole_wc2vstr((x), TRUE)
-
-BOOL ole_initialized(void);
-HRESULT ole_docinfo_from_type(ITypeInfo *pTypeInfo, BSTR *name, BSTR *helpstr, DWORD *helpcontext, BSTR *helpfile);
-VALUE ole_typedesc2val(ITypeInfo *pTypeInfo, TYPEDESC *pTypeDesc, VALUE typedetails);
-VALUE make_inspect(const char *class_name, VALUE detail);
-void ole_val2variant(VALUE val, VARIANT *var);
-void ole_val2variant2(VALUE val, VARIANT *var);
-void ole_val2variant_ex(VALUE val, VARIANT *var, VARTYPE vt);
-VALUE ole_variant2val(VARIANT *pvar);
-HRESULT ole_val_ary2variant_ary(VALUE val, VARIANT *var, VARTYPE vt);
-VOID *val2variant_ptr(VALUE val, VARIANT *var, VARTYPE vt);
-HRESULT typelib_from_val(VALUE obj, ITypeLib **pTypeLib);
-
-#include "win32ole_variant_m.h"
-#include "win32ole_typelib.h"
-#include "win32ole_type.h"
-#include "win32ole_variable.h"
-#include "win32ole_method.h"
-#include "win32ole_param.h"
-#include "win32ole_event.h"
-#include "win32ole_variant.h"
-#include "win32ole_record.h"
-#include "win32ole_error.h"
-
-#endif
diff --git a/ext/win32ole/win32ole_error.c b/ext/win32ole/win32ole_error.c
deleted file mode 100644
index 66b5136dee..0000000000
--- a/ext/win32ole/win32ole_error.c
+++ /dev/null
@@ -1,96 +0,0 @@
-#include "win32ole.h"
-
-static VALUE ole_hresult2msg(HRESULT hr);
-
-static VALUE
-ole_hresult2msg(HRESULT hr)
-{
-    VALUE msg = Qnil;
-    char *p_msg = NULL;
-    char *term = NULL;
-    DWORD dwCount;
-
-    char strhr[100];
-    sprintf(strhr, "    HRESULT error code:0x%08x\n      ", (unsigned)hr);
-    msg = rb_str_new2(strhr);
-    dwCount = FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER |
-                            FORMAT_MESSAGE_FROM_SYSTEM |
-                            FORMAT_MESSAGE_IGNORE_INSERTS,
-                            NULL, hr,
-                            MAKELANGID(LANG_ENGLISH, SUBLANG_ENGLISH_US),
-                            (LPTSTR)&p_msg, 0, NULL);
-    if (dwCount == 0) {
-        dwCount = FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER |
-                                FORMAT_MESSAGE_FROM_SYSTEM |
-                                FORMAT_MESSAGE_IGNORE_INSERTS,
-                                NULL, hr, cWIN32OLE_lcid,
-                                (LPTSTR)&p_msg, 0, NULL);
-    }
-    if (dwCount > 0) {
-        term = p_msg + strlen(p_msg);
-        while (p_msg < term) {
-            term--;
-            if (*term == '\r' || *term == '\n')
-                *term = '\0';
-            else break;
-        }
-        if (p_msg[0] != '\0') {
-            rb_str_cat2(msg, p_msg);
-        }
-    }
-    LocalFree(p_msg);
-    return msg;
-}
-
-void
-ole_raise(HRESULT hr, VALUE ecs, const char *fmt, ...)
-{
-    va_list args;
-    VALUE msg;
-    VALUE err_msg;
-    va_init_list(args, fmt);
-    msg = rb_vsprintf(fmt, args);
-    va_end(args);
-
-    err_msg = ole_hresult2msg(hr);
-    if(err_msg != Qnil) {
-        rb_str_cat2(msg, "\n");
-        rb_str_append(msg, err_msg);
-    }
-    rb_exc_raise(rb_exc_new_str(ecs, msg));
-}
-
-VALUE eWIN32OLERuntimeError;
-VALUE eWIN32OLEQueryInterfaceError;
-
-void
-Init_win32ole_error(void)
-{
-    /*
-     * Document-class: WIN32OLE::RuntimeError
-     *
-     * Raised when OLE processing failed.
-     *
-     * EX:
-     *
-     *   obj = WIN32OLE.new("NonExistProgID")
-     *
-     * raises the exception:
-     *
-     *   WIN32OLE::RuntimeError: unknown OLE server: `NonExistProgID'
-     *       HRESULT error code:0x800401f3
-     *         Invalid class string
-     *
-     */
-    eWIN32OLERuntimeError = rb_define_class_under(cWIN32OLE, "RuntimeError", rb_eRuntimeError);
-    /* Alias of WIN32OLE::RuntimeError, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLERuntimeError", eWIN32OLERuntimeError);
-    /*
-     * Document-class: WIN32OLE::QueryInterfaceError
-     *
-     * Raised when OLE query failed.
-     */
-    eWIN32OLEQueryInterfaceError = rb_define_class_under(cWIN32OLE, "QueryInterfaceError", eWIN32OLERuntimeError);
-    /* Alias of WIN32OLE::QueryInterfaceError, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLEQueryInterfaceError", eWIN32OLEQueryInterfaceError);
-}
diff --git a/ext/win32ole/win32ole_error.h b/ext/win32ole/win32ole_error.h
deleted file mode 100644
index a2f329856f..0000000000
--- a/ext/win32ole/win32ole_error.h
+++ /dev/null
@@ -1,9 +0,0 @@
-#ifndef WIN32OLE_ERROR_H
-#define WIN32OLE_ERROR_H 1
-
-extern VALUE eWIN32OLERuntimeError;
-extern VALUE eWIN32OLEQueryInterfaceError;
-NORETURN(PRINTF_ARGS(void ole_raise(HRESULT hr, VALUE ecs, const char *fmt, ...), 3, 4));
-void Init_win32ole_error(void);
-
-#endif
diff --git a/ext/win32ole/win32ole_event.c b/ext/win32ole/win32ole_event.c
deleted file mode 100644
index ff6835e3e4..0000000000
--- a/ext/win32ole/win32ole_event.c
+++ /dev/null
@@ -1,1279 +0,0 @@
-#include "win32ole.h"
-
-/*
- * Document-class: WIN32OLE::Event
- *
- *   +WIN32OLE::Event+ objects controls OLE event.
- */
-
-RUBY_EXTERN void rb_write_error_str(VALUE mesg);
-
-typedef struct {
-    struct IEventSinkVtbl * lpVtbl;
-} IEventSink, *PEVENTSINK;
-
-typedef struct IEventSinkVtbl IEventSinkVtbl;
-
-struct IEventSinkVtbl {
-    STDMETHOD(QueryInterface)(
-        PEVENTSINK,
-        REFIID,
-        LPVOID *);
-    STDMETHOD_(ULONG, AddRef)(PEVENTSINK);
-    STDMETHOD_(ULONG, Release)(PEVENTSINK);
-
-    STDMETHOD(GetTypeInfoCount)(
-        PEVENTSINK,
-        UINT *);
-    STDMETHOD(GetTypeInfo)(
-        PEVENTSINK,
-        UINT,
-        LCID,
-        ITypeInfo **);
-    STDMETHOD(GetIDsOfNames)(
-        PEVENTSINK,
-        REFIID,
-        OLECHAR **,
-        UINT,
-        LCID,
-        DISPID *);
-    STDMETHOD(Invoke)(
-        PEVENTSINK,
-        DISPID,
-        REFIID,
-        LCID,
-        WORD,
-        DISPPARAMS *,
-        VARIANT *,
-        EXCEPINFO *,
-        UINT *);
-};
-
-typedef struct tagIEVENTSINKOBJ {
-    const IEventSinkVtbl *lpVtbl;
-    DWORD m_cRef;
-    IID m_iid;
-    long  m_event_id;
-    ITypeInfo *pTypeInfo;
-}IEVENTSINKOBJ, *PIEVENTSINKOBJ;
-
-struct oleeventdata {
-    DWORD dwCookie;
-    IConnectionPoint *pConnectionPoint;
-    IDispatch *pDispatch;
-    long event_id;
-};
-
-static VALUE ary_ole_event;
-static ID id_events;
-
-VALUE cWIN32OLE_EVENT;
-
-STDMETHODIMP EVENTSINK_QueryInterface(PEVENTSINK, REFIID, LPVOID*);
-STDMETHODIMP_(ULONG) EVENTSINK_AddRef(PEVENTSINK);
-STDMETHODIMP_(ULONG) EVENTSINK_Release(PEVENTSINK);
-STDMETHODIMP EVENTSINK_GetTypeInfoCount(PEVENTSINK, UINT*);
-STDMETHODIMP EVENTSINK_GetTypeInfo(PEVENTSINK, UINT, LCID, ITypeInfo**);
-STDMETHODIMP EVENTSINK_GetIDsOfNames(PEVENTSINK, REFIID, OLECHAR**, UINT, LCID, DISPID*);
-STDMETHODIMP EVENTSINK_Invoke(PEVENTSINK, DISPID, REFIID, LCID, WORD, DISPPARAMS*, VARIANT*, EXCEPINFO*, UINT*);
-
-static const IEventSinkVtbl vtEventSink = {
-    EVENTSINK_QueryInterface,
-    EVENTSINK_AddRef,
-    EVENTSINK_Release,
-    EVENTSINK_GetTypeInfoCount,
-    EVENTSINK_GetTypeInfo,
-    EVENTSINK_GetIDsOfNames,
-    EVENTSINK_Invoke,
-};
-
-void EVENTSINK_Destructor(PIEVENTSINKOBJ);
-static void ole_val2ptr_variant(VALUE val, VARIANT *var);
-static void hash2ptr_dispparams(VALUE hash, ITypeInfo *pTypeInfo, DISPID dispid, DISPPARAMS *pdispparams);
-static VALUE hash2result(VALUE hash);
-static void ary2ptr_dispparams(VALUE ary, DISPPARAMS *pdispparams);
-static VALUE exec_callback(VALUE arg);
-static VALUE rescue_callback(VALUE arg);
-static HRESULT find_iid(VALUE ole, char *pitf, IID *piid, ITypeInfo **ppTypeInfo);
-static HRESULT find_coclass(ITypeInfo *pTypeInfo, TYPEATTR *pTypeAttr, ITypeInfo **pTypeInfo2, TYPEATTR **pTypeAttr2);
-static HRESULT find_default_source_from_typeinfo(ITypeInfo *pTypeInfo, TYPEATTR *pTypeAttr, ITypeInfo **ppTypeInfo);
-static HRESULT find_default_source(VALUE ole, IID *piid, ITypeInfo **ppTypeInfo);
-static long ole_search_event_at(VALUE ary, VALUE ev);
-static VALUE ole_search_event(VALUE ary, VALUE ev, BOOL  *is_default);
-static VALUE ole_search_handler_method(VALUE handler, VALUE ev, BOOL *is_default_handler);
-static void ole_delete_event(VALUE ary, VALUE ev);
-static void oleevent_free(void *ptr);
-static size_t oleevent_size(const void *ptr);
-static VALUE fev_s_allocate(VALUE klass);
-static VALUE ev_advise(int argc, VALUE *argv, VALUE self);
-static VALUE fev_initialize(int argc, VALUE *argv, VALUE self);
-static void ole_msg_loop(void);
-static VALUE fev_s_msg_loop(VALUE klass);
-static void add_event_call_back(VALUE obj, VALUE event, VALUE data);
-static VALUE ev_on_event(int argc, VALUE *argv, VALUE self, VALUE is_ary_arg);
-static VALUE fev_on_event(int argc, VALUE *argv, VALUE self);
-static VALUE fev_on_event_with_outargs(int argc, VALUE *argv, VALUE self);
-static VALUE fev_off_event(int argc, VALUE *argv, VALUE self);
-static VALUE fev_unadvise(VALUE self);
-static VALUE fev_set_handler(VALUE self, VALUE val);
-static VALUE fev_get_handler(VALUE self);
-static VALUE evs_push(VALUE ev);
-static VALUE evs_delete(long i);
-static VALUE evs_entry(long i);
-static long  evs_length(void);
-
-
-static const rb_data_type_t oleevent_datatype = {
-    "win32ole_event",
-    {NULL, oleevent_free, oleevent_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-STDMETHODIMP EVENTSINK_Invoke(
-    PEVENTSINK pEventSink,
-    DISPID dispid,
-    REFIID riid,
-    LCID lcid,
-    WORD wFlags,
-    DISPPARAMS *pdispparams,
-    VARIANT *pvarResult,
-    EXCEPINFO *pexcepinfo,
-    UINT *puArgErr
-    ) {
-
-    HRESULT hr;
-    BSTR bstr;
-    unsigned int count;
-    unsigned int i;
-    ITypeInfo *pTypeInfo;
-    VARIANT *pvar;
-    VALUE ary, obj, event, args, outargv, ev, result;
-    VALUE handler = Qnil;
-    VALUE arg[3];
-    VALUE mid;
-    VALUE is_outarg = Qfalse;
-    BOOL is_default_handler = FALSE;
-    int state;
-
-    PIEVENTSINKOBJ pEV = (PIEVENTSINKOBJ)pEventSink;
-    pTypeInfo = pEV->pTypeInfo;
-    obj = evs_entry(pEV->m_event_id);
-    if (!rb_obj_is_kind_of(obj, cWIN32OLE_EVENT)) {
-        return NOERROR;
-    }
-
-    ary = rb_ivar_get(obj, id_events);
-    if (NIL_P(ary) || !RB_TYPE_P(ary, T_ARRAY)) {
-        return NOERROR;
-    }
-    hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, dispid,
-                                     &bstr, 1, &count);
-    if (FAILED(hr)) {
-        return NOERROR;
-    }
-    ev = WC2VSTR(bstr);
-    event = ole_search_event(ary, ev, &is_default_handler);
-    if (RB_TYPE_P(event, T_ARRAY)) {
-        handler = rb_ary_entry(event, 0);
-        mid = rb_intern("call");
-        is_outarg = rb_ary_entry(event, 3);
-    } else {
-        handler = rb_ivar_get(obj, rb_intern("handler"));
-        if (handler == Qnil) {
-            return NOERROR;
-        }
-        mid = ole_search_handler_method(handler, ev, &is_default_handler);
-    }
-    if (handler == Qnil || mid == Qnil) {
-        return NOERROR;
-    }
-
-    args = rb_ary_new();
-    if (is_default_handler) {
-        rb_ary_push(args, ev);
-    }
-
-    /* make argument of event handler */
-    for (i = 0; i < pdispparams->cArgs; ++i) {
-        pvar = &pdispparams->rgvarg[pdispparams->cArgs-i-1];
-        rb_ary_push(args, ole_variant2val(pvar));
-    }
-    outargv = Qnil;
-    if (is_outarg == Qtrue) {
-        outargv = rb_ary_new();
-        rb_ary_push(args, outargv);
-    }
-
-    /*
-     * if exception raised in event callback,
-     * then you receive cfp consistency error.
-     * to avoid this error we use begin rescue end.
-     * and the exception raised then error message print
-     * and exit ruby process by Win32OLE itself.
-     */
-    arg[0] = handler;
-    arg[1] = mid;
-    arg[2] = args;
-    result = rb_protect(exec_callback, (VALUE)arg, &state);
-    if (state != 0) {
-        rescue_callback(Qnil);
-    }
-    if(RB_TYPE_P(result, T_HASH)) {
-        hash2ptr_dispparams(result, pTypeInfo, dispid, pdispparams);
-        result = hash2result(result);
-    }else if (is_outarg == Qtrue && RB_TYPE_P(outargv, T_ARRAY)) {
-        ary2ptr_dispparams(outargv, pdispparams);
-    }
-
-    if (pvarResult) {
-        VariantInit(pvarResult);
-        ole_val2variant(result, pvarResult);
-    }
-
-    return NOERROR;
-}
-
-STDMETHODIMP
-EVENTSINK_QueryInterface(
-    PEVENTSINK pEV,
-    REFIID     iid,
-    LPVOID*    ppv
-    ) {
-    if (IsEqualIID(iid, &IID_IUnknown) ||
-        IsEqualIID(iid, &IID_IDispatch) ||
-        IsEqualIID(iid, &((PIEVENTSINKOBJ)pEV)->m_iid)) {
-        *ppv = pEV;
-    }
-    else {
-        *ppv = NULL;
-        return E_NOINTERFACE;
-    }
-    ((LPUNKNOWN)*ppv)->lpVtbl->AddRef((LPUNKNOWN)*ppv);
-    return NOERROR;
-}
-
-STDMETHODIMP_(ULONG)
-EVENTSINK_AddRef(
-    PEVENTSINK pEV
-    ){
-    PIEVENTSINKOBJ pEVObj = (PIEVENTSINKOBJ)pEV;
-    return ++pEVObj->m_cRef;
-}
-
-STDMETHODIMP_(ULONG) EVENTSINK_Release(
-    PEVENTSINK pEV
-    ) {
-    PIEVENTSINKOBJ pEVObj = (PIEVENTSINKOBJ)pEV;
-    --pEVObj->m_cRef;
-    if(pEVObj->m_cRef != 0)
-        return pEVObj->m_cRef;
-    EVENTSINK_Destructor(pEVObj);
-    return 0;
-}
-
-STDMETHODIMP EVENTSINK_GetTypeInfoCount(
-    PEVENTSINK pEV,
-    UINT *pct
-    ) {
-    *pct = 0;
-    return NOERROR;
-}
-
-STDMETHODIMP EVENTSINK_GetTypeInfo(
-    PEVENTSINK pEV,
-    UINT info,
-    LCID lcid,
-    ITypeInfo **pInfo
-    ) {
-    *pInfo = NULL;
-    return DISP_E_BADINDEX;
-}
-
-STDMETHODIMP EVENTSINK_GetIDsOfNames(
-    PEVENTSINK pEventSink,
-    REFIID riid,
-    OLECHAR **szNames,
-    UINT cNames,
-    LCID lcid,
-    DISPID *pDispID
-    ) {
-    ITypeInfo *pTypeInfo;
-    PIEVENTSINKOBJ pEV = (PIEVENTSINKOBJ)pEventSink;
-    pTypeInfo = pEV->pTypeInfo;
-    if (pTypeInfo) {
-        return pTypeInfo->lpVtbl->GetIDsOfNames(pTypeInfo, szNames, cNames, pDispID);
-    }
-    return DISP_E_UNKNOWNNAME;
-}
-
-PIEVENTSINKOBJ
-EVENTSINK_Constructor(void)
-{
-    PIEVENTSINKOBJ pEv;
-    pEv = ALLOC_N(IEVENTSINKOBJ, 1);
-    if(pEv == NULL) return NULL;
-    pEv->lpVtbl = &vtEventSink;
-    pEv->m_cRef = 0;
-    pEv->m_event_id = 0;
-    pEv->pTypeInfo = NULL;
-    return pEv;
-}
-
-void
-EVENTSINK_Destructor(
-    PIEVENTSINKOBJ pEVObj
-    ) {
-    if(pEVObj != NULL) {
-        OLE_RELEASE(pEVObj->pTypeInfo);
-        free(pEVObj);
-        pEVObj = NULL;
-    }
-}
-
-static void
-ole_val2ptr_variant(VALUE val, VARIANT *var)
-{
-    switch (TYPE(val)) {
-    case T_STRING:
-        if (V_VT(var) == (VT_BSTR | VT_BYREF)) {
-            *V_BSTRREF(var) = ole_vstr2wc(val);
-        }
-        break;
-    case T_FIXNUM:
-        switch(V_VT(var)) {
-        case (VT_UI1 | VT_BYREF) :
-            *V_UI1REF(var) = RB_NUM2CHR(val);
-            break;
-        case (VT_I2 | VT_BYREF) :
-            *V_I2REF(var) = (short)RB_NUM2INT(val);
-            break;
-        case (VT_I4 | VT_BYREF) :
-            *V_I4REF(var) = RB_NUM2INT(val);
-            break;
-        case (VT_R4 | VT_BYREF) :
-            *V_R4REF(var) = (float)RB_NUM2INT(val);
-            break;
-        case (VT_R8 | VT_BYREF) :
-            *V_R8REF(var) = RB_NUM2INT(val);
-            break;
-        default:
-            break;
-        }
-        break;
-    case T_FLOAT:
-        switch(V_VT(var)) {
-        case (VT_I2 | VT_BYREF) :
-            *V_I2REF(var) = (short)RB_NUM2INT(val);
-            break;
-        case (VT_I4 | VT_BYREF) :
-            *V_I4REF(var) = RB_NUM2INT(val);
-            break;
-        case (VT_R4 | VT_BYREF) :
-            *V_R4REF(var) = (float)NUM2DBL(val);
-            break;
-        case (VT_R8 | VT_BYREF) :
-            *V_R8REF(var) = NUM2DBL(val);
-            break;
-        default:
-            break;
-        }
-        break;
-    case T_BIGNUM:
-        if (V_VT(var) == (VT_R8 | VT_BYREF)) {
-            *V_R8REF(var) = rb_big2dbl(val);
-        }
-        break;
-    case T_TRUE:
-        if (V_VT(var) == (VT_BOOL | VT_BYREF)) {
-            *V_BOOLREF(var) = VARIANT_TRUE;
-        }
-        break;
-    case T_FALSE:
-        if (V_VT(var) == (VT_BOOL | VT_BYREF)) {
-            *V_BOOLREF(var) = VARIANT_FALSE;
-        }
-        break;
-    default:
-        break;
-    }
-}
-
-static void
-hash2ptr_dispparams(VALUE hash, ITypeInfo *pTypeInfo, DISPID dispid, DISPPARAMS *pdispparams)
-{
-    BSTR *bstrs;
-    HRESULT hr;
-    UINT len, i;
-    VARIANT *pvar;
-    VALUE val;
-    VALUE key;
-    len = 0;
-    bstrs = ALLOCA_N(BSTR, pdispparams->cArgs + 1);
-    hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, dispid,
-                                     bstrs, pdispparams->cArgs + 1,
-                                     &len);
-    if (FAILED(hr))
-        return;
-
-    for (i = 0; i < len - 1; i++) {
-        key = WC2VSTR(bstrs[i + 1]);
-        val = rb_hash_aref(hash, RB_UINT2NUM(i));
-        if (val == Qnil)
-            val = rb_hash_aref(hash, key);
-        if (val == Qnil)
-            val = rb_hash_aref(hash, rb_str_intern(key));
-        pvar = &pdispparams->rgvarg[pdispparams->cArgs-i-1];
-        ole_val2ptr_variant(val, pvar);
-    }
-}
-
-static VALUE
-hash2result(VALUE hash)
-{
-    VALUE ret = Qnil;
-    ret = rb_hash_aref(hash, rb_str_new2("return"));
-    if (ret == Qnil)
-        ret = rb_hash_aref(hash, rb_str_intern(rb_str_new2("return")));
-    return ret;
-}
-
-static void
-ary2ptr_dispparams(VALUE ary, DISPPARAMS *pdispparams)
-{
-    int i;
-    VALUE v;
-    VARIANT *pvar;
-    for(i = 0; i < RARRAY_LEN(ary) && (unsigned int) i < pdispparams->cArgs; i++) {
-        v = rb_ary_entry(ary, i);
-        pvar = &pdispparams->rgvarg[pdispparams->cArgs-i-1];
-        ole_val2ptr_variant(v, pvar);
-    }
-}
-
-static VALUE
-exec_callback(VALUE arg)
-{
-    VALUE *parg = (VALUE *)arg;
-    VALUE handler = parg[0];
-    VALUE mid = parg[1];
-    VALUE args = parg[2];
-    return rb_apply(handler, mid, args);
-}
-
-static VALUE
-rescue_callback(VALUE arg)
-{
-
-    VALUE error;
-    VALUE e = rb_errinfo();
-    VALUE bt = rb_funcall(e, rb_intern("backtrace"), 0);
-    VALUE msg = rb_funcall(e, rb_intern("message"), 0);
-    bt = rb_ary_entry(bt, 0);
-    error = rb_sprintf("%"PRIsVALUE": %"PRIsVALUE" (%s)\n", bt, msg, rb_obj_classname(e));
-    rb_write_error_str(error);
-    rb_backtrace();
-    ruby_finalize();
-    exit(-1);
-
-    return Qnil;
-}
-
-static HRESULT
-find_iid(VALUE ole, char *pitf, IID *piid, ITypeInfo **ppTypeInfo)
-{
-    HRESULT hr;
-    IDispatch *pDispatch;
-    ITypeInfo *pTypeInfo;
-    ITypeLib *pTypeLib;
-    TYPEATTR *pTypeAttr;
-    HREFTYPE RefType;
-    ITypeInfo *pImplTypeInfo;
-    TYPEATTR *pImplTypeAttr;
-
-    struct oledata *pole = NULL;
-    unsigned int index;
-    unsigned int count;
-    int type;
-    BSTR bstr;
-    char *pstr;
-
-    BOOL is_found = FALSE;
-    LCID    lcid = cWIN32OLE_lcid;
-
-    pole = oledata_get_struct(ole);
-
-    pDispatch = pole->pDispatch;
-
-    hr = pDispatch->lpVtbl->GetTypeInfo(pDispatch, 0, lcid, &pTypeInfo);
-    if (FAILED(hr))
-        return hr;
-
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo,
-                                                 &pTypeLib,
-                                                 &index);
-    OLE_RELEASE(pTypeInfo);
-    if (FAILED(hr))
-        return hr;
-
-    if (!pitf) {
-        hr = pTypeLib->lpVtbl->GetTypeInfoOfGuid(pTypeLib,
-                                                 piid,
-                                                 ppTypeInfo);
-        OLE_RELEASE(pTypeLib);
-        return hr;
-    }
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (index = 0; index < count; index++) {
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib,
-                                           index,
-                                           &pTypeInfo);
-        if (FAILED(hr))
-            break;
-        hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-
-        if(FAILED(hr)) {
-            OLE_RELEASE(pTypeInfo);
-            break;
-        }
-        if(pTypeAttr->typekind == TKIND_COCLASS) {
-            for (type = 0; type < pTypeAttr->cImplTypes; type++) {
-                hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo,
-                                                             type,
-                                                             &RefType);
-                if (FAILED(hr))
-                    break;
-                hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo,
-                                                       RefType,
-                                                       &pImplTypeInfo);
-                if (FAILED(hr))
-                    break;
-
-                hr = pImplTypeInfo->lpVtbl->GetDocumentation(pImplTypeInfo,
-                                                             -1,
-                                                             &bstr,
-                                                             NULL, NULL, NULL);
-                if (FAILED(hr)) {
-                    OLE_RELEASE(pImplTypeInfo);
-                    break;
-                }
-                pstr = ole_wc2mb(bstr);
-                if (strcmp(pitf, pstr) == 0) {
-                    hr = pImplTypeInfo->lpVtbl->GetTypeAttr(pImplTypeInfo,
-                                                            &pImplTypeAttr);
-                    if (SUCCEEDED(hr)) {
-                        is_found = TRUE;
-                        *piid = pImplTypeAttr->guid;
-                        if (ppTypeInfo) {
-                            *ppTypeInfo = pImplTypeInfo;
-                            (*ppTypeInfo)->lpVtbl->AddRef((*ppTypeInfo));
-                        }
-                        pImplTypeInfo->lpVtbl->ReleaseTypeAttr(pImplTypeInfo,
-                                                               pImplTypeAttr);
-                    }
-                }
-                free(pstr);
-                OLE_RELEASE(pImplTypeInfo);
-                if (is_found || FAILED(hr))
-                    break;
-            }
-        }
-
-        OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-        OLE_RELEASE(pTypeInfo);
-        if (is_found || FAILED(hr))
-            break;
-    }
-    OLE_RELEASE(pTypeLib);
-    if(!is_found)
-        return E_NOINTERFACE;
-    return hr;
-}
-
-static HRESULT
-find_coclass(
-    ITypeInfo *pTypeInfo,
-    TYPEATTR *pTypeAttr,
-    ITypeInfo **pCOTypeInfo,
-    TYPEATTR **pCOTypeAttr)
-{
-    HRESULT hr = E_NOINTERFACE;
-    ITypeLib *pTypeLib;
-    int count;
-    BOOL found = FALSE;
-    ITypeInfo *pTypeInfo2;
-    TYPEATTR *pTypeAttr2;
-    int flags;
-    int i,j;
-    HREFTYPE href;
-    ITypeInfo *pRefTypeInfo;
-    TYPEATTR *pRefTypeAttr;
-
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, &pTypeLib, NULL);
-    if (FAILED(hr)) {
-        return hr;
-    }
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (i = 0; i < count && !found; i++) {
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, i, &pTypeInfo2);
-        if (FAILED(hr))
-            continue;
-        hr = OLE_GET_TYPEATTR(pTypeInfo2, &pTypeAttr2);
-        if (FAILED(hr)) {
-            OLE_RELEASE(pTypeInfo2);
-            continue;
-        }
-        if (pTypeAttr2->typekind != TKIND_COCLASS) {
-            OLE_RELEASE_TYPEATTR(pTypeInfo2, pTypeAttr2);
-            OLE_RELEASE(pTypeInfo2);
-            continue;
-        }
-        for (j = 0; j < pTypeAttr2->cImplTypes && !found; j++) {
-            hr = pTypeInfo2->lpVtbl->GetImplTypeFlags(pTypeInfo2, j, &flags);
-            if (FAILED(hr))
-                continue;
-            if (!(flags & IMPLTYPEFLAG_FDEFAULT))
-                continue;
-            hr = pTypeInfo2->lpVtbl->GetRefTypeOfImplType(pTypeInfo2, j, &href);
-            if (FAILED(hr))
-                continue;
-            hr = pTypeInfo2->lpVtbl->GetRefTypeInfo(pTypeInfo2, href, &pRefTypeInfo);
-            if (FAILED(hr))
-                continue;
-            hr = OLE_GET_TYPEATTR(pRefTypeInfo, &pRefTypeAttr);
-            if (FAILED(hr))  {
-                OLE_RELEASE(pRefTypeInfo);
-                continue;
-            }
-            if (IsEqualGUID(&(pTypeAttr->guid), &(pRefTypeAttr->guid))) {
-                found = TRUE;
-            }
-        }
-        if (!found) {
-            OLE_RELEASE_TYPEATTR(pTypeInfo2, pTypeAttr2);
-            OLE_RELEASE(pTypeInfo2);
-        }
-    }
-    OLE_RELEASE(pTypeLib);
-    if (found) {
-        *pCOTypeInfo = pTypeInfo2;
-        *pCOTypeAttr = pTypeAttr2;
-        hr = S_OK;
-    } else {
-        hr = E_NOINTERFACE;
-    }
-    return hr;
-}
-
-static HRESULT
-find_default_source_from_typeinfo(
-    ITypeInfo *pTypeInfo,
-    TYPEATTR *pTypeAttr,
-    ITypeInfo **ppTypeInfo)
-{
-    int i = 0;
-    HRESULT hr = E_NOINTERFACE;
-    int flags;
-    HREFTYPE hRefType;
-    /* Enumerate all implemented types of the COCLASS */
-    for (i = 0; i < pTypeAttr->cImplTypes; i++) {
-        hr = pTypeInfo->lpVtbl->GetImplTypeFlags(pTypeInfo, i, &flags);
-        if (FAILED(hr))
-            continue;
-
-        /*
-           looking for the [default] [source]
-           we just hope that it is a dispinterface :-)
-        */
-        if ((flags & IMPLTYPEFLAG_FDEFAULT) &&
-            (flags & IMPLTYPEFLAG_FSOURCE)) {
-
-            hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo,
-                                                         i, &hRefType);
-            if (FAILED(hr))
-                continue;
-            hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo,
-                                                   hRefType, ppTypeInfo);
-            if (SUCCEEDED(hr))
-                break;
-        }
-    }
-    return hr;
-}
-
-static HRESULT
-find_default_source(VALUE ole, IID *piid, ITypeInfo **ppTypeInfo)
-{
-    HRESULT hr;
-    IProvideClassInfo2 *pProvideClassInfo2;
-    IProvideClassInfo *pProvideClassInfo;
-    void *p;
-
-    IDispatch *pDispatch;
-    ITypeInfo *pTypeInfo;
-    ITypeInfo *pTypeInfo2 = NULL;
-    TYPEATTR *pTypeAttr;
-    TYPEATTR *pTypeAttr2 = NULL;
-
-    struct oledata *pole = NULL;
-
-    pole = oledata_get_struct(ole);
-    pDispatch = pole->pDispatch;
-    hr = pDispatch->lpVtbl->QueryInterface(pDispatch,
-                                           &IID_IProvideClassInfo2,
-                                           &p);
-    if (SUCCEEDED(hr)) {
-        pProvideClassInfo2 = p;
-        hr = pProvideClassInfo2->lpVtbl->GetGUID(pProvideClassInfo2,
-                                                 GUIDKIND_DEFAULT_SOURCE_DISP_IID,
-                                                 piid);
-        OLE_RELEASE(pProvideClassInfo2);
-        if (SUCCEEDED(hr)) {
-            hr = find_iid(ole, NULL, piid, ppTypeInfo);
-        }
-    }
-    if (SUCCEEDED(hr)) {
-        return hr;
-    }
-    hr = pDispatch->lpVtbl->QueryInterface(pDispatch,
-            &IID_IProvideClassInfo,
-            &p);
-    if (SUCCEEDED(hr)) {
-        pProvideClassInfo = p;
-        hr = pProvideClassInfo->lpVtbl->GetClassInfo(pProvideClassInfo,
-                                                     &pTypeInfo);
-        OLE_RELEASE(pProvideClassInfo);
-    }
-    if (FAILED(hr)) {
-        hr = pDispatch->lpVtbl->GetTypeInfo(pDispatch, 0, cWIN32OLE_lcid, &pTypeInfo );
-    }
-    if (FAILED(hr))
-        return hr;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        OLE_RELEASE(pTypeInfo);
-        return hr;
-    }
-
-    *ppTypeInfo = 0;
-    hr = find_default_source_from_typeinfo(pTypeInfo, pTypeAttr, ppTypeInfo);
-    if (!*ppTypeInfo) {
-        hr = find_coclass(pTypeInfo, pTypeAttr, &pTypeInfo2, &pTypeAttr2);
-        if (SUCCEEDED(hr)) {
-            hr = find_default_source_from_typeinfo(pTypeInfo2, pTypeAttr2, ppTypeInfo);
-            OLE_RELEASE_TYPEATTR(pTypeInfo2, pTypeAttr2);
-            OLE_RELEASE(pTypeInfo2);
-        }
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    OLE_RELEASE(pTypeInfo);
-    /* Now that would be a bad surprise, if we didn't find it, wouldn't it? */
-    if (!*ppTypeInfo) {
-        if (SUCCEEDED(hr))
-            hr = E_UNEXPECTED;
-        return hr;
-    }
-
-    /* Determine IID of default source interface */
-    hr = (*ppTypeInfo)->lpVtbl->GetTypeAttr(*ppTypeInfo, &pTypeAttr);
-    if (SUCCEEDED(hr)) {
-        *piid = pTypeAttr->guid;
-        (*ppTypeInfo)->lpVtbl->ReleaseTypeAttr(*ppTypeInfo, pTypeAttr);
-    }
-    else
-        OLE_RELEASE(*ppTypeInfo);
-
-    return hr;
-}
-
-static long
-ole_search_event_at(VALUE ary, VALUE ev)
-{
-    VALUE event;
-    VALUE event_name;
-    long i, len;
-    long ret = -1;
-    len = RARRAY_LEN(ary);
-    for(i = 0; i < len; i++) {
-        event = rb_ary_entry(ary, i);
-        event_name = rb_ary_entry(event, 1);
-        if(NIL_P(event_name) && NIL_P(ev)) {
-            ret = i;
-            break;
-        }
-        else if (RB_TYPE_P(ev, T_STRING) &&
-                 RB_TYPE_P(event_name, T_STRING) &&
-                 rb_str_cmp(ev, event_name) == 0) {
-            ret = i;
-            break;
-        }
-    }
-    return ret;
-}
-
-static VALUE
-ole_search_event(VALUE ary, VALUE ev, BOOL  *is_default)
-{
-    VALUE event;
-    VALUE def_event;
-    VALUE event_name;
-    int i, len;
-    *is_default = FALSE;
-    def_event = Qnil;
-    len = RARRAY_LEN(ary);
-    for(i = 0; i < len; i++) {
-        event = rb_ary_entry(ary, i);
-        event_name = rb_ary_entry(event, 1);
-        if(NIL_P(event_name)) {
-            *is_default = TRUE;
-            def_event = event;
-        }
-        else if (rb_str_cmp(ev, event_name) == 0) {
-            *is_default = FALSE;
-            return event;
-        }
-    }
-    return def_event;
-}
-
-static VALUE
-ole_search_handler_method(VALUE handler, VALUE ev, BOOL *is_default_handler)
-{
-    VALUE mid;
-
-    *is_default_handler = FALSE;
-    mid = rb_to_id(rb_sprintf("on%"PRIsVALUE, ev));
-    if (rb_respond_to(handler, mid)) {
-        return mid;
-    }
-    mid = rb_intern("method_missing");
-    if (rb_respond_to(handler, mid)) {
-        *is_default_handler = TRUE;
-        return mid;
-    }
-    return Qnil;
-}
-
-static void
-ole_delete_event(VALUE ary, VALUE ev)
-{
-    long at = -1;
-    at = ole_search_event_at(ary, ev);
-    if (at >= 0) {
-        rb_ary_delete_at(ary, at);
-    }
-}
-
-
-static void
-oleevent_free(void *ptr)
-{
-    struct oleeventdata *poleev = ptr;
-    if (poleev->pConnectionPoint) {
-        poleev->pConnectionPoint->lpVtbl->Unadvise(poleev->pConnectionPoint, poleev->dwCookie);
-        OLE_RELEASE(poleev->pConnectionPoint);
-        poleev->pConnectionPoint = NULL;
-    }
-    OLE_RELEASE(poleev->pDispatch);
-    free(poleev);
-}
-
-static size_t
-oleevent_size(const void *ptr)
-{
-    return ptr ? sizeof(struct oleeventdata) : 0;
-}
-
-static VALUE
-fev_s_allocate(VALUE klass)
-{
-    VALUE obj;
-    struct oleeventdata *poleev;
-    obj = TypedData_Make_Struct(klass, struct oleeventdata, &oleevent_datatype, poleev);
-    poleev->dwCookie = 0;
-    poleev->pConnectionPoint = NULL;
-    poleev->event_id = 0;
-    poleev->pDispatch = NULL;
-    return obj;
-}
-
-static VALUE
-ev_advise(int argc, VALUE *argv, VALUE self)
-{
-
-    VALUE ole, itf;
-    struct oledata *pole = NULL;
-    char *pitf;
-    HRESULT hr;
-    IID iid;
-    ITypeInfo *pTypeInfo = 0;
-    IDispatch *pDispatch;
-    IConnectionPointContainer *pContainer;
-    IConnectionPoint *pConnectionPoint;
-    IEVENTSINKOBJ *pIEV;
-    DWORD dwCookie;
-    struct oleeventdata *poleev;
-    void *p;
-
-    rb_scan_args(argc, argv, "11", &ole, &itf);
-
-    if (!rb_obj_is_kind_of(ole, cWIN32OLE)) {
-        rb_raise(rb_eTypeError, "1st parameter must be WIN32OLE object");
-    }
-
-    if(!RB_TYPE_P(itf, T_NIL)) {
-        pitf = StringValuePtr(itf);
-        hr = find_iid(ole, pitf, &iid, &pTypeInfo);
-    }
-    else {
-        hr = find_default_source(ole, &iid, &pTypeInfo);
-    }
-    if (FAILED(hr)) {
-        ole_raise(hr, rb_eRuntimeError, "interface not found");
-    }
-
-    pole = oledata_get_struct(ole);
-    pDispatch = pole->pDispatch;
-    hr = pDispatch->lpVtbl->QueryInterface(pDispatch,
-                                           &IID_IConnectionPointContainer,
-                                           &p);
-    if (FAILED(hr)) {
-        OLE_RELEASE(pTypeInfo);
-        ole_raise(hr, eWIN32OLEQueryInterfaceError,
-                  "failed to query IConnectionPointContainer");
-    }
-    pContainer = p;
-
-    hr = pContainer->lpVtbl->FindConnectionPoint(pContainer,
-                                                 &iid,
-                                                 &pConnectionPoint);
-    OLE_RELEASE(pContainer);
-    if (FAILED(hr)) {
-        OLE_RELEASE(pTypeInfo);
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to query IConnectionPoint");
-    }
-    pIEV = EVENTSINK_Constructor();
-    pIEV->m_iid = iid;
-    hr = pConnectionPoint->lpVtbl->Advise(pConnectionPoint,
-                                          (IUnknown*)pIEV,
-                                          &dwCookie);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "Advise Error");
-    }
-
-    TypedData_Get_Struct(self, struct oleeventdata, &oleevent_datatype, poleev);
-    pIEV->m_event_id = evs_length();
-    pIEV->pTypeInfo = pTypeInfo;
-    poleev->dwCookie = dwCookie;
-    poleev->pConnectionPoint = pConnectionPoint;
-    poleev->event_id = pIEV->m_event_id;
-    poleev->pDispatch = pDispatch;
-    OLE_ADDREF(pDispatch);
-
-    return self;
-}
-
-/*
- *  call-seq:
- *     new(ole, event) #=> WIN32OLE::Event object.
- *
- *  Returns OLE event object.
- *  The first argument specifies WIN32OLE object.
- *  The second argument specifies OLE event name.
- *     ie = WIN32OLE.new('InternetExplorer.Application')
- *     ev = WIN32OLE::Event.new(ie, 'DWebBrowserEvents')
- */
-static VALUE
-fev_initialize(int argc, VALUE *argv, VALUE self)
-{
-    ev_advise(argc, argv, self);
-    evs_push(self);
-    rb_ivar_set(self, id_events, rb_ary_new());
-    fev_set_handler(self, Qnil);
-    return self;
-}
-
-static void
-ole_msg_loop(void)
-{
-    MSG msg;
-    while(PeekMessage(&msg,NULL,0,0,PM_REMOVE)) {
-        TranslateMessage(&msg);
-        DispatchMessage(&msg);
-    }
-}
-
-/*
- *  call-seq:
- *     message_loop
- *
- *  Translates and dispatches Windows message.
- */
-static VALUE
-fev_s_msg_loop(VALUE klass)
-{
-    ole_msg_loop();
-    return Qnil;
-}
-
-static void
-add_event_call_back(VALUE obj, VALUE event, VALUE data)
-{
-    VALUE events = rb_ivar_get(obj, id_events);
-    if (NIL_P(events) || !RB_TYPE_P(events, T_ARRAY)) {
-        events = rb_ary_new();
-        rb_ivar_set(obj, id_events, events);
-    }
-    ole_delete_event(events, event);
-    rb_ary_push(events, data);
-}
-
-static VALUE
-ev_on_event(int argc, VALUE *argv, VALUE self, VALUE is_ary_arg)
-{
-    struct oleeventdata *poleev;
-    VALUE event, args, data;
-    TypedData_Get_Struct(self, struct oleeventdata, &oleevent_datatype, poleev);
-    if (poleev->pConnectionPoint == NULL) {
-        rb_raise(eWIN32OLERuntimeError, "IConnectionPoint not found. You must call advise at first.");
-    }
-    rb_scan_args(argc, argv, "01*", &event, &args);
-    if(!NIL_P(event)) {
-        if(!RB_TYPE_P(event, T_STRING) && !RB_TYPE_P(event, T_SYMBOL)) {
-            rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-        }
-        if (RB_TYPE_P(event, T_SYMBOL)) {
-            event = rb_sym2str(event);
-        }
-    }
-    data = rb_ary_new3(4, rb_block_proc(), event, args, is_ary_arg);
-    add_event_call_back(self, event, data);
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     on_event([event]){...}
- *
- *  Defines the callback event.
- *  If argument is omitted, this method defines the callback of all events.
- *  If you want to modify reference argument in callback, return hash in
- *  callback. If you want to return value to OLE server as result of callback
- *  use `return' or :return.
- *
- *    ie = WIN32OLE.new('InternetExplorer.Application')
- *    ev = WIN32OLE::Event.new(ie)
- *    ev.on_event("NavigateComplete") {|url| puts url}
- *    ev.on_event() {|ev, *args| puts "#{ev} fired"}
- *
- *    ev.on_event("BeforeNavigate2") {|*args|
- *      # ...
- *      # set true to BeforeNavigate reference argument `Cancel'.
- *      # Cancel is 7-th argument of BeforeNavigate,
- *      # so you can use 6 as key of hash instead of 'Cancel'.
- *      # The argument is counted from 0.
- *      # The hash key of 0 means first argument.)
- *      {:Cancel => true}  # or {'Cancel' => true} or {6 => true}
- *    }
- *
- *    ev.on_event(event_name) {|*args|
- *      {:return => 1, :xxx => yyy}
- *    }
- */
-static VALUE
-fev_on_event(int argc, VALUE *argv, VALUE self)
-{
-    return ev_on_event(argc, argv, self, Qfalse);
-}
-
-/*
- *  call-seq:
- *     on_event_with_outargs([event]){...}
- *
- *  Defines the callback of event.
- *  If you want modify argument in callback,
- *  you could use this method instead of WIN32OLE::Event#on_event.
- *
- *    ie = WIN32OLE.new('InternetExplorer.Application')
- *    ev = WIN32OLE::Event.new(ie)
- *    ev.on_event_with_outargs('BeforeNavigate2') {|*args|
- *      args.last[6] = true
- *    }
- */
-static VALUE
-fev_on_event_with_outargs(int argc, VALUE *argv, VALUE self)
-{
-    return ev_on_event(argc, argv, self, Qtrue);
-}
-
-/*
- *  call-seq:
- *     off_event([event])
- *
- *  removes the callback of event.
- *
- *    ie = WIN32OLE.new('InternetExplorer.Application')
- *    ev = WIN32OLE::Event.new(ie)
- *    ev.on_event('BeforeNavigate2') {|*args|
- *      args.last[6] = true
- *    }
- *    # ...
- *    ev.off_event('BeforeNavigate2')
- *    # ...
- */
-static VALUE
-fev_off_event(int argc, VALUE *argv, VALUE self)
-{
-    VALUE event = Qnil;
-    VALUE events;
-
-    rb_scan_args(argc, argv, "01", &event);
-    if(!NIL_P(event)) {
-        if(!RB_TYPE_P(event, T_STRING) && !RB_TYPE_P(event, T_SYMBOL)) {
-            rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-        }
-        if (RB_TYPE_P(event, T_SYMBOL)) {
-            event = rb_sym2str(event);
-        }
-    }
-    events = rb_ivar_get(self, id_events);
-    if (NIL_P(events)) {
-        return Qnil;
-    }
-    ole_delete_event(events, event);
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     unadvise -> nil
- *
- *  disconnects OLE server. If this method called, then the WIN32OLE::Event object
- *  does not receive the OLE server event any more.
- *  This method is trial implementation.
- *
- *      ie = WIN32OLE.new('InternetExplorer.Application')
- *      ev = WIN32OLE::Event.new(ie)
- *      ev.on_event() { something }
- *      # ...
- *      ev.unadvise
- *
- */
-static VALUE
-fev_unadvise(VALUE self)
-{
-    struct oleeventdata *poleev;
-    TypedData_Get_Struct(self, struct oleeventdata, &oleevent_datatype, poleev);
-    if (poleev->pConnectionPoint) {
-        ole_msg_loop();
-        evs_delete(poleev->event_id);
-        poleev->pConnectionPoint->lpVtbl->Unadvise(poleev->pConnectionPoint, poleev->dwCookie);
-        OLE_RELEASE(poleev->pConnectionPoint);
-        poleev->pConnectionPoint = NULL;
-    }
-    OLE_FREE(poleev->pDispatch);
-    return Qnil;
-}
-
-static VALUE
-evs_push(VALUE ev)
-{
-    return rb_ary_push(ary_ole_event, ev);
-}
-
-static VALUE
-evs_delete(long i)
-{
-    rb_ary_store(ary_ole_event, i, Qnil);
-    return Qnil;
-}
-
-static VALUE
-evs_entry(long i)
-{
-    return rb_ary_entry(ary_ole_event, i);
-}
-
-static long
-evs_length(void)
-{
-    return RARRAY_LEN(ary_ole_event);
-}
-
-/*
- *  call-seq:
- *     handler=
- *
- *  sets event handler object. If handler object has onXXX
- *  method according to XXX event, then onXXX method is called
- *  when XXX event occurs.
- *
- *  If handler object has method_missing and there is no
- *  method according to the event, then method_missing
- *  called and 1-st argument is event name.
- *
- *  If handler object has onXXX method and there is block
- *  defined by <code>on_event('XXX'){}</code>,
- *  then block is executed but handler object method is not called
- *  when XXX event occurs.
- *
- *      class Handler
- *        def onStatusTextChange(text)
- *          puts "StatusTextChanged"
- *        end
- *        def onPropertyChange(prop)
- *          puts "PropertyChanged"
- *        end
- *        def method_missing(ev, *arg)
- *          puts "other event #{ev}"
- *        end
- *      end
- *
- *      handler = Handler.new
- *      ie = WIN32OLE.new('InternetExplorer.Application')
- *      ev = WIN32OLE::Event.new(ie)
- *      ev.on_event("StatusTextChange") {|*args|
- *        puts "this block executed."
- *        puts "handler.onStatusTextChange method is not called."
- *      }
- *      ev.handler = handler
- *
- */
-static VALUE
-fev_set_handler(VALUE self, VALUE val)
-{
-    return rb_ivar_set(self, rb_intern("handler"), val);
-}
-
-/*
- *  call-seq:
- *     handler
- *
- *  returns handler object.
- *
- */
-static VALUE
-fev_get_handler(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("handler"));
-}
-
-void
-Init_win32ole_event(void)
-{
-#undef rb_intern
-    ary_ole_event = rb_ary_new();
-    rb_gc_register_mark_object(ary_ole_event);
-    id_events = rb_intern("events");
-    cWIN32OLE_EVENT = rb_define_class_under(cWIN32OLE, "Event", rb_cObject);
-    /* Alias of WIN32OLE::Event, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_EVENT", cWIN32OLE_EVENT);
-    rb_define_singleton_method(cWIN32OLE_EVENT, "message_loop", fev_s_msg_loop, 0);
-    rb_define_alloc_func(cWIN32OLE_EVENT, fev_s_allocate);
-    rb_define_method(cWIN32OLE_EVENT, "initialize", fev_initialize, -1);
-    rb_define_method(cWIN32OLE_EVENT, "on_event", fev_on_event, -1);
-    rb_define_method(cWIN32OLE_EVENT, "on_event_with_outargs", fev_on_event_with_outargs, -1);
-    rb_define_method(cWIN32OLE_EVENT, "off_event", fev_off_event, -1);
-    rb_define_method(cWIN32OLE_EVENT, "unadvise", fev_unadvise, 0);
-    rb_define_method(cWIN32OLE_EVENT, "handler=", fev_set_handler, 1);
-    rb_define_method(cWIN32OLE_EVENT, "handler", fev_get_handler, 0);
-}
diff --git a/ext/win32ole/win32ole_event.h b/ext/win32ole/win32ole_event.h
deleted file mode 100644
index f1a5aa234d..0000000000
--- a/ext/win32ole/win32ole_event.h
+++ /dev/null
@@ -1,6 +0,0 @@
-#ifndef WIN32OLE_EVENT_H
-#define WIN32OLE_EVENT_H 1
-
-void Init_win32ole_event(void);
-
-#endif
diff --git a/ext/win32ole/win32ole_method.c b/ext/win32ole/win32ole_method.c
deleted file mode 100644
index a0278729f0..0000000000
--- a/ext/win32ole/win32ole_method.c
+++ /dev/null
@@ -1,954 +0,0 @@
-#include "win32ole.h"
-
-static void olemethod_free(void *ptr);
-static size_t olemethod_size(const void *ptr);
-static VALUE ole_method_sub(VALUE self, ITypeInfo *pOwnerTypeInfo, ITypeInfo *pTypeInfo, VALUE name);
-static VALUE olemethod_from_typeinfo(VALUE self, ITypeInfo *pTypeInfo, VALUE name);
-static VALUE ole_methods_sub(ITypeInfo *pOwnerTypeInfo, ITypeInfo *pTypeInfo, VALUE methods, int mask);
-static VALUE olemethod_set_member(VALUE self, ITypeInfo *pTypeInfo, ITypeInfo *pOwnerTypeInfo, int index, VALUE name);
-static VALUE folemethod_initialize(VALUE self, VALUE oletype, VALUE method);
-static VALUE folemethod_name(VALUE self);
-static VALUE ole_method_return_type(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_return_type(VALUE self);
-static VALUE ole_method_return_vtype(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_return_vtype(VALUE self);
-static VALUE ole_method_return_type_detail(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_return_type_detail(VALUE self);
-static VALUE ole_method_invkind(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE ole_method_invoke_kind(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_invkind(VALUE self);
-static VALUE folemethod_invoke_kind(VALUE self);
-static VALUE ole_method_visible(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_visible(VALUE self);
-static VALUE ole_method_event(ITypeInfo *pTypeInfo, UINT method_index, VALUE method_name);
-static VALUE folemethod_event(VALUE self);
-static VALUE folemethod_event_interface(VALUE self);
-static HRESULT ole_method_docinfo_from_type(ITypeInfo *pTypeInfo, UINT method_index, BSTR *name, BSTR *helpstr, DWORD *helpcontext, BSTR *helpfile);
-static VALUE ole_method_helpstring(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_helpstring(VALUE self);
-static VALUE ole_method_helpfile(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_helpfile(VALUE self);
-static VALUE ole_method_helpcontext(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_helpcontext(VALUE self);
-static VALUE ole_method_dispid(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_dispid(VALUE self);
-static VALUE ole_method_offset_vtbl(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_offset_vtbl(VALUE self);
-static VALUE ole_method_size_params(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_size_params(VALUE self);
-static VALUE ole_method_size_opt_params(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_size_opt_params(VALUE self);
-static VALUE ole_method_params(ITypeInfo *pTypeInfo, UINT method_index);
-static VALUE folemethod_params(VALUE self);
-static VALUE folemethod_inspect(VALUE self);
-
-static const rb_data_type_t olemethod_datatype = {
-    "win32ole_method",
-    {NULL, olemethod_free, olemethod_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static void
-olemethod_free(void *ptr)
-{
-    struct olemethoddata *polemethod = ptr;
-    OLE_FREE(polemethod->pTypeInfo);
-    OLE_FREE(polemethod->pOwnerTypeInfo);
-    free(polemethod);
-}
-
-static size_t
-olemethod_size(const void *ptr)
-{
-    return ptr ? sizeof(struct olemethoddata) : 0;
-}
-
-struct olemethoddata *
-olemethod_data_get_struct(VALUE obj)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(obj, struct olemethoddata, &olemethod_datatype, pmethod);
-    return pmethod;
-}
-
-static VALUE
-ole_method_sub(VALUE self, ITypeInfo *pOwnerTypeInfo, ITypeInfo *pTypeInfo, VALUE name)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    BSTR bstr;
-    FUNCDESC *pFuncDesc;
-    WORD i;
-    VALUE fname;
-    VALUE method = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeAttr");
-    }
-    for(i = 0; i < pTypeAttr->cFuncs && method == Qnil; i++) {
-        hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, i, &pFuncDesc);
-        if (FAILED(hr))
-             continue;
-
-        hr = pTypeInfo->lpVtbl->GetDocumentation(pTypeInfo, pFuncDesc->memid,
-                                                 &bstr, NULL, NULL, NULL);
-        if (FAILED(hr)) {
-            pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-            continue;
-        }
-        fname = WC2VSTR(bstr);
-        if (strcasecmp(StringValuePtr(name), StringValuePtr(fname)) == 0) {
-            olemethod_set_member(self, pTypeInfo, pOwnerTypeInfo, i, fname);
-            method = self;
-        }
-        pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-        pFuncDesc=NULL;
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return method;
-}
-
-VALUE
-ole_methods_from_typeinfo(ITypeInfo *pTypeInfo, int mask)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    WORD i;
-    HREFTYPE href;
-    ITypeInfo *pRefTypeInfo;
-    VALUE methods = rb_ary_new();
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeAttr");
-    }
-
-    ole_methods_sub(0, pTypeInfo, methods, mask);
-    for(i=0; i < pTypeAttr->cImplTypes; i++){
-       hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo, i, &href);
-       if(FAILED(hr))
-           continue;
-       hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo, href, &pRefTypeInfo);
-       if (FAILED(hr))
-           continue;
-       ole_methods_sub(pTypeInfo, pRefTypeInfo, methods, mask);
-       OLE_RELEASE(pRefTypeInfo);
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return methods;
-}
-
-static VALUE
-olemethod_from_typeinfo(VALUE self, ITypeInfo *pTypeInfo, VALUE name)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    WORD i;
-    HREFTYPE href;
-    ITypeInfo *pRefTypeInfo;
-    VALUE method = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeAttr");
-    }
-    method = ole_method_sub(self, 0, pTypeInfo, name);
-    if (method != Qnil) {
-       return method;
-    }
-    for(i=0; i < pTypeAttr->cImplTypes && method == Qnil; i++){
-       hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo, i, &href);
-       if(FAILED(hr))
-           continue;
-       hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo, href, &pRefTypeInfo);
-       if (FAILED(hr))
-           continue;
-       method = ole_method_sub(self, pTypeInfo, pRefTypeInfo, name);
-       OLE_RELEASE(pRefTypeInfo);
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return method;
-}
-
-static VALUE
-ole_methods_sub(ITypeInfo *pOwnerTypeInfo, ITypeInfo *pTypeInfo, VALUE methods, int mask)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    BSTR bstr;
-    FUNCDESC *pFuncDesc;
-    VALUE method;
-    WORD i;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetTypeAttr");
-    }
-    for(i = 0; i < pTypeAttr->cFuncs; i++) {
-        hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, i, &pFuncDesc);
-        if (FAILED(hr))
-             continue;
-
-        hr = pTypeInfo->lpVtbl->GetDocumentation(pTypeInfo, pFuncDesc->memid,
-                                                 &bstr, NULL, NULL, NULL);
-        if (FAILED(hr)) {
-            pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-            continue;
-        }
-        if(pFuncDesc->invkind & mask) {
-            method = folemethod_s_allocate(cWIN32OLE_METHOD);
-            olemethod_set_member(method, pTypeInfo, pOwnerTypeInfo,
-                                 i, WC2VSTR(bstr));
-            rb_ary_push(methods, method);
-        }
-        pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-        pFuncDesc=NULL;
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-
-    return methods;
-}
-
-VALUE
-create_win32ole_method(ITypeInfo *pTypeInfo, VALUE name)
-{
-
-    VALUE method = folemethod_s_allocate(cWIN32OLE_METHOD);
-    VALUE obj = olemethod_from_typeinfo(method, pTypeInfo, name);
-    return obj;
-}
-
-/*
- * Document-class: WIN32OLE::Method
- *
- *   +WIN32OLE::Method+ objects represent OLE method information.
- */
-
-static VALUE
-olemethod_set_member(VALUE self, ITypeInfo *pTypeInfo, ITypeInfo *pOwnerTypeInfo, int index, VALUE name)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    pmethod->pTypeInfo = pTypeInfo;
-    OLE_ADDREF(pTypeInfo);
-    pmethod->pOwnerTypeInfo = pOwnerTypeInfo;
-    OLE_ADDREF(pOwnerTypeInfo);
-    pmethod->index = index;
-    rb_ivar_set(self, rb_intern("name"), name);
-    return self;
-}
-
-VALUE
-folemethod_s_allocate(VALUE klass)
-{
-    struct olemethoddata *pmethod;
-    VALUE obj;
-    obj = TypedData_Make_Struct(klass,
-                                struct olemethoddata,
-                                &olemethod_datatype, pmethod);
-    pmethod->pTypeInfo = NULL;
-    pmethod->pOwnerTypeInfo = NULL;
-    pmethod->index = 0;
-    return obj;
-}
-
-/*
- *  call-seq:
- *     WIN32OLE::Method.new(ole_type,  method) -> WIN32OLE::Method object
- *
- *  Returns a new WIN32OLE::Method object which represents the information
- *  about OLE method.
- *  The first argument <i>ole_type</i> specifies WIN32OLE::Type object.
- *  The second argument <i>method</i> specifies OLE method name defined OLE class
- *  which represents WIN32OLE::Type object.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- */
-static VALUE
-folemethod_initialize(VALUE self, VALUE oletype, VALUE method)
-{
-    VALUE obj = Qnil;
-    ITypeInfo *pTypeInfo;
-    if (rb_obj_is_kind_of(oletype, cWIN32OLE_TYPE)) {
-        SafeStringValue(method);
-        pTypeInfo = itypeinfo(oletype);
-        obj = olemethod_from_typeinfo(self, pTypeInfo, method);
-        if (obj == Qnil) {
-            rb_raise(eWIN32OLERuntimeError, "not found %s",
-                     StringValuePtr(method));
-        }
-    }
-    else {
-        rb_raise(rb_eTypeError, "1st argument should be WIN32OLE::Type object");
-    }
-    return obj;
-}
-
-/*
- *  call-seq:
- *     name
- *
- *  Returns the name of the method.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     puts method.name # => SaveAs
- *
- */
-static VALUE
-folemethod_name(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("name"));
-}
-
-static VALUE
-ole_method_return_type(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE type;
-
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLEQueryInterfaceError, "failed to GetFuncDesc");
-
-    type = ole_typedesc2val(pTypeInfo, &(pFuncDesc->elemdescFunc.tdesc), Qnil);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return type;
-}
-
-/*
- *  call-seq:
- *     return_type
- *
- *  Returns string of return value type of method.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.return_type # => Workbook
- *
- */
-static VALUE
-folemethod_return_type(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_return_type(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_return_vtype(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE vvt;
-
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetFuncDesc");
-
-    vvt = RB_INT2FIX(pFuncDesc->elemdescFunc.tdesc.vt);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return vvt;
-}
-
-/*
- *  call-seq:
- *     return_vtype
- *
- *  Returns number of return value type of method.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.return_vtype # => 26
- *
- */
-static VALUE
-folemethod_return_vtype(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_return_vtype(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_return_type_detail(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE type = rb_ary_new();
-
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return type;
-
-    ole_typedesc2val(pTypeInfo, &(pFuncDesc->elemdescFunc.tdesc), type);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return type;
-}
-
-/*
- *  call-seq:
- *     return_type_detail
- *
- *  Returns detail information of return value type of method.
- *  The information is array.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     p method.return_type_detail # => ["PTR", "USERDEFINED", "Workbook"]
- */
-static VALUE
-folemethod_return_type_detail(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_return_type_detail(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_invkind(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE invkind;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if(FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetFuncDesc");
-    invkind = RB_INT2FIX(pFuncDesc->invkind);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return invkind;
-}
-
-static VALUE
-ole_method_invoke_kind(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    VALUE type = rb_str_new2("UNKNOWN");
-    VALUE invkind = ole_method_invkind(pTypeInfo, method_index);
-    if((RB_FIX2INT(invkind) & INVOKE_PROPERTYGET) &&
-       (RB_FIX2INT(invkind) & INVOKE_PROPERTYPUT) ) {
-        type = rb_str_new2("PROPERTY");
-    } else if(RB_FIX2INT(invkind) & INVOKE_PROPERTYGET) {
-        type =  rb_str_new2("PROPERTYGET");
-    } else if(RB_FIX2INT(invkind) & INVOKE_PROPERTYPUT) {
-        type = rb_str_new2("PROPERTYPUT");
-    } else if(RB_FIX2INT(invkind) & INVOKE_PROPERTYPUTREF) {
-        type = rb_str_new2("PROPERTYPUTREF");
-    } else if(RB_FIX2INT(invkind) & INVOKE_FUNC) {
-        type = rb_str_new2("FUNC");
-    }
-    return type;
-}
-
-/*
- *   call-seq:
- *      invkind
- *
- *   Returns the method invoke kind.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.invkind # => 1
- *
- */
-static VALUE
-folemethod_invkind(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_invkind(pmethod->pTypeInfo, pmethod->index);
-}
-
-/*
- *  call-seq:
- *     invoke_kind
- *
- *  Returns the method kind string. The string is "UNKNOWN" or "PROPERTY"
- *  or "PROPERTY" or "PROPERTYGET" or "PROPERTYPUT" or "PROPERTYPPUTREF"
- *  or "FUNC".
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.invoke_kind # => "FUNC"
- */
-static VALUE
-folemethod_invoke_kind(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_invoke_kind(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_visible(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE visible;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if(FAILED(hr))
-        return Qfalse;
-    if (pFuncDesc->wFuncFlags & (FUNCFLAG_FRESTRICTED |
-                                 FUNCFLAG_FHIDDEN |
-                                 FUNCFLAG_FNONBROWSABLE)) {
-        visible = Qfalse;
-    } else {
-        visible = Qtrue;
-    }
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return visible;
-}
-
-/*
- *  call-seq:
- *     visible?
- *
- *  Returns true if the method is public.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.visible? # => true
- */
-static VALUE
-folemethod_visible(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_visible(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_event(ITypeInfo *pTypeInfo, UINT method_index, VALUE method_name)
-{
-    TYPEATTR *pTypeAttr;
-    HRESULT hr;
-    WORD i;
-    int flags;
-    HREFTYPE href;
-    ITypeInfo *pRefTypeInfo;
-    FUNCDESC *pFuncDesc;
-    BSTR bstr;
-    VALUE name;
-    VALUE event = Qfalse;
-
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        return event;
-    if(pTypeAttr->typekind != TKIND_COCLASS) {
-        pTypeInfo->lpVtbl->ReleaseTypeAttr(pTypeInfo, pTypeAttr);
-        return event;
-    }
-    for (i = 0; i < pTypeAttr->cImplTypes; i++) {
-        hr = pTypeInfo->lpVtbl->GetImplTypeFlags(pTypeInfo, i, &flags);
-        if (FAILED(hr))
-            continue;
-
-        if (flags & IMPLTYPEFLAG_FSOURCE) {
-            hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo,
-                                                         i, &href);
-            if (FAILED(hr))
-                continue;
-            hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo,
-                                                   href, &pRefTypeInfo);
-            if (FAILED(hr))
-                continue;
-            hr = pRefTypeInfo->lpVtbl->GetFuncDesc(pRefTypeInfo, method_index,
-                                                   &pFuncDesc);
-            if (FAILED(hr)) {
-                OLE_RELEASE(pRefTypeInfo);
-                continue;
-            }
-
-            hr = pRefTypeInfo->lpVtbl->GetDocumentation(pRefTypeInfo,
-                                                        pFuncDesc->memid,
-                                                        &bstr, NULL, NULL, NULL);
-            if (FAILED(hr)) {
-                pRefTypeInfo->lpVtbl->ReleaseFuncDesc(pRefTypeInfo, pFuncDesc);
-                OLE_RELEASE(pRefTypeInfo);
-                continue;
-            }
-
-            name = WC2VSTR(bstr);
-            pRefTypeInfo->lpVtbl->ReleaseFuncDesc(pRefTypeInfo, pFuncDesc);
-            OLE_RELEASE(pRefTypeInfo);
-            if (rb_str_cmp(method_name, name) == 0) {
-                event = Qtrue;
-                break;
-            }
-        }
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return event;
-}
-
-/*
- *  call-seq:
- *     event?
- *
- *  Returns true if the method is event.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SheetActivate')
- *     puts method.event? # => true
- *
- */
-static VALUE
-folemethod_event(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    if (!pmethod->pOwnerTypeInfo)
-        return Qfalse;
-    return ole_method_event(pmethod->pOwnerTypeInfo,
-                            pmethod->index,
-                            rb_ivar_get(self, rb_intern("name")));
-}
-
-/*
- *  call-seq:
- *     event_interface
- *
- *  Returns event interface name if the method is event.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *    method = WIN32OLE::Method.new(tobj, 'SheetActivate')
- *    puts method.event_interface # =>  WorkbookEvents
- */
-static VALUE
-folemethod_event_interface(VALUE self)
-{
-    BSTR name;
-    struct olemethoddata *pmethod;
-    HRESULT hr;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    if(folemethod_event(self) == Qtrue) {
-        hr = ole_docinfo_from_type(pmethod->pTypeInfo, &name, NULL, NULL, NULL);
-        if(SUCCEEDED(hr))
-            return WC2VSTR(name);
-    }
-    return Qnil;
-}
-
-static HRESULT
-ole_method_docinfo_from_type(
-    ITypeInfo *pTypeInfo,
-    UINT method_index,
-    BSTR *name,
-    BSTR *helpstr,
-    DWORD *helpcontext,
-    BSTR *helpfile
-    )
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return hr;
-    hr = pTypeInfo->lpVtbl->GetDocumentation(pTypeInfo, pFuncDesc->memid,
-                                             name, helpstr,
-                                             helpcontext, helpfile);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return hr;
-}
-
-static VALUE
-ole_method_helpstring(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    HRESULT hr;
-    BSTR bhelpstring;
-    hr = ole_method_docinfo_from_type(pTypeInfo, method_index, NULL, &bhelpstring,
-                                      NULL, NULL);
-    if (FAILED(hr))
-        return Qnil;
-    return WC2VSTR(bhelpstring);
-}
-
-/*
- *  call-seq:
- *     helpstring
- *
- *  Returns help string of OLE method. If the help string is not found,
- *  then the method returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Internet Controls', 'IWebBrowser')
- *     method = WIN32OLE::Method.new(tobj, 'Navigate')
- *     puts method.helpstring # => Navigates to a URL or file.
- *
- */
-static VALUE
-folemethod_helpstring(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_helpstring(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_helpfile(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    HRESULT hr;
-    BSTR bhelpfile;
-    hr = ole_method_docinfo_from_type(pTypeInfo, method_index, NULL, NULL,
-                                      NULL, &bhelpfile);
-    if (FAILED(hr))
-        return Qnil;
-    return WC2VSTR(bhelpfile);
-}
-
-/*
- *  call-seq:
- *     helpfile
- *
- *  Returns help file. If help file is not found, then
- *  the method returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.helpfile # => C:\...\VBAXL9.CHM
- */
-static VALUE
-folemethod_helpfile(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-
-    return ole_method_helpfile(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_helpcontext(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    HRESULT hr;
-    DWORD helpcontext = 0;
-    hr = ole_method_docinfo_from_type(pTypeInfo, method_index, NULL, NULL,
-                                      &helpcontext, NULL);
-    if (FAILED(hr))
-        return Qnil;
-    return RB_INT2FIX(helpcontext);
-}
-
-/*
- *  call-seq:
- *     helpcontext
- *
- *  Returns help context.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.helpcontext # => 65717
- */
-static VALUE
-folemethod_helpcontext(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_helpcontext(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_dispid(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE dispid = Qnil;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return dispid;
-    dispid = RB_INT2NUM(pFuncDesc->memid);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return dispid;
-}
-
-/*
- *  call-seq:
- *     dispid
- *
- *  Returns dispatch ID.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.dispid # => 181
- */
-static VALUE
-folemethod_dispid(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_dispid(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_offset_vtbl(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE offset_vtbl = Qnil;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return offset_vtbl;
-    offset_vtbl = RB_INT2FIX(pFuncDesc->oVft);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return offset_vtbl;
-}
-
-/*
- *  call-seq:
- *     offset_vtbl
- *
- *  Returns the offset ov VTBL.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbooks')
- *     method = WIN32OLE::Method.new(tobj, 'Add')
- *     puts method.offset_vtbl # => 40
- */
-static VALUE
-folemethod_offset_vtbl(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_offset_vtbl(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_size_params(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE size_params = Qnil;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return size_params;
-    size_params = RB_INT2FIX(pFuncDesc->cParams);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return size_params;
-}
-
-/*
- *  call-seq:
- *     size_params
- *
- *  Returns the size of arguments of the method.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     puts method.size_params # => 11
- *
- */
-static VALUE
-folemethod_size_params(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_size_params(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_size_opt_params(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE size_opt_params = Qnil;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return size_opt_params;
-    size_opt_params = RB_INT2FIX(pFuncDesc->cParamsOpt);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return size_opt_params;
-}
-
-/*
- *  call-seq:
- *     size_opt_params
- *
- *  Returns the size of optional parameters.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     puts method.size_opt_params # => 4
- */
-static VALUE
-folemethod_size_opt_params(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_size_opt_params(pmethod->pTypeInfo, pmethod->index);
-}
-
-static VALUE
-ole_method_params(ITypeInfo *pTypeInfo, UINT method_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    BSTR *bstrs;
-    UINT len, i;
-    VALUE param;
-    VALUE params = rb_ary_new();
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return params;
-
-    len = 0;
-    bstrs = ALLOCA_N(BSTR, pFuncDesc->cParams + 1);
-    hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, pFuncDesc->memid,
-                                     bstrs, pFuncDesc->cParams + 1,
-                                     &len);
-    if (FAILED(hr)) {
-        pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-        return params;
-    }
-    SysFreeString(bstrs[0]);
-    if (pFuncDesc->cParams > 0) {
-        for(i = 1; i < len; i++) {
-            param = create_win32ole_param(pTypeInfo, method_index, i-1, WC2VSTR(bstrs[i]));
-            rb_ary_push(params, param);
-         }
-     }
-     pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-     return params;
-}
-
-/*
- *  call-seq:
- *     params
- *
- *  returns array of WIN32OLE::Param object corresponding with method parameters.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     p method.params # => [Filename, FileFormat, Password, WriteResPassword,
- *                           ReadOnlyRecommended, CreateBackup, AccessMode,
- *                           ConflictResolution, AddToMru, TextCodepage,
- *                           TextVisualLayout]
- */
-static VALUE
-folemethod_params(VALUE self)
-{
-    struct olemethoddata *pmethod;
-    TypedData_Get_Struct(self, struct olemethoddata, &olemethod_datatype, pmethod);
-    return ole_method_params(pmethod->pTypeInfo, pmethod->index);
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the method name with class name.
- *
- */
-static VALUE
-folemethod_inspect(VALUE self)
-{
-    return default_inspect(self, "WIN32OLE::Method");
-}
-
-VALUE cWIN32OLE_METHOD;
-
-void Init_win32ole_method(void)
-{
-    cWIN32OLE_METHOD = rb_define_class_under(cWIN32OLE, "Method", rb_cObject);
-    /* Alias of WIN32OLE::Method, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_METHOD", cWIN32OLE_METHOD);
-    rb_define_alloc_func(cWIN32OLE_METHOD, folemethod_s_allocate);
-    rb_define_method(cWIN32OLE_METHOD, "initialize", folemethod_initialize, 2);
-    rb_define_method(cWIN32OLE_METHOD, "name", folemethod_name, 0);
-    rb_define_method(cWIN32OLE_METHOD, "return_type", folemethod_return_type, 0);
-    rb_define_method(cWIN32OLE_METHOD, "return_vtype", folemethod_return_vtype, 0);
-    rb_define_method(cWIN32OLE_METHOD, "return_type_detail", folemethod_return_type_detail, 0);
-    rb_define_method(cWIN32OLE_METHOD, "invoke_kind", folemethod_invoke_kind, 0);
-    rb_define_method(cWIN32OLE_METHOD, "invkind", folemethod_invkind, 0);
-    rb_define_method(cWIN32OLE_METHOD, "visible?", folemethod_visible, 0);
-    rb_define_method(cWIN32OLE_METHOD, "event?", folemethod_event, 0);
-    rb_define_method(cWIN32OLE_METHOD, "event_interface", folemethod_event_interface, 0);
-    rb_define_method(cWIN32OLE_METHOD, "helpstring", folemethod_helpstring, 0);
-    rb_define_method(cWIN32OLE_METHOD, "helpfile", folemethod_helpfile, 0);
-    rb_define_method(cWIN32OLE_METHOD, "helpcontext", folemethod_helpcontext, 0);
-    rb_define_method(cWIN32OLE_METHOD, "dispid", folemethod_dispid, 0);
-    rb_define_method(cWIN32OLE_METHOD, "offset_vtbl", folemethod_offset_vtbl, 0);
-    rb_define_method(cWIN32OLE_METHOD, "size_params", folemethod_size_params, 0);
-    rb_define_method(cWIN32OLE_METHOD, "size_opt_params", folemethod_size_opt_params, 0);
-    rb_define_method(cWIN32OLE_METHOD, "params", folemethod_params, 0);
-    rb_define_alias(cWIN32OLE_METHOD, "to_s", "name");
-    rb_define_method(cWIN32OLE_METHOD, "inspect", folemethod_inspect, 0);
-}
diff --git a/ext/win32ole/win32ole_method.h b/ext/win32ole/win32ole_method.h
deleted file mode 100644
index ef907d2fac..0000000000
--- a/ext/win32ole/win32ole_method.h
+++ /dev/null
@@ -1,16 +0,0 @@
-#ifndef WIN32OLE_METHOD_H
-#define WIN32OLE_METHOD_H 1
-
-struct olemethoddata {
-    ITypeInfo *pOwnerTypeInfo;
-    ITypeInfo *pTypeInfo;
-    UINT index;
-};
-
-extern VALUE cWIN32OLE_METHOD;
-VALUE folemethod_s_allocate(VALUE klass);
-VALUE ole_methods_from_typeinfo(ITypeInfo *pTypeInfo, int mask);
-VALUE create_win32ole_method(ITypeInfo *pTypeInfo, VALUE name);
-struct olemethoddata *olemethod_data_get_struct(VALUE obj);
-void Init_win32ole_method(void);
-#endif
diff --git a/ext/win32ole/win32ole_param.c b/ext/win32ole/win32ole_param.c
deleted file mode 100644
index 0c4b185921..0000000000
--- a/ext/win32ole/win32ole_param.c
+++ /dev/null
@@ -1,440 +0,0 @@
-#include "win32ole.h"
-
-VALUE cWIN32OLE_PARAM;
-
-struct oleparamdata {
-    ITypeInfo *pTypeInfo;
-    UINT method_index;
-    UINT index;
-};
-
-static void oleparam_free(void *ptr);
-static size_t oleparam_size(const void *ptr);
-static VALUE foleparam_s_allocate(VALUE klass);
-static VALUE oleparam_ole_param_from_index(VALUE self, ITypeInfo *pTypeInfo, UINT method_index, int param_index);
-static VALUE oleparam_ole_param(VALUE self, VALUE olemethod, int n);
-static VALUE foleparam_initialize(VALUE self, VALUE olemethod, VALUE n);
-static VALUE foleparam_name(VALUE self);
-static VALUE ole_param_ole_type(ITypeInfo *pTypeInfo, UINT method_index, UINT index);
-static VALUE foleparam_ole_type(VALUE self);
-static VALUE ole_param_ole_type_detail(ITypeInfo *pTypeInfo, UINT method_index, UINT index);
-static VALUE foleparam_ole_type_detail(VALUE self);
-static VALUE ole_param_flag_mask(ITypeInfo *pTypeInfo, UINT method_index, UINT index, USHORT mask);
-static VALUE foleparam_input(VALUE self);
-static VALUE foleparam_output(VALUE self);
-static VALUE foleparam_optional(VALUE self);
-static VALUE foleparam_retval(VALUE self);
-static VALUE ole_param_default(ITypeInfo *pTypeInfo, UINT method_index, UINT index);
-static VALUE foleparam_default(VALUE self);
-static VALUE foleparam_inspect(VALUE self);
-
-static const rb_data_type_t oleparam_datatype = {
-    "win32ole_param",
-    {NULL, oleparam_free, oleparam_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static void
-oleparam_free(void *ptr)
-{
-    struct oleparamdata *pole = ptr;
-    OLE_FREE(pole->pTypeInfo);
-    free(pole);
-}
-
-static size_t
-oleparam_size(const void *ptr)
-{
-    return ptr ? sizeof(struct oleparamdata) : 0;
-}
-
-VALUE
-create_win32ole_param(ITypeInfo *pTypeInfo, UINT method_index, UINT index, VALUE name)
-{
-    struct oleparamdata *pparam;
-    VALUE obj = foleparam_s_allocate(cWIN32OLE_PARAM);
-    TypedData_Get_Struct(obj, struct oleparamdata, &oleparam_datatype, pparam);
-
-    pparam->pTypeInfo = pTypeInfo;
-    OLE_ADDREF(pTypeInfo);
-    pparam->method_index = method_index;
-    pparam->index = index;
-    rb_ivar_set(obj, rb_intern("name"), name);
-    return obj;
-}
-
-/*
- * Document-class: WIN32OLE::Param
- *
- *   +WIN32OLE::Param+ objects represent param information of
- *   the OLE method.
- */
-static VALUE
-foleparam_s_allocate(VALUE klass)
-{
-    struct oleparamdata *pparam;
-    VALUE obj;
-    obj = TypedData_Make_Struct(klass,
-                                struct oleparamdata,
-                                &oleparam_datatype, pparam);
-    pparam->pTypeInfo = NULL;
-    pparam->method_index = 0;
-    pparam->index = 0;
-    return obj;
-}
-
-static VALUE
-oleparam_ole_param_from_index(VALUE self, ITypeInfo *pTypeInfo, UINT method_index, int param_index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    BSTR *bstrs;
-    UINT len;
-    struct oleparamdata *pparam;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        ole_raise(hr, rb_eRuntimeError, "fail to ITypeInfo::GetFuncDesc");
-
-    len = 0;
-    bstrs = ALLOCA_N(BSTR, pFuncDesc->cParams + 1);
-    hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, pFuncDesc->memid,
-                                     bstrs, pFuncDesc->cParams + 1,
-                                     &len);
-    if (FAILED(hr)) {
-        pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-        ole_raise(hr, rb_eRuntimeError, "fail to ITypeInfo::GetNames");
-    }
-    SysFreeString(bstrs[0]);
-    if (param_index < 1 || len <= (UINT)param_index)
-    {
-        pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-        rb_raise(rb_eIndexError, "index of param must be in 1..%d", len);
-    }
-
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    pparam->pTypeInfo = pTypeInfo;
-    OLE_ADDREF(pTypeInfo);
-    pparam->method_index = method_index;
-    pparam->index = param_index - 1;
-    rb_ivar_set(self, rb_intern("name"), WC2VSTR(bstrs[param_index]));
-
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return self;
-}
-
-static VALUE
-oleparam_ole_param(VALUE self, VALUE olemethod, int n)
-{
-    struct olemethoddata *pmethod = olemethod_data_get_struct(olemethod);
-    return oleparam_ole_param_from_index(self, pmethod->pTypeInfo, pmethod->index, n);
-}
-
-/*
- * call-seq:
- *    new(method, n) -> WIN32OLE::Param object
- *
- * Returns WIN32OLE::Param object which represents OLE parameter information.
- * 1st argument should be WIN32OLE::Method object.
- * 2nd argument `n' is n-th parameter of the method specified by 1st argument.
- *
- *    tobj = WIN32OLE::Type.new('Microsoft Scripting Runtime', 'IFileSystem')
- *    method = WIN32OLE::Method.new(tobj, 'CreateTextFile')
- *    param = WIN32OLE::Param.new(method, 2) # => #<WIN32OLE::Param:Overwrite=true>
- *
- */
-static VALUE
-foleparam_initialize(VALUE self, VALUE olemethod, VALUE n)
-{
-    int idx;
-    if (!rb_obj_is_kind_of(olemethod, cWIN32OLE_METHOD)) {
-        rb_raise(rb_eTypeError, "1st parameter must be WIN32OLE::Method object");
-    }
-    idx = RB_FIX2INT(n);
-    return oleparam_ole_param(self, olemethod, idx);
-}
-
-/*
- *  call-seq:
- *     name
- *
- *  Returns name.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     param1 = method.params[0]
- *     puts param1.name # => Filename
- */
-static VALUE
-foleparam_name(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("name"));
-}
-
-static VALUE
-ole_param_ole_type(ITypeInfo *pTypeInfo, UINT method_index, UINT index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE type = rb_str_new2("unknown type");
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return type;
-    type = ole_typedesc2val(pTypeInfo,
-                            &(pFuncDesc->lprgelemdescParam[index].tdesc), Qnil);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return type;
-}
-
-/*
- *  call-seq:
- *     ole_type
- *
- *  Returns OLE type of WIN32OLE::Param object(parameter of OLE method).
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     param1 = method.params[0]
- *     puts param1.ole_type # => VARIANT
- */
-static VALUE
-foleparam_ole_type(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_ole_type(pparam->pTypeInfo, pparam->method_index,
-                              pparam->index);
-}
-
-static VALUE
-ole_param_ole_type_detail(ITypeInfo *pTypeInfo, UINT method_index, UINT index)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE typedetail = rb_ary_new();
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return typedetail;
-    ole_typedesc2val(pTypeInfo,
-                     &(pFuncDesc->lprgelemdescParam[index].tdesc), typedetail);
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return typedetail;
-}
-
-/*
- *  call-seq:
- *     ole_type_detail
- *
- *  Returns detail information of type of argument.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'IWorksheetFunction')
- *     method = WIN32OLE::Method.new(tobj, 'SumIf')
- *     param1 = method.params[0]
- *     p param1.ole_type_detail # => ["PTR", "USERDEFINED", "Range"]
- */
-static VALUE
-foleparam_ole_type_detail(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_ole_type_detail(pparam->pTypeInfo, pparam->method_index,
-                                     pparam->index);
-}
-
-static VALUE
-ole_param_flag_mask(ITypeInfo *pTypeInfo, UINT method_index, UINT index, USHORT mask)
-{
-    FUNCDESC *pFuncDesc;
-    HRESULT hr;
-    VALUE ret = Qfalse;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if(FAILED(hr))
-        return ret;
-    if (V_UNION1((&(pFuncDesc->lprgelemdescParam[index])), paramdesc).wParamFlags &mask)
-        ret = Qtrue;
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return ret;
-}
-
-/*
- *  call-seq:
- *     input?
- *
- *  Returns true if the parameter is input.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     param1 = method.params[0]
- *     puts param1.input? # => true
- */
-static VALUE
-foleparam_input(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_flag_mask(pparam->pTypeInfo, pparam->method_index,
-                               pparam->index, PARAMFLAG_FIN);
-}
-
-/*
- *  call-seq:
- *     output?
- *
- *  Returns true if argument is output.
- *     tobj = WIN32OLE::Type.new('Microsoft Internet Controls', 'DWebBrowserEvents')
- *     method = WIN32OLE::Method.new(tobj, 'NewWindow')
- *     method.params.each do |param|
- *       puts "#{param.name} #{param.output?}"
- *     end
- *
- *  The result of above script is following:
- *    URL false
- *    Flags false
- *    TargetFrameName false
- *    PostData false
- *    Headers false
- *    Processed true
- */
-static VALUE
-foleparam_output(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_flag_mask(pparam->pTypeInfo, pparam->method_index,
-                               pparam->index, PARAMFLAG_FOUT);
-}
-
-/*
- *  call-seq:
- *     optional?
- *
- *  Returns true if argument is optional.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     param1 = method.params[0]
- *     puts "#{param1.name} #{param1.optional?}" # => Filename true
- */
-static VALUE
-foleparam_optional(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_flag_mask(pparam->pTypeInfo, pparam->method_index,
-                               pparam->index, PARAMFLAG_FOPT);
-}
-
-/*
- *  call-seq:
- *     retval?
- *
- *  Returns true if argument is return value.
- *     tobj = WIN32OLE::Type.new('DirectX 7 for Visual Basic Type Library',
- *                               'DirectPlayLobbyConnection')
- *     method = WIN32OLE::Method.new(tobj, 'GetPlayerShortName')
- *     param = method.params[0]
- *     puts "#{param.name} #{param.retval?}"  # => name true
- */
-static VALUE
-foleparam_retval(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_flag_mask(pparam->pTypeInfo, pparam->method_index,
-                               pparam->index, PARAMFLAG_FRETVAL);
-}
-
-static VALUE
-ole_param_default(ITypeInfo *pTypeInfo, UINT method_index, UINT index)
-{
-    FUNCDESC *pFuncDesc;
-    ELEMDESC *pElemDesc;
-    PARAMDESCEX * pParamDescEx;
-    HRESULT hr;
-    USHORT wParamFlags;
-    USHORT mask = PARAMFLAG_FOPT|PARAMFLAG_FHASDEFAULT;
-    VALUE defval = Qnil;
-    hr = pTypeInfo->lpVtbl->GetFuncDesc(pTypeInfo, method_index, &pFuncDesc);
-    if (FAILED(hr))
-        return defval;
-    pElemDesc = &pFuncDesc->lprgelemdescParam[index];
-    wParamFlags = V_UNION1(pElemDesc, paramdesc).wParamFlags;
-    if ((wParamFlags & mask) == mask) {
-         pParamDescEx = V_UNION1(pElemDesc, paramdesc).pparamdescex;
-         defval = ole_variant2val(&pParamDescEx->varDefaultValue);
-    }
-    pTypeInfo->lpVtbl->ReleaseFuncDesc(pTypeInfo, pFuncDesc);
-    return defval;
-}
-
-/*
- *  call-seq:
- *     default
- *
- *  Returns default value. If the default value does not exist,
- *  this method returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Workbook')
- *     method = WIN32OLE::Method.new(tobj, 'SaveAs')
- *     method.params.each do |param|
- *       if param.default
- *         puts "#{param.name} (= #{param.default})"
- *       else
- *         puts "#{param}"
- *       end
- *     end
- *
- *  The above script result is following:
- *      Filename
- *      FileFormat
- *      Password
- *      WriteResPassword
- *      ReadOnlyRecommended
- *      CreateBackup
- *      AccessMode (= 1)
- *      ConflictResolution
- *      AddToMru
- *      TextCodepage
- *      TextVisualLayout
- */
-static VALUE
-foleparam_default(VALUE self)
-{
-    struct oleparamdata *pparam;
-    TypedData_Get_Struct(self, struct oleparamdata, &oleparam_datatype, pparam);
-    return ole_param_default(pparam->pTypeInfo, pparam->method_index,
-                             pparam->index);
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the parameter name with class name. If the parameter has default value,
- *  then returns name=value string with class name.
- *
- */
-static VALUE
-foleparam_inspect(VALUE self)
-{
-    VALUE detail = foleparam_name(self);
-    VALUE defval = foleparam_default(self);
-    if (defval != Qnil) {
-        rb_str_cat2(detail, "=");
-        rb_str_concat(detail, rb_inspect(defval));
-    }
-    return make_inspect("WIN32OLE::Param", detail);
-}
-
-void
-Init_win32ole_param(void)
-{
-    cWIN32OLE_PARAM = rb_define_class_under(cWIN32OLE, "Param", rb_cObject);
-    /* Alias of WIN32OLE::Param, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_PARAM", cWIN32OLE_PARAM);
-    rb_define_alloc_func(cWIN32OLE_PARAM, foleparam_s_allocate);
-    rb_define_method(cWIN32OLE_PARAM, "initialize", foleparam_initialize, 2);
-    rb_define_method(cWIN32OLE_PARAM, "name", foleparam_name, 0);
-    rb_define_method(cWIN32OLE_PARAM, "ole_type", foleparam_ole_type, 0);
-    rb_define_method(cWIN32OLE_PARAM, "ole_type_detail", foleparam_ole_type_detail, 0);
-    rb_define_method(cWIN32OLE_PARAM, "input?", foleparam_input, 0);
-    rb_define_method(cWIN32OLE_PARAM, "output?", foleparam_output, 0);
-    rb_define_method(cWIN32OLE_PARAM, "optional?", foleparam_optional, 0);
-    rb_define_method(cWIN32OLE_PARAM, "retval?", foleparam_retval, 0);
-    rb_define_method(cWIN32OLE_PARAM, "default", foleparam_default, 0);
-    rb_define_alias(cWIN32OLE_PARAM, "to_s", "name");
-    rb_define_method(cWIN32OLE_PARAM, "inspect", foleparam_inspect, 0);
-}
diff --git a/ext/win32ole/win32ole_param.h b/ext/win32ole/win32ole_param.h
deleted file mode 100644
index 7e2650cb44..0000000000
--- a/ext/win32ole/win32ole_param.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef WIN32OLE_PARAM_H
-#define WIN32OLE_PARAM_H
-
-VALUE create_win32ole_param(ITypeInfo *pTypeInfo, UINT method_index, UINT index, VALUE name);
-void Init_win32ole_param(void);
-
-#endif
-
diff --git a/ext/win32ole/win32ole_record.c b/ext/win32ole/win32ole_record.c
deleted file mode 100644
index 02f05a3fa7..0000000000
--- a/ext/win32ole/win32ole_record.c
+++ /dev/null
@@ -1,608 +0,0 @@
-#include "win32ole.h"
-
-struct olerecorddata {
-    IRecordInfo *pri;
-    void *pdata;
-};
-
-static HRESULT recordinfo_from_itypelib(ITypeLib *pTypeLib, VALUE name, IRecordInfo **ppri);
-static int hash2olerec(VALUE key, VALUE val, VALUE rec);
-static void olerecord_free(void *pvar);
-static size_t olerecord_size(const void *ptr);
-static VALUE folerecord_s_allocate(VALUE klass);
-static VALUE folerecord_initialize(VALUE self, VALUE typename, VALUE oleobj);
-static VALUE folerecord_to_h(VALUE self);
-static VALUE folerecord_typename(VALUE self);
-static VALUE olerecord_ivar_get(VALUE self, VALUE name);
-static VALUE olerecord_ivar_set(VALUE self, VALUE name, VALUE val);
-static VALUE folerecord_method_missing(int argc, VALUE *argv, VALUE self);
-static VALUE folerecord_ole_instance_variable_get(VALUE self, VALUE name);
-static VALUE folerecord_ole_instance_variable_set(VALUE self, VALUE name, VALUE val);
-static VALUE folerecord_inspect(VALUE self);
-
-static const rb_data_type_t olerecord_datatype = {
-    "win32ole_record",
-    {NULL, olerecord_free, olerecord_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static HRESULT
-recordinfo_from_itypelib(ITypeLib *pTypeLib, VALUE name, IRecordInfo **ppri)
-{
-
-    unsigned int count;
-    unsigned int i;
-    ITypeInfo *pTypeInfo;
-    HRESULT hr = OLE_E_LAST;
-    BSTR bstr;
-
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (i = 0; i < count; i++) {
-        hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, i,
-                                                &bstr, NULL, NULL, NULL);
-        if (FAILED(hr))
-            continue;
-
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, i, &pTypeInfo);
-        if (FAILED(hr))
-            continue;
-
-        if (rb_str_cmp(WC2VSTR(bstr), name) == 0) {
-            hr = GetRecordInfoFromTypeInfo(pTypeInfo, ppri);
-            OLE_RELEASE(pTypeInfo);
-            return hr;
-        }
-        OLE_RELEASE(pTypeInfo);
-    }
-    hr = OLE_E_LAST;
-    return hr;
-}
-
-static int
-hash2olerec(VALUE key, VALUE val, VALUE rec)
-{
-    VARIANT var;
-    OLECHAR *pbuf;
-    struct olerecorddata *prec;
-    IRecordInfo *pri;
-    HRESULT hr;
-
-    if (val != Qnil) {
-        TypedData_Get_Struct(rec, struct olerecorddata, &olerecord_datatype, prec);
-        pri = prec->pri;
-        VariantInit(&var);
-        ole_val2variant(val, &var);
-        pbuf = ole_vstr2wc(key);
-        hr = pri->lpVtbl->PutField(pri, INVOKE_PROPERTYPUT, prec->pdata, pbuf, &var);
-        SysFreeString(pbuf);
-        VariantClear(&var);
-        if (FAILED(hr)) {
-            ole_raise(hr, eWIN32OLERuntimeError, "failed to putfield of `%s`", StringValuePtr(key));
-        }
-    }
-    return ST_CONTINUE;
-}
-
-void
-ole_rec2variant(VALUE rec, VARIANT *var)
-{
-    struct olerecorddata *prec;
-    ULONG size = 0;
-    IRecordInfo *pri;
-    HRESULT hr;
-    VALUE fields;
-    TypedData_Get_Struct(rec, struct olerecorddata, &olerecord_datatype, prec);
-    pri = prec->pri;
-    if (pri) {
-        hr = pri->lpVtbl->GetSize(pri, &size);
-        if (FAILED(hr)) {
-            ole_raise(hr, eWIN32OLERuntimeError, "failed to get size for allocation of VT_RECORD object");
-        }
-        if (prec->pdata) {
-            free(prec->pdata);
-        }
-        prec->pdata = ALLOC_N(char, size);
-        if (!prec->pdata) {
-            rb_raise(rb_eRuntimeError, "failed to memory allocation of %lu bytes", (unsigned long)size);
-        }
-        hr = pri->lpVtbl->RecordInit(pri, prec->pdata);
-        if (FAILED(hr)) {
-            ole_raise(hr, eWIN32OLERuntimeError, "failed to initialize VT_RECORD object");
-        }
-        fields = folerecord_to_h(rec);
-        rb_hash_foreach(fields, hash2olerec, rec);
-        V_RECORDINFO(var) = pri;
-        V_RECORD(var) = prec->pdata;
-        V_VT(var) = VT_RECORD;
-    } else {
-        rb_raise(eWIN32OLERuntimeError, "failed to retrieve IRecordInfo interface");
-    }
-}
-
-void
-olerecord_set_ivar(VALUE obj, IRecordInfo *pri, void *prec)
-{
-    HRESULT hr;
-    BSTR bstr;
-    BSTR *bstrs;
-    ULONG count = 0;
-    ULONG i;
-    VALUE fields;
-    VALUE val;
-    VARIANT var;
-    void *pdata = NULL;
-    struct olerecorddata *pvar;
-
-    TypedData_Get_Struct(obj, struct olerecorddata, &olerecord_datatype, pvar);
-    OLE_ADDREF(pri);
-    OLE_RELEASE(pvar->pri);
-    pvar->pri = pri;
-
-    hr = pri->lpVtbl->GetName(pri, &bstr);
-    if (SUCCEEDED(hr)) {
-        rb_ivar_set(obj, rb_intern("typename"), WC2VSTR(bstr));
-    }
-
-    hr = pri->lpVtbl->GetFieldNames(pri, &count, NULL);
-    if (FAILED(hr) || count == 0)
-        return;
-    bstrs = ALLOCA_N(BSTR, count);
-    hr = pri->lpVtbl->GetFieldNames(pri, &count, bstrs);
-    if (FAILED(hr)) {
-        return;
-    }
-
-    fields = rb_hash_new();
-    rb_ivar_set(obj, rb_intern("fields"), fields);
-    for (i = 0; i < count; i++) {
-        pdata = NULL;
-        VariantInit(&var);
-        val = Qnil;
-        if (prec) {
-            hr = pri->lpVtbl->GetFieldNoCopy(pri, prec, bstrs[i], &var, &pdata);
-            if (SUCCEEDED(hr)) {
-                val = ole_variant2val(&var);
-            }
-        }
-        rb_hash_aset(fields, WC2VSTR(bstrs[i]), val);
-    }
-}
-
-VALUE
-create_win32ole_record(IRecordInfo *pri, void *prec)
-{
-    VALUE obj = folerecord_s_allocate(cWIN32OLE_RECORD);
-    olerecord_set_ivar(obj, pri, prec);
-    return obj;
-}
-
-/*
- * Document-class: WIN32OLE::Record
- *
- *   +WIN32OLE::Record+ objects represents VT_RECORD OLE variant.
- *   Win32OLE returns WIN32OLE::Record object if the result value of invoking
- *   OLE methods.
- *
- *   If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         Public Structure Book
- *             <MarshalAs(UnmanagedType.BStr)> _
- *             Public title As String
- *             Public cost As Integer
- *         End Structure
- *         Public Function getBook() As Book
- *             Dim book As New Book
- *             book.title = "The Ruby Book"
- *             book.cost = 20
- *             Return book
- *         End Function
- *     End Class
- *
- *   then, you can retrieve getBook return value from the following
- *   Ruby script:
- *
- *     require 'win32ole'
- *     obj = WIN32OLE.new('ComServer.ComClass')
- *     book = obj.getBook
- *     book.class # => WIN32OLE::Record
- *     book.title # => "The Ruby Book"
- *     book.cost  # => 20
- *
- */
-
-static void
-olerecord_free(void *ptr) {
-    struct olerecorddata *pvar = ptr;
-    OLE_FREE(pvar->pri);
-    if (pvar->pdata) {
-        free(pvar->pdata);
-    }
-    free(pvar);
-}
-
-static size_t
-olerecord_size(const void *ptr)
-{
-    const struct olerecorddata *pvar = ptr;
-    size_t s = 0;
-    ULONG size = 0;
-    HRESULT hr;
-    if (ptr) {
-        s += sizeof(struct olerecorddata);
-        if (pvar->pri) {
-            hr = pvar->pri->lpVtbl->GetSize(pvar->pri, &size);
-            if (SUCCEEDED(hr)) {
-                s += size;
-            }
-        }
-    }
-    return s;
-}
-
-static VALUE
-folerecord_s_allocate(VALUE klass) {
-    VALUE obj = Qnil;
-    struct olerecorddata *pvar;
-    obj = TypedData_Make_Struct(klass, struct olerecorddata, &olerecord_datatype, pvar);
-    pvar->pri = NULL;
-    pvar->pdata = NULL;
-    return obj;
-}
-
-/*
- * call-seq:
- *    new(typename, obj) -> WIN32OLE::Record object
- *
- * Returns WIN32OLE::Record object. The first argument is struct name (String
- * or Symbol).
- * The second parameter obj should be WIN32OLE object or WIN32OLE::TypeLib object.
- * If COM server in VB.NET ComServer project is the following:
- *
- *   Imports System.Runtime.InteropServices
- *   Public Class ComClass
- *       Public Structure Book
- *           <MarshalAs(UnmanagedType.BStr)> _
- *           Public title As String
- *           Public cost As Integer
- *       End Structure
- *   End Class
- *
- * then, you can create WIN32OLE::Record object is as following:
- *
- *   require 'win32ole'
- *   obj = WIN32OLE.new('ComServer.ComClass')
- *   book1 = WIN32OLE::Record.new('Book', obj) # => WIN32OLE::Record object
- *   tlib = obj.ole_typelib
- *   book2 = WIN32OLE::Record.new('Book', tlib) # => WIN32OLE::Record object
- *
- */
-static VALUE
-folerecord_initialize(VALUE self, VALUE typename, VALUE oleobj) {
-    HRESULT hr;
-    ITypeLib *pTypeLib = NULL;
-    IRecordInfo *pri = NULL;
-
-    if (!RB_TYPE_P(typename, T_STRING) && !RB_TYPE_P(typename, T_SYMBOL)) {
-        rb_raise(rb_eArgError, "1st argument should be String or Symbol");
-    }
-    if (RB_TYPE_P(typename, T_SYMBOL)) {
-        typename = rb_sym2str(typename);
-    }
-
-    hr = S_OK;
-    if(rb_obj_is_kind_of(oleobj, cWIN32OLE)) {
-        hr = typelib_from_val(oleobj, &pTypeLib);
-    } else if (rb_obj_is_kind_of(oleobj, cWIN32OLE_TYPELIB)) {
-        pTypeLib = itypelib(oleobj);
-        OLE_ADDREF(pTypeLib);
-        if (pTypeLib) {
-            hr = S_OK;
-        } else {
-            hr = E_FAIL;
-        }
-    } else {
-        rb_raise(rb_eArgError, "2nd argument should be WIN32OLE object or WIN32OLE::TypeLib object");
-    }
-
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "fail to query ITypeLib interface");
-    }
-
-    hr = recordinfo_from_itypelib(pTypeLib, typename, &pri);
-    OLE_RELEASE(pTypeLib);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "fail to query IRecordInfo interface for `%s'", StringValuePtr(typename));
-    }
-
-    olerecord_set_ivar(self, pri, NULL);
-
-    return self;
-}
-
-/*
- *  call-seq:
- *     WIN32OLE::Record#to_h #=> Ruby Hash object.
- *
- *  Returns Ruby Hash object which represents VT_RECORD variable.
- *  The keys of Hash object are member names of VT_RECORD OLE variable and
- *  the values of Hash object are values of VT_RECORD OLE variable.
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         Public Structure Book
- *             <MarshalAs(UnmanagedType.BStr)> _
- *             Public title As String
- *             Public cost As Integer
- *         End Structure
- *         Public Function getBook() As Book
- *             Dim book As New Book
- *             book.title = "The Ruby Book"
- *             book.cost = 20
- *             Return book
- *         End Function
- *     End Class
- *
- *  then, the result of WIN32OLE::Record#to_h is the following:
- *
- *     require 'win32ole'
- *     obj = WIN32OLE.new('ComServer.ComClass')
- *     book = obj.getBook
- *     book.to_h # => {"title"=>"The Ruby Book", "cost"=>20}
- *
- */
-static VALUE
-folerecord_to_h(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("fields"));
-}
-
-/*
- *  call-seq:
- *     typename #=> String object
- *
- *  Returns the type name of VT_RECORD OLE variable.
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         Public Structure Book
- *             <MarshalAs(UnmanagedType.BStr)> _
- *             Public title As String
- *             Public cost As Integer
- *         End Structure
- *         Public Function getBook() As Book
- *             Dim book As New Book
- *             book.title = "The Ruby Book"
- *             book.cost = 20
- *             Return book
- *         End Function
- *     End Class
- *
- *  then, the result of WIN32OLE::Record#typename is the following:
- *
- *     require 'win32ole'
- *     obj = WIN32OLE.new('ComServer.ComClass')
- *     book = obj.getBook
- *     book.typename # => "Book"
- *
- */
-static VALUE
-folerecord_typename(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("typename"));
-}
-
-static VALUE
-olerecord_ivar_get(VALUE self, VALUE name)
-{
-    VALUE fields;
-    fields = rb_ivar_get(self, rb_intern("fields"));
-    return rb_hash_fetch(fields, name);
-}
-
-static VALUE
-olerecord_ivar_set(VALUE self, VALUE name, VALUE val)
-{
-    long len;
-    char *p;
-    VALUE fields;
-    len  = RSTRING_LEN(name);
-    p = RSTRING_PTR(name);
-    if (p[len-1] == '=') {
-        name = rb_str_subseq(name, 0, len-1);
-    }
-    fields = rb_ivar_get(self, rb_intern("fields"));
-    rb_hash_fetch(fields, name);
-    return rb_hash_aset(fields, name, val);
-}
-
-/*
- *  call-seq:
- *     method_missing(name)
- *
- *  Returns value specified by the member name of VT_RECORD OLE variable.
- *  Or sets value specified by the member name of VT_RECORD OLE variable.
- *  If the member name is not correct, KeyError exception is raised.
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         Public Structure Book
- *             <MarshalAs(UnmanagedType.BStr)> _
- *             Public title As String
- *             Public cost As Integer
- *         End Structure
- *     End Class
- *
- *  Then getting/setting value from Ruby is as the following:
- *
- *     obj = WIN32OLE.new('ComServer.ComClass')
- *     book = WIN32OLE::Record.new('Book', obj)
- *     book.title # => nil ( book.method_missing(:title) is invoked. )
- *     book.title = "Ruby" # ( book.method_missing(:title=, "Ruby") is invoked. )
- */
-static VALUE
-folerecord_method_missing(int argc, VALUE *argv, VALUE self)
-{
-    VALUE name;
-    rb_check_arity(argc, 1, 2);
-    name = rb_sym2str(argv[0]);
-
-#if SIZEOF_SIZE_T > SIZEOF_LONG
-    {
-        size_t n = strlen(StringValueCStr(name));
-        if (n >= LONG_MAX) {
-            rb_raise(rb_eRuntimeError, "too long member name");
-        }
-    }
-#endif
-
-    if (argc == 1) {
-        return olerecord_ivar_get(self, name);
-    } else if (argc == 2) {
-        return olerecord_ivar_set(self, name, argv[1]);
-    }
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     ole_instance_variable_get(name)
- *
- *  Returns value specified by the member name of VT_RECORD OLE object.
- *  If the member name is not correct, KeyError exception is raised.
- *  If you can't access member variable of VT_RECORD OLE object directly,
- *  use this method.
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         Public Structure ComObject
- *             Public object_id As Ineger
- *         End Structure
- *     End Class
- *
- *  and Ruby Object class has title attribute:
- *
- *  then accessing object_id of ComObject from Ruby is as the following:
- *
- *     srver = WIN32OLE.new('ComServer.ComClass')
- *     obj = WIN32OLE::Record.new('ComObject', server)
- *     # obj.object_id returns Ruby Object#object_id
- *     obj.ole_instance_variable_get(:object_id) # => nil
- *
- */
-static VALUE
-folerecord_ole_instance_variable_get(VALUE self, VALUE name)
-{
-    VALUE sname;
-    if(!RB_TYPE_P(name, T_STRING) && !RB_TYPE_P(name, T_SYMBOL)) {
-        rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-    }
-    sname = name;
-    if (RB_TYPE_P(name, T_SYMBOL)) {
-        sname = rb_sym2str(name);
-    }
-    return olerecord_ivar_get(self, sname);
-}
-
-/*
- *  call-seq:
- *     ole_instance_variable_set(name, val)
- *
- *  Sets value specified by the member name of VT_RECORD OLE object.
- *  If the member name is not correct, KeyError exception is raised.
- *  If you can't set value of member of VT_RECORD OLE object directly,
- *  use this method.
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         <MarshalAs(UnmanagedType.BStr)> _
- *         Public title As String
- *         Public cost As Integer
- *     End Class
- *
- *  then setting value of the `title' member is as following:
- *
- *     srver = WIN32OLE.new('ComServer.ComClass')
- *     obj = WIN32OLE::Record.new('Book', server)
- *     obj.ole_instance_variable_set(:title, "The Ruby Book")
- *
- */
-static VALUE
-folerecord_ole_instance_variable_set(VALUE self, VALUE name, VALUE val)
-{
-    VALUE sname;
-    if(!RB_TYPE_P(name, T_STRING) && !RB_TYPE_P(name, T_SYMBOL)) {
-        rb_raise(rb_eTypeError, "wrong argument type (expected String or Symbol)");
-    }
-    sname = name;
-    if (RB_TYPE_P(name, T_SYMBOL)) {
-        sname = rb_sym2str(name);
-    }
-    return olerecord_ivar_set(self, sname, val);
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the OLE struct name and member name and the value of member
- *
- *  If COM server in VB.NET ComServer project is the following:
- *
- *     Imports System.Runtime.InteropServices
- *     Public Class ComClass
- *         <MarshalAs(UnmanagedType.BStr)> _
- *         Public title As String
- *         Public cost As Integer
- *     End Class
- *
- *  then
- *
- *     srver = WIN32OLE.new('ComServer.ComClass')
- *     obj = WIN32OLE::Record.new('Book', server)
- *     obj.inspect # => <WIN32OLE::Record(ComClass) {"title" => nil, "cost" => nil}>
- *
- */
-static VALUE
-folerecord_inspect(VALUE self)
-{
-    VALUE tname;
-    VALUE field;
-    tname = folerecord_typename(self);
-    if (tname == Qnil) {
-        tname = rb_inspect(tname);
-    }
-    field = rb_inspect(folerecord_to_h(self));
-    return rb_sprintf("#<WIN32OLE::Record(%"PRIsVALUE") %"PRIsVALUE">",
-                      tname,
-                      field);
-}
-
-VALUE cWIN32OLE_RECORD;
-
-void
-Init_win32ole_record(void)
-{
-    cWIN32OLE_RECORD = rb_define_class_under(cWIN32OLE, "Record", rb_cObject);
-    /* Alias of WIN32OLE::Record, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_RECORD", cWIN32OLE_RECORD);
-    rb_define_alloc_func(cWIN32OLE_RECORD, folerecord_s_allocate);
-    rb_define_method(cWIN32OLE_RECORD, "initialize", folerecord_initialize, 2);
-    rb_define_method(cWIN32OLE_RECORD, "to_h", folerecord_to_h, 0);
-    rb_define_method(cWIN32OLE_RECORD, "typename", folerecord_typename, 0);
-    rb_define_method(cWIN32OLE_RECORD, "method_missing", folerecord_method_missing, -1);
-    rb_define_method(cWIN32OLE_RECORD, "ole_instance_variable_get", folerecord_ole_instance_variable_get, 1);
-    rb_define_method(cWIN32OLE_RECORD, "ole_instance_variable_set", folerecord_ole_instance_variable_set, 2);
-    rb_define_method(cWIN32OLE_RECORD, "inspect", folerecord_inspect, 0);
-}
diff --git a/ext/win32ole/win32ole_record.h b/ext/win32ole/win32ole_record.h
deleted file mode 100644
index ab1df0ee7f..0000000000
--- a/ext/win32ole/win32ole_record.h
+++ /dev/null
@@ -1,10 +0,0 @@
-#ifndef WIN32OLE_RECORD_H
-#define WIN32OLE_RECORD_H 1
-
-extern VALUE cWIN32OLE_RECORD;
-void ole_rec2variant(VALUE rec, VARIANT *var);
-void olerecord_set_ivar(VALUE obj, IRecordInfo *pri, void *prec);
-VALUE create_win32ole_record(IRecordInfo *pri, void *prec);
-void Init_win32ole_record(void);
-
-#endif
diff --git a/ext/win32ole/win32ole_type.c b/ext/win32ole/win32ole_type.c
deleted file mode 100644
index 45b16d6722..0000000000
--- a/ext/win32ole/win32ole_type.c
+++ /dev/null
@@ -1,922 +0,0 @@
-#include "win32ole.h"
-
-struct oletypedata {
-    ITypeInfo *pTypeInfo;
-};
-
-static void oletype_free(void *ptr);
-static size_t oletype_size(const void *ptr);
-static VALUE foletype_s_ole_classes(VALUE self, VALUE typelib);
-static VALUE foletype_s_typelibs(VALUE self);
-static VALUE foletype_s_progids(VALUE self);
-static VALUE oletype_set_member(VALUE self, ITypeInfo *pTypeInfo, VALUE name);
-static VALUE foletype_s_allocate(VALUE klass);
-static VALUE oleclass_from_typelib(VALUE self, ITypeLib *pTypeLib, VALUE oleclass);
-static VALUE foletype_initialize(VALUE self, VALUE typelib, VALUE oleclass);
-static VALUE foletype_name(VALUE self);
-static VALUE ole_ole_type(ITypeInfo *pTypeInfo);
-static VALUE foletype_ole_type(VALUE self);
-static VALUE ole_type_guid(ITypeInfo *pTypeInfo);
-static VALUE foletype_guid(VALUE self);
-static VALUE ole_type_progid(ITypeInfo *pTypeInfo);
-static VALUE foletype_progid(VALUE self);
-static VALUE ole_type_visible(ITypeInfo *pTypeInfo);
-static VALUE foletype_visible(VALUE self);
-static VALUE ole_type_major_version(ITypeInfo *pTypeInfo);
-static VALUE foletype_major_version(VALUE self);
-static VALUE ole_type_minor_version(ITypeInfo *pTypeInfo);
-static VALUE foletype_minor_version(VALUE self);
-static VALUE ole_type_typekind(ITypeInfo *pTypeInfo);
-static VALUE foletype_typekind(VALUE self);
-static VALUE ole_type_helpstring(ITypeInfo *pTypeInfo);
-static VALUE foletype_helpstring(VALUE self);
-static VALUE ole_type_src_type(ITypeInfo *pTypeInfo);
-static VALUE foletype_src_type(VALUE self);
-static VALUE ole_type_helpfile(ITypeInfo *pTypeInfo);
-static VALUE foletype_helpfile(VALUE self);
-static VALUE ole_type_helpcontext(ITypeInfo *pTypeInfo);
-static VALUE foletype_helpcontext(VALUE self);
-static VALUE ole_variables(ITypeInfo *pTypeInfo);
-static VALUE foletype_variables(VALUE self);
-static VALUE foletype_methods(VALUE self);
-static VALUE foletype_ole_typelib(VALUE self);
-static VALUE ole_type_impl_ole_types(ITypeInfo *pTypeInfo, int implflags);
-static VALUE foletype_impl_ole_types(VALUE self);
-static VALUE foletype_source_ole_types(VALUE self);
-static VALUE foletype_default_event_sources(VALUE self);
-static VALUE foletype_default_ole_types(VALUE self);
-static VALUE foletype_inspect(VALUE self);
-
-static const rb_data_type_t oletype_datatype = {
-    "win32ole_type",
-    {NULL, oletype_free, oletype_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-/*
- * Document-class: WIN32OLE::Type
- *
- *   +WIN32OLE::Type+ objects represent OLE type library information.
- */
-
-static void
-oletype_free(void *ptr)
-{
-    struct oletypedata *poletype = ptr;
-    OLE_FREE(poletype->pTypeInfo);
-    free(poletype);
-}
-
-static size_t
-oletype_size(const void *ptr)
-{
-    return ptr ? sizeof(struct oletypedata) : 0;
-}
-
-ITypeInfo *itypeinfo(VALUE self)
-{
-    struct oletypedata *ptype;
-    TypedData_Get_Struct(self, struct oletypedata, &oletype_datatype, ptype);
-    return ptype->pTypeInfo;
-}
-
-VALUE
-ole_type_from_itypeinfo(ITypeInfo *pTypeInfo)
-{
-    ITypeLib *pTypeLib;
-    VALUE type = Qnil;
-    HRESULT hr;
-    unsigned int index;
-    BSTR bstr;
-
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib( pTypeInfo, &pTypeLib, &index );
-    if(FAILED(hr)) {
-        return Qnil;
-    }
-    hr = pTypeLib->lpVtbl->GetDocumentation( pTypeLib, index,
-                                             &bstr, NULL, NULL, NULL);
-    OLE_RELEASE(pTypeLib);
-    if (FAILED(hr)) {
-        return Qnil;
-    }
-    type = create_win32ole_type(pTypeInfo, WC2VSTR(bstr));
-    return type;
-}
-
-
-/*
- *   call-seq:
- *      ole_classes(typelib)
- *
- *   Returns array of WIN32OLE::Type objects defined by the <i>typelib</i> type library.
- *
- *   This method will be OBSOLETE.
- *   Use <code>WIN32OLE::TypeLib.new(typelib).ole_classes</code> instead.
- */
-static VALUE
-foletype_s_ole_classes(VALUE self, VALUE typelib)
-{
-    VALUE obj;
-
-    /*
-    rb_warn("%s is obsolete; use %s instead.",
-            "WIN32OLE::Type.ole_classes",
-            "WIN32OLE::TypeLib.new(typelib).ole_types");
-    */
-    obj = rb_funcall(cWIN32OLE_TYPELIB, rb_intern("new"), 1, typelib);
-    return rb_funcall(obj, rb_intern("ole_types"), 0);
-}
-
-/*
- *  call-seq:
- *     typelibs
- *
- *  Returns array of type libraries.
- *
- *  This method will be OBSOLETE.
- *  Use <code>WIN32OLE::TypeLib.typelibs.collect{|t| t.name}</code> instead.
- *
- */
-static VALUE
-foletype_s_typelibs(VALUE self)
-{
-    /*
-    rb_warn("%s is obsolete. use %s instead.",
-            "WIN32OLE::Type.typelibs",
-            "WIN32OLE::TypeLib.typelibs.collect{t|t.name}");
-    */
-    return rb_eval_string("WIN32OLE::TypeLib.typelibs.collect{|t|t.name}");
-}
-
-/*
- *  call-seq:
- *     progids
- *
- *  Returns array of ProgID.
- */
-static VALUE
-foletype_s_progids(VALUE self)
-{
-    HKEY hclsids, hclsid;
-    DWORD i;
-    LONG err;
-    VALUE clsid;
-    VALUE v = rb_str_new2("");
-    VALUE progids = rb_ary_new();
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "CLSID", &hclsids);
-    if(err != ERROR_SUCCESS) {
-        return progids;
-    }
-    for(i = 0; ; i++) {
-        clsid = reg_enum_key(hclsids, i);
-        if (clsid == Qnil)
-            break;
-        err = reg_open_vkey(hclsids, clsid, &hclsid);
-        if (err != ERROR_SUCCESS)
-            continue;
-        if ((v = reg_get_val2(hclsid, "ProgID")) != Qnil)
-            rb_ary_push(progids, v);
-        if ((v = reg_get_val2(hclsid, "VersionIndependentProgID")) != Qnil)
-            rb_ary_push(progids, v);
-        RegCloseKey(hclsid);
-    }
-    RegCloseKey(hclsids);
-    return progids;
-}
-
-static VALUE
-oletype_set_member(VALUE self, ITypeInfo *pTypeInfo, VALUE name)
-{
-    struct oletypedata *ptype;
-    TypedData_Get_Struct(self, struct oletypedata, &oletype_datatype, ptype);
-    rb_ivar_set(self, rb_intern("name"), name);
-    ptype->pTypeInfo = pTypeInfo;
-    OLE_ADDREF(pTypeInfo);
-    return self;
-}
-
-static VALUE
-foletype_s_allocate(VALUE klass)
-{
-    struct oletypedata *poletype;
-    VALUE obj;
-    ole_initialize();
-    obj = TypedData_Make_Struct(klass,struct oletypedata, &oletype_datatype, poletype);
-    poletype->pTypeInfo = NULL;
-    return obj;
-}
-
-VALUE
-create_win32ole_type(ITypeInfo *pTypeInfo, VALUE name)
-{
-    VALUE obj = foletype_s_allocate(cWIN32OLE_TYPE);
-    oletype_set_member(obj, pTypeInfo, name);
-    return obj;
-}
-
-static VALUE
-oleclass_from_typelib(VALUE self, ITypeLib *pTypeLib, VALUE oleclass)
-{
-    long count;
-    int i;
-    HRESULT hr;
-    BSTR bstr;
-    VALUE typelib;
-    ITypeInfo *pTypeInfo;
-
-    VALUE found = Qfalse;
-
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (i = 0; i < count && found == Qfalse; i++) {
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, i, &pTypeInfo);
-        if (FAILED(hr))
-            continue;
-        hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, i,
-                                                &bstr, NULL, NULL, NULL);
-        if (FAILED(hr))
-            continue;
-        typelib = WC2VSTR(bstr);
-        if (rb_str_cmp(oleclass, typelib) == 0) {
-            oletype_set_member(self, pTypeInfo, typelib);
-            found = Qtrue;
-        }
-        OLE_RELEASE(pTypeInfo);
-    }
-    return found;
-}
-
-/*
- *  call-seq:
- *     new(typelib, ole_class) -> WIN32OLE::Type object
- *
- *  Returns a new WIN32OLE::Type object.
- *  The first argument <i>typelib</i> specifies OLE type library name.
- *  The second argument specifies OLE class name.
- *
- *      WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *          # => WIN32OLE::Type object of Application class of Excel.
- */
-static VALUE
-foletype_initialize(VALUE self, VALUE typelib, VALUE oleclass)
-{
-    VALUE file;
-    OLECHAR * pbuf;
-    ITypeLib *pTypeLib;
-    HRESULT hr;
-
-    SafeStringValue(oleclass);
-    SafeStringValue(typelib);
-    file = typelib_file(typelib);
-    if (file == Qnil) {
-        file = typelib;
-    }
-    pbuf = ole_vstr2wc(file);
-    hr = LoadTypeLibEx(pbuf, REGKIND_NONE, &pTypeLib);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to LoadTypeLibEx");
-    SysFreeString(pbuf);
-    if (oleclass_from_typelib(self, pTypeLib, oleclass) == Qfalse) {
-        OLE_RELEASE(pTypeLib);
-        rb_raise(eWIN32OLERuntimeError, "not found `%s` in `%s`",
-                 StringValuePtr(oleclass), StringValuePtr(typelib));
-    }
-    OLE_RELEASE(pTypeLib);
-    return self;
-}
-
-/*
- * call-seq:
- *    name #=> OLE type name
- *
- * Returns OLE type name.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *    puts tobj.name  # => Application
- */
-static VALUE
-foletype_name(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("name"));
-}
-
-static VALUE
-ole_ole_type(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    VALUE type = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if(FAILED(hr)){
-        return type;
-    }
-    switch(pTypeAttr->typekind) {
-    case TKIND_ENUM:
-        type = rb_str_new2("Enum");
-        break;
-    case TKIND_RECORD:
-        type = rb_str_new2("Record");
-        break;
-    case TKIND_MODULE:
-        type = rb_str_new2("Module");
-        break;
-    case TKIND_INTERFACE:
-        type = rb_str_new2("Interface");
-        break;
-    case TKIND_DISPATCH:
-        type = rb_str_new2("Dispatch");
-        break;
-    case TKIND_COCLASS:
-        type = rb_str_new2("Class");
-        break;
-    case TKIND_ALIAS:
-        type = rb_str_new2("Alias");
-        break;
-    case TKIND_UNION:
-        type = rb_str_new2("Union");
-        break;
-    case TKIND_MAX:
-        type = rb_str_new2("Max");
-        break;
-    default:
-        type = Qnil;
-        break;
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return type;
-}
-
-/*
- *  call-seq:
- *     ole_type #=> OLE type string.
- *
- *  returns type of OLE class.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *    puts tobj.ole_type  # => Class
- */
-static VALUE
-foletype_ole_type(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_ole_type(pTypeInfo);
-}
-
-static VALUE
-ole_type_guid(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    int len;
-    OLECHAR bstr[80];
-    VALUE guid = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        return guid;
-    len = StringFromGUID2(&pTypeAttr->guid, bstr, sizeof(bstr)/sizeof(OLECHAR));
-    if (len > 3) {
-        guid = ole_wc2vstr(bstr, FALSE);
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return guid;
-}
-
-/*
- *  call-seq:
- *     guid  #=> GUID
- *
- *  Returns GUID.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *    puts tobj.guid  # => {00024500-0000-0000-C000-000000000046}
- */
-static VALUE
-foletype_guid(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_guid(pTypeInfo);
-}
-
-static VALUE
-ole_type_progid(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    OLECHAR *pbuf;
-    VALUE progid = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        return progid;
-    hr = ProgIDFromCLSID(&pTypeAttr->guid, &pbuf);
-    if (SUCCEEDED(hr)) {
-        progid = ole_wc2vstr(pbuf, FALSE);
-        CoTaskMemFree(pbuf);
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return progid;
-}
-
-/*
- * call-seq:
- *    progid  #=> ProgID
- *
- * Returns ProgID if it exists. If not found, then returns nil.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *    puts tobj.progid  # =>   Excel.Application.9
- */
-static VALUE
-foletype_progid(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_progid(pTypeInfo);
-}
-
-
-static VALUE
-ole_type_visible(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    VALUE visible;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        return Qtrue;
-    if (pTypeAttr->wTypeFlags & (TYPEFLAG_FHIDDEN | TYPEFLAG_FRESTRICTED)) {
-        visible = Qfalse;
-    } else {
-        visible = Qtrue;
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return visible;
-}
-
-/*
- *  call-seq:
- *    visible?  #=> true or false
- *
- *  Returns true if the OLE class is public.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Application')
- *    puts tobj.visible  # => true
- */
-static VALUE
-foletype_visible(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_visible(pTypeInfo);
-}
-
-static VALUE
-ole_type_major_version(ITypeInfo *pTypeInfo)
-{
-    VALUE ver;
-    TYPEATTR *pTypeAttr;
-    HRESULT hr;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetTypeAttr");
-    ver = RB_INT2FIX(pTypeAttr->wMajorVerNum);
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return ver;
-}
-
-/*
- *  call-seq:
- *     major_version
- *
- *  Returns major version.
- *     tobj = WIN32OLE::Type.new('Microsoft Word 10.0 Object Library', 'Documents')
- *     puts tobj.major_version # => 8
- */
-static VALUE
-foletype_major_version(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_major_version(pTypeInfo);
-}
-
-static VALUE
-ole_type_minor_version(ITypeInfo *pTypeInfo)
-{
-    VALUE ver;
-    TYPEATTR *pTypeAttr;
-    HRESULT hr;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetTypeAttr");
-    ver = RB_INT2FIX(pTypeAttr->wMinorVerNum);
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return ver;
-}
-
-/*
- *  call-seq:
- *    minor_version #=> OLE minor version
- *
- *  Returns minor version.
- *     tobj = WIN32OLE::Type.new('Microsoft Word 10.0 Object Library', 'Documents')
- *     puts tobj.minor_version # => 2
- */
-static VALUE
-foletype_minor_version(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_minor_version(pTypeInfo);
-}
-
-static VALUE
-ole_type_typekind(ITypeInfo *pTypeInfo)
-{
-    VALUE typekind;
-    TYPEATTR *pTypeAttr;
-    HRESULT hr;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetTypeAttr");
-    typekind = RB_INT2FIX(pTypeAttr->typekind);
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return typekind;
-}
-
-/*
- *  call-seq:
- *    typekind #=> number of type.
- *
- *  Returns number which represents type.
- *    tobj = WIN32OLE::Type.new('Microsoft Word 10.0 Object Library', 'Documents')
- *    puts tobj.typekind # => 4
- *
- */
-static VALUE
-foletype_typekind(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_typekind(pTypeInfo);
-}
-
-static VALUE
-ole_type_helpstring(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    BSTR bhelpstr;
-    hr = ole_docinfo_from_type(pTypeInfo, NULL, &bhelpstr, NULL, NULL);
-    if(FAILED(hr)) {
-        return Qnil;
-    }
-    return WC2VSTR(bhelpstr);
-}
-
-/*
- *  call-seq:
- *    helpstring #=> help string.
- *
- *  Returns help string.
- *    tobj = WIN32OLE::Type.new('Microsoft Internet Controls', 'IWebBrowser')
- *    puts tobj.helpstring # => Web Browser interface
- */
-static VALUE
-foletype_helpstring(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_helpstring(pTypeInfo);
-}
-
-static VALUE
-ole_type_src_type(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    VALUE alias = Qnil;
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr))
-        return alias;
-    if(pTypeAttr->typekind != TKIND_ALIAS) {
-        OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-        return alias;
-    }
-    alias = ole_typedesc2val(pTypeInfo, &(pTypeAttr->tdescAlias), Qnil);
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return alias;
-}
-
-/*
- *  call-seq:
- *     src_type #=> OLE source class
- *
- *  Returns source class when the OLE class is 'Alias'.
- *     tobj =  WIN32OLE::Type.new('Microsoft Office 9.0 Object Library', 'MsoRGBType')
- *     puts tobj.src_type # => I4
- *
- */
-static VALUE
-foletype_src_type(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_src_type(pTypeInfo);
-}
-
-static VALUE
-ole_type_helpfile(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    BSTR bhelpfile;
-    hr = ole_docinfo_from_type(pTypeInfo, NULL, NULL, NULL, &bhelpfile);
-    if(FAILED(hr)) {
-        return Qnil;
-    }
-    return WC2VSTR(bhelpfile);
-}
-
-/*
- *  call-seq:
- *     helpfile
- *
- *  Returns helpfile path. If helpfile is not found, then returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Worksheet')
- *     puts tobj.helpfile # => C:\...\VBAXL9.CHM
- *
- */
-static VALUE
-foletype_helpfile(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_helpfile(pTypeInfo);
-}
-
-static VALUE
-ole_type_helpcontext(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    DWORD helpcontext;
-    hr = ole_docinfo_from_type(pTypeInfo, NULL, NULL,
-                               &helpcontext, NULL);
-    if(FAILED(hr))
-        return Qnil;
-    return RB_INT2FIX(helpcontext);
-}
-
-/*
- *  call-seq:
- *     helpcontext
- *
- *  Returns helpcontext. If helpcontext is not found, then returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Worksheet')
- *     puts tobj.helpfile # => 131185
- */
-static VALUE
-foletype_helpcontext(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_helpcontext(pTypeInfo);
-}
-
-static VALUE
-ole_variables(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    TYPEATTR *pTypeAttr;
-    WORD i;
-    UINT len;
-    BSTR bstr;
-    VARDESC *pVarDesc;
-    VALUE var;
-    VALUE variables = rb_ary_new();
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetTypeAttr");
-    }
-
-    for(i = 0; i < pTypeAttr->cVars; i++) {
-        hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, i, &pVarDesc);
-        if(FAILED(hr))
-            continue;
-        len = 0;
-        hr = pTypeInfo->lpVtbl->GetNames(pTypeInfo, pVarDesc->memid, &bstr,
-                                         1, &len);
-        if(FAILED(hr) || len == 0 || !bstr)
-            continue;
-
-        var = create_win32ole_variable(pTypeInfo, i, WC2VSTR(bstr));
-        rb_ary_push(variables, var);
-
-        pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-        pVarDesc = NULL;
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return variables;
-}
-
-/*
- *  call-seq:
- *     variables
- *
- *  Returns array of WIN32OLE::Variable objects which represent variables
- *  defined in OLE class.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *     vars = tobj.variables
- *     vars.each do |v|
- *       puts "#{v.name} = #{v.value}"
- *     end
- *
- *     The result of above sample script is follows:
- *       xlChart = -4109
- *       xlDialogSheet = -4116
- *       xlExcel4IntlMacroSheet = 4
- *       xlExcel4MacroSheet = 3
- *       xlWorksheet = -4167
- *
- */
-static VALUE
-foletype_variables(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_variables(pTypeInfo);
-}
-
-/*
- *  call-seq:
- *     ole_methods # the array of WIN32OLE::Method objects.
- *
- *  Returns array of WIN32OLE::Method objects which represent OLE method defined in
- *  OLE type library.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Worksheet')
- *    methods = tobj.ole_methods.collect{|m|
- *      m.name
- *    }
- *    # => ['Activate', 'Copy', 'Delete',....]
- */
-static VALUE
-foletype_methods(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_methods_from_typeinfo(pTypeInfo, INVOKE_FUNC | INVOKE_PROPERTYGET | INVOKE_PROPERTYPUT | INVOKE_PROPERTYPUTREF);
-}
-
-/*
- *  call-seq:
- *     ole_typelib
- *
- *  Returns the WIN32OLE::TypeLib object which is including the WIN32OLE::Type
- *  object. If it is not found, then returns nil.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Worksheet')
- *     puts tobj.ole_typelib # => 'Microsoft Excel 9.0 Object Library'
- */
-static VALUE
-foletype_ole_typelib(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_typelib_from_itypeinfo(pTypeInfo);
-}
-
-static VALUE
-ole_type_impl_ole_types(ITypeInfo *pTypeInfo, int implflags)
-{
-    HRESULT hr;
-    ITypeInfo *pRefTypeInfo;
-    HREFTYPE href;
-    WORD i;
-    VALUE type;
-    TYPEATTR *pTypeAttr;
-    int flags;
-
-    VALUE types = rb_ary_new();
-    hr = OLE_GET_TYPEATTR(pTypeInfo, &pTypeAttr);
-    if (FAILED(hr)) {
-        return types;
-    }
-    for (i = 0; i < pTypeAttr->cImplTypes; i++) {
-        hr = pTypeInfo->lpVtbl->GetImplTypeFlags(pTypeInfo, i, &flags);
-        if (FAILED(hr))
-            continue;
-
-        hr = pTypeInfo->lpVtbl->GetRefTypeOfImplType(pTypeInfo, i, &href);
-        if (FAILED(hr))
-            continue;
-        hr = pTypeInfo->lpVtbl->GetRefTypeInfo(pTypeInfo, href, &pRefTypeInfo);
-        if (FAILED(hr))
-            continue;
-
-        if ((flags & implflags) == implflags) {
-            type = ole_type_from_itypeinfo(pRefTypeInfo);
-            if (type != Qnil) {
-                rb_ary_push(types, type);
-            }
-        }
-
-        OLE_RELEASE(pRefTypeInfo);
-    }
-    OLE_RELEASE_TYPEATTR(pTypeInfo, pTypeAttr);
-    return types;
-}
-
-/*
- *  call-seq:
- *     implemented_ole_types
- *
- *  Returns the array of WIN32OLE::Type object which is implemented by the WIN32OLE::Type
- *  object.
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'Worksheet')
- *     p tobj.implemented_ole_types # => [_Worksheet, DocEvents]
- */
-static VALUE
-foletype_impl_ole_types(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_impl_ole_types(pTypeInfo, 0);
-}
-
-/*
- *  call-seq:
- *     source_ole_types
- *
- *  Returns the array of WIN32OLE::Type object which is implemented by the WIN32OLE::Type
- *  object and having IMPLTYPEFLAG_FSOURCE.
- *     tobj = WIN32OLE::Type.new('Microsoft Internet Controls', "InternetExplorer")
- *     p tobj.source_ole_types
- *     # => [#<WIN32OLE::Type:DWebBrowserEvents2>, #<WIN32OLE::Type:DWebBrowserEvents>]
- */
-static VALUE
-foletype_source_ole_types(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_impl_ole_types(pTypeInfo, IMPLTYPEFLAG_FSOURCE);
-}
-
-/*
- *  call-seq:
- *     default_event_sources
- *
- *  Returns the array of WIN32OLE::Type object which is implemented by the WIN32OLE::Type
- *  object and having IMPLTYPEFLAG_FSOURCE and IMPLTYPEFLAG_FDEFAULT.
- *     tobj = WIN32OLE::Type.new('Microsoft Internet Controls', "InternetExplorer")
- *     p tobj.default_event_sources  # => [#<WIN32OLE::Type:DWebBrowserEvents2>]
- */
-static VALUE
-foletype_default_event_sources(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_impl_ole_types(pTypeInfo, IMPLTYPEFLAG_FSOURCE|IMPLTYPEFLAG_FDEFAULT);
-}
-
-/*
- *  call-seq:
- *     default_ole_types
- *
- *  Returns the array of WIN32OLE::Type object which is implemented by the WIN32OLE::Type
- *  object and having IMPLTYPEFLAG_FDEFAULT.
- *     tobj = WIN32OLE::Type.new('Microsoft Internet Controls', "InternetExplorer")
- *     p tobj.default_ole_types
- *     # => [#<WIN32OLE::Type:IWebBrowser2>, #<WIN32OLE::Type:DWebBrowserEvents2>]
- */
-static VALUE
-foletype_default_ole_types(VALUE self)
-{
-    ITypeInfo *pTypeInfo = itypeinfo(self);
-    return ole_type_impl_ole_types(pTypeInfo, IMPLTYPEFLAG_FDEFAULT);
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the type name with class name.
- *
- *     ie = WIN32OLE.new('InternetExplorer.Application')
- *     ie.ole_type.inspect => #<WIN32OLE::Type:IWebBrowser2>
- */
-static VALUE
-foletype_inspect(VALUE self)
-{
-    return default_inspect(self, "WIN32OLE::Type");
-}
-
-VALUE cWIN32OLE_TYPE;
-
-void Init_win32ole_type(void)
-{
-    cWIN32OLE_TYPE = rb_define_class_under(cWIN32OLE, "Type", rb_cObject);
-    /* Alias of WIN32OLE::Type, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_TYPE", cWIN32OLE_TYPE);
-    rb_define_singleton_method(cWIN32OLE_TYPE, "ole_classes", foletype_s_ole_classes, 1);
-    rb_define_singleton_method(cWIN32OLE_TYPE, "typelibs", foletype_s_typelibs, 0);
-    rb_define_singleton_method(cWIN32OLE_TYPE, "progids", foletype_s_progids, 0);
-    rb_define_alloc_func(cWIN32OLE_TYPE, foletype_s_allocate);
-    rb_define_method(cWIN32OLE_TYPE, "initialize", foletype_initialize, 2);
-    rb_define_method(cWIN32OLE_TYPE, "name", foletype_name, 0);
-    rb_define_method(cWIN32OLE_TYPE, "ole_type", foletype_ole_type, 0);
-    rb_define_method(cWIN32OLE_TYPE, "guid", foletype_guid, 0);
-    rb_define_method(cWIN32OLE_TYPE, "progid", foletype_progid, 0);
-    rb_define_method(cWIN32OLE_TYPE, "visible?", foletype_visible, 0);
-    rb_define_alias(cWIN32OLE_TYPE, "to_s", "name");
-    rb_define_method(cWIN32OLE_TYPE, "major_version", foletype_major_version, 0);
-    rb_define_method(cWIN32OLE_TYPE, "minor_version", foletype_minor_version, 0);
-    rb_define_method(cWIN32OLE_TYPE, "typekind", foletype_typekind, 0);
-    rb_define_method(cWIN32OLE_TYPE, "helpstring", foletype_helpstring, 0);
-    rb_define_method(cWIN32OLE_TYPE, "src_type", foletype_src_type, 0);
-    rb_define_method(cWIN32OLE_TYPE, "helpfile", foletype_helpfile, 0);
-    rb_define_method(cWIN32OLE_TYPE, "helpcontext", foletype_helpcontext, 0);
-    rb_define_method(cWIN32OLE_TYPE, "variables", foletype_variables, 0);
-    rb_define_method(cWIN32OLE_TYPE, "ole_methods", foletype_methods, 0);
-    rb_define_method(cWIN32OLE_TYPE, "ole_typelib", foletype_ole_typelib, 0);
-    rb_define_method(cWIN32OLE_TYPE, "implemented_ole_types", foletype_impl_ole_types, 0);
-    rb_define_method(cWIN32OLE_TYPE, "source_ole_types", foletype_source_ole_types, 0);
-    rb_define_method(cWIN32OLE_TYPE, "default_event_sources", foletype_default_event_sources, 0);
-    rb_define_method(cWIN32OLE_TYPE, "default_ole_types", foletype_default_ole_types, 0);
-    rb_define_method(cWIN32OLE_TYPE, "inspect", foletype_inspect, 0);
-}
diff --git a/ext/win32ole/win32ole_type.h b/ext/win32ole/win32ole_type.h
deleted file mode 100644
index 87b551e502..0000000000
--- a/ext/win32ole/win32ole_type.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef WIN32OLE_TYPE_H
-#define WIN32OLE_TYPE_H 1
-extern VALUE cWIN32OLE_TYPE;
-VALUE create_win32ole_type(ITypeInfo *pTypeInfo, VALUE name);
-ITypeInfo *itypeinfo(VALUE self);
-VALUE ole_type_from_itypeinfo(ITypeInfo *pTypeInfo);
-void Init_win32ole_type(void);
-#endif
diff --git a/ext/win32ole/win32ole_typelib.c b/ext/win32ole/win32ole_typelib.c
deleted file mode 100644
index e5eda07e76..0000000000
--- a/ext/win32ole/win32ole_typelib.c
+++ /dev/null
@@ -1,848 +0,0 @@
-#include "win32ole.h"
-
-struct oletypelibdata {
-    ITypeLib *pTypeLib;
-};
-
-static VALUE reg_get_typelib_file_path(HKEY hkey);
-static VALUE oletypelib_path(VALUE guid, VALUE version);
-static HRESULT oletypelib_from_guid(VALUE guid, VALUE version, ITypeLib **ppTypeLib);
-static VALUE foletypelib_s_typelibs(VALUE self);
-static VALUE oletypelib_set_member(VALUE self, ITypeLib *pTypeLib);
-static void oletypelib_free(void *ptr);
-static size_t oletypelib_size(const void *ptr);
-static VALUE foletypelib_s_allocate(VALUE klass);
-static VALUE oletypelib_search_registry(VALUE self, VALUE typelib);
-static void oletypelib_get_libattr(ITypeLib *pTypeLib, TLIBATTR **ppTLibAttr);
-static VALUE oletypelib_search_registry2(VALUE self, VALUE args);
-static VALUE foletypelib_initialize(VALUE self, VALUE args);
-static VALUE foletypelib_guid(VALUE self);
-static VALUE foletypelib_name(VALUE self);
-static VALUE make_version_str(VALUE major, VALUE minor);
-static VALUE foletypelib_version(VALUE self);
-static VALUE foletypelib_major_version(VALUE self);
-static VALUE foletypelib_minor_version(VALUE self);
-static VALUE foletypelib_path(VALUE self);
-static VALUE foletypelib_visible(VALUE self);
-static VALUE foletypelib_library_name(VALUE self);
-static VALUE ole_types_from_typelib(ITypeLib *pTypeLib, VALUE classes);
-static VALUE typelib_file_from_typelib(VALUE ole);
-static VALUE typelib_file_from_clsid(VALUE ole);
-static VALUE foletypelib_ole_types(VALUE self);
-static VALUE foletypelib_inspect(VALUE self);
-
-static const rb_data_type_t oletypelib_datatype = {
-    "win32ole_typelib",
-    {NULL, oletypelib_free, oletypelib_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static VALUE
-reg_get_typelib_file_path(HKEY hkey)
-{
-    VALUE path = Qnil;
-    path = reg_get_val2(hkey, "win64");
-    if (path != Qnil) {
-        return path;
-    }
-    path = reg_get_val2(hkey, "win32");
-    if (path != Qnil) {
-        return path;
-    }
-    path = reg_get_val2(hkey, "win16");
-    return path;
-}
-
-static VALUE
-oletypelib_path(VALUE guid, VALUE version)
-{
-    int k;
-    LONG err;
-    HKEY hkey;
-    HKEY hlang;
-    VALUE lang;
-    VALUE path = Qnil;
-
-    VALUE key = rb_str_new2("TypeLib\\");
-    rb_str_concat(key, guid);
-    rb_str_cat2(key, "\\");
-    rb_str_concat(key, version);
-
-    err = reg_open_vkey(HKEY_CLASSES_ROOT, key, &hkey);
-    if (err != ERROR_SUCCESS) {
-        return Qnil;
-    }
-    for(k = 0; path == Qnil; k++) {
-        lang = reg_enum_key(hkey, k);
-        if (lang == Qnil)
-            break;
-        err = reg_open_vkey(hkey, lang, &hlang);
-        if (err == ERROR_SUCCESS) {
-            path = reg_get_typelib_file_path(hlang);
-            RegCloseKey(hlang);
-        }
-    }
-    RegCloseKey(hkey);
-    return path;
-}
-
-static HRESULT
-oletypelib_from_guid(VALUE guid, VALUE version, ITypeLib **ppTypeLib)
-{
-    VALUE path;
-    OLECHAR *pBuf;
-    HRESULT hr;
-    path = oletypelib_path(guid, version);
-    if (path == Qnil) {
-        return E_UNEXPECTED;
-    }
-    pBuf = ole_vstr2wc(path);
-    hr = LoadTypeLibEx(pBuf, REGKIND_NONE, ppTypeLib);
-    SysFreeString(pBuf);
-    return hr;
-}
-
-ITypeLib *
-itypelib(VALUE self)
-{
-    struct oletypelibdata *ptlib;
-    TypedData_Get_Struct(self, struct oletypelibdata, &oletypelib_datatype, ptlib);
-    return ptlib->pTypeLib;
-}
-
-VALUE
-ole_typelib_from_itypeinfo(ITypeInfo *pTypeInfo)
-{
-    HRESULT hr;
-    ITypeLib *pTypeLib;
-    unsigned int index;
-    VALUE retval = Qnil;
-
-    hr = pTypeInfo->lpVtbl->GetContainingTypeLib(pTypeInfo, &pTypeLib, &index);
-    if(FAILED(hr)) {
-        return Qnil;
-    }
-    retval = create_win32ole_typelib(pTypeLib);
-    return retval;
-}
-
-/*
- * Document-class: WIN32OLE::TypeLib
- *
- *   +WIN32OLE::TypeLib+ objects represent OLE tyblib information.
- */
-
-/*
- *  call-seq:
- *
- *     typelibs
- *
- *  Returns the array of WIN32OLE::TypeLib object.
- *
- *     tlibs = WIN32OLE::TypeLib.typelibs
- *
- */
-static VALUE
-foletypelib_s_typelibs(VALUE self)
-{
-    HKEY htypelib, hguid;
-    DWORD i, j;
-    LONG err;
-    VALUE guid;
-    VALUE version;
-    VALUE name = Qnil;
-    VALUE typelibs = rb_ary_new();
-    VALUE typelib = Qnil;
-    HRESULT hr;
-    ITypeLib *pTypeLib;
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "TypeLib", &htypelib);
-    if(err != ERROR_SUCCESS) {
-        return typelibs;
-    }
-    for(i = 0; ; i++) {
-        guid = reg_enum_key(htypelib, i);
-        if (guid == Qnil)
-            break;
-        err = reg_open_vkey(htypelib, guid, &hguid);
-        if (err != ERROR_SUCCESS)
-            continue;
-        for(j = 0; ; j++) {
-            version = reg_enum_key(hguid, j);
-            if (version == Qnil)
-                break;
-            if ( (name = reg_get_val2(hguid, StringValuePtr(version))) != Qnil ) {
-                hr = oletypelib_from_guid(guid, version, &pTypeLib);
-                if (SUCCEEDED(hr)) {
-                    typelib = create_win32ole_typelib(pTypeLib);
-                    rb_ary_push(typelibs, typelib);
-                }
-            }
-        }
-        RegCloseKey(hguid);
-    }
-    RegCloseKey(htypelib);
-    return typelibs;
-}
-
-static VALUE
-oletypelib_set_member(VALUE self, ITypeLib *pTypeLib)
-{
-    struct oletypelibdata *ptlib;
-    TypedData_Get_Struct(self, struct oletypelibdata, &oletypelib_datatype, ptlib);
-    ptlib->pTypeLib = pTypeLib;
-    return self;
-}
-
-static void
-oletypelib_free(void *ptr)
-{
-    struct oletypelibdata *poletypelib = ptr;
-    OLE_FREE(poletypelib->pTypeLib);
-    free(poletypelib);
-}
-
-static size_t
-oletypelib_size(const void *ptr)
-{
-    return ptr ? sizeof(struct oletypelibdata) : 0;
-}
-
-static VALUE
-foletypelib_s_allocate(VALUE klass)
-{
-    struct oletypelibdata *poletypelib;
-    VALUE obj;
-    ole_initialize();
-    obj = TypedData_Make_Struct(klass, struct oletypelibdata, &oletypelib_datatype, poletypelib);
-    poletypelib->pTypeLib = NULL;
-    return obj;
-}
-
-VALUE
-create_win32ole_typelib(ITypeLib *pTypeLib)
-{
-    VALUE obj = foletypelib_s_allocate(cWIN32OLE_TYPELIB);
-    oletypelib_set_member(obj, pTypeLib);
-    return obj;
-}
-
-static VALUE
-oletypelib_search_registry(VALUE self, VALUE typelib)
-{
-    HKEY htypelib, hguid, hversion;
-    DWORD i, j;
-    LONG err;
-    VALUE found = Qfalse;
-    VALUE tlib;
-    VALUE guid;
-    VALUE ver;
-    HRESULT hr;
-    ITypeLib *pTypeLib;
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "TypeLib", &htypelib);
-    if(err != ERROR_SUCCESS) {
-        return Qfalse;
-    }
-    for(i = 0; !found; i++) {
-        guid = reg_enum_key(htypelib, i);
-        if (guid == Qnil)
-            break;
-        err = reg_open_vkey(htypelib, guid, &hguid);
-        if (err != ERROR_SUCCESS)
-            continue;
-        for(j = 0; found == Qfalse; j++) {
-            ver = reg_enum_key(hguid, j);
-            if (ver == Qnil)
-                break;
-            err = reg_open_vkey(hguid, ver, &hversion);
-            if (err != ERROR_SUCCESS)
-                continue;
-            tlib = reg_get_val(hversion, NULL);
-            if (tlib == Qnil) {
-                RegCloseKey(hversion);
-                continue;
-            }
-            if (rb_str_cmp(typelib, tlib) == 0) {
-                hr = oletypelib_from_guid(guid, ver, &pTypeLib);
-                if (SUCCEEDED(hr)) {
-                    oletypelib_set_member(self, pTypeLib);
-                    found = Qtrue;
-                }
-            }
-            RegCloseKey(hversion);
-        }
-        RegCloseKey(hguid);
-    }
-    RegCloseKey(htypelib);
-    return  found;
-}
-
-static void
-oletypelib_get_libattr(ITypeLib *pTypeLib, TLIBATTR **ppTLibAttr)
-{
-    HRESULT hr;
-    hr = pTypeLib->lpVtbl->GetLibAttr(pTypeLib, ppTLibAttr);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError,
-                  "failed to get library attribute(TLIBATTR) from ITypeLib");
-    }
-}
-
-static VALUE
-oletypelib_search_registry2(VALUE self, VALUE args)
-{
-    HKEY htypelib, hguid, hversion;
-    double fver;
-    DWORD j;
-    LONG err;
-    VALUE found = Qfalse;
-    VALUE tlib;
-    VALUE ver;
-    VALUE version_str;
-    VALUE version = Qnil;
-    VALUE typelib = Qnil;
-    HRESULT hr;
-    ITypeLib *pTypeLib;
-
-    VALUE guid = rb_ary_entry(args, 0);
-    version_str = make_version_str(rb_ary_entry(args, 1), rb_ary_entry(args, 2));
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "TypeLib", &htypelib);
-    if(err != ERROR_SUCCESS) {
-        return Qfalse;
-    }
-    err = reg_open_vkey(htypelib, guid, &hguid);
-    if (err != ERROR_SUCCESS) {
-        RegCloseKey(htypelib);
-        return Qfalse;
-    }
-    if (version_str != Qnil) {
-        err = reg_open_vkey(hguid, version_str, &hversion);
-        if (err == ERROR_SUCCESS) {
-            tlib = reg_get_val(hversion, NULL);
-            if (tlib != Qnil) {
-                typelib = tlib;
-                version = version_str;
-            }
-        }
-        RegCloseKey(hversion);
-    } else {
-        fver = 0.0;
-        for(j = 0; ;j++) {
-            ver = reg_enum_key(hguid, j);
-            if (ver == Qnil)
-                break;
-            err = reg_open_vkey(hguid, ver, &hversion);
-            if (err != ERROR_SUCCESS)
-                continue;
-            tlib = reg_get_val(hversion, NULL);
-            if (tlib == Qnil) {
-                RegCloseKey(hversion);
-                continue;
-            }
-            if (fver < atof(StringValuePtr(ver))) {
-                fver = atof(StringValuePtr(ver));
-                version = ver;
-                typelib = tlib;
-            }
-            RegCloseKey(hversion);
-        }
-    }
-    RegCloseKey(hguid);
-    RegCloseKey(htypelib);
-    if (typelib != Qnil) {
-        hr = oletypelib_from_guid(guid, version, &pTypeLib);
-        if (SUCCEEDED(hr)) {
-            found = Qtrue;
-            oletypelib_set_member(self, pTypeLib);
-        }
-    }
-    return found;
-}
-
-
-/*
- * call-seq:
- *    new(typelib [, version1, version2]) -> WIN32OLE::TypeLib object
- *
- * Returns a new WIN32OLE::TypeLib object.
- *
- * The first argument <i>typelib</i>  specifies OLE type library name or GUID or
- * OLE library file.
- * The second argument is major version or version of the type library.
- * The third argument is minor version.
- * The second argument and third argument are optional.
- * If the first argument is type library name, then the second and third argument
- * are ignored.
- *
- *     tlib1 = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     tlib2 = WIN32OLE::TypeLib.new('{00020813-0000-0000-C000-000000000046}')
- *     tlib3 = WIN32OLE::TypeLib.new('{00020813-0000-0000-C000-000000000046}', 1.3)
- *     tlib4 = WIN32OLE::TypeLib.new('{00020813-0000-0000-C000-000000000046}', 1, 3)
- *     tlib5 = WIN32OLE::TypeLib.new("C:\\WINNT\\SYSTEM32\\SHELL32.DLL")
- *     puts tlib1.name  # -> 'Microsoft Excel 9.0 Object Library'
- *     puts tlib2.name  # -> 'Microsoft Excel 9.0 Object Library'
- *     puts tlib3.name  # -> 'Microsoft Excel 9.0 Object Library'
- *     puts tlib4.name  # -> 'Microsoft Excel 9.0 Object Library'
- *     puts tlib5.name  # -> 'Microsoft Shell Controls And Automation'
- *
- */
-static VALUE
-foletypelib_initialize(VALUE self, VALUE args)
-{
-    VALUE found = Qfalse;
-    VALUE typelib = Qnil;
-    int len = 0;
-    OLECHAR * pbuf;
-    ITypeLib *pTypeLib;
-    HRESULT hr = S_OK;
-
-    len = RARRAY_LEN(args);
-    rb_check_arity(len, 1, 3);
-
-    typelib = rb_ary_entry(args, 0);
-
-    SafeStringValue(typelib);
-
-    found = oletypelib_search_registry(self, typelib);
-    if (found == Qfalse) {
-        found = oletypelib_search_registry2(self, args);
-    }
-    if (found == Qfalse) {
-        pbuf = ole_vstr2wc(typelib);
-        hr = LoadTypeLibEx(pbuf, REGKIND_NONE, &pTypeLib);
-        SysFreeString(pbuf);
-        if (SUCCEEDED(hr)) {
-            found = Qtrue;
-            oletypelib_set_member(self, pTypeLib);
-        }
-    }
-
-    if (found == Qfalse) {
-        rb_raise(eWIN32OLERuntimeError, "not found type library `%s`",
-                 StringValuePtr(typelib));
-    }
-    return self;
-}
-
-/*
- *  call-seq:
- *     guid -> The guid string.
- *
- *  Returns guid string which specifies type library.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     guid = tlib.guid # -> '{00020813-0000-0000-C000-000000000046}'
- */
-static VALUE
-foletypelib_guid(VALUE self)
-{
-    ITypeLib *pTypeLib;
-    OLECHAR bstr[80];
-    VALUE guid = Qnil;
-    int len;
-    TLIBATTR *pTLibAttr;
-
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-    len = StringFromGUID2(&pTLibAttr->guid, bstr, sizeof(bstr)/sizeof(OLECHAR));
-    if (len > 3) {
-        guid = ole_wc2vstr(bstr, FALSE);
-    }
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    return guid;
-}
-
-/*
- *  call-seq:
- *     name -> The type library name
- *
- *  Returns the type library name.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     name = tlib.name # -> 'Microsoft Excel 9.0 Object Library'
- */
-static VALUE
-foletypelib_name(VALUE self)
-{
-    ITypeLib *pTypeLib;
-    HRESULT hr;
-    BSTR bstr;
-    VALUE name;
-    pTypeLib = itypelib(self);
-    hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, -1,
-                                            NULL, &bstr, NULL, NULL);
-
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to get name from ITypeLib");
-    }
-    name = WC2VSTR(bstr);
-    return name;
-}
-
-static VALUE
-make_version_str(VALUE major, VALUE minor)
-{
-    VALUE version_str = Qnil;
-    VALUE minor_str = Qnil;
-    if (major == Qnil) {
-        return Qnil;
-    }
-    version_str = rb_String(major);
-    if (minor != Qnil) {
-        minor_str = rb_String(minor);
-        rb_str_cat2(version_str, ".");
-        rb_str_append(version_str, minor_str);
-    }
-    return version_str;
-}
-
-/*
- *  call-seq:
- *     version -> The type library version String object.
- *
- *  Returns the type library version.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     puts tlib.version #-> "1.3"
- */
-static VALUE
-foletypelib_version(VALUE self)
-{
-    TLIBATTR *pTLibAttr;
-    ITypeLib *pTypeLib;
-    VALUE version;
-
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-    version = rb_sprintf("%d.%d", pTLibAttr->wMajorVerNum, pTLibAttr->wMinorVerNum);
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    return version;
-}
-
-/*
- *  call-seq:
- *     major_version -> The type library major version.
- *
- *  Returns the type library major version.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     puts tlib.major_version # -> 1
- */
-static VALUE
-foletypelib_major_version(VALUE self)
-{
-    TLIBATTR *pTLibAttr;
-    VALUE major;
-    ITypeLib *pTypeLib;
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-
-    major =  RB_INT2NUM(pTLibAttr->wMajorVerNum);
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    return major;
-}
-
-/*
- *  call-seq:
- *     minor_version -> The type library minor version.
- *
- *  Returns the type library minor version.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     puts tlib.minor_version # -> 3
- */
-static VALUE
-foletypelib_minor_version(VALUE self)
-{
-    TLIBATTR *pTLibAttr;
-    VALUE minor;
-    ITypeLib *pTypeLib;
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-    minor =  RB_INT2NUM(pTLibAttr->wMinorVerNum);
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    return minor;
-}
-
-/*
- *  call-seq:
- *     path -> The type library file path.
- *
- *  Returns the type library file path.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     puts tlib.path #-> 'C:\...\EXCEL9.OLB'
- */
-static VALUE
-foletypelib_path(VALUE self)
-{
-    TLIBATTR *pTLibAttr;
-    HRESULT hr = S_OK;
-    BSTR bstr;
-    LCID lcid = cWIN32OLE_lcid;
-    VALUE path;
-    ITypeLib *pTypeLib;
-
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-    hr = QueryPathOfRegTypeLib(&pTLibAttr->guid,
-                               pTLibAttr->wMajorVerNum,
-                               pTLibAttr->wMinorVerNum,
-                               lcid,
-                               &bstr);
-    if (FAILED(hr)) {
-        pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to QueryPathOfRegTypeTypeLib");
-    }
-
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    path = WC2VSTR(bstr);
-    return path;
-}
-
-/*
- *  call-seq:
- *     visible?
- *
- *  Returns true if the type library information is not hidden.
- *  If wLibFlags of TLIBATTR is 0 or LIBFLAG_FRESTRICTED or LIBFLAG_FHIDDEN,
- *  the method returns false, otherwise, returns true.
- *  If the method fails to access the TLIBATTR information, then
- *  WIN32OLE::RuntimeError is raised.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     tlib.visible? # => true
- */
-static VALUE
-foletypelib_visible(VALUE self)
-{
-    ITypeLib *pTypeLib = NULL;
-    VALUE visible = Qtrue;
-    TLIBATTR *pTLibAttr;
-
-    pTypeLib = itypelib(self);
-    oletypelib_get_libattr(pTypeLib, &pTLibAttr);
-
-    if ((pTLibAttr->wLibFlags == 0) ||
-        (pTLibAttr->wLibFlags & LIBFLAG_FRESTRICTED) ||
-        (pTLibAttr->wLibFlags & LIBFLAG_FHIDDEN)) {
-        visible = Qfalse;
-    }
-    pTypeLib->lpVtbl->ReleaseTLibAttr(pTypeLib, pTLibAttr);
-    return visible;
-}
-
-/*
- *  call-seq:
- *     library_name
- *
- *  Returns library name.
- *  If the method fails to access library name, WIN32OLE::RuntimeError is raised.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     tlib.library_name # => Excel
- */
-static VALUE
-foletypelib_library_name(VALUE self)
-{
-    HRESULT hr;
-    ITypeLib *pTypeLib = NULL;
-    VALUE libname = Qnil;
-    BSTR bstr;
-
-    pTypeLib = itypelib(self);
-    hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, -1,
-                                            &bstr, NULL, NULL, NULL);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to get library name");
-    }
-    libname = WC2VSTR(bstr);
-    return libname;
-}
-
-static VALUE
-ole_types_from_typelib(ITypeLib *pTypeLib, VALUE classes)
-{
-    long count;
-    int i;
-    HRESULT hr;
-    BSTR bstr;
-    ITypeInfo *pTypeInfo;
-    VALUE type;
-
-    count = pTypeLib->lpVtbl->GetTypeInfoCount(pTypeLib);
-    for (i = 0; i < count; i++) {
-        hr = pTypeLib->lpVtbl->GetDocumentation(pTypeLib, i,
-                                                &bstr, NULL, NULL, NULL);
-        if (FAILED(hr))
-            continue;
-
-        hr = pTypeLib->lpVtbl->GetTypeInfo(pTypeLib, i, &pTypeInfo);
-        if (FAILED(hr))
-            continue;
-
-        type = create_win32ole_type(pTypeInfo, WC2VSTR(bstr));
-
-        rb_ary_push(classes, type);
-        OLE_RELEASE(pTypeInfo);
-    }
-    return classes;
-}
-
-static VALUE
-typelib_file_from_typelib(VALUE ole)
-{
-    HKEY htypelib, hclsid, hversion, hlang;
-    double fver;
-    DWORD i, j, k;
-    LONG err;
-    BOOL found = FALSE;
-    VALUE typelib;
-    VALUE file = Qnil;
-    VALUE clsid;
-    VALUE ver;
-    VALUE lang;
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "TypeLib", &htypelib);
-    if(err != ERROR_SUCCESS) {
-        return Qnil;
-    }
-    for(i = 0; !found; i++) {
-        clsid = reg_enum_key(htypelib, i);
-        if (clsid == Qnil)
-            break;
-        err = reg_open_vkey(htypelib, clsid, &hclsid);
-        if (err != ERROR_SUCCESS)
-            continue;
-        fver = 0;
-        for(j = 0; !found; j++) {
-            ver = reg_enum_key(hclsid, j);
-            if (ver == Qnil)
-                break;
-            err = reg_open_vkey(hclsid, ver, &hversion);
-                        if (err != ERROR_SUCCESS || fver > atof(StringValuePtr(ver)))
-                continue;
-            fver = atof(StringValuePtr(ver));
-            typelib = reg_get_val(hversion, NULL);
-            if (typelib == Qnil)
-                continue;
-            if (rb_str_cmp(typelib, ole) == 0) {
-                for(k = 0; !found; k++) {
-                    lang = reg_enum_key(hversion, k);
-                    if (lang == Qnil)
-                        break;
-                    err = reg_open_vkey(hversion, lang, &hlang);
-                    if (err == ERROR_SUCCESS) {
-                        if ((file = reg_get_typelib_file_path(hlang)) != Qnil)
-                            found = TRUE;
-                        RegCloseKey(hlang);
-                    }
-                }
-            }
-            RegCloseKey(hversion);
-        }
-        RegCloseKey(hclsid);
-    }
-    RegCloseKey(htypelib);
-    return  file;
-}
-
-static VALUE
-typelib_file_from_clsid(VALUE ole)
-{
-    HKEY hroot, hclsid;
-    LONG err;
-    VALUE typelib;
-    char path[MAX_PATH + 1];
-
-    err = reg_open_key(HKEY_CLASSES_ROOT, "CLSID", &hroot);
-    if (err != ERROR_SUCCESS) {
-        return Qnil;
-    }
-    err = reg_open_key(hroot, StringValuePtr(ole), &hclsid);
-    if (err != ERROR_SUCCESS) {
-        RegCloseKey(hroot);
-        return Qnil;
-    }
-    typelib = reg_get_val2(hclsid, "InprocServer32");
-    RegCloseKey(hroot);
-    RegCloseKey(hclsid);
-    if (typelib != Qnil) {
-        ExpandEnvironmentStrings(StringValuePtr(typelib), path, sizeof(path));
-        path[MAX_PATH] = '\0';
-        typelib = rb_str_new2(path);
-    }
-    return typelib;
-}
-
-VALUE
-typelib_file(VALUE ole)
-{
-    VALUE file = typelib_file_from_clsid(ole);
-    if (file != Qnil) {
-        return file;
-    }
-    return typelib_file_from_typelib(ole);
-}
-
-
-/*
- *  call-seq:
- *     ole_types -> The array of WIN32OLE::Type object included the type library.
- *
- *  Returns the type library file path.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     classes = tlib.ole_types.collect{|k| k.name} # -> ['AddIn', 'AddIns' ...]
- */
-static VALUE
-foletypelib_ole_types(VALUE self)
-{
-    ITypeLib *pTypeLib = NULL;
-    VALUE classes = rb_ary_new();
-    pTypeLib = itypelib(self);
-    ole_types_from_typelib(pTypeLib, classes);
-    return classes;
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the type library name with class name.
- *
- *     tlib = WIN32OLE::TypeLib.new('Microsoft Excel 9.0 Object Library')
- *     tlib.inspect # => "<#WIN32OLE::TypeLib:Microsoft Excel 9.0 Object Library>"
- */
-static VALUE
-foletypelib_inspect(VALUE self)
-{
-    return default_inspect(self, "WIN32OLE::TypeLib");
-}
-
-VALUE cWIN32OLE_TYPELIB;
-
-void
-Init_win32ole_typelib(void)
-{
-    cWIN32OLE_TYPELIB = rb_define_class_under(cWIN32OLE, "TypeLib", rb_cObject);
-    /* Alias of WIN32OLE::TypeLib, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_TYPELIB", cWIN32OLE_TYPELIB);
-    rb_define_singleton_method(cWIN32OLE_TYPELIB, "typelibs", foletypelib_s_typelibs, 0);
-    rb_define_alloc_func(cWIN32OLE_TYPELIB, foletypelib_s_allocate);
-    rb_define_method(cWIN32OLE_TYPELIB, "initialize", foletypelib_initialize, -2);
-    rb_define_method(cWIN32OLE_TYPELIB, "guid", foletypelib_guid, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "name", foletypelib_name, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "version", foletypelib_version, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "major_version", foletypelib_major_version, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "minor_version", foletypelib_minor_version, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "path", foletypelib_path, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "ole_types", foletypelib_ole_types, 0);
-    rb_define_alias(cWIN32OLE_TYPELIB, "ole_classes", "ole_types");
-    rb_define_method(cWIN32OLE_TYPELIB, "visible?", foletypelib_visible, 0);
-    rb_define_method(cWIN32OLE_TYPELIB, "library_name", foletypelib_library_name, 0);
-    rb_define_alias(cWIN32OLE_TYPELIB, "to_s", "name");
-    rb_define_method(cWIN32OLE_TYPELIB, "inspect", foletypelib_inspect, 0);
-}
diff --git a/ext/win32ole/win32ole_typelib.h b/ext/win32ole/win32ole_typelib.h
deleted file mode 100644
index 2c2730bb58..0000000000
--- a/ext/win32ole/win32ole_typelib.h
+++ /dev/null
@@ -1,11 +0,0 @@
-#ifndef WIN32OLE_TYPELIB_H
-#define WIN32OLE_TYPELIB_H 1
-
-extern VALUE cWIN32OLE_TYPELIB;
-
-void Init_win32ole_typelib(void);
-ITypeLib * itypelib(VALUE self);
-VALUE typelib_file(VALUE ole);
-VALUE create_win32ole_typelib(ITypeLib *pTypeLib);
-VALUE ole_typelib_from_itypeinfo(ITypeInfo *pTypeInfo);
-#endif
diff --git a/ext/win32ole/win32ole_variable.c b/ext/win32ole/win32ole_variable.c
deleted file mode 100644
index 34435301d4..0000000000
--- a/ext/win32ole/win32ole_variable.c
+++ /dev/null
@@ -1,385 +0,0 @@
-#include "win32ole.h"
-
-struct olevariabledata {
-    ITypeInfo *pTypeInfo;
-    UINT index;
-};
-
-static void olevariable_free(void *ptr);
-static size_t olevariable_size(const void *ptr);
-static VALUE folevariable_name(VALUE self);
-static VALUE ole_variable_ole_type(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_ole_type(VALUE self);
-static VALUE ole_variable_ole_type_detail(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_ole_type_detail(VALUE self);
-static VALUE ole_variable_value(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_value(VALUE self);
-static VALUE ole_variable_visible(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_visible(VALUE self);
-static VALUE ole_variable_kind(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_variable_kind(VALUE self);
-static VALUE ole_variable_varkind(ITypeInfo *pTypeInfo, UINT var_index);
-static VALUE folevariable_varkind(VALUE self);
-static VALUE folevariable_inspect(VALUE self);
-
-static const rb_data_type_t olevariable_datatype = {
-    "win32ole_variable",
-    {NULL, olevariable_free, olevariable_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static void
-olevariable_free(void *ptr)
-{
-    struct olevariabledata *polevar = ptr;
-    OLE_FREE(polevar->pTypeInfo);
-    free(polevar);
-}
-
-static size_t
-olevariable_size(const void *ptr)
-{
-    return ptr ? sizeof(struct olevariabledata) : 0;
-}
-
-/*
- * Document-class: WIN32OLE::Variable
- *
- *   +WIN32OLE::Variable+ objects represent OLE variable information.
- */
-
-VALUE
-create_win32ole_variable(ITypeInfo *pTypeInfo, UINT index, VALUE name)
-{
-    struct olevariabledata *pvar;
-    VALUE obj = TypedData_Make_Struct(cWIN32OLE_VARIABLE, struct olevariabledata,
-                                      &olevariable_datatype, pvar);
-    pvar->pTypeInfo = pTypeInfo;
-    OLE_ADDREF(pTypeInfo);
-    pvar->index = index;
-    rb_ivar_set(obj, rb_intern("name"), name);
-    return obj;
-}
-
-/*
- *  call-seq:
- *     name
- *
- *  Returns the name of variable.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *     variables = tobj.variables
- *     variables.each do |variable|
- *       puts "#{variable.name}"
- *     end
- *
- *     The result of above script is following:
- *       xlChart
- *       xlDialogSheet
- *       xlExcel4IntlMacroSheet
- *       xlExcel4MacroSheet
- *       xlWorksheet
- *
- */
-static VALUE
-folevariable_name(VALUE self)
-{
-    return rb_ivar_get(self, rb_intern("name"));
-}
-
-static VALUE
-ole_variable_ole_type(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE type;
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetVarDesc");
-    type = ole_typedesc2val(pTypeInfo, &(pVarDesc->elemdescVar.tdesc), Qnil);
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    return type;
-}
-
-/*
- *   call-seq:
- *      ole_type
- *
- *   Returns OLE type string.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *     variables = tobj.variables
- *     variables.each do |variable|
- *       puts "#{variable.ole_type} #{variable.name}"
- *     end
- *
- *     The result of above script is following:
- *       INT xlChart
- *       INT xlDialogSheet
- *       INT xlExcel4IntlMacroSheet
- *       INT xlExcel4MacroSheet
- *       INT xlWorksheet
- *
- */
-static VALUE
-folevariable_ole_type(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_ole_type(pvar->pTypeInfo, pvar->index);
-}
-
-static VALUE
-ole_variable_ole_type_detail(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE type = rb_ary_new();
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to GetVarDesc");
-    ole_typedesc2val(pTypeInfo, &(pVarDesc->elemdescVar.tdesc), type);
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    return type;
-}
-
-/*
- *  call-seq:
- *     ole_type_detail
- *
- *  Returns detail information of type. The information is array of type.
- *
- *     tobj = WIN32OLE::Type.new('DirectX 7 for Visual Basic Type Library', 'D3DCLIPSTATUS')
- *     variable = tobj.variables.find {|variable| variable.name == 'lFlags'}
- *     tdetail  = variable.ole_type_detail
- *     p tdetail # => ["USERDEFINED", "CONST_D3DCLIPSTATUSFLAGS"]
- *
- */
-static VALUE
-folevariable_ole_type_detail(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_ole_type_detail(pvar->pTypeInfo, pvar->index);
-}
-
-static VALUE
-ole_variable_value(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE val = Qnil;
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        return Qnil;
-    if(pVarDesc->varkind == VAR_CONST)
-        val = ole_variant2val(V_UNION1(pVarDesc, lpvarValue));
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    return val;
-}
-
-/*
- *  call-seq:
- *     value
- *
- *  Returns value if value is exists. If the value does not exist,
- *  this method returns nil.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *     variables = tobj.variables
- *     variables.each do |variable|
- *       puts "#{variable.name} #{variable.value}"
- *     end
- *
- *     The result of above script is following:
- *       xlChart = -4109
- *       xlDialogSheet = -4116
- *       xlExcel4IntlMacroSheet = 4
- *       xlExcel4MacroSheet = 3
- *       xlWorksheet = -4167
- *
- */
-static VALUE
-folevariable_value(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_value(pvar->pTypeInfo, pvar->index);
-}
-
-static VALUE
-ole_variable_visible(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE visible = Qfalse;
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        return visible;
-    if (!(pVarDesc->wVarFlags & (VARFLAG_FHIDDEN |
-                                 VARFLAG_FRESTRICTED |
-                                 VARFLAG_FNONBROWSABLE))) {
-        visible = Qtrue;
-    }
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    return visible;
-}
-
-/*
- *  call-seq:
- *     visible?
- *
- *  Returns true if the variable is public.
- *
- *     tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *     variables = tobj.variables
- *     variables.each do |variable|
- *       puts "#{variable.name} #{variable.visible?}"
- *     end
- *
- *     The result of above script is following:
- *       xlChart true
- *       xlDialogSheet true
- *       xlExcel4IntlMacroSheet true
- *       xlExcel4MacroSheet true
- *       xlWorksheet true
- *
- */
-static VALUE
-folevariable_visible(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_visible(pvar->pTypeInfo, pvar->index);
-}
-
-static VALUE
-ole_variable_kind(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE kind = rb_str_new2("UNKNOWN");
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        return kind;
-    switch(pVarDesc->varkind) {
-    case VAR_PERINSTANCE:
-        kind = rb_str_new2("PERINSTANCE");
-        break;
-    case VAR_STATIC:
-        kind = rb_str_new2("STATIC");
-        break;
-    case VAR_CONST:
-        kind = rb_str_new2("CONSTANT");
-        break;
-    case VAR_DISPATCH:
-        kind = rb_str_new2("DISPATCH");
-        break;
-    default:
-        break;
-    }
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    return kind;
-}
-
-/*
- * call-seq:
- *   variable_kind
- *
- * Returns variable kind string.
- *
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *    variables = tobj.variables
- *    variables.each do |variable|
- *      puts "#{variable.name} #{variable.variable_kind}"
- *    end
- *
- *    The result of above script is following:
- *      xlChart CONSTANT
- *      xlDialogSheet CONSTANT
- *      xlExcel4IntlMacroSheet CONSTANT
- *      xlExcel4MacroSheet CONSTANT
- *      xlWorksheet CONSTANT
- */
-static VALUE
-folevariable_variable_kind(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_kind(pvar->pTypeInfo, pvar->index);
-}
-
-static VALUE
-ole_variable_varkind(ITypeInfo *pTypeInfo, UINT var_index)
-{
-    VARDESC *pVarDesc;
-    HRESULT hr;
-    VALUE kind = Qnil;
-    hr = pTypeInfo->lpVtbl->GetVarDesc(pTypeInfo, var_index, &pVarDesc);
-    if (FAILED(hr))
-        return kind;
-    pTypeInfo->lpVtbl->ReleaseVarDesc(pTypeInfo, pVarDesc);
-    kind = RB_INT2FIX(pVarDesc->varkind);
-    return kind;
-}
-
-/*
- *  call-seq:
- *     varkind
- *
- *  Returns the number which represents variable kind.
- *    tobj = WIN32OLE::Type.new('Microsoft Excel 9.0 Object Library', 'XlSheetType')
- *    variables = tobj.variables
- *    variables.each do |variable|
- *      puts "#{variable.name} #{variable.varkind}"
- *    end
- *
- *    The result of above script is following:
- *       xlChart 2
- *       xlDialogSheet 2
- *       xlExcel4IntlMacroSheet 2
- *       xlExcel4MacroSheet 2
- *       xlWorksheet 2
- */
-static VALUE
-folevariable_varkind(VALUE self)
-{
-    struct olevariabledata *pvar;
-    TypedData_Get_Struct(self, struct olevariabledata, &olevariable_datatype, pvar);
-    return ole_variable_varkind(pvar->pTypeInfo, pvar->index);
-}
-
-/*
- *  call-seq:
- *     inspect -> String
- *
- *  Returns the OLE variable name and the value with class name.
- *
- */
-static VALUE
-folevariable_inspect(VALUE self)
-{
-    VALUE v = rb_inspect(folevariable_value(self));
-    VALUE n = folevariable_name(self);
-    VALUE detail = rb_sprintf("%"PRIsVALUE"=%"PRIsVALUE, n, v);
-    return make_inspect("WIN32OLE::Variable", detail);
-}
-
-VALUE cWIN32OLE_VARIABLE;
-
-void Init_win32ole_variable(void)
-{
-    cWIN32OLE_VARIABLE = rb_define_class_under(cWIN32OLE, "Variable", rb_cObject);
-    /* Alias of WIN32OLE::Variable, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_VARIABLE", cWIN32OLE_VARIABLE);
-    rb_undef_alloc_func(cWIN32OLE_VARIABLE);
-    rb_define_method(cWIN32OLE_VARIABLE, "name", folevariable_name, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "ole_type", folevariable_ole_type, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "ole_type_detail", folevariable_ole_type_detail, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "value", folevariable_value, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "visible?", folevariable_visible, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "variable_kind", folevariable_variable_kind, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "varkind", folevariable_varkind, 0);
-    rb_define_method(cWIN32OLE_VARIABLE, "inspect", folevariable_inspect, 0);
-    rb_define_alias(cWIN32OLE_VARIABLE, "to_s", "name");
-}
diff --git a/ext/win32ole/win32ole_variable.h b/ext/win32ole/win32ole_variable.h
deleted file mode 100644
index 209613fd44..0000000000
--- a/ext/win32ole/win32ole_variable.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef WIN32OLE_VARIABLE_H
-#define WIN32OLE_VARIABLE_H 1
-
-extern VALUE cWIN32OLE_VARIABLE;
-VALUE create_win32ole_variable(ITypeInfo *pTypeInfo, UINT index, VALUE name);
-void Init_win32ole_variable(void);
-
-#endif
diff --git a/ext/win32ole/win32ole_variant.c b/ext/win32ole/win32ole_variant.c
deleted file mode 100644
index 45c70b1dc3..0000000000
--- a/ext/win32ole/win32ole_variant.c
+++ /dev/null
@@ -1,737 +0,0 @@
-#include "win32ole.h"
-
-struct olevariantdata {
-    VARIANT realvar;
-    VARIANT var;
-};
-
-static void  olevariant_free(void *ptr);
-static size_t  olevariant_size(const void *ptr);
-static void ole_val2olevariantdata(VALUE val, VARTYPE vt, struct olevariantdata *pvar);
-static void ole_val2variant_err(VALUE val, VARIANT *var);
-static void ole_set_byref(VARIANT *realvar, VARIANT *var,  VARTYPE vt);
-static VALUE folevariant_s_allocate(VALUE klass);
-static VALUE folevariant_s_array(VALUE klass, VALUE dims, VALUE vvt);
-static void check_type_val2variant(VALUE val);
-static VALUE folevariant_initialize(VALUE self, VALUE args);
-static LONG *ary2safe_array_index(int ary_size, VALUE *ary, SAFEARRAY *psa);
-static void unlock_safe_array(SAFEARRAY *psa);
-static SAFEARRAY *get_locked_safe_array(VALUE val);
-static VALUE folevariant_ary_aref(int argc, VALUE *argv, VALUE self);
-static VALUE folevariant_ary_aset(int argc, VALUE *argv, VALUE self);
-static VALUE folevariant_value(VALUE self);
-static VALUE folevariant_vartype(VALUE self);
-static VALUE folevariant_set_value(VALUE self, VALUE val);
-
-static const rb_data_type_t olevariant_datatype = {
-    "win32ole_variant",
-    {NULL, olevariant_free, olevariant_size,},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
-};
-
-static void
-olevariant_free(void *ptr)
-{
-    struct olevariantdata *pvar = ptr;
-    VariantClear(&(pvar->realvar));
-    VariantClear(&(pvar->var));
-    free(pvar);
-}
-
-static size_t
-olevariant_size(const void *ptr)
-{
-    return ptr ? sizeof(struct olevariantdata) : 0;
-}
-
-static void
-ole_val2olevariantdata(VALUE val, VARTYPE vt, struct olevariantdata *pvar)
-{
-    HRESULT hr = S_OK;
-
-    if (((vt & ~VT_BYREF) ==  (VT_ARRAY | VT_UI1)) && RB_TYPE_P(val, T_STRING)) {
-        long len = RSTRING_LEN(val);
-        void *pdest = NULL;
-        SAFEARRAY *p = NULL;
-        SAFEARRAY *psa = SafeArrayCreateVector(VT_UI1, 0, len);
-        if (!psa) {
-            rb_raise(rb_eRuntimeError, "fail to SafeArrayCreateVector");
-        }
-        hr = SafeArrayAccessData(psa, &pdest);
-        if (SUCCEEDED(hr)) {
-            memcpy(pdest, RSTRING_PTR(val), len);
-            SafeArrayUnaccessData(psa);
-            V_VT(&(pvar->realvar)) = (vt & ~VT_BYREF);
-            p = V_ARRAY(&(pvar->realvar));
-            if (p != NULL) {
-                SafeArrayDestroy(p);
-            }
-            V_ARRAY(&(pvar->realvar)) = psa;
-            if (vt & VT_BYREF) {
-                V_VT(&(pvar->var)) = vt;
-                V_ARRAYREF(&(pvar->var)) = &(V_ARRAY(&(pvar->realvar)));
-            } else {
-                hr = VariantCopy(&(pvar->var), &(pvar->realvar));
-            }
-        } else {
-            if (psa)
-                SafeArrayDestroy(psa);
-        }
-    } else if (vt & VT_ARRAY) {
-        if (val == Qnil) {
-            V_VT(&(pvar->var)) = vt;
-            if (vt & VT_BYREF) {
-                V_ARRAYREF(&(pvar->var)) = &(V_ARRAY(&(pvar->realvar)));
-            }
-        } else {
-            hr = ole_val_ary2variant_ary(val, &(pvar->realvar), (VARTYPE)(vt & ~VT_BYREF));
-            if (SUCCEEDED(hr)) {
-                if (vt & VT_BYREF) {
-                    V_VT(&(pvar->var)) = vt;
-                    V_ARRAYREF(&(pvar->var)) = &(V_ARRAY(&(pvar->realvar)));
-                } else {
-                    hr = VariantCopy(&(pvar->var), &(pvar->realvar));
-                }
-            }
-        }
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    } else if ( (vt & ~VT_BYREF) == VT_I8 || (vt & ~VT_BYREF) == VT_UI8) {
-        ole_val2variant_ex(val, &(pvar->realvar), (vt & ~VT_BYREF));
-        ole_val2variant_ex(val, &(pvar->var), (vt & ~VT_BYREF));
-        V_VT(&(pvar->var)) = vt;
-        if (vt & VT_BYREF) {
-            ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-        }
-#endif
-    } else if ( (vt & ~VT_BYREF) == VT_ERROR) {
-        ole_val2variant_err(val, &(pvar->realvar));
-        if (vt & VT_BYREF) {
-            ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-        } else {
-            hr = VariantCopy(&(pvar->var), &(pvar->realvar));
-        }
-    } else {
-        if (val == Qnil) {
-            V_VT(&(pvar->var)) = vt;
-            if (vt == (VT_BYREF | VT_VARIANT)) {
-                ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-            } else {
-                V_VT(&(pvar->realvar)) = vt & ~VT_BYREF;
-                if (vt & VT_BYREF) {
-                    ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-                }
-            }
-        } else {
-            ole_val2variant_ex(val, &(pvar->realvar), (VARTYPE)(vt & ~VT_BYREF));
-            if (vt == (VT_BYREF | VT_VARIANT)) {
-                ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-            } else if (vt & VT_BYREF) {
-                if ( (vt & ~VT_BYREF) != V_VT(&(pvar->realvar))) {
-                    hr = VariantChangeTypeEx(&(pvar->realvar), &(pvar->realvar),
-                            cWIN32OLE_lcid, 0, (VARTYPE)(vt & ~VT_BYREF));
-                }
-                if (SUCCEEDED(hr)) {
-                    ole_set_byref(&(pvar->realvar), &(pvar->var), vt);
-                }
-            } else {
-                if (vt == V_VT(&(pvar->realvar))) {
-                    hr = VariantCopy(&(pvar->var), &(pvar->realvar));
-                } else {
-                    hr = VariantChangeTypeEx(&(pvar->var), &(pvar->realvar),
-                            cWIN32OLE_lcid, 0, vt);
-                }
-            }
-        }
-    }
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to change type");
-    }
-}
-
-static void
-ole_val2variant_err(VALUE val, VARIANT *var)
-{
-    VALUE v = val;
-    if (rb_obj_is_kind_of(v, cWIN32OLE_VARIANT)) {
-        v = folevariant_value(v);
-    }
-    if (!(FIXNUM_P(v) || RB_TYPE_P(v, T_BIGNUM) || v == Qnil)) {
-        rb_raise(eWIN32OLERuntimeError, "failed to convert VT_ERROR VARIANT:`%"PRIsVALUE"'", rb_inspect(v));
-    }
-    V_VT(var) = VT_ERROR;
-    if (v != Qnil) {
-        V_ERROR(var) = RB_NUM2LONG(val);
-    } else {
-        V_ERROR(var) = 0;
-    }
-}
-
-static void
-ole_set_byref(VARIANT *realvar, VARIANT *var,  VARTYPE vt)
-{
-    V_VT(var) = vt;
-    if (vt == (VT_VARIANT|VT_BYREF)) {
-        V_VARIANTREF(var) = realvar;
-    } else {
-        if (V_VT(realvar) != (vt & ~VT_BYREF)) {
-            rb_raise(eWIN32OLERuntimeError, "variant type mismatch");
-        }
-        switch(vt & ~VT_BYREF) {
-        case VT_I1:
-            V_I1REF(var) = &V_I1(realvar);
-            break;
-        case VT_UI1:
-            V_UI1REF(var) = &V_UI1(realvar);
-            break;
-        case VT_I2:
-            V_I2REF(var) = &V_I2(realvar);
-            break;
-        case VT_UI2:
-            V_UI2REF(var) = &V_UI2(realvar);
-            break;
-        case VT_I4:
-            V_I4REF(var) = &V_I4(realvar);
-            break;
-        case VT_UI4:
-            V_UI4REF(var) = &V_UI4(realvar);
-            break;
-        case VT_R4:
-            V_R4REF(var) = &V_R4(realvar);
-            break;
-        case VT_R8:
-            V_R8REF(var) = &V_R8(realvar);
-            break;
-
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-#ifdef V_I8REF
-        case VT_I8:
-            V_I8REF(var) = &V_I8(realvar);
-            break;
-#endif
-#ifdef V_UI8REF
-        case VT_UI8:
-            V_UI8REF(var) = &V_UI8(realvar);
-            break;
-#endif
-#endif
-        case VT_INT:
-            V_INTREF(var) = &V_INT(realvar);
-            break;
-
-        case VT_UINT:
-            V_UINTREF(var) = &V_UINT(realvar);
-            break;
-
-        case VT_CY:
-            V_CYREF(var) = &V_CY(realvar);
-            break;
-        case VT_DATE:
-            V_DATEREF(var) = &V_DATE(realvar);
-            break;
-        case VT_BSTR:
-            V_BSTRREF(var) = &V_BSTR(realvar);
-            break;
-        case VT_DISPATCH:
-            V_DISPATCHREF(var) = &V_DISPATCH(realvar);
-            break;
-        case VT_ERROR:
-            V_ERRORREF(var) = &V_ERROR(realvar);
-            break;
-        case VT_BOOL:
-            V_BOOLREF(var) = &V_BOOL(realvar);
-            break;
-        case VT_UNKNOWN:
-            V_UNKNOWNREF(var) = &V_UNKNOWN(realvar);
-            break;
-        case VT_ARRAY:
-            V_ARRAYREF(var) = &V_ARRAY(realvar);
-            break;
-        default:
-            rb_raise(eWIN32OLERuntimeError, "unknown type specified(setting BYREF):%d", vt);
-            break;
-        }
-    }
-}
-
-static VALUE
-folevariant_s_allocate(VALUE klass)
-{
-    struct olevariantdata *pvar;
-    VALUE obj;
-    ole_initialize();
-    obj = TypedData_Make_Struct(klass, struct olevariantdata, &olevariant_datatype, pvar);
-    VariantInit(&(pvar->var));
-    VariantInit(&(pvar->realvar));
-    return obj;
-}
-
-/*
- *  call-seq:
- *     array(ary, vt)
- *
- *  Returns Ruby object wrapping OLE variant whose variant type is VT_ARRAY.
- *  The first argument should be Array object which specifies dimensions
- *  and each size of dimensions of OLE array.
- *  The second argument specifies variant type of the element of OLE array.
- *
- *  The following create 2 dimensions OLE array. The first dimensions size
- *  is 3, and the second is 4.
- *
- *     ole_ary = WIN32OLE::Variant.array([3,4], VT_I4)
- *     ruby_ary = ole_ary.value # => [[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]
- *
- */
-static VALUE
-folevariant_s_array(VALUE klass, VALUE elems, VALUE vvt)
-{
-    VALUE obj = Qnil;
-    VARTYPE vt;
-    struct olevariantdata *pvar;
-    SAFEARRAYBOUND *psab = NULL;
-    SAFEARRAY *psa = NULL;
-    UINT dim = 0;
-    UINT i = 0;
-
-    ole_initialize();
-
-    vt = RB_NUM2UINT(vvt);
-    vt = (vt | VT_ARRAY);
-    Check_Type(elems, T_ARRAY);
-    obj = folevariant_s_allocate(klass);
-
-    TypedData_Get_Struct(obj, struct olevariantdata, &olevariant_datatype, pvar);
-    dim = RARRAY_LEN(elems);
-
-    psab = ALLOC_N(SAFEARRAYBOUND, dim);
-
-    if(!psab) {
-        rb_raise(rb_eRuntimeError, "memory allocation error");
-    }
-
-    for (i = 0; i < dim; i++) {
-        psab[i].cElements = RB_FIX2INT(rb_ary_entry(elems, i));
-        psab[i].lLbound = 0;
-    }
-
-    psa = SafeArrayCreate((VARTYPE)(vt & VT_TYPEMASK), dim, psab);
-    if (psa == NULL) {
-        if (psab) free(psab);
-        rb_raise(rb_eRuntimeError, "memory allocation error(SafeArrayCreate)");
-    }
-
-    V_VT(&(pvar->var)) = vt;
-    if (vt & VT_BYREF) {
-        V_VT(&(pvar->realvar)) = (vt & ~VT_BYREF);
-        V_ARRAY(&(pvar->realvar)) = psa;
-        V_ARRAYREF(&(pvar->var)) = &(V_ARRAY(&(pvar->realvar)));
-    } else {
-        V_ARRAY(&(pvar->var)) = psa;
-    }
-    if (psab) free(psab);
-    return obj;
-}
-
-static void
-check_type_val2variant(VALUE val)
-{
-    VALUE elem;
-    int len = 0;
-    int i = 0;
-    if(!rb_obj_is_kind_of(val, cWIN32OLE) &&
-       !rb_obj_is_kind_of(val, cWIN32OLE_VARIANT) &&
-       !rb_obj_is_kind_of(val, rb_cTime)) {
-        switch (TYPE(val)) {
-        case T_ARRAY:
-            len = RARRAY_LEN(val);
-            for(i = 0; i < len; i++) {
-                elem = rb_ary_entry(val, i);
-                check_type_val2variant(elem);
-            }
-            break;
-        case T_STRING:
-        case T_FIXNUM:
-        case T_BIGNUM:
-        case T_FLOAT:
-        case T_TRUE:
-        case T_FALSE:
-        case T_NIL:
-            break;
-        default:
-            rb_raise(rb_eTypeError, "can not convert WIN32OLE::Variant from type %s",
-                     rb_obj_classname(val));
-        }
-    }
-}
-
-/*
- * Document-class: WIN32OLE::Variant
- *
- *   +WIN32OLE::Variant+ objects represents OLE variant.
- *
- *   Win32OLE converts Ruby object into OLE variant automatically when
- *   invoking OLE methods. If OLE method requires the argument which is
- *   different from the variant by automatic conversion of Win32OLE, you
- *   can convert the specified variant type by using WIN32OLE::Variant class.
- *
- *     param = WIN32OLE::Variant.new(10, WIN32OLE::VARIANT::VT_R4)
- *     oleobj.method(param)
- *
- *   WIN32OLE::Variant does not support VT_RECORD variant. Use WIN32OLE::Record
- *   class instead of WIN32OLE::Variant if the VT_RECORD variant is needed.
- */
-
-/*
- *  call-seq:
- *     new(val, vartype) #=> WIN32OLE::Variant object.
- *
- *  Returns Ruby object wrapping OLE variant.
- *  The first argument specifies Ruby object to convert OLE variant variable.
- *  The second argument specifies VARIANT type.
- *  In some situation, you need the WIN32OLE::Variant object to pass OLE method
- *
- *     shell = WIN32OLE.new("Shell.Application")
- *     folder = shell.NameSpace("C:\\Windows")
- *     item = folder.ParseName("tmp.txt")
- *     # You can't use Ruby String object to call FolderItem.InvokeVerb.
- *     # Instead, you have to use WIN32OLE::Variant object to call the method.
- *     shortcut = WIN32OLE::Variant.new("Create Shortcut(\&S)")
- *     item.invokeVerb(shortcut)
- *
- */
-static VALUE
-folevariant_initialize(VALUE self, VALUE args)
-{
-    int len = 0;
-    VARIANT var;
-    VALUE val;
-    VALUE vvt;
-    VARTYPE vt;
-    struct olevariantdata *pvar;
-
-    len = RARRAY_LEN(args);
-    rb_check_arity(len, 1, 3);
-    VariantInit(&var);
-    val = rb_ary_entry(args, 0);
-
-    check_type_val2variant(val);
-
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-    if (len == 1) {
-        ole_val2variant(val, &(pvar->var));
-    } else {
-        vvt = rb_ary_entry(args, 1);
-        vt = RB_NUM2INT(vvt);
-        if ((vt & VT_TYPEMASK) == VT_RECORD) {
-            rb_raise(rb_eArgError, "not supported VT_RECORD WIN32OLE::Variant object");
-        }
-        ole_val2olevariantdata(val, vt, pvar);
-    }
-    return self;
-}
-
-static SAFEARRAY *
-get_locked_safe_array(VALUE val)
-{
-    struct olevariantdata *pvar;
-    SAFEARRAY *psa = NULL;
-    HRESULT hr;
-    TypedData_Get_Struct(val, struct olevariantdata, &olevariant_datatype, pvar);
-    if (!(V_VT(&(pvar->var)) & VT_ARRAY)) {
-        rb_raise(rb_eTypeError, "variant type is not VT_ARRAY.");
-    }
-    psa = V_ISBYREF(&(pvar->var)) ? *V_ARRAYREF(&(pvar->var)) : V_ARRAY(&(pvar->var));
-    if (psa == NULL) {
-        return psa;
-    }
-    hr = SafeArrayLock(psa);
-    if (FAILED(hr)) {
-        ole_raise(hr, rb_eRuntimeError, "failed to SafeArrayLock");
-    }
-    return psa;
-}
-
-static LONG *
-ary2safe_array_index(int ary_size, VALUE *ary, SAFEARRAY *psa)
-{
-    long dim;
-    LONG *pid;
-    long i;
-    dim = SafeArrayGetDim(psa);
-    if (dim != ary_size) {
-        rb_raise(rb_eArgError, "unmatch number of indices");
-    }
-    pid = ALLOC_N(LONG, dim);
-    if (pid == NULL) {
-        rb_raise(rb_eRuntimeError, "failed to allocate memory for indices");
-    }
-    for (i = 0; i < dim; i++) {
-        pid[i] = RB_NUM2INT(ary[i]);
-    }
-    return pid;
-}
-
-static void
-unlock_safe_array(SAFEARRAY *psa)
-{
-    HRESULT hr;
-    hr = SafeArrayUnlock(psa);
-    if (FAILED(hr)) {
-        ole_raise(hr, rb_eRuntimeError, "failed to SafeArrayUnlock");
-    }
-}
-
-/*
- *  call-seq:
- *     variant[i,j,...] #=> element of OLE array.
- *
- *  Returns the element of WIN32OLE::Variant object(OLE array).
- *  This method is available only when the variant type of
- *  WIN32OLE::Variant object is VT_ARRAY.
- *
- *  REMARK:
- *     The all indices should be 0 or natural number and
- *     lower than or equal to max indices.
- *     (This point is different with Ruby Array indices.)
- *
- *     obj = WIN32OLE::Variant.new([[1,2,3],[4,5,6]])
- *     p obj[0,0] # => 1
- *     p obj[1,0] # => 4
- *     p obj[2,0] # => WIN32OLE::RuntimeError
- *     p obj[0, -1] # => WIN32OLE::RuntimeError
- *
- */
-static VALUE
-folevariant_ary_aref(int argc, VALUE *argv, VALUE self)
-{
-    struct olevariantdata *pvar;
-    SAFEARRAY *psa;
-    VALUE val = Qnil;
-    VARIANT variant;
-    LONG *pid;
-    HRESULT hr;
-
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-    if (!V_ISARRAY(&(pvar->var))) {
-        rb_raise(eWIN32OLERuntimeError,
-                 "`[]' is not available for this variant type object");
-    }
-    psa = get_locked_safe_array(self);
-    if (psa == NULL) {
-        return val;
-    }
-
-    pid = ary2safe_array_index(argc, argv, psa);
-
-    VariantInit(&variant);
-    V_VT(&variant) = (V_VT(&(pvar->var)) & ~VT_ARRAY) | VT_BYREF;
-    hr = SafeArrayPtrOfIndex(psa, pid, &V_BYREF(&variant));
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to SafeArrayPtrOfIndex");
-    }
-    val = ole_variant2val(&variant);
-
-    unlock_safe_array(psa);
-    if (pid) free(pid);
-    return val;
-}
-
-/*
- *  call-seq:
- *     variant[i,j,...] = val #=> set the element of OLE array
- *
- *  Set the element of WIN32OLE::Variant object(OLE array) to val.
- *  This method is available only when the variant type of
- *  WIN32OLE::Variant object is VT_ARRAY.
- *
- *  REMARK:
- *     The all indices should be 0 or natural number and
- *     lower than or equal to max indices.
- *     (This point is different with Ruby Array indices.)
- *
- *     obj = WIN32OLE::Variant.new([[1,2,3],[4,5,6]])
- *     obj[0,0] = 7
- *     obj[1,0] = 8
- *     p obj.value # => [[7,2,3], [8,5,6]]
- *     obj[2,0] = 9 # => WIN32OLE::RuntimeError
- *     obj[0, -1] = 9 # => WIN32OLE::RuntimeError
- *
- */
-static VALUE
-folevariant_ary_aset(int argc, VALUE *argv, VALUE self)
-{
-    struct olevariantdata *pvar;
-    SAFEARRAY *psa;
-    VARIANT var;
-    VARTYPE vt;
-    LONG *pid;
-    HRESULT hr;
-    VOID *p = NULL;
-
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-    if (!V_ISARRAY(&(pvar->var))) {
-        rb_raise(eWIN32OLERuntimeError,
-                 "`[]' is not available for this variant type object");
-    }
-    psa = get_locked_safe_array(self);
-    if (psa == NULL) {
-        rb_raise(rb_eRuntimeError, "failed to get SafeArray pointer");
-    }
-
-    pid = ary2safe_array_index(argc-1, argv, psa);
-
-    VariantInit(&var);
-    vt = (V_VT(&(pvar->var)) & ~VT_ARRAY);
-    p = val2variant_ptr(argv[argc-1], &var, vt);
-    if ((V_VT(&var) == VT_DISPATCH && V_DISPATCH(&var) == NULL) ||
-        (V_VT(&var) == VT_UNKNOWN && V_UNKNOWN(&var) == NULL)) {
-        rb_raise(eWIN32OLERuntimeError, "argument does not have IDispatch or IUnknown Interface");
-    }
-    hr = SafeArrayPutElement(psa, pid, p);
-    if (FAILED(hr)) {
-        ole_raise(hr, eWIN32OLERuntimeError, "failed to SafeArrayPutElement");
-    }
-
-    unlock_safe_array(psa);
-    if (pid) free(pid);
-    return argv[argc-1];
-}
-
-/*
- *  call-seq:
- *     value #=> Ruby object.
- *
- *  Returns Ruby object value from OLE variant.
- *     obj = WIN32OLE::Variant.new(1, WIN32OLE::VARIANT::VT_BSTR)
- *     obj.value # => "1" (not Integer object, but String object "1")
- *
- */
-static VALUE
-folevariant_value(VALUE self)
-{
-    struct olevariantdata *pvar;
-    VALUE val = Qnil;
-    VARTYPE vt;
-    int dim;
-    SAFEARRAY *psa;
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-
-    val = ole_variant2val(&(pvar->var));
-    vt = V_VT(&(pvar->var));
-
-    if ((vt & ~VT_BYREF) == (VT_UI1|VT_ARRAY)) {
-        if (vt & VT_BYREF) {
-            psa = *V_ARRAYREF(&(pvar->var));
-        } else {
-            psa  = V_ARRAY(&(pvar->var));
-        }
-        if (!psa) {
-            return val;
-        }
-        dim = SafeArrayGetDim(psa);
-        if (dim == 1) {
-            val = rb_funcall(val, rb_intern("pack"), 1, rb_str_new2("C*"));
-        }
-    }
-    return val;
-}
-
-/*
- *  call-seq:
- *     vartype #=> OLE variant type.
- *
- *  Returns OLE variant type.
- *     obj = WIN32OLE::Variant.new("string")
- *     obj.vartype # => WIN32OLE::VARIANT::VT_BSTR
- *
- */
-static VALUE
-folevariant_vartype(VALUE self)
-{
-    struct olevariantdata *pvar;
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-    return RB_INT2FIX(V_VT(&pvar->var));
-}
-
-/*
- *  call-seq:
- *     variant.value = val #=> set WIN32OLE::Variant value to val.
- *
- *  Sets variant value to val. If the val type does not match variant value
- *  type(vartype), then val is changed to match variant value type(vartype)
- *  before setting val.
- *  This method is not available when vartype is VT_ARRAY(except VT_UI1|VT_ARRAY).
- *  If the vartype is VT_UI1|VT_ARRAY, the val should be String object.
- *
- *     obj = WIN32OLE::Variant.new(1) # obj.vartype is WIN32OLE::VARIANT::VT_I4
- *     obj.value = 3.2 # 3.2 is changed to 3 when setting value.
- *     p obj.value # => 3
- */
-static VALUE
-folevariant_set_value(VALUE self, VALUE val)
-{
-    struct olevariantdata *pvar;
-    VARTYPE vt;
-    TypedData_Get_Struct(self, struct olevariantdata, &olevariant_datatype, pvar);
-    vt = V_VT(&(pvar->var));
-    if (V_ISARRAY(&(pvar->var)) && ((vt & ~VT_BYREF) != (VT_UI1|VT_ARRAY) || !RB_TYPE_P(val, T_STRING))) {
-        rb_raise(eWIN32OLERuntimeError,
-                 "`value=' is not available for this variant type object");
-    }
-    ole_val2olevariantdata(val, vt, pvar);
-    return Qnil;
-}
-
-void
-ole_variant2variant(VALUE val, VARIANT *var)
-{
-    struct olevariantdata *pvar;
-    TypedData_Get_Struct(val, struct olevariantdata, &olevariant_datatype, pvar);
-    VariantCopy(var, &(pvar->var));
-}
-
-VALUE cWIN32OLE_VARIANT;
-
-void
-Init_win32ole_variant(void)
-{
-#undef rb_intern
-    cWIN32OLE_VARIANT = rb_define_class_under(cWIN32OLE, "Variant", rb_cObject);
-    /* Alias of WIN32OLE::Variant, for the backward compatibility */
-    rb_define_const(rb_cObject, "WIN32OLE_VARIANT", cWIN32OLE_VARIANT);
-    rb_define_alloc_func(cWIN32OLE_VARIANT, folevariant_s_allocate);
-    rb_define_singleton_method(cWIN32OLE_VARIANT, "array", folevariant_s_array, 2);
-    rb_define_method(cWIN32OLE_VARIANT, "initialize", folevariant_initialize, -2);
-    rb_define_method(cWIN32OLE_VARIANT, "value", folevariant_value, 0);
-    rb_define_method(cWIN32OLE_VARIANT, "value=", folevariant_set_value, 1);
-    rb_define_method(cWIN32OLE_VARIANT, "vartype", folevariant_vartype, 0);
-    rb_define_method(cWIN32OLE_VARIANT, "[]", folevariant_ary_aref, -1);
-    rb_define_method(cWIN32OLE_VARIANT, "[]=", folevariant_ary_aset, -1);
-
-    /*
-     * represents VT_EMPTY OLE object.
-     */
-    rb_define_const(cWIN32OLE_VARIANT, "Empty",
-            rb_funcall(cWIN32OLE_VARIANT, rb_intern("new"), 2, Qnil, RB_INT2FIX(VT_EMPTY)));
-
-    /*
-     * represents VT_NULL OLE object.
-     */
-    rb_define_const(cWIN32OLE_VARIANT, "Null",
-            rb_funcall(cWIN32OLE_VARIANT, rb_intern("new"), 2, Qnil, RB_INT2FIX(VT_NULL)));
-
-    /*
-     * represents Nothing of VB.NET or VB.
-     */
-    rb_define_const(cWIN32OLE_VARIANT, "Nothing",
-            rb_funcall(cWIN32OLE_VARIANT, rb_intern("new"), 2, Qnil, RB_INT2FIX(VT_DISPATCH)));
-
-    /*
-     * represents VT_ERROR variant with DISP_E_PARAMNOTFOUND.
-     * This constants is used for not specified parameter.
-     *
-     *  fso = WIN32OLE.new("Scripting.FileSystemObject")
-     *  fso.openTextFile(filename, WIN32OLE::Variant::NoParam, false)
-     */
-    rb_define_const(cWIN32OLE_VARIANT, "NoParam",
-            rb_funcall(cWIN32OLE_VARIANT, rb_intern("new"), 2, INT2NUM(DISP_E_PARAMNOTFOUND), RB_INT2FIX(VT_ERROR)));
-}
diff --git a/ext/win32ole/win32ole_variant.h b/ext/win32ole/win32ole_variant.h
deleted file mode 100644
index 4bd3b0aeea..0000000000
--- a/ext/win32ole/win32ole_variant.h
+++ /dev/null
@@ -1,9 +0,0 @@
-#ifndef WIN32OLE_VARIANT_H
-#define WIN32OLE_VARIANT_H 1
-
-extern VALUE cWIN32OLE_VARIANT;
-void ole_variant2variant(VALUE val, VARIANT *var);
-void Init_win32ole_variant(void);
-
-#endif
-
diff --git a/ext/win32ole/win32ole_variant_m.c b/ext/win32ole/win32ole_variant_m.c
deleted file mode 100644
index d879506be3..0000000000
--- a/ext/win32ole/win32ole_variant_m.c
+++ /dev/null
@@ -1,153 +0,0 @@
-#include "win32ole.h"
-
-VALUE mWIN32OLE_VARIANT;
-
-void Init_win32ole_variant_m(void)
-{
-    /*
-     * Document-module: WIN32OLE::VariantType
-     *
-     * The +WIN32OLE::VariantType+ module includes constants of VARIANT type constants.
-     * The constants is used when creating WIN32OLE::Variant object.
-     *
-     *   obj = WIN32OLE::Variant.new("2e3", WIN32OLE::VARIANT::VT_R4)
-     *   obj.value # => 2000.0
-     *
-     */
-    mWIN32OLE_VARIANT = rb_define_module_under(cWIN32OLE, "VariantType");
-    /* Alias of WIN32OLE::VariantType, for the backward compatibility */
-    rb_define_const(cWIN32OLE, "VARIANT", mWIN32OLE_VARIANT);
-
-    /*
-     * represents VT_EMPTY type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_EMPTY", RB_INT2FIX(VT_EMPTY));
-
-    /*
-     * represents VT_NULL type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_NULL", RB_INT2FIX(VT_NULL));
-
-    /*
-     * represents VT_I2 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_I2", RB_INT2FIX(VT_I2));
-
-    /*
-     * represents VT_I4 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_I4", RB_INT2FIX(VT_I4));
-
-    /*
-     * represents VT_R4 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_R4", RB_INT2FIX(VT_R4));
-
-    /*
-     * represents VT_R8 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_R8", RB_INT2FIX(VT_R8));
-
-    /*
-     * represents VT_CY type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_CY", RB_INT2FIX(VT_CY));
-
-    /*
-     * represents VT_DATE type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_DATE", RB_INT2FIX(VT_DATE));
-
-    /*
-     * represents VT_BSTR type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_BSTR", RB_INT2FIX(VT_BSTR));
-
-    /*
-     * represents VT_USERDEFINED type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_USERDEFINED", RB_INT2FIX(VT_USERDEFINED));
-
-    /*
-     * represents VT_PTR type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_PTR", RB_INT2FIX(VT_PTR));
-
-    /*
-     * represents VT_DISPATCH type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_DISPATCH", RB_INT2FIX(VT_DISPATCH));
-
-    /*
-     * represents VT_ERROR type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_ERROR", RB_INT2FIX(VT_ERROR));
-
-    /*
-     * represents VT_BOOL type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_BOOL", RB_INT2FIX(VT_BOOL));
-
-    /*
-     * represents VT_VARIANT type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_VARIANT", RB_INT2FIX(VT_VARIANT));
-
-    /*
-     * represents VT_UNKNOWN type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UNKNOWN", RB_INT2FIX(VT_UNKNOWN));
-
-    /*
-     * represents VT_I1 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_I1", RB_INT2FIX(VT_I1));
-
-    /*
-     * represents VT_UI1 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UI1", RB_INT2FIX(VT_UI1));
-
-    /*
-     * represents VT_UI2 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UI2", RB_INT2FIX(VT_UI2));
-
-    /*
-     * represents VT_UI4 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UI4", RB_INT2FIX(VT_UI4));
-
-#if (defined(_MSC_VER) && (_MSC_VER >= 1300)) || defined(__CYGWIN__) || defined(__MINGW32__)
-    /*
-     * represents VT_I8 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_I8", RB_INT2FIX(VT_I8));
-
-    /*
-     * represents VT_UI8 type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UI8", RB_INT2FIX(VT_UI8));
-#endif
-
-    /*
-     * represents VT_INT type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_INT", RB_INT2FIX(VT_INT));
-
-    /*
-     * represents VT_UINT type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_UINT", RB_INT2FIX(VT_UINT));
-
-    /*
-     * represents VT_ARRAY type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_ARRAY", RB_INT2FIX(VT_ARRAY));
-
-    /*
-     * represents VT_BYREF type constant.
-     */
-    rb_define_const(mWIN32OLE_VARIANT, "VT_BYREF", RB_INT2FIX(VT_BYREF));
-
-}
diff --git a/ext/win32ole/win32ole_variant_m.h b/ext/win32ole/win32ole_variant_m.h
deleted file mode 100644
index 6272a6578f..0000000000
--- a/ext/win32ole/win32ole_variant_m.h
+++ /dev/null
@@ -1,7 +0,0 @@
-#ifndef WIN32OLE_VARIANT_M_H
-#define WIN32OLE_VARIANT_M_H 1
-
-extern VALUE mWIN32OLE_VARIANT;
-void Init_win32ole_variant_m(void);
-
-#endif
diff --git a/ext/zlib/depend b/ext/zlib/depend
index bdce420264..22e9ca867a 100644
--- a/ext/zlib/depend
+++ b/ext/zlib/depend
@@ -138,6 +138,7 @@ zlib.o: $(hdrdir)/ruby/internal/intern/re.h
 zlib.o: $(hdrdir)/ruby/internal/intern/ruby.h
 zlib.o: $(hdrdir)/ruby/internal/intern/select.h
 zlib.o: $(hdrdir)/ruby/internal/intern/select/largesize.h
+zlib.o: $(hdrdir)/ruby/internal/intern/set.h
 zlib.o: $(hdrdir)/ruby/internal/intern/signal.h
 zlib.o: $(hdrdir)/ruby/internal/intern/sprintf.h
 zlib.o: $(hdrdir)/ruby/internal/intern/string.h
diff --git a/ext/zlib/zlib.c b/ext/zlib/zlib.c
index aad9f8d28a..481d74b2b6 100644
--- a/ext/zlib/zlib.c
+++ b/ext/zlib/zlib.c
@@ -25,7 +25,7 @@
 # define VALGRIND_MAKE_MEM_UNDEFINED(p, n) 0
 #endif
 
-#define RUBY_ZLIB_VERSION "3.1.0"
+#define RUBY_ZLIB_VERSION "3.2.3"
 
 #ifndef RB_PASS_CALLED_KEYWORDS
 # define rb_class_new_instance_kw(argc, argv, klass, kw_splat) rb_class_new_instance(argc, argv, klass)
@@ -674,9 +674,7 @@ zstream_expand_buffer(struct zstream *z)
 	        rb_obj_reveal(z->buf, rb_cString);
             }
 
-            rb_mutex_unlock(z->mutex);
-	    rb_protect(rb_yield, z->buf, &state);
-            rb_mutex_lock(z->mutex);
+            rb_protect(rb_yield, z->buf, &state);
 
             if (ZSTREAM_REUSE_BUFFER_P(z)) {
                 rb_str_modify(z->buf);
@@ -720,15 +718,14 @@ zstream_expand_buffer_into(struct zstream *z, unsigned long size)
     }
 }
 
-static void *
-zstream_expand_buffer_protect(void *ptr)
+static int
+zstream_expand_buffer_protect(struct zstream *z)
 {
-    struct zstream *z = (struct zstream *)ptr;
     int state = 0;
 
     rb_protect((VALUE (*)(VALUE))zstream_expand_buffer, (VALUE)z, &state);
 
-    return (void *)(VALUE)state;
+    return state;
 }
 
 static int
@@ -863,9 +860,7 @@ zstream_buffer_ungets(struct zstream *z, const Bytef *b, unsigned long len)
     char *bufptr;
     long filled;
 
-    if (NIL_P(z->buf) || (long)rb_str_capacity(z->buf) <= ZSTREAM_BUF_FILLED(z)) {
-	zstream_expand_buffer_into(z, len);
-    }
+    zstream_expand_buffer_into(z, len);
 
     RSTRING_GETMEM(z->buf, bufptr, filled);
     memmove(bufptr + len, bufptr, filled);
@@ -1023,57 +1018,14 @@ zstream_ensure_end(VALUE v)
 }
 
 static void *
-zstream_run_func(void *ptr)
+zstream_run_once(void *_arguments)
 {
-    struct zstream_run_args *args = (struct zstream_run_args *)ptr;
-    int err, state, flush = args->flush;
-    struct zstream *z = args->z;
-    uInt n;
-
-    err = Z_OK;
-    while (!args->interrupt) {
-	n = z->stream.avail_out;
-	err = z->func->run(&z->stream, flush);
-	rb_str_set_len(z->buf, ZSTREAM_BUF_FILLED(z) + (n - z->stream.avail_out));
+    struct zstream_run_args *arguments = (struct zstream_run_args *)_arguments;
+    struct zstream *z = arguments->z;
 
-	if (err == Z_STREAM_END) {
-	    z->flags &= ~ZSTREAM_FLAG_IN_STREAM;
-	    z->flags |= ZSTREAM_FLAG_FINISHED;
-	    break;
-	}
+    uintptr_t error = z->func->run(&z->stream, arguments->flush);
 
-	if (err != Z_OK && err != Z_BUF_ERROR)
-	    break;
-
-	if (z->stream.avail_out > 0) {
-	    z->flags |= ZSTREAM_FLAG_IN_STREAM;
-	    break;
-	}
-
-	if (z->stream.avail_in == 0 && z->func == &inflate_funcs) {
-	    /* break here because inflate() return Z_BUF_ERROR when avail_in == 0. */
-	    /* but deflate() could be called with avail_in == 0 (there's hidden buffer
-	       in zstream->state) */
-	    z->flags |= ZSTREAM_FLAG_IN_STREAM;
-	    break;
-	}
-
-	if (args->stream_output) {
-	    state = (int)(VALUE)rb_thread_call_with_gvl(zstream_expand_buffer_protect,
-							(void *)z);
-	}
-	else {
-	    state = zstream_expand_buffer_non_stream(z);
-	}
-
-	if (state) {
-	    err = Z_OK; /* buffer expanded but stream processing was stopped */
-	    args->jump_state = state;
-	    break;
-	}
-    }
-
-    return (void *)(VALUE)err;
+    return (void*)error;
 }
 
 /*
@@ -1088,6 +1040,92 @@ zstream_unblock_func(void *ptr)
     args->interrupt = 1;
 }
 
+#ifndef RB_NOGVL_OFFLOAD_SAFE
+// Default to no-op if it's not defined:
+#define RB_NOGVL_OFFLOAD_SAFE 0
+#endif
+
+static VALUE
+zstream_run_once_begin(VALUE _arguments)
+{
+    struct zstream_run_args *arguments = (struct zstream_run_args *)_arguments;
+    struct zstream *z = arguments->z;
+
+    rb_str_locktmp(z->buf);
+
+#ifndef RB_NOGVL_UBF_ASYNC_SAFE
+    return (VALUE)rb_thread_call_without_gvl(zstream_run_once, (void *)arguments, zstream_unblock_func, (void *)arguments);
+#else
+    return (VALUE)rb_nogvl(zstream_run_once, (void *)arguments, zstream_unblock_func, (void *)arguments, RB_NOGVL_UBF_ASYNC_SAFE | RB_NOGVL_OFFLOAD_SAFE);
+#endif
+}
+
+static VALUE
+zstream_run_once_ensure(VALUE _arguments)
+{
+    struct zstream_run_args *arguments = (struct zstream_run_args *)_arguments;
+    struct zstream *z = arguments->z;
+
+    rb_str_unlocktmp(z->buf);
+
+    return Qnil;
+}
+
+static int
+zstream_run_func(struct zstream_run_args *args)
+{
+    struct zstream *z = args->z;
+    int state;
+    uInt n;
+
+    int err = Z_OK;
+    while (!args->interrupt) {
+        n = z->stream.avail_out;
+
+        err = (int)(VALUE)rb_ensure(zstream_run_once_begin, (VALUE)args, zstream_run_once_ensure, (VALUE)args);
+
+        rb_str_set_len(z->buf, ZSTREAM_BUF_FILLED(z) + (n - z->stream.avail_out));
+
+        if (err == Z_STREAM_END) {
+            z->flags &= ~ZSTREAM_FLAG_IN_STREAM;
+            z->flags |= ZSTREAM_FLAG_FINISHED;
+            break;
+        }
+
+        if (err != Z_OK && err != Z_BUF_ERROR) {
+            break;
+        }
+
+        if (z->stream.avail_out > 0) {
+            z->flags |= ZSTREAM_FLAG_IN_STREAM;
+            break;
+        }
+
+        if (z->stream.avail_in == 0 && z->func == &inflate_funcs) {
+            /* break here because inflate() return Z_BUF_ERROR when avail_in == 0. */
+            /* but deflate() could be called with avail_in == 0 (there's hidden buffer
+                in zstream->state) */
+            z->flags |= ZSTREAM_FLAG_IN_STREAM;
+            break;
+        }
+
+        if (args->stream_output) {
+            state = zstream_expand_buffer_protect(z);
+        }
+        else {
+            state = zstream_expand_buffer_non_stream(z);
+        }
+
+        if (state) {
+            err = Z_OK; /* buffer expanded but stream processing was stopped */
+            args->jump_state = state;
+            break;
+        }
+    }
+
+    return err;
+}
+
 static VALUE
 zstream_run_try(VALUE value_arg)
 {
@@ -1100,6 +1138,12 @@ zstream_run_try(VALUE value_arg)
     int err;
     VALUE old_input = Qnil;
 
+    /* Cannot start zstream while it is in progress. */
+    if (z->flags & ZSTREAM_IN_PROGRESS) {
+	rb_raise(cInProgressError, "zlib stream is in progress");
+    }
+    z->flags |= ZSTREAM_IN_PROGRESS;
+
     if (NIL_P(z->input) && len == 0) {
 	z->stream.next_in = (Bytef*)"";
 	z->stream.avail_in = 0;
@@ -1120,24 +1164,22 @@ zstream_run_try(VALUE value_arg)
     }
 
 loop:
-#ifndef RB_NOGVL_UBF_ASYNC_SAFE
-    err = (int)(VALUE)rb_thread_call_without_gvl(zstream_run_func, (void *)args,
-						 zstream_unblock_func, (void *)args);
-#else
-    err = (int)(VALUE)rb_nogvl(zstream_run_func, (void *)args,
-                               zstream_unblock_func, (void *)args,
-                               RB_NOGVL_UBF_ASYNC_SAFE);
-#endif
+    err = zstream_run_func(args);
 
     /* retry if no exception is thrown */
     if (err == Z_OK && args->interrupt) {
        args->interrupt = 0;
-       goto loop;
+
+       /* Retry only if both avail_in > 0 (more input to process) and avail_out > 0
+        * (output buffer has space). If avail_out == 0, the buffer is full and should
+        * be consumed by the caller first. If avail_in == 0, there's nothing more to process. */
+       if (z->stream.avail_in > 0 && z->stream.avail_out > 0) {
+          goto loop;
+       }
     }
 
-    if (flush != Z_FINISH && err == Z_BUF_ERROR
-	    && z->stream.avail_out > 0) {
-	z->flags |= ZSTREAM_FLAG_IN_STREAM;
+    if (flush != Z_FINISH && err == Z_BUF_ERROR && z->stream.avail_out > 0) {
+        z->flags |= ZSTREAM_FLAG_IN_STREAM;
     }
 
     zstream_reset_input(z);
@@ -1167,9 +1209,6 @@ loop:
 	rb_str_resize(old_input, 0);
     }
 
-    if (args->jump_state)
-	rb_jump_tag(args->jump_state);
-
     return Qnil;
 }
 
@@ -1177,25 +1216,10 @@ static VALUE
 zstream_run_ensure(VALUE value_arg)
 {
     struct zstream_run_args *args = (struct zstream_run_args *)value_arg;
+    struct zstream *z = args->z;
 
     /* Remove ZSTREAM_IN_PROGRESS flag to signal that this zstream is not in use. */
-    args->z->flags &= ~ZSTREAM_IN_PROGRESS;
-
-    return Qnil;
-}
-
-static VALUE
-zstream_run_synchronized(VALUE value_arg)
-{
-    struct zstream_run_args *args = (struct zstream_run_args *)value_arg;
-
-    /* Cannot start zstream while it is in progress. */
-    if (args->z->flags & ZSTREAM_IN_PROGRESS) {
-        rb_raise(cInProgressError, "zlib stream is in progress");
-    }
-    args->z->flags |= ZSTREAM_IN_PROGRESS;
-
-    rb_ensure(zstream_run_try, value_arg, zstream_run_ensure, value_arg);
+    z->flags &= ~ZSTREAM_IN_PROGRESS;
 
     return Qnil;
 }
@@ -1212,7 +1236,10 @@ zstream_run(struct zstream *z, Bytef *src, long len, int flush)
         .jump_state = 0,
         .stream_output = !ZSTREAM_IS_GZFILE(z) && rb_block_given_p(),
     };
-    rb_mutex_synchronize(z->mutex, zstream_run_synchronized, (VALUE)&args);
+
+    rb_ensure(zstream_run_try, (VALUE)&args, zstream_run_ensure, (VALUE)&args);
+    if (args.jump_state)
+	rb_jump_tag(args.jump_state);
 }
 
 static VALUE
@@ -1433,6 +1460,7 @@ rb_zstream_finish(VALUE obj)
  * call-seq:
  *   flush_next_in -> input
  *
+ * Flushes input buffer and returns all data in that buffer.
  */
 static VALUE
 rb_zstream_flush_next_in(VALUE obj)
@@ -1521,7 +1549,7 @@ rb_zstream_total_out(VALUE obj)
 }
 
 /*
- * Guesses the type of the data which have been inputed into the stream. The
+ * Guesses the type of the data which have been inputted into the stream. The
  * returned value is either <tt>BINARY</tt>, <tt>ASCII</tt>, or
  * <tt>UNKNOWN</tt>.
  */
@@ -1778,6 +1806,22 @@ do_deflate(struct zstream *z, VALUE src, int flush)
     }
 }
 
+struct rb_zlib_deflate_arguments {
+    struct zstream *z;
+    VALUE src;
+    int flush;
+};
+
+static VALUE
+rb_deflate_deflate_body(VALUE args)
+{
+    struct rb_zlib_deflate_arguments *arguments = (struct rb_zlib_deflate_arguments *)args;
+
+    do_deflate(arguments->z, arguments->src, arguments->flush);
+
+    return zstream_detach_buffer(arguments->z);
+}
+
 /*
  * Document-method: Zlib::Deflate#deflate
  *
@@ -1809,11 +1853,10 @@ rb_deflate_deflate(int argc, VALUE *argv, VALUE obj)
 {
     struct zstream *z = get_zstream(obj);
     VALUE src, flush;
-
     rb_scan_args(argc, argv, "11", &src, &flush);
-    do_deflate(z, src, ARG_FLUSH(flush));
+    struct rb_zlib_deflate_arguments arguments = {z, src, ARG_FLUSH(flush)};
 
-    return zstream_detach_buffer(z);
+    return rb_mutex_synchronize(z->mutex, rb_deflate_deflate_body, (VALUE)&arguments);
 }
 
 /*
@@ -2109,56 +2152,19 @@ rb_inflate_add_dictionary(VALUE obj, VALUE dictionary)
     return obj;
 }
 
-/*
- * Document-method: Zlib::Inflate#inflate
- *
- * call-seq:
- *   inflate(deflate_string, buffer: nil)                 -> String
- *   inflate(deflate_string, buffer: nil) { |chunk| ... } -> nil
- *
- * Inputs +deflate_string+ into the inflate stream and returns the output from
- * the stream.  Calling this method, both the input and the output buffer of
- * the stream are flushed.  If string is +nil+, this method finishes the
- * stream, just like Zlib::ZStream#finish.
- *
- * If a block is given consecutive inflated chunks from the +deflate_string+
- * are yielded to the block and +nil+ is returned.
- *
- * If a :buffer keyword argument is given and not nil:
- *
- * * The :buffer keyword should be a String, and will used as the output buffer.
- *   Using this option can reuse the memory required during inflation.
- * * When not passing a block, the return value will be the same object as the
- *   :buffer keyword argument.
- * * When passing a block, the yielded chunks will be the same value as the
- *   :buffer keyword argument.
- *
- * Raises a Zlib::NeedDict exception if a preset dictionary is needed to
- * decompress.  Set the dictionary by Zlib::Inflate#set_dictionary and then
- * call this method again with an empty string to flush the stream:
- *
- *   inflater = Zlib::Inflate.new
- *
- *   begin
- *     out = inflater.inflate compressed
- *   rescue Zlib::NeedDict
- *     # ensure the dictionary matches the stream's required dictionary
- *     raise unless inflater.adler == Zlib.adler32(dictionary)
- *
- *     inflater.set_dictionary dictionary
- *     inflater.inflate ''
- *   end
- *
- *   # ...
- *
- *   inflater.close
- *
- * See also Zlib::Inflate.new
- */
+struct rb_zlib_inflate_arguments {
+    struct zstream *z;
+    int argc;
+    VALUE *argv;
+};
+
 static VALUE
-rb_inflate_inflate(int argc, VALUE* argv, VALUE obj)
+rb_inflate_inflate_body(VALUE _arguments)
 {
-    struct zstream *z = get_zstream(obj);
+    struct rb_zlib_inflate_arguments *arguments = (struct rb_zlib_inflate_arguments*)_arguments;
+    struct zstream *z = arguments->z;
+    int argc = arguments->argc;
+    VALUE *argv = arguments->argv;
     VALUE dst, src, opts, buffer = Qnil;
 
     if (OPTHASH_GIVEN_P(opts)) {
@@ -2214,6 +2220,60 @@ rb_inflate_inflate(int argc, VALUE* argv, VALUE obj)
 }
 
 /*
+ * Document-method: Zlib::Inflate#inflate
+ *
+ * call-seq:
+ *   inflate(deflate_string, buffer: nil)                 -> String
+ *   inflate(deflate_string, buffer: nil) { |chunk| ... } -> nil
+ *
+ * Inputs +deflate_string+ into the inflate stream and returns the output from
+ * the stream.  Calling this method, both the input and the output buffer of
+ * the stream are flushed.  If string is +nil+, this method finishes the
+ * stream, just like Zlib::ZStream#finish.
+ *
+ * If a block is given consecutive inflated chunks from the +deflate_string+
+ * are yielded to the block and +nil+ is returned.
+ *
+ * If a :buffer keyword argument is given and not nil:
+ *
+ * * The :buffer keyword should be a String, and will used as the output buffer.
+ *   Using this option can reuse the memory required during inflation.
+ * * When not passing a block, the return value will be the same object as the
+ *   :buffer keyword argument.
+ * * When passing a block, the yielded chunks will be the same value as the
+ *   :buffer keyword argument.
+ *
+ * Raises a Zlib::NeedDict exception if a preset dictionary is needed to
+ * decompress.  Set the dictionary by Zlib::Inflate#set_dictionary and then
+ * call this method again with an empty string to flush the stream:
+ *
+ *   inflater = Zlib::Inflate.new
+ *
+ *   begin
+ *     out = inflater.inflate compressed
+ *   rescue Zlib::NeedDict
+ *     # ensure the dictionary matches the stream's required dictionary
+ *     raise unless inflater.adler == Zlib.adler32(dictionary)
+ *
+ *     inflater.set_dictionary dictionary
+ *     inflater.inflate ''
+ *   end
+ *
+ *   # ...
+ *
+ *   inflater.close
+ *
+ * See also Zlib::Inflate.new
+ */
+static VALUE
+rb_inflate_inflate(int argc, VALUE* argv, VALUE obj)
+{
+    struct zstream *z = get_zstream(obj);
+    struct rb_zlib_inflate_arguments arguments = {z, argc, argv};
+    return rb_mutex_synchronize(z->mutex, rb_inflate_inflate_body, (VALUE)&arguments);
+}
+
+/*
  * call-seq: << string
  *
  * Inputs +string+ into the inflate stream just like Zlib::Inflate#inflate, but
@@ -2389,17 +2449,16 @@ struct gzfile {
 
 #define GZFILE_READ_SIZE  2048
 
+enum { read_raw_arg_len, read_raw_arg_buf, read_raw_arg__count};
 struct read_raw_arg {
     VALUE io;
-    union {
-	const VALUE argv[2]; /* for rb_funcallv */
-	struct {
-	    VALUE len;
-	    VALUE buf;
-	} in;
-    } as;
+    const VALUE argv[read_raw_arg__count]; /* for rb_funcallv */
 };
 
+#define read_raw_arg_argc(ra) \
+    ((int)read_raw_arg__count - NIL_P((ra)->argv[read_raw_arg__count - 1]))
+#define read_raw_arg_init(io, len, buf) { io, { len, buf } }
+
 static void
 gzfile_mark(void *p)
 {
@@ -2525,9 +2584,9 @@ gzfile_read_raw_partial(VALUE arg)
 {
     struct read_raw_arg *ra = (struct read_raw_arg *)arg;
     VALUE str;
-    int argc = NIL_P(ra->as.argv[1]) ? 1 : 2;
+    int argc = read_raw_arg_argc(ra);
 
-    str = rb_funcallv(ra->io, id_readpartial, argc, ra->as.argv);
+    str = rb_funcallv(ra->io, id_readpartial, argc, ra->argv);
     Check_Type(str, T_STRING);
     return str;
 }
@@ -2538,8 +2597,8 @@ gzfile_read_raw_rescue(VALUE arg, VALUE _)
     struct read_raw_arg *ra = (struct read_raw_arg *)arg;
     VALUE str = Qnil;
     if (rb_obj_is_kind_of(rb_errinfo(), rb_eNoMethodError)) {
-	int argc = NIL_P(ra->as.argv[1]) ? 1 : 2;
-	str = rb_funcallv(ra->io, id_read, argc, ra->as.argv);
+	int argc = read_raw_arg_argc(ra);
+	str = rb_funcallv(ra->io, id_read, argc, ra->argv);
         if (!NIL_P(str)) {
             Check_Type(str, T_STRING);
         }
@@ -2550,11 +2609,8 @@ gzfile_read_raw_rescue(VALUE arg, VALUE _)
 static VALUE
 gzfile_read_raw(struct gzfile *gz, VALUE outbuf)
 {
-    struct read_raw_arg ra;
-
-    ra.io = gz->io;
-    ra.as.in.len = INT2FIX(GZFILE_READ_SIZE);
-    ra.as.in.buf = outbuf;
+    struct read_raw_arg ra =
+	read_raw_arg_init(gz->io, INT2FIX(GZFILE_READ_SIZE), outbuf);
 
     return rb_rescue2(gzfile_read_raw_partial, (VALUE)&ra,
                       gzfile_read_raw_rescue, (VALUE)&ra,
@@ -4054,7 +4110,7 @@ rb_gzreader_read(int argc, VALUE *argv, VALUE obj)
  *  call-seq:
  *     gzipreader.readpartial(maxlen [, outbuf]) => string, outbuf
  *
- *  Reads at most <i>maxlen</i> bytes from the gziped stream but
+ *  Reads at most <i>maxlen</i> bytes from the gzipped stream but
  *  it blocks only if <em>gzipreader</em> has no data immediately available.
  *  If the optional <i>outbuf</i> argument is present,
  *  it must reference a String, which will receive the data.
@@ -4229,6 +4285,7 @@ gzreader_skip_linebreaks(struct gzfile *gz)
     while (n++, *(p++) == '\n') {
 	if (n >= ZSTREAM_BUF_FILLED(&gz->z)) {
 	    str = zstream_detach_buffer(&gz->z);
+	    ASSUME(!NIL_P(str));
 	    gzfile_calc_crc(gz, str);
 	    while (ZSTREAM_BUF_FILLED(&gz->z) == 0) {
 		if (GZFILE_IS_FINISHED(gz)) return;
@@ -4637,6 +4694,7 @@ zlib_gunzip_run(VALUE arg)
 
     gzfile_read_header(gz, Qnil);
     dst = zstream_detach_buffer(&gz->z);
+    ASSUME(!NIL_P(dst));
     gzfile_calc_crc(gz, dst);
     if (!ZSTREAM_IS_FINISHED(&gz->z)) {
 	rb_raise(cGzError, "unexpected end of file");
diff --git a/ext/zlib/zlib.gemspec b/ext/zlib/zlib.gemspec
index 345dc5f225..ba7114476f 100644
--- a/ext/zlib/zlib.gemspec
+++ b/ext/zlib/zlib.gemspec
@@ -27,5 +27,5 @@ Gem::Specification.new do |spec|
   spec.executables   = []
   spec.require_paths = ["lib"]
   spec.extensions    = "ext/zlib/extconf.rb"
-  spec.required_ruby_version = ">= 2.5.0"
+  spec.required_ruby_version = ">= 2.7.0"
 end
diff --git a/file.c b/file.c
index 835f19e541..fffd09c22e 100644
--- a/file.c
+++ b/file.c
@@ -12,6 +12,7 @@
 **********************************************************************/
 
 #include "ruby/internal/config.h"
+#include "ruby/internal/attr/nonstring.h"
 
 #ifdef _WIN32
 # include "missing/file.h"
@@ -131,6 +132,14 @@ int flock(int, int);
 # define STAT(p, s)      stat((p), (s))
 #endif /* _WIN32 */
 
+#ifdef HAVE_STRUCT_STATX_STX_BTIME
+# define ST_(name) stx_ ## name
+typedef struct statx_timestamp stat_timestamp;
+#else
+# define ST_(name) st_ ## name
+typedef struct timespec stat_timestamp;
+#endif
+
 #if defined _WIN32 || defined __APPLE__
 # define USE_OSPATH 1
 # define TO_OSPATH(str) rb_str_encode_ospath(str)
@@ -160,6 +169,7 @@ int flock(int, int);
 #include "internal.h"
 #include "internal/compilers.h"
 #include "internal/dir.h"
+#include "internal/encoding.h"
 #include "internal/error.h"
 #include "internal/file.h"
 #include "internal/io.h"
@@ -172,6 +182,13 @@ int flock(int, int);
 #include "ruby/thread.h"
 #include "ruby/util.h"
 
+#define UIANY2NUM(x) \
+    ((sizeof(x) <= sizeof(unsigned int)) ? \
+     UINT2NUM((unsigned)(x)) : \
+     (sizeof(x) <= sizeof(unsigned long)) ? \
+     ULONG2NUM((unsigned long)(x)) : \
+     ULL2NUM((unsigned LONG_LONG)(x)))
+
 VALUE rb_cFile;
 VALUE rb_mFileTest;
 VALUE rb_cStat;
@@ -197,15 +214,16 @@ file_path_convert(VALUE name)
     return name;
 }
 
-static rb_encoding *
+static void
 check_path_encoding(VALUE str)
 {
-    rb_encoding *enc = rb_enc_get(str);
-    if (!rb_enc_asciicompat(enc)) {
-        rb_raise(rb_eEncCompatError, "path name must be ASCII-compatible (%s): %"PRIsVALUE,
-                 rb_enc_name(enc), rb_str_inspect(str));
+    if (RB_UNLIKELY(!rb_str_enc_fastpath(str))) {
+        rb_encoding *enc = rb_str_enc_get(str);
+        if (!rb_enc_asciicompat(enc)) {
+            rb_raise(rb_eEncCompatError, "path name must be ASCII-compatible (%s): %"PRIsVALUE,
+                     rb_enc_name(enc), rb_str_inspect(str));
+        }
     }
-    return enc;
 }
 
 VALUE
@@ -227,13 +245,20 @@ VALUE
 rb_get_path_check_convert(VALUE obj)
 {
     obj = file_path_convert(obj);
+    rb_get_path_check_no_convert(obj);
+    return rb_str_new_frozen(obj);
+}
 
+/* TODO: name */
+VALUE
+rb_get_path_check_no_convert(VALUE obj)
+{
     check_path_encoding(obj);
     if (!rb_str_to_cstr(obj)) {
         rb_raise(rb_eArgError, "path name contains null byte");
     }
 
-    return rb_str_new4(obj);
+    return obj;
 }
 
 VALUE
@@ -248,6 +273,19 @@ rb_get_path(VALUE obj)
     return rb_get_path_check_convert(rb_get_path_check_to_string(obj));
 }
 
+static inline VALUE
+check_path(VALUE obj, const char **cstr)
+{
+    VALUE str = rb_get_path_check_convert(rb_get_path_check_to_string(obj));
+#if RUBY_DEBUG
+    str = rb_str_new_frozen(str);
+#endif
+    *cstr = RSTRING_PTR(str);
+    return str;
+}
+
+#define CheckPath(str, cstr) RB_GC_GUARD(str) = check_path(str, &cstr);
+
 VALUE
 rb_str_encode_ospath(VALUE path)
 {
@@ -271,6 +309,18 @@ rb_str_encode_ospath(VALUE path)
 # define NORMALIZE_UTF8PATH 1
 
 # ifdef HAVE_WORKING_FORK
+static CFMutableStringRef
+mutable_CFString_new(CFStringRef *s, const char *ptr, long len)
+{
+    const CFAllocatorRef alloc = kCFAllocatorDefault;
+    *s = CFStringCreateWithBytesNoCopy(alloc, (const UInt8 *)ptr, len,
+                                       kCFStringEncodingUTF8, FALSE,
+                                       kCFAllocatorNull);
+    return CFStringCreateMutableCopy(alloc, len, *s);
+}
+
+#   define mutable_CFString_release(m, s) (CFRelease(m), CFRelease(s))
+
 static void
 rb_CFString_class_initialize_before_fork(void)
 {
@@ -297,15 +347,17 @@ rb_CFString_class_initialize_before_fork(void)
     /* Enough small but non-empty ASCII string to fit in NSTaggedPointerString. */
     const char small_str[] = "/";
     long len = sizeof(small_str) - 1;
-
-    const CFAllocatorRef alloc = kCFAllocatorDefault;
-    CFStringRef s = CFStringCreateWithBytesNoCopy(alloc,
-                                                  (const UInt8 *)small_str,
-                                                  len, kCFStringEncodingUTF8,
-                                                  FALSE, kCFAllocatorNull);
-    CFMutableStringRef m = CFStringCreateMutableCopy(alloc, len, s);
-    CFRelease(m);
-    CFRelease(s);
+    CFStringRef s;
+    /*
+     * Touch `CFStringCreateWithBytesNoCopy` *twice* because the implementation
+     * shipped with macOS 15.0 24A5331b does not return `NSTaggedPointerString`
+     * instance for the first call (totally not sure why). CoreFoundation
+     * shipped with macOS 15.1 does not have this issue.
+     */
+    for (int i = 0; i < 2; i++) {
+        CFMutableStringRef m = mutable_CFString_new(&s, small_str, len);
+        mutable_CFString_release(m, s);
+    }
 }
 # endif /* HAVE_WORKING_FORK */
 
@@ -314,11 +366,8 @@ rb_str_append_normalized_ospath(VALUE str, const char *ptr, long len)
 {
     CFIndex buflen = 0;
     CFRange all;
-    CFStringRef s = CFStringCreateWithBytesNoCopy(kCFAllocatorDefault,
-                                                  (const UInt8 *)ptr, len,
-                                                  kCFStringEncodingUTF8, FALSE,
-                                                  kCFAllocatorNull);
-    CFMutableStringRef m = CFStringCreateMutableCopy(kCFAllocatorDefault, len, s);
+    CFStringRef s;
+    CFMutableStringRef m = mutable_CFString_new(&s, ptr, len);
     long oldlen = RSTRING_LEN(str);
 
     CFStringNormalize(m, kCFStringNormalizationFormC);
@@ -328,8 +377,7 @@ rb_str_append_normalized_ospath(VALUE str, const char *ptr, long len)
     CFStringGetBytes(m, all, kCFStringEncodingUTF8, '?', FALSE,
                      (UInt8 *)(RSTRING_PTR(str) + oldlen), buflen, &buflen);
     rb_str_set_len(str, oldlen + buflen);
-    CFRelease(m);
-    CFRelease(s);
+    mutable_CFString_release(m, s);
     return str;
 }
 
@@ -339,16 +387,22 @@ rb_str_normalize_ospath(const char *ptr, long len)
     const char *p = ptr;
     const char *e = ptr + len;
     const char *p1 = p;
-    VALUE str = rb_str_buf_new(len);
     rb_encoding *enc = rb_utf8_encoding();
-    rb_enc_associate(str, enc);
+    VALUE str = rb_utf8_str_new(ptr, len);
+    if (RB_LIKELY(rb_enc_str_coderange(str) == ENC_CODERANGE_7BIT)) {
+        return str;
+    }
+    else {
+        str = rb_str_buf_new(len);
+        rb_enc_associate(str, enc);
+    }
 
     while (p < e) {
         int l, c;
         int r = rb_enc_precise_mbclen(p, e, enc);
         if (!MBCLEN_CHARFOUND_P(r)) {
             /* invalid byte shall not happen but */
-            static const char invalid[3] = "\xEF\xBF\xBD";
+            RBIMPL_ATTR_NONSTRING() static const char invalid[3] = "\xEF\xBF\xBD";
             rb_str_append_normalized_ospath(str, p1, p-p1);
             rb_str_cat(str, invalid, sizeof(invalid));
             p += 1;
@@ -483,6 +537,10 @@ apply2files(int (*func)(const char *, void *), int argc, VALUE *argv, void *arg)
     return LONG2FIX(argc);
 }
 
+static stat_timestamp stat_atimespec(const struct stat *st);
+static stat_timestamp stat_mtimespec(const struct stat *st);
+static stat_timestamp stat_ctimespec(const struct stat *st);
+
 static const rb_data_type_t stat_data_type = {
     "stat",
     {
@@ -494,29 +552,67 @@ static const rb_data_type_t stat_data_type = {
 };
 
 struct rb_stat {
-    struct stat stat;
+    rb_io_stat_data stat;
     bool initialized;
 };
 
-static VALUE
-stat_new_0(VALUE klass, const struct stat *st)
+static struct rb_stat *
+stat_alloc(VALUE klass, VALUE *obj)
 {
     struct rb_stat *rb_st;
-    VALUE obj = TypedData_Make_Struct(klass, struct rb_stat, &stat_data_type, rb_st);
+    *obj = TypedData_Make_Struct(klass, struct rb_stat, &stat_data_type, rb_st);
+    return rb_st;
+}
+
+VALUE
+rb_stat_new(const struct stat *st)
+{
+    VALUE obj;
+    struct rb_stat *rb_st = stat_alloc(rb_cStat, &obj);
     if (st) {
+#if RUBY_USE_STATX
+# define CP(m) .stx_ ## m = st->st_ ## m
+# define CP_32(m) .stx_ ## m = (uint32_t)st->st_ ## m
+# define CP_TS(m) .stx_ ## m = stat_ ## m ## spec(st)
+        rb_st->stat = (struct statx){
+            .stx_mask = STATX_BASIC_STATS,
+            CP(mode),
+            CP_32(nlink),
+            CP(uid),
+            CP(gid),
+            CP_TS(atime),
+            CP_TS(mtime),
+            CP_TS(ctime),
+            CP(ino),
+            CP(size),
+            CP(blocks),
+        };
+# undef CP
+# undef CP_TS
+#else
         rb_st->stat = *st;
+#endif
         rb_st->initialized = true;
     }
+
     return obj;
 }
 
+#ifndef rb_statx_new
 VALUE
-rb_stat_new(const struct stat *st)
+rb_statx_new(const rb_io_stat_data *st)
 {
-    return stat_new_0(rb_cStat, st);
+    VALUE obj;
+    struct rb_stat *rb_st = stat_alloc(rb_cStat, &obj);
+    if (st) {
+        rb_st->stat = *st;
+        rb_st->initialized = true;
+    }
+    return obj;
 }
+#endif
 
-static struct stat*
+static rb_io_stat_data*
 get_stat(VALUE self)
 {
     struct rb_stat* rb_st;
@@ -525,29 +621,51 @@ get_stat(VALUE self)
     return &rb_st->stat;
 }
 
-static struct timespec stat_mtimespec(const struct stat *st);
+#if RUBY_USE_STATX
+static stat_timestamp
+statx_mtimespec(const rb_io_stat_data *st)
+{
+    return st->stx_mtime;
+}
+#else
+# define statx_mtimespec stat_mtimespec
+#endif
 
 /*
  *  call-seq:
- *     stat <=> other_stat    -> -1, 0, 1, nil
+ *    self <=> other -> -1, 0, 1, or nil
+ *
+ *  Compares +self+ and +other+, by comparing their modification times;
+ *  that is, by comparing <tt>self.mtime</tt> and <tt>other.mtime</tt>.
+ *
+ *  Returns:
  *
- *  Compares File::Stat objects by comparing their respective modification
- *  times.
+ *  - +-1+, if <tt>self.mtime</tt> is earlier.
+ *  - +0+, if the two values are equal.
+ *  - +1+, if <tt>self.mtime</tt> is later.
+ *  - +nil+, if +other+ is not a File::Stat object.
  *
- *  +nil+ is returned if +other_stat+ is not a File::Stat object
+ *  Examples:
  *
- *     f1 = File.new("f1", "w")
- *     sleep 1
- *     f2 = File.new("f2", "w")
- *     f1.stat <=> f2.stat   #=> -1
+ *    stat0 = File.stat('README.md')
+ *    stat1 = File.stat('NEWS.md')
+ *    stat0.mtime         # => 2025-12-20 15:33:05.6972341 -0600
+ *    stat1.mtime         # => 2025-12-20 16:02:08.2672945 -0600
+ *    stat0 <=> stat1     # => -1
+ *    stat0 <=> stat0.dup # => 0
+ *    stat1 <=> stat0     # => 1
+ *    stat0 <=> :foo      # => nil
+ *
+ *  \Class \File::Stat includes module Comparable,
+ *  each of whose methods uses File::Stat#<=> for comparison.
  */
 
 static VALUE
 rb_stat_cmp(VALUE self, VALUE other)
 {
     if (rb_obj_is_kind_of(other, rb_obj_class(self))) {
-        struct timespec ts1 = stat_mtimespec(get_stat(self));
-        struct timespec ts2 = stat_mtimespec(get_stat(other));
+        stat_timestamp ts1 = statx_mtimespec(get_stat(self));
+        stat_timestamp ts2 = statx_mtimespec(get_stat(other));
         if (ts1.tv_sec == ts2.tv_sec) {
             if (ts1.tv_nsec == ts2.tv_nsec) return INT2FIX(0);
             if (ts1.tv_nsec < ts2.tv_nsec) return INT2FIX(-1);
@@ -584,7 +702,11 @@ rb_stat_cmp(VALUE self, VALUE other)
 static VALUE
 rb_stat_dev(VALUE self)
 {
-#if SIZEOF_STRUCT_STAT_ST_DEV <= SIZEOF_DEV_T
+#if RUBY_USE_STATX
+    unsigned int m = get_stat(self)->stx_dev_major;
+    unsigned int n = get_stat(self)->stx_dev_minor;
+    return ULL2NUM(makedev(m, n));
+#elif SIZEOF_STRUCT_STAT_ST_DEV <= SIZEOF_DEV_T
     return DEVT2NUM(get_stat(self)->st_dev);
 #elif SIZEOF_STRUCT_STAT_ST_DEV <= SIZEOF_LONG
     return ULONG2NUM(get_stat(self)->st_dev);
@@ -607,7 +729,9 @@ rb_stat_dev(VALUE self)
 static VALUE
 rb_stat_dev_major(VALUE self)
 {
-#if defined(major)
+#if RUBY_USE_STATX
+    return UINT2NUM(get_stat(self)->stx_dev_major);
+#elif defined(major)
     return UINT2NUM(major(get_stat(self)->st_dev));
 #else
     return Qnil;
@@ -628,7 +752,9 @@ rb_stat_dev_major(VALUE self)
 static VALUE
 rb_stat_dev_minor(VALUE self)
 {
-#if defined(minor)
+#if RUBY_USE_STATX
+    return UINT2NUM(get_stat(self)->stx_dev_minor);
+#elif defined(minor)
     return UINT2NUM(minor(get_stat(self)->st_dev));
 #else
     return Qnil;
@@ -648,16 +774,15 @@ rb_stat_dev_minor(VALUE self)
 static VALUE
 rb_stat_ino(VALUE self)
 {
+    rb_io_stat_data *ptr = get_stat(self);
 #ifdef HAVE_STRUCT_STAT_ST_INOHIGH
     /* assume INTEGER_PACK_LSWORD_FIRST and st_inohigh is just next of st_ino */
-    return rb_integer_unpack(&get_stat(self)->st_ino, 2,
+    return rb_integer_unpack(&ptr->st_ino, 2,
             SIZEOF_STRUCT_STAT_ST_INO, 0,
             INTEGER_PACK_LSWORD_FIRST|INTEGER_PACK_NATIVE_BYTE_ORDER|
             INTEGER_PACK_2COMP);
-#elif SIZEOF_STRUCT_STAT_ST_INO > SIZEOF_LONG
-    return ULL2NUM(get_stat(self)->st_ino);
 #else
-    return ULONG2NUM(get_stat(self)->st_ino);
+    return UIANY2NUM(ptr->ST_(ino));
 #endif
 }
 
@@ -677,7 +802,7 @@ rb_stat_ino(VALUE self)
 static VALUE
 rb_stat_mode(VALUE self)
 {
-    return UINT2NUM(ST2UINT(get_stat(self)->st_mode));
+    return UINT2NUM(ST2UINT(get_stat(self)->ST_(mode)));
 }
 
 /*
@@ -696,20 +821,9 @@ static VALUE
 rb_stat_nlink(VALUE self)
 {
     /* struct stat::st_nlink is nlink_t in POSIX.  Not the case for Windows. */
-    const struct stat *ptr = get_stat(self);
+    const rb_io_stat_data *ptr = get_stat(self);
 
-    if (sizeof(ptr->st_nlink) <= sizeof(int)) {
-        return UINT2NUM((unsigned)ptr->st_nlink);
-    }
-    else if (sizeof(ptr->st_nlink) == sizeof(long)) {
-        return ULONG2NUM((unsigned long)ptr->st_nlink);
-    }
-    else if (sizeof(ptr->st_nlink) == sizeof(LONG_LONG)) {
-        return ULL2NUM((unsigned LONG_LONG)ptr->st_nlink);
-    }
-    else {
-        rb_bug(":FIXME: don't know what to do");
-    }
+    return UIANY2NUM(ptr->ST_(nlink));
 }
 
 /*
@@ -725,7 +839,7 @@ rb_stat_nlink(VALUE self)
 static VALUE
 rb_stat_uid(VALUE self)
 {
-    return UIDT2NUM(get_stat(self)->st_uid);
+    return UIDT2NUM(get_stat(self)->ST_(uid));
 }
 
 /*
@@ -741,7 +855,7 @@ rb_stat_uid(VALUE self)
 static VALUE
 rb_stat_gid(VALUE self)
 {
-    return GIDT2NUM(get_stat(self)->st_gid);
+    return GIDT2NUM(get_stat(self)->ST_(gid));
 }
 
 /*
@@ -759,16 +873,18 @@ rb_stat_gid(VALUE self)
 static VALUE
 rb_stat_rdev(VALUE self)
 {
-#ifdef HAVE_STRUCT_STAT_ST_RDEV
-# if SIZEOF_STRUCT_STAT_ST_RDEV <= SIZEOF_DEV_T
-    return DEVT2NUM(get_stat(self)->st_rdev);
-# elif SIZEOF_STRUCT_STAT_ST_RDEV <= SIZEOF_LONG
-    return ULONG2NUM(get_stat(self)->st_rdev);
-# else
-    return ULL2NUM(get_stat(self)->st_rdev);
-# endif
-#else
+#if RUBY_USE_STATX
+    unsigned int m = get_stat(self)->stx_rdev_major;
+    unsigned int n = get_stat(self)->stx_rdev_minor;
+    return ULL2NUM(makedev(m, n));
+#elif !defined(HAVE_STRUCT_STAT_ST_RDEV)
     return Qnil;
+#elif SIZEOF_STRUCT_STAT_ST_RDEV <= SIZEOF_DEV_T
+    return DEVT2NUM(get_stat(self)->ST_(rdev));
+#elif SIZEOF_STRUCT_STAT_ST_RDEV <= SIZEOF_LONG
+    return ULONG2NUM(get_stat(self)->ST_(rdev));
+#else
+    return ULL2NUM(get_stat(self)->ST_(rdev));
 #endif
 }
 
@@ -786,8 +902,10 @@ rb_stat_rdev(VALUE self)
 static VALUE
 rb_stat_rdev_major(VALUE self)
 {
-#if defined(HAVE_STRUCT_STAT_ST_RDEV) && defined(major)
-    return UINT2NUM(major(get_stat(self)->st_rdev));
+#if RUBY_USE_STATX
+    return UINT2NUM(get_stat(self)->stx_rdev_major);
+#elif defined(HAVE_STRUCT_STAT_ST_RDEV) && defined(major)
+    return UINT2NUM(major(get_stat(self)->ST_(rdev)));
 #else
     return Qnil;
 #endif
@@ -807,8 +925,10 @@ rb_stat_rdev_major(VALUE self)
 static VALUE
 rb_stat_rdev_minor(VALUE self)
 {
-#if defined(HAVE_STRUCT_STAT_ST_RDEV) && defined(minor)
-    return UINT2NUM(minor(get_stat(self)->st_rdev));
+#if RUBY_USE_STATX
+    return UINT2NUM(get_stat(self)->stx_rdev_minor);
+#elif defined(HAVE_STRUCT_STAT_ST_RDEV) && defined(minor)
+    return UINT2NUM(minor(get_stat(self)->ST_(rdev)));
 #else
     return Qnil;
 #endif
@@ -826,7 +946,7 @@ rb_stat_rdev_minor(VALUE self)
 static VALUE
 rb_stat_size(VALUE self)
 {
-    return OFFT2NUM(get_stat(self)->st_size);
+    return OFFT2NUM(get_stat(self)->ST_(size));
 }
 
 /*
@@ -844,7 +964,7 @@ static VALUE
 rb_stat_blksize(VALUE self)
 {
 #ifdef HAVE_STRUCT_STAT_ST_BLKSIZE
-    return ULONG2NUM(get_stat(self)->st_blksize);
+    return ULONG2NUM(get_stat(self)->ST_(blksize));
 #else
     return Qnil;
 #endif
@@ -866,34 +986,44 @@ rb_stat_blocks(VALUE self)
 {
 #ifdef HAVE_STRUCT_STAT_ST_BLOCKS
 # if SIZEOF_STRUCT_STAT_ST_BLOCKS > SIZEOF_LONG
-    return ULL2NUM(get_stat(self)->st_blocks);
+    return ULL2NUM(get_stat(self)->ST_(blocks));
 # else
-    return ULONG2NUM(get_stat(self)->st_blocks);
+    return ULONG2NUM(get_stat(self)->ST_(blocks));
 # endif
 #else
     return Qnil;
 #endif
 }
 
-static struct timespec
+static stat_timestamp
 stat_atimespec(const struct stat *st)
 {
-    struct timespec ts;
+    stat_timestamp ts;
     ts.tv_sec = st->st_atime;
 #if defined(HAVE_STRUCT_STAT_ST_ATIM)
-    ts.tv_nsec = st->st_atim.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_atim.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_ATIMESPEC)
-    ts.tv_nsec = st->st_atimespec.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_atimespec.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_ATIMENSEC)
-    ts.tv_nsec = (long)st->st_atimensec;
+    ts.tv_nsec = (uint32_t)st->st_atimensec;
 #else
-    ts.tv_nsec = 0;
+    ts.tv_nsec = 0
 #endif
     return ts;
 }
 
+#if RUBY_USE_STATX
+static stat_timestamp
+statx_atimespec(const rb_io_stat_data *st)
+{
+    return st->stx_atime;
+}
+#else
+# define statx_atimespec stat_atimespec
+#endif
+
 static VALUE
-stat_time(const struct timespec ts)
+stat_time(const stat_timestamp ts)
 {
     return rb_time_nano_new(ts.tv_sec, ts.tv_nsec);
 }
@@ -904,17 +1034,17 @@ stat_atime(const struct stat *st)
     return stat_time(stat_atimespec(st));
 }
 
-static struct timespec
+static stat_timestamp
 stat_mtimespec(const struct stat *st)
 {
-    struct timespec ts;
+    stat_timestamp ts;
     ts.tv_sec = st->st_mtime;
 #if defined(HAVE_STRUCT_STAT_ST_MTIM)
-    ts.tv_nsec = st->st_mtim.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_mtim.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_MTIMESPEC)
-    ts.tv_nsec = st->st_mtimespec.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_mtimespec.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_MTIMENSEC)
-    ts.tv_nsec = (long)st->st_mtimensec;
+    ts.tv_nsec = (uint32_t)st->st_mtimensec;
 #else
     ts.tv_nsec = 0;
 #endif
@@ -927,23 +1057,33 @@ stat_mtime(const struct stat *st)
     return stat_time(stat_mtimespec(st));
 }
 
-static struct timespec
+static stat_timestamp
 stat_ctimespec(const struct stat *st)
 {
-    struct timespec ts;
+    stat_timestamp ts;
     ts.tv_sec = st->st_ctime;
 #if defined(HAVE_STRUCT_STAT_ST_CTIM)
-    ts.tv_nsec = st->st_ctim.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_ctim.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_CTIMESPEC)
-    ts.tv_nsec = st->st_ctimespec.tv_nsec;
+    ts.tv_nsec = (uint32_t)st->st_ctimespec.tv_nsec;
 #elif defined(HAVE_STRUCT_STAT_ST_CTIMENSEC)
-    ts.tv_nsec = (long)st->st_ctimensec;
+    ts.tv_nsec = (uint32_t)st->st_ctimensec;
 #else
     ts.tv_nsec = 0;
 #endif
     return ts;
 }
 
+#if RUBY_USE_STATX
+static stat_timestamp
+statx_ctimespec(const rb_io_stat_data *st)
+{
+    return st->stx_ctime;
+}
+#else
+# define statx_ctimespec stat_ctimespec
+#endif
+
 static VALUE
 stat_ctime(const struct stat *st)
 {
@@ -952,35 +1092,50 @@ stat_ctime(const struct stat *st)
 
 #define HAVE_STAT_BIRTHTIME
 #if defined(HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC)
-typedef struct stat statx_data;
 static VALUE
-stat_birthtime(const struct stat *st)
+statx_birthtime(const rb_io_stat_data *st)
 {
-    const struct timespec *ts = &st->st_birthtimespec;
+    const stat_timestamp *ts = &st->ST_(birthtimespec);
     return rb_time_nano_new(ts->tv_sec, ts->tv_nsec);
 }
+#elif defined(HAVE_STRUCT_STATX_STX_BTIME)
+static VALUE statx_birthtime(const rb_io_stat_data *st);
 #elif defined(_WIN32)
-typedef struct stat statx_data;
-# define stat_birthtime stat_ctime
+# define statx_birthtime stat_ctime
 #else
 # undef HAVE_STAT_BIRTHTIME
 #endif /* defined(HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC) */
 
 /*
  *  call-seq:
- *     stat.atime   -> time
- *
- *  Returns the last access time for this file as an object of class
- *  Time.
- *
- *     File.stat("testfile").atime   #=> Wed Dec 31 18:00:00 CST 1969
- *
+ *    atime -> new_time
+ *
+ * Returns a new Time object containing the access time
+ * of the object represented by +self+
+ * at the time +self+ was created;
+ * see {Snapshot}[rdoc-ref:File::Stat@Snapshot]:
+ *
+ *   filepath = 't.tmp'
+ *   File.write(filepath, 'foo')
+ *   file = File.new(filepath, 'w')
+ *   stat = File::Stat.new(filepath)
+ *   file.atime     # => 2026-03-31 16:26:39.5913207 -0500
+ *   stat.atime     # => 2026-03-31 16:26:39.5913207 -0500
+ *   File.write(filepath, 'bar')
+ *   file.atime     # => 2026-03-31 16:27:01.4981624 -0500  # Changed by access.
+ *   stat.atime     # => 2026-03-31 16:26:39.5913207 -0500  # Unchanged by access.
+ *   stat = File::Stat.new(filepath)
+ *   stat.atime     # => 2026-03-31 16:27:01.4981624 -0500  # New access time.
+ *   file.close
+ *   File.delete(filepath)
+ *
+ * See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 static VALUE
 rb_stat_atime(VALUE self)
 {
-    return stat_atime(get_stat(self));
+    return stat_time(statx_atimespec(get_stat(self)));
 }
 
 /*
@@ -996,7 +1151,7 @@ rb_stat_atime(VALUE self)
 static VALUE
 rb_stat_mtime(VALUE self)
 {
-    return stat_mtime(get_stat(self));
+    return stat_time(statx_mtimespec(get_stat(self)));
 }
 
 /*
@@ -1016,36 +1171,34 @@ rb_stat_mtime(VALUE self)
 static VALUE
 rb_stat_ctime(VALUE self)
 {
-    return stat_ctime(get_stat(self));
+    return stat_time(statx_ctimespec(get_stat(self)));
 }
 
 #if defined(HAVE_STAT_BIRTHTIME)
 /*
  *  call-seq:
- *     stat.birthtime  ->  time
- *
- *  Returns the birth time for <i>stat</i>.
- *
- *  If the platform doesn't have birthtime, raises NotImplementedError.
- *
- *     File.write("testfile", "foo")
- *     sleep 10
- *     File.write("testfile", "bar")
- *     sleep 10
- *     File.chmod(0644, "testfile")
- *     sleep 10
- *     File.read("testfile")
- *     File.stat("testfile").birthtime   #=> 2014-02-24 11:19:17 +0900
- *     File.stat("testfile").mtime       #=> 2014-02-24 11:19:27 +0900
- *     File.stat("testfile").ctime       #=> 2014-02-24 11:19:37 +0900
- *     File.stat("testfile").atime       #=> 2014-02-24 11:19:47 +0900
- *
+ *    birthtime -> new_time
+ *
+ * Returns a new Time object containing the create time
+ * of the object represented by +self+
+ * at the time +self+ was created;
+ * see {Snapshot}[rdoc-ref:File::Stat@Snapshot]:
+ *
+ *   filename = 't.tmp'
+ *   stat = File::Stat.new(filename) # Raises Errno::ENOENT: No such file or directory
+ *   File.write(filename, 'foo')
+ *   stat = File::Stat.new(filename)
+ *   stat.birthtime # => 2026-04-14 10:41:55.5146554 -0500
+ *   File.delete(filename)
+ *   stat.birthtime # => 2026-04-14 10:41:55.5146554 -0500
+ *
+ * See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 static VALUE
 rb_stat_birthtime(VALUE self)
 {
-    return stat_birthtime(get_stat(self));
+    return statx_birthtime(get_stat(self));
 }
 #else
 # define rb_stat_birthtime rb_f_notimplement
@@ -1143,14 +1296,14 @@ no_gvl_fstat(void *data)
 }
 
 static int
-fstat_without_gvl(int fd, struct stat *st)
+fstat_without_gvl(rb_io_t *fptr, struct stat *st)
 {
     no_gvl_stat_data data;
 
-    data.file.fd = fd;
+    data.file.fd = fptr->fd;
     data.st = st;
 
-    return (int)(VALUE)rb_thread_io_blocking_region(no_gvl_fstat, &data, fd);
+    return (int)rb_io_blocking_region(fptr, no_gvl_fstat, &data);
 }
 
 static void *
@@ -1174,6 +1327,8 @@ stat_without_gvl(const char *path, struct stat *st)
 #if !defined(HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC) && \
     defined(HAVE_STRUCT_STATX_STX_BTIME)
 
+# define STATX(path, st, mask) statx(AT_FDCWD, path, 0, mask, st)
+
 # ifndef HAVE_STATX
 #   ifdef HAVE_SYSCALL_H
 #     include <syscall.h>
@@ -1191,18 +1346,18 @@ statx(int dirfd, const char *pathname, int flags,
 #   endif /* __linux__ */
 # endif /* HAVE_STATX */
 
-typedef struct no_gvl_statx_data {
+typedef struct no_gvl_rb_io_stat_data {
     struct statx *stx;
     int fd;
     const char *path;
     int flags;
     unsigned int mask;
-} no_gvl_statx_data;
+} no_gvl_rb_io_stat_data;
 
 static VALUE
 io_blocking_statx(void *data)
 {
-    no_gvl_statx_data *arg = data;
+    no_gvl_rb_io_stat_data *arg = data;
     return (VALUE)statx(arg->fd, arg->path, arg->flags, arg->mask, arg->stx);
 }
 
@@ -1213,23 +1368,34 @@ no_gvl_statx(void *data)
 }
 
 static int
-statx_without_gvl(const char *path, struct statx *stx, unsigned int mask)
+statx_without_gvl(const char *path, rb_io_stat_data *stx, unsigned int mask)
+{
+    no_gvl_rb_io_stat_data data = {stx, AT_FDCWD, path, 0, mask};
+
+    /* call statx(2) with pathname */
+    return IO_WITHOUT_GVL_INT(no_gvl_statx, &data);
+}
+
+static int
+lstatx_without_gvl(const char *path, rb_io_stat_data *stx, unsigned int mask)
 {
-    no_gvl_statx_data data = {stx, AT_FDCWD, path, 0, mask};
+    no_gvl_rb_io_stat_data data = {stx, AT_FDCWD, path, AT_SYMLINK_NOFOLLOW, mask};
 
     /* call statx(2) with pathname */
     return IO_WITHOUT_GVL_INT(no_gvl_statx, &data);
 }
 
 static int
-fstatx_without_gvl(int fd, struct statx *stx, unsigned int mask)
+fstatx_without_gvl(rb_io_t *fptr, rb_io_stat_data *stx, unsigned int mask)
 {
-    no_gvl_statx_data data = {stx, fd, "", AT_EMPTY_PATH, mask};
+    no_gvl_rb_io_stat_data data = {stx, fptr->fd, "", AT_EMPTY_PATH, mask};
 
     /* call statx(2) with fd */
-    return (int)rb_thread_io_blocking_region(io_blocking_statx, &data, fd);
+    return (int)rb_io_blocking_region(fptr, io_blocking_statx, &data);
 }
 
+#define FSTATX(fd, st) statx(fd, "", AT_EMPTY_PATH, STATX_ALL, st)
+
 static int
 rb_statx(VALUE file, struct statx *stx, unsigned int mask)
 {
@@ -1239,8 +1405,9 @@ rb_statx(VALUE file, struct statx *stx, unsigned int mask)
     tmp = rb_check_convert_type_with_id(file, T_FILE, "IO", idTo_io);
     if (!NIL_P(tmp)) {
         rb_io_t *fptr;
+
         GetOpenFile(tmp, fptr);
-        result = fstatx_without_gvl(fptr->fd, stx, mask);
+        result = fstatx_without_gvl(fptr, stx, mask);
         file = tmp;
     }
     else {
@@ -1267,7 +1434,7 @@ statx_notimplement(const char *field_name)
 }
 
 static VALUE
-statx_birthtime(const struct statx *stx, VALUE fname)
+statx_birthtime(const rb_io_stat_data *stx)
 {
     if (!statx_has_birthtime(stx)) {
         /* birthtime is not supported on the filesystem */
@@ -1276,20 +1443,27 @@ statx_birthtime(const struct statx *stx, VALUE fname)
     return rb_time_nano_new((time_t)stx->stx_btime.tv_sec, stx->stx_btime.tv_nsec);
 }
 
-typedef struct statx statx_data;
-# define HAVE_STAT_BIRTHTIME
+#else
 
-#elif defined(HAVE_STAT_BIRTHTIME)
 # define statx_without_gvl(path, st, mask) stat_without_gvl(path, st)
-# define fstatx_without_gvl(fd, st, mask) fstat_without_gvl(fd, st)
-# define statx_birthtime(st, fname) stat_birthtime(st)
+# define fstatx_without_gvl(fptr, st, mask) fstat_without_gvl(fptr, st)
+# define lstatx_without_gvl(path, st, mask) lstat_without_gvl(path, st)
+# define rb_statx(file, stx, mask) rb_stat(file, stx)
+# define STATX(path, st, mask) STAT(path, st)
+
+#if defined(HAVE_STAT_BIRTHTIME)
 # define statx_has_birthtime(st) 1
-# define rb_statx(file, st, mask) rb_stat(file, st)
 #else
 # define statx_has_birthtime(st) 0
+#endif
+
 #endif /* !defined(HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC) && \
         defined(HAVE_STRUCT_STATX_STX_BTIME) */
 
+#ifndef FSTAT
+# define FSTAT(fd, st) fstat(fd, st)
+#endif
+
 static int
 rb_stat(VALUE file, struct stat *st)
 {
@@ -1301,7 +1475,7 @@ rb_stat(VALUE file, struct stat *st)
         rb_io_t *fptr;
 
         GetOpenFile(tmp, fptr);
-        result = fstat_without_gvl(fptr->fd, st);
+        result = fstat_without_gvl(fptr, st);
         file = tmp;
     }
     else {
@@ -1326,14 +1500,14 @@ rb_stat(VALUE file, struct stat *st)
 static VALUE
 rb_file_s_stat(VALUE klass, VALUE fname)
 {
-    struct stat st;
+    rb_io_stat_data st;
 
     FilePathValue(fname);
     fname = rb_str_encode_ospath(fname);
-    if (stat_without_gvl(RSTRING_PTR(fname), &st) < 0) {
+    if (statx_without_gvl(RSTRING_PTR(fname), &st, STATX_ALL) < 0) {
         rb_sys_fail_path(fname);
     }
-    return rb_stat_new(&st);
+    return rb_statx_new(&st);
 }
 
 /*
@@ -1355,13 +1529,13 @@ static VALUE
 rb_io_stat(VALUE obj)
 {
     rb_io_t *fptr;
-    struct stat st;
+    rb_io_stat_data st;
 
     GetOpenFile(obj, fptr);
-    if (fstat(fptr->fd, &st) == -1) {
+    if (fstatx_without_gvl(fptr, &st, STATX_ALL) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return rb_stat_new(&st);
+    return rb_statx_new(&st);
 }
 
 #ifdef HAVE_LSTAT
@@ -1401,14 +1575,14 @@ static VALUE
 rb_file_s_lstat(VALUE klass, VALUE fname)
 {
 #ifdef HAVE_LSTAT
-    struct stat st;
+    rb_io_stat_data st;
 
     FilePathValue(fname);
     fname = rb_str_encode_ospath(fname);
-    if (lstat_without_gvl(StringValueCStr(fname), &st) == -1) {
+    if (lstatx_without_gvl(StringValueCStr(fname), &st, STATX_ALL) == -1) {
         rb_sys_fail_path(fname);
     }
-    return rb_stat_new(&st);
+    return rb_statx_new(&st);
 #else
     return rb_file_s_stat(klass, fname);
 #endif
@@ -1433,16 +1607,16 @@ rb_file_lstat(VALUE obj)
 {
 #ifdef HAVE_LSTAT
     rb_io_t *fptr;
-    struct stat st;
+    rb_io_stat_data st;
     VALUE path;
 
     GetOpenFile(obj, fptr);
     if (NIL_P(fptr->pathv)) return Qnil;
     path = rb_str_encode_ospath(fptr->pathv);
-    if (lstat_without_gvl(RSTRING_PTR(path), &st) == -1) {
+    if (lstatx_without_gvl(RSTRING_PTR(path), &st, STATX_ALL) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return rb_stat_new(&st);
+    return rb_statx_new(&st);
 #else
     return rb_io_stat(obj);
 #endif
@@ -2053,7 +2227,7 @@ rb_file_size_p(VALUE obj, VALUE fname)
  *    File.owned?(file_name)   -> true or false
  *
  * Returns <code>true</code> if the named file exists and the
- * effective used id of the calling process is the owner of
+ * effective user id of the calling process is the owner of
  * the file.
  *
  * _file_name_ can be an IO object.
@@ -2227,36 +2401,36 @@ rb_file_s_size(VALUE klass, VALUE fname)
 }
 
 static VALUE
-rb_file_ftype(const struct stat *st)
+rb_file_ftype(mode_t mode)
 {
     const char *t;
 
-    if (S_ISREG(st->st_mode)) {
+    if (S_ISREG(mode)) {
         t = "file";
     }
-    else if (S_ISDIR(st->st_mode)) {
+    else if (S_ISDIR(mode)) {
         t = "directory";
     }
-    else if (S_ISCHR(st->st_mode)) {
+    else if (S_ISCHR(mode)) {
         t = "characterSpecial";
     }
 #ifdef S_ISBLK
-    else if (S_ISBLK(st->st_mode)) {
+    else if (S_ISBLK(mode)) {
         t = "blockSpecial";
     }
 #endif
 #ifdef S_ISFIFO
-    else if (S_ISFIFO(st->st_mode)) {
+    else if (S_ISFIFO(mode)) {
         t = "fifo";
     }
 #endif
 #ifdef S_ISLNK
-    else if (S_ISLNK(st->st_mode)) {
+    else if (S_ISLNK(mode)) {
         t = "link";
     }
 #endif
 #ifdef S_ISSOCK
-    else if (S_ISSOCK(st->st_mode)) {
+    else if (S_ISSOCK(mode)) {
         t = "socket";
     }
 #endif
@@ -2264,7 +2438,7 @@ rb_file_ftype(const struct stat *st)
         t = "unknown";
     }
 
-    return rb_usascii_str_new2(t);
+    return rb_fstring_cstr(t);
 }
 
 /*
@@ -2293,19 +2467,30 @@ rb_file_s_ftype(VALUE klass, VALUE fname)
         rb_sys_fail_path(fname);
     }
 
-    return rb_file_ftype(&st);
+    return rb_file_ftype(st.st_mode);
 }
 
 /*
  *  call-seq:
- *     File.atime(file_name)  ->  time
+ *    File.atime(object) -> new_time
  *
- *  Returns the last access time for the named file as a Time object.
+ * Returns a new Time object containing the time of the most recent
+ * access (read or write) to the object,
+ * which may be a string filepath or dirpath, or a File or Dir object:
  *
- *  _file_name_ can be an IO object.
+ *   filepath = 't.tmp'
+ *   File.exist?(filepath)             # => false
+ *   File.atime(filepath)              # Raises Errno::ENOENT.
+ *   File.write(filepath, 'foo')
+ *   File.atime(filepath)              # => 2026-03-31 16:39:37.9290772 -0500
+ *   File.write(filepath, 'bar')
+ *   File.atime(filepath)              # => 2026-03-31 16:39:57.7710876 -0500
  *
- *     File.atime("testfile")   #=> Wed Apr 09 08:51:48 CDT 2003
+ *   File.atime('.')                   # => 2026-03-31 16:47:49.0970483 -0500
+ *   File.atime(File.new('README.md')) # => 2026-03-31 11:15:27.8215934 -0500
+ *   File.atime(Dir.new('.'))          # => 2026-03-31 12:39:45.5910591 -0500
  *
+ * See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 static VALUE
@@ -2318,18 +2503,27 @@ rb_file_s_atime(VALUE klass, VALUE fname)
         FilePathValue(fname);
         rb_syserr_fail_path(e, fname);
     }
-    return stat_atime(&st);
+    return stat_time(stat_atimespec(&st));
 }
 
 /*
  *  call-seq:
- *     file.atime    -> time
- *
- *  Returns the last access time (a Time object) for <i>file</i>, or
- *  epoch if <i>file</i> has not been accessed.
- *
- *     File.new("testfile").atime   #=> Wed Dec 31 18:00:00 CST 1969
- *
+ *    atime -> new_time
+ *
+ * Returns a new Time object containing the time of the most recent
+ * access (read or write) to the file represented by +self+:
+ *
+ *   filepath = 't.tmp'
+ *   file = File.new(filepath, 'a+')
+ *   file.atime # => 2026-03-31 17:11:27.7285397 -0500
+ *   file.write('foo')
+ *   file.atime # => 2026-03-31 17:11:27.7285397 -0500  # Unchanged; not yet written.
+ *   file.flush
+ *   file.atime # => 2026-03-31 17:12:11.3408054 -0500  # Changed; now written.
+ *   file.close
+ *   File.delete(filename)
+ *
+ * See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 static VALUE
@@ -2342,7 +2536,7 @@ rb_file_atime(VALUE obj)
     if (fstat(fptr->fd, &st) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return stat_atime(&st);
+    return stat_time(stat_atimespec(&st));
 }
 
 /*
@@ -2367,7 +2561,7 @@ rb_file_s_mtime(VALUE klass, VALUE fname)
         FilePathValue(fname);
         rb_syserr_fail_path(e, fname);
     }
-    return stat_mtime(&st);
+    return stat_time(stat_mtimespec(&st));
 }
 
 /*
@@ -2390,7 +2584,7 @@ rb_file_mtime(VALUE obj)
     if (fstat(fptr->fd, &st) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return stat_mtime(&st);
+    return stat_time(stat_mtimespec(&st));
 }
 
 /*
@@ -2419,7 +2613,7 @@ rb_file_s_ctime(VALUE klass, VALUE fname)
         FilePathValue(fname);
         rb_syserr_fail_path(e, fname);
     }
-    return stat_ctime(&st);
+    return stat_time(stat_ctimespec(&st));
 }
 
 /*
@@ -2445,35 +2639,40 @@ rb_file_ctime(VALUE obj)
     if (fstat(fptr->fd, &st) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return stat_ctime(&st);
+    return stat_time(stat_ctimespec(&st));
 }
 
 #if defined(HAVE_STAT_BIRTHTIME)
 /*
  *  call-seq:
- *     File.birthtime(file_name)  -> time
- *
- *  Returns the birth time for the named file.
- *
- *  _file_name_ can be an IO object.
+ *     File.birthtime(entry_path) -> new_time
  *
- *     File.birthtime("testfile")   #=> Wed Apr 09 08:53:13 CDT 2003
+ * Returns a new Time object containing the create time
+ * of the entry at the given +path+:
  *
- *  If the platform doesn't have birthtime, raises NotImplementedError.
+ *   path = 't.tmp'
+ *   File.birthtime(path) # Raises Errno::ENOENT: No such file or directory
+ *   File.write(path, 'foo')
+ *   File.birthtime(path) # => 2026-04-14 11:10:43.2891695 -0500
+ *   File.write(path, 'bar')
+ *   File.birthtime(path) # => 2026-04-14 11:10:43.2891695 -0500
+ *   File.delete(path)
+ *   File.birthtime(path) # Raises Errno::ENOENT: No such file or directory
  *
+ * See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 VALUE
 rb_file_s_birthtime(VALUE klass, VALUE fname)
 {
-    statx_data st;
+    rb_io_stat_data st;
 
     if (rb_statx(fname, &st, STATX_BTIME) < 0) {
         int e = errno;
         FilePathValue(fname);
         rb_syserr_fail_path(e, fname);
     }
-    return statx_birthtime(&st, fname);
+    return statx_birthtime(&st);
 }
 #else
 # define rb_file_s_birthtime rb_f_notimplement
@@ -2482,27 +2681,34 @@ rb_file_s_birthtime(VALUE klass, VALUE fname)
 #if defined(HAVE_STAT_BIRTHTIME)
 /*
  *  call-seq:
- *     file.birthtime  ->  time
- *
- *  Returns the birth time for <i>file</i>.
+ *    birthtime -> new_time
  *
- *     File.new("testfile").birthtime   #=> Wed Apr 09 08:53:14 CDT 2003
+ *  Returns a new Time object containing the create time for +self+:
  *
- *  If the platform doesn't have birthtime, raises NotImplementedError.
+ *    filepath = 't.tmp'
+ *    File.write(filepath, 'foo')
+ *    file = File.new(filepath)
+ *    file.birthtime # => 2026-04-14 15:53:45.002656 -0500
+ *    File.write(filepath, 'bar')
+ *    file.birthtime # => 2026-04-14 15:53:45.002656 -0500
+ *    file.close
+ *    File.delete(filepath)
+ *    file.birthtime # Raises IOError: closed stream
  *
+ *  See {File System Timestamps}[rdoc-ref:file/timestamps.md].
  */
 
 static VALUE
 rb_file_birthtime(VALUE obj)
 {
     rb_io_t *fptr;
-    statx_data st;
+    rb_io_stat_data st;
 
     GetOpenFile(obj, fptr);
-    if (fstatx_without_gvl(fptr->fd, &st, STATX_BTIME) == -1) {
+    if (fstatx_without_gvl(fptr, &st, STATX_BTIME) == -1) {
         rb_sys_fail_path(fptr->pathv);
     }
-    return statx_birthtime(&st, fptr->pathv);
+    return statx_birthtime(&st);
 }
 #else
 # define rb_file_birthtime rb_f_notimplement
@@ -2615,11 +2821,11 @@ io_blocking_fchmod(void *ptr)
 }
 
 static int
-rb_fchmod(int fd, mode_t mode)
+rb_fchmod(struct rb_io* io, mode_t mode)
 {
     (void)rb_chmod; /* suppress unused-function warning when HAVE_FCHMOD */
-    struct nogvl_fchmod_data data = {.fd = fd, .mode = mode};
-    return (int)rb_thread_io_blocking_region(io_blocking_fchmod, &data, fd);
+    struct nogvl_fchmod_data data = {.fd = io->fd, .mode = mode};
+    return (int)rb_thread_io_blocking_region(io, io_blocking_fchmod, &data);
 }
 #endif
 
@@ -2649,7 +2855,7 @@ rb_file_chmod(VALUE obj, VALUE vmode)
 
     GetOpenFile(obj, fptr);
 #ifdef HAVE_FCHMOD
-    if (rb_fchmod(fptr->fd, mode) == -1) {
+    if (rb_fchmod(fptr, mode) == -1) {
         if (HAVE_FCHMOD || errno != ENOSYS)
             rb_sys_fail_path(fptr->pathv);
     }
@@ -2930,7 +3136,7 @@ utime_failed(struct apply_arg *aa)
 # elif defined(__APPLE__) && \
     (!defined(MAC_OS_X_VERSION_13_0) || (MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_13_0))
 
-#   if defined(__has_attribute) && __has_attribute(availability)
+#   if __has_attribute(availability) && __has_warning("-Wunguarded-availability-new")
 typedef int utimensat_func(int, const char *, const struct timespec [2], int);
 
 RBIMPL_WARNING_PUSH()
@@ -2945,7 +3151,7 @@ RBIMPL_WARNING_POP()
 #   define utimensat rb_utimensat()
 #   else /* __API_AVAILABLE macro does nothing on gcc */
 __attribute__((weak)) int utimensat(int, const char *, const struct timespec [2], int);
-#   endif /* defined(__has_attribute) && __has_attribute(availability) */
+#   endif /* utimesat availability */
 # endif /* __APPLE__ && < MAC_OS_X_VERSION_13_0 */
 
 static int
@@ -3018,7 +3224,7 @@ static int
 utime_internal(const char *path, void *arg)
 {
     struct utime_args *v = arg;
-    const struct timespec *tsp = v->tsp;
+    const stat_timestamp *tsp = v->tsp;
     struct utimbuf utbuf, *utp = NULL;
     if (tsp) {
         utbuf.actime = tsp[0].tv_sec;
@@ -3277,7 +3483,7 @@ unlink_internal(const char *path, void *arg)
  *  Since the underlying implementation relies on the
  *  <code>unlink(2)</code> system call, the type of
  *  exception raised depends on its error type (see
- *  https://linux.die.net/man/2/unlink) and has the form of
+ *  https://man7.org/linux/man-pages/man2/unlink.2.html) and has the form of
  *  e.g. Errno::ENOENT.
  *
  *  See also Dir::rmdir.
@@ -3423,8 +3629,10 @@ static const char file_alt_separator[] = {FILE_ALT_SEPARATOR, '\0'};
 # define isADS(x) 0
 #endif
 
-#define Next(p, e, enc) ((p) + rb_enc_mbclen((p), (e), (enc)))
-#define Inc(p, e, enc) ((p) = Next((p), (e), (enc)))
+#define enc_mbclen_needed(enc) (!rb_str_encindex_fastpath(rb_enc_to_index(enc)))
+
+#define Next(p, e, mb_enc, enc) ((p) + ((mb_enc) ? rb_enc_mbclen((p), (e), (enc)) : 1))
+#define Inc(p, e, mb_enc, enc) ((p) = Next((p), (e), (mb_enc), (enc)))
 
 #if defined(DOSISH_UNC)
 #define has_unc(buf) (isdirsep((buf)[0]) && isdirsep((buf)[1]))
@@ -3445,11 +3653,12 @@ has_drive_letter(const char *buf)
 }
 
 #ifndef _WIN32
-static char*
+static VALUE
 getcwdofdrv(int drv)
 {
     char drive[4];
-    char *drvcwd, *oldcwd;
+    char *oldcwd;
+    VALUE drvcwd;
 
     drive[0] = drv;
     drive[1] = ':';
@@ -3461,13 +3670,13 @@ getcwdofdrv(int drv)
     */
     oldcwd = ruby_getcwd();
     if (chdir(drive) == 0) {
-        drvcwd = ruby_getcwd();
+        drvcwd = rb_dir_getwd_ospath();
         chdir(oldcwd);
         xfree(oldcwd);
     }
     else {
         /* perhaps the drive is not exist. we return only drive letter */
-        drvcwd = strdup(drive);
+        drvcwd = rb_enc_str_new_cstr(drive, rb_filesystem_encoding());
     }
     return drvcwd;
 }
@@ -3488,7 +3697,7 @@ not_same_drive(VALUE path, int drive)
 #endif /* DOSISH_DRIVE_LETTER */
 
 static inline char *
-skiproot(const char *path, const char *end, rb_encoding *enc)
+skiproot(const char *path, const char *end)
 {
 #ifdef DOSISH_DRIVE_LETTER
     if (path + 2 <= end && has_drive_letter(path)) path += 2;
@@ -3497,57 +3706,76 @@ skiproot(const char *path, const char *end, rb_encoding *enc)
     return (char *)path;
 }
 
-#define nextdirsep rb_enc_path_next
-char *
-rb_enc_path_next(const char *s, const char *e, rb_encoding *enc)
+static inline char *
+enc_path_next(const char *s, const char *e, bool mb_enc, rb_encoding *enc)
 {
     while (s < e && !isdirsep(*s)) {
-        Inc(s, e, enc);
+        Inc(s, e, mb_enc, enc);
     }
     return (char *)s;
 }
 
+#define nextdirsep rb_enc_path_next
+char *
+rb_enc_path_next(const char *s, const char *e, rb_encoding *enc)
+{
+    return enc_path_next(s, e, enc_mbclen_needed(enc), enc);
+}
+
 #if defined(DOSISH_UNC) || defined(DOSISH_DRIVE_LETTER)
-#define skipprefix rb_enc_path_skip_prefix
+#define skipprefix enc_path_skip_prefix
 #else
-#define skipprefix(path, end, enc) (path)
+#define skipprefix(path, end, mb_enc, enc) (path)
 #endif
-char *
-rb_enc_path_skip_prefix(const char *path, const char *end, rb_encoding *enc)
+static inline char *
+enc_path_skip_prefix(const char *path, const char *end, bool mb_enc, rb_encoding *enc)
 {
 #if defined(DOSISH_UNC) || defined(DOSISH_DRIVE_LETTER)
 #ifdef DOSISH_UNC
     if (path + 2 <= end && isdirsep(path[0]) && isdirsep(path[1])) {
         path += 2;
         while (path < end && isdirsep(*path)) path++;
-        if ((path = rb_enc_path_next(path, end, enc)) < end && path[0] && path[1] && !isdirsep(path[1]))
-            path = rb_enc_path_next(path + 1, end, enc);
+        if ((path = enc_path_next(path, end, mb_enc, enc)) < end &&
+            path + 2 <= end && !isdirsep(path[1])) {
+            path = enc_path_next(path + 1, end, mb_enc, enc);
+        }
         return (char *)path;
     }
 #endif
 #ifdef DOSISH_DRIVE_LETTER
-    if (has_drive_letter(path))
+    if (path + 2 <= end && has_drive_letter(path))
         return (char *)(path + 2);
 #endif
 #endif /* defined(DOSISH_UNC) || defined(DOSISH_DRIVE_LETTER) */
     return (char *)path;
 }
 
+char *
+rb_enc_path_skip_prefix(const char *path, const char *end, rb_encoding *enc)
+{
+    return enc_path_skip_prefix(path, end, enc_mbclen_needed(enc), enc);
+}
+
 static inline char *
 skipprefixroot(const char *path, const char *end, rb_encoding *enc)
 {
 #if defined(DOSISH_UNC) || defined(DOSISH_DRIVE_LETTER)
-    char *p = skipprefix(path, end, enc);
-    while (isdirsep(*p)) p++;
+    char *p = skipprefix(path, end, enc_mbclen_needed(enc), enc);
+    while (p < end && isdirsep(*p)) p++;
     return p;
 #else
-    return skiproot(path, end, enc);
+    return skiproot(path, end);
 #endif
 }
 
-#define strrdirsep rb_enc_path_last_separator
 char *
-rb_enc_path_last_separator(const char *path, const char *end, rb_encoding *enc)
+rb_enc_path_skip_prefix_root(const char *path, const char *end, rb_encoding *enc)
+{
+    return skipprefixroot(path, end, enc);
+}
+
+static char *
+enc_path_last_separator(const char *path, const char *end, bool mb_enc, rb_encoding *enc)
 {
     char *last = NULL;
     while (path < end) {
@@ -3558,14 +3786,44 @@ rb_enc_path_last_separator(const char *path, const char *end, rb_encoding *enc)
             last = (char *)tmp;
         }
         else {
-            Inc(path, end, enc);
+            Inc(path, end, mb_enc, enc);
         }
     }
     return last;
 }
+char *
+rb_enc_path_last_separator(const char *path, const char *end, rb_encoding *enc)
+{
+    return enc_path_last_separator(path, end, enc_mbclen_needed(enc), enc);
+}
+
+static inline char *
+strrdirsep(const char *path, const char *end, bool mb_enc, rb_encoding *enc)
+{
+    if (RB_UNLIKELY(mb_enc)) {
+        return enc_path_last_separator(path, end, mb_enc, enc);
+    }
+
+    const char *cursor = end - 1;
+
+    while (isdirsep(cursor[0])) {
+        cursor--;
+    }
+
+    while (cursor >= path) {
+        if (isdirsep(cursor[0])) {
+            while (cursor > path && isdirsep(cursor[-1])) {
+                cursor--;
+            }
+            return (char *)cursor;
+        }
+        cursor--;
+    }
+    return NULL;
+}
 
 static char *
-chompdirsep(const char *path, const char *end, rb_encoding *enc)
+chompdirsep(const char *path, const char *end, bool mb_enc, rb_encoding *enc)
 {
     while (path < end) {
         if (isdirsep(*path)) {
@@ -3574,7 +3832,7 @@ chompdirsep(const char *path, const char *end, rb_encoding *enc)
             if (path >= end) return (char *)last;
         }
         else {
-            Inc(path, end, enc);
+            Inc(path, end, mb_enc, enc);
         }
     }
     return (char *)path;
@@ -3584,13 +3842,13 @@ char *
 rb_enc_path_end(const char *path, const char *end, rb_encoding *enc)
 {
     if (path < end && isdirsep(*path)) path++;
-    return chompdirsep(path, end, enc);
+    return chompdirsep(path, end, enc_mbclen_needed(enc), enc);
 }
 
 static rb_encoding *
 fs_enc_check(VALUE path1, VALUE path2)
 {
-    rb_encoding *enc = rb_enc_check(path1, path2);
+    rb_encoding *enc = rb_enc_check_str(path1, path2);
     int encidx = rb_enc_to_index(enc);
     if (encidx == ENCINDEX_US_ASCII) {
         encidx = rb_enc_get_index(path1);
@@ -3605,6 +3863,7 @@ fs_enc_check(VALUE path1, VALUE path2)
 static char *
 ntfs_tail(const char *path, const char *end, rb_encoding *enc)
 {
+    bool mb_enc = enc_mbclen_needed(enc);
     while (path < end && *path == '.') path++;
     while (path < end && !isADS(*path)) {
         if (istrailinggarbage(*path)) {
@@ -3619,7 +3878,7 @@ ntfs_tail(const char *path, const char *end, rb_encoding *enc)
             if (isADS(*path)) path++;
         }
         else {
-            Inc(path, end, enc);
+            Inc(path, end, mb_enc, enc);
         }
     }
     return (char *)path;
@@ -3667,10 +3926,6 @@ static VALUE
 copy_home_path(VALUE result, const char *dir)
 {
     char *buf;
-#if defined DOSISH || defined __CYGWIN__
-    char *p, *bend;
-    rb_encoding *enc;
-#endif
     long dirlen;
     int encidx;
 
@@ -3679,10 +3934,11 @@ copy_home_path(VALUE result, const char *dir)
     memcpy(buf = RSTRING_PTR(result), dir, dirlen);
     encidx = rb_filesystem_encindex();
     rb_enc_associate_index(result, encidx);
-#if defined DOSISH || defined __CYGWIN__
-    enc = rb_enc_from_index(encidx);
-    for (bend = (p = buf) + dirlen; p < bend; Inc(p, bend, enc)) {
-        if (*p == '\\') {
+#if defined FILE_ALT_SEPARATOR
+    rb_encoding *enc = rb_enc_from_index(encidx);
+    bool mb_enc = enc_mbclen_needed(enc);
+    for (char *p = buf, *bend = p + dirlen; p < bend; Inc(p, bend, mb_enc, enc)) {
+        if (*p == FILE_ALT_SEPARATOR) {
             *p = '/';
         }
     }
@@ -3694,12 +3950,16 @@ VALUE
 rb_home_dir_of(VALUE user, VALUE result)
 {
 #ifdef HAVE_PWD_H
-    struct passwd *pwPtr;
+    VALUE dirname = rb_getpwdirnam_for_login(user);
+    if (dirname == Qnil) {
+        rb_raise(rb_eArgError, "user %"PRIsVALUE" doesn't exist", user);
+    }
+    const char *dir = RSTRING_PTR(dirname);
 #else
     extern char *getlogin(void);
     const char *pwPtr = 0;
+    const char *login;
     # define endpwent() ((void)0)
-#endif
     const char *dir, *username = RSTRING_PTR(user);
     rb_encoding *enc = rb_enc_get(user);
 #if defined _WIN32
@@ -3711,21 +3971,13 @@ rb_home_dir_of(VALUE user, VALUE result)
         dir = username = RSTRING_PTR(rb_str_conv_enc(user, enc, fsenc));
     }
 
-#ifdef HAVE_PWD_H
-    pwPtr = getpwnam(username);
-#else
-    if (strcasecmp(username, getlogin()) == 0)
+    if ((login = getlogin()) && strcasecmp(username, login) == 0)
         dir = pwPtr = getenv("HOME");
-#endif
     if (!pwPtr) {
-        endpwent();
         rb_raise(rb_eArgError, "user %"PRIsVALUE" doesn't exist", user);
     }
-#ifdef HAVE_PWD_H
-    dir = pwPtr->pw_dir;
 #endif
     copy_home_path(result, dir);
-    endpwent();
     return result;
 }
 
@@ -3794,16 +4046,19 @@ ospath_new(const char *ptr, long len, rb_encoding *fsenc)
 }
 
 static char *
-append_fspath(VALUE result, VALUE fname, char *dir, rb_encoding **enc, rb_encoding *fsenc)
+append_fspath(VALUE result, VALUE fname, VALUE dirname, rb_encoding **enc, rb_encoding *fsenc)
 {
-    char *buf, *cwdp = dir;
-    VALUE dirname = Qnil;
-    size_t dirlen = strlen(dir), buflen = rb_str_capacity(result);
+    if (RB_UNLIKELY(!rb_enc_asciicompat(fsenc) || rb_enc_str_coderange(dirname) != ENC_CODERANGE_7BIT)) {
+        dirname = rb_str_new_shared(dirname);
+        rb_enc_associate(dirname, fsenc);
+    }
+
+    char *buf, *cwdp;
+    size_t dirlen = RSTRING_LEN(dirname);
+    size_t buflen = rb_str_capacity(result);
 
     if (NORMALIZE_UTF8PATH || *enc != fsenc) {
-        dirname = ospath_new(dir, dirlen, fsenc);
         if (!rb_enc_compatible(fname, dirname)) {
-            xfree(dir);
             /* rb_enc_check must raise because the two encodings are not
              * compatible. */
             rb_enc_check(fname, dirname);
@@ -3812,19 +4067,15 @@ append_fspath(VALUE result, VALUE fname, char *dir, rb_encoding **enc, rb_encodi
         rb_encoding *direnc = fs_enc_check(fname, dirname);
         if (direnc != fsenc) {
             dirname = rb_str_conv_enc(dirname, fsenc, direnc);
-            RSTRING_GETMEM(dirname, cwdp, dirlen);
-        }
-        else if (NORMALIZE_UTF8PATH) {
-            RSTRING_GETMEM(dirname, cwdp, dirlen);
         }
         *enc = direnc;
     }
+
+    RSTRING_GETMEM(dirname, cwdp, dirlen);
     do {buflen *= 2;} while (dirlen > buflen);
     rb_str_resize(result, buflen);
     buf = RSTRING_PTR(result);
     memcpy(buf, cwdp, dirlen);
-    xfree(dir);
-    if (!NIL_P(dirname)) rb_str_resize(dirname, 0);
     rb_enc_associate(result, *enc);
     return buf + dirlen;
 }
@@ -3839,16 +4090,21 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
 
     s = StringValuePtr(fname);
     fend = s + RSTRING_LEN(fname);
-    enc = rb_enc_get(fname);
+    enc = rb_str_enc_get(fname);
+    bool mb_enc = enc_mbclen_needed(enc);
+    if (!mb_enc && RTEST(dname)) {
+        mb_enc = enc_mbclen_needed(rb_str_enc_get(dname));
+    }
+
     BUFINIT();
 
-    if (s[0] == '~' && abs_mode == 0) {      /* execute only if NOT absolute_path() */
+    if (s < fend && s[0] == '~' && abs_mode == 0) {      /* execute only if NOT absolute_path() */
         long userlen = 0;
-        if (isdirsep(s[1]) || s[1] == '\0') {
+        if (s + 1 == fend || isdirsep(s[1])) {
             buf = 0;
             b = 0;
             rb_str_set_len(result, 0);
-            if (*++s) ++s;
+            if (++s < fend) ++s;
             rb_default_home_dir(result);
         }
         else {
@@ -3878,8 +4134,8 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
     }
 #ifdef DOSISH_DRIVE_LETTER
     /* skip drive letter */
-    else if (has_drive_letter(s)) {
-        if (isdirsep(s[2])) {
+    else if (s + 1 < fend && has_drive_letter(s)) {
+        if (s + 2 < fend && isdirsep(s[2])) {
             /* specified drive letter, and full path */
             /* skip drive letter */
             BUFCHECK(bdiff + 2 >= buflen);
@@ -3908,12 +4164,12 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
                 rb_enc_associate(result, enc = fs_enc_check(result, fname));
                 p = pend;
             }
-            p = chompdirsep(skiproot(buf, p, enc), p, enc);
+            p = chompdirsep(skiproot(buf, p), p, mb_enc, enc);
             s += 2;
         }
     }
 #endif /* DOSISH_DRIVE_LETTER */
-    else if (!rb_is_absolute_path(s)) {
+    else if (s == fend || !rb_is_absolute_path(s)) {
         if (!NIL_P(dname)) {
             rb_file_expand_path_internal(dname, Qnil, abs_mode, long_name, result);
             rb_enc_associate(result, fs_enc_check(result, fname));
@@ -3921,24 +4177,24 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
             p = pend;
         }
         else {
-            char *e = append_fspath(result, fname, ruby_getcwd(), &enc, fsenc);
+            char *e = append_fspath(result, fname, rb_dir_getwd_ospath(), &enc, fsenc);
             BUFINIT();
             p = e;
         }
-#if defined DOSISH || defined __CYGWIN__
-        if (isdirsep(*s)) {
+#if defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC
+        if (s < fend && isdirsep(*s)) {
             /* specified full path, but not drive letter nor UNC */
             /* we need to get the drive letter or UNC share name */
-            p = skipprefix(buf, p, enc);
+            p = skipprefix(buf, p, mb_enc, enc);
         }
         else
-#endif /* defined DOSISH || defined __CYGWIN__ */
-            p = chompdirsep(skiproot(buf, p, enc), p, enc);
+#endif /* defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC */
+            p = chompdirsep(skiproot(buf, p), p, mb_enc, enc);
     }
     else {
         size_t len;
         b = s;
-        do s++; while (isdirsep(*s));
+        do s++; while (s < fend && isdirsep(*s));
         len = s - b;
         p = buf + len;
         BUFCHECK(bdiff >= buflen);
@@ -3957,23 +4213,24 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
     rb_str_set_len(result, p-buf+1);
     BUFCHECK(bdiff + 1 >= buflen);
     p[1] = 0;
-    root = skipprefix(buf, p+1, enc);
+    root = skipprefix(buf, p+1, mb_enc, enc);
 
     b = s;
-    while (*s) {
+    while (s < fend) {
         switch (*s) {
           case '.':
             if (b == s++) {	/* beginning of path element */
-                switch (*s) {
-                  case '\0':
+                if (s == fend) {
                     b = s;
                     break;
+                }
+                switch (*s) {
                   case '.':
-                    if (*(s+1) == '\0' || isdirsep(*(s+1))) {
+                    if (s+1 == fend || isdirsep(*(s+1))) {
                         /* We must go back to the parent */
                         char *n;
                         *p = '\0';
-                        if (!(n = strrdirsep(root, p, enc))) {
+                        if (!(n = strrdirsep(root, p, mb_enc, enc))) {
                             *p = '/';
                         }
                         else {
@@ -3983,13 +4240,13 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
                     }
 #if USE_NTFS
                     else {
-                        do ++s; while (istrailinggarbage(*s));
+                        do ++s; while (s < fend && istrailinggarbage(*s));
                     }
 #endif /* USE_NTFS */
                     break;
                   case '/':
-#if defined DOSISH || defined __CYGWIN__
-                  case '\\':
+#if defined FILE_ALT_SEPARATOR
+                  case FILE_ALT_SEPARATOR:
 #endif
                     b = ++s;
                     break;
@@ -4013,8 +4270,8 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
 #endif /* USE_NTFS */
             break;
           case '/':
-#if defined DOSISH || defined __CYGWIN__
-          case '\\':
+#if defined FILE_ALT_SEPARATOR
+          case FILE_ALT_SEPARATOR:
 #endif
             if (s > b) {
                 WITH_ROOTDIFF(BUFCOPY(b, s-b));
@@ -4036,7 +4293,7 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
                 }
             }
 #endif /* __APPLE__ */
-            Inc(s, fend, enc);
+            Inc(s, fend, mb_enc, enc);
             break;
         }
     }
@@ -4064,7 +4321,7 @@ rb_file_expand_path_internal(VALUE fname, VALUE dname, int abs_mode, int long_na
         BUFCOPY(b, s-b);
         rb_str_set_len(result, p-buf);
     }
-    if (p == skiproot(buf, p + !!*p, enc) - 1) p++;
+    if (p == skiproot(buf, p + !!*p) - 1) p++;
 
 #if USE_NTFS
     *p = '\0';
@@ -4222,31 +4479,43 @@ rb_file_s_expand_path(int argc, const VALUE *argv)
 }
 
 /*
+ *  :markup: markdown
+ *
  *  call-seq:
- *     File.expand_path(file_name [, dir_string] )  ->  abs_file_name
+ *    File.expand_path(path, dirpath = '.') -> absolute_path
  *
- *  Converts a pathname to an absolute pathname. Relative paths are
- *  referenced from the current working directory of the process unless
- *  +dir_string+ is given, in which case it will be used as the
- *  starting point. The given pathname may start with a
- *  ``<code>~</code>'', which expands to the process owner's home
- *  directory (the environment variable +HOME+ must be set
- *  correctly). ``<code>~</code><i>user</i>'' expands to the named
- *  user's home directory.
+ *  Returns the string absolute path for the given `path`.
  *
- *     File.expand_path("~oracle/bin")           #=> "/home/oracle/bin"
+ *  Evaluates a relative path with respect to the directory given by `dirpath`:
  *
- *  A simple example of using +dir_string+ is as follows.
- *     File.expand_path("ruby", "/usr/bin")      #=> "/usr/bin/ruby"
+ *  ```ruby
+ *  Dir.chdir('/snap')
+ *  # Default dirpath.
+ *  File.expand_path('README')                  # => "/snap/README"
+ *  File.expand_path('bin')                     # => "/snap/bin"
+ *  File.expand_path('bin/../var')              # => "/snap/var"  # Cleaned.
+ *  # Other dirpath.
+ *  File.expand_path('../zip', '/usr/bin/ruby') # => "/usr/bin/zip"
+ *  Dir.chdir('/usr/bin')
+ *  File.expand_path('../../snap', __FILE__)    # => "/usr/snap"
+ *  ```
+ *
+ *  Evaluates an absolute path without respect to `dirpath`:
+ *
+ *  ```ruby
+ *  File.expand_path('/snap')           # => "/snap"
+ *  File.expand_path('/snap', 'nosuch') # => "/snap"
+ *  File.expand_path('/snap/../snap')   # => "/snap"  # Cleaned.
+ *  ```
  *
- *  A more complex example which also resolves parent directory is as follows.
- *  Suppose we are in bin/mygem and want the absolute path of lib/mygem.rb.
+ *  More examples:
  *
- *     File.expand_path("../../lib/mygem.rb", __FILE__)
- *     #=> ".../path/to/project/lib/mygem.rb"
+ *  ```
+ *  Dir.chdir('/usr/bin')
+ *  File.expand_path('../../snap', __FILE__) # => "/usr/snap"
+ *  File.expand_path('../../snap')           # => "/snap"
+ *  ```
  *
- *  So first it resolves the parent of __FILE__, that is bin/, then go to the
- *  parent, the root of the project and appends +lib/mygem.rb+.
  */
 
 static VALUE
@@ -4334,9 +4603,10 @@ realpath_rec(long *prefixlenp, VALUE *resolvedp, const char *unresolved, VALUE f
         }
         else if (testnamelen == 2 && testname[0] == '.' && testname[1] == '.') {
             if (*prefixlenp < RSTRING_LEN(*resolvedp)) {
+                bool mb_enc = enc_mbclen_needed(enc);
                 const char *resolved_str = RSTRING_PTR(*resolvedp);
                 const char *resolved_names = resolved_str + *prefixlenp;
-                const char *lastsep = strrdirsep(resolved_names, resolved_str + RSTRING_LEN(*resolvedp), enc);
+                const char *lastsep = strrdirsep(resolved_names, resolved_str + RSTRING_LEN(*resolvedp), mb_enc, enc);
                 long len = lastsep ? lastsep - resolved_names : 0;
                 rb_str_resize(*resolvedp, *prefixlenp + len);
             }
@@ -4476,7 +4746,8 @@ rb_check_realpath_emulate(VALUE basedir, VALUE path, rb_encoding *origenc, enum
   root_found:
     RSTRING_GETMEM(resolved, prefixptr, prefixlen);
     pend = prefixptr + prefixlen;
-    ptr = chompdirsep(prefixptr, pend, enc);
+    bool mb_enc = enc_mbclen_needed(enc);
+    ptr = chompdirsep(prefixptr, pend, mb_enc, enc);
     if (ptr < pend) {
         prefixlen = ++ptr - prefixptr;
         rb_str_set_len(resolved, prefixlen);
@@ -4486,7 +4757,7 @@ rb_check_realpath_emulate(VALUE basedir, VALUE path, rb_encoding *origenc, enum
         if (*prefixptr == FILE_ALT_SEPARATOR) {
             *prefixptr = '/';
         }
-        Inc(prefixptr, pend, enc);
+        Inc(prefixptr, pend, mb_enc, enc);
     }
 #endif
 
@@ -4522,7 +4793,7 @@ rb_check_realpath_emulate(VALUE basedir, VALUE path, rb_encoding *origenc, enum
     return resolved;
 }
 
-static VALUE rb_file_join(VALUE ary);
+static VALUE rb_file_join(long argc, VALUE *args);
 
 #ifndef HAVE_REALPATH
 static VALUE
@@ -4537,6 +4808,11 @@ rb_check_realpath_emulate_rescue(VALUE arg, VALUE exc)
 {
     return Qnil;
 }
+#elif !defined(NEEDS_REALPATH_BUFFER) && defined(__APPLE__) && \
+    (!defined(MAC_OS_X_VERSION_10_6) || (MAC_OS_X_VERSION_MIN_REQUIRED < MAC_OS_X_VERSION_10_6))
+/* realpath() on OSX < 10.6 doesn't implement automatic allocation */
+# include <sys/syslimits.h>
+# define NEEDS_REALPATH_BUFFER 1
 #endif /* HAVE_REALPATH */
 
 static VALUE
@@ -4546,6 +4822,11 @@ rb_check_realpath_internal(VALUE basedir, VALUE path, rb_encoding *origenc, enum
     VALUE unresolved_path;
     char *resolved_ptr = NULL;
     VALUE resolved;
+# if defined(NEEDS_REALPATH_BUFFER) && NEEDS_REALPATH_BUFFER
+    char resolved_buffer[PATH_MAX];
+# else
+    char *const resolved_buffer = NULL;
+# endif
 
     if (mode == RB_REALPATH_DIR) {
         return rb_check_realpath_emulate(basedir, path, origenc, mode);
@@ -4553,17 +4834,22 @@ rb_check_realpath_internal(VALUE basedir, VALUE path, rb_encoding *origenc, enum
 
     unresolved_path = rb_str_dup_frozen(path);
     if (*RSTRING_PTR(unresolved_path) != '/' && !NIL_P(basedir)) {
-        unresolved_path = rb_file_join(rb_assoc_new(basedir, unresolved_path));
+        VALUE paths[2] = {basedir, unresolved_path};
+        unresolved_path = rb_file_join(2, paths);
     }
     if (origenc) unresolved_path = TO_OSPATH(unresolved_path);
 
-    if ((resolved_ptr = realpath(RSTRING_PTR(unresolved_path), NULL)) == NULL) {
-        /* glibc realpath(3) does not allow /path/to/file.rb/../other_file.rb,
+    if ((resolved_ptr = realpath(RSTRING_PTR(unresolved_path), resolved_buffer)) == NULL) {
+        /*
+           wasi-libc 22 and later support realpath(3) but return ENOTSUP
+           when the underlying host syscall returns it.
+           glibc realpath(3) does not allow /path/to/file.rb/../other_file.rb,
            returning ENOTDIR in that case.
            glibc realpath(3) can also return ENOENT for paths that exist,
            such as /dev/fd/5.
            Fallback to the emulated approach in either of those cases. */
-        if (errno == ENOTDIR ||
+        if (errno == ENOTSUP ||
+            errno == ENOTDIR ||
             (errno == ENOENT && rb_file_exist_p(0, unresolved_path))) {
             return rb_check_realpath_emulate(basedir, path, origenc, mode);
 
@@ -4574,9 +4860,11 @@ rb_check_realpath_internal(VALUE basedir, VALUE path, rb_encoding *origenc, enum
         rb_sys_fail_path(unresolved_path);
     }
     resolved = ospath_new(resolved_ptr, strlen(resolved_ptr), rb_filesystem_encoding());
+# if !(defined(NEEDS_REALPATH_BUFFER) && NEEDS_REALPATH_BUFFER)
     free(resolved_ptr);
+# endif
 
-# if !defined(__LINUX__) && !defined(__APPLE__)
+# if !defined(__linux__) && !defined(__APPLE__)
     /* As `resolved` is a String in the filesystem encoding, no
      * conversion is needed */
     struct stat st;
@@ -4586,7 +4874,7 @@ rb_check_realpath_internal(VALUE basedir, VALUE path, rb_encoding *origenc, enum
         }
         rb_sys_fail_path(unresolved_path);
     }
-# endif /* !defined(__LINUX__) && !defined(__APPLE__) */
+# endif /* !defined(__linux__) && !defined(__APPLE__) */
 
     if (origenc && origenc != rb_enc_get(resolved)) {
         if (!rb_enc_str_asciionly_p(resolved)) {
@@ -4713,23 +5001,29 @@ rmext(const char *p, long l0, long l1, const char *e, long l2, rb_encoding *enc)
     return 0;
 }
 
-const char *
-ruby_enc_find_basename(const char *name, long *baselen, long *alllen, rb_encoding *enc)
+static inline const char *
+enc_find_basename(const char *name, long *baselen, long *alllen, bool mb_enc, rb_encoding *enc)
 {
     const char *p, *q, *e, *end;
-#if defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC
-    const char *root;
-#endif
     long f = 0, n = -1;
 
-    end = name + (alllen ? (size_t)*alllen : strlen(name));
-    name = skipprefix(name, end, enc);
+    long len = (alllen ? (size_t)*alllen : strlen(name));
+
+    if (len <= 0) {
+        return name;
+    }
+
+    end = name + len;
+    name = skipprefix(name, end, mb_enc, enc);
 #if defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC
-    root = name;
+    const char *root = name;
 #endif
-    while (isdirsep(*name))
+
+    while (name < end && isdirsep(*name)) {
         name++;
-    if (!*name) {
+    }
+
+    if (name == end) {
         p = name - 1;
         f = 1;
 #if defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC
@@ -4750,91 +5044,127 @@ ruby_enc_find_basename(const char *name, long *baselen, long *alllen, rb_encodin
 #endif /* defined DOSISH_DRIVE_LETTER || defined DOSISH_UNC */
     }
     else {
-        if (!(p = strrdirsep(name, end, enc))) {
+        p = strrdirsep(name, end, mb_enc, enc);
+        if (!p) {
             p = name;
         }
         else {
-            while (isdirsep(*p)) p++; /* skip last / */
+            while (isdirsep(*p)) {
+                p++; /* skip last / */
+            }
         }
 #if USE_NTFS
         n = ntfs_tail(p, end, enc) - p;
 #else
-        n = chompdirsep(p, end, enc) - p;
+        n = chompdirsep(p, end, mb_enc, enc) - p;
 #endif
         for (q = p; q - p < n && *q == '.'; q++);
-        for (e = 0; q - p < n; Inc(q, end, enc)) {
+        for (e = 0; q - p < n; Inc(q, end, mb_enc, enc)) {
             if (*q == '.') e = q;
         }
-        if (e) f = e - p;
-        else f = n;
+        if (e) {
+            f = e - p;
+        }
+        else {
+            f = n;
+        }
     }
 
-    if (baselen)
+    if (baselen) {
         *baselen = f;
-    if (alllen)
+    }
+    if (alllen) {
         *alllen = n;
+    }
     return p;
 }
 
+const char *
+ruby_enc_find_basename(const char *name, long *baselen, long *alllen, rb_encoding *enc)
+{
+    return enc_find_basename(name, baselen, alllen, enc_mbclen_needed(enc), enc);
+}
+
 /*
  *  call-seq:
- *     File.basename(file_name [, suffix] )  ->  base_name
+ *    File.basename(path, suffix = '') -> new_string
  *
- *  Returns the last component of the filename given in
- *  <i>file_name</i> (after first stripping trailing separators),
- *  which can be formed using both File::SEPARATOR and
- *  File::ALT_SEPARATOR as the separator when File::ALT_SEPARATOR is
- *  not <code>nil</code>. If <i>suffix</i> is given and present at the
- *  end of <i>file_name</i>, it is removed. If <i>suffix</i> is ".*",
- *  any extension will be removed.
+ *  Returns a new string containing all or part of the last entry of the given +path+.
+ *  Entries are delimited by the value of constant File::SEPARATOR
+ *  and, if non-nil, the value of constant File::ALT_SEPARATOR.
+ *
+ *  When +suffix+ is the empty string <tt>''</tt>,
+ *  returns all of the last entry:
+ *
+ *    File.basename('foo/bar/baz/bat.txt') # => "bat.txt"
+ *    File.basename('foo/bar/baz')         # => "baz"
+ *
+ *    File::SEPARATOR                      # => "/"
+ *    File.basename('foo/bar.txt////')     # => "bar.txt"
+ *    File::ALT_SEPARATOR                  # => "\\"  # On Windows.
+ *    File.basename('foo/bar.txt//\\\\//') # => "bar.txt"
+ *
+ *  When +suffix+ is <tt>'.*'</tt>,
+ *  the last {filename extension}[https://en.wikipedia.org/wiki/Filename_extension],
+ *  if any, is removed:
+ *
+ *    File.basename('foo/bar.txt', '.*')     # => "bar"
+ *    File.basename('foo/bar.txt.old', '.*') # => "bar.txt"
+ *    File.basename('foo/bar', '.*')         # => "bar"
+ *
+ *  When +suffix+ is any string other than <tt>''</tt> or <tt>'.*'</tt>,
+ *  the matching trailing substring, if any, is removed:
+ *
+ *    File.basename('foo/bar.txt', '.txt') # => "bar"
+ *    File.basename('foo/bar.txt', 'txt')  # => "bar."
+ *    File.basename('foo/bar.txt', '*')    # => "bar.txt"
+ *    File.basename('foo/bar.txt', '.')    # => "bar.txt"
  *
- *     File.basename("/home/gumby/work/ruby.rb")          #=> "ruby.rb"
- *     File.basename("/home/gumby/work/ruby.rb", ".rb")   #=> "ruby"
- *     File.basename("/home/gumby/work/ruby.rb", ".*")    #=> "ruby"
  */
 
 static VALUE
 rb_file_s_basename(int argc, VALUE *argv, VALUE _)
 {
-    VALUE fname, fext, basename;
-    const char *name, *p;
-    long f, n;
+    VALUE fname, fext = Qnil;
+    const char *name, *p, *fp = 0;
+    long f = 0, n;
     rb_encoding *enc;
 
-    fext = Qnil;
-    if (rb_check_arity(argc, 1, 2) == 2) {
+    argc = rb_check_arity(argc, 1, 2);
+    fname = argv[0];
+    CheckPath(fname, name);
+    if (argc == 2) {
         fext = argv[1];
-        StringValue(fext);
-        enc = check_path_encoding(fext);
+        fp = StringValueCStr(fext);
+        check_path_encoding(fext);
     }
-    fname = argv[0];
-    FilePathStringValue(fname);
     if (NIL_P(fext) || !(enc = rb_enc_compatible(fname, fext))) {
-        enc = rb_enc_get(fname);
-        fext = Qnil;
+        enc = rb_str_enc_get(fname);
+    }
+
+    n = RSTRING_LEN(fname);
+    if (n <= 0 || !*name) {
+        return rb_enc_str_new(0, 0, enc);
     }
-    if ((n = RSTRING_LEN(fname)) == 0 || !*(name = RSTRING_PTR(fname)))
-        return rb_str_new_shared(fname);
 
-    p = ruby_enc_find_basename(name, &f, &n, enc);
+    bool mb_enc = enc_mbclen_needed(enc);
+    p = enc_find_basename(name, &f, &n, mb_enc, enc);
     if (n >= 0) {
-        if (NIL_P(fext)) {
+        if (!fp) {
             f = n;
         }
         else {
-            const char *fp;
-            fp = StringValueCStr(fext);
             if (!(f = rmext(p, f, n, fp, RSTRING_LEN(fext), enc))) {
                 f = n;
             }
             RB_GC_GUARD(fext);
         }
-        if (f == RSTRING_LEN(fname)) return rb_str_new_shared(fname);
+        if (f == RSTRING_LEN(fname)) {
+            return rb_str_new_shared(fname);
+        }
     }
 
-    basename = rb_str_new(p, f);
-    rb_enc_copy(basename, fname);
-    return basename;
+    return rb_enc_str_new(p, f, enc);
 }
 
 static VALUE rb_file_dirname_n(VALUE fname, int n);
@@ -4879,19 +5209,18 @@ rb_file_dirname_n(VALUE fname, int n)
 {
     const char *name, *root, *p, *end;
     VALUE dirname;
-    rb_encoding *enc;
-    VALUE sepsv = 0;
-    const char **seps;
 
     if (n < 0) rb_raise(rb_eArgError, "negative level: %d", n);
-    FilePathStringValue(fname);
-    name = StringValueCStr(fname);
+    CheckPath(fname, name);
     end = name + RSTRING_LEN(fname);
-    enc = rb_enc_get(fname);
-    root = skiproot(name, end, enc);
+
+    bool mb_enc = !rb_str_enc_fastpath(fname);
+    rb_encoding *enc = rb_str_enc_get(fname);
+
+    root = skiproot(name, end);
 #ifdef DOSISH_UNC
     if (root > name + 1 && isdirsep(*name))
-        root = skipprefix(name = root - 2, end, enc);
+        root = skipprefix(name = root - 2, end, mb_enc, enc);
 #else
     if (root > name + 1)
         name = root - 1;
@@ -4900,72 +5229,41 @@ rb_file_dirname_n(VALUE fname, int n)
         p = root;
     }
     else {
-        int i;
-        switch (n) {
-          case 0:
-            p = end;
-            break;
-          case 1:
-            if (!(p = strrdirsep(root, end, enc))) p = root;
-            break;
-          default:
-            seps = ALLOCV_N(const char *, sepsv, n);
-            for (i = 0; i < n; ++i) seps[i] = root;
-            i = 0;
-            for (p = root; p < end; ) {
-                if (isdirsep(*p)) {
-                    const char *tmp = p++;
-                    while (p < end && isdirsep(*p)) p++;
-                    if (p >= end) break;
-                    seps[i++] = tmp;
-                    if (i == n) i = 0;
-                }
-                else {
-                    Inc(p, end, enc);
-                }
+        p = end;
+        while (n) {
+            if (!(p = strrdirsep(root, p, mb_enc, enc))) {
+                p = root;
+                break;
             }
-            p = seps[i];
-            ALLOCV_END(sepsv);
-            break;
+            n--;
         }
     }
-    if (p == name)
-        return rb_usascii_str_new2(".");
+
+    if (p == name) {
+        return rb_enc_str_new(".", 1, enc);
+    }
 #ifdef DOSISH_DRIVE_LETTER
-    if (has_drive_letter(name) && isdirsep(*(name + 2))) {
-        const char *top = skiproot(name + 2, end, enc);
-        dirname = rb_str_new(name, 3);
+    if (name + 3 < end && has_drive_letter(name) && isdirsep(*(name + 2))) {
+        const char *top = skiproot(name + 2, end);
+        dirname = rb_enc_str_new(name, 3, enc);
         rb_str_cat(dirname, top, p - top);
     }
     else
 #endif
-    dirname = rb_str_new(name, p - name);
+    dirname = rb_enc_str_new(name, p - name, enc);
 #ifdef DOSISH_DRIVE_LETTER
-    if (has_drive_letter(name) && root == name + 2 && p - name == 2)
+    if (root == name + 2 && p == root && name[1] == ':')
         rb_str_cat(dirname, ".", 1);
 #endif
-    rb_enc_copy(dirname, fname);
     return dirname;
 }
 
-/*
- * accept a String, and return the pointer of the extension.
- * if len is passed, set the length of extension to it.
- * returned pointer is in ``name'' or NULL.
- *                 returns   *len
- *   no dot        NULL      0
- *   dotfile       top       0
- *   end with dot  dot       1
- *   .ext          dot       len of .ext
- *   .ext:stream   dot       len of .ext without :stream (NTFS only)
- *
- */
-const char *
-ruby_enc_find_extname(const char *name, long *len, rb_encoding *enc)
+static inline const char *
+enc_find_extname(const char *name, long *len, bool mb_enc, rb_encoding *enc)
 {
     const char *p, *e, *end = name + (len ? *len : (long)strlen(name));
 
-    p = strrdirsep(name, end, enc);	/* get the last path component */
+    p = strrdirsep(name, end, mb_enc, enc);	/* get the last path component */
     if (!p)
         p = name;
     else
@@ -4998,7 +5296,7 @@ ruby_enc_find_extname(const char *name, long *len, rb_encoding *enc)
 #endif
         else if (isdirsep(*p))
             break;
-        Inc(p, end, enc);
+        Inc(p, end, mb_enc, enc);
     }
 
     if (len) {
@@ -5014,57 +5312,106 @@ ruby_enc_find_extname(const char *name, long *len, rb_encoding *enc)
 }
 
 /*
+ * accept a String, and return the pointer of the extension.
+ * if len is passed, set the length of extension to it.
+ * returned pointer is in ``name'' or NULL.
+ *                 returns   *len
+ *   no dot        NULL      0
+ *   dotfile       top       0
+ *   end with dot  dot       1
+ *   .ext          dot       len of .ext
+ *   .ext:stream   dot       len of .ext without :stream (NTFS only)
+ *
+ */
+const char *
+ruby_enc_find_extname(const char *name, long *len, rb_encoding *enc)
+{
+    return enc_find_extname(name, len, enc_mbclen_needed(enc), enc);
+}
+
+/*
+ *  :markup: markdown
+ *
  *  call-seq:
- *     File.extname(path)  ->  string
+ *     File.extname(path) -> extension
+ *
+ *  Returns the filename extension --
+ *  usually the portion of the string `path`
+ *  beginning from the last period:
+ *
+ *  ```ruby
+ *  File.extname('t.rb')         # => ".rb"
+ *  File.extname('foo.bar.t.rb') # => ".rb"
+ *  File.extname('foo/bar/t.rb') # => ".rb"
+ *  File.extname('nosuch.txt')   # => ".txt"  # Path need not exist.
+ *  ```
  *
- *  Returns the extension (the portion of file name in +path+
- *  starting from the last period).
+ *  Returns the entire string when there is no period:
  *
- *  If +path+ is a dotfile, or starts with a period, then the starting
- *  dot is not dealt with the start of the extension.
+ *  ```ruby
+ *  Pathname('foo').extname # => ""
+ *  ```
  *
- *  An empty string will also be returned when the period is the last character
- *  in +path+.
+ *  Returns an empty string when the only period is the first character:
  *
- *  On Windows, trailing dots are truncated.
+ *  ```ruby
+ *  File.extname('.irbrc') # => ""
+ *  ```
  *
- *     File.extname("test.rb")         #=> ".rb"
- *     File.extname("a/b/d/test.rb")   #=> ".rb"
- *     File.extname(".a/b/d/test.rb")  #=> ".rb"
- *     File.extname("foo.")            #=> "" on Windows
- *     File.extname("foo.")            #=> "." on non-Windows
- *     File.extname("test")            #=> ""
- *     File.extname(".profile")        #=> ""
- *     File.extname(".profile.sh")     #=> ".sh"
+ *  Returns an empty string or `'.'` when `path` ends with a period:
+ *
+ *  ```
+ *  File.extname('foo.') # => ""      # On Windows.
+ *  File.extname('foo.') # => "."     # Elsewhere.
+ *  File.extname('foo....') # => ""   # On Windows.
+ *  File.extname('foo....') # => "."  # Elsewhere.
+ *  ```
  *
  */
 
 static VALUE
 rb_file_s_extname(VALUE klass, VALUE fname)
 {
-    const char *name, *e;
-    long len;
-    VALUE extname;
+    const char *name;
+    CheckPath(fname, name);
+    long len = RSTRING_LEN(fname);
 
-    FilePathStringValue(fname);
-    name = StringValueCStr(fname);
-    len = RSTRING_LEN(fname);
-    e = ruby_enc_find_extname(name, &len, rb_enc_get(fname));
-    if (len < 1)
-        return rb_str_new(0, 0);
-    extname = rb_str_subseq(fname, e - name, len); /* keep the dot, too! */
-    return extname;
+    if (len < 1) {
+        return rb_enc_str_new(0, 0, rb_str_enc_get(fname));
+    }
+
+    bool mb_enc = !rb_str_enc_fastpath(fname);
+    rb_encoding *enc = rb_str_enc_get(fname);
+
+    const char *ext = enc_find_extname(name, &len, mb_enc, enc);
+    return rb_enc_str_new(ext, len, enc);
 }
 
 /*
- *  call-seq:
+ * call-seq:
  *     File.path(path)  ->  string
  *
- *  Returns the string representation of the path
+ * Returns the string representation of the path
  *
  *     File.path(File::NULL)           #=> "/dev/null"
  *     File.path(Pathname.new("/tmp")) #=> "/tmp"
  *
+ * If +path+ is not a String:
+ *
+ * 1. If it has the +to_path+ method, that method will be called to
+ *    coerce to a String.
+ *
+ * 2. Otherwise, or if the coerced result is not a String too, the
+ *    standard coercion using +to_str+ method will take place on that
+ *    object. (See also String.try_convert)
+ *
+ * The coerced string must satisfy the following conditions:
+ *
+ * 1. It must be in an ASCII-compatible encoding; otherwise, an
+ *    Encoding::CompatibilityError is raised.
+ *
+ * 2. It must not contain the NUL character (<tt>\0</tt>); otherwise,
+ *    an ArgumentError is raised.
  */
 
 static VALUE
@@ -5091,15 +5438,17 @@ rb_file_s_split(VALUE klass, VALUE path)
     return rb_assoc_new(rb_file_dirname(path), rb_file_s_basename(1,&path,Qundef));
 }
 
+static VALUE rb_file_join_ary(VALUE ary);
+
 static VALUE
 file_inspect_join(VALUE ary, VALUE arg, int recur)
 {
     if (recur || ary == arg) rb_raise(rb_eArgError, "recursive array");
-    return rb_file_join(arg);
+    return rb_file_join_ary(arg);
 }
 
 static VALUE
-rb_file_join(VALUE ary)
+rb_file_join_ary(VALUE ary)
 {
     long len, i;
     VALUE result, tmp;
@@ -5147,11 +5496,11 @@ rb_file_join(VALUE ary)
             rb_enc_copy(result, tmp);
         }
         else {
-            tail = chompdirsep(name, name + len, rb_enc_get(result));
-            if (RSTRING_PTR(tmp) && isdirsep(RSTRING_PTR(tmp)[0])) {
+            tail = chompdirsep(name, name + len, true, rb_enc_get(result));
+            if (RSTRING_LEN(tmp) > 0 && isdirsep(RSTRING_PTR(tmp)[0])) {
                 rb_str_set_len(result, tail - name);
             }
-            else if (!*tail) {
+            else if (tail == name + len) {
                 rb_str_cat(result, "/", 1);
             }
         }
@@ -5164,6 +5513,77 @@ rb_file_join(VALUE ary)
     return result;
 }
 
+static inline VALUE
+rb_file_join_fastpath(long argc, VALUE *args)
+{
+    long size = argc;
+
+    long i;
+    for (i = 0; i < argc; i++) {
+        VALUE tmp = args[i];
+        if (RB_LIKELY(RB_TYPE_P(tmp, T_STRING) && rb_str_enc_fastpath(tmp))) {
+            size += RSTRING_LEN(tmp);
+        }
+        else {
+            return 0;
+        }
+    }
+
+    VALUE result = rb_str_buf_new(size);
+
+    int encidx = ENCODING_GET_INLINED(args[0]);
+    ENCODING_SET_INLINED(result, encidx);
+    rb_str_buf_append(result, args[0]);
+
+    const char *name = RSTRING_PTR(result);
+    for (i = 1; i < argc; i++) {
+        VALUE tmp = args[i];
+        long len = RSTRING_LEN(result);
+
+        const char *tmp_s;
+        long tmp_len;
+        RSTRING_GETMEM(tmp, tmp_s, tmp_len);
+
+        if (tmp_len > 0 && isdirsep(tmp_s[0])) {
+            // right side has a leading separator, remove left side separators.
+            long chomp = len;
+            while (chomp > 0 && isdirsep(name[chomp - 1])) {
+                --chomp;
+            }
+            rb_str_set_len(result, chomp);
+        }
+        else if (len < 1 || !isdirsep(name[len - 1])) {
+            // neither side have a separator, append one;
+            rb_str_cat(result, "/", 1);
+        }
+
+        if (RB_UNLIKELY(ENCODING_GET_INLINED(tmp) != encidx)) {
+            rb_encoding *new_enc = fs_enc_check(result, tmp);
+            rb_enc_associate(result, new_enc);
+            encidx = rb_enc_to_index(new_enc);
+        }
+
+        rb_str_buf_cat(result, tmp_s, tmp_len);
+    }
+
+    rb_str_null_check(result);
+    return result;
+}
+
+static inline VALUE
+rb_file_join(long argc, VALUE *args)
+{
+    if (RB_UNLIKELY(argc == 0)) {
+        return rb_str_new(0, 0);
+    }
+
+    VALUE result = rb_file_join_fastpath(argc, args);
+    if (RB_LIKELY(result)) {
+        return result;
+    }
+
+    return rb_file_join_ary(rb_ary_new_from_values(argc, args));
+}
 /*
  *  call-seq:
  *     File.join(string, ...)  ->  string
@@ -5176,9 +5596,9 @@ rb_file_join(VALUE ary)
  */
 
 static VALUE
-rb_file_s_join(VALUE klass, VALUE args)
+rb_file_s_join(int argc, VALUE *argv, VALUE klass)
 {
-    return rb_file_join(args);
+    return rb_file_join(argc, argv);
 }
 
 #if defined(HAVE_TRUNCATE)
@@ -5270,7 +5690,7 @@ rb_file_truncate(VALUE obj, VALUE len)
     }
     rb_io_flush_raw(obj, 0);
     fa.fd = fptr->fd;
-    if ((int)rb_thread_io_blocking_region(nogvl_ftruncate, &fa, fa.fd) < 0) {
+    if ((int)rb_io_blocking_region(fptr, nogvl_ftruncate, &fa) < 0) {
         rb_sys_fail_path(fptr->pathv);
     }
     return INT2FIX(0);
@@ -5318,7 +5738,7 @@ rb_thread_flock(void *data)
  *  call-seq:
  *    flock(locking_constant) -> 0 or false
  *
- *  Locks or unlocks file +self+ according to the given `locking_constant`,
+ *  Locks or unlocks file `self` according to the given `locking_constant`,
  *  a bitwise OR of the values in the table below.
  *
  *  Not available on all platforms.
@@ -5326,16 +5746,12 @@ rb_thread_flock(void *data)
  *  Returns `false` if `File::LOCK_NB` is specified and the operation would have blocked;
  *  otherwise returns `0`.
  *
- *  <br>
- *
  *  | Constant        | Lock         | Effect
- *  |-----------------|--------------|-------------------------------------------------------------------
- *  | +File::LOCK_EX+ | Exclusive    | Only one process may hold an exclusive lock for +self+ at a time.
- *  | +File::LOCK_NB+ | Non-blocking | No blocking; may be combined with +File::LOCK_SH+ or +File::LOCK_EX+ using the bitwise OR operator <tt>\|</tt>.
- *  | +File::LOCK_SH+ | Shared       | Multiple processes may each hold a shared lock for +self+ at the same time.
- *  | +File::LOCK_UN+ | Unlock       | Remove an existing lock held by this process.
- *
- *  <br>
+ *  |-----------------|--------------|-----------------------------------------------------------------------------------------------------------------|
+ *  | `File::LOCK_EX` | Exclusive    | Only one process may hold an exclusive lock for `self` at a time.                                               |
+ *  | `File::LOCK_NB` | Non-blocking | No blocking; may be combined with `File::LOCK_SH` or `File::LOCK_EX` using the bitwise OR operator <tt>\|</tt>. |
+ *  | `File::LOCK_SH` | Shared       | Multiple processes may each hold a shared lock for `self` at the same time.                                     |
+ *  | `File::LOCK_UN` | Unlock       | Remove an existing lock held by this process.                                                                   |
  *
  *  Example:
  *
@@ -5374,7 +5790,7 @@ rb_file_flock(VALUE obj, VALUE operation)
     if (fptr->mode & FMODE_WRITABLE) {
         rb_io_flush_raw(obj, 0);
     }
-    while ((int)rb_thread_io_blocking_region(rb_thread_flock, op, fptr->fd) < 0) {
+    while ((int)rb_io_blocking_region(fptr, rb_thread_flock, op) < 0) {
         int e = errno;
         switch (e) {
           case EAGAIN:
@@ -5451,22 +5867,22 @@ test_check(int n, int argc, VALUE *argv)
  *      | <tt>'o'</tt> | Whether the entity is owned by the caller's effective uid.                |
  *      | <tt>'O'</tt> | Like <tt>'o'</tt>, but uses the real uid (not the effective uid).         |
  *      | <tt>'p'</tt> | Whether the entity is a FIFO device (named pipe).                         |
- *      | <tt>'r'</tt> | Whether the entity is readable by the caller's effecive uid/gid.          |
+ *      | <tt>'r'</tt> | Whether the entity is readable by the caller's effective uid/gid.         |
  *      | <tt>'R'</tt> | Like <tt>'r'</tt>, but uses the real uid/gid (not the effective uid/gid). |
  *      | <tt>'S'</tt> | Whether the entity is a socket.                                           |
  *      | <tt>'u'</tt> | Whether the entity's setuid bit is set.                                   |
  *      | <tt>'w'</tt> | Whether the entity is writable by the caller's effective uid/gid.         |
  *      | <tt>'W'</tt> | Like <tt>'w'</tt>, but uses the real uid/gid (not the effective uid/gid). |
  *      | <tt>'x'</tt> | Whether the entity is executable by the caller's effective uid/gid.       |
- *      | <tt>'X'</tt> | Like <tt>'x'</tt>, but uses the real uid/gid (not the effecive uid/git).  |
+ *      | <tt>'X'</tt> | Like <tt>'x'</tt>, but uses the real uid/gid (not the effective uid/git). |
  *      | <tt>'z'</tt> | Whether the entity exists and is of length zero.                          |
  *
  *  - This test operates only on the entity at `path0`,
- *    and returns an integer size or +nil+:
+ *    and returns an integer size or `nil`:
  *
  *      | Character    | Test                                                                                         |
  *      |:------------:|:---------------------------------------------------------------------------------------------|
- *      | <tt>'s'</tt> | Returns positive integer size if the entity exists and has non-zero length, +nil+ otherwise. |
+ *      | <tt>'s'</tt> | Returns positive integer size if the entity exists and has non-zero length, `nil` otherwise. |
  *
  *  - Each of these tests operates only on the entity at `path0`,
  *    and returns a Time object;
@@ -5608,7 +6024,7 @@ rb_f_test(int argc, VALUE *argv, VALUE _)
 
     if (strchr("=<>", cmd)) {
         struct stat st1, st2;
-        struct timespec t1, t2;
+        stat_timestamp t1, t2;
 
         CHECK(2);
         if (rb_stat(argv[1], &st1) < 0) return Qfalse;
@@ -5648,24 +6064,60 @@ rb_f_test(int argc, VALUE *argv, VALUE _)
 /*
  *  Document-class: File::Stat
  *
- *  Objects of class File::Stat encapsulate common status information
- *  for File objects. The information is recorded at the moment the
- *  File::Stat object is created; changes made to the file after that
- *  point will not be reflected. File::Stat objects are returned by
- *  IO#stat, File::stat, File#lstat, and File::lstat. Many of these
- *  methods return platform-specific values, and not all values are
- *  meaningful on all systems. See also Kernel#test.
+ *  A \File::Stat object contains information about an entry in the file system.
+ *
+ *  Each of these methods returns a new \File::Stat object:
+ *
+ *  - File#lstat.
+ *  - File::Stat.new.
+ *  - File::lstat.
+ *  - File::stat.
+ *  - IO#stat.
+ *
+ *  === Snapshot
+ *
+ *  A new \File::Stat object takes an immediate "snapshot" of the entry's information;
+ *  the captured information is never updated,
+ *  regardless of changes in the actual entry:
+ *
+ *  The entry must exist when File::Stat.new is called:
+ *
+ *    filepath = 't.tmp'
+ *    File.exist?(filepath)           # => false
+ *    File::Stat.new(filepath)        # Raises Errno::ENOENT: No such file or directory.
+ *    File.write(filepath, 'foo')     # Create the file.
+ *    stat = File::Stat.new(filepath) # Okay.
+ *
+ *  Later changes to the actual entry do not change the \File::Stat object:
+ *
+ *    File.atime(filepath) # => 2026-04-01 11:51:38.0014518 -0500
+ *    stat.atime           # => 2026-04-01 11:51:38.0014518 -0500
+ *    File.write(filepath, 'bar')
+ *    File.atime(filepath) # => 2026-04-01 11:58:11.922614 -0500
+ *    stat.atime           # => 2026-04-01 11:51:38.0014518 -0500
+ *    File.delete(filepath)
+ *    stat.atime           # => 2026-04-01 11:51:38.0014518 -0500
+ *
+ *  === OS-Dependencies
+ *
+ *  Methods in a \File::Stat object may return platform-dependents values,
+ *  and not all values are meaningful on all systems;
+ *  for example, File::Stat#blocks returns +nil+ on Windows,
+ *  but returns an integer on Linux.
+ *
+ *  See also Kernel#test.
  */
 
 static VALUE
 rb_stat_s_alloc(VALUE klass)
 {
-    return stat_new_0(klass, 0);
+    VALUE obj;
+    stat_alloc(rb_cStat, &obj);
+    return obj;
 }
 
 /*
  * call-seq:
- *
  *   File::Stat.new(file_name)  -> stat
  *
  * Create a File::Stat object for the given file name (raising an
@@ -5675,11 +6127,11 @@ rb_stat_s_alloc(VALUE klass)
 static VALUE
 rb_stat_init(VALUE obj, VALUE fname)
 {
-    struct stat st;
+    rb_io_stat_data st;
 
     FilePathValue(fname);
     fname = rb_str_encode_ospath(fname);
-    if (STAT(StringValueCStr(fname), &st) == -1) {
+    if (STATX(StringValueCStr(fname), &st, STATX_ALL) == -1) {
         rb_sys_fail_path(fname);
     }
 
@@ -5725,7 +6177,7 @@ rb_stat_init_copy(VALUE copy, VALUE orig)
 static VALUE
 rb_stat_ftype(VALUE obj)
 {
-    return rb_file_ftype(get_stat(obj));
+    return rb_file_ftype(get_stat(obj)->ST_(mode));
 }
 
 /*
@@ -5742,7 +6194,7 @@ rb_stat_ftype(VALUE obj)
 static VALUE
 rb_stat_d(VALUE obj)
 {
-    if (S_ISDIR(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISDIR(get_stat(obj)->ST_(mode))) return Qtrue;
     return Qfalse;
 }
 
@@ -5758,7 +6210,7 @@ static VALUE
 rb_stat_p(VALUE obj)
 {
 #ifdef S_IFIFO
-    if (S_ISFIFO(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISFIFO(get_stat(obj)->ST_(mode))) return Qtrue;
 
 #endif
     return Qfalse;
@@ -5784,7 +6236,7 @@ static VALUE
 rb_stat_l(VALUE obj)
 {
 #ifdef S_ISLNK
-    if (S_ISLNK(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISLNK(get_stat(obj)->ST_(mode))) return Qtrue;
 #endif
     return Qfalse;
 }
@@ -5805,7 +6257,7 @@ static VALUE
 rb_stat_S(VALUE obj)
 {
 #ifdef S_ISSOCK
-    if (S_ISSOCK(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISSOCK(get_stat(obj)->ST_(mode))) return Qtrue;
 
 #endif
     return Qfalse;
@@ -5828,7 +6280,7 @@ static VALUE
 rb_stat_b(VALUE obj)
 {
 #ifdef S_ISBLK
-    if (S_ISBLK(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISBLK(get_stat(obj)->ST_(mode))) return Qtrue;
 
 #endif
     return Qfalse;
@@ -5849,7 +6301,7 @@ rb_stat_b(VALUE obj)
 static VALUE
 rb_stat_c(VALUE obj)
 {
-    if (S_ISCHR(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISCHR(get_stat(obj)->ST_(mode))) return Qtrue;
 
     return Qfalse;
 }
@@ -5869,14 +6321,14 @@ rb_stat_c(VALUE obj)
 static VALUE
 rb_stat_owned(VALUE obj)
 {
-    if (get_stat(obj)->st_uid == geteuid()) return Qtrue;
+    if (get_stat(obj)->ST_(uid) == geteuid()) return Qtrue;
     return Qfalse;
 }
 
 static VALUE
 rb_stat_rowned(VALUE obj)
 {
-    if (get_stat(obj)->st_uid == getuid()) return Qtrue;
+    if (get_stat(obj)->ST_(uid) == getuid()) return Qtrue;
     return Qfalse;
 }
 
@@ -5896,7 +6348,7 @@ static VALUE
 rb_stat_grpowned(VALUE obj)
 {
 #ifndef _WIN32
-    if (rb_group_member(get_stat(obj)->st_gid)) return Qtrue;
+    if (rb_group_member(get_stat(obj)->ST_(gid))) return Qtrue;
 #endif
     return Qfalse;
 }
@@ -5915,21 +6367,21 @@ rb_stat_grpowned(VALUE obj)
 static VALUE
 rb_stat_r(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (geteuid() == 0) return Qtrue;
 #endif
 #ifdef S_IRUSR
     if (rb_stat_owned(obj))
-        return RBOOL(st->st_mode & S_IRUSR);
+        return RBOOL(st->ST_(mode) & S_IRUSR);
 #endif
 #ifdef S_IRGRP
     if (rb_stat_grpowned(obj))
-        return RBOOL(st->st_mode & S_IRGRP);
+        return RBOOL(st->ST_(mode) & S_IRGRP);
 #endif
 #ifdef S_IROTH
-    if (!(st->st_mode & S_IROTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IROTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -5948,21 +6400,21 @@ rb_stat_r(VALUE obj)
 static VALUE
 rb_stat_R(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (getuid() == 0) return Qtrue;
 #endif
 #ifdef S_IRUSR
     if (rb_stat_rowned(obj))
-        return RBOOL(st->st_mode & S_IRUSR);
+        return RBOOL(st->ST_(mode) & S_IRUSR);
 #endif
 #ifdef S_IRGRP
-    if (rb_group_member(get_stat(obj)->st_gid))
-        return RBOOL(st->st_mode & S_IRGRP);
+    if (rb_group_member(get_stat(obj)->ST_(gid)))
+        return RBOOL(st->ST_(mode) & S_IRGRP);
 #endif
 #ifdef S_IROTH
-    if (!(st->st_mode & S_IROTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IROTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -5984,9 +6436,9 @@ static VALUE
 rb_stat_wr(VALUE obj)
 {
 #ifdef S_IROTH
-    struct stat *st = get_stat(obj);
-    if ((st->st_mode & (S_IROTH)) == S_IROTH) {
-        return UINT2NUM(st->st_mode & (S_IRUGO|S_IWUGO|S_IXUGO));
+    rb_io_stat_data *st = get_stat(obj);
+    if ((st->ST_(mode) & (S_IROTH)) == S_IROTH) {
+        return UINT2NUM(st->ST_(mode) & (S_IRUGO|S_IWUGO|S_IXUGO));
     }
 #endif
     return Qnil;
@@ -6006,21 +6458,21 @@ rb_stat_wr(VALUE obj)
 static VALUE
 rb_stat_w(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (geteuid() == 0) return Qtrue;
 #endif
 #ifdef S_IWUSR
     if (rb_stat_owned(obj))
-        return RBOOL(st->st_mode & S_IWUSR);
+        return RBOOL(st->ST_(mode) & S_IWUSR);
 #endif
 #ifdef S_IWGRP
     if (rb_stat_grpowned(obj))
-        return RBOOL(st->st_mode & S_IWGRP);
+        return RBOOL(st->ST_(mode) & S_IWGRP);
 #endif
 #ifdef S_IWOTH
-    if (!(st->st_mode & S_IWOTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IWOTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -6039,21 +6491,21 @@ rb_stat_w(VALUE obj)
 static VALUE
 rb_stat_W(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (getuid() == 0) return Qtrue;
 #endif
 #ifdef S_IWUSR
     if (rb_stat_rowned(obj))
-        return RBOOL(st->st_mode & S_IWUSR);
+        return RBOOL(st->ST_(mode) & S_IWUSR);
 #endif
 #ifdef S_IWGRP
-    if (rb_group_member(get_stat(obj)->st_gid))
-        return RBOOL(st->st_mode & S_IWGRP);
+    if (rb_group_member(get_stat(obj)->ST_(gid)))
+        return RBOOL(st->ST_(mode) & S_IWGRP);
 #endif
 #ifdef S_IWOTH
-    if (!(st->st_mode & S_IWOTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IWOTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -6075,9 +6527,9 @@ static VALUE
 rb_stat_ww(VALUE obj)
 {
 #ifdef S_IWOTH
-    struct stat *st = get_stat(obj);
-    if ((st->st_mode & (S_IWOTH)) == S_IWOTH) {
-        return UINT2NUM(st->st_mode & (S_IRUGO|S_IWUGO|S_IXUGO));
+    rb_io_stat_data *st = get_stat(obj);
+    if ((st->ST_(mode) & (S_IWOTH)) == S_IWOTH) {
+        return UINT2NUM(st->ST_(mode) & (S_IRUGO|S_IWUGO|S_IXUGO));
     }
 #endif
     return Qnil;
@@ -6099,23 +6551,23 @@ rb_stat_ww(VALUE obj)
 static VALUE
 rb_stat_x(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (geteuid() == 0) {
-        return RBOOL(st->st_mode & S_IXUGO);
+        return RBOOL(st->ST_(mode) & S_IXUGO);
     }
 #endif
 #ifdef S_IXUSR
     if (rb_stat_owned(obj))
-        return RBOOL(st->st_mode & S_IXUSR);
+        return RBOOL(st->ST_(mode) & S_IXUSR);
 #endif
 #ifdef S_IXGRP
     if (rb_stat_grpowned(obj))
-        return RBOOL(st->st_mode & S_IXGRP);
+        return RBOOL(st->ST_(mode) & S_IXGRP);
 #endif
 #ifdef S_IXOTH
-    if (!(st->st_mode & S_IXOTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IXOTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -6131,23 +6583,23 @@ rb_stat_x(VALUE obj)
 static VALUE
 rb_stat_X(VALUE obj)
 {
-    struct stat *st = get_stat(obj);
+    rb_io_stat_data *st = get_stat(obj);
 
 #ifdef USE_GETEUID
     if (getuid() == 0) {
-        return RBOOL(st->st_mode & S_IXUGO);
+        return RBOOL(st->ST_(mode) & S_IXUGO);
     }
 #endif
 #ifdef S_IXUSR
     if (rb_stat_rowned(obj))
-        return RBOOL(st->st_mode & S_IXUSR);
+        return RBOOL(st->ST_(mode) & S_IXUSR);
 #endif
 #ifdef S_IXGRP
-    if (rb_group_member(get_stat(obj)->st_gid))
-        return RBOOL(st->st_mode & S_IXGRP);
+    if (rb_group_member(get_stat(obj)->ST_(gid)))
+        return RBOOL(st->ST_(mode) & S_IXGRP);
 #endif
 #ifdef S_IXOTH
-    if (!(st->st_mode & S_IXOTH)) return Qfalse;
+    if (!(st->ST_(mode) & S_IXOTH)) return Qfalse;
 #endif
     return Qtrue;
 }
@@ -6166,7 +6618,7 @@ rb_stat_X(VALUE obj)
 static VALUE
 rb_stat_f(VALUE obj)
 {
-    if (S_ISREG(get_stat(obj)->st_mode)) return Qtrue;
+    if (S_ISREG(get_stat(obj)->ST_(mode))) return Qtrue;
     return Qfalse;
 }
 
@@ -6184,7 +6636,7 @@ rb_stat_f(VALUE obj)
 static VALUE
 rb_stat_z(VALUE obj)
 {
-    if (get_stat(obj)->st_size == 0) return Qtrue;
+    if (get_stat(obj)->ST_(size) == 0) return Qtrue;
     return Qfalse;
 }
 
@@ -6203,7 +6655,7 @@ rb_stat_z(VALUE obj)
 static VALUE
 rb_stat_s(VALUE obj)
 {
-    rb_off_t size = get_stat(obj)->st_size;
+    rb_off_t size = get_stat(obj)->ST_(size);
 
     if (size == 0) return Qnil;
     return OFFT2NUM(size);
@@ -6224,7 +6676,7 @@ static VALUE
 rb_stat_suid(VALUE obj)
 {
 #ifdef S_ISUID
-    if (get_stat(obj)->st_mode & S_ISUID) return Qtrue;
+    if (get_stat(obj)->ST_(mode) & S_ISUID) return Qtrue;
 #endif
     return Qfalse;
 }
@@ -6245,7 +6697,7 @@ static VALUE
 rb_stat_sgid(VALUE obj)
 {
 #ifdef S_ISGID
-    if (get_stat(obj)->st_mode & S_ISGID) return Qtrue;
+    if (get_stat(obj)->ST_(mode) & S_ISGID) return Qtrue;
 #endif
     return Qfalse;
 }
@@ -6266,7 +6718,7 @@ static VALUE
 rb_stat_sticky(VALUE obj)
 {
 #ifdef S_ISVTX
-    if (get_stat(obj)->st_mode & S_ISVTX) return Qtrue;
+    if (get_stat(obj)->ST_(mode) & S_ISVTX) return Qtrue;
 #endif
     return Qfalse;
 }
@@ -6347,95 +6799,6 @@ rb_is_absolute_path(const char *path)
     return 0;
 }
 
-#ifndef ENABLE_PATH_CHECK
-# if defined DOSISH || defined __CYGWIN__
-#   define ENABLE_PATH_CHECK 0
-# else
-#   define ENABLE_PATH_CHECK 1
-# endif
-#endif
-
-#if ENABLE_PATH_CHECK
-static int
-path_check_0(VALUE path)
-{
-    struct stat st;
-    const char *p0 = StringValueCStr(path);
-    const char *e0;
-    rb_encoding *enc;
-    char *p = 0, *s;
-
-    if (!rb_is_absolute_path(p0)) {
-        char *buf = ruby_getcwd();
-        VALUE newpath;
-
-        newpath = rb_str_new2(buf);
-        xfree(buf);
-
-        rb_str_cat2(newpath, "/");
-        rb_str_cat2(newpath, p0);
-        path = newpath;
-        p0 = RSTRING_PTR(path);
-    }
-    e0 = p0 + RSTRING_LEN(path);
-    enc = rb_enc_get(path);
-    for (;;) {
-#ifndef S_IWOTH
-# define S_IWOTH 002
-#endif
-        if (STAT(p0, &st) == 0 && S_ISDIR(st.st_mode) && (st.st_mode & S_IWOTH)
-#ifdef S_ISVTX
-            && !(p && (st.st_mode & S_ISVTX))
-#endif
-            && !access(p0, W_OK)) {
-            rb_enc_warn(enc, "Insecure world writable dir %s in PATH, mode 0%"
-#if SIZEOF_DEV_T > SIZEOF_INT
-                        PRI_MODET_PREFIX"o",
-#else
-                        "o",
-#endif
-                        p0, st.st_mode);
-            if (p) *p = '/';
-            RB_GC_GUARD(path);
-            return 0;
-        }
-        s = strrdirsep(p0, e0, enc);
-        if (p) *p = '/';
-        if (!s || s == p0) return 1;
-        p = s;
-        e0 = p;
-        *p = '\0';
-    }
-}
-#endif
-
-int
-rb_path_check(const char *path)
-{
-#if ENABLE_PATH_CHECK
-    const char *p0, *p, *pend;
-    const char sep = PATH_SEP_CHAR;
-
-    if (!path) return 1;
-
-    pend = path + strlen(path);
-    p0 = path;
-    p = strchr(path, sep);
-    if (!p) p = pend;
-
-    for (;;) {
-        if (!path_check_0(rb_str_new(p0, p - p0))) {
-            return 0;		/* not safe */
-        }
-        p0 = p + 1;
-        if (p0 > pend) break;
-        p = strchr(p0, sep);
-        if (!p) p = pend;
-    }
-#endif
-    return 1;
-}
-
 int
 ruby_is_fd_loadable(int fd)
 {
@@ -6638,7 +7001,7 @@ const char ruby_null_device[] =
 /*
  *  A \File object is a representation of a file in the underlying platform.
  *
- *  \Class \File extends module FileTest, supporting such singleton methods
+ *  Class \File extends module FileTest, supporting such singleton methods
  *  as <tt>File.exist?</tt>.
  *
  *  == About the Examples
@@ -6656,7 +7019,7 @@ const char ruby_null_device[] =
  *  Methods File.new and File.open each may take string argument +mode+, which:
  *
  *  - Begins with a 1- or 2-character
- *    {read/write mode}[rdoc-ref:File@Read-2FWrite+Mode].
+ *    {read/write mode}[rdoc-ref:File@ReadWrite+Mode].
  *  - May also contain a 1-character {data mode}[rdoc-ref:File@Data+Mode].
  *  - May also contain a 1-character
  *    {file-create mode}[rdoc-ref:File@File-Create+Mode].
@@ -7295,9 +7658,9 @@ const char ruby_null_device[] =
  *
  *  == What's Here
  *
- *  First, what's elsewhere. \Class \File:
+ *  First, what's elsewhere. Class \File:
  *
- *  - Inherits from {class IO}[rdoc-ref:IO@What-27s+Here],
+ *  - Inherits from {class IO}[rdoc-ref:IO@Whats+Here],
  *    in particular, methods for creating, reading, and writing files
  *  - Includes module FileTest,
  *    which provides dozens of additional methods.
@@ -7512,7 +7875,7 @@ Init_File(void)
     /* separates directory parts in path */
     rb_define_const(rb_cFile, "SEPARATOR", separator);
     rb_define_singleton_method(rb_cFile, "split",  rb_file_s_split, 1);
-    rb_define_singleton_method(rb_cFile, "join",   rb_file_s_join, -2);
+    rb_define_singleton_method(rb_cFile, "join",   rb_file_s_join, -1);
 
 #ifdef DOSISH
     /* platform specific alternative separator */
@@ -7541,7 +7904,7 @@ Init_File(void)
     /*
      * Document-module: File::Constants
      *
-     * \Module +File::Constants+ defines file-related constants.
+     * Module +File::Constants+ defines file-related constants.
      *
      * There are two families of constants here:
      *
@@ -7816,11 +8179,11 @@ Init_File(void)
      *
      * ==== File::FNM_EXTGLOB
      *
-     * Flag File::FNM_EXTGLOB enables pattern <tt>'{_a_,_b_}'</tt>,
+     * Flag File::FNM_EXTGLOB enables pattern <tt>'{a,b}'</tt>,
      * which matches pattern '_a_' and pattern '_b_';
      * behaves like
      * a {regexp union}[rdoc-ref:Regexp.union]
-     * (e.g., <tt>'(?:_a_|_b_)'</tt>):
+     * (e.g., <tt>'(?:a|b)'</tt>):
      *
      *   pattern = '{LEGAL,BSDL}'
      *   Dir.glob(pattern)      # => ["LEGAL", "BSDL"]
diff --git a/gc.c b/gc.c
index f47f20fa57..0219fa6e78 100644
--- a/gc.c
+++ b/gc.c
@@ -11,21 +11,11 @@
 
 **********************************************************************/
 
-#define rb_data_object_alloc rb_data_object_alloc
-#define rb_data_typed_object_alloc rb_data_typed_object_alloc
-
 #include "ruby/internal/config.h"
 #ifdef _WIN32
 # include "ruby/ruby.h"
 #endif
 
-#include <signal.h>
-
-#ifndef _WIN32
-#include <unistd.h>
-#include <sys/mman.h>
-#endif
-
 #if defined(__wasm__) && !defined(__EMSCRIPTEN__)
 # include "wasm/setjmp.h"
 # include "wasm/machine.h"
@@ -58,19 +48,6 @@
 # endif
 #endif
 
-#ifdef HAVE_MALLOC_TRIM
-# include <malloc.h>
-
-# ifdef __EMSCRIPTEN__
-/* malloc_trim is defined in emscripten/emmalloc.h on emscripten. */
-#  include <emscripten/emmalloc.h>
-# endif
-#endif
-
-#if !defined(PAGE_SIZE) && defined(HAVE_SYS_USER_H)
-/* LIST_HEAD conflicts with sys/queue.h on macOS */
-# include <sys/user.h>
-#endif
 /* MALLOC_HEADERS_END */
 
 #ifdef HAVE_SYS_TIME_H
@@ -94,22 +71,23 @@
 #include <emscripten.h>
 #endif
 
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-# include <mach/task.h>
-# include <mach/mach_init.h>
-# include <mach/mach_port.h>
+/* For ruby_annotate_mmap */
+#ifdef HAVE_SYS_PRCTL_H
+#include <sys/prctl.h>
 #endif
+
 #undef LIST_HEAD /* ccan/list conflicts with BSD-origin sys/queue.h. */
 
 #include "constant.h"
-#include "darray.h"
 #include "debug_counter.h"
 #include "eval_intern.h"
+#include "gc/gc.h"
 #include "id_table.h"
 #include "internal.h"
 #include "internal/class.h"
 #include "internal/compile.h"
 #include "internal/complex.h"
+#include "internal/concurrent_set.h"
 #include "internal/cont.h"
 #include "internal/error.h"
 #include "internal/eval.h"
@@ -121,13 +99,13 @@
 #include "internal/object.h"
 #include "internal/proc.h"
 #include "internal/rational.h"
+#include "internal/re.h"
 #include "internal/sanitizers.h"
 #include "internal/struct.h"
 #include "internal/symbol.h"
 #include "internal/thread.h"
 #include "internal/variable.h"
 #include "internal/warnings.h"
-#include "rjit.h"
 #include "probes.h"
 #include "regint.h"
 #include "ruby/debug.h"
@@ -136,25 +114,301 @@
 #include "ruby/st.h"
 #include "ruby/thread.h"
 #include "ruby/util.h"
+#include "ruby/vm.h"
 #include "ruby_assert.h"
 #include "ruby_atomic.h"
 #include "symbol.h"
+#include "variable.h"
 #include "vm_core.h"
 #include "vm_sync.h"
 #include "vm_callinfo.h"
 #include "ractor_core.h"
+#include "yjit.h"
+#include "zjit.h"
 
 #include "builtin.h"
 #include "shape.h"
 
+// TODO: Don't export this function in modular GC, instead MMTk should figure out
+// how to combine GC thread backtrace with mutator thread backtrace.
+void
+rb_gc_print_backtrace(void)
+{
+    rb_print_backtrace(stderr);
+}
+
+unsigned int
+rb_gc_vm_lock(const char *file, int line)
+{
+    unsigned int lev = 0;
+    rb_vm_lock_enter(&lev, file, line);
+    return lev;
+}
+
+void
+rb_gc_vm_unlock(unsigned int lev, const char *file, int line)
+{
+    rb_vm_lock_leave(&lev, file, line);
+}
+
+unsigned int
+rb_gc_cr_lock(const char *file, int line)
+{
+    unsigned int lev;
+    rb_vm_lock_enter_cr(GET_RACTOR(), &lev, file, line);
+    return lev;
+}
+
+void
+rb_gc_cr_unlock(unsigned int lev, const char *file, int line)
+{
+    rb_vm_lock_leave_cr(GET_RACTOR(), &lev, file, line);
+}
+
+unsigned int
+rb_gc_vm_lock_no_barrier(const char *file, int line)
+{
+    unsigned int lev = 0;
+    rb_vm_lock_enter_nb(&lev, file, line);
+    return lev;
+}
+
+void
+rb_gc_vm_unlock_no_barrier(unsigned int lev, const char *file, int line)
+{
+    rb_vm_lock_leave_nb(&lev, file, line);
+}
+
+void
+rb_gc_vm_barrier(void)
+{
+    rb_vm_barrier();
+}
+
+void *
+rb_gc_get_ractor_newobj_cache(void)
+{
+    return GET_RACTOR()->newobj_cache;
+}
+
+void
+rb_gc_initialize_vm_context(struct rb_gc_vm_context *context)
+{
+    rb_native_mutex_initialize(&context->lock);
+    context->ec = GET_EC();
+}
+
+bool
+rb_gc_event_hook_required_p(rb_event_flag_t event)
+{
+    return ruby_vm_event_flags & event;
+}
+
+void
+rb_gc_event_hook(VALUE obj, rb_event_flag_t event)
+{
+    if (LIKELY(!rb_gc_event_hook_required_p(event))) return;
+
+    rb_execution_context_t *ec = rb_gc_get_ec();
+    if (!ec->cfp) return;
+
+#if USE_MODULAR_GC
+    bool gc_thread_p = false;
+    if (!GET_EC()) {
+        gc_thread_p = true;
+
+# ifdef RB_THREAD_LOCAL_SPECIFIER
+        rb_current_ec_set(ec);
+# else
+        native_tls_set(ruby_current_ec_key, ec);
+# endif
+    }
+#endif
+
+    EXEC_EVENT_HOOK(ec, event, ec->cfp->self, 0, 0, 0, obj);
+
+#if USE_MODULAR_GC
+    if (gc_thread_p) {
+# ifdef RB_THREAD_LOCAL_SPECIFIER
+        rb_current_ec_set(NULL);
+# else
+        native_tls_set(ruby_current_ec_key, NULL);
+# endif
+    }
+#endif
+}
+
+void *
+rb_gc_get_objspace(void)
+{
+    return GET_VM()->gc.objspace;
+}
+
+void
+rb_gc_ractor_newobj_cache_foreach(void (*func)(void *cache, void *data), void *data)
+{
+    rb_ractor_t *r = NULL;
+    if (RB_LIKELY(ruby_single_main_ractor)) {
+        GC_ASSERT(
+            ccan_list_empty(&GET_VM()->ractor.set) ||
+                (ccan_list_top(&GET_VM()->ractor.set, rb_ractor_t, vmlr_node) == ruby_single_main_ractor &&
+                    ccan_list_tail(&GET_VM()->ractor.set, rb_ractor_t, vmlr_node) == ruby_single_main_ractor)
+        );
+
+        func(ruby_single_main_ractor->newobj_cache, data);
+    }
+    else {
+        ccan_list_for_each(&GET_VM()->ractor.set, r, vmlr_node) {
+            func(r->newobj_cache, data);
+        }
+    }
+}
+
+void
+rb_gc_run_obj_finalizer(VALUE objid, long count, VALUE (*callback)(long i, void *data), void *data)
+{
+    volatile struct {
+        VALUE errinfo;
+        VALUE final;
+        rb_control_frame_t *cfp;
+        VALUE *sp;
+        long finished;
+    } saved;
+
+    rb_execution_context_t * volatile ec = GET_EC();
+#define RESTORE_FINALIZER() (\
+        ec->cfp = saved.cfp, \
+        ec->cfp->sp = saved.sp, \
+        ec->errinfo = saved.errinfo)
+
+    saved.errinfo = ec->errinfo;
+    saved.cfp = ec->cfp;
+    saved.sp = ec->cfp->sp;
+    saved.finished = 0;
+    saved.final = Qundef;
+
+    ASSERT_vm_unlocking();
+    rb_ractor_ignore_belonging(true);
+    EC_PUSH_TAG(ec);
+    enum ruby_tag_type state = EC_EXEC_TAG();
+    if (state != TAG_NONE) {
+        ++saved.finished;	/* skip failed finalizer */
+
+        VALUE failed_final = saved.final;
+        saved.final = Qundef;
+        if (!UNDEF_P(failed_final) && !NIL_P(ruby_verbose)) {
+            rb_warn("Exception in finalizer %+"PRIsVALUE, failed_final);
+            rb_ec_error_print(ec, ec->errinfo);
+        }
+    }
+
+    for (long i = saved.finished; RESTORE_FINALIZER(), i < count; saved.finished = ++i) {
+        saved.final = callback(i, data);
+        rb_check_funcall(saved.final, idCall, 1, &objid);
+    }
+    EC_POP_TAG();
+    rb_ractor_ignore_belonging(false);
+#undef RESTORE_FINALIZER
+}
+
+void
+rb_gc_set_pending_interrupt(void)
+{
+    rb_execution_context_t *ec = GET_EC();
+    ec->interrupt_mask |= PENDING_INTERRUPT_MASK;
+}
+
+void
+rb_gc_unset_pending_interrupt(void)
+{
+    rb_execution_context_t *ec = GET_EC();
+    ec->interrupt_mask &= ~PENDING_INTERRUPT_MASK;
+}
+
+bool
+rb_gc_multi_ractor_p(void)
+{
+    return rb_multi_ractor_p();
+}
+
+bool
+rb_gc_shutdown_call_finalizer_p(VALUE obj)
+{
+    switch (BUILTIN_TYPE(obj)) {
+      case T_DATA:
+        if (!ruby_free_at_exit_p()) {
+            if (!RDATA(obj)->type) return false;
+            if (!rbimpl_typeddata_embedded_p(obj) && !RTYPEDDATA(obj)->data) return false;
+        }
+        if (rb_obj_is_thread(obj)) return false;
+        if (rb_obj_is_mutex(obj)) return false;
+        if (rb_obj_is_fiber(obj)) return false;
+        if (rb_ractor_p(obj)) return false;
+        if (rb_obj_is_fstring_table(obj)) return false;
+        if (rb_obj_is_symbol_table(obj)) return false;
+
+        return true;
+
+      case T_FILE:
+        return true;
+
+      case T_SYMBOL:
+        return true;
+
+      case T_NONE:
+        return false;
+
+      default:
+        return ruby_free_at_exit_p();
+    }
+}
+
+void
+rb_gc_obj_changed_pool(VALUE obj, size_t heap_id)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, T_OBJECT));
+
+    RBASIC_SET_SHAPE_ID(obj, rb_obj_shape_transition_heap(obj, heap_id));
+}
+
+void rb_vm_update_references(void *ptr);
+
 #define rb_setjmp(env) RUBY_SETJMP(env)
 #define rb_jmp_buf rb_jmpbuf_t
-#undef rb_data_object_wrap
 
 #if !defined(MAP_ANONYMOUS) && defined(MAP_ANON)
 #define MAP_ANONYMOUS MAP_ANON
 #endif
 
+#define unless_objspace(objspace) \
+    void *objspace; \
+    rb_vm_t *unless_objspace_vm = GET_VM(); \
+    if (unless_objspace_vm) objspace = unless_objspace_vm->gc.objspace; \
+    else /* return; or objspace will be warned uninitialized */
+
+#define RMOVED(obj) ((struct RMoved *)(obj))
+
+#define TYPED_UPDATE_IF_MOVED(_objspace, _type, _thing) do { \
+    if (gc_object_moved_p_internal((_objspace), (VALUE)(_thing))) {    \
+        *(_type *)&(_thing) = (_type)gc_location_internal(_objspace, (VALUE)_thing); \
+    } \
+} while (0)
+
+#define UPDATE_IF_MOVED(_objspace, _thing) TYPED_UPDATE_IF_MOVED(_objspace, VALUE, _thing)
+
+#if RUBY_MARK_FREE_DEBUG
+int ruby_gc_debug_indent = 0;
+#endif
+
+#ifndef RGENGC_OBJ_INFO
+# define RGENGC_OBJ_INFO RGENGC_CHECK_MODE
+#endif
+
+#ifndef CALC_EXACT_MALLOC_SIZE
+# define CALC_EXACT_MALLOC_SIZE 0
+#endif
+
+VALUE rb_mGC;
 
 static size_t malloc_offset = 0;
 #if defined(HAVE_MALLOC_USABLE_SIZE)
@@ -217,49 +471,21 @@ rb_malloc_grow_capa(size_t current, size_t type_size)
     return new_capacity;
 }
 
-static inline struct rbimpl_size_mul_overflow_tag
-size_add_overflow(size_t x, size_t y)
-{
-    size_t z;
-    bool p;
-#if 0
-
-#elif defined(ckd_add)
-    p = ckd_add(&z, x, y);
-
-#elif __has_builtin(__builtin_add_overflow)
-    p = __builtin_add_overflow(x, y, &z);
-
-#elif defined(DSIZE_T)
-    RB_GNUC_EXTENSION DSIZE_T dx = x;
-    RB_GNUC_EXTENSION DSIZE_T dy = y;
-    RB_GNUC_EXTENSION DSIZE_T dz = dx + dy;
-    p = dz > SIZE_MAX;
-    z = (size_t)dz;
-
-#else
-    z = x + y;
-    p = z < y;
-
-#endif
-    return (struct rbimpl_size_mul_overflow_tag) { p, z, };
-}
-
-static inline struct rbimpl_size_mul_overflow_tag
+static inline struct rbimpl_size_overflow_tag
 size_mul_add_overflow(size_t x, size_t y, size_t z) /* x * y + z */
 {
-    struct rbimpl_size_mul_overflow_tag t = rbimpl_size_mul_overflow(x, y);
-    struct rbimpl_size_mul_overflow_tag u = size_add_overflow(t.right, z);
-    return (struct rbimpl_size_mul_overflow_tag) { t.left || u.left, u.right };
+    struct rbimpl_size_overflow_tag t = rbimpl_size_mul_overflow(x, y);
+    struct rbimpl_size_overflow_tag u = rbimpl_size_add_overflow(t.result, z);
+    return (struct rbimpl_size_overflow_tag) { t.overflowed || u.overflowed, u.result };
 }
 
-static inline struct rbimpl_size_mul_overflow_tag
+static inline struct rbimpl_size_overflow_tag
 size_mul_add_mul_overflow(size_t x, size_t y, size_t z, size_t w) /* x * y + z * w */
 {
-    struct rbimpl_size_mul_overflow_tag t = rbimpl_size_mul_overflow(x, y);
-    struct rbimpl_size_mul_overflow_tag u = rbimpl_size_mul_overflow(z, w);
-    struct rbimpl_size_mul_overflow_tag v = size_add_overflow(t.right, u.right);
-    return (struct rbimpl_size_mul_overflow_tag) { t.left || u.left || v.left, v.right };
+    struct rbimpl_size_overflow_tag t = rbimpl_size_mul_overflow(x, y);
+    struct rbimpl_size_overflow_tag u = rbimpl_size_mul_overflow(z, w);
+    struct rbimpl_size_overflow_tag v = rbimpl_size_add_overflow(t.result, u.result);
+    return (struct rbimpl_size_overflow_tag) { t.overflowed || u.overflowed || v.overflowed, v.result };
 }
 
 PRINTF_ARGS(NORETURN(static void gc_raise(VALUE, const char*, ...)), 2, 3);
@@ -267,9 +493,9 @@ PRINTF_ARGS(NORETURN(static void gc_raise(VALUE, const char*, ...)), 2, 3);
 static inline size_t
 size_mul_or_raise(size_t x, size_t y, VALUE exc)
 {
-    struct rbimpl_size_mul_overflow_tag t = rbimpl_size_mul_overflow(x, y);
-    if (LIKELY(!t.left)) {
-        return t.right;
+    struct rbimpl_size_overflow_tag t = rbimpl_size_mul_overflow(x, y);
+    if (LIKELY(!t.overflowed)) {
+        return t.result;
     }
     else if (rb_during_gc()) {
         rb_memerror();          /* or...? */
@@ -293,9 +519,9 @@ rb_size_mul_or_raise(size_t x, size_t y, VALUE exc)
 static inline size_t
 size_mul_add_or_raise(size_t x, size_t y, size_t z, VALUE exc)
 {
-    struct rbimpl_size_mul_overflow_tag t = size_mul_add_overflow(x, y, z);
-    if (LIKELY(!t.left)) {
-        return t.right;
+    struct rbimpl_size_overflow_tag t = size_mul_add_overflow(x, y, z);
+    if (LIKELY(!t.overflowed)) {
+        return t.result;
     }
     else if (rb_during_gc()) {
         rb_memerror();          /* or...? */
@@ -320,9 +546,9 @@ rb_size_mul_add_or_raise(size_t x, size_t y, size_t z, VALUE exc)
 static inline size_t
 size_mul_add_mul_or_raise(size_t x, size_t y, size_t z, size_t w, VALUE exc)
 {
-    struct rbimpl_size_mul_overflow_tag t = size_mul_add_mul_overflow(x, y, z, w);
-    if (LIKELY(!t.left)) {
-        return t.right;
+    struct rbimpl_size_overflow_tag t = size_mul_add_mul_overflow(x, y, z, w);
+    if (LIKELY(!t.overflowed)) {
+        return t.result;
     }
     else if (rb_during_gc()) {
         rb_memerror();          /* or...? */
@@ -351,2619 +577,559 @@ rb_gc_guarded_ptr_val(volatile VALUE *ptr, VALUE val)
 }
 #endif
 
-#ifndef GC_HEAP_INIT_SLOTS
-#define GC_HEAP_INIT_SLOTS 10000
-#endif
-#ifndef GC_HEAP_FREE_SLOTS
-#define GC_HEAP_FREE_SLOTS  4096
-#endif
-#ifndef GC_HEAP_GROWTH_FACTOR
-#define GC_HEAP_GROWTH_FACTOR 1.8
-#endif
-#ifndef GC_HEAP_GROWTH_MAX_SLOTS
-#define GC_HEAP_GROWTH_MAX_SLOTS 0 /* 0 is disable */
-#endif
-#ifndef GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO
-# define GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO 0.01
-#endif
-#ifndef GC_HEAP_OLDOBJECT_LIMIT_FACTOR
-#define GC_HEAP_OLDOBJECT_LIMIT_FACTOR 2.0
-#endif
-
-#ifndef GC_HEAP_FREE_SLOTS_MIN_RATIO
-#define GC_HEAP_FREE_SLOTS_MIN_RATIO  0.20
-#endif
-#ifndef GC_HEAP_FREE_SLOTS_GOAL_RATIO
-#define GC_HEAP_FREE_SLOTS_GOAL_RATIO 0.40
-#endif
-#ifndef GC_HEAP_FREE_SLOTS_MAX_RATIO
-#define GC_HEAP_FREE_SLOTS_MAX_RATIO  0.65
-#endif
-
-#ifndef GC_MALLOC_LIMIT_MIN
-#define GC_MALLOC_LIMIT_MIN (16 * 1024 * 1024 /* 16MB */)
-#endif
-#ifndef GC_MALLOC_LIMIT_MAX
-#define GC_MALLOC_LIMIT_MAX (32 * 1024 * 1024 /* 32MB */)
-#endif
-#ifndef GC_MALLOC_LIMIT_GROWTH_FACTOR
-#define GC_MALLOC_LIMIT_GROWTH_FACTOR 1.4
-#endif
-
-#ifndef GC_OLDMALLOC_LIMIT_MIN
-#define GC_OLDMALLOC_LIMIT_MIN (16 * 1024 * 1024 /* 16MB */)
-#endif
-#ifndef GC_OLDMALLOC_LIMIT_GROWTH_FACTOR
-#define GC_OLDMALLOC_LIMIT_GROWTH_FACTOR 1.2
-#endif
-#ifndef GC_OLDMALLOC_LIMIT_MAX
-#define GC_OLDMALLOC_LIMIT_MAX (128 * 1024 * 1024 /* 128MB */)
-#endif
-
-#ifndef GC_CAN_COMPILE_COMPACTION
-#if defined(__wasi__) /* WebAssembly doesn't support signals */
-# define GC_CAN_COMPILE_COMPACTION 0
-#else
-# define GC_CAN_COMPILE_COMPACTION 1
-#endif
-#endif
-
-#ifndef PRINT_MEASURE_LINE
-#define PRINT_MEASURE_LINE 0
-#endif
-#ifndef PRINT_ENTER_EXIT_TICK
-#define PRINT_ENTER_EXIT_TICK 0
-#endif
-#ifndef PRINT_ROOT_TICKS
-#define PRINT_ROOT_TICKS 0
-#endif
-
-#define USE_TICK_T                 (PRINT_ENTER_EXIT_TICK || PRINT_MEASURE_LINE || PRINT_ROOT_TICKS)
-
-typedef struct {
-    size_t size_pool_init_slots[SIZE_POOL_COUNT];
-    size_t heap_free_slots;
-    double growth_factor;
-    size_t growth_max_slots;
-
-    double heap_free_slots_min_ratio;
-    double heap_free_slots_goal_ratio;
-    double heap_free_slots_max_ratio;
-    double uncollectible_wb_unprotected_objects_limit_ratio;
-    double oldobject_limit_factor;
-
-    size_t malloc_limit_min;
-    size_t malloc_limit_max;
-    double malloc_limit_growth_factor;
-
-    size_t oldmalloc_limit_min;
-    size_t oldmalloc_limit_max;
-    double oldmalloc_limit_growth_factor;
-} ruby_gc_params_t;
-
-static ruby_gc_params_t gc_params = {
-    { 0 },
-    GC_HEAP_FREE_SLOTS,
-    GC_HEAP_GROWTH_FACTOR,
-    GC_HEAP_GROWTH_MAX_SLOTS,
-
-    GC_HEAP_FREE_SLOTS_MIN_RATIO,
-    GC_HEAP_FREE_SLOTS_GOAL_RATIO,
-    GC_HEAP_FREE_SLOTS_MAX_RATIO,
-    GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO,
-    GC_HEAP_OLDOBJECT_LIMIT_FACTOR,
-
-    GC_MALLOC_LIMIT_MIN,
-    GC_MALLOC_LIMIT_MAX,
-    GC_MALLOC_LIMIT_GROWTH_FACTOR,
-
-    GC_OLDMALLOC_LIMIT_MIN,
-    GC_OLDMALLOC_LIMIT_MAX,
-    GC_OLDMALLOC_LIMIT_GROWTH_FACTOR,
-};
-
-/* GC_DEBUG:
- *  enable to embed GC debugging information.
- */
-#ifndef GC_DEBUG
-#define GC_DEBUG 0
-#endif
-
-/* RGENGC_DEBUG:
- * 1: basic information
- * 2: remember set operation
- * 3: mark
- * 4:
- * 5: sweep
- */
-#ifndef RGENGC_DEBUG
-#ifdef RUBY_DEVEL
-#define RGENGC_DEBUG       -1
-#else
-#define RGENGC_DEBUG       0
-#endif
-#endif
-#if RGENGC_DEBUG < 0 && !defined(_MSC_VER)
-# define RGENGC_DEBUG_ENABLED(level) (-(RGENGC_DEBUG) >= (level) && ruby_rgengc_debug >= (level))
-#elif defined(HAVE_VA_ARGS_MACRO)
-# define RGENGC_DEBUG_ENABLED(level) ((RGENGC_DEBUG) >= (level))
-#else
-# define RGENGC_DEBUG_ENABLED(level) 0
-#endif
-int ruby_rgengc_debug;
-
-/* RGENGC_CHECK_MODE
- * 0: disable all assertions
- * 1: enable assertions (to debug RGenGC)
- * 2: enable internal consistency check at each GC (for debugging)
- * 3: enable internal consistency check at each GC steps (for debugging)
- * 4: enable liveness check
- * 5: show all references
- */
-#ifndef RGENGC_CHECK_MODE
-#define RGENGC_CHECK_MODE  0
-#endif
-
-// Note: using RUBY_ASSERT_WHEN() extend a macro in expr (info by nobu).
-#define GC_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(RGENGC_CHECK_MODE > 0, expr, #expr)
-
-/* RGENGC_PROFILE
- * 0: disable RGenGC profiling
- * 1: enable profiling for basic information
- * 2: enable profiling for each types
- */
-#ifndef RGENGC_PROFILE
-#define RGENGC_PROFILE     0
-#endif
-
-/* RGENGC_ESTIMATE_OLDMALLOC
- * Enable/disable to estimate increase size of malloc'ed size by old objects.
- * If estimation exceeds threshold, then will invoke full GC.
- * 0: disable estimation.
- * 1: enable estimation.
- */
-#ifndef RGENGC_ESTIMATE_OLDMALLOC
-#define RGENGC_ESTIMATE_OLDMALLOC 1
-#endif
-
-/* RGENGC_FORCE_MAJOR_GC
- * Force major/full GC if this macro is not 0.
- */
-#ifndef RGENGC_FORCE_MAJOR_GC
-#define RGENGC_FORCE_MAJOR_GC 0
-#endif
-
-#ifndef GC_PROFILE_MORE_DETAIL
-#define GC_PROFILE_MORE_DETAIL 0
-#endif
-#ifndef GC_PROFILE_DETAIL_MEMORY
-#define GC_PROFILE_DETAIL_MEMORY 0
-#endif
-#ifndef GC_ENABLE_LAZY_SWEEP
-#define GC_ENABLE_LAZY_SWEEP   1
-#endif
-#ifndef CALC_EXACT_MALLOC_SIZE
-#define CALC_EXACT_MALLOC_SIZE USE_GC_MALLOC_OBJ_INFO_DETAILS
-#endif
-#if defined(HAVE_MALLOC_USABLE_SIZE) || CALC_EXACT_MALLOC_SIZE > 0
-#ifndef MALLOC_ALLOCATED_SIZE
-#define MALLOC_ALLOCATED_SIZE 0
-#endif
-#else
-#define MALLOC_ALLOCATED_SIZE 0
-#endif
-#ifndef MALLOC_ALLOCATED_SIZE_CHECK
-#define MALLOC_ALLOCATED_SIZE_CHECK 0
-#endif
-
-#ifndef GC_DEBUG_STRESS_TO_CLASS
-#define GC_DEBUG_STRESS_TO_CLASS RUBY_DEBUG
-#endif
-
-#ifndef RGENGC_OBJ_INFO
-#define RGENGC_OBJ_INFO (RGENGC_DEBUG | RGENGC_CHECK_MODE)
-#endif
-
-typedef enum {
-    GPR_FLAG_NONE               = 0x000,
-    /* major reason */
-    GPR_FLAG_MAJOR_BY_NOFREE    = 0x001,
-    GPR_FLAG_MAJOR_BY_OLDGEN    = 0x002,
-    GPR_FLAG_MAJOR_BY_SHADY     = 0x004,
-    GPR_FLAG_MAJOR_BY_FORCE     = 0x008,
-#if RGENGC_ESTIMATE_OLDMALLOC
-    GPR_FLAG_MAJOR_BY_OLDMALLOC = 0x020,
-#endif
-    GPR_FLAG_MAJOR_MASK         = 0x0ff,
-
-    /* gc reason */
-    GPR_FLAG_NEWOBJ             = 0x100,
-    GPR_FLAG_MALLOC             = 0x200,
-    GPR_FLAG_METHOD             = 0x400,
-    GPR_FLAG_CAPI               = 0x800,
-    GPR_FLAG_STRESS            = 0x1000,
-
-    /* others */
-    GPR_FLAG_IMMEDIATE_SWEEP   = 0x2000,
-    GPR_FLAG_HAVE_FINALIZE     = 0x4000,
-    GPR_FLAG_IMMEDIATE_MARK    = 0x8000,
-    GPR_FLAG_FULL_MARK        = 0x10000,
-    GPR_FLAG_COMPACT          = 0x20000,
-
-    GPR_DEFAULT_REASON =
-        (GPR_FLAG_FULL_MARK | GPR_FLAG_IMMEDIATE_MARK |
-         GPR_FLAG_IMMEDIATE_SWEEP | GPR_FLAG_CAPI),
-} gc_profile_record_flag;
-
-typedef struct gc_profile_record {
-    unsigned int flags;
-
-    double gc_time;
-    double gc_invoke_time;
-
-    size_t heap_total_objects;
-    size_t heap_use_size;
-    size_t heap_total_size;
-    size_t moved_objects;
-
-#if GC_PROFILE_MORE_DETAIL
-    double gc_mark_time;
-    double gc_sweep_time;
-
-    size_t heap_use_pages;
-    size_t heap_live_objects;
-    size_t heap_free_objects;
-
-    size_t allocate_increase;
-    size_t allocate_limit;
-
-    double prepare_time;
-    size_t removing_objects;
-    size_t empty_objects;
-#if GC_PROFILE_DETAIL_MEMORY
-    long maxrss;
-    long minflt;
-    long majflt;
-#endif
-#endif
-#if MALLOC_ALLOCATED_SIZE
-    size_t allocated_size;
-#endif
-
-#if RGENGC_PROFILE > 0
-    size_t old_objects;
-    size_t remembered_normal_objects;
-    size_t remembered_shady_objects;
-#endif
-} gc_profile_record;
-
-struct RMoved {
-    VALUE flags;
-    VALUE dummy;
-    VALUE destination;
-    shape_id_t original_shape_id;
-};
-
-#define RMOVED(obj) ((struct RMoved *)(obj))
-
-typedef struct RVALUE {
-    union {
-        struct {
-            VALUE flags;		/* always 0 for freed obj */
-            struct RVALUE *next;
-        } free;
-        struct RMoved  moved;
-        struct RBasic  basic;
-        struct RObject object;
-        struct RClass  klass;
-        struct RFloat  flonum;
-        struct RString string;
-        struct RArray  array;
-        struct RRegexp regexp;
-        struct RHash   hash;
-        struct RData   data;
-        struct RTypedData   typeddata;
-        struct RStruct rstruct;
-        struct RBignum bignum;
-        struct RFile   file;
-        struct RMatch  match;
-        struct RRational rational;
-        struct RComplex complex;
-        struct RSymbol symbol;
-        union {
-            rb_cref_t cref;
-            struct vm_svar svar;
-            struct vm_throw_data throw_data;
-            struct vm_ifunc ifunc;
-            struct MEMO memo;
-            struct rb_method_entry_struct ment;
-            const rb_iseq_t iseq;
-            rb_env_t env;
-            struct rb_imemo_tmpbuf_struct alloc;
-            rb_ast_t ast;
-        } imemo;
-        struct {
-            struct RBasic basic;
-            VALUE v1;
-            VALUE v2;
-            VALUE v3;
-        } values;
-    } as;
-} RVALUE;
-
-/* These members ae located at the end of the slot that the object is in. */
-#if RACTOR_CHECK_MODE || GC_DEBUG
-struct rvalue_overhead {
-# if RACTOR_CHECK_MODE
-    uint32_t _ractor_belonging_id;
-# endif
-# if GC_DEBUG
-    const char *file;
-    int line;
-# endif
-};
-
-// Make sure that RVALUE_OVERHEAD aligns to sizeof(VALUE)
-# define RVALUE_OVERHEAD (sizeof(struct { \
-    union { \
-        struct rvalue_overhead overhead; \
-        VALUE value; \
-    }; \
-}))
-# define GET_RVALUE_OVERHEAD(obj) ((struct rvalue_overhead *)((uintptr_t)obj + rb_gc_obj_slot_size(obj)))
-#else
-# define RVALUE_OVERHEAD 0
-#endif
-
-STATIC_ASSERT(sizeof_rvalue, sizeof(RVALUE) == (SIZEOF_VALUE * 5));
-STATIC_ASSERT(alignof_rvalue, RUBY_ALIGNOF(RVALUE) == SIZEOF_VALUE);
-
-typedef uintptr_t bits_t;
-enum {
-    BITS_SIZE = sizeof(bits_t),
-    BITS_BITLENGTH = ( BITS_SIZE * CHAR_BIT )
-};
-
-struct heap_page_header {
-    struct heap_page *page;
-};
-
-struct heap_page_body {
-    struct heap_page_header header;
-    /* char gap[];      */
-    /* RVALUE values[]; */
-};
-
-#define STACK_CHUNK_SIZE 500
-
-typedef struct stack_chunk {
-    VALUE data[STACK_CHUNK_SIZE];
-    struct stack_chunk *next;
-} stack_chunk_t;
-
-typedef struct mark_stack {
-    stack_chunk_t *chunk;
-    stack_chunk_t *cache;
-    int index;
-    int limit;
-    size_t cache_size;
-    size_t unused_cache_size;
-} mark_stack_t;
-
-#define SIZE_POOL_EDEN_HEAP(size_pool) (&(size_pool)->eden_heap)
-#define SIZE_POOL_TOMB_HEAP(size_pool) (&(size_pool)->tomb_heap)
-
-typedef int (*gc_compact_compare_func)(const void *l, const void *r, void *d);
-
-typedef struct rb_heap_struct {
-    struct heap_page *free_pages;
-    struct ccan_list_head pages;
-    struct heap_page *sweeping_page; /* iterator for .pages */
-    struct heap_page *compact_cursor;
-    uintptr_t compact_cursor_index;
-    struct heap_page *pooled_pages;
-    size_t total_pages;      /* total page count in a heap */
-    size_t total_slots;      /* total slot count (about total_pages * HEAP_PAGE_OBJ_LIMIT) */
-} rb_heap_t;
-
-typedef struct rb_size_pool_struct {
-    short slot_size;
-
-    size_t allocatable_pages;
-
-    /* Basic statistics */
-    size_t total_allocated_pages;
-    size_t total_freed_pages;
-    size_t force_major_gc_count;
-    size_t force_incremental_marking_finish_count;
-    size_t total_allocated_objects;
-    size_t total_freed_objects;
-
-    /* Sweeping statistics */
-    size_t freed_slots;
-    size_t empty_slots;
-
-    rb_heap_t eden_heap;
-    rb_heap_t tomb_heap;
-} rb_size_pool_t;
-
-enum gc_mode {
-    gc_mode_none,
-    gc_mode_marking,
-    gc_mode_sweeping,
-    gc_mode_compacting,
-};
-
-typedef struct rb_objspace {
-    struct {
-        size_t limit;
-        size_t increase;
-#if MALLOC_ALLOCATED_SIZE
-        size_t allocated_size;
-        size_t allocations;
-#endif
-
-    } malloc_params;
-
-    struct {
-        unsigned int mode : 2;
-        unsigned int immediate_sweep : 1;
-        unsigned int dont_gc : 1;
-        unsigned int dont_incremental : 1;
-        unsigned int during_gc : 1;
-        unsigned int during_compacting : 1;
-        unsigned int during_reference_updating : 1;
-        unsigned int gc_stressful: 1;
-        unsigned int has_newobj_hook: 1;
-        unsigned int during_minor_gc : 1;
-        unsigned int during_incremental_marking : 1;
-        unsigned int measure_gc : 1;
-    } flags;
-
-    rb_event_flag_t hook_events;
-    unsigned long long next_object_id;
-
-    rb_size_pool_t size_pools[SIZE_POOL_COUNT];
-
-    struct {
-        rb_atomic_t finalizing;
-    } atomic_flags;
-
-    mark_stack_t mark_stack;
-    size_t marked_slots;
-
-    struct {
-        struct heap_page **sorted;
-        size_t allocated_pages;
-        size_t allocatable_pages;
-        size_t sorted_length;
-        uintptr_t range[2];
-        size_t freeable_pages;
-
-        /* final */
-        size_t final_slots;
-        VALUE deferred_final;
-    } heap_pages;
-
-    st_table *finalizer_table;
-
-    struct {
-        int run;
-        unsigned int latest_gc_info;
-        gc_profile_record *records;
-        gc_profile_record *current_record;
-        size_t next_index;
-        size_t size;
-
-#if GC_PROFILE_MORE_DETAIL
-        double prepare_time;
-#endif
-        double invoke_time;
-
-        size_t minor_gc_count;
-        size_t major_gc_count;
-        size_t compact_count;
-        size_t read_barrier_faults;
-#if RGENGC_PROFILE > 0
-        size_t total_generated_normal_object_count;
-        size_t total_generated_shady_object_count;
-        size_t total_shade_operation_count;
-        size_t total_promoted_count;
-        size_t total_remembered_normal_object_count;
-        size_t total_remembered_shady_object_count;
-
-#if RGENGC_PROFILE >= 2
-        size_t generated_normal_object_count_types[RUBY_T_MASK];
-        size_t generated_shady_object_count_types[RUBY_T_MASK];
-        size_t shade_operation_count_types[RUBY_T_MASK];
-        size_t promoted_types[RUBY_T_MASK];
-        size_t remembered_normal_object_count_types[RUBY_T_MASK];
-        size_t remembered_shady_object_count_types[RUBY_T_MASK];
-#endif
-#endif /* RGENGC_PROFILE */
-
-        /* temporary profiling space */
-        double gc_sweep_start_time;
-        size_t total_allocated_objects_at_gc_start;
-        size_t heap_used_at_gc_start;
-
-        /* basic statistics */
-        size_t count;
-        uint64_t marking_time_ns;
-        struct timespec marking_start_time;
-        uint64_t sweeping_time_ns;
-        struct timespec sweeping_start_time;
-
-        /* Weak references */
-        size_t weak_references_count;
-        size_t retained_weak_references_count;
-    } profile;
-
-    VALUE gc_stress_mode;
-
-    struct {
-        VALUE parent_object;
-        int need_major_gc;
-        size_t last_major_gc;
-        size_t uncollectible_wb_unprotected_objects;
-        size_t uncollectible_wb_unprotected_objects_limit;
-        size_t old_objects;
-        size_t old_objects_limit;
-
-#if RGENGC_ESTIMATE_OLDMALLOC
-        size_t oldmalloc_increase;
-        size_t oldmalloc_increase_limit;
-#endif
-
-#if RGENGC_CHECK_MODE >= 2
-        struct st_table *allrefs_table;
-        size_t error_count;
-#endif
-    } rgengc;
-
-    struct {
-        size_t considered_count_table[T_MASK];
-        size_t moved_count_table[T_MASK];
-        size_t moved_up_count_table[T_MASK];
-        size_t moved_down_count_table[T_MASK];
-        size_t total_moved;
-
-        /* This function will be used, if set, to sort the heap prior to compaction */
-        gc_compact_compare_func compare_func;
-    } rcompactor;
-
-    struct {
-        size_t pooled_slots;
-        size_t step_slots;
-    } rincgc;
-
-    st_table *id_to_obj_tbl;
-    st_table *obj_to_id_tbl;
-
-#if GC_DEBUG_STRESS_TO_CLASS
-    VALUE stress_to_class;
-#endif
-
-    rb_darray(VALUE *) weak_references;
-    rb_postponed_job_handle_t finalize_deferred_pjob;
-
-#ifdef RUBY_ASAN_ENABLED
-    const rb_execution_context_t *marking_machine_context_ec;
-#endif
-
-} rb_objspace_t;
-
-
-#ifndef HEAP_PAGE_ALIGN_LOG
-/* default tiny heap size: 64KiB */
-#define HEAP_PAGE_ALIGN_LOG 16
-#endif
-
-#define BASE_SLOT_SIZE (sizeof(RVALUE) + RVALUE_OVERHEAD)
-
-#define CEILDIV(i, mod) roomof(i, mod)
-enum {
-    HEAP_PAGE_ALIGN = (1UL << HEAP_PAGE_ALIGN_LOG),
-    HEAP_PAGE_ALIGN_MASK = (~(~0UL << HEAP_PAGE_ALIGN_LOG)),
-    HEAP_PAGE_SIZE = HEAP_PAGE_ALIGN,
-    HEAP_PAGE_OBJ_LIMIT = (unsigned int)((HEAP_PAGE_SIZE - sizeof(struct heap_page_header)) / BASE_SLOT_SIZE),
-    HEAP_PAGE_BITMAP_LIMIT = CEILDIV(CEILDIV(HEAP_PAGE_SIZE, BASE_SLOT_SIZE), BITS_BITLENGTH),
-    HEAP_PAGE_BITMAP_SIZE = (BITS_SIZE * HEAP_PAGE_BITMAP_LIMIT),
-};
-#define HEAP_PAGE_ALIGN (1 << HEAP_PAGE_ALIGN_LOG)
-#define HEAP_PAGE_SIZE HEAP_PAGE_ALIGN
-
-#if !defined(INCREMENTAL_MARK_STEP_ALLOCATIONS)
-# define INCREMENTAL_MARK_STEP_ALLOCATIONS 500
-#endif
-
-#undef INIT_HEAP_PAGE_ALLOC_USE_MMAP
-/* Must define either HEAP_PAGE_ALLOC_USE_MMAP or
- * INIT_HEAP_PAGE_ALLOC_USE_MMAP. */
-
-#ifndef HAVE_MMAP
-/* We can't use mmap of course, if it is not available. */
-static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
-
-#elif defined(__wasm__)
-/* wasmtime does not have proper support for mmap.
- * See https://github.com/bytecodealliance/wasmtime/blob/main/docs/WASI-rationale.md#why-no-mmap-and-friends
- */
-static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
-
-#elif HAVE_CONST_PAGE_SIZE
-/* If we have the PAGE_SIZE and it is a constant, then we can directly use it. */
-static const bool HEAP_PAGE_ALLOC_USE_MMAP = (PAGE_SIZE <= HEAP_PAGE_SIZE);
-
-#elif defined(PAGE_MAX_SIZE) && (PAGE_MAX_SIZE <= HEAP_PAGE_SIZE)
-/* If we can use the maximum page size. */
-static const bool HEAP_PAGE_ALLOC_USE_MMAP = true;
-
-#elif defined(PAGE_SIZE)
-/* If the PAGE_SIZE macro can be used dynamically. */
-# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (PAGE_SIZE <= HEAP_PAGE_SIZE)
-
-#elif defined(HAVE_SYSCONF) && defined(_SC_PAGE_SIZE)
-/* If we can use sysconf to determine the page size. */
-# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (sysconf(_SC_PAGE_SIZE) <= HEAP_PAGE_SIZE)
-
-#else
-/* Otherwise we can't determine the system page size, so don't use mmap. */
-static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
-#endif
-
-#ifdef INIT_HEAP_PAGE_ALLOC_USE_MMAP
-/* We can determine the system page size at runtime. */
-# define HEAP_PAGE_ALLOC_USE_MMAP (heap_page_alloc_use_mmap != false)
-
-static bool heap_page_alloc_use_mmap;
-#endif
-
-#define RVALUE_AGE_BIT_COUNT 2
-#define RVALUE_AGE_BIT_MASK (((bits_t)1 << RVALUE_AGE_BIT_COUNT) - 1)
-
-struct heap_page {
-    short slot_size;
-    short total_slots;
-    short free_slots;
-    short final_slots;
-    short pinned_slots;
-    struct {
-        unsigned int before_sweep : 1;
-        unsigned int has_remembered_objects : 1;
-        unsigned int has_uncollectible_wb_unprotected_objects : 1;
-        unsigned int in_tomb : 1;
-    } flags;
-
-    rb_size_pool_t *size_pool;
-
-    struct heap_page *free_next;
-    uintptr_t start;
-    RVALUE *freelist;
-    struct ccan_list_node page_node;
-
-    bits_t wb_unprotected_bits[HEAP_PAGE_BITMAP_LIMIT];
-    /* the following three bitmaps are cleared at the beginning of full GC */
-    bits_t mark_bits[HEAP_PAGE_BITMAP_LIMIT];
-    bits_t uncollectible_bits[HEAP_PAGE_BITMAP_LIMIT];
-    bits_t marking_bits[HEAP_PAGE_BITMAP_LIMIT];
-
-    bits_t remembered_bits[HEAP_PAGE_BITMAP_LIMIT];
-
-    /* If set, the object is not movable */
-    bits_t pinned_bits[HEAP_PAGE_BITMAP_LIMIT];
-    bits_t age_bits[HEAP_PAGE_BITMAP_LIMIT * RVALUE_AGE_BIT_COUNT];
-};
-
-/*
- * When asan is enabled, this will prohibit writing to the freelist until it is unlocked
- */
-static void
-asan_lock_freelist(struct heap_page *page)
-{
-    asan_poison_memory_region(&page->freelist, sizeof(RVALUE*));
-}
-
-/*
- * When asan is enabled, this will enable the ability to write to the freelist
- */
-static void
-asan_unlock_freelist(struct heap_page *page)
-{
-    asan_unpoison_memory_region(&page->freelist, sizeof(RVALUE*), false);
-}
-
-#define GET_PAGE_BODY(x)   ((struct heap_page_body *)((bits_t)(x) & ~(HEAP_PAGE_ALIGN_MASK)))
-#define GET_PAGE_HEADER(x) (&GET_PAGE_BODY(x)->header)
-#define GET_HEAP_PAGE(x)   (GET_PAGE_HEADER(x)->page)
-
-#define NUM_IN_PAGE(p)   (((bits_t)(p) & HEAP_PAGE_ALIGN_MASK) / BASE_SLOT_SIZE)
-#define BITMAP_INDEX(p)  (NUM_IN_PAGE(p) / BITS_BITLENGTH )
-#define BITMAP_OFFSET(p) (NUM_IN_PAGE(p) & (BITS_BITLENGTH-1))
-#define BITMAP_BIT(p)    ((bits_t)1 << BITMAP_OFFSET(p))
-
-/* Bitmap Operations */
-#define MARKED_IN_BITMAP(bits, p)    ((bits)[BITMAP_INDEX(p)] & BITMAP_BIT(p))
-#define MARK_IN_BITMAP(bits, p)      ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] | BITMAP_BIT(p))
-#define CLEAR_IN_BITMAP(bits, p)     ((bits)[BITMAP_INDEX(p)] = (bits)[BITMAP_INDEX(p)] & ~BITMAP_BIT(p))
-
-/* getting bitmap */
-#define GET_HEAP_MARK_BITS(x)           (&GET_HEAP_PAGE(x)->mark_bits[0])
-#define GET_HEAP_PINNED_BITS(x)         (&GET_HEAP_PAGE(x)->pinned_bits[0])
-#define GET_HEAP_UNCOLLECTIBLE_BITS(x)  (&GET_HEAP_PAGE(x)->uncollectible_bits[0])
-#define GET_HEAP_WB_UNPROTECTED_BITS(x) (&GET_HEAP_PAGE(x)->wb_unprotected_bits[0])
-#define GET_HEAP_MARKING_BITS(x)        (&GET_HEAP_PAGE(x)->marking_bits[0])
-
-#define GC_SWEEP_PAGES_FREEABLE_PER_STEP 3
-
-#define RVALUE_AGE_BITMAP_INDEX(n)  (NUM_IN_PAGE(n) / (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT))
-#define RVALUE_AGE_BITMAP_OFFSET(n) ((NUM_IN_PAGE(n) % (BITS_BITLENGTH / RVALUE_AGE_BIT_COUNT)) * RVALUE_AGE_BIT_COUNT)
-
-#define RVALUE_OLD_AGE   3
-
-static int
-RVALUE_AGE_GET(VALUE obj)
-{
-    bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
-    return (int)(age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] >> RVALUE_AGE_BITMAP_OFFSET(obj)) & RVALUE_AGE_BIT_MASK;
-}
-
-static void
-RVALUE_AGE_SET(VALUE obj, int age)
-{
-    RUBY_ASSERT(age <= RVALUE_OLD_AGE);
-    bits_t *age_bits = GET_HEAP_PAGE(obj)->age_bits;
-    // clear the bits
-    age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] &= ~(RVALUE_AGE_BIT_MASK << (RVALUE_AGE_BITMAP_OFFSET(obj)));
-    // shift the correct value in
-    age_bits[RVALUE_AGE_BITMAP_INDEX(obj)] |= ((bits_t)age << RVALUE_AGE_BITMAP_OFFSET(obj));
-    if (age == RVALUE_OLD_AGE) {
-        RB_FL_SET_RAW(obj, RUBY_FL_PROMOTED);
-    }
-    else {
-        RB_FL_UNSET_RAW(obj, RUBY_FL_PROMOTED);
-    }
-}
-
-/* Aliases */
-#define rb_objspace (*rb_objspace_of(GET_VM()))
-#define rb_objspace_of(vm) ((vm)->objspace)
-#define unless_objspace(objspace) \
-    rb_objspace_t *objspace; \
-    rb_vm_t *unless_objspace_vm = GET_VM(); \
-    if (unless_objspace_vm) objspace = unless_objspace_vm->objspace; \
-    else /* return; or objspace will be warned uninitialized */
-
-#define malloc_limit		objspace->malloc_params.limit
-#define malloc_increase 	objspace->malloc_params.increase
-#define malloc_allocated_size 	objspace->malloc_params.allocated_size
-#define heap_pages_sorted       objspace->heap_pages.sorted
-#define heap_allocated_pages    objspace->heap_pages.allocated_pages
-#define heap_pages_sorted_length objspace->heap_pages.sorted_length
-#define heap_pages_lomem	objspace->heap_pages.range[0]
-#define heap_pages_himem	objspace->heap_pages.range[1]
-#define heap_pages_freeable_pages	objspace->heap_pages.freeable_pages
-#define heap_pages_final_slots		objspace->heap_pages.final_slots
-#define heap_pages_deferred_final	objspace->heap_pages.deferred_final
-#define size_pools              objspace->size_pools
-#define during_gc		objspace->flags.during_gc
-#define finalizing		objspace->atomic_flags.finalizing
-#define finalizer_table 	objspace->finalizer_table
-#define ruby_gc_stressful	objspace->flags.gc_stressful
-#define ruby_gc_stress_mode     objspace->gc_stress_mode
-#if GC_DEBUG_STRESS_TO_CLASS
-#define stress_to_class         objspace->stress_to_class
-#define set_stress_to_class(c)  (stress_to_class = (c))
-#else
-#define stress_to_class         (objspace, 0)
-#define set_stress_to_class(c)  (objspace, (c))
-#endif
-
-#if 0
-#define dont_gc_on()          (fprintf(stderr, "dont_gc_on@%s:%d\n",      __FILE__, __LINE__), objspace->flags.dont_gc = 1)
-#define dont_gc_off()         (fprintf(stderr, "dont_gc_off@%s:%d\n",     __FILE__, __LINE__), objspace->flags.dont_gc = 0)
-#define dont_gc_set(b)        (fprintf(stderr, "dont_gc_set(%d)@%s:%d\n", __FILE__, __LINE__), (int)b), objspace->flags.dont_gc = (b))
-#define dont_gc_val()         (objspace->flags.dont_gc)
-#else
-#define dont_gc_on()          (objspace->flags.dont_gc = 1)
-#define dont_gc_off()         (objspace->flags.dont_gc = 0)
-#define dont_gc_set(b)        (((int)b), objspace->flags.dont_gc = (b))
-#define dont_gc_val()         (objspace->flags.dont_gc)
-#endif
-
-static inline enum gc_mode
-gc_mode_verify(enum gc_mode mode)
-{
-#if RGENGC_CHECK_MODE > 0
-    switch (mode) {
-      case gc_mode_none:
-      case gc_mode_marking:
-      case gc_mode_sweeping:
-      case gc_mode_compacting:
-        break;
-      default:
-        rb_bug("gc_mode_verify: unreachable (%d)", (int)mode);
-    }
-#endif
-    return mode;
-}
-
-static inline bool
-has_sweeping_pages(rb_objspace_t *objspace)
-{
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        if (SIZE_POOL_EDEN_HEAP(&size_pools[i])->sweeping_page) {
-            return TRUE;
-        }
-    }
-    return FALSE;
-}
-
-static inline size_t
-heap_eden_total_pages(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        count += SIZE_POOL_EDEN_HEAP(&size_pools[i])->total_pages;
-    }
-    return count;
-}
-
-static inline size_t
-heap_eden_total_slots(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        count += SIZE_POOL_EDEN_HEAP(&size_pools[i])->total_slots;
-    }
-    return count;
-}
-
-static inline size_t
-heap_tomb_total_pages(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        count += SIZE_POOL_TOMB_HEAP(&size_pools[i])->total_pages;
-    }
-    return count;
-}
-
-static inline size_t
-heap_allocatable_pages(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        count += size_pools[i].allocatable_pages;
-    }
-    return count;
-}
-
-static inline size_t
-heap_allocatable_slots(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        int slot_size_multiple = size_pool->slot_size / BASE_SLOT_SIZE;
-        count += size_pool->allocatable_pages * HEAP_PAGE_OBJ_LIMIT / slot_size_multiple;
-    }
-    return count;
-}
-
-static inline size_t
-total_allocated_pages(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        count += size_pool->total_allocated_pages;
-    }
-    return count;
-}
-
-static inline size_t
-total_freed_pages(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        count += size_pool->total_freed_pages;
-    }
-    return count;
-}
-
-static inline size_t
-total_allocated_objects(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        count += size_pool->total_allocated_objects;
-    }
-    return count;
-}
-
-static inline size_t
-total_freed_objects(rb_objspace_t *objspace)
-{
-    size_t count = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        count += size_pool->total_freed_objects;
-    }
-    return count;
-}
-
-#define gc_mode(objspace)                gc_mode_verify((enum gc_mode)(objspace)->flags.mode)
-#define gc_mode_set(objspace, m)         ((objspace)->flags.mode = (unsigned int)gc_mode_verify(m))
-#define gc_needs_major_flags             objspace->rgengc.need_major_gc
-
-#define is_marking(objspace)             (gc_mode(objspace) == gc_mode_marking)
-#define is_sweeping(objspace)            (gc_mode(objspace) == gc_mode_sweeping)
-#define is_full_marking(objspace)        ((objspace)->flags.during_minor_gc == FALSE)
-#define is_incremental_marking(objspace) ((objspace)->flags.during_incremental_marking != FALSE)
-#define will_be_incremental_marking(objspace) ((objspace)->rgengc.need_major_gc != GPR_FLAG_NONE)
-#define GC_INCREMENTAL_SWEEP_SLOT_COUNT 2048
-#define GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT 1024
-#define is_lazy_sweeping(objspace)           (GC_ENABLE_LAZY_SWEEP && has_sweeping_pages(objspace))
-
-#if SIZEOF_LONG == SIZEOF_VOIDP
-# define obj_id_to_ref(objid) ((objid) ^ FIXNUM_FLAG) /* unset FIXNUM_FLAG */
-#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
-# define obj_id_to_ref(objid) (FIXNUM_P(objid) ? \
-   ((objid) ^ FIXNUM_FLAG) : (NUM2PTR(objid) << 1))
-#else
-# error not supported
-#endif
-
-#define RANY(o) ((RVALUE*)(o))
-
-struct RZombie {
-    struct RBasic basic;
-    VALUE next;
-    void (*dfree)(void *);
-    void *data;
-};
-
-#define RZOMBIE(o) ((struct RZombie *)(o))
-
-#define nomem_error GET_VM()->special_exceptions[ruby_error_nomemory]
-
-#if RUBY_MARK_FREE_DEBUG
-int ruby_gc_debug_indent = 0;
-#endif
-VALUE rb_mGC;
-int ruby_disable_gc = 0;
-int ruby_enable_autocompact = 0;
-#if RGENGC_CHECK_MODE
-gc_compact_compare_func ruby_autocompact_compare_func;
-#endif
-
-void rb_vm_update_references(void *ptr);
-
-void rb_gcdebug_print_obj_condition(VALUE obj);
-
-NORETURN(static void *gc_vraise(void *ptr));
-NORETURN(static void gc_raise(VALUE exc, const char *fmt, ...));
-NORETURN(static void negative_size_allocation_error(const char *));
-
-static void init_mark_stack(mark_stack_t *stack);
-static int garbage_collect(rb_objspace_t *, unsigned int reason);
-
-static int  gc_start(rb_objspace_t *objspace, unsigned int reason);
-static void gc_rest(rb_objspace_t *objspace);
-
-enum gc_enter_event {
-    gc_enter_event_start,
-    gc_enter_event_continue,
-    gc_enter_event_rest,
-    gc_enter_event_finalizer,
-    gc_enter_event_rb_memerror,
-};
-
-static inline void gc_enter(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev);
-static inline void gc_exit(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev);
-static void gc_marking_enter(rb_objspace_t *objspace);
-static void gc_marking_exit(rb_objspace_t *objspace);
-static void gc_sweeping_enter(rb_objspace_t *objspace);
-static void gc_sweeping_exit(rb_objspace_t *objspace);
-static bool gc_marks_continue(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap);
-
-static void gc_sweep(rb_objspace_t *objspace);
-static void gc_sweep_finish_size_pool(rb_objspace_t *objspace, rb_size_pool_t *size_pool);
-static void gc_sweep_continue(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap);
-
-static inline void gc_mark(rb_objspace_t *objspace, VALUE ptr);
-static inline void gc_pin(rb_objspace_t *objspace, VALUE ptr);
-static inline void gc_mark_and_pin(rb_objspace_t *objspace, VALUE ptr);
-NO_SANITIZE("memory", static void gc_mark_maybe(rb_objspace_t *objspace, VALUE ptr));
-
-static int gc_mark_stacked_objects_incremental(rb_objspace_t *, size_t count);
-NO_SANITIZE("memory", static inline int is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr));
-
-static size_t obj_memsize_of(VALUE obj, int use_all_types);
-static void gc_verify_internal_consistency(rb_objspace_t *objspace);
-
-static VALUE gc_disable_no_rest(rb_objspace_t *);
-
-static double getrusage_time(void);
-static inline void gc_prof_setup_new_record(rb_objspace_t *objspace, unsigned int reason);
-static inline void gc_prof_timer_start(rb_objspace_t *);
-static inline void gc_prof_timer_stop(rb_objspace_t *);
-static inline void gc_prof_mark_timer_start(rb_objspace_t *);
-static inline void gc_prof_mark_timer_stop(rb_objspace_t *);
-static inline void gc_prof_sweep_timer_start(rb_objspace_t *);
-static inline void gc_prof_sweep_timer_stop(rb_objspace_t *);
-static inline void gc_prof_set_malloc_info(rb_objspace_t *);
-static inline void gc_prof_set_heap_info(rb_objspace_t *);
-
-#define TYPED_UPDATE_IF_MOVED(_objspace, _type, _thing) do { \
-    if (gc_object_moved_p((_objspace), (VALUE)(_thing))) {    \
-        *(_type *)&(_thing) = (_type)RMOVED(_thing)->destination; \
-    } \
-} while (0)
-
-#define UPDATE_IF_MOVED(_objspace, _thing) TYPED_UPDATE_IF_MOVED(_objspace, VALUE, _thing)
-
-#define gc_prof_record(objspace) (objspace)->profile.current_record
-#define gc_prof_enabled(objspace) ((objspace)->profile.run && (objspace)->profile.current_record)
-
-#ifdef HAVE_VA_ARGS_MACRO
-# define gc_report(level, objspace, ...) \
-    if (!RGENGC_DEBUG_ENABLED(level)) {} else gc_report_body(level, objspace, __VA_ARGS__)
-#else
-# define gc_report if (!RGENGC_DEBUG_ENABLED(0)) {} else gc_report_body
-#endif
-PRINTF_ARGS(static void gc_report_body(int level, rb_objspace_t *objspace, const char *fmt, ...), 3, 4);
-static const char *obj_info(VALUE obj);
-static const char *obj_info_basic(VALUE obj);
 static const char *obj_type_name(VALUE obj);
-
-static void gc_finalize_deferred(void *dmy);
-
-#if USE_TICK_T
-/* the following code is only for internal tuning. */
-
-/* Source code to use RDTSC is quoted and modified from
- * https://www.mcs.anl.gov/~kazutomo/rdtsc.html
- * written by Kazutomo Yoshii <kazutomo@mcs.anl.gov>
- */
-
-#if defined(__GNUC__) && defined(__i386__)
-typedef unsigned long long tick_t;
-#define PRItick "llu"
-static inline tick_t
-tick(void)
-{
-    unsigned long long int x;
-    __asm__ __volatile__ ("rdtsc" : "=A" (x));
-    return x;
-}
-
-#elif defined(__GNUC__) && defined(__x86_64__)
-typedef unsigned long long tick_t;
-#define PRItick "llu"
-
-static __inline__ tick_t
-tick(void)
-{
-    unsigned long hi, lo;
-    __asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
-    return ((unsigned long long)lo)|( ((unsigned long long)hi)<<32);
-}
-
-#elif defined(__powerpc64__) && (GCC_VERSION_SINCE(4,8,0) || defined(__clang__))
-typedef unsigned long long tick_t;
-#define PRItick "llu"
-
-static __inline__ tick_t
-tick(void)
-{
-    unsigned long long val = __builtin_ppc_get_timebase();
-    return val;
-}
-
-/* Implementation for macOS PPC by @nobu
- * See: https://github.com/ruby/ruby/pull/5975#discussion_r890045558
- */
-#elif defined(__POWERPC__) && defined(__APPLE__)
-typedef unsigned long long tick_t;
-#define PRItick "llu"
-
-static __inline__ tick_t
-tick(void)
-{
-    unsigned long int upper, lower, tmp;
-    # define mftbu(r) __asm__ volatile("mftbu   %0" : "=r"(r))
-    # define mftb(r)  __asm__ volatile("mftb    %0" : "=r"(r))
-        do {
-            mftbu(upper);
-            mftb(lower);
-            mftbu(tmp);
-        } while (tmp != upper);
-    return ((tick_t)upper << 32) | lower;
-}
-
-#elif defined(__aarch64__) &&  defined(__GNUC__)
-typedef unsigned long tick_t;
-#define PRItick "lu"
-
-static __inline__ tick_t
-tick(void)
-{
-    unsigned long val;
-    __asm__ __volatile__ ("mrs %0, cntvct_el0" : "=r" (val));
-    return val;
-}
-
-
-#elif defined(_WIN32) && defined(_MSC_VER)
-#include <intrin.h>
-typedef unsigned __int64 tick_t;
-#define PRItick "llu"
-
-static inline tick_t
-tick(void)
-{
-    return __rdtsc();
-}
-
-#else /* use clock */
-typedef clock_t tick_t;
-#define PRItick "llu"
-
-static inline tick_t
-tick(void)
-{
-    return clock();
-}
-#endif /* TSC */
-#else /* USE_TICK_T */
-#define MEASURE_LINE(expr) expr
-#endif /* USE_TICK_T */
-
-#define asan_unpoisoning_object(obj) \
-    for (void *poisoned = asan_unpoison_object_temporary(obj), \
-              *unpoisoning = &poisoned; /* flag to loop just once */ \
-         unpoisoning; \
-         unpoisoning = asan_poison_object_restore(obj, poisoned))
-
-#define FL_CHECK2(name, x, pred) \
-    ((RGENGC_CHECK_MODE && SPECIAL_CONST_P(x)) ? \
-     (rb_bug(name": SPECIAL_CONST (%p)", (void *)(x)), 0) : (pred))
-#define FL_TEST2(x,f)  FL_CHECK2("FL_TEST2",  x, FL_TEST_RAW((x),(f)) != 0)
-#define FL_SET2(x,f)   FL_CHECK2("FL_SET2",   x, RBASIC(x)->flags |= (f))
-#define FL_UNSET2(x,f) FL_CHECK2("FL_UNSET2", x, RBASIC(x)->flags &= ~(f))
-
-#define RVALUE_MARK_BITMAP(obj)           MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), (obj))
-#define RVALUE_PIN_BITMAP(obj)            MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), (obj))
-#define RVALUE_PAGE_MARKED(page, obj)     MARKED_IN_BITMAP((page)->mark_bits, (obj))
-
-#define RVALUE_WB_UNPROTECTED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), (obj))
-#define RVALUE_UNCOLLECTIBLE_BITMAP(obj)  MARKED_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), (obj))
-#define RVALUE_MARKING_BITMAP(obj)        MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), (obj))
-
-#define RVALUE_PAGE_WB_UNPROTECTED(page, obj) MARKED_IN_BITMAP((page)->wb_unprotected_bits, (obj))
-#define RVALUE_PAGE_UNCOLLECTIBLE(page, obj)  MARKED_IN_BITMAP((page)->uncollectible_bits, (obj))
-#define RVALUE_PAGE_MARKING(page, obj)        MARKED_IN_BITMAP((page)->marking_bits, (obj))
-
-static int rgengc_remember(rb_objspace_t *objspace, VALUE obj);
-static void rgengc_mark_and_rememberset_clear(rb_objspace_t *objspace, rb_heap_t *heap);
-static void rgengc_rememberset_mark(rb_objspace_t *objspace, rb_heap_t *heap);
-
-static int
-check_rvalue_consistency_force(const VALUE obj, int terminate)
-{
-    int err = 0;
-    rb_objspace_t *objspace = &rb_objspace;
-
-    RB_VM_LOCK_ENTER_NO_BARRIER();
-    {
-        if (SPECIAL_CONST_P(obj)) {
-            fprintf(stderr, "check_rvalue_consistency: %p is a special const.\n", (void *)obj);
-            err++;
-        }
-        else if (!is_pointer_to_heap(objspace, (void *)obj)) {
-            /* check if it is in tomb_pages */
-            struct heap_page *page = NULL;
-            for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-                rb_size_pool_t *size_pool = &size_pools[i];
-                ccan_list_for_each(&size_pool->tomb_heap.pages, page, page_node) {
-                    if (page->start <= (uintptr_t)obj &&
-                            (uintptr_t)obj < (page->start + (page->total_slots * size_pool->slot_size))) {
-                        fprintf(stderr, "check_rvalue_consistency: %p is in a tomb_heap (%p).\n",
-                                (void *)obj, (void *)page);
-                        err++;
-                        goto skip;
-                    }
+static st_table *id2ref_tbl;
+#include "gc/default/default.c"
+
+#if USE_MODULAR_GC && !defined(HAVE_DLOPEN)
+# error "Modular GC requires dlopen"
+#elif USE_MODULAR_GC
+#include <dlfcn.h>
+
+typedef struct gc_function_map {
+    // Bootup
+    void *(*objspace_alloc)(void);
+    void (*objspace_init)(void *objspace_ptr);
+    void *(*ractor_cache_alloc)(void *objspace_ptr, void *ractor);
+    void (*set_params)(void *objspace_ptr);
+    void (*init)(void);
+    size_t *(*heap_sizes)(void *objspace_ptr);
+    // Shutdown
+    void (*shutdown_free_objects)(void *objspace_ptr);
+    void (*objspace_free)(void *objspace_ptr);
+    void (*ractor_cache_free)(void *objspace_ptr, void *cache);
+    // GC
+    void (*start)(void *objspace_ptr, bool full_mark, bool immediate_mark, bool immediate_sweep, bool compact);
+    bool (*during_gc_p)(void *objspace_ptr);
+    void (*prepare_heap)(void *objspace_ptr);
+    void (*gc_enable)(void *objspace_ptr);
+    void (*gc_disable)(void *objspace_ptr, bool finish_current_gc);
+    bool (*gc_enabled_p)(void *objspace_ptr);
+    VALUE (*config_get)(void *objpace_ptr);
+    void (*config_set)(void *objspace_ptr, VALUE hash);
+    void (*stress_set)(void *objspace_ptr, VALUE flag);
+    VALUE (*stress_get)(void *objspace_ptr);
+    struct rb_gc_vm_context *(*get_vm_context)(void *objspace_ptr);
+    // Object allocation
+    VALUE (*new_obj)(void *objspace_ptr, void *cache_ptr, VALUE klass, VALUE flags, bool wb_protected, size_t alloc_size);
+    size_t (*obj_slot_size)(VALUE obj);
+    size_t (*heap_id_for_size)(void *objspace_ptr, size_t size);
+    bool (*size_allocatable_p)(size_t size);
+    // Malloc
+    void *(*malloc)(void *objspace_ptr, size_t size, bool gc_allowed);
+    void *(*calloc)(void *objspace_ptr, size_t size, bool gc_allowed);
+    void *(*realloc)(void *objspace_ptr, void *ptr, size_t new_size, size_t old_size, bool gc_allowed);
+    void (*free)(void *objspace_ptr, void *ptr, size_t old_size);
+    void (*adjust_memory_usage)(void *objspace_ptr, ssize_t diff);
+    // Marking
+    void (*mark)(void *objspace_ptr, VALUE obj);
+    void (*mark_and_move)(void *objspace_ptr, VALUE *ptr);
+    void (*mark_and_pin)(void *objspace_ptr, VALUE obj);
+    void (*mark_maybe)(void *objspace_ptr, VALUE obj);
+    // Weak references
+    void (*declare_weak_references)(void *objspace_ptr, VALUE obj);
+    bool (*handle_weak_references_alive_p)(void *objspace_ptr, VALUE obj);
+    // Compaction
+    void (*register_pinning_obj)(void *objspace_ptr, VALUE obj);
+    bool (*object_moved_p)(void *objspace_ptr, VALUE obj);
+    VALUE (*location)(void *objspace_ptr, VALUE value);
+    // Write barriers
+    void (*writebarrier)(void *objspace_ptr, VALUE a, VALUE b);
+    void (*writebarrier_unprotect)(void *objspace_ptr, VALUE obj);
+    void (*writebarrier_remember)(void *objspace_ptr, VALUE obj);
+    // Heap walking
+    void (*each_objects)(void *objspace_ptr, int (*callback)(void *, void *, size_t, void *), void *data);
+    void (*each_object)(void *objspace_ptr, void (*func)(VALUE obj, void *data), void *data);
+    // Finalizers
+    void (*make_zombie)(void *objspace_ptr, VALUE obj, void (*dfree)(void *), void *data);
+    VALUE (*define_finalizer)(void *objspace_ptr, VALUE obj, VALUE block);
+    void (*undefine_finalizer)(void *objspace_ptr, VALUE obj);
+    void (*copy_finalizer)(void *objspace_ptr, VALUE dest, VALUE obj);
+    void (*shutdown_call_finalizer)(void *objspace_ptr);
+    // Forking
+    void (*before_fork)(void *objspace_ptr);
+    void (*after_fork)(void *objspace_ptr, rb_pid_t pid);
+    // Statistics
+    void (*set_measure_total_time)(void *objspace_ptr, VALUE flag);
+    bool (*get_measure_total_time)(void *objspace_ptr);
+    unsigned long long (*get_total_time)(void *objspace_ptr);
+    size_t (*gc_count)(void *objspace_ptr);
+    VALUE (*latest_gc_info)(void *objspace_ptr, VALUE key);
+    VALUE (*stat)(void *objspace_ptr, VALUE hash_or_sym);
+    VALUE (*stat_heap)(void *objspace_ptr, VALUE heap_name, VALUE hash_or_sym);
+    const char *(*active_gc_name)(void);
+    // Miscellaneous
+    struct rb_gc_object_metadata_entry *(*object_metadata)(void *objspace_ptr, VALUE obj);
+    bool (*pointer_to_heap_p)(void *objspace_ptr, const void *ptr);
+    bool (*garbage_object_p)(void *objspace_ptr, VALUE obj);
+    void (*set_event_hook)(void *objspace_ptr, const rb_event_flag_t event);
+    void (*copy_attributes)(void *objspace_ptr, VALUE dest, VALUE obj);
+
+    bool modular_gc_loaded_p;
+} rb_gc_function_map_t;
+
+static rb_gc_function_map_t rb_gc_functions;
+
+# define RUBY_GC_LIBRARY "RUBY_GC_LIBRARY"
+# define MODULAR_GC_DIR STRINGIZE(modular_gc_dir)
+
+static void
+ruby_modular_gc_init(void)
+{
+    // Assert that the directory path ends with a /
+    RUBY_ASSERT_ALWAYS(MODULAR_GC_DIR[sizeof(MODULAR_GC_DIR) - 2] == '/');
+
+    const char *gc_so_file = getenv(RUBY_GC_LIBRARY);
+
+    rb_gc_function_map_t gc_functions = { 0 };
+
+    char *gc_so_path = NULL;
+    void *handle = NULL;
+    if (gc_so_file) {
+        /* Check to make sure that gc_so_file matches /[\w-_]+/ so that it does
+         * not load a shared object outside of the directory. */
+        for (size_t i = 0; i < strlen(gc_so_file); i++) {
+            char c = gc_so_file[i];
+            if (isalnum(c)) continue;
+            switch (c) {
+              case '-':
+              case '_':
+                break;
+              default:
+                fprintf(stderr, "Only alphanumeric, dash, and underscore is allowed in "RUBY_GC_LIBRARY"\n");
+                exit(EXIT_FAILURE);
+            }
+        }
+
+        size_t gc_so_path_size = strlen(MODULAR_GC_DIR "librubygc." DLEXT) + strlen(gc_so_file) + 1;
+#ifdef LOAD_RELATIVE
+        Dl_info dli;
+        size_t prefix_len = 0;
+        if (dladdr((void *)(uintptr_t)ruby_modular_gc_init, &dli)) {
+            const char *base = strrchr(dli.dli_fname, '/');
+            if (base) {
+                size_t tail = 0;
+# define end_with_p(lit) \
+                (prefix_len >= (tail = rb_strlen_lit(lit)) && \
+                 memcmp(base - tail, lit, tail) == 0)
+
+                prefix_len = base - dli.dli_fname;
+                if (end_with_p("/bin") || end_with_p("/lib")) {
+                    prefix_len -= tail;
                 }
+                prefix_len += MODULAR_GC_DIR[0] != '/';
+                gc_so_path_size += prefix_len;
             }
-            bp();
-            fprintf(stderr, "check_rvalue_consistency: %p is not a Ruby object.\n", (void *)obj);
-            err++;
-          skip:
-            ;
         }
-        else {
-            const int wb_unprotected_bit = RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
-            const int uncollectible_bit = RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
-            const int mark_bit = RVALUE_MARK_BITMAP(obj) != 0;
-            const int marking_bit = RVALUE_MARKING_BITMAP(obj) != 0;
-            const int remembered_bit = MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
-            const int age = RVALUE_AGE_GET((VALUE)obj);
-
-            if (GET_HEAP_PAGE(obj)->flags.in_tomb) {
-                fprintf(stderr, "check_rvalue_consistency: %s is in tomb page.\n", obj_info(obj));
-                err++;
-            }
-            if (BUILTIN_TYPE(obj) == T_NONE) {
-                fprintf(stderr, "check_rvalue_consistency: %s is T_NONE.\n", obj_info(obj));
-                err++;
-            }
-            if (BUILTIN_TYPE(obj) == T_ZOMBIE) {
-                fprintf(stderr, "check_rvalue_consistency: %s is T_ZOMBIE.\n", obj_info(obj));
-                err++;
-            }
-
-            obj_memsize_of((VALUE)obj, FALSE);
-
-            /* check generation
-             *
-             * OLD == age == 3 && old-bitmap && mark-bit (except incremental marking)
-             */
-            if (age > 0 && wb_unprotected_bit) {
-                fprintf(stderr, "check_rvalue_consistency: %s is not WB protected, but age is %d > 0.\n", obj_info(obj), age);
-                err++;
-            }
-
-            if (!is_marking(objspace) && uncollectible_bit && !mark_bit) {
-                fprintf(stderr, "check_rvalue_consistency: %s is uncollectible, but is not marked while !gc.\n", obj_info(obj));
-                err++;
-            }
-
-            if (!is_full_marking(objspace)) {
-                if (uncollectible_bit && age != RVALUE_OLD_AGE && !wb_unprotected_bit) {
-                    fprintf(stderr, "check_rvalue_consistency: %s is uncollectible, but not old (age: %d) and not WB unprotected.\n",
-                            obj_info(obj), age);
-                    err++;
-                }
-                if (remembered_bit && age != RVALUE_OLD_AGE) {
-                    fprintf(stderr, "check_rvalue_consistency: %s is remembered, but not old (age: %d).\n",
-                            obj_info(obj), age);
-                    err++;
-                }
-            }
-
-            /*
-             * check coloring
-             *
-             *               marking:false marking:true
-             * marked:false  white         *invalid*
-             * marked:true   black         grey
-             */
-            if (is_incremental_marking(objspace) && marking_bit) {
-                if (!is_marking(objspace) && !mark_bit) {
-                    fprintf(stderr, "check_rvalue_consistency: %s is marking, but not marked.\n", obj_info(obj));
-                    err++;
-                }
+#endif
+        gc_so_path = alloca(gc_so_path_size);
+        {
+            size_t gc_so_path_idx = 0;
+#define GC_SO_PATH_APPEND(str) do { \
+    gc_so_path_idx += strlcpy(gc_so_path + gc_so_path_idx, str, gc_so_path_size - gc_so_path_idx); \
+} while (0)
+#ifdef LOAD_RELATIVE
+            if (prefix_len > 0) {
+                memcpy(gc_so_path, dli.dli_fname, prefix_len);
+                gc_so_path_idx = prefix_len;
             }
-        }
-    }
-    RB_VM_LOCK_LEAVE_NO_BARRIER();
-
-    if (err > 0 && terminate) {
-        rb_bug("check_rvalue_consistency_force: there is %d errors.", err);
-    }
-    return err;
-}
-
-#if RGENGC_CHECK_MODE == 0
-static inline VALUE
-check_rvalue_consistency(const VALUE obj)
-{
-    return obj;
-}
-#else
-static VALUE
-check_rvalue_consistency(const VALUE obj)
-{
-    check_rvalue_consistency_force(obj, TRUE);
-    return obj;
-}
 #endif
-
-static inline int
-gc_object_moved_p(rb_objspace_t * objspace, VALUE obj)
-{
-    if (RB_SPECIAL_CONST_P(obj)) {
-        return FALSE;
-    }
-    else {
-        void *poisoned = asan_unpoison_object_temporary(obj);
-
-        int ret =  BUILTIN_TYPE(obj) == T_MOVED;
-        /* Re-poison slot if it's not the one we want */
-        if (poisoned) {
-            GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
-            asan_poison_object(obj);
+            GC_SO_PATH_APPEND(MODULAR_GC_DIR "librubygc.");
+            GC_SO_PATH_APPEND(gc_so_file);
+            GC_SO_PATH_APPEND(DLEXT);
+            GC_ASSERT(gc_so_path_idx == gc_so_path_size - 1);
+#undef GC_SO_PATH_APPEND
         }
-        return ret;
-    }
-}
-
-static inline int
-RVALUE_MARKED(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return RVALUE_MARK_BITMAP(obj) != 0;
-}
-
-static inline int
-RVALUE_PINNED(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return RVALUE_PIN_BITMAP(obj) != 0;
-}
-
-static inline int
-RVALUE_WB_UNPROTECTED(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
-}
-
-static inline int
-RVALUE_MARKING(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return RVALUE_MARKING_BITMAP(obj) != 0;
-}
-
-static inline int
-RVALUE_REMEMBERED(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
-}
-
-static inline int
-RVALUE_UNCOLLECTIBLE(VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    return RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
-}
-
-static inline int
-RVALUE_OLD_P(VALUE obj)
-{
-    GC_ASSERT(!RB_SPECIAL_CONST_P(obj));
-    check_rvalue_consistency(obj);
-    // Because this will only ever be called on GC controlled objects,
-    // we can use the faster _RAW function here
-    return RB_OBJ_PROMOTED_RAW(obj);
-}
-
-static inline void
-RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
-{
-    MARK_IN_BITMAP(&page->uncollectible_bits[0], obj);
-    objspace->rgengc.old_objects++;
-
-#if RGENGC_PROFILE >= 2
-    objspace->profile.total_promoted_count++;
-    objspace->profile.promoted_types[BUILTIN_TYPE(obj)]++;
-#endif
-}
-
-static inline void
-RVALUE_OLD_UNCOLLECTIBLE_SET(rb_objspace_t *objspace, VALUE obj)
-{
-    RB_DEBUG_COUNTER_INC(obj_promote);
-    RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(objspace, GET_HEAP_PAGE(obj), obj);
-}
-
-/* set age to age+1 */
-static inline void
-RVALUE_AGE_INC(rb_objspace_t *objspace, VALUE obj)
-{
-    int age = RVALUE_AGE_GET((VALUE)obj);
-
-    if (RGENGC_CHECK_MODE && age == RVALUE_OLD_AGE) {
-        rb_bug("RVALUE_AGE_INC: can not increment age of OLD object %s.", obj_info(obj));
-    }
-
-    age++;
-    RVALUE_AGE_SET(obj, age);
-
-    if (age == RVALUE_OLD_AGE) {
-        RVALUE_OLD_UNCOLLECTIBLE_SET(objspace, obj);
-    }
-
-    check_rvalue_consistency(obj);
-}
-
-static inline void
-RVALUE_AGE_SET_CANDIDATE(rb_objspace_t *objspace, VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    GC_ASSERT(!RVALUE_OLD_P(obj));
-    RVALUE_AGE_SET(obj, RVALUE_OLD_AGE - 1);
-    check_rvalue_consistency(obj);
-}
-
-static inline void
-RVALUE_AGE_RESET(VALUE obj)
-{
-    RVALUE_AGE_SET(obj, 0);
-}
-
-static inline void
-RVALUE_DEMOTE(rb_objspace_t *objspace, VALUE obj)
-{
-    check_rvalue_consistency(obj);
-    GC_ASSERT(RVALUE_OLD_P(obj));
-
-    if (!is_incremental_marking(objspace) && RVALUE_REMEMBERED(obj)) {
-        CLEAR_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj);
-    }
-
-    CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), obj);
-    RVALUE_AGE_RESET(obj);
-
-    if (RVALUE_MARKED(obj)) {
-        objspace->rgengc.old_objects--;
-    }
 
-    check_rvalue_consistency(obj);
-}
-
-static inline int
-RVALUE_BLACK_P(VALUE obj)
-{
-    return RVALUE_MARKED(obj) && !RVALUE_MARKING(obj);
-}
-
-#if 0
-static inline int
-RVALUE_GREY_P(VALUE obj)
-{
-    return RVALUE_MARKED(obj) && RVALUE_MARKING(obj);
-}
-#endif
-
-static inline int
-RVALUE_WHITE_P(VALUE obj)
-{
-    return RVALUE_MARKED(obj) == FALSE;
-}
-
-/*
-  --------------------------- ObjectSpace -----------------------------
-*/
-
-static inline void *
-calloc1(size_t n)
-{
-    return calloc(1, n);
-}
-
-static VALUE initial_stress = Qfalse;
-
-void
-rb_gc_initial_stress_set(VALUE flag)
-{
-    initial_stress = flag;
-}
-
-static void *rb_gc_impl_objspace_alloc(void);
-
-#if USE_SHARED_GC
-# include "dln.h"
-
-# define RUBY_GC_LIBRARY_PATH "RUBY_GC_LIBRARY_PATH"
-
-void
-ruby_external_gc_init(void)
-{
-    char *gc_so_path = getenv(RUBY_GC_LIBRARY_PATH);
-    void *handle = NULL;
-    if (gc_so_path && dln_supported_p()) {
-        char error[1024];
-        handle = dln_open(gc_so_path, error, sizeof(error));
+        handle = dlopen(gc_so_path, RTLD_LAZY | RTLD_GLOBAL);
         if (!handle) {
-            fprintf(stderr, "%s", error);
-            rb_bug("ruby_external_gc_init: Shared library %s cannot be opened", gc_so_path);
+            fprintf(stderr, "ruby_modular_gc_init: Shared library %s cannot be opened: %s\n", gc_so_path, dlerror());
+            exit(EXIT_FAILURE);
         }
+
+        gc_functions.modular_gc_loaded_p = true;
     }
 
-# define load_external_gc_func(name) do { \
+    unsigned int err_count = 0;
+
+# define load_modular_gc_func(name) do { \
     if (handle) { \
-        rb_gc_functions->name = dln_symbol(handle, "rb_gc_impl_" #name); \
-        if (!rb_gc_functions->name) { \
-            rb_bug("ruby_external_gc_init: " #name " func not exported by library %s", gc_so_path); \
+        const char *func_name = "rb_gc_impl_" #name; \
+        gc_functions.name = dlsym(handle, func_name); \
+        if (!gc_functions.name) { \
+            fprintf(stderr, "ruby_modular_gc_init: %s function not exported by library %s\n", func_name, gc_so_path); \
+            err_count++; \
         } \
     } \
     else { \
-        rb_gc_functions->name = rb_gc_impl_##name; \
+        gc_functions.name = rb_gc_impl_##name; \
     } \
 } while (0)
 
-    load_external_gc_func(objspace_alloc);
-
-# undef load_external_gc_func
-}
-
-# define rb_gc_impl_objspace_alloc rb_gc_functions->objspace_alloc
-#endif
-
-rb_objspace_t *
-rb_objspace_alloc(void)
-{
-#if USE_SHARED_GC
-    ruby_external_gc_init();
-#endif
-    return (rb_objspace_t *)rb_gc_impl_objspace_alloc();
-}
-
-#if USE_SHARED_GC
-# undef rb_gc_impl_objspace_alloc
-#endif
-
-static void free_stack_chunks(mark_stack_t *);
-static void mark_stack_free_cache(mark_stack_t *);
-static void heap_page_free(rb_objspace_t *objspace, struct heap_page *page);
-
-void
-rb_objspace_free(rb_objspace_t *objspace)
-{
-    if (is_lazy_sweeping(objspace))
-        rb_bug("lazy sweeping underway when freeing object space");
-
-    free(objspace->profile.records);
-    objspace->profile.records = NULL;
-
-    if (heap_pages_sorted) {
-        size_t i;
-        size_t total_heap_pages = heap_allocated_pages;
-        for (i = 0; i < total_heap_pages; ++i) {
-            heap_page_free(objspace, heap_pages_sorted[i]);
-        }
-        free(heap_pages_sorted);
-        heap_allocated_pages = 0;
-        heap_pages_sorted_length = 0;
-        heap_pages_lomem = 0;
-        heap_pages_himem = 0;
-
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            SIZE_POOL_EDEN_HEAP(size_pool)->total_pages = 0;
-            SIZE_POOL_EDEN_HEAP(size_pool)->total_slots = 0;
-        }
-    }
-    st_free_table(objspace->id_to_obj_tbl);
-    st_free_table(objspace->obj_to_id_tbl);
-
-    free_stack_chunks(&objspace->mark_stack);
-    mark_stack_free_cache(&objspace->mark_stack);
-
-    rb_darray_free(objspace->weak_references);
-
-    free(objspace);
-}
-
-static void
-heap_pages_expand_sorted_to(rb_objspace_t *objspace, size_t next_length)
-{
-    struct heap_page **sorted;
-    size_t size = size_mul_or_raise(next_length, sizeof(struct heap_page *), rb_eRuntimeError);
-
-    gc_report(3, objspace, "heap_pages_expand_sorted: next_length: %"PRIdSIZE", size: %"PRIdSIZE"\n",
-              next_length, size);
-
-    if (heap_pages_sorted_length > 0) {
-        sorted = (struct heap_page **)realloc(heap_pages_sorted, size);
-        if (sorted) heap_pages_sorted = sorted;
-    }
-    else {
-        sorted = heap_pages_sorted = (struct heap_page **)malloc(size);
-    }
-
-    if (sorted == 0) {
-        rb_memerror();
+    // Bootup
+    load_modular_gc_func(objspace_alloc);
+    load_modular_gc_func(objspace_init);
+    load_modular_gc_func(ractor_cache_alloc);
+    load_modular_gc_func(set_params);
+    load_modular_gc_func(init);
+    load_modular_gc_func(heap_sizes);
+    // Shutdown
+    load_modular_gc_func(shutdown_free_objects);
+    load_modular_gc_func(objspace_free);
+    load_modular_gc_func(ractor_cache_free);
+    // GC
+    load_modular_gc_func(start);
+    load_modular_gc_func(during_gc_p);
+    load_modular_gc_func(prepare_heap);
+    load_modular_gc_func(gc_enable);
+    load_modular_gc_func(gc_disable);
+    load_modular_gc_func(gc_enabled_p);
+    load_modular_gc_func(config_set);
+    load_modular_gc_func(config_get);
+    load_modular_gc_func(stress_set);
+    load_modular_gc_func(stress_get);
+    load_modular_gc_func(get_vm_context);
+    // Object allocation
+    load_modular_gc_func(new_obj);
+    load_modular_gc_func(obj_slot_size);
+    load_modular_gc_func(heap_id_for_size);
+    load_modular_gc_func(size_allocatable_p);
+    // Malloc
+    load_modular_gc_func(malloc);
+    load_modular_gc_func(calloc);
+    load_modular_gc_func(realloc);
+    load_modular_gc_func(free);
+    load_modular_gc_func(adjust_memory_usage);
+    // Marking
+    load_modular_gc_func(mark);
+    load_modular_gc_func(mark_and_move);
+    load_modular_gc_func(mark_and_pin);
+    load_modular_gc_func(mark_maybe);
+    // Weak references
+    load_modular_gc_func(declare_weak_references);
+    load_modular_gc_func(handle_weak_references_alive_p);
+    // Compaction
+    load_modular_gc_func(register_pinning_obj);
+    load_modular_gc_func(object_moved_p);
+    load_modular_gc_func(location);
+    // Write barriers
+    load_modular_gc_func(writebarrier);
+    load_modular_gc_func(writebarrier_unprotect);
+    load_modular_gc_func(writebarrier_remember);
+    // Heap walking
+    load_modular_gc_func(each_objects);
+    load_modular_gc_func(each_object);
+    // Finalizers
+    load_modular_gc_func(make_zombie);
+    load_modular_gc_func(define_finalizer);
+    load_modular_gc_func(undefine_finalizer);
+    load_modular_gc_func(copy_finalizer);
+    load_modular_gc_func(shutdown_call_finalizer);
+    // Forking
+    load_modular_gc_func(before_fork);
+    load_modular_gc_func(after_fork);
+    // Statistics
+    load_modular_gc_func(set_measure_total_time);
+    load_modular_gc_func(get_measure_total_time);
+    load_modular_gc_func(get_total_time);
+    load_modular_gc_func(gc_count);
+    load_modular_gc_func(latest_gc_info);
+    load_modular_gc_func(stat);
+    load_modular_gc_func(stat_heap);
+    load_modular_gc_func(active_gc_name);
+    // Miscellaneous
+    load_modular_gc_func(object_metadata);
+    load_modular_gc_func(pointer_to_heap_p);
+    load_modular_gc_func(garbage_object_p);
+    load_modular_gc_func(set_event_hook);
+    load_modular_gc_func(copy_attributes);
+
+    if (err_count > 0) {
+        fprintf(stderr, "ruby_modular_gc_init: found %u missing exports in library %s\n", err_count, gc_so_path);
+        exit(EXIT_FAILURE);
     }
 
-    heap_pages_sorted_length = next_length;
-}
+# undef load_modular_gc_func
+
+    rb_gc_functions = gc_functions;
+}
+
+// Bootup
+# define rb_gc_impl_objspace_alloc rb_gc_functions.objspace_alloc
+# define rb_gc_impl_objspace_init rb_gc_functions.objspace_init
+# define rb_gc_impl_ractor_cache_alloc rb_gc_functions.ractor_cache_alloc
+# define rb_gc_impl_set_params rb_gc_functions.set_params
+# define rb_gc_impl_init rb_gc_functions.init
+# define rb_gc_impl_heap_sizes rb_gc_functions.heap_sizes
+// Shutdown
+# define rb_gc_impl_shutdown_free_objects rb_gc_functions.shutdown_free_objects
+# define rb_gc_impl_objspace_free rb_gc_functions.objspace_free
+# define rb_gc_impl_ractor_cache_free rb_gc_functions.ractor_cache_free
+// GC
+# define rb_gc_impl_start rb_gc_functions.start
+# define rb_gc_impl_during_gc_p rb_gc_functions.during_gc_p
+# define rb_gc_impl_prepare_heap rb_gc_functions.prepare_heap
+# define rb_gc_impl_gc_enable rb_gc_functions.gc_enable
+# define rb_gc_impl_gc_disable rb_gc_functions.gc_disable
+# define rb_gc_impl_gc_enabled_p rb_gc_functions.gc_enabled_p
+# define rb_gc_impl_config_get rb_gc_functions.config_get
+# define rb_gc_impl_config_set rb_gc_functions.config_set
+# define rb_gc_impl_stress_set rb_gc_functions.stress_set
+# define rb_gc_impl_stress_get rb_gc_functions.stress_get
+# define rb_gc_impl_get_vm_context rb_gc_functions.get_vm_context
+// Object allocation
+# define rb_gc_impl_new_obj rb_gc_functions.new_obj
+# define rb_gc_impl_obj_slot_size rb_gc_functions.obj_slot_size
+# define rb_gc_impl_heap_id_for_size rb_gc_functions.heap_id_for_size
+# define rb_gc_impl_size_allocatable_p rb_gc_functions.size_allocatable_p
+// Malloc
+# define rb_gc_impl_malloc rb_gc_functions.malloc
+# define rb_gc_impl_calloc rb_gc_functions.calloc
+# define rb_gc_impl_realloc rb_gc_functions.realloc
+# define rb_gc_impl_free rb_gc_functions.free
+# define rb_gc_impl_adjust_memory_usage rb_gc_functions.adjust_memory_usage
+// Marking
+# define rb_gc_impl_mark rb_gc_functions.mark
+# define rb_gc_impl_mark_and_move rb_gc_functions.mark_and_move
+# define rb_gc_impl_mark_and_pin rb_gc_functions.mark_and_pin
+# define rb_gc_impl_mark_maybe rb_gc_functions.mark_maybe
+// Weak references
+# define rb_gc_impl_declare_weak_references rb_gc_functions.declare_weak_references
+# define rb_gc_impl_handle_weak_references_alive_p rb_gc_functions.handle_weak_references_alive_p
+// Compaction
+# define rb_gc_impl_register_pinning_obj rb_gc_functions.register_pinning_obj
+# define rb_gc_impl_object_moved_p rb_gc_functions.object_moved_p
+# define rb_gc_impl_location rb_gc_functions.location
+// Write barriers
+# define rb_gc_impl_writebarrier rb_gc_functions.writebarrier
+# define rb_gc_impl_writebarrier_unprotect rb_gc_functions.writebarrier_unprotect
+# define rb_gc_impl_writebarrier_remember rb_gc_functions.writebarrier_remember
+// Heap walking
+# define rb_gc_impl_each_objects rb_gc_functions.each_objects
+# define rb_gc_impl_each_object rb_gc_functions.each_object
+// Finalizers
+# define rb_gc_impl_make_zombie rb_gc_functions.make_zombie
+# define rb_gc_impl_define_finalizer rb_gc_functions.define_finalizer
+# define rb_gc_impl_undefine_finalizer rb_gc_functions.undefine_finalizer
+# define rb_gc_impl_copy_finalizer rb_gc_functions.copy_finalizer
+# define rb_gc_impl_shutdown_call_finalizer rb_gc_functions.shutdown_call_finalizer
+// Forking
+# define rb_gc_impl_before_fork rb_gc_functions.before_fork
+# define rb_gc_impl_after_fork rb_gc_functions.after_fork
+// Statistics
+# define rb_gc_impl_set_measure_total_time rb_gc_functions.set_measure_total_time
+# define rb_gc_impl_get_measure_total_time rb_gc_functions.get_measure_total_time
+# define rb_gc_impl_get_total_time rb_gc_functions.get_total_time
+# define rb_gc_impl_gc_count rb_gc_functions.gc_count
+# define rb_gc_impl_latest_gc_info rb_gc_functions.latest_gc_info
+# define rb_gc_impl_stat rb_gc_functions.stat
+# define rb_gc_impl_stat_heap rb_gc_functions.stat_heap
+# define rb_gc_impl_active_gc_name rb_gc_functions.active_gc_name
+// Miscellaneous
+# define rb_gc_impl_object_metadata rb_gc_functions.object_metadata
+# define rb_gc_impl_pointer_to_heap_p rb_gc_functions.pointer_to_heap_p
+# define rb_gc_impl_garbage_object_p rb_gc_functions.garbage_object_p
+# define rb_gc_impl_set_event_hook rb_gc_functions.set_event_hook
+# define rb_gc_impl_copy_attributes rb_gc_functions.copy_attributes
+#endif
 
+#ifdef RUBY_ASAN_ENABLED
 static void
-heap_pages_expand_sorted(rb_objspace_t *objspace)
+asan_death_callback(void)
 {
-    /* usually heap_allocatable_pages + heap_eden->total_pages == heap_pages_sorted_length
-     * because heap_allocatable_pages contains heap_tomb->total_pages (recycle heap_tomb pages).
-     * however, if there are pages which do not have empty slots, then try to create new pages
-     * so that the additional allocatable_pages counts (heap_tomb->total_pages) are added.
-     */
-    size_t next_length = heap_allocatable_pages(objspace);
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        next_length += SIZE_POOL_EDEN_HEAP(size_pool)->total_pages;
-        next_length += SIZE_POOL_TOMB_HEAP(size_pool)->total_pages;
+    if (GET_VM()) {
+        rb_bug_without_die("ASAN error");
     }
-
-    if (next_length > heap_pages_sorted_length) {
-        heap_pages_expand_sorted_to(objspace, next_length);
-    }
-
-    GC_ASSERT(heap_allocatable_pages(objspace) + heap_eden_total_pages(objspace) <= heap_pages_sorted_length);
-    GC_ASSERT(heap_allocated_pages <= heap_pages_sorted_length);
 }
-
-static void
-size_pool_allocatable_pages_set(rb_objspace_t *objspace, rb_size_pool_t *size_pool, size_t s)
-{
-    size_pool->allocatable_pages = s;
-    heap_pages_expand_sorted(objspace);
-}
-
-static inline void
-heap_page_add_freeobj(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
-{
-    ASSERT_vm_locking();
-
-    RVALUE *p = (RVALUE *)obj;
-
-    asan_unpoison_object(obj, false);
-
-    asan_unlock_freelist(page);
-
-    p->as.free.flags = 0;
-    p->as.free.next = page->freelist;
-    page->freelist = p;
-    asan_lock_freelist(page);
-
-    RVALUE_AGE_RESET(obj);
-
-    if (RGENGC_CHECK_MODE &&
-        /* obj should belong to page */
-        !(page->start <= (uintptr_t)obj &&
-          (uintptr_t)obj   <  ((uintptr_t)page->start + (page->total_slots * page->slot_size)) &&
-          obj % BASE_SLOT_SIZE == 0)) {
-        rb_bug("heap_page_add_freeobj: %p is not rvalue.", (void *)p);
-    }
-
-    asan_poison_object(obj);
-    gc_report(3, objspace, "heap_page_add_freeobj: add %p to freelist\n", (void *)obj);
-}
-
-static inline void
-heap_add_freepage(rb_heap_t *heap, struct heap_page *page)
-{
-    asan_unlock_freelist(page);
-    GC_ASSERT(page->free_slots != 0);
-    GC_ASSERT(page->freelist != NULL);
-
-    page->free_next = heap->free_pages;
-    heap->free_pages = page;
-
-    RUBY_DEBUG_LOG("page:%p freelist:%p", (void *)page, (void *)page->freelist);
-
-    asan_lock_freelist(page);
-}
-
-static inline void
-heap_add_poolpage(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
-{
-    asan_unlock_freelist(page);
-    GC_ASSERT(page->free_slots != 0);
-    GC_ASSERT(page->freelist != NULL);
-
-    page->free_next = heap->pooled_pages;
-    heap->pooled_pages = page;
-    objspace->rincgc.pooled_slots += page->free_slots;
-
-    asan_lock_freelist(page);
-}
-
-static void
-heap_unlink_page(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
-{
-    ccan_list_del(&page->page_node);
-    heap->total_pages--;
-    heap->total_slots -= page->total_slots;
-}
-
-static void rb_aligned_free(void *ptr, size_t size);
-
-static void
-heap_page_body_free(struct heap_page_body *page_body)
-{
-    GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
-
-    if (HEAP_PAGE_ALLOC_USE_MMAP) {
-#ifdef HAVE_MMAP
-        GC_ASSERT(HEAP_PAGE_SIZE % sysconf(_SC_PAGE_SIZE) == 0);
-        if (munmap(page_body, HEAP_PAGE_SIZE)) {
-            rb_bug("heap_page_body_free: munmap failed");
-        }
 #endif
-    }
-    else {
-        rb_aligned_free(page_body, HEAP_PAGE_SIZE);
-    }
-}
 
-static void
-heap_page_free(rb_objspace_t *objspace, struct heap_page *page)
-{
-    heap_allocated_pages--;
-    page->size_pool->total_freed_pages++;
-    heap_page_body_free(GET_PAGE_BODY(page->start));
-    free(page);
-}
+static VALUE initial_stress = Qfalse;
 
-static void *
-rb_aligned_malloc(size_t alignment, size_t size)
+void *
+rb_objspace_alloc(void)
 {
-    /* alignment must be a power of 2 */
-    GC_ASSERT(((alignment - 1) & alignment) == 0);
-    GC_ASSERT(alignment % sizeof(void*) == 0);
-
-    void *res;
-
-#if defined __MINGW32__
-    res = __mingw_aligned_malloc(size, alignment);
-#elif defined _WIN32
-    void *_aligned_malloc(size_t, size_t);
-    res = _aligned_malloc(size, alignment);
-#elif defined(HAVE_POSIX_MEMALIGN)
-    if (posix_memalign(&res, alignment, size) != 0) {
-        return NULL;
-    }
-#elif defined(HAVE_MEMALIGN)
-    res = memalign(alignment, size);
-#else
-    char* aligned;
-    res = malloc(alignment + size + sizeof(void*));
-    aligned = (char*)res + alignment + sizeof(void*);
-    aligned -= ((VALUE)aligned & (alignment - 1));
-    ((void**)aligned)[-1] = res;
-    res = (void*)aligned;
+#if USE_MODULAR_GC
+    ruby_modular_gc_init();
 #endif
 
-    GC_ASSERT((uintptr_t)res % alignment == 0);
-
-    return res;
-}
-
-static void
-heap_pages_free_unused_pages(rb_objspace_t *objspace)
-{
-    size_t i, j;
-
-    bool has_pages_in_tomb_heap = FALSE;
-    for (i = 0; i < SIZE_POOL_COUNT; i++) {
-        if (!ccan_list_empty(&SIZE_POOL_TOMB_HEAP(&size_pools[i])->pages)) {
-            has_pages_in_tomb_heap = TRUE;
-            break;
-        }
-    }
-
-    if (has_pages_in_tomb_heap) {
-        for (i = j = 0; j < heap_allocated_pages; i++) {
-            struct heap_page *page = heap_pages_sorted[i];
-
-            if (page->flags.in_tomb && page->free_slots == page->total_slots) {
-                heap_unlink_page(objspace, SIZE_POOL_TOMB_HEAP(page->size_pool), page);
-                heap_page_free(objspace, page);
-            }
-            else {
-                if (i != j) {
-                    heap_pages_sorted[j] = page;
-                }
-                j++;
-            }
-        }
-
-        struct heap_page *hipage = heap_pages_sorted[heap_allocated_pages - 1];
-        uintptr_t himem = (uintptr_t)hipage->start + (hipage->total_slots * hipage->slot_size);
-        GC_ASSERT(himem <= heap_pages_himem);
-        heap_pages_himem = himem;
-
-        struct heap_page *lopage = heap_pages_sorted[0];
-        uintptr_t lomem = (uintptr_t)lopage->start;
-        GC_ASSERT(lomem >= heap_pages_lomem);
-        heap_pages_lomem = lomem;
-
-        GC_ASSERT(j == heap_allocated_pages);
-    }
-}
-
-static struct heap_page_body *
-heap_page_body_allocate(void)
-{
-    struct heap_page_body *page_body;
-
-    if (HEAP_PAGE_ALLOC_USE_MMAP) {
-#ifdef HAVE_MMAP
-        GC_ASSERT(HEAP_PAGE_ALIGN % sysconf(_SC_PAGE_SIZE) == 0);
-
-        char *ptr = mmap(NULL, HEAP_PAGE_ALIGN + HEAP_PAGE_SIZE,
-                         PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
-        if (ptr == MAP_FAILED) {
-            return NULL;
-        }
-
-        char *aligned = ptr + HEAP_PAGE_ALIGN;
-        aligned -= ((VALUE)aligned & (HEAP_PAGE_ALIGN - 1));
-        GC_ASSERT(aligned > ptr);
-        GC_ASSERT(aligned <= ptr + HEAP_PAGE_ALIGN);
-
-        size_t start_out_of_range_size = aligned - ptr;
-        GC_ASSERT(start_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
-        if (start_out_of_range_size > 0) {
-            if (munmap(ptr, start_out_of_range_size)) {
-                rb_bug("heap_page_body_allocate: munmap failed for start");
-            }
-        }
+    void *objspace = rb_gc_impl_objspace_alloc();
+    ruby_current_vm_ptr->gc.objspace = objspace;
+    rb_gc_impl_objspace_init(objspace);
+    rb_gc_impl_stress_set(objspace, initial_stress);
 
-        size_t end_out_of_range_size = HEAP_PAGE_ALIGN - start_out_of_range_size;
-        GC_ASSERT(end_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
-        if (end_out_of_range_size > 0) {
-            if (munmap(aligned + HEAP_PAGE_SIZE, end_out_of_range_size)) {
-                rb_bug("heap_page_body_allocate: munmap failed for end");
-            }
-        }
-
-        page_body = (struct heap_page_body *)aligned;
+#ifdef RUBY_ASAN_ENABLED
+    __sanitizer_set_death_callback(asan_death_callback);
 #endif
-    }
-    else {
-        page_body = rb_aligned_malloc(HEAP_PAGE_ALIGN, HEAP_PAGE_SIZE);
-    }
-
-    GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
 
-    return page_body;
-}
-
-static struct heap_page *
-heap_page_allocate(rb_objspace_t *objspace, rb_size_pool_t *size_pool)
-{
-    uintptr_t start, end, p;
-    struct heap_page *page;
-    uintptr_t hi, lo, mid;
-    size_t stride = size_pool->slot_size;
-    unsigned int limit = (unsigned int)((HEAP_PAGE_SIZE - sizeof(struct heap_page_header)))/(int)stride;
-
-    /* assign heap_page body (contains heap_page_header and RVALUEs) */
-    struct heap_page_body *page_body = heap_page_body_allocate();
-    if (page_body == 0) {
-        rb_memerror();
-    }
-
-    /* assign heap_page entry */
-    page = calloc1(sizeof(struct heap_page));
-    if (page == 0) {
-        heap_page_body_free(page_body);
-        rb_memerror();
-    }
-
-    /* adjust obj_limit (object number available in this page) */
-    start = (uintptr_t)((VALUE)page_body + sizeof(struct heap_page_header));
-
-    if (start % BASE_SLOT_SIZE != 0) {
-        int delta = BASE_SLOT_SIZE - (start % BASE_SLOT_SIZE);
-        start = start + delta;
-        GC_ASSERT(NUM_IN_PAGE(start) == 0 || NUM_IN_PAGE(start) == 1);
-
-        /* Find a num in page that is evenly divisible by `stride`.
-         * This is to ensure that objects are aligned with bit planes.
-         * In other words, ensure there are an even number of objects
-         * per bit plane. */
-        if (NUM_IN_PAGE(start) == 1) {
-            start += stride - BASE_SLOT_SIZE;
-        }
-
-        GC_ASSERT(NUM_IN_PAGE(start) * BASE_SLOT_SIZE % stride == 0);
-
-        limit = (HEAP_PAGE_SIZE - (int)(start - (uintptr_t)page_body))/(int)stride;
-    }
-    end = start + (limit * (int)stride);
-
-    /* setup heap_pages_sorted */
-    lo = 0;
-    hi = (uintptr_t)heap_allocated_pages;
-    while (lo < hi) {
-        struct heap_page *mid_page;
-
-        mid = (lo + hi) / 2;
-        mid_page = heap_pages_sorted[mid];
-        if ((uintptr_t)mid_page->start < start) {
-            lo = mid + 1;
-        }
-        else if ((uintptr_t)mid_page->start > start) {
-            hi = mid;
-        }
-        else {
-            rb_bug("same heap page is allocated: %p at %"PRIuVALUE, (void *)page_body, (VALUE)mid);
-        }
-    }
-
-    if (hi < (uintptr_t)heap_allocated_pages) {
-        MEMMOVE(&heap_pages_sorted[hi+1], &heap_pages_sorted[hi], struct heap_page_header*, heap_allocated_pages - hi);
-    }
-
-    heap_pages_sorted[hi] = page;
-
-    heap_allocated_pages++;
-
-    GC_ASSERT(heap_eden_total_pages(objspace) + heap_allocatable_pages(objspace) <= heap_pages_sorted_length);
-    GC_ASSERT(heap_eden_total_pages(objspace) + heap_tomb_total_pages(objspace) == heap_allocated_pages - 1);
-    GC_ASSERT(heap_allocated_pages <= heap_pages_sorted_length);
-
-    size_pool->total_allocated_pages++;
-
-    if (heap_allocated_pages > heap_pages_sorted_length) {
-        rb_bug("heap_page_allocate: allocated(%"PRIdSIZE") > sorted(%"PRIdSIZE")",
-               heap_allocated_pages, heap_pages_sorted_length);
-    }
-
-    if (heap_pages_lomem == 0 || heap_pages_lomem > start) heap_pages_lomem = start;
-    if (heap_pages_himem < end) heap_pages_himem = end;
-
-    page->start = start;
-    page->total_slots = limit;
-    page->slot_size = size_pool->slot_size;
-    page->size_pool = size_pool;
-    page_body->header.page = page;
-
-    for (p = start; p != end; p += stride) {
-        gc_report(3, objspace, "assign_heap_page: %p is added to freelist\n", (void *)p);
-        heap_page_add_freeobj(objspace, page, (VALUE)p);
-    }
-    page->free_slots = limit;
-
-    asan_lock_freelist(page);
-    return page;
-}
-
-static struct heap_page *
-heap_page_resurrect(rb_objspace_t *objspace, rb_size_pool_t *size_pool)
-{
-    struct heap_page *page = 0, *next;
-
-    ccan_list_for_each_safe(&SIZE_POOL_TOMB_HEAP(size_pool)->pages, page, next, page_node) {
-        asan_unlock_freelist(page);
-        if (page->freelist != NULL) {
-            heap_unlink_page(objspace, &size_pool->tomb_heap, page);
-            asan_lock_freelist(page);
-            return page;
-        }
-    }
-
-    return NULL;
-}
-
-static struct heap_page *
-heap_page_create(rb_objspace_t *objspace, rb_size_pool_t *size_pool)
-{
-    struct heap_page *page;
-    const char *method = "recycle";
-
-    size_pool->allocatable_pages--;
-
-    page = heap_page_resurrect(objspace, size_pool);
-
-    if (page == NULL) {
-        page = heap_page_allocate(objspace, size_pool);
-        method = "allocate";
-    }
-    if (0) fprintf(stderr, "heap_page_create: %s - %p, "
-                   "heap_allocated_pages: %"PRIdSIZE", "
-                   "heap_allocated_pages: %"PRIdSIZE", "
-                   "tomb->total_pages: %"PRIdSIZE"\n",
-                   method, (void *)page, heap_pages_sorted_length, heap_allocated_pages, SIZE_POOL_TOMB_HEAP(size_pool)->total_pages);
-    return page;
+    return objspace;
 }
 
-static void
-heap_add_page(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap, struct heap_page *page)
+void
+rb_objspace_free(void *objspace)
 {
-    /* Adding to eden heap during incremental sweeping is forbidden */
-    GC_ASSERT(!(heap == SIZE_POOL_EDEN_HEAP(size_pool) && heap->sweeping_page));
-    page->flags.in_tomb = (heap == SIZE_POOL_TOMB_HEAP(size_pool));
-    ccan_list_add_tail(&heap->pages, &page->page_node);
-    heap->total_pages++;
-    heap->total_slots += page->total_slots;
+    rb_gc_impl_objspace_free(objspace);
 }
 
-static void
-heap_assign_page(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
+size_t
+rb_gc_obj_slot_size(VALUE obj)
 {
-    struct heap_page *page = heap_page_create(objspace, size_pool);
-    heap_add_page(objspace, size_pool, heap, page);
-    heap_add_freepage(heap, page);
+    return rb_gc_impl_obj_slot_size(obj);
 }
 
-#if GC_CAN_COMPILE_COMPACTION
-static void
-heap_add_pages(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap, size_t add)
+static inline void
+gc_validate_pc(VALUE obj)
 {
-    size_t i;
+#if RUBY_DEBUG
+    // IMEMOs and objects without a class (e.g managed id table) are not traceable
+    if (RB_TYPE_P(obj, T_IMEMO) || !CLASS_OF(obj)) return;
 
-    size_pool_allocatable_pages_set(objspace, size_pool, add);
-
-    for (i = 0; i < add; i++) {
-        heap_assign_page(objspace, size_pool, heap);
+    rb_execution_context_t *ec = GET_EC();
+    const rb_control_frame_t *cfp = ec->cfp;
+    if (cfp && VM_FRAME_RUBYFRAME_P(cfp) && CFP_PC(cfp)) {
+        const VALUE *iseq_encoded = ISEQ_BODY(CFP_ISEQ(cfp))->iseq_encoded;
+        const VALUE *iseq_encoded_end = iseq_encoded + ISEQ_BODY(CFP_ISEQ(cfp))->iseq_size;
+        RUBY_ASSERT(CFP_PC(cfp) >= iseq_encoded, "PC not set when allocating, breaking tracing");
+        RUBY_ASSERT(CFP_PC(cfp) <= iseq_encoded_end, "PC not set when allocating, breaking tracing");
     }
-
-    GC_ASSERT(size_pool->allocatable_pages == 0);
-}
 #endif
-
-static size_t
-slots_to_pages_for_size_pool(rb_objspace_t *objspace, rb_size_pool_t *size_pool, size_t slots)
-{
-    size_t multiple = size_pool->slot_size / BASE_SLOT_SIZE;
-    /* Due to alignment, heap pages may have one less slot. We should
-     * ensure there is enough pages to guarantee that we will have at
-     * least the required number of slots after allocating all the pages. */
-    size_t slots_per_page = (HEAP_PAGE_OBJ_LIMIT / multiple) - 1;
-    return CEILDIV(slots, slots_per_page);
-}
-
-static size_t
-minimum_pages_for_size_pool(rb_objspace_t *objspace, rb_size_pool_t *size_pool)
-{
-    size_t size_pool_idx = size_pool - size_pools;
-    size_t init_slots = gc_params.size_pool_init_slots[size_pool_idx];
-    return slots_to_pages_for_size_pool(objspace, size_pool, init_slots);
-}
-
-static size_t
-heap_extend_pages(rb_objspace_t *objspace, rb_size_pool_t *size_pool, size_t free_slots, size_t total_slots, size_t used)
-{
-    double goal_ratio = gc_params.heap_free_slots_goal_ratio;
-    size_t next_used;
-
-    if (goal_ratio == 0.0) {
-        next_used = (size_t)(used * gc_params.growth_factor);
-    }
-    else if (total_slots == 0) {
-        next_used = minimum_pages_for_size_pool(objspace, size_pool);
-    }
-    else {
-        /* Find `f' where free_slots = f * total_slots * goal_ratio
-         * => f = (total_slots - free_slots) / ((1 - goal_ratio) * total_slots)
-         */
-        double f = (double)(total_slots - free_slots) / ((1 - goal_ratio) * total_slots);
-
-        if (f > gc_params.growth_factor) f = gc_params.growth_factor;
-        if (f < 1.0) f = 1.1;
-
-        next_used = (size_t)(f * used);
-
-        if (0) {
-            fprintf(stderr,
-                    "free_slots(%8"PRIuSIZE")/total_slots(%8"PRIuSIZE")=%1.2f,"
-                    " G(%1.2f), f(%1.2f),"
-                    " used(%8"PRIuSIZE") => next_used(%8"PRIuSIZE")\n",
-                    free_slots, total_slots, free_slots/(double)total_slots,
-                    goal_ratio, f, used, next_used);
-        }
-    }
-
-    if (gc_params.growth_max_slots > 0) {
-        size_t max_used = (size_t)(used + gc_params.growth_max_slots/HEAP_PAGE_OBJ_LIMIT);
-        if (next_used > max_used) next_used = max_used;
-    }
-
-    size_t extend_page_count = next_used - used;
-    /* Extend by at least 1 page. */
-    if (extend_page_count == 0) extend_page_count = 1;
-
-    return extend_page_count;
-}
-
-static int
-heap_increment(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
-{
-    if (size_pool->allocatable_pages > 0) {
-        gc_report(1, objspace, "heap_increment: heap_pages_sorted_length: %"PRIdSIZE", "
-                  "heap_pages_inc: %"PRIdSIZE", heap->total_pages: %"PRIdSIZE"\n",
-                  heap_pages_sorted_length, size_pool->allocatable_pages, heap->total_pages);
-
-        GC_ASSERT(heap_allocatable_pages(objspace) + heap_eden_total_pages(objspace) <= heap_pages_sorted_length);
-        GC_ASSERT(heap_allocated_pages <= heap_pages_sorted_length);
-
-        heap_assign_page(objspace, size_pool, heap);
-        return TRUE;
-    }
-    return FALSE;
-}
-
-static void
-gc_continue(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
-{
-    unsigned int lock_lev;
-    gc_enter(objspace, gc_enter_event_continue, &lock_lev);
-
-    /* Continue marking if in incremental marking. */
-    if (is_incremental_marking(objspace)) {
-        if (gc_marks_continue(objspace, size_pool, heap)) {
-            gc_sweep(objspace);
-        }
-    }
-
-    /* Continue sweeping if in lazy sweeping or the previous incremental
-     * marking finished and did not yield a free page. */
-    if (heap->free_pages == NULL && is_lazy_sweeping(objspace)) {
-        gc_sweep_continue(objspace, size_pool, heap);
-    }
-
-    gc_exit(objspace, gc_enter_event_continue, &lock_lev);
 }
 
+NOINLINE(static void gc_newobj_hook(VALUE obj));
 static void
-heap_prepare(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
+gc_newobj_hook(VALUE obj)
 {
-    GC_ASSERT(heap->free_pages == NULL);
-
-    /* Continue incremental marking or lazy sweeping, if in any of those steps. */
-    gc_continue(objspace, size_pool, heap);
-
-    /* If we still don't have a free page and not allowed to create a new page,
-     * we should start a new GC cycle. */
-    if (heap->free_pages == NULL &&
-            (will_be_incremental_marking(objspace) ||
-                (heap_increment(objspace, size_pool, heap) == FALSE))) {
-        if (gc_start(objspace, GPR_FLAG_NEWOBJ) == FALSE) {
-            rb_memerror();
-        }
-        else {
-            /* Do steps of incremental marking or lazy sweeping if the GC run permits. */
-            gc_continue(objspace, size_pool, heap);
-
-            /* If we're not incremental marking (e.g. a minor GC) or finished
-             * sweeping and still don't have a free page, then
-             * gc_sweep_finish_size_pool should allow us to create a new page. */
-            if (heap->free_pages == NULL && !heap_increment(objspace, size_pool, heap)) {
-                if (gc_needs_major_flags == GPR_FLAG_NONE) {
-                    rb_bug("cannot create a new page after GC");
-                }
-                else { // Major GC is required, which will allow us to create new page
-                    if (gc_start(objspace, GPR_FLAG_NEWOBJ) == FALSE) {
-                        rb_memerror();
-                    }
-                    else {
-                        /* Do steps of incremental marking or lazy sweeping. */
-                        gc_continue(objspace, size_pool, heap);
-
-                        if (heap->free_pages == NULL &&
-                                !heap_increment(objspace, size_pool, heap)) {
-                            rb_bug("cannot create a new page after major GC");
-                        }
-                    }
-                }
-            }
+    int lev = RB_GC_VM_LOCK_NO_BARRIER();
+    {
+        size_t slot_size = rb_gc_obj_slot_size(obj);
+        memset((char *)obj + sizeof(struct RBasic), 0, slot_size - sizeof(struct RBasic));
+
+        /* We must disable GC here because the callback could call xmalloc
+         * which could potentially trigger a GC, and a lot of code is unsafe
+         * to trigger a GC right after an object has been allocated because
+         * they perform initialization for the object and assume that the
+         * GC does not trigger before then. */
+        bool gc_disabled = RTEST(rb_gc_disable_no_rest());
+        {
+            rb_gc_event_hook(obj, RUBY_INTERNAL_EVENT_NEWOBJ);
         }
+        if (!gc_disabled) rb_gc_enable();
     }
-
-    GC_ASSERT(heap->free_pages != NULL);
-}
-
-void
-rb_objspace_set_event_hook(const rb_event_flag_t event)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    objspace->hook_events = event & RUBY_INTERNAL_EVENT_OBJSPACE_MASK;
-    objspace->flags.has_newobj_hook = !!(objspace->hook_events & RUBY_INTERNAL_EVENT_NEWOBJ);
-}
-
-static void
-gc_event_hook_body(rb_execution_context_t *ec, rb_objspace_t *objspace, const rb_event_flag_t event, VALUE data)
-{
-    if (UNLIKELY(!ec->cfp)) return;
-    EXEC_EVENT_HOOK(ec, event, ec->cfp->self, 0, 0, 0, data);
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
 }
 
-#define gc_event_newobj_hook_needed_p(objspace) ((objspace)->flags.has_newobj_hook)
-#define gc_event_hook_needed_p(objspace, event) ((objspace)->hook_events & (event))
-
-#define gc_event_hook_prep(objspace, event, data, prep) do { \
-    if (UNLIKELY(gc_event_hook_needed_p(objspace, event))) { \
-        prep; \
-        gc_event_hook_body(GET_EC(), (objspace), (event), (data)); \
-    } \
-} while (0)
-
-#define gc_event_hook(objspace, event, data) gc_event_hook_prep(objspace, event, data, (void)0)
-
-static inline VALUE
-newobj_init(VALUE klass, VALUE flags, int wb_protected, rb_objspace_t *objspace, VALUE obj)
+VALUE
+rb_newobj(rb_execution_context_t *ec, VALUE klass, VALUE flags, shape_id_t shape_id, bool wb_protected, size_t size)
 {
-#if !__has_feature(memory_sanitizer)
-    GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
     GC_ASSERT((flags & FL_WB_PROTECTED) == 0);
-#endif
-    RVALUE *p = RANY(obj);
-    p->as.basic.flags = flags;
-    *((VALUE *)&p->as.basic.klass) = klass;
-
-    int t = flags & RUBY_T_MASK;
-    if (t == T_CLASS || t == T_MODULE || t == T_ICLASS) {
-        RVALUE_AGE_SET_CANDIDATE(objspace, obj);
-    }
+    rb_ractor_t *cr = rb_ec_ractor_ptr(ec);
+    VALUE obj = rb_gc_impl_new_obj(rb_gc_get_objspace(), cr->newobj_cache, klass, flags, wb_protected, size);
 
 #if RACTOR_CHECK_MODE
+    void rb_ractor_setup_belonging(VALUE obj);
     rb_ractor_setup_belonging(obj);
 #endif
 
-#if RGENGC_CHECK_MODE
-    p->as.values.v1 = p->as.values.v2 = p->as.values.v3 = 0;
-
-    RB_VM_LOCK_ENTER_NO_BARRIER();
-    {
-        check_rvalue_consistency(obj);
+    RBASIC_SET_SHAPE_ID_NO_CHECKS(obj, shape_id);
 
-        GC_ASSERT(RVALUE_MARKED(obj) == FALSE);
-        GC_ASSERT(RVALUE_MARKING(obj) == FALSE);
-        GC_ASSERT(RVALUE_OLD_P(obj) == FALSE);
-        GC_ASSERT(RVALUE_WB_UNPROTECTED(obj) == FALSE);
+    gc_validate_pc(obj);
 
-        if (RVALUE_REMEMBERED((VALUE)obj)) rb_bug("newobj: %s is remembered.", obj_info(obj));
+    if (UNLIKELY(rb_gc_event_hook_required_p(RUBY_INTERNAL_EVENT_NEWOBJ))) {
+        gc_newobj_hook(obj);
     }
-    RB_VM_LOCK_LEAVE_NO_BARRIER();
-#endif
 
-    if (UNLIKELY(wb_protected == FALSE)) {
-        ASSERT_vm_locking();
-        MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
-    }
-
-#if RGENGC_PROFILE
-    if (wb_protected) {
-        objspace->profile.total_generated_normal_object_count++;
-#if RGENGC_PROFILE >= 2
-        objspace->profile.generated_normal_object_count_types[BUILTIN_TYPE(obj)]++;
-#endif
-    }
-    else {
-        objspace->profile.total_generated_shady_object_count++;
-#if RGENGC_PROFILE >= 2
-        objspace->profile.generated_shady_object_count_types[BUILTIN_TYPE(obj)]++;
-#endif
-    }
-#endif
+#if RGENGC_CHECK_MODE
+# ifndef GC_DEBUG_SLOT_FILL_SPECIAL_VALUE
+#  define GC_DEBUG_SLOT_FILL_SPECIAL_VALUE 255
+# endif
 
-#if GC_DEBUG
-    GET_RVALUE_OVERHEAD(obj)->file = rb_source_location_cstr(&GET_RVALUE_OVERHEAD(obj)->line);
-    GC_ASSERT(!SPECIAL_CONST_P(obj)); /* check alignment */
+    memset(
+        (void *)(obj + sizeof(struct RBasic)),
+        GC_DEBUG_SLOT_FILL_SPECIAL_VALUE,
+        rb_gc_obj_slot_size(obj) - sizeof(struct RBasic)
+    );
 #endif
 
-    gc_report(5, objspace, "newobj: %s\n", obj_info_basic(obj));
-
-    // RUBY_DEBUG_LOG("obj:%p (%s)", (void *)obj, obj_type_name(obj));
     return obj;
 }
 
-size_t
-rb_gc_obj_slot_size(VALUE obj)
-{
-    return GET_HEAP_PAGE(obj)->slot_size - RVALUE_OVERHEAD;
-}
-
-static inline size_t
-size_pool_slot_size(unsigned char pool_id)
+VALUE
+rb_ec_newobj_of(rb_execution_context_t *ec, VALUE klass, VALUE flags, size_t size)
 {
-    GC_ASSERT(pool_id < SIZE_POOL_COUNT);
-
-    size_t slot_size = (1 << pool_id) * BASE_SLOT_SIZE;
-
-#if RGENGC_CHECK_MODE
-    rb_objspace_t *objspace = &rb_objspace;
-    GC_ASSERT(size_pools[pool_id].slot_size == (short)slot_size);
-#endif
+    VALUE type = flags & T_MASK;
+    RUBY_ASSERT(type != T_OBJECT);
+    RUBY_ASSERT(type != T_DATA);
+    RUBY_ASSERT(type != T_CLASS);
+    RUBY_ASSERT(type != T_MODULE);
+    RUBY_ASSERT(type != T_ICLASS);
+    (void)type;
 
-    slot_size -= RVALUE_OVERHEAD;
-
-    return slot_size;
+    return rb_newobj(ec, klass, flags, ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_OTHER, true, size);
 }
 
-bool
-rb_gc_size_allocatable_p(size_t size)
+VALUE
+rb_newobj_of_with_shape(VALUE klass, VALUE flags, shape_id_t shape_id, size_t size)
 {
-    return size <= size_pool_slot_size(SIZE_POOL_COUNT - 1);
+    return rb_newobj(GET_EC(), klass, flags, shape_id, true, size);
 }
 
-static size_t size_pool_sizes[SIZE_POOL_COUNT + 1] = { 0 };
-
-size_t *
-rb_gc_size_pool_sizes(void)
+VALUE
+rb_newobj_of(VALUE klass, VALUE flags, size_t size)
 {
-    if (size_pool_sizes[0] == 0) {
-        for (unsigned char i = 0; i < SIZE_POOL_COUNT; i++) {
-            size_pool_sizes[i] = size_pool_slot_size(i);
-        }
-    }
-
-    return size_pool_sizes;
+    return rb_newobj(GET_EC(), klass, flags, ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_OTHER, true, size);
 }
 
-size_t
-rb_gc_size_pool_id_for_size(size_t size)
+static
+VALUE class_allocate_complex_instance(VALUE klass, uint32_t capacity)
 {
-    size += RVALUE_OVERHEAD;
-
-    size_t slot_count = CEILDIV(size, BASE_SLOT_SIZE);
-
-    /* size_pool_idx is ceil(log2(slot_count)) */
-    size_t size_pool_idx = 64 - nlz_int64(slot_count - 1);
-
-    if (size_pool_idx >= SIZE_POOL_COUNT) {
-        rb_bug("rb_gc_size_pool_id_for_size: allocation size too large "
-               "(size=%"PRIuSIZE"u, size_pool_idx=%"PRIuSIZE"u)", size, size_pool_idx);
-    }
-
-#if RGENGC_CHECK_MODE
-    rb_objspace_t *objspace = &rb_objspace;
-    GC_ASSERT(size <= (size_t)size_pools[size_pool_idx].slot_size);
-    if (size_pool_idx > 0) GC_ASSERT(size > (size_t)size_pools[size_pool_idx - 1].slot_size);
-#endif
-
-    return size_pool_idx;
+    shape_id_t initial_shape_id = rb_shape_id_with_robject_layout(rb_shape_root(rb_gc_heap_id_for_size(sizeof(struct RObject))));
+    VALUE obj = rb_newobj_of_with_shape(klass, T_OBJECT, initial_shape_id, sizeof(struct RObject));
+    rb_obj_init_complex(obj, rb_st_init_numtable_with_size(capacity));
+    return obj;
 }
 
-static inline VALUE
-ractor_cache_allocate_slot(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache,
-                           size_t size_pool_idx)
+VALUE
+rb_class_allocate_instance(VALUE klass)
 {
-    rb_ractor_newobj_size_pool_cache_t *size_pool_cache = &cache->size_pool_caches[size_pool_idx];
-    RVALUE *p = size_pool_cache->freelist;
-
-    if (is_incremental_marking(objspace)) {
-        // Not allowed to allocate without running an incremental marking step
-        if (cache->incremental_mark_step_allocated_slots >= INCREMENTAL_MARK_STEP_ALLOCATIONS) {
-            return Qfalse;
-        }
-
-        if (p) {
-            cache->incremental_mark_step_allocated_slots++;
-        }
-    }
+    uint32_t index_tbl_num_entries = RCLASS_MAX_IV_COUNT(klass);
+    VALUE obj;
 
-    if (p) {
-        VALUE obj = (VALUE)p;
-        MAYBE_UNUSED(const size_t) stride = size_pool_slot_size(size_pool_idx);
-        size_pool_cache->freelist = p->as.free.next;
-        asan_unpoison_memory_region(p, stride, true);
-#if RGENGC_CHECK_MODE
-        GC_ASSERT(rb_gc_obj_slot_size(obj) == stride);
-        // zero clear
-        MEMZERO((char *)obj, char, stride);
-#endif
-        return obj;
+    // Directly start as COMPLEX if we know we're over the limit.
+    RUBY_ASSERT(rb_shape_tree.max_capacity > 0);
+    if (RB_UNLIKELY(index_tbl_num_entries > rb_shape_tree.max_capacity)) {
+        obj = class_allocate_complex_instance(klass, index_tbl_num_entries);
     }
     else {
-        return Qfalse;
-    }
-}
-
-static struct heap_page *
-heap_next_free_page(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
-{
-    ASSERT_vm_locking();
-
-    struct heap_page *page;
-
-    if (heap->free_pages == NULL) {
-        heap_prepare(objspace, size_pool, heap);
-    }
-
-    page = heap->free_pages;
-    heap->free_pages = page->free_next;
-
-    GC_ASSERT(page->free_slots != 0);
-    RUBY_DEBUG_LOG("page:%p freelist:%p cnt:%d", (void *)page, (void *)page->freelist, page->free_slots);
-
-    asan_unlock_freelist(page);
-
-    return page;
-}
-
-static inline void
-ractor_cache_set_page(rb_ractor_newobj_cache_t *cache, size_t size_pool_idx,
-                      struct heap_page *page)
-{
-    gc_report(3, &rb_objspace, "ractor_set_cache: Using page %p\n", (void *)GET_PAGE_BODY(page->start));
-
-    rb_ractor_newobj_size_pool_cache_t *size_pool_cache = &cache->size_pool_caches[size_pool_idx];
-
-    GC_ASSERT(size_pool_cache->freelist == NULL);
-    GC_ASSERT(page->free_slots != 0);
-    GC_ASSERT(page->freelist != NULL);
-
-    size_pool_cache->using_page = page;
-    size_pool_cache->freelist = page->freelist;
-    page->free_slots = 0;
-    page->freelist = NULL;
-
-    asan_unpoison_object((VALUE)size_pool_cache->freelist, false);
-    GC_ASSERT(RB_TYPE_P((VALUE)size_pool_cache->freelist, T_NONE));
-    asan_poison_object((VALUE)size_pool_cache->freelist);
-}
-
-static inline VALUE
-newobj_fill(VALUE obj, VALUE v1, VALUE v2, VALUE v3)
-{
-    RVALUE *p = (RVALUE *)obj;
-    p->as.values.v1 = v1;
-    p->as.values.v2 = v2;
-    p->as.values.v3 = v3;
-    return obj;
-}
-
-static VALUE
-newobj_alloc(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t size_pool_idx, bool vm_locked)
-{
-    rb_size_pool_t *size_pool = &size_pools[size_pool_idx];
-    rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-    VALUE obj = ractor_cache_allocate_slot(objspace, cache, size_pool_idx);
-
-    if (UNLIKELY(obj == Qfalse)) {
-        unsigned int lev;
-        bool unlock_vm = false;
-
-        if (!vm_locked) {
-            RB_VM_LOCK_ENTER_CR_LEV(GET_RACTOR(), &lev);
-            vm_locked = true;
-            unlock_vm = true;
+        size_t size = rb_obj_embedded_size(index_tbl_num_entries);
+        if (!rb_gc_size_allocatable_p(size)) {
+            size = sizeof(struct RObject);
         }
 
-        {
-            ASSERT_vm_locking();
-
-            if (is_incremental_marking(objspace)) {
-                gc_continue(objspace, size_pool, heap);
-                cache->incremental_mark_step_allocated_slots = 0;
+        // There might be a NEWOBJ tracepoint callback, and it may set fields.
+        // So the shape must be passed to `NEWOBJ_OF`.
+        obj = rb_newobj_of_with_shape(klass, T_OBJECT, rb_shape_id_with_robject_layout(rb_shape_root(rb_gc_heap_id_for_size(size))), size);
 
-                // Retry allocation after resetting incremental_mark_step_allocated_slots
-                obj = ractor_cache_allocate_slot(objspace, cache, size_pool_idx);
+        #if RUBY_DEBUG
+            VALUE *ptr = ROBJECT_FIELDS(obj);
+            size_t fields_count = RSHAPE_LEN(RBASIC_SHAPE_ID(obj));
+            for (size_t i = fields_count; i < ROBJECT_FIELDS_CAPACITY(obj); i++) {
+                ptr[i] = Qundef;
             }
-
-            if (obj == Qfalse) {
-                // Get next free page (possibly running GC)
-                struct heap_page *page = heap_next_free_page(objspace, size_pool, heap);
-                ractor_cache_set_page(cache, size_pool_idx, page);
-
-                // Retry allocation after moving to new page
-                obj = ractor_cache_allocate_slot(objspace, cache, size_pool_idx);
-            }
-        }
-
-        if (unlock_vm) {
-            RB_VM_LOCK_LEAVE_CR_LEV(GET_RACTOR(), &lev);
-        }
-
-        if (UNLIKELY(obj == Qfalse)) {
-            rb_memerror();
-        }
+        #endif
     }
 
-    size_pool->total_allocated_objects++;
-
-    return obj;
-}
-
-static void
-newobj_zero_slot(VALUE obj)
-{
-    memset((char *)obj + sizeof(struct RBasic), 0, rb_gc_obj_slot_size(obj) - sizeof(struct RBasic));
-}
-
-ALWAYS_INLINE(static VALUE newobj_slowpath(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, int wb_protected, size_t size_pool_idx));
-
-static inline VALUE
-newobj_slowpath(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, int wb_protected, size_t size_pool_idx)
-{
-    VALUE obj;
-    unsigned int lev;
-
-    RB_VM_LOCK_ENTER_CR_LEV(GET_RACTOR(), &lev);
-    {
-        if (UNLIKELY(during_gc || ruby_gc_stressful)) {
-            if (during_gc) {
-                dont_gc_on();
-                during_gc = 0;
-                rb_bug("object allocation during garbage collection phase");
-            }
-
-            if (ruby_gc_stressful) {
-                if (!garbage_collect(objspace, GPR_FLAG_NEWOBJ)) {
-                    rb_memerror();
-                }
-            }
-        }
-
-        obj = newobj_alloc(objspace, cache, size_pool_idx, true);
-        newobj_init(klass, flags, wb_protected, objspace, obj);
-
-        gc_event_hook_prep(objspace, RUBY_INTERNAL_EVENT_NEWOBJ, obj, newobj_zero_slot(obj));
+#if RUBY_DEBUG
+    if (rb_obj_class(obj) != rb_class_real(klass)) {
+        rb_bug("Expected rb_class_allocate_instance to set the class correctly");
     }
-    RB_VM_LOCK_LEAVE_CR_LEV(GET_RACTOR(), &lev);
+#endif
 
     return obj;
 }
 
-NOINLINE(static VALUE newobj_slowpath_wb_protected(VALUE klass, VALUE flags,
-                                                   rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t size_pool_idx));
-NOINLINE(static VALUE newobj_slowpath_wb_unprotected(VALUE klass, VALUE flags,
-                                                     rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t size_pool_idx));
-
-static VALUE
-newobj_slowpath_wb_protected(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t size_pool_idx)
-{
-    return newobj_slowpath(klass, flags, objspace, cache, TRUE, size_pool_idx);
-}
-
-static VALUE
-newobj_slowpath_wb_unprotected(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t size_pool_idx)
-{
-    return newobj_slowpath(klass, flags, objspace, cache, FALSE, size_pool_idx);
-}
-
-static inline VALUE
-newobj_of(rb_ractor_t *cr, VALUE klass, VALUE flags, VALUE v1, VALUE v2, VALUE v3, int wb_protected, size_t alloc_size)
-{
-    VALUE obj;
-    rb_objspace_t *objspace = &rb_objspace;
-
-    RB_DEBUG_COUNTER_INC(obj_newobj);
-    (void)RB_DEBUG_COUNTER_INC_IF(obj_newobj_wb_unprotected, !wb_protected);
-
-    if (UNLIKELY(stress_to_class)) {
-        long i, cnt = RARRAY_LEN(stress_to_class);
-        for (i = 0; i < cnt; ++i) {
-            if (klass == RARRAY_AREF(stress_to_class, i)) rb_memerror();
-        }
-    }
-
-    size_t size_pool_idx = rb_gc_size_pool_id_for_size(alloc_size);
-
-    rb_ractor_newobj_cache_t *cache = &cr->newobj_cache;
-
-    if (!UNLIKELY(during_gc ||
-                  ruby_gc_stressful ||
-                  gc_event_newobj_hook_needed_p(objspace)) &&
-            wb_protected) {
-        obj = newobj_alloc(objspace, cache, size_pool_idx, false);
-        newobj_init(klass, flags, wb_protected, objspace, obj);
-    }
-    else {
-        RB_DEBUG_COUNTER_INC(obj_newobj_slowpath);
-
-        obj = wb_protected ?
-          newobj_slowpath_wb_protected(klass, flags, objspace, cache, size_pool_idx) :
-          newobj_slowpath_wb_unprotected(klass, flags, objspace, cache, size_pool_idx);
-    }
-
-    return newobj_fill(obj, v1, v2, v3);
-}
-
-VALUE
-rb_wb_unprotected_newobj_of(VALUE klass, VALUE flags, size_t size)
-{
-    GC_ASSERT((flags & FL_WB_PROTECTED) == 0);
-    return newobj_of(GET_RACTOR(), klass, flags, 0, 0, 0, FALSE, size);
-}
-
-VALUE
-rb_wb_protected_newobj_of(rb_execution_context_t *ec, VALUE klass, VALUE flags, size_t size)
+void
+rb_gc_register_pinning_obj(VALUE obj)
 {
-    GC_ASSERT((flags & FL_WB_PROTECTED) == 0);
-    return newobj_of(rb_ec_ractor_ptr(ec), klass, flags, 0, 0, 0, TRUE, size);
+    rb_gc_impl_register_pinning_obj(rb_gc_get_objspace(), obj);
 }
 
 #define UNEXPECTED_NODE(func) \
@@ -2973,27 +1139,16 @@ rb_wb_protected_newobj_of(rb_execution_context_t *ec, VALUE klass, VALUE flags,
 static inline void
 rb_data_object_check(VALUE klass)
 {
+    RUBY_ASSERT(!RCLASS_SINGLETON_P(klass));
     if (klass != rb_cObject && (rb_get_alloc_func(klass) == rb_class_allocate_instance)) {
         rb_undef_alloc_func(klass);
         rb_warn("undefining the allocator of T_DATA class %"PRIsVALUE, klass);
     }
 }
 
-VALUE
-rb_data_object_wrap(VALUE klass, void *datap, RUBY_DATA_FUNC dmark, RUBY_DATA_FUNC dfree)
-{
-    RUBY_ASSERT_ALWAYS(dfree != (RUBY_DATA_FUNC)1);
-    if (klass) rb_data_object_check(klass);
-    return newobj_of(GET_RACTOR(), klass, T_DATA, (VALUE)dmark, (VALUE)dfree, (VALUE)datap, !dmark, sizeof(struct RTypedData));
-}
-
-VALUE
-rb_data_object_zalloc(VALUE klass, size_t size, RUBY_DATA_FUNC dmark, RUBY_DATA_FUNC dfree)
-{
-    VALUE obj = rb_data_object_wrap(klass, 0, dmark, dfree);
-    DATA_PTR(obj) = xcalloc(1, size);
-    return obj;
-}
+#define RTYPEDDATA_EMBEDDED_P rbimpl_typeddata_embedded_p
+#define RB_DATA_TYPE_EMBEDDABLE_P(type) ((type)->flags & RUBY_TYPED_EMBEDDABLE)
+#define RTYPEDDATA_EMBEDDABLE_P(obj) RB_DATA_TYPE_EMBEDDABLE_P(RTYPEDDATA_TYPE(obj))
 
 static VALUE
 typed_data_alloc(VALUE klass, VALUE typed_flag, void *datap, const rb_data_type_t *type, size_t size)
@@ -3001,13 +1156,22 @@ typed_data_alloc(VALUE klass, VALUE typed_flag, void *datap, const rb_data_type_
     RBIMPL_NONNULL_ARG(type);
     if (klass) rb_data_object_check(klass);
     bool wb_protected = (type->flags & RUBY_FL_WB_PROTECTED) || !type->function.dmark;
-    return newobj_of(GET_RACTOR(), klass, T_DATA, (VALUE)type, 1 | typed_flag, (VALUE)datap, wb_protected, size);
+    VALUE obj = rb_newobj(GET_EC(), klass, T_DATA, ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_RDATA, wb_protected, size);
+
+    rb_gc_register_pinning_obj(obj);
+
+    struct RTypedData *data = (struct RTypedData *)obj;
+    data->fields_obj = 0;
+    *(VALUE *)&data->type = ((VALUE)type) | typed_flag;
+    data->data = datap;
+
+    return obj;
 }
 
 VALUE
 rb_data_typed_object_wrap(VALUE klass, void *datap, const rb_data_type_t *type)
 {
-    if (UNLIKELY(type->flags & RUBY_TYPED_EMBEDDABLE)) {
+    if (UNLIKELY(RB_DATA_TYPE_EMBEDDABLE_P(type))) {
         rb_raise(rb_eTypeError, "Cannot wrap an embeddable TypedData");
     }
 
@@ -3017,7 +1181,7 @@ rb_data_typed_object_wrap(VALUE klass, void *datap, const rb_data_type_t *type)
 VALUE
 rb_data_typed_object_zalloc(VALUE klass, size_t size, const rb_data_type_t *type)
 {
-    if (type->flags & RUBY_TYPED_EMBEDDABLE) {
+    if (RB_DATA_TYPE_EMBEDDABLE_P(type)) {
         if (!(type->flags & RUBY_TYPED_FREE_IMMEDIATELY)) {
             rb_raise(rb_eTypeError, "Embeddable TypedData must be freed immediately");
         }
@@ -3036,20 +1200,33 @@ rb_data_typed_object_zalloc(VALUE klass, size_t size, const rb_data_type_t *type
 }
 
 static size_t
+ruby_xmalloc_usable_size(void *ptr)
+{
+#ifdef HAVE_MALLOC_USABLE_SIZE
+#if CALC_EXACT_MALLOC_SIZE
+    struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
+    return malloc_usable_size(info) - sizeof(struct malloc_obj_info);
+#else
+    return malloc_usable_size(ptr);
+#endif
+#else
+    return 0;
+#endif
+}
+
+static size_t
 rb_objspace_data_type_memsize(VALUE obj)
 {
     size_t size = 0;
-    if (RTYPEDDATA_P(obj)) {
-        const rb_data_type_t *type = RTYPEDDATA_TYPE(obj);
-        const void *ptr = RTYPEDDATA_GET_DATA(obj);
+    const void *ptr = RTYPEDDATA_GET_DATA(obj);
 
-        if (RTYPEDDATA_TYPE(obj)->flags & RUBY_TYPED_EMBEDDABLE && !RTYPEDDATA_EMBEDDED_P(obj)) {
-#ifdef HAVE_MALLOC_USABLE_SIZE
-            size += malloc_usable_size((void *)ptr);
-#endif
+    if (ptr) {
+        if (RTYPEDDATA_EMBEDDABLE_P(obj) && !RTYPEDDATA_EMBEDDED_P(obj)) {
+            size += ruby_xmalloc_usable_size((void *)ptr);
         }
 
-        if (ptr && type->function.dsize) {
+        const rb_data_type_t *type = RTYPEDDATA_TYPE(obj);
+        if (type->function.dsize) {
             size += type->function.dsize(ptr);
         }
     }
@@ -3060,150 +1237,232 @@ rb_objspace_data_type_memsize(VALUE obj)
 const char *
 rb_objspace_data_type_name(VALUE obj)
 {
-    if (RTYPEDDATA_P(obj)) {
-        return RTYPEDDATA_TYPE(obj)->wrap_struct_name;
-    }
-    else {
-        return 0;
-    }
+    return RTYPEDDATA_TYPE(obj)->wrap_struct_name;
 }
 
-static int
-ptr_in_page_body_p(const void *ptr, const void *memb)
+void
+rb_gc_declare_weak_references(VALUE obj)
 {
-    struct heap_page *page = *(struct heap_page **)memb;
-    uintptr_t p_body = (uintptr_t)GET_PAGE_BODY(page->start);
+    rb_gc_impl_declare_weak_references(rb_gc_get_objspace(), obj);
+}
 
-    if ((uintptr_t)ptr >= p_body) {
-        return (uintptr_t)ptr < (p_body + HEAP_PAGE_SIZE) ? 0 : 1;
-    }
-    else {
-        return -1;
-    }
+bool
+rb_gc_handle_weak_references_alive_p(VALUE obj)
+{
+    if (SPECIAL_CONST_P(obj)) return true;
+
+    return rb_gc_impl_handle_weak_references_alive_p(rb_gc_get_objspace(), obj);
 }
 
-PUREFUNC(static inline struct heap_page * heap_page_for_ptr(rb_objspace_t *objspace, uintptr_t ptr);)
-static inline struct heap_page *
-heap_page_for_ptr(rb_objspace_t *objspace, uintptr_t ptr)
+void
+rb_gc_handle_weak_references(VALUE obj)
 {
-    struct heap_page **res;
+    switch (BUILTIN_TYPE(obj)) {
+      case T_DATA:
+        {
+            const rb_data_type_t *type = RTYPEDDATA_TYPE(obj);
 
-    if (ptr < (uintptr_t)heap_pages_lomem ||
-            ptr > (uintptr_t)heap_pages_himem) {
-        return NULL;
-    }
+            if (type->function.handle_weak_references) {
+                (type->function.handle_weak_references)(RTYPEDDATA_GET_DATA(obj));
+            }
+            else {
+                rb_bug(
+                    "rb_gc_handle_weak_references: TypedData %s does not implement handle_weak_references",
+                    RTYPEDDATA_TYPE(obj)->wrap_struct_name
+                );
+            }
+        }
+        break;
 
-    res = bsearch((void *)ptr, heap_pages_sorted,
-                  (size_t)heap_allocated_pages, sizeof(struct heap_page *),
-                  ptr_in_page_body_p);
+      case T_IMEMO: {
+        switch (imemo_type(obj)) {
+          case imemo_callcache: {
+            struct rb_callcache *cc = (struct rb_callcache *)obj;
+            if (cc->klass != Qundef &&
+                (!rb_gc_handle_weak_references_alive_p(cc->klass) ||
+                 !rb_gc_handle_weak_references_alive_p((VALUE)cc->cme_))) {
+                vm_cc_invalidate(cc);
+            }
+            break;
+          }
+          case imemo_subclasses: {
+            struct rb_subclasses *subs = (struct rb_subclasses *)obj;
+            VALUE *entries = rb_imemo_subclasses_entries(obj);
+            for (uint32_t i = 0; i < subs->count; i++) {
+                if (entries[i] && !rb_gc_handle_weak_references_alive_p(entries[i])) {
+                    entries[i] = 0;
+                }
+            }
+            break;
+          }
+          default:
+            rb_bug("rb_gc_handle_weak_references: unexpected imemo type");
+        }
 
-    if (res) {
-        return *res;
+        break;
+      }
+      default:
+        rb_bug("rb_gc_handle_weak_references: type not supported\n");
     }
-    else {
-        return NULL;
+}
+
+static inline bool
+rb_gc_imemo_needs_cleanup_p(VALUE obj)
+{
+    switch (imemo_type(obj)) {
+      case imemo_constcache:
+      case imemo_cref:
+      case imemo_ifunc:
+      case imemo_memo:
+      case imemo_svar:
+      case imemo_callcache:
+      case imemo_throw_data:
+      case imemo_cvar_entry:
+        return false;
+
+      case imemo_env:
+      case imemo_ment:
+      case imemo_iseq:
+      case imemo_callinfo:
+      case imemo_cdhash:
+        return true;
+
+      case imemo_subclasses:
+        return FL_TEST_RAW(obj, IMEMO_SUBCLASSES_HEAP);
+
+      case imemo_tmpbuf:
+        return ((rb_imemo_tmpbuf_t *)obj)->ptr != NULL;
+
+      case imemo_fields:
+        return FL_TEST_RAW(obj, OBJ_FIELD_HEAP) || (id2ref_tbl && rb_obj_shape_has_id(obj));
     }
+    UNREACHABLE_RETURN(true);
 }
 
-PUREFUNC(static inline int is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr);)
-static inline int
-is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr)
+/*
+ * Returns true if the object requires a full rb_gc_obj_free() call during sweep,
+ * false if it can be freed quickly without calling destructors or cleanup.
+ *
+ * Objects that return false are:
+ * - Simple embedded objects without external allocations
+ * - Objects without finalizers
+ * - Objects without object IDs registered in id2ref
+ * - Objects without generic instance variables
+ *
+ * This is used by the GC sweep fast path to avoid function call overhead
+ * for the majority of simple objects.
+ */
+bool
+rb_gc_obj_needs_cleanup_p(VALUE obj)
 {
-    register uintptr_t p = (uintptr_t)ptr;
-    register struct heap_page *page;
+    VALUE flags = RBASIC(obj)->flags;
 
-    RB_DEBUG_COUNTER_INC(gc_isptr_trial);
+    if (flags & FL_FINALIZE) return true;
 
-    if (p < heap_pages_lomem || p > heap_pages_himem) return FALSE;
-    RB_DEBUG_COUNTER_INC(gc_isptr_range);
+    switch (flags & RUBY_T_MASK) {
+      case T_IMEMO:
+        return rb_gc_imemo_needs_cleanup_p(obj);
+
+      case T_DATA:
+      case T_OBJECT:
+      case T_STRING:
+      case T_ARRAY:
+      case T_HASH:
+      case T_BIGNUM:
+      case T_STRUCT:
+      case T_FLOAT:
+      case T_RATIONAL:
+      case T_COMPLEX:
+      case T_MATCH:
+        break;
 
-    if (p % BASE_SLOT_SIZE != 0) return FALSE;
-    RB_DEBUG_COUNTER_INC(gc_isptr_align);
+      case T_FILE:
+      case T_SYMBOL:
+      case T_CLASS:
+      case T_ICLASS:
+      case T_MODULE:
+      case T_REGEXP:
+        return true;
+    }
 
-    page = heap_page_for_ptr(objspace, (uintptr_t)ptr);
-    if (page) {
-        RB_DEBUG_COUNTER_INC(gc_isptr_maybe);
-        if (page->flags.in_tomb) {
-            return FALSE;
-        }
-        else {
-            if (p < page->start) return FALSE;
-            if (p >= page->start + (page->total_slots * page->slot_size)) return FALSE;
-            if ((NUM_IN_PAGE(p) * BASE_SLOT_SIZE) % page->slot_size != 0) return FALSE;
+    shape_id_t shape_id = RBASIC_SHAPE_ID(obj);
+    if (id2ref_tbl && rb_shape_has_object_id(shape_id)) return true;
 
-            return TRUE;
+    switch (flags & RUBY_T_MASK) {
+      case T_OBJECT:
+        if (flags & ROBJECT_HEAP) return true;
+        return false;
+
+      case T_DATA:
+        {
+            uintptr_t type = (uintptr_t)RTYPEDDATA(obj)->type;
+            if (type & TYPED_DATA_EMBEDDED) {
+                RUBY_DATA_FUNC dfree = ((const rb_data_type_t *)(type & TYPED_DATA_PTR_MASK))->function.dfree;
+                if (dfree == RUBY_NEVER_FREE || dfree == RUBY_TYPED_DEFAULT_FREE) {
+                    return false;
+                }
+            }
         }
-    }
-    return FALSE;
-}
+        return true;
 
-static enum rb_id_table_iterator_result
-cvar_table_free_i(VALUE value, void *ctx)
-{
-    xfree((void *)value);
-    return ID_TABLE_CONTINUE;
-}
+      case T_STRING:
+        if (flags & (RSTRING_NOEMBED | RSTRING_FSTR)) return true;
+        return rb_shape_has_fields(shape_id);
 
-#define ZOMBIE_OBJ_KEPT_FLAGS (FL_SEEN_OBJ_ID | FL_FINALIZE)
+      case T_ARRAY:
+        if (!(flags & RARRAY_EMBED_FLAG)) return true;
+        return rb_shape_has_fields(shape_id);
 
-static inline void
-make_zombie(rb_objspace_t *objspace, VALUE obj, void (*dfree)(void *), void *data)
-{
-    struct RZombie *zombie = RZOMBIE(obj);
-    zombie->basic.flags = T_ZOMBIE | (zombie->basic.flags & ZOMBIE_OBJ_KEPT_FLAGS);
-    zombie->dfree = dfree;
-    zombie->data = data;
-    VALUE prev, next = heap_pages_deferred_final;
-    do {
-        zombie->next = prev = next;
-        next = RUBY_ATOMIC_VALUE_CAS(heap_pages_deferred_final, prev, obj);
-    } while (next != prev);
+      case T_HASH:
+        if (flags & RHASH_ST_TABLE_FLAG) return true;
+        return rb_shape_has_fields(shape_id);
 
-    struct heap_page *page = GET_HEAP_PAGE(obj);
-    page->final_slots++;
-    heap_pages_final_slots++;
-}
+      case T_MATCH:
+        if ((flags & (RMATCH_ONIG | RMATCH_OFFSETS_EXTERNAL)) || USE_DEBUG_COUNTER) return true;
+        return rb_shape_has_fields(shape_id);
 
-static inline void
-make_io_zombie(rb_objspace_t *objspace, VALUE obj)
-{
-    rb_io_t *fptr = RANY(obj)->as.file.fptr;
-    make_zombie(objspace, obj, rb_io_fptr_finalize_internal, fptr);
+      case T_BIGNUM:
+        if (!(flags & BIGNUM_EMBED_FLAG)) return true;
+        return rb_shape_has_fields(shape_id);
+
+      case T_STRUCT:
+        if (!(flags & RSTRUCT_EMBED_LEN_MASK)) return true;
+        if (flags & RSTRUCT_GEN_FIELDS) return rb_shape_has_fields(shape_id);
+        return false;
+
+      case T_FLOAT:
+      case T_RATIONAL:
+      case T_COMPLEX:
+        return rb_shape_has_fields(shape_id);
+
+      default:
+        UNREACHABLE_RETURN(true);
+    }
 }
 
 static void
-obj_free_object_id(rb_objspace_t *objspace, VALUE obj)
+io_fptr_finalize(void *fptr)
 {
-    ASSERT_vm_locking();
-    st_data_t o = (st_data_t)obj, id;
-
-    GC_ASSERT(FL_TEST(obj, FL_SEEN_OBJ_ID));
-    FL_UNSET(obj, FL_SEEN_OBJ_ID);
+    rb_io_fptr_finalize((struct rb_io *)fptr);
+}
 
-    if (st_delete(objspace->obj_to_id_tbl, &o, &id)) {
-        GC_ASSERT(id);
-        st_delete(objspace->id_to_obj_tbl, &id, NULL);
-    }
-    else {
-        rb_bug("Object ID seen, but not in mapping table: %s", obj_info(obj));
-    }
+static inline void
+make_io_zombie(void *objspace, VALUE obj)
+{
+    rb_io_t *fptr = RFILE(obj)->fptr;
+    rb_gc_impl_make_zombie(objspace, obj, io_fptr_finalize, fptr);
 }
 
 static bool
-rb_data_free(rb_objspace_t *objspace, VALUE obj)
+rb_data_free(void *objspace, VALUE obj)
 {
-    void *data = RTYPEDDATA_P(obj) ? RTYPEDDATA_GET_DATA(obj) : DATA_PTR(obj);
+    void *data = RTYPEDDATA_GET_DATA(obj);
     if (data) {
         int free_immediately = false;
         void (*dfree)(void *);
 
-        if (RTYPEDDATA_P(obj)) {
-            free_immediately = (RANY(obj)->as.typeddata.type->flags & RUBY_TYPED_FREE_IMMEDIATELY) != 0;
-            dfree = RANY(obj)->as.typeddata.type->function.dfree;
-        }
-        else {
-            dfree = RANY(obj)->as.data.dfree;
-        }
+        free_immediately = (RTYPEDDATA_TYPE(obj)->flags & RUBY_TYPED_FREE_IMMEDIATELY) != 0;
+        dfree = RTYPEDDATA_TYPE(obj)->function.dfree;
 
         if (dfree) {
             if (dfree == RUBY_DEFAULT_FREE) {
@@ -3214,14 +1473,14 @@ rb_data_free(rb_objspace_t *objspace, VALUE obj)
             }
             else if (free_immediately) {
                 (*dfree)(data);
-                if (RTYPEDDATA_TYPE(obj)->flags & RUBY_TYPED_EMBEDDABLE && !RTYPEDDATA_EMBEDDED_P(obj)) {
+                if (RTYPEDDATA_EMBEDDABLE_P(obj) && !RTYPEDDATA_EMBEDDED_P(obj)) {
                     xfree(data);
                 }
 
                 RB_DEBUG_COUNTER_INC(obj_data_imm_free);
             }
             else {
-                make_zombie(objspace, obj, dfree, data);
+                rb_gc_impl_make_zombie(objspace, obj, dfree, data);
                 RB_DEBUG_COUNTER_INC(obj_data_zombie);
                 return FALSE;
             }
@@ -3234,13 +1493,33 @@ rb_data_free(rb_objspace_t *objspace, VALUE obj)
     return true;
 }
 
-static int
-obj_free(rb_objspace_t *objspace, VALUE obj)
+struct classext_foreach_args {
+    VALUE klass;
+    rb_objspace_t *objspace; // used for update_*
+};
+
+static void
+classext_free(rb_classext_t *ext, bool is_prime, VALUE box_value, void *arg)
 {
-    RB_DEBUG_COUNTER_INC(obj_free);
-    // RUBY_DEBUG_LOG("obj:%p (%s)", (void *)obj, obj_type_name(obj));
+    struct classext_foreach_args *args = (struct classext_foreach_args *)arg;
+
+    rb_class_classext_free(args->klass, ext, is_prime);
+}
+
+static void
+classext_iclass_free(rb_classext_t *ext, bool is_prime, VALUE box_value, void *arg)
+{
+    struct classext_foreach_args *args = (struct classext_foreach_args *)arg;
+
+    rb_iclass_classext_free(args->klass, ext, is_prime);
+}
 
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_FREEOBJ, obj);
+bool
+rb_gc_obj_free(void *objspace, VALUE obj)
+{
+    struct classext_foreach_args args;
+
+    RB_DEBUG_COUNTER_INC(obj_free);
 
     switch (BUILTIN_TYPE(obj)) {
       case T_NIL:
@@ -3253,65 +1532,32 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
         break;
     }
 
-    if (FL_TEST(obj, FL_EXIVAR)) {
-        rb_free_generic_ivar((VALUE)obj);
-        FL_UNSET(obj, FL_EXIVAR);
-    }
-
-    if (FL_TEST(obj, FL_SEEN_OBJ_ID) && !FL_TEST(obj, FL_FINALIZE)) {
-        obj_free_object_id(objspace, obj);
-    }
-
-    if (RVALUE_WB_UNPROTECTED(obj)) CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
-
-#if RGENGC_CHECK_MODE
-#define CHECK(x) if (x(obj) != FALSE) rb_bug("obj_free: " #x "(%s) != FALSE", obj_info(obj))
-        CHECK(RVALUE_WB_UNPROTECTED);
-        CHECK(RVALUE_MARKED);
-        CHECK(RVALUE_MARKING);
-        CHECK(RVALUE_UNCOLLECTIBLE);
-#undef CHECK
-#endif
-
     switch (BUILTIN_TYPE(obj)) {
       case T_OBJECT:
-        if (rb_shape_obj_too_complex(obj)) {
-            RB_DEBUG_COUNTER_INC(obj_obj_too_complex);
-            st_free_table(ROBJECT_IV_HASH(obj));
-        }
-        else if (RANY(obj)->as.basic.flags & ROBJECT_EMBED) {
-            RB_DEBUG_COUNTER_INC(obj_obj_embed);
+        if (FL_TEST_RAW(obj, ROBJECT_HEAP)) {
+            if (rb_obj_shape_complex_p(obj)) {
+                RB_DEBUG_COUNTER_INC(obj_obj_complex);
+                st_free_table(ROBJECT_FIELDS_HASH(obj));
+            }
+            else {
+                SIZED_FREE_N(ROBJECT(obj)->as.heap.fields, ROBJECT_FIELDS_CAPACITY(obj));
+                RB_DEBUG_COUNTER_INC(obj_obj_ptr);
+            }
         }
         else {
-            xfree(RANY(obj)->as.object.as.heap.ivptr);
-            RB_DEBUG_COUNTER_INC(obj_obj_ptr);
+            RB_DEBUG_COUNTER_INC(obj_obj_embed);
         }
         break;
       case T_MODULE:
       case T_CLASS:
-        rb_id_table_free(RCLASS_M_TBL(obj));
-        rb_cc_table_free(obj);
-        if (rb_shape_obj_too_complex(obj)) {
-            st_free_table((st_table *)RCLASS_IVPTR(obj));
-        }
-        else {
-            xfree(RCLASS_IVPTR(obj));
-        }
-
-        if (RCLASS_CONST_TBL(obj)) {
-            rb_free_const_table(RCLASS_CONST_TBL(obj));
-        }
-        if (RCLASS_CVC_TBL(obj)) {
-            rb_id_table_foreach_values(RCLASS_CVC_TBL(obj), cvar_table_free_i, NULL);
-            rb_id_table_free(RCLASS_CVC_TBL(obj));
-        }
-        rb_class_remove_subclass_head(obj);
-        rb_class_remove_from_module_subclasses(obj);
-        rb_class_remove_from_super_subclasses(obj);
-        if (FL_TEST_RAW(obj, RCLASS_SUPERCLASSES_INCLUDE_SELF)) {
-            xfree(RCLASS_SUPERCLASSES(obj));
+#if USE_ZJIT
+        rb_zjit_klass_free(obj);
+#endif
+        args.klass = obj;
+        rb_class_classext_foreach(obj, classext_free, (void *)&args);
+        if (RCLASS_CLASSEXT_TBL(obj)) {
+            st_free_table(RCLASS_CLASSEXT_TBL(obj));
         }
-
         (void)RB_DEBUG_COUNTER_INC_IF(obj_module_ptr, BUILTIN_TYPE(obj) == T_MODULE);
         (void)RB_DEBUG_COUNTER_INC_IF(obj_class_ptr, BUILTIN_TYPE(obj) == T_CLASS);
         break;
@@ -3366,8 +1612,8 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
         rb_hash_free(obj);
         break;
       case T_REGEXP:
-        if (RANY(obj)->as.regexp.ptr) {
-            onig_free(RANY(obj)->as.regexp.ptr);
+        if (RREGEXP(obj)->ptr) {
+            onig_free(RREGEXP(obj)->ptr);
             RB_DEBUG_COUNTER_INC(obj_regexp_ptr);
         }
         break;
@@ -3376,29 +1622,32 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
         break;
       case T_MATCH:
         {
-            rb_matchext_t *rm = RMATCH_EXT(obj);
+            struct RMatch *rm = RMATCH(obj);
 #if USE_DEBUG_COUNTER
-            if (rm->regs.num_regs >= 8) {
+            if (rm->num_regs >= 8) {
                 RB_DEBUG_COUNTER_INC(obj_match_ge8);
             }
-            else if (rm->regs.num_regs >= 4) {
+            else if (rm->num_regs >= 4) {
                 RB_DEBUG_COUNTER_INC(obj_match_ge4);
             }
-            else if (rm->regs.num_regs >= 1) {
+            else if (rm->num_regs >= 1) {
                 RB_DEBUG_COUNTER_INC(obj_match_under4);
             }
 #endif
-            onig_region_free(&rm->regs, 0);
-            xfree(rm->char_offset);
+            if (FL_TEST_RAW(obj, RMATCH_ONIG)) {
+                onig_region_free(&rm->as.onig, 0);
+            }
+            SIZED_FREE_N(rm->char_offset, rm->char_offset_num_allocated);
 
             RB_DEBUG_COUNTER_INC(obj_match_ptr);
         }
         break;
       case T_FILE:
-        if (RANY(obj)->as.file.fptr) {
-            make_io_zombie(objspace, obj);
+        if (RFILE(obj)->fptr) {
+            bool closed = rb_io_fptr_finalize_closed(RFILE(obj)->fptr);
+            if (!closed) make_io_zombie(objspace, obj);
             RB_DEBUG_COUNTER_INC(obj_file_ptr);
-            return FALSE;
+            return closed;
         }
         break;
       case T_RATIONAL:
@@ -3410,18 +1659,12 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
       case T_MOVED:
         break;
       case T_ICLASS:
-        /* Basically , T_ICLASS shares table with the module */
-        if (RICLASS_OWNS_M_TBL_P(obj)) {
-            /* Method table is not shared for origin iclasses of classes */
-            rb_id_table_free(RCLASS_M_TBL(obj));
-        }
-        if (RCLASS_CALLABLE_M_TBL(obj) != NULL) {
-            rb_id_table_free(RCLASS_CALLABLE_M_TBL(obj));
+        args.klass = obj;
+
+        rb_class_classext_foreach(obj, classext_iclass_free, (void *)&args);
+        if (RCLASS_CLASSEXT_TBL(obj)) {
+            st_free_table(RCLASS_CLASSEXT_TBL(obj));
         }
-        rb_class_remove_subclass_head(obj);
-        rb_cc_table_free(obj);
-        rb_class_remove_from_module_subclasses(obj);
-        rb_class_remove_from_super_subclasses(obj);
 
         RB_DEBUG_COUNTER_INC(obj_iclass_ptr);
         break;
@@ -3432,7 +1675,7 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
 
       case T_BIGNUM:
         if (!BIGNUM_EMBED_P(obj) && BIGNUM_DIGITS(obj)) {
-            xfree(BIGNUM_DIGITS(obj));
+            SIZED_FREE_N(BIGNUM_DIGITS(obj), BIGNUM_LEN(obj));
             RB_DEBUG_COUNTER_INC(obj_bignum_ptr);
         }
         else {
@@ -3446,20 +1689,17 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
 
       case T_STRUCT:
         if ((RBASIC(obj)->flags & RSTRUCT_EMBED_LEN_MASK) ||
-            RANY(obj)->as.rstruct.as.heap.ptr == NULL) {
+            RSTRUCT(obj)->as.heap.ptr == NULL) {
             RB_DEBUG_COUNTER_INC(obj_struct_embed);
         }
         else {
-            xfree((void *)RANY(obj)->as.rstruct.as.heap.ptr);
+            SIZED_FREE_N(RSTRUCT(obj)->as.heap.ptr, RSTRUCT(obj)->as.heap.len);
             RB_DEBUG_COUNTER_INC(obj_struct_ptr);
         }
         break;
 
       case T_SYMBOL:
-        {
-            rb_gc_free_dsymbol(obj);
-            RB_DEBUG_COUNTER_INC(obj_symbol);
-        }
+        RB_DEBUG_COUNTER_INC(obj_symbol);
         break;
 
       case T_IMEMO:
@@ -3471,313 +1711,27 @@ obj_free(rb_objspace_t *objspace, VALUE obj)
                BUILTIN_TYPE(obj), (void*)obj, RBASIC(obj)->flags);
     }
 
-    if (FL_TEST(obj, FL_FINALIZE)) {
-        make_zombie(objspace, obj, 0, 0);
+    if (FL_TEST_RAW(obj, FL_FINALIZE)) {
+        rb_gc_impl_make_zombie(objspace, obj, 0, 0);
         return FALSE;
     }
     else {
-        RBASIC(obj)->flags = 0;
         return TRUE;
     }
 }
 
-
-#define OBJ_ID_INCREMENT (BASE_SLOT_SIZE)
-#define OBJ_ID_INITIAL (OBJ_ID_INCREMENT)
-
-static int
-object_id_cmp(st_data_t x, st_data_t y)
-{
-    if (RB_BIGNUM_TYPE_P(x)) {
-        return !rb_big_eql(x, y);
-    }
-    else {
-        return x != y;
-    }
-}
-
-static st_index_t
-object_id_hash(st_data_t n)
-{
-    if (RB_BIGNUM_TYPE_P(n)) {
-        return FIX2LONG(rb_big_hash(n));
-    }
-    else {
-        return st_numhash(n);
-    }
-}
-static const struct st_hash_type object_id_hash_type = {
-    object_id_cmp,
-    object_id_hash,
-};
-
-static void *
-rb_gc_impl_objspace_alloc(void)
-{
-    rb_objspace_t *objspace = calloc1(sizeof(rb_objspace_t));
-    ruby_current_vm_ptr->objspace = objspace;
-
-    objspace->flags.gc_stressful = RTEST(initial_stress);
-    objspace->gc_stress_mode = initial_stress;
-
-    objspace->flags.measure_gc = 1;
-    malloc_limit = gc_params.malloc_limit_min;
-    objspace->finalize_deferred_pjob = rb_postponed_job_preregister(0, gc_finalize_deferred, objspace);
-    if (objspace->finalize_deferred_pjob == POSTPONED_JOB_HANDLE_INVALID) {
-        rb_bug("Could not preregister postponed job for GC");
-    }
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-
-        size_pool->slot_size = (1 << i) * BASE_SLOT_SIZE;
-
-        ccan_list_head_init(&SIZE_POOL_EDEN_HEAP(size_pool)->pages);
-        ccan_list_head_init(&SIZE_POOL_TOMB_HEAP(size_pool)->pages);
-    }
-
-    rb_darray_make(&objspace->weak_references, 0);
-
-    // TODO: debug why on Windows Ruby crashes on boot when GC is on.
-#ifdef _WIN32
-    dont_gc_on();
-#endif
-
-#if defined(INIT_HEAP_PAGE_ALLOC_USE_MMAP)
-    /* Need to determine if we can use mmap at runtime. */
-    heap_page_alloc_use_mmap = INIT_HEAP_PAGE_ALLOC_USE_MMAP;
-#endif
-
-    objspace->next_object_id = OBJ_ID_INITIAL;
-    objspace->id_to_obj_tbl = st_init_table(&object_id_hash_type);
-    objspace->obj_to_id_tbl = st_init_numtable();
-
-#if RGENGC_ESTIMATE_OLDMALLOC
-    objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
-#endif
-
-    /* Set size pools allocatable pages. */
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-
-        /* Set the default value of size_pool_init_slots. */
-        gc_params.size_pool_init_slots[i] = GC_HEAP_INIT_SLOTS;
-
-        size_pool->allocatable_pages = minimum_pages_for_size_pool(objspace, size_pool);
-    }
-    heap_pages_expand_sorted(objspace);
-
-    init_mark_stack(&objspace->mark_stack);
-
-    objspace->profile.invoke_time = getrusage_time();
-    finalizer_table = st_init_numtable();
-    return objspace;
-}
-
-typedef int each_obj_callback(void *, void *, size_t, void *);
-typedef int each_page_callback(struct heap_page *, void *);
-
-static void objspace_each_objects(rb_objspace_t *objspace, each_obj_callback *callback, void *data, bool protected);
-static void objspace_reachable_objects_from_root(rb_objspace_t *, void (func)(const char *, VALUE, void *), void *);
-
-struct each_obj_data {
-    rb_objspace_t *objspace;
-    bool reenable_incremental;
-
-    each_obj_callback *each_obj_callback;
-    each_page_callback *each_page_callback;
-    void *data;
-
-    struct heap_page **pages[SIZE_POOL_COUNT];
-    size_t pages_counts[SIZE_POOL_COUNT];
-};
-
-static VALUE
-objspace_each_objects_ensure(VALUE arg)
-{
-    struct each_obj_data *data = (struct each_obj_data *)arg;
-    rb_objspace_t *objspace = data->objspace;
-
-    /* Reenable incremental GC */
-    if (data->reenable_incremental) {
-        objspace->flags.dont_incremental = FALSE;
-    }
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        struct heap_page **pages = data->pages[i];
-        free(pages);
-    }
-
-    return Qnil;
-}
-
-static VALUE
-objspace_each_objects_try(VALUE arg)
-{
-    struct each_obj_data *data = (struct each_obj_data *)arg;
-    rb_objspace_t *objspace = data->objspace;
-
-    /* Copy pages from all size_pools to their respective buffers. */
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        size_t size = size_mul_or_raise(SIZE_POOL_EDEN_HEAP(size_pool)->total_pages, sizeof(struct heap_page *), rb_eRuntimeError);
-
-        struct heap_page **pages = malloc(size);
-        if (!pages) rb_memerror();
-
-        /* Set up pages buffer by iterating over all pages in the current eden
-         * heap. This will be a snapshot of the state of the heap before we
-         * call the callback over each page that exists in this buffer. Thus it
-         * is safe for the callback to allocate objects without possibly entering
-         * an infinite loop. */
-        struct heap_page *page = 0;
-        size_t pages_count = 0;
-        ccan_list_for_each(&SIZE_POOL_EDEN_HEAP(size_pool)->pages, page, page_node) {
-            pages[pages_count] = page;
-            pages_count++;
-        }
-        data->pages[i] = pages;
-        data->pages_counts[i] = pages_count;
-        GC_ASSERT(pages_count == SIZE_POOL_EDEN_HEAP(size_pool)->total_pages);
-    }
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        size_t pages_count = data->pages_counts[i];
-        struct heap_page **pages = data->pages[i];
-
-        struct heap_page *page = ccan_list_top(&SIZE_POOL_EDEN_HEAP(size_pool)->pages, struct heap_page, page_node);
-        for (size_t i = 0; i < pages_count; i++) {
-            /* If we have reached the end of the linked list then there are no
-             * more pages, so break. */
-            if (page == NULL) break;
-
-            /* If this page does not match the one in the buffer, then move to
-             * the next page in the buffer. */
-            if (pages[i] != page) continue;
-
-            uintptr_t pstart = (uintptr_t)page->start;
-            uintptr_t pend = pstart + (page->total_slots * size_pool->slot_size);
-
-            if (data->each_obj_callback &&
-                (*data->each_obj_callback)((void *)pstart, (void *)pend, size_pool->slot_size, data->data)) {
-                break;
-            }
-            if (data->each_page_callback &&
-                (*data->each_page_callback)(page, data->data)) {
-                break;
-            }
-
-            page = ccan_list_next(&SIZE_POOL_EDEN_HEAP(size_pool)->pages, page, page_node);
-        }
-    }
-
-    return Qnil;
-}
-
-/*
- * rb_objspace_each_objects() is special C API to walk through
- * Ruby object space.  This C API is too difficult to use it.
- * To be frank, you should not use it. Or you need to read the
- * source code of this function and understand what this function does.
- *
- * 'callback' will be called several times (the number of heap page,
- * at current implementation) with:
- *   vstart: a pointer to the first living object of the heap_page.
- *   vend: a pointer to next to the valid heap_page area.
- *   stride: a distance to next VALUE.
- *
- * If callback() returns non-zero, the iteration will be stopped.
- *
- * This is a sample callback code to iterate liveness objects:
- *
- *   static int
- *   sample_callback(void *vstart, void *vend, int stride, void *data)
- *   {
- *       VALUE v = (VALUE)vstart;
- *       for (; v != (VALUE)vend; v += stride) {
- *           if (!rb_objspace_internal_object_p(v)) { // liveness check
- *               // do something with live object 'v'
- *           }
- *       }
- *       return 0; // continue to iteration
- *   }
- *
- * Note: 'vstart' is not a top of heap_page.  This point the first
- *       living object to grasp at least one object to avoid GC issue.
- *       This means that you can not walk through all Ruby object page
- *       including freed object page.
- *
- * Note: On this implementation, 'stride' is the same as sizeof(RVALUE).
- *       However, there are possibilities to pass variable values with
- *       'stride' with some reasons.  You must use stride instead of
- *       use some constant value in the iteration.
- */
 void
-rb_objspace_each_objects(each_obj_callback *callback, void *data)
-{
-    objspace_each_objects(&rb_objspace, callback, data, TRUE);
-}
-
-static void
-objspace_each_exec(bool protected, struct each_obj_data *each_obj_data)
-{
-    /* Disable incremental GC */
-    rb_objspace_t *objspace = each_obj_data->objspace;
-    bool reenable_incremental = FALSE;
-    if (protected) {
-        reenable_incremental = !objspace->flags.dont_incremental;
-
-        gc_rest(objspace);
-        objspace->flags.dont_incremental = TRUE;
-    }
-
-    each_obj_data->reenable_incremental = reenable_incremental;
-    memset(&each_obj_data->pages, 0, sizeof(each_obj_data->pages));
-    memset(&each_obj_data->pages_counts, 0, sizeof(each_obj_data->pages_counts));
-    rb_ensure(objspace_each_objects_try, (VALUE)each_obj_data,
-              objspace_each_objects_ensure, (VALUE)each_obj_data);
-}
-
-static void
-objspace_each_objects(rb_objspace_t *objspace, each_obj_callback *callback, void *data, bool protected)
-{
-    struct each_obj_data each_obj_data = {
-        .objspace = objspace,
-        .each_obj_callback = callback,
-        .each_page_callback = NULL,
-        .data = data,
-    };
-    objspace_each_exec(protected, &each_obj_data);
-}
-
-#if GC_CAN_COMPILE_COMPACTION
-static void
-objspace_each_pages(rb_objspace_t *objspace, each_page_callback *callback, void *data, bool protected)
+rb_objspace_set_event_hook(const rb_event_flag_t event)
 {
-    struct each_obj_data each_obj_data = {
-        .objspace = objspace,
-        .each_obj_callback = NULL,
-        .each_page_callback = callback,
-        .data = data,
-    };
-    objspace_each_exec(protected, &each_obj_data);
+    rb_gc_impl_set_event_hook(rb_gc_get_objspace(), event);
 }
-#endif
-
-struct os_each_struct {
-    size_t num;
-    VALUE of;
-};
 
 static int
 internal_object_p(VALUE obj)
 {
-    RVALUE *p = (RVALUE *)obj;
     void *ptr = asan_unpoison_object_temporary(obj);
-    bool used_p = p->as.basic.flags;
 
-    if (used_p) {
+    if (RBASIC(obj)->flags) {
         switch (BUILTIN_TYPE(obj)) {
           case T_NODE:
             UNEXPECTED_NODE(internal_object_p);
@@ -3789,18 +1743,21 @@ internal_object_p(VALUE obj)
           case T_ZOMBIE:
             break;
           case T_CLASS:
-            if (!p->as.basic.klass) break;
+            if (obj == rb_mRubyVMFrozenCore)
+                return 1;
+
+            if (!RBASIC_CLASS(obj)) break;
             if (RCLASS_SINGLETON_P(obj)) {
                 return rb_singleton_class_internal_p(obj);
             }
             return 0;
           default:
-            if (!p->as.basic.klass) break;
+            if (!RBASIC(obj)->klass) break;
             return 0;
         }
     }
-    if (ptr || ! used_p) {
-        asan_poison_object(obj);
+    if (ptr || !RBASIC(obj)->flags) {
+        rb_asan_poison_object(obj);
     }
     return 1;
 }
@@ -3811,6 +1768,11 @@ rb_objspace_internal_object_p(VALUE obj)
     return internal_object_p(obj);
 }
 
+struct os_each_struct {
+    size_t num;
+    VALUE of;
+};
+
 static int
 os_obj_of_i(void *vstart, void *vend, size_t stride, void *data)
 {
@@ -3851,30 +1813,34 @@ os_obj_of(VALUE of)
  *  Ruby process. If <i>module</i> is specified, calls the block
  *  for only those classes or modules that match (or are a subclass of)
  *  <i>module</i>. Returns the number of objects found. Immediate
- *  objects (<code>Fixnum</code>s, <code>Symbol</code>s
- *  <code>true</code>, <code>false</code>, and <code>nil</code>) are
- *  never returned. In the example below, #each_object returns both
- *  the numbers we defined and several constants defined in the Math
- *  module.
+ *  objects (such as <code>Fixnum</code>s, static <code>Symbol</code>s
+ *  <code>true</code>, <code>false</code> and <code>nil</code>) are
+ *  never returned.
  *
  *  If no block is given, an enumerator is returned instead.
  *
- *     a = 102.7
- *     b = 95       # Won't be returned
- *     c = 12345678987654321
- *     count = ObjectSpace.each_object(Numeric) {|x| p x }
+ *     Job = Class.new
+ *     jobs = [Job.new, Job.new]
+ *     count = ObjectSpace.each_object(Job) {|x| p x }
  *     puts "Total count: #{count}"
  *
  *  <em>produces:</em>
  *
- *     12345678987654321
- *     102.7
- *     2.71828182845905
- *     3.14159265358979
- *     2.22044604925031e-16
- *     1.7976931348623157e+308
- *     2.2250738585072e-308
- *     Total count: 7
+ *    #<Job:0x000000011d6cbbf0>
+ *    #<Job:0x000000011d6cbc68>
+ *     Total count: 2
+ *
+ *  Due to a current Ractor implementation issue, this method does not yield
+ *  Ractor-unshareable objects when the process is in multi-Ractor mode. Multi-ractor
+ *  mode is enabled when <code>Ractor.new</code> has been called for the first time.
+ *  See https://bugs.ruby-lang.org/issues/19387 for more information.
+ *
+ *     a = 12345678987654321 # shareable
+ *     b = [].freeze # shareable
+ *     c = {} # not shareable
+ *     ObjectSpace.each_object {|x| x } # yields a, b, and c
+ *     Ractor.new {} # enter multi-Ractor mode
+ *     ObjectSpace.each_object {|x| x } # does not yield c
  *
  */
 
@@ -3890,10 +1856,12 @@ os_each_obj(int argc, VALUE *argv, VALUE os)
 
 /*
  *  call-seq:
- *     ObjectSpace.undefine_finalizer(obj)
+ *     ObjectSpace.undefine_finalizer(obj) -> obj
  *
- *  Removes all finalizers for <i>obj</i>.
+ *  Removes all finalizers registered for +obj+ with
+ *  ObjectSpace.define_finalizer, and returns +obj+.
  *
+ *  Does nothing if +obj+ has no finalizers.
  */
 
 static VALUE
@@ -3905,11 +1873,10 @@ undefine_final(VALUE os, VALUE obj)
 VALUE
 rb_undefine_finalizer(VALUE obj)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    st_data_t data = obj;
     rb_check_frozen(obj);
-    st_delete(finalizer_table, &data, 0);
-    FL_UNSET(obj, FL_FINALIZE);
+
+    rb_gc_impl_undefine_finalizer(rb_gc_get_objspace(), obj);
+
     return obj;
 }
 
@@ -3932,104 +1899,76 @@ should_be_finalizable(VALUE obj)
     rb_check_frozen(obj);
 }
 
-static VALUE
-rb_define_finalizer_no_check(VALUE obj, VALUE block)
+void
+rb_gc_copy_finalizer(VALUE dest, VALUE obj)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE table;
-    st_data_t data;
-
-    RBASIC(obj)->flags |= FL_FINALIZE;
-
-    if (st_lookup(finalizer_table, obj, &data)) {
-        table = (VALUE)data;
-
-        /* avoid duplicate block, table is usually small */
-        {
-            long len = RARRAY_LEN(table);
-            long i;
-
-            for (i = 0; i < len; i++) {
-                VALUE recv = RARRAY_AREF(table, i);
-                if (rb_equal(recv, block)) {
-                    block = recv;
-                    goto end;
-                }
-            }
-        }
-
-        rb_ary_push(table, block);
-    }
-    else {
-        table = rb_ary_new3(1, block);
-        RBASIC_CLEAR_CLASS(table);
-        st_add_direct(finalizer_table, obj, table);
-    }
-  end:
-    block = rb_ary_new3(2, INT2FIX(0), block);
-    OBJ_FREEZE(block);
-    return block;
+    rb_gc_impl_copy_finalizer(rb_gc_get_objspace(), dest, obj);
 }
 
 /*
  *  call-seq:
- *     ObjectSpace.define_finalizer(obj, aProc=proc())
+ *     ObjectSpace.define_finalizer(obj) {|id| ... } -> array
+ *     ObjectSpace.define_finalizer(obj, finalizer) -> array
  *
- *  Adds <i>aProc</i> as a finalizer, to be called after <i>obj</i>
- *  was destroyed. The object ID of the <i>obj</i> will be passed
- *  as an argument to <i>aProc</i>. If <i>aProc</i> is a lambda or
- *  method, make sure it can be called with a single argument.
+ *  Adds a new finalizer for +obj+ that is called when +obj+ is destroyed
+ *  by the garbage collector or when Ruby shuts down (which ever comes first).
  *
- *  The return value is an array <code>[0, aProc]</code>.
+ *  With a block given, uses the block as the callback. Without a block given,
+ *  uses a callable object +finalizer+ as the callback. The callback is called
+ *  when +obj+ is destroyed with a single argument +id+ which is the object
+ *  ID of +obj+ (see Object#object_id).
  *
- *  The two recommended patterns are to either create the finaliser proc
- *  in a non-instance method where it can safely capture the needed state,
- *  or to use a custom callable object that stores the needed state
- *  explicitly as instance variables.
+ *  The return value is an array <code>[0, callback]</code>, where +callback+
+ *  is a Proc created from the block if one was given or +finalizer+ otherwise.
  *
- *      class Foo
- *        def initialize(data_needed_for_finalization)
- *          ObjectSpace.define_finalizer(self, self.class.create_finalizer(data_needed_for_finalization))
- *        end
+ *  Note that defining a finalizer in an instance method of the object may prevent
+ *  the object from being garbage collected since if the block or +finalizer+ refers
+ *  to +obj+ then +obj+ will never be reclaimed by the garbage collector. For example,
+ *  the following script demonstrates the issue:
  *
- *        def self.create_finalizer(data_needed_for_finalization)
- *          proc {
- *            puts "finalizing #{data_needed_for_finalization}"
- *          }
+ *      class Foo
+ *        def define_final
+ *          ObjectSpace.define_finalizer(self) do |id|
+ *            puts "Running finalizer for #{id}!"
+ *          end
  *        end
  *      end
  *
- *      class Bar
- *       class Remover
- *          def initialize(data_needed_for_finalization)
- *            @data_needed_for_finalization = data_needed_for_finalization
- *          end
+ *      obj = Foo.new
+ *      obj.define_final
  *
- *          def call(id)
- *            puts "finalizing #{@data_needed_for_finalization}"
- *          end
+ *  There are two patterns to solve this issue:
+ *
+ *  - Create the finalizer in a non-instance method so it can safely capture
+ *    the needed state:
+ *
+ *      class Foo
+ *        def define_final
+ *          ObjectSpace.define_finalizer(self, self.class.create_finalizer)
  *        end
  *
- *        def initialize(data_needed_for_finalization)
- *          ObjectSpace.define_finalizer(self, Remover.new(data_needed_for_finalization))
+ *        def self.create_finalizer
+ *          proc do |id|
+ *            puts "Running finalizer for #{id}!"
+ *          end
  *        end
  *      end
  *
- *  Note that if your finalizer references the object to be
- *  finalized it will never be run on GC, although it will still be
- *  run at exit. You will get a warning if you capture the object
- *  to be finalized as the receiver of the finalizer.
+ *  - Use a callable object:
+ *
+ *      class Foo
+ *        class Finalizer
+ *          def call(id)
+ *            puts "Running finalizer for #{id}!"
+ *          end
+ *        end
  *
- *      class CapturesSelf
- *        def initialize(name)
- *          ObjectSpace.define_finalizer(self, proc {
- *            # this finalizer will only be run on exit
- *            puts "finalizing #{name}"
- *          })
+ *        def define_final
+ *          ObjectSpace.define_finalizer(self, Finalizer.new)
  *        end
  *      end
  *
- *  Also note that finalization can be unpredictable and is never guaranteed
+ *  Note that finalization can be unpredictable and is never guaranteed
  *  to be run except on exit.
  */
 
@@ -4039,19 +1978,15 @@ define_final(int argc, VALUE *argv, VALUE os)
     VALUE obj, block;
 
     rb_scan_args(argc, argv, "11", &obj, &block);
-    should_be_finalizable(obj);
     if (argc == 1) {
         block = rb_block_proc();
     }
-    else {
-        should_be_callable(block);
-    }
 
     if (rb_callable_receiver(block) == obj) {
         rb_warn("finalizer references object to be finalized");
     }
 
-    return rb_define_finalizer_no_check(obj, block);
+    return rb_define_finalizer(obj, block);
 }
 
 VALUE
@@ -4059,411 +1994,378 @@ rb_define_finalizer(VALUE obj, VALUE block)
 {
     should_be_finalizable(obj);
     should_be_callable(block);
-    return rb_define_finalizer_no_check(obj, block);
+
+    block = rb_gc_impl_define_finalizer(rb_gc_get_objspace(), obj, block);
+
+    block = rb_ary_new3(2, INT2FIX(0), block);
+    OBJ_FREEZE(block);
+    return block;
 }
 
 void
-rb_gc_copy_finalizer(VALUE dest, VALUE obj)
+rb_objspace_call_finalizer(void)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE table;
-    st_data_t data;
-
-    if (!FL_TEST(obj, FL_FINALIZE)) return;
-
-    if (RB_LIKELY(st_lookup(finalizer_table, obj, &data))) {
-        table = (VALUE)data;
-        st_insert(finalizer_table, dest, table);
-        FL_SET(dest, FL_FINALIZE);
-    }
-    else {
-        rb_bug("rb_gc_copy_finalizer: FL_FINALIZE set but not found in finalizer_table: %s", obj_info(obj));
-    }
+    rb_gc_impl_shutdown_call_finalizer(rb_gc_get_objspace());
 }
 
-static VALUE
-run_single_final(VALUE cmd, VALUE objid)
+void
+rb_objspace_free_objects(void *objspace)
 {
-    return rb_check_funcall(cmd, idCall, 1, &objid);
+    rb_gc_impl_shutdown_free_objects(objspace);
 }
 
-static void
-warn_exception_in_finalizer(rb_execution_context_t *ec, VALUE final)
+int
+rb_objspace_garbage_object_p(VALUE obj)
 {
-    if (!UNDEF_P(final) && !NIL_P(ruby_verbose)) {
-        VALUE errinfo = ec->errinfo;
-        rb_warn("Exception in finalizer %+"PRIsVALUE, final);
-        rb_ec_error_print(ec, errinfo);
-    }
+    return !SPECIAL_CONST_P(obj) && rb_gc_impl_garbage_object_p(rb_gc_get_objspace(), obj);
 }
 
-static void
-run_finalizer(rb_objspace_t *objspace, VALUE obj, VALUE table)
+bool
+rb_gc_pointer_to_heap_p(VALUE obj)
 {
-    long i;
-    enum ruby_tag_type state;
-    volatile struct {
-        VALUE errinfo;
-        VALUE objid;
-        VALUE final;
-        rb_control_frame_t *cfp;
-        VALUE *sp;
-        long finished;
-    } saved;
+    return rb_gc_impl_pointer_to_heap_p(rb_gc_get_objspace(), (void *)obj);
+}
 
-    rb_execution_context_t * volatile ec = GET_EC();
-#define RESTORE_FINALIZER() (\
-        ec->cfp = saved.cfp, \
-        ec->cfp->sp = saved.sp, \
-        ec->errinfo = saved.errinfo)
+#define OBJ_ID_INCREMENT (RUBY_IMMEDIATE_MASK + 1)
+#define LAST_OBJECT_ID() (object_id_counter * OBJ_ID_INCREMENT)
+static VALUE id2ref_value = 0;
 
-    saved.errinfo = ec->errinfo;
-    saved.objid = rb_obj_id(obj);
-    saved.cfp = ec->cfp;
-    saved.sp = ec->cfp->sp;
-    saved.finished = 0;
-    saved.final = Qundef;
+#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
+static size_t object_id_counter = 1;
+#else
+static unsigned long long object_id_counter = 1;
+#endif
 
-    EC_PUSH_TAG(ec);
-    state = EC_EXEC_TAG();
-    if (state != TAG_NONE) {
-        ++saved.finished;	/* skip failed finalizer */
-        warn_exception_in_finalizer(ec, ATOMIC_VALUE_EXCHANGE(saved.final, Qundef));
-    }
-    for (i = saved.finished;
-         RESTORE_FINALIZER(), i<RARRAY_LEN(table);
-         saved.finished = ++i) {
-        run_single_final(saved.final = RARRAY_AREF(table, i), saved.objid);
-    }
-    EC_POP_TAG();
-#undef RESTORE_FINALIZER
+static inline VALUE
+generate_next_object_id(void)
+{
+#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
+    // 64bit atomics are available
+    return SIZET2NUM(RUBY_ATOMIC_SIZE_FETCH_ADD(object_id_counter, 1) * OBJ_ID_INCREMENT);
+#else
+    unsigned int lock_lev = RB_GC_VM_LOCK();
+    VALUE id = ULL2NUM(++object_id_counter * OBJ_ID_INCREMENT);
+    RB_GC_VM_UNLOCK(lock_lev);
+    return id;
+#endif
 }
 
-static void
-run_final(rb_objspace_t *objspace, VALUE zombie)
+void
+rb_gc_obj_id_moved(VALUE obj)
 {
-    if (RZOMBIE(zombie)->dfree) {
-        RZOMBIE(zombie)->dfree(RZOMBIE(zombie)->data);
+    if (UNLIKELY(id2ref_tbl)) {
+        st_insert(id2ref_tbl, (st_data_t)rb_obj_id(obj), (st_data_t)obj);
     }
+}
 
-    st_data_t key = (st_data_t)zombie;
-    if (FL_TEST_RAW(zombie, FL_FINALIZE)) {
-        FL_UNSET(zombie, FL_FINALIZE);
-        st_data_t table;
-        if (st_delete(finalizer_table, &key, &table)) {
-            run_finalizer(objspace, zombie, (VALUE)table);
-        }
-        else {
-            rb_bug("FL_FINALIZE flag is set, but finalizers are not found");
-        }
+static int
+object_id_cmp(st_data_t x, st_data_t y)
+{
+    if (RB_TYPE_P(x, T_BIGNUM)) {
+        return !rb_big_eql(x, y);
     }
     else {
-        GC_ASSERT(!st_lookup(finalizer_table, key, NULL));
+        return x != y;
     }
 }
 
-static void
-finalize_list(rb_objspace_t *objspace, VALUE zombie)
+static st_index_t
+object_id_hash(st_data_t n)
 {
-    while (zombie) {
-        VALUE next_zombie;
-        struct heap_page *page;
-        asan_unpoison_object(zombie, false);
-        next_zombie = RZOMBIE(zombie)->next;
-        page = GET_HEAP_PAGE(zombie);
-
-        run_final(objspace, zombie);
-
-        RB_VM_LOCK_ENTER();
-        {
-            GC_ASSERT(BUILTIN_TYPE(zombie) == T_ZOMBIE);
-            if (FL_TEST(zombie, FL_SEEN_OBJ_ID)) {
-                obj_free_object_id(objspace, zombie);
-            }
-
-            GC_ASSERT(heap_pages_final_slots > 0);
-            GC_ASSERT(page->final_slots > 0);
+    return FIX2LONG(rb_hash((VALUE)n));
+}
 
-            heap_pages_final_slots--;
-            page->final_slots--;
-            page->free_slots++;
-            heap_page_add_freeobj(objspace, page, zombie);
-            page->size_pool->total_freed_objects++;
-        }
-        RB_VM_LOCK_LEAVE();
+static const struct st_hash_type object_id_hash_type = {
+    object_id_cmp,
+    object_id_hash,
+};
 
-        zombie = next_zombie;
-    }
-}
+static void gc_mark_tbl_no_pin(st_table *table);
 
 static void
-finalize_deferred_heap_pages(rb_objspace_t *objspace)
+id2ref_tbl_mark(void *data)
 {
-    VALUE zombie;
-    while ((zombie = ATOMIC_VALUE_EXCHANGE(heap_pages_deferred_final, 0)) != 0) {
-        finalize_list(objspace, zombie);
+    st_table *table = (st_table *)data;
+    if (UNLIKELY(!RB_POSFIXABLE(LAST_OBJECT_ID()))) {
+        // It's very unlikely, but if enough object ids were generated, keys may be T_BIGNUM
+        rb_mark_set(table);
     }
+    // We purposely don't mark values, as they are weak references.
+    // rb_gc_obj_free_vm_weak_references takes care of cleaning them up.
 }
 
-static void
-finalize_deferred(rb_objspace_t *objspace)
+static size_t
+id2ref_tbl_memsize(const void *data)
 {
-    rb_execution_context_t *ec = GET_EC();
-    ec->interrupt_mask |= PENDING_INTERRUPT_MASK;
-    finalize_deferred_heap_pages(objspace);
-    ec->interrupt_mask &= ~PENDING_INTERRUPT_MASK;
+    return rb_st_memsize(data);
 }
 
 static void
-gc_finalize_deferred(void *dmy)
+id2ref_tbl_free(void *data)
 {
-    rb_objspace_t *objspace = dmy;
-    if (ATOMIC_EXCHANGE(finalizing, 1)) return;
-
-    finalize_deferred(objspace);
-    ATOMIC_SET(finalizing, 0);
+    id2ref_tbl = NULL; // clear global ref
+    st_table *table = (st_table *)data;
+    st_free_table(table);
 }
 
-static void
-gc_finalize_deferred_register(rb_objspace_t *objspace)
+static const rb_data_type_t id2ref_tbl_type = {
+    .wrap_struct_name = "VM/_id2ref_table",
+    .function = {
+        .dmark = id2ref_tbl_mark,
+        .dfree = id2ref_tbl_free,
+        .dsize = id2ref_tbl_memsize,
+        // dcompact function not required because the table is reference updated
+        // in rb_gc_vm_weak_table_foreach
+    },
+    .flags = RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
+};
+
+static VALUE
+class_object_id(VALUE klass)
 {
-    /* will enqueue a call to gc_finalize_deferred */
-    rb_postponed_job_trigger(objspace->finalize_deferred_pjob);
+    VALUE id = RUBY_ATOMIC_VALUE_LOAD(RCLASS(klass)->object_id);
+    if (!id) {
+        unsigned int lock_lev = RB_GC_VM_LOCK();
+        id = generate_next_object_id();
+        VALUE existing_id = RUBY_ATOMIC_VALUE_CAS(RCLASS(klass)->object_id, 0, id);
+        if (existing_id) {
+            id = existing_id;
+        }
+        else if (RB_UNLIKELY(id2ref_tbl)) {
+            st_insert(id2ref_tbl, id, klass);
+        }
+        RB_GC_VM_UNLOCK(lock_lev);
+    }
+    return id;
 }
 
-static int pop_mark_stack(mark_stack_t *stack, VALUE *data);
-
-static void
-gc_abort(rb_objspace_t *objspace)
+static inline VALUE
+object_id_get(VALUE obj, shape_id_t shape_id)
 {
-    if (is_incremental_marking(objspace)) {
-        /* Remove all objects from the mark stack. */
-        VALUE obj;
-        while (pop_mark_stack(&objspace->mark_stack, &obj));
-
-        objspace->flags.during_incremental_marking = FALSE;
+    VALUE id;
+    if (rb_shape_complex_p(shape_id)) {
+        id = rb_obj_field_get(obj, ROOT_COMPLEX_WITH_OBJ_ID);
     }
-
-    if (is_lazy_sweeping(objspace)) {
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-            heap->sweeping_page = NULL;
-            struct heap_page *page = NULL;
-
-            ccan_list_for_each(&heap->pages, page, page_node) {
-                page->flags.before_sweep = false;
-            }
-        }
+    else {
+        id = rb_obj_field_get(obj, rb_shape_object_id(shape_id));
     }
 
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-        rgengc_mark_and_rememberset_clear(objspace, heap);
+#if RUBY_DEBUG
+    if (!(FIXNUM_P(id) || RB_TYPE_P(id, T_BIGNUM))) {
+        rb_p(obj);
+        rb_bug("Object's shape includes object_id, but it's missing %s", rb_obj_info(obj));
     }
+#endif
 
-    gc_mode_set(objspace, gc_mode_none);
-}
-
-struct force_finalize_list {
-    VALUE obj;
-    VALUE table;
-    struct force_finalize_list *next;
-};
-
-static int
-force_chain_object(st_data_t key, st_data_t val, st_data_t arg)
-{
-    struct force_finalize_list **prev = (struct force_finalize_list **)arg;
-    struct force_finalize_list *curr = ALLOC(struct force_finalize_list);
-    curr->obj = key;
-    curr->table = val;
-    curr->next = *prev;
-    *prev = curr;
-    return ST_CONTINUE;
+    return id;
 }
 
-static void
-gc_each_object(rb_objspace_t *objspace, void (*func)(VALUE obj, void *data), void *data)
+static VALUE
+object_id0(VALUE obj)
 {
-    for (size_t i = 0; i < heap_allocated_pages; i++) {
-        struct heap_page *page = heap_pages_sorted[i];
-        short stride = page->slot_size;
+    VALUE id = Qfalse;
+    shape_id_t shape_id = RBASIC_SHAPE_ID(obj);
+
+    if (rb_shape_has_object_id(shape_id)) {
+        return object_id_get(obj, shape_id);
+    }
 
-        uintptr_t p = (uintptr_t)page->start;
-        uintptr_t pend = p + page->total_slots * stride;
-        for (; p < pend; p += stride) {
-            VALUE obj = (VALUE)p;
+    shape_id_t object_id_shape_id = rb_obj_shape_transition_object_id(obj);
 
-            void *poisoned = asan_unpoison_object_temporary(obj);
+    id = generate_next_object_id();
+    rb_obj_field_set(obj, object_id_shape_id, 0, id);
 
-            func(obj, data);
+    RUBY_ASSERT(RBASIC_SHAPE_ID(obj) == object_id_shape_id);
+    RUBY_ASSERT(rb_obj_shape_has_id(obj));
 
-            if (poisoned) {
-                GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
-                asan_poison_object(obj);
-            }
+    if (RB_UNLIKELY(id2ref_tbl)) {
+        RB_VM_LOCKING() {
+            st_insert(id2ref_tbl, (st_data_t)id, (st_data_t)obj);
         }
     }
+    return id;
 }
 
-bool rb_obj_is_main_ractor(VALUE gv);
-
-static void
-rb_objspace_free_objects_i(VALUE obj, void *data)
+static VALUE
+object_id(VALUE obj)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-
     switch (BUILTIN_TYPE(obj)) {
-      case T_NONE:
-      case T_SYMBOL:
+      case T_CLASS:
+      case T_MODULE:
+        // With Ruby Box, classes and modules have different fields
+        // in different boxes, so we cannot store the object id
+        // in fields.
+        return class_object_id(obj);
+      case T_IMEMO:
+        RUBY_ASSERT(IMEMO_TYPE_P(obj, imemo_fields));
         break;
       default:
-        obj_free(objspace, obj);
         break;
     }
-}
 
-void
-rb_objspace_free_objects(rb_objspace_t *objspace)
-{
-    gc_each_object(objspace, rb_objspace_free_objects_i, objspace);
+    if (UNLIKELY(rb_gc_multi_ractor_p() && rb_ractor_shareable_p(obj))) {
+        unsigned int lock_lev = RB_GC_VM_LOCK();
+        VALUE id = object_id0(obj);
+        RB_GC_VM_UNLOCK(lock_lev);
+        return id;
+    }
+
+    return object_id0(obj);
 }
 
 static void
-rb_objspace_call_finalizer_i(VALUE obj, void *data)
+build_id2ref_i(VALUE obj, void *data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    st_table *id2ref_tbl = (st_table *)data;
 
     switch (BUILTIN_TYPE(obj)) {
-      case T_DATA:
-        if (!rb_free_at_exit && (!DATA_PTR(obj) || !RANY(obj)->as.data.dfree)) break;
-        if (rb_obj_is_thread(obj)) break;
-        if (rb_obj_is_mutex(obj)) break;
-        if (rb_obj_is_fiber(obj)) break;
-        if (rb_obj_is_main_ractor(obj)) break;
-
-        obj_free(objspace, obj);
+      case T_CLASS:
+      case T_MODULE:
+        RUBY_ASSERT(!rb_objspace_garbage_object_p(obj));
+        if (RCLASS(obj)->object_id) {
+            st_insert(id2ref_tbl, RCLASS(obj)->object_id, obj);
+        }
         break;
-      case T_FILE:
-        obj_free(objspace, obj);
+      case T_IMEMO:
+        RUBY_ASSERT(!rb_objspace_garbage_object_p(obj));
+        if (IMEMO_TYPE_P(obj, imemo_fields) && rb_obj_shape_has_id(obj)) {
+            st_insert(id2ref_tbl, rb_obj_id(obj), rb_imemo_fields_owner(obj));
+        }
         break;
-      case T_SYMBOL:
-      case T_ARRAY:
-      case T_NONE:
+      case T_OBJECT:
+        RUBY_ASSERT(!rb_objspace_garbage_object_p(obj));
+        if (rb_obj_shape_has_id(obj)) {
+            st_insert(id2ref_tbl, rb_obj_id(obj), obj);
+        }
         break;
       default:
-        if (rb_free_at_exit) {
-            obj_free(objspace, obj);
-        }
+        // For generic_fields, the T_IMEMO/fields is responsible for populating the entry.
         break;
     }
 }
 
-void
-rb_objspace_call_finalizer(rb_objspace_t *objspace)
+static VALUE
+object_id_to_ref(void *objspace_ptr, VALUE object_id)
 {
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-    if (ATOMIC_EXCHANGE(finalizing, 1)) return;
-
-    /* run finalizers */
-    finalize_deferred(objspace);
-    GC_ASSERT(heap_pages_deferred_final == 0);
+    rb_objspace_t *objspace = objspace_ptr;
 
-    /* prohibit incremental GC */
-    objspace->flags.dont_incremental = 1;
+    unsigned int lev = RB_GC_VM_LOCK();
 
-    /* force to run finalizer */
-    while (finalizer_table->num_entries) {
-        struct force_finalize_list *list = 0;
-        st_foreach(finalizer_table, force_chain_object, (st_data_t)&list);
-        while (list) {
-            struct force_finalize_list *curr = list;
+    if (!id2ref_tbl) {
+        rb_gc_vm_barrier(); // stop other ractors
 
-            st_data_t obj = (st_data_t)curr->obj;
-            st_delete(finalizer_table, &obj, 0);
-            FL_UNSET(curr->obj, FL_FINALIZE);
+        // GC Must not trigger while we build the table, otherwise if we end
+        // up freeing an object that had an ID, we might try to delete it from
+        // the table even though it wasn't inserted yet.
+        st_table *tmp_id2ref_tbl = st_init_table(&object_id_hash_type);
+        VALUE tmp_id2ref_value = TypedData_Wrap_Struct(0, &id2ref_tbl_type, tmp_id2ref_tbl);
 
-            run_finalizer(objspace, curr->obj, curr->table);
+        // build_id2ref_i will most certainly malloc, which could trigger GC and sweep
+        // objects we just added to the table.
+        // By calling rb_gc_disable() we also save having to handle potentially garbage objects.
+        bool gc_disabled = RTEST(rb_gc_disable());
+        {
+            id2ref_tbl = tmp_id2ref_tbl;
+            id2ref_value = tmp_id2ref_value;
 
-            list = curr->next;
-            xfree(curr);
+            rb_gc_impl_each_object(objspace, build_id2ref_i, (void *)id2ref_tbl);
         }
+        if (!gc_disabled) rb_gc_enable();
     }
 
-    /* Abort incremental marking and lazy sweeping to speed up shutdown. */
-    gc_abort(objspace);
-
-    /* prohibit GC because force T_DATA finalizers can break an object graph consistency */
-    dont_gc_on();
-
-    /* running data/file finalizers are part of garbage collection */
-    unsigned int lock_lev;
-    gc_enter(objspace, gc_enter_event_finalizer, &lock_lev);
-
-    gc_each_object(objspace, rb_objspace_call_finalizer_i, objspace);
-
-    gc_exit(objspace, gc_enter_event_finalizer, &lock_lev);
+    VALUE obj;
+    bool found = st_lookup(id2ref_tbl, object_id, &obj) && !rb_gc_impl_garbage_object_p(objspace, obj);
 
-    finalize_deferred_heap_pages(objspace);
+    RB_GC_VM_UNLOCK(lev);
 
-    st_free_table(finalizer_table);
-    finalizer_table = 0;
-    ATOMIC_SET(finalizing, 0);
-}
+    if (found) {
+        return obj;
+    }
 
-/* garbage objects will be collected soon. */
-static inline bool
-is_garbage_object(rb_objspace_t *objspace, VALUE ptr)
-{
-    return is_lazy_sweeping(objspace) && GET_HEAP_PAGE(ptr)->flags.before_sweep &&
-        !MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(ptr), ptr);
+    if (rb_funcall(object_id, rb_intern(">="), 1, ULL2NUM(LAST_OBJECT_ID()))) {
+        rb_raise(rb_eRangeError, "%+"PRIsVALUE" is not an id value", rb_funcall(object_id, rb_intern("to_s"), 1, INT2FIX(10)));
+    }
+    else {
+        rb_raise(rb_eRangeError, "%+"PRIsVALUE" is a recycled object", rb_funcall(object_id, rb_intern("to_s"), 1, INT2FIX(10)));
+    }
 }
 
-static inline bool
-is_live_object(rb_objspace_t *objspace, VALUE ptr)
+static inline void
+obj_free_object_id(VALUE obj)
 {
-    switch (BUILTIN_TYPE(ptr)) {
-      case T_NONE:
-      case T_MOVED:
-      case T_ZOMBIE:
-        return FALSE;
-      default:
-        break;
-    }
+    VALUE obj_id = 0;
+    if (RB_UNLIKELY(id2ref_tbl)) {
+        switch (BUILTIN_TYPE(obj)) {
+          case T_CLASS:
+          case T_MODULE:
+            obj_id = RCLASS(obj)->object_id;
+            break;
+          case T_IMEMO:
+            if (!IMEMO_TYPE_P(obj, imemo_fields)) {
+                return;
+            }
+            // fallthrough
+          case T_OBJECT:
+            {
+            shape_id_t shape_id = RBASIC_SHAPE_ID(obj);
+            if (rb_shape_has_object_id(shape_id)) {
+                obj_id = object_id_get(obj, shape_id);
+            }
+            break;
+          }
+          default:
+            // For generic_fields, the T_IMEMO/fields is responsible for freeing the id.
+            return;
+        }
 
-    return !is_garbage_object(objspace, ptr);
-}
+        if (RB_UNLIKELY(obj_id)) {
+            RUBY_ASSERT(FIXNUM_P(obj_id) || RB_TYPE_P(obj_id, T_BIGNUM));
 
-static inline int
-is_markable_object(VALUE obj)
-{
-    return !RB_SPECIAL_CONST_P(obj);
+            if (!st_delete(id2ref_tbl, (st_data_t *)&obj_id, NULL)) {
+                // The the object is a T_IMEMO/fields, then it's possible the actual object
+                // has been garbage collected already.
+                if (!RB_TYPE_P(obj, T_IMEMO)) {
+                    rb_bug("Object ID seen, but not in _id2ref table: object_id=%llu object=%s", NUM2ULL(obj_id), rb_obj_info(obj));
+                }
+            }
+        }
+    }
 }
 
-int
-rb_objspace_markable_object_p(VALUE obj)
+void
+rb_gc_obj_free_vm_weak_references(VALUE obj)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    return is_markable_object(obj) && is_live_object(objspace, obj);
-}
+    ASSUME(!RB_SPECIAL_CONST_P(obj));
+    obj_free_object_id(obj);
 
-int
-rb_objspace_garbage_object_p(VALUE obj)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    return is_garbage_object(objspace, obj);
-}
+    if (rb_obj_gen_fields_p(obj)) {
+        rb_free_generic_ivar(obj);
+    }
 
-bool
-rb_gc_is_ptr_to_obj(const void *ptr)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    return is_pointer_to_heap(objspace, ptr);
+    switch (BUILTIN_TYPE(obj)) {
+      case T_STRING:
+        if (FL_TEST_RAW(obj, RSTRING_FSTR)) {
+            rb_gc_free_fstring(obj);
+        }
+        break;
+      case T_SYMBOL:
+        rb_gc_free_dsymbol(obj);
+        break;
+      case T_IMEMO:
+        switch (imemo_type(obj)) {
+          case imemo_callinfo:
+            rb_vm_ci_free((const struct rb_callinfo *)obj);
+            break;
+          case imemo_ment:
+            rb_free_method_entry_vm_weak_references((const rb_method_entry_t *)obj);
+            break;
+          default:
+            break;
+        }
+        break;
+      default:
+        break;
+    }
 }
 
 /*
@@ -4479,21 +2381,16 @@ rb_gc_is_ptr_to_obj(const void *ptr)
  *
  *  On multi-ractor mode, if the object is not shareable, it raises
  *  RangeError.
+ *
+ *  This method is deprecated and should no longer be used.
  */
 
 static VALUE
 id2ref(VALUE objid)
 {
-#if SIZEOF_LONG == SIZEOF_VOIDP
-#define NUM2PTR(x) NUM2ULONG(x)
-#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
-#define NUM2PTR(x) NUM2ULL(x)
-#endif
-    rb_objspace_t *objspace = &rb_objspace;
-
     objid = rb_to_int(objid);
     if (FIXNUM_P(objid) || rb_big_size(objid) <= SIZEOF_VOIDP) {
-        VALUE ptr = NUM2PTR(objid);
+        VALUE ptr = (VALUE)NUM2PTR(objid);
         if (SPECIAL_CONST_P(ptr)) {
             if (ptr == Qtrue) return Qtrue;
             if (ptr == Qfalse) return Qfalse;
@@ -4507,30 +2404,20 @@ id2ref(VALUE objid)
                     return ptr;
                 }
                 else {
-                    rb_raise(rb_eRangeError, "%p is not symbol id value", (void *)ptr);
+                    rb_raise(rb_eRangeError, "%p is not a symbol id value", (void *)ptr);
                 }
             }
 
-            rb_raise(rb_eRangeError, "%+"PRIsVALUE" is not id value", rb_int2str(objid, 10));
-        }
-    }
-
-    VALUE orig;
-    if (st_lookup(objspace->id_to_obj_tbl, objid, &orig) &&
-            is_live_object(objspace, orig)) {
-        if (!rb_multi_ractor_p() || rb_ractor_shareable_p(orig)) {
-            return orig;
-        }
-        else {
-            rb_raise(rb_eRangeError, "%+"PRIsVALUE" is id of the unshareable object on multi-ractor", rb_int2str(objid, 10));
+            rb_raise(rb_eRangeError, "%+"PRIsVALUE" is not an id value", rb_int2str(objid, 10));
         }
     }
 
-    if (rb_int_ge(objid, ULL2NUM(objspace->next_object_id))) {
-        rb_raise(rb_eRangeError, "%+"PRIsVALUE" is not id value", rb_int2str(objid, 10));
+    VALUE obj = object_id_to_ref(rb_gc_get_objspace(), objid);
+    if (!rb_multi_ractor_p() || rb_ractor_shareable_p(obj)) {
+        return obj;
     }
     else {
-        rb_raise(rb_eRangeError, "%+"PRIsVALUE" is recycled object", rb_int2str(objid, 10));
+        rb_raise(rb_eRangeError, "%+"PRIsVALUE" is the id of an unshareable object on multi-ractor", rb_int2str(objid, 10));
     }
 }
 
@@ -4538,11 +2425,12 @@ id2ref(VALUE objid)
 static VALUE
 os_id2ref(VALUE os, VALUE objid)
 {
+    rb_category_warn(RB_WARN_CATEGORY_DEPRECATED, "ObjectSpace._id2ref is deprecated");
     return id2ref(objid);
 }
 
 static VALUE
-rb_find_object_id(VALUE obj, VALUE (*get_heap_object_id)(VALUE))
+rb_find_object_id(void *objspace, VALUE obj, VALUE (*get_heap_object_id)(VALUE))
 {
     if (SPECIAL_CONST_P(obj)) {
 #if SIZEOF_LONG == SIZEOF_VOIDP
@@ -4556,33 +2444,6 @@ rb_find_object_id(VALUE obj, VALUE (*get_heap_object_id)(VALUE))
 }
 
 static VALUE
-cached_object_id(VALUE obj)
-{
-    VALUE id;
-    rb_objspace_t *objspace = &rb_objspace;
-
-    RB_VM_LOCK_ENTER();
-    if (st_lookup(objspace->obj_to_id_tbl, (st_data_t)obj, &id)) {
-        GC_ASSERT(FL_TEST(obj, FL_SEEN_OBJ_ID));
-    }
-    else {
-        GC_ASSERT(!FL_TEST(obj, FL_SEEN_OBJ_ID));
-
-        id = ULL2NUM(objspace->next_object_id);
-        objspace->next_object_id += OBJ_ID_INCREMENT;
-
-        VALUE already_disabled = rb_gc_disable_no_rest();
-        st_insert(objspace->obj_to_id_tbl, (st_data_t)obj, (st_data_t)id);
-        st_insert(objspace->id_to_obj_tbl, (st_data_t)id, (st_data_t)obj);
-        if (already_disabled == Qfalse) rb_objspace_gc_enable(objspace);
-        FL_SET(obj, FL_SEEN_OBJ_ID);
-    }
-    RB_VM_LOCK_LEAVE();
-
-    return id;
-}
-
-static VALUE
 nonspecial_obj_id(VALUE obj)
 {
 #if SIZEOF_LONG == SIZEOF_VOIDP
@@ -4597,7 +2458,7 @@ nonspecial_obj_id(VALUE obj)
 VALUE
 rb_memory_id(VALUE obj)
 {
-    return rb_find_object_id(obj, nonspecial_obj_id);
+    return rb_find_object_id(NULL, obj, nonspecial_obj_id);
 }
 
 /*
@@ -4630,58 +2491,87 @@ rb_memory_id(VALUE obj)
 VALUE
 rb_obj_id(VALUE obj)
 {
-    /*
-     *                32-bit VALUE space
-     *          MSB ------------------------ LSB
-     *  false   00000000000000000000000000000000
-     *  true    00000000000000000000000000000010
-     *  nil     00000000000000000000000000000100
-     *  undef   00000000000000000000000000000110
-     *  symbol  ssssssssssssssssssssssss00001110
-     *  object  oooooooooooooooooooooooooooooo00        = 0 (mod sizeof(RVALUE))
-     *  fixnum  fffffffffffffffffffffffffffffff1
-     *
-     *                    object_id space
-     *                                       LSB
-     *  false   00000000000000000000000000000000
-     *  true    00000000000000000000000000000010
-     *  nil     00000000000000000000000000000100
-     *  undef   00000000000000000000000000000110
-     *  symbol   000SSSSSSSSSSSSSSSSSSSSSSSSSSS0        S...S % A = 4 (S...S = s...s * A + 4)
-     *  object   oooooooooooooooooooooooooooooo0        o...o % A = 0
-     *  fixnum  fffffffffffffffffffffffffffffff1        bignum if required
-     *
-     *  where A = sizeof(RVALUE)/4
-     *
-     *  sizeof(RVALUE) is
-     *  20 if 32-bit, double is 4-byte aligned
-     *  24 if 32-bit, double is 8-byte aligned
-     *  40 if 64-bit
-     */
+    /* If obj is an immediate, the object ID is obj directly converted to a Numeric.
+     * Otherwise, the object ID is a Numeric that is a non-zero multiple of
+     * (RUBY_IMMEDIATE_MASK + 1) which guarantees that it does not collide with
+     * any immediates. */
+    return rb_find_object_id(rb_gc_get_objspace(), obj, object_id);
+}
 
-    return rb_find_object_id(obj, cached_object_id);
+bool
+rb_obj_id_p(VALUE obj)
+{
+    return !RB_TYPE_P(obj, T_IMEMO) && rb_obj_shape_has_id(obj);
 }
 
-static enum rb_id_table_iterator_result
-cc_table_memsize_i(VALUE ccs_ptr, void *data_ptr)
+/*
+ * GC implementations should call this function before the GC phase that updates references
+ * embedded in the machine code generated by JIT compilers.  JIT compilers usually enforce the
+ * "W^X" policy and protect the code memory from being modified during execution.  This function
+ * makes the code memory writeable.
+ */
+void
+rb_gc_before_updating_jit_code(void)
 {
-    size_t *total_size = data_ptr;
-    struct rb_class_cc_entries *ccs = (struct rb_class_cc_entries *)ccs_ptr;
-    *total_size += sizeof(*ccs);
-    *total_size += sizeof(ccs->entries[0]) * ccs->capa;
-    return ID_TABLE_CONTINUE;
+#if USE_YJIT
+    rb_yjit_mark_all_writeable();
+#endif
+#if USE_ZJIT
+    rb_zjit_mark_all_writable();
+#endif
 }
 
-static size_t
-cc_table_memsize(struct rb_id_table *cc_table)
+/*
+ * GC implementations should call this function before the GC phase that updates references
+ * embedded in the machine code generated by JIT compilers.  This function makes the code memory
+ * executable again.
+ */
+void
+rb_gc_after_updating_jit_code(void)
 {
-    size_t total = rb_id_table_memsize(cc_table);
-    rb_id_table_foreach_values(cc_table, cc_table_memsize_i, &total);
-    return total;
+#if USE_YJIT
+    rb_yjit_mark_all_executable();
+#endif
+#if USE_ZJIT
+    rb_zjit_mark_all_executable();
+#endif
 }
 
-static size_t
-obj_memsize_of(VALUE obj, int use_all_types)
+static void
+classext_memsize(rb_classext_t *ext, bool prime, VALUE box_value, void *arg)
+{
+    size_t *size = (size_t *)arg;
+    size_t s = 0;
+
+    if (RCLASSEXT_M_TBL(ext)) {
+        s += rb_id_table_memsize(RCLASSEXT_M_TBL(ext));
+    }
+    if (RCLASSEXT_CONST_TBL(ext)) {
+        s += rb_id_table_memsize(RCLASSEXT_CONST_TBL(ext));
+    }
+    if (RCLASSEXT_SUPERCLASSES_WITH_SELF(ext)) {
+        s += (RCLASSEXT_SUPERCLASS_DEPTH(ext) + 1) * sizeof(VALUE);
+    }
+    if (!prime) {
+        s += sizeof(rb_classext_t);
+    }
+    *size += s;
+}
+
+static void
+classext_superclasses_memsize(rb_classext_t *ext, bool prime, VALUE box_value, void *arg)
+{
+    size_t *size = (size_t *)arg;
+    size_t array_size;
+    if (RCLASSEXT_SUPERCLASSES_WITH_SELF(ext)) {
+        RUBY_ASSERT(prime);
+        array_size = RCLASSEXT_SUPERCLASS_DEPTH(ext) + 1;
+        *size += array_size * sizeof(VALUE);
+    }
+}
+
+size_t
+rb_obj_memsize_of(VALUE obj)
 {
     size_t size = 0;
 
@@ -4689,38 +2579,21 @@ obj_memsize_of(VALUE obj, int use_all_types)
         return 0;
     }
 
-    if (FL_TEST(obj, FL_EXIVAR)) {
-        size += rb_generic_ivar_memsize(obj);
-    }
-
     switch (BUILTIN_TYPE(obj)) {
       case T_OBJECT:
-        if (rb_shape_obj_too_complex(obj)) {
-            size += rb_st_memsize(ROBJECT_IV_HASH(obj));
-        }
-        else if (!(RBASIC(obj)->flags & ROBJECT_EMBED)) {
-            size += ROBJECT_IV_CAPACITY(obj) * sizeof(VALUE);
+        if (FL_TEST_RAW(obj, ROBJECT_HEAP)) {
+            if (rb_obj_shape_complex_p(obj)) {
+                size += rb_st_memsize(ROBJECT_FIELDS_HASH(obj));
+            }
+            else {
+                size += ROBJECT_FIELDS_CAPACITY(obj) * sizeof(VALUE);
+            }
         }
         break;
       case T_MODULE:
       case T_CLASS:
-        if (RCLASS_M_TBL(obj)) {
-            size += rb_id_table_memsize(RCLASS_M_TBL(obj));
-        }
-        // class IV sizes are allocated as powers of two
-        size += SIZEOF_VALUE << bit_length(RCLASS_IV_COUNT(obj));
-        if (RCLASS_CVC_TBL(obj)) {
-            size += rb_id_table_memsize(RCLASS_CVC_TBL(obj));
-        }
-        if (RCLASS_EXT(obj)->const_tbl) {
-            size += rb_id_table_memsize(RCLASS_EXT(obj)->const_tbl);
-        }
-        if (RCLASS_CC_TBL(obj)) {
-            size += cc_table_memsize(RCLASS_CC_TBL(obj));
-        }
-        if (FL_TEST_RAW(obj, RCLASS_SUPERCLASSES_INCLUDE_SELF)) {
-            size += (RCLASS_SUPERCLASS_DEPTH(obj) + 1) * sizeof(VALUE);
-        }
+        rb_class_classext_foreach(obj, classext_memsize, (void *)&size);
+        rb_class_classext_foreach(obj, classext_superclasses_memsize, (void *)&size);
         break;
       case T_ICLASS:
         if (RICLASS_OWNS_M_TBL_P(obj)) {
@@ -4728,9 +2601,6 @@ obj_memsize_of(VALUE obj, int use_all_types)
                 size += rb_id_table_memsize(RCLASS_M_TBL(obj));
             }
         }
-        if (RCLASS_CC_TBL(obj)) {
-            size += cc_table_memsize(RCLASS_CC_TBL(obj));
-        }
         break;
       case T_STRING:
         size += rb_str_memsize(obj);
@@ -4751,12 +2621,14 @@ obj_memsize_of(VALUE obj, int use_all_types)
         }
         break;
       case T_DATA:
-        if (use_all_types) size += rb_objspace_data_type_memsize(obj);
+        size += rb_objspace_data_type_memsize(obj);
         break;
       case T_MATCH:
         {
-            rb_matchext_t *rm = RMATCH_EXT(obj);
-            size += onig_region_memsize(&rm->regs);
+            struct RMatch *rm = RMATCH(obj);
+            if (FL_TEST_RAW(obj, RMATCH_ONIG)) {
+                size += onig_region_memsize(&rm->as.onig);
+            }
             size += sizeof(struct rmatch_offset) * rm->char_offset_num_allocated;
         }
         break;
@@ -4787,9 +2659,8 @@ obj_memsize_of(VALUE obj, int use_all_types)
         break;
 
       case T_STRUCT:
-        if ((RBASIC(obj)->flags & RSTRUCT_EMBED_LEN_MASK) == 0 &&
-            RSTRUCT(obj)->as.heap.ptr) {
-            size += sizeof(VALUE) * RSTRUCT_LEN(obj);
+        if (RSTRUCT_EMBED_LEN(obj) == 0) {
+            size += sizeof(VALUE) * RSTRUCT_LEN_RAW(obj);
         }
         break;
 
@@ -4805,12 +2676,6 @@ obj_memsize_of(VALUE obj, int use_all_types)
     return size + rb_gc_obj_slot_size(obj);
 }
 
-size_t
-rb_obj_memsize_of(VALUE obj)
-{
-    return obj_memsize_of(obj, TRUE);
-}
-
 static int
 set_zero(st_data_t key, st_data_t val, st_data_t arg)
 {
@@ -4820,43 +2685,6 @@ set_zero(st_data_t key, st_data_t val, st_data_t arg)
     return ST_CONTINUE;
 }
 
-static VALUE
-type_sym(size_t type)
-{
-    switch (type) {
-#define COUNT_TYPE(t) case (t): return ID2SYM(rb_intern(#t)); break;
-        COUNT_TYPE(T_NONE);
-        COUNT_TYPE(T_OBJECT);
-        COUNT_TYPE(T_CLASS);
-        COUNT_TYPE(T_MODULE);
-        COUNT_TYPE(T_FLOAT);
-        COUNT_TYPE(T_STRING);
-        COUNT_TYPE(T_REGEXP);
-        COUNT_TYPE(T_ARRAY);
-        COUNT_TYPE(T_HASH);
-        COUNT_TYPE(T_STRUCT);
-        COUNT_TYPE(T_BIGNUM);
-        COUNT_TYPE(T_FILE);
-        COUNT_TYPE(T_DATA);
-        COUNT_TYPE(T_MATCH);
-        COUNT_TYPE(T_COMPLEX);
-        COUNT_TYPE(T_RATIONAL);
-        COUNT_TYPE(T_NIL);
-        COUNT_TYPE(T_TRUE);
-        COUNT_TYPE(T_FALSE);
-        COUNT_TYPE(T_SYMBOL);
-        COUNT_TYPE(T_FIXNUM);
-        COUNT_TYPE(T_IMEMO);
-        COUNT_TYPE(T_UNDEF);
-        COUNT_TYPE(T_NODE);
-        COUNT_TYPE(T_ICLASS);
-        COUNT_TYPE(T_ZOMBIE);
-        COUNT_TYPE(T_MOVED);
-#undef COUNT_TYPE
-        default:              return SIZET2NUM(type); break;
-    }
-}
-
 struct count_objects_data {
     size_t counts[T_MASK+1];
     size_t freed;
@@ -4868,7 +2696,7 @@ count_objects_i(VALUE obj, void *d)
 {
     struct count_objects_data *data = (struct count_objects_data *)d;
 
-    if (RANY(obj)->as.basic.flags) {
+    if (RBASIC(obj)->flags) {
         data->counts[BUILTIN_TYPE(obj)]++;
     }
     else {
@@ -4880,34 +2708,39 @@ count_objects_i(VALUE obj, void *d)
 
 /*
  *  call-seq:
- *     ObjectSpace.count_objects([result_hash]) -> hash
+ *     ObjectSpace.count_objects(result_hash = {}) -> hash
  *
- *  Counts all objects grouped by type.
+ *  Counts the number of objects, grouped by type.
  *
- *  It returns a hash, such as:
- *	{
- *	  :TOTAL=>10000,
- *	  :FREE=>3011,
- *	  :T_OBJECT=>6,
- *	  :T_CLASS=>404,
- *	  # ...
- *	}
+ *  It returns a hash that looks like:
  *
- *  The contents of the returned hash are implementation specific.
- *  It may be changed in future.
+ *    {
+ *      TOTAL: 10000,
+ *      FREE: 3011,
+ *      T_OBJECT: 6,
+ *      T_CLASS: 404,
+ *      # ...
+ *    }
+ *
+ *  The contents of the returned hash are implementation specific and
+ *  may be changed in future versions without notice.
  *
- *  The keys starting with +:T_+ means live objects.
+ *  The keys starting with +:T_+ are live objects of a particular type.
  *  For example, +:T_ARRAY+ is the number of arrays.
- *  +:FREE+ means object slots which is not used now.
- *  +:TOTAL+ means sum of above.
+ *
+ *  The key +:FREE+ is the number of object slots which are empty.
+ *
+ *  The key +:TOTAL+ is the total number of slots (which is the sum of
+ *  all of the other values).
  *
  *  If the optional argument +result_hash+ is given,
- *  it is overwritten and returned. This is intended to avoid probe effect.
+ *  it is overwritten and returned.
+ *  This is intended to avoid the probe effect.
  *
  *    h = {}
  *    ObjectSpace.count_objects(h)
  *    puts h
- *    # => { :TOTAL=>10000, :T_CLASS=>158280, :T_MODULE=>20672, :T_STRING=>527249 }
+ *    # => { TOTAL: 10000, T_CLASS: 158280, T_MODULE: 20672, T_STRING: 527249 }
  *
  *  This method is only expected to work on C Ruby.
  *
@@ -4916,9 +2749,9 @@ count_objects_i(VALUE obj, void *d)
 static VALUE
 count_objects(int argc, VALUE *argv, VALUE os)
 {
-    rb_objspace_t *objspace = &rb_objspace;
     struct count_objects_data data = { 0 };
     VALUE hash = Qnil;
+    VALUE types[T_MASK + 1];
 
     if (rb_check_arity(argc, 0, 1) == 1) {
         hash = argv[0];
@@ -4926,7 +2759,18 @@ count_objects(int argc, VALUE *argv, VALUE os)
             rb_raise(rb_eTypeError, "non-hash given");
     }
 
-    gc_each_object(objspace, count_objects_i, &data);
+    for (size_t i = 0; i <= T_MASK; i++) {
+        // type_sym can allocate an object,
+        // so we need to create all key symbols in advance
+        // not to disturb the result
+        types[i] = type_sym(i);
+    }
+
+    // Same as type_sym, we need to create all key symbols in advance
+    VALUE total = ID2SYM(rb_intern("TOTAL"));
+    VALUE free = ID2SYM(rb_intern("FREE"));
+
+    rb_gc_impl_each_object(rb_gc_get_objspace(), count_objects_i, &data);
 
     if (NIL_P(hash)) {
         hash = rb_hash_new();
@@ -4934,1190 +2778,18 @@ count_objects(int argc, VALUE *argv, VALUE os)
     else if (!RHASH_EMPTY_P(hash)) {
         rb_hash_stlike_foreach(hash, set_zero, hash);
     }
-    rb_hash_aset(hash, ID2SYM(rb_intern("TOTAL")), SIZET2NUM(data.total));
-    rb_hash_aset(hash, ID2SYM(rb_intern("FREE")), SIZET2NUM(data.freed));
+    rb_hash_aset(hash, total, SIZET2NUM(data.total));
+    rb_hash_aset(hash, free, SIZET2NUM(data.freed));
 
     for (size_t i = 0; i <= T_MASK; i++) {
-        VALUE type = type_sym(i);
-        if (data.counts[i])
-            rb_hash_aset(hash, type, SIZET2NUM(data.counts[i]));
-    }
-
-    return hash;
-}
-
-/*
-  ------------------------ Garbage Collection ------------------------
-*/
-
-/* Sweeping */
-
-static size_t
-objspace_available_slots(rb_objspace_t *objspace)
-{
-    size_t total_slots = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        total_slots += SIZE_POOL_EDEN_HEAP(size_pool)->total_slots;
-        total_slots += SIZE_POOL_TOMB_HEAP(size_pool)->total_slots;
-    }
-    return total_slots;
-}
-
-static size_t
-objspace_live_slots(rb_objspace_t *objspace)
-{
-    return total_allocated_objects(objspace) - total_freed_objects(objspace) - heap_pages_final_slots;
-}
-
-static size_t
-objspace_free_slots(rb_objspace_t *objspace)
-{
-    return objspace_available_slots(objspace) - objspace_live_slots(objspace) - heap_pages_final_slots;
-}
-
-static void
-gc_setup_mark_bits(struct heap_page *page)
-{
-    /* copy oldgen bitmap to mark bitmap */
-    memcpy(&page->mark_bits[0], &page->uncollectible_bits[0], HEAP_PAGE_BITMAP_SIZE);
-}
-
-static int gc_is_moveable_obj(rb_objspace_t *objspace, VALUE obj);
-static VALUE gc_move(rb_objspace_t *objspace, VALUE scan, VALUE free, size_t src_slot_size, size_t slot_size);
-
-#if defined(_WIN32)
-enum {HEAP_PAGE_LOCK = PAGE_NOACCESS, HEAP_PAGE_UNLOCK = PAGE_READWRITE};
-
-static BOOL
-protect_page_body(struct heap_page_body *body, DWORD protect)
-{
-    DWORD old_protect;
-    return VirtualProtect(body, HEAP_PAGE_SIZE, protect, &old_protect) != 0;
-}
-#else
-enum {HEAP_PAGE_LOCK = PROT_NONE, HEAP_PAGE_UNLOCK = PROT_READ | PROT_WRITE};
-#define protect_page_body(body, protect) !mprotect((body), HEAP_PAGE_SIZE, (protect))
-#endif
-
-static void
-lock_page_body(rb_objspace_t *objspace, struct heap_page_body *body)
-{
-    if (!protect_page_body(body, HEAP_PAGE_LOCK)) {
-        rb_bug("Couldn't protect page %p, errno: %s", (void *)body, strerror(errno));
-    }
-    else {
-        gc_report(5, objspace, "Protecting page in move %p\n", (void *)body);
-    }
-}
-
-static void
-unlock_page_body(rb_objspace_t *objspace, struct heap_page_body *body)
-{
-    if (!protect_page_body(body, HEAP_PAGE_UNLOCK)) {
-        rb_bug("Couldn't unprotect page %p, errno: %s", (void *)body, strerror(errno));
-    }
-    else {
-        gc_report(5, objspace, "Unprotecting page in move %p\n", (void *)body);
-    }
-}
-
-static bool
-try_move(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *free_page, VALUE src)
-{
-    GC_ASSERT(gc_is_moveable_obj(objspace, src));
-
-    struct heap_page *src_page = GET_HEAP_PAGE(src);
-    if (!free_page) {
-        return false;
-    }
-
-    /* We should return true if either src is successfully moved, or src is
-     * unmoveable. A false return will cause the sweeping cursor to be
-     * incremented to the next page, and src will attempt to move again */
-    GC_ASSERT(MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(src), src));
-
-    asan_unlock_freelist(free_page);
-    VALUE dest = (VALUE)free_page->freelist;
-    asan_lock_freelist(free_page);
-    asan_unpoison_object(dest, false);
-    if (!dest) {
-        /* if we can't get something from the freelist then the page must be
-         * full */
-        return false;
-    }
-    asan_unlock_freelist(free_page);
-    free_page->freelist = RANY(dest)->as.free.next;
-    asan_lock_freelist(free_page);
-
-    GC_ASSERT(RB_BUILTIN_TYPE(dest) == T_NONE);
-
-    if (src_page->slot_size > free_page->slot_size) {
-        objspace->rcompactor.moved_down_count_table[BUILTIN_TYPE(src)]++;
-    }
-    else if (free_page->slot_size > src_page->slot_size) {
-        objspace->rcompactor.moved_up_count_table[BUILTIN_TYPE(src)]++;
-    }
-    objspace->rcompactor.moved_count_table[BUILTIN_TYPE(src)]++;
-    objspace->rcompactor.total_moved++;
-
-    gc_move(objspace, src, dest, src_page->slot_size, free_page->slot_size);
-    gc_pin(objspace, src);
-    free_page->free_slots--;
-
-    return true;
-}
-
-static void
-gc_unprotect_pages(rb_objspace_t *objspace, rb_heap_t *heap)
-{
-    struct heap_page *cursor = heap->compact_cursor;
-
-    while (cursor) {
-        unlock_page_body(objspace, GET_PAGE_BODY(cursor->start));
-        cursor = ccan_list_next(&heap->pages, cursor, page_node);
-    }
-}
-
-static void gc_update_references(rb_objspace_t * objspace);
-#if GC_CAN_COMPILE_COMPACTION
-static void invalidate_moved_page(rb_objspace_t *objspace, struct heap_page *page);
-#endif
-
-#if defined(__MINGW32__) || defined(_WIN32)
-# define GC_COMPACTION_SUPPORTED 1
-#else
-/* If not MinGW, Windows, or does not have mmap, we cannot use mprotect for
- * the read barrier, so we must disable compaction. */
-# define GC_COMPACTION_SUPPORTED (GC_CAN_COMPILE_COMPACTION && HEAP_PAGE_ALLOC_USE_MMAP)
-#endif
-
-#if GC_CAN_COMPILE_COMPACTION
-static void
-read_barrier_handler(uintptr_t original_address)
-{
-    VALUE obj;
-    rb_objspace_t * objspace = &rb_objspace;
-
-    /* Calculate address aligned to slots. */
-    uintptr_t address = original_address - (original_address % BASE_SLOT_SIZE);
-
-    obj = (VALUE)address;
-
-    struct heap_page_body *page_body = GET_PAGE_BODY(obj);
-
-    /* If the page_body is NULL, then mprotect cannot handle it and will crash
-     * with "Cannot allocate memory". */
-    if (page_body == NULL) {
-        rb_bug("read_barrier_handler: segmentation fault at %p", (void *)original_address);
-    }
-
-    RB_VM_LOCK_ENTER();
-    {
-        unlock_page_body(objspace, page_body);
-
-        objspace->profile.read_barrier_faults++;
-
-        invalidate_moved_page(objspace, GET_HEAP_PAGE(obj));
-    }
-    RB_VM_LOCK_LEAVE();
-}
-#endif
-
-#if !GC_CAN_COMPILE_COMPACTION
-static void
-uninstall_handlers(void)
-{
-    /* no-op */
-}
-
-static void
-install_handlers(void)
-{
-    /* no-op */
-}
-#elif defined(_WIN32)
-static LPTOP_LEVEL_EXCEPTION_FILTER old_handler;
-typedef void (*signal_handler)(int);
-static signal_handler old_sigsegv_handler;
-
-static LONG WINAPI
-read_barrier_signal(EXCEPTION_POINTERS * info)
-{
-    /* EXCEPTION_ACCESS_VIOLATION is what's raised by access to protected pages */
-    if (info->ExceptionRecord->ExceptionCode == EXCEPTION_ACCESS_VIOLATION) {
-        /* > The second array element specifies the virtual address of the inaccessible data.
-         * https://docs.microsoft.com/en-us/windows/win32/api/winnt/ns-winnt-exception_record
-         *
-         * Use this address to invalidate the page */
-        read_barrier_handler((uintptr_t)info->ExceptionRecord->ExceptionInformation[1]);
-        return EXCEPTION_CONTINUE_EXECUTION;
-    }
-    else {
-        return EXCEPTION_CONTINUE_SEARCH;
-    }
-}
-
-static void
-uninstall_handlers(void)
-{
-    signal(SIGSEGV, old_sigsegv_handler);
-    SetUnhandledExceptionFilter(old_handler);
-}
-
-static void
-install_handlers(void)
-{
-    /* Remove SEGV handler so that the Unhandled Exception Filter handles it */
-    old_sigsegv_handler = signal(SIGSEGV, NULL);
-    /* Unhandled Exception Filter has access to the violation address similar
-     * to si_addr from sigaction */
-    old_handler = SetUnhandledExceptionFilter(read_barrier_signal);
-}
-#else
-static struct sigaction old_sigbus_handler;
-static struct sigaction old_sigsegv_handler;
-
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-static exception_mask_t old_exception_masks[32];
-static mach_port_t old_exception_ports[32];
-static exception_behavior_t old_exception_behaviors[32];
-static thread_state_flavor_t old_exception_flavors[32];
-static mach_msg_type_number_t old_exception_count;
-
-static void
-disable_mach_bad_access_exc(void)
-{
-    old_exception_count = sizeof(old_exception_masks) / sizeof(old_exception_masks[0]);
-    task_swap_exception_ports(
-        mach_task_self(), EXC_MASK_BAD_ACCESS,
-        MACH_PORT_NULL, EXCEPTION_DEFAULT, 0,
-        old_exception_masks, &old_exception_count,
-        old_exception_ports, old_exception_behaviors, old_exception_flavors
-    );
-}
-
-static void
-restore_mach_bad_access_exc(void)
-{
-    for (mach_msg_type_number_t i = 0; i < old_exception_count; i++) {
-        task_set_exception_ports(
-            mach_task_self(),
-            old_exception_masks[i], old_exception_ports[i],
-            old_exception_behaviors[i], old_exception_flavors[i]
-        );
-    }
-}
-#endif
-
-static void
-read_barrier_signal(int sig, siginfo_t * info, void * data)
-{
-    // setup SEGV/BUS handlers for errors
-    struct sigaction prev_sigbus, prev_sigsegv;
-    sigaction(SIGBUS, &old_sigbus_handler, &prev_sigbus);
-    sigaction(SIGSEGV, &old_sigsegv_handler, &prev_sigsegv);
-
-    // enable SIGBUS/SEGV
-    sigset_t set, prev_set;
-    sigemptyset(&set);
-    sigaddset(&set, SIGBUS);
-    sigaddset(&set, SIGSEGV);
-    sigprocmask(SIG_UNBLOCK, &set, &prev_set);
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-    disable_mach_bad_access_exc();
-#endif
-    // run handler
-    read_barrier_handler((uintptr_t)info->si_addr);
-
-    // reset SEGV/BUS handlers
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-    restore_mach_bad_access_exc();
-#endif
-    sigaction(SIGBUS, &prev_sigbus, NULL);
-    sigaction(SIGSEGV, &prev_sigsegv, NULL);
-    sigprocmask(SIG_SETMASK, &prev_set, NULL);
-}
-
-static void
-uninstall_handlers(void)
-{
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-    restore_mach_bad_access_exc();
-#endif
-    sigaction(SIGBUS, &old_sigbus_handler, NULL);
-    sigaction(SIGSEGV, &old_sigsegv_handler, NULL);
-}
-
-static void
-install_handlers(void)
-{
-    struct sigaction action;
-    memset(&action, 0, sizeof(struct sigaction));
-    sigemptyset(&action.sa_mask);
-    action.sa_sigaction = read_barrier_signal;
-    action.sa_flags = SA_SIGINFO | SA_ONSTACK;
-
-    sigaction(SIGBUS, &action, &old_sigbus_handler);
-    sigaction(SIGSEGV, &action, &old_sigsegv_handler);
-#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
-    disable_mach_bad_access_exc();
-#endif
-}
-#endif
-
-static void
-gc_compact_finish(rb_objspace_t *objspace)
-{
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-        gc_unprotect_pages(objspace, heap);
-    }
-
-    uninstall_handlers();
-
-    gc_update_references(objspace);
-    objspace->profile.compact_count++;
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-        heap->compact_cursor = NULL;
-        heap->free_pages = NULL;
-        heap->compact_cursor_index = 0;
-    }
-
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->moved_objects = objspace->rcompactor.total_moved - record->moved_objects;
-    }
-    objspace->flags.during_compacting = FALSE;
-}
-
-struct gc_sweep_context {
-    struct heap_page *page;
-    int final_slots;
-    int freed_slots;
-    int empty_slots;
-};
-
-static inline void
-gc_sweep_plane(rb_objspace_t *objspace, rb_heap_t *heap, uintptr_t p, bits_t bitset, struct gc_sweep_context *ctx)
-{
-    struct heap_page * sweep_page = ctx->page;
-    short slot_size = sweep_page->slot_size;
-    short slot_bits = slot_size / BASE_SLOT_SIZE;
-    GC_ASSERT(slot_bits > 0);
-
-    do {
-        VALUE vp = (VALUE)p;
-        GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
-
-        asan_unpoison_object(vp, false);
-        if (bitset & 1) {
-            switch (BUILTIN_TYPE(vp)) {
-              default: /* majority case */
-                gc_report(2, objspace, "page_sweep: free %p\n", (void *)p);
-#if RGENGC_CHECK_MODE
-                if (!is_full_marking(objspace)) {
-                    if (RVALUE_OLD_P(vp)) rb_bug("page_sweep: %p - old while minor GC.", (void *)p);
-                    if (RVALUE_REMEMBERED(vp)) rb_bug("page_sweep: %p - remembered.", (void *)p);
-                }
-#endif
-                if (obj_free(objspace, vp)) {
-                    // always add free slots back to the swept pages freelist,
-                    // so that if we're comapacting, we can re-use the slots
-                    (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)p, BASE_SLOT_SIZE);
-                    heap_page_add_freeobj(objspace, sweep_page, vp);
-                    gc_report(3, objspace, "page_sweep: %s is added to freelist\n", obj_info(vp));
-                    ctx->freed_slots++;
-                }
-                else {
-                    ctx->final_slots++;
-                }
-                break;
-
-              case T_MOVED:
-                if (objspace->flags.during_compacting) {
-                    /* The sweep cursor shouldn't have made it to any
-                     * T_MOVED slots while the compact flag is enabled.
-                     * The sweep cursor and compact cursor move in
-                     * opposite directions, and when they meet references will
-                     * get updated and "during_compacting" should get disabled */
-                    rb_bug("T_MOVED shouldn't be seen until compaction is finished");
-                }
-                gc_report(3, objspace, "page_sweep: %s is added to freelist\n", obj_info(vp));
-                ctx->empty_slots++;
-                heap_page_add_freeobj(objspace, sweep_page, vp);
-                break;
-              case T_ZOMBIE:
-                /* already counted */
-                break;
-              case T_NONE:
-                ctx->empty_slots++; /* already freed */
-                break;
-            }
-        }
-        p += slot_size;
-        bitset >>= slot_bits;
-    } while (bitset);
-}
-
-static inline void
-gc_sweep_page(rb_objspace_t *objspace, rb_heap_t *heap, struct gc_sweep_context *ctx)
-{
-    struct heap_page *sweep_page = ctx->page;
-    GC_ASSERT(SIZE_POOL_EDEN_HEAP(sweep_page->size_pool) == heap);
-
-    uintptr_t p;
-    bits_t *bits, bitset;
-
-    gc_report(2, objspace, "page_sweep: start.\n");
-
-#if RGENGC_CHECK_MODE
-    if (!objspace->flags.immediate_sweep) {
-        GC_ASSERT(sweep_page->flags.before_sweep == TRUE);
-    }
-#endif
-    sweep_page->flags.before_sweep = FALSE;
-    sweep_page->free_slots = 0;
-
-    p = (uintptr_t)sweep_page->start;
-    bits = sweep_page->mark_bits;
-
-    int page_rvalue_count = sweep_page->total_slots * (sweep_page->slot_size / BASE_SLOT_SIZE);
-    int out_of_range_bits = (NUM_IN_PAGE(p) + page_rvalue_count) % BITS_BITLENGTH;
-    if (out_of_range_bits != 0) { // sizeof(RVALUE) == 64
-        bits[BITMAP_INDEX(p) + page_rvalue_count / BITS_BITLENGTH] |= ~(((bits_t)1 << out_of_range_bits) - 1);
-    }
-
-    /* The last bitmap plane may not be used if the last plane does not
-     * have enough space for the slot_size. In that case, the last plane must
-     * be skipped since none of the bits will be set. */
-    int bitmap_plane_count = CEILDIV(NUM_IN_PAGE(p) + page_rvalue_count, BITS_BITLENGTH);
-    GC_ASSERT(bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT - 1 ||
-                  bitmap_plane_count == HEAP_PAGE_BITMAP_LIMIT);
-
-    // Skip out of range slots at the head of the page
-    bitset = ~bits[0];
-    bitset >>= NUM_IN_PAGE(p);
-    if (bitset) {
-        gc_sweep_plane(objspace, heap, p, bitset, ctx);
-    }
-    p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
-
-    for (int i = 1; i < bitmap_plane_count; i++) {
-        bitset = ~bits[i];
-        if (bitset) {
-            gc_sweep_plane(objspace, heap, p, bitset, ctx);
-        }
-        p += BITS_BITLENGTH * BASE_SLOT_SIZE;
-    }
-
-    if (!heap->compact_cursor) {
-        gc_setup_mark_bits(sweep_page);
-    }
-
-#if GC_PROFILE_MORE_DETAIL
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->removing_objects += ctx->final_slots + ctx->freed_slots;
-        record->empty_objects += ctx->empty_slots;
-    }
-#endif
-    if (0) fprintf(stderr, "gc_sweep_page(%"PRIdSIZE"): total_slots: %d, freed_slots: %d, empty_slots: %d, final_slots: %d\n",
-                   rb_gc_count(),
-                   sweep_page->total_slots,
-                   ctx->freed_slots, ctx->empty_slots, ctx->final_slots);
-
-    sweep_page->free_slots += ctx->freed_slots + ctx->empty_slots;
-    sweep_page->size_pool->total_freed_objects += ctx->freed_slots;
-
-    if (heap_pages_deferred_final && !finalizing) {
-        gc_finalize_deferred_register(objspace);
-    }
-
-#if RGENGC_CHECK_MODE
-    short freelist_len = 0;
-    asan_unlock_freelist(sweep_page);
-    RVALUE *ptr = sweep_page->freelist;
-    while (ptr) {
-        freelist_len++;
-        ptr = ptr->as.free.next;
-    }
-    asan_lock_freelist(sweep_page);
-    if (freelist_len != sweep_page->free_slots) {
-        rb_bug("inconsistent freelist length: expected %d but was %d", sweep_page->free_slots, freelist_len);
-    }
-#endif
-
-    gc_report(2, objspace, "page_sweep: end.\n");
-}
-
-static const char *
-gc_mode_name(enum gc_mode mode)
-{
-    switch (mode) {
-      case gc_mode_none: return "none";
-      case gc_mode_marking: return "marking";
-      case gc_mode_sweeping: return "sweeping";
-      case gc_mode_compacting: return "compacting";
-      default: rb_bug("gc_mode_name: unknown mode: %d", (int)mode);
-    }
-}
-
-static void
-gc_mode_transition(rb_objspace_t *objspace, enum gc_mode mode)
-{
-#if RGENGC_CHECK_MODE
-    enum gc_mode prev_mode = gc_mode(objspace);
-    switch (prev_mode) {
-      case gc_mode_none:     GC_ASSERT(mode == gc_mode_marking); break;
-      case gc_mode_marking:  GC_ASSERT(mode == gc_mode_sweeping); break;
-      case gc_mode_sweeping: GC_ASSERT(mode == gc_mode_none || mode == gc_mode_compacting); break;
-      case gc_mode_compacting: GC_ASSERT(mode == gc_mode_none); break;
-    }
-#endif
-    if (0) fprintf(stderr, "gc_mode_transition: %s->%s\n", gc_mode_name(gc_mode(objspace)), gc_mode_name(mode));
-    gc_mode_set(objspace, mode);
-}
-
-static void
-heap_page_freelist_append(struct heap_page *page, RVALUE *freelist)
-{
-    if (freelist) {
-        asan_unlock_freelist(page);
-        if (page->freelist) {
-            RVALUE *p = page->freelist;
-            asan_unpoison_object((VALUE)p, false);
-            while (p->as.free.next) {
-                RVALUE *prev = p;
-                p = p->as.free.next;
-                asan_poison_object((VALUE)prev);
-                asan_unpoison_object((VALUE)p, false);
-            }
-            p->as.free.next = freelist;
-            asan_poison_object((VALUE)p);
-        }
-        else {
-            page->freelist = freelist;
+        if (data.counts[i]) {
+            rb_hash_aset(hash, types[i], SIZET2NUM(data.counts[i]));
         }
-        asan_lock_freelist(page);
     }
-}
-
-static void
-gc_sweep_start_heap(rb_objspace_t *objspace, rb_heap_t *heap)
-{
-    heap->sweeping_page = ccan_list_top(&heap->pages, struct heap_page, page_node);
-    heap->free_pages = NULL;
-    heap->pooled_pages = NULL;
-    if (!objspace->flags.immediate_sweep) {
-        struct heap_page *page = NULL;
 
-        ccan_list_for_each(&heap->pages, page, page_node) {
-            page->flags.before_sweep = TRUE;
-        }
-    }
-}
-
-#if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 4
-__attribute__((noinline))
-#endif
-
-#if GC_CAN_COMPILE_COMPACTION
-static void gc_sort_heap_by_compare_func(rb_objspace_t *objspace, gc_compact_compare_func compare_func);
-static int compare_pinned_slots(const void *left, const void *right, void *d);
-#endif
-
-static void
-gc_sweep_start(rb_objspace_t *objspace)
-{
-    gc_mode_transition(objspace, gc_mode_sweeping);
-    objspace->rincgc.pooled_slots = 0;
-
-#if GC_CAN_COMPILE_COMPACTION
-    if (objspace->flags.during_compacting) {
-        gc_sort_heap_by_compare_func(
-            objspace,
-            objspace->rcompactor.compare_func ? objspace->rcompactor.compare_func : compare_pinned_slots
-        );
-    }
-#endif
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-        gc_sweep_start_heap(objspace, heap);
-
-        /* We should call gc_sweep_finish_size_pool for size pools with no pages. */
-        if (heap->sweeping_page == NULL) {
-            GC_ASSERT(heap->total_pages == 0);
-            GC_ASSERT(heap->total_slots == 0);
-            gc_sweep_finish_size_pool(objspace, size_pool);
-        }
-    }
-
-    rb_ractor_t *r = NULL;
-    ccan_list_for_each(&GET_VM()->ractor.set, r, vmlr_node) {
-        rb_gc_ractor_newobj_cache_clear(&r->newobj_cache);
-    }
-}
-
-static void
-gc_sweep_finish_size_pool(rb_objspace_t *objspace, rb_size_pool_t *size_pool)
-{
-    rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-    size_t total_slots = heap->total_slots + SIZE_POOL_TOMB_HEAP(size_pool)->total_slots;
-    size_t total_pages = heap->total_pages + SIZE_POOL_TOMB_HEAP(size_pool)->total_pages;
-    size_t swept_slots = size_pool->freed_slots + size_pool->empty_slots;
-
-    size_t init_slots = gc_params.size_pool_init_slots[size_pool - size_pools];
-    size_t min_free_slots = (size_t)(MAX(total_slots, init_slots) * gc_params.heap_free_slots_min_ratio);
-
-    /* If we don't have enough slots and we have pages on the tomb heap, move
-     * pages from the tomb heap to the eden heap. This may prevent page
-     * creation thrashing (frequently allocating and deallocting pages) and
-     * GC thrashing (running GC more frequently than required). */
-    struct heap_page *resurrected_page;
-    while (swept_slots < min_free_slots &&
-            (resurrected_page = heap_page_resurrect(objspace, size_pool))) {
-        swept_slots += resurrected_page->free_slots;
-
-        heap_add_page(objspace, size_pool, heap, resurrected_page);
-        heap_add_freepage(heap, resurrected_page);
-    }
-
-    if (swept_slots < min_free_slots) {
-        bool grow_heap = is_full_marking(objspace);
-
-        /* Consider growing or starting a major GC if we are not currently in a
-         * major GC and we can't allocate any more pages. */
-        if (!is_full_marking(objspace) && size_pool->allocatable_pages == 0) {
-            /* The heap is a growth heap if it freed more slots than had empty slots. */
-            bool is_growth_heap = size_pool->empty_slots == 0 || size_pool->freed_slots > size_pool->empty_slots;
-
-            /* Grow this heap if we haven't run at least RVALUE_OLD_AGE minor
-             * GC since the last major GC or if this heap is smaller than the
-             * the configured initial size. */
-            if (objspace->profile.count - objspace->rgengc.last_major_gc < RVALUE_OLD_AGE ||
-                    total_slots < init_slots) {
-                grow_heap = TRUE;
-            }
-            else if (is_growth_heap) { /* Only growth heaps are allowed to start a major GC. */
-                gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
-                size_pool->force_major_gc_count++;
-            }
-        }
-
-        if (grow_heap) {
-            size_t extend_page_count = heap_extend_pages(objspace, size_pool, swept_slots, total_slots, total_pages);
-
-            if (extend_page_count > size_pool->allocatable_pages) {
-                size_pool_allocatable_pages_set(objspace, size_pool, extend_page_count);
-            }
-        }
-    }
-}
-
-static void
-gc_sweep_finish(rb_objspace_t *objspace)
-{
-    gc_report(1, objspace, "gc_sweep_finish\n");
-
-    gc_prof_set_heap_info(objspace);
-    heap_pages_free_unused_pages(objspace);
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-
-        /* if heap_pages has unused pages, then assign them to increment */
-        size_t tomb_pages = SIZE_POOL_TOMB_HEAP(size_pool)->total_pages;
-        if (size_pool->allocatable_pages < tomb_pages) {
-            size_pool->allocatable_pages = tomb_pages;
-        }
-
-        size_pool->freed_slots = 0;
-        size_pool->empty_slots = 0;
-
-        if (!will_be_incremental_marking(objspace)) {
-            rb_heap_t *eden_heap = SIZE_POOL_EDEN_HEAP(size_pool);
-            struct heap_page *end_page = eden_heap->free_pages;
-            if (end_page) {
-                while (end_page->free_next) end_page = end_page->free_next;
-                end_page->free_next = eden_heap->pooled_pages;
-            }
-            else {
-                eden_heap->free_pages = eden_heap->pooled_pages;
-            }
-            eden_heap->pooled_pages = NULL;
-            objspace->rincgc.pooled_slots = 0;
-        }
-    }
-    heap_pages_expand_sorted(objspace);
-
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_GC_END_SWEEP, 0);
-    gc_mode_transition(objspace, gc_mode_none);
-
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-}
-
-static int
-gc_sweep_step(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
-{
-    struct heap_page *sweep_page = heap->sweeping_page;
-    int unlink_limit = GC_SWEEP_PAGES_FREEABLE_PER_STEP;
-    int swept_slots = 0;
-    int pooled_slots = 0;
-
-    if (sweep_page == NULL) return FALSE;
-
-#if GC_ENABLE_LAZY_SWEEP
-    gc_prof_sweep_timer_start(objspace);
-#endif
-
-    do {
-        RUBY_DEBUG_LOG("sweep_page:%p", (void *)sweep_page);
-
-        struct gc_sweep_context ctx = {
-            .page = sweep_page,
-            .final_slots = 0,
-            .freed_slots = 0,
-            .empty_slots = 0,
-        };
-        gc_sweep_page(objspace, heap, &ctx);
-        int free_slots = ctx.freed_slots + ctx.empty_slots;
-
-        heap->sweeping_page = ccan_list_next(&heap->pages, sweep_page, page_node);
-
-        if (sweep_page->final_slots + free_slots == sweep_page->total_slots &&
-            heap_pages_freeable_pages > 0 &&
-            unlink_limit > 0) {
-            heap_pages_freeable_pages--;
-            unlink_limit--;
-            /* there are no living objects -> move this page to tomb heap */
-            heap_unlink_page(objspace, heap, sweep_page);
-            heap_add_page(objspace, size_pool, SIZE_POOL_TOMB_HEAP(size_pool), sweep_page);
-        }
-        else if (free_slots > 0) {
-            size_pool->freed_slots += ctx.freed_slots;
-            size_pool->empty_slots += ctx.empty_slots;
-
-            if (pooled_slots < GC_INCREMENTAL_SWEEP_POOL_SLOT_COUNT) {
-                heap_add_poolpage(objspace, heap, sweep_page);
-                pooled_slots += free_slots;
-            }
-            else {
-                heap_add_freepage(heap, sweep_page);
-                swept_slots += free_slots;
-                if (swept_slots > GC_INCREMENTAL_SWEEP_SLOT_COUNT) {
-                    break;
-                }
-            }
-        }
-        else {
-            sweep_page->free_next = NULL;
-        }
-    } while ((sweep_page = heap->sweeping_page));
-
-    if (!heap->sweeping_page) {
-        gc_sweep_finish_size_pool(objspace, size_pool);
-
-        if (!has_sweeping_pages(objspace)) {
-            gc_sweep_finish(objspace);
-        }
-    }
-
-#if GC_ENABLE_LAZY_SWEEP
-    gc_prof_sweep_timer_stop(objspace);
-#endif
-
-    return heap->free_pages != NULL;
-}
-
-static void
-gc_sweep_rest(rb_objspace_t *objspace)
-{
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-
-        while (SIZE_POOL_EDEN_HEAP(size_pool)->sweeping_page) {
-            gc_sweep_step(objspace, size_pool, SIZE_POOL_EDEN_HEAP(size_pool));
-        }
-    }
-}
-
-static void
-gc_sweep_continue(rb_objspace_t *objspace, rb_size_pool_t *sweep_size_pool, rb_heap_t *heap)
-{
-    GC_ASSERT(dont_gc_val() == FALSE);
-    if (!GC_ENABLE_LAZY_SWEEP) return;
-
-    gc_sweeping_enter(objspace);
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        if (!gc_sweep_step(objspace, size_pool, SIZE_POOL_EDEN_HEAP(size_pool))) {
-            /* sweep_size_pool requires a free slot but sweeping did not yield any. */
-            if (size_pool == sweep_size_pool) {
-                if (size_pool->allocatable_pages > 0) {
-                    heap_increment(objspace, size_pool, heap);
-                }
-                else {
-                    /* Not allowed to create a new page so finish sweeping. */
-                    gc_sweep_rest(objspace);
-                    break;
-                }
-            }
-        }
-    }
-
-    gc_sweeping_exit(objspace);
-}
-
-#if GC_CAN_COMPILE_COMPACTION
-static void
-invalidate_moved_plane(rb_objspace_t *objspace, struct heap_page *page, uintptr_t p, bits_t bitset)
-{
-    if (bitset) {
-        do {
-            if (bitset & 1) {
-                VALUE forwarding_object = (VALUE)p;
-                VALUE object;
-
-                if (BUILTIN_TYPE(forwarding_object) == T_MOVED) {
-                    GC_ASSERT(MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(forwarding_object), forwarding_object));
-                    GC_ASSERT(!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(forwarding_object), forwarding_object));
-
-                    CLEAR_IN_BITMAP(GET_HEAP_PINNED_BITS(forwarding_object), forwarding_object);
-
-                    object = rb_gc_location(forwarding_object);
-
-                    shape_id_t original_shape_id = 0;
-                    if (RB_TYPE_P(object, T_OBJECT)) {
-                        original_shape_id = RMOVED(forwarding_object)->original_shape_id;
-                    }
-
-                    gc_move(objspace, object, forwarding_object, GET_HEAP_PAGE(object)->slot_size, page->slot_size);
-                    /* forwarding_object is now our actual object, and "object"
-                     * is the free slot for the original page */
-
-                    if (original_shape_id) {
-                        ROBJECT_SET_SHAPE_ID(forwarding_object, original_shape_id);
-                    }
-
-                    struct heap_page *orig_page = GET_HEAP_PAGE(object);
-                    orig_page->free_slots++;
-                    heap_page_add_freeobj(objspace, orig_page, object);
-
-                    GC_ASSERT(MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(forwarding_object), forwarding_object));
-                    GC_ASSERT(BUILTIN_TYPE(forwarding_object) != T_MOVED);
-                    GC_ASSERT(BUILTIN_TYPE(forwarding_object) != T_NONE);
-                }
-            }
-            p += BASE_SLOT_SIZE;
-            bitset >>= 1;
-        } while (bitset);
-    }
-}
-
-static void
-invalidate_moved_page(rb_objspace_t *objspace, struct heap_page *page)
-{
-    int i;
-    bits_t *mark_bits, *pin_bits;
-    bits_t bitset;
-
-    mark_bits = page->mark_bits;
-    pin_bits = page->pinned_bits;
-
-    uintptr_t p = page->start;
-
-    // Skip out of range slots at the head of the page
-    bitset = pin_bits[0] & ~mark_bits[0];
-    bitset >>= NUM_IN_PAGE(p);
-    invalidate_moved_plane(objspace, page, p, bitset);
-    p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
-
-    for (i=1; i < HEAP_PAGE_BITMAP_LIMIT; i++) {
-        /* Moved objects are pinned but never marked. We reuse the pin bits
-         * to indicate there is a moved object in this slot. */
-        bitset = pin_bits[i] & ~mark_bits[i];
-
-        invalidate_moved_plane(objspace, page, p, bitset);
-        p += BITS_BITLENGTH * BASE_SLOT_SIZE;
-    }
-}
-#endif
-
-static void
-gc_compact_start(rb_objspace_t *objspace)
-{
-    struct heap_page *page = NULL;
-    gc_mode_transition(objspace, gc_mode_compacting);
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(&size_pools[i]);
-        ccan_list_for_each(&heap->pages, page, page_node) {
-            page->flags.before_sweep = TRUE;
-        }
-
-        heap->compact_cursor = ccan_list_tail(&heap->pages, struct heap_page, page_node);
-        heap->compact_cursor_index = 0;
-    }
-
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->moved_objects = objspace->rcompactor.total_moved;
-    }
-
-    memset(objspace->rcompactor.considered_count_table, 0, T_MASK * sizeof(size_t));
-    memset(objspace->rcompactor.moved_count_table, 0, T_MASK * sizeof(size_t));
-    memset(objspace->rcompactor.moved_up_count_table, 0, T_MASK * sizeof(size_t));
-    memset(objspace->rcompactor.moved_down_count_table, 0, T_MASK * sizeof(size_t));
-
-    /* Set up read barrier for pages containing MOVED objects */
-    install_handlers();
-}
-
-static void gc_sweep_compact(rb_objspace_t *objspace);
-
-static void
-gc_sweep(rb_objspace_t *objspace)
-{
-    gc_sweeping_enter(objspace);
-
-    const unsigned int immediate_sweep = objspace->flags.immediate_sweep;
-
-    gc_report(1, objspace, "gc_sweep: immediate: %d\n", immediate_sweep);
-
-    gc_sweep_start(objspace);
-    if (objspace->flags.during_compacting) {
-        gc_sweep_compact(objspace);
-    }
-
-    if (immediate_sweep) {
-#if !GC_ENABLE_LAZY_SWEEP
-        gc_prof_sweep_timer_start(objspace);
-#endif
-        gc_sweep_rest(objspace);
-#if !GC_ENABLE_LAZY_SWEEP
-        gc_prof_sweep_timer_stop(objspace);
-#endif
-    }
-    else {
-
-        /* Sweep every size pool. */
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            gc_sweep_step(objspace, size_pool, SIZE_POOL_EDEN_HEAP(size_pool));
-        }
-    }
-
-    gc_sweeping_exit(objspace);
-}
-
-/* Marking - Marking stack */
-
-static stack_chunk_t *
-stack_chunk_alloc(void)
-{
-    stack_chunk_t *res;
-
-    res = malloc(sizeof(stack_chunk_t));
-    if (!res)
-        rb_memerror();
-
-    return res;
-}
-
-static inline int
-is_mark_stack_empty(mark_stack_t *stack)
-{
-    return stack->chunk == NULL;
-}
-
-static size_t
-mark_stack_size(mark_stack_t *stack)
-{
-    size_t size = stack->index;
-    stack_chunk_t *chunk = stack->chunk ? stack->chunk->next : NULL;
-
-    while (chunk) {
-        size += stack->limit;
-        chunk = chunk->next;
-    }
-    return size;
-}
-
-static void
-add_stack_chunk_cache(mark_stack_t *stack, stack_chunk_t *chunk)
-{
-    chunk->next = stack->cache;
-    stack->cache = chunk;
-    stack->cache_size++;
-}
-
-static void
-shrink_stack_chunk_cache(mark_stack_t *stack)
-{
-    stack_chunk_t *chunk;
-
-    if (stack->unused_cache_size > (stack->cache_size/2)) {
-        chunk = stack->cache;
-        stack->cache = stack->cache->next;
-        stack->cache_size--;
-        free(chunk);
-    }
-    stack->unused_cache_size = stack->cache_size;
-}
-
-static void
-push_mark_stack_chunk(mark_stack_t *stack)
-{
-    stack_chunk_t *next;
-
-    GC_ASSERT(stack->index == stack->limit);
-
-    if (stack->cache_size > 0) {
-        next = stack->cache;
-        stack->cache = stack->cache->next;
-        stack->cache_size--;
-        if (stack->unused_cache_size > stack->cache_size)
-            stack->unused_cache_size = stack->cache_size;
-    }
-    else {
-        next = stack_chunk_alloc();
-    }
-    next->next = stack->chunk;
-    stack->chunk = next;
-    stack->index = 0;
-}
-
-static void
-pop_mark_stack_chunk(mark_stack_t *stack)
-{
-    stack_chunk_t *prev;
-
-    prev = stack->chunk->next;
-    GC_ASSERT(stack->index == 0);
-    add_stack_chunk_cache(stack, stack->chunk);
-    stack->chunk = prev;
-    stack->index = stack->limit;
-}
-
-static void
-mark_stack_chunk_list_free(stack_chunk_t *chunk)
-{
-    stack_chunk_t *next = NULL;
-
-    while (chunk != NULL) {
-        next = chunk->next;
-        free(chunk);
-        chunk = next;
-    }
-}
-
-static void
-free_stack_chunks(mark_stack_t *stack)
-{
-    mark_stack_chunk_list_free(stack->chunk);
-}
-
-static void
-mark_stack_free_cache(mark_stack_t *stack)
-{
-    mark_stack_chunk_list_free(stack->cache);
-    stack->cache_size = 0;
-    stack->unused_cache_size = 0;
-}
-
-static void
-push_mark_stack(mark_stack_t *stack, VALUE obj)
-{
-    switch (BUILTIN_TYPE(obj)) {
-      case T_OBJECT:
-      case T_CLASS:
-      case T_MODULE:
-      case T_FLOAT:
-      case T_STRING:
-      case T_REGEXP:
-      case T_ARRAY:
-      case T_HASH:
-      case T_STRUCT:
-      case T_BIGNUM:
-      case T_FILE:
-      case T_DATA:
-      case T_MATCH:
-      case T_COMPLEX:
-      case T_RATIONAL:
-      case T_TRUE:
-      case T_FALSE:
-      case T_SYMBOL:
-      case T_IMEMO:
-      case T_ICLASS:
-        if (stack->index == stack->limit) {
-            push_mark_stack_chunk(stack);
-        }
-        stack->chunk->data[stack->index++] = obj;
-        return;
-
-      case T_NONE:
-      case T_NIL:
-      case T_FIXNUM:
-      case T_MOVED:
-      case T_ZOMBIE:
-      case T_UNDEF:
-      case T_MASK:
-        rb_bug("push_mark_stack() called for broken object");
-        break;
-
-      case T_NODE:
-        UNEXPECTED_NODE(push_mark_stack);
-        break;
-    }
-
-    rb_bug("rb_gc_mark(): unknown data type 0x%x(%p) %s",
-            BUILTIN_TYPE(obj), (void *)obj,
-            is_pointer_to_heap(&rb_objspace, (void *)obj) ? "corrupted object" : "non object");
-}
-
-static int
-pop_mark_stack(mark_stack_t *stack, VALUE *data)
-{
-    if (is_mark_stack_empty(stack)) {
-        return FALSE;
-    }
-    if (stack->index == 1) {
-        *data = stack->chunk->data[--stack->index];
-        pop_mark_stack_chunk(stack);
-    }
-    else {
-        *data = stack->chunk->data[--stack->index];
-    }
-    return TRUE;
-}
-
-static void
-init_mark_stack(mark_stack_t *stack)
-{
-    int i;
-
-    MEMZERO(stack, mark_stack_t, 1);
-    stack->index = stack->limit = STACK_CHUNK_SIZE;
-
-    for (i=0; i < 4; i++) {
-        add_stack_chunk_cache(stack, stack_chunk_alloc());
-    }
-    stack->unused_cache_size = stack->cache_size;
+    return hash;
 }
 
-/* Marking */
-
 #define SET_STACK_END SET_MACHINE_STACK_END(&ec->machine.stack_end)
 
 #define STACK_START (ec->machine.stack_start)
@@ -6191,188 +2863,192 @@ ruby_stack_check(void)
     return stack_check(GET_EC(), STACKFRAME_FOR_CALL_CFUNC);
 }
 
-ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(static void each_location(rb_objspace_t *objspace, register const VALUE *x, register long n, void (*cb)(rb_objspace_t *, VALUE)));
-static void
-each_location(rb_objspace_t *objspace, register const VALUE *x, register long n, void (*cb)(rb_objspace_t *, VALUE))
-{
-    VALUE v;
-    while (n--) {
-        v = *x;
-        cb(objspace, v);
-        x++;
-    }
-}
+/* ==================== Marking ==================== */
 
-static void
-gc_mark_locations(rb_objspace_t *objspace, const VALUE *start, const VALUE *end, void (*cb)(rb_objspace_t *, VALUE))
-{
-    long n;
+#define RB_GC_MARK_OR_TRAVERSE(func, obj_or_ptr, obj, check_obj) do { \
+    if (!RB_SPECIAL_CONST_P(obj)) { \
+        rb_vm_t *vm = GET_VM(); \
+        void *objspace = vm->gc.objspace; \
+        if (LIKELY(vm->gc.mark_func_data == NULL)) { \
+            GC_ASSERT(rb_gc_impl_during_gc_p(objspace)); \
+            (func)(objspace, (obj_or_ptr)); \
+        } \
+        else if (check_obj ? \
+                rb_gc_impl_pointer_to_heap_p(objspace, (const void *)obj) && \
+                    !rb_gc_impl_garbage_object_p(objspace, obj) : \
+                true) { \
+            GC_ASSERT(!rb_gc_impl_during_gc_p(objspace)); \
+            struct gc_mark_func_data_struct *mark_func_data = vm->gc.mark_func_data; \
+            vm->gc.mark_func_data = NULL; \
+            mark_func_data->mark_func((obj), mark_func_data->data); \
+            vm->gc.mark_func_data = mark_func_data; \
+        } \
+    } \
+} while (0)
 
-    if (end <= start) return;
-    n = end - start;
-    each_location(objspace, start, n, cb);
+static inline void
+gc_mark_internal(VALUE obj)
+{
+    RB_GC_MARK_OR_TRAVERSE(rb_gc_impl_mark, obj, obj, false);
 }
 
 void
-rb_gc_mark_locations(const VALUE *start, const VALUE *end)
+rb_gc_mark_movable(VALUE obj)
 {
-    gc_mark_locations(&rb_objspace, start, end, gc_mark_maybe);
+    gc_mark_internal(obj);
 }
 
 void
-rb_gc_mark_values(long n, const VALUE *values)
+rb_gc_mark_and_move(VALUE *ptr)
 {
-    long i;
-    rb_objspace_t *objspace = &rb_objspace;
+    RB_GC_MARK_OR_TRAVERSE(rb_gc_impl_mark_and_move, ptr, *ptr, false);
+}
 
-    for (i=0; i<n; i++) {
-        gc_mark(objspace, values[i]);
-    }
+static inline void
+gc_mark_and_pin_internal(VALUE obj)
+{
+    RB_GC_MARK_OR_TRAVERSE(rb_gc_impl_mark_and_pin, obj, obj, false);
 }
 
 void
-rb_gc_mark_vm_stack_values(long n, const VALUE *values)
+rb_gc_mark(VALUE obj)
 {
-    rb_objspace_t *objspace = &rb_objspace;
+    gc_mark_and_pin_internal(obj);
+}
 
-    for (long i = 0; i < n; i++) {
-        gc_mark_and_pin(objspace, values[i]);
-    }
+static inline void
+gc_mark_maybe_internal(VALUE obj)
+{
+    RB_GC_MARK_OR_TRAVERSE(rb_gc_impl_mark_maybe, obj, obj, true);
 }
 
-static int
-mark_value(st_data_t key, st_data_t value, st_data_t data)
+void
+rb_gc_mark_maybe(VALUE obj)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    gc_mark(objspace, (VALUE)value);
-    return ST_CONTINUE;
+    gc_mark_maybe_internal(obj);
 }
 
-static int
-mark_value_pin(st_data_t key, st_data_t value, st_data_t data)
+ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(static void each_location(register const VALUE *x, register long n, void (*cb)(VALUE, void *), void *data));
+static void
+each_location(register const VALUE *x, register long n, void (*cb)(VALUE, void *), void *data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    gc_mark_and_pin(objspace, (VALUE)value);
-    return ST_CONTINUE;
+    VALUE v;
+    while (n--) {
+        v = *x;
+        cb(v, data);
+        x++;
+    }
 }
 
 static void
-mark_tbl_no_pin(rb_objspace_t *objspace, st_table *tbl)
+each_location_ptr(const VALUE *start, const VALUE *end, void (*cb)(VALUE, void *), void *data)
 {
-    if (!tbl || tbl->num_entries == 0) return;
-    st_foreach(tbl, mark_value, (st_data_t)objspace);
+    if (end <= start) return;
+    each_location(start, end - start, cb, data);
 }
 
 static void
-mark_tbl(rb_objspace_t *objspace, st_table *tbl)
+gc_mark_maybe_each_location(VALUE obj, void *data)
 {
-    if (!tbl || tbl->num_entries == 0) return;
-    st_foreach(tbl, mark_value_pin, (st_data_t)objspace);
+    gc_mark_maybe_internal(obj);
 }
 
-static int
-mark_key(st_data_t key, st_data_t value, st_data_t data)
+void
+rb_gc_mark_locations(const VALUE *start, const VALUE *end)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    gc_mark_and_pin(objspace, (VALUE)key);
-    return ST_CONTINUE;
+    each_location_ptr(start, end, gc_mark_maybe_each_location, NULL);
 }
 
-static void
-mark_set(rb_objspace_t *objspace, st_table *tbl)
+void
+rb_gc_mark_values(long n, const VALUE *values)
 {
-    if (!tbl) return;
-    st_foreach(tbl, mark_key, (st_data_t)objspace);
+    for (long i = 0; i < n; i++) {
+        gc_mark_internal(values[i]);
+    }
 }
 
-static int
-pin_value(st_data_t key, st_data_t value, st_data_t data)
+void
+rb_gc_mark_vm_stack_values(long n, const VALUE *values)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    gc_mark_and_pin(objspace, (VALUE)value);
-    return ST_CONTINUE;
+    for (long i = 0; i < n; i++) {
+        gc_mark_and_pin_internal(values[i]);
+    }
 }
 
-static void
-mark_finalizer_tbl(rb_objspace_t *objspace, st_table *tbl)
+static int
+mark_key(st_data_t key, st_data_t value, st_data_t data)
 {
-    if (!tbl) return;
-    st_foreach(tbl, pin_value, (st_data_t)objspace);
+    gc_mark_and_pin_internal((VALUE)key);
+
+    return ST_CONTINUE;
 }
 
 void
 rb_mark_set(st_table *tbl)
 {
-    mark_set(&rb_objspace, tbl);
+    if (!tbl) return;
+
+    st_foreach(tbl, mark_key, (st_data_t)rb_gc_get_objspace());
 }
 
 static int
 mark_keyvalue(st_data_t key, st_data_t value, st_data_t data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    gc_mark_internal((VALUE)key);
+    gc_mark_internal((VALUE)value);
 
-    gc_mark(objspace, (VALUE)key);
-    gc_mark(objspace, (VALUE)value);
     return ST_CONTINUE;
 }
 
 static int
 pin_key_pin_value(st_data_t key, st_data_t value, st_data_t data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    gc_mark_and_pin_internal((VALUE)key);
+    gc_mark_and_pin_internal((VALUE)value);
 
-    gc_mark_and_pin(objspace, (VALUE)key);
-    gc_mark_and_pin(objspace, (VALUE)value);
     return ST_CONTINUE;
 }
 
 static int
 pin_key_mark_value(st_data_t key, st_data_t value, st_data_t data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    gc_mark_and_pin_internal((VALUE)key);
+    gc_mark_internal((VALUE)value);
 
-    gc_mark_and_pin(objspace, (VALUE)key);
-    gc_mark(objspace, (VALUE)value);
     return ST_CONTINUE;
 }
 
 static void
-mark_hash(rb_objspace_t *objspace, VALUE hash)
+mark_hash(VALUE hash)
 {
     if (rb_hash_compare_by_id_p(hash)) {
-        rb_hash_stlike_foreach(hash, pin_key_mark_value, (st_data_t)objspace);
+        rb_hash_stlike_foreach(hash, pin_key_mark_value, 0);
     }
     else {
-        rb_hash_stlike_foreach(hash, mark_keyvalue, (st_data_t)objspace);
+        rb_hash_stlike_foreach(hash, mark_keyvalue, 0);
     }
 
-    gc_mark(objspace, RHASH(hash)->ifnone);
-}
-
-static void
-mark_st(rb_objspace_t *objspace, st_table *tbl)
-{
-    if (!tbl) return;
-    st_foreach(tbl, pin_key_pin_value, (st_data_t)objspace);
+    gc_mark_internal(RHASH(hash)->ifnone);
 }
 
 void
 rb_mark_hash(st_table *tbl)
 {
-    mark_st(&rb_objspace, tbl);
+    if (!tbl) return;
+
+    st_foreach(tbl, pin_key_pin_value, 0);
 }
 
 static enum rb_id_table_iterator_result
-mark_method_entry_i(VALUE me, void *data)
+mark_method_entry_i(VALUE me, void *objspace)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    gc_mark_internal(me);
 
-    gc_mark(objspace, me);
     return ID_TABLE_CONTINUE;
 }
 
 static void
-mark_m_tbl(rb_objspace_t *objspace, struct rb_id_table *tbl)
+mark_m_tbl(void *objspace, struct rb_id_table *tbl)
 {
     if (tbl) {
         rb_id_table_foreach_values(tbl, mark_method_entry_i, objspace);
@@ -6380,13 +3056,14 @@ mark_m_tbl(rb_objspace_t *objspace, struct rb_id_table *tbl)
 }
 
 static enum rb_id_table_iterator_result
-mark_const_entry_i(VALUE value, void *data)
+mark_const_entry_i(VALUE value, void *objspace)
 {
     const rb_const_entry_t *ce = (const rb_const_entry_t *)value;
-    rb_objspace_t *objspace = data;
 
-    gc_mark(objspace, ce->value);
-    gc_mark(objspace, ce->file);
+    if (!rb_gc_checking_shareable()) {
+        gc_mark_internal(ce->value);
+        gc_mark_internal(ce->file); // TODO: ce->file should be shareable?
+    }
     return ID_TABLE_CONTINUE;
 }
 
@@ -6407,16 +3084,13 @@ mark_const_tbl(rb_objspace_t *objspace, struct rb_id_table *tbl)
      ((start) = STACK_END, (end) = STACK_START) : ((start) = STACK_START, (end) = STACK_END+(appendix)))
 #endif
 
-static void each_stack_location(rb_objspace_t *objspace, const rb_execution_context_t *ec,
-                                 const VALUE *stack_start, const VALUE *stack_end, void (*cb)(rb_objspace_t *, VALUE));
-
 static void
-gc_mark_machine_stack_location_maybe(rb_objspace_t *objspace, VALUE obj)
+gc_mark_machine_stack_location_maybe(VALUE obj, void *data)
 {
-    gc_mark_maybe(objspace, obj);
+    gc_mark_maybe_internal(obj);
 
 #ifdef RUBY_ASAN_ENABLED
-    const rb_execution_context_t *ec = objspace->marking_machine_context_ec;
+    const rb_execution_context_t *ec = (const rb_execution_context_t *)data;
     void *fake_frame_start;
     void *fake_frame_end;
     bool is_fake_frame = asan_get_fake_stack_extents(
@@ -6425,11 +3099,39 @@ gc_mark_machine_stack_location_maybe(rb_objspace_t *objspace, VALUE obj)
         &fake_frame_start, &fake_frame_end
     );
     if (is_fake_frame) {
-        each_stack_location(objspace, ec, fake_frame_start, fake_frame_end, gc_mark_maybe);
+        each_location_ptr(fake_frame_start, fake_frame_end, gc_mark_maybe_each_location, NULL);
     }
 #endif
 }
 
+static bool
+gc_object_moved_p_internal(void *objspace, VALUE obj)
+{
+    if (SPECIAL_CONST_P(obj)) {
+        return false;
+    }
+
+    return rb_gc_impl_object_moved_p(objspace, obj);
+}
+
+static VALUE
+gc_location_internal(void *objspace, VALUE value)
+{
+    if (SPECIAL_CONST_P(value)) {
+        return value;
+    }
+
+    GC_ASSERT(rb_gc_impl_pointer_to_heap_p(objspace, (void *)value));
+
+    return rb_gc_impl_location(objspace, value);
+}
+
+VALUE
+rb_gc_location(VALUE value)
+{
+    return gc_location_internal(rb_gc_get_objspace(), value);
+}
+
 #if defined(__wasm__)
 
 
@@ -6442,420 +3144,259 @@ rb_mark_locations(void *begin, void *end)
     rb_stack_range_tmp[1] = end;
 }
 
+void
+rb_gc_save_machine_context(void)
+{
+    // no-op
+}
+
 # if defined(__EMSCRIPTEN__)
 
 static void
-mark_current_machine_context(rb_objspace_t *objspace, rb_execution_context_t *ec)
+mark_current_machine_context(const rb_execution_context_t *ec)
 {
     emscripten_scan_stack(rb_mark_locations);
-    each_stack_location(objspace, ec, rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe);
+    each_location_ptr(rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe_each_location, NULL);
 
     emscripten_scan_registers(rb_mark_locations);
-    each_stack_location(objspace, ec, rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe);
+    each_location_ptr(rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe_each_location, NULL);
 }
 # else // use Asyncify version
 
 static void
-mark_current_machine_context(rb_objspace_t *objspace, rb_execution_context_t *ec)
+mark_current_machine_context(rb_execution_context_t *ec)
 {
     VALUE *stack_start, *stack_end;
     SET_STACK_END;
     GET_STACK_BOUNDS(stack_start, stack_end, 1);
-    each_stack_location(objspace, ec, stack_start, stack_end, gc_mark_maybe);
+    each_location_ptr(stack_start, stack_end, gc_mark_maybe_each_location, NULL);
 
     rb_wasm_scan_locals(rb_mark_locations);
-    each_stack_location(objspace, ec, rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe);
+    each_location_ptr(rb_stack_range_tmp[0], rb_stack_range_tmp[1], gc_mark_maybe_each_location, NULL);
 }
 
 # endif
 
 #else // !defined(__wasm__)
 
-static void
-mark_current_machine_context(rb_objspace_t *objspace, rb_execution_context_t *ec)
+void
+rb_gc_save_machine_context(void)
 {
-    union {
-        rb_jmp_buf j;
-        VALUE v[sizeof(rb_jmp_buf) / (sizeof(VALUE))];
-    } save_regs_gc_mark;
-    VALUE *stack_start, *stack_end;
+    rb_thread_t *thread = GET_THREAD();
 
-    FLUSH_REGISTER_WINDOWS;
-    memset(&save_regs_gc_mark, 0, sizeof(save_regs_gc_mark));
-    /* This assumes that all registers are saved into the jmp_buf (and stack) */
-    rb_setjmp(save_regs_gc_mark.j);
-
-    /* SET_STACK_END must be called in this function because
-     * the stack frame of this function may contain
-     * callee save registers and they should be marked. */
-    SET_STACK_END;
-    GET_STACK_BOUNDS(stack_start, stack_end, 1);
-
-#ifdef RUBY_ASAN_ENABLED
-    objspace->marking_machine_context_ec = ec;
-#endif
+    RB_VM_SAVE_MACHINE_CONTEXT(thread);
+}
 
-    each_location(objspace, save_regs_gc_mark.v, numberof(save_regs_gc_mark.v), gc_mark_machine_stack_location_maybe);
-    each_stack_location(objspace, ec, stack_start, stack_end, gc_mark_machine_stack_location_maybe);
 
-#ifdef RUBY_ASAN_ENABLED
-    objspace->marking_machine_context_ec = NULL;
-#endif
+static void
+mark_current_machine_context(const rb_execution_context_t *ec)
+{
+    rb_gc_mark_machine_context(ec);
 }
 #endif
 
 void
 rb_gc_mark_machine_context(const rb_execution_context_t *ec)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-#ifdef RUBY_ASAN_ENABLED
-    objspace->marking_machine_context_ec = ec;
-#endif
-
     VALUE *stack_start, *stack_end;
 
     GET_STACK_BOUNDS(stack_start, stack_end, 0);
     RUBY_DEBUG_LOG("ec->th:%u stack_start:%p stack_end:%p", rb_ec_thread_ptr(ec)->serial, stack_start, stack_end);
 
-    each_stack_location(objspace, ec, stack_start, stack_end, gc_mark_machine_stack_location_maybe);
-    int num_regs = sizeof(ec->machine.regs)/(sizeof(VALUE));
-    each_location(objspace, (VALUE*)&ec->machine.regs, num_regs, gc_mark_machine_stack_location_maybe);
-
+    void *data =
 #ifdef RUBY_ASAN_ENABLED
-    objspace->marking_machine_context_ec = NULL;
+        /* gc_mark_machine_stack_location_maybe() uses data as const */
+        (rb_execution_context_t *)ec;
+#else
+        NULL;
 #endif
+
+    each_location_ptr(stack_start, stack_end, gc_mark_machine_stack_location_maybe, data);
+    int num_regs = sizeof(ec->machine.regs)/(sizeof(VALUE));
+    each_location((VALUE*)&ec->machine.regs, num_regs, gc_mark_machine_stack_location_maybe, data);
 }
 
-static void
-each_stack_location(rb_objspace_t *objspace, const rb_execution_context_t *ec,
-                     const VALUE *stack_start, const VALUE *stack_end, void (*cb)(rb_objspace_t *, VALUE))
+static int
+rb_mark_tbl_i(st_data_t key, st_data_t value, st_data_t data)
 {
+    gc_mark_and_pin_internal((VALUE)value);
 
-    gc_mark_locations(objspace, stack_start, stack_end, cb);
-
-#if defined(__mc68000__)
-    gc_mark_locations(objspace,
-                      (VALUE*)((char*)stack_start + 2),
-                      (VALUE*)((char*)stack_end - 2), cb);
-#endif
+    return ST_CONTINUE;
 }
 
 void
 rb_mark_tbl(st_table *tbl)
 {
-    mark_tbl(&rb_objspace, tbl);
-}
+    if (!tbl || tbl->num_entries == 0) return;
 
-void
-rb_mark_tbl_no_pin(st_table *tbl)
-{
-    mark_tbl_no_pin(&rb_objspace, tbl);
+    st_foreach(tbl, rb_mark_tbl_i, 0);
 }
 
 static void
-gc_mark_maybe(rb_objspace_t *objspace, VALUE obj)
+gc_mark_tbl_no_pin(st_table *tbl)
 {
-    (void)VALGRIND_MAKE_MEM_DEFINED(&obj, sizeof(obj));
-
-    if (is_pointer_to_heap(objspace, (void *)obj)) {
-        void *ptr = asan_unpoison_object_temporary(obj);
-
-        /* Garbage can live on the stack, so do not mark or pin */
-        switch (BUILTIN_TYPE(obj)) {
-          case T_ZOMBIE:
-          case T_NONE:
-            break;
-          default:
-            gc_mark_and_pin(objspace, obj);
-            break;
-        }
+    if (!tbl || tbl->num_entries == 0) return;
 
-        if (ptr) {
-            GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
-            asan_poison_object(obj);
-        }
-    }
+    st_foreach(tbl, gc_mark_tbl_no_pin_i, 0);
 }
 
 void
-rb_gc_mark_maybe(VALUE obj)
-{
-    gc_mark_maybe(&rb_objspace, obj);
-}
-
-static inline int
-gc_mark_set(rb_objspace_t *objspace, VALUE obj)
+rb_mark_tbl_no_pin(st_table *tbl)
 {
-    ASSERT_vm_locking();
-    if (RVALUE_MARKED(obj)) return 0;
-    MARK_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj);
-    return 1;
+    gc_mark_tbl_no_pin(tbl);
 }
 
-static int
-gc_remember_unprotected(rb_objspace_t *objspace, VALUE obj)
+void
+rb_gc_mark_set_no_pin(st_table *tbl)
 {
-    struct heap_page *page = GET_HEAP_PAGE(obj);
-    bits_t *uncollectible_bits = &page->uncollectible_bits[0];
-
-    if (!MARKED_IN_BITMAP(uncollectible_bits, obj)) {
-        page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
-        MARK_IN_BITMAP(uncollectible_bits, obj);
-        objspace->rgengc.uncollectible_wb_unprotected_objects++;
+    if (!tbl || tbl->num_entries == 0) return;
 
-#if RGENGC_PROFILE > 0
-        objspace->profile.total_remembered_shady_object_count++;
-#if RGENGC_PROFILE >= 2
-        objspace->profile.remembered_shady_object_count_types[BUILTIN_TYPE(obj)]++;
-#endif
-#endif
-        return TRUE;
-    }
-    else {
-        return FALSE;
-    }
+    st_foreach(tbl, gc_mark_set_no_pin_i, 0);
 }
 
-static void
-rgengc_check_relation(rb_objspace_t *objspace, VALUE obj)
+static bool
+gc_declarative_marking_p(const rb_data_type_t *type)
 {
-    const VALUE old_parent = objspace->rgengc.parent_object;
-
-    if (old_parent) { /* parent object is old */
-        if (RVALUE_WB_UNPROTECTED(obj) || !RVALUE_OLD_P(obj)) {
-            rgengc_remember(objspace, old_parent);
-        }
-    }
-
-    GC_ASSERT(old_parent == objspace->rgengc.parent_object);
+    return (type->flags & RUBY_TYPED_DECL_MARKING) != 0;
 }
 
-static void
-gc_grey(rb_objspace_t *objspace, VALUE obj)
+rb_execution_context_t *
+rb_gc_get_ec(void)
 {
-#if RGENGC_CHECK_MODE
-    if (RVALUE_MARKED(obj) == FALSE) rb_bug("gc_grey: %s is not marked.", obj_info(obj));
-    if (RVALUE_MARKING(obj) == TRUE) rb_bug("gc_grey: %s is marking/remembered.", obj_info(obj));
-#endif
+    void *objspace = rb_gc_get_objspace();
 
-    if (is_incremental_marking(objspace)) {
-        MARK_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
+    if (RB_LIKELY(rb_gc_impl_during_gc_p(objspace))) {
+        return rb_gc_impl_get_vm_context(objspace)->ec;
+    }
+    else {
+        return GET_EC();
     }
-
-    push_mark_stack(&objspace->mark_stack, obj);
 }
 
-static void
-gc_aging(rb_objspace_t *objspace, VALUE obj)
+void
+rb_gc_mark_roots(void *objspace, const char **categoryp)
 {
-    struct heap_page *page = GET_HEAP_PAGE(obj);
-
-    GC_ASSERT(RVALUE_MARKING(obj) == FALSE);
-    check_rvalue_consistency(obj);
+    rb_execution_context_t *ec = rb_gc_get_ec();
+    rb_vm_t *vm = rb_ec_vm_ptr(ec);
 
-    if (!RVALUE_PAGE_WB_UNPROTECTED(page, obj)) {
-        if (!RVALUE_OLD_P(obj)) {
-            gc_report(3, objspace, "gc_aging: YOUNG: %s\n", obj_info(obj));
-            RVALUE_AGE_INC(objspace, obj);
-        }
-        else if (is_full_marking(objspace)) {
-            GC_ASSERT(RVALUE_PAGE_UNCOLLECTIBLE(page, obj) == FALSE);
-            RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(objspace, page, obj);
-        }
-    }
-    check_rvalue_consistency(obj);
+#define MARK_CHECKPOINT(category) do { \
+    if (categoryp) *categoryp = category; \
+} while (0)
 
-    objspace->marked_slots++;
-}
+    MARK_CHECKPOINT("vm");
+    rb_vm_mark(vm);
 
-NOINLINE(static void gc_mark_ptr(rb_objspace_t *objspace, VALUE obj));
-static void reachable_objects_from_callback(VALUE obj);
+    MARK_CHECKPOINT("end_proc");
+    rb_mark_end_proc();
 
-static void
-gc_mark_ptr(rb_objspace_t *objspace, VALUE obj)
-{
-    if (LIKELY(during_gc)) {
-        rgengc_check_relation(objspace, obj);
-        if (!gc_mark_set(objspace, obj)) return; /* already marked */
+    MARK_CHECKPOINT("global_tbl");
+    rb_gc_mark_global_tbl();
 
-        if (0) { // for debug GC marking miss
-            if (objspace->rgengc.parent_object) {
-                RUBY_DEBUG_LOG("%p (%s) parent:%p (%s)",
-                               (void *)obj, obj_type_name(obj),
-                               (void *)objspace->rgengc.parent_object, obj_type_name(objspace->rgengc.parent_object));
-            }
-            else {
-                RUBY_DEBUG_LOG("%p (%s)", (void *)obj, obj_type_name(obj));
-            }
-        }
+#if USE_YJIT
+    void rb_yjit_root_mark(void); // in Rust
 
-        if (UNLIKELY(RB_TYPE_P(obj, T_NONE))) {
-            rp(obj);
-            rb_bug("try to mark T_NONE object"); /* check here will help debugging */
-        }
-        gc_aging(objspace, obj);
-        gc_grey(objspace, obj);
+    if (rb_yjit_enabled_p) {
+        MARK_CHECKPOINT("YJIT");
+        rb_yjit_root_mark();
     }
-    else {
-        reachable_objects_from_callback(obj);
-    }
-}
+#endif
 
-static inline void
-gc_pin(rb_objspace_t *objspace, VALUE obj)
-{
-    GC_ASSERT(is_markable_object(obj));
-    if (UNLIKELY(objspace->flags.during_compacting)) {
-        if (LIKELY(during_gc)) {
-            if (!MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj)) {
-                GC_ASSERT(GET_HEAP_PAGE(obj)->pinned_slots <= GET_HEAP_PAGE(obj)->total_slots);
-                GET_HEAP_PAGE(obj)->pinned_slots++;
-                MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj);
-            }
-        }
+#if USE_ZJIT
+    void rb_zjit_root_mark(void);
+    if (rb_zjit_enabled_p) {
+        MARK_CHECKPOINT("ZJIT");
+        rb_zjit_root_mark();
     }
-}
+#endif
 
-static inline void
-gc_mark_and_pin(rb_objspace_t *objspace, VALUE obj)
-{
-    if (!is_markable_object(obj)) return;
-    gc_pin(objspace, obj);
-    gc_mark_ptr(objspace, obj);
-}
+    MARK_CHECKPOINT("machine_context");
+    mark_current_machine_context(ec);
 
-static inline void
-gc_mark(rb_objspace_t *objspace, VALUE obj)
-{
-    if (!is_markable_object(obj)) return;
-    gc_mark_ptr(objspace, obj);
-}
+    MARK_CHECKPOINT("global_symbols");
+    rb_sym_global_symbols_mark_and_move();
 
-void
-rb_gc_mark_movable(VALUE ptr)
-{
-    gc_mark(&rb_objspace, ptr);
-}
+    MARK_CHECKPOINT("finish");
 
-void
-rb_gc_mark(VALUE ptr)
-{
-    gc_mark_and_pin(&rb_objspace, ptr);
+#undef MARK_CHECKPOINT
 }
 
-void
-rb_gc_mark_and_move(VALUE *ptr)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    if (RB_SPECIAL_CONST_P(*ptr)) return;
-
-    if (UNLIKELY(objspace->flags.during_reference_updating)) {
-        GC_ASSERT(objspace->flags.during_compacting);
-        GC_ASSERT(during_gc);
-
-        *ptr = rb_gc_location(*ptr);
-    }
-    else {
-        gc_mark_ptr(objspace, *ptr);
-    }
-}
+struct gc_mark_classext_foreach_arg {
+    rb_objspace_t *objspace;
+    VALUE obj;
+};
 
-void
-rb_gc_mark_weak(VALUE *ptr)
+static void
+gc_mark_classext_module(rb_classext_t *ext, bool prime, VALUE box_value, void *arg)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
-    if (UNLIKELY(!during_gc)) return;
-
-    VALUE obj = *ptr;
-    if (RB_SPECIAL_CONST_P(obj)) return;
+    struct gc_mark_classext_foreach_arg *foreach_arg = (struct gc_mark_classext_foreach_arg *)arg;
+    rb_objspace_t *objspace = foreach_arg->objspace;
 
-    GC_ASSERT(objspace->rgengc.parent_object == 0 || FL_TEST(objspace->rgengc.parent_object, FL_WB_PROTECTED));
-
-    if (UNLIKELY(RB_TYPE_P(obj, T_NONE))) {
-        rp(obj);
-        rb_bug("try to mark T_NONE object");
+    if (RCLASSEXT_SUPER(ext)) {
+        gc_mark_internal(RCLASSEXT_SUPER(ext));
     }
+    mark_m_tbl(objspace, RCLASSEXT_M_TBL(ext));
 
-    /* If we are in a minor GC and the other object is old, then obj should
-     * already be marked and cannot be reclaimed in this GC cycle so we don't
-     * need to add it to the weak refences list. */
-    if (!is_full_marking(objspace) && RVALUE_OLD_P(obj)) {
-        GC_ASSERT(RVALUE_MARKED(obj));
-        GC_ASSERT(!objspace->flags.during_compacting);
-
-        return;
+    if (!rb_gc_checking_shareable()) {
+        // unshareable
+        gc_mark_internal(RCLASSEXT_FIELDS_OBJ(ext));
+        gc_mark_internal(RCLASSEXT_CVC_TBL(ext));
     }
 
-    rgengc_check_relation(objspace, obj);
-
-    DURING_GC_COULD_MALLOC_REGION_START();
-    {
-        rb_darray_append(&objspace->weak_references, ptr);
+    if (!RCLASSEXT_SHARED_CONST_TBL(ext) && RCLASSEXT_CONST_TBL(ext)) {
+        mark_const_tbl(objspace, RCLASSEXT_CONST_TBL(ext));
     }
-    DURING_GC_COULD_MALLOC_REGION_END();
-
-    objspace->profile.weak_references_count++;
+    mark_m_tbl(objspace, RCLASSEXT_CALLABLE_M_TBL(ext));
+    gc_mark_internal(RCLASSEXT_CC_TBL(ext));
+    if (RCLASSEXT_SUBCLASSES(ext)) {
+        gc_mark_internal(RCLASSEXT_SUBCLASSES(ext));
+    }
+    gc_mark_internal(RCLASSEXT_CLASSPATH(ext));
 }
 
-void
-rb_gc_remove_weak(VALUE parent_obj, VALUE *ptr)
+static void
+gc_mark_classext_iclass(rb_classext_t *ext, bool prime, VALUE box_value, void *arg)
 {
-    rb_objspace_t *objspace = &rb_objspace;
+    struct gc_mark_classext_foreach_arg *foreach_arg = (struct gc_mark_classext_foreach_arg *)arg;
+    rb_objspace_t *objspace = foreach_arg->objspace;
 
-    /* If we're not incremental marking, then the state of the objects can't
-     * change so we don't need to do anything. */
-    if (!is_incremental_marking(objspace)) return;
-    /* If parent_obj has not been marked, then ptr has not yet been marked
-     * weak, so we don't need to do anything. */
-    if (!RVALUE_MARKED(parent_obj)) return;
-
-    VALUE **ptr_ptr;
-    rb_darray_foreach(objspace->weak_references, i, ptr_ptr) {
-        if (*ptr_ptr == ptr) {
-            *ptr_ptr = NULL;
-            break;
-        }
+    if (RCLASSEXT_SUPER(ext)) {
+        gc_mark_internal(RCLASSEXT_SUPER(ext));
     }
-}
-
-static inline void
-gc_mark_set_parent(rb_objspace_t *objspace, VALUE obj)
-{
-    if (RVALUE_OLD_P(obj)) {
-        objspace->rgengc.parent_object = obj;
+    if (RCLASSEXT_ICLASS_IS_ORIGIN(ext) && !RCLASSEXT_ICLASS_ORIGIN_SHARED_MTBL(ext)) {
+        mark_m_tbl(objspace, RCLASSEXT_M_TBL(ext));
     }
-    else {
-        objspace->rgengc.parent_object = Qfalse;
+    if (RCLASSEXT_INCLUDER(ext)) {
+        gc_mark_internal(RCLASSEXT_INCLUDER(ext));
+    }
+    mark_m_tbl(objspace, RCLASSEXT_CALLABLE_M_TBL(ext));
+    gc_mark_internal(RCLASSEXT_CC_TBL(ext));
+    if (RCLASSEXT_SUBCLASSES(ext)) {
+        gc_mark_internal(RCLASSEXT_SUBCLASSES(ext));
     }
 }
 
-static bool
-gc_declarative_marking_p(const rb_data_type_t *type)
+#define TYPED_DATA_REFS_OFFSET_LIST(d) (size_t *)(uintptr_t)RTYPEDDATA_TYPE(d)->function.dmark
+
+void
+rb_gc_move_obj_during_marking(VALUE from, VALUE to)
 {
-    return (type->flags & RUBY_TYPED_DECL_MARKING) != 0;
+    if (rb_obj_using_gen_fields_table_p(to)) {
+        rb_mark_generic_ivar(from);
+    }
 }
 
-static void mark_cvc_tbl(rb_objspace_t *objspace, VALUE klass);
-
-static void
-gc_mark_children(rb_objspace_t *objspace, VALUE obj)
+void
+rb_gc_mark_children(void *objspace, VALUE obj)
 {
-    register RVALUE *any = RANY(obj);
-    gc_mark_set_parent(objspace, obj);
+    struct gc_mark_classext_foreach_arg foreach_args;
 
-    if (FL_TEST(obj, FL_EXIVAR)) {
+    if (rb_obj_using_gen_fields_table_p(obj)) {
         rb_mark_generic_ivar(obj);
     }
 
     switch (BUILTIN_TYPE(obj)) {
       case T_FLOAT:
       case T_BIGNUM:
-      case T_SYMBOL:
-        /* Not immediates, but does not have references and singleton class.
-         *
-         * RSYMBOL(obj)->fstr intentionally not marked. See log for 96815f1e
-         * ("symbol.c: remove rb_gc_mark_symbols()") */
         return;
 
       case T_NIL:
@@ -6875,1832 +3416,232 @@ gc_mark_children(rb_objspace_t *objspace, VALUE obj)
         break;
     }
 
-    gc_mark(objspace, any->as.basic.klass);
+    gc_mark_internal(RBASIC(obj)->klass);
 
     switch (BUILTIN_TYPE(obj)) {
       case T_CLASS:
-        if (FL_TEST(obj, FL_SINGLETON)) {
-            gc_mark(objspace, RCLASS_ATTACHED_OBJECT(obj));
+        if (FL_TEST_RAW(obj, FL_SINGLETON) &&
+            !rb_gc_checking_shareable()) {
+            gc_mark_internal(RCLASS_ATTACHED_OBJECT(obj));
         }
         // Continue to the shared T_CLASS/T_MODULE
       case T_MODULE:
-        if (RCLASS_SUPER(obj)) {
-            gc_mark(objspace, RCLASS_SUPER(obj));
-        }
-
-        mark_m_tbl(objspace, RCLASS_M_TBL(obj));
-        mark_cvc_tbl(objspace, obj);
-        rb_cc_table_mark(obj);
-        if (rb_shape_obj_too_complex(obj)) {
-            mark_tbl_no_pin(objspace, (st_table *)RCLASS_IVPTR(obj));
-        }
-        else {
-            for (attr_index_t i = 0; i < RCLASS_IV_COUNT(obj); i++) {
-                gc_mark(objspace, RCLASS_IVPTR(obj)[i]);
-            }
+        foreach_args.objspace = objspace;
+        foreach_args.obj = obj;
+        rb_class_classext_foreach(obj, gc_mark_classext_module, (void *)&foreach_args);
+        if (BOX_USER_P(RCLASS_PRIME_BOX(obj))) {
+            gc_mark_internal(RCLASS_PRIME_BOX(obj)->box_object);
         }
-        mark_const_tbl(objspace, RCLASS_CONST_TBL(obj));
-
-        gc_mark(objspace, RCLASS_EXT(obj)->classpath);
         break;
 
       case T_ICLASS:
-        if (RICLASS_OWNS_M_TBL_P(obj)) {
-            mark_m_tbl(objspace, RCLASS_M_TBL(obj));
-        }
-        if (RCLASS_SUPER(obj)) {
-            gc_mark(objspace, RCLASS_SUPER(obj));
+        foreach_args.objspace = objspace;
+        foreach_args.obj = obj;
+        rb_class_classext_foreach(obj, gc_mark_classext_iclass, (void *)&foreach_args);
+        if (BOX_USER_P(RCLASS_PRIME_BOX(obj))) {
+            gc_mark_internal(RCLASS_PRIME_BOX(obj)->box_object);
         }
-
-        if (RCLASS_INCLUDER(obj)) {
-            gc_mark(objspace, RCLASS_INCLUDER(obj));
-        }
-        mark_m_tbl(objspace, RCLASS_CALLABLE_M_TBL(obj));
-        rb_cc_table_mark(obj);
         break;
 
       case T_ARRAY:
         if (ARY_SHARED_P(obj)) {
             VALUE root = ARY_SHARED_ROOT(obj);
-            gc_mark(objspace, root);
+            gc_mark_internal(root);
         }
         else {
-            long i, len = RARRAY_LEN(obj);
+            long len = RARRAY_LEN(obj);
             const VALUE *ptr = RARRAY_CONST_PTR(obj);
-            for (i=0; i < len; i++) {
-                gc_mark(objspace, ptr[i]);
+            for (long i = 0; i < len; i++) {
+                gc_mark_internal(ptr[i]);
             }
         }
         break;
 
       case T_HASH:
-        mark_hash(objspace, obj);
+        mark_hash(obj);
+        break;
+
+      case T_SYMBOL:
+        gc_mark_internal(RSYMBOL(obj)->fstr);
         break;
 
       case T_STRING:
         if (STR_SHARED_P(obj)) {
-            if (STR_EMBED_P(any->as.string.as.heap.aux.shared)) {
+            if (STR_EMBED_P(RSTRING(obj)->as.heap.aux.shared)) {
                 /* Embedded shared strings cannot be moved because this string
                  * points into the slot of the shared string. There may be code
                  * using the RSTRING_PTR on the stack, which would pin this
                  * string but not pin the shared string, causing it to move. */
-                gc_mark_and_pin(objspace, any->as.string.as.heap.aux.shared);
+                gc_mark_and_pin_internal(RSTRING(obj)->as.heap.aux.shared);
             }
             else {
-                gc_mark(objspace, any->as.string.as.heap.aux.shared);
+                gc_mark_internal(RSTRING(obj)->as.heap.aux.shared);
             }
         }
         break;
 
-      case T_DATA:
-        {
-            void *const ptr = RTYPEDDATA_P(obj) ? RTYPEDDATA_GET_DATA(obj) : DATA_PTR(obj);
+      case T_DATA: {
+        void *const ptr = RTYPEDDATA_GET_DATA(obj);
 
-            if (ptr) {
-                if (RTYPEDDATA_P(obj) && gc_declarative_marking_p(any->as.typeddata.type)) {
-                    size_t *offset_list = (size_t *)RANY(obj)->as.typeddata.type->function.dmark;
+        gc_mark_internal(RTYPEDDATA(obj)->fields_obj);
 
-                    for (size_t offset = *offset_list; offset != RUBY_REF_END; offset = *offset_list++) {
-                        rb_gc_mark_movable(*(VALUE *)((char *)ptr + offset));
-                    }
-                }
-                else {
-                    RUBY_DATA_FUNC mark_func = RTYPEDDATA_P(obj) ?
-                        any->as.typeddata.type->function.dmark :
-                        any->as.data.dmark;
-                    if (mark_func) (*mark_func)(ptr);
+        if (ptr) {
+            if (gc_declarative_marking_p(RTYPEDDATA_TYPE(obj))) {
+                size_t *offset_list = TYPED_DATA_REFS_OFFSET_LIST(obj);
+
+                for (size_t offset = *offset_list; offset != RUBY_REF_END; offset = *offset_list++) {
+                    gc_mark_internal(*(VALUE *)((char *)ptr + offset));
                 }
             }
+            else {
+                RUBY_DATA_FUNC mark_func = RTYPEDDATA_TYPE(obj)->function.dmark;
+                if (mark_func) (*mark_func)(ptr);
+            }
         }
-        break;
 
-      case T_OBJECT:
-        {
-            rb_shape_t *shape = rb_shape_get_shape_by_id(ROBJECT_SHAPE_ID(obj));
-            if (rb_shape_obj_too_complex(obj)) {
-                mark_tbl_no_pin(objspace, ROBJECT_IV_HASH(obj));
-            }
-            else {
-                const VALUE * const ptr = ROBJECT_IVPTR(obj);
+        break;
+      }
 
-                uint32_t i, len = ROBJECT_IV_COUNT(obj);
-                for (i  = 0; i < len; i++) {
-                    gc_mark(objspace, ptr[i]);
-                }
-            }
-            if (shape) {
-                VALUE klass = RBASIC_CLASS(obj);
+      case T_OBJECT: {
+        uint32_t len;
+        if (rb_obj_shape_complex_p(obj)) {
+            gc_mark_tbl_no_pin(ROBJECT_FIELDS_HASH(obj));
+            len = ROBJECT_FIELDS_COUNT_COMPLEX(obj);
+        }
+        else {
+            const VALUE * const ptr = ROBJECT_FIELDS(obj);
 
-                // Increment max_iv_count if applicable, used to determine size pool allocation
-                attr_index_t num_of_ivs = shape->next_iv_index;
-                if (RCLASS_EXT(klass)->max_iv_count < num_of_ivs) {
-                    RCLASS_EXT(klass)->max_iv_count = num_of_ivs;
-                }
+            len = ROBJECT_FIELDS_COUNT_NOT_COMPLEX(obj);
+            for (uint32_t i = 0; i < len; i++) {
+                gc_mark_internal(ptr[i]);
             }
         }
         break;
+      }
 
       case T_FILE:
-        if (any->as.file.fptr) {
-            gc_mark(objspace, any->as.file.fptr->self);
-            gc_mark(objspace, any->as.file.fptr->pathv);
-            gc_mark(objspace, any->as.file.fptr->tied_io_for_writing);
-            gc_mark(objspace, any->as.file.fptr->writeconv_asciicompat);
-            gc_mark(objspace, any->as.file.fptr->writeconv_pre_ecopts);
-            gc_mark(objspace, any->as.file.fptr->encs.ecopts);
-            gc_mark(objspace, any->as.file.fptr->write_lock);
-            gc_mark(objspace, any->as.file.fptr->timeout);
+        if (RFILE(obj)->fptr) {
+            gc_mark_internal(RFILE(obj)->fptr->self);
+            gc_mark_internal(RFILE(obj)->fptr->pathv);
+            gc_mark_internal(RFILE(obj)->fptr->tied_io_for_writing);
+            gc_mark_internal(RFILE(obj)->fptr->writeconv_asciicompat);
+            gc_mark_internal(RFILE(obj)->fptr->writeconv_pre_ecopts);
+            gc_mark_internal(RFILE(obj)->fptr->encs.ecopts);
+            gc_mark_internal(RFILE(obj)->fptr->write_lock);
+            gc_mark_internal(RFILE(obj)->fptr->timeout);
+            gc_mark_internal(RFILE(obj)->fptr->wakeup_mutex);
         }
         break;
 
       case T_REGEXP:
-        gc_mark(objspace, any->as.regexp.src);
+        gc_mark_internal(RREGEXP(obj)->src);
         break;
 
       case T_MATCH:
-        gc_mark(objspace, any->as.match.regexp);
-        if (any->as.match.str) {
-            gc_mark(objspace, any->as.match.str);
+        gc_mark_internal(RMATCH(obj)->regexp);
+        if (RMATCH(obj)->str) {
+            gc_mark_internal(RMATCH(obj)->str);
         }
         break;
 
       case T_RATIONAL:
-        gc_mark(objspace, any->as.rational.num);
-        gc_mark(objspace, any->as.rational.den);
+        gc_mark_internal(RRATIONAL(obj)->num);
+        gc_mark_internal(RRATIONAL(obj)->den);
         break;
 
       case T_COMPLEX:
-        gc_mark(objspace, any->as.complex.real);
-        gc_mark(objspace, any->as.complex.imag);
+        gc_mark_internal(RCOMPLEX(obj)->real);
+        gc_mark_internal(RCOMPLEX(obj)->imag);
         break;
 
-      case T_STRUCT:
-        {
-            long i;
-            const long len = RSTRUCT_LEN(obj);
-            const VALUE * const ptr = RSTRUCT_CONST_PTR(obj);
+      case T_STRUCT: {
+        const long len = RSTRUCT_LEN(obj);
+        const VALUE * const ptr = RSTRUCT_CONST_PTR(obj);
 
-            for (i=0; i<len; i++) {
-                gc_mark(objspace, ptr[i]);
-            }
+        for (long i = 0; i < len; i++) {
+            gc_mark_internal(ptr[i]);
+        }
+
+        if (rb_obj_shape_has_fields(obj) && !FL_TEST_RAW(obj, RSTRUCT_GEN_FIELDS)) {
+            gc_mark_internal(RSTRUCT_FIELDS_OBJ(obj));
         }
+
         break;
+      }
 
       default:
-#if GC_DEBUG
-        rb_gcdebug_print_obj_condition((VALUE)obj);
-#endif
         if (BUILTIN_TYPE(obj) == T_MOVED)   rb_bug("rb_gc_mark(): %p is T_MOVED", (void *)obj);
         if (BUILTIN_TYPE(obj) == T_NONE)   rb_bug("rb_gc_mark(): %p is T_NONE", (void *)obj);
         if (BUILTIN_TYPE(obj) == T_ZOMBIE) rb_bug("rb_gc_mark(): %p is T_ZOMBIE", (void *)obj);
         rb_bug("rb_gc_mark(): unknown data type 0x%x(%p) %s",
-               BUILTIN_TYPE(obj), (void *)any,
-               is_pointer_to_heap(objspace, any) ? "corrupted object" : "non object");
-    }
-}
-
-/**
- * incremental: 0 -> not incremental (do all)
- * incremental: n -> mark at most `n' objects
- */
-static inline int
-gc_mark_stacked_objects(rb_objspace_t *objspace, int incremental, size_t count)
-{
-    mark_stack_t *mstack = &objspace->mark_stack;
-    VALUE obj;
-    size_t marked_slots_at_the_beginning = objspace->marked_slots;
-    size_t popped_count = 0;
-
-    while (pop_mark_stack(mstack, &obj)) {
-        if (UNDEF_P(obj)) continue; /* skip */
-
-        if (RGENGC_CHECK_MODE && !RVALUE_MARKED(obj)) {
-            rb_bug("gc_mark_stacked_objects: %s is not marked.", obj_info(obj));
-        }
-        gc_mark_children(objspace, obj);
-
-        if (incremental) {
-            if (RGENGC_CHECK_MODE && !RVALUE_MARKING(obj)) {
-                rb_bug("gc_mark_stacked_objects: incremental, but marking bit is 0");
-            }
-            CLEAR_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
-            popped_count++;
-
-            if (popped_count + (objspace->marked_slots - marked_slots_at_the_beginning) > count) {
-                break;
-            }
-        }
-        else {
-            /* just ignore marking bits */
-        }
-    }
-
-    if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(objspace);
-
-    if (is_mark_stack_empty(mstack)) {
-        shrink_stack_chunk_cache(mstack);
-        return TRUE;
-    }
-    else {
-        return FALSE;
-    }
-}
-
-static int
-gc_mark_stacked_objects_incremental(rb_objspace_t *objspace, size_t count)
-{
-    return gc_mark_stacked_objects(objspace, TRUE, count);
-}
-
-static int
-gc_mark_stacked_objects_all(rb_objspace_t *objspace)
-{
-    return gc_mark_stacked_objects(objspace, FALSE, 0);
-}
-
-#if PRINT_ROOT_TICKS
-#define MAX_TICKS 0x100
-static tick_t mark_ticks[MAX_TICKS];
-static const char *mark_ticks_categories[MAX_TICKS];
-
-static void
-show_mark_ticks(void)
-{
-    int i;
-    fprintf(stderr, "mark ticks result:\n");
-    for (i=0; i<MAX_TICKS; i++) {
-        const char *category = mark_ticks_categories[i];
-        if (category) {
-            fprintf(stderr, "%s\t%8lu\n", category, (unsigned long)mark_ticks[i]);
-        }
-        else {
-            break;
-        }
-    }
-}
-
-#endif /* PRINT_ROOT_TICKS */
-
-static void
-gc_mark_roots(rb_objspace_t *objspace, const char **categoryp)
-{
-    rb_execution_context_t *ec = GET_EC();
-    rb_vm_t *vm = rb_ec_vm_ptr(ec);
-
-#if PRINT_ROOT_TICKS
-    tick_t start_tick = tick();
-    int tick_count = 0;
-    const char *prev_category = 0;
-
-    if (mark_ticks_categories[0] == 0) {
-        atexit(show_mark_ticks);
-    }
-#endif
-
-    if (categoryp) *categoryp = "xxx";
-
-    objspace->rgengc.parent_object = Qfalse;
-
-#if PRINT_ROOT_TICKS
-#define MARK_CHECKPOINT_PRINT_TICK(category) do { \
-    if (prev_category) { \
-        tick_t t = tick(); \
-        mark_ticks[tick_count] = t - start_tick; \
-        mark_ticks_categories[tick_count] = prev_category; \
-        tick_count++; \
-    } \
-    prev_category = category; \
-    start_tick = tick(); \
-} while (0)
-#else /* PRINT_ROOT_TICKS */
-#define MARK_CHECKPOINT_PRINT_TICK(category)
-#endif
-
-#define MARK_CHECKPOINT(category) do { \
-    if (categoryp) *categoryp = category; \
-    MARK_CHECKPOINT_PRINT_TICK(category); \
-} while (0)
-
-    MARK_CHECKPOINT("vm");
-    SET_STACK_END;
-    rb_vm_mark(vm);
-    if (vm->self) gc_mark(objspace, vm->self);
-
-    MARK_CHECKPOINT("finalizers");
-    mark_finalizer_tbl(objspace, finalizer_table);
-
-    MARK_CHECKPOINT("machine_context");
-    mark_current_machine_context(objspace, ec);
-
-    /* mark protected global variables */
-
-    MARK_CHECKPOINT("end_proc");
-    rb_mark_end_proc();
-
-    MARK_CHECKPOINT("global_tbl");
-    rb_gc_mark_global_tbl();
-
-    MARK_CHECKPOINT("object_id");
-    mark_tbl_no_pin(objspace, objspace->obj_to_id_tbl); /* Only mark ids */
-
-    if (stress_to_class) rb_gc_mark(stress_to_class);
-
-    MARK_CHECKPOINT("finish");
-#undef MARK_CHECKPOINT
-}
-
-#if RGENGC_CHECK_MODE >= 4
-
-#define MAKE_ROOTSIG(obj) (((VALUE)(obj) << 1) | 0x01)
-#define IS_ROOTSIG(obj)   ((VALUE)(obj) & 0x01)
-#define GET_ROOTSIG(obj)  ((const char *)((VALUE)(obj) >> 1))
-
-struct reflist {
-    VALUE *list;
-    int pos;
-    int size;
-};
-
-static struct reflist *
-reflist_create(VALUE obj)
-{
-    struct reflist *refs = xmalloc(sizeof(struct reflist));
-    refs->size = 1;
-    refs->list = ALLOC_N(VALUE, refs->size);
-    refs->list[0] = obj;
-    refs->pos = 1;
-    return refs;
-}
-
-static void
-reflist_destruct(struct reflist *refs)
-{
-    xfree(refs->list);
-    xfree(refs);
-}
-
-static void
-reflist_add(struct reflist *refs, VALUE obj)
-{
-    if (refs->pos == refs->size) {
-        refs->size *= 2;
-        SIZED_REALLOC_N(refs->list, VALUE, refs->size, refs->size/2);
-    }
-
-    refs->list[refs->pos++] = obj;
-}
-
-static void
-reflist_dump(struct reflist *refs)
-{
-    int i;
-    for (i=0; i<refs->pos; i++) {
-        VALUE obj = refs->list[i];
-        if (IS_ROOTSIG(obj)) { /* root */
-            fprintf(stderr, "<root@%s>", GET_ROOTSIG(obj));
-        }
-        else {
-            fprintf(stderr, "<%s>", obj_info(obj));
-        }
-        if (i+1 < refs->pos) fprintf(stderr, ", ");
-    }
-}
-
-static int
-reflist_referred_from_machine_context(struct reflist *refs)
-{
-    int i;
-    for (i=0; i<refs->pos; i++) {
-        VALUE obj = refs->list[i];
-        if (IS_ROOTSIG(obj) && strcmp(GET_ROOTSIG(obj), "machine_context") == 0) return 1;
-    }
-    return 0;
-}
-
-struct allrefs {
-    rb_objspace_t *objspace;
-    /* a -> obj1
-     * b -> obj1
-     * c -> obj1
-     * c -> obj2
-     * d -> obj3
-     * #=> {obj1 => [a, b, c], obj2 => [c, d]}
-     */
-    struct st_table *references;
-    const char *category;
-    VALUE root_obj;
-    mark_stack_t mark_stack;
-};
-
-static int
-allrefs_add(struct allrefs *data, VALUE obj)
-{
-    struct reflist *refs;
-    st_data_t r;
-
-    if (st_lookup(data->references, obj, &r)) {
-        refs = (struct reflist *)r;
-        reflist_add(refs, data->root_obj);
-        return 0;
-    }
-    else {
-        refs = reflist_create(data->root_obj);
-        st_insert(data->references, obj, (st_data_t)refs);
-        return 1;
-    }
-}
-
-static void
-allrefs_i(VALUE obj, void *ptr)
-{
-    struct allrefs *data = (struct allrefs *)ptr;
-
-    if (allrefs_add(data, obj)) {
-        push_mark_stack(&data->mark_stack, obj);
-    }
-}
-
-static void
-allrefs_roots_i(VALUE obj, void *ptr)
-{
-    struct allrefs *data = (struct allrefs *)ptr;
-    if (strlen(data->category) == 0) rb_bug("!!!");
-    data->root_obj = MAKE_ROOTSIG(data->category);
-
-    if (allrefs_add(data, obj)) {
-        push_mark_stack(&data->mark_stack, obj);
-    }
-}
-#define PUSH_MARK_FUNC_DATA(v) do { \
-    struct gc_mark_func_data_struct *prev_mark_func_data = GET_RACTOR()->mfd; \
-    GET_RACTOR()->mfd = (v);
-
-#define POP_MARK_FUNC_DATA() GET_RACTOR()->mfd = prev_mark_func_data;} while (0)
-
-static st_table *
-objspace_allrefs(rb_objspace_t *objspace)
-{
-    struct allrefs data;
-    struct gc_mark_func_data_struct mfd;
-    VALUE obj;
-    int prev_dont_gc = dont_gc_val();
-    dont_gc_on();
-
-    data.objspace = objspace;
-    data.references = st_init_numtable();
-    init_mark_stack(&data.mark_stack);
-
-    mfd.mark_func = allrefs_roots_i;
-    mfd.data = &data;
-
-    /* traverse root objects */
-    PUSH_MARK_FUNC_DATA(&mfd);
-    GET_RACTOR()->mfd = &mfd;
-    gc_mark_roots(objspace, &data.category);
-    POP_MARK_FUNC_DATA();
-
-    /* traverse rest objects reachable from root objects */
-    while (pop_mark_stack(&data.mark_stack, &obj)) {
-        rb_objspace_reachable_objects_from(data.root_obj = obj, allrefs_i, &data);
-    }
-    free_stack_chunks(&data.mark_stack);
-
-    dont_gc_set(prev_dont_gc);
-    return data.references;
-}
-
-static int
-objspace_allrefs_destruct_i(st_data_t key, st_data_t value, st_data_t ptr)
-{
-    struct reflist *refs = (struct reflist *)value;
-    reflist_destruct(refs);
-    return ST_CONTINUE;
-}
-
-static void
-objspace_allrefs_destruct(struct st_table *refs)
-{
-    st_foreach(refs, objspace_allrefs_destruct_i, 0);
-    st_free_table(refs);
-}
-
-#if RGENGC_CHECK_MODE >= 5
-static int
-allrefs_dump_i(st_data_t k, st_data_t v, st_data_t ptr)
-{
-    VALUE obj = (VALUE)k;
-    struct reflist *refs = (struct reflist *)v;
-    fprintf(stderr, "[allrefs_dump_i] %s <- ", obj_info(obj));
-    reflist_dump(refs);
-    fprintf(stderr, "\n");
-    return ST_CONTINUE;
-}
-
-static void
-allrefs_dump(rb_objspace_t *objspace)
-{
-    VALUE size = objspace->rgengc.allrefs_table->num_entries;
-    fprintf(stderr, "[all refs] (size: %"PRIuVALUE")\n", size);
-    st_foreach(objspace->rgengc.allrefs_table, allrefs_dump_i, 0);
-}
-#endif
-
-static int
-gc_check_after_marks_i(st_data_t k, st_data_t v, st_data_t ptr)
-{
-    VALUE obj = k;
-    struct reflist *refs = (struct reflist *)v;
-    rb_objspace_t *objspace = (rb_objspace_t *)ptr;
-
-    /* object should be marked or oldgen */
-    if (!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj)) {
-        fprintf(stderr, "gc_check_after_marks_i: %s is not marked and not oldgen.\n", obj_info(obj));
-        fprintf(stderr, "gc_check_after_marks_i: %p is referred from ", (void *)obj);
-        reflist_dump(refs);
-
-        if (reflist_referred_from_machine_context(refs)) {
-            fprintf(stderr, " (marked from machine stack).\n");
-            /* marked from machine context can be false positive */
-        }
-        else {
-            objspace->rgengc.error_count++;
-            fprintf(stderr, "\n");
-        }
-    }
-    return ST_CONTINUE;
-}
-
-static void
-gc_marks_check(rb_objspace_t *objspace, st_foreach_callback_func *checker_func, const char *checker_name)
-{
-    size_t saved_malloc_increase = objspace->malloc_params.increase;
-#if RGENGC_ESTIMATE_OLDMALLOC
-    size_t saved_oldmalloc_increase = objspace->rgengc.oldmalloc_increase;
-#endif
-    VALUE already_disabled = rb_objspace_gc_disable(objspace);
-
-    objspace->rgengc.allrefs_table = objspace_allrefs(objspace);
-
-    if (checker_func) {
-        st_foreach(objspace->rgengc.allrefs_table, checker_func, (st_data_t)objspace);
-    }
-
-    if (objspace->rgengc.error_count > 0) {
-#if RGENGC_CHECK_MODE >= 5
-        allrefs_dump(objspace);
-#endif
-        if (checker_name) rb_bug("%s: GC has problem.", checker_name);
-    }
-
-    objspace_allrefs_destruct(objspace->rgengc.allrefs_table);
-    objspace->rgengc.allrefs_table = 0;
-
-    if (already_disabled == Qfalse) rb_objspace_gc_enable(objspace);
-    objspace->malloc_params.increase = saved_malloc_increase;
-#if RGENGC_ESTIMATE_OLDMALLOC
-    objspace->rgengc.oldmalloc_increase = saved_oldmalloc_increase;
-#endif
-}
-#endif /* RGENGC_CHECK_MODE >= 4 */
-
-struct verify_internal_consistency_struct {
-    rb_objspace_t *objspace;
-    int err_count;
-    size_t live_object_count;
-    size_t zombie_object_count;
-
-    VALUE parent;
-    size_t old_object_count;
-    size_t remembered_shady_count;
-};
-
-static void
-check_generation_i(const VALUE child, void *ptr)
-{
-    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
-    const VALUE parent = data->parent;
-
-    if (RGENGC_CHECK_MODE) GC_ASSERT(RVALUE_OLD_P(parent));
-
-    if (!RVALUE_OLD_P(child)) {
-        if (!RVALUE_REMEMBERED(parent) &&
-            !RVALUE_REMEMBERED(child) &&
-            !RVALUE_UNCOLLECTIBLE(child)) {
-            fprintf(stderr, "verify_internal_consistency_reachable_i: WB miss (O->Y) %s -> %s\n", obj_info(parent), obj_info(child));
-            data->err_count++;
-        }
-    }
-}
-
-static void
-check_color_i(const VALUE child, void *ptr)
-{
-    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
-    const VALUE parent = data->parent;
-
-    if (!RVALUE_WB_UNPROTECTED(parent) && RVALUE_WHITE_P(child)) {
-        fprintf(stderr, "verify_internal_consistency_reachable_i: WB miss (B->W) - %s -> %s\n",
-                obj_info(parent), obj_info(child));
-        data->err_count++;
-    }
-}
-
-static void
-check_children_i(const VALUE child, void *ptr)
-{
-    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
-    if (check_rvalue_consistency_force(child, FALSE) != 0) {
-        fprintf(stderr, "check_children_i: %s has error (referenced from %s)",
-                obj_info(child), obj_info(data->parent));
-        rb_print_backtrace(stderr); /* C backtrace will help to debug */
-
-        data->err_count++;
-    }
-}
-
-static int
-verify_internal_consistency_i(void *page_start, void *page_end, size_t stride,
-                              struct verify_internal_consistency_struct *data)
-{
-    VALUE obj;
-    rb_objspace_t *objspace = data->objspace;
-
-    for (obj = (VALUE)page_start; obj != (VALUE)page_end; obj += stride) {
-        void *poisoned = asan_unpoison_object_temporary(obj);
-
-        if (is_live_object(objspace, obj)) {
-            /* count objects */
-            data->live_object_count++;
-            data->parent = obj;
-
-            /* Normally, we don't expect T_MOVED objects to be in the heap.
-             * But they can stay alive on the stack, */
-            if (!gc_object_moved_p(objspace, obj)) {
-                /* moved slots don't have children */
-                rb_objspace_reachable_objects_from(obj, check_children_i, (void *)data);
-            }
-
-            /* check health of children */
-            if (RVALUE_OLD_P(obj)) data->old_object_count++;
-            if (RVALUE_WB_UNPROTECTED(obj) && RVALUE_UNCOLLECTIBLE(obj)) data->remembered_shady_count++;
-
-            if (!is_marking(objspace) && RVALUE_OLD_P(obj)) {
-                /* reachable objects from an oldgen object should be old or (young with remember) */
-                data->parent = obj;
-                rb_objspace_reachable_objects_from(obj, check_generation_i, (void *)data);
-            }
-
-            if (is_incremental_marking(objspace)) {
-                if (RVALUE_BLACK_P(obj)) {
-                    /* reachable objects from black objects should be black or grey objects */
-                    data->parent = obj;
-                    rb_objspace_reachable_objects_from(obj, check_color_i, (void *)data);
-                }
-            }
-        }
-        else {
-            if (BUILTIN_TYPE(obj) == T_ZOMBIE) {
-                data->zombie_object_count++;
-
-                if ((RBASIC(obj)->flags & ~ZOMBIE_OBJ_KEPT_FLAGS) != T_ZOMBIE) {
-                    fprintf(stderr, "verify_internal_consistency_i: T_ZOMBIE has extra flags set: %s\n",
-                            obj_info(obj));
-                    data->err_count++;
-                }
-
-                if (!!FL_TEST(obj, FL_FINALIZE) != !!st_is_member(finalizer_table, obj)) {
-                    fprintf(stderr, "verify_internal_consistency_i: FL_FINALIZE %s but %s finalizer_table: %s\n",
-                            FL_TEST(obj, FL_FINALIZE) ? "set" : "not set", st_is_member(finalizer_table, obj) ? "in" : "not in",
-                            obj_info(obj));
-                    data->err_count++;
-                }
-            }
-        }
-        if (poisoned) {
-            GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
-            asan_poison_object(obj);
-        }
-    }
-
-    return 0;
-}
-
-static int
-gc_verify_heap_page(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
-{
-    unsigned int has_remembered_shady = FALSE;
-    unsigned int has_remembered_old = FALSE;
-    int remembered_old_objects = 0;
-    int free_objects = 0;
-    int zombie_objects = 0;
-
-    short slot_size = page->slot_size;
-    uintptr_t start = (uintptr_t)page->start;
-    uintptr_t end = start + page->total_slots * slot_size;
-
-    for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
-        VALUE val = (VALUE)ptr;
-        void *poisoned = asan_unpoison_object_temporary(val);
-        enum ruby_value_type type = BUILTIN_TYPE(val);
-
-        if (type == T_NONE) free_objects++;
-        if (type == T_ZOMBIE) zombie_objects++;
-        if (RVALUE_PAGE_UNCOLLECTIBLE(page, val) && RVALUE_PAGE_WB_UNPROTECTED(page, val)) {
-            has_remembered_shady = TRUE;
-        }
-        if (RVALUE_PAGE_MARKING(page, val)) {
-            has_remembered_old = TRUE;
-            remembered_old_objects++;
-        }
-
-        if (poisoned) {
-            GC_ASSERT(BUILTIN_TYPE(val) == T_NONE);
-            asan_poison_object(val);
-        }
-    }
-
-    if (!is_incremental_marking(objspace) &&
-        page->flags.has_remembered_objects == FALSE && has_remembered_old == TRUE) {
-
-        for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
-            VALUE val = (VALUE)ptr;
-            if (RVALUE_PAGE_MARKING(page, val)) {
-                fprintf(stderr, "marking -> %s\n", obj_info(val));
-            }
-        }
-        rb_bug("page %p's has_remembered_objects should be false, but there are remembered old objects (%d). %s",
-               (void *)page, remembered_old_objects, obj ? obj_info(obj) : "");
-    }
-
-    if (page->flags.has_uncollectible_wb_unprotected_objects == FALSE && has_remembered_shady == TRUE) {
-        rb_bug("page %p's has_remembered_shady should be false, but there are remembered shady objects. %s",
-               (void *)page, obj ? obj_info(obj) : "");
-    }
-
-    if (0) {
-        /* free_slots may not equal to free_objects */
-        if (page->free_slots != free_objects) {
-            rb_bug("page %p's free_slots should be %d, but %d", (void *)page, page->free_slots, free_objects);
-        }
-    }
-    if (page->final_slots != zombie_objects) {
-        rb_bug("page %p's final_slots should be %d, but %d", (void *)page, page->final_slots, zombie_objects);
-    }
-
-    return remembered_old_objects;
-}
-
-static int
-gc_verify_heap_pages_(rb_objspace_t *objspace, struct ccan_list_head *head)
-{
-    int remembered_old_objects = 0;
-    struct heap_page *page = 0;
-
-    ccan_list_for_each(head, page, page_node) {
-        asan_unlock_freelist(page);
-        RVALUE *p = page->freelist;
-        while (p) {
-            VALUE vp = (VALUE)p;
-            VALUE prev = vp;
-            asan_unpoison_object(vp, false);
-            if (BUILTIN_TYPE(vp) != T_NONE) {
-                fprintf(stderr, "freelist slot expected to be T_NONE but was: %s\n", obj_info(vp));
-            }
-            p = p->as.free.next;
-            asan_poison_object(prev);
-        }
-        asan_lock_freelist(page);
-
-        if (page->flags.has_remembered_objects == FALSE) {
-            remembered_old_objects += gc_verify_heap_page(objspace, page, Qfalse);
-        }
-    }
-
-    return remembered_old_objects;
-}
-
-static int
-gc_verify_heap_pages(rb_objspace_t *objspace)
-{
-    int remembered_old_objects = 0;
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        remembered_old_objects += gc_verify_heap_pages_(objspace, &(SIZE_POOL_EDEN_HEAP(&size_pools[i])->pages));
-        remembered_old_objects += gc_verify_heap_pages_(objspace, &(SIZE_POOL_TOMB_HEAP(&size_pools[i])->pages));
-    }
-    return remembered_old_objects;
-}
-
-/*
- *  call-seq:
- *     GC.verify_internal_consistency                  -> nil
- *
- *  Verify internal consistency.
- *
- *  This method is implementation specific.
- *  Now this method checks generational consistency
- *  if RGenGC is supported.
- */
-static VALUE
-gc_verify_internal_consistency_m(VALUE dummy)
-{
-    gc_verify_internal_consistency(&rb_objspace);
-    return Qnil;
-}
-
-static void
-gc_verify_internal_consistency_(rb_objspace_t *objspace)
-{
-    struct verify_internal_consistency_struct data = {0};
-
-    data.objspace = objspace;
-    gc_report(5, objspace, "gc_verify_internal_consistency: start\n");
-
-    /* check relations */
-    for (size_t i = 0; i < heap_allocated_pages; i++) {
-        struct heap_page *page = heap_pages_sorted[i];
-        short slot_size = page->slot_size;
-
-        uintptr_t start = (uintptr_t)page->start;
-        uintptr_t end = start + page->total_slots * slot_size;
-
-        verify_internal_consistency_i((void *)start, (void *)end, slot_size, &data);
+               BUILTIN_TYPE(obj), (void *)obj,
+               rb_gc_impl_pointer_to_heap_p(objspace, (void *)obj) ? "corrupted object" : "non object");
     }
-
-    if (data.err_count != 0) {
-#if RGENGC_CHECK_MODE >= 5
-        objspace->rgengc.error_count = data.err_count;
-        gc_marks_check(objspace, NULL, NULL);
-        allrefs_dump(objspace);
-#endif
-        rb_bug("gc_verify_internal_consistency: found internal inconsistency.");
-    }
-
-    /* check heap_page status */
-    gc_verify_heap_pages(objspace);
-
-    /* check counters */
-
-    if (!is_lazy_sweeping(objspace) &&
-        !finalizing &&
-        ruby_single_main_ractor != NULL) {
-        if (objspace_live_slots(objspace) != data.live_object_count) {
-            fprintf(stderr, "heap_pages_final_slots: %"PRIdSIZE", total_freed_objects: %"PRIdSIZE"\n",
-                    heap_pages_final_slots, total_freed_objects(objspace));
-            rb_bug("inconsistent live slot number: expect %"PRIuSIZE", but %"PRIuSIZE".",
-                   objspace_live_slots(objspace), data.live_object_count);
-        }
-    }
-
-    if (!is_marking(objspace)) {
-        if (objspace->rgengc.old_objects != data.old_object_count) {
-            rb_bug("inconsistent old slot number: expect %"PRIuSIZE", but %"PRIuSIZE".",
-                   objspace->rgengc.old_objects, data.old_object_count);
-        }
-        if (objspace->rgengc.uncollectible_wb_unprotected_objects != data.remembered_shady_count) {
-            rb_bug("inconsistent number of wb unprotected objects: expect %"PRIuSIZE", but %"PRIuSIZE".",
-                   objspace->rgengc.uncollectible_wb_unprotected_objects, data.remembered_shady_count);
-        }
-    }
-
-    if (!finalizing) {
-        size_t list_count = 0;
-
-        {
-            VALUE z = heap_pages_deferred_final;
-            while (z) {
-                list_count++;
-                z = RZOMBIE(z)->next;
-            }
-        }
-
-        if (heap_pages_final_slots != data.zombie_object_count ||
-            heap_pages_final_slots != list_count) {
-
-            rb_bug("inconsistent finalizing object count:\n"
-                    "  expect %"PRIuSIZE"\n"
-                    "  but    %"PRIuSIZE" zombies\n"
-                    "  heap_pages_deferred_final list has %"PRIuSIZE" items.",
-                    heap_pages_final_slots,
-                    data.zombie_object_count,
-                    list_count);
-        }
-    }
-
-    gc_report(5, objspace, "gc_verify_internal_consistency: OK\n");
 }
 
-static void
-gc_verify_internal_consistency(rb_objspace_t *objspace)
+size_t
+rb_gc_obj_optimal_size(VALUE obj)
 {
-    RB_VM_LOCK_ENTER();
-    {
-        rb_vm_barrier(); // stop other ractors
-
-        unsigned int prev_during_gc = during_gc;
-        during_gc = FALSE; // stop gc here
+    switch (BUILTIN_TYPE(obj)) {
+      case T_ARRAY:
         {
-            gc_verify_internal_consistency_(objspace);
-        }
-        during_gc = prev_during_gc;
-    }
-    RB_VM_LOCK_LEAVE();
-}
-
-void
-rb_gc_verify_internal_consistency(void)
-{
-    gc_verify_internal_consistency(&rb_objspace);
-}
-
-static void
-heap_move_pooled_pages_to_free_pages(rb_heap_t *heap)
-{
-    if (heap->pooled_pages) {
-        if (heap->free_pages) {
-            struct heap_page *free_pages_tail = heap->free_pages;
-            while (free_pages_tail->free_next) {
-                free_pages_tail = free_pages_tail->free_next;
-            }
-            free_pages_tail->free_next = heap->pooled_pages;
-        }
-        else {
-            heap->free_pages = heap->pooled_pages;
-        }
-
-        heap->pooled_pages = NULL;
-    }
-}
-
-/* marks */
-
-static void
-gc_marks_start(rb_objspace_t *objspace, int full_mark)
-{
-    /* start marking */
-    gc_report(1, objspace, "gc_marks_start: (%s)\n", full_mark ? "full" : "minor");
-    gc_mode_transition(objspace, gc_mode_marking);
-
-    if (full_mark) {
-        size_t incremental_marking_steps = (objspace->rincgc.pooled_slots / INCREMENTAL_MARK_STEP_ALLOCATIONS) + 1;
-        objspace->rincgc.step_slots = (objspace->marked_slots * 2) / incremental_marking_steps;
-
-        if (0) fprintf(stderr, "objspace->marked_slots: %"PRIdSIZE", "
-                       "objspace->rincgc.pooled_page_num: %"PRIdSIZE", "
-                       "objspace->rincgc.step_slots: %"PRIdSIZE", \n",
-                       objspace->marked_slots, objspace->rincgc.pooled_slots, objspace->rincgc.step_slots);
-        objspace->flags.during_minor_gc = FALSE;
-        if (ruby_enable_autocompact) {
-            objspace->flags.during_compacting |= TRUE;
-        }
-        objspace->profile.major_gc_count++;
-        objspace->rgengc.uncollectible_wb_unprotected_objects = 0;
-        objspace->rgengc.old_objects = 0;
-        objspace->rgengc.last_major_gc = objspace->profile.count;
-        objspace->marked_slots = 0;
-
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-            rgengc_mark_and_rememberset_clear(objspace, heap);
-            heap_move_pooled_pages_to_free_pages(heap);
-
-            if (objspace->flags.during_compacting) {
-                struct heap_page *page = NULL;
-
-                ccan_list_for_each(&heap->pages, page, page_node) {
-                    page->pinned_slots = 0;
-                }
-            }
-        }
-    }
-    else {
-        objspace->flags.during_minor_gc = TRUE;
-        objspace->marked_slots =
-          objspace->rgengc.old_objects + objspace->rgengc.uncollectible_wb_unprotected_objects; /* uncollectible objects are marked already */
-        objspace->profile.minor_gc_count++;
-
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rgengc_rememberset_mark(objspace, SIZE_POOL_EDEN_HEAP(&size_pools[i]));
-        }
-    }
-
-    gc_mark_roots(objspace, NULL);
-
-    gc_report(1, objspace, "gc_marks_start: (%s) end, stack in %"PRIdSIZE"\n",
-              full_mark ? "full" : "minor", mark_stack_size(&objspace->mark_stack));
-}
-
-static inline void
-gc_marks_wb_unprotected_objects_plane(rb_objspace_t *objspace, uintptr_t p, bits_t bits)
-{
-    if (bits) {
-        do {
-            if (bits & 1) {
-                gc_report(2, objspace, "gc_marks_wb_unprotected_objects: marked shady: %s\n", obj_info((VALUE)p));
-                GC_ASSERT(RVALUE_WB_UNPROTECTED((VALUE)p));
-                GC_ASSERT(RVALUE_MARKED((VALUE)p));
-                gc_mark_children(objspace, (VALUE)p);
+            size_t size = rb_ary_size_as_embedded(obj);
+            if (rb_gc_size_allocatable_p(size)) {
+                return size;
             }
-            p += BASE_SLOT_SIZE;
-            bits >>= 1;
-        } while (bits);
-    }
-}
-
-static void
-gc_marks_wb_unprotected_objects(rb_objspace_t *objspace, rb_heap_t *heap)
-{
-    struct heap_page *page = 0;
-
-    ccan_list_for_each(&heap->pages, page, page_node) {
-        bits_t *mark_bits = page->mark_bits;
-        bits_t *wbun_bits = page->wb_unprotected_bits;
-        uintptr_t p = page->start;
-        size_t j;
-
-        bits_t bits = mark_bits[0] & wbun_bits[0];
-        bits >>= NUM_IN_PAGE(p);
-        gc_marks_wb_unprotected_objects_plane(objspace, p, bits);
-        p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
-
-        for (j=1; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
-            bits_t bits = mark_bits[j] & wbun_bits[j];
-
-            gc_marks_wb_unprotected_objects_plane(objspace, p, bits);
-            p += BITS_BITLENGTH * BASE_SLOT_SIZE;
-        }
-    }
-
-    gc_mark_stacked_objects_all(objspace);
-}
-
-static void
-gc_update_weak_references(rb_objspace_t *objspace)
-{
-    size_t retained_weak_references_count = 0;
-    VALUE **ptr_ptr;
-    rb_darray_foreach(objspace->weak_references, i, ptr_ptr) {
-        if (!*ptr_ptr) continue;
-
-        VALUE obj = **ptr_ptr;
-
-        if (RB_SPECIAL_CONST_P(obj)) continue;
-
-        if (!RVALUE_MARKED(obj)) {
-            **ptr_ptr = Qundef;
-        }
-        else {
-            retained_weak_references_count++;
-        }
-    }
-
-    objspace->profile.retained_weak_references_count = retained_weak_references_count;
-
-    rb_darray_clear(objspace->weak_references);
-
-    DURING_GC_COULD_MALLOC_REGION_START();
-    {
-        rb_darray_resize_capa(&objspace->weak_references, retained_weak_references_count);
-    }
-    DURING_GC_COULD_MALLOC_REGION_END();
-}
-
-static void
-gc_marks_finish(rb_objspace_t *objspace)
-{
-    /* finish incremental GC */
-    if (is_incremental_marking(objspace)) {
-        if (RGENGC_CHECK_MODE && is_mark_stack_empty(&objspace->mark_stack) == 0) {
-            rb_bug("gc_marks_finish: mark stack is not empty (%"PRIdSIZE").",
-                   mark_stack_size(&objspace->mark_stack));
-        }
-
-        gc_mark_roots(objspace, 0);
-        while (gc_mark_stacked_objects_incremental(objspace, INT_MAX) == false);
-
-#if RGENGC_CHECK_MODE >= 2
-        if (gc_verify_heap_pages(objspace) != 0) {
-            rb_bug("gc_marks_finish (incremental): there are remembered old objects.");
-        }
-#endif
-
-        objspace->flags.during_incremental_marking = FALSE;
-        /* check children of all marked wb-unprotected objects */
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            gc_marks_wb_unprotected_objects(objspace, SIZE_POOL_EDEN_HEAP(&size_pools[i]));
-        }
-    }
-
-    gc_update_weak_references(objspace);
-
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-
-#if RGENGC_CHECK_MODE >= 4
-    during_gc = FALSE;
-    gc_marks_check(objspace, gc_check_after_marks_i, "after_marks");
-    during_gc = TRUE;
-#endif
-
-    {
-        /* decide full GC is needed or not */
-        size_t total_slots = heap_allocatable_slots(objspace) + heap_eden_total_slots(objspace);
-        size_t sweep_slots = total_slots - objspace->marked_slots; /* will be swept slots */
-        size_t max_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_max_ratio);
-        size_t min_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_min_ratio);
-        int full_marking = is_full_marking(objspace);
-        const int r_cnt = GET_VM()->ractor.cnt;
-        const int r_mul = r_cnt > 8 ? 8 : r_cnt; // upto 8
-
-        GC_ASSERT(heap_eden_total_slots(objspace) >= objspace->marked_slots);
-
-        /* Setup freeable slots. */
-        size_t total_init_slots = 0;
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            total_init_slots += gc_params.size_pool_init_slots[i] * r_mul;
-        }
-
-        if (max_free_slots < total_init_slots) {
-            max_free_slots = total_init_slots;
-        }
-
-        if (sweep_slots > max_free_slots) {
-            heap_pages_freeable_pages = (sweep_slots - max_free_slots) / HEAP_PAGE_OBJ_LIMIT;
-        }
-        else {
-            heap_pages_freeable_pages = 0;
-        }
-
-        /* check free_min */
-        if (min_free_slots < gc_params.heap_free_slots * r_mul) {
-            min_free_slots = gc_params.heap_free_slots * r_mul;
-        }
-
-        if (sweep_slots < min_free_slots) {
-            if (!full_marking) {
-                if (objspace->profile.count - objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
-                    full_marking = TRUE;
-                    /* do not update last_major_gc, because full marking is not done. */
-                    /* goto increment; */
-                }
-                else {
-                    gc_report(1, objspace, "gc_marks_finish: next is full GC!!)\n");
-                    gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
-                }
+            else {
+                return sizeof(struct RArray);
             }
         }
 
-        if (full_marking) {
-            /* See the comment about RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR */
-            const double r = gc_params.oldobject_limit_factor;
-            objspace->rgengc.uncollectible_wb_unprotected_objects_limit = MAX(
-                (size_t)(objspace->rgengc.uncollectible_wb_unprotected_objects * r),
-                (size_t)(objspace->rgengc.old_objects * gc_params.uncollectible_wb_unprotected_objects_limit_ratio)
-            );
-            objspace->rgengc.old_objects_limit = (size_t)(objspace->rgengc.old_objects * r);
-        }
-
-        if (objspace->rgengc.uncollectible_wb_unprotected_objects > objspace->rgengc.uncollectible_wb_unprotected_objects_limit) {
-            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_SHADY;
-        }
-        if (objspace->rgengc.old_objects > objspace->rgengc.old_objects_limit) {
-            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDGEN;
-        }
-        if (RGENGC_FORCE_MAJOR_GC) {
-            gc_needs_major_flags = GPR_FLAG_MAJOR_BY_FORCE;
-        }
-
-        gc_report(1, objspace, "gc_marks_finish (marks %"PRIdSIZE" objects, "
-                  "old %"PRIdSIZE" objects, total %"PRIdSIZE" slots, "
-                  "sweep %"PRIdSIZE" slots, increment: %"PRIdSIZE", next GC: %s)\n",
-                  objspace->marked_slots, objspace->rgengc.old_objects, heap_eden_total_slots(objspace), sweep_slots, heap_allocatable_pages(objspace),
-                  gc_needs_major_flags ? "major" : "minor");
-    }
-
-    rb_ractor_finish_marking();
-
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_GC_END_MARK, 0);
-}
-
-static bool
-gc_compact_heap_cursors_met_p(rb_heap_t *heap)
-{
-    return heap->sweeping_page == heap->compact_cursor;
-}
-
-static rb_size_pool_t *
-gc_compact_destination_pool(rb_objspace_t *objspace, rb_size_pool_t *src_pool, VALUE src)
-{
-    size_t obj_size;
-    size_t idx = 0;
-
-    switch (BUILTIN_TYPE(src)) {
-      case T_ARRAY:
-        obj_size = rb_ary_size_as_embedded(src);
-        break;
-
       case T_OBJECT:
-        if (rb_shape_obj_too_complex(src)) {
-            return &size_pools[0];
+        if (rb_obj_shape_complex_p(obj)) {
+            return sizeof(struct RObject);
         }
         else {
-            obj_size = rb_obj_embedded_size(ROBJECT_IV_CAPACITY(src));
-        }
-        break;
-
-      case T_STRING:
-        obj_size = rb_str_size_as_embedded(src);
-        break;
-
-      case T_HASH:
-        obj_size = sizeof(struct RHash) + (RHASH_ST_TABLE_P(src) ? sizeof(st_table) : sizeof(ar_table));
-        break;
-
-      default:
-        return src_pool;
-    }
-
-    if (rb_gc_size_allocatable_p(obj_size)){
-        idx = rb_gc_size_pool_id_for_size(obj_size);
-    }
-    return &size_pools[idx];
-}
-
-static bool
-gc_compact_move(rb_objspace_t *objspace, rb_heap_t *heap, rb_size_pool_t *size_pool, VALUE src)
-{
-    GC_ASSERT(BUILTIN_TYPE(src) != T_MOVED);
-    GC_ASSERT(gc_is_moveable_obj(objspace, src));
-
-    rb_size_pool_t *dest_pool = gc_compact_destination_pool(objspace, size_pool, src);
-    rb_heap_t *dheap = SIZE_POOL_EDEN_HEAP(dest_pool);
-    rb_shape_t *new_shape = NULL;
-    rb_shape_t *orig_shape = NULL;
-
-    if (gc_compact_heap_cursors_met_p(dheap)) {
-        return dheap != heap;
-    }
-
-    if (RB_TYPE_P(src, T_OBJECT)) {
-        orig_shape = rb_shape_get_shape(src);
-        if (dheap != heap && !rb_shape_obj_too_complex(src)) {
-            rb_shape_t *initial_shape = rb_shape_get_shape_by_id((shape_id_t)((dest_pool - size_pools) + FIRST_T_OBJECT_SHAPE_ID));
-            new_shape = rb_shape_traverse_from_new_root(initial_shape, orig_shape);
-
-            if (!new_shape) {
-                dest_pool = size_pool;
-                dheap = heap;
+            size_t size = rb_obj_embedded_size(ROBJECT_FIELDS_CAPACITY(obj));
+            if (rb_gc_size_allocatable_p(size)) {
+                return size;
             }
-        }
-    }
-
-    while (!try_move(objspace, dheap, dheap->free_pages, src)) {
-        struct gc_sweep_context ctx = {
-            .page = dheap->sweeping_page,
-            .final_slots = 0,
-            .freed_slots = 0,
-            .empty_slots = 0,
-        };
-
-        /* The page of src could be partially compacted, so it may contain
-         * T_MOVED. Sweeping a page may read objects on this page, so we
-         * need to lock the page. */
-        lock_page_body(objspace, GET_PAGE_BODY(src));
-        gc_sweep_page(objspace, dheap, &ctx);
-        unlock_page_body(objspace, GET_PAGE_BODY(src));
-
-        if (dheap->sweeping_page->free_slots > 0) {
-            heap_add_freepage(dheap, dheap->sweeping_page);
-        }
-
-        dheap->sweeping_page = ccan_list_next(&dheap->pages, dheap->sweeping_page, page_node);
-        if (gc_compact_heap_cursors_met_p(dheap)) {
-            return dheap != heap;
-        }
-    }
-
-    if (orig_shape) {
-        if (new_shape) {
-            VALUE dest = rb_gc_location(src);
-            rb_shape_set_shape(dest, new_shape);
-        }
-        RMOVED(src)->original_shape_id = rb_shape_id(orig_shape);
-    }
-
-    return true;
-}
-
-static bool
-gc_compact_plane(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap, uintptr_t p, bits_t bitset, struct heap_page *page)
-{
-    short slot_size = page->slot_size;
-    short slot_bits = slot_size / BASE_SLOT_SIZE;
-    GC_ASSERT(slot_bits > 0);
-
-    do {
-        VALUE vp = (VALUE)p;
-        GC_ASSERT(vp % BASE_SLOT_SIZE == 0);
-
-        if (bitset & 1) {
-            objspace->rcompactor.considered_count_table[BUILTIN_TYPE(vp)]++;
-
-            if (gc_is_moveable_obj(objspace, vp)) {
-                if (!gc_compact_move(objspace, heap, size_pool, vp)) {
-                    //the cursors met. bubble up
-                    return false;
-                }
-            }
-        }
-        p += slot_size;
-        bitset >>= slot_bits;
-    } while (bitset);
-
-    return true;
-}
-
-// Iterate up all the objects in page, moving them to where they want to go
-static bool
-gc_compact_page(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap, struct heap_page *page)
-{
-    GC_ASSERT(page == heap->compact_cursor);
-
-    bits_t *mark_bits, *pin_bits;
-    bits_t bitset;
-    uintptr_t p = page->start;
-
-    mark_bits = page->mark_bits;
-    pin_bits = page->pinned_bits;
-
-    // objects that can be moved are marked and not pinned
-    bitset = (mark_bits[0] & ~pin_bits[0]);
-    bitset >>= NUM_IN_PAGE(p);
-    if (bitset) {
-        if (!gc_compact_plane(objspace, size_pool, heap, (uintptr_t)p, bitset, page))
-            return false;
-    }
-    p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
-
-    for (int j = 1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
-        bitset = (mark_bits[j] & ~pin_bits[j]);
-        if (bitset) {
-            if (!gc_compact_plane(objspace, size_pool, heap, (uintptr_t)p, bitset, page))
-                return false;
-        }
-        p += BITS_BITLENGTH * BASE_SLOT_SIZE;
-    }
-
-    return true;
-}
-
-static bool
-gc_compact_all_compacted_p(rb_objspace_t *objspace)
-{
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-        if (heap->total_pages > 0 &&
-                !gc_compact_heap_cursors_met_p(heap)) {
-            return false;
-        }
-    }
-
-    return true;
-}
-
-static void
-gc_sweep_compact(rb_objspace_t *objspace)
-{
-    gc_compact_start(objspace);
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-
-    while (!gc_compact_all_compacted_p(objspace)) {
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-            if (gc_compact_heap_cursors_met_p(heap)) {
-                continue;
-            }
-
-            struct heap_page *start_page = heap->compact_cursor;
-
-            if (!gc_compact_page(objspace, size_pool, heap, start_page)) {
-                lock_page_body(objspace, GET_PAGE_BODY(start_page->start));
-
-                continue;
-            }
-
-            // If we get here, we've finished moving all objects on the compact_cursor page
-            // So we can lock it and move the cursor on to the next one.
-            lock_page_body(objspace, GET_PAGE_BODY(start_page->start));
-            heap->compact_cursor = ccan_list_prev(&heap->pages, heap->compact_cursor, page_node);
-        }
-    }
-
-    gc_compact_finish(objspace);
-
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-}
-
-static void
-gc_marks_rest(rb_objspace_t *objspace)
-{
-    gc_report(1, objspace, "gc_marks_rest\n");
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        SIZE_POOL_EDEN_HEAP(&size_pools[i])->pooled_pages = NULL;
-    }
-
-    if (is_incremental_marking(objspace)) {
-        while (gc_mark_stacked_objects_incremental(objspace, INT_MAX) == FALSE);
-    }
-    else {
-        gc_mark_stacked_objects_all(objspace);
-    }
-
-    gc_marks_finish(objspace);
-}
-
-static bool
-gc_marks_step(rb_objspace_t *objspace, size_t slots)
-{
-    bool marking_finished = false;
-
-    GC_ASSERT(is_marking(objspace));
-    if (gc_mark_stacked_objects_incremental(objspace, slots)) {
-        gc_marks_finish(objspace);
-
-        marking_finished = true;
-    }
-
-    return marking_finished;
-}
-
-static bool
-gc_marks_continue(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
-{
-    GC_ASSERT(dont_gc_val() == FALSE);
-    bool marking_finished = true;
-
-    gc_marking_enter(objspace);
-
-    if (heap->free_pages) {
-        gc_report(2, objspace, "gc_marks_continue: has pooled pages");
-
-        marking_finished = gc_marks_step(objspace, objspace->rincgc.step_slots);
-    }
-    else {
-        gc_report(2, objspace, "gc_marks_continue: no more pooled pages (stack depth: %"PRIdSIZE").\n",
-                  mark_stack_size(&objspace->mark_stack));
-        size_pool->force_incremental_marking_finish_count++;
-        gc_marks_rest(objspace);
-    }
-
-    gc_marking_exit(objspace);
-
-    return marking_finished;
-}
-
-static bool
-gc_marks(rb_objspace_t *objspace, int full_mark)
-{
-    gc_prof_mark_timer_start(objspace);
-    gc_marking_enter(objspace);
-
-    bool marking_finished = false;
-
-    /* setup marking */
-
-    gc_marks_start(objspace, full_mark);
-    if (!is_incremental_marking(objspace)) {
-        gc_marks_rest(objspace);
-        marking_finished = true;
-    }
-
-#if RGENGC_PROFILE > 0
-    if (gc_prof_record(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->old_objects = objspace->rgengc.old_objects;
-    }
-#endif
-
-    gc_marking_exit(objspace);
-    gc_prof_mark_timer_stop(objspace);
-
-    return marking_finished;
-}
-
-/* RGENGC */
-
-static void
-gc_report_body(int level, rb_objspace_t *objspace, const char *fmt, ...)
-{
-    if (level <= RGENGC_DEBUG) {
-        char buf[1024];
-        FILE *out = stderr;
-        va_list args;
-        const char *status = " ";
-
-        if (during_gc) {
-            status = is_full_marking(objspace) ? "+" : "-";
-        }
-        else {
-            if (is_lazy_sweeping(objspace)) {
-                status = "S";
-            }
-            if (is_incremental_marking(objspace)) {
-                status = "M";
+            else {
+                return sizeof(struct RObject);
             }
         }
 
-        va_start(args, fmt);
-        vsnprintf(buf, 1024, fmt, args);
-        va_end(args);
-
-        fprintf(out, "%s|", status);
-        fputs(buf, out);
-    }
-}
-
-/* bit operations */
-
-static int
-rgengc_remembersetbits_set(rb_objspace_t *objspace, VALUE obj)
-{
-    struct heap_page *page = GET_HEAP_PAGE(obj);
-    bits_t *bits = &page->remembered_bits[0];
-
-    if (MARKED_IN_BITMAP(bits, obj)) {
-        return FALSE;
-    }
-    else {
-        page->flags.has_remembered_objects = TRUE;
-        MARK_IN_BITMAP(bits, obj);
-        return TRUE;
-    }
-}
-
-/* wb, etc */
-
-/* return FALSE if already remembered */
-static int
-rgengc_remember(rb_objspace_t *objspace, VALUE obj)
-{
-    gc_report(6, objspace, "rgengc_remember: %s %s\n", obj_info(obj),
-              RVALUE_REMEMBERED(obj) ? "was already remembered" : "is remembered now");
-
-    check_rvalue_consistency(obj);
-
-    if (RGENGC_CHECK_MODE) {
-        if (RVALUE_WB_UNPROTECTED(obj)) rb_bug("rgengc_remember: %s is not wb protected.", obj_info(obj));
-    }
-
-#if RGENGC_PROFILE > 0
-    if (!RVALUE_REMEMBERED(obj)) {
-        if (RVALUE_WB_UNPROTECTED(obj) == 0) {
-            objspace->profile.total_remembered_normal_object_count++;
-#if RGENGC_PROFILE >= 2
-            objspace->profile.remembered_normal_object_count_types[BUILTIN_TYPE(obj)]++;
-#endif
-        }
-    }
-#endif /* RGENGC_PROFILE > 0 */
-
-    return rgengc_remembersetbits_set(objspace, obj);
-}
-
-#ifndef PROFILE_REMEMBERSET_MARK
-#define PROFILE_REMEMBERSET_MARK 0
-#endif
-
-static inline void
-rgengc_rememberset_mark_plane(rb_objspace_t *objspace, uintptr_t p, bits_t bitset)
-{
-    if (bitset) {
-        do {
-            if (bitset & 1) {
-                VALUE obj = (VALUE)p;
-                gc_report(2, objspace, "rgengc_rememberset_mark: mark %s\n", obj_info(obj));
-                GC_ASSERT(RVALUE_UNCOLLECTIBLE(obj));
-                GC_ASSERT(RVALUE_OLD_P(obj) || RVALUE_WB_UNPROTECTED(obj));
-
-                gc_mark_children(objspace, obj);
-            }
-            p += BASE_SLOT_SIZE;
-            bitset >>= 1;
-        } while (bitset);
-    }
-}
-
-static void
-rgengc_rememberset_mark(rb_objspace_t *objspace, rb_heap_t *heap)
-{
-    size_t j;
-    struct heap_page *page = 0;
-#if PROFILE_REMEMBERSET_MARK
-    int has_old = 0, has_shady = 0, has_both = 0, skip = 0;
-#endif
-    gc_report(1, objspace, "rgengc_rememberset_mark: start\n");
-
-    ccan_list_for_each(&heap->pages, page, page_node) {
-        if (page->flags.has_remembered_objects | page->flags.has_uncollectible_wb_unprotected_objects) {
-            uintptr_t p = page->start;
-            bits_t bitset, bits[HEAP_PAGE_BITMAP_LIMIT];
-            bits_t *remembered_bits = page->remembered_bits;
-            bits_t *uncollectible_bits = page->uncollectible_bits;
-            bits_t *wb_unprotected_bits = page->wb_unprotected_bits;
-#if PROFILE_REMEMBERSET_MARK
-            if (page->flags.has_remembered_objects && page->flags.has_uncollectible_wb_unprotected_objects) has_both++;
-            else if (page->flags.has_remembered_objects) has_old++;
-            else if (page->flags.has_uncollectible_wb_unprotected_objects) has_shady++;
-#endif
-            for (j=0; j<HEAP_PAGE_BITMAP_LIMIT; j++) {
-                bits[j] = remembered_bits[j] | (uncollectible_bits[j] & wb_unprotected_bits[j]);
-                remembered_bits[j] = 0;
+      case T_STRING:
+        {
+            size_t size = rb_str_size_as_embedded(obj);
+            if (rb_gc_size_allocatable_p(size)) {
+                return size;
             }
-            page->flags.has_remembered_objects = FALSE;
-
-            bitset = bits[0];
-            bitset >>= NUM_IN_PAGE(p);
-            rgengc_rememberset_mark_plane(objspace, p, bitset);
-            p += (BITS_BITLENGTH - NUM_IN_PAGE(p)) * BASE_SLOT_SIZE;
-
-            for (j=1; j < HEAP_PAGE_BITMAP_LIMIT; j++) {
-                bitset = bits[j];
-                rgengc_rememberset_mark_plane(objspace, p, bitset);
-                p += BITS_BITLENGTH * BASE_SLOT_SIZE;
+            else {
+                return sizeof(struct RString);
             }
         }
-#if PROFILE_REMEMBERSET_MARK
-        else {
-            skip++;
-        }
-#endif
-    }
-
-#if PROFILE_REMEMBERSET_MARK
-    fprintf(stderr, "%d\t%d\t%d\t%d\n", has_both, has_old, has_shady, skip);
-#endif
-    gc_report(1, objspace, "rgengc_rememberset_mark: finished\n");
-}
 
-static void
-rgengc_mark_and_rememberset_clear(rb_objspace_t *objspace, rb_heap_t *heap)
-{
-    struct heap_page *page = 0;
-
-    ccan_list_for_each(&heap->pages, page, page_node) {
-        memset(&page->mark_bits[0],       0, HEAP_PAGE_BITMAP_SIZE);
-        memset(&page->uncollectible_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
-        memset(&page->marking_bits[0],    0, HEAP_PAGE_BITMAP_SIZE);
-        memset(&page->remembered_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
-        memset(&page->pinned_bits[0],     0, HEAP_PAGE_BITMAP_SIZE);
-        page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
-        page->flags.has_remembered_objects = FALSE;
-    }
-}
-
-/* RGENGC: APIs */
-
-NOINLINE(static void gc_writebarrier_generational(VALUE a, VALUE b, rb_objspace_t *objspace));
-
-static void
-gc_writebarrier_generational(VALUE a, VALUE b, rb_objspace_t *objspace)
-{
-    if (RGENGC_CHECK_MODE) {
-        if (!RVALUE_OLD_P(a)) rb_bug("gc_writebarrier_generational: %s is not an old object.", obj_info(a));
-        if ( RVALUE_OLD_P(b)) rb_bug("gc_writebarrier_generational: %s is an old object.", obj_info(b));
-        if (is_incremental_marking(objspace)) rb_bug("gc_writebarrier_generational: called while incremental marking: %s -> %s", obj_info(a), obj_info(b));
-    }
-
-    /* mark `a' and remember (default behavior) */
-    if (!RVALUE_REMEMBERED(a)) {
-        RB_VM_LOCK_ENTER_NO_BARRIER();
+      case T_HASH:
         {
-            rgengc_remember(objspace, a);
-        }
-        RB_VM_LOCK_LEAVE_NO_BARRIER();
-        gc_report(1, objspace, "gc_writebarrier_generational: %s (remembered) -> %s\n", obj_info(a), obj_info(b));
-    }
-
-    check_rvalue_consistency(a);
-    check_rvalue_consistency(b);
-}
-
-static void
-gc_mark_from(rb_objspace_t *objspace, VALUE obj, VALUE parent)
-{
-    gc_mark_set_parent(objspace, parent);
-    rgengc_check_relation(objspace, obj);
-    if (gc_mark_set(objspace, obj) == FALSE) return;
-    gc_aging(objspace, obj);
-    gc_grey(objspace, obj);
-}
-
-NOINLINE(static void gc_writebarrier_incremental(VALUE a, VALUE b, rb_objspace_t *objspace));
-
-static void
-gc_writebarrier_incremental(VALUE a, VALUE b, rb_objspace_t *objspace)
-{
-    gc_report(2, objspace, "gc_writebarrier_incremental: [LG] %p -> %s\n", (void *)a, obj_info(b));
-
-    if (RVALUE_BLACK_P(a)) {
-        if (RVALUE_WHITE_P(b)) {
-            if (!RVALUE_WB_UNPROTECTED(a)) {
-                gc_report(2, objspace, "gc_writebarrier_incremental: [IN] %p -> %s\n", (void *)a, obj_info(b));
-                gc_mark_from(objspace, b, a);
+            if (RB_OBJ_FROZEN(obj) && RHASH_AR_TABLE_P(obj)) {
+                return sizeof(struct RHash) + offsetof(ar_table, pairs) + RHASH_AR_TABLE_BOUND(obj) * sizeof(ar_table_pair);
             }
-        }
-        else if (RVALUE_OLD_P(a) && !RVALUE_OLD_P(b)) {
-            rgengc_remember(objspace, a);
+            return sizeof(struct RHash) + (RHASH_ST_TABLE_P(obj) ? sizeof(st_table) : sizeof(ar_table));
         }
 
-        if (UNLIKELY(objspace->flags.during_compacting)) {
-            MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(b), b);
-        }
+      default:
+        return 0;
     }
 }
 
 void
 rb_gc_writebarrier(VALUE a, VALUE b)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
-    if (RGENGC_CHECK_MODE) {
-        if (SPECIAL_CONST_P(a)) rb_bug("rb_gc_writebarrier: a is special const: %"PRIxVALUE, a);
-        if (SPECIAL_CONST_P(b)) rb_bug("rb_gc_writebarrier: b is special const: %"PRIxVALUE, b);
-    }
-
-  retry:
-    if (!is_incremental_marking(objspace)) {
-        if (!RVALUE_OLD_P(a) || RVALUE_OLD_P(b)) {
-            // do nothing
-        }
-        else {
-            gc_writebarrier_generational(a, b, objspace);
-        }
-    }
-    else {
-        bool retry = false;
-        /* slow path */
-        RB_VM_LOCK_ENTER_NO_BARRIER();
-        {
-            if (is_incremental_marking(objspace)) {
-                gc_writebarrier_incremental(a, b, objspace);
-            }
-            else {
-                retry = true;
-            }
-        }
-        RB_VM_LOCK_LEAVE_NO_BARRIER();
-
-        if (retry) goto retry;
-    }
-    return;
+    rb_gc_impl_writebarrier(rb_gc_get_objspace(), a, b);
 }
 
 void
 rb_gc_writebarrier_unprotect(VALUE obj)
 {
-    if (RVALUE_WB_UNPROTECTED(obj)) {
-        return;
-    }
-    else {
-        rb_objspace_t *objspace = &rb_objspace;
-
-        gc_report(2, objspace, "rb_gc_writebarrier_unprotect: %s %s\n", obj_info(obj),
-                  RVALUE_REMEMBERED(obj) ? " (already remembered)" : "");
-
-        RB_VM_LOCK_ENTER_NO_BARRIER();
-        {
-            if (RVALUE_OLD_P(obj)) {
-                gc_report(1, objspace, "rb_gc_writebarrier_unprotect: %s\n", obj_info(obj));
-                RVALUE_DEMOTE(objspace, obj);
-                gc_mark_set(objspace, obj);
-                gc_remember_unprotected(objspace, obj);
-
-#if RGENGC_PROFILE
-                objspace->profile.total_shade_operation_count++;
-#if RGENGC_PROFILE >= 2
-                objspace->profile.shade_operation_count_types[BUILTIN_TYPE(obj)]++;
-#endif /* RGENGC_PROFILE >= 2 */
-#endif /* RGENGC_PROFILE */
-            }
-            else {
-                RVALUE_AGE_RESET(obj);
-            }
-
-            RB_DEBUG_COUNTER_INC(obj_wb_unprotect);
-            MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
-        }
-        RB_VM_LOCK_LEAVE_NO_BARRIER();
-    }
+    rb_gc_impl_writebarrier_unprotect(rb_gc_get_objspace(), obj);
 }
 
 /*
@@ -8709,83 +3650,61 @@ rb_gc_writebarrier_unprotect(VALUE obj)
 void
 rb_gc_writebarrier_remember(VALUE obj)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
-    gc_report(1, objspace, "rb_gc_writebarrier_remember: %s\n", obj_info(obj));
-
-    if (is_incremental_marking(objspace)) {
-        if (RVALUE_BLACK_P(obj)) {
-            gc_grey(objspace, obj);
-        }
-    }
-    else {
-        if (RVALUE_OLD_P(obj)) {
-            rgengc_remember(objspace, obj);
-        }
-    }
+    rb_gc_impl_writebarrier_remember(rb_gc_get_objspace(), obj);
 }
 
 void
 rb_gc_copy_attributes(VALUE dest, VALUE obj)
 {
-    if (RVALUE_WB_UNPROTECTED(obj)) {
-        rb_gc_writebarrier_unprotect(dest);
-    }
-    rb_gc_copy_finalizer(dest, obj);
+    rb_gc_impl_copy_attributes(rb_gc_get_objspace(), dest, obj);
 }
 
-size_t
-rb_obj_gc_flags(VALUE obj, ID* flags, size_t max)
+#if USE_MODULAR_GC
+int
+rb_gc_modular_gc_loaded_p(void)
+{
+    return rb_gc_functions.modular_gc_loaded_p;
+}
+
+const char *
+rb_gc_active_gc_name(void)
 {
-    size_t n = 0;
-    static ID ID_marked;
-    static ID ID_wb_protected, ID_old, ID_marking, ID_uncollectible, ID_pinned;
+    const char *gc_name = rb_gc_impl_active_gc_name();
 
-    if (!ID_marked) {
-#define I(s) ID_##s = rb_intern(#s);
-        I(marked);
-        I(wb_protected);
-        I(old);
-        I(marking);
-        I(uncollectible);
-        I(pinned);
-#undef I
+    const size_t len = strlen(gc_name);
+    if (len > RB_GC_MAX_NAME_LEN) {
+        rb_bug("GC should have a name no more than %d chars long. Currently: %zu (%s)",
+               RB_GC_MAX_NAME_LEN, len, gc_name);
     }
 
-    if (RVALUE_WB_UNPROTECTED(obj) == 0 && n<max)                   flags[n++] = ID_wb_protected;
-    if (RVALUE_OLD_P(obj) && n<max)                                 flags[n++] = ID_old;
-    if (RVALUE_UNCOLLECTIBLE(obj) && n<max)                         flags[n++] = ID_uncollectible;
-    if (MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj) && n<max) flags[n++] = ID_marking;
-    if (MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj) && n<max)    flags[n++] = ID_marked;
-    if (MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj) && n<max)  flags[n++] = ID_pinned;
-    return n;
+    return gc_name;
 }
+#endif
 
-/* GC */
-
-void
-rb_gc_ractor_newobj_cache_clear(rb_ractor_newobj_cache_t *newobj_cache)
+struct rb_gc_object_metadata_entry *
+rb_gc_object_metadata(VALUE obj)
 {
-    newobj_cache->incremental_mark_step_allocated_slots = 0;
-
-    for (size_t size_pool_idx = 0; size_pool_idx < SIZE_POOL_COUNT; size_pool_idx++) {
-        rb_ractor_newobj_size_pool_cache_t *cache = &newobj_cache->size_pool_caches[size_pool_idx];
+    return rb_gc_impl_object_metadata(rb_gc_get_objspace(), obj);
+}
 
-        struct heap_page *page = cache->using_page;
-        RVALUE *freelist = cache->freelist;
-        RUBY_DEBUG_LOG("ractor using_page:%p freelist:%p", (void *)page, (void *)freelist);
+/* GC */
 
-        heap_page_freelist_append(page, freelist);
+void *
+rb_gc_ractor_cache_alloc(rb_ractor_t *ractor)
+{
+    return rb_gc_impl_ractor_cache_alloc(rb_gc_get_objspace(), ractor);
+}
 
-        cache->using_page = NULL;
-        cache->freelist = NULL;
-    }
+void
+rb_gc_ractor_cache_free(void *cache)
+{
+    rb_gc_impl_ractor_cache_free(rb_gc_get_objspace(), cache);
 }
 
 void
 rb_gc_register_mark_object(VALUE obj)
 {
-    if (!is_pointer_to_heap(&rb_objspace, (void *)obj))
+    if (!rb_gc_impl_pointer_to_heap_p(rb_gc_get_objspace(), (void *)obj))
         return;
 
     rb_vm_register_global_object(obj);
@@ -8798,10 +3717,15 @@ rb_gc_register_address(VALUE *addr)
 
     VALUE obj = *addr;
 
-    struct global_object_list *tmp = ALLOC(struct global_object_list);
-    tmp->next = vm->global_object_list;
-    tmp->varptr = addr;
-    vm->global_object_list = tmp;
+    RB_VM_LOCKING() {
+        if (vm->global_object_list_size == vm->global_object_list_capa) {
+            size_t new_capa = vm->global_object_list_capa ? vm->global_object_list_capa * 2 : 64;
+            SIZED_REALLOC_N(vm->global_object_list, VALUE *, new_capa, vm->global_object_list_capa);
+            vm->global_object_list_capa = new_capa;
+        }
+
+        vm->global_object_list[vm->global_object_list_size++] = addr;
+    }
 
     /*
      * Because some C extensions have assignment-then-register bugs,
@@ -8819,22 +3743,20 @@ void
 rb_gc_unregister_address(VALUE *addr)
 {
     rb_vm_t *vm = GET_VM();
-    struct global_object_list *tmp = vm->global_object_list;
-
-    if (tmp->varptr == addr) {
-        vm->global_object_list = tmp->next;
-        xfree(tmp);
-        return;
-    }
-    while (tmp->next) {
-        if (tmp->next->varptr == addr) {
-            struct global_object_list *t = tmp->next;
-
-            tmp->next = tmp->next->next;
-            xfree(t);
-            break;
+    RB_VM_LOCKING() {
+        size_t index;
+        for (index = 0; index < vm->global_object_list_size; index++) {
+            if (addr == vm->global_object_list[index]) {
+                MEMMOVE(
+                    vm->global_object_list[index],
+                    &vm->global_object_list[index + 1],
+                    VALUE *,
+                    vm->global_object_list_size - index - 1
+                );
+                vm->global_object_list_size--;
+                break;
+            }
         }
-        tmp = tmp->next;
     }
 }
 
@@ -8844,1290 +3766,626 @@ rb_global_variable(VALUE *var)
     rb_gc_register_address(var);
 }
 
-enum {
-    gc_stress_no_major,
-    gc_stress_no_immediate_sweep,
-    gc_stress_full_mark_after_malloc,
-    gc_stress_max
-};
-
-#define gc_stress_full_mark_after_malloc_p() \
-    (FIXNUM_P(ruby_gc_stress_mode) && (FIX2LONG(ruby_gc_stress_mode) & (1<<gc_stress_full_mark_after_malloc)))
-
-static void
-heap_ready_to_gc(rb_objspace_t *objspace, rb_size_pool_t *size_pool, rb_heap_t *heap)
+static VALUE
+gc_start_internal(rb_execution_context_t *ec, VALUE self, VALUE full_mark, VALUE immediate_mark, VALUE immediate_sweep, VALUE compact)
 {
-    if (!heap->free_pages) {
-        if (!heap_increment(objspace, size_pool, heap)) {
-            size_pool_allocatable_pages_set(objspace, size_pool, 1);
-            heap_increment(objspace, size_pool, heap);
-        }
-    }
+    rb_gc_impl_start(rb_gc_get_objspace(), RTEST(full_mark), RTEST(immediate_mark), RTEST(immediate_sweep), RTEST(compact));
+
+    return Qnil;
 }
 
-static int
-ready_to_gc(rb_objspace_t *objspace)
+/*
+ * rb_objspace_each_objects() is special C API to walk through
+ * Ruby object space.  This C API is too difficult to use it.
+ * To be frank, you should not use it. Or you need to read the
+ * source code of this function and understand what this function does.
+ *
+ * 'callback' will be called several times (the number of heap page,
+ * at current implementation) with:
+ *   vstart: a pointer to the first living object of the heap_page.
+ *   vend: a pointer to next to the valid heap_page area.
+ *   stride: a distance to next VALUE.
+ *
+ * If callback() returns non-zero, the iteration will be stopped.
+ *
+ * This is a sample callback code to iterate liveness objects:
+ *
+ *   static int
+ *   sample_callback(void *vstart, void *vend, int stride, void *data)
+ *   {
+ *       VALUE v = (VALUE)vstart;
+ *       for (; v != (VALUE)vend; v += stride) {
+ *           if (!rb_objspace_internal_object_p(v)) { // liveness check
+ *               // do something with live object 'v'
+ *           }
+ *       }
+ *       return 0; // continue to iteration
+ *   }
+ *
+ * Note: 'vstart' is not a top of heap_page.  This point the first
+ *       living object to grasp at least one object to avoid GC issue.
+ *       This means that you can not walk through all Ruby object page
+ *       including freed object page.
+ *
+ * Note: On this implementation, 'stride' is the same as sizeof(RVALUE).
+ *       However, there are possibilities to pass variable values with
+ *       'stride' with some reasons.  You must use stride instead of
+ *       use some constant value in the iteration.
+ */
+void
+rb_objspace_each_objects(int (*callback)(void *, void *, size_t, void *), void *data)
 {
-    if (dont_gc_val() || during_gc || ruby_disable_gc) {
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            rb_size_pool_t *size_pool = &size_pools[i];
-            heap_ready_to_gc(objspace, size_pool, SIZE_POOL_EDEN_HEAP(size_pool));
-        }
-        return FALSE;
-    }
-    else {
-        return TRUE;
-    }
+    rb_gc_impl_each_objects(rb_gc_get_objspace(), callback, data);
 }
 
 static void
-gc_reset_malloc_info(rb_objspace_t *objspace, bool full_mark)
+gc_ref_update_array(void *objspace, VALUE v)
 {
-    gc_prof_set_malloc_info(objspace);
-    {
-        size_t inc = ATOMIC_SIZE_EXCHANGE(malloc_increase, 0);
-        size_t old_limit = malloc_limit;
+    if (ARY_SHARED_P(v)) {
+        VALUE old_root = RARRAY(v)->as.heap.aux.shared_root;
 
-        if (inc > malloc_limit) {
-            malloc_limit = (size_t)(inc * gc_params.malloc_limit_growth_factor);
-            if (malloc_limit > gc_params.malloc_limit_max) {
-                malloc_limit = gc_params.malloc_limit_max;
-            }
-        }
-        else {
-            malloc_limit = (size_t)(malloc_limit * 0.98); /* magic number */
-            if (malloc_limit < gc_params.malloc_limit_min) {
-                malloc_limit = gc_params.malloc_limit_min;
-            }
-        }
+        UPDATE_IF_MOVED(objspace, RARRAY(v)->as.heap.aux.shared_root);
 
-        if (0) {
-            if (old_limit != malloc_limit) {
-                fprintf(stderr, "[%"PRIuSIZE"] malloc_limit: %"PRIuSIZE" -> %"PRIuSIZE"\n",
-                        rb_gc_count(), old_limit, malloc_limit);
-            }
-            else {
-                fprintf(stderr, "[%"PRIuSIZE"] malloc_limit: not changed (%"PRIuSIZE")\n",
-                        rb_gc_count(), malloc_limit);
-            }
+        VALUE new_root = RARRAY(v)->as.heap.aux.shared_root;
+        // If the root is embedded and its location has changed
+        if (ARY_EMBED_P(new_root) && new_root != old_root) {
+            size_t offset = (size_t)(RARRAY(v)->as.heap.ptr - RARRAY(old_root)->as.ary);
+            GC_ASSERT(RARRAY(v)->as.heap.ptr >= RARRAY(old_root)->as.ary);
+            RARRAY(v)->as.heap.ptr = RARRAY(new_root)->as.ary + offset;
         }
     }
+    else {
+        long len = RARRAY_LEN(v);
 
-    /* reset oldmalloc info */
-#if RGENGC_ESTIMATE_OLDMALLOC
-    if (!full_mark) {
-        if (objspace->rgengc.oldmalloc_increase > objspace->rgengc.oldmalloc_increase_limit) {
-            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDMALLOC;
-            objspace->rgengc.oldmalloc_increase_limit =
-              (size_t)(objspace->rgengc.oldmalloc_increase_limit * gc_params.oldmalloc_limit_growth_factor);
-
-            if (objspace->rgengc.oldmalloc_increase_limit > gc_params.oldmalloc_limit_max) {
-                objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_max;
+        if (len > 0) {
+            VALUE *ptr = (VALUE *)RARRAY_CONST_PTR(v);
+            for (long i = 0; i < len; i++) {
+                UPDATE_IF_MOVED(objspace, ptr[i]);
             }
         }
 
-        if (0) fprintf(stderr, "%"PRIdSIZE"\t%d\t%"PRIuSIZE"\t%"PRIuSIZE"\t%"PRIdSIZE"\n",
-                       rb_gc_count(),
-                       gc_needs_major_flags,
-                       objspace->rgengc.oldmalloc_increase,
-                       objspace->rgengc.oldmalloc_increase_limit,
-                       gc_params.oldmalloc_limit_max);
-    }
-    else {
-        /* major GC */
-        objspace->rgengc.oldmalloc_increase = 0;
-
-        if ((objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_BY_OLDMALLOC) == 0) {
-            objspace->rgengc.oldmalloc_increase_limit =
-              (size_t)(objspace->rgengc.oldmalloc_increase_limit / ((gc_params.oldmalloc_limit_growth_factor - 1)/10 + 1));
-            if (objspace->rgengc.oldmalloc_increase_limit < gc_params.oldmalloc_limit_min) {
-                objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
+        if (rb_gc_obj_slot_size(v) >= rb_ary_size_as_embedded(v)) {
+            if (rb_ary_embeddable_p(v)) {
+                rb_ary_make_embedded(v);
             }
         }
     }
-#endif
-}
-
-static int
-garbage_collect(rb_objspace_t *objspace, unsigned int reason)
-{
-    int ret;
-
-    RB_VM_LOCK_ENTER();
-    {
-#if GC_PROFILE_MORE_DETAIL
-        objspace->profile.prepare_time = getrusage_time();
-#endif
-
-        gc_rest(objspace);
-
-#if GC_PROFILE_MORE_DETAIL
-        objspace->profile.prepare_time = getrusage_time() - objspace->profile.prepare_time;
-#endif
-
-        ret = gc_start(objspace, reason);
-    }
-    RB_VM_LOCK_LEAVE();
-
-    return ret;
-}
-
-static int
-gc_start(rb_objspace_t *objspace, unsigned int reason)
-{
-    unsigned int do_full_mark = !!(reason & GPR_FLAG_FULL_MARK);
-
-    /* reason may be clobbered, later, so keep set immediate_sweep here */
-    objspace->flags.immediate_sweep = !!(reason & GPR_FLAG_IMMEDIATE_SWEEP);
-
-    if (!heap_allocated_pages) return TRUE; /* heap is not ready */
-    if (!(reason & GPR_FLAG_METHOD) && !ready_to_gc(objspace)) return TRUE; /* GC is not allowed */
-
-    GC_ASSERT(gc_mode(objspace) == gc_mode_none);
-    GC_ASSERT(!is_lazy_sweeping(objspace));
-    GC_ASSERT(!is_incremental_marking(objspace));
-
-    unsigned int lock_lev;
-    gc_enter(objspace, gc_enter_event_start, &lock_lev);
-
-#if RGENGC_CHECK_MODE >= 2
-    gc_verify_internal_consistency(objspace);
-#endif
-
-    if (ruby_gc_stressful) {
-        int flag = FIXNUM_P(ruby_gc_stress_mode) ? FIX2INT(ruby_gc_stress_mode) : 0;
-
-        if ((flag & (1<<gc_stress_no_major)) == 0) {
-            do_full_mark = TRUE;
-        }
-
-        objspace->flags.immediate_sweep = !(flag & (1<<gc_stress_no_immediate_sweep));
-    }
-
-    if (gc_needs_major_flags) {
-        reason |= gc_needs_major_flags;
-        do_full_mark = TRUE;
-    }
-    else if (RGENGC_FORCE_MAJOR_GC) {
-        reason = GPR_FLAG_MAJOR_BY_FORCE;
-        do_full_mark = TRUE;
-    }
-
-    gc_needs_major_flags = GPR_FLAG_NONE;
-
-    if (do_full_mark && (reason & GPR_FLAG_MAJOR_MASK) == 0) {
-        reason |= GPR_FLAG_MAJOR_BY_FORCE; /* GC by CAPI, METHOD, and so on. */
-    }
-
-    if (objspace->flags.dont_incremental ||
-            reason & GPR_FLAG_IMMEDIATE_MARK ||
-            ruby_gc_stressful) {
-        objspace->flags.during_incremental_marking = FALSE;
-    }
-    else {
-        objspace->flags.during_incremental_marking = do_full_mark;
-    }
-
-    /* Explicitly enable compaction (GC.compact) */
-    if (do_full_mark && ruby_enable_autocompact) {
-        objspace->flags.during_compacting = TRUE;
-#if RGENGC_CHECK_MODE
-        objspace->rcompactor.compare_func = ruby_autocompact_compare_func;
-#endif
-    }
-    else {
-        objspace->flags.during_compacting = !!(reason & GPR_FLAG_COMPACT);
-    }
-
-    if (!GC_ENABLE_LAZY_SWEEP || objspace->flags.dont_incremental) {
-        objspace->flags.immediate_sweep = TRUE;
-    }
-
-    if (objspace->flags.immediate_sweep) reason |= GPR_FLAG_IMMEDIATE_SWEEP;
-
-    gc_report(1, objspace, "gc_start(reason: %x) => %u, %d, %d\n",
-              reason,
-              do_full_mark, !is_incremental_marking(objspace), objspace->flags.immediate_sweep);
-
-#if USE_DEBUG_COUNTER
-    RB_DEBUG_COUNTER_INC(gc_count);
-
-    if (reason & GPR_FLAG_MAJOR_MASK) {
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_nofree, reason & GPR_FLAG_MAJOR_BY_NOFREE);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldgen, reason & GPR_FLAG_MAJOR_BY_OLDGEN);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_shady,  reason & GPR_FLAG_MAJOR_BY_SHADY);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_force,  reason & GPR_FLAG_MAJOR_BY_FORCE);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldmalloc, reason & GPR_FLAG_MAJOR_BY_OLDMALLOC);
-#endif
-    }
-    else {
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_newobj, reason & GPR_FLAG_NEWOBJ);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_malloc, reason & GPR_FLAG_MALLOC);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_method, reason & GPR_FLAG_METHOD);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_capi,   reason & GPR_FLAG_CAPI);
-        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_stress, reason & GPR_FLAG_STRESS);
-    }
-#endif
-
-    objspace->profile.count++;
-    objspace->profile.latest_gc_info = reason;
-    objspace->profile.total_allocated_objects_at_gc_start = total_allocated_objects(objspace);
-    objspace->profile.heap_used_at_gc_start = heap_allocated_pages;
-    objspace->profile.weak_references_count = 0;
-    objspace->profile.retained_weak_references_count = 0;
-    gc_prof_setup_new_record(objspace, reason);
-    gc_reset_malloc_info(objspace, do_full_mark);
-
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_GC_START, 0 /* TODO: pass minor/immediate flag? */);
-    GC_ASSERT(during_gc);
-
-    gc_prof_timer_start(objspace);
-    {
-        if (gc_marks(objspace, do_full_mark)) {
-            gc_sweep(objspace);
-        }
-    }
-    gc_prof_timer_stop(objspace);
-
-    gc_exit(objspace, gc_enter_event_start, &lock_lev);
-    return TRUE;
 }
 
 static void
-gc_rest(rb_objspace_t *objspace)
+gc_ref_update_object(void *objspace, VALUE v)
 {
-    if (is_incremental_marking(objspace) || is_lazy_sweeping(objspace)) {
-        unsigned int lock_lev;
-        gc_enter(objspace, gc_enter_event_rest, &lock_lev);
+    VALUE *ptr = ROBJECT_FIELDS(v);
 
-        if (RGENGC_CHECK_MODE >= 2) gc_verify_internal_consistency(objspace);
-
-        if (is_incremental_marking(objspace)) {
-            gc_marking_enter(objspace);
-            gc_marks_rest(objspace);
-            gc_marking_exit(objspace);
-
-            gc_sweep(objspace);
+    if (FL_TEST_RAW(v, ROBJECT_HEAP)) {
+        if (rb_obj_shape_complex_p(v)) {
+            gc_ref_update_table_values_only(ROBJECT_FIELDS_HASH(v));
+            return;
         }
 
-        if (is_lazy_sweeping(objspace)) {
-            gc_sweeping_enter(objspace);
-            gc_sweep_rest(objspace);
-            gc_sweeping_exit(objspace);
+        size_t slot_size = rb_gc_obj_slot_size(v);
+        size_t embed_size = rb_obj_embedded_size(ROBJECT_FIELDS_CAPACITY(v));
+        if (slot_size >= embed_size) {
+            // Object can be re-embedded
+            memcpy(ROBJECT(v)->as.ary, ptr, sizeof(VALUE) * ROBJECT_FIELDS_COUNT(v));
+            SIZED_FREE_N(ptr, ROBJECT_FIELDS_CAPACITY(v));
+            FL_UNSET_RAW(v, ROBJECT_HEAP);
+            ptr = ROBJECT(v)->as.ary;
         }
-
-        gc_exit(objspace, gc_enter_event_rest, &lock_lev);
     }
-}
 
-struct objspace_and_reason {
-    rb_objspace_t *objspace;
-    unsigned int reason;
-};
-
-static void
-gc_current_status_fill(rb_objspace_t *objspace, char *buff)
-{
-    int i = 0;
-    if (is_marking(objspace)) {
-        buff[i++] = 'M';
-        if (is_full_marking(objspace))        buff[i++] = 'F';
-        if (is_incremental_marking(objspace)) buff[i++] = 'I';
-    }
-    else if (is_sweeping(objspace)) {
-        buff[i++] = 'S';
-        if (is_lazy_sweeping(objspace))      buff[i++] = 'L';
-    }
-    else {
-        buff[i++] = 'N';
+    for (uint32_t i = 0; i < ROBJECT_FIELDS_COUNT(v); i++) {
+        UPDATE_IF_MOVED(objspace, ptr[i]);
     }
-    buff[i] = '\0';
 }
 
-static const char *
-gc_current_status(rb_objspace_t *objspace)
+void
+rb_gc_ref_update_table_values_only(st_table *tbl)
 {
-    static char buff[0x10];
-    gc_current_status_fill(objspace, buff);
-    return buff;
+    gc_ref_update_table_values_only(tbl);
 }
 
-#if PRINT_ENTER_EXIT_TICK
-
-static tick_t last_exit_tick;
-static tick_t enter_tick;
-static int enter_count = 0;
-static char last_gc_status[0x10];
-
-static inline void
-gc_record(rb_objspace_t *objspace, int direction, const char *event)
-{
-    if (direction == 0) { /* enter */
-        enter_count++;
-        enter_tick = tick();
-        gc_current_status_fill(objspace, last_gc_status);
-    }
-    else { /* exit */
-        tick_t exit_tick = tick();
-        char current_gc_status[0x10];
-        gc_current_status_fill(objspace, current_gc_status);
-#if 1
-        /* [last mutator time] [gc time] [event] */
-        fprintf(stderr, "%"PRItick"\t%"PRItick"\t%s\t[%s->%s|%c]\n",
-                enter_tick - last_exit_tick,
-                exit_tick - enter_tick,
-                event,
-                last_gc_status, current_gc_status,
-                (objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ? '+' : '-');
-        last_exit_tick = exit_tick;
-#else
-        /* [enter_tick] [gc time] [event] */
-        fprintf(stderr, "%"PRItick"\t%"PRItick"\t%s\t[%s->%s|%c]\n",
-                enter_tick,
-                exit_tick - enter_tick,
-                event,
-                last_gc_status, current_gc_status,
-                (objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ? '+' : '-');
-#endif
-    }
-}
-#else /* PRINT_ENTER_EXIT_TICK */
-static inline void
-gc_record(rb_objspace_t *objspace, int direction, const char *event)
+/* Update MOVED references in a VALUE=>VALUE st_table */
+void
+rb_gc_update_tbl_refs(st_table *ptr)
 {
-    /* null */
+    gc_update_table_refs(ptr);
 }
-#endif /* PRINT_ENTER_EXIT_TICK */
 
-static const char *
-gc_enter_event_cstr(enum gc_enter_event event)
+static int
+rb_gc_update_set_refs_i(st_data_t key, st_data_t value, st_data_t argp, int error)
 {
-    switch (event) {
-      case gc_enter_event_start: return "start";
-      case gc_enter_event_continue: return "continue";
-      case gc_enter_event_rest: return "rest";
-      case gc_enter_event_finalizer: return "finalizer";
-      case gc_enter_event_rb_memerror: return "rb_memerror";
+    if (rb_gc_location((VALUE)key) != (VALUE)key) {
+        return ST_REPLACE;
     }
-    return NULL;
-}
 
-static void
-gc_enter_count(enum gc_enter_event event)
-{
-    switch (event) {
-      case gc_enter_event_start:          RB_DEBUG_COUNTER_INC(gc_enter_start); break;
-      case gc_enter_event_continue:       RB_DEBUG_COUNTER_INC(gc_enter_continue); break;
-      case gc_enter_event_rest:           RB_DEBUG_COUNTER_INC(gc_enter_rest); break;
-      case gc_enter_event_finalizer:      RB_DEBUG_COUNTER_INC(gc_enter_finalizer); break;
-      case gc_enter_event_rb_memerror:    /* nothing */ break;
-    }
+    return ST_CONTINUE;
 }
 
-static bool current_process_time(struct timespec *ts);
-
-static void
-gc_clock_start(struct timespec *ts)
+static int
+rb_gc_update_set_refs_replace_i(st_data_t *key, st_data_t *value, st_data_t argp, int existing)
 {
-    if (!current_process_time(ts)) {
-        ts->tv_sec = 0;
-        ts->tv_nsec = 0;
+    if (rb_gc_location((VALUE)*key) != (VALUE)*key) {
+        *key = rb_gc_location((VALUE)*key);
     }
+
+    return ST_CONTINUE;
 }
 
-static uint64_t
-gc_clock_end(struct timespec *ts)
+void
+rb_gc_update_set_refs(st_table *tbl)
 {
-    struct timespec end_time;
-
-    if ((ts->tv_sec > 0 || ts->tv_nsec > 0) &&
-            current_process_time(&end_time) &&
-            end_time.tv_sec >= ts->tv_sec) {
-        return (uint64_t)(end_time.tv_sec - ts->tv_sec) * (1000 * 1000 * 1000) +
-                    (end_time.tv_nsec - ts->tv_nsec);
-    }
-
-    return 0;
-}
+    if (!tbl || tbl->num_entries == 0) return;
 
-static inline void
-gc_enter(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev)
-{
-    RB_VM_LOCK_ENTER_LEV(lock_lev);
-
-    switch (event) {
-      case gc_enter_event_rest:
-        if (!is_marking(objspace)) break;
-        // fall through
-      case gc_enter_event_start:
-      case gc_enter_event_continue:
-        // stop other ractors
-        rb_vm_barrier();
-        break;
-      default:
-        break;
+    if (st_foreach_with_replace(tbl, rb_gc_update_set_refs_i, rb_gc_update_set_refs_replace_i, 0)) {
+        rb_raise(rb_eRuntimeError, "hash modified during iteration");
     }
-
-    gc_enter_count(event);
-    if (UNLIKELY(during_gc != 0)) rb_bug("during_gc != 0");
-    if (RGENGC_CHECK_MODE >= 3 && (dont_gc_val() == 0)) gc_verify_internal_consistency(objspace);
-
-    during_gc = TRUE;
-    RUBY_DEBUG_LOG("%s (%s)",gc_enter_event_cstr(event), gc_current_status(objspace));
-    gc_report(1, objspace, "gc_enter: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(objspace));
-    gc_record(objspace, 0, gc_enter_event_cstr(event));
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_GC_ENTER, 0); /* TODO: which parameter should be passed? */
 }
 
-static inline void
-gc_exit(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev)
+static void
+gc_ref_update_hash(void *objspace, VALUE v)
 {
-    GC_ASSERT(during_gc != 0);
-
-    gc_event_hook(objspace, RUBY_INTERNAL_EVENT_GC_EXIT, 0); /* TODO: which parameter should be passed? */
-    gc_record(objspace, 1, gc_enter_event_cstr(event));
-    RUBY_DEBUG_LOG("%s (%s)", gc_enter_event_cstr(event), gc_current_status(objspace));
-    gc_report(1, objspace, "gc_exit: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(objspace));
-    during_gc = FALSE;
-
-    RB_VM_LOCK_LEAVE_LEV(lock_lev);
+    rb_hash_stlike_foreach_with_replace(v, hash_foreach_replace, hash_replace_ref, (st_data_t)objspace);
 }
 
-#ifndef MEASURE_GC
-#define MEASURE_GC (objspace->flags.measure_gc)
-#endif
-
 static void
-gc_marking_enter(rb_objspace_t *objspace)
+gc_update_values(void *objspace, long n, VALUE *values)
 {
-    GC_ASSERT(during_gc != 0);
-
-    if (MEASURE_GC) {
-        gc_clock_start(&objspace->profile.marking_start_time);
+    for (long i = 0; i < n; i++) {
+        UPDATE_IF_MOVED(objspace, values[i]);
     }
 }
 
-static void
-gc_marking_exit(rb_objspace_t *objspace)
+void
+rb_gc_update_values(long n, VALUE *values)
 {
-    GC_ASSERT(during_gc != 0);
-
-    if (MEASURE_GC) {
-        objspace->profile.marking_time_ns += gc_clock_end(&objspace->profile.marking_start_time);
-    }
+    gc_update_values(rb_gc_get_objspace(), n, values);
 }
 
-static void
-gc_sweeping_enter(rb_objspace_t *objspace)
+static enum rb_id_table_iterator_result
+check_id_table_move(VALUE value, void *data)
 {
-    GC_ASSERT(during_gc != 0);
+    void *objspace = (void *)data;
 
-    if (MEASURE_GC) {
-        gc_clock_start(&objspace->profile.sweeping_start_time);
+    if (gc_object_moved_p_internal(objspace, (VALUE)value)) {
+        return ID_TABLE_REPLACE;
     }
+
+    return ID_TABLE_CONTINUE;
 }
 
-static void
-gc_sweeping_exit(rb_objspace_t *objspace)
+void
+rb_gc_prepare_heap_process_object(VALUE obj)
 {
-    GC_ASSERT(during_gc != 0);
-
-    if (MEASURE_GC) {
-        objspace->profile.sweeping_time_ns += gc_clock_end(&objspace->profile.sweeping_start_time);
+    switch (BUILTIN_TYPE(obj)) {
+      case T_STRING:
+        // Precompute the string coderange. This both save time for when it will be
+        // eventually needed, and avoid mutating heap pages after a potential fork.
+        rb_enc_str_coderange(obj);
+        break;
+      default:
+        break;
     }
 }
 
-static void *
-gc_with_gvl(void *ptr)
+void
+rb_gc_prepare_heap(void)
 {
-    struct objspace_and_reason *oar = (struct objspace_and_reason *)ptr;
-    return (void *)(VALUE)garbage_collect(oar->objspace, oar->reason);
+    rb_gc_impl_prepare_heap(rb_gc_get_objspace());
 }
 
-static int
-garbage_collect_with_gvl(rb_objspace_t *objspace, unsigned int reason)
+size_t
+rb_gc_heap_id_for_size(size_t size)
 {
-    if (dont_gc_val()) return TRUE;
-    if (ruby_thread_has_gvl_p()) {
-        return garbage_collect(objspace, reason);
-    }
-    else {
-        if (ruby_native_thread_p()) {
-            struct objspace_and_reason oar;
-            oar.objspace = objspace;
-            oar.reason = reason;
-            return (int)(VALUE)rb_thread_call_with_gvl(gc_with_gvl, (void *)&oar);
-        }
-        else {
-            /* no ruby thread */
-            fprintf(stderr, "[FATAL] failed to allocate memory\n");
-            exit(EXIT_FAILURE);
-        }
-    }
+    return rb_gc_impl_heap_id_for_size(rb_gc_get_objspace(), size);
 }
 
-static int
-gc_set_candidate_object_i(void *vstart, void *vend, size_t stride, void *data)
+bool
+rb_gc_size_allocatable_p(size_t size)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE v = (VALUE)vstart;
-    for (; v != (VALUE)vend; v += stride) {
-        asan_unpoisoning_object(v) {
-            switch (BUILTIN_TYPE(v)) {
-              case T_NONE:
-              case T_ZOMBIE:
-                break;
-              case T_STRING:
-                // precompute the string coderange. This both save time for when it will be
-                // eventually needed, and avoid mutating heap pages after a potential fork.
-                rb_enc_str_coderange(v);
-                // fall through
-              default:
-                if (!RVALUE_OLD_P(v) && !RVALUE_WB_UNPROTECTED(v)) {
-                    RVALUE_AGE_SET_CANDIDATE(objspace, v);
-                }
-            }
-        }
-    }
-
-    return 0;
+    return rb_gc_impl_size_allocatable_p(size);
 }
 
-static VALUE
-gc_start_internal(rb_execution_context_t *ec, VALUE self, VALUE full_mark, VALUE immediate_mark, VALUE immediate_sweep, VALUE compact)
+static enum rb_id_table_iterator_result
+update_id_table(VALUE *value, void *data, int existing)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    unsigned int reason = (GPR_FLAG_FULL_MARK |
-                           GPR_FLAG_IMMEDIATE_MARK |
-                           GPR_FLAG_IMMEDIATE_SWEEP |
-                           GPR_FLAG_METHOD);
-
-    /* For now, compact implies full mark / sweep, so ignore other flags */
-    if (RTEST(compact)) {
-        GC_ASSERT(GC_COMPACTION_SUPPORTED);
+    void *objspace = (void *)data;
 
-        reason |= GPR_FLAG_COMPACT;
-    }
-    else {
-        if (!RTEST(full_mark))       reason &= ~GPR_FLAG_FULL_MARK;
-        if (!RTEST(immediate_mark))  reason &= ~GPR_FLAG_IMMEDIATE_MARK;
-        if (!RTEST(immediate_sweep)) reason &= ~GPR_FLAG_IMMEDIATE_SWEEP;
+    if (gc_object_moved_p_internal(objspace, (VALUE)*value)) {
+        *value = gc_location_internal(objspace, (VALUE)*value);
     }
 
-    garbage_collect(objspace, reason);
-    gc_finalize_deferred(objspace);
-
-    return Qnil;
+    return ID_TABLE_CONTINUE;
 }
 
 static void
-free_empty_pages(void)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        /* Move all empty pages to the tomb heap for freeing. */
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-        rb_heap_t *tomb_heap = SIZE_POOL_TOMB_HEAP(size_pool);
-
-        size_t freed_pages = 0;
-
-        struct heap_page **next_page_ptr = &heap->free_pages;
-        struct heap_page *page = heap->free_pages;
-        while (page) {
-            /* All finalizers should have been ran in gc_start_internal, so there
-            * should be no objects that require finalization. */
-            GC_ASSERT(page->final_slots == 0);
-
-            struct heap_page *next_page = page->free_next;
-
-            if (page->free_slots == page->total_slots) {
-                heap_unlink_page(objspace, heap, page);
-                heap_add_page(objspace, size_pool, tomb_heap, page);
-                freed_pages++;
-            }
-            else {
-                *next_page_ptr = page;
-                next_page_ptr = &page->free_next;
-            }
-
-            page = next_page;
-        }
-
-        *next_page_ptr = NULL;
-
-        size_pool_allocatable_pages_set(objspace, size_pool, size_pool->allocatable_pages + freed_pages);
-    }
-
-    heap_pages_free_unused_pages(objspace);
-}
-
-void
-rb_gc_prepare_heap(void)
+update_m_tbl(void *objspace, struct rb_id_table *tbl)
 {
-    rb_objspace_each_objects(gc_set_candidate_object_i, NULL);
-    gc_start_internal(NULL, Qtrue, Qtrue, Qtrue, Qtrue, Qtrue);
-    free_empty_pages();
-
-#if defined(HAVE_MALLOC_TRIM) && !defined(RUBY_ALTERNATIVE_MALLOC_HEADER)
-    malloc_trim(0);
-#endif
-}
-
-static int
-gc_is_moveable_obj(rb_objspace_t *objspace, VALUE obj)
-{
-    GC_ASSERT(!SPECIAL_CONST_P(obj));
-
-    switch (BUILTIN_TYPE(obj)) {
-      case T_NONE:
-      case T_MOVED:
-      case T_ZOMBIE:
-        return FALSE;
-      case T_SYMBOL:
-        if (RSYMBOL(obj)->id & ~ID_SCOPE_MASK) {
-            return FALSE;
-        }
-        /* fall through */
-      case T_STRING:
-      case T_OBJECT:
-      case T_FLOAT:
-      case T_IMEMO:
-      case T_ARRAY:
-      case T_BIGNUM:
-      case T_ICLASS:
-      case T_MODULE:
-      case T_REGEXP:
-      case T_DATA:
-      case T_MATCH:
-      case T_STRUCT:
-      case T_HASH:
-      case T_FILE:
-      case T_COMPLEX:
-      case T_RATIONAL:
-      case T_NODE:
-      case T_CLASS:
-        if (FL_TEST(obj, FL_FINALIZE)) {
-            /* The finalizer table is a numtable. It looks up objects by address.
-             * We can't mark the keys in the finalizer table because that would
-             * prevent the objects from being collected.  This check prevents
-             * objects that are keys in the finalizer table from being moved
-             * without directly pinning them. */
-            GC_ASSERT(st_is_member(finalizer_table, obj));
-
-            return FALSE;
-        }
-        GC_ASSERT(RVALUE_MARKED(obj));
-        GC_ASSERT(!RVALUE_PINNED(obj));
-
-        return TRUE;
-
-      default:
-        rb_bug("gc_is_moveable_obj: unreachable (%d)", (int)BUILTIN_TYPE(obj));
-        break;
+    if (tbl) {
+        rb_id_table_foreach_values_with_replace(tbl, check_id_table_move, update_id_table, objspace);
     }
-
-    return FALSE;
 }
 
-static VALUE
-gc_move(rb_objspace_t *objspace, VALUE scan, VALUE free, size_t src_slot_size, size_t slot_size)
+static enum rb_id_table_iterator_result
+update_const_tbl_i(VALUE value, void *objspace)
 {
-    int marked;
-    int wb_unprotected;
-    int uncollectible;
-    int age;
-    RVALUE *dest = (RVALUE *)free;
-    RVALUE *src = (RVALUE *)scan;
-
-    gc_report(4, objspace, "Moving object: %p -> %p\n", (void*)scan, (void *)free);
-
-    GC_ASSERT(BUILTIN_TYPE(scan) != T_NONE);
-    GC_ASSERT(!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(free), free));
-
-    GC_ASSERT(!RVALUE_MARKING((VALUE)src));
-
-    /* Save off bits for current object. */
-    marked = RVALUE_MARKED((VALUE)src);
-    wb_unprotected = RVALUE_WB_UNPROTECTED((VALUE)src);
-    uncollectible = RVALUE_UNCOLLECTIBLE((VALUE)src);
-    bool remembered = RVALUE_REMEMBERED((VALUE)src);
-    age = RVALUE_AGE_GET((VALUE)src);
-
-    /* Clear bits for eventual T_MOVED */
-    CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS((VALUE)src), (VALUE)src);
-    CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS((VALUE)src), (VALUE)src);
-    CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS((VALUE)src), (VALUE)src);
-    CLEAR_IN_BITMAP(GET_HEAP_PAGE((VALUE)src)->remembered_bits, (VALUE)src);
-
-    if (FL_TEST((VALUE)src, FL_EXIVAR)) {
-        /* Resizing the st table could cause a malloc */
-        DURING_GC_COULD_MALLOC_REGION_START();
-        {
-            rb_mv_generic_ivar((VALUE)src, (VALUE)dest);
-        }
-        DURING_GC_COULD_MALLOC_REGION_END();
-    }
-
-    if (FL_TEST((VALUE)src, FL_SEEN_OBJ_ID)) {
-        /* If the source object's object_id has been seen, we need to update
-         * the object to object id mapping. */
-        st_data_t srcid = (st_data_t)src, id;
-
-        gc_report(4, objspace, "Moving object with seen id: %p -> %p\n", (void *)src, (void *)dest);
-        /* Resizing the st table could cause a malloc */
-        DURING_GC_COULD_MALLOC_REGION_START();
-        {
-            if (!st_delete(objspace->obj_to_id_tbl, &srcid, &id)) {
-                rb_bug("gc_move: object ID seen, but not in mapping table: %s", obj_info((VALUE)src));
-            }
-
-            st_insert(objspace->obj_to_id_tbl, (st_data_t)dest, id);
-        }
-        DURING_GC_COULD_MALLOC_REGION_END();
-    }
-    else {
-        GC_ASSERT(!st_lookup(objspace->obj_to_id_tbl, (st_data_t)src, NULL));
-    }
-
-    /* Move the object */
-    memcpy(dest, src, MIN(src_slot_size, slot_size));
-
-    if (RVALUE_OVERHEAD > 0) {
-        void *dest_overhead = (void *)(((uintptr_t)dest) + slot_size - RVALUE_OVERHEAD);
-        void *src_overhead = (void *)(((uintptr_t)src) + src_slot_size - RVALUE_OVERHEAD);
-
-        memcpy(dest_overhead, src_overhead, RVALUE_OVERHEAD);
-    }
-
-    memset(src, 0, src_slot_size);
-    RVALUE_AGE_RESET((VALUE)src);
-
-    /* Set bits for object in new location */
-    if (remembered) {
-        MARK_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, (VALUE)dest);
-    }
-    else {
-        CLEAR_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, (VALUE)dest);
-    }
-
-    if (marked) {
-        MARK_IN_BITMAP(GET_HEAP_MARK_BITS((VALUE)dest), (VALUE)dest);
-    }
-    else {
-        CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS((VALUE)dest), (VALUE)dest);
-    }
+    rb_const_entry_t *ce = (rb_const_entry_t *)value;
 
-    if (wb_unprotected) {
-        MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS((VALUE)dest), (VALUE)dest);
-    }
-    else {
-        CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS((VALUE)dest), (VALUE)dest);
+    if (gc_object_moved_p_internal(objspace, ce->value)) {
+        ce->value = gc_location_internal(objspace, ce->value);
     }
 
-    if (uncollectible) {
-        MARK_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS((VALUE)dest), (VALUE)dest);
-    }
-    else {
-        CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS((VALUE)dest), (VALUE)dest);
+    if (gc_object_moved_p_internal(objspace, ce->file)) {
+        ce->file = gc_location_internal(objspace, ce->file);
     }
 
-    RVALUE_AGE_SET((VALUE)dest, age);
-    /* Assign forwarding address */
-    src->as.moved.flags = T_MOVED;
-    src->as.moved.dummy = Qundef;
-    src->as.moved.destination = (VALUE)dest;
-    GC_ASSERT(BUILTIN_TYPE((VALUE)dest) != T_NONE);
-
-    return (VALUE)src;
-}
-
-#if GC_CAN_COMPILE_COMPACTION
-static int
-compare_pinned_slots(const void *left, const void *right, void *dummy)
-{
-    struct heap_page *left_page;
-    struct heap_page *right_page;
-
-    left_page = *(struct heap_page * const *)left;
-    right_page = *(struct heap_page * const *)right;
-
-    return left_page->pinned_slots - right_page->pinned_slots;
+    return ID_TABLE_CONTINUE;
 }
 
-static int
-compare_free_slots(const void *left, const void *right, void *dummy)
+static void
+update_const_tbl(void *objspace, struct rb_id_table *tbl)
 {
-    struct heap_page *left_page;
-    struct heap_page *right_page;
-
-    left_page = *(struct heap_page * const *)left;
-    right_page = *(struct heap_page * const *)right;
-
-    return left_page->free_slots - right_page->free_slots;
+    if (!tbl) return;
+    rb_id_table_foreach_values(tbl, update_const_tbl_i, objspace);
 }
 
 static void
-gc_sort_heap_by_compare_func(rb_objspace_t *objspace, gc_compact_compare_func compare_func)
+update_superclasses(rb_objspace_t *objspace, rb_classext_t *ext)
 {
-    for (int j = 0; j < SIZE_POOL_COUNT; j++) {
-        rb_size_pool_t *size_pool = &size_pools[j];
-
-        size_t total_pages = SIZE_POOL_EDEN_HEAP(size_pool)->total_pages;
-        size_t size = size_mul_or_raise(total_pages, sizeof(struct heap_page *), rb_eRuntimeError);
-        struct heap_page *page = 0, **page_list = malloc(size);
-        size_t i = 0;
-
-        SIZE_POOL_EDEN_HEAP(size_pool)->free_pages = NULL;
-        ccan_list_for_each(&SIZE_POOL_EDEN_HEAP(size_pool)->pages, page, page_node) {
-            page_list[i++] = page;
-            GC_ASSERT(page);
+    if (RCLASSEXT_SUPERCLASSES_WITH_SELF(ext)) {
+        size_t array_size = RCLASSEXT_SUPERCLASS_DEPTH(ext) + 1;
+        for (size_t i = 0; i < array_size; i++) {
+            UPDATE_IF_MOVED(objspace, RCLASSEXT_SUPERCLASSES(ext)[i]);
         }
-
-        GC_ASSERT((size_t)i == total_pages);
-
-        /* Sort the heap so "filled pages" are first. `heap_add_page` adds to the
-         * head of the list, so empty pages will end up at the start of the heap */
-        ruby_qsort(page_list, total_pages, sizeof(struct heap_page *), compare_func, NULL);
-
-        /* Reset the eden heap */
-        ccan_list_head_init(&SIZE_POOL_EDEN_HEAP(size_pool)->pages);
-
-        for (i = 0; i < total_pages; i++) {
-            ccan_list_add(&SIZE_POOL_EDEN_HEAP(size_pool)->pages, &page_list[i]->page_node);
-            if (page_list[i]->free_slots != 0) {
-                heap_add_freepage(SIZE_POOL_EDEN_HEAP(size_pool), page_list[i]);
-            }
-        }
-
-        free(page_list);
     }
 }
-#endif
 
 static void
-gc_ref_update_array(rb_objspace_t * objspace, VALUE v)
+update_classext_values(rb_objspace_t *objspace, rb_classext_t *ext, bool is_iclass)
 {
-    if (ARY_SHARED_P(v)) {
-        VALUE old_root = RARRAY(v)->as.heap.aux.shared_root;
-
-        UPDATE_IF_MOVED(objspace, RARRAY(v)->as.heap.aux.shared_root);
-
-        VALUE new_root = RARRAY(v)->as.heap.aux.shared_root;
-        // If the root is embedded and its location has changed
-        if (ARY_EMBED_P(new_root) && new_root != old_root) {
-            size_t offset = (size_t)(RARRAY(v)->as.heap.ptr - RARRAY(old_root)->as.ary);
-            GC_ASSERT(RARRAY(v)->as.heap.ptr >= RARRAY(old_root)->as.ary);
-            RARRAY(v)->as.heap.ptr = RARRAY(new_root)->as.ary + offset;
-        }
-    }
-    else {
-        long len = RARRAY_LEN(v);
-
-        if (len > 0) {
-            VALUE *ptr = (VALUE *)RARRAY_CONST_PTR(v);
-            for (long i = 0; i < len; i++) {
-                UPDATE_IF_MOVED(objspace, ptr[i]);
-            }
-        }
-
-        if (rb_gc_obj_slot_size(v) >= rb_ary_size_as_embedded(v)) {
-            if (rb_ary_embeddable_p(v)) {
-                rb_ary_make_embedded(v);
-            }
-        }
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_ORIGIN(ext));
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_REFINED_CLASS(ext));
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_CLASSPATH(ext));
+    if (is_iclass) {
+        UPDATE_IF_MOVED(objspace, RCLASSEXT_INCLUDER(ext));
     }
 }
 
-static void gc_ref_update_table_values_only(rb_objspace_t *objspace, st_table *tbl);
-
 static void
-gc_ref_update_object(rb_objspace_t *objspace, VALUE v)
+update_classext(rb_classext_t *ext, bool is_prime, VALUE box_value, void *arg)
 {
-    VALUE *ptr = ROBJECT_IVPTR(v);
+    struct classext_foreach_args *args = (struct classext_foreach_args *)arg;
+    rb_objspace_t *objspace = args->objspace;
 
-    if (rb_shape_obj_too_complex(v)) {
-        gc_ref_update_table_values_only(objspace, ROBJECT_IV_HASH(v));
-        return;
+    if (RCLASSEXT_SUPER(ext)) {
+        UPDATE_IF_MOVED(objspace, RCLASSEXT_SUPER(ext));
     }
 
-    size_t slot_size = rb_gc_obj_slot_size(v);
-    size_t embed_size = rb_obj_embedded_size(ROBJECT_IV_CAPACITY(v));
-    if (slot_size >= embed_size && !RB_FL_TEST_RAW(v, ROBJECT_EMBED)) {
-        // Object can be re-embedded
-        memcpy(ROBJECT(v)->as.ary, ptr, sizeof(VALUE) * ROBJECT_IV_COUNT(v));
-        RB_FL_SET_RAW(v, ROBJECT_EMBED);
-        xfree(ptr);
-        ptr = ROBJECT(v)->as.ary;
-    }
+    update_m_tbl(objspace, RCLASSEXT_M_TBL(ext));
 
-    for (uint32_t i = 0; i < ROBJECT_IV_COUNT(v); i++) {
-        UPDATE_IF_MOVED(objspace, ptr[i]);
+    UPDATE_IF_MOVED(objspace, ext->fields_obj);
+    if (!RCLASSEXT_SHARED_CONST_TBL(ext)) {
+        update_const_tbl(objspace, RCLASSEXT_CONST_TBL(ext));
     }
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_CC_TBL(ext));
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_CVC_TBL(ext));
+    update_superclasses(objspace, ext);
+    if (RCLASSEXT_SUBCLASSES(ext)) {
+        UPDATE_IF_MOVED(objspace, RCLASSEXT_SUBCLASSES(ext));
+    }
+
+    update_classext_values(objspace, ext, false);
 }
 
-static int
-hash_replace_ref(st_data_t *key, st_data_t *value, st_data_t argp, int existing)
+static void
+update_iclass_classext(rb_classext_t *ext, bool is_prime, VALUE box_value, void *arg)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)argp;
+    struct classext_foreach_args *args = (struct classext_foreach_args *)arg;
+    rb_objspace_t *objspace = args->objspace;
 
-    if (gc_object_moved_p(objspace, (VALUE)*key)) {
-        *key = rb_gc_location((VALUE)*key);
+    if (RCLASSEXT_SUPER(ext)) {
+        UPDATE_IF_MOVED(objspace, RCLASSEXT_SUPER(ext));
     }
-
-    if (gc_object_moved_p(objspace, (VALUE)*value)) {
-        *value = rb_gc_location((VALUE)*value);
+    update_m_tbl(objspace, RCLASSEXT_M_TBL(ext));
+    update_m_tbl(objspace, RCLASSEXT_CALLABLE_M_TBL(ext));
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_CC_TBL(ext));
+    UPDATE_IF_MOVED(objspace, RCLASSEXT_CVC_TBL(ext));
+    if (RCLASSEXT_SUBCLASSES(ext)) {
+        UPDATE_IF_MOVED(objspace, RCLASSEXT_SUBCLASSES(ext));
     }
 
-    return ST_CONTINUE;
+    update_classext_values(objspace, ext, true);
 }
 
+struct global_vm_table_foreach_data {
+    vm_table_foreach_callback_func callback;
+    vm_table_update_callback_func update_callback;
+    void *data;
+    bool weak_only;
+};
+
 static int
-hash_foreach_replace(st_data_t key, st_data_t value, st_data_t argp, int error)
+vm_weak_table_foreach_weak_key(st_data_t key, st_data_t value, st_data_t data, int error)
 {
-    rb_objspace_t *objspace;
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-    objspace = (rb_objspace_t *)argp;
+    int ret = iter_data->callback((VALUE)key, iter_data->data);
 
-    if (gc_object_moved_p(objspace, (VALUE)key)) {
-        return ST_REPLACE;
-    }
+    if (!iter_data->weak_only) {
+        if (ret != ST_CONTINUE) return ret;
 
-    if (gc_object_moved_p(objspace, (VALUE)value)) {
-        return ST_REPLACE;
+        ret = iter_data->callback((VALUE)value, iter_data->data);
     }
-    return ST_CONTINUE;
+
+    return ret;
 }
 
 static int
-hash_replace_ref_value(st_data_t *key, st_data_t *value, st_data_t argp, int existing)
+vm_weak_table_foreach_update_weak_key(st_data_t *key, st_data_t *value, st_data_t data, int existing)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)argp;
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-    if (gc_object_moved_p(objspace, (VALUE)*value)) {
-        *value = rb_gc_location((VALUE)*value);
+    int ret = iter_data->update_callback((VALUE *)key, iter_data->data);
+
+    if (!iter_data->weak_only) {
+        if (ret != ST_CONTINUE) return ret;
+
+        ret = iter_data->update_callback((VALUE *)value, iter_data->data);
     }
 
-    return ST_CONTINUE;
+    return ret;
 }
 
 static int
-hash_foreach_replace_value(st_data_t key, st_data_t value, st_data_t argp, int error)
+vm_weak_table_sym_set_foreach(VALUE *sym_ptr, void *data)
 {
-    rb_objspace_t *objspace;
+    VALUE sym = *sym_ptr;
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-    objspace = (rb_objspace_t *)argp;
+    if (RB_SPECIAL_CONST_P(sym)) return ST_CONTINUE;
 
-    if (gc_object_moved_p(objspace, (VALUE)value)) {
-        return ST_REPLACE;
-    }
-    return ST_CONTINUE;
-}
+    int ret = iter_data->callback(sym, iter_data->data);
 
-static void
-gc_ref_update_table_values_only(rb_objspace_t *objspace, st_table *tbl)
-{
-    if (!tbl || tbl->num_entries == 0) return;
-
-    if (st_foreach_with_replace(tbl, hash_foreach_replace_value, hash_replace_ref_value, (st_data_t)objspace)) {
-        rb_raise(rb_eRuntimeError, "hash modified during iteration");
+    if (ret == ST_REPLACE) {
+        ret = iter_data->update_callback(sym_ptr, iter_data->data);
     }
-}
 
-void
-rb_gc_ref_update_table_values_only(st_table *tbl)
-{
-    gc_ref_update_table_values_only(&rb_objspace, tbl);
+    return ret;
 }
 
-static void
-gc_update_table_refs(rb_objspace_t * objspace, st_table *tbl)
+struct st_table *rb_generic_fields_tbl_get(void);
+
+static int
+vm_weak_table_id2ref_foreach(st_data_t key, st_data_t value, st_data_t data, int error)
 {
-    if (!tbl || tbl->num_entries == 0) return;
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-    if (st_foreach_with_replace(tbl, hash_foreach_replace, hash_replace_ref, (st_data_t)objspace)) {
-        rb_raise(rb_eRuntimeError, "hash modified during iteration");
+    if (!iter_data->weak_only && !FIXNUM_P((VALUE)key)) {
+        int ret = iter_data->callback((VALUE)key, iter_data->data);
+        if (ret != ST_CONTINUE) return ret;
     }
-}
 
-/* Update MOVED references in a VALUE=>VALUE st_table */
-void
-rb_gc_update_tbl_refs(st_table *ptr)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    gc_update_table_refs(objspace, ptr);
+    return iter_data->callback((VALUE)value, iter_data->data);
 }
 
-static void
-gc_ref_update_hash(rb_objspace_t * objspace, VALUE v)
+static int
+vm_weak_table_id2ref_foreach_update(st_data_t *key, st_data_t *value, st_data_t data, int existing)
 {
-    rb_hash_stlike_foreach_with_replace(v, hash_foreach_replace, hash_replace_ref, (st_data_t)objspace);
-}
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-static void
-gc_update_values(rb_objspace_t *objspace, long n, VALUE *values)
-{
-    long i;
+    iter_data->update_callback((VALUE *)value, iter_data->data);
 
-    for (i=0; i<n; i++) {
-        UPDATE_IF_MOVED(objspace, values[i]);
+    if (!iter_data->weak_only && !FIXNUM_P((VALUE)*key)) {
+        iter_data->update_callback((VALUE *)key, iter_data->data);
     }
-}
 
-void
-rb_gc_update_values(long n, VALUE *values)
-{
-    gc_update_values(&rb_objspace, n, values);
+    return ST_CONTINUE;
 }
 
-static enum rb_id_table_iterator_result
-check_id_table_move(VALUE value, void *data)
+static int
+vm_weak_table_gen_fields_foreach(st_data_t key, st_data_t value, st_data_t data)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-
-    if (gc_object_moved_p(objspace, (VALUE)value)) {
-        return ID_TABLE_REPLACE;
-    }
-
-    return ID_TABLE_CONTINUE;
-}
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
 
-/* Returns the new location of an object, if it moved.  Otherwise returns
- * the existing location. */
-VALUE
-rb_gc_location(VALUE value)
-{
+    int ret = iter_data->callback((VALUE)key, iter_data->data);
 
-    VALUE destination;
+    VALUE new_value = (VALUE)value;
+    VALUE new_key = (VALUE)key;
 
-    if (!SPECIAL_CONST_P(value)) {
-        void *poisoned = asan_unpoison_object_temporary(value);
+    switch (ret) {
+      case ST_CONTINUE:
+        break;
 
-        if (BUILTIN_TYPE(value) == T_MOVED) {
-            destination = (VALUE)RMOVED(value)->destination;
-            GC_ASSERT(BUILTIN_TYPE(destination) != T_NONE);
-        }
-        else {
-            destination = value;
-        }
+      case ST_DELETE:
+        // When we're removing an object from the weak ref table, we need to
+        // set the shape on it so that the GC finalizer won't try to remove
+        // it again.  A "root shape" indicates to the GC that this object
+        // has no fields on it, hence it won't be in the gen fields table.
+        RBASIC_SET_SHAPE_ID((VALUE)key, ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_OTHER);
+        return ST_DELETE;
 
-        /* Re-poison slot if it's not the one we want */
-        if (poisoned) {
-            GC_ASSERT(BUILTIN_TYPE(value) == T_NONE);
-            asan_poison_object(value);
+      case ST_REPLACE: {
+        ret = iter_data->update_callback(&new_key, iter_data->data);
+        if (key != new_key) {
+            ret = ST_DELETE;
         }
-    }
-    else {
-        destination = value;
-    }
-
-    return destination;
-}
-
-static enum rb_id_table_iterator_result
-update_id_table(VALUE *value, void *data, int existing)
-{
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
+        break;
+      }
 
-    if (gc_object_moved_p(objspace, (VALUE)*value)) {
-        *value = rb_gc_location((VALUE)*value);
+      default:
+        rb_bug("vm_weak_table_gen_fields_foreach: return value %d not supported", ret);
     }
 
-    return ID_TABLE_CONTINUE;
-}
-
-static void
-update_m_tbl(rb_objspace_t *objspace, struct rb_id_table *tbl)
-{
-    if (tbl) {
-        rb_id_table_foreach_values_with_replace(tbl, check_id_table_move, update_id_table, objspace);
-    }
-}
+    if (!iter_data->weak_only) {
+        int ivar_ret = iter_data->callback(new_value, iter_data->data);
+        switch (ivar_ret) {
+          case ST_CONTINUE:
+            break;
 
-static enum rb_id_table_iterator_result
-update_cc_tbl_i(VALUE ccs_ptr, void *data)
-{
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    struct rb_class_cc_entries *ccs = (struct rb_class_cc_entries *)ccs_ptr;
-    VM_ASSERT(vm_ccs_p(ccs));
+          case ST_REPLACE:
+            iter_data->update_callback(&new_value, iter_data->data);
+            break;
 
-    if (gc_object_moved_p(objspace, (VALUE)ccs->cme)) {
-        ccs->cme = (const rb_callable_method_entry_t *)rb_gc_location((VALUE)ccs->cme);
+          default:
+            rb_bug("vm_weak_table_gen_fields_foreach: return value %d not supported", ivar_ret);
+        }
     }
 
-    for (int i=0; i<ccs->len; i++) {
-        if (gc_object_moved_p(objspace, (VALUE)ccs->entries[i].cc)) {
-            ccs->entries[i].cc = (struct rb_callcache *)rb_gc_location((VALUE)ccs->entries[i].cc);
+    if (key != new_key || value != new_value) {
+        DURING_GC_COULD_MALLOC_REGION_START();
+        {
+            st_insert(rb_generic_fields_tbl_get(), (st_data_t)new_key, new_value);
         }
+        DURING_GC_COULD_MALLOC_REGION_END();
     }
 
-    // do not replace
-    return ID_TABLE_CONTINUE;
-}
-
-static void
-update_cc_tbl(rb_objspace_t *objspace, VALUE klass)
-{
-    struct rb_id_table *tbl = RCLASS_CC_TBL(klass);
-    if (tbl) {
-        rb_id_table_foreach_values(tbl, update_cc_tbl_i, objspace);
-    }
+    return ret;
 }
 
-static enum rb_id_table_iterator_result
-update_cvc_tbl_i(VALUE cvc_entry, void *data)
+static int
+vm_weak_table_frozen_strings_foreach(VALUE *str, void *data)
 {
-    struct rb_cvar_class_tbl_entry *entry;
-    rb_objspace_t * objspace = (rb_objspace_t *)data;
-
-    entry = (struct rb_cvar_class_tbl_entry *)cvc_entry;
+    // int retval = vm_weak_table_foreach_weak_key(key, value, data, error);
+    struct global_vm_table_foreach_data *iter_data = (struct global_vm_table_foreach_data *)data;
+    int retval = iter_data->callback(*str, iter_data->data);
 
-    if (entry->cref) {
-        TYPED_UPDATE_IF_MOVED(objspace, rb_cref_t *, entry->cref);
+    if (retval == ST_REPLACE) {
+        retval = iter_data->update_callback(str, iter_data->data);
     }
 
-    entry->class_value = rb_gc_location(entry->class_value);
-
-    return ID_TABLE_CONTINUE;
-}
-
-static void
-update_cvc_tbl(rb_objspace_t *objspace, VALUE klass)
-{
-    struct rb_id_table *tbl = RCLASS_CVC_TBL(klass);
-    if (tbl) {
-        rb_id_table_foreach_values(tbl, update_cvc_tbl_i, objspace);
+    if (retval == ST_DELETE) {
+        FL_UNSET(*str, RSTRING_FSTR);
     }
+
+    return retval;
 }
 
-static enum rb_id_table_iterator_result
-mark_cvc_tbl_i(VALUE cvc_entry, void *data)
+void rb_fstring_foreach_with_replace(int (*callback)(VALUE *str, void *data), void *data);
+void
+rb_gc_vm_weak_table_foreach(vm_table_foreach_callback_func callback,
+                            vm_table_update_callback_func update_callback,
+                            void *data,
+                            bool weak_only,
+                            enum rb_gc_vm_weak_tables table)
 {
-    rb_objspace_t *objspace = (rb_objspace_t *)data;
-    struct rb_cvar_class_tbl_entry *entry;
-
-    entry = (struct rb_cvar_class_tbl_entry *)cvc_entry;
-
-    RUBY_ASSERT(entry->cref == 0 || (BUILTIN_TYPE((VALUE)entry->cref) == T_IMEMO && IMEMO_TYPE_P(entry->cref, imemo_cref)));
-    gc_mark(objspace, (VALUE) entry->cref);
+    rb_vm_t *vm = GET_VM();
 
-    return ID_TABLE_CONTINUE;
-}
+    struct global_vm_table_foreach_data foreach_data = {
+        .callback = callback,
+        .update_callback = update_callback,
+        .data = data,
+        .weak_only = weak_only,
+    };
 
-static void
-mark_cvc_tbl(rb_objspace_t *objspace, VALUE klass)
-{
-    struct rb_id_table *tbl = RCLASS_CVC_TBL(klass);
-    if (tbl) {
-        rb_id_table_foreach_values(tbl, mark_cvc_tbl_i, objspace);
+    switch (table) {
+      case RB_GC_VM_CI_TABLE: {
+        st_foreach_with_replace(
+            &vm->ci_table,
+            vm_weak_table_foreach_weak_key,
+            vm_weak_table_foreach_update_weak_key,
+            (st_data_t)&foreach_data
+        );
+        break;
+      }
+      case RB_GC_VM_OVERLOADED_CME_TABLE: {
+        st_foreach_with_replace(
+            &vm->overloaded_cme_table,
+            vm_weak_table_foreach_weak_key,
+            vm_weak_table_foreach_update_weak_key,
+            (st_data_t)&foreach_data
+        );
+        break;
+      }
+      case RB_GC_VM_GLOBAL_SYMBOLS_TABLE: {
+        rb_sym_global_symbol_table_foreach_weak_reference(
+            vm_weak_table_sym_set_foreach,
+            &foreach_data
+        );
+        break;
+      }
+      case RB_GC_VM_ID2REF_TABLE: {
+        if (id2ref_tbl) {
+            st_foreach_with_replace(
+                id2ref_tbl,
+                vm_weak_table_id2ref_foreach,
+                vm_weak_table_id2ref_foreach_update,
+                (st_data_t)&foreach_data
+            );
+        }
+        break;
+      }
+      case RB_GC_VM_GENERIC_FIELDS_TABLE: {
+        st_table *generic_fields_tbl = rb_generic_fields_tbl_get();
+        if (generic_fields_tbl) {
+            st_foreach(
+                generic_fields_tbl,
+                vm_weak_table_gen_fields_foreach,
+                (st_data_t)&foreach_data
+            );
+        }
+        break;
+      }
+      case RB_GC_VM_FROZEN_STRINGS_TABLE: {
+        rb_fstring_foreach_with_replace(
+            vm_weak_table_frozen_strings_foreach,
+            &foreach_data
+        );
+        break;
+      }
+      case RB_GC_VM_WEAK_TABLE_COUNT:
+        rb_bug("Unreachable");
+      default:
+        rb_bug("rb_gc_vm_weak_table_foreach: unknown table %d", table);
     }
 }
 
-static enum rb_id_table_iterator_result
-update_const_table(VALUE value, void *data)
+void
+rb_gc_update_vm_references(void *objspace)
 {
-    rb_const_entry_t *ce = (rb_const_entry_t *)value;
-    rb_objspace_t * objspace = (rb_objspace_t *)data;
-
-    if (gc_object_moved_p(objspace, ce->value)) {
-        ce->value = rb_gc_location(ce->value);
-    }
-
-    if (gc_object_moved_p(objspace, ce->file)) {
-        ce->file = rb_gc_location(ce->file);
-    }
+    rb_execution_context_t *ec = GET_EC();
+    rb_vm_t *vm = rb_ec_vm_ptr(ec);
 
-    return ID_TABLE_CONTINUE;
-}
+    rb_vm_update_references(vm);
+    rb_gc_update_global_tbl();
+    rb_sym_global_symbols_mark_and_move();
 
-static void
-update_const_tbl(rb_objspace_t *objspace, struct rb_id_table *tbl)
-{
-    if (!tbl) return;
-    rb_id_table_foreach_values(tbl, update_const_table, objspace);
-}
+#if USE_YJIT
+    void rb_yjit_root_update_references(void); // in Rust
 
-static void
-update_subclass_entries(rb_objspace_t *objspace, rb_subclass_entry_t *entry)
-{
-    while (entry) {
-        UPDATE_IF_MOVED(objspace, entry->klass);
-        entry = entry->next;
+    if (rb_yjit_enabled_p) {
+        rb_yjit_root_update_references();
     }
-}
+#endif
 
-static void
-update_class_ext(rb_objspace_t *objspace, rb_classext_t *ext)
-{
-    UPDATE_IF_MOVED(objspace, ext->origin_);
-    UPDATE_IF_MOVED(objspace, ext->includer);
-    UPDATE_IF_MOVED(objspace, ext->refined_class);
-    update_subclass_entries(objspace, ext->subclasses);
-}
+#if USE_ZJIT
+    void rb_zjit_root_update_references(void); // in Rust
 
-static void
-update_superclasses(rb_objspace_t *objspace, VALUE obj)
-{
-    if (FL_TEST_RAW(obj, RCLASS_SUPERCLASSES_INCLUDE_SELF)) {
-        for (size_t i = 0; i < RCLASS_SUPERCLASS_DEPTH(obj) + 1; i++) {
-            UPDATE_IF_MOVED(objspace, RCLASS_SUPERCLASSES(obj)[i]);
-        }
+    if (rb_zjit_enabled_p) {
+        rb_zjit_root_update_references();
     }
+#endif
 }
 
-static void
-gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
+void
+rb_gc_update_object_references(void *objspace, VALUE obj)
 {
-    RVALUE *any = RANY(obj);
-
-    gc_report(4, objspace, "update-refs: %p ->\n", (void *)obj);
-
-    if (FL_TEST(obj, FL_EXIVAR)) {
-        rb_ref_update_generic_ivar(obj);
-    }
+    struct classext_foreach_args args;
 
     switch (BUILTIN_TYPE(obj)) {
       case T_CLASS:
-        if (FL_TEST(obj, FL_SINGLETON)) {
+        if (FL_TEST_RAW(obj, FL_SINGLETON)) {
             UPDATE_IF_MOVED(objspace, RCLASS_ATTACHED_OBJECT(obj));
         }
         // Continue to the shared T_CLASS/T_MODULE
       case T_MODULE:
-        if (RCLASS_SUPER((VALUE)obj)) {
-            UPDATE_IF_MOVED(objspace, RCLASS(obj)->super);
-        }
-        update_m_tbl(objspace, RCLASS_M_TBL(obj));
-        update_cc_tbl(objspace, obj);
-        update_cvc_tbl(objspace, obj);
-        update_superclasses(objspace, obj);
-
-        if (rb_shape_obj_too_complex(obj)) {
-            gc_ref_update_table_values_only(objspace, RCLASS_IV_HASH(obj));
-        }
-        else {
-            for (attr_index_t i = 0; i < RCLASS_IV_COUNT(obj); i++) {
-                UPDATE_IF_MOVED(objspace, RCLASS_IVPTR(obj)[i]);
-            }
-        }
-
-        update_class_ext(objspace, RCLASS_EXT(obj));
-        update_const_tbl(objspace, RCLASS_CONST_TBL(obj));
-
-        UPDATE_IF_MOVED(objspace, RCLASS_EXT(obj)->classpath);
+        args.klass = obj;
+        args.objspace = objspace;
+        rb_class_classext_foreach(obj, update_classext, (void *)&args);
         break;
 
       case T_ICLASS:
-        if (RICLASS_OWNS_M_TBL_P(obj)) {
-            update_m_tbl(objspace, RCLASS_M_TBL(obj));
-        }
-        if (RCLASS_SUPER((VALUE)obj)) {
-            UPDATE_IF_MOVED(objspace, RCLASS(obj)->super);
-        }
-        update_class_ext(objspace, RCLASS_EXT(obj));
-        update_m_tbl(objspace, RCLASS_CALLABLE_M_TBL(obj));
-        update_cc_tbl(objspace, obj);
+        args.objspace = objspace;
+        rb_class_classext_foreach(obj, update_iclass_classext, (void *)&args);
         break;
 
       case T_IMEMO:
@@ -10148,13 +4406,13 @@ gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
 
       case T_HASH:
         gc_ref_update_hash(objspace, obj);
-        UPDATE_IF_MOVED(objspace, any->as.hash.ifnone);
+        UPDATE_IF_MOVED(objspace, RHASH(obj)->ifnone);
         break;
 
       case T_STRING:
         {
             if (STR_SHARED_P(obj)) {
-                UPDATE_IF_MOVED(objspace, any->as.string.as.heap.aux.shared);
+                UPDATE_IF_MOVED(objspace, RSTRING(obj)->as.heap.aux.shared);
             }
 
             /* If, after move the string is not embedded, and can fit in the
@@ -10170,19 +4428,21 @@ gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
       case T_DATA:
         /* Call the compaction callback, if it exists */
         {
-            void *const ptr = RTYPEDDATA_P(obj) ? RTYPEDDATA_GET_DATA(obj) : DATA_PTR(obj);
+            void *const ptr = RTYPEDDATA_GET_DATA(obj);
+
+            UPDATE_IF_MOVED(objspace, RTYPEDDATA(obj)->fields_obj);
+
             if (ptr) {
-                if (RTYPEDDATA_P(obj) && gc_declarative_marking_p(any->as.typeddata.type)) {
-                    size_t *offset_list = (size_t *)RANY(obj)->as.typeddata.type->function.dmark;
+                if (gc_declarative_marking_p(RTYPEDDATA_TYPE(obj))) {
+                    size_t *offset_list = TYPED_DATA_REFS_OFFSET_LIST(obj);
 
                     for (size_t offset = *offset_list; offset != RUBY_REF_END; offset = *offset_list++) {
                         VALUE *ref = (VALUE *)((char *)ptr + offset);
-                        if (SPECIAL_CONST_P(*ref)) continue;
-                        *ref = rb_gc_location(*ref);
+                        *ref = gc_location_internal(objspace, *ref);
                     }
                 }
-                else if (RTYPEDDATA_P(obj)) {
-                    RUBY_DATA_FUNC compact_func = any->as.typeddata.type->function.dcompact;
+                else {
+                    RUBY_DATA_FUNC compact_func = RTYPEDDATA_TYPE(obj)->function.dcompact;
                     if (compact_func) (*compact_func)(ptr);
                 }
             }
@@ -10194,22 +4454,24 @@ gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
         break;
 
       case T_FILE:
-        if (any->as.file.fptr) {
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->self);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->pathv);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->tied_io_for_writing);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->writeconv_asciicompat);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->writeconv_pre_ecopts);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->encs.ecopts);
-            UPDATE_IF_MOVED(objspace, any->as.file.fptr->write_lock);
+        if (RFILE(obj)->fptr) {
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->self);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->pathv);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->tied_io_for_writing);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->writeconv_asciicompat);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->writeconv_pre_ecopts);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->encs.ecopts);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->write_lock);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->timeout);
+            UPDATE_IF_MOVED(objspace, RFILE(obj)->fptr->wakeup_mutex);
         }
         break;
       case T_REGEXP:
-        UPDATE_IF_MOVED(objspace, any->as.regexp.src);
+        UPDATE_IF_MOVED(objspace, RREGEXP(obj)->src);
         break;
 
       case T_SYMBOL:
-        UPDATE_IF_MOVED(objspace, RSYMBOL(any)->fstr);
+        UPDATE_IF_MOVED(objspace, RSYMBOL(obj)->fstr);
         break;
 
       case T_FLOAT:
@@ -10217,21 +4479,21 @@ gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
         break;
 
       case T_MATCH:
-        UPDATE_IF_MOVED(objspace, any->as.match.regexp);
+        UPDATE_IF_MOVED(objspace, RMATCH(obj)->regexp);
 
-        if (any->as.match.str) {
-            UPDATE_IF_MOVED(objspace, any->as.match.str);
+        if (RMATCH(obj)->str) {
+            UPDATE_IF_MOVED(objspace, RMATCH(obj)->str);
         }
         break;
 
       case T_RATIONAL:
-        UPDATE_IF_MOVED(objspace, any->as.rational.num);
-        UPDATE_IF_MOVED(objspace, any->as.rational.den);
+        UPDATE_IF_MOVED(objspace, RRATIONAL(obj)->num);
+        UPDATE_IF_MOVED(objspace, RRATIONAL(obj)->den);
         break;
 
       case T_COMPLEX:
-        UPDATE_IF_MOVED(objspace, any->as.complex.real);
-        UPDATE_IF_MOVED(objspace, any->as.complex.imag);
+        UPDATE_IF_MOVED(objspace, RCOMPLEX(obj)->real);
+        UPDATE_IF_MOVED(objspace, RCOMPLEX(obj)->imag);
 
         break;
 
@@ -10243,375 +4505,24 @@ gc_update_object_references(rb_objspace_t *objspace, VALUE obj)
             for (i = 0; i < len; i++) {
                 UPDATE_IF_MOVED(objspace, ptr[i]);
             }
-        }
-        break;
-      default:
-#if GC_DEBUG
-        rb_gcdebug_print_obj_condition((VALUE)obj);
-        rb_obj_info_dump(obj);
-        rb_bug("unreachable");
-#endif
-        break;
-
-    }
-
-    UPDATE_IF_MOVED(objspace, RBASIC(obj)->klass);
-
-    gc_report(4, objspace, "update-refs: %p <-\n", (void *)obj);
-}
-
-static int
-gc_ref_update(void *vstart, void *vend, size_t stride, rb_objspace_t * objspace, struct heap_page *page)
-{
-    VALUE v = (VALUE)vstart;
-    asan_unlock_freelist(page);
-    asan_lock_freelist(page);
-    page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
-    page->flags.has_remembered_objects = FALSE;
 
-    /* For each object on the page */
-    for (; v != (VALUE)vend; v += stride) {
-        void *poisoned = asan_unpoison_object_temporary(v);
-
-        switch (BUILTIN_TYPE(v)) {
-          case T_NONE:
-          case T_MOVED:
-          case T_ZOMBIE:
-            break;
-          default:
-            if (RVALUE_WB_UNPROTECTED(v)) {
-                page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
-            }
-            if (RVALUE_REMEMBERED(v)) {
-                page->flags.has_remembered_objects = TRUE;
-            }
-            if (page->flags.before_sweep) {
-                if (RVALUE_MARKED(v)) {
-                    gc_update_object_references(objspace, v);
+            if (RSTRUCT_EMBED_LEN(obj)) {
+                if (!FL_TEST_RAW(obj, RSTRUCT_GEN_FIELDS)) {
+                    UPDATE_IF_MOVED(objspace, ptr[len]);
                 }
             }
             else {
-                gc_update_object_references(objspace, v);
-            }
-        }
-
-        if (poisoned) {
-            asan_poison_object(v);
-        }
-    }
-
-    return 0;
-}
-
-extern rb_symbols_t ruby_global_symbols;
-#define global_symbols ruby_global_symbols
-
-static void
-gc_update_references(rb_objspace_t *objspace)
-{
-    objspace->flags.during_reference_updating = true;
-
-    rb_execution_context_t *ec = GET_EC();
-    rb_vm_t *vm = rb_ec_vm_ptr(ec);
-
-    struct heap_page *page = NULL;
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        bool should_set_mark_bits = TRUE;
-        rb_size_pool_t *size_pool = &size_pools[i];
-        rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-        ccan_list_for_each(&heap->pages, page, page_node) {
-            uintptr_t start = (uintptr_t)page->start;
-            uintptr_t end = start + (page->total_slots * size_pool->slot_size);
-
-            gc_ref_update((void *)start, (void *)end, size_pool->slot_size, objspace, page);
-            if (page == heap->sweeping_page) {
-                should_set_mark_bits = FALSE;
-            }
-            if (should_set_mark_bits) {
-                gc_setup_mark_bits(page);
-            }
-        }
-    }
-    rb_vm_update_references(vm);
-    rb_gc_update_global_tbl();
-    global_symbols.ids = rb_gc_location(global_symbols.ids);
-    global_symbols.dsymbol_fstr_hash = rb_gc_location(global_symbols.dsymbol_fstr_hash);
-    gc_ref_update_table_values_only(objspace, objspace->obj_to_id_tbl);
-    gc_update_table_refs(objspace, objspace->id_to_obj_tbl);
-    gc_update_table_refs(objspace, global_symbols.str_sym);
-    gc_update_table_refs(objspace, finalizer_table);
-
-    objspace->flags.during_reference_updating = false;
-}
-
-#if GC_CAN_COMPILE_COMPACTION
-/*
- *  call-seq:
- *     GC.latest_compact_info -> hash
- *
- * Returns information about object moved in the most recent \GC compaction.
- *
- * The returned +hash+ contains the following keys:
- *
- * [considered]
- *   Hash containing the type of the object as the key and the number of
- *   objects of that type that were considered for movement.
- * [moved]
- *   Hash containing the type of the object as the key and the number of
- *   objects of that type that were actually moved.
- * [moved_up]
- *   Hash containing the type of the object as the key and the number of
- *   objects of that type that were increased in size.
- * [moved_down]
- *   Hash containing the type of the object as the key and the number of
- *   objects of that type that were decreased in size.
- *
- * Some objects can't be moved (due to pinning) so these numbers can be used to
- * calculate compaction efficiency.
- */
-static VALUE
-gc_compact_stats(VALUE self)
-{
-    size_t i;
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE h = rb_hash_new();
-    VALUE considered = rb_hash_new();
-    VALUE moved = rb_hash_new();
-    VALUE moved_up = rb_hash_new();
-    VALUE moved_down = rb_hash_new();
-
-    for (i=0; i<T_MASK; i++) {
-        if (objspace->rcompactor.considered_count_table[i]) {
-            rb_hash_aset(considered, type_sym(i), SIZET2NUM(objspace->rcompactor.considered_count_table[i]));
-        }
-
-        if (objspace->rcompactor.moved_count_table[i]) {
-            rb_hash_aset(moved, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_count_table[i]));
-        }
-
-        if (objspace->rcompactor.moved_up_count_table[i]) {
-            rb_hash_aset(moved_up, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_up_count_table[i]));
-        }
-
-        if (objspace->rcompactor.moved_down_count_table[i]) {
-            rb_hash_aset(moved_down, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_down_count_table[i]));
-        }
-    }
-
-    rb_hash_aset(h, ID2SYM(rb_intern("considered")), considered);
-    rb_hash_aset(h, ID2SYM(rb_intern("moved")), moved);
-    rb_hash_aset(h, ID2SYM(rb_intern("moved_up")), moved_up);
-    rb_hash_aset(h, ID2SYM(rb_intern("moved_down")), moved_down);
-
-    return h;
-}
-#else
-#  define gc_compact_stats rb_f_notimplement
-#endif
-
-#if GC_CAN_COMPILE_COMPACTION
-static void
-root_obj_check_moved_i(const char *category, VALUE obj, void *data)
-{
-    rb_objspace_t *objspace = data;
-
-    if (gc_object_moved_p(objspace, obj)) {
-        rb_bug("ROOT %s points to MOVED: %p -> %s", category, (void *)obj, obj_info(rb_gc_location(obj)));
-    }
-}
-
-static void
-reachable_object_check_moved_i(VALUE ref, void *data)
-{
-    VALUE parent = (VALUE)data;
-    if (gc_object_moved_p(&rb_objspace, ref)) {
-        rb_bug("Object %s points to MOVED: %p -> %s", obj_info(parent), (void *)ref, obj_info(rb_gc_location(ref)));
-    }
-}
-
-static int
-heap_check_moved_i(void *vstart, void *vend, size_t stride, void *data)
-{
-    rb_objspace_t *objspace = data;
-
-    VALUE v = (VALUE)vstart;
-    for (; v != (VALUE)vend; v += stride) {
-        if (gc_object_moved_p(objspace, v)) {
-            /* Moved object still on the heap, something may have a reference. */
-        }
-        else {
-            void *poisoned = asan_unpoison_object_temporary(v);
-
-            switch (BUILTIN_TYPE(v)) {
-              case T_NONE:
-              case T_ZOMBIE:
-                break;
-              default:
-                if (!rb_objspace_garbage_object_p(v)) {
-                    rb_objspace_reachable_objects_from(v, reachable_object_check_moved_i, (void *)v);
-                }
-            }
-
-            if (poisoned) {
-                GC_ASSERT(BUILTIN_TYPE(v) == T_NONE);
-                asan_poison_object(v);
-            }
-        }
-    }
-
-    return 0;
-}
-
-/*
- *  call-seq:
- *     GC.compact -> hash
- *
- * This function compacts objects together in Ruby's heap. It eliminates
- * unused space (or fragmentation) in the heap by moving objects in to that
- * unused space.
- *
- * The returned +hash+ contains statistics about the objects that were moved;
- * see GC.latest_compact_info.
- *
- * This method is only expected to work on CRuby.
- *
- * To test whether \GC compaction is supported, use the idiom:
- *
- *   GC.respond_to?(:compact)
- */
-static VALUE
-gc_compact(VALUE self)
-{
-    /* Run GC with compaction enabled */
-    gc_start_internal(NULL, self, Qtrue, Qtrue, Qtrue, Qtrue);
-
-    return gc_compact_stats(self);
-}
-#else
-#  define gc_compact rb_f_notimplement
-#endif
-
-#if GC_CAN_COMPILE_COMPACTION
-
-struct desired_compaction_pages_i_data {
-    rb_objspace_t *objspace;
-    size_t required_slots[SIZE_POOL_COUNT];
-};
-
-static int
-desired_compaction_pages_i(struct heap_page *page, void *data)
-{
-    struct desired_compaction_pages_i_data *tdata = data;
-    rb_objspace_t *objspace = tdata->objspace;
-    VALUE vstart = (VALUE)page->start;
-    VALUE vend = vstart + (VALUE)(page->total_slots * page->size_pool->slot_size);
-
-
-    for (VALUE v = vstart; v != vend; v += page->size_pool->slot_size) {
-        /* skip T_NONEs; they won't be moved */
-        void *poisoned = asan_unpoison_object_temporary(v);
-        if (BUILTIN_TYPE(v) == T_NONE) {
-            if (poisoned) {
-                asan_poison_object(v);
-            }
-            continue;
-        }
-
-        rb_size_pool_t *dest_pool = gc_compact_destination_pool(objspace, page->size_pool, v);
-        size_t dest_pool_idx = dest_pool - size_pools;
-        tdata->required_slots[dest_pool_idx]++;
-    }
-
-    return 0;
-}
-
-static VALUE
-gc_verify_compaction_references(rb_execution_context_t *ec, VALUE self, VALUE double_heap, VALUE expand_heap, VALUE toward_empty)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-
-    /* Clear the heap. */
-    gc_start_internal(NULL, self, Qtrue, Qtrue, Qtrue, Qfalse);
-
-    if (RTEST(double_heap)) {
-        rb_warn("double_heap is deprecated, please use expand_heap instead");
-    }
-
-    RB_VM_LOCK_ENTER();
-    {
-        gc_rest(objspace);
-
-        /* if both double_heap and expand_heap are set, expand_heap takes precedence */
-        if (RTEST(expand_heap)) {
-            struct desired_compaction_pages_i_data desired_compaction = {
-                .objspace = objspace,
-                .required_slots = {0},
-            };
-            /* Work out how many objects want to be in each size pool, taking account of moves */
-            objspace_each_pages(objspace, desired_compaction_pages_i, &desired_compaction, TRUE);
-
-            /* Find out which pool has the most pages */
-            size_t max_existing_pages = 0;
-            for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-                rb_size_pool_t *size_pool = &size_pools[i];
-                rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-                max_existing_pages = MAX(max_existing_pages, heap->total_pages);
-            }
-            /* Add pages to each size pool so that compaction is guaranteed to move every object */
-            for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-                rb_size_pool_t *size_pool = &size_pools[i];
-                rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-
-                size_t pages_to_add = 0;
-                /*
-                 * Step 1: Make sure every pool has the same number of pages, by adding empty pages
-                 * to smaller pools. This is required to make sure the compact cursor can advance
-                 * through all of the pools in `gc_sweep_compact` without hitting the "sweep &
-                 * compact cursors met" condition on some pools before fully compacting others
-                 */
-                pages_to_add += max_existing_pages - heap->total_pages;
-                /*
-                 * Step 2: Now add additional free pages to each size pool sufficient to hold all objects
-                 * that want to be in that size pool, whether moved into it or moved within it
-                 */
-                pages_to_add += slots_to_pages_for_size_pool(objspace, size_pool, desired_compaction.required_slots[i]);
-                /*
-                 * Step 3: Add two more pages so that the compact & sweep cursors will meet _after_ all objects
-                 * have been moved, and not on the last iteration of the `gc_sweep_compact` loop
-                 */
-                pages_to_add += 2;
-
-                heap_add_pages(objspace, size_pool, heap, pages_to_add);
+                UPDATE_IF_MOVED(objspace, RSTRUCT(obj)->as.heap.fields_obj);
             }
         }
-        else if (RTEST(double_heap)) {
-            for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-                rb_size_pool_t *size_pool = &size_pools[i];
-                rb_heap_t *heap = SIZE_POOL_EDEN_HEAP(size_pool);
-                heap_add_pages(objspace, size_pool, heap, heap->total_pages);
-            }
-
-        }
-
-        if (RTEST(toward_empty)) {
-            objspace->rcompactor.compare_func = compare_free_slots;
-        }
+        break;
+      default:
+        rb_bug("unreachable");
+        break;
     }
-    RB_VM_LOCK_LEAVE();
 
-    gc_start_internal(NULL, self, Qtrue, Qtrue, Qtrue, Qtrue);
-
-    objspace_reachable_objects_from_root(objspace, root_obj_check_moved_i, objspace);
-    objspace_each_objects(objspace, heap_check_moved_i, objspace, TRUE);
-
-    objspace->rcompactor.compare_func = NULL;
-    return gc_compact_stats(self);
+    UPDATE_IF_MOVED(objspace, RBASIC(obj)->klass);
 }
-#else
-#  define gc_verify_compaction_references (rb_builtin_arity3_function_type)rb_f_notimplement
-#endif
 
 VALUE
 rb_gc_start(void)
@@ -10624,38 +4535,22 @@ void
 rb_gc(void)
 {
     unless_objspace(objspace) { return; }
-    unsigned int reason = GPR_DEFAULT_REASON;
-    garbage_collect(objspace, reason);
+
+    rb_gc_impl_start(objspace, true, true, true, false);
 }
 
 int
 rb_during_gc(void)
 {
     unless_objspace(objspace) { return FALSE; }
-    return during_gc;
-}
-
-#if RGENGC_PROFILE >= 2
 
-static const char *type_name(int type, VALUE obj);
-
-static void
-gc_count_add_each_types(VALUE hash, const char *name, const size_t *types)
-{
-    VALUE result = rb_hash_new_with_size(T_MASK);
-    int i;
-    for (i=0; i<T_MASK; i++) {
-        const char *type = type_name(i, 0);
-        rb_hash_aset(result, ID2SYM(rb_intern(type)), SIZET2NUM(types[i]));
-    }
-    rb_hash_aset(hash, ID2SYM(rb_intern(name)), result);
+    return rb_gc_impl_during_gc_p(objspace);
 }
-#endif
 
 size_t
 rb_gc_count(void)
 {
-    return rb_objspace.profile.count;
+    return rb_gc_impl_gc_count(rb_gc_get_objspace());
 }
 
 static VALUE
@@ -10664,542 +4559,155 @@ gc_count(rb_execution_context_t *ec, VALUE self)
     return SIZET2NUM(rb_gc_count());
 }
 
-static VALUE
-gc_info_decode(rb_objspace_t *objspace, const VALUE hash_or_key, const unsigned int orig_flags)
+VALUE
+rb_gc_latest_gc_info(VALUE key)
 {
-    static VALUE sym_major_by = Qnil, sym_gc_by, sym_immediate_sweep, sym_have_finalizer, sym_state, sym_need_major_by;
-    static VALUE sym_nofree, sym_oldgen, sym_shady, sym_force, sym_stress;
-#if RGENGC_ESTIMATE_OLDMALLOC
-    static VALUE sym_oldmalloc;
-#endif
-    static VALUE sym_newobj, sym_malloc, sym_method, sym_capi;
-    static VALUE sym_none, sym_marking, sym_sweeping;
-    static VALUE sym_weak_references_count, sym_retained_weak_references_count;
-    VALUE hash = Qnil, key = Qnil;
-    VALUE major_by, need_major_by;
-    unsigned int flags = orig_flags ? orig_flags : objspace->profile.latest_gc_info;
-
-    if (SYMBOL_P(hash_or_key)) {
-        key = hash_or_key;
-    }
-    else if (RB_TYPE_P(hash_or_key, T_HASH)) {
-        hash = hash_or_key;
-    }
-    else {
+    if (!SYMBOL_P(key) && !RB_TYPE_P(key, T_HASH)) {
         rb_raise(rb_eTypeError, "non-hash or symbol given");
     }
 
-    if (NIL_P(sym_major_by)) {
-#define S(s) sym_##s = ID2SYM(rb_intern_const(#s))
-        S(major_by);
-        S(gc_by);
-        S(immediate_sweep);
-        S(have_finalizer);
-        S(state);
-        S(need_major_by);
-
-        S(stress);
-        S(nofree);
-        S(oldgen);
-        S(shady);
-        S(force);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        S(oldmalloc);
-#endif
-        S(newobj);
-        S(malloc);
-        S(method);
-        S(capi);
-
-        S(none);
-        S(marking);
-        S(sweeping);
-
-        S(weak_references_count);
-        S(retained_weak_references_count);
-#undef S
-    }
-
-#define SET(name, attr) \
-    if (key == sym_##name) \
-        return (attr); \
-    else if (hash != Qnil) \
-        rb_hash_aset(hash, sym_##name, (attr));
-
-    major_by =
-      (flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
-      (flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
-      (flags & GPR_FLAG_MAJOR_BY_SHADY)  ? sym_shady :
-      (flags & GPR_FLAG_MAJOR_BY_FORCE)  ? sym_force :
-#if RGENGC_ESTIMATE_OLDMALLOC
-      (flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
-#endif
-      Qnil;
-    SET(major_by, major_by);
-
-    if (orig_flags == 0) { /* set need_major_by only if flags not set explicitly */
-        unsigned int need_major_flags = gc_needs_major_flags;
-        need_major_by =
-            (need_major_flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
-            (need_major_flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
-            (need_major_flags & GPR_FLAG_MAJOR_BY_SHADY)  ? sym_shady :
-            (need_major_flags & GPR_FLAG_MAJOR_BY_FORCE)  ? sym_force :
-#if RGENGC_ESTIMATE_OLDMALLOC
-            (need_major_flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
-#endif
-            Qnil;
-        SET(need_major_by, need_major_by);
-    }
-
-    SET(gc_by,
-        (flags & GPR_FLAG_NEWOBJ) ? sym_newobj :
-        (flags & GPR_FLAG_MALLOC) ? sym_malloc :
-        (flags & GPR_FLAG_METHOD) ? sym_method :
-        (flags & GPR_FLAG_CAPI)   ? sym_capi :
-        (flags & GPR_FLAG_STRESS) ? sym_stress :
-        Qnil
-    );
-
-    SET(have_finalizer, RBOOL(flags & GPR_FLAG_HAVE_FINALIZE));
-    SET(immediate_sweep, RBOOL(flags & GPR_FLAG_IMMEDIATE_SWEEP));
-
-    if (orig_flags == 0) {
-        SET(state, gc_mode(objspace) == gc_mode_none ? sym_none :
-                   gc_mode(objspace) == gc_mode_marking ? sym_marking : sym_sweeping);
-    }
-
-    SET(weak_references_count, LONG2FIX(objspace->profile.weak_references_count));
-    SET(retained_weak_references_count, LONG2FIX(objspace->profile.retained_weak_references_count));
-#undef SET
+    VALUE val = rb_gc_impl_latest_gc_info(rb_gc_get_objspace(), key);
 
-    if (!NIL_P(key)) {/* matched key should return above */
+    if (val == Qundef) {
         rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(key));
     }
 
-    return hash;
-}
-
-VALUE
-rb_gc_latest_gc_info(VALUE key)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    return gc_info_decode(objspace, key, 0);
+    return val;
 }
 
 static VALUE
-gc_latest_gc_info(rb_execution_context_t *ec, VALUE self, VALUE arg)
+gc_stat(rb_execution_context_t *ec, VALUE self, VALUE arg) // arg is (nil || hash || symbol)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
     if (NIL_P(arg)) {
         arg = rb_hash_new();
     }
-    else if (!SYMBOL_P(arg) && !RB_TYPE_P(arg, T_HASH)) {
+    else if (!RB_TYPE_P(arg, T_HASH) && !SYMBOL_P(arg)) {
         rb_raise(rb_eTypeError, "non-hash or symbol given");
     }
 
-    return gc_info_decode(objspace, arg, 0);
-}
-
-enum gc_stat_sym {
-    gc_stat_sym_count,
-    gc_stat_sym_time,
-    gc_stat_sym_marking_time,
-    gc_stat_sym_sweeping_time,
-    gc_stat_sym_heap_allocated_pages,
-    gc_stat_sym_heap_sorted_length,
-    gc_stat_sym_heap_allocatable_pages,
-    gc_stat_sym_heap_available_slots,
-    gc_stat_sym_heap_live_slots,
-    gc_stat_sym_heap_free_slots,
-    gc_stat_sym_heap_final_slots,
-    gc_stat_sym_heap_marked_slots,
-    gc_stat_sym_heap_eden_pages,
-    gc_stat_sym_heap_tomb_pages,
-    gc_stat_sym_total_allocated_pages,
-    gc_stat_sym_total_freed_pages,
-    gc_stat_sym_total_allocated_objects,
-    gc_stat_sym_total_freed_objects,
-    gc_stat_sym_malloc_increase_bytes,
-    gc_stat_sym_malloc_increase_bytes_limit,
-    gc_stat_sym_minor_gc_count,
-    gc_stat_sym_major_gc_count,
-    gc_stat_sym_compact_count,
-    gc_stat_sym_read_barrier_faults,
-    gc_stat_sym_total_moved_objects,
-    gc_stat_sym_remembered_wb_unprotected_objects,
-    gc_stat_sym_remembered_wb_unprotected_objects_limit,
-    gc_stat_sym_old_objects,
-    gc_stat_sym_old_objects_limit,
-#if RGENGC_ESTIMATE_OLDMALLOC
-    gc_stat_sym_oldmalloc_increase_bytes,
-    gc_stat_sym_oldmalloc_increase_bytes_limit,
-#endif
-    gc_stat_sym_weak_references_count,
-#if RGENGC_PROFILE
-    gc_stat_sym_total_generated_normal_object_count,
-    gc_stat_sym_total_generated_shady_object_count,
-    gc_stat_sym_total_shade_operation_count,
-    gc_stat_sym_total_promoted_count,
-    gc_stat_sym_total_remembered_normal_object_count,
-    gc_stat_sym_total_remembered_shady_object_count,
-#endif
-    gc_stat_sym_last
-};
+    VALUE ret = rb_gc_impl_stat(rb_gc_get_objspace(), arg);
 
-static VALUE gc_stat_symbols[gc_stat_sym_last];
+    if (ret == Qundef) {
+        GC_ASSERT(SYMBOL_P(arg));
 
-static void
-setup_gc_stat_symbols(void)
-{
-    if (gc_stat_symbols[0] == 0) {
-#define S(s) gc_stat_symbols[gc_stat_sym_##s] = ID2SYM(rb_intern_const(#s))
-        S(count);
-        S(time);
-        S(marking_time),
-        S(sweeping_time),
-        S(heap_allocated_pages);
-        S(heap_sorted_length);
-        S(heap_allocatable_pages);
-        S(heap_available_slots);
-        S(heap_live_slots);
-        S(heap_free_slots);
-        S(heap_final_slots);
-        S(heap_marked_slots);
-        S(heap_eden_pages);
-        S(heap_tomb_pages);
-        S(total_allocated_pages);
-        S(total_freed_pages);
-        S(total_allocated_objects);
-        S(total_freed_objects);
-        S(malloc_increase_bytes);
-        S(malloc_increase_bytes_limit);
-        S(minor_gc_count);
-        S(major_gc_count);
-        S(compact_count);
-        S(read_barrier_faults);
-        S(total_moved_objects);
-        S(remembered_wb_unprotected_objects);
-        S(remembered_wb_unprotected_objects_limit);
-        S(old_objects);
-        S(old_objects_limit);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        S(oldmalloc_increase_bytes);
-        S(oldmalloc_increase_bytes_limit);
-#endif
-        S(weak_references_count);
-#if RGENGC_PROFILE
-        S(total_generated_normal_object_count);
-        S(total_generated_shady_object_count);
-        S(total_shade_operation_count);
-        S(total_promoted_count);
-        S(total_remembered_normal_object_count);
-        S(total_remembered_shady_object_count);
-#endif /* RGENGC_PROFILE */
-#undef S
+        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(arg));
     }
-}
 
-static uint64_t
-ns_to_ms(uint64_t ns)
-{
-    return ns / (1000 * 1000);
+    return ret;
 }
 
-static size_t
-gc_stat_internal(VALUE hash_or_sym)
+size_t
+rb_gc_stat(VALUE arg)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE hash = Qnil, key = Qnil;
-
-    setup_gc_stat_symbols();
-
-    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
-        hash = hash_or_sym;
-    }
-    else if (SYMBOL_P(hash_or_sym)) {
-        key = hash_or_sym;
-    }
-    else {
-        rb_raise(rb_eTypeError, "non-hash or symbol argument");
-    }
-
-#define SET(name, attr) \
-    if (key == gc_stat_symbols[gc_stat_sym_##name]) \
-        return attr; \
-    else if (hash != Qnil) \
-        rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], SIZET2NUM(attr));
-
-    SET(count, objspace->profile.count);
-    SET(time, (size_t)ns_to_ms(objspace->profile.marking_time_ns + objspace->profile.sweeping_time_ns)); // TODO: UINT64T2NUM
-    SET(marking_time, (size_t)ns_to_ms(objspace->profile.marking_time_ns));
-    SET(sweeping_time, (size_t)ns_to_ms(objspace->profile.sweeping_time_ns));
-
-    /* implementation dependent counters */
-    SET(heap_allocated_pages, heap_allocated_pages);
-    SET(heap_sorted_length, heap_pages_sorted_length);
-    SET(heap_allocatable_pages, heap_allocatable_pages(objspace));
-    SET(heap_available_slots, objspace_available_slots(objspace));
-    SET(heap_live_slots, objspace_live_slots(objspace));
-    SET(heap_free_slots, objspace_free_slots(objspace));
-    SET(heap_final_slots, heap_pages_final_slots);
-    SET(heap_marked_slots, objspace->marked_slots);
-    SET(heap_eden_pages, heap_eden_total_pages(objspace));
-    SET(heap_tomb_pages, heap_tomb_total_pages(objspace));
-    SET(total_allocated_pages, total_allocated_pages(objspace));
-    SET(total_freed_pages, total_freed_pages(objspace));
-    SET(total_allocated_objects, total_allocated_objects(objspace));
-    SET(total_freed_objects, total_freed_objects(objspace));
-    SET(malloc_increase_bytes, malloc_increase);
-    SET(malloc_increase_bytes_limit, malloc_limit);
-    SET(minor_gc_count, objspace->profile.minor_gc_count);
-    SET(major_gc_count, objspace->profile.major_gc_count);
-    SET(compact_count, objspace->profile.compact_count);
-    SET(read_barrier_faults, objspace->profile.read_barrier_faults);
-    SET(total_moved_objects, objspace->rcompactor.total_moved);
-    SET(remembered_wb_unprotected_objects, objspace->rgengc.uncollectible_wb_unprotected_objects);
-    SET(remembered_wb_unprotected_objects_limit, objspace->rgengc.uncollectible_wb_unprotected_objects_limit);
-    SET(old_objects, objspace->rgengc.old_objects);
-    SET(old_objects_limit, objspace->rgengc.old_objects_limit);
-#if RGENGC_ESTIMATE_OLDMALLOC
-    SET(oldmalloc_increase_bytes, objspace->rgengc.oldmalloc_increase);
-    SET(oldmalloc_increase_bytes_limit, objspace->rgengc.oldmalloc_increase_limit);
-#endif
-
-#if RGENGC_PROFILE
-    SET(total_generated_normal_object_count, objspace->profile.total_generated_normal_object_count);
-    SET(total_generated_shady_object_count, objspace->profile.total_generated_shady_object_count);
-    SET(total_shade_operation_count, objspace->profile.total_shade_operation_count);
-    SET(total_promoted_count, objspace->profile.total_promoted_count);
-    SET(total_remembered_normal_object_count, objspace->profile.total_remembered_normal_object_count);
-    SET(total_remembered_shady_object_count, objspace->profile.total_remembered_shady_object_count);
-#endif /* RGENGC_PROFILE */
-#undef SET
-
-    if (!NIL_P(key)) { /* matched key should return above */
-        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(key));
+    if (!RB_TYPE_P(arg, T_HASH) && !SYMBOL_P(arg)) {
+        rb_raise(rb_eTypeError, "non-hash or symbol given");
     }
 
-#if defined(RGENGC_PROFILE) && RGENGC_PROFILE >= 2
-    if (hash != Qnil) {
-        gc_count_add_each_types(hash, "generated_normal_object_count_types", objspace->profile.generated_normal_object_count_types);
-        gc_count_add_each_types(hash, "generated_shady_object_count_types", objspace->profile.generated_shady_object_count_types);
-        gc_count_add_each_types(hash, "shade_operation_count_types", objspace->profile.shade_operation_count_types);
-        gc_count_add_each_types(hash, "promoted_types", objspace->profile.promoted_types);
-        gc_count_add_each_types(hash, "remembered_normal_object_count_types", objspace->profile.remembered_normal_object_count_types);
-        gc_count_add_each_types(hash, "remembered_shady_object_count_types", objspace->profile.remembered_shady_object_count_types);
-    }
-#endif
+    VALUE ret = rb_gc_impl_stat(rb_gc_get_objspace(), arg);
 
-    return 0;
-}
+    if (ret == Qundef) {
+        GC_ASSERT(SYMBOL_P(arg));
 
-static VALUE
-gc_stat(rb_execution_context_t *ec, VALUE self, VALUE arg) // arg is (nil || hash || symbol)
-{
-    if (NIL_P(arg)) {
-        arg = rb_hash_new();
-    }
-    else if (SYMBOL_P(arg)) {
-        size_t value = gc_stat_internal(arg);
-        return SIZET2NUM(value);
-    }
-    else if (RB_TYPE_P(arg, T_HASH)) {
-        // ok
-    }
-    else {
-        rb_raise(rb_eTypeError, "non-hash or symbol given");
+        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(arg));
     }
 
-    gc_stat_internal(arg);
-    return arg;
-}
-
-size_t
-rb_gc_stat(VALUE key)
-{
-    if (SYMBOL_P(key)) {
-        size_t value = gc_stat_internal(key);
-        return value;
+    if (SYMBOL_P(arg)) {
+        return NUM2SIZET(ret);
     }
     else {
-        gc_stat_internal(key);
         return 0;
     }
 }
 
-
-enum gc_stat_heap_sym {
-    gc_stat_heap_sym_slot_size,
-    gc_stat_heap_sym_heap_allocatable_pages,
-    gc_stat_heap_sym_heap_eden_pages,
-    gc_stat_heap_sym_heap_eden_slots,
-    gc_stat_heap_sym_heap_tomb_pages,
-    gc_stat_heap_sym_heap_tomb_slots,
-    gc_stat_heap_sym_total_allocated_pages,
-    gc_stat_heap_sym_total_freed_pages,
-    gc_stat_heap_sym_force_major_gc_count,
-    gc_stat_heap_sym_force_incremental_marking_finish_count,
-    gc_stat_heap_sym_total_allocated_objects,
-    gc_stat_heap_sym_total_freed_objects,
-    gc_stat_heap_sym_last
-};
-
-static VALUE gc_stat_heap_symbols[gc_stat_heap_sym_last];
-
-static void
-setup_gc_stat_heap_symbols(void)
-{
-    if (gc_stat_heap_symbols[0] == 0) {
-#define S(s) gc_stat_heap_symbols[gc_stat_heap_sym_##s] = ID2SYM(rb_intern_const(#s))
-        S(slot_size);
-        S(heap_allocatable_pages);
-        S(heap_eden_pages);
-        S(heap_eden_slots);
-        S(heap_tomb_pages);
-        S(heap_tomb_slots);
-        S(total_allocated_pages);
-        S(total_freed_pages);
-        S(force_major_gc_count);
-        S(force_incremental_marking_finish_count);
-        S(total_allocated_objects);
-        S(total_freed_objects);
-#undef S
-    }
-}
-
-static size_t
-gc_stat_heap_internal(int size_pool_idx, VALUE hash_or_sym)
+static VALUE
+gc_stat_heap(rb_execution_context_t *ec, VALUE self, VALUE heap_name, VALUE arg)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    VALUE hash = Qnil, key = Qnil;
-
-    setup_gc_stat_heap_symbols();
+    if (NIL_P(arg)) {
+        arg = rb_hash_new();
+    }
 
-    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
-        hash = hash_or_sym;
+    if (NIL_P(heap_name)) {
+        if (!RB_TYPE_P(arg, T_HASH)) {
+            rb_raise(rb_eTypeError, "non-hash given");
+        }
     }
-    else if (SYMBOL_P(hash_or_sym)) {
-        key = hash_or_sym;
+    else if (FIXNUM_P(heap_name)) {
+        if (!SYMBOL_P(arg) && !RB_TYPE_P(arg, T_HASH)) {
+            rb_raise(rb_eTypeError, "non-hash or symbol given");
+        }
     }
     else {
-        rb_raise(rb_eTypeError, "non-hash or symbol argument");
-    }
-
-    if (size_pool_idx < 0 || size_pool_idx >= SIZE_POOL_COUNT) {
-        rb_raise(rb_eArgError, "size pool index out of range");
+        rb_raise(rb_eTypeError, "heap_name must be nil or an Integer");
     }
 
-    rb_size_pool_t *size_pool = &size_pools[size_pool_idx];
-
-#define SET(name, attr) \
-    if (key == gc_stat_heap_symbols[gc_stat_heap_sym_##name]) \
-        return attr; \
-    else if (hash != Qnil) \
-        rb_hash_aset(hash, gc_stat_heap_symbols[gc_stat_heap_sym_##name], SIZET2NUM(attr));
+    VALUE ret = rb_gc_impl_stat_heap(rb_gc_get_objspace(), heap_name, arg);
 
-    SET(slot_size, size_pool->slot_size);
-    SET(heap_allocatable_pages, size_pool->allocatable_pages);
-    SET(heap_eden_pages, SIZE_POOL_EDEN_HEAP(size_pool)->total_pages);
-    SET(heap_eden_slots, SIZE_POOL_EDEN_HEAP(size_pool)->total_slots);
-    SET(heap_tomb_pages, SIZE_POOL_TOMB_HEAP(size_pool)->total_pages);
-    SET(heap_tomb_slots, SIZE_POOL_TOMB_HEAP(size_pool)->total_slots);
-    SET(total_allocated_pages, size_pool->total_allocated_pages);
-    SET(total_freed_pages, size_pool->total_freed_pages);
-    SET(force_major_gc_count, size_pool->force_major_gc_count);
-    SET(force_incremental_marking_finish_count, size_pool->force_incremental_marking_finish_count);
-    SET(total_allocated_objects, size_pool->total_allocated_objects);
-    SET(total_freed_objects, size_pool->total_freed_objects);
-#undef SET
+    if (ret == Qundef) {
+        GC_ASSERT(SYMBOL_P(arg));
 
-    if (!NIL_P(key)) { /* matched key should return above */
-        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(key));
+        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(arg));
     }
 
-    return 0;
+    return ret;
 }
 
 static VALUE
-gc_stat_heap(rb_execution_context_t *ec, VALUE self, VALUE heap_name, VALUE arg)
+gc_config_get(rb_execution_context_t *ec, VALUE self)
 {
-    if (NIL_P(heap_name)) {
-        if (NIL_P(arg)) {
-            arg = rb_hash_new();
-        }
-        else if (RB_TYPE_P(arg, T_HASH)) {
-            // ok
-        }
-        else {
-            rb_raise(rb_eTypeError, "non-hash given");
-        }
+    VALUE cfg_hash = rb_gc_impl_config_get(rb_gc_get_objspace());
+    rb_hash_aset(cfg_hash, sym("implementation"), rb_fstring_cstr(rb_gc_impl_active_gc_name()));
 
-        for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-            VALUE hash = rb_hash_aref(arg, INT2FIX(i));
-            if (NIL_P(hash)) {
-                hash = rb_hash_new();
-                rb_hash_aset(arg, INT2FIX(i), hash);
-            }
-            gc_stat_heap_internal(i, hash);
-        }
-    }
-    else if (FIXNUM_P(heap_name)) {
-        int size_pool_idx = FIX2INT(heap_name);
+    return cfg_hash;
+}
 
-        if (NIL_P(arg)) {
-            arg = rb_hash_new();
-        }
-        else if (SYMBOL_P(arg)) {
-            size_t value = gc_stat_heap_internal(size_pool_idx, arg);
-            return SIZET2NUM(value);
-        }
-        else if (RB_TYPE_P(arg, T_HASH)) {
-            // ok
-        }
-        else {
-            rb_raise(rb_eTypeError, "non-hash or symbol given");
-        }
+static VALUE
+gc_config_set(rb_execution_context_t *ec, VALUE self, VALUE hash)
+{
+    void *objspace = rb_gc_get_objspace();
 
-        gc_stat_heap_internal(size_pool_idx, arg);
-    }
-    else {
-        rb_raise(rb_eTypeError, "heap_name must be nil or an Integer");
-    }
+    rb_gc_impl_config_set(objspace, hash);
 
-    return arg;
+    return Qnil;
 }
 
 static VALUE
 gc_stress_get(rb_execution_context_t *ec, VALUE self)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    return ruby_gc_stress_mode;
+    return rb_gc_impl_stress_get(rb_gc_get_objspace());
 }
 
 static VALUE
 gc_stress_set_m(rb_execution_context_t *ec, VALUE self, VALUE flag)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
-    objspace->flags.gc_stressful = RTEST(flag);
-    objspace->gc_stress_mode = flag;
+    rb_gc_impl_stress_set(rb_gc_get_objspace(), flag);
 
     return flag;
 }
 
+void
+rb_gc_initial_stress_set(VALUE flag)
+{
+    initial_stress = flag;
+}
+
+size_t *
+rb_gc_heap_sizes(void)
+{
+    return rb_gc_impl_heap_sizes(rb_gc_get_objspace());
+}
+
 VALUE
 rb_gc_enable(void)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    return rb_objspace_gc_enable(objspace);
+    return rb_objspace_gc_enable(rb_gc_get_objspace());
 }
 
 VALUE
-rb_objspace_gc_enable(rb_objspace_t *objspace)
+rb_objspace_gc_enable(void *objspace)
 {
-    int old = dont_gc_val();
-
-    dont_gc_off();
-    return RBOOL(old);
+    bool disabled = !rb_gc_impl_gc_enabled_p(objspace);
+    rb_gc_impl_gc_enable(objspace);
+    return RBOOL(disabled);
 }
 
 static VALUE
@@ -11208,33 +4716,32 @@ gc_enable(rb_execution_context_t *ec, VALUE _)
     return rb_gc_enable();
 }
 
-VALUE
-rb_gc_disable_no_rest(void)
+static VALUE
+gc_disable_no_rest(void *objspace)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    return gc_disable_no_rest(objspace);
+    bool disabled = !rb_gc_impl_gc_enabled_p(objspace);
+    rb_gc_impl_gc_disable(objspace, false);
+    return RBOOL(disabled);
 }
 
-static VALUE
-gc_disable_no_rest(rb_objspace_t *objspace)
+VALUE
+rb_gc_disable_no_rest(void)
 {
-    int old = dont_gc_val();
-    dont_gc_on();
-    return RBOOL(old);
+    return gc_disable_no_rest(rb_gc_get_objspace());
 }
 
 VALUE
 rb_gc_disable(void)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    return rb_objspace_gc_disable(objspace);
+    return rb_objspace_gc_disable(rb_gc_get_objspace());
 }
 
 VALUE
-rb_objspace_gc_disable(rb_objspace_t *objspace)
+rb_objspace_gc_disable(void *objspace)
 {
-    gc_rest(objspace);
-    return gc_disable_no_rest(objspace);
+    bool disabled = !rb_gc_impl_gc_enabled_p(objspace);
+    rb_gc_impl_gc_disable(objspace, true);
+    return RBOOL(disabled);
 }
 
 static VALUE
@@ -11243,294 +4750,32 @@ gc_disable(rb_execution_context_t *ec, VALUE _)
     return rb_gc_disable();
 }
 
-#if GC_CAN_COMPILE_COMPACTION
-/*
- *  call-seq:
- *     GC.auto_compact = flag
- *
- *  Updates automatic compaction mode.
- *
- *  When enabled, the compactor will execute on every major collection.
- *
- *  Enabling compaction will degrade performance on major collections.
- */
-static VALUE
-gc_set_auto_compact(VALUE _, VALUE v)
-{
-    GC_ASSERT(GC_COMPACTION_SUPPORTED);
-
-    ruby_enable_autocompact = RTEST(v);
-
-#if RGENGC_CHECK_MODE
-    ruby_autocompact_compare_func = NULL;
-
-    if (SYMBOL_P(v)) {
-        ID id = RB_SYM2ID(v);
-        if (id == rb_intern("empty")) {
-            ruby_autocompact_compare_func = compare_free_slots;
-        }
-    }
-#endif
-
-    return v;
-}
-#else
-#  define gc_set_auto_compact rb_f_notimplement
-#endif
-
-#if GC_CAN_COMPILE_COMPACTION
-/*
- *  call-seq:
- *     GC.auto_compact    -> true or false
- *
- *  Returns whether or not automatic compaction has been enabled.
- */
-static VALUE
-gc_get_auto_compact(VALUE _)
-{
-    return RBOOL(ruby_enable_autocompact);
-}
-#else
-#  define gc_get_auto_compact rb_f_notimplement
-#endif
-
-static int
-get_envparam_size(const char *name, size_t *default_value, size_t lower_bound)
-{
-    const char *ptr = getenv(name);
-    ssize_t val;
-
-    if (ptr != NULL && *ptr) {
-        size_t unit = 0;
-        char *end;
-#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
-        val = strtoll(ptr, &end, 0);
-#else
-        val = strtol(ptr, &end, 0);
-#endif
-        switch (*end) {
-          case 'k': case 'K':
-            unit = 1024;
-            ++end;
-            break;
-          case 'm': case 'M':
-            unit = 1024*1024;
-            ++end;
-            break;
-          case 'g': case 'G':
-            unit = 1024*1024*1024;
-            ++end;
-            break;
-        }
-        while (*end && isspace((unsigned char)*end)) end++;
-        if (*end) {
-            if (RTEST(ruby_verbose)) fprintf(stderr, "invalid string for %s: %s\n", name, ptr);
-            return 0;
-        }
-        if (unit > 0) {
-            if (val < -(ssize_t)(SIZE_MAX / 2 / unit) || (ssize_t)(SIZE_MAX / 2 / unit) < val) {
-                if (RTEST(ruby_verbose)) fprintf(stderr, "%s=%s is ignored because it overflows\n", name, ptr);
-                return 0;
-            }
-            val *= unit;
-        }
-        if (val > 0 && (size_t)val > lower_bound) {
-            if (RTEST(ruby_verbose)) {
-                fprintf(stderr, "%s=%"PRIdSIZE" (default value: %"PRIuSIZE")\n", name, val, *default_value);
-            }
-            *default_value = (size_t)val;
-            return 1;
-        }
-        else {
-            if (RTEST(ruby_verbose)) {
-                fprintf(stderr, "%s=%"PRIdSIZE" (default value: %"PRIuSIZE") is ignored because it must be greater than %"PRIuSIZE".\n",
-                        name, val, *default_value, lower_bound);
-            }
-            return 0;
-        }
-    }
-    return 0;
-}
-
-static int
-get_envparam_double(const char *name, double *default_value, double lower_bound, double upper_bound, int accept_zero)
-{
-    const char *ptr = getenv(name);
-    double val;
-
-    if (ptr != NULL && *ptr) {
-        char *end;
-        val = strtod(ptr, &end);
-        if (!*ptr || *end) {
-            if (RTEST(ruby_verbose)) fprintf(stderr, "invalid string for %s: %s\n", name, ptr);
-            return 0;
-        }
-
-        if (accept_zero && val == 0.0) {
-            goto accept;
-        }
-        else if (val <= lower_bound) {
-            if (RTEST(ruby_verbose)) {
-                fprintf(stderr, "%s=%f (default value: %f) is ignored because it must be greater than %f.\n",
-                        name, val, *default_value, lower_bound);
-            }
-        }
-        else if (upper_bound != 0.0 && /* ignore upper_bound if it is 0.0 */
-                 val > upper_bound) {
-            if (RTEST(ruby_verbose)) {
-                fprintf(stderr, "%s=%f (default value: %f) is ignored because it must be lower than %f.\n",
-                        name, val, *default_value, upper_bound);
-            }
-        }
-        else {
-            goto accept;
-        }
-    }
-    return 0;
-
-  accept:
-    if (RTEST(ruby_verbose)) fprintf(stderr, "%s=%f (default value: %f)\n", name, val, *default_value);
-    *default_value = val;
-    return 1;
-}
-
-static void
-gc_set_initial_pages(rb_objspace_t *objspace)
-{
-    gc_rest(objspace);
-
-    for (int i = 0; i < SIZE_POOL_COUNT; i++) {
-        rb_size_pool_t *size_pool = &size_pools[i];
-        char env_key[sizeof("RUBY_GC_HEAP_" "_INIT_SLOTS") + DECIMAL_SIZE_OF_BITS(sizeof(int) * CHAR_BIT)];
-        snprintf(env_key, sizeof(env_key), "RUBY_GC_HEAP_%d_INIT_SLOTS", i);
-
-        size_t size_pool_init_slots = gc_params.size_pool_init_slots[i];
-        if (get_envparam_size(env_key, &size_pool_init_slots, 0)) {
-            gc_params.size_pool_init_slots[i] = size_pool_init_slots;
-        }
-
-        if (size_pool_init_slots > size_pool->eden_heap.total_slots) {
-            size_t slots = size_pool_init_slots - size_pool->eden_heap.total_slots;
-            size_pool->allocatable_pages = slots_to_pages_for_size_pool(objspace, size_pool, slots);
-        }
-        else {
-            /* We already have more slots than size_pool_init_slots allows, so
-             * prevent creating more pages. */
-            size_pool->allocatable_pages = 0;
-        }
-    }
-    heap_pages_expand_sorted(objspace);
-}
-
-/*
- * GC tuning environment variables
- *
- * * RUBY_GC_HEAP_FREE_SLOTS
- *   - Prepare at least this amount of slots after GC.
- *   - Allocate slots if there are not enough slots.
- * * RUBY_GC_HEAP_GROWTH_FACTOR (new from 2.1)
- *   - Allocate slots by this factor.
- *   - (next slots number) = (current slots number) * (this factor)
- * * RUBY_GC_HEAP_GROWTH_MAX_SLOTS (new from 2.1)
- *   - Allocation rate is limited to this number of slots.
- * * RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO (new from 2.4)
- *   - Allocate additional pages when the number of free slots is
- *     lower than the value (total_slots * (this ratio)).
- * * RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO (new from 2.4)
- *   - Allocate slots to satisfy this formula:
- *       free_slots = total_slots * goal_ratio
- *   - In other words, prepare (total_slots * goal_ratio) free slots.
- *   - if this value is 0.0, then use RUBY_GC_HEAP_GROWTH_FACTOR directly.
- * * RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO (new from 2.4)
- *   - Allow to free pages when the number of free slots is
- *     greater than the value (total_slots * (this ratio)).
- * * RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR (new from 2.1.1)
- *   - Do full GC when the number of old objects is more than R * N
- *     where R is this factor and
- *           N is the number of old objects just after last full GC.
- *
- *  * obsolete
- *    * RUBY_FREE_MIN       -> RUBY_GC_HEAP_FREE_SLOTS (from 2.1)
- *    * RUBY_HEAP_MIN_SLOTS -> RUBY_GC_HEAP_INIT_SLOTS (from 2.1)
- *
- * * RUBY_GC_MALLOC_LIMIT
- * * RUBY_GC_MALLOC_LIMIT_MAX (new from 2.1)
- * * RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR (new from 2.1)
- *
- * * RUBY_GC_OLDMALLOC_LIMIT (new from 2.1)
- * * RUBY_GC_OLDMALLOC_LIMIT_MAX (new from 2.1)
- * * RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR (new from 2.1)
- */
-
+// TODO: think about moving ruby_gc_set_params into Init_heap or Init_gc
 void
 ruby_gc_set_params(void)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    /* RUBY_GC_HEAP_FREE_SLOTS */
-    if (get_envparam_size("RUBY_GC_HEAP_FREE_SLOTS", &gc_params.heap_free_slots, 0)) {
-        /* ok */
-    }
-
-    gc_set_initial_pages(objspace);
-
-    get_envparam_double("RUBY_GC_HEAP_GROWTH_FACTOR", &gc_params.growth_factor, 1.0, 0.0, FALSE);
-    get_envparam_size  ("RUBY_GC_HEAP_GROWTH_MAX_SLOTS", &gc_params.growth_max_slots, 0);
-    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO", &gc_params.heap_free_slots_min_ratio,
-                        0.0, 1.0, FALSE);
-    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO", &gc_params.heap_free_slots_max_ratio,
-                        gc_params.heap_free_slots_min_ratio, 1.0, FALSE);
-    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO", &gc_params.heap_free_slots_goal_ratio,
-                        gc_params.heap_free_slots_min_ratio, gc_params.heap_free_slots_max_ratio, TRUE);
-    get_envparam_double("RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR", &gc_params.oldobject_limit_factor, 0.0, 0.0, TRUE);
-    get_envparam_double("RUBY_GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO", &gc_params.uncollectible_wb_unprotected_objects_limit_ratio, 0.0, 0.0, TRUE);
-
-    if (get_envparam_size("RUBY_GC_MALLOC_LIMIT", &gc_params.malloc_limit_min, 0)) {
-        malloc_limit = gc_params.malloc_limit_min;
-    }
-    get_envparam_size  ("RUBY_GC_MALLOC_LIMIT_MAX", &gc_params.malloc_limit_max, 0);
-    if (!gc_params.malloc_limit_max) { /* ignore max-check if 0 */
-        gc_params.malloc_limit_max = SIZE_MAX;
-    }
-    get_envparam_double("RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR", &gc_params.malloc_limit_growth_factor, 1.0, 0.0, FALSE);
-
-#if RGENGC_ESTIMATE_OLDMALLOC
-    if (get_envparam_size("RUBY_GC_OLDMALLOC_LIMIT", &gc_params.oldmalloc_limit_min, 0)) {
-        objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
-    }
-    get_envparam_size  ("RUBY_GC_OLDMALLOC_LIMIT_MAX", &gc_params.oldmalloc_limit_max, 0);
-    get_envparam_double("RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR", &gc_params.oldmalloc_limit_growth_factor, 1.0, 0.0, FALSE);
-#endif
-}
-
-static void
-reachable_objects_from_callback(VALUE obj)
-{
-    rb_ractor_t *cr = GET_RACTOR();
-    cr->mfd->mark_func(obj, cr->mfd->data);
+    rb_gc_impl_set_params(rb_gc_get_objspace());
 }
 
 void
 rb_objspace_reachable_objects_from(VALUE obj, void (func)(VALUE, void *), void *data)
 {
-    rb_objspace_t *objspace = &rb_objspace;
+    RB_VM_LOCKING() {
+        if (rb_gc_impl_during_gc_p(rb_gc_get_objspace())) rb_bug("rb_objspace_reachable_objects_from() is not supported while during GC");
 
-    RB_VM_LOCK_ENTER();
-    {
-        if (during_gc) rb_bug("rb_objspace_reachable_objects_from() is not supported while during_gc == true");
-
-        if (is_markable_object(obj)) {
-            rb_ractor_t *cr = GET_RACTOR();
+        if (!RB_SPECIAL_CONST_P(obj)) {
+            rb_vm_t *vm = GET_VM();
+            struct gc_mark_func_data_struct *prev_mfd = vm->gc.mark_func_data;
             struct gc_mark_func_data_struct mfd = {
                 .mark_func = func,
                 .data = data,
-            }, *prev_mfd = cr->mfd;
+            };
 
-            cr->mfd = &mfd;
-            gc_mark_children(objspace, obj);
-            cr->mfd = prev_mfd;
+            vm->gc.mark_func_data = &mfd;
+            rb_gc_mark_children(rb_gc_get_objspace(), obj);
+            vm->gc.mark_func_data = prev_mfd;
         }
     }
-    RB_VM_LOCK_LEAVE();
 }
 
 struct root_objects_data {
@@ -11549,1488 +4794,25 @@ root_objects_from(VALUE obj, void *ptr)
 void
 rb_objspace_reachable_objects_from_root(void (func)(const char *category, VALUE, void *), void *passing_data)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    objspace_reachable_objects_from_root(objspace, func, passing_data);
-}
+    if (rb_gc_impl_during_gc_p(rb_gc_get_objspace())) rb_bug("rb_gc_impl_objspace_reachable_objects_from_root() is not supported while during GC");
 
-static void
-objspace_reachable_objects_from_root(rb_objspace_t *objspace, void (func)(const char *category, VALUE, void *), void *passing_data)
-{
-    if (during_gc) rb_bug("objspace_reachable_objects_from_root() is not supported while during_gc == true");
+    rb_vm_t *vm = GET_VM();
 
-    rb_ractor_t *cr = GET_RACTOR();
     struct root_objects_data data = {
         .func = func,
         .data = passing_data,
     };
+
+    struct gc_mark_func_data_struct *prev_mfd = vm->gc.mark_func_data;
     struct gc_mark_func_data_struct mfd = {
         .mark_func = root_objects_from,
         .data = &data,
-    }, *prev_mfd = cr->mfd;
-
-    cr->mfd = &mfd;
-    gc_mark_roots(objspace, &data.category);
-    cr->mfd = prev_mfd;
-}
-
-/*
-  ------------------------ Extended allocator ------------------------
-*/
-
-struct gc_raise_tag {
-    VALUE exc;
-    const char *fmt;
-    va_list *ap;
-};
-
-static void *
-gc_vraise(void *ptr)
-{
-    struct gc_raise_tag *argv = ptr;
-    rb_vraise(argv->exc, argv->fmt, *argv->ap);
-    UNREACHABLE_RETURN(NULL);
-}
-
-static void
-gc_raise(VALUE exc, const char *fmt, ...)
-{
-    va_list ap;
-    va_start(ap, fmt);
-    struct gc_raise_tag argv = {
-        exc, fmt, &ap,
     };
 
-    if (ruby_thread_has_gvl_p()) {
-        gc_vraise(&argv);
-        UNREACHABLE;
-    }
-    else if (ruby_native_thread_p()) {
-        rb_thread_call_with_gvl(gc_vraise, &argv);
-        UNREACHABLE;
-    }
-    else {
-        /* Not in a ruby thread */
-        fprintf(stderr, "%s", "[FATAL] ");
-        vfprintf(stderr, fmt, ap);
-    }
-
-    va_end(ap);
-    abort();
-}
-
-static void objspace_xfree(rb_objspace_t *objspace, void *ptr, size_t size);
-
-static void
-negative_size_allocation_error(const char *msg)
-{
-    gc_raise(rb_eNoMemError, "%s", msg);
-}
-
-static void *
-ruby_memerror_body(void *dummy)
-{
-    rb_memerror();
-    return 0;
-}
-
-NORETURN(static void ruby_memerror(void));
-RBIMPL_ATTR_MAYBE_UNUSED()
-static void
-ruby_memerror(void)
-{
-    if (ruby_thread_has_gvl_p()) {
-        rb_memerror();
-    }
-    else {
-        if (ruby_native_thread_p()) {
-            rb_thread_call_with_gvl(ruby_memerror_body, 0);
-        }
-        else {
-            /* no ruby thread */
-            fprintf(stderr, "[FATAL] failed to allocate memory\n");
-        }
-    }
-    exit(EXIT_FAILURE);
-}
-
-void
-rb_memerror(void)
-{
-    rb_execution_context_t *ec = GET_EC();
-    rb_objspace_t *objspace = rb_objspace_of(rb_ec_vm_ptr(ec));
-    VALUE exc;
-
-    if (0) {
-        // Print out pid, sleep, so you can attach debugger to see what went wrong:
-        fprintf(stderr, "rb_memerror pid=%"PRI_PIDT_PREFIX"d\n", getpid());
-        sleep(60);
-    }
-
-    if (during_gc) {
-        // TODO: OMG!! How to implement it?
-        gc_exit(objspace, gc_enter_event_rb_memerror, NULL);
-    }
-
-    exc = nomem_error;
-    if (!exc ||
-        rb_ec_raised_p(ec, RAISED_NOMEMORY)) {
-        fprintf(stderr, "[FATAL] failed to allocate memory\n");
-        exit(EXIT_FAILURE);
-    }
-    if (rb_ec_raised_p(ec, RAISED_NOMEMORY)) {
-        rb_ec_raised_clear(ec);
-    }
-    else {
-        rb_ec_raised_set(ec, RAISED_NOMEMORY);
-        exc = ruby_vm_special_exception_copy(exc);
-    }
-    ec->errinfo = exc;
-    EC_JUMP_TAG(ec, TAG_RAISE);
-}
-
-static void
-rb_aligned_free(void *ptr, size_t size)
-{
-#if defined __MINGW32__
-    __mingw_aligned_free(ptr);
-#elif defined _WIN32
-    _aligned_free(ptr);
-#elif defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
-    free(ptr);
-#else
-    free(((void**)ptr)[-1]);
-#endif
-}
-
-static inline size_t
-objspace_malloc_size(rb_objspace_t *objspace, void *ptr, size_t hint)
-{
-#ifdef HAVE_MALLOC_USABLE_SIZE
-    return malloc_usable_size(ptr);
-#else
-    return hint;
-#endif
-}
-
-enum memop_type {
-    MEMOP_TYPE_MALLOC  = 0,
-    MEMOP_TYPE_FREE,
-    MEMOP_TYPE_REALLOC
-};
-
-static inline void
-atomic_sub_nounderflow(size_t *var, size_t sub)
-{
-    if (sub == 0) return;
-
-    while (1) {
-        size_t val = *var;
-        if (val < sub) sub = val;
-        if (ATOMIC_SIZE_CAS(*var, val, val-sub) == val) break;
-    }
-}
-
-static void
-objspace_malloc_gc_stress(rb_objspace_t *objspace)
-{
-    if (ruby_gc_stressful && ruby_native_thread_p()) {
-        unsigned int reason = (GPR_FLAG_IMMEDIATE_MARK | GPR_FLAG_IMMEDIATE_SWEEP |
-                               GPR_FLAG_STRESS | GPR_FLAG_MALLOC);
-
-        if (gc_stress_full_mark_after_malloc_p()) {
-            reason |= GPR_FLAG_FULL_MARK;
-        }
-        garbage_collect_with_gvl(objspace, reason);
-    }
-}
-
-static inline bool
-objspace_malloc_increase_report(rb_objspace_t *objspace, void *mem, size_t new_size, size_t old_size, enum memop_type type)
-{
-    if (0) fprintf(stderr, "increase - ptr: %p, type: %s, new_size: %"PRIdSIZE", old_size: %"PRIdSIZE"\n",
-                   mem,
-                   type == MEMOP_TYPE_MALLOC  ? "malloc" :
-                   type == MEMOP_TYPE_FREE    ? "free  " :
-                   type == MEMOP_TYPE_REALLOC ? "realloc": "error",
-                   new_size, old_size);
-    return false;
-}
-
-static bool
-objspace_malloc_increase_body(rb_objspace_t *objspace, void *mem, size_t new_size, size_t old_size, enum memop_type type)
-{
-    if (new_size > old_size) {
-        ATOMIC_SIZE_ADD(malloc_increase, new_size - old_size);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        ATOMIC_SIZE_ADD(objspace->rgengc.oldmalloc_increase, new_size - old_size);
-#endif
-    }
-    else {
-        atomic_sub_nounderflow(&malloc_increase, old_size - new_size);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        atomic_sub_nounderflow(&objspace->rgengc.oldmalloc_increase, old_size - new_size);
-#endif
-    }
-
-    if (type == MEMOP_TYPE_MALLOC) {
-      retry:
-        if (malloc_increase > malloc_limit && ruby_native_thread_p() && !dont_gc_val()) {
-            if (ruby_thread_has_gvl_p() && is_lazy_sweeping(objspace)) {
-                gc_rest(objspace); /* gc_rest can reduce malloc_increase */
-                goto retry;
-            }
-            garbage_collect_with_gvl(objspace, GPR_FLAG_MALLOC);
-        }
-    }
-
-#if MALLOC_ALLOCATED_SIZE
-    if (new_size >= old_size) {
-        ATOMIC_SIZE_ADD(objspace->malloc_params.allocated_size, new_size - old_size);
-    }
-    else {
-        size_t dec_size = old_size - new_size;
-        size_t allocated_size = objspace->malloc_params.allocated_size;
-
-#if MALLOC_ALLOCATED_SIZE_CHECK
-        if (allocated_size < dec_size) {
-            rb_bug("objspace_malloc_increase: underflow malloc_params.allocated_size.");
-        }
-#endif
-        atomic_sub_nounderflow(&objspace->malloc_params.allocated_size, dec_size);
-    }
-
-    switch (type) {
-      case MEMOP_TYPE_MALLOC:
-        ATOMIC_SIZE_INC(objspace->malloc_params.allocations);
-        break;
-      case MEMOP_TYPE_FREE:
-        {
-            size_t allocations = objspace->malloc_params.allocations;
-            if (allocations > 0) {
-                atomic_sub_nounderflow(&objspace->malloc_params.allocations, 1);
-            }
-#if MALLOC_ALLOCATED_SIZE_CHECK
-            else {
-                GC_ASSERT(objspace->malloc_params.allocations > 0);
-            }
-#endif
-        }
-        break;
-      case MEMOP_TYPE_REALLOC: /* ignore */ break;
-    }
-#endif
-    return true;
-}
-
-#define objspace_malloc_increase(...) \
-    for (bool malloc_increase_done = objspace_malloc_increase_report(__VA_ARGS__); \
-         !malloc_increase_done; \
-         malloc_increase_done = objspace_malloc_increase_body(__VA_ARGS__))
-
-struct malloc_obj_info { /* 4 words */
-    size_t size;
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    size_t gen;
-    const char *file;
-    size_t line;
-#endif
-};
-
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-const char *ruby_malloc_info_file;
-int ruby_malloc_info_line;
-#endif
-
-static inline size_t
-objspace_malloc_prepare(rb_objspace_t *objspace, size_t size)
-{
-    if (size == 0) size = 1;
-
-#if CALC_EXACT_MALLOC_SIZE
-    size += sizeof(struct malloc_obj_info);
-#endif
-
-    return size;
-}
-
-static bool
-malloc_during_gc_p(rb_objspace_t *objspace)
-{
-    /* malloc is not allowed during GC when we're not using multiple ractors
-     * (since ractors can run while another thread is sweeping) and when we
-     * have the GVL (since if we don't have the GVL, we'll try to acquire the
-     * GVL which will block and ensure the other thread finishes GC). */
-    return during_gc && !dont_gc_val() && !rb_multi_ractor_p() && ruby_thread_has_gvl_p();
-}
-
-static inline void *
-objspace_malloc_fixup(rb_objspace_t *objspace, void *mem, size_t size)
-{
-    size = objspace_malloc_size(objspace, mem, size);
-    objspace_malloc_increase(objspace, mem, size, 0, MEMOP_TYPE_MALLOC) {}
-
-#if CALC_EXACT_MALLOC_SIZE
-    {
-        struct malloc_obj_info *info = mem;
-        info->size = size;
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-        info->gen = objspace->profile.count;
-        info->file = ruby_malloc_info_file;
-        info->line = info->file ? ruby_malloc_info_line : 0;
-#endif
-        mem = info + 1;
-    }
-#endif
-
-    return mem;
-}
-
-#if defined(__GNUC__) && RUBY_DEBUG
-#define RB_BUG_INSTEAD_OF_RB_MEMERROR 1
-#endif
-
-#ifndef RB_BUG_INSTEAD_OF_RB_MEMERROR
-# define RB_BUG_INSTEAD_OF_RB_MEMERROR 0
-#endif
-
-#define GC_MEMERROR(...) \
-    ((RB_BUG_INSTEAD_OF_RB_MEMERROR+0) ? rb_bug("" __VA_ARGS__) : rb_memerror())
-
-#define TRY_WITH_GC(siz, expr) do {                          \
-        const gc_profile_record_flag gpr =                   \
-            GPR_FLAG_FULL_MARK           |                   \
-            GPR_FLAG_IMMEDIATE_MARK      |                   \
-            GPR_FLAG_IMMEDIATE_SWEEP     |                   \
-            GPR_FLAG_MALLOC;                                 \
-        objspace_malloc_gc_stress(objspace);                 \
-                                                             \
-        if (LIKELY((expr))) {                                \
-            /* Success on 1st try */                         \
-        }                                                    \
-        else if (!garbage_collect_with_gvl(objspace, gpr)) { \
-            /* @shyouhei thinks this doesn't happen */       \
-            GC_MEMERROR("TRY_WITH_GC: could not GC");        \
-        }                                                    \
-        else if ((expr)) {                                   \
-            /* Success on 2nd try */                         \
-        }                                                    \
-        else {                                               \
-            GC_MEMERROR("TRY_WITH_GC: could not allocate:"   \
-                        "%"PRIdSIZE" bytes for %s",          \
-                        siz, # expr);                        \
-        }                                                    \
-    } while (0)
-
-static void
-check_malloc_not_in_gc(rb_objspace_t *objspace, const char *msg)
-{
-    if (UNLIKELY(malloc_during_gc_p(objspace))) {
-        dont_gc_on();
-        during_gc = false;
-        rb_bug("Cannot %s during GC", msg);
-    }
-}
-
-/* these shouldn't be called directly.
- * objspace_* functions do not check allocation size.
- */
-static void *
-objspace_xmalloc0(rb_objspace_t *objspace, size_t size)
-{
-    check_malloc_not_in_gc(objspace, "malloc");
-
-    void *mem;
-
-    size = objspace_malloc_prepare(objspace, size);
-    TRY_WITH_GC(size, mem = malloc(size));
-    RB_DEBUG_COUNTER_INC(heap_xmalloc);
-    return objspace_malloc_fixup(objspace, mem, size);
-}
-
-static inline size_t
-xmalloc2_size(const size_t count, const size_t elsize)
-{
-    return size_mul_or_raise(count, elsize, rb_eArgError);
-}
-
-static void *
-objspace_xrealloc(rb_objspace_t *objspace, void *ptr, size_t new_size, size_t old_size)
-{
-    check_malloc_not_in_gc(objspace, "realloc");
-
-    void *mem;
-
-    if (!ptr) return objspace_xmalloc0(objspace, new_size);
-
-    /*
-     * The behavior of realloc(ptr, 0) is implementation defined.
-     * Therefore we don't use realloc(ptr, 0) for portability reason.
-     * see http://www.open-std.org/jtc1/sc22/wg14/www/docs/dr_400.htm
-     */
-    if (new_size == 0) {
-        if ((mem = objspace_xmalloc0(objspace, 0)) != NULL) {
-            /*
-             * - OpenBSD's malloc(3) man page says that when 0 is passed, it
-             *   returns a non-NULL pointer to an access-protected memory page.
-             *   The returned pointer cannot be read / written at all, but
-             *   still be a valid argument of free().
-             *
-             *   https://man.openbsd.org/malloc.3
-             *
-             * - Linux's malloc(3) man page says that it _might_ perhaps return
-             *   a non-NULL pointer when its argument is 0.  That return value
-             *   is safe (and is expected) to be passed to free().
-             *
-             *   https://man7.org/linux/man-pages/man3/malloc.3.html
-             *
-             * - As I read the implementation jemalloc's malloc() returns fully
-             *   normal 16 bytes memory region when its argument is 0.
-             *
-             * - As I read the implementation musl libc's malloc() returns
-             *   fully normal 32 bytes memory region when its argument is 0.
-             *
-             * - Other malloc implementations can also return non-NULL.
-             */
-            objspace_xfree(objspace, ptr, old_size);
-            return mem;
-        }
-        else {
-            /*
-             * It is dangerous to return NULL here, because that could lead to
-             * RCE.  Fallback to 1 byte instead of zero.
-             *
-             * https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2019-11932
-             */
-            new_size = 1;
-        }
-    }
-
-#if CALC_EXACT_MALLOC_SIZE
-    {
-        struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
-        new_size += sizeof(struct malloc_obj_info);
-        ptr = info;
-        old_size = info->size;
-    }
-#endif
-
-    old_size = objspace_malloc_size(objspace, ptr, old_size);
-    TRY_WITH_GC(new_size, mem = RB_GNUC_EXTENSION_BLOCK(realloc(ptr, new_size)));
-    new_size = objspace_malloc_size(objspace, mem, new_size);
-
-#if CALC_EXACT_MALLOC_SIZE
-    {
-        struct malloc_obj_info *info = mem;
-        info->size = new_size;
-        mem = info + 1;
-    }
-#endif
-
-    objspace_malloc_increase(objspace, mem, new_size, old_size, MEMOP_TYPE_REALLOC);
-
-    RB_DEBUG_COUNTER_INC(heap_xrealloc);
-    return mem;
-}
-
-#if CALC_EXACT_MALLOC_SIZE && USE_GC_MALLOC_OBJ_INFO_DETAILS
-
-#define MALLOC_INFO_GEN_SIZE 100
-#define MALLOC_INFO_SIZE_SIZE 10
-static size_t malloc_info_gen_cnt[MALLOC_INFO_GEN_SIZE];
-static size_t malloc_info_gen_size[MALLOC_INFO_GEN_SIZE];
-static size_t malloc_info_size[MALLOC_INFO_SIZE_SIZE+1];
-static st_table *malloc_info_file_table;
-
-static int
-mmalloc_info_file_i(st_data_t key, st_data_t val, st_data_t dmy)
-{
-    const char *file = (void *)key;
-    const size_t *data = (void *)val;
-
-    fprintf(stderr, "%s\t%"PRIdSIZE"\t%"PRIdSIZE"\n", file, data[0], data[1]);
-
-    return ST_CONTINUE;
-}
-
-__attribute__((destructor))
-void
-rb_malloc_info_show_results(void)
-{
-    int i;
-
-    fprintf(stderr, "* malloc_info gen statistics\n");
-    for (i=0; i<MALLOC_INFO_GEN_SIZE; i++) {
-        if (i == MALLOC_INFO_GEN_SIZE-1) {
-            fprintf(stderr, "more\t%"PRIdSIZE"\t%"PRIdSIZE"\n", malloc_info_gen_cnt[i], malloc_info_gen_size[i]);
-        }
-        else {
-            fprintf(stderr, "%d\t%"PRIdSIZE"\t%"PRIdSIZE"\n", i, malloc_info_gen_cnt[i], malloc_info_gen_size[i]);
-        }
-    }
-
-    fprintf(stderr, "* malloc_info size statistics\n");
-    for (i=0; i<MALLOC_INFO_SIZE_SIZE; i++) {
-        int s = 16 << i;
-        fprintf(stderr, "%d\t%"PRIdSIZE"\n", s, malloc_info_size[i]);
-    }
-    fprintf(stderr, "more\t%"PRIdSIZE"\n", malloc_info_size[i]);
-
-    if (malloc_info_file_table) {
-        fprintf(stderr, "* malloc_info file statistics\n");
-        st_foreach(malloc_info_file_table, mmalloc_info_file_i, 0);
-    }
-}
-#else
-void
-rb_malloc_info_show_results(void)
-{
-}
-#endif
-
-static void
-objspace_xfree(rb_objspace_t *objspace, void *ptr, size_t old_size)
-{
-    if (!ptr) {
-        /*
-         * ISO/IEC 9899 says "If ptr is a null pointer, no action occurs" since
-         * its first version.  We would better follow.
-         */
-        return;
-    }
-#if CALC_EXACT_MALLOC_SIZE
-    struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
-    ptr = info;
-    old_size = info->size;
-
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    {
-        int gen = (int)(objspace->profile.count - info->gen);
-        int gen_index = gen >= MALLOC_INFO_GEN_SIZE ? MALLOC_INFO_GEN_SIZE-1 : gen;
-        int i;
-
-        malloc_info_gen_cnt[gen_index]++;
-        malloc_info_gen_size[gen_index] += info->size;
-
-        for (i=0; i<MALLOC_INFO_SIZE_SIZE; i++) {
-            size_t s = 16 << i;
-            if (info->size <= s) {
-                malloc_info_size[i]++;
-                goto found;
-            }
-        }
-        malloc_info_size[i]++;
-      found:;
-
-        {
-            st_data_t key = (st_data_t)info->file, d;
-            size_t *data;
-
-            if (malloc_info_file_table == NULL) {
-                malloc_info_file_table = st_init_numtable_with_size(1024);
-            }
-            if (st_lookup(malloc_info_file_table, key, &d)) {
-                /* hit */
-                data = (size_t *)d;
-            }
-            else {
-                data = malloc(xmalloc2_size(2, sizeof(size_t)));
-                if (data == NULL) rb_bug("objspace_xfree: can not allocate memory");
-                data[0] = data[1] = 0;
-                st_insert(malloc_info_file_table, key, (st_data_t)data);
-            }
-            data[0] ++;
-            data[1] += info->size;
-        };
-        if (0 && gen >= 2) {         /* verbose output */
-            if (info->file) {
-                fprintf(stderr, "free - size:%"PRIdSIZE", gen:%d, pos: %s:%"PRIdSIZE"\n",
-                        info->size, gen, info->file, info->line);
-            }
-            else {
-                fprintf(stderr, "free - size:%"PRIdSIZE", gen:%d\n",
-                        info->size, gen);
-            }
-        }
-    }
-#endif
-#endif
-    old_size = objspace_malloc_size(objspace, ptr, old_size);
-
-    objspace_malloc_increase(objspace, ptr, 0, old_size, MEMOP_TYPE_FREE) {
-        free(ptr);
-        ptr = NULL;
-        RB_DEBUG_COUNTER_INC(heap_xfree);
-    }
-}
-
-static void *
-ruby_xmalloc0(size_t size)
-{
-    return objspace_xmalloc0(&rb_objspace, size);
-}
-
-void *
-ruby_xmalloc_body(size_t size)
-{
-    if ((ssize_t)size < 0) {
-        negative_size_allocation_error("too large allocation size");
-    }
-    return ruby_xmalloc0(size);
-}
-
-void
-ruby_malloc_size_overflow(size_t count, size_t elsize)
-{
-    rb_raise(rb_eArgError,
-             "malloc: possible integer overflow (%"PRIuSIZE"*%"PRIuSIZE")",
-             count, elsize);
-}
-
-void *
-ruby_xmalloc2_body(size_t n, size_t size)
-{
-    return objspace_xmalloc0(&rb_objspace, xmalloc2_size(n, size));
-}
-
-static void *
-objspace_xcalloc(rb_objspace_t *objspace, size_t size)
-{
-    if (UNLIKELY(malloc_during_gc_p(objspace))) {
-        rb_warn("calloc during GC detected, this could cause crashes if it triggers another GC");
-#if RGENGC_CHECK_MODE || RUBY_DEBUG
-        rb_bug("Cannot calloc during GC");
-#endif
-    }
-
-    void *mem;
-
-    size = objspace_malloc_prepare(objspace, size);
-    TRY_WITH_GC(size, mem = calloc1(size));
-    return objspace_malloc_fixup(objspace, mem, size);
-}
-
-void *
-ruby_xcalloc_body(size_t n, size_t size)
-{
-    return objspace_xcalloc(&rb_objspace, xmalloc2_size(n, size));
-}
-
-#ifdef ruby_sized_xrealloc
-#undef ruby_sized_xrealloc
-#endif
-void *
-ruby_sized_xrealloc(void *ptr, size_t new_size, size_t old_size)
-{
-    if ((ssize_t)new_size < 0) {
-        negative_size_allocation_error("too large allocation size");
-    }
-
-    return objspace_xrealloc(&rb_objspace, ptr, new_size, old_size);
-}
-
-void *
-ruby_xrealloc_body(void *ptr, size_t new_size)
-{
-    return ruby_sized_xrealloc(ptr, new_size, 0);
-}
-
-#ifdef ruby_sized_xrealloc2
-#undef ruby_sized_xrealloc2
-#endif
-void *
-ruby_sized_xrealloc2(void *ptr, size_t n, size_t size, size_t old_n)
-{
-    size_t len = xmalloc2_size(n, size);
-    return objspace_xrealloc(&rb_objspace, ptr, len, old_n * size);
-}
-
-void *
-ruby_xrealloc2_body(void *ptr, size_t n, size_t size)
-{
-    return ruby_sized_xrealloc2(ptr, n, size, 0);
-}
-
-#ifdef ruby_sized_xfree
-#undef ruby_sized_xfree
-#endif
-void
-ruby_sized_xfree(void *x, size_t size)
-{
-    if (LIKELY(x)) {
-        /* It's possible for a C extension's pthread destructor function set by pthread_key_create
-         * to be called after ruby_vm_destruct and attempt to free memory. Fall back to mimfree in
-         * that case. */
-        if (LIKELY(GET_VM())) {
-            objspace_xfree(&rb_objspace, x, size);
-        }
-        else {
-            ruby_mimfree(x);
-        }
-    }
-}
-
-void
-ruby_xfree(void *x)
-{
-    ruby_sized_xfree(x, 0);
-}
-
-void *
-rb_xmalloc_mul_add(size_t x, size_t y, size_t z) /* x * y + z */
-{
-    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
-    return ruby_xmalloc(w);
-}
-
-void *
-rb_xcalloc_mul_add(size_t x, size_t y, size_t z) /* x * y + z */
-{
-    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
-    return ruby_xcalloc(w, 1);
-}
-
-void *
-rb_xrealloc_mul_add(const void *p, size_t x, size_t y, size_t z) /* x * y + z */
-{
-    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
-    return ruby_xrealloc((void *)p, w);
-}
-
-void *
-rb_xmalloc_mul_add_mul(size_t x, size_t y, size_t z, size_t w) /* x * y + z * w */
-{
-    size_t u = size_mul_add_mul_or_raise(x, y, z, w, rb_eArgError);
-    return ruby_xmalloc(u);
-}
-
-void *
-rb_xcalloc_mul_add_mul(size_t x, size_t y, size_t z, size_t w) /* x * y + z * w */
-{
-    size_t u = size_mul_add_mul_or_raise(x, y, z, w, rb_eArgError);
-    return ruby_xcalloc(u, 1);
-}
-
-/* Mimic ruby_xmalloc, but need not rb_objspace.
- * should return pointer suitable for ruby_xfree
- */
-void *
-ruby_mimmalloc(size_t size)
-{
-    void *mem;
-#if CALC_EXACT_MALLOC_SIZE
-    size += sizeof(struct malloc_obj_info);
-#endif
-    mem = malloc(size);
-#if CALC_EXACT_MALLOC_SIZE
-    if (!mem) {
-        return NULL;
-    }
-    else
-    /* set 0 for consistency of allocated_size/allocations */
-    {
-        struct malloc_obj_info *info = mem;
-        info->size = 0;
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-        info->gen = 0;
-        info->file = NULL;
-        info->line = 0;
-#endif
-        mem = info + 1;
-    }
-#endif
-    return mem;
-}
-
-void *
-ruby_mimcalloc(size_t num, size_t size)
-{
-    void *mem;
-#if CALC_EXACT_MALLOC_SIZE
-    struct rbimpl_size_mul_overflow_tag t = rbimpl_size_mul_overflow(num, size);
-    if (UNLIKELY(t.left)) {
-        return NULL;
-    }
-    size = t.right + sizeof(struct malloc_obj_info);
-    mem = calloc1(size);
-    if (!mem) {
-        return NULL;
-    }
-    else
-    /* set 0 for consistency of allocated_size/allocations */
-    {
-        struct malloc_obj_info *info = mem;
-        info->size = 0;
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-        info->gen = 0;
-        info->file = NULL;
-        info->line = 0;
-#endif
-        mem = info + 1;
-    }
-#else
-    mem = calloc(num, size);
-#endif
-    return mem;
-}
-
-void
-ruby_mimfree(void *ptr)
-{
-#if CALC_EXACT_MALLOC_SIZE
-    struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
-    ptr = info;
-#endif
-    free(ptr);
-}
-
-#if MALLOC_ALLOCATED_SIZE
-/*
- *  call-seq:
- *     GC.malloc_allocated_size -> Integer
- *
- *  Returns the size of memory allocated by malloc().
- *
- *  Only available if ruby was built with +CALC_EXACT_MALLOC_SIZE+.
- */
-
-static VALUE
-gc_malloc_allocated_size(VALUE self)
-{
-    return UINT2NUM(rb_objspace.malloc_params.allocated_size);
-}
-
-/*
- *  call-seq:
- *     GC.malloc_allocations -> Integer
- *
- *  Returns the number of malloc() allocations.
- *
- *  Only available if ruby was built with +CALC_EXACT_MALLOC_SIZE+.
- */
-
-static VALUE
-gc_malloc_allocations(VALUE self)
-{
-    return UINT2NUM(rb_objspace.malloc_params.allocations);
-}
-#endif
-
-void
-rb_gc_adjust_memory_usage(ssize_t diff)
-{
-    unless_objspace(objspace) { return; }
-
-    if (diff > 0) {
-        objspace_malloc_increase(objspace, 0, diff, 0, MEMOP_TYPE_REALLOC);
-    }
-    else if (diff < 0) {
-        objspace_malloc_increase(objspace, 0, 0, -diff, MEMOP_TYPE_REALLOC);
-    }
-}
-
-/*
-  ------------------------------ GC profiler ------------------------------
-*/
-
-#define GC_PROFILE_RECORD_DEFAULT_SIZE 100
-
-static bool
-current_process_time(struct timespec *ts)
-{
-#if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_PROCESS_CPUTIME_ID)
-    {
-        static int try_clock_gettime = 1;
-        if (try_clock_gettime && clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ts) == 0) {
-            return true;
-        }
-        else {
-            try_clock_gettime = 0;
-        }
-    }
-#endif
-
-#ifdef RUSAGE_SELF
-    {
-        struct rusage usage;
-        struct timeval time;
-        if (getrusage(RUSAGE_SELF, &usage) == 0) {
-            time = usage.ru_utime;
-            ts->tv_sec = time.tv_sec;
-            ts->tv_nsec = (int32_t)time.tv_usec * 1000;
-            return true;
-        }
-    }
-#endif
-
-#ifdef _WIN32
-    {
-        FILETIME creation_time, exit_time, kernel_time, user_time;
-        ULARGE_INTEGER ui;
-
-        if (GetProcessTimes(GetCurrentProcess(),
-                            &creation_time, &exit_time, &kernel_time, &user_time) != 0) {
-            memcpy(&ui, &user_time, sizeof(FILETIME));
-#define PER100NSEC (uint64_t)(1000 * 1000 * 10)
-            ts->tv_nsec = (long)(ui.QuadPart % PER100NSEC);
-            ts->tv_sec  = (time_t)(ui.QuadPart / PER100NSEC);
-            return true;
-        }
-    }
-#endif
-
-    return false;
-}
-
-static double
-getrusage_time(void)
-{
-    struct timespec ts;
-    if (current_process_time(&ts)) {
-        return ts.tv_sec + ts.tv_nsec * 1e-9;
-    }
-    else {
-        return 0.0;
-    }
-}
-
-
-static inline void
-gc_prof_setup_new_record(rb_objspace_t *objspace, unsigned int reason)
-{
-    if (objspace->profile.run) {
-        size_t index = objspace->profile.next_index;
-        gc_profile_record *record;
-
-        /* create new record */
-        objspace->profile.next_index++;
-
-        if (!objspace->profile.records) {
-            objspace->profile.size = GC_PROFILE_RECORD_DEFAULT_SIZE;
-            objspace->profile.records = malloc(xmalloc2_size(sizeof(gc_profile_record), objspace->profile.size));
-        }
-        if (index >= objspace->profile.size) {
-            void *ptr;
-            objspace->profile.size += 1000;
-            ptr = realloc(objspace->profile.records, xmalloc2_size(sizeof(gc_profile_record), objspace->profile.size));
-            if (!ptr) rb_memerror();
-            objspace->profile.records = ptr;
-        }
-        if (!objspace->profile.records) {
-            rb_bug("gc_profile malloc or realloc miss");
-        }
-        record = objspace->profile.current_record = &objspace->profile.records[objspace->profile.next_index - 1];
-        MEMZERO(record, gc_profile_record, 1);
-
-        /* setup before-GC parameter */
-        record->flags = reason | (ruby_gc_stressful ? GPR_FLAG_STRESS : 0);
-#if MALLOC_ALLOCATED_SIZE
-        record->allocated_size = malloc_allocated_size;
-#endif
-#if GC_PROFILE_MORE_DETAIL && GC_PROFILE_DETAIL_MEMORY
-#ifdef RUSAGE_SELF
-        {
-            struct rusage usage;
-            if (getrusage(RUSAGE_SELF, &usage) == 0) {
-                record->maxrss = usage.ru_maxrss;
-                record->minflt = usage.ru_minflt;
-                record->majflt = usage.ru_majflt;
-            }
-        }
-#endif
-#endif
-    }
-}
-
-static inline void
-gc_prof_timer_start(rb_objspace_t *objspace)
-{
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-#if GC_PROFILE_MORE_DETAIL
-        record->prepare_time = objspace->profile.prepare_time;
-#endif
-        record->gc_time = 0;
-        record->gc_invoke_time = getrusage_time();
-    }
-}
-
-static double
-elapsed_time_from(double time)
-{
-    double now = getrusage_time();
-    if (now > time) {
-        return now - time;
-    }
-    else {
-        return 0;
-    }
-}
-
-static inline void
-gc_prof_timer_stop(rb_objspace_t *objspace)
-{
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->gc_time = elapsed_time_from(record->gc_invoke_time);
-        record->gc_invoke_time -= objspace->profile.invoke_time;
-    }
-}
-
-#define RUBY_DTRACE_GC_HOOK(name) \
-    do {if (RUBY_DTRACE_GC_##name##_ENABLED()) RUBY_DTRACE_GC_##name();} while (0)
-static inline void
-gc_prof_mark_timer_start(rb_objspace_t *objspace)
-{
-    RUBY_DTRACE_GC_HOOK(MARK_BEGIN);
-#if GC_PROFILE_MORE_DETAIL
-    if (gc_prof_enabled(objspace)) {
-        gc_prof_record(objspace)->gc_mark_time = getrusage_time();
-    }
-#endif
-}
-
-static inline void
-gc_prof_mark_timer_stop(rb_objspace_t *objspace)
-{
-    RUBY_DTRACE_GC_HOOK(MARK_END);
-#if GC_PROFILE_MORE_DETAIL
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->gc_mark_time = elapsed_time_from(record->gc_mark_time);
-    }
-#endif
-}
-
-static inline void
-gc_prof_sweep_timer_start(rb_objspace_t *objspace)
-{
-    RUBY_DTRACE_GC_HOOK(SWEEP_BEGIN);
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-
-        if (record->gc_time > 0 || GC_PROFILE_MORE_DETAIL) {
-            objspace->profile.gc_sweep_start_time = getrusage_time();
-        }
-    }
-}
-
-static inline void
-gc_prof_sweep_timer_stop(rb_objspace_t *objspace)
-{
-    RUBY_DTRACE_GC_HOOK(SWEEP_END);
-
-    if (gc_prof_enabled(objspace)) {
-        double sweep_time;
-        gc_profile_record *record = gc_prof_record(objspace);
-
-        if (record->gc_time > 0) {
-            sweep_time = elapsed_time_from(objspace->profile.gc_sweep_start_time);
-            /* need to accumulate GC time for lazy sweep after gc() */
-            record->gc_time += sweep_time;
-        }
-        else if (GC_PROFILE_MORE_DETAIL) {
-            sweep_time = elapsed_time_from(objspace->profile.gc_sweep_start_time);
-        }
-
-#if GC_PROFILE_MORE_DETAIL
-        record->gc_sweep_time += sweep_time;
-        if (heap_pages_deferred_final) record->flags |= GPR_FLAG_HAVE_FINALIZE;
-#endif
-        if (heap_pages_deferred_final) objspace->profile.latest_gc_info |= GPR_FLAG_HAVE_FINALIZE;
-    }
-}
-
-static inline void
-gc_prof_set_malloc_info(rb_objspace_t *objspace)
-{
-#if GC_PROFILE_MORE_DETAIL
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        record->allocate_increase = malloc_increase;
-        record->allocate_limit = malloc_limit;
-    }
-#endif
-}
-
-static inline void
-gc_prof_set_heap_info(rb_objspace_t *objspace)
-{
-    if (gc_prof_enabled(objspace)) {
-        gc_profile_record *record = gc_prof_record(objspace);
-        size_t live = objspace->profile.total_allocated_objects_at_gc_start - total_freed_objects(objspace);
-        size_t total = objspace->profile.heap_used_at_gc_start * HEAP_PAGE_OBJ_LIMIT;
-
-#if GC_PROFILE_MORE_DETAIL
-        record->heap_use_pages = objspace->profile.heap_used_at_gc_start;
-        record->heap_live_objects = live;
-        record->heap_free_objects = total - live;
-#endif
-
-        record->heap_total_objects = total;
-        record->heap_use_size = live * sizeof(RVALUE);
-        record->heap_total_size = total * sizeof(RVALUE);
-    }
-}
-
-/*
- *  call-seq:
- *    GC::Profiler.clear          -> nil
- *
- *  Clears the \GC profiler data.
- *
- */
-
-static VALUE
-gc_profile_clear(VALUE _)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    void *p = objspace->profile.records;
-    objspace->profile.records = NULL;
-    objspace->profile.size = 0;
-    objspace->profile.next_index = 0;
-    objspace->profile.current_record = 0;
-    free(p);
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     GC::Profiler.raw_data	-> [Hash, ...]
- *
- *  Returns an Array of individual raw profile data Hashes ordered
- *  from earliest to latest by +:GC_INVOKE_TIME+.
- *
- *  For example:
- *
- *    [
- *	{
- *	   :GC_TIME=>1.3000000000000858e-05,
- *	   :GC_INVOKE_TIME=>0.010634999999999999,
- *	   :HEAP_USE_SIZE=>289640,
- *	   :HEAP_TOTAL_SIZE=>588960,
- *	   :HEAP_TOTAL_OBJECTS=>14724,
- *	   :GC_IS_MARKED=>false
- *	},
- *      # ...
- *    ]
- *
- *  The keys mean:
- *
- *  +:GC_TIME+::
- *	Time elapsed in seconds for this GC run
- *  +:GC_INVOKE_TIME+::
- *	Time elapsed in seconds from startup to when the GC was invoked
- *  +:HEAP_USE_SIZE+::
- *	Total bytes of heap used
- *  +:HEAP_TOTAL_SIZE+::
- *	Total size of heap in bytes
- *  +:HEAP_TOTAL_OBJECTS+::
- *	Total number of objects
- *  +:GC_IS_MARKED+::
- *	Returns +true+ if the GC is in mark phase
- *
- *  If ruby was built with +GC_PROFILE_MORE_DETAIL+, you will also have access
- *  to the following hash keys:
- *
- *  +:GC_MARK_TIME+::
- *  +:GC_SWEEP_TIME+::
- *  +:ALLOCATE_INCREASE+::
- *  +:ALLOCATE_LIMIT+::
- *  +:HEAP_USE_PAGES+::
- *  +:HEAP_LIVE_OBJECTS+::
- *  +:HEAP_FREE_OBJECTS+::
- *  +:HAVE_FINALIZE+::
- *
- */
-
-static VALUE
-gc_profile_record_get(VALUE _)
-{
-    VALUE prof;
-    VALUE gc_profile = rb_ary_new();
-    size_t i;
-    rb_objspace_t *objspace = (&rb_objspace);
-
-    if (!objspace->profile.run) {
-        return Qnil;
-    }
-
-    for (i =0; i < objspace->profile.next_index; i++) {
-        gc_profile_record *record = &objspace->profile.records[i];
-
-        prof = rb_hash_new();
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_FLAGS")), gc_info_decode(objspace, rb_hash_new(), record->flags));
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_TIME")), DBL2NUM(record->gc_time));
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_INVOKE_TIME")), DBL2NUM(record->gc_invoke_time));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_USE_SIZE")), SIZET2NUM(record->heap_use_size));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_TOTAL_SIZE")), SIZET2NUM(record->heap_total_size));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_TOTAL_OBJECTS")), SIZET2NUM(record->heap_total_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("MOVED_OBJECTS")), SIZET2NUM(record->moved_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_IS_MARKED")), Qtrue);
-#if GC_PROFILE_MORE_DETAIL
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_MARK_TIME")), DBL2NUM(record->gc_mark_time));
-        rb_hash_aset(prof, ID2SYM(rb_intern("GC_SWEEP_TIME")), DBL2NUM(record->gc_sweep_time));
-        rb_hash_aset(prof, ID2SYM(rb_intern("ALLOCATE_INCREASE")), SIZET2NUM(record->allocate_increase));
-        rb_hash_aset(prof, ID2SYM(rb_intern("ALLOCATE_LIMIT")), SIZET2NUM(record->allocate_limit));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_USE_PAGES")), SIZET2NUM(record->heap_use_pages));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_LIVE_OBJECTS")), SIZET2NUM(record->heap_live_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_FREE_OBJECTS")), SIZET2NUM(record->heap_free_objects));
-
-        rb_hash_aset(prof, ID2SYM(rb_intern("REMOVING_OBJECTS")), SIZET2NUM(record->removing_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("EMPTY_OBJECTS")), SIZET2NUM(record->empty_objects));
-
-        rb_hash_aset(prof, ID2SYM(rb_intern("HAVE_FINALIZE")), RBOOL(record->flags & GPR_FLAG_HAVE_FINALIZE));
-#endif
-
-#if RGENGC_PROFILE > 0
-        rb_hash_aset(prof, ID2SYM(rb_intern("OLD_OBJECTS")), SIZET2NUM(record->old_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("REMEMBERED_NORMAL_OBJECTS")), SIZET2NUM(record->remembered_normal_objects));
-        rb_hash_aset(prof, ID2SYM(rb_intern("REMEMBERED_SHADY_OBJECTS")), SIZET2NUM(record->remembered_shady_objects));
-#endif
-        rb_ary_push(gc_profile, prof);
-    }
-
-    return gc_profile;
-}
-
-#if GC_PROFILE_MORE_DETAIL
-#define MAJOR_REASON_MAX 0x10
-
-static char *
-gc_profile_dump_major_reason(unsigned int flags, char *buff)
-{
-    unsigned int reason = flags & GPR_FLAG_MAJOR_MASK;
-    int i = 0;
-
-    if (reason == GPR_FLAG_NONE) {
-        buff[0] = '-';
-        buff[1] = 0;
-    }
-    else {
-#define C(x, s) \
-  if (reason & GPR_FLAG_MAJOR_BY_##x) { \
-      buff[i++] = #x[0]; \
-      if (i >= MAJOR_REASON_MAX) rb_bug("gc_profile_dump_major_reason: overflow"); \
-      buff[i] = 0; \
-  }
-        C(NOFREE, N);
-        C(OLDGEN, O);
-        C(SHADY,  S);
-#if RGENGC_ESTIMATE_OLDMALLOC
-        C(OLDMALLOC, M);
-#endif
-#undef C
-    }
-    return buff;
-}
-#endif
-
-static void
-gc_profile_dump_on(VALUE out, VALUE (*append)(VALUE, VALUE))
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    size_t count = objspace->profile.next_index;
-#ifdef MAJOR_REASON_MAX
-    char reason_str[MAJOR_REASON_MAX];
-#endif
-
-    if (objspace->profile.run && count /* > 1 */) {
-        size_t i;
-        const gc_profile_record *record;
-
-        append(out, rb_sprintf("GC %"PRIuSIZE" invokes.\n", objspace->profile.count));
-        append(out, rb_str_new_cstr("Index    Invoke Time(sec)       Use Size(byte)     Total Size(byte)         Total Object                    GC Time(ms)\n"));
-
-        for (i = 0; i < count; i++) {
-            record = &objspace->profile.records[i];
-            append(out, rb_sprintf("%5"PRIuSIZE" %19.3f %20"PRIuSIZE" %20"PRIuSIZE" %20"PRIuSIZE" %30.20f\n",
-                                   i+1, record->gc_invoke_time, record->heap_use_size,
-                                   record->heap_total_size, record->heap_total_objects, record->gc_time*1000));
-        }
-
-#if GC_PROFILE_MORE_DETAIL
-        const char *str = "\n\n" \
-                                    "More detail.\n" \
-                                    "Prepare Time = Previously GC's rest sweep time\n"
-                                    "Index Flags          Allocate Inc.  Allocate Limit"
-#if CALC_EXACT_MALLOC_SIZE
-                                    "  Allocated Size"
-#endif
-                                    "  Use Page     Mark Time(ms)    Sweep Time(ms)  Prepare Time(ms)  LivingObj    FreeObj RemovedObj   EmptyObj"
-#if RGENGC_PROFILE
-                                    " OldgenObj RemNormObj RemShadObj"
-#endif
-#if GC_PROFILE_DETAIL_MEMORY
-                                    " MaxRSS(KB) MinorFLT MajorFLT"
-#endif
-                                    "\n";
-        append(out, rb_str_new_cstr(str));
-
-        for (i = 0; i < count; i++) {
-            record = &objspace->profile.records[i];
-            append(out, rb_sprintf("%5"PRIuSIZE" %4s/%c/%6s%c %13"PRIuSIZE" %15"PRIuSIZE
-#if CALC_EXACT_MALLOC_SIZE
-                                   " %15"PRIuSIZE
-#endif
-                                   " %9"PRIuSIZE" %17.12f %17.12f %17.12f %10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE
-#if RGENGC_PROFILE
-                                   "%10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE
-#endif
-#if GC_PROFILE_DETAIL_MEMORY
-                                   "%11ld %8ld %8ld"
-#endif
-
-                                   "\n",
-                                   i+1,
-                                   gc_profile_dump_major_reason(record->flags, reason_str),
-                                   (record->flags & GPR_FLAG_HAVE_FINALIZE) ? 'F' : '.',
-                                   (record->flags & GPR_FLAG_NEWOBJ) ? "NEWOBJ" :
-                                   (record->flags & GPR_FLAG_MALLOC) ? "MALLOC" :
-                                   (record->flags & GPR_FLAG_METHOD) ? "METHOD" :
-                                   (record->flags & GPR_FLAG_CAPI)   ? "CAPI__" : "??????",
-                                   (record->flags & GPR_FLAG_STRESS) ? '!' : ' ',
-                                   record->allocate_increase, record->allocate_limit,
-#if CALC_EXACT_MALLOC_SIZE
-                                   record->allocated_size,
-#endif
-                                   record->heap_use_pages,
-                                   record->gc_mark_time*1000,
-                                   record->gc_sweep_time*1000,
-                                   record->prepare_time*1000,
-
-                                   record->heap_live_objects,
-                                   record->heap_free_objects,
-                                   record->removing_objects,
-                                   record->empty_objects
-#if RGENGC_PROFILE
-                                   ,
-                                   record->old_objects,
-                                   record->remembered_normal_objects,
-                                   record->remembered_shady_objects
-#endif
-#if GC_PROFILE_DETAIL_MEMORY
-                                   ,
-                                   record->maxrss / 1024,
-                                   record->minflt,
-                                   record->majflt
-#endif
-
-                       ));
-        }
-#endif
-    }
-}
-
-/*
- *  call-seq:
- *     GC::Profiler.result  -> String
- *
- *  Returns a profile data report such as:
- *
- *    GC 1 invokes.
- *    Index    Invoke Time(sec)       Use Size(byte)     Total Size(byte)         Total Object                    GC time(ms)
- *        1               0.012               159240               212940                10647         0.00000000000001530000
- */
-
-static VALUE
-gc_profile_result(VALUE _)
-{
-    VALUE str = rb_str_buf_new(0);
-    gc_profile_dump_on(str, rb_str_buf_append);
-    return str;
-}
-
-/*
- *  call-seq:
- *     GC::Profiler.report
- *     GC::Profiler.report(io)
- *
- *  Writes the GC::Profiler.result to <tt>$stdout</tt> or the given IO object.
- *
- */
-
-static VALUE
-gc_profile_report(int argc, VALUE *argv, VALUE self)
-{
-    VALUE out;
-
-    out = (!rb_check_arity(argc, 0, 1) ? rb_stdout : argv[0]);
-    gc_profile_dump_on(out, rb_io_write);
-
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *     GC::Profiler.total_time	-> float
- *
- *  The total time used for garbage collection in seconds
- */
-
-static VALUE
-gc_profile_total_time(VALUE self)
-{
-    double time = 0;
-    rb_objspace_t *objspace = &rb_objspace;
-
-    if (objspace->profile.run && objspace->profile.next_index > 0) {
-        size_t i;
-        size_t count = objspace->profile.next_index;
-
-        for (i = 0; i < count; i++) {
-            time += objspace->profile.records[i].gc_time;
-        }
-    }
-    return DBL2NUM(time);
-}
-
-/*
- *  call-seq:
- *    GC::Profiler.enabled?	-> true or false
- *
- *  The current status of \GC profile mode.
- */
-
-static VALUE
-gc_profile_enable_get(VALUE self)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    return RBOOL(objspace->profile.run);
-}
-
-/*
- *  call-seq:
- *    GC::Profiler.enable	-> nil
- *
- *  Starts the \GC profiler.
- *
- */
-
-static VALUE
-gc_profile_enable(VALUE _)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-    objspace->profile.run = TRUE;
-    objspace->profile.current_record = 0;
-    return Qnil;
-}
-
-/*
- *  call-seq:
- *    GC::Profiler.disable	-> nil
- *
- *  Stops the \GC profiler.
- *
- */
-
-static VALUE
-gc_profile_disable(VALUE _)
-{
-    rb_objspace_t *objspace = &rb_objspace;
-
-    objspace->profile.run = FALSE;
-    objspace->profile.current_record = 0;
-    return Qnil;
+    vm->gc.mark_func_data = &mfd;
+    rb_gc_save_machine_context();
+    rb_gc_mark_roots(vm->gc.objspace, &data.category);
+    vm->gc.mark_func_data = prev_mfd;
 }
 
 /*
@@ -13088,7 +4870,7 @@ rb_method_type_name(rb_method_type_t type)
 {
     switch (type) {
       case VM_METHOD_TYPE_ISEQ:           return "iseq";
-      case VM_METHOD_TYPE_ATTRSET:        return "attrest";
+      case VM_METHOD_TYPE_ATTRSET:        return "attrset";
       case VM_METHOD_TYPE_IVAR:           return "ivar";
       case VM_METHOD_TYPE_BMETHOD:        return "bmethod";
       case VM_METHOD_TYPE_ALIAS:          return "alias";
@@ -13152,24 +4934,26 @@ rb_raw_obj_info_common(char *const buff, const size_t buff_size, const VALUE obj
         }
     }
     else {
-        const int age = RVALUE_AGE_GET(obj);
-
-        if (is_pointer_to_heap(&rb_objspace, (void *)obj)) {
-            APPEND_F("%p [%d%s%s%s%s%s%s] %s ",
-                     (void *)obj, age,
-                     C(RVALUE_UNCOLLECTIBLE_BITMAP(obj),  "L"),
-                     C(RVALUE_MARK_BITMAP(obj),           "M"),
-                     C(RVALUE_PIN_BITMAP(obj),            "P"),
-                     C(RVALUE_MARKING_BITMAP(obj),        "R"),
-                     C(RVALUE_WB_UNPROTECTED_BITMAP(obj), "U"),
-                     C(rb_objspace_garbage_object_p(obj), "G"),
-                     obj_type_name(obj));
+        // const int age = RVALUE_AGE_GET(obj);
+
+        if (rb_gc_impl_pointer_to_heap_p(rb_gc_get_objspace(), (void *)obj)) {
+            APPEND_F("%p %s/", (void *)obj, obj_type_name(obj));
+            // TODO: fixme
+            // APPEND_F("%p [%d%s%s%s%s%s%s] %s ",
+            //          (void *)obj, age,
+            //          C(RVALUE_UNCOLLECTIBLE_BITMAP(obj),  "L"),
+            //          C(RVALUE_MARK_BITMAP(obj),           "M"),
+            //          C(RVALUE_PIN_BITMAP(obj),            "P"),
+            //          C(RVALUE_MARKING_BITMAP(obj),        "R"),
+            //          C(RVALUE_WB_UNPROTECTED_BITMAP(obj), "U"),
+            //          C(rb_objspace_garbage_object_p(obj), "G"),
+            //          obj_type_name(obj));
         }
         else {
             /* fake */
-            APPEND_F("%p [%dXXXX] %s",
-                     (void *)obj, age,
-                     obj_type_name(obj));
+            // APPEND_F("%p [%dXXXX] %s",
+            //          (void *)obj, age,
+            //          obj_type_name(obj));
         }
 
         if (internal_object_p(obj)) {
@@ -13179,21 +4963,19 @@ rb_raw_obj_info_common(char *const buff, const size_t buff_size, const VALUE obj
             APPEND_S("(temporary internal)");
         }
         else if (RTEST(RBASIC(obj)->klass)) {
-            VALUE class_path = rb_class_path_cached(RBASIC(obj)->klass);
+            VALUE class_path = rb_mod_name(RBASIC(obj)->klass);
             if (!NIL_P(class_path)) {
-                APPEND_F("(%s)", RSTRING_PTR(class_path));
+                APPEND_F("%s ", RSTRING_PTR(class_path));
             }
         }
-
-#if GC_DEBUG
-        APPEND_F("@%s:%d", GET_RVALUE_OVERHEAD(obj)->file, GET_RVALUE_OVERHEAD(obj)->line);
-#endif
     }
   end:
 
     return pos;
 }
 
+const char *rb_raw_obj_info(char *const buff, const size_t buff_size, VALUE obj);
+
 static size_t
 rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALUE obj, size_t pos)
 {
@@ -13209,22 +4991,29 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
                 APPEND_S("shared -> ");
                 rb_raw_obj_info(BUFF_ARGS, ARY_SHARED_ROOT(obj));
             }
-            else if (ARY_EMBED_P(obj)) {
-                APPEND_F("[%s%s] len: %ld (embed)",
-                         C(ARY_EMBED_P(obj),  "E"),
-                         C(ARY_SHARED_P(obj), "S"),
-                         RARRAY_LEN(obj));
-            }
             else {
-                APPEND_F("[%s%s] len: %ld, capa:%ld ptr:%p",
-                         C(ARY_EMBED_P(obj),  "E"),
+                APPEND_F("[%s%s%s] ",
+                         C(ARY_EMBED_P(obj), "E"),
                          C(ARY_SHARED_P(obj), "S"),
-                         RARRAY_LEN(obj),
-                         ARY_EMBED_P(obj) ? -1L : RARRAY(obj)->as.heap.aux.capa,
-                         (void *)RARRAY_CONST_PTR(obj));
+                         C(ARY_SHARED_ROOT_P(obj), "R"));
+
+                if (ARY_EMBED_P(obj)) {
+                    APPEND_F("len: %ld (embed)",
+                             RARRAY_LEN(obj));
+                }
+                else {
+                    APPEND_F("len: %ld, capa:%ld ptr:%p",
+                             RARRAY_LEN(obj),
+                             RARRAY(obj)->as.heap.aux.capa,
+                             (void *)RARRAY_CONST_PTR(obj));
+                }
             }
             break;
           case T_STRING: {
+            APPEND_F("[%s%s] ",
+                     C(FL_TEST(obj, RSTRING_FSTR), "F"),
+                     C(RB_OBJ_FROZEN(obj), "R"));
+
             if (STR_SHARED_P(obj)) {
                 APPEND_F(" [shared] len: %ld", RSTRING_LEN(obj));
             }
@@ -13248,7 +5037,7 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
             break;
           }
           case T_MOVED: {
-            APPEND_F("-> %p", (void*)rb_gc_location(obj));
+            APPEND_F("-> %p", (void*)gc_location_internal(rb_gc_get_objspace(), obj));
             break;
           }
           case T_HASH: {
@@ -13260,7 +5049,7 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
           case T_CLASS:
           case T_MODULE:
             {
-                VALUE class_path = rb_class_path_cached(obj);
+                VALUE class_path = rb_mod_name(obj);
                 if (!NIL_P(class_path)) {
                     APPEND_F("%s", RSTRING_PTR(class_path));
                 }
@@ -13271,7 +5060,7 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
             }
           case T_ICLASS:
             {
-                VALUE class_path = rb_class_path_cached(RBASIC_CLASS(obj));
+                VALUE class_path = rb_mod_name(RBASIC_CLASS(obj));
                 if (!NIL_P(class_path)) {
                     APPEND_F("src:%s", RSTRING_PTR(class_path));
                 }
@@ -13279,21 +5068,18 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
             }
           case T_OBJECT:
             {
-                if (rb_shape_obj_too_complex(obj)) {
-                    size_t hash_len = rb_st_table_size(ROBJECT_IV_HASH(obj));
-                    APPEND_F("(too_complex) len:%zu", hash_len);
-                }
-                else {
-                    uint32_t len = ROBJECT_IV_CAPACITY(obj);
-
-                    if (RANY(obj)->as.basic.flags & ROBJECT_EMBED) {
-                        APPEND_F("(embed) len:%d", len);
+                if (FL_TEST_RAW(obj, ROBJECT_HEAP)) {
+                    if (rb_obj_shape_complex_p(obj)) {
+                        size_t hash_len = rb_st_table_size(ROBJECT_FIELDS_HASH(obj));
+                        APPEND_F("(complex) len:%zu", hash_len);
                     }
                     else {
-                        VALUE *ptr = ROBJECT_IVPTR(obj);
-                        APPEND_F("len:%d ptr:%p", len, (void *)ptr);
+                        APPEND_F("(embed) len:%d capa:%d", RSHAPE_LEN(RBASIC_SHAPE_ID(obj)), ROBJECT_FIELDS_CAPACITY(obj));
                     }
                 }
+                else {
+                    APPEND_F("len:%d capa:%d ptr:%p", RSHAPE_LEN(RBASIC_SHAPE_ID(obj)), ROBJECT_FIELDS_CAPACITY(obj), (void *)ROBJECT_FIELDS(obj));
+                }
             }
             break;
           case T_DATA: {
@@ -13311,12 +5097,6 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
                     APPEND_F("r:%d", r->pub.id);
                 }
             }
-            else {
-                const char * const type_name = rb_objspace_data_type_name(obj);
-                if (type_name) {
-                    APPEND_F("%s", type_name);
-                }
-            }
             break;
           }
           case T_IMEMO: {
@@ -13325,7 +5105,7 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
             switch (imemo_type(obj)) {
               case imemo_ment:
                 {
-                    const rb_method_entry_t *me = &RANY(obj)->as.imemo.ment;
+                    const rb_method_entry_t *me = (const rb_method_entry_t *)obj;
 
                     APPEND_F(":%s (%s%s%s%s) type:%s aliased:%d owner:%p defined_class:%p",
                              rb_id2name(me->called_id),
@@ -13371,15 +5151,15 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
               case imemo_callcache:
                 {
                     const struct rb_callcache *cc = (const struct rb_callcache *)obj;
-                    VALUE class_path = cc->klass ? rb_class_path_cached(cc->klass) : Qnil;
+                    VALUE class_path = vm_cc_valid(cc) ? rb_mod_name(cc->klass) : Qnil;
                     const rb_callable_method_entry_t *cme = vm_cc_cme(cc);
 
                     APPEND_F("(klass:%s cme:%s%s (%p) call:%p",
-                             NIL_P(class_path) ? (cc->klass ? "??" : "<NULL>") : RSTRING_PTR(class_path),
+                             NIL_P(class_path) ? (vm_cc_valid(cc) ? "??" : "<NULL>") : RSTRING_PTR(class_path),
                              cme ? rb_id2name(cme->called_id) : "<NULL>",
                              cme ? (METHOD_ENTRY_INVALIDATED(cme) ? " [inv]" : "") : "",
                              (void *)cme,
-                             (void *)vm_cc_call(cc));
+                             (void *)(uintptr_t)vm_cc_call(cc));
                     break;
                 }
               default:
@@ -13397,15 +5177,58 @@ rb_raw_obj_info_buitin_type(char *const buff, const size_t buff_size, const VALU
 
 #undef C
 
+#ifdef RUBY_ASAN_ENABLED
+void
+rb_asan_poison_object(VALUE obj)
+{
+    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
+    asan_poison_memory_region(ptr, rb_gc_obj_slot_size(obj));
+}
+
+void
+rb_asan_unpoison_object(VALUE obj, bool newobj_p)
+{
+    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
+    asan_unpoison_memory_region(ptr, rb_gc_obj_slot_size(obj), newobj_p);
+}
+
+void *
+rb_asan_poisoned_object_p(VALUE obj)
+{
+    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
+    return __asan_region_is_poisoned(ptr, rb_gc_obj_slot_size(obj));
+}
+#endif
+
+static void
+raw_obj_info(char *const buff, const size_t buff_size, VALUE obj)
+{
+    size_t pos = rb_raw_obj_info_common(buff, buff_size, obj);
+    pos = rb_raw_obj_info_buitin_type(buff, buff_size, obj, pos);
+    if (pos >= buff_size) {} // truncated
+}
+
 const char *
 rb_raw_obj_info(char *const buff, const size_t buff_size, VALUE obj)
 {
-    asan_unpoisoning_object(obj) {
-        size_t pos = rb_raw_obj_info_common(buff, buff_size, obj);
-        pos = rb_raw_obj_info_buitin_type(buff, buff_size, obj, pos);
-        if (pos >= buff_size) {} // truncated
-    }
+    void *objspace = rb_gc_get_objspace();
 
+    if (SPECIAL_CONST_P(obj)) {
+        raw_obj_info(buff, buff_size, obj);
+    }
+    else if (!rb_gc_impl_pointer_to_heap_p(objspace, (const void *)obj)) {
+        snprintf(buff, buff_size, "out-of-heap:%p", (void *)obj);
+    }
+#if 0 // maybe no need to check it?
+    else if (0 && rb_gc_impl_garbage_object_p(objspace, obj)) {
+        snprintf(buff, buff_size, "garbage:%p", (void *)obj);
+    }
+#endif
+    else {
+        asan_unpoisoning_object(obj) {
+            raw_obj_info(buff, buff_size, obj);
+        }
+    }
     return buff;
 }
 
@@ -13413,19 +5236,13 @@ rb_raw_obj_info(char *const buff, const size_t buff_size, VALUE obj)
 #undef APPEND_F
 #undef BUFF_ARGS
 
-#if RGENGC_OBJ_INFO
-#define OBJ_INFO_BUFFERS_NUM  10
-#define OBJ_INFO_BUFFERS_SIZE 0x100
-static rb_atomic_t obj_info_buffers_index = 0;
-static char obj_info_buffers[OBJ_INFO_BUFFERS_NUM][OBJ_INFO_BUFFERS_SIZE];
-
 /* Increments *var atomically and resets *var to 0 when maxval is
  * reached. Returns the wraparound old *var value (0...maxval). */
 static rb_atomic_t
 atomic_inc_wraparound(rb_atomic_t *var, const rb_atomic_t maxval)
 {
     rb_atomic_t oldval = RUBY_ATOMIC_FETCH_ADD(*var, 1);
-    if (UNLIKELY(oldval >= maxval - 1)) { // wraparound *var
+    if (RB_UNLIKELY(oldval >= maxval - 1)) { // wraparound *var
         const rb_atomic_t newval = oldval + 1;
         RUBY_ATOMIC_CAS(*var, newval, newval % maxval);
         oldval %= maxval;
@@ -13436,37 +5253,395 @@ atomic_inc_wraparound(rb_atomic_t *var, const rb_atomic_t maxval)
 static const char *
 obj_info(VALUE obj)
 {
-    rb_atomic_t index = atomic_inc_wraparound(&obj_info_buffers_index, OBJ_INFO_BUFFERS_NUM);
-    char *const buff = obj_info_buffers[index];
-    return rb_raw_obj_info(buff, OBJ_INFO_BUFFERS_SIZE, obj);
+    if (RGENGC_OBJ_INFO) {
+        static struct {
+            rb_atomic_t index;
+            char buffers[10][0x100];
+        } info = {0};
+
+        rb_atomic_t index = atomic_inc_wraparound(&info.index, numberof(info.buffers));
+        char *const buff = info.buffers[index];
+        return rb_raw_obj_info(buff, sizeof(info.buffers[0]), obj);
+    }
+    return obj_type_name(obj);
 }
 
-static const char *
-obj_info_basic(VALUE obj)
+/*
+  ------------------------ Extended allocator ------------------------
+*/
+
+struct gc_raise_tag {
+    VALUE exc;
+    const char *fmt;
+    va_list *ap;
+};
+
+static void *
+gc_vraise(void *ptr)
 {
-    rb_atomic_t index = atomic_inc_wraparound(&obj_info_buffers_index, OBJ_INFO_BUFFERS_NUM);
-    char *const buff = obj_info_buffers[index];
+    struct gc_raise_tag *argv = ptr;
+    rb_vraise(argv->exc, argv->fmt, *argv->ap);
+    UNREACHABLE_RETURN(NULL);
+}
 
-    asan_unpoisoning_object(obj) {
-        rb_raw_obj_info_common(buff, OBJ_INFO_BUFFERS_SIZE, obj);
+static void
+gc_raise(VALUE exc, const char *fmt, ...)
+{
+    va_list ap;
+    va_start(ap, fmt);
+    struct gc_raise_tag argv = {
+        exc, fmt, &ap,
+    };
+
+    if (ruby_native_thread_p()) {
+        rb_thread_call_with_gvl(gc_vraise, &argv);
+        UNREACHABLE;
+    }
+    else {
+        /* Not in a ruby thread */
+        fprintf(stderr, "%s", "[FATAL] ");
+        vfprintf(stderr, fmt, ap);
     }
 
-    return buff;
+    va_end(ap);
+    abort();
 }
-#else
-static const char *
-obj_info(VALUE obj)
+
+NORETURN(static void negative_size_allocation_error(const char *));
+static void
+negative_size_allocation_error(const char *msg)
 {
-    return obj_type_name(obj);
+    gc_raise(rb_eNoMemError, "%s", msg);
 }
 
-static const char *
-obj_info_basic(VALUE obj)
+static void *
+ruby_memerror_body(void *dummy)
 {
-    return obj_type_name(obj);
+    rb_memerror();
+    return 0;
+}
+
+NORETURN(static void ruby_memerror(void));
+RBIMPL_ATTR_MAYBE_UNUSED()
+static void
+ruby_memerror(void)
+{
+    if (ruby_thread_has_gvl_p()) {
+        rb_memerror();
+    }
+    else {
+        if (ruby_native_thread_p()) {
+            rb_thread_call_with_gvl(ruby_memerror_body, 0);
+        }
+        else {
+            /* no ruby thread */
+            fprintf(stderr, "[FATAL] failed to allocate memory\n");
+        }
+    }
+
+    /* We have discussions whether we should die here; */
+    /* We might rethink about it later. */
+    exit(EXIT_FAILURE);
+}
+
+void
+rb_memerror(void)
+{
+    /* the `GET_VM()->special_exceptions` below assumes that
+     * the VM is reachable from the current thread.  We should
+     * definitely make sure of that. */
+    RUBY_ASSERT_ALWAYS(ruby_thread_has_gvl_p());
+
+    rb_execution_context_t *ec = GET_EC();
+    VALUE exc = GET_VM()->special_exceptions[ruby_error_nomemory];
+
+    if (!exc ||
+        rb_ec_raised_p(ec, RAISED_NOMEMORY) ||
+        rb_ec_vm_lock_rec(ec) != ec->tag->lock_rec) {
+        fprintf(stderr, "[FATAL] failed to allocate memory\n");
+        exit(EXIT_FAILURE);
+    }
+    if (rb_ec_raised_p(ec, RAISED_NOMEMORY)) {
+        rb_ec_raised_clear(ec);
+    }
+    else {
+        rb_ec_raised_set(ec, RAISED_NOMEMORY);
+        exc = ruby_vm_special_exception_copy(exc);
+    }
+    ec->errinfo = exc;
+    EC_JUMP_TAG(ec, TAG_RAISE);
+}
+
+bool
+rb_memerror_reentered(void)
+{
+    rb_execution_context_t *ec = GET_EC();
+    return (ec && rb_ec_raised_p(ec, RAISED_NOMEMORY));
+}
+
+static void *
+handle_malloc_failure(void *ptr)
+{
+    if (LIKELY(ptr)) {
+        return ptr;
+    }
+    else {
+        ruby_memerror();
+        UNREACHABLE_RETURN(ptr);
+    }
+}
+
+static void *ruby_xmalloc_body(size_t size);
+
+void *
+ruby_xmalloc(size_t size)
+{
+    return handle_malloc_failure(ruby_xmalloc_body(size));
+}
+
+static bool
+malloc_gc_allowed(void)
+{
+    rb_ractor_t *r = rb_current_ractor_raw(false);
+
+    return r == NULL || !r->malloc_gc_disabled;
+}
+
+static void *
+ruby_xmalloc_body(size_t size)
+{
+    if ((ssize_t)size < 0) {
+        negative_size_allocation_error("too large allocation size");
+    }
+
+    return rb_gc_impl_malloc(rb_gc_get_objspace(), size, malloc_gc_allowed());
+}
+
+void
+ruby_malloc_size_overflow(size_t count, size_t elsize)
+{
+    rb_raise(rb_eArgError,
+             "malloc: possible integer overflow (%"PRIuSIZE"*%"PRIuSIZE")",
+             count, elsize);
+}
+
+void
+ruby_malloc_add_size_overflow(size_t x, size_t y)
+{
+    rb_raise(rb_eArgError,
+             "malloc: possible integer overflow (%"PRIuSIZE"+%"PRIuSIZE")",
+             x, y);
+}
+
+static void *ruby_xmalloc2_body(size_t n, size_t size);
+
+void *
+ruby_xmalloc2(size_t n, size_t size)
+{
+    return handle_malloc_failure(ruby_xmalloc2_body(n, size));
+}
+
+static void *
+ruby_xmalloc2_body(size_t n, size_t size)
+{
+    return rb_gc_impl_malloc(rb_gc_get_objspace(), xmalloc2_size(n, size), malloc_gc_allowed());
+}
+
+static void *ruby_xcalloc_body(size_t n, size_t size);
+
+void *
+ruby_xcalloc(size_t n, size_t size)
+{
+    return handle_malloc_failure(ruby_xcalloc_body(n, size));
+}
+
+static void *
+ruby_xcalloc_body(size_t n, size_t size)
+{
+    return rb_gc_impl_calloc(rb_gc_get_objspace(), xmalloc2_size(n, size), malloc_gc_allowed());
+}
+
+static void *ruby_xrealloc_sized_body(void *ptr, size_t new_size, size_t old_size);
+
+#ifdef ruby_xrealloc_sized
+#undef ruby_xrealloc_sized
+#endif
+void *
+ruby_xrealloc_sized(void *ptr, size_t new_size, size_t old_size)
+{
+    return handle_malloc_failure(ruby_xrealloc_sized_body(ptr, new_size, old_size));
+}
+
+static void *
+ruby_xrealloc_sized_body(void *ptr, size_t new_size, size_t old_size)
+{
+    if ((ssize_t)new_size < 0) {
+        negative_size_allocation_error("too large allocation size");
+    }
+
+    return rb_gc_impl_realloc(rb_gc_get_objspace(), ptr, new_size, old_size, malloc_gc_allowed());
+}
+
+void *
+ruby_xrealloc(void *ptr, size_t new_size)
+{
+    return ruby_xrealloc_sized(ptr, new_size, 0);
+}
+
+static void *ruby_xrealloc2_sized_body(void *ptr, size_t n, size_t size, size_t old_n);
+
+#ifdef ruby_xrealloc2_sized
+#undef ruby_xrealloc2_sized
+#endif
+void *
+ruby_xrealloc2_sized(void *ptr, size_t n, size_t size, size_t old_n)
+{
+    return handle_malloc_failure(ruby_xrealloc2_sized_body(ptr, n, size, old_n));
+}
+
+static void *
+ruby_xrealloc2_sized_body(void *ptr, size_t n, size_t size, size_t old_n)
+{
+    size_t len = xmalloc2_size(n, size);
+    return rb_gc_impl_realloc(rb_gc_get_objspace(), ptr, len, old_n * size, malloc_gc_allowed());
+}
+
+void *
+ruby_xrealloc2(void *ptr, size_t n, size_t size)
+{
+    return ruby_xrealloc2_sized(ptr, n, size, 0);
+}
+
+#ifdef ruby_xfree_sized
+#undef ruby_xfree_sized
+#endif
+void
+ruby_xfree_sized(void *x, size_t size)
+{
+    if (LIKELY(x)) {
+        /* It's possible for a C extension's pthread destructor function set by pthread_key_create
+         * to be called after ruby_vm_destruct and attempt to free memory. Fall back to mimfree in
+         * that case. */
+        if (LIKELY(GET_VM())) {
+            rb_gc_impl_free(rb_gc_get_objspace(), x, size);
+        }
+        else {
+            ruby_mimfree(x);
+        }
+    }
+}
+
+void
+ruby_xfree(void *x)
+{
+    ruby_xfree_sized(x, 0);
+}
+
+void *
+rb_xmalloc_mul_add(size_t x, size_t y, size_t z) /* x * y + z */
+{
+    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
+    return ruby_xmalloc(w);
+}
+
+void *
+rb_xcalloc_mul_add(size_t x, size_t y, size_t z) /* x * y + z */
+{
+    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
+    return ruby_xcalloc(w, 1);
+}
+
+void *
+rb_xrealloc_mul_add(const void *p, size_t x, size_t y, size_t z) /* x * y + z */
+{
+    size_t w = size_mul_add_or_raise(x, y, z, rb_eArgError);
+    return ruby_xrealloc((void *)p, w);
+}
+
+void *
+rb_xmalloc_mul_add_mul(size_t x, size_t y, size_t z, size_t w) /* x * y + z * w */
+{
+    size_t u = size_mul_add_mul_or_raise(x, y, z, w, rb_eArgError);
+    return ruby_xmalloc(u);
+}
+
+void *
+rb_xcalloc_mul_add_mul(size_t x, size_t y, size_t z, size_t w) /* x * y + z * w */
+{
+    size_t u = size_mul_add_mul_or_raise(x, y, z, w, rb_eArgError);
+    return ruby_xcalloc(u, 1);
+}
+
+/* Mimic ruby_xmalloc, but need not rb_objspace.
+ * should return pointer suitable for ruby_xfree
+ */
+void *
+ruby_mimmalloc(size_t size)
+{
+    void *mem;
+#if CALC_EXACT_MALLOC_SIZE
+    size += sizeof(struct malloc_obj_info);
+#endif
+    mem = malloc(size);
+#if CALC_EXACT_MALLOC_SIZE
+    if (!mem) {
+        return NULL;
+    }
+    else
+    /* set 0 for consistency of allocated_size/allocations */
+    {
+        struct malloc_obj_info *info = mem;
+        info->size = 0;
+        mem = info + 1;
+    }
+#endif
+    return mem;
+}
+
+void *
+ruby_mimcalloc(size_t num, size_t size)
+{
+    void *mem;
+#if CALC_EXACT_MALLOC_SIZE
+    struct rbimpl_size_overflow_tag t = rbimpl_size_mul_overflow(num, size);
+    if (UNLIKELY(t.overflowed)) {
+        return NULL;
+    }
+    size = t.result + sizeof(struct malloc_obj_info);
+    mem = calloc1(size);
+    if (!mem) {
+        return NULL;
+    }
+    else
+    /* set 0 for consistency of allocated_size/allocations */
+    {
+        struct malloc_obj_info *info = mem;
+        info->size = 0;
+        mem = info + 1;
+    }
+#else
+    mem = calloc(num, size);
+#endif
+    return mem;
 }
 
+void
+ruby_mimfree(void *ptr)
+{
+#if CALC_EXACT_MALLOC_SIZE
+    struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
+    ptr = info;
 #endif
+    free(ptr);
+}
+
+void
+rb_gc_adjust_memory_usage(ssize_t diff)
+{
+    unless_objspace(objspace) { return; }
+
+    rb_gc_impl_adjust_memory_usage(objspace, diff);
+}
 
 const char *
 rb_obj_info(VALUE obj)
@@ -13488,104 +5663,90 @@ rb_obj_info_dump_loc(VALUE obj, const char *file, int line, const char *func)
     fprintf(stderr, "<OBJ_INFO:%s@%s:%d> %s\n", func, file, line, rb_raw_obj_info(buff, 0x100, obj));
 }
 
-#if GC_DEBUG
-
 void
-rb_gcdebug_print_obj_condition(VALUE obj)
+rb_gc_before_fork(void)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-
-    fprintf(stderr, "created at: %s:%d\n", GET_RVALUE_OVERHEAD(obj)->file, GET_RVALUE_OVERHEAD(obj)->line);
-
-    if (BUILTIN_TYPE(obj) == T_MOVED) {
-        fprintf(stderr, "moved?: true\n");
-    }
-    else {
-        fprintf(stderr, "moved?: false\n");
-    }
-    if (is_pointer_to_heap(objspace, (void *)obj)) {
-        fprintf(stderr, "pointer to heap?: true\n");
-    }
-    else {
-        fprintf(stderr, "pointer to heap?: false\n");
-        return;
-    }
-
-    fprintf(stderr, "marked?      : %s\n", MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj) ? "true" : "false");
-    fprintf(stderr, "pinned?      : %s\n", MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj) ? "true" : "false");
-    fprintf(stderr, "age?         : %d\n", RVALUE_AGE_GET(obj));
-    fprintf(stderr, "old?         : %s\n", RVALUE_OLD_P(obj) ? "true" : "false");
-    fprintf(stderr, "WB-protected?: %s\n", RVALUE_WB_UNPROTECTED(obj) ? "false" : "true");
-    fprintf(stderr, "remembered?  : %s\n", RVALUE_REMEMBERED(obj) ? "true" : "false");
+    rb_gc_impl_before_fork(rb_gc_get_objspace());
+}
 
-    if (is_lazy_sweeping(objspace)) {
-        fprintf(stderr, "lazy sweeping?: true\n");
-        fprintf(stderr, "page swept?: %s\n", GET_HEAP_PAGE(obj)->flags.before_sweep ? "false" : "true");
-    }
-    else {
-        fprintf(stderr, "lazy sweeping?: false\n");
-    }
+void
+rb_gc_after_fork(rb_pid_t pid)
+{
+    rb_gc_impl_after_fork(rb_gc_get_objspace(), pid);
 }
 
-static VALUE
-gcdebug_sentinel(RB_BLOCK_CALL_FUNC_ARGLIST(obj, name))
+bool
+rb_gc_obj_shareable_p(VALUE obj)
 {
-    fprintf(stderr, "WARNING: object %s(%p) is inadvertently collected\n", (char *)name, (void *)obj);
-    return Qnil;
+    return RB_OBJ_SHAREABLE_P(obj);
 }
 
 void
-rb_gcdebug_sentinel(VALUE obj, const char *name)
+rb_gc_rp(VALUE obj)
 {
-    rb_define_finalizer(obj, rb_proc_new(gcdebug_sentinel, (VALUE)name));
+    rp(obj);
 }
 
-#endif /* GC_DEBUG */
+struct check_shareable_data {
+    VALUE parent;
+    long err_count;
+};
 
-/* :nodoc:
- *
- *  call-seq:
- *    GC.add_stress_to_class(class[, ...])
- *
- *  Raises NoMemoryError when allocating an instance of the given classes.
- *
- */
-static VALUE
-rb_gcdebug_add_stress_to_class(int argc, VALUE *argv, VALUE self)
+static void
+check_shareable_i(const VALUE child, void *ptr)
 {
-    rb_objspace_t *objspace = &rb_objspace;
+    struct check_shareable_data *data = (struct check_shareable_data *)ptr;
+
+    if (!rb_gc_obj_shareable_p(child)) {
+        fprintf(stderr, "(a) ");
+        rb_gc_rp(data->parent);
+        fprintf(stderr, "(b) ");
+        rb_gc_rp(child);
+        fprintf(stderr, "check_shareable_i: shareable (a) -> unshareable (b)\n");
 
-    if (!stress_to_class) {
-        set_stress_to_class(rb_ary_hidden_new(argc));
+        data->err_count++;
+        rb_bug("!! violate shareable constraint !!");
     }
-    rb_ary_cat(stress_to_class, argv, argc);
-    return self;
 }
 
-/* :nodoc:
- *
- *  call-seq:
- *    GC.remove_stress_to_class(class[, ...])
- *
- *  No longer raises NoMemoryError when allocating an instance of the
- *  given classes.
- *
- */
-static VALUE
-rb_gcdebug_remove_stress_to_class(int argc, VALUE *argv, VALUE self)
+static bool gc_checking_shareable = false;
+
+static void
+gc_verify_shareable(void *objspace, VALUE obj, void *data)
 {
-    rb_objspace_t *objspace = &rb_objspace;
-    int i;
+    // while gc_checking_shareable is true,
+    // other Ractors should not run the GC, until the flag is not local.
+    // TODO: remove VM locking if the flag is Ractor local
 
-    if (stress_to_class) {
-        for (i = 0; i < argc; ++i) {
-            rb_ary_delete_same(stress_to_class, argv[i]);
-        }
-        if (RARRAY_LEN(stress_to_class) == 0) {
-            set_stress_to_class(0);
-        }
+    unsigned int lev = RB_GC_VM_LOCK();
+    {
+        gc_checking_shareable = true;
+        rb_objspace_reachable_objects_from(obj, check_shareable_i, (void *)data);
+        gc_checking_shareable = false;
+    }
+    RB_GC_VM_UNLOCK(lev);
+}
+
+// TODO: only one level (non-recursive)
+void
+rb_gc_verify_shareable(VALUE obj)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    struct check_shareable_data data = {
+        .parent = obj,
+        .err_count = 0,
+    };
+    gc_verify_shareable(objspace, obj, &data);
+
+    if (data.err_count > 0) {
+        rb_bug("rb_gc_verify_shareable");
     }
-    return Qnil;
+}
+
+bool
+rb_gc_checking_shareable(void)
+{
+    return gc_checking_shareable;
 }
 
 /*
@@ -13638,50 +5799,14 @@ rb_gcdebug_remove_stress_to_class(int argc, VALUE *argv, VALUE self)
 void
 Init_GC(void)
 {
-#if USE_SHARED_GC
-    if (getenv(RUBY_GC_LIBRARY_PATH) != NULL && !dln_supported_p()) {
-        rb_warn(RUBY_GC_LIBRARY_PATH " is ignored because this executable file can't load extension libraries");
-    }
-#endif
-
 #undef rb_intern
-    malloc_offset = gc_compute_malloc_offset();
+    rb_gc_register_address(&id2ref_value);
 
-    VALUE rb_mObjSpace;
-    VALUE rb_mProfiler;
-    VALUE gc_constants;
+    malloc_offset = gc_compute_malloc_offset();
 
     rb_mGC = rb_define_module("GC");
 
-    gc_constants = rb_hash_new();
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("DEBUG")), RBOOL(GC_DEBUG));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("BASE_SLOT_SIZE")), SIZET2NUM(BASE_SLOT_SIZE - RVALUE_OVERHEAD));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OVERHEAD")), SIZET2NUM(RVALUE_OVERHEAD));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_SIZE")), SIZET2NUM(BASE_SLOT_SIZE));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_PAGE_OBJ_LIMIT")), SIZET2NUM(HEAP_PAGE_OBJ_LIMIT));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_PAGE_BITMAP_SIZE")), SIZET2NUM(HEAP_PAGE_BITMAP_SIZE));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_PAGE_SIZE")), SIZET2NUM(HEAP_PAGE_SIZE));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("SIZE_POOL_COUNT")), LONG2FIX(SIZE_POOL_COUNT));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVARGC_MAX_ALLOCATE_SIZE")), LONG2FIX(size_pool_slot_size(SIZE_POOL_COUNT - 1)));
-    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OLD_AGE")), LONG2FIX(RVALUE_OLD_AGE));
-    if (RB_BUG_INSTEAD_OF_RB_MEMERROR+0) {
-        rb_hash_aset(gc_constants, ID2SYM(rb_intern("RB_BUG_INSTEAD_OF_RB_MEMERROR")), Qtrue);
-    }
-    OBJ_FREEZE(gc_constants);
-    /* Internal constants in the garbage collector. */
-    rb_define_const(rb_mGC, "INTERNAL_CONSTANTS", gc_constants);
-
-    rb_mProfiler = rb_define_module_under(rb_mGC, "Profiler");
-    rb_define_singleton_method(rb_mProfiler, "enabled?", gc_profile_enable_get, 0);
-    rb_define_singleton_method(rb_mProfiler, "enable", gc_profile_enable, 0);
-    rb_define_singleton_method(rb_mProfiler, "raw_data", gc_profile_record_get, 0);
-    rb_define_singleton_method(rb_mProfiler, "disable", gc_profile_disable, 0);
-    rb_define_singleton_method(rb_mProfiler, "clear", gc_profile_clear, 0);
-    rb_define_singleton_method(rb_mProfiler, "result", gc_profile_result, 0);
-    rb_define_singleton_method(rb_mProfiler, "report", gc_profile_report, -1);
-    rb_define_singleton_method(rb_mProfiler, "total_time", gc_profile_total_time, 0);
-
-    rb_mObjSpace = rb_define_module("ObjectSpace");
+    VALUE rb_mObjSpace = rb_define_module("ObjectSpace");
 
     rb_define_module_function(rb_mObjSpace, "each_object", os_each_obj, -1);
 
@@ -13697,118 +5822,38 @@ Init_GC(void)
 
     rb_define_module_function(rb_mObjSpace, "count_objects", count_objects, -1);
 
-    /* internal methods */
-    rb_define_singleton_method(rb_mGC, "verify_internal_consistency", gc_verify_internal_consistency_m, 0);
-#if MALLOC_ALLOCATED_SIZE
-    rb_define_singleton_method(rb_mGC, "malloc_allocated_size", gc_malloc_allocated_size, 0);
-    rb_define_singleton_method(rb_mGC, "malloc_allocations", gc_malloc_allocations, 0);
-#endif
-
-    if (GC_COMPACTION_SUPPORTED) {
-        rb_define_singleton_method(rb_mGC, "compact", gc_compact, 0);
-        rb_define_singleton_method(rb_mGC, "auto_compact", gc_get_auto_compact, 0);
-        rb_define_singleton_method(rb_mGC, "auto_compact=", gc_set_auto_compact, 1);
-        rb_define_singleton_method(rb_mGC, "latest_compact_info", gc_compact_stats, 0);
-    }
-    else {
-        rb_define_singleton_method(rb_mGC, "compact", rb_f_notimplement, 0);
-        rb_define_singleton_method(rb_mGC, "auto_compact", rb_f_notimplement, 0);
-        rb_define_singleton_method(rb_mGC, "auto_compact=", rb_f_notimplement, 1);
-        rb_define_singleton_method(rb_mGC, "latest_compact_info", rb_f_notimplement, 0);
-        /* When !GC_COMPACTION_SUPPORTED, this method is not defined in gc.rb */
-        rb_define_singleton_method(rb_mGC, "verify_compaction_references", rb_f_notimplement, -1);
-    }
-
-    if (GC_DEBUG_STRESS_TO_CLASS) {
-        rb_define_singleton_method(rb_mGC, "add_stress_to_class", rb_gcdebug_add_stress_to_class, -1);
-        rb_define_singleton_method(rb_mGC, "remove_stress_to_class", rb_gcdebug_remove_stress_to_class, -1);
-    }
-
-    {
-        VALUE opts;
-        /* \GC build options */
-        rb_define_const(rb_mGC, "OPTS", opts = rb_ary_new());
-#define OPT(o) if (o) rb_ary_push(opts, rb_fstring_lit(#o))
-        OPT(GC_DEBUG);
-        OPT(USE_RGENGC);
-        OPT(RGENGC_DEBUG);
-        OPT(RGENGC_CHECK_MODE);
-        OPT(RGENGC_PROFILE);
-        OPT(RGENGC_ESTIMATE_OLDMALLOC);
-        OPT(GC_PROFILE_MORE_DETAIL);
-        OPT(GC_ENABLE_LAZY_SWEEP);
-        OPT(CALC_EXACT_MALLOC_SIZE);
-        OPT(MALLOC_ALLOCATED_SIZE);
-        OPT(MALLOC_ALLOCATED_SIZE_CHECK);
-        OPT(GC_PROFILE_DETAIL_MEMORY);
-        OPT(GC_COMPACTION_SUPPORTED);
-#undef OPT
-        OBJ_FREEZE(opts);
-    }
-}
-
-#ifdef ruby_xmalloc
-#undef ruby_xmalloc
-#endif
-#ifdef ruby_xmalloc2
-#undef ruby_xmalloc2
-#endif
-#ifdef ruby_xcalloc
-#undef ruby_xcalloc
-#endif
-#ifdef ruby_xrealloc
-#undef ruby_xrealloc
-#endif
-#ifdef ruby_xrealloc2
-#undef ruby_xrealloc2
-#endif
-
-void *
-ruby_xmalloc(size_t size)
-{
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    ruby_malloc_info_file = __FILE__;
-    ruby_malloc_info_line = __LINE__;
-#endif
-    return ruby_xmalloc_body(size);
-}
-
-void *
-ruby_xmalloc2(size_t n, size_t size)
-{
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    ruby_malloc_info_file = __FILE__;
-    ruby_malloc_info_line = __LINE__;
-#endif
-    return ruby_xmalloc2_body(n, size);
-}
-
-void *
-ruby_xcalloc(size_t n, size_t size)
-{
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    ruby_malloc_info_file = __FILE__;
-    ruby_malloc_info_line = __LINE__;
-#endif
-    return ruby_xcalloc_body(n, size);
-}
-
-void *
-ruby_xrealloc(void *ptr, size_t new_size)
-{
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    ruby_malloc_info_file = __FILE__;
-    ruby_malloc_info_line = __LINE__;
-#endif
-    return ruby_xrealloc_body(ptr, new_size);
-}
-
-void *
-ruby_xrealloc2(void *ptr, size_t n, size_t new_size)
-{
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-    ruby_malloc_info_file = __FILE__;
-    ruby_malloc_info_line = __LINE__;
+    rb_gc_impl_init();
+}
+
+// Set a name for the anonymous virtual memory area. `addr` is the starting
+// address of the area and `size` is its length in bytes. `name` is a
+// NUL-terminated human-readable string.
+//
+// This function is usually called after calling `mmap()`.  The human-readable
+// annotation helps developers identify the call site of `mmap()` that created
+// the memory mapping.
+//
+// This function currently only works on Linux 5.17 or higher.  After calling
+// this function, we can see annotations in the form of "[anon:...]" in
+// `/proc/self/maps`, where `...` is the content of `name`.  This function has
+// no effect when called on other platforms.
+void
+ruby_annotate_mmap(const void *addr, unsigned long size, const char *name)
+{
+#if defined(HAVE_SYS_PRCTL_H) && defined(PR_SET_VMA) && defined(PR_SET_VMA_ANON_NAME)
+    // The name length cannot exceed 80 (including the '\0').
+    RUBY_ASSERT(strlen(name) < 80);
+    prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, (unsigned long)addr, size, name);
+    // We ignore errors in prctl. prctl may set errno to EINVAL for several
+    // reasons.
+    // 1. The attr (PR_SET_VMA_ANON_NAME) is not a valid attribute.
+    // 2. addr is an invalid address.
+    // 3. The string pointed by name is too long.
+    // The first error indicates PR_SET_VMA_ANON_NAME is not available, and may
+    // happen if we run the compiled binary on an old kernel.  In theory, all
+    // other errors should result in a failure.  But since EINVAL cannot tell
+    // the first error from others, and this function is mainly used for
+    // debugging, we silently ignore the error.
+    errno = 0;
 #endif
-    return ruby_xrealloc2_body(ptr, n, new_size);
 }
diff --git a/gc.rb b/gc.rb
index 880aa46475..48bed27880 100644
--- a/gc.rb
+++ b/gc.rb
@@ -1,40 +1,45 @@
 # for gc.c
 
-#  The \GC module provides an interface to Ruby's mark and
-#  sweep garbage collection mechanism.
+#  The \GC module provides an interface to Ruby's mark-and-sweep garbage collection mechanism.
 #
-#  Some of the underlying methods are also available via the ObjectSpace
-#  module.
+#  Some of the underlying methods are also available via the ObjectSpace module.
 #
-#  You may obtain information about the operation of the \GC through
-#  GC::Profiler.
+#  You may obtain information about the operation of the \GC through GC::Profiler.
 module GC
 
-  # Initiates garbage collection, even if manually disabled.
-  #
-  # The +full_mark+ keyword argument determines whether or not to perform a
-  # major garbage collection cycle. When set to +true+, a major garbage
-  # collection cycle is ran, meaning all objects are marked. When set to
-  # +false+, a minor garbage collection cycle is ran, meaning only young
-  # objects are marked.
-  #
-  # The +immediate_mark+ keyword argument determines whether or not to perform
-  # incremental marking. When set to +true+, marking is completed during the
-  # call to this method. When set to +false+, marking is performed in steps
-  # that is interleaved with future Ruby code execution, so marking might not
-  # be completed during this method call. Note that if +full_mark+ is +false+
-  # then marking will always be immediate, regardless of the value of
-  # +immediate_mark+.
-  #
-  # The +immediate_sweep+ keyword argument determines whether or not to defer
-  # sweeping (using lazy sweep). When set to +false+, sweeping is performed in
-  # steps that is interleaved with future Ruby code execution, so sweeping might
-  # not be completed during this method call. When set to +true+, sweeping is
-  # completed during the call to this method.
-  #
-  # Note: These keyword arguments are implementation and version dependent. They
-  # are not guaranteed to be future-compatible, and may be ignored if the
-  # underlying implementation does not support them.
+  # Initiates garbage collection, even if explicitly disabled by GC.disable.
+  #
+  # Keyword arguments:
+  #
+  # - +full_mark+:
+  #   its boolean value determines whether to perform a major garbage collection cycle:
+  #
+  #   - +true+: initiates a major garbage collection cycle,
+  #     meaning all objects (old and new) are marked.
+  #   - +false+: initiates a minor garbage collection cycle,
+  #     meaning only young objects are marked.
+  #
+  # - +immediate_mark+:
+  #   its boolean value determines whether to perform incremental marking:
+  #
+  #   - +true+: marking is completed before the method returns.
+  #   - +false+: marking is performed by parts,
+  #     interleaved with program execution both before the method returns and afterward;
+  #     therefore marking may not be completed before the return.
+  #     Note that if +full_mark+ is +false+, marking will always be immediate,
+  #     regardless of the value of +immediate_mark+.
+  #
+  # - +immediate_sweep+:
+  #   its boolean value determines whether to defer sweeping (using lazy sweep):
+  #
+  #   - +true+: sweeping is completed before the method returns.
+  #   - +false+: sweeping is performed by parts,
+  #     interleaved with program execution both before the method returns and afterward;
+  #     therefore sweeping may not be completed before the return.
+  #
+  # Note that these keyword arguments are implementation- and version-dependent,
+  # are not guaranteed to be future-compatible,
+  # and may be ignored in some implementations.
   def self.start full_mark: true, immediate_mark: true, immediate_sweep: true
     Primitive.gc_start_internal full_mark, immediate_mark, immediate_sweep, false
   end
@@ -44,208 +49,349 @@ module GC
     Primitive.gc_start_internal full_mark, immediate_mark, immediate_sweep, false
   end
 
-  #  call-seq:
-  #     GC.enable    -> true or false
+  # call-seq:
+  #   GC.enable -> true or false
   #
-  #  Enables garbage collection, returning +true+ if garbage
-  #  collection was previously disabled.
+  # Enables garbage collection;
+  # returns whether garbage collection was disabled:
   #
-  #     GC.disable   #=> false
-  #     GC.enable    #=> true
-  #     GC.enable    #=> false
+  #   GC.disable
+  #   GC.enable # => true
+  #   GC.enable # => false
   #
   def self.enable
     Primitive.gc_enable
   end
 
-  #  call-seq:
-  #     GC.disable    -> true or false
+  # call-seq:
+  #    GC.disable -> true or false
+  #
+  # Disables garbage collection (but GC.start remains potent):
+  # returns whether garbage collection was already disabled.
   #
-  #  Disables garbage collection, returning +true+ if garbage
-  #  collection was already disabled.
+  #   GC.enable
+  #   GC.disable # => false
+  #   GC.disable # => true
   #
-  #     GC.disable   #=> false
-  #     GC.disable   #=> true
   def self.disable
     Primitive.gc_disable
   end
 
-  #  call-seq:
-  #    GC.stress	    -> integer, true or false
+  # call-seq:
+  #   GC.stress -> setting
+  #
+  # Returns the current \GC stress-mode setting,
+  # which initially is +false+.
   #
-  #  Returns current status of \GC stress mode.
+  # The stress mode may be set by method GC.stress=.
   def self.stress
     Primitive.gc_stress_get
   end
 
-  #  call-seq:
-  #    GC.stress = flag          -> flag
+  # call-seq:
+  #   GC.stress = value -> value
+  #
+  # Enables or disables stress mode;
+  # enabling stress mode will degrade performance; it is only for debugging.
   #
-  #  Updates the \GC stress mode.
+  # Sets the current \GC stress mode to the given value:
   #
-  #  When stress mode is enabled, the \GC is invoked at every \GC opportunity:
-  #  all memory and object allocations.
+  # - If the value is +nil+ or +false+, disables stress mode.
+  # - If the value is an integer,
+  #   enables stress mode with certain flags; see below.
+  # - Otherwise, enables stress mode;
+  #   \GC is invoked at every \GC opportunity: all memory and object allocations.
   #
-  #  Enabling stress mode will degrade performance, it is only for debugging.
+  # The flags are bits in the given integer:
+  #
+  # - +0x01+: No major \GC.
+  # - +0x02+: No immediate sweep.
+  # - +0x04+: Full mark after malloc/calloc/realloc.
   #
-  #  flag can be true, false, or an integer bit-ORed following flags.
-  #    0x01:: no major GC
-  #    0x02:: no immediate sweep
-  #    0x04:: full mark after malloc/calloc/realloc
   def self.stress=(flag)
     Primitive.gc_stress_set_m flag
   end
 
-  #  call-seq:
-  #     GC.count -> Integer
+  # call-seq:
+  #   self.count -> integer
   #
-  #  The number of times \GC occurred.
+  # Returns the total number of times garbage collection has occurred:
+  #
+  #   GC.count # => 385
+  #   GC.start
+  #   GC.count # => 386
   #
-  #  It returns the number of times \GC occurred since the process started.
   def self.count
     Primitive.gc_count
   end
 
-  #  call-seq:
-  #     GC.stat -> Hash
-  #     GC.stat(hash) -> Hash
-  #     GC.stat(:key) -> Numeric
-  #
-  #  Returns a Hash containing information about the \GC.
-  #
-  #  The contents of the hash are implementation specific and may change in
-  #  the future without notice.
-  #
-  #  The hash includes information about internal statistics about \GC such as:
-  #
-  #  [count]
-  #    The total number of garbage collections ran since application start
-  #    (count includes both minor and major garbage collections)
-  #  [time]
-  #    The total time spent in garbage collections (in milliseconds)
-  #  [heap_allocated_pages]
-  #    The total number of +:heap_eden_pages+ + +:heap_tomb_pages+
-  #  [heap_sorted_length]
-  #    The number of pages that can fit into the buffer that holds references to
-  #    all pages
-  #  [heap_allocatable_pages]
-  #    The total number of pages the application could allocate without additional \GC
-  #  [heap_available_slots]
-  #    The total number of slots in all +:heap_allocated_pages+
-  #  [heap_live_slots]
-  #    The total number of slots which contain live objects
-  #  [heap_free_slots]
-  #    The total number of slots which do not contain live objects
-  #  [heap_final_slots]
-  #    The total number of slots with pending finalizers to be run
-  #  [heap_marked_slots]
-  #    The total number of objects marked in the last \GC
-  #  [heap_eden_pages]
-  #    The total number of pages which contain at least one live slot
-  #  [heap_tomb_pages]
-  #    The total number of pages which do not contain any live slots
-  #  [total_allocated_pages]
-  #    The cumulative number of pages allocated since application start
-  #  [total_freed_pages]
-  #    The cumulative number of pages freed since application start
-  #  [total_allocated_objects]
-  #    The cumulative number of objects allocated since application start
-  #  [total_freed_objects]
-  #    The cumulative number of objects freed since application start
-  #  [malloc_increase_bytes]
-  #    Amount of memory allocated on the heap for objects. Decreased by any \GC
-  #  [malloc_increase_bytes_limit]
-  #    When +:malloc_increase_bytes+ crosses this limit, \GC is triggered
-  #  [minor_gc_count]
-  #    The total number of minor garbage collections run since process start
-  #  [major_gc_count]
-  #    The total number of major garbage collections run since process start
-  #  [compact_count]
-  #    The total number of compactions run since process start
-  #  [read_barrier_faults]
-  #    The total number of times the read barrier was triggered during
-  #    compaction
-  #  [total_moved_objects]
-  #    The total number of objects compaction has moved
-  #  [remembered_wb_unprotected_objects]
-  #    The total number of objects without write barriers
-  #  [remembered_wb_unprotected_objects_limit]
-  #    When +:remembered_wb_unprotected_objects+ crosses this limit,
-  #    major \GC is triggered
-  #  [old_objects]
-  #    Number of live, old objects which have survived at least 3 garbage collections
-  #  [old_objects_limit]
-  #    When +:old_objects+ crosses this limit, major \GC is triggered
-  #  [oldmalloc_increase_bytes]
-  #    Amount of memory allocated on the heap for objects. Decreased by major \GC
-  #  [oldmalloc_increase_bytes_limit]
-  #    When +:old_malloc_increase_bytes+ crosses this limit, major \GC is triggered
-  #
-  #  If the optional argument, hash, is given,
-  #  it is overwritten and returned.
-  #  This is intended to avoid probe effect.
-  #
-  #  This method is only expected to work on CRuby.
+  # call-seq:
+  #   GC.stat -> new_hash
+  #   GC.stat(key) -> value
+  #   GC.stat(hash) -> hash
+  #
+  # This method is implementation-specific to CRuby.
+  #
+  # Returns \GC statistics.
+  # The particular statistics are implementation-specific
+  # and may change in the future without notice.
+  #
+  # With no argument given,
+  # returns information about the most recent garbage collection:
+  #
+  #   GC.stat
+  #   # =>
+  #   {count: 28,
+  #    time: 1,
+  #    marking_time: 1,
+  #    sweeping_time: 0,
+  #    heap_allocated_pages: 521,
+  #    heap_empty_pages: 0,
+  #    heap_allocatable_bytes: 0,
+  #    heap_available_slots: 539590,
+  #    heap_live_slots: 422243,
+  #    heap_free_slots: 117347,
+  #    heap_final_slots: 0,
+  #    heap_marked_slots: 264877,
+  #    heap_eden_pages: 521,
+  #    total_allocated_pages: 521,
+  #    total_freed_pages: 0,
+  #    total_allocated_objects: 2246376,
+  #    total_freed_objects: 1824133,
+  #    malloc_increase_bytes: 50982,
+  #    malloc_increase_bytes_limit: 18535172,
+  #    minor_gc_count: 18,
+  #    major_gc_count: 10,
+  #    compact_count: 0,
+  #    read_barrier_faults: 0,
+  #    total_moved_objects: 0,
+  #    remembered_wb_unprotected_objects: 0,
+  #    remembered_wb_unprotected_objects_limit: 2162,
+  #    old_objects: 216365,
+  #    old_objects_limit: 432540,
+  #    oldmalloc_increase_bytes: 1654232,
+  #    oldmalloc_increase_bytes_limit: 16846103}
+  #
+  # With symbol argument +key+ given,
+  # returns the value for that key:
+  #
+  #   GC.stat(:count) # => 30
+  #
+  # With hash argument +hash+ given,
+  # returns that hash with GC statistics merged into its content;
+  # this form may be useful in minimizing {probe effects}[https://en.wikipedia.org/wiki/Probe_effect]:
+  #
+  #   h = {foo: 0, bar: 1}
+  #   GC.stat(h)
+  #   h.keys.take(5) # => [:foo, :bar, :count, :time, :marking_time]
+  #
+  # The hash includes entries such as:
+  #
+  # - +:count+:
+  #   The total number of garbage collections run since application start
+  #   (count includes both minor and major garbage collections).
+  # - +:time+:
+  #   The total time spent in garbage collections (in milliseconds).
+  # - +:heap_allocated_pages+:
+  #   The total number of allocated pages.
+  # - +:heap_empty_pages+:
+  #   The number of pages with no live objects, and that could be released to the system.
+  # - +:heap_sorted_length+:
+  #   The number of pages that can fit into the buffer that holds references to  all pages.
+  # - +:heap_allocatable_pages+:
+  #   The total number of pages the application could allocate without additional \GC.
+  # - +:heap_available_slots+:
+  #   The total number of slots in all +:heap_allocated_pages+.
+  # - +:heap_live_slots+:
+  #   The total number of slots which contain live objects.
+  # - +:heap_free_slots+:
+  #   The total number of slots which do not contain live objects.
+  # - +:heap_final_slots+:
+  #   The total number of slots with pending finalizers to be run.
+  # - +:heap_marked_slots+:
+  #   The total number of objects marked in the last \GC.
+  # - +:heap_eden_pages+:
+  #   The total number of pages which contain at least one live slot.
+  # - +:total_allocated_pages+:
+  #   The cumulative number of pages allocated since application start.
+  # - +:total_freed_pages+:
+  #   The cumulative number of pages freed since application start.
+  # - +:total_allocated_objects+:
+  #   The cumulative number of objects allocated since application start.
+  # - +:total_freed_objects+:
+  #   The cumulative number of objects freed since application start.
+  # - +:malloc_increase_bytes+:
+  #   Amount of memory allocated on the heap for objects. Decreased by any \GC.
+  # - +:malloc_increase_bytes_limit+:
+  #   When +:malloc_increase_bytes+ crosses this limit, \GC is triggered.
+  # - +:minor_gc_count+:
+  #   The total number of minor garbage collections run since process start.
+  # - +:major_gc_count+:
+  #   The total number of major garbage collections run since process start.
+  # - +:compact_count+:
+  #   The total number of compactions run since process start.
+  # - +:read_barrier_faults+:
+  #   The total number of times the read barrier was triggered during compaction.
+  # - +:total_moved_objects+:
+  #   The total number of objects compaction has moved.
+  # - +:remembered_wb_unprotected_objects+:
+  #   The total number of objects without write barriers.
+  # - +:remembered_wb_unprotected_objects_limit+:
+  #   When +:remembered_wb_unprotected_objects+ crosses this limit, major \GC is triggered.
+  # - +:old_objects+:
+  #   Number of live, old objects which have survived at least 3 garbage collections.
+  # - +:old_objects_limit+:
+  #   When +:old_objects+ crosses this limit, major \GC is triggered.
+  # - +:oldmalloc_increase_bytes+:
+  #   Amount of memory allocated on the heap for objects. Decreased by major \GC.
+  # - +:oldmalloc_increase_bytes_limit+:
+  #   When +:oldmalloc_increase_bytes+ crosses this limit, major \GC is triggered.
+  #
   def self.stat hash_or_key = nil
     Primitive.gc_stat hash_or_key
   end
 
   # call-seq:
-  #    GC.stat_heap -> Hash
-  #    GC.stat_heap(nil, hash) -> Hash
-  #    GC.stat_heap(heap_name) -> Hash
-  #    GC.stat_heap(heap_name, hash) -> Hash
-  #    GC.stat_heap(heap_name, :key) -> Numeric
-  #
-  # Returns information for heaps in the \GC.
-  #
-  # If the first optional argument, +heap_name+, is passed in and not +nil+, it
-  # returns a +Hash+ containing information about the particular heap.
-  # Otherwise, it will return a +Hash+ with heap names as keys and
-  # a +Hash+ containing information about the heap as values.
-  #
-  # If the second optional argument, +hash_or_key+, is given as +Hash+, it will
-  # be overwritten and returned. This is intended to avoid the probe effect.
-  #
-  # If both optional arguments are passed in and the second optional argument is
-  # a symbol, it will return a +Numeric+ of the value for the particular heap.
-  #
-  # On CRuby, +heap_name+ is of the type +Integer+ but may be of type +String+
-  # on other implementations.
-  #
-  # The contents of the hash are implementation specific and may change in
-  # the future without notice.
-  #
-  # If the optional argument, hash, is given, it is overwritten and returned.
-  #
-  # This method is only expected to work on CRuby.
-  #
-  # The hash includes the following keys about the internal information in
-  # the \GC:
-  #
-  # [slot_size]
+  #    GC.stat_heap -> new_hash
+  #    GC.stat_heap(heap_id) -> new_hash
+  #    GC.stat_heap(heap_id, key) -> value
+  #    GC.stat_heap(nil, hash) -> hash
+  #    GC.stat_heap(heap_id, hash) -> hash
+  #
+  # This method is implementation-specific to CRuby.
+  #
+  # Returns statistics for \GC heaps.
+  # The particular statistics are implementation-specific
+  # and may change in the future without notice.
+  #
+  # With no argument given, returns statistics for all heaps:
+  #
+  #   GC.stat_heap
+  #   # =>
+  #   {0 =>
+  #     {slot_size: 32,
+  #      heap_eden_pages: 24,
+  #      heap_eden_slots: 12288,
+  #      total_allocated_pages: 24,
+  #      force_major_gc_count: 0,
+  #      force_incremental_marking_finish_count: 0,
+  #      total_allocated_objects: 8450,
+  #      total_freed_objects: 3120},
+  #    1 =>
+  #     {slot_size: 64,
+  #      heap_eden_pages: 246,
+  #      heap_eden_slots: 402802,
+  #      total_allocated_pages: 246,
+  #      force_major_gc_count: 2,
+  #      force_incremental_marking_finish_count: 1,
+  #      total_allocated_objects: 33867152,
+  #      total_freed_objects: 33520523},
+  #    2 =>
+  #     {slot_size: 128,
+  #      heap_eden_pages: 84,
+  #      heap_eden_slots: 68746,
+  #      total_allocated_pages: 84,
+  #      force_major_gc_count: 1,
+  #      force_incremental_marking_finish_count: 4,
+  #      total_allocated_objects: 147491,
+  #      total_freed_objects: 90699},
+  #    3 =>
+  #     {slot_size: 256,
+  #      heap_eden_pages: 157,
+  #      heap_eden_slots: 64182,
+  #      total_allocated_pages: 157,
+  #      force_major_gc_count: 0,
+  #      force_incremental_marking_finish_count: 0,
+  #      total_allocated_objects: 211460,
+  #      total_freed_objects: 190075},
+  #    4 =>
+  #     {slot_size: 512,
+  #      heap_eden_pages: 8,
+  #      heap_eden_slots: 1631,
+  #      total_allocated_pages: 8,
+  #      force_major_gc_count: 0,
+  #      force_incremental_marking_finish_count: 0,
+  #      total_allocated_objects: 1422,
+  #      total_freed_objects: 700},
+  #    5 =>
+  #     {slot_size: 1024,
+  #      heap_eden_pages: 16,
+  #      heap_eden_slots: 1628,
+  #      total_allocated_pages: 16,
+  #      force_major_gc_count: 0,
+  #      force_incremental_marking_finish_count: 0,
+  #      total_allocated_objects: 1230,
+  #      total_freed_objects: 309}}
+  #
+  # In the example above, the keys in the outer hash are the heap identifiers:
+  #
+  #   GC.stat_heap.keys # => [0, 1, 2, 3, 4, 5]
+  #
+  # On CRuby, each heap identifier is an integer;
+  # on other implementations, a heap identifier may be a string.
+  #
+  # With only argument +heap_id+ given,
+  # returns statistics for the given heap identifier:
+  #
+  #   GC.stat_heap(3)
+  #   # =>
+  #   {slot_size: 256,
+  #    heap_eden_pages: 157,
+  #    heap_eden_slots: 64182,
+  #    total_allocated_pages: 157,
+  #    force_major_gc_count: 0,
+  #    force_incremental_marking_finish_count: 0,
+  #    total_allocated_objects: 225018,
+  #    total_freed_objects: 206647}
+  #
+  # With arguments +heap_id+ and +key+ given,
+  # returns the value for the given key in the given heap:
+  #
+  #   GC.stat_heap(3, :slot_size) # => 256
+  #
+  # With arguments +nil+ and +hash+ given,
+  # merges the statistics for all heaps into the given hash:
+  #
+  #   h = {foo: 0, bar: 1}
+  #   GC.stat_heap(nil, h).keys # => [:foo, :bar, 0, 1, 2, 3, 4]
+  #
+  # With arguments +heap_id+ and +hash+ given,
+  # merges the statistics for the given heap into the given hash:
+  #
+  #   h = {foo: 0, bar: 1}
+  #   GC.stat_heap(2, h).keys
+  #   # =>
+  #   [:foo,
+  #    :bar,
+  #    :slot_size,
+  #    :heap_eden_pages,
+  #    :heap_eden_slots,
+  #    :total_allocated_pages,
+  #    :force_major_gc_count,
+  #    :force_incremental_marking_finish_count,
+  #    :total_allocated_objects,
+  #    :total_freed_objects]
+  #
+  # The statistics for a heap may include:
+  #
+  # - +:slot_size+:
   #   The slot size of the heap in bytes.
-  # [heap_allocatable_pages]
+  # - +:heap_allocatable_pages+:
   #   The number of pages that can be allocated without triggering a new
   #   garbage collection cycle.
-  # [heap_eden_pages]
+  # - +:heap_eden_pages+:
   #   The number of pages in the eden heap.
-  # [heap_eden_slots]
+  # - +:heap_eden_slots+:
   #   The total number of slots in all of the pages in the eden heap.
-  # [heap_tomb_pages]
-  #   The number of pages in the tomb heap. The tomb heap only contains pages
-  #   that do not have any live objects.
-  # [heap_tomb_slots]
-  #   The total number of slots in all of the pages in the tomb heap.
-  # [total_allocated_pages]
+  # - +:total_allocated_pages+:
   #   The total number of pages that have been allocated in the heap.
-  # [total_freed_pages]
+  # - +:total_freed_pages+:
   #   The total number of pages that have been freed and released back to the
   #   system in the heap.
-  # [force_major_gc_count]
-  #   The number of times major garbage collection cycles this heap has forced
+  # - +:force_major_gc_count+:
+  #   The number of times this heap has forced major garbage collection cycles
   #   to start due to running out of free slots.
-  # [force_incremental_marking_finish_count]
+  # - +:force_incremental_marking_finish_count+:
   #   The number of times this heap has forced incremental marking to complete
   #   due to running out of pooled slots.
   #
@@ -254,70 +400,200 @@ module GC
   end
 
   # call-seq:
-  #     GC.latest_gc_info -> hash
-  #     GC.latest_gc_info(hash) -> hash
-  #     GC.latest_gc_info(:major_by) -> :malloc
+  #     GC.config -> hash
+  #     GC.config(hash_to_merge) -> hash
   #
-  # Returns information about the most recent garbage collection.
+  # This method is implementation-specific to CRuby.
   #
-  # If the optional argument, hash, is given,
-  # it is overwritten and returned.
-  # This is intended to avoid probe effect.
-  def self.latest_gc_info hash_or_key = nil
-    Primitive.gc_latest_gc_info hash_or_key
+  # Sets or gets information about the current \GC configuration.
+  #
+  # Configuration parameters are \GC implementation-specific and may change without notice.
+  #
+  # With no argument given, returns a hash containing the configuration:
+  #
+  #   GC.config
+  #   # => {rgengc_allow_full_mark: true, implementation: "default"}
+  #
+  # With argument +hash_to_merge+ given,
+  # merges that hash into the stored configuration hash;
+  # ignores unknown hash keys;
+  # returns the configuration hash:
+  #
+  #   GC.config(rgengc_allow_full_mark: false)
+  #   # => {rgengc_allow_full_mark: false, implementation: "default"}
+  #   GC.config(foo: 'bar')
+  #   # => {rgengc_allow_full_mark: false, implementation: "default"}
+  #
+  # <b>All-Implementations Configuration</b>
+  #
+  # The single read-only entry for all implementations is:
+  #
+  # - +:implementation+:
+  #   the string name of the implementation;
+  #   for the Ruby default implementation, <tt>'default'</tt>.
+  #
+  # <b>Implementation-Specific Configuration</b>
+  #
+  # A \GC implementation maintains its own implementation-specific configuration.
+  #
+  # For Ruby's default implementation the single entry is:
+  #
+  # - +:rgengc_allow_full_mark+:
+  #   Controls whether the \GC is allowed to run a full mark (young & old objects):
+  #
+  #   - +true+ (default): \GC interleaves major and minor collections.
+  #     A flag is set to notify GC that a full mark has been requested.
+  #     This flag is accessible via GC.latest_gc_info(:need_major_by).
+  #   - +false+: \GC does not initiate a full marking cycle unless explicitly directed by user code;
+  #     see GC.start.
+  #     Setting this parameter to +false+ disables young-to-old promotion.
+  #     For performance reasons, we recommended warming up the application using Process.warmup
+  #     before setting this parameter to +false+.
+  #
+  def self.config hash = nil
+    if Primitive.cexpr!("RBOOL(RB_TYPE_P(hash, T_HASH))")
+      if hash.include?(:implementation)
+        raise ArgumentError, 'Attempting to set read-only key "Implementation"'
+      end
+
+      Primitive.gc_config_set hash
+    elsif hash != nil
+      raise ArgumentError
+    end
+
+    Primitive.gc_config_get
   end
 
-  if respond_to?(:compact)
-    # call-seq:
-    #    GC.verify_compaction_references(toward: nil, double_heap: false) -> hash
-    #
-    # Verify compaction reference consistency.
-    #
-    # This method is implementation specific.  During compaction, objects that
-    # were moved are replaced with T_MOVED objects.  No object should have a
-    # reference to a T_MOVED object after compaction.
-    #
-    # This function expands the heap to ensure room to move all objects,
-    # compacts the heap to make sure everything moves, updates all references,
-    # then performs a full \GC.  If any object contains a reference to a T_MOVED
-    # object, that object should be pushed on the mark stack, and will
-    # make a SEGV.
-    def self.verify_compaction_references(toward: nil, double_heap: false, expand_heap: false)
-      Primitive.gc_verify_compaction_references(double_heap, expand_heap, toward == :empty)
+  # call-seq:
+  #   GC.latest_gc_info -> new_hash
+  #   GC.latest_gc_info(key) -> value
+  #   GC.latest_gc_info(hash) -> hash
+  #
+  # With no argument given,
+  # returns information about the most recent garbage collection:
+  #
+  #   GC.latest_gc_info
+  #   # =>
+  #   {major_by: :force,
+  #    need_major_by: nil,
+  #    gc_by: :method,
+  #    have_finalizer: false,
+  #    immediate_sweep: true,
+  #    state: :none,
+  #    weak_references_count: 0,
+  #    retained_weak_references_count: 0}
+  #
+  # With symbol argument +key+ given,
+  # returns the value for that key:
+  #
+  #   GC.latest_gc_info(:gc_by) # => :newobj
+  #
+  # With hash argument +hash+ given,
+  # returns that hash with GC information merged into its content;
+  # this form may be useful in minimizing {probe effects}[https://en.wikipedia.org/wiki/Probe_effect]:
+  #
+  #   h = {foo: 0, bar: 1}
+  #   GC.latest_gc_info(h)
+  #   # =>
+  #   {foo: 0,
+  #    bar: 1,
+  #    major_by: nil,
+  #    need_major_by: nil,
+  #    gc_by: :newobj,
+  #    have_finalizer: false,
+  #    immediate_sweep: false,
+  #    state: :sweeping,
+  #    weak_references_count: 0,
+  #    retained_weak_references_count: 0}
+  #
+  def self.latest_gc_info hash_or_key = nil
+    if hash_or_key == nil
+      hash_or_key = {}
+    elsif Primitive.cexpr!("RBOOL(!SYMBOL_P(hash_or_key) && !RB_TYPE_P(hash_or_key, T_HASH))")
+      raise TypeError, "non-hash or symbol given"
     end
+
+    Primitive.cstmt! %{
+      return rb_gc_latest_gc_info(hash_or_key);
+    }
   end
 
   # call-seq:
-  #    GC.measure_total_time = true/false
+  #   GC.measure_total_time = setting -> setting
+  #
+  # Enables or disables \GC total time measurement;
+  # returns +setting+.
+  # See GC.total_time.
+  #
+  # When argument +object+ is +nil+ or +false+, disables total time measurement;
+  # GC.measure_total_time then returns +false+:
+  #
+  #   GC.measure_total_time = nil   # => nil
+  #   GC.measure_total_time         # => false
+  #   GC.measure_total_time = false # => false
+  #   GC.measure_total_time         # => false
   #
-  # Enable to measure \GC time.
-  # You can get the result with <tt>GC.stat(:time)</tt>.
-  # Note that \GC time measurement can cause some performance overhead.
+  # Otherwise, enables total time measurement;
+  # GC.measure_total_time then returns +true+:
+  #
+  #   GC.measure_total_time = true # => true
+  #   GC.measure_total_time        # => true
+  #   GC.measure_total_time = :foo # => :foo
+  #   GC.measure_total_time        # => true
+  #
+  # Note that when enabled, total time measurement affects performance.
   def self.measure_total_time=(flag)
     Primitive.cstmt! %{
-      rb_objspace.flags.measure_gc = RTEST(flag) ? TRUE : FALSE;
+      rb_gc_impl_set_measure_total_time(rb_gc_get_objspace(), flag);
       return flag;
     }
   end
 
   # call-seq:
-  #    GC.measure_total_time -> true/false
+  #   GC.measure_total_time -> true or false
   #
-  # Return measure_total_time flag (default: +true+).
-  # Note that measurement can affect the application performance.
+  # Returns the setting for \GC total time measurement;
+  # the initial setting is +true+.
+  # See GC.total_time.
   def self.measure_total_time
     Primitive.cexpr! %{
-      RBOOL(rb_objspace.flags.measure_gc)
+      RBOOL(rb_gc_impl_get_measure_total_time(rb_gc_get_objspace()))
     }
   end
 
   # call-seq:
-  #    GC.total_time -> int
+  #    GC.total_time -> integer
+  #
+  # Returns the \GC total time in nanoseconds:
+  #
+  #   GC.total_time # => 156250
+  #
+  # Note that total time accumulates
+  # only when total time measurement is enabled
+  # (that is, when GC.measure_total_time is +true+):
+  #
+  #   GC.measure_total_time # => true
+  #   GC.total_time # => 625000
+  #   GC.start
+  #   GC.total_time # => 937500
+  #   GC.start
+  #   GC.total_time # => 1093750
+  #
+  #   GC.measure_total_time = false
+  #   GC.total_time # => 1250000
+  #   GC.start
+  #   GC.total_time # => 1250000
+  #   GC.start
+  #   GC.total_time # => 1250000
+  #
+  #   GC.measure_total_time = true
+  #   GC.total_time # => 1250000
+  #   GC.start
+  #   GC.total_time # => 1406250
   #
-  # Return measured \GC total time in nano seconds.
   def self.total_time
     Primitive.cexpr! %{
-      ULL2NUM(rb_objspace.profile.marking_time_ns + rb_objspace.profile.sweeping_time_ns)
+      ULL2NUM(rb_gc_impl_get_total_time(rb_gc_get_objspace()))
     }
   end
 end
diff --git a/gc/README.md b/gc/README.md
new file mode 100644
index 0000000000..cb71357973
--- /dev/null
+++ b/gc/README.md
@@ -0,0 +1,37 @@
+# Ruby's Garbage Collectors
+
+This directory contains implementations for Ruby's garbage collector (GC). The GC implementations use the Modular GC API to interact with Ruby. For more details about this API, see the [Modular GC API](#modular-gc-api) section.
+
+Two GC implementations are included in Ruby:
+
+- Default: The GC implementation that is used by default in Ruby. This GC is stable and production ready. The implementation uses a mark-sweep-compact algorithm.
+- MMTk: An experimental implementation using the [MMTk](https://www.mmtk.io/) framework. The code lives in the [ruby/mmtk](https://github.com/ruby/mmtk) repository and is synchronized here. MMTk provides a [wide variety of GC algorithms](https://www.mmtk.io/status#implemented-collectors) to choose from. For usage instructions and current progress, refer to the [ruby/mmtk](https://github.com/ruby/mmtk) repository.
+
+## Building guide
+
+> [!TIP]
+> If you are not sure how to build Ruby, follow the [Building Ruby](https://docs.ruby-lang.org/en/master/contributing/building_ruby_md.html) guide.
+
+> [!IMPORTANT]
+> Ruby's modular GC feature is experimental and subject to change. There may be bugs or performance impacts. Use at your own risk.
+
+### Building Ruby with Modular GC
+
+1. Configure Ruby with the `--with-modular-gc=<dir>` option, where `dir` is the directory you want to place the built GC libraries into.
+2. Build Ruby as usual.
+
+### Building GC implementations shipped with Ruby
+
+1. Build your desired GC implementation with `make install-modular-gc MODULAR_GC=<impl>`. This will build the GC implementation and place the built library into the `dir` specified in step 1. `impl` can be one of:
+    - `default`: The default GC that Ruby ships with.
+    - `mmtk`: The GC that uses [MMTk](https://www.mmtk.io/) as the back-end. See Ruby-specific details in the [ruby/mmtk](https://github.com/ruby/mmtk) repository.
+2. Run your desired GC implementation by setting the `RUBY_GC_LIBRARY=<lib>` environment variable, where `lib` could be `default`, `mmtk`, or your own implementation (as long as you place it in the `dir` specified in step 1).
+
+## Modular GC API
+
+> [!WARNING]
+> The Modular GC API is experimental and subject to change without notice.
+
+GC implementations interact with Ruby via the Modular GC API. All implementations must provide the functions in [gc/gc_impl.h](https://github.com/ruby/ruby/blob/master/gc/gc_impl.h) for Ruby to hook into. GC implementations can use any public C API in Ruby, along with additional APIs defined in [gc/gc.h](https://github.com/ruby/ruby/blob/master/gc/gc.h).
+
+Additionally, create an extconf.rb file to build the GC library. This file must use [gc/extconf_base.rb](https://github.com/ruby/ruby/blob/master/gc/extconf_base.rb) and the `create_gc_makefile` method.
diff --git a/gc/default/default.c b/gc/default/default.c
new file mode 100644
index 0000000000..0027f7a13c
--- /dev/null
+++ b/gc/default/default.c
@@ -0,0 +1,9888 @@
+#include "ruby/internal/config.h"
+
+#include <signal.h>
+
+#ifndef _WIN32
+# include <sys/mman.h>
+# include <unistd.h>
+# ifdef HAVE_SYS_PRCTL_H
+#  include <sys/prctl.h>
+# endif
+#endif
+
+#if !defined(PAGE_SIZE) && defined(HAVE_SYS_USER_H)
+/* LIST_HEAD conflicts with sys/queue.h on macOS */
+# include <sys/user.h>
+#endif
+
+#ifdef BUILDING_MODULAR_GC
+# define nlz_int64(x) (x == 0 ? 64 : (unsigned int)__builtin_clzll((unsigned long long)x))
+#else
+# include "internal/bits.h"
+#endif
+
+#include "ruby/ruby.h"
+#include "ruby/atomic.h"
+#include "ruby_atomic.h"
+#include "ruby/debug.h"
+#include "ruby/thread.h"
+#include "ruby/util.h"
+#include "ruby/vm.h"
+#include "ruby/internal/encoding/string.h"
+#include "ccan/list/list.h"
+#include "darray.h"
+#include "gc/gc.h"
+#include "gc/gc_impl.h"
+
+#ifndef BUILDING_MODULAR_GC
+# include "probes.h"
+#endif
+
+#ifdef BUILDING_MODULAR_GC
+# define RB_DEBUG_COUNTER_INC(_name) ((void)0)
+# define RB_DEBUG_COUNTER_INC_IF(_name, cond) (!!(cond))
+#else
+# include "debug_counter.h"
+#endif
+
+#ifdef BUILDING_MODULAR_GC
+# define rb_asan_poison_object(obj) ((void)(obj))
+# define rb_asan_unpoison_object(obj, newobj_p) ((void)(obj), (void)(newobj_p))
+# define asan_unpoisoning_object(obj) if ((obj) || true)
+# define asan_poison_memory_region(ptr, size) ((void)(ptr), (void)(size))
+# define asan_unpoison_memory_region(ptr, size, malloc_p) ((void)(ptr), (size), (malloc_p))
+# define asan_unpoisoning_memory_region(ptr, size) if ((ptr) || (size) || true)
+
+# define VALGRIND_MAKE_MEM_DEFINED(ptr, size) ((void)(ptr), (void)(size))
+# define VALGRIND_MAKE_MEM_UNDEFINED(ptr, size) ((void)(ptr), (void)(size))
+#else
+# include "internal/sanitizers.h"
+#endif
+
+/* MALLOC_HEADERS_BEGIN */
+#ifndef HAVE_MALLOC_USABLE_SIZE
+# ifdef _WIN32
+#  define HAVE_MALLOC_USABLE_SIZE
+#  define malloc_usable_size(a) _msize(a)
+# elif defined HAVE_MALLOC_SIZE
+#  define HAVE_MALLOC_USABLE_SIZE
+#  define malloc_usable_size(a) malloc_size(a)
+# endif
+#endif
+
+#ifdef HAVE_MALLOC_USABLE_SIZE
+# ifdef RUBY_ALTERNATIVE_MALLOC_HEADER
+/* Alternative malloc header is included in ruby/missing.h */
+# elif defined(HAVE_MALLOC_H)
+#  include <malloc.h>
+# elif defined(HAVE_MALLOC_NP_H)
+#  include <malloc_np.h>
+# elif defined(HAVE_MALLOC_MALLOC_H)
+#  include <malloc/malloc.h>
+# endif
+#endif
+
+#ifdef HAVE_MALLOC_TRIM
+# include <malloc.h>
+
+# ifdef __EMSCRIPTEN__
+/* malloc_trim is defined in emscripten/emmalloc.h on emscripten. */
+#  include <emscripten/emmalloc.h>
+# endif
+#endif
+
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+# include <mach/task.h>
+# include <mach/mach_init.h>
+# include <mach/mach_port.h>
+#endif
+
+#ifndef RUBY_DEBUG_LOG
+# define RUBY_DEBUG_LOG(...)
+#endif
+
+#ifndef GC_HEAP_INIT_BYTES
+#define GC_HEAP_INIT_BYTES (2560 * 1024)
+#endif
+#ifndef GC_HEAP_FREE_SLOTS
+#define GC_HEAP_FREE_SLOTS  4096
+#endif
+#ifndef GC_HEAP_GROWTH_FACTOR
+#define GC_HEAP_GROWTH_FACTOR 1.8
+#endif
+#ifndef GC_HEAP_GROWTH_MAX_BYTES
+#define GC_HEAP_GROWTH_MAX_BYTES 0 /* 0 is disable */
+#endif
+#ifndef GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO
+# define GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO 0.01
+#endif
+#ifndef GC_HEAP_OLDOBJECT_LIMIT_FACTOR
+#define GC_HEAP_OLDOBJECT_LIMIT_FACTOR 2.0
+#endif
+
+#ifndef GC_HEAP_FREE_SLOTS_MIN_RATIO
+#define GC_HEAP_FREE_SLOTS_MIN_RATIO  0.20
+#endif
+#ifndef GC_HEAP_FREE_SLOTS_GOAL_RATIO
+#define GC_HEAP_FREE_SLOTS_GOAL_RATIO 0.40
+#endif
+#ifndef GC_HEAP_FREE_SLOTS_MAX_RATIO
+#define GC_HEAP_FREE_SLOTS_MAX_RATIO  0.65
+#endif
+
+#ifndef GC_MALLOC_LIMIT_MIN
+#define GC_MALLOC_LIMIT_MIN (16 * 1024 * 1024 /* 16MB */)
+#endif
+#ifndef GC_MALLOC_LIMIT_MAX
+#define GC_MALLOC_LIMIT_MAX (32 * 1024 * 1024 /* 32MB */)
+#endif
+#ifndef GC_MALLOC_LIMIT_GROWTH_FACTOR
+#define GC_MALLOC_LIMIT_GROWTH_FACTOR 1.4
+#endif
+
+#ifndef GC_OLDMALLOC_LIMIT_MIN
+#define GC_OLDMALLOC_LIMIT_MIN (16 * 1024 * 1024 /* 16MB */)
+#endif
+#ifndef GC_OLDMALLOC_LIMIT_GROWTH_FACTOR
+#define GC_OLDMALLOC_LIMIT_GROWTH_FACTOR 1.2
+#endif
+#ifndef GC_OLDMALLOC_LIMIT_MAX
+#define GC_OLDMALLOC_LIMIT_MAX (128 * 1024 * 1024 /* 128MB */)
+#endif
+
+#ifndef GC_MALLOC_INCREASE_LOCAL_THRESHOLD
+#define GC_MALLOC_INCREASE_LOCAL_THRESHOLD (8 * 1024 /* 8KB */)
+#endif
+
+#ifdef RB_THREAD_LOCAL_SPECIFIER
+#define USE_MALLOC_INCREASE_LOCAL 1
+static RB_THREAD_LOCAL_SPECIFIER int malloc_increase_local;
+#else
+#define USE_MALLOC_INCREASE_LOCAL 0
+#endif
+
+#ifndef GC_CAN_COMPILE_COMPACTION
+#if defined(__wasi__) /* WebAssembly doesn't support signals */
+# define GC_CAN_COMPILE_COMPACTION 0
+#else
+# define GC_CAN_COMPILE_COMPACTION 1
+#endif
+#endif
+
+#ifndef PRINT_ENTER_EXIT_TICK
+# define PRINT_ENTER_EXIT_TICK 0
+#endif
+#ifndef PRINT_ROOT_TICKS
+#define PRINT_ROOT_TICKS 0
+#endif
+
+#define USE_TICK_T                 (PRINT_ENTER_EXIT_TICK || PRINT_ROOT_TICKS)
+
+#ifndef HEAP_COUNT
+# if SIZEOF_VALUE >= 8
+#  define HEAP_COUNT 12
+# else
+#  define HEAP_COUNT 5
+# endif
+#endif
+
+/* The reciprocal table and pool_slot_sizes array are both generated from this
+ * single definition, so they can never get out of sync. */
+#if SIZEOF_VALUE >= 8
+# define EACH_POOL_SLOT_SIZE(SLOT) \
+    SLOT(32) SLOT(40) SLOT(64) SLOT(80) SLOT(96) SLOT(128) \
+    SLOT(160) SLOT(256) SLOT(512) SLOT(640) SLOT(768) SLOT(1024)
+#else
+# define EACH_POOL_SLOT_SIZE(SLOT) \
+    SLOT(32) SLOT(64) SLOT(128) SLOT(256) SLOT(512)
+#endif
+
+typedef struct ractor_newobj_heap_cache {
+    struct free_slot *freelist;
+    struct heap_page *using_page;
+    size_t allocated_objects_count;
+} rb_ractor_newobj_heap_cache_t;
+
+typedef struct ractor_newobj_cache {
+    size_t incremental_mark_step_allocated_slots;
+    rb_ractor_newobj_heap_cache_t heap_caches[HEAP_COUNT];
+} rb_ractor_newobj_cache_t;
+
+typedef struct {
+    size_t heap_init_bytes;
+    size_t heap_free_slots;
+    double growth_factor;
+    size_t growth_max_bytes;
+
+    double heap_free_slots_min_ratio;
+    double heap_free_slots_goal_ratio;
+    double heap_free_slots_max_ratio;
+    double uncollectible_wb_unprotected_objects_limit_ratio;
+    double oldobject_limit_factor;
+
+    size_t malloc_limit_min;
+    size_t malloc_limit_max;
+    double malloc_limit_growth_factor;
+
+    size_t oldmalloc_limit_min;
+    size_t oldmalloc_limit_max;
+    double oldmalloc_limit_growth_factor;
+} ruby_gc_params_t;
+
+static ruby_gc_params_t gc_params = {
+    GC_HEAP_INIT_BYTES,
+    GC_HEAP_FREE_SLOTS,
+    GC_HEAP_GROWTH_FACTOR,
+    GC_HEAP_GROWTH_MAX_BYTES,
+
+    GC_HEAP_FREE_SLOTS_MIN_RATIO,
+    GC_HEAP_FREE_SLOTS_GOAL_RATIO,
+    GC_HEAP_FREE_SLOTS_MAX_RATIO,
+    GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO,
+    GC_HEAP_OLDOBJECT_LIMIT_FACTOR,
+
+    GC_MALLOC_LIMIT_MIN,
+    GC_MALLOC_LIMIT_MAX,
+    GC_MALLOC_LIMIT_GROWTH_FACTOR,
+
+    GC_OLDMALLOC_LIMIT_MIN,
+    GC_OLDMALLOC_LIMIT_MAX,
+    GC_OLDMALLOC_LIMIT_GROWTH_FACTOR,
+};
+
+/* GC_DEBUG:
+ *  enable to embed GC debugging information.
+ */
+#ifndef GC_DEBUG
+#define GC_DEBUG 0
+#endif
+
+/* RGENGC_DEBUG:
+ * 1: basic information
+ * 2: remember set operation
+ * 3: mark
+ * 4:
+ * 5: sweep
+ */
+#ifndef RGENGC_DEBUG
+#ifdef RUBY_DEVEL
+#define RGENGC_DEBUG       -1
+#else
+#define RGENGC_DEBUG       0
+#endif
+#endif
+#if RGENGC_DEBUG < 0 && !defined(_MSC_VER)
+# define RGENGC_DEBUG_ENABLED(level) (-(RGENGC_DEBUG) >= (level) && ruby_rgengc_debug >= (level))
+#elif defined(HAVE_VA_ARGS_MACRO)
+# define RGENGC_DEBUG_ENABLED(level) ((RGENGC_DEBUG) >= (level))
+#else
+# define RGENGC_DEBUG_ENABLED(level) 0
+#endif
+int ruby_rgengc_debug;
+
+/* RGENGC_PROFILE
+ * 0: disable RGenGC profiling
+ * 1: enable profiling for basic information
+ * 2: enable profiling for each types
+ */
+#ifndef RGENGC_PROFILE
+# define RGENGC_PROFILE     0
+#endif
+
+/* RGENGC_ESTIMATE_OLDMALLOC
+ * Enable/disable to estimate increase size of malloc'ed size by old objects.
+ * If estimation exceeds threshold, then will invoke full GC.
+ * 0: disable estimation.
+ * 1: enable estimation.
+ */
+#ifndef RGENGC_ESTIMATE_OLDMALLOC
+# define RGENGC_ESTIMATE_OLDMALLOC 1
+#endif
+
+#ifndef GC_PROFILE_MORE_DETAIL
+# define GC_PROFILE_MORE_DETAIL 0
+#endif
+#ifndef GC_PROFILE_DETAIL_MEMORY
+# define GC_PROFILE_DETAIL_MEMORY 0
+#endif
+#ifndef GC_ENABLE_LAZY_SWEEP
+# define GC_ENABLE_LAZY_SWEEP   1
+#endif
+
+#ifndef VERIFY_FREE_SIZE
+#if RUBY_DEBUG
+#define VERIFY_FREE_SIZE 1
+#else
+#define VERIFY_FREE_SIZE 0
+#endif
+#endif
+
+#if VERIFY_FREE_SIZE
+#undef CALC_EXACT_MALLOC_SIZE
+#define CALC_EXACT_MALLOC_SIZE 1
+#endif
+
+#ifndef CALC_EXACT_MALLOC_SIZE
+# define CALC_EXACT_MALLOC_SIZE 0
+#endif
+
+#if defined(HAVE_MALLOC_USABLE_SIZE) || CALC_EXACT_MALLOC_SIZE > 0
+# ifndef MALLOC_ALLOCATED_SIZE
+#  define MALLOC_ALLOCATED_SIZE 0
+# endif
+#else
+# define MALLOC_ALLOCATED_SIZE 0
+#endif
+#ifndef MALLOC_ALLOCATED_SIZE_CHECK
+# define MALLOC_ALLOCATED_SIZE_CHECK 0
+#endif
+
+#ifndef GC_DEBUG_STRESS_TO_CLASS
+# define GC_DEBUG_STRESS_TO_CLASS RUBY_DEBUG
+#endif
+
+typedef enum {
+    GPR_FLAG_NONE               = 0x000,
+    /* major reason */
+    GPR_FLAG_MAJOR_BY_NOFREE    = 0x001,
+    GPR_FLAG_MAJOR_BY_OLDGEN    = 0x002,
+    GPR_FLAG_MAJOR_BY_SHADY     = 0x004,
+    GPR_FLAG_MAJOR_BY_FORCE     = 0x008,
+#if RGENGC_ESTIMATE_OLDMALLOC
+    GPR_FLAG_MAJOR_BY_OLDMALLOC = 0x020,
+#endif
+    GPR_FLAG_MAJOR_MASK         = 0x0ff,
+
+    /* gc reason */
+    GPR_FLAG_NEWOBJ             = 0x100,
+    GPR_FLAG_MALLOC             = 0x200,
+    GPR_FLAG_METHOD             = 0x400,
+    GPR_FLAG_CAPI               = 0x800,
+    GPR_FLAG_STRESS            = 0x1000,
+
+    /* others */
+    GPR_FLAG_IMMEDIATE_SWEEP   = 0x2000,
+    GPR_FLAG_HAVE_FINALIZE     = 0x4000,
+    GPR_FLAG_IMMEDIATE_MARK    = 0x8000,
+    GPR_FLAG_FULL_MARK        = 0x10000,
+    GPR_FLAG_COMPACT          = 0x20000,
+
+    GPR_DEFAULT_REASON =
+        (GPR_FLAG_FULL_MARK | GPR_FLAG_IMMEDIATE_MARK |
+         GPR_FLAG_IMMEDIATE_SWEEP | GPR_FLAG_CAPI),
+} gc_profile_record_flag;
+
+typedef struct gc_profile_record {
+    unsigned int flags;
+
+    double gc_time;
+    double gc_invoke_time;
+
+    size_t heap_total_objects;
+    size_t heap_use_size;
+    size_t heap_total_size;
+    size_t moved_objects;
+
+#if GC_PROFILE_MORE_DETAIL
+    double gc_mark_time;
+    double gc_sweep_time;
+
+    size_t heap_use_pages;
+    size_t heap_live_objects;
+    size_t heap_free_objects;
+
+    size_t allocate_increase;
+    size_t allocate_limit;
+
+    double prepare_time;
+    size_t removing_objects;
+    size_t empty_objects;
+#if GC_PROFILE_DETAIL_MEMORY
+    long maxrss;
+    long minflt;
+    long majflt;
+#endif
+#endif
+#if MALLOC_ALLOCATED_SIZE
+    size_t allocated_size;
+#endif
+
+#if RGENGC_PROFILE > 0
+    size_t old_objects;
+    size_t remembered_normal_objects;
+    size_t remembered_shady_objects;
+#endif
+} gc_profile_record;
+
+struct RMoved {
+    VALUE flags;
+    VALUE dummy;
+    VALUE destination;
+};
+
+#define RMOVED(obj) ((struct RMoved *)(obj))
+
+typedef uintptr_t bits_t;
+enum {
+    BITS_SIZE = sizeof(bits_t),
+    BITS_BITLENGTH = ( BITS_SIZE * CHAR_BIT )
+};
+
+struct heap_page_header {
+    struct heap_page *page;
+};
+
+struct heap_page_body {
+    struct heap_page_header header;
+    /* char gap[];      */
+    /* RVALUE values[]; */
+};
+
+#define STACK_CHUNK_SIZE 500
+
+typedef struct stack_chunk {
+    VALUE data[STACK_CHUNK_SIZE];
+    struct stack_chunk *next;
+} stack_chunk_t;
+
+typedef struct mark_stack {
+    stack_chunk_t *chunk;
+    stack_chunk_t *cache;
+    int index;
+    int limit;
+    size_t cache_size;
+    size_t unused_cache_size;
+} mark_stack_t;
+
+typedef int (*gc_compact_compare_func)(const void *l, const void *r, void *d);
+
+typedef struct rb_heap_struct {
+    short slot_size;
+
+    /* Basic statistics */
+    size_t total_allocated_pages;
+    size_t force_major_gc_count;
+    size_t force_incremental_marking_finish_count;
+    size_t total_allocated_objects;
+    size_t total_freed_objects;
+    size_t final_slots_count;
+
+    /* Sweeping statistics */
+    size_t freed_slots;
+    size_t empty_slots;
+
+    struct heap_page *free_pages;
+    struct ccan_list_head pages;
+    struct heap_page *sweeping_page; /* iterator for .pages */
+    struct heap_page *compact_cursor;
+    uintptr_t compact_cursor_index;
+    struct heap_page *pooled_pages;
+    size_t total_pages;      /* total page count in a heap */
+    size_t total_slots;      /* total slot count */
+
+} rb_heap_t;
+
+enum {
+    gc_stress_no_major,
+    gc_stress_no_immediate_sweep,
+    gc_stress_full_mark_after_malloc,
+    gc_stress_max
+};
+
+enum gc_mode {
+    gc_mode_none,
+    gc_mode_marking,
+    gc_mode_sweeping,
+    gc_mode_compacting,
+};
+
+typedef rbimpl_atomic_uint64_t gc_counter_t;
+
+#if !defined(HAVE_GCC_ATOMIC_BUILTINS_64) && !defined(_WIN32) && \
+    !(defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx)))
+# define MALLOC_COUNTERS_NEED_LOCK 1
+#endif
+
+struct gc_malloc_bytes {
+    gc_counter_t malloc;
+    gc_counter_t free;
+
+    /* Snapshots of `malloc` / `free` taken at the end of the last GC */
+    gc_counter_t malloc_at_last_gc;
+    gc_counter_t free_at_last_gc;
+};
+
+typedef struct rb_objspace {
+    struct {
+        struct gc_malloc_bytes counters;
+#if RGENGC_ESTIMATE_OLDMALLOC
+        struct gc_malloc_bytes oldcounters;
+#endif
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+        rb_nativethread_lock_t lock;
+#endif
+    } malloc_counters;
+
+    struct {
+        size_t limit;
+#if MALLOC_ALLOCATED_SIZE
+        size_t allocated_size;
+        size_t allocations;
+#endif
+    } malloc_params;
+
+    struct rb_gc_config {
+        bool full_mark;
+    } gc_config;
+
+    struct {
+        unsigned int mode : 2;
+        unsigned int immediate_sweep : 1;
+        unsigned int dont_gc : 1;
+        unsigned int dont_incremental : 1;
+        unsigned int during_gc : 1;
+        unsigned int during_compacting : 1;
+        unsigned int during_reference_updating : 1;
+        unsigned int gc_stressful: 1;
+        unsigned int during_minor_gc : 1;
+        unsigned int during_incremental_marking : 1;
+        unsigned int measure_gc : 1;
+    } flags;
+
+    rb_event_flag_t hook_events;
+
+    rb_heap_t heaps[HEAP_COUNT];
+    size_t empty_pages_count;
+    struct heap_page *empty_pages;
+
+    struct {
+        rb_atomic_t finalizing;
+    } atomic_flags;
+
+    mark_stack_t mark_stack;
+    size_t marked_slots;
+
+    struct {
+        rb_darray(struct heap_page *) sorted;
+
+        size_t allocated_pages;
+        size_t freed_pages;
+        uintptr_t range[2];
+        size_t freeable_pages;
+
+        size_t allocatable_bytes;
+
+        /* final */
+        VALUE deferred_final;
+    } heap_pages;
+
+    st_table *finalizer_table;
+
+    struct {
+        int run;
+        unsigned int latest_gc_info;
+        gc_profile_record *records;
+        gc_profile_record *current_record;
+        size_t next_index;
+        size_t size;
+
+#if GC_PROFILE_MORE_DETAIL
+        double prepare_time;
+#endif
+        double invoke_time;
+
+        size_t minor_gc_count;
+        size_t major_gc_count;
+        size_t compact_count;
+        size_t read_barrier_faults;
+#if RGENGC_PROFILE > 0
+        size_t total_generated_normal_object_count;
+        size_t total_generated_shady_object_count;
+        size_t total_shade_operation_count;
+        size_t total_promoted_count;
+        size_t total_remembered_normal_object_count;
+        size_t total_remembered_shady_object_count;
+
+#if RGENGC_PROFILE >= 2
+        size_t generated_normal_object_count_types[RUBY_T_MASK];
+        size_t generated_shady_object_count_types[RUBY_T_MASK];
+        size_t shade_operation_count_types[RUBY_T_MASK];
+        size_t promoted_types[RUBY_T_MASK];
+        size_t remembered_normal_object_count_types[RUBY_T_MASK];
+        size_t remembered_shady_object_count_types[RUBY_T_MASK];
+#endif
+#endif /* RGENGC_PROFILE */
+
+        /* temporary profiling space */
+        double gc_sweep_start_time;
+        size_t total_allocated_objects_at_gc_start;
+        size_t heap_used_at_gc_start;
+        size_t heap_total_slots_at_gc_start;
+
+        /* basic statistics */
+        size_t count;
+        unsigned long long marking_time_ns;
+        struct timespec marking_start_time;
+        unsigned long long sweeping_time_ns;
+        struct timespec sweeping_start_time;
+
+        /* Weak references */
+        size_t weak_references_count;
+    } profile;
+
+    VALUE gc_stress_mode;
+
+    struct {
+        bool parent_object_old_p;
+        VALUE parent_object;
+
+        int need_major_gc;
+        size_t last_major_gc;
+        size_t uncollectible_wb_unprotected_objects;
+        size_t uncollectible_wb_unprotected_objects_limit;
+        size_t old_objects;
+        size_t old_objects_limit;
+
+#if RGENGC_ESTIMATE_OLDMALLOC
+        size_t oldmalloc_increase_limit;
+#endif
+
+#if RGENGC_CHECK_MODE >= 2
+        struct st_table *allrefs_table;
+        size_t error_count;
+#endif
+    } rgengc;
+
+    struct {
+        size_t considered_count_table[T_MASK];
+        size_t moved_count_table[T_MASK];
+        size_t moved_up_count_table[T_MASK];
+        size_t moved_down_count_table[T_MASK];
+        size_t total_moved;
+
+        /* This function will be used, if set, to sort the heap prior to compaction */
+        gc_compact_compare_func compare_func;
+    } rcompactor;
+
+    struct {
+        size_t pooled_slots;
+        size_t step_slots;
+    } rincgc;
+
+#if GC_DEBUG_STRESS_TO_CLASS
+    VALUE stress_to_class;
+#endif
+
+    rb_darray(VALUE) weak_references;
+    rb_postponed_job_handle_t finalize_deferred_pjob;
+
+    unsigned long live_ractor_cache_count;
+
+    int sweeping_heap_count;
+
+    int fork_vm_lock_lev;
+
+    struct rb_gc_vm_context vm_context;
+} rb_objspace_t;
+
+#ifndef HEAP_PAGE_ALIGN_LOG
+/* default tiny heap size: 64KiB */
+#define HEAP_PAGE_ALIGN_LOG 16
+#endif
+
+#if RB_GC_OBJ_HAS_SUFFIX || GC_DEBUG
+struct rvalue_overhead {
+# if RB_GC_OBJ_HAS_SUFFIX
+    struct rb_gc_obj_suffix suffix;
+# endif
+# if GC_DEBUG
+    const char *file;
+    int line;
+# endif
+};
+
+// Make sure that RVALUE_OVERHEAD aligns to sizeof(VALUE)
+# define RVALUE_OVERHEAD (sizeof(struct { \
+    union { \
+        struct rvalue_overhead overhead; \
+        VALUE value; \
+    }; \
+}))
+size_t rb_gc_impl_obj_slot_size(VALUE obj);
+# define GET_RVALUE_OVERHEAD(obj) ((struct rvalue_overhead *)((uintptr_t)obj + rb_gc_impl_obj_slot_size(obj)))
+#else
+# ifndef RVALUE_OVERHEAD
+#  define RVALUE_OVERHEAD 0
+# endif
+#endif
+
+#define RVALUE_SLOT_SIZE (sizeof(struct RBasic) + sizeof(VALUE[RBIMPL_RVALUE_EMBED_LEN_MAX]) + RVALUE_OVERHEAD)
+
+static const size_t pool_slot_sizes[HEAP_COUNT] = {
+#define SLOT(size) ((size) + RVALUE_OVERHEAD),
+    EACH_POOL_SLOT_SIZE(SLOT)
+#undef SLOT
+};
+
+/* Precomputed reciprocals for fast slot index calculation.
+ * For slot size d: reciprocal = ceil(2^48 / d).
+ * Then offset / d == (uint32_t)((offset * reciprocal) >> 48)
+ * for all offset < HEAP_PAGE_SIZE. */
+#define SLOT_RECIPROCAL_SHIFT 48
+#define SLOT_RECIPROCAL(size) (((1ULL << SLOT_RECIPROCAL_SHIFT) + (size) - 1) / (size))
+
+static const uint64_t heap_slot_reciprocal_table[HEAP_COUNT] = {
+#define SLOT(size) SLOT_RECIPROCAL((size) + RVALUE_OVERHEAD),
+    EACH_POOL_SLOT_SIZE(SLOT)
+#undef SLOT
+};
+
+#if SIZEOF_VALUE >= 8
+static uint8_t size_to_heap_idx[1024 / 8 + 1];
+#else
+static uint8_t size_to_heap_idx[512 / 8 + 1];
+#endif
+
+#ifndef MAX
+# define MAX(a, b) (((a) > (b)) ? (a) : (b))
+#endif
+#ifndef MIN
+# define MIN(a, b) (((a) < (b)) ? (a) : (b))
+#endif
+#define roomof(x, y) (((x) + (y) - 1) / (y))
+#define CEILDIV(i, mod) roomof(i, mod)
+#define MIN_POOL_SLOT_SIZE 32
+enum {
+    HEAP_PAGE_ALIGN = (1UL << HEAP_PAGE_ALIGN_LOG),
+    HEAP_PAGE_ALIGN_MASK = (~(~0UL << HEAP_PAGE_ALIGN_LOG)),
+    HEAP_PAGE_SIZE = HEAP_PAGE_ALIGN,
+    HEAP_PAGE_BITMAP_LIMIT = CEILDIV(CEILDIV(HEAP_PAGE_SIZE, MIN_POOL_SLOT_SIZE), BITS_BITLENGTH),
+    HEAP_PAGE_BITMAP_SIZE = (BITS_SIZE * HEAP_PAGE_BITMAP_LIMIT),
+};
+#define HEAP_PAGE_ALIGN (1 << HEAP_PAGE_ALIGN_LOG)
+#define HEAP_PAGE_SIZE HEAP_PAGE_ALIGN
+
+#if !defined(INCREMENTAL_MARK_STEP_ALLOCATIONS)
+# define INCREMENTAL_MARK_STEP_ALLOCATIONS 500
+#endif
+
+#undef INIT_HEAP_PAGE_ALLOC_USE_MMAP
+/* Must define either HEAP_PAGE_ALLOC_USE_MMAP or
+ * INIT_HEAP_PAGE_ALLOC_USE_MMAP. */
+
+#ifndef HAVE_MMAP
+/* We can't use mmap of course, if it is not available. */
+static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
+
+#elif defined(__wasm__)
+/* wasmtime does not have proper support for mmap.
+ * See https://github.com/bytecodealliance/wasmtime/blob/main/docs/WASI-rationale.md#why-no-mmap-and-friends
+ */
+static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
+
+#elif HAVE_CONST_PAGE_SIZE
+/* If we have the PAGE_SIZE and it is a constant, then we can directly use it. */
+static const bool HEAP_PAGE_ALLOC_USE_MMAP = (PAGE_SIZE <= HEAP_PAGE_SIZE);
+
+#elif defined(PAGE_MAX_SIZE) && (PAGE_MAX_SIZE <= HEAP_PAGE_SIZE)
+/* If we can use the maximum page size. */
+static const bool HEAP_PAGE_ALLOC_USE_MMAP = true;
+
+#elif defined(PAGE_SIZE)
+/* If the PAGE_SIZE macro can be used dynamically. */
+# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (PAGE_SIZE <= HEAP_PAGE_SIZE)
+
+#elif defined(HAVE_SYSCONF) && defined(_SC_PAGE_SIZE)
+/* If we can use sysconf to determine the page size. */
+# define INIT_HEAP_PAGE_ALLOC_USE_MMAP (sysconf(_SC_PAGE_SIZE) <= HEAP_PAGE_SIZE)
+
+#else
+/* Otherwise we can't determine the system page size, so don't use mmap. */
+static const bool HEAP_PAGE_ALLOC_USE_MMAP = false;
+#endif
+
+#ifdef INIT_HEAP_PAGE_ALLOC_USE_MMAP
+/* We can determine the system page size at runtime. */
+# define HEAP_PAGE_ALLOC_USE_MMAP (heap_page_alloc_use_mmap != false)
+
+static bool heap_page_alloc_use_mmap;
+#endif
+
+#define RVALUE_AGE_BIT_COUNT 2
+#define RVALUE_AGE_BIT_MASK (((bits_t)1 << RVALUE_AGE_BIT_COUNT) - 1)
+#define RVALUE_OLD_AGE   3
+
+struct free_slot {
+    VALUE flags;		/* always 0 for freed obj */
+    struct free_slot *next;
+};
+
+struct heap_page {
+    /* Cache line 0: allocation fast path + SLOT_INDEX */
+    struct free_slot *freelist;
+    uintptr_t start;
+    uint64_t slot_size_reciprocal;
+    unsigned short slot_size;
+    unsigned short total_slots;
+    unsigned short free_slots;
+    unsigned short final_slots;
+    unsigned short pinned_slots;
+    struct {
+        unsigned int before_sweep : 1;
+        unsigned int has_remembered_objects : 1;
+        unsigned int has_uncollectible_wb_unprotected_objects : 1;
+    } flags;
+
+    rb_heap_t *heap;
+
+    struct heap_page *free_next;
+    struct heap_page_body *body;
+    struct ccan_list_node page_node;
+
+    bits_t wb_unprotected_bits[HEAP_PAGE_BITMAP_LIMIT];
+    /* the following three bitmaps are cleared at the beginning of full GC */
+    bits_t mark_bits[HEAP_PAGE_BITMAP_LIMIT];
+    bits_t uncollectible_bits[HEAP_PAGE_BITMAP_LIMIT];
+    bits_t marking_bits[HEAP_PAGE_BITMAP_LIMIT];
+
+    bits_t remembered_bits[HEAP_PAGE_BITMAP_LIMIT];
+
+    /* If set, the object is not movable */
+    bits_t pinned_bits[HEAP_PAGE_BITMAP_LIMIT];
+    bits_t age_bits[HEAP_PAGE_BITMAP_LIMIT * RVALUE_AGE_BIT_COUNT];
+};
+
+/*
+ * When asan is enabled, this will prohibit writing to the freelist until it is unlocked
+ */
+static void
+asan_lock_freelist(struct heap_page *page)
+{
+    asan_poison_memory_region(&page->freelist, sizeof(struct free_list *));
+}
+
+/*
+ * When asan is enabled, this will enable the ability to write to the freelist
+ */
+static void
+asan_unlock_freelist(struct heap_page *page)
+{
+    asan_unpoison_memory_region(&page->freelist, sizeof(struct free_list *), false);
+}
+
+static inline bool
+heap_page_in_global_empty_pages_pool(rb_objspace_t *objspace, struct heap_page *page)
+{
+    if (page->total_slots == 0) {
+        GC_ASSERT(page->start == 0);
+        GC_ASSERT(page->slot_size == 0);
+        GC_ASSERT(page->heap == NULL);
+        GC_ASSERT(page->free_slots == 0);
+        asan_unpoisoning_memory_region(&page->freelist, sizeof(&page->freelist)) {
+            GC_ASSERT(page->freelist == NULL);
+        }
+
+        return true;
+    }
+    else {
+        GC_ASSERT(page->start != 0);
+        GC_ASSERT(page->slot_size != 0);
+        GC_ASSERT(page->heap != NULL);
+
+        return false;
+    }
+}
+
+#define GET_PAGE_BODY(x)   ((struct heap_page_body *)((bits_t)(x) & ~(HEAP_PAGE_ALIGN_MASK)))
+#define GET_PAGE_HEADER(x) (&GET_PAGE_BODY(x)->header)
+#define GET_HEAP_PAGE(x)   (GET_PAGE_HEADER(x)->page)
+
+static inline size_t
+slot_index_for_offset(size_t offset, uint64_t reciprocal)
+{
+    return (uint32_t)(((uint64_t)offset * reciprocal) >> SLOT_RECIPROCAL_SHIFT);
+}
+
+#define SLOT_INDEX(page, p)          slot_index_for_offset((uintptr_t)(p) - (page)->start, (page)->slot_size_reciprocal)
+#define SLOT_BITMAP_INDEX(page, p)   (SLOT_INDEX(page, p) / BITS_BITLENGTH)
+#define SLOT_BITMAP_OFFSET(page, p)  (SLOT_INDEX(page, p) & (BITS_BITLENGTH - 1))
+#define SLOT_BITMAP_BIT(page, p)     ((bits_t)1 << SLOT_BITMAP_OFFSET(page, p))
+
+#define _MARKED_IN_BITMAP(bits, page, p)  ((bits)[SLOT_BITMAP_INDEX(page, p)] & SLOT_BITMAP_BIT(page, p))
+#define _MARK_IN_BITMAP(bits, page, p)    ((bits)[SLOT_BITMAP_INDEX(page, p)] |= SLOT_BITMAP_BIT(page, p))
+#define _CLEAR_IN_BITMAP(bits, page, p)   ((bits)[SLOT_BITMAP_INDEX(page, p)] &= ~SLOT_BITMAP_BIT(page, p))
+
+#define MARKED_IN_BITMAP(bits, p)    _MARKED_IN_BITMAP(bits, GET_HEAP_PAGE(p), p)
+#define MARK_IN_BITMAP(bits, p)      _MARK_IN_BITMAP(bits, GET_HEAP_PAGE(p), p)
+#define CLEAR_IN_BITMAP(bits, p)     _CLEAR_IN_BITMAP(bits, GET_HEAP_PAGE(p), p)
+
+#define GET_HEAP_MARK_BITS(x)           (&GET_HEAP_PAGE(x)->mark_bits[0])
+#define GET_HEAP_PINNED_BITS(x)         (&GET_HEAP_PAGE(x)->pinned_bits[0])
+#define GET_HEAP_UNCOLLECTIBLE_BITS(x)  (&GET_HEAP_PAGE(x)->uncollectible_bits[0])
+#define GET_HEAP_WB_UNPROTECTED_BITS(x) (&GET_HEAP_PAGE(x)->wb_unprotected_bits[0])
+#define GET_HEAP_MARKING_BITS(x)        (&GET_HEAP_PAGE(x)->marking_bits[0])
+
+static int
+RVALUE_AGE_GET(VALUE obj)
+{
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+    bits_t *age_bits = page->age_bits;
+    size_t slot_idx = SLOT_INDEX(page, obj);
+    size_t idx = (slot_idx / BITS_BITLENGTH) * 2;
+    int shift = (int)(slot_idx & (BITS_BITLENGTH - 1));
+    int lo = (age_bits[idx] >> shift) & 1;
+    int hi = (age_bits[idx + 1] >> shift) & 1;
+    return lo | (hi << 1);
+}
+
+static void
+RVALUE_AGE_SET_BITMAP(VALUE obj, int age)
+{
+    RUBY_ASSERT(age <= RVALUE_OLD_AGE);
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+    bits_t *age_bits = page->age_bits;
+    size_t slot_idx = SLOT_INDEX(page, obj);
+    size_t idx = (slot_idx / BITS_BITLENGTH) * 2;
+    int shift = (int)(slot_idx & (BITS_BITLENGTH - 1));
+    bits_t mask = (bits_t)1 << shift;
+
+    age_bits[idx]     = (age_bits[idx]     & ~mask) | ((bits_t)(age & 1) << shift);
+    age_bits[idx + 1] = (age_bits[idx + 1] & ~mask) | ((bits_t)((age >> 1) & 1) << shift);
+}
+
+static void
+RVALUE_AGE_SET(VALUE obj, int age)
+{
+    RVALUE_AGE_SET_BITMAP(obj, age);
+    if (age == RVALUE_OLD_AGE) {
+        RB_FL_SET_RAW(obj, RUBY_FL_PROMOTED);
+    }
+    else {
+        RB_FL_UNSET_RAW(obj, RUBY_FL_PROMOTED);
+    }
+}
+
+#define malloc_limit		objspace->malloc_params.limit
+#define malloc_increase 	gc_malloc_counters_increase_unsigned(objspace, &objspace->malloc_counters.counters)
+#define malloc_allocated_size 	objspace->malloc_params.allocated_size
+
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+# define MALLOC_COUNTERS_LOCK(o)   rb_native_mutex_lock(&(o)->malloc_counters.lock)
+# define MALLOC_COUNTERS_UNLOCK(o) rb_native_mutex_unlock(&(o)->malloc_counters.lock)
+#else
+# define MALLOC_COUNTERS_LOCK(o)   ((void)0)
+# define MALLOC_COUNTERS_UNLOCK(o) ((void)0)
+#endif
+
+static inline void
+gc_counter_add(gc_counter_t *p, size_t delta)
+{
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    *p += (gc_counter_t)delta;
+#else
+    rbimpl_atomic_u64_fetch_add_relaxed(p, (uint64_t)delta);
+#endif
+}
+
+static inline gc_counter_t
+gc_counter_load_relaxed(const gc_counter_t *p)
+{
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    return *p;
+#else
+    return rbimpl_atomic_u64_load_relaxed(p);
+#endif
+}
+
+static inline gc_counter_t
+gc_counter_load_acquire(const gc_counter_t *p)
+{
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    return *p;
+#else
+    return rbimpl_atomic_u64_load_acquire(p);
+#endif
+}
+
+static inline void
+gc_counter_store_release(gc_counter_t *p, gc_counter_t v)
+{
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    *p = v;
+#else
+    rbimpl_atomic_u64_set_release(p, v);
+#endif
+}
+
+static inline int64_t
+gc_malloc_counters_increase(rb_objspace_t *objspace, const struct gc_malloc_bytes *c)
+{
+    MALLOC_COUNTERS_LOCK(objspace);
+    gc_counter_t malloc_at = gc_counter_load_acquire(&c->malloc_at_last_gc);
+    gc_counter_t free_at   = gc_counter_load_acquire(&c->free_at_last_gc);
+    gc_counter_t malloc_now = gc_counter_load_relaxed(&c->malloc);
+    gc_counter_t free_now   = gc_counter_load_relaxed(&c->free);
+    MALLOC_COUNTERS_UNLOCK(objspace);
+
+    gc_counter_t malloc_delta = malloc_now - malloc_at;
+    gc_counter_t free_delta   = free_now   - free_at;
+
+    if (malloc_delta >= free_delta) {
+        return (int64_t)(malloc_delta - free_delta);
+    }
+    else {
+        return -(int64_t)(free_delta - malloc_delta);
+    }
+}
+
+static inline size_t
+gc_malloc_counters_increase_unsigned(rb_objspace_t *objspace, const struct gc_malloc_bytes *c)
+{
+    int64_t inc = gc_malloc_counters_increase(objspace, c);
+    if (inc <= 0) return 0;
+#if SIZEOF_SIZE_T < 8
+    if ((uint64_t)inc > SIZE_MAX) return SIZE_MAX;
+#endif
+    return (size_t)inc;
+}
+
+static inline int64_t
+gc_malloc_counters_snapshot(rb_objspace_t *objspace, struct gc_malloc_bytes *c)
+{
+    MALLOC_COUNTERS_LOCK(objspace);
+    gc_counter_t malloc_now = gc_counter_load_relaxed(&c->malloc);
+    gc_counter_t free_now   = gc_counter_load_relaxed(&c->free);
+    gc_counter_t malloc_at  = gc_counter_load_relaxed(&c->malloc_at_last_gc);
+    gc_counter_t free_at    = gc_counter_load_relaxed(&c->free_at_last_gc);
+    gc_counter_store_release(&c->malloc_at_last_gc, malloc_now);
+    gc_counter_store_release(&c->free_at_last_gc,   free_now);
+    MALLOC_COUNTERS_UNLOCK(objspace);
+
+    gc_counter_t malloc_delta = malloc_now - malloc_at;
+    gc_counter_t free_delta   = free_now   - free_at;
+
+    if (malloc_delta >= free_delta) {
+        return (int64_t)(malloc_delta - free_delta);
+    }
+    else {
+        return -(int64_t)(free_delta - malloc_delta);
+    }
+}
+
+#define heap_pages_lomem	objspace->heap_pages.range[0]
+#define heap_pages_himem	objspace->heap_pages.range[1]
+#define heap_pages_freeable_pages	objspace->heap_pages.freeable_pages
+#define heap_pages_deferred_final	objspace->heap_pages.deferred_final
+#define heaps              objspace->heaps
+#define during_gc		objspace->flags.during_gc
+#define finalizing		objspace->atomic_flags.finalizing
+#define finalizer_table 	objspace->finalizer_table
+#define ruby_gc_stressful	objspace->flags.gc_stressful
+#define ruby_gc_stress_mode     objspace->gc_stress_mode
+#if GC_DEBUG_STRESS_TO_CLASS
+#define stress_to_class         objspace->stress_to_class
+#define set_stress_to_class(c)  (stress_to_class = (c))
+#else
+#define stress_to_class         ((void)objspace, 0)
+#define set_stress_to_class(c)  ((void)objspace, (c))
+#endif
+
+#if 0
+#define dont_gc_on()          (fprintf(stderr, "dont_gc_on@%s:%d\n",      __FILE__, __LINE__), objspace->flags.dont_gc = 1)
+#define dont_gc_off()         (fprintf(stderr, "dont_gc_off@%s:%d\n",     __FILE__, __LINE__), objspace->flags.dont_gc = 0)
+#define dont_gc_set(b)        (fprintf(stderr, "dont_gc_set(%d)@%s:%d\n", __FILE__, __LINE__), objspace->flags.dont_gc = (int)(b))
+#define dont_gc_val()         (objspace->flags.dont_gc)
+#else
+#define dont_gc_on()          (objspace->flags.dont_gc = 1)
+#define dont_gc_off()         (objspace->flags.dont_gc = 0)
+#define dont_gc_set(b)        (objspace->flags.dont_gc = (int)(b))
+#define dont_gc_val()         (objspace->flags.dont_gc)
+#endif
+
+#define gc_config_full_mark_set(b) (objspace->gc_config.full_mark = (int)(b))
+#define gc_config_full_mark_val    (objspace->gc_config.full_mark)
+
+#ifndef DURING_GC_COULD_MALLOC_REGION_START
+# define DURING_GC_COULD_MALLOC_REGION_START() \
+    assert(rb_during_gc()); \
+    bool _prev_enabled = rb_gc_impl_gc_enabled_p(objspace); \
+    rb_gc_impl_gc_disable(objspace, false)
+#endif
+
+#ifndef DURING_GC_COULD_MALLOC_REGION_END
+# define DURING_GC_COULD_MALLOC_REGION_END() \
+    if (_prev_enabled) rb_gc_impl_gc_enable(objspace)
+#endif
+
+static inline enum gc_mode
+gc_mode_verify(enum gc_mode mode)
+{
+#if RGENGC_CHECK_MODE > 0
+    switch (mode) {
+      case gc_mode_none:
+      case gc_mode_marking:
+      case gc_mode_sweeping:
+      case gc_mode_compacting:
+        break;
+      default:
+        rb_bug("gc_mode_verify: unreachable (%d)", (int)mode);
+    }
+#endif
+    return mode;
+}
+
+static inline bool
+has_sweeping_pages(rb_objspace_t *objspace)
+{
+    return objspace->sweeping_heap_count != 0;
+}
+
+static inline size_t
+heap_eden_total_pages(rb_objspace_t *objspace)
+{
+    size_t count = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        count += (&heaps[i])->total_pages;
+    }
+    return count;
+}
+
+static inline size_t
+total_allocated_objects(rb_objspace_t *objspace)
+{
+    size_t count = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        count += heap->total_allocated_objects;
+    }
+    return count;
+}
+
+static inline size_t
+total_freed_objects(rb_objspace_t *objspace)
+{
+    size_t count = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        count += heap->total_freed_objects;
+    }
+    return count;
+}
+
+static inline size_t
+total_final_slots_count(rb_objspace_t *objspace)
+{
+    size_t count = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        count += heap->final_slots_count;
+    }
+    return count;
+}
+
+#define gc_mode(objspace)                gc_mode_verify((enum gc_mode)(objspace)->flags.mode)
+#define gc_mode_set(objspace, m)         ((objspace)->flags.mode = (unsigned int)gc_mode_verify(m))
+#define gc_needs_major_flags objspace->rgengc.need_major_gc
+
+#define is_marking(objspace)             (gc_mode(objspace) == gc_mode_marking)
+#define is_sweeping(objspace)            (gc_mode(objspace) == gc_mode_sweeping)
+#define is_full_marking(objspace)        ((objspace)->flags.during_minor_gc == FALSE)
+#define is_incremental_marking(objspace) ((objspace)->flags.during_incremental_marking != FALSE)
+#define will_be_incremental_marking(objspace) ((objspace)->rgengc.need_major_gc != GPR_FLAG_NONE)
+/*
+ * Byte budget for incremental sweep steps. Each step sweeps at most
+ * this many bytes worth of slots before yielding. The effective slot
+ * count per step is GC_INCREMENTAL_SWEEP_BYTES / heap->slot_size,
+ * so larger slot pools (which are less heavily used) naturally get
+ * fewer slots swept per step.
+ *
+ * Baseline: 2048 slots * RVALUE_SLOT_SIZE = 2048 * 40 = 81920 bytes,
+ * preserving the historical behavior for the smallest heap.
+ */
+#define GC_INCREMENTAL_SWEEP_BYTES           (2048 * RVALUE_SLOT_SIZE)
+#define GC_INCREMENTAL_SWEEP_POOL_BYTES      (1024 * RVALUE_SLOT_SIZE)
+#define is_lazy_sweeping(objspace)           (GC_ENABLE_LAZY_SWEEP && has_sweeping_pages(objspace))
+/* In lazy sweeping or the previous incremental marking finished and did not yield a free page. */
+#define needs_continue_sweeping(objspace, heap) \
+    ((heap)->free_pages == NULL && is_lazy_sweeping(objspace))
+
+#if SIZEOF_LONG == SIZEOF_VOIDP
+# define obj_id_to_ref(objid) ((objid) ^ FIXNUM_FLAG) /* unset FIXNUM_FLAG */
+#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
+# define obj_id_to_ref(objid) (FIXNUM_P(objid) ? \
+   ((objid) ^ FIXNUM_FLAG) : (NUM2PTR(objid) << 1))
+#else
+# error not supported
+#endif
+
+struct RZombie {
+    VALUE flags;
+    VALUE next;
+    void (*dfree)(void *);
+    void *data;
+};
+
+#define RZOMBIE(o) ((struct RZombie *)(o))
+
+static bool ruby_enable_autocompact = false;
+#if RGENGC_CHECK_MODE
+static gc_compact_compare_func ruby_autocompact_compare_func;
+#endif
+
+static void init_mark_stack(mark_stack_t *stack);
+static int garbage_collect(rb_objspace_t *, unsigned int reason);
+
+static int  gc_start(rb_objspace_t *objspace, unsigned int reason);
+static void gc_rest(rb_objspace_t *objspace);
+
+enum gc_enter_event {
+    gc_enter_event_start,
+    gc_enter_event_continue,
+    gc_enter_event_rest,
+    gc_enter_event_finalizer,
+};
+
+static inline void gc_enter(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev);
+static inline void gc_exit(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev);
+static void gc_marking_enter(rb_objspace_t *objspace);
+static void gc_marking_exit(rb_objspace_t *objspace);
+static void gc_sweeping_enter(rb_objspace_t *objspace);
+static void gc_sweeping_exit(rb_objspace_t *objspace);
+static bool gc_marks_continue(rb_objspace_t *objspace, rb_heap_t *heap);
+
+static void gc_sweep(rb_objspace_t *objspace);
+static void gc_sweep_finish_heap(rb_objspace_t *objspace, rb_heap_t *heap);
+static void gc_sweep_continue(rb_objspace_t *objspace, rb_heap_t *heap);
+
+static inline void gc_mark(rb_objspace_t *objspace, VALUE ptr);
+static inline void gc_pin(rb_objspace_t *objspace, VALUE ptr);
+static inline void gc_mark_and_pin(rb_objspace_t *objspace, VALUE ptr);
+
+static int gc_mark_stacked_objects_incremental(rb_objspace_t *, size_t count);
+NO_SANITIZE("memory", static inline bool is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr));
+
+static void gc_verify_internal_consistency(void *objspace_ptr);
+
+static double getrusage_time(void);
+static inline void gc_prof_setup_new_record(rb_objspace_t *objspace, unsigned int reason);
+static inline void gc_prof_timer_start(rb_objspace_t *);
+static inline void gc_prof_timer_stop(rb_objspace_t *);
+static inline void gc_prof_mark_timer_start(rb_objspace_t *);
+static inline void gc_prof_mark_timer_stop(rb_objspace_t *);
+static inline void gc_prof_sweep_timer_start(rb_objspace_t *);
+static inline void gc_prof_sweep_timer_stop(rb_objspace_t *);
+static inline void gc_prof_set_malloc_info(rb_objspace_t *);
+static inline void gc_prof_set_heap_info(rb_objspace_t *);
+
+#define gc_prof_record(objspace) (objspace)->profile.current_record
+#define gc_prof_enabled(objspace) ((objspace)->profile.run && (objspace)->profile.current_record)
+
+#ifdef HAVE_VA_ARGS_MACRO
+# define gc_report(level, objspace, ...) \
+    if (!RGENGC_DEBUG_ENABLED(level)) {} else gc_report_body(level, objspace, __VA_ARGS__)
+#else
+# define gc_report if (!RGENGC_DEBUG_ENABLED(0)) {} else gc_report_body
+#endif
+PRINTF_ARGS(static void gc_report_body(int level, rb_objspace_t *objspace, const char *fmt, ...), 3, 4);
+
+static void gc_finalize_deferred(void *dmy);
+
+#if USE_TICK_T
+
+/* the following code is only for internal tuning. */
+
+/* Source code to use RDTSC is quoted and modified from
+ * https://www.mcs.anl.gov/~kazutomo/rdtsc.html
+ * written by Kazutomo Yoshii <kazutomo@mcs.anl.gov>
+ */
+
+#if defined(__GNUC__) && defined(__i386__)
+typedef unsigned long long tick_t;
+#define PRItick "llu"
+static inline tick_t
+tick(void)
+{
+    unsigned long long int x;
+    __asm__ __volatile__ ("rdtsc" : "=A" (x));
+    return x;
+}
+
+#elif defined(__GNUC__) && defined(__x86_64__)
+typedef unsigned long long tick_t;
+#define PRItick "llu"
+
+static __inline__ tick_t
+tick(void)
+{
+    unsigned long hi, lo;
+    __asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
+    return ((unsigned long long)lo)|( ((unsigned long long)hi)<<32);
+}
+
+#elif defined(__powerpc64__) && (GCC_VERSION_SINCE(4,8,0) || defined(__clang__))
+typedef unsigned long long tick_t;
+#define PRItick "llu"
+
+static __inline__ tick_t
+tick(void)
+{
+    unsigned long long val = __builtin_ppc_get_timebase();
+    return val;
+}
+
+#elif defined(__POWERPC__) && defined(__APPLE__)
+/* Implementation for macOS PPC by @nobu
+ * See: https://github.com/ruby/ruby/pull/5975#discussion_r890045558
+ */
+typedef unsigned long long tick_t;
+#define PRItick "llu"
+
+static __inline__ tick_t
+tick(void)
+{
+    unsigned long int upper, lower, tmp;
+    # define mftbu(r) __asm__ volatile("mftbu   %0" : "=r"(r))
+    # define mftb(r)  __asm__ volatile("mftb    %0" : "=r"(r))
+        do {
+            mftbu(upper);
+            mftb(lower);
+            mftbu(tmp);
+        } while (tmp != upper);
+    return ((tick_t)upper << 32) | lower;
+}
+
+#elif defined(__aarch64__) &&  defined(__GNUC__)
+typedef unsigned long tick_t;
+#define PRItick "lu"
+
+static __inline__ tick_t
+tick(void)
+{
+    unsigned long val;
+    __asm__ __volatile__ ("mrs %0, cntvct_el0" : "=r" (val));
+    return val;
+}
+
+
+#elif defined(_WIN32) && defined(_MSC_VER)
+#include <intrin.h>
+typedef unsigned __int64 tick_t;
+#define PRItick "llu"
+
+static inline tick_t
+tick(void)
+{
+    return __rdtsc();
+}
+
+#else /* use clock */
+typedef clock_t tick_t;
+#define PRItick "llu"
+
+static inline tick_t
+tick(void)
+{
+    return clock();
+}
+#endif /* TSC */
+#else /* USE_TICK_T */
+#define MEASURE_LINE(expr) expr
+#endif /* USE_TICK_T */
+
+static inline VALUE check_rvalue_consistency(rb_objspace_t *objspace, const VALUE obj);
+
+#define RVALUE_MARKED_BITMAP(obj)         MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(obj), (obj))
+#define RVALUE_WB_UNPROTECTED_BITMAP(obj) MARKED_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), (obj))
+#define RVALUE_MARKING_BITMAP(obj)        MARKED_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), (obj))
+#define RVALUE_UNCOLLECTIBLE_BITMAP(obj)  MARKED_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), (obj))
+#define RVALUE_PINNED_BITMAP(obj)         MARKED_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), (obj))
+
+static inline int
+RVALUE_MARKED(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return RVALUE_MARKED_BITMAP(obj) != 0;
+}
+
+static inline int
+RVALUE_PINNED(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return RVALUE_PINNED_BITMAP(obj) != 0;
+}
+
+static inline int
+RVALUE_WB_UNPROTECTED(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
+}
+
+static inline int
+RVALUE_MARKING(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return RVALUE_MARKING_BITMAP(obj) != 0;
+}
+
+static inline int
+RVALUE_REMEMBERED(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
+}
+
+static inline int
+RVALUE_UNCOLLECTIBLE(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    return RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
+}
+
+#define RVALUE_PAGE_WB_UNPROTECTED(page, obj) MARKED_IN_BITMAP((page)->wb_unprotected_bits, (obj))
+#define RVALUE_PAGE_UNCOLLECTIBLE(page, obj)  MARKED_IN_BITMAP((page)->uncollectible_bits, (obj))
+#define RVALUE_PAGE_MARKING(page, obj)        MARKED_IN_BITMAP((page)->marking_bits, (obj))
+
+static int rgengc_remember(rb_objspace_t *objspace, VALUE obj);
+static void rgengc_mark_and_rememberset_clear(rb_objspace_t *objspace, rb_heap_t *heap);
+static void rgengc_rememberset_mark(rb_objspace_t *objspace, rb_heap_t *heap);
+
+static int
+check_rvalue_consistency_force(rb_objspace_t *objspace, const VALUE obj, int terminate)
+{
+    int err = 0;
+
+    int lev = RB_GC_VM_LOCK_NO_BARRIER();
+    {
+        if (SPECIAL_CONST_P(obj)) {
+            fprintf(stderr, "check_rvalue_consistency: %p is a special const.\n", (void *)obj);
+            err++;
+        }
+        else if (!is_pointer_to_heap(objspace, (void *)obj)) {
+            struct heap_page *empty_page = objspace->empty_pages;
+            while (empty_page) {
+                if ((uintptr_t)empty_page->body <= (uintptr_t)obj &&
+                        (uintptr_t)obj < (uintptr_t)empty_page->body + HEAP_PAGE_SIZE) {
+                    GC_ASSERT(heap_page_in_global_empty_pages_pool(objspace, empty_page));
+                    fprintf(stderr, "check_rvalue_consistency: %p is in an empty page (%p).\n",
+                            (void *)obj, (void *)empty_page);
+                    err++;
+                    goto skip;
+                }
+            }
+            fprintf(stderr, "check_rvalue_consistency: %p is not a Ruby object.\n", (void *)obj);
+            err++;
+          skip:
+            ;
+        }
+        else {
+            const int wb_unprotected_bit = RVALUE_WB_UNPROTECTED_BITMAP(obj) != 0;
+            const int uncollectible_bit = RVALUE_UNCOLLECTIBLE_BITMAP(obj) != 0;
+            const int mark_bit = RVALUE_MARKED_BITMAP(obj) != 0;
+            const int marking_bit = RVALUE_MARKING_BITMAP(obj) != 0;
+            const int remembered_bit = MARKED_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj) != 0;
+            const int age = RVALUE_AGE_GET((VALUE)obj);
+
+            if (heap_page_in_global_empty_pages_pool(objspace, GET_HEAP_PAGE(obj))) {
+                fprintf(stderr, "check_rvalue_consistency: %s is in tomb page.\n", rb_obj_info(obj));
+                err++;
+            }
+            if (BUILTIN_TYPE(obj) == T_NONE) {
+                fprintf(stderr, "check_rvalue_consistency: %s is T_NONE.\n", rb_obj_info(obj));
+                err++;
+            }
+            if (BUILTIN_TYPE(obj) == T_ZOMBIE) {
+                fprintf(stderr, "check_rvalue_consistency: %s is T_ZOMBIE.\n", rb_obj_info(obj));
+                err++;
+            }
+
+            if (BUILTIN_TYPE(obj) != T_DATA) {
+                rb_obj_memsize_of((VALUE)obj);
+            }
+
+            /* check generation
+             *
+             * OLD == age == 3 && old-bitmap && mark-bit (except incremental marking)
+             */
+            if (age > 0 && wb_unprotected_bit) {
+                fprintf(stderr, "check_rvalue_consistency: %s is not WB protected, but age is %d > 0.\n", rb_obj_info(obj), age);
+                err++;
+            }
+
+            if (!is_marking(objspace) && uncollectible_bit && !mark_bit) {
+                fprintf(stderr, "check_rvalue_consistency: %s is uncollectible, but is not marked while !gc.\n", rb_obj_info(obj));
+                err++;
+            }
+
+            if (!is_full_marking(objspace)) {
+                if (uncollectible_bit && age != RVALUE_OLD_AGE && !wb_unprotected_bit) {
+                    fprintf(stderr, "check_rvalue_consistency: %s is uncollectible, but not old (age: %d) and not WB unprotected.\n",
+                            rb_obj_info(obj), age);
+                    err++;
+                }
+                if (remembered_bit && age != RVALUE_OLD_AGE) {
+                    fprintf(stderr, "check_rvalue_consistency: %s is remembered, but not old (age: %d).\n",
+                            rb_obj_info(obj), age);
+                    err++;
+                }
+            }
+
+            /*
+             * check coloring
+             *
+             *               marking:false marking:true
+             * marked:false  white         *invalid*
+             * marked:true   black         grey
+             */
+            if (is_incremental_marking(objspace) && marking_bit) {
+                if (!is_marking(objspace) && !mark_bit) {
+                    fprintf(stderr, "check_rvalue_consistency: %s is marking, but not marked.\n", rb_obj_info(obj));
+                    err++;
+                }
+            }
+        }
+    }
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+
+    if (err > 0 && terminate) {
+        rb_bug("check_rvalue_consistency_force: there is %d errors.", err);
+    }
+    return err;
+}
+
+#if RGENGC_CHECK_MODE == 0
+static inline VALUE
+check_rvalue_consistency(rb_objspace_t *objspace, const VALUE obj)
+{
+    return obj;
+}
+#else
+static VALUE
+check_rvalue_consistency(rb_objspace_t *objspace, const VALUE obj)
+{
+    check_rvalue_consistency_force(objspace, obj, TRUE);
+    return obj;
+}
+#endif
+
+static inline bool
+gc_object_moved_p(rb_objspace_t *objspace, VALUE obj)
+{
+
+    bool ret;
+    asan_unpoisoning_object(obj) {
+        ret = BUILTIN_TYPE(obj) == T_MOVED;
+    }
+    return ret;
+}
+
+static inline int
+RVALUE_OLD_P(rb_objspace_t *objspace, VALUE obj)
+{
+    GC_ASSERT(!RB_SPECIAL_CONST_P(obj));
+    check_rvalue_consistency(objspace, obj);
+    // Because this will only ever be called on GC controlled objects,
+    // we can use the faster _RAW function here
+    return RB_OBJ_PROMOTED_RAW(obj);
+}
+
+static inline void
+RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
+{
+    MARK_IN_BITMAP(&page->uncollectible_bits[0], obj);
+    objspace->rgengc.old_objects++;
+
+#if RGENGC_PROFILE >= 2
+    objspace->profile.total_promoted_count++;
+    objspace->profile.promoted_types[BUILTIN_TYPE(obj)]++;
+#endif
+}
+
+static inline void
+RVALUE_OLD_UNCOLLECTIBLE_SET(rb_objspace_t *objspace, VALUE obj)
+{
+    RB_DEBUG_COUNTER_INC(obj_promote);
+    RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(objspace, GET_HEAP_PAGE(obj), obj);
+}
+
+/* set age to age+1 */
+static inline void
+RVALUE_AGE_INC(rb_objspace_t *objspace, VALUE obj)
+{
+    int age = RVALUE_AGE_GET((VALUE)obj);
+
+    if (RGENGC_CHECK_MODE && age == RVALUE_OLD_AGE) {
+        rb_bug("RVALUE_AGE_INC: can not increment age of OLD object %s.", rb_obj_info(obj));
+    }
+
+    age++;
+    RVALUE_AGE_SET(obj, age);
+
+    if (age == RVALUE_OLD_AGE) {
+        RVALUE_OLD_UNCOLLECTIBLE_SET(objspace, obj);
+    }
+
+    check_rvalue_consistency(objspace, obj);
+}
+
+static inline void
+RVALUE_AGE_SET_CANDIDATE(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    GC_ASSERT(!RVALUE_OLD_P(objspace, obj));
+    RVALUE_AGE_SET(obj, RVALUE_OLD_AGE - 1);
+    check_rvalue_consistency(objspace, obj);
+}
+
+static inline void
+RVALUE_AGE_RESET(VALUE obj)
+{
+    RVALUE_AGE_SET(obj, 0);
+}
+
+static inline void
+RVALUE_DEMOTE(rb_objspace_t *objspace, VALUE obj)
+{
+    check_rvalue_consistency(objspace, obj);
+    GC_ASSERT(RVALUE_OLD_P(objspace, obj));
+
+    if (!is_incremental_marking(objspace) && RVALUE_REMEMBERED(objspace, obj)) {
+        CLEAR_IN_BITMAP(GET_HEAP_PAGE(obj)->remembered_bits, obj);
+    }
+
+    CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(obj), obj);
+    RVALUE_AGE_RESET(obj);
+
+    if (RVALUE_MARKED(objspace, obj)) {
+        objspace->rgengc.old_objects--;
+    }
+
+    check_rvalue_consistency(objspace, obj);
+}
+
+static inline int
+RVALUE_BLACK_P(rb_objspace_t *objspace, VALUE obj)
+{
+    return RVALUE_MARKED(objspace, obj) && !RVALUE_MARKING(objspace, obj);
+}
+
+static inline int
+RVALUE_WHITE_P(rb_objspace_t *objspace, VALUE obj)
+{
+    return !RVALUE_MARKED(objspace, obj);
+}
+
+bool
+rb_gc_impl_gc_enabled_p(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    return !dont_gc_val();
+}
+
+void
+rb_gc_impl_gc_enable(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    dont_gc_off();
+}
+
+void
+rb_gc_impl_gc_disable(void *objspace_ptr, bool finish_current_gc)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (finish_current_gc) {
+        gc_rest(objspace);
+    }
+
+    dont_gc_on();
+}
+
+/*
+  --------------------------- ObjectSpace -----------------------------
+*/
+
+static inline void *
+calloc1(size_t n)
+{
+    return calloc(1, n);
+}
+
+void
+rb_gc_impl_set_event_hook(void *objspace_ptr, const rb_event_flag_t event)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    objspace->hook_events = event & RUBY_INTERNAL_EVENT_OBJSPACE_MASK;
+}
+
+unsigned long long
+rb_gc_impl_get_total_time(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    unsigned long long marking_time = objspace->profile.marking_time_ns;
+    unsigned long long sweeping_time = objspace->profile.sweeping_time_ns;
+
+    return marking_time + sweeping_time;
+}
+
+void
+rb_gc_impl_set_measure_total_time(void *objspace_ptr, VALUE flag)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    objspace->flags.measure_gc = RTEST(flag) ? TRUE : FALSE;
+}
+
+bool
+rb_gc_impl_get_measure_total_time(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    return objspace->flags.measure_gc;
+}
+
+/* garbage objects will be collected soon. */
+bool
+rb_gc_impl_garbage_object_p(void *objspace_ptr, VALUE ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    bool dead = false;
+
+    asan_unpoisoning_object(ptr) {
+        switch (BUILTIN_TYPE(ptr)) {
+          case T_NONE:
+          case T_MOVED:
+          case T_ZOMBIE:
+            dead = true;
+            break;
+          default:
+            break;
+        }
+    }
+
+    if (dead) return true;
+    return is_lazy_sweeping(objspace) && GET_HEAP_PAGE(ptr)->flags.before_sweep &&
+        !RVALUE_MARKED(objspace, ptr);
+}
+
+struct rb_gc_vm_context *
+rb_gc_impl_get_vm_context(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    return &objspace->vm_context;
+}
+
+static void free_stack_chunks(mark_stack_t *);
+static void mark_stack_free_cache(mark_stack_t *);
+static void heap_page_free(rb_objspace_t *objspace, struct heap_page *page);
+
+static inline void
+heap_page_add_freeobj(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
+{
+    rb_asan_unpoison_object(obj, false);
+
+    asan_unlock_freelist(page);
+
+    struct free_slot *slot = (struct free_slot *)obj;
+    slot->flags = 0;
+    slot->next = page->freelist;
+    page->freelist = slot;
+    asan_lock_freelist(page);
+
+    // Should have already been reset
+    GC_ASSERT(RVALUE_AGE_GET(obj) == 0);
+
+    if (RGENGC_CHECK_MODE &&
+        /* obj should belong to page */
+        !(page->start <= (uintptr_t)obj &&
+          (uintptr_t)obj   <  ((uintptr_t)page->start + (page->total_slots * page->slot_size)) &&
+          obj % sizeof(VALUE) == 0)) {
+        rb_bug("heap_page_add_freeobj: %p is not rvalue.", (void *)obj);
+    }
+
+    rb_asan_poison_object(obj);
+    gc_report(3, objspace, "heap_page_add_freeobj: add %p to freelist\n", (void *)obj);
+}
+
+static void
+heap_allocatable_bytes_expand(rb_objspace_t *objspace,
+        rb_heap_t *heap, size_t free_slots, size_t total_slots, size_t slot_size)
+{
+    double goal_ratio = gc_params.heap_free_slots_goal_ratio;
+    size_t target_total_slots;
+
+    if (goal_ratio == 0.0) {
+        target_total_slots = (size_t)(total_slots * gc_params.growth_factor);
+    }
+    else if (total_slots == 0) {
+        target_total_slots = gc_params.heap_init_bytes / slot_size;
+    }
+    else {
+        /* Find `f' where free_slots = f * total_slots * goal_ratio
+         * => f = (total_slots - free_slots) / ((1 - goal_ratio) * total_slots)
+         */
+        double f = (double)(total_slots - free_slots) / ((1 - goal_ratio) * total_slots);
+
+        if (f > gc_params.growth_factor) f = gc_params.growth_factor;
+        if (f < 1.0) f = 1.1;
+
+        target_total_slots = (size_t)(f * total_slots);
+
+        if (0) {
+            fprintf(stderr,
+                    "free_slots(%8"PRIuSIZE")/total_slots(%8"PRIuSIZE")=%1.2f,"
+                    " G(%1.2f), f(%1.2f),"
+                    " total_slots(%8"PRIuSIZE") => target_total_slots(%8"PRIuSIZE")\n",
+                    free_slots, total_slots, free_slots/(double)total_slots,
+                    goal_ratio, f, total_slots, target_total_slots);
+        }
+    }
+
+    if (gc_params.growth_max_bytes > 0) {
+        size_t max_total_slots = total_slots + gc_params.growth_max_bytes / slot_size;
+        if (target_total_slots > max_total_slots) target_total_slots = max_total_slots;
+    }
+
+    size_t extend_slot_count = target_total_slots - total_slots;
+    /* Extend by at least 1 page. */
+    if (extend_slot_count == 0) extend_slot_count = 1;
+
+    objspace->heap_pages.allocatable_bytes += extend_slot_count * slot_size;
+}
+
+static inline void
+heap_add_freepage(rb_heap_t *heap, struct heap_page *page)
+{
+    asan_unlock_freelist(page);
+    GC_ASSERT(page->free_slots != 0);
+    GC_ASSERT(page->freelist != NULL);
+
+    page->free_next = heap->free_pages;
+    heap->free_pages = page;
+
+    RUBY_DEBUG_LOG("page:%p freelist:%p", (void *)page, (void *)page->freelist);
+
+    asan_lock_freelist(page);
+}
+
+static inline void
+heap_add_poolpage(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
+{
+    asan_unlock_freelist(page);
+    GC_ASSERT(page->free_slots != 0);
+    GC_ASSERT(page->freelist != NULL);
+
+    page->free_next = heap->pooled_pages;
+    heap->pooled_pages = page;
+    objspace->rincgc.pooled_slots += page->free_slots;
+
+    asan_lock_freelist(page);
+}
+
+static void
+heap_unlink_page(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
+{
+    ccan_list_del(&page->page_node);
+    heap->total_pages--;
+    heap->total_slots -= page->total_slots;
+}
+
+static void
+gc_aligned_free(void *ptr, size_t size)
+{
+#if defined __MINGW32__
+    __mingw_aligned_free(ptr);
+#elif defined _WIN32
+    _aligned_free(ptr);
+#elif defined(HAVE_POSIX_MEMALIGN) || defined(HAVE_MEMALIGN)
+    free(ptr);
+#else
+    free(((void**)ptr)[-1]);
+#endif
+}
+
+static void
+heap_page_body_free(struct heap_page_body *page_body)
+{
+    GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
+
+    if (HEAP_PAGE_ALLOC_USE_MMAP) {
+#ifdef HAVE_MMAP
+        GC_ASSERT(HEAP_PAGE_SIZE % sysconf(_SC_PAGE_SIZE) == 0);
+        if (munmap(page_body, HEAP_PAGE_SIZE)) {
+            rb_bug("heap_page_body_free: munmap failed");
+        }
+#endif
+    }
+    else {
+        gc_aligned_free(page_body, HEAP_PAGE_SIZE);
+    }
+}
+
+static void
+heap_page_free(rb_objspace_t *objspace, struct heap_page *page)
+{
+    objspace->heap_pages.freed_pages++;
+    heap_page_body_free(page->body);
+    free(page);
+}
+
+static void
+heap_pages_free_unused_pages(rb_objspace_t *objspace)
+{
+    if (objspace->empty_pages != NULL && heap_pages_freeable_pages > 0) {
+        GC_ASSERT(objspace->empty_pages_count > 0);
+        objspace->empty_pages = NULL;
+        objspace->empty_pages_count = 0;
+
+        size_t i, j;
+        for (i = j = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+            struct heap_page *page = rb_darray_get(objspace->heap_pages.sorted, i);
+
+            if (heap_page_in_global_empty_pages_pool(objspace, page) && heap_pages_freeable_pages > 0) {
+                heap_page_free(objspace, page);
+                heap_pages_freeable_pages--;
+            }
+            else {
+                if (heap_page_in_global_empty_pages_pool(objspace, page)) {
+                    page->free_next = objspace->empty_pages;
+                    objspace->empty_pages = page;
+                    objspace->empty_pages_count++;
+                }
+
+                if (i != j) {
+                    rb_darray_set(objspace->heap_pages.sorted, j, page);
+                }
+                j++;
+            }
+        }
+
+        rb_darray_pop(objspace->heap_pages.sorted, i - j);
+        GC_ASSERT(rb_darray_size(objspace->heap_pages.sorted) == j);
+
+        struct heap_page *hipage = rb_darray_get(objspace->heap_pages.sorted, rb_darray_size(objspace->heap_pages.sorted) - 1);
+        uintptr_t himem = (uintptr_t)hipage->body + HEAP_PAGE_SIZE;
+        GC_ASSERT(himem <= heap_pages_himem);
+        heap_pages_himem = himem;
+
+        struct heap_page *lopage = rb_darray_get(objspace->heap_pages.sorted, 0);
+        uintptr_t lomem = (uintptr_t)lopage->body + sizeof(struct heap_page_header);
+        GC_ASSERT(lomem >= heap_pages_lomem);
+        heap_pages_lomem = lomem;
+    }
+}
+
+static void *
+gc_aligned_malloc(size_t alignment, size_t size)
+{
+    /* alignment must be a power of 2 */
+    GC_ASSERT(((alignment - 1) & alignment) == 0);
+    GC_ASSERT(alignment % sizeof(void*) == 0);
+
+    void *res;
+
+#if defined __MINGW32__
+    res = __mingw_aligned_malloc(size, alignment);
+#elif defined _WIN32
+    void *_aligned_malloc(size_t, size_t);
+    res = _aligned_malloc(size, alignment);
+#elif defined(HAVE_POSIX_MEMALIGN)
+    if (posix_memalign(&res, alignment, size) != 0) {
+        return NULL;
+    }
+#elif defined(HAVE_MEMALIGN)
+    res = memalign(alignment, size);
+#else
+    char* aligned;
+    res = malloc(alignment + size + sizeof(void*));
+    aligned = (char*)res + alignment + sizeof(void*);
+    aligned -= ((VALUE)aligned & (alignment - 1));
+    ((void**)aligned)[-1] = res;
+    res = (void*)aligned;
+#endif
+
+    GC_ASSERT((uintptr_t)res % alignment == 0);
+
+    return res;
+}
+
+static struct heap_page_body *
+heap_page_body_allocate(void)
+{
+    struct heap_page_body *page_body;
+
+    if (HEAP_PAGE_ALLOC_USE_MMAP) {
+#ifdef HAVE_MMAP
+        GC_ASSERT(HEAP_PAGE_ALIGN % sysconf(_SC_PAGE_SIZE) == 0);
+
+        size_t mmap_size = HEAP_PAGE_ALIGN + HEAP_PAGE_SIZE;
+        char *ptr = mmap(NULL, mmap_size,
+                         PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
+        if (ptr == MAP_FAILED) {
+            return NULL;
+        }
+
+        // If we are building `default.c` as part of the ruby executable, we
+        // may just call `ruby_annotate_mmap`.  But if we are building
+        // `default.c` as a shared library, we will not have access to private
+        // symbols, and we have to either call prctl directly or make our own
+        // wrapper.
+#if defined(HAVE_SYS_PRCTL_H) && defined(PR_SET_VMA) && defined(PR_SET_VMA_ANON_NAME)
+        prctl(PR_SET_VMA, PR_SET_VMA_ANON_NAME, ptr, mmap_size, "Ruby:GC:default:heap_page_body_allocate");
+        errno = 0;
+#endif
+
+        char *aligned = ptr + HEAP_PAGE_ALIGN;
+        aligned -= ((VALUE)aligned & (HEAP_PAGE_ALIGN - 1));
+        GC_ASSERT(aligned > ptr);
+        GC_ASSERT(aligned <= ptr + HEAP_PAGE_ALIGN);
+
+        size_t start_out_of_range_size = aligned - ptr;
+        GC_ASSERT(start_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
+        if (start_out_of_range_size > 0) {
+            if (munmap(ptr, start_out_of_range_size)) {
+                rb_bug("heap_page_body_allocate: munmap failed for start");
+            }
+        }
+
+        size_t end_out_of_range_size = HEAP_PAGE_ALIGN - start_out_of_range_size;
+        GC_ASSERT(end_out_of_range_size % sysconf(_SC_PAGE_SIZE) == 0);
+        if (end_out_of_range_size > 0) {
+            if (munmap(aligned + HEAP_PAGE_SIZE, end_out_of_range_size)) {
+                rb_bug("heap_page_body_allocate: munmap failed for end");
+            }
+        }
+
+        page_body = (struct heap_page_body *)aligned;
+#endif
+    }
+    else {
+        page_body = gc_aligned_malloc(HEAP_PAGE_ALIGN, HEAP_PAGE_SIZE);
+    }
+
+    GC_ASSERT((uintptr_t)page_body % HEAP_PAGE_ALIGN == 0);
+
+    return page_body;
+}
+
+static struct heap_page *
+heap_page_resurrect(rb_objspace_t *objspace)
+{
+    struct heap_page *page = NULL;
+    if (objspace->empty_pages == NULL) {
+        GC_ASSERT(objspace->empty_pages_count == 0);
+    }
+    else {
+        GC_ASSERT(objspace->empty_pages_count > 0);
+        objspace->empty_pages_count--;
+        page = objspace->empty_pages;
+        objspace->empty_pages = page->free_next;
+    }
+
+    return page;
+}
+
+static struct heap_page *
+heap_page_allocate(rb_objspace_t *objspace)
+{
+    struct heap_page_body *page_body = heap_page_body_allocate();
+    if (page_body == 0) {
+        rb_memerror();
+    }
+
+    struct heap_page *page = calloc1(sizeof(struct heap_page));
+    if (page == 0) {
+        heap_page_body_free(page_body);
+        rb_memerror();
+    }
+
+    uintptr_t start = (uintptr_t)page_body + sizeof(struct heap_page_header);
+    uintptr_t end = (uintptr_t)page_body + HEAP_PAGE_SIZE;
+
+    size_t lo = 0;
+    size_t hi = rb_darray_size(objspace->heap_pages.sorted);
+    while (lo < hi) {
+        struct heap_page *mid_page;
+
+        size_t mid = (lo + hi) / 2;
+        mid_page = rb_darray_get(objspace->heap_pages.sorted, mid);
+        if ((uintptr_t)mid_page->start < start) {
+            lo = mid + 1;
+        }
+        else if ((uintptr_t)mid_page->start > start) {
+            hi = mid;
+        }
+        else {
+            rb_bug("same heap page is allocated: %p at %"PRIuVALUE, (void *)page_body, (VALUE)mid);
+        }
+    }
+
+    rb_darray_insert_without_gc(&objspace->heap_pages.sorted, hi, page);
+
+    if (heap_pages_lomem == 0 || heap_pages_lomem > start) heap_pages_lomem = start;
+    if (heap_pages_himem < end) heap_pages_himem = end;
+
+    page->body = page_body;
+    page_body->header.page = page;
+
+    objspace->heap_pages.allocated_pages++;
+
+    return page;
+}
+
+static void
+heap_add_page(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
+{
+    /* Adding to eden heap during incremental sweeping is forbidden */
+    GC_ASSERT(!heap->sweeping_page);
+    GC_ASSERT(heap_page_in_global_empty_pages_pool(objspace, page));
+
+    /* Align start to slot_size boundary */
+    uintptr_t start = (uintptr_t)page->body + sizeof(struct heap_page_header);
+    uintptr_t rem = start % heap->slot_size;
+    if (rem) start += heap->slot_size - rem;
+
+    int slot_count = (int)((HEAP_PAGE_SIZE - (start - (uintptr_t)page->body))/heap->slot_size);
+
+    page->start = start;
+    page->total_slots = slot_count;
+    page->slot_size = heap->slot_size;
+    page->slot_size_reciprocal = heap_slot_reciprocal_table[heap - heaps];
+    page->heap = heap;
+
+    memset(&page->wb_unprotected_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
+    memset(&page->age_bits[0], 0, sizeof(page->age_bits));
+
+    asan_unlock_freelist(page);
+    page->freelist = NULL;
+    asan_unpoison_memory_region(page->body, HEAP_PAGE_SIZE, false);
+    for (VALUE p = (VALUE)start; p < start + (slot_count * heap->slot_size); p += heap->slot_size) {
+        heap_page_add_freeobj(objspace, page, p);
+    }
+    asan_lock_freelist(page);
+
+    page->free_slots = slot_count;
+
+    heap->total_allocated_pages++;
+
+    ccan_list_add_tail(&heap->pages, &page->page_node);
+    heap->total_pages++;
+    heap->total_slots += page->total_slots;
+}
+
+static int
+heap_page_allocate_and_initialize(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    gc_report(1, objspace, "heap_page_allocate_and_initialize: rb_darray_size(objspace->heap_pages.sorted): %"PRIdSIZE", "
+                  "allocatable_bytes: %"PRIdSIZE", heap->total_pages: %"PRIdSIZE"\n",
+                  rb_darray_size(objspace->heap_pages.sorted), objspace->heap_pages.allocatable_bytes, heap->total_pages);
+
+    bool allocated = false;
+    struct heap_page *page = heap_page_resurrect(objspace);
+
+    if (page == NULL && objspace->heap_pages.allocatable_bytes > 0) {
+        page = heap_page_allocate(objspace);
+        allocated = true;
+
+        GC_ASSERT(page != NULL);
+    }
+
+    if (page != NULL) {
+        heap_add_page(objspace, heap, page);
+        heap_add_freepage(heap, page);
+
+        if (allocated) {
+            size_t page_bytes = (size_t)page->total_slots * page->slot_size;
+            if (objspace->heap_pages.allocatable_bytes > page_bytes) {
+                objspace->heap_pages.allocatable_bytes -= page_bytes;
+            }
+            else {
+                objspace->heap_pages.allocatable_bytes = 0;
+            }
+        }
+    }
+
+    return page != NULL;
+}
+
+static void
+heap_page_allocate_and_initialize_force(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    size_t prev_allocatable_bytes = objspace->heap_pages.allocatable_bytes;
+    objspace->heap_pages.allocatable_bytes = HEAP_PAGE_SIZE;
+    heap_page_allocate_and_initialize(objspace, heap);
+    GC_ASSERT(heap->free_pages != NULL);
+    objspace->heap_pages.allocatable_bytes = prev_allocatable_bytes;
+}
+
+static void
+gc_continue(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    unsigned int lock_lev;
+    bool needs_gc = is_incremental_marking(objspace) || needs_continue_sweeping(objspace, heap);
+    if (!needs_gc) return;
+
+    gc_enter(objspace, gc_enter_event_continue, &lock_lev); // takes vm barrier, try to avoid
+
+    /* Continue marking if in incremental marking. */
+    if (is_incremental_marking(objspace)) {
+        if (gc_marks_continue(objspace, heap)) {
+            gc_sweep(objspace);
+        }
+    }
+
+    if (needs_continue_sweeping(objspace, heap)) {
+        gc_sweep_continue(objspace, heap);
+    }
+
+    gc_exit(objspace, gc_enter_event_continue, &lock_lev);
+}
+
+static void
+heap_prepare(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    GC_ASSERT(heap->free_pages == NULL);
+
+    if (heap->total_slots < gc_params.heap_init_bytes / heap->slot_size &&
+            heap->sweeping_page == NULL) {
+        heap_page_allocate_and_initialize_force(objspace, heap);
+        GC_ASSERT(heap->free_pages != NULL);
+        return;
+    }
+
+    /* Continue incremental marking or lazy sweeping, if in any of those steps. */
+    gc_continue(objspace, heap);
+
+    if (heap->free_pages == NULL) {
+        heap_page_allocate_and_initialize(objspace, heap);
+    }
+
+    /* If we still don't have a free page and not allowed to create a new page,
+     * we should start a new GC cycle. */
+    if (heap->free_pages == NULL) {
+        GC_ASSERT(objspace->empty_pages_count == 0);
+        GC_ASSERT(objspace->heap_pages.allocatable_bytes == 0);
+
+        if (gc_start(objspace, GPR_FLAG_NEWOBJ) == FALSE) {
+            rb_memerror();
+        }
+        else {
+            if (objspace->heap_pages.allocatable_bytes == 0 && !gc_config_full_mark_val) {
+                heap_allocatable_bytes_expand(objspace, heap,
+                        heap->freed_slots + heap->empty_slots,
+                        heap->total_slots, heap->slot_size);
+                GC_ASSERT(objspace->heap_pages.allocatable_bytes > 0);
+            }
+            /* Do steps of incremental marking or lazy sweeping if the GC run permits. */
+            gc_continue(objspace, heap);
+
+            /* If we're not incremental marking (e.g. a minor GC) or finished
+             * sweeping and still don't have a free page, then
+             * gc_sweep_finish_heap should allow us to create a new page. */
+            if (heap->free_pages == NULL && !heap_page_allocate_and_initialize(objspace, heap)) {
+                if (gc_needs_major_flags == GPR_FLAG_NONE) {
+                    rb_bug("cannot create a new page after GC");
+                }
+                else { // Major GC is required, which will allow us to create new page
+                    if (gc_start(objspace, GPR_FLAG_NEWOBJ) == FALSE) {
+                        rb_memerror();
+                    }
+                    else {
+                        /* Do steps of incremental marking or lazy sweeping. */
+                        gc_continue(objspace, heap);
+
+                        if (heap->free_pages == NULL &&
+                                !heap_page_allocate_and_initialize(objspace, heap)) {
+                            rb_bug("cannot create a new page after major GC");
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+    GC_ASSERT(heap->free_pages != NULL);
+}
+
+#if GC_DEBUG
+static inline const char*
+rb_gc_impl_source_location_cstr(int *ptr)
+{
+    /* We could directly refer `rb_source_location_cstr()` before, but not any
+     * longer.  We have to heavy lift using our debugging API. */
+    if (! ptr) {
+        return NULL;
+    }
+    else if (! (*ptr = rb_sourceline())) {
+        return NULL;
+    }
+    else {
+        return rb_sourcefile();
+    }
+}
+#endif
+
+static inline VALUE
+newobj_init(VALUE klass, VALUE flags, int wb_protected, rb_objspace_t *objspace, VALUE obj)
+{
+    GC_ASSERT(BUILTIN_TYPE(obj) == T_NONE);
+    GC_ASSERT((flags & FL_WB_PROTECTED) == 0);
+    RBASIC(obj)->flags = flags;
+    *((VALUE *)&RBASIC(obj)->klass) = klass;
+#if RBASIC_SHAPE_ID_FIELD
+    RBASIC(obj)->shape_id = 0;
+#endif
+
+#if RGENGC_CHECK_MODE
+    int lev = RB_GC_VM_LOCK_NO_BARRIER();
+    {
+        check_rvalue_consistency(objspace, obj);
+
+        GC_ASSERT(RVALUE_MARKED(objspace, obj) == FALSE);
+        GC_ASSERT(RVALUE_MARKING(objspace, obj) == FALSE);
+        GC_ASSERT(RVALUE_OLD_P(objspace, obj) == FALSE);
+        GC_ASSERT(RVALUE_WB_UNPROTECTED(objspace, obj) == FALSE);
+
+        if (RVALUE_REMEMBERED(objspace, obj)) rb_bug("newobj: %s is remembered.", rb_obj_info(obj));
+    }
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+#endif
+
+    if (RB_UNLIKELY(wb_protected == FALSE)) {
+        MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
+    }
+
+#if RGENGC_PROFILE
+    if (wb_protected) {
+        objspace->profile.total_generated_normal_object_count++;
+#if RGENGC_PROFILE >= 2
+        objspace->profile.generated_normal_object_count_types[BUILTIN_TYPE(obj)]++;
+#endif
+    }
+    else {
+        objspace->profile.total_generated_shady_object_count++;
+#if RGENGC_PROFILE >= 2
+        objspace->profile.generated_shady_object_count_types[BUILTIN_TYPE(obj)]++;
+#endif
+    }
+#endif
+
+#if GC_DEBUG
+    GET_RVALUE_OVERHEAD(obj)->file = rb_gc_impl_source_location_cstr(&GET_RVALUE_OVERHEAD(obj)->line);
+    GC_ASSERT(!SPECIAL_CONST_P(obj)); /* check alignment */
+#endif
+
+    gc_report(5, objspace, "newobj: %s\n", rb_obj_info(obj));
+
+    // RUBY_DEBUG_LOG("obj:%p (%s)", (void *)obj, rb_obj_info(obj));
+    return obj;
+}
+
+size_t
+rb_gc_impl_obj_slot_size(VALUE obj)
+{
+    return GET_HEAP_PAGE(obj)->slot_size - RVALUE_OVERHEAD;
+}
+
+static inline size_t
+heap_slot_size(unsigned char pool_id)
+{
+    GC_ASSERT(pool_id < HEAP_COUNT);
+
+    return pool_slot_sizes[pool_id] - RVALUE_OVERHEAD;
+}
+
+bool
+rb_gc_impl_size_allocatable_p(size_t size)
+{
+    return size + RVALUE_OVERHEAD <= pool_slot_sizes[HEAP_COUNT - 1];
+}
+
+static const size_t ALLOCATED_COUNT_STEP = 1024;
+static void
+ractor_cache_flush_count(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache)
+{
+    for (int heap_idx = 0; heap_idx < HEAP_COUNT; heap_idx++) {
+        rb_ractor_newobj_heap_cache_t *heap_cache = &cache->heap_caches[heap_idx];
+
+        rb_heap_t *heap = &heaps[heap_idx];
+        RUBY_ATOMIC_SIZE_ADD(heap->total_allocated_objects, heap_cache->allocated_objects_count);
+        heap_cache->allocated_objects_count = 0;
+    }
+}
+
+static inline VALUE
+ractor_cache_allocate_slot(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache,
+                           size_t heap_idx)
+{
+    rb_ractor_newobj_heap_cache_t *heap_cache = &cache->heap_caches[heap_idx];
+    struct free_slot *p = heap_cache->freelist;
+
+    if (RB_UNLIKELY(is_incremental_marking(objspace))) {
+        // Not allowed to allocate without running an incremental marking step
+        if (cache->incremental_mark_step_allocated_slots >= INCREMENTAL_MARK_STEP_ALLOCATIONS) {
+            return Qfalse;
+        }
+
+        if (p) {
+            cache->incremental_mark_step_allocated_slots++;
+        }
+    }
+
+    if (RB_LIKELY(p)) {
+        VALUE obj = (VALUE)p;
+        rb_asan_unpoison_object(obj, true);
+        heap_cache->freelist = p->next;
+
+        heap_cache->allocated_objects_count++;
+        rb_heap_t *heap = &heaps[heap_idx];
+        if (heap_cache->allocated_objects_count >= ALLOCATED_COUNT_STEP) {
+            RUBY_ATOMIC_SIZE_ADD(heap->total_allocated_objects, heap_cache->allocated_objects_count);
+            heap_cache->allocated_objects_count = 0;
+        }
+
+#if RGENGC_CHECK_MODE
+        GC_ASSERT(rb_gc_impl_obj_slot_size(obj) == heap_slot_size(heap_idx));
+        // zero clear
+        MEMZERO((char *)obj, char, heap_slot_size(heap_idx));
+#endif
+        return obj;
+    }
+    else {
+        return Qfalse;
+    }
+}
+
+static struct heap_page *
+heap_next_free_page(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    struct heap_page *page;
+
+    if (heap->free_pages == NULL) {
+        heap_prepare(objspace, heap);
+    }
+
+    page = heap->free_pages;
+    heap->free_pages = page->free_next;
+
+    GC_ASSERT(page->free_slots != 0);
+
+    asan_unlock_freelist(page);
+
+    return page;
+}
+
+static inline void
+ractor_cache_set_page(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx,
+                      struct heap_page *page)
+{
+    gc_report(3, objspace, "ractor_set_cache: Using page %p\n", (void *)page->body);
+
+    rb_ractor_newobj_heap_cache_t *heap_cache = &cache->heap_caches[heap_idx];
+
+    GC_ASSERT(heap_cache->freelist == NULL);
+    GC_ASSERT(page->free_slots != 0);
+    GC_ASSERT(page->freelist != NULL);
+
+    heap_cache->using_page = page;
+    heap_cache->freelist = page->freelist;
+    page->free_slots = 0;
+    page->freelist = NULL;
+
+    rb_asan_unpoison_object((VALUE)heap_cache->freelist, false);
+    GC_ASSERT(RB_TYPE_P((VALUE)heap_cache->freelist, T_NONE));
+    rb_asan_poison_object((VALUE)heap_cache->freelist);
+}
+
+static void
+init_size_to_heap_idx(void)
+{
+    for (size_t i = 0; i < sizeof(size_to_heap_idx); i++) {
+        size_t effective = i * 8 + RVALUE_OVERHEAD;
+        uint8_t idx;
+        for (idx = 0; idx < HEAP_COUNT; idx++) {
+            if (effective <= pool_slot_sizes[idx]) break;
+        }
+        size_to_heap_idx[i] = idx;
+    }
+}
+
+static inline size_t
+heap_idx_for_size(size_t size)
+{
+    size_t compressed = (size + 7) >> 3;
+    if (compressed < sizeof(size_to_heap_idx)) {
+        size_t heap_idx = size_to_heap_idx[compressed];
+        if (RB_LIKELY(heap_idx < HEAP_COUNT)) return heap_idx;
+    }
+
+    rb_bug("heap_idx_for_size: allocation size too large "
+           "(size=%"PRIuSIZE")", size);
+}
+
+size_t
+rb_gc_impl_heap_id_for_size(void *objspace_ptr, size_t size)
+{
+    return heap_idx_for_size(size);
+}
+
+
+static size_t heap_sizes[HEAP_COUNT + 1] = { 0 };
+
+size_t *
+rb_gc_impl_heap_sizes(void *objspace_ptr)
+{
+    if (heap_sizes[0] == 0) {
+        for (unsigned char i = 0; i < HEAP_COUNT; i++) {
+            heap_sizes[i] = heap_slot_size(i);
+        }
+    }
+
+    return heap_sizes;
+}
+
+NOINLINE(static VALUE newobj_cache_miss(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx, bool vm_locked));
+
+static VALUE
+newobj_cache_miss(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx, bool vm_locked)
+{
+    rb_heap_t *heap = &heaps[heap_idx];
+    VALUE obj = Qfalse;
+
+    unsigned int lev = 0;
+    bool unlock_vm = false;
+
+    if (!vm_locked) {
+        lev = RB_GC_CR_LOCK();
+        unlock_vm = true;
+    }
+
+    {
+        if (is_incremental_marking(objspace)) {
+            gc_continue(objspace, heap);
+            cache->incremental_mark_step_allocated_slots = 0;
+
+            // Retry allocation after resetting incremental_mark_step_allocated_slots
+            obj = ractor_cache_allocate_slot(objspace, cache, heap_idx);
+        }
+
+        if (obj == Qfalse) {
+            // Get next free page (possibly running GC)
+            struct heap_page *page = heap_next_free_page(objspace, heap);
+            ractor_cache_set_page(objspace, cache, heap_idx, page);
+
+            // Retry allocation after moving to new page
+            obj = ractor_cache_allocate_slot(objspace, cache, heap_idx);
+        }
+    }
+
+    if (unlock_vm) {
+        RB_GC_CR_UNLOCK(lev);
+    }
+
+    if (RB_UNLIKELY(obj == Qfalse)) {
+        rb_memerror();
+    }
+    return obj;
+}
+
+static VALUE
+newobj_alloc(rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx, bool vm_locked)
+{
+    VALUE obj = ractor_cache_allocate_slot(objspace, cache, heap_idx);
+
+    if (RB_UNLIKELY(obj == Qfalse)) {
+        obj = newobj_cache_miss(objspace, cache, heap_idx, vm_locked);
+    }
+
+    return obj;
+}
+
+ALWAYS_INLINE(static VALUE newobj_slowpath(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, int wb_protected, size_t heap_idx));
+
+static inline VALUE
+newobj_slowpath(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, int wb_protected, size_t heap_idx)
+{
+    VALUE obj;
+    unsigned int lev;
+
+    lev = RB_GC_CR_LOCK();
+    {
+        if (RB_UNLIKELY(during_gc || ruby_gc_stressful)) {
+            if (during_gc) {
+                dont_gc_on();
+                during_gc = 0;
+                if (rb_memerror_reentered()) {
+                    rb_memerror();
+                }
+                rb_bug("object allocation during garbage collection phase");
+            }
+
+            if (ruby_gc_stressful) {
+                if (!garbage_collect(objspace, GPR_FLAG_NEWOBJ)) {
+                    rb_memerror();
+                }
+            }
+        }
+
+        obj = newobj_alloc(objspace, cache, heap_idx, true);
+        newobj_init(klass, flags, wb_protected, objspace, obj);
+    }
+    RB_GC_CR_UNLOCK(lev);
+
+    return obj;
+}
+
+NOINLINE(static VALUE newobj_slowpath_wb_protected(VALUE klass, VALUE flags,
+                                                   rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx));
+NOINLINE(static VALUE newobj_slowpath_wb_unprotected(VALUE klass, VALUE flags,
+                                                     rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx));
+
+static VALUE
+newobj_slowpath_wb_protected(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx)
+{
+    return newobj_slowpath(klass, flags, objspace, cache, TRUE, heap_idx);
+}
+
+static VALUE
+newobj_slowpath_wb_unprotected(VALUE klass, VALUE flags, rb_objspace_t *objspace, rb_ractor_newobj_cache_t *cache, size_t heap_idx)
+{
+    return newobj_slowpath(klass, flags, objspace, cache, FALSE, heap_idx);
+}
+
+VALUE
+rb_gc_impl_new_obj(void *objspace_ptr, void *cache_ptr, VALUE klass, VALUE flags, bool wb_protected, size_t alloc_size)
+{
+    VALUE obj;
+    rb_objspace_t *objspace = objspace_ptr;
+
+    RB_DEBUG_COUNTER_INC(obj_newobj);
+    (void)RB_DEBUG_COUNTER_INC_IF(obj_newobj_wb_unprotected, !wb_protected);
+
+    if (RB_UNLIKELY(stress_to_class)) {
+        if (rb_hash_lookup2(stress_to_class, klass, Qundef) != Qundef) {
+            rb_memerror();
+        }
+    }
+
+    size_t heap_idx = heap_idx_for_size(alloc_size);
+
+    rb_ractor_newobj_cache_t *cache = (rb_ractor_newobj_cache_t *)cache_ptr;
+
+    if (!RB_UNLIKELY(during_gc || ruby_gc_stressful) &&
+            wb_protected) {
+        obj = newobj_alloc(objspace, cache, heap_idx, false);
+        newobj_init(klass, flags, wb_protected, objspace, obj);
+    }
+    else {
+        RB_DEBUG_COUNTER_INC(obj_newobj_slowpath);
+
+        obj = wb_protected ?
+          newobj_slowpath_wb_protected(klass, flags, objspace, cache, heap_idx) :
+          newobj_slowpath_wb_unprotected(klass, flags, objspace, cache, heap_idx);
+    }
+
+    return obj;
+}
+
+static int
+ptr_in_page_body_p(const void *ptr, const void *memb)
+{
+    struct heap_page *page = *(struct heap_page **)memb;
+    uintptr_t p_body = (uintptr_t)page->body;
+
+    if ((uintptr_t)ptr >= p_body) {
+        return (uintptr_t)ptr < (p_body + HEAP_PAGE_SIZE) ? 0 : 1;
+    }
+    else {
+        return -1;
+    }
+}
+
+PUREFUNC(static inline struct heap_page *heap_page_for_ptr(rb_objspace_t *objspace, uintptr_t ptr);)
+static inline struct heap_page *
+heap_page_for_ptr(rb_objspace_t *objspace, uintptr_t ptr)
+{
+    struct heap_page **res;
+
+    if (ptr < (uintptr_t)heap_pages_lomem ||
+            ptr > (uintptr_t)heap_pages_himem) {
+        return NULL;
+    }
+
+    res = bsearch((void *)ptr, rb_darray_ref(objspace->heap_pages.sorted, 0),
+                  rb_darray_size(objspace->heap_pages.sorted), sizeof(struct heap_page *),
+                  ptr_in_page_body_p);
+
+    if (res) {
+        return *res;
+    }
+    else {
+        return NULL;
+    }
+}
+
+PUREFUNC(static inline bool is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr);)
+static inline bool
+is_pointer_to_heap(rb_objspace_t *objspace, const void *ptr)
+{
+    register uintptr_t p = (uintptr_t)ptr;
+    register struct heap_page *page;
+
+    RB_DEBUG_COUNTER_INC(gc_isptr_trial);
+
+    if (p < heap_pages_lomem || p > heap_pages_himem) return FALSE;
+    RB_DEBUG_COUNTER_INC(gc_isptr_range);
+
+    if (p % sizeof(VALUE) != 0) return FALSE;
+    RB_DEBUG_COUNTER_INC(gc_isptr_align);
+
+    page = heap_page_for_ptr(objspace, (uintptr_t)ptr);
+    if (page) {
+        RB_DEBUG_COUNTER_INC(gc_isptr_maybe);
+        if (heap_page_in_global_empty_pages_pool(objspace, page)) {
+            return FALSE;
+        }
+        else {
+            if (p < page->start) return FALSE;
+            if (p >= page->start + (page->total_slots * page->slot_size)) return FALSE;
+            if ((p - page->start) % page->slot_size != 0) return FALSE;
+
+            return TRUE;
+        }
+    }
+    return FALSE;
+}
+
+bool
+rb_gc_impl_pointer_to_heap_p(void *objspace_ptr, const void *ptr)
+{
+    return is_pointer_to_heap(objspace_ptr, ptr);
+}
+
+#define ZOMBIE_OBJ_KEPT_FLAGS (FL_FINALIZE)
+
+void
+rb_gc_impl_make_zombie(void *objspace_ptr, VALUE obj, void (*dfree)(void *), void *data)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    struct RZombie *zombie = RZOMBIE(obj);
+    zombie->flags = T_ZOMBIE | (zombie->flags & ZOMBIE_OBJ_KEPT_FLAGS);
+    zombie->dfree = dfree;
+    zombie->data = data;
+    VALUE prev, next = heap_pages_deferred_final;
+    do {
+        zombie->next = prev = next;
+        next = RUBY_ATOMIC_VALUE_CAS(heap_pages_deferred_final, prev, obj);
+    } while (next != prev);
+
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+    page->final_slots++;
+    page->heap->final_slots_count++;
+}
+
+typedef int each_obj_callback(void *, void *, size_t, void *);
+typedef int each_page_callback(struct heap_page *, void *);
+
+struct each_obj_data {
+    rb_objspace_t *objspace;
+    bool reenable_incremental;
+
+    each_obj_callback *each_obj_callback;
+    each_page_callback *each_page_callback;
+    void *data;
+
+    struct heap_page **pages[HEAP_COUNT];
+    size_t pages_counts[HEAP_COUNT];
+};
+
+static VALUE
+objspace_each_objects_ensure(VALUE arg)
+{
+    struct each_obj_data *data = (struct each_obj_data *)arg;
+    rb_objspace_t *objspace = data->objspace;
+
+    /* Reenable incremental GC */
+    if (data->reenable_incremental) {
+        objspace->flags.dont_incremental = FALSE;
+    }
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        struct heap_page **pages = data->pages[i];
+        free(pages);
+    }
+
+    return Qnil;
+}
+
+static VALUE
+objspace_each_objects_try(VALUE arg)
+{
+    struct each_obj_data *data = (struct each_obj_data *)arg;
+    rb_objspace_t *objspace = data->objspace;
+
+    /* Copy pages from all heaps to their respective buffers. */
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        size_t size = heap->total_pages * sizeof(struct heap_page *);
+
+        struct heap_page **pages = malloc(size);
+        if (!pages) rb_memerror();
+
+        /* Set up pages buffer by iterating over all pages in the current eden
+         * heap. This will be a snapshot of the state of the heap before we
+         * call the callback over each page that exists in this buffer. Thus it
+         * is safe for the callback to allocate objects without possibly entering
+         * an infinite loop. */
+        struct heap_page *page = 0;
+        size_t pages_count = 0;
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            pages[pages_count] = page;
+            pages_count++;
+        }
+        data->pages[i] = pages;
+        data->pages_counts[i] = pages_count;
+        GC_ASSERT(pages_count == heap->total_pages);
+    }
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        size_t pages_count = data->pages_counts[i];
+        struct heap_page **pages = data->pages[i];
+
+        struct heap_page *page = ccan_list_top(&heap->pages, struct heap_page, page_node);
+        for (size_t i = 0; i < pages_count; i++) {
+            /* If we have reached the end of the linked list then there are no
+             * more pages, so break. */
+            if (page == NULL) break;
+
+            /* If this page does not match the one in the buffer, then move to
+             * the next page in the buffer. */
+            if (pages[i] != page) continue;
+
+            uintptr_t pstart = (uintptr_t)page->start;
+            uintptr_t pend = pstart + (page->total_slots * heap->slot_size);
+
+            if (data->each_obj_callback &&
+                (*data->each_obj_callback)((void *)pstart, (void *)pend, heap->slot_size, data->data)) {
+                break;
+            }
+            if (data->each_page_callback &&
+                (*data->each_page_callback)(page, data->data)) {
+                break;
+            }
+
+            page = ccan_list_next(&heap->pages, page, page_node);
+        }
+    }
+
+    return Qnil;
+}
+
+static void
+objspace_each_exec(bool protected, struct each_obj_data *each_obj_data)
+{
+    /* Disable incremental GC */
+    rb_objspace_t *objspace = each_obj_data->objspace;
+    bool reenable_incremental = FALSE;
+    if (protected) {
+        reenable_incremental = !objspace->flags.dont_incremental;
+
+        gc_rest(objspace);
+        objspace->flags.dont_incremental = TRUE;
+    }
+
+    each_obj_data->reenable_incremental = reenable_incremental;
+    memset(&each_obj_data->pages, 0, sizeof(each_obj_data->pages));
+    memset(&each_obj_data->pages_counts, 0, sizeof(each_obj_data->pages_counts));
+    rb_ensure(objspace_each_objects_try, (VALUE)each_obj_data,
+              objspace_each_objects_ensure, (VALUE)each_obj_data);
+}
+
+static void
+objspace_each_objects(rb_objspace_t *objspace, each_obj_callback *callback, void *data, bool protected)
+{
+    struct each_obj_data each_obj_data = {
+        .objspace = objspace,
+        .each_obj_callback = callback,
+        .each_page_callback = NULL,
+        .data = data,
+    };
+    objspace_each_exec(protected, &each_obj_data);
+}
+
+void
+rb_gc_impl_each_objects(void *objspace_ptr, each_obj_callback *callback, void *data)
+{
+    objspace_each_objects(objspace_ptr, callback, data, TRUE);
+}
+
+#if GC_CAN_COMPILE_COMPACTION
+static void
+objspace_each_pages(rb_objspace_t *objspace, each_page_callback *callback, void *data, bool protected)
+{
+    struct each_obj_data each_obj_data = {
+        .objspace = objspace,
+        .each_obj_callback = NULL,
+        .each_page_callback = callback,
+        .data = data,
+    };
+    objspace_each_exec(protected, &each_obj_data);
+}
+#endif
+
+VALUE
+rb_gc_impl_define_finalizer(void *objspace_ptr, VALUE obj, VALUE block)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    VALUE table;
+    st_data_t data;
+
+    GC_ASSERT(!OBJ_FROZEN(obj));
+
+    RBASIC(obj)->flags |= FL_FINALIZE;
+
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    if (st_lookup(finalizer_table, obj, &data)) {
+        table = (VALUE)data;
+        VALUE dup_table = rb_ary_dup(table);
+
+        RB_GC_VM_UNLOCK(lev);
+        /* avoid duplicate block, table is usually small */
+        {
+            long len = RARRAY_LEN(table);
+            long i;
+
+            for (i = 0; i < len; i++) {
+                VALUE recv = RARRAY_AREF(dup_table, i);
+                if (rb_equal(recv, block)) { // can't be called with VM lock held
+                    return recv;
+                }
+            }
+        }
+        lev = RB_GC_VM_LOCK();
+        RB_GC_GUARD(dup_table);
+
+        rb_ary_push(table, block);
+    }
+    else {
+        table = rb_ary_new3(2, rb_obj_id(obj), block);
+        rb_obj_hide(table);
+        st_add_direct(finalizer_table, obj, table);
+    }
+
+    RB_GC_VM_UNLOCK(lev);
+
+    return block;
+}
+
+void
+rb_gc_impl_undefine_finalizer(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    GC_ASSERT(!OBJ_FROZEN(obj));
+
+    st_data_t data = obj;
+
+    int lev = RB_GC_VM_LOCK();
+    st_delete(finalizer_table, &data, 0);
+    RB_GC_VM_UNLOCK(lev);
+
+    FL_UNSET(obj, FL_FINALIZE);
+}
+
+void
+rb_gc_impl_copy_finalizer(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    VALUE table;
+    st_data_t data;
+
+    if (!FL_TEST(obj, FL_FINALIZE)) return;
+
+    int lev = RB_GC_VM_LOCK();
+    if (RB_LIKELY(st_lookup(finalizer_table, obj, &data))) {
+        table = rb_ary_dup((VALUE)data);
+        RARRAY_ASET(table, 0, rb_obj_id(dest));
+        st_insert(finalizer_table, dest, table);
+        FL_SET(dest, FL_FINALIZE);
+    }
+    else {
+        rb_bug("rb_gc_copy_finalizer: FL_FINALIZE set but not found in finalizer_table: %s", rb_obj_info(obj));
+    }
+    RB_GC_VM_UNLOCK(lev);
+}
+
+static VALUE
+get_final(long i, void *data)
+{
+    VALUE table = (VALUE)data;
+
+    return RARRAY_AREF(table, i + 1);
+}
+
+static unsigned int
+run_final(rb_objspace_t *objspace, VALUE zombie, unsigned int lev)
+{
+    if (RZOMBIE(zombie)->dfree) {
+        RZOMBIE(zombie)->dfree(RZOMBIE(zombie)->data);
+    }
+
+    st_data_t key = (st_data_t)zombie;
+    if (FL_TEST_RAW(zombie, FL_FINALIZE)) {
+        FL_UNSET(zombie, FL_FINALIZE);
+        st_data_t table;
+        if (st_delete(finalizer_table, &key, &table)) {
+            RB_GC_VM_UNLOCK(lev);
+            rb_gc_run_obj_finalizer(RARRAY_AREF(table, 0), RARRAY_LEN(table) - 1, get_final, (void *)table);
+            lev = RB_GC_VM_LOCK();
+        }
+        else {
+            rb_bug("FL_FINALIZE flag is set, but finalizers are not found");
+        }
+    }
+    else {
+        GC_ASSERT(!st_lookup(finalizer_table, key, NULL));
+    }
+    return lev;
+}
+
+static void
+finalize_list(rb_objspace_t *objspace, VALUE zombie)
+{
+    while (zombie) {
+        VALUE next_zombie;
+        struct heap_page *page;
+        rb_asan_unpoison_object(zombie, false);
+        next_zombie = RZOMBIE(zombie)->next;
+        page = GET_HEAP_PAGE(zombie);
+
+        unsigned int lev = RB_GC_VM_LOCK();
+
+        lev = run_final(objspace, zombie, lev);
+        {
+            GC_ASSERT(BUILTIN_TYPE(zombie) == T_ZOMBIE);
+            GC_ASSERT(page->heap->final_slots_count > 0);
+            GC_ASSERT(page->final_slots > 0);
+
+            page->heap->final_slots_count--;
+            page->final_slots--;
+            page->free_slots++;
+            RVALUE_AGE_SET_BITMAP(zombie, 0);
+            heap_page_add_freeobj(objspace, page, zombie);
+            page->heap->total_freed_objects++;
+        }
+        RB_GC_VM_UNLOCK(lev);
+
+        zombie = next_zombie;
+    }
+}
+
+static void
+finalize_deferred_heap_pages(rb_objspace_t *objspace)
+{
+    VALUE zombie;
+    while ((zombie = RUBY_ATOMIC_VALUE_EXCHANGE(heap_pages_deferred_final, 0)) != 0) {
+        finalize_list(objspace, zombie);
+    }
+}
+
+static void
+finalize_deferred(rb_objspace_t *objspace)
+{
+    rb_gc_set_pending_interrupt();
+    finalize_deferred_heap_pages(objspace);
+    rb_gc_unset_pending_interrupt();
+}
+
+static void
+gc_finalize_deferred(void *dmy)
+{
+    rb_objspace_t *objspace = dmy;
+    if (RUBY_ATOMIC_EXCHANGE(finalizing, 1)) return;
+
+    finalize_deferred(objspace);
+    RUBY_ATOMIC_SET(finalizing, 0);
+}
+
+static void
+gc_finalize_deferred_register(rb_objspace_t *objspace)
+{
+    /* will enqueue a call to gc_finalize_deferred */
+    rb_postponed_job_trigger(objspace->finalize_deferred_pjob);
+}
+
+static int pop_mark_stack(mark_stack_t *stack, VALUE *data);
+
+static void
+gc_abort(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (is_incremental_marking(objspace)) {
+        /* Remove all objects from the mark stack. */
+        VALUE obj;
+        while (pop_mark_stack(&objspace->mark_stack, &obj));
+
+        objspace->flags.during_incremental_marking = FALSE;
+    }
+
+    if (is_lazy_sweeping(objspace)) {
+        objspace->sweeping_heap_count = 0;
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+
+            heap->sweeping_page = NULL;
+            struct heap_page *page = NULL;
+
+            ccan_list_for_each(&heap->pages, page, page_node) {
+                page->flags.before_sweep = false;
+            }
+        }
+    }
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        rgengc_mark_and_rememberset_clear(objspace, heap);
+    }
+
+    gc_mode_set(objspace, gc_mode_none);
+}
+
+void
+rb_gc_impl_shutdown_free_objects(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    for (size_t i = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+        struct heap_page *page = rb_darray_get(objspace->heap_pages.sorted, i);
+        short stride = page->slot_size;
+
+        uintptr_t p = (uintptr_t)page->start;
+        uintptr_t pend = p + page->total_slots * stride;
+        for (; p < pend; p += stride) {
+            VALUE vp = (VALUE)p;
+            asan_unpoisoning_object(vp) {
+                if (RB_BUILTIN_TYPE(vp) != T_NONE) {
+                    rb_gc_obj_free_vm_weak_references(vp);
+                    if (rb_gc_obj_free(objspace, vp)) {
+                        RBASIC(vp)->flags = 0;
+                    }
+                }
+            }
+        }
+    }
+}
+
+static int
+rb_gc_impl_shutdown_call_finalizer_i(st_data_t key, st_data_t val, st_data_t _data)
+{
+    VALUE obj = (VALUE)key;
+    VALUE table = (VALUE)val;
+
+    GC_ASSERT(RB_FL_TEST(obj, FL_FINALIZE));
+    GC_ASSERT(RB_BUILTIN_TYPE(val) == T_ARRAY);
+
+    rb_gc_run_obj_finalizer(RARRAY_AREF(table, 0), RARRAY_LEN(table) - 1, get_final, (void *)table);
+
+    FL_UNSET(obj, FL_FINALIZE);
+
+    return ST_DELETE;
+}
+
+void
+rb_gc_impl_shutdown_call_finalizer(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+
+    /* prohibit incremental GC */
+    objspace->flags.dont_incremental = 1;
+
+    if (RUBY_ATOMIC_EXCHANGE(finalizing, 1)) {
+        /* Abort incremental marking and lazy sweeping to speed up shutdown. */
+        gc_abort(objspace);
+        dont_gc_on();
+        return;
+    }
+
+    while (finalizer_table->num_entries) {
+        st_foreach(finalizer_table, rb_gc_impl_shutdown_call_finalizer_i, 0);
+    }
+
+    /* run finalizers */
+    finalize_deferred(objspace);
+    GC_ASSERT(heap_pages_deferred_final == 0);
+
+    /* Abort incremental marking and lazy sweeping to speed up shutdown. */
+    gc_abort(objspace);
+
+    /* prohibit GC because force T_DATA finalizers can break an object graph consistency */
+    dont_gc_on();
+
+    /* running data/file finalizers are part of garbage collection */
+    unsigned int lock_lev;
+    gc_enter(objspace, gc_enter_event_finalizer, &lock_lev);
+
+    /* run data/file object's finalizers */
+    for (size_t i = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+        struct heap_page *page = rb_darray_get(objspace->heap_pages.sorted, i);
+        short stride = page->slot_size;
+
+        uintptr_t p = (uintptr_t)page->start;
+        uintptr_t pend = p + page->total_slots * stride;
+        for (; p < pend; p += stride) {
+            VALUE vp = (VALUE)p;
+            asan_unpoisoning_object(vp) {
+                if (rb_gc_shutdown_call_finalizer_p(vp)) {
+                    rb_gc_obj_free_vm_weak_references(vp);
+                    if (rb_gc_obj_free(objspace, vp)) {
+                        RBASIC(vp)->flags = 0;
+                    }
+                }
+            }
+        }
+    }
+
+    gc_exit(objspace, gc_enter_event_finalizer, &lock_lev);
+
+    finalize_deferred_heap_pages(objspace);
+
+    st_free_table(finalizer_table);
+    finalizer_table = 0;
+    RUBY_ATOMIC_SET(finalizing, 0);
+}
+
+void
+rb_gc_impl_each_object(void *objspace_ptr, void (*func)(VALUE obj, void *data), void *data)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    for (size_t i = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+        struct heap_page *page = rb_darray_get(objspace->heap_pages.sorted, i);
+        short stride = page->slot_size;
+
+        uintptr_t p = (uintptr_t)page->start;
+        uintptr_t pend = p + page->total_slots * stride;
+        for (; p < pend; p += stride) {
+            VALUE obj = (VALUE)p;
+
+            asan_unpoisoning_object(obj) {
+                func(obj, data);
+            }
+        }
+    }
+}
+
+/*
+  ------------------------ Garbage Collection ------------------------
+*/
+
+/* Sweeping */
+
+static size_t
+objspace_available_slots(rb_objspace_t *objspace)
+{
+    size_t total_slots = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        total_slots += heap->total_slots;
+    }
+    return total_slots;
+}
+
+static size_t
+objspace_live_slots(rb_objspace_t *objspace)
+{
+    return total_allocated_objects(objspace) - total_freed_objects(objspace) - total_final_slots_count(objspace);
+}
+
+static size_t
+objspace_free_slots(rb_objspace_t *objspace)
+{
+    return objspace_available_slots(objspace) - objspace_live_slots(objspace) - total_final_slots_count(objspace);
+}
+
+static void
+gc_setup_mark_bits(struct heap_page *page)
+{
+    /* copy oldgen bitmap to mark bitmap */
+    memcpy(&page->mark_bits[0], &page->uncollectible_bits[0], HEAP_PAGE_BITMAP_SIZE);
+}
+
+static int gc_is_moveable_obj(rb_objspace_t *objspace, VALUE obj);
+static VALUE gc_move(rb_objspace_t *objspace, VALUE scan, VALUE free, struct heap_page *src_page, struct heap_page *dest_page);
+
+#if defined(_WIN32)
+enum {HEAP_PAGE_LOCK = PAGE_NOACCESS, HEAP_PAGE_UNLOCK = PAGE_READWRITE};
+
+static BOOL
+protect_page_body(struct heap_page_body *body, DWORD protect)
+{
+    DWORD old_protect;
+    return VirtualProtect(body, HEAP_PAGE_SIZE, protect, &old_protect) != 0;
+}
+#elif defined(__wasi__)
+// wasi-libc's mprotect emulation does not support PROT_NONE
+enum {HEAP_PAGE_LOCK, HEAP_PAGE_UNLOCK};
+#define protect_page_body(body, protect) 1
+#else
+enum {HEAP_PAGE_LOCK = PROT_NONE, HEAP_PAGE_UNLOCK = PROT_READ | PROT_WRITE};
+#define protect_page_body(body, protect) !mprotect((body), HEAP_PAGE_SIZE, (protect))
+#endif
+
+static void
+lock_page_body(rb_objspace_t *objspace, struct heap_page_body *body)
+{
+    if (!protect_page_body(body, HEAP_PAGE_LOCK)) {
+        rb_bug("Couldn't protect page %p, errno: %s", (void *)body, strerror(errno));
+    }
+    else {
+        gc_report(5, objspace, "Protecting page in move %p\n", (void *)body);
+    }
+}
+
+static void
+unlock_page_body(rb_objspace_t *objspace, struct heap_page_body *body)
+{
+    if (!protect_page_body(body, HEAP_PAGE_UNLOCK)) {
+        rb_bug("Couldn't unprotect page %p, errno: %s", (void *)body, strerror(errno));
+    }
+    else {
+        gc_report(5, objspace, "Unprotecting page in move %p\n", (void *)body);
+    }
+}
+
+static bool
+try_move(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *free_page, VALUE src)
+{
+    GC_ASSERT(gc_is_moveable_obj(objspace, src));
+
+    struct heap_page *src_page = GET_HEAP_PAGE(src);
+    if (!free_page) {
+        return false;
+    }
+
+    /* We should return true if either src is successfully moved, or src is
+     * unmoveable. A false return will cause the sweeping cursor to be
+     * incremented to the next page, and src will attempt to move again */
+    GC_ASSERT(RVALUE_MARKED(objspace, src));
+
+    asan_unlock_freelist(free_page);
+    VALUE dest = (VALUE)free_page->freelist;
+    asan_lock_freelist(free_page);
+    if (dest) {
+        rb_asan_unpoison_object(dest, false);
+    }
+    else {
+        /* if we can't get something from the freelist then the page must be
+         * full */
+        return false;
+    }
+    asan_unlock_freelist(free_page);
+    free_page->freelist = ((struct free_slot *)dest)->next;
+    asan_lock_freelist(free_page);
+
+    GC_ASSERT(RB_BUILTIN_TYPE(dest) == T_NONE);
+
+    if (src_page->slot_size > free_page->slot_size) {
+        objspace->rcompactor.moved_down_count_table[BUILTIN_TYPE(src)]++;
+    }
+    else if (free_page->slot_size > src_page->slot_size) {
+        objspace->rcompactor.moved_up_count_table[BUILTIN_TYPE(src)]++;
+    }
+    objspace->rcompactor.moved_count_table[BUILTIN_TYPE(src)]++;
+    objspace->rcompactor.total_moved++;
+
+    gc_move(objspace, src, dest, src_page, free_page);
+    gc_pin(objspace, src);
+    free_page->free_slots--;
+
+    return true;
+}
+
+static void
+gc_unprotect_pages(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    struct heap_page *cursor = heap->compact_cursor;
+
+    while (cursor) {
+        unlock_page_body(objspace, cursor->body);
+        cursor = ccan_list_next(&heap->pages, cursor, page_node);
+    }
+}
+
+static void gc_update_references(rb_objspace_t *objspace);
+#if GC_CAN_COMPILE_COMPACTION
+static void invalidate_moved_page(rb_objspace_t *objspace, struct heap_page *page);
+#endif
+
+#if defined(__MINGW32__) || defined(_WIN32)
+# define GC_COMPACTION_SUPPORTED 1
+#else
+/* If not MinGW, Windows, or does not have mmap, we cannot use mprotect for
+ * the read barrier, so we must disable compaction. */
+# define GC_COMPACTION_SUPPORTED (GC_CAN_COMPILE_COMPACTION && HEAP_PAGE_ALLOC_USE_MMAP)
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+static void
+read_barrier_handler(uintptr_t address)
+{
+    rb_objspace_t *objspace = (rb_objspace_t *)rb_gc_get_objspace();
+
+    struct heap_page_body *page_body = GET_PAGE_BODY(address);
+
+    /* If the page_body is NULL, then mprotect cannot handle it and will crash
+     * with "Cannot allocate memory". */
+    if (page_body == NULL) {
+        rb_bug("read_barrier_handler: segmentation fault at %p", (void *)address);
+    }
+
+    int lev = RB_GC_VM_LOCK();
+    {
+        unlock_page_body(objspace, page_body);
+
+        objspace->profile.read_barrier_faults++;
+
+        invalidate_moved_page(objspace, GET_HEAP_PAGE(address));
+    }
+    RB_GC_VM_UNLOCK(lev);
+}
+#endif
+
+#if !GC_CAN_COMPILE_COMPACTION
+static void
+uninstall_handlers(void)
+{
+    /* no-op */
+}
+
+static void
+install_handlers(void)
+{
+    /* no-op */
+}
+#elif defined(_WIN32)
+static LPTOP_LEVEL_EXCEPTION_FILTER old_handler;
+typedef void (*signal_handler)(int);
+static signal_handler old_sigsegv_handler;
+
+static LONG WINAPI
+read_barrier_signal(EXCEPTION_POINTERS *info)
+{
+    /* EXCEPTION_ACCESS_VIOLATION is what's raised by access to protected pages */
+    if (info->ExceptionRecord->ExceptionCode == EXCEPTION_ACCESS_VIOLATION) {
+        /* > The second array element specifies the virtual address of the inaccessible data.
+         * https://docs.microsoft.com/en-us/windows/win32/api/winnt/ns-winnt-exception_record
+         *
+         * Use this address to invalidate the page */
+        read_barrier_handler((uintptr_t)info->ExceptionRecord->ExceptionInformation[1]);
+        return EXCEPTION_CONTINUE_EXECUTION;
+    }
+    else {
+        return EXCEPTION_CONTINUE_SEARCH;
+    }
+}
+
+static void
+uninstall_handlers(void)
+{
+    signal(SIGSEGV, old_sigsegv_handler);
+    SetUnhandledExceptionFilter(old_handler);
+}
+
+static void
+install_handlers(void)
+{
+    /* Remove SEGV handler so that the Unhandled Exception Filter handles it */
+    old_sigsegv_handler = signal(SIGSEGV, NULL);
+    /* Unhandled Exception Filter has access to the violation address similar
+     * to si_addr from sigaction */
+    old_handler = SetUnhandledExceptionFilter(read_barrier_signal);
+}
+#else
+static struct sigaction old_sigbus_handler;
+static struct sigaction old_sigsegv_handler;
+
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+static exception_mask_t old_exception_masks[32];
+static mach_port_t old_exception_ports[32];
+static exception_behavior_t old_exception_behaviors[32];
+static thread_state_flavor_t old_exception_flavors[32];
+static mach_msg_type_number_t old_exception_count;
+
+static void
+disable_mach_bad_access_exc(void)
+{
+    old_exception_count = sizeof(old_exception_masks) / sizeof(old_exception_masks[0]);
+    task_swap_exception_ports(
+        mach_task_self(), EXC_MASK_BAD_ACCESS,
+        MACH_PORT_NULL, EXCEPTION_DEFAULT, 0,
+        old_exception_masks, &old_exception_count,
+        old_exception_ports, old_exception_behaviors, old_exception_flavors
+    );
+}
+
+static void
+restore_mach_bad_access_exc(void)
+{
+    for (mach_msg_type_number_t i = 0; i < old_exception_count; i++) {
+        task_set_exception_ports(
+            mach_task_self(),
+            old_exception_masks[i], old_exception_ports[i],
+            old_exception_behaviors[i], old_exception_flavors[i]
+        );
+    }
+}
+#endif
+
+static void
+read_barrier_signal(int sig, siginfo_t *info, void *data)
+{
+    // setup SEGV/BUS handlers for errors
+    struct sigaction prev_sigbus, prev_sigsegv;
+    sigaction(SIGBUS, &old_sigbus_handler, &prev_sigbus);
+    sigaction(SIGSEGV, &old_sigsegv_handler, &prev_sigsegv);
+
+    // enable SIGBUS/SEGV
+    sigset_t set, prev_set;
+    sigemptyset(&set);
+    sigaddset(&set, SIGBUS);
+    sigaddset(&set, SIGSEGV);
+    sigprocmask(SIG_UNBLOCK, &set, &prev_set);
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+    disable_mach_bad_access_exc();
+#endif
+    // run handler
+    read_barrier_handler((uintptr_t)info->si_addr);
+
+    // reset SEGV/BUS handlers
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+    restore_mach_bad_access_exc();
+#endif
+    sigaction(SIGBUS, &prev_sigbus, NULL);
+    sigaction(SIGSEGV, &prev_sigsegv, NULL);
+    sigprocmask(SIG_SETMASK, &prev_set, NULL);
+}
+
+static void
+uninstall_handlers(void)
+{
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+    restore_mach_bad_access_exc();
+#endif
+    sigaction(SIGBUS, &old_sigbus_handler, NULL);
+    sigaction(SIGSEGV, &old_sigsegv_handler, NULL);
+}
+
+static void
+install_handlers(void)
+{
+    struct sigaction action;
+    memset(&action, 0, sizeof(struct sigaction));
+    sigemptyset(&action.sa_mask);
+    action.sa_sigaction = read_barrier_signal;
+    action.sa_flags = SA_SIGINFO | SA_ONSTACK;
+
+    sigaction(SIGBUS, &action, &old_sigbus_handler);
+    sigaction(SIGSEGV, &action, &old_sigsegv_handler);
+#ifdef HAVE_MACH_TASK_EXCEPTION_PORTS
+    disable_mach_bad_access_exc();
+#endif
+}
+#endif
+
+static void
+gc_compact_finish(rb_objspace_t *objspace)
+{
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        gc_unprotect_pages(objspace, heap);
+    }
+
+    uninstall_handlers();
+
+    gc_update_references(objspace);
+    objspace->profile.compact_count++;
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        heap->compact_cursor = NULL;
+        heap->free_pages = NULL;
+        heap->compact_cursor_index = 0;
+    }
+
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->moved_objects = objspace->rcompactor.total_moved - record->moved_objects;
+    }
+    objspace->flags.during_compacting = FALSE;
+}
+
+struct gc_sweep_context {
+    struct heap_page *page;
+    int final_slots;
+    int freed_slots;
+    int empty_slots;
+};
+
+static inline void
+gc_sweep_plane(rb_objspace_t *objspace, rb_heap_t *heap, uintptr_t p, bits_t bitset, struct gc_sweep_context *ctx)
+{
+    struct heap_page *sweep_page = ctx->page;
+    short slot_size = sweep_page->slot_size;
+
+    do {
+        VALUE vp = (VALUE)p;
+        GC_ASSERT(vp % sizeof(VALUE) == 0);
+
+        rb_asan_unpoison_object(vp, false);
+        if (bitset & 1) {
+            switch (BUILTIN_TYPE(vp)) {
+              case T_MOVED:
+                if (objspace->flags.during_compacting) {
+                    /* The sweep cursor shouldn't have made it to any
+                     * T_MOVED slots while the compact flag is enabled.
+                     * The sweep cursor and compact cursor move in
+                     * opposite directions, and when they meet references will
+                     * get updated and "during_compacting" should get disabled */
+                    rb_bug("T_MOVED shouldn't be seen until compaction is finished");
+                }
+                gc_report(3, objspace, "page_sweep: %s is added to freelist\n", rb_obj_info(vp));
+                ctx->empty_slots++;
+                heap_page_add_freeobj(objspace, sweep_page, vp);
+                break;
+              case T_ZOMBIE:
+                /* already counted */
+                break;
+              case T_NONE:
+                ctx->empty_slots++; /* already freed */
+                break;
+
+              default:
+#if RGENGC_CHECK_MODE
+                if (!is_full_marking(objspace)) {
+                    if (RVALUE_OLD_P(objspace, vp)) rb_bug("page_sweep: %p - old while minor GC.", (void *)p);
+                    if (RVALUE_REMEMBERED(objspace, vp)) rb_bug("page_sweep: %p - remembered.", (void *)p);
+                }
+#endif
+
+#if RGENGC_CHECK_MODE
+#define CHECK(x) if (x(objspace, vp) != FALSE) rb_bug("obj_free: " #x "(%s) != FALSE", rb_obj_info(vp))
+                CHECK(RVALUE_WB_UNPROTECTED);
+                CHECK(RVALUE_MARKED);
+                CHECK(RVALUE_MARKING);
+                CHECK(RVALUE_UNCOLLECTIBLE);
+#undef CHECK
+#endif
+
+                if (!rb_gc_obj_needs_cleanup_p(vp)) {
+                    (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)p, slot_size);
+                    heap_page_add_freeobj(objspace, sweep_page, vp);
+                    gc_report(3, objspace, "page_sweep: %s (fast path) added to freelist\n", rb_obj_info(vp));
+                    ctx->freed_slots++;
+                }
+                else {
+                    gc_report(2, objspace, "page_sweep: free %p\n", (void *)p);
+
+                    rb_gc_obj_free_vm_weak_references(vp);
+                    if (rb_gc_obj_free(objspace, vp)) {
+                        (void)VALGRIND_MAKE_MEM_UNDEFINED((void*)p, slot_size);
+                        heap_page_add_freeobj(objspace, sweep_page, vp);
+                        gc_report(3, objspace, "page_sweep: %s is added to freelist\n", rb_obj_info(vp));
+                        ctx->freed_slots++;
+                    }
+                    else {
+                        ctx->final_slots++;
+                    }
+                }
+                break;
+            }
+        }
+        p += slot_size;
+        bitset >>= 1;
+    } while (bitset);
+}
+
+static inline void
+gc_sweep_page(rb_objspace_t *objspace, rb_heap_t *heap, struct gc_sweep_context *ctx)
+{
+    struct heap_page *sweep_page = ctx->page;
+    GC_ASSERT(sweep_page->heap == heap);
+
+    uintptr_t p;
+    bits_t *bits, bitset;
+
+    gc_report(2, objspace, "page_sweep: start.\n");
+
+#if RGENGC_CHECK_MODE
+    if (!objspace->flags.immediate_sweep) {
+        GC_ASSERT(sweep_page->flags.before_sweep == TRUE);
+    }
+#endif
+    sweep_page->flags.before_sweep = FALSE;
+    sweep_page->free_slots = 0;
+
+    p = (uintptr_t)sweep_page->start;
+    bits = sweep_page->mark_bits;
+    short slot_size = sweep_page->slot_size;
+    int total_slots = sweep_page->total_slots;
+    int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+
+    int out_of_range_bits = total_slots % BITS_BITLENGTH;
+    if (out_of_range_bits != 0) {
+        bits[bitmap_plane_count - 1] |= ~(((bits_t)1 << out_of_range_bits) - 1);
+    }
+
+    // Clear wb_unprotected and age bits for all unmarked slots
+    {
+        bits_t *wb_unprotected_bits = sweep_page->wb_unprotected_bits;
+        bits_t *age_bits = sweep_page->age_bits;
+        for (int i = 0; i < bitmap_plane_count; i++) {
+            bits_t unmarked = ~bits[i];
+            wb_unprotected_bits[i] &= ~unmarked;
+            age_bits[i * 2] &= ~unmarked;
+            age_bits[i * 2 + 1] &= ~unmarked;
+        }
+    }
+
+    for (int i = 0; i < bitmap_plane_count; i++) {
+        bitset = ~bits[i];
+        if (bitset) {
+            gc_sweep_plane(objspace, heap, p, bitset, ctx);
+        }
+        p += BITS_BITLENGTH * slot_size;
+    }
+
+    if (!heap->compact_cursor) {
+        gc_setup_mark_bits(sweep_page);
+    }
+
+#if GC_PROFILE_MORE_DETAIL
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->removing_objects += ctx->final_slots + ctx->freed_slots;
+        record->empty_objects += ctx->empty_slots;
+    }
+#endif
+    if (0) fprintf(stderr, "gc_sweep_page(%"PRIdSIZE"): total_slots: %d, freed_slots: %d, empty_slots: %d, final_slots: %d\n",
+                   rb_gc_count(),
+                   sweep_page->total_slots,
+                   ctx->freed_slots, ctx->empty_slots, ctx->final_slots);
+
+    sweep_page->free_slots += ctx->freed_slots + ctx->empty_slots;
+    sweep_page->heap->total_freed_objects += ctx->freed_slots;
+
+    if (heap_pages_deferred_final && !finalizing) {
+        gc_finalize_deferred_register(objspace);
+    }
+
+#if RGENGC_CHECK_MODE
+    short freelist_len = 0;
+    asan_unlock_freelist(sweep_page);
+    struct free_slot *ptr = sweep_page->freelist;
+    while (ptr) {
+        freelist_len++;
+        rb_asan_unpoison_object((VALUE)ptr, false);
+        struct free_slot *next = ptr->next;
+        rb_asan_poison_object((VALUE)ptr);
+        ptr = next;
+    }
+    asan_lock_freelist(sweep_page);
+    if (freelist_len != sweep_page->free_slots) {
+        rb_bug("inconsistent freelist length: expected %d but was %d", sweep_page->free_slots, freelist_len);
+    }
+#endif
+
+    gc_report(2, objspace, "page_sweep: end.\n");
+}
+
+static const char *
+gc_mode_name(enum gc_mode mode)
+{
+    switch (mode) {
+      case gc_mode_none: return "none";
+      case gc_mode_marking: return "marking";
+      case gc_mode_sweeping: return "sweeping";
+      case gc_mode_compacting: return "compacting";
+      default: rb_bug("gc_mode_name: unknown mode: %d", (int)mode);
+    }
+}
+
+static void
+gc_mode_transition(rb_objspace_t *objspace, enum gc_mode mode)
+{
+#if RGENGC_CHECK_MODE
+    enum gc_mode prev_mode = gc_mode(objspace);
+    switch (prev_mode) {
+      case gc_mode_none:     GC_ASSERT(mode == gc_mode_marking); break;
+      case gc_mode_marking:  GC_ASSERT(mode == gc_mode_sweeping); break;
+      case gc_mode_sweeping: GC_ASSERT(mode == gc_mode_none || mode == gc_mode_compacting); break;
+      case gc_mode_compacting: GC_ASSERT(mode == gc_mode_none); break;
+    }
+#endif
+    if (0) fprintf(stderr, "gc_mode_transition: %s->%s\n", gc_mode_name(gc_mode(objspace)), gc_mode_name(mode));
+    gc_mode_set(objspace, mode);
+}
+
+static void
+heap_page_freelist_append(struct heap_page *page, struct free_slot *freelist)
+{
+    if (freelist) {
+        asan_unlock_freelist(page);
+        if (page->freelist) {
+            struct free_slot *p = page->freelist;
+            rb_asan_unpoison_object((VALUE)p, false);
+            while (p->next) {
+                struct free_slot *prev = p;
+                p = p->next;
+                rb_asan_poison_object((VALUE)prev);
+                rb_asan_unpoison_object((VALUE)p, false);
+            }
+            p->next = freelist;
+            rb_asan_poison_object((VALUE)p);
+        }
+        else {
+            page->freelist = freelist;
+        }
+        asan_lock_freelist(page);
+    }
+}
+
+static void
+gc_sweep_start_heap(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    heap->sweeping_page = ccan_list_top(&heap->pages, struct heap_page, page_node);
+    if (heap->sweeping_page) {
+        objspace->sweeping_heap_count++;
+    }
+    heap->free_pages = NULL;
+    heap->pooled_pages = NULL;
+    if (!objspace->flags.immediate_sweep) {
+        struct heap_page *page = NULL;
+
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            page->flags.before_sweep = TRUE;
+        }
+    }
+}
+
+#if defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 4
+__attribute__((noinline))
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+static void gc_sort_heap_by_compare_func(rb_objspace_t *objspace, gc_compact_compare_func compare_func);
+static int compare_pinned_slots(const void *left, const void *right, void *d);
+#endif
+
+static void
+gc_ractor_newobj_cache_clear(void *c, void *data)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    rb_ractor_newobj_cache_t *newobj_cache = c;
+
+    newobj_cache->incremental_mark_step_allocated_slots = 0;
+
+    for (size_t heap_idx = 0; heap_idx < HEAP_COUNT; heap_idx++) {
+
+        rb_ractor_newobj_heap_cache_t *cache = &newobj_cache->heap_caches[heap_idx];
+
+        rb_heap_t *heap = &heaps[heap_idx];
+        RUBY_ATOMIC_SIZE_ADD(heap->total_allocated_objects, cache->allocated_objects_count);
+        cache->allocated_objects_count = 0;
+
+        struct heap_page *page = cache->using_page;
+        struct free_slot *freelist = cache->freelist;
+        RUBY_DEBUG_LOG("ractor using_page:%p freelist:%p", (void *)page, (void *)freelist);
+
+        heap_page_freelist_append(page, freelist);
+
+        cache->using_page = NULL;
+        cache->freelist = NULL;
+    }
+}
+
+static void
+gc_sweep_freeobj_hooks_page(rb_objspace_t *objspace, struct heap_page *page)
+{
+    bits_t *bits = page->mark_bits;
+    uintptr_t p = (uintptr_t)page->start;
+    short slot_size = page->slot_size;
+    int total_slots = page->total_slots;
+    int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+
+    int out_of_range_bits = total_slots % BITS_BITLENGTH;
+    bits_t last_plane_mask = (out_of_range_bits != 0)
+        ? ~(((bits_t)1 << out_of_range_bits) - 1)
+        : 0;
+
+    for (int j = 0; j < bitmap_plane_count; j++) {
+        bits_t bitset = ~bits[j];
+        if (j == bitmap_plane_count - 1) {
+            bitset &= ~last_plane_mask;
+        }
+
+        uintptr_t pp = p;
+        while (bitset) {
+            if (bitset & 1) {
+                VALUE vp = (VALUE)pp;
+                asan_unpoisoning_object(vp) {
+                    switch (BUILTIN_TYPE(vp)) {
+                      case T_NONE:
+                      case T_ZOMBIE:
+                      case T_MOVED:
+                        break;
+                      default:
+                        rb_gc_event_hook(vp, RUBY_INTERNAL_EVENT_FREEOBJ);
+                        break;
+                    }
+                }
+            }
+            pp += slot_size;
+            bitset >>= 1;
+        }
+        p += BITS_BITLENGTH * slot_size;
+    }
+}
+
+static void
+gc_sweep_freeobj_hooks(rb_objspace_t *objspace)
+{
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        struct heap_page *page = NULL;
+
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            gc_sweep_freeobj_hooks_page(objspace, page);
+        }
+    }
+}
+
+static void
+gc_sweep_start(rb_objspace_t *objspace)
+{
+    gc_mode_transition(objspace, gc_mode_sweeping);
+    objspace->rincgc.pooled_slots = 0;
+
+    if (RB_UNLIKELY(objspace->hook_events & RUBY_INTERNAL_EVENT_FREEOBJ)) {
+        gc_sweep_freeobj_hooks(objspace);
+    }
+
+#if GC_CAN_COMPILE_COMPACTION
+    if (objspace->flags.during_compacting) {
+        gc_sort_heap_by_compare_func(
+            objspace,
+            objspace->rcompactor.compare_func ? objspace->rcompactor.compare_func : compare_pinned_slots
+        );
+    }
+#endif
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        gc_sweep_start_heap(objspace, heap);
+
+        /* We should call gc_sweep_finish_heap for size pools with no pages. */
+        if (heap->sweeping_page == NULL) {
+            GC_ASSERT(heap->total_pages == 0);
+            GC_ASSERT(heap->total_slots == 0);
+            gc_sweep_finish_heap(objspace, heap);
+        }
+    }
+
+    rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
+}
+
+static void
+gc_sweep_finish_heap(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    size_t total_slots = heap->total_slots;
+    size_t swept_slots = heap->freed_slots + heap->empty_slots;
+
+    size_t init_slots = gc_params.heap_init_bytes / heap->slot_size;
+    size_t min_free_slots = (size_t)(MAX(total_slots, init_slots) * gc_params.heap_free_slots_min_ratio);
+
+    if (swept_slots < min_free_slots &&
+            /* The heap is a growth heap if it freed more slots than had empty slots. */
+            ((heap->empty_slots == 0 && total_slots > 0) || heap->freed_slots > heap->empty_slots)) {
+        /* If we don't have enough slots and we have pages on the tomb heap, move
+        * pages from the tomb heap to the eden heap. This may prevent page
+        * creation thrashing (frequently allocating and deallocting pages) and
+        * GC thrashing (running GC more frequently than required). */
+        struct heap_page *resurrected_page;
+        while (swept_slots < min_free_slots &&
+                (resurrected_page = heap_page_resurrect(objspace))) {
+            heap_add_page(objspace, heap, resurrected_page);
+            heap_add_freepage(heap, resurrected_page);
+
+            swept_slots += resurrected_page->free_slots;
+        }
+
+        if (swept_slots < min_free_slots) {
+            /* Grow this heap if we are in a major GC or if we haven't run at least
+             * RVALUE_OLD_AGE minor GC since the last major GC. */
+            if (is_full_marking(objspace) ||
+                    objspace->profile.count - objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
+                if (objspace->heap_pages.allocatable_bytes < min_free_slots * heap->slot_size) {
+                    heap_allocatable_bytes_expand(objspace, heap, swept_slots, heap->total_slots, heap->slot_size);
+                }
+            }
+            else if (swept_slots < min_free_slots * 7 / 8 &&
+                     objspace->heap_pages.allocatable_bytes < (min_free_slots * 7 / 8 - swept_slots) * heap->slot_size) {
+                gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
+                heap->force_major_gc_count++;
+            }
+        }
+    }
+}
+
+static void
+gc_sweep_finish(rb_objspace_t *objspace)
+{
+    gc_report(1, objspace, "gc_sweep_finish\n");
+
+    gc_prof_set_heap_info(objspace);
+    heap_pages_free_unused_pages(objspace);
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+
+        heap->freed_slots = 0;
+        heap->empty_slots = 0;
+
+        if (!will_be_incremental_marking(objspace)) {
+            struct heap_page *end_page = heap->free_pages;
+            if (end_page) {
+                while (end_page->free_next) end_page = end_page->free_next;
+                end_page->free_next = heap->pooled_pages;
+            }
+            else {
+                heap->free_pages = heap->pooled_pages;
+            }
+            heap->pooled_pages = NULL;
+            objspace->rincgc.pooled_slots = 0;
+        }
+    }
+
+    (void)gc_malloc_counters_snapshot(objspace, &objspace->malloc_counters.counters);
+#if RGENGC_ESTIMATE_OLDMALLOC
+    if (objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) {
+        (void)gc_malloc_counters_snapshot(objspace, &objspace->malloc_counters.oldcounters);
+    }
+#endif
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_END_SWEEP);
+    gc_mode_transition(objspace, gc_mode_none);
+
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+}
+
+static int
+gc_sweep_step(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    struct heap_page *sweep_page = heap->sweeping_page;
+    int swept_slots = 0;
+    int pooled_slots = 0;
+    int sweep_budget = GC_INCREMENTAL_SWEEP_BYTES / heap->slot_size;
+    int pool_budget = GC_INCREMENTAL_SWEEP_POOL_BYTES / heap->slot_size;
+
+    if (sweep_page == NULL) return FALSE;
+
+#if GC_ENABLE_LAZY_SWEEP
+    gc_prof_sweep_timer_start(objspace);
+#endif
+
+    do {
+        RUBY_DEBUG_LOG("sweep_page:%p", (void *)sweep_page);
+
+        struct gc_sweep_context ctx = {
+            .page = sweep_page,
+            .final_slots = 0,
+            .freed_slots = 0,
+            .empty_slots = 0,
+        };
+        gc_sweep_page(objspace, heap, &ctx);
+        int free_slots = ctx.freed_slots + ctx.empty_slots;
+
+        heap->sweeping_page = ccan_list_next(&heap->pages, sweep_page, page_node);
+
+        if (free_slots == sweep_page->total_slots) {
+            /* There are no living objects, so move this page to the global empty pages. */
+            heap_unlink_page(objspace, heap, sweep_page);
+
+            sweep_page->start = 0;
+            sweep_page->total_slots = 0;
+            sweep_page->slot_size = 0;
+            sweep_page->heap = NULL;
+            sweep_page->free_slots = 0;
+
+            asan_unlock_freelist(sweep_page);
+            sweep_page->freelist = NULL;
+            asan_lock_freelist(sweep_page);
+
+            asan_poison_memory_region(sweep_page->body, HEAP_PAGE_SIZE);
+
+            objspace->empty_pages_count++;
+            sweep_page->free_next = objspace->empty_pages;
+            objspace->empty_pages = sweep_page;
+        }
+        else if (free_slots > 0) {
+            heap->freed_slots += ctx.freed_slots;
+            heap->empty_slots += ctx.empty_slots;
+
+            if (pooled_slots < pool_budget) {
+                heap_add_poolpage(objspace, heap, sweep_page);
+                pooled_slots += free_slots;
+            }
+            else {
+                heap_add_freepage(heap, sweep_page);
+                swept_slots += free_slots;
+                if (swept_slots > sweep_budget) {
+                    break;
+                }
+            }
+        }
+        else {
+            sweep_page->free_next = NULL;
+        }
+    } while ((sweep_page = heap->sweeping_page));
+
+    if (!heap->sweeping_page) {
+        objspace->sweeping_heap_count--;
+        GC_ASSERT(objspace->sweeping_heap_count >= 0);
+        gc_sweep_finish_heap(objspace, heap);
+
+        if (!has_sweeping_pages(objspace)) {
+            gc_sweep_finish(objspace);
+        }
+    }
+
+#if GC_ENABLE_LAZY_SWEEP
+    gc_prof_sweep_timer_stop(objspace);
+#endif
+
+    return heap->free_pages != NULL;
+}
+
+static void
+gc_sweep_rest(rb_objspace_t *objspace)
+{
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+
+        while (heap->sweeping_page) {
+            gc_sweep_step(objspace, heap);
+        }
+    }
+}
+
+static void
+gc_sweep_continue(rb_objspace_t *objspace, rb_heap_t *sweep_heap)
+{
+    GC_ASSERT(dont_gc_val() == FALSE || objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
+    if (!GC_ENABLE_LAZY_SWEEP) return;
+
+    gc_sweeping_enter(objspace);
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        if (gc_sweep_step(objspace, heap)) {
+            GC_ASSERT(heap->free_pages != NULL);
+        }
+        else if (heap == sweep_heap) {
+            if (objspace->empty_pages_count > 0 || objspace->heap_pages.allocatable_bytes > 0) {
+                /* [Bug #21548]
+                 *
+                 * If this heap is the heap we want to sweep, but we weren't able
+                 * to free any slots, but we also either have empty pages or could
+                 * allocate new pages, then we want to preemptively claim a page
+                 * because it's possible that sweeping another heap will call
+                 * gc_sweep_finish_heap, which may use up all of the
+                 * empty/allocatable pages. If other heaps are not finished sweeping
+                 * then we do not finish this GC and we will end up triggering a new
+                 * GC cycle during this GC phase. */
+                heap_page_allocate_and_initialize(objspace, heap);
+
+                GC_ASSERT(heap->free_pages != NULL);
+            }
+            else {
+                /* Not allowed to create a new page so finish sweeping. */
+                gc_sweep_rest(objspace);
+                GC_ASSERT(gc_mode(objspace) == gc_mode_none);
+                break;
+            }
+        }
+    }
+
+    gc_sweeping_exit(objspace);
+}
+
+VALUE
+rb_gc_impl_location(void *objspace_ptr, VALUE value)
+{
+    VALUE destination;
+
+    asan_unpoisoning_object(value) {
+        if (BUILTIN_TYPE(value) == T_MOVED) {
+            destination = (VALUE)RMOVED(value)->destination;
+            GC_ASSERT(BUILTIN_TYPE(destination) != T_NONE);
+        }
+        else {
+            destination = value;
+        }
+    }
+
+    return destination;
+}
+
+#if GC_CAN_COMPILE_COMPACTION
+static void
+invalidate_moved_plane(rb_objspace_t *objspace, struct heap_page *page, uintptr_t p, bits_t bitset)
+{
+    if (bitset) {
+        do {
+            if (bitset & 1) {
+                VALUE forwarding_object = (VALUE)p;
+                VALUE object;
+
+                if (BUILTIN_TYPE(forwarding_object) == T_MOVED) {
+                    GC_ASSERT(RVALUE_PINNED(objspace, forwarding_object));
+                    GC_ASSERT(!RVALUE_MARKED(objspace, forwarding_object));
+
+                    CLEAR_IN_BITMAP(GET_HEAP_PINNED_BITS(forwarding_object), forwarding_object);
+
+                    object = rb_gc_impl_location(objspace, forwarding_object);
+                    gc_move(objspace, object, forwarding_object, GET_HEAP_PAGE(object), page);
+                    /* forwarding_object is now our actual object, and "object"
+                     * is the free slot for the original page */
+
+                    struct heap_page *orig_page = GET_HEAP_PAGE(object);
+                    orig_page->free_slots++;
+                    RVALUE_AGE_SET_BITMAP(object, 0);
+                    heap_page_add_freeobj(objspace, orig_page, object);
+
+                    GC_ASSERT(RVALUE_MARKED(objspace, forwarding_object));
+                    GC_ASSERT(BUILTIN_TYPE(forwarding_object) != T_MOVED);
+                    GC_ASSERT(BUILTIN_TYPE(forwarding_object) != T_NONE);
+                }
+            }
+            p += page->slot_size;
+            bitset >>= 1;
+        } while (bitset);
+    }
+}
+
+static void
+invalidate_moved_page(rb_objspace_t *objspace, struct heap_page *page)
+{
+    int i;
+    bits_t *mark_bits, *pin_bits;
+    bits_t bitset;
+    short slot_size = page->slot_size;
+    int total_slots = page->total_slots;
+    int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+
+    mark_bits = page->mark_bits;
+    pin_bits = page->pinned_bits;
+
+    uintptr_t p = page->start;
+
+    for (i=0; i < bitmap_plane_count; i++) {
+        /* Moved objects are pinned but never marked. We reuse the pin bits
+         * to indicate there is a moved object in this slot. */
+        bitset = pin_bits[i] & ~mark_bits[i];
+        invalidate_moved_plane(objspace, page, p, bitset);
+        p += BITS_BITLENGTH * slot_size;
+    }
+}
+#endif
+
+static void
+gc_compact_start(rb_objspace_t *objspace)
+{
+    struct heap_page *page = NULL;
+    gc_mode_transition(objspace, gc_mode_compacting);
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            page->flags.before_sweep = TRUE;
+        }
+
+        heap->compact_cursor = ccan_list_tail(&heap->pages, struct heap_page, page_node);
+        heap->compact_cursor_index = 0;
+    }
+
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->moved_objects = objspace->rcompactor.total_moved;
+    }
+
+    memset(objspace->rcompactor.considered_count_table, 0, T_MASK * sizeof(size_t));
+    memset(objspace->rcompactor.moved_count_table, 0, T_MASK * sizeof(size_t));
+    memset(objspace->rcompactor.moved_up_count_table, 0, T_MASK * sizeof(size_t));
+    memset(objspace->rcompactor.moved_down_count_table, 0, T_MASK * sizeof(size_t));
+
+    /* Set up read barrier for pages containing MOVED objects */
+    install_handlers();
+}
+
+static void gc_sweep_compact(rb_objspace_t *objspace);
+
+static void
+gc_sweep(rb_objspace_t *objspace)
+{
+    gc_sweeping_enter(objspace);
+
+    const unsigned int immediate_sweep = objspace->flags.immediate_sweep;
+
+    gc_report(1, objspace, "gc_sweep: immediate: %d\n", immediate_sweep);
+
+    gc_sweep_start(objspace);
+    if (objspace->flags.during_compacting) {
+        gc_sweep_compact(objspace);
+    }
+
+    if (immediate_sweep) {
+#if !GC_ENABLE_LAZY_SWEEP
+        gc_prof_sweep_timer_start(objspace);
+#endif
+        gc_sweep_rest(objspace);
+#if !GC_ENABLE_LAZY_SWEEP
+        gc_prof_sweep_timer_stop(objspace);
+#endif
+    }
+    else {
+
+        /* Sweep every size pool. */
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+            gc_sweep_step(objspace, heap);
+        }
+    }
+
+    gc_sweeping_exit(objspace);
+}
+
+/* Marking - Marking stack */
+
+static stack_chunk_t *
+stack_chunk_alloc(void)
+{
+    stack_chunk_t *res;
+
+    res = malloc(sizeof(stack_chunk_t));
+    if (!res)
+        rb_memerror();
+
+    return res;
+}
+
+static inline int
+is_mark_stack_empty(mark_stack_t *stack)
+{
+    return stack->chunk == NULL;
+}
+
+static size_t
+mark_stack_size(mark_stack_t *stack)
+{
+    size_t size = stack->index;
+    stack_chunk_t *chunk = stack->chunk ? stack->chunk->next : NULL;
+
+    while (chunk) {
+        size += stack->limit;
+        chunk = chunk->next;
+    }
+    return size;
+}
+
+static void
+add_stack_chunk_cache(mark_stack_t *stack, stack_chunk_t *chunk)
+{
+    chunk->next = stack->cache;
+    stack->cache = chunk;
+    stack->cache_size++;
+}
+
+static void
+shrink_stack_chunk_cache(mark_stack_t *stack)
+{
+    stack_chunk_t *chunk;
+
+    if (stack->unused_cache_size > (stack->cache_size/2)) {
+        chunk = stack->cache;
+        stack->cache = stack->cache->next;
+        stack->cache_size--;
+        free(chunk);
+    }
+    stack->unused_cache_size = stack->cache_size;
+}
+
+static void
+push_mark_stack_chunk(mark_stack_t *stack)
+{
+    stack_chunk_t *next;
+
+    GC_ASSERT(stack->index == stack->limit);
+
+    if (stack->cache_size > 0) {
+        next = stack->cache;
+        stack->cache = stack->cache->next;
+        stack->cache_size--;
+        if (stack->unused_cache_size > stack->cache_size)
+            stack->unused_cache_size = stack->cache_size;
+    }
+    else {
+        next = stack_chunk_alloc();
+    }
+    next->next = stack->chunk;
+    stack->chunk = next;
+    stack->index = 0;
+}
+
+static void
+pop_mark_stack_chunk(mark_stack_t *stack)
+{
+    stack_chunk_t *prev;
+
+    prev = stack->chunk->next;
+    GC_ASSERT(stack->index == 0);
+    add_stack_chunk_cache(stack, stack->chunk);
+    stack->chunk = prev;
+    stack->index = stack->limit;
+}
+
+static void
+mark_stack_chunk_list_free(stack_chunk_t *chunk)
+{
+    stack_chunk_t *next = NULL;
+
+    while (chunk != NULL) {
+        next = chunk->next;
+        free(chunk);
+        chunk = next;
+    }
+}
+
+static void
+free_stack_chunks(mark_stack_t *stack)
+{
+    mark_stack_chunk_list_free(stack->chunk);
+}
+
+static void
+mark_stack_free_cache(mark_stack_t *stack)
+{
+    mark_stack_chunk_list_free(stack->cache);
+    stack->cache_size = 0;
+    stack->unused_cache_size = 0;
+}
+
+static void
+push_mark_stack(mark_stack_t *stack, VALUE obj)
+{
+    switch (BUILTIN_TYPE(obj)) {
+      case T_OBJECT:
+      case T_CLASS:
+      case T_MODULE:
+      case T_FLOAT:
+      case T_STRING:
+      case T_REGEXP:
+      case T_ARRAY:
+      case T_HASH:
+      case T_STRUCT:
+      case T_BIGNUM:
+      case T_FILE:
+      case T_DATA:
+      case T_MATCH:
+      case T_COMPLEX:
+      case T_RATIONAL:
+      case T_TRUE:
+      case T_FALSE:
+      case T_SYMBOL:
+      case T_IMEMO:
+      case T_ICLASS:
+        if (stack->index == stack->limit) {
+            push_mark_stack_chunk(stack);
+        }
+        stack->chunk->data[stack->index++] = obj;
+        return;
+
+      case T_NONE:
+      case T_NIL:
+      case T_FIXNUM:
+      case T_MOVED:
+      case T_ZOMBIE:
+      case T_UNDEF:
+      case T_MASK:
+        rb_bug("push_mark_stack() called for broken object");
+        break;
+
+      case T_NODE:
+        rb_bug("push_mark_stack: unexpected T_NODE object");
+        break;
+    }
+
+    rb_bug("rb_gc_mark(): unknown data type 0x%x(%p) %s",
+            BUILTIN_TYPE(obj), (void *)obj,
+            is_pointer_to_heap((rb_objspace_t *)rb_gc_get_objspace(), (void *)obj) ? "corrupted object" : "non object");
+}
+
+static int
+pop_mark_stack(mark_stack_t *stack, VALUE *data)
+{
+    if (is_mark_stack_empty(stack)) {
+        return FALSE;
+    }
+    if (stack->index == 1) {
+        *data = stack->chunk->data[--stack->index];
+        pop_mark_stack_chunk(stack);
+    }
+    else {
+        *data = stack->chunk->data[--stack->index];
+    }
+    return TRUE;
+}
+
+static void
+init_mark_stack(mark_stack_t *stack)
+{
+    int i;
+
+    MEMZERO(stack, mark_stack_t, 1);
+    stack->index = stack->limit = STACK_CHUNK_SIZE;
+
+    for (i=0; i < 4; i++) {
+        add_stack_chunk_cache(stack, stack_chunk_alloc());
+    }
+    stack->unused_cache_size = stack->cache_size;
+}
+
+/* Marking */
+
+static void
+rgengc_check_relation(rb_objspace_t *objspace, VALUE obj)
+{
+    if (objspace->rgengc.parent_object_old_p) {
+        if (RVALUE_WB_UNPROTECTED(objspace, obj) || !RVALUE_OLD_P(objspace, obj)) {
+            rgengc_remember(objspace, objspace->rgengc.parent_object);
+        }
+    }
+}
+
+static inline int
+gc_mark_set(rb_objspace_t *objspace, VALUE obj)
+{
+    if (RVALUE_MARKED(objspace, obj)) return 0;
+    MARK_IN_BITMAP(GET_HEAP_MARK_BITS(obj), obj);
+    return 1;
+}
+
+static void
+gc_aging(rb_objspace_t *objspace, VALUE obj)
+{
+    /* Disable aging if Major GC's are disabled. This will prevent longish lived
+     * objects filling up the heap at the expense of marking many more objects.
+     *
+     * We should always pre-warm our process when disabling majors, by running
+     * GC manually several times so that most objects likely to become oldgen
+     * are already oldgen.
+     */
+    if(!gc_config_full_mark_val)
+        return;
+
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+
+    GC_ASSERT(RVALUE_MARKING(objspace, obj) == FALSE);
+    check_rvalue_consistency(objspace, obj);
+
+    if (!RVALUE_PAGE_WB_UNPROTECTED(page, obj)) {
+        if (!RVALUE_OLD_P(objspace, obj)) {
+            int t = BUILTIN_TYPE(obj);
+            if (t == T_CLASS || t == T_MODULE || t == T_ICLASS) {
+                gc_report(3, objspace, "gc_aging: YOUNG class: %s\n", rb_obj_info(obj));
+                RVALUE_AGE_SET(obj, RVALUE_OLD_AGE);
+                RVALUE_OLD_UNCOLLECTIBLE_SET(objspace, obj);
+            }
+            else {
+                gc_report(3, objspace, "gc_aging: YOUNG: %s\n", rb_obj_info(obj));
+                RVALUE_AGE_INC(objspace, obj);
+            }
+        }
+        else if (is_full_marking(objspace)) {
+            GC_ASSERT(RVALUE_PAGE_UNCOLLECTIBLE(page, obj) == FALSE);
+            RVALUE_PAGE_OLD_UNCOLLECTIBLE_SET(objspace, page, obj);
+        }
+    }
+    check_rvalue_consistency(objspace, obj);
+
+    objspace->marked_slots++;
+}
+
+static void
+gc_grey(rb_objspace_t *objspace, VALUE obj)
+{
+#if RGENGC_CHECK_MODE
+    if (RVALUE_MARKED(objspace, obj) == FALSE) rb_bug("gc_grey: %s is not marked.", rb_obj_info(obj));
+    if (RVALUE_MARKING(objspace, obj) == TRUE) rb_bug("gc_grey: %s is marking/remembered.", rb_obj_info(obj));
+#endif
+
+    if (is_incremental_marking(objspace)) {
+        MARK_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
+    }
+
+    if (RB_FL_TEST_RAW(obj, RUBY_FL_WEAK_REFERENCE)) {
+        rb_darray_append_without_gc(&objspace->weak_references, obj);
+    }
+
+    push_mark_stack(&objspace->mark_stack, obj);
+}
+
+static inline void
+gc_mark_check_t_none(rb_objspace_t *objspace, VALUE obj)
+{
+    if (RB_UNLIKELY(BUILTIN_TYPE(obj) == T_NONE)) {
+        enum {info_size = 256};
+        char obj_info_buf[info_size];
+        rb_raw_obj_info(obj_info_buf, info_size, obj);
+
+        char parent_obj_info_buf[info_size];
+        rb_raw_obj_info(parent_obj_info_buf, info_size, objspace->rgengc.parent_object);
+
+        rb_bug("try to mark T_NONE object (obj: %s, parent: %s)", obj_info_buf, parent_obj_info_buf);
+    }
+}
+
+static void
+gc_mark(rb_objspace_t *objspace, VALUE obj)
+{
+    GC_ASSERT(during_gc);
+    GC_ASSERT(!objspace->flags.during_reference_updating);
+
+    rgengc_check_relation(objspace, obj);
+    if (!gc_mark_set(objspace, obj)) return; /* already marked */
+
+    if (0) { // for debug GC marking miss
+        RUBY_DEBUG_LOG("%p (%s) parent:%p (%s)",
+                        (void *)obj, obj_type_name(obj),
+                        (void *)objspace->rgengc.parent_object, obj_type_name(objspace->rgengc.parent_object));
+    }
+
+    gc_mark_check_t_none(objspace, obj);
+
+    gc_aging(objspace, obj);
+    gc_grey(objspace, obj);
+}
+
+static inline void
+gc_pin(rb_objspace_t *objspace, VALUE obj)
+{
+    GC_ASSERT(!SPECIAL_CONST_P(obj));
+    if (RB_UNLIKELY(objspace->flags.during_compacting)) {
+        if (RB_LIKELY(during_gc)) {
+            if (!RVALUE_PINNED(objspace, obj)) {
+                GC_ASSERT(GET_HEAP_PAGE(obj)->pinned_slots <= GET_HEAP_PAGE(obj)->total_slots);
+                GET_HEAP_PAGE(obj)->pinned_slots++;
+                MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(obj), obj);
+            }
+        }
+    }
+}
+
+static inline void
+gc_mark_and_pin(rb_objspace_t *objspace, VALUE obj)
+{
+    gc_pin(objspace, obj);
+    gc_mark(objspace, obj);
+}
+
+void
+rb_gc_impl_mark_and_move(void *objspace_ptr, VALUE *ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (RB_UNLIKELY(objspace->flags.during_reference_updating)) {
+        GC_ASSERT(objspace->flags.during_compacting);
+        GC_ASSERT(during_gc);
+
+        VALUE destination = rb_gc_impl_location(objspace, *ptr);
+        if (destination != *ptr) {
+            *ptr = destination;
+        }
+    }
+    else {
+        gc_mark(objspace, *ptr);
+    }
+}
+
+void
+rb_gc_impl_mark(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    gc_mark(objspace, obj);
+}
+
+void
+rb_gc_impl_mark_and_pin(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    gc_mark_and_pin(objspace, obj);
+}
+
+void
+rb_gc_impl_mark_maybe(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    (void)VALGRIND_MAKE_MEM_DEFINED(&obj, sizeof(obj));
+
+    if (is_pointer_to_heap(objspace, (void *)obj)) {
+        asan_unpoisoning_object(obj) {
+            /* Garbage can live on the stack, so do not mark or pin */
+            switch (BUILTIN_TYPE(obj)) {
+              case T_ZOMBIE:
+              case T_NONE:
+                break;
+              default:
+                gc_mark_and_pin(objspace, obj);
+                break;
+            }
+        }
+    }
+}
+
+static int
+pin_value(st_data_t key, st_data_t value, st_data_t data)
+{
+    rb_gc_impl_mark_and_pin((void *)data, (VALUE)value);
+
+    return ST_CONTINUE;
+}
+
+static inline void
+gc_mark_set_parent_raw(rb_objspace_t *objspace, VALUE obj, bool old_p)
+{
+    asan_unpoison_memory_region(&objspace->rgengc.parent_object, sizeof(objspace->rgengc.parent_object), false);
+    asan_unpoison_memory_region(&objspace->rgengc.parent_object_old_p, sizeof(objspace->rgengc.parent_object_old_p), false);
+    objspace->rgengc.parent_object = obj;
+    objspace->rgengc.parent_object_old_p = old_p;
+}
+
+static inline void
+gc_mark_set_parent(rb_objspace_t *objspace, VALUE obj)
+{
+    gc_mark_set_parent_raw(objspace, obj, RVALUE_OLD_P(objspace, obj));
+}
+
+static inline void
+gc_mark_set_parent_invalid(rb_objspace_t *objspace)
+{
+    asan_poison_memory_region(&objspace->rgengc.parent_object, sizeof(objspace->rgengc.parent_object));
+    asan_poison_memory_region(&objspace->rgengc.parent_object_old_p, sizeof(objspace->rgengc.parent_object_old_p));
+}
+
+static void
+mark_roots(rb_objspace_t *objspace, const char **categoryp)
+{
+#define MARK_CHECKPOINT(category) do { \
+    if (categoryp) *categoryp = category; \
+} while (0)
+
+    MARK_CHECKPOINT("objspace");
+    gc_mark_set_parent_raw(objspace, Qundef, false);
+
+    if (finalizer_table != NULL) {
+        st_foreach(finalizer_table, pin_value, (st_data_t)objspace);
+    }
+
+    if (stress_to_class) rb_gc_mark(stress_to_class);
+
+    rb_gc_save_machine_context();
+    rb_gc_mark_roots(objspace, categoryp);
+    gc_mark_set_parent_invalid(objspace);
+}
+
+static void
+gc_mark_children(rb_objspace_t *objspace, VALUE obj)
+{
+    gc_mark_set_parent(objspace, obj);
+    rb_gc_mark_children(objspace, obj);
+    gc_mark_set_parent_invalid(objspace);
+}
+
+/**
+ * incremental: 0 -> not incremental (do all)
+ * incremental: n -> mark at most `n' objects
+ */
+static inline int
+gc_mark_stacked_objects(rb_objspace_t *objspace, int incremental, size_t count)
+{
+    mark_stack_t *mstack = &objspace->mark_stack;
+    VALUE obj;
+    size_t marked_slots_at_the_beginning = objspace->marked_slots;
+    size_t popped_count = 0;
+
+    while (pop_mark_stack(mstack, &obj)) {
+        if (obj == Qundef) continue; /* skip */
+
+        if (RGENGC_CHECK_MODE && !RVALUE_MARKED(objspace, obj)) {
+            rb_bug("gc_mark_stacked_objects: %s is not marked.", rb_obj_info(obj));
+        }
+        gc_mark_children(objspace, obj);
+
+        if (incremental) {
+            if (RGENGC_CHECK_MODE && !RVALUE_MARKING(objspace, obj)) {
+                rb_bug("gc_mark_stacked_objects: incremental, but marking bit is 0");
+            }
+            CLEAR_IN_BITMAP(GET_HEAP_MARKING_BITS(obj), obj);
+            popped_count++;
+
+            if (popped_count + (objspace->marked_slots - marked_slots_at_the_beginning) > count) {
+                break;
+            }
+        }
+        else {
+            /* just ignore marking bits */
+        }
+    }
+
+    if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(objspace);
+
+    if (is_mark_stack_empty(mstack)) {
+        shrink_stack_chunk_cache(mstack);
+        return TRUE;
+    }
+    else {
+        return FALSE;
+    }
+}
+
+static int
+gc_mark_stacked_objects_incremental(rb_objspace_t *objspace, size_t count)
+{
+    return gc_mark_stacked_objects(objspace, TRUE, count);
+}
+
+static int
+gc_mark_stacked_objects_all(rb_objspace_t *objspace)
+{
+    return gc_mark_stacked_objects(objspace, FALSE, 0);
+}
+
+#if RGENGC_CHECK_MODE >= 4
+
+#define MAKE_ROOTSIG(obj) (((VALUE)(obj) << 1) | 0x01)
+#define IS_ROOTSIG(obj)   ((VALUE)(obj) & 0x01)
+#define GET_ROOTSIG(obj)  ((const char *)((VALUE)(obj) >> 1))
+
+struct reflist {
+    VALUE *list;
+    int pos;
+    int size;
+};
+
+static struct reflist *
+reflist_create(VALUE obj)
+{
+    struct reflist *refs = xmalloc(sizeof(struct reflist));
+    refs->size = 1;
+    refs->list = ALLOC_N(VALUE, refs->size);
+    refs->list[0] = obj;
+    refs->pos = 1;
+    return refs;
+}
+
+static void
+reflist_destruct(struct reflist *refs)
+{
+    xfree(refs->list);
+    xfree(refs);
+}
+
+static void
+reflist_add(struct reflist *refs, VALUE obj)
+{
+    if (refs->pos == refs->size) {
+        refs->size *= 2;
+        SIZED_REALLOC_N(refs->list, VALUE, refs->size, refs->size/2);
+    }
+
+    refs->list[refs->pos++] = obj;
+}
+
+static void
+reflist_dump(struct reflist *refs)
+{
+    int i;
+    for (i=0; i<refs->pos; i++) {
+        VALUE obj = refs->list[i];
+        if (IS_ROOTSIG(obj)) { /* root */
+            fprintf(stderr, "<root@%s>", GET_ROOTSIG(obj));
+        }
+        else {
+            fprintf(stderr, "<%s>", rb_obj_info(obj));
+        }
+        if (i+1 < refs->pos) fprintf(stderr, ", ");
+    }
+}
+
+static int
+reflist_referred_from_machine_context(struct reflist *refs)
+{
+    int i;
+    for (i=0; i<refs->pos; i++) {
+        VALUE obj = refs->list[i];
+        if (IS_ROOTSIG(obj) && strcmp(GET_ROOTSIG(obj), "machine_context") == 0) return 1;
+    }
+    return 0;
+}
+
+struct allrefs {
+    rb_objspace_t *objspace;
+    /* a -> obj1
+     * b -> obj1
+     * c -> obj1
+     * c -> obj2
+     * d -> obj3
+     * #=> {obj1 => [a, b, c], obj2 => [c, d]}
+     */
+    struct st_table *references;
+    const char *category;
+    VALUE root_obj;
+    mark_stack_t mark_stack;
+};
+
+static int
+allrefs_add(struct allrefs *data, VALUE obj)
+{
+    struct reflist *refs;
+    st_data_t r;
+
+    if (st_lookup(data->references, obj, &r)) {
+        refs = (struct reflist *)r;
+        reflist_add(refs, data->root_obj);
+        return 0;
+    }
+    else {
+        refs = reflist_create(data->root_obj);
+        st_insert(data->references, obj, (st_data_t)refs);
+        return 1;
+    }
+}
+
+static void
+allrefs_i(VALUE obj, void *ptr)
+{
+    struct allrefs *data = (struct allrefs *)ptr;
+
+    if (allrefs_add(data, obj)) {
+        push_mark_stack(&data->mark_stack, obj);
+    }
+}
+
+static void
+allrefs_roots_i(VALUE obj, void *ptr)
+{
+    struct allrefs *data = (struct allrefs *)ptr;
+    if (strlen(data->category) == 0) rb_bug("!!!");
+    data->root_obj = MAKE_ROOTSIG(data->category);
+
+    if (allrefs_add(data, obj)) {
+        push_mark_stack(&data->mark_stack, obj);
+    }
+}
+#define PUSH_MARK_FUNC_DATA(v) do { \
+    struct gc_mark_func_data_struct *prev_mark_func_data = GET_VM()->gc.mark_func_data; \
+    GET_VM()->gc.mark_func_data = (v);
+
+#define POP_MARK_FUNC_DATA() GET_VM()->gc.mark_func_data = prev_mark_func_data;} while (0)
+
+static st_table *
+objspace_allrefs(rb_objspace_t *objspace)
+{
+    struct allrefs data;
+    struct gc_mark_func_data_struct mfd;
+    VALUE obj;
+    int prev_dont_gc = dont_gc_val();
+    dont_gc_on();
+
+    data.objspace = objspace;
+    data.references = st_init_numtable();
+    init_mark_stack(&data.mark_stack);
+
+    mfd.mark_func = allrefs_roots_i;
+    mfd.data = &data;
+
+    /* traverse root objects */
+    PUSH_MARK_FUNC_DATA(&mfd);
+    GET_VM()->gc.mark_func_data = &mfd;
+    mark_roots(objspace, &data.category);
+    POP_MARK_FUNC_DATA();
+
+    /* traverse rest objects reachable from root objects */
+    while (pop_mark_stack(&data.mark_stack, &obj)) {
+        rb_objspace_reachable_objects_from(data.root_obj = obj, allrefs_i, &data);
+    }
+    free_stack_chunks(&data.mark_stack);
+
+    dont_gc_set(prev_dont_gc);
+    return data.references;
+}
+
+static int
+objspace_allrefs_destruct_i(st_data_t key, st_data_t value, st_data_t ptr)
+{
+    struct reflist *refs = (struct reflist *)value;
+    reflist_destruct(refs);
+    return ST_CONTINUE;
+}
+
+static void
+objspace_allrefs_destruct(struct st_table *refs)
+{
+    st_foreach(refs, objspace_allrefs_destruct_i, 0);
+    st_free_table(refs);
+}
+
+#if RGENGC_CHECK_MODE >= 5
+static int
+allrefs_dump_i(st_data_t k, st_data_t v, st_data_t ptr)
+{
+    VALUE obj = (VALUE)k;
+    struct reflist *refs = (struct reflist *)v;
+    fprintf(stderr, "[allrefs_dump_i] %s <- ", rb_obj_info(obj));
+    reflist_dump(refs);
+    fprintf(stderr, "\n");
+    return ST_CONTINUE;
+}
+
+static void
+allrefs_dump(rb_objspace_t *objspace)
+{
+    VALUE size = objspace->rgengc.allrefs_table->num_entries;
+    fprintf(stderr, "[all refs] (size: %"PRIuVALUE")\n", size);
+    st_foreach(objspace->rgengc.allrefs_table, allrefs_dump_i, 0);
+}
+#endif
+
+static int
+gc_check_after_marks_i(st_data_t k, st_data_t v, st_data_t ptr)
+{
+    VALUE obj = k;
+    struct reflist *refs = (struct reflist *)v;
+    rb_objspace_t *objspace = (rb_objspace_t *)ptr;
+
+    /* object should be marked or oldgen */
+    if (!RVALUE_MARKED(objspace, obj)) {
+        fprintf(stderr, "gc_check_after_marks_i: %s is not marked and not oldgen.\n", rb_obj_info(obj));
+        fprintf(stderr, "gc_check_after_marks_i: %p is referred from ", (void *)obj);
+        reflist_dump(refs);
+
+        if (reflist_referred_from_machine_context(refs)) {
+            fprintf(stderr, " (marked from machine stack).\n");
+            /* marked from machine context can be false positive */
+        }
+        else {
+            objspace->rgengc.error_count++;
+            fprintf(stderr, "\n");
+        }
+    }
+    return ST_CONTINUE;
+}
+
+static void
+gc_marks_check(rb_objspace_t *objspace, st_foreach_callback_func *checker_func, const char *checker_name)
+{
+    MALLOC_COUNTERS_LOCK(objspace);
+    struct gc_malloc_bytes saved_malloc = {
+        .malloc            = gc_counter_load_relaxed(&objspace->malloc_counters.counters.malloc),
+        .free              = gc_counter_load_relaxed(&objspace->malloc_counters.counters.free),
+        .malloc_at_last_gc = gc_counter_load_relaxed(&objspace->malloc_counters.counters.malloc_at_last_gc),
+        .free_at_last_gc   = gc_counter_load_relaxed(&objspace->malloc_counters.counters.free_at_last_gc),
+    };
+#if RGENGC_ESTIMATE_OLDMALLOC
+    struct gc_malloc_bytes saved_oldmalloc = {
+        .malloc            = gc_counter_load_relaxed(&objspace->malloc_counters.oldcounters.malloc),
+        .free              = gc_counter_load_relaxed(&objspace->malloc_counters.oldcounters.free),
+        .malloc_at_last_gc = gc_counter_load_relaxed(&objspace->malloc_counters.oldcounters.malloc_at_last_gc),
+        .free_at_last_gc   = gc_counter_load_relaxed(&objspace->malloc_counters.oldcounters.free_at_last_gc),
+    };
+#endif
+    MALLOC_COUNTERS_UNLOCK(objspace);
+    VALUE already_disabled = rb_objspace_gc_disable(objspace);
+
+    objspace->rgengc.allrefs_table = objspace_allrefs(objspace);
+
+    if (checker_func) {
+        st_foreach(objspace->rgengc.allrefs_table, checker_func, (st_data_t)objspace);
+    }
+
+    if (objspace->rgengc.error_count > 0) {
+#if RGENGC_CHECK_MODE >= 5
+        allrefs_dump(objspace);
+#endif
+        if (checker_name) rb_bug("%s: GC has problem.", checker_name);
+    }
+
+    objspace_allrefs_destruct(objspace->rgengc.allrefs_table);
+    objspace->rgengc.allrefs_table = 0;
+
+    if (already_disabled == Qfalse) rb_objspace_gc_enable(objspace);
+    MALLOC_COUNTERS_LOCK(objspace);
+    gc_counter_store_release(&objspace->malloc_counters.counters.malloc,            saved_malloc.malloc);
+    gc_counter_store_release(&objspace->malloc_counters.counters.free,              saved_malloc.free);
+    gc_counter_store_release(&objspace->malloc_counters.counters.malloc_at_last_gc, saved_malloc.malloc_at_last_gc);
+    gc_counter_store_release(&objspace->malloc_counters.counters.free_at_last_gc,   saved_malloc.free_at_last_gc);
+#if RGENGC_ESTIMATE_OLDMALLOC
+    gc_counter_store_release(&objspace->malloc_counters.oldcounters.malloc,            saved_oldmalloc.malloc);
+    gc_counter_store_release(&objspace->malloc_counters.oldcounters.free,              saved_oldmalloc.free);
+    gc_counter_store_release(&objspace->malloc_counters.oldcounters.malloc_at_last_gc, saved_oldmalloc.malloc_at_last_gc);
+    gc_counter_store_release(&objspace->malloc_counters.oldcounters.free_at_last_gc,   saved_oldmalloc.free_at_last_gc);
+#endif
+    MALLOC_COUNTERS_UNLOCK(objspace);
+}
+#endif /* RGENGC_CHECK_MODE >= 4 */
+
+struct verify_internal_consistency_struct {
+    rb_objspace_t *objspace;
+    int err_count;
+    size_t live_object_count;
+    size_t zombie_object_count;
+
+    VALUE parent;
+    size_t old_object_count;
+    size_t remembered_shady_count;
+};
+
+static void
+check_generation_i(const VALUE child, void *ptr)
+{
+    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
+    const VALUE parent = data->parent;
+
+    if (RGENGC_CHECK_MODE) GC_ASSERT(RVALUE_OLD_P(data->objspace, parent));
+
+    if (!RVALUE_OLD_P(data->objspace, child)) {
+        if (!RVALUE_REMEMBERED(data->objspace, parent) &&
+            !RVALUE_REMEMBERED(data->objspace, child) &&
+            !RVALUE_UNCOLLECTIBLE(data->objspace, child)) {
+            fprintf(stderr, "verify_internal_consistency_reachable_i: WB miss (O->Y) %s -> %s\n", rb_obj_info(parent), rb_obj_info(child));
+            data->err_count++;
+        }
+    }
+}
+
+static void
+check_color_i(const VALUE child, void *ptr)
+{
+    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
+    const VALUE parent = data->parent;
+
+    if (!RVALUE_WB_UNPROTECTED(data->objspace, parent) && RVALUE_WHITE_P(data->objspace, child)) {
+        fprintf(stderr, "verify_internal_consistency_reachable_i: WB miss (B->W) - %s -> %s\n",
+                rb_obj_info(parent), rb_obj_info(child));
+        data->err_count++;
+    }
+}
+
+static void
+check_children_i(const VALUE child, void *ptr)
+{
+    struct verify_internal_consistency_struct *data = (struct verify_internal_consistency_struct *)ptr;
+    if (check_rvalue_consistency_force(data->objspace, child, FALSE) != 0) {
+        fprintf(stderr, "check_children_i: %s has error (referenced from %s)",
+                rb_obj_info(child), rb_obj_info(data->parent));
+
+        data->err_count++;
+    }
+}
+
+static int
+verify_internal_consistency_i(void *page_start, void *page_end, size_t stride,
+                              struct verify_internal_consistency_struct *data)
+{
+    VALUE obj;
+    rb_objspace_t *objspace = data->objspace;
+
+    for (obj = (VALUE)page_start; obj != (VALUE)page_end; obj += stride) {
+        asan_unpoisoning_object(obj) {
+            if (!rb_gc_impl_garbage_object_p(objspace, obj)) {
+                /* count objects */
+                data->live_object_count++;
+                data->parent = obj;
+
+                /* Normally, we don't expect T_MOVED objects to be in the heap.
+                * But they can stay alive on the stack, */
+                if (!gc_object_moved_p(objspace, obj)) {
+                    /* moved slots don't have children */
+                    rb_objspace_reachable_objects_from(obj, check_children_i, (void *)data);
+                }
+
+                /* check health of children */
+                if (RVALUE_OLD_P(objspace, obj)) data->old_object_count++;
+                if (RVALUE_WB_UNPROTECTED(objspace, obj) && RVALUE_UNCOLLECTIBLE(objspace, obj)) data->remembered_shady_count++;
+
+                if (!is_marking(objspace) && RVALUE_OLD_P(objspace, obj)) {
+                    /* reachable objects from an oldgen object should be old or (young with remember) */
+                    data->parent = obj;
+                    rb_objspace_reachable_objects_from(obj, check_generation_i, (void *)data);
+                }
+
+                if (!is_marking(objspace) && rb_gc_obj_shareable_p(obj)) {
+                    rb_gc_verify_shareable(obj);
+                }
+
+                if (is_incremental_marking(objspace)) {
+                    if (RVALUE_BLACK_P(objspace, obj)) {
+                        /* reachable objects from black objects should be black or grey objects */
+                        data->parent = obj;
+                        rb_objspace_reachable_objects_from(obj, check_color_i, (void *)data);
+                    }
+                }
+            }
+            else {
+                if (BUILTIN_TYPE(obj) == T_ZOMBIE) {
+                    data->zombie_object_count++;
+
+                    if ((RBASIC(obj)->flags & ~ZOMBIE_OBJ_KEPT_FLAGS) != T_ZOMBIE) {
+                        fprintf(stderr, "verify_internal_consistency_i: T_ZOMBIE has extra flags set: %s\n",
+                                rb_obj_info(obj));
+                        data->err_count++;
+                    }
+
+                    if (!!FL_TEST(obj, FL_FINALIZE) != !!st_is_member(finalizer_table, obj)) {
+                        fprintf(stderr, "verify_internal_consistency_i: FL_FINALIZE %s but %s finalizer_table: %s\n",
+                                FL_TEST(obj, FL_FINALIZE) ? "set" : "not set", st_is_member(finalizer_table, obj) ? "in" : "not in",
+                                rb_obj_info(obj));
+                        data->err_count++;
+                    }
+                }
+            }
+        }
+    }
+
+    return 0;
+}
+
+static int
+gc_verify_heap_page(rb_objspace_t *objspace, struct heap_page *page, VALUE obj)
+{
+    unsigned int has_remembered_shady = FALSE;
+    unsigned int has_remembered_old = FALSE;
+    int remembered_old_objects = 0;
+    int free_objects = 0;
+    int zombie_objects = 0;
+
+    short slot_size = page->slot_size;
+    uintptr_t start = (uintptr_t)page->start;
+    uintptr_t end = start + page->total_slots * slot_size;
+
+    for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
+        VALUE val = (VALUE)ptr;
+        asan_unpoisoning_object(val) {
+            enum ruby_value_type type = BUILTIN_TYPE(val);
+
+            if (type == T_NONE) free_objects++;
+            if (type == T_ZOMBIE) zombie_objects++;
+            if (RVALUE_PAGE_UNCOLLECTIBLE(page, val) && RVALUE_PAGE_WB_UNPROTECTED(page, val)) {
+                has_remembered_shady = TRUE;
+            }
+            if (RVALUE_PAGE_MARKING(page, val)) {
+                has_remembered_old = TRUE;
+                remembered_old_objects++;
+            }
+        }
+    }
+
+    if (!is_incremental_marking(objspace) &&
+        page->flags.has_remembered_objects == FALSE && has_remembered_old == TRUE) {
+
+        for (uintptr_t ptr = start; ptr < end; ptr += slot_size) {
+            VALUE val = (VALUE)ptr;
+            if (RVALUE_PAGE_MARKING(page, val)) {
+                fprintf(stderr, "marking -> %s\n", rb_obj_info(val));
+            }
+        }
+        rb_bug("page %p's has_remembered_objects should be false, but there are remembered old objects (%d). %s",
+               (void *)page, remembered_old_objects, obj ? rb_obj_info(obj) : "");
+    }
+
+    if (page->flags.has_uncollectible_wb_unprotected_objects == FALSE && has_remembered_shady == TRUE) {
+        rb_bug("page %p's has_remembered_shady should be false, but there are remembered shady objects. %s",
+               (void *)page, obj ? rb_obj_info(obj) : "");
+    }
+
+    if (0) {
+        /* free_slots may not equal to free_objects */
+        if (page->free_slots != free_objects) {
+            rb_bug("page %p's free_slots should be %d, but %d", (void *)page, page->free_slots, free_objects);
+        }
+    }
+    if (page->final_slots != zombie_objects) {
+        rb_bug("page %p's final_slots should be %d, but %d", (void *)page, page->final_slots, zombie_objects);
+    }
+
+    return remembered_old_objects;
+}
+
+static int
+gc_verify_heap_pages_(rb_objspace_t *objspace, struct ccan_list_head *head)
+{
+    int remembered_old_objects = 0;
+    struct heap_page *page = 0;
+
+    ccan_list_for_each(head, page, page_node) {
+        asan_unlock_freelist(page);
+        struct free_slot *p = page->freelist;
+        while (p) {
+            VALUE vp = (VALUE)p;
+            VALUE prev = vp;
+            rb_asan_unpoison_object(vp, false);
+            if (BUILTIN_TYPE(vp) != T_NONE) {
+                fprintf(stderr, "freelist slot expected to be T_NONE but was: %s\n", rb_obj_info(vp));
+            }
+            p = p->next;
+            rb_asan_poison_object(prev);
+        }
+        asan_lock_freelist(page);
+
+        if (page->flags.has_remembered_objects == FALSE) {
+            remembered_old_objects += gc_verify_heap_page(objspace, page, Qfalse);
+        }
+    }
+
+    return remembered_old_objects;
+}
+
+static int
+gc_verify_heap_pages(rb_objspace_t *objspace)
+{
+    int remembered_old_objects = 0;
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        remembered_old_objects += gc_verify_heap_pages_(objspace, &((&heaps[i])->pages));
+    }
+    return remembered_old_objects;
+}
+
+static void
+gc_verify_internal_consistency_(rb_objspace_t *objspace)
+{
+    struct verify_internal_consistency_struct data = {0};
+
+    data.objspace = objspace;
+    gc_report(5, objspace, "gc_verify_internal_consistency: start\n");
+
+    /* check relations */
+    for (size_t i = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+        struct heap_page *page = rb_darray_get(objspace->heap_pages.sorted, i);
+        short slot_size = page->slot_size;
+
+        uintptr_t start = (uintptr_t)page->start;
+        uintptr_t end = start + page->total_slots * slot_size;
+
+        verify_internal_consistency_i((void *)start, (void *)end, slot_size, &data);
+    }
+
+    if (data.err_count != 0) {
+#if RGENGC_CHECK_MODE >= 5
+        objspace->rgengc.error_count = data.err_count;
+        gc_marks_check(objspace, NULL, NULL);
+        allrefs_dump(objspace);
+#endif
+        rb_bug("gc_verify_internal_consistency: found internal inconsistency.");
+    }
+
+    /* check heap_page status */
+    gc_verify_heap_pages(objspace);
+
+    /* check counters */
+
+    ractor_cache_flush_count(objspace, rb_gc_get_ractor_newobj_cache());
+
+    if (!is_lazy_sweeping(objspace) &&
+            !finalizing &&
+            !rb_gc_multi_ractor_p()) {
+        if (objspace_live_slots(objspace) != data.live_object_count) {
+            fprintf(stderr, "heap_pages_final_slots: %"PRIdSIZE", total_freed_objects: %"PRIdSIZE"\n",
+                    total_final_slots_count(objspace), total_freed_objects(objspace));
+            rb_bug("inconsistent live slot number: expect %"PRIuSIZE", but %"PRIuSIZE".",
+                   objspace_live_slots(objspace), data.live_object_count);
+        }
+    }
+
+    if (!is_marking(objspace)) {
+        if (objspace->rgengc.old_objects != data.old_object_count) {
+            rb_bug("inconsistent old slot number: expect %"PRIuSIZE", but %"PRIuSIZE".",
+                   objspace->rgengc.old_objects, data.old_object_count);
+        }
+        if (objspace->rgengc.uncollectible_wb_unprotected_objects != data.remembered_shady_count) {
+            rb_bug("inconsistent number of wb unprotected objects: expect %"PRIuSIZE", but %"PRIuSIZE".",
+                   objspace->rgengc.uncollectible_wb_unprotected_objects, data.remembered_shady_count);
+        }
+    }
+
+    if (!finalizing) {
+        size_t list_count = 0;
+
+        {
+            VALUE z = heap_pages_deferred_final;
+            while (z) {
+                list_count++;
+                z = RZOMBIE(z)->next;
+            }
+        }
+
+        if (total_final_slots_count(objspace) != data.zombie_object_count ||
+            total_final_slots_count(objspace) != list_count) {
+
+            rb_bug("inconsistent finalizing object count:\n"
+                    "  expect %"PRIuSIZE"\n"
+                    "  but    %"PRIuSIZE" zombies\n"
+                    "  heap_pages_deferred_final list has %"PRIuSIZE" items.",
+                    total_final_slots_count(objspace),
+                    data.zombie_object_count,
+                    list_count);
+        }
+    }
+
+    gc_report(5, objspace, "gc_verify_internal_consistency: OK\n");
+}
+
+static void
+gc_verify_internal_consistency(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    unsigned int lev = RB_GC_VM_LOCK();
+    {
+        rb_gc_vm_barrier(); // stop other ractors
+
+        unsigned int prev_during_gc = during_gc;
+        during_gc = FALSE; // stop gc here
+        {
+            gc_verify_internal_consistency_(objspace);
+        }
+        during_gc = prev_during_gc;
+    }
+    RB_GC_VM_UNLOCK(lev);
+}
+
+static void
+heap_move_pooled_pages_to_free_pages(rb_heap_t *heap)
+{
+    if (heap->pooled_pages) {
+        if (heap->free_pages) {
+            struct heap_page *free_pages_tail = heap->free_pages;
+            while (free_pages_tail->free_next) {
+                free_pages_tail = free_pages_tail->free_next;
+            }
+            free_pages_tail->free_next = heap->pooled_pages;
+        }
+        else {
+            heap->free_pages = heap->pooled_pages;
+        }
+
+        heap->pooled_pages = NULL;
+    }
+}
+
+static int
+gc_remember_unprotected(rb_objspace_t *objspace, VALUE obj)
+{
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+    bits_t *uncollectible_bits = &page->uncollectible_bits[0];
+
+    if (!MARKED_IN_BITMAP(uncollectible_bits, obj)) {
+        page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
+        MARK_IN_BITMAP(uncollectible_bits, obj);
+        objspace->rgengc.uncollectible_wb_unprotected_objects++;
+
+#if RGENGC_PROFILE > 0
+        objspace->profile.total_remembered_shady_object_count++;
+#if RGENGC_PROFILE >= 2
+        objspace->profile.remembered_shady_object_count_types[BUILTIN_TYPE(obj)]++;
+#endif
+#endif
+        return TRUE;
+    }
+    else {
+        return FALSE;
+    }
+}
+
+static inline void
+gc_marks_wb_unprotected_objects_plane(rb_objspace_t *objspace, uintptr_t p, bits_t bits, short slot_size)
+{
+    if (bits) {
+        do {
+            if (bits & 1) {
+                gc_report(2, objspace, "gc_marks_wb_unprotected_objects: marked shady: %s\n", rb_obj_info((VALUE)p));
+                GC_ASSERT(RVALUE_WB_UNPROTECTED(objspace, (VALUE)p));
+                GC_ASSERT(RVALUE_MARKED(objspace, (VALUE)p));
+                gc_mark_children(objspace, (VALUE)p);
+            }
+            p += slot_size;
+            bits >>= 1;
+        } while (bits);
+    }
+}
+
+static void
+gc_marks_wb_unprotected_objects(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    struct heap_page *page = 0;
+
+    ccan_list_for_each(&heap->pages, page, page_node) {
+        bits_t *mark_bits = page->mark_bits;
+        bits_t *wbun_bits = page->wb_unprotected_bits;
+        uintptr_t p = page->start;
+        short slot_size = page->slot_size;
+        int total_slots = page->total_slots;
+        int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+        size_t j;
+
+        for (j=0; j<(size_t)bitmap_plane_count; j++) {
+            bits_t bits = mark_bits[j] & wbun_bits[j];
+            gc_marks_wb_unprotected_objects_plane(objspace, p, bits, slot_size);
+            p += BITS_BITLENGTH * slot_size;
+        }
+    }
+
+    gc_mark_stacked_objects_all(objspace);
+}
+
+void
+rb_gc_impl_declare_weak_references(void *objspace_ptr, VALUE obj)
+{
+    FL_SET_RAW(obj, RUBY_FL_WEAK_REFERENCE);
+}
+
+bool
+rb_gc_impl_handle_weak_references_alive_p(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    bool marked = RVALUE_MARKED(objspace, obj);
+
+    if (marked) {
+        rgengc_check_relation(objspace, obj);
+    }
+
+    return marked;
+}
+
+static void
+gc_update_weak_references(rb_objspace_t *objspace)
+{
+    VALUE *obj_ptr;
+    rb_darray_foreach(objspace->weak_references, i, obj_ptr) {
+        gc_mark_set_parent(objspace, *obj_ptr);
+        rb_gc_handle_weak_references(*obj_ptr);
+        gc_mark_set_parent_invalid(objspace);
+    }
+
+    size_t capa = rb_darray_capa(objspace->weak_references);
+    size_t size = rb_darray_size(objspace->weak_references);
+
+    objspace->profile.weak_references_count = size;
+
+    rb_darray_clear(objspace->weak_references);
+
+    /* If the darray has capacity for more than four times the amount used, we
+     * shrink it down to half of that capacity. */
+    if (capa > size * 4) {
+        rb_darray_resize_capa_without_gc(&objspace->weak_references, size * 2);
+    }
+}
+
+static void
+gc_marks_finish(rb_objspace_t *objspace)
+{
+    /* finish incremental GC */
+    if (is_incremental_marking(objspace)) {
+        if (RGENGC_CHECK_MODE && is_mark_stack_empty(&objspace->mark_stack) == 0) {
+            rb_bug("gc_marks_finish: mark stack is not empty (%"PRIdSIZE").",
+                   mark_stack_size(&objspace->mark_stack));
+        }
+
+        mark_roots(objspace, NULL);
+        while (gc_mark_stacked_objects_incremental(objspace, INT_MAX) == false);
+
+#if RGENGC_CHECK_MODE >= 2
+        if (gc_verify_heap_pages(objspace) != 0) {
+            rb_bug("gc_marks_finish (incremental): there are remembered old objects.");
+        }
+#endif
+
+        objspace->flags.during_incremental_marking = FALSE;
+        /* check children of all marked wb-unprotected objects */
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            gc_marks_wb_unprotected_objects(objspace, &heaps[i]);
+        }
+    }
+
+    gc_update_weak_references(objspace);
+
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+
+#if RGENGC_CHECK_MODE >= 4
+    during_gc = FALSE;
+    gc_marks_check(objspace, gc_check_after_marks_i, "after_marks");
+    during_gc = TRUE;
+#endif
+
+    {
+        const unsigned long r_mul = objspace->live_ractor_cache_count > 8 ? 8 : objspace->live_ractor_cache_count; // upto 8
+
+        size_t total_slots = objspace_available_slots(objspace);
+        size_t sweep_slots = total_slots - objspace->marked_slots; /* will be swept slots */
+        size_t max_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_max_ratio);
+        size_t min_free_slots = (size_t)(total_slots * gc_params.heap_free_slots_min_ratio);
+        if (min_free_slots < gc_params.heap_free_slots * r_mul) {
+            min_free_slots = gc_params.heap_free_slots * r_mul;
+        }
+
+        int full_marking = is_full_marking(objspace);
+
+        GC_ASSERT(objspace_available_slots(objspace) >= objspace->marked_slots);
+
+        /* Setup freeable slots. */
+        size_t total_init_slots = 0;
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            total_init_slots += (gc_params.heap_init_bytes / heaps[i].slot_size) * r_mul;
+        }
+
+        if (max_free_slots < total_init_slots) {
+            max_free_slots = total_init_slots;
+        }
+
+        /* Approximate freeable pages using the average slots-per-pages across all heaps */
+        if (sweep_slots > max_free_slots) {
+            size_t excess_slots = sweep_slots - max_free_slots;
+            size_t total_heap_pages = heap_eden_total_pages(objspace);
+            heap_pages_freeable_pages = total_heap_pages > 0
+                ? excess_slots * total_heap_pages / total_slots
+                : 0;
+        }
+        else {
+            heap_pages_freeable_pages = 0;
+        }
+
+        if (objspace->heap_pages.allocatable_bytes == 0 && sweep_slots < min_free_slots) {
+            if (!full_marking && sweep_slots < min_free_slots * 7 / 8) {
+                if (objspace->profile.count - objspace->rgengc.last_major_gc < RVALUE_OLD_AGE) {
+                    full_marking = TRUE;
+                }
+                else {
+                    gc_report(1, objspace, "gc_marks_finish: next is full GC!!)\n");
+                    gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_NOFREE;
+                }
+            }
+
+            if (full_marking) {
+                heap_allocatable_bytes_expand(objspace, NULL, sweep_slots, total_slots, heaps[0].slot_size);
+            }
+        }
+
+        if (full_marking) {
+            /* See the comment about RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR */
+            const double r = gc_params.oldobject_limit_factor;
+            objspace->rgengc.uncollectible_wb_unprotected_objects_limit = MAX(
+                (size_t)(objspace->rgengc.uncollectible_wb_unprotected_objects * r),
+                (size_t)(objspace->rgengc.old_objects * gc_params.uncollectible_wb_unprotected_objects_limit_ratio)
+            );
+            objspace->rgengc.old_objects_limit = (size_t)(objspace->rgengc.old_objects * r);
+        }
+
+        if (objspace->rgengc.uncollectible_wb_unprotected_objects > objspace->rgengc.uncollectible_wb_unprotected_objects_limit) {
+            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_SHADY;
+        }
+        if (objspace->rgengc.old_objects > objspace->rgengc.old_objects_limit) {
+            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDGEN;
+        }
+
+        gc_report(1, objspace, "gc_marks_finish (marks %"PRIdSIZE" objects, "
+                  "old %"PRIdSIZE" objects, total %"PRIdSIZE" slots, "
+                   "sweep %"PRIdSIZE" slots, allocatable %"PRIdSIZE" bytes, next GC: %s)\n",
+                  objspace->marked_slots, objspace->rgengc.old_objects, objspace_available_slots(objspace), sweep_slots, objspace->heap_pages.allocatable_bytes,
+                  gc_needs_major_flags ? "major" : "minor");
+    }
+
+    // TODO: refactor so we don't need to call this
+    rb_ractor_finish_marking();
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_END_MARK);
+}
+
+static bool
+gc_compact_heap_cursors_met_p(rb_heap_t *heap)
+{
+    return heap->sweeping_page == heap->compact_cursor;
+}
+
+
+static rb_heap_t *
+gc_compact_destination_pool(rb_objspace_t *objspace, rb_heap_t *src_pool, VALUE obj)
+{
+    size_t obj_size = rb_gc_obj_optimal_size(obj);
+    if (obj_size == 0) {
+        return src_pool;
+    }
+
+    GC_ASSERT(rb_gc_impl_size_allocatable_p(obj_size));
+
+    size_t idx = heap_idx_for_size(obj_size);
+
+    return &heaps[idx];
+}
+
+static bool
+gc_compact_move(rb_objspace_t *objspace, rb_heap_t *heap, VALUE src)
+{
+    GC_ASSERT(BUILTIN_TYPE(src) != T_MOVED);
+    GC_ASSERT(gc_is_moveable_obj(objspace, src));
+
+    rb_heap_t *dest_pool = gc_compact_destination_pool(objspace, heap, src);
+    if (gc_compact_heap_cursors_met_p(dest_pool)) {
+        return dest_pool != heap;
+    }
+
+    while (!try_move(objspace, dest_pool, dest_pool->free_pages, src)) {
+        struct gc_sweep_context ctx = {
+            .page = dest_pool->sweeping_page,
+            .final_slots = 0,
+            .freed_slots = 0,
+            .empty_slots = 0,
+        };
+
+        /* The page of src could be partially compacted, so it may contain
+         * T_MOVED. Sweeping a page may read objects on this page, so we
+         * need to lock the page. */
+        lock_page_body(objspace, GET_PAGE_BODY(src));
+        gc_sweep_page(objspace, dest_pool, &ctx);
+        unlock_page_body(objspace, GET_PAGE_BODY(src));
+
+        if (dest_pool->sweeping_page->free_slots > 0) {
+            heap_add_freepage(dest_pool, dest_pool->sweeping_page);
+        }
+
+        dest_pool->sweeping_page = ccan_list_next(&dest_pool->pages, dest_pool->sweeping_page, page_node);
+        if (gc_compact_heap_cursors_met_p(dest_pool)) {
+            return dest_pool != heap;
+        }
+    }
+
+    return true;
+}
+
+static bool
+gc_compact_plane(rb_objspace_t *objspace, rb_heap_t *heap, uintptr_t p, bits_t bitset, struct heap_page *page)
+{
+    short slot_size = page->slot_size;
+
+    do {
+        VALUE vp = (VALUE)p;
+        GC_ASSERT(vp % sizeof(VALUE) == 0);
+
+        if (bitset & 1) {
+            objspace->rcompactor.considered_count_table[BUILTIN_TYPE(vp)]++;
+
+            if (gc_is_moveable_obj(objspace, vp)) {
+                if (!gc_compact_move(objspace, heap, vp)) {
+                    //the cursors met. bubble up
+                    return false;
+                }
+            }
+        }
+        p += slot_size;
+        bitset >>= 1;
+    } while (bitset);
+
+    return true;
+}
+
+// Iterate up all the objects in page, moving them to where they want to go
+static bool
+gc_compact_page(rb_objspace_t *objspace, rb_heap_t *heap, struct heap_page *page)
+{
+    GC_ASSERT(page == heap->compact_cursor);
+
+    bits_t *mark_bits, *pin_bits;
+    bits_t bitset;
+    uintptr_t p = page->start;
+    short slot_size = page->slot_size;
+    int total_slots = page->total_slots;
+    int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+
+    mark_bits = page->mark_bits;
+    pin_bits = page->pinned_bits;
+
+    for (int j = 0; j < bitmap_plane_count; j++) {
+        // objects that can be moved are marked and not pinned
+        bitset = (mark_bits[j] & ~pin_bits[j]);
+        if (bitset) {
+            if (!gc_compact_plane(objspace, heap, (uintptr_t)p, bitset, page))
+                return false;
+        }
+        p += BITS_BITLENGTH * slot_size;
+    }
+
+    return true;
+}
+
+static bool
+gc_compact_all_compacted_p(rb_objspace_t *objspace)
+{
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+
+        if (heap->total_pages > 0 &&
+                !gc_compact_heap_cursors_met_p(heap)) {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+static void
+gc_sweep_compact(rb_objspace_t *objspace)
+{
+    gc_compact_start(objspace);
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+
+    while (!gc_compact_all_compacted_p(objspace)) {
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+
+            if (gc_compact_heap_cursors_met_p(heap)) {
+                continue;
+            }
+
+            struct heap_page *start_page = heap->compact_cursor;
+
+            if (!gc_compact_page(objspace, heap, start_page)) {
+                lock_page_body(objspace, start_page->body);
+
+                continue;
+            }
+
+            // If we get here, we've finished moving all objects on the compact_cursor page
+            // So we can lock it and move the cursor on to the next one.
+            lock_page_body(objspace, start_page->body);
+            heap->compact_cursor = ccan_list_prev(&heap->pages, heap->compact_cursor, page_node);
+        }
+    }
+
+    gc_compact_finish(objspace);
+
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+}
+
+static void
+gc_marks_rest(rb_objspace_t *objspace)
+{
+    gc_report(1, objspace, "gc_marks_rest\n");
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        (&heaps[i])->pooled_pages = NULL;
+    }
+
+    if (is_incremental_marking(objspace)) {
+        while (gc_mark_stacked_objects_incremental(objspace, INT_MAX) == FALSE);
+    }
+    else {
+        gc_mark_stacked_objects_all(objspace);
+    }
+
+    gc_marks_finish(objspace);
+}
+
+static bool
+gc_marks_step(rb_objspace_t *objspace, size_t slots)
+{
+    bool marking_finished = false;
+
+    GC_ASSERT(is_marking(objspace));
+    if (gc_mark_stacked_objects_incremental(objspace, slots)) {
+        gc_marks_finish(objspace);
+
+        marking_finished = true;
+    }
+
+    return marking_finished;
+}
+
+static bool
+gc_marks_continue(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    GC_ASSERT(dont_gc_val() == FALSE || objspace->profile.latest_gc_info & GPR_FLAG_METHOD);
+    bool marking_finished = true;
+
+    gc_marking_enter(objspace);
+
+    if (heap->free_pages) {
+        gc_report(2, objspace, "gc_marks_continue: has pooled pages");
+
+        marking_finished = gc_marks_step(objspace, objspace->rincgc.step_slots);
+    }
+    else {
+        gc_report(2, objspace, "gc_marks_continue: no more pooled pages (stack depth: %"PRIdSIZE").\n",
+                  mark_stack_size(&objspace->mark_stack));
+        heap->force_incremental_marking_finish_count++;
+        gc_marks_rest(objspace);
+    }
+
+    gc_marking_exit(objspace);
+
+    return marking_finished;
+}
+
+static void
+gc_marks_start(rb_objspace_t *objspace, int full_mark)
+{
+    /* start marking */
+    gc_report(1, objspace, "gc_marks_start: (%s)\n", full_mark ? "full" : "minor");
+    gc_mode_transition(objspace, gc_mode_marking);
+
+    if (full_mark) {
+        size_t incremental_marking_steps = (objspace->rincgc.pooled_slots / INCREMENTAL_MARK_STEP_ALLOCATIONS) + 1;
+        objspace->rincgc.step_slots = (objspace->marked_slots * 2) / incremental_marking_steps;
+
+        if (0) fprintf(stderr, "objspace->marked_slots: %"PRIdSIZE", "
+                       "objspace->rincgc.pooled_page_num: %"PRIdSIZE", "
+                       "objspace->rincgc.step_slots: %"PRIdSIZE", \n",
+                       objspace->marked_slots, objspace->rincgc.pooled_slots, objspace->rincgc.step_slots);
+        objspace->flags.during_minor_gc = FALSE;
+        if (ruby_enable_autocompact) {
+            objspace->flags.during_compacting |= TRUE;
+        }
+        objspace->profile.major_gc_count++;
+        objspace->rgengc.uncollectible_wb_unprotected_objects = 0;
+        objspace->rgengc.old_objects = 0;
+        objspace->rgengc.last_major_gc = objspace->profile.count;
+        objspace->marked_slots = 0;
+
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+            rgengc_mark_and_rememberset_clear(objspace, heap);
+            heap_move_pooled_pages_to_free_pages(heap);
+
+            if (objspace->flags.during_compacting) {
+                struct heap_page *page = NULL;
+
+                ccan_list_for_each(&heap->pages, page, page_node) {
+                    page->pinned_slots = 0;
+                }
+            }
+        }
+    }
+    else {
+        objspace->flags.during_minor_gc = TRUE;
+        objspace->marked_slots =
+          objspace->rgengc.old_objects + objspace->rgengc.uncollectible_wb_unprotected_objects; /* uncollectible objects are marked already */
+        objspace->profile.minor_gc_count++;
+
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rgengc_rememberset_mark(objspace, &heaps[i]);
+        }
+    }
+
+    mark_roots(objspace, NULL);
+
+    gc_report(1, objspace, "gc_marks_start: (%s) end, stack in %"PRIdSIZE"\n",
+              full_mark ? "full" : "minor", mark_stack_size(&objspace->mark_stack));
+}
+
+static bool
+gc_marks(rb_objspace_t *objspace, int full_mark)
+{
+    gc_marking_enter(objspace);
+
+    bool marking_finished = false;
+
+    /* setup marking */
+
+    gc_marks_start(objspace, full_mark);
+    if (!is_incremental_marking(objspace)) {
+        gc_marks_rest(objspace);
+        marking_finished = true;
+    }
+
+#if RGENGC_PROFILE > 0
+    if (gc_prof_record(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->old_objects = objspace->rgengc.old_objects;
+    }
+#endif
+
+    gc_marking_exit(objspace);
+
+    return marking_finished;
+}
+
+/* RGENGC */
+
+static void
+gc_report_body(int level, rb_objspace_t *objspace, const char *fmt, ...)
+{
+    if (level <= RGENGC_DEBUG) {
+        char buf[1024];
+        FILE *out = stderr;
+        va_list args;
+        const char *status = " ";
+
+        if (during_gc) {
+            status = is_full_marking(objspace) ? "+" : "-";
+        }
+        else {
+            if (is_lazy_sweeping(objspace)) {
+                status = "S";
+            }
+            if (is_incremental_marking(objspace)) {
+                status = "M";
+            }
+        }
+
+        va_start(args, fmt);
+        vsnprintf(buf, 1024, fmt, args);
+        va_end(args);
+
+        fprintf(out, "%s|", status);
+        fputs(buf, out);
+    }
+}
+
+/* bit operations */
+
+static int
+rgengc_remembersetbits_set(rb_objspace_t *objspace, VALUE obj)
+{
+    struct heap_page *page = GET_HEAP_PAGE(obj);
+    bits_t *bits = &page->remembered_bits[0];
+
+    if (MARKED_IN_BITMAP(bits, obj)) {
+        return FALSE;
+    }
+    else {
+        page->flags.has_remembered_objects = TRUE;
+        MARK_IN_BITMAP(bits, obj);
+        return TRUE;
+    }
+}
+
+/* wb, etc */
+
+/* return FALSE if already remembered */
+static int
+rgengc_remember(rb_objspace_t *objspace, VALUE obj)
+{
+    gc_report(6, objspace, "rgengc_remember: %s %s\n", rb_obj_info(obj),
+              RVALUE_REMEMBERED(objspace, obj) ? "was already remembered" : "is remembered now");
+
+    check_rvalue_consistency(objspace, obj);
+
+    if (RGENGC_CHECK_MODE) {
+        if (RVALUE_WB_UNPROTECTED(objspace, obj)) rb_bug("rgengc_remember: %s is not wb protected.", rb_obj_info(obj));
+    }
+
+#if RGENGC_PROFILE > 0
+    if (!RVALUE_REMEMBERED(objspace, obj)) {
+        if (RVALUE_WB_UNPROTECTED(objspace, obj) == 0) {
+            objspace->profile.total_remembered_normal_object_count++;
+#if RGENGC_PROFILE >= 2
+            objspace->profile.remembered_normal_object_count_types[BUILTIN_TYPE(obj)]++;
+#endif
+        }
+    }
+#endif /* RGENGC_PROFILE > 0 */
+
+    return rgengc_remembersetbits_set(objspace, obj);
+}
+
+#ifndef PROFILE_REMEMBERSET_MARK
+#define PROFILE_REMEMBERSET_MARK 0
+#endif
+
+static inline void
+rgengc_rememberset_mark_plane(rb_objspace_t *objspace, uintptr_t p, bits_t bitset, short slot_size)
+{
+    if (bitset) {
+        do {
+            if (bitset & 1) {
+                VALUE obj = (VALUE)p;
+                gc_report(2, objspace, "rgengc_rememberset_mark: mark %s\n", rb_obj_info(obj));
+                GC_ASSERT(RVALUE_UNCOLLECTIBLE(objspace, obj));
+                GC_ASSERT(RVALUE_OLD_P(objspace, obj) || RVALUE_WB_UNPROTECTED(objspace, obj));
+
+                gc_mark_children(objspace, obj);
+
+                if (RB_FL_TEST_RAW(obj, RUBY_FL_WEAK_REFERENCE)) {
+                    rb_darray_append_without_gc(&objspace->weak_references, obj);
+                }
+            }
+            p += slot_size;
+            bitset >>= 1;
+        } while (bitset);
+    }
+}
+
+static void
+rgengc_rememberset_mark(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    size_t j;
+    struct heap_page *page = 0;
+#if PROFILE_REMEMBERSET_MARK
+    int has_old = 0, has_shady = 0, has_both = 0, skip = 0;
+#endif
+    gc_report(1, objspace, "rgengc_rememberset_mark: start\n");
+
+    ccan_list_for_each(&heap->pages, page, page_node) {
+        if (page->flags.has_remembered_objects | page->flags.has_uncollectible_wb_unprotected_objects) {
+            uintptr_t p = page->start;
+            short slot_size = page->slot_size;
+            int total_slots = page->total_slots;
+            int bitmap_plane_count = CEILDIV(total_slots, BITS_BITLENGTH);
+            bits_t bitset, bits[HEAP_PAGE_BITMAP_LIMIT];
+            bits_t *remembered_bits = page->remembered_bits;
+            bits_t *uncollectible_bits = page->uncollectible_bits;
+            bits_t *wb_unprotected_bits = page->wb_unprotected_bits;
+#if PROFILE_REMEMBERSET_MARK
+            if (page->flags.has_remembered_objects && page->flags.has_uncollectible_wb_unprotected_objects) has_both++;
+            else if (page->flags.has_remembered_objects) has_old++;
+            else if (page->flags.has_uncollectible_wb_unprotected_objects) has_shady++;
+#endif
+            for (j=0; j < (size_t)bitmap_plane_count; j++) {
+                bits[j] = remembered_bits[j] | (uncollectible_bits[j] & wb_unprotected_bits[j]);
+                remembered_bits[j] = 0;
+            }
+            page->flags.has_remembered_objects = FALSE;
+
+            for (j=0; j < (size_t)bitmap_plane_count; j++) {
+                bitset = bits[j];
+                rgengc_rememberset_mark_plane(objspace, p, bitset, slot_size);
+                p += BITS_BITLENGTH * slot_size;
+            }
+        }
+#if PROFILE_REMEMBERSET_MARK
+        else {
+            skip++;
+        }
+#endif
+    }
+
+#if PROFILE_REMEMBERSET_MARK
+    fprintf(stderr, "%d\t%d\t%d\t%d\n", has_both, has_old, has_shady, skip);
+#endif
+    gc_report(1, objspace, "rgengc_rememberset_mark: finished\n");
+}
+
+static void
+rgengc_mark_and_rememberset_clear(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    struct heap_page *page = 0;
+
+    ccan_list_for_each(&heap->pages, page, page_node) {
+        memset(&page->mark_bits[0],       0, HEAP_PAGE_BITMAP_SIZE);
+        memset(&page->uncollectible_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
+        memset(&page->marking_bits[0],    0, HEAP_PAGE_BITMAP_SIZE);
+        memset(&page->remembered_bits[0], 0, HEAP_PAGE_BITMAP_SIZE);
+        memset(&page->pinned_bits[0],     0, HEAP_PAGE_BITMAP_SIZE);
+        page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
+        page->flags.has_remembered_objects = FALSE;
+    }
+}
+
+/* RGENGC: APIs */
+
+NOINLINE(static void gc_writebarrier_generational(VALUE a, VALUE b, rb_objspace_t *objspace));
+
+static void
+gc_writebarrier_generational(VALUE a, VALUE b, rb_objspace_t *objspace)
+{
+    if (RGENGC_CHECK_MODE) {
+        if (!RVALUE_OLD_P(objspace, a)) rb_bug("gc_writebarrier_generational: %s is not an old object.", rb_obj_info(a));
+        if ( RVALUE_OLD_P(objspace, b)) rb_bug("gc_writebarrier_generational: %s is an old object.", rb_obj_info(b));
+        if (is_incremental_marking(objspace)) rb_bug("gc_writebarrier_generational: called while incremental marking: %s -> %s", rb_obj_info(a), rb_obj_info(b));
+    }
+
+    /* mark `a' and remember (default behavior) */
+    if (!RVALUE_REMEMBERED(objspace, a)) {
+        int lev = RB_GC_VM_LOCK_NO_BARRIER();
+        {
+            rgengc_remember(objspace, a);
+        }
+        RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+
+        gc_report(1, objspace, "gc_writebarrier_generational: %s (remembered) -> %s\n", rb_obj_info(a), rb_obj_info(b));
+    }
+
+    check_rvalue_consistency(objspace, a);
+    check_rvalue_consistency(objspace, b);
+}
+
+static void
+gc_mark_from(rb_objspace_t *objspace, VALUE obj, VALUE parent)
+{
+    gc_mark_set_parent(objspace, parent);
+    rgengc_check_relation(objspace, obj);
+    if (gc_mark_set(objspace, obj) != FALSE) {
+        gc_aging(objspace, obj);
+        gc_grey(objspace, obj);
+    }
+    gc_mark_set_parent_invalid(objspace);
+}
+
+NOINLINE(static void gc_writebarrier_incremental(VALUE a, VALUE b, rb_objspace_t *objspace));
+
+static void
+gc_writebarrier_incremental(VALUE a, VALUE b, rb_objspace_t *objspace)
+{
+    gc_report(2, objspace, "gc_writebarrier_incremental: [LG] %p -> %s\n", (void *)a, rb_obj_info(b));
+
+    if (RVALUE_BLACK_P(objspace, a)) {
+        if (RVALUE_WHITE_P(objspace, b)) {
+            if (!RVALUE_WB_UNPROTECTED(objspace, a)) {
+                gc_report(2, objspace, "gc_writebarrier_incremental: [IN] %p -> %s\n", (void *)a, rb_obj_info(b));
+                gc_mark_from(objspace, b, a);
+            }
+        }
+        else if (RVALUE_OLD_P(objspace, a) && !RVALUE_OLD_P(objspace, b)) {
+            rgengc_remember(objspace, a);
+        }
+
+        if (RB_UNLIKELY(objspace->flags.during_compacting)) {
+            MARK_IN_BITMAP(GET_HEAP_PINNED_BITS(b), b);
+        }
+    }
+}
+
+void
+rb_gc_impl_writebarrier(void *objspace_ptr, VALUE a, VALUE b)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+#if RGENGC_CHECK_MODE
+    if (SPECIAL_CONST_P(a)) rb_bug("rb_gc_writebarrier: a is special const: %"PRIxVALUE, a);
+    if (SPECIAL_CONST_P(b)) rb_bug("rb_gc_writebarrier: b is special const: %"PRIxVALUE, b);
+#else
+    RBIMPL_ASSERT_OR_ASSUME(!SPECIAL_CONST_P(a));
+    RBIMPL_ASSERT_OR_ASSUME(!SPECIAL_CONST_P(b));
+#endif
+
+    GC_ASSERT(!during_gc);
+    GC_ASSERT(RB_BUILTIN_TYPE(a) != T_NONE);
+    GC_ASSERT(RB_BUILTIN_TYPE(a) != T_MOVED);
+    GC_ASSERT(RB_BUILTIN_TYPE(a) != T_ZOMBIE);
+    GC_ASSERT(RB_BUILTIN_TYPE(b) != T_NONE);
+    GC_ASSERT(RB_BUILTIN_TYPE(b) != T_MOVED);
+    GC_ASSERT(RB_BUILTIN_TYPE(b) != T_ZOMBIE);
+
+  retry:
+    if (!is_incremental_marking(objspace)) {
+        if (!RVALUE_OLD_P(objspace, a) || RVALUE_OLD_P(objspace, b)) {
+            // do nothing
+        }
+        else {
+            gc_writebarrier_generational(a, b, objspace);
+        }
+    }
+    else {
+        bool retry = false;
+        /* slow path */
+        int lev = RB_GC_VM_LOCK_NO_BARRIER();
+        {
+            if (is_incremental_marking(objspace)) {
+                gc_writebarrier_incremental(a, b, objspace);
+            }
+            else {
+                retry = true;
+            }
+        }
+        RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+
+        if (retry) goto retry;
+    }
+    return;
+}
+
+void
+rb_gc_impl_writebarrier_unprotect(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (RVALUE_WB_UNPROTECTED(objspace, obj)) {
+        return;
+    }
+    else {
+        gc_report(2, objspace, "rb_gc_writebarrier_unprotect: %s %s\n", rb_obj_info(obj),
+                  RVALUE_REMEMBERED(objspace, obj) ? " (already remembered)" : "");
+
+        unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
+        {
+            if (RVALUE_OLD_P(objspace, obj)) {
+                gc_report(1, objspace, "rb_gc_writebarrier_unprotect: %s\n", rb_obj_info(obj));
+                RVALUE_DEMOTE(objspace, obj);
+                gc_mark_set(objspace, obj);
+                gc_remember_unprotected(objspace, obj);
+
+#if RGENGC_PROFILE
+                objspace->profile.total_shade_operation_count++;
+#if RGENGC_PROFILE >= 2
+                objspace->profile.shade_operation_count_types[BUILTIN_TYPE(obj)]++;
+#endif /* RGENGC_PROFILE >= 2 */
+#endif /* RGENGC_PROFILE */
+            }
+            else {
+                RVALUE_AGE_RESET(obj);
+            }
+
+            RB_DEBUG_COUNTER_INC(obj_wb_unprotect);
+            MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(obj), obj);
+        }
+        RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+    }
+}
+
+void
+rb_gc_impl_copy_attributes(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (RVALUE_WB_UNPROTECTED(objspace, obj)) {
+        rb_gc_impl_writebarrier_unprotect(objspace, dest);
+    }
+    rb_gc_impl_copy_finalizer(objspace, dest, obj);
+}
+
+const char *
+rb_gc_impl_active_gc_name(void)
+{
+    return "default";
+}
+
+void
+rb_gc_impl_writebarrier_remember(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    gc_report(1, objspace, "rb_gc_writebarrier_remember: %s\n", rb_obj_info(obj));
+
+    if (is_incremental_marking(objspace) || RVALUE_OLD_P(objspace, obj)) {
+        int lev = RB_GC_VM_LOCK_NO_BARRIER();
+        {
+            if (is_incremental_marking(objspace)) {
+                if (RVALUE_BLACK_P(objspace, obj)) {
+                    gc_grey(objspace, obj);
+                }
+            }
+            else if (RVALUE_OLD_P(objspace, obj)) {
+                rgengc_remember(objspace, obj);
+            }
+        }
+        RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+    }
+}
+
+struct rb_gc_object_metadata_names {
+    // Must be ID only
+    ID ID_wb_protected, ID_age, ID_old, ID_uncollectible, ID_marking,
+        ID_marked, ID_pinned, ID_remembered, ID_object_id, ID_shareable;
+};
+
+#define RB_GC_OBJECT_METADATA_ENTRY_COUNT (sizeof(struct rb_gc_object_metadata_names) / sizeof(ID))
+static struct rb_gc_object_metadata_entry object_metadata_entries[RB_GC_OBJECT_METADATA_ENTRY_COUNT + 1];
+
+struct rb_gc_object_metadata_entry *
+rb_gc_impl_object_metadata(void *objspace_ptr, VALUE obj)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    size_t n = 0;
+    static struct rb_gc_object_metadata_names names;
+
+    if (!names.ID_marked) {
+#define I(s) names.ID_##s = rb_intern(#s)
+        I(wb_protected);
+        I(age);
+        I(old);
+        I(uncollectible);
+        I(marking);
+        I(marked);
+        I(pinned);
+        I(remembered);
+        I(object_id);
+        I(shareable);
+#undef I
+    }
+
+#define SET_ENTRY(na, v) do { \
+    GC_ASSERT(n <= RB_GC_OBJECT_METADATA_ENTRY_COUNT); \
+    object_metadata_entries[n].name = names.ID_##na; \
+    object_metadata_entries[n].val = v; \
+    n++; \
+} while (0)
+
+    if (!RVALUE_WB_UNPROTECTED(objspace, obj)) SET_ENTRY(wb_protected, Qtrue);
+    SET_ENTRY(age, INT2FIX(RVALUE_AGE_GET(obj)));
+    if (RVALUE_OLD_P(objspace, obj)) SET_ENTRY(old, Qtrue);
+    if (RVALUE_UNCOLLECTIBLE(objspace, obj)) SET_ENTRY(uncollectible, Qtrue);
+    if (RVALUE_MARKING(objspace, obj)) SET_ENTRY(marking, Qtrue);
+    if (RVALUE_MARKED(objspace, obj)) SET_ENTRY(marked, Qtrue);
+    if (RVALUE_PINNED(objspace, obj)) SET_ENTRY(pinned, Qtrue);
+    if (RVALUE_REMEMBERED(objspace, obj)) SET_ENTRY(remembered, Qtrue);
+    if (rb_obj_id_p(obj)) SET_ENTRY(object_id, rb_obj_id(obj));
+    if (FL_TEST(obj, FL_SHAREABLE)) SET_ENTRY(shareable, Qtrue);
+
+    object_metadata_entries[n].name = 0;
+    object_metadata_entries[n].val = 0;
+#undef SET_ENTRY
+
+    return object_metadata_entries;
+}
+
+void *
+rb_gc_impl_ractor_cache_alloc(void *objspace_ptr, void *ractor)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    objspace->live_ractor_cache_count++;
+
+    return calloc1(sizeof(rb_ractor_newobj_cache_t));
+}
+
+void
+rb_gc_impl_ractor_cache_free(void *objspace_ptr, void *cache)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    objspace->live_ractor_cache_count--;
+    gc_ractor_newobj_cache_clear(cache, NULL);
+    free(cache);
+}
+
+static void
+heap_ready_to_gc(rb_objspace_t *objspace, rb_heap_t *heap)
+{
+    if (!heap->free_pages) {
+        if (!heap_page_allocate_and_initialize(objspace, heap)) {
+            objspace->heap_pages.allocatable_bytes = HEAP_PAGE_SIZE;
+            heap_page_allocate_and_initialize(objspace, heap);
+        }
+    }
+}
+
+static int
+ready_to_gc(rb_objspace_t *objspace)
+{
+    if (dont_gc_val() || during_gc) {
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+            heap_ready_to_gc(objspace, heap);
+        }
+        return FALSE;
+    }
+    else {
+        return TRUE;
+    }
+}
+
+static void
+gc_reset_malloc_info(rb_objspace_t *objspace, bool full_mark)
+{
+    gc_prof_set_malloc_info(objspace);
+    {
+        int64_t inc = gc_malloc_counters_increase(objspace, &objspace->malloc_counters.counters);
+        size_t old_limit = malloc_limit;
+
+        /* A net-negative `inc` (more freed than malloc'd since last GC) is
+         * treated the same as "allocated less than malloc_limit".
+         * This matches what we were doing pre-monotonic counters, but is it right? */
+        if (inc > 0 && (size_t)inc > malloc_limit) {
+            malloc_limit = (size_t)((size_t)inc * gc_params.malloc_limit_growth_factor);
+            if (malloc_limit > gc_params.malloc_limit_max) {
+                malloc_limit = gc_params.malloc_limit_max;
+            }
+        }
+        else {
+            malloc_limit = (size_t)(malloc_limit * 0.98); /* magic number */
+            if (malloc_limit < gc_params.malloc_limit_min) {
+                malloc_limit = gc_params.malloc_limit_min;
+            }
+        }
+
+        if (0) {
+            if (old_limit != malloc_limit) {
+                fprintf(stderr, "[%"PRIuSIZE"] malloc_limit: %"PRIuSIZE" -> %"PRIuSIZE"\n",
+                        rb_gc_count(), old_limit, malloc_limit);
+            }
+            else {
+                fprintf(stderr, "[%"PRIuSIZE"] malloc_limit: not changed (%"PRIuSIZE")\n",
+                        rb_gc_count(), malloc_limit);
+            }
+        }
+    }
+
+    /* reset oldmalloc info */
+#if RGENGC_ESTIMATE_OLDMALLOC
+    if (!full_mark) {
+        /* Don't snapshot on minor GC: oldmalloc_increase is meant to
+         * accumulate across minor GCs and only reset at major GC. */
+        int64_t oldmalloc_increase = gc_malloc_counters_increase(objspace, &objspace->malloc_counters.oldcounters);
+        if (oldmalloc_increase > 0 &&
+            (uint64_t)oldmalloc_increase > objspace->rgengc.oldmalloc_increase_limit) {
+            gc_needs_major_flags |= GPR_FLAG_MAJOR_BY_OLDMALLOC;
+            objspace->rgengc.oldmalloc_increase_limit =
+              (size_t)(objspace->rgengc.oldmalloc_increase_limit * gc_params.oldmalloc_limit_growth_factor);
+
+            if (objspace->rgengc.oldmalloc_increase_limit > gc_params.oldmalloc_limit_max) {
+                objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_max;
+            }
+        }
+
+        if (0) fprintf(stderr, "%"PRIdSIZE"\t%d\t%"PRId64"\t%"PRIuSIZE"\t%"PRIdSIZE"\n",
+                       rb_gc_count(),
+                       gc_needs_major_flags,
+                       oldmalloc_increase,
+                       objspace->rgengc.oldmalloc_increase_limit,
+                       gc_params.oldmalloc_limit_max);
+    }
+    else {
+        if ((objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_BY_OLDMALLOC) == 0) {
+            objspace->rgengc.oldmalloc_increase_limit =
+              (size_t)(objspace->rgengc.oldmalloc_increase_limit / ((gc_params.oldmalloc_limit_growth_factor - 1)/10 + 1));
+            if (objspace->rgengc.oldmalloc_increase_limit < gc_params.oldmalloc_limit_min) {
+                objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
+            }
+        }
+    }
+#endif
+}
+
+static int
+garbage_collect(rb_objspace_t *objspace, unsigned int reason)
+{
+    int ret;
+
+    int lev = RB_GC_VM_LOCK();
+    {
+#if GC_PROFILE_MORE_DETAIL
+        objspace->profile.prepare_time = getrusage_time();
+#endif
+
+        gc_rest(objspace);
+
+#if GC_PROFILE_MORE_DETAIL
+        objspace->profile.prepare_time = getrusage_time() - objspace->profile.prepare_time;
+#endif
+
+        ret = gc_start(objspace, reason);
+    }
+    RB_GC_VM_UNLOCK(lev);
+
+    return ret;
+}
+
+static int
+gc_start(rb_objspace_t *objspace, unsigned int reason)
+{
+    unsigned int do_full_mark = !!(reason & GPR_FLAG_FULL_MARK);
+
+    if (!rb_darray_size(objspace->heap_pages.sorted)) return TRUE; /* heap is not ready */
+    if (!(reason & GPR_FLAG_METHOD) && !ready_to_gc(objspace)) return TRUE; /* GC is not allowed */
+
+    rb_gc_initialize_vm_context(&objspace->vm_context);
+
+    GC_ASSERT(gc_mode(objspace) == gc_mode_none, "gc_mode is %s\n", gc_mode_name(gc_mode(objspace)));
+    GC_ASSERT(!is_lazy_sweeping(objspace));
+    GC_ASSERT(!is_incremental_marking(objspace));
+
+    unsigned int lock_lev;
+    gc_enter(objspace, gc_enter_event_start, &lock_lev);
+
+    /* reason may be clobbered, later, so keep set immediate_sweep here */
+    objspace->flags.immediate_sweep = !!(reason & GPR_FLAG_IMMEDIATE_SWEEP);
+
+#if RGENGC_CHECK_MODE >= 2
+    gc_verify_internal_consistency(objspace);
+#endif
+
+    if (ruby_gc_stressful) {
+        int flag = FIXNUM_P(ruby_gc_stress_mode) ? FIX2INT(ruby_gc_stress_mode) : 0;
+
+        if ((flag & (1 << gc_stress_no_major)) == 0) {
+            do_full_mark = TRUE;
+        }
+
+        objspace->flags.immediate_sweep = !(flag & (1<<gc_stress_no_immediate_sweep));
+    }
+
+    if (gc_needs_major_flags) {
+        reason |= gc_needs_major_flags;
+        do_full_mark = TRUE;
+    }
+
+    /* if major gc has been disabled, never do a full mark */
+    if (!gc_config_full_mark_val) {
+        do_full_mark = FALSE;
+    }
+    gc_needs_major_flags = GPR_FLAG_NONE;
+
+    if (do_full_mark && (reason & GPR_FLAG_MAJOR_MASK) == 0) {
+        reason |= GPR_FLAG_MAJOR_BY_FORCE; /* GC by CAPI, METHOD, and so on. */
+    }
+
+    if (objspace->flags.dont_incremental ||
+            reason & GPR_FLAG_IMMEDIATE_MARK ||
+            ruby_gc_stressful) {
+        objspace->flags.during_incremental_marking = FALSE;
+    }
+    else {
+        objspace->flags.during_incremental_marking = do_full_mark;
+    }
+
+    /* Explicitly enable compaction (GC.compact) */
+    if (do_full_mark && ruby_enable_autocompact) {
+        objspace->flags.during_compacting = TRUE;
+#if RGENGC_CHECK_MODE
+        objspace->rcompactor.compare_func = ruby_autocompact_compare_func;
+#endif
+    }
+    else {
+        objspace->flags.during_compacting = !!(reason & GPR_FLAG_COMPACT);
+    }
+
+    if (!GC_ENABLE_LAZY_SWEEP || objspace->flags.dont_incremental) {
+        objspace->flags.immediate_sweep = TRUE;
+    }
+
+    if (objspace->flags.immediate_sweep) reason |= GPR_FLAG_IMMEDIATE_SWEEP;
+
+    gc_report(1, objspace, "gc_start(reason: %x) => %u, %d, %d\n",
+              reason,
+              do_full_mark, !is_incremental_marking(objspace), objspace->flags.immediate_sweep);
+
+    RB_DEBUG_COUNTER_INC(gc_count);
+
+    if (reason & GPR_FLAG_MAJOR_MASK) {
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_nofree, reason & GPR_FLAG_MAJOR_BY_NOFREE);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldgen, reason & GPR_FLAG_MAJOR_BY_OLDGEN);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_shady,  reason & GPR_FLAG_MAJOR_BY_SHADY);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_force,  reason & GPR_FLAG_MAJOR_BY_FORCE);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_major_oldmalloc, reason & GPR_FLAG_MAJOR_BY_OLDMALLOC);
+#endif
+    }
+    else {
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_newobj, reason & GPR_FLAG_NEWOBJ);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_malloc, reason & GPR_FLAG_MALLOC);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_method, reason & GPR_FLAG_METHOD);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_capi,   reason & GPR_FLAG_CAPI);
+        (void)RB_DEBUG_COUNTER_INC_IF(gc_minor_stress, reason & GPR_FLAG_STRESS);
+    }
+
+    objspace->profile.count++;
+    objspace->profile.latest_gc_info = reason;
+    objspace->profile.total_allocated_objects_at_gc_start = total_allocated_objects(objspace);
+    objspace->profile.heap_used_at_gc_start = rb_darray_size(objspace->heap_pages.sorted);
+    objspace->profile.heap_total_slots_at_gc_start = objspace_available_slots(objspace);
+    objspace->profile.weak_references_count = 0;
+    gc_prof_setup_new_record(objspace, reason);
+    gc_reset_malloc_info(objspace, do_full_mark);
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_START);
+
+    GC_ASSERT(during_gc);
+
+    gc_prof_timer_start(objspace);
+    {
+        if (gc_marks(objspace, do_full_mark)) {
+            gc_sweep(objspace);
+        }
+    }
+    gc_prof_timer_stop(objspace);
+
+    gc_exit(objspace, gc_enter_event_start, &lock_lev);
+    return TRUE;
+}
+
+static void
+gc_rest(rb_objspace_t *objspace)
+{
+    if (is_incremental_marking(objspace) || is_lazy_sweeping(objspace)) {
+        unsigned int lock_lev;
+        gc_enter(objspace, gc_enter_event_rest, &lock_lev);
+
+        if (RGENGC_CHECK_MODE >= 2) gc_verify_internal_consistency(objspace);
+
+        if (is_incremental_marking(objspace)) {
+            gc_marking_enter(objspace);
+            gc_marks_rest(objspace);
+            gc_marking_exit(objspace);
+
+            gc_sweep(objspace);
+        }
+
+        if (is_lazy_sweeping(objspace)) {
+            gc_sweeping_enter(objspace);
+            gc_sweep_rest(objspace);
+            gc_sweeping_exit(objspace);
+        }
+
+        gc_exit(objspace, gc_enter_event_rest, &lock_lev);
+    }
+}
+
+struct objspace_and_reason {
+    rb_objspace_t *objspace;
+    unsigned int reason;
+};
+
+static void
+gc_current_status_fill(rb_objspace_t *objspace, char *buff)
+{
+    int i = 0;
+    if (is_marking(objspace)) {
+        buff[i++] = 'M';
+        if (is_full_marking(objspace))        buff[i++] = 'F';
+        if (is_incremental_marking(objspace)) buff[i++] = 'I';
+    }
+    else if (is_sweeping(objspace)) {
+        buff[i++] = 'S';
+        if (is_lazy_sweeping(objspace))      buff[i++] = 'L';
+    }
+    else {
+        buff[i++] = 'N';
+    }
+    buff[i] = '\0';
+}
+
+static const char *
+gc_current_status(rb_objspace_t *objspace)
+{
+    static char buff[0x10];
+    gc_current_status_fill(objspace, buff);
+    return buff;
+}
+
+#if PRINT_ENTER_EXIT_TICK
+
+static tick_t last_exit_tick;
+static tick_t enter_tick;
+static int enter_count = 0;
+static char last_gc_status[0x10];
+
+static inline void
+gc_record(rb_objspace_t *objspace, int direction, const char *event)
+{
+    if (direction == 0) { /* enter */
+        enter_count++;
+        enter_tick = tick();
+        gc_current_status_fill(objspace, last_gc_status);
+    }
+    else { /* exit */
+        tick_t exit_tick = tick();
+        char current_gc_status[0x10];
+        gc_current_status_fill(objspace, current_gc_status);
+#if 1
+        /* [last mutator time] [gc time] [event] */
+        fprintf(stderr, "%"PRItick"\t%"PRItick"\t%s\t[%s->%s|%c]\n",
+                enter_tick - last_exit_tick,
+                exit_tick - enter_tick,
+                event,
+                last_gc_status, current_gc_status,
+                (objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ? '+' : '-');
+        last_exit_tick = exit_tick;
+#else
+        /* [enter_tick] [gc time] [event] */
+        fprintf(stderr, "%"PRItick"\t%"PRItick"\t%s\t[%s->%s|%c]\n",
+                enter_tick,
+                exit_tick - enter_tick,
+                event,
+                last_gc_status, current_gc_status,
+                (objspace->profile.latest_gc_info & GPR_FLAG_MAJOR_MASK) ? '+' : '-');
+#endif
+    }
+}
+#else /* PRINT_ENTER_EXIT_TICK */
+static inline void
+gc_record(rb_objspace_t *objspace, int direction, const char *event)
+{
+    /* null */
+}
+#endif /* PRINT_ENTER_EXIT_TICK */
+
+static const char *
+gc_enter_event_cstr(enum gc_enter_event event)
+{
+    switch (event) {
+      case gc_enter_event_start: return "start";
+      case gc_enter_event_continue: return "continue";
+      case gc_enter_event_rest: return "rest";
+      case gc_enter_event_finalizer: return "finalizer";
+    }
+    return NULL;
+}
+
+static void
+gc_enter_count(enum gc_enter_event event)
+{
+    switch (event) {
+      case gc_enter_event_start:          RB_DEBUG_COUNTER_INC(gc_enter_start); break;
+      case gc_enter_event_continue:       RB_DEBUG_COUNTER_INC(gc_enter_continue); break;
+      case gc_enter_event_rest:           RB_DEBUG_COUNTER_INC(gc_enter_rest); break;
+      case gc_enter_event_finalizer:      RB_DEBUG_COUNTER_INC(gc_enter_finalizer); break;
+    }
+}
+
+static bool current_process_time(struct timespec *ts);
+
+static void
+gc_clock_start(struct timespec *ts)
+{
+    if (!current_process_time(ts)) {
+        ts->tv_sec = 0;
+        ts->tv_nsec = 0;
+    }
+}
+
+static unsigned long long
+gc_clock_end(struct timespec *ts)
+{
+    struct timespec end_time;
+
+    if ((ts->tv_sec > 0 || ts->tv_nsec > 0) &&
+            current_process_time(&end_time) &&
+            end_time.tv_sec >= ts->tv_sec) {
+        return (unsigned long long)(end_time.tv_sec - ts->tv_sec) * (1000 * 1000 * 1000) +
+                    (end_time.tv_nsec - ts->tv_nsec);
+    }
+
+    return 0;
+}
+
+static inline void
+gc_enter(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev)
+{
+    *lock_lev = RB_GC_VM_LOCK();
+
+    switch (event) {
+      case gc_enter_event_rest:
+      case gc_enter_event_start:
+      case gc_enter_event_continue:
+        // stop other ractors
+        rb_gc_vm_barrier();
+        break;
+      default:
+        break;
+    }
+
+    gc_enter_count(event);
+    if (RB_UNLIKELY(during_gc != 0)) rb_bug("during_gc != 0");
+    if (RGENGC_CHECK_MODE >= 3) gc_verify_internal_consistency(objspace);
+
+    during_gc = TRUE;
+    RUBY_DEBUG_LOG("%s (%s)",gc_enter_event_cstr(event), gc_current_status(objspace));
+    gc_report(1, objspace, "gc_enter: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(objspace));
+    gc_record(objspace, 0, gc_enter_event_cstr(event));
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_ENTER);
+}
+
+static inline void
+gc_exit(rb_objspace_t *objspace, enum gc_enter_event event, unsigned int *lock_lev)
+{
+    GC_ASSERT(during_gc != 0);
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_EXIT);
+
+    gc_record(objspace, 1, gc_enter_event_cstr(event));
+    RUBY_DEBUG_LOG("%s (%s)", gc_enter_event_cstr(event), gc_current_status(objspace));
+    gc_report(1, objspace, "gc_exit: %s [%s]\n", gc_enter_event_cstr(event), gc_current_status(objspace));
+    during_gc = FALSE;
+
+    RB_GC_VM_UNLOCK(*lock_lev);
+}
+
+#ifndef MEASURE_GC
+#define MEASURE_GC (objspace->flags.measure_gc)
+#endif
+
+static void
+gc_marking_enter(rb_objspace_t *objspace)
+{
+    GC_ASSERT(during_gc != 0);
+
+    gc_prof_mark_timer_start(objspace);
+
+    if (MEASURE_GC) {
+        gc_clock_start(&objspace->profile.marking_start_time);
+    }
+
+    rb_gc_initialize_vm_context(&objspace->vm_context);
+}
+
+static void
+gc_marking_exit(rb_objspace_t *objspace)
+{
+    GC_ASSERT(during_gc != 0);
+
+    if (MEASURE_GC) {
+        objspace->profile.marking_time_ns += gc_clock_end(&objspace->profile.marking_start_time);
+    }
+
+    gc_prof_mark_timer_stop(objspace);
+}
+
+static void
+gc_sweeping_enter(rb_objspace_t *objspace)
+{
+    GC_ASSERT(during_gc != 0);
+
+    if (MEASURE_GC) {
+        gc_clock_start(&objspace->profile.sweeping_start_time);
+    }
+}
+
+static void
+gc_sweeping_exit(rb_objspace_t *objspace)
+{
+    GC_ASSERT(during_gc != 0);
+
+    if (MEASURE_GC) {
+        objspace->profile.sweeping_time_ns += gc_clock_end(&objspace->profile.sweeping_start_time);
+    }
+}
+
+static void *
+gc_with_gvl(void *ptr)
+{
+    struct objspace_and_reason *oar = (struct objspace_and_reason *)ptr;
+    return (void *)(VALUE)garbage_collect(oar->objspace, oar->reason);
+}
+
+int ruby_thread_has_gvl_p(void);
+
+static int
+garbage_collect_with_gvl(rb_objspace_t *objspace, unsigned int reason)
+{
+    if (dont_gc_val()) {
+        return TRUE;
+    }
+    else if (!ruby_native_thread_p()) {
+        return TRUE;
+    }
+    else if (!ruby_thread_has_gvl_p()) {
+        void *ret;
+        struct objspace_and_reason oar;
+        oar.objspace = objspace;
+        oar.reason = reason;
+        ret = rb_thread_call_with_gvl(gc_with_gvl, (void *)&oar);
+
+        return !!ret;
+    }
+    else {
+        return garbage_collect(objspace, reason);
+    }
+}
+
+static int
+gc_set_candidate_object_i(void *vstart, void *vend, size_t stride, void *data)
+{
+    rb_objspace_t *objspace = (rb_objspace_t *)data;
+
+    VALUE v = (VALUE)vstart;
+    for (; v != (VALUE)vend; v += stride) {
+        asan_unpoisoning_object(v) {
+            switch (BUILTIN_TYPE(v)) {
+              case T_NONE:
+              case T_ZOMBIE:
+                break;
+              default:
+                rb_gc_prepare_heap_process_object(v);
+                if (!RVALUE_OLD_P(objspace, v) && !RVALUE_WB_UNPROTECTED(objspace, v)) {
+                    RVALUE_AGE_SET_CANDIDATE(objspace, v);
+                }
+            }
+        }
+    }
+
+    return 0;
+}
+
+void
+rb_gc_impl_start(void *objspace_ptr, bool full_mark, bool immediate_mark, bool immediate_sweep, bool compact)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    unsigned int reason = (GPR_FLAG_FULL_MARK |
+                           GPR_FLAG_IMMEDIATE_MARK |
+                           GPR_FLAG_IMMEDIATE_SWEEP |
+                           GPR_FLAG_METHOD);
+
+    int full_marking_p = gc_config_full_mark_val;
+    gc_config_full_mark_set(TRUE);
+
+    /* For now, compact implies full mark / sweep, so ignore other flags */
+    if (compact) {
+        GC_ASSERT(GC_COMPACTION_SUPPORTED);
+
+        reason |= GPR_FLAG_COMPACT;
+    }
+    else {
+        if (!full_mark)       reason &= ~GPR_FLAG_FULL_MARK;
+        if (!immediate_mark)  reason &= ~GPR_FLAG_IMMEDIATE_MARK;
+        if (!immediate_sweep) reason &= ~GPR_FLAG_IMMEDIATE_SWEEP;
+    }
+
+    garbage_collect(objspace, reason);
+    gc_finalize_deferred(objspace);
+
+    gc_config_full_mark_set(full_marking_p);
+}
+
+void
+rb_gc_impl_prepare_heap(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    size_t orig_total_slots = objspace_available_slots(objspace);
+    size_t orig_allocatable_bytes = objspace->heap_pages.allocatable_bytes;
+
+    rb_gc_impl_each_objects(objspace, gc_set_candidate_object_i, objspace_ptr);
+
+    double orig_max_free_slots = gc_params.heap_free_slots_max_ratio;
+    /* Ensure that all empty pages are moved onto empty_pages. */
+    gc_params.heap_free_slots_max_ratio = 0.0;
+    rb_gc_impl_start(objspace, true, true, true, true);
+    gc_params.heap_free_slots_max_ratio = orig_max_free_slots;
+
+    objspace->heap_pages.allocatable_bytes = 0;
+    heap_pages_freeable_pages = objspace->empty_pages_count;
+    heap_pages_free_unused_pages(objspace_ptr);
+    GC_ASSERT(heap_pages_freeable_pages == 0);
+    GC_ASSERT(objspace->empty_pages_count == 0);
+    objspace->heap_pages.allocatable_bytes = orig_allocatable_bytes;
+
+    size_t total_slots = objspace_available_slots(objspace);
+    if (orig_total_slots > total_slots) {
+        objspace->heap_pages.allocatable_bytes += (orig_total_slots - total_slots) * heaps[0].slot_size;
+    }
+
+#if defined(HAVE_MALLOC_TRIM) && !defined(RUBY_ALTERNATIVE_MALLOC_HEADER)
+    malloc_trim(0);
+#endif
+}
+
+static int
+gc_is_moveable_obj(rb_objspace_t *objspace, VALUE obj)
+{
+    GC_ASSERT(!SPECIAL_CONST_P(obj));
+
+    switch (BUILTIN_TYPE(obj)) {
+      case T_NONE:
+      case T_MOVED:
+      case T_ZOMBIE:
+        return FALSE;
+      case T_SYMBOL:
+      case T_STRING:
+      case T_OBJECT:
+      case T_FLOAT:
+      case T_IMEMO:
+      case T_ARRAY:
+      case T_BIGNUM:
+      case T_ICLASS:
+      case T_MODULE:
+      case T_REGEXP:
+      case T_DATA:
+      case T_MATCH:
+      case T_STRUCT:
+      case T_HASH:
+      case T_FILE:
+      case T_COMPLEX:
+      case T_RATIONAL:
+      case T_NODE:
+      case T_CLASS:
+        if (FL_TEST_RAW(obj, FL_FINALIZE)) {
+            /* The finalizer table is a numtable. It looks up objects by address.
+             * We can't mark the keys in the finalizer table because that would
+             * prevent the objects from being collected.  This check prevents
+             * objects that are keys in the finalizer table from being moved
+             * without directly pinning them. */
+            GC_ASSERT(st_is_member(finalizer_table, obj));
+
+            return FALSE;
+        }
+        GC_ASSERT(RVALUE_MARKED(objspace, obj));
+        GC_ASSERT(!RVALUE_PINNED(objspace, obj));
+
+        return TRUE;
+
+      default:
+        rb_bug("gc_is_moveable_obj: unreachable (%d)", (int)BUILTIN_TYPE(obj));
+        break;
+    }
+
+    return FALSE;
+}
+
+void rb_mv_generic_ivar(VALUE src, VALUE dst);
+
+static VALUE
+gc_move(rb_objspace_t *objspace, VALUE src, VALUE dest, struct heap_page *src_page, struct heap_page *dest_page)
+{
+    size_t src_slot_size = src_page->slot_size;
+    size_t slot_size = dest_page->slot_size;
+
+    int marked;
+    int wb_unprotected;
+    int uncollectible;
+    int age;
+
+    gc_report(4, objspace, "Moving object: %p -> %p\n", (void *)src, (void *)dest);
+
+    GC_ASSERT(BUILTIN_TYPE(src) != T_NONE);
+    GC_ASSERT(!MARKED_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest));
+
+    GC_ASSERT(!RVALUE_MARKING(objspace, src));
+
+    /* Save off bits for current object. */
+    marked = RVALUE_MARKED(objspace, src);
+    wb_unprotected = RVALUE_WB_UNPROTECTED(objspace, src);
+    uncollectible = RVALUE_UNCOLLECTIBLE(objspace, src);
+    bool remembered = RVALUE_REMEMBERED(objspace, src);
+    age = RVALUE_AGE_GET(src);
+
+    /* Clear bits for eventual T_MOVED */
+    CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(src), src);
+    CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(src), src);
+    CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(src), src);
+    CLEAR_IN_BITMAP(GET_HEAP_PAGE(src)->remembered_bits, src);
+
+    /* Move the object */
+    memcpy((void *)dest, (void *)src, MIN(src_slot_size, slot_size));
+
+    if (src_slot_size != slot_size && RB_TYPE_P(src, T_OBJECT)) {
+        rb_gc_obj_changed_pool(dest, dest_page->heap - heaps);
+    }
+
+    if (RVALUE_OVERHEAD > 0) {
+        void *dest_overhead = (void *)(((uintptr_t)dest) + slot_size - RVALUE_OVERHEAD);
+        void *src_overhead = (void *)(((uintptr_t)src) + src_slot_size - RVALUE_OVERHEAD);
+
+        memcpy(dest_overhead, src_overhead, RVALUE_OVERHEAD);
+    }
+
+    memset((void *)src, 0, src_slot_size);
+    RVALUE_AGE_SET_BITMAP(src, 0);
+
+    /* Set bits for object in new location */
+    if (remembered) {
+        MARK_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
+    }
+    else {
+        CLEAR_IN_BITMAP(GET_HEAP_PAGE(dest)->remembered_bits, dest);
+    }
+
+    if (marked) {
+        MARK_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
+    }
+    else {
+        CLEAR_IN_BITMAP(GET_HEAP_MARK_BITS(dest), dest);
+    }
+
+    if (wb_unprotected) {
+        MARK_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
+    }
+    else {
+        CLEAR_IN_BITMAP(GET_HEAP_WB_UNPROTECTED_BITS(dest), dest);
+    }
+
+    if (uncollectible) {
+        MARK_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
+    }
+    else {
+        CLEAR_IN_BITMAP(GET_HEAP_UNCOLLECTIBLE_BITS(dest), dest);
+    }
+
+    RVALUE_AGE_SET(dest, age);
+    /* Assign forwarding address */
+    RMOVED(src)->flags = T_MOVED;
+    RMOVED(src)->dummy = Qundef;
+    RMOVED(src)->destination = dest;
+    GC_ASSERT(BUILTIN_TYPE(dest) != T_NONE);
+
+    GET_HEAP_PAGE(src)->heap->total_freed_objects++;
+    GET_HEAP_PAGE(dest)->heap->total_allocated_objects++;
+
+    return src;
+}
+
+#if GC_CAN_COMPILE_COMPACTION
+static int
+compare_pinned_slots(const void *left, const void *right, void *dummy)
+{
+    struct heap_page *left_page;
+    struct heap_page *right_page;
+
+    left_page = *(struct heap_page * const *)left;
+    right_page = *(struct heap_page * const *)right;
+
+    return left_page->pinned_slots - right_page->pinned_slots;
+}
+
+static int
+compare_free_slots(const void *left, const void *right, void *dummy)
+{
+    struct heap_page *left_page;
+    struct heap_page *right_page;
+
+    left_page = *(struct heap_page * const *)left;
+    right_page = *(struct heap_page * const *)right;
+
+    return left_page->free_slots - right_page->free_slots;
+}
+
+static void
+gc_sort_heap_by_compare_func(rb_objspace_t *objspace, gc_compact_compare_func compare_func)
+{
+    for (int j = 0; j < HEAP_COUNT; j++) {
+        rb_heap_t *heap = &heaps[j];
+
+        size_t total_pages = heap->total_pages;
+        size_t size = rb_size_mul_or_raise(total_pages, sizeof(struct heap_page *), rb_eRuntimeError);
+        struct heap_page *page = 0, **page_list = malloc(size);
+        size_t i = 0;
+
+        heap->free_pages = NULL;
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            page_list[i++] = page;
+            GC_ASSERT(page);
+        }
+
+        GC_ASSERT((size_t)i == total_pages);
+
+        /* Sort the heap so "filled pages" are first. `heap_add_page` adds to the
+         * head of the list, so empty pages will end up at the start of the heap */
+        ruby_qsort(page_list, total_pages, sizeof(struct heap_page *), compare_func, NULL);
+
+        /* Reset the eden heap */
+        ccan_list_head_init(&heap->pages);
+
+        for (i = 0; i < total_pages; i++) {
+            ccan_list_add(&heap->pages, &page_list[i]->page_node);
+            if (page_list[i]->free_slots != 0) {
+                heap_add_freepage(heap, page_list[i]);
+            }
+        }
+
+        free(page_list);
+    }
+}
+#endif
+
+void
+rb_gc_impl_register_pinning_obj(void *objspace_ptr, VALUE obj)
+{
+    /* no-op */
+}
+
+bool
+rb_gc_impl_object_moved_p(void *objspace_ptr, VALUE obj)
+{
+    return gc_object_moved_p(objspace_ptr, obj);
+}
+
+static int
+gc_ref_update(void *vstart, void *vend, size_t stride, rb_objspace_t *objspace, struct heap_page *page)
+{
+    VALUE v = (VALUE)vstart;
+
+    page->flags.has_uncollectible_wb_unprotected_objects = FALSE;
+    page->flags.has_remembered_objects = FALSE;
+
+    /* For each object on the page */
+    for (; v != (VALUE)vend; v += stride) {
+        asan_unpoisoning_object(v) {
+            switch (BUILTIN_TYPE(v)) {
+              case T_NONE:
+              case T_MOVED:
+              case T_ZOMBIE:
+                break;
+              default:
+                if (RVALUE_WB_UNPROTECTED(objspace, v)) {
+                    page->flags.has_uncollectible_wb_unprotected_objects = TRUE;
+                }
+                if (RVALUE_REMEMBERED(objspace, v)) {
+                    page->flags.has_remembered_objects = TRUE;
+                }
+                if (page->flags.before_sweep) {
+                    if (RVALUE_MARKED(objspace, v)) {
+                        rb_gc_update_object_references(objspace, v);
+                    }
+                }
+                else {
+                    rb_gc_update_object_references(objspace, v);
+                }
+            }
+        }
+    }
+
+    return 0;
+}
+
+static int
+gc_update_references_weak_table_i(VALUE obj, void *data)
+{
+    int ret;
+    asan_unpoisoning_object(obj) {
+        ret = BUILTIN_TYPE(obj) == T_MOVED ? ST_REPLACE : ST_CONTINUE;
+    }
+    return ret;
+}
+
+static int
+gc_update_references_weak_table_replace_i(VALUE *obj, void *data)
+{
+    *obj = rb_gc_location(*obj);
+
+    return ST_CONTINUE;
+}
+
+static void
+gc_update_references(rb_objspace_t *objspace)
+{
+    objspace->flags.during_reference_updating = true;
+
+    rb_gc_before_updating_jit_code();
+
+    struct heap_page *page = NULL;
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        bool should_set_mark_bits = TRUE;
+        rb_heap_t *heap = &heaps[i];
+
+        ccan_list_for_each(&heap->pages, page, page_node) {
+            uintptr_t start = (uintptr_t)page->start;
+            uintptr_t end = start + (page->total_slots * heap->slot_size);
+
+            gc_ref_update((void *)start, (void *)end, heap->slot_size, objspace, page);
+            if (page == heap->sweeping_page) {
+                should_set_mark_bits = FALSE;
+            }
+            if (should_set_mark_bits) {
+                gc_setup_mark_bits(page);
+            }
+        }
+    }
+
+    gc_update_table_refs(finalizer_table);
+
+    rb_gc_update_vm_references((void *)objspace);
+
+    for (int table = 0; table < RB_GC_VM_WEAK_TABLE_COUNT; table++) {
+        rb_gc_vm_weak_table_foreach(
+            gc_update_references_weak_table_i,
+            gc_update_references_weak_table_replace_i,
+            NULL,
+            false,
+            table
+        );
+    }
+
+    rb_gc_after_updating_jit_code();
+
+    objspace->flags.during_reference_updating = false;
+}
+
+#if GC_CAN_COMPILE_COMPACTION
+static void
+root_obj_check_moved_i(const char *category, VALUE obj, void *data)
+{
+    rb_objspace_t *objspace = data;
+
+    if (gc_object_moved_p(objspace, obj)) {
+        rb_bug("ROOT %s points to MOVED: %p -> %s", category, (void *)obj, rb_obj_info(rb_gc_impl_location(objspace, obj)));
+    }
+}
+
+static void
+reachable_object_check_moved_i(VALUE ref, void *data)
+{
+    VALUE parent = (VALUE)data;
+    if (gc_object_moved_p(rb_gc_get_objspace(), ref)) {
+        rb_bug("Object %s points to MOVED: %p -> %s", rb_obj_info(parent), (void *)ref, rb_obj_info(rb_gc_impl_location(rb_gc_get_objspace(), ref)));
+    }
+}
+
+static int
+heap_check_moved_i(void *vstart, void *vend, size_t stride, void *data)
+{
+    rb_objspace_t *objspace = data;
+
+    VALUE v = (VALUE)vstart;
+    for (; v != (VALUE)vend; v += stride) {
+        if (gc_object_moved_p(objspace, v)) {
+            /* Moved object still on the heap, something may have a reference. */
+        }
+        else {
+            asan_unpoisoning_object(v) {
+                switch (BUILTIN_TYPE(v)) {
+                  case T_NONE:
+                  case T_ZOMBIE:
+                    break;
+                  default:
+                    if (!rb_gc_impl_garbage_object_p(objspace, v)) {
+                        rb_objspace_reachable_objects_from(v, reachable_object_check_moved_i, (void *)v);
+                    }
+                }
+            }
+        }
+    }
+
+    return 0;
+}
+#endif
+
+bool
+rb_gc_impl_during_gc_p(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    return during_gc;
+}
+
+#if RGENGC_PROFILE >= 2
+
+static const char*
+type_name(int type, VALUE obj)
+{
+    switch ((enum ruby_value_type)type) {
+      case RUBY_T_NONE:     return "T_NONE";
+      case RUBY_T_OBJECT:   return "T_OBJECT";
+      case RUBY_T_CLASS:    return "T_CLASS";
+      case RUBY_T_MODULE:   return "T_MODULE";
+      case RUBY_T_FLOAT:    return "T_FLOAT";
+      case RUBY_T_STRING:   return "T_STRING";
+      case RUBY_T_REGEXP:   return "T_REGEXP";
+      case RUBY_T_ARRAY:    return "T_ARRAY";
+      case RUBY_T_HASH:     return "T_HASH";
+      case RUBY_T_STRUCT:   return "T_STRUCT";
+      case RUBY_T_BIGNUM:   return "T_BIGNUM";
+      case RUBY_T_FILE:     return "T_FILE";
+      case RUBY_T_DATA:     return "T_DATA";
+      case RUBY_T_MATCH:    return "T_MATCH";
+      case RUBY_T_COMPLEX:  return "T_COMPLEX";
+      case RUBY_T_RATIONAL: return "T_RATIONAL";
+      case RUBY_T_NIL:      return "T_NIL";
+      case RUBY_T_TRUE:     return "T_TRUE";
+      case RUBY_T_FALSE:    return "T_FALSE";
+      case RUBY_T_SYMBOL:   return "T_SYMBOL";
+      case RUBY_T_FIXNUM:   return "T_FIXNUM";
+      case RUBY_T_UNDEF:    return "T_UNDEF";
+      case RUBY_T_IMEMO:    return "T_IMEMO";
+      case RUBY_T_NODE:     return "T_NODE";
+      case RUBY_T_ICLASS:   return "T_ICLASS";
+      case RUBY_T_ZOMBIE:   return "T_ZOMBIE";
+      case RUBY_T_MOVED:    return "T_MOVED";
+      default:              return "unknown";
+    }
+}
+
+static void
+gc_count_add_each_types(VALUE hash, const char *name, const size_t *types)
+{
+    VALUE result = rb_hash_new_with_size(T_MASK);
+    int i;
+    for (i=0; i<T_MASK; i++) {
+        const char *type = type_name(i, 0);
+        rb_hash_aset(result, ID2SYM(rb_intern(type)), SIZET2NUM(types[i]));
+    }
+    rb_hash_aset(hash, ID2SYM(rb_intern(name)), result);
+}
+#endif
+
+size_t
+rb_gc_impl_gc_count(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    return objspace->profile.count;
+}
+
+static VALUE
+gc_info_decode(rb_objspace_t *objspace, const VALUE hash_or_key, const unsigned int orig_flags)
+{
+    static VALUE sym_major_by = Qnil, sym_gc_by, sym_immediate_sweep, sym_have_finalizer, sym_state, sym_need_major_by;
+    static VALUE sym_nofree, sym_oldgen, sym_shady, sym_force, sym_stress;
+#if RGENGC_ESTIMATE_OLDMALLOC
+    static VALUE sym_oldmalloc;
+#endif
+    static VALUE sym_newobj, sym_malloc, sym_method, sym_capi;
+    static VALUE sym_none, sym_marking, sym_sweeping;
+    static VALUE sym_weak_references_count;
+    VALUE hash = Qnil, key = Qnil;
+    VALUE major_by, need_major_by;
+    unsigned int flags = orig_flags ? orig_flags : objspace->profile.latest_gc_info;
+
+    if (SYMBOL_P(hash_or_key)) {
+        key = hash_or_key;
+    }
+    else if (RB_TYPE_P(hash_or_key, T_HASH)) {
+        hash = hash_or_key;
+    }
+    else {
+        rb_bug("gc_info_decode: non-hash or symbol given");
+    }
+
+    if (NIL_P(sym_major_by)) {
+#define S(s) sym_##s = ID2SYM(rb_intern_const(#s))
+        S(major_by);
+        S(gc_by);
+        S(immediate_sweep);
+        S(have_finalizer);
+        S(state);
+        S(need_major_by);
+
+        S(stress);
+        S(nofree);
+        S(oldgen);
+        S(shady);
+        S(force);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        S(oldmalloc);
+#endif
+        S(newobj);
+        S(malloc);
+        S(method);
+        S(capi);
+
+        S(none);
+        S(marking);
+        S(sweeping);
+
+        S(weak_references_count);
+#undef S
+    }
+
+#define SET(name, attr) \
+    if (key == sym_##name) \
+        return (attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, sym_##name, (attr));
+
+    major_by =
+      (flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
+      (flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
+      (flags & GPR_FLAG_MAJOR_BY_SHADY)  ? sym_shady :
+      (flags & GPR_FLAG_MAJOR_BY_FORCE)  ? sym_force :
+#if RGENGC_ESTIMATE_OLDMALLOC
+      (flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
+#endif
+      Qnil;
+    SET(major_by, major_by);
+
+    if (orig_flags == 0) { /* set need_major_by only if flags not set explicitly */
+        unsigned int need_major_flags = gc_needs_major_flags;
+        need_major_by =
+            (need_major_flags & GPR_FLAG_MAJOR_BY_NOFREE) ? sym_nofree :
+            (need_major_flags & GPR_FLAG_MAJOR_BY_OLDGEN) ? sym_oldgen :
+            (need_major_flags & GPR_FLAG_MAJOR_BY_SHADY)  ? sym_shady :
+            (need_major_flags & GPR_FLAG_MAJOR_BY_FORCE)  ? sym_force :
+#if RGENGC_ESTIMATE_OLDMALLOC
+            (need_major_flags & GPR_FLAG_MAJOR_BY_OLDMALLOC) ? sym_oldmalloc :
+#endif
+            Qnil;
+        SET(need_major_by, need_major_by);
+    }
+
+    SET(gc_by,
+        (flags & GPR_FLAG_NEWOBJ) ? sym_newobj :
+        (flags & GPR_FLAG_MALLOC) ? sym_malloc :
+        (flags & GPR_FLAG_METHOD) ? sym_method :
+        (flags & GPR_FLAG_CAPI)   ? sym_capi :
+        (flags & GPR_FLAG_STRESS) ? sym_stress :
+        Qnil
+    );
+
+    SET(have_finalizer, (flags & GPR_FLAG_HAVE_FINALIZE) ? Qtrue : Qfalse);
+    SET(immediate_sweep, (flags & GPR_FLAG_IMMEDIATE_SWEEP) ? Qtrue : Qfalse);
+
+    if (orig_flags == 0) {
+        SET(state, gc_mode(objspace) == gc_mode_none ? sym_none :
+                   gc_mode(objspace) == gc_mode_marking ? sym_marking : sym_sweeping);
+    }
+
+    SET(weak_references_count, LONG2FIX(objspace->profile.weak_references_count));
+#undef SET
+
+    if (!NIL_P(key)) {
+        // Matched key should return above
+        return Qundef;
+    }
+
+    return hash;
+}
+
+VALUE
+rb_gc_impl_latest_gc_info(void *objspace_ptr, VALUE key)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    return gc_info_decode(objspace, key, 0);
+}
+
+
+enum gc_stat_sym {
+    gc_stat_sym_count,
+    gc_stat_sym_time,
+    gc_stat_sym_marking_time,
+    gc_stat_sym_sweeping_time,
+    gc_stat_sym_heap_allocated_pages,
+    gc_stat_sym_heap_empty_pages,
+    gc_stat_sym_heap_allocatable_bytes,
+    gc_stat_sym_heap_available_slots,
+    gc_stat_sym_heap_live_slots,
+    gc_stat_sym_heap_free_slots,
+    gc_stat_sym_heap_final_slots,
+    gc_stat_sym_heap_marked_slots,
+    gc_stat_sym_heap_eden_pages,
+    gc_stat_sym_total_allocated_pages,
+    gc_stat_sym_total_freed_pages,
+    gc_stat_sym_total_allocated_objects,
+    gc_stat_sym_total_freed_objects,
+    gc_stat_sym_total_malloc_bytes,
+    gc_stat_sym_total_free_bytes,
+    gc_stat_sym_malloc_increase_bytes,
+    gc_stat_sym_malloc_increase_bytes_limit,
+    gc_stat_sym_minor_gc_count,
+    gc_stat_sym_major_gc_count,
+    gc_stat_sym_compact_count,
+    gc_stat_sym_read_barrier_faults,
+    gc_stat_sym_total_moved_objects,
+    gc_stat_sym_remembered_wb_unprotected_objects,
+    gc_stat_sym_remembered_wb_unprotected_objects_limit,
+    gc_stat_sym_old_objects,
+    gc_stat_sym_old_objects_limit,
+#if RGENGC_ESTIMATE_OLDMALLOC
+    gc_stat_sym_oldmalloc_increase_bytes,
+    gc_stat_sym_oldmalloc_increase_bytes_limit,
+#endif
+#if RGENGC_PROFILE
+    gc_stat_sym_total_generated_normal_object_count,
+    gc_stat_sym_total_generated_shady_object_count,
+    gc_stat_sym_total_shade_operation_count,
+    gc_stat_sym_total_promoted_count,
+    gc_stat_sym_total_remembered_normal_object_count,
+    gc_stat_sym_total_remembered_shady_object_count,
+#endif
+    gc_stat_sym_last
+};
+
+static VALUE gc_stat_symbols[gc_stat_sym_last];
+
+static void
+setup_gc_stat_symbols(void)
+{
+    if (gc_stat_symbols[0] == 0) {
+#define S(s) gc_stat_symbols[gc_stat_sym_##s] = ID2SYM(rb_intern_const(#s))
+        S(count);
+        S(time);
+        S(marking_time),
+        S(sweeping_time),
+        S(heap_allocated_pages);
+        S(heap_empty_pages);
+        S(heap_allocatable_bytes);
+        S(heap_available_slots);
+        S(heap_live_slots);
+        S(heap_free_slots);
+        S(heap_final_slots);
+        S(heap_marked_slots);
+        S(heap_eden_pages);
+        S(total_allocated_pages);
+        S(total_freed_pages);
+        S(total_allocated_objects);
+        S(total_freed_objects);
+        S(total_malloc_bytes);
+        S(total_free_bytes);
+        S(malloc_increase_bytes);
+        S(malloc_increase_bytes_limit);
+        S(minor_gc_count);
+        S(major_gc_count);
+        S(compact_count);
+        S(read_barrier_faults);
+        S(total_moved_objects);
+        S(remembered_wb_unprotected_objects);
+        S(remembered_wb_unprotected_objects_limit);
+        S(old_objects);
+        S(old_objects_limit);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        S(oldmalloc_increase_bytes);
+        S(oldmalloc_increase_bytes_limit);
+#endif
+#if RGENGC_PROFILE
+        S(total_generated_normal_object_count);
+        S(total_generated_shady_object_count);
+        S(total_shade_operation_count);
+        S(total_promoted_count);
+        S(total_remembered_normal_object_count);
+        S(total_remembered_shady_object_count);
+#endif /* RGENGC_PROFILE */
+#undef S
+    }
+}
+
+static uint64_t
+ns_to_ms(uint64_t ns)
+{
+    return ns / (1000 * 1000);
+}
+
+static void malloc_increase_local_flush(rb_objspace_t *objspace);
+
+VALUE
+rb_gc_impl_stat(void *objspace_ptr, VALUE hash_or_sym)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    VALUE hash = Qnil, key = Qnil;
+
+    setup_gc_stat_symbols();
+
+    ractor_cache_flush_count(objspace, rb_gc_get_ractor_newobj_cache());
+    malloc_increase_local_flush(objspace);
+
+    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+        hash = hash_or_sym;
+    }
+    else if (SYMBOL_P(hash_or_sym)) {
+        key = hash_or_sym;
+    }
+    else {
+        rb_bug("non-hash or symbol given");
+    }
+
+#define SET(name, attr) \
+    if (key == gc_stat_symbols[gc_stat_sym_##name]) \
+        return SIZET2NUM(attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], SIZET2NUM(attr));
+#define SET64(name, attr) \
+    if (key == gc_stat_symbols[gc_stat_sym_##name]) \
+        return ULL2NUM(attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], ULL2NUM(attr));
+
+    SET(count, objspace->profile.count);
+    SET(time, (size_t)ns_to_ms(objspace->profile.marking_time_ns + objspace->profile.sweeping_time_ns)); // TODO: UINT64T2NUM
+    SET(marking_time, (size_t)ns_to_ms(objspace->profile.marking_time_ns));
+    SET(sweeping_time, (size_t)ns_to_ms(objspace->profile.sweeping_time_ns));
+
+    {
+        uint64_t total_malloc = (uint64_t)gc_counter_load_relaxed(&objspace->malloc_counters.counters.malloc);
+        uint64_t total_free   = (uint64_t)gc_counter_load_relaxed(&objspace->malloc_counters.counters.free);
+        SET64(total_malloc_bytes, total_malloc);
+        SET64(total_free_bytes, total_free);
+    }
+
+    /* implementation dependent counters (small / fixnum-safe) */
+    SET(heap_allocated_pages, rb_darray_size(objspace->heap_pages.sorted));
+    SET(heap_empty_pages, objspace->empty_pages_count)
+    SET(heap_allocatable_bytes, objspace->heap_pages.allocatable_bytes);
+    SET(heap_eden_pages, heap_eden_total_pages(objspace));
+    SET(total_allocated_pages, objspace->heap_pages.allocated_pages);
+    SET(total_freed_pages, objspace->heap_pages.freed_pages);
+    SET(malloc_increase_bytes, gc_malloc_counters_increase_unsigned(objspace, &objspace->malloc_counters.counters));
+    SET(malloc_increase_bytes_limit, malloc_limit);
+    SET(minor_gc_count, objspace->profile.minor_gc_count);
+    SET(major_gc_count, objspace->profile.major_gc_count);
+    SET(compact_count, objspace->profile.compact_count);
+    SET(read_barrier_faults, objspace->profile.read_barrier_faults);
+    SET(total_moved_objects, objspace->rcompactor.total_moved);
+    SET(remembered_wb_unprotected_objects, objspace->rgengc.uncollectible_wb_unprotected_objects);
+    SET(remembered_wb_unprotected_objects_limit, objspace->rgengc.uncollectible_wb_unprotected_objects_limit);
+    SET(old_objects, objspace->rgengc.old_objects);
+    SET(old_objects_limit, objspace->rgengc.old_objects_limit);
+#if RGENGC_ESTIMATE_OLDMALLOC
+    SET(oldmalloc_increase_bytes, gc_malloc_counters_increase_unsigned(objspace, &objspace->malloc_counters.oldcounters));
+    SET(oldmalloc_increase_bytes_limit, objspace->rgengc.oldmalloc_increase_limit);
+#endif
+
+    ractor_cache_flush_count(objspace, rb_gc_get_ractor_newobj_cache());
+    SET(total_allocated_objects, total_allocated_objects(objspace));
+    SET(total_freed_objects, total_freed_objects(objspace));
+    SET(heap_available_slots, objspace_available_slots(objspace));
+    SET(heap_live_slots, objspace_live_slots(objspace));
+    SET(heap_free_slots, objspace_free_slots(objspace));
+    SET(heap_final_slots, total_final_slots_count(objspace));
+    SET(heap_marked_slots, objspace->marked_slots);
+
+#if RGENGC_PROFILE
+    SET(total_generated_normal_object_count, objspace->profile.total_generated_normal_object_count);
+    SET(total_generated_shady_object_count, objspace->profile.total_generated_shady_object_count);
+    SET(total_shade_operation_count, objspace->profile.total_shade_operation_count);
+    SET(total_promoted_count, objspace->profile.total_promoted_count);
+    SET(total_remembered_normal_object_count, objspace->profile.total_remembered_normal_object_count);
+    SET(total_remembered_shady_object_count, objspace->profile.total_remembered_shady_object_count);
+#endif /* RGENGC_PROFILE */
+#undef SET
+#undef SET64
+
+    if (!NIL_P(key)) {
+        // Matched key should return above
+        return Qundef;
+    }
+
+#if defined(RGENGC_PROFILE) && RGENGC_PROFILE >= 2
+    if (hash != Qnil) {
+        gc_count_add_each_types(hash, "generated_normal_object_count_types", objspace->profile.generated_normal_object_count_types);
+        gc_count_add_each_types(hash, "generated_shady_object_count_types", objspace->profile.generated_shady_object_count_types);
+        gc_count_add_each_types(hash, "shade_operation_count_types", objspace->profile.shade_operation_count_types);
+        gc_count_add_each_types(hash, "promoted_types", objspace->profile.promoted_types);
+        gc_count_add_each_types(hash, "remembered_normal_object_count_types", objspace->profile.remembered_normal_object_count_types);
+        gc_count_add_each_types(hash, "remembered_shady_object_count_types", objspace->profile.remembered_shady_object_count_types);
+    }
+#endif
+
+    return hash;
+}
+
+enum gc_stat_heap_sym {
+    gc_stat_heap_sym_slot_size,
+    gc_stat_heap_sym_heap_live_slots,
+    gc_stat_heap_sym_heap_free_slots,
+    gc_stat_heap_sym_heap_final_slots,
+    gc_stat_heap_sym_heap_eden_pages,
+    gc_stat_heap_sym_heap_eden_slots,
+    gc_stat_heap_sym_total_allocated_pages,
+    gc_stat_heap_sym_force_major_gc_count,
+    gc_stat_heap_sym_force_incremental_marking_finish_count,
+    gc_stat_heap_sym_heap_allocatable_slots,
+    gc_stat_heap_sym_total_allocated_objects,
+    gc_stat_heap_sym_total_freed_objects,
+    gc_stat_heap_sym_last
+};
+
+static VALUE gc_stat_heap_symbols[gc_stat_heap_sym_last];
+
+static void
+setup_gc_stat_heap_symbols(void)
+{
+    if (gc_stat_heap_symbols[0] == 0) {
+#define S(s) gc_stat_heap_symbols[gc_stat_heap_sym_##s] = ID2SYM(rb_intern_const(#s))
+        S(slot_size);
+        S(heap_live_slots);
+        S(heap_free_slots);
+        S(heap_final_slots);
+        S(heap_eden_pages);
+        S(heap_eden_slots);
+        S(heap_allocatable_slots);
+        S(total_allocated_pages);
+        S(force_major_gc_count);
+        S(force_incremental_marking_finish_count);
+        S(total_allocated_objects);
+        S(total_freed_objects);
+#undef S
+    }
+}
+
+static VALUE
+stat_one_heap(rb_objspace_t *objspace, rb_heap_t *heap, VALUE hash, VALUE key)
+{
+#define SET(name, attr) \
+    if (key == gc_stat_heap_symbols[gc_stat_heap_sym_##name]) \
+        return SIZET2NUM(attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, gc_stat_heap_symbols[gc_stat_heap_sym_##name], SIZET2NUM(attr));
+
+    SET(slot_size, heap->slot_size);
+    SET(heap_live_slots, heap->total_allocated_objects - heap->total_freed_objects - heap->final_slots_count);
+    SET(heap_free_slots, heap->total_slots - (heap->total_allocated_objects - heap->total_freed_objects));
+    SET(heap_final_slots, heap->final_slots_count);
+    SET(heap_eden_pages, heap->total_pages);
+    SET(heap_eden_slots, heap->total_slots);
+    SET(heap_allocatable_slots, objspace->heap_pages.allocatable_bytes / heap->slot_size);
+    SET(total_allocated_pages, heap->total_allocated_pages);
+    SET(force_major_gc_count, heap->force_major_gc_count);
+    SET(force_incremental_marking_finish_count, heap->force_incremental_marking_finish_count);
+    SET(total_allocated_objects, heap->total_allocated_objects);
+    SET(total_freed_objects, heap->total_freed_objects);
+#undef SET
+
+    if (!NIL_P(key)) {
+        // Matched key should return above
+        return Qundef;
+    }
+
+    return hash;
+}
+
+VALUE
+rb_gc_impl_stat_heap(void *objspace_ptr, VALUE heap_name, VALUE hash_or_sym)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    ractor_cache_flush_count(objspace, rb_gc_get_ractor_newobj_cache());
+
+    setup_gc_stat_heap_symbols();
+
+    if (NIL_P(heap_name)) {
+        if (!RB_TYPE_P(hash_or_sym, T_HASH)) {
+            rb_bug("non-hash given");
+        }
+
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            VALUE hash = rb_hash_aref(hash_or_sym, INT2FIX(i));
+            if (NIL_P(hash)) {
+                hash = rb_hash_new();
+                rb_hash_aset(hash_or_sym, INT2FIX(i), hash);
+            }
+
+            stat_one_heap(objspace, &heaps[i], hash, Qnil);
+        }
+    }
+    else if (FIXNUM_P(heap_name)) {
+        int heap_idx = FIX2INT(heap_name);
+
+        if (heap_idx < 0 || heap_idx >= HEAP_COUNT) {
+            rb_raise(rb_eArgError, "size pool index out of range");
+        }
+
+        if (SYMBOL_P(hash_or_sym)) {
+            return stat_one_heap(objspace, &heaps[heap_idx], Qnil, hash_or_sym);
+        }
+        else if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+            return stat_one_heap(objspace, &heaps[heap_idx], hash_or_sym, Qnil);
+        }
+        else {
+            rb_bug("non-hash or symbol given");
+        }
+    }
+    else {
+        rb_bug("heap_name must be nil or an Integer");
+    }
+
+    return hash_or_sym;
+}
+
+/* I could include internal.h for this, but doing so undefines some Array macros
+ * necessary for initialising objects, and I don't want to include all the array
+ * headers to get them back
+ * TODO: Investigate why RARRAY_AREF gets undefined in internal.h
+ */
+#ifndef RBOOL
+#define RBOOL(v) (v ? Qtrue : Qfalse)
+#endif
+
+VALUE
+rb_gc_impl_config_get(void *objspace_ptr)
+{
+#define sym(name) ID2SYM(rb_intern_const(name))
+    rb_objspace_t *objspace = objspace_ptr;
+    VALUE hash = rb_hash_new();
+
+    rb_hash_aset(hash, sym("rgengc_allow_full_mark"), RBOOL(gc_config_full_mark_val));
+
+    return hash;
+}
+
+static int
+gc_config_set_key(VALUE key, VALUE value, VALUE data)
+{
+    rb_objspace_t *objspace = (rb_objspace_t *)data;
+    if (rb_sym2id(key) == rb_intern("rgengc_allow_full_mark")) {
+        gc_rest(objspace);
+        gc_config_full_mark_set(RTEST(value));
+    }
+    return ST_CONTINUE;
+}
+
+void
+rb_gc_impl_config_set(void *objspace_ptr, VALUE hash)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (!RB_TYPE_P(hash, T_HASH)) {
+        rb_raise(rb_eArgError, "expected keyword arguments");
+    }
+
+    rb_hash_foreach(hash, gc_config_set_key, (st_data_t)objspace);
+}
+
+VALUE
+rb_gc_impl_stress_get(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    return ruby_gc_stress_mode;
+}
+
+void
+rb_gc_impl_stress_set(void *objspace_ptr, VALUE flag)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    objspace->flags.gc_stressful = RTEST(flag);
+    objspace->gc_stress_mode = flag;
+}
+
+static int
+get_envparam_size(const char *name, size_t *default_value, size_t lower_bound)
+{
+    const char *ptr = getenv(name);
+    ssize_t val;
+
+    if (ptr != NULL && *ptr) {
+        size_t unit = 0;
+        char *end;
+#if SIZEOF_SIZE_T == SIZEOF_LONG_LONG
+        val = strtoll(ptr, &end, 0);
+#else
+        val = strtol(ptr, &end, 0);
+#endif
+        switch (*end) {
+          case 'k': case 'K':
+            unit = 1024;
+            ++end;
+            break;
+          case 'm': case 'M':
+            unit = 1024*1024;
+            ++end;
+            break;
+          case 'g': case 'G':
+            unit = 1024*1024*1024;
+            ++end;
+            break;
+        }
+        while (*end && isspace((unsigned char)*end)) end++;
+        if (*end) {
+            if (RTEST(ruby_verbose)) fprintf(stderr, "invalid string for %s: %s\n", name, ptr);
+            return 0;
+        }
+        if (unit > 0) {
+            if (val < -(ssize_t)(SIZE_MAX / 2 / unit) || (ssize_t)(SIZE_MAX / 2 / unit) < val) {
+                if (RTEST(ruby_verbose)) fprintf(stderr, "%s=%s is ignored because it overflows\n", name, ptr);
+                return 0;
+            }
+            val *= unit;
+        }
+        if (val > 0 && (size_t)val > lower_bound) {
+            if (RTEST(ruby_verbose)) {
+                fprintf(stderr, "%s=%"PRIdSIZE" (default value: %"PRIuSIZE")\n", name, val, *default_value);
+            }
+            *default_value = (size_t)val;
+            return 1;
+        }
+        else {
+            if (RTEST(ruby_verbose)) {
+                fprintf(stderr, "%s=%"PRIdSIZE" (default value: %"PRIuSIZE") is ignored because it must be greater than %"PRIuSIZE".\n",
+                        name, val, *default_value, lower_bound);
+            }
+            return 0;
+        }
+    }
+    return 0;
+}
+
+static int
+get_envparam_double(const char *name, double *default_value, double lower_bound, double upper_bound, int accept_zero)
+{
+    const char *ptr = getenv(name);
+    double val;
+
+    if (ptr != NULL && *ptr) {
+        char *end;
+        val = strtod(ptr, &end);
+        if (!*ptr || *end) {
+            if (RTEST(ruby_verbose)) fprintf(stderr, "invalid string for %s: %s\n", name, ptr);
+            return 0;
+        }
+
+        if (accept_zero && val == 0.0) {
+            goto accept;
+        }
+        else if (val <= lower_bound) {
+            if (RTEST(ruby_verbose)) {
+                fprintf(stderr, "%s=%f (default value: %f) is ignored because it must be greater than %f.\n",
+                        name, val, *default_value, lower_bound);
+            }
+        }
+        else if (upper_bound != 0.0 && /* ignore upper_bound if it is 0.0 */
+                 val > upper_bound) {
+            if (RTEST(ruby_verbose)) {
+                fprintf(stderr, "%s=%f (default value: %f) is ignored because it must be lower than %f.\n",
+                        name, val, *default_value, upper_bound);
+            }
+        }
+        else {
+            goto accept;
+        }
+    }
+    return 0;
+
+  accept:
+    if (RTEST(ruby_verbose)) fprintf(stderr, "%s=%f (default value: %f)\n", name, val, *default_value);
+    *default_value = val;
+    return 1;
+}
+
+/*
+ * GC tuning environment variables
+ *
+ * * RUBY_GC_HEAP_FREE_SLOTS
+ *   - Prepare at least this amount of slots after GC.
+ *   - Allocate slots if there are not enough slots.
+ * * RUBY_GC_HEAP_GROWTH_FACTOR (new from 2.1)
+ *   - Allocate slots by this factor.
+ *   - (next slots number) = (current slots number) * (this factor)
+ * * RUBY_GC_HEAP_GROWTH_MAX_BYTES (was RUBY_GC_HEAP_GROWTH_MAX_SLOTS)
+ *   - Allocation rate is limited to this number of bytes.
+ * * RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO (new from 2.4)
+ *   - Allocate additional pages when the number of free slots is
+ *     lower than the value (total_slots * (this ratio)).
+ * * RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO (new from 2.4)
+ *   - Allocate slots to satisfy this formula:
+ *       free_slots = total_slots * goal_ratio
+ *   - In other words, prepare (total_slots * goal_ratio) free slots.
+ *   - if this value is 0.0, then use RUBY_GC_HEAP_GROWTH_FACTOR directly.
+ * * RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO (new from 2.4)
+ *   - Allow to free pages when the number of free slots is
+ *     greater than the value (total_slots * (this ratio)).
+ * * RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR (new from 2.1.1)
+ *   - Do full GC when the number of old objects is more than R * N
+ *     where R is this factor and
+ *           N is the number of old objects just after last full GC.
+ *
+ *  * obsolete
+ *    * RUBY_FREE_MIN       -> RUBY_GC_HEAP_FREE_SLOTS (from 2.1)
+ *    * RUBY_HEAP_MIN_SLOTS -> RUBY_GC_HEAP_INIT_SLOTS (from 2.1) -> RUBY_GC_HEAP_INIT_BYTES
+ *
+ * * RUBY_GC_MALLOC_LIMIT
+ * * RUBY_GC_MALLOC_LIMIT_MAX (new from 2.1)
+ * * RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR (new from 2.1)
+ *
+ * * RUBY_GC_OLDMALLOC_LIMIT (new from 2.1)
+ * * RUBY_GC_OLDMALLOC_LIMIT_MAX (new from 2.1)
+ * * RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR (new from 2.1)
+ */
+
+void
+rb_gc_impl_set_params(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    /* RUBY_GC_HEAP_FREE_SLOTS */
+    if (get_envparam_size("RUBY_GC_HEAP_FREE_SLOTS", &gc_params.heap_free_slots, 0)) {
+        /* ok */
+    }
+
+    get_envparam_size("RUBY_GC_HEAP_INIT_BYTES", &gc_params.heap_init_bytes, 0);
+
+    get_envparam_double("RUBY_GC_HEAP_GROWTH_FACTOR", &gc_params.growth_factor, 1.0, 0.0, FALSE);
+    get_envparam_size  ("RUBY_GC_HEAP_GROWTH_MAX_BYTES", &gc_params.growth_max_bytes, 0);
+    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO", &gc_params.heap_free_slots_min_ratio,
+                        0.0, 1.0, FALSE);
+    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO", &gc_params.heap_free_slots_max_ratio,
+                        gc_params.heap_free_slots_min_ratio, 1.0, FALSE);
+    get_envparam_double("RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO", &gc_params.heap_free_slots_goal_ratio,
+                        gc_params.heap_free_slots_min_ratio, gc_params.heap_free_slots_max_ratio, TRUE);
+    get_envparam_double("RUBY_GC_HEAP_OLDOBJECT_LIMIT_FACTOR", &gc_params.oldobject_limit_factor, 0.0, 0.0, TRUE);
+    get_envparam_double("RUBY_GC_HEAP_REMEMBERED_WB_UNPROTECTED_OBJECTS_LIMIT_RATIO", &gc_params.uncollectible_wb_unprotected_objects_limit_ratio, 0.0, 0.0, TRUE);
+
+    if (get_envparam_size("RUBY_GC_MALLOC_LIMIT", &gc_params.malloc_limit_min, 0)) {
+        malloc_limit = gc_params.malloc_limit_min;
+    }
+    get_envparam_size  ("RUBY_GC_MALLOC_LIMIT_MAX", &gc_params.malloc_limit_max, 0);
+    if (!gc_params.malloc_limit_max) { /* ignore max-check if 0 */
+        gc_params.malloc_limit_max = SIZE_MAX;
+    }
+    get_envparam_double("RUBY_GC_MALLOC_LIMIT_GROWTH_FACTOR", &gc_params.malloc_limit_growth_factor, 1.0, 0.0, FALSE);
+
+#if RGENGC_ESTIMATE_OLDMALLOC
+    if (get_envparam_size("RUBY_GC_OLDMALLOC_LIMIT", &gc_params.oldmalloc_limit_min, 0)) {
+        objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
+    }
+    get_envparam_size  ("RUBY_GC_OLDMALLOC_LIMIT_MAX", &gc_params.oldmalloc_limit_max, 0);
+    get_envparam_double("RUBY_GC_OLDMALLOC_LIMIT_GROWTH_FACTOR", &gc_params.oldmalloc_limit_growth_factor, 1.0, 0.0, FALSE);
+#endif
+}
+
+static inline size_t
+objspace_malloc_size(rb_objspace_t *objspace, void *ptr, size_t hint)
+{
+#ifdef HAVE_MALLOC_USABLE_SIZE
+    if (!hint) {
+        hint = malloc_usable_size(ptr);
+    }
+#endif
+    return hint;
+}
+
+enum memop_type {
+    MEMOP_TYPE_MALLOC  = 0,
+    MEMOP_TYPE_FREE,
+    MEMOP_TYPE_REALLOC
+};
+
+static inline void
+atomic_sub_nounderflow(size_t *var, size_t sub)
+{
+    if (sub == 0) return;
+
+    while (1) {
+        size_t val = *var;
+        if (val < sub) sub = val;
+        if (RUBY_ATOMIC_SIZE_CAS(*var, val, val-sub) == val) break;
+    }
+}
+
+#define gc_stress_full_mark_after_malloc_p() \
+    (FIXNUM_P(ruby_gc_stress_mode) && (FIX2LONG(ruby_gc_stress_mode) & (1<<gc_stress_full_mark_after_malloc)))
+
+static void
+objspace_malloc_gc_stress(rb_objspace_t *objspace)
+{
+    if (ruby_gc_stressful && ruby_native_thread_p()) {
+        unsigned int reason = (GPR_FLAG_IMMEDIATE_MARK | GPR_FLAG_IMMEDIATE_SWEEP |
+                               GPR_FLAG_STRESS | GPR_FLAG_MALLOC);
+
+        if (gc_stress_full_mark_after_malloc_p()) {
+            reason |= GPR_FLAG_FULL_MARK;
+        }
+        garbage_collect_with_gvl(objspace, reason);
+    }
+}
+
+static void
+malloc_increase_commit(rb_objspace_t *objspace, size_t new_size, size_t old_size)
+{
+    if (new_size > old_size) {
+        size_t delta = new_size - old_size;
+        MALLOC_COUNTERS_LOCK(objspace);
+        gc_counter_add(&objspace->malloc_counters.counters.malloc, delta);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        gc_counter_add(&objspace->malloc_counters.oldcounters.malloc, delta);
+#endif
+        MALLOC_COUNTERS_UNLOCK(objspace);
+    }
+    else if (old_size > new_size) {
+        size_t delta = old_size - new_size;
+        MALLOC_COUNTERS_LOCK(objspace);
+        gc_counter_add(&objspace->malloc_counters.counters.free, delta);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        gc_counter_add(&objspace->malloc_counters.oldcounters.free, delta);
+#endif
+        MALLOC_COUNTERS_UNLOCK(objspace);
+    }
+}
+
+#if USE_MALLOC_INCREASE_LOCAL
+static void
+malloc_increase_local_flush(rb_objspace_t *objspace)
+{
+    int delta = malloc_increase_local;
+    if (delta == 0) return;
+
+    malloc_increase_local = 0;
+    if (delta > 0) {
+        malloc_increase_commit(objspace, (size_t)delta, 0);
+    }
+    else {
+        malloc_increase_commit(objspace, 0, (size_t)(-delta));
+    }
+}
+#else
+static void
+malloc_increase_local_flush(rb_objspace_t *objspace)
+{
+}
+#endif
+
+static inline bool
+objspace_malloc_increase_report(rb_objspace_t *objspace, void *mem, size_t new_size, size_t old_size, enum memop_type type, bool gc_allowed)
+{
+    if (0) fprintf(stderr, "increase - ptr: %p, type: %s, new_size: %"PRIdSIZE", old_size: %"PRIdSIZE"\n",
+                   mem,
+                   type == MEMOP_TYPE_MALLOC  ? "malloc" :
+                   type == MEMOP_TYPE_FREE    ? "free  " :
+                   type == MEMOP_TYPE_REALLOC ? "realloc": "error",
+                   new_size, old_size);
+    return false;
+}
+
+static bool
+objspace_malloc_increase_body(rb_objspace_t *objspace, void *mem, size_t new_size, size_t old_size, enum memop_type type, bool gc_allowed)
+{
+#if USE_MALLOC_INCREASE_LOCAL
+    if (new_size < GC_MALLOC_INCREASE_LOCAL_THRESHOLD &&
+        old_size < GC_MALLOC_INCREASE_LOCAL_THRESHOLD) {
+        malloc_increase_local += (int)new_size - (int)old_size;
+
+        if (malloc_increase_local >= GC_MALLOC_INCREASE_LOCAL_THRESHOLD ||
+            malloc_increase_local <= -GC_MALLOC_INCREASE_LOCAL_THRESHOLD) {
+            malloc_increase_local_flush(objspace);
+        }
+    }
+    else {
+        malloc_increase_local_flush(objspace);
+        malloc_increase_commit(objspace, new_size, old_size);
+    }
+#else
+    malloc_increase_commit(objspace, new_size, old_size);
+#endif
+
+    if (type == MEMOP_TYPE_MALLOC && gc_allowed) {
+      retry:
+        if (malloc_increase > malloc_limit && ruby_native_thread_p() && !dont_gc_val()) {
+            if (ruby_thread_has_gvl_p() && is_lazy_sweeping(objspace)) {
+                gc_rest(objspace); /* gc_rest can reduce malloc_increase */
+                goto retry;
+            }
+            garbage_collect_with_gvl(objspace, GPR_FLAG_MALLOC);
+        }
+    }
+
+#if MALLOC_ALLOCATED_SIZE
+    if (new_size >= old_size) {
+        RUBY_ATOMIC_SIZE_ADD(objspace->malloc_params.allocated_size, new_size - old_size);
+    }
+    else {
+        size_t dec_size = old_size - new_size;
+
+#if MALLOC_ALLOCATED_SIZE_CHECK
+        size_t allocated_size = objspace->malloc_params.allocated_size;
+        if (allocated_size < dec_size) {
+            rb_bug("objspace_malloc_increase: underflow malloc_params.allocated_size.");
+        }
+#endif
+        atomic_sub_nounderflow(&objspace->malloc_params.allocated_size, dec_size);
+    }
+
+    switch (type) {
+      case MEMOP_TYPE_MALLOC:
+        RUBY_ATOMIC_SIZE_INC(objspace->malloc_params.allocations);
+        break;
+      case MEMOP_TYPE_FREE:
+        {
+            size_t allocations = objspace->malloc_params.allocations;
+            if (allocations > 0) {
+                atomic_sub_nounderflow(&objspace->malloc_params.allocations, 1);
+            }
+#if MALLOC_ALLOCATED_SIZE_CHECK
+            else {
+                GC_ASSERT(objspace->malloc_params.allocations > 0);
+            }
+#endif
+        }
+        break;
+      case MEMOP_TYPE_REALLOC: /* ignore */ break;
+    }
+#endif
+    return true;
+}
+
+#define objspace_malloc_increase(...) \
+    for (bool malloc_increase_done = objspace_malloc_increase_report(__VA_ARGS__); \
+         !malloc_increase_done; \
+         malloc_increase_done = objspace_malloc_increase_body(__VA_ARGS__))
+
+struct malloc_obj_info { /* 4 words */
+    size_t size;
+};
+
+static inline size_t
+objspace_malloc_prepare(rb_objspace_t *objspace, size_t size)
+{
+    if (size == 0) size = 1;
+
+#if CALC_EXACT_MALLOC_SIZE
+    size += sizeof(struct malloc_obj_info);
+#endif
+
+    return size;
+}
+
+static bool
+malloc_during_gc_p(rb_objspace_t *objspace)
+{
+    /* malloc is not allowed during GC when we're not using multiple ractors
+     * (since ractors can run while another thread is sweeping) and when we
+     * have the GVL (since if we don't have the GVL, we'll try to acquire the
+     * GVL which will block and ensure the other thread finishes GC). */
+    return during_gc && !dont_gc_val() && !rb_gc_multi_ractor_p() && ruby_thread_has_gvl_p();
+}
+
+static inline void *
+objspace_malloc_fixup(rb_objspace_t *objspace, void *mem, size_t size, bool gc_allowed)
+{
+    size = objspace_malloc_size(objspace, mem, size);
+    objspace_malloc_increase(objspace, mem, size, 0, MEMOP_TYPE_MALLOC, gc_allowed) {}
+
+#if CALC_EXACT_MALLOC_SIZE
+    {
+        struct malloc_obj_info *info = mem;
+        info->size = size;
+        mem = info + 1;
+    }
+#endif
+
+    return mem;
+}
+
+#if defined(__GNUC__) && RUBY_DEBUG
+#define RB_BUG_INSTEAD_OF_RB_MEMERROR 1
+#endif
+
+#ifndef RB_BUG_INSTEAD_OF_RB_MEMERROR
+# define RB_BUG_INSTEAD_OF_RB_MEMERROR 0
+#endif
+
+#define GC_MEMERROR(...) \
+    ((RB_BUG_INSTEAD_OF_RB_MEMERROR+0) ? rb_bug("" __VA_ARGS__) : (void)0)
+
+#define TRY_WITH_GC(siz, expr) do {                          \
+        const gc_profile_record_flag gpr =                   \
+            GPR_FLAG_FULL_MARK           |                   \
+            GPR_FLAG_IMMEDIATE_MARK      |                   \
+            GPR_FLAG_IMMEDIATE_SWEEP     |                   \
+            GPR_FLAG_MALLOC;                                 \
+        objspace_malloc_gc_stress(objspace);                 \
+                                                             \
+        if (RB_LIKELY((expr))) {                             \
+            /* Success on 1st try */                         \
+        }                                                    \
+        else if (gc_allowed && !garbage_collect_with_gvl(objspace, gpr)) { \
+            /* @shyouhei thinks this doesn't happen */       \
+            GC_MEMERROR("TRY_WITH_GC: could not GC");        \
+        }                                                    \
+        else if ((expr)) {                                   \
+            /* Success on 2nd try */                         \
+        }                                                    \
+        else {                                               \
+            GC_MEMERROR("TRY_WITH_GC: could not allocate:"   \
+                        "%"PRIdSIZE" bytes for %s",          \
+                        siz, # expr);                        \
+        }                                                    \
+    } while (0)
+
+static void
+check_malloc_not_in_gc(rb_objspace_t *objspace, const char *msg)
+{
+    if (RB_UNLIKELY(malloc_during_gc_p(objspace))) {
+        dont_gc_on();
+        during_gc = false;
+        rb_bug("Cannot %s during GC", msg);
+    }
+}
+
+void
+rb_gc_impl_free(void *objspace_ptr, void *ptr, size_t old_size)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (!ptr) {
+        /*
+         * ISO/IEC 9899 says "If ptr is a null pointer, no action occurs" since
+         * its first version.  We would better follow.
+         */
+        return;
+    }
+#if CALC_EXACT_MALLOC_SIZE
+    struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
+#if VERIFY_FREE_SIZE
+    if (!info->size) {
+        rb_bug("buffer %p has no recorded size. Was it allocated with ruby_mimalloc? If so it should be freed with ruby_mimfree", ptr);
+    }
+
+    if (old_size && (old_size + sizeof(struct malloc_obj_info)) != info->size) {
+        rb_bug("buffer %p freed with old_size=%zu, but was allocated with size=%zu", ptr, old_size, info->size - sizeof(struct malloc_obj_info));
+    }
+#endif
+    ptr = info;
+    old_size = info->size;
+#endif
+    old_size = objspace_malloc_size(objspace, ptr, old_size);
+
+    objspace_malloc_increase(objspace, ptr, 0, old_size, MEMOP_TYPE_FREE, true) {
+        free(ptr);
+        ptr = NULL;
+        RB_DEBUG_COUNTER_INC(heap_xfree);
+    }
+}
+
+void *
+rb_gc_impl_malloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+    check_malloc_not_in_gc(objspace, "malloc");
+
+    void *mem;
+
+    size = objspace_malloc_prepare(objspace, size);
+    TRY_WITH_GC(size, mem = malloc(size));
+    RB_DEBUG_COUNTER_INC(heap_xmalloc);
+    if (!mem) return mem;
+    return objspace_malloc_fixup(objspace, mem, size, gc_allowed);
+}
+
+void *
+rb_gc_impl_calloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (RB_UNLIKELY(malloc_during_gc_p(objspace))) {
+        rb_warn("calloc during GC detected, this could cause crashes if it triggers another GC");
+#if RGENGC_CHECK_MODE || RUBY_DEBUG
+        rb_bug("Cannot calloc during GC");
+#endif
+    }
+
+    void *mem;
+
+    size = objspace_malloc_prepare(objspace, size);
+    TRY_WITH_GC(size, mem = calloc1(size));
+    if (!mem) return mem;
+    return objspace_malloc_fixup(objspace, mem, size, gc_allowed);
+}
+
+void *
+rb_gc_impl_realloc(void *objspace_ptr, void *ptr, size_t new_size, size_t old_size, bool gc_allowed)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    check_malloc_not_in_gc(objspace, "realloc");
+
+    void *mem;
+
+    if (!ptr) return rb_gc_impl_malloc(objspace, new_size, gc_allowed);
+
+    /*
+     * The behavior of realloc(ptr, 0) is implementation defined.
+     * Therefore we don't use realloc(ptr, 0) for portability reason.
+     * see http://www.open-std.org/jtc1/sc22/wg14/www/docs/dr_400.htm
+     */
+    if (new_size == 0) {
+        if ((mem = rb_gc_impl_malloc(objspace, 0, gc_allowed)) != NULL) {
+            /*
+             * - OpenBSD's malloc(3) man page says that when 0 is passed, it
+             *   returns a non-NULL pointer to an access-protected memory page.
+             *   The returned pointer cannot be read / written at all, but
+             *   still be a valid argument of free().
+             *
+             *   https://man.openbsd.org/malloc.3
+             *
+             * - Linux's malloc(3) man page says that it _might_ perhaps return
+             *   a non-NULL pointer when its argument is 0.  That return value
+             *   is safe (and is expected) to be passed to free().
+             *
+             *   https://man7.org/linux/man-pages/man3/malloc.3.html
+             *
+             * - As I read the implementation jemalloc's malloc() returns fully
+             *   normal 16 bytes memory region when its argument is 0.
+             *
+             * - As I read the implementation musl libc's malloc() returns
+             *   fully normal 32 bytes memory region when its argument is 0.
+             *
+             * - Other malloc implementations can also return non-NULL.
+             */
+            rb_gc_impl_free(objspace, ptr, old_size);
+            return mem;
+        }
+        else {
+            /*
+             * It is dangerous to return NULL here, because that could lead to
+             * RCE.  Fallback to 1 byte instead of zero.
+             *
+             * https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2019-11932
+             */
+            new_size = 1;
+        }
+    }
+
+#if CALC_EXACT_MALLOC_SIZE
+    {
+        struct malloc_obj_info *info = (struct malloc_obj_info *)ptr - 1;
+        new_size += sizeof(struct malloc_obj_info);
+        ptr = info;
+#if VERIFY_FREE_SIZE
+        if (old_size && (old_size + sizeof(struct malloc_obj_info)) != info->size) {
+            rb_bug("buffer %p realloced with old_size=%zu, but was allocated with size=%zu", ptr, old_size, info->size - sizeof(struct malloc_obj_info));
+        }
+#endif
+        old_size = info->size;
+    }
+#endif
+
+    old_size = objspace_malloc_size(objspace, ptr, old_size);
+    TRY_WITH_GC(new_size, mem = RB_GNUC_EXTENSION_BLOCK(realloc(ptr, new_size)));
+    if (!mem) return mem;
+    new_size = objspace_malloc_size(objspace, mem, new_size);
+
+#if CALC_EXACT_MALLOC_SIZE
+    {
+        struct malloc_obj_info *info = mem;
+        info->size = new_size;
+        mem = info + 1;
+    }
+#endif
+
+    objspace_malloc_increase(objspace, mem, new_size, old_size, MEMOP_TYPE_REALLOC, gc_allowed);
+
+    RB_DEBUG_COUNTER_INC(heap_xrealloc);
+    return mem;
+}
+
+void
+rb_gc_impl_adjust_memory_usage(void *objspace_ptr, ssize_t diff)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (diff > 0) {
+        objspace_malloc_increase(objspace, 0, diff, 0, MEMOP_TYPE_REALLOC, true);
+    }
+    else if (diff < 0) {
+        objspace_malloc_increase(objspace, 0, 0, -diff, MEMOP_TYPE_REALLOC, true);
+    }
+}
+
+// TODO: move GC profiler stuff back into gc.c
+/*
+  ------------------------------ GC profiler ------------------------------
+*/
+
+#define GC_PROFILE_RECORD_DEFAULT_SIZE 100
+
+static bool
+current_process_time(struct timespec *ts)
+{
+#if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_PROCESS_CPUTIME_ID)
+    {
+        static int try_clock_gettime = 1;
+        if (try_clock_gettime && clock_gettime(CLOCK_PROCESS_CPUTIME_ID, ts) == 0) {
+            return true;
+        }
+        else {
+            try_clock_gettime = 0;
+        }
+    }
+#endif
+
+#ifdef RUSAGE_SELF
+    {
+        struct rusage usage;
+        struct timeval time;
+        if (getrusage(RUSAGE_SELF, &usage) == 0) {
+            time = usage.ru_utime;
+            ts->tv_sec = time.tv_sec;
+            ts->tv_nsec = (int32_t)time.tv_usec * 1000;
+            return true;
+        }
+    }
+#endif
+
+#ifdef _WIN32
+    {
+        FILETIME creation_time, exit_time, kernel_time, user_time;
+        ULARGE_INTEGER ui;
+
+        if (GetProcessTimes(GetCurrentProcess(),
+                            &creation_time, &exit_time, &kernel_time, &user_time) != 0) {
+            memcpy(&ui, &user_time, sizeof(FILETIME));
+#define PER100NSEC (uint64_t)(1000 * 1000 * 10)
+            ts->tv_nsec = (long)(ui.QuadPart % PER100NSEC);
+            ts->tv_sec  = (time_t)(ui.QuadPart / PER100NSEC);
+            return true;
+        }
+    }
+#endif
+
+    return false;
+}
+
+static double
+getrusage_time(void)
+{
+    struct timespec ts;
+    if (current_process_time(&ts)) {
+        return ts.tv_sec + ts.tv_nsec * 1e-9;
+    }
+    else {
+        return 0.0;
+    }
+}
+
+
+static inline void
+gc_prof_setup_new_record(rb_objspace_t *objspace, unsigned int reason)
+{
+    if (objspace->profile.run) {
+        size_t index = objspace->profile.next_index;
+        gc_profile_record *record;
+
+        /* create new record */
+        objspace->profile.next_index++;
+
+        if (!objspace->profile.records) {
+            objspace->profile.size = GC_PROFILE_RECORD_DEFAULT_SIZE;
+            objspace->profile.records = malloc(xmalloc2_size(sizeof(gc_profile_record), objspace->profile.size));
+        }
+        if (index >= objspace->profile.size) {
+            void *ptr;
+            objspace->profile.size += 1000;
+            ptr = realloc(objspace->profile.records, xmalloc2_size(sizeof(gc_profile_record), objspace->profile.size));
+            if (!ptr) rb_memerror();
+            objspace->profile.records = ptr;
+        }
+        if (!objspace->profile.records) {
+            rb_bug("gc_profile malloc or realloc miss");
+        }
+        record = objspace->profile.current_record = &objspace->profile.records[objspace->profile.next_index - 1];
+        MEMZERO(record, gc_profile_record, 1);
+
+        /* setup before-GC parameter */
+        record->flags = reason | (ruby_gc_stressful ? GPR_FLAG_STRESS : 0);
+#if MALLOC_ALLOCATED_SIZE
+        record->allocated_size = malloc_allocated_size;
+#endif
+#if GC_PROFILE_MORE_DETAIL && GC_PROFILE_DETAIL_MEMORY
+#ifdef RUSAGE_SELF
+        {
+            struct rusage usage;
+            if (getrusage(RUSAGE_SELF, &usage) == 0) {
+                record->maxrss = usage.ru_maxrss;
+                record->minflt = usage.ru_minflt;
+                record->majflt = usage.ru_majflt;
+            }
+        }
+#endif
+#endif
+    }
+}
+
+static inline void
+gc_prof_timer_start(rb_objspace_t *objspace)
+{
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+#if GC_PROFILE_MORE_DETAIL
+        record->prepare_time = objspace->profile.prepare_time;
+#endif
+        record->gc_time = 0;
+        record->gc_invoke_time = getrusage_time();
+    }
+}
+
+static double
+elapsed_time_from(double time)
+{
+    double now = getrusage_time();
+    if (now > time) {
+        return now - time;
+    }
+    else {
+        return 0;
+    }
+}
+
+static inline void
+gc_prof_timer_stop(rb_objspace_t *objspace)
+{
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->gc_time = elapsed_time_from(record->gc_invoke_time);
+        record->gc_invoke_time -= objspace->profile.invoke_time;
+    }
+}
+
+#ifdef BUILDING_MODULAR_GC
+# define RUBY_DTRACE_GC_HOOK(name)
+#else
+# define RUBY_DTRACE_GC_HOOK(name) \
+    do {if (RUBY_DTRACE_GC_##name##_ENABLED()) RUBY_DTRACE_GC_##name();} while (0)
+#endif
+
+static inline void
+gc_prof_mark_timer_start(rb_objspace_t *objspace)
+{
+    RUBY_DTRACE_GC_HOOK(MARK_BEGIN);
+#if GC_PROFILE_MORE_DETAIL
+    if (gc_prof_enabled(objspace)) {
+        gc_prof_record(objspace)->gc_mark_time = getrusage_time();
+    }
+#endif
+}
+
+static inline void
+gc_prof_mark_timer_stop(rb_objspace_t *objspace)
+{
+    RUBY_DTRACE_GC_HOOK(MARK_END);
+#if GC_PROFILE_MORE_DETAIL
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->gc_mark_time = elapsed_time_from(record->gc_mark_time);
+    }
+#endif
+}
+
+static inline void
+gc_prof_sweep_timer_start(rb_objspace_t *objspace)
+{
+    RUBY_DTRACE_GC_HOOK(SWEEP_BEGIN);
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+
+        if (record->gc_time > 0 || GC_PROFILE_MORE_DETAIL) {
+            objspace->profile.gc_sweep_start_time = getrusage_time();
+        }
+    }
+}
+
+static inline void
+gc_prof_sweep_timer_stop(rb_objspace_t *objspace)
+{
+    RUBY_DTRACE_GC_HOOK(SWEEP_END);
+
+    if (gc_prof_enabled(objspace)) {
+        double sweep_time;
+        gc_profile_record *record = gc_prof_record(objspace);
+
+        if (record->gc_time > 0) {
+            sweep_time = elapsed_time_from(objspace->profile.gc_sweep_start_time);
+            /* need to accumulate GC time for lazy sweep after gc() */
+            record->gc_time += sweep_time;
+        }
+        else if (GC_PROFILE_MORE_DETAIL) {
+            sweep_time = elapsed_time_from(objspace->profile.gc_sweep_start_time);
+        }
+
+#if GC_PROFILE_MORE_DETAIL
+        record->gc_sweep_time += sweep_time;
+        if (heap_pages_deferred_final) record->flags |= GPR_FLAG_HAVE_FINALIZE;
+#endif
+        if (heap_pages_deferred_final) objspace->profile.latest_gc_info |= GPR_FLAG_HAVE_FINALIZE;
+    }
+}
+
+static inline void
+gc_prof_set_malloc_info(rb_objspace_t *objspace)
+{
+#if GC_PROFILE_MORE_DETAIL
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+        record->allocate_increase = malloc_increase;
+        record->allocate_limit = malloc_limit;
+    }
+#endif
+}
+
+static inline void
+gc_prof_set_heap_info(rb_objspace_t *objspace)
+{
+    if (gc_prof_enabled(objspace)) {
+        gc_profile_record *record = gc_prof_record(objspace);
+
+        /* Sum across all size pools since each has a different slot size. */
+        size_t total = 0;
+        size_t use_size = 0;
+        size_t total_size = 0;
+        for (int i = 0; i < HEAP_COUNT; i++) {
+            rb_heap_t *heap = &heaps[i];
+            size_t heap_live = heap->total_allocated_objects - heap->total_freed_objects - heap->final_slots_count;
+            total += heap->total_slots;
+            use_size += heap_live * heap->slot_size;
+            total_size += heap->total_slots * heap->slot_size;
+        }
+
+#if GC_PROFILE_MORE_DETAIL
+        size_t live = objspace->profile.total_allocated_objects_at_gc_start - total_freed_objects(objspace);
+        record->heap_use_pages = objspace->profile.heap_used_at_gc_start;
+        record->heap_live_objects = live;
+        record->heap_free_objects = total - live;
+#endif
+
+        record->heap_total_objects = total;
+        record->heap_use_size = use_size;
+        record->heap_total_size = total_size;
+    }
+}
+
+/*
+ *  call-seq:
+ *    GC::Profiler.clear          -> nil
+ *
+ *  Clears the \GC profiler data.
+ *
+ */
+
+static VALUE
+gc_profile_clear(VALUE _)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    void *p = objspace->profile.records;
+    objspace->profile.records = NULL;
+    objspace->profile.size = 0;
+    objspace->profile.next_index = 0;
+    objspace->profile.current_record = 0;
+    free(p);
+    return Qnil;
+}
+
+/*
+ *  call-seq:
+ *     GC::Profiler.raw_data	-> [Hash, ...]
+ *
+ *  Returns an Array of individual raw profile data Hashes ordered
+ *  from earliest to latest by +:GC_INVOKE_TIME+.
+ *
+ *  For example:
+ *
+ *    [
+ *	{
+ *	   :GC_TIME=>1.3000000000000858e-05,
+ *	   :GC_INVOKE_TIME=>0.010634999999999999,
+ *	   :HEAP_USE_SIZE=>289640,
+ *	   :HEAP_TOTAL_SIZE=>588960,
+ *	   :HEAP_TOTAL_OBJECTS=>14724,
+ *	   :GC_IS_MARKED=>false
+ *	},
+ *      # ...
+ *    ]
+ *
+ *  The keys mean:
+ *
+ *  +:GC_TIME+::
+ *	Time elapsed in seconds for this GC run
+ *  +:GC_INVOKE_TIME+::
+ *	Time elapsed in seconds from startup to when the GC was invoked
+ *  +:HEAP_USE_SIZE+::
+ *	Total bytes of heap used
+ *  +:HEAP_TOTAL_SIZE+::
+ *	Total size of heap in bytes
+ *  +:HEAP_TOTAL_OBJECTS+::
+ *	Total number of objects
+ *  +:GC_IS_MARKED+::
+ *	Returns +true+ if the GC is in mark phase
+ *
+ *  If ruby was built with +GC_PROFILE_MORE_DETAIL+, you will also have access
+ *  to the following hash keys:
+ *
+ *  +:GC_MARK_TIME+::
+ *  +:GC_SWEEP_TIME+::
+ *  +:ALLOCATE_INCREASE+::
+ *  +:ALLOCATE_LIMIT+::
+ *  +:HEAP_USE_PAGES+::
+ *  +:HEAP_LIVE_OBJECTS+::
+ *  +:HEAP_FREE_OBJECTS+::
+ *  +:HAVE_FINALIZE+::
+ *
+ */
+
+static VALUE
+gc_profile_record_get(VALUE _)
+{
+    VALUE prof;
+    VALUE gc_profile = rb_ary_new();
+    size_t i;
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    if (!objspace->profile.run) {
+        return Qnil;
+    }
+
+    for (i =0; i < objspace->profile.next_index; i++) {
+        gc_profile_record *record = &objspace->profile.records[i];
+
+        prof = rb_hash_new();
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_FLAGS")), gc_info_decode(objspace, rb_hash_new(), record->flags));
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_TIME")), DBL2NUM(record->gc_time));
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_INVOKE_TIME")), DBL2NUM(record->gc_invoke_time));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_USE_SIZE")), SIZET2NUM(record->heap_use_size));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_TOTAL_SIZE")), SIZET2NUM(record->heap_total_size));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_TOTAL_OBJECTS")), SIZET2NUM(record->heap_total_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("MOVED_OBJECTS")), SIZET2NUM(record->moved_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_IS_MARKED")), Qtrue);
+#if GC_PROFILE_MORE_DETAIL
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_MARK_TIME")), DBL2NUM(record->gc_mark_time));
+        rb_hash_aset(prof, ID2SYM(rb_intern("GC_SWEEP_TIME")), DBL2NUM(record->gc_sweep_time));
+        rb_hash_aset(prof, ID2SYM(rb_intern("ALLOCATE_INCREASE")), SIZET2NUM(record->allocate_increase));
+        rb_hash_aset(prof, ID2SYM(rb_intern("ALLOCATE_LIMIT")), SIZET2NUM(record->allocate_limit));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_USE_PAGES")), SIZET2NUM(record->heap_use_pages));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_LIVE_OBJECTS")), SIZET2NUM(record->heap_live_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("HEAP_FREE_OBJECTS")), SIZET2NUM(record->heap_free_objects));
+
+        rb_hash_aset(prof, ID2SYM(rb_intern("REMOVING_OBJECTS")), SIZET2NUM(record->removing_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("EMPTY_OBJECTS")), SIZET2NUM(record->empty_objects));
+
+        rb_hash_aset(prof, ID2SYM(rb_intern("HAVE_FINALIZE")), (record->flags & GPR_FLAG_HAVE_FINALIZE) ? Qtrue : Qfalse);
+#endif
+
+#if RGENGC_PROFILE > 0
+        rb_hash_aset(prof, ID2SYM(rb_intern("OLD_OBJECTS")), SIZET2NUM(record->old_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("REMEMBERED_NORMAL_OBJECTS")), SIZET2NUM(record->remembered_normal_objects));
+        rb_hash_aset(prof, ID2SYM(rb_intern("REMEMBERED_SHADY_OBJECTS")), SIZET2NUM(record->remembered_shady_objects));
+#endif
+        rb_ary_push(gc_profile, prof);
+    }
+
+    return gc_profile;
+}
+
+#if GC_PROFILE_MORE_DETAIL
+#define MAJOR_REASON_MAX 0x10
+
+static char *
+gc_profile_dump_major_reason(unsigned int flags, char *buff)
+{
+    unsigned int reason = flags & GPR_FLAG_MAJOR_MASK;
+    int i = 0;
+
+    if (reason == GPR_FLAG_NONE) {
+        buff[0] = '-';
+        buff[1] = 0;
+    }
+    else {
+#define C(x, s) \
+  if (reason & GPR_FLAG_MAJOR_BY_##x) { \
+      buff[i++] = #x[0]; \
+      if (i >= MAJOR_REASON_MAX) rb_bug("gc_profile_dump_major_reason: overflow"); \
+      buff[i] = 0; \
+  }
+        C(NOFREE, N);
+        C(OLDGEN, O);
+        C(SHADY,  S);
+#if RGENGC_ESTIMATE_OLDMALLOC
+        C(OLDMALLOC, M);
+#endif
+#undef C
+    }
+    return buff;
+}
+#endif
+
+
+
+static void
+gc_profile_dump_on(VALUE out, VALUE (*append)(VALUE, VALUE))
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    size_t count = objspace->profile.next_index;
+#ifdef MAJOR_REASON_MAX
+    char reason_str[MAJOR_REASON_MAX];
+#endif
+
+    if (objspace->profile.run && count /* > 1 */) {
+        size_t i;
+        const gc_profile_record *record;
+
+        append(out, rb_sprintf("GC %"PRIuSIZE" invokes.\n", objspace->profile.count));
+        append(out, rb_str_new_cstr("Index    Invoke Time(sec)       Use Size(byte)     Total Size(byte)         Total Object                    GC Time(ms)\n"));
+
+        for (i = 0; i < count; i++) {
+            record = &objspace->profile.records[i];
+            append(out, rb_sprintf("%5"PRIuSIZE" %19.3f %20"PRIuSIZE" %20"PRIuSIZE" %20"PRIuSIZE" %30.20f\n",
+                                   i+1, record->gc_invoke_time, record->heap_use_size,
+                                   record->heap_total_size, record->heap_total_objects, record->gc_time*1000));
+        }
+
+#if GC_PROFILE_MORE_DETAIL
+        const char *str = "\n\n" \
+                                    "More detail.\n" \
+                                    "Prepare Time = Previously GC's rest sweep time\n"
+                                    "Index Flags          Allocate Inc.  Allocate Limit"
+#if CALC_EXACT_MALLOC_SIZE
+                                    "  Allocated Size"
+#endif
+                                    "  Use Page     Mark Time(ms)    Sweep Time(ms)  Prepare Time(ms)  LivingObj    FreeObj RemovedObj   EmptyObj"
+#if RGENGC_PROFILE
+                                    " OldgenObj RemNormObj RemShadObj"
+#endif
+#if GC_PROFILE_DETAIL_MEMORY
+                                    " MaxRSS(KB) MinorFLT MajorFLT"
+#endif
+                                    "\n";
+        append(out, rb_str_new_cstr(str));
+
+        for (i = 0; i < count; i++) {
+            record = &objspace->profile.records[i];
+            append(out, rb_sprintf("%5"PRIuSIZE" %4s/%c/%6s%c %13"PRIuSIZE" %15"PRIuSIZE
+#if CALC_EXACT_MALLOC_SIZE
+                                   " %15"PRIuSIZE
+#endif
+                                   " %9"PRIuSIZE" %17.12f %17.12f %17.12f %10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE
+#if RGENGC_PROFILE
+                                   "%10"PRIuSIZE" %10"PRIuSIZE" %10"PRIuSIZE
+#endif
+#if GC_PROFILE_DETAIL_MEMORY
+                                   "%11ld %8ld %8ld"
+#endif
+
+                                   "\n",
+                                   i+1,
+                                   gc_profile_dump_major_reason(record->flags, reason_str),
+                                   (record->flags & GPR_FLAG_HAVE_FINALIZE) ? 'F' : '.',
+                                   (record->flags & GPR_FLAG_NEWOBJ) ? "NEWOBJ" :
+                                   (record->flags & GPR_FLAG_MALLOC) ? "MALLOC" :
+                                   (record->flags & GPR_FLAG_METHOD) ? "METHOD" :
+                                   (record->flags & GPR_FLAG_CAPI)   ? "CAPI__" : "??????",
+                                   (record->flags & GPR_FLAG_STRESS) ? '!' : ' ',
+                                   record->allocate_increase, record->allocate_limit,
+#if CALC_EXACT_MALLOC_SIZE
+                                   record->allocated_size,
+#endif
+                                   record->heap_use_pages,
+                                   record->gc_mark_time*1000,
+                                   record->gc_sweep_time*1000,
+                                   record->prepare_time*1000,
+
+                                   record->heap_live_objects,
+                                   record->heap_free_objects,
+                                   record->removing_objects,
+                                   record->empty_objects
+#if RGENGC_PROFILE
+                                   ,
+                                   record->old_objects,
+                                   record->remembered_normal_objects,
+                                   record->remembered_shady_objects
+#endif
+#if GC_PROFILE_DETAIL_MEMORY
+                                   ,
+                                   record->maxrss / 1024,
+                                   record->minflt,
+                                   record->majflt
+#endif
+
+                       ));
+        }
+#endif
+    }
+}
+
+/*
+ *  call-seq:
+ *     GC::Profiler.result  -> String
+ *
+ *  Returns a profile data report such as:
+ *
+ *    GC 1 invokes.
+ *    Index    Invoke Time(sec)       Use Size(byte)     Total Size(byte)         Total Object                    GC time(ms)
+ *        1               0.012               159240               212940                10647         0.00000000000001530000
+ */
+
+static VALUE
+gc_profile_result(VALUE _)
+{
+    VALUE str = rb_str_buf_new(0);
+    gc_profile_dump_on(str, rb_str_buf_append);
+    return str;
+}
+
+/*
+ *  call-seq:
+ *     GC::Profiler.report
+ *     GC::Profiler.report(io)
+ *
+ *  Writes the GC::Profiler.result to <tt>$stdout</tt> or the given IO object.
+ *
+ */
+
+static VALUE
+gc_profile_report(int argc, VALUE *argv, VALUE self)
+{
+    VALUE out;
+
+    out = (!rb_check_arity(argc, 0, 1) ? rb_stdout : argv[0]);
+    gc_profile_dump_on(out, rb_io_write);
+
+    return Qnil;
+}
+
+/*
+ *  call-seq:
+ *     GC::Profiler.total_time	-> float
+ *
+ *  The total time used for garbage collection in seconds
+ */
+
+static VALUE
+gc_profile_total_time(VALUE self)
+{
+    double time = 0;
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    if (objspace->profile.run && objspace->profile.next_index > 0) {
+        size_t i;
+        size_t count = objspace->profile.next_index;
+
+        for (i = 0; i < count; i++) {
+            time += objspace->profile.records[i].gc_time;
+        }
+    }
+    return DBL2NUM(time);
+}
+
+/*
+ *  call-seq:
+ *    GC::Profiler.enabled?	-> true or false
+ *
+ *  The current status of \GC profile mode.
+ */
+
+static VALUE
+gc_profile_enable_get(VALUE self)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    return objspace->profile.run ? Qtrue : Qfalse;
+}
+
+/*
+ *  call-seq:
+ *    GC::Profiler.enable	-> nil
+ *
+ *  Starts the \GC profiler.
+ *
+ */
+
+static VALUE
+gc_profile_enable(VALUE _)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    objspace->profile.run = TRUE;
+    objspace->profile.current_record = 0;
+    return Qnil;
+}
+
+/*
+ *  call-seq:
+ *    GC::Profiler.disable	-> nil
+ *
+ *  Stops the \GC profiler.
+ *
+ */
+
+static VALUE
+gc_profile_disable(VALUE _)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    objspace->profile.run = FALSE;
+    objspace->profile.current_record = 0;
+    return Qnil;
+}
+
+void
+rb_gc_verify_internal_consistency(void)
+{
+    gc_verify_internal_consistency(rb_gc_get_objspace());
+}
+
+/*
+ *  call-seq:
+ *     GC.verify_internal_consistency                  -> nil
+ *
+ *  Verify internal consistency.
+ *
+ *  This method is implementation specific.
+ *  Now this method checks generational consistency
+ *  if RGenGC is supported.
+ */
+static VALUE
+gc_verify_internal_consistency_m(VALUE dummy)
+{
+    rb_gc_verify_internal_consistency();
+    return Qnil;
+}
+
+#if GC_CAN_COMPILE_COMPACTION
+/*
+ *  call-seq:
+ *     GC.auto_compact = flag
+ *
+ *  Updates automatic compaction mode.
+ *
+ *  When enabled, the compactor will execute on every major collection.
+ *
+ *  Enabling compaction will degrade performance on major collections.
+ */
+static VALUE
+gc_set_auto_compact(VALUE _, VALUE v)
+{
+    GC_ASSERT(GC_COMPACTION_SUPPORTED);
+
+    ruby_enable_autocompact = RTEST(v);
+
+#if RGENGC_CHECK_MODE
+    ruby_autocompact_compare_func = NULL;
+
+    if (SYMBOL_P(v)) {
+        ID id = RB_SYM2ID(v);
+        if (id == rb_intern("empty")) {
+            ruby_autocompact_compare_func = compare_free_slots;
+        }
+    }
+#endif
+
+    return v;
+}
+#else
+#  define gc_set_auto_compact rb_f_notimplement
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+/*
+ *  call-seq:
+ *     GC.auto_compact    -> true or false
+ *
+ *  Returns whether or not automatic compaction has been enabled.
+ */
+static VALUE
+gc_get_auto_compact(VALUE _)
+{
+    return ruby_enable_autocompact ? Qtrue : Qfalse;
+}
+#else
+#  define gc_get_auto_compact rb_f_notimplement
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+/*
+ *  call-seq:
+ *     GC.latest_compact_info -> hash
+ *
+ * Returns information about object moved in the most recent \GC compaction.
+ *
+ * The returned +hash+ contains the following keys:
+ *
+ * [considered]
+ *   Hash containing the type of the object as the key and the number of
+ *   objects of that type that were considered for movement.
+ * [moved]
+ *   Hash containing the type of the object as the key and the number of
+ *   objects of that type that were actually moved.
+ * [moved_up]
+ *   Hash containing the type of the object as the key and the number of
+ *   objects of that type that were increased in size.
+ * [moved_down]
+ *   Hash containing the type of the object as the key and the number of
+ *   objects of that type that were decreased in size.
+ *
+ * Some objects can't be moved (due to pinning) so these numbers can be used to
+ * calculate compaction efficiency.
+ */
+static VALUE
+gc_compact_stats(VALUE self)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    VALUE h = rb_hash_new();
+    VALUE considered = rb_hash_new();
+    VALUE moved = rb_hash_new();
+    VALUE moved_up = rb_hash_new();
+    VALUE moved_down = rb_hash_new();
+
+    for (size_t i = 0; i < T_MASK; i++) {
+        if (objspace->rcompactor.considered_count_table[i]) {
+            rb_hash_aset(considered, type_sym(i), SIZET2NUM(objspace->rcompactor.considered_count_table[i]));
+        }
+
+        if (objspace->rcompactor.moved_count_table[i]) {
+            rb_hash_aset(moved, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_count_table[i]));
+        }
+
+        if (objspace->rcompactor.moved_up_count_table[i]) {
+            rb_hash_aset(moved_up, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_up_count_table[i]));
+        }
+
+        if (objspace->rcompactor.moved_down_count_table[i]) {
+            rb_hash_aset(moved_down, type_sym(i), SIZET2NUM(objspace->rcompactor.moved_down_count_table[i]));
+        }
+    }
+
+    rb_hash_aset(h, ID2SYM(rb_intern("considered")), considered);
+    rb_hash_aset(h, ID2SYM(rb_intern("moved")), moved);
+    rb_hash_aset(h, ID2SYM(rb_intern("moved_up")), moved_up);
+    rb_hash_aset(h, ID2SYM(rb_intern("moved_down")), moved_down);
+
+    return h;
+}
+#else
+#  define gc_compact_stats rb_f_notimplement
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+/*
+ *  call-seq:
+ *     GC.compact -> hash
+ *
+ * This function compacts objects together in Ruby's heap. It eliminates
+ * unused space (or fragmentation) in the heap by moving objects in to that
+ * unused space.
+ *
+ * The returned +hash+ contains statistics about the objects that were moved;
+ * see GC.latest_compact_info.
+ *
+ * This method is only expected to work on CRuby.
+ *
+ * To test whether \GC compaction is supported, use the idiom:
+ *
+ *   GC.respond_to?(:compact)
+ */
+static VALUE
+gc_compact(VALUE self)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+    int full_marking_p = gc_config_full_mark_val;
+    gc_config_full_mark_set(TRUE);
+
+    /* Run GC with compaction enabled */
+    rb_gc_impl_start(rb_gc_get_objspace(), true, true, true, true);
+    gc_config_full_mark_set(full_marking_p);
+
+    return gc_compact_stats(self);
+}
+#else
+#  define gc_compact rb_f_notimplement
+#endif
+
+#if GC_CAN_COMPILE_COMPACTION
+struct desired_compaction_pages_i_data {
+    rb_objspace_t *objspace;
+    size_t required_slots[HEAP_COUNT];
+};
+
+static int
+desired_compaction_pages_i(struct heap_page *page, void *data)
+{
+    struct desired_compaction_pages_i_data *tdata = data;
+    rb_objspace_t *objspace = tdata->objspace;
+    VALUE vstart = (VALUE)page->start;
+    VALUE vend = vstart + (VALUE)(page->total_slots * page->heap->slot_size);
+
+
+    for (VALUE v = vstart; v != vend; v += page->heap->slot_size) {
+        asan_unpoisoning_object(v) {
+            /* skip T_NONEs; they won't be moved */
+            if (BUILTIN_TYPE(v) != T_NONE) {
+                rb_heap_t *dest_pool = gc_compact_destination_pool(objspace, page->heap, v);
+                size_t dest_pool_idx = dest_pool - heaps;
+                tdata->required_slots[dest_pool_idx]++;
+            }
+        }
+    }
+
+    return 0;
+}
+
+/* call-seq:
+ *    GC.verify_compaction_references(toward: nil, double_heap: false) -> hash
+ *
+ * Verify compaction reference consistency.
+ *
+ * This method is implementation specific.  During compaction, objects that
+ * were moved are replaced with T_MOVED objects.  No object should have a
+ * reference to a T_MOVED object after compaction.
+ *
+ * This function expands the heap to ensure room to move all objects,
+ * compacts the heap to make sure everything moves, updates all references,
+ * then performs a full \GC.  If any object contains a reference to a T_MOVED
+ * object, that object should be pushed on the mark stack, and will
+ * make a SEGV.
+ */
+static VALUE
+gc_verify_compaction_references(int argc, VALUE* argv, VALUE self)
+{
+    static ID keywords[3] = {0};
+    if (!keywords[0]) {
+        keywords[0] = rb_intern("toward");
+        keywords[1] = rb_intern("double_heap");
+        keywords[2] = rb_intern("expand_heap");
+    }
+
+    VALUE options;
+    rb_scan_args_kw(rb_keyword_given_p(), argc, argv, ":", &options);
+
+    VALUE arguments[3] = { Qnil, Qfalse, Qfalse };
+    int kwarg_count = rb_get_kwargs(options, keywords, 0, 3, arguments);
+    bool toward_empty = kwarg_count > 0 && SYMBOL_P(arguments[0]) && SYM2ID(arguments[0]) == rb_intern("empty");
+    bool expand_heap = (kwarg_count > 1 && RTEST(arguments[1])) || (kwarg_count > 2 && RTEST(arguments[2]));
+
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    /* Clear the heap. */
+    rb_gc_impl_start(objspace, true, true, true, false);
+
+    unsigned int lev = RB_GC_VM_LOCK();
+    {
+        gc_rest(objspace);
+
+        /* if both double_heap and expand_heap are set, expand_heap takes precedence */
+        if (expand_heap) {
+            struct desired_compaction_pages_i_data desired_compaction = {
+                .objspace = objspace,
+                .required_slots = {0},
+            };
+            /* Work out how many objects want to be in each size pool, taking account of moves */
+            objspace_each_pages(objspace, desired_compaction_pages_i, &desired_compaction, TRUE);
+
+            /* Find out which pool has the most pages */
+            size_t max_existing_pages = 0;
+            for (int i = 0; i < HEAP_COUNT; i++) {
+                rb_heap_t *heap = &heaps[i];
+                max_existing_pages = MAX(max_existing_pages, heap->total_pages);
+            }
+
+            /* Add pages to each size pool so that compaction is guaranteed to move every object */
+            for (int i = 0; i < HEAP_COUNT; i++) {
+                rb_heap_t *heap = &heaps[i];
+
+                size_t pages_to_add = 0;
+                /*
+                 * Step 1: Make sure every pool has the same number of pages, by adding empty pages
+                 * to smaller pools. This is required to make sure the compact cursor can advance
+                 * through all of the pools in `gc_sweep_compact` without hitting the "sweep &
+                 * compact cursors met" condition on some pools before fully compacting others
+                 */
+                pages_to_add += max_existing_pages - heap->total_pages;
+                /*
+                 * Step 2: Now add additional free pages to each size pool sufficient to hold all objects
+                 * that want to be in that size pool, whether moved into it or moved within it
+                 */
+                objspace->heap_pages.allocatable_bytes = desired_compaction.required_slots[i] * heap->slot_size;
+                while (objspace->heap_pages.allocatable_bytes > 0) {
+                    heap_page_allocate_and_initialize(objspace, heap);
+                }
+                /*
+                 * Step 3: Add two more pages so that the compact & sweep cursors will meet _after_ all objects
+                 * have been moved, and not on the last iteration of the `gc_sweep_compact` loop
+                 */
+                pages_to_add += 2;
+
+                for (; pages_to_add > 0; pages_to_add--) {
+                    heap_page_allocate_and_initialize_force(objspace, heap);
+                }
+            }
+        }
+
+        if (toward_empty) {
+            objspace->rcompactor.compare_func = compare_free_slots;
+        }
+    }
+    RB_GC_VM_UNLOCK(lev);
+
+    rb_gc_impl_start(rb_gc_get_objspace(), true, true, true, true);
+
+    rb_objspace_reachable_objects_from_root(root_obj_check_moved_i, objspace);
+    objspace_each_objects(objspace, heap_check_moved_i, objspace, TRUE);
+
+    objspace->rcompactor.compare_func = NULL;
+
+    return gc_compact_stats(self);
+}
+#else
+# define gc_verify_compaction_references rb_f_notimplement
+#endif
+
+void
+rb_gc_impl_objspace_free(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    if (is_lazy_sweeping(objspace))
+        rb_bug("lazy sweeping underway when freeing object space");
+
+    free(objspace->profile.records);
+    objspace->profile.records = NULL;
+
+    for (size_t i = 0; i < rb_darray_size(objspace->heap_pages.sorted); i++) {
+        heap_page_free(objspace, rb_darray_get(objspace->heap_pages.sorted, i));
+    }
+    rb_darray_free_without_gc(objspace->heap_pages.sorted);
+    heap_pages_lomem = 0;
+    heap_pages_himem = 0;
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+        heap->total_pages = 0;
+        heap->total_slots = 0;
+    }
+
+    free_stack_chunks(&objspace->mark_stack);
+    mark_stack_free_cache(&objspace->mark_stack);
+
+    rb_darray_free_without_gc(objspace->weak_references);
+
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    rb_native_mutex_destroy(&objspace->malloc_counters.lock);
+#endif
+
+    free(objspace);
+}
+
+#if MALLOC_ALLOCATED_SIZE
+/*
+ *  call-seq:
+ *     GC.malloc_allocated_size -> Integer
+ *
+ *  Returns the size of memory allocated by malloc().
+ *
+ *  Only available if ruby was built with +CALC_EXACT_MALLOC_SIZE+.
+ */
+
+static VALUE
+gc_malloc_allocated_size(VALUE self)
+{
+    rb_objspace_t *objspace = (rb_objspace_t *)rb_gc_get_objspace();
+    return ULL2NUM(objspace->malloc_params.allocated_size);
+}
+
+/*
+ *  call-seq:
+ *     GC.malloc_allocations -> Integer
+ *
+ *  Returns the number of malloc() allocations.
+ *
+ *  Only available if ruby was built with +CALC_EXACT_MALLOC_SIZE+.
+ */
+
+static VALUE
+gc_malloc_allocations(VALUE self)
+{
+    rb_objspace_t *objspace = (rb_objspace_t *)rb_gc_get_objspace();
+    return ULL2NUM(objspace->malloc_params.allocations);
+}
+#endif
+
+void
+rb_gc_impl_before_fork(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    objspace->fork_vm_lock_lev = RB_GC_VM_LOCK();
+    rb_gc_vm_barrier();
+}
+
+void
+rb_gc_impl_after_fork(void *objspace_ptr, rb_pid_t pid)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    RB_GC_VM_UNLOCK(objspace->fork_vm_lock_lev);
+    objspace->fork_vm_lock_lev = 0;
+
+    if (pid == 0) { /* child process */
+        rb_gc_ractor_newobj_cache_foreach(gc_ractor_newobj_cache_clear, NULL);
+    }
+}
+
+VALUE rb_ident_hash_new_with_size(st_index_t size);
+
+#if GC_DEBUG_STRESS_TO_CLASS
+/*
+ *  call-seq:
+ *    GC.add_stress_to_class(class[, ...])
+ *
+ *  Raises NoMemoryError when allocating an instance of the given classes.
+ *
+ */
+static VALUE
+rb_gcdebug_add_stress_to_class(int argc, VALUE *argv, VALUE self)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    if (!stress_to_class) {
+        set_stress_to_class(rb_ident_hash_new_with_size(argc));
+    }
+
+    for (int i = 0; i < argc; i++) {
+        VALUE klass = argv[i];
+        rb_hash_aset(stress_to_class, klass, Qtrue);
+    }
+
+    return self;
+}
+
+/*
+ *  call-seq:
+ *    GC.remove_stress_to_class(class[, ...])
+ *
+ *  No longer raises NoMemoryError when allocating an instance of the
+ *  given classes.
+ *
+ */
+static VALUE
+rb_gcdebug_remove_stress_to_class(int argc, VALUE *argv, VALUE self)
+{
+    rb_objspace_t *objspace = rb_gc_get_objspace();
+
+    if (stress_to_class) {
+        for (int i = 0; i < argc; ++i) {
+            rb_hash_delete(stress_to_class, argv[i]);
+        }
+
+        if (rb_hash_size(stress_to_class) == 0) {
+            stress_to_class = 0;
+        }
+    }
+
+    return Qnil;
+}
+#endif
+
+void *
+rb_gc_impl_objspace_alloc(void)
+{
+    rb_objspace_t *objspace = calloc1(sizeof(rb_objspace_t));
+
+    return objspace;
+}
+
+void
+rb_gc_impl_objspace_init(void *objspace_ptr)
+{
+    rb_objspace_t *objspace = objspace_ptr;
+
+    gc_config_full_mark_set(TRUE);
+
+    objspace->flags.measure_gc = true;
+    malloc_limit = gc_params.malloc_limit_min;
+#ifdef MALLOC_COUNTERS_NEED_LOCK
+    rb_native_mutex_initialize(&objspace->malloc_counters.lock);
+#endif
+    objspace->finalize_deferred_pjob = rb_postponed_job_preregister(0, gc_finalize_deferred, objspace);
+    if (objspace->finalize_deferred_pjob == POSTPONED_JOB_HANDLE_INVALID) {
+        rb_bug("Could not preregister postponed job for GC");
+    }
+
+    /* A standard RVALUE (RBasic + embedded VALUEs + debug overhead) must fit
+     * in at least one pool.  In debug builds RVALUE_OVERHEAD can push this
+     * beyond the 48-byte pool into the 64-byte pool, which is fine. */
+    GC_ASSERT(rb_gc_impl_size_allocatable_p(sizeof(struct RBasic) + sizeof(VALUE[RBIMPL_RVALUE_EMBED_LEN_MAX])));
+
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        rb_heap_t *heap = &heaps[i];
+
+        heap->slot_size = pool_slot_sizes[i];
+
+        ccan_list_head_init(&heap->pages);
+    }
+
+    init_size_to_heap_idx();
+
+    rb_darray_make_without_gc(&objspace->heap_pages.sorted, 0);
+    rb_darray_make_without_gc(&objspace->weak_references, 0);
+
+#if defined(INIT_HEAP_PAGE_ALLOC_USE_MMAP)
+    /* Need to determine if we can use mmap at runtime. */
+    heap_page_alloc_use_mmap = INIT_HEAP_PAGE_ALLOC_USE_MMAP;
+#endif
+#if RGENGC_ESTIMATE_OLDMALLOC
+    objspace->rgengc.oldmalloc_increase_limit = gc_params.oldmalloc_limit_min;
+#endif
+    gc_params.heap_init_bytes = GC_HEAP_INIT_BYTES;
+
+    init_mark_stack(&objspace->mark_stack);
+
+    objspace->profile.invoke_time = getrusage_time();
+    finalizer_table = st_init_numtable();
+}
+
+void
+rb_gc_impl_init(void)
+{
+    VALUE gc_constants = rb_hash_new();
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("DEBUG")), GC_DEBUG ? Qtrue : Qfalse);
+    /* Minimum slot size that fits a standard RVALUE */
+    size_t rvalue_pool = 0;
+    for (size_t i = 0; i < HEAP_COUNT; i++) {
+        if (pool_slot_sizes[i] >= RVALUE_SLOT_SIZE) { rvalue_pool = pool_slot_sizes[i]; break; }
+    }
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_SIZE")), SIZET2NUM(rvalue_pool - RVALUE_OVERHEAD));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RBASIC_SIZE")), SIZET2NUM(sizeof(struct RBasic)));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OVERHEAD")), SIZET2NUM(RVALUE_OVERHEAD));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_PAGE_BITMAP_SIZE")), SIZET2NUM(HEAP_PAGE_BITMAP_SIZE));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_PAGE_SIZE")), SIZET2NUM(HEAP_PAGE_SIZE));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_COUNT")), LONG2FIX(HEAP_COUNT));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVARGC_MAX_ALLOCATE_SIZE")), LONG2FIX(heap_slot_size(HEAP_COUNT - 1)));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OLD_AGE")), LONG2FIX(RVALUE_OLD_AGE));
+    if (RB_BUG_INSTEAD_OF_RB_MEMERROR+0) {
+        rb_hash_aset(gc_constants, ID2SYM(rb_intern("RB_BUG_INSTEAD_OF_RB_MEMERROR")), Qtrue);
+    }
+    OBJ_FREEZE(gc_constants);
+    /* Internal constants in the garbage collector. */
+    rb_define_const(rb_mGC, "INTERNAL_CONSTANTS", gc_constants);
+
+    if (GC_COMPACTION_SUPPORTED) {
+        rb_define_singleton_method(rb_mGC, "compact", gc_compact, 0);
+        rb_define_singleton_method(rb_mGC, "auto_compact", gc_get_auto_compact, 0);
+        rb_define_singleton_method(rb_mGC, "auto_compact=", gc_set_auto_compact, 1);
+        rb_define_singleton_method(rb_mGC, "latest_compact_info", gc_compact_stats, 0);
+        rb_define_singleton_method(rb_mGC, "verify_compaction_references", gc_verify_compaction_references, -1);
+    }
+    else {
+        rb_define_singleton_method(rb_mGC, "compact", rb_f_notimplement, 0);
+        rb_define_singleton_method(rb_mGC, "auto_compact", rb_f_notimplement, 0);
+        rb_define_singleton_method(rb_mGC, "auto_compact=", rb_f_notimplement, 1);
+        rb_define_singleton_method(rb_mGC, "latest_compact_info", rb_f_notimplement, 0);
+        rb_define_singleton_method(rb_mGC, "verify_compaction_references", rb_f_notimplement, -1);
+    }
+
+#if GC_DEBUG_STRESS_TO_CLASS
+    rb_define_singleton_method(rb_mGC, "add_stress_to_class", rb_gcdebug_add_stress_to_class, -1);
+    rb_define_singleton_method(rb_mGC, "remove_stress_to_class", rb_gcdebug_remove_stress_to_class, -1);
+#endif
+
+    /* internal methods */
+    rb_define_singleton_method(rb_mGC, "verify_internal_consistency", gc_verify_internal_consistency_m, 0);
+
+#if MALLOC_ALLOCATED_SIZE
+    rb_define_singleton_method(rb_mGC, "malloc_allocated_size", gc_malloc_allocated_size, 0);
+    rb_define_singleton_method(rb_mGC, "malloc_allocations", gc_malloc_allocations, 0);
+#endif
+
+    VALUE rb_mProfiler = rb_define_module_under(rb_mGC, "Profiler");
+    rb_define_singleton_method(rb_mProfiler, "enabled?", gc_profile_enable_get, 0);
+    rb_define_singleton_method(rb_mProfiler, "enable", gc_profile_enable, 0);
+    rb_define_singleton_method(rb_mProfiler, "raw_data", gc_profile_record_get, 0);
+    rb_define_singleton_method(rb_mProfiler, "disable", gc_profile_disable, 0);
+    rb_define_singleton_method(rb_mProfiler, "clear", gc_profile_clear, 0);
+    rb_define_singleton_method(rb_mProfiler, "result", gc_profile_result, 0);
+    rb_define_singleton_method(rb_mProfiler, "report", gc_profile_report, -1);
+    rb_define_singleton_method(rb_mProfiler, "total_time", gc_profile_total_time, 0);
+
+    {
+        VALUE opts;
+        /* \GC build options */
+        rb_define_const(rb_mGC, "OPTS", opts = rb_ary_new());
+#define OPT(o) if (o) rb_ary_push(opts, rb_interned_str(#o, sizeof(#o) - 1))
+        OPT(GC_DEBUG);
+        OPT(USE_RGENGC);
+        OPT(RGENGC_DEBUG);
+        OPT(RGENGC_CHECK_MODE);
+        OPT(RGENGC_PROFILE);
+        OPT(RGENGC_ESTIMATE_OLDMALLOC);
+        OPT(GC_PROFILE_MORE_DETAIL);
+        OPT(GC_ENABLE_LAZY_SWEEP);
+        OPT(CALC_EXACT_MALLOC_SIZE);
+        OPT(MALLOC_ALLOCATED_SIZE);
+        OPT(MALLOC_ALLOCATED_SIZE_CHECK);
+        OPT(GC_PROFILE_DETAIL_MEMORY);
+        OPT(GC_COMPACTION_SUPPORTED);
+#undef OPT
+        OBJ_FREEZE(opts);
+    }
+}
diff --git a/gc/default/extconf.rb b/gc/default/extconf.rb
new file mode 100644
index 0000000000..2940a4c962
--- /dev/null
+++ b/gc/default/extconf.rb
@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+require_relative "../extconf_base"
+
+create_gc_makefile("default")
diff --git a/gc/extconf_base.rb b/gc/extconf_base.rb
new file mode 100644
index 0000000000..2a224b9b0e
--- /dev/null
+++ b/gc/extconf_base.rb
@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require "mkmf"
+
+srcdir = File.join(__dir__, "..")
+$INCFLAGS << " -I#{srcdir}"
+
+$CPPFLAGS << " -DBUILDING_MODULAR_GC"
+
+append_cflags("-fPIC")
+
+def create_gc_makefile(name, &block)
+  create_makefile("librubygc.#{name}", &block)
+end
diff --git a/gc/gc.h b/gc/gc.h
new file mode 100644
index 0000000000..d147a3122a
--- /dev/null
+++ b/gc/gc.h
@@ -0,0 +1,293 @@
+#ifndef GC_GC_H
+#define GC_GC_H
+/**
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  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.
+ * @brief      Private header for the default GC and other GC implementations
+ *             first introduced for [Feature #20470].
+ */
+#include "ruby/ruby.h"
+#include "ruby/assert.h"
+
+#include "ruby/thread_native.h"
+
+#ifndef VM_CHECK_MODE
+# define VM_CHECK_MODE RUBY_DEBUG
+#endif
+
+// From ractor_core.h
+#ifndef RACTOR_CHECK_MODE
+# define RACTOR_CHECK_MODE (VM_CHECK_MODE || RUBY_DEBUG) && (SIZEOF_UINT64_T == SIZEOF_VALUE)
+#endif
+
+#if RACTOR_CHECK_MODE
+void rb_ractor_setup_belonging(VALUE obj);
+
+struct rb_gc_obj_suffix {
+    uint32_t _ractor_belonging_id;
+};
+
+# define RB_GC_OBJ_HAS_SUFFIX 1
+# define RB_GC_OBJ_SUFFIX_SIZE (sizeof(struct rb_gc_obj_suffix))
+#else
+# define RB_GC_OBJ_HAS_SUFFIX 0
+# define RB_GC_OBJ_SUFFIX_SIZE 0
+#endif
+
+struct rb_gc_vm_context {
+    rb_nativethread_lock_t lock;
+
+    struct rb_execution_context_struct *ec;
+};
+
+typedef int (*vm_table_foreach_callback_func)(VALUE value, void *data);
+typedef int (*vm_table_update_callback_func)(VALUE *value, void *data);
+
+enum rb_gc_vm_weak_tables {
+    RB_GC_VM_CI_TABLE,
+    RB_GC_VM_OVERLOADED_CME_TABLE,
+    RB_GC_VM_GLOBAL_SYMBOLS_TABLE,
+    RB_GC_VM_ID2REF_TABLE,
+    RB_GC_VM_GENERIC_FIELDS_TABLE,
+    RB_GC_VM_FROZEN_STRINGS_TABLE,
+    RB_GC_VM_WEAK_TABLE_COUNT
+};
+
+#define RB_GC_VM_LOCK() rb_gc_vm_lock(__FILE__, __LINE__)
+#define RB_GC_VM_UNLOCK(lev) rb_gc_vm_unlock(lev, __FILE__, __LINE__)
+#define RB_GC_CR_LOCK() rb_gc_cr_lock(__FILE__, __LINE__)
+#define RB_GC_CR_UNLOCK(lev) rb_gc_cr_unlock(lev, __FILE__, __LINE__)
+#define RB_GC_VM_LOCK_NO_BARRIER() rb_gc_vm_lock_no_barrier(__FILE__, __LINE__)
+#define RB_GC_VM_UNLOCK_NO_BARRIER(lev) rb_gc_vm_unlock_no_barrier(lev, __FILE__, __LINE__)
+
+#if USE_MODULAR_GC
+# define MODULAR_GC_FN
+#else
+// This takes advantage of internal linkage winning when appearing first.
+// See C99 6.2.2p4.
+# define MODULAR_GC_FN static
+#endif
+
+#if USE_MODULAR_GC
+RUBY_SYMBOL_EXPORT_BEGIN
+#endif
+
+// These functions cannot be defined as static because they are used by other
+// files in Ruby.
+size_t rb_size_mul_or_raise(size_t x, size_t y, VALUE exc);
+void rb_objspace_reachable_objects_from(VALUE obj, void (func)(VALUE, void *), void *data);
+const char *rb_raw_obj_info(char *const buff, const size_t buff_size, VALUE obj);
+const char *rb_obj_info(VALUE obj);
+size_t rb_obj_memsize_of(VALUE obj);
+bool ruby_free_at_exit_p(void);
+void rb_objspace_reachable_objects_from_root(void (func)(const char *category, VALUE, void *), void *passing_data);
+void rb_gc_verify_shareable(VALUE);
+
+MODULAR_GC_FN unsigned int rb_gc_vm_lock(const char *file, int line);
+MODULAR_GC_FN void rb_gc_vm_unlock(unsigned int lev, const char *file, int line);
+MODULAR_GC_FN unsigned int rb_gc_cr_lock(const char *file, int line);
+MODULAR_GC_FN void rb_gc_cr_unlock(unsigned int lev, const char *file, int line);
+MODULAR_GC_FN unsigned int rb_gc_vm_lock_no_barrier(const char *file, int line);
+MODULAR_GC_FN void rb_gc_vm_unlock_no_barrier(unsigned int lev, const char *file, int line);
+MODULAR_GC_FN void rb_gc_vm_barrier(void);
+MODULAR_GC_FN size_t rb_gc_obj_optimal_size(VALUE obj);
+MODULAR_GC_FN void rb_gc_mark_children(void *objspace, VALUE obj);
+MODULAR_GC_FN void rb_gc_vm_weak_table_foreach(vm_table_foreach_callback_func callback, vm_table_update_callback_func update_callback, void *data, bool weak_only, enum rb_gc_vm_weak_tables table);
+MODULAR_GC_FN void rb_gc_update_object_references(void *objspace, VALUE obj);
+MODULAR_GC_FN void rb_gc_update_vm_references(void *objspace);
+MODULAR_GC_FN void rb_gc_event_hook(VALUE obj, rb_event_flag_t event);
+MODULAR_GC_FN void *rb_gc_get_objspace(void);
+MODULAR_GC_FN void rb_gc_run_obj_finalizer(VALUE objid, long count, VALUE (*callback)(long i, void *data), void *data);
+MODULAR_GC_FN void rb_gc_set_pending_interrupt(void);
+MODULAR_GC_FN void rb_gc_unset_pending_interrupt(void);
+MODULAR_GC_FN void rb_gc_obj_free_vm_weak_references(VALUE obj);
+MODULAR_GC_FN bool rb_gc_obj_free(void *objspace, VALUE obj);
+MODULAR_GC_FN void rb_gc_save_machine_context(void);
+MODULAR_GC_FN void rb_gc_mark_roots(void *objspace, const char **categoryp);
+MODULAR_GC_FN void rb_gc_ractor_newobj_cache_foreach(void (*func)(void *cache, void *data), void *data);
+MODULAR_GC_FN bool rb_gc_multi_ractor_p(void);
+MODULAR_GC_FN bool rb_gc_shutdown_call_finalizer_p(VALUE obj);
+MODULAR_GC_FN void rb_gc_obj_changed_pool(VALUE obj, size_t heap_id);
+MODULAR_GC_FN void rb_gc_prepare_heap_process_object(VALUE obj);
+MODULAR_GC_FN bool rb_memerror_reentered(void);
+MODULAR_GC_FN bool rb_obj_id_p(VALUE);
+MODULAR_GC_FN void rb_gc_before_updating_jit_code(void);
+MODULAR_GC_FN void rb_gc_after_updating_jit_code(void);
+MODULAR_GC_FN bool rb_gc_obj_shareable_p(VALUE);
+MODULAR_GC_FN void rb_gc_rp(VALUE);
+MODULAR_GC_FN void rb_gc_handle_weak_references(VALUE obj);
+MODULAR_GC_FN bool rb_gc_obj_needs_cleanup_p(VALUE obj);
+
+#if USE_MODULAR_GC
+MODULAR_GC_FN bool rb_gc_event_hook_required_p(rb_event_flag_t event);
+MODULAR_GC_FN void *rb_gc_get_ractor_newobj_cache(void);
+MODULAR_GC_FN void rb_gc_initialize_vm_context(struct rb_gc_vm_context *context);
+MODULAR_GC_FN void rb_gc_move_obj_during_marking(VALUE from, VALUE to);
+MODULAR_GC_FN void rb_gc_print_backtrace();
+#endif
+
+#if USE_MODULAR_GC
+RUBY_SYMBOL_EXPORT_END
+#endif
+
+void rb_ractor_finish_marking(void);
+
+// -------------------Private section begin------------------------
+// Functions in this section are private to the default GC and gc.c
+
+#ifdef BUILDING_MODULAR_GC
+RBIMPL_WARNING_PUSH()
+RBIMPL_WARNING_IGNORED(-Wunused-function)
+#endif
+
+/* RGENGC_CHECK_MODE
+ * 0: disable all assertions
+ * 1: enable assertions (to debug RGenGC)
+ * 2: enable internal consistency check at each GC (for debugging)
+ * 3: enable internal consistency check at each GC steps (for debugging)
+ * 4: enable liveness check
+ * 5: show all references
+ */
+#ifndef RGENGC_CHECK_MODE
+# define RGENGC_CHECK_MODE  0
+#endif
+
+#ifndef GC_ASSERT
+# define GC_ASSERT(expr, ...) RUBY_ASSERT_MESG_WHEN(RGENGC_CHECK_MODE > 0, expr, #expr RBIMPL_VA_OPT_ARGS(__VA_ARGS__))
+#endif
+
+static int
+hash_foreach_replace_value(st_data_t key, st_data_t value, st_data_t argp, int error)
+{
+    if (rb_gc_location((VALUE)value) != (VALUE)value) {
+        return ST_REPLACE;
+    }
+    return ST_CONTINUE;
+}
+
+static int
+hash_replace_ref_value(st_data_t *key, st_data_t *value, st_data_t argp, int existing)
+{
+    *value = rb_gc_location((VALUE)*value);
+
+    return ST_CONTINUE;
+}
+
+static void
+gc_ref_update_table_values_only(st_table *tbl)
+{
+    if (!tbl || tbl->num_entries == 0) return;
+
+    if (st_foreach_with_replace(tbl, hash_foreach_replace_value, hash_replace_ref_value, 0)) {
+        rb_raise(rb_eRuntimeError, "hash modified during iteration");
+    }
+}
+
+static int
+gc_mark_tbl_no_pin_i(st_data_t key, st_data_t value, st_data_t data)
+{
+    rb_gc_mark_movable((VALUE)value);
+
+    return ST_CONTINUE;
+}
+
+static int
+gc_mark_set_no_pin_i(st_data_t key, st_data_t value, st_data_t data)
+{
+    rb_gc_mark_movable((VALUE)key);
+
+    return ST_CONTINUE;
+}
+
+static int
+hash_foreach_replace(st_data_t key, st_data_t value, st_data_t argp, int error)
+{
+    if (rb_gc_location((VALUE)key) != (VALUE)key) {
+        return ST_REPLACE;
+    }
+
+    if (rb_gc_location((VALUE)value) != (VALUE)value) {
+        return ST_REPLACE;
+    }
+
+    return ST_CONTINUE;
+}
+
+static int
+hash_replace_ref(st_data_t *key, st_data_t *value, st_data_t argp, int existing)
+{
+    VALUE new_key = rb_gc_location((VALUE)*key);
+    if (new_key != (VALUE)*key) {
+        *key = new_key;
+    }
+
+    VALUE new_value = rb_gc_location((VALUE)*value);
+    if (new_value != (VALUE)*value) {
+        *value = new_value;
+    }
+
+    return ST_CONTINUE;
+}
+
+static void
+gc_update_table_refs(st_table *tbl)
+{
+    if (!tbl || tbl->num_entries == 0) return;
+
+    if (st_foreach_with_replace(tbl, hash_foreach_replace, hash_replace_ref, 0)) {
+        rb_raise(rb_eRuntimeError, "hash modified during iteration");
+    }
+}
+
+static inline size_t
+xmalloc2_size(const size_t count, const size_t elsize)
+{
+    return rb_size_mul_or_raise(count, elsize, rb_eArgError);
+}
+
+static VALUE
+type_sym(size_t type)
+{
+    switch (type) {
+#define COUNT_TYPE(t) case (t): return ID2SYM(rb_intern(#t)); break;
+        COUNT_TYPE(T_NONE);
+        COUNT_TYPE(T_OBJECT);
+        COUNT_TYPE(T_CLASS);
+        COUNT_TYPE(T_MODULE);
+        COUNT_TYPE(T_FLOAT);
+        COUNT_TYPE(T_STRING);
+        COUNT_TYPE(T_REGEXP);
+        COUNT_TYPE(T_ARRAY);
+        COUNT_TYPE(T_HASH);
+        COUNT_TYPE(T_STRUCT);
+        COUNT_TYPE(T_BIGNUM);
+        COUNT_TYPE(T_FILE);
+        COUNT_TYPE(T_DATA);
+        COUNT_TYPE(T_MATCH);
+        COUNT_TYPE(T_COMPLEX);
+        COUNT_TYPE(T_RATIONAL);
+        COUNT_TYPE(T_NIL);
+        COUNT_TYPE(T_TRUE);
+        COUNT_TYPE(T_FALSE);
+        COUNT_TYPE(T_SYMBOL);
+        COUNT_TYPE(T_FIXNUM);
+        COUNT_TYPE(T_IMEMO);
+        COUNT_TYPE(T_UNDEF);
+        COUNT_TYPE(T_NODE);
+        COUNT_TYPE(T_ICLASS);
+        COUNT_TYPE(T_ZOMBIE);
+        COUNT_TYPE(T_MOVED);
+#undef COUNT_TYPE
+        default:              return SIZET2NUM(type); break;
+    }
+}
+
+#ifdef BUILDING_MODULAR_GC
+RBIMPL_WARNING_POP()
+#endif
+// -------------------Private section end------------------------
+
+#endif
diff --git a/gc/gc_impl.h b/gc/gc_impl.h
new file mode 100644
index 0000000000..d9e44cc66d
--- /dev/null
+++ b/gc/gc_impl.h
@@ -0,0 +1,127 @@
+#ifndef GC_GC_IMPL_H
+#define GC_GC_IMPL_H
+/**
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  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.
+ * @brief      Header for GC implementations introduced in [Feature #20470].
+ */
+#include "ruby/ruby.h"
+
+#ifndef RB_GC_OBJECT_METADATA_ENTRY_DEFINED
+# define RB_GC_OBJECT_METADATA_ENTRY_DEFINED
+struct rb_gc_object_metadata_entry {
+    ID name;
+    VALUE val;
+};
+#endif
+
+#ifdef BUILDING_MODULAR_GC
+# define GC_IMPL_FN
+#else
+// `GC_IMPL_FN` is an implementation detail of `!USE_MODULAR_GC` builds
+// to have the default GC in the same translation unit as gc.c for
+// the sake of optimizer visibility. It expands to nothing unless
+// you're the default GC.
+//
+// For the default GC, do not copy-paste this when implementing
+// these functions. This takes advantage of internal linkage winning
+// when appearing first. See C99 6.2.2p4.
+# define GC_IMPL_FN static
+#endif
+
+// Bootup
+GC_IMPL_FN void *rb_gc_impl_objspace_alloc(void);
+GC_IMPL_FN void rb_gc_impl_objspace_init(void *objspace_ptr);
+GC_IMPL_FN void *rb_gc_impl_ractor_cache_alloc(void *objspace_ptr, void *ractor);
+GC_IMPL_FN void rb_gc_impl_set_params(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_init(void);
+GC_IMPL_FN size_t *rb_gc_impl_heap_sizes(void *objspace_ptr);
+// Shutdown
+GC_IMPL_FN void rb_gc_impl_shutdown_free_objects(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_objspace_free(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_ractor_cache_free(void *objspace_ptr, void *cache);
+// GC
+GC_IMPL_FN void rb_gc_impl_start(void *objspace_ptr, bool full_mark, bool immediate_mark, bool immediate_sweep, bool compact);
+GC_IMPL_FN bool rb_gc_impl_during_gc_p(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_prepare_heap(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_gc_enable(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_gc_disable(void *objspace_ptr, bool finish_current_gc);
+GC_IMPL_FN bool rb_gc_impl_gc_enabled_p(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_stress_set(void *objspace_ptr, VALUE flag);
+GC_IMPL_FN VALUE rb_gc_impl_stress_get(void *objspace_ptr);
+GC_IMPL_FN VALUE rb_gc_impl_config_get(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_config_set(void *objspace_ptr, VALUE hash);
+GC_IMPL_FN struct rb_gc_vm_context *rb_gc_impl_get_vm_context(void *objspace_ptr);
+// Object allocation
+GC_IMPL_FN VALUE rb_gc_impl_new_obj(void *objspace_ptr, void *cache_ptr, VALUE klass, VALUE flags, bool wb_protected, size_t alloc_size);
+GC_IMPL_FN size_t rb_gc_impl_obj_slot_size(VALUE obj);
+GC_IMPL_FN size_t rb_gc_impl_heap_id_for_size(void *objspace_ptr, size_t size);
+GC_IMPL_FN bool rb_gc_impl_size_allocatable_p(size_t size);
+// Malloc
+/*
+ * BEWARE: These functions may or may not run under GVL.
+ *
+ * You might want to make them thread-safe.
+ * Garbage collecting inside is possible if and only if you
+ * already have GVL.  Also raising exceptions without one is a
+ * total disaster.
+ *
+ * When you absolutely cannot allocate the requested amount of
+ * memory just return NULL (with appropriate errno set).
+ * The caller side takes care of that situation.
+ */
+GC_IMPL_FN void *rb_gc_impl_malloc(void *objspace_ptr, size_t size, bool gc_allowed);
+GC_IMPL_FN void *rb_gc_impl_calloc(void *objspace_ptr, size_t size, bool gc_allowed);
+GC_IMPL_FN void *rb_gc_impl_realloc(void *objspace_ptr, void *ptr, size_t new_size, size_t old_size, bool gc_allowed);
+GC_IMPL_FN void rb_gc_impl_free(void *objspace_ptr, void *ptr, size_t old_size);
+GC_IMPL_FN void rb_gc_impl_adjust_memory_usage(void *objspace_ptr, ssize_t diff);
+// Marking
+GC_IMPL_FN void rb_gc_impl_mark(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_mark_and_move(void *objspace_ptr, VALUE *ptr);
+GC_IMPL_FN void rb_gc_impl_mark_and_pin(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_mark_maybe(void *objspace_ptr, VALUE obj);
+// Weak references
+GC_IMPL_FN void rb_gc_impl_declare_weak_references(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN bool rb_gc_impl_handle_weak_references_alive_p(void *objspace_ptr, VALUE obj);
+// Compaction
+GC_IMPL_FN void rb_gc_impl_register_pinning_obj(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN bool rb_gc_impl_object_moved_p(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN VALUE rb_gc_impl_location(void *objspace_ptr, VALUE value);
+// Write barriers
+GC_IMPL_FN void rb_gc_impl_writebarrier(void *objspace_ptr, VALUE a, VALUE b);
+GC_IMPL_FN void rb_gc_impl_writebarrier_unprotect(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_writebarrier_remember(void *objspace_ptr, VALUE obj);
+// Heap walking
+GC_IMPL_FN void rb_gc_impl_each_objects(void *objspace_ptr, int (*callback)(void *, void *, size_t, void *), void *data);
+GC_IMPL_FN void rb_gc_impl_each_object(void *objspace_ptr, void (*func)(VALUE obj, void *data), void *data);
+// Finalizers
+GC_IMPL_FN void rb_gc_impl_make_zombie(void *objspace_ptr, VALUE obj, void (*dfree)(void *), void *data);
+GC_IMPL_FN VALUE rb_gc_impl_define_finalizer(void *objspace_ptr, VALUE obj, VALUE block);
+GC_IMPL_FN void rb_gc_impl_undefine_finalizer(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_copy_finalizer(void *objspace_ptr, VALUE dest, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_shutdown_call_finalizer(void *objspace_ptr);
+// Forking
+GC_IMPL_FN void rb_gc_impl_before_fork(void *objspace_ptr);
+GC_IMPL_FN void rb_gc_impl_after_fork(void *objspace_ptr, rb_pid_t pid);
+// Statistics
+GC_IMPL_FN void rb_gc_impl_set_measure_total_time(void *objspace_ptr, VALUE flag);
+GC_IMPL_FN bool rb_gc_impl_get_measure_total_time(void *objspace_ptr);
+GC_IMPL_FN unsigned long long rb_gc_impl_get_total_time(void *objspace_ptr);
+GC_IMPL_FN size_t rb_gc_impl_gc_count(void *objspace_ptr);
+GC_IMPL_FN VALUE rb_gc_impl_latest_gc_info(void *objspace_ptr, VALUE key);
+GC_IMPL_FN VALUE rb_gc_impl_stat(void *objspace_ptr, VALUE hash_or_sym);
+GC_IMPL_FN VALUE rb_gc_impl_stat_heap(void *objspace_ptr, VALUE heap_name, VALUE hash_or_sym);
+GC_IMPL_FN const char *rb_gc_impl_active_gc_name(void);
+// Miscellaneous
+GC_IMPL_FN struct rb_gc_object_metadata_entry *rb_gc_impl_object_metadata(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN bool rb_gc_impl_pointer_to_heap_p(void *objspace_ptr, const void *ptr);
+GC_IMPL_FN bool rb_gc_impl_garbage_object_p(void *objspace_ptr, VALUE obj);
+GC_IMPL_FN void rb_gc_impl_set_event_hook(void *objspace_ptr, const rb_event_flag_t event);
+GC_IMPL_FN void rb_gc_impl_copy_attributes(void *objspace_ptr, VALUE dest, VALUE obj);
+
+#undef GC_IMPL_FN
+
+#endif
diff --git a/gc/mmtk/.gitignore b/gc/mmtk/.gitignore
new file mode 100644
index 0000000000..eb5a316cbd
--- /dev/null
+++ b/gc/mmtk/.gitignore
@@ -0,0 +1 @@
+target
diff --git a/gc/mmtk/Cargo.lock b/gc/mmtk/Cargo.lock
new file mode 100644
index 0000000000..910048fa80
--- /dev/null
+++ b/gc/mmtk/Cargo.lock
@@ -0,0 +1,1108 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 4
+
+[[package]]
+name = "aho-corasick"
+version = "1.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e60d3430d3a69478ad0993f19238d2df97c507009a52b3c10addcd7f6bcb916"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "anstream"
+version = "0.6.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8acc5369981196006228e28809f761875c0327210a891e941f4c683b3a99529b"
+dependencies = [
+ "anstyle",
+ "anstyle-parse",
+ "anstyle-query",
+ "anstyle-wincon",
+ "colorchoice",
+ "is_terminal_polyfill",
+ "utf8parse",
+]
+
+[[package]]
+name = "anstyle"
+version = "1.0.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "55cc3b69f167a1ef2e161439aa98aed94e6028e5f9a59be9a6ffb47aef1651f9"
+
+[[package]]
+name = "anstyle-parse"
+version = "0.2.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3b2d16507662817a6a20a9ea92df6652ee4f94f914589377d69f3b21bc5798a9"
+dependencies = [
+ "utf8parse",
+]
+
+[[package]]
+name = "anstyle-query"
+version = "1.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "79947af37f4177cfead1110013d678905c37501914fba0efea834c3fe9a8d60c"
+dependencies = [
+ "windows-sys",
+]
+
+[[package]]
+name = "anstyle-wincon"
+version = "3.0.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6680de5231bd6ee4c6191b8a1325daa282b415391ec9d3a37bd34f2060dc73fa"
+dependencies = [
+ "anstyle",
+ "once_cell_polyfill",
+ "windows-sys",
+]
+
+[[package]]
+name = "atomic"
+version = "0.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8d818003e740b63afc82337e3160717f4f63078720a810b7b903e70a5d1d2994"
+dependencies = [
+ "bytemuck",
+]
+
+[[package]]
+name = "atomic-traits"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "707f750b93bd1b739cf9ddf85f8fe7c97a4a62c60ccf8b6f232514bd9103bedc"
+dependencies = [
+ "cfg-if",
+ "rustc_version",
+]
+
+[[package]]
+name = "atomic_refcell"
+version = "0.1.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "41e67cd8309bbd06cd603a9e693a784ac2e5d1e955f11286e355089fcab3047c"
+
+[[package]]
+name = "autocfg"
+version = "1.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ace50bade8e6234aa140d9a2f552bbee1db4d353f69b8217bc503490fc1a9f26"
+
+[[package]]
+name = "bitflags"
+version = "2.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1b8e56985ec62d17e9c1001dc89c88ecd7dc08e47eba5ec7c29c7b5eeecde967"
+
+[[package]]
+name = "built"
+version = "0.7.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56ed6191a7e78c36abdb16ab65341eefd73d64d303fffccdbb00d51e4205967b"
+dependencies = [
+ "git2",
+]
+
+[[package]]
+name = "bytemuck"
+version = "1.23.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9134a6ef01ce4b366b50689c94f82c14bc72bc5d0386829828a2e2752ef7958c"
+dependencies = [
+ "bytemuck_derive",
+]
+
+[[package]]
+name = "bytemuck_derive"
+version = "1.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3fa76293b4f7bb636ab88fd78228235b5248b4d05cc589aed610f954af5d7c7a"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "cc"
+version = "1.2.24"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "16595d3be041c03b09d08d0858631facccee9221e579704070e6e9e4915d3bc7"
+dependencies = [
+ "jobserver",
+ "libc",
+ "shlex",
+]
+
+[[package]]
+name = "cfg-if"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
+
+[[package]]
+name = "colorchoice"
+version = "1.0.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5b63caa9aa9397e2d9480a9b13673856c78d8ac123288526c37d7839f2a86990"
+
+[[package]]
+name = "core-foundation-sys"
+version = "0.8.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "773648b94d0e5d620f64f280777445740e61fe701025087ec8b57f45c791888b"
+
+[[package]]
+name = "crossbeam"
+version = "0.8.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1137cd7e7fc0fb5d3c5a8678be38ec56e819125d8d7907411fe24ccb943faca8"
+dependencies = [
+ "crossbeam-channel",
+ "crossbeam-deque",
+ "crossbeam-epoch",
+ "crossbeam-queue",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-channel"
+version = "0.5.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "82b8f8f868b36967f9606790d1903570de9ceaf870a7bf9fbbd3016d636a2cb2"
+dependencies = [
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-deque"
+version = "0.8.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9dd111b7b7f7d55b72c0a6ae361660ee5853c9af73f70c3c2ef6858b950e2e51"
+dependencies = [
+ "crossbeam-epoch",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-epoch"
+version = "0.9.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5b82ac4a3c2ca9c3460964f020e1402edd5753411d7737aa39c3714ad1b5420e"
+dependencies = [
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-queue"
+version = "0.3.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0f58bbc28f91df819d0aa2a2c00cd19754769c2fad90579b3592b1c9ba7a3115"
+dependencies = [
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-utils"
+version = "0.8.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d0a5c400df2834b80a4c3327b3aad3a4c4cd4de0629063962b03235697506a28"
+
+[[package]]
+name = "delegate"
+version = "0.13.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9b6483c2bbed26f97861cf57651d4f2b731964a28cd2257f934a4b452480d21"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "downcast-rs"
+version = "2.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ea8a8b81cacc08888170eef4d13b775126db426d0b348bee9d18c2c1eaf123cf"
+
+[[package]]
+name = "either"
+version = "1.15.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "48c757948c5ede0e46177b7add2e67155f70e33c07fea8284df6576da70b3719"
+
+[[package]]
+name = "enum-map"
+version = "2.7.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6866f3bfdf8207509a033af1a75a7b08abda06bbaaeae6669323fd5a097df2e9"
+dependencies = [
+ "enum-map-derive",
+]
+
+[[package]]
+name = "enum-map-derive"
+version = "0.17.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f282cfdfe92516eb26c2af8589c274c7c17681f5ecc03c18255fe741c6aa64eb"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "env_filter"
+version = "0.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "186e05a59d4c50738528153b83b0b0194d3a29507dfec16eccd4b342903397d0"
+dependencies = [
+ "log",
+ "regex",
+]
+
+[[package]]
+name = "env_logger"
+version = "0.11.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "13c863f0904021b108aa8b2f55046443e6b1ebde8fd4a15c399893aae4fa069f"
+dependencies = [
+ "anstream",
+ "anstyle",
+ "env_filter",
+ "jiff",
+ "log",
+]
+
+[[package]]
+name = "form_urlencoded"
+version = "1.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e13624c2627564efccf4934284bdd98cbaa14e79b0b5a141218e507b3a823456"
+dependencies = [
+ "percent-encoding",
+]
+
+[[package]]
+name = "getrandom"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "26145e563e54f2cadc477553f1ec5ee650b00862f0a58bcd12cbdc5f0ea2d2f4"
+dependencies = [
+ "cfg-if",
+ "libc",
+ "r-efi",
+ "wasi",
+]
+
+[[package]]
+name = "git2"
+version = "0.20.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7b88256088d75a56f8ecfa070513a775dd9107f6530ef14919dac831af9cfe2b"
+dependencies = [
+ "bitflags",
+ "libc",
+ "libgit2-sys",
+ "log",
+ "url",
+]
+
+[[package]]
+name = "heck"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2304e00983f87ffb38b55b444b5e3b60a884b5d30c0fca7d82fe33449bbe55ea"
+
+[[package]]
+name = "hermit-abi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d231dfb89cfffdbc30e7fc41579ed6066ad03abda9e567ccafae602b97ec5024"
+
+[[package]]
+name = "hermit-abi"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f154ce46856750ed433c8649605bf7ed2de3bc35fd9d2a9f30cddd873c80cb08"
+
+[[package]]
+name = "idna"
+version = "1.0.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "686f825264d630750a544639377bae737628043f20d38bbc029e8f29ea968a7e"
+dependencies = [
+ "idna_adapter",
+ "smallvec",
+ "utf8_iter",
+]
+
+[[package]]
+name = "idna_adapter"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "279259b0ac81c89d11c290495fdcfa96ea3643b7df311c138b6fe8ca5237f0f8"
+dependencies = [
+ "idna_mapping",
+ "unicode-bidi",
+ "unicode-normalization",
+]
+
+[[package]]
+name = "idna_mapping"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "11c13906586a4b339310541a274dd927aff6fcbb5b8e3af90634c4b31681c792"
+dependencies = [
+ "unicode-joining-type",
+]
+
+[[package]]
+name = "is-terminal"
+version = "0.4.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e04d7f318608d35d4b61ddd75cbdaee86b023ebe2bd5a66ee0915f0bf93095a9"
+dependencies = [
+ "hermit-abi 0.5.1",
+ "libc",
+ "windows-sys",
+]
+
+[[package]]
+name = "is_terminal_polyfill"
+version = "1.70.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7943c866cc5cd64cbc25b2e01621d07fa8eb2a1a23160ee81ce38704e97b8ecf"
+
+[[package]]
+name = "itertools"
+version = "0.14.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2b192c782037fadd9cfa75548310488aabdbf3d2da73885b31bd0abd03351285"
+dependencies = [
+ "either",
+]
+
+[[package]]
+name = "jiff"
+version = "0.2.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a194df1107f33c79f4f93d02c80798520551949d59dfad22b6157048a88cca93"
+dependencies = [
+ "jiff-static",
+ "log",
+ "portable-atomic",
+ "portable-atomic-util",
+ "serde",
+]
+
+[[package]]
+name = "jiff-static"
+version = "0.2.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6c6e1db7ed32c6c71b759497fae34bf7933636f75a251b9e736555da426f6442"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "jobserver"
+version = "0.1.33"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "38f262f097c174adebe41eb73d66ae9c06b2844fb0da69969647bbddd9b0538a"
+dependencies = [
+ "getrandom",
+ "libc",
+]
+
+[[package]]
+name = "lazy_static"
+version = "1.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bbd2bcb4c963f2ddae06a2efc7e9f3591312473c50c6685e1f298068316e66fe"
+
+[[package]]
+name = "libc"
+version = "0.2.172"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d750af042f7ef4f724306de029d18836c26c1765a54a6a3f094cbd23a7267ffa"
+
+[[package]]
+name = "libgit2-sys"
+version = "0.18.3+1.9.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c9b3acc4b91781bb0b3386669d325163746af5f6e4f73e6d2d630e09a35f3487"
+dependencies = [
+ "cc",
+ "libc",
+ "libz-sys",
+ "pkg-config",
+]
+
+[[package]]
+name = "libz-sys"
+version = "1.1.22"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8b70e7a7df205e92a1a4cd9aaae7898dac0aa555503cc0a649494d0d60e7651d"
+dependencies = [
+ "cc",
+ "libc",
+ "pkg-config",
+ "vcpkg",
+]
+
+[[package]]
+name = "lock_api"
+version = "0.4.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "07af8b9cdd281b7915f413fa73f29ebd5d55d0d3f0155584dade1ff18cea1b17"
+dependencies = [
+ "autocfg",
+ "scopeguard",
+]
+
+[[package]]
+name = "log"
+version = "0.4.27"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "13dc2df351e3202783a1fe0d44375f7295ffb4049267b0f3018346dc122a1d94"
+
+[[package]]
+name = "memchr"
+version = "2.7.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "78ca9ab1a0babb1e7d5695e3530886289c18cf2f87ec19a575a0abdce112e3a3"
+
+[[package]]
+name = "memoffset"
+version = "0.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "488016bfae457b036d996092f6cb448677611ce4449e970ceaf42695203f218a"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "mmtk"
+version = "0.31.0"
+source = "git+https://github.com/mmtk/mmtk-core.git?rev=c6317a3f1c262e33fc2e427e4cc999c17bcc4791#c6317a3f1c262e33fc2e427e4cc999c17bcc4791"
+dependencies = [
+ "atomic",
+ "atomic-traits",
+ "atomic_refcell",
+ "built",
+ "bytemuck",
+ "bytemuck_derive",
+ "cfg-if",
+ "crossbeam",
+ "delegate",
+ "downcast-rs",
+ "enum-map",
+ "env_logger",
+ "idna_adapter",
+ "is-terminal",
+ "itertools",
+ "lazy_static",
+ "libc",
+ "log",
+ "memoffset",
+ "mmtk-macros",
+ "num-traits",
+ "num_cpus",
+ "portable-atomic",
+ "probe",
+ "rayon-core",
+ "regex",
+ "rustversion",
+ "spin",
+ "static_assertions",
+ "strum",
+ "strum_macros",
+ "sysinfo 0.33.1",
+]
+
+[[package]]
+name = "mmtk-macros"
+version = "0.31.0"
+source = "git+https://github.com/mmtk/mmtk-core.git?rev=c6317a3f1c262e33fc2e427e4cc999c17bcc4791#c6317a3f1c262e33fc2e427e4cc999c17bcc4791"
+dependencies = [
+ "proc-macro-error",
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "mmtk_ruby"
+version = "0.1.0"
+dependencies = [
+ "atomic_refcell",
+ "env_logger",
+ "libc",
+ "log",
+ "mmtk",
+ "once_cell",
+ "probe",
+ "sysinfo 0.32.1",
+]
+
+[[package]]
+name = "ntapi"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e8a3895c6391c39d7fe7ebc444a87eb2991b2a0bc718fdabd071eec617fc68e4"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "num-traits"
+version = "0.2.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "071dfc062690e90b734c0b2273ce72ad0ffa95f0c74596bc250dcfd960262841"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "num_cpus"
+version = "1.16.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4161fcb6d602d4d2081af7c3a45852d875a03dd337a6bfdd6e06407b61342a43"
+dependencies = [
+ "hermit-abi 0.3.9",
+ "libc",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "42f5e15c9953c5e4ccceeb2e7382a716482c34515315f7b03532b8b4e8393d2d"
+
+[[package]]
+name = "once_cell_polyfill"
+version = "1.70.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a4895175b425cb1f87721b59f0f286c2092bd4af812243672510e1ac53e2e0ad"
+
+[[package]]
+name = "percent-encoding"
+version = "2.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e3148f5046208a5d56bcfc03053e3ca6334e51da8dfb19b6cdc8b306fae3283e"
+
+[[package]]
+name = "pkg-config"
+version = "0.3.32"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7edddbd0b52d732b21ad9a5fab5c704c14cd949e5e9a1ec5929a24fded1b904c"
+
+[[package]]
+name = "portable-atomic"
+version = "1.11.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "350e9b48cbc6b0e028b0473b114454c6316e57336ee184ceab6e53f72c178b3e"
+
+[[package]]
+name = "portable-atomic-util"
+version = "0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d8a2f0d8d040d7848a709caf78912debcc3f33ee4b3cac47d73d1e1069e83507"
+dependencies = [
+ "portable-atomic",
+]
+
+[[package]]
+name = "probe"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d8e2d2444b730c8f027344c60f9e1f1554d7a3342df9bdd425142ed119a6e5a3"
+
+[[package]]
+name = "proc-macro-error"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "da25490ff9892aab3fcf7c36f08cfb902dd3e71ca0f9f9517bea02a73a5ce38c"
+dependencies = [
+ "proc-macro-error-attr",
+ "proc-macro2",
+ "quote",
+ "syn 1.0.109",
+ "version_check",
+]
+
+[[package]]
+name = "proc-macro-error-attr"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a1be40180e52ecc98ad80b184934baf3d0d29f979574e439af5a55274b35f869"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "version_check",
+]
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.95"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "02b3e5e68a3a1a02aad3ec490a98007cbc13c37cbe84a3cd7b8e406d76e7f778"
+dependencies = [
+ "unicode-ident",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.40"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1885c039570dc00dcb4ff087a89e185fd56bae234ddc7f056a945bf36467248d"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "r-efi"
+version = "5.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "74765f6d916ee2faa39bc8e68e4f3ed8949b48cccdac59983d287a7cb71ce9c5"
+
+[[package]]
+name = "rayon"
+version = "1.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b418a60154510ca1a002a752ca9714984e21e4241e804d32555251faf8b78ffa"
+dependencies = [
+ "either",
+ "rayon-core",
+]
+
+[[package]]
+name = "rayon-core"
+version = "1.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1465873a3dfdaa8ae7cb14b4383657caab0b3e8a0aa9ae8e04b044854c8dfce2"
+dependencies = [
+ "crossbeam-deque",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "regex"
+version = "1.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b544ef1b4eac5dc2db33ea63606ae9ffcfac26c1416a2806ae0bf5f56b201191"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-automata",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-automata"
+version = "0.4.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "809e8dc61f6de73b46c85f4c96486310fe304c434cfa43669d7b40f711150908"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2b15c43186be67a4fd63bee50d0303afffcef381492ebe2c5d87f324e1b8815c"
+
+[[package]]
+name = "rustc_version"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cfcb3a22ef46e85b45de6ee7e79d063319ebb6594faafcf1c225ea92ab6e9b92"
+dependencies = [
+ "semver",
+]
+
+[[package]]
+name = "rustversion"
+version = "1.0.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8a0d197bd2c9dc6e53b84da9556a69ba4cdfab8619eb41a8bd1cc2027a0f6b1d"
+
+[[package]]
+name = "scopeguard"
+version = "1.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "94143f37725109f92c262ed2cf5e59bce7498c01bcc1502d7b9afe439a4e9f49"
+
+[[package]]
+name = "semver"
+version = "1.0.26"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "56e6fa9c48d24d85fb3de5ad847117517440f6beceb7798af16b4a87d616b8d0"
+
+[[package]]
+name = "serde"
+version = "1.0.219"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5f0e2c6ed6606019b4e29e69dbaba95b11854410e5347d525002456dbbb786b6"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.219"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5b0276cf7f2c73365f7157c8123c21cd9a50fbbd844757af28ca1f5925fc2a00"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "shlex"
+version = "1.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0fda2ff0d084019ba4d7c6f371c95d8fd75ce3524c3cb8fb653a3023f6323e64"
+
+[[package]]
+name = "smallvec"
+version = "1.15.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8917285742e9f3e1683f0a9c4e6b57960b7314d0b08d30d1ecd426713ee2eee9"
+
+[[package]]
+name = "spin"
+version = "0.9.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6980e8d7511241f8acf4aebddbb1ff938df5eebe98691418c4468d0b72a96a67"
+dependencies = [
+ "lock_api",
+]
+
+[[package]]
+name = "static_assertions"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2eb9349b6444b326872e140eb1cf5e7c522154d69e7a0ffb0fb81c06b37543f"
+
+[[package]]
+name = "strum"
+version = "0.27.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f64def088c51c9510a8579e3c5d67c65349dcf755e5479ad3d010aa6454e2c32"
+
+[[package]]
+name = "strum_macros"
+version = "0.27.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c77a8c5abcaf0f9ce05d62342b7d298c346515365c36b673df4ebe3ced01fde8"
+dependencies = [
+ "heck",
+ "proc-macro2",
+ "quote",
+ "rustversion",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "syn"
+version = "1.0.109"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "72b64191b275b66ffe2469e8af2c1cfe3bafa67b529ead792a6d0160888b4237"
+dependencies = [
+ "proc-macro2",
+ "unicode-ident",
+]
+
+[[package]]
+name = "syn"
+version = "2.0.101"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ce2b7fc941b3a24138a0a7cf8e858bfc6a992e7978a068a5c760deb0ed43caf"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-ident",
+]
+
+[[package]]
+name = "sysinfo"
+version = "0.32.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4c33cd241af0f2e9e3b5c32163b873b29956890b5342e6745b917ce9d490f4af"
+dependencies = [
+ "core-foundation-sys",
+ "libc",
+ "memchr",
+ "ntapi",
+ "rayon",
+ "windows",
+]
+
+[[package]]
+name = "sysinfo"
+version = "0.33.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4fc858248ea01b66f19d8e8a6d55f41deaf91e9d495246fd01368d99935c6c01"
+dependencies = [
+ "core-foundation-sys",
+ "libc",
+ "memchr",
+ "ntapi",
+ "rayon",
+ "windows",
+]
+
+[[package]]
+name = "tinyvec"
+version = "1.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09b3661f17e86524eccd4371ab0429194e0d7c008abb45f7a7495b1719463c71"
+dependencies = [
+ "tinyvec_macros",
+]
+
+[[package]]
+name = "tinyvec_macros"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1f3ccbac311fea05f86f61904b462b55fb3df8837a366dfc601a0161d0532f20"
+
+[[package]]
+name = "unicode-bidi"
+version = "0.3.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c1cb5db39152898a79168971543b1cb5020dff7fe43c8dc468b0885f5e29df5"
+
+[[package]]
+name = "unicode-ident"
+version = "1.0.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5a5f39404a5da50712a4c1eecf25e90dd62b613502b7e925fd4e4d19b5c96512"
+
+[[package]]
+name = "unicode-joining-type"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d8d00a78170970967fdb83f9d49b92f959ab2bb829186b113e4f4604ad98e180"
+
+[[package]]
+name = "unicode-normalization"
+version = "0.1.24"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5033c97c4262335cded6d6fc3e5c18ab755e1a3dc96376350f3d8e9f009ad956"
+dependencies = [
+ "tinyvec",
+]
+
+[[package]]
+name = "url"
+version = "2.5.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "32f8b686cadd1473f4bd0117a5d28d36b1ade384ea9b5069a1c40aefed7fda60"
+dependencies = [
+ "form_urlencoded",
+ "idna",
+ "percent-encoding",
+]
+
+[[package]]
+name = "utf8_iter"
+version = "1.0.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b6c140620e7ffbb22c2dee59cafe6084a59b5ffc27a8859a5f0d494b5d52b6be"
+
+[[package]]
+name = "utf8parse"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "06abde3611657adf66d383f00b093d7faecc7fa57071cce2578660c9f1010821"
+
+[[package]]
+name = "vcpkg"
+version = "0.2.15"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "accd4ea62f7bb7a82fe23066fb0957d48ef677f6eeb8215f372f52e48bb32426"
+
+[[package]]
+name = "version_check"
+version = "0.9.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b928f33d975fc6ad9f86c8f283853ad26bdd5b10b7f1542aa2fa15e2289105a"
+
+[[package]]
+name = "wasi"
+version = "0.14.2+wasi-0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9683f9a5a998d873c0d21fcbe3c083009670149a8fab228644b8bd36b2c48cb3"
+dependencies = [
+ "wit-bindgen-rt",
+]
+
+[[package]]
+name = "winapi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
+dependencies = [
+ "winapi-i686-pc-windows-gnu",
+ "winapi-x86_64-pc-windows-gnu",
+]
+
+[[package]]
+name = "winapi-i686-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"
+
+[[package]]
+name = "winapi-x86_64-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"
+
+[[package]]
+name = "windows"
+version = "0.57.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "12342cb4d8e3b046f3d80effd474a7a02447231330ef77d71daa6fbc40681143"
+dependencies = [
+ "windows-core",
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-core"
+version = "0.57.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2ed2439a290666cd67ecce2b0ffaad89c2a56b976b736e6ece670297897832d"
+dependencies = [
+ "windows-implement",
+ "windows-interface",
+ "windows-result",
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-implement"
+version = "0.57.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9107ddc059d5b6fbfbffdfa7a7fe3e22a226def0b2608f72e9d552763d3e1ad7"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "windows-interface"
+version = "0.57.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "29bee4b38ea3cde66011baa44dba677c432a78593e202392d1e9070cf2a7fca7"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn 2.0.101",
+]
+
+[[package]]
+name = "windows-result"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5e383302e8ec8515204254685643de10811af0ed97ea37210dc26fb0032647f8"
+dependencies = [
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-sys"
+version = "0.59.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1e38bc4d79ed67fd075bcc251a1c39b32a1776bbe92e5bef1f0bf1f8c531853b"
+dependencies = [
+ "windows-targets",
+]
+
+[[package]]
+name = "windows-targets"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9b724f72796e036ab90c1021d4780d4d3d648aca59e491e6b98e725b84e99973"
+dependencies = [
+ "windows_aarch64_gnullvm",
+ "windows_aarch64_msvc",
+ "windows_i686_gnu",
+ "windows_i686_gnullvm",
+ "windows_i686_msvc",
+ "windows_x86_64_gnu",
+ "windows_x86_64_gnullvm",
+ "windows_x86_64_msvc",
+]
+
+[[package]]
+name = "windows_aarch64_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "32a4622180e7a0ec044bb555404c800bc9fd9ec262ec147edd5989ccd0c02cd3"
+
+[[package]]
+name = "windows_aarch64_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09ec2a7bb152e2252b53fa7803150007879548bc709c039df7627cabbd05d469"
+
+[[package]]
+name = "windows_i686_gnu"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8e9b5ad5ab802e97eb8e295ac6720e509ee4c243f69d781394014ebfe8bbfa0b"
+
+[[package]]
+name = "windows_i686_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0eee52d38c090b3caa76c563b86c3a4bd71ef1a819287c19d586d7334ae8ed66"
+
+[[package]]
+name = "windows_i686_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "240948bc05c5e7c6dabba28bf89d89ffce3e303022809e73deaefe4f6ec56c66"
+
+[[package]]
+name = "windows_x86_64_gnu"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "147a5c80aabfbf0c7d901cb5895d1de30ef2907eb21fbbab29ca94c5b08b1a78"
+
+[[package]]
+name = "windows_x86_64_gnullvm"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "24d5b23dc417412679681396f2b49f3de8c1473deb516bd34410872eff51ed0d"
+
+[[package]]
+name = "windows_x86_64_msvc"
+version = "0.52.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "589f6da84c646204747d1270a2a5661ea66ed1cced2631d546fdfb155959f9ec"
+
+[[package]]
+name = "wit-bindgen-rt"
+version = "0.39.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6f42320e61fe2cfd34354ecb597f86f413484a798ba44a8ca1165c58d42da6c1"
+dependencies = [
+ "bitflags",
+]
diff --git a/gc/mmtk/Cargo.toml b/gc/mmtk/Cargo.toml
new file mode 100644
index 0000000000..d856122900
--- /dev/null
+++ b/gc/mmtk/Cargo.toml
@@ -0,0 +1,42 @@
+[package]
+name = "mmtk_ruby"
+version = "0.1.0"
+authors = []
+edition = "2021"
+
+[lib]
+name = "mmtk_ruby"
+crate-type = ["cdylib", "staticlib"]
+
+[profile.release]
+lto = true
+
+[dependencies]
+libc = "0.2"
+log = "0.4.14"
+env_logger = "0.11.3"
+once_cell = "1.17.0"
+atomic_refcell = "0.1.9"
+probe = "0.5"
+sysinfo = "0.32.0"
+
+[dependencies.mmtk]
+features = ["is_mmtk_object", "object_pinning", "sticky_immix_non_moving_nursery"]
+
+# Uncomment the following lines to use mmtk-core from the official repository.
+git = "https://github.com/mmtk/mmtk-core.git"
+rev = "c6317a3f1c262e33fc2e427e4cc999c17bcc4791"
+
+# Uncomment the following line to use mmtk-core from a local repository.
+# path = "../../../mmtk-core"
+
+[features]
+default = []
+
+# When moving an object, clear its original copy.
+clear_old_copy = []
+
+# Enable extra assertions in release build.  For debugging.
+extra_assert = []
+
+[workspace]
diff --git a/gc/mmtk/cbindgen.toml b/gc/mmtk/cbindgen.toml
new file mode 100644
index 0000000000..b99c30efc8
--- /dev/null
+++ b/gc/mmtk/cbindgen.toml
@@ -0,0 +1,36 @@
+language = "C"
+
+include_guard = "MMTK_H"
+
+autogen_warning = "/* Warning, this file is autogenerated by cbindgen from the mmtk-ruby repository. Don't modify this manually. */"
+
+tab_width = 4
+
+usize_is_size_t = true
+
+after_includes = """
+
+typedef struct MMTk_Builder MMTk_Builder;
+typedef struct MMTk_Mutator MMTk_Mutator;
+
+typedef struct MMTk_ractor_cache *MMTk_VMThread;
+typedef struct MMTk_ractor_cache *MMTk_VMMutatorThread;
+typedef struct MMTk_GCThreadTLS *MMTk_VMWorkerThread;
+typedef void *MMTk_Address;
+typedef void *MMTk_ObjectReference;
+typedef void *MMTk_NullableObjectReference;
+typedef uint32_t MMTk_AllocationSemantics;
+
+typedef struct MMTk_BumpPointer {
+    uintptr_t cursor;
+    uintptr_t limit;
+} MMTk_BumpPointer;
+"""
+
+[export]
+exclude = ["RubyMutator"]
+prefix = "MMTk_"
+
+[export.rename]
+"MMTKBuilder" = "Builder"
+"RubyMutator" = "Mutator"
diff --git a/gc/mmtk/depend b/gc/mmtk/depend
new file mode 100644
index 0000000000..77b229af36
--- /dev/null
+++ b/gc/mmtk/depend
@@ -0,0 +1,18 @@
+$(TARGET_SO): $(MMTK_BUILD)/$(LIBMMTK_RUBY)
+
+# Add the `libmmtk_ruby.a` target to run `cargo build`
+
+release/$(LIBMMTK_RUBY) debug/$(LIBMMTK_RUBY): $(RUSTSRCS) $(srcdir)/Cargo.toml $(srcdir)/Cargo.toml
+
+release/$(LIBMMTK_RUBY):
+	CARGO_TARGET_DIR="." cargo build --manifest-path=$(srcdir)/Cargo.toml --release
+
+debug/$(LIBMMTK_RUBY):
+	CARGO_TARGET_DIR="." cargo build --manifest-path=$(srcdir)/Cargo.toml
+
+clean: clean-mmtk
+
+.PHONY: clean-mmtk
+clean-mmtk:
+	-$(Q)$(RM_RF) debug release
+	-$(Q)$(RM) .rustc_info.json
diff --git a/gc/mmtk/extconf.rb b/gc/mmtk/extconf.rb
new file mode 100644
index 0000000000..c0e788037e
--- /dev/null
+++ b/gc/mmtk/extconf.rb
@@ -0,0 +1,24 @@
+# frozen_string_literal: true
+
+require_relative "../extconf_base"
+
+# Statically link `libmmtk_ruby.a`
+$LIBS << " $(MMTK_BUILD)/$(LIBMMTK_RUBY)"
+
+rustsrcs = Dir.glob("src/*.rs", base: __dir__).map {|s| "$(srcdir)/#{s}"}
+
+create_gc_makefile("mmtk") do |makefile|
+  [
+    *makefile,
+
+    <<~MAKEFILE,
+    MMTK_BUILD = debug
+    LIBMMTK_RUBY = libmmtk_ruby.#$LIBEXT
+    RUSTSRCS = #{rustsrcs.join(" \\\n\t   ")}
+
+    ifeq ($(MMTK_BUILD), debug)
+    CPPFLAGS += -DMMTK_DEBUG
+    endif
+    MAKEFILE
+  ]
+end
diff --git a/gc/mmtk/mmtk.c b/gc/mmtk/mmtk.c
new file mode 100644
index 0000000000..8be69b4fe6
--- /dev/null
+++ b/gc/mmtk/mmtk.c
@@ -0,0 +1,1658 @@
+#include <pthread.h>
+#include <stdbool.h>
+
+#include "ruby/assert.h"
+#include "ruby/atomic.h"
+#include "ruby/debug.h"
+
+#include "gc/gc.h"
+#include "gc/gc_impl.h"
+#include "gc/mmtk/mmtk.h"
+
+#include "ccan/list/list.h"
+#include "darray.h"
+
+#ifdef __APPLE__
+#include <sys/sysctl.h>
+#endif
+
+struct objspace {
+    bool measure_gc_time;
+    bool gc_stress;
+
+    size_t gc_count;
+    size_t moving_gc_count;
+    size_t total_gc_time;
+    size_t total_allocated_objects;
+
+    st_table *finalizer_table;
+    struct MMTk_final_job *finalizer_jobs;
+    rb_postponed_job_handle_t finalizer_postponed_job;
+
+    struct ccan_list_head ractor_caches;
+    unsigned long live_ractor_cache_count;
+
+    pthread_mutex_t mutex;
+    rb_atomic_t mutator_blocking_count;
+    bool world_stopped;
+    pthread_cond_t cond_world_stopped;
+    pthread_cond_t cond_world_started;
+    size_t start_the_world_count;
+
+    pthread_mutex_t event_hook_mutex;
+
+    struct {
+        bool gc_thread_crashed;
+        char crash_msg[256];
+    } crash_context;
+
+    struct rb_gc_vm_context vm_context;
+
+    unsigned int fork_hook_vm_lock_lev;
+};
+
+#define OBJ_FREE_BUF_CAPACITY 128
+
+struct MMTk_ractor_cache {
+    struct ccan_list_node list_node;
+
+    MMTk_Mutator *mutator;
+    bool gc_mutator_p;
+
+    MMTk_BumpPointer *bump_pointer;
+
+    MMTk_ObjectReference obj_free_parallel_buf[OBJ_FREE_BUF_CAPACITY];
+    size_t obj_free_parallel_count;
+    MMTk_ObjectReference obj_free_non_parallel_buf[OBJ_FREE_BUF_CAPACITY];
+    size_t obj_free_non_parallel_count;
+};
+
+struct MMTk_final_job {
+    struct MMTk_final_job *next;
+    enum {
+        MMTK_FINAL_JOB_DFREE,
+        MMTK_FINAL_JOB_FINALIZE,
+    } kind;
+    union {
+        struct {
+            void (*func)(void *);
+            void *data;
+        } dfree;
+        struct {
+            /* HACK: we store the object ID on the 0th element of this array. */
+            VALUE finalizer_array;
+        } finalize;
+    } as;
+};
+
+#ifdef RB_THREAD_LOCAL_SPECIFIER
+RB_THREAD_LOCAL_SPECIFIER struct MMTk_GCThreadTLS *rb_mmtk_gc_thread_tls;
+
+RB_THREAD_LOCAL_SPECIFIER VALUE marking_parent_object;
+#else
+# error We currently need language-supported TLS
+#endif
+
+#ifdef MMTK_DEBUG
+# define MMTK_ASSERT(expr, ...) RUBY_ASSERT_ALWAYS(expr, #expr RBIMPL_VA_OPT_ARGS(__VA_ARGS__))
+#else
+# define MMTK_ASSERT(expr, ...) ((void)0)
+#endif
+
+#include <pthread.h>
+
+static inline VALUE rb_mmtk_call_object_closure(VALUE obj, bool pin);
+
+static void
+rb_mmtk_init_gc_worker_thread(MMTk_VMWorkerThread gc_thread_tls)
+{
+    rb_mmtk_gc_thread_tls = gc_thread_tls;
+}
+
+static bool
+rb_mmtk_is_mutator(void)
+{
+    return ruby_native_thread_p();
+}
+
+static void
+rb_mmtk_stop_the_world(void)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    int err;
+    if ((err = pthread_mutex_lock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot lock objspace->mutex: %s", strerror(err));
+    }
+
+    while (!objspace->world_stopped) {
+        pthread_cond_wait(&objspace->cond_world_stopped, &objspace->mutex);
+    }
+
+    if ((err = pthread_mutex_unlock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot release objspace->mutex: %s", strerror(err));
+    }
+}
+
+static void
+rb_mmtk_resume_mutators(bool current_gc_may_move)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    int err;
+    if ((err = pthread_mutex_lock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot lock objspace->mutex: %s", strerror(err));
+    }
+
+    objspace->world_stopped = false;
+    objspace->gc_count++;
+    if (current_gc_may_move) objspace->moving_gc_count++;
+    pthread_cond_broadcast(&objspace->cond_world_started);
+
+    if ((err = pthread_mutex_unlock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot release objspace->mutex: %s", strerror(err));
+    }
+}
+
+static void mmtk_flush_obj_free_buffer(struct MMTk_ractor_cache *cache);
+
+static void
+rb_mmtk_block_for_gc(MMTk_VMMutatorThread mutator)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    size_t starting_gc_count = objspace->gc_count;
+    RUBY_ATOMIC_INC(objspace->mutator_blocking_count);
+    int lock_lev = RB_GC_VM_LOCK();
+    RUBY_ATOMIC_DEC(objspace->mutator_blocking_count);
+    int err;
+    if ((err = pthread_mutex_lock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot lock objspace->mutex: %s", strerror(err));
+    }
+
+    if (objspace->gc_count == starting_gc_count) {
+        rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_START);
+
+        rb_gc_initialize_vm_context(&objspace->vm_context);
+
+        mutator->gc_mutator_p = true;
+
+        struct timespec gc_start_time;
+        if (objspace->measure_gc_time) {
+            clock_gettime(CLOCK_MONOTONIC, &gc_start_time);
+        }
+
+        rb_gc_save_machine_context();
+
+        rb_gc_vm_barrier();
+
+        struct MMTk_ractor_cache *rc;
+        ccan_list_for_each(&objspace->ractor_caches, rc, list_node) {
+            mmtk_flush_obj_free_buffer(rc);
+        }
+
+        objspace->world_stopped = true;
+
+        pthread_cond_broadcast(&objspace->cond_world_stopped);
+
+        // Wait for GC end
+        while (objspace->world_stopped) {
+            pthread_cond_wait(&objspace->cond_world_started, &objspace->mutex);
+        }
+
+        if (RB_UNLIKELY(objspace->crash_context.gc_thread_crashed)) {
+            rb_bug("%s", objspace->crash_context.crash_msg);
+        }
+
+        if (objspace->measure_gc_time) {
+            struct timespec gc_end_time;
+            clock_gettime(CLOCK_MONOTONIC, &gc_end_time);
+
+            objspace->total_gc_time +=
+                (gc_end_time.tv_sec - gc_start_time.tv_sec) * (1000 * 1000 * 1000) +
+                    (gc_end_time.tv_nsec - gc_start_time.tv_nsec);
+        }
+    }
+
+    if ((err = pthread_mutex_unlock(&objspace->mutex)) != 0) {
+        rb_bug("ERROR: cannot release objspace->mutex: %s", strerror(err));
+    }
+    RB_GC_VM_UNLOCK(lock_lev);
+}
+
+static void
+rb_mmtk_before_updating_jit_code(void)
+{
+    rb_gc_before_updating_jit_code();
+}
+
+static void
+rb_mmtk_after_updating_jit_code(void)
+{
+    rb_gc_after_updating_jit_code();
+}
+
+static size_t
+rb_mmtk_number_of_mutators(void)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+    return objspace->live_ractor_cache_count;
+}
+
+static void
+rb_mmtk_get_mutators(void (*visit_mutator)(MMTk_Mutator *mutator, void *data), void *data)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+    struct MMTk_ractor_cache *ractor_cache;
+
+    ccan_list_for_each(&objspace->ractor_caches, ractor_cache, list_node) {
+        visit_mutator(ractor_cache->mutator, data);
+    }
+}
+
+static void
+rb_mmtk_scan_gc_roots(void)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    rb_gc_mark_roots(objspace, NULL);
+}
+
+static int
+pin_value(st_data_t key, st_data_t value, st_data_t data)
+{
+    rb_gc_impl_mark_and_pin((void *)data, (VALUE)value);
+
+    return ST_CONTINUE;
+}
+
+static void
+rb_mmtk_scan_objspace(void)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    if (objspace->finalizer_table != NULL) {
+        st_foreach(objspace->finalizer_table, pin_value, (st_data_t)objspace);
+    }
+
+    struct MMTk_final_job *job = objspace->finalizer_jobs;
+    while (job != NULL) {
+        switch (job->kind) {
+          case MMTK_FINAL_JOB_DFREE:
+            break;
+          case MMTK_FINAL_JOB_FINALIZE:
+            rb_gc_impl_mark(objspace, job->as.finalize.finalizer_array);
+            break;
+          default:
+            rb_bug("rb_mmtk_scan_objspace: unknown final job type %d", job->kind);
+        }
+
+        job = job->next;
+    }
+}
+
+static void
+rb_mmtk_move_obj_during_marking(MMTk_ObjectReference from, MMTk_ObjectReference to)
+{
+    rb_gc_move_obj_during_marking((VALUE)from, (VALUE)to);
+}
+
+static void
+rb_mmtk_update_object_references(MMTk_ObjectReference mmtk_object)
+{
+    VALUE object = (VALUE)mmtk_object;
+
+    if (!RB_FL_TEST(object, RUBY_FL_WEAK_REFERENCE)) {
+        marking_parent_object = object;
+        rb_gc_update_object_references(rb_gc_get_objspace(), object);
+        marking_parent_object = 0;
+    }
+}
+
+static void
+rb_mmtk_call_gc_mark_children(MMTk_ObjectReference object)
+{
+    marking_parent_object = (VALUE)object;
+    rb_gc_mark_children(rb_gc_get_objspace(), (VALUE)object);
+    marking_parent_object = 0;
+}
+
+static void
+rb_mmtk_handle_weak_references(MMTk_ObjectReference mmtk_object, bool moving)
+{
+    VALUE object = (VALUE)mmtk_object;
+
+    marking_parent_object = object;
+
+    rb_gc_handle_weak_references(object);
+
+    if (moving) {
+        rb_gc_update_object_references(rb_gc_get_objspace(), object);
+    }
+
+    marking_parent_object = 0;
+}
+
+static void
+rb_mmtk_call_obj_free(MMTk_ObjectReference object)
+{
+    VALUE obj = (VALUE)object;
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    if (RB_UNLIKELY(rb_gc_event_hook_required_p(RUBY_INTERNAL_EVENT_FREEOBJ))) {
+        pthread_mutex_lock(&objspace->event_hook_mutex);
+        rb_gc_event_hook(obj, RUBY_INTERNAL_EVENT_FREEOBJ);
+        pthread_mutex_unlock(&objspace->event_hook_mutex);
+    }
+
+    if (RB_UNLIKELY(rb_gc_obj_needs_cleanup_p(obj))) {
+        rb_gc_obj_free(objspace, obj);
+    }
+
+#ifdef MMTK_DEBUG
+    memset((void *)obj, 0, rb_gc_impl_obj_slot_size(obj));
+#endif
+}
+
+static size_t
+rb_mmtk_vm_live_bytes(void)
+{
+    return 0;
+}
+
+static void
+make_final_job(struct objspace *objspace, VALUE obj, VALUE table)
+{
+    MMTK_ASSERT(RB_BUILTIN_TYPE(table) == T_ARRAY);
+
+    struct MMTk_final_job *job = xmalloc(sizeof(struct MMTk_final_job));
+    job->next = objspace->finalizer_jobs;
+    job->kind = MMTK_FINAL_JOB_FINALIZE;
+    job->as.finalize.finalizer_array = table;
+
+    objspace->finalizer_jobs = job;
+}
+
+static int
+rb_mmtk_update_finalizer_table_i(st_data_t key, st_data_t value, st_data_t data, int error)
+{
+    MMTK_ASSERT(mmtk_is_reachable((MMTk_ObjectReference)value));
+    MMTK_ASSERT(RB_BUILTIN_TYPE(value) == T_ARRAY);
+
+    struct objspace *objspace = (struct objspace *)data;
+
+    if (mmtk_is_reachable((MMTk_ObjectReference)key)) {
+        VALUE new_key_location = rb_mmtk_call_object_closure((VALUE)key, false);
+
+        MMTK_ASSERT(RB_FL_TEST(new_key_location, RUBY_FL_FINALIZE));
+
+        if (new_key_location != key) {
+            return ST_REPLACE;
+        }
+    }
+    else {
+        make_final_job(objspace, (VALUE)key, (VALUE)value);
+
+        rb_postponed_job_trigger(objspace->finalizer_postponed_job);
+
+        return ST_DELETE;
+    }
+
+    return ST_CONTINUE;
+}
+
+static int
+rb_mmtk_update_finalizer_table_replace_i(st_data_t *key, st_data_t *value, st_data_t data, int existing)
+{
+    *key = rb_mmtk_call_object_closure((VALUE)*key, false);
+
+    return ST_CONTINUE;
+}
+
+static void
+rb_mmtk_update_finalizer_table(void)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    st_foreach_with_replace(
+        objspace->finalizer_table,
+        rb_mmtk_update_finalizer_table_i,
+        rb_mmtk_update_finalizer_table_replace_i,
+        (st_data_t)objspace
+    );
+}
+
+static int
+rb_mmtk_global_tables_count(void)
+{
+    return RB_GC_VM_WEAK_TABLE_COUNT;
+}
+
+static inline VALUE rb_mmtk_call_object_closure(VALUE obj, bool pin);
+
+static int
+rb_mmtk_update_global_tables_i(VALUE val, void *data)
+{
+    if (!mmtk_is_reachable((MMTk_ObjectReference)val)) {
+        return ST_DELETE;
+    }
+
+    // TODO: check only if in moving GC
+    if (rb_mmtk_call_object_closure(val, false) != val) {
+        return ST_REPLACE;
+    }
+
+    return ST_CONTINUE;
+}
+
+static int
+rb_mmtk_update_global_tables_replace_i(VALUE *ptr, void *data)
+{
+    // TODO: cache the new location so we don't call rb_mmtk_call_object_closure twice
+    *ptr = rb_mmtk_call_object_closure(*ptr, false);
+
+    return ST_CONTINUE;
+}
+
+static void
+rb_mmtk_update_global_tables(int table, bool moving)
+{
+    MMTK_ASSERT(table < RB_GC_VM_WEAK_TABLE_COUNT);
+
+    rb_gc_vm_weak_table_foreach(
+        rb_mmtk_update_global_tables_i,
+        rb_mmtk_update_global_tables_replace_i,
+        NULL,
+        !moving,
+        (enum rb_gc_vm_weak_tables)table
+    );
+}
+
+static bool
+rb_mmtk_special_const_p(MMTk_ObjectReference object)
+{
+    VALUE obj = (VALUE)object;
+
+    return RB_SPECIAL_CONST_P(obj);
+}
+
+RBIMPL_ATTR_FORMAT(RBIMPL_PRINTF_FORMAT, 1, 2)
+RBIMPL_ATTR_NORETURN()
+static void
+rb_mmtk_gc_thread_bug(const char *msg, ...)
+{
+    struct objspace *objspace = rb_gc_get_objspace();
+
+    objspace->crash_context.gc_thread_crashed = true;
+
+    va_list args;
+    va_start(args, msg);
+    vsnprintf(objspace->crash_context.crash_msg, sizeof(objspace->crash_context.crash_msg), msg, args);
+    va_end(args);
+
+    fprintf(stderr, "-- GC thread backtrace "
+                    "-------------------------------------------\n");
+    rb_gc_print_backtrace();
+    fprintf(stderr, "\n");
+
+    rb_mmtk_resume_mutators(false);
+
+    sleep(5);
+
+    rb_bug("rb_mmtk_gc_thread_bug");
+}
+
+RBIMPL_ATTR_NORETURN()
+static void
+rb_mmtk_gc_thread_panic_handler(void)
+{
+    rb_mmtk_gc_thread_bug("MMTk GC thread panicked");
+}
+
+RBIMPL_ATTR_NORETURN()
+static void
+rb_mmtk_mutator_thread_panic_handler(void)
+{
+    rb_bug("Ruby mutator thread panicked");
+}
+
+// Bootup
+MMTk_RubyUpcalls ruby_upcalls = {
+    rb_mmtk_init_gc_worker_thread,
+    rb_mmtk_is_mutator,
+    rb_mmtk_stop_the_world,
+    rb_mmtk_resume_mutators,
+    rb_mmtk_block_for_gc,
+    rb_mmtk_before_updating_jit_code,
+    rb_mmtk_after_updating_jit_code,
+    rb_mmtk_number_of_mutators,
+    rb_mmtk_get_mutators,
+    rb_mmtk_scan_gc_roots,
+    rb_mmtk_scan_objspace,
+    rb_mmtk_move_obj_during_marking,
+    rb_mmtk_update_object_references,
+    rb_mmtk_call_gc_mark_children,
+    rb_mmtk_handle_weak_references,
+    rb_mmtk_call_obj_free,
+    rb_mmtk_vm_live_bytes,
+    rb_mmtk_update_global_tables,
+    rb_mmtk_global_tables_count,
+    rb_mmtk_update_finalizer_table,
+    rb_mmtk_special_const_p,
+    rb_mmtk_mutator_thread_panic_handler,
+    rb_mmtk_gc_thread_panic_handler,
+};
+
+// Use max 80% of the available memory by default for MMTk
+#define RB_MMTK_HEAP_LIMIT_PERC 80
+#define RB_MMTK_DEFAULT_HEAP_MIN (1024 * 1024)
+#define RB_MMTK_DEFAULT_HEAP_MAX (rb_mmtk_system_physical_memory() / 100 * RB_MMTK_HEAP_LIMIT_PERC)
+
+enum mmtk_heap_mode {
+    RB_MMTK_DYNAMIC_HEAP,
+    RB_MMTK_FIXED_HEAP
+};
+
+MMTk_Builder *
+rb_mmtk_builder_init(void)
+{
+    MMTk_Builder *builder = mmtk_builder_default();
+    return builder;
+}
+
+void *
+rb_gc_impl_objspace_alloc(void)
+{
+    MMTk_Builder *builder = rb_mmtk_builder_init();
+    MMTk_RubyBindingOptions binding_options = {
+        .suffix_size = RB_GC_OBJ_SUFFIX_SIZE,
+    };
+    mmtk_init_binding(builder, &binding_options, &ruby_upcalls);
+
+    return calloc(1, sizeof(struct objspace));
+}
+
+static void gc_run_finalizers(void *data);
+
+void
+rb_gc_impl_objspace_init(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    objspace->measure_gc_time = true;
+
+    objspace->finalizer_table = st_init_numtable();
+    objspace->finalizer_postponed_job = rb_postponed_job_preregister(0, gc_run_finalizers, objspace);
+
+    ccan_list_head_init(&objspace->ractor_caches);
+
+    objspace->mutex = (pthread_mutex_t)PTHREAD_MUTEX_INITIALIZER;
+    objspace->cond_world_stopped = (pthread_cond_t)PTHREAD_COND_INITIALIZER;
+    objspace->cond_world_started = (pthread_cond_t)PTHREAD_COND_INITIALIZER;
+
+    objspace->event_hook_mutex = (pthread_mutex_t)PTHREAD_MUTEX_INITIALIZER;
+}
+
+void
+rb_gc_impl_objspace_free(void *objspace_ptr)
+{
+    free(objspace_ptr);
+}
+
+void *
+rb_gc_impl_ractor_cache_alloc(void *objspace_ptr, void *ractor)
+{
+    struct objspace *objspace = objspace_ptr;
+    if (objspace->live_ractor_cache_count == 0) {
+        mmtk_initialize_collection(ractor);
+    }
+    objspace->live_ractor_cache_count++;
+
+    struct MMTk_ractor_cache *cache = calloc(1, sizeof(struct MMTk_ractor_cache));
+    ccan_list_add(&objspace->ractor_caches, &cache->list_node);
+
+    cache->mutator = mmtk_bind_mutator(cache);
+    cache->bump_pointer = mmtk_get_bump_pointer_allocator(cache->mutator);
+
+    return cache;
+}
+
+void
+rb_gc_impl_ractor_cache_free(void *objspace_ptr, void *cache_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+    struct MMTk_ractor_cache *cache = cache_ptr;
+
+    ccan_list_del(&cache->list_node);
+
+    mmtk_flush_obj_free_buffer(cache);
+
+    if (ruby_free_at_exit_p()) {
+        MMTK_ASSERT(objspace->live_ractor_cache_count > 0);
+    }
+    else {
+        MMTK_ASSERT(objspace->live_ractor_cache_count > 1);
+    }
+
+    objspace->live_ractor_cache_count--;
+
+    mmtk_destroy_mutator(cache->mutator);
+}
+
+void rb_gc_impl_set_params(void *objspace_ptr) { }
+
+static VALUE gc_verify_internal_consistency(VALUE self) { return Qnil; }
+
+#if SIZEOF_VALUE >= 8
+#define MMTK_HEAP_COUNT 12
+#define MMTK_MAX_OBJ_SIZE 1024
+static size_t heap_sizes[MMTK_HEAP_COUNT + 1] = {
+    32, 40, 64, 80, 96, 128, 160, 256, 512, 640, 768, MMTK_MAX_OBJ_SIZE, 0
+};
+#else
+#define MMTK_HEAP_COUNT 5
+#define MMTK_MAX_OBJ_SIZE 512
+static size_t heap_sizes[MMTK_HEAP_COUNT + 1] = {
+    32, 64, 128, 256, MMTK_MAX_OBJ_SIZE, 0
+};
+#endif
+
+void
+rb_gc_impl_init(void)
+{
+    VALUE gc_constants = rb_hash_new();
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_SIZE")), SIZET2NUM(SIZEOF_VALUE >= 8 ? 64 : 32));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RBASIC_SIZE")), SIZET2NUM(sizeof(struct RBasic)));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OVERHEAD")), INT2NUM(0));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVARGC_MAX_ALLOCATE_SIZE")), LONG2FIX(MMTK_MAX_OBJ_SIZE));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_COUNT")), LONG2FIX(MMTK_HEAP_COUNT));
+    // TODO: correctly set RVALUE_OLD_AGE when we have generational GC support
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OLD_AGE")), INT2FIX(0));
+    OBJ_FREEZE(gc_constants);
+    rb_define_const(rb_mGC, "INTERNAL_CONSTANTS", gc_constants);
+
+    // no-ops for compatibility
+    rb_define_singleton_method(rb_mGC, "verify_internal_consistency", gc_verify_internal_consistency, 0);
+
+    rb_define_singleton_method(rb_mGC, "compact", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "auto_compact", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "auto_compact=", rb_f_notimplement, 1);
+    rb_define_singleton_method(rb_mGC, "latest_compact_info", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "verify_compaction_references", rb_f_notimplement, -1);
+}
+
+size_t *
+rb_gc_impl_heap_sizes(void *objspace_ptr)
+{
+    return heap_sizes;
+}
+
+int
+rb_mmtk_obj_free_iter_wrapper(VALUE obj, void *data)
+{
+    struct objspace *objspace = data;
+
+    if (!RB_TYPE_P(obj, T_NONE)) {
+        rb_gc_obj_free_vm_weak_references(obj);
+        rb_gc_obj_free(objspace, obj);
+    }
+
+    return 0;
+}
+
+// Shutdown
+static void each_object(struct objspace *objspace, int (*func)(VALUE, void *), void *data);
+
+void
+rb_gc_impl_shutdown_free_objects(void *objspace_ptr)
+{
+    mmtk_set_gc_enabled(false);
+    each_object(objspace_ptr, rb_mmtk_obj_free_iter_wrapper, objspace_ptr);
+    mmtk_set_gc_enabled(true);
+}
+
+// GC
+void
+rb_gc_impl_start(void *objspace_ptr, bool full_mark, bool immediate_mark, bool immediate_sweep, bool compact)
+{
+    mmtk_handle_user_collection_request(rb_gc_get_ractor_newobj_cache(), true, full_mark);
+}
+
+bool
+rb_gc_impl_during_gc_p(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+    return objspace->world_stopped;
+}
+
+static void
+rb_gc_impl_prepare_heap_i(MMTk_ObjectReference obj, void *d)
+{
+    rb_gc_prepare_heap_process_object((VALUE)obj);
+}
+
+void
+rb_gc_impl_prepare_heap(void *objspace_ptr)
+{
+    mmtk_enumerate_objects(rb_gc_impl_prepare_heap_i, NULL);
+}
+
+void
+rb_gc_impl_gc_enable(void *objspace_ptr)
+{
+    mmtk_set_gc_enabled(true);
+}
+
+void
+rb_gc_impl_gc_disable(void *objspace_ptr, bool finish_current_gc)
+{
+    mmtk_set_gc_enabled(false);
+}
+
+bool
+rb_gc_impl_gc_enabled_p(void *objspace_ptr)
+{
+    return mmtk_gc_enabled_p();
+}
+
+void
+rb_gc_impl_stress_set(void *objspace_ptr, VALUE flag)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    objspace->gc_stress = RTEST(flag);
+}
+
+VALUE
+rb_gc_impl_stress_get(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    return objspace->gc_stress ? Qtrue : Qfalse;
+}
+
+VALUE
+rb_gc_impl_config_get(void *objspace_ptr)
+{
+    VALUE hash = rb_hash_new();
+
+    rb_hash_aset(hash, ID2SYM(rb_intern_const("mmtk_worker_count")), RB_ULONG2NUM(mmtk_worker_count()));
+    rb_hash_aset(hash, ID2SYM(rb_intern_const("mmtk_plan")), rb_str_new_cstr((const char *)mmtk_plan()));
+    rb_hash_aset(hash, ID2SYM(rb_intern_const("mmtk_heap_mode")), rb_str_new_cstr((const char *)mmtk_heap_mode()));
+    size_t heap_min = mmtk_heap_min();
+    if (heap_min > 0) rb_hash_aset(hash, ID2SYM(rb_intern_const("mmtk_heap_min")), RB_ULONG2NUM(heap_min));
+    rb_hash_aset(hash, ID2SYM(rb_intern_const("mmtk_heap_max")), RB_ULONG2NUM(mmtk_heap_max()));
+
+    return hash;
+}
+
+void
+rb_gc_impl_config_set(void *objspace_ptr, VALUE hash)
+{
+    // TODO
+}
+
+struct rb_gc_vm_context *
+rb_gc_impl_get_vm_context(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    return &objspace->vm_context;
+}
+
+// Object allocation
+
+static VALUE
+rb_mmtk_alloc_fast_path(struct objspace *objspace, struct MMTk_ractor_cache *ractor_cache, size_t size, size_t align)
+{
+    MMTk_BumpPointer *bump_pointer = ractor_cache->bump_pointer;
+    if (bump_pointer == NULL) return 0;
+
+    uintptr_t cursor = bump_pointer->cursor;
+
+    // Ensure cursor is aligned
+    size_t mask = align - 1;
+    cursor = (cursor + mask) & ~mask;
+
+    cursor += size;
+
+    if (cursor > bump_pointer->limit) {
+        return 0;
+    }
+    else {
+        VALUE obj = cursor - size;
+        bump_pointer->cursor = cursor;
+        return obj;
+    }
+}
+
+static bool
+obj_can_parallel_free_p(VALUE obj)
+{
+    switch (RB_BUILTIN_TYPE(obj)) {
+      case T_ARRAY:
+      case T_BIGNUM:
+      case T_COMPLEX:
+      case T_FLOAT:
+      case T_HASH:
+      case T_OBJECT:
+      case T_RATIONAL:
+      case T_REGEXP:
+      case T_STRING:
+      case T_STRUCT:
+      case T_SYMBOL:
+        return true;
+      default:
+        return false;
+    }
+}
+
+static void
+mmtk_flush_obj_free_buffer(struct MMTk_ractor_cache *cache)
+{
+    if (cache->obj_free_parallel_count > 0) {
+        mmtk_add_obj_free_candidates(cache->obj_free_parallel_buf,
+                                     cache->obj_free_parallel_count, true);
+        cache->obj_free_parallel_count = 0;
+    }
+    if (cache->obj_free_non_parallel_count > 0) {
+        mmtk_add_obj_free_candidates(cache->obj_free_non_parallel_buf,
+                                     cache->obj_free_non_parallel_count, false);
+        cache->obj_free_non_parallel_count = 0;
+    }
+}
+
+static inline void
+mmtk_buffer_obj_free_candidate(struct MMTk_ractor_cache *cache, VALUE obj)
+{
+    if (obj_can_parallel_free_p(obj)) {
+        cache->obj_free_parallel_buf[cache->obj_free_parallel_count++] = (MMTk_ObjectReference)obj;
+        if (cache->obj_free_parallel_count >= OBJ_FREE_BUF_CAPACITY) {
+            mmtk_add_obj_free_candidates(cache->obj_free_parallel_buf,
+                                         cache->obj_free_parallel_count, true);
+            cache->obj_free_parallel_count = 0;
+        }
+    }
+    else {
+        cache->obj_free_non_parallel_buf[cache->obj_free_non_parallel_count++] = (MMTk_ObjectReference)obj;
+        if (cache->obj_free_non_parallel_count >= OBJ_FREE_BUF_CAPACITY) {
+            mmtk_add_obj_free_candidates(cache->obj_free_non_parallel_buf,
+                                         cache->obj_free_non_parallel_count, false);
+            cache->obj_free_non_parallel_count = 0;
+        }
+    }
+}
+
+VALUE
+rb_gc_impl_new_obj(void *objspace_ptr, void *cache_ptr, VALUE klass, VALUE flags, bool wb_protected, size_t alloc_size)
+{
+#define MMTK_ALLOCATION_SEMANTICS_DEFAULT 0
+    struct objspace *objspace = objspace_ptr;
+    struct MMTk_ractor_cache *ractor_cache = cache_ptr;
+
+    if (alloc_size > MMTK_MAX_OBJ_SIZE) rb_bug("too big");
+    for (int i = 0; i < MMTK_HEAP_COUNT; i++) {
+        if (alloc_size == heap_sizes[i]) break;
+        if (alloc_size < heap_sizes[i]) {
+            alloc_size = heap_sizes[i];
+            break;
+        }
+    }
+
+    if (objspace->gc_stress) {
+        mmtk_handle_user_collection_request(ractor_cache, false, false);
+    }
+
+    // Layout: [hidden size header (sizeof(VALUE))][payload (alloc_size)][suffix (RB_GC_OBJ_SUFFIX_SIZE)]
+    alloc_size += sizeof(VALUE) + RB_GC_OBJ_SUFFIX_SIZE;
+
+    VALUE *alloc_obj = (VALUE *)rb_mmtk_alloc_fast_path(objspace, ractor_cache, alloc_size, MMTk_MIN_OBJ_ALIGN);
+    if (!alloc_obj) {
+        alloc_obj = mmtk_alloc(ractor_cache->mutator, alloc_size, MMTk_MIN_OBJ_ALIGN, 0, MMTK_ALLOCATION_SEMANTICS_DEFAULT);
+    }
+
+    alloc_obj++;
+    alloc_obj[-1] = alloc_size - sizeof(VALUE) - RB_GC_OBJ_SUFFIX_SIZE;
+    alloc_obj[0] = flags;
+    alloc_obj[1] = klass;
+
+    // TODO: implement fast path for mmtk_post_alloc
+    mmtk_post_alloc(ractor_cache->mutator, (void*)alloc_obj, alloc_size, MMTK_ALLOCATION_SEMANTICS_DEFAULT);
+
+    // TODO: only add when object needs obj_free to be called
+    mmtk_buffer_obj_free_candidate(ractor_cache, (VALUE)alloc_obj);
+
+    objspace->total_allocated_objects++;
+
+    return (VALUE)alloc_obj;
+}
+
+size_t
+rb_gc_impl_obj_slot_size(VALUE obj)
+{
+    return ((VALUE *)obj)[-1];
+}
+
+size_t
+rb_gc_impl_heap_id_for_size(void *objspace_ptr, size_t size)
+{
+    for (int i = 0; i < MMTK_HEAP_COUNT; i++) {
+        if (size == heap_sizes[i]) return i;
+        if (size < heap_sizes[i])  return i;
+    }
+
+    rb_bug("size too big");
+}
+
+bool
+rb_gc_impl_size_allocatable_p(size_t size)
+{
+    return size <= MMTK_MAX_OBJ_SIZE;
+}
+
+// Malloc
+void *
+rb_gc_impl_malloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    // TODO: don't use system malloc
+    return malloc(size);
+}
+
+void *
+rb_gc_impl_calloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    // TODO: don't use system calloc
+    return calloc(1, size);
+}
+
+void *
+rb_gc_impl_realloc(void *objspace_ptr, void *ptr, size_t new_size, size_t old_size, bool gc_allowed)
+{
+    // TODO: don't use system realloc
+    return realloc(ptr, new_size);
+}
+
+void
+rb_gc_impl_free(void *objspace_ptr, void *ptr, size_t old_size)
+{
+    // TODO: don't use system free
+    free(ptr);
+}
+
+void rb_gc_impl_adjust_memory_usage(void *objspace_ptr, ssize_t diff) { }
+
+// Marking
+static inline VALUE
+rb_mmtk_call_object_closure(VALUE obj, bool pin)
+{
+    if (RB_UNLIKELY(RB_BUILTIN_TYPE(obj) == T_NONE)) {
+        enum { info_size = 256 };
+        char obj_info_buf[info_size];
+        rb_raw_obj_info(obj_info_buf, info_size, obj);
+
+        char parent_obj_info_buf[info_size];
+        rb_raw_obj_info(parent_obj_info_buf, info_size, marking_parent_object);
+
+        rb_mmtk_gc_thread_bug("try to mark T_NONE object (obj: %s, parent: %s)", obj_info_buf, parent_obj_info_buf);
+    }
+
+    return (VALUE)rb_mmtk_gc_thread_tls->object_closure.c_function(
+        rb_mmtk_gc_thread_tls->object_closure.rust_closure,
+        rb_mmtk_gc_thread_tls->gc_context,
+        (MMTk_ObjectReference)obj,
+        pin
+    );
+}
+
+void
+rb_gc_impl_mark(void *objspace_ptr, VALUE obj)
+{
+    if (RB_SPECIAL_CONST_P(obj)) return;
+
+    rb_mmtk_call_object_closure(obj, false);
+}
+
+void
+rb_gc_impl_mark_and_move(void *objspace_ptr, VALUE *ptr)
+{
+    if (RB_SPECIAL_CONST_P(*ptr)) return;
+
+    VALUE new_obj = rb_mmtk_call_object_closure(*ptr, false);
+    if (new_obj != *ptr) {
+        *ptr = new_obj;
+    }
+}
+
+void
+rb_gc_impl_mark_and_pin(void *objspace_ptr, VALUE obj)
+{
+    if (RB_SPECIAL_CONST_P(obj)) return;
+
+    rb_mmtk_call_object_closure(obj, true);
+}
+
+void
+rb_gc_impl_mark_maybe(void *objspace_ptr, VALUE obj)
+{
+    if (rb_gc_impl_pointer_to_heap_p(objspace_ptr, (const void *)obj)) {
+        rb_gc_impl_mark_and_pin(objspace_ptr, obj);
+    }
+}
+
+void
+rb_gc_impl_declare_weak_references(void *objspace_ptr, VALUE obj)
+{
+    RB_FL_SET(obj, RUBY_FL_WEAK_REFERENCE);
+    mmtk_declare_weak_references((MMTk_ObjectReference)obj);
+}
+
+bool
+rb_gc_impl_handle_weak_references_alive_p(void *objspace_ptr, VALUE obj)
+{
+    return mmtk_weak_references_alive_p((MMTk_ObjectReference)obj);
+}
+
+// Compaction
+void
+rb_gc_impl_register_pinning_obj(void *objspace_ptr, VALUE obj)
+{
+    mmtk_register_pinning_obj((MMTk_ObjectReference)obj);
+}
+
+bool
+rb_gc_impl_object_moved_p(void *objspace_ptr, VALUE obj)
+{
+    return rb_mmtk_call_object_closure(obj, false) != obj;
+}
+
+VALUE
+rb_gc_impl_location(void *objspace_ptr, VALUE obj)
+{
+    return rb_mmtk_call_object_closure(obj, false);
+}
+
+// Write barriers
+void
+rb_gc_impl_writebarrier(void *objspace_ptr, VALUE a, VALUE b)
+{
+    struct MMTk_ractor_cache *cache = rb_gc_get_ractor_newobj_cache();
+
+    if (SPECIAL_CONST_P(b)) return;
+
+#ifdef MMTK_DEBUG
+    if (!rb_gc_impl_pointer_to_heap_p(objspace_ptr, (void *)a)) {
+        char buff[256];
+        rb_bug("a: %s is not an object", rb_raw_obj_info(buff, 256, a));
+    }
+
+    if (!rb_gc_impl_pointer_to_heap_p(objspace_ptr, (void *)b)) {
+        char buff[256];
+        rb_bug("b: %s is not an object", rb_raw_obj_info(buff, 256, b));
+    }
+#endif
+
+    MMTK_ASSERT(BUILTIN_TYPE(a) != T_NONE);
+    MMTK_ASSERT(BUILTIN_TYPE(b) != T_NONE);
+
+    mmtk_object_reference_write_post(cache->mutator, (MMTk_ObjectReference)a);
+}
+
+void
+rb_gc_impl_writebarrier_unprotect(void *objspace_ptr, VALUE obj)
+{
+    mmtk_register_wb_unprotected_object((MMTk_ObjectReference)obj);
+}
+
+void
+rb_gc_impl_writebarrier_remember(void *objspace_ptr, VALUE obj)
+{
+    struct MMTk_ractor_cache *cache = rb_gc_get_ractor_newobj_cache();
+
+    mmtk_object_reference_write_post(cache->mutator, (MMTk_ObjectReference)obj);
+}
+
+// Heap walking
+static void
+each_objects_i(MMTk_ObjectReference obj, void *d)
+{
+    rb_darray(VALUE) *objs = d;
+
+    rb_darray_append(objs, (VALUE)obj);
+}
+
+static void
+each_object(struct objspace *objspace, int (*func)(VALUE, void *), void *data)
+{
+    rb_darray(VALUE) objs;
+    rb_darray_make(&objs, 0);
+
+    mmtk_enumerate_objects(each_objects_i, &objs);
+
+    VALUE *obj_ptr;
+    rb_darray_foreach(objs, i, obj_ptr) {
+        if (!mmtk_is_mmtk_object((MMTk_ObjectReference)*obj_ptr)) continue;
+
+        if (func(*obj_ptr, data) != 0) {
+            break;
+        }
+    }
+
+    rb_darray_free(objs);
+}
+
+struct rb_gc_impl_each_objects_data {
+    int (*func)(void *, void *, size_t, void *);
+    void *data;
+};
+
+static int
+rb_gc_impl_each_objects_i(VALUE obj, void *d)
+{
+    struct rb_gc_impl_each_objects_data *data = d;
+
+    size_t slot_size = rb_gc_impl_obj_slot_size(obj);
+
+    return data->func((void *)obj, (void *)(obj + slot_size), slot_size, data->data);
+}
+
+void
+rb_gc_impl_each_objects(void *objspace_ptr, int (*func)(void *, void *, size_t, void *), void *data)
+{
+    struct rb_gc_impl_each_objects_data each_objects_data = {
+        .func = func,
+        .data = data
+    };
+
+    each_object(objspace_ptr, rb_gc_impl_each_objects_i, &each_objects_data);
+}
+
+struct rb_gc_impl_each_object_data {
+    void (*func)(VALUE, void *);
+    void *data;
+};
+
+static int
+rb_gc_impl_each_object_i(VALUE obj, void *d)
+{
+    struct rb_gc_impl_each_object_data *data = d;
+
+    data->func(obj, data->data);
+
+    return 0;
+}
+
+void
+rb_gc_impl_each_object(void *objspace_ptr, void (*func)(VALUE, void *), void *data)
+{
+    struct rb_gc_impl_each_object_data each_object_data = {
+        .func = func,
+        .data = data
+    };
+
+    each_object(objspace_ptr, rb_gc_impl_each_object_i, &each_object_data);
+}
+
+// Finalizers
+static VALUE
+gc_run_finalizers_get_final(long i, void *data)
+{
+    VALUE table = (VALUE)data;
+
+    return RARRAY_AREF(table, i + 1);
+}
+
+static void
+gc_run_finalizers(void *data)
+{
+    struct objspace *objspace = data;
+
+    rb_gc_set_pending_interrupt();
+
+    while (objspace->finalizer_jobs != NULL) {
+        struct MMTk_final_job *job = objspace->finalizer_jobs;
+        objspace->finalizer_jobs = job->next;
+
+        switch (job->kind) {
+          case MMTK_FINAL_JOB_DFREE:
+            job->as.dfree.func(job->as.dfree.data);
+            break;
+          case MMTK_FINAL_JOB_FINALIZE: {
+            VALUE finalizer_array = job->as.finalize.finalizer_array;
+
+            rb_gc_run_obj_finalizer(
+                RARRAY_AREF(finalizer_array, 0),
+                RARRAY_LEN(finalizer_array) - 1,
+                gc_run_finalizers_get_final,
+                (void *)finalizer_array
+            );
+
+            RB_GC_GUARD(finalizer_array);
+            break;
+          }
+        }
+
+        xfree(job);
+    }
+
+    rb_gc_unset_pending_interrupt();
+}
+
+void
+rb_gc_impl_make_zombie(void *objspace_ptr, VALUE obj, void (*dfree)(void *), void *data)
+{
+    if (dfree == NULL) return;
+
+    struct objspace *objspace = objspace_ptr;
+
+    struct MMTk_final_job *job = xmalloc(sizeof(struct MMTk_final_job));
+    job->kind = MMTK_FINAL_JOB_DFREE;
+    job->as.dfree.func = dfree;
+    job->as.dfree.data = data;
+
+    struct MMTk_final_job *prev;
+    do {
+        job->next = objspace->finalizer_jobs;
+        prev = RUBY_ATOMIC_PTR_CAS(objspace->finalizer_jobs, job->next, job);
+    } while (prev != job->next);
+
+    if (!ruby_free_at_exit_p()) {
+        rb_postponed_job_trigger(objspace->finalizer_postponed_job);
+    }
+}
+
+VALUE
+rb_gc_impl_define_finalizer(void *objspace_ptr, VALUE obj, VALUE block)
+{
+    struct objspace *objspace = objspace_ptr;
+    VALUE table;
+    st_data_t data;
+
+    RBASIC(obj)->flags |= FL_FINALIZE;
+
+    int lev = RB_GC_VM_LOCK();
+
+    if (st_lookup(objspace->finalizer_table, obj, &data)) {
+        table = (VALUE)data;
+
+        /* avoid duplicate block, table is usually small */
+        {
+            long len = RARRAY_LEN(table);
+            long i;
+
+            for (i = 0; i < len; i++) {
+                VALUE recv = RARRAY_AREF(table, i);
+                if (rb_equal(recv, block)) {
+                    RB_GC_VM_UNLOCK(lev);
+                    return recv;
+                }
+            }
+        }
+
+        rb_ary_push(table, block);
+    }
+    else {
+        table = rb_ary_new3(2, rb_obj_id(obj), block);
+        rb_obj_hide(table);
+        st_add_direct(objspace->finalizer_table, obj, table);
+    }
+
+    RB_GC_VM_UNLOCK(lev);
+
+    return block;
+}
+
+void
+rb_gc_impl_undefine_finalizer(void *objspace_ptr, VALUE obj)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    st_data_t data = obj;
+
+    int lev = RB_GC_VM_LOCK();
+    st_delete(objspace->finalizer_table, &data, 0);
+    RB_GC_VM_UNLOCK(lev);
+
+    FL_UNSET(obj, FL_FINALIZE);
+}
+
+void
+rb_gc_impl_copy_finalizer(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    struct objspace *objspace = objspace_ptr;
+    VALUE table;
+    st_data_t data;
+
+    if (!FL_TEST(obj, FL_FINALIZE)) return;
+
+    int lev = RB_GC_VM_LOCK();
+    if (RB_LIKELY(st_lookup(objspace->finalizer_table, obj, &data))) {
+        table = rb_ary_dup((VALUE)data);
+        RARRAY_ASET(table, 0, rb_obj_id(dest));
+        st_insert(objspace->finalizer_table, dest, table);
+        FL_SET(dest, FL_FINALIZE);
+    }
+    else {
+        rb_bug("rb_gc_copy_finalizer: FL_FINALIZE set but not found in finalizer_table: %s", rb_obj_info(obj));
+    }
+    RB_GC_VM_UNLOCK(lev);
+}
+
+static int
+move_finalizer_from_table_i(st_data_t key, st_data_t val, st_data_t arg)
+{
+    struct objspace *objspace = (struct objspace *)arg;
+
+    make_final_job(objspace, (VALUE)key, (VALUE)val);
+
+    return ST_DELETE;
+}
+
+void
+rb_gc_impl_shutdown_call_finalizer(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    while (objspace->finalizer_table->num_entries) {
+        st_foreach(objspace->finalizer_table, move_finalizer_from_table_i, (st_data_t)objspace);
+
+        gc_run_finalizers(objspace);
+    }
+
+    unsigned int lev = RB_GC_VM_LOCK();
+    {
+        struct MMTk_ractor_cache *rc;
+        ccan_list_for_each(&objspace->ractor_caches, rc, list_node) {
+            mmtk_flush_obj_free_buffer(rc);
+        }
+
+        struct MMTk_RawVecOfObjRef registered_candidates = mmtk_get_all_obj_free_candidates();
+        for (size_t i = 0; i < registered_candidates.len; i++) {
+            VALUE obj = (VALUE)registered_candidates.ptr[i];
+
+            if (rb_gc_shutdown_call_finalizer_p(obj)) {
+                rb_gc_obj_free(objspace_ptr, obj);
+                RBASIC(obj)->flags = 0;
+            }
+        }
+        mmtk_free_raw_vec_of_obj_ref(registered_candidates);
+    }
+    RB_GC_VM_UNLOCK(lev);
+
+    gc_run_finalizers(objspace);
+}
+
+// Forking
+
+void
+rb_gc_impl_before_fork(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+  retry:
+    objspace->fork_hook_vm_lock_lev = RB_GC_VM_LOCK();
+    rb_gc_vm_barrier();
+
+    /* At this point, we know that all the Ractors are paused because of the
+     * rb_gc_vm_barrier above. Since rb_mmtk_block_for_gc is a barrier point,
+     * one or more Ractors could be paused there. However, mmtk_before_fork is
+     * not compatible with that because it assumes that the MMTk workers are idle,
+     * but the workers are not idle because they are busy working on a GC.
+     *
+     * This essentially implements a trylock. It will optimistically lock but will
+     * release the lock if it detects that any other Ractors are waiting in
+     * rb_mmtk_block_for_gc.
+     */
+    rb_atomic_t mutator_blocking_count = RUBY_ATOMIC_LOAD(objspace->mutator_blocking_count);
+    if (mutator_blocking_count != 0) {
+        RB_GC_VM_UNLOCK(objspace->fork_hook_vm_lock_lev);
+        goto retry;
+    }
+
+    mmtk_before_fork();
+}
+
+void
+rb_gc_impl_after_fork(void *objspace_ptr, rb_pid_t pid)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    mmtk_after_fork(rb_gc_get_ractor_newobj_cache());
+
+    RB_GC_VM_UNLOCK(objspace->fork_hook_vm_lock_lev);
+}
+
+// Statistics
+
+void
+rb_gc_impl_set_measure_total_time(void *objspace_ptr, VALUE flag)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    objspace->measure_gc_time = RTEST(flag);
+}
+
+bool
+rb_gc_impl_get_measure_total_time(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    return objspace->measure_gc_time;
+}
+
+unsigned long long
+rb_gc_impl_get_total_time(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    return objspace->total_gc_time;
+}
+
+size_t
+rb_gc_impl_gc_count(void *objspace_ptr)
+{
+    struct objspace *objspace = objspace_ptr;
+
+    return objspace->gc_count;
+}
+
+VALUE
+rb_gc_impl_latest_gc_info(void *objspace_ptr, VALUE hash_or_key)
+{
+    VALUE hash = Qnil, key = Qnil;
+
+    if (SYMBOL_P(hash_or_key)) {
+        key = hash_or_key;
+    }
+    else if (RB_TYPE_P(hash_or_key, T_HASH)) {
+        hash = hash_or_key;
+    }
+    else {
+        rb_bug("gc_info_decode: non-hash or symbol given");
+    }
+
+#define SET(name, attr) \
+    if (key == ID2SYM(rb_intern_const(#name))) \
+        return (attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, ID2SYM(rb_intern_const(#name)), (attr));
+
+    /* Hack to get StackProf working because it calls rb_gc_latest_gc_info with
+     * the :state key and expects a result. This always returns the :none state. */
+    SET(state, ID2SYM(rb_intern_const("none")));
+#undef SET
+
+    if (!NIL_P(key)) {
+        // Matched key should return above
+        return Qundef;
+    }
+
+    return hash;
+}
+
+enum gc_stat_sym {
+    gc_stat_sym_count,
+    gc_stat_sym_moving_gc_count,
+    gc_stat_sym_time,
+    gc_stat_sym_total_allocated_objects,
+    gc_stat_sym_total_bytes,
+    gc_stat_sym_used_bytes,
+    gc_stat_sym_free_bytes,
+    gc_stat_sym_starting_heap_address,
+    gc_stat_sym_last_heap_address,
+    gc_stat_sym_weak_references_count,
+    gc_stat_sym_last
+};
+
+static VALUE gc_stat_symbols[gc_stat_sym_last];
+
+static void
+setup_gc_stat_symbols(void)
+{
+    if (gc_stat_symbols[0] == 0) {
+#define S(s) gc_stat_symbols[gc_stat_sym_##s] = ID2SYM(rb_intern_const(#s))
+        S(count);
+        S(moving_gc_count);
+        S(time);
+        S(total_allocated_objects);
+        S(total_bytes);
+        S(used_bytes);
+        S(free_bytes);
+        S(starting_heap_address);
+        S(last_heap_address);
+        S(weak_references_count);
+    }
+}
+
+VALUE
+rb_gc_impl_stat(void *objspace_ptr, VALUE hash_or_sym)
+{
+    struct objspace *objspace = objspace_ptr;
+    VALUE hash = Qnil, key = Qnil;
+
+    setup_gc_stat_symbols();
+
+    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+        hash = hash_or_sym;
+    }
+    else if (SYMBOL_P(hash_or_sym)) {
+        key = hash_or_sym;
+    }
+    else {
+        rb_bug("non-hash or symbol given");
+    }
+
+#define SET(name, attr) \
+    if (key == gc_stat_symbols[gc_stat_sym_##name]) \
+        return SIZET2NUM(attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, gc_stat_symbols[gc_stat_sym_##name], SIZET2NUM(attr));
+
+        SET(count, objspace->gc_count);
+        SET(moving_gc_count, objspace->moving_gc_count);
+        SET(time, objspace->total_gc_time / (1000 * 1000));
+        SET(total_allocated_objects, objspace->total_allocated_objects);
+        SET(total_bytes, mmtk_total_bytes());
+        SET(used_bytes, mmtk_used_bytes());
+        SET(free_bytes, mmtk_free_bytes());
+        SET(starting_heap_address, (size_t)mmtk_starting_heap_address());
+        SET(last_heap_address, (size_t)mmtk_last_heap_address());
+        SET(weak_references_count, mmtk_weak_references_count());
+#undef SET
+
+    if (!NIL_P(key)) {
+        // Matched key should return above
+        return Qundef;
+    }
+
+    return hash;
+}
+
+VALUE
+rb_gc_impl_stat_heap(void *objspace_ptr, VALUE heap_name, VALUE hash_or_sym)
+{
+    if (FIXNUM_P(heap_name) && SYMBOL_P(hash_or_sym)) {
+        int heap_idx = FIX2INT(heap_name);
+        if (heap_idx < 0 || heap_idx >= MMTK_HEAP_COUNT) {
+            rb_raise(rb_eArgError, "size pool index out of range");
+        }
+
+        if (hash_or_sym == ID2SYM(rb_intern("slot_size"))) {
+            return SIZET2NUM(heap_sizes[heap_idx]);
+        }
+
+        return Qundef;
+    }
+
+    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+        return hash_or_sym;
+    }
+
+    return Qundef;
+}
+
+// Miscellaneous
+
+#define RB_GC_OBJECT_METADATA_ENTRY_COUNT 1
+static struct rb_gc_object_metadata_entry object_metadata_entries[RB_GC_OBJECT_METADATA_ENTRY_COUNT + 1];
+
+struct rb_gc_object_metadata_entry *
+rb_gc_impl_object_metadata(void *objspace_ptr, VALUE obj)
+{
+    static ID ID_object_id;
+
+    if (!ID_object_id) {
+#define I(s) ID_##s = rb_intern(#s);
+        I(object_id);
+#undef I
+    }
+
+    size_t n = 0;
+
+#define SET_ENTRY(na, v) do { \
+    MMTK_ASSERT(n <= RB_GC_OBJECT_METADATA_ENTRY_COUNT); \
+    object_metadata_entries[n].name = ID_##na; \
+    object_metadata_entries[n].val = v; \
+    n++; \
+} while (0)
+
+    if (rb_obj_id_p(obj)) SET_ENTRY(object_id, rb_obj_id(obj));
+
+    object_metadata_entries[n].name = 0;
+    object_metadata_entries[n].val = 0;
+
+    return object_metadata_entries;
+}
+
+bool
+rb_gc_impl_pointer_to_heap_p(void *objspace_ptr, const void *ptr)
+{
+    if (ptr == NULL) return false;
+    if ((uintptr_t)ptr % sizeof(void*) != 0) return false;
+    return mmtk_is_mmtk_object((MMTk_Address)ptr);
+}
+
+bool
+rb_gc_impl_garbage_object_p(void *objspace_ptr, VALUE obj)
+{
+    return false;
+}
+
+void rb_gc_impl_set_event_hook(void *objspace_ptr, const rb_event_flag_t event) { }
+
+void
+rb_gc_impl_copy_attributes(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    if (mmtk_object_wb_unprotected_p((MMTk_ObjectReference)obj)) {
+        rb_gc_impl_writebarrier_unprotect(objspace_ptr, dest);
+    }
+
+    rb_gc_impl_copy_finalizer(objspace_ptr, dest, obj);
+}
+
+// GC Identification
+
+const char *
+rb_gc_impl_active_gc_name(void)
+{
+    return "mmtk";
+}
diff --git a/gc/mmtk/mmtk.h b/gc/mmtk/mmtk.h
new file mode 100644
index 0000000000..b11e2873e3
--- /dev/null
+++ b/gc/mmtk/mmtk.h
@@ -0,0 +1,175 @@
+#ifndef MMTK_H
+#define MMTK_H
+
+/* Warning, this file is autogenerated by cbindgen from the mmtk-ruby repository. Don't modify this manually. */
+
+#include <stdarg.h>
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <stdlib.h>
+
+typedef struct MMTk_Builder MMTk_Builder;
+typedef struct MMTk_Mutator MMTk_Mutator;
+
+typedef struct MMTk_ractor_cache *MMTk_VMThread;
+typedef struct MMTk_ractor_cache *MMTk_VMMutatorThread;
+typedef struct MMTk_GCThreadTLS *MMTk_VMWorkerThread;
+typedef void *MMTk_Address;
+typedef void *MMTk_ObjectReference;
+typedef void *MMTk_NullableObjectReference;
+typedef uint32_t MMTk_AllocationSemantics;
+
+typedef struct MMTk_BumpPointer {
+    uintptr_t cursor;
+    uintptr_t limit;
+} MMTk_BumpPointer;
+
+
+#define MMTk_OBJREF_OFFSET 8
+
+#define MMTk_MIN_OBJ_ALIGN 8
+
+#define MMTk_GC_THREAD_KIND_WORKER 1
+
+typedef struct MMTk_RubyBindingOptions {
+    size_t suffix_size;
+} MMTk_RubyBindingOptions;
+
+typedef MMTk_ObjectReference (*MMTk_ObjectClosureFunction)(void*, void*, MMTk_ObjectReference, bool);
+
+typedef struct MMTk_ObjectClosure {
+    /**
+     * The function to be called from C.
+     */
+    MMTk_ObjectClosureFunction c_function;
+    /**
+     * The pointer to the Rust-level closure object.
+     */
+    void *rust_closure;
+} MMTk_ObjectClosure;
+
+typedef struct MMTk_GCThreadTLS {
+    int kind;
+    void *gc_context;
+    struct MMTk_ObjectClosure object_closure;
+} MMTk_GCThreadTLS;
+
+typedef struct MMTk_RubyUpcalls {
+    void (*init_gc_worker_thread)(struct MMTk_GCThreadTLS *gc_worker_tls);
+    bool (*is_mutator)(void);
+    void (*stop_the_world)(void);
+    void (*resume_mutators)(bool gc_may_move);
+    void (*block_for_gc)(MMTk_VMMutatorThread tls);
+    void (*before_updating_jit_code)(void);
+    void (*after_updating_jit_code)(void);
+    size_t (*number_of_mutators)(void);
+    void (*get_mutators)(void (*visit_mutator)(MMTk_Mutator*, void*), void *data);
+    void (*scan_gc_roots)(void);
+    void (*scan_objspace)(void);
+    void (*move_obj_during_marking)(MMTk_ObjectReference from, MMTk_ObjectReference to);
+    void (*update_object_references)(MMTk_ObjectReference object);
+    void (*call_gc_mark_children)(MMTk_ObjectReference object);
+    void (*handle_weak_references)(MMTk_ObjectReference object, bool moving);
+    void (*call_obj_free)(MMTk_ObjectReference object);
+    size_t (*vm_live_bytes)(void);
+    void (*update_global_tables)(int tbl_idx, bool moving);
+    int (*global_tables_count)(void);
+    void (*update_finalizer_table)(void);
+    bool (*special_const_p)(MMTk_ObjectReference object);
+    void (*mutator_thread_panic_handler)(void);
+    void (*gc_thread_panic_handler)(void);
+} MMTk_RubyUpcalls;
+
+typedef struct MMTk_RawVecOfObjRef {
+    MMTk_ObjectReference *ptr;
+    size_t len;
+    size_t capa;
+} MMTk_RawVecOfObjRef;
+
+bool mmtk_is_live_object(MMTk_ObjectReference object);
+
+bool mmtk_is_reachable(MMTk_ObjectReference object);
+
+MMTk_Builder *mmtk_builder_default(void);
+
+void mmtk_init_binding(MMTk_Builder *builder,
+                       const struct MMTk_RubyBindingOptions *binding_options,
+                       const struct MMTk_RubyUpcalls *upcalls);
+
+void mmtk_initialize_collection(MMTk_VMThread tls);
+
+MMTk_Mutator *mmtk_bind_mutator(MMTk_VMMutatorThread tls);
+
+MMTk_BumpPointer *mmtk_get_bump_pointer_allocator(MMTk_Mutator *m);
+
+void mmtk_destroy_mutator(MMTk_Mutator *mutator);
+
+void mmtk_handle_user_collection_request(MMTk_VMMutatorThread tls, bool force, bool exhaustive);
+
+void mmtk_set_gc_enabled(bool enable);
+
+bool mmtk_gc_enabled_p(void);
+
+MMTk_Address mmtk_alloc(MMTk_Mutator *mutator,
+                        size_t size,
+                        size_t align,
+                        size_t offset,
+                        MMTk_AllocationSemantics semantics);
+
+void mmtk_post_alloc(MMTk_Mutator *mutator,
+                     MMTk_ObjectReference refer,
+                     size_t bytes,
+                     MMTk_AllocationSemantics semantics);
+
+void mmtk_add_obj_free_candidates(const MMTk_ObjectReference *objects,
+                                  size_t count,
+                                  bool can_parallel_free);
+
+void mmtk_declare_weak_references(MMTk_ObjectReference object);
+
+bool mmtk_weak_references_alive_p(MMTk_ObjectReference object);
+
+size_t mmtk_weak_references_count(void);
+
+void mmtk_register_pinning_obj(MMTk_ObjectReference obj);
+
+void mmtk_object_reference_write_post(MMTk_Mutator *mutator, MMTk_ObjectReference object);
+
+void mmtk_register_wb_unprotected_object(MMTk_ObjectReference object);
+
+bool mmtk_object_wb_unprotected_p(MMTk_ObjectReference object);
+
+void mmtk_enumerate_objects(void (*callback)(MMTk_ObjectReference, void*), void *data);
+
+struct MMTk_RawVecOfObjRef mmtk_get_all_obj_free_candidates(void);
+
+void mmtk_free_raw_vec_of_obj_ref(struct MMTk_RawVecOfObjRef raw_vec);
+
+void mmtk_before_fork(void);
+
+void mmtk_after_fork(MMTk_VMThread tls);
+
+size_t mmtk_total_bytes(void);
+
+size_t mmtk_used_bytes(void);
+
+size_t mmtk_free_bytes(void);
+
+MMTk_Address mmtk_starting_heap_address(void);
+
+MMTk_Address mmtk_last_heap_address(void);
+
+size_t mmtk_worker_count(void);
+
+const uint8_t *mmtk_plan(void);
+
+const uint8_t *mmtk_heap_mode(void);
+
+size_t mmtk_heap_min(void);
+
+size_t mmtk_heap_max(void);
+
+bool mmtk_is_mmtk_object(MMTk_Address addr);
+
+#endif  /* MMTK_H */
diff --git a/gc/mmtk/src/abi.rs b/gc/mmtk/src/abi.rs
new file mode 100644
index 0000000000..30890e0853
--- /dev/null
+++ b/gc/mmtk/src/abi.rs
@@ -0,0 +1,335 @@
+use crate::api::RubyMutator;
+use crate::extra_assert;
+use crate::Ruby;
+use libc::c_int;
+use mmtk::scheduler::GCWorker;
+use mmtk::util::Address;
+use mmtk::util::ObjectReference;
+use mmtk::util::VMMutatorThread;
+use mmtk::util::VMWorkerThread;
+
+// For the C binding
+pub const OBJREF_OFFSET: usize = 8;
+pub const MIN_OBJ_ALIGN: usize = 8; // Even on 32-bit machine.  A Ruby object is at least 40 bytes large.
+
+pub const GC_THREAD_KIND_WORKER: libc::c_int = 1;
+
+const HIDDEN_SIZE_MASK: usize = 0x0000FFFFFFFFFFFF;
+
+// An opaque type for the C counterpart.
+#[allow(non_camel_case_types)]
+pub struct st_table;
+
+#[repr(C)]
+pub struct HiddenHeader {
+    pub prefix: usize,
+}
+
+impl HiddenHeader {
+    #[inline(always)]
+    pub fn is_sane(&self) -> bool {
+        self.prefix & !HIDDEN_SIZE_MASK == 0
+    }
+
+    #[inline(always)]
+    fn assert_sane(&self) {
+        extra_assert!(
+            self.is_sane(),
+            "Hidden header is corrupted: {:x}",
+            self.prefix
+        );
+    }
+
+    pub fn payload_size(&self) -> usize {
+        self.assert_sane();
+        self.prefix & HIDDEN_SIZE_MASK
+    }
+}
+
+/// Provide convenient methods for accessing Ruby objects.
+/// TODO: Wrap C functions in `RubyUpcalls` as Rust-friendly methods.
+pub struct RubyObjectAccess {
+    objref: ObjectReference,
+}
+
+impl RubyObjectAccess {
+    pub fn from_objref(objref: ObjectReference) -> Self {
+        Self { objref }
+    }
+
+    pub fn obj_start(&self) -> Address {
+        self.objref.to_raw_address().sub(Self::prefix_size())
+    }
+
+    pub fn payload_addr(&self) -> Address {
+        self.objref.to_raw_address()
+    }
+
+    pub fn suffix_addr(&self) -> Address {
+        self.objref.to_raw_address().add(self.payload_size())
+    }
+
+    pub fn obj_end(&self) -> Address {
+        self.suffix_addr() + Self::suffix_size()
+    }
+
+    fn hidden_header(&self) -> &'static HiddenHeader {
+        unsafe { self.obj_start().as_ref() }
+    }
+
+    #[allow(unused)] // Maybe we need to mutate the hidden header in the future.
+    fn hidden_header_mut(&self) -> &'static mut HiddenHeader {
+        unsafe { self.obj_start().as_mut_ref() }
+    }
+
+    pub fn payload_size(&self) -> usize {
+        self.hidden_header().payload_size()
+    }
+
+    fn flags_field(&self) -> Address {
+        self.objref.to_raw_address()
+    }
+
+    pub fn load_flags(&self) -> usize {
+        unsafe { self.flags_field().load::<usize>() }
+    }
+
+    pub fn prefix_size() -> usize {
+        // Currently, a hidden size field of word size is placed before each object.
+        OBJREF_OFFSET
+    }
+
+    pub fn suffix_size() -> usize {
+        // In RACTOR_CHECK_MODE, Ruby hides a field after each object to hold the Ractor ID.
+        unsafe { crate::BINDING_FAST.suffix_size }
+    }
+
+    pub fn object_size(&self) -> usize {
+        Self::prefix_size() + self.payload_size() + Self::suffix_size()
+    }
+}
+
+type ObjectClosureFunction =
+    extern "C" fn(*mut libc::c_void, *mut libc::c_void, ObjectReference, bool) -> ObjectReference;
+
+#[repr(C)]
+pub struct ObjectClosure {
+    /// The function to be called from C.
+    pub c_function: ObjectClosureFunction,
+    /// The pointer to the Rust-level closure object.
+    pub rust_closure: *mut libc::c_void,
+}
+
+impl Default for ObjectClosure {
+    fn default() -> Self {
+        Self {
+            c_function: THE_UNREGISTERED_CLOSURE_FUNC,
+            rust_closure: std::ptr::null_mut(),
+        }
+    }
+}
+
+/// Rust doesn't require function items to have a unique address.
+/// We therefore force using this particular constant.
+///
+/// See: https://rust-lang.github.io/rust-clippy/master/index.html#fn_address_comparisons
+const THE_UNREGISTERED_CLOSURE_FUNC: ObjectClosureFunction = ObjectClosure::c_function_unregistered;
+
+impl ObjectClosure {
+    /// Set this ObjectClosure temporarily to `visit_object`, and execute `f`.  During the execution of
+    /// `f`, the Ruby VM may call this ObjectClosure.  When the Ruby VM calls this ObjectClosure,
+    /// it effectively calls `visit_object`.
+    ///
+    /// This method is intended to run Ruby VM code in `f` with temporarily modified behavior of
+    /// `rb_gc_mark`, `rb_gc_mark_movable` and `rb_gc_location`
+    ///
+    /// Both `f` and `visit_object` may access and modify local variables in the environment where
+    /// `set_temporarily_and_run_code` called.
+    ///
+    /// Note that this function is not reentrant.  Don't call this function in either `callback` or
+    /// `f`.
+    pub fn set_temporarily_and_run_code<'env, T, F1, F2>(
+        &mut self,
+        mut visit_object: F1,
+        f: F2,
+    ) -> T
+    where
+        F1: 'env + FnMut(&'static mut GCWorker<Ruby>, ObjectReference, bool) -> ObjectReference,
+        F2: 'env + FnOnce() -> T,
+    {
+        debug_assert!(
+            std::ptr::fn_addr_eq(self.c_function, THE_UNREGISTERED_CLOSURE_FUNC),
+            "set_temporarily_and_run_code is recursively called."
+        );
+        self.c_function = Self::c_function_registered::<F1>;
+        self.rust_closure = &mut visit_object as *mut F1 as *mut libc::c_void;
+        let result = f();
+        *self = Default::default();
+        result
+    }
+
+    extern "C" fn c_function_registered<F>(
+        rust_closure: *mut libc::c_void,
+        worker: *mut libc::c_void,
+        object: ObjectReference,
+        pin: bool,
+    ) -> ObjectReference
+    where
+        F: FnMut(&'static mut GCWorker<Ruby>, ObjectReference, bool) -> ObjectReference,
+    {
+        let rust_closure = unsafe { &mut *(rust_closure as *mut F) };
+        let worker = unsafe { &mut *(worker as *mut GCWorker<Ruby>) };
+        rust_closure(worker, object, pin)
+    }
+
+    extern "C" fn c_function_unregistered(
+        _rust_closure: *mut libc::c_void,
+        worker: *mut libc::c_void,
+        object: ObjectReference,
+        pin: bool,
+    ) -> ObjectReference {
+        let worker = unsafe { &mut *(worker as *mut GCWorker<Ruby>) };
+        panic!(
+            "object_closure is not set.  worker ordinal: {}, object: {}, pin: {}",
+            worker.ordinal, object, pin
+        );
+    }
+}
+
+#[repr(C)]
+pub struct GCThreadTLS {
+    pub kind: libc::c_int,
+    pub gc_context: *mut libc::c_void,
+    pub object_closure: ObjectClosure,
+}
+
+impl GCThreadTLS {
+    fn new(kind: libc::c_int, gc_context: *mut libc::c_void) -> Self {
+        Self {
+            kind,
+            gc_context,
+            object_closure: Default::default(),
+        }
+    }
+
+    pub fn for_worker(gc_context: *mut GCWorker<Ruby>) -> Self {
+        Self::new(GC_THREAD_KIND_WORKER, gc_context as *mut libc::c_void)
+    }
+
+    pub fn from_vwt(vwt: VMWorkerThread) -> *mut GCThreadTLS {
+        unsafe { std::mem::transmute(vwt) }
+    }
+
+    /// Cast a pointer to `GCThreadTLS` to a ref, with assertion for null pointer.
+    ///
+    /// # Safety
+    ///
+    /// Has undefined behavior if `ptr` is invalid.
+    pub unsafe fn check_cast(ptr: *mut GCThreadTLS) -> &'static mut GCThreadTLS {
+        assert!(!ptr.is_null());
+        let result = unsafe { &mut *ptr };
+        debug_assert!({
+            let kind = result.kind;
+            kind == GC_THREAD_KIND_WORKER
+        });
+        result
+    }
+
+    /// Cast a pointer to `VMWorkerThread` to a ref, with assertion for null pointer.
+    ///
+    /// # Safety
+    ///
+    /// Has undefined behavior if `ptr` is invalid.
+    pub unsafe fn from_vwt_check(vwt: VMWorkerThread) -> &'static mut GCThreadTLS {
+        let ptr = Self::from_vwt(vwt);
+        unsafe { Self::check_cast(ptr) }
+    }
+
+    #[allow(clippy::not_unsafe_ptr_arg_deref)] // `transmute` does not dereference pointer
+    pub fn to_vwt(ptr: *mut Self) -> VMWorkerThread {
+        unsafe { std::mem::transmute(ptr) }
+    }
+
+    pub fn worker<'w>(&mut self) -> &'w mut GCWorker<Ruby> {
+        // NOTE: The returned ref points to the worker which does not have the same lifetime as self.
+        assert!(self.kind == GC_THREAD_KIND_WORKER);
+        unsafe { &mut *(self.gc_context as *mut GCWorker<Ruby>) }
+    }
+}
+
+#[repr(C)]
+#[derive(Clone)]
+pub struct RawVecOfObjRef {
+    pub ptr: *mut ObjectReference,
+    pub len: usize,
+    pub capa: usize,
+}
+
+impl RawVecOfObjRef {
+    pub fn from_vec(vec: Vec<ObjectReference>) -> RawVecOfObjRef {
+        // Note: Vec::into_raw_parts is unstable. We implement it manually.
+        let mut vec = std::mem::ManuallyDrop::new(vec);
+        let (ptr, len, capa) = (vec.as_mut_ptr(), vec.len(), vec.capacity());
+
+        RawVecOfObjRef { ptr, len, capa }
+    }
+
+    /// # Safety
+    ///
+    /// This function turns raw pointer into a Vec without check.
+    pub unsafe fn into_vec(self) -> Vec<ObjectReference> {
+        unsafe { Vec::from_raw_parts(self.ptr, self.len, self.capa) }
+    }
+}
+
+impl From<Vec<ObjectReference>> for RawVecOfObjRef {
+    fn from(v: Vec<ObjectReference>) -> Self {
+        Self::from_vec(v)
+    }
+}
+
+#[repr(C)]
+#[derive(Clone)]
+pub struct RubyBindingOptions {
+    pub suffix_size: usize,
+}
+
+#[repr(C)]
+#[derive(Clone)]
+pub struct RubyUpcalls {
+    pub init_gc_worker_thread: extern "C" fn(gc_worker_tls: *mut GCThreadTLS),
+    pub is_mutator: extern "C" fn() -> bool,
+    pub stop_the_world: extern "C" fn(),
+    pub resume_mutators: extern "C" fn(gc_may_move: bool),
+    pub block_for_gc: extern "C" fn(tls: VMMutatorThread),
+    pub before_updating_jit_code: extern "C" fn(),
+    pub after_updating_jit_code: extern "C" fn(),
+    pub number_of_mutators: extern "C" fn() -> usize,
+    pub get_mutators: extern "C" fn(
+        visit_mutator: extern "C" fn(*mut RubyMutator, *mut libc::c_void),
+        data: *mut libc::c_void,
+    ),
+    pub scan_gc_roots: extern "C" fn(),
+    pub scan_objspace: extern "C" fn(),
+    pub move_obj_during_marking: extern "C" fn(from: ObjectReference, to: ObjectReference),
+    pub update_object_references: extern "C" fn(object: ObjectReference),
+    pub call_gc_mark_children: extern "C" fn(object: ObjectReference),
+    pub handle_weak_references: extern "C" fn(object: ObjectReference, moving: bool),
+    pub call_obj_free: extern "C" fn(object: ObjectReference),
+    pub vm_live_bytes: extern "C" fn() -> usize,
+    pub update_global_tables: extern "C" fn(tbl_idx: c_int, moving: bool),
+    pub global_tables_count: extern "C" fn() -> c_int,
+    pub update_finalizer_table: extern "C" fn(),
+    pub special_const_p: extern "C" fn(object: ObjectReference) -> bool,
+    pub mutator_thread_panic_handler: extern "C" fn(),
+    pub gc_thread_panic_handler: extern "C" fn(),
+}
+
+unsafe impl Sync for RubyUpcalls {}
+
+#[repr(C)]
+#[derive(Clone)]
+pub struct HeapBounds {
+    pub start: *mut libc::c_void,
+    pub end: *mut libc::c_void,
+}
diff --git a/gc/mmtk/src/active_plan.rs b/gc/mmtk/src/active_plan.rs
new file mode 100644
index 0000000000..80372a7576
--- /dev/null
+++ b/gc/mmtk/src/active_plan.rs
@@ -0,0 +1,56 @@
+use std::collections::VecDeque;
+use std::marker::PhantomData;
+
+use crate::mmtk;
+use crate::upcalls;
+use crate::Ruby;
+use mmtk::util::opaque_pointer::*;
+use mmtk::vm::ActivePlan;
+use mmtk::Mutator;
+
+pub struct VMActivePlan {}
+
+impl ActivePlan<Ruby> for VMActivePlan {
+    fn number_of_mutators() -> usize {
+        (upcalls().number_of_mutators)()
+    }
+
+    fn is_mutator(_tls: VMThread) -> bool {
+        (upcalls().is_mutator)()
+    }
+
+    fn mutator(_tls: VMMutatorThread) -> &'static mut Mutator<Ruby> {
+        unimplemented!()
+    }
+
+    fn mutators<'a>() -> Box<dyn Iterator<Item = &'a mut Mutator<Ruby>> + 'a> {
+        let mut mutators = VecDeque::new();
+        (upcalls().get_mutators)(
+            add_mutator_to_vec,
+            &mut mutators as *mut VecDeque<&mut Mutator<Ruby>> as _,
+        );
+
+        Box::new(RubyMutatorIterator {
+            mutators,
+            phantom_data: PhantomData,
+        })
+    }
+}
+
+extern "C" fn add_mutator_to_vec(mutator: *mut Mutator<Ruby>, mutators: *mut libc::c_void) {
+    let mutators = unsafe { &mut *(mutators as *mut VecDeque<*mut Mutator<Ruby>>) };
+    mutators.push_back(unsafe { &mut *mutator });
+}
+
+struct RubyMutatorIterator<'a> {
+    mutators: VecDeque<&'a mut Mutator<Ruby>>,
+    phantom_data: PhantomData<&'a ()>,
+}
+
+impl<'a> Iterator for RubyMutatorIterator<'a> {
+    type Item = &'a mut Mutator<Ruby>;
+
+    fn next(&mut self) -> Option<Self::Item> {
+        self.mutators.pop_front()
+    }
+}
diff --git a/gc/mmtk/src/api.rs b/gc/mmtk/src/api.rs
new file mode 100644
index 0000000000..c0540fe0c8
--- /dev/null
+++ b/gc/mmtk/src/api.rs
@@ -0,0 +1,551 @@
+// Functions in this module are unsafe for one reason:
+// They are called by C functions and they need to pass raw pointers to Rust.
+#![allow(clippy::missing_safety_doc)]
+
+use mmtk::util::alloc::BumpPointer;
+use mmtk::util::alloc::ImmixAllocator;
+use mmtk::util::conversions;
+use mmtk::util::options::PlanSelector;
+use std::str::FromStr;
+use std::sync::atomic::Ordering;
+
+use crate::abi::RawVecOfObjRef;
+use crate::abi::RubyBindingOptions;
+use crate::abi::RubyUpcalls;
+use crate::binding;
+use crate::binding::RubyBinding;
+use crate::heap::CpuHeapTriggerConfig;
+use crate::heap::RubyHeapTriggerConfig;
+use crate::heap::CPU_HEAP_TRIGGER_CONFIG;
+use crate::heap::RUBY_HEAP_TRIGGER_CONFIG;
+use crate::mmtk;
+use crate::utils::default_heap_max;
+use crate::utils::parse_capacity;
+use crate::Ruby;
+use crate::RubySlot;
+use mmtk::memory_manager;
+use mmtk::memory_manager::mmtk_init;
+use mmtk::util::constants::MIN_OBJECT_SIZE;
+use mmtk::util::options::GCTriggerSelector;
+use mmtk::util::Address;
+use mmtk::util::ObjectReference;
+use mmtk::util::VMMutatorThread;
+use mmtk::util::VMThread;
+use mmtk::AllocationSemantics;
+use mmtk::MMTKBuilder;
+use mmtk::Mutator;
+
+pub type RubyMutator = Mutator<Ruby>;
+
+#[no_mangle]
+pub extern "C" fn mmtk_is_live_object(object: ObjectReference) -> bool {
+    memory_manager::is_live_object(object)
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_is_reachable(object: ObjectReference) -> bool {
+    object.is_reachable()
+}
+
+// =============== Bootup ===============
+
+fn parse_env_var_with<T, F: FnOnce(&str) -> Option<T>>(key: &str, parse: F) -> Option<T> {
+    let val = match std::env::var(key) {
+        Ok(val) => val,
+        Err(std::env::VarError::NotPresent) => return None,
+        Err(std::env::VarError::NotUnicode(os_string)) => {
+            eprintln!("[FATAL] Invalid {key} {os_string:?}");
+            std::process::exit(1);
+        }
+    };
+
+    let parsed = parse(&val).unwrap_or_else(|| {
+        eprintln!("[FATAL] Invalid {key} {val}");
+        std::process::exit(1);
+    });
+
+    Some(parsed)
+}
+
+fn parse_env_var<T: FromStr>(key: &str) -> Option<T> {
+    parse_env_var_with(key, |s| s.parse().ok())
+}
+
+fn mmtk_builder_default_parse_threads() -> Option<usize> {
+    parse_env_var("MMTK_THREADS")
+}
+
+fn mmtk_builder_default_parse_heap_min() -> usize {
+    const DEFAULT_HEAP_MIN: usize = 1 << 20;
+    parse_env_var_with("MMTK_HEAP_MIN", parse_capacity).unwrap_or(DEFAULT_HEAP_MIN)
+}
+
+fn mmtk_builder_default_parse_heap_max() -> usize {
+    parse_env_var_with("MMTK_HEAP_MAX", parse_capacity).unwrap_or_else(default_heap_max)
+}
+
+fn parse_float_env_var(key: &str, default: f64, min: f64, max: f64) -> f64 {
+    parse_env_var_with(key, |s| {
+        let mut float = f64::from_str(s).unwrap_or(default);
+
+        if float <= min {
+            eprintln!(
+                "{key} has value {float} which must be greater than {min}, using default instead"
+            );
+            float = default;
+        }
+
+        if float >= max {
+            eprintln!(
+                "{key} has value {float} which must be less than {max}, using default instead"
+            );
+            float = default;
+        }
+
+        Some(float)
+    })
+    .unwrap_or(default)
+}
+
+fn mmtk_builder_default_parse_heap_mode(heap_min: usize, heap_max: usize) -> GCTriggerSelector {
+    let make_fixed = || GCTriggerSelector::FixedHeapSize(heap_max);
+    let make_dynamic = || GCTriggerSelector::DynamicHeapSize(heap_min, heap_max);
+
+    parse_env_var_with("MMTK_HEAP_MODE", |s| match s {
+        "fixed" => Some(make_fixed()),
+        "dynamic" => Some(make_dynamic()),
+        "ruby" => {
+            let min_ratio = parse_float_env_var("RUBY_GC_HEAP_FREE_SLOTS_MIN_RATIO", 0.2, 0.0, 1.0);
+            let goal_ratio =
+                parse_float_env_var("RUBY_GC_HEAP_FREE_SLOTS_GOAL_RATIO", 0.4, min_ratio, 1.0);
+            let max_ratio =
+                parse_float_env_var("RUBY_GC_HEAP_FREE_SLOTS_MAX_RATIO", 0.65, goal_ratio, 1.0);
+
+            crate::heap::RUBY_HEAP_TRIGGER_CONFIG
+                .set(RubyHeapTriggerConfig {
+                    min_heap_pages: conversions::bytes_to_pages_up(heap_min),
+                    max_heap_pages: conversions::bytes_to_pages_up(heap_max),
+                    heap_pages_min_ratio: min_ratio,
+                    heap_pages_goal_ratio: goal_ratio,
+                    heap_pages_max_ratio: max_ratio,
+                })
+                .unwrap_or_else(|_| panic!("RUBY_HEAP_TRIGGER_CONFIG is already set"));
+
+            Some(GCTriggerSelector::Delegated)
+        }
+        "cpu" => {
+            // CPU-overhead-driven heap sizing based on Tavakolisomeh et al.,
+            // "Heap Size Adjustment with CPU Control", MPLR '23.
+            //
+            // Target is expressed as a percentage (0, 100) via
+            // `MMTK_GC_CPU_TARGET`. The paper recommends 15 for ZGC (a
+            // concurrent collector); we default to 5 for MMTk-Ruby. With
+            // MMTk's stop-the-world Immix, every percent of GC CPU is also
+            // a percent of wall-clock the mutator is blocked on, so a much
+            // smaller budget is appropriate. An empirical sweep across
+            // ruby-bench (railsbench, lobsters, psych-load, liquid-render,
+            // lee) found target=5 to be Pareto-optimal: ~6% geomean speedup
+            // vs. the `ruby` heap mode with effectively identical geomean
+            // peak RSS.
+            let target_percent = parse_float_env_var("MMTK_GC_CPU_TARGET", 5.0, 0.0, 100.0);
+            let window_size = parse_env_var::<usize>("MMTK_GC_CPU_WINDOW").unwrap_or(3);
+            let window_size = window_size.max(1);
+
+            let min_heap_pages = conversions::bytes_to_pages_up(heap_min);
+            let max_heap_pages = conversions::bytes_to_pages_up(heap_max);
+            // Start at the min heap size, as the other delegated triggers do.
+            // The control loop will adjust from here after the first GC cycle.
+            let initial_heap_pages = min_heap_pages;
+
+            CPU_HEAP_TRIGGER_CONFIG
+                .set(CpuHeapTriggerConfig {
+                    min_heap_pages,
+                    max_heap_pages,
+                    initial_heap_pages,
+                    target_gc_cpu: target_percent / 100.0,
+                    window_size,
+                })
+                .unwrap_or_else(|_| panic!("CPU_HEAP_TRIGGER_CONFIG is already set"));
+
+            Some(GCTriggerSelector::Delegated)
+        }
+        _ => None,
+    })
+    .unwrap_or_else(make_dynamic)
+}
+
+fn mmtk_builder_default_parse_plan() -> PlanSelector {
+    parse_env_var_with("MMTK_PLAN", |s| match s {
+        "NoGC" => Some(PlanSelector::NoGC),
+        "MarkSweep" => Some(PlanSelector::MarkSweep),
+        "Immix" => Some(PlanSelector::Immix),
+        _ => None,
+    })
+    .unwrap_or(PlanSelector::Immix)
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_builder_default() -> *mut MMTKBuilder {
+    let mut builder = MMTKBuilder::new_no_env_vars();
+    builder.options.no_finalizer.set(true);
+
+    if let Some(threads) = mmtk_builder_default_parse_threads() {
+        if !builder.options.threads.set(threads) {
+            // MMTk will validate it and reject 0.
+            eprintln!("[FATAL] Failed to set the number of MMTk threads to {threads}");
+            std::process::exit(1);
+        }
+    }
+
+    let heap_min = mmtk_builder_default_parse_heap_min();
+
+    let heap_max = mmtk_builder_default_parse_heap_max();
+
+    if heap_min >= heap_max {
+        eprintln!("[FATAL] MMTK_HEAP_MIN({heap_min}) >= MMTK_HEAP_MAX({heap_max})");
+        std::process::exit(1);
+    }
+
+    builder
+        .options
+        .gc_trigger
+        .set(mmtk_builder_default_parse_heap_mode(heap_min, heap_max));
+
+    builder.options.plan.set(mmtk_builder_default_parse_plan());
+
+    Box::into_raw(Box::new(builder))
+}
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_init_binding(
+    builder: *mut MMTKBuilder,
+    binding_options: *const RubyBindingOptions,
+    upcalls: *const RubyUpcalls,
+) {
+    crate::MUTATOR_THREAD_PANIC_HANDLER
+        .set((unsafe { (*upcalls).clone() }).mutator_thread_panic_handler)
+        .unwrap_or_else(|_| panic!("MUTATOR_THREAD_PANIC_HANDLER is already initialized"));
+
+    crate::set_panic_hook();
+
+    let builder: Box<MMTKBuilder> = unsafe { Box::from_raw(builder) };
+    let binding_options = unsafe { (*binding_options).clone() };
+    let mmtk_boxed = mmtk_init(&builder);
+    let mmtk_static = Box::leak(Box::new(mmtk_boxed));
+
+    let mut binding = RubyBinding::new(mmtk_static, &binding_options, upcalls);
+    binding
+        .weak_proc
+        .init_parallel_obj_free_candidates(memory_manager::num_of_workers(binding.mmtk));
+
+    crate::BINDING
+        .set(binding)
+        .unwrap_or_else(|_| panic!("Binding is already initialized"));
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_initialize_collection(tls: VMThread) {
+    memory_manager::initialize_collection(mmtk(), tls)
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_bind_mutator(tls: VMMutatorThread) -> *mut RubyMutator {
+    Box::into_raw(memory_manager::bind_mutator(mmtk(), tls))
+}
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_get_bump_pointer_allocator(m: *mut RubyMutator) -> *mut BumpPointer {
+    match *crate::BINDING.get().unwrap().mmtk.get_options().plan {
+        PlanSelector::Immix => {
+            let mutator: &mut Mutator<Ruby> = unsafe { &mut *m };
+            let allocator =
+                unsafe { mutator.allocator_mut(mmtk::util::alloc::AllocatorSelector::Immix(0)) };
+
+            if let Some(immix_allocator) = allocator.downcast_mut::<ImmixAllocator<Ruby>>() {
+                &mut immix_allocator.bump_pointer as *mut BumpPointer
+            } else {
+                panic!("Failed to get bump pointer allocator");
+            }
+        }
+        _ => std::ptr::null_mut(),
+    }
+}
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_destroy_mutator(mutator: *mut RubyMutator) {
+    // notify mmtk-core about destroyed mutator
+    memory_manager::destroy_mutator(unsafe { &mut *mutator });
+    // turn the ptr back to a box, and let Rust properly reclaim it
+    let _ = unsafe { Box::from_raw(mutator) };
+}
+
+// =============== GC ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_handle_user_collection_request(
+    tls: VMMutatorThread,
+    force: bool,
+    exhaustive: bool,
+) {
+    crate::mmtk().handle_user_collection_request(tls, force, exhaustive);
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_set_gc_enabled(enable: bool) {
+    crate::CONFIGURATION
+        .gc_enabled
+        .store(enable, Ordering::Relaxed);
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_gc_enabled_p() -> bool {
+    crate::CONFIGURATION.gc_enabled.load(Ordering::Relaxed)
+}
+
+// =============== Object allocation ===============
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_alloc(
+    mutator: *mut RubyMutator,
+    size: usize,
+    align: usize,
+    offset: usize,
+    semantics: AllocationSemantics,
+) -> Address {
+    let clamped_size = size.max(MIN_OBJECT_SIZE);
+    memory_manager::alloc::<Ruby>(
+        unsafe { &mut *mutator },
+        clamped_size,
+        align,
+        offset,
+        semantics,
+    )
+}
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_post_alloc(
+    mutator: *mut RubyMutator,
+    refer: ObjectReference,
+    bytes: usize,
+    semantics: AllocationSemantics,
+) {
+    memory_manager::post_alloc::<Ruby>(unsafe { &mut *mutator }, refer, bytes, semantics)
+}
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_add_obj_free_candidates(
+    objects: *const ObjectReference,
+    count: usize,
+    can_parallel_free: bool,
+) {
+    let objects = unsafe { std::slice::from_raw_parts(objects, count) };
+    binding()
+        .weak_proc
+        .add_obj_free_candidates_batch(objects, can_parallel_free)
+}
+
+// =============== Weak references ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_declare_weak_references(object: ObjectReference) {
+    binding().weak_proc.add_weak_reference(object);
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_weak_references_alive_p(object: ObjectReference) -> bool {
+    object.is_reachable()
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_weak_references_count() -> usize {
+    binding().weak_proc.weak_references_count()
+}
+
+// =============== Compaction ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_register_pinning_obj(obj: ObjectReference) {
+    crate::binding().pinning_registry.register(obj);
+}
+
+// =============== Write barriers ===============
+
+#[no_mangle]
+pub unsafe extern "C" fn mmtk_object_reference_write_post(
+    mutator: *mut RubyMutator,
+    object: ObjectReference,
+) {
+    let ignored_slot = RubySlot::from_address(Address::ZERO);
+    let ignored_target = ObjectReference::from_raw_address(Address::ZERO);
+    mmtk::memory_manager::object_reference_write_post(
+        unsafe { &mut *mutator },
+        object,
+        ignored_slot,
+        ignored_target,
+    )
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_register_wb_unprotected_object(object: ObjectReference) {
+    crate::binding().register_wb_unprotected_object(object)
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_object_wb_unprotected_p(object: ObjectReference) -> bool {
+    crate::binding().object_wb_unprotected_p(object)
+}
+
+// =============== Heap walking ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_enumerate_objects(
+    callback: extern "C" fn(ObjectReference, *mut libc::c_void),
+    data: *mut libc::c_void,
+) {
+    crate::mmtk().enumerate_objects(|object| {
+        callback(object, data);
+    })
+}
+
+// =============== Finalizers ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_get_all_obj_free_candidates() -> RawVecOfObjRef {
+    let vec = binding().weak_proc.get_all_obj_free_candidates();
+    RawVecOfObjRef::from_vec(vec)
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_free_raw_vec_of_obj_ref(raw_vec: RawVecOfObjRef) {
+    unsafe { raw_vec.into_vec() };
+}
+
+// =============== Forking ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_before_fork() {
+    mmtk().prepare_to_fork();
+    binding().join_all_gc_threads();
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_after_fork(tls: VMThread) {
+    mmtk().after_fork(tls);
+}
+
+// =============== Statistics ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_total_bytes() -> usize {
+    memory_manager::total_bytes(mmtk())
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_used_bytes() -> usize {
+    memory_manager::used_bytes(mmtk())
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_free_bytes() -> usize {
+    memory_manager::free_bytes(mmtk())
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_starting_heap_address() -> Address {
+    memory_manager::starting_heap_address()
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_last_heap_address() -> Address {
+    memory_manager::last_heap_address()
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_worker_count() -> usize {
+    memory_manager::num_of_workers(mmtk())
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_plan() -> *const u8 {
+    static NO_GC: &[u8] = b"NoGC\0";
+    static MARK_SWEEP: &[u8] = b"MarkSweep\0";
+    static IMMIX: &[u8] = b"Immix\0";
+
+    match *crate::BINDING.get().unwrap().mmtk.get_options().plan {
+        PlanSelector::NoGC => NO_GC.as_ptr(),
+        PlanSelector::MarkSweep => MARK_SWEEP.as_ptr(),
+        PlanSelector::Immix => IMMIX.as_ptr(),
+        _ => panic!("Unknown plan"),
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_heap_mode() -> *const u8 {
+    static FIXED_HEAP: &[u8] = b"fixed\0";
+    static DYNAMIC_HEAP: &[u8] = b"dynamic\0";
+    static RUBY_HEAP: &[u8] = b"ruby\0";
+    static CPU_HEAP: &[u8] = b"cpu\0";
+
+    match *crate::BINDING.get().unwrap().mmtk.get_options().gc_trigger {
+        GCTriggerSelector::FixedHeapSize(_) => FIXED_HEAP.as_ptr(),
+        GCTriggerSelector::DynamicHeapSize(_, _) => DYNAMIC_HEAP.as_ptr(),
+        GCTriggerSelector::Delegated => {
+            // Two delegated triggers exist; disambiguate via the populated
+            // config singleton.
+            if CPU_HEAP_TRIGGER_CONFIG.get().is_some() {
+                CPU_HEAP.as_ptr()
+            } else {
+                RUBY_HEAP.as_ptr()
+            }
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_heap_min() -> usize {
+    match *crate::BINDING.get().unwrap().mmtk.get_options().gc_trigger {
+        GCTriggerSelector::FixedHeapSize(_) => 0,
+        GCTriggerSelector::DynamicHeapSize(min_size, _) => min_size,
+        GCTriggerSelector::Delegated => {
+            if let Some(cfg) = CPU_HEAP_TRIGGER_CONFIG.get() {
+                conversions::pages_to_bytes(cfg.min_heap_pages)
+            } else {
+                conversions::pages_to_bytes(
+                    RUBY_HEAP_TRIGGER_CONFIG
+                        .get()
+                        .expect("RUBY_HEAP_TRIGGER_CONFIG not set")
+                        .min_heap_pages,
+                )
+            }
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn mmtk_heap_max() -> usize {
+    match *crate::BINDING.get().unwrap().mmtk.get_options().gc_trigger {
+        GCTriggerSelector::FixedHeapSize(max_size) => max_size,
+        GCTriggerSelector::DynamicHeapSize(_, max_size) => max_size,
+        GCTriggerSelector::Delegated => {
+            if let Some(cfg) = CPU_HEAP_TRIGGER_CONFIG.get() {
+                conversions::pages_to_bytes(cfg.max_heap_pages)
+            } else {
+                conversions::pages_to_bytes(
+                    RUBY_HEAP_TRIGGER_CONFIG
+                        .get()
+                        .expect("RUBY_HEAP_TRIGGER_CONFIG not set")
+                        .max_heap_pages,
+                )
+            }
+        }
+    }
+}
+
+// =============== Miscellaneous ===============
+
+#[no_mangle]
+pub extern "C" fn mmtk_is_mmtk_object(addr: Address) -> bool {
+    debug_assert!(!addr.is_zero());
+    debug_assert!(addr.is_aligned_to(mmtk::util::is_mmtk_object::VO_BIT_REGION_SIZE));
+    memory_manager::is_mmtk_object(addr).is_some()
+}
diff --git a/gc/mmtk/src/binding.rs b/gc/mmtk/src/binding.rs
new file mode 100644
index 0000000000..36d4a992fd
--- /dev/null
+++ b/gc/mmtk/src/binding.rs
@@ -0,0 +1,129 @@
+use std::collections::HashSet;
+use std::ffi::CString;
+use std::sync::atomic::AtomicBool;
+use std::sync::Mutex;
+use std::thread::JoinHandle;
+
+use mmtk::util::ObjectReference;
+use mmtk::MMTK;
+
+use crate::abi;
+use crate::abi::RubyBindingOptions;
+use crate::pinning_registry::PinningRegistry;
+use crate::weak_proc::WeakProcessor;
+use crate::Ruby;
+
+pub struct RubyBindingFast {
+    pub suffix_size: usize,
+}
+
+impl Default for RubyBindingFast {
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
+impl RubyBindingFast {
+    pub const fn new() -> Self {
+        Self { suffix_size: 0 }
+    }
+}
+
+pub struct RubyConfiguration {
+    pub gc_enabled: AtomicBool,
+}
+
+impl Default for RubyConfiguration {
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
+impl RubyConfiguration {
+    pub const fn new() -> Self {
+        Self {
+            // Mimic the old behavior when the gc_enabled flag was in mmtk-core.
+            // We may refactor it so that it is false by default.
+            gc_enabled: AtomicBool::new(true),
+        }
+    }
+}
+
+pub struct RubyBinding {
+    pub mmtk: &'static MMTK<Ruby>,
+    pub options: RubyBindingOptions,
+    pub upcalls: *const abi::RubyUpcalls,
+    pub plan_name: Mutex<Option<CString>>,
+    pub weak_proc: WeakProcessor,
+    pub pinning_registry: PinningRegistry,
+    pub gc_thread_join_handles: Mutex<Vec<JoinHandle<()>>>,
+    pub wb_unprotected_objects: Mutex<HashSet<ObjectReference>>,
+}
+
+unsafe impl Sync for RubyBinding {}
+unsafe impl Send for RubyBinding {}
+
+impl RubyBinding {
+    pub fn new(
+        mmtk: &'static MMTK<Ruby>,
+        binding_options: &RubyBindingOptions,
+        upcalls: *const abi::RubyUpcalls,
+    ) -> Self {
+        unsafe {
+            crate::BINDING_FAST.suffix_size = binding_options.suffix_size;
+        }
+
+        Self {
+            mmtk,
+            options: binding_options.clone(),
+            upcalls,
+            plan_name: Mutex::new(None),
+            weak_proc: WeakProcessor::new(),
+            pinning_registry: PinningRegistry::new(),
+            gc_thread_join_handles: Default::default(),
+            wb_unprotected_objects: Default::default(),
+        }
+    }
+
+    pub fn upcalls(&self) -> &'static abi::RubyUpcalls {
+        unsafe { &*self.upcalls as &'static abi::RubyUpcalls }
+    }
+
+    pub fn get_plan_name_c(&self) -> *const libc::c_char {
+        let mut plan_name = self.plan_name.lock().unwrap();
+        if plan_name.is_none() {
+            let name_string = format!("{:?}", *self.mmtk.get_options().plan);
+            let c_string = CString::new(name_string)
+                .unwrap_or_else(|e| panic!("Failed converting plan name to CString: {e}"));
+            *plan_name = Some(c_string);
+        }
+        plan_name.as_deref().unwrap().as_ptr()
+    }
+
+    pub fn join_all_gc_threads(&self) {
+        let handles = {
+            let mut guard = self.gc_thread_join_handles.lock().unwrap();
+            std::mem::take(&mut *guard)
+        };
+
+        debug!("Joining GC threads...");
+        let total = handles.len();
+        let mut joined = 0;
+        for handle in handles {
+            handle.join().unwrap();
+            joined += 1;
+            debug!("{joined}/{total} GC threads joined.");
+        }
+    }
+
+    pub fn register_wb_unprotected_object(&self, object: ObjectReference) {
+        debug!("Registering WB-unprotected object: {object}");
+        let mut objects = self.wb_unprotected_objects.lock().unwrap();
+        objects.insert(object);
+    }
+
+    pub fn object_wb_unprotected_p(&self, object: ObjectReference) -> bool {
+        let objects = self.wb_unprotected_objects.lock().unwrap();
+        objects.contains(&object)
+    }
+}
diff --git a/gc/mmtk/src/collection.rs b/gc/mmtk/src/collection.rs
new file mode 100644
index 0000000000..648efa4e27
--- /dev/null
+++ b/gc/mmtk/src/collection.rs
@@ -0,0 +1,122 @@
+use crate::abi::GCThreadTLS;
+
+use crate::api::RubyMutator;
+use crate::heap::CpuHeapTrigger;
+use crate::heap::RubyHeapTrigger;
+use crate::heap::CPU_HEAP_TRIGGER_CONFIG;
+use crate::mmtk;
+use crate::upcalls;
+use crate::Ruby;
+use mmtk::memory_manager;
+use mmtk::scheduler::*;
+use mmtk::util::heap::GCTriggerPolicy;
+use mmtk::util::VMMutatorThread;
+use mmtk::util::VMThread;
+use mmtk::util::VMWorkerThread;
+use mmtk::vm::Collection;
+use mmtk::vm::GCThreadContext;
+use std::sync::atomic::AtomicBool;
+use std::sync::atomic::Ordering;
+use std::thread;
+
+static CURRENT_GC_MAY_MOVE: AtomicBool = AtomicBool::new(false);
+
+pub struct VMCollection {}
+
+impl Collection<Ruby> for VMCollection {
+    fn is_collection_enabled() -> bool {
+        crate::CONFIGURATION.gc_enabled.load(Ordering::Relaxed)
+    }
+
+    fn stop_all_mutators<F>(tls: VMWorkerThread, mut mutator_visitor: F)
+    where
+        F: FnMut(&'static mut mmtk::Mutator<Ruby>),
+    {
+        (upcalls().stop_the_world)();
+
+        if crate::mmtk().get_plan().current_gc_may_move_object() {
+            CURRENT_GC_MAY_MOVE.store(true, Ordering::Relaxed);
+            (upcalls().before_updating_jit_code)();
+        } else {
+            CURRENT_GC_MAY_MOVE.store(false, Ordering::Relaxed);
+        }
+
+        crate::binding().pinning_registry.pin_children(tls);
+
+        (upcalls().get_mutators)(
+            Self::notify_mutator_ready::<F>,
+            &mut mutator_visitor as *mut F as *mut _,
+        );
+    }
+
+    fn resume_mutators(_tls: VMWorkerThread) {
+        let current_gc_may_move = CURRENT_GC_MAY_MOVE.load(Ordering::Relaxed);
+
+        if current_gc_may_move {
+            (upcalls().after_updating_jit_code)();
+        }
+
+        (upcalls().resume_mutators)(current_gc_may_move);
+    }
+
+    fn block_for_gc(tls: VMMutatorThread) {
+        (upcalls().block_for_gc)(tls);
+    }
+
+    fn spawn_gc_thread(_tls: VMThread, ctx: GCThreadContext<Ruby>) {
+        let join_handle = match ctx {
+            GCThreadContext::Worker(mut worker) => thread::Builder::new()
+                .name("MMTk Worker Thread".to_string())
+                .spawn(move || {
+                    let ordinal = worker.ordinal;
+                    debug!("Hello! This is MMTk Worker Thread running! ordinal: {ordinal}");
+                    crate::register_gc_thread(thread::current().id());
+                    let ptr_worker = &mut *worker as *mut GCWorker<Ruby>;
+                    let gc_thread_tls =
+                        Box::into_raw(Box::new(GCThreadTLS::for_worker(ptr_worker)));
+                    (upcalls().init_gc_worker_thread)(gc_thread_tls);
+                    memory_manager::start_worker(
+                        mmtk(),
+                        GCThreadTLS::to_vwt(gc_thread_tls),
+                        worker,
+                    );
+                    debug!("An MMTk Worker Thread is quitting. Good bye! ordinal: {ordinal}");
+                    crate::unregister_gc_thread(thread::current().id());
+                })
+                .unwrap(),
+        };
+
+        {
+            let mut handles = crate::binding().gc_thread_join_handles.lock().unwrap();
+            handles.push(join_handle);
+        }
+    }
+
+    fn vm_live_bytes() -> usize {
+        (upcalls().vm_live_bytes)()
+    }
+
+    fn create_gc_trigger() -> Box<dyn GCTriggerPolicy<Ruby>> {
+        // `GCTriggerSelector::Delegated` is currently used by two different
+        // heap modes: `ruby` (the Ruby-like free-slot ratio trigger) and `cpu`
+        // (the CPU-overhead trigger from Tavakolisomeh et al., MPLR '23).
+        // Which one is active is determined by which `OnceCell` config the
+        // `MMTK_HEAP_MODE` parser populated.
+        if CPU_HEAP_TRIGGER_CONFIG.get().is_some() {
+            Box::new(CpuHeapTrigger::default())
+        } else {
+            Box::new(RubyHeapTrigger::default())
+        }
+    }
+}
+
+impl VMCollection {
+    extern "C" fn notify_mutator_ready<F>(mutator_ptr: *mut RubyMutator, data: *mut libc::c_void)
+    where
+        F: FnMut(&'static mut mmtk::Mutator<Ruby>),
+    {
+        let mutator = unsafe { &mut *mutator_ptr };
+        let mutator_visitor = unsafe { &mut *(data as *mut F) };
+        mutator_visitor(mutator);
+    }
+}
diff --git a/gc/mmtk/src/heap/cpu_heap_trigger.rs b/gc/mmtk/src/heap/cpu_heap_trigger.rs
new file mode 100644
index 0000000000..ef5a79fe9a
--- /dev/null
+++ b/gc/mmtk/src/heap/cpu_heap_trigger.rs
@@ -0,0 +1,370 @@
+//! A GC trigger that adjusts the heap size based on the CPU overhead of GC.
+//!
+//! This is an implementation of the heap sizing policy described in
+//! Tavakolisomeh, Shimchenko, Österlund, Bruno, Ferreira, Wrigstad,
+//! "Heap Size Adjustment with CPU Control", MPLR '23.
+//! <https://doi.org/10.1145/3617651.3622988>
+//!
+//! The idea: rather than letting heap size control GC frequency, let a
+//! user-supplied *target GC CPU overhead* control the heap size. After each GC
+//! cycle, we measure the GC CPU overhead (fraction of process CPU time spent
+//! in GC) and compare it to the target. If GC is over budget we grow the heap
+//! (reducing GC frequency); if it is under budget we shrink the heap (trading
+//! memory for more frequent collections).
+//!
+//! ## Algorithm
+//!
+//! After each GC cycle we compute, using an average of the last `n` cycles:
+//!
+//! ```text
+//! GC_CPU             = T_GC / T_APP                                  (Eq. 1)
+//! overhead_error     = GC_CPU - target                                (Eq. 2)
+//! sigmoid_error      = 1 / (1 + e^(-overhead_error))                  (Eq. 3)
+//! adjustment_factor  = sigmoid_error + 0.5   (in (0.5, 1.5))          (Eq. 4)
+//! new_size           = current_size * adjustment_factor               (Eq. 5)
+//! ```
+//!
+//! where:
+//! - `T_GC` is the wall-clock duration of each GC cycle.
+//! - `T_APP` is process CPU time elapsed between consecutive GC cycles (sum of
+//!   CPU time over all threads — mutators, GC workers, compilers, etc.), read
+//!   via `clock_gettime(CLOCK_PROCESS_CPUTIME_ID)`.
+//!
+//! The final heap size is then clamped to the range
+//! `[max(1.1 * used, min_heap_pages), max_heap_pages]`, providing 10% headroom
+//! above current live memory to avoid triggering GC on an effectively-empty
+//! heap.
+//!
+//! ## Differences from the paper
+//!
+//! The paper targets ZGC, a concurrent generational collector. MMTk's Ruby
+//! binding currently ships stop-the-world collectors (Immix, MarkSweep). The
+//! paper's formula still applies: with a STW collector the process CPU time
+//! during GC closely tracks the wall-clock GC time, and mutator CPU time
+//! during the mutator phase is correctly attributed. For generational plans
+//! we skip nursery-only GCs, consistent with MemBalancer.
+
+use std::sync::atomic::AtomicUsize;
+use std::sync::atomic::Ordering;
+use std::sync::Mutex;
+
+use mmtk::util::heap::GCTriggerPolicy;
+use mmtk::util::heap::SpaceStats;
+use mmtk::Plan;
+use mmtk::MMTK;
+use once_cell::sync::OnceCell;
+
+use crate::Ruby;
+
+pub static CPU_HEAP_TRIGGER_CONFIG: OnceCell<CpuHeapTriggerConfig> = OnceCell::new();
+
+/// Configuration for the [`CpuHeapTrigger`].
+pub struct CpuHeapTriggerConfig {
+    /// Lower bound on heap size (in pages). The trigger will never shrink below
+    /// this value.
+    pub min_heap_pages: usize,
+    /// Upper bound on heap size (in pages). The trigger will never grow above
+    /// this value.
+    pub max_heap_pages: usize,
+    /// Initial heap size (in pages).
+    pub initial_heap_pages: usize,
+    /// Target GC CPU overhead as a fraction of total process CPU time. For
+    /// example, `0.15` means the policy will try to keep GC CPU usage near 15%.
+    /// Valid range: `(0.0, 1.0)`.
+    pub target_gc_cpu: f64,
+    /// Number of recent GC cycles averaged together when computing the CPU
+    /// overhead signal. Smoothes out short-term fluctuations. The paper uses 3.
+    pub window_size: usize,
+}
+
+/// A single GC cycle's timing measurements.
+#[derive(Clone, Copy, Debug, Default)]
+struct GcSample {
+    /// Wall-clock seconds spent inside this GC cycle.
+    gc_seconds: f64,
+    /// Seconds of process CPU time elapsed since the previous GC cycle ended.
+    /// This covers both mutator time and (on multi-threaded mutators) any
+    /// mutator CPU time consumed in parallel with the previous GC.
+    app_cpu_seconds: f64,
+}
+
+struct CpuHeapTriggerState {
+    /// Ring buffer of the last `window_size` samples. Oldest-first.
+    samples: Vec<GcSample>,
+    /// Wall-clock time when the current GC cycle started. `None` when no GC is
+    /// in progress.
+    gc_start_wall: Option<std::time::Instant>,
+    /// Process CPU time (seconds) recorded at the end of the previous GC
+    /// cycle. `None` until the first cycle completes.
+    last_gc_end_cpu: Option<f64>,
+}
+
+impl CpuHeapTriggerState {
+    fn new() -> Self {
+        Self {
+            samples: Vec::new(),
+            gc_start_wall: None,
+            last_gc_end_cpu: None,
+        }
+    }
+
+    /// Pushes a new sample, dropping the oldest when the window is full.
+    fn push_sample(&mut self, sample: GcSample, window_size: usize) {
+        if self.samples.len() >= window_size {
+            self.samples.remove(0);
+        }
+        self.samples.push(sample);
+    }
+
+    /// Returns the arithmetic mean GC CPU overhead across the window, or
+    /// `None` if we don't yet have a full sample (which happens on the first
+    /// GC cycle — we have no baseline for `app_cpu_seconds`).
+    fn mean_gc_cpu(&self) -> Option<f64> {
+        if self.samples.is_empty() {
+            return None;
+        }
+        let total_gc: f64 = self.samples.iter().map(|s| s.gc_seconds).sum();
+        let total_app: f64 = self.samples.iter().map(|s| s.app_cpu_seconds).sum();
+        if total_app <= 0.0 {
+            return None;
+        }
+        Some(total_gc / total_app)
+    }
+}
+
+pub struct CpuHeapTrigger {
+    /// Target heap size in pages. Updated at the end of each GC cycle.
+    target_heap_pages: AtomicUsize,
+    /// Mutable timing state. Wrapped in a `Mutex` because `on_gc_start` and
+    /// `on_gc_end` are the only mutation sites and they are not on an
+    /// allocation hot path; avoiding the complexity of lock-free state is
+    /// worth the trivial contention.
+    state: Mutex<CpuHeapTriggerState>,
+}
+
+impl Default for CpuHeapTrigger {
+    fn default() -> Self {
+        let cfg = Self::get_config();
+        Self {
+            target_heap_pages: AtomicUsize::new(cfg.initial_heap_pages),
+            state: Mutex::new(CpuHeapTriggerState::new()),
+        }
+    }
+}
+
+impl GCTriggerPolicy<Ruby> for CpuHeapTrigger {
+    fn is_gc_required(
+        &self,
+        space_full: bool,
+        space: Option<SpaceStats<Ruby>>,
+        plan: &dyn Plan<VM = Ruby>,
+    ) -> bool {
+        // Let the plan decide, matching the other triggers.
+        plan.collection_required(space_full, space)
+    }
+
+    fn on_gc_start(&self, _mmtk: &'static MMTK<Ruby>) {
+        let mut state = self.state.lock().unwrap();
+        state.gc_start_wall = Some(std::time::Instant::now());
+    }
+
+    fn on_gc_end(&self, mmtk: &'static MMTK<Ruby>) {
+        // Skip nursery-only GCs for generational plans. The heap resizing
+        // decision is driven by the (much more expensive) full collections
+        // where the signal-to-noise ratio is high enough to be useful.
+        if let Some(gen_plan) = mmtk.get_plan().generational() {
+            if gen_plan.is_current_gc_nursery() {
+                return;
+            }
+        }
+
+        let cfg = Self::get_config();
+        let gc_end_cpu = process_cpu_time_seconds();
+
+        let mut state = self.state.lock().unwrap();
+
+        // Duration of this GC cycle (wall clock).
+        let gc_seconds = state
+            .gc_start_wall
+            .take()
+            .map(|start| start.elapsed().as_secs_f64())
+            .unwrap_or(0.0);
+
+        // Process CPU time elapsed since the previous GC cycle ended. We
+        // require at least one previous end timestamp to produce a valid
+        // sample — without it we cannot compute `T_APP`.
+        if let (Some(last_end), Some(now)) = (state.last_gc_end_cpu, gc_end_cpu) {
+            let app_cpu_seconds = (now - last_end).max(0.0);
+            // Only record non-degenerate samples to avoid poisoning the window
+            // with zero-time entries from back-to-back GCs.
+            if app_cpu_seconds > 0.0 {
+                state.push_sample(
+                    GcSample {
+                        gc_seconds,
+                        app_cpu_seconds,
+                    },
+                    cfg.window_size,
+                );
+            }
+        }
+        state.last_gc_end_cpu = gc_end_cpu;
+
+        // Compute the new heap size only when we have samples to average over.
+        if let Some(gc_cpu) = state.mean_gc_cpu() {
+            // Drop the lock before doing the (relatively cheap) math and
+            // atomic update; nothing below needs the state.
+            drop(state);
+
+            let overhead_error = gc_cpu - cfg.target_gc_cpu; // Eq. (2)
+            let sigmoid_error = sigmoid(overhead_error); // Eq. (3)
+            let adjustment_factor = sigmoid_error + 0.5; // Eq. (4), range (0.5, 1.5)
+
+            let current = self.target_heap_pages.load(Ordering::Relaxed);
+            let suggested = ((current as f64) * adjustment_factor) as usize; // Eq. (5)
+
+            // Clamp:
+            // - upper bound: configured max
+            // - lower bound: max(1.1 * used, min) — 10% headroom above current
+            //   live memory, so we never request a heap so small that GC is
+            //   triggered immediately on return from this one.
+            let used = mmtk.get_plan().get_used_pages();
+            let floor = ((used as f64) * 1.1).ceil() as usize;
+            let lower = floor.max(cfg.min_heap_pages).min(cfg.max_heap_pages);
+            let upper = cfg.max_heap_pages;
+            let new_target = suggested.clamp(lower, upper);
+
+            self.target_heap_pages.store(new_target, Ordering::Relaxed);
+
+            info!(
+                "CpuHeapTrigger: gc_cpu={:.4} target={:.4} factor={:.4} \
+                 pages {} -> {} (used={}, clamp=[{}, {}])",
+                gc_cpu,
+                cfg.target_gc_cpu,
+                adjustment_factor,
+                current,
+                new_target,
+                used,
+                lower,
+                upper
+            );
+        }
+    }
+
+    fn is_heap_full(&self, plan: &dyn Plan<VM = Ruby>) -> bool {
+        plan.get_reserved_pages() > self.target_heap_pages.load(Ordering::Relaxed)
+    }
+
+    fn get_current_heap_size_in_pages(&self) -> usize {
+        self.target_heap_pages.load(Ordering::Relaxed)
+    }
+
+    fn get_max_heap_size_in_pages(&self) -> usize {
+        Self::get_config().max_heap_pages
+    }
+
+    fn can_heap_size_grow(&self) -> bool {
+        self.target_heap_pages.load(Ordering::Relaxed) < Self::get_config().max_heap_pages
+    }
+}
+
+impl CpuHeapTrigger {
+    fn get_config<'b>() -> &'b CpuHeapTriggerConfig {
+        CPU_HEAP_TRIGGER_CONFIG
+            .get()
+            .expect("Attempt to use CPU_HEAP_TRIGGER_CONFIG before it is initialized")
+    }
+}
+
+/// Standard logistic sigmoid. Returns 0.5 when x == 0, asymptotes to 0 and 1.
+fn sigmoid(x: f64) -> f64 {
+    1.0 / (1.0 + (-x).exp())
+}
+
+/// Reads the process-wide CPU time as a floating-point number of seconds,
+/// summed across all threads of this process. Returns `None` if the clock
+/// query fails (which should be essentially impossible on supported
+/// platforms).
+fn process_cpu_time_seconds() -> Option<f64> {
+    let mut ts = libc::timespec {
+        tv_sec: 0,
+        tv_nsec: 0,
+    };
+    // SAFETY: `clock_gettime` writes exactly `sizeof(timespec)` bytes to the
+    // pointer we pass, which is a valid local stack allocation.
+    let rc = unsafe { libc::clock_gettime(libc::CLOCK_PROCESS_CPUTIME_ID, &mut ts) };
+    if rc != 0 {
+        return None;
+    }
+    Some((ts.tv_sec as f64) + (ts.tv_nsec as f64) / 1_000_000_000.0)
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn sigmoid_is_well_behaved() {
+        assert!((sigmoid(0.0) - 0.5).abs() < 1e-12);
+        assert!(sigmoid(-100.0) < 1e-9);
+        assert!(sigmoid(100.0) > 1.0 - 1e-9);
+        // Monotonic.
+        assert!(sigmoid(-1.0) < sigmoid(0.0));
+        assert!(sigmoid(0.0) < sigmoid(1.0));
+    }
+
+    #[test]
+    fn adjustment_factor_is_within_paper_bounds() {
+        // Eq. (4): adjustment_factor = sigmoid(e) + 0.5 must lie in (0.5, 1.5).
+        for e in [-10.0_f64, -1.0, 0.0, 1.0, 10.0] {
+            let f = sigmoid(e) + 0.5;
+            assert!(f > 0.5 && f < 1.5, "factor {f} out of range for e={e}");
+        }
+    }
+
+    #[test]
+    fn mean_gc_cpu_is_total_weighted() {
+        let mut state = CpuHeapTriggerState::new();
+        state.push_sample(
+            GcSample {
+                gc_seconds: 1.0,
+                app_cpu_seconds: 10.0,
+            },
+            3,
+        );
+        state.push_sample(
+            GcSample {
+                gc_seconds: 3.0,
+                app_cpu_seconds: 10.0,
+            },
+            3,
+        );
+        // (1 + 3) / (10 + 10) = 0.2
+        assert!((state.mean_gc_cpu().unwrap() - 0.2).abs() < 1e-12);
+    }
+
+    #[test]
+    fn window_drops_oldest() {
+        let mut state = CpuHeapTriggerState::new();
+        for i in 0..5 {
+            state.push_sample(
+                GcSample {
+                    gc_seconds: i as f64,
+                    app_cpu_seconds: 1.0,
+                },
+                3,
+            );
+        }
+        assert_eq!(state.samples.len(), 3);
+        // After pushing 0,1,2,3,4 with window 3, we should have [2,3,4].
+        assert_eq!(state.samples[0].gc_seconds, 2.0);
+        assert_eq!(state.samples[2].gc_seconds, 4.0);
+    }
+
+    #[test]
+    fn no_sample_without_prior_gc() {
+        // First GC cycle cannot produce a sample (no previous end time). The
+        // push happens only when last_gc_end_cpu is Some.
+        let state = CpuHeapTriggerState::new();
+        assert!(state.mean_gc_cpu().is_none());
+    }
+}
diff --git a/gc/mmtk/src/heap/mod.rs b/gc/mmtk/src/heap/mod.rs
new file mode 100644
index 0000000000..05a35efb23
--- /dev/null
+++ b/gc/mmtk/src/heap/mod.rs
@@ -0,0 +1,9 @@
+mod cpu_heap_trigger;
+mod ruby_heap_trigger;
+
+pub use cpu_heap_trigger::CpuHeapTrigger;
+pub use cpu_heap_trigger::CpuHeapTriggerConfig;
+pub use cpu_heap_trigger::CPU_HEAP_TRIGGER_CONFIG;
+pub use ruby_heap_trigger::RubyHeapTrigger;
+pub use ruby_heap_trigger::RubyHeapTriggerConfig;
+pub use ruby_heap_trigger::RUBY_HEAP_TRIGGER_CONFIG;
diff --git a/gc/mmtk/src/heap/ruby_heap_trigger.rs b/gc/mmtk/src/heap/ruby_heap_trigger.rs
new file mode 100644
index 0000000000..fe1130043d
--- /dev/null
+++ b/gc/mmtk/src/heap/ruby_heap_trigger.rs
@@ -0,0 +1,105 @@
+use std::sync::atomic::AtomicUsize;
+use std::sync::atomic::Ordering;
+
+use mmtk::util::heap::GCTriggerPolicy;
+use mmtk::util::heap::SpaceStats;
+use mmtk::Plan;
+use mmtk::MMTK;
+use once_cell::sync::OnceCell;
+
+use crate::Ruby;
+
+pub static RUBY_HEAP_TRIGGER_CONFIG: OnceCell<RubyHeapTriggerConfig> = OnceCell::new();
+
+pub struct RubyHeapTriggerConfig {
+    /// Min heap size
+    pub min_heap_pages: usize,
+    /// Max heap size
+    pub max_heap_pages: usize,
+    /// Minimum ratio of empty space after a GC before the heap will grow
+    pub heap_pages_min_ratio: f64,
+    /// Ratio the heap will grow by
+    pub heap_pages_goal_ratio: f64,
+    /// Maximum ratio of empty space after a GC before the heap will shrink
+    pub heap_pages_max_ratio: f64,
+}
+
+pub struct RubyHeapTrigger {
+    /// Target number of heap pages
+    target_heap_pages: AtomicUsize,
+}
+
+impl GCTriggerPolicy<Ruby> for RubyHeapTrigger {
+    fn is_gc_required(
+        &self,
+        space_full: bool,
+        space: Option<SpaceStats<Ruby>>,
+        plan: &dyn Plan<VM = Ruby>,
+    ) -> bool {
+        // Let the plan decide
+        plan.collection_required(space_full, space)
+    }
+
+    fn on_gc_end(&self, mmtk: &'static MMTK<Ruby>) {
+        if let Some(plan) = mmtk.get_plan().generational() {
+            if plan.is_current_gc_nursery() {
+                // Nursery GC
+            } else {
+                // Full GC
+            }
+
+            panic!("TODO: support for generational GC not implemented")
+        } else {
+            let used_pages = mmtk.get_plan().get_used_pages();
+
+            let target_min =
+                (used_pages as f64 * (1.0 + Self::get_config().heap_pages_min_ratio)) as usize;
+            let target_max =
+                (used_pages as f64 * (1.0 + Self::get_config().heap_pages_max_ratio)) as usize;
+            let new_target =
+                (((used_pages as f64) * (1.0 + Self::get_config().heap_pages_goal_ratio)) as usize)
+                    .clamp(
+                        Self::get_config().min_heap_pages,
+                        Self::get_config().max_heap_pages,
+                    );
+
+            if used_pages < target_min || used_pages > target_max {
+                self.target_heap_pages.store(new_target, Ordering::Relaxed);
+            }
+        }
+    }
+
+    fn is_heap_full(&self, plan: &dyn Plan<VM = Ruby>) -> bool {
+        plan.get_reserved_pages() > self.target_heap_pages.load(Ordering::Relaxed)
+    }
+
+    fn get_current_heap_size_in_pages(&self) -> usize {
+        self.target_heap_pages.load(Ordering::Relaxed)
+    }
+
+    fn get_max_heap_size_in_pages(&self) -> usize {
+        Self::get_config().max_heap_pages
+    }
+
+    fn can_heap_size_grow(&self) -> bool {
+        self.target_heap_pages.load(Ordering::Relaxed) < Self::get_config().max_heap_pages
+    }
+}
+
+impl Default for RubyHeapTrigger {
+    fn default() -> Self {
+        let min_heap_pages = Self::get_config().min_heap_pages;
+
+        Self {
+            target_heap_pages: AtomicUsize::new(min_heap_pages),
+        }
+    }
+}
+
+impl RubyHeapTrigger {
+    fn get_config<'b>() -> &'b RubyHeapTriggerConfig {
+        RUBY_HEAP_TRIGGER_CONFIG
+            .get()
+            .expect("Attempt to use RUBY_HEAP_TRIGGER_CONFIG before it is initialized")
+    }
+}
diff --git a/gc/mmtk/src/lib.rs b/gc/mmtk/src/lib.rs
new file mode 100644
index 0000000000..52dc782051
--- /dev/null
+++ b/gc/mmtk/src/lib.rs
@@ -0,0 +1,161 @@
+// Warn about unsafe operations in functions that are already marked as unsafe.
+// This will become default in Rust 2024 edition.
+#![warn(unsafe_op_in_unsafe_fn)]
+
+extern crate libc;
+extern crate mmtk;
+#[macro_use]
+extern crate log;
+extern crate probe;
+
+use std::collections::HashSet;
+use std::panic::PanicHookInfo;
+use std::sync::Mutex;
+use std::thread::ThreadId;
+
+use abi::RubyUpcalls;
+use binding::RubyBinding;
+use binding::RubyBindingFast;
+use binding::RubyConfiguration;
+use mmtk::vm::slot::SimpleSlot;
+use mmtk::vm::slot::UnimplementedMemorySlice;
+use mmtk::vm::VMBinding;
+use mmtk::MMTK;
+use once_cell::sync::OnceCell;
+
+pub mod abi;
+pub mod active_plan;
+pub mod api;
+pub mod binding;
+pub mod collection;
+pub mod heap;
+pub mod object_model;
+pub mod pinning_registry;
+pub mod reference_glue;
+pub mod scanning;
+pub mod utils;
+pub mod weak_proc;
+
+#[derive(Default)]
+pub struct Ruby;
+
+/// Ruby slot type, i.e. a slot that holds a VALUE.
+/// Currently we use SimpleSlot.
+/// It doesn't matter, becaues we have not started using slot-enqueuing, yet.
+pub type RubySlot = SimpleSlot;
+
+/// Ruby memory slice, i.e. an array of VALUEs.
+/// It is used by array-copy barriers which is supposed to perform bettern than copying array
+/// elements one by one.  At this moment, we just leave it unimplemented.
+pub type RubyMemorySlice = UnimplementedMemorySlice<RubySlot>;
+
+impl VMBinding for Ruby {
+    type VMObjectModel = object_model::VMObjectModel;
+    type VMScanning = scanning::VMScanning;
+    type VMCollection = collection::VMCollection;
+    type VMActivePlan = active_plan::VMActivePlan;
+    type VMReferenceGlue = reference_glue::VMReferenceGlue;
+
+    type VMSlot = RubySlot;
+    type VMMemorySlice = RubyMemorySlice;
+}
+
+/// The callback for mutator thread panic handler (which calls rb_bug to output
+/// debugging information such as the Ruby backtrace and memory maps).
+/// This is set before BINDING is set because mmtk_init could panic.
+pub static MUTATOR_THREAD_PANIC_HANDLER: OnceCell<extern "C" fn()> = OnceCell::new();
+
+/// The singleton object for the Ruby binding itself.
+pub static BINDING: OnceCell<RubyBinding> = OnceCell::new();
+
+/// Some data needs to be accessed fast.
+/// We sacrifice safety for speed using unsynchronized global variables.
+pub static mut BINDING_FAST: RubyBindingFast = RubyBindingFast::new();
+
+/// Some data needs to be accessed fast.
+pub static CONFIGURATION: RubyConfiguration = RubyConfiguration::new();
+
+pub fn binding<'b>() -> &'b RubyBinding {
+    BINDING
+        .get()
+        .expect("Attempt to use the binding before it is initialization")
+}
+
+pub fn mmtk() -> &'static MMTK<Ruby> {
+    binding().mmtk
+}
+
+pub fn upcalls() -> &'static RubyUpcalls {
+    binding().upcalls()
+}
+
+pub static GC_THREADS: OnceCell<Mutex<HashSet<ThreadId>>> = OnceCell::new();
+
+pub(crate) fn register_gc_thread(thread_id: ThreadId) {
+    let mut gc_threads = GC_THREADS.get().unwrap().lock().unwrap();
+    gc_threads.insert(thread_id);
+}
+
+pub(crate) fn unregister_gc_thread(thread_id: ThreadId) {
+    let mut gc_threads = GC_THREADS.get().unwrap().lock().unwrap();
+    gc_threads.remove(&thread_id);
+}
+
+pub(crate) fn is_gc_thread(thread_id: ThreadId) -> bool {
+    let gc_threads = GC_THREADS.get().unwrap().lock().unwrap();
+    gc_threads.contains(&thread_id)
+}
+
+fn handle_gc_thread_panic(panic_info: &PanicHookInfo) {
+    eprintln!("ERROR: An MMTk GC thread panicked.  This is a bug.");
+    eprintln!("{panic_info}");
+
+    let bt = std::backtrace::Backtrace::capture();
+    match bt.status() {
+        std::backtrace::BacktraceStatus::Unsupported => {
+            eprintln!("Backtrace is unsupported.")
+        }
+        std::backtrace::BacktraceStatus::Disabled => {
+            eprintln!("Backtrace is disabled.");
+            eprintln!("run with `RUST_BACKTRACE=1` environment variable to display a backtrace");
+        }
+        std::backtrace::BacktraceStatus::Captured => {
+            eprintln!("{bt}");
+        }
+        s => {
+            eprintln!("Unknown backtrace status: {s:?}");
+        }
+    }
+}
+
+pub(crate) fn set_panic_hook() {
+    if GC_THREADS.set(Default::default()).is_err() {
+        return;
+    }
+
+    let old_hook = std::panic::take_hook();
+
+    std::panic::set_hook(Box::new(move |panic_info| {
+        if is_gc_thread(std::thread::current().id()) {
+            handle_gc_thread_panic(panic_info);
+
+            (crate::binding().upcalls().gc_thread_panic_handler)();
+        } else {
+            old_hook(panic_info);
+            (crate::MUTATOR_THREAD_PANIC_HANDLER
+                .get()
+                .expect("MUTATOR_THREAD_PANIC_HANDLER is not set"))();
+        }
+    }));
+}
+
+/// This kind of assertion is enabled if either building in debug mode or the
+/// "extra_assert" feature is enabled.
+#[macro_export]
+macro_rules! extra_assert {
+    ($($arg:tt)*) => {
+        if std::cfg!(any(debug_assertions, feature = "extra_assert")) {
+            std::assert!($($arg)*);
+        }
+    };
+}
diff --git a/gc/mmtk/src/object_model.rs b/gc/mmtk/src/object_model.rs
new file mode 100644
index 0000000000..d673ca11a0
--- /dev/null
+++ b/gc/mmtk/src/object_model.rs
@@ -0,0 +1,124 @@
+use std::ptr::copy_nonoverlapping;
+
+use crate::abi;
+use crate::abi::RubyObjectAccess;
+use crate::abi::MIN_OBJ_ALIGN;
+use crate::abi::OBJREF_OFFSET;
+use crate::Ruby;
+use mmtk::util::constants::BITS_IN_BYTE;
+use mmtk::util::copy::CopySemantics;
+use mmtk::util::copy::GCWorkerCopyContext;
+use mmtk::util::Address;
+use mmtk::util::ObjectReference;
+use mmtk::vm::*;
+
+pub struct VMObjectModel {}
+
+impl VMObjectModel {
+    const OBJREF_OFFSET: usize = abi::OBJREF_OFFSET;
+}
+
+impl ObjectModel<Ruby> for VMObjectModel {
+    const GLOBAL_LOG_BIT_SPEC: VMGlobalLogBitSpec = VMGlobalLogBitSpec::side_first();
+
+    // We overwrite the prepended word which were used to hold object sizes.
+    const LOCAL_FORWARDING_POINTER_SPEC: VMLocalForwardingPointerSpec =
+        VMLocalForwardingPointerSpec::in_header(-((OBJREF_OFFSET * BITS_IN_BYTE) as isize));
+
+    const LOCAL_FORWARDING_BITS_SPEC: VMLocalForwardingBitsSpec =
+        VMLocalForwardingBitsSpec::side_first();
+
+    const LOCAL_MARK_BIT_SPEC: VMLocalMarkBitSpec =
+        VMLocalMarkBitSpec::side_after(Self::LOCAL_FORWARDING_BITS_SPEC.as_spec());
+
+    const LOCAL_PINNING_BIT_SPEC: VMLocalPinningBitSpec =
+        VMLocalPinningBitSpec::side_after(Self::LOCAL_MARK_BIT_SPEC.as_spec());
+
+    const LOCAL_LOS_MARK_NURSERY_SPEC: VMLocalLOSMarkNurserySpec =
+        VMLocalLOSMarkNurserySpec::side_after(Self::LOCAL_PINNING_BIT_SPEC.as_spec());
+
+    const UNIFIED_OBJECT_REFERENCE_ADDRESS: bool = false;
+    const OBJECT_REF_OFFSET_LOWER_BOUND: isize = Self::OBJREF_OFFSET as isize;
+
+    const NEED_VO_BITS_DURING_TRACING: bool = true;
+
+    fn copy(
+        from: ObjectReference,
+        semantics: CopySemantics,
+        copy_context: &mut GCWorkerCopyContext<Ruby>,
+    ) -> ObjectReference {
+        let from_acc = RubyObjectAccess::from_objref(from);
+        let from_start = from_acc.obj_start();
+        let object_size = from_acc.object_size();
+        let to_start = copy_context.alloc_copy(from, object_size, MIN_OBJ_ALIGN, 0, semantics);
+        debug_assert!(!to_start.is_zero());
+        let to_payload = to_start.add(OBJREF_OFFSET);
+        unsafe {
+            copy_nonoverlapping::<u8>(from_start.to_ptr(), to_start.to_mut_ptr(), object_size);
+        }
+        let to_obj = unsafe { ObjectReference::from_raw_address_unchecked(to_payload) };
+        copy_context.post_copy(to_obj, object_size, semantics);
+        trace!("Copied object from {} to {}", from, to_obj);
+
+        (crate::binding().upcalls().move_obj_during_marking)(from, to_obj);
+
+        #[cfg(feature = "clear_old_copy")]
+        {
+            trace!(
+                "Clearing old copy {} ({}-{})",
+                from,
+                from_start,
+                from_start + object_size
+            );
+            // For debug purpose, we clear the old copy so that if the Ruby VM reads from the old
+            // copy again, it will likely result in an error.
+            unsafe { std::ptr::write_bytes::<u8>(from_start.to_mut_ptr(), 0, object_size) }
+        }
+
+        to_obj
+    }
+
+    fn copy_to(_from: ObjectReference, _to: ObjectReference, _region: Address) -> Address {
+        unimplemented!(
+            "This function cannot be called because we do not support MarkCompact for Ruby."
+        )
+    }
+
+    fn get_reference_when_copied_to(_from: ObjectReference, _to: Address) -> ObjectReference {
+        unimplemented!(
+            "This function cannot be called because we do not support MarkCompact for Ruby."
+        )
+    }
+
+    fn get_current_size(object: ObjectReference) -> usize {
+        RubyObjectAccess::from_objref(object).object_size()
+    }
+
+    fn get_type_descriptor(_reference: ObjectReference) -> &'static [i8] {
+        todo!()
+    }
+
+    fn ref_to_object_start(object: ObjectReference) -> Address {
+        RubyObjectAccess::from_objref(object).obj_start()
+    }
+
+    fn ref_to_header(object: ObjectReference) -> Address {
+        RubyObjectAccess::from_objref(object).payload_addr()
+    }
+
+    fn get_size_when_copied(object: ObjectReference) -> usize {
+        Self::get_current_size(object)
+    }
+
+    fn get_align_when_copied(_object: ObjectReference) -> usize {
+        todo!()
+    }
+
+    fn get_align_offset_when_copied(_object: ObjectReference) -> usize {
+        todo!()
+    }
+
+    fn dump_object(_object: ObjectReference) {
+        todo!()
+    }
+}
diff --git a/gc/mmtk/src/pinning_registry.rs b/gc/mmtk/src/pinning_registry.rs
new file mode 100644
index 0000000000..b498b508f1
--- /dev/null
+++ b/gc/mmtk/src/pinning_registry.rs
@@ -0,0 +1,187 @@
+use std::sync::Mutex;
+
+use mmtk::memory_manager;
+use mmtk::scheduler::GCWork;
+use mmtk::scheduler::GCWorker;
+use mmtk::scheduler::WorkBucketStage;
+use mmtk::util::ObjectReference;
+use mmtk::util::VMWorkerThread;
+use mmtk::MMTK;
+
+use crate::abi::GCThreadTLS;
+use crate::upcalls;
+use crate::Ruby;
+
+pub struct PinningRegistry {
+    pinning_objs: Mutex<Vec<ObjectReference>>,
+    pinned_objs: Mutex<Vec<ObjectReference>>,
+}
+
+impl PinningRegistry {
+    pub fn new() -> Self {
+        Self {
+            pinning_objs: Default::default(),
+            pinned_objs: Default::default(),
+        }
+    }
+
+    pub fn register(&self, object: ObjectReference) {
+        let mut pinning_objs = self.pinning_objs.lock().unwrap();
+        pinning_objs.push(object);
+    }
+
+    pub fn pin_children(&self, tls: VMWorkerThread) {
+        if !crate::mmtk().get_plan().current_gc_may_move_object() {
+            log::debug!("The current GC is non-moving, skipping pinning children.");
+            return;
+        }
+
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(tls) };
+        let worker = gc_tls.worker();
+
+        let pinning_objs = self
+            .pinning_objs
+            .try_lock()
+            .expect("PinningRegistry should not have races during GC.");
+
+        let packet_size = 512;
+        let work_packets = pinning_objs
+            .chunks(packet_size)
+            .map(|chunk| {
+                Box::new(PinPinningChildren {
+                    pinning_objs: chunk.to_vec(),
+                }) as _
+            })
+            .collect();
+
+        worker.scheduler().work_buckets[WorkBucketStage::Prepare].bulk_add(work_packets);
+    }
+
+    pub fn cleanup(&self, worker: &mut GCWorker<Ruby>) {
+        worker.scheduler().work_buckets[WorkBucketStage::VMRefClosure].add(RemoveDeadPinnings);
+        if crate::mmtk().get_plan().current_gc_may_move_object() {
+            let packet = {
+                let mut pinned_objs = self
+                    .pinned_objs
+                    .try_lock()
+                    .expect("Unexpected contention on pinned_objs");
+                UnpinPinnedObjects {
+                    objs: std::mem::take(&mut pinned_objs),
+                }
+            };
+
+            worker.scheduler().work_buckets[WorkBucketStage::VMRefClosure].add(packet);
+        } else {
+            debug!("The current GC is non-moving, skipping unpinning objects.");
+            debug_assert_eq!(
+                {
+                    let pinned_objs = self
+                        .pinned_objs
+                        .try_lock()
+                        .expect("Unexpected contention on pinned_objs");
+                    pinned_objs.len()
+                },
+                0
+            );
+        }
+    }
+}
+
+impl Default for PinningRegistry {
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
+struct PinPinningChildren {
+    pinning_objs: Vec<ObjectReference>,
+}
+
+impl GCWork<Ruby> for PinPinningChildren {
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, _mmtk: &'static MMTK<Ruby>) {
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(worker.tls) };
+        let mut pinned_objs = vec![];
+        let mut newly_pinned_objs = vec![];
+
+        let visit_object = |_worker, target_object: ObjectReference, pin| {
+            log::trace!(
+                "    -> {} {}",
+                if pin { "(pin)" } else { "     " },
+                target_object
+            );
+            if pin {
+                debug_assert!(
+                    target_object.get_forwarded_object().is_none(),
+                    "Trying to pin {target_object} but has been moved"
+                );
+
+                pinned_objs.push(target_object);
+            }
+            target_object
+        };
+
+        gc_tls
+            .object_closure
+            .set_temporarily_and_run_code(visit_object, || {
+                for obj in self.pinning_objs.iter().cloned() {
+                    log::trace!("  Pinning: {}", obj);
+                    (upcalls().call_gc_mark_children)(obj);
+                }
+            });
+
+        for target_object in pinned_objs {
+            if memory_manager::pin_object(target_object) {
+                newly_pinned_objs.push(target_object);
+            }
+        }
+
+        let mut pinned_objs = crate::binding()
+            .pinning_registry
+            .pinned_objs
+            .lock()
+            .unwrap();
+        pinned_objs.append(&mut newly_pinned_objs);
+    }
+}
+
+struct RemoveDeadPinnings;
+
+impl GCWork<Ruby> for RemoveDeadPinnings {
+    fn do_work(&mut self, _worker: &mut GCWorker<Ruby>, _mmtk: &'static MMTK<Ruby>) {
+        log::debug!("Removing dead Pinnings...");
+
+        let registry = &crate::binding().pinning_registry;
+        {
+            let mut pinning_objs = registry
+                .pinning_objs
+                .try_lock()
+                .expect("PinningRegistry should not have races during GC.");
+
+            pinning_objs.retain_mut(|obj| {
+                if obj.is_live() {
+                    let new_obj = obj.get_forwarded_object().unwrap_or(*obj);
+                    *obj = new_obj;
+                    true
+                } else {
+                    log::trace!("  Dead Pinning removed: {}", *obj);
+                    false
+                }
+            });
+        }
+    }
+}
+
+struct UnpinPinnedObjects {
+    objs: Vec<ObjectReference>,
+}
+
+impl GCWork<Ruby> for UnpinPinnedObjects {
+    fn do_work(&mut self, _worker: &mut GCWorker<Ruby>, _mmtk: &'static MMTK<Ruby>) {
+        log::debug!("Unpinning pinned objects...");
+
+        for obj in self.objs.iter() {
+            let unpinned = memory_manager::unpin_object(*obj);
+            debug_assert!(unpinned);
+        }
+    }
+}
diff --git a/gc/mmtk/src/reference_glue.rs b/gc/mmtk/src/reference_glue.rs
new file mode 100644
index 0000000000..1272bd54c1
--- /dev/null
+++ b/gc/mmtk/src/reference_glue.rs
@@ -0,0 +1,26 @@
+use crate::Ruby;
+use mmtk::util::ObjectReference;
+use mmtk::util::VMWorkerThread;
+use mmtk::vm::ReferenceGlue;
+
+pub struct VMReferenceGlue {}
+
+impl ReferenceGlue<Ruby> for VMReferenceGlue {
+    type FinalizableType = ObjectReference;
+
+    fn get_referent(_object: ObjectReference) -> Option<ObjectReference> {
+        unimplemented!()
+    }
+
+    fn set_referent(_reff: ObjectReference, _referent: ObjectReference) {
+        unimplemented!()
+    }
+
+    fn enqueue_references(_references: &[ObjectReference], _tls: VMWorkerThread) {
+        unimplemented!()
+    }
+
+    fn clear_referent(_new_reference: ObjectReference) {
+        unimplemented!()
+    }
+}
diff --git a/gc/mmtk/src/scanning.rs b/gc/mmtk/src/scanning.rs
new file mode 100644
index 0000000000..355a2e7759
--- /dev/null
+++ b/gc/mmtk/src/scanning.rs
@@ -0,0 +1,291 @@
+use crate::abi::GCThreadTLS;
+
+use crate::upcalls;
+use crate::utils::ChunkedVecCollector;
+use crate::Ruby;
+use crate::RubySlot;
+use mmtk::memory_manager;
+use mmtk::scheduler::GCWork;
+use mmtk::scheduler::GCWorker;
+use mmtk::scheduler::WorkBucketStage;
+use mmtk::util::ObjectReference;
+use mmtk::util::VMWorkerThread;
+use mmtk::vm::ObjectTracer;
+use mmtk::vm::RootsWorkFactory;
+use mmtk::vm::Scanning;
+use mmtk::vm::SlotVisitor;
+use mmtk::Mutator;
+
+pub struct VMScanning {}
+
+impl Scanning<Ruby> for VMScanning {
+    const UNIQUE_OBJECT_ENQUEUING: bool = true;
+
+    fn support_slot_enqueuing(_tls: VMWorkerThread, _object: ObjectReference) -> bool {
+        false
+    }
+
+    fn scan_object<EV: SlotVisitor<RubySlot>>(
+        _tls: VMWorkerThread,
+        _object: ObjectReference,
+        _slot_visitor: &mut EV,
+    ) {
+        unreachable!("We have not enabled slot enqueuing for any types, yet.");
+    }
+
+    fn scan_object_and_trace_edges<OT: ObjectTracer>(
+        tls: VMWorkerThread,
+        object: ObjectReference,
+        object_tracer: &mut OT,
+    ) {
+        debug_assert!(
+            mmtk::memory_manager::is_mmtk_object(object.to_raw_address()).is_some(),
+            "Not an MMTk object: {object}",
+        );
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(tls) };
+        let visit_object = |_worker, target_object: ObjectReference, pin| {
+            trace!(
+                "Tracing edge: {} -> {}{}",
+                object,
+                target_object,
+                if pin { " pin" } else { "" }
+            );
+            debug_assert!(
+                mmtk::memory_manager::is_mmtk_object(target_object.to_raw_address()).is_some(),
+                "Destination is not an MMTk object. Src: {object} dst: {target_object}"
+            );
+
+            debug_assert!(
+                // If we are in a moving GC, all objects should be pinned by PinningRegistry.
+                // If it is requested that target_object be pinned but it is not pinned, then
+                // it is a bug because it could be moved.
+                if crate::mmtk().get_plan().current_gc_may_move_object() && pin {
+                    memory_manager::is_pinned(target_object)
+                } else {
+                    true
+                },
+                "Object {object} is trying to pin {target_object}"
+            );
+
+            let forwarded_target = object_tracer.trace_object(target_object);
+            if forwarded_target != target_object {
+                trace!("  Forwarded target {target_object} -> {forwarded_target}");
+            }
+            forwarded_target
+        };
+        gc_tls
+            .object_closure
+            .set_temporarily_and_run_code(visit_object, || {
+                (upcalls().call_gc_mark_children)(object);
+
+                if crate::mmtk().get_plan().current_gc_may_move_object() {
+                    (upcalls().update_object_references)(object);
+                }
+            });
+    }
+
+    fn notify_initial_thread_scan_complete(_partial_scan: bool, _tls: VMWorkerThread) {
+        // Do nothing
+    }
+
+    fn scan_roots_in_mutator_thread(
+        _tls: VMWorkerThread,
+        _mutator: &'static mut Mutator<Ruby>,
+        mut _factory: impl RootsWorkFactory<RubySlot>,
+    ) {
+        // Do nothing.  All stacks (including Ruby stacks and machine stacks) are reachable from
+        // `rb_vm_t` -> ractor -> thread -> fiber -> stacks.  It is part of `ScanGCRoots` which
+        // calls `rb_gc_mark_roots` -> `rb_vm_mark`.
+    }
+
+    fn scan_vm_specific_roots(tls: VMWorkerThread, factory: impl RootsWorkFactory<RubySlot>) {
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(tls) };
+        let root_scanning_work_packets: Vec<Box<dyn GCWork<Ruby>>> = vec![
+            Box::new(ScanGCRoots::new(factory.clone())),
+            Box::new(ScanObjspace::new(factory.clone())),
+        ];
+        gc_tls.worker().scheduler().work_buckets[WorkBucketStage::Prepare]
+            .bulk_add(root_scanning_work_packets);
+
+        // Generate WB-unprotected roots scanning work packets
+
+        'gen_wb_unprotected_work: {
+            let is_nursery_gc = (crate::mmtk().get_plan().generational())
+                .is_some_and(|gen| gen.is_current_gc_nursery());
+            if !is_nursery_gc {
+                break 'gen_wb_unprotected_work;
+            }
+
+            let vecs = {
+                let guard = crate::binding()
+                    .wb_unprotected_objects
+                    .try_lock()
+                    .expect("Someone is holding the lock of wb_unprotected_objects?");
+                if guard.is_empty() {
+                    break 'gen_wb_unprotected_work;
+                }
+
+                let mut collector = ChunkedVecCollector::new(128);
+                collector.extend(guard.iter().copied());
+                collector.into_vecs()
+            };
+
+            let packets = vecs
+                .into_iter()
+                .map(|objects| {
+                    let factory = factory.clone();
+                    Box::new(ScanWbUnprotectedRoots { factory, objects }) as _
+                })
+                .collect::<Vec<_>>();
+
+            gc_tls.worker().scheduler().work_buckets[WorkBucketStage::Prepare].bulk_add(packets);
+        }
+    }
+
+    fn supports_return_barrier() -> bool {
+        false
+    }
+
+    fn prepare_for_roots_re_scanning() {
+        todo!()
+    }
+
+    fn process_weak_refs(
+        worker: &mut GCWorker<Ruby>,
+        tracer_context: impl mmtk::vm::ObjectTracerContext<Ruby>,
+    ) -> bool {
+        crate::binding()
+            .weak_proc
+            .process_weak_stuff(worker, tracer_context);
+        crate::binding().pinning_registry.cleanup(worker);
+        false
+    }
+
+    fn forward_weak_refs(
+        _worker: &mut GCWorker<Ruby>,
+        _tracer_context: impl mmtk::vm::ObjectTracerContext<Ruby>,
+    ) {
+        panic!("We can't use MarkCompact in Ruby.");
+    }
+}
+
+impl VMScanning {
+    const OBJECT_BUFFER_SIZE: usize = 4096;
+
+    fn collect_object_roots_in<F: FnOnce()>(
+        root_scan_kind: &str,
+        gc_tls: &mut GCThreadTLS,
+        factory: &mut impl RootsWorkFactory<RubySlot>,
+        callback: F,
+    ) {
+        let mut buffer: Vec<ObjectReference> = Vec::new();
+        let visit_object = |_, object: ObjectReference, pin| {
+            debug!(
+                "[{}] Visiting object: {}{}",
+                root_scan_kind,
+                object,
+                if pin {
+                    "(unmovable root)"
+                } else {
+                    "(movable, but we pin it anyway)"
+                }
+            );
+            debug_assert!(
+                mmtk::memory_manager::is_mmtk_object(object.to_raw_address()).is_some(),
+                "Root does not point to MMTk object.  object: {object}"
+            );
+            buffer.push(object);
+            if buffer.len() >= Self::OBJECT_BUFFER_SIZE {
+                factory.create_process_pinning_roots_work(std::mem::take(&mut buffer));
+            }
+            object
+        };
+        gc_tls
+            .object_closure
+            .set_temporarily_and_run_code(visit_object, callback);
+
+        if !buffer.is_empty() {
+            factory.create_process_pinning_roots_work(buffer);
+        }
+    }
+}
+
+trait GlobaRootScanningWork {
+    type F: RootsWorkFactory<RubySlot>;
+    const NAME: &'static str;
+
+    fn new(factory: Self::F) -> Self;
+    fn scan_roots();
+    fn roots_work_factory(&mut self) -> &mut Self::F;
+
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(worker.tls) };
+
+        let factory = self.roots_work_factory();
+
+        VMScanning::collect_object_roots_in(Self::NAME, gc_tls, factory, || {
+            Self::scan_roots();
+        });
+    }
+}
+
+macro_rules! define_global_root_scanner {
+    ($name: ident, $code: expr) => {
+        struct $name<F: RootsWorkFactory<RubySlot>> {
+            factory: F,
+        }
+        impl<F: RootsWorkFactory<RubySlot>> GlobaRootScanningWork for $name<F> {
+            type F = F;
+            const NAME: &'static str = stringify!($name);
+            fn new(factory: Self::F) -> Self {
+                Self { factory }
+            }
+            fn scan_roots() {
+                $code
+            }
+            fn roots_work_factory(&mut self) -> &mut Self::F {
+                &mut self.factory
+            }
+        }
+        impl<F: RootsWorkFactory<RubySlot>> GCWork<Ruby> for $name<F> {
+            fn do_work(&mut self, worker: &mut GCWorker<Ruby>, mmtk: &'static mmtk::MMTK<Ruby>) {
+                GlobaRootScanningWork::do_work(self, worker, mmtk);
+            }
+        }
+    };
+}
+
+define_global_root_scanner!(ScanGCRoots, {
+    (crate::upcalls().scan_gc_roots)();
+});
+
+define_global_root_scanner!(ScanObjspace, {
+    (crate::upcalls().scan_objspace)();
+});
+
+struct ScanWbUnprotectedRoots<F: RootsWorkFactory<RubySlot>> {
+    factory: F,
+    objects: Vec<ObjectReference>,
+}
+
+impl<F: RootsWorkFactory<RubySlot>> GCWork<Ruby> for ScanWbUnprotectedRoots<F> {
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(worker.tls) };
+        VMScanning::collect_object_roots_in("wb_unprot_roots", gc_tls, &mut self.factory, || {
+            for object in self.objects.iter().copied() {
+                if object.is_reachable() {
+                    debug!("[wb_unprot_roots] Visiting WB-unprotected object (parent): {object}");
+                    (upcalls().call_gc_mark_children)(object);
+
+                    if crate::mmtk().get_plan().current_gc_may_move_object() {
+                        (upcalls().update_object_references)(object);
+                    }
+                } else {
+                    debug!(
+                        "[wb_unprot_roots] Skipping young WB-unprotected object (parent): {object}"
+                    );
+                }
+            }
+        });
+    }
+}
diff --git a/gc/mmtk/src/utils.rs b/gc/mmtk/src/utils.rs
new file mode 100644
index 0000000000..d1979eaf58
--- /dev/null
+++ b/gc/mmtk/src/utils.rs
@@ -0,0 +1,161 @@
+use std::sync::atomic::AtomicUsize;
+use std::sync::atomic::Ordering;
+
+use atomic_refcell::AtomicRefCell;
+use mmtk::scheduler::GCWork;
+use mmtk::scheduler::GCWorker;
+use mmtk::scheduler::WorkBucketStage;
+
+use crate::Ruby;
+use sysinfo::System;
+
+pub struct ChunkedVecCollector<T> {
+    vecs: Vec<Vec<T>>,
+    current_vec: Vec<T>,
+    chunk_size: usize,
+}
+
+impl<T> ChunkedVecCollector<T> {
+    pub fn new(chunk_size: usize) -> Self {
+        Self {
+            vecs: vec![],
+            current_vec: Vec::with_capacity(chunk_size),
+            chunk_size,
+        }
+    }
+
+    pub fn add(&mut self, item: T) {
+        self.current_vec.push(item);
+        if self.current_vec.len() == self.chunk_size {
+            self.flush();
+        }
+    }
+
+    fn flush(&mut self) {
+        let new_vec = Vec::with_capacity(self.chunk_size);
+        let old_vec = std::mem::replace(&mut self.current_vec, new_vec);
+        self.vecs.push(old_vec);
+    }
+
+    pub fn into_vecs(mut self) -> Vec<Vec<T>> {
+        if !self.current_vec.is_empty() {
+            self.flush();
+        }
+        self.vecs
+    }
+}
+
+impl<A> Extend<A> for ChunkedVecCollector<A> {
+    fn extend<T: IntoIterator<Item = A>>(&mut self, iter: T) {
+        for item in iter {
+            self.add(item);
+        }
+    }
+}
+
+pub struct AfterAll {
+    counter: AtomicUsize,
+    stage: WorkBucketStage,
+    packets: AtomicRefCell<Vec<Box<dyn GCWork<Ruby>>>>,
+}
+
+unsafe impl Sync for AfterAll {}
+
+impl AfterAll {
+    pub fn new(stage: WorkBucketStage) -> Self {
+        Self {
+            counter: AtomicUsize::new(0),
+            stage,
+            packets: AtomicRefCell::new(vec![]),
+        }
+    }
+
+    pub fn add_packets(&self, mut packets: Vec<Box<dyn GCWork<Ruby>>>) {
+        let mut borrow = self.packets.borrow_mut();
+        borrow.append(&mut packets);
+    }
+
+    pub fn count_up(&self, n: usize) {
+        self.counter.fetch_add(n, Ordering::SeqCst);
+    }
+
+    pub fn count_down(&self, worker: &mut GCWorker<Ruby>) {
+        let old = self.counter.fetch_sub(1, Ordering::SeqCst);
+        if old == 1 {
+            let packets = {
+                let mut borrow = self.packets.borrow_mut();
+                std::mem::take(borrow.as_mut())
+            };
+            worker.scheduler().work_buckets[self.stage].bulk_add(packets);
+        }
+    }
+}
+
+pub fn default_heap_max() -> usize {
+    let mut s = System::new();
+    s.refresh_memory();
+    s.total_memory()
+        .checked_mul(80)
+        .and_then(|v| v.checked_div(100))
+        .expect("Invalid Memory size") as usize
+}
+
+pub fn parse_capacity(input: &str) -> Option<usize> {
+    let trimmed = input.trim();
+
+    const KIBIBYTE: usize = 1024;
+    const MEBIBYTE: usize = 1024 * KIBIBYTE;
+    const GIBIBYTE: usize = 1024 * MEBIBYTE;
+
+    let (number, suffix) = if let Some(pos) = trimmed.find(|c: char| !c.is_numeric()) {
+        trimmed.split_at(pos)
+    } else {
+        (trimmed, "")
+    };
+
+    let Ok(v) = number.parse::<usize>() else {
+        return None;
+    };
+
+    match suffix {
+        "GiB" => Some(v * GIBIBYTE),
+        "MiB" => Some(v * MEBIBYTE),
+        "KiB" => Some(v * KIBIBYTE),
+        "" => Some(v),
+        _ => None,
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_parse_capacity_parses_bare_bytes() {
+        assert_eq!(Some(1234), parse_capacity("1234"));
+    }
+
+    #[test]
+    fn test_parse_capacity_parses_kibibytes() {
+        assert_eq!(Some(10240), parse_capacity("10KiB"));
+    }
+
+    #[test]
+    fn test_parse_capacity_parses_mebibytes() {
+        assert_eq!(Some(10485760), parse_capacity("10MiB"))
+    }
+
+    #[test]
+    fn test_parse_capacity_parses_gibibytes() {
+        assert_eq!(Some(10737418240), parse_capacity("10GiB"))
+    }
+
+    #[test]
+    fn test_parse_capacity_parses_nonsense_values() {
+        assert_eq!(None, parse_capacity("notanumber"));
+        assert_eq!(None, parse_capacity("5tartswithanumber"));
+        assert_eq!(None, parse_capacity("number1nthemiddle"));
+        assert_eq!(None, parse_capacity("numberattheend111"));
+        assert_eq!(None, parse_capacity("mult1pl3numb3r5"));
+    }
+}
diff --git a/gc/mmtk/src/weak_proc.rs b/gc/mmtk/src/weak_proc.rs
new file mode 100644
index 0000000000..d38dbe04a4
--- /dev/null
+++ b/gc/mmtk/src/weak_proc.rs
@@ -0,0 +1,328 @@
+use std::sync::Mutex;
+
+use mmtk::scheduler::GCWork;
+use mmtk::scheduler::GCWorker;
+use mmtk::scheduler::WorkBucketStage;
+use mmtk::util::ObjectReference;
+use mmtk::vm::ObjectTracerContext;
+
+use crate::abi::GCThreadTLS;
+use crate::upcalls;
+use crate::Ruby;
+
+pub struct WeakProcessor {
+    non_parallel_obj_free_candidates: Mutex<Vec<ObjectReference>>,
+    parallel_obj_free_candidates: Vec<Mutex<Vec<ObjectReference>>>,
+
+    /// Objects that needs `obj_free` called when dying.
+    /// If it is a bottleneck, replace it with a lock-free data structure,
+    /// or add candidates in batch.
+    weak_references: Mutex<Vec<ObjectReference>>,
+}
+
+impl Default for WeakProcessor {
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
+impl WeakProcessor {
+    pub fn new() -> Self {
+        Self {
+            non_parallel_obj_free_candidates: Mutex::new(Vec::new()),
+            parallel_obj_free_candidates: vec![Mutex::new(Vec::new())],
+            weak_references: Mutex::new(Vec::new()),
+        }
+    }
+
+    pub fn init_parallel_obj_free_candidates(&mut self, num_workers: usize) {
+        debug_assert_eq!(self.parallel_obj_free_candidates.len(), 1);
+
+        for _ in 1..num_workers {
+            self.parallel_obj_free_candidates
+                .push(Mutex::new(Vec::new()));
+        }
+    }
+
+    /// Add a batch of objects as candidates for `obj_free`.
+    ///
+    /// Amortizes mutex acquisition over the entire batch. Called when a
+    /// mutator's local buffer is flushed (buffer full or stop-the-world).
+    pub fn add_obj_free_candidates_batch(
+        &self,
+        objects: &[ObjectReference],
+        can_parallel_free: bool,
+    ) {
+        if objects.is_empty() {
+            return;
+        }
+
+        if can_parallel_free {
+            let num_buckets = self.parallel_obj_free_candidates.len();
+            for idx in 0..num_buckets {
+                let mut bucket = self.parallel_obj_free_candidates[idx].lock().unwrap();
+                for (i, &obj) in objects.iter().enumerate() {
+                    if i % num_buckets == idx {
+                        bucket.push(obj);
+                    }
+                }
+            }
+        } else {
+            self.non_parallel_obj_free_candidates
+                .lock()
+                .unwrap()
+                .extend_from_slice(objects);
+        }
+    }
+
+    pub fn get_all_obj_free_candidates(&self) -> Vec<ObjectReference> {
+        // let mut obj_free_candidates = self.obj_free_candidates.lock().unwrap();
+        let mut all_obj_free_candidates = self
+            .non_parallel_obj_free_candidates
+            .lock()
+            .unwrap()
+            .to_vec();
+
+        for candidates_mutex in &self.parallel_obj_free_candidates {
+            all_obj_free_candidates.extend(candidates_mutex.lock().unwrap().to_vec());
+        }
+
+        std::mem::take(all_obj_free_candidates.as_mut())
+    }
+
+    pub fn add_weak_reference(&self, object: ObjectReference) {
+        let mut weak_references = self.weak_references.lock().unwrap();
+        weak_references.push(object);
+    }
+
+    pub fn weak_references_count(&self) -> usize {
+        self.weak_references.lock().unwrap().len()
+    }
+
+    pub fn process_weak_stuff(
+        &self,
+        worker: &mut GCWorker<Ruby>,
+        _tracer_context: impl ObjectTracerContext<Ruby>,
+    ) {
+        worker.add_work(
+            WorkBucketStage::VMRefClosure,
+            ProcessNonParallelObjFreeCanadidates {},
+        );
+
+        for index in 0..self.parallel_obj_free_candidates.len() {
+            worker.add_work(
+                WorkBucketStage::VMRefClosure,
+                ProcessParallelObjFreeCandidates { index },
+            );
+        }
+
+        worker.add_work(WorkBucketStage::VMRefClosure, ProcessWeakReferences);
+
+        worker.add_work(WorkBucketStage::Prepare, UpdateFinalizerObjIdTables);
+
+        let global_tables_count = (crate::upcalls().global_tables_count)();
+        let work_packets = (0..global_tables_count)
+            .map(|i| Box::new(UpdateGlobalTables { idx: i }) as _)
+            .collect();
+
+        worker.scheduler().work_buckets[WorkBucketStage::VMRefClosure].bulk_add(work_packets);
+
+        worker.scheduler().work_buckets[WorkBucketStage::VMRefClosure]
+            .bulk_add(vec![Box::new(UpdateWbUnprotectedObjectsList) as _]);
+    }
+}
+
+fn process_obj_free_candidates(obj_free_candidates: &mut Vec<ObjectReference>) {
+    // Process obj_free
+    let mut new_candidates = Vec::new();
+
+    for object in obj_free_candidates.iter().copied() {
+        if object.is_reachable() {
+            // Forward and add back to the candidate list.
+            let new_object = object.forward();
+            trace!("Forwarding obj_free candidate: {object} -> {new_object}");
+            new_candidates.push(new_object);
+        } else {
+            (upcalls().call_obj_free)(object);
+        }
+    }
+
+    *obj_free_candidates = new_candidates;
+}
+
+struct ProcessParallelObjFreeCandidates {
+    index: usize,
+}
+
+impl GCWork<Ruby> for ProcessParallelObjFreeCandidates {
+    fn do_work(&mut self, _worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let mut obj_free_candidates = crate::binding().weak_proc.parallel_obj_free_candidates
+            [self.index]
+            .try_lock()
+            .expect("Lock for parallel_obj_free_candidates should not be held");
+
+        process_obj_free_candidates(&mut obj_free_candidates);
+    }
+}
+
+struct ProcessNonParallelObjFreeCanadidates;
+
+impl GCWork<Ruby> for ProcessNonParallelObjFreeCanadidates {
+    fn do_work(&mut self, _worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let mut obj_free_candidates = crate::binding()
+            .weak_proc
+            .non_parallel_obj_free_candidates
+            .try_lock()
+            .expect("Lock for non_parallel_obj_free_candidates should not be held");
+
+        process_obj_free_candidates(&mut obj_free_candidates);
+    }
+}
+
+struct ProcessWeakReferences;
+
+impl GCWork<Ruby> for ProcessWeakReferences {
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        if crate::mmtk().get_plan().current_gc_may_move_object() {
+            let gc_tls: &mut GCThreadTLS = unsafe { GCThreadTLS::from_vwt_check(worker.tls) };
+
+            let visit_object = |_worker, target_object: ObjectReference, _pin| {
+                debug_assert!(
+                    mmtk::memory_manager::is_mmtk_object(target_object.to_raw_address()).is_some(),
+                    "Destination is not an MMTk object"
+                );
+
+                target_object
+                    .get_forwarded_object()
+                    .unwrap_or(target_object)
+            };
+
+            gc_tls
+                .object_closure
+                .set_temporarily_and_run_code(visit_object, || {
+                    self.process_weak_references(true);
+                })
+        } else {
+            self.process_weak_references(false);
+        }
+    }
+}
+
+impl ProcessWeakReferences {
+    fn process_weak_references(&mut self, moving_gc: bool) {
+        let mut weak_references = crate::binding()
+            .weak_proc
+            .weak_references
+            .try_lock()
+            .expect("Mutators should not be holding the lock.");
+
+        weak_references.retain_mut(|object_ptr| {
+            let object = object_ptr.get_forwarded_object().unwrap_or(*object_ptr);
+
+            if object != *object_ptr {
+                *object_ptr = object;
+            }
+
+            if object.is_reachable() {
+                (upcalls().handle_weak_references)(object, moving_gc);
+
+                true
+            } else {
+                false
+            }
+        });
+    }
+}
+
+trait GlobalTableProcessingWork {
+    fn process_table(&mut self);
+
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let gc_tls = unsafe { GCThreadTLS::from_vwt_check(worker.tls) };
+
+        // `hash_foreach_replace` depends on `gb_object_moved_p` which has to have the semantics
+        // of `trace_object` due to the way it is used in `UPDATE_IF_MOVED`.
+        let forward_object = |_worker, object: ObjectReference, _pin| {
+            debug_assert!(
+                mmtk::memory_manager::is_mmtk_object(object.to_raw_address()).is_some(),
+                "{object} is not an MMTk object"
+            );
+            let result = object.forward();
+            trace!("Forwarding reference: {object} -> {result}");
+            result
+        };
+
+        gc_tls
+            .object_closure
+            .set_temporarily_and_run_code(forward_object, || {
+                self.process_table();
+            });
+    }
+}
+
+struct UpdateFinalizerObjIdTables;
+impl GlobalTableProcessingWork for UpdateFinalizerObjIdTables {
+    fn process_table(&mut self) {
+        (crate::upcalls().update_finalizer_table)();
+    }
+}
+impl GCWork<Ruby> for UpdateFinalizerObjIdTables {
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, mmtk: &'static mmtk::MMTK<Ruby>) {
+        GlobalTableProcessingWork::do_work(self, worker, mmtk);
+    }
+}
+
+struct UpdateGlobalTables {
+    idx: i32,
+}
+impl GlobalTableProcessingWork for UpdateGlobalTables {
+    fn process_table(&mut self) {
+        (crate::upcalls().update_global_tables)(
+            self.idx,
+            crate::mmtk().get_plan().current_gc_may_move_object(),
+        )
+    }
+}
+impl GCWork<Ruby> for UpdateGlobalTables {
+    fn do_work(&mut self, worker: &mut GCWorker<Ruby>, mmtk: &'static mmtk::MMTK<Ruby>) {
+        GlobalTableProcessingWork::do_work(self, worker, mmtk);
+    }
+}
+
+struct UpdateWbUnprotectedObjectsList;
+
+impl GCWork<Ruby> for UpdateWbUnprotectedObjectsList {
+    fn do_work(&mut self, _worker: &mut GCWorker<Ruby>, _mmtk: &'static mmtk::MMTK<Ruby>) {
+        let mut objects = crate::binding().wb_unprotected_objects.try_lock().expect(
+            "Someone is holding the lock of wb_unprotected_objects during weak processing phase?",
+        );
+
+        let old_objects = std::mem::take(&mut *objects);
+
+        debug!("Updating {} WB-unprotected objects", old_objects.len());
+
+        for object in old_objects {
+            if object.is_reachable() {
+                // Forward and add back to the candidate list.
+                let new_object = object.forward();
+                trace!("Forwarding WB-unprotected object: {object} -> {new_object}");
+                objects.insert(new_object);
+            } else {
+                trace!("Removing WB-unprotected object from list: {object}");
+            }
+        }
+
+        debug!("Retained {} live WB-unprotected objects.", objects.len());
+    }
+}
+
+// Provide a shorthand `object.forward()`.
+trait Forwardable {
+    fn forward(&self) -> Self;
+}
+
+impl Forwardable for ObjectReference {
+    fn forward(&self) -> Self {
+        self.get_forwarded_object().unwrap_or(*self)
+    }
+}
diff --git a/gc/wbcheck/extconf.rb b/gc/wbcheck/extconf.rb
new file mode 100644
index 0000000000..18b32d820d
--- /dev/null
+++ b/gc/wbcheck/extconf.rb
@@ -0,0 +1,3 @@
+require_relative '../extconf_base'
+
+create_gc_makefile("wbcheck")
diff --git a/gc/wbcheck/wbcheck.c b/gc/wbcheck/wbcheck.c
new file mode 100644
index 0000000000..a7d4cd6ccf
--- /dev/null
+++ b/gc/wbcheck/wbcheck.c
@@ -0,0 +1,1936 @@
+#include "internal.h"
+#include "ruby/ruby.h"
+#include "ruby/assert.h"
+#include "ruby/atomic.h"
+#include "ruby/debug.h"
+#include "ruby/internal/core/rbasic.h"
+#include "ruby/st.h"
+#include "internal/object.h"
+#include "internal/array.h"
+#include "internal/class.h"
+
+#include "ruby/thread.h"
+#include "gc/gc.h"
+#include "gc/gc_impl.h"
+
+#include <stdbool.h>
+#include <stdarg.h>
+
+// Debug output control
+static bool wbcheck_debug_enabled = false;
+
+// Verification after write barrier control
+static bool wbcheck_verify_after_wb_enabled = false;
+
+// Useless write barrier warning control
+static bool wbcheck_warn_useless_wb_enabled = false;
+
+static void
+wbcheck_debug(const char *format, ...)
+{
+    if (!wbcheck_debug_enabled) return;
+
+    va_list args;
+    va_start(args, format);
+    vfprintf(stderr, format, args);
+    va_end(args);
+}
+
+#define WBCHECK_DEBUG(...) do { \
+    if (wbcheck_debug_enabled) { \
+        wbcheck_debug(__VA_ARGS__); \
+    } \
+} while (0)
+
+static void
+wbcheck_debug_obj_info_dump(VALUE obj)
+{
+    if (!wbcheck_debug_enabled) return;
+    char buff[0x100];
+    fprintf(stderr, "%s\n", rb_raw_obj_info(buff, sizeof(buff), obj));
+}
+
+// Forward declaration
+static void lock_and_maybe_gc(void *objspace_ptr);
+static void force_gc(void *objspace_ptr);
+
+// Configure wbcheck from environment variables
+static void
+wbcheck_configure_from_env(void)
+{
+    // Configure debug output based on environment variable
+    const char *debug_env = getenv("WBCHECK_DEBUG");
+    if (debug_env && (strcmp(debug_env, "1") == 0 || strcmp(debug_env, "true") == 0)) {
+        wbcheck_debug_enabled = true;
+    }
+
+    // Configure verification after write barrier based on environment variable
+    const char *verify_after_wb_env = getenv("WBCHECK_VERIFY_AFTER_WB");
+    if (verify_after_wb_env && (strcmp(verify_after_wb_env, "1") == 0 || strcmp(verify_after_wb_env, "true") == 0)) {
+        wbcheck_verify_after_wb_enabled = true;
+    }
+
+    // Configure useless write barrier warnings based on environment variable
+    const char *warn_useless_wb_env = getenv("WBCHECK_WARN_USELESS_WB");
+    if (warn_useless_wb_env && (strcmp(warn_useless_wb_env, "1") == 0 || strcmp(warn_useless_wb_env, "true") == 0)) {
+        wbcheck_warn_useless_wb_enabled = true;
+    }
+}
+
+// Define same heap sizes as the default GC
+static size_t heap_sizes[] = {
+    32,
+    40,
+    48,
+    56,
+    64,
+    72,
+    80,
+    96,
+    128,
+    160,
+    256,
+    512,
+    640,
+    768,
+    1024,
+    0
+};
+
+#define HEAP_COUNT ((int)(sizeof(heap_sizes) / sizeof(heap_sizes[0])) - 1)
+#define MAX_HEAP_SIZE (heap_sizes[(HEAP_COUNT) - 1])
+
+// Object states for verification tracking
+typedef enum {
+    WBCHECK_STATE_CLEAR,    // Just allocated or writebarrier_remember, needs reference capture
+    WBCHECK_STATE_MARKED,   // Has valid snapshot, ready for normal operation
+    WBCHECK_STATE_DIRTY     // Has seen writebarrier since last snapshot, queued for verification
+} wbcheck_object_state_t;
+
+// Tri-color marking colors
+typedef enum {
+    WBCHECK_COLOR_WHITE,    // Unmarked - will be swept
+    WBCHECK_COLOR_GRAY,     // Marked but children not processed
+    WBCHECK_COLOR_BLACK     // Marked and children processed
+} wbcheck_color_t;
+
+// GC phases
+typedef enum {
+    WBCHECK_PHASE_MUTATOR,   // Normal execution
+    WBCHECK_PHASE_SNAPSHOT,  // Collecting references for verification
+    WBCHECK_PHASE_FULL_GC    // Marking objects during full GC
+} wbcheck_phase_t;
+
+// List of objects
+typedef struct {
+    VALUE *items;
+    size_t count;
+    size_t capacity;
+} wbcheck_object_list_t;
+
+// Helper functions for object list
+static wbcheck_object_list_t *
+wbcheck_object_list_init_with_capacity(size_t capacity)
+{
+    wbcheck_object_list_t *list = calloc(1, sizeof(wbcheck_object_list_t));
+    if (!list) rb_bug("wbcheck: failed to allocate object list structure");
+
+    if (capacity < 4) capacity = 4;
+    list->items = malloc(capacity * sizeof(VALUE));
+    if (!list->items) rb_bug("wbcheck: failed to allocate object list array");
+    list->capacity = capacity;
+    list->count = 0;
+    return list;
+}
+
+static wbcheck_object_list_t *
+wbcheck_object_list_init(void)
+{
+    return wbcheck_object_list_init_with_capacity(4);
+}
+
+static void
+wbcheck_object_list_append(wbcheck_object_list_t *list, VALUE obj)
+{
+    if (list->count >= list->capacity) {
+        size_t new_capacity = list->capacity == 0 ? 4 : list->capacity * 2;
+        VALUE *new_items = realloc(list->items, new_capacity * sizeof(VALUE));
+        if (!new_items) rb_bug("wbcheck: failed to reallocate object list array");
+        list->items = new_items;
+        list->capacity = new_capacity;
+    }
+    list->items[list->count++] = obj;
+}
+
+static void
+wbcheck_object_list_free(wbcheck_object_list_t *list)
+{
+    if (!list) return;
+    if (list->items) {
+        free(list->items);
+    }
+    free(list);
+}
+
+static void
+wbcheck_object_list_debug_print(wbcheck_object_list_t *list)
+{
+    if (!wbcheck_debug_enabled) return;
+    for (size_t i = 0; i < list->count; i++) {
+        char buff[0x100];
+        fprintf(stderr, "-> %s\n", rb_raw_obj_info(buff, sizeof(buff), list->items[i]));
+    }
+}
+
+static bool
+wbcheck_object_list_contains(wbcheck_object_list_t *list, VALUE obj)
+{
+    for (size_t i = 0; i < list->count; i++) {
+        if (list->items[i] == obj) {
+            return true;
+        }
+    }
+    return false;
+}
+
+// Information tracked for each object
+typedef struct {
+    size_t alloc_size;      // Allocated size (static)
+    bool wb_protected;      // Write barrier protection status (static)
+    VALUE finalizers;       // Ruby Array of finalizers like [finalizer1, finalizer2, ...]
+    wbcheck_object_list_t *gc_mark_snapshot; // Snapshot of references from last GC mark
+    wbcheck_object_list_t *mark_maybe_snapshot; // Conservative refs reported via mark_maybe; needed for liveness, not verifiable
+    wbcheck_object_list_t *writebarrier_children; // References added via write barriers since last snapshot
+    wbcheck_object_state_t state; // Current state in verification lifecycle
+    wbcheck_color_t color;  // Tri-color marking color
+} rb_wbcheck_object_info_t;
+
+// Finalizer job types
+struct wbcheck_final_job {
+    struct wbcheck_final_job *next;
+    enum {
+        WBCHECK_FINAL_JOB_DFREE,
+        WBCHECK_FINAL_JOB_FINALIZE,
+    } kind;
+    union {
+        struct {
+            void (*func)(void *);
+            void *data;
+        } dfree;
+        struct {
+            VALUE finalizer_array;
+        } finalize;
+    } as;
+};
+
+// wbcheck objspace structure to track all objects
+typedef struct {
+    st_table *object_table;  // Hash table to track all allocated objects (VALUE -> rb_wbcheck_object_info_t*)
+    wbcheck_object_list_t *objects_to_capture; // Objects that need initial reference capture
+    wbcheck_object_list_t *objects_to_verify; // Objects that need verification after write barriers
+    wbcheck_object_list_t *current_refs; // Current list for collecting references during marking
+    wbcheck_object_list_t *current_maybe_refs; // Current list for collecting mark_maybe references during marking
+    wbcheck_object_list_t *mark_queue; // Queue of gray objects for tri-color marking
+    wbcheck_object_list_t *weak_references; // Objects holding weak references, found during marking
+    wbcheck_phase_t phase;   // Current GC phase
+    bool gc_enabled;         // Whether GC is allowed to run
+    bool gc_stress;          // GC stress mode (run GC on every allocation)
+    size_t gc_threshold;     // Trigger GC when object count reaches this
+    size_t missed_write_barrier_parents; // Number of parent objects with missed write barriers
+    size_t missed_write_barrier_children; // Total number of missed write barriers detected
+    size_t simulated_gc_count; // Simulated GC count incremented on each GC.start
+    bool measure_total_time;   // Whether to accumulate :time in stats
+    struct wbcheck_final_job *finalizer_jobs; // Linked list of finalizer jobs
+    rb_nativethread_lock_t finalizer_lock;   // Protects finalizer_jobs list
+    rb_postponed_job_handle_t finalizer_postponed_job; // Postponed job handle for finalizers
+} rb_wbcheck_objspace_t;
+
+// Global objspace pointer for accessing from obj_slot_size function
+static rb_wbcheck_objspace_t *wbcheck_global_objspace = NULL;
+
+// Forward declarations
+static void wbcheck_foreach_object(rb_wbcheck_objspace_t *objspace, int (*callback)(VALUE obj, rb_wbcheck_object_info_t *info, void *data), void *data);
+static int wbcheck_verify_all_references_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data);
+static int wbcheck_update_all_snapshots_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data);
+static void wbcheck_run_finalizers_for_object(VALUE obj, rb_wbcheck_object_info_t *info);
+static void gc_run_finalizers(void *data);
+static void make_final_job(rb_wbcheck_objspace_t *objspace, VALUE obj, VALUE finalizer_array);
+
+// Helper functions for object tracking
+static rb_wbcheck_object_info_t *
+wbcheck_get_object_info(VALUE obj)
+{
+    // Objspace must be initialized by this point
+    GC_ASSERT(wbcheck_global_objspace);
+
+    st_data_t value;
+    if (st_lookup(wbcheck_global_objspace->object_table, (st_data_t)obj, &value)) {
+        return (rb_wbcheck_object_info_t *)value;
+    }
+
+    fprintf(stderr, "wbcheck: object not found in tracking table\n");
+    char buff[0x100];
+    fprintf(stderr, "%s\n", rb_raw_obj_info(buff, sizeof(buff), obj));
+
+    // Force ASAN crash?
+    ((volatile VALUE *)obj)[0];
+
+    // Object not found in tracking table - this should never happen
+    rb_bug("wbcheck: object not found in tracking table");
+}
+
+static void
+wbcheck_report_error(void *objspace_ptr, VALUE parent_obj, wbcheck_object_list_t *current_refs, wbcheck_object_list_t *gc_mark_snapshot, wbcheck_object_list_t *writebarrier_children, wbcheck_object_list_t *missed_refs)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+
+    rb_wbcheck_object_info_t *parent_info = wbcheck_get_object_info(parent_obj);
+
+    size_t snapshot_count = gc_mark_snapshot ? gc_mark_snapshot->count : 0;
+    size_t wb_count = writebarrier_children ? writebarrier_children->count : 0;
+
+    fprintf(stderr, "WBCHECK ERROR: Missed write barrier detected!\n");
+    fprintf(stderr, "  Parent object: %p (wb_protected: %s)\n",
+           (void *)parent_obj, parent_info->wb_protected ? "true" : "false");
+    char buff[0x100];
+    fprintf(stderr, "    %s\n", rb_raw_obj_info(buff, sizeof(buff), parent_obj));
+    fprintf(stderr, "  Reference counts - snapshot: %zu, writebarrier: %zu, current: %zu, missed: %zu\n",
+           snapshot_count, wb_count, current_refs->count, missed_refs->count);
+
+    for (size_t i = 0; i < missed_refs->count; i++) {
+        VALUE missed_ref = missed_refs->items[i];
+        char buff[0x100];
+        fprintf(stderr, "  Missing reference to: %p\n    %s\n", (void *)missed_ref, rb_raw_obj_info(buff, sizeof(buff), missed_ref));
+    }
+
+    fprintf(stderr, "\n");
+    objspace->missed_write_barrier_parents++;
+    objspace->missed_write_barrier_children += missed_refs->count;
+}
+
+static void
+wbcheck_compare_references(void *objspace_ptr, VALUE parent_obj, wbcheck_object_list_t *current_refs, wbcheck_object_list_t *gc_mark_snapshot, wbcheck_object_list_t *writebarrier_children)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    (void)objspace;
+
+    size_t snapshot_count = gc_mark_snapshot ? gc_mark_snapshot->count : 0;
+    size_t wb_count = writebarrier_children ? writebarrier_children->count : 0;
+
+    WBCHECK_DEBUG("wbcheck: comparing references for object %p\n", (void *)parent_obj);
+    WBCHECK_DEBUG("wbcheck: current refs: %zu, snapshot refs: %zu, wb refs: %zu\n",
+                 current_refs->count, snapshot_count, wb_count);
+
+    // Collect missed references (lazily allocated)
+    wbcheck_object_list_t *missed_refs = NULL;
+
+    // Use circular comparison for better performance when lists are mostly similar
+    size_t snapshot_idx = 0;
+
+    // Check each object in current_refs to see if it's in either stored list
+    for (size_t i = 0; i < current_refs->count; i++) {
+        VALUE current_ref = current_refs->items[i];
+
+        // Usually the lists are nearly identical. We take advantage of this by
+        // attempting to loop over both lists in sequence. When the next element
+        // of the snapshot doesn't match the next element of our current_refs,
+        // we'll loop around the list to try to find it and continue from that
+        // match, so any runs of identical items can be matched efficiently.
+        //
+        // Pathologically this is O(N**2), but is O(N * num_changes)
+        bool found_in_snapshot = false;
+        if (gc_mark_snapshot && snapshot_count > 0) {
+            size_t start_idx = snapshot_idx;
+            do {
+                if (gc_mark_snapshot->items[snapshot_idx] == current_ref) {
+                    found_in_snapshot = true;
+                    snapshot_idx++;
+                    if (snapshot_idx >= snapshot_count) snapshot_idx = 0;
+                    break;
+                }
+                snapshot_idx++;
+                if (snapshot_idx >= snapshot_count) snapshot_idx = 0;
+            } while (snapshot_idx != start_idx);
+        }
+
+        if (found_in_snapshot) {
+            continue;
+        }
+
+        // Built-in immortal classes can be assigned via RBASIC_SET_CLASS_RAW,
+        // which bypasses the write barrier. They're pinned as VM roots and
+        // can never be collected, so a missing WB to them is harmless.
+        if (RB_TYPE_P(current_ref, T_CLASS) && FL_TEST_RAW(current_ref, RCLASS_IS_ROOT)) {
+            continue;
+        }
+
+        // Self reference... Weird but okay I guess
+        if (current_ref == parent_obj) {
+            continue;
+        }
+
+
+        // Check if reference exists in writebarrier_children
+        if (writebarrier_children && wbcheck_object_list_contains(writebarrier_children, current_ref)) {
+            continue;
+        }
+
+        // If we get here, the reference wasn't found in either list
+        // Lazily allocate missed_refs list on first miss
+        if (!missed_refs) {
+            missed_refs = wbcheck_object_list_init();
+        }
+        wbcheck_object_list_append(missed_refs, current_ref);
+    }
+
+    // Report any errors found
+    if (missed_refs) {
+        wbcheck_report_error(objspace_ptr, parent_obj, current_refs, gc_mark_snapshot, writebarrier_children, missed_refs);
+        wbcheck_object_list_free(missed_refs);
+    }
+}
+
+static void
+wbcheck_register_object(void *objspace_ptr, VALUE obj, size_t alloc_size, bool wb_protected)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    GC_ASSERT(objspace);
+
+    // Allocate and initialize object info structure
+    rb_wbcheck_object_info_t *info = calloc(1, sizeof(rb_wbcheck_object_info_t));
+    if (!info) rb_bug("wbcheck_register_object: failed to allocate object info");
+
+    info->alloc_size = alloc_size;
+    info->wb_protected = wb_protected;
+    info->finalizers = 0;  /* No finalizers initially */
+    info->gc_mark_snapshot = NULL;  /* No snapshot initially */
+    info->mark_maybe_snapshot = NULL;  /* No mark_maybe snapshot initially */
+    info->writebarrier_children = NULL;  /* No write barrier children initially */
+    info->state = WBCHECK_STATE_CLEAR;  /* Start in clear state */
+    info->color = WBCHECK_COLOR_BLACK;  /* Start as black to survive current GC */
+
+    // Store object info in hash table (VALUE -> rb_wbcheck_object_info_t*)
+    st_insert(objspace->object_table, (st_data_t)obj, (st_data_t)info);
+}
+
+static void
+wbcheck_unregister_object(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    rb_wbcheck_object_info_t *info;
+
+    if (st_delete(objspace->object_table, (st_data_t *)&obj, (st_data_t *)&info)) {
+        // Free object lists if they were allocated
+        wbcheck_object_list_free(info->gc_mark_snapshot);
+        wbcheck_object_list_free(info->mark_maybe_snapshot);
+        wbcheck_object_list_free(info->writebarrier_children);
+        free(info);
+    } else {
+        rb_bug("wbcheck_unregister_object: object not found in table");
+    }
+}
+
+// Bootup
+void *
+rb_gc_impl_objspace_alloc(void)
+{
+    wbcheck_configure_from_env();
+
+    rb_wbcheck_objspace_t *objspace = calloc(1, sizeof(rb_wbcheck_objspace_t));
+    if (!objspace) rb_bug("wbcheck: failed to allocate objspace");
+
+    objspace->object_table = st_init_numtable();
+    if (!objspace->object_table) {
+        free(objspace);
+        rb_bug("wbcheck: failed to create object table");
+    }
+
+    objspace->objects_to_capture = wbcheck_object_list_init();  // Initialize empty list
+    objspace->objects_to_verify = wbcheck_object_list_init();   // Initialize empty list
+    objspace->current_refs = NULL;     // No current refs initially
+    objspace->current_maybe_refs = NULL; // No current maybe refs initially
+    objspace->mark_queue = wbcheck_object_list_init(); // Initialize mark queue
+    objspace->weak_references = wbcheck_object_list_init(); // Initialize weak references array
+    objspace->phase = WBCHECK_PHASE_MUTATOR; // Start in mutator phase
+    objspace->gc_enabled = true;       // GC enabled by default (like default GC)
+    objspace->gc_stress = false;       // GC stress disabled by default
+    objspace->gc_threshold = 1000;     // Start with 1000 objects, will adjust after first GC
+    objspace->missed_write_barrier_parents = 0;  // No errors found yet
+    objspace->missed_write_barrier_children = 0; // No errors found yet
+    objspace->simulated_gc_count = 0;   // Start with GC count of 0
+    objspace->measure_total_time = true; // On by default
+
+    return objspace;
+}
+
+void
+rb_gc_impl_objspace_init(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+
+    // Object table is already initialized in objspace_alloc
+    // Set up global objspace pointer for obj_slot_size function
+    wbcheck_global_objspace = objspace;
+
+    // Initialize postponed job for finalizers
+    rb_native_mutex_initialize(&objspace->finalizer_lock);
+    objspace->finalizer_postponed_job = rb_postponed_job_preregister(0, gc_run_finalizers, objspace);
+}
+
+void *
+rb_gc_impl_ractor_cache_alloc(void *objspace_ptr, void *ractor)
+{
+    // Stub implementation
+    return NULL;
+}
+
+void
+rb_gc_impl_set_params(void *objspace_ptr)
+{
+    // Stub implementation
+}
+
+static VALUE
+gc_verify_internal_consistency(VALUE self)
+{
+    return Qnil;
+}
+
+void
+rb_gc_impl_init(void)
+{
+    VALUE gc_constants = rb_hash_new();
+    //rb_hash_aset(gc_constants, ID2SYM(rb_intern("BASE_SLOT_SIZE")), SIZET2NUM(BASE_SLOT_SIZE));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_SIZE")), SIZET2NUM(sizeof(struct RBasic) + sizeof(VALUE[RBIMPL_RVALUE_EMBED_LEN_MAX])));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RBASIC_SIZE")), SIZET2NUM(sizeof(struct RBasic)));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OVERHEAD")), INT2NUM(0));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVARGC_MAX_ALLOCATE_SIZE")), LONG2FIX(MAX_HEAP_SIZE));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("HEAP_COUNT")), LONG2FIX(HEAP_COUNT));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("SIZE_POOL_COUNT")), LONG2FIX(HEAP_COUNT));
+    rb_hash_aset(gc_constants, ID2SYM(rb_intern("RVALUE_OLD_AGE")), INT2FIX(3));
+    OBJ_FREEZE(gc_constants);
+    rb_define_const(rb_mGC, "INTERNAL_CONSTANTS", gc_constants);
+
+    // no-ops for compatibility
+    rb_define_singleton_method(rb_mGC, "verify_internal_consistency", gc_verify_internal_consistency, 0);
+
+    rb_define_singleton_method(rb_mGC, "compact", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "auto_compact", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "auto_compact=", rb_f_notimplement, 1);
+    rb_define_singleton_method(rb_mGC, "latest_compact_info", rb_f_notimplement, 0);
+    rb_define_singleton_method(rb_mGC, "verify_compaction_references", rb_f_notimplement, -1);
+    // Stub implementation
+}
+
+size_t *
+rb_gc_impl_heap_sizes(void *objspace_ptr)
+{
+    return heap_sizes;
+}
+
+// Shutdown
+void
+rb_gc_impl_shutdown_free_objects(void *objspace_ptr)
+{
+    // Stub implementation
+}
+
+void
+rb_gc_impl_objspace_free(void *objspace_ptr)
+{
+    // This should free everything, but we'll just let it leak
+}
+
+void
+rb_gc_impl_ractor_cache_free(void *objspace_ptr, void *cache)
+{
+    // Stub implementation
+}
+
+// GC
+void
+rb_gc_impl_start(void *objspace_ptr, bool full_mark, bool immediate_mark, bool immediate_sweep, bool compact)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    if (objspace) {
+        objspace->simulated_gc_count++;
+    }
+
+    if (!ruby_native_thread_p()) return;
+
+    unsigned int lev = RB_GC_VM_LOCK();
+    rb_gc_vm_barrier();
+    force_gc(objspace_ptr);
+    RB_GC_VM_UNLOCK(lev);
+}
+
+bool
+rb_gc_impl_during_gc_p(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    return objspace->phase != WBCHECK_PHASE_MUTATOR;
+}
+
+static void
+wbcheck_prepare_heap_i(VALUE obj, void *data)
+{
+    rb_gc_prepare_heap_process_object(obj);
+}
+
+void
+rb_gc_impl_prepare_heap(void *objspace_ptr)
+{
+    rb_gc_impl_each_object(objspace_ptr, wbcheck_prepare_heap_i, NULL);
+}
+
+void
+rb_gc_impl_gc_enable(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    objspace->gc_enabled = true;
+}
+
+void
+rb_gc_impl_gc_disable(void *objspace_ptr, bool finish_current_gc)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    objspace->gc_enabled = false;
+}
+
+bool
+rb_gc_impl_gc_enabled_p(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    return objspace->gc_enabled;
+}
+
+void
+rb_gc_impl_stress_set(void *objspace_ptr, VALUE flag)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    objspace->gc_stress = RTEST(flag);
+}
+
+VALUE
+rb_gc_impl_stress_get(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    return objspace->gc_stress ? Qtrue : Qfalse;
+}
+
+VALUE
+rb_gc_impl_config_get(void *objspace_ptr)
+{
+    return rb_hash_new();
+}
+
+void
+rb_gc_impl_config_set(void *objspace_ptr, VALUE hash)
+{
+}
+
+static wbcheck_object_list_t *
+wbcheck_collect_references_from_object(VALUE obj, rb_wbcheck_object_info_t *info)
+{
+    rb_wbcheck_objspace_t *objspace = wbcheck_global_objspace;
+
+    // Use combination of writebarrier children and last snapshot as capacity hint
+    size_t snapshot_count = (info->gc_mark_snapshot) ? info->gc_mark_snapshot->count : 0;
+    size_t wb_children_count = (info->writebarrier_children) ? info->writebarrier_children->count : 0;
+    size_t capacity_hint = snapshot_count + wb_children_count;
+    wbcheck_object_list_t *new_list = wbcheck_object_list_init_with_capacity(capacity_hint);
+
+    // Set up objspace state for marking. current_maybe_refs is allocated lazily
+    // by rb_gc_impl_mark_maybe, since most objects have no conservative refs.
+    objspace->current_refs = new_list;
+    objspace->current_maybe_refs = NULL;
+    objspace->phase = WBCHECK_PHASE_SNAPSHOT;
+
+    // Use the marking infrastructure to collect references
+    rb_gc_mark_children(objspace, obj);
+
+    // Clean up objspace state
+    objspace->phase = WBCHECK_PHASE_MUTATOR;
+    objspace->current_refs = NULL;
+
+    // Update the mark_maybe snapshot in place. These references don't participate
+    // in verification, but we need to keep them so full GC can mark them gray.
+    wbcheck_object_list_free(info->mark_maybe_snapshot);
+    info->mark_maybe_snapshot = objspace->current_maybe_refs;
+    objspace->current_maybe_refs = NULL;
+
+    if (wbcheck_debug_enabled) {
+        WBCHECK_DEBUG("wbcheck: collected %zu references from %p\n", new_list->count, (void *)obj);
+        char buff[0x100];
+        fprintf(stderr, "%s\n", rb_raw_obj_info(buff, sizeof(buff), obj));
+        wbcheck_object_list_debug_print(new_list);
+    }
+
+    return new_list;
+}
+
+static void
+wbcheck_collect_initial_references(void *objspace_ptr, VALUE obj)
+{
+    WBCHECK_DEBUG("wbcheck: collecting initial references from %p:\n", obj);
+    wbcheck_debug_obj_info_dump(obj);
+
+    // Get the object info and set the initial GC mark snapshot
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+    wbcheck_object_list_t *new_list = wbcheck_collect_references_from_object(obj, info);
+    RUBY_ASSERT(!info->gc_mark_snapshot);
+    RUBY_ASSERT(info->state == WBCHECK_STATE_CLEAR);
+    info->gc_mark_snapshot = new_list;  // Set the initial snapshot
+    info->state = WBCHECK_STATE_MARKED;  // Transition to marked state
+}
+
+static void
+wbcheck_verify_object_references(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+
+    // Ignore objects which are not write barrier protected
+    if (!info->wb_protected) {
+        return;
+    }
+
+    // We hadn't captured initial references
+    if (info->state == WBCHECK_STATE_CLEAR) {
+        RUBY_ASSERT(!info->gc_mark_snapshot);
+        return;
+    }
+
+    WBCHECK_DEBUG("wbcheck: verifying references for object:\n");
+    wbcheck_debug_obj_info_dump(obj);
+
+    // Get the current references from the object
+    wbcheck_object_list_t *current_refs = wbcheck_collect_references_from_object(obj, info);
+
+    // Check for useless write barriers before clearing them
+    if (wbcheck_warn_useless_wb_enabled && info->writebarrier_children) {
+        for (size_t i = 0; i < info->writebarrier_children->count; i++) {
+            VALUE wb_ref = info->writebarrier_children->items[i];
+            if (!wbcheck_object_list_contains(current_refs, wb_ref)) {
+                fprintf(stderr, "WBCHECK WARNING: Potentially useless write barrier detected for object %p\n", (void *)obj);
+                fprintf(stderr, "  Write barrier was recorded for reference to %p, but object no longer references it\n", (void *)wb_ref);
+                char buff[0x100];
+                fprintf(stderr, "  Parent: %s\n", rb_raw_obj_info(buff, sizeof(buff), obj));
+                fprintf(stderr, "  Stale reference: %s\n", rb_raw_obj_info(buff, sizeof(buff), wb_ref));
+            }
+        }
+    }
+
+    // Compare current_refs against both stored lists to detect missed write barriers
+    wbcheck_compare_references(objspace_ptr, obj, current_refs, info->gc_mark_snapshot, info->writebarrier_children);
+
+    // Update the snapshot with current references and clear write barrier children
+    wbcheck_object_list_free(info->gc_mark_snapshot);
+    wbcheck_object_list_free(info->writebarrier_children);
+    info->gc_mark_snapshot = current_refs;
+    info->writebarrier_children = NULL;
+    info->state = WBCHECK_STATE_MARKED;  // Back to marked state after verification
+}
+
+// Mark object as gray (add to mark queue)
+static void
+wbcheck_mark_gray(rb_wbcheck_objspace_t *objspace, VALUE obj)
+{
+    if (RB_SPECIAL_CONST_P(obj)) return;
+
+    st_data_t value;
+    if (!st_lookup(objspace->object_table, (st_data_t)obj, &value)) {
+        rb_bug("wbcheck: asked to mark object %p not in our object table", (void *)obj);
+    }
+
+    rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)value;
+    if (info->color != WBCHECK_COLOR_WHITE) {
+        return; // Already marked
+    }
+
+    info->color = WBCHECK_COLOR_GRAY;
+    wbcheck_object_list_append(objspace->mark_queue, obj);
+
+    if (RB_FL_TEST_RAW(obj, RUBY_FL_WEAK_REFERENCE)) {
+        wbcheck_object_list_append(objspace->weak_references, obj);
+    }
+
+    WBCHECK_DEBUG("wbcheck: marked gray: %p\n", (void *)obj);
+}
+
+// Reset all objects to white
+static int
+st_foreach_reset_white(st_data_t key, st_data_t val, st_data_t arg)
+{
+    rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)val;
+    info->color = WBCHECK_COLOR_WHITE;
+    return ST_CONTINUE;
+}
+
+// Mark all finalizer arrays to keep them alive during GC
+static int
+st_foreach_mark_finalizers(st_data_t key, st_data_t val, st_data_t arg)
+{
+    rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)val;
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)arg;
+
+    if (info->finalizers) {
+        wbcheck_mark_gray(objspace, info->finalizers);
+    }
+
+    return ST_CONTINUE;
+}
+
+// Full mark phase using tri-color marking with snapshots
+static void
+wbcheck_mark_phase(rb_wbcheck_objspace_t *objspace)
+{
+    WBCHECK_DEBUG("wbcheck: starting GC mark phase\n");
+
+    objspace->phase = WBCHECK_PHASE_FULL_GC;
+
+    // Clear mark queue and reset all objects to white
+    objspace->mark_queue->count = 0;
+    st_foreach(objspace->object_table, st_foreach_reset_white, 0);
+
+    // Mark all finalizer arrays first to keep them alive
+    st_foreach(objspace->object_table, st_foreach_mark_finalizers, (st_data_t)objspace);
+
+    // Mark finalizer arrays in pending jobs to keep them alive.
+    // No lock needed: all other threads are stopped during GC.
+    struct wbcheck_final_job *job = objspace->finalizer_jobs;
+    while (job != NULL) {
+        switch (job->kind) {
+          case WBCHECK_FINAL_JOB_DFREE:
+            break;
+          case WBCHECK_FINAL_JOB_FINALIZE:
+            wbcheck_mark_gray(objspace, job->as.finalize.finalizer_array);
+            break;
+          default:
+            rb_bug("wbcheck_mark_phase: unknown final job type %d", job->kind);
+        }
+        job = job->next;
+    }
+
+    // Mark roots gray
+    rb_gc_save_machine_context();
+    rb_gc_mark_roots(objspace, NULL);
+
+    // Process gray queue until empty
+    while (objspace->mark_queue->count > 0) {
+        // Get last object from queue (LIFO)
+        VALUE obj = objspace->mark_queue->items[--objspace->mark_queue->count];
+
+        st_data_t value;
+        if (st_lookup(objspace->object_table, (st_data_t)obj, &value)) {
+            rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)value;
+            if (info->color == WBCHECK_COLOR_GRAY) {
+                // Mark all children from snapshot gray
+                if (info->gc_mark_snapshot) {
+                    for (size_t i = 0; i < info->gc_mark_snapshot->count; i++) {
+                        wbcheck_mark_gray(objspace, info->gc_mark_snapshot->items[i]);
+                    }
+                }
+
+                // Conservatively-scanned children must also be kept alive
+                if (info->mark_maybe_snapshot) {
+                    for (size_t i = 0; i < info->mark_maybe_snapshot->count; i++) {
+                        wbcheck_mark_gray(objspace, info->mark_maybe_snapshot->items[i]);
+                    }
+                }
+
+                // Mark this object black
+                info->color = WBCHECK_COLOR_BLACK;
+                WBCHECK_DEBUG("wbcheck: marked black: %p\n", (void *)obj);
+            }
+        }
+    }
+
+    objspace->phase = WBCHECK_PHASE_MUTATOR;
+
+    WBCHECK_DEBUG("wbcheck: tri-color mark phase complete\n");
+}
+
+// Sweep phase callback - free white objects
+static int
+wbcheck_sweep_callback(st_data_t key, st_data_t val, st_data_t arg, int error)
+{
+    VALUE obj = (VALUE)key;
+    rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)val;
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)arg;
+
+    if (info->color == WBCHECK_COLOR_WHITE) {
+        WBCHECK_DEBUG("wbcheck: sweeping unmarked object %p\n", (void *)obj);
+
+        rb_gc_event_hook(obj, RUBY_INTERNAL_EVENT_FREEOBJ);
+
+        // Clear weak references first
+        rb_gc_obj_free_vm_weak_references(obj);
+
+        // Queue finalizers for postponed job if they exist
+        if (info->finalizers) {
+            make_final_job(objspace, obj, info->finalizers);
+            rb_postponed_job_trigger(objspace->finalizer_postponed_job);
+        }
+
+        // Call rb_gc_obj_free which handles finalizers/zombies
+        if (rb_gc_obj_free(objspace, obj)) {
+            // Object was actually freed, clean up our tracking
+            wbcheck_object_list_free(info->gc_mark_snapshot);
+            wbcheck_object_list_free(info->mark_maybe_snapshot);
+            wbcheck_object_list_free(info->writebarrier_children);
+            free(info);
+
+            // Free the actual object memory
+            free((void *)obj);
+
+            return ST_DELETE; // Remove from hash table
+        } else {
+            // Object became a zombie - it will be freed by postponed job
+            // Remove from tracking since we can't safely access it anymore
+            wbcheck_object_list_free(info->gc_mark_snapshot);
+            wbcheck_object_list_free(info->mark_maybe_snapshot);
+            wbcheck_object_list_free(info->writebarrier_children);
+            free(info);
+
+            // Free the actual object memory
+            free((void *)obj);
+
+            return ST_DELETE; // Remove from hash table
+        }
+    }
+
+    return ST_CONTINUE; // Keep marked objects
+}
+
+static void
+wbcheck_sweep_phase(rb_wbcheck_objspace_t *objspace)
+{
+    WBCHECK_DEBUG("wbcheck: starting sweep phase\n");
+
+    size_t objects_before = st_table_size(objspace->object_table);
+
+    // Sweep unmarked objects
+    st_foreach_check(objspace->object_table, wbcheck_sweep_callback, (st_data_t)objspace, 0);
+
+    size_t objects_after = st_table_size(objspace->object_table);
+    size_t freed_objects = objects_before - objects_after;
+
+    // Update GC threshold: 2x the live set after GC
+    objspace->gc_threshold = objects_after * 2;
+
+    WBCHECK_DEBUG("wbcheck: sweep phase complete - freed %zu objects (%zu -> %zu), new threshold: %zu\n",
+                  freed_objects, objects_before, objects_after, objspace->gc_threshold);
+}
+
+// Process weak references after marking - call rb_gc_handle_weak_references
+// on each object that was flagged with RUBY_FL_WEAK_REFERENCE and collected
+// during the mark phase.
+static void
+wbcheck_process_weak_references(rb_wbcheck_objspace_t *objspace)
+{
+    WBCHECK_DEBUG("wbcheck: processing %zu weak reference objects\n", objspace->weak_references->count);
+
+    for (size_t i = 0; i < objspace->weak_references->count; i++) {
+        VALUE obj = objspace->weak_references->items[i];
+        rb_gc_handle_weak_references(obj);
+    }
+
+    objspace->weak_references->count = 0;
+}
+
+// Full GC: verify all objects then mark from roots
+static void
+wbcheck_full_gc(rb_wbcheck_objspace_t *objspace)
+{
+    WBCHECK_DEBUG("wbcheck: starting full GC\n");
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_ENTER);
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_START);
+
+    // First, update snapshots for all objects (verify wb_protected ones)
+    WBCHECK_DEBUG("wbcheck: updating snapshots for all objects\n");
+    wbcheck_foreach_object(objspace, wbcheck_update_all_snapshots_callback, objspace);
+
+    // Now start tri-color marking
+    wbcheck_mark_phase(objspace);
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_END_MARK);
+
+    // Process weak references after marking, before sweeping
+    wbcheck_process_weak_references(objspace);
+
+    // Sweep unmarked objects
+    wbcheck_sweep_phase(objspace);
+
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_END_SWEEP);
+    rb_gc_event_hook(0, RUBY_INTERNAL_EVENT_GC_EXIT);
+
+    WBCHECK_DEBUG("wbcheck: full GC complete\n");
+}
+
+static void
+gc_step(void *objspace_ptr, bool force)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+
+    // Not initialized yet
+    if (!objspace) return;
+
+    if (!objspace->gc_enabled && !force) return;
+
+    // Process all objects that need verification after write barriers (if enabled)
+    if (wbcheck_verify_after_wb_enabled) {
+        for (size_t i = 0; i < objspace->objects_to_verify->count; i++) {
+            VALUE obj = objspace->objects_to_verify->items[i];
+            wbcheck_verify_object_references(objspace_ptr, obj);
+        }
+
+        // Clear the list after processing
+        objspace->objects_to_verify->count = 0;
+
+        // If any new errors were detected during verification, exit immediately
+        if (objspace->missed_write_barrier_parents > 0) {
+            rb_bug("wbcheck: missed write barrier detected during immediate verification (WBCHECK_VERIFY_AFTER_WB=1)");
+        }
+    }
+
+    // Process all objects that need initial reference capture
+    for (size_t i = 0; i < objspace->objects_to_capture->count; i++) {
+        VALUE obj = objspace->objects_to_capture->items[i];
+        wbcheck_collect_initial_references(objspace_ptr, obj);
+    }
+
+    // Clear the list after processing
+    objspace->objects_to_capture->count = 0;
+
+    // Run full GC if forced, if we exceed the threshold, or if gc_stress is enabled
+    if (ruby_native_thread_p() &&
+        (force ||
+         (objspace->gc_enabled &&
+          (objspace->gc_stress || st_table_size(objspace->object_table) >= objspace->gc_threshold)))) {
+        wbcheck_full_gc(objspace);
+    }
+
+}
+
+static void
+maybe_gc(void *objspace_ptr)
+{
+    gc_step(objspace_ptr, false);
+}
+
+static void
+force_gc(void *objspace_ptr)
+{
+    gc_step(objspace_ptr, true);
+}
+
+int ruby_thread_has_gvl_p(void);
+
+static void *
+lock_and_maybe_gc_gvl(void *objspace_ptr)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+    rb_gc_vm_barrier();
+
+    maybe_gc(objspace_ptr);
+
+    RB_GC_VM_UNLOCK(lev);
+    return NULL;
+}
+
+static void
+lock_and_maybe_gc(void *objspace_ptr)
+{
+    if (!ruby_native_thread_p()) return;
+
+    if (!ruby_thread_has_gvl_p()) {
+        rb_thread_call_with_gvl(lock_and_maybe_gc_gvl, objspace_ptr);
+    }
+    else {
+        lock_and_maybe_gc_gvl(objspace_ptr);
+    }
+}
+
+VALUE
+rb_gc_impl_new_obj(void *objspace_ptr, void *cache_ptr, VALUE klass, VALUE flags, bool wb_protected, size_t alloc_size)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+    rb_gc_vm_barrier();
+
+    // Check if we should trigger GC before allocating
+    maybe_gc(objspace_ptr);
+
+    // Ensure minimum allocation size of BASE_SLOT_SIZE
+    alloc_size = heap_sizes[rb_gc_impl_heap_id_for_size(objspace_ptr, alloc_size)];
+
+    // Allocate memory for the object
+    VALUE *mem = malloc(alloc_size);
+    if (!mem) rb_bug("FIXME: malloc failed");
+
+    // Initialize the object
+    VALUE obj = (VALUE)mem;
+    RBASIC(obj)->flags = flags;
+    *((VALUE *)&RBASIC(obj)->klass) = klass;
+
+    // Register the new object in our tracking table
+    wbcheck_register_object(objspace_ptr, obj, alloc_size, wb_protected);
+
+    // Add this object to the list of objects that need initial reference capture
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    wbcheck_object_list_append(objspace->objects_to_capture, obj);
+
+    RB_GC_VM_UNLOCK(lev);
+    return obj;
+}
+
+size_t
+rb_gc_impl_obj_slot_size(VALUE obj)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+    size_t result = info->alloc_size;
+
+    RB_GC_VM_UNLOCK(lev);
+    return result;
+}
+
+size_t
+rb_gc_impl_heap_id_for_size(void *objspace_ptr, size_t size)
+{
+    for (int i = 0; i < HEAP_COUNT; i++) {
+        if (size <= heap_sizes[i]) return i;
+    }
+    rb_bug("size too big");
+}
+
+bool
+rb_gc_impl_size_allocatable_p(size_t size)
+{
+    // Only allow sizes up to the largest heap size
+    return size <= MAX_HEAP_SIZE;
+}
+
+// Malloc
+void *
+rb_gc_impl_malloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    if (gc_allowed) {
+        lock_and_maybe_gc(objspace_ptr);
+    }
+    return malloc(size);
+}
+
+void *
+rb_gc_impl_calloc(void *objspace_ptr, size_t size, bool gc_allowed)
+{
+    if (gc_allowed) {
+        lock_and_maybe_gc(objspace_ptr);
+    }
+    return calloc(1, size);
+}
+
+void *
+rb_gc_impl_realloc(void *objspace_ptr, void *ptr, size_t new_size, size_t old_size, bool gc_allowed)
+{
+    if (gc_allowed) {
+        lock_and_maybe_gc(objspace_ptr);
+    }
+    return realloc(ptr, new_size);
+}
+
+void
+rb_gc_impl_free(void *objspace_ptr, void *ptr, size_t old_size)
+{
+    free(ptr);
+}
+
+void
+rb_gc_impl_adjust_memory_usage(void *objspace_ptr, ssize_t diff)
+{
+    // For wbcheck, we don't track memory usage
+}
+
+// Marking
+static void
+gc_mark(rb_wbcheck_objspace_t *objspace, VALUE obj)
+{
+    WBCHECK_DEBUG("wbcheck: gc_mark called\n");
+    wbcheck_debug_obj_info_dump(obj);
+
+    if (RB_SPECIAL_CONST_P(obj)) return;
+
+    switch (objspace->phase) {
+        case WBCHECK_PHASE_SNAPSHOT:
+            // Collecting references during verification
+            GC_ASSERT(objspace->current_refs);
+            wbcheck_object_list_append(objspace->current_refs, obj);
+            break;
+        case WBCHECK_PHASE_FULL_GC:
+            // Marking during full GC
+            wbcheck_mark_gray(objspace, obj);
+            break;
+        case WBCHECK_PHASE_MUTATOR:
+            // Should not be called during mutator phase
+            rb_bug("wbcheck: gc_mark called during mutator phase");
+            break;
+    }
+}
+
+void
+rb_gc_impl_mark(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+    gc_mark(objspace, obj);
+}
+
+void
+rb_gc_impl_mark_and_move(void *objspace_ptr, VALUE *ptr)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+    gc_mark(objspace, *ptr);
+}
+
+void
+rb_gc_impl_mark_and_pin(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+    gc_mark(objspace, obj);
+}
+
+void
+rb_gc_impl_mark_maybe(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+
+    if (!rb_gc_impl_pointer_to_heap_p(objspace_ptr, (void *)obj)) return;
+
+    switch (objspace->phase) {
+        case WBCHECK_PHASE_SNAPSHOT:
+            // We don't know if this is actually a reference or just a value
+            // that looks like one, so we can't expect a write barrier for it.
+            // Keep it separate from the verifiable refs, but retain it so full
+            // GC can mark the target gray if it does turn out to be live.
+            if (!objspace->current_maybe_refs) {
+                objspace->current_maybe_refs = wbcheck_object_list_init();
+            }
+            wbcheck_object_list_append(objspace->current_maybe_refs, obj);
+            break;
+        case WBCHECK_PHASE_FULL_GC:
+            wbcheck_mark_gray(objspace, obj);
+            break;
+        case WBCHECK_PHASE_MUTATOR:
+            rb_bug("wbcheck: rb_gc_impl_mark_maybe called during mutator phase");
+            break;
+    }
+}
+
+// Weak references
+void
+rb_gc_impl_declare_weak_references(void *objspace_ptr, VALUE obj)
+{
+    FL_SET_RAW(obj, RUBY_FL_WEAK_REFERENCE);
+}
+
+bool
+rb_gc_impl_handle_weak_references_alive_p(void *objspace_ptr, VALUE obj)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+
+    st_data_t value;
+    if (st_lookup(objspace->object_table, (st_data_t)obj, &value)) {
+        rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)value;
+        return info->color != WBCHECK_COLOR_WHITE;
+    }
+
+    return false;
+}
+
+// Compaction
+void
+rb_gc_impl_register_pinning_obj(void *objspace_ptr, VALUE obj)
+{
+    /* no-op */
+}
+
+bool
+rb_gc_impl_object_moved_p(void *objspace_ptr, VALUE obj)
+{
+    // Stub implementation
+    return false;
+}
+
+VALUE
+rb_gc_impl_location(void *objspace_ptr, VALUE value)
+{
+    // Stub implementation
+    return Qnil;
+}
+
+// Write barriers
+void
+rb_gc_impl_writebarrier(void *objspace_ptr, VALUE a, VALUE b)
+{
+    if (RB_SPECIAL_CONST_P(b)) return;
+
+    unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
+
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+
+    // Get the object info for the parent object (a)
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(a);
+
+    // Only record the write barrier if we have a valid snapshot
+    if (info->state != WBCHECK_STATE_CLEAR) {
+        RUBY_ASSERT(info->gc_mark_snapshot);
+
+        // Initialize writebarrier_children list if it doesn't exist
+        if (!info->writebarrier_children) {
+            info->writebarrier_children = wbcheck_object_list_init();
+        }
+
+        // Add the new reference to the write barrier children list
+        wbcheck_object_list_append(info->writebarrier_children, b);
+
+        WBCHECK_DEBUG("wbcheck: write barrier recorded reference from %p to %p\n", (void *)a, (void *)b);
+
+        // If verification after write barrier is enabled, queue the object for verification
+        if (wbcheck_verify_after_wb_enabled && info->state != WBCHECK_STATE_DIRTY) {
+            WBCHECK_DEBUG("wbcheck: queueing object for verification after write barrier\n");
+            info->state = WBCHECK_STATE_DIRTY;  // Mark as dirty
+            wbcheck_object_list_append(objspace->objects_to_verify, a);
+        }
+    } else {
+        WBCHECK_DEBUG("wbcheck: write barrier skipped (snapshot not initialized) from %p to %p\n", (void *)a, (void *)b);
+    }
+
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+}
+
+void
+rb_gc_impl_writebarrier_unprotect(void *objspace_ptr, VALUE obj)
+{
+    WBCHECK_DEBUG("wbcheck: writebarrier_unprotect called on object %p\n", (void *)obj);
+
+    unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
+
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+    info->wb_protected = false;
+
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+}
+
+void
+rb_gc_impl_writebarrier_remember(void *objspace_ptr, VALUE obj)
+{
+    WBCHECK_DEBUG("wbcheck: writebarrier_remember called on object %p\n", (void *)obj);
+
+    unsigned int lev = RB_GC_VM_LOCK_NO_BARRIER();
+
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+
+    // Clear existing references since they may be stale
+    if (info->state != WBCHECK_STATE_CLEAR) {
+        RUBY_ASSERT(info->gc_mark_snapshot);
+        wbcheck_object_list_free(info->gc_mark_snapshot);
+        info->gc_mark_snapshot = NULL;
+
+        wbcheck_object_list_free(info->mark_maybe_snapshot);
+        info->mark_maybe_snapshot = NULL;
+
+        // Only re-add to objects_to_capture if it had previous snapshot
+        // (new objects don't need to be re-added since they'll be captured at allocation)
+        wbcheck_object_list_append(objspace->objects_to_capture, obj);
+
+        // Also clear write barrier children
+        if (info->writebarrier_children) {
+            wbcheck_object_list_free(info->writebarrier_children);
+            info->writebarrier_children = NULL;
+        }
+
+        // Reset to clear state
+        info->state = WBCHECK_STATE_CLEAR;
+    }
+    RUBY_ASSERT(!info->gc_mark_snapshot);
+    RUBY_ASSERT(!info->mark_maybe_snapshot);
+    RUBY_ASSERT(!info->writebarrier_children);
+
+    RB_GC_VM_UNLOCK_NO_BARRIER(lev);
+}
+
+// Heap walking
+struct wbcheck_foreach_data {
+    int (*callback)(VALUE obj, rb_wbcheck_object_info_t *info, void *data);
+    void *data;
+};
+
+static int
+wbcheck_foreach_object_i(st_data_t key, st_data_t val, st_data_t arg)
+{
+    VALUE obj = (VALUE)key;
+    rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)val;
+    struct wbcheck_foreach_data *foreach_data = (struct wbcheck_foreach_data *)arg;
+
+    return foreach_data->callback(obj, info, foreach_data->data);
+}
+
+static void
+wbcheck_foreach_object(rb_wbcheck_objspace_t *objspace, int (*callback)(VALUE obj, rb_wbcheck_object_info_t *info, void *data), void *data)
+{
+    struct wbcheck_foreach_data foreach_data = {
+        .callback = callback,
+        .data = data
+    };
+
+    st_foreach(objspace->object_table, wbcheck_foreach_object_i, (st_data_t)&foreach_data);
+}
+
+// Helper to collect all objects into a snapshot list
+static int
+wbcheck_snapshot_collector(st_data_t key, st_data_t val, st_data_t arg)
+{
+    VALUE obj = (VALUE)key;
+    wbcheck_object_list_t *snapshot = (wbcheck_object_list_t *)arg;
+    wbcheck_object_list_append(snapshot, obj);
+    return ST_CONTINUE;
+}
+
+// Take a snapshot of all objects for safe iteration
+static wbcheck_object_list_t *
+wbcheck_take_object_snapshot(rb_wbcheck_objspace_t *objspace)
+{
+    size_t object_count = st_table_size(objspace->object_table);
+    wbcheck_object_list_t *snapshot = wbcheck_object_list_init_with_capacity(object_count);
+    st_foreach(objspace->object_table, wbcheck_snapshot_collector, (st_data_t)snapshot);
+    return snapshot;
+}
+
+
+void
+rb_gc_impl_each_objects(void *objspace_ptr, int (*callback)(void *, void *, size_t, void *), void *data)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    GC_ASSERT(objspace);
+
+    wbcheck_object_list_t *snapshot = wbcheck_take_object_snapshot(objspace);
+
+    for (size_t i = 0; i < snapshot->count; i++) {
+        VALUE obj = snapshot->items[i];
+        st_data_t value;
+        if (st_lookup(objspace->object_table, (st_data_t)obj, &value)) {
+            rb_wbcheck_object_info_t *info = (rb_wbcheck_object_info_t *)value;
+            int result = callback(
+                (void *)obj,
+                (void *)((char *)obj + info->alloc_size),
+                info->alloc_size,
+                data
+            );
+            if (result != 0) break;
+        }
+    }
+
+    wbcheck_object_list_free(snapshot);
+}
+
+void
+rb_gc_impl_each_object(void *objspace_ptr, void (*func)(VALUE obj, void *data), void *data)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    GC_ASSERT(objspace);
+
+    wbcheck_object_list_t *snapshot = wbcheck_take_object_snapshot(objspace);
+
+    for (size_t i = 0; i < snapshot->count; i++) {
+        VALUE obj = snapshot->items[i];
+        st_data_t value;
+        if (st_lookup(objspace->object_table, (st_data_t)obj, &value)) {
+            func(obj, data);
+        }
+    }
+
+    wbcheck_object_list_free(snapshot);
+}
+
+static void
+finalizer_jobs_push(rb_wbcheck_objspace_t *objspace, struct wbcheck_final_job *job)
+{
+    rb_native_mutex_lock(&objspace->finalizer_lock);
+    job->next = objspace->finalizer_jobs;
+    objspace->finalizer_jobs = job;
+    rb_native_mutex_unlock(&objspace->finalizer_lock);
+}
+
+static struct wbcheck_final_job *
+finalizer_jobs_pop(rb_wbcheck_objspace_t *objspace)
+{
+    rb_native_mutex_lock(&objspace->finalizer_lock);
+    struct wbcheck_final_job *job = objspace->finalizer_jobs;
+    if (job) {
+        objspace->finalizer_jobs = job->next;
+    }
+    rb_native_mutex_unlock(&objspace->finalizer_lock);
+    return job;
+}
+
+// Finalizers
+void
+rb_gc_impl_make_zombie(void *objspace_ptr, VALUE obj, void (*dfree)(void *), void *data)
+{
+    if (dfree == NULL) return;
+
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+
+    struct wbcheck_final_job *job = malloc(sizeof(struct wbcheck_final_job));
+    job->kind = WBCHECK_FINAL_JOB_DFREE;
+    job->as.dfree.func = dfree;
+    job->as.dfree.data = data;
+
+    finalizer_jobs_push(objspace, job);
+
+    if (!ruby_free_at_exit_p()) {
+        rb_postponed_job_trigger(objspace->finalizer_postponed_job);
+    }
+
+    WBCHECK_DEBUG("wbcheck: made zombie for object %p with dfree function\n", (void *)obj);
+}
+
+VALUE
+rb_gc_impl_define_finalizer(void *objspace_ptr, VALUE obj, VALUE block)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    (void)objspace_ptr;
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+
+    GC_ASSERT(!OBJ_FROZEN(obj));
+
+    RBASIC(obj)->flags |= FL_FINALIZE;
+
+    VALUE table = info->finalizers;
+    VALUE result = block;
+
+    if (!table) {
+        /* First finalizer for this object - store object ID as first element */
+        table = rb_ary_new3(2, rb_obj_id(obj), block);
+        rb_obj_hide(table);
+        info->finalizers = table;
+    } else {
+        /* Check for duplicate finalizers (skip index 0 which is object ID) */
+        long len = RARRAY_LEN(table);
+        long i;
+
+        for (i = 1; i < len; i++) {
+            VALUE recv = RARRAY_AREF(table, i);
+            if (rb_equal(recv, block)) {
+                result = recv;  /* Duplicate found, return existing */
+                goto unlock_and_return;
+            }
+        }
+
+        rb_ary_push(table, block);
+    }
+
+unlock_and_return:
+    RB_GC_VM_UNLOCK(lev);
+    return result;
+}
+
+void
+rb_gc_impl_undefine_finalizer(void *objspace_ptr, VALUE obj)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    (void)objspace_ptr;
+    rb_wbcheck_object_info_t *info = wbcheck_get_object_info(obj);
+
+    GC_ASSERT(!OBJ_FROZEN(obj));
+
+    info->finalizers = 0;
+    FL_UNSET(obj, FL_FINALIZE);
+
+    RB_GC_VM_UNLOCK(lev);
+}
+
+void
+rb_gc_impl_copy_finalizer(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    (void)objspace_ptr;
+
+    if (!FL_TEST(obj, FL_FINALIZE)) return;
+
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    rb_wbcheck_object_info_t *src_info = wbcheck_get_object_info(obj);
+    rb_wbcheck_object_info_t *dest_info = wbcheck_get_object_info(dest);
+
+    if (src_info->finalizers) {
+        VALUE table = rb_ary_dup(src_info->finalizers);
+        RARRAY_ASET(table, 0, rb_obj_id(dest));
+        rb_obj_hide(table);
+        dest_info->finalizers = table;
+        FL_SET(dest, FL_FINALIZE);
+    }
+
+    RB_GC_VM_UNLOCK(lev);
+}
+
+static VALUE
+wbcheck_get_final(long i, void *data)
+{
+    VALUE table = (VALUE)data;
+
+    return RARRAY_AREF(table, i + 1);
+}
+
+static void
+make_final_job(rb_wbcheck_objspace_t *objspace, VALUE obj, VALUE finalizer_array)
+{
+    RUBY_ASSERT(RB_FL_TEST(obj, FL_FINALIZE));
+    RUBY_ASSERT(RB_BUILTIN_TYPE(finalizer_array) == T_ARRAY);
+
+    RB_FL_UNSET(obj, FL_FINALIZE);
+
+    struct wbcheck_final_job *job = malloc(sizeof(struct wbcheck_final_job));
+    job->kind = WBCHECK_FINAL_JOB_FINALIZE;
+    job->as.finalize.finalizer_array = finalizer_array;
+
+    finalizer_jobs_push(objspace, job);
+}
+
+static void
+gc_run_finalizers(void *data)
+{
+    rb_wbcheck_objspace_t *objspace = data;
+
+    rb_gc_set_pending_interrupt();
+
+    struct wbcheck_final_job *job;
+    while ((job = finalizer_jobs_pop(objspace)) != NULL) {
+        switch (job->kind) {
+          case WBCHECK_FINAL_JOB_DFREE:
+            job->as.dfree.func(job->as.dfree.data);
+            break;
+          case WBCHECK_FINAL_JOB_FINALIZE: {
+            VALUE finalizer_array = job->as.finalize.finalizer_array;
+
+            rb_gc_run_obj_finalizer(
+                RARRAY_AREF(finalizer_array, 0),
+                RARRAY_LEN(finalizer_array) - 1,
+                wbcheck_get_final,
+                (void *)finalizer_array
+            );
+
+            RB_GC_GUARD(finalizer_array);
+            break;
+          }
+        }
+
+        free(job);
+    }
+
+    rb_gc_unset_pending_interrupt();
+}
+
+static void
+wbcheck_run_finalizers_for_object(VALUE obj, rb_wbcheck_object_info_t *info)
+{
+    if (info->finalizers) {
+        VALUE table = info->finalizers;
+        long count = RARRAY_LEN(table) - 1;
+        rb_gc_run_obj_finalizer(RARRAY_AREF(table, 0), count, wbcheck_get_final, (void *)table);
+        FL_UNSET(obj, FL_FINALIZE);
+    }
+    info->finalizers = 0;
+}
+
+static int
+wbcheck_shutdown_call_finalizer_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data)
+{
+    wbcheck_run_finalizers_for_object(obj, info);
+    return ST_CONTINUE;  /* Keep iterating through all objects */
+}
+
+static int
+wbcheck_verify_all_references_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data)
+{
+    void *objspace_ptr = data;
+    wbcheck_verify_object_references(objspace_ptr, obj);
+    return ST_CONTINUE;
+}
+
+static int
+wbcheck_update_all_snapshots_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data)
+{
+    void *objspace_ptr = data;
+
+    // For wb_protected objects, do full verification if they have a snapshot
+    if (info->wb_protected && info->state != WBCHECK_STATE_CLEAR) {
+        wbcheck_verify_object_references(objspace_ptr, obj);
+    } else {
+        // For CLEAR objects (wb_protected or not) and non-wb_protected objects, just take a new snapshot
+        wbcheck_object_list_t *current_refs = wbcheck_collect_references_from_object(obj, info);
+        wbcheck_object_list_free(info->gc_mark_snapshot);
+        info->gc_mark_snapshot = current_refs;
+        info->state = WBCHECK_STATE_MARKED;
+    }
+
+    return ST_CONTINUE;
+}
+
+static int
+wbcheck_shutdown_finalizer_callback(VALUE obj, rb_wbcheck_object_info_t *info, void *data)
+{
+    void *objspace_ptr = data;
+
+    if (rb_gc_shutdown_call_finalizer_p(obj)) {
+        WBCHECK_DEBUG("wbcheck: finalizing object during shutdown: %p\n", (void *)obj);
+        rb_gc_obj_free_vm_weak_references(obj);
+        if (rb_gc_obj_free(objspace_ptr, obj)) {
+            RBASIC(obj)->flags = 0;
+        }
+    }
+
+    return ST_CONTINUE;
+}
+
+
+void
+rb_gc_impl_shutdown_call_finalizer(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = objspace_ptr;
+
+    // Call all finalizers for all objects using our shared iteration helper
+    wbcheck_foreach_object(objspace, wbcheck_shutdown_call_finalizer_callback, NULL);
+
+    // After all finalizers have been called, verify all object references
+    unsigned int verify_lev = RB_GC_VM_LOCK();
+    WBCHECK_DEBUG("wbcheck: verifying references for all objects after finalizers\n");
+    wbcheck_foreach_object(objspace, wbcheck_verify_all_references_callback, objspace_ptr);
+    WBCHECK_DEBUG("wbcheck: finished verifying all object references\n");
+    RB_GC_VM_UNLOCK(verify_lev);
+
+    // Print summary and exit with error code if violations were found
+    if (objspace->missed_write_barrier_parents > 0 || objspace->missed_write_barrier_children > 0) {
+        fprintf(stderr, "WBCHECK SUMMARY: Found %zu objects with missed write barriers (%zu total violations)\n",
+                objspace->missed_write_barrier_parents, objspace->missed_write_barrier_children);
+
+
+        exit(1);  // Exit with error code to indicate violations were found
+    } else {
+        WBCHECK_DEBUG("wbcheck: no write barrier violations detected\n");
+    }
+
+    // Call rb_gc_obj_free on objects that need shutdown finalization (File, Data with dfree, etc.)
+    unsigned int lev = RB_GC_VM_LOCK();
+    WBCHECK_DEBUG("wbcheck: calling rb_gc_obj_free on objects that need shutdown finalization\n");
+    wbcheck_foreach_object(objspace, wbcheck_shutdown_finalizer_callback, objspace_ptr);
+    WBCHECK_DEBUG("wbcheck: finished calling rb_gc_obj_free\n");
+
+    // Run any pending finalizer jobs (dfree functions)
+    WBCHECK_DEBUG("wbcheck: running pending finalizer jobs\n");
+    gc_run_finalizers(objspace);
+    WBCHECK_DEBUG("wbcheck: finished running finalizer jobs\n");
+    RB_GC_VM_UNLOCK(lev);
+}
+
+// Forking
+void
+rb_gc_impl_before_fork(void *objspace_ptr)
+{
+    // Stub implementation
+}
+
+void
+rb_gc_impl_after_fork(void *objspace_ptr, rb_pid_t pid)
+{
+    // Stub implementation
+}
+
+// Statistics
+void
+rb_gc_impl_set_measure_total_time(void *objspace_ptr, VALUE flag)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    objspace->measure_total_time = RTEST(flag);
+}
+
+bool
+rb_gc_impl_get_measure_total_time(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    return objspace->measure_total_time;
+}
+
+unsigned long long
+rb_gc_impl_get_total_time(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    return objspace->measure_total_time ? objspace->simulated_gc_count : 0;
+}
+
+size_t
+rb_gc_impl_gc_count(void *objspace_ptr)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    if (objspace) {
+        return objspace->simulated_gc_count;
+    }
+    return 0;
+}
+
+VALUE
+rb_gc_impl_latest_gc_info(void *objspace_ptr, VALUE key)
+{
+    // Stub implementation
+    return Qnil;
+}
+
+VALUE
+rb_gc_impl_stat(void *objspace_ptr, VALUE hash_or_sym)
+{
+    rb_wbcheck_objspace_t *objspace = (rb_wbcheck_objspace_t *)objspace_ptr;
+    GC_ASSERT(objspace);
+
+    VALUE hash = Qnil, key = Qnil;
+
+    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+        hash = hash_or_sym;
+    }
+    else if (SYMBOL_P(hash_or_sym)) {
+        key = hash_or_sym;
+    }
+    else {
+        rb_bug("non-hash or symbol given");
+    }
+
+#define SET(name, attr) \
+    if (key == ID2SYM(rb_intern(#name))) \
+        return SIZET2NUM(attr); \
+    else if (hash != Qnil) \
+        rb_hash_aset(hash, ID2SYM(rb_intern(#name)), SIZET2NUM(attr));
+
+    /* Pretend each GC takes 1ms; :time is reported in milliseconds. */
+    SET(count, objspace->simulated_gc_count);
+    SET(time, objspace->measure_total_time ? objspace->simulated_gc_count : 0);
+    SET(tracked_objects, st_table_size(objspace->object_table));
+#undef SET
+
+    if (!NIL_P(key)) {
+        rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(key));
+    }
+
+    rb_hash_aset(hash, ID2SYM(rb_intern("gc_implementation")), rb_str_new_cstr("wbcheck"));
+
+    return hash;
+}
+
+VALUE
+rb_gc_impl_stat_heap(void *objspace_ptr, VALUE heap_name, VALUE hash_or_sym)
+{
+    if (FIXNUM_P(heap_name) && SYMBOL_P(hash_or_sym)) {
+        int heap_idx = FIX2INT(heap_name);
+        if (heap_idx < 0 || heap_idx >= HEAP_COUNT) {
+            rb_raise(rb_eArgError, "size pool index out of range");
+        }
+
+        if (hash_or_sym == ID2SYM(rb_intern("slot_size"))) {
+            return SIZET2NUM(heap_sizes[heap_idx]);
+        }
+
+        return Qundef;
+    }
+
+    if (RB_TYPE_P(hash_or_sym, T_HASH)) {
+        return hash_or_sym;
+    }
+
+    return Qundef;
+}
+
+const char *
+rb_gc_impl_active_gc_name(void)
+{
+    // Stub implementation
+    return "wbcheck";
+}
+
+// Miscellaneous
+#define WBCHECK_OBJECT_METADATA_ENTRY_COUNT 2
+static struct rb_gc_object_metadata_entry object_metadata_entries[WBCHECK_OBJECT_METADATA_ENTRY_COUNT + 1];
+
+struct rb_gc_object_metadata_entry *
+rb_gc_impl_object_metadata(void *objspace_ptr, VALUE obj)
+{
+    static ID ID_object_id, ID_shareable;
+
+    if (!ID_object_id) {
+        ID_object_id = rb_intern("object_id");
+        ID_shareable = rb_intern("shareable");
+    }
+
+    size_t n = 0;
+
+#define SET_ENTRY(na, v) do { \
+    GC_ASSERT(n < WBCHECK_OBJECT_METADATA_ENTRY_COUNT); \
+    object_metadata_entries[n].name = ID_##na; \
+    object_metadata_entries[n].val = v; \
+    n++; \
+} while (0)
+
+    if (rb_obj_id_p(obj)) SET_ENTRY(object_id, rb_obj_id(obj));
+    if (FL_TEST(obj, FL_SHAREABLE)) SET_ENTRY(shareable, Qtrue);
+#undef SET_ENTRY
+
+    object_metadata_entries[n].name = 0;
+    object_metadata_entries[n].val = 0;
+
+    return object_metadata_entries;
+}
+
+bool
+rb_gc_impl_pointer_to_heap_p(void *objspace_ptr, const void *ptr)
+{
+    GC_ASSERT(wbcheck_global_objspace);
+
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    // Check if this pointer exists in our object tracking table
+    st_data_t value;
+    bool result = st_lookup(wbcheck_global_objspace->object_table, (st_data_t)ptr, &value);
+
+    RB_GC_VM_UNLOCK(lev);
+    return result;
+}
+
+bool
+rb_gc_impl_garbage_object_p(void *objspace_ptr, VALUE obj)
+{
+    unsigned int lev = RB_GC_VM_LOCK();
+
+    // Check if this pointer exists in our object tracking table
+    st_data_t value;
+    bool result = st_lookup(wbcheck_global_objspace->object_table, (st_data_t)obj, &value);
+
+    RB_GC_VM_UNLOCK(lev);
+    return !result;
+}
+
+void
+rb_gc_impl_set_event_hook(void *objspace_ptr, const rb_event_flag_t event)
+{
+    // Stub implementation
+}
+
+void
+rb_gc_impl_copy_attributes(void *objspace_ptr, VALUE dest, VALUE obj)
+{
+    rb_wbcheck_object_info_t *src_info = wbcheck_get_object_info(obj);
+
+    if (!src_info->wb_protected) {
+        rb_gc_impl_writebarrier_unprotect(objspace_ptr, dest);
+    }
+    rb_gc_impl_copy_finalizer(objspace_ptr, dest, obj);
+}
+
diff --git a/gem_prelude.rb b/gem_prelude.rb
index bcd2560fab..1b78d80c72 100644
--- a/gem_prelude.rb
+++ b/gem_prelude.rb
@@ -25,4 +25,3 @@ begin
 rescue LoadError
   warn "`syntax_suggest' was not loaded."
 end if defined?(SyntaxSuggest)
-
diff --git a/gems/bundled_gems b/gems/bundled_gems
index 43a3b72d69..14f79ce9ae 100644
--- a/gems/bundled_gems
+++ b/gems/bundled_gems
@@ -6,31 +6,42 @@
 # - revision: revision in repository-url to test
 #   if `revision` is not given, "v"+`version` or `version` will be used.
 
-minitest        5.23.1  https://github.com/minitest/minitest
-power_assert    2.0.3   https://github.com/ruby/power_assert 84e85124c5014a139af39161d484156cfe87a9ed
-rake            13.2.1  https://github.com/ruby/rake
-test-unit       3.6.2   https://github.com/test-unit/test-unit
-rexml           3.2.8   https://github.com/ruby/rexml
-rss             0.3.0   https://github.com/ruby/rss
-net-ftp         0.3.5   https://github.com/ruby/net-ftp
-net-imap        0.4.12  https://github.com/ruby/net-imap
-net-pop         0.1.2   https://github.com/ruby/net-pop
-net-smtp        0.5.0   https://github.com/ruby/net-smtp
-matrix          0.4.2   https://github.com/ruby/matrix
-prime           0.1.2   https://github.com/ruby/prime
-rbs             3.4.4   https://github.com/ruby/rbs ba7872795d5de04adb8ff500c0e6afdc81a041dd
-typeprof        0.21.11 https://github.com/ruby/typeprof b19a6416da3a05d57fadd6ffdadb382b6d236ca5
-debug           1.9.2   https://github.com/ruby/debug
-racc            1.8.0   https://github.com/ruby/racc
-mutex_m         0.2.0   https://github.com/ruby/mutex_m
-getoptlong      0.2.1   https://github.com/ruby/getoptlong
-base64          0.2.0   https://github.com/ruby/base64
-bigdecimal      3.1.8   https://github.com/ruby/bigdecimal
-observer        0.1.2   https://github.com/ruby/observer
-abbrev          0.1.2   https://github.com/ruby/abbrev
-resolv-replace  0.1.1   https://github.com/ruby/resolv-replace
-rinda           0.2.0   https://github.com/ruby/rinda
-drb             2.2.1   https://github.com/ruby/drb
-nkf             0.2.0   https://github.com/ruby/nkf
-syslog          0.1.2   https://github.com/ruby/syslog
-csv             3.3.0   https://github.com/ruby/csv
+minitest            6.0.6  https://github.com/minitest/minitest
+power_assert        3.0.1   https://github.com/ruby/power_assert
+rake                13.4.2  https://github.com/ruby/rake
+test-unit           3.7.8   https://github.com/test-unit/test-unit
+rexml               3.4.4   https://github.com/ruby/rexml
+rss                 0.3.2   https://github.com/ruby/rss
+net-imap            0.6.4   https://github.com/ruby/net-imap
+net-smtp            0.5.1   https://github.com/ruby/net-smtp
+matrix              0.4.3   https://github.com/ruby/matrix
+prime               0.1.4   https://github.com/ruby/prime
+rbs                 4.0.2   https://github.com/ruby/rbs 1582ce76429810b057a2816e5000cf5de4b1363d
+typeprof            0.32.0  https://github.com/ruby/typeprof
+debug               1.11.1  https://github.com/ruby/debug 9dc2024a5a05116b3d38afbc5579d9503d8913f3
+racc                1.8.1   https://github.com/ruby/racc
+mutex_m             0.3.0   https://github.com/ruby/mutex_m
+getoptlong          0.2.1   https://github.com/ruby/getoptlong
+base64              0.3.0   https://github.com/ruby/base64
+bigdecimal          4.1.2   https://github.com/ruby/bigdecimal
+observer            0.1.2   https://github.com/ruby/observer
+abbrev              0.1.2   https://github.com/ruby/abbrev
+resolv-replace      0.2.0   https://github.com/ruby/resolv-replace
+rinda               0.2.0   https://github.com/ruby/rinda
+drb                 2.2.3   https://github.com/ruby/drb
+nkf                 0.2.0   https://github.com/ruby/nkf
+syslog              0.4.0   https://github.com/ruby/syslog
+csv                 3.3.5   https://github.com/ruby/csv
+repl_type_completor 0.1.15  https://github.com/ruby/repl_type_completor
+ostruct             0.6.3   https://github.com/ruby/ostruct
+pstore              0.2.1   https://github.com/ruby/pstore
+benchmark           0.5.0   https://github.com/ruby/benchmark
+logger              1.7.0   https://github.com/ruby/logger
+rdoc                7.2.0   https://github.com/ruby/rdoc 1f93543615928b6d45357432f16ec6006e2d8b1e
+win32ole            1.9.3   https://github.com/ruby/win32ole
+irb                 1.18.0  https://github.com/ruby/irb
+reline              0.6.3   https://github.com/ruby/reline
+readline            0.0.4   https://github.com/ruby/readline
+fiddle              1.1.8   https://github.com/ruby/fiddle
+tsort               0.2.0   https://github.com/ruby/tsort
+win32-registry      0.1.2   https://github.com/ruby/win32-registry
diff --git a/gems/lib/rake/extensiontask.rb b/gems/lib/rake/extensiontask.rb
index fdbe8d8874..0ab0cb7b50 100644
--- a/gems/lib/rake/extensiontask.rb
+++ b/gems/lib/rake/extensiontask.rb
@@ -8,5 +8,7 @@ module Rake
         puts "#{args.name} => #{args.prereqs.join(' ')}"
       end
     end
+
+    def lib_dir; end
   end
 end
diff --git a/goruby.c b/goruby.c
index 5d45277207..3ca96bfda0 100644
--- a/goruby.c
+++ b/goruby.c
@@ -1,4 +1,4 @@
-static void Init_golf(void);
+static void Init_golf_prelude(void);
 static void *goruby_options(int argc, char **argv);
 static int goruby_run_node(void *arg);
 #define ruby_options goruby_options
@@ -17,14 +17,13 @@ static int goruby_run_node(void *arg);
 
 RUBY_EXTERN void *ruby_options(int argc, char **argv);
 RUBY_EXTERN int ruby_run_node(void*);
-RUBY_EXTERN void ruby_init_ext(const char *name, void (*init)(void));
 
-#include "golf_prelude.c"
+#include "golf_prelude.rbbin"
 
 static VALUE
 init_golf(VALUE arg)
 {
-    Init_golf();
+    Init_golf_prelude();
     rb_provide("golf.so");
     return arg;
 }
@@ -61,7 +60,8 @@ int
 goruby_run_node(void *arg)
 {
     int state;
-    if (NIL_P(rb_protect(init_golf, Qtrue, &state))) {
+    if (ruby_executable_node(arg, NULL) &&
+        NIL_P(rb_protect(init_golf, Qtrue, &state))) {
         return state == EXIT_SUCCESS ? EXIT_FAILURE : state;
     }
     return ruby_run_node(arg);
diff --git a/hash.c b/hash.c
index f34f64065b..9ba8c3d4fe 100644
--- a/hash.c
+++ b/hash.c
@@ -48,6 +48,7 @@
 #include "ruby/thread_native.h"
 #include "ruby/ractor.h"
 #include "vm_sync.h"
+#include "builtin.h"
 
 /* Flags of RHash
  *
@@ -63,17 +64,13 @@
  *            The bounds of the AR table.
  * 13-19: RHASH_LEV_MASK
  *            The iterational level of the hash. Used to prevent modifications
- *            to the hash during interation.
+ *            to the hash during iteration.
  */
 
 #ifndef HASH_DEBUG
 #define HASH_DEBUG 0
 #endif
 
-#if HASH_DEBUG
-#include "internal/gc.h"
-#endif
-
 #define SET_DEFAULT(hash, ifnone) ( \
     FL_UNSET_RAW(hash, RHASH_PROC_DEFAULT), \
     RHASH_SET_IFNONE(hash, ifnone))
@@ -102,6 +99,7 @@ static VALUE rb_hash_s_try_convert(VALUE, VALUE);
  *  2. Insert WBs
  */
 
+/* :nodoc: */
 VALUE
 rb_hash_freeze(VALUE hash)
 {
@@ -109,6 +107,7 @@ rb_hash_freeze(VALUE hash)
 }
 
 VALUE rb_cHash;
+VALUE rb_cHash_empty_frozen;
 
 static VALUE envtbl;
 static ID id_hash, id_flatten_bang;
@@ -181,7 +180,7 @@ any_hash(VALUE a, st_index_t (*other_func)(VALUE))
             hnum = rb_hash_start(hnum);
         }
         else {
-            hnum = RSYMBOL(a)->hashval;
+            hnum = RSHIFT(RSYMBOL(a)->hashval, 1);
         }
         break;
       case T_FIXNUM:
@@ -322,40 +321,35 @@ objid_hash(VALUE obj)
 #endif
 }
 
-/**
+/*
  * call-seq:
- *    obj.hash    -> integer
- *
- * Generates an Integer hash value for this object.  This function must have the
- * property that <code>a.eql?(b)</code> implies <code>a.hash == b.hash</code>.
+ *   hash -> integer
  *
- * The hash value is used along with #eql? by the Hash class to determine if
- * two objects reference the same hash key.  Any hash value that exceeds the
- * capacity of an Integer will be truncated before being used.
+ * Returns the integer hash value for +self+;
+ * has the property that if <tt>foo.eql?(bar)</tt>
+ * then <tt>foo.hash == bar.hash</tt>.
  *
- * The hash value for an object may not be identical across invocations or
- * implementations of Ruby.  If you need a stable identifier across Ruby
- * invocations and implementations you will need to generate one with a custom
- * method.
+ * \Class Hash uses both #hash and #eql? to determine whether two objects
+ * used as hash keys are to be treated as the same key.
+ * A hash value that exceeds the capacity of an Integer is truncated before being used.
  *
- * Certain core classes such as Integer use built-in hash calculations and
- * do not call the #hash method when used as a hash key.
+ * Many core classes override method Object#hash;
+ * other core classes (e.g., Integer) calculate the hash internally,
+ * and do not call the #hash method when used as a hash key.
  *
- * When implementing your own #hash based on multiple values, the best
- * practice is to combine the class and any values using the hash code of an
- * array:
- *
- * For example:
+ * When implementing #hash for a user-defined class,
+ * best practice is to use Array#hash with the class name and the values
+ * that are important in the instance;
+ * this takes advantage of that method's logic for safely and efficiently
+ * generating a hash value:
  *
  *   def hash
  *     [self.class, a, b, c].hash
  *   end
  *
- * The reason for this is that the Array#hash method already has logic for
- * safely and efficiently combining multiple hash values.
- *--
- * \private
- *++
+ * The hash value may differ among invocations or implementations of Ruby.
+ * If you need stable hash-like identifiers across Ruby invocations and implementations,
+ * use a custom method to generate them.
  */
 VALUE
 rb_obj_hash(VALUE obj)
@@ -477,58 +471,11 @@ ar_set_entry(VALUE hash, unsigned int index, st_data_t key, st_data_t val, st_ha
 #define RHASH_AR_TABLE_SIZE(h) (HASH_ASSERT(RHASH_AR_TABLE_P(h)), \
                                 RHASH_AR_TABLE_SIZE_RAW(h))
 
-#define RHASH_AR_TABLE_BOUND_RAW(h) \
-  ((unsigned int)((RBASIC(h)->flags >> RHASH_AR_TABLE_BOUND_SHIFT) & \
-                  (RHASH_AR_TABLE_BOUND_MASK >> RHASH_AR_TABLE_BOUND_SHIFT)))
-
-#define RHASH_ST_TABLE_SET(h, s)  rb_hash_st_table_set(h, s)
-#define RHASH_TYPE(hash) (RHASH_AR_TABLE_P(hash) ? &objhash : RHASH_ST_TABLE(hash)->type)
-
 #define HASH_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(HASH_DEBUG, expr, #expr)
 
-static inline unsigned int
-RHASH_AR_TABLE_BOUND(VALUE h)
-{
-    HASH_ASSERT(RHASH_AR_TABLE_P(h));
-    const unsigned int bound = RHASH_AR_TABLE_BOUND_RAW(h);
-    HASH_ASSERT(bound <= RHASH_AR_TABLE_MAX_SIZE);
-    return bound;
-}
-
 #if HASH_DEBUG
 #define hash_verify(hash) hash_verify_(hash, __FILE__, __LINE__)
 
-void
-rb_hash_dump(VALUE hash)
-{
-    rb_obj_info_dump(hash);
-
-    if (RHASH_AR_TABLE_P(hash)) {
-        unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
-
-        fprintf(stderr, "  size:%u bound:%u\n",
-                RHASH_AR_TABLE_SIZE(hash), bound);
-
-        for (i=0; i<bound; i++) {
-            st_data_t k, v;
-
-            if (!ar_cleared_entry(hash, i)) {
-                char b1[0x100], b2[0x100];
-                ar_table_pair *pair = RHASH_AR_TABLE_REF(hash, i);
-                k = pair->key;
-                v = pair->val;
-                fprintf(stderr, "  %d key:%s val:%s hint:%02x\n", i,
-                        rb_raw_obj_info(b1, 0x100, k),
-                        rb_raw_obj_info(b2, 0x100, v),
-                        ar_hint(hash, i));
-            }
-            else {
-                fprintf(stderr, "  %d empty\n", i);
-            }
-        }
-    }
-}
-
 static VALUE
 hash_verify_(VALUE hash, const char *file, int line)
 {
@@ -581,7 +528,7 @@ hash_st_table_init(VALUE hash, const struct st_hash_type *type, st_index_t size)
     RHASH_SET_ST_FLAG(hash);
 }
 
-void
+static void
 rb_hash_st_table_set(VALUE hash, st_table *st)
 {
     HASH_ASSERT(st != NULL);
@@ -641,6 +588,7 @@ RHASH_AR_TABLE_SIZE_DEC(VALUE h)
 static inline void
 RHASH_AR_TABLE_CLEAR(VALUE h)
 {
+    RUBY_ASSERT(rb_gc_obj_slot_size(h) >= sizeof(struct RHash) + sizeof(ar_table));
     RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
     RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
 
@@ -756,6 +704,8 @@ ar_force_convert_table(VALUE hash, const char *file, int line)
         st_hash_t hashes[RHASH_AR_TABLE_MAX_SIZE];
         unsigned int bound, size;
 
+        RUBY_ASSERT(rb_gc_obj_slot_size(hash) >= sizeof(struct RHash) + sizeof(ar_table));
+
         // prepare hash values
         do {
             st_data_t keys[RHASH_AR_TABLE_MAX_SIZE];
@@ -780,7 +730,7 @@ ar_force_convert_table(VALUE hash, const char *file, int line)
         st_init_existing_table_with_size(new_tab, &objhash, size);
         ar_each_key(ar, bound, ar_each_key_insert, NULL, new_tab, hashes);
         hash_ar_free_and_clear_table(hash);
-        RHASH_ST_TABLE_SET(hash, new_tab);
+        rb_hash_st_table_set(hash, new_tab);
         return RHASH_ST_TABLE(hash);
     }
 }
@@ -877,10 +827,11 @@ ar_general_foreach(VALUE hash, st_foreach_check_callback_func *func, st_update_c
                 return 0;
               case ST_REPLACE:
                 if (replace) {
-                    retval = (*replace)(&key, &val, arg, TRUE);
+                    (*replace)(&key, &val, arg, TRUE);
+
+                    // Pair should not have moved
+                    HASH_ASSERT(pair == RHASH_AR_TABLE_REF(hash, i));
 
-                    // TODO: pair should be same as pair before.
-                    pair = RHASH_AR_TABLE_REF(hash, i);
                     pair->key = (VALUE)key;
                     pair->val = (VALUE)val;
                 }
@@ -948,7 +899,7 @@ ar_foreach_check(VALUE hash, st_foreach_check_callback_func *func, st_data_t arg
                 if (pair->key == never) break;
                 ret = ar_find_entry_hint(hash, hint, key);
                 if (ret == RHASH_AR_TABLE_MAX_BOUND) {
-                    retval = (*func)(0, 0, arg, 1);
+                    (*func)(0, 0, arg, 1);
                     return 2;
                 }
               }
@@ -1178,12 +1129,15 @@ ar_values(VALUE hash, st_data_t *values, st_index_t size)
 static ar_table*
 ar_copy(VALUE hash1, VALUE hash2)
 {
+    RUBY_ASSERT(rb_gc_obj_slot_size(hash1) >= sizeof(struct RHash) + sizeof(ar_table));
     ar_table *old_tab = RHASH_AR_TABLE(hash2);
     ar_table *new_tab = RHASH_AR_TABLE(hash1);
 
-    *new_tab = *old_tab;
+    unsigned int bound = RHASH_AR_TABLE_BOUND(hash2);
+    new_tab->ar_hint.word = old_tab->ar_hint.word;
+    MEMCPY(&new_tab->pairs, &old_tab->pairs, ar_table_pair, bound);
     RHASH_AR_TABLE(hash1)->ar_hint.word = RHASH_AR_TABLE(hash2)->ar_hint.word;
-    RHASH_AR_TABLE_BOUND_SET(hash1, RHASH_AR_TABLE_BOUND(hash2));
+    RHASH_AR_TABLE_BOUND_SET(hash1, bound);
     RHASH_AR_TABLE_SIZE_SET(hash1, RHASH_AR_TABLE_SIZE(hash2));
 
     rb_gc_writebarrier_remember(hash1);
@@ -1209,17 +1163,13 @@ hash_st_free(VALUE hash)
 {
     HASH_ASSERT(RHASH_ST_TABLE_P(hash));
 
-    st_table *tab = RHASH_ST_TABLE(hash);
-
-    xfree(tab->bins);
-    xfree(tab->entries);
+    rb_st_free_embedded_table(RHASH_ST_TABLE(hash));
 }
 
 static void
 hash_st_free_and_clear_table(VALUE hash)
 {
     hash_st_free(hash);
-
     RHASH_ST_CLEAR(hash);
 }
 
@@ -1297,7 +1247,6 @@ hash_ar_foreach_iter(st_data_t key, st_data_t value, st_data_t argp, int error)
     if (error) return ST_STOP;
 
     int status = (*arg->func)((VALUE)key, (VALUE)value, arg->arg);
-    /* TODO: rehash check? rb_raise(rb_eRuntimeError, "rehash occurred during iteration"); */
 
     return hash_iter_status_check(status);
 }
@@ -1309,13 +1258,8 @@ hash_foreach_iter(st_data_t key, st_data_t value, st_data_t argp, int error)
 
     if (error) return ST_STOP;
 
-    st_table *tbl = RHASH_ST_TABLE(arg->hash);
     int status = (*arg->func)((VALUE)key, (VALUE)value, arg->arg);
 
-    if (RHASH_ST_TABLE(arg->hash) != tbl) {
-        rb_raise(rb_eRuntimeError, "rehash occurred during iteration");
-    }
-
     return hash_iter_status_check(status);
 }
 
@@ -1395,19 +1339,13 @@ hash_iter_lev_dec(VALUE hash)
 }
 
 static VALUE
-hash_foreach_ensure_rollback(VALUE hash)
-{
-    hash_iter_lev_inc(hash);
-    return 0;
-}
-
-static VALUE
 hash_foreach_ensure(VALUE hash)
 {
     hash_iter_lev_dec(hash);
     return 0;
 }
 
+/* This does not manage iteration level */
 int
 rb_hash_stlike_foreach(VALUE hash, st_foreach_callback_func *func, st_data_t arg)
 {
@@ -1419,6 +1357,7 @@ rb_hash_stlike_foreach(VALUE hash, st_foreach_callback_func *func, st_data_t arg
     }
 }
 
+/* This does not manage iteration level */
 int
 rb_hash_stlike_foreach_with_replace(VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
 {
@@ -1482,14 +1421,9 @@ compact_after_delete(VALUE hash)
 static VALUE
 hash_alloc_flags(VALUE klass, VALUE flags, VALUE ifnone, bool st)
 {
-    const VALUE wb = (RGENGC_WB_PROTECTED_HASH ? FL_WB_PROTECTED : 0);
     const size_t size = sizeof(struct RHash) + (st ? sizeof(st_table) : sizeof(ar_table));
-
-    NEWOBJ_OF(hash, struct RHash, klass, T_HASH | wb | flags, size, 0);
-
-    RHASH_SET_IFNONE((VALUE)hash, ifnone);
-
-    return (VALUE)hash;
+    VALUE hash = rb_newobj_of(klass, T_HASH | flags, size);
+    return rb_hash_set_ifnone(hash, ifnone);
 }
 
 static VALUE
@@ -1541,9 +1475,30 @@ rb_hash_new_capa(long capa)
     return rb_hash_new_with_size((st_index_t)capa);
 }
 
+VALUE
+rb_hash_alloc_fixed_size(VALUE klass, st_index_t size)
+{
+    VALUE ret;
+    if (size > RHASH_AR_TABLE_MAX_SIZE) {
+        ret = hash_alloc_flags(klass, 0, Qnil, true);
+        hash_st_table_init(ret, &objhash, size);
+    }
+    else {
+        size_t slot_size = sizeof(struct RHash) + offsetof(ar_table, pairs) + size * sizeof(ar_table_pair);
+        ret = rb_newobj_of(klass, T_HASH, slot_size);
+    }
+
+    RHASH_SET_IFNONE(ret, Qnil);
+    return ret;
+}
+
 static VALUE
 hash_copy(VALUE ret, VALUE hash)
 {
+    if (rb_hash_compare_by_id_p(hash)) {
+        rb_gc_register_pinning_obj(ret);
+    }
+
     if (RHASH_AR_TABLE_P(hash)) {
         if (RHASH_AR_TABLE_P(ret)) {
             ar_copy(ret, hash);
@@ -1599,10 +1554,10 @@ VALUE
 rb_hash_dup(VALUE hash)
 {
     const VALUE flags = RBASIC(hash)->flags;
-    VALUE ret = hash_dup(hash, rb_obj_class(hash),
-                         flags & (FL_EXIVAR|RHASH_PROC_DEFAULT));
-    if (flags & FL_EXIVAR)
-        rb_copy_generic_ivar(ret, hash);
+    VALUE ret = hash_dup(hash, rb_obj_class(hash), flags & RHASH_PROC_DEFAULT);
+
+    rb_copy_generic_ivar(ret, hash);
+
     return ret;
 }
 
@@ -1725,14 +1680,14 @@ tbl_update(VALUE hash, VALUE key, tbl_update_func func, st_data_t optional_arg)
         .func = func,
         .hash = hash,
         .key  = key,
-        .value = (VALUE)optional_arg,
+        .value = 0
     };
 
     int ret = rb_hash_stlike_update(hash, key, tbl_update_modify, (st_data_t)&arg);
 
     /* write barrier */
     RB_OBJ_WRITTEN(hash, Qundef, arg.key);
-    RB_OBJ_WRITTEN(hash, Qundef, arg.value);
+    if (arg.value) RB_OBJ_WRITTEN(hash, Qundef, arg.value);
 
     return ret;
 }
@@ -1762,58 +1717,31 @@ set_proc_default(VALUE hash, VALUE proc)
     RHASH_SET_IFNONE(hash, proc);
 }
 
-/*
- *  call-seq:
- *     Hash.new(default_value = nil) -> new_hash
- *     Hash.new {|hash, key| ... } -> new_hash
- *
- *  Returns a new empty +Hash+ object.
- *
- *  The initial default value and initial default proc for the new hash
- *  depend on which form above was used. See {Default Values}[rdoc-ref:Hash@Default+Values].
- *
- *  If neither an argument nor a block given,
- *  initializes both the default value and the default proc to <tt>nil</tt>:
- *    h = Hash.new
- *    h.default # => nil
- *    h.default_proc # => nil
- *
- *  If argument <tt>default_value</tt> given but no block given,
- *  initializes the default value to the given <tt>default_value</tt>
- *  and the default proc to <tt>nil</tt>:
- *    h = Hash.new(false)
- *    h.default # => false
- *    h.default_proc # => nil
- *
- *  If a block given but no argument, stores the block as the default proc
- *  and sets the default value to <tt>nil</tt>:
- *    h = Hash.new {|hash, key| "Default value for #{key}" }
- *    h.default # => nil
- *    h.default_proc.class # => Proc
- *    h[:nosuch] # => "Default value for nosuch"
- */
-
 static VALUE
-rb_hash_initialize(int argc, VALUE *argv, VALUE hash)
+rb_hash_init(rb_execution_context_t *ec, VALUE hash, VALUE capa_value, VALUE ifnone_unset, VALUE ifnone, VALUE block)
 {
     rb_hash_modify(hash);
 
-    if (rb_block_given_p()) {
-        rb_check_arity(argc, 0, 0);
-        SET_PROC_DEFAULT(hash, rb_block_proc());
+    if (capa_value != INT2FIX(0)) {
+        long capa = NUM2LONG(capa_value);
+        if (capa > 0 && RHASH_SIZE(hash) == 0 && RHASH_AR_TABLE_P(hash)) {
+            hash_st_table_init(hash, &objhash, capa);
+        }
     }
-    else {
-        rb_check_arity(argc, 0, 1);
 
-        VALUE options, ifnone;
-        rb_scan_args(argc, argv, "01:", &ifnone, &options);
-        if (NIL_P(ifnone) && !NIL_P(options)) {
-            ifnone = options;
-            rb_warn_deprecated_to_remove("3.4", "Calling Hash.new with keyword arguments", "Hash.new({ key: value })");
+    if (!NIL_P(block)) {
+        if (ifnone_unset != Qtrue) {
+            rb_check_arity(1, 0, 0);
+        }
+        else {
+            SET_PROC_DEFAULT(hash, block);
         }
-        RHASH_SET_IFNONE(hash, ifnone);
+    }
+    else {
+        RHASH_SET_IFNONE(hash, ifnone_unset == Qtrue ? Qnil : ifnone);
     }
 
+    hash_verify(hash);
     return hash;
 }
 
@@ -1822,36 +1750,38 @@ static VALUE rb_hash_to_a(VALUE hash);
 /*
  *  call-seq:
  *    Hash[] -> new_empty_hash
- *    Hash[hash] -> new_hash
+ *    Hash[other_hash] -> new_hash
  *    Hash[ [*2_element_arrays] ] -> new_hash
  *    Hash[*objects] -> new_hash
  *
- *  Returns a new +Hash+ object populated with the given objects, if any.
+ *  Returns a new \Hash object populated with the given objects, if any.
  *  See Hash::new.
  *
- *  With no argument, returns a new empty +Hash+.
+ *  With no argument given, returns a new empty hash.
  *
- *  When the single given argument is a +Hash+, returns a new +Hash+
- *  populated with the entries from the given +Hash+, excluding the
- *  default value or proc.
+ *  With a single argument +other_hash+ given that is a hash,
+ *  returns a new hash initialized with the entries from that hash
+ *  (but not with its +default+ or +default_proc+):
  *
  *    h = {foo: 0, bar: 1, baz: 2}
- *    Hash[h] # => {:foo=>0, :bar=>1, :baz=>2}
+ *    Hash[h] # => {foo: 0, bar: 1, baz: 2}
  *
- *  When the single given argument is an Array of 2-element Arrays,
- *  returns a new +Hash+ object wherein each 2-element array forms a
+ *  With a single argument +2_element_arrays+ given that is an array of 2-element arrays,
+ *  returns a new hash wherein each given 2-element array forms a
  *  key-value entry:
  *
- *    Hash[ [ [:foo, 0], [:bar, 1] ] ] # => {:foo=>0, :bar=>1}
+ *    Hash[ [ [:foo, 0], [:bar, 1] ] ] # => {foo: 0, bar: 1}
  *
- *  When the argument count is an even number;
- *  returns a new +Hash+ object wherein each successive pair of arguments
- *  has become a key-value entry:
+ *  With an even number of arguments +objects+ given,
+ *  returns a new hash wherein each successive pair of arguments
+ *  is a key-value entry:
  *
- *    Hash[:foo, 0, :bar, 1] # => {:foo=>0, :bar=>1}
+ *    Hash[:foo, 0, :bar, 1] # => {foo: 0, bar: 1}
  *
- *  Raises an exception if the argument list does not conform to any
+ *  Raises ArgumentError if the argument list does not conform to any
  *  of the above.
+ *
+ *  See also {Methods for Creating a Hash}[rdoc-ref:Hash@Methods+for+Creating+a+Hash].
  */
 
 static VALUE
@@ -1931,16 +1861,15 @@ rb_check_hash_type(VALUE hash)
 
 /*
  *  call-seq:
- *    Hash.try_convert(obj) -> obj, new_hash, or nil
- *
- *  If +obj+ is a +Hash+ object, returns +obj+.
+ *    Hash.try_convert(object) -> object, new_hash, or nil
  *
- *  Otherwise if +obj+ responds to <tt>:to_hash</tt>,
- *  calls <tt>obj.to_hash</tt> and returns the result.
+ *  If +object+ is a hash, returns +object+.
  *
- *  Returns +nil+ if +obj+ does not respond to <tt>:to_hash</tt>
+ *  Otherwise if +object+ responds to +:to_hash+,
+ *  calls <tt>object.to_hash</tt>;
+ *  returns the result if it is a hash, or raises TypeError if not.
  *
- *  Raises an exception unless <tt>obj.to_hash</tt> returns a +Hash+ object.
+ *  Otherwise if +object+ does not respond to +:to_hash+, returns +nil+.
  */
 static VALUE
 rb_hash_s_try_convert(VALUE dummy, VALUE hash)
@@ -2011,15 +1940,19 @@ rb_hash_rehash_i(VALUE key, VALUE value, VALUE arg)
     else {
         st_insert(RHASH_ST_TABLE(arg), (st_data_t)key, (st_data_t)value);
     }
+
+    RB_OBJ_WRITTEN(arg, Qundef, key);
+    RB_OBJ_WRITTEN(arg, Qundef, value);
     return ST_CONTINUE;
 }
 
 /*
  *  call-seq:
- *     hash.rehash -> self
+ *     rehash -> self
  *
- *  Rebuilds the hash table by recomputing the hash index for each key;
+ *  Rebuilds the hash table for +self+ by recomputing the hash index for each key;
  *  returns <tt>self</tt>.
+ *  Calling this method ensures that the hash table is valid.
  *
  *  The hash table becomes invalid if the hash value of a key
  *  has changed after the entry was created.
@@ -2053,7 +1986,7 @@ rb_hash_rehash(VALUE hash)
         rb_hash_foreach(hash, rb_hash_rehash_i, (VALUE)tmp);
 
         hash_st_free(hash);
-        RHASH_ST_TABLE_SET(hash, tbl);
+        rb_hash_st_table_set(hash, tbl);
         RHASH_ST_CLEAR(tmp);
     }
     hash_verify(hash);
@@ -2067,7 +2000,7 @@ call_default_proc(VALUE proc, VALUE hash, VALUE key)
     return rb_proc_call_with_block(proc, 2, args, Qnil);
 }
 
-static bool
+bool
 rb_hash_default_unredefined(VALUE hash)
 {
     VALUE klass = RBASIC_CLASS(hash);
@@ -2120,16 +2053,19 @@ rb_hash_stlike_lookup(VALUE hash, st_data_t key, st_data_t *pval)
 
 /*
  *  call-seq:
- *    hash[key] -> value
+ *    self[key] -> object
  *
- *  Returns the value associated with the given +key+, if found:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h[:foo] # => 0
+ *  Searches for a hash key equivalent to the given +key+;
+ *  see {Hash Key Equivalence}[rdoc-ref:Hash@Hash+Key+Equivalence].
  *
- *  If +key+ is not found, returns a default value
- *  (see {Default Values}[rdoc-ref:Hash@Default+Values]):
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h[:nosuch] # => nil
+ *  If the key is found, returns its value:
+ *
+ *    {foo: 0, bar: 1, baz: 2}
+ *    h[:bar] # => 1
+ *
+ *  Otherwise, returns a default value (see {Hash Default}[rdoc-ref:Hash@Hash+Default]).
+ *
+ *  Related: #[]=; see also {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 VALUE
@@ -2166,25 +2102,28 @@ rb_hash_lookup(VALUE hash, VALUE key)
 
 /*
  *  call-seq:
- *    hash.fetch(key) -> object
- *    hash.fetch(key, default_value) -> object
- *    hash.fetch(key) {|key| ... } -> object
+ *    fetch(key) -> object
+ *    fetch(key, default_value) -> object
+ *    fetch(key) {|key| ... } -> object
+ *
+ *  With no block given, returns the value for the given +key+, if found;
  *
- *  Returns the value for the given +key+, if found.
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h.fetch(:bar) # => 1
+ *    h.fetch(:bar)  # => 1
  *
- *  If +key+ is not found and no block was given,
- *  returns +default_value+:
- *    {}.fetch(:nosuch, :default) # => :default
+ *  If the key is not found, returns +default_value+, if given,
+ *  or raises KeyError otherwise:
  *
- *  If +key+ is not found and a block was given,
- *  yields +key+ to the block and returns the block's return value:
- *    {}.fetch(:nosuch) {|key| "No key #{key}"} # => "No key nosuch"
+ *    h.fetch(:nosuch, :default) # => :default
+ *    h.fetch(:nosuch)           # Raises KeyError.
  *
- *  Raises KeyError if neither +default_value+ nor a block was given.
+ *  With a block given, calls the block with +key+ and returns the block's return value:
+ *
+ *    {}.fetch(:nosuch) {|key| "No key #{key}"} # => "No key nosuch"
  *
  *  Note that this method does not use the values of either #default or #default_proc.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -2231,12 +2170,12 @@ rb_hash_fetch(VALUE hash, VALUE key)
 
 /*
  *  call-seq:
- *    hash.default -> object
- *    hash.default(key) -> object
+ *    default -> object
+ *    default(key) -> object
  *
  *  Returns the default value for the given +key+.
  *  The returned value will be determined either by the default proc or by the default value.
- *  See {Default Values}[rdoc-ref:Hash@Default+Values].
+ *  See {Hash Default}[rdoc-ref:Hash@Hash+Default].
  *
  *  With no argument, returns the current default value:
  *    h = {}
@@ -2265,7 +2204,7 @@ rb_hash_default(int argc, VALUE *argv, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.default = value -> object
+ *    default = value -> object
  *
  *  Sets the default value to +value+; returns +value+:
  *    h = {}
@@ -2273,10 +2212,10 @@ rb_hash_default(int argc, VALUE *argv, VALUE hash)
  *    h.default = false # => false
  *    h.default # => false
  *
- *  See {Default Values}[rdoc-ref:Hash@Default+Values].
+ *  See {Hash Default}[rdoc-ref:Hash@Hash+Default].
  */
 
-static VALUE
+VALUE
 rb_hash_set_default(VALUE hash, VALUE ifnone)
 {
     rb_hash_modify_check(hash);
@@ -2286,10 +2225,10 @@ rb_hash_set_default(VALUE hash, VALUE ifnone)
 
 /*
  *  call-seq:
- *    hash.default_proc -> proc or nil
+ *    default_proc -> proc or nil
  *
  *  Returns the default proc for +self+
- *  (see {Default Values}[rdoc-ref:Hash@Default+Values]):
+ *  (see {Hash Default}[rdoc-ref:Hash@Hash+Default]):
  *    h = {}
  *    h.default_proc # => nil
  *    h.default_proc = proc {|hash, key| "Default value for #{key}" }
@@ -2307,10 +2246,10 @@ rb_hash_default_proc(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.default_proc = proc -> proc
+ *    default_proc = proc -> proc
  *
  *  Sets the default proc for +self+ to +proc+
- *  (see {Default Values}[rdoc-ref:Hash@Default+Values]):
+ *  (see {Hash Default}[rdoc-ref:Hash@Hash+Default]):
  *    h = {}
  *    h.default_proc # => nil
  *    h.default_proc = proc { |hash, key| "Default value for #{key}" }
@@ -2354,15 +2293,18 @@ key_i(VALUE key, VALUE value, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.key(value) -> key or nil
+ *    key(value) -> key or nil
  *
  *  Returns the key for the first-found entry with the given +value+
  *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]):
+ *
  *    h = {foo: 0, bar: 2, baz: 2}
  *    h.key(0) # => :foo
  *    h.key(2) # => :bar
  *
  *  Returns +nil+ if no such value is found.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -2427,29 +2369,36 @@ rb_hash_delete(VALUE hash, VALUE key)
 
 /*
  *  call-seq:
- *    hash.delete(key) -> value or nil
- *    hash.delete(key) {|key| ... } -> object
+ *    delete(key) -> value or nil
+ *    delete(key) {|key| ... } -> object
+ *
+ *  If an entry for the given +key+ is found,
+ *  deletes the entry and returns its associated value;
+ *  otherwise returns +nil+ or calls the given block.
  *
- *  Deletes the entry for the given +key+ and returns its associated value.
+ *  With no block given and +key+ found, deletes the entry and returns its value:
  *
- *  If no block is given and +key+ is found, deletes the entry and returns the associated value:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.delete(:bar) # => 1
- *    h # => {:foo=>0, :baz=>2}
+ *    h # => {foo: 0, baz: 2}
  *
- *  If no block given and +key+ is not found, returns +nil+.
+ *  With no block given and +key+ not found, returns +nil+.
+ *
+ *  With a block given and +key+ found, ignores the block,
+ *  deletes the entry, and returns its value:
  *
- *  If a block is given and +key+ is found, ignores the block,
- *  deletes the entry, and returns the associated value:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.delete(:baz) { |key| raise 'Will never happen'} # => 2
- *    h # => {:foo=>0, :bar=>1}
+ *    h # => {foo: 0, bar: 1}
  *
- *  If a block is given and +key+ is not found,
+ *  With a block given and +key+ not found,
  *  calls the block and returns the block's return value:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.delete(:nosuch) { |key| "Key #{key} not found" } # => "Key nosuch not found"
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2491,16 +2440,18 @@ shift_i_safe(VALUE key, VALUE value, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.shift -> [key, value] or nil
+ *    shift -> [key, value] or nil
+ *
+ *  Removes and returns the first entry of +self+ as a 2-element array;
+ *  see {Entry Order}[rdoc-ref:Hash@Entry+Order]:
  *
- *  Removes the first hash entry
- *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]);
- *  returns a 2-element Array containing the removed key and value:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.shift # => [:foo, 0]
- *    h # => {:bar=>1, :baz=>2}
+ *    h       # => {bar: 1, baz: 2}
  *
- *  Returns nil if the hash is empty.
+ *  Returns +nil+ if +self+ is empty.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2560,19 +2511,19 @@ hash_enum_size(VALUE hash, VALUE args, VALUE eobj)
 
 /*
  *  call-seq:
- *    hash.delete_if {|key, value| ... } -> self
- *    hash.delete_if -> new_enumerator
+ *    delete_if {|key, value| ... } -> self
+ *    delete_if -> new_enumerator
  *
- *  If a block given, calls the block with each key-value pair;
- *  deletes each entry for which the block returns a truthy value;
- *  returns +self+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.delete_if {|key, value| value > 0 } # => {:foo=>0}
+ *  With a block given, calls the block with each key-value pair,
+ *  deletes each entry for which the block returns a truthy value,
+ *  and returns +self+:
  *
- *  If no block given, returns a new Enumerator:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.delete_if # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:delete_if>
- *    e.each { |key, value| value > 0 } # => {:foo=>0}
+ *    h.delete_if {|key, value| value > 0 } # => {foo: 0}
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 VALUE
@@ -2589,20 +2540,21 @@ rb_hash_delete_if(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.reject! {|key, value| ... } -> self or nil
- *    hash.reject! -> new_enumerator
+ *    reject! {|key, value| ... } -> self or nil
+ *    reject! -> new_enumerator
  *
- *  Returns +self+, whose remaining entries are those
- *  for which the block returns +false+ or +nil+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.reject! {|key, value| value < 2 } # => {:baz=>2}
+ *  With a block given, calls the block with each entry's key and value;
+ *  removes the entry from +self+ if the block returns a truthy value.
  *
- *  Returns +nil+ if no entries are removed.
+ *  Return +self+ if any entries were removed, +nil+ otherwise:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.reject! # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:reject!>
- *    e.each {|key, value| key.start_with?('b') } # => {:foo=>0}
+ *    h.reject! {|key, value| value < 2 } # => {baz: 2}
+ *    h.reject! {|key, value| value < 2 } # => nil
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2621,20 +2573,21 @@ rb_hash_reject_bang(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.reject {|key, value| ... } -> new_hash
- *    hash.reject -> new_enumerator
+ *    reject {|key, value| ... } -> new_hash
+ *    reject -> new_enumerator
  *
- *  Returns a new +Hash+ object whose entries are all those
- *  from +self+ for which the block returns +false+ or +nil+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h1 = h.reject {|key, value| key.start_with?('b') }
- *    h1 # => {:foo=>0}
+ *  With a block given, returns a copy of +self+ with zero or more entries removed;
+ *  calls the block with each key-value pair;
+ *  excludes the entry in the copy if the block returns a truthy value,
+ *  includes it otherwise:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.reject # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:reject>
- *    h1 = e.each {|key, value| key.start_with?('b') }
- *    h1 # => {:foo=>0}
+ *    h.reject {|key, value| key.start_with?('b') }
+ *    # => {foo: 0}
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2653,13 +2606,15 @@ rb_hash_reject(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.slice(*keys) -> new_hash
+ *    slice(*keys) -> new_hash
+ *
+ *  Returns a new hash containing the entries from +self+ for the given +keys+;
+ *  ignores any keys that are not found:
  *
- *  Returns a new +Hash+ object containing the entries for the given +keys+:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h.slice(:baz, :foo) # => {:baz=>2, :foo=>0}
+ *    h.slice(:baz, :foo, :nosuch) # => {baz: 2, foo: 0}
  *
- *  Any given +keys+ that are not found are ignored.
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2685,13 +2640,16 @@ rb_hash_slice(int argc, VALUE *argv, VALUE hash)
 
 /*
  *  call-seq:
- *     hsh.except(*keys) -> a_hash
+ *    except(*keys) -> new_hash
+ *
+ *  Returns a copy of +self+ that excludes entries for the given +keys+;
+ *  any +keys+ that are not found are ignored:
  *
- *  Returns a new +Hash+ excluding entries for the given +keys+:
- *     h = { a: 100, b: 200, c: 300 }
- *     h.except(:a)          #=> {:b=>200, :c=>300}
+ *    h = {foo:0, bar: 1, baz: 2} # => {foo: 0, bar: 1, baz: 2}
+ *    h.except(:baz, :foo)        # => {bar: 1}
+ *    h.except(:bar, :nosuch)     # => {foo: 0, baz: 2}
  *
- *  Any given +keys+ that are not found are ignored.
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2713,15 +2671,19 @@ rb_hash_except(int argc, VALUE *argv, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.values_at(*keys) -> new_array
+ *    values_at(*keys) -> new_array
+ *
+ *  Returns a new array containing values for the given +keys+:
  *
- *  Returns a new Array containing values for the given +keys+:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.values_at(:baz, :foo) # => [2, 0]
  *
- *  The {default values}[rdoc-ref:Hash@Default+Values] are returned
- *  for any keys that are not found:
+ *  The {hash default}[rdoc-ref:Hash@Hash+Default] is returned
+ *  for each key that is not found:
+ *
  *    h.values_at(:hello, :foo) # => [nil, 0]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -2738,22 +2700,26 @@ rb_hash_values_at(int argc, VALUE *argv, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.fetch_values(*keys) -> new_array
- *    hash.fetch_values(*keys) {|key| ... } -> new_array
+ *    fetch_values(*keys) -> new_array
+ *    fetch_values(*keys) {|key| ... } -> new_array
+ *
+ *  When all given +keys+ are found,
+ *  returns a new array containing the values associated with the given +keys+:
  *
- *  Returns a new Array containing the values associated with the given keys *keys:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.fetch_values(:baz, :foo) # => [2, 0]
  *
- *  Returns a new empty Array if no arguments given.
+ *  When any given +keys+ are not found and a block is given,
+ *  calls the block with each unfound key and uses the block's return value
+ *  as the value for that key:
  *
- *  When a block is given, calls the block with each missing key,
- *  treating the block's return value as the value for that key:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    values = h.fetch_values(:bar, :foo, :bad, :bam) {|key| key.to_s}
- *    values # => [1, 0, "bad", "bam"]
+ *    h.fetch_values(:bar, :foo, :bad, :bam) {|key| key.to_s}
+ *    # => [1, 0, "bad", "bam"]
+ *
+ *  When any given +keys+ are not found and no block is given,
+ *  raises KeyError.
  *
- *  When no block is given, raises an exception if any given key is not found.
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -2780,17 +2746,18 @@ keep_if_i(VALUE key, VALUE value, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.select {|key, value| ... } -> new_hash
- *    hash.select -> new_enumerator
+ *    select {|key, value| ... } -> new_hash
+ *    select -> new_enumerator
  *
- *  Returns a new +Hash+ object whose entries are those for which the block returns a truthy value:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.select {|key, value| value < 2 } # => {:foo=>0, :bar=>1}
+ *  With a block given, calls the block with each entry's key and value;
+ *  returns a new hash whose entries are those for which the block returns a truthy value:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.select # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:select>
- *    e.each {|key, value| value < 2 } # => {:foo=>0, :bar=>1}
+ *    h.select {|key, value| value < 2 } # => {foo: 0, bar: 1}
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2809,19 +2776,22 @@ rb_hash_select(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.select! {|key, value| ... } -> self or nil
- *    hash.select! -> new_enumerator
+ *    select! {|key, value| ... } -> self or nil
+ *    select! -> new_enumerator
  *
- *  Returns +self+, whose entries are those for which the block returns a truthy value:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.select! {|key, value| value < 2 }  => {:foo=>0, :bar=>1}
+ *  With a block given, calls the block with each entry's key and value;
+ *  removes from +self+ each entry for which the block returns +false+ or +nil+.
  *
- *  Returns +nil+ if no entries were removed.
+ *  Returns +self+ if any entries were removed, +nil+ otherwise:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.select!  # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:select!>
- *    e.each { |key, value| value < 2 } # => {:foo=>0, :bar=>1}
+ *    h.select! {|key, value| value < 2 } # => {foo: 0, bar: 1}
+ *    h.select! {|key, value| value < 2 } # => nil
+ *
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2840,19 +2810,19 @@ rb_hash_select_bang(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.keep_if {|key, value| ... } -> self
- *    hash.keep_if -> new_enumerator
+ *    keep_if {|key, value| ... } -> self
+ *    keep_if -> new_enumerator
  *
- *  Calls the block for each key-value pair;
+ *  With a block given, calls the block for each key-value pair;
  *  retains the entry if the block returns a truthy value;
- *  otherwise deletes the entry; returns +self+.
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.keep_if { |key, value| key.start_with?('b') } # => {:bar=>1, :baz=>2}
+ *  otherwise deletes the entry; returns +self+:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.keep_if # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:keep_if>
- *    e.each { |key, value| key.start_with?('b') } # => {:bar=>1, :baz=>2}
+ *    h.keep_if { |key, value| key.start_with?('b') } # => {bar: 1, baz: 2}
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -2874,9 +2844,11 @@ clear_i(VALUE key, VALUE value, VALUE dummy)
 
 /*
  *  call-seq:
- *    hash.clear -> self
+ *    clear -> self
  *
- *  Removes all hash entries; returns +self+.
+ *  Removes all entries from +self+; returns emptied +self+.
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 VALUE
@@ -2908,7 +2880,7 @@ hash_aset(st_data_t *key, st_data_t *val, struct update_arg *arg, int existing)
 VALUE
 rb_hash_key_str(VALUE key)
 {
-    if (!RB_FL_ANY_RAW(key, FL_EXIVAR) && RBASIC_CLASS(key) == rb_cString) {
+    if (!rb_obj_gen_fields_p(key) && RBASIC_CLASS(key) == rb_cString) {
         return rb_fstring(key);
     }
     else {
@@ -2930,26 +2902,31 @@ NOINSERT_UPDATE_CALLBACK(hash_aset_str)
 
 /*
  *  call-seq:
- *    hash[key] = value -> value
- *    hash.store(key, value)
+ *    self[key] = object -> object
+ *
+ *  Associates the given +object+ with the given +key+; returns +object+.
  *
- *  Associates the given +value+ with the given +key+; returns +value+.
+ *  Searches for a hash key equivalent to the given +key+;
+ *  see {Hash Key Equivalence}[rdoc-ref:Hash@Hash+Key+Equivalence].
  *
- *  If the given +key+ exists, replaces its value with the given +value+;
+ *  If the key is found, replaces its value with the given +object+;
  *  the ordering is not affected
  *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]):
+ *
  *    h = {foo: 0, bar: 1}
  *    h[:foo] = 2 # => 2
- *    h.store(:bar, 3) # => 3
- *    h # => {:foo=>2, :bar=>3}
+ *    h[:foo]     # => 2
  *
- *  If +key+ does not exist, adds the +key+ and +value+;
+ *  If +key+ is not found, creates a new entry for the given +key+ and +object+;
  *  the new entry is last in the order
  *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]):
+ *
  *    h = {foo: 0, bar: 1}
  *    h[:baz] = 2 # => 2
- *    h.store(:bat, 3) # => 3
- *    h # => {:foo=>0, :bar=>1, :baz=>2, :bat=>3}
+ *    h[:baz]     # => 2
+ *    h           # => {foo: 0, bar: 1, baz: 2}
+ *
+ *  Related: #[]; see also {Methods for Assigning}[rdoc-ref:Hash@Methods+for+Assigning].
  */
 
 VALUE
@@ -2970,12 +2947,23 @@ rb_hash_aset(VALUE hash, VALUE key, VALUE val)
 
 /*
  *  call-seq:
- *    hash.replace(other_hash) -> self
+ *    replace(other_hash) -> self
  *
  *  Replaces the entire contents of +self+ with the contents of +other_hash+;
  *  returns +self+:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h.replace({bat: 3, bam: 4}) # => {:bat=>3, :bam=>4}
+ *    h.replace({bat: 3, bam: 4}) # => {bat: 3, bam: 4}
+ *
+ *  Also replaces the default value or proc of +self+ with the default value
+ *  or proc of +other_hash+.
+ *
+ *    h = {}
+ *    other = Hash.new(:ok)
+ *    h.replace(other)
+ *    h.default # => :ok
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Hash@Methods+for+Assigning].
  */
 
 static VALUE
@@ -3004,13 +2992,13 @@ rb_hash_replace(VALUE hash, VALUE hash2)
 
 /*
  *  call-seq:
- *     hash.length -> integer
- *     hash.size -> integer
+ *     size -> integer
  *
  *  Returns the count of entries in +self+:
  *
- *    {foo: 0, bar: 1, baz: 2}.length # => 3
+ *    {foo: 0, bar: 1, baz: 2}.size # => 3
  *
+ *  Related: see {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 VALUE
@@ -3027,11 +3015,14 @@ rb_hash_size_num(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.empty? -> true or false
+ *    empty? -> true or false
  *
  *  Returns +true+ if there are no hash entries, +false+ otherwise:
+ *
  *    {}.empty? # => true
- *    {foo: 0, bar: 1, baz: 2}.empty? # => false
+ *    {foo: 0}.empty? # => false
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 VALUE
@@ -3049,26 +3040,22 @@ each_value_i(VALUE key, VALUE value, VALUE _)
 
 /*
  *  call-seq:
- *    hash.each_value {|value| ... } -> self
- *    hash.each_value -> new_enumerator
+ *    each_value {|value| ... } -> self
+ *    each_value -> new_enumerator
  *
- *  Calls the given block with each value; returns +self+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.each_value {|value| puts value } # => {:foo=>0, :bar=>1, :baz=>2}
- *  Output:
- *    0
- *    1
- *    2
+ *  With a block given, calls the block with each value; returns +self+:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.each_value # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:each_value>
- *    h1 = e.each {|value| puts value }
- *    h1 # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h.each_value {|value| puts value } # => {foo: 0, bar: 1, baz: 2}
+ *
  *  Output:
  *    0
  *    1
  *    2
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Hash@Methods+for+Iterating].
  */
 
 static VALUE
@@ -3088,26 +3075,22 @@ each_key_i(VALUE key, VALUE value, VALUE _)
 
 /*
  *  call-seq:
- *    hash.each_key {|key| ... } -> self
- *    hash.each_key -> new_enumerator
+ *    each_key {|key| ... } -> self
+ *    each_key -> new_enumerator
  *
- *  Calls the given block with each key; returns +self+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.each_key {|key| puts key }  # => {:foo=>0, :bar=>1, :baz=>2}
- *  Output:
- *    foo
- *    bar
- *    baz
+ *  With a block given, calls the block with each key; returns +self+:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.each_key # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:each_key>
- *    h1 = e.each {|key| puts key }
- *    h1 # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h.each_key {|key| puts key }  # => {foo: 0, bar: 1, baz: 2}
+ *
  *  Output:
  *    foo
  *    bar
  *    baz
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Hash@Methods+for+Iterating].
  */
 static VALUE
 rb_hash_each_key(VALUE hash)
@@ -3136,28 +3119,23 @@ each_pair_i_fast(VALUE key, VALUE value, VALUE _)
 
 /*
  *  call-seq:
- *    hash.each {|key, value| ... } -> self
- *    hash.each_pair {|key, value| ... } -> self
- *    hash.each -> new_enumerator
- *    hash.each_pair -> new_enumerator
+ *    each_pair {|key, value| ... } -> self
+ *    each_pair -> new_enumerator
  *
- *  Calls the given block with each key-value pair; returns +self+:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.each_pair {|key, value| puts "#{key}: #{value}"} # => {:foo=>0, :bar=>1, :baz=>2}
- *  Output:
- *    foo: 0
- *    bar: 1
- *    baz: 2
+ *  With a block given, calls the block with each key-value pair; returns +self+:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.each_pair # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:each_pair>
- *    h1 = e.each {|key, value| puts "#{key}: #{value}"}
- *    h1 # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h.each_pair {|key, value| puts "#{key}: #{value}"} # => {foo: 0, bar: 1, baz: 2}
+ *
  *  Output:
+ *
  *    foo: 0
  *    bar: 1
  *    baz: 2
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Iterating}[rdoc-ref:Hash@Methods+for+Iterating].
  */
 
 static VALUE
@@ -3203,40 +3181,91 @@ transform_keys_i(VALUE key, VALUE value, VALUE result)
 
 /*
  *  call-seq:
- *    hash.transform_keys {|key| ... } -> new_hash
- *    hash.transform_keys(hash2) -> new_hash
- *    hash.transform_keys(hash2) {|other_key| ...} -> new_hash
- *    hash.transform_keys -> new_enumerator
+ *    transform_keys {|old_key| ... } -> new_hash
+ *    transform_keys(other_hash) -> new_hash
+ *    transform_keys(other_hash) {|old_key| ...} -> new_hash
+ *    transform_keys -> new_enumerator
+ *
+ *  With an argument, a block, or both given,
+ *  derives a new hash +new_hash+ from +self+, the argument, and/or the block;
+ *  all, some, or none of its keys may be different from those in +self+.
  *
- *  Returns a new +Hash+ object; each entry has:
- *  * A key provided by the block.
- *  * The value from +self+.
+ *  With a block given and no argument,
+ *  +new_hash+ has keys determined only by the block.
  *
- *  An optional hash argument can be provided to map keys to new keys.
- *  Any key not given will be mapped using the provided block,
- *  or remain the same if no block is given.
+ *  For each key/value pair <tt>old_key/value</tt> in +self+, calls the block with +old_key+;
+ *  the block's return value becomes +new_key+;
+ *  sets <tt>new_hash[new_key] = value</tt>;
+ *  a duplicate key overwrites:
  *
- *  Transform keys:
  *      h = {foo: 0, bar: 1, baz: 2}
- *      h1 = h.transform_keys {|key| key.to_s }
- *      h1 # => {"foo"=>0, "bar"=>1, "baz"=>2}
+ *      h.transform_keys {|old_key| old_key.to_s }
+ *      # => {"foo" => 0, "bar" => 1, "baz" => 2}
+ *      h.transform_keys {|old_key| 'xxx' }
+ *      # => {"xxx" => 2}
  *
- *      h.transform_keys(foo: :bar, bar: :foo)
- *      #=> {bar: 0, foo: 1, baz: 2}
+ *  With argument +other_hash+ given and no block,
+ *  +new_hash+ may have new keys provided by +other_hash+
+ *  and unchanged keys provided by +self+.
  *
- *      h.transform_keys(foo: :hello, &:to_s)
- *      #=> {:hello=>0, "bar"=>1, "baz"=>2}
+ *  For each key/value pair <tt>old_key/old_value</tt> in +self+,
+ *  looks for key +old_key+ in +other_hash+:
  *
- *  Overwrites values for duplicate keys:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h1 = h.transform_keys {|key| :bat }
- *    h1 # => {:bat=>2}
+ *  - If +old_key+ is found, its value <tt>other_hash[old_key]</tt> is taken as +new_key+;
+ *    sets <tt>new_hash[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys(baz: :BAZ, bar: :BAR, foo: :FOO)
+ *      # => {FOO: 0, BAR: 1, BAZ: 2}
+ *      h.transform_keys(baz: :FOO, bar: :FOO, foo: :FOO)
+ *      # => {FOO: 2}
+ *
+ *  - If +old_key+ is not found,
+ *    sets <tt>new_hash[old_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys({})
+ *      # => {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys(baz: :foo)
+ *      # => {foo: 2, bar: 1}
+ *
+ *  Unused keys in +other_hash+ are ignored:
  *
- *  Returns a new Enumerator if no block given:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.transform_keys # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:transform_keys>
- *    h1 = e.each { |key| key.to_s }
- *    h1 # => {"foo"=>0, "bar"=>1, "baz"=>2}
+ *    h.transform_keys(bat: 3)
+ *    # => {foo: 0, bar: 1, baz: 2}
+ *
+ *  With both argument +other_hash+ and a block given,
+ *  +new_hash+ has new keys specified by +other_hash+ or by the block,
+ *  and unchanged keys provided by +self+.
+ *
+ *  For each pair +old_key+ and +value+ in +self+:
+ *
+ *  - If +other_hash+ has key +old_key+ (with value +new_key+),
+ *    does not call the block for that key;
+ *    sets <tt>new_hash[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys(baz: :BAZ, bar: :BAR, foo: :FOO) {|key| fail 'Not called' }
+ *      # => {FOO: 0, BAR: 1, BAZ: 2}
+ *
+ *  - If +other_hash+ does not have key +old_key+,
+ *    calls the block with +old_key+ and takes its return value as +new_key+;
+ *    sets <tt>new_hash[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys(baz: :BAZ) {|key| key.to_s.reverse }
+ *      # => {"oof" => 0, "rab" => 1, BAZ: 2}
+ *      h.transform_keys(baz: :BAZ) {|key| 'ook' }
+ *      # => {"ook" => 1, BAZ: 2}
+ *
+ *  With no argument and no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values].
  */
 static VALUE
 rb_hash_transform_keys(int argc, VALUE *argv, VALUE hash)
@@ -3270,13 +3299,97 @@ static int flatten_i(VALUE key, VALUE val, VALUE ary);
 
 /*
  *  call-seq:
- *    hash.transform_keys! {|key| ... } -> self
- *    hash.transform_keys!(hash2) -> self
- *    hash.transform_keys!(hash2) {|other_key| ...} -> self
- *    hash.transform_keys! -> new_enumerator
+ *    transform_keys! {|old_key| ... } -> self
+ *    transform_keys!(other_hash) -> self
+ *    transform_keys!(other_hash) {|old_key| ...} -> self
+ *    transform_keys! -> new_enumerator
+ *
+ *  With an argument, a block, or both given,
+ *  derives keys from the argument, the block, and +self+;
+ *  all, some, or none of the keys in +self+ may be changed.
+ *
+ *  With a block given and no argument,
+ *  derives keys only from the block;
+ *  all, some, or none of the keys in +self+ may be changed.
+ *
+ *  For each key/value pair <tt>old_key/value</tt> in +self+, calls the block with +old_key+;
+ *  the block's return value becomes +new_key+;
+ *  removes the entry for +old_key+: <tt>self.delete(old_key)</tt>;
+ *  sets <tt>self[new_key] = value</tt>;
+ *  a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys! {|old_key| old_key.to_s }
+ *      # => {"foo" => 0, "bar" => 1, "baz" => 2}
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys! {|old_key| 'xxx' }
+ *      # => {"xxx" => 2}
+ *
+ *  With argument +other_hash+ given and no block,
+ *  derives keys for +self+ from +other_hash+ and +self+;
+ *  all, some, or none of the keys in +self+ may be changed.
+ *
+ *  For each key/value pair <tt>old_key/old_value</tt> in +self+,
+ *  looks for key +old_key+ in +other_hash+:
+ *
+ *  - If +old_key+ is found, takes value <tt>other_hash[old_key]</tt> as +new_key+;
+ *    removes the entry for +old_key+: <tt>self.delete(old_key)</tt>;
+ *    sets <tt>self[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :BAZ, bar: :BAR, foo: :FOO)
+ *      # => {FOO: 0, BAR: 1, BAZ: 2}
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :FOO, bar: :FOO, foo: :FOO)
+ *      # => {FOO: 2}
+ *
+ *  - If +old_key+ is not found, does nothing:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!({})
+ *      # => {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :foo)
+ *      # => {foo: 2, bar: 1}
+ *
+ *  Unused keys in +other_hash+ are ignored:
+ *
+ *    h = {foo: 0, bar: 1, baz: 2}
+ *    h.transform_keys!(bat: 3)
+ *    # => {foo: 0, bar: 1, baz: 2}
+ *
+ *  With both argument +other_hash+ and a block given,
+ *  derives keys from +other_hash+, the block, and +self+;
+ *  all, some, or none of the keys in +self+ may be changed.
+ *
+ *  For each pair +old_key+ and +value+ in +self+:
+ *
+ *  - If +other_hash+ has key +old_key+ (with value +new_key+),
+ *    does not call the block for that key;
+ *    removes the entry for +old_key+: <tt>self.delete(old_key)</tt>;
+ *    sets <tt>self[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :BAZ, bar: :BAR, foo: :FOO) {|key| fail 'Not called' }
+ *      # => {FOO: 0, BAR: 1, BAZ: 2}
+ *
+ *  - If +other_hash+ does not have key +old_key+,
+ *    calls the block with +old_key+ and takes its return value as +new_key+;
+ *    removes the entry for +old_key+: <tt>self.delete(old_key)</tt>;
+ *    sets <tt>self[new_key] = value</tt>;
+ *    a duplicate key overwrites:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :BAZ) {|key| key.to_s.reverse }
+ *      # => {"oof" => 0, "rab" => 1, BAZ: 2}
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.transform_keys!(baz: :BAZ) {|key| 'ook' }
+ *      # => {"ook" => 1, BAZ: 2}
  *
- *  Same as Hash#transform_keys but modifies the receiver in place
- *  instead of returning a new hash.
+ *  With no argument and no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values].
  */
 static VALUE
 rb_hash_transform_keys_bang(int argc, VALUE *argv, VALUE hash)
@@ -3343,25 +3456,37 @@ transform_values_foreach_replace(st_data_t *key, st_data_t *value, st_data_t arg
     return ST_CONTINUE;
 }
 
+static VALUE
+transform_values_call(VALUE hash)
+{
+    rb_hash_stlike_foreach_with_replace(hash, transform_values_foreach_func, transform_values_foreach_replace, hash);
+    return hash;
+}
+
+static void
+transform_values(VALUE hash)
+{
+    hash_iter_lev_inc(hash);
+    rb_ensure(transform_values_call, hash, hash_foreach_ensure, hash);
+}
+
 /*
  *  call-seq:
- *    hash.transform_values {|value| ... } -> new_hash
- *    hash.transform_values -> new_enumerator
+ *    transform_values {|value| ... } -> new_hash
+ *    transform_values -> new_enumerator
  *
- *  Returns a new +Hash+ object; each entry has:
- *  * A key from +self+.
- *  * A value provided by the block.
+ *  With a block given, returns a new hash +new_hash+;
+ *  for each pair +key+/+value+ in +self+,
+ *  calls the block with +value+ and captures its return as +new_value+;
+ *  adds to +new_hash+ the entry +key+/+new_value+:
  *
- *  Transform values:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h1 = h.transform_values {|value| value * 100}
- *    h1 # => {:foo=>0, :bar=>100, :baz=>200}
+ *    h1 # => {foo: 0, bar: 100, baz: 200}
  *
- *  Returns a new Enumerator if no block given:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.transform_values # => #<Enumerator: {:foo=>0, :bar=>1, :baz=>2}:transform_values>
- *    h1 = e.each { |value| value * 100}
- *    h1 # => {:foo=>0, :bar=>100, :baz=>200}
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values].
  */
 static VALUE
 rb_hash_transform_values(VALUE hash)
@@ -3373,7 +3498,7 @@ rb_hash_transform_values(VALUE hash)
     SET_DEFAULT(result, Qnil);
 
     if (!RHASH_EMPTY_P(hash)) {
-        rb_hash_stlike_foreach_with_replace(result, transform_values_foreach_func, transform_values_foreach_replace, result);
+        transform_values(result);
         compact_after_delete(result);
     }
 
@@ -3382,18 +3507,24 @@ rb_hash_transform_values(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.transform_values! {|value| ... } -> self
- *    hash.transform_values! -> new_enumerator
+ *    transform_values! {|old_value| ... } -> self
+ *    transform_values! -> new_enumerator
  *
- *  Returns +self+, whose keys are unchanged, and whose values are determined by the given block.
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.transform_values! {|value| value * 100} # => {:foo=>0, :bar=>100, :baz=>200}
  *
- *  Returns a new Enumerator if no block given:
+ *  With a block given, changes the values of +self+ as determined by the block;
+ *  returns +self+.
+ *
+ *  For each entry +key+/+old_value+ in +self+,
+ *  calls the block with +old_value+,
+ *  captures its return value as +new_value+,
+ *  and sets <tt>self[key] = new_value</tt>:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
- *    e = h.transform_values! # => #<Enumerator: {:foo=>0, :bar=>100, :baz=>200}:transform_values!>
- *    h1 = e.each {|value| value * 100}
- *    h1 # => {:foo=>0, :bar=>100, :baz=>200}
+ *    h.transform_values! {|value| value * 100} # => {foo: 0, bar: 100, baz: 200}
+ *
+ *  With no block given, returns a new Enumerator.
+ *
+ *  Related: see {Methods for Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values].
  */
 static VALUE
 rb_hash_transform_values_bang(VALUE hash)
@@ -3402,7 +3533,7 @@ rb_hash_transform_values_bang(VALUE hash)
     rb_hash_modify_check(hash);
 
     if (!RHASH_TABLE_EMPTY_P(hash)) {
-        rb_hash_stlike_foreach_with_replace(hash, transform_values_foreach_func, transform_values_foreach_replace, hash);
+        transform_values(hash);
     }
 
     return hash;
@@ -3417,12 +3548,15 @@ to_a_i(VALUE key, VALUE value, VALUE ary)
 
 /*
  *  call-seq:
- *    hash.to_a -> new_array
+ *    to_a -> new_array
+ *
+ *  Returns all elements of +self+ as an array of 2-element arrays;
+ *  each nested array contains a key-value pair from +self+:
  *
- *  Returns a new Array of 2-element Array objects;
- *  each nested Array contains a key-value pair from +self+:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.to_a # => [[:foo, 0], [:bar, 1], [:baz, 2]]
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 
 static VALUE
@@ -3436,20 +3570,65 @@ rb_hash_to_a(VALUE hash)
     return ary;
 }
 
+static bool
+symbol_key_needs_quote(VALUE str)
+{
+    long len = RSTRING_LEN(str);
+    if (len == 0 || !rb_str_symname_p(str)) return true;
+    const char *s = RSTRING_PTR(str);
+    char first = s[0];
+    if (first == '@' || first == '$' || first == '!') return true;
+    if (!at_char_boundary(s, s + len - 1, RSTRING_END(str), rb_enc_get(str))) return false;
+    switch (s[len - 1]) {
+      case '+':
+      case '-':
+      case '*':
+      case '/':
+      case '`':
+      case '%':
+      case '^':
+      case '&':
+      case '|':
+      case ']':
+      case '<':
+      case '=':
+      case '>':
+      case '~':
+      case '@':
+        return true;
+      default:
+        return false;
+    }
+}
+
 static int
 inspect_i(VALUE key, VALUE value, VALUE str)
 {
     VALUE str2;
 
-    str2 = rb_inspect(key);
+    bool is_symbol = SYMBOL_P(key);
+    bool quote = false;
+    if (is_symbol) {
+        str2 = rb_sym2str(key);
+        quote = symbol_key_needs_quote(str2);
+    }
+    else {
+        str2 = rb_inspect(key);
+    }
     if (RSTRING_LEN(str) > 1) {
         rb_str_buf_cat_ascii(str, ", ");
     }
     else {
         rb_enc_copy(str, str2);
     }
-    rb_str_buf_append(str, str2);
-    rb_str_buf_cat_ascii(str, "=>");
+    if (quote) {
+        rb_str_buf_append(str, rb_str_inspect(str2));
+    }
+    else {
+        rb_str_buf_append(str, str2);
+    }
+
+    rb_str_buf_cat_ascii(str, is_symbol ? ": " : " => ");
     str2 = rb_inspect(value);
     rb_str_buf_append(str, str2);
 
@@ -3471,13 +3650,14 @@ inspect_hash(VALUE hash, VALUE dummy, int recur)
 
 /*
  *  call-seq:
- *    hash.inspect -> new_string
+ *    inspect -> new_string
+ *
+ *  Returns a new string containing the hash entries:
  *
- *  Returns a new String containing the hash entries:
-
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h.inspect # => "{:foo=>0, :bar=>1, :baz=>2}"
+ *    h.inspect # => "{foo: 0, bar: 1, baz: 2}"
  *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 
 static VALUE
@@ -3490,9 +3670,11 @@ rb_hash_inspect(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.to_hash -> self
+ *    to_hash -> self
  *
  *  Returns +self+.
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 static VALUE
 rb_hash_to_hash(VALUE hash)
@@ -3535,21 +3717,22 @@ rb_hash_to_h_block(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.to_h -> self or new_hash
- *    hash.to_h {|key, value| ... } -> new_hash
- *
- *  For an instance of +Hash+, returns +self+.
+ *    to_h {|key, value| ... } -> new_hash
+ *    to_h -> self or new_hash
  *
- *  For a subclass of +Hash+, returns a new +Hash+
- *  containing the content of +self+.
+ *  With a block given, returns a new hash whose content is based on the block;
+ *  the block is called with each entry's key and value;
+ *  the block should return a 2-element array
+ *  containing the key and value to be included in the returned array:
  *
- *  When a block is given, returns a new +Hash+ object
- *  whose content is based on the block;
- *  the block should return a 2-element Array object
- *  specifying the key-value pair to be included in the returned Array:
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h1 = h.to_h {|key, value| [value, key] }
- *    h1 # => {0=>:foo, 1=>:bar, 2=>:baz}
+ *    h.to_h {|key, value| [value, key] }
+ *    # => {0 => :foo, 1 => :bar, 2 => :baz}
+ *
+ *  With no block given, returns +self+ if +self+ is an instance of +Hash+;
+ *  if +self+ is a subclass of +Hash+, returns a new hash containing the content of +self+.
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 
 static VALUE
@@ -3574,11 +3757,14 @@ keys_i(VALUE key, VALUE value, VALUE ary)
 
 /*
  *  call-seq:
- *    hash.keys -> new_array
+ *    keys -> new_array
+ *
+ *  Returns a new array containing all keys in +self+:
  *
- *  Returns a new Array containing all keys in +self+:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.keys # => [:foo, :bar, :baz]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 VALUE
@@ -3618,11 +3804,14 @@ values_i(VALUE key, VALUE value, VALUE ary)
 
 /*
  *  call-seq:
- *    hash.values -> new_array
+ *    values -> new_array
+ *
+ *  Returns a new array containing all values in +self+:
  *
- *  Returns a new Array containing all values in +self+:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.values # => [0, 1, 2]
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 VALUE
@@ -3650,7 +3839,6 @@ rb_hash_values(VALUE hash)
         }
         rb_ary_set_len(values, size);
     }
-
     else {
         rb_hash_foreach(hash, values_i, values);
     }
@@ -3660,12 +3848,15 @@ rb_hash_values(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.include?(key) -> true or false
- *    hash.has_key?(key) -> true or false
- *    hash.key?(key) -> true or false
- *    hash.member?(key) -> true or false
+ *    include?(key) -> true or false
  *
- *  Returns +true+ if +key+ is a key in +self+, otherwise +false+.
+ *  Returns whether +key+ is a key in +self+:
+ *
+ *    h = {foo: 0, bar: 1, baz: 2}
+ *    h.include?(:bar) # => true
+ *    h.include?(:BAR) # => false
+ *
+ *  Related: {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 VALUE
@@ -3688,10 +3879,11 @@ rb_hash_search_value(VALUE key, VALUE value, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.has_value?(value) -> true or false
- *    hash.value?(value) -> true or false
+ *    has_value?(value) -> true or false
+ *
+ *  Returns whether +value+ is a value in +self+.
  *
- *  Returns +true+ if +value+ is a value in +self+, otherwise +false+.
+ *  Related: {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 static VALUE
@@ -3788,21 +3980,25 @@ hash_equal(VALUE hash1, VALUE hash2, int eql)
 
 /*
  *  call-seq:
- *    hash == object -> true or false
+ *    self == other -> true or false
  *
- *  Returns +true+ if all of the following are true:
- *  * +object+ is a +Hash+ object.
- *  * +hash+ and +object+ have the same keys (regardless of order).
- *  * For each key +key+, <tt>hash[key] == object[key]</tt>.
+ *  Returns whether all of the following are true:
  *
- *  Otherwise, returns +false+.
+ *  - +other+ is a +Hash+ object (or can be converted to one).
+ *  - +self+ and +other+ have the same keys (regardless of order).
+ *  - For each key +key+, <tt>self[key] == other[key]</tt>.
  *
- *  Equal:
- *    h1 = {foo: 0, bar: 1, baz: 2}
- *    h2 = {foo: 0, bar: 1, baz: 2}
- *    h1 == h2 # => true
- *    h3 = {baz: 2, bar: 1, foo: 0}
- *    h1 == h3 # => true
+ *  Examples:
+ *
+ *    h =  {foo: 0, bar: 1}
+ *    h == {foo: 0, bar: 1} # => true   # Equal entries (same order)
+ *    h == {bar: 1, foo: 0} # => true   # Equal entries (different order).
+ *    h == 1                            # => false  # Object not a hash.
+ *    h == {}                           # => false  # Different number of entries.
+ *    h == {foo: 0, bat: 1} # => false  # Different key.
+ *    h == {foo: 0, bar: 2} # => false  # Different value.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 
 static VALUE
@@ -3813,12 +4009,13 @@ rb_hash_equal(VALUE hash1, VALUE hash2)
 
 /*
  *  call-seq:
- *    hash.eql?(object) -> true or false
+ *    eql?(object) -> true or false
  *
  *  Returns +true+ if all of the following are true:
- *  * +object+ is a +Hash+ object.
- *  * +hash+ and +object+ have the same keys (regardless of order).
- *  * For each key +key+, <tt>h[key].eql?(object[key])</tt>.
+ *
+ *  - The given +object+ is a +Hash+ object.
+ *  - +self+ and +object+ have the same keys (regardless of order).
+ *  - For each key +key+, <tt>self[key].eql?(object[key])</tt>.
  *
  *  Otherwise, returns +false+.
  *
@@ -3827,6 +4024,8 @@ rb_hash_equal(VALUE hash1, VALUE hash2)
  *    h1.eql? h2 # => true
  *    h3 = {baz: 2, bar: 1, foo: 0}
  *    h1.eql? h3 # => true
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 static VALUE
@@ -3849,16 +4048,19 @@ hash_i(VALUE key, VALUE val, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.hash -> an_integer
+ *    hash -> an_integer
  *
- *  Returns the Integer hash-code for the hash.
+ *  Returns the integer hash-code for the hash.
  *
- *  Two +Hash+ objects have the same hash-code if their content is the same
+ *  Two hashes have the same hash-code if their content is the same
  *  (regardless of order):
+ *
  *    h1 = {foo: 0, bar: 1, baz: 2}
  *    h2 = {baz: 2, bar: 1, foo: 0}
  *    h2.hash == h1.hash # => true
  *    h2.eql? h1 # => true
+ *
+ *  Related: see {Methods for Querying}[rdoc-ref:Hash@Methods+for+Querying].
  */
 
 static VALUE
@@ -3883,17 +4085,21 @@ rb_hash_invert_i(VALUE key, VALUE value, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.invert -> new_hash
+ *    invert -> new_hash
+ *
+ *  Returns a new hash with each key-value pair inverted:
  *
- *  Returns a new +Hash+ object with the each key-value pair inverted:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h1 = h.invert
  *    h1 # => {0=>:foo, 1=>:bar, 2=>:baz}
  *
- *  Overwrites any repeated new keys:
+ *  Overwrites any repeated new keys
  *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]):
+ *
  *    h = {foo: 0, bar: 0, baz: 0}
  *    h.invert # => {0=>:baz}
+ *
+ *  Related: see {Methods for Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values].
  */
 
 static VALUE
@@ -3912,95 +4118,127 @@ rb_hash_update_i(VALUE key, VALUE value, VALUE hash)
     return ST_CONTINUE;
 }
 
+struct update_call_args {
+    VALUE hash, newvalue, *argv;
+    int argc;
+    bool block_given;
+    bool iterating;
+};
+
 static int
 rb_hash_update_block_callback(st_data_t *key, st_data_t *value, struct update_arg *arg, int existing)
 {
-    st_data_t newvalue = arg->arg;
+    VALUE k = (VALUE)*key, v = (VALUE)*value;
+    struct update_call_args *ua = (void *)arg->arg;
+    VALUE newvalue = ua->newvalue, hash = arg->hash;
 
     if (existing) {
-        newvalue = (st_data_t)rb_yield_values(3, (VALUE)*key, (VALUE)*value, (VALUE)newvalue);
+        hash_iter_lev_inc(hash);
+        ua->iterating = true;
+        newvalue = rb_yield_values(3, k, v, newvalue);
+        hash_iter_lev_dec(hash);
+        ua->iterating = false;
     }
-    else if (RHASH_STRING_KEY_P(arg->hash, *key) && !RB_OBJ_FROZEN(*key)) {
-        *key = rb_hash_key_str(*key);
+    else if (RHASH_STRING_KEY_P(hash, k) && !RB_OBJ_FROZEN(k)) {
+        *key = (st_data_t)rb_hash_key_str(k);
     }
-    *value = newvalue;
+    *value = (st_data_t)newvalue;
     return ST_CONTINUE;
 }
 
 NOINSERT_UPDATE_CALLBACK(rb_hash_update_block_callback)
 
 static int
-rb_hash_update_block_i(VALUE key, VALUE value, VALUE hash)
+rb_hash_update_block_i(VALUE key, VALUE value, VALUE args)
 {
-    RHASH_UPDATE(hash, key, rb_hash_update_block_callback, value);
+    struct update_call_args *ua = (void *)args;
+    ua->newvalue = value;
+    RHASH_UPDATE(ua->hash, key, rb_hash_update_block_callback, args);
     return ST_CONTINUE;
 }
 
+static VALUE
+rb_hash_update_call(VALUE args)
+{
+    struct update_call_args *arg = (void *)args;
+
+    for (int i = 0; i < arg->argc; i++){
+        VALUE hash = to_hash(arg->argv[i]);
+        if (arg->block_given) {
+            rb_hash_foreach(hash, rb_hash_update_block_i, args);
+        }
+        else {
+            rb_hash_foreach(hash, rb_hash_update_i, arg->hash);
+        }
+    }
+    return arg->hash;
+}
+
+static VALUE
+rb_hash_update_ensure(VALUE args)
+{
+    struct update_call_args *ua = (void *)args;
+    if (ua->iterating) hash_iter_lev_dec(ua->hash);
+    return Qnil;
+}
+
 /*
  *  call-seq:
- *    hash.merge! -> self
- *    hash.merge!(*other_hashes) -> self
- *    hash.merge!(*other_hashes) { |key, old_value, new_value| ... } -> self
+ *    update(*other_hashes) -> self
+ *    update(*other_hashes) { |key, old_value, new_value| ... } -> self
  *
- *  Merges each of +other_hashes+ into +self+; returns +self+.
+ *  Updates values and/or adds entries to +self+; returns +self+.
  *
- *  Each argument in +other_hashes+ must be a +Hash+.
+ *  Each argument +other_hash+ in +other_hashes+ must be a hash.
  *
- *  With arguments and no block:
- *  * Returns +self+, after the given hashes are merged into it.
- *  * The given hashes are merged left to right.
- *  * Each new entry is added at the end.
- *  * Each duplicate-key entry's value overwrites the previous value.
+ *  With no block given, for each successive entry +key+/+new_value+ in each successive +other_hash+:
  *
- *  Example:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h1 = {bat: 3, bar: 4}
- *    h2 = {bam: 5, bat:6}
- *    h.merge!(h1, h2) # => {:foo=>0, :bar=>4, :baz=>2, :bat=>6, :bam=>5}
+ *  - If +key+ is in +self+, sets <tt>self[key] = new_value</tt>, whose position is unchanged:
  *
- *  With arguments and a block:
- *  * Returns +self+, after the given hashes are merged.
- *  *  The given hashes are merged left to right.
- *  *  Each new-key entry is added at the end.
- *  *  For each duplicate key:
- *     * Calls the block with the key and the old and new values.
- *     * The block's return value becomes the new value for the entry.
+ *      h0 = {foo: 0, bar: 1, baz: 2}
+ *      h1 = {bar: 3, foo: -1}
+ *      h0.update(h1) # => {foo: -1, bar: 3, baz: 2}
  *
- *  Example:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h1 = {bat: 3, bar: 4}
- *    h2 = {bam: 5, bat:6}
- *    h3 = h.merge!(h1, h2) { |key, old_value, new_value| old_value + new_value }
- *    h3 # => {:foo=>0, :bar=>5, :baz=>2, :bat=>9, :bam=>5}
+ *  - If +key+ is not in +self+, adds the entry at the end of +self+:
  *
- *  With no arguments:
- *  * Returns +self+, unmodified.
- *  * The block, if given, is ignored.
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.update({bam: 3, bah: 4}) # => {foo: 0, bar: 1, baz: 2, bam: 3, bah: 4}
  *
- *  Example:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.merge # => {:foo=>0, :bar=>1, :baz=>2}
- *    h1 = h.merge! { |key, old_value, new_value| raise 'Cannot happen' }
- *    h1 # => {:foo=>0, :bar=>1, :baz=>2}
+ *  With a block given, for each successive entry +key+/+new_value+ in each successive +other_hash+:
+ *
+ *  - If +key+ is in +self+, fetches +old_value+ from <tt>self[key]</tt>,
+ *    calls the block with +key+, +old_value+, and +new_value+,
+ *    and sets <tt>self[key] = new_value</tt>, whose position is unchanged  :
+ *
+ *      season = {AB: 75, H: 20, HR: 3, SO: 17, W: 11, HBP: 3}
+ *      today = {AB: 3, H: 1, W: 1}
+ *      yesterday = {AB: 4, H: 2, HR: 1}
+ *      season.update(yesterday, today) {|key, old_value, new_value| old_value + new_value }
+ *      # => {AB: 82, H: 23, HR: 4, SO: 17, W: 12, HBP: 3}
+ *
+ *  - If +key+ is not in +self+, adds the entry at the end of +self+:
+ *
+ *      h = {foo: 0, bar: 1, baz: 2}
+ *      h.update({bat: 3}) { fail 'Cannot happen' }
+ *      # => {foo: 0, bar: 1, baz: 2, bat: 3}
+ *
+ *  Related: see {Methods for Assigning}[rdoc-ref:Hash@Methods+for+Assigning].
  */
 
 static VALUE
 rb_hash_update(int argc, VALUE *argv, VALUE self)
 {
-    int i;
-    bool block_given = rb_block_given_p();
+    struct update_call_args args = {
+        .hash = self,
+        .argv = argv,
+        .argc = argc,
+        .block_given = rb_block_given_p(),
+        .iterating = false,
+    };
+    VALUE arg = (VALUE)&args;
 
     rb_hash_modify(self);
-    for (i = 0; i < argc; i++){
-        VALUE hash = to_hash(argv[i]);
-        if (block_given) {
-            rb_hash_foreach(hash, rb_hash_update_block_i, self);
-        }
-        else {
-            rb_hash_foreach(hash, rb_hash_update_i, self);
-        }
-    }
-    return self;
+    return rb_ensure(rb_hash_update_call, arg, rb_hash_update_ensure, arg);
 }
 
 struct update_func_arg {
@@ -4054,53 +4292,48 @@ rb_hash_update_by(VALUE hash1, VALUE hash2, rb_hash_update_func *func)
 
 /*
  *  call-seq:
- *    hash.merge -> copy_of_self
- *    hash.merge(*other_hashes) -> new_hash
- *    hash.merge(*other_hashes) { |key, old_value, new_value| ... } -> new_hash
- *
- *  Returns the new +Hash+ formed by merging each of +other_hashes+
- *  into a copy of +self+.
+ *    merge(*other_hashes) -> new_hash
+ *    merge(*other_hashes) { |key, old_value, new_value| ... } -> new_hash
  *
- *  Each argument in +other_hashes+ must be a +Hash+.
+ *  Each argument +other_hash+ in +other_hashes+ must be a hash.
  *
- *  ---
+ *  With arguments +other_hashes+ given and no block,
+ *  returns the new hash formed by merging each successive +other_hash+
+ *  into a copy of +self+;
+ *  returns that copy;
+ *  for each successive entry in +other_hash+:
  *
- *  With arguments and no block:
- *  * Returns the new +Hash+ object formed by merging each successive
- *    +Hash+ in +other_hashes+ into +self+.
- *  * Each new-key entry is added at the end.
- *  * Each duplicate-key entry's value overwrites the previous value.
+ *  - For a new key, the entry is added at the end of +self+.
+ *  - For duplicate key, the entry overwrites the entry in +self+,
+ *    whose position is unchanged.
  *
  *  Example:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h1 = {bat: 3, bar: 4}
  *    h2 = {bam: 5, bat:6}
- *    h.merge(h1, h2) # => {:foo=>0, :bar=>4, :baz=>2, :bat=>6, :bam=>5}
+ *    h.merge(h1, h2) # => {foo: 0, bar: 4, baz: 2, bat: 6, bam: 5}
+ *
+ *  With arguments +other_hashes+ and a block given, behaves as above
+ *  except that for a duplicate key
+ *  the overwriting entry takes it value not from the entry in +other_hash+,
+ *  but instead from the block:
  *
- *  With arguments and a block:
- *  * Returns a new +Hash+ object that is the merge of +self+ and each given hash.
- *  * The given hashes are merged left to right.
- *  * Each new-key entry is added at the end.
- *  * For each duplicate key:
- *    * Calls the block with the key and the old and new values.
- *    * The block's return value becomes the new value for the entry.
+ *  - The block is called with the duplicate key and the values
+ *    from both +self+ and +other_hash+.
+ *  - The block's return value becomes the new value for the entry in +self+.
  *
  *  Example:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h1 = {bat: 3, bar: 4}
  *    h2 = {bam: 5, bat:6}
- *    h3 = h.merge(h1, h2) { |key, old_value, new_value| old_value + new_value }
- *    h3 # => {:foo=>0, :bar=>5, :baz=>2, :bat=>9, :bam=>5}
+ *    h.merge(h1, h2) { |key, old_value, new_value| old_value + new_value }
+ *    # => {foo: 0, bar: 5, baz: 2, bat: 9, bam: 5}
  *
- *  With no arguments:
- *  * Returns a copy of +self+.
- *  * The block, if given, is ignored.
+ *  With no arguments, returns a copy of +self+; the block, if given, is ignored.
  *
- *  Example:
- *    h = {foo: 0, bar: 1, baz: 2}
- *    h.merge # => {:foo=>0, :bar=>1, :baz=>2}
- *    h1 = h.merge { |key, old_value, new_value| raise 'Cannot happen' }
- *    h1 # => {:foo=>0, :bar=>1, :baz=>2}
+ *  Related: see {Methods for Assigning}[rdoc-ref:Hash@Methods+for+Assigning].
  */
 
 static VALUE
@@ -4143,13 +4376,17 @@ assoc_i(VALUE key, VALUE val, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.assoc(key) -> new_array or nil
+ *    assoc(key) -> entry or nil
+ *
+ *  If the given +key+ is found, returns its entry as a 2-element array
+ *  containing that key and its value:
  *
- *  If the given +key+ is found, returns a 2-element Array containing that key and its value:
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.assoc(:bar) # => [:bar, 1]
  *
- *  Returns +nil+ if key +key+ is not found.
+ *  Returns +nil+ if the key is not found.
+ *
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -4202,15 +4439,18 @@ rassoc_i(VALUE key, VALUE val, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.rassoc(value) -> new_array or nil
+ *    rassoc(value) -> new_array or nil
+ *
+ *  Searches +self+ for the first entry whose value is <tt>==</tt> to the given +value+;
+ *  see {Entry Order}[rdoc-ref:Hash@Entry+Order].
+ *
+ *  If the entry is found, returns its key and value as a 2-element array;
+ *  returns +nil+ if not found:
  *
- *  Returns a new 2-element Array consisting of the key and value
- *  of the first-found entry whose value is <tt>==</tt> to value
- *  (see {Entry Order}[rdoc-ref:Hash@Entry+Order]):
  *    h = {foo: 0, bar: 1, baz: 1}
  *    h.rassoc(1) # => [:bar, 1]
  *
- *  Returns +nil+ if no such value found.
+ *  Related: see {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -4238,33 +4478,38 @@ flatten_i(VALUE key, VALUE val, VALUE ary)
 
 /*
  *  call-seq:
- *     hash.flatten -> new_array
- *     hash.flatten(level) -> new_array
+ *    flatten(depth = 1) -> new_array
  *
- *  Returns a new Array object that is a 1-dimensional flattening of +self+.
+ *  With positive integer +depth+,
+ *  returns a new array that is a recursive flattening of +self+ to the given +depth+.
  *
- *  ---
+ *  At each level of recursion:
  *
- *  By default, nested Arrays are not flattened:
- *    h = {foo: 0, bar: [:bat, 3], baz: 2}
- *    h.flatten # => [:foo, 0, :bar, [:bat, 3], :baz, 2]
+ *  - Each element whose value is an array is "flattened" (that is, replaced by its individual array elements);
+ *    see Array#flatten.
+ *  - Each element whose value is not an array is unchanged.
+ *    even if the value is an object that has instance method flatten (such as a hash).
  *
- *  Takes the depth of recursive flattening from Integer argument +level+:
- *    h = {foo: 0, bar: [:bat, [:baz, [:bat, ]]]}
- *    h.flatten(1) # => [:foo, 0, :bar, [:bat, [:baz, [:bat]]]]
- *    h.flatten(2) # => [:foo, 0, :bar, :bat, [:baz, [:bat]]]
- *    h.flatten(3) # => [:foo, 0, :bar, :bat, :baz, [:bat]]
- *    h.flatten(4) # => [:foo, 0, :bar, :bat, :baz, :bat]
+ *  Examples; note that entry <tt>foo: {bar: 1, baz: 2}</tt> is never flattened.
  *
- *  When +level+ is negative, flattens all nested Arrays:
- *    h = {foo: 0, bar: [:bat, [:baz, [:bat, ]]]}
- *    h.flatten(-1) # => [:foo, 0, :bar, :bat, :baz, :bat]
- *    h.flatten(-2) # => [:foo, 0, :bar, :bat, :baz, :bat]
+ *   h = {foo: {bar: 1, baz: 2}, bat: [:bam, [:bap, [:bah]]]}
+ *   h.flatten(1) # => [:foo, {bar: 1, baz: 2}, :bat, [:bam, [:bap, [:bah]]]]
+ *   h.flatten(2) # => [:foo, {bar: 1, baz: 2}, :bat, :bam, [:bap, [:bah]]]
+ *   h.flatten(3) # => [:foo, {bar: 1, baz: 2}, :bat, :bam, :bap, [:bah]]
+ *   h.flatten(4) # => [:foo, {bar: 1, baz: 2}, :bat, :bam, :bap, :bah]
+ *   h.flatten(5) # => [:foo, {bar: 1, baz: 2}, :bat, :bam, :bap, :bah]
  *
- *  When +level+ is zero, returns the equivalent of #to_a :
- *    h = {foo: 0, bar: [:bat, 3], baz: 2}
- *    h.flatten(0) # => [[:foo, 0], [:bar, [:bat, 3]], [:baz, 2]]
- *    h.flatten(0) == h.to_a # => true
+ *  With negative integer +depth+,
+ *  flattens all levels:
+ *
+ *    h.flatten(-1) # => [:foo, {bar: 1, baz: 2}, :bat, :bam, :bap, :bah]
+ *
+ *  With +depth+ zero,
+ *  returns the equivalent of #to_a:
+ *
+ *    h.flatten(0) # => [[:foo, {bar: 1, baz: 2}], [:bat, [:bam, [:bap, [:bah]]]]]
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 
 static VALUE
@@ -4311,12 +4556,14 @@ delete_if_nil(VALUE key, VALUE value, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.compact -> new_hash
+ *    compact -> new_hash
  *
  *  Returns a copy of +self+ with all +nil+-valued entries removed:
+ *
  *    h = {foo: 0, bar: nil, baz: 2, bat: nil}
- *    h1 = h.compact
- *    h1 # => {:foo=>0, :baz=>2}
+ *    h.compact # => {foo: 0, baz: 2}
+ *
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -4335,13 +4582,18 @@ rb_hash_compact(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.compact! -> self or nil
+ *    compact! -> self or nil
+ *
+ *  If +self+ contains any +nil+-valued entries,
+ *  returns +self+ with all +nil+-valued entries removed;
+ *  returns +nil+ otherwise:
  *
- *  Returns +self+ with all its +nil+-valued entries removed (in place):
  *    h = {foo: 0, bar: nil, baz: 2, bat: nil}
- *    h.compact! # => {:foo=>0, :baz=>2}
+ *    h.compact!
+ *    h          # => {foo: 0, baz: 2}
+ *    h.compact! # => nil
  *
- *  Returns +nil+ if no entries were removed.
+ *  Related: see {Methods for Deleting}[rdoc-ref:Hash@Methods+for+Deleting].
  */
 
 static VALUE
@@ -4360,30 +4612,28 @@ rb_hash_compact_bang(VALUE hash)
 
 /*
  *  call-seq:
- *    hash.compare_by_identity -> self
+ *    compare_by_identity -> self
  *
- *  Sets +self+ to consider only identity in comparing keys;
- *  two keys are considered the same only if they are the same object;
- *  returns +self+.
+ *  Sets +self+ to compare keys using _identity_ (rather than mere _equality_);
+ *  returns +self+:
+ *
+ *  By default, two keys are considered to be the same key
+ *  if and only if they are _equal_ objects (per method #eql?):
  *
- *  By default, these two object are considered to be the same key,
- *  so +s1+ will overwrite +s0+:
- *    s0 = 'x'
- *    s1 = 'x'
  *    h = {}
- *    h.compare_by_identity? # => false
- *    h[s0] = 0
- *    h[s1] = 1
+ *    h['x'] = 0
+ *    h['x'] = 1 # Overwrites.
  *    h # => {"x"=>1}
  *
- *  After calling \#compare_by_identity, the keys are considered to be different,
- *  and therefore do not overwrite each other:
- *    h = {}
- *    h.compare_by_identity # => {}
- *    h.compare_by_identity? # => true
- *    h[s0] = 0
- *    h[s1] = 1
- *    h # => {"x"=>0, "x"=>1}
+ *  When this method has been called, two keys are considered to be the same key
+ *  if and only if they are the _same_ object:
+ *
+ *    h.compare_by_identity
+ *    h['x'] = 2 # Does not overwrite.
+ *    h # => {"x"=>1, "x"=>2}
+ *
+ *  Related: #compare_by_identity?;
+ *  see also {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 
 VALUE
@@ -4419,18 +4669,28 @@ rb_hash_compare_by_id(VALUE hash)
 
         // We know for sure `identtable` is an st table,
         // so we can skip `ar_force_convert_table` here.
-        RHASH_ST_TABLE_SET(hash, identtable);
+        rb_hash_st_table_set(hash, identtable);
         RHASH_ST_CLEAR(tmp);
     }
 
+    rb_gc_register_pinning_obj(hash);
+
     return hash;
 }
 
 /*
  *  call-seq:
- *    hash.compare_by_identity? -> true or false
+ *    compare_by_identity? -> true or false
  *
- *  Returns +true+ if #compare_by_identity has been called, +false+ otherwise.
+ *  Returns whether #compare_by_identity has been called:
+ *
+ *    h = {}
+ *    h.compare_by_identity? # => false
+ *    h.compare_by_identity
+ *    h.compare_by_identity? # => true
+ *
+ *  Related: #compare_by_identity;
+ *  see also {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 
 VALUE
@@ -4444,6 +4704,7 @@ rb_ident_hash_new(void)
 {
     VALUE hash = rb_hash_new();
     hash_st_table_init(hash, &identhash, 0);
+    rb_gc_register_pinning_obj(hash);
     return hash;
 }
 
@@ -4452,6 +4713,7 @@ rb_ident_hash_new_with_size(st_index_t size)
 {
     VALUE hash = rb_hash_new();
     hash_st_table_init(hash, &identhash, size);
+    rb_gc_register_pinning_obj(hash);
     return hash;
 }
 
@@ -4496,36 +4758,42 @@ any_p_i_pattern(VALUE key, VALUE value, VALUE arg)
 
 /*
  *  call-seq:
- *    hash.any? -> true or false
- *    hash.any?(object) -> true or false
- *    hash.any? {|key, value| ... } -> true or false
+ *    any? -> true or false
+ *    any?(entry) -> true or false
+ *    any? {|key, value| ... } -> true or false
  *
  *  Returns +true+ if any element satisfies a given criterion;
  *  +false+ otherwise.
  *
- *  If +self+ has no element, returns +false+ and argument or block
- *  are not used.
+ *  If +self+ has no element, returns +false+ and argument or block are not used;
+ *  otherwise behaves as below.
  *
  *  With no argument and no block,
- *  returns +true+ if +self+ is non-empty; +false+ if empty.
+ *  returns +true+ if +self+ is non-empty, +false+ otherwise.
  *
- *  With argument +object+ and no block,
+ *  With argument +entry+ and no block,
  *  returns +true+ if for any key +key+
- *  <tt>h.assoc(key) == object</tt>:
+ *  <tt>self.assoc(key) == entry</tt>, +false+ otherwise:
+ *
  *   h = {foo: 0, bar: 1, baz: 2}
+ *   h.assoc(:bar)     # => [:bar, 1]
  *   h.any?([:bar, 1]) # => true
  *   h.any?([:bar, 0]) # => false
- *   h.any?([:baz, 1]) # => false
  *
- *  With no argument and a block,
+ *  With no argument and a block given,
  *  calls the block with each key-value pair;
- *  returns +true+ if the block returns any truthy value,
+ *  returns +true+ if the block returns a truthy value,
  *  +false+ otherwise:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.any? {|key, value| value < 3 } # => true
  *    h.any? {|key, value| value > 3 } # => false
  *
- *  Related: Enumerable#any?
+ *  With both argument +entry+ and a block given,
+ *  issues a warning and ignores the block.
+ *
+ *  Related: Enumerable#any? (which this method overrides);
+ *  see also {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -4559,31 +4827,37 @@ rb_hash_any_p(int argc, VALUE *argv, VALUE hash)
 
 /*
  *  call-seq:
- *    hash.dig(key, *identifiers) -> object
+ *    dig(key, *identifiers) -> object
+ *
+ *  Finds and returns an object found in nested objects,
+ *  as specified by +key+ and +identifiers+.
  *
- *  Finds and returns the object in nested objects
- *  that is specified by +key+ and +identifiers+.
  *  The nested objects may be instances of various classes.
  *  See {Dig Methods}[rdoc-ref:dig_methods.rdoc].
  *
- *  Nested Hashes:
+ *  Nested hashes:
+ *
  *    h = {foo: {bar: {baz: 2}}}
- *    h.dig(:foo) # => {:bar=>{:baz=>2}}
- *    h.dig(:foo, :bar) # => {:baz=>2}
+ *    h.dig(:foo) # => {bar: {baz: 2}}
+ *    h.dig(:foo, :bar) # => {baz: 2}
  *    h.dig(:foo, :bar, :baz) # => 2
  *    h.dig(:foo, :bar, :BAZ) # => nil
  *
- *  Nested Hashes and Arrays:
+ *  Nested hashes and arrays:
+ *
  *    h = {foo: {bar: [:a, :b, :c]}}
  *    h.dig(:foo, :bar, 2) # => :c
  *
- *  This method will use the {default values}[rdoc-ref:Hash@Default+Values]
- *  for keys that are not present:
+ *  If no such object is found,
+ *  returns the {hash default}[rdoc-ref:Hash@Hash+Default]:
+ *
  *    h = {foo: {bar: [:a, :b, :c]}}
  *    h.dig(:hello) # => nil
  *    h.default_proc = -> (hash, _key) { hash }
- *    h.dig(:hello, :world) # => h
- *    h.dig(:hello, :world, :foo, :bar, 2) # => :c
+ *    h.dig(:hello, :world)
+ *    # => {foo: {bar: [:a, :b, :c]}}
+ *
+ *  Related: {Methods for Fetching}[rdoc-ref:Hash@Methods+for+Fetching].
  */
 
 static VALUE
@@ -4618,14 +4892,21 @@ hash_le(VALUE hash1, VALUE hash2)
 
 /*
  *  call-seq:
- *    hash <= other_hash -> true or false
+ *    self <= other -> true or false
  *
- *  Returns +true+ if +hash+ is a subset of +other_hash+, +false+ otherwise:
- *    h1 = {foo: 0, bar: 1}
- *    h2 = {foo: 0, bar: 1, baz: 2}
- *    h1 <= h2 # => true
- *    h2 <= h1 # => false
- *    h1 <= h1 # => true
+ *  Returns whether the entries of +self+ are a subset of the entries of +other+:
+ *
+ *    h0 = {foo: 0, bar: 1}
+ *    h1 = {foo: 0, bar: 1, baz: 2}
+ *    h0 <= h0 # => true
+ *    h0 <= h1 # => true
+ *    h1 <= h0 # => false
+ *
+ *  See {Hash Inclusion}[rdoc-ref:language/hash_inclusion.rdoc].
+ *
+ *  Raises TypeError if +other_hash+ is not a hash and cannot be converted to a hash.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 static VALUE
 rb_hash_le(VALUE hash, VALUE other)
@@ -4637,14 +4918,23 @@ rb_hash_le(VALUE hash, VALUE other)
 
 /*
  *  call-seq:
- *    hash < other_hash -> true or false
+ *    self < other -> true or false
  *
- *  Returns +true+ if +hash+ is a proper subset of +other_hash+, +false+ otherwise:
- *    h1 = {foo: 0, bar: 1}
- *    h2 = {foo: 0, bar: 1, baz: 2}
- *    h1 < h2 # => true
- *    h2 < h1 # => false
- *    h1 < h1 # => false
+ *  Returns whether the entries of +self+ are a proper subset of the entries of +other+:
+ *
+ *    h = {foo: 0, bar: 1}
+ *    h < {foo: 0, bar: 1, baz: 2} # => true   # Proper subset.
+ *    h < {baz: 2, bar: 1, foo: 0} # => true   # Order may differ.
+ *    h < h                        # => false  # Not a proper subset.
+ *    h < {bar: 1, foo: 0}         # => false  # Not a proper subset.
+ *    h < {foo: 0, bat: 1, baz: 2} # => false  # Different key.
+ *    h < {foo: 0, bar: 3, baz: 2} # => false  # Different value.
+ *
+ *  See {Hash Inclusion}[rdoc-ref:language/hash_inclusion.rdoc].
+ *
+ *  Raises TypeError if +other_hash+ is not a hash and cannot be converted to a hash.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 static VALUE
 rb_hash_lt(VALUE hash, VALUE other)
@@ -4656,14 +4946,21 @@ rb_hash_lt(VALUE hash, VALUE other)
 
 /*
  *  call-seq:
- *    hash >= other_hash -> true or false
+ *    self >= other -> true or false
  *
- *  Returns +true+ if +hash+ is a superset of +other_hash+, +false+ otherwise:
- *    h1 = {foo: 0, bar: 1, baz: 2}
- *    h2 = {foo: 0, bar: 1}
- *    h1 >= h2 # => true
- *    h2 >= h1 # => false
- *    h1 >= h1 # => true
+ *  Returns whether the entries of +self+ are a superset of the entries of +other+:
+ *
+ *    h0 = {foo: 0, bar: 1, baz: 2}
+ *    h1 = {foo: 0, bar: 1}
+ *    h0 >= h1 # => true
+ *    h0 >= h0 # => true
+ *    h1 >= h0 # => false
+ *
+ *  See {Hash Inclusion}[rdoc-ref:language/hash_inclusion.rdoc].
+ *
+ *  Raises TypeError if +other_hash+ is not a hash and cannot be converted to a hash.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 static VALUE
 rb_hash_ge(VALUE hash, VALUE other)
@@ -4675,14 +4972,23 @@ rb_hash_ge(VALUE hash, VALUE other)
 
 /*
  *  call-seq:
- *    hash > other_hash -> true or false
+ *    self > other -> true or false
  *
- *  Returns +true+ if +hash+ is a proper superset of +other_hash+, +false+ otherwise:
- *    h1 = {foo: 0, bar: 1, baz: 2}
- *    h2 = {foo: 0, bar: 1}
- *    h1 > h2 # => true
- *    h2 > h1 # => false
- *    h1 > h1 # => false
+ *  Returns whether the entries of +self+ are a proper superset of the entries of +other+:
+ *
+ *    h = {foo: 0, bar: 1, baz: 2}
+ *    h > {foo: 0, bar: 1}         # => true   # Proper superset.
+ *    h > {bar: 1, foo: 0}         # => true   # Order may differ.
+ *    h > h                        # => false  # Not a proper superset.
+ *    h > {baz: 2, bar: 1, foo: 0} # => false  # Not a proper superset.
+ *    h > {foo: 0, bat: 1}         # => false  # Different key.
+ *    h > {foo: 0, bar: 3}         # => false  # Different value.
+ *
+ *  See {Hash Inclusion}[rdoc-ref:language/hash_inclusion.rdoc].
+ *
+ *  Raises TypeError if +other_hash+ is not a hash and cannot be converted to a hash.
+ *
+ *  Related: see {Methods for Comparing}[rdoc-ref:Hash@Methods+for+Comparing].
  */
 static VALUE
 rb_hash_gt(VALUE hash, VALUE other)
@@ -4701,15 +5007,20 @@ hash_proc_call(RB_BLOCK_CALL_FUNC_ARGLIST(key, hash))
 
 /*
  *  call-seq:
- *    hash.to_proc -> proc
+ *    to_proc -> proc
  *
  *  Returns a Proc object that maps a key to its value:
+ *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    proc = h.to_proc
  *    proc.class # => Proc
  *    proc.call(:foo) # => 0
  *    proc.call(:bar) # => 1
  *    proc.call(:nosuch) # => nil
+ *    h.default_proc = proc { |hash, key| "Missing key: #{key}" } # This affect the existing proc object
+ *    proc.call(:nosuch) # => "Missing key: #{nosuch}"
+ *
+ *  Related: see {Methods for Converting}[rdoc-ref:Hash@Methods+for+Converting].
  */
 static VALUE
 rb_hash_to_proc(VALUE hash)
@@ -4727,10 +5038,8 @@ rb_hash_deconstruct_keys(VALUE hash, VALUE keys)
 static int
 add_new_i(st_data_t *key, st_data_t *val, st_data_t arg, int existing)
 {
-    VALUE *args = (VALUE *)arg;
     if (existing) return ST_STOP;
-    RB_OBJ_WRITTEN(args[0], Qundef, (VALUE)*key);
-    RB_OBJ_WRITE(args[0], (VALUE *)val, args[1]);
+    *val = arg;
     return ST_CONTINUE;
 }
 
@@ -4742,22 +5051,25 @@ int
 rb_hash_add_new_element(VALUE hash, VALUE key, VALUE val)
 {
     st_table *tbl;
-    int ret = 0;
-    VALUE args[2];
-    args[0] = hash;
-    args[1] = val;
+    int ret = -1;
 
     if (RHASH_AR_TABLE_P(hash)) {
-        ret = ar_update(hash, (st_data_t)key, add_new_i, (st_data_t)args);
-        if (ret != -1) {
-            return ret;
+        ret = ar_update(hash, (st_data_t)key, add_new_i, (st_data_t)val);
+        if (ret == -1) {
+            ar_force_convert_table(hash, __FILE__, __LINE__);
         }
-        ar_force_convert_table(hash, __FILE__, __LINE__);
     }
 
-    tbl = RHASH_TBL_RAW(hash);
-    return st_update(tbl, (st_data_t)key, add_new_i, (st_data_t)args);
-
+    if (ret == -1) {
+        tbl = RHASH_TBL_RAW(hash);
+        ret = st_update(tbl, (st_data_t)key, add_new_i, (st_data_t)val);
+    }
+    if (!ret) {
+        // Newly inserted
+        RB_OBJ_WRITTEN(hash, Qundef, key);
+        RB_OBJ_WRITTEN(hash, Qundef, val);
+    }
+    return ret;
 }
 
 static st_data_t
@@ -4797,6 +5109,14 @@ rb_hash_bulk_insert(long argc, const VALUE *argv, VALUE hash)
     }
 }
 
+VALUE
+rb_hash_new_with_bulk_insert(long argc, const VALUE *argv)
+{
+    VALUE val = rb_hash_new_with_size(argc / 2);
+    rb_hash_bulk_insert(argc, argv, val);
+    return val;
+}
+
 static char **origenviron;
 #ifdef _WIN32
 #define GET_ENVIRON(e) ((e) = rb_w32_get_environ())
@@ -4824,8 +5144,7 @@ extern char **environ;
 #define ENVNMATCH(s1, s2, n) (memcmp((s1), (s2), (n)) == 0)
 #endif
 
-#define ENV_LOCK()   RB_VM_LOCK_ENTER()
-#define ENV_UNLOCK() RB_VM_LOCK_LEAVE()
+#define ENV_LOCKING() RB_VM_LOCKING()
 
 static inline rb_encoding *
 env_encoding(void)
@@ -4847,28 +5166,27 @@ env_enc_str_new(const char *ptr, long len, rb_encoding *enc)
 }
 
 static VALUE
-env_str_new(const char *ptr, long len)
+env_str_new(const char *ptr, long len, rb_encoding *enc)
 {
-    return env_enc_str_new(ptr, len, env_encoding());
+    return env_enc_str_new(ptr, len, enc);
 }
 
 static VALUE
-env_str_new2(const char *ptr)
+env_str_new2(const char *ptr, rb_encoding *enc)
 {
     if (!ptr) return Qnil;
-    return env_str_new(ptr, strlen(ptr));
+    return env_str_new(ptr, strlen(ptr), enc);
 }
 
 static VALUE
 getenv_with_lock(const char *name)
 {
     VALUE ret;
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         const char *val = getenv(name);
-        ret = env_str_new2(val);
+        ret = env_str_new2(val, enc);
     }
-    ENV_UNLOCK();
     return ret;
 }
 
@@ -4877,11 +5195,9 @@ has_env_with_lock(const char *name)
 {
     const char *val;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         val = getenv(name);
     }
-    ENV_UNLOCK();
 
     return val ? true : false;
 }
@@ -4921,7 +5237,7 @@ env_name(volatile VALUE *s)
 static VALUE env_aset(VALUE nm, VALUE val);
 
 static void
-reset_by_modified_env(const char *nam)
+reset_by_modified_env(const char *nam, const char *val)
 {
     /*
      * ENV['TZ'] = nil has a special meaning.
@@ -4930,7 +5246,7 @@ reset_by_modified_env(const char *nam)
      * This hack might works only on Linux glibc.
      */
     if (ENVMATCH(nam, TZ_ENV)) {
-        ruby_reset_timezone();
+        ruby_reset_timezone(val);
     }
 }
 
@@ -4938,7 +5254,7 @@ static VALUE
 env_delete(VALUE name)
 {
     const char *nam = env_name(name);
-    reset_by_modified_env(nam);
+    reset_by_modified_env(nam, NULL);
     VALUE val = getenv_with_lock(nam);
 
     if (!NIL_P(val)) {
@@ -5031,7 +5347,7 @@ static VALUE
 env_fetch(int argc, VALUE *argv, VALUE _)
 {
     VALUE key;
-    long block_given;
+    int block_given;
     const char *nam;
     VALUE env;
 
@@ -5054,6 +5370,42 @@ env_fetch(int argc, VALUE *argv, VALUE _)
     return env;
 }
 
+/*
+ * call-seq:
+ *   ENV.fetch_values(*names) -> array of values
+ *   ENV.fetch_values(*names) {|name| ... } -> array of values
+ *
+ * Returns an Array containing the environment variable values associated with
+ * the given names:
+ *   ENV.replace('foo' => '0', 'bar' => '1', 'baz' => '2')
+ *   ENV.fetch_values('foo', 'baz') # => ["0", "2"]
+ *
+ * Otherwise if a block is given yields +name+ to
+ * the block and returns the block's return value:
+ *   ENV.fetch_values('foo', 'bam') {|key| key.to_s} # => ["0", "bam"]
+ *
+ * Raises KeyError if +name+ is valid, but not found and block is not given:
+ *   ENV.fetch_values('foo', 'bam') # Raises KeyError (key not found: "bam")
+ *
+ * Returns an empty Array if no names given.
+ *
+ * Raises an exception if any name is invalid.
+ * See {Invalid Names and Values}[rdoc-ref:ENV@Invalid+Names+and+Values].
+ */
+
+static VALUE
+env_fetch_values(int argc, VALUE *argv, VALUE ehash)
+{
+    VALUE result = rb_ary_new2(argc);
+    long i;
+
+    for (i=0; i<argc; i++) {
+        rb_ary_push(result, env_fetch(1, &argv[i], ehash));
+    }
+
+    return result;
+}
+
 #if defined(_WIN32) || (defined(HAVE_SETENV) && defined(HAVE_UNSETENV))
 #elif defined __sun
 static int
@@ -5084,44 +5436,6 @@ envix(const char *nam)
 }
 #endif
 
-#if defined(_WIN32)
-static size_t
-getenvsize(const WCHAR* p)
-{
-    const WCHAR* porg = p;
-    while (*p++) p += lstrlenW(p) + 1;
-    return p - porg + 1;
-}
-
-static size_t
-getenvblocksize(void)
-{
-#ifdef _MAX_ENV
-    return _MAX_ENV;
-#else
-    return 32767;
-#endif
-}
-
-static int
-check_envsize(size_t n)
-{
-    if (_WIN32_WINNT < 0x0600 && rb_w32_osver() < 6) {
-        /* https://msdn.microsoft.com/en-us/library/windows/desktop/ms682653(v=vs.85).aspx */
-        /* Windows Server 2003 and Windows XP: The maximum size of the
-         * environment block for the process is 32,767 characters. */
-        WCHAR* p = GetEnvironmentStringsW();
-        if (!p) return -1; /* never happen */
-        n += getenvsize(p);
-        FreeEnvironmentStringsW(p);
-        if (n >= getenvblocksize()) {
-            return -1;
-        }
-    }
-    return 0;
-}
-#endif
-
 #if defined(_WIN32) || \
   (defined(__sun) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV)))
 
@@ -5147,9 +5461,6 @@ void
 ruby_setenv(const char *name, const char *value)
 {
 #if defined(_WIN32)
-# if defined(MINGW_HAS_SECURE_API) || RUBY_MSVCRT_VERSION >= 80
-#   define HAVE__WPUTENV_S 1
-# endif
     VALUE buf;
     WCHAR *wname;
     WCHAR *wvalue = 0;
@@ -5160,43 +5471,30 @@ ruby_setenv(const char *name, const char *value)
     if (value) {
         int len2;
         len2 = MultiByteToWideChar(CP_UTF8, 0, value, -1, NULL, 0);
-        if (check_envsize((size_t)len + len2)) { /* len and len2 include '\0' */
-            goto fail;  /* 2 for '=' & '\0' */
-        }
         wname = ALLOCV_N(WCHAR, buf, len + len2);
         wvalue = wname + len;
         MultiByteToWideChar(CP_UTF8, 0, name, -1, wname, len);
         MultiByteToWideChar(CP_UTF8, 0, value, -1, wvalue, len2);
-#ifndef HAVE__WPUTENV_S
-        wname[len-1] = L'=';
-#endif
     }
     else {
         wname = ALLOCV_N(WCHAR, buf, len + 1);
         MultiByteToWideChar(CP_UTF8, 0, name, -1, wname, len);
         wvalue = wname + len;
         *wvalue = L'\0';
-#ifndef HAVE__WPUTENV_S
-        wname[len-1] = L'=';
-#endif
     }
 
-    ENV_LOCK();
-    {
-#ifndef HAVE__WPUTENV_S
-        failed = _wputenv(wname);
-#else
+    ENV_LOCKING() {
+        /* Use _wputenv_s() instead of SetEnvironmentVariableW() to make sure
+         * special variables like "TZ" are interpret by libc. */
         failed = _wputenv_s(wname, wvalue);
-#endif
     }
-    ENV_UNLOCK();
 
     ALLOCV_END(buf);
     /* even if putenv() failed, clean up and try to delete the
      * variable from the system area. */
     if (!value || !*value) {
         /* putenv() doesn't handle empty value */
-        if (!SetEnvironmentVariable(name, value) &&
+        if (!SetEnvironmentVariableW(wname, value ? wvalue : NULL) &&
             GetLastError() != ERROR_ENVVAR_NOT_FOUND) goto fail;
     }
     if (failed) {
@@ -5206,28 +5504,22 @@ ruby_setenv(const char *name, const char *value)
 #elif defined(HAVE_SETENV) && defined(HAVE_UNSETENV)
     if (value) {
         int ret;
-        ENV_LOCK();
-        {
+        ENV_LOCKING() {
             ret = setenv(name, value, 1);
         }
-        ENV_UNLOCK();
 
         if (ret) rb_sys_fail_sprintf("setenv(%s)", name);
     }
     else {
 #ifdef VOID_UNSETENV
-        ENV_LOCK();
-        {
+        ENV_LOCKING() {
             unsetenv(name);
         }
-        ENV_UNLOCK();
 #else
         int ret;
-        ENV_LOCK();
-        {
+        ENV_LOCKING() {
             ret = unsetenv(name);
         }
-        ENV_UNLOCK();
 
         if (ret) rb_sys_fail_sprintf("unsetenv(%s)", name);
 #endif
@@ -5250,8 +5542,7 @@ ruby_setenv(const char *name, const char *value)
         snprintf(mem_ptr, mem_size, "%s=%s", name, value);
     }
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         for (env_ptr = GET_ENVIRON(environ); (str = *env_ptr) != 0; ++env_ptr) {
             if (!strncmp(str, name, len) && str[len] == '=') {
                 if (!in_origenv(str)) free(str);
@@ -5260,15 +5551,12 @@ ruby_setenv(const char *name, const char *value)
             }
         }
     }
-    ENV_UNLOCK();
 
     if (value) {
         int ret;
-        ENV_LOCK();
-        {
+        ENV_LOCKING() {
             ret = putenv(mem_ptr);
         }
-        ENV_UNLOCK();
 
         if (ret) {
             free(mem_ptr);
@@ -5279,8 +5567,7 @@ ruby_setenv(const char *name, const char *value)
     size_t len;
     int i;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         i = envix(name);		/* where does it go? */
 
         if (environ == origenviron) {	/* need we copy environment? */
@@ -5321,7 +5608,6 @@ ruby_setenv(const char *name, const char *value)
 
       finish:;
     }
-    ENV_UNLOCK();
 #endif /* WIN32 */
 }
 
@@ -5396,7 +5682,7 @@ env_aset(VALUE nm, VALUE val)
     get_env_ptr(value, val);
 
     ruby_setenv(name, value);
-    reset_by_modified_env(name);
+    reset_by_modified_env(name, value);
     return val;
 }
 
@@ -5406,8 +5692,7 @@ env_keys(int raw)
     rb_encoding *enc = raw ? 0 : rb_locale_encoding();
     VALUE ary = rb_ary_new();
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
             char *s = strchr(*env, '=');
@@ -5421,7 +5706,6 @@ env_keys(int raw)
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return ary;
 }
@@ -5451,8 +5735,7 @@ rb_env_size(VALUE ehash, VALUE args, VALUE eobj)
     char **env;
     long cnt = 0;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         env = GET_ENVIRON(environ);
         for (; *env ; ++env) {
             if (strchr(*env, '=')) {
@@ -5461,7 +5744,6 @@ rb_env_size(VALUE ehash, VALUE args, VALUE eobj)
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return LONG2FIX(cnt);
 }
@@ -5502,20 +5784,19 @@ env_values(void)
 {
     VALUE ary = rb_ary_new();
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
 
         while (*env) {
             char *s = strchr(*env, '=');
             if (s) {
-                rb_ary_push(ary, env_str_new2(s+1));
+                rb_ary_push(ary, env_str_new2(s+1, enc));
             }
             env++;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return ary;
 }
@@ -5596,21 +5877,20 @@ env_each_pair(VALUE ehash)
 
     VALUE ary = rb_ary_new();
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
 
         while (*env) {
             char *s = strchr(*env, '=');
             if (s) {
-                rb_ary_push(ary, env_str_new(*env, s-*env));
-                rb_ary_push(ary, env_str_new2(s+1));
+                rb_ary_push(ary, env_str_new(*env, s-*env, enc));
+                rb_ary_push(ary, env_str_new2(s+1, enc));
             }
             env++;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     if (rb_block_pair_yield_optimizable()) {
         for (i=0; i<RARRAY_LEN(ary); i+=2) {
@@ -5947,30 +6227,27 @@ env_to_s(VALUE _)
 static VALUE
 env_inspect(VALUE _)
 {
-    VALUE i;
     VALUE str = rb_str_buf_new2("{");
+    rb_encoding *enc = env_encoding();
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
-            char *s = strchr(*env, '=');
+            const char *s = strchr(*env, '=');
 
             if (env != environ) {
                 rb_str_buf_cat2(str, ", ");
             }
             if (s) {
-                rb_str_buf_cat2(str, "\"");
-                rb_str_buf_cat(str, *env, s-*env);
-                rb_str_buf_cat2(str, "\"=>");
-                i = rb_inspect(rb_str_new2(s+1));
-                rb_str_buf_append(str, i);
+                rb_str_buf_append(str, rb_str_inspect(env_enc_str_new(*env, s-*env, enc)));
+                rb_str_buf_cat2(str, " => ");
+                s++;
+                rb_str_buf_append(str, rb_str_inspect(env_enc_str_new(s, strlen(s), enc)));
             }
             env++;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     rb_str_buf_cat2(str, "}");
 
@@ -5991,20 +6268,19 @@ env_to_a(VALUE _)
 {
     VALUE ary = rb_ary_new();
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
             char *s = strchr(*env, '=');
             if (s) {
-                rb_ary_push(ary, rb_assoc_new(env_str_new(*env, s-*env),
-                                              env_str_new2(s+1)));
+                rb_ary_push(ary, rb_assoc_new(env_str_new(*env, s-*env, enc),
+                                              env_str_new2(s+1, enc)));
             }
             env++;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return ary;
 }
@@ -6028,13 +6304,11 @@ env_size_with_lock(void)
 {
     int i = 0;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (env[i]) i++;
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return i;
 }
@@ -6070,15 +6344,13 @@ env_empty_p(VALUE _)
 {
     bool empty = true;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         if (env[0] != 0) {
             empty = false;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return RBOOL(empty);
 }
@@ -6167,8 +6439,7 @@ env_has_value(VALUE dmy, VALUE obj)
 
     VALUE ret = Qfalse;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
             char *s = strchr(*env, '=');
@@ -6183,7 +6454,6 @@ env_has_value(VALUE dmy, VALUE obj)
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return ret;
 }
@@ -6210,13 +6480,12 @@ env_rassoc(VALUE dmy, VALUE obj)
 
     VALUE result = Qnil;
 
-    ENV_LOCK();
-    {
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
 
         while (*env) {
             const char *p = *env;
-            char *s = strchr(p, '=');
+            const char *s = strchr(p, '=');
             if (s++) {
                 long len = strlen(s);
                 if (RSTRING_LEN(obj) == len && strncmp(s, RSTRING_PTR(obj), len) == 0) {
@@ -6228,7 +6497,6 @@ env_rassoc(VALUE dmy, VALUE obj)
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return result;
 }
@@ -6255,15 +6523,15 @@ env_key(VALUE dmy, VALUE value)
     StringValue(value);
     VALUE str = Qnil;
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
             char *s = strchr(*env, '=');
             if (s++) {
                 long len = strlen(s);
                 if (RSTRING_LEN(value) == len && strncmp(s, RSTRING_PTR(value), len) == 0) {
-                    str = env_str_new(*env, s-*env-1);
+                    str = env_str_new(*env, s-*env-1, enc);
                     break;
                 }
             }
@@ -6271,7 +6539,6 @@ env_key(VALUE dmy, VALUE value)
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return str;
 }
@@ -6281,20 +6548,19 @@ env_to_hash(void)
 {
     VALUE hash = rb_hash_new();
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         while (*env) {
             char *s = strchr(*env, '=');
             if (s) {
-                rb_hash_aset(hash, env_str_new(*env, s-*env),
-                             env_str_new2(s+1));
+                rb_hash_aset(hash, env_str_new(*env, s-*env, enc),
+                             env_str_new2(s+1, enc));
             }
             env++;
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     return hash;
 }
@@ -6338,7 +6604,7 @@ env_f_to_hash(VALUE _)
  * Each name/value pair in ENV is yielded to the block.
  * The block must return a 2-element Array (name/value pair)
  * that is added to the return Hash as a key and value:
- *   ENV.to_h { |name, value| [name.to_sym, value.to_i] } # => {:bar=>1, :foo=>0}
+ *   ENV.to_h { |name, value| [name.to_sym, value.to_i] } # => {bar: 1, foo: 0}
  * Raises an exception if the block does not return an Array:
  *   ENV.to_h { |name, value| name } # Raises TypeError (wrong element type String (expected array))
  * Raises an exception if the block returns an Array of the wrong size:
@@ -6434,21 +6700,20 @@ env_shift(VALUE _)
     VALUE result = Qnil;
     VALUE key = Qnil;
 
-    ENV_LOCK();
-    {
+    rb_encoding *enc = env_encoding();
+    ENV_LOCKING() {
         char **env = GET_ENVIRON(environ);
         if (*env) {
             const char *p = *env;
-            char *s = strchr(p, '=');
+            const char *s = strchr(p, '=');
             if (s) {
-                key = env_str_new(p, s-p);
-                VALUE val = env_str_new2(getenv(RSTRING_PTR(key)));
+                key = env_str_new(p, s-p, enc);
+                VALUE val = env_str_new2(getenv(RSTRING_PTR(key)), enc);
                 result = rb_assoc_new(key, val);
             }
         }
         FREE_ENVIRON(environ);
     }
-    ENV_UNLOCK();
 
     if (!NIL_P(key)) {
         env_delete(key);
@@ -6659,70 +6924,71 @@ static const rb_data_type_t env_data_type = {
 };
 
 /*
- *  A +Hash+ maps each of its unique keys to a specific value.
+ *  A \Hash object maps each of its unique keys to a specific value.
+ *
+ *  A hash has certain similarities to an Array, but:
  *
- *  A +Hash+ has certain similarities to an Array, but:
- *  - An Array index is always an Integer.
- *  - A +Hash+ key can be (almost) any object.
+ *  - An array index is always an integer.
+ *  - A hash key can be (almost) any object.
  *
- *  === +Hash+ \Data Syntax
+ *  === \Hash \Data Syntax
  *
- *  The older syntax for +Hash+ data uses the "hash rocket," <tt>=></tt>:
+ *  The original syntax for a hash entry uses the "hash rocket," <tt>=></tt>:
  *
  *    h = {:foo => 0, :bar => 1, :baz => 2}
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
- *  Alternatively, but only for a +Hash+ key that's a Symbol,
+ *  Alternatively, but only for a key that's a symbol,
  *  you can use a newer JSON-style syntax,
- *  where each bareword becomes a Symbol:
+ *  where each bareword becomes a symbol:
  *
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
- *  You can also use a String in place of a bareword:
+ *  You can also use a string in place of a bareword:
  *
  *    h = {'foo': 0, 'bar': 1, 'baz': 2}
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
  *  And you can mix the styles:
  *
  *    h = {foo: 0, :bar => 1, 'baz': 2}
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
  *  But it's an error to try the JSON-style syntax
- *  for a key that's not a bareword or a String:
+ *  for a key that's not a bareword or a string:
  *
  *    # Raises SyntaxError (syntax error, unexpected ':', expecting =>):
  *    h = {0: 'zero'}
  *
- *  +Hash+ value can be omitted, meaning that value will be fetched from the context
+ *  The value can be omitted, meaning that value will be fetched from the context
  *  by the name of the key:
  *
  *    x = 0
  *    y = 100
  *    h = {x:, y:}
- *    h # => {:x=>0, :y=>100}
+ *    h # => {x: 0, y: 100}
  *
  *  === Common Uses
  *
- *  You can use a +Hash+ to give names to objects:
+ *  You can use a hash to give names to objects:
  *
  *    person = {name: 'Matz', language: 'Ruby'}
- *    person # => {:name=>"Matz", :language=>"Ruby"}
+ *    person # => {name: "Matz", language: "Ruby"}
  *
- *  You can use a +Hash+ to give names to method arguments:
+ *  You can use a hash to give names to method arguments:
  *
  *    def some_method(hash)
  *      p hash
  *    end
- *    some_method({foo: 0, bar: 1, baz: 2}) # => {:foo=>0, :bar=>1, :baz=>2}
+ *    some_method({foo: 0, bar: 1, baz: 2}) # => {foo: 0, bar: 1, baz: 2}
  *
- *  Note: when the last argument in a method call is a +Hash+,
+ *  Note: when the last argument in a method call is a hash,
  *  the curly braces may be omitted:
  *
- *    some_method(foo: 0, bar: 1, baz: 2) # => {:foo=>0, :bar=>1, :baz=>2}
+ *    some_method(foo: 0, bar: 1, baz: 2) # => {foo: 0, bar: 1, baz: 2}
  *
- *  You can use a +Hash+ to initialize an object:
+ *  You can use a hash to initialize an object:
  *
  *    class Dev
  *      attr_accessor :name, :language
@@ -6734,98 +7000,90 @@ static const rb_data_type_t env_data_type = {
  *    matz = Dev.new(name: 'Matz', language: 'Ruby')
  *    matz # => #<Dev: @name="Matz", @language="Ruby">
  *
- *  === Creating a +Hash+
+ *  === Creating a \Hash
  *
- *  You can create a +Hash+ object explicitly with:
+ *  You can create a \Hash object explicitly with:
  *
  *  - A {hash literal}[rdoc-ref:syntax/literals.rdoc@Hash+Literals].
  *
- *  You can convert certain objects to Hashes with:
+ *  You can convert certain objects to hashes with:
  *
- *  - \Method #Hash.
+ *  - Method Kernel#Hash.
  *
- *  You can create a +Hash+ by calling method Hash.new.
- *
- *  Create an empty +Hash+:
+ *  You can create a hash by calling method Hash.new:
  *
+ *    # Create an empty hash.
  *    h = Hash.new
  *    h # => {}
  *    h.class # => Hash
  *
- *  You can create a +Hash+ by calling method Hash.[].
- *
- *  Create an empty +Hash+:
+ *  You can create a hash by calling method Hash.[]:
  *
+ *    # Create an empty hash.
  *    h = Hash[]
  *    h # => {}
- *
- *  Create a +Hash+ with initial entries:
- *
+ *    # Create a hash with initial entries.
  *    h = Hash[foo: 0, bar: 1, baz: 2]
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
- *  You can create a +Hash+ by using its literal form (curly braces).
- *
- *  Create an empty +Hash+:
+ *  You can create a hash by using its literal form (curly braces):
  *
+ *    # Create an empty hash.
  *    h = {}
  *    h # => {}
- *
- *  Create a +Hash+ with initial entries:
- *
+ *    # Create a +Hash+ with initial entries.
  *    h = {foo: 0, bar: 1, baz: 2}
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
- *
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
- *  === +Hash+ Value Basics
+ *  === \Hash Value Basics
  *
- *  The simplest way to retrieve a +Hash+ value (instance method #[]):
+ *  The simplest way to retrieve a hash value (instance method #[]):
  *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h[:foo] # => 0
  *
- *  The simplest way to create or update a +Hash+ value (instance method #[]=):
+ *  The simplest way to create or update a hash value (instance method #[]=):
  *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h[:bat] = 3 # => 3
- *    h # => {:foo=>0, :bar=>1, :baz=>2, :bat=>3}
+ *    h # => {foo: 0, bar: 1, baz: 2, bat: 3}
  *    h[:foo] = 4 # => 4
- *    h # => {:foo=>4, :bar=>1, :baz=>2, :bat=>3}
+ *    h # => {foo: 4, bar: 1, baz: 2, bat: 3}
  *
- *  The simplest way to delete a +Hash+ entry (instance method #delete):
+ *  The simplest way to delete a hash entry (instance method #delete):
  *
  *    h = {foo: 0, bar: 1, baz: 2}
  *    h.delete(:bar) # => 1
- *    h # => {:foo=>0, :baz=>2}
+ *    h # => {foo: 0, baz: 2}
  *
  *  === Entry Order
  *
- *  A +Hash+ object presents its entries in the order of their creation. This is seen in:
+ *  A \Hash object presents its entries in the order of their creation. This is seen in:
  *
  *  - Iterative methods such as <tt>each</tt>, <tt>each_key</tt>, <tt>each_pair</tt>, <tt>each_value</tt>.
  *  - Other order-sensitive methods such as <tt>shift</tt>, <tt>keys</tt>, <tt>values</tt>.
- *  - The String returned by method <tt>inspect</tt>.
+ *  - The string returned by method <tt>inspect</tt>.
  *
- *  A new +Hash+ has its initial ordering per the given entries:
+ *  A new hash has its initial ordering per the given entries:
  *
  *    h = Hash[foo: 0, bar: 1]
- *    h # => {:foo=>0, :bar=>1}
+ *    h # => {foo: 0, bar: 1}
  *
  *  New entries are added at the end:
  *
  *    h[:baz] = 2
- *    h # => {:foo=>0, :bar=>1, :baz=>2}
+ *    h # => {foo: 0, bar: 1, baz: 2}
  *
  *  Updating a value does not affect the order:
  *
  *    h[:baz] = 3
- *    h # => {:foo=>0, :bar=>1, :baz=>3}
+ *    h # => {foo: 0, bar: 1, baz: 3}
  *
  *  But re-creating a deleted entry can affect the order:
  *
  *    h.delete(:foo)
  *    h[:foo] = 5
- *    h # => {:bar=>1, :baz=>3, :foo=>5}
+ *    h # => {bar: 1, baz: 3, foo: 5}
  *
  *  === +Hash+ Keys
  *
@@ -6875,7 +7133,7 @@ static const rb_data_type_t env_data_type = {
  *
  *  ==== User-Defined +Hash+ Keys
  *
- *  To be useable as a +Hash+ key, objects must implement the methods <code>hash</code> and <code>eql?</code>.
+ *  To be usable as a +Hash+ key, objects must implement the methods <code>hash</code> and <code>eql?</code>.
  *  Note: this requirement does not apply if the +Hash+ uses #compare_by_identity since comparison will then
  *  rely on the keys' object id instead of <code>hash</code> and <code>eql?</code>.
  *
@@ -6918,100 +7176,95 @@ static const rb_data_type_t env_data_type = {
  *
  *    reviews.length #=> 1
  *
- *  === Default Values
+ *  === Key Not Found?
  *
- *  The methods #[], #values_at and #dig need to return the value associated to a certain key.
- *  When that key is not found, that value will be determined by its default proc (if any)
- *  or else its default (initially `nil`).
+ *  When a method tries to retrieve and return the value for a key and that key <i>is found</i>,
+ *  the returned value is the value associated with the key.
  *
- *  You can retrieve the default value with method #default:
+ *  But what if the key <i>is not found</i>?
+ *  In that case, certain methods will return a default value while other will raise a \KeyError.
  *
- *    h = Hash.new
- *    h.default # => nil
+ *  ==== Nil Return Value
  *
- *  You can set the default value by passing an argument to method Hash.new or
- *  with method #default=
+ *  If you want +nil+ returned for a not-found key, you can call:
  *
- *    h = Hash.new(-1)
- *    h.default # => -1
- *    h.default = 0
- *    h.default # => 0
+ *  - #[](key) (usually written as <tt>#[key]</tt>.
+ *  - #assoc(key).
+ *  - #dig(key, *identifiers).
+ *  - #values_at(*keys).
  *
- *  This default value is returned for #[], #values_at and #dig when a key is
- *  not found:
+ *  You can override these behaviors for #[], #dig, and #values_at (but not #assoc);
+ *  see {Hash Default}[rdoc-ref:Hash@Hash+Default].
  *
- *    counts = {foo: 42}
- *    counts.default # => nil (default)
- *    counts[:foo] = 42
- *    counts[:bar] # => nil
- *    counts.default = 0
- *    counts[:bar] # => 0
- *    counts.values_at(:foo, :bar, :baz) # => [42, 0, 0]
- *    counts.dig(:bar) # => 0
+ *  ==== \KeyError
  *
- *  Note that the default value is used without being duplicated. It is not advised to set
- *  the default value to a mutable object:
+ *  If you want KeyError raised for a not-found key, you can call:
  *
- *    synonyms = Hash.new([])
- *    synonyms[:hello] # => []
- *    synonyms[:hello] << :hi # => [:hi], but this mutates the default!
- *    synonyms.default # => [:hi]
- *    synonyms[:world] << :universe
- *    synonyms[:world] # => [:hi, :universe], oops
- *    synonyms.keys # => [], oops
+ *  - #fetch(key).
+ *  - #fetch_values(*keys).
  *
- *  To use a mutable object as default, it is recommended to use a default proc
+ *  ==== \Hash Default
  *
- *  ==== Default Proc
+ *  For certain methods (#[], #dig, and #values_at),
+ *  the return value for a not-found key is determined by two hash properties:
  *
- *  When the default proc for a +Hash+ is set (i.e., not +nil+),
- *  the default value returned by method #[] is determined by the default proc alone.
+ *  - <i>default value</i>: returned by method #default.
+ *  - <i>default proc</i>: returned by method #default_proc.
  *
- *  You can retrieve the default proc with method #default_proc:
+ *  In the simple case, both values are +nil+,
+ *  and the methods return +nil+ for a not-found key;
+ *  see {Nil Return Value}[rdoc-ref:Hash@Nil+Return+Value] above.
  *
- *    h = Hash.new
- *    h.default_proc # => nil
+ *  Note that this entire section ("Hash Default"):
  *
- *  You can set the default proc by calling Hash.new with a block or
- *  calling the method #default_proc=
+ *  - Applies _only_ to methods #[], #dig, and #values_at.
+ *  - Does _not_ apply to methods #assoc, #fetch, or #fetch_values,
+ *    which are not affected by the default value or default proc.
  *
- *    h = Hash.new { |hash, key| "Default value for #{key}" }
- *    h.default_proc.class # => Proc
- *    h.default_proc = proc { |hash, key| "Default value for #{key.inspect}" }
- *    h.default_proc.class # => Proc
+ *  ===== Any-Key Default
  *
- *  When the default proc is set (i.e., not +nil+)
- *  and method #[] is called with with a non-existent key,
- *  #[] calls the default proc with both the +Hash+ object itself and the missing key,
- *  then returns the proc's return value:
+ *  You can define an any-key default for a hash;
+ *  that is, a value that will be returned for _any_ not-found key:
  *
- *    h = Hash.new { |hash, key| "Default value for #{key}" }
- *    h[:nosuch] # => "Default value for nosuch"
+ *  - The value of #default_proc <i>must be</i> +nil+.
+ *  - The value of #default (which may be any object, including +nil+)
+ *    will be returned for a not-found key.
  *
- *  Note that in the example above no entry for key +:nosuch+ is created:
+ *  You can set the default value when the hash is created with Hash.new and option +default_value+,
+ *  or later with method #default=.
  *
- *    h.include?(:nosuch) # => false
+ *  Note: although the value of #default may be any object,
+ *  it may not be a good idea to use a mutable object.
  *
- *  However, the proc itself can add a new entry:
+ *  ===== Per-Key Defaults
  *
- *    synonyms = Hash.new { |hash, key| hash[key] = [] }
- *    synonyms.include?(:hello) # => false
- *    synonyms[:hello] << :hi # => [:hi]
- *    synonyms[:world] << :universe # => [:universe]
- *    synonyms.keys # => [:hello, :world]
+ *  You can define a per-key default for a hash;
+ *  that is, a Proc that will return a value based on the key itself.
  *
- *  Note that setting the default proc will clear the default value and vice versa.
+ *  You can set the default proc when the hash is created with Hash.new and a block,
+ *  or later with method #default_proc=.
  *
- *  Be aware that a default proc that modifies the hash is not thread-safe in the
- *  sense that multiple threads can call into the default proc concurrently for the
- *  same key.
+ *  Note that the proc can modify +self+,
+ *  but modifying +self+ in this way is not thread-safe;
+ *  multiple threads can concurrently call into the default proc
+ *  for the same key.
+ *
+ *  ==== \Method Default
+ *
+ *  For two methods, you can specify a default value for a not-found key
+ *  that has effect only for a single method call
+ *  (and not for any subsequent calls):
+ *
+ *  - For method #fetch, you can specify an any-key default:
+ *  - For either method #fetch or method #fetch_values,
+ *    you can specify a per-key default via a block.
  *
  *  === What's Here
  *
- *  First, what's elsewhere. \Class +Hash+:
+ *  First, what's elsewhere. Class +Hash+:
  *
- *  - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
- *  - Includes {module Enumerable}[rdoc-ref:Enumerable@What-27s+Here],
+ *  - Inherits from {class Object}[rdoc-ref:Object@Whats+Here].
+ *  - Includes {module Enumerable}[rdoc-ref:Enumerable@Whats+Here],
  *    which provides dozens of additional methods.
  *
  *  Here, class +Hash+ provides methods that are useful for:
@@ -7026,9 +7279,8 @@ static const rb_data_type_t env_data_type = {
  *  - {Iterating}[rdoc-ref:Hash@Methods+for+Iterating]
  *  - {Converting}[rdoc-ref:Hash@Methods+for+Converting]
  *  - {Transforming Keys and Values}[rdoc-ref:Hash@Methods+for+Transforming+Keys+and+Values]
- *  - {And more....}[rdoc-ref:Hash@Other+Methods]
  *
- *  \Class +Hash+ also includes methods from module Enumerable.
+ *  Class +Hash+ also includes methods from module Enumerable.
  *
  *  ==== Methods for Creating a +Hash+
  *
@@ -7052,10 +7304,9 @@ static const rb_data_type_t env_data_type = {
  *  - #empty?: Returns whether there are no entries.
  *  - #eql?: Returns whether a given object is equal to +self+.
  *  - #hash: Returns the integer hash code.
- *  - #has_value?: Returns whether a given object is a value in +self+.
- *  - #include?, #has_key?, #member?, #key?: Returns whether a given object is a key in +self+.
- *  - #length, #size: Returns the count of entries.
- *  - #value?: Returns whether a given object is a value in +self+.
+ *  - #has_value? (aliased as #value?): Returns whether a given object is a value in +self+.
+ *  - #include? (aliased as #has_key?, #member?, #key?): Returns whether a given object is a key in +self+.
+ *  - #size (aliased as #length): Returns the count of entries.
  *
  *  ==== Methods for Comparing
  *
@@ -7077,15 +7328,15 @@ static const rb_data_type_t env_data_type = {
  *  - #keys: Returns an array containing all keys in +self+.
  *  - #rassoc: Returns a 2-element array consisting of the key and value
  *    of the first-found entry having a given value.
- *  - #values: Returns an array containing all values in +self+/
+ *  - #values: Returns an array containing all values in +self+.
  *  - #values_at: Returns an array containing values for given keys.
  *
  *  ==== Methods for Assigning
  *
- *  - #[]=, #store: Associates a given key with a given value.
+ *  - #[]= (aliased as #store): Associates a given key with a given value.
  *  - #merge: Returns the hash formed by merging each given hash into a copy of +self+.
- *  - #merge!, #update: Merges each given hash into +self+.
- *  - #replace: Replaces the entire contents of +self+ with the contents of a given hash.
+ *  - #update (aliased as #merge!): Merges each given hash into +self+.
+ *  - #replace (aliased as #initialize_copy): Replaces the entire contents of +self+ with the contents of a given hash.
  *
  *  ==== Methods for Deleting
  *
@@ -7095,7 +7346,7 @@ static const rb_data_type_t env_data_type = {
  *  - #compact!: Removes all +nil+-valued entries from +self+.
  *  - #delete: Removes the entry for a given key.
  *  - #delete_if: Removes entries selected by a given block.
- *  - #filter!, #select!: Keep only those entries selected by a given block.
+ *  - #select! (aliased as #filter!): Keep only those entries selected by a given block.
  *  - #keep_if: Keep only those entries selected by a given block.
  *  - #reject!: Removes entries selected by a given block.
  *  - #shift: Removes and returns the first entry.
@@ -7104,18 +7355,19 @@ static const rb_data_type_t env_data_type = {
  *
  *  - #compact: Returns a copy of +self+ with all +nil+-valued entries removed.
  *  - #except: Returns a copy of +self+ with entries removed for specified keys.
- *  - #filter, #select: Returns a copy of +self+ with only those entries selected by a given block.
+ *  - #select (aliased as #filter): Returns a copy of +self+ with only those entries selected by a given block.
  *  - #reject: Returns a copy of +self+ with entries removed as specified by a given block.
  *  - #slice: Returns a hash containing the entries for given keys.
  *
  *  ==== Methods for Iterating
- *  - #each, #each_pair: Calls a given block with each key-value pair.
+ *  - #each_pair (aliased as #each): Calls a given block with each key-value pair.
  *  - #each_key: Calls a given block with each key.
  *  - #each_value: Calls a given block with each value.
  *
  *  ==== Methods for Converting
  *
- *  - #inspect, #to_s: Returns a new String containing the hash entries.
+ *  - #flatten: Returns an array that is a 1-dimensional flattening of +self+.
+ *  - #inspect (aliased as #to_s): Returns a new String containing the hash entries.
  *  - #to_a: Returns a new array of 2-element arrays;
  *    each nested array contains a key-value pair from +self+.
  *  - #to_h: Returns +self+ if a +Hash+;
@@ -7125,15 +7377,12 @@ static const rb_data_type_t env_data_type = {
  *
  *  ==== Methods for Transforming Keys and Values
  *
+ *  - #invert: Returns a hash with the each key-value pair inverted.
  *  - #transform_keys: Returns a copy of +self+ with modified keys.
  *  - #transform_keys!: Modifies keys in +self+
  *  - #transform_values: Returns a copy of +self+ with modified values.
  *  - #transform_values!: Modifies values in +self+.
  *
- *  ==== Other Methods
- *  - #flatten: Returns an array that is a 1-dimensional flattening of +self+.
- *  - #invert: Returns a hash with the each key-value pair inverted.
- *
  */
 
 void
@@ -7150,9 +7399,9 @@ Init_Hash(void)
     rb_define_alloc_func(rb_cHash, empty_hash_alloc);
     rb_define_singleton_method(rb_cHash, "[]", rb_hash_s_create, -1);
     rb_define_singleton_method(rb_cHash, "try_convert", rb_hash_s_try_convert, 1);
-    rb_define_method(rb_cHash, "initialize", rb_hash_initialize, -1);
     rb_define_method(rb_cHash, "initialize_copy", rb_hash_replace, 1);
     rb_define_method(rb_cHash, "rehash", rb_hash_rehash, 0);
+    rb_define_method(rb_cHash, "freeze", rb_hash_freeze, 0);
 
     rb_define_method(rb_cHash, "to_hash", rb_hash_to_hash, 0);
     rb_define_method(rb_cHash, "to_h", rb_hash_to_h, 0);
@@ -7239,6 +7488,10 @@ Init_Hash(void)
     rb_define_singleton_method(rb_cHash, "ruby2_keywords_hash?", rb_hash_s_ruby2_keywords_hash_p, 1);
     rb_define_singleton_method(rb_cHash, "ruby2_keywords_hash", rb_hash_s_ruby2_keywords_hash, 1);
 
+    rb_cHash_empty_frozen = rb_hash_freeze(rb_hash_alloc_fixed_size(rb_cHash, 0));
+    RB_OBJ_SET_SHAREABLE(rb_cHash_empty_frozen);
+    rb_vm_register_global_object(rb_cHash_empty_frozen);
+
     /* Document-class: ENV
      *
      * +ENV+ is a hash-like accessor for environment variables.
@@ -7320,10 +7573,10 @@ Init_Hash(void)
      *
      * === What's Here
      *
-     * First, what's elsewhere. \Class +ENV+:
+     * First, what's elsewhere. Class +ENV+:
      *
-     * - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
-     * - Extends {module Enumerable}[rdoc-ref:Enumerable@What-27s+Here],
+     * - Inherits from {class Object}[rdoc-ref:Object@Whats+Here].
+     * - Extends {module Enumerable}[rdoc-ref:Enumerable@Whats+Here],
      *
      * Here, class +ENV+ provides methods that are useful for:
      *
@@ -7372,9 +7625,10 @@ Init_Hash(void)
      *
      * - ::assoc: Returns a 2-element array containing the name and value
      *   of the named environment variable if it exists:
-     * - ::clone: Returns +ENV+ (and issues a warning).
+     * - ::clone: Raises an exception.
      * - ::except: Returns a hash of all name/value pairs except those given.
      * - ::fetch: Returns the value for the given name.
+     * - ::fetch_values: Returns array containing the values associated with given names.
      * - ::inspect: Returns the contents of +ENV+ as a string.
      * - ::invert: Returns a hash whose keys are the +ENV+ values,
          and whose values are the corresponding +ENV+ names.
@@ -7406,11 +7660,11 @@ Init_Hash(void)
     origenviron = environ;
     envtbl = TypedData_Wrap_Struct(rb_cObject, &env_data_type, NULL);
     rb_extend_object(envtbl, rb_mEnumerable);
-    FL_SET_RAW(envtbl, RUBY_FL_SHAREABLE);
-
+    RB_OBJ_SET_SHAREABLE(envtbl);
 
     rb_define_singleton_method(envtbl, "[]", rb_f_getenv, 1);
     rb_define_singleton_method(envtbl, "fetch", env_fetch, -1);
+    rb_define_singleton_method(envtbl, "fetch_values", env_fetch_values, -1);
     rb_define_singleton_method(envtbl, "[]=", env_aset_m, 2);
     rb_define_singleton_method(envtbl, "store", env_aset_m, 2);
     rb_define_singleton_method(envtbl, "each", env_each_pair, 0);
@@ -7472,8 +7726,7 @@ Init_Hash(void)
      */
     rb_define_global_const("ENV", envtbl);
 
-    /* for callcc */
-    ruby_register_rollback_func_for_ensure(hash_foreach_ensure, hash_foreach_ensure_rollback);
-
     HASH_ASSERT(sizeof(ar_hint_t) * RHASH_AR_TABLE_MAX_SIZE == sizeof(VALUE));
 }
+
+#include "hash.rbinc"
diff --git a/hash.rb b/hash.rb
new file mode 100644
index 0000000000..40f823783e
--- /dev/null
+++ b/hash.rb
@@ -0,0 +1,40 @@
+class Hash
+  # call-seq:
+  #   Hash.new(default_value = nil, capacity: 0) -> new_hash
+  #   Hash.new(capacity: 0) {|self, key| ... } -> new_hash
+  #
+  # Returns a new empty \Hash object.
+  #
+  # Initializes the values of Hash#default and Hash#default_proc,
+  # which determine the behavior when a given key is not found;
+  # see {Key Not Found?}[rdoc-ref:Hash@Key+Not+Found].
+  #
+  # By default, a hash has +nil+ values for both +default+ and +default_proc+:
+  #
+  #   h = Hash.new        # => {}
+  #   h.default           # => nil
+  #   h.default_proc      # => nil
+  #
+  # With argument +default_value+ given, sets the +default+ value for the hash:
+  #
+  #   h = Hash.new(false) # => {}
+  #   h.default           # => false
+  #   h.default_proc      # => nil
+  #
+  # With a block given, sets the +default_proc+ value:
+  #
+  #   h = Hash.new {|hash, key| "Hash #{hash}: Default value for #{key}" }
+  #   h.default      # => nil
+  #   h.default_proc # => #<Proc:0x00000289b6fa7048 (irb):185>
+  #   h[:nosuch]     # => "Hash {}: Default value for nosuch"
+  #
+  # Raises ArgumentError if both +default_value+ and a block are given.
+  #
+  # If optional keyword argument +capacity+ is given with a positive integer value +n+,
+  # initializes the hash with enough capacity to accommodate +n+ entries without resizing.
+  #
+  # See also {Methods for Creating a Hash}[rdoc-ref:Hash@Methods+for+Creating+a+Hash].
+  def initialize(ifnone = (ifnone_unset = true), capacity: 0, &block)
+    Primitive.rb_hash_init(capacity, ifnone_unset, ifnone, block)
+  end
+end
diff --git a/id_table.c b/id_table.c
index 6bb067d09a..299b7d3ae5 100644
--- a/id_table.c
+++ b/id_table.c
@@ -38,16 +38,9 @@ typedef struct rb_id_item {
     VALUE    val;
 } item_t;
 
-struct rb_id_table {
-    int capa;
-    int num;
-    int used;
-    item_t *items;
-};
-
 #if SIZEOF_VALUE == 8
 #define ITEM_GET_KEY(tbl, i) ((tbl)->items[i].key)
-#define ITEM_KEY_ISSET(tbl, i) ((tbl)->items[i].key)
+#define ITEM_KEY_ISSET(tbl, i) ((tbl)->items && (tbl)->items[i].key)
 #define ITEM_COLLIDED(tbl, i) ((tbl)->items[i].collision)
 #define ITEM_SET_COLLIDED(tbl, i) ((tbl)->items[i].collision = 1)
 static inline void
@@ -80,9 +73,10 @@ round_capa(int capa)
     return (capa + 1) << 2;
 }
 
-static struct rb_id_table *
-rb_id_table_init(struct rb_id_table *tbl, int capa)
+struct rb_id_table *
+rb_id_table_init(struct rb_id_table *tbl, size_t s_capa)
 {
+    int capa = (int)s_capa;
     MEMZERO(tbl, struct rb_id_table, 1);
     if (capa > 0) {
         capa = round_capa(capa);
@@ -96,7 +90,13 @@ struct rb_id_table *
 rb_id_table_create(size_t capa)
 {
     struct rb_id_table *tbl = ALLOC(struct rb_id_table);
-    return rb_id_table_init(tbl, (int)capa);
+    return rb_id_table_init(tbl, capa);
+}
+
+void
+rb_id_table_free_items(struct rb_id_table *tbl)
+{
+    xfree(tbl->items);
 }
 
 void
@@ -291,6 +291,10 @@ rb_id_table_foreach_values(struct rb_id_table *tbl, rb_id_table_foreach_values_f
 {
     int i, capa = tbl->capa;
 
+    if (!tbl->items) {
+        return;
+    }
+
     for (i=0; i<capa; i++) {
         if (ITEM_KEY_ISSET(tbl, i)) {
             enum rb_id_table_iterator_result ret = (*func)(tbl->items[i].val, data);
@@ -324,3 +328,185 @@ rb_id_table_foreach_values_with_replace(struct rb_id_table *tbl, rb_id_table_for
     }
 }
 
+static void
+managed_id_table_free(void *data)
+{
+    struct rb_id_table *tbl = (struct rb_id_table *)data;
+    rb_id_table_free_items(tbl);
+}
+
+static size_t
+managed_id_table_memsize(const void *data)
+{
+    const struct rb_id_table *tbl = (const struct rb_id_table *)data;
+    return rb_id_table_memsize(tbl) - sizeof(struct rb_id_table);
+}
+
+const rb_data_type_t rb_managed_id_table_type = {
+    .wrap_struct_name = "VM/managed_id_table",
+    .function = {
+        .dmark = NULL, // Nothing to mark
+        .dfree = managed_id_table_free,
+        .dsize = managed_id_table_memsize,
+    },
+    .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE,
+};
+
+static inline struct rb_id_table *
+managed_id_table_ptr(VALUE obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, T_DATA));
+    RUBY_ASSERT(rb_typeddata_inherited_p(RTYPEDDATA_TYPE(obj), &rb_managed_id_table_type));
+
+    return RTYPEDDATA_GET_DATA(obj);
+}
+
+VALUE
+rb_managed_id_table_create(const rb_data_type_t *type, size_t capa)
+{
+    struct rb_id_table *tbl;
+    VALUE obj = TypedData_Make_Struct(0, struct rb_id_table, type, tbl);
+    RB_OBJ_SET_SHAREABLE(obj);
+    rb_id_table_init(tbl, capa); // NOTE: this can cause GC, so dmark and dsize need to check tbl->items
+    return obj;
+}
+
+VALUE
+rb_managed_id_table_new(size_t capa)
+{
+    return rb_managed_id_table_create(&rb_managed_id_table_type, capa);
+}
+
+static enum rb_id_table_iterator_result
+managed_id_table_dup_i(ID id, VALUE val, void *data)
+{
+    struct rb_id_table *new_tbl = (struct rb_id_table *)data;
+    rb_id_table_insert(new_tbl, id, val);
+    return ID_TABLE_CONTINUE;
+}
+
+VALUE
+rb_managed_id_table_dup(VALUE old_table)
+{
+    struct rb_id_table *new_tbl;
+    VALUE obj = TypedData_Make_Struct(0, struct rb_id_table, RTYPEDDATA_TYPE(old_table), new_tbl);
+    struct rb_id_table *old_tbl = managed_id_table_ptr(old_table);
+    rb_id_table_init(new_tbl, old_tbl->num + 1);
+    rb_id_table_foreach(old_tbl, managed_id_table_dup_i, new_tbl);
+    return obj;
+}
+
+int
+rb_managed_id_table_lookup(VALUE table, ID id, VALUE *valp)
+{
+    return rb_id_table_lookup(managed_id_table_ptr(table), id, valp);
+}
+
+int
+rb_managed_id_table_insert(VALUE table, ID id, VALUE val)
+{
+    return rb_id_table_insert(managed_id_table_ptr(table), id, val);
+}
+
+size_t
+rb_managed_id_table_size(VALUE table)
+{
+    return rb_id_table_size(managed_id_table_ptr(table));
+}
+
+void
+rb_managed_id_table_foreach(VALUE table, rb_id_table_foreach_func_t *func, void *data)
+{
+    rb_id_table_foreach(managed_id_table_ptr(table), func, data);
+}
+
+void
+rb_managed_id_table_foreach_values(VALUE table, rb_id_table_foreach_values_func_t *func, void *data)
+{
+    rb_id_table_foreach_values(managed_id_table_ptr(table), func, data);
+}
+
+int
+rb_managed_id_table_delete(VALUE table, ID id)
+{
+    return rb_id_table_delete(managed_id_table_ptr(table), id);
+}
+
+static enum rb_id_table_iterator_result
+marked_id_table_mark_i(VALUE val, void *data)
+{
+    rb_gc_mark_movable(val);
+    return ID_TABLE_CONTINUE;
+}
+
+static void
+marked_id_table_mark(void *ptr)
+{
+    struct rb_id_table *tbl = (struct rb_id_table *)ptr;
+    rb_id_table_foreach_values(tbl, marked_id_table_mark_i, NULL);
+}
+
+static enum rb_id_table_iterator_result
+marked_id_table_compact_check_i(VALUE value, void *data)
+{
+    if (rb_gc_location(value) != value) {
+        return ID_TABLE_REPLACE;
+    }
+    return ID_TABLE_CONTINUE;
+}
+
+static enum rb_id_table_iterator_result
+marked_id_table_compact_replace_i(VALUE *value, void *data, int existing)
+{
+    *value = rb_gc_location(*value);
+    return ID_TABLE_CONTINUE;
+}
+
+static void
+marked_id_table_compact(void *ptr)
+{
+    struct rb_id_table *tbl = (struct rb_id_table *)ptr;
+    rb_id_table_foreach_values_with_replace(tbl, marked_id_table_compact_check_i, marked_id_table_compact_replace_i, NULL);
+}
+
+const rb_data_type_t rb_marked_id_table_type = {
+    .wrap_struct_name = "VM/marked_id_table",
+    .function = {
+        .dmark = marked_id_table_mark,
+        .dfree = managed_id_table_free,
+        .dsize = managed_id_table_memsize,
+        .dcompact = marked_id_table_compact,
+    },
+    .parent = &rb_managed_id_table_type,
+    .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE,
+};
+
+VALUE
+rb_marked_id_table_new(size_t capa)
+{
+    return rb_managed_id_table_create(&rb_marked_id_table_type, capa);
+}
+
+int
+rb_marked_id_table_insert(VALUE table, ID id, VALUE val)
+{
+    int result = rb_managed_id_table_insert(table, id, val);
+    RB_OBJ_WRITTEN(table, Qundef, val);
+    return result;
+}
+
+static enum rb_id_table_iterator_result
+marked_id_table_dup_i(VALUE val, void *data)
+{
+    VALUE new_table = (VALUE)data;
+    RB_OBJ_WRITTEN(new_table, Qundef, val);
+    return ID_TABLE_CONTINUE;
+}
+
+VALUE
+rb_marked_id_table_dup(VALUE old_table)
+{
+    VALUE new_table = rb_managed_id_table_dup(old_table);
+    rb_managed_id_table_foreach_values(new_table, marked_id_table_dup_i, (void *)new_table);
+    return new_table;
+}
diff --git a/id_table.h b/id_table.h
index f72e2d1d92..c4333bea98 100644
--- a/id_table.h
+++ b/id_table.h
@@ -4,7 +4,14 @@
 #include <stddef.h>
 #include "ruby/ruby.h"
 
-struct rb_id_table;
+struct rb_id_item;
+
+struct rb_id_table {
+    int capa;
+    int num;
+    int used;
+    struct rb_id_item *items;
+};
 
 /* compatible with ST_* */
 enum rb_id_table_iterator_result {
@@ -16,7 +23,10 @@ enum rb_id_table_iterator_result {
 };
 
 struct rb_id_table *rb_id_table_create(size_t size);
+struct rb_id_table *rb_id_table_init(struct rb_id_table *tbl, size_t capa);
+
 void rb_id_table_free(struct rb_id_table *tbl);
+void rb_id_table_free_items(struct rb_id_table *tbl);
 void rb_id_table_clear(struct rb_id_table *tbl);
 
 size_t rb_id_table_memsize(const struct rb_id_table *tbl);
@@ -32,6 +42,28 @@ void rb_id_table_foreach(struct rb_id_table *tbl, rb_id_table_foreach_func_t *fu
 void rb_id_table_foreach_values(struct rb_id_table *tbl, rb_id_table_foreach_values_func_t *func, void *data);
 void rb_id_table_foreach_values_with_replace(struct rb_id_table *tbl, rb_id_table_foreach_values_func_t *func, rb_id_table_update_value_callback_func_t *replace, void *data);
 
+VALUE rb_managed_id_table_create(const rb_data_type_t *type, size_t capa);
+VALUE rb_managed_id_table_new(size_t capa);
+VALUE rb_managed_id_table_dup(VALUE table);
+int rb_managed_id_table_insert(VALUE table, ID id, VALUE val);
+int rb_managed_id_table_lookup(VALUE table, ID id, VALUE *valp);
+size_t rb_managed_id_table_size(VALUE table);
+void rb_managed_id_table_foreach(VALUE table, rb_id_table_foreach_func_t *func, void *data);
+void rb_managed_id_table_foreach_values(VALUE table, rb_id_table_foreach_values_func_t *func, void *data);
+int rb_managed_id_table_delete(VALUE table, ID id);
+
+extern const rb_data_type_t rb_managed_id_table_type;
+
+VALUE rb_marked_id_table_new(size_t capa);
+int rb_marked_id_table_insert(VALUE table, ID id, VALUE val);
+VALUE rb_marked_id_table_dup(VALUE table);
+
+// alisases
+#define rb_marked_id_table_size             rb_managed_id_table_size
+#define rb_marked_id_table_lookup           rb_managed_id_table_lookup
+#define rb_marked_id_table_foreach          rb_managed_id_table_foreach
+#define rb_marked_id_table_foreach_values   rb_managed_id_table_foreach_values
+
 RUBY_SYMBOL_EXPORT_BEGIN
 size_t rb_id_table_size(const struct rb_id_table *tbl);
 RUBY_SYMBOL_EXPORT_END
diff --git a/imemo.c b/imemo.c
index 23a9a7531f..796e078c89 100644
--- a/imemo.c
+++ b/imemo.c
@@ -3,6 +3,8 @@
 #include "id_table.h"
 #include "internal.h"
 #include "internal/imemo.h"
+#include "internal/object.h"
+#include "internal/st.h"
 #include "vm_callinfo.h"
 
 size_t rb_iseq_memsize(const rb_iseq_t *iseq);
@@ -15,7 +17,6 @@ rb_imemo_name(enum imemo_type type)
     // put no default case to get a warning if an imemo type is missing
     switch (type) {
 #define IMEMO_NAME(x) case imemo_##x: return #x;
-        IMEMO_NAME(ast);
         IMEMO_NAME(callcache);
         IMEMO_NAME(callinfo);
         IMEMO_NAME(constcache);
@@ -25,14 +26,16 @@ rb_imemo_name(enum imemo_type type)
         IMEMO_NAME(iseq);
         IMEMO_NAME(memo);
         IMEMO_NAME(ment);
-        IMEMO_NAME(parser_strterm);
         IMEMO_NAME(svar);
         IMEMO_NAME(throw_data);
         IMEMO_NAME(tmpbuf);
+        IMEMO_NAME(cvar_entry);
+        IMEMO_NAME(fields);
+        IMEMO_NAME(subclasses);
+        IMEMO_NAME(cdhash);
 #undef IMEMO_NAME
-      default:
-        rb_bug("unreachable");
     }
+    rb_bug("unreachable");
 }
 
 /* =========================================================================
@@ -40,85 +43,226 @@ rb_imemo_name(enum imemo_type type)
  * ========================================================================= */
 
 VALUE
-rb_imemo_new(enum imemo_type type, VALUE v0)
+rb_imemo_new(enum imemo_type type, VALUE v0, size_t size, bool is_shareable)
 {
-    size_t size = RVALUE_SIZE;
-    VALUE flags = T_IMEMO | FL_WB_PROTECTED | (type << FL_USHIFT);
-    NEWOBJ_OF(obj, void, v0, flags, size, 0);
-
-    return (VALUE)obj;
+    VALUE flags = T_IMEMO | (type << FL_USHIFT) | (is_shareable ? FL_SHAREABLE : 0);
+    return rb_newobj_of(v0, flags, size);
 }
 
-static rb_imemo_tmpbuf_t *
+VALUE
 rb_imemo_tmpbuf_new(void)
 {
-    size_t size = sizeof(struct rb_imemo_tmpbuf_struct);
     VALUE flags = T_IMEMO | (imemo_tmpbuf << FL_USHIFT);
-    NEWOBJ_OF(obj, struct rb_imemo_tmpbuf_struct, 0, flags, size, 0);
+    UNPROTECTED_NEWOBJ_OF(obj, rb_imemo_tmpbuf_t, 0, flags, sizeof(rb_imemo_tmpbuf_t));
+
+    rb_gc_register_pinning_obj((VALUE)obj);
 
-    return obj;
+    obj->ptr = NULL;
+    obj->size = 0;
+
+    return (VALUE)obj;
 }
 
 void *
-rb_alloc_tmp_buffer_with_count(volatile VALUE *store, size_t size, size_t cnt)
+rb_alloc_tmp_buffer(volatile VALUE *store, long len)
 {
-    void *ptr;
-    rb_imemo_tmpbuf_t *tmpbuf;
+    if (len < 0) {
+        rb_raise(rb_eArgError, "negative buffer size (or size too big)");
+    }
 
     /* Keep the order; allocate an empty imemo first then xmalloc, to
      * get rid of potential memory leak */
-    tmpbuf = rb_imemo_tmpbuf_new();
+    rb_imemo_tmpbuf_t *tmpbuf = (rb_imemo_tmpbuf_t *)rb_imemo_tmpbuf_new();
     *store = (VALUE)tmpbuf;
-    ptr = ruby_xmalloc(size);
+    void *ptr = ruby_xmalloc(len);
     tmpbuf->ptr = ptr;
-    tmpbuf->cnt = cnt;
+    tmpbuf->size = len;
 
     return ptr;
 }
 
 void *
-rb_alloc_tmp_buffer(volatile VALUE *store, long len)
+rb_alloc_tmp_buffer_with_count(volatile VALUE *store, size_t size, size_t cnt)
 {
-    long cnt;
-
-    if (len < 0 || (cnt = (long)roomof(len, sizeof(VALUE))) < 0) {
-        rb_raise(rb_eArgError, "negative buffer size (or size too big)");
-    }
-
-    return rb_alloc_tmp_buffer_with_count(store, len, cnt);
+    return rb_alloc_tmp_buffer(store, (long)size);
 }
 
 void
 rb_free_tmp_buffer(volatile VALUE *store)
 {
+    if (!*store) return;
     rb_imemo_tmpbuf_t *s = (rb_imemo_tmpbuf_t*)ATOMIC_VALUE_EXCHANGE(*store, 0);
     if (s) {
         void *ptr = ATOMIC_PTR_EXCHANGE(s->ptr, 0);
-        s->cnt = 0;
-        ruby_xfree(ptr);
+        long size = s->size;
+        s->size = 0;
+        ruby_xfree_sized(ptr, size);
     }
 }
 
-rb_imemo_tmpbuf_t *
-rb_imemo_tmpbuf_parser_heap(void *buf, rb_imemo_tmpbuf_t *old_heap, size_t cnt)
+struct MEMO *
+rb_imemo_memo_new(VALUE a, VALUE b, long c)
 {
-    rb_imemo_tmpbuf_t *tmpbuf = rb_imemo_tmpbuf_new();
-    tmpbuf->ptr = buf;
-    tmpbuf->next = old_heap;
-    tmpbuf->cnt = cnt;
+    struct MEMO *memo = IMEMO_NEW(struct MEMO, imemo_memo, 0);
 
-    return tmpbuf;
+    *((VALUE *)&memo->v1) = a;
+    *((VALUE *)&memo->v2) = b;
+    memo->u3.cnt = c;
+
+    return memo;
 }
 
-#if IMEMO_DEBUG
-VALUE
-rb_imemo_new_debug(enum imemo_type type, VALUE v0, const char *file, int line)
+struct MEMO *
+rb_imemo_memo_new_value(VALUE a, VALUE b, VALUE c)
 {
-    VALUE memo = rb_imemo_new(type, v0);
-    fprintf(stderr, "memo %p (type: %d) @ %s:%d\n", (void *)memo, imemo_type(memo), file, line);
+    struct MEMO *memo = IMEMO_NEW(struct MEMO, imemo_memo, 0);
+
+    *((VALUE *)&memo->v1) = a;
+    *((VALUE *)&memo->v2) = b;
+    *((VALUE *)&memo->u3.value) = c;
+    memo->flags |= MEMO_U3_IS_VALUE;
+
     return memo;
 }
-#endif
+
+VALUE
+rb_imemo_cdhash_new(size_t size, const struct st_hash_type *type)
+{
+    struct rb_imemo_cdhash *memo = IMEMO_NEW(struct rb_imemo_cdhash, imemo_cdhash, 0);
+    memo->tbl.num_entries = 0;
+    st_init_existing_table_with_size(&memo->tbl, type, size);
+    return (VALUE)memo;
+}
+
+VALUE
+rb_imemo_fields_new(VALUE owner, shape_id_t shape_id, bool shareable)
+{
+    size_t capa = RSHAPE_CAPACITY(shape_id);
+    size_t embedded_size = offsetof(struct rb_fields, as.embed) + capa * sizeof(VALUE);
+    RUBY_ASSERT(rb_gc_size_allocatable_p(embedded_size));
+    VALUE fields = rb_imemo_new(imemo_fields, owner, embedded_size, shareable);
+    // imemo fields objects should always have "RObject" layout.  The
+    // layout in the shape describes the layout of the thing on which it is set.
+    // Imemo fields have the same layout as robject, therefore the layout
+    // should reflect that fact.
+    RBASIC_SET_SHAPE_ID(fields, rb_shape_id_with_robject_layout(shape_id));
+    RUBY_ASSERT(IMEMO_TYPE_P(fields, imemo_fields));
+    return fields;
+}
+
+VALUE
+rb_imemo_fields_new_complex(VALUE owner, shape_id_t shape_id, size_t capa, bool shareable)
+{
+    VALUE fields = rb_imemo_new(imemo_fields, owner, sizeof(struct rb_fields), shareable);
+    IMEMO_OBJ_FIELDS(fields)->as.complex.table = st_init_numtable_with_size(capa);
+    FL_SET_RAW(fields, OBJ_FIELD_HEAP);
+    // imemo fields objects should always have "RObject" layout.  The
+    // layout in the shape describes the layout of the thing on which it is set.
+    // Imemo fields have the same layout as robject, therefore the layout
+    // should reflect that fact.
+    RBASIC_SET_SHAPE_ID(fields, rb_shape_id_with_robject_layout(shape_id));
+    return fields;
+}
+
+static int
+imemo_fields_trigger_wb_i(st_data_t key, st_data_t value, st_data_t arg)
+{
+    VALUE field_obj = (VALUE)arg;
+    RB_OBJ_WRITTEN(field_obj, Qundef, (VALUE)value);
+    return ST_CONTINUE;
+}
+
+static int
+imemo_fields_complex_wb_i(st_data_t key, st_data_t value, st_data_t arg)
+{
+    RB_OBJ_WRITTEN((VALUE)arg, Qundef, (VALUE)value);
+    return ST_CONTINUE;
+}
+
+VALUE
+rb_imemo_fields_new_complex_tbl(VALUE owner, shape_id_t shape_id, st_table *tbl, bool shareable)
+{
+    VALUE fields = rb_imemo_new(imemo_fields, owner, sizeof(struct rb_fields), shareable);
+    IMEMO_OBJ_FIELDS(fields)->as.complex.table = tbl;
+    FL_SET_RAW(fields, OBJ_FIELD_HEAP);
+    // imemo fields objects should always have "RObject" layout.  The
+    // layout in the shape describes the layout of the thing on which it is set.
+    // Imemo fields have the same layout as robject, therefore the layout
+    // should reflect that fact.
+    RBASIC_SET_SHAPE_ID(fields, rb_shape_id_with_robject_layout(shape_id));
+    st_foreach(tbl, imemo_fields_trigger_wb_i, (st_data_t)fields);
+    return fields;
+}
+
+VALUE
+rb_imemo_fields_clone(VALUE fields_obj)
+{
+    shape_id_t shape_id = RBASIC_SHAPE_ID(fields_obj);
+    VALUE clone;
+
+    if (rb_shape_complex_p(shape_id)) {
+        st_table *src_table = rb_imemo_fields_complex_tbl(fields_obj);
+
+        st_table *dest_table = xcalloc(1, sizeof(st_table));
+        clone = rb_imemo_fields_new_complex_tbl(rb_imemo_fields_owner(fields_obj), shape_id, dest_table, false /* TODO: check */);
+
+        st_replace(dest_table, src_table);
+
+        st_foreach(dest_table, imemo_fields_complex_wb_i, (st_data_t)clone);
+    }
+    else {
+        clone = rb_imemo_fields_new(rb_imemo_fields_owner(fields_obj), shape_id, false /* TODO: check */);
+        VALUE *fields = rb_imemo_fields_ptr(clone);
+        attr_index_t fields_count = RSHAPE_LEN(shape_id);
+        MEMCPY(fields, rb_imemo_fields_ptr(fields_obj), VALUE, fields_count);
+        for (attr_index_t i = 0; i < fields_count; i++) {
+            RB_OBJ_WRITTEN(clone, Qundef, fields[i]);
+        }
+    }
+
+    return clone;
+}
+
+void
+rb_imemo_fields_clear(VALUE fields_obj)
+{
+    // When replacing an imemo/fields by another one, we must clear
+    // its shape so that gc.c:obj_free_object_id won't be called.
+    if (rb_obj_shape_complex_p(fields_obj)) {
+        RBASIC_SET_SHAPE_ID(fields_obj, ROOT_COMPLEX_SHAPE_ID);
+    }
+    else {
+        RBASIC_SET_SHAPE_ID(fields_obj, ROOT_SHAPE_ID);
+    }
+    // Invalidate the ec->gen_fields_cache.
+    RBASIC_CLEAR_CLASS(fields_obj);
+}
+
+VALUE
+rb_imemo_subclasses_new(uint32_t capacity)
+{
+    size_t embed_size = offsetof(struct rb_subclasses, as) + capacity * sizeof(VALUE);
+    struct rb_subclasses *subs;
+
+    if (rb_gc_size_allocatable_p(embed_size)) {
+        subs = (struct rb_subclasses *)rb_imemo_new(imemo_subclasses, 0, embed_size, true);
+        subs->count = 0;
+        subs->capacity = capacity;
+        memset(subs->as.embed, 0, capacity * sizeof(VALUE));
+        rb_gc_declare_weak_references((VALUE)subs);
+    }
+    else {
+        subs = (struct rb_subclasses *)rb_imemo_new(imemo_subclasses, 0, sizeof(struct rb_subclasses), true);
+        subs->as.external = NULL;
+        subs->count = 0;
+        subs->capacity = 0;
+        FL_SET_RAW((VALUE)subs, IMEMO_SUBCLASSES_HEAP);
+        rb_gc_declare_weak_references((VALUE)subs);
+        subs->as.external = ZALLOC_N(VALUE, capacity);
+        subs->capacity = capacity;
+    }
+    return (VALUE)subs;
+}
 
 /* =========================================================================
  * memsize
@@ -129,10 +273,6 @@ rb_imemo_memsize(VALUE obj)
 {
     size_t size = 0;
     switch (imemo_type(obj)) {
-      case imemo_ast:
-        rb_bug("imemo_ast is obsolete");
-
-        break;
       case imemo_callcache:
         break;
       case imemo_callinfo:
@@ -157,14 +297,32 @@ rb_imemo_memsize(VALUE obj)
         size += sizeof(((rb_method_entry_t *)obj)->def);
 
         break;
-      case imemo_parser_strterm:
-        break;
       case imemo_svar:
         break;
       case imemo_throw_data:
         break;
       case imemo_tmpbuf:
-        size += ((rb_imemo_tmpbuf_t *)obj)->cnt * sizeof(VALUE);
+        size += ((rb_imemo_tmpbuf_t *)obj)->size;
+
+        break;
+      case imemo_cvar_entry:
+        break;
+      case imemo_fields:
+        if (rb_obj_shape_complex_p(obj)) {
+            size += st_memsize(IMEMO_OBJ_FIELDS(obj)->as.complex.table);
+        }
+
+        break;
+      case imemo_subclasses: {
+        if (FL_TEST_RAW(obj, IMEMO_SUBCLASSES_HEAP)) {
+            struct rb_subclasses *subs = (struct rb_subclasses *)obj;
+            size += subs->capacity * sizeof(VALUE);
+        }
+
+        break;
+      }
+      case imemo_cdhash:
+        size += st_memsize(rb_imemo_cdhash_tbl(obj)) - sizeof(st_table);
 
         break;
       default:
@@ -178,43 +336,10 @@ rb_imemo_memsize(VALUE obj)
  * mark
  * ========================================================================= */
 
-static enum rb_id_table_iterator_result
-cc_table_mark_i(ID id, VALUE ccs_ptr, void *data)
-{
-    struct rb_class_cc_entries *ccs = (struct rb_class_cc_entries *)ccs_ptr;
-    VM_ASSERT(vm_ccs_p(ccs));
-    VM_ASSERT(id == ccs->cme->called_id);
-
-    if (METHOD_ENTRY_INVALIDATED(ccs->cme)) {
-        rb_vm_ccs_free(ccs);
-        return ID_TABLE_DELETE;
-    }
-    else {
-        rb_gc_mark_movable((VALUE)ccs->cme);
-
-        for (int i=0; i<ccs->len; i++) {
-            VM_ASSERT((VALUE)data == ccs->entries[i].cc->klass);
-            VM_ASSERT(vm_cc_check_cme(ccs->entries[i].cc, ccs->cme));
-
-            rb_gc_mark_movable((VALUE)ccs->entries[i].cc);
-        }
-        return ID_TABLE_CONTINUE;
-    }
-}
-
-void
-rb_cc_table_mark(VALUE klass)
-{
-    struct rb_id_table *cc_tbl = RCLASS_CC_TBL(klass);
-    if (cc_tbl) {
-        rb_id_table_foreach(cc_tbl, cc_table_mark_i, (void *)klass);
-    }
-}
-
 static bool
 moved_or_living_object_strictly_p(VALUE obj)
 {
-    return obj && (rb_objspace_markable_object_p(obj) || BUILTIN_TYPE(obj) == T_MOVED);
+    return !SPECIAL_CONST_P(obj) && (!rb_objspace_garbage_object_p(obj) || BUILTIN_TYPE(obj) == T_MOVED);
 }
 
 static void
@@ -246,9 +371,8 @@ mark_and_move_method_entry(rb_method_entry_t *ment, bool reference_updating)
             rb_gc_mark_and_move(&def->body.attr.location);
             break;
           case VM_METHOD_TYPE_BMETHOD:
-            rb_gc_mark_and_move(&def->body.bmethod.proc);
-            if (!reference_updating) {
-                if (def->body.bmethod.hooks) rb_hook_list_mark(def->body.bmethod.hooks);
+            if (!rb_gc_checking_shareable()) {
+                rb_gc_mark_and_move(&def->body.bmethod.proc);
             }
             break;
           case VM_METHOD_TYPE_ALIAS:
@@ -272,49 +396,51 @@ void
 rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
 {
     switch (imemo_type(obj)) {
-      case imemo_ast:
-        rb_bug("imemo_ast is obsolete");
-
-        break;
       case imemo_callcache: {
         /* cc is callcache.
          *
          * cc->klass (klass) should not be marked because if the klass is
          * free'ed, the cc->klass will be cleared by `vm_cc_invalidate()`.
          *
-         * cc->cme (cme) should not be marked because if cc is invalidated
-         * when cme is free'ed.
+         * For "normal" CCs cc->cme (cme) should not be marked because the cc is
+         *   invalidated through the klass when the cme is free'd.
          * - klass marks cme if klass uses cme.
-         * - caller classe's ccs->cme marks cc->cme.
-         * - if cc is invalidated (klass doesn't refer the cc),
-         *   cc is invalidated by `vm_cc_invalidate()` and cc->cme is
-         *   not be accessed.
-         * - On the multi-Ractors, cme will be collected with global GC
+         * - caller class's ccs->cme marks cc->cme.
+         * - if cc is invalidated (klass doesn't refer the cc), cc is
+         *   invalidated by `vm_cc_invalidate()` after which cc->cme must not
+         *   be accessed.
+         * - With multi-Ractors, cme will be collected with global GC
          *   so that it is safe if GC is not interleaving while accessing
          *   cc and cme.
-         * - However, cc_type_super and cc_type_refinement are not chained
-         *   from ccs so cc->cme should be marked; the cme might be
-         *   reachable only through cc in these cases.
+         *
+         * However cc_type_super and cc_type_refinement are not chained
+         *   from ccs so cc->cme should be marked as long as the cc is valid;
+         *   the cme might be reachable only through cc in these cases.
          */
         struct rb_callcache *cc = (struct rb_callcache *)obj;
-        if (reference_updating) {
-            if (!cc->klass) {
-                // already invalidated
+        if (UNDEF_P(cc->klass)) {
+            /* If it's invalidated, we must not mark anything.
+             * All fields should are considered invalid
+             */
+        }
+        else if (reference_updating) {
+            if (moved_or_living_object_strictly_p((VALUE)cc->cme_)) {
+                *((VALUE *)&cc->klass) = rb_gc_location(cc->klass);
+                *((struct rb_callable_method_entry_struct **)&cc->cme_) =
+                    (struct rb_callable_method_entry_struct *)rb_gc_location((VALUE)cc->cme_);
+
+                RUBY_ASSERT(RB_TYPE_P(cc->klass, T_CLASS) || RB_TYPE_P(cc->klass, T_ICLASS));
+                RUBY_ASSERT(IMEMO_TYPE_P((VALUE)cc->cme_, imemo_ment));
             }
             else {
-                if (moved_or_living_object_strictly_p(cc->klass) &&
-                        moved_or_living_object_strictly_p((VALUE)cc->cme_)) {
-                    *((VALUE *)&cc->klass) = rb_gc_location(cc->klass);
-                    *((struct rb_callable_method_entry_struct **)&cc->cme_) =
-                        (struct rb_callable_method_entry_struct *)rb_gc_location((VALUE)cc->cme_);
-                }
-                else {
-                    vm_cc_invalidate(cc);
-                }
+                vm_cc_invalidate(cc);
             }
         }
         else {
-            if (vm_cc_super_p(cc) || vm_cc_refinement_p(cc)) {
+            RUBY_ASSERT(RB_TYPE_P(cc->klass, T_CLASS) || RB_TYPE_P(cc->klass, T_ICLASS));
+            RUBY_ASSERT(IMEMO_TYPE_P((VALUE)cc->cme_, imemo_ment));
+
+            if ((vm_cc_super_p(cc) || vm_cc_refinement_p(cc))) {
                 rb_gc_mark_movable((VALUE)cc->cme_);
             }
         }
@@ -326,16 +452,27 @@ rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
       case imemo_constcache: {
         struct iseq_inline_constant_cache_entry *ice = (struct iseq_inline_constant_cache_entry *)obj;
 
-        rb_gc_mark_and_move(&ice->value);
+        if ((ice->flags & IMEMO_CONST_CACHE_SHAREABLE) ||
+            !rb_gc_checking_shareable()) {
+            rb_gc_mark_and_move(&ice->value);
+        }
 
         break;
       }
       case imemo_cref: {
         rb_cref_t *cref = (rb_cref_t *)obj;
 
-        rb_gc_mark_and_move(&cref->klass_or_self);
+        if (!rb_gc_checking_shareable()) {
+            // cref->klass_or_self can be unshareable, but no way to access it from other ractors
+            rb_gc_mark_and_move(&cref->klass_or_self);
+        }
+
         rb_gc_mark_and_move_ptr(&cref->next);
-        rb_gc_mark_and_move(&cref->refinements);
+
+        // TODO: Ractor and refeinements are not resolved yet
+        if (!rb_gc_checking_shareable()) {
+            rb_gc_mark_and_move(&cref->refinements);
+        }
 
         break;
       }
@@ -353,6 +490,13 @@ rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
 
             rb_gc_mark_and_move_ptr(&env->iseq);
 
+            if (VM_ENV_LOCAL_P(env->ep) && VM_ENV_BOXED_P(env->ep)) {
+                const rb_box_t *box = VM_ENV_BOX(env->ep);
+                if (BOX_USER_P(box)) {
+                    rb_gc_mark_and_move((VALUE *)&box->box_object);
+                }
+            }
+
             if (reference_updating) {
                 ((VALUE *)env->ep)[VM_ENV_DATA_INDEX_ENV] = rb_gc_location(env->ep[VM_ENV_DATA_INDEX_ENV]);
             }
@@ -383,8 +527,8 @@ rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
 
         rb_gc_mark_and_move((VALUE *)&memo->v1);
         rb_gc_mark_and_move((VALUE *)&memo->v2);
-        if (!reference_updating) {
-            rb_gc_mark_maybe(memo->u3.value);
+        if (FL_TEST_RAW(obj, MEMO_U3_IS_VALUE)) {
+            rb_gc_mark_and_move((VALUE *)&memo->u3.value);
         }
 
         break;
@@ -392,8 +536,6 @@ rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
       case imemo_ment:
         mark_and_move_method_entry((rb_method_entry_t *)obj, reference_updating);
         break;
-      case imemo_parser_strterm:
-        break;
       case imemo_svar: {
         struct vm_svar *svar = (struct vm_svar *)obj;
 
@@ -415,13 +557,65 @@ rb_imemo_mark_and_move(VALUE obj, bool reference_updating)
         const rb_imemo_tmpbuf_t *m = (const rb_imemo_tmpbuf_t *)obj;
 
         if (!reference_updating) {
-            do {
-                rb_gc_mark_locations(m->ptr, m->ptr + m->cnt);
-            } while ((m = m->next) != NULL);
+            rb_gc_mark_locations(m->ptr, m->ptr + (m->size / sizeof(VALUE)));
         }
 
         break;
       }
+      case imemo_cvar_entry: {
+          struct rb_cvar_class_tbl_entry *ent = (struct rb_cvar_class_tbl_entry *)obj;
+          rb_gc_mark_and_move(&ent->class_value);
+          rb_gc_mark_and_move((VALUE *)&ent->cref);
+          break;
+      }
+      case imemo_subclasses: {
+        if (reference_updating) {
+            struct rb_subclasses *subs = (struct rb_subclasses *)obj;
+            VALUE *entries = rb_imemo_subclasses_entries(obj);
+            for (uint32_t i = 0; i < subs->count; i++) {
+                if (entries[i]) {
+                    entries[i] = rb_gc_location(entries[i]);
+                }
+            }
+        }
+        break;
+      }
+      case imemo_fields: {
+        rb_gc_mark_and_move((VALUE *)&RBASIC(obj)->klass);
+
+        if (!rb_gc_checking_shareable()) {
+            // imemo_fields can refer unshareable objects
+            // even if the imemo_fields is shareable.
+
+            if (rb_obj_shape_complex_p(obj)) {
+                st_table *tbl = rb_imemo_fields_complex_tbl(obj);
+                if (reference_updating) {
+                    rb_gc_ref_update_table_values_only(tbl);
+                }
+                else {
+                    rb_mark_tbl_no_pin(tbl);
+                }
+            }
+            else {
+                VALUE *fields = rb_imemo_fields_ptr(obj);
+                attr_index_t len = RSHAPE_LEN(RBASIC_SHAPE_ID(obj));
+                for (attr_index_t i = 0; i < len; i++) {
+                    rb_gc_mark_and_move(&fields[i]);
+                }
+            }
+        }
+        break;
+      }
+      case imemo_cdhash: {
+        st_table *tbl = rb_imemo_cdhash_tbl(obj);
+        if (reference_updating) {
+            rb_gc_update_set_refs(tbl);
+        }
+        else {
+            rb_gc_mark_set_no_pin(tbl);
+        }
+        break;
+      }
       default:
         rb_bug("unreachable");
     }
@@ -435,7 +629,7 @@ static enum rb_id_table_iterator_result
 free_const_entry_i(VALUE value, void *data)
 {
     rb_const_entry_t *ce = (rb_const_entry_t *)value;
-    xfree(ce);
+    SIZED_FREE(ce);
     return ID_TABLE_CONTINUE;
 }
 
@@ -446,67 +640,12 @@ rb_free_const_table(struct rb_id_table *tbl)
     rb_id_table_free(tbl);
 }
 
-// alive: if false, target pointers can be freed already.
-static void
-vm_ccs_free(struct rb_class_cc_entries *ccs, int alive, VALUE klass)
-{
-    if (ccs->entries) {
-        for (int i=0; i<ccs->len; i++) {
-            const struct rb_callcache *cc = ccs->entries[i].cc;
-            if (!alive) {
-                void *ptr = asan_unpoison_object_temporary((VALUE)cc);
-                // ccs can be free'ed.
-                if (rb_objspace_markable_object_p((VALUE)cc) &&
-                    IMEMO_TYPE_P(cc, imemo_callcache) &&
-                    cc->klass == klass) {
-                    // OK. maybe target cc.
-                }
-                else {
-                    if (ptr) {
-                        asan_poison_object((VALUE)cc);
-                    }
-                    continue;
-                }
-                if (ptr) {
-                    asan_poison_object((VALUE)cc);
-                }
-            }
-
-            VM_ASSERT(!vm_cc_super_p(cc) && !vm_cc_refinement_p(cc));
-            vm_cc_invalidate(cc);
-        }
-        ruby_xfree(ccs->entries);
-    }
-    ruby_xfree(ccs);
-}
-
-void
-rb_vm_ccs_free(struct rb_class_cc_entries *ccs)
-{
-    RB_DEBUG_COUNTER_INC(ccs_free);
-    vm_ccs_free(ccs, true, Qundef);
-}
-
-static enum rb_id_table_iterator_result
-cc_table_free_i(VALUE ccs_ptr, void *data)
-{
-    struct rb_class_cc_entries *ccs = (struct rb_class_cc_entries *)ccs_ptr;
-    VALUE klass = (VALUE)data;
-    VM_ASSERT(vm_ccs_p(ccs));
-
-    vm_ccs_free(ccs, false, klass);
-
-    return ID_TABLE_CONTINUE;
-}
-
-void
-rb_cc_table_free(VALUE klass)
+static inline void
+imemo_fields_free(struct rb_fields *fields)
 {
-    struct rb_id_table *cc_tbl = RCLASS_CC_TBL(klass);
-
-    if (cc_tbl) {
-        rb_id_table_foreach_values(cc_tbl, cc_table_free_i, (void *)klass);
-        rb_id_table_free(cc_tbl);
+    if (FL_TEST_RAW((VALUE)fields, OBJ_FIELD_HEAP)) {
+        RUBY_ASSERT(rb_shape_complex_p(RBASIC_SHAPE_ID((VALUE)fields)));
+        st_free_table(fields->as.complex.table);
     }
 }
 
@@ -514,10 +653,6 @@ void
 rb_imemo_free(VALUE obj)
 {
     switch (imemo_type(obj)) {
-      case imemo_ast:
-        rb_bug("imemo_ast is obsolete");
-
-        break;
       case imemo_callcache:
         RB_DEBUG_COUNTER_INC(obj_imemo_callcache);
 
@@ -525,10 +660,10 @@ rb_imemo_free(VALUE obj)
       case imemo_callinfo:{
         const struct rb_callinfo *ci = ((const struct rb_callinfo *)obj);
 
-        rb_vm_ci_free(ci);
         if (ci->kwarg) {
-            ((struct rb_callinfo_kwarg *)ci->kwarg)->references--;
-            if (ci->kwarg->references == 0) xfree((void *)ci->kwarg);
+            if (RUBY_ATOMIC_FETCH_SUB(((struct rb_callinfo_kwarg *)ci->kwarg)->references, 1) == 1) {
+                ruby_xfree_sized((void *)ci->kwarg, rb_callinfo_kwarg_bytes(ci->kwarg->keyword_len));
+            }
         }
         RB_DEBUG_COUNTER_INC(obj_imemo_callinfo);
 
@@ -546,7 +681,7 @@ rb_imemo_free(VALUE obj)
         rb_env_t *env = (rb_env_t *)obj;
 
         RUBY_ASSERT(VM_ENV_ESCAPED_P(env->ep));
-        xfree((VALUE *)env->env);
+        SIZED_FREE_N(env->env, env->env_size);
         RB_DEBUG_COUNTER_INC(obj_imemo_env);
 
         break;
@@ -568,22 +703,41 @@ rb_imemo_free(VALUE obj)
         RB_DEBUG_COUNTER_INC(obj_imemo_ment);
 
         break;
-      case imemo_parser_strterm:
-        RB_DEBUG_COUNTER_INC(obj_imemo_parser_strterm);
-
-        break;
       case imemo_svar:
         RB_DEBUG_COUNTER_INC(obj_imemo_svar);
+
         break;
       case imemo_throw_data:
         RB_DEBUG_COUNTER_INC(obj_imemo_throw_data);
 
         break;
       case imemo_tmpbuf:
-        xfree(((rb_imemo_tmpbuf_t *)obj)->ptr);
+        ruby_xfree_sized(((rb_imemo_tmpbuf_t *)obj)->ptr, ((rb_imemo_tmpbuf_t *)obj)->size);
         RB_DEBUG_COUNTER_INC(obj_imemo_tmpbuf);
 
         break;
+      case imemo_cvar_entry:
+        RB_DEBUG_COUNTER_INC(obj_imemo_cvar_entry);
+
+        break;
+      case imemo_fields:
+        imemo_fields_free(IMEMO_OBJ_FIELDS(obj));
+        RB_DEBUG_COUNTER_INC(obj_imemo_fields);
+
+        break;
+      case imemo_subclasses: {
+        if (FL_TEST_RAW(obj, IMEMO_SUBCLASSES_HEAP)) {
+            struct rb_subclasses *subs = (struct rb_subclasses *)obj;
+            SIZED_FREE_N(subs->as.external, subs->capacity);
+        }
+        RB_DEBUG_COUNTER_INC(obj_imemo_subclasses);
+        break;
+      }
+      case imemo_cdhash:
+        st_free_embedded_table(rb_imemo_cdhash_tbl(obj));
+        RB_DEBUG_COUNTER_INC(obj_imemo_cdhash);
+
+        break;
       default:
         rb_bug("unreachable");
     }
diff --git a/include/ruby/assert.h b/include/ruby/assert.h
index e9edd9e640..acc5e5bbfc 100644
--- a/include/ruby/assert.h
+++ b/include/ruby/assert.h
@@ -298,17 +298,19 @@ RBIMPL_WARNING_IGNORED(-Wgnu-zero-variadic-macro-arguments)
  * @copydetails #RUBY_ASSERT
  */
 #if RUBY_DEBUG
-# define RBIMPL_ASSERT_OR_ASSUME(expr) RUBY_ASSERT_ALWAYS(expr)
+# define RBIMPL_ASSERT_OR_ASSUME RUBY_ASSERT_ALWAYS
+#elif ! defined(RBIMPL_VA_OPT_ARGS)
+# define RBIMPL_ASSERT_OR_ASSUME(expr) RBIMPL_ASSUME(expr)
 #elif RBIMPL_COMPILER_BEFORE(Clang, 7, 0, 0)
 # /* See commit 67d259c5dccd31fe49d417fec169977712ffdf10 */
-# define RBIMPL_ASSERT_OR_ASSUME(expr) RBIMPL_ASSERT_NOTHING
+# define RBIMPL_ASSERT_OR_ASSUME(...) RBIMPL_ASSERT_NOTHING
 #elif defined(RUBY_ASSERT_NOASSUME)
 # /* See commit d300a734414ef6de7e8eb563b7cc4389c455ed08 */
-# define RBIMPL_ASSERT_OR_ASSUME(expr) RBIMPL_ASSERT_NOTHING
+# define RBIMPL_ASSERT_OR_ASSUME(...) RBIMPL_ASSERT_NOTHING
 #elif ! defined(RBIMPL_HAVE___ASSUME)
-# define RBIMPL_ASSERT_OR_ASSUME(expr) RBIMPL_ASSERT_NOTHING
+# define RBIMPL_ASSERT_OR_ASSUME(...) RBIMPL_ASSERT_NOTHING
 #else
-# define RBIMPL_ASSERT_OR_ASSUME(expr) RBIMPL_ASSUME(expr)
+# define RBIMPL_ASSERT_OR_ASSUME(expr, ...) RBIMPL_ASSUME(expr)
 #endif
 
 #endif /* RUBY_ASSERT_H */
diff --git a/include/ruby/atomic.h b/include/ruby/atomic.h
index 043a6a9945..fcc48f532c 100644
--- a/include/ruby/atomic.h
+++ b/include/ruby/atomic.h
@@ -34,7 +34,7 @@
 # include <sys/types.h>         /* ssize_t */
 #endif
 
-#if RBIMPL_COMPILER_SINCE(MSVC, 13, 0, 0)
+#if RBIMPL_COMPILER_IS(MSVC)
 # pragma intrinsic(_InterlockedOr)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
 # include <atomic.h>
@@ -72,13 +72,40 @@ typedef unsigned int rb_atomic_t;
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
 typedef unsigned int rb_atomic_t;
 #elif defined(_WIN32)
+# include <winsock2.h>       // to prevent macro redefinitions
+# include <windows.h>        // for `LONG` and `Interlocked` functions
 typedef LONG rb_atomic_t;
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
 typedef unsigned int rb_atomic_t;
+#elif defined(HAVE_STDATOMIC_H)
+# include <stdatomic.h>
+typedef unsigned int rb_atomic_t;
 #else
 # error No atomic operation found
 #endif
 
+/* Memory ordering constants */
+#if defined(HAVE_GCC_ATOMIC_BUILTINS)
+# define RBIMPL_ATOMIC_RELAXED __ATOMIC_RELAXED
+# define RBIMPL_ATOMIC_ACQUIRE __ATOMIC_ACQUIRE
+# define RBIMPL_ATOMIC_RELEASE __ATOMIC_RELEASE
+# define RBIMPL_ATOMIC_ACQ_REL __ATOMIC_ACQ_REL
+# define RBIMPL_ATOMIC_SEQ_CST __ATOMIC_SEQ_CST
+#elif defined(HAVE_STDATOMIC_H)
+# define RBIMPL_ATOMIC_RELAXED memory_order_relaxed
+# define RBIMPL_ATOMIC_ACQUIRE memory_order_acquire
+# define RBIMPL_ATOMIC_RELEASE memory_order_release
+# define RBIMPL_ATOMIC_ACQ_REL memory_order_acq_rel
+# define RBIMPL_ATOMIC_SEQ_CST memory_order_seq_cst
+#else
+/* Dummy values for unsupported platforms */
+# define RBIMPL_ATOMIC_RELAXED 0
+# define RBIMPL_ATOMIC_ACQUIRE 1
+# define RBIMPL_ATOMIC_RELEASE 2
+# define RBIMPL_ATOMIC_ACQ_REL 3
+# define RBIMPL_ATOMIC_SEQ_CST 4
+#endif
+
 /**
  * Atomically replaces the  value pointed by `var` with the  result of addition
  * of `val` to the old value of `var`.
@@ -88,7 +115,7 @@ typedef unsigned int rb_atomic_t;
  * @return  What was stored in `var` before the addition.
  * @post    `var` holds `var + val`.
  */
-#define RUBY_ATOMIC_FETCH_ADD(var, val) rbimpl_atomic_fetch_add(&(var), (val))
+#define RUBY_ATOMIC_FETCH_ADD(var, val) rbimpl_atomic_fetch_add(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomically  replaces  the  value  pointed   by  `var`  with  the  result  of
@@ -99,7 +126,7 @@ typedef unsigned int rb_atomic_t;
  * @return  What was stored in `var` before the subtraction.
  * @post    `var` holds `var - val`.
  */
-#define RUBY_ATOMIC_FETCH_SUB(var, val) rbimpl_atomic_fetch_sub(&(var), (val))
+#define RUBY_ATOMIC_FETCH_SUB(var, val) rbimpl_atomic_fetch_sub(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomically  replaces  the  value  pointed   by  `var`  with  the  result  of
@@ -111,7 +138,7 @@ typedef unsigned int rb_atomic_t;
  * @post    `var` holds `var | val`.
  * @note    For portability, this macro can return void.
  */
-#define RUBY_ATOMIC_OR(var, val) rbimpl_atomic_or(&(var), (val))
+#define RUBY_ATOMIC_OR(var, val) rbimpl_atomic_or(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomically replaces the value pointed by  `var` with `val`.  This is just an
@@ -122,7 +149,7 @@ typedef unsigned int rb_atomic_t;
  * @return  What was stored in `var` before the assignment.
  * @post    `var` holds `val`.
  */
-#define RUBY_ATOMIC_EXCHANGE(var, val) rbimpl_atomic_exchange(&(var), (val))
+#define RUBY_ATOMIC_EXCHANGE(var, val) rbimpl_atomic_exchange(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomic compare-and-swap.   This stores  `val` to  `var` if  and only  if the
@@ -136,7 +163,7 @@ typedef unsigned int rb_atomic_t;
  * @retval  otherwise  Something else is at `var`; not updated.
  */
 #define RUBY_ATOMIC_CAS(var, oldval, newval) \
-    rbimpl_atomic_cas(&(var), (oldval), (newval))
+    rbimpl_atomic_cas(&(var), (oldval), (newval), RBIMPL_ATOMIC_SEQ_CST, RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomic load. This loads `var` with an atomic intrinsic and returns
@@ -145,7 +172,7 @@ typedef unsigned int rb_atomic_t;
  * @param var  A variable of ::rb_atomic_t
  * @return     What was stored in `var`j
  */
-#define RUBY_ATOMIC_LOAD(var) rbimpl_atomic_load(&(var))
+#define RUBY_ATOMIC_LOAD(var) rbimpl_atomic_load(&(var), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_EXCHANGE, except for the return type.
@@ -155,7 +182,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `val`.
  */
-#define RUBY_ATOMIC_SET(var, val) rbimpl_atomic_set(&(var), (val))
+#define RUBY_ATOMIC_SET(var, val) rbimpl_atomic_store(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_FETCH_ADD, except for the return type.
@@ -165,7 +192,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var + val`.
  */
-#define RUBY_ATOMIC_ADD(var, val) rbimpl_atomic_add(&(var), (val))
+#define RUBY_ATOMIC_ADD(var, val) rbimpl_atomic_add(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_FETCH_SUB, except for the return type.
@@ -175,7 +202,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var - val`.
  */
-#define RUBY_ATOMIC_SUB(var, val) rbimpl_atomic_sub(&(var), (val))
+#define RUBY_ATOMIC_SUB(var, val) rbimpl_atomic_sub(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomically increments the value pointed by `var`.
@@ -184,7 +211,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var + 1`.
  */
-#define RUBY_ATOMIC_INC(var) rbimpl_atomic_inc(&(var))
+#define RUBY_ATOMIC_INC(var) rbimpl_atomic_inc(&(var), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Atomically decrements the value pointed by `var`.
@@ -193,7 +220,19 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var - 1`.
  */
-#define RUBY_ATOMIC_DEC(var) rbimpl_atomic_dec(&(var))
+#define RUBY_ATOMIC_DEC(var) rbimpl_atomic_dec(&(var), RBIMPL_ATOMIC_SEQ_CST)
+
+/**
+ * Identical to #RUBY_ATOMIC_FETCH_ADD,  except it expects its arguments to be `size_t`.
+ * There are cases where ::rb_atomic_t is  32bit while `size_t` is 64bit.  This
+ * should be used for size related operations to support such platforms.
+ *
+ * @param   var  A variable of `size_t`.
+ * @param   val  Value to add.
+ * @return  What was stored in `var` before the addition.
+ * @post    `var` holds `var + val`.
+ */
+#define RUBY_ATOMIC_SIZE_FETCH_ADD(var, val) rbimpl_atomic_size_fetch_add(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_INC,  except it expects its  argument is `size_t`.
@@ -204,7 +243,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var + 1`.
  */
-#define RUBY_ATOMIC_SIZE_INC(var) rbimpl_atomic_size_inc(&(var))
+#define RUBY_ATOMIC_SIZE_INC(var) rbimpl_atomic_size_inc(&(var), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_DEC,  except it expects its  argument is `size_t`.
@@ -215,7 +254,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var - 1`.
  */
-#define RUBY_ATOMIC_SIZE_DEC(var) rbimpl_atomic_size_dec(&(var))
+#define RUBY_ATOMIC_SIZE_DEC(var) rbimpl_atomic_size_dec(&(var), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical  to #RUBY_ATOMIC_EXCHANGE,  except  it expects  its arguments  are
@@ -229,7 +268,7 @@ typedef unsigned int rb_atomic_t;
  * @post    `var` holds `val`.
  */
 #define RUBY_ATOMIC_SIZE_EXCHANGE(var, val) \
-    rbimpl_atomic_size_exchange(&(var), (val))
+    rbimpl_atomic_size_exchange(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_CAS, except it expects its arguments are `size_t`.
@@ -243,7 +282,7 @@ typedef unsigned int rb_atomic_t;
  * @retval  otherwise  Something else is at `var`; not updated.
  */
 #define RUBY_ATOMIC_SIZE_CAS(var, oldval, newval) \
-    rbimpl_atomic_size_cas(&(var), (oldval), (newval))
+    rbimpl_atomic_size_cas(&(var), (oldval), (newval), RBIMPL_ATOMIC_SEQ_CST, RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_ADD, except it expects its arguments are `size_t`.
@@ -255,7 +294,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var + val`.
  */
-#define RUBY_ATOMIC_SIZE_ADD(var, val) rbimpl_atomic_size_add(&(var), (val))
+#define RUBY_ATOMIC_SIZE_ADD(var, val) rbimpl_atomic_size_add(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_SUB, except it expects its arguments are `size_t`.
@@ -267,7 +306,7 @@ typedef unsigned int rb_atomic_t;
  * @return  void
  * @post    `var` holds `var - val`.
  */
-#define RUBY_ATOMIC_SIZE_SUB(var, val) rbimpl_atomic_size_sub(&(var), (val))
+#define RUBY_ATOMIC_SIZE_SUB(var, val) rbimpl_atomic_size_sub(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical  to #RUBY_ATOMIC_EXCHANGE,  except  it expects  its arguments  are
@@ -286,7 +325,7 @@ typedef unsigned int rb_atomic_t;
  * some pointers, most notably function pointers.
  */
 #define RUBY_ATOMIC_PTR_EXCHANGE(var, val) \
-    RBIMPL_CAST(rbimpl_atomic_ptr_exchange((void **)&(var), (void *)val))
+    RBIMPL_CAST(rbimpl_atomic_ptr_exchange((void **)&(var), (void *)val, RBIMPL_ATOMIC_SEQ_CST))
 
 /**
  * Identical to #RUBY_ATOMIC_LOAD, except it expects its arguments are `void*`.
@@ -297,7 +336,20 @@ typedef unsigned int rb_atomic_t;
  * @return             The value of `var` (without tearing)
  */
 #define RUBY_ATOMIC_PTR_LOAD(var) \
-    RBIMPL_CAST(rbimpl_atomic_ptr_load((void **)&var))
+    RBIMPL_CAST(rbimpl_atomic_ptr_load((void **)&var, RBIMPL_ATOMIC_SEQ_CST))
+
+/**
+* Identical  to #RUBY_ATOMIC_SET,  except  it expects  its arguments  are
+* `void*`.   There are  cases where  ::rb_atomic_t is  32bit while  ::VALUE is
+* 64bit.  This should  be used for pointer related operations  to support such
+* platforms.
+*
+* @param   var  A variable of `void*`.
+* @param   val   Value to set.
+* @post    `var` holds `val`.
+*/
+#define RUBY_ATOMIC_PTR_SET(var, val) \
+   rbimpl_atomic_ptr_store((volatile void **)&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_CAS, except it expects its arguments are `void*`.
@@ -311,7 +363,20 @@ typedef unsigned int rb_atomic_t;
  * @retval  otherwise  Something else is at `var`; not updated.
  */
 #define RUBY_ATOMIC_PTR_CAS(var, oldval, newval) \
-    RBIMPL_CAST(rbimpl_atomic_ptr_cas((void **)&(var), (oldval), (newval)))
+    RBIMPL_CAST(rbimpl_atomic_ptr_cas((void **)&(var), (void *)(oldval), (void *)(newval), RBIMPL_ATOMIC_SEQ_CST, RBIMPL_ATOMIC_SEQ_CST))
+
+/**
+ * Identical  to #RUBY_ATOMIC_SET,  except  it expects  its arguments  are
+ * ::VALUE.   There are  cases where  ::rb_atomic_t is  32bit while  ::VALUE is
+ * 64bit.  This should  be used for pointer related operations  to support such
+ * platforms.
+ *
+ * @param   var  A variable of ::VALUE.
+ * @param   val   Value to set.
+ * @post    `var` holds `val`.
+ */
+#define RUBY_ATOMIC_VALUE_SET(var, val) \
+    rbimpl_atomic_value_store(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical  to #RUBY_ATOMIC_EXCHANGE,  except  it expects  its arguments  are
@@ -325,7 +390,7 @@ typedef unsigned int rb_atomic_t;
  * @post    `var` holds `val`.
  */
 #define RUBY_ATOMIC_VALUE_EXCHANGE(var, val) \
-    rbimpl_atomic_value_exchange(&(var), (val))
+    rbimpl_atomic_value_exchange(&(var), (val), RBIMPL_ATOMIC_SEQ_CST)
 
 /**
  * Identical to #RUBY_ATOMIC_CAS, except it  expects its arguments are ::VALUE.
@@ -339,19 +404,20 @@ typedef unsigned int rb_atomic_t;
  * @retval  otherwise  Something else is at `var`; not updated.
  */
 #define RUBY_ATOMIC_VALUE_CAS(var, oldval, newval) \
-    rbimpl_atomic_value_cas(&(var), (oldval), (newval))
+    rbimpl_atomic_value_cas(&(var), (oldval), (newval), RBIMPL_ATOMIC_SEQ_CST, RBIMPL_ATOMIC_SEQ_CST)
 
 /** @cond INTERNAL_MACRO */
 RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline rb_atomic_t
-rbimpl_atomic_fetch_add(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_fetch_add(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_fetch_add(ptr, val, __ATOMIC_SEQ_CST);
+    return __atomic_fetch_add(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     return __sync_fetch_and_add(ptr, val);
@@ -368,6 +434,47 @@ rbimpl_atomic_fetch_add(volatile rb_atomic_t *ptr, rb_atomic_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= INT_MAX);
     return atomic_add_int_nv(ptr, val) - val;
 
+#elif defined(HAVE_STDATOMIC_H)
+    return atomic_fetch_add_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
+#else
+# error Unsupported platform.
+#endif
+}
+
+/** @cond INTERNAL_MACRO */
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NOALIAS()
+RBIMPL_ATTR_NONNULL((1))
+static inline size_t
+rbimpl_atomic_size_fetch_add(volatile size_t *ptr, size_t val, int memory_order)
+{
+    (void)memory_order;
+#if 0
+
+#elif defined(HAVE_GCC_ATOMIC_BUILTINS)
+    return __atomic_fetch_add(ptr, val, memory_order);
+
+#elif defined(HAVE_GCC_SYNC_BUILTINS)
+    return __sync_fetch_and_add(ptr, val);
+
+#elif defined(_WIN32)
+    return InterlockedExchangeAdd64(ptr, val);
+
+#elif defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx))
+    /* Ditto for `atomic_add_int_nv`. */
+    RBIMPL_ASSERT_OR_ASSUME(val <= LONG_MAX);
+    atomic_add_long(ptr, val);
+
+#elif defined(__sun) && defined(HAVE_ATOMIC_H)
+    RBIMPL_STATIC_ASSERT(size_of_rb_atomic_t, sizeof *ptr == sizeof(rb_atomic_t));
+
+    volatile rb_atomic_t *const tmp = RBIMPL_CAST((volatile rb_atomic_t *)ptr);
+    rbimpl_atomic_fetch_add(tmp, val, memory_order);
+
+#elif defined(HAVE_STDATOMIC_H)
+    return atomic_fetch_add_explicit((_Atomic volatile size_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
@@ -377,8 +484,9 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_add(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_add(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
@@ -387,7 +495,7 @@ rbimpl_atomic_add(volatile rb_atomic_t *ptr, rb_atomic_t val)
      * return value is not used, then compiles it into single `LOCK ADD`
      * instruction.
      */
-    __atomic_add_fetch(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_add_fetch(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     __sync_add_and_fetch(ptr, val);
@@ -405,6 +513,9 @@ rbimpl_atomic_add(volatile rb_atomic_t *ptr, rb_atomic_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= INT_MAX);
     atomic_add_int(ptr, val);
 
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_fetch_add_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
@@ -414,12 +525,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_size_add(volatile size_t *ptr, size_t val)
+rbimpl_atomic_size_add(volatile size_t *ptr, size_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    __atomic_add_fetch(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_add_fetch(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     __sync_add_and_fetch(ptr, val);
@@ -433,12 +545,17 @@ rbimpl_atomic_size_add(volatile size_t *ptr, size_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= LONG_MAX);
     atomic_add_long(ptr, val);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_rb_atomic_t, sizeof *ptr == sizeof(rb_atomic_t));
 
     volatile rb_atomic_t *const tmp = RBIMPL_CAST((volatile rb_atomic_t *)ptr);
-    rbimpl_atomic_add(tmp, val);
+    rbimpl_atomic_add(tmp, val, memory_order);
+
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_fetch_add_explicit((_Atomic volatile size_t *)ptr, val, memory_order);
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -446,12 +563,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_inc(volatile rb_atomic_t *ptr)
+rbimpl_atomic_inc(volatile rb_atomic_t *ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS) || defined(HAVE_GCC_SYNC_BUILTINS)
-    rbimpl_atomic_add(ptr, 1);
+    rbimpl_atomic_add(ptr, 1, memory_order);
 
 #elif defined(_WIN32)
     InterlockedIncrement(ptr);
@@ -459,9 +577,11 @@ rbimpl_atomic_inc(volatile rb_atomic_t *ptr)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
     atomic_inc_uint(ptr);
 
-#else
-    rbimpl_atomic_add(ptr, 1);
+#elif defined(HAVE_STDATOMIC_H)
+    rbimpl_atomic_add(ptr, 1, memory_order);
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -469,12 +589,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_size_inc(volatile size_t *ptr)
+rbimpl_atomic_size_inc(volatile size_t *ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS) || defined(HAVE_GCC_SYNC_BUILTINS)
-    rbimpl_atomic_size_add(ptr, 1);
+    rbimpl_atomic_size_add(ptr, 1, memory_order);
 
 #elif defined(_WIN64)
     InterlockedIncrement64(ptr);
@@ -482,11 +603,16 @@ rbimpl_atomic_size_inc(volatile size_t *ptr)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx))
     atomic_inc_ulong(ptr);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_size_t, sizeof *ptr == sizeof(rb_atomic_t));
 
-    rbimpl_atomic_size_add(ptr, 1);
+    rbimpl_atomic_size_add(ptr, 1, memory_order);
 
+#elif defined(HAVE_STDATOMIC_H)
+    rbimpl_atomic_size_add(ptr, 1, memory_order);
+
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -494,12 +620,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline rb_atomic_t
-rbimpl_atomic_fetch_sub(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_fetch_sub(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_fetch_sub(ptr, val, __ATOMIC_SEQ_CST);
+    return __atomic_fetch_sub(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     return __sync_fetch_and_sub(ptr, val);
@@ -514,6 +641,9 @@ rbimpl_atomic_fetch_sub(volatile rb_atomic_t *ptr, rb_atomic_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= INT_MAX);
     return atomic_add_int_nv(ptr, neg * val) + val;
 
+#elif defined(HAVE_STDATOMIC_H)
+    return atomic_fetch_sub_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
@@ -523,12 +653,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_sub(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_sub(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    __atomic_sub_fetch(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_sub_fetch(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     __sync_sub_and_fetch(ptr, val);
@@ -541,6 +672,9 @@ rbimpl_atomic_sub(volatile rb_atomic_t *ptr, rb_atomic_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= INT_MAX);
     atomic_add_int(ptr, neg * val);
 
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_fetch_sub_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
@@ -550,12 +684,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_size_sub(volatile size_t *ptr, size_t val)
+rbimpl_atomic_size_sub(volatile size_t *ptr, size_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    __atomic_sub_fetch(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_sub_fetch(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     __sync_sub_and_fetch(ptr, val);
@@ -569,12 +704,17 @@ rbimpl_atomic_size_sub(volatile size_t *ptr, size_t val)
     RBIMPL_ASSERT_OR_ASSUME(val <= LONG_MAX);
     atomic_add_long(ptr, neg * val);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_rb_atomic_t, sizeof *ptr == sizeof(rb_atomic_t));
 
     volatile rb_atomic_t *const tmp = RBIMPL_CAST((volatile rb_atomic_t *)ptr);
-    rbimpl_atomic_sub(tmp, val);
+    rbimpl_atomic_sub(tmp, val, memory_order);
+
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_fetch_sub_explicit((_Atomic volatile size_t *)ptr, val, memory_order);
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -582,12 +722,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_dec(volatile rb_atomic_t *ptr)
+rbimpl_atomic_dec(volatile rb_atomic_t *ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS) || defined(HAVE_GCC_SYNC_BUILTINS)
-    rbimpl_atomic_sub(ptr, 1);
+    rbimpl_atomic_sub(ptr, 1, memory_order);
 
 #elif defined(_WIN32)
     InterlockedDecrement(ptr);
@@ -595,9 +736,11 @@ rbimpl_atomic_dec(volatile rb_atomic_t *ptr)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
     atomic_dec_uint(ptr);
 
-#else
-    rbimpl_atomic_sub(ptr, 1);
+#elif defined(HAVE_STDATOMIC_H)
+    rbimpl_atomic_sub(ptr, 1, memory_order);
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -605,12 +748,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_size_dec(volatile size_t *ptr)
+rbimpl_atomic_size_dec(volatile size_t *ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS) || defined(HAVE_GCC_SYNC_BUILTINS)
-    rbimpl_atomic_size_sub(ptr, 1);
+    rbimpl_atomic_size_sub(ptr, 1, memory_order);
 
 #elif defined(_WIN64)
     InterlockedDecrement64(ptr);
@@ -618,11 +762,16 @@ rbimpl_atomic_size_dec(volatile size_t *ptr)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx))
     atomic_dec_ulong(ptr);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_size_t, sizeof *ptr == sizeof(rb_atomic_t));
 
-    rbimpl_atomic_size_sub(ptr, 1);
+    rbimpl_atomic_size_sub(ptr, 1, memory_order);
+
+#elif defined(HAVE_STDATOMIC_H)
+    rbimpl_atomic_size_sub(ptr, 1, memory_order);
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -630,59 +779,42 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_or(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_or(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    __atomic_or_fetch(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_or_fetch(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     __sync_or_and_fetch(ptr, val);
 
-#elif RBIMPL_COMPILER_SINCE(MSVC, 13, 0, 0)
+#elif RBIMPL_COMPILER_IS(MSVC)
     _InterlockedOr(ptr, val);
 
-#elif defined(_WIN32) && defined(__GNUC__)
-    /* This was for old MinGW.  Maybe not needed any longer? */
-    __asm__(
-        "lock\n\t"
-        "orl\t%1, %0"
-        : "=m"(ptr)
-        : "Ir"(val));
-
-#elif defined(_WIN32) && defined(_M_IX86)
-    __asm mov eax, ptr;
-    __asm mov ecx, val;
-    __asm lock or [eax], ecx;
-
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
     atomic_or_uint(ptr, val);
 
+#elif !defined(_WIN32) && defined(HAVE_STDATOMIC_H)
+    atomic_fetch_or_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
 }
 
-/* Nobody uses this but for theoretical backwards compatibility... */
-#if RBIMPL_COMPILER_BEFORE(MSVC, 13, 0, 0)
-static inline rb_atomic_t
-rb_w32_atomic_or(volatile rb_atomic_t *var, rb_atomic_t val)
-{
-    return rbimpl_atomic_or(var, val);
-}
-#endif
-
 RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline rb_atomic_t
-rbimpl_atomic_exchange(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_exchange(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_exchange_n(ptr, val, __ATOMIC_SEQ_CST);
+    return __atomic_exchange_n(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     return __sync_lock_test_and_set(ptr, val);
@@ -693,6 +825,9 @@ rbimpl_atomic_exchange(volatile rb_atomic_t *ptr, rb_atomic_t val)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
     return atomic_swap_uint(ptr, val);
 
+#elif defined(HAVE_STDATOMIC_H)
+    return atomic_exchange_explicit((_Atomic volatile rb_atomic_t *)ptr, val, memory_order);
+
 #else
 # error Unsupported platform.
 #endif
@@ -702,12 +837,13 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline size_t
-rbimpl_atomic_size_exchange(volatile size_t *ptr, size_t val)
+rbimpl_atomic_size_exchange(volatile size_t *ptr, size_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_exchange_n(ptr, val, __ATOMIC_SEQ_CST);
+    return __atomic_exchange_n(ptr, val, memory_order);
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     return __sync_lock_test_and_set(ptr, val);
@@ -718,13 +854,36 @@ rbimpl_atomic_size_exchange(volatile size_t *ptr, size_t val)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx))
     return atomic_swap_ulong(ptr, val);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_size_t, sizeof *ptr == sizeof(rb_atomic_t));
 
     volatile rb_atomic_t *const tmp = RBIMPL_CAST((volatile rb_atomic_t *)ptr);
-    const rb_atomic_t ret = rbimpl_atomic_exchange(tmp, val);
+    const rb_atomic_t ret = rbimpl_atomic_exchange(tmp, val, memory_order);
     return RBIMPL_CAST((size_t)ret);
 
+#elif defined(HAVE_STDATOMIC_H)
+    return atomic_exchange_explicit((_Atomic volatile size_t *)ptr, val, memory_order);
+
+#else
+# error Unsupported platform.
+#endif
+}
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NOALIAS()
+RBIMPL_ATTR_NONNULL((1))
+static inline void
+rbimpl_atomic_size_store(volatile size_t *ptr, size_t val, int memory_order)
+{
+    (void)memory_order;
+#if 0
+
+#elif defined(HAVE_GCC_ATOMIC_BUILTINS)
+    __atomic_store_n(ptr, val, memory_order);
+
+#else
+    rbimpl_atomic_size_exchange(ptr, val, memory_order);
+
 #endif
 }
 
@@ -732,8 +891,9 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void *
-rbimpl_atomic_ptr_exchange(void *volatile *ptr, const void *val)
+rbimpl_atomic_ptr_exchange(void *volatile *ptr, const void *val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(InterlockedExchangePointer)
@@ -750,7 +910,7 @@ rbimpl_atomic_ptr_exchange(void *volatile *ptr, const void *val)
 
     const size_t sval = RBIMPL_CAST((size_t)val);
     volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
-    const size_t sret = rbimpl_atomic_size_exchange(sptr, sval);
+    const size_t sret = rbimpl_atomic_size_exchange(sptr, sval, memory_order);
     return RBIMPL_CAST((void *)sret);
 
 #endif
@@ -759,29 +919,56 @@ rbimpl_atomic_ptr_exchange(void *volatile *ptr, const void *val)
 RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
+static inline void
+rbimpl_atomic_ptr_store(volatile void **ptr, void *val, int memory_order)
+{
+    RBIMPL_STATIC_ASSERT(sizeof_value, sizeof *ptr == sizeof(size_t));
+
+    const size_t sval = RBIMPL_CAST((size_t)val);
+    volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
+    rbimpl_atomic_size_store(sptr, sval, memory_order);
+}
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NOALIAS()
+RBIMPL_ATTR_NONNULL((1))
 static inline VALUE
-rbimpl_atomic_value_exchange(volatile VALUE *ptr, VALUE val)
+rbimpl_atomic_value_exchange(volatile VALUE *ptr, VALUE val, int memory_order)
 {
     RBIMPL_STATIC_ASSERT(sizeof_value, sizeof *ptr == sizeof(size_t));
 
     const size_t sval = RBIMPL_CAST((size_t)val);
     volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
-    const size_t sret = rbimpl_atomic_size_exchange(sptr, sval);
+    const size_t sret = rbimpl_atomic_size_exchange(sptr, sval, memory_order);
     return RBIMPL_CAST((VALUE)sret);
 }
 
 RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
+static inline void
+rbimpl_atomic_value_store(volatile VALUE *ptr, VALUE val, int memory_order)
+{
+    RBIMPL_STATIC_ASSERT(sizeof_value, sizeof *ptr == sizeof(size_t));
+
+    const size_t sval = RBIMPL_CAST((size_t)val);
+    volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
+    rbimpl_atomic_size_store(sptr, sval, memory_order);
+}
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NOALIAS()
+RBIMPL_ATTR_NONNULL((1))
 static inline rb_atomic_t
-rbimpl_atomic_load(volatile rb_atomic_t *ptr)
+rbimpl_atomic_load(volatile rb_atomic_t *ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_load_n(ptr, __ATOMIC_SEQ_CST);
+    return __atomic_load_n(ptr, memory_order);
 #else
-    return rbimpl_atomic_fetch_add(ptr, 0);
+    return rbimpl_atomic_fetch_add(ptr, 0, memory_order);
 #endif
 }
 
@@ -789,16 +976,17 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void
-rbimpl_atomic_set(volatile rb_atomic_t *ptr, rb_atomic_t val)
+rbimpl_atomic_store(volatile rb_atomic_t *ptr, rb_atomic_t val, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    __atomic_store_n(ptr, val, __ATOMIC_SEQ_CST);
+    __atomic_store_n(ptr, val, memory_order);
 
 #else
     /* Maybe std::atomic<rb_atomic_t>::store can be faster? */
-    rbimpl_atomic_exchange(ptr, val);
+    rbimpl_atomic_exchange(ptr, val, memory_order);
 
 #endif
 }
@@ -807,56 +995,49 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline rb_atomic_t
-rbimpl_atomic_cas(volatile rb_atomic_t *ptr, rb_atomic_t oldval, rb_atomic_t newval)
+rbimpl_atomic_cas(volatile rb_atomic_t *ptr, rb_atomic_t oldval, rb_atomic_t newval, int success_memorder, int failure_memorder)
 {
+    (void)success_memorder;
+    (void)failure_memorder;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
     __atomic_compare_exchange_n(
-        ptr, &oldval, newval, 0, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST);
+        ptr, &oldval, newval, 0, success_memorder, failure_memorder);
     return oldval;
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
     return __sync_val_compare_and_swap(ptr, oldval, newval);
 
-#elif RBIMPL_COMPILER_SINCE(MSVC, 13, 0, 0)
+#elif RBIMPL_COMPILER_IS(MSVC)
     return InterlockedCompareExchange(ptr, newval, oldval);
 
-#elif defined(_WIN32)
-    PVOID *pptr = RBIMPL_CAST((PVOID *)ptr);
-    PVOID pold = RBIMPL_CAST((PVOID)oldval);
-    PVOID pnew = RBIMPL_CAST((PVOID)newval);
-    PVOID pret = InterlockedCompareExchange(pptr, pnew, pold);
-    return RBIMPL_CAST((rb_atomic_t)pret);
-
 #elif defined(__sun) && defined(HAVE_ATOMIC_H)
     return atomic_cas_uint(ptr, oldval, newval);
 
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_compare_exchange_strong_explicit(
+        (_Atomic volatile rb_atomic_t *)ptr, &oldval, newval, success_memorder, failure_memorder);
+    return oldval;
+
 #else
 # error Unsupported platform.
 #endif
 }
 
-/* Nobody uses this but for theoretical backwards compatibility... */
-#if RBIMPL_COMPILER_BEFORE(MSVC, 13, 0, 0)
-static inline rb_atomic_t
-rb_w32_atomic_cas(volatile rb_atomic_t *var, rb_atomic_t oldval, rb_atomic_t newval)
-{
-    return rbimpl_atomic_cas(var, oldval, newval);
-}
-#endif
-
 RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline size_t
-rbimpl_atomic_size_cas(volatile size_t *ptr, size_t oldval, size_t newval)
+rbimpl_atomic_size_cas(volatile size_t *ptr, size_t oldval, size_t newval, int success_memorder, int failure_memorder)
 {
+    (void)success_memorder;
+    (void)failure_memorder;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
     __atomic_compare_exchange_n(
-        ptr, &oldval, newval, 0, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST);
+        ptr, &oldval, newval, 0, success_memorder, failure_memorder);
     return oldval;
 
 #elif defined(HAVE_GCC_SYNC_BUILTINS)
@@ -868,12 +1049,19 @@ rbimpl_atomic_size_cas(volatile size_t *ptr, size_t oldval, size_t newval)
 #elif defined(__sun) && defined(HAVE_ATOMIC_H) && (defined(_LP64) || defined(_I32LPx))
     return atomic_cas_ulong(ptr, oldval, newval);
 
-#else
+#elif defined(_WIN32) || (defined(__sun) && defined(HAVE_ATOMIC_H))
     RBIMPL_STATIC_ASSERT(size_of_size_t, sizeof *ptr == sizeof(rb_atomic_t));
 
     volatile rb_atomic_t *tmp = RBIMPL_CAST((volatile rb_atomic_t *)ptr);
-    return rbimpl_atomic_cas(tmp, oldval, newval);
+    return rbimpl_atomic_cas(tmp, oldval, newval, success_memorder, failure_memorder);
+
+#elif defined(HAVE_STDATOMIC_H)
+    atomic_compare_exchange_strong_explicit(
+        (_Atomic volatile size_t *)ptr, &oldval, newval, success_memorder, failure_memorder);
+    return oldval;
 
+#else
+# error Unsupported platform.
 #endif
 }
 
@@ -881,8 +1069,10 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void *
-rbimpl_atomic_ptr_cas(void **ptr, const void *oldval, const void *newval)
+rbimpl_atomic_ptr_cas(void **ptr, const void *oldval, const void *newval, int success_memorder, int failure_memorder)
 {
+    (void)success_memorder;
+    (void)failure_memorder;
 #if 0
 
 #elif defined(InterlockedExchangePointer)
@@ -905,7 +1095,7 @@ rbimpl_atomic_ptr_cas(void **ptr, const void *oldval, const void *newval)
     const size_t snew = RBIMPL_CAST((size_t)newval);
     const size_t sold = RBIMPL_CAST((size_t)oldval);
     volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
-    const size_t sret = rbimpl_atomic_size_cas(sptr, sold, snew);
+    const size_t sret = rbimpl_atomic_size_cas(sptr, sold, snew, success_memorder, failure_memorder);
     return RBIMPL_CAST((void *)sret);
 
 #endif
@@ -915,15 +1105,16 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline void *
-rbimpl_atomic_ptr_load(void **ptr)
+rbimpl_atomic_ptr_load(void **ptr, int memory_order)
 {
+    (void)memory_order;
 #if 0
 
 #elif defined(HAVE_GCC_ATOMIC_BUILTINS)
-    return __atomic_load_n(ptr, __ATOMIC_SEQ_CST);
+    return __atomic_load_n(ptr, memory_order);
 #else
     void *val = *ptr;
-    return rbimpl_atomic_ptr_cas(ptr, val, val);
+    return rbimpl_atomic_ptr_cas(ptr, val, val, memory_order, memory_order);
 #endif
 }
 
@@ -931,14 +1122,23 @@ RBIMPL_ATTR_ARTIFICIAL()
 RBIMPL_ATTR_NOALIAS()
 RBIMPL_ATTR_NONNULL((1))
 static inline VALUE
-rbimpl_atomic_value_cas(volatile VALUE *ptr, VALUE oldval, VALUE newval)
+rbimpl_atomic_value_load(volatile VALUE *ptr, int memory_order)
+{
+    return RBIMPL_CAST((VALUE)rbimpl_atomic_ptr_load((void **)ptr, memory_order));
+}
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NOALIAS()
+RBIMPL_ATTR_NONNULL((1))
+static inline VALUE
+rbimpl_atomic_value_cas(volatile VALUE *ptr, VALUE oldval, VALUE newval, int success_memorder, int failure_memorder)
 {
     RBIMPL_STATIC_ASSERT(sizeof_value, sizeof *ptr == sizeof(size_t));
 
     const size_t snew = RBIMPL_CAST((size_t)newval);
     const size_t sold = RBIMPL_CAST((size_t)oldval);
     volatile size_t *const sptr = RBIMPL_CAST((volatile size_t *)ptr);
-    const size_t sret = rbimpl_atomic_size_cas(sptr, sold, snew);
+    const size_t sret = rbimpl_atomic_size_cas(sptr, sold, snew, success_memorder, failure_memorder);
     return RBIMPL_CAST((VALUE)sret);
 }
 /** @endcond */
diff --git a/include/ruby/backward.h b/include/ruby/backward.h
index f804c2c36e..6726102158 100644
--- a/include/ruby/backward.h
+++ b/include/ruby/backward.h
@@ -11,12 +11,6 @@
 #include "ruby/internal/interpreter.h"
 #include "ruby/backward/2/attributes.h"
 
-#define RBIMPL_ATTR_DEPRECATED_SINCE(ver) RBIMPL_ATTR_DEPRECATED(("since " #ver))
-#define RBIMPL_ATTR_DEPRECATED_INTERNAL(ver) RBIMPL_ATTR_DEPRECATED(("since "#ver", also internal"))
-#define RBIMPL_ATTR_DEPRECATED_INTERNAL_ONLY() RBIMPL_ATTR_DEPRECATED(("only for internal use"))
-
-RBIMPL_ATTR_DEPRECATED_INTERNAL_ONLY() void rb_clear_constant_cache(void);
-
 /* from version.c */
 #if defined(RUBY_SHOW_COPYRIGHT_TO_DIE) && !!(RUBY_SHOW_COPYRIGHT_TO_DIE+0)
 # error RUBY_SHOW_COPYRIGHT_TO_DIE is deprecated
diff --git a/include/ruby/backward/2/rmodule.h b/include/ruby/backward/2/rmodule.h
index 53b37831c0..76c0936462 100644
--- a/include/ruby/backward/2/rmodule.h
+++ b/include/ruby/backward/2/rmodule.h
@@ -23,7 +23,7 @@
  * who is implementing the internals) could have used those macros for a while.
  * Kept public as-is here to keep some theoretical backwards compatibility.
  */
-#define RMODULE_IV_TBL(m) RCLASS_IV_TBL(m)
+#define RMODULE_IV_TBL(m) RCLASS_FIELDS(m)
 #define RMODULE_CONST_TBL(m) RCLASS_CONST_TBL(m)
 #define RMODULE_M_TBL(m) RCLASS_M_TBL(m)
 #define RMODULE_SUPER(m) RCLASS_SUPER(m)
diff --git a/include/ruby/backward/cxxanyargs.hpp b/include/ruby/backward/cxxanyargs.hpp
index 2414b7ae6d..0ca2745c20 100644
--- a/include/ruby/backward/cxxanyargs.hpp
+++ b/include/ruby/backward/cxxanyargs.hpp
@@ -190,33 +190,6 @@ rb_define_hooked_variable(const char *q, VALUE *w, std::nullptr_t e, void_type *
 /// @name Exceptions and tag jumps
 /// @{
 
-// RUBY_CXX_DEPRECATED("by rb_block_call since 1.9")
-RUBY_CXX_DEPRECATED("Use of ANYARGS in this function is deprecated")
-/// @brief       Old way to implement iterators.
-/// @param[in]   q  A function that can yield.
-/// @param[in]   w  Passed to `q`.
-/// @param[in]   e  What is to be yielded.
-/// @param[in]   r  Passed to `e`.
-/// @return      The return value of `q`.
-/// @note        `e` can be nullptr.
-/// @deprecated  This function is obsoleted since  long before 2.x era.  Do not
-///              use it any longer.  rb_block_call() is provided instead.
-inline VALUE
-rb_iterate(onearg_type *q, VALUE w, type *e, VALUE r)
-{
-    rb_block_call_func_t t = reinterpret_cast<rb_block_call_func_t>(e);
-    return backward::rb_iterate_deprecated(q, w, t, r);
-}
-
-#ifdef HAVE_NULLPTR
-RUBY_CXX_DEPRECATED("by rb_block_call since 1.9")
-inline VALUE
-rb_iterate(onearg_type *q, VALUE w, std::nullptr_t e, VALUE r)
-{
-    return backward::rb_iterate_deprecated(q, w, e, r);
-}
-#endif
-
 RUBY_CXX_DEPRECATED("Use of ANYARGS in this function is deprecated")
 /// @brief       Call a method with a block.
 /// @param[in]   q  The self.
@@ -537,9 +510,7 @@ struct driver {
          * this writing the  version is 2.8.  Let's warn this  later, some time
          * during 3.x.   Hopefully codes in  old (ANYARGS-ed) format  should be
          * less than now. */
-#if (RUBY_API_VERSION_MAJOR * 100 + RUBY_API_VERSION_MINOR) >= 301
         RUBY_CXX_DEPRECATED("use of ANYARGS is deprecated")
-#endif
         /// @copydoc define(VALUE klass, T mid, U func)
         /// @deprecated  Pass correctly typed function instead.
         static inline void
diff --git a/include/ruby/debug.h b/include/ruby/debug.h
index f7c8e6ca8d..27a7a5f2c1 100644
--- a/include/ruby/debug.h
+++ b/include/ruby/debug.h
@@ -297,7 +297,7 @@ VALUE rb_debug_inspector_frame_depth(const rb_debug_inspector_t *dc, long index)
 #define RB_DEBUG_INSPECTOR_FRAME_DEPTH(dc, index) rb_debug_inspector_frame_depth(dc, index)
 
 /**
- * Return current frmae depth.
+ * Return current frame depth.
  *
  * @retval     The depth of the current frame in Integer.
  */
@@ -479,7 +479,7 @@ RBIMPL_ATTR_RETURNS_NONNULL()
  */
 rb_trace_arg_t *rb_tracearg_from_tracepoint(VALUE tpval);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the event of the passed trace.
  *
@@ -488,7 +488,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 rb_event_flag_t rb_tracearg_event_flag(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Identical to  rb_tracearg_event_flag(), except  it returns  the name  of the
  * event in Ruby's symbol.
@@ -498,7 +498,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_event(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the line of the point where the trace is at.
  *
@@ -508,7 +508,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_lineno(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the file name of the point where the trace is at.
  *
@@ -518,7 +518,19 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_path(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
+/**
+ *
+ * Queries the parameters passed on a call or return event.
+ *
+ * @param[in]  trace_arg         A trace instance
+ * @exception  rb_eRuntimeError  The tracing event does not support querying parameters.
+ * @return     Array of parameters in the format of `Method#parameters`.
+ *
+ */
+VALUE rb_tracearg_parameters(rb_trace_arg_t *trace_arg);
+
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the method name of the point where the trace is at.
  *
@@ -528,7 +540,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_method_id(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Identical  to  rb_tracearg_method_id(), except  it  returns  callee id  like
  * rb_frame_callee().
@@ -539,7 +551,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_callee_id(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the class that defines the method that the passed trace is at.  This
  * can be different from the class of rb_tracearg_self()'s return value because
@@ -551,7 +563,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_defined_class(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Creates a binding object of the point where the trace is at.
  *
@@ -566,7 +578,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_binding(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the receiver of the point trace is at.
  *
@@ -575,7 +587,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_self(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the return value that the trace represents.
  *
@@ -585,7 +597,7 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_return_value(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the raised exception that the trace represents.
  *
@@ -595,7 +607,33 @@ RBIMPL_ATTR_NONNULL(())
  */
 VALUE rb_tracearg_raised_exception(rb_trace_arg_t *trace_arg);
 
-RBIMPL_ATTR_NONNULL(())
+RBIMPL_ATTR_NONNULL((1))
+/**
+ * Queries the compiled source code of the 'script_compiled' event.
+ * If loaded from a file, it will return nil.
+ *
+ * @param[in]  trace_arg         A trace instance
+ * @exception  rb_eRuntimeError  The tracing event is not 'script_compiled'.
+ * @retval     RUBY_Qnil         The script was loaded from a file.
+ * @retval     otherwise         The compiled source code.
+ *
+ */
+VALUE rb_tracearg_eval_script(rb_trace_arg_t *trace_arg);
+
+RBIMPL_ATTR_NONNULL((1))
+/**
+ *
+ * Queries the compiled instruction sequence on a 'script_compiled' event.
+ * Note that this method is MRI specific.
+ *
+ * @param[in]  trace_arg         A trace instance
+ * @exception  rb_eRuntimeError  The tracing event is not 'script_compiled'.
+ * @return     The `RubyVM::InstructionSequence` object representing the instruction sequence.
+ *
+ */
+VALUE rb_tracearg_instruction_sequence(rb_trace_arg_t *trace_arg);
+
+RBIMPL_ATTR_NONNULL((1))
 /**
  * Queries the allocated/deallocated object that the trace represents.
  *
@@ -716,59 +754,6 @@ rb_postponed_job_handle_t rb_postponed_job_preregister(unsigned int flags, rb_po
  */
 void rb_postponed_job_trigger(rb_postponed_job_handle_t h);
 
-/**
- * Schedules the given `func` to be called with `data` when Ruby next checks for
- * interrupts. If this function is called multiple times in between Ruby checking
- * for interrupts, then `func` will be called only once with the `data` value from
- * the first call to this function.
- *
- * Like `rb_postponed_job_trigger`, the context in which the job is called
- * holds the GVL and can allocate Ruby objects.
- *
- * This method essentially has the same semantics as:
- *
- * ```
- *   rb_postponed_job_trigger(rb_postponed_job_preregister(func, data));
- * ```
- *
- * @note    Previous versions of Ruby promised that the (`func`, `data`) pairs would
- *          be executed as many times as they were registered with this function; in
- *          reality this was always subject to race conditions and this function no
- *          longer provides this guarantee. Instead, multiple calls to this function
- *          can be coalesced into a single execution of the passed `func`, with the
- *          most recent `data` registered at that time passed in.
- *
- * @deprecated  This interface implies that arbitrarily many `func`'s can be enqueued
- *              over the lifetime of the program, whilst in reality the registration
- *              slots for postponed jobs are a finite resource. This is made clearer
- *              by the `rb_postponed_job_preregister` and `rb_postponed_job_trigger`
- *              functions, and a future version of Ruby might delete this function.
- *
- * @param[in]      flags      Unused and ignored.
- * @param[in]      func       Job body.
- * @param[in,out]  data       Passed as-is to `func`.
- * @retval         0          Postponed job registration table is full. Failed.
- * @retval         1          Registration succeeded.
- * @post           The passed job will run on the next interrupt check.
- */
- RBIMPL_ATTR_DEPRECATED(("use rb_postponed_job_preregister and rb_postponed_job_trigger"))
-int rb_postponed_job_register(unsigned int flags, rb_postponed_job_func_t func, void *data);
-
-/**
- * Identical to `rb_postponed_job_register`
- *
- * @deprecated  This is deprecated for the same reason as `rb_postponed_job_register`
- *
- * @param[in]      flags      Unused and ignored.
- * @param[in]      func       Job body.
- * @param[in,out]  data       Passed as-is to `func`.
- * @retval         0          Postponed job registration table is full. Failed.
- * @retval         1          Registration succeeded.
- * @post           The passed job will run on the next interrupt check.
- */
- RBIMPL_ATTR_DEPRECATED(("use rb_postponed_job_preregister and rb_postponed_job_trigger"))
-int rb_postponed_job_register_one(unsigned int flags, rb_postponed_job_func_t func, void *data);
-
 /** @} */
 
 /**
diff --git a/include/ruby/fiber/scheduler.h b/include/ruby/fiber/scheduler.h
index 8f3d383330..4d764f68ae 100644
--- a/include/ruby/fiber/scheduler.h
+++ b/include/ruby/fiber/scheduler.h
@@ -23,9 +23,11 @@
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 
-#define RUBY_FIBER_SCHEDULER_VERSION 2
+// Version 3: Adds support for `fiber_interrupt`.
+#define RUBY_FIBER_SCHEDULER_VERSION 3
 
 struct timeval;
+struct rb_thread_struct;
 
 /**
  * Wrap a `ssize_t` and `int errno` into a single `VALUE`. This interface should
@@ -117,7 +119,7 @@ VALUE rb_fiber_scheduler_current(void);
 
 /**
  * Identical to rb_fiber_scheduler_current(), except it queries for that of the
- * passed thread instead of the implicit current one.
+ * passed thread value instead of the implicit current one.
  *
  * @param[in]  thread         Target thread.
  * @exception  rb_eTypeError  `thread` is not a thread.
@@ -127,6 +129,17 @@ VALUE rb_fiber_scheduler_current(void);
 VALUE rb_fiber_scheduler_current_for_thread(VALUE thread);
 
 /**
+ * Identical to rb_fiber_scheduler_current_for_thread(), except it expects
+ * a threadptr instead of a thread value.
+ *
+ * @param[in]  thread         Target thread.
+ * @exception  rb_eTypeError  `thread` is not a thread.
+ * @retval     RUBY_Qnil      No scheduler is in effect in `thread`.
+ * @retval     otherwise      The scheduler that is in effect in `thread`.
+ */
+VALUE rb_fiber_scheduler_current_for_threadptr(struct rb_thread_struct *thread);
+
+/**
  * Converts the passed timeout to an expression that rb_fiber_scheduler_block()
  * etc. expects.
  *
@@ -166,6 +179,14 @@ VALUE rb_fiber_scheduler_kernel_sleep(VALUE scheduler, VALUE duration);
  */
 VALUE rb_fiber_scheduler_kernel_sleepv(VALUE scheduler, int argc, VALUE * argv);
 
+/**
+ * Yield to the scheduler, to be resumed on the next scheduling cycle.
+ *
+ * @param[in]  scheduler  Target scheduler.
+ * @return     What `scheduler.yield` returns.
+ */
+VALUE rb_fiber_scheduler_yield(VALUE scheduler);
+
 /* Description TBW */
 #if 0
 VALUE rb_fiber_scheduler_timeout_after(VALUE scheduler, VALUE timeout, VALUE exception, VALUE message);
@@ -199,6 +220,8 @@ VALUE rb_fiber_scheduler_block(VALUE scheduler, VALUE blocker, VALUE timeout);
 /**
  * Wakes up a fiber previously blocked using rb_fiber_scheduler_block().
  *
+ * This function may be called from a different thread.
+ *
  * @param[in]  scheduler  Target scheduler.
  * @param[in]  blocker    What was awaited for.
  * @param[in]  fiber      What to unblock.
@@ -391,9 +414,89 @@ VALUE rb_fiber_scheduler_io_close(VALUE scheduler, VALUE io);
  */
 VALUE rb_fiber_scheduler_address_resolve(VALUE scheduler, VALUE hostname);
 
+// The state of the blocking operation execution.
+struct rb_fiber_scheduler_blocking_operation_state {
+    void *result;
+    int saved_errno;
+};
+
+// The opaque handle for the blocking operation.
+typedef struct rb_fiber_scheduler_blocking_operation rb_fiber_scheduler_blocking_operation_t;
+
+/**
+ * Extract the blocking operation handle from a BlockingOperationRuby object.
+ *
+ * This function safely extracts the opaque handle from a BlockingOperation VALUE
+ * while holding the GVL. The returned pointer can be passed to worker threads
+ * and used with rb_fiber_scheduler_blocking_operation_execute.
+ *
+ * @param[in] self The BlockingOperation VALUE to extract from
+ * @return The opaque struct pointer on success, NULL on error
+ * @note Experimental.
+ */
+rb_fiber_scheduler_blocking_operation_t *rb_fiber_scheduler_blocking_operation_extract(VALUE self);
+
+/**
+ * Execute blocking operation from handle (GVL not required).
+ *
+ * This function executes a blocking operation using the opaque handle
+ * obtained from rb_fiber_scheduler_blocking_operation_extract.
+ * It can be called from native threads without holding the GVL.
+ *
+ * @param[in] blocking_operation The opaque handle.
+ * @return 0 on success, -1 on error.
+ * @note Experimental. Can be called from any thread without holding the GVL
+ */
+int rb_fiber_scheduler_blocking_operation_execute(rb_fiber_scheduler_blocking_operation_t *blocking_operation);
+
+/**
+ * Cancel a blocking operation.
+ *
+ * This function cancels a blocking operation. If the operation is queued,
+ * it just marks it as cancelled. If it's executing, it marks it as cancelled
+ * and calls the unblock function to interrupt the operation.
+ *
+ * @param blocking_operation The opaque struct pointer
+ * @return 1 if unblock function was called, 0 if just marked cancelled, -1 on error
+ * @note Experimental.
+ */
+int rb_fiber_scheduler_blocking_operation_cancel(rb_fiber_scheduler_blocking_operation_t *blocking_operation);
+
+/**
+ * Defer the execution of the passed function to the scheduler.
+ *
+ * @param[in]  scheduler         Target scheduler.
+ * @param[in]  function          The function to run.
+ * @param[in]  data              The data to pass to the function.
+ * @param[in]  unblock_function  The unblock function to use to interrupt the operation.
+ * @param[in]  data2             The data to pass to the unblock function.
+ * @param[in]  flags             Flags passed to `rb_nogvl`.
+ * @param[out] state             The result and errno of the operation.
+ * @retval     RUBY_Qundef       `scheduler` doesn't have `#blocking_operation_wait`.
+ * @return     otherwise         What `scheduler.blocking_operation_wait` returns.
+ */
+VALUE rb_fiber_scheduler_blocking_operation_wait(VALUE scheduler, void* (*function)(void *), void *data, rb_unblock_function_t *unblock_function, void *data2, int flags, struct rb_fiber_scheduler_blocking_operation_state *state);
+
+/**
+ * Interrupt a fiber by raising an exception. You can construct an exception using `rb_make_exception`.
+ *
+ * This hook may be invoked by a different thread.
+ *
+ * @param[in]  scheduler  Target scheduler.
+ * @param[in]  fiber      The fiber to interrupt.
+ * @param[in]  exception  The exception to raise in the fiber.
+ * @return     What `scheduler.fiber_interrupt` returns.
+ */
+VALUE rb_fiber_scheduler_fiber_interrupt(VALUE scheduler, VALUE fiber, VALUE exception);
+
 /**
  * Create and schedule a non-blocking fiber.
  *
+ * @param[in]  scheduler  Target scheduler.
+ * @param[in]  argc      Number of arguments in argv.
+ * @param[in]  argv      Array of arguments to pass to the fiber.
+ * @param[in]  kw_splat  Whether to expand last argument as keywords.
+ * @return     The created and scheduled fiber.
  */
 VALUE rb_fiber_scheduler_fiber(VALUE scheduler, int argc, VALUE *argv, int kw_splat);
 
diff --git a/include/ruby/intern.h b/include/ruby/intern.h
index 48e4cd546e..8718169ce2 100644
--- a/include/ruby/intern.h
+++ b/include/ruby/intern.h
@@ -51,6 +51,7 @@
 #include "ruby/internal/intern/re.h"
 #include "ruby/internal/intern/ruby.h"
 #include "ruby/internal/intern/select.h"
+#include "ruby/internal/intern/set.h"
 #include "ruby/internal/intern/signal.h"
 #include "ruby/internal/intern/sprintf.h"
 #include "ruby/internal/intern/string.h"
diff --git a/include/ruby/internal/abi.h b/include/ruby/internal/abi.h
index e735a67564..7ceb8c40b7 100644
--- a/include/ruby/internal/abi.h
+++ b/include/ruby/internal/abi.h
@@ -24,7 +24,7 @@
  * In released versions of Ruby, this number is not defined since teeny
  * versions of Ruby should guarantee ABI compatibility.
  */
-#define RUBY_ABI_VERSION 0
+#define RUBY_ABI_VERSION 3
 
 /* Windows does not support weak symbols so ruby_abi_version will not exist
  * in the shared library. */
diff --git a/include/ruby/internal/anyargs.h b/include/ruby/internal/anyargs.h
index e3e1b6166d..e4c6d155cc 100644
--- a/include/ruby/internal/anyargs.h
+++ b/include/ruby/internal/anyargs.h
@@ -84,12 +84,15 @@
 
 #elif defined(_WIN32) || defined(__CYGWIN__)
 # /* Skip due to [Bug #16134] */
+# define RBIMPL_CAST_FN_PTR 1
 
 #elif ! RBIMPL_HAS_ATTRIBUTE(transparent_union)
 # /* :TODO: improve here, please find a way to support. */
+# define RBIMPL_CAST_FN_PTR 1
 
 #elif ! defined(HAVE_VA_ARGS_MACRO)
 # /* :TODO: improve here, please find a way to support. */
+# define RBIMPL_CAST_FN_PTR 1
 
 #else
 # /** @cond INTERNAL_MACRO */
@@ -348,6 +351,25 @@ RBIMPL_ANYARGS_DECL(rb_define_method, VALUE, const char *)
 
 #endif /* __cplusplus */
 
+#if defined(RBIMPL_CAST_FN_PTR) && !defined(__cplusplus)
+/* In C23, K&R style prototypes are gone and so `void foo(ANYARGS)` became
+ * equivalent to `void foo(void)` unlike in earlier versions. This is a problem
+ * for rb_define_* functions since that makes all valid functions one can pass
+ * trip -Wincompatible-pointer-types, which we treat as errors. This is mostly
+ * not a problem for the __builtin_choose_expr path, but outside of that we
+ * need to add a cast for compatibility.
+ */
+#define rb_define_method(klass, mid, func, arity)           rb_define_method((klass), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_method_id(klass, mid, func, arity)        rb_define_method_id((klass), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_singleton_method(obj, mid, func, arity)   rb_define_singleton_method((obj), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_protected_method(klass, mid, func, arity) rb_define_protected_method((klass), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_private_method(klass, mid, func, arity)   rb_define_private_method((klass), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_module_function(mod, mid, func, arity)    rb_define_module_function((mod), (mid), (VALUE (*)(ANYARGS))(func), (arity))
+#define rb_define_global_function(mid, func, arity)         rb_define_global_function((mid), (VALUE (*)(ANYARGS))(func), (arity))
+
+#undef RBIMPL_CAST_FN_PTR
+#endif /* defined(RBIMPL_CAST_FN_PTR) && !defined(__cplusplus) */
+
 /**
  * This  macro is  to properly  cast  a function  parameter of  *_define_method
  * family.  It  has been  around since  1.x era so  you can  maximise backwards
diff --git a/include/ruby/internal/arithmetic/int.h b/include/ruby/internal/arithmetic/int.h
index 6bd8ec2184..7b24d16887 100644
--- a/include/ruby/internal/arithmetic/int.h
+++ b/include/ruby/internal/arithmetic/int.h
@@ -254,7 +254,7 @@ static inline VALUE
 rb_uint2num_inline(unsigned int v)
 {
     if (RB_POSFIXABLE(v))
-        return RB_LONG2FIX(v);
+        return RB_LONG2FIX(RBIMPL_CAST((long)v));
     else
         return rb_uint2big(v);
 }
diff --git a/include/ruby/internal/arithmetic/intptr_t.h b/include/ruby/internal/arithmetic/intptr_t.h
index a354f4469c..70090f88e6 100644
--- a/include/ruby/internal/arithmetic/intptr_t.h
+++ b/include/ruby/internal/arithmetic/intptr_t.h
@@ -32,6 +32,18 @@
 #define rb_int_new  rb_int2inum  /**< @alias{rb_int2inum} */
 #define rb_uint_new rb_uint2inum /**< @alias{rb_uint2inum} */
 
+// These definitions are same as fiddle/conversions.h
+#if SIZEOF_VOIDP <= SIZEOF_LONG
+# define PTR2NUM(x) (LONG2NUM((long)(x)))
+# define NUM2PTR(x) ((void*)(NUM2ULONG(x)))
+#elif SIZEOF_VOIDP <= SIZEOF_LONG_LONG
+# define PTR2NUM(x) (LL2NUM((LONG_LONG)(x)))
+# define NUM2PTR(x) ((void*)(NUM2ULL(x)))
+#else
+// should have been an error in ruby/internal/value.h
+# error Need integer for VALUE
+#endif
+
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 
 /**
diff --git a/include/ruby/internal/attr/deprecated.h b/include/ruby/internal/attr/deprecated.h
index e1bbdbd15a..a374ace868 100644
--- a/include/ruby/internal/attr/deprecated.h
+++ b/include/ruby/internal/attr/deprecated.h
@@ -48,7 +48,7 @@
 #elif RBIMPL_HAS_ATTRIBUTE(deprecated) /* but not with message. */
 # define RBIMPL_ATTR_DEPRECATED(msg) __attribute__((__deprecated__))
 
-#elif RBIMPL_COMPILER_SINCE(MSVC, 14, 0, 0)
+#elif RBIMPL_COMPILER_IS(MSVC)
 # define RBIMPL_ATTR_DEPRECATED(msg) __declspec(deprecated msg)
 
 #elif RBIMPL_HAS_DECLSPEC_ATTRIBUTE(deprecated)
@@ -72,4 +72,11 @@
 # define RBIMPL_ATTR_DEPRECATED_EXT(msg) RBIMPL_ATTR_DEPRECATED(msg)
 #endif
 
+#define RBIMPL_ATTR_DEPRECATED_SINCE(ver) \
+    RBIMPL_ATTR_DEPRECATED(("since " #ver))
+#define RBIMPL_ATTR_DEPRECATED_INTERNAL(ver) \
+    RBIMPL_ATTR_DEPRECATED(("since "#ver", also internal"))
+#define RBIMPL_ATTR_DEPRECATED_INTERNAL_ONLY() \
+    RBIMPL_ATTR_DEPRECATED(("only for internal use"))
+
 #endif /* RBIMPL_ATTR_DEPRECATED_H */
diff --git a/include/ruby/internal/attr/forceinline.h b/include/ruby/internal/attr/forceinline.h
index b7daafede7..5b9ae794af 100644
--- a/include/ruby/internal/attr/forceinline.h
+++ b/include/ruby/internal/attr/forceinline.h
@@ -29,7 +29,7 @@
  * `__forceinline` are mutually exclusive.  We have to mimic that behaviour for
  * non-MSVC compilers.
  */
-#if RBIMPL_COMPILER_SINCE(MSVC, 12, 0, 0)
+#if RBIMPL_COMPILER_IS(MSVC)
 # define RBIMPL_ATTR_FORCEINLINE() __forceinline
 #elif RBIMPL_HAS_ATTRIBUTE(always_inline)
 # define RBIMPL_ATTR_FORCEINLINE() __attribute__((__always_inline__)) inline
diff --git a/include/ruby/internal/attr/format.h b/include/ruby/internal/attr/format.h
index b3488ee00a..7feff1c846 100644
--- a/include/ruby/internal/attr/format.h
+++ b/include/ruby/internal/attr/format.h
@@ -22,6 +22,10 @@
  */
 #include "ruby/internal/has/attribute.h"
 
+#if defined(__MINGW32__)
+#include <stdio.h>              /* for __MINGW_PRINTF_FORMAT */
+#endif
+
 /** Wraps (or simulates) `__attribute__((format))` */
 #if RBIMPL_HAS_ATTRIBUTE(format)
 # define RBIMPL_ATTR_FORMAT(x, y, z) __attribute__((__format__(x, y, z)))
diff --git a/include/ruby/internal/attr/noexcept.h b/include/ruby/internal/attr/noexcept.h
index 7c3f92f1e7..dd4c667407 100644
--- a/include/ruby/internal/attr/noexcept.h
+++ b/include/ruby/internal/attr/noexcept.h
@@ -78,7 +78,7 @@
 #elif defined(__INTEL_CXX11_MODE__)
 # define RBIMPL_ATTR_NOEXCEPT(_) noexcept(noexcept(_))
 
-#elif RBIMPL_COMPILER_SINCE(MSVC, 19, 0, 0)
+#elif RBIMPL_COMPILER_IS(MSVC)
 # define RBIMPL_ATTR_NOEXCEPT(_) noexcept(noexcept(_))
 
 #elif __cplusplus >= 201103L
diff --git a/include/ruby/internal/attr/nonstring.h b/include/ruby/internal/attr/nonstring.h
new file mode 100644
index 0000000000..da2501f7bf
--- /dev/null
+++ b/include/ruby/internal/attr/nonstring.h
@@ -0,0 +1,40 @@
+#ifndef RBIMPL_ATTR_NONSTRING_H                        /*-*-C++-*-vi:se ft=cpp:*/
+#define RBIMPL_ATTR_NONSTRING_H
+/**
+ * @file
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  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.
+ * @warning    Symbols   prefixed  with   either  `RBIMPL`   or  `rbimpl`   are
+ *             implementation details.   Don't take  them as canon.  They could
+ *             rapidly appear then vanish.  The name (path) of this header file
+ *             is also an  implementation detail.  Do not expect  it to persist
+ *             at the place it is now.  Developers are free to move it anywhere
+ *             anytime at will.
+ * @note       To  ruby-core:  remember  that   this  header  can  be  possibly
+ *             recursively included  from extension  libraries written  in C++.
+ *             Do not  expect for  instance `__VA_ARGS__` is  always available.
+ *             We assume C99  for ruby itself but we don't  assume languages of
+ *             extension libraries.  They could be written in C++98.
+ * @brief      Defines #RBIMPL_ATTR_NONSTRING.
+ */
+#include "ruby/internal/has/attribute.h"
+
+/** Wraps (or simulates) `__attribute__((nonstring))` */
+#if RBIMPL_HAS_ATTRIBUTE(nonstring)
+# define RBIMPL_ATTR_NONSTRING() __attribute__((nonstring))
+# if RBIMPL_COMPILER_SINCE(GCC, 15, 0, 0)
+#   define RBIMPL_ATTR_NONSTRING_ARRAY() RBIMPL_ATTR_NONSTRING()
+# elif defined(__clang_major__) && __clang_major__ >= 21
+#   define RBIMPL_ATTR_NONSTRING_ARRAY() RBIMPL_ATTR_NONSTRING()
+# else
+#   define RBIMPL_ATTR_NONSTRING_ARRAY() /* void */
+# endif
+#else
+# define RBIMPL_ATTR_NONSTRING() /* void */
+# define RBIMPL_ATTR_NONSTRING_ARRAY() /* void */
+#endif
+
+#endif /* RBIMPL_ATTR_NONSTRING_H */
diff --git a/include/ruby/internal/attr/restrict.h b/include/ruby/internal/attr/restrict.h
index e39104138c..b12fdc9dbc 100644
--- a/include/ruby/internal/attr/restrict.h
+++ b/include/ruby/internal/attr/restrict.h
@@ -28,7 +28,7 @@
  * `__has_declspec_attribute()` which involves macro substitution. */
 
 /** Wraps (or simulates) `__declspec(restrict)` */
-#if RBIMPL_COMPILER_SINCE(MSVC, 14, 0, 0)
+#if RBIMPL_COMPILER_IS(MSVC)
 # define RBIMPL_ATTR_RESTRICT() __declspec(re ## strict)
 
 #elif RBIMPL_HAS_ATTRIBUTE(malloc)
diff --git a/include/ruby/internal/compiler_is/msvc.h b/include/ruby/internal/compiler_is/msvc.h
index 8a864ea558..824f0ecc21 100644
--- a/include/ruby/internal/compiler_is/msvc.h
+++ b/include/ruby/internal/compiler_is/msvc.h
@@ -38,19 +38,8 @@
 # define RBIMPL_COMPILER_VERSION_MINOR (_MSC_FULL_VER % 10000000 / 100000)
 # define RBIMPL_COMPILER_VERSION_PATCH (_MSC_FULL_VER            % 100000)
 
-#elif defined(_MSC_FULL_VER)
-# define RBIMPL_COMPILER_IS_MSVC 1
-# /* _MSC_FULL_VER = XXYYZZZZ */
-# define RBIMPL_COMPILER_VERSION_MAJOR (_MSC_FULL_VER / 1000000)
-# define RBIMPL_COMPILER_VERSION_MINOR (_MSC_FULL_VER % 1000000 / 10000)
-# define RBIMPL_COMPILER_VERSION_PATCH (_MSC_FULL_VER           % 10000)
-
 #else
-# define RBIMPL_COMPILER_IS_MSVC 1
-# /* _MSC_VER = XXYY */
-# define RBIMPL_COMPILER_VERSION_MAJOR (_MSC_VER / 100)
-# define RBIMPL_COMPILER_VERSION_MINOR (_MSC_VER % 100)
-# define RBIMPL_COMPILER_VERSION_PATCH 0
+# error Unsupported MSVC version
 #endif
 
 #endif /* RBIMPL_COMPILER_IS_MSVC_H */
diff --git a/include/ruby/internal/config.h b/include/ruby/internal/config.h
index da070f0979..34862ded6e 100644
--- a/include/ruby/internal/config.h
+++ b/include/ruby/internal/config.h
@@ -50,7 +50,7 @@
 #  define HAVE_VA_ARGS_MACRO
 # elif defined(__INTEL_CXX11_MODE__)
 #  define HAVE_VA_ARGS_MACRO
-# elif RBIMPL_COMPILER_SINCE(MSVC, 16, 0, 0)
+# elif RBIMPL_COMPILER_IS(MSVC)
 #  define HAVE_VA_ARGS_MACRO
 # else
 #  /* NG, not known. */
diff --git a/include/ruby/internal/core/rarray.h b/include/ruby/internal/core/rarray.h
index 90690fe794..b47b63d51b 100644
--- a/include/ruby/internal/core/rarray.h
+++ b/include/ruby/internal/core/rarray.h
@@ -80,6 +80,8 @@
  * here is at least incomplete.
  */
 enum ruby_rarray_flags {
+    /* RUBY_FL_USER0 is for ELTS_SHARED */
+
     /**
      * This flag  has something to do  with memory footprint.  If  the array is
      * "small"  enough, ruby  tries to  be creative  to abuse  padding bits  of
@@ -99,8 +101,6 @@ enum ruby_rarray_flags {
      */
     RARRAY_EMBED_FLAG      = RUBY_FL_USER1,
 
-    /* RUBY_FL_USER2 is for ELTS_SHARED */
-
     /**
      * When an array employs embedded strategy (see ::RARRAY_EMBED_FLAG), these
      * bits  are used  to store  the number  of elements  actually filled  into
@@ -367,7 +367,7 @@ RARRAY_PTR(VALUE ary)
 {
     RBIMPL_ASSERT_TYPE(ary, RUBY_T_ARRAY);
 
-    VALUE tmp = RB_OBJ_WB_UNPROTECT_FOR(ARRAY, ary);
+    VALUE tmp = RB_OBJ_WB_UNPROTECT(ary);
     return RBIMPL_CAST((VALUE *)RARRAY_CONST_PTR(tmp));
 }
 
diff --git a/include/ruby/internal/core/rbasic.h b/include/ruby/internal/core/rbasic.h
index a1477e2600..63cdff8e09 100644
--- a/include/ruby/internal/core/rbasic.h
+++ b/include/ruby/internal/core/rbasic.h
@@ -55,6 +55,12 @@ enum ruby_rvalue_flags {
     RVALUE_EMBED_LEN_MAX = RBIMPL_RVALUE_EMBED_LEN_MAX
 };
 
+#if (SIZEOF_VALUE < SIZEOF_UINT64_T)
+#define RBASIC_SHAPE_ID_FIELD 1
+#else
+#define RBASIC_SHAPE_ID_FIELD 0
+#endif
+
 /**
  * Ruby object's base components. All Ruby objects have them in common.
  */
@@ -85,6 +91,10 @@ RBasic {
      */
     const VALUE klass;
 
+#if RBASIC_SHAPE_ID_FIELD
+    VALUE shape_id;
+#endif
+
 #ifdef __cplusplus
   public:
     RBIMPL_ATTR_CONSTEXPR(CXX11)
@@ -100,8 +110,14 @@ RBasic {
     RBasic() :
         flags(RBIMPL_VALUE_NULL),
         klass(RBIMPL_VALUE_NULL)
+#if RBASIC_SHAPE_ID_FIELD
+        , shape_id(RBIMPL_VALUE_NULL)
+#endif
     {
     }
+# define RBASIC_INIT RBasic()
+#else
+# define RBASIC_INIT {RBIMPL_VALUE_NULL}
 #endif
 };
 
diff --git a/include/ruby/internal/core/rclass.h b/include/ruby/internal/core/rclass.h
index b0b6bfc80c..6f78cc569b 100644
--- a/include/ruby/internal/core/rclass.h
+++ b/include/ruby/internal/core/rclass.h
@@ -58,7 +58,7 @@ enum ruby_rmodule_flags {
      * rb_mod_refine()  has this  flag set.   This  is the  bit which  controls
      * difference between normal inclusion versus refinements.
      */
-    RMODULE_IS_REFINEMENT            = RUBY_FL_USER3
+    RMODULE_IS_REFINEMENT            = RUBY_FL_USER1
 };
 
 struct RClass; /* Opaque, declared here for RCLASS() macro. */
diff --git a/include/ruby/internal/core/rdata.h b/include/ruby/internal/core/rdata.h
index 43ab3c01e7..d0a4dc7c83 100644
--- a/include/ruby/internal/core/rdata.h
+++ b/include/ruby/internal/core/rdata.h
@@ -37,40 +37,14 @@
 #include "ruby/defines.h"
 
 /** @cond INTERNAL_MACRO */
-#ifdef RUBY_UNTYPED_DATA_WARNING
-# /* Take that. */
-#elif defined(RUBY_EXPORT)
-# define RUBY_UNTYPED_DATA_WARNING 1
-#else
-# define RUBY_UNTYPED_DATA_WARNING 0
+#ifndef RUBY_UNTYPED_DATA_WARNING
+#define RUBY_UNTYPED_DATA_WARNING 1
 #endif
 
 #define RBIMPL_DATA_FUNC(f) RBIMPL_CAST((void (*)(void *))(f))
-#define RBIMPL_ATTRSET_UNTYPED_DATA_FUNC() \
-    RBIMPL_ATTR_WARNING(("untyped Data is unsafe; use TypedData instead")) \
-    RBIMPL_ATTR_DEPRECATED(("by TypedData"))
-
-#define RBIMPL_MACRO_SELECT(x, y) x ## y
-#define RUBY_MACRO_SELECT(x, y)   RBIMPL_MACRO_SELECT(x, y)
 /** @endcond */
 
 /**
- * Convenient casting macro.
- *
- * @param   obj  An object, which is in fact an ::RData.
- * @return  The passed object casted to ::RData.
- */
-#define RDATA(obj)                RBIMPL_CAST((struct RData *)(obj))
-
-/**
- * Convenient getter macro.
- *
- * @param   obj  An object, which is in fact an ::RData.
- * @return  The passed object's ::RData::data field.
- */
-#define DATA_PTR(obj)             RDATA(obj)->data
-
-/**
  * This is a value you can set  to ::RData::dfree.  Setting this means the data
  * was allocated using ::ruby_xmalloc() (or variants), and shall be freed using
  * ::ruby_xfree().
@@ -89,19 +63,6 @@
 #define RUBY_NEVER_FREE           RBIMPL_DATA_FUNC(0)
 
 /**
- * @private
- *
- * @deprecated  This macro once was a thing in the old days, but makes no sense
- *              any  longer today.   Exists  here  for backwards  compatibility
- *              only.  You can safely forget about it.
- */
-#define RUBY_UNTYPED_DATA_FUNC(f) f RBIMPL_ATTRSET_UNTYPED_DATA_FUNC()
-
-/*
-#define RUBY_DATA_FUNC(func) ((void (*)(void*))(func))
-*/
-
-/**
  * This is  the type of callbacks  registered to ::RData.  The  argument is the
  * `data` field.
  */
@@ -110,277 +71,16 @@ typedef void (*RUBY_DATA_FUNC)(void*);
 /**
  * @deprecated
  *
- * Old  "untyped"  user  data.   It  has  roughly  the  same  usage  as  struct
- * ::RTypedData, but lacked several features such as support for compaction GC.
- * Use of this struct is not recommended  any longer.  If it is dead necessary,
- * please inform the core devs about your usage.
- *
- * @internal
- *
- * @shyouhei tried to add RBIMPL_ATTR_DEPRECATED for this type but that yielded
- * too many warnings  in the core.  Maybe  we want to retry  later...  Just add
- * deprecated document for now.
+ * DO NOT USE: Obsolete "untyped" user data, that is remained only for
+ * the backward compatibility for some wrapper generator gems.
  */
 struct RData {
-
-    /** Basic part, including flags and class. */
     struct RBasic basic;
-
-    /**
-     * This function is called when the object is experiencing GC marks.  If it
-     * contains references to  other Ruby objects, you need to  mark them also.
-     * Otherwise GC will smash your data.
-     *
-     * @see      rb_gc_mark()
-     * @warning  This  is  called  during  GC  runs.   Object  allocations  are
-     *           impossible at that moment (that is why GC runs).
-     */
+    VALUE fields_obj;
+    VALUE _reserved;
+    void *data;
     RUBY_DATA_FUNC dmark;
-
-    /**
-     * This function is called when the object  is no longer used.  You need to
-     * do whatever necessary to avoid memory leaks.
-     *
-     * @warning  This  is  called  during  GC  runs.   Object  allocations  are
-     *           impossible at that moment (that is why GC runs).
-     */
     RUBY_DATA_FUNC dfree;
-
-    /** Pointer to the actual C level struct that you want to wrap. */
-    void *data;
 };
 
-RBIMPL_SYMBOL_EXPORT_BEGIN()
-
-/**
- * This is the primitive way to wrap an existing C struct into ::RData.
- *
- * @param[in]  klass          Ruby level class of the returning object.
- * @param[in]  datap          Pointer to the target C struct.
- * @param[in]  dmark          Mark function.
- * @param[in]  dfree          Free function.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     An allocated object that wraps `datap`.
- */
-VALUE rb_data_object_wrap(VALUE klass, void *datap, RUBY_DATA_FUNC dmark, RUBY_DATA_FUNC dfree);
-
-/**
- * Identical to  rb_data_object_wrap(), except it  allocates a new  data region
- * internally instead of taking an existing  one.  The allocation is done using
- * ruby_calloc().   Hence  it  makes  no  sense to  pass  anything  other  than
- * ::RUBY_DEFAULT_FREE to the last argument.
- *
- * @param[in]  klass          Ruby level class of the returning object.
- * @param[in]  size           Requested size of memory to allocate.
- * @param[in]  dmark          Mark function.
- * @param[in]  dfree          Free function.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     An allocated object that wraps a new `size` byte region.
- */
-VALUE rb_data_object_zalloc(VALUE klass, size_t size, RUBY_DATA_FUNC dmark, RUBY_DATA_FUNC dfree);
-
-/**
- * @private
- * Documented in include/ruby/internal/globals.h
- */
-RUBY_EXTERN VALUE rb_cObject;
-RBIMPL_SYMBOL_EXPORT_END()
-
-/**
- * Converts sval, a pointer to your struct, into a Ruby object.
- *
- * @param      klass          A ruby level class.
- * @param      mark           Mark function.
- * @param      free           Free function.
- * @param      sval           A pointer to your struct.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     A created Ruby object.
- */
-#define Data_Wrap_Struct(klass, mark, free, sval) \
-    rb_data_object_wrap(                          \
-        (klass),                                  \
-        (sval),                                   \
-        RBIMPL_DATA_FUNC(mark),                    \
-        RBIMPL_DATA_FUNC(free))
-
-/**
- * @private
- *
- * This is an implementation detail  of #Data_Make_Struct.  People don't use it
- * directly.
- *
- * @param  result     Variable name of created Ruby object.
- * @param  klass      Ruby level class of the object.
- * @param  type       Type name of the C struct.
- * @param  size       Size of the C struct.
- * @param  mark       Mark function.
- * @param  free       Free function.
- * @param  sval       Variable name of created C struct.
- */
-#define Data_Make_Struct0(result, klass, type, size, mark, free, sval)  \
-    VALUE result = rb_data_object_zalloc(          \
-        (klass),                                   \
-        (size),                                    \
-        RBIMPL_DATA_FUNC(mark),                     \
-        RBIMPL_DATA_FUNC(free));                    \
-    (sval) = RBIMPL_CAST((type *)DATA_PTR(result)); \
-    RBIMPL_CAST(/*suppress unused variable warnings*/(void)(sval))
-
-/**
- * Identical  to  #Data_Wrap_Struct, except  it  allocates  a new  data  region
- * internally instead of taking an existing  one.  The allocation is done using
- * ruby_calloc().   Hence  it  makes  no  sense to  pass  anything  other  than
- * ::RUBY_DEFAULT_FREE to the `free` argument.
- *
- * @param      klass          Ruby level class of the returning object.
- * @param      type           Type name of the C struct.
- * @param      mark           Mark function.
- * @param      free           Free function.
- * @param      sval           Variable name of created C struct.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     A created Ruby object.
- */
-#ifdef HAVE_STMT_AND_DECL_IN_EXPR
-#define Data_Make_Struct(klass, type, mark, free, sval) \
-    RB_GNUC_EXTENSION({      \
-        Data_Make_Struct0(   \
-            data_struct_obj, \
-            klass,           \
-            type,            \
-            sizeof(type),    \
-            mark,            \
-            free,            \
-            sval);           \
-        data_struct_obj;     \
-    })
-#else
-#define Data_Make_Struct(klass, type, mark, free, sval) \
-    rb_data_object_make(              \
-        (klass),                      \
-        RBIMPL_DATA_FUNC(mark),        \
-        RBIMPL_DATA_FUNC(free),        \
-        RBIMPL_CAST((void **)&(sval)), \
-        sizeof(type))
-#endif
-
-/**
- * Obtains a C struct from inside of a wrapper Ruby object.
- *
- * @param      obj            An instance of ::RData.
- * @param      type           Type name of the C struct.
- * @param      sval           Variable name of obtained C struct.
- * @return     Unwrapped C struct that `obj` holds.
- */
-#define Data_Get_Struct(obj, type, sval) \
-    ((sval) = RBIMPL_CAST((type*)rb_data_object_get(obj)))
-
-RBIMPL_ATTRSET_UNTYPED_DATA_FUNC()
-/**
- * @private
- *
- * This is an implementation detail of rb_data_object_wrap().  People don't use
- * it directly.
- *
- * @param[in]  klass          Ruby level class of the returning object.
- * @param[in]  ptr            Pointer to the target C struct.
- * @param[in]  mark           Mark function.
- * @param[in]  free           Free function.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     An allocated object that wraps `datap`.
- */
-static inline VALUE
-rb_data_object_wrap_warning(VALUE klass, void *ptr, RUBY_DATA_FUNC mark, RUBY_DATA_FUNC free)
-{
-    return rb_data_object_wrap(klass, ptr, mark, free);
-}
-
-/**
- * @private
- *
- * This is an  implementation detail of #Data_Get_Struct.  People  don't use it
- * directly.
- *
- * @param[in]  obj  An instance of ::RData.
- * @return     Unwrapped C struct that `obj` holds.
- */
-static inline void *
-rb_data_object_get(VALUE obj)
-{
-    Check_Type(obj, RUBY_T_DATA);
-    return DATA_PTR(obj);
-}
-
-RBIMPL_ATTRSET_UNTYPED_DATA_FUNC()
-/**
- * @private
- *
- * This is an  implementation detail of #Data_Get_Struct.  People  don't use it
- * directly.
- *
- * @param[in]  obj  An instance of ::RData.
- * @return     Unwrapped C struct that `obj` holds.
- */
-static inline void *
-rb_data_object_get_warning(VALUE obj)
-{
-    return rb_data_object_get(obj);
-}
-
-#if defined(HAVE_BUILTIN___BUILTIN_CHOOSE_EXPR_CONSTANT_P)
-# define rb_data_object_wrap_warning(klass, ptr, mark, free) \
-    RB_GNUC_EXTENSION(                                       \
-        __builtin_choose_expr(                               \
-            __builtin_constant_p(klass) && !(klass),         \
-            rb_data_object_wrap(klass, ptr, mark, free),     \
-            (rb_data_object_wrap_warning)(klass, ptr, mark, free)))
-#endif
-
-/**
- * This is an implementation detail  of #Data_Make_Struct.  People don't use it
- * directly.
- *
- * @param[in]  klass           Ruby level class of the returning object.
- * @param[in]  mark_func       Mark function.
- * @param[in]  free_func       Free function.
- * @param[in]  datap           Variable of created C struct.
- * @param[in]  size            Requested size of allocation.
- * @exception  rb_eTypeError  `klass` is not a class.
- * @exception  rb_eNoMemError  Out of memory.
- * @return     A created Ruby object.
- * @post       `*datap` holds the created C struct.
- */
-static inline VALUE
-rb_data_object_make(VALUE klass, RUBY_DATA_FUNC mark_func, RUBY_DATA_FUNC free_func, void **datap, size_t size)
-{
-    Data_Make_Struct0(result, klass, void, size, mark_func, free_func, *datap);
-    return result;
-}
-
-RBIMPL_ATTR_DEPRECATED(("by: rb_data_object_wrap"))
-/** @deprecated  This function was renamed to rb_data_object_wrap(). */
-static inline VALUE
-rb_data_object_alloc(VALUE klass, void *data, RUBY_DATA_FUNC dmark, RUBY_DATA_FUNC dfree)
-{
-    return rb_data_object_wrap(klass, data, dmark, dfree);
-}
-
-/** @cond INTERNAL_MACRO */
-#define rb_data_object_wrap_0 rb_data_object_wrap
-#define rb_data_object_wrap_1 rb_data_object_wrap_warning
-#define rb_data_object_wrap_2 rb_data_object_wrap_ /* Used here vvvv */
-#define rb_data_object_wrap   RUBY_MACRO_SELECT(rb_data_object_wrap_2, RUBY_UNTYPED_DATA_WARNING)
-#define rb_data_object_get_0  rb_data_object_get
-#define rb_data_object_get_1  rb_data_object_get_warning
-#define rb_data_object_get_2  rb_data_object_get_ /* Used here vvvv */
-#define rb_data_object_get    RUBY_MACRO_SELECT(rb_data_object_get_2, RUBY_UNTYPED_DATA_WARNING)
-#define rb_data_object_make_0 rb_data_object_make
-#define rb_data_object_make_1 rb_data_object_make_warning
-#define rb_data_object_make_2 rb_data_object_make_ /* Used here vvvv */
-#define rb_data_object_make   RUBY_MACRO_SELECT(rb_data_object_make_2, RUBY_UNTYPED_DATA_WARNING)
-/** @endcond */
 #endif /* RBIMPL_RDATA_H */
diff --git a/include/ruby/internal/core/rmatch.h b/include/ruby/internal/core/rmatch.h
index a528c2999e..ae93755531 100644
--- a/include/ruby/internal/core/rmatch.h
+++ b/include/ruby/internal/core/rmatch.h
@@ -67,23 +67,6 @@ struct rmatch_offset {
     long end; /**< End of a group. */
 };
 
-/** Represents a match. */
-struct rb_matchext_struct {
-    /**
-     * "Registers"  of a  match.   This  is a  quasi-opaque  struct that  holds
-     * execution result of a match.  Roughly resembles `&~`.
-     */
-    struct re_registers regs;
-
-    /** Capture group offsets, in C array. */
-    struct rmatch_offset *char_offset;
-
-    /** Number of ::rmatch_offset that ::rmatch::char_offset holds. */
-    int char_offset_num_allocated;
-};
-
-typedef struct rb_matchext_struct rb_matchext_t;
-
 /**
  * Regular expression  execution context.  When a  regular expression "matches"
  * to a string, it generates capture  groups etc.  This struct holds that info.
@@ -107,12 +90,41 @@ struct RMatch {
      * The expression of this match.
      */
     VALUE regexp;  /* RRegexp */
+
+    /** Number of ::rmatch_offset that ::rmatch::char_offset holds. */
+    int char_offset_num_allocated;
+
+    /** Capture group offsets, in C array. */
+    struct rmatch_offset *char_offset;
+
+    /** Number of capture-group registers. */
+    int num_regs;
+
+    /** Capacity of `as.embed`, in OnigPosition slots. */
+    int capa;
+
+    /**
+     * "Registers" of a match.  This is a quasi-opaque struct that holds
+     * execution result of a match.  Roughly resembles `$~`.
+     */
+    union {
+        OnigPosition embed[1];
+        struct re_registers onig;
+    } as;
 };
 
-#define RMATCH_EXT(m) ((rb_matchext_t *)((char *)(m) + sizeof(struct RMatch)))
+RBIMPL_SYMBOL_EXPORT_BEGIN()
+/**
+ * @private
+ *
+ * Converts an  embedded match  to onig  form.  This  is an  implementation
+ * detail of #RMATCH_REGS.  People don't use it directly.
+ *
+ * @param[out]  match  A match object, possibly in embedded form.
+ */
+void rb_match_ensure_onig(VALUE match);
+RBIMPL_SYMBOL_EXPORT_END()
 
-RBIMPL_ATTR_PURE_UNLESS_DEBUG()
-RBIMPL_ATTR_ARTIFICIAL()
 /**
  * Queries the raw ::re_registers.
  *
@@ -138,7 +150,8 @@ static inline struct re_registers *
 RMATCH_REGS(VALUE match)
 {
     RBIMPL_ASSERT_TYPE(match, RUBY_T_MATCH);
-    return &RMATCH_EXT(match)->regs;
+    rb_match_ensure_onig(match);
+    return &RMATCH(match)->as.onig;
 }
 
 #endif /* RBIMPL_RMATCH_H */
diff --git a/include/ruby/internal/core/robject.h b/include/ruby/internal/core/robject.h
index c2bcae6306..df1901eb1e 100644
--- a/include/ruby/internal/core/robject.h
+++ b/include/ruby/internal/core/robject.h
@@ -42,10 +42,10 @@
  */
 #define ROBJECT(obj)          RBIMPL_CAST((struct RObject *)(obj))
 /** @cond INTERNAL_MACRO */
-#define ROBJECT_EMBED_LEN_MAX ROBJECT_EMBED_LEN_MAX
-#define ROBJECT_EMBED         ROBJECT_EMBED
-#define ROBJECT_IV_CAPACITY   ROBJECT_IV_CAPACITY
-#define ROBJECT_IVPTR         ROBJECT_IVPTR
+#define ROBJECT_EMBED_LEN_MAX       ROBJECT_EMBED_LEN_MAX
+#define ROBJECT_HEAP                ROBJECT_HEAP
+#define ROBJECT_FIELDS_CAPACITY     ROBJECT_FIELDS_CAPACITY
+#define ROBJECT_FIELDS              ROBJECT_FIELDS
 /** @endcond */
 
 /**
@@ -55,10 +55,12 @@
  */
 enum ruby_robject_flags {
     /**
-     * This flag has  something to do with memory footprint.   If the object is
-     * "small"  enough, ruby  tries to  be creative  to abuse  padding bits  of
-     * struct ::RObject for storing instance variables.  This flag denotes that
-     * situation.
+     * This flag marks that the object's instance variables are stored in an
+     * external heap buffer.
+     * Normally, instance variable references are stored inside the object slot,
+     * but if it overflow, Ruby may have to allocate a separate buffer and spills
+     * the instance variables there.
+     * This flag denotes that situation.
      *
      * @warning  This  bit has  to be  considered read-only.   Setting/clearing
      *           this  bit without  corresponding fix  up must  cause immediate
@@ -71,7 +73,7 @@ enum ruby_robject_flags {
      * 3rd parties must  not be aware that  there even is more than  one way to
      * store instance variables.  Might better be hidden.
      */
-    ROBJECT_EMBED = RUBY_FL_USER1
+    ROBJECT_HEAP = RUBY_FL_USER4
 };
 
 struct st_table;
@@ -94,19 +96,14 @@ struct RObject {
          */
         struct {
             /** Pointer to a C array that holds instance variables. */
-            VALUE *ivptr;
-
-            /**
-             * This  is a  table that  holds  instance variable  name to  index
-             * mapping.  Used when accessing instance variables using names.
-             *
-             * @internal
-             *
-             * This is a shortcut for `RCLASS_IV_INDEX_TBL(rb_obj_class(obj))`.
-             */
-            struct rb_id_table *iv_index_tbl;
+            VALUE *fields;
         } heap;
 
+        /* When an object is too complex, it uses a st_table to store instance
+         * variable name to value mappings.
+         */
+        st_table *hash;
+
         /* Embedded instance variables. When an object is small enough, it
          * uses this area to store the instance variables.
          *
@@ -133,17 +130,17 @@ RBIMPL_ATTR_ARTIFICIAL()
  * @shyouhei finds no reason for this to be visible from extension libraries.
  */
 static inline VALUE *
-ROBJECT_IVPTR(VALUE obj)
+ROBJECT_FIELDS(VALUE obj)
 {
     RBIMPL_ASSERT_TYPE(obj, RUBY_T_OBJECT);
 
     struct RObject *const ptr = ROBJECT(obj);
 
-    if (RB_FL_ANY_RAW(obj, ROBJECT_EMBED)) {
-        return ptr->as.ary;
+    if (RB_UNLIKELY(RB_FL_ANY_RAW(obj, ROBJECT_HEAP))) {
+        return ptr->as.heap.fields;
     }
     else {
-        return ptr->as.heap.ivptr;
+        return ptr->as.ary;
     }
 }
 
diff --git a/include/ruby/internal/core/rstring.h b/include/ruby/internal/core/rstring.h
index 0bca74e688..35175ea94a 100644
--- a/include/ruby/internal/core/rstring.h
+++ b/include/ruby/internal/core/rstring.h
@@ -369,41 +369,6 @@ RSTRING_LEN(VALUE str)
     return RSTRING(str)->len;
 }
 
-RBIMPL_WARNING_PUSH()
-#if RBIMPL_COMPILER_IS(Intel)
-RBIMPL_WARNING_IGNORED(413)
-#endif
-
-RBIMPL_ATTR_PURE_UNLESS_DEBUG()
-RBIMPL_ATTR_ARTIFICIAL()
-/**
- * @private
- *
- * "Expands" an embedded  string into an ordinal one.  This  is a function that
- * returns aggregated type.   The returned struct always  has its `as.heap.len`
- * an `as.heap.ptr` fields set appropriately.
- *
- * This is an implementation detail that 3rd parties should never bother.
- */
-static inline struct RString
-rbimpl_rstring_getmem(VALUE str)
-{
-    RBIMPL_ASSERT_TYPE(str, RUBY_T_STRING);
-
-    if (RB_FL_ANY_RAW(str, RSTRING_NOEMBED)) {
-        return *RSTRING(str);
-    }
-    else {
-        /* Expecting compilers to optimize this on-stack struct away. */
-        struct RString retval;
-        retval.len = RSTRING_LEN(str);
-        retval.as.heap.ptr = RSTRING(str)->as.embed.ary;
-        return retval;
-    }
-}
-
-RBIMPL_WARNING_POP()
-
 RBIMPL_ATTR_ARTIFICIAL()
 /**
  * Queries the contents pointer of the string.
@@ -415,7 +380,9 @@ RBIMPL_ATTR_ARTIFICIAL()
 static inline char *
 RSTRING_PTR(VALUE str)
 {
-    char *ptr = rbimpl_rstring_getmem(str).as.heap.ptr;
+    char *ptr = RB_FL_TEST_RAW(str, RSTRING_NOEMBED) ?
+        RSTRING(str)->as.heap.ptr :
+        RSTRING(str)->as.embed.ary;
 
     if (RUBY_DEBUG && RB_UNLIKELY(! ptr)) {
         /* :BEWARE: @shyouhei thinks  that currently, there are  rooms for this
@@ -441,14 +408,17 @@ RBIMPL_ATTR_ARTIFICIAL()
 static inline char *
 RSTRING_END(VALUE str)
 {
-    struct RString buf = rbimpl_rstring_getmem(str);
+    char *ptr = RB_FL_TEST_RAW(str, RSTRING_NOEMBED) ?
+        RSTRING(str)->as.heap.ptr :
+        RSTRING(str)->as.embed.ary;
+    long len = RSTRING_LEN(str);
 
-    if (RUBY_DEBUG && RB_UNLIKELY(! buf.as.heap.ptr)) {
+    if (RUBY_DEBUG && RB_UNLIKELY(!ptr)) {
         /* Ditto. */
         rb_debug_rstring_null_ptr("RSTRING_END");
     }
 
-    return &buf.as.heap.ptr[buf.len];
+    return &ptr[len];
 }
 
 RBIMPL_ATTR_ARTIFICIAL()
@@ -477,16 +447,7 @@ RSTRING_LENINT(VALUE str)
  * @param  ptrvar  Variable where its contents is stored.
  * @param  lenvar  Variable where its length is stored.
  */
-#ifdef HAVE_STMT_AND_DECL_IN_EXPR
-# define RSTRING_GETMEM(str, ptrvar, lenvar) \
-    __extension__ ({ \
-        struct RString rbimpl_str = rbimpl_rstring_getmem(str); \
-        (ptrvar) = rbimpl_str.as.heap.ptr; \
-        (lenvar) = rbimpl_str.len; \
-    })
-#else
 # define RSTRING_GETMEM(str, ptrvar, lenvar) \
     ((ptrvar) = RSTRING_PTR(str),           \
      (lenvar) = RSTRING_LEN(str))
-#endif /* HAVE_STMT_AND_DECL_IN_EXPR */
 #endif /* RBIMPL_RSTRING_H */
diff --git a/include/ruby/internal/core/rstruct.h b/include/ruby/internal/core/rstruct.h
index 69be487b59..0028a1bdcd 100644
--- a/include/ruby/internal/core/rstruct.h
+++ b/include/ruby/internal/core/rstruct.h
@@ -31,18 +31,6 @@
 # include "ruby/backward.h"
 #endif
 
-/**
- * @private
- *
- * @deprecated  This macro once was a thing in the old days, but makes no sense
- *              any  longer today.   Exists  here  for backwards  compatibility
- *              only.  You can safely forget about it.
- *
- * @internal
- *
- * Declaration of rb_struct_ptr() is at include/ruby/backward.h.
- */
-#define RSTRUCT_PTR(st) rb_struct_ptr(st)
 /** @cond INTERNAL_MACRO */
 #define RSTRUCT_LEN RSTRUCT_LEN
 #define RSTRUCT_SET RSTRUCT_SET
diff --git a/include/ruby/internal/core/rtypeddata.h b/include/ruby/internal/core/rtypeddata.h
index 6c19576c20..eb8313f180 100644
--- a/include/ruby/internal/core/rtypeddata.h
+++ b/include/ruby/internal/core/rtypeddata.h
@@ -26,6 +26,7 @@
 # include <stddef.h>
 #endif
 
+#include "ruby/assert.h"
 #include "ruby/internal/assume.h"
 #include "ruby/internal/attr/artificial.h"
 #include "ruby/internal/attr/flag_enum.h"
@@ -37,6 +38,7 @@
 #include "ruby/internal/dllexport.h"
 #include "ruby/internal/error.h"
 #include "ruby/internal/fl_type.h"
+#include "ruby/internal/static_assert.h"
 #include "ruby/internal/stdbool.h"
 #include "ruby/internal/value_type.h"
 
@@ -93,13 +95,15 @@
  */
 #define RTYPEDDATA(obj)              RBIMPL_CAST((struct RTypedData *)(obj))
 
+static inline VALUE rbimpl_check_external_typeddata(VALUE obj);
+
 /**
  * Convenient getter macro.
  *
  * @param   v  An object, which is in fact an ::RTypedData.
  * @return  The passed object's ::RTypedData::data field.
  */
-#define RTYPEDDATA_DATA(v)           (RTYPEDDATA(v)->data)
+#define RTYPEDDATA_DATA(v)           (RTYPEDDATA(rbimpl_check_external_typeddata(v))->data)
 
 /** @old{rb_check_typeddata} */
 #define Check_TypedStruct(v, t)      \
@@ -108,13 +112,18 @@
 /** @cond INTERNAL_MACRO */
 #define RTYPEDDATA_P                 RTYPEDDATA_P
 #define RTYPEDDATA_TYPE              RTYPEDDATA_TYPE
+#define TYPED_DATA_EMBEDDED          ((VALUE)1)
+#define TYPED_DATA_PTR_MASK          (~(TYPED_DATA_EMBEDDED))
+/** @endcond */
+
+/**
+ * Macros to see if each corresponding flag is defined.
+ */
 #define RUBY_TYPED_FREE_IMMEDIATELY  RUBY_TYPED_FREE_IMMEDIATELY
 #define RUBY_TYPED_FROZEN_SHAREABLE  RUBY_TYPED_FROZEN_SHAREABLE
 #define RUBY_TYPED_WB_PROTECTED      RUBY_TYPED_WB_PROTECTED
+#define RUBY_TYPED_EMBEDDABLE        RUBY_TYPED_EMBEDDABLE
 #define RUBY_TYPED_PROMOTED1         RUBY_TYPED_PROMOTED1
-/** @endcond */
-
-#define TYPED_DATA_EMBEDDED 2
 
 /**
  * @private
@@ -139,6 +148,20 @@ rbimpl_typeddata_flags {
      */
     RUBY_TYPED_FREE_IMMEDIATELY = 1,
 
+    /**
+     * This flag indicate to Ruby that the associated C struct may be embedded
+     * inside the object slot, instead of being externally allocated
+     * with +malloc+.
+     *
+     * Embeddable types MUST NOT be accessed using the +DATA_PTR+ macro, only
+     * with +TypedData_Get_Struct+ or +RTYPEDDATA_GET_DATA+.
+     *
+     * Embeddable types MUST NOT free the associated C struct.
+     *
+     * Pointers into the associated C struct MUST NOT be used after the ruby
+     * object is not longer on the stack, as they become invalid when GC
+     * compaction occurs
+     */
     RUBY_TYPED_EMBEDDABLE = 2,
 
     /**
@@ -155,6 +178,12 @@ rbimpl_typeddata_flags {
      */
     RUBY_TYPED_FROZEN_SHAREABLE = RUBY_FL_SHAREABLE,
 
+    // experimental flag
+    // Similar to RUBY_TYPED_FROZEN_SHAREABLE, but doesn't make shareable
+    // reachable objects from this T_DATA object on the Ractor.make_shareable.
+    // If it refers to unshareable objects, simply raise an error.
+    // RUBY_TYPED_FROZEN_SHAREABLE_NO_REC = RUBY_FL_FINALIZE,
+
     /**
      * This flag  has something to do  with our garbage collector.   These days
      * ruby  objects are  "generational".  There  are those  who are  young and
@@ -177,11 +206,6 @@ rbimpl_typeddata_flags {
     RUBY_TYPED_WB_PROTECTED     = RUBY_FL_WB_PROTECTED, /* THIS FLAG DEPENDS ON Ruby version */
 
     /**
-     * This flag no longer in use
-     */
-    RUBY_TYPED_UNUSED           = RUBY_FL_UNUSED6,
-
-    /**
      * This flag determines whether marking and compaction should be carried out
      * using the dmark/dcompact callback functions or whether we should mark
      * declaratively using a list of references defined inside the data struct we're wrapping
@@ -251,10 +275,15 @@ struct rb_data_type_struct {
         RUBY_DATA_FUNC dcompact;
 
         /**
-         * This field  is reserved for future  extension.  For now, it  must be
-         * filled with zeros.
+         * @internal
          */
-        void *reserved[1]; /* For future extension.
+        void (*handle_weak_references)(void *);
+
+         /**
+          * This field  is reserved for future  extension.  For now, it  must be
+          * filled with zeros.
+          */
+        void *reserved[7]; /* For future extension.
                               This array *must* be filled with ZERO. */
     } function;
 
@@ -352,24 +381,45 @@ struct RTypedData {
     /** The part that all ruby objects have in common. */
     struct RBasic basic;
 
+    /** Direct reference to the slots that holds instance variables, if any **/
+    VALUE fields_obj;
+
     /**
+     * This is a `const rb_data_type_t *const` value, with the low bits set:
+     *
+     * 1: Set if object is embedded.
+     *
      * This field  stores various  information about how  Ruby should  handle a
      * data.   This roughly  resembles a  Ruby level  class (apart  from method
      * definition etc.)
      */
-    const rb_data_type_t *const type;
-
-    /**
-     * This has to be always 1.
-     *
-     * @internal
-     */
-    const VALUE typed_flag;
+    const VALUE type;
 
     /** Pointer to the actual C level struct that you want to wrap. */
     void *data;
 };
 
+#if !defined(__cplusplus) || __cplusplus >= 201103L
+RBIMPL_STATIC_ASSERT(fields_obj_in_rdata, offsetof(struct RData, fields_obj) == offsetof(struct RTypedData, fields_obj));
+RBIMPL_STATIC_ASSERT(data_in_rtypeddata, offsetof(struct RData, data) == offsetof(struct RTypedData, data));
+#endif
+
+/**
+ * Convenient casting macro for backward compatibility.
+ *
+ * @param   obj  An object, which is in fact an ::RData.
+ * @return  The passed object casted to ::RData.
+ */
+#define RDATA(obj)                RTYPEDDATA(obj)
+
+/**
+ * Convenient casting macro for backward compatibility.
+ *
+ * @param   obj  An object, which is in fact an ::RData.
+ * @return  The passed object's ::RTypedData::data field.
+ */
+#define DATA_PTR(obj)             RTYPEDDATA_DATA(obj)
+
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 RBIMPL_ATTR_NONNULL((3))
 /**
@@ -384,11 +434,11 @@ RBIMPL_ATTR_NONNULL((3))
  */
 VALUE rb_data_typed_object_wrap(VALUE klass, void *datap, const rb_data_type_t *type);
 
+RBIMPL_ATTR_NONNULL((3))
 /**
  * Identical  to rb_data_typed_object_wrap(),  except it  allocates a  new data
  * region internally instead of taking an existing one.  The allocation is done
- * using ruby_calloc().  Hence it makes  no sense for `type->function.dfree` to
- * be anything other than ::RUBY_TYPED_DEFAULT_FREE.
+ * using ruby_calloc().
  *
  * @param[in]  klass          Ruby level class of the returning object.
  * @param[in]  size           Requested size of memory to allocate.
@@ -399,6 +449,7 @@ VALUE rb_data_typed_object_wrap(VALUE klass, void *datap, const rb_data_type_t *
  */
 VALUE rb_data_typed_object_zalloc(VALUE klass, size_t size, const rb_data_type_t *type);
 
+RBIMPL_ATTR_NONNULL(())
 /**
  * Checks for the domestic relationship between the two.
  *
@@ -413,6 +464,7 @@ VALUE rb_data_typed_object_zalloc(VALUE klass, size_t size, const rb_data_type_t
  */
 int rb_typeddata_inherited_p(const rb_data_type_t *child, const rb_data_type_t *parent);
 
+RBIMPL_ATTR_NONNULL((2))
 /**
  * Checks if the given object is of given kind.
  *
@@ -423,6 +475,7 @@ int rb_typeddata_inherited_p(const rb_data_type_t *child, const rb_data_type_t *
  */
 int rb_typeddata_is_kind_of(VALUE obj, const rb_data_type_t *data_type);
 
+RBIMPL_ATTR_NONNULL((2))
 /**
  * Identical to rb_typeddata_is_kind_of(), except  it raises exceptions instead
  * of returning false.
@@ -434,8 +487,49 @@ int rb_typeddata_is_kind_of(VALUE obj, const rb_data_type_t *data_type);
  * @post       Upon successful return `obj`'s type is guaranteed `data_type`.
  */
 void *rb_check_typeddata(VALUE obj, const rb_data_type_t *data_type);
+
+RBIMPL_ATTR_NORETURN()
+RBIMPL_ATTR_NONNULL((2))
+/**
+ * @private
+ *
+ * Fails with the given object's type incompatibility to the type.
+ *
+ * This  is  an implementation  detail  of  Check_Type.   People don't  use  it
+ * directly.
+ *
+ * @param[in]  obj            The object in question.
+ * @param[in]  expected       Name of expected data type of `obj`.
+ */
+void rb_unexpected_object_type(VALUE obj, const char *expected);
+
+RBIMPL_ATTR_NORETURN()
+RBIMPL_ATTR_NONNULL(())
+/**
+ * @private
+ *
+ * Fails with the given object's type incompatibility to the type.
+ *
+ * This is  an implementation  detail of #TypedData_Make_Struct.   People don't
+ * use it directly.
+ *
+ * @param[in]  actual         Actual data type.
+ * @param[in]  expected       Expected data type.
+ */
+void rb_unexpected_typeddata(const rb_data_type_t *actual, const rb_data_type_t *expected);
 RBIMPL_SYMBOL_EXPORT_END()
 
+#if RUBY_DEBUG
+# define RBIMPL_TYPEDDATA_PRECONDITION(obj, unreachable) \
+    while (RB_UNLIKELY(!RB_TYPE_P(obj, RUBY_T_DATA))) { \
+        rb_unexpected_object_type(obj, "Data"); \
+        unreachable; \
+    }
+#else
+# define RBIMPL_TYPEDDATA_PRECONDITION(obj, unreachable) \
+    RBIMPL_ASSERT_NOTHING
+#endif
+
 /**
  * Converts sval, a pointer to your struct, into a Ruby object.
  *
@@ -464,14 +558,13 @@ RBIMPL_SYMBOL_EXPORT_END()
  */
 #define TypedData_Make_Struct0(result, klass, type, size, data_type, sval) \
     VALUE result = rb_data_typed_object_zalloc(klass, size, data_type);    \
-    (sval) = (type *)RTYPEDDATA_GET_DATA(result); \
+    (sval) = RBIMPL_CAST((type *)rbimpl_typeddata_get_data(result)); \
     RBIMPL_CAST(/*suppress unused variable warnings*/(void)(sval))
 
 /**
  * Identical to #TypedData_Wrap_Struct,  except it allocates a  new data region
  * internally instead of taking an existing  one.  The allocation is done using
- * ruby_calloc().  Hence  it makes no sense  for `data_type->function.dfree` to
- * be anything other than ::RUBY_TYPED_DEFAULT_FREE.
+ * ruby_calloc().
  *
  * @param      klass          Ruby level class of the object.
  * @param      type           Type name of the C struct.
@@ -502,47 +595,36 @@ RBIMPL_SYMBOL_EXPORT_END()
         sizeof(type))
 #endif
 
-/**
- * Obtains a C struct from inside of a wrapper Ruby object.
- *
- * @param      obj            An instance of ::RTypedData.
- * @param      type           Type name of the C struct.
- * @param      data_type      The data type describing `type`.
- * @param      sval           Variable name of obtained C struct.
- * @exception  rb_eTypeError  `obj` is not a kind of `data_type`.
- * @return     Unwrapped C struct that `obj` holds.
- */
-#define TypedData_Get_Struct(obj,type,data_type,sval) \
-    ((sval) = RBIMPL_CAST((type *)rb_check_typeddata((obj), (data_type))))
+static inline bool
+rbimpl_typeddata_embedded_p(VALUE obj)
+{
+    return (RTYPEDDATA(obj)->type) & TYPED_DATA_EMBEDDED;
+}
 
+RBIMPL_ATTR_DEPRECATED_INTERNAL_ONLY()
 static inline bool
 RTYPEDDATA_EMBEDDED_P(VALUE obj)
 {
-#if RUBY_DEBUG
-    if (RB_UNLIKELY(!RB_TYPE_P(obj, RUBY_T_DATA))) {
-        Check_Type(obj, RUBY_T_DATA);
-        RBIMPL_UNREACHABLE_RETURN(false);
-    }
-#endif
+    RBIMPL_TYPEDDATA_PRECONDITION(obj, RBIMPL_UNREACHABLE_RETURN(false));
 
-    return RTYPEDDATA(obj)->typed_flag & TYPED_DATA_EMBEDDED;
+    return rbimpl_typeddata_embedded_p(obj);
 }
 
 static inline void *
-RTYPEDDATA_GET_DATA(VALUE obj)
+rbimpl_typeddata_get_data(VALUE obj)
 {
-#if RUBY_DEBUG
-    if (RB_UNLIKELY(!RB_TYPE_P(obj, RUBY_T_DATA))) {
-        Check_Type(obj, RUBY_T_DATA);
-        RBIMPL_UNREACHABLE_RETURN(false);
-    }
-#endif
+    /* We reuse the data pointer in embedded TypedData. */
+    return rbimpl_typeddata_embedded_p(obj) ?
+        RBIMPL_CAST((void *)&RTYPEDDATA(obj)->data) :
+        RTYPEDDATA_DATA(obj);
+}
 
-    /* We reuse the data pointer in embedded TypedData. We can't use offsetof
-     * since RTypedData a non-POD type in C++. */
-    const size_t embedded_typed_data_size = sizeof(struct RTypedData) - sizeof(void *);
+static inline void *
+RTYPEDDATA_GET_DATA(VALUE obj)
+{
+    RBIMPL_TYPEDDATA_PRECONDITION(obj, RBIMPL_UNREACHABLE_RETURN(NULL));
 
-    return RTYPEDDATA_EMBEDDED_P(obj) ? (char *)obj + embedded_typed_data_size : RTYPEDDATA(obj)->data;
+    return rbimpl_typeddata_get_data(obj);
 }
 
 RBIMPL_ATTR_PURE()
@@ -550,47 +632,41 @@ RBIMPL_ATTR_ARTIFICIAL()
 /**
  * @private
  *
- * This  is an  implementation detail  of  Check_Type().  People  don't use  it
- * directly.
+ * Checks whether the passed object is ::RTypedData.
+ *
+ * This is an  implementation detail of inline functions defined  in this file.
+ * People don't use it directly.
  *
  * @param[in]  obj    Object in question
  * @retval     true   `obj` is an instance of ::RTypedData.
- * @retval     false  `obj` is an instance of ::RData.
- * @pre        `obj` must be a Ruby object of ::RUBY_T_DATA.
+ * @retval     false  `obj` is not an instance of ::RTypedData
  */
 static inline bool
-rbimpl_rtypeddata_p(VALUE obj)
+rbimpl_obj_typeddata_p(VALUE obj)
 {
-    VALUE typed_flag = RTYPEDDATA(obj)->typed_flag;
-    return typed_flag != 0 && typed_flag <= 3;
+    return RB_TYPE_P(obj, RUBY_T_DATA);
 }
 
 RBIMPL_ATTR_PURE_UNLESS_DEBUG()
 RBIMPL_ATTR_ARTIFICIAL()
 /**
- * Checks whether the passed object is ::RTypedData or ::RData.
+ * Checks whether the passed object is ::RTypedData.
  *
  * @param[in]  obj    Object in question
- * @retval     true   `obj` is an instance of ::RTypedData.
- * @retval     false  `obj` is an instance of ::RData.
+ * @retval     true
  * @pre        `obj` must be a Ruby object of ::RUBY_T_DATA.
  */
 static inline bool
 RTYPEDDATA_P(VALUE obj)
 {
-#if RUBY_DEBUG
-    if (RB_UNLIKELY(! RB_TYPE_P(obj, RUBY_T_DATA))) {
-        Check_Type(obj, RUBY_T_DATA);
-        RBIMPL_UNREACHABLE_RETURN(false);
-    }
-#endif
+    RBIMPL_TYPEDDATA_PRECONDITION(obj, RBIMPL_UNREACHABLE_RETURN(false));
 
-    return rbimpl_rtypeddata_p(obj);
+    return true;
 }
 
 RBIMPL_ATTR_PURE_UNLESS_DEBUG()
 RBIMPL_ATTR_ARTIFICIAL()
-/* :TODO: can this function be __attribute__((returns_nonnull)) or not? */
+RBIMPL_ATTR_RETURNS_NONNULL()
 /**
  * Queries for the type of given object.
  *
@@ -598,20 +674,93 @@ RBIMPL_ATTR_ARTIFICIAL()
  * @return     Data type struct that corresponds to `obj`.
  * @pre        `obj` must be an instance of ::RTypedData.
  */
-static inline const struct rb_data_type_struct *
+static inline const rb_data_type_t *
 RTYPEDDATA_TYPE(VALUE obj)
 {
-#if RUBY_DEBUG
-    if (RB_UNLIKELY(! RTYPEDDATA_P(obj))) {
-        rb_unexpected_type(obj, RUBY_T_DATA);
-        RBIMPL_UNREACHABLE_RETURN(NULL);
+    RBIMPL_TYPEDDATA_PRECONDITION(obj, RBIMPL_UNREACHABLE_RETURN(NULL));
+
+    VALUE type = RTYPEDDATA(obj)->type & TYPED_DATA_PTR_MASK;
+    const rb_data_type_t *ptr = RBIMPL_CAST((const rb_data_type_t *)type);
+    RBIMPL_ASSERT_OR_ASSUME(ptr);
+    return ptr;
+}
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NONNULL(())
+static inline bool
+rbimpl_typeddata_inherited_p_inline(const rb_data_type_t *child, const rb_data_type_t *parent)
+{
+    do {
+        if (RB_LIKELY(child == parent)) return true;
+    } while ((child = child->parent) != NULL);
+    return false;
+}
+#define rb_typeddata_inherited_p rbimpl_typeddata_inherited_p_inline
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NONNULL((2))
+static inline bool
+rbimpl_typeddata_is_kind_of_inline(VALUE obj, const rb_data_type_t *data_type)
+{
+    if (RB_UNLIKELY(!rbimpl_obj_typeddata_p(obj))) return false;
+    return rb_typeddata_inherited_p(RTYPEDDATA_TYPE(obj), data_type);
+}
+#define rb_typeddata_is_kind_of rbimpl_typeddata_is_kind_of_inline
+
+RBIMPL_ATTR_ARTIFICIAL()
+RBIMPL_ATTR_NONNULL((2))
+/**
+ * @private
+ *
+ * This  is an  implementation detail  of  TypedData_Get_Struct().  Don't use  it
+ * directly.
+ */
+static inline void *
+rbimpl_check_typeddata(VALUE obj, const rb_data_type_t *expected_type)
+{
+    if (RB_UNLIKELY(!rbimpl_obj_typeddata_p(obj))) {
+        rb_unexpected_object_type(obj, expected_type->wrap_struct_name);
+    }
+
+    const rb_data_type_t *actual_type = RTYPEDDATA_TYPE(obj);
+    if (RB_UNLIKELY(!rb_typeddata_inherited_p(actual_type, expected_type))){
+        rb_unexpected_typeddata(actual_type, expected_type);
     }
-#endif
 
-    return RTYPEDDATA(obj)->type;
+    return RTYPEDDATA_GET_DATA(obj);
+}
+
+RBIMPL_ATTR_PURE_UNLESS_DEBUG()
+RBIMPL_ATTR_ARTIFICIAL()
+/**
+ * @private
+ *
+ * This  is an  implementation detail  of  RTYPEDDATA_DATA().  Don't use  it
+ * directly.
+ */
+static inline VALUE
+rbimpl_check_external_typeddata(VALUE obj)
+{
+    RBIMPL_TYPEDDATA_PRECONDITION(obj, RBIMPL_UNREACHABLE_RETURN(false));
+    RUBY_ASSERT(!rbimpl_typeddata_embedded_p(obj));
+    return obj;
 }
 
 /**
+ * Obtains a C struct from inside of a wrapper Ruby object.
+ *
+ * @param      obj            An instance of ::RTypedData.
+ * @param      type           Type name of the C struct.
+ * @param      data_type      The data type describing `type`.
+ * @param      sval           Variable name of obtained C struct.
+ * @exception  rb_eTypeError  `obj` is not a kind of `data_type`.
+ * @return     Unwrapped C struct that `obj` holds.
+ */
+#define TypedData_Get_Struct(obj,type,data_type,sval) \
+    ((sval) = RBIMPL_CAST((type *)rbimpl_check_typeddata((obj), (data_type))))
+
+RBIMPL_ATTR_NONNULL((2))
+/**
  * While  we don't  stop  you from  using  this  function, it  seems  to be  an
  * implementation  detail of  #TypedData_Make_Struct, which  is preferred  over
  * this one.
@@ -632,12 +781,4 @@ rb_data_typed_object_make(VALUE klass, const rb_data_type_t *type, void **datap,
     return result;
 }
 
-RBIMPL_ATTR_DEPRECATED(("by: rb_data_typed_object_wrap"))
-/** @deprecated  This function was renamed to rb_data_typed_object_wrap(). */
-static inline VALUE
-rb_data_typed_object_alloc(VALUE klass, void *datap, const rb_data_type_t *type)
-{
-    return rb_data_typed_object_wrap(klass, datap, type);
-}
-
 #endif /* RBIMPL_RTYPEDDATA_H */
diff --git a/include/ruby/internal/ctype.h b/include/ruby/internal/ctype.h
index 0f7ca6c516..8b24026311 100644
--- a/include/ruby/internal/ctype.h
+++ b/include/ruby/internal/ctype.h
@@ -498,8 +498,8 @@ RBIMPL_ATTR_ARTIFICIAL()
  * Our own locale-insensitive version of `tolower(3)`.
  *
  * @param[in]  c          Byte in question to convert.
- * @retval     c          The  byte is  not listed  in in  IEEE 1003.1  section
- *                        7.3.1.1 "upper".
+ * @retval     c          The byte is not listed  in IEEE 1003.1 section 7.3.1.1
+ *                        "upper".
  * @retval     otherwise  Byte converted  using the map defined  in IEEE 1003.1
  *                        section 7.3.1 "tolower".
  * @note       Not only  does this function  works under the POSIX  Locale, but
diff --git a/include/ruby/internal/encoding/coderange.h b/include/ruby/internal/encoding/coderange.h
index 7a81208c9e..c89f871518 100644
--- a/include/ruby/internal/encoding/coderange.h
+++ b/include/ruby/internal/encoding/coderange.h
@@ -79,7 +79,7 @@ RBIMPL_ATTR_CONST()
 static inline bool
 RB_ENC_CODERANGE_CLEAN_P(enum ruby_coderange_type cr)
 {
-    return rb_enc_coderange_clean_p(cr);
+    return rb_enc_coderange_clean_p(RBIMPL_CAST((int)cr));
 }
 
 RBIMPL_ATTR_PURE_UNLESS_DEBUG()
diff --git a/include/ruby/internal/encoding/string.h b/include/ruby/internal/encoding/string.h
index 2b9dfe4f31..ea78cf23f3 100644
--- a/include/ruby/internal/encoding/string.h
+++ b/include/ruby/internal/encoding/string.h
@@ -264,6 +264,14 @@ VALUE rb_str_conv_enc(VALUE str, rb_encoding *from, rb_encoding *to);
 VALUE rb_str_conv_enc_opts(VALUE str, rb_encoding *from, rb_encoding *to, int ecflags, VALUE ecopts);
 
 /**
+ * @private
+ *
+ * This is an implementation detail of rb_enc_str_coderange().  Don't use this
+ * directly.
+ **/
+int rbimpl_enc_str_coderange_scan(VALUE str);
+
+/**
  * Scans the passed string to collect  its code range.  Because a Ruby's string
  * is mutable, its contents  change from time to time; so  does its code range.
  * A  long-lived string  tends  to fall  back to  ::RUBY_ENC_CODERANGE_UNKNOWN.
@@ -275,6 +283,27 @@ VALUE rb_str_conv_enc_opts(VALUE str, rb_encoding *from, rb_encoding *to, int ec
 int rb_enc_str_coderange(VALUE str);
 
 /**
+ * Scans the passed string to collect  its code range.  Because a Ruby's string
+ * is mutable, its contents  change from time to time; so  does its code range.
+ * A  long-lived string  tends  to fall  back to  ::RUBY_ENC_CODERANGE_UNKNOWN.
+ * This API scans it and re-assigns a fine-grained code range constant.
+ *
+ * @param[out]  str  A string.
+ * @return      An enum ::ruby_coderange_type.
+ */
+static inline int
+rb_enc_str_coderange_inline(VALUE str)
+{
+    int cr = ENC_CODERANGE(str);
+    if (cr == ENC_CODERANGE_UNKNOWN) {
+        cr = rbimpl_enc_str_coderange_scan(str);
+    }
+    return cr;
+}
+
+#define rb_enc_str_coderange rb_enc_str_coderange_inline
+
+/**
  * Scans the passed string until it finds something odd.  Returns the number of
  * bytes scanned.  As the name implies this is suitable for repeated call.  One
  * of its application is `IO#readlines`.   The method reads from its receiver's
@@ -307,13 +336,13 @@ RBIMPL_ATTR_NONNULL(())
 /**
  * Looks for the passed string in the passed buffer.
  *
- * @param[in]  x          Buffer that potentially includes `y`.
+ * @param[in]  x          Query string.
  * @param[in]  m          Number of bytes of `x`.
- * @param[in]  y          Query string.
+ * @param[in]  y          Buffer that potentially includes `x`.
  * @param[in]  n          Number of bytes of `y`.
  * @param[in]  enc        Encoding of both `x` and `y`.
  * @retval     -1         Not found.
- * @retval     otherwise  Found index in `x`.
+ * @retval     otherwise  Found index in `y`.
  * @note       This API can match at a non-character-boundary.
  */
 long rb_memsearch(const void *x, long m, const void *y, long n, rb_encoding *enc);
diff --git a/include/ruby/internal/error.h b/include/ruby/internal/error.h
index cd37f4461a..5bf82bfe7d 100644
--- a/include/ruby/internal/error.h
+++ b/include/ruby/internal/error.h
@@ -53,6 +53,9 @@ typedef enum {
     /** Warning is for performance issues (not enabled by -w). */
     RB_WARN_CATEGORY_PERFORMANCE,
 
+    /** Warning is for checking unused block strictly */
+    RB_WARN_CATEGORY_STRICT_UNUSED_BLOCK,
+
     RB_WARN_CATEGORY_DEFAULT_BITS = (
         (1U << RB_WARN_CATEGORY_DEPRECATED) |
         (1U << RB_WARN_CATEGORY_EXPERIMENTAL) |
@@ -62,6 +65,7 @@ typedef enum {
         (1U << RB_WARN_CATEGORY_DEPRECATED) |
         (1U << RB_WARN_CATEGORY_EXPERIMENTAL) |
         (1U << RB_WARN_CATEGORY_PERFORMANCE) |
+        (1U << RB_WARN_CATEGORY_STRICT_UNUSED_BLOCK) |
         0)
 } rb_warning_category_t;
 
@@ -417,11 +421,12 @@ void rb_readwrite_syserr_fail(enum rb_io_wait_readwrite waiting, int err, const
 RBIMPL_ATTR_COLD()
 RBIMPL_ATTR_NORETURN()
 /**
+ * @private
+ *
  * Fails with the given object's type incompatibility to the type.
  *
- * It  seems this  function is  visible from  extension libraries  only because
- * RTYPEDDATA_TYPE() uses  it on RUBY_DEBUG.   So you can basically  ignore it;
- * use some other fine-grained method instead.
+ * This  is  an implementation  detail  of  Check_Type.   People don't  use  it
+ * directly.
  *
  * @param[in]  self           The object in question.
  * @param[in]  t              Expected type of the object.
diff --git a/include/ruby/internal/eval.h b/include/ruby/internal/eval.h
index 5bcbb97746..23aa1d9580 100644
--- a/include/ruby/internal/eval.h
+++ b/include/ruby/internal/eval.h
@@ -155,7 +155,8 @@ VALUE rb_funcallv(VALUE recv, ID mid, int argc, const VALUE *argv);
  * @param[in]      kw_splat           Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception      rb_eNoMethodError  No such method.
  * @exception      rb_eException      Any exceptions happen inside.
  * @return         What the method evaluates to.
@@ -189,7 +190,8 @@ VALUE rb_funcallv_public(VALUE recv, ID mid, int argc, const VALUE *argv);
  * @param[in]      kw_splat           Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception      rb_eNoMethodError  No such method.
  * @exception      rb_eNoMethodError  The method is private or protected.
  * @exception      rb_eException      Any exceptions happen inside.
@@ -261,7 +263,8 @@ VALUE rb_funcall_passing_block(VALUE recv, ID mid, int argc, const VALUE *argv);
  * @param[in]      kw_splat           Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception      rb_eNoMethodError  No such method.
  * @exception      rb_eNoMethodError  The method is private or protected.
  * @exception      rb_eException      Any exceptions happen inside.
@@ -307,7 +310,8 @@ VALUE rb_funcall_with_block(VALUE recv, ID mid, int argc, const VALUE *argv, VAL
  * @param[in]      kw_splat           Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception      rb_eNoMethodError  No such method.
  * @exception      rb_eNoMethodError  The method is private or protected.
  * @exception      rb_eException      Any exceptions happen inside.
@@ -335,7 +339,8 @@ VALUE rb_call_super(int argc, const VALUE *argv);
  * @param[in]  kw_splat           Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eNoMethodError  No super method are there.
  * @exception  rb_eException      Any exceptions happen inside.
  * @return     What the super method evaluates to.
diff --git a/include/ruby/internal/fl_type.h b/include/ruby/internal/fl_type.h
index 0a05166784..f7ec742422 100644
--- a/include/ruby/internal/fl_type.h
+++ b/include/ruby/internal/fl_type.h
@@ -59,10 +59,8 @@
 #define FL_WB_PROTECTED RBIMPL_CAST((VALUE)RUBY_FL_WB_PROTECTED)         /**< @old{RUBY_FL_WB_PROTECTED} */
 #define FL_PROMOTED     RBIMPL_CAST((VALUE)RUBY_FL_PROMOTED)             /**< @old{RUBY_FL_PROMOTED} */
 #define FL_FINALIZE     RBIMPL_CAST((VALUE)RUBY_FL_FINALIZE)             /**< @old{RUBY_FL_FINALIZE} */
-#define FL_TAINT        RBIMPL_CAST((VALUE)RUBY_FL_TAINT)                /**< @old{RUBY_FL_TAINT} */
 #define FL_SHAREABLE    RBIMPL_CAST((VALUE)RUBY_FL_SHAREABLE)            /**< @old{RUBY_FL_SHAREABLE} */
 #define FL_UNTRUSTED    RBIMPL_CAST((VALUE)RUBY_FL_UNTRUSTED)            /**< @old{RUBY_FL_UNTRUSTED} */
-#define FL_SEEN_OBJ_ID  RBIMPL_CAST((VALUE)RUBY_FL_SEEN_OBJ_ID)          /**< @old{RUBY_FL_SEEN_OBJ_ID} */
 #define FL_EXIVAR       RBIMPL_CAST((VALUE)RUBY_FL_EXIVAR)               /**< @old{RUBY_FL_EXIVAR} */
 #define FL_FREEZE       RBIMPL_CAST((VALUE)RUBY_FL_FREEZE)               /**< @old{RUBY_FL_FREEZE} */
 
@@ -110,8 +108,6 @@
 #define RB_OBJ_FREEZE_RAW    RB_OBJ_FREEZE_RAW
 #define RB_OBJ_FROZEN        RB_OBJ_FROZEN
 #define RB_OBJ_FROZEN_RAW    RB_OBJ_FROZEN_RAW
-#define RB_OBJ_UNTRUST       RB_OBJ_TAINT
-#define RB_OBJ_UNTRUSTED     RB_OBJ_TAINTED
 /** @endcond */
 
 /**
@@ -136,15 +132,6 @@
 #define OBJ_FREEZE_RAW  RB_OBJ_FREEZE_RAW  /**< @old{RB_OBJ_FREEZE_RAW} */
 #define OBJ_FROZEN      RB_OBJ_FROZEN      /**< @old{RB_OBJ_FROZEN} */
 #define OBJ_FROZEN_RAW  RB_OBJ_FROZEN_RAW  /**< @old{RB_OBJ_FROZEN_RAW} */
-#define OBJ_INFECT      RB_OBJ_INFECT      /**< @old{RB_OBJ_INFECT} */
-#define OBJ_INFECT_RAW  RB_OBJ_INFECT_RAW  /**< @old{RB_OBJ_INFECT_RAW} */
-#define OBJ_TAINT       RB_OBJ_TAINT       /**< @old{RB_OBJ_TAINT} */
-#define OBJ_TAINTABLE   RB_OBJ_TAINTABLE   /**< @old{RB_OBJ_TAINT_RAW} */
-#define OBJ_TAINTED     RB_OBJ_TAINTED     /**< @old{RB_OBJ_TAINTED} */
-#define OBJ_TAINTED_RAW RB_OBJ_TAINTED_RAW /**< @old{RB_OBJ_TAINTED_RAW} */
-#define OBJ_TAINT_RAW   RB_OBJ_TAINT_RAW   /**< @old{RB_OBJ_TAINT_RAW} */
-#define OBJ_UNTRUST     RB_OBJ_UNTRUST     /**< @old{RB_OBJ_TAINT} */
-#define OBJ_UNTRUSTED   RB_OBJ_UNTRUSTED   /**< @old{RB_OBJ_TAINTED} */
 /** @} */
 
 /**
@@ -222,7 +209,7 @@ ruby_fl_type {
      *
      * @internal
      */
-    RUBY_FL_UNUSED6    = (1<<6),
+    RUBY_FL_UNUSED6      = (1<<6),
 
     /**
      * This flag has  something to do with finalisers.  A  ruby object can have
@@ -239,16 +226,16 @@ ruby_fl_type {
     RUBY_FL_FINALIZE     = (1<<7),
 
     /**
-     * @deprecated  This flag once was a thing  back in the old days, but makes
-     *              no  sense  any longer  today.   Exists  here for  backwards
+     * @deprecated  This flag was an implementation detail that should never have
+     *              no been exposed. Exists  here for  backwards
      *              compatibility only.  You can safely forget about it.
      */
-    RUBY_FL_TAINT
+    RUBY_FL_EXIVAR
 
 #if defined(RBIMPL_HAVE_ENUM_ATTRIBUTE)
-    RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
+    RBIMPL_ATTR_DEPRECATED(("FL_EXIVAR is an outdated implementation detail, it should not be used."))
 #elif defined(_MSC_VER)
-# pragma deprecated(RUBY_FL_TAINT)
+# pragma deprecated(RUBY_FL_EXIVAR)
 #endif
 
                          = 0,
@@ -265,52 +252,19 @@ ruby_fl_type {
      */
     RUBY_FL_SHAREABLE    = (1<<8),
 
-    /**
-     * @deprecated  This flag once was a thing  back in the old days, but makes
-     *              no  sense  any longer  today.   Exists  here for  backwards
-     *              compatibility only.  You can safely forget about it.
-     */
-    RUBY_FL_UNTRUSTED
-
-#if defined(RBIMPL_HAVE_ENUM_ATTRIBUTE)
-    RBIMPL_ATTR_DEPRECATED(("trustedness turned out to be a wrong idea."))
-#elif defined(_MSC_VER)
-# pragma deprecated(RUBY_FL_UNTRUSTED)
-#endif
-
-                         = 0,
-
-    /**
-     * This flag has something to do with  object IDs.  Unlike in the old days,
-     * an object's object  ID (that a user can  query using `Object#object_id`)
-     * is no longer its physical address represented using Ruby level integers.
-     * It is  now a  monotonic-increasing integer  unrelated to  the underlying
-     * memory arrangement.  Object IDs are assigned when necessary; objects are
-     * born without one,  and will eventually have such  property when queried.
-     * The interpreter has to manage which one is which.  This is the flag that
-     * helps the  management.  Objects  with this  flag set  are the  ones with
-     * object IDs assigned.
-     *
-     * @internal
-     *
-     * But honestly, @shyouhei  doesn't think this flag should  be visible from
-     * 3rd parties.  It must be an implementation detail that they should never
-     * know.  Might better be hidden.
-     */
-    RUBY_FL_SEEN_OBJ_ID  = (1<<9),
+   /**
+    * This object weakly refers to other objects.
+    *
+    * @internal
+    */
+    RUBY_FL_WEAK_REFERENCE = (1<<9),
 
-    /**
-     * This flag has something to do with instance variables.  3rd parties need
-     * not  know, but  there are  several ways  to store  an object's  instance
-     * variables.   Objects  with this  flag  use  so-called "generic"  backend
-     * storage.  This  distinction is purely an  implementation detail.  People
-     * need not be aware of this working behind-the-scene.
-     *
-     * @internal
-     *
-     * As of writing everything except ::RObject and RModule use this scheme.
-     */
-    RUBY_FL_EXIVAR       = (1<<10),
+   /**
+    * This flag is no longer in use
+    *
+    * @internal
+    */
+    RUBY_FL_UNUSED10 = (1<<10),
 
     /**
      * This flag has something to do with data immutability.  When this flag is
@@ -370,7 +324,7 @@ ruby_fl_type {
      * 3rd parties.  It must be an implementation detail that they should never
      * know.  Might better be hidden.
      */
-    RUBY_ELTS_SHARED  = RUBY_FL_USER2,
+    RUBY_ELTS_SHARED  = RUBY_FL_USER0,
 
     /**
      * This flag has something to do with an object's class.  There are kind of
@@ -398,23 +352,6 @@ ruby_fl_type {
     RUBY_FL_SINGLETON = RUBY_FL_USER1,
 };
 
-enum {
-    /**
-     * @deprecated  This flag once was a thing  back in the old days, but makes
-     *              no  sense  any longer  today.   Exists  here for  backwards
-     *              compatibility only.  You can safely forget about it.
-     */
-    RUBY_FL_DUPPED
-
-#if defined(RBIMPL_HAVE_ENUM_ATTRIBUTE)
-    RBIMPL_ATTR_DEPRECATED(("It seems there is no actual usage of this enum."))
-#elif defined(_MSC_VER)
-# pragma deprecated(RUBY_FL_DUPPED)
-#endif
-
-    = (int)RUBY_T_MASK | (int)RUBY_FL_EXIVAR
-};
-
 #undef RBIMPL_HAVE_ENUM_ATTRIBUTE
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
@@ -446,10 +383,8 @@ RB_FL_ABLE(VALUE obj)
     if (RB_SPECIAL_CONST_P(obj)) {
         return false;
     }
-    else if (RB_TYPE_P(obj, RUBY_T_NODE)) {
-        return false;
-    }
     else {
+        RBIMPL_ASSERT_OR_ASSUME(!RB_TYPE_P(obj, RUBY_T_NODE));
         return true;
     }
 }
@@ -743,128 +678,6 @@ RB_FL_REVERSE(VALUE obj, VALUE flags)
 
 RBIMPL_ATTR_PURE_UNLESS_DEBUG()
 RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   obj  Object in question.
- * @return      false always.
- */
-static inline bool
-RB_OBJ_TAINTABLE(VALUE obj)
-{
-    (void)obj;
-    return false;
-}
-
-RBIMPL_ATTR_PURE_UNLESS_DEBUG()
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   obj  Object in question.
- * @return      false always.
- */
-static inline VALUE
-RB_OBJ_TAINTED_RAW(VALUE obj)
-{
-    (void)obj;
-    return false;
-}
-
-RBIMPL_ATTR_PURE_UNLESS_DEBUG()
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   obj  Object in question.
- * @return      false always.
- */
-static inline bool
-RB_OBJ_TAINTED(VALUE obj)
-{
-    (void)obj;
-    return false;
-}
-
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   obj  Object in question.
- */
-static inline void
-RB_OBJ_TAINT_RAW(VALUE obj)
-{
-    (void)obj;
-    return;
-}
-
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   obj  Object in question.
- */
-static inline void
-RB_OBJ_TAINT(VALUE obj)
-{
-    (void)obj;
-    return;
-}
-
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   dst  Victim object.
- * @param[in]   src  Infectant object.
- */
-static inline void
-RB_OBJ_INFECT_RAW(VALUE dst, VALUE src)
-{
-    (void)dst;
-    (void)src;
-    return;
-}
-
-RBIMPL_ATTR_ARTIFICIAL()
-RBIMPL_ATTR_DEPRECATED(("taintedness turned out to be a wrong idea."))
-/**
- * @deprecated  This function  once was a thing  in the old days,  but makes no
- *              sense   any   longer   today.   Exists   here   for   backwards
- *              compatibility only.  You can safely forget about it.
- *
- * @param[in]   dst  Victim object.
- * @param[in]   src  Infectant object.
- */
-static inline void
-RB_OBJ_INFECT(VALUE dst, VALUE src)
-{
-    (void)dst;
-    (void)src;
-    return;
-}
-
-RBIMPL_ATTR_PURE_UNLESS_DEBUG()
-RBIMPL_ATTR_ARTIFICIAL()
 /**
  * This is an  implementation detail of RB_OBJ_FROZEN().  3rd  parties need not
  * use this.  Just always use RB_OBJ_FROZEN().
@@ -906,6 +719,14 @@ RB_OBJ_FROZEN(VALUE obj)
 }
 
 RUBY_SYMBOL_EXPORT_BEGIN
+/**
+ * Prevents further modifications to the given object.  ::rb_eFrozenError shall
+ * be raised if modification is attempted.
+ *
+ * @param[out]  x               Object in question.
+ * @exception   rb_eNoMemError  Failed   to   allocate memory  for  the  frozen
+ *                              representation of the object.
+ */
 void rb_obj_freeze_inline(VALUE obj);
 RUBY_SYMBOL_EXPORT_END
 
diff --git a/include/ruby/internal/gc.h b/include/ruby/internal/gc.h
index 462f416af2..1900b48a75 100644
--- a/include/ruby/internal/gc.h
+++ b/include/ruby/internal/gc.h
@@ -45,7 +45,7 @@
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 
 #define RUBY_REF_EDGE(s, p) offsetof(s, p)
-#define RUBY_REFS_LIST_PTR(l) (RUBY_DATA_FUNC)(l)
+#define RUBY_REFS_LIST_PTR(l) (RUBY_DATA_FUNC)(uintptr_t)(l)
 #define RUBY_REF_END SIZE_MAX
 #define RUBY_REFERENCES(t) static const size_t t[]
 #define RUBY_REFERENCES_START(t) RUBY_REFERENCES(t) = {
@@ -436,153 +436,6 @@ RBIMPL_SYMBOL_EXPORT_END()
 #endif
 
 /**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RArray.  It has to be set  at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_ARRAY
-# define RGENGC_WB_PROTECTED_ARRAY 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RHash.  It has  to be set at the time  ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_HASH
-# define RGENGC_WB_PROTECTED_HASH 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RStruct.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_STRUCT
-# define RGENGC_WB_PROTECTED_STRUCT 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RString.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_STRING
-# define RGENGC_WB_PROTECTED_STRING 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RObject.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_OBJECT
-# define RGENGC_WB_PROTECTED_OBJECT 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RRegexp.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_REGEXP
-# define RGENGC_WB_PROTECTED_REGEXP 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RMatch.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_MATCH
-# define RGENGC_WB_PROTECTED_MATCH 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RClass.  It has to be set  at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_CLASS
-# define RGENGC_WB_PROTECTED_CLASS 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RFloat.  It has to be set  at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_FLOAT
-# define RGENGC_WB_PROTECTED_FLOAT 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RComplex.   It has  to be  set at  the time  ruby itself  compiles.
- * Makes no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_COMPLEX
-# define RGENGC_WB_PROTECTED_COMPLEX 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RRational.  It  has to  be set  at the  time ruby  itself compiles.
- * Makes no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_RATIONAL
-# define RGENGC_WB_PROTECTED_RATIONAL 1
-#endif
-
-/**
- * @private
- *
- * This  is   a  compile-time   flag  to   enable/disable  write   barrier  for
- * struct ::RBignum.  It has to be set at the time ruby itself compiles.  Makes
- * no sense for 3rd parties.
- */
-#ifndef RGENGC_WB_PROTECTED_BIGNUM
-# define RGENGC_WB_PROTECTED_BIGNUM 1
-#endif
-
-/**
- * @private
- *
- * @deprecated  This macro once was a thing in the old days, but makes no sense
- *              any  longer today.   Exists  here  for backwards  compatibility
- *              only.  You can safely forget about it.
- *
- * @internal
- *
- * @shyouhei doesn't think anybody uses this right now.
- */
-#ifndef RGENGC_WB_PROTECTED_NODE_CREF
-# define RGENGC_WB_PROTECTED_NODE_CREF 1
-#endif
-
-/**
  * @defgroup rgengc Write barrier (WB) interfaces:
  *
  * @note The following  core interfaces can  be changed in the  future.  Please
@@ -621,11 +474,11 @@ RBIMPL_SYMBOL_EXPORT_END()
 #define OBJ_WB_UNPROTECT RB_OBJ_WB_UNPROTECT /**< @old{RB_OBJ_WB_UNPROTECT} */
 
 /**
- * Asserts that the passed object is  not fenced by write barriers.  Objects of
- * such  property do  not contribute  to  generational GCs.   They are  scanned
- * always.
+ * Marks the object as not protected by write barriers. These objects do not
+ * participate in generational GCs which means that, as long as the object is
+ * alive, they will be scanned on every GC cycle.
  *
- * @param[out]  x  An object that would not be protected by the barrier.
+ * @param[out]  x  An object that is not protected by the write barrier.
  */
 #define RB_OBJ_WB_UNPROTECT(x) rb_obj_wb_unprotect(x, __FILE__, __LINE__)
 
@@ -640,8 +493,7 @@ RBIMPL_SYMBOL_EXPORT_END()
  *
  * @shyouhei doesn't understand why this has to be visible from extensions.
  */
-#define RB_OBJ_WB_UNPROTECT_FOR(type, obj) \
-    (RGENGC_WB_PROTECTED_##type ? OBJ_WB_UNPROTECT(obj) : obj)
+#define RB_OBJ_WB_UNPROTECT_FOR(type, obj) OBJ_WB_UNPROTECT(obj)
 
 /**
  * @private
@@ -823,7 +675,4 @@ rb_obj_write(
     return a;
 }
 
-RBIMPL_ATTR_DEPRECATED(("Will be removed soon"))
-static inline void rb_gc_force_recycle(VALUE obj){}
-
 #endif /* RBIMPL_GC_H */
diff --git a/include/ruby/internal/globals.h b/include/ruby/internal/globals.h
index 60d8e5309a..9beb215c0c 100644
--- a/include/ruby/internal/globals.h
+++ b/include/ruby/internal/globals.h
@@ -68,6 +68,7 @@ RUBY_EXTERN VALUE rb_cBasicObject;            /**< `BasicObject` class. */
 RUBY_EXTERN VALUE rb_cObject;                 /**< `Object` class. */
 RUBY_EXTERN VALUE rb_cArray;                  /**< `Array` class. */
 RUBY_EXTERN VALUE rb_cBinding;                /**< `Binding` class. */
+RUBY_EXTERN VALUE rb_cBox;                    /**< `Ruby::Box` class. */
 RUBY_EXTERN VALUE rb_cClass;                  /**< `Class` class. */
 RUBY_EXTERN VALUE rb_cDir;                    /**< `Dir` class. */
 RUBY_EXTERN VALUE rb_cEncoding;               /**< `Encoding` class. */
@@ -91,6 +92,7 @@ RUBY_EXTERN VALUE rb_cRandom;                 /**< `Random` class. */
 RUBY_EXTERN VALUE rb_cRange;                  /**< `Range` class. */
 RUBY_EXTERN VALUE rb_cRational;               /**< `Rational` class. */
 RUBY_EXTERN VALUE rb_cRegexp;                 /**< `Regexp` class. */
+RUBY_EXTERN VALUE rb_cSet;                    /**< `Set` class. */
 RUBY_EXTERN VALUE rb_cStat;                   /**< `File::Stat` class. */
 RUBY_EXTERN VALUE rb_cString;                 /**< `String` class. */
 RUBY_EXTERN VALUE rb_cStruct;                 /**< `Struct` class. */
diff --git a/include/ruby/internal/has/builtin.h b/include/ruby/internal/has/builtin.h
index 243ba2a34c..8e7fb173d8 100644
--- a/include/ruby/internal/has/builtin.h
+++ b/include/ruby/internal/has/builtin.h
@@ -48,6 +48,7 @@
 # /* https://gcc.gnu.org/bugzilla/show_bug.cgi?id=66970 */
 # define RBIMPL_HAS_BUILTIN(_) (RBIMPL_HAS_BUILTIN_ ## _)
 # define RBIMPL_HAS_BUILTIN___builtin_add_overflow      RBIMPL_COMPILER_SINCE(GCC, 5, 1, 0)
+# define RBIMPL_HAS_BUILTIN___builtin_add_overflow_p    RBIMPL_COMPILER_SINCE(GCC, 7, 0, 0)
 # define RBIMPL_HAS_BUILTIN___builtin_alloca            RBIMPL_COMPILER_SINCE(GCC, 0, 0, 0)
 # define RBIMPL_HAS_BUILTIN___builtin_alloca_with_align RBIMPL_COMPILER_SINCE(GCC, 6, 1, 0)
 # define RBIMPL_HAS_BUILTIN___builtin_assume            0
@@ -75,6 +76,7 @@
 # define RBIMPL_HAS_BUILTIN___builtin_rotateright32     0
 # define RBIMPL_HAS_BUILTIN___builtin_rotateright64     0
 # define RBIMPL_HAS_BUILTIN___builtin_sub_overflow      RBIMPL_COMPILER_SINCE(GCC, 5, 1, 0)
+# define RBIMPL_HAS_BUILTIN___builtin_sub_overflow_p    RBIMPL_COMPILER_SINCE(GCC, 7, 0, 0)
 # define RBIMPL_HAS_BUILTIN___builtin_unreachable       RBIMPL_COMPILER_SINCE(GCC, 4, 5, 0)
 # /* Note that "0, 0, 0" might be inaccurate. */
 
@@ -82,6 +84,7 @@
 # /* Take config.h definition when available */
 # define RBIMPL_HAS_BUILTIN(_) ((RBIMPL_HAS_BUILTIN_ ## _)+0)
 # define RBIMPL_HAS_BUILTIN___builtin_add_overflow      HAVE_BUILTIN___BUILTIN_ADD_OVERFLOW
+# define RBIMPL_HAS_BUILTIN___builtin_add_overflow_p    HAVE_BUILTIN___BUILTIN_ADD_OVERFLOW_P
 # define RBIMPL_HAS_BUILTIN___builtin_alloca            0
 # define RBIMPL_HAS_BUILTIN___builtin_alloca_with_align HAVE_BUILTIN___BUILTIN_ALLOCA_WITH_ALIGN
 # define RBIMPL_HAS_BUILTIN___builtin_assume            0
@@ -107,6 +110,7 @@
 # define RBIMPL_HAS_BUILTIN___builtin_rotateright64     0
 # define RBIMPL_HAS_BUILTIN___builtin_popcountll        HAVE_BUILTIN___BUILTIN_POPCOUNTLL
 # define RBIMPL_HAS_BUILTIN___builtin_sub_overflow      HAVE_BUILTIN___BUILTIN_SUB_OVERFLOW
+# define RBIMPL_HAS_BUILTIN___builtin_sub_overflow_p    HAVE_BUILTIN___BUILTIN_SUB_OVERFLOW_P
 # if defined(HAVE___BUILTIN_UNREACHABLE)
 #  define RBIMPL_HAS_BUILTIN___builtin_unreachable 1
 # else
diff --git a/include/ruby/internal/intern/array.h b/include/ruby/internal/intern/array.h
index 1909fdf17b..b2cc6b132d 100644
--- a/include/ruby/internal/intern/array.h
+++ b/include/ruby/internal/intern/array.h
@@ -144,7 +144,13 @@ void rb_ary_free(VALUE ary);
  */
 void rb_ary_modify(VALUE ary);
 
-/** @alias{rb_obj_freeze} */
+/**
+ * Freeze an array, preventing further modifications. The underlying  buffer may
+ * be shrunk before freezing to conserve memory.
+ *
+ * @param[out]  obj  Object assumed to be an array to freeze.
+ * @see         RB_OBJ_FREEZE()
+ */
 VALUE rb_ary_freeze(VALUE obj);
 
 RBIMPL_ATTR_PURE()
diff --git a/include/ruby/internal/intern/bignum.h b/include/ruby/internal/intern/bignum.h
index c27f77a1fb..6ab26fef71 100644
--- a/include/ruby/internal/intern/bignum.h
+++ b/include/ruby/internal/intern/bignum.h
@@ -26,6 +26,10 @@
 # include <stddef.h>
 #endif
 
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>         /* for ssize_t (note: on Windows ssize_t is */
+#endif                          /* `#define`d in ruby/config.h) */
+
 #include "ruby/internal/attr/nonnull.h"
 #include "ruby/internal/dllexport.h"
 #include "ruby/internal/value.h"
@@ -841,6 +845,47 @@ size_t rb_absint_numwords(VALUE val, size_t word_numbits, size_t *nlz_bits_ret);
  */
 int rb_absint_singlebit_p(VALUE val);
 
+/**
+ * @name Flags for rb_int_parse_cstr()
+ * @{
+ */
+
+/** Allows a leading sign (`+` or `-`). */
+#define RB_INT_PARSE_SIGN       0x01
+
+/** Allows underscores between digits. */
+#define RB_INT_PARSE_UNDERSCORE 0x02
+
+/** Allows a base prefix (`0x`, `0b`, `0o`, `0d`). */
+#define RB_INT_PARSE_PREFIX     0x04
+
+/** Shorthand for all of the above flags combined. */
+#define RB_INT_PARSE_ALL        0x07
+
+/** Default flags (all features enabled). */
+#define RB_INT_PARSE_DEFAULT    0x07
+
+/** @} */
+
+/**
+ * Parses a C string to convert into a Ruby integer, with detailed control over
+ * parsing behaviour.  Unlike rb_cstr_to_inum(), this function can report the
+ * end position of the parsed integer and the number of parsed digits.
+ *
+ * @param[in]   str       Pointer to the string to parse.
+ * @param[in]   len       Length of `str` in bytes, or `-1` to use `strlen(str)`.
+ * @param[out]  endp      If not `NULL`, the pointer to the first unparsed
+ *                        character is stored here on return.
+ * @param[out]  ndigits   If not `NULL`, the number of parsed digits (excluding
+ *                        prefix, sign, and underscores) is stored here.
+ * @param[in]   base      Base of conversion.  `0` means auto-detect from
+ *                        prefix.  `2..36` for explicit base.
+ * @param[in]   flags     Bitwise or of `RB_INT_PARSE_*` macros.
+ * @return      A Ruby Integer (Fixnum or Bignum), or `Qnil` on parse failure
+ *              (when no digits are found).
+ */
+VALUE rb_int_parse_cstr(const char *str, ssize_t len, char **endp, size_t *ndigits, int base, int flags);
+
 RBIMPL_SYMBOL_EXPORT_END()
 
 #endif /* RBIMPL_INTERN_BIGNUM_H */
diff --git a/include/ruby/internal/intern/complex.h b/include/ruby/internal/intern/complex.h
index e111bd8ced..1efc093631 100644
--- a/include/ruby/internal/intern/complex.h
+++ b/include/ruby/internal/intern/complex.h
@@ -87,10 +87,6 @@ VALUE rb_complex_new(VALUE real, VALUE imag);
  */
 VALUE rb_complex_new_polar(VALUE abs, VALUE arg);
 
-RBIMPL_ATTR_DEPRECATED(("by: rb_complex_new_polar"))
-/** @old{rb_complex_new_polar} */
-VALUE rb_complex_polar(VALUE abs, VALUE arg);
-
 RBIMPL_ATTR_PURE()
 /**
  * Queries the real part of the passed Complex.
diff --git a/include/ruby/internal/intern/cont.h b/include/ruby/internal/intern/cont.h
index 32647f48aa..2d813ceb9d 100644
--- a/include/ruby/internal/intern/cont.h
+++ b/include/ruby/internal/intern/cont.h
@@ -148,7 +148,8 @@ VALUE rb_fiber_resume(VALUE fiber, int argc, const VALUE *argv);
  * @param[in]   kw_splat        Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception   rb_eFiberError  `fiber` is terminated etc.
  * @exception   rb_eException   Any exceptions happen in `fiber`.
  * @return      Either what was yielded or the last value of the fiber body.
@@ -192,7 +193,8 @@ VALUE rb_fiber_yield(int argc, const VALUE *argv);
  * @param[in]  kw_splat        Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eException   What was raised using `Fiber#raise`.
  * @return     (See rb_fiber_resume() for details)
  */
@@ -247,7 +249,8 @@ VALUE rb_fiber_transfer(VALUE fiber, int argc, const VALUE *argv);
  * @param[in]   kw_splat        Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception   rb_eFiberError  (See above)
  * @exception   rb_eException   What was raised using `Fiber#raise`.
  * @return      (See rb_fiber_resume() for details)
@@ -275,7 +278,7 @@ VALUE rb_fiber_transfer_kw(VALUE fiber, int argc, const VALUE *argv, int kw_spla
  * @exception   rb_eFiberError  `fiber` is terminated etc.
  * @return      (See rb_fiber_resume() for details)
  */
-VALUE rb_fiber_raise(VALUE fiber, int argc, const VALUE *argv);
+VALUE rb_fiber_raise(VALUE fiber, int argc, VALUE *argv);
 
 RBIMPL_SYMBOL_EXPORT_END()
 
diff --git a/include/ruby/internal/intern/enumerator.h b/include/ruby/internal/intern/enumerator.h
index 20e5d7c6fc..00804d786a 100644
--- a/include/ruby/internal/intern/enumerator.h
+++ b/include/ruby/internal/intern/enumerator.h
@@ -100,7 +100,8 @@ VALUE rb_enumeratorize_with_size(VALUE recv, VALUE meth, int argc, const VALUE *
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eTypeError    `meth` is not an instance of ::rb_cSymbol.
  * @return     A  new   instance  of  ::rb_cEnumerator  which,   when  yielded,
  *             enumerates by calling `meth` on `recv` with `argv`.
@@ -186,7 +187,8 @@ RBIMPL_SYMBOL_EXPORT_END()
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @return     A  new   instance  of  ::rb_cEnumerator  which,   when  yielded,
  *             enumerates by calling the current method on `recv` with `argv`.
  */
@@ -220,7 +222,8 @@ RBIMPL_SYMBOL_EXPORT_END()
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @note       This macro may return inside.
  */
 #define RETURN_SIZED_ENUMERATOR_KW(obj, argc, argv, size_fn, kw_splat) do { \
@@ -250,7 +253,8 @@ RBIMPL_SYMBOL_EXPORT_END()
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @note       This macro may return inside.
  */
 #define RETURN_ENUMERATOR_KW(obj, argc, argv, kw_splat) \
diff --git a/include/ruby/internal/intern/error.h b/include/ruby/internal/intern/error.h
index 2ca51d0111..1fd9ec2f51 100644
--- a/include/ruby/internal/intern/error.h
+++ b/include/ruby/internal/intern/error.h
@@ -237,6 +237,8 @@ RBIMPL_ATTR_NORETURN()
  */
 void rb_error_arity(int argc, int min, int max);
 
+void rb_str_modify(VALUE str);
+
 RBIMPL_SYMBOL_EXPORT_END()
 
 /**
@@ -247,7 +249,23 @@ RBIMPL_SYMBOL_EXPORT_END()
 #define rb_check_frozen_internal rb_check_frozen
 
 /** @alias{rb_check_frozen} */
-#define rb_check_frozen_inline rb_check_frozen
+static inline void
+rb_check_frozen_inline(VALUE obj)
+{
+    if (RB_UNLIKELY(RB_OBJ_FROZEN(obj))) {
+        rb_error_frozen_object(obj);
+    }
+
+    /* ref: internal CHILLED_STRING_P()
+       This is an implementation detail subject to change. */
+    if (RB_UNLIKELY(RB_TYPE_P(obj, T_STRING) && FL_TEST_RAW(obj, RUBY_FL_USER2 | RUBY_FL_USER3))) { // STR_CHILLED
+        rb_str_modify(obj);
+    }
+}
+
+/* rb_check_frozen() is available as a symbol, but have
+ * the inline version take priority for native consumers. */
+#define rb_check_frozen rb_check_frozen_inline
 
 /**
  * Ensures that the  passed integer is in  the passed range.  When  you can use
diff --git a/include/ruby/internal/intern/file.h b/include/ruby/internal/intern/file.h
index 79820fdc61..8508b7ab9e 100644
--- a/include/ruby/internal/intern/file.h
+++ b/include/ruby/internal/intern/file.h
@@ -24,6 +24,9 @@
 #include "ruby/internal/attr/pure.h"
 #include "ruby/internal/dllexport.h"
 #include "ruby/internal/value.h"
+#if !defined RUBY_EXPORT && !defined RUBY_NO_OLD_COMPATIBILITY
+# include "ruby/backward.h"
+#endif
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 
diff --git a/include/ruby/internal/intern/hash.h b/include/ruby/internal/intern/hash.h
index af8dfd5d8f..504770fa5f 100644
--- a/include/ruby/internal/intern/hash.h
+++ b/include/ruby/internal/intern/hash.h
@@ -284,20 +284,6 @@ typedef VALUE rb_hash_update_func(VALUE newkey, VALUE oldkey, VALUE value);
  */
 VALUE rb_hash_update_by(VALUE hash1, VALUE hash2, rb_hash_update_func *func);
 
-/* file.c */
-
-/**
- * This function is mysterious.  What it does is not immediately obvious.  Also
- * what it does seems platform dependent.
- *
- * @param[in]  path       A local path.
- * @retval     0          The "check" succeeded.
- * @retval     otherwise  The "check" failed.
- */
-int rb_path_check(const char *path);
-
-/* hash.c */
-
 /**
  * Destructively removes every environment variables of the running process.
  *
diff --git a/include/ruby/internal/intern/io.h b/include/ruby/internal/intern/io.h
index 02c249723e..b9eb258cc1 100644
--- a/include/ruby/internal/intern/io.h
+++ b/include/ruby/internal/intern/io.h
@@ -385,7 +385,7 @@ VALUE rb_io_puts(int argc, const VALUE *argv, VALUE io);
  * @param[in]  fd     Target file descriptor.
  * @param[in]  flags  Flags, e.g. `O_CREAT|O_EXCL`
  * @param[in]  path   The path of the file that backs `fd`, for diagnostics.
- * @return     An allocated instance of ::rb_cIO.
+ * @return     An allocated instance of ::rb_cIO with the autoclose flag set.
  * @note       Leave `path` NULL if you don't know.
  */
 VALUE rb_io_fdopen(int fd, int flags, const char *path);
diff --git a/include/ruby/internal/intern/object.h b/include/ruby/internal/intern/object.h
index 9daad7d046..3897639a0a 100644
--- a/include/ruby/internal/intern/object.h
+++ b/include/ruby/internal/intern/object.h
@@ -80,7 +80,8 @@ VALUE rb_class_new_instance(int argc, const VALUE *argv, VALUE klass);
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eTypeError    `klass`'s allocator is undefined.
  * @exception  rb_eException    Any exceptions can happen inside.
  * @return     An allocated new instance of `klass`.
diff --git a/include/ruby/internal/intern/proc.h b/include/ruby/internal/intern/proc.h
index b8c3c5e146..2635d672eb 100644
--- a/include/ruby/internal/intern/proc.h
+++ b/include/ruby/internal/intern/proc.h
@@ -101,7 +101,8 @@ VALUE rb_proc_call(VALUE recv, VALUE args);
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `args`' last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `args`' last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eException    Any exceptions happen inside.
  * @return     What the proc evaluates to.
  */
@@ -141,7 +142,8 @@ VALUE rb_proc_call_with_block(VALUE recv, int argc, const VALUE *argv, VALUE pro
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `args`' last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `args`' last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eException    Any exceptions happen inside.
  * @return     What the proc evaluates to.
  */
@@ -245,7 +247,8 @@ VALUE rb_method_call(int argc, const VALUE *argv, VALUE recv);
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `args`' last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `args`' last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eTypeError    `recv` is not a method.
  * @exception  rb_eException    Any exceptions happen inside.
  * @return     What the method returns.
@@ -279,7 +282,8 @@ VALUE rb_method_call_with_block(int argc, const VALUE *argv, VALUE recv, VALUE p
  * @param[in]  kw_splat         Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `args`' last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `args`' last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @exception  rb_eTypeError    `recv` is not a method.
  * @exception  rb_eException    Any exceptions happen inside.
  * @return     What the method returns.
diff --git a/include/ruby/internal/intern/select.h b/include/ruby/internal/intern/select.h
index 6ba84c6e63..ba75213618 100644
--- a/include/ruby/internal/intern/select.h
+++ b/include/ruby/internal/intern/select.h
@@ -72,6 +72,8 @@ struct timeval;
  * someone else, vastly varies among operating systems.  You would better avoid
  * touching an fd from more than one threads.
  *
+ * NOTE: this function is used in native extensions, so change its API with care.
+ *
  * @internal
  *
  * Although  any file  descriptors are  possible here,  it makes  completely no
diff --git a/include/ruby/internal/intern/select/win32.h b/include/ruby/internal/intern/select/win32.h
index edaf7a8523..b7301e63f3 100644
--- a/include/ruby/internal/intern/select/win32.h
+++ b/include/ruby/internal/intern/select/win32.h
@@ -206,7 +206,7 @@ rb_fd_dup(rb_fdset_t *dst, const rb_fdset_t *src)
  * property  we heavily  touch  the  internals of  MSVCRT.   We `CreateFile`  a
  * `"NUL"` alongside of  a socket and directly manipulate  its `struct ioinfo`.
  * This is of  course a very dirty hack.   If we could design the  API today we
- * could use `CancellIoEx`.  But we are older than that Win32 API.
+ * could use `CancelIoEx`.  But we are older than that Win32 API.
  */
 static inline int
 rb_fd_select(int n, rb_fdset_t *rfds, rb_fdset_t *wfds, rb_fdset_t *efds, struct timeval *timeout)
@@ -253,7 +253,7 @@ rb_fd_max(const rb_fdset_t *f)
     const fd_set *p = f->fdset;
 
     RBIMPL_ASSERT_OR_ASSUME(p);
-    return p->fd_count;
+    return RBIMPL_CAST((int)p->fd_count);
 }
 
 #endif /* RBIMPL_INTERN_SELECT_WIN32_H */
diff --git a/include/ruby/internal/intern/set.h b/include/ruby/internal/intern/set.h
new file mode 100644
index 0000000000..f4ff8665e2
--- /dev/null
+++ b/include/ruby/internal/intern/set.h
@@ -0,0 +1,111 @@
+#ifndef RBIMPL_INTERN_SET_H                         /*-*-C++-*-vi:se ft=cpp:*/
+#define RBIMPL_INTERN_SET_H
+/**
+ * @file
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  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.
+ * @warning    Symbols   prefixed  with   either  `RBIMPL`   or  `rbimpl`   are
+ *             implementation details.   Don't take  them as canon.  They could
+ *             rapidly appear then vanish.  The name (path) of this header file
+ *             is also an  implementation detail.  Do not expect  it to persist
+ *             at the place it is now.  Developers are free to move it anywhere
+ *             anytime at will.
+ * @note       To  ruby-core:  remember  that   this  header  can  be  possibly
+ *             recursively included  from extension  libraries written  in C++.
+ *             Do not  expect for  instance `__VA_ARGS__` is  always available.
+ *             We assume C99  for ruby itself but we don't  assume languages of
+ *             extension libraries.  They could be written in C++98.
+ * @brief      Public APIs related to ::rb_cSet.
+ */
+#include "ruby/internal/attr/nonnull.h"
+#include "ruby/internal/dllexport.h"
+#include "ruby/internal/value.h"
+
+RBIMPL_SYMBOL_EXPORT_BEGIN()
+
+/* set.c */
+
+RBIMPL_ATTR_NONNULL(())
+/**
+ * Iterates   over  a   set.  Calls func with each element of the set and the
+ * argument given. func should return ST_CONTINUE, ST_STOP, or ST_DELETE.
+ *
+ * @param[in]  set               An instance of ::rb_cSet to iterate over.
+ * @param[in]  func              Callback function to yield.
+ * @param[in]  arg               Passed as-is to `func`.
+ * @exception  rb_eRuntimeError  `set` was tampered during iterating.
+ */
+void rb_set_foreach(VALUE set, int (*func)(VALUE element, VALUE arg), VALUE arg);
+
+/**
+ * Creates a new, empty set object.
+ *
+ * @return  An allocated new instance of ::rb_cSet.
+ */
+VALUE rb_set_new(void);
+
+/**
+ * Identical to rb_set_new(), except it additionally specifies how many elements
+ * it is expected to contain. This way you can create a set that is large enough
+ * for your need. For large sets, it means it won't need to be reallocated
+ * much, improving performance.
+ *
+ * @param[in]  capa  Designed capacity of the set.
+ * @return     An empty Set, whose capacity is `capa`.
+ */
+VALUE rb_set_new_capa(size_t capa);
+
+/**
+ * Whether the set contains the given element.
+ *
+ * @param[in]  set      Set to look into.
+ * @param[in]  element  Set element to look for.
+ * @return     true if element is in the set, falst otherwise.
+ */
+bool rb_set_lookup(VALUE set, VALUE element);
+
+/**
+ * Adds element to set.
+ *
+ * @param[in]   set              Target set table to modify.
+ * @param[in]   element          Arbitrary Ruby object.
+ * @exception   rb_eFrozenError  `set` is frozen.
+ * @return      true if element was not already in set, false otherwise
+ * @post        `element` is in `set`.
+ */
+bool rb_set_add(VALUE set, VALUE element);
+
+/**
+ * Removes all entries from set.
+ *
+ * @param[out]  set             Target to clear.
+ * @exception   rb_eFrozenError  `set`is frozen.
+ * @return      The passed `set`
+ * @post        `set` has no elements.
+ */
+VALUE rb_set_clear(VALUE set);
+
+/**
+ * Removes the element from from set.
+ *
+ * @param[in]   set        Target set to modify.
+ * @param[in]   element    Key to delete.
+ * @retval      true if element was already in set, false otherwise
+ * @post        `set` does not have `element` as an element.
+ */
+bool rb_set_delete(VALUE set, VALUE element);
+
+/**
+ * Returns the number of elements in the set.
+ *
+ * @param[in]  set  A set object.
+ * @return     The size of the set.
+ */
+size_t rb_set_size(VALUE set);
+
+RBIMPL_SYMBOL_EXPORT_END()
+
+#endif /* RBIMPL_INTERN_SET_H */
diff --git a/include/ruby/internal/intern/string.h b/include/ruby/internal/intern/string.h
index 37dee45527..8bd1ffcfb4 100644
--- a/include/ruby/internal/intern/string.h
+++ b/include/ruby/internal/intern/string.h
@@ -412,8 +412,8 @@ VALUE rb_utf8_str_new_static(const char *ptr, long len);
 
 /**
  * Identical to rb_interned_str(),  except it takes a Ruby's  string instead of
- * C's.  It can also be seen  as a routine identical to rb_str_new_shared(),
- * except it returns an infamous "f"string.
+ * C's and preserves its encoding.  It can also be seen  as a routine identical
+ * to rb_str_new_shared(), except it returns an infamous "f"string.
  *
  * @param[in]  str  An object of ::RString.
  * @return     An instance  of ::rb_cString, either cached  or allocated, which
@@ -444,8 +444,9 @@ VALUE rb_str_to_interned_str(VALUE str);
  *                           terminating NUL character.
  * @exception  rb_eArgError  `len` is negative.
  * @return     A  found or  created instance  of ::rb_cString,  of `len`  bytes
- *             length, of  "binary" encoding,  whose contents are  identical to
- *             that of `ptr`.
+ *             length,  whose  contents  are  identical  to that of `ptr`.  Its
+ *             encoding  will  be US-ASCII if all bytes are lower ASCII, BINARY
+ *             otherwise.
  * @pre        At  least  `len` bytes  of  continuous  memory region  shall  be
  *             accessible via `ptr`.
  */
@@ -461,8 +462,9 @@ RBIMPL_ATTR_NONNULL(())
  *
  * @param[in]  ptr             A C string.
  * @exception  rb_eNoMemError  Failed to allocate memory.
- * @return     An  instance  of  ::rb_cString,   of  "binary"  encoding,  whose
- *             contents are verbatim copy of `ptr`.
+ * @return     An  instance  of  ::rb_cString, whose contents are verbatim copy
+ *             of `ptr`. Its encoding  will  be US-ASCII if all bytes are lower
+ *             ASCII, BINARY otherwise.
  * @pre        `ptr` must not be a null pointer.
  */
 VALUE rb_interned_str_cstr(const char *ptr);
@@ -591,10 +593,9 @@ void rb_must_asciicompat(VALUE obj);
 VALUE rb_str_dup(VALUE str);
 
 /**
- * I guess there  is no use case  of this function in  extension libraries, but
- * this is  a routine identical  to rb_str_dup(),  except it always  creates an
- * instance of ::rb_cString regardless of the given object's class.  This makes
- * the most sense when the passed string is formerly hidden by rb_obj_hide().
+ * Like rb_str_dup(), but always create an instance of  ::rb_cString
+ * regardless of the given object's class. This makes the most sense
+ * when the passed string is formerly hidden by rb_obj_hide().
  *
  * @param[in]  str  A string, possibly hidden.
  * @return     A duplicated new instance of ::rb_cString.
@@ -970,8 +971,8 @@ st_index_t rb_str_hash(VALUE str);
  *
  * @param[in]  str1  A string.
  * @param[in]  str2  Another string.
- * @retval     1     They have identical contents, length, and encodings.
- * @retval     0     Otherwise.
+ * @retval     0     They have identical contents, length, and encodings.
+ * @retval     1     Otherwise.
  * @pre        Both   objects   must  not  be  any   arbitrary  objects  except
  *             ::RString.
  *
@@ -1686,10 +1687,10 @@ rbimpl_exc_new_cstr(VALUE exc, const char *str)
  * Length of a string literal.
  *
  * @param[in]  str  A C String literal.
- * @return     An integer  constant expression that represents  `str`'s length,
- *             in bytes, not including the terminating NUL character.
+ * @return     An  integer constant  expression that  represents the  number of
+ *             `str`'s elements, not including the terminating NUL character.
  */
-#define rb_strlen_lit(str) (sizeof(str "") - 1)
+#define rb_strlen_lit(str) ((sizeof(str "") / sizeof(str ""[0])) - 1)
 
 /**
  * Identical to rb_str_new_static(), except it cannot take string variables.
diff --git a/include/ruby/internal/intern/thread.h b/include/ruby/internal/intern/thread.h
index 716375acd7..4d87452745 100644
--- a/include/ruby/internal/intern/thread.h
+++ b/include/ruby/internal/intern/thread.h
@@ -61,10 +61,10 @@ int rb_thread_wait_fd(int fd);
 int rb_thread_fd_writable(int fd);
 
 /**
- * Notifies a closing of a file  descriptor to other threads.  Multiple threads
- * can wait for the given file descriptor  at once.  If such file descriptor is
- * closed, threads need to start propagating their exceptions.  This is the API
- * to kick that process.
+ * This funciton is now a no-op. It was previously used to interrupt threads
+ * that were using the given file descriptor and wait for them to finish.
+ *
+ * @deprecated Use IO with RUBY_IO_MODE_EXTERNAL and `rb_io_close` instead.
  *
  * @param[in]  fd  A file descriptor.
  * @note       This function blocks  until all the threads waiting  for such fd
diff --git a/include/ruby/internal/intern/variable.h b/include/ruby/internal/intern/variable.h
index 479c3950c1..315584790c 100644
--- a/include/ruby/internal/intern/variable.h
+++ b/include/ruby/internal/intern/variable.h
@@ -48,6 +48,7 @@ VALUE rb_mod_name(VALUE mod);
  */
 VALUE rb_class_path(VALUE mod);
 
+RBIMPL_ATTR_DEPRECATED(("rb_mod_name"))
 /**
  * @alias{rb_mod_name}
  *
diff --git a/include/ruby/internal/intern/vm.h b/include/ruby/internal/intern/vm.h
index 29e0c7f534..f0b54c702c 100644
--- a/include/ruby/internal/intern/vm.h
+++ b/include/ruby/internal/intern/vm.h
@@ -89,7 +89,8 @@ VALUE rb_check_funcall(VALUE recv, ID mid, int argc, const VALUE *argv);
  * @param[in]      kw_splat     Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @retval         RUBY_Qundef  `recv` doesn't respond to `mid`.
  * @retval         otherwise    What the method evaluates to.
  */
@@ -106,9 +107,11 @@ VALUE rb_check_funcall_kw(VALUE recv, ID mid, int argc, const VALUE *argv, int k
  * @param[in]  kw_splat  Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `arg`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `arg`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @return     What the command evaluates to.
  */
+RBIMPL_ATTR_DEPRECATED_INTERNAL(4.0)
 VALUE rb_eval_cmd_kw(VALUE cmd, VALUE arg, int kw_splat);
 
 /**
diff --git a/include/ruby/internal/iterator.h b/include/ruby/internal/iterator.h
index 5f706460f8..891045363e 100644
--- a/include/ruby/internal/iterator.h
+++ b/include/ruby/internal/iterator.h
@@ -265,48 +265,6 @@ int rb_block_given_p(void);
  */
 void rb_need_block(void);
 
-#ifndef __cplusplus
-RBIMPL_ATTR_DEPRECATED(("by: rb_block_call since 1.9"))
-#endif
-/**
- * Old way to iterate a block.
- *
- * @deprecated     This is an old API.  Use rb_block_call() instead.
- * @warning        The passed  function must at  least once call a  ruby method
- *                 (to handle interrupts etc.)
- * @param[in]      func1  A function that could yield a value.
- * @param[in,out]  data1  Passed to `func1`
- * @param[in]      proc   A function acts as a block.
- * @param[in,out]  data2  Passed to `proc` as the data2 parameter.
- * @return         What `func1` returns.
- */
-VALUE rb_iterate(VALUE (*func1)(VALUE), VALUE data1, rb_block_call_func_t proc, VALUE data2);
-
-#ifdef __cplusplus
-namespace ruby {
-namespace backward {
-/**
- * Old way to iterate a block.
- *
- * @deprecated     This is an old API.  Use rb_block_call() instead.
- * @warning        The passed  function must at  least once call a  ruby method
- *                 (to handle interrupts etc.)
- * @param[in]      iter   A function that could yield a value.
- * @param[in,out]  data1  Passed to `func1`
- * @param[in]      bl     A function acts as a block.
- * @param[in,out]  data2  Passed to `proc` as the data2 parameter.
- * @return         What `func1` returns.
- */
-static inline VALUE
-rb_iterate_deprecated(VALUE (*iter)(VALUE), VALUE data1, rb_block_call_func_t bl, VALUE data2)
-{
-    return ::rb_iterate(iter, data1, bl, data2);
-}}}
-
-RBIMPL_ATTR_DEPRECATED(("by: rb_block_call since 1.9"))
-VALUE rb_iterate(VALUE (*func1)(VALUE), VALUE data1, rb_block_call_func_t proc, VALUE data2);
-#endif
-
 /**
  * Identical to  rb_funcallv(), except it  additionally passes a function  as a
  * block.  When the  method yields, `proc` is called with  the yielded value as
@@ -337,7 +295,8 @@ VALUE rb_block_call(VALUE obj, ID mid, int argc, const VALUE *argv, rb_block_cal
  * @param[in]      kw_splat  Handling of keyword parameters:
  *   - RB_NO_KEYWORDS           `argv`'s last is not a keyword argument.
  *   - RB_PASS_KEYWORDS         `argv`'s last is a keyword argument.
- *   - RB_PASS_CALLED_KEYWORDS  it depends if there is a passed block.
+ *   - RB_PASS_CALLED_KEYWORDS  Pass keyword arguments if the current method
+ *                              was called with keyword arguments.
  * @return         What `obj.mid` returns.
  */
 VALUE rb_block_call_kw(VALUE obj, ID mid, int argc, const VALUE *argv, rb_block_call_func_t proc, VALUE data2, int kw_splat);
diff --git a/include/ruby/internal/memory.h b/include/ruby/internal/memory.h
index 64e850c65e..eb9c1d2525 100644
--- a/include/ruby/internal/memory.h
+++ b/include/ruby/internal/memory.h
@@ -38,9 +38,14 @@
 # include <alloca.h>
 #endif
 
-#if defined(_MSC_VER) && defined(_M_AMD64)
+#if defined(_MSC_VER) && defined(_WIN64)
 # include <intrin.h>
+# if defined(_M_AMD64)
 # pragma intrinsic(_umul128)
+# endif
+# if defined(_M_ARM64)
+# pragma intrinsic(__umulh)
+# endif
 #endif
 
 #include "ruby/internal/attr/alloc_size.h"
@@ -403,7 +408,8 @@ typedef uint128_t DSIZE_T;
 /**
  * @private
  *
- * This is an implementation detail of rbimpl_size_mul_overflow().
+ * This is an implementation detail of rbimpl_size_mul_overflow() and
+ * rbimpl_size_add_overflow().
  *
  * @internal
  *
@@ -411,9 +417,9 @@ typedef uint128_t DSIZE_T;
  * nothing more than std::variant<std::size_t> if  we could use recent C++, but
  * reality is we cannot.
  */
-struct rbimpl_size_mul_overflow_tag {
-    bool left;                  /**< Whether overflow happened or not. */
-    size_t right;               /**< Multiplication result. */
+struct rbimpl_size_overflow_tag {
+    bool overflowed;            /**< Whether overflow happened or not. */
+    size_t result;              /**< Calculation result. */
 };
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
@@ -483,6 +489,18 @@ RBIMPL_ATTR_NORETURN()
  */
 void ruby_malloc_size_overflow(size_t x, size_t y);
 
+RBIMPL_ATTR_NORETURN()
+/**
+ * @private
+ *
+ * This is an implementation detail. People don't use this directly.
+ *
+ * @param[in]  x             Arbitrary value.
+ * @param[in]  y             Arbitrary value.
+ * @exception  rb_eArgError  `x` + `y` would integer overflow.
+ */
+void ruby_malloc_add_size_overflow(size_t x, size_t y);
+
 #ifdef HAVE_RB_GC_GUARDED_PTR_VAL
 volatile VALUE *rb_gc_guarded_ptr_val(volatile VALUE *ptr, VALUE val);
 #endif
@@ -555,42 +573,46 @@ RBIMPL_ATTR_CONST()
  *
  * @param[in]  x  Arbitrary value.
  * @param[in]  y  Arbitrary value.
- * @return     `{ left, right }`,  where `left` is whether there  is an integer
- *             overflow or not,  and `right` is a  (possibly overflowed) result
- *             of `x` * `y`.
+ * @return     `{ overflowed, result }`, where  `overflowed` is whether there is
+ *             an  integer  overflow  or  not,   and  `result`  is  a  (possibly
+ *             overflowed) result of `x` * `y`.
  *
  * @internal
  *
  * This is in fact also an implementation detail of ruby_xmalloc2() etc.
  */
-static inline struct rbimpl_size_mul_overflow_tag
+static inline struct rbimpl_size_overflow_tag
 rbimpl_size_mul_overflow(size_t x, size_t y)
 {
-    struct rbimpl_size_mul_overflow_tag ret = { false,  0, };
+    struct rbimpl_size_overflow_tag ret = { false,  0, };
 
 #if defined(ckd_mul)
-    ret.left = ckd_mul(&ret.right, x, y);
+    ret.overflowed = ckd_mul(&ret.result, x, y);
 
 #elif RBIMPL_HAS_BUILTIN(__builtin_mul_overflow)
-    ret.left = __builtin_mul_overflow(x, y, &ret.right);
+    ret.overflowed = __builtin_mul_overflow(x, y, &ret.result);
 
 #elif defined(DSIZE_T)
     RB_GNUC_EXTENSION DSIZE_T dx = x;
     RB_GNUC_EXTENSION DSIZE_T dy = y;
     RB_GNUC_EXTENSION DSIZE_T dz = dx * dy;
-    ret.left  = dz > SIZE_MAX;
-    ret.right = RBIMPL_CAST((size_t)dz);
+    ret.overflowed  = dz > SIZE_MAX;
+    ret.result = RBIMPL_CAST((size_t)dz);
 
-#elif defined(_MSC_VER) && defined(_WIN64)
+#elif defined(_MSC_VER) && defined(_M_AMD64)
     unsigned __int64 dp = 0;
     unsigned __int64 dz = _umul128(x, y, &dp);
-    ret.left  = RBIMPL_CAST((bool)dp);
-    ret.right = RBIMPL_CAST((size_t)dz);
+    ret.overflowed  = RBIMPL_CAST((bool)dp);
+    ret.result = RBIMPL_CAST((size_t)dz);
+
+#elif defined(_MSC_VER) && defined(_M_ARM64)
+    ret.overflowed  = __umulh(x, y) != 0;
+    ret.result = x * y;
 
 #else
     /* https://wiki.sei.cmu.edu/confluence/display/c/INT30-C.+Ensure+that+unsigned+integer+operations+do+not+wrap */
-    ret.left  = (y != 0) && (x > SIZE_MAX / y);
-    ret.right = x * y;
+    ret.overflowed  = (y != 0) && (x > SIZE_MAX / y);
+    ret.result = x * y;
 #endif
 
     return ret;
@@ -614,11 +636,11 @@ rbimpl_size_mul_overflow(size_t x, size_t y)
 static inline size_t
 rbimpl_size_mul_or_raise(size_t x, size_t y)
 {
-    struct rbimpl_size_mul_overflow_tag size =
+    struct rbimpl_size_overflow_tag size =
         rbimpl_size_mul_overflow(x, y);
 
-    if (RB_LIKELY(! size.left)) {
-        return size.right;
+    if (RB_LIKELY(! size.overflowed)) {
+        return size.result;
     }
     else {
         ruby_malloc_size_overflow(x, y);
@@ -626,6 +648,81 @@ rbimpl_size_mul_or_raise(size_t x, size_t y)
     }
 }
 
+#if defined(__DOXYGEN__)
+RBIMPL_ATTR_CONSTEXPR(CXX14)
+#elif RBIMPL_COMPILER_SINCE(GCC, 7, 0, 0)
+RBIMPL_ATTR_CONSTEXPR(CXX14) /* https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70507 */
+#elif RBIMPL_COMPILER_SINCE(Clang, 7, 0, 0)
+RBIMPL_ATTR_CONSTEXPR(CXX14) /* https://bugs.llvm.org/show_bug.cgi?id=37633 */
+#endif
+RBIMPL_ATTR_CONST()
+/**
+ * @private
+ *
+ * This is an  implementation detail. People don't use this directly.
+ *
+ * @param[in]  x  Arbitrary value.
+ * @param[in]  y  Arbitrary value.
+ * @return     `{ overflowed, result }`, where  `overflowed` is whether there is
+ *             an  integer  overflow  or  not,   and  `result`  is  a  (possibly
+ *             overflowed) result of `x` + `y`.
+ *
+ * @internal
+ */
+static inline struct rbimpl_size_overflow_tag
+rbimpl_size_add_overflow(size_t x, size_t y)
+{
+    struct rbimpl_size_overflow_tag ret = { false,  0, };
+
+#if defined(ckd_add)
+    ret.overflowed = ckd_add(&ret.result, x, y);
+
+#elif RBIMPL_HAS_BUILTIN(__builtin_add_overflow)
+    ret.overflowed = __builtin_add_overflow(x, y, &ret.result);
+
+#elif defined(DSIZE_T)
+    RB_GNUC_EXTENSION DSIZE_T dx = x;
+    RB_GNUC_EXTENSION DSIZE_T dy = y;
+    RB_GNUC_EXTENSION DSIZE_T dz = dx + dy;
+    ret.overflowed = dz > SIZE_MAX;
+    ret.result = (size_t)dz;
+
+#else
+    ret.result = x + y;
+    ret.overflowed = ret.result < y;
+
+#endif
+
+    return ret;
+}
+
+/**
+ * @private
+ *
+ * This is an  implementation detail. People don't use this directly.
+ *
+ * @param[in]  x             Arbitrary value.
+ * @param[in]  y             Arbitrary value.
+ * @exception  rb_eArgError  Multiplication could integer overflow.
+ * @return     `x` + `y`.
+ *
+ * @internal
+ */
+static inline size_t
+rbimpl_size_add_or_raise(size_t x, size_t y)
+{
+    struct rbimpl_size_overflow_tag size =
+        rbimpl_size_add_overflow(x, y);
+
+    if (RB_LIKELY(!size.overflowed)) {
+        return size.result;
+    }
+    else {
+        ruby_malloc_add_size_overflow(x, y);
+        RBIMPL_UNREACHABLE_RETURN(0);
+    }
+}
+
 /**
  * This is an  implementation detail of #RB_ALLOCV_N().  People  don't use this
  * directly.
@@ -644,8 +741,7 @@ static inline void *
 rb_alloc_tmp_buffer2(volatile VALUE *store, long count, size_t elsize)
 {
     const size_t total_size = rbimpl_size_mul_or_raise(RBIMPL_CAST((size_t)count), elsize);
-    const size_t cnt = (total_size + sizeof(VALUE) - 1) / sizeof(VALUE);
-    return rb_alloc_tmp_buffer_with_count(store, total_size, cnt);
+    return rb_alloc_tmp_buffer(store, (long)total_size);
 }
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
diff --git a/include/ruby/internal/newobj.h b/include/ruby/internal/newobj.h
index 6eee2fa5fa..13030ae279 100644
--- a/include/ruby/internal/newobj.h
+++ b/include/ruby/internal/newobj.h
@@ -109,42 +109,4 @@ void rb_singleton_class_attached(VALUE klass, VALUE obj);
 void rb_copy_generic_ivar(VALUE clone, VALUE obj);
 RBIMPL_SYMBOL_EXPORT_END()
 
-RBIMPL_ATTR_DEPRECATED(("This is no longer how Object#clone works."))
-/**
- * @deprecated  Not sure exactly  when but at some time,  the implementation of
- *              `Object#clone`  stopped  using   this  function.   It  remained
- *              untouched for  a while, and  then @shyouhei realised  that they
- *              are no longer doing the  same thing.  It seems nobody seriously
- *              uses this function any longer.  Let's just abandon it.
- *
- * @param[out]  clone  The destination object.
- * @param[in]   obj    The source object.
- */
-static inline void
-rb_clone_setup(VALUE clone, VALUE obj)
-{
-    (void)clone;
-    (void)obj;
-    return;
-}
-
-RBIMPL_ATTR_DEPRECATED(("This is no longer how Object#dup works."))
-/**
- * @deprecated  Not sure exactly  when but at some time,  the implementation of
- *              `Object#dup`   stopped  using   this  function.    It  remained
- *              untouched for  a while, and  then @shyouhei realised  that they
- *              are no longer  the same thing.  It seems  nobody seriously uses
- *              this function any longer.  Let's just abandon it.
- *
- * @param[out]  dup  The destination object.
- * @param[in]   obj  The source object.
- */
-static inline void
-rb_dup_setup(VALUE dup, VALUE obj)
-{
-    (void)dup;
-    (void)obj;
-    return;
-}
-
 #endif /* RBIMPL_NEWOBJ_H */
diff --git a/include/ruby/internal/scan_args.h b/include/ruby/internal/scan_args.h
index 1ed2bf6368..da64678db5 100644
--- a/include/ruby/internal/scan_args.h
+++ b/include/ruby/internal/scan_args.h
@@ -49,11 +49,11 @@
 /** Same behaviour as rb_scan_args(). */
 #define RB_SCAN_ARGS_PASS_CALLED_KEYWORDS 0
 
-/** The final argument should be a hash treated as keywords.*/
+/** The final argument must be a hash, which will be treated as keywords. */
 #define RB_SCAN_ARGS_KEYWORDS 1
 
 /**
- * Treat a  final argument as  keywords if  it is a  hash, and not  as keywords
+ * Treat a final argument as keywords if it is a hash, and not as keywords
  * otherwise.
  */
 #define RB_SCAN_ARGS_LAST_HASH_KEYWORDS 3
@@ -68,14 +68,14 @@
 /** Do not pass keywords. */
 #define RB_NO_KEYWORDS 0
 
-/** Pass keywords, final argument should be a hash of keywords. */
+/** Pass keywords, final argument must be a hash of keywords. */
 #define RB_PASS_KEYWORDS 1
 
 /**
  * Pass keywords if current method is called with keywords, useful for argument
  * delegation
  */
-#define RB_PASS_CALLED_KEYWORDS rb_keyword_given_p()
+#define RB_PASS_CALLED_KEYWORDS !!rb_keyword_given_p()
 
 /** @} */
 
diff --git a/include/ruby/internal/special_consts.h b/include/ruby/internal/special_consts.h
index 85579e33f0..1e2636da48 100644
--- a/include/ruby/internal/special_consts.h
+++ b/include/ruby/internal/special_consts.h
@@ -326,7 +326,7 @@ RBIMPL_ATTR_ARTIFICIAL()
 static inline bool
 RB_SPECIAL_CONST_P(VALUE obj)
 {
-    return RB_IMMEDIATE_P(obj) || obj == RUBY_Qfalse;
+    return (obj == RUBY_Qfalse) || RB_IMMEDIATE_P(obj);
 }
 
 RBIMPL_ATTR_CONST()
@@ -346,7 +346,7 @@ RBIMPL_ATTR_CONSTEXPR(CXX11)
 static inline VALUE
 rb_special_const_p(VALUE obj)
 {
-    return RB_SPECIAL_CONST_P(obj) * RUBY_Qtrue;
+    return (unsigned int)RB_SPECIAL_CONST_P(obj) * RUBY_Qtrue;
 }
 
 /**
diff --git a/include/ruby/internal/static_assert.h b/include/ruby/internal/static_assert.h
index b9ff6646e7..30bfd3bb79 100644
--- a/include/ruby/internal/static_assert.h
+++ b/include/ruby/internal/static_assert.h
@@ -23,13 +23,14 @@
 #include <assert.h>
 #include "ruby/internal/has/extension.h"
 #include "ruby/internal/compiler_since.h"
+#include "ruby/internal/attr/maybe_unused.h"
 
 /** @cond INTERNAL_MACRO */
 #if defined(__cplusplus) && defined(__cpp_static_assert)
 # /* https://isocpp.org/std/standing-documents/sd-6-sg10-feature-test-recommendations */
 # define RBIMPL_STATIC_ASSERT0 static_assert
 
-#elif defined(__cplusplus) && RBIMPL_COMPILER_SINCE(MSVC, 16, 0, 0)
+#elif defined(__cplusplus) && RBIMPL_COMPILER_IS(MSVC)
 # define RBIMPL_STATIC_ASSERT0 static_assert
 
 #elif defined(__INTEL_CXX11_MODE__)
@@ -71,7 +72,7 @@
 
 #else
 # define RBIMPL_STATIC_ASSERT(name, expr) \
-    MAYBE_UNUSED(typedef int static_assert_ ## name ## _check[1 - 2 * !(expr)])
+    RBIMPL_ATTR_MAYBE_UNUSED() typedef int static_assert_ ## name ## _check[1 - 2 * !(expr)]
 #endif
 
 #endif /* RBIMPL_STATIC_ASSERT_H */
diff --git a/include/ruby/internal/stdbool.h b/include/ruby/internal/stdbool.h
index 1ca61136ba..5d9026434b 100644
--- a/include/ruby/internal/stdbool.h
+++ b/include/ruby/internal/stdbool.h
@@ -27,25 +27,13 @@
 
 #elif defined(__cplusplus)
 # /* bool is a keyword in C++. */
-# if defined(HAVE_STDBOOL_H) && (__cplusplus >= 201103L)
-#  include <cstdbool>
-# endif
-#
 # ifndef __bool_true_false_are_defined
 #  define __bool_true_false_are_defined
 # endif
 
-#elif defined(HAVE_STDBOOL_H)
-# /* Take stdbool.h definition. */
+#else
+# /* Take stdbool.h definition. It exists since GCC 3.0 and VS 2015. */
 # include <stdbool.h>
-
-#elif !defined(HAVE__BOOL)
-typedef unsigned char _Bool;
-# /* See also http://www.open-std.org/jtc1/sc22/wg14/www/docs/n2229.htm */
-# define bool  _Bool
-# define true  ((_Bool)+1)
-# define false ((_Bool)+0)
-# define __bool_true_false_are_defined
 #endif
 
 #endif /* RBIMPL_STDBOOL_H */
diff --git a/include/ruby/internal/symbol.h b/include/ruby/internal/symbol.h
index 869a31115c..8bfd686fbe 100644
--- a/include/ruby/internal/symbol.h
+++ b/include/ruby/internal/symbol.h
@@ -101,12 +101,11 @@ ID rb_intern(const char *name);
 ID rb_intern2(const char *name, long len);
 
 /**
- * Identical to  rb_intern(), except  it takes an instance of ::rb_cString.
+ * Identical to rb_intern(), except it takes a `T_STRING` object.
  *
  * @param[in]  str               The name of the id.
- * @pre        `str` must either be an instance of ::rb_cSymbol, or an instance
- *             of ::rb_cString, or responds to `#to_str` method.
- * @exception  rb_eTypeError     Can't convert `str` into ::rb_cString.
+ * @pre        `rb_type(str)` must be `T_STRING`.
+ * @exception  rb_eEncodingError `str` contains invalid character(s).
  * @exception  rb_eRuntimeError  Too many symbols.
  * @return     A (possibly new) id whose value is the given str.
  * @note       These   days  Ruby   internally   has  two   kinds  of   symbols
@@ -121,10 +120,17 @@ ID rb_intern_str(VALUE str);
  * Retrieves the name mapped to the given id.
  *
  * @param[in]  id         An id to query.
- * @retval     NULL       No such id ever existed in the history.
+ * @retval     NULL       Unknown id.
  * @retval     otherwise  A name that the id represents.
  * @note       The return value  is managed by the interpreter.   Don't pass it
  *             to free().
+ * @note       The underlying name can contain internal NUL bytes, so the return
+ *             value might be a truncated representation due to the nature of C
+ *             strings.
+ * @note       This C string is backed by an underlying Ruby string. The Ruby
+ *             string may move during GC compaction which would make this
+ *             C string point to invalid memory. Do not use the return value
+ *             of this function after a potential GC entry point.
  */
 const char *rb_id2name(ID id);
 
@@ -159,34 +165,40 @@ RBIMPL_ATTR_NONNULL(())
  *                 of ::rb_cSymbol, or an instance of ::rb_cString, or responds
  *                 to `#to_str` method.
  * @exception      rb_eTypeError      Can't convert `*namep` into ::rb_cString.
- * @exception      rb_eEncodingError  Given string is non-ASCII.
+ * @exception      rb_eEncodingError  Given string contains invalid character(s).
  * @retval         0                  No such id ever existed in the history.
  * @retval         otherwise          The id that represents the given name.
  * @post           The object  that `*namep`  points to  is a  converted result
  *                 object, which  is always an instance  of either ::rb_cSymbol
  *                 or ::rb_cString.
+ * @see            rb_str_to_str
  * @see            https://bugs.ruby-lang.org/issues/5072
- *
- * @internal
- *
- * @shyouhei doesn't know why this has to raise rb_eEncodingError.
  */
 ID rb_check_id(volatile VALUE *namep);
 
 /**
- * @copydoc rb_intern_str()
- *
- * @internal
+ * Identical to rb_intern_str(), except it tries to convert the parameter object
+ * to an instance of ::rb_cString or its subclasses.
  *
- * :FIXME:  Can anyone  tell us  what is  the difference  between this  one and
- * rb_intern_str()?  As far as @shyouhei reads the implementation it seems what
- * rb_to_id() does is  is just waste some CPU time,  then call rb_intern_str().
- * He hopes he is wrong.
+ * @param[in]  str               The name of the id.
+ * @pre        `str` must either be an  instance of ::rb_cSymbol, or an instance
+ *             of ::rb_cString, or responds to `#to_str` method.
+ * @exception  rb_eTypeError     Can't convert `str` into ::rb_cString.
+ * @exception  rb_eEncodingError Given string contains invalid character(s).
+ * @exception  rb_eRuntimeError  Too many symbols.
+ * @return     A (possibly new) id whose value is the given str.
+ * @note       These   days  Ruby   internally   has  two   kinds  of   symbols
+ *             (static/dynamic).   Symbols created  using  this function  would
+ *             become static ones;  i.e. would never be  garbage collected.  It
+ *             is up  to you to avoid  memory leaks.  Think twice  before using
+ *             it.
+ * @see        rb_str_to_str
  */
 ID rb_to_id(VALUE str);
 
 /**
- * Identical to rb_id2name(), except it returns a Ruby's String instead of C's.
+ * Identical to rb_id2name(), except it returns a frozen Ruby String instead of
+ * a C String.
  *
  * @param[in]  id           An id to query.
  * @retval     RUBY_Qfalse  No such id ever existed in the history.
@@ -201,14 +213,14 @@ ID rb_to_id(VALUE str);
 VALUE rb_id2str(ID id);
 
 /**
- * Identical to rb_id2str(), except it takes an instance of ::rb_cSymbol rather
- * than an ::ID.
+ * Obtain a frozen string representation of a symbol (not including the leading
+ * colon). Done without any object allocations.
  *
- * @param[in]  id           An id to query.
- * @retval     RUBY_Qfalse  No such id ever existed in the history.
- * @retval     otherwise    An instance of ::rb_cString with the name of id.
+ * @param[in]  symbol  A ::rb_cSymbol instance to query.
+ * @return     A frozen instance of ::rb_cString with the name of `symbol`.
+ * @note       This does not create a permanent ::ID using the symbol.
  */
-VALUE rb_sym2str(VALUE id);
+VALUE rb_sym2str(VALUE symbol);
 
 /**
  * Identical  to  rb_intern_str(), except  it  generates  a dynamic  symbol  if
@@ -237,17 +249,14 @@ RBIMPL_ATTR_NONNULL(())
  *                 of ::rb_cSymbol, or an instance of ::rb_cString, or responds
  *                 to `#to_str` method.
  * @exception      rb_eTypeError      Can't convert `*namep` into ::rb_cString.
- * @exception      rb_eEncodingError  Given string is non-ASCII.
+ * @exception      rb_eEncodingError  Given string contains invalid character(s).
  * @retval         RUBY_Qnil          No such id ever existed in the history.
  * @retval         otherwise          The id that represents the given name.
  * @post           The object  that `*namep`  points to  is a  converted result
  *                 object, which  is always an instance  of either ::rb_cSymbol
  *                 or ::rb_cString.
  * @see            https://bugs.ruby-lang.org/issues/5072
- *
- * @internal
- *
- * @shyouhei doesn't know why this has to raise rb_eEncodingError.
+ * @see            rb_str_to_str
  */
 VALUE rb_check_symbol(volatile VALUE *namep);
 RBIMPL_SYMBOL_EXPORT_END()
@@ -308,8 +317,9 @@ rbimpl_intern_const(ID *ptr, const char *str)
     }
 
 /**
- * Old implementation detail of rb_intern().
- * @deprecated Does anyone use it?  Preserved for backward compat.
+ * Returns  the cached  ID  for  the given  str  in  var, in  compiler
+ * independent manner.   Use this instead of  GCC specific rb_intern()
+ * when you want to cache the ID on all platforms certainly.
  */
 #define RUBY_CONST_ID(var, str) \
     do { \
@@ -318,7 +328,8 @@ rbimpl_intern_const(ID *ptr, const char *str)
     } while (0)
 
 #if defined(HAVE_STMT_AND_DECL_IN_EXPR)
-/* __builtin_constant_p and statement expression is available
+/* GCC specific shorthand for RUBY_CONST_ID().
+ * __builtin_constant_p and statement expression is available
  * since gcc-2.7.2.3 at least. */
 #define rb_intern(str) \
     (RBIMPL_CONSTANT_P(str) ? \
diff --git a/include/ruby/internal/value_type.h b/include/ruby/internal/value_type.h
index 557f18813b..77cb38bc7d 100644
--- a/include/ruby/internal/value_type.h
+++ b/include/ruby/internal/value_type.h
@@ -96,10 +96,11 @@
 #define RB_TYPE_P         RB_TYPE_P
 #define Check_Type        Check_Type
 
-#if !RUBY_DEBUG
-# define RBIMPL_ASSERT_TYPE(v, t) RBIMPL_ASSERT_OR_ASSUME(RB_TYPE_P((v), (t)))
+#ifdef RBIMPL_VA_OPT_ARGS
+# define RBIMPL_ASSERT_TYPE(v, t) \
+    RBIMPL_ASSERT_OR_ASSUME(RB_TYPE_P(v, t), "actual type: %d", rb_type(v))
 #else
-# define RBIMPL_ASSERT_TYPE Check_Type
+# define RBIMPL_ASSERT_TYPE(v, t) RBIMPL_ASSERT_OR_ASSUME(RB_TYPE_P(v, t))
 #endif
 /** @endcond */
 
@@ -129,8 +130,8 @@ ruby_value_type {
     RUBY_T_RATIONAL = 0x0f, /**< @see struct ::RRational */
 
     RUBY_T_NIL      = 0x11, /**< @see ::RUBY_Qnil */
-    RUBY_T_TRUE     = 0x12, /**< @see ::RUBY_Qfalse */
-    RUBY_T_FALSE    = 0x13, /**< @see ::RUBY_Qtrue */
+    RUBY_T_TRUE     = 0x12, /**< @see ::RUBY_Qtrue */
+    RUBY_T_FALSE    = 0x13, /**< @see ::RUBY_Qfalse */
     RUBY_T_SYMBOL   = 0x14, /**< @see struct ::RSymbol */
     RUBY_T_FIXNUM   = 0x15, /**< Integers formerly known as Fixnums. */
     RUBY_T_UNDEF    = 0x16, /**< @see ::RUBY_Qundef */
@@ -409,14 +410,6 @@ RB_TYPE_P(VALUE obj, enum ruby_value_type t)
 #endif
 /** @endcond */
 
-RBIMPL_ATTR_PURE()
-RBIMPL_ATTR_ARTIFICIAL()
-/**
- * @private
- * Defined in ruby/internal/core/rtypeddata.h
- */
-static inline bool rbimpl_rtypeddata_p(VALUE obj);
-
 RBIMPL_ATTR_ARTIFICIAL()
 /**
  * Identical  to  RB_TYPE_P(),  except  it  raises  exceptions  on  predication
@@ -431,19 +424,11 @@ RBIMPL_ATTR_ARTIFICIAL()
 static inline void
 Check_Type(VALUE v, enum ruby_value_type t)
 {
+    /* Typed data is not simple `T_DATA`, see `rb_check_type` */
+    RUBY_ASSERT_ALWAYS(t != RUBY_T_DATA);
     if (RB_UNLIKELY(! RB_TYPE_P(v, t))) {
-        goto unexpected_type;
+        rb_unexpected_type(v, RBIMPL_CAST((int)t));
     }
-    else if (t == RUBY_T_DATA && rbimpl_rtypeddata_p(v)) {
-        /* Typed data is not simple `T_DATA`, see `rb_check_type` */
-        goto unexpected_type;
-    }
-    else {
-        return;
-    }
-
-  unexpected_type:
-    rb_unexpected_type(v, RBIMPL_CAST((int)t));
 }
 
 #endif /* RBIMPL_VALUE_TYPE_H */
diff --git a/include/ruby/internal/warning_push.h b/include/ruby/internal/warning_push.h
index f5981633f8..91d62cb00d 100644
--- a/include/ruby/internal/warning_push.h
+++ b/include/ruby/internal/warning_push.h
@@ -79,7 +79,7 @@
  */
 #define RBIMPL_WARNING_IGNORED(flag) __pragma(warning(disable: flag))
 
-#elif RBIMPL_COMPILER_SINCE(MSVC, 12, 0, 0)
+#elif RBIMPL_COMPILER_IS(MSVC)
 # /* Not sure exactly when but it seems VC++ 6.0 is a version with it.*/
 # define RBIMPL_WARNING_PUSH()        __pragma(warning(push))
 # define RBIMPL_WARNING_POP()         __pragma(warning(pop))
diff --git a/include/ruby/internal/xmalloc.h b/include/ruby/internal/xmalloc.h
index 57552e4e7d..2551609123 100644
--- a/include/ruby/internal/xmalloc.h
+++ b/include/ruby/internal/xmalloc.h
@@ -57,6 +57,10 @@
 #define xrealloc2 ruby_xrealloc2 /**< @old{ruby_xrealloc2} */
 #define xfree     ruby_xfree     /**< @old{ruby_xfree} */
 
+#define xfree_sized       ruby_xfree_sized
+#define xrealloc_sized    ruby_xrealloc_sized
+#define xrealloc2_sized   ruby_xrealloc2_sized
+
 RBIMPL_SYMBOL_EXPORT_BEGIN()
 
 RBIMPL_ATTR_NODISCARD()
@@ -196,6 +200,58 @@ RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newsiz))
 
 RBIMPL_ATTR_NODISCARD()
 RBIMPL_ATTR_RETURNS_NONNULL()
+RBIMPL_ATTR_ALLOC_SIZE((2))
+/**
+ * Identical to ruby_xrealloc(), except that it takes the old storage size
+ * as third argument.
+ *
+ * @param[in]  ptr             A valid  pointer to a storage  instance that was
+ *                             previously returned from either:
+ *                               - ruby_xmalloc(),
+ *                               - ruby_xmalloc2(),
+ *                               - ruby_xcalloc(),
+ *                               - ruby_xrealloc(), or
+ *                               - ruby_xrealloc2().
+ * @param[in]  newsiz          Requested new amount of memory.
+ * @param[in]  oldsiz          Existing amount of memory.
+ * @exception  rb_eNoMemError  No space left for `newsiz` bytes allocation.
+ * @return     A  valid  pointer  to   a  (possibly  newly  allocated)  storage
+ *             instance;  which  has  at   least  `newsiz`  bytes  width,  with
+ *             appropriate  alignment  detected  by  the  underlying  realloc()
+ *             routine.
+ * @pre        The passed pointer must point  to a valid live storage instance.
+ *             It is a failure to pass an already freed pointer.
+ * @pre        The passed oldsiz must be exactly equal to the size the pointer
+ *             was allocated with.
+ *             Passing an incorrect oldsiz is undefined behavior, which may
+ *             cause memory leaks or crashes.
+ * @post       In  case the  function  returns the  passed  pointer as-is,  the
+ *             storage  instance that  the  pointer holds  is  either grown  or
+ *             shrunken  to have  at least  `newsiz` bytes.  Otherwise a  valid
+ *             pointer to a  newly allocated storage instance  is returned.  In
+ *             this  case  `ptr`  is  invalidated   as  if  it  was  passed  to
+ *             ruby_xfree().
+ * @note       It doesn't return NULL.
+ * @warning    Unlike some realloc() implementations,  passing zero to `newsiz`
+ *             is not the  same as calling ruby_xfree(),  because this function
+ *             never returns NULL.  Something meaningful still returns then.
+ * @warning    It is  a failure not to  check the return value.   Do not assume
+ *             anything on  it.  It could  be either identical to,  or distinct
+ *             form the passed argument.
+ * @warning    Do not  assume anything  on the alignment  of the  return value.
+ *             There is  no guarantee  that it  inherits the  passed argument's
+ *             one.
+ * @warning    The return  value shall  be invalidated  exactly once  by either
+ *             ruby_xfree(),  ruby_xrealloc(), or  ruby_xrealloc2().   It is  a
+ *             failure to pass it to system free(), because the system and Ruby
+ *             might or might not share the same malloc() implementation.
+ */
+void *ruby_xrealloc_sized(void *ptr, size_t newsiz, size_t oldsiz)
+RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newsiz))
+;
+
+RBIMPL_ATTR_NODISCARD()
+RBIMPL_ATTR_RETURNS_NONNULL()
 RBIMPL_ATTR_ALLOC_SIZE((2,3))
 /**
  * Identical to ruby_xrealloc(),  except it resizes the  given storage instance
@@ -251,6 +307,64 @@ void *ruby_xrealloc2(void *ptr, size_t newelems, size_t newsiz)
 RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newelems * newsiz))
 ;
 
+RBIMPL_ATTR_NODISCARD()
+RBIMPL_ATTR_RETURNS_NONNULL()
+RBIMPL_ATTR_ALLOC_SIZE((2,3))
+/**
+ * Identical to ruby_xrealloc2(),  except it takes the old elements count.
+ *
+ * This  is   roughly  the  same   as  reallocarray()  function   that  OpenBSD
+ * etc. provides, but also interacts with our GC.
+ *
+ * @param[in]  ptr             A valid  pointer to a storage  instance that was
+ *                             previously returned from either:
+ *                               - ruby_xmalloc(),
+ *                               - ruby_xmalloc2(),
+ *                               - ruby_xcalloc(),
+ *                               - ruby_xrealloc(), or
+ *                               - ruby_xrealloc2().
+ * @param[in]  newelems        Requested new number of elements.
+ * @param[in]  newsiz          Requested new size of each element.
+ * @param[in]  oldelems        The number of elements the pointer was
+ *                             previously allocated with.
+ * @exception  rb_eNoMemError  No space left for  allocation.
+ * @exception  rb_eArgError    `newelems` * `newsiz` would overflow.
+ * @return     A  valid  pointer  to   a  (possibly  newly  allocated)  storage
+ *             instance; which has at least  `newelems` * `newsiz` bytes width,
+ *             with appropriate alignment detected  by the underlying realloc()
+ *             routine.
+ * @pre        The passed pointer must point  to a valid live storage instance.
+ *             It is a failure to pass an already freed pointer.
+ * @pre        The passed oldelems must be exactly equal to the number of
+ *             elements the pointer was allocated with.
+ *             Passing an incorrect oldelems is undefined behavior, which may
+ *             cause memory leaks or crashes.
+ * @post       In  case the  function  returns the  passed  pointer as-is,  the
+ *             storage  instance that  the  pointer holds  is  either grown  or
+ *             shrunken  to   have  at  least  `newelems`   *  `newsiz`  bytes.
+ *             Otherwise a valid pointer to  a newly allocated storage instance
+ *             is returned.   In this case  `ptr` is  invalidated as if  it was
+ *             passed to ruby_xfree().
+ * @note       It doesn't return NULL.
+ * @warning    Unlike some  realloc() implementations,  passing zero  to either
+ *             `newelems`   or  `elemsiz`   are   not  the   same  as   calling
+ *             ruby_xfree(),   because  this   function  never   returns  NULL.
+ *             Something meaningful still returns then.
+ * @warning    It is  a failure not to  check the return value.   Do not assume
+ *             anything on  it.  It could  be either identical to,  or distinct
+ *             form the passed argument.
+ * @warning    Do not  assume anything  on the alignment  of the  return value.
+ *             There is  no guarantee  that it  inherits the  passed argument's
+ *             one.
+ * @warning    The return  value shall  be invalidated  exactly once  by either
+ *             ruby_xfree(),  ruby_xrealloc(), or  ruby_xrealloc2().   It is  a
+ *             failure to pass it to system free(), because the system and Ruby
+ *             might or might not share the same malloc() implementation.
+ */
+void *ruby_xrealloc2_sized(void *ptr, size_t newelems, size_t newsiz, size_t oldelems)
+RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newelems * newsiz))
+;
+
 /**
  * Deallocates a storage instance.
  *
@@ -283,109 +397,42 @@ void ruby_xfree(void *ptr)
 RBIMPL_ATTR_NOEXCEPT(free(ptr))
 ;
 
-#if USE_GC_MALLOC_OBJ_INFO_DETAILS
-# define ruby_xmalloc(s1)            ruby_xmalloc_with_location(s1, __FILE__, __LINE__)
-# define ruby_xmalloc2(s1, s2)       ruby_xmalloc2_with_location(s1, s2, __FILE__, __LINE__)
-# define ruby_xcalloc(s1, s2)        ruby_xcalloc_with_location(s1, s2, __FILE__, __LINE__)
-# define ruby_xrealloc(ptr, s1)      ruby_xrealloc_with_location(ptr, s1, __FILE__, __LINE__)
-# define ruby_xrealloc2(ptr, s1, s2) ruby_xrealloc2_with_location(ptr, s1, s2, __FILE__, __LINE__)
-
-RBIMPL_ATTR_NODISCARD()
-RBIMPL_ATTR_RESTRICT()
-RBIMPL_ATTR_RETURNS_NONNULL()
-RBIMPL_ATTR_ALLOC_SIZE((1))
-void *ruby_xmalloc_body(size_t size)
-RBIMPL_ATTR_NOEXCEPT(malloc(size))
-;
-
-RBIMPL_ATTR_NODISCARD()
-RBIMPL_ATTR_RESTRICT()
-RBIMPL_ATTR_RETURNS_NONNULL()
-RBIMPL_ATTR_ALLOC_SIZE((1,2))
-void *ruby_xmalloc2_body(size_t nelems, size_t elemsiz)
-RBIMPL_ATTR_NOEXCEPT(malloc(nelems * elemsiz))
-;
-
-RBIMPL_ATTR_NODISCARD()
-RBIMPL_ATTR_RESTRICT()
-RBIMPL_ATTR_RETURNS_NONNULL()
-RBIMPL_ATTR_ALLOC_SIZE((1,2))
-void *ruby_xcalloc_body(size_t nelems, size_t elemsiz)
-RBIMPL_ATTR_NOEXCEPT(calloc(nelems, elemsiz))
-;
-
-RBIMPL_ATTR_NODISCARD()
-RBIMPL_ATTR_RETURNS_NONNULL()
-RBIMPL_ATTR_ALLOC_SIZE((2))
-void *ruby_xrealloc_body(void *ptr, size_t newsiz)
-RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newsiz))
-;
-
-RBIMPL_ATTR_NODISCARD()
-RBIMPL_ATTR_RETURNS_NONNULL()
-RBIMPL_ATTR_ALLOC_SIZE((2,3))
-void *ruby_xrealloc2_body(void *ptr, size_t newelems, size_t newsiz)
-RBIMPL_ATTR_NOEXCEPT(realloc(ptr, newelems * newsiz))
+/**
+ * Deallocates a storage instance of a specific ssize.
+ *
+ * @param[out]  ptr  Either
+ *                     - NULL, or
+ *                     - a valid pointer previously returned from one of:
+ *                       - ruby_xmalloc(),
+ *                       - ruby_xmalloc2(),
+ *                       - ruby_xcalloc(),
+ *                       - ruby_xrealloc(), or
+ *                       - ruby_xrealloc2().
+ * @pre         The passed pointer must point to a valid live storage instance.
+ *              It is a failure to pass an already freed pointer.
+ * @pre         The passed size must be exactly equal to the size the pointer
+ *              was allocated with.
+ *              Passing an incorrect size is undefined behavior, which may
+ *              cause memory leaks or crashes.
+ * @post        The  storage  instance  pointed  by  the  passed  pointer  gets
+ *              invalidated; it is no longer addressable.
+ * @warning     Every single storage instance  that was previously allocated by
+ *              either    ruby_xmalloc(),   ruby_xmalloc2(),    ruby_xcalloc(),
+ *              ruby_xrealloc(),  or  ruby_xrealloc2()   shall  be  invalidated
+ *              exactly once by  either passing it to  ruby_xfree(), or passing
+ *              it to  either ruby_xrealloc(), ruby_xrealloc2() then  check the
+ *              return value for invalidation.
+ * @warning     Do not pass anything other  than pointers described above.  For
+ *              instance pointers returned from malloc() or mmap() shall not be
+ *              passed  to   this  function,  because  the   underlying  memory
+ *              management mechanism could differ.
+ * @warning     Do  not pass  any invalid  pointers  to this  function e.g.  by
+ *              calling it twice with a same argument.
+ */
+void ruby_xfree_sized(void *ptr, size_t size)
+RBIMPL_ATTR_NOEXCEPT(free(ptr))
 ;
 
-RUBY_EXTERN const char *ruby_malloc_info_file;
-RUBY_EXTERN int ruby_malloc_info_line;
-
-static inline void *
-ruby_xmalloc_with_location(size_t s, const char *file, int line)
-{
-    void *ptr;
-    ruby_malloc_info_file = file;
-    ruby_malloc_info_line = line;
-    ptr = ruby_xmalloc_body(s);
-    ruby_malloc_info_file = NULL;
-    return ptr;
-}
-
-static inline void *
-ruby_xmalloc2_with_location(size_t s1, size_t s2, const char *file, int line)
-{
-    void *ptr;
-    ruby_malloc_info_file = file;
-    ruby_malloc_info_line = line;
-    ptr = ruby_xmalloc2_body(s1, s2);
-    ruby_malloc_info_file = NULL;
-    return ptr;
-}
-
-static inline void *
-ruby_xcalloc_with_location(size_t s1, size_t s2, const char *file, int line)
-{
-    void *ptr;
-    ruby_malloc_info_file = file;
-    ruby_malloc_info_line = line;
-    ptr = ruby_xcalloc_body(s1, s2);
-    ruby_malloc_info_file = NULL;
-    return ptr;
-}
-
-static inline void *
-ruby_xrealloc_with_location(void *ptr, size_t s, const char *file, int line)
-{
-    void *rptr;
-    ruby_malloc_info_file = file;
-    ruby_malloc_info_line = line;
-    rptr = ruby_xrealloc_body(ptr, s);
-    ruby_malloc_info_file = NULL;
-    return rptr;
-}
-
-static inline void *
-ruby_xrealloc2_with_location(void *ptr, size_t s1, size_t s2, const char *file, int line)
-{
-    void *rptr;
-    ruby_malloc_info_file = file;
-    ruby_malloc_info_line = line;
-    rptr = ruby_xrealloc2_body(ptr, s1, s2);
-    ruby_malloc_info_file = NULL;
-    return rptr;
-}
-#endif
 
 RBIMPL_SYMBOL_EXPORT_END()
 
diff --git a/include/ruby/io.h b/include/ruby/io.h
index e9dfeda5b1..ed0967abad 100644
--- a/include/ruby/io.h
+++ b/include/ruby/io.h
@@ -66,6 +66,21 @@ RBIMPL_SYMBOL_EXPORT_BEGIN()
 struct stat;
 struct timeval;
 
+#if defined(HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC)
+# define RUBY_USE_STATX 0
+#elif defined(HAVE_STRUCT_STATX_STX_BTIME)
+# define RUBY_USE_STATX 1
+struct statx;
+#else
+# define RUBY_USE_STATX 0
+#endif
+
+#if RUBY_USE_STATX
+typedef struct statx rb_io_stat_data;
+#else
+typedef struct stat rb_io_stat_data;
+#endif
+
 /**
  * Indicates that a timeout has occurred while performing an IO operation.
  */
@@ -137,6 +152,143 @@ struct rb_io_encoding {
     VALUE ecopts;
 };
 
+/**
+ * @name Possible flags for ::rb_io_t::mode
+ *
+ * @{
+ */
+
+/** The IO is opened for reading. */
+#define FMODE_READABLE              0x00000001
+
+/** The IO is opened for writing. */
+#define FMODE_WRITABLE              0x00000002
+
+/** The IO is opened for both read/write. */
+#define FMODE_READWRITE             (FMODE_READABLE|FMODE_WRITABLE)
+
+/**
+ * The IO  is in "binary  mode".  This  is not what  everything rb_io_binmode()
+ * concerns.  This low-level flag is to stop CR <-> CRLF conversions that would
+ * happen in the underlying operating system.
+ *
+ * Setting this  one and #FMODE_TEXTMODE at  the same time is  a contradiction.
+ * Setting this one and #ECONV_NEWLINE_DECORATOR_MASK  at the same time is also
+ * a contradiction.
+ */
+#define FMODE_BINMODE               0x00000004
+
+/**
+ * The  IO  is in  "sync  mode".   All output  is  immediately  flushed to  the
+ * underlying operating system then.  Can  be set via rb_io_synchronized(), but
+ * there is no way except calling `IO#sync=` to reset.
+ */
+#define FMODE_SYNC                  0x00000008
+
+/**
+ * The IO  is a TTY.  What  is a TTY and  what isn't depends on  the underlying
+ * operating system's `isatty(3)` output.  You cannot change this.
+ */
+#define FMODE_TTY                   0x00000010
+
+/**
+ * Ruby eventually  detects that the IO  is bidirectional.  For instance  a TTY
+ * has such  property.  There are  several other  things known to  be duplexed.
+ * Additionally you  (extension library  authors) can  also implement  your own
+ * bidirectional IO subclasses.  One of such example is `Socket`.
+ */
+#define FMODE_DUPLEX                0x00000020
+
+/**
+ * The IO is opened  for appending.  This mode always writes at  the end of the
+ * IO.  Ruby manages  this flag for record but basically  the logic behind this
+ * mode is at the underlying operating system.  We almost do nothing.
+ */
+#define FMODE_APPEND                0x00000040
+
+/**
+ * The IO is  opened for creating.  This makes sense  only when the destination
+ * file does  not exist at  the time  the IO object  was created.  This  is the
+ * default mode  for writing,  but you  can pass `"r+"`  to `IO.open`  etc., to
+ * reroute this creation.
+ */
+#define FMODE_CREATE                0x00000080
+/* #define FMODE_NOREVLOOKUP        0x00000100 */
+
+/**
+ * This flag amends the effect of #FMODE_CREATE,  so that if there already is a
+ * file at the given path the operation fails.  Using this you can be sure that
+ * the file you get is a fresh new one.
+ */
+#define FMODE_EXCL                  0x00000400
+
+/**
+ * This flag amends the effect of #FMODE_CREATE,  so that if there already is a
+ * file at the given path it gets truncated.
+ */
+#define FMODE_TRUNC                 0x00000800
+
+/**
+ * The IO is in "text mode".  On  systems where such mode make sense, this flag
+ * changes  the way  the  IO handles  the  contents.  On  POSIX  systems it  is
+ * basically  a no-op,  but with  this  flag set  you can  optionally let  Ruby
+ * manually convert newlines, unlike when in binary mode:
+ *
+ * ```ruby
+ * IO.open("/p/a/t/h", "wt", crlf_newline: true) # "wb" is NG.
+ * ```
+ *
+ * Setting this one and #FMODE_BINMODE at the same time is a contradiction.
+ */
+#define FMODE_TEXTMODE              0x00001000
+/**
+ * This flag means that an IO object is wrapping an "external" file descriptor,
+ * which is owned by something outside the Ruby interpreter (usually a C extension).
+ * Ruby will not close this file when the IO object is garbage collected.
+ * If this flag is set, then IO#autoclose? is false, and vice-versa.
+ *
+ * This flag was previously called FMODE_PREP internally.
+ */
+#define FMODE_EXTERNAL              0x00010000
+
+/* #define FMODE_SIGNAL_ON_EPIPE    0x00020000 */
+
+/**
+ * This flag amends the  encoding of the IO so that the BOM  of the contents of
+ * the IO takes effect.
+ */
+#define FMODE_SETENC_BY_BOM         0x00100000
+/* #define FMODE_UNIX                  0x00200000 */
+/* #define FMODE_INET                  0x00400000 */
+/* #define FMODE_INET6                 0x00800000 */
+
+/** @} */
+
+enum rb_io_mode {
+    RUBY_IO_MODE_EXTERNAL = FMODE_EXTERNAL,
+
+    RUBY_IO_MODE_READABLE = FMODE_READABLE,
+    RUBY_IO_MODE_WRITABLE = FMODE_WRITABLE,
+    RUBY_IO_MODE_READABLE_WRITABLE = (RUBY_IO_MODE_READABLE|RUBY_IO_MODE_WRITABLE),
+
+    RUBY_IO_MODE_BINARY = FMODE_BINMODE,
+    RUBY_IO_MODE_TEXT = FMODE_TEXTMODE,
+    RUBY_IO_MODE_TEXT_SET_ENCODING_FROM_BOM = FMODE_SETENC_BY_BOM,
+
+    RUBY_IO_MODE_SYNCHRONISED = FMODE_SYNC,
+
+    RUBY_IO_MODE_TTY = FMODE_TTY,
+
+    RUBY_IO_MODE_DUPLEX = FMODE_DUPLEX,
+
+    RUBY_IO_MODE_APPEND = FMODE_APPEND,
+    RUBY_IO_MODE_CREATE = FMODE_CREATE,
+    RUBY_IO_MODE_EXCLUSIVE = FMODE_EXCL,
+    RUBY_IO_MODE_TRUNCATE = FMODE_TRUNC,
+};
+
+typedef enum rb_io_mode rb_io_mode_t;
+
 #ifndef HAVE_RB_IO_T
 #define HAVE_RB_IO_T 1
 /** Ruby's IO, metadata and buffers. */
@@ -155,7 +307,7 @@ struct rb_io {
 
     /** mode flags: FMODE_XXXs */
     RBIMPL_ATTR_DEPRECATED(("rb_io_mode"))
-    int mode;
+    enum rb_io_mode mode;
 
     /** child's pid (for pipes) */
     RBIMPL_ATTR_DEPRECATED(("with no replacement"))
@@ -261,118 +413,6 @@ typedef struct rb_io rb_io_t;
 typedef struct rb_io_encoding rb_io_enc_t;
 
 /**
- * @name Possible flags for ::rb_io_t::mode
- *
- * @{
- */
-
-/** The IO is opened for reading. */
-#define FMODE_READABLE              0x00000001
-
-/** The IO is opened for writing. */
-#define FMODE_WRITABLE              0x00000002
-
-/** The IO is opened for both read/write. */
-#define FMODE_READWRITE             (FMODE_READABLE|FMODE_WRITABLE)
-
-/**
- * The IO  is in "binary  mode".  This  is not what  everything rb_io_binmode()
- * concerns.  This low-level flag is to stop CR <-> CRLF conversions that would
- * happen in the underlying operating system.
- *
- * Setting this  one and #FMODE_TEXTMODE at  the same time is  a contradiction.
- * Setting this one and #ECONV_NEWLINE_DECORATOR_MASK  at the same time is also
- * a contradiction.
- */
-#define FMODE_BINMODE               0x00000004
-
-/**
- * The  IO  is in  "sync  mode".   All output  is  immediately  flushed to  the
- * underlying operating system then.  Can  be set via rb_io_synchronized(), but
- * there is no way except calling `IO#sync=` to reset.
- */
-#define FMODE_SYNC                  0x00000008
-
-/**
- * The IO  is a TTY.  What  is a TTY and  what isn't depends on  the underlying
- * operating system's `isatty(3)` output.  You cannot change this.
- */
-#define FMODE_TTY                   0x00000010
-
-/**
- * Ruby eventually  detects that the IO  is bidirectional.  For instance  a TTY
- * has such  property.  There are  several other  things known to  be duplexed.
- * Additionally you  (extension library  authors) can  also implement  your own
- * bidirectional IO subclasses.  One of such example is `Socket`.
- */
-#define FMODE_DUPLEX                0x00000020
-
-/**
- * The IO is opened  for appending.  This mode always writes at  the end of the
- * IO.  Ruby manages  this flag for record but basically  the logic behind this
- * mode is at the underlying operating system.  We almost do nothing.
- */
-#define FMODE_APPEND                0x00000040
-
-/**
- * The IO is  opened for creating.  This makes sense  only when the destination
- * file does  not exist at  the time  the IO object  was created.  This  is the
- * default mode  for writing,  but you  can pass `"r+"`  to `IO.open`  etc., to
- * reroute this creation.
- */
-#define FMODE_CREATE                0x00000080
-/* #define FMODE_NOREVLOOKUP        0x00000100 */
-
-/**
- * This flag amends the effect of #FMODE_CREATE,  so that if there already is a
- * file at the given path the operation fails.  Using this you can be sure that
- * the file you get is a fresh new one.
- */
-#define FMODE_EXCL                  0x00000400
-
-/**
- * This flag amends the effect of #FMODE_CREATE,  so that if there already is a
- * file at the given path it gets truncated.
- */
-#define FMODE_TRUNC                 0x00000800
-
-/**
- * The IO is in "text mode".  On  systems where such mode make sense, this flag
- * changes  the way  the  IO handles  the  contents.  On  POSIX  systems it  is
- * basically  a no-op,  but with  this  flag set  you can  optionally let  Ruby
- * manually convert newlines, unlike when in binary mode:
- *
- * ```ruby
- * IO.open("/p/a/t/h", "wt", crlf_newline: true) # "wb" is NG.
- * ```
- *
- * Setting this one and #FMODE_BINMODE at the same time is a contradiction.
- */
-#define FMODE_TEXTMODE              0x00001000
-/**
- * This flag means that an IO object is wrapping an "external" file descriptor,
- * which is owned by something outside the Ruby interpreter (usually a C extension).
- * Ruby will not close this file when the IO object is garbage collected.
- * If this flag is set, then IO#autoclose? is false, and vice-versa.
- *
- * This flag was previously called FMODE_PREP internally.
- */
-#define FMODE_EXTERNAL              0x00010000
-
-/* #define FMODE_SIGNAL_ON_EPIPE    0x00020000 */
-
-/**
- * This flag amends the  encoding of the IO so that the BOM  of the contents of
- * the IO takes effect.
- */
-#define FMODE_SETENC_BY_BOM         0x00100000
-/* #define FMODE_UNIX                  0x00200000 */
-/* #define FMODE_INET                  0x00400000 */
-/* #define FMODE_INET6                 0x00800000 */
-
-/** @} */
-
-/**
  * Allocate a new IO object, with the given file descriptor.
  */
 VALUE rb_io_open_descriptor(VALUE klass, int descriptor, int mode, VALUE path, VALUE timeout, struct rb_io_encoding *encoding);
@@ -525,7 +565,7 @@ FILE *rb_fdopen(int fd, const char *modestr);
  *
  * rb_io_modestr_fmode() is not a pure function because it raises.
  */
-int rb_io_modestr_fmode(const char *modestr);
+enum rb_io_mode rb_io_modestr_fmode(const char *modestr);
 
 /**
  * Identical  to rb_io_modestr_fmode(),  except it  returns a  mixture of  `O_`
@@ -780,7 +820,7 @@ int rb_io_mode(VALUE io);
  * @post        `enc2_p` is the specified external encoding.
  * @post        `fmode_p` is the specified set of `FMODE_` modes.
  */
-int rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **enc2_p, int *fmode_p);
+int rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **enc2_p, enum rb_io_mode *fmode_p);
 
 /**
  * This    function    can   be    seen    as    an   extended    version    of
@@ -849,7 +889,7 @@ int rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **
  *   ) -> void
  * ```
  */
-void rb_io_extract_modeenc(VALUE *vmode_p, VALUE *vperm_p, VALUE opthash, int *oflags_p, int *fmode_p, rb_io_enc_t *convconfig_p);
+void rb_io_extract_modeenc(VALUE *vmode_p, VALUE *vperm_p, VALUE opthash, int *oflags_p, enum rb_io_mode *fmode_p, rb_io_enc_t *convconfig_p);
 
 /* :TODO: can this function be __attribute__((warn_unused_result)) or not? */
 /**
@@ -964,6 +1004,9 @@ VALUE rb_io_wait(VALUE io, VALUE events, VALUE timeout);
  * }
  * ```
  *
+ * On timeout, ::RUBY_Qfalse is returned. Unless you are specifically handling
+ * the timeouts, you should typically raise ::rb_eIOTimeoutError in this case.
+ *
  * @param[in]  error                System errno.
  * @param[in]  io                   An IO object to wait.
  * @param[in]  events               An integer set of interests.
@@ -972,19 +1015,19 @@ VALUE rb_io_wait(VALUE io, VALUE events, VALUE timeout);
  * @exception  rb_eRangeError       `timeout` is out of range.
  * @exception  rb_eSystemCallError  `select(2)` failed for some reason.
  * @retval     RUBY_Qfalse          Operation timed out.
+ * @retval     RUBY_Qnil            Operation failed for some other reason (errno).
  * @retval     Otherwise            Actual events reached.
  *
- * @internal
- *
- * This function  to return ::RUBY_Qfalse  on timeout could be  unintended.  It
- * seems timeout feature has some rough edge.
  */
 VALUE rb_io_maybe_wait(int error, VALUE io, VALUE events, VALUE timeout);
 
 /**
  * Blocks until the passed IO is ready for reading, if that makes sense for the
- * passed  errno.  This  is  a  special case  of  rb_io_maybe_wait() that  only
- * concerns for reading.
+ * passed  errno.  This  is  a  special case  of  rb_io_maybe_wait() that is
+ * only concerned with reading and handles the timeout.
+ *
+ * If you do not want the default timeout handling, consider using
+ * ::rb_io_maybe_wait directly.
  *
  * @param[in]  error                System errno.
  * @param[in]  io                   An IO object to wait.
@@ -992,15 +1035,18 @@ VALUE rb_io_maybe_wait(int error, VALUE io, VALUE events, VALUE timeout);
  * @exception  rb_eIOError          `io` is not open.
  * @exception  rb_eRangeError       `timeout` is out of range.
  * @exception  rb_eSystemCallError  `select(2)` failed for some reason.
- * @retval     0                    Operation timed out.
+ * @exception  rb_eIOTimeoutError   The wait operation timed out.
  * @retval     Otherwise            Always returns ::RUBY_IO_READABLE.
  */
 int rb_io_maybe_wait_readable(int error, VALUE io, VALUE timeout);
 
 /**
  * Blocks until the passed IO is ready for writing, if that makes sense for the
- * passed  errno.  This  is  a  special case  of  rb_io_maybe_wait() that  only
- * concernsfor writing.
+ * passed  errno.  This  is  a  special case  of  rb_io_maybe_wait() that is
+ * only concerned with writing, and handles the timeout.
+ *
+ * If you do not want the default timeout handling, consider using
+ * ::rb_io_maybe_wait directly.
  *
  * @param[in]  error                System errno.
  * @param[in]  io                   An IO object to wait.
@@ -1008,7 +1054,7 @@ int rb_io_maybe_wait_readable(int error, VALUE io, VALUE timeout);
  * @exception  rb_eIOError          `io` is not open.
  * @exception  rb_eRangeError       `timeout` is out of range.
  * @exception  rb_eSystemCallError  `select(2)` failed for some reason.
- * @retval     0                    Operation timed out.
+ * @exception  rb_eIOTimeoutError   The wait operation timed out.
  * @retval     Otherwise            Always returns ::RUBY_IO_WRITABLE.
  */
 int rb_io_maybe_wait_writable(int error, VALUE io, VALUE timeout);
@@ -1067,6 +1113,18 @@ int rb_io_read_pending(rb_io_t *fptr);
  */
 VALUE rb_stat_new(const struct stat *st);
 
+#if RUBY_USE_STATX
+/**
+ * Constructs an instance of ::rb_cStat from the passed information.
+ *
+ * @param[in]  st  A stat.
+ * @return     Allocated new instance of ::rb_cStat.
+ */
+VALUE rb_statx_new(const rb_io_stat_data *st);
+#else
+# define rb_statx_new rb_stat_new
+#endif
+
 /* gc.c */
 
 RBIMPL_SYMBOL_EXPORT_END()
diff --git a/include/ruby/onigmo.h b/include/ruby/onigmo.h
index d233336316..5c2ebe55fe 100644
--- a/include/ruby/onigmo.h
+++ b/include/ruby/onigmo.h
@@ -4,8 +4,8 @@
   onigmo.h - Onigmo (Oniguruma-mod) (regular expression library)
 **********************************************************************/
 /*-
- * Copyright (c) 2002-2009  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
- * Copyright (c) 2011-2017  K.Takata  <kentkt AT csc DOT jp>
+ * Copyright (c) 2002-2016  K.Kosako  <sndgk393 AT ybb DOT ne DOT jp>
+ * Copyright (c) 2011-2019  K.Takata  <kentkt AT csc DOT jp>
  * All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
@@ -38,8 +38,8 @@ extern "C" {
 #endif
 
 #define ONIGMO_VERSION_MAJOR   6
-#define ONIGMO_VERSION_MINOR   1
-#define ONIGMO_VERSION_TEENY   3
+#define ONIGMO_VERSION_MINOR   2
+#define ONIGMO_VERSION_TEENY   0
 
 #ifndef ONIG_EXTERN
 # ifdef RUBY_EXTERN
@@ -636,6 +636,7 @@ ONIG_EXTERN const OnigSyntaxType*   OnigDefaultSyntax;
 #define ONIGERR_PARSE_DEPTH_LIMIT_OVER                        -16
 #define ONIGERR_DEFAULT_ENCODING_IS_NOT_SET                   -21
 #define ONIGERR_SPECIFIED_ENCODING_CANT_CONVERT_TO_WIDE_CHAR  -22
+#define ONIGERR_TIMEOUT                                       -23
 /* general error */
 #define ONIGERR_INVALID_ARGUMENT                              -30
 /* syntax error */
@@ -686,6 +687,8 @@ ONIG_EXTERN const OnigSyntaxType*   OnigDefaultSyntax;
 #define ONIGERR_NEVER_ENDING_RECURSION                       -221
 #define ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY        -222
 #define ONIGERR_INVALID_CHAR_PROPERTY_NAME                   -223
+#define ONIGERR_TOO_MANY_RANGE_REPEAT                        -224
+#define ONIGERR_TOO_MANY_NULL_CHECK                          -225
 #define ONIGERR_INVALID_CODE_POINT_VALUE                     -400
 #define ONIGERR_INVALID_WIDE_CHAR_VALUE                      -400
 #define ONIGERR_TOO_BIG_WIDE_CHAR_VALUE                      -401
@@ -788,8 +791,8 @@ typedef struct re_pattern_buffer {
   unsigned char *exact;
   unsigned char *exact_end;
   unsigned char  map[ONIG_CHAR_TABLE_SIZE]; /* used as BM skip or char-map */
-  int           *int_map;                   /* BM skip for exact_len > 255 */
-  int           *int_map_backward;          /* BM skip for backward search */
+  int           *reserved1;
+  int           *reserved2;
   OnigDistance   dmin;                      /* min-distance of exact or map */
   OnigDistance   dmax;                      /* max-distance of exact or map */
 
diff --git a/include/ruby/ractor.h b/include/ruby/ractor.h
index 7811616f6d..8cfca21621 100644
--- a/include/ruby/ractor.h
+++ b/include/ruby/ractor.h
@@ -217,7 +217,7 @@ VALUE rb_ractor_make_shareable(VALUE obj);
  *
  * @param[in]   obj              Arbitrary ruby object to duplicate.
  * @exception   rb_eRactorError  Ractors cannot share `obj` by nature.
- * @return      A deep copy of `obj` which is sharable among Ractors.
+ * @return      A deep copy of `obj` which is shareable among Ractors.
  */
 VALUE rb_ractor_make_shareable_copy(VALUE obj);
 
@@ -261,4 +261,18 @@ rb_ractor_shareable_p(VALUE obj)
     }
 }
 
+// TODO: optimize on interpreter core
+#ifndef RB_OBJ_SET_SHAREABLE
+VALUE rb_obj_set_shareable(VALUE obj); // ractor.c
+#define RB_OBJ_SET_SHAREABLE(obj) rb_obj_set_shareable(obj)
+#endif
+
+static inline VALUE
+RB_OBJ_SET_FROZEN_SHAREABLE(VALUE obj)
+{
+    RB_OBJ_FREEZE(obj);
+    RB_OBJ_SET_SHAREABLE(obj);
+    return obj;
+}
+
 #endif /* RUBY_RACTOR_H */
diff --git a/include/ruby/random.h b/include/ruby/random.h
index f3df0d96fb..3b63a23334 100644
--- a/include/ruby/random.h
+++ b/include/ruby/random.h
@@ -332,7 +332,8 @@ RBIMPL_ATTR_PURE_UNLESS_DEBUG()
 static inline const rb_random_interface_t *
 rb_rand_if(VALUE obj)
 {
-    RBIMPL_ASSERT_OR_ASSUME(RTYPEDDATA_P(obj));
+    RBIMPL_ASSERT_OR_ASSUME(RB_TYPE_P(obj, T_DATA));
+    RUBY_ASSERT(rb_typeddata_is_kind_of(obj, &rb_random_data_type));
     const struct rb_data_type_struct *t = RTYPEDDATA_TYPE(obj);
     const void *ret = t->data;
     return RBIMPL_CAST((const rb_random_interface_t *)ret);
diff --git a/include/ruby/ruby.h b/include/ruby/ruby.h
index 035f02c70b..ca794bcaeb 100644
--- a/include/ruby/ruby.h
+++ b/include/ruby/ruby.h
@@ -426,6 +426,21 @@ __extension__({ \
 # include "ruby/backward.h"
 #endif
 
+#ifndef RUBY__ASAN_DEFAULT_OPTIONS
+# define RUBY__ASAN_DEFAULT_OPTIONS
+#endif
+
+#define RUBY_GLOBAL_SETUP \
+    RUBY__ASAN_DEFAULT_OPTIONS \
+    /* RUBY_GLOBAL_SETUP end */
+
+#if defined(__wasm__) && !defined(__EMSCRIPTEN__)
+int rb_wasm_rt_start(int (*)(int, char **), int, char **);
+# define ruby_start_main rb_wasm_rt_start
+#else
+# define ruby_start_main(main, argc, argv) main(argc, argv)
+#endif
+
 RBIMPL_SYMBOL_EXPORT_END()
 
 #endif /* RUBY_RUBY_H */
diff --git a/include/ruby/st.h b/include/ruby/st.h
index f35ab43603..b510989b6b 100644
--- a/include/ruby/st.h
+++ b/include/ruby/st.h
@@ -84,13 +84,12 @@ struct st_table {
     const struct st_hash_type *type;
     /* Number of entries currently in the table.  */
     st_index_t num_entries;
-    /* Array of bins used for access by keys.  */
-    st_index_t *bins;
     /* Start and bound index of entries in array entries.
        entries_starts and entries_bound are in interval
        [0,allocated_entries].  */
     st_index_t entries_start, entries_bound;
-    /* Array of size 2^entry_power.  */
+    /* Array of size 2^entry_power.
+       Optionnally followed by an array of bins used for access by keys.  */
     st_table_entry *entries;
 };
 
diff --git a/include/ruby/thread.h b/include/ruby/thread.h
index 337f477fd0..2fa01229e2 100644
--- a/include/ruby/thread.h
+++ b/include/ruby/thread.h
@@ -59,6 +59,19 @@
  */
 #define RB_NOGVL_UBF_ASYNC_SAFE  (0x2)
 
+/**
+ * Passing  this  flag   to  rb_nogvl()  indicates  that  the   passed function
+ * is safe to offload to a background thread or work pool. In other words, the
+ * function is safe to run using a fiber scheduler's `blocking_operation_wait`.
+ * hook.
+ *
+ * If your function depends on thread-local storage, or thread-specific data
+ * operations/data structures, you should not set this flag, as
+ * these operations may behave differently (or fail) when run in a different
+ * thread/context (e.g. unlocking a mutex).
+ */
+#define RB_NOGVL_OFFLOAD_SAFE  (0x4)
+
 /** @} */
 
 RBIMPL_SYMBOL_EXPORT_BEGIN()
@@ -320,6 +333,13 @@ void *rb_internal_thread_specific_get(VALUE thread_val, rb_internal_thread_speci
  */
 void rb_internal_thread_specific_set(VALUE thread_val, rb_internal_thread_specific_key_t key, void *data);
 
+/**
+ * Whether the current thread is holding the GVL.
+ *
+ * @return true if the current thread is holding the GVL, false otherwise.
+ */
+int ruby_thread_has_gvl_p(void);
+
 RBIMPL_SYMBOL_EXPORT_END()
 
 #endif /* RUBY_THREAD_H */
diff --git a/include/ruby/version.h b/include/ruby/version.h
index e9113177de..5bb381cea2 100644
--- a/include/ruby/version.h
+++ b/include/ruby/version.h
@@ -61,13 +61,13 @@
  * doesn't mean a total rewrite.  Practically  when it comes to API versioning,
  * major and minor version changes are equally catastrophic.
  */
-#define RUBY_API_VERSION_MAJOR 3
+#define RUBY_API_VERSION_MAJOR 4
 
 /**
  * Minor  version.   As of  writing  this  version changes  annually.   Greater
  * version doesn't mean "better"; they just mean years passed.
  */
-#define RUBY_API_VERSION_MINOR 4
+#define RUBY_API_VERSION_MINOR 1
 
 /**
  * Teeny version.  This digit  is kind of reserved these days.   Kept 0 for the
diff --git a/include/ruby/win32.h b/include/ruby/win32.h
index 27a3467606..ae11a61481 100644
--- a/include/ruby/win32.h
+++ b/include/ruby/win32.h
@@ -30,15 +30,10 @@ extern "C++" {			/* template without extern "C++" */
 #if !defined(_WIN64) && !defined(WIN32)
 #define WIN32
 #endif
-#if defined(_MSC_VER) && _MSC_VER <= 1200
-#include <windows.h>
-#endif
 #include <winsock2.h>
 #include <ws2tcpip.h>
 #include <mswsock.h>
-#if !defined(_MSC_VER) || _MSC_VER >= 1400
 #include <iphlpapi.h>
-#endif
 #if defined(__cplusplus) && defined(_MSC_VER)
 }
 #endif
@@ -59,13 +54,7 @@ extern "C++" {			/* template without extern "C++" */
 #include <direct.h>
 #include <process.h>
 #include <time.h>
-#if defined(__cplusplus) && defined(_MSC_VER) && _MSC_VER == 1200
-extern "C++" {			/* template without extern "C++" */
-#endif
 #include <math.h>
-#if defined(__cplusplus) && defined(_MSC_VER) && _MSC_VER == 1200
-}
-#endif
 #include <signal.h>
 #include <sys/stat.h>
 #include <sys/types.h>
@@ -126,8 +115,30 @@ typedef unsigned int uintptr_t;
 #define O_SHARE_DELETE 0x20000000 /* for rb_w32_open(), rb_w32_wopen() */
 
 typedef int clockid_t;
-#define CLOCK_REALTIME  0
-#define CLOCK_MONOTONIC 1
+
+/*
+ * Since we use our versions in win32/win32.c, not to depend on yet
+ * another DLL, prefix our versions not to conflict with inline
+ * versions provided in time.h.
+ */
+#define clock_gettime rb_w32_clock_gettime
+#define clock_getres rb_w32_clock_getres
+
+#ifndef CLOCK_REALTIME
+#  define CLOCK_REALTIME  0
+#endif
+#ifndef CLOCK_MONOTONIC
+#  define CLOCK_MONOTONIC 1
+#endif
+#ifndef CLOCK_PROCESS_CPUTIME_ID
+#  define CLOCK_PROCESS_CPUTIME_ID 2
+#endif
+#ifndef CLOCK_THREAD_CPUTIME_ID
+#  define CLOCK_THREAD_CPUTIME_ID 3
+#endif
+#ifndef CLOCK_REALTIME_COARSE
+#  define CLOCK_REALTIME_COARSE 4
+#endif
 
 #undef utime
 #undef lseek
@@ -251,7 +262,6 @@ struct ifaddrs {
 #endif
 
 extern void   rb_w32_sysinit(int *, char ***);
-extern DWORD  rb_w32_osid(void);
 extern int    flock(int fd, int oper);
 extern int    rb_w32_io_cancelable_p(int);
 extern int    rb_w32_is_socket(int);
@@ -295,7 +305,11 @@ extern void   rb_w32_free_environ(char **);
 extern int    rb_w32_map_errno(DWORD);
 extern const char *WSAAPI rb_w32_inet_ntop(int,const void *,char *,size_t);
 extern int WSAAPI rb_w32_inet_pton(int,const char *,void *);
-extern DWORD  rb_w32_osver(void);
+
+RBIMPL_ATTR_DEPRECATED(("as Windows 9x is not supported already"))
+static inline DWORD rb_w32_osid(void) {return VER_PLATFORM_WIN32_NT;}
+RBIMPL_ATTR_DEPRECATED(("by Windows Version Helper APIs"))
+extern DWORD rb_w32_osver(void);
 
 extern int rb_w32_uchown(const char *, int, int);
 extern int rb_w32_ulink(const char *, const char *);
@@ -331,7 +345,7 @@ extern int rb_w32_dup2(int, int);
 
 #include <float.h>
 
-#if defined _MSC_VER && _MSC_VER >= 1800 && defined INFINITY
+#if defined _MSC_VER && defined INFINITY
 #pragma warning(push)
 #pragma warning(disable:4756)
 static inline float
@@ -414,11 +428,6 @@ extern int rb_w32_utruncate(const char *path, rb_off_t length);
 #define HAVE_TRUNCATE 1
 #define truncate rb_w32_utruncate
 
-#if defined(_MSC_VER) && _MSC_VER >= 1400 && _MSC_VER < 1800
-#define strtoll  _strtoi64
-#define strtoull _strtoui64
-#endif
-
 /*
  * stubs
  */
diff --git a/inits.c b/inits.c
index 677a384f9a..4988fa09d0 100644
--- a/inits.c
+++ b/inits.c
@@ -52,6 +52,8 @@ rb_call_inits(void)
     CALL(Time);
     CALL(Random);
     CALL(load);
+    CALL(Ruby_module);
+    CALL(Box);
     CALL(Proc);
     CALL(Binding);
     CALL(Math);
@@ -63,18 +65,21 @@ rb_call_inits(void)
     CALL(ISeq);
     CALL(Thread);
     CALL(signal);
+    CALL(Cont);
     CALL(Fiber_Scheduler);
     CALL(process);
-    CALL(Cont);
     CALL(Rational);
     CALL(Complex);
     CALL(MemoryView);
+    CALL(pathname);
     CALL(version);
     CALL(vm_trace);
     CALL(vm_stack_canary);
     CALL(ast);
     CALL(shape);
     CALL(Prism);
+    CALL(unicode_version);
+    CALL(Set);
 
     // enable builtin loading
     CALL(builtin);
@@ -84,6 +89,10 @@ void
 rb_call_builtin_inits(void)
 {
 #define BUILTIN(n) CALL(builtin_##n)
+    BUILTIN(jit_hook);
+    BUILTIN(yjit);
+    BUILTIN(zjit);
+    BUILTIN(kernel);
     BUILTIN(gc);
     BUILTIN(ractor);
     BUILTIN(numeric);
@@ -92,19 +101,16 @@ rb_call_builtin_inits(void)
     BUILTIN(ast);
     BUILTIN(trace_point);
     BUILTIN(pack);
+    BUILTIN(pathname_builtin);
     BUILTIN(warning);
     BUILTIN(array);
-    BUILTIN(kernel);
+    BUILTIN(hash);
     BUILTIN(symbol);
     BUILTIN(timev);
     BUILTIN(thread_sync);
-    BUILTIN(yjit);
     BUILTIN(nilclass);
     BUILTIN(marshal);
-#if USE_RJIT
-    BUILTIN(rjit_c);
-    BUILTIN(rjit);
-#endif
+    BUILTIN(jit_undef);
     Init_builtin_prelude();
 }
 #undef CALL
diff --git a/insns.def b/insns.def
index f7df92cf06..3ad378081a 100644
--- a/insns.def
+++ b/insns.def
@@ -145,6 +145,7 @@ getblockparamproxy
 (lindex_t idx, rb_num_t level)
 ()
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     const VALUE *ep = vm_get_ep(GET_EP(), level);
     VM_ASSERT(VM_ENV_LOCAL_P(ep));
@@ -212,6 +213,7 @@ getinstancevariable
 (VALUE val)
 /* Ractor crashes when it accesses class/module-level instances variables. */
 // attr bool leaf = false; /* has IVAR_ACCESSOR_SHOULD_BE_MAIN_RACTOR() */
+// attr bool zjit_profile = true;
 {
     val = vm_getinstancevariable(GET_ISEQ(), GET_SELF(), id, ic);
 }
@@ -223,6 +225,7 @@ setinstancevariable
 (VALUE val)
 ()
 // attr bool leaf = false; /* has rb_check_frozen() */
+// attr bool zjit_profile = true;
 {
     vm_setinstancevariable(GET_ISEQ(), GET_SELF(), id, val, ic);
 }
@@ -370,7 +373,7 @@ putspecialobject
 
 /* put string val. string will be copied. */
 DEFINE_INSN
-putstring
+dupstring
 (VALUE str)
 ()
 (VALUE val)
@@ -380,7 +383,7 @@ putstring
 
 /* put chilled string val. string will be copied but frozen in the future. */
 DEFINE_INSN
-putchilledstring
+dupchilledstring
 (VALUE str)
 ()
 (VALUE val)
@@ -426,9 +429,7 @@ toregexp
 // attr bool leaf = false;
 // attr rb_snum_t sp_inc = 1 - (rb_snum_t)cnt;
 {
-    const VALUE ary = rb_ary_tmp_new_from_values(0, cnt, STACK_ADDR_FROM_TOP(cnt));
-    val = rb_reg_new_ary(ary, (int)opt);
-    rb_ary_clear(ary);
+    val = rb_reg_new_from_values(cnt, STACK_ADDR_FROM_TOP(cnt), (int)opt);
 }
 
 /* intern str to Symbol and push it. */
@@ -452,26 +453,6 @@ newarray
     val = rb_ec_ary_new_from_values(ec, num, STACK_ADDR_FROM_TOP(num));
 }
 
-/* put new array initialized with num values on the stack. There
-   should be at least one element on the stack, and the top element
-   should be a hash.  If the top element is empty, it is not
-   included in the array.
- */
-DEFINE_INSN
-newarraykwsplat
-(rb_num_t num)
-(...)
-(VALUE val)
-// attr rb_snum_t sp_inc = 1 - (rb_snum_t)num;
-{
-    if (RHASH_EMPTY_P(*STACK_ADDR_FROM_TOP(1))) {
-        val = rb_ary_new4(num-1, STACK_ADDR_FROM_TOP(num));
-    }
-    else {
-        val = rb_ary_new4(num, STACK_ADDR_FROM_TOP(num));
-    }
-}
-
 /* push hash onto array unless the hash is empty (as empty keyword
    splats should be ignored).
  */
@@ -586,6 +567,7 @@ splatkw
 (VALUE hash, VALUE block)
 (VALUE obj, VALUE block)
 // attr bool leaf = false; /* has rb_to_hash_type() */
+// attr bool zjit_profile = true;
 {
     if (NIL_P(hash)) {
         obj = Qnil;
@@ -607,8 +589,7 @@ newhash
     RUBY_DTRACE_CREATE_HOOK(HASH, num);
 
     if (num) {
-        val = rb_hash_new_with_size(num / 2);
-        rb_hash_bulk_insert(num, STACK_ADDR_FROM_TOP(num), val);
+        val = rb_hash_new_with_bulk_insert(num, STACK_ADDR_FROM_TOP(num));
     }
     else {
         val = rb_hash_new();
@@ -764,6 +745,7 @@ definedivar
 ()
 (VALUE val)
 // attr bool leaf  = false;
+// attr bool zjit_profile = true;
 {
     val = Qnil;
     if (!UNDEF_P(vm_getivar(GET_SELF(), id, GET_ISEQ(), ic, NULL, FALSE, Qundef))) {
@@ -822,13 +804,20 @@ defineclass
 (VALUE val)
 {
     VALUE klass = vm_find_or_create_class_by_id(id, flags, cbase, super);
+    const rb_box_t *box = rb_current_box();
 
     rb_iseq_check(class_iseq);
 
+    rb_cref_t *cref = vm_cref_push(ec, klass, NULL, FALSE, FALSE);
+
+    if (VM_DEFINECLASS_DYNAMIC_CREF_P(flags)) {
+        CREF_DYNAMIC_SET(cref);
+    }
+
     /* enter scope */
     vm_push_frame(ec, class_iseq, VM_FRAME_MAGIC_CLASS | VM_ENV_FLAG_LOCAL, klass,
-                  GET_BLOCK_HANDLER(),
-                  (VALUE)vm_cref_push(ec, klass, NULL, FALSE, FALSE),
+                  GC_GUARDED_PTR(box),
+                  (VALUE)cref,
                   ISEQ_BODY(class_iseq)->iseq_encoded, GET_SP(),
                   ISEQ_BODY(class_iseq)->local_table_size,
                   ISEQ_BODY(class_iseq)->stack_max);
@@ -864,6 +853,7 @@ send
 (CALL_DATA cd, ISEQ blockiseq)
 (...)
 (VALUE val)
+// attr bool zjit_profile = true;
 // attr rb_snum_t sp_inc = sp_inc_of_sendish(cd->ci);
 // attr rb_snum_t comptime_sp_inc = sp_inc_of_sendish(ci);
 {
@@ -877,12 +867,40 @@ send
     }
 }
 
+/* invoke forward method. */
+DEFINE_INSN
+sendforward
+(CALL_DATA cd, ISEQ blockiseq)
+(...)
+(VALUE val)
+// attr rb_snum_t sp_inc = sp_inc_of_sendish(cd->ci);
+// attr rb_snum_t comptime_sp_inc = sp_inc_of_sendish(ci);
+{
+    struct rb_forwarding_call_data adjusted_cd;
+    struct rb_callinfo adjusted_ci;
+
+    VALUE bh = vm_caller_setup_fwd_args(ec, GET_CFP(), cd, blockiseq, 0, &adjusted_cd, &adjusted_ci);
+
+    val = vm_sendish(ec, GET_CFP(), &adjusted_cd.cd, bh, mexp_search_method);
+    JIT_EXEC(ec, val);
+
+    if (cd->cc != adjusted_cd.cd.cc && vm_cc_markable(adjusted_cd.cd.cc)) {
+        RB_OBJ_WRITE(GET_ISEQ(), &cd->cc, adjusted_cd.cd.cc);
+    }
+
+    if (UNDEF_P(val)) {
+        RESTORE_REGS();
+        NEXT_INSN();
+    }
+}
+
 /* Invoke method without block */
 DEFINE_INSN
 opt_send_without_block
 (CALL_DATA cd)
 (...)
 (VALUE val)
+// attr bool zjit_profile = true;
 // attr bool handles_sp = true;
 // attr rb_snum_t sp_inc = sp_inc_of_sendish(cd->ci);
 // attr rb_snum_t comptime_sp_inc = sp_inc_of_sendish(ci);
@@ -897,6 +915,32 @@ opt_send_without_block
     }
 }
 
+/* Jump if "new" method has been defined by user */
+DEFINE_INSN
+opt_new
+(CALL_DATA cd, OFFSET dst)
+()
+()
+// attr bool leaf = false;
+{
+    VALUE argc = vm_ci_argc(cd->ci);
+    VALUE val = TOPN(argc);
+
+    // The bookkeeping slot should be empty.
+    RUBY_ASSERT(TOPN(argc + 1) == Qnil);
+
+    if (vm_method_cfunc_is(GET_CFP(), cd, val, rb_class_new_instance_pass_kw)) {
+        RB_DEBUG_COUNTER_INC(opt_new_hit);
+        val = rb_obj_alloc(val);
+        TOPN(argc) = val;
+        TOPN(argc + 1) = val;
+    }
+    else {
+        RB_DEBUG_COUNTER_INC(opt_new_miss);
+        JUMP(dst);
+    }
+}
+
 /* Convert object to string using to_s or equivalent. */
 DEFINE_INSN
 objtostring
@@ -904,8 +948,9 @@ objtostring
 (VALUE recv)
 (VALUE val)
 // attr bool leaf = false;
+// attr bool zjit_profile = true;
 {
-    val = vm_objtostring(GET_ISEQ(), recv, cd);
+    val = vm_objtostring(GET_CFP(), recv, cd);
 
     if (UNDEF_P(val)) {
         CALL_SIMPLE_METHOD();
@@ -913,6 +958,36 @@ objtostring
 }
 
 DEFINE_INSN
+opt_ary_freeze
+(VALUE ary, CALL_DATA cd)
+()
+(VALUE val)
+{
+    val = vm_opt_ary_freeze(ary, BOP_FREEZE, idFreeze);
+
+    if (UNDEF_P(val)) {
+        RUBY_DTRACE_CREATE_HOOK(ARRAY, RARRAY_LEN(ary));
+        PUSH(rb_ary_resurrect(ary));
+        CALL_SIMPLE_METHOD();
+    }
+}
+
+DEFINE_INSN
+opt_hash_freeze
+(VALUE hash, CALL_DATA cd)
+()
+(VALUE val)
+{
+    val = vm_opt_hash_freeze(hash, BOP_FREEZE, idFreeze);
+
+    if (UNDEF_P(val)) {
+        RUBY_DTRACE_CREATE_HOOK(HASH, RHASH_SIZE(hash) << 1);
+        PUSH(rb_hash_resurrect(hash));
+        CALL_SIMPLE_METHOD();
+    }
+}
+
+DEFINE_INSN
 opt_str_freeze
 (VALUE str, CALL_DATA cd)
 ()
@@ -932,8 +1007,9 @@ opt_nil_p
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
-    val = vm_opt_nil_p(GET_ISEQ(), cd, recv);
+    val = vm_opt_nil_p(GET_CFP(), cd, recv);
 
     if (UNDEF_P(val)) {
         CALL_SIMPLE_METHOD();
@@ -955,8 +1031,30 @@ opt_str_uminus
 }
 
 DEFINE_INSN
+opt_duparray_send
+(VALUE ary, ID method, rb_num_t argc)
+(...)
+(VALUE val)
+/* This instruction typically has no funcalls.  But it may compare array
+ * contents to each other which may call methods when necessary.
+ * No way to detect such method calls beforehand.
+ * We must mark it as not leaf. */
+// attr bool leaf = false; /* has rb_funcall() */
+// attr rb_snum_t sp_inc = 1 - (rb_snum_t)argc;
+// attr rb_snum_t comptime_sp_inc = 1 - (rb_snum_t)argc;
+{
+    switch (method) {
+      case idIncludeP:
+        val = vm_opt_duparray_include_p(ec, ary, TOPN(0));
+        break;
+      default:
+        rb_bug("unreachable");
+    }
+}
+
+DEFINE_INSN
 opt_newarray_send
-(rb_num_t num, ID method)
+(rb_num_t num, rb_num_t method)
 (...)
 (VALUE val)
 /* This instruction typically has no funcalls.  But it compares array
@@ -967,18 +1065,24 @@ opt_newarray_send
 // attr rb_snum_t sp_inc = 1 - (rb_snum_t)num;
 // attr rb_snum_t comptime_sp_inc = 1 - (rb_snum_t)num;
 {
-    switch(method) {
-      case idHash:
+    switch (method) {
+      case VM_OPT_NEWARRAY_SEND_HASH:
         val = vm_opt_newarray_hash(ec, num, STACK_ADDR_FROM_TOP(num));
         break;
-      case idMin:
+      case VM_OPT_NEWARRAY_SEND_MIN:
         val = vm_opt_newarray_min(ec, num, STACK_ADDR_FROM_TOP(num));
         break;
-      case idMax:
+      case VM_OPT_NEWARRAY_SEND_MAX:
         val = vm_opt_newarray_max(ec, num, STACK_ADDR_FROM_TOP(num));
         break;
-      case idPack:
-        val = rb_vm_opt_newarray_pack(ec, (long)num-1, STACK_ADDR_FROM_TOP(num), TOPN(0));
+      case VM_OPT_NEWARRAY_SEND_INCLUDE_P:
+        val = vm_opt_newarray_include_p(ec, (long)num-1, STACK_ADDR_FROM_TOP(num), TOPN(0));
+        break;
+      case VM_OPT_NEWARRAY_SEND_PACK:
+        val = vm_opt_newarray_pack_buffer(ec, (long)num-1, STACK_ADDR_FROM_TOP(num), TOPN(0), Qundef);
+        break;
+      case VM_OPT_NEWARRAY_SEND_PACK_BUFFER:
+        val = vm_opt_newarray_pack_buffer(ec, (long)num-2, STACK_ADDR_FROM_TOP(num), TOPN(1), TOPN(0));
         break;
       default:
         rb_bug("unreachable");
@@ -993,11 +1097,54 @@ invokesuper
 (VALUE val)
 // attr rb_snum_t sp_inc = sp_inc_of_sendish(cd->ci);
 // attr rb_snum_t comptime_sp_inc = sp_inc_of_sendish(ci);
+// attr bool zjit_profile = true;
+{
+    struct rb_callinfo adjusted_ci = VM_CI_ON_STACK(vm_ci_mid(cd->ci),
+                                                   vm_ci_flag(cd->ci),
+                                                   vm_ci_argc(cd->ci),
+                                                   vm_ci_kwarg(cd->ci));
+    const struct rb_callcache *original_cc = rbimpl_atomic_ptr_load((void **)&cd->cc, RBIMPL_ATOMIC_ACQUIRE);
+    struct rb_call_data adjusted_cd = {
+        .ci = &adjusted_ci,
+        .cc = original_cc,
+    };
+
+    VALUE bh = vm_caller_setup_arg_block(ec, GET_CFP(), adjusted_cd.ci, blockiseq, true);
+    val = vm_sendish(ec, GET_CFP(), &adjusted_cd, bh, mexp_search_super);
+    JIT_EXEC(ec, val);
+
+    if (original_cc != adjusted_cd.cc && vm_cc_markable(adjusted_cd.cc)) {
+        rbimpl_atomic_ptr_store((volatile void **)&cd->cc, (void *)adjusted_cd.cc, RBIMPL_ATOMIC_RELEASE);
+        RB_OBJ_WRITTEN(GET_ISEQ(), Qundef, adjusted_cd.cc);
+    }
+
+    if (UNDEF_P(val)) {
+        RESTORE_REGS();
+        NEXT_INSN();
+    }
+}
+
+/* super(args) # args.size => num */
+DEFINE_INSN
+invokesuperforward
+(CALL_DATA cd, ISEQ blockiseq)
+(...)
+(VALUE val)
+// attr rb_snum_t sp_inc = sp_inc_of_sendish(cd->ci);
+// attr rb_snum_t comptime_sp_inc = sp_inc_of_sendish(ci);
 {
-    VALUE bh = vm_caller_setup_arg_block(ec, GET_CFP(), cd->ci, blockiseq, true);
-    val = vm_sendish(ec, GET_CFP(), cd, bh, mexp_search_super);
+    struct rb_forwarding_call_data adjusted_cd;
+    struct rb_callinfo adjusted_ci;
+
+    VALUE bh = vm_caller_setup_fwd_args(ec, GET_CFP(), cd, blockiseq, 1, &adjusted_cd, &adjusted_ci);
+
+    val = vm_sendish(ec, GET_CFP(), &adjusted_cd.cd, bh, mexp_search_super);
     JIT_EXEC(ec, val);
 
+    if (cd->cc != adjusted_cd.cd.cc && vm_cc_markable(adjusted_cd.cd.cc)) {
+        RB_OBJ_WRITE(GET_ISEQ(), &cd->cc, adjusted_cd.cd.cc);
+    }
+
     if (UNDEF_P(val)) {
         RESTORE_REGS();
         NEXT_INSN();
@@ -1013,6 +1160,7 @@ invokeblock
 // attr bool handles_sp = true;
 // attr rb_snum_t sp_inc = sp_inc_of_invokeblock(cd->ci);
 // attr rb_snum_t comptime_sp_inc = sp_inc_of_invokeblock(ci);
+// attr bool zjit_profile = true;
 {
     VALUE bh = VM_BLOCK_HANDLER_NONE;
     val = vm_sendish(ec, GET_CFP(), cd, bh, mexp_search_invokeblock);
@@ -1085,7 +1233,7 @@ jump
 ()
 ()
 /* Same discussion as leave. */
-// attr bool leaf = leafness_of_check_ints; /* has rb_threadptr_execute_interrupts() */
+// attr bool leaf = false; /* has rb_threadptr_execute_interrupts() */
 {
     RUBY_VM_CHECK_INTS(ec);
     JUMP(dst);
@@ -1098,7 +1246,7 @@ branchif
 (VALUE val)
 ()
 /* Same discussion as jump. */
-// attr bool leaf = leafness_of_check_ints; /* has rb_threadptr_execute_interrupts() */
+// attr bool leaf = false; /* has rb_threadptr_execute_interrupts() */
 {
     if (RTEST(val)) {
         RUBY_VM_CHECK_INTS(ec);
@@ -1113,7 +1261,7 @@ branchunless
 (VALUE val)
 ()
 /* Same discussion as jump. */
-// attr bool leaf = leafness_of_check_ints; /* has rb_threadptr_execute_interrupts() */
+// attr bool leaf = false; /* has rb_threadptr_execute_interrupts() */
 {
     if (!RTEST(val)) {
         RUBY_VM_CHECK_INTS(ec);
@@ -1128,7 +1276,7 @@ branchnil
 (VALUE val)
 ()
 /* Same discussion as jump. */
-// attr bool leaf = leafness_of_check_ints; /* has rb_threadptr_execute_interrupts() */
+// attr bool leaf = false; /* has rb_threadptr_execute_interrupts() */
 {
     if (NIL_P(val)) {
         RUBY_VM_CHECK_INTS(ec);
@@ -1136,6 +1284,56 @@ branchnil
     }
 }
 
+/* same as jump, but without interrupt check */
+DEFINE_INSN
+jump_without_ints
+(OFFSET dst)
+()
+()
+// attr bool leaf = true;
+{
+    JUMP(dst);
+}
+
+/* same as branchif, but without interrupt check */
+DEFINE_INSN
+branchif_without_ints
+(OFFSET dst)
+(VALUE val)
+()
+// attr bool leaf = true;
+{
+    if (RTEST(val)) {
+        JUMP(dst);
+    }
+}
+
+/* same as branchunless, but without interrupt check */
+DEFINE_INSN
+branchunless_without_ints
+(OFFSET dst)
+(VALUE val)
+()
+// attr bool leaf = true;
+{
+    if (!RTEST(val)) {
+        JUMP(dst);
+    }
+}
+
+/* same as branchnil, but without interrupt check */
+DEFINE_INSN
+branchnil_without_ints
+(OFFSET dst)
+(VALUE val)
+()
+// attr bool leaf = true;
+{
+    if (NIL_P(val)) {
+        JUMP(dst);
+    }
+}
+
 /**********************************************************/
 /* for optimize                                           */
 /**********************************************************/
@@ -1173,6 +1371,7 @@ opt_plus
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_plus(recv, obj);
 
@@ -1187,6 +1386,7 @@ opt_minus
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_minus(recv, obj);
 
@@ -1201,6 +1401,7 @@ opt_mult
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_mult(recv, obj);
 
@@ -1218,6 +1419,7 @@ opt_div
 /* In case of division by zero, it raises. Thus
  * ZeroDivisionError#initialize is called.  */
 // attr bool leaf = false;
+// attr bool zjit_profile = true;
 {
     val = vm_opt_div(recv, obj);
 
@@ -1234,6 +1436,7 @@ opt_mod
 (VALUE val)
 /* Same discussion as opt_div. */
 // attr bool leaf = false;
+// attr bool zjit_profile = true;
 {
     val = vm_opt_mod(recv, obj);
 
@@ -1248,8 +1451,9 @@ opt_eq
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
-    val = opt_equality(GET_ISEQ(), recv, obj, cd);
+    val = opt_equality(GET_CFP(), recv, obj, cd);
 
     if (UNDEF_P(val)) {
         CALL_SIMPLE_METHOD();
@@ -1262,8 +1466,9 @@ opt_neq
 (CALL_DATA cd_eq, CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
-    val = vm_opt_neq(GET_ISEQ(), cd, cd_eq, recv, obj);
+    val = vm_opt_neq(GET_CFP(), cd, cd_eq, recv, obj);
 
     if (UNDEF_P(val)) {
         CALL_SIMPLE_METHOD();
@@ -1276,6 +1481,7 @@ opt_lt
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_lt(recv, obj);
 
@@ -1290,6 +1496,7 @@ opt_le
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_le(recv, obj);
 
@@ -1304,6 +1511,7 @@ opt_gt
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_gt(recv, obj);
 
@@ -1318,6 +1526,7 @@ opt_ge
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_ge(recv, obj);
 
@@ -1336,6 +1545,7 @@ opt_ltlt
  * string.  Then what happens if that codepoint does not exist in the
  * string's encoding?  Of course an exception.  That's not a leaf. */
 // attr bool leaf = false; /* has "invalid codepoint" exception */
+// attr bool zjit_profile = true;
 {
     val = vm_opt_ltlt(recv, obj);
 
@@ -1350,6 +1560,7 @@ opt_and
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_and(recv, obj);
 
@@ -1364,6 +1575,7 @@ opt_or
 (CALL_DATA cd)
 (VALUE recv, VALUE obj)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_or(recv, obj);
 
@@ -1383,6 +1595,7 @@ opt_aref
  * default_proc.  This is a method call.  So opt_aref is
  * (surprisingly) not leaf. */
 // attr bool leaf = false; /* has rb_funcall() */ /* calls #yield */
+// attr bool zjit_profile = true;
 {
     val = vm_opt_aref(recv, obj);
 
@@ -1400,6 +1613,7 @@ opt_aset
 /* This is another story than opt_aref.  When vm_opt_aset() resorts
  * to rb_hash_aset(), which should call #hash for `obj`. */
 // attr bool leaf = false; /* has rb_funcall() */ /* calls #hash */
+// attr bool zjit_profile = true;
 {
     val = vm_opt_aset(recv, obj, set);
 
@@ -1408,50 +1622,13 @@ opt_aset
     }
 }
 
-/* recv[str] = set */
-DEFINE_INSN
-opt_aset_with
-(VALUE key, CALL_DATA cd)
-(VALUE recv, VALUE val)
-(VALUE val)
-/* Same discussion as opt_aset. */
-// attr bool leaf = false; /* has rb_funcall() */ /* calls #hash */
-{
-    VALUE tmp = vm_opt_aset_with(recv, key, val);
-
-    if (!UNDEF_P(tmp)) {
-        val = tmp;
-    }
-    else {
-        TOPN(0) = rb_str_resurrect(key);
-        PUSH(val);
-        CALL_SIMPLE_METHOD();
-    }
-}
-
-/* recv[str] */
-DEFINE_INSN
-opt_aref_with
-(VALUE key, CALL_DATA cd)
-(VALUE recv)
-(VALUE val)
-/* Same discussion as opt_aref. */
-// attr bool leaf = false; /* has rb_funcall() */ /* calls #yield */
-{
-    val = vm_opt_aref_with(recv, key);
-
-    if (UNDEF_P(val)) {
-        PUSH(rb_str_resurrect(key));
-        CALL_SIMPLE_METHOD();
-    }
-}
-
 /* optimized length */
 DEFINE_INSN
 opt_length
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_length(recv, BOP_LENGTH);
 
@@ -1466,6 +1643,7 @@ opt_size
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_length(recv, BOP_SIZE);
 
@@ -1480,6 +1658,7 @@ opt_empty_p
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_empty_p(recv);
 
@@ -1494,6 +1673,7 @@ opt_succ
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
     val = vm_opt_succ(recv);
 
@@ -1508,8 +1688,9 @@ opt_not
 (CALL_DATA cd)
 (VALUE recv)
 (VALUE val)
+// attr bool zjit_profile = true;
 {
-    val = vm_opt_not(GET_ISEQ(), cd, recv);
+    val = vm_opt_not(GET_CFP(), cd, recv);
 
     if (UNDEF_P(val)) {
         CALL_SIMPLE_METHOD();
@@ -1523,6 +1704,7 @@ opt_regexpmatch2
 (VALUE obj2, VALUE obj1)
 (VALUE val)
 // attr bool leaf = false; /* match_at() has rb_thread_check_ints() */
+// attr bool zjit_profile = true;
 {
     val = vm_opt_regexpmatch2(obj2, obj1);
 
diff --git a/internal.h b/internal.h
index 4fb99d1c08..002044cfa1 100644
--- a/internal.h
+++ b/internal.h
@@ -58,9 +58,6 @@
 /* internal/array.h */
 #define rb_ary_new_from_args(...) rb_nonexistent_symbol(__VA_ARGS__)
 
-/* internal/io.h */
-#define rb_io_fptr_finalize(...) rb_nonexistent_symbol(__VA_ARGS__)
-
 /* internal/string.h */
 #define rb_fstring_cstr(...) rb_nonexistent_symbol(__VA_ARGS__)
 
diff --git a/internal/array.h b/internal/array.h
index 39f6fcbea6..a2cd06f2e3 100644
--- a/internal/array.h
+++ b/internal/array.h
@@ -37,6 +37,8 @@ size_t rb_ary_size_as_embedded(VALUE ary);
 void rb_ary_make_embedded(VALUE ary);
 bool rb_ary_embeddable_p(VALUE ary);
 VALUE rb_ary_diff(VALUE ary1, VALUE ary2);
+VALUE rb_ary_compact_bang(VALUE ary);
+RUBY_EXTERN VALUE rb_cArray_empty_frozen;
 
 static inline VALUE rb_ary_entry_internal(VALUE ary, long offset);
 static inline bool ARY_PTR_USING_P(VALUE ary);
@@ -139,6 +141,8 @@ RARRAY_AREF(VALUE ary, long i)
     VALUE val;
     RBIMPL_ASSERT_TYPE(ary, RUBY_T_ARRAY);
 
+    RUBY_ASSERT(i < RARRAY_LEN(ary));
+
     RBIMPL_WARNING_PUSH();
 #if defined(__GNUC__) && !defined(__clang__) && __GNUC__ == 13
     RBIMPL_WARNING_IGNORED(-Warray-bounds);
diff --git a/internal/basic_operators.h b/internal/basic_operators.h
index 4732a65403..493d2fa7f7 100644
--- a/internal/basic_operators.h
+++ b/internal/basic_operators.h
@@ -24,6 +24,7 @@ enum ruby_basic_operators {
     BOP_SUCC,
     BOP_GT,
     BOP_GE,
+    BOP_GTGT,
     BOP_NOT,
     BOP_NEQ,
     BOP_MATCH,
@@ -38,6 +39,7 @@ enum ruby_basic_operators {
     BOP_CMP,
     BOP_DEFAULT,
     BOP_PACK,
+    BOP_INCLUDE_P,
 
     BOP_LAST_
 };
diff --git a/internal/bignum.h b/internal/bignum.h
index db8d3aee83..7389a17c74 100644
--- a/internal/bignum.h
+++ b/internal/bignum.h
@@ -9,6 +9,7 @@
  * @brief      Internal header for Bignums.
  */
 #include "ruby/internal/config.h"      /* for HAVE_LIBGMP */
+#include "internal/compilers.h"        /* for FLEX_ARY_LEN */
 #include <stddef.h>             /* for size_t */
 
 #ifdef HAVE_SYS_TYPES_H
@@ -76,26 +77,17 @@
 #define RBIGNUM(obj) ((struct RBignum *)(obj))
 #define BIGNUM_SIGN_BIT FL_USER1
 #define BIGNUM_EMBED_FLAG ((VALUE)FL_USER2)
-#define BIGNUM_EMBED_LEN_NUMBITS 3
+
+/* This is likely more bits than we need today and will also need adjustment if
+ * we change GC slot sizes.
+ */
+#define BIGNUM_EMBED_LEN_NUMBITS 9
 #define BIGNUM_EMBED_LEN_MASK \
-    (~(~(VALUE)0U << BIGNUM_EMBED_LEN_NUMBITS) << BIGNUM_EMBED_LEN_SHIFT)
+    (RUBY_FL_USER11 | RUBY_FL_USER10 | RUBY_FL_USER9 | RUBY_FL_USER8 | RUBY_FL_USER7 | \
+     RUBY_FL_USER6 | RUBY_FL_USER5 | RUBY_FL_USER4 | RUBY_FL_USER3)
 #define BIGNUM_EMBED_LEN_SHIFT \
     (FL_USHIFT+3) /* bit offset of BIGNUM_EMBED_LEN_MASK */
-#ifndef BIGNUM_EMBED_LEN_MAX
-# if (SIZEOF_VALUE*RBIMPL_RVALUE_EMBED_LEN_MAX/SIZEOF_ACTUAL_BDIGIT) < (1 << BIGNUM_EMBED_LEN_NUMBITS)-1
-#  define BIGNUM_EMBED_LEN_MAX (SIZEOF_VALUE*RBIMPL_RVALUE_EMBED_LEN_MAX/SIZEOF_ACTUAL_BDIGIT)
-# else
-#  define BIGNUM_EMBED_LEN_MAX ((1 << BIGNUM_EMBED_LEN_NUMBITS)-1)
-# endif
-#endif
-
-enum rb_int_parse_flags {
-    RB_INT_PARSE_SIGN       = 0x01,
-    RB_INT_PARSE_UNDERSCORE = 0x02,
-    RB_INT_PARSE_PREFIX     = 0x04,
-    RB_INT_PARSE_ALL        = 0x07,
-    RB_INT_PARSE_DEFAULT    = 0x07,
-};
+#define BIGNUM_EMBED_LEN_MAX (BIGNUM_EMBED_LEN_MASK >> BIGNUM_EMBED_LEN_SHIFT)
 
 struct RBignum {
     struct RBasic basic;
@@ -104,12 +96,18 @@ struct RBignum {
             size_t len;
             BDIGIT *digits;
         } heap;
-        BDIGIT ary[BIGNUM_EMBED_LEN_MAX];
+        /* This is a length 1 array because:
+         *   1. GCC has a bug that does not optimize C flexible array members
+         *      (https://gcc.gnu.org/bugzilla/show_bug.cgi?id=102452)
+         *   2. Zero length arrays are not supported by all compilers
+         */
+        BDIGIT ary[1];
     } as;
 };
 
 /* bignum.c */
 extern const char ruby_digitmap[];
+extern const char ruby_decimal_digit_pairs[];
 double rb_big_fdiv_double(VALUE x, VALUE y);
 VALUE rb_big_uminus(VALUE x);
 VALUE rb_big_hash(VALUE);
@@ -121,6 +119,7 @@ VALUE rb_integer_float_eq(VALUE x, VALUE y);
 VALUE rb_str_convert_to_inum(VALUE str, int base, int badcheck, int raise_exception);
 VALUE rb_big_comp(VALUE x);
 VALUE rb_big_aref(VALUE x, VALUE y);
+VALUE rb_big_aref2(VALUE num, VALUE beg, VALUE len);
 VALUE rb_big_abs(VALUE x);
 VALUE rb_big_size_m(VALUE big);
 VALUE rb_big_bit_length(VALUE big);
@@ -160,10 +159,15 @@ VALUE rb_big_divrem_gmp(VALUE x, VALUE y);
 VALUE rb_big2str_gmp(VALUE x, int base);
 VALUE rb_str2big_gmp(VALUE arg, int base, int badcheck);
 #endif
-VALUE rb_int_parse_cstr(const char *str, ssize_t len, char **endp, size_t *ndigits, int base, int flags);
 RUBY_SYMBOL_EXPORT_END
 
+#if HAVE_LONG_LONG
+VALUE rb_ull2big(unsigned LONG_LONG n);
+VALUE rb_ll2big(LONG_LONG n);
+#endif
+
 #if defined(HAVE_INT128_T)
+VALUE rb_uint128t2big(uint128_t n);
 VALUE rb_int128t2big(int128_t n);
 #endif
 
diff --git a/internal/bits.h b/internal/bits.h
index 1fe98fa430..698ab3e219 100644
--- a/internal/bits.h
+++ b/internal/bits.h
@@ -30,13 +30,13 @@
 #include <stdint.h>             /* for uintptr_t */
 #include "internal/compilers.h" /* for MSC_VERSION_SINCE */
 
-#if MSC_VERSION_SINCE(1310)
+#ifdef _MSC_VER
 # include <stdlib.h>            /* for _byteswap_uint64 */
 #endif
 
 #if defined(HAVE_X86INTRIN_H)
 # include <x86intrin.h>         /* for _lzcnt_u64 */
-#elif MSC_VERSION_SINCE(1310)
+#elif defined(_MSC_VER)
 # include <intrin.h>            /* for the following intrinsics */
 #endif
 
@@ -50,16 +50,13 @@
 # pragma intrinsic(__lzcnt64)
 #endif
 
-#if MSC_VERSION_SINCE(1310)
+#if defined(_MSC_VER)
 # pragma intrinsic(_rotl)
 # pragma intrinsic(_rotr)
 # ifdef _WIN64
 #  pragma intrinsic(_rotl64)
 #  pragma intrinsic(_rotr64)
 # endif
-#endif
-
-#if MSC_VERSION_SINCE(1400)
 # pragma intrinsic(_BitScanForward)
 # pragma intrinsic(_BitScanReverse)
 # ifdef _WIN64
@@ -90,6 +87,7 @@
 
 #define UNSIGNED_INTEGER_MAX(T) ((T)~(T)0)
 
+#ifndef MUL_OVERFLOW_SIGNED_INTEGER_P
 #if __has_builtin(__builtin_mul_overflow_p)
 # define MUL_OVERFLOW_P(a, b) \
     __builtin_mul_overflow_p((a), (b), (__typeof__(a * b))0)
@@ -131,6 +129,87 @@
 # define MUL_OVERFLOW_LONG_P(a, b)      MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, LONG_MIN, LONG_MAX)
 # define MUL_OVERFLOW_INT_P(a, b)       MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, INT_MIN, INT_MAX)
 #endif
+#endif
+
+#ifndef ADD_OVERFLOW_SIGNED_INTEGER_P
+#if __has_builtin(__builtin_add_overflow_p)
+# define ADD_OVERFLOW_P(a, b) \
+    __builtin_add_overflow_p((a), (b), (__typeof__(a * b))0)
+#elif __has_builtin(__builtin_add_overflow)
+# define ADD_OVERFLOW_P(a, b) \
+    __extension__ ({ __typeof__(a) c; __builtin_add_overflow((a), (b), &c); })
+#endif
+
+#define ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, min, max) ( \
+    (a) > 0 ? (b) > (max) - (a) : (b) < (min) - (a))
+
+#if __has_builtin(__builtin_add_overflow_p)
+/* __builtin_add_overflow_p can take bitfield */
+/* and GCC permits bitfields for integers other than int */
+# define ADD_OVERFLOW_FIXNUM_P(a, b) \
+    __extension__ ({ \
+        struct { long fixnum : sizeof(long) * CHAR_BIT - 1; } c = { 0 }; \
+        __builtin_add_overflow_p((a), (b), c.fixnum); \
+    })
+#else
+# define ADD_OVERFLOW_FIXNUM_P(a, b) \
+    ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, FIXNUM_MIN, FIXNUM_MAX)
+#endif
+
+#if defined(ADD_OVERFLOW_P) && defined(USE___BUILTIN_ADD_OVERFLOW_LONG_LONG)
+# define ADD_OVERFLOW_LONG_LONG_P(a, b) ADD_OVERFLOW_P(a, b)
+#else
+# define ADD_OVERFLOW_LONG_LONG_P(a, b) ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, LLONG_MIN, LLONG_MAX)
+#endif
+
+#ifdef ADD_OVERFLOW_P
+# define ADD_OVERFLOW_LONG_P(a, b)      ADD_OVERFLOW_P(a, b)
+# define ADD_OVERFLOW_INT_P(a, b)       ADD_OVERFLOW_P(a, b)
+#else
+# define ADD_OVERFLOW_LONG_P(a, b)      ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, LONG_MIN, LONG_MAX)
+# define ADD_OVERFLOW_INT_P(a, b)       ADD_OVERFLOW_SIGNED_INTEGER_P(a, b, INT_MIN, INT_MAX)
+#endif
+#endif
+
+#ifndef SUB_OVERFLOW_SIGNED_INTEGER_P
+#if __has_builtin(__builtin_sub_overflow_p)
+# define SUB_OVERFLOW_P(a, b) \
+    __builtin_sub_overflow_p((a), (b), (__typeof__(a * b))0)
+#elif __has_builtin(__builtin_sub_overflow)
+# define SUB_OVERFLOW_P(a, b) \
+    __extension__ ({ __typeof__(a) c; __builtin_sub_overflow((a), (b), &c); })
+#endif
+
+#define SUB_OVERFLOW_SIGNED_INTEGER_P(a, b, min, max) ( \
+        (b) > 0 ? (a) < (min) + (b) : (a) > (max) + (b))
+
+#if __has_builtin(__builtin_sub_overflow_p)
+/* __builtin_sub_overflow_p can take bitfield */
+/* and GCC permits bitfields for integers other than int */
+# define SUB_OVERFLOW_FIXNUM_P(a, b) \
+    __extension__ ({ \
+        struct { long fixnum : sizeof(long) * CHAR_BIT - 1; } c = { 0 }; \
+        __builtin_sub_overflow_p((a), (b), c.fixnum); \
+    })
+#else
+# define SUB_OVERFLOW_FIXNUM_P(a, b) \
+    SUB_OVERFLOW_SIGNED_INTEGER_P(a, b, FIXNUM_MIN, FIXNUM_MAX)
+#endif
+
+#if defined(SUB_OVERFLOW_P) && defined(USE___BUILTIN_SUB_OVERFLOW_LONG_LONG)
+# define SUB_OVERFLOW_LONG_LONG_P(a, b) SUB_OVERFLOW_P(a, b)
+#else
+# define SUB_OVERFLOW_LONG_LONG_P(a, b) SUB_OVERFLOW_SIGNED_INTEGER_P(a, b, LLONG_MIN, LLONG_MAX)
+#endif
+
+#ifdef SUB_OVERFLOW_P
+# define SUB_OVERFLOW_LONG_P(a, b)      SUB_OVERFLOW_P(a, b)
+# define SUB_OVERFLOW_INT_P(a, b)       SUB_OVERFLOW_P(a, b)
+#else
+# define SUB_OVERFLOW_LONG_P(a, b)      SUB_OVERFLOW_SIGNED_INTEGER_P(a, b, LONG_MIN, LONG_MAX)
+# define SUB_OVERFLOW_INT_P(a, b)       SUB_OVERFLOW_SIGNED_INTEGER_P(a, b, INT_MIN, INT_MAX)
+#endif
+#endif
 
 #ifdef HAVE_UINT128_T
 # define bit_length(x) \
@@ -184,7 +263,7 @@ ruby_swap16(uint16_t x)
 #if __has_builtin(__builtin_bswap16)
     return __builtin_bswap16(x);
 
-#elif MSC_VERSION_SINCE(1310)
+#elif defined(_MSC_VER)
     return _byteswap_ushort(x);
 
 #else
@@ -199,7 +278,7 @@ ruby_swap32(uint32_t x)
 #if __has_builtin(__builtin_bswap32)
     return __builtin_bswap32(x);
 
-#elif MSC_VERSION_SINCE(1310)
+#elif defined(_MSC_VER)
     return _byteswap_ulong(x);
 
 #else
@@ -216,7 +295,7 @@ ruby_swap64(uint64_t x)
 #if __has_builtin(__builtin_bswap64)
     return __builtin_bswap64(x);
 
-#elif MSC_VERSION_SINCE(1310)
+#elif defined(_MSC_VER)
     return _byteswap_uint64(x);
 
 #else
@@ -241,7 +320,7 @@ nlz_int32(uint32_t x)
 #elif defined(__x86_64__) && defined(__LZCNT__)
     return (unsigned int)_lzcnt_u32(x);
 
-#elif MSC_VERSION_SINCE(1400) /* &&! defined(__AVX2__) */
+#elif defined(_MSC_VER) /* &&! defined(__AVX2__) */
     unsigned long r;
     return _BitScanReverse(&r, x) ? (31 - (int)r) : 32;
 
@@ -270,7 +349,7 @@ nlz_int64(uint64_t x)
 #elif defined(__x86_64__) && defined(__LZCNT__)
     return (unsigned int)_lzcnt_u64(x);
 
-#elif defined(_WIN64) && MSC_VERSION_SINCE(1400) /* &&! defined(__AVX2__) */
+#elif defined(_WIN64) && defined(_MSC_VER) /* &&! defined(__AVX2__) */
     unsigned long r;
     return _BitScanReverse64(&r, x) ? (63u - (unsigned int)r) : 64;
 
@@ -456,7 +535,7 @@ ntz_int32(uint32_t x)
 #if defined(__x86_64__) && defined(__BMI__)
     return (unsigned)_tzcnt_u32(x);
 
-#elif MSC_VERSION_SINCE(1400)
+#elif defined(_MSC_VER)
     /* :FIXME: Is there any way to issue TZCNT instead of BSF, apart from using
      *         assembly?  Because issuing LZCNT seems possible (see nlz.h). */
     unsigned long r;
@@ -478,7 +557,7 @@ ntz_int64(uint64_t x)
 #if defined(__x86_64__) && defined(__BMI__)
     return (unsigned)_tzcnt_u64(x);
 
-#elif defined(_WIN64) && MSC_VERSION_SINCE(1400)
+#elif defined(_WIN64) && defined(_MSC_VER)
     unsigned long r;
     return _BitScanForward64(&r, x) ? (int)r : 64;
 
@@ -526,10 +605,10 @@ RUBY_BIT_ROTL(VALUE v, int n)
 #elif __has_builtin(__builtin_rotateleft64) && (SIZEOF_VALUE * CHAR_BIT == 64)
     return __builtin_rotateleft64(v, n);
 
-#elif MSC_VERSION_SINCE(1310) && (SIZEOF_VALUE * CHAR_BIT == 32)
+#elif defined(_MSC_VER) && (SIZEOF_VALUE * CHAR_BIT == 32)
     return _rotl(v, n);
 
-#elif MSC_VERSION_SINCE(1310) && (SIZEOF_VALUE * CHAR_BIT == 64)
+#elif defined(_MSC_VER) && (SIZEOF_VALUE * CHAR_BIT == 64)
     return _rotl64(v, n);
 
 #elif defined(_lrotl) && (SIZEOF_VALUE == SIZEOF_LONG)
@@ -550,10 +629,10 @@ RUBY_BIT_ROTR(VALUE v, int n)
 #elif __has_builtin(__builtin_rotateright64) && (SIZEOF_VALUE * CHAR_BIT == 64)
     return __builtin_rotateright64(v, n);
 
-#elif MSC_VERSION_SINCE(1310) && (SIZEOF_VALUE * CHAR_BIT == 32)
+#elif defined(_MSC_VER) && (SIZEOF_VALUE * CHAR_BIT == 32)
     return _rotr(v, n);
 
-#elif MSC_VERSION_SINCE(1310) && (SIZEOF_VALUE * CHAR_BIT == 64)
+#elif defined(_MSC_VER) && (SIZEOF_VALUE * CHAR_BIT == 64)
     return _rotr64(v, n);
 
 #elif defined(_lrotr) && (SIZEOF_VALUE == SIZEOF_LONG)
diff --git a/internal/box.h b/internal/box.h
new file mode 100644
index 0000000000..c717dc4e24
--- /dev/null
+++ b/internal/box.h
@@ -0,0 +1,96 @@
+#ifndef INTERNAL_BOX_H                                  /*-*-C-*-vi:se ft=c:*/
+#define INTERNAL_BOX_H
+
+#include "ruby/ruby.h"          /* for VALUE */
+
+/**
+ * @author     Ruby developers <ruby-core@ruby-lang.org>
+ * @copyright  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.
+ * @brief      Internal header for Ruby Box.
+ */
+struct rb_box_struct {
+    /*
+     * To retrieve Ruby::Box object that provides #require and so on.
+     * That is used from load.c, etc., that uses rb_box_t internally.
+     */
+    VALUE box_object;
+    long box_id; // box_id to generate ext filenames
+
+    VALUE top_self;
+
+    VALUE load_path;
+    VALUE load_path_snapshot;
+    VALUE load_path_check_cache;
+    VALUE expanded_load_path;
+    VALUE loaded_features;
+    VALUE loaded_features_snapshot;
+    VALUE loaded_features_realpaths;
+    VALUE loaded_features_realpath_map;
+    struct st_table *loaded_features_index;
+    struct st_table *loading_table;
+    VALUE ruby_dln_libmap;
+
+    VALUE gvar_tbl;
+    struct st_table *classext_cow_classes;
+
+    bool is_root;
+    bool is_user;
+    bool is_optional;
+};
+typedef struct rb_box_struct rb_box_t;
+
+struct rb_box_gem_flags {
+    bool gem;
+    bool error_highlight;
+    bool did_you_mean;
+    bool syntax_suggest;
+};
+typedef struct rb_box_gem_flags rb_box_gem_flags_t;
+
+#define BOX_OBJ_P(obj) (rb_obj_class(obj) == rb_cBox)
+
+#define BOX_MASTER_P(box) (box && !box->is_root && !box->is_user)
+#define BOX_MUTABLE_P(box) (box && (box->is_root || box->is_user))
+#define BOX_ROOT_P(box) (box && box->is_root)
+#define BOX_USER_P(box) (box && box->is_user)
+#define BOX_OPTIONAL_P(box) (box && box->is_optional)
+#define BOX_MAIN_P(box) (box && box->is_user && !box->is_optional)
+
+#define BOX_METHOD_DEFINITION(mdef) (mdef ? mdef->ns : NULL)
+#define BOX_METHOD_ENTRY(me) (me ? BOX_METHOD_DEFINITION(me->def) : NULL)
+#define BOX_CC(cc) (cc ? BOX_METHOD_ENTRY(cc->cme_) : NULL)
+#define BOX_CC_ENTRIES(ccs) (ccs ? BOX_METHOD_ENTRY(ccs->cme) : NULL)
+
+RUBY_EXTERN bool ruby_box_enabled;
+RUBY_EXTERN bool ruby_box_init_done;
+RUBY_EXTERN bool ruby_box_crashed;
+
+static inline bool
+rb_box_available(void)
+{
+    return ruby_box_enabled;
+}
+
+const rb_box_t * rb_master_box(void);
+const rb_box_t * rb_root_box(void);
+const rb_box_t * rb_main_box(void);
+const rb_box_t * rb_current_box(void);
+const rb_box_t * rb_loading_box(void);
+const rb_box_t * rb_current_box_in_crash_report(void);
+
+void rb_box_entry_mark(void *);
+void rb_box_gc_update_references(void *ptr);
+
+rb_box_t * rb_get_box_t(VALUE ns);
+VALUE rb_get_box_object(rb_box_t *ns);
+
+VALUE rb_box_local_extension(VALUE box, VALUE fname, VALUE path, VALUE *cleanup);
+void rb_box_cleanup_local_extension(VALUE cleanup);
+
+void rb_initialize_mandatory_boxes(void);
+void rb_box_init_done(void);
+void rb_box_set_gem_flags(rb_box_gem_flags_t *);
+#endif /* INTERNAL_BOX_H */
diff --git a/internal/class.h b/internal/class.h
index 8a6c956233..0773dbad95 100644
--- a/internal/class.h
+++ b/internal/class.h
@@ -10,6 +10,7 @@
  */
 #include "id.h"
 #include "id_table.h"           /* for struct rb_id_table */
+#include "internal/box.h"
 #include "internal/serial.h"    /* for rb_serial_t */
 #include "internal/static_assert.h"
 #include "internal/variable.h"  /* for rb_class_ivar_set */
@@ -26,36 +27,31 @@
 # undef RCLASS_SUPER
 #endif
 
-struct rb_subclass_entry {
-    VALUE klass;
-    struct rb_subclass_entry *next;
-    struct rb_subclass_entry *prev;
-};
-typedef struct rb_subclass_entry rb_subclass_entry_t;
-
 struct rb_cvar_class_tbl_entry {
+    VALUE imemo_flags;
     uint32_t index;
     rb_serial_t global_cvar_state;
-    const rb_cref_t * cref;
+    const rb_cref_t *cref;
     VALUE class_value;
 };
 
 struct rb_classext_struct {
-    VALUE *iv_ptr;
+    const rb_box_t *box;
+    VALUE super;
+    VALUE fields_obj; // Fields are either ivar or other internal properties stored inline
+    VALUE classpath;
+    struct rb_id_table *m_tbl;
     struct rb_id_table *const_tbl;
     struct rb_id_table *callable_m_tbl;
-    struct rb_id_table *cc_tbl; /* ID -> [[ci1, cc1], [ci2, cc2] ...] */
-    struct rb_id_table *cvc_tbl;
-    size_t superclass_depth;
+    VALUE cc_tbl; /* { ID => { cme, [cc1, cc2, ...] }, ... } */
+    VALUE cvc_tbl;
     VALUE *superclasses;
-    struct rb_subclass_entry *subclasses;
-    struct rb_subclass_entry *subclass_entry;
     /**
-     * In the case that this is an `ICLASS`, `module_subclasses` points to the link
-     * in the module's `subclasses` list that indicates that the klass has been
-     * included. Hopefully that makes sense.
+     * imemo_subclasses VALUE tracking this class's subclasses.
+     * Only used in prime classext. Lazily allocated on first subclass addition.
      */
-    struct rb_subclass_entry *module_subclass_entry;
+    VALUE subclasses;
+
     const VALUE origin_;
     const VALUE refined_class;
     union {
@@ -65,13 +61,19 @@ struct rb_classext_struct {
         struct {
             VALUE attached_object;
         } singleton_class;
+        struct {
+            const VALUE includer;
+        } iclass;
     } as;
-    const VALUE includer;
+    uint16_t superclass_depth;
     attr_index_t max_iv_count;
-    unsigned char variation_count;
+    uint8_t variation_count;
     bool permanent_classpath : 1;
-    bool cloned : 1;
-    VALUE classpath;
+    bool shared_const_tbl : 1;
+    bool iclass_is_origin : 1;
+    bool iclass_origin_shared_mtbl : 1;
+    bool superclasses_with_self : 1;
+    bool expect_no_ivar : 1;
 };
 typedef struct rb_classext_struct rb_classext_t;
 
@@ -79,103 +81,365 @@ STATIC_ASSERT(shape_max_variations, SHAPE_MAX_VARIATIONS < (1 << (sizeof(((rb_cl
 
 struct RClass {
     struct RBasic basic;
-    VALUE super;
-    struct rb_id_table *m_tbl;
+    VALUE object_id;
+    /*
+     * If box_classext_tbl is NULL, then the prime classext is readable (because no other classext exists).
+     * For the check whether writable or not, check flag RCLASS_PRIME_CLASSEXT_WRITABLE
+     */
 };
 
-// Assert that classes can be embedded in size_pools[2] (which has 160B slot size)
-STATIC_ASSERT(sizeof_rb_classext_t, sizeof(struct RClass) + sizeof(rb_classext_t) <= 4 * RVALUE_SIZE);
-
 struct RClass_and_rb_classext_t {
     struct RClass rclass;
     rb_classext_t classext;
 };
 
-#define RCLASS_EXT(c) (&((struct RClass_and_rb_classext_t*)(c))->classext)
-#define RCLASS_CONST_TBL(c) (RCLASS_EXT(c)->const_tbl)
-#define RCLASS_M_TBL(c) (RCLASS(c)->m_tbl)
-#define RCLASS_IVPTR(c) (RCLASS_EXT(c)->iv_ptr)
-#define RCLASS_CALLABLE_M_TBL(c) (RCLASS_EXT(c)->callable_m_tbl)
-#define RCLASS_CC_TBL(c) (RCLASS_EXT(c)->cc_tbl)
-#define RCLASS_CVC_TBL(c) (RCLASS_EXT(c)->cvc_tbl)
-#define RCLASS_ORIGIN(c) (RCLASS_EXT(c)->origin_)
-#define RCLASS_REFINED_CLASS(c) (RCLASS_EXT(c)->refined_class)
-#define RCLASS_INCLUDER(c) (RCLASS_EXT(c)->includer)
-#define RCLASS_SUBCLASS_ENTRY(c) (RCLASS_EXT(c)->subclass_entry)
-#define RCLASS_MODULE_SUBCLASS_ENTRY(c) (RCLASS_EXT(c)->module_subclass_entry)
-#define RCLASS_SUBCLASSES(c) (RCLASS_EXT(c)->subclasses)
-#define RCLASS_SUPERCLASS_DEPTH(c) (RCLASS_EXT(c)->superclass_depth)
-#define RCLASS_SUPERCLASSES(c) (RCLASS_EXT(c)->superclasses)
-#define RCLASS_ATTACHED_OBJECT(c) (RCLASS_EXT(c)->as.singleton_class.attached_object)
+#if SIZEOF_VALUE >= SIZEOF_LONG_LONG
+// Assert that classes can be embedded in heaps[3] (256B slot size on 64-bit).
+// On 32bit platforms there is no variable width allocation so it doesn't matter.
+STATIC_ASSERT(sizeof_rb_classext_t, sizeof(struct RClass_and_rb_classext_t) <= 256);
+#endif
+
+struct RClass_boxable {
+    struct RClass_and_rb_classext_t base;
+    st_table *box_classext_tbl; // box_object -> (rb_classext_t *)
+};
+
+static const uint16_t RCLASS_MAX_SUPERCLASS_DEPTH = ((uint16_t)-1);
+
+static inline bool RCLASS_SINGLETON_P(VALUE klass);
+
+static inline bool RCLASS_PRIME_CLASSEXT_READABLE_P(VALUE obj);
+static inline bool RCLASS_PRIME_CLASSEXT_WRITABLE_P(VALUE obj);
+static inline void RCLASS_SET_PRIME_CLASSEXT_WRITABLE(VALUE obj, bool writable);
+
+#define RCLASS_EXT_PRIME(c) (&((struct RClass_and_rb_classext_t*)(c))->classext)
+#define RCLASS_EXT_PRIME_P(ext, c) (&((struct RClass_and_rb_classext_t*)(c))->classext == ext)
+
+static inline rb_classext_t * RCLASS_EXT_READABLE_IN_BOX(VALUE obj, const rb_box_t *box);
+static inline rb_classext_t * RCLASS_EXT_READABLE(VALUE obj);
+static inline rb_classext_t * RCLASS_EXT_WRITABLE_IN_BOX(VALUE obj, const rb_box_t *box);
+static inline rb_classext_t * RCLASS_EXT_WRITABLE(VALUE obj);
+
+// Raw accessor
+#define RCLASSEXT_BOX(ext) (ext->box)
+#define RCLASSEXT_SUPER(ext) (ext->super)
+#define RCLASSEXT_FIELDS(ext) (ext->fields_obj ? ROBJECT_FIELDS(ext->fields_obj) : NULL)
+#define RCLASSEXT_FIELDS_OBJ(ext) (ext->fields_obj)
+#define RCLASSEXT_M_TBL(ext) (ext->m_tbl)
+#define RCLASSEXT_CONST_TBL(ext) (ext->const_tbl)
+#define RCLASSEXT_CALLABLE_M_TBL(ext) (ext->callable_m_tbl)
+#define RCLASSEXT_CC_TBL(ext) (ext->cc_tbl)
+#define RCLASSEXT_CVC_TBL(ext) (ext->cvc_tbl)
+#define RCLASSEXT_SUPERCLASS_DEPTH(ext) (ext->superclass_depth)
+#define RCLASSEXT_SUPERCLASSES(ext) (ext->superclasses)
+#define RCLASSEXT_SUBCLASSES(ext) (ext->subclasses)
+#define RCLASSEXT_ORIGIN(ext) (ext->origin_)
+#define RCLASSEXT_REFINED_CLASS(ext) (ext->refined_class)
+// class.allocator/singleton_class.attached_object are not accessed directly via RCLASSEXT_*
+#define RCLASSEXT_INCLUDER(ext) (ext->as.iclass.includer)
+#define RCLASSEXT_PERMANENT_CLASSPATH(ext) (ext->permanent_classpath)
+#define RCLASSEXT_SHARED_CONST_TBL(ext) (ext->shared_const_tbl)
+#define RCLASSEXT_ICLASS_IS_ORIGIN(ext) (ext->iclass_is_origin)
+#define RCLASSEXT_ICLASS_ORIGIN_SHARED_MTBL(ext) (ext->iclass_origin_shared_mtbl)
+#define RCLASSEXT_SUPERCLASSES_WITH_SELF(ext) (ext->superclasses_with_self)
+#define RCLASSEXT_CLASSPATH(ext) (ext->classpath)
+
+static inline void RCLASSEXT_SET_ORIGIN(rb_classext_t *ext, VALUE klass, VALUE origin);
+static inline void RCLASSEXT_SET_INCLUDER(rb_classext_t *ext, VALUE klass, VALUE includer);
+
+/* Prime classext entry accessor for very specific reason */
+#define RCLASS_PRIME_BOX(c) (RCLASS_EXT_PRIME(c)->box)
+// To invalidate CC by inserting&invalidating method entry into tables containing the target cme
+// See clear_method_cache_by_id_in_class()
+#define RCLASS_PRIME_FIELDS_OBJ(c) (RCLASS_EXT_PRIME(c)->fields_obj)
+#define RCLASS_PRIME_M_TBL(c) (RCLASS_EXT_PRIME(c)->m_tbl)
+#define RCLASS_PRIME_CONST_TBL(c) (RCLASS_EXT_PRIME(c)->const_tbl)
+#define RCLASS_PRIME_CALLABLE_M_TBL(c) (RCLASS_EXT_PRIME(c)->callable_m_tbl)
+#define RCLASS_PRIME_CC_TBL(c) (RCLASS_EXT_PRIME(c)->cc_tbl)
+#define RCLASS_M_TBL_NOT_PRIME_P(c, tbl) (RCLASS_EXT_PRIME(c)->m_tbl != tbl)
+#define RCLASS_CALLABLE_M_TBL_NOT_PRIME_P(c, tbl) (RCLASS_EXT_PRIME(c)->callable_m_tbl != tbl)
+#define RCLASS_CC_TBL_NOT_PRIME_P(c, tbl) (RCLASS_EXT_PRIME(c)->cc_tbl != tbl)
+
+// Read accessor, regarding box
+#define RCLASS_SUPER(c) (RCLASS_EXT_READABLE(c)->super)
+#define RCLASS_M_TBL(c) (RCLASS_EXT_READABLE(c)->m_tbl)
+#define RCLASS_CONST_TBL(c) (RCLASS_EXT_READABLE(c)->const_tbl)
+/*
+ * Both cc_tbl/callable_m_tbl are cache-like and always be changed when referreed,
+ * so always those should be writable.
+ */
+#define RCLASS_CVC_TBL(c) (RCLASS_EXT_READABLE(c)->cvc_tbl)
+#define RCLASS_SUBCLASSES(c) (RCLASS_EXT_PRIME(c)->subclasses)
+#define RCLASS_ORIGIN(c) (RCLASS_EXT_READABLE(c)->origin_)
+#define RICLASS_IS_ORIGIN_P(c) (RCLASS_EXT_READABLE(c)->iclass_is_origin)
+#define RCLASS_PERMANENT_CLASSPATH_P(c) (RCLASS_EXT_READABLE(c)->permanent_classpath)
+#define RCLASS_CLASSPATH(c) (RCLASS_EXT_READABLE(c)->classpath)
+
+// Superclasses can't be changed after initialization
+#define RCLASS_SUPERCLASS_DEPTH(c) (RCLASS_EXT_PRIME(c)->superclass_depth)
+#define RCLASS_SUPERCLASSES(c) (RCLASS_EXT_PRIME(c)->superclasses)
+#define RCLASS_SUPERCLASSES_WITH_SELF_P(c) (RCLASS_EXT_PRIME(c)->superclasses_with_self)
+
+// Ruby Box doesn't make changes on these refined_class/attached_object/includer
+#define RCLASS_REFINED_CLASS(c) (RCLASS_EXT_PRIME(c)->refined_class)
+#define RCLASS_ATTACHED_OBJECT(c) (RCLASS_EXT_PRIME(c)->as.singleton_class.attached_object)
+#define RCLASS_INCLUDER(c) (RCLASS_EXT_PRIME(c)->as.iclass.includer)
+
+// max IV count and variation count are just hints, so they don't need to be per-box
+#define RCLASS_MAX_IV_COUNT(ext) (RCLASS_EXT_PRIME(ext)->max_iv_count)
+#define RCLASS_VARIATION_COUNT(ext) (RCLASS_EXT_PRIME(ext)->variation_count)
+
+// Writable classext entries (instead of RCLASS_SET_*) because member data will be operated directly
+#define RCLASS_WRITABLE_M_TBL(c) (RCLASS_EXT_WRITABLE(c)->m_tbl)
+#define RCLASS_WRITABLE_CONST_TBL(c) (RCLASS_EXT_WRITABLE(c)->const_tbl)
+#define RCLASS_WRITABLE_CALLABLE_M_TBL(c) (RCLASS_EXT_WRITABLE(c)->callable_m_tbl)
+#define RCLASS_WRITABLE_CC_TBL(c) (RCLASS_EXT_WRITABLE(c)->cc_tbl)
+#define RCLASS_WRITABLE_CVC_TBL(c) (RCLASS_EXT_WRITABLE(c)->cvc_tbl)
+// Subclasses are only in the prime classext (box-invariant)
+#define RCLASS_WRITABLE_SUBCLASSES(c) (RCLASS_EXT_PRIME(c)->subclasses)
+
+static inline void RCLASS_SET_SUPER(VALUE klass, VALUE super);
+static inline void RCLASS_WRITE_SUPER(VALUE klass, VALUE super);
+static inline void RCLASS_SET_CONST_TBL(VALUE klass, struct rb_id_table *table, bool shared);
+static inline void RCLASS_WRITE_CONST_TBL(VALUE klass, struct rb_id_table *table, bool shared);
+static inline void RCLASS_WRITE_CALLABLE_M_TBL(VALUE klass, struct rb_id_table *table);
+static inline void RCLASS_WRITE_CC_TBL(VALUE klass, VALUE table);
+static inline void RCLASS_SET_CVC_TBL(VALUE klass, VALUE table);
+static inline void RCLASS_WRITE_CVC_TBL(VALUE klass, VALUE table);
+
+static inline void RCLASS_WRITE_SUPERCLASSES(VALUE klass, size_t depth, VALUE *superclasses, bool with_self);
+static inline void RCLASS_SET_SUBCLASSES(VALUE klass, VALUE subclasses);
+
+static inline void RCLASS_SET_ORIGIN(VALUE klass, VALUE origin);
+static inline void RCLASS_WRITE_ORIGIN(VALUE klass, VALUE origin);
+static inline void RICLASS_SET_ORIGIN_SHARED_MTBL(VALUE iclass);
+static inline void RICLASS_WRITE_ORIGIN_SHARED_MTBL(VALUE iclass);
+static inline bool RICLASS_OWNS_M_TBL_P(VALUE iclass);
+
+static inline void RCLASS_SET_REFINED_CLASS(VALUE klass, VALUE refined);
+static inline rb_alloc_func_t RCLASS_ALLOCATOR(VALUE klass);
+static inline void RCLASS_SET_ALLOCATOR(VALUE klass, rb_alloc_func_t allocator);
+static inline VALUE RCLASS_SET_ATTACHED_OBJECT(VALUE klass, VALUE attached_object);
+
+static inline void RCLASS_SET_INCLUDER(VALUE iclass, VALUE klass);
+static inline void RCLASS_SET_MAX_IV_COUNT(VALUE klass, attr_index_t count);
+static inline void RCLASS_SET_CLASSPATH(VALUE klass, VALUE classpath, bool permanent);
+static inline void RCLASS_WRITE_CLASSPATH(VALUE klass, VALUE classpath, bool permanent);
 
 #define RCLASS_IS_ROOT FL_USER0
-#define RICLASS_IS_ORIGIN FL_USER0
-#define RCLASS_SUPERCLASSES_INCLUDE_SELF FL_USER2
-#define RICLASS_ORIGIN_SHARED_MTBL FL_USER3
+// 1 is for RUBY_FL_SINGLETON or RMODULE_IS_REFINEMENT
+#define RCLASS_PRIME_CLASSEXT_WRITABLE FL_USER2
+#define RCLASS_IS_INITIALIZED FL_USER3
+// 3 is RMODULE_IS_REFINEMENT for RMODULE
+#define RCLASS_BOXABLE FL_USER4
+#define RCLASS_ALLOCATOR_DEFINED FL_USER5
+#define RCLASS_HAS_SUBCLASSES FL_USER6
 
 static inline st_table *
-RCLASS_IV_HASH(VALUE obj)
+RCLASS_CLASSEXT_TBL(VALUE klass)
 {
-    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
-    RUBY_ASSERT(rb_shape_obj_too_complex(obj));
-    return (st_table *)RCLASS_IVPTR(obj);
+    if (FL_TEST_RAW(klass, RCLASS_BOXABLE)) {
+        struct RClass_boxable *box_klass = (struct RClass_boxable *)klass;
+        return box_klass->box_classext_tbl;
+    }
+    return NULL;
 }
 
 static inline void
-RCLASS_SET_IV_HASH(VALUE obj, const st_table *tbl)
+RCLASS_SET_CLASSEXT_TBL(VALUE klass, st_table *tbl)
 {
-    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
-    RUBY_ASSERT(rb_shape_obj_too_complex(obj));
-    RCLASS_IVPTR(obj) = (VALUE *)tbl;
+    RUBY_ASSERT(FL_TEST_RAW(klass, RCLASS_BOXABLE));
+    struct RClass_boxable *box_klass = (struct RClass_boxable *)klass;
+    box_klass->box_classext_tbl = tbl;
 }
 
-static inline uint32_t
-RCLASS_IV_COUNT(VALUE obj)
+/* class.c */
+rb_classext_t * rb_class_duplicate_classext(rb_classext_t *orig, VALUE obj, const rb_box_t *box);
+void rb_class_ensure_writable(VALUE obj);
+
+void rb_class_set_box_classext(VALUE obj, const rb_box_t *box, rb_classext_t *ext);
+
+static inline int
+RCLASS_SET_BOX_CLASSEXT(VALUE obj, const rb_box_t *box, rb_classext_t *ext)
 {
-    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
-    if (rb_shape_obj_too_complex(obj)) {
-        uint32_t count;
-
-        // "Too complex" classes could have their IV hash mutated in
-        // parallel, so lets lock around getting the hash size.
-        RB_VM_LOCK_ENTER();
-        {
-            count = (uint32_t)rb_st_table_size(RCLASS_IV_HASH(obj));
-        }
-        RB_VM_LOCK_LEAVE();
+    int first_set = 0;
+    st_table *tbl = RCLASS_CLASSEXT_TBL(obj);
+    VM_ASSERT(BOX_MUTABLE_P(box)); // Setting non-prime classext never happens on the master box
+    VM_ASSERT(box->box_object);
+    VM_ASSERT(RCLASSEXT_BOX(ext) == box);
+    if (!tbl) {
+        tbl = st_init_numtable_with_size(1);
+        RCLASS_SET_CLASSEXT_TBL(obj, tbl);
+    }
+    if (rb_st_table_size(tbl) == 0) {
+        first_set = 1;
+    }
+
+    rb_class_set_box_classext(obj, box, ext);
+
+    return first_set;
+}
+
+#define VM_ASSERT_BOXABLE_TYPE(klass) \
+    VM_ASSERT(RB_TYPE_P(klass, T_CLASS) || RB_TYPE_P(klass, T_MODULE) || RB_TYPE_P(klass, T_ICLASS), "%s is not boxable type", rb_type_str(BUILTIN_TYPE(klass)))
+
+static inline bool
+RCLASS_PRIME_CLASSEXT_READABLE_P(VALUE klass)
+{
+    VM_ASSERT(klass != 0, "klass should be a valid object");
+    VM_ASSERT_BOXABLE_TYPE(klass);
+    // if the lookup table exists, then it means the prime classext is NOT directly readable.
+    return !FL_TEST_RAW(klass, RCLASS_BOXABLE) || RCLASS_CLASSEXT_TBL(klass) == NULL;
+}
 
-        return count;
+static inline bool
+RCLASS_PRIME_CLASSEXT_WRITABLE_P(VALUE klass)
+{
+    VM_ASSERT(klass != 0, "klass should be a valid object");
+    VM_ASSERT_BOXABLE_TYPE(klass);
+    RBIMPL_ASSUME(klass != 0);
+    return FL_TEST_RAW(klass, RCLASS_PRIME_CLASSEXT_WRITABLE);
+}
+
+static inline void
+RCLASS_SET_PRIME_CLASSEXT_WRITABLE(VALUE klass, bool writable)
+{
+    VM_ASSERT(klass != 0, "klass should be a valid object");
+    VM_ASSERT_BOXABLE_TYPE(klass);
+    if (writable) {
+        FL_SET_RAW(klass, RCLASS_PRIME_CLASSEXT_WRITABLE);
     }
     else {
-        return rb_shape_get_shape_by_id(RCLASS_SHAPE_ID(obj))->next_iv_index;
+        FL_UNSET_RAW(klass, RCLASS_PRIME_CLASSEXT_WRITABLE);
     }
 }
 
+static inline rb_classext_t *
+RCLASS_EXT_TABLE_LOOKUP_INTERNAL(VALUE obj, const rb_box_t *box)
+{
+    st_data_t classext_ptr;
+    st_table *classext_tbl = RCLASS_CLASSEXT_TBL(obj);
+    if (classext_tbl) {
+        if (rb_st_lookup(classext_tbl, (st_data_t)box->box_object, &classext_ptr)) {
+            return (rb_classext_t *)classext_ptr;
+        }
+    }
+    return NULL;
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_READABLE_LOOKUP(VALUE obj, const rb_box_t *box)
+{
+    rb_classext_t *ext = RCLASS_EXT_TABLE_LOOKUP_INTERNAL(obj, box);
+    if (ext)
+        return ext;
+    // Classext for the ns not found. Refer the prime one instead.
+    return RCLASS_EXT_PRIME(obj);
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_READABLE_IN_BOX(VALUE obj, const rb_box_t *box)
+{
+    if (BOX_MASTER_P(box)
+        || RCLASS_PRIME_CLASSEXT_READABLE_P(obj)) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    return RCLASS_EXT_READABLE_LOOKUP(obj, box);
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_READABLE(VALUE obj)
+{
+    const rb_box_t *box;
+    if (RCLASS_PRIME_CLASSEXT_READABLE_P(obj)) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    // delay determining the current box to optimize for unmodified classes
+    box = rb_current_box();
+    if (BOX_MASTER_P(box)) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    return RCLASS_EXT_READABLE_LOOKUP(obj, box);
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_WRITABLE_LOOKUP(VALUE obj, const rb_box_t *box)
+{
+    rb_classext_t *ext;
+    int first_set = 0;
+
+    ext = RCLASS_EXT_TABLE_LOOKUP_INTERNAL(obj, box);
+    if (ext)
+        return ext;
+
+    RB_VM_LOCKING() {
+        // re-check the classext is not created to avoid the multi-thread race
+        ext = RCLASS_EXT_TABLE_LOOKUP_INTERNAL(obj, box);
+        if (!ext) {
+            ext = rb_class_duplicate_classext(RCLASS_EXT_PRIME(obj), obj, box);
+            first_set = RCLASS_SET_BOX_CLASSEXT(obj, box, ext);
+            if (first_set) {
+                // TODO: are there any case that a class/module become non-writable after its birthtime?
+                RCLASS_SET_PRIME_CLASSEXT_WRITABLE(obj, false);
+            }
+        }
+    }
+    return ext;
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_WRITABLE_IN_BOX(VALUE obj, const rb_box_t *box)
+{
+    if (BOX_MASTER_P(box)
+        || RCLASS_PRIME_CLASSEXT_WRITABLE_P(obj)) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    return RCLASS_EXT_WRITABLE_LOOKUP(obj, box);
+}
+
+static inline rb_classext_t *
+RCLASS_EXT_WRITABLE(VALUE obj)
+{
+    const rb_box_t *box;
+    if (LIKELY(RCLASS_PRIME_CLASSEXT_WRITABLE_P(obj))) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    // delay determining the current box to optimize for unmodified classes
+    box = rb_current_box();
+    if (BOX_MASTER_P(box)) {
+        return RCLASS_EXT_PRIME(obj);
+    }
+    return RCLASS_EXT_WRITABLE_LOOKUP(obj, box);
+}
+
 static inline void
-RCLASS_SET_M_TBL(VALUE klass, struct rb_id_table *table)
+RCLASSEXT_SET_ORIGIN(rb_classext_t *ext, VALUE klass, VALUE origin)
+{
+    RB_OBJ_WRITE(klass, &(RCLASSEXT_ORIGIN(ext)), origin);
+}
+
+static inline void
+RCLASSEXT_SET_INCLUDER(rb_classext_t *ext, VALUE klass, VALUE includer)
 {
-    RUBY_ASSERT(!RB_OBJ_PROMOTED(klass));
-    RCLASS_M_TBL(klass) = table;
+    RUBY_ASSERT(RB_TYPE_P(klass, T_ICLASS));
+    RB_OBJ_WRITE(klass, &(RCLASSEXT_INCLUDER(ext)), includer);
 }
 
 /* class.c */
+typedef void rb_class_classext_foreach_callback_func(rb_classext_t *classext, bool is_prime, VALUE box_value, void *arg);
+void rb_class_classext_foreach(VALUE klass, rb_class_classext_foreach_callback_func *func, void *arg);
 void rb_class_subclass_add(VALUE super, VALUE klass);
-void rb_class_remove_from_super_subclasses(VALUE);
+void rb_class_foreach_subclass(VALUE klass, void (*f)(VALUE, VALUE), VALUE);
 void rb_class_update_superclasses(VALUE);
-size_t rb_class_superclasses_memsize(VALUE);
-void rb_class_remove_subclass_head(VALUE);
 int rb_singleton_class_internal_p(VALUE sklass);
+VALUE rb_class_set_super(VALUE klass, VALUE super);
 VALUE rb_class_boot(VALUE);
 VALUE rb_class_s_alloc(VALUE klass);
 VALUE rb_module_s_alloc(VALUE klass);
-void rb_module_set_initialized(VALUE module);
+void rb_class_set_initialized(VALUE klass);
 void rb_module_check_initializable(VALUE module);
 VALUE rb_make_metaclass(VALUE, VALUE);
 VALUE rb_include_class_new(VALUE, VALUE);
-void rb_class_foreach_subclass(VALUE klass, void (*f)(VALUE, VALUE), VALUE);
-void rb_class_detach_subclasses(VALUE);
-void rb_class_detach_module_subclasses(VALUE);
-void rb_class_remove_from_module_subclasses(VALUE);
 VALUE rb_define_class_id_under_no_pin(VALUE outer, ID id, VALUE super);
 VALUE rb_obj_methods(int argc, const VALUE *argv, VALUE obj);
 VALUE rb_obj_protected_methods(int argc, const VALUE *argv, VALUE obj);
@@ -186,89 +450,258 @@ VALUE rb_special_singleton_class(VALUE);
 VALUE rb_singleton_class_clone_and_attach(VALUE obj, VALUE attach);
 VALUE rb_singleton_class_get(VALUE obj);
 void rb_undef_methods_from(VALUE klass, VALUE super);
-
-static inline void RCLASS_SET_ORIGIN(VALUE klass, VALUE origin);
-static inline void RICLASS_SET_ORIGIN_SHARED_MTBL(VALUE iclass);
-static inline VALUE RCLASS_SUPER(VALUE klass);
-static inline VALUE RCLASS_SET_SUPER(VALUE klass, VALUE super);
-static inline void RCLASS_SET_INCLUDER(VALUE iclass, VALUE klass);
-
 VALUE rb_class_inherited(VALUE, VALUE);
 VALUE rb_keyword_error_new(const char *, VALUE);
 
+rb_classext_t *rb_class_unlink_classext(VALUE klass, const rb_box_t *box);
+void rb_class_classext_free(VALUE klass, rb_classext_t *ext, bool is_prime);
+void rb_iclass_classext_free(VALUE klass, rb_classext_t *ext, bool is_prime);
+
+RUBY_SYMBOL_EXPORT_BEGIN
+
+/* for objspace */
+VALUE rb_class_super_of(VALUE klass);
+VALUE rb_class_singleton_p(VALUE klass);
+unsigned char rb_class_variation_count(VALUE klass);
+
+RUBY_SYMBOL_EXPORT_END
+
 static inline bool
 RCLASS_SINGLETON_P(VALUE klass)
 {
-    return RB_TYPE_P(klass, T_CLASS) && FL_TEST_RAW(klass, FL_SINGLETON);
+    RUBY_ASSERT(RB_TYPE_P(klass, T_CLASS) || RB_TYPE_P(klass, T_MODULE) || RB_TYPE_P(klass, T_ICLASS));
+    return RB_BUILTIN_TYPE(klass) == T_CLASS && FL_TEST_RAW(klass, FL_SINGLETON);
+}
+
+static inline void
+RCLASS_SET_SUPER(VALUE klass, VALUE super)
+{
+    RB_OBJ_WRITE(klass, &RCLASSEXT_SUPER(RCLASS_EXT_PRIME(klass)), super);
+}
+
+static inline void
+RCLASS_WRITE_SUPER(VALUE klass, VALUE super)
+{
+    RB_OBJ_WRITE(klass, &RCLASSEXT_SUPER(RCLASS_EXT_WRITABLE(klass)), super);
+}
+
+static inline VALUE
+RCLASS_WRITABLE_ENSURE_FIELDS_OBJ(VALUE obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
+    rb_classext_t *ext = RCLASS_EXT_WRITABLE(obj);
+    if (!ext->fields_obj) {
+        RB_OBJ_WRITE(obj, &ext->fields_obj, rb_imemo_fields_new(obj, ROOT_SHAPE_ID, true));
+    }
+    return ext->fields_obj;
+}
+
+static inline VALUE
+RCLASS_WRITABLE_FIELDS_OBJ(VALUE obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
+    return RCLASSEXT_FIELDS_OBJ(RCLASS_EXT_WRITABLE(obj));
+}
+
+static inline void
+RCLASSEXT_SET_FIELDS_OBJ(VALUE obj, rb_classext_t *ext, VALUE fields_obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
+
+    RB_OBJ_ATOMIC_WRITE(obj, &ext->fields_obj, fields_obj);
+}
+
+static inline void
+RCLASS_WRITABLE_SET_FIELDS_OBJ(VALUE obj, VALUE fields_obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
+
+    RCLASSEXT_SET_FIELDS_OBJ(obj, RCLASS_EXT_WRITABLE(obj), fields_obj);
+}
+
+static inline uint32_t
+RCLASS_FIELDS_COUNT(VALUE obj)
+{
+    RUBY_ASSERT(RB_TYPE_P(obj, RUBY_T_CLASS) || RB_TYPE_P(obj, RUBY_T_MODULE));
+
+    VALUE fields_obj = RCLASS_WRITABLE_FIELDS_OBJ(obj);
+    if (fields_obj) {
+        if (rb_obj_shape_complex_p(fields_obj)) {
+            return (uint32_t)rb_st_table_size(rb_imemo_fields_complex_tbl(fields_obj));
+        }
+        else {
+            return RSHAPE_LEN(RBASIC_SHAPE_ID(fields_obj));
+        }
+    }
+    return 0;
+}
+
+static inline void
+RCLASS_SET_M_TBL(VALUE klass, struct rb_id_table *table)
+{
+    RCLASSEXT_M_TBL(RCLASS_EXT_PRIME(klass)) = table;
+}
+
+static inline void
+RCLASS_WRITE_M_TBL(VALUE klass, struct rb_id_table *table)
+{
+    RCLASSEXT_M_TBL(RCLASS_EXT_WRITABLE(klass)) = table;
+}
+
+static inline void
+RCLASS_SET_CONST_TBL(VALUE klass, struct rb_id_table *table, bool shared)
+{
+    rb_classext_t *ext = RCLASS_EXT_PRIME(klass);
+    RCLASSEXT_CONST_TBL(ext) = table;
+    if (shared)
+        RCLASSEXT_SHARED_CONST_TBL(ext) = true;
+}
+
+static inline void
+RCLASS_WRITE_CONST_TBL(VALUE klass, struct rb_id_table *table, bool shared)
+{
+    rb_classext_t *ext = RCLASS_EXT_WRITABLE(klass);
+    RCLASSEXT_CONST_TBL(ext) = table;
+    if (shared)
+        RCLASSEXT_SHARED_CONST_TBL(ext) = true;
+}
+
+static inline void
+RCLASS_WRITE_CALLABLE_M_TBL(VALUE klass, struct rb_id_table *table)
+{
+    RCLASSEXT_CALLABLE_M_TBL(RCLASS_EXT_WRITABLE(klass)) = table;
+}
+
+static inline void
+RCLASS_WRITE_CC_TBL(VALUE klass, VALUE table)
+{
+    RB_OBJ_ATOMIC_WRITE(klass, &RCLASSEXT_CC_TBL(RCLASS_EXT_WRITABLE(klass)), table);
+}
+
+static inline void
+RCLASS_SET_CVC_TBL(VALUE klass, VALUE table)
+{
+    RB_OBJ_ATOMIC_WRITE(klass, &RCLASSEXT_CVC_TBL(RCLASS_EXT_PRIME(klass)), table);
+}
+
+static inline void
+RCLASS_WRITE_CVC_TBL(VALUE klass, VALUE table)
+{
+    RB_OBJ_ATOMIC_WRITE(klass, &RCLASSEXT_CVC_TBL(RCLASS_EXT_WRITABLE(klass)), table);
+}
+
+static inline void
+RCLASS_SET_REFINED_CLASS(VALUE klass, VALUE refined)
+{
+    RB_OBJ_WRITE(klass, &RCLASSEXT_REFINED_CLASS(RCLASS_EXT_PRIME(klass)), refined);
 }
 
 static inline rb_alloc_func_t
 RCLASS_ALLOCATOR(VALUE klass)
 {
-    if (RCLASS_SINGLETON_P(klass)) {
-        return 0;
-    }
-    return RCLASS_EXT(klass)->as.class.allocator;
+    RBIMPL_ASSERT_TYPE(klass, T_CLASS);
+    RUBY_ASSERT(!RCLASS_SINGLETON_P(klass));
+    return RCLASS_EXT_PRIME(klass)->as.class.allocator;
 }
 
 static inline void
 RCLASS_SET_ALLOCATOR(VALUE klass, rb_alloc_func_t allocator)
 {
-    assert(!RCLASS_SINGLETON_P(klass));
-    RCLASS_EXT(klass)->as.class.allocator = allocator;
+    RUBY_ASSERT(RB_TYPE_P(klass, T_CLASS));
+    RUBY_ASSERT(!RCLASS_SINGLETON_P(klass));
+    RCLASS_EXT_PRIME(klass)->as.class.allocator = allocator; // Allocator is set only on the initial definition
 }
 
 static inline void
 RCLASS_SET_ORIGIN(VALUE klass, VALUE origin)
 {
-    RB_OBJ_WRITE(klass, &RCLASS_ORIGIN(klass), origin);
-    if (klass != origin) FL_SET(origin, RICLASS_IS_ORIGIN);
+    rb_classext_t *ext = RCLASS_EXT_PRIME(klass);
+    RB_OBJ_WRITE(klass, &RCLASSEXT_ORIGIN(ext), origin);
+    if (klass != origin) RCLASSEXT_ICLASS_IS_ORIGIN(RCLASS_EXT_WRITABLE(origin)) = true;
+}
+
+static inline void
+RCLASS_WRITE_ORIGIN(VALUE klass, VALUE origin)
+{
+    rb_classext_t *ext = RCLASS_EXT_WRITABLE(klass);
+    RB_OBJ_WRITE(klass, &RCLASSEXT_ORIGIN(ext), origin);
+    if (klass != origin) RCLASSEXT_ICLASS_IS_ORIGIN(RCLASS_EXT_WRITABLE(origin)) = true;
 }
 
 static inline void
 RICLASS_SET_ORIGIN_SHARED_MTBL(VALUE iclass)
 {
-    FL_SET(iclass, RICLASS_ORIGIN_SHARED_MTBL);
+    RCLASSEXT_ICLASS_ORIGIN_SHARED_MTBL(RCLASS_EXT_PRIME(iclass)) = true;
+}
+
+static inline void
+RICLASS_WRITE_ORIGIN_SHARED_MTBL(VALUE iclass)
+{
+    RCLASSEXT_ICLASS_ORIGIN_SHARED_MTBL(RCLASS_EXT_WRITABLE(iclass)) = true;
 }
 
 static inline bool
 RICLASS_OWNS_M_TBL_P(VALUE iclass)
 {
-    return FL_TEST_RAW(iclass, RICLASS_IS_ORIGIN | RICLASS_ORIGIN_SHARED_MTBL) == RICLASS_IS_ORIGIN;
+    rb_classext_t *ext = RCLASS_EXT_READABLE(iclass);
+    return RCLASSEXT_ICLASS_IS_ORIGIN(ext) && !RCLASSEXT_ICLASS_ORIGIN_SHARED_MTBL(ext);
+}
+
+static inline bool
+RICLASS_FOR_REFINEMENT_P(VALUE iclass)
+{
+    return BUILTIN_TYPE(iclass) == T_ICLASS &&
+            RB_TYPE_P(RBASIC(iclass)->klass, T_MODULE) &&
+            FL_TEST_RAW(RBASIC(iclass)->klass, RMODULE_IS_REFINEMENT);
 }
 
 static inline void
 RCLASS_SET_INCLUDER(VALUE iclass, VALUE klass)
 {
+    RUBY_ASSERT(RB_TYPE_P(iclass, T_ICLASS));
     RB_OBJ_WRITE(iclass, &RCLASS_INCLUDER(iclass), klass);
 }
 
-static inline VALUE
-RCLASS_SUPER(VALUE klass)
+static inline void
+RCLASS_WRITE_SUPERCLASSES(VALUE klass, size_t depth, VALUE *superclasses, bool with_self)
 {
-    return RCLASS(klass)->super;
+    RUBY_ASSERT(depth <= RCLASS_MAX_SUPERCLASS_DEPTH);
+
+    rb_classext_t *ext = RCLASS_EXT_PRIME(klass);
+    RCLASSEXT_SUPERCLASS_DEPTH(ext) = depth;
+    RCLASSEXT_SUPERCLASSES(ext) = superclasses;
+    RCLASSEXT_SUPERCLASSES_WITH_SELF(ext) = with_self;
 }
 
-static inline VALUE
-RCLASS_SET_SUPER(VALUE klass, VALUE super)
+static inline void
+RCLASS_SET_SUBCLASSES(VALUE klass, VALUE subclasses)
 {
-    if (super) {
-        rb_class_remove_from_super_subclasses(klass);
-        rb_class_subclass_add(super, klass);
-    }
-    RB_OBJ_WRITE(klass, &RCLASS(klass)->super, super);
-    rb_class_update_superclasses(klass);
-    return super;
+    rb_classext_t *ext = RCLASS_EXT_PRIME(klass);
+    RB_OBJ_WRITE(klass, &RCLASSEXT_SUBCLASSES(ext), subclasses);
 }
 
 static inline void
 RCLASS_SET_CLASSPATH(VALUE klass, VALUE classpath, bool permanent)
 {
+    rb_classext_t *ext = RCLASS_EXT_READABLE(klass);
+    assert(BUILTIN_TYPE(klass) == T_CLASS || BUILTIN_TYPE(klass) == T_MODULE);
+    assert(classpath == 0 || BUILTIN_TYPE(classpath) == T_STRING);
+    assert(FL_TEST_RAW(classpath, RUBY_FL_SHAREABLE));
+
+    RB_OBJ_WRITE(klass, &(RCLASSEXT_CLASSPATH(ext)), classpath);
+    RCLASSEXT_PERMANENT_CLASSPATH(ext) = permanent;
+}
+
+static inline void
+RCLASS_WRITE_CLASSPATH(VALUE klass, VALUE classpath, bool permanent)
+{
+    rb_classext_t *ext = RCLASS_EXT_WRITABLE(klass);
     assert(BUILTIN_TYPE(klass) == T_CLASS || BUILTIN_TYPE(klass) == T_MODULE);
     assert(classpath == 0 || BUILTIN_TYPE(classpath) == T_STRING);
+    assert(!RB_FL_ABLE(classpath) || FL_TEST_RAW(classpath, RUBY_FL_SHAREABLE));
 
-    RB_OBJ_WRITE(klass, &(RCLASS_EXT(klass)->classpath), classpath);
-    RCLASS_EXT(klass)->permanent_classpath = permanent;
+    RB_OBJ_WRITE(klass, &(RCLASSEXT_CLASSPATH(ext)), classpath);
+    RCLASSEXT_PERMANENT_CLASSPATH(ext) = permanent;
 }
 
 static inline VALUE
@@ -276,8 +709,36 @@ RCLASS_SET_ATTACHED_OBJECT(VALUE klass, VALUE attached_object)
 {
     assert(RCLASS_SINGLETON_P(klass));
 
-    RB_OBJ_WRITE(klass, &RCLASS_EXT(klass)->as.singleton_class.attached_object, attached_object);
+    RB_OBJ_WRITE(klass, &RCLASS_EXT_PRIME(klass)->as.singleton_class.attached_object, attached_object);
     return attached_object;
 }
 
+static inline void
+RCLASS_SET_MAX_IV_COUNT(VALUE klass, attr_index_t count)
+{
+    RUBY_ASSERT(klass != rb_cObject);
+    RUBY_ASSERT(klass != rb_cBasicObject);
+
+    RCLASS_MAX_IV_COUNT(klass) = count;
+}
+
+static inline void
+RCLASS_SET_EXPECT_NO_IVAR(VALUE klass)
+{
+    RCLASS_EXT_PRIME(klass)->expect_no_ivar = true;
+}
+
+static inline bool
+RCLASS_EXPECT_NO_IVAR(VALUE klass)
+{
+    return RCLASS_EXT_PRIME(klass)->expect_no_ivar;
+}
+
+static inline bool
+RCLASS_INITIALIZED_P(VALUE klass)
+{
+    VM_ASSERT(RB_TYPE_P(klass, T_CLASS) || RB_TYPE_P(klass, T_MODULE));
+    return FL_TEST_RAW(klass, RCLASS_IS_INITIALIZED);
+}
+
 #endif /* INTERNAL_CLASS_H */
diff --git a/internal/cmdlineopt.h b/internal/cmdlineopt.h
index e79b993345..aed209e2a2 100644
--- a/internal/cmdlineopt.h
+++ b/internal/cmdlineopt.h
@@ -1,7 +1,6 @@
 #ifndef INTERNAL_CMDLINEOPT_H                               /*-*-C-*-vi:se ft=c:*/
 #define INTERNAL_CMDLINEOPT_H
 
-#include "rjit.h"
 #include "yjit.h"
 
 typedef struct {
@@ -24,9 +23,6 @@ typedef struct ruby_cmdline_options {
     ruby_features_t warn;
     unsigned int dump;
     long backtrace_length_limit;
-#if USE_RJIT
-    struct rb_rjit_options rjit;
-#endif
 
     const char *crash_report;
 
@@ -43,6 +39,9 @@ typedef struct ruby_cmdline_options {
 #if USE_YJIT
     unsigned int yjit: 1;
 #endif
+#if USE_ZJIT
+    unsigned int zjit: 1;
+#endif
 } ruby_cmdline_options_t;
 
 struct ruby_opt_message {
diff --git a/internal/compar.h b/internal/compar.h
index 9115e4bd63..5eb5e8714e 100644
--- a/internal/compar.h
+++ b/internal/compar.h
@@ -25,5 +25,6 @@
 
 /* compar.c */
 VALUE rb_invcmp(VALUE, VALUE);
+NORETURN(void rb_cmperr_reason(VALUE, VALUE, const char*));
 
 #endif /* INTERNAL_COMPAR_H */
diff --git a/internal/concurrent_set.h b/internal/concurrent_set.h
new file mode 100644
index 0000000000..76cbefab04
--- /dev/null
+++ b/internal/concurrent_set.h
@@ -0,0 +1,21 @@
+#ifndef RUBY_RACTOR_SAFE_TABLE_H
+#define RUBY_RACTOR_SAFE_TABLE_H
+
+#include "ruby/atomic.h"
+#include "ruby/ruby.h"
+
+struct rb_concurrent_set_funcs {
+    VALUE (*hash)(VALUE key);
+    bool (*cmp)(VALUE a, VALUE b);
+    VALUE (*create)(VALUE key, void *data);
+    void (*free)(VALUE key);
+};
+
+VALUE rb_concurrent_set_new(const struct rb_concurrent_set_funcs *funcs, int capacity);
+rb_atomic_t rb_concurrent_set_size(VALUE set_obj);
+VALUE rb_concurrent_set_find(VALUE *set_obj_ptr, VALUE key);
+VALUE rb_concurrent_set_find_or_insert(VALUE *set_obj_ptr, VALUE key, void *data);
+VALUE rb_concurrent_set_delete_by_identity(VALUE set_obj, VALUE key);
+void rb_concurrent_set_foreach_with_replace(VALUE set_obj, int (*callback)(VALUE *key, void *data), void *data);
+
+#endif
diff --git a/internal/cont.h b/internal/cont.h
index 3c2528a02a..dcf6f820a3 100644
--- a/internal/cont.h
+++ b/internal/cont.h
@@ -31,5 +31,4 @@ VALUE rb_fiber_inherit_storage(struct rb_execution_context_struct *ec, struct rb
 VALUE rb_fiberptr_self(struct rb_fiber_struct *fiber);
 unsigned int rb_fiberptr_blocking(struct rb_fiber_struct *fiber);
 struct rb_execution_context_struct * rb_fiberptr_get_ec(struct rb_fiber_struct *fiber);
-
 #endif /* INTERNAL_CONT_H */
diff --git a/internal/encoding.h b/internal/encoding.h
index fe9ea10ec4..38bf8fc9da 100644
--- a/internal/encoding.h
+++ b/internal/encoding.h
@@ -11,7 +11,6 @@
 #include "ruby/ruby.h"          /* for ID */
 #include "ruby/encoding.h"      /* for rb_encoding */
 
-#define rb_enc_autoload_p(enc) (!rb_enc_mbmaxlen(enc))
 #define rb_is_usascii_enc(enc) ((enc) == rb_usascii_encoding())
 #define rb_is_ascii8bit_enc(enc) ((enc) == rb_ascii8bit_encoding())
 #define rb_is_locale_enc(enc) ((enc) == rb_locale_encoding())
@@ -24,10 +23,14 @@ rb_encoding *rb_enc_check_str(VALUE str1, VALUE str2);
 int rb_encdb_replicate(const char *alias, const char *orig);
 int rb_encdb_alias(const char *alias, const char *orig);
 int rb_enc_autoload(rb_encoding *enc);
+bool rb_enc_autoload_p(rb_encoding *enc);
 int rb_encdb_dummy(const char *name);
 void rb_encdb_declare(const char *name);
 void rb_enc_set_base(const char *name, const char *orig);
 int rb_enc_set_dummy(int index);
+void rb_enc_raw_set(VALUE obj, rb_encoding *enc);
+int rb_enc_registered(const char *name);
+
 PUREFUNC(int rb_data_is_encoding(VALUE obj));
 
 /* vm.c */
diff --git a/internal/error.h b/internal/error.h
index 7a4daca6b3..fead2aee95 100644
--- a/internal/error.h
+++ b/internal/error.h
@@ -72,13 +72,14 @@ const char *rb_builtin_type_name(int t);
 const char *rb_builtin_class_name(VALUE x);
 PRINTF_ARGS(void rb_warn_deprecated(const char *fmt, const char *suggest, ...), 1, 3);
 PRINTF_ARGS(void rb_warn_deprecated_to_remove(const char *removal, const char *fmt, const char *suggest, ...), 2, 4);
+PRINTF_ARGS(void rb_warn_reserved_name(const char *removal, const char *fmt, ...), 2, 3);
 #if RUBY_DEBUG
 # include "ruby/version.h"
-# define RUBY_VERSION_SINCE(major, minor) (RUBY_API_VERSION_CODE >= (major * 10000) + (minor) * 100)
-# define RUBY_VERSION_BEFORE(major, minor) (RUBY_API_VERSION_CODE < (major * 10000) + (minor) * 100)
+# define RUBY_VERSION_SINCE(major, minor) (RUBY_API_VERSION_CODE >= (major) * 10000 + (minor) * 100)
+# define RUBY_VERSION_BEFORE(major, minor) (RUBY_API_VERSION_CODE < (major) * 10000 + (minor) * 100)
 # if defined(RBIMPL_WARNING_PRAGMA0)
 #   define RBIMPL_TODO0(x) RBIMPL_WARNING_PRAGMA0(message(x))
-# elif RBIMPL_COMPILER_SINCE(MSVC, 12, 0, 0)
+# elif RBIMPL_COMPILER_IS(MSVC)
 #   define RBIMPL_TODO0(x) __pragma(message(x))
 # endif
 
@@ -110,6 +111,14 @@ rb_deprecated_method_to_be_removed(const char *removal)
     RBIMPL_ATTR_DIAGNOSE_IF(RUBY_VERSION_STRING_SINCE(removal), "deprecated method to be removed", "error")
 {
 }
+
+RBIMPL_ATTR_FORCEINLINE()
+static void
+rb_diagnose_reserved_name_at(const char *coming)
+    RBIMPL_ATTR_DIAGNOSE_IF(!RUBY_VERSION_isdigit(coming[0]), "malformed version number", "error")
+    RBIMPL_ATTR_DIAGNOSE_IF(RUBY_VERSION_STRING_SINCE(coming), "reserved name already in use", "error")
+{
+}
 # else
 RBIMPL_ATTR_ERROR(("deprecated"))
 void rb_deprecated_method_to_be_removed(const char *);
@@ -117,16 +126,32 @@ void rb_deprecated_method_to_be_removed(const char *);
     (sizeof(char[1-2*(!RUBY_VERSION_isdigit(removal[0]) || RUBY_VERSION_STRING_SINCE(removal))])!=1 ? \
      rb_deprecated_method_to_be_removed(removal) : \
      RBIMPL_ASSERT_NOTHING)
+
+RBIMPL_ATTR_ERROR(("deprecated"))
+void rb_diagnose_reserved_name_at(const char *);
+#   define rb_diagnose_reserved_name_at(coming) \
+    (sizeof(char[1-2*(!RUBY_VERSION_isdigit(coming[0]) || RUBY_VERSION_STRING_SINCE(coming))])!=1 ? \
+     rb_diagnose_reserved_name_at(coming) : \
+     RBIMPL_ASSERT_NOTHING)
+
 # endif
 # define rb_warn_deprecated_to_remove_at(removal, ...) \
     (rb_deprecated_method_to_be_removed(#removal), \
      rb_warn_deprecated_to_remove(#removal, __VA_ARGS__))
+
+# define rb_warn_reserved_name_at(coming, ...) \
+    (rb_diagnose_reserved_name_at(#coming), \
+     rb_warn_reserved_name(#coming, __VA_ARGS__))
 # endif
 #endif
 #ifndef rb_warn_deprecated_to_remove_at
 # define rb_warn_deprecated_to_remove_at(removal, ...) \
         rb_warn_deprecated_to_remove(#removal, __VA_ARGS__)
 #endif
+#ifndef rb_warn_reserved_name_at
+# define rb_warn_reserved_name_at(removal, ...) \
+        rb_warn_reserved_name(#removal, __VA_ARGS__)
+#endif
 #ifndef RUBY_VERSION_SINCE
 # define RUBY_VERSION_SINCE(major, minor) 0
 #endif
@@ -160,6 +185,10 @@ NORETURN(static inline void rb_key_err_raise(VALUE mesg, VALUE recv, VALUE name)
 static inline void Check_Type(VALUE v, enum ruby_value_type t);
 static inline bool rb_typeddata_is_instance_of_inline(VALUE obj, const rb_data_type_t *data_type);
 #define rb_typeddata_is_instance_of rb_typeddata_is_instance_of_inline
+void rb_bug_without_die(const char *fmt, ...);
+NORETURN(void rb_no_implicit_conversion(VALUE val, const char *tname));
+NORETURN(void rb_cant_convert(VALUE val, const char *tname));
+NORETURN(void rb_cant_convert_invalid_return(VALUE val, const char *tname, const char *method_name, VALUE ret));
 
 RUBY_SYMBOL_EXPORT_BEGIN
 /* error.c (export) */
@@ -209,10 +238,18 @@ rb_key_err_raise(VALUE mesg, VALUE recv, VALUE name)
     rb_exc_raise(exc);
 }
 
+RBIMPL_ATTR_NONNULL((2))
 static inline bool
 rb_typeddata_is_instance_of_inline(VALUE obj, const rb_data_type_t *data_type)
 {
-    return RB_TYPE_P(obj, T_DATA) && RTYPEDDATA_P(obj) && (RTYPEDDATA_TYPE(obj) == data_type);
+    return rbimpl_obj_typeddata_p(obj) && (RTYPEDDATA_TYPE(obj) == data_type);
 }
 
+typedef enum {
+    rb_stack_overflow_prevention = 0, // VM stack overflow or about to machine stack overflow
+    rb_stack_overflow_signal = 1, // machine stack overflow but may be recoverable
+    rb_stack_overflow_fatal = 2, // fatal machine stack overflow
+} ruby_stack_overflow_critical_level;
+NORETURN(void rb_ec_stack_overflow(struct rb_execution_context_struct *ec, ruby_stack_overflow_critical_level crit));
+
 #endif /* INTERNAL_ERROR_H */
diff --git a/internal/eval.h b/internal/eval.h
index e594d8516d..17ade0a7f1 100644
--- a/internal/eval.h
+++ b/internal/eval.h
@@ -11,17 +11,27 @@
  *             header (related to this file, but not the same role).
  */
 #include "ruby/ruby.h"          /* for ID */
+#include "vm_core.h"          /* for ID */
 
 #define id_signo ruby_static_id_signo
 #define id_status ruby_static_id_status
 
 /* eval.c */
+struct rb_refinements_data {
+    VALUE refinement;
+    VALUE refinements;
+};
+
 extern ID ruby_static_id_signo;
 extern ID ruby_static_id_status;
 VALUE rb_refinement_module_get_refined_class(VALUE module);
 void rb_class_modify_check(VALUE);
 NORETURN(VALUE rb_f_raise(int argc, VALUE *argv));
+VALUE rb_exception_setup(int argc, VALUE *argv);
+void rb_refinement_setup(struct rb_refinements_data *data, VALUE module, VALUE klass);
+void rb_vm_using_module(VALUE module);
 VALUE rb_top_main_class(const char *method);
+VALUE rb_ec_ensure(rb_execution_context_t *ec, VALUE (*b_proc)(VALUE), VALUE data1, VALUE (*e_proc)(VALUE), VALUE data2);
 
 /* eval_error.c */
 VALUE rb_get_backtrace(VALUE info);
diff --git a/internal/file.h b/internal/file.h
index 9c192ff4d1..1aa4c67043 100644
--- a/internal/file.h
+++ b/internal/file.h
@@ -23,7 +23,9 @@ VALUE rb_file_expand_path_fast(VALUE, VALUE);
 VALUE rb_file_expand_path_internal(VALUE, VALUE, int, int, VALUE);
 VALUE rb_get_path_check_to_string(VALUE);
 VALUE rb_get_path_check_convert(VALUE);
+VALUE rb_get_path_check_no_convert(VALUE);
 int ruby_is_fd_loadable(int fd);
+char *rb_enc_path_skip_prefix_root(const char *path, const char *end, rb_encoding *enc);
 
 RUBY_SYMBOL_EXPORT_BEGIN
 /* file.c (export) */
diff --git a/internal/fixnum.h b/internal/fixnum.h
index 8c251adef1..b78e31460e 100644
--- a/internal/fixnum.h
+++ b/internal/fixnum.h
@@ -10,6 +10,7 @@
  */
 #include "ruby/internal/config.h"      /* for HAVE_LONG_LONG */
 #include <limits.h>             /* for CHAR_BIT */
+#include "internal/bits.h"      /* for MUL_OVERFLOW_FIXNUM_P */
 #include "internal/compilers.h" /* for __has_builtin */
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/intern.h"        /* for rb_big_mul */
diff --git a/internal/gc.h b/internal/gc.h
index ecc3f11b2c..e21fb89267 100644
--- a/internal/gc.h
+++ b/internal/gc.h
@@ -16,8 +16,8 @@
 #include "ruby/ruby.h"          /* for rb_event_flag_t */
 #include "vm_core.h"            /* for GET_EC() */
 
-#ifndef USE_SHARED_GC
-# define USE_SHARED_GC 0
+#ifndef USE_MODULAR_GC
+# define USE_MODULAR_GC 0
 #endif
 
 #if defined(__x86_64__) && !defined(_ILP32) && defined(__GNUC__)
@@ -83,8 +83,6 @@ rb_gc_debug_body(const char *mode, const char *msg, int st, void *ptr)
 #define RUBY_GC_INFO if(0)printf
 #endif
 
-#define RUBY_FREE_UNLESS_NULL(ptr) if(ptr){ruby_xfree(ptr);(ptr)=NULL;}
-
 #if STACK_GROW_DIRECTION > 0
 # define STACK_UPPER(x, a, b) (a)
 #elif STACK_GROW_DIRECTION < 0
@@ -122,12 +120,19 @@ const char *rb_raw_obj_info(char *const buff, const size_t buff_size, VALUE obj)
 struct rb_execution_context_struct; /* in vm_core.h */
 struct rb_objspace; /* in vm_core.h */
 
-#define NEWOBJ_OF(var, T, c, f, s, ec) \
-    T *(var) = (T *)(((f) & FL_WB_PROTECTED) ? \
-            rb_wb_protected_newobj_of((ec ? ec : GET_EC()), (c), (f) & ~FL_WB_PROTECTED, s) : \
-            rb_wb_unprotected_newobj_of((c), (f), s))
-
-#define RB_OBJ_GC_FLAGS_MAX 6   /* used in ext/objspace */
+#define EC_NEWOBJ_OF(var, T, c, f, s, ec)  \
+    T *(var) = (T *)rb_ec_newobj_of((ec), (c), (f), s)
+#define NEWOBJ_OF(var, T, c, f, s) EC_NEWOBJ_OF(var, T, c, f, s, GET_EC())
+#define UNPROTECTED_NEWOBJ_OF(var, T, c, f, s) \
+    T *(var) = (T *)rb_newobj((GET_EC()), (c), (f), ROOT_SHAPE_ID | SHAPE_ID_LAYOUT_OTHER, false, s)
+
+#ifndef RB_GC_OBJECT_METADATA_ENTRY_DEFINED
+# define RB_GC_OBJECT_METADATA_ENTRY_DEFINED
+struct rb_gc_object_metadata_entry {
+    ID name;
+    VALUE val;
+};
+#endif
 
 #ifndef USE_UNALIGNED_MEMBER_ACCESS
 # define UNALIGNED_MEMBER_ACCESS(expr) (expr)
@@ -163,12 +168,6 @@ struct rb_objspace; /* in vm_core.h */
     RB_OBJ_WRITE(old, _slot, young); \
 } while (0)
 
-// We use SIZE_POOL_COUNT number of shape IDs for transitions out of different size pools
-// The next available shape ID will be the SPECIAL_CONST_SHAPE_ID
-#ifndef SIZE_POOL_COUNT
-# define SIZE_POOL_COUNT 5
-#endif
-
 /* Used in places that could malloc during, which can cause the GC to run. We
  * need to temporarily disable the GC to allow the malloc to happen.
  * Allocating memory during GC is a bad idea, so use this only when absolutely
@@ -180,25 +179,14 @@ struct rb_objspace; /* in vm_core.h */
 #define DURING_GC_COULD_MALLOC_REGION_END() \
     if (_already_disabled == Qfalse) rb_gc_enable()
 
-typedef struct ractor_newobj_size_pool_cache {
-    struct RVALUE *freelist;
-    struct heap_page *using_page;
-} rb_ractor_newobj_size_pool_cache_t;
-
-typedef struct ractor_newobj_cache {
-    size_t incremental_mark_step_allocated_slots;
-    rb_ractor_newobj_size_pool_cache_t size_pool_caches[SIZE_POOL_COUNT];
-} rb_ractor_newobj_cache_t;
-
 /* gc.c */
-extern int ruby_disable_gc;
 RUBY_ATTR_MALLOC void *ruby_mimmalloc(size_t size);
 RUBY_ATTR_MALLOC void *ruby_mimcalloc(size_t num, size_t size);
 void ruby_mimfree(void *ptr);
 void rb_gc_prepare_heap(void);
 void rb_objspace_set_event_hook(const rb_event_flag_t event);
-VALUE rb_objspace_gc_enable(struct rb_objspace *);
-VALUE rb_objspace_gc_disable(struct rb_objspace *);
+VALUE rb_objspace_gc_enable(void *objspace);
+VALUE rb_objspace_gc_disable(void *objspace);
 void ruby_gc_set_params(void);
 void rb_gc_copy_attributes(VALUE dest, VALUE obj);
 size_t rb_size_mul_or_raise(size_t, size_t, VALUE); /* used in compile.c */
@@ -209,25 +197,26 @@ RUBY_ATTR_MALLOC void *rb_xcalloc_mul_add(size_t, size_t, size_t);
 void *rb_xrealloc_mul_add(const void *, size_t, size_t, size_t);
 RUBY_ATTR_MALLOC void *rb_xmalloc_mul_add_mul(size_t, size_t, size_t, size_t);
 RUBY_ATTR_MALLOC void *rb_xcalloc_mul_add_mul(size_t, size_t, size_t, size_t);
-static inline void *ruby_sized_xrealloc_inlined(void *ptr, size_t new_size, size_t old_size) RUBY_ATTR_RETURNS_NONNULL RUBY_ATTR_ALLOC_SIZE((2));
-static inline void *ruby_sized_xrealloc2_inlined(void *ptr, size_t new_count, size_t elemsiz, size_t old_count) RUBY_ATTR_RETURNS_NONNULL RUBY_ATTR_ALLOC_SIZE((2, 3));
-static inline void ruby_sized_xfree_inlined(void *ptr, size_t size);
-void rb_gc_ractor_newobj_cache_clear(rb_ractor_newobj_cache_t *newobj_cache);
+void rb_gc_obj_id_moved(VALUE obj);
+void rb_gc_register_pinning_obj(VALUE obj);
+rb_execution_context_t *rb_gc_get_ec(void);
+
+void *rb_gc_ractor_cache_alloc(rb_ractor_t *ractor);
+void rb_gc_ractor_cache_free(void *cache);
+
 bool rb_gc_size_allocatable_p(size_t size);
-size_t *rb_gc_size_pool_sizes(void);
-size_t rb_gc_size_pool_id_for_size(size_t size);
-int rb_objspace_garbage_object_p(VALUE obj);
-bool rb_gc_is_ptr_to_obj(const void *ptr);
+size_t *rb_gc_heap_sizes(void);
+size_t rb_gc_heap_id_for_size(size_t size);
 
 void rb_gc_mark_and_move(VALUE *ptr);
 
-void rb_gc_mark_weak(VALUE *ptr);
-void rb_gc_remove_weak(VALUE parent_obj, VALUE *ptr);
-
 void rb_gc_ref_update_table_values_only(st_table *tbl);
 
 void rb_gc_initial_stress_set(VALUE flag);
 
+void rb_gc_before_fork(void);
+void rb_gc_after_fork(rb_pid_t pid);
+
 #define rb_gc_mark_and_move_ptr(ptr) do { \
     VALUE _obj = (VALUE)*(ptr); \
     rb_gc_mark_and_move(&_obj); \
@@ -238,8 +227,11 @@ RUBY_SYMBOL_EXPORT_BEGIN
 /* exports for objspace module */
 void rb_objspace_reachable_objects_from(VALUE obj, void (func)(VALUE, void *), void *data);
 void rb_objspace_reachable_objects_from_root(void (func)(const char *category, VALUE, void *), void *data);
-int rb_objspace_markable_object_p(VALUE obj);
 int rb_objspace_internal_object_p(VALUE obj);
+int rb_objspace_garbage_object_p(VALUE obj);
+bool rb_gc_pointer_to_heap_p(VALUE obj);
+void rb_gc_declare_weak_references(VALUE obj);
+bool rb_gc_handle_weak_references_alive_p(VALUE obj);
 
 void rb_objspace_each_objects(
     int (*callback)(void *start, void *end, size_t stride, void *data),
@@ -249,86 +241,66 @@ size_t rb_gc_obj_slot_size(VALUE obj);
 
 VALUE rb_gc_disable_no_rest(void);
 
+#define RB_GC_MAX_NAME_LEN 20
 
 /* gc.c (export) */
 const char *rb_objspace_data_type_name(VALUE obj);
-VALUE rb_wb_protected_newobj_of(struct rb_execution_context_struct *, VALUE, VALUE, size_t);
-VALUE rb_wb_unprotected_newobj_of(VALUE, VALUE, size_t);
+VALUE rb_newobj(struct rb_execution_context_struct *, VALUE, VALUE, uint32_t /* shape_id_t */, bool, size_t);
+VALUE rb_newobj_of(VALUE, VALUE, size_t);
+VALUE rb_ec_newobj_of(struct rb_execution_context_struct *, VALUE, VALUE, size_t);
 size_t rb_obj_memsize_of(VALUE);
-void rb_gc_verify_internal_consistency(void);
-size_t rb_obj_gc_flags(VALUE, ID[], size_t);
+struct rb_gc_object_metadata_entry *rb_gc_object_metadata(VALUE obj);
 void rb_gc_mark_values(long n, const VALUE *values);
 void rb_gc_mark_vm_stack_values(long n, const VALUE *values);
 void rb_gc_update_values(long n, VALUE *values);
-void *ruby_sized_xrealloc(void *ptr, size_t new_size, size_t old_size) RUBY_ATTR_RETURNS_NONNULL RUBY_ATTR_ALLOC_SIZE((2));
-void *ruby_sized_xrealloc2(void *ptr, size_t new_count, size_t element_size, size_t old_count) RUBY_ATTR_RETURNS_NONNULL RUBY_ATTR_ALLOC_SIZE((2, 3));
-void ruby_sized_xfree(void *x, size_t size);
-RUBY_SYMBOL_EXPORT_END
-
-int rb_ec_stack_check(struct rb_execution_context_struct *ec);
-void rb_gc_writebarrier_remember(VALUE obj);
-const char *rb_obj_info(VALUE obj);
-
-#if defined(HAVE_MALLOC_USABLE_SIZE) || defined(HAVE_MALLOC_SIZE) || defined(_WIN32)
-
-static inline void *
-ruby_sized_xrealloc_inlined(void *ptr, size_t new_size, size_t old_size)
-{
-    return ruby_xrealloc(ptr, new_size);
-}
-
-static inline void *
-ruby_sized_xrealloc2_inlined(void *ptr, size_t new_count, size_t elemsiz, size_t old_count)
-{
-    return ruby_xrealloc2(ptr, new_count, elemsiz);
-}
+void rb_gc_mark_set_no_pin(st_table *);
+void rb_gc_update_set_refs(st_table *);
 
-static inline void
-ruby_sized_xfree_inlined(void *ptr, size_t size)
-{
-    ruby_xfree(ptr);
-}
+#if USE_MODULAR_GC
+const char *rb_gc_active_gc_name(void);
+int rb_gc_modular_gc_loaded_p(void);
+#endif
 
-# define SIZED_REALLOC_N(x, y, z, w) REALLOC_N(x, y, z)
+RUBY_SYMBOL_EXPORT_END
 
-static inline void *
-ruby_sized_realloc_n(void *ptr, size_t new_count, size_t element_size, size_t old_count)
+static inline VALUE
+rb_obj_atomic_write(
+    VALUE a, VALUE *slot, VALUE b,
+    RBIMPL_ATTR_MAYBE_UNUSED()
+    const char *filename,
+    RBIMPL_ATTR_MAYBE_UNUSED()
+    int line)
 {
-    return ruby_xrealloc2(ptr, new_count, element_size);
-}
+#ifdef RGENGC_LOGGING_WRITE
+    RGENGC_LOGGING_WRITE(a, slot, b, filename, line);
+#endif
 
-#else
+    RUBY_ATOMIC_VALUE_SET(*slot, b);
 
-static inline void *
-ruby_sized_xrealloc_inlined(void *ptr, size_t new_size, size_t old_size)
-{
-    return ruby_sized_xrealloc(ptr, new_size, old_size);
-}
-
-static inline void *
-ruby_sized_xrealloc2_inlined(void *ptr, size_t new_count, size_t elemsiz, size_t old_count)
-{
-    return ruby_sized_xrealloc2(ptr, new_count, elemsiz, old_count);
+    rb_obj_written(a, RUBY_Qundef /* ignore `oldv' now */, b, filename, line);
+    return a;
 }
+#define RB_OBJ_ATOMIC_WRITE(old, slot, young) \
+    RBIMPL_CAST(rb_obj_atomic_write((VALUE)(old), (VALUE *)(slot), (VALUE)(young), __FILE__, __LINE__))
 
-static inline void
-ruby_sized_xfree_inlined(void *ptr, size_t size)
-{
-    ruby_sized_xfree(ptr, size);
-}
+int rb_ec_stack_check(struct rb_execution_context_struct *ec);
+void rb_gc_writebarrier_remember(VALUE obj);
+const char *rb_obj_info(VALUE obj);
+void ruby_annotate_mmap(const void *addr, unsigned long size, const char *name);
 
 # define SIZED_REALLOC_N(v, T, m, n) \
-    ((v) = (T *)ruby_sized_xrealloc2((void *)(v), (m), sizeof(T), (n)))
+    ((v) = (T *)ruby_xrealloc2_sized((void *)(v), (m), sizeof(T), (n)))
+
+# define SIZED_FREE(v) ruby_xfree_sized((void *)(v), sizeof(*(v)))
+# define SIZED_FREE_N(v, n) ruby_xfree_sized((void *)(v), sizeof(*(v)) * (n))
 
 static inline void *
 ruby_sized_realloc_n(void *ptr, size_t new_count, size_t element_size, size_t old_count)
 {
-    return ruby_sized_xrealloc2(ptr, new_count, element_size, old_count);
+    return ruby_xrealloc2_sized(ptr, new_count, element_size, old_count);
 }
 
-#endif /* HAVE_MALLOC_USABLE_SIZE */
+void rb_gc_verify_shareable(VALUE);
+bool rb_gc_checking_shareable(void);
 
-#define ruby_sized_xrealloc ruby_sized_xrealloc_inlined
-#define ruby_sized_xrealloc2 ruby_sized_xrealloc2_inlined
-#define ruby_sized_xfree ruby_sized_xfree_inlined
 #endif /* INTERNAL_GC_H */
diff --git a/internal/hash.h b/internal/hash.h
index fe859cb716..0386a5009c 100644
--- a/internal/hash.h
+++ b/internal/hash.h
@@ -70,8 +70,8 @@ struct RHash {
 #endif
 
 /* hash.c */
-void rb_hash_st_table_set(VALUE hash, st_table *st);
 VALUE rb_hash_default_value(VALUE hash, VALUE key);
+VALUE rb_hash_set_default(VALUE hash, VALUE ifnone);
 VALUE rb_hash_set_default_proc(VALUE hash, VALUE proc);
 long rb_dbl_long_hash(double d);
 st_table *rb_init_identtable(void);
@@ -86,8 +86,11 @@ VALUE rb_hash_set_pair(VALUE hash, VALUE pair);
 int rb_hash_stlike_delete(VALUE hash, st_data_t *pkey, st_data_t *pval);
 int rb_hash_stlike_foreach_with_replace(VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg);
 int rb_hash_stlike_update(VALUE hash, st_data_t key, st_update_callback_func *func, st_data_t arg);
+bool rb_hash_default_unredefined(VALUE hash);
+VALUE rb_hash_alloc_fixed_size(VALUE klass, st_index_t size);
 VALUE rb_ident_hash_new_with_size(st_index_t size);
 void rb_hash_free(VALUE hash);
+RUBY_EXTERN VALUE rb_cHash_empty_frozen;
 
 static inline unsigned RHASH_AR_TABLE_SIZE_RAW(VALUE h);
 static inline VALUE RHASH_IFNONE(VALUE h);
@@ -108,6 +111,7 @@ int rb_hash_stlike_foreach(VALUE hash, st_foreach_callback_func *func, st_data_t
 RUBY_SYMBOL_EXPORT_END
 
 VALUE rb_hash_new_with_size(st_index_t size);
+VALUE rb_hash_new_with_bulk_insert(long argc, const VALUE *argv);
 VALUE rb_hash_resurrect(VALUE hash);
 int rb_hash_stlike_lookup(VALUE hash, st_data_t key, st_data_t *pval);
 VALUE rb_hash_keys(VALUE hash);
@@ -188,4 +192,19 @@ RHASH_AR_TABLE_SIZE_RAW(VALUE h)
     return (unsigned)ret;
 }
 
+#define RHASH_AR_TABLE_BOUND_RAW(h) \
+  ((unsigned int)((RBASIC(h)->flags >> RHASH_AR_TABLE_BOUND_SHIFT) & \
+                  (RHASH_AR_TABLE_BOUND_MASK >> RHASH_AR_TABLE_BOUND_SHIFT)))
+
+#define RHASH_TYPE(hash) (RHASH_AR_TABLE_P(hash) ? &objhash : RHASH_ST_TABLE(hash)->type)
+
+static inline unsigned int
+RHASH_AR_TABLE_BOUND(VALUE h)
+{
+    RUBY_ASSERT(RHASH_AR_TABLE_P(h));
+    const unsigned int bound = RHASH_AR_TABLE_BOUND_RAW(h);
+    RUBY_ASSERT(bound <= RHASH_AR_TABLE_MAX_SIZE);
+    return bound;
+}
+
 #endif /* INTERNAL_HASH_H */
diff --git a/internal/imemo.h b/internal/imemo.h
index 36c0776987..e8a5f0fc8e 100644
--- a/internal/imemo.h
+++ b/internal/imemo.h
@@ -10,14 +10,11 @@
  */
 #include "ruby/internal/config.h"
 #include <stddef.h>             /* for size_t */
+#include "id_table.h"
 #include "internal/array.h"     /* for rb_ary_hidden_new_fill */
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/ruby.h"          /* for rb_block_call_func_t */
 
-#ifndef IMEMO_DEBUG
-# define IMEMO_DEBUG 0
-#endif
-
 #define IMEMO_MASK   0x0f
 
 /* FL_USER0 to FL_USER3 is for type */
@@ -28,6 +25,7 @@
 #define IMEMO_FL_USER3 FL_USER7
 #define IMEMO_FL_USER4 FL_USER8
 #define IMEMO_FL_USER5 FL_USER9
+#define IMEMO_FL_USER6 FL_USER10
 
 enum imemo_type {
     imemo_env            =  0,
@@ -39,11 +37,13 @@ enum imemo_type {
     imemo_ment           =  6,
     imemo_iseq           =  7,
     imemo_tmpbuf         =  8,
-    imemo_ast            =  9, // Obsolete due to the universal parser
-    imemo_parser_strterm = 10,
-    imemo_callinfo       = 11,
-    imemo_callcache      = 12,
-    imemo_constcache     = 13,
+    imemo_cvar_entry     =  9,
+    imemo_callinfo       = 10,
+    imemo_callcache      = 11,
+    imemo_constcache     = 12,
+    imemo_fields         = 13,
+    imemo_subclasses     = 14,
+    imemo_cdhash         = 15,
 };
 
 /* CREF (Class REFerence) is defined in method.h */
@@ -60,7 +60,6 @@ struct vm_svar {
 /*! THROW_DATA */
 struct vm_throw_data {
     VALUE flags;
-    VALUE reserved;
     const VALUE throw_obj;
     const struct rb_control_frame_struct *catch_frame;
     int throw_state;
@@ -79,7 +78,12 @@ struct vm_ifunc_argc {
 #endif
 };
 
-/*! IFUNC (Internal FUNCtion) */
+/*! IFUNC (Internal FUNCtion)
+ *
+ * Bookkeeping for converting a C function and some closed-over data into a
+ * block passable to methods. Like Ruby Proc, but not directly accessible at
+ * Ruby level since this is an imemo. See rb_block_call() and friends.
+ */
 struct vm_ifunc {
     VALUE flags;
     VALUE *svar_lep;
@@ -87,33 +91,40 @@ struct vm_ifunc {
     const void *data;
     struct vm_ifunc_argc argc;
 };
+#define IFUNC_YIELD_OPTIMIZABLE IMEMO_FL_USER0
 
 struct rb_imemo_tmpbuf_struct {
     VALUE flags;
-    VALUE reserved;
     VALUE *ptr; /* malloc'ed buffer */
-    struct rb_imemo_tmpbuf_struct *next; /* next imemo */
-    size_t cnt; /* buffer size in VALUE */
+    size_t size; /* buffer size in bytes */
 };
 
+struct rb_imemo_cdhash {
+    VALUE flags;
+    st_table tbl;
+};
+
+/* Set on imemo_memo when u3 holds a VALUE that GC must mark.
+ * When unset, u3 is a non-VALUE (cnt/state). */
+#define MEMO_U3_IS_VALUE IMEMO_FL_USER0
+
 /*! MEMO
  *
  * @see imemo_type
  * */
 struct MEMO {
     VALUE flags;
-    VALUE reserved;
     const VALUE v1;
     const VALUE v2;
     union {
         long cnt;
         long state;
         const VALUE value;
-        void (*func)(void);
     } u3;
 };
 
-#define IMEMO_NEW(T, type, v0) ((T *)rb_imemo_new((type), (v0)))
+#define IMEMO_NEW(T, type, v0) ((T *)rb_imemo_new((type), (v0), sizeof(T), false))
+#define SHAREABLE_IMEMO_NEW(T, type, v0) ((T *)rb_imemo_new((type), (v0), sizeof(T), true))
 
 /* ment is in method.h */
 
@@ -130,46 +141,27 @@ struct MEMO {
 #ifndef RUBY_RUBYPARSER_H
 typedef struct rb_imemo_tmpbuf_struct rb_imemo_tmpbuf_t;
 #endif
-rb_imemo_tmpbuf_t *rb_imemo_tmpbuf_parser_heap(void *buf, rb_imemo_tmpbuf_t *old_heap, size_t cnt);
+VALUE rb_imemo_new(enum imemo_type type, VALUE v0, size_t size, bool is_shareable);
+VALUE rb_imemo_tmpbuf_new(void);
+struct MEMO *rb_imemo_memo_new(VALUE a, VALUE b, long c);
+struct MEMO *rb_imemo_memo_new_value(VALUE a, VALUE b, VALUE c);
 struct vm_ifunc *rb_vm_ifunc_new(rb_block_call_func_t func, const void *data, int min_argc, int max_argc);
 static inline enum imemo_type imemo_type(VALUE imemo);
 static inline int imemo_type_p(VALUE imemo, enum imemo_type imemo_type);
 static inline bool imemo_throw_data_p(VALUE imemo);
 static inline struct vm_ifunc *rb_vm_ifunc_proc_new(rb_block_call_func_t func, const void *data);
-static inline VALUE rb_imemo_tmpbuf_auto_free_pointer(void);
 static inline void *RB_IMEMO_TMPBUF_PTR(VALUE v);
-static inline void *rb_imemo_tmpbuf_set_ptr(VALUE v, void *ptr);
-static inline VALUE rb_imemo_tmpbuf_auto_free_pointer_new_from_an_RString(VALUE str);
 static inline void MEMO_V1_SET(struct MEMO *m, VALUE v);
 static inline void MEMO_V2_SET(struct MEMO *m, VALUE v);
 
 size_t rb_imemo_memsize(VALUE obj);
-void rb_cc_table_mark(VALUE klass);
 void rb_imemo_mark_and_move(VALUE obj, bool reference_updating);
-void rb_cc_table_free(VALUE klass);
 void rb_imemo_free(VALUE obj);
 
 RUBY_SYMBOL_EXPORT_BEGIN
-#if IMEMO_DEBUG
-VALUE rb_imemo_new_debug(enum imemo_type type, VALUE v0, const char *file, int line);
-#define rb_imemo_new(type, v1, v2, v3, v0) rb_imemo_new_debug(type, v1, v2, v3, v0, __FILE__, __LINE__)
-#else
-VALUE rb_imemo_new(enum imemo_type type, VALUE v0);
-#endif
 const char *rb_imemo_name(enum imemo_type type);
 RUBY_SYMBOL_EXPORT_END
 
-static inline struct MEMO *
-MEMO_NEW(VALUE a, VALUE b, VALUE c)
-{
-    struct MEMO *memo = IMEMO_NEW(struct MEMO, imemo_memo, 0);
-    *((VALUE *)&memo->v1) = a;
-    *((VALUE *)&memo->v2) = b;
-    *((VALUE *)&memo->u3.value) = c;
-
-    return memo;
-}
-
 static inline enum imemo_type
 imemo_type(VALUE imemo)
 {
@@ -205,12 +197,6 @@ rb_vm_ifunc_proc_new(rb_block_call_func_t func, const void *data)
     return rb_vm_ifunc_new(func, data, 0, UNLIMITED_ARGUMENTS);
 }
 
-static inline VALUE
-rb_imemo_tmpbuf_auto_free_pointer(void)
-{
-    return rb_imemo_new(imemo_tmpbuf, 0);
-}
-
 static inline void *
 RB_IMEMO_TMPBUF_PTR(VALUE v)
 {
@@ -218,30 +204,16 @@ RB_IMEMO_TMPBUF_PTR(VALUE v)
     return p->ptr;
 }
 
-static inline void *
-rb_imemo_tmpbuf_set_ptr(VALUE v, void *ptr)
-{
-    return ((rb_imemo_tmpbuf_t *)v)->ptr = ptr;
-}
-
 static inline VALUE
-rb_imemo_tmpbuf_auto_free_pointer_new_from_an_RString(VALUE str)
+rb_imemo_tmpbuf_new_from_an_RString(VALUE str)
 {
-    const void *src;
     VALUE imemo;
-    rb_imemo_tmpbuf_t *tmpbuf;
-    void *dst;
     size_t len;
 
     StringValue(str);
-    /* create tmpbuf to keep the pointer before xmalloc */
-    imemo = rb_imemo_tmpbuf_auto_free_pointer();
-    tmpbuf = (rb_imemo_tmpbuf_t *)imemo;
     len = RSTRING_LEN(str);
-    src = RSTRING_PTR(str);
-    dst = ruby_xmalloc(len);
-    memcpy(dst, src, len);
-    tmpbuf->ptr = dst;
+    rb_alloc_tmp_buffer(&imemo, len);
+    memcpy(RB_IMEMO_TMPBUF_PTR(imemo), RSTRING_PTR(str), len);
     return imemo;
 }
 
@@ -257,4 +229,108 @@ MEMO_V2_SET(struct MEMO *m, VALUE v)
     RB_OBJ_WRITE(m, &m->v2, v);
 }
 
+VALUE rb_imemo_cdhash_new(size_t size, const struct st_hash_type *type);
+
+static inline st_table *
+rb_imemo_cdhash_tbl(VALUE obj)
+{
+    RUBY_ASSERT(IMEMO_TYPE_P(obj, imemo_cdhash));
+    return &((struct rb_imemo_cdhash *)obj)->tbl;
+}
+
+struct rb_fields {
+    struct RBasic basic;
+    union {
+        struct {
+            VALUE fields[1];
+        } embed;
+        struct {
+            VALUE *ptr;
+        } external;
+        struct {
+            // Note: the st_table could be embedded, but complex T_CLASS should be rare to
+            // non-existent, so not really worth the trouble.
+            st_table *table;
+        } complex;
+    } as;
+};
+
+// IMEMO/fields and T_OBJECT have exactly the same layout.
+// This is useful for JIT and common codepaths.
+#define OBJ_FIELD_HEAP ROBJECT_HEAP
+STATIC_ASSERT(imemo_fields_flags, OBJ_FIELD_HEAP == IMEMO_FL_USER0);
+STATIC_ASSERT(imemo_fields_embed_offset, offsetof(struct RObject, as.ary) == offsetof(struct rb_fields, as.embed.fields));
+STATIC_ASSERT(imemo_fields_external_offset, offsetof(struct RObject, as.heap.fields) == offsetof(struct rb_fields, as.external.ptr));
+STATIC_ASSERT(imemo_fields_complex_offset, offsetof(struct RObject, as.heap.fields) == offsetof(struct rb_fields, as.complex.table));
+
+#define IMEMO_OBJ_FIELDS(fields) ((struct rb_fields *)fields)
+
+#define IMEMO_SUBCLASSES_HEAP IMEMO_FL_USER0
+
+struct rb_subclasses {
+    VALUE flags;
+    uint32_t count;
+    uint32_t capacity;
+    union {
+        VALUE *external;
+        VALUE embed[1];
+    } as;
+};
+
+static inline VALUE *
+rb_imemo_subclasses_entries(VALUE v)
+{
+    struct rb_subclasses *s = (struct rb_subclasses *)v;
+    return FL_TEST_RAW(v, IMEMO_SUBCLASSES_HEAP) ? s->as.external : s->as.embed;
+}
+
+VALUE rb_imemo_fields_new(VALUE owner, /* shape_id_t */ uint32_t shape_id, bool shareable);
+VALUE rb_imemo_subclasses_new(uint32_t capacity);
+VALUE rb_imemo_fields_new_complex(VALUE owner, /* shape_id_t */ uint32_t shape_id, size_t capa, bool shareable);
+VALUE rb_imemo_fields_new_complex_tbl(VALUE owner, /* shape_id_t */ uint32_t shape_id, st_table *tbl, bool shareable);
+VALUE rb_imemo_fields_clone(VALUE fields_obj);
+void rb_imemo_fields_clear(VALUE fields_obj);
+
+static inline VALUE
+rb_imemo_fields_owner(VALUE fields_obj)
+{
+    RUBY_ASSERT(IMEMO_TYPE_P(fields_obj, imemo_fields));
+
+    return CLASS_OF(fields_obj);
+}
+
+static inline VALUE *
+rb_imemo_fields_ptr(VALUE fields_obj)
+{
+    if (!fields_obj) {
+        return NULL;
+    }
+
+    RUBY_ASSERT(IMEMO_TYPE_P(fields_obj, imemo_fields) || RB_TYPE_P(fields_obj, T_OBJECT));
+
+    if (UNLIKELY(FL_TEST_RAW(fields_obj, OBJ_FIELD_HEAP))) {
+        return IMEMO_OBJ_FIELDS(fields_obj)->as.external.ptr;
+    }
+    else {
+        return IMEMO_OBJ_FIELDS(fields_obj)->as.embed.fields;
+    }
+}
+
+static inline st_table *
+rb_imemo_fields_complex_tbl(VALUE fields_obj)
+{
+    if (!fields_obj) {
+        return NULL;
+    }
+
+    RUBY_ASSERT(IMEMO_TYPE_P(fields_obj, imemo_fields) || RB_TYPE_P(fields_obj, T_OBJECT));
+    RUBY_ASSERT(FL_TEST_RAW(fields_obj, OBJ_FIELD_HEAP));
+
+    // Some codepaths unconditionally access the fields_ptr, and assume it can be used as st_table if the
+    // shape is complex.
+    RUBY_ASSERT((st_table *)rb_imemo_fields_ptr(fields_obj) == IMEMO_OBJ_FIELDS(fields_obj)->as.complex.table);
+
+    return IMEMO_OBJ_FIELDS(fields_obj)->as.complex.table;
+}
+
 #endif /* INTERNAL_IMEMO_H */
diff --git a/internal/inits.h b/internal/inits.h
index 03de289dd4..be73dac1dc 100644
--- a/internal/inits.h
+++ b/internal/inits.h
@@ -9,6 +9,10 @@
  * @brief      Internal header aggregating init functions.
  */
 
+/* box.c */
+void Init_enable_box(void);
+void Init_master_box(void);
+
 /* class.c */
 void Init_class_hierarchy(void);
 
diff --git a/internal/io.h b/internal/io.h
index 1891248a19..2110f0b087 100644
--- a/internal/io.h
+++ b/internal/io.h
@@ -14,10 +14,21 @@
 struct rb_io;
 
 #include "ruby/io.h"            /* for rb_io_t */
+#include "ccan/list/list.h"
+#include "serial.h"
 
-#define IO_WITHOUT_GVL(func, arg) rb_thread_call_without_gvl(func, arg, RUBY_UBF_IO, 0)
+#define IO_WITHOUT_GVL(func, arg) rb_nogvl(func, arg, RUBY_UBF_IO, 0, RB_NOGVL_OFFLOAD_SAFE)
 #define IO_WITHOUT_GVL_INT(func, arg) (int)(VALUE)IO_WITHOUT_GVL(func, arg)
 
+// Represents an in-flight blocking operation:
+struct rb_io_blocking_operation {
+    // The linked list data structure.
+    struct ccan_list_node list;
+
+    // The execution context of the blocking operation.
+    struct rb_execution_context_struct *ec;
+};
+
 /** Ruby's IO, metadata and buffers. */
 struct rb_io {
 
@@ -31,7 +42,7 @@ struct rb_io {
     int fd;
 
     /** mode flags: FMODE_XXXs */
-    int mode;
+    enum rb_io_mode mode;
 
     /** child's pid (for pipes) */
     rb_pid_t pid;
@@ -111,6 +122,18 @@ struct rb_io {
      * The timeout associated with this IO when performing blocking operations.
      */
     VALUE timeout;
+
+    /**
+     * Threads that are performing a blocking operation without the GVL using
+     * this IO. On calling IO#close, these threads will be interrupted so that
+     * the operation can be cancelled.
+     */
+    struct ccan_list_head blocking_operations;
+    struct rb_execution_context_struct *closing_ec;
+    VALUE wakeup_mutex;
+
+    // The fork generation of the blocking operations list.
+    rb_serial_t fork_generation;
 };
 
 /* io.c */
@@ -119,22 +142,23 @@ void rb_stdio_set_default_encoding(void);
 VALUE rb_io_flush_raw(VALUE, int);
 size_t rb_io_memsize(const rb_io_t *);
 int rb_stderr_tty_p(void);
-void rb_io_fptr_finalize_internal(void *ptr);
-#ifdef rb_io_fptr_finalize
-# undef rb_io_fptr_finalize
-#endif
-#define rb_io_fptr_finalize rb_io_fptr_finalize_internal
 VALUE rb_io_popen(VALUE pname, VALUE pmode, VALUE env, VALUE opt);
 
 VALUE rb_io_prep_stdin(void);
 VALUE rb_io_prep_stdout(void);
 VALUE rb_io_prep_stderr(void);
 
+int rb_io_notify_close(struct rb_io *fptr);
+bool rb_io_fptr_finalize_closed(struct rb_io *fptr);
+
 RUBY_SYMBOL_EXPORT_BEGIN
 /* io.c (export) */
 void rb_maygvl_fd_fix_cloexec(int fd);
 int rb_gc_for_fd(int err);
 void rb_write_error_str(VALUE mesg);
+
+VALUE rb_io_blocking_region_wait(struct rb_io *io, rb_blocking_function_t *function, void *argument, enum rb_io_event events);
+VALUE rb_io_blocking_region(struct rb_io *io, rb_blocking_function_t *function, void *argument);
 RUBY_SYMBOL_EXPORT_END
 
 #endif /* INTERNAL_IO_H */
diff --git a/internal/load.h b/internal/load.h
index d4c0bb91ba..6cffe0ce64 100644
--- a/internal/load.h
+++ b/internal/load.h
@@ -12,6 +12,8 @@
 
 /* load.c */
 VALUE rb_get_expanded_load_path(void);
+VALUE rb_load_entrypoint(VALUE fname, VALUE wrap);
+VALUE rb_require_relative_entrypoint(VALUE fname);
 int rb_require_internal(VALUE fname);
 NORETURN(void rb_load_fail(VALUE, const char*));
 
diff --git a/internal/numeric.h b/internal/numeric.h
index 6406cfc2fa..a24432df1e 100644
--- a/internal/numeric.h
+++ b/internal/numeric.h
@@ -10,9 +10,9 @@
  */
 #include "internal/bignum.h"    /* for BIGNUM_POSITIVE_P */
 #include "internal/bits.h"      /* for RUBY_BIT_ROTL */
+#include "internal/compar.h"    /* for rb_cmperr_reason */
 #include "internal/fixnum.h"    /* for FIXNUM_POSITIVE_P */
 #include "internal/vm.h"        /* for rb_method_basic_definition_p */
-#include "ruby/intern.h"        /* for rb_cmperr */
 #include "ruby/ruby.h"          /* for USE_FLONUM */
 
 #define ROUND_TO(mode, even, up, down) \
@@ -70,6 +70,7 @@ VALUE rb_float_minus(VALUE x, VALUE y);
 VALUE rb_int_mul(VALUE x, VALUE y);
 VALUE rb_float_mul(VALUE x, VALUE y);
 VALUE rb_float_div(VALUE x, VALUE y);
+VALUE rb_flo_to_i(VALUE num);
 VALUE rb_int_idiv(VALUE x, VALUE y);
 VALUE rb_int_modulo(VALUE x, VALUE y);
 VALUE rb_int2str(VALUE num, int base);
@@ -78,6 +79,7 @@ VALUE rb_int_gt(VALUE x, VALUE y);
 VALUE rb_float_gt(VALUE x, VALUE y);
 VALUE rb_int_ge(VALUE x, VALUE y);
 enum ruby_num_rounding_mode rb_num_get_rounding_option(VALUE opts);
+VALUE rb_int_fdiv(VALUE x, VALUE y);
 double rb_int_fdiv_double(VALUE x, VALUE y);
 VALUE rb_int_pow(VALUE x, VALUE y);
 VALUE rb_float_pow(VALUE x, VALUE y);
@@ -85,6 +87,7 @@ VALUE rb_int_cmp(VALUE x, VALUE y);
 VALUE rb_int_equal(VALUE x, VALUE y);
 VALUE rb_int_divmod(VALUE x, VALUE y);
 VALUE rb_int_and(VALUE x, VALUE y);
+VALUE rb_int_xor(VALUE x, VALUE y);
 VALUE rb_int_lshift(VALUE x, VALUE y);
 VALUE rb_int_rshift(VALUE x, VALUE y);
 VALUE rb_int_div(VALUE x, VALUE y);
@@ -126,6 +129,54 @@ VALUE rb_int_bit_length(VALUE num);
 VALUE rb_int_uminus(VALUE num);
 VALUE rb_int_comp(VALUE num);
 
+// Unified 128-bit integer structures that work with or without native support:
+union rb_uint128 {
+#ifdef WORDS_BIGENDIAN
+    struct {
+        uint64_t high;
+        uint64_t low;
+    } parts;
+#else
+    struct {
+        uint64_t low;
+        uint64_t high;
+    } parts;
+#endif
+#ifdef HAVE_UINT128_T
+    uint128_t value;
+#endif
+};
+typedef union rb_uint128 rb_uint128_t;
+
+union rb_int128 {
+#ifdef WORDS_BIGENDIAN
+    struct {
+        uint64_t high;
+        uint64_t low;
+    } parts;
+#else
+    struct {
+        uint64_t low;
+        uint64_t high;
+    } parts;
+#endif
+#ifdef HAVE_UINT128_T
+    int128_t value;
+#endif
+};
+typedef union rb_int128 rb_int128_t;
+
+union uint128_int128_conversion {
+    rb_uint128_t uint128;
+    rb_int128_t int128;
+};
+
+// Conversion functions for 128-bit integers:
+rb_uint128_t rb_numeric_to_uint128(VALUE x);
+rb_int128_t rb_numeric_to_int128(VALUE x);
+VALUE rb_uint128_to_numeric(rb_uint128_t n);
+VALUE rb_int128_to_numeric(rb_int128_t n);
+
 static inline bool
 INT_POSITIVE_P(VALUE num)
 {
@@ -160,7 +211,7 @@ rb_num_compare_with_zero(VALUE num, ID mid)
     VALUE zero = INT2FIX(0);
     VALUE r = rb_check_funcall(num, mid, 1, &zero);
     if (RB_UNDEF_P(r)) {
-        rb_cmperr(num, zero);
+        rb_cmperr_reason(num, zero, "unable to compare with zero");
     }
     return r;
 }
diff --git a/internal/object.h b/internal/object.h
index 92ad37fdc8..99aa1f524b 100644
--- a/internal/object.h
+++ b/internal/object.h
@@ -11,7 +11,7 @@
 #include "ruby/ruby.h"          /* for VALUE */
 
 /* object.c */
-size_t rb_obj_embedded_size(uint32_t numiv);
+
 VALUE rb_class_allocate_instance(VALUE klass);
 VALUE rb_class_search_ancestor(VALUE klass, VALUE super);
 NORETURN(void rb_undefined_alloc(VALUE klass));
@@ -60,4 +60,13 @@ RBASIC_SET_CLASS(VALUE obj, VALUE klass)
     RBASIC_SET_CLASS_RAW(obj, klass);
     RB_OBJ_WRITTEN(obj, oldv, klass);
 }
+
+static inline size_t
+rb_obj_embedded_size(uint32_t fields_count)
+{
+    size_t size = offsetof(struct RObject, as.ary) + (sizeof(VALUE) * fields_count);
+    // Ensure enough room for the heap pointer if this expands
+    if (size < sizeof(struct RObject)) size = sizeof(struct RObject);
+    return size;
+}
 #endif /* INTERNAL_OBJECT_H */
diff --git a/internal/parse.h b/internal/parse.h
index 4a9c4acf8a..8e04664ae8 100644
--- a/internal/parse.h
+++ b/internal/parse.h
@@ -12,6 +12,17 @@
 #include "rubyparser.h"
 #include "internal/static_assert.h"
 
+// The default parser to use for Ruby code.
+typedef enum {
+    RB_DEFAULT_PARSER_PARSE_Y,
+    RB_DEFAULT_PARSER_PRISM,
+} ruby_default_parser_enum;
+
+ruby_default_parser_enum rb_ruby_default_parser(void);
+void rb_ruby_default_parser_set(ruby_default_parser_enum parser);
+
+#define rb_ruby_prism_p() (rb_ruby_default_parser() == RB_DEFAULT_PARSER_PRISM)
+
 #ifdef UNIVERSAL_PARSER
 #define rb_encoding const void
 #endif
@@ -63,12 +74,15 @@ rb_encoding *rb_ruby_parser_encoding(rb_parser_t *p);
 int rb_ruby_parser_end_seen_p(rb_parser_t *p);
 int rb_ruby_parser_set_yydebug(rb_parser_t *p, int flag);
 rb_parser_string_t *rb_str_to_parser_string(rb_parser_t *p, VALUE str);
+void rb_parser_string_free(rb_parser_t *p, rb_parser_string_t *str);
 
 int rb_parser_dvar_defined_ref(struct parser_params*, ID, ID**);
 ID rb_parser_internal_id(struct parser_params*);
-int rb_parser_reg_fragment_check(struct parser_params*, rb_parser_string_t*, int);
-int rb_reg_named_capture_assign_iter_impl(struct parser_params *p, const char *s, long len, rb_encoding *enc, NODE **succ_block, const rb_code_location_t *loc);
+typedef void (*rb_parser_reg_fragment_error_func)(struct parser_params *, VALUE);
+int rb_parser_reg_fragment_check(struct parser_params*, rb_parser_string_t*, int, rb_parser_reg_fragment_error_func);
+int rb_reg_named_capture_assign_iter_impl(struct parser_params *p, const char *s, long len, rb_encoding *enc, NODE **succ_block, const rb_code_location_t *loc, rb_parser_assignable_func assignable);
 int rb_parser_local_defined(struct parser_params *p, ID id, const struct rb_iseq_struct *iseq);
+NODE *rb_parser_assignable(struct parser_params *p, ID id, NODE *val, const YYLTYPE *loc);
 
 RUBY_SYMBOL_EXPORT_END
 
@@ -97,7 +111,7 @@ VALUE rb_ruby_parser_ruby_sourcefile_string(rb_parser_t *p);
 int rb_ruby_parser_ruby_sourceline(rb_parser_t *p);
 int rb_ruby_parser_lex_state(rb_parser_t *p);
 void rb_ruby_ripper_parse0(rb_parser_t *p);
-int rb_ruby_ripper_dedent_string(rb_parser_t *p, VALUE string, int width);
+int rb_ruby_ripper_dedent_string(rb_parser_t *p, rb_parser_string_t *string, int width);
 int rb_ruby_ripper_initialized_p(rb_parser_t *p);
 void rb_ruby_ripper_parser_initialize(rb_parser_t *p);
 long rb_ruby_ripper_column(rb_parser_t *p);
diff --git a/internal/proc.h b/internal/proc.h
index c75f15b283..24a077ca6d 100644
--- a/internal/proc.h
+++ b/internal/proc.h
@@ -22,7 +22,7 @@ int rb_block_min_max_arity(int *max);
 VALUE rb_block_to_s(VALUE self, const struct rb_block *block, const char *additional_info);
 VALUE rb_callable_receiver(VALUE);
 
-VALUE rb_func_proc_new(rb_block_call_func_t func, VALUE val);
+VALUE rb_func_proc_dup(VALUE src_obj);
 VALUE rb_func_lambda_new(rb_block_call_func_t func, VALUE val, int min_argc, int max_argc);
 VALUE rb_iseq_location(const struct rb_iseq_struct *iseq);
 VALUE rb_sym_to_proc(VALUE sym);
diff --git a/internal/ractor.h b/internal/ractor.h
index eef5ffdb89..a65907a05a 100644
--- a/internal/ractor.h
+++ b/internal/ractor.h
@@ -3,4 +3,8 @@
 
 void rb_ractor_ensure_main_ractor(const char *msg);
 
+RUBY_SYMBOL_EXPORT_BEGIN
+void rb_ractor_setup_belonging(VALUE obj);
+RUBY_SYMBOL_EXPORT_END
+
 #endif /* INTERNAL_RACTOR_H */
diff --git a/internal/range.h b/internal/range.h
index 2394937bf8..80493ce13e 100644
--- a/internal/range.h
+++ b/internal/range.h
@@ -18,19 +18,19 @@ static inline VALUE RANGE_EXCL(VALUE r);
 static inline VALUE
 RANGE_BEG(VALUE r)
 {
-    return RSTRUCT(r)->as.ary[0];
+    return RSTRUCT_GET_RAW(r, 0);
 }
 
 static inline VALUE
 RANGE_END(VALUE r)
 {
-    return RSTRUCT_GET(r, 1);
+    return RSTRUCT_GET_RAW(r, 1);
 }
 
 static inline VALUE
 RANGE_EXCL(VALUE r)
 {
-    return RSTRUCT_GET(r, 2);
+    return RSTRUCT_GET_RAW(r, 2);
 }
 
 VALUE
diff --git a/internal/rational.h b/internal/rational.h
index f11fab4583..6861a90130 100644
--- a/internal/rational.h
+++ b/internal/rational.h
@@ -28,6 +28,7 @@ VALUE rb_rational_plus(VALUE self, VALUE other);
 VALUE rb_rational_minus(VALUE self, VALUE other);
 VALUE rb_rational_mul(VALUE self, VALUE other);
 VALUE rb_rational_div(VALUE self, VALUE other);
+VALUE rb_rational_fdiv(VALUE self, VALUE other);
 VALUE rb_lcm(VALUE x, VALUE y);
 VALUE rb_rational_reciprocal(VALUE x);
 VALUE rb_cstr_to_rat(const char *, int);
@@ -37,7 +38,9 @@ VALUE rb_rational_cmp(VALUE self, VALUE other);
 VALUE rb_rational_pow(VALUE self, VALUE other);
 VALUE rb_rational_floor(VALUE self, int ndigits);
 VALUE rb_numeric_quo(VALUE x, VALUE y);
-VALUE rb_flo_round_by_rational(int argc, VALUE *argv, VALUE num);
+VALUE rb_flo_round_by_rational(VALUE num, int ndigits, enum ruby_num_rounding_mode mode);
+VALUE rb_flo_ceil_by_rational(VALUE num, int ndigits);
+VALUE rb_flo_floor_by_rational(VALUE num, int ndigits);
 VALUE rb_float_numerator(VALUE x);
 VALUE rb_float_denominator(VALUE x);
 
@@ -68,4 +71,22 @@ RATIONAL_SET_DEN(VALUE r, VALUE d)
     RB_OBJ_WRITE(r, &RRATIONAL(r)->den, d);
 }
 
+inline static bool
+f_zero_p(VALUE x)
+{
+    if (RB_INTEGER_TYPE_P(x)) {
+        return FIXNUM_ZERO_P(x);
+    }
+    else if (RB_FLOAT_TYPE_P(x)) {
+        return FLOAT_ZERO_P(x);
+    }
+    else if (RB_TYPE_P(x, T_RATIONAL)) {
+        const VALUE num = RRATIONAL(x)->num;
+        return FIXNUM_ZERO_P(num);
+    }
+    return rb_equal(x, INT2FIX(0)) != 0;
+}
+
+#define f_nonzero_p(x) (!f_zero_p(x))
+
 #endif /* INTERNAL_RATIONAL_H */
diff --git a/internal/re.h b/internal/re.h
index 3e20114665..6c0aee6d06 100644
--- a/internal/re.h
+++ b/internal/re.h
@@ -10,19 +10,70 @@
  */
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/ruby.h"          /* for VALUE */
+#include "ruby/re.h"            /* for struct RMatch and struct re_registers */
+
+#define RMATCH_ONIG FL_USER1
+#define RMATCH_OFFSETS_EXTERNAL FL_USER2
+
+static inline OnigPosition *
+RMATCH_BEG_PTR(VALUE match)
+{
+    if (FL_TEST_RAW(match, RMATCH_ONIG)) {
+        return RMATCH(match)->as.onig.beg;
+    }
+    else {
+        return &RMATCH(match)->as.embed[0];
+    }
+}
+
+static inline OnigPosition *
+RMATCH_END_PTR(VALUE match)
+{
+    if (FL_TEST_RAW(match, RMATCH_ONIG)) {
+        return RMATCH(match)->as.onig.end;
+    }
+    else {
+        return &RMATCH(match)->as.embed[RMATCH(match)->num_regs];
+    }
+}
+
+static inline long
+RMATCH_BEG(VALUE match, int i)
+{
+    return RMATCH_BEG_PTR(match)[i];
+}
+
+static inline long
+RMATCH_END(VALUE match, int i)
+{
+    return RMATCH_END_PTR(match)[i];
+}
+
+static inline int
+RMATCH_NREGS(VALUE match)
+{
+    return RMATCH(match)->num_regs;
+}
 
 /* re.c */
+VALUE rb_reg_s_alloc(VALUE klass);
 VALUE rb_reg_compile(VALUE str, int options, const char *sourcefile, int sourceline);
 VALUE rb_reg_check_preprocess(VALUE);
-long rb_reg_search0(VALUE, VALUE, long, int, int);
+long rb_reg_search0(VALUE, VALUE, long, int, int, VALUE *);
 VALUE rb_reg_match_p(VALUE re, VALUE str, long pos);
+VALUE rb_reg_regsub_match(VALUE str, VALUE src, VALUE match);
 bool rb_reg_start_with_p(VALUE re, VALUE str);
 VALUE rb_reg_hash(VALUE re);
 VALUE rb_reg_equal(VALUE re1, VALUE re2);
-void rb_backref_set_string(VALUE string, long pos, long len);
+VALUE rb_backref_set_string(VALUE string, long pos, long len);
 void rb_match_unbusy(VALUE);
 int rb_match_count(VALUE match);
-VALUE rb_reg_new_ary(VALUE ary, int options);
+VALUE rb_reg_new_from_values(long cnt, const VALUE *elements, int opt);
 VALUE rb_reg_last_defined(VALUE match);
 
+#define ARG_REG_OPTION_MASK \
+    (ONIG_OPTION_IGNORECASE|ONIG_OPTION_MULTILINE|ONIG_OPTION_EXTEND)
+#define ARG_ENCODING_FIXED    16
+#define ARG_ENCODING_NONE     32
+
 #endif /* INTERNAL_RE_H */
diff --git a/internal/sanitizers.h b/internal/sanitizers.h
index b0eb1fc851..feafb4e616 100644
--- a/internal/sanitizers.h
+++ b/internal/sanitizers.h
@@ -16,7 +16,7 @@
 #endif
 
 #ifdef HAVE_SANITIZER_ASAN_INTERFACE_H
-# if __has_feature(address_sanitizer)
+# if __has_feature(address_sanitizer) || defined(__SANITIZE_ADDRESS__)
 #  define RUBY_ASAN_ENABLED
 #  include <sanitizer/asan_interface.h>
 # endif
@@ -29,6 +29,13 @@
 # endif
 #endif
 
+#ifdef HAVE_SANITIZER_TSAN_INTERFACE_H
+# if __has_feature(thread_sanitizer) || defined(__SANITIZE_THREAD__)
+#  define RUBY_TSAN_ENABLED
+#  include <sanitizer/tsan_interface.h>
+# endif
+#endif
+
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/ruby.h"          /* for VALUE */
 
@@ -39,6 +46,12 @@
 #elif defined(RUBY_ASAN_ENABLED)
 # define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
     __attribute__((__no_sanitize__("address"), __noinline__)) x
+#elif defined(RUBY_MSAN_ENABLED)
+    # define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
+    __attribute__((__no_sanitize__("memory"), __noinline__)) x
+#elif defined(RUBY_TSAN_ENABLED)
+# define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
+    __attribute__((__no_sanitize__("thread"), __noinline__)) x
 #elif defined(NO_SANITIZE_ADDRESS)
 # define ATTRIBUTE_NO_ADDRESS_SAFETY_ANALYSIS(x) \
     NO_SANITIZE_ADDRESS(NOINLINE(x))
@@ -54,10 +67,11 @@
 # include "internal/warnings.h"
 # undef NO_SANITIZE
 # define NO_SANITIZE(x, y) \
-    COMPILER_WARNING_PUSH; \
-    COMPILER_WARNING_IGNORED(-Wattributes); \
+    COMPILER_WARNING_PUSH \
+    COMPILER_WARNING_IGNORED(-Wattributes) \
     __attribute__((__no_sanitize__(x))) y; \
-    COMPILER_WARNING_POP
+    COMPILER_WARNING_POP \
+    y
 #endif
 
 #ifndef NO_SANITIZE
@@ -115,26 +129,23 @@ asan_poison_memory_region(const volatile void *ptr, size_t size)
     __asan_poison_memory_region(ptr, size);
 }
 
-/**
- * This is a variant of asan_poison_memory_region that takes a VALUE.
- *
- * @param[in]  obj   target object.
- */
-static inline void
-asan_poison_object(VALUE obj)
-{
-    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
-    asan_poison_memory_region(ptr, SIZEOF_VALUE);
-}
-
 #ifdef RUBY_ASAN_ENABLED
 #define asan_poison_object_if(ptr, obj) do { \
-        if (ptr) asan_poison_object(obj); \
+        if (ptr) rb_asan_poison_object(obj); \
     } while (0)
 #else
 #define asan_poison_object_if(ptr, obj) ((void)(ptr), (void)(obj))
 #endif
 
+#ifdef RUBY_ASAN_ENABLED
+RUBY_SYMBOL_EXPORT_BEGIN
+/**
+ * This is a variant of asan_poison_memory_region that takes a VALUE.
+ *
+ * @param[in]  obj   target object.
+ */
+void rb_asan_poison_object(VALUE obj);
+
 /**
  * This function predicates if the given object is fully addressable or not.
  *
@@ -142,12 +153,22 @@ asan_poison_object(VALUE obj)
  * @retval     0          the given object is fully addressable.
  * @retval     otherwise  pointer to first such byte who is poisoned.
  */
-static inline void *
-asan_poisoned_object_p(VALUE obj)
-{
-    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
-    return __asan_region_is_poisoned(ptr, SIZEOF_VALUE);
-}
+void *rb_asan_poisoned_object_p(VALUE obj);
+
+/**
+ * This is a variant of asan_unpoison_memory_region that takes a VALUE.
+ *
+ * @param[in]  obj       target object.
+ * @param[in]  malloc_p  if the memory region is like a malloc's return value or not.
+ */
+void rb_asan_unpoison_object(VALUE obj, bool newobj_p);
+
+RUBY_SYMBOL_EXPORT_END
+#else
+# define rb_asan_poison_object(obj) ((void)obj)
+# define rb_asan_poisoned_object_p(obj) ((void)obj, NULL)
+# define rb_asan_unpoison_object(obj, newobj_p) ((void)obj, (void)newobj_p)
+#endif
 
 /**
  * This function asserts that a (formally poisoned) memory region from ptr to
@@ -176,24 +197,11 @@ asan_unpoison_memory_region(const volatile void *ptr, size_t size, bool malloc_p
     }
 }
 
-/**
- * This is a variant of asan_unpoison_memory_region that takes a VALUE.
- *
- * @param[in]  obj       target object.
- * @param[in]  malloc_p  if the memory region is like a malloc's return value or not.
- */
-static inline void
-asan_unpoison_object(VALUE obj, bool newobj_p)
-{
-    MAYBE_UNUSED(struct RVALUE *) ptr = (void *)obj;
-    asan_unpoison_memory_region(ptr, SIZEOF_VALUE, newobj_p);
-}
-
 static inline void *
 asan_unpoison_object_temporary(VALUE obj)
 {
-    void *ptr = asan_poisoned_object_p(obj);
-    asan_unpoison_object(obj, false);
+    void *ptr = rb_asan_poisoned_object_p(obj);
+    rb_asan_unpoison_object(obj, false);
     return ptr;
 }
 
@@ -201,11 +209,40 @@ static inline void *
 asan_poison_object_restore(VALUE obj, void *ptr)
 {
     if (ptr) {
-        asan_poison_object(obj);
+        rb_asan_poison_object(obj);
     }
     return NULL;
 }
 
+#define asan_unpoisoning_object(obj) \
+    for (void *poisoned = asan_unpoison_object_temporary(obj), \
+              *unpoisoning = &poisoned; /* flag to loop just once */ \
+         unpoisoning; \
+         unpoisoning = asan_poison_object_restore(obj, poisoned))
+
+
+static inline void *
+asan_unpoison_memory_region_temporary(void *ptr, size_t len)
+{
+    void *poisoned_ptr = __asan_region_is_poisoned(ptr, len);
+    asan_unpoison_memory_region(ptr, len, false);
+    return poisoned_ptr;
+}
+
+static inline void *
+asan_poison_memory_region_restore(void *ptr, size_t len, void *poisoned_ptr)
+{
+    if (poisoned_ptr) {
+        asan_poison_memory_region(ptr, len);
+    }
+    return NULL;
+}
+
+#define asan_unpoisoning_memory_region(ptr, len) \
+    for (void *poisoned = asan_unpoison_memory_region_temporary(ptr, len), \
+              *unpoisoning = &poisoned; /* flag to loop just once */ \
+         unpoisoning; \
+         unpoisoning = asan_poison_memory_region_restore(ptr, len, poisoned))
 
 /**
  * Checks if the given pointer is on an ASAN fake stack. If so, it returns the
@@ -293,5 +330,17 @@ asan_get_fake_stack_extents(void *thread_fake_stack_handle, VALUE slot,
     return false;
 }
 
+extern const char ruby_asan_default_options[];
+
+#ifdef RUBY_ASAN_ENABLED
+/* Compile in the ASAN options Ruby needs, rather than relying on environment variables, so
+ * that even tests which fork ruby with a clean environment will run ASAN with the right
+ * settings */
+# undef RUBY__ASAN_DEFAULT_OPTIONS
+# define RUBY__ASAN_DEFAULT_OPTIONS \
+    RBIMPL_SYMBOL_EXPORT_BEGIN() \
+    const char * __asan_default_options(void) {return ruby_asan_default_options;} \
+    RBIMPL_SYMBOL_EXPORT_END()
+#endif
 
 #endif /* INTERNAL_SANITIZERS_H */
diff --git a/internal/set_table.h b/internal/set_table.h
new file mode 100644
index 0000000000..3876a8935e
--- /dev/null
+++ b/internal/set_table.h
@@ -0,0 +1,74 @@
+#ifndef INTERNAL_SET_TABLE_H
+#define INTERNAL_SET_TABLE_H
+
+#include "ruby/st.h"
+
+struct set_table_entry;
+
+typedef struct set_table_entry set_table_entry;
+
+struct set_table {
+    /* Cached features of the table -- see st.c for more details.  */
+    unsigned char entry_power, bin_power, size_ind;
+    /* How many times the table was rebuilt.  */
+    unsigned int rebuilds_num;
+    const struct st_hash_type *type;
+    /* Number of entries currently in the table.  */
+    st_index_t num_entries;
+
+    /* Start and bound index of entries in array entries.
+       entries_starts and entries_bound are in interval
+       [0,allocated_entries].  */
+    st_index_t entries_start, entries_bound;
+
+    /**
+     * Array of size 2^entry_power.
+     * Followed by st_index_t *bins, Array of bins used for access by keys.
+     */
+    set_table_entry *entries;
+};
+
+typedef struct set_table set_table;
+
+typedef int set_foreach_callback_func(st_data_t, st_data_t);
+typedef int set_foreach_check_callback_func(st_data_t, st_data_t, int);
+typedef int set_update_callback_func(st_data_t *key, st_data_t arg, int existing);
+
+#define set_table_size rb_set_table_size
+size_t rb_set_table_size(const struct set_table *tbl);
+#define set_init_table_with_size rb_set_init_table_with_size
+set_table *rb_set_init_table_with_size(set_table *tab, const struct st_hash_type *, st_index_t);
+#define set_init_numtable rb_set_init_numtable
+set_table *rb_set_init_numtable(void);
+#define set_init_numtable_with_size rb_set_init_numtable_with_size
+set_table *rb_set_init_numtable_with_size(st_index_t size);
+#define set_init_embedded_numtable_with_size rb_set_init_embedded_numtable_with_size
+set_table *rb_set_init_embedded_numtable_with_size(struct set_table *tbl, st_index_t size);
+#define set_table_delete rb_set_table_delete
+int rb_set_table_delete(set_table *, st_data_t *); /* returns 0:notfound 1:deleted */
+#define set_insert rb_set_insert
+int rb_set_insert(set_table *, st_data_t);
+#define set_table_lookup rb_set_table_lookup
+int rb_set_table_lookup(set_table *, st_data_t);
+#define set_foreach_with_replace rb_set_foreach_with_replace
+int rb_set_foreach_with_replace(set_table *tab, set_foreach_check_callback_func *func, set_update_callback_func *replace, st_data_t arg);
+#define set_table_foreach rb_set_table_foreach
+int rb_set_table_foreach(set_table *, set_foreach_callback_func *, st_data_t);
+#define set_foreach_check rb_set_foreach_check
+int rb_set_foreach_check(set_table *, set_foreach_check_callback_func *, st_data_t, st_data_t);
+#define set_keys rb_set_keys
+st_index_t rb_set_keys(set_table *table, st_data_t *keys, st_index_t size);
+#define set_free_table rb_set_free_table
+void rb_set_free_table(set_table *);
+#define set_free_embedded_table rb_set_free_embedded_table
+void set_free_embedded_table(set_table *tab);
+#define set_table_clear rb_set_table_clear
+void rb_set_table_clear(set_table *);
+#define set_copy rb_set_copy
+set_table *rb_set_copy(set_table *new_table, set_table *old_table);
+#define set_memsize rb_set_memsize
+PUREFUNC(size_t rb_set_memsize(const set_table *));
+#define set_compact_table rb_set_compact_table
+void set_compact_table(set_table *tab);
+
+#endif
diff --git a/internal/signal.h b/internal/signal.h
index 2363bf412c..904747e226 100644
--- a/internal/signal.h
+++ b/internal/signal.h
@@ -19,6 +19,7 @@ void (*ruby_posix_signal(int, void (*)(int)))(int);
 
 RUBY_SYMBOL_EXPORT_BEGIN
 /* signal.c (export) */
+void rb_signal_atfork(void);
 RUBY_SYMBOL_EXPORT_END
 
 #endif /* INTERNAL_SIGNAL_H */
diff --git a/internal/st.h b/internal/st.h
index a26b224505..14dcb25511 100644
--- a/internal/st.h
+++ b/internal/st.h
@@ -1,11 +1,20 @@
 #ifndef INTERNAL_ST_H
 #define INTERNAL_ST_H
 
-#include "include/ruby/st.h"
+#include "ruby/st.h"
 
 st_table *rb_st_replace(st_table *new_tab, st_table *old_tab);
 #define st_replace rb_st_replace
 st_table *rb_st_init_existing_table_with_size(st_table *tab, const struct st_hash_type *type, st_index_t size);
 #define st_init_existing_table_with_size rb_st_init_existing_table_with_size
 
+st_table *rb_st_init_existing_numtable_with_size(st_table *tab, st_index_t size);
+#define st_init_existing_numtable_with_size rb_st_init_existing_numtable_with_size
+
+st_table *rb_st_init_existing_strtable_with_size(st_table *tab, st_index_t size);
+#define st_init_existing_strtable_with_size rb_st_init_existing_strtable_with_size
+
+void rb_st_free_embedded_table(st_table *tab);
+#define st_free_embedded_table rb_st_free_embedded_table
+
 #endif
diff --git a/internal/string.h b/internal/string.h
index 3533766ffb..94a46a9657 100644
--- a/internal/string.h
+++ b/internal/string.h
@@ -14,10 +14,13 @@
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/encoding.h"      /* for rb_encoding */
 #include "ruby/ruby.h"          /* for VALUE */
+#include "encindex.h"
 
-#define STR_NOEMBED      FL_USER1
-#define STR_SHARED       FL_USER2 /* = ELTS_SHARED */
-#define STR_CHILLED      FL_USER3
+#define STR_SHARED                  FL_USER0 /* = ELTS_SHARED */
+#define STR_NOEMBED                 FL_USER1
+#define STR_CHILLED                 (FL_USER2 | FL_USER3)
+#define STR_CHILLED_LITERAL         FL_USER2
+#define STR_CHILLED_SYMBOL_TO_S     FL_USER3
 
 enum ruby_rstring_private_flags {
     RSTRING_CHILLED = STR_CHILLED,
@@ -27,7 +30,41 @@ enum ruby_rstring_private_flags {
 # undef rb_fstring_cstr
 #endif
 
+static inline bool
+rb_str_encindex_fastpath(int encindex)
+{
+    // The overwhelming majority of strings are in one of these 3 encodings,
+    // which are all either ASCII or perfect ASCII supersets.
+    // Hence you can use fast, single byte algorithms on them, such as `memchr` etc,
+    // without all the overhead of fetching the rb_encoding and using functions such as
+    // rb_enc_mbminlen etc.
+    // Many other encodings could qualify, but they are expected to be rare occurrences,
+    // so it's better to keep that list small.
+    switch (encindex) {
+      case ENCINDEX_ASCII_8BIT:
+      case ENCINDEX_UTF_8:
+      case ENCINDEX_US_ASCII:
+        return true;
+      default:
+        return false;
+    }
+}
+
+static inline bool
+rb_str_enc_fastpath(VALUE str)
+{
+    return rb_str_encindex_fastpath(ENCODING_GET_INLINED(str));
+}
+
+static inline rb_encoding *
+rb_str_enc_get(VALUE str)
+{
+    RUBY_ASSERT(RB_TYPE_P(str, T_STRING));
+    return rb_enc_from_index(ENCODING_GET(str));
+}
+
 /* string.c */
+VALUE rb_str_dup_m(VALUE str);
 VALUE rb_fstring(VALUE);
 VALUE rb_fstring_cstr(const char *str);
 VALUE rb_fstring_enc_new(const char *ptr, long len, rb_encoding *enc);
@@ -51,6 +88,21 @@ int rb_enc_str_coderange_scan(VALUE str, rb_encoding *enc);
 int rb_ascii8bit_appendable_encoding_index(rb_encoding *enc, unsigned int code);
 VALUE rb_str_include(VALUE str, VALUE arg);
 VALUE rb_str_byte_substr(VALUE str, VALUE beg, VALUE len);
+VALUE rb_str_substr_two_fixnums(VALUE str, VALUE beg, VALUE len, int empty);
+VALUE rb_str_tmp_frozen_no_embed_acquire(VALUE str);
+void rb_str_make_embedded(VALUE);
+VALUE rb_str_upto_each(VALUE, VALUE, int, int (*each)(VALUE, VALUE), VALUE);
+size_t rb_str_size_as_embedded(VALUE);
+bool rb_str_reembeddable_p(VALUE);
+VALUE rb_str_upto_endless_each(VALUE, int (*each)(VALUE, VALUE), VALUE);
+VALUE rb_str_with_debug_created_info(VALUE, VALUE, int);
+VALUE rb_str_frozen_bare_string(VALUE);
+const char *rb_str_null_check(VALUE);
+VALUE rb_str_casecmp(VALUE str1, VALUE str2);
+
+/* error.c */
+void rb_warn_unchilled_literal(VALUE str);
+void rb_warn_unchilled_symbol_to_s(VALUE str);
 
 static inline bool STR_EMBED_P(VALUE str);
 static inline bool STR_SHARED_P(VALUE str);
@@ -63,17 +115,14 @@ static inline VALUE rb_str_eql_internal(const VALUE str1, const VALUE str2);
 RUBY_SYMBOL_EXPORT_BEGIN
 /* string.c (export) */
 VALUE rb_str_tmp_frozen_acquire(VALUE str);
-VALUE rb_str_tmp_frozen_no_embed_acquire(VALUE str);
 void rb_str_tmp_frozen_release(VALUE str, VALUE tmp);
 VALUE rb_setup_fake_str(struct RString *fake_str, const char *name, long len, rb_encoding *enc);
-VALUE rb_str_upto_each(VALUE, VALUE, int, int (*each)(VALUE, VALUE), VALUE);
-VALUE rb_str_upto_endless_each(VALUE, int (*each)(VALUE, VALUE), VALUE);
-void rb_str_make_embedded(VALUE);
-size_t rb_str_size_as_embedded(VALUE);
-bool rb_str_reembeddable_p(VALUE);
 RUBY_SYMBOL_EXPORT_END
 
 VALUE rb_fstring_new(const char *ptr, long len);
+void rb_gc_free_fstring(VALUE obj);
+bool rb_obj_is_fstring_table(VALUE obj);
+void Init_fstring_table();
 VALUE rb_obj_as_string_result(VALUE str, VALUE obj);
 VALUE rb_str_opt_plus(VALUE x, VALUE y);
 VALUE rb_str_concat_literals(size_t num, const VALUE *strary);
@@ -123,14 +172,18 @@ CHILLED_STRING_P(VALUE obj)
 static inline void
 CHILLED_STRING_MUTATED(VALUE str)
 {
+    VALUE chilled_reason = RB_FL_TEST_RAW(str, STR_CHILLED);
     FL_UNSET_RAW(str, STR_CHILLED);
-    rb_category_warn(RB_WARN_CATEGORY_DEPRECATED, "literal string will be frozen in the future");
-}
-
-static inline void
-STR_CHILL_RAW(VALUE str)
-{
-    FL_SET_RAW(str, STR_CHILLED);
+    switch (chilled_reason) {
+      case STR_CHILLED_SYMBOL_TO_S:
+        rb_warn_unchilled_symbol_to_s(str);
+        break;
+      case STR_CHILLED_LITERAL:
+        rb_warn_unchilled_literal(str);
+        break;
+      default:
+        rb_bug("RString was chilled for multiple reasons");
+    }
 }
 
 static inline bool
diff --git a/internal/struct.h b/internal/struct.h
index 6da5bad10a..d3c8157393 100644
--- a/internal/struct.h
+++ b/internal/struct.h
@@ -11,10 +11,23 @@
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/ruby.h"          /* for struct RBasic */
 
+/* Flags of RStruct
+ *
+ * 1-7: RSTRUCT_EMBED_LEN
+ *          If non-zero, the struct is embedded (its contents follow the
+ *          header, rather than being on a separately allocated buffer) and
+ *          these bits are the length of the Struct.
+ * 8:   RSTRUCT_GEN_FIELDS
+ *          The struct is embedded and has no space left to store the
+ *          IMEMO/fields reference. Any ivar this struct may have will be in
+ *          the generic_fields_tbl. This flag doesn't imply the struct has
+ *          ivars.
+ */
 enum {
     RSTRUCT_EMBED_LEN_MASK = RUBY_FL_USER7 | RUBY_FL_USER6 | RUBY_FL_USER5 | RUBY_FL_USER4 |
                                  RUBY_FL_USER3 | RUBY_FL_USER2 | RUBY_FL_USER1,
     RSTRUCT_EMBED_LEN_SHIFT = (RUBY_FL_USHIFT+1),
+    RSTRUCT_GEN_FIELDS = RUBY_FL_USER8,
 };
 
 struct RStruct {
@@ -23,6 +36,7 @@ struct RStruct {
         struct {
             long len;
             const VALUE *ptr;
+            VALUE fields_obj;
         } heap;
         /* This is a length 1 array because:
          *   1. GCC has a bug that does not optimize C flexible array members
@@ -35,37 +49,16 @@ struct RStruct {
 
 #define RSTRUCT(obj) ((struct RStruct *)(obj))
 
-#ifdef RSTRUCT_LEN
-# undef RSTRUCT_LEN
-#endif
-
-#ifdef RSTRUCT_PTR
-# undef RSTRUCT_PTR
-#endif
-
-#ifdef RSTRUCT_SET
-# undef RSTRUCT_SET
-#endif
-
-#ifdef RSTRUCT_GET
-# undef RSTRUCT_GET
-#endif
-
-#define RSTRUCT_LEN internal_RSTRUCT_LEN
-#define RSTRUCT_SET internal_RSTRUCT_SET
-#define RSTRUCT_GET internal_RSTRUCT_GET
-
 /* struct.c */
 VALUE rb_struct_init_copy(VALUE copy, VALUE s);
 VALUE rb_struct_lookup(VALUE s, VALUE idx);
 VALUE rb_struct_s_keyword_init(VALUE klass);
-static inline const VALUE *rb_struct_const_heap_ptr(VALUE st);
 static inline long RSTRUCT_EMBED_LEN(VALUE st);
-static inline long RSTRUCT_LEN(VALUE st);
+static inline long RSTRUCT_LEN_RAW(VALUE st);
 static inline int RSTRUCT_LENINT(VALUE st);
 static inline const VALUE *RSTRUCT_CONST_PTR(VALUE st);
-static inline void RSTRUCT_SET(VALUE st, long k, VALUE v);
-static inline VALUE RSTRUCT_GET(VALUE st, long k);
+static inline void RSTRUCT_SET_RAW(VALUE st, long k, VALUE v);
+static inline VALUE RSTRUCT_GET_RAW(VALUE st, long k);
 
 static inline long
 RSTRUCT_EMBED_LEN(VALUE st)
@@ -76,7 +69,7 @@ RSTRUCT_EMBED_LEN(VALUE st)
 }
 
 static inline long
-RSTRUCT_LEN(VALUE st)
+RSTRUCT_LEN_RAW(VALUE st)
 {
     if (FL_TEST_RAW(st, RSTRUCT_EMBED_LEN_MASK)) {
         return RSTRUCT_EMBED_LEN(st);
@@ -89,7 +82,7 @@ RSTRUCT_LEN(VALUE st)
 static inline int
 RSTRUCT_LENINT(VALUE st)
 {
-    return rb_long2int(RSTRUCT_LEN(st));
+    return rb_long2int(RSTRUCT_LEN_RAW(st));
 }
 
 static inline const VALUE *
@@ -106,22 +99,42 @@ RSTRUCT_CONST_PTR(VALUE st)
 }
 
 static inline void
-RSTRUCT_SET(VALUE st, long k,  VALUE v)
+RSTRUCT_SET_RAW(VALUE st, long k,  VALUE v)
 {
     RB_OBJ_WRITE(st, &RSTRUCT_CONST_PTR(st)[k], v);
 }
 
 static inline VALUE
-RSTRUCT_GET(VALUE st, long k)
+RSTRUCT_GET_RAW(VALUE st, long k)
 {
     return RSTRUCT_CONST_PTR(st)[k];
 }
 
-static inline const VALUE *
-rb_struct_const_heap_ptr(VALUE st)
+static inline VALUE
+RSTRUCT_FIELDS_OBJ(VALUE st)
 {
-    assert(!FL_TEST_RAW(st, RSTRUCT_EMBED_LEN_MASK));
-    return RSTRUCT(st)->as.heap.ptr;
+    const long embed_len = RSTRUCT_EMBED_LEN(st);
+    VALUE fields_obj;
+    if (embed_len) {
+        RUBY_ASSERT(!FL_TEST_RAW(st, RSTRUCT_GEN_FIELDS));
+        fields_obj = RSTRUCT_GET_RAW(st, embed_len);
+    }
+    else {
+        fields_obj = RSTRUCT(st)->as.heap.fields_obj;
+    }
+    return fields_obj;
 }
 
+static inline void
+RSTRUCT_SET_FIELDS_OBJ(VALUE st, VALUE fields_obj)
+{
+    const long embed_len = RSTRUCT_EMBED_LEN(st);
+    if (embed_len) {
+        RUBY_ASSERT(!FL_TEST_RAW(st, RSTRUCT_GEN_FIELDS));
+        RSTRUCT_SET_RAW(st, embed_len, fields_obj);
+    }
+    else {
+        RB_OBJ_WRITE(st, &RSTRUCT(st)->as.heap.fields_obj, fields_obj);
+    }
+}
 #endif /* INTERNAL_STRUCT_H */
diff --git a/internal/symbol.h b/internal/symbol.h
index e7730cb70f..b9109b1347 100644
--- a/internal/symbol.h
+++ b/internal/symbol.h
@@ -17,6 +17,7 @@
 #endif
 
 /* symbol.c */
+void rb_sym_global_symbols_mark_and_move(void);
 VALUE rb_to_symbol_type(VALUE obj);
 VALUE rb_sym_intern(const char *ptr, long len, rb_encoding *enc);
 VALUE rb_sym_intern_ascii(const char *ptr, long len);
@@ -29,11 +30,11 @@ PUREFUNC(int rb_is_const_sym(VALUE sym));
 PUREFUNC(int rb_is_attrset_sym(VALUE sym));
 ID rb_make_internal_id(void);
 ID rb_make_temporary_id(size_t n);
+bool rb_obj_is_symbol_table(VALUE obj);
+void rb_sym_global_symbol_table_foreach_weak_reference(int (*callback)(VALUE *key, void *data), void *data);
 void rb_gc_free_dsymbol(VALUE);
 int rb_static_id_valid_p(ID id);
-
-/* vm.c */
-void rb_free_static_symid_str(void);
+void rb_free_global_symbol_table(void);
 
 #if __has_builtin(__builtin_constant_p)
 #define rb_sym_intern_ascii_cstr(ptr) \
diff --git a/internal/thread.h b/internal/thread.h
index 47273436e3..ea891b4372 100644
--- a/internal/thread.h
+++ b/internal/thread.h
@@ -13,6 +13,7 @@
 #include "ccan/list/list.h"     /* for list in rb_io_close_wait_list */
 
 struct rb_thread_struct;        /* in vm_core.h */
+struct rb_io;
 
 #define RB_VM_SAVE_MACHINE_CONTEXT(th)				\
     do {							\
@@ -46,27 +47,35 @@ VALUE rb_thread_shield_wait(VALUE self);
 VALUE rb_thread_shield_release(VALUE self);
 VALUE rb_thread_shield_destroy(VALUE self);
 int rb_thread_to_be_killed(VALUE thread);
+void rb_thread_acquire_fork_lock(void);
+void rb_thread_release_fork_lock(void);
+void rb_thread_reset_fork_lock(void);
 void rb_mutex_allow_trap(VALUE self, int val);
 VALUE rb_uninterruptible(VALUE (*b_proc)(VALUE), VALUE data);
 VALUE rb_mutex_owned_p(VALUE self);
 VALUE rb_exec_recursive_outer_mid(VALUE (*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h, ID mid);
 void ruby_mn_threads_params(void);
 
-int rb_thread_wait_for_single_fd(int fd, int events, struct timeval * timeout);
+int rb_thread_io_wait(struct rb_thread_struct *th, struct rb_io *io, int events, struct timeval * timeout);
+int rb_thread_wait_for_single_fd(struct rb_thread_struct *th, int fd, int events, struct timeval * timeout);
 
-struct rb_io_close_wait_list {
-    struct ccan_list_head pending_fd_users;
-    VALUE closing_thread;
-    VALUE wakeup_mutex;
-};
-int rb_notify_fd_close(int fd, struct rb_io_close_wait_list *busy);
-void rb_notify_fd_close_wait(struct rb_io_close_wait_list *busy);
+size_t rb_thread_io_close_interrupt(struct rb_io *);
+void rb_thread_io_close_wait(struct rb_io *);
+
+void rb_ec_check_ints(struct rb_execution_context_struct *ec);
+
+void rb_thread_free_native_thread(void *th_ptr);
 
 RUBY_SYMBOL_EXPORT_BEGIN
 
+void *rb_thread_prevent_fork(void *(*func)(void *), void *data); /* for ext/socket/raddrinfo.c */
+
 /* Temporary.  This API will be removed (renamed). */
-VALUE rb_thread_io_blocking_region(rb_blocking_function_t *func, void *data1, int fd);
-VALUE rb_thread_io_blocking_call(rb_blocking_function_t *func, void *data1, int fd, int events);
+VALUE rb_thread_io_blocking_region(struct rb_io *io, rb_blocking_function_t *func, void *data1);
+VALUE rb_thread_io_blocking_call(struct rb_io *io, rb_blocking_function_t *func, void *data1, int events);
+
+// Invoke the given function, with the specified argument, in a way that `IO#close` from another execution context can interrupt it.
+VALUE rb_thread_io_blocking_operation(VALUE self, VALUE(*function)(VALUE), VALUE argument);
 
 /* thread.c (export) */
 int ruby_thread_has_gvl_p(void); /* for ext/fiddle/closure.c */
@@ -76,4 +85,28 @@ RUBY_SYMBOL_EXPORT_END
 int rb_threadptr_execute_interrupts(struct rb_thread_struct *th, int blocking_timing);
 bool rb_thread_mn_schedulable(VALUE thread);
 
+bool rb_thread_resolve_unblock_function(rb_unblock_function_t **unblock_function, void **data2, struct rb_thread_struct *thread);
+
+// interrupt exec
+
+typedef VALUE (rb_interrupt_exec_func_t)(void *data);
+
+enum rb_interrupt_exec_flag {
+    rb_interrupt_exec_flag_none = 0x00,
+    rb_interrupt_exec_flag_value_data = 0x01,
+    rb_interrupt_exec_flag_new_thread = 0x02,
+};
+
+// interrupt the target_th and run func.
+struct rb_ractor_struct;
+
+void rb_threadptr_interrupt_exec(struct rb_thread_struct *target_th,
+                                 rb_interrupt_exec_func_t *func, void *data, enum rb_interrupt_exec_flag flags);
+
+// create a thread in the target_r and run func on the created thread.
+void rb_ractor_interrupt_exec(struct rb_ractor_struct *target_r,
+                              rb_interrupt_exec_func_t *func, void *data, enum rb_interrupt_exec_flag flags);
+
+void rb_threadptr_interrupt_exec_task_mark(struct rb_thread_struct *th);
+
 #endif /* INTERNAL_THREAD_H */
diff --git a/internal/time.h b/internal/time.h
index a3bf0587ec..1f3505f5bc 100644
--- a/internal/time.h
+++ b/internal/time.h
@@ -27,8 +27,8 @@ struct timeval rb_time_timeval(VALUE);
 
 RUBY_SYMBOL_EXPORT_BEGIN
 /* time.c (export) */
-void ruby_reset_leap_second_info(void);
-void ruby_reset_timezone(void);
 RUBY_SYMBOL_EXPORT_END
 
+void ruby_reset_timezone(const char *);
+
 #endif /* INTERNAL_TIME_H */
diff --git a/internal/variable.h b/internal/variable.h
index b2a30c7c58..58364941c1 100644
--- a/internal/variable.h
+++ b/internal/variable.h
@@ -13,21 +13,23 @@
 #include "constant.h"           /* for rb_const_entry_t */
 #include "ruby/internal/stdbool.h"     /* for bool */
 #include "ruby/ruby.h"          /* for VALUE */
-#include "shape.h"              /* for rb_shape_t */
+#include "shape.h"              /* for shape_id_t */
 
 /* variable.c */
 void rb_gc_mark_global_tbl(void);
 void rb_gc_update_global_tbl(void);
-size_t rb_generic_ivar_memsize(VALUE);
 VALUE rb_search_class_path(VALUE);
 VALUE rb_attr_delete(VALUE, ID);
 void rb_autoload_str(VALUE mod, ID id, VALUE file);
 VALUE rb_autoload_at_p(VALUE, ID, int);
+void rb_autoload_copy_table_for_box(st_table *, const rb_box_t *);
 NORETURN(VALUE rb_mod_const_missing(VALUE,VALUE));
 rb_gvar_getter_t *rb_gvar_getter_function_of(ID);
 rb_gvar_setter_t *rb_gvar_setter_function_of(ID);
 void rb_gvar_readonly_setter(VALUE v, ID id, VALUE *_);
 void rb_gvar_ractor_local(const char *name);
+void rb_gvar_box_ready(const char *name);
+void rb_gvar_box_dynamic(const char *name);
 
 /**
  * Sets the name of a module.
@@ -45,20 +47,23 @@ void rb_gvar_ractor_local(const char *name);
  */
 VALUE rb_mod_set_temporary_name(VALUE, VALUE);
 
-struct gen_ivtbl;
-int rb_gen_ivtbl_get(VALUE obj, ID id, struct gen_ivtbl **ivtbl);
 void rb_obj_copy_ivs_to_hash_table(VALUE obj, st_table *table);
-void rb_obj_convert_to_too_complex(VALUE obj, st_table *table);
+void rb_obj_init_complex(VALUE obj, st_table *table);
 void rb_evict_ivars_to_hash(VALUE obj);
+VALUE rb_obj_field_get(VALUE obj, shape_id_t target_shape_id);
+void rb_ivar_set_internal(VALUE obj, ID id, VALUE val);
+void rb_ivar_foreach_buffered(VALUE obj, int (*func)(ID name, VALUE val, st_data_t arg), st_data_t arg);
+attr_index_t rb_ivar_set_index(VALUE obj, ID id, VALUE val);
+attr_index_t rb_obj_field_set(VALUE obj, shape_id_t target_shape_id, ID field_name, VALUE val);
+VALUE rb_ivar_get_at(VALUE obj, attr_index_t index, ID id);
+VALUE rb_ivar_get_at_no_ractor_check(VALUE obj, attr_index_t index);
 
 RUBY_SYMBOL_EXPORT_BEGIN
 /* variable.c (export) */
 void rb_mark_generic_ivar(VALUE obj);
-void rb_ref_update_generic_ivar(VALUE);
-void rb_mv_generic_ivar(VALUE src, VALUE dst);
 VALUE rb_const_missing(VALUE klass, VALUE name);
-int rb_class_ivar_set(VALUE klass, ID vid, VALUE value);
-void rb_iv_tbl_copy(VALUE dst, VALUE src);
+bool rb_class_ivar_set(VALUE klass, ID vid, VALUE value);
+void rb_fields_tbl_copy(VALUE dst, VALUE src);
 RUBY_SYMBOL_EXPORT_END
 
 VALUE rb_ivar_lookup(VALUE obj, ID id, VALUE undef);
@@ -66,7 +71,6 @@ VALUE rb_gvar_get(ID);
 VALUE rb_gvar_set(ID, VALUE);
 VALUE rb_gvar_defined(ID);
 void rb_const_warn_if_deprecated(const rb_const_entry_t *, VALUE, ID);
-void rb_ensure_iv_list_size(VALUE obj, uint32_t len, uint32_t newsize);
-attr_index_t rb_obj_ivar_set(VALUE obj, ID id, VALUE val);
+void rb_ensure_iv_list_size(VALUE obj, uint32_t current_len, uint32_t newsize);
 
 #endif /* INTERNAL_VARIABLE_H */
diff --git a/internal/vm.h b/internal/vm.h
index 74635e6ad8..4e50ec2710 100644
--- a/internal/vm.h
+++ b/internal/vm.h
@@ -56,7 +56,6 @@ void rb_vm_check_redefinition_by_prepend(VALUE klass);
 int rb_vm_check_optimizable_mid(VALUE mid);
 VALUE rb_yield_refine_block(VALUE refinement, VALUE refinements);
 VALUE ruby_vm_special_exception_copy(VALUE);
-PUREFUNC(st_table *rb_vm_fstring_table(void));
 
 void rb_lastline_set_up(VALUE val, unsigned int up);
 
@@ -64,23 +63,27 @@ void rb_lastline_set_up(VALUE val, unsigned int up);
 VALUE rb_current_realfilepath(void);
 VALUE rb_check_block_call(VALUE, ID, int, const VALUE *, rb_block_call_func_t, VALUE);
 typedef void rb_check_funcall_hook(int, VALUE, ID, int, const VALUE *, VALUE);
-VALUE rb_check_funcall_with_hook(VALUE recv, ID mid, int argc, const VALUE *argv,
-                                 rb_check_funcall_hook *hook, VALUE arg);
 VALUE rb_check_funcall_with_hook_kw(VALUE recv, ID mid, int argc, const VALUE *argv,
                                  rb_check_funcall_hook *hook, VALUE arg, int kw_splat);
 const char *rb_type_str(enum ruby_value_type type);
 VALUE rb_check_funcall_default(VALUE, ID, int, const VALUE *, VALUE);
 VALUE rb_check_funcall_basic_kw(VALUE, ID, VALUE, int, const VALUE*, int);
 VALUE rb_yield_1(VALUE val);
+VALUE rb_ec_yield(struct rb_execution_context_struct *ec, VALUE val);
 VALUE rb_yield_force_blockarg(VALUE values);
 VALUE rb_lambda_call(VALUE obj, ID mid, int argc, const VALUE *argv,
                      rb_block_call_func_t bl_proc, int min_argc, int max_argc,
                      VALUE data2);
 void rb_check_stack_overflow(void);
+#define RB_BLOCK_NO_USE_PACKED_ARGS 2
+VALUE rb_block_call2(VALUE obj, ID mid, int argc, const VALUE *argv, rb_block_call_func_t bl_proc, VALUE data2, long flags);
+struct vm_ifunc *rb_current_ifunc(void);
+VALUE rb_gccct_clear_table(void);
+VALUE rb_eval_cmd_call_kw(VALUE cmd, int argc, const VALUE *argv, int kw_splat);
 
-#if USE_YJIT
+#if USE_YJIT || USE_ZJIT
 /* vm_exec.c */
-extern uint64_t rb_vm_insns_count;
+extern uint64_t rb_vm_insn_count;
 #endif
 
 extern bool rb_free_at_exit;
@@ -96,11 +99,8 @@ struct rb_iseq_struct;
 const struct rb_callcache *rb_vm_search_method_slowpath(const struct rb_callinfo *ci, VALUE klass);
 
 /* vm_method.c */
-struct rb_execution_context_struct;
 int rb_ec_obj_respond_to(struct rb_execution_context_struct *ec, VALUE obj, ID id, int priv);
 
-void rb_clear_constant_cache(void);
-
 /* vm_dump.c */
 void rb_print_backtrace(FILE *);
 
@@ -121,7 +121,6 @@ int rb_get_node_id_from_frame_info(VALUE obj);
 const struct rb_iseq_struct *rb_get_iseq_from_frame_info(VALUE obj);
 
 VALUE rb_ec_backtrace_object(const struct rb_execution_context_struct *ec);
-void rb_backtrace_use_iseq_first_lineno_for_last_location(VALUE self);
 
 #define RUBY_DTRACE_CREATE_HOOK(name, arg) \
     RUBY_DTRACE_HOOK(name##_CREATE, arg)
diff --git a/io.c b/io.c
index 8acb1f562e..effcb349c3 100644
--- a/io.c
+++ b/io.c
@@ -104,6 +104,16 @@
 
 #ifdef HAVE_COPYFILE_H
 # include <copyfile.h>
+
+# ifndef COPYFILE_STATE_COPIED
+/*
+ * Some OSes (e.g., OSX < 10.6) implement fcopyfile() but not
+ * COPYFILE_STATE_COPIED.  Since the only use of the former here
+ * requires the latter, we disable the former when the latter is undefined.
+ */
+#   undef HAVE_FCOPYFILE
+# endif
+
 #endif
 
 #include "ruby/internal/stdbool.h"
@@ -210,7 +220,18 @@ static VALUE sym_DATA;
 static VALUE sym_HOLE;
 #endif
 
-static VALUE prep_io(int fd, int fmode, VALUE klass, const char *path);
+static VALUE prep_io(int fd, enum rb_io_mode fmode, VALUE klass, const char *path);
+
+VALUE
+rb_io_blocking_region_wait(struct rb_io *io, rb_blocking_function_t *function, void *argument, enum rb_io_event events)
+{
+    return rb_thread_io_blocking_call(io, function, argument, events);
+}
+
+VALUE rb_io_blocking_region(struct rb_io *io, rb_blocking_function_t *function, void *argument)
+{
+    return rb_io_blocking_region_wait(io, function, argument, 0);
+}
 
 struct argf {
     VALUE filename, current_file;
@@ -479,6 +500,7 @@ rb_cloexec_fcntl_dupfd(int fd, int minfd)
 
 #define argf_of(obj) (*(struct argf *)DATA_PTR(obj))
 #define ARGF argf_of(argf)
+#define ARGF_SET(field, value) RB_OBJ_WRITE(argf, &ARGF.field, value)
 
 #define GetWriteIO(io) rb_io_get_write_io(io)
 
@@ -520,7 +542,8 @@ rb_cloexec_fcntl_dupfd(int fd, int minfd)
 #endif
 
 static int io_fflush(rb_io_t *);
-static rb_io_t *flush_before_seek(rb_io_t *fptr);
+static rb_io_t *flush_before_seek(rb_io_t *fptr, bool discard_rbuf);
+static void clear_codeconv(rb_io_t *fptr);
 
 #define FMODE_SIGNAL_ON_EPIPE (1<<17)
 
@@ -605,7 +628,7 @@ rb_sys_fail_on_write(rb_io_t *fptr)
  * IO unread with taking care of removed '\r' in text mode.
  */
 static void
-io_unread(rb_io_t *fptr)
+io_unread(rb_io_t *fptr, bool discard_rbuf)
 {
     rb_off_t r, pos;
     ssize_t read_size;
@@ -626,19 +649,17 @@ io_unread(rb_io_t *fptr)
         if (r < 0 && errno) {
             if (errno == ESPIPE)
                 fptr->mode |= FMODE_DUPLEX;
-            return;
+            if (!discard_rbuf) return;
         }
 
-        fptr->rbuf.off = 0;
-        fptr->rbuf.len = 0;
-        return;
+        goto end;
     }
 
     pos = lseek(fptr->fd, 0, SEEK_CUR);
     if (pos < 0 && errno) {
         if (errno == ESPIPE)
             fptr->mode |= FMODE_DUPLEX;
-        return;
+        if (!discard_rbuf) goto end;
     }
 
     /* add extra offset for removed '\r' in rbuf */
@@ -679,8 +700,10 @@ io_unread(rb_io_t *fptr)
         }
     }
     free(buf);
+  end:
     fptr->rbuf.off = 0;
     fptr->rbuf.len = 0;
+    clear_codeconv(fptr);
     return;
 }
 
@@ -699,7 +722,7 @@ set_binary_mode_with_seek_cur(rb_io_t *fptr)
     if (fptr->rbuf.len == 0 || fptr->mode & FMODE_DUPLEX) {
         return setmode(fptr->fd, O_BINARY);
     }
-    flush_before_seek(fptr);
+    flush_before_seek(fptr, false);
     return setmode(fptr->fd, O_BINARY);
 }
 #define SET_BINARY_MODE_WITH_SEEK_CUR(fptr) set_binary_mode_with_seek_cur(fptr)
@@ -895,7 +918,7 @@ rb_io_s_try_convert(VALUE dummy, VALUE io)
 
 #if !RUBY_CRLF_ENVIRONMENT
 static void
-io_unread(rb_io_t *fptr)
+io_unread(rb_io_t *fptr, bool discard_rbuf)
 {
     rb_off_t r;
     rb_io_check_closed(fptr);
@@ -907,10 +930,11 @@ io_unread(rb_io_t *fptr)
     if (r < 0 && errno) {
         if (errno == ESPIPE)
             fptr->mode |= FMODE_DUPLEX;
-        return;
+        if (!discard_rbuf) return;
     }
     fptr->rbuf.off = 0;
     fptr->rbuf.len = 0;
+    clear_codeconv(fptr);
     return;
 }
 #endif
@@ -951,17 +975,17 @@ io_ungetbyte(VALUE str, rb_io_t *fptr)
 }
 
 static rb_io_t *
-flush_before_seek(rb_io_t *fptr)
+flush_before_seek(rb_io_t *fptr, bool discard_rbuf)
 {
     if (io_fflush(fptr) < 0)
         rb_sys_fail_on_write(fptr);
-    io_unread(fptr);
+    io_unread(fptr, discard_rbuf);
     errno = 0;
     return fptr;
 }
 
-#define io_seek(fptr, ofs, whence) (errno = 0, lseek(flush_before_seek(fptr)->fd, (ofs), (whence)))
-#define io_tell(fptr) lseek(flush_before_seek(fptr)->fd, 0, SEEK_CUR)
+#define io_seek(fptr, ofs, whence) (errno = 0, lseek(flush_before_seek(fptr, true)->fd, (ofs), (whence)))
+#define io_tell(fptr) lseek(flush_before_seek(fptr, false)->fd, 0, SEEK_CUR)
 
 #ifndef SEEK_CUR
 # define SEEK_SET 0
@@ -1029,7 +1053,7 @@ rb_io_check_writable(rb_io_t *fptr)
         rb_raise(rb_eIOError, "not opened for writing");
     }
     if (fptr->rbuf.len) {
-        io_unread(fptr);
+        io_unread(fptr, true);
     }
 }
 
@@ -1087,7 +1111,7 @@ ruby_dup(int orig)
 static VALUE
 io_alloc(VALUE klass)
 {
-    NEWOBJ_OF(io, struct RFile, klass, T_FILE, sizeof(struct RFile), 0);
+    UNPROTECTED_NEWOBJ_OF(io, struct RFile, klass, T_FILE, sizeof(struct RFile));
 
     io->fptr = 0;
 
@@ -1158,8 +1182,15 @@ io_internal_wait(VALUE thread, rb_io_t *fptr, int error, int events, struct time
         return -1;
     }
 
-    errno = error;
-    return -1;
+    // If there was an error BEFORE we started waiting, return it:
+    if (error) {
+        errno = error;
+        return -1;
+    }
+    else {
+        // Otherwise, whatever error was generated by `nogvl_wait_for` is the one we want:
+        return ready;
+    }
 }
 
 static VALUE
@@ -1261,7 +1292,8 @@ internal_writev_func(void *ptr)
 static ssize_t
 rb_io_read_memory(rb_io_t *fptr, void *buf, size_t count)
 {
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_read_memory(scheduler, fptr->self, buf, count, 0);
 
@@ -1271,7 +1303,7 @@ rb_io_read_memory(rb_io_t *fptr, void *buf, size_t count)
     }
 
     struct io_internal_read_struct iis = {
-        .th = rb_thread_current(),
+        .th = th->self,
         .fptr = fptr,
         .nonblock = 0,
         .fd = fptr->fd,
@@ -1288,13 +1320,14 @@ rb_io_read_memory(rb_io_t *fptr, void *buf, size_t count)
         iis.timeout = &timeout_storage;
     }
 
-    return (ssize_t)rb_thread_io_blocking_call(internal_read_func, &iis, fptr->fd, RB_WAITFD_IN);
+    return (ssize_t)rb_io_blocking_region_wait(fptr, internal_read_func, &iis, RUBY_IO_READABLE);
 }
 
 static ssize_t
 rb_io_write_memory(rb_io_t *fptr, const void *buf, size_t count)
 {
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_write_memory(scheduler, fptr->self, buf, count, 0);
 
@@ -1304,7 +1337,7 @@ rb_io_write_memory(rb_io_t *fptr, const void *buf, size_t count)
     }
 
     struct io_internal_write_struct iis = {
-        .th = rb_thread_current(),
+        .th = th->self,
         .fptr = fptr,
         .nonblock = 0,
         .fd = fptr->fd,
@@ -1321,7 +1354,7 @@ rb_io_write_memory(rb_io_t *fptr, const void *buf, size_t count)
         iis.timeout = &timeout_storage;
     }
 
-    return (ssize_t)rb_thread_io_blocking_call(internal_write_func, &iis, fptr->fd, RB_WAITFD_OUT);
+    return (ssize_t)rb_io_blocking_region_wait(fptr, internal_write_func, &iis, RUBY_IO_WRITABLE);
 }
 
 #ifdef HAVE_WRITEV
@@ -1330,7 +1363,9 @@ rb_writev_internal(rb_io_t *fptr, const struct iovec *iov, int iovcnt)
 {
     if (!iovcnt) return 0;
 
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
     if (scheduler != Qnil) {
         // This path assumes at least one `iov`:
         VALUE result = rb_fiber_scheduler_io_write_memory(scheduler, fptr->self, iov[0].iov_base, iov[0].iov_len, 0);
@@ -1341,7 +1376,7 @@ rb_writev_internal(rb_io_t *fptr, const struct iovec *iov, int iovcnt)
     }
 
     struct io_internal_writev_struct iis = {
-        .th = rb_thread_current(),
+        .th = th->self,
         .fptr = fptr,
         .nonblock = 0,
         .fd = fptr->fd,
@@ -1358,7 +1393,7 @@ rb_writev_internal(rb_io_t *fptr, const struct iovec *iov, int iovcnt)
         iis.timeout = &timeout_storage;
     }
 
-    return (ssize_t)rb_thread_io_blocking_call(internal_writev_func, &iis, fptr->fd, RB_WAITFD_OUT);
+    return (ssize_t)rb_io_blocking_region_wait(fptr, internal_writev_func, &iis, RUBY_IO_WRITABLE);
 }
 #endif
 
@@ -1384,11 +1419,35 @@ io_flush_buffer_sync(void *arg)
     return (VALUE)-1;
 }
 
+static inline VALUE
+io_flush_buffer_fiber_scheduler(VALUE scheduler, rb_io_t *fptr)
+{
+    VALUE ret = rb_fiber_scheduler_io_write_memory(scheduler, fptr->self, fptr->wbuf.ptr+fptr->wbuf.off, fptr->wbuf.len, 0);
+    if (!UNDEF_P(ret)) {
+        ssize_t result = rb_fiber_scheduler_io_result_apply(ret);
+        if (result > 0) {
+            fptr->wbuf.off += result;
+            fptr->wbuf.len -= result;
+        }
+        return result >= 0 ? (VALUE)0 : (VALUE)-1;
+    }
+    return ret;
+}
+
 static VALUE
 io_flush_buffer_async(VALUE arg)
 {
     rb_io_t *fptr = (rb_io_t *)arg;
-    return rb_thread_io_blocking_call(io_flush_buffer_sync, fptr, fptr->fd, RB_WAITFD_OUT);
+
+    VALUE scheduler = rb_fiber_scheduler_current();
+    if (scheduler != Qnil) {
+        VALUE result = io_flush_buffer_fiber_scheduler(scheduler, fptr);
+        if (!UNDEF_P(result)) {
+            return result;
+        }
+    }
+
+    return rb_io_blocking_region_wait(fptr, io_flush_buffer_sync, fptr, RUBY_IO_WRITABLE);
 }
 
 static inline int
@@ -1423,7 +1482,8 @@ io_fflush(rb_io_t *fptr)
 VALUE
 rb_io_wait(VALUE io, VALUE events, VALUE timeout)
 {
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
 
     if (scheduler != Qnil) {
         return rb_fiber_scheduler_io_wait(scheduler, io, events, timeout);
@@ -1444,7 +1504,7 @@ rb_io_wait(VALUE io, VALUE events, VALUE timeout)
         tv = &tv_storage;
     }
 
-    int ready = rb_thread_wait_for_single_fd(fptr->fd, RB_NUM2INT(events), tv);
+    int ready = rb_thread_io_wait(th, fptr, RB_NUM2INT(events), tv);
 
     if (ready < 0) {
         rb_sys_fail(0);
@@ -1468,17 +1528,15 @@ io_from_fd(int fd)
 }
 
 static int
-io_wait_for_single_fd(int fd, int events, struct timeval *timeout)
+io_wait_for_single_fd(int fd, int events, struct timeval *timeout, rb_thread_t *th, VALUE scheduler)
 {
-    VALUE scheduler = rb_fiber_scheduler_current();
-
     if (scheduler != Qnil) {
         return RTEST(
             rb_fiber_scheduler_io_wait(scheduler, io_from_fd(fd), RB_INT2NUM(events), rb_fiber_scheduler_make_timeout(timeout))
         );
     }
 
-    return rb_thread_wait_for_single_fd(fd, events, timeout);
+    return rb_thread_wait_for_single_fd(th, fd, events, timeout);
 }
 
 int
@@ -1486,7 +1544,8 @@ rb_io_wait_readable(int f)
 {
     io_fd_check_closed(f);
 
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
 
     switch (errno) {
       case EINTR:
@@ -1506,7 +1565,7 @@ rb_io_wait_readable(int f)
             );
         }
         else {
-            io_wait_for_single_fd(f, RUBY_IO_READABLE, NULL);
+            io_wait_for_single_fd(f, RUBY_IO_READABLE, NULL, th, scheduler);
         }
         return TRUE;
 
@@ -1520,7 +1579,8 @@ rb_io_wait_writable(int f)
 {
     io_fd_check_closed(f);
 
-    VALUE scheduler = rb_fiber_scheduler_current();
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
 
     switch (errno) {
       case EINTR:
@@ -1549,7 +1609,7 @@ rb_io_wait_writable(int f)
             );
         }
         else {
-            io_wait_for_single_fd(f, RUBY_IO_WRITABLE, NULL);
+            io_wait_for_single_fd(f, RUBY_IO_WRITABLE, NULL, th, scheduler);
         }
         return TRUE;
 
@@ -1561,7 +1621,9 @@ rb_io_wait_writable(int f)
 int
 rb_wait_for_single_fd(int fd, int events, struct timeval *timeout)
 {
-    return io_wait_for_single_fd(fd, events, timeout);
+    rb_thread_t *th = GET_THREAD();
+    VALUE scheduler = rb_fiber_scheduler_current_for_threadptr(th);
+    return io_wait_for_single_fd(fd, events, timeout, th, scheduler);
 }
 
 int
@@ -1613,7 +1675,7 @@ rb_io_maybe_wait(int error, VALUE io, VALUE events, VALUE timeout)
 
       default:
         // Non-specific error, no event is ready:
-        return Qfalse;
+        return Qnil;
     }
 }
 
@@ -1625,9 +1687,11 @@ rb_io_maybe_wait_readable(int error, VALUE io, VALUE timeout)
     if (RTEST(result)) {
         return RB_NUM2INT(result);
     }
-    else {
-        return 0;
+    else if (result == RUBY_Qfalse) {
+        rb_raise(rb_eIOTimeoutError, "Timed out waiting for IO to become readable!");
     }
+
+    return 0;
 }
 
 int
@@ -1638,9 +1702,11 @@ rb_io_maybe_wait_writable(int error, VALUE io, VALUE timeout)
     if (RTEST(result)) {
         return RB_NUM2INT(result);
     }
-    else {
-        return 0;
+    else if (result == RUBY_Qfalse) {
+        rb_raise(rb_eIOTimeoutError, "Timed out waiting for IO to become writable!");
     }
+
+    return 0;
 }
 
 static void
@@ -2351,7 +2417,7 @@ rb_io_flush_raw(VALUE io, int sync)
             rb_sys_fail_on_write(fptr);
     }
     if (fptr->mode & FMODE_READABLE) {
-        io_unread(fptr);
+        io_unread(fptr, true);
     }
 
     return io;
@@ -2470,7 +2536,7 @@ interpret_seek_whence(VALUE vwhence)
  *      f.tell            # => 12
  *      f.close
  *
- *  - +:SET+ or <tt>IO:SEEK_SET</tt>:
+ *  - +:SET+ or <tt>IO::SEEK_SET</tt>:
  *    Repositions the stream to the given +offset+:
  *
  *      f = File.open('t.txt')
@@ -2594,9 +2660,6 @@ io_fillbuf(rb_io_t *fptr)
         fptr->rbuf.len = 0;
         fptr->rbuf.capa = IO_RBUF_CAPA_FOR(fptr);
         fptr->rbuf.ptr = ALLOC_N(char, fptr->rbuf.capa);
-#ifdef _WIN32
-        fptr->rbuf.capa--;
-#endif
     }
     if (fptr->rbuf.len == 0) {
       retry:
@@ -2774,8 +2837,10 @@ rb_io_fsync(VALUE io)
 
     if (io_fflush(fptr) < 0)
         rb_sys_fail_on_write(fptr);
-    if ((int)rb_thread_io_blocking_region(nogvl_fsync, fptr, fptr->fd) < 0)
+
+    if ((int)rb_io_blocking_region(fptr, nogvl_fsync, fptr))
         rb_sys_fail_path(fptr->pathv);
+
     return INT2FIX(0);
 }
 #else
@@ -2824,7 +2889,7 @@ rb_io_fdatasync(VALUE io)
     if (io_fflush(fptr) < 0)
         rb_sys_fail_on_write(fptr);
 
-    if ((int)rb_thread_io_blocking_region(nogvl_fdatasync, fptr, fptr->fd) == 0)
+    if ((int)rb_io_blocking_region(fptr, nogvl_fdatasync, fptr) == 0)
         return INT2FIX(0);
 
     /* fall back */
@@ -3120,8 +3185,6 @@ io_enc_str(VALUE str, rb_io_t *fptr)
     return str;
 }
 
-static rb_encoding *io_read_encoding(rb_io_t *fptr);
-
 static void
 make_readconv(rb_io_t *fptr, int size)
 {
@@ -3264,10 +3327,6 @@ io_shift_cbuf(rb_io_t *fptr, int len, VALUE *strp)
 static int
 io_setstrbuf(VALUE *str, long len)
 {
-#ifdef _WIN32
-    if (len > 0)
-        len = (len + 1) & ~1L;	/* round up for wide char */
-#endif
     if (NIL_P(*str)) {
         *str = rb_str_new(0, len);
         return TRUE;
@@ -3409,10 +3468,10 @@ io_read_memory_call(VALUE arg)
     }
 
     if (iis->nonblock) {
-        return rb_thread_io_blocking_call(internal_read_func, iis, iis->fptr->fd, 0);
+        return rb_io_blocking_region(iis->fptr, internal_read_func, iis);
     }
     else {
-        return rb_thread_io_blocking_call(internal_read_func, iis, iis->fptr->fd, RB_WAITFD_IN);
+        return rb_io_blocking_region_wait(iis->fptr, internal_read_func, iis, RUBY_IO_READABLE);
     }
 }
 
@@ -3820,8 +3879,33 @@ rscheck(const char *rsptr, long rslen, VALUE rs)
         rb_raise(rb_eRuntimeError, "rs modified");
 }
 
+static const char *
+search_delim(const char *p, long len, int delim, rb_encoding *enc)
+{
+    if (rb_enc_mbminlen(enc) == 1) {
+        p = memchr(p, delim, len);
+        if (p) return p + 1;
+    }
+    else {
+        const char *end = p + len;
+        while (p < end) {
+            int r = rb_enc_precise_mbclen(p, end, enc);
+            if (!MBCLEN_CHARFOUND_P(r)) {
+                p += rb_enc_mbminlen(enc);
+                continue;
+            }
+            int n = MBCLEN_CHARFOUND_LEN(r);
+            if (rb_enc_mbc_to_codepoint(p, end, enc) == (unsigned int)delim) {
+                return p + n;
+            }
+            p += n;
+        }
+    }
+    return NULL;
+}
+
 static int
-appendline(rb_io_t *fptr, int delim, VALUE *strp, long *lp)
+appendline(rb_io_t *fptr, int delim, VALUE *strp, long *lp, rb_encoding *enc)
 {
     VALUE str = *strp;
     long limit = *lp;
@@ -3836,9 +3920,9 @@ appendline(rb_io_t *fptr, int delim, VALUE *strp, long *lp)
                 p = READ_CHAR_PENDING_PTR(fptr);
                 if (0 < limit && limit < searchlen)
                     searchlen = (int)limit;
-                e = memchr(p, delim, searchlen);
+                e = search_delim(p, searchlen, delim, enc);
                 if (e) {
-                    int len = (int)(e-p+1);
+                    int len = (int)(e-p);
                     if (NIL_P(str))
                         *strp = str = rb_str_new(p, len);
                     else
@@ -3878,8 +3962,8 @@ appendline(rb_io_t *fptr, int delim, VALUE *strp, long *lp)
             long last;
 
             if (limit > 0 && pending > limit) pending = limit;
-            e = memchr(p, delim, pending);
-            if (e) pending = e - p + 1;
+            e = search_delim(p, pending, delim, enc);
+            if (e) pending = e - p;
             if (!NIL_P(str)) {
                 last = RSTRING_LEN(str);
                 rb_str_resize(str, last + pending);
@@ -4134,21 +4218,31 @@ rb_io_getline_0(VALUE rs, long limit, int chomp, rb_io_t *fptr)
                 rs = 0;
                 if (!rb_enc_asciicompat(enc)) {
                     rs = rb_usascii_str_new(rsptr, rslen);
-                    rs = rb_str_encode(rs, rb_enc_from_encoding(enc), 0, Qnil);
+                    rs = rb_str_conv_enc(rs, 0, enc);
                     OBJ_FREEZE(rs);
                     rsptr = RSTRING_PTR(rs);
                     rslen = RSTRING_LEN(rs);
                 }
+                newline = '\n';
+            }
+            else if (rb_enc_mbminlen(enc) == 1) {
+                 rsptr = RSTRING_PTR(rs);
+                 newline = (unsigned char)rsptr[rslen - 1];
             }
             else {
+                rs = rb_str_conv_enc(rs, 0, enc);
                 rsptr = RSTRING_PTR(rs);
+                const char *e = rsptr + rslen;
+                const char *last = rb_enc_prev_char(rsptr, e, e, enc);
+                int n;
+                newline = rb_enc_codepoint_len(last, e, &n, enc);
+                if (last + n != e) rb_raise(rb_eArgError, "broken separator");
             }
-            newline = (unsigned char)rsptr[rslen - 1];
-            chomp_cr = chomp && rslen == 1 && newline == '\n';
+            chomp_cr = chomp && newline == '\n' && rslen == rb_enc_mbminlen(enc);
         }
 
         /* MS - Optimization */
-        while ((c = appendline(fptr, newline, &str, &limit)) != EOF) {
+        while ((c = appendline(fptr, newline, &str, &limit, enc)) != EOF) {
             const char *s, *p, *pp, *e;
 
             if (c == newline) {
@@ -4169,8 +4263,8 @@ rb_io_getline_0(VALUE rs, long limit, int chomp, rb_io_t *fptr)
             if (limit == 0) {
                 s = RSTRING_PTR(str);
                 p = RSTRING_END(str);
-                pp = rb_enc_left_char_head(s, p-1, p, enc);
-                if (extra_limit &&
+                pp = rb_enc_prev_char(s, p, p, enc);
+                if (extra_limit && pp &&
                     MBCLEN_NEEDMORE_P(rb_enc_precise_mbclen(pp, p, enc))) {
                     /* relax the limit while incomplete character.
                      * extra_limit limits the relax length */
@@ -4236,11 +4330,17 @@ rb_io_gets(VALUE io)
 }
 
 VALUE
-rb_io_gets_internal(VALUE io)
+rb_io_gets_limit_internal(VALUE io, long limit)
 {
     rb_io_t *fptr;
     GetOpenFile(io, fptr);
-    return rb_io_getline_0(rb_default_rs, -1, FALSE, fptr);
+    return rb_io_getline_0(rb_default_rs, limit, FALSE, fptr);
+}
+
+VALUE
+rb_io_gets_internal(VALUE io)
+{
+    return rb_io_gets_limit_internal(io, -1);
 }
 
 /*
@@ -4369,23 +4469,31 @@ rb_io_set_lineno(VALUE io, VALUE lineno)
 static VALUE
 io_readline(rb_execution_context_t *ec, VALUE io, VALUE sep, VALUE lim, VALUE chomp)
 {
+    long limit = -1;
     if (NIL_P(lim)) {
+        VALUE tmp = Qnil;
         // If sep is specified, but it's not a string and not nil, then assume
         // it's the limit (it should be an integer)
-        if (!NIL_P(sep) && NIL_P(rb_check_string_type(sep))) {
+        if (!NIL_P(sep) && NIL_P(tmp = rb_check_string_type(sep))) {
             // If the user has specified a non-nil / non-string value
             // for the separator, we assume it's the limit and set the
             // separator to default: rb_rs.
             lim = sep;
+            limit = NUM2LONG(lim);
             sep = rb_rs;
         }
+        else {
+            sep = tmp;
+        }
     }
-
-    if (!NIL_P(sep)) {
-        StringValue(sep);
+    else {
+        if (!NIL_P(sep)) StringValue(sep);
+        limit = NUM2LONG(lim);
     }
 
-    VALUE line = rb_io_getline_1(sep, NIL_P(lim) ? -1L : NUM2LONG(lim), RTEST(chomp), io);
+    check_getline_args(&sep, &limit, io);
+
+    VALUE line = rb_io_getline_1(sep, limit, RTEST(chomp), io);
     rb_lastline_set_up(line, 1);
 
     if (NIL_P(line)) {
@@ -4613,10 +4721,11 @@ rb_io_each_line(int argc, VALUE *argv, VALUE io)
  *  Calls the given block with each byte (0..255) in the stream; returns +self+.
  *  See {Byte IO}[rdoc-ref:IO@Byte+IO].
  *
- *    f = File.new('t.rus')
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.new('t.ja')
  *    a = []
  *    f.each_byte {|b| a << b }
- *    a # => [209, 130, 208, 181, 209, 129, 209, 130]
+ *    a # => [227, 129, 147, 227, 130, 147, 227, 129, 171, 227, 129, 161, 227, 129, 175]
  *    f.close
  *
  *  Returns an Enumerator if no block is given.
@@ -4761,10 +4870,11 @@ io_getc(rb_io_t *fptr, rb_encoding *enc)
  *  Calls the given block with each character in the stream; returns +self+.
  *  See {Character IO}[rdoc-ref:IO@Character+IO].
  *
- *    f = File.new('t.rus')
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.new('t.ja')
  *    a = []
  *    f.each_char {|c| a << c.ord }
- *    a # => [1090, 1077, 1089, 1090]
+ *    a # => [12371, 12435, 12395, 12385, 12399]
  *    f.close
  *
  *  Returns an Enumerator if no block is given.
@@ -4799,10 +4909,11 @@ rb_io_each_char(VALUE io)
  *
  *  Calls the given block with each codepoint in the stream; returns +self+:
  *
- *    f = File.new('t.rus')
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.new('t.ja')
  *    a = []
  *    f.each_codepoint {|c| a << c }
- *    a # => [1090, 1077, 1089, 1090]
+ *    a # => [12371, 12435, 12395, 12385, 12399]
  *    f.close
  *
  *  Returns an Enumerator if no block is given.
@@ -4824,6 +4935,7 @@ rb_io_each_codepoint(VALUE io)
     rb_io_check_char_readable(fptr);
 
     READ_CHECK(fptr);
+    enc = io_read_encoding(fptr);
     if (NEED_READCONV(fptr)) {
         SET_BINARY_MODE(fptr);
         r = 1;		/* no invalid char yet */
@@ -4831,12 +4943,9 @@ rb_io_each_codepoint(VALUE io)
             make_readconv(fptr, 0);
             for (;;) {
                 if (fptr->cbuf.len) {
-                    if (fptr->encs.enc)
-                        r = rb_enc_precise_mbclen(fptr->cbuf.ptr+fptr->cbuf.off,
-                                                  fptr->cbuf.ptr+fptr->cbuf.off+fptr->cbuf.len,
-                                                  fptr->encs.enc);
-                    else
-                        r = ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(1);
+                    r = rb_enc_precise_mbclen(fptr->cbuf.ptr+fptr->cbuf.off,
+                                              fptr->cbuf.ptr+fptr->cbuf.off+fptr->cbuf.len,
+                                              enc);
                     if (!MBCLEN_NEEDMORE_P(r))
                         break;
                     if (fptr->cbuf.len == fptr->cbuf.capa) {
@@ -4846,33 +4955,25 @@ rb_io_each_codepoint(VALUE io)
                 if (more_char(fptr) == MORE_CHAR_FINISHED) {
                     clear_readconv(fptr);
                     if (!MBCLEN_CHARFOUND_P(r)) {
-                        enc = fptr->encs.enc;
                         goto invalid;
                     }
                     return io;
                 }
             }
             if (MBCLEN_INVALID_P(r)) {
-                enc = fptr->encs.enc;
                 goto invalid;
             }
             n = MBCLEN_CHARFOUND_LEN(r);
-            if (fptr->encs.enc) {
-                c = rb_enc_codepoint(fptr->cbuf.ptr+fptr->cbuf.off,
-                                     fptr->cbuf.ptr+fptr->cbuf.off+fptr->cbuf.len,
-                                     fptr->encs.enc);
-            }
-            else {
-                c = (unsigned char)fptr->cbuf.ptr[fptr->cbuf.off];
-            }
+            c = rb_enc_codepoint(fptr->cbuf.ptr+fptr->cbuf.off,
+                                 fptr->cbuf.ptr+fptr->cbuf.off+fptr->cbuf.len,
+                                 enc);
             fptr->cbuf.off += n;
             fptr->cbuf.len -= n;
             rb_yield(UINT2NUM(c));
-            rb_io_check_byte_readable(fptr);
+            rb_io_check_char_readable(fptr);
         }
     }
     NEED_NEWLINE_DECORATOR_ON_READ_CHECK(fptr);
-    enc = io_input_encoding(fptr);
     while (io_fillbuf(fptr) >= 0) {
         r = rb_enc_precise_mbclen(fptr->rbuf.ptr+fptr->rbuf.off,
                                   fptr->rbuf.ptr+fptr->rbuf.off+fptr->rbuf.len, enc);
@@ -4926,8 +5027,9 @@ rb_io_each_codepoint(VALUE io)
  *    f = File.open('t.txt')
  *    f.getc     # => "F"
  *    f.close
- *    f = File.open('t.rus')
- *    f.getc.ord # => 1090
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.open('t.ja')
+ *    f.getc.ord # => 12371
  *    f.close
  *
  *  Related:  IO#readchar (may raise EOFError).
@@ -4959,8 +5061,9 @@ rb_io_getc(VALUE io)
  *    f = File.open('t.txt')
  *    f.readchar     # => "F"
  *    f.close
- *    f = File.open('t.rus')
- *    f.readchar.ord # => 1090
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.open('t.ja')
+ *    f.readchar.ord # => 12371
  *    f.close
  *
  *  Related:  IO#getc (will not raise EOFError).
@@ -4989,8 +5092,9 @@ rb_io_readchar(VALUE io)
  *    f = File.open('t.txt')
  *    f.getbyte # => 70
  *    f.close
- *    f = File.open('t.rus')
- *    f.getbyte # => 209
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.open('t.ja')
+ *    f.getbyte # => 227
  *    f.close
  *
  *  Related: IO#readbyte (may raise EOFError).
@@ -5033,8 +5137,9 @@ rb_io_getbyte(VALUE io)
  *    f = File.open('t.txt')
  *    f.readbyte # => 70
  *    f.close
- *    f = File.open('t.rus')
- *    f.readbyte # => 209
+ *    File.read('t.ja') # => "こんにちは"
+ *    f = File.open('t.ja')
+ *    f.readbyte # => 227
  *    f.close
  *
  *  Related: IO#getbyte (will not raise EOFError).
@@ -5436,11 +5541,9 @@ maygvl_fclose(FILE *file, int keepgvl)
 }
 
 static void free_io_buffer(rb_io_buffer_t *buf);
-static void clear_codeconv(rb_io_t *fptr);
 
 static void
-fptr_finalize_flush(rb_io_t *fptr, int noraise, int keepgvl,
-                    struct rb_io_close_wait_list *busy)
+fptr_finalize_flush(rb_io_t *fptr, int noraise, int keepgvl)
 {
     VALUE error = Qnil;
     int fd = fptr->fd;
@@ -5480,20 +5583,8 @@ fptr_finalize_flush(rb_io_t *fptr, int noraise, int keepgvl,
     fptr->stdio_file = 0;
     fptr->mode &= ~(FMODE_READABLE|FMODE_WRITABLE);
 
-    // Ensure waiting_fd users do not hit EBADF.
-    if (busy) {
-        // Wait for them to exit before we call close().
-        rb_notify_fd_close_wait(busy);
-    }
-
-    // Disable for now.
-    // if (!done && fd >= 0) {
-    //     VALUE scheduler = rb_fiber_scheduler_current();
-    //     if (scheduler != Qnil) {
-    //         VALUE result = rb_fiber_scheduler_io_close(scheduler, fptr->self);
-    //         if (!UNDEF_P(result)) done = 1;
-    //     }
-    // }
+    // Wait for blocking operations to ensure they do not hit EBADF:
+    rb_thread_io_close_wait(fptr);
 
     if (!done && stdio_file) {
         // stdio_file is deallocated anyway even if fclose failed.
@@ -5506,6 +5597,15 @@ fptr_finalize_flush(rb_io_t *fptr, int noraise, int keepgvl,
         done = 1;
     }
 
+    VALUE scheduler = rb_fiber_scheduler_current();
+    if (!done && fd >= 0 && scheduler != Qnil) {
+        VALUE result = rb_fiber_scheduler_io_close(scheduler, RB_INT2NUM(fd));
+
+        if (!UNDEF_P(result)) {
+            done = RTEST(result);
+        }
+    }
+
     if (!done && fd >= 0) {
         // fptr->fd may be closed even if close fails. POSIX doesn't specify it.
         // We assumes it is closed.
@@ -5532,7 +5632,7 @@ fptr_finalize_flush(rb_io_t *fptr, int noraise, int keepgvl,
 static void
 fptr_finalize(rb_io_t *fptr, int noraise)
 {
-    fptr_finalize_flush(fptr, noraise, FALSE, 0);
+    fptr_finalize_flush(fptr, noraise, FALSE);
     free_io_buffer(&fptr->rbuf);
     free_io_buffer(&fptr->wbuf);
     clear_codeconv(fptr);
@@ -5553,7 +5653,7 @@ static void
 free_io_buffer(rb_io_buffer_t *buf)
 {
     if (buf->ptr) {
-        ruby_sized_xfree(buf->ptr, (size_t)buf->capa);
+        ruby_xfree_sized(buf->ptr, (size_t)buf->capa);
         buf->ptr = NULL;
     }
 }
@@ -5597,37 +5697,45 @@ rb_io_fptr_cleanup_all(rb_io_t *fptr)
     clear_codeconv(fptr);
 }
 
-void
-rb_io_fptr_finalize_internal(void *ptr)
+int
+rb_io_fptr_finalize(struct rb_io *io)
 {
-    if (!ptr) return;
-    rb_io_fptr_cleanup_all(ptr);
-    free(ptr);
+    if (!io) return 0;
+    rb_io_fptr_cleanup_all(io);
+    free(io);
+
+    return 1;
 }
 
-#undef rb_io_fptr_finalize
-int
-rb_io_fptr_finalize(rb_io_t *fptr)
+bool
+rb_io_fptr_finalize_closed(struct rb_io *io)
 {
-    if (!fptr) {
-        return 0;
-    }
-    else {
-        rb_io_fptr_finalize_internal(fptr);
-        return 1;
-    }
+    if (!io) return true;
+    if (io->fd >= 0) return false;
+    rb_io_fptr_finalize(io);
+    return true;
 }
-#define rb_io_fptr_finalize(fptr) rb_io_fptr_finalize_internal(fptr)
 
 size_t
-rb_io_memsize(const rb_io_t *fptr)
+rb_io_memsize(const rb_io_t *io)
 {
     size_t size = sizeof(rb_io_t);
-    size += fptr->rbuf.capa;
-    size += fptr->wbuf.capa;
-    size += fptr->cbuf.capa;
-    if (fptr->readconv) size += rb_econv_memsize(fptr->readconv);
-    if (fptr->writeconv) size += rb_econv_memsize(fptr->writeconv);
+    size += io->rbuf.capa;
+    size += io->wbuf.capa;
+    size += io->cbuf.capa;
+    if (io->readconv) size += rb_econv_memsize(io->readconv);
+    if (io->writeconv) size += rb_econv_memsize(io->writeconv);
+
+    struct rb_io_blocking_operation *blocking_operation = 0;
+
+    // Validate the fork generation of the IO object. If the IO object fork generation is different, the list of blocking operations is not valid memory. See `rb_io_blocking_operations` for the exact semantics.
+    rb_serial_t fork_generation = GET_VM()->fork_gen;
+    if (io->fork_generation == fork_generation) {
+        ccan_list_for_each(&io->blocking_operations, blocking_operation, list) {
+            size += sizeof(struct rb_io_blocking_operation);
+        }
+    }
+
     return size;
 }
 
@@ -5644,7 +5752,6 @@ io_close_fptr(VALUE io)
     rb_io_t *fptr;
     VALUE write_io;
     rb_io_t *write_fptr;
-    struct rb_io_close_wait_list busy;
 
     write_io = GetWriteIO(io);
     if (io != write_io) {
@@ -5658,10 +5765,12 @@ io_close_fptr(VALUE io)
     if (!fptr) return 0;
     if (fptr->fd < 0) return 0;
 
-    if (rb_notify_fd_close(fptr->fd, &busy)) {
+    // This guards against multiple threads closing the same IO object:
+    if (rb_thread_io_close_interrupt(fptr)) {
         /* calls close(fptr->fd): */
-        fptr_finalize_flush(fptr, FALSE, KEEPGVL, &busy);
+        fptr_finalize_flush(fptr, FALSE, KEEPGVL);
     }
+
     rb_io_fptr_cleanup(fptr, FALSE);
     return fptr;
 }
@@ -5699,6 +5808,9 @@ rb_io_close(VALUE io)
  *  If the stream was opened by IO.popen, sets global variable <tt>$?</tt>
  *  (child exit status).
  *
+ *  It is not an error to close an IO object that has already been closed.
+ *  It just returns nil.
+ *
  *  Example:
  *
  *    IO.popen('ruby', 'r+') do |pipe|
@@ -6082,7 +6194,7 @@ rb_io_sysread(int argc, VALUE *argv, VALUE io)
 }
 
 struct prdwr_internal_arg {
-    VALUE io;
+    struct rb_io *io;
     int fd;
     void *buf;
     size_t count;
@@ -6104,14 +6216,14 @@ pread_internal_call(VALUE _arg)
 
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
-        VALUE result = rb_fiber_scheduler_io_pread_memory(scheduler, arg->io, arg->offset, arg->buf, arg->count, 0);
+        VALUE result = rb_fiber_scheduler_io_pread_memory(scheduler, arg->io->self, arg->offset, arg->buf, arg->count, 0);
 
         if (!UNDEF_P(result)) {
             return rb_fiber_scheduler_io_result_apply(result);
         }
     }
 
-    return rb_thread_io_blocking_call(internal_pread_func, arg, arg->fd, RB_WAITFD_IN);
+    return rb_io_blocking_region_wait(arg->io, internal_pread_func, arg, RUBY_IO_READABLE);
 }
 
 /*
@@ -6148,7 +6260,7 @@ rb_io_pread(int argc, VALUE *argv, VALUE io)
     VALUE len, offset, str;
     rb_io_t *fptr;
     ssize_t n;
-    struct prdwr_internal_arg arg = {.io = io};
+    struct prdwr_internal_arg arg;
     int shrinkable;
 
     rb_scan_args(argc, argv, "21", &len, &offset, &str);
@@ -6162,6 +6274,7 @@ rb_io_pread(int argc, VALUE *argv, VALUE io)
     GetOpenFile(io, fptr);
     rb_io_check_byte_readable(fptr);
 
+    arg.io = fptr;
     arg.fd = fptr->fd;
     rb_io_check_closed(fptr);
 
@@ -6184,17 +6297,24 @@ internal_pwrite_func(void *_arg)
 {
     struct prdwr_internal_arg *arg = _arg;
 
+    return (VALUE)pwrite(arg->fd, arg->buf, arg->count, arg->offset);
+}
+
+static VALUE
+pwrite_internal_call(VALUE _arg)
+{
+    struct prdwr_internal_arg *arg = (struct prdwr_internal_arg *)_arg;
+
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
-        VALUE result = rb_fiber_scheduler_io_pwrite_memory(scheduler, arg->io, arg->offset, arg->buf, arg->count, 0);
+        VALUE result = rb_fiber_scheduler_io_pwrite_memory(scheduler, arg->io->self, arg->offset, arg->buf, arg->count, 0);
 
         if (!UNDEF_P(result)) {
             return rb_fiber_scheduler_io_result_apply(result);
         }
     }
 
-
-    return (VALUE)pwrite(arg->fd, arg->buf, arg->count, arg->offset);
+    return rb_io_blocking_region_wait(arg->io, internal_pwrite_func, arg, RUBY_IO_WRITABLE);
 }
 
 /*
@@ -6227,7 +6347,7 @@ rb_io_pwrite(VALUE io, VALUE str, VALUE offset)
 {
     rb_io_t *fptr;
     ssize_t n;
-    struct prdwr_internal_arg arg = {.io = io};
+    struct prdwr_internal_arg arg;
     VALUE tmp;
 
     if (!RB_TYPE_P(str, T_STRING))
@@ -6238,13 +6358,15 @@ rb_io_pwrite(VALUE io, VALUE str, VALUE offset)
     io = GetWriteIO(io);
     GetOpenFile(io, fptr);
     rb_io_check_writable(fptr);
+
+    arg.io = fptr;
     arg.fd = fptr->fd;
 
     tmp = rb_str_tmp_frozen_acquire(str);
     arg.buf = RSTRING_PTR(tmp);
     arg.count = (size_t)RSTRING_LEN(tmp);
 
-    n = (ssize_t)rb_thread_io_blocking_call(internal_pwrite_func, &arg, fptr->fd, RB_WAITFD_OUT);
+    n = (ssize_t)pwrite_internal_call((VALUE)&arg);
     if (n < 0) rb_sys_fail_path(fptr->pathv);
     rb_str_tmp_frozen_release(str, tmp);
 
@@ -6349,7 +6471,7 @@ rb_io_binmode_p(VALUE io)
 }
 
 static const char*
-rb_io_fmode_modestr(int fmode)
+rb_io_fmode_modestr(enum rb_io_mode fmode)
 {
     if (fmode & FMODE_APPEND) {
         if ((fmode & FMODE_READWRITE) == FMODE_READWRITE) {
@@ -6383,10 +6505,10 @@ io_encname_bom_p(const char *name, long len)
     return len > bom_prefix_len && STRNCASECMP(name, bom_prefix, bom_prefix_len) == 0;
 }
 
-int
+enum rb_io_mode
 rb_io_modestr_fmode(const char *modestr)
 {
-    int fmode = 0;
+    enum rb_io_mode fmode = 0;
     const char *m = modestr, *p = NULL;
 
     switch (*m++) {
@@ -6443,7 +6565,7 @@ rb_io_modestr_fmode(const char *modestr)
 int
 rb_io_oflags_fmode(int oflags)
 {
-    int fmode = 0;
+    enum rb_io_mode fmode = 0;
 
     switch (oflags & O_ACCMODE) {
       case O_RDONLY:
@@ -6479,7 +6601,7 @@ rb_io_oflags_fmode(int oflags)
 }
 
 static int
-rb_io_fmode_oflags(int fmode)
+rb_io_fmode_oflags(enum rb_io_mode fmode)
 {
     int oflags = 0;
 
@@ -6564,7 +6686,7 @@ rb_io_oflags_modestr(int oflags)
  * Qnil => no encoding specified (internal only)
  */
 static void
-rb_io_ext_int_to_encs(rb_encoding *ext, rb_encoding *intern, rb_encoding **enc, rb_encoding **enc2, int fmode)
+rb_io_ext_int_to_encs(rb_encoding *ext, rb_encoding *intern, rb_encoding **enc, rb_encoding **enc2, enum rb_io_mode fmode)
 {
     int default_ext = 0;
 
@@ -6599,12 +6721,12 @@ unsupported_encoding(const char *name, rb_encoding *enc)
 
 static void
 parse_mode_enc(const char *estr, rb_encoding *estr_enc,
-               rb_encoding **enc_p, rb_encoding **enc2_p, int *fmode_p)
+               rb_encoding **enc_p, rb_encoding **enc2_p, enum rb_io_mode *fmode_p)
 {
     const char *p;
     char encname[ENCODING_MAXNAMELEN+1];
     int idx, idx2;
-    int fmode = fmode_p ? *fmode_p : 0;
+    enum rb_io_mode fmode = fmode_p ? *fmode_p : 0;
     rb_encoding *ext_enc, *int_enc;
     long len;
 
@@ -6666,7 +6788,7 @@ parse_mode_enc(const char *estr, rb_encoding *estr_enc,
 }
 
 int
-rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **enc2_p, int *fmode_p)
+rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **enc2_p, enum rb_io_mode *fmode_p)
 {
     VALUE encoding=Qnil, extenc=Qundef, intenc=Qundef, tmp;
     int extracted = 0;
@@ -6735,9 +6857,9 @@ rb_io_extract_encoding_option(VALUE opt, rb_encoding **enc_p, rb_encoding **enc2
 }
 
 static void
-validate_enc_binmode(int *fmode_p, int ecflags, rb_encoding *enc, rb_encoding *enc2)
+validate_enc_binmode(enum rb_io_mode *fmode_p, int ecflags, rb_encoding *enc, rb_encoding *enc2)
 {
-    int fmode = *fmode_p;
+    enum rb_io_mode fmode = *fmode_p;
 
     if ((fmode & FMODE_READABLE) &&
         !enc2 &&
@@ -6762,7 +6884,7 @@ validate_enc_binmode(int *fmode_p, int ecflags, rb_encoding *enc, rb_encoding *e
 }
 
 static void
-extract_binmode(VALUE opthash, int *fmode)
+extract_binmode(VALUE opthash, enum rb_io_mode *fmode)
 {
     if (!NIL_P(opthash)) {
         VALUE v;
@@ -6792,10 +6914,11 @@ extract_binmode(VALUE opthash, int *fmode)
 
 void
 rb_io_extract_modeenc(VALUE *vmode_p, VALUE *vperm_p, VALUE opthash,
-        int *oflags_p, int *fmode_p, struct rb_io_encoding *convconfig_p)
+        int *oflags_p, enum rb_io_mode *fmode_p, struct rb_io_encoding *convconfig_p)
 {
     VALUE vmode;
-    int oflags, fmode;
+    int oflags;
+    enum rb_io_mode fmode;
     rb_encoding *enc, *enc2;
     int ecflags;
     VALUE ecopts;
@@ -6953,7 +7076,10 @@ sysopen_func(void *ptr)
 static inline int
 rb_sysopen_internal(struct sysopen_struct *data)
 {
-    int fd = IO_WITHOUT_GVL_INT(sysopen_func, data);
+    int fd;
+    do {
+        fd = IO_WITHOUT_GVL_INT(sysopen_func, data);
+    } while (fd < 0 && errno == EINTR);
     if (0 <= fd)
         rb_update_max_fd(fd);
     return fd;
@@ -7107,7 +7233,7 @@ io_set_encoding_by_bom(VALUE io)
 }
 
 static VALUE
-rb_file_open_generic(VALUE io, VALUE filename, int oflags, int fmode,
+rb_file_open_generic(VALUE io, VALUE filename, int oflags, enum rb_io_mode fmode,
                      const struct rb_io_encoding *convconfig, mode_t perm)
 {
     VALUE pathv;
@@ -7144,7 +7270,7 @@ rb_file_open_generic(VALUE io, VALUE filename, int oflags, int fmode,
 static VALUE
 rb_file_open_internal(VALUE io, VALUE filename, const char *modestr)
 {
-    int fmode = rb_io_modestr_fmode(modestr);
+    enum rb_io_mode fmode = rb_io_modestr_fmode(modestr);
     const char *p = strchr(modestr, ':');
     struct rb_io_encoding convconfig;
 
@@ -7460,7 +7586,7 @@ char *rb_execarg_commandline(const struct rb_execarg *eargp, VALUE *prog);
 
 #ifndef __EMSCRIPTEN__
 static VALUE
-pipe_open(VALUE execarg_obj, const char *modestr, int fmode,
+pipe_open(VALUE execarg_obj, const char *modestr, enum rb_io_mode fmode,
           const struct rb_io_encoding *convconfig)
 {
     struct rb_execarg *eargp = NIL_P(execarg_obj) ? NULL : rb_execarg_get(execarg_obj);
@@ -7689,7 +7815,7 @@ pipe_open(VALUE execarg_obj, const char *modestr, int fmode,
 }
 #else
 static VALUE
-pipe_open(VALUE execarg_obj, const char *modestr, int fmode,
+pipe_open(VALUE execarg_obj, const char *modestr, enum rb_io_mode fmode,
           const struct rb_io_encoding *convconfig)
 {
     rb_raise(rb_eNotImpError, "popen() is not available");
@@ -7711,7 +7837,7 @@ is_popen_fork(VALUE prog)
 }
 
 static VALUE
-pipe_open_s(VALUE prog, const char *modestr, int fmode,
+pipe_open_s(VALUE prog, const char *modestr, enum rb_io_mode fmode,
             const struct rb_io_encoding *convconfig)
 {
     int argc = 1;
@@ -7744,7 +7870,7 @@ static VALUE popen_finish(VALUE port, VALUE klass);
  *  whose $stdin and $stdout are connected to a new stream +io+.
  *
  *  This method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
+ *  see {Command Injection}[rdoc-ref:security/command_injection.rdoc].
  *
  *  If no block is given, returns the new stream,
  *  which depending on given +mode+ may be open for reading, writing, or both.
@@ -7753,7 +7879,8 @@ static VALUE popen_finish(VALUE port, VALUE klass);
  *  If a block is given, the stream is passed to the block
  *  (again, open for reading, writing, or both);
  *  when the block exits, the stream is closed,
- *  and the block's value is assigned to global variable <tt>$?</tt> and returned.
+ *  the block's value is returned,
+ *  and the global variable <tt>$?</tt> is set to the child's exit status.
  *
  *  Optional argument +mode+ may be any valid \IO mode.
  *  See {Access Modes}[rdoc-ref:File@Access+Modes].
@@ -7782,7 +7909,7 @@ static VALUE popen_finish(VALUE port, VALUE klass);
  *  - {Encoding options}[rdoc-ref:encodings.rdoc@Encoding+Options].
  *  - Options for Kernel#spawn.
  *
- *  <b>Forked \Process</b>
+ *  <b>Forked Process</b>
  *
  *  When argument +cmd+ is the 1-character string <tt>'-'</tt>, causes the process to fork:
  *    IO.popen('-') do |pipe|
@@ -7920,7 +8047,8 @@ rb_io_popen(VALUE pname, VALUE pmode, VALUE env, VALUE opt)
 {
     const char *modestr;
     VALUE tmp, execarg_obj = Qnil;
-    int oflags, fmode;
+    int oflags;
+    enum rb_io_mode fmode;
     struct rb_io_encoding convconfig;
 
     tmp = rb_check_array_type(pname);
@@ -7958,10 +8086,10 @@ popen_finish(VALUE port, VALUE klass)
     if (NIL_P(port)) {
         /* child */
         if (rb_block_given_p()) {
-            rb_yield(Qnil);
+            rb_protect(rb_yield, Qnil, NULL);
             rb_io_flush(rb_ractor_stdout());
             rb_io_flush(rb_ractor_stderr());
-            _exit(0);
+            _exit(EXIT_SUCCESS);
         }
         return Qnil;
     }
@@ -8001,7 +8129,12 @@ ruby_popen_writer(char *const *argv, rb_pid_t *pid)
     int write_pair[2];
 # endif
 
-    int result = rb_cloexec_pipe(write_pair);
+#ifdef HAVE_PIPE2
+    int result = pipe2(write_pair, O_CLOEXEC);
+#else
+    int result = pipe(write_pair);
+#endif
+
     *pid = -1;
     if (result == 0) {
 # ifdef HAVE_WORKING_FORK
@@ -8029,8 +8162,9 @@ ruby_popen_writer(char *const *argv, rb_pid_t *pid)
 static VALUE
 rb_open_file(VALUE io, VALUE fname, VALUE vmode, VALUE vperm, VALUE opt)
 {
+    int oflags;
+    enum rb_io_mode fmode;
     struct rb_io_encoding convconfig;
-    int oflags, fmode;
     mode_t perm;
 
     FilePathValue(fname);
@@ -8132,21 +8266,6 @@ rb_io_s_sysopen(int argc, VALUE *argv, VALUE _)
     return INT2NUM(fd);
 }
 
-static VALUE
-check_pipe_command(VALUE filename_or_command)
-{
-    char *s = RSTRING_PTR(filename_or_command);
-    long l = RSTRING_LEN(filename_or_command);
-    char *e = s + l;
-    int chlen;
-
-    if (rb_enc_ascget(s, e, &chlen, rb_enc_get(filename_or_command)) == '|') {
-        VALUE cmd = rb_str_new(s+chlen, l-chlen);
-        return cmd;
-    }
-    return Qnil;
-}
-
 /*
  *  call-seq:
  *    open(path, mode = 'r', perm = 0666, **opts)             -> io or nil
@@ -8154,9 +8273,6 @@ check_pipe_command(VALUE filename_or_command)
  *
  *  Creates an IO object connected to the given file.
  *
- *  This method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  *  With no block given, file stream is returned:
  *
  *    open('t.txt') # => #<File:t.txt>
@@ -8192,13 +8308,7 @@ rb_f_open(int argc, VALUE *argv, VALUE _)
                 redirect = TRUE;
             }
             else {
-                VALUE cmd = check_pipe_command(tmp);
-                if (!NIL_P(cmd)) {
-                    // TODO: when removed in 4.0, update command_injection.rdoc
-                    rb_warn_deprecated_to_remove_at(4.0, "Calling Kernel#open with a leading '|'", "IO.popen");
-                    argv[0] = cmd;
-                    return rb_io_s_popen(argc, argv, rb_cIO);
-                }
+                argv[0] = tmp;
             }
         }
     }
@@ -8213,12 +8323,19 @@ rb_f_open(int argc, VALUE *argv, VALUE _)
     return rb_io_s_open(argc, argv, rb_cFile);
 }
 
-static VALUE rb_io_open_generic(VALUE, VALUE, int, int, const struct rb_io_encoding *, mode_t);
+static VALUE
+rb_io_open_generic(VALUE klass, VALUE filename, int oflags, enum rb_io_mode fmode,
+                   const struct rb_io_encoding *convconfig, mode_t perm)
+{
+    return rb_file_open_generic(io_alloc(klass), filename,
+                                oflags, fmode, convconfig, perm);
+}
 
 static VALUE
 rb_io_open(VALUE io, VALUE filename, VALUE vmode, VALUE vperm, VALUE opt)
 {
-    int oflags, fmode;
+    int oflags;
+    enum rb_io_mode fmode;
     struct rb_io_encoding convconfig;
     mode_t perm;
 
@@ -8228,22 +8345,6 @@ rb_io_open(VALUE io, VALUE filename, VALUE vmode, VALUE vperm, VALUE opt)
 }
 
 static VALUE
-rb_io_open_generic(VALUE klass, VALUE filename, int oflags, int fmode,
-                   const struct rb_io_encoding *convconfig, mode_t perm)
-{
-    VALUE cmd;
-    if (klass == rb_cIO && !NIL_P(cmd = check_pipe_command(filename))) {
-        // TODO: when removed in 4.0, update command_injection.rdoc
-        rb_warn_deprecated_to_remove_at(4.0, "IO process creation with a leading '|'", "IO.popen");
-        return pipe_open_s(cmd, rb_io_oflags_modestr(oflags), fmode, convconfig);
-    }
-    else {
-        return rb_file_open_generic(io_alloc(klass), filename,
-                                    oflags, fmode, convconfig, perm);
-    }
-}
-
-static VALUE
 io_reopen(VALUE io, VALUE nfile)
 {
     rb_io_t *fptr, *orig;
@@ -8270,7 +8371,7 @@ io_reopen(VALUE io, VALUE nfile)
             rb_sys_fail_on_write(fptr);
     }
     else {
-        flush_before_seek(fptr);
+        flush_before_seek(fptr, true);
     }
     if (orig->mode & FMODE_READABLE) {
         pos = io_tell(orig);
@@ -8282,6 +8383,7 @@ io_reopen(VALUE io, VALUE nfile)
 
     /* copy rb_io_t structure */
     fptr->mode = orig->mode | (fptr->mode & FMODE_EXTERNAL);
+    fptr->encs = orig->encs;
     fptr->pid = orig->pid;
     fptr->lineno = orig->lineno;
     if (RTEST(orig->pathv)) fptr->pathv = orig->pathv;
@@ -8291,6 +8393,10 @@ io_reopen(VALUE io, VALUE nfile)
     fd = fptr->fd;
     fd2 = orig->fd;
     if (fd != fd2) {
+        // Interrupt all usage of the old file descriptor:
+        rb_thread_io_close_interrupt(fptr);
+        rb_thread_io_close_wait(fptr);
+
         if (RUBY_IO_EXTERNAL_P(fptr) || fd <= 2 || !fptr->stdio_file) {
             /* need to keep FILE objects of stdin, stdout and stderr */
             if (rb_cloexec_dup2(fd2, fd) < 0)
@@ -8306,7 +8412,7 @@ io_reopen(VALUE io, VALUE nfile)
             rb_update_max_fd(fd);
             fptr->fd = fd;
         }
-        rb_thread_fd_close(fd);
+
         if ((orig->mode & FMODE_READABLE) && pos >= 0) {
             if (io_seek(fptr, pos, SEEK_SET) < 0 && errno) {
                 rb_sys_fail_path(fptr->pathv);
@@ -8395,7 +8501,7 @@ rb_io_reopen(int argc, VALUE *argv, VALUE file)
     }
 
     if (!NIL_P(nmode) || !NIL_P(opt)) {
-        int fmode;
+        enum rb_io_mode fmode;
         struct rb_io_encoding convconfig;
 
         rb_io_extract_modeenc(&nmode, 0, opt, &oflags, &fmode, &convconfig);
@@ -8483,6 +8589,12 @@ rb_io_init_copy(VALUE dest, VALUE io)
     fptr->pid = orig->pid;
     fptr->lineno = orig->lineno;
     fptr->timeout = orig->timeout;
+
+    ccan_list_head_init(&fptr->blocking_operations);
+    fptr->closing_ec = NULL;
+    fptr->wakeup_mutex = Qnil;
+    fptr->fork_generation = GET_VM()->fork_gen;
+
     if (!NIL_P(orig->pathv)) fptr->pathv = orig->pathv;
     fptr_copy_finalizer(fptr, orig);
 
@@ -8512,7 +8624,7 @@ rb_io_init_copy(VALUE dest, VALUE io)
  *  Formats and writes +objects+ to the stream.
  *
  *  For details on +format_string+, see
- *  {Format Specifications}[rdoc-ref:format_specifications.rdoc].
+ *  {Format Specifications}[rdoc-ref:language/format_specifications.rdoc].
  *
  */
 
@@ -8533,7 +8645,7 @@ rb_io_printf(int argc, const VALUE *argv, VALUE out)
  *    io.write(sprintf(format_string, *objects))
  *
  *  For details on +format_string+, see
- *  {Format Specifications}[rdoc-ref:format_specifications.rdoc].
+ *  {Format Specifications}[rdoc-ref:language/format_specifications.rdoc].
  *
  *  With the single argument +format_string+, formats +objects+ into the string,
  *  then writes the formatted string to $stdout:
@@ -8576,12 +8688,19 @@ rb_f_printf(int argc, VALUE *argv, VALUE _)
     return Qnil;
 }
 
+extern void rb_deprecated_str_setter(VALUE val, ID id, VALUE *var);
+
 static void
-deprecated_str_setter(VALUE val, ID id, VALUE *var)
+deprecated_rs_setter(VALUE val, ID id, VALUE *var)
 {
-    rb_str_setter(val, id, &val);
+    rb_deprecated_str_setter(val, id, &val);
     if (!NIL_P(val)) {
-        rb_warn_deprecated("'%s'", NULL, rb_id2name(id));
+        if (rb_str_equal(val, rb_default_rs)) {
+            val = rb_default_rs;
+        }
+        else {
+            val = rb_str_frozen_bare_string(val);
+        }
     }
     *var = val;
 }
@@ -9201,6 +9320,11 @@ rb_io_open_descriptor(VALUE klass, int descriptor, int mode, VALUE path, VALUE t
 
     io->timeout = timeout;
 
+    ccan_list_head_init(&io->blocking_operations);
+    io->closing_ec = NULL;
+    io->wakeup_mutex = Qnil;
+    io->fork_generation = GET_VM()->fork_gen;
+
     if (encoding) {
         io->encs = *encoding;
     }
@@ -9211,7 +9335,7 @@ rb_io_open_descriptor(VALUE klass, int descriptor, int mode, VALUE path, VALUE t
 }
 
 static VALUE
-prep_io(int fd, int fmode, VALUE klass, const char *path)
+prep_io(int fd, enum rb_io_mode fmode, VALUE klass, const char *path)
 {
     VALUE path_value = Qnil;
     rb_encoding *e;
@@ -9257,7 +9381,7 @@ rb_io_fdopen(int fd, int oflags, const char *path)
 }
 
 static VALUE
-prep_stdio(FILE *f, int fmode, VALUE klass, const char *path)
+prep_stdio(FILE *f, enum rb_io_mode fmode, VALUE klass, const char *path)
 {
     rb_io_t *fptr;
     VALUE io = prep_io(fileno(f), fmode|FMODE_EXTERNAL|DEFAULT_TEXTMODE, klass, path);
@@ -9340,6 +9464,10 @@ rb_io_fptr_new(void)
     fp->encs.ecopts = Qnil;
     fp->write_lock = Qnil;
     fp->timeout = Qnil;
+    ccan_list_head_init(&fp->blocking_operations);
+    fp->closing_ec = NULL;
+    fp->wakeup_mutex = Qnil;
+    fp->fork_generation = GET_VM()->fork_gen;
     return fp;
 }
 
@@ -9381,7 +9509,8 @@ static VALUE io_initialize(VALUE io, VALUE fnum, VALUE vmode, VALUE opt);
  *  The new \IO object does not inherit encoding
  *  (because the integer file descriptor does not have an encoding):
  *
- *    fd = IO.sysopen('t.rus', 'rb')
+ *    File.read('t.ja') # => "こんにちは"
+ *    fd = IO.sysopen('t.ja', 'rb')
  *    io = IO.new(fd)
  *    io.external_encoding # => #<Encoding:UTF-8> # Not ASCII-8BIT.
  *
@@ -9417,7 +9546,8 @@ static VALUE
 io_initialize(VALUE io, VALUE fnum, VALUE vmode, VALUE opt)
 {
     rb_io_t *fp;
-    int fd, fmode, oflags = O_RDONLY;
+    int fd, oflags = O_RDONLY;
+    enum rb_io_mode fmode;
     struct rb_io_encoding convconfig;
 #if defined(HAVE_FCNTL) && defined(F_GETFL)
     int ofmode;
@@ -9469,6 +9599,10 @@ io_initialize(VALUE io, VALUE fnum, VALUE vmode, VALUE opt)
     fp->encs = convconfig;
     fp->pathv = path;
     fp->timeout = Qnil;
+    ccan_list_head_init(&fp->blocking_operations);
+    fp->closing_ec = NULL;
+    fp->wakeup_mutex = Qnil;
+    fp->fork_generation = GET_VM()->fork_gen;
     clear_codeconv(fp);
     io_check_tty(fp);
     if (fileno(stdin) == fd)
@@ -9698,7 +9832,7 @@ io_wait_readable(int argc, VALUE *argv, VALUE io)
     rb_io_t *fptr;
 
     RB_IO_POINTER(io, fptr);
-    rb_io_check_readable(fptr);
+    rb_io_check_char_readable(fptr);
 
     if (rb_io_read_pending(fptr)) return Qtrue;
 
@@ -9745,7 +9879,7 @@ io_wait_priority(int argc, VALUE *argv, VALUE io)
     rb_io_t *fptr = NULL;
 
     RB_IO_POINTER(io, fptr);
-    rb_io_check_readable(fptr);
+    rb_io_check_char_readable(fptr);
 
     if (rb_io_read_pending(fptr)) return Qtrue;
 
@@ -9802,7 +9936,7 @@ io_event_from_value(VALUE value)
 /*
  * call-seq:
  *   io.wait(events, timeout) -> event mask, false or nil
- *   io.wait(timeout = nil, mode = :read) -> self, true, or false
+ *   io.wait(*event_symbols[, timeout]) -> self, true, or false
  *
  * Waits until the IO becomes ready for the specified events and returns the
  * subset of events that become ready, or a falsy value when times out.
@@ -9810,10 +9944,14 @@ io_event_from_value(VALUE value)
  * The events can be a bit mask of +IO::READABLE+, +IO::WRITABLE+ or
  * +IO::PRIORITY+.
  *
- * Returns an event mask (truthy value) immediately when buffered data is available.
+ * Returns an event mask (truthy value) immediately when buffered data is
+ * available.
  *
- * Optional parameter +mode+ is one of +:read+, +:write+, or
- * +:read_write+.
+ * The second form: if one or more event symbols (+:read+, +:write+, or
+ * +:read_write+) are passed, the event mask is the bit OR of the bitmask
+ * corresponding to those symbols.  In this form, +timeout+ is optional, the
+ * order of the arguments is arbitrary, and returns +io+ if any of the
+ * events is ready.
  */
 
 static VALUE
@@ -9823,10 +9961,6 @@ io_wait(int argc, VALUE *argv, VALUE io)
     enum rb_io_event events = 0;
     int return_io = 0;
 
-    // The documented signature for this method is actually incorrect.
-    // A single timeout is allowed in any position, and multiple symbols can be given.
-    // Whether this is intentional or not, I don't know, and as such I consider this to
-    // be a legacy/slow path.
     if (argc != 2 || (RB_SYMBOL_P(argv[0]) || RB_SYMBOL_P(argv[1]))) {
         // We'd prefer to return the actual mask, but this form would return the io itself:
         return_io = 1;
@@ -9872,14 +10006,14 @@ io_wait(int argc, VALUE *argv, VALUE io)
 }
 
 static void
-argf_mark(void *ptr)
+argf_mark_and_move(void *ptr)
 {
     struct argf *p = ptr;
-    rb_gc_mark(p->filename);
-    rb_gc_mark(p->current_file);
-    rb_gc_mark(p->argv);
-    rb_gc_mark(p->inplace);
-    rb_gc_mark(p->encs.ecopts);
+    rb_gc_mark_and_move(&p->filename);
+    rb_gc_mark_and_move(&p->current_file);
+    rb_gc_mark_and_move(&p->argv);
+    rb_gc_mark_and_move(&p->inplace);
+    rb_gc_mark_and_move(&p->encs.ecopts);
 }
 
 static size_t
@@ -9892,17 +10026,17 @@ argf_memsize(const void *ptr)
 
 static const rb_data_type_t argf_type = {
     "ARGF",
-    {argf_mark, RUBY_TYPED_DEFAULT_FREE, argf_memsize},
-    0, 0, RUBY_TYPED_FREE_IMMEDIATELY
+    {argf_mark_and_move, RUBY_TYPED_DEFAULT_FREE, argf_memsize, argf_mark_and_move},
+    0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED
 };
 
 static inline void
-argf_init(struct argf *p, VALUE v)
+argf_init(VALUE argf, struct argf *p, VALUE v)
 {
     p->filename = Qnil;
     p->current_file = Qnil;
     p->lineno = 0;
-    p->argv = v;
+    RB_OBJ_WRITE(argf, &p->argv, v);
 }
 
 static VALUE
@@ -9911,7 +10045,7 @@ argf_alloc(VALUE klass)
     struct argf *p;
     VALUE argf = TypedData_Make_Struct(klass, struct argf, &argf_type, p);
 
-    argf_init(p, Qnil);
+    argf_init(argf, p, Qnil);
     return argf;
 }
 
@@ -9922,7 +10056,7 @@ static VALUE
 argf_initialize(VALUE argf, VALUE argv)
 {
     memset(&ARGF, 0, sizeof(ARGF));
-    argf_init(&ARGF, argv);
+    argf_init(argf, &ARGF, argv);
 
     return argf;
 }
@@ -9933,7 +10067,8 @@ argf_initialize_copy(VALUE argf, VALUE orig)
 {
     if (!OBJ_INIT_COPY(argf, orig)) return argf;
     ARGF = argf_of(orig);
-    ARGF.argv = rb_obj_dup(ARGF.argv);
+    rb_gc_writebarrier_remember(argf);
+    ARGF_SET(argv, rb_obj_dup(ARGF.argv));
     return argf;
 }
 
@@ -10018,7 +10153,7 @@ argf_next_argv(VALUE argf)
     char *fn;
     rb_io_t *fptr;
     int stdout_binmode = 0;
-    int fmode;
+    enum rb_io_mode fmode;
 
     VALUE r_stdout = rb_ractor_stdout();
 
@@ -10052,11 +10187,11 @@ argf_next_argv(VALUE argf)
         if (RARRAY_LEN(ARGF.argv) > 0) {
             VALUE filename = rb_ary_shift(ARGF.argv);
             FilePathValue(filename);
-            ARGF.filename = filename;
+            ARGF_SET(filename, filename);
             filename = rb_str_encode_ospath(filename);
             fn = StringValueCStr(filename);
             if (RSTRING_LEN(filename) == 1 && fn[0] == '-') {
-                ARGF.current_file = rb_stdin;
+                ARGF_SET(current_file, rb_stdin);
                 if (ARGF.inplace) {
                     rb_warn("Can't do inplace edit for stdio; skipping");
                     goto retry;
@@ -10151,7 +10286,7 @@ argf_next_argv(VALUE argf)
                 if (!ARGF.binmode) {
                     fmode |= DEFAULT_TEXTMODE;
                 }
-                ARGF.current_file = prep_io(fr, fmode, rb_cFile, fn);
+                ARGF_SET(current_file, prep_io(fr, fmode, rb_cFile, fn));
                 if (!NIL_P(write_io)) {
                     rb_io_set_write_io(ARGF.current_file, write_io);
                 }
@@ -10180,8 +10315,8 @@ argf_next_argv(VALUE argf)
         }
     }
     else if (ARGF.next_p == -1) {
-        ARGF.current_file = rb_stdin;
-        ARGF.filename = rb_str_new2("-");
+        ARGF_SET(current_file, rb_stdin);
+        ARGF_SET(filename, rb_str_new2("-"));
         if (ARGF.inplace) {
             rb_warn("Can't do inplace edit for stdio");
             rb_ractor_stdout_set(orig_stdout);
@@ -10523,14 +10658,14 @@ argf_readlines(int argc, VALUE *argv, VALUE argf)
  *  sets global variable <tt>$?</tt> to the process status.
  *
  *  This method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
+ *  see {Command Injection}[rdoc-ref:security/command_injection.rdoc].
  *
  *  Examples:
  *
  *    $ `date`                 # => "Wed Apr  9 08:56:30 CDT 2003\n"
  *    $ `echo oops && exit 99` # => "oops\n"
  *    $ $?                     # => #<Process::Status: pid 17088 exit 99>
- *    $ $?.status              # => 99>
+ *    $ $?.exitstatus          # => 99
  *
  *  The built-in syntax <tt>%x{...}</tt> uses this method.
  *
@@ -10634,9 +10769,9 @@ select_internal(VALUE read, VALUE write, VALUE except, struct timeval *tp, rb_fd
     if (!pending && n == 0) return Qnil; /* returns nil on timeout */
 
     res = rb_ary_new2(3);
-    rb_ary_push(res, rp?rb_ary_new():rb_ary_new2(0));
-    rb_ary_push(res, wp?rb_ary_new():rb_ary_new2(0));
-    rb_ary_push(res, ep?rb_ary_new():rb_ary_new2(0));
+    rb_ary_push(res, rp ? rb_ary_new_capa(RARRAY_LEN(read)) : rb_ary_new());
+    rb_ary_push(res, wp ? rb_ary_new_capa(RARRAY_LEN(write)) : rb_ary_new());
+    rb_ary_push(res, ep ? rb_ary_new_capa(RARRAY_LEN(except)) : rb_ary_new());
 
     if (rp) {
         list = RARRAY_AREF(res, 0);
@@ -10786,7 +10921,7 @@ do_io_advise(rb_io_t *fptr, VALUE advice, rb_off_t offset, rb_off_t len)
     ias.offset = offset;
     ias.len    = len;
 
-    rv = (int)rb_thread_io_blocking_region(io_advise_internal, &ias, fptr->fd);
+    rv = (int)rb_io_blocking_region(fptr, io_advise_internal, &ias);
     if (rv && rv != ENOSYS) {
         /* posix_fadvise(2) doesn't set errno. On success it returns 0; otherwise
            it returns the error code. */
@@ -10824,7 +10959,7 @@ advice_arg_check(VALUE advice)
  *    advise(advice, offset = 0, len = 0) -> nil
  *
  *  Invokes Posix system call
- *  {posix_fadvise(2)}[https://linux.die.net/man/2/posix_fadvise],
+ *  {posix_fadvise(2)}[https://man7.org/linux/man-pages/man2/posix_fadvise.2.html],
  *  which announces an intention to access data from the current file
  *  in a particular manner.
  *
@@ -10876,11 +11011,21 @@ rb_io_advise(int argc, VALUE *argv, VALUE io)
 #endif
 }
 
+static int
+is_pos_inf(VALUE x)
+{
+    double f;
+    if (!RB_FLOAT_TYPE_P(x))
+        return 0;
+    f = RFLOAT_VALUE(x);
+    return isinf(f) && 0 < f;
+}
+
 /*
  *  call-seq:
  *    IO.select(read_ios, write_ios = [], error_ios = [], timeout = nil) -> array or nil
  *
- *  Invokes system call {select(2)}[https://linux.die.net/man/2/select],
+ *  Invokes system call {select(2)}[https://man7.org/linux/man-pages/man2/select.2.html],
  *  which monitors multiple file descriptors,
  *  waiting until one or more of the file descriptors
  *  becomes ready for some class of I/O operation.
@@ -10892,6 +11037,8 @@ rb_io_advise(int argc, VALUE *argv, VALUE io)
  *
  *  Argument +timeout+ is a numeric value (such as integer or float) timeout
  *  interval in seconds.
+ *  +timeout+ can also be +nil+ or +Float::INFINITY+.
+ *  +nil+ and +Float::INFINITY+ means no timeout.
  *
  *  The method monitors the \IO objects given in all three arrays,
  *  waiting for some to be ready;
@@ -10965,7 +11112,7 @@ rb_io_advise(int argc, VALUE *argv, VALUE io)
  *  Finally, Linux kernel developers don't guarantee that
  *  readability of select(2) means readability of following read(2) even
  *  for a single process;
- *  see {select(2)}[https://linux.die.net/man/2/select]
+ *  see {select(2)}[https://man7.org/linux/man-pages/man2/select.2.html]
  *
  *  Invoking \IO.select before IO#readpartial works well as usual.
  *  However it is not the best way to use \IO.select.
@@ -11042,7 +11189,7 @@ rb_f_select(int argc, VALUE *argv, VALUE obj)
     int i;
 
     rb_scan_args(argc, argv, "13", &args.read, &args.write, &args.except, &timeout);
-    if (NIL_P(timeout)) {
+    if (NIL_P(timeout) || is_pos_inf(timeout)) {
         args.timeout = 0;
     }
     else {
@@ -11079,16 +11226,16 @@ nogvl_ioctl(void *ptr)
 }
 
 static int
-do_ioctl(int fd, ioctl_req_t cmd, long narg)
+do_ioctl(struct rb_io *io, ioctl_req_t cmd, long narg)
 {
     int retval;
     struct ioctl_arg arg;
 
-    arg.fd = fd;
+    arg.fd = io->fd;
     arg.cmd = cmd;
     arg.narg = narg;
 
-    retval = (int)rb_thread_io_blocking_region(nogvl_ioctl, &arg, fd);
+    retval = (int)rb_io_blocking_region(io, nogvl_ioctl, &arg);
 
     return retval;
 }
@@ -11351,7 +11498,7 @@ rb_ioctl(VALUE io, VALUE req, VALUE arg)
 
     narg = setup_narg(cmd, &arg, ioctl_narg_len);
     GetOpenFile(io, fptr);
-    retval = do_ioctl(fptr->fd, cmd, narg);
+    retval = do_ioctl(fptr, cmd, narg);
     return finish_narg(retval, arg, fptr);
 }
 
@@ -11359,7 +11506,7 @@ rb_ioctl(VALUE io, VALUE req, VALUE arg)
  *  call-seq:
  *    ioctl(integer_cmd, argument) -> integer
  *
- *  Invokes Posix system call {ioctl(2)}[https://linux.die.net/man/2/ioctl],
+ *  Invokes Posix system call {ioctl(2)}[https://man7.org/linux/man-pages/man2/ioctl.2.html],
  *  which issues a low-level command to an I/O device.
  *
  *  Issues a low-level command to an I/O device.
@@ -11405,16 +11552,16 @@ nogvl_fcntl(void *ptr)
 }
 
 static int
-do_fcntl(int fd, int cmd, long narg)
+do_fcntl(struct rb_io *io, int cmd, long narg)
 {
     int retval;
     struct fcntl_arg arg;
 
-    arg.fd = fd;
+    arg.fd = io->fd;
     arg.cmd = cmd;
     arg.narg = narg;
 
-    retval = (int)rb_thread_io_blocking_region(nogvl_fcntl, &arg, fd);
+    retval = (int)rb_io_blocking_region(io, nogvl_fcntl, &arg);
     if (retval != -1) {
         switch (cmd) {
 #if defined(F_DUPFD)
@@ -11440,7 +11587,7 @@ rb_fcntl(VALUE io, VALUE req, VALUE arg)
 
     narg = setup_narg(cmd, &arg, fcntl_narg_len);
     GetOpenFile(io, fptr);
-    retval = do_fcntl(fptr->fd, cmd, narg);
+    retval = do_fcntl(fptr, cmd, narg);
     return finish_narg(retval, arg, fptr);
 }
 
@@ -11448,7 +11595,7 @@ rb_fcntl(VALUE io, VALUE req, VALUE arg)
  *  call-seq:
  *    fcntl(integer_cmd, argument) -> integer
  *
- *  Invokes Posix system call {fcntl(2)}[https://linux.die.net/man/2/fcntl],
+ *  Invokes Posix system call {fcntl(2)}[https://man7.org/linux/man-pages/man2/fcntl.2.html],
  *  which provides a mechanism for issuing low-level commands to control or query
  *  a file-oriented I/O stream. Arguments and results are platform
  *  dependent.
@@ -11478,7 +11625,7 @@ rb_io_fcntl(int argc, VALUE *argv, VALUE io)
  *  call-seq:
  *    syscall(integer_callno, *arguments)   -> integer
  *
- *  Invokes Posix system call {syscall(2)}[https://linux.die.net/man/2/syscall],
+ *  Invokes Posix system call {syscall(2)}[https://man7.org/linux/man-pages/man2/syscall.2.html],
  *  which calls a specified function.
  *
  *  Calls the operating system function identified by +integer_callno+;
@@ -11788,7 +11935,7 @@ rb_io_s_pipe(int argc, VALUE *argv, VALUE klass)
     VALUE opt;
     rb_io_t *fptr, *fptr2;
     struct io_encoding_set_args ies_args;
-    int fmode = 0;
+    enum rb_io_mode fmode = 0;
     VALUE ret;
 
     argc = rb_scan_args(argc, argv, "02:", &v1, &v2, &opt);
@@ -11923,10 +12070,6 @@ io_s_foreach(VALUE v)
  *
  *  Calls the block with each successive line read from the stream.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  *  The first argument must be a string that is the path to a file.
  *
  *  With only argument +path+ given, parses lines from the file at the given +path+,
@@ -12026,10 +12169,6 @@ io_s_readlines(VALUE v)
  *
  *  Returns an array of all lines read from the stream.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  *  The first argument must be a string that is the path to a file.
  *
  *  With only argument +path+ given, parses lines from the file at the given +path+,
@@ -12115,17 +12254,17 @@ seek_before_access(VALUE argp)
  *  Opens the stream, reads and returns some or all of its content,
  *  and closes the stream; returns +nil+ if no bytes were read.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  *  The first argument must be a string that is the path to a file.
  *
  *  With only argument +path+ given, reads in text mode and returns the entire content
  *  of the file at the given path:
  *
- *    IO.read('t.txt')
- *    # => "First line\nSecond line\n\nThird line\nFourth line\n"
+ *    File.read('t.txt')
+ *    # => "First line\nSecond line\n\nFourth line\nFifth line\n"
+ *    File.read('t.ja')
+ *    # => "こんにちは"
+ *    File.read('t.dat')
+ *    # => "\xFE\xFF\x99\x90\x99\x91\x99\x92\x99\x93\x99\x94"
  *
  *  On Windows, text mode can terminate reading and leave bytes in the file
  *  unread when encountering certain special bytes. Consider using
@@ -12133,15 +12272,36 @@ seek_before_access(VALUE argp)
  *
  *  With argument +length+, returns +length+ bytes if available:
  *
- *    IO.read('t.txt', 7) # => "First l"
- *    IO.read('t.txt', 700)
+ *    File.read('t.txt', 7)
+ *    # => "First l"
+ *    File.read('t.ja', 7)
+ *    # => "\xE3\x81\x93\xE3\x82\x93\xE3"
+ *    File.read('t.dat', 7)
+ *    # => "\xFE\xFF\x99\x90\x99\x91\x99"
+ *
+ *  Returns all bytes if +length+ is larger than the files size:
+ *
+ *    File.read('t.txt', 700)
  *    # => "First line\r\nSecond line\r\n\r\nFourth line\r\nFifth line\r\n"
+ *    File.read('t.ja', 700)
+ *    # => "\xE3\x81\x93\xE3\x82\x93\xE3\x81\xAB\xE3\x81\xA1\xE3\x81\xAF"
+ *    File.read('t.dat', 700)
+ *    # => "\xFE\xFF\x99\x90\x99\x91\x99\x92\x99\x93\x99\x94"
  *
  *  With arguments +length+ and +offset+, returns +length+ bytes
  *  if available, beginning at the given +offset+:
  *
- *    IO.read('t.txt', 10, 2)   # => "rst line\nS"
- *    IO.read('t.txt', 10, 200) # => nil
+ *    File.read('t.txt', 10, 2)
+ *    # => "rst line\r\n"
+ *    File.read('t.ja', 10, 2)
+ *    # => "\x93\xE3\x82\x93\xE3\x81\xAB\xE3\x81\xA1"
+ *    File.read('t.dat', 10, 2)
+ *    # => "\x99\x90\x99\x91\x99\x92\x99\x93\x99\x94"
+ *
+ *  Returns +nil+ if +offset+ is past the end of the stream:
+ *
+ *    File.read('t.txt', 10, 200)
+ *    # => nil
  *
  *  Optional keyword arguments +opts+ specify:
  *
@@ -12186,10 +12346,6 @@ rb_io_s_read(int argc, VALUE *argv, VALUE io)
  *  Behaves like IO.read, except that the stream is opened in binary mode
  *  with ASCII-8BIT encoding.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  */
 
 static VALUE
@@ -12197,8 +12353,8 @@ rb_io_s_binread(int argc, VALUE *argv, VALUE io)
 {
     VALUE offset;
     struct foreach_arg arg;
+    enum rb_io_mode fmode = FMODE_READABLE|FMODE_BINMODE;
     enum {
-        fmode = FMODE_READABLE|FMODE_BINMODE,
         oflags = O_RDONLY
 #ifdef O_BINARY
                 |O_BINARY
@@ -12285,40 +12441,50 @@ io_s_write(int argc, VALUE *argv, VALUE klass, int binary)
 
 /*
  *  call-seq:
- *    IO.write(path, data, offset = 0, **opts)    -> integer
+ *    IO.write(path, data, offset = 0, **opts) -> nonnegative_integer
  *
  *  Opens the stream, writes the given +data+ to it,
  *  and closes the stream; returns the number of bytes written.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  *  The first argument must be a string that is the path to a file.
  *
- *  With only argument +path+ given, writes the given +data+ to the file at that path:
+ *  With only arguments +path+ and +data+ given,
+ *  writes the given data to the file at that path:
  *
- *    IO.write('t.tmp', 'abc')    # => 3
- *    File.read('t.tmp')          # => "abc"
+ *    path = 't.tmp'
+ *    File.write(path, "First line\nSecond line\n\nFourth line\nFifth line\n") # => 47
+ *    File.write(path, 'こんにちは')                                             # => 15
+ *    File.write(path, "\xFE\xFF\x99\x90\x99\x91\x99\x92\x99\x93\x99\x94")     # => 12
+ *
+ *  When +offset+ is zero (the default), the entire file content is overwritten:
+ *
+ *    File.read(path) # => "\xFE\xFF\x99\x90\x99\x91\x99\x92\x99\x93\x99\x94"
+ *    File.write(path, 'foo')
+ *    File.read(path) # => "foo"
  *
- *  If +offset+ is zero (the default), the file is overwritten:
+ *  When +offset+ in within the file content, the file content is partly overwritten,
+ *  beginning at byte +offset+:
  *
- *    IO.write('t.tmp', 'A')      # => 1
- *    File.read('t.tmp')          # => "A"
+ *    File.write(path, "First line\nSecond line\n\nFourth line\nFifth line\n")
+ *    File.write(path, 'LINE', 6)
+ *    File.read(path) # => "First LINE\nSecond line\n\nFourth line\nFifth line\n"
  *
- *  If +offset+ in within the file content, the file is partly overwritten:
+ *  When the file contains multi-byte characters,
+ *  the effect of writing may disturb some characters:
  *
- *    IO.write('t.tmp', 'abcdef') # => 3
- *    File.read('t.tmp')          # => "abcdef"
- *    # Offset within content.
- *    IO.write('t.tmp', '012', 2) # => 3
- *    File.read('t.tmp')          # => "ab012f"
+ *    File.write(path, "こんにちは")
+ *    File.write(path, 'FOO', 3)  # Replace one 3-byte character.
+ *    File.read(path) # => "こFOOにちは"
+ *    File.write(path, 'BAR', 7)  # Replace bytes in two different 3-byte characters.
+ *    File.read(path) # => "こFOO\xE3BAR\x81\xA1は"
  *
  *  If +offset+ is outside the file content,
  *  the file is padded with null characters <tt>"\u0000"</tt>:
  *
- *    IO.write('t.tmp', 'xyz', 10) # => 3
- *    File.read('t.tmp')           # => "ab012f\u0000\u0000\u0000\u0000xyz"
+ *    File.write(path, "First line\nSecond line\n\nFourth line\nFifth line\n")
+ *    File.write(path, 'FOO', 55)
+ *    File.read(path)
+ *    # => "First line\nSecond line\n\nFourth line\nFifth line\n\u0000\u0000\u0000FOO"
  *
  *  Optional keyword arguments +opts+ specify:
  *
@@ -12335,15 +12501,11 @@ rb_io_s_write(int argc, VALUE *argv, VALUE io)
 
 /*
  *  call-seq:
- *    IO.binwrite(path, string, offset = 0)    -> integer
+ *    IO.binwrite(path, string, offset = 0, **opts)    -> integer
  *
  *  Behaves like IO.write, except that the stream is opened in binary mode
  *  with ASCII-8BIT encoding.
  *
- *  When called from class \IO (but not subclasses of \IO),
- *  this method has potential security vulnerabilities if called with untrusted input;
- *  see {Command Injection}[rdoc-ref:command_injection.rdoc].
- *
  */
 
 static VALUE
@@ -13058,6 +13220,7 @@ copy_stream_fallback_body(VALUE arg)
     while (1) {
         long numwrote;
         long l;
+        rb_str_make_independent(buf);
         if (stp->copy_length < (rb_off_t)0) {
             l = buflen;
         }
@@ -13561,6 +13724,7 @@ argf_set_encoding(int argc, VALUE *argv, VALUE argf)
     rb_io_set_encoding(argc, argv, ARGF.current_file);
     GetOpenFile(ARGF.current_file, fptr);
     ARGF.encs = fptr->encs;
+    RB_OBJ_WRITTEN(argf, Qundef, ARGF.encs.ecopts);
     return argf;
 }
 
@@ -14493,7 +14657,7 @@ argf_inplace_mode_set(VALUE argf, VALUE val)
         ARGF.inplace = Qnil;
     }
     else {
-        ARGF.inplace = rb_str_new_frozen(val);
+        ARGF_SET(inplace, rb_str_new_frozen(val));
     }
     return argf;
 }
@@ -14507,7 +14671,7 @@ opt_i_set(VALUE val, ID id, VALUE *var)
 void
 ruby_set_inplace_mode(const char *suffix)
 {
-    ARGF.inplace = !suffix ? Qfalse : !*suffix ? Qnil : rb_str_new(suffix, strlen(suffix));
+    ARGF_SET(inplace, !suffix ? Qfalse : !*suffix ? Qnil : rb_str_new(suffix, strlen(suffix)));
 }
 
 /*
@@ -14767,7 +14931,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  * - \File +t.rb+:
  *
  *     p "ARGV: #{ARGV}"
- *     p "Line: #{ARGF.read}" # Read everything from all specified streams.
+ *     p "Read: #{ARGF.read}" # Read everything from all specified streams.
  *
  * - Command and output:
  *
@@ -14841,9 +15005,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *     ["ARGV", ["-"]]
  *     ["ARGF.read", "Open the pod bay doors, Hal.\n"]
  *
- * When no character <tt>'-'</tt> is given, stream <tt>$stdin</tt> is ignored
- * (exception:
- * see {Specifying $stdin in ARGV}[rdoc-ref:ARGF@Specifying+-24stdin+in+ARGV]):
+ * When no character <tt>'-'</tt> is given, stream <tt>$stdin</tt> is ignored.
  *
  * - Command and output:
  *
@@ -14925,9 +15087,9 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
 /*
  *  An instance of class \IO (commonly called a _stream_)
  *  represents an input/output stream in the underlying operating system.
- *  \Class \IO is the basis for input and output in Ruby.
+ *  Class \IO is the basis for input and output in Ruby.
  *
- *  \Class File is the only class in the Ruby core that is a subclass of \IO.
+ *  Class File is the only class in the Ruby core that is a subclass of \IO.
  *  Some classes in the Ruby standard library are also subclasses of \IO;
  *  these include TCPSocket and UDPSocket.
  *
@@ -14936,7 +15098,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *  found in ARGV (or found in STDIN if ARGV is empty).
  *  ARGF is not itself a subclass of \IO.
  *
- *  \Class StringIO provides an IO-like stream that handles a String.
+ *  Class StringIO provides an IO-like stream that handles a String.
  *  StringIO is not itself a subclass of \IO.
  *
  *  Important objects based on \IO include:
@@ -14958,7 +15120,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *  Like a File stream, an \IO stream has:
  *
  *  - A read/write mode, which may be read-only, write-only, or read/write;
- *    see {Read/Write Mode}[rdoc-ref:File@Read-2FWrite+Mode].
+ *    see {Read/Write Mode}[rdoc-ref:File@ReadWrite+Mode].
  *  - A data mode, which may be text-only or binary;
  *    see {Data Mode}[rdoc-ref:File@Data+Mode].
  *  - Internal and external encodings;
@@ -15002,7 +15164,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *  - +:binmode+: If a truthy value, specifies the mode as binary, text-only otherwise.
  *  - +:autoclose+: If a truthy value, specifies that the +fd+ will close
  *    when the stream closes; otherwise it remains open.
- *  - +:path:+ If a string value is provided, it is used in #inspect and is available as
+ *  - +:path+: If a string value is provided, it is used in #inspect and is available as
  *    #path method.
  *
  *  Also available are the options offered in String#encode,
@@ -15024,6 +15186,9 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *  A new stream has position zero (and line number zero);
  *  method +rewind+ resets the position (and line number) to zero.
  *
+ *  These methods discard {buffers}[rdoc-ref:IO@Buffering] and the
+ *  Encoding::Converter instances used for that \IO.
+ *
  *  The relevant methods:
  *
  *  - IO#tell (aliased as +#pos+): Returns the current position (in bytes) in the stream.
@@ -15071,12 +15236,12 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *
  *  == Line \IO
  *
- *  \Class \IO supports line-oriented
+ *  Class \IO supports line-oriented
  *  {input}[rdoc-ref:IO@Line+Input] and {output}[rdoc-ref:IO@Line+Output]
  *
  *  === Line Input
  *
- *  \Class \IO supports line-oriented input for
+ *  Class \IO supports line-oriented input for
  *  {files}[rdoc-ref:IO@File+Line+Input] and {IO streams}[rdoc-ref:IO@Stream+Line+Input]
  *
  *  ==== \File Line Input
@@ -15196,11 +15361,13 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *    File.open('t.txt') {|f| f.gets(11) } # => "First line\n"
  *    File.open('t.txt') {|f| f.gets(12) } # => "First line\n"
  *
- *    # Text with 2-byte characters, which will not be split.
- *    File.open('t.rus') {|f| f.gets(1).size } # => 1
- *    File.open('t.rus') {|f| f.gets(2).size } # => 1
- *    File.open('t.rus') {|f| f.gets(3).size } # => 2
- *    File.open('t.rus') {|f| f.gets(4).size } # => 2
+ *    # Text with 3-byte characters, which will not be split.
+ *    File.read('t.ja') # => "こんにちは"
+ *    File.open('t.ja') {|f| f.gets(1).size }      # => 1
+ *    File.open('t.ja') {|f| f.gets(2).size }      # => 1
+ *    File.open('t.ja') {|f| f.gets(3).size }      # => 1
+ *    File.open('t.ja') {|f| f.gets(4).size }      # => 2
+ *    File.open('t.ja') {|f| f.gets(5).size }      # => 2
  *
  *  ===== Line Separator and Line Limit
  *
@@ -15330,6 +15497,7 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *  - IO#putc: Writes a character to the stream.
  *  - IO#each_char: Reads each remaining character in the stream,
  *    passing the character to the given block.
+ *
  *  == Byte \IO
  *
  *  You can process an \IO stream byte-by-byte using these methods:
@@ -15348,10 +15516,10 @@ set_LAST_READ_LINE(VALUE val, ID _x, VALUE *_y)
  *
  *  == What's Here
  *
- *  First, what's elsewhere. \Class \IO:
+ *  First, what's elsewhere. Class \IO:
  *
- *  - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
- *  - Includes {module Enumerable}[rdoc-ref:Enumerable@What-27s+Here],
+ *  - Inherits from {class Object}[rdoc-ref:Object@Whats+Here].
+ *  - Includes {module Enumerable}[rdoc-ref:Enumerable@Whats+Here],
  *    which provides dozens of additional methods.
  *
  *  Here, class \IO provides methods that are useful for:
@@ -15615,18 +15783,21 @@ Init_IO(void)
     rb_define_method(rb_cIO, "initialize", rb_io_initialize, -1);
 
     rb_output_fs = Qnil;
-    rb_define_hooked_variable("$,", &rb_output_fs, 0, deprecated_str_setter);
+    rb_define_hooked_variable("$,", &rb_output_fs, 0, rb_deprecated_str_setter);
 
     rb_default_rs = rb_fstring_lit("\n"); /* avoid modifying RS_default */
     rb_vm_register_global_object(rb_default_rs);
     rb_rs = rb_default_rs;
     rb_output_rs = Qnil;
-    rb_define_hooked_variable("$/", &rb_rs, 0, deprecated_str_setter);
-    rb_define_hooked_variable("$-0", &rb_rs, 0, deprecated_str_setter);
-    rb_define_hooked_variable("$\\", &rb_output_rs, 0, deprecated_str_setter);
+    rb_define_hooked_variable("$/", &rb_rs, 0, deprecated_rs_setter);
+    rb_gvar_ractor_local("$/"); // not local but ractor safe
+    rb_define_hooked_variable("$-0", &rb_rs, 0, deprecated_rs_setter);
+    rb_gvar_ractor_local("$-0"); // not local but ractor safe
+    rb_define_hooked_variable("$\\", &rb_output_rs, 0, rb_deprecated_str_setter);
 
     rb_define_virtual_variable("$_", get_LAST_READ_LINE, set_LAST_READ_LINE);
     rb_gvar_ractor_local("$_");
+    rb_gvar_box_dynamic("$_");
 
     rb_define_method(rb_cIO, "initialize_copy", rb_io_init_copy, 1);
     rb_define_method(rb_cIO, "reopen", rb_io_reopen, -1);
@@ -15848,7 +16019,7 @@ Init_IO(void)
 
     rb_define_hooked_variable("$.", &argf, argf_lineno_getter, argf_lineno_setter);
     rb_define_hooked_variable("$FILENAME", &argf, argf_filename_getter, rb_gvar_readonly_setter);
-    ARGF.filename = rb_str_new2("-");
+    ARGF_SET(filename, rb_str_new2("-"));
 
     rb_define_hooked_variable("$-i", &argf, opt_i_get, opt_i_set);
     rb_gvar_ractor_local("$-i");
diff --git a/io_buffer.c b/io_buffer.c
index e6ca61bdae..faa5304248 100644
--- a/io_buffer.c
+++ b/io_buffer.c
@@ -6,17 +6,20 @@
 
 **********************************************************************/
 
-#include "ruby/io.h"
 #include "ruby/io/buffer.h"
 #include "ruby/fiber/scheduler.h"
 
+// For `rb_nogvl`.
+#include "ruby/thread.h"
+
 #include "internal.h"
 #include "internal/array.h"
 #include "internal/bits.h"
 #include "internal/error.h"
+#include "internal/gc.h"
 #include "internal/numeric.h"
 #include "internal/string.h"
-#include "internal/thread.h"
+#include "internal/io.h"
 
 VALUE rb_cIOBuffer;
 VALUE rb_eIOBufferLockedError;
@@ -36,6 +39,7 @@ size_t RUBY_IO_BUFFER_DEFAULT_SIZE;
 
 enum {
     RB_IO_BUFFER_HEXDUMP_DEFAULT_WIDTH = 16,
+    RB_IO_BUFFER_HEXDUMP_MAXIMUM_WIDTH = 1024,
 
     RB_IO_BUFFER_INSPECT_HEXDUMP_MAXIMUM_SIZE = 256,
     RB_IO_BUFFER_INSPECT_HEXDUMP_WIDTH = 16,
@@ -81,6 +85,8 @@ io_buffer_map_memory(size_t size, int flags)
     if (base == MAP_FAILED) {
         rb_sys_fail("io_buffer_map_memory:mmap");
     }
+
+    ruby_annotate_mmap(base, size, "Ruby:io_buffer_map_memory");
 #endif
 
     return base;
@@ -267,14 +273,36 @@ io_buffer_free(struct rb_io_buffer *buffer)
 #endif
 }
 
-void
+static void
 rb_io_buffer_type_mark(void *_buffer)
 {
     struct rb_io_buffer *buffer = _buffer;
-    rb_gc_mark(buffer->source);
+    if (buffer->source != Qnil) {
+        if (RB_TYPE_P(buffer->source, T_STRING)) {
+            // The `source` String has to be pinned, because the `base` may point to the embedded String content,
+            // which can be otherwise moved by GC compaction.
+            rb_gc_mark(buffer->source);
+        } else {
+            rb_gc_mark_movable(buffer->source);
+        }
+    }
 }
 
-void
+static void
+rb_io_buffer_type_compact(void *_buffer)
+{
+    struct rb_io_buffer *buffer = _buffer;
+    if (buffer->source != Qnil) {
+        if (RB_TYPE_P(buffer->source, T_STRING)) {
+            // The `source` String has to be pinned, because the `base` may point to the embedded String content,
+            // which can be otherwise moved by GC compaction.
+        } else {
+            buffer->source = rb_gc_location(buffer->source);
+        }
+    }
+}
+
+static void
 rb_io_buffer_type_free(void *_buffer)
 {
     struct rb_io_buffer *buffer = _buffer;
@@ -282,7 +310,7 @@ rb_io_buffer_type_free(void *_buffer)
     io_buffer_free(buffer);
 }
 
-size_t
+static size_t
 rb_io_buffer_type_size(const void *_buffer)
 {
     const struct rb_io_buffer *buffer = _buffer;
@@ -301,6 +329,7 @@ static const rb_data_type_t rb_io_buffer_type = {
         .dmark = rb_io_buffer_type_mark,
         .dfree = rb_io_buffer_type_free,
         .dsize = rb_io_buffer_type_size,
+        .dcompact = rb_io_buffer_type_compact,
     },
     .data = NULL,
     .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE,
@@ -356,7 +385,7 @@ io_buffer_extract_size(VALUE argument)
 }
 
 // Extract a width argument, which must be a non-negative integer, and must be
-// at least the given minimum.
+// at least the given minimum and at most RB_IO_BUFFER_HEXDUMP_MAXIMUM_WIDTH.
 static inline size_t
 io_buffer_extract_width(VALUE argument, size_t minimum)
 {
@@ -370,6 +399,10 @@ io_buffer_extract_width(VALUE argument, size_t minimum)
         rb_raise(rb_eArgError, "Width must be at least %" PRIuSIZE "!", minimum);
     }
 
+    if (width > RB_IO_BUFFER_HEXDUMP_MAXIMUM_WIDTH) {
+        rb_raise(rb_eArgError, "Width must be at most %" PRIuSIZE "!", (size_t)RB_IO_BUFFER_HEXDUMP_MAXIMUM_WIDTH);
+    }
+
     return width;
 }
 
@@ -451,6 +484,8 @@ io_buffer_extract_offset_length(VALUE self, int argc, VALUE argv[], size_t *offs
 VALUE
 rb_io_buffer_type_allocate(VALUE self)
 {
+    io_buffer_experimental();
+
     struct rb_io_buffer *buffer = NULL;
     VALUE instance = TypedData_Make_Struct(self, struct rb_io_buffer, &rb_io_buffer_type, buffer);
 
@@ -493,7 +528,9 @@ io_buffer_for_yield_instance(VALUE _arguments)
 
     arguments->instance = io_buffer_for_make_instance(arguments->klass, arguments->string, arguments->flags);
 
-    rb_str_locktmp(arguments->string);
+    if (!RB_OBJ_FROZEN(arguments->string)) {
+        rb_str_locktmp(arguments->string);
+    }
 
     return rb_yield(arguments->instance);
 }
@@ -507,7 +544,9 @@ io_buffer_for_yield_instance_ensure(VALUE _arguments)
         rb_io_buffer_free(arguments->instance);
     }
 
-    rb_str_unlocktmp(arguments->string);
+    if (!RB_OBJ_FROZEN(arguments->string)) {
+        rb_str_unlocktmp(arguments->string);
+    }
 
     return Qnil;
 }
@@ -537,7 +576,7 @@ io_buffer_for_yield_instance_ensure(VALUE _arguments)
  *    buffer.get_string(0, 1)
  *    # => "t"
  *    string
- *    # => "best"
+ *    # => "test"
  *
  *    buffer.resize(100)
  *    # in `resize': Cannot resize external buffer! (IO::Buffer::AccessError)
@@ -617,8 +656,6 @@ rb_io_buffer_new(void *base, size_t size, enum rb_io_buffer_flags flags)
 VALUE
 rb_io_buffer_map(VALUE io, size_t size, rb_off_t offset, enum rb_io_buffer_flags flags)
 {
-    io_buffer_experimental();
-
     VALUE instance = rb_io_buffer_type_allocate(rb_cIOBuffer);
 
     struct rb_io_buffer *buffer = NULL;
@@ -635,18 +672,25 @@ rb_io_buffer_map(VALUE io, size_t size, rb_off_t offset, enum rb_io_buffer_flags
  *  call-seq: IO::Buffer.map(file, [size, [offset, [flags]]]) -> io_buffer
  *
  *  Create an IO::Buffer for reading from +file+ by memory-mapping the file.
- *  +file_io+ should be a +File+ instance, opened for reading.
+ *  +file+ should be a +File+ instance, opened for reading or reading and writing.
  *
  *  Optional +size+ and +offset+ of mapping can be specified.
+ *  Trying to map an empty file or specify +size+ of 0 will raise an error.
+ *  Valid values for +offset+ are system-dependent.
  *
- *  By default, the buffer would be immutable (read only); to create a writable
- *  mapping, you need to open a file in read-write mode, and explicitly pass
- *  +flags+ argument without IO::Buffer::IMMUTABLE.
+ *  By default, the buffer is writable and expects the file to be writable.
+ *  It is also shared, so several processes can use the same mapping.
+ *
+ *  You can pass IO::Buffer::READONLY in +flags+ argument to make a read-only buffer;
+ *  this allows to work with files opened only for reading.
+ *  Specifying IO::Buffer::PRIVATE in +flags+ creates a private mapping,
+ *  which will not impact other processes or the underlying file.
+ *  It also allows updating a buffer created from a read-only file.
  *
  *    File.write('test.txt', 'test')
  *
  *    buffer = IO::Buffer.map(File.open('test.txt'), nil, 0, IO::Buffer::READONLY)
- *    # => #<IO::Buffer 0x00000001014a0000+4 MAPPED READONLY>
+ *    # => #<IO::Buffer 0x00000001014a0000+4 EXTERNAL MAPPED FILE SHARED READONLY>
  *
  *    buffer.readonly?   # => true
  *
@@ -654,7 +698,7 @@ rb_io_buffer_map(VALUE io, size_t size, rb_off_t offset, enum rb_io_buffer_flags
  *    # => "test"
  *
  *    buffer.set_string('b', 0)
- *    # `set_string': Buffer is not writable! (IO::Buffer::AccessError)
+ *    # 'IO::Buffer#set_string': Buffer is not writable! (IO::Buffer::AccessError)
  *
  *    # create read/write mapping: length 4 bytes, offset 0, flags 0
  *    buffer = IO::Buffer.map(File.open('test.txt', 'r+'), 4, 0)
@@ -676,31 +720,48 @@ io_buffer_map(int argc, VALUE *argv, VALUE klass)
     // We might like to handle a string path?
     VALUE io = argv[0];
 
+    rb_off_t file_size = rb_file_size(io);
+    // Compiler can confirm that we handled file_size <= 0 case:
+    if (UNLIKELY(file_size <= 0)) {
+        rb_raise(rb_eArgError, "Invalid negative or zero file size!");
+    }
+    // Here, we assume that file_size is positive:
+    else if (UNLIKELY((uintmax_t)file_size > SIZE_MAX)) {
+        rb_raise(rb_eArgError, "File larger than address space!");
+    }
+
     size_t size;
     if (argc >= 2 && !RB_NIL_P(argv[1])) {
         size = io_buffer_extract_size(argv[1]);
-    }
-    else {
-        rb_off_t file_size = rb_file_size(io);
-
-        // Compiler can confirm that we handled file_size < 0 case:
-        if (file_size < 0) {
-            rb_raise(rb_eArgError, "Invalid negative file size!");
+        if (UNLIKELY(size == 0)) {
+            rb_raise(rb_eArgError, "Size can't be zero!");
         }
-        // Here, we assume that file_size is positive:
-        else if ((uintmax_t)file_size > SIZE_MAX) {
-            rb_raise(rb_eArgError, "File larger than address space!");
-        }
-        else {
-            // This conversion should be safe:
-            size = (size_t)file_size;
+        if (UNLIKELY(size > (size_t)file_size)) {
+            rb_raise(rb_eArgError, "Size can't be larger than file size!");
         }
     }
+    else {
+        // This conversion should be safe:
+        size = (size_t)file_size;
+    }
 
     // This is the file offset, not the buffer offset:
     rb_off_t offset = 0;
     if (argc >= 3) {
         offset = NUM2OFFT(argv[2]);
+        if (UNLIKELY(offset < 0)) {
+            rb_raise(rb_eArgError, "Offset can't be negative!");
+        }
+        if (UNLIKELY(offset >= file_size)) {
+            rb_raise(rb_eArgError, "Offset too large!");
+        }
+        if (RB_NIL_P(argv[1])) {
+            // Decrease size if it's set from the actual file size:
+            size = (size_t)(file_size - offset);
+        }
+        else if (UNLIKELY((size_t)(file_size - offset) < size)) {
+            rb_raise(rb_eArgError, "Offset too large!");
+        }
     }
 
     enum rb_io_buffer_flags flags = 0;
@@ -749,8 +810,6 @@ io_flags_for_size(size_t size)
 VALUE
 rb_io_buffer_initialize(int argc, VALUE *argv, VALUE self)
 {
-    io_buffer_experimental();
-
     rb_check_arity(argc, 0, 2);
 
     struct rb_io_buffer *buffer = NULL;
@@ -843,7 +902,8 @@ rb_io_buffer_get_bytes(VALUE self, void **base, size_t *size)
 static inline void
 io_buffer_get_bytes_for_writing(struct rb_io_buffer *buffer, void **base, size_t *size)
 {
-    if (buffer->flags & RB_IO_BUFFER_READONLY) {
+    if (buffer->flags & RB_IO_BUFFER_READONLY ||
+        (!NIL_P(buffer->source) && OBJ_FROZEN(buffer->source))) {
         rb_raise(rb_eIOBufferAccessError, "Buffer is not writable!");
     }
 
@@ -1369,6 +1429,17 @@ rb_io_buffer_try_unlock(VALUE self)
     return 0;
 }
 
+static VALUE
+rb_io_buffer_locked_ensure(VALUE self)
+{
+    struct rb_io_buffer *buffer = NULL;
+    TypedData_Get_Struct(self, struct rb_io_buffer, &rb_io_buffer_type, buffer);
+
+    buffer->flags &= ~RB_IO_BUFFER_LOCKED;
+
+    return Qnil;
+}
+
 /*
  *  call-seq: locked { ... }
  *
@@ -1411,11 +1482,7 @@ rb_io_buffer_locked(VALUE self)
 
     buffer->flags |= RB_IO_BUFFER_LOCKED;
 
-    VALUE result = rb_yield(self);
-
-    buffer->flags &= ~RB_IO_BUFFER_LOCKED;
-
-    return result;
+    return rb_ensure(rb_yield, self, rb_io_buffer_locked_ensure, self);
 }
 
 /*
@@ -1426,7 +1493,7 @@ rb_io_buffer_locked(VALUE self)
  *  * for a buffer created from scratch: free memory.
  *  * for a buffer created from string: undo the association.
  *
- *  After the buffer is freed, no further operations can't be performed on it.
+ *  After the buffer is freed, no further operations can be performed on it.
  *
  *  You can resize a freed buffer to re-allocate it.
  *
@@ -1469,13 +1536,19 @@ VALUE rb_io_buffer_free_locked(VALUE self)
     return self;
 }
 
+static bool
+size_sum_is_bigger_than(size_t a, size_t b, size_t x)
+{
+    struct rbimpl_size_overflow_tag size = rbimpl_size_add_overflow(a, b);
+    return size.overflowed || size.result > x;
+}
+
 // Validate that access to the buffer is within bounds, assuming you want to
 // access length bytes from the specified offset.
 static inline void
 io_buffer_validate_range(struct rb_io_buffer *buffer, size_t offset, size_t length)
 {
-    // We assume here that offset + length won't overflow:
-    if (offset + length > buffer->size) {
+    if (size_sum_is_bigger_than(offset, length, buffer->size)) {
         rb_raise(rb_eArgError, "Specified offset+length is bigger than the buffer size!");
     }
 }
@@ -1532,6 +1605,7 @@ rb_io_buffer_slice(struct rb_io_buffer *buffer, VALUE self, size_t offset, size_
     struct rb_io_buffer *slice = NULL;
     TypedData_Get_Struct(instance, struct rb_io_buffer, &rb_io_buffer_type, slice);
 
+    slice->flags |= (buffer->flags & RB_IO_BUFFER_READONLY);
     slice->base = (char*)buffer->base + offset;
     slice->size = length;
 
@@ -1566,7 +1640,7 @@ rb_io_buffer_slice(struct rb_io_buffer *buffer, VALUE self, size_t offset, size_
  *  buffer's bounds.
  *
  *    string = 'test'
- *    buffer = IO::Buffer.for(string)
+ *    buffer = IO::Buffer.for(string).dup
  *
  *    slice = buffer.slice
  *    # =>
@@ -1593,12 +1667,8 @@ rb_io_buffer_slice(struct rb_io_buffer *buffer, VALUE self, size_t offset, size_
  *    # it is also visible at position 1 of the original buffer
  *    buffer
  *    # =>
- *    # #<IO::Buffer 0x00007fc3d31e2d80+4 SLICE>
+ *    # #<IO::Buffer 0x00007fc3d31e2d80+4 INTERNAL>
  *    # 0x00000000  74 6f 73 74                                     tost
- *
- *    # ...and original string
- *    string
- *    # => tost
  */
 static VALUE
 io_buffer_slice(int argc, VALUE *argv, VALUE self)
@@ -1788,9 +1858,9 @@ rb_io_buffer_compare(VALUE self, VALUE other)
 }
 
 static void
-io_buffer_validate_type(size_t size, size_t offset)
+io_buffer_validate_type(size_t size, size_t offset, size_t extend)
 {
-    if (offset > size) {
+    if (size_sum_is_bigger_than(offset, extend, size)) {
         rb_raise(rb_eArgError, "Type extends beyond end of buffer! (offset=%"PRIdSIZE" > size=%"PRIdSIZE")", offset, size);
     }
 }
@@ -1810,6 +1880,9 @@ io_buffer_validate_type(size_t size, size_t offset)
 // :u64, :U64 | unsigned 64-bit integer.
 // :s64, :S64 | signed 64-bit integer.
 //
+// :u128, :U128 | unsigned 128-bit integer.
+// :s128, :S128 | signed 128-bit integer.
+//
 // :f32, :F32 | 32-bit floating point number.
 // :f64, :F64 | 64-bit floating point number.
 
@@ -1841,13 +1914,53 @@ ruby_swapf64(double value)
     return swap.value;
 }
 
+// Structures and conversion functions are now in numeric.h/numeric.c
+// Unified swap function for 128-bit integers (works with both signed and unsigned)
+// Since both rb_uint128_t and rb_int128_t have the same memory layout,
+// we can use a union to make the swap function work with both types
+static inline rb_uint128_t
+ruby_swap128_uint(rb_uint128_t x)
+{
+    rb_uint128_t result;
+#ifdef HAVE_UINT128_T
+#if __has_builtin(__builtin_bswap128)
+    result.value = __builtin_bswap128(x.value);
+#else
+    // Manual byte swap for 128-bit integers
+    uint64_t low = (uint64_t)x.value;
+    uint64_t high = (uint64_t)(x.value >> 64);
+    low = ruby_swap64(low);
+    high = ruby_swap64(high);
+    result.value = ((uint128_t)low << 64) | high;
+#endif
+#else
+    // Fallback swap function using two 64-bit integers
+    // For big-endian data on little-endian host (or vice versa):
+    // 1. Swap bytes within each 64-bit part
+    // 2. Swap the order of the parts (since big-endian stores high first, little-endian stores low first)
+    result.parts.low = ruby_swap64(x.parts.high);
+    result.parts.high = ruby_swap64(x.parts.low);
+#endif
+    return result;
+}
+
+static inline rb_int128_t
+ruby_swap128_int(rb_int128_t x)
+{
+    union uint128_int128_conversion conversion = {
+        .int128 = x
+    };
+    conversion.uint128 = ruby_swap128_uint(conversion.uint128);
+    return conversion.int128;
+}
+
 #define IO_BUFFER_DECLARE_TYPE(name, type, endian, wrap, unwrap, swap) \
 static ID RB_IO_BUFFER_DATA_TYPE_##name; \
 \
 static VALUE \
 io_buffer_read_##name(const void* base, size_t size, size_t *offset) \
 { \
-    io_buffer_validate_type(size, *offset + sizeof(type)); \
+    io_buffer_validate_type(size, *offset, sizeof(type)); \
     type value; \
     memcpy(&value, (char*)base + *offset, sizeof(type)); \
     if (endian != RB_IO_BUFFER_HOST_ENDIAN) value = swap(value); \
@@ -1858,7 +1971,7 @@ io_buffer_read_##name(const void* base, size_t size, size_t *offset) \
 static void \
 io_buffer_write_##name(const void* base, size_t size, size_t *offset, VALUE _value) \
 { \
-    io_buffer_validate_type(size, *offset + sizeof(type)); \
+    io_buffer_validate_type(size, *offset, sizeof(type)); \
     type value = unwrap(_value); \
     if (endian != RB_IO_BUFFER_HOST_ENDIAN) value = swap(value); \
     memcpy((char*)base + *offset, &value, sizeof(type)); \
@@ -1887,6 +2000,11 @@ IO_BUFFER_DECLARE_TYPE(U64, uint64_t, RB_IO_BUFFER_BIG_ENDIAN, RB_ULL2NUM, RB_NU
 IO_BUFFER_DECLARE_TYPE(s64, int64_t, RB_IO_BUFFER_LITTLE_ENDIAN, RB_LL2NUM, RB_NUM2LL, ruby_swap64)
 IO_BUFFER_DECLARE_TYPE(S64, int64_t, RB_IO_BUFFER_BIG_ENDIAN, RB_LL2NUM, RB_NUM2LL, ruby_swap64)
 
+IO_BUFFER_DECLARE_TYPE(u128, rb_uint128_t, RB_IO_BUFFER_LITTLE_ENDIAN, rb_uint128_to_numeric, rb_numeric_to_uint128, ruby_swap128_uint)
+IO_BUFFER_DECLARE_TYPE(U128, rb_uint128_t, RB_IO_BUFFER_BIG_ENDIAN, rb_uint128_to_numeric, rb_numeric_to_uint128, ruby_swap128_uint)
+IO_BUFFER_DECLARE_TYPE(s128, rb_int128_t, RB_IO_BUFFER_LITTLE_ENDIAN, rb_int128_to_numeric, rb_numeric_to_int128, ruby_swap128_int)
+IO_BUFFER_DECLARE_TYPE(S128, rb_int128_t, RB_IO_BUFFER_BIG_ENDIAN, rb_int128_to_numeric, rb_numeric_to_int128, ruby_swap128_int)
+
 IO_BUFFER_DECLARE_TYPE(f32, float, RB_IO_BUFFER_LITTLE_ENDIAN, DBL2NUM, NUM2DBL, ruby_swapf32)
 IO_BUFFER_DECLARE_TYPE(F32, float, RB_IO_BUFFER_BIG_ENDIAN, DBL2NUM, NUM2DBL, ruby_swapf32)
 IO_BUFFER_DECLARE_TYPE(f64, double, RB_IO_BUFFER_LITTLE_ENDIAN, DBL2NUM, NUM2DBL, ruby_swapf64)
@@ -1911,6 +2029,10 @@ io_buffer_buffer_type_size(ID buffer_type)
     IO_BUFFER_DATA_TYPE_SIZE(U64)
     IO_BUFFER_DATA_TYPE_SIZE(s64)
     IO_BUFFER_DATA_TYPE_SIZE(S64)
+    IO_BUFFER_DATA_TYPE_SIZE(u128)
+    IO_BUFFER_DATA_TYPE_SIZE(U128)
+    IO_BUFFER_DATA_TYPE_SIZE(s128)
+    IO_BUFFER_DATA_TYPE_SIZE(S128)
     IO_BUFFER_DATA_TYPE_SIZE(f32)
     IO_BUFFER_DATA_TYPE_SIZE(F32)
     IO_BUFFER_DATA_TYPE_SIZE(f64)
@@ -1967,6 +2089,11 @@ rb_io_buffer_get_value(const void* base, size_t size, ID buffer_type, size_t *of
     IO_BUFFER_GET_VALUE(s64)
     IO_BUFFER_GET_VALUE(S64)
 
+    IO_BUFFER_GET_VALUE(u128)
+    IO_BUFFER_GET_VALUE(U128)
+    IO_BUFFER_GET_VALUE(s128)
+    IO_BUFFER_GET_VALUE(S128)
+
     IO_BUFFER_GET_VALUE(f32)
     IO_BUFFER_GET_VALUE(F32)
     IO_BUFFER_GET_VALUE(f64)
@@ -1996,6 +2123,10 @@ rb_io_buffer_get_value(const void* base, size_t size, ID buffer_type, size_t *of
  *  * +:U64+: unsigned integer, 8 bytes, big-endian
  *  * +:s64+: signed integer, 8 bytes, little-endian
  *  * +:S64+: signed integer, 8 bytes, big-endian
+ *  * +:u128+: unsigned integer, 16 bytes, little-endian
+ *  * +:U128+: unsigned integer, 16 bytes, big-endian
+ *  * +:s128+: signed integer, 16 bytes, little-endian
+ *  * +:S128+: signed integer, 16 bytes, big-endian
  *  * +:f32+: float, 4 bytes, little-endian
  *  * +:F32+: float, 4 bytes, big-endian
  *  * +:f64+: double, 8 bytes, little-endian
@@ -2177,7 +2308,7 @@ io_buffer_values(int argc, VALUE *argv, VALUE self)
 
 /*
  *  call-seq:
- *    each_byte([offset, [count]]) {|offset, byte| ...} -> self
+ *    each_byte([offset, [count]]) {|byte| ...} -> self
  *    each_byte([offset, [count]]) -> enumerator
  *
  *  Iterates over the buffer, yielding each byte starting from +offset+.
@@ -2201,7 +2332,11 @@ io_buffer_each_byte(int argc, VALUE *argv, VALUE self)
     rb_io_buffer_get_bytes_for_reading(self, &base, &size);
 
     size_t offset, count;
-    io_buffer_extract_offset_count(RB_IO_BUFFER_DATA_TYPE_U8, size, argc-1, argv+1, &offset, &count);
+    io_buffer_extract_offset_count(RB_IO_BUFFER_DATA_TYPE_U8, size, argc, argv, &offset, &count);
+
+    if (size_sum_is_bigger_than(offset, count, size)) {
+        rb_raise(rb_eArgError, "Specified offset+count is bigger than the buffer size!");
+    }
 
     for (size_t i = 0; i < count; i++) {
         unsigned char *value = (unsigned char *)base + i + offset;
@@ -2233,6 +2368,11 @@ rb_io_buffer_set_value(const void* base, size_t size, ID buffer_type, size_t *of
     IO_BUFFER_SET_VALUE(s64);
     IO_BUFFER_SET_VALUE(S64);
 
+    IO_BUFFER_SET_VALUE(u128);
+    IO_BUFFER_SET_VALUE(U128);
+    IO_BUFFER_SET_VALUE(s128);
+    IO_BUFFER_SET_VALUE(S128);
+
     IO_BUFFER_SET_VALUE(f32);
     IO_BUFFER_SET_VALUE(F32);
     IO_BUFFER_SET_VALUE(f64);
@@ -2330,8 +2470,32 @@ io_buffer_set_values(VALUE self, VALUE buffer_types, VALUE _offset, VALUE values
     return SIZET2NUM(offset);
 }
 
+static size_t IO_BUFFER_BLOCKING_SIZE = 1024*1024;
+
+struct io_buffer_memmove_arguments {
+    unsigned char * destination;
+    const unsigned char * source;
+    size_t length;
+};
+
+static void *
+io_buffer_memmove_blocking(void *data)
+{
+    struct io_buffer_memmove_arguments *arguments = (struct io_buffer_memmove_arguments *)data;
+
+    memmove(arguments->destination, arguments->source, arguments->length);
+
+    return NULL;
+}
+
+static void
+io_buffer_memmove_unblock(void *data)
+{
+    // No safe way to interrupt.
+}
+
 static void
-io_buffer_memcpy(struct rb_io_buffer *buffer, size_t offset, const void *source_base, size_t source_offset, size_t source_size, size_t length)
+io_buffer_memmove(struct rb_io_buffer *buffer, size_t offset, const void *source_base, size_t source_offset, size_t source_size, size_t length)
 {
     void *base;
     size_t size;
@@ -2339,11 +2503,21 @@ io_buffer_memcpy(struct rb_io_buffer *buffer, size_t offset, const void *source_
 
     io_buffer_validate_range(buffer, offset, length);
 
-    if (source_offset + length > source_size) {
+    if (size_sum_is_bigger_than(source_offset, length, source_size)) {
         rb_raise(rb_eArgError, "The computed source range exceeds the size of the source buffer!");
     }
 
-    memcpy((unsigned char*)base+offset, (unsigned char*)source_base+source_offset, length);
+    struct io_buffer_memmove_arguments arguments = {
+        .destination = (unsigned char*)base+offset,
+        .source = (unsigned char*)source_base+source_offset,
+        .length = length
+    };
+
+    if (arguments.length >= IO_BUFFER_BLOCKING_SIZE) {
+        rb_nogvl(io_buffer_memmove_blocking, &arguments, io_buffer_memmove_unblock, &arguments, RB_NOGVL_OFFLOAD_SAFE);
+    } else if (arguments.length != 0) {
+        memmove(arguments.destination, arguments.source, arguments.length);
+    }
 }
 
 // (offset, length, source_offset) -> length
@@ -2380,7 +2554,7 @@ io_buffer_copy_from(struct rb_io_buffer *buffer, const void *source_base, size_t
         length = source_size - source_offset;
     }
 
-    io_buffer_memcpy(buffer, offset, source_base, source_offset, source_size, length);
+    io_buffer_memmove(buffer, offset, source_base, source_offset, source_size, length);
 
     return SIZET2NUM(length);
 }
@@ -2415,7 +2589,9 @@ rb_io_buffer_initialize_copy(VALUE self, VALUE source)
 
     io_buffer_initialize(self, buffer, NULL, source_size, io_flags_for_size(source_size), Qnil);
 
-    return io_buffer_copy_from(buffer, source_base, source_size, 0, NULL);
+    VALUE result = io_buffer_copy_from(buffer, source_base, source_size, 0, NULL);
+    RB_GC_GUARD(source);
+    return result;
 }
 
 /*
@@ -2423,7 +2599,7 @@ rb_io_buffer_initialize_copy(VALUE self, VALUE source)
  *    copy(source, [offset, [length, [source_offset]]]) -> size
  *
  *  Efficiently copy from a source IO::Buffer into the buffer, at +offset+
- *  using +memcpy+. For copying String instances, see #set_string.
+ *  using +memmove+. For copying String instances, see #set_string.
  *
  *    buffer = IO::Buffer.new(32)
  *    # =>
@@ -2441,10 +2617,11 @@ rb_io_buffer_initialize_copy(VALUE self, VALUE source)
  *
  *  #copy can be used to put buffer into strings associated with buffer:
  *
- *    string= "data:    "
+ *    string = "data:    "
  *    # => "data:    "
- *    buffer = IO::Buffer.for(string)
- *    buffer.copy(IO::Buffer.for("test"), 5)
+ *    buffer = IO::Buffer.for(string) do |buffer|
+ *      buffer.copy(IO::Buffer.for("test"), 5)
+ *    end
  *    # => 4
  *    string
  *    # => "data:test"
@@ -2471,6 +2648,19 @@ rb_io_buffer_initialize_copy(VALUE self, VALUE source)
  *    buffer = IO::Buffer.new(2)
  *    buffer.copy(IO::Buffer.for('test'), 0)
  *    # in `copy': Specified offset+length is bigger than the buffer size! (ArgumentError)
+ *
+ *  It is safe to copy between memory regions that overlaps each other.
+ *  In such case, the data is copied as if the data was first copied from the source buffer to
+ *  a temporary buffer, and then copied from the temporary buffer to the destination buffer.
+ *
+ *    buffer = IO::Buffer.new(10)
+ *    buffer.set_string("0123456789")
+ *    buffer.copy(buffer, 3, 7)
+ *    # => 7
+ *    buffer
+ *    # =>
+ *    # #<IO::Buffer 0x000056494f8ce440+10 INTERNAL>
+ *    # 0x00000000  30 31 32 30 31 32 33 34 35 36                   0120123456
  */
 static VALUE
 io_buffer_copy(int argc, VALUE *argv, VALUE self)
@@ -2486,7 +2676,9 @@ io_buffer_copy(int argc, VALUE *argv, VALUE self)
 
     rb_io_buffer_get_bytes_for_reading(source, &source_base, &source_size);
 
-    return io_buffer_copy_from(buffer, source_base, source_size, argc-1, argv+1);
+    VALUE result = io_buffer_copy_from(buffer, source_base, source_size, argc-1, argv+1);
+    RB_GC_GUARD(source);
+    return result;
 }
 
 /*
@@ -2532,7 +2724,7 @@ io_buffer_get_string(int argc, VALUE *argv, VALUE self)
  *  call-seq: set_string(string, [offset, [length, [source_offset]]]) -> size
  *
  *  Efficiently copy from a source String into the buffer, at +offset+ using
- *  +memcpy+.
+ *  +memmove+.
  *
  *    buf = IO::Buffer.new(8)
  *    # =>
@@ -2564,7 +2756,9 @@ io_buffer_set_string(int argc, VALUE *argv, VALUE self)
     const void *source_base = RSTRING_PTR(string);
     size_t source_size = RSTRING_LEN(string);
 
-    return io_buffer_copy_from(buffer, source_base, source_size, argc-1, argv+1);
+    VALUE result = io_buffer_copy_from(buffer, source_base, source_size, argc-1, argv+1);
+    RB_GC_GUARD(string);
+    return result;
 }
 
 void
@@ -2588,29 +2782,29 @@ rb_io_buffer_clear(VALUE self, uint8_t value, size_t offset, size_t length)
  *  Fill buffer with +value+, starting with +offset+ and going for +length+
  *  bytes.
  *
- *    buffer = IO::Buffer.for('test')
+ *    buffer = IO::Buffer.for('test').dup
  *    # =>
- *    #   <IO::Buffer 0x00007fca40087c38+4 SLICE>
+ *    #   <IO::Buffer 0x00007fca40087c38+4 INTERNAL>
  *    #   0x00000000  74 65 73 74         test
  *
  *    buffer.clear
  *    # =>
- *    #   <IO::Buffer 0x00007fca40087c38+4 SLICE>
+ *    #   <IO::Buffer 0x00007fca40087c38+4 INTERNAL>
  *    #   0x00000000  00 00 00 00         ....
  *
  *    buf.clear(1) # fill with 1
  *    # =>
- *    #   <IO::Buffer 0x00007fca40087c38+4 SLICE>
+ *    #   <IO::Buffer 0x00007fca40087c38+4 INTERNAL>
  *    #   0x00000000  01 01 01 01         ....
  *
  *    buffer.clear(2, 1, 2) # fill with 2, starting from offset 1, for 2 bytes
  *    # =>
- *    #   <IO::Buffer 0x00007fca40087c38+4 SLICE>
+ *    #   <IO::Buffer 0x00007fca40087c38+4 INTERNAL>
  *    #   0x00000000  01 02 02 01         ....
  *
  *    buffer.clear(2, 1) # fill with 2, starting from offset 1
  *    # =>
- *    #   <IO::Buffer 0x00007fca40087c38+4 SLICE>
+ *    #   <IO::Buffer 0x00007fca40087c38+4 INTERNAL>
  *    #   0x00000000  01 02 02 02         ....
  */
 static VALUE
@@ -2657,10 +2851,10 @@ io_buffer_default_size(size_t page_size)
 }
 
 struct io_buffer_blocking_region_argument {
+    struct rb_io *io;
     struct rb_io_buffer *buffer;
     rb_blocking_function_t *function;
     void *data;
-    int descriptor;
 };
 
 static VALUE
@@ -2668,7 +2862,7 @@ io_buffer_blocking_region_begin(VALUE _argument)
 {
     struct io_buffer_blocking_region_argument *argument = (void*)_argument;
 
-    return rb_thread_io_blocking_region(argument->function, argument->data, argument->descriptor);
+    return rb_io_blocking_region(argument->io, argument->function, argument->data);
 }
 
 static VALUE
@@ -2682,13 +2876,16 @@ io_buffer_blocking_region_ensure(VALUE _argument)
 }
 
 static VALUE
-io_buffer_blocking_region(struct rb_io_buffer *buffer, rb_blocking_function_t *function, void *data, int descriptor)
+io_buffer_blocking_region(VALUE io, struct rb_io_buffer *buffer, rb_blocking_function_t *function, void *data)
 {
+    struct rb_io *ioptr;
+    RB_IO_POINTER(io, ioptr);
+
     struct io_buffer_blocking_region_argument argument = {
+        .io = ioptr,
         .buffer = buffer,
         .function = function,
         .data = data,
-        .descriptor = descriptor,
     };
 
     // If the buffer is already locked, we can skip the ensure (unlock):
@@ -2745,6 +2942,8 @@ io_buffer_read_internal(void *_argument)
 VALUE
 rb_io_buffer_read(VALUE self, VALUE io, size_t length, size_t offset)
 {
+    io = rb_io_get_io(io);
+
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_read(scheduler, io, self, length, offset);
@@ -2775,7 +2974,7 @@ rb_io_buffer_read(VALUE self, VALUE io, size_t length, size_t offset)
         .length = length,
     };
 
-    return io_buffer_blocking_region(buffer, io_buffer_read_internal, &argument, descriptor);
+    return io_buffer_blocking_region(io, buffer, io_buffer_read_internal, &argument);
 }
 
 /*
@@ -2862,6 +3061,8 @@ io_buffer_pread_internal(void *_argument)
 VALUE
 rb_io_buffer_pread(VALUE self, VALUE io, rb_off_t from, size_t length, size_t offset)
 {
+    io = rb_io_get_io(io);
+
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_pread(scheduler, io, from, self, length, offset);
@@ -2893,7 +3094,7 @@ rb_io_buffer_pread(VALUE self, VALUE io, rb_off_t from, size_t length, size_t of
         .offset = from,
     };
 
-    return io_buffer_blocking_region(buffer, io_buffer_pread_internal, &argument, descriptor);
+    return io_buffer_blocking_region(io, buffer, io_buffer_pread_internal, &argument);
 }
 
 /*
@@ -2982,6 +3183,8 @@ io_buffer_write_internal(void *_argument)
 VALUE
 rb_io_buffer_write(VALUE self, VALUE io, size_t length, size_t offset)
 {
+    io = rb_io_get_write_io(rb_io_get_io(io));
+
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_write(scheduler, io, self, length, offset);
@@ -3012,7 +3215,7 @@ rb_io_buffer_write(VALUE self, VALUE io, size_t length, size_t offset)
         .length = length,
     };
 
-    return io_buffer_blocking_region(buffer, io_buffer_write_internal, &argument, descriptor);
+    return io_buffer_blocking_region(io, buffer, io_buffer_write_internal, &argument);
 }
 
 /*
@@ -3046,6 +3249,7 @@ io_buffer_write(int argc, VALUE *argv, VALUE self)
 
     return rb_io_buffer_write(self, io, length, offset);
 }
+
 struct io_buffer_pwrite_internal_argument {
     // The file descriptor to write to:
     int descriptor;
@@ -3091,6 +3295,8 @@ io_buffer_pwrite_internal(void *_argument)
 VALUE
 rb_io_buffer_pwrite(VALUE self, VALUE io, rb_off_t from, size_t length, size_t offset)
 {
+    io = rb_io_get_write_io(rb_io_get_io(io));
+
     VALUE scheduler = rb_fiber_scheduler_current();
     if (scheduler != Qnil) {
         VALUE result = rb_fiber_scheduler_io_pwrite(scheduler, io, from, self, length, offset);
@@ -3130,7 +3336,7 @@ rb_io_buffer_pwrite(VALUE self, VALUE io, rb_off_t from, size_t length, size_t o
         .offset = from,
     };
 
-    return io_buffer_blocking_region(buffer, io_buffer_pwrite_internal, &argument, descriptor);
+    return io_buffer_blocking_region(io, buffer, io_buffer_pwrite_internal, &argument);
 }
 
 /*
@@ -3172,14 +3378,14 @@ io_buffer_pwrite(int argc, VALUE *argv, VALUE self)
 }
 
 static inline void
-io_buffer_check_mask(const struct rb_io_buffer *buffer)
+io_buffer_check_mask_size(size_t size)
 {
-    if (buffer->size == 0)
+    if (size == 0)
         rb_raise(rb_eIOBufferMaskError, "Zero-length mask given!");
 }
 
 static void
-memory_and(unsigned char * restrict output, unsigned char * restrict base, size_t size, unsigned char * restrict mask, size_t mask_size)
+memory_and(unsigned char * restrict output, const unsigned char * restrict base, size_t size, const unsigned char * restrict mask, size_t mask_size)
 {
     for (size_t offset = 0; offset < size; offset += 1) {
         output[offset] = base[offset] & mask[offset % mask_size];
@@ -3207,19 +3413,27 @@ io_buffer_and(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    const void *base;
+    size_t size;
+    io_buffer_get_bytes_for_reading(buffer, &base, &size);
+
+    const void *mask_base;
+    size_t mask_size;
+    io_buffer_get_bytes_for_reading(mask_buffer, &mask_base, &mask_size);
 
-    VALUE output = rb_io_buffer_new(NULL, buffer->size, io_flags_for_size(buffer->size));
+    io_buffer_check_mask_size(mask_size);
+
+    VALUE output = rb_io_buffer_new(NULL, size, io_flags_for_size(size));
     struct rb_io_buffer *output_buffer = NULL;
     TypedData_Get_Struct(output, struct rb_io_buffer, &rb_io_buffer_type, output_buffer);
 
-    memory_and(output_buffer->base, buffer->base, buffer->size, mask_buffer->base, mask_buffer->size);
+    memory_and(output_buffer->base, base, size, mask_base, mask_size);
 
     return output;
 }
 
 static void
-memory_or(unsigned char * restrict output, unsigned char * restrict base, size_t size, unsigned char * restrict mask, size_t mask_size)
+memory_or(unsigned char * restrict output, const unsigned char * restrict base, size_t size, const unsigned char * restrict mask, size_t mask_size)
 {
     for (size_t offset = 0; offset < size; offset += 1) {
         output[offset] = base[offset] | mask[offset % mask_size];
@@ -3247,19 +3461,27 @@ io_buffer_or(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    const void *base;
+    size_t size;
+    io_buffer_get_bytes_for_reading(buffer, &base, &size);
+
+    const void *mask_base;
+    size_t mask_size;
+    io_buffer_get_bytes_for_reading(mask_buffer, &mask_base, &mask_size);
 
-    VALUE output = rb_io_buffer_new(NULL, buffer->size, io_flags_for_size(buffer->size));
+    io_buffer_check_mask_size(mask_size);
+
+    VALUE output = rb_io_buffer_new(NULL, size, io_flags_for_size(size));
     struct rb_io_buffer *output_buffer = NULL;
     TypedData_Get_Struct(output, struct rb_io_buffer, &rb_io_buffer_type, output_buffer);
 
-    memory_or(output_buffer->base, buffer->base, buffer->size, mask_buffer->base, mask_buffer->size);
+    memory_or(output_buffer->base, base, size, mask_base, mask_size);
 
     return output;
 }
 
 static void
-memory_xor(unsigned char * restrict output, unsigned char * restrict base, size_t size, unsigned char * restrict mask, size_t mask_size)
+memory_xor(unsigned char * restrict output, const unsigned char * restrict base, size_t size, const unsigned char * restrict mask, size_t mask_size)
 {
     for (size_t offset = 0; offset < size; offset += 1) {
         output[offset] = base[offset] ^ mask[offset % mask_size];
@@ -3287,19 +3509,27 @@ io_buffer_xor(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    const void *base;
+    size_t size;
+    io_buffer_get_bytes_for_reading(buffer, &base, &size);
+
+    const void *mask_base;
+    size_t mask_size;
+    io_buffer_get_bytes_for_reading(mask_buffer, &mask_base, &mask_size);
 
-    VALUE output = rb_io_buffer_new(NULL, buffer->size, io_flags_for_size(buffer->size));
+    io_buffer_check_mask_size(mask_size);
+
+    VALUE output = rb_io_buffer_new(NULL, size, io_flags_for_size(size));
     struct rb_io_buffer *output_buffer = NULL;
     TypedData_Get_Struct(output, struct rb_io_buffer, &rb_io_buffer_type, output_buffer);
 
-    memory_xor(output_buffer->base, buffer->base, buffer->size, mask_buffer->base, mask_buffer->size);
+    memory_xor(output_buffer->base, base, size, mask_base, mask_size);
 
     return output;
 }
 
 static void
-memory_not(unsigned char * restrict output, unsigned char * restrict base, size_t size)
+memory_not(unsigned char * restrict output, const unsigned char * restrict base, size_t size)
 {
     for (size_t offset = 0; offset < size; offset += 1) {
         output[offset] = ~base[offset];
@@ -3310,7 +3540,7 @@ memory_not(unsigned char * restrict output, unsigned char * restrict base, size_
  *  call-seq:
  *    ~source -> io_buffer
  *
- *  Generate a new buffer the same size as the source by applying the binary NOT
+ *  Generate a new buffer the same size as the source by applying the unary NOT
  *  operation to the source.
  *
  *    ~IO::Buffer.for("1234567890")
@@ -3324,11 +3554,15 @@ io_buffer_not(VALUE self)
     struct rb_io_buffer *buffer = NULL;
     TypedData_Get_Struct(self, struct rb_io_buffer, &rb_io_buffer_type, buffer);
 
-    VALUE output = rb_io_buffer_new(NULL, buffer->size, io_flags_for_size(buffer->size));
+    const void *base;
+    size_t size;
+    io_buffer_get_bytes_for_reading(buffer, &base, &size);
+
+    VALUE output = rb_io_buffer_new(NULL, size, io_flags_for_size(size));
     struct rb_io_buffer *output_buffer = NULL;
     TypedData_Get_Struct(output, struct rb_io_buffer, &rb_io_buffer_type, output_buffer);
 
-    memory_not(output_buffer->base, buffer->base, buffer->size);
+    memory_not(output_buffer->base, base, size);
 
     return output;
 }
@@ -3340,7 +3574,7 @@ io_buffer_overlaps(const struct rb_io_buffer *a, const struct rb_io_buffer *b)
         return io_buffer_overlaps(b, a);
     }
 
-    return (b->base >= a->base) && (b->base <= (void*)((unsigned char *)a->base + a->size));
+    return (b->base >= a->base) && (b->base < (void*)((unsigned char *)a->base + a->size));
 }
 
 static inline void
@@ -3384,7 +3618,7 @@ io_buffer_and_inplace(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    io_buffer_check_mask_size(mask_buffer->size);
     io_buffer_check_overlaps(buffer, mask_buffer);
 
     void *base;
@@ -3430,7 +3664,7 @@ io_buffer_or_inplace(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    io_buffer_check_mask_size(mask_buffer->size);
     io_buffer_check_overlaps(buffer, mask_buffer);
 
     void *base;
@@ -3476,7 +3710,7 @@ io_buffer_xor_inplace(VALUE self, VALUE mask)
     struct rb_io_buffer *mask_buffer = NULL;
     TypedData_Get_Struct(mask, struct rb_io_buffer, &rb_io_buffer_type, mask_buffer);
 
-    io_buffer_check_mask(mask_buffer);
+    io_buffer_check_mask_size(mask_buffer->size);
     io_buffer_check_overlaps(buffer, mask_buffer);
 
     void *base;
@@ -3500,7 +3734,7 @@ memory_not_inplace(unsigned char * restrict base, size_t size)
  *  call-seq:
  *    source.not! -> io_buffer
  *
- *  Modify the source buffer in place by applying the binary NOT
+ *  Modify the source buffer in place by applying the unary NOT
  *  operation to the source.
  *
  *    source = IO::Buffer.for("1234567890").dup # Make a read/write copy.
@@ -3528,6 +3762,60 @@ io_buffer_not_inplace(VALUE self)
     return self;
 }
 
+static size_t
+memory_bit_count(const unsigned char *base, size_t size)
+{
+    size_t count = 0;
+
+    // Process 8 bytes at a time for efficiency:
+    const uint64_t *base64 = (const uint64_t *)base;
+    size_t count64 = size / 8;
+    for (size_t i = 0; i < count64; i += 1) {
+        count += rb_popcount64(base64[i]);
+    }
+
+    // Process any remaining bytes:
+    size_t remaining = size % 8;
+    const unsigned char *tail = base + (count64 * 8);
+    for (size_t i = 0; i < remaining; i += 1) {
+        count += rb_popcount32(tail[i]);
+    }
+
+    return count;
+}
+
+/*
+ *  call-seq: bit_count([offset, [length]]) -> integer
+ *
+ *  Returns the number of set bits (1s) in the buffer, also known as the
+ *  Hamming weight or population count. An optional +offset+ and +length+
+ *  can be provided to count bits in a subrange of the buffer.
+ *
+ *    IO::Buffer.for("\xFF\x00\x0F").bit_count
+ *    # => 12
+ *
+ *    IO::Buffer.for("\xFF\x00\x0F").bit_count(1, 2)
+ *    # => 4
+ */
+static VALUE
+io_buffer_bit_count(int argc, VALUE *argv, VALUE self)
+{
+    rb_check_arity(argc, 0, 2);
+
+    size_t offset, length;
+    struct rb_io_buffer *buffer = io_buffer_extract_offset_length(self, argc, argv, &offset, &length);
+
+    io_buffer_validate_range(buffer, offset, length);
+
+    const void *base;
+    size_t size;
+    io_buffer_get_bytes_for_reading(buffer, &base, &size);
+
+    size_t count = memory_bit_count((const unsigned char *)base + offset, length);
+
+    return SIZET2NUM(count);
+}
+
 /*
  *  Document-class: IO::Buffer
  *
@@ -3594,9 +3882,9 @@ io_buffer_not_inplace(VALUE self)
  *
  *    File.write('test.txt', 'test data')
  *    # => 9
- *    buffer = IO::Buffer.map(File.open('test.txt'))
+ *    buffer = IO::Buffer.map(File.open('test.txt'), nil, 0, IO::Buffer::READONLY)
  *    # =>
- *    # #<IO::Buffer 0x00007f3f0768c000+9 MAPPED IMMUTABLE>
+ *    # #<IO::Buffer 0x00007f3f0768c000+9 EXTERNAL MAPPED FILE SHARED READONLY>
  *    # ...
  *    buffer.get_string(5, 2) # read 2 bytes, starting from offset 5
  *    # => "da"
@@ -3745,6 +4033,11 @@ Init_IO_Buffer(void)
     IO_BUFFER_DEFINE_DATA_TYPE(s64);
     IO_BUFFER_DEFINE_DATA_TYPE(S64);
 
+    IO_BUFFER_DEFINE_DATA_TYPE(u128);
+    IO_BUFFER_DEFINE_DATA_TYPE(U128);
+    IO_BUFFER_DEFINE_DATA_TYPE(s128);
+    IO_BUFFER_DEFINE_DATA_TYPE(S128);
+
     IO_BUFFER_DEFINE_DATA_TYPE(f32);
     IO_BUFFER_DEFINE_DATA_TYPE(F32);
     IO_BUFFER_DEFINE_DATA_TYPE(f64);
@@ -3778,6 +4071,8 @@ Init_IO_Buffer(void)
     rb_define_method(rb_cIOBuffer, "xor!", io_buffer_xor_inplace, 1);
     rb_define_method(rb_cIOBuffer, "not!", io_buffer_not_inplace, 0);
 
+    rb_define_method(rb_cIOBuffer, "bit_count", io_buffer_bit_count, -1);
+
     // IO operations:
     rb_define_method(rb_cIOBuffer, "read", io_buffer_read, -1);
     rb_define_method(rb_cIOBuffer, "pread", io_buffer_pread, -1);
diff --git a/iseq.c b/iseq.c
index 05d52b61b4..b90fcb4334 100644
--- a/iseq.c
+++ b/iseq.c
@@ -19,6 +19,7 @@
 #endif
 
 #include "eval_intern.h"
+#include "id.h"
 #include "id_table.h"
 #include "internal.h"
 #include "internal/bits.h"
@@ -31,19 +32,21 @@
 #include "internal/io.h"
 #include "internal/ruby_parser.h"
 #include "internal/sanitizers.h"
+#include "internal/set_table.h"
 #include "internal/symbol.h"
 #include "internal/thread.h"
 #include "internal/variable.h"
 #include "iseq.h"
-#include "rjit.h"
 #include "ruby/util.h"
 #include "vm_core.h"
+#include "ractor_core.h"
 #include "vm_callinfo.h"
 #include "yjit.h"
 #include "ruby/ractor.h"
 #include "builtin.h"
 #include "insns.inc"
 #include "insns_info.inc"
+#include "zjit.h"
 
 VALUE rb_cISeq;
 static VALUE iseqw_new(const rb_iseq_t *iseq);
@@ -85,7 +88,7 @@ free_arena(struct iseq_compile_data_storage *cur)
 
     while (cur) {
         next = cur->next;
-        ruby_xfree(cur);
+        ruby_xfree_sized(cur, offsetof(struct iseq_compile_data_storage, buff) + cur->size * sizeof(char));
         cur = next;
     }
 }
@@ -99,7 +102,7 @@ compile_data_free(struct iseq_compile_data *compile_data)
         if (compile_data->ivar_cache_table) {
             rb_id_table_free(compile_data->ivar_cache_table);
         }
-        ruby_xfree(compile_data);
+        SIZED_FREE(compile_data);
     }
 }
 
@@ -110,13 +113,15 @@ remove_from_constant_cache(ID id, IC ic)
     VALUE lookup_result;
     st_data_t ic_data = (st_data_t)ic;
 
-    if (rb_id_table_lookup(vm->constant_cache, id, &lookup_result)) {
-        st_table *ics = (st_table *)lookup_result;
-        st_delete(ics, &ic_data, NULL);
+    if (rb_id_table_lookup(&vm->constant_cache, id, &lookup_result)) {
+        set_table *ics = (set_table *)lookup_result;
+        set_table_delete(ics, &ic_data);
 
-        if (ics->num_entries == 0) {
-            rb_id_table_delete(vm->constant_cache, id);
-            st_free_table(ics);
+        if (ics->num_entries == 0 &&
+                // See comment in vm_track_constant_cache on why we need this check
+                id != vm->inserting_constant_cache_id) {
+            rb_id_table_delete(&vm->constant_cache, id);
+            set_free_table(ics);
         }
     }
 }
@@ -147,14 +152,33 @@ iseq_clear_ic_references(const rb_iseq_t *iseq)
         if (segments == NULL)
             continue;
 
-        for (int i = 0; segments[i]; i++) {
+        int i;
+        for (i = 0; segments[i]; i++) {
             ID id = segments[i];
             if (id == idNULL) continue;
             remove_from_constant_cache(id, ic);
         }
 
-        ruby_xfree((void *)segments);
+        SIZED_FREE_N(segments, i + 1);
+    }
+}
+
+
+rb_hook_list_t *
+rb_iseq_local_hooks(const rb_iseq_t *iseq, rb_ractor_t *r, bool create)
+{
+    rb_hook_list_t *hook_list = NULL;
+    st_data_t val;
+    if (st_lookup(rb_ractor_targeted_hooks(r), (st_data_t)iseq, &val)) {
+        hook_list = (rb_hook_list_t*)val;
+        RUBY_ASSERT(hook_list->type == hook_list_type_targeted_iseq);
+    }
+    else if (create) {
+        hook_list = RB_ZALLOC(rb_hook_list_t);
+        hook_list->type = hook_list_type_targeted_iseq;
+        st_insert(rb_ractor_targeted_hooks(r), (st_data_t)iseq, (st_data_t)hook_list);
     }
+    return hook_list;
 }
 
 void
@@ -165,7 +189,6 @@ rb_iseq_free(const rb_iseq_t *iseq)
     if (iseq && ISEQ_BODY(iseq)) {
         iseq_clear_ic_references(iseq);
         struct rb_iseq_constant_body *const body = ISEQ_BODY(iseq);
-        rb_rjit_free_iseq(iseq); /* Notify RJIT */
 #if USE_YJIT
         rb_yjit_iseq_free(iseq);
         if (FL_TEST_RAW((VALUE)iseq, ISEQ_TRANSLATED)) {
@@ -173,37 +196,44 @@ rb_iseq_free(const rb_iseq_t *iseq)
             rb_yjit_live_iseq_count--;
         }
 #endif
-        ruby_xfree((void *)body->iseq_encoded);
-        ruby_xfree((void *)body->insns_info.body);
-        ruby_xfree((void *)body->insns_info.positions);
+#if USE_ZJIT
+        rb_zjit_iseq_free(iseq);
+#endif
+        SIZED_FREE_N(body->iseq_encoded, body->iseq_size);
+        SIZED_FREE_N(body->insns_info.body, body->insns_info.size);
+        SIZED_FREE_N(body->insns_info.positions, body->insns_info.size);
 #if VM_INSN_INFO_TABLE_IMPL == 2
         ruby_xfree(body->insns_info.succ_index_table);
 #endif
-        if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl))
-            ruby_xfree((void *)body->local_table);
-        ruby_xfree((void *)body->is_entries);
-        ruby_xfree(body->call_data);
-        ruby_xfree((void *)body->catch_table);
-        ruby_xfree((void *)body->param.opt_table);
+        SIZED_FREE_N(body->is_entries, ISEQ_IS_SIZE(body));
+        SIZED_FREE_N(body->call_data, body->ci_size);
+        if (body->catch_table) {
+            ruby_xfree_sized(body->catch_table, iseq_catch_table_bytes(body->catch_table->size));
+        }
+        SIZED_FREE_N(body->param.opt_table, body->param.opt_num + 1);
         if (ISEQ_MBITS_BUFLEN(body->iseq_size) > 1 && body->mark_bits.list) {
-            ruby_xfree((void *)body->mark_bits.list);
+            SIZED_FREE_N(body->mark_bits.list, ISEQ_MBITS_BUFLEN(body->iseq_size));
         }
 
-        ruby_xfree(body->variable.original_iseq);
+        ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
 
-        if (body->param.keyword != NULL) {
-            if (body->param.keyword->table != &body->local_table[body->param.keyword->bits_start - body->param.keyword->num])
-                ruby_xfree((void *)body->param.keyword->table);
-            ruby_xfree((void *)body->param.keyword->default_values);
-            ruby_xfree((void *)body->param.keyword);
+        struct rb_iseq_param_keyword *pkw = (struct rb_iseq_param_keyword *)body->param.keyword;
+        if (pkw != NULL) {
+            if (pkw->table != &body->local_table[pkw->bits_start - pkw->num])
+                SIZED_FREE_N(pkw->table, pkw->required_num);
+            if (pkw->default_values) {
+                SIZED_FREE_N(pkw->default_values, pkw->num - pkw->required_num);
+            }
+            SIZED_FREE(pkw);
         }
+        if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl)) {
+            SIZED_FREE_N(body->local_table, body->local_table_size);
+        }
+        SIZED_FREE_N(body->lvar_states, body->local_table_size);
+
         compile_data_free(ISEQ_COMPILE_DATA(iseq));
         if (body->outer_variables) rb_id_table_free(body->outer_variables);
-        ruby_xfree(body);
-    }
-
-    if (iseq && ISEQ_EXECUTABLE_P(iseq) && iseq->aux.exec.local_hooks) {
-        rb_hook_list_free(iseq->aux.exec.local_hooks);
+        SIZED_FREE(body);
     }
 
     RUBY_FREE_LEAVE("iseq");
@@ -230,7 +260,30 @@ iseq_scan_bits(unsigned int page, iseq_bits_t bits, VALUE *code, VALUE *original
 }
 
 static void
-rb_iseq_mark_and_move_each_value(const rb_iseq_t *iseq, VALUE *original_iseq)
+rb_iseq_mark_and_move_each_compile_data_value(const rb_iseq_t *iseq, VALUE *original_iseq)
+{
+    unsigned int size;
+    VALUE *code;
+    const struct iseq_compile_data *const compile_data = ISEQ_COMPILE_DATA(iseq);
+
+    size = compile_data->iseq_size;
+    code = compile_data->iseq_encoded;
+
+    // Embedded VALUEs
+    if (compile_data->mark_bits.list) {
+        if(compile_data->is_single_mark_bit) {
+            iseq_scan_bits(0, compile_data->mark_bits.single, code, original_iseq);
+        }
+        else {
+            for (unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
+                iseq_bits_t bits = compile_data->mark_bits.list[i];
+                iseq_scan_bits(i, bits, code, original_iseq);
+            }
+        }
+    }
+}
+static void
+rb_iseq_mark_and_move_each_body_value(const rb_iseq_t *iseq, VALUE *original_iseq)
 {
     unsigned int size;
     VALUE *code;
@@ -249,9 +302,7 @@ rb_iseq_mark_and_move_each_value(const rb_iseq_t *iseq, VALUE *original_iseq)
         for (unsigned int i = 0; i < body->icvarc_size; i++, is_entries++) {
             ICVARC icvarc = (ICVARC)is_entries;
             if (icvarc->entry) {
-                RUBY_ASSERT(!RB_TYPE_P(icvarc->entry->class_value, T_NONE));
-
-                rb_gc_mark_and_move(&icvarc->entry->class_value);
+                rb_gc_mark_and_move((VALUE *)&icvarc->entry);
             }
         }
 
@@ -278,11 +329,9 @@ rb_iseq_mark_and_move_each_value(const rb_iseq_t *iseq, VALUE *original_iseq)
             iseq_scan_bits(0, body->mark_bits.single, code, original_iseq);
         }
         else {
-            if (body->mark_bits.list) {
-                for (unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
-                    iseq_bits_t bits = body->mark_bits.list[i];
-                    iseq_scan_bits(i, bits, code, original_iseq);
-                }
+            for (unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
+                iseq_bits_t bits = body->mark_bits.list[i];
+                iseq_scan_bits(i, bits, code, original_iseq);
             }
         }
     }
@@ -300,15 +349,13 @@ cc_is_active(const struct rb_callcache *cc, bool reference_updating)
             cc = (const struct rb_callcache *)rb_gc_location((VALUE)cc);
         }
 
-        if (vm_cc_markable(cc)) {
-            if (cc->klass) { // cc is not invalidated
-                const struct rb_callable_method_entry_struct *cme = vm_cc_cme(cc);
-                if (reference_updating) {
-                    cme = (const struct rb_callable_method_entry_struct *)rb_gc_location((VALUE)cme);
-                }
-                if (!METHOD_ENTRY_INVALIDATED(cme)) {
-                    return true;
-                }
+        if (vm_cc_markable(cc) && vm_cc_valid(cc)) {
+            const struct rb_callable_method_entry_struct *cme = vm_cc_cme(cc);
+            if (reference_updating) {
+                cme = (const struct rb_callable_method_entry_struct *)rb_gc_location((VALUE)cme);
+            }
+            if (!METHOD_ENTRY_INVALIDATED(cme)) {
+                return true;
             }
         }
     }
@@ -325,10 +372,8 @@ rb_iseq_mark_and_move(rb_iseq_t *iseq, bool reference_updating)
     if (ISEQ_BODY(iseq)) {
         struct rb_iseq_constant_body *body = ISEQ_BODY(iseq);
 
-        rb_iseq_mark_and_move_each_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
+        rb_iseq_mark_and_move_each_body_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
 
-        rb_gc_mark_and_move(&body->variable.coverage);
-        rb_gc_mark_and_move(&body->variable.pc2branchindex);
         rb_gc_mark_and_move(&body->variable.script_lines);
         rb_gc_mark_and_move(&body->location.label);
         rb_gc_mark_and_move(&body->location.base_label);
@@ -352,11 +397,13 @@ rb_iseq_mark_and_move(rb_iseq_t *iseq, bool reference_updating)
             }
         }
 
-        if (body->param.flags.has_kw && ISEQ_COMPILE_DATA(iseq) == NULL) {
+        if (body->param.flags.has_kw && body->param.keyword != NULL) {
             const struct rb_iseq_param_keyword *const keyword = body->param.keyword;
 
-            for (int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
-                rb_gc_mark_and_move(&keyword->default_values[j]);
+            if (keyword->default_values != NULL) {
+                for (int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
+                    rb_gc_mark_and_move(&keyword->default_values[j]);
+                }
             }
         }
 
@@ -373,48 +420,51 @@ rb_iseq_mark_and_move(rb_iseq_t *iseq, bool reference_updating)
         }
 
         if (reference_updating) {
-#if USE_RJIT
-            rb_rjit_iseq_update_references(body);
-#endif
 #if USE_YJIT
             rb_yjit_iseq_update_references(iseq);
 #endif
+#if USE_ZJIT
+            rb_zjit_iseq_update_references(body->zjit_payload);
+#endif
         }
         else {
-#if USE_RJIT
-            rb_rjit_iseq_mark(body->rjit_blocks);
-#endif
+            // TODO: check jit payload
+            if (!rb_gc_checking_shareable()) {
 #if USE_YJIT
-            rb_yjit_iseq_mark(body->yjit_payload);
+                rb_yjit_iseq_mark(body->yjit_payload);
 #endif
+#if USE_ZJIT
+                rb_zjit_iseq_mark(body->zjit_payload);
+#endif
+            }
+        }
+
+        // TODO: ractor aware coverage
+        if (!rb_gc_checking_shareable()) {
+            rb_gc_mark_and_move(&body->variable.coverage);
+            rb_gc_mark_and_move(&body->variable.pc2branchindex);
         }
     }
 
     if (FL_TEST_RAW((VALUE)iseq, ISEQ_NOT_LOADED_YET)) {
-        rb_gc_mark_and_move(&iseq->aux.loader.obj);
+        if (!rb_gc_checking_shareable()) {
+            rb_gc_mark_and_move(&iseq->aux.loader.obj);
+        }
     }
     else if (FL_TEST_RAW((VALUE)iseq, ISEQ_USE_COMPILE_DATA)) {
-        const struct iseq_compile_data *const compile_data = ISEQ_COMPILE_DATA(iseq);
-
-        if (!reference_updating) {
-            /* The operands in each instruction needs to be pinned because
-             * if auto-compaction runs in iseq_set_sequence, then the objects
-             * could exist on the generated_iseq buffer, which would not be
-             * reference updated which can lead to T_MOVED (and subsequently
-             * T_NONE) objects on the iseq. */
-            rb_iseq_mark_and_pin_insn_storage(compile_data->insn.storage_head);
-        }
+        if (!rb_gc_checking_shareable()) {
+            const struct iseq_compile_data *const compile_data = ISEQ_COMPILE_DATA(iseq);
+
+            rb_iseq_mark_and_move_insn_storage(compile_data->insn.storage_head);
+            rb_iseq_mark_and_move_each_compile_data_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
 
-        rb_gc_mark_and_move((VALUE *)&compile_data->err_info);
-        rb_gc_mark_and_move((VALUE *)&compile_data->catch_table_ary);
+            rb_gc_mark_and_move((VALUE *)&compile_data->err_info);
+            rb_gc_mark_and_move((VALUE *)&compile_data->catch_table_ary);
+        }
     }
     else {
         /* executable */
         VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
-
-        if (iseq->aux.exec.local_hooks) {
-            rb_hook_list_mark_and_update(iseq->aux.exec.local_hooks);
-        }
     }
 
     RUBY_MARK_LEAVE("iseq");
@@ -519,9 +569,14 @@ rb_iseq_pathobj_new(VALUE path, VALUE realpath)
         pathobj = rb_fstring(path);
     }
     else {
-        if (!NIL_P(realpath)) realpath = rb_fstring(realpath);
-        pathobj = rb_ary_new_from_args(2, rb_fstring(path), realpath);
-        rb_obj_freeze(pathobj);
+        if (!NIL_P(realpath)) {
+            realpath = rb_fstring(realpath);
+        }
+        VALUE fpath = rb_fstring(path);
+
+        pathobj = rb_ary_new_from_args(2, fpath, realpath);
+        rb_ary_freeze(pathobj);
+        RB_OBJ_SET_SHAREABLE(pathobj);
     }
     return pathobj;
 }
@@ -533,6 +588,24 @@ rb_iseq_pathobj_set(const rb_iseq_t *iseq, VALUE path, VALUE realpath)
                  rb_iseq_pathobj_new(path, realpath));
 }
 
+// Make a dummy iseq for a dummy frame that exposes a path for profilers to inspect
+rb_iseq_t *
+rb_iseq_alloc_with_dummy_path(VALUE fname)
+{
+    rb_iseq_t *dummy_iseq = iseq_alloc();
+
+    ISEQ_BODY(dummy_iseq)->type = ISEQ_TYPE_TOP;
+
+    if (!RB_OBJ_SHAREABLE_P(fname)) {
+        RB_OBJ_SET_FROZEN_SHAREABLE(fname);
+    }
+
+    RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.pathobj, fname);
+    RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.label, fname);
+
+    return dummy_iseq;
+}
+
 static rb_iseq_location_t *
 iseq_location_setup(rb_iseq_t *iseq, VALUE name, VALUE path, VALUE realpath, int first_lineno, const rb_code_location_t *code_location, const int node_id)
 {
@@ -575,11 +648,11 @@ set_relation(rb_iseq_t *iseq, const rb_iseq_t *piseq)
         body->local_iseq = iseq;
     }
     else if (piseq) {
-        body->local_iseq = ISEQ_BODY(piseq)->local_iseq;
+        RB_OBJ_WRITE(iseq, &body->local_iseq, ISEQ_BODY(piseq)->local_iseq);
     }
 
     if (piseq) {
-        body->parent_iseq = piseq;
+        RB_OBJ_WRITE(iseq, &body->parent_iseq, piseq);
     }
 
     if (type == ISEQ_TYPE_MAIN) {
@@ -602,6 +675,18 @@ new_arena(void)
     return new_arena;
 }
 
+static int
+prepare_node_id(const NODE *node)
+{
+    if (!node) return -1;
+
+    if (nd_type(node) == NODE_SCOPE && RNODE_SCOPE(node)->nd_parent) {
+        return nd_node_id(RNODE_SCOPE(node)->nd_parent);
+    }
+
+    return nd_node_id(node);
+}
+
 static VALUE
 prepare_iseq_build(rb_iseq_t *iseq,
                    VALUE name, VALUE path, VALUE realpath, int first_lineno, const rb_code_location_t *code_location, const int node_id,
@@ -675,7 +760,7 @@ rb_iseq_insns_info_encode_positions(const rb_iseq_t *iseq)
     if (body->insns_info.succ_index_table) ruby_xfree(body->insns_info.succ_index_table);
     body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
 #if VM_CHECK_MODE == 0
-    ruby_xfree(body->insns_info.positions);
+    SIZED_FREE_N(body->insns_info.positions, body->insns_info.size);
     body->insns_info.positions = NULL;
 #endif
 #endif
@@ -779,10 +864,6 @@ set_compile_option_from_hash(rb_compile_option_t *option, VALUE opt)
 static rb_compile_option_t *
 set_compile_option_from_ast(rb_compile_option_t *option, const rb_ast_body_t *ast)
 {
-#define SET_COMPILE_OPTION(o, a, mem) \
-    ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
-    SET_COMPILE_OPTION(option, ast, coverage_enabled);
-#undef SET_COMPILE_OPTION
     if (ast->frozen_string_literal >= 0) {
         option->frozen_string_literal = ast->frozen_string_literal;
     }
@@ -893,12 +974,12 @@ rb_iseq_new_top(const VALUE ast_value, VALUE name, VALUE path, VALUE realpath, c
  * The main entry-point into the prism compiler when a file is required.
  */
 rb_iseq_t *
-pm_iseq_new_top(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath, const rb_iseq_t *parent)
+pm_iseq_new_top(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath, const rb_iseq_t *parent, int *error_state)
 {
-    iseq_new_setup_coverage(path, (int) (node->parser->newline_list.size - 1));
+    iseq_new_setup_coverage(path, (int) (pm_parser_line_offsets(node->parser)->size - 1));
 
     return pm_iseq_new_with_opt(node, name, path, realpath, 0, parent, 0,
-                                ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT);
+                                ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT, error_state);
 }
 
 rb_iseq_t *
@@ -917,13 +998,13 @@ rb_iseq_new_main(const VALUE ast_value, VALUE path, VALUE realpath, const rb_ise
  * main file in the program.
  */
 rb_iseq_t *
-pm_iseq_new_main(pm_scope_node_t *node, VALUE path, VALUE realpath, const rb_iseq_t *parent, int opt)
+pm_iseq_new_main(pm_scope_node_t *node, VALUE path, VALUE realpath, const rb_iseq_t *parent, int opt, int *error_state)
 {
-    iseq_new_setup_coverage(path, (int) (node->parser->newline_list.size - 1));
+    iseq_new_setup_coverage(path, (int) (pm_parser_line_offsets(node->parser)->size - 1));
 
     return pm_iseq_new_with_opt(node, rb_fstring_lit("<main>"),
                                 path, realpath, 0,
-                                parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE);
+                                parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE, error_state);
 }
 
 rb_iseq_t *
@@ -936,24 +1017,29 @@ rb_iseq_new_eval(const VALUE ast_value, VALUE name, VALUE path, VALUE realpath,
         }
     }
 
+    rb_compile_option_t option = COMPILE_OPTION_DEFAULT;
+    rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
+    if (ast->body.coverage_enabled >= 0) {
+        option.coverage_enabled = ast->body.coverage_enabled;
+    }
     return rb_iseq_new_with_opt(ast_value, name, path, realpath, first_lineno,
-                                parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT,
+                                parent, isolated_depth, ISEQ_TYPE_EVAL, &option,
                                 Qnil);
 }
 
 rb_iseq_t *
 pm_iseq_new_eval(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath,
-                     int first_lineno, const rb_iseq_t *parent, int isolated_depth)
+                     int first_lineno, const rb_iseq_t *parent, int isolated_depth, int *error_state)
 {
     if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
         VALUE coverages = rb_get_coverages();
         if (RTEST(coverages) && RTEST(path) && !RTEST(rb_hash_has_key(coverages, path))) {
-            iseq_setup_coverage(coverages, path, ((int) (node->parser->newline_list.size - 1)) + first_lineno - 1);
+            iseq_setup_coverage(coverages, path, ((int) (pm_parser_line_offsets(node->parser)->size - 1)) + first_lineno - 1);
         }
     }
 
     return pm_iseq_new_with_opt(node, name, path, realpath, first_lineno,
-                                parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT);
+                                parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT, error_state);
 }
 
 static inline rb_iseq_t *
@@ -971,7 +1057,7 @@ iseq_translate(rb_iseq_t *iseq)
 }
 
 rb_iseq_t *
-rb_iseq_new_with_opt(const VALUE ast_value, VALUE name, VALUE path, VALUE realpath,
+rb_iseq_new_with_opt(VALUE ast_value, VALUE name, VALUE path, VALUE realpath,
                      int first_lineno, const rb_iseq_t *parent, int isolated_depth,
                      enum rb_iseq_type type, const rb_compile_option_t *option,
                      VALUE script_lines)
@@ -999,35 +1085,28 @@ rb_iseq_new_with_opt(const VALUE ast_value, VALUE name, VALUE path, VALUE realpa
         script_lines = ISEQ_BODY(parent)->variable.script_lines;
     }
 
-    prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, node ? nd_node_id(node) : -1,
+    prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, prepare_node_id(node),
                        parent, isolated_depth, type, script_lines, option);
 
     rb_iseq_compile_node(iseq, node);
     finish_iseq_build(iseq);
+    RB_GC_GUARD(ast_value);
 
     return iseq_translate(iseq);
 }
 
 /**
- * This is a step in the prism compiler that is called once all of the various
- * options have been established. It is called from one of the pm_iseq_new_*
- * functions or from the RubyVM::InstructionSequence APIs. It is responsible for
- * allocating the instruction sequence, calling into the compiler, and returning
- * the built instruction sequence.
- *
- * Importantly, this is also the function where the compiler is re-entered to
- * compile child instruction sequences. A child instruction sequence is always
- * compiled using a scope node, which is why we cast it explicitly to that here
- * in the parameters (as opposed to accepting a generic pm_node_t *).
+ * Core implementation for building a prism iseq. This does not use rb_protect,
+ * so any exceptions (e.g. from finish_iseq_build) propagate normally up the
+ * call stack — matching the parse.y compiler's behavior.
  */
 rb_iseq_t *
-pm_iseq_new_with_opt(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath,
-                     int first_lineno, const rb_iseq_t *parent, int isolated_depth,
-                     enum rb_iseq_type type, const rb_compile_option_t *option)
+pm_iseq_build(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath,
+              int first_lineno, const rb_iseq_t *parent, int isolated_depth,
+              enum rb_iseq_type type, const rb_compile_option_t *option)
 {
     rb_iseq_t *iseq = iseq_alloc();
     ISEQ_BODY(iseq)->prism = true;
-    ISEQ_BODY(iseq)->param.flags.use_block = true; // unused block warning is not supported yet
 
     rb_compile_option_t next_option;
     if (!option) option = &COMPILE_OPTION_DEFAULT;
@@ -1037,18 +1116,19 @@ pm_iseq_new_with_opt(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpa
     option = &next_option;
 
     pm_location_t *location = &node->base.location;
-    int32_t start_line = node->parser->start_line;
+    int32_t start_line = pm_parser_start_line(node->parser);
+    const pm_line_offset_list_t *line_offsets = pm_parser_line_offsets(node->parser);
 
-    pm_line_column_t start = pm_newline_list_line_column(&node->parser->newline_list, location->start, start_line);
-    pm_line_column_t end = pm_newline_list_line_column(&node->parser->newline_list, location->end, start_line);
+    pm_line_column_t start = pm_line_offset_list_line_column(line_offsets, location->start, start_line);
+    pm_line_column_t end = pm_line_offset_list_line_column(line_offsets, location->start + location->length, start_line);
 
     rb_code_location_t code_location = (rb_code_location_t) {
         .beg_pos = { .lineno = (int) start.line, .column = (int) start.column },
         .end_pos = { .lineno = (int) end.line, .column = (int) end.column }
     };
 
-    prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, -1,
-                       parent, isolated_depth, type, Qnil, option);
+    prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, node->ast_node->node_id,
+                       parent, isolated_depth, type, node->script_lines == NULL ? Qnil : *node->script_lines, option);
 
     pm_iseq_compile_node(iseq, node);
     finish_iseq_build(iseq);
@@ -1056,6 +1136,55 @@ pm_iseq_new_with_opt(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpa
     return iseq_translate(iseq);
 }
 
+struct pm_iseq_new_with_opt_data {
+    rb_iseq_t *iseq;
+    pm_scope_node_t *node;
+    VALUE name, path, realpath;
+    int first_lineno, isolated_depth;
+    const rb_iseq_t *parent;
+    enum rb_iseq_type type;
+    const rb_compile_option_t *option;
+};
+
+static VALUE
+pm_iseq_new_with_opt_try(VALUE d)
+{
+    struct pm_iseq_new_with_opt_data *data = (struct pm_iseq_new_with_opt_data *)d;
+    data->iseq = pm_iseq_build(data->node, data->name, data->path, data->realpath,
+                               data->first_lineno, data->parent, data->isolated_depth,
+                               data->type, data->option);
+    return Qundef;
+}
+
+/**
+ * This is a step in the prism compiler that is called once all of the various
+ * options have been established. It is called from one of the pm_iseq_new_*
+ * functions or from the RubyVM::InstructionSequence APIs.
+ *
+ * This function uses rb_protect to catch exceptions, storing the error state
+ * in the provided out parameter. This is only needed at top-level entry points
+ * where the caller wants to handle errors gracefully. Child iseqs compiled
+ * during the compilation process do NOT go through this function — they use
+ * pm_iseq_build directly, letting exceptions propagate naturally (matching
+ * the parse.y compiler's behavior).
+ */
+rb_iseq_t *
+pm_iseq_new_with_opt(pm_scope_node_t *node, VALUE name, VALUE path, VALUE realpath,
+                     int first_lineno, const rb_iseq_t *parent, int isolated_depth,
+                     enum rb_iseq_type type, const rb_compile_option_t *option, int *error_state)
+{
+    struct pm_iseq_new_with_opt_data data = {
+        .node = node, .name = name, .path = path, .realpath = realpath,
+        .first_lineno = first_lineno, .parent = parent,
+        .isolated_depth = isolated_depth, .type = type, .option = option
+    };
+    rb_protect(pm_iseq_new_with_opt_try, (VALUE)&data, error_state);
+
+    if (*error_state) return NULL;
+
+    return data.iseq;
+}
+
 rb_iseq_t *
 rb_iseq_new_with_callback(
     const struct rb_iseq_new_with_callback_callback_func * ifunc,
@@ -1081,7 +1210,22 @@ rb_iseq_load_iseq(VALUE fname)
     VALUE iseqv = rb_check_funcall(rb_cISeq, rb_intern("load_iseq"), 1, &fname);
 
     if (!SPECIAL_CONST_P(iseqv) && RBASIC_CLASS(iseqv) == rb_cISeq) {
-        return  iseqw_check(iseqv);
+        return iseqw_check(iseqv);
+    }
+
+    return NULL;
+}
+
+const rb_iseq_t *
+rb_iseq_compile_iseq(VALUE str, VALUE fname)
+{
+    VALUE args[] = {
+        str, fname
+    };
+    VALUE iseqv = rb_check_funcall(rb_cISeq, rb_intern("compile"), 2, args);
+
+    if (!SPECIAL_CONST_P(iseqv) && RBASIC_CLASS(iseqv) == rb_cISeq) {
+        return iseqw_check(iseqv);
     }
 
     return NULL;
@@ -1254,6 +1398,7 @@ rb_iseq_compile_with_option(VALUE src, VALUE file, VALUE realpath, VALUE line, V
         rb_exc_raise(GET_EC()->errinfo);
     }
     else {
+        iseq_new_setup_coverage(file, ast_line_count(ast_value));
         iseq = rb_iseq_new_with_opt(ast_value, name, file, realpath, ln,
                                     NULL, 0, ISEQ_TYPE_TOP, &option,
                                     Qnil);
@@ -1276,38 +1421,58 @@ pm_iseq_compile_with_option(VALUE src, VALUE file, VALUE realpath, VALUE line, V
     ln = NUM2INT(line);
     StringValueCStr(file);
 
-    pm_parse_result_t result = { 0 };
-    pm_options_line_set(&result.options, NUM2INT(line));
+    bool parse_file = false;
+    if (RB_TYPE_P(src, T_FILE)) {
+        parse_file = true;
+        src = rb_io_path(src);
+    }
+    else {
+        src = StringValue(src);
+    }
+
+    pm_parse_result_t result;
+    pm_parse_result_init(&result);
+    pm_options_line_set(result.options, NUM2INT(line));
+    pm_options_scopes_init(result.options, 1);
     result.node.coverage_enabled = 1;
 
     switch (option.frozen_string_literal) {
       case ISEQ_FROZEN_STRING_LITERAL_UNSET:
         break;
       case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
-        pm_options_frozen_string_literal_set(&result.options, false);
+        pm_options_frozen_string_literal_set(result.options, false);
         break;
       case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
-        pm_options_frozen_string_literal_set(&result.options, true);
+        pm_options_frozen_string_literal_set(result.options, true);
         break;
       default:
         rb_bug("pm_iseq_compile_with_option: invalid frozen_string_literal=%d", option.frozen_string_literal);
         break;
     }
 
+    VALUE script_lines;
     VALUE error;
-    if (RB_TYPE_P(src, T_FILE)) {
-        VALUE filepath = rb_io_path(src);
-        error = pm_load_parse_file(&result, filepath);
-        RB_GC_GUARD(filepath);
+
+    if (parse_file) {
+        error = pm_load_parse_file(&result, src, ruby_vm_keep_script_lines ? &script_lines : NULL);
     }
     else {
-        src = StringValue(src);
-        error = pm_parse_string(&result, src, file);
+        error = pm_parse_string(&result, src, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
     }
 
+    RB_GC_GUARD(src);
+
     if (error == Qnil) {
-        iseq = pm_iseq_new_with_opt(&result.node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option);
+        int error_state;
+        iseq_new_setup_coverage(file, (int) (pm_parser_line_offsets(result.node.parser)->size - 1));
+        iseq = pm_iseq_new_with_opt(&result.node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
+
         pm_parse_result_free(&result);
+
+        if (error_state) {
+            RUBY_ASSERT(iseq == NULL);
+            rb_jump_tag(error_state);
+        }
     }
     else {
         pm_parse_result_free(&result);
@@ -1401,8 +1566,8 @@ remove_coverage_i(void *vstart, void *vend, size_t stride, void *data)
 {
     VALUE v = (VALUE)vstart;
     for (; v != (VALUE)vend; v += stride) {
-        void *ptr = asan_poisoned_object_p(v);
-        asan_unpoison_object(v, false);
+        void *ptr = rb_asan_poisoned_object_p(v);
+        rb_asan_unpoison_object(v, false);
 
         if (rb_obj_is_iseq(v)) {
             rb_iseq_t *iseq = (rb_iseq_t *)v;
@@ -1423,9 +1588,9 @@ rb_iseq_remove_coverage_all(void)
 /* define wrapper class methods (RubyVM::InstructionSequence) */
 
 static void
-iseqw_mark(void *ptr)
+iseqw_mark_and_move(void *ptr)
 {
-    rb_gc_mark_movable(*(VALUE *)ptr);
+    rb_gc_mark_and_move((VALUE *)ptr);
 }
 
 static size_t
@@ -1434,20 +1599,13 @@ iseqw_memsize(const void *ptr)
     return rb_iseq_memsize(*(const rb_iseq_t **)ptr);
 }
 
-static void
-iseqw_ref_update(void *ptr)
-{
-    VALUE *vptr = ptr;
-    *vptr = rb_gc_location(*vptr);
-}
-
 static const rb_data_type_t iseqw_data_type = {
     "T_IMEMO/iseq",
     {
-        iseqw_mark,
+        iseqw_mark_and_move,
         RUBY_TYPED_DEFAULT_FREE,
         iseqw_memsize,
-        iseqw_ref_update,
+        iseqw_mark_and_move,
     },
     0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
 };
@@ -1468,8 +1626,8 @@ iseqw_new(const rb_iseq_t *iseq)
         RB_OBJ_WRITE(obj, ptr, iseq);
 
         /* cache a wrapper object */
+        RB_OBJ_SET_FROZEN_SHAREABLE((VALUE)obj);
         RB_OBJ_WRITE((VALUE)iseq, &iseq->wrapper, obj);
-        RB_OBJ_FREEZE((VALUE)iseq);
 
         return obj;
     }
@@ -1531,7 +1689,7 @@ iseqw_s_compile_parser(int argc, VALUE *argv, VALUE self, bool prism)
  *  real path and first line number of the ruby code in +source+ which are
  *  metadata attached to the returned +iseq+.
  *
- *  +file+ is used for `__FILE__` and exception backtrace. +path+ is used for
+ *  +file+ is used for +__FILE__+ and exception backtrace. +path+ is used for
  *  +require_relative+ base. It is recommended these should be the same full
  *  path.
  *
@@ -1559,7 +1717,49 @@ iseqw_s_compile_parser(int argc, VALUE *argv, VALUE self, bool prism)
 static VALUE
 iseqw_s_compile(int argc, VALUE *argv, VALUE self)
 {
-    return iseqw_s_compile_parser(argc, argv, self, *rb_ruby_prism_ptr());
+    return iseqw_s_compile_parser(argc, argv, self, rb_ruby_prism_p());
+}
+
+/*
+ *  call-seq:
+ *     InstructionSequence.compile_parsey(source[, file[, path[, line[, options]]]]) -> iseq
+ *
+ *  Takes +source+, which can be a string of Ruby code, or an open +File+ object.
+ *  that contains Ruby source code. It parses and compiles using parse.y.
+ *
+ *  Optionally takes +file+, +path+, and +line+ which describe the file path,
+ *  real path and first line number of the ruby code in +source+ which are
+ *  metadata attached to the returned +iseq+.
+ *
+ *  +file+ is used for +__FILE__+ and exception backtrace. +path+ is used for
+ *  +require_relative+ base. It is recommended these should be the same full
+ *  path.
+ *
+ *  +options+, which can be +true+, +false+ or a +Hash+, is used to
+ *  modify the default behavior of the Ruby iseq compiler.
+ *
+ *  For details regarding valid compile options see ::compile_option=.
+ *
+ *     RubyVM::InstructionSequence.compile_parsey("a = 1 + 2")
+ *     #=> <RubyVM::InstructionSequence:<compiled>@<compiled>>
+ *
+ *     path = "test.rb"
+ *     RubyVM::InstructionSequence.compile_parsey(File.read(path), path, File.expand_path(path))
+ *     #=> <RubyVM::InstructionSequence:<compiled>@test.rb:1>
+ *
+ *     file = File.open("test.rb")
+ *     RubyVM::InstructionSequence.compile_parsey(file)
+ *     #=> <RubyVM::InstructionSequence:<compiled>@<compiled>:1>
+ *
+ *     path = File.expand_path("test.rb")
+ *     RubyVM::InstructionSequence.compile_parsey(File.read(path), path, path)
+ *     #=> <RubyVM::InstructionSequence:<compiled>@/absolute/path/to/test.rb:1>
+ *
+ */
+static VALUE
+iseqw_s_compile_parsey(int argc, VALUE *argv, VALUE self)
+{
+    return iseqw_s_compile_parser(argc, argv, self, false);
 }
 
 /*
@@ -1573,7 +1773,7 @@ iseqw_s_compile(int argc, VALUE *argv, VALUE self)
  *  real path and first line number of the ruby code in +source+ which are
  *  metadata attached to the returned +iseq+.
  *
- *  +file+ is used for `__FILE__` and exception backtrace. +path+ is used for
+ *  +file+ is used for +__FILE__+ and exception backtrace. +path+ is used for
  *  +require_relative+ base. It is recommended these should be the same full
  *  path.
  *
@@ -1582,19 +1782,19 @@ iseqw_s_compile(int argc, VALUE *argv, VALUE self)
  *
  *  For details regarding valid compile options see ::compile_option=.
  *
- *     RubyVM::InstructionSequence.compile("a = 1 + 2")
+ *     RubyVM::InstructionSequence.compile_prism("a = 1 + 2")
  *     #=> <RubyVM::InstructionSequence:<compiled>@<compiled>>
  *
  *     path = "test.rb"
- *     RubyVM::InstructionSequence.compile(File.read(path), path, File.expand_path(path))
+ *     RubyVM::InstructionSequence.compile_prism(File.read(path), path, File.expand_path(path))
  *     #=> <RubyVM::InstructionSequence:<compiled>@test.rb:1>
  *
  *     file = File.open("test.rb")
- *     RubyVM::InstructionSequence.compile(file)
+ *     RubyVM::InstructionSequence.compile_prism(file)
  *     #=> <RubyVM::InstructionSequence:<compiled>@<compiled>:1>
  *
  *     path = File.expand_path("test.rb")
- *     RubyVM::InstructionSequence.compile(File.read(path), path, path)
+ *     RubyVM::InstructionSequence.compile_prism(File.read(path), path, path)
  *     #=> <RubyVM::InstructionSequence:<compiled>@/absolute/path/to/test.rb:1>
  *
  */
@@ -1604,6 +1804,8 @@ iseqw_s_compile_prism(int argc, VALUE *argv, VALUE self)
     return iseqw_s_compile_parser(argc, argv, self, true);
 }
 
+static VALUE iseqw_s_compile_file_prism(int argc, VALUE *argv, VALUE self);
+
 /*
  *  call-seq:
  *      InstructionSequence.compile_file(file[, options]) -> iseq
@@ -1627,6 +1829,10 @@ iseqw_s_compile_prism(int argc, VALUE *argv, VALUE self)
 static VALUE
 iseqw_s_compile_file(int argc, VALUE *argv, VALUE self)
 {
+    if (rb_ruby_prism_p()) {
+        return iseqw_s_compile_file_prism(argc, argv, self);
+    }
+
     VALUE file, opt = Qnil;
     VALUE parser, f, exc = Qnil, ret;
     rb_ast_t *ast;
@@ -1650,6 +1856,7 @@ iseqw_s_compile_file(int argc, VALUE *argv, VALUE self)
     parser = rb_parser_new();
     rb_parser_set_context(parser, NULL, FALSE);
     ast_value = rb_parser_load_file(parser, file);
+    iseq_new_setup_coverage(file, ast_line_count(ast_value));
     ast = rb_ruby_ast_data_get(ast_value);
     if (!ast->body.root) exc = GET_EC()->errinfo;
 
@@ -1667,6 +1874,7 @@ iseqw_s_compile_file(int argc, VALUE *argv, VALUE self)
                                          1, NULL, 0, ISEQ_TYPE_TOP, &option,
                                          Qnil));
     rb_ast_dispose(ast);
+    RB_GC_GUARD(ast_value);
 
     rb_vm_pop_frame(ec);
     RB_GC_GUARD(v);
@@ -1712,24 +1920,50 @@ iseqw_s_compile_file_prism(int argc, VALUE *argv, VALUE self)
     rb_execution_context_t *ec = GET_EC();
     VALUE v = rb_vm_push_frame_fname(ec, file);
 
-    pm_parse_result_t result = { 0 };
-    result.options.line = 1;
+    make_compile_option(&option, opt);
+
+    pm_parse_result_t result;
+    pm_parse_result_init(&result);
     result.node.coverage_enabled = 1;
 
-    VALUE error = pm_load_parse_file(&result, file);
+    switch (option.frozen_string_literal) {
+      case ISEQ_FROZEN_STRING_LITERAL_UNSET:
+        break;
+      case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
+        pm_options_frozen_string_literal_set(result.options, false);
+        break;
+      case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
+        pm_options_frozen_string_literal_set(result.options, true);
+        break;
+      default:
+        rb_bug("iseqw_s_compile_file_prism: invalid frozen_string_literal=%d", option.frozen_string_literal);
+        break;
+    }
+
+    VALUE script_lines;
+    VALUE error = pm_load_parse_file(&result, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
 
     if (error == Qnil) {
-        make_compile_option(&option, opt);
+        int error_state;
+        iseq_new_setup_coverage(file, (int) (pm_parser_line_offsets(result.node.parser)->size - 1));
+        rb_iseq_t *iseq = pm_iseq_new_with_opt(&result.node, rb_fstring_lit("<main>"),
+                                               file,
+                                               rb_realpath_internal(Qnil, file, 1),
+                                               1, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
 
-        ret = iseqw_new(pm_iseq_new_with_opt(&result.node, rb_fstring_lit("<main>"),
-                                            file,
-                                            rb_realpath_internal(Qnil, file, 1),
-                                            1, NULL, 0, ISEQ_TYPE_TOP, &option));
         pm_parse_result_free(&result);
+
+        if (error_state) {
+            RUBY_ASSERT(iseq == NULL);
+            rb_jump_tag(error_state);
+        }
+
+        ret = iseqw_new(iseq);
         rb_vm_pop_frame(ec);
         RB_GC_GUARD(v);
         return ret;
-    } else {
+    }
+    else {
         pm_parse_result_free(&result);
         rb_vm_pop_frame(ec);
         RB_GC_GUARD(v);
@@ -1824,7 +2058,11 @@ rb_iseqw_to_iseq(VALUE iseqw)
 static VALUE
 iseqw_eval(VALUE self)
 {
-    return rb_iseq_eval(iseqw_check(self));
+    const rb_iseq_t *iseq = iseqw_check(self);
+    if (0 == ISEQ_BODY(iseq)->iseq_size) {
+        rb_raise(rb_eTypeError, "attempt to evaluate dummy InstructionSequence");
+    }
+    return rb_iseq_eval(iseq, rb_current_box());
 }
 
 /*
@@ -2258,15 +2496,22 @@ rb_iseq_event_flags(const rb_iseq_t *iseq, size_t pos)
     }
 }
 
+static void rb_iseq_trace_flag_cleared(const rb_iseq_t *iseq, size_t pos);
+
+// Clear tracing event flags and turn off tracing for a given instruction as needed.
+// This is currently used after updating a one-shot line coverage for the current instruction.
 void
 rb_iseq_clear_event_flags(const rb_iseq_t *iseq, size_t pos, rb_event_flag_t reset)
 {
-    struct iseq_insn_info_entry *entry = (struct iseq_insn_info_entry *)get_insn_info(iseq, pos);
-    if (entry) {
-        entry->events &= ~reset;
-        if (!(entry->events & iseq->aux.exec.global_trace_events)) {
-            void rb_iseq_trace_flag_cleared(const rb_iseq_t *iseq, size_t pos);
-            rb_iseq_trace_flag_cleared(iseq, pos);
+    RB_VM_LOCKING() {
+        rb_vm_barrier();
+
+        struct iseq_insn_info_entry *entry = (struct iseq_insn_info_entry *)get_insn_info(iseq, pos);
+        if (entry) {
+            entry->events &= ~reset;
+            if (!(entry->events & iseq->aux.exec.global_trace_events)) {
+                rb_iseq_trace_flag_cleared(iseq, pos);
+            }
         }
     }
 }
@@ -2449,6 +2694,7 @@ rb_insn_operand_intern(const rb_iseq_t *iseq,
                 CALL_FLAG(KWARG);
                 CALL_FLAG(KW_SPLAT);
                 CALL_FLAG(KW_SPLAT_MUT);
+                CALL_FLAG(FORWARDING);
                 CALL_FLAG(OPT_SEND); /* maybe not reachable */
                 rb_ary_push(ary, rb_ary_join(flags, rb_str_new2("|")));
             }
@@ -2658,6 +2904,7 @@ rb_iseq_disasm_recursive(const rb_iseq_t *iseq, VALUE indent)
         disasm_builtin_attr(str, iseq, LEAF);
         disasm_builtin_attr(str, iseq, SINGLE_NOARG_LEAF);
         disasm_builtin_attr(str, iseq, INLINE_BLOCK);
+        disasm_builtin_attr(str, iseq, C_TRACE);
     }
     rb_str_cat2(str, "\n");
 
@@ -2731,11 +2978,11 @@ rb_iseq_disasm_recursive(const rb_iseq_t *iseq, VALUE indent)
             }
 
             snprintf(argi, sizeof(argi), "%s%s%s%s%s%s",	/* arg, opts, rest, post, kwrest, block */
-                     body->param.lead_num > li ? "Arg" : "",
+                     (body->param.lead_num > li) ? (body->param.flags.ambiguous_param0 ? "AmbiguousArg" : "Arg") : "",
                      opti,
-                     (body->param.flags.has_rest && body->param.rest_start == li) ? "Rest" : "",
+                     (body->param.flags.has_rest && body->param.rest_start == li) ? (body->param.flags.anon_rest ? "AnonRest" : "Rest") : "",
                      (body->param.flags.has_post && body->param.post_start <= li && li < body->param.post_start + body->param.post_num) ? "Post" : "",
-                     (body->param.flags.has_kwrest && keyword->rest_start == li) ? "Kwrest" : "",
+                     (body->param.flags.has_kwrest && keyword->rest_start == li) ? (body->param.flags.anon_kwrest ? "AnonKwrest" : "Kwrest") : "",
                      (body->param.flags.has_block && body->param.block_start == li) ? "Block" : "");
 
             rb_str_cat(str, indent_str, indent_len);
@@ -2783,24 +3030,31 @@ rb_iseq_disasm(const rb_iseq_t *iseq)
 attr_index_t
 rb_estimate_iv_count(VALUE klass, const rb_iseq_t * initialize_iseq)
 {
-    struct rb_id_table * iv_names = rb_id_table_create(0);
+    set_table iv_names = { 0 };
+    set_init_embedded_numtable_with_size(&iv_names, 0);
 
     for (unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
         IVC cache = (IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
 
         if (cache->iv_set_name) {
-            rb_id_table_insert(iv_names, cache->iv_set_name, Qtrue);
+            set_insert(&iv_names, cache->iv_set_name);
         }
     }
 
-    attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
+    size_t count = iv_names.num_entries;
 
     VALUE superclass = rb_class_superclass(klass);
-    count += RCLASS_EXT(superclass)->max_iv_count;
+    if (!NIL_P(superclass)) { // BasicObject doesn't have a superclass
+        count += RCLASS_MAX_IV_COUNT(superclass);
+    }
 
-    rb_id_table_free(iv_names);
+    set_free_embedded_table(&iv_names);
+
+    if (count > (attr_index_t)-1) {
+        return (attr_index_t)-1;
+    }
 
-    return count;
+    return (attr_index_t)count;
 }
 
 /*
@@ -2978,7 +3232,10 @@ iseqw_s_of(VALUE klass, VALUE body)
 {
     const rb_iseq_t *iseq = NULL;
 
-    if (rb_obj_is_proc(body)) {
+    if (rb_frame_info_p(body)) {
+        iseq = rb_get_iseq_from_frame_info(body);
+    }
+    else if (rb_obj_is_proc(body)) {
         iseq = vm_proc_iseq(body);
 
         if (!rb_obj_is_iseq((VALUE)iseq)) {
@@ -3000,10 +3257,10 @@ iseqw_s_of(VALUE klass, VALUE body)
  *     InstructionSequence.disasm(body) -> str
  *     InstructionSequence.disassemble(body) -> str
  *
- *  Takes +body+, a Method or Proc object, and returns a String with the
- *  human readable instructions for +body+.
+ *  Takes +body+, a +Method+ or +Proc+ object, and returns a +String+
+ *  with the human readable instructions for +body+.
  *
- *  For a Method object:
+ *  For a +Method+ object:
  *
  *    # /tmp/method.rb
  *    def hello
@@ -3018,12 +3275,12 @@ iseqw_s_of(VALUE klass, VALUE body)
  *    0000 trace            8                                               (   1)
  *    0002 trace            1                                               (   2)
  *    0004 putself
- *    0005 putstring        "hello, world"
+ *    0005 dupstring        "hello, world"
  *    0007 send             :puts, 1, nil, 8, <ic:0>
  *    0013 trace            16                                              (   3)
  *    0015 leave                                                            (   2)
  *
- *  For a Proc:
+ *  For a +Proc+ object:
  *
  *    # /tmp/proc.rb
  *    p = proc { num = 1 + 2 }
@@ -3083,7 +3340,7 @@ static int
 cdhash_each(VALUE key, VALUE value, VALUE ary)
 {
     rb_ary_push(ary, obj_resurrect(key));
-    rb_ary_push(ary, value);
+    rb_ary_push(ary, INT2FIX(value));
     return ST_CONTINUE;
 }
 
@@ -3142,6 +3399,7 @@ iseq_type_id(enum rb_iseq_type type)
 static VALUE
 iseq_data_to_ary(const rb_iseq_t *iseq)
 {
+    VALUE iseq_value = (VALUE)iseq;
     unsigned int i;
     long l;
     const struct rb_iseq_constant_body *const iseq_body = ISEQ_BODY(iseq);
@@ -3159,7 +3417,7 @@ iseq_data_to_ary(const rb_iseq_t *iseq)
     VALUE exception = rb_ary_new(); /* [[....]] */
     VALUE misc = rb_hash_new();
 
-    static ID insn_syms[VM_INSTRUCTION_SIZE/2]; /* w/o-trace only */
+    static ID insn_syms[VM_BARE_INSTRUCTION_SIZE]; /* w/o-trace only */
     struct st_table *labels_table = st_init_numtable();
     VALUE labels_wrapper = TypedData_Wrap_Struct(0, &label_wrapper, labels_table);
 
@@ -3177,7 +3435,7 @@ iseq_data_to_ary(const rb_iseq_t *iseq)
     for (i=0; i<iseq_body->local_table_size; i++) {
         ID lid = iseq_body->local_table[i];
         if (lid) {
-            if (rb_id2str(lid)) {
+            if (lid != idItImplicit && rb_id2str(lid)) {
                 rb_ary_push(locals, ID2SYM(lid));
             }
             else { /* hidden variable from id_internal() */
@@ -3323,11 +3581,11 @@ iseq_data_to_ary(const rb_iseq_t *iseq)
                 break;
               case TS_CDHASH:
                 {
-                    VALUE hash = *seq;
+                    VALUE cdhash = *seq;
                     VALUE val = rb_ary_new();
                     int i;
 
-                    rb_hash_foreach(hash, cdhash_each, val);
+                    st_foreach(rb_imemo_cdhash_tbl(cdhash), cdhash_each, val);
 
                     for (i=0; i<RARRAY_LEN(val); i+=2) {
                         VALUE pos = FIX2INT(rb_ary_entry(val, i+1));
@@ -3474,6 +3732,9 @@ iseq_data_to_ary(const rb_iseq_t *iseq)
     rb_ary_push(val, params);
     rb_ary_push(val, exception);
     rb_ary_push(val, body);
+
+    RB_GC_GUARD(iseq_value);
+
     return val;
 }
 
@@ -3487,19 +3748,28 @@ rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc)
     ID req, opt, rest, block, key, keyrest;
 #define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
 #define PARAM_ID(i) body->local_table[(i)]
-#define PARAM(i, type) (		      \
-        PARAM_TYPE(type),		      \
-        rb_id2str(PARAM_ID(i)) ?	      \
-        rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
+#define PARAM(i, type) (                                        \
+        PARAM_TYPE(type),                                       \
+        PARAM_ID(i) != idItImplicit && rb_id2str(PARAM_ID(i)) ? \
+        rb_ary_push(a, ID2SYM(PARAM_ID(i))) :                   \
         a)
 
     CONST_ID(req, "req");
     CONST_ID(opt, "opt");
+
+    if (body->param.flags.forwardable) {
+        // [[:rest, :*], [:keyrest, :**], [:block, :&]]
+        CONST_ID(rest, "rest");
+        CONST_ID(keyrest, "keyrest");
+        CONST_ID(block, "block");
+        rb_ary_push(args, rb_ary_new_from_args(2, ID2SYM(rest), ID2SYM(idMULT)));
+        rb_ary_push(args, rb_ary_new_from_args(2, ID2SYM(keyrest), ID2SYM(idPow)));
+        rb_ary_push(args, rb_ary_new_from_args(2, ID2SYM(block), ID2SYM(idAnd)));
+    }
+
     if (is_proc) {
         for (i = 0; i < body->param.lead_num; i++) {
-            PARAM_TYPE(opt);
-            rb_ary_push(a, rb_id2str(PARAM_ID(i)) ? ID2SYM(PARAM_ID(i)) : Qnil);
-            rb_ary_push(args, a);
+            rb_ary_push(args, PARAM(i, opt));
         }
     }
     else {
@@ -3509,11 +3779,7 @@ rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc)
     }
     r = body->param.lead_num + body->param.opt_num;
     for (; i < r; i++) {
-        PARAM_TYPE(opt);
-        if (rb_id2str(PARAM_ID(i))) {
-            rb_ary_push(a, ID2SYM(PARAM_ID(i)));
-        }
-        rb_ary_push(args, a);
+        rb_ary_push(args, PARAM(i, opt));
     }
     if (body->param.flags.has_rest) {
         CONST_ID(rest, "rest");
@@ -3522,9 +3788,7 @@ rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc)
     r = body->param.post_start + body->param.post_num;
     if (is_proc) {
         for (i = body->param.post_start; i < r; i++) {
-            PARAM_TYPE(opt);
-            rb_ary_push(a, rb_id2str(PARAM_ID(i)) ? ID2SYM(PARAM_ID(i)) : Qnil);
-            rb_ary_push(args, a);
+            rb_ary_push(args, PARAM(i, opt));
         }
     }
     else {
@@ -3573,7 +3837,13 @@ rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc)
         }
         rb_ary_push(args, a);
     }
-    if (body->param.flags.has_block) {
+    if (body->param.flags.accepts_no_block) {
+        ID noblock;
+        CONST_ID(noblock, "noblock");
+        PARAM_TYPE(noblock);
+        rb_ary_push(args, a);
+    }
+    else if (body->param.flags.has_block) {
         CONST_ID(block, "block");
         rb_ary_push(args, PARAM(body->param.block_start, block));
     }
@@ -3606,17 +3876,21 @@ rb_iseq_defined_string(enum defined_type type)
     return rb_fstring_cstr(estr);
 }
 
-/* A map from encoded_insn to insn_data: decoded insn number, its len,
- * non-trace version of encoded insn, and trace version. */
-
+// A map from encoded_insn to insn_data: decoded insn number, its len,
+// decoded ZJIT insn number, non-trace version of encoded insn,
+// trace version, and zjit version.
 static st_table *encoded_insn_data;
 typedef struct insn_data_struct {
     int insn;
     int insn_len;
     void *notrace_encoded_insn;
     void *trace_encoded_insn;
+#if USE_ZJIT
+    int zjit_insn;
+    void *zjit_encoded_insn;
+#endif
 } insn_data_t;
-static insn_data_t insn_data[VM_INSTRUCTION_SIZE/2];
+static insn_data_t insn_data[VM_BARE_INSTRUCTION_SIZE];
 
 void
 rb_free_encoded_insn_data(void)
@@ -3624,6 +3898,8 @@ rb_free_encoded_insn_data(void)
     st_free_table(encoded_insn_data);
 }
 
+// Initialize a table to decode bare, trace, and zjit instructions.
+// This function also determines which instructions are used when TracePoint is enabled.
 void
 rb_vm_encoded_insn_data_table_init(void)
 {
@@ -3631,32 +3907,42 @@ rb_vm_encoded_insn_data_table_init(void)
     const void * const *table = rb_vm_get_insns_address_table();
 #define INSN_CODE(insn) ((VALUE)table[insn])
 #else
-#define INSN_CODE(insn) (insn)
+#define INSN_CODE(insn) ((VALUE)(insn))
 #endif
-    st_data_t insn;
-    encoded_insn_data = st_init_numtable_with_size(VM_INSTRUCTION_SIZE / 2);
+    encoded_insn_data = st_init_numtable_with_size(VM_BARE_INSTRUCTION_SIZE);
 
-    for (insn = 0; insn < VM_INSTRUCTION_SIZE/2; insn++) {
-        st_data_t key1 = (st_data_t)INSN_CODE(insn);
-        st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_INSTRUCTION_SIZE/2);
-
-        insn_data[insn].insn = (int)insn;
+    for (int insn = 0; insn < VM_BARE_INSTRUCTION_SIZE; insn++) {
+        insn_data[insn].insn = insn;
         insn_data[insn].insn_len = insn_len(insn);
 
-        if (insn != BIN(opt_invokebuiltin_delegate_leave)) {
-            insn_data[insn].notrace_encoded_insn = (void *) key1;
-            insn_data[insn].trace_encoded_insn = (void *) key2;
-        }
-        else {
-            insn_data[insn].notrace_encoded_insn = (void *) INSN_CODE(BIN(opt_invokebuiltin_delegate));
-            insn_data[insn].trace_encoded_insn = (void *) INSN_CODE(BIN(opt_invokebuiltin_delegate) + VM_INSTRUCTION_SIZE/2);
-        }
+        // When tracing :return events, we convert opt_invokebuiltin_delegate_leave + leave into
+        // opt_invokebuiltin_delegate + trace_leave, presumably because we don't want to fire
+        // :return events before invokebuiltin. https://github.com/ruby/ruby/pull/3256
+        int notrace_insn = (insn != BIN(opt_invokebuiltin_delegate_leave)) ? insn : BIN(opt_invokebuiltin_delegate);
+        insn_data[insn].notrace_encoded_insn = (void *)INSN_CODE(notrace_insn);
+        insn_data[insn].trace_encoded_insn = (void *)INSN_CODE(notrace_insn + VM_BARE_INSTRUCTION_SIZE);
 
+        st_data_t key1 = (st_data_t)INSN_CODE(insn);
+        st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_BARE_INSTRUCTION_SIZE);
         st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
         st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
+
+#if USE_ZJIT
+        int zjit_insn = vm_bare_insn_to_zjit_insn(insn);
+        insn_data[insn].zjit_insn = zjit_insn;
+        insn_data[insn].zjit_encoded_insn = (insn != zjit_insn) ? (void *)INSN_CODE(zjit_insn) : 0;
+
+        if (insn != zjit_insn) {
+            st_data_t key3 = (st_data_t)INSN_CODE(zjit_insn);
+            st_add_direct(encoded_insn_data, key3, (st_data_t)&insn_data[insn]);
+        }
+#endif
     }
 }
 
+// Decode an insn address to an insn. This returns bare instructions
+// even if they're trace/zjit instructions. Use rb_vm_insn_addr2opcode
+// to decode trace/zjit instructions as is.
 int
 rb_vm_insn_addr2insn(const void *addr)
 {
@@ -3671,7 +3957,8 @@ rb_vm_insn_addr2insn(const void *addr)
     rb_bug("rb_vm_insn_addr2insn: invalid insn address: %p", addr);
 }
 
-// Unlike rb_vm_insn_addr2insn, this function can return trace opcode variants.
+// Decode an insn address to an insn. Unlike rb_vm_insn_addr2insn,
+// this function can return trace/zjit opcode variants.
 int
 rb_vm_insn_addr2opcode(const void *addr)
 {
@@ -3682,15 +3969,22 @@ rb_vm_insn_addr2opcode(const void *addr)
         insn_data_t *e = (insn_data_t *)val;
         int opcode = e->insn;
         if (addr == e->trace_encoded_insn) {
-            opcode += VM_INSTRUCTION_SIZE/2;
+            opcode += VM_BARE_INSTRUCTION_SIZE;
         }
+#if USE_ZJIT
+        else if (addr == e->zjit_encoded_insn) {
+            opcode = e->zjit_insn;
+        }
+#endif
         return opcode;
     }
 
     rb_bug("rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
 }
 
-// Decode `ISEQ_BODY(iseq)->iseq_encoded[i]` to an insn.
+// Decode `ISEQ_BODY(iseq)->iseq_encoded[i]` to an insn. This returns
+// bare instructions even if they're trace/zjit instructions. Use
+// rb_vm_insn_addr2opcode to decode trace/zjit instructions as is.
 int
 rb_vm_insn_decode(const VALUE encoded)
 {
@@ -3702,15 +3996,16 @@ rb_vm_insn_decode(const VALUE encoded)
     return insn;
 }
 
+// Turn on or off tracing for a given instruction address
 static inline int
-encoded_iseq_trace_instrument(VALUE *iseq_encoded_insn, rb_event_flag_t turnon, bool remain_current_trace)
+encoded_iseq_trace_instrument(VALUE *iseq_encoded_insn, rb_event_flag_t turnon, bool remain_traced)
 {
     st_data_t key = (st_data_t)*iseq_encoded_insn;
     st_data_t val;
 
     if (st_lookup(encoded_insn_data, key, &val)) {
         insn_data_t *e = (insn_data_t *)val;
-        if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
+        if (remain_traced && key == (st_data_t)e->trace_encoded_insn) {
             turnon = 1;
         }
         *iseq_encoded_insn = (VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
@@ -3720,7 +4015,8 @@ encoded_iseq_trace_instrument(VALUE *iseq_encoded_insn, rb_event_flag_t turnon,
     rb_bug("trace_instrument: invalid insn address: %p", (void *)*iseq_encoded_insn);
 }
 
-void
+// Turn off tracing for an instruction at pos after tracing event flags are cleared
+static void
 rb_iseq_trace_flag_cleared(const rb_iseq_t *iseq, size_t pos)
 {
     const struct rb_iseq_constant_body *const body = ISEQ_BODY(iseq);
@@ -3746,14 +4042,16 @@ add_bmethod_events(rb_event_flag_t events)
 
 // Note, to support call/return events for bmethods, turnon_event can have more events than tpval.
 static int
-iseq_add_local_tracepoint(const rb_iseq_t *iseq, rb_event_flag_t turnon_events, VALUE tpval, unsigned int target_line)
+iseq_add_local_tracepoint(const rb_iseq_t *iseq, rb_event_flag_t turnon_events, VALUE tpval, unsigned int target_line, rb_ractor_t *r)
 {
     unsigned int pc;
     int n = 0;
     const struct rb_iseq_constant_body *const body = ISEQ_BODY(iseq);
     VALUE *iseq_encoded = (VALUE *)body->iseq_encoded;
+    rb_iseq_t *iseq_mut = (rb_iseq_t*)iseq;
 
     VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
+    ASSERT_vm_locking_with_barrier();
 
     for (pc=0; pc<body->iseq_size;) {
         const struct iseq_insn_info_entry *entry = get_insn_info(iseq, pc);
@@ -3775,11 +4073,9 @@ iseq_add_local_tracepoint(const rb_iseq_t *iseq, rb_event_flag_t turnon_events,
     }
 
     if (n > 0) {
-        if (iseq->aux.exec.local_hooks == NULL) {
-            ((rb_iseq_t *)iseq)->aux.exec.local_hooks = RB_ZALLOC(rb_hook_list_t);
-            iseq->aux.exec.local_hooks->is_local = true;
-        }
-        rb_hook_list_connect_tracepoint((VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
+        rb_hook_list_t *hook_list = rb_iseq_local_hooks(iseq, r, true);
+        rb_hook_list_connect_local_tracepoint(hook_list, tpval, target_line);
+        iseq_mut->aux.exec.local_hooks_cnt++;
     }
 
     return n;
@@ -3790,19 +4086,21 @@ struct trace_set_local_events_struct {
     VALUE tpval;
     unsigned int target_line;
     int n;
+    rb_ractor_t *r;
 };
 
 static void
 iseq_add_local_tracepoint_i(const rb_iseq_t *iseq, void *p)
 {
     struct trace_set_local_events_struct *data = (struct trace_set_local_events_struct *)p;
-    data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
+    data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line, data->r);
     iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
 }
 
 int
 rb_iseq_add_local_tracepoint_recursively(const rb_iseq_t *iseq, rb_event_flag_t turnon_events, VALUE tpval, unsigned int target_line, bool target_bmethod)
 {
+    ASSERT_vm_locking_with_barrier();
     struct trace_set_local_events_struct data;
     if (target_bmethod) {
         turnon_events = add_bmethod_events(turnon_events);
@@ -3811,35 +4109,52 @@ rb_iseq_add_local_tracepoint_recursively(const rb_iseq_t *iseq, rb_event_flag_t
     data.tpval = tpval;
     data.target_line = target_line;
     data.n = 0;
+    data.r = GET_RACTOR();
 
     iseq_add_local_tracepoint_i(iseq, (void *)&data);
-    if (0) rb_funcall(Qnil, rb_intern("puts"), 1, rb_iseq_disasm(iseq)); /* for debug */
+    if (0) fprintf(stderr, "Iseq disasm:\n:%s", RSTRING_PTR(rb_iseq_disasm(iseq))); /* for debug */
     return data.n;
 }
 
 static int
-iseq_remove_local_tracepoint(const rb_iseq_t *iseq, VALUE tpval)
+iseq_remove_local_tracepoint(const rb_iseq_t *iseq, VALUE tpval, rb_ractor_t *r)
 {
     int n = 0;
+    unsigned int num_hooks_left;
+    unsigned int pc;
+    const struct rb_iseq_constant_body *body;
+    rb_iseq_t *iseq_mut = (rb_iseq_t*)iseq;
+    rb_hook_list_t *hook_list;
+    VALUE *iseq_encoded;
+    ASSERT_vm_locking_with_barrier();
 
-    if (iseq->aux.exec.local_hooks) {
-        unsigned int pc;
-        const struct rb_iseq_constant_body *const body = ISEQ_BODY(iseq);
-        VALUE *iseq_encoded = (VALUE *)body->iseq_encoded;
+    hook_list = rb_iseq_local_hooks(iseq, r, false);
+
+    if (hook_list) {
         rb_event_flag_t local_events = 0;
 
-        rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
-        local_events = iseq->aux.exec.local_hooks->events;
+        rb_event_flag_t prev_events = hook_list->events;
+        if (rb_hook_list_remove_local_tracepoint(hook_list, tpval)) {
+            RUBY_ASSERT(iseq->aux.exec.local_hooks_cnt > 0);
+            iseq_mut->aux.exec.local_hooks_cnt--;
+            local_events = hook_list->events; // remaining events for this ractor
+            num_hooks_left = rb_hook_list_count(hook_list);
+            if (local_events == 0 && prev_events != 0) {
+                st_delete(rb_ractor_targeted_hooks(r), (st_data_t*)&iseq, NULL);
+                rb_hook_list_free(hook_list);
+            }
 
-        if (local_events == 0) {
-            rb_hook_list_free(iseq->aux.exec.local_hooks);
-            ((rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
-        }
+            if (iseq->aux.exec.local_hooks_cnt == num_hooks_left) {
+                body = ISEQ_BODY(iseq);
+                iseq_encoded = (VALUE *)body->iseq_encoded;
+                local_events = add_bmethod_events(local_events);
+                for (pc = 0; pc<body->iseq_size;) {
+                    rb_event_flag_t pc_events = rb_iseq_event_flags(iseq, pc);
+                    pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events), false);
+                }
+            }
 
-        local_events = add_bmethod_events(local_events);
-        for (pc = 0; pc<body->iseq_size;) {
-            rb_event_flag_t pc_events = rb_iseq_event_flags(iseq, pc);
-            pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events), false);
+            n++;
         }
     }
     return n;
@@ -3848,22 +4163,25 @@ iseq_remove_local_tracepoint(const rb_iseq_t *iseq, VALUE tpval)
 struct trace_clear_local_events_struct {
     VALUE tpval;
     int n;
+    rb_ractor_t *r;
 };
 
 static void
 iseq_remove_local_tracepoint_i(const rb_iseq_t *iseq, void *p)
 {
     struct trace_clear_local_events_struct *data = (struct trace_clear_local_events_struct *)p;
-    data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
+    data->n += iseq_remove_local_tracepoint(iseq, data->tpval, data->r);
     iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
 }
 
 int
-rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval)
+rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval, rb_ractor_t *r)
 {
     struct trace_clear_local_events_struct data;
+    ASSERT_vm_locking_with_barrier();
     data.tpval = tpval;
     data.n = 0;
+    data.r = r;
 
     iseq_remove_local_tracepoint_i(iseq, (void *)&data);
     return data.n;
@@ -3881,11 +4199,14 @@ rb_iseq_trace_set(const rb_iseq_t *iseq, rb_event_flag_t turnon_events)
         return;
     }
     else {
+        // NOTE: this does not need VM barrier if it's a new ISEQ
         unsigned int pc;
         const struct rb_iseq_constant_body *const body = ISEQ_BODY(iseq);
+
         VALUE *iseq_encoded = (VALUE *)body->iseq_encoded;
         rb_event_flag_t enabled_events;
-        rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
+        rb_hook_list_t *local_hooks = rb_iseq_local_hooks(iseq, GET_RACTOR(), false);
+        rb_event_flag_t local_events = local_hooks ? local_hooks->events : 0;
         ((rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
         enabled_events = add_bmethod_events(turnon_events | local_events);
 
@@ -3901,6 +4222,7 @@ void rb_vm_cc_general(const struct rb_callcache *cc);
 static bool
 clear_attr_cc(VALUE v)
 {
+    ASSERT_vm_locking_with_barrier();
     if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((const struct rb_callcache *)v)) {
         rb_vm_cc_general((struct rb_callcache *)v);
         return true;
@@ -3913,6 +4235,7 @@ clear_attr_cc(VALUE v)
 static bool
 clear_bf_cc(VALUE v)
 {
+    ASSERT_vm_locking_with_barrier();
     if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((const struct rb_callcache *)v)) {
         rb_vm_cc_general((struct rb_callcache *)v);
         return true;
@@ -3927,8 +4250,8 @@ clear_attr_ccs_i(void *vstart, void *vend, size_t stride, void *data)
 {
     VALUE v = (VALUE)vstart;
     for (; v != (VALUE)vend; v += stride) {
-        void *ptr = asan_poisoned_object_p(v);
-        asan_unpoison_object(v, false);
+        void *ptr = rb_asan_poisoned_object_p(v);
+        rb_asan_unpoison_object(v, false);
         clear_attr_cc(v);
         asan_poison_object_if(ptr, v);
     }
@@ -3938,7 +4261,10 @@ clear_attr_ccs_i(void *vstart, void *vend, size_t stride, void *data)
 void
 rb_clear_attr_ccs(void)
 {
-    rb_objspace_each_objects(clear_attr_ccs_i, NULL);
+    RB_VM_LOCKING() {
+        rb_vm_barrier();
+        rb_objspace_each_objects(clear_attr_ccs_i, NULL);
+    }
 }
 
 static int
@@ -3946,8 +4272,8 @@ clear_bf_ccs_i(void *vstart, void *vend, size_t stride, void *data)
 {
     VALUE v = (VALUE)vstart;
     for (; v != (VALUE)vend; v += stride) {
-        void *ptr = asan_poisoned_object_p(v);
-        asan_unpoison_object(v, false);
+        void *ptr = rb_asan_poisoned_object_p(v);
+        rb_asan_unpoison_object(v, false);
         clear_bf_cc(v);
         asan_poison_object_if(ptr, v);
     }
@@ -3957,6 +4283,7 @@ clear_bf_ccs_i(void *vstart, void *vend, size_t stride, void *data)
 void
 rb_clear_bf_ccs(void)
 {
+    ASSERT_vm_locking_with_barrier();
     rb_objspace_each_objects(clear_bf_ccs_i, NULL);
 }
 
@@ -3967,8 +4294,8 @@ trace_set_i(void *vstart, void *vend, size_t stride, void *data)
 
     VALUE v = (VALUE)vstart;
     for (; v != (VALUE)vend; v += stride) {
-        void *ptr = asan_poisoned_object_p(v);
-        asan_unpoison_object(v, false);
+        void *ptr = rb_asan_poisoned_object_p(v);
+        rb_asan_unpoison_object(v, false);
 
         if (rb_obj_is_iseq(v)) {
             rb_iseq_trace_set(rb_iseq_check((rb_iseq_t *)v), turnon_events);
@@ -3986,7 +4313,10 @@ trace_set_i(void *vstart, void *vend, size_t stride, void *data)
 void
 rb_iseq_trace_set_all(rb_event_flag_t turnon_events)
 {
-    rb_objspace_each_objects(trace_set_i, &turnon_events);
+    RB_VM_LOCKING() {
+        rb_vm_barrier();
+        rb_objspace_each_objects(trace_set_i, &turnon_events);
+    }
 }
 
 VALUE
@@ -4263,6 +4593,7 @@ Init_ISeq(void)
     (void)iseq_s_load;
 
     rb_define_singleton_method(rb_cISeq, "compile", iseqw_s_compile, -1);
+    rb_define_singleton_method(rb_cISeq, "compile_parsey", iseqw_s_compile_parsey, -1);
     rb_define_singleton_method(rb_cISeq, "compile_prism", iseqw_s_compile_prism, -1);
     rb_define_singleton_method(rb_cISeq, "compile_file_prism", iseqw_s_compile_file_prism, -1);
     rb_define_singleton_method(rb_cISeq, "new", iseqw_s_compile, -1);
diff --git a/iseq.h b/iseq.h
index a0b59c441f..b9bc03c23c 100644
--- a/iseq.h
+++ b/iseq.h
@@ -68,9 +68,11 @@ ISEQ_ORIGINAL_ISEQ(const rb_iseq_t *iseq)
 static inline void
 ISEQ_ORIGINAL_ISEQ_CLEAR(const rb_iseq_t *iseq)
 {
-    void *ptr = ISEQ_BODY(iseq)->variable.original_iseq;
-    ISEQ_BODY(iseq)->variable.original_iseq = NULL;
-    ruby_xfree(ptr);
+    VALUE *ptr = (VALUE *)ISEQ_BODY(iseq)->variable.original_iseq;
+    if (ptr) {
+        ISEQ_BODY(iseq)->variable.original_iseq = NULL;
+        SIZED_FREE_N(ptr, ISEQ_BODY(iseq)->iseq_size);
+    }
 }
 
 static inline VALUE *
@@ -104,6 +106,16 @@ struct iseq_compile_data {
     const VALUE err_info;
     const VALUE catch_table_ary;	/* Array */
 
+    /* Mirror fields from ISEQ_BODY so they are accessible during iseq setup */
+    unsigned int iseq_size;
+    VALUE *iseq_encoded; /* half-encoded iseq (insn addr and operands) */
+    bool is_single_mark_bit; /* identifies whether mark bits are single or a list */
+
+    union {
+        iseq_bits_t * list; /* Find references for GC */
+        iseq_bits_t single;
+    } mark_bits;
+
     /* GC is not needed */
     struct iseq_label_data *start_label;
     struct iseq_label_data *end_label;
@@ -164,7 +176,12 @@ ISEQ_COMPILE_DATA_CLEAR(rb_iseq_t *iseq)
 static inline rb_iseq_t *
 iseq_imemo_alloc(void)
 {
-    return IMEMO_NEW(rb_iseq_t, imemo_iseq, 0);
+    rb_iseq_t *iseq = SHAREABLE_IMEMO_NEW(rb_iseq_t, imemo_iseq, 0);
+
+    // Clear out the whole iseq except for the flags.
+    memset((char *)iseq + sizeof(VALUE), 0, sizeof(rb_iseq_t) - sizeof(VALUE));
+
+    return iseq;
 }
 
 VALUE rb_iseq_ibf_dump(const rb_iseq_t *iseq, VALUE opt);
@@ -174,9 +191,12 @@ const rb_iseq_t *rb_iseq_ibf_load_bytes(const char *cstr, size_t);
 VALUE rb_iseq_ibf_load_extra_data(VALUE str);
 void rb_iseq_init_trace(rb_iseq_t *iseq);
 int rb_iseq_add_local_tracepoint_recursively(const rb_iseq_t *iseq, rb_event_flag_t turnon_events, VALUE tpval, unsigned int target_line, bool target_bmethod);
-int rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval);
+int rb_iseq_remove_local_tracepoint_recursively(const rb_iseq_t *iseq, VALUE tpval, rb_ractor_t *r);
 const rb_iseq_t *rb_iseq_load_iseq(VALUE fname);
+const rb_iseq_t *rb_iseq_compile_iseq(VALUE str, VALUE fname);
 int rb_iseq_opt_frozen_string_literal(void);
+rb_hook_list_t *rb_iseq_local_hooks(const rb_iseq_t *iseq, rb_ractor_t *r, bool create);
+
 
 #if VM_INSN_INFO_TABLE_IMPL == 2
 unsigned int *rb_iseq_insns_info_decode_positions(const struct rb_iseq_constant_body *body);
@@ -193,7 +213,7 @@ VALUE *rb_iseq_original_iseq(const rb_iseq_t *iseq);
 void rb_iseq_build_from_ary(rb_iseq_t *iseq, VALUE misc,
                             VALUE locals, VALUE args,
                             VALUE exception, VALUE body);
-void rb_iseq_mark_and_pin_insn_storage(struct iseq_compile_data_storage *arena);
+void rb_iseq_mark_and_move_insn_storage(struct iseq_compile_data_storage *arena);
 
 VALUE rb_iseq_load(VALUE data, VALUE parent, VALUE opt);
 VALUE rb_iseq_parameters(const rb_iseq_t *iseq, int is_proc);
diff --git a/jit.c b/jit.c
new file mode 100644
index 0000000000..9bd16eab84
--- /dev/null
+++ b/jit.c
@@ -0,0 +1,844 @@
+// Glue code shared between YJIT and ZJIT for use from Rust.
+// For FFI safety and bindgen compatibility reasons, certain types of C
+// functions require wrapping before they can be called from Rust. Those show
+// up here.
+//
+// Code specific to YJIT and ZJIT should go to yjit.c and zjit.c respectively.
+
+#include "internal.h"
+#include "vm_core.h"
+#include "vm_callinfo.h"
+#include "builtin.h"
+#include "insns.inc"
+#include "insns_info.inc"
+#include "iseq.h"
+#include "internal/compile.h"
+#include "internal/gc.h"
+#include "vm_sync.h"
+#include "internal/fixnum.h"
+#include "internal/string.h"
+#include "internal/class.h"
+#include "internal/imemo.h"
+#include "ruby/internal/core/rtypeddata.h"
+#include "zjit.h"
+
+#ifndef _WIN32
+#include <sys/mman.h>
+#endif
+
+enum jit_bindgen_constants {
+    // Field offsets for the RObject struct
+    ROBJECT_OFFSET_AS_HEAP_FIELDS = offsetof(struct RObject, as.heap.fields),
+    ROBJECT_OFFSET_AS_ARY = offsetof(struct RObject, as.ary),
+
+    // Field offset for prime classext's fields_obj from a class pointer
+    RCLASS_OFFSET_PRIME_FIELDS_OBJ = offsetof(struct RClass_and_rb_classext_t, classext.fields_obj),
+
+    // Field offset for fields_obj in T_DATA
+    TDATA_OFFSET_FIELDS_OBJ = offsetof(struct RTypedData, fields_obj),
+
+    // Field offsets for the RString struct
+    RUBY_OFFSET_RSTRING_LEN = offsetof(struct RString, len),
+
+    // Shape constant related to RBasic::flags. (See RBASIC_SET_SHAPE_ID())
+    RB_SHAPE_FLAG_SHIFT = SHAPE_FLAG_SHIFT,
+
+    // Field offsets for rb_execution_context_t
+    RUBY_OFFSET_EC_CFP = offsetof(rb_execution_context_t, cfp),
+    RUBY_OFFSET_EC_INTERRUPT_FLAG = offsetof(rb_execution_context_t, interrupt_flag),
+    RUBY_OFFSET_EC_INTERRUPT_MASK = offsetof(rb_execution_context_t, interrupt_mask),
+    RUBY_OFFSET_EC_THREAD_PTR = offsetof(rb_execution_context_t, thread_ptr),
+    RUBY_OFFSET_EC_RACTOR_ID = offsetof(rb_execution_context_t, ractor_id),
+};
+
+// Manually bound in rust since this is out-of-range of `int`,
+// so this can't be in a `enum`, and we avoid `static const`
+// to avoid allocating storage for the constant.
+const shape_id_t rb_invalid_shape_id = INVALID_SHAPE_ID;
+
+unsigned int
+rb_iseq_encoded_size(const rb_iseq_t *iseq)
+{
+    return iseq->body->iseq_size;
+}
+
+// Get the PC for a given index in an iseq
+VALUE *
+rb_iseq_pc_at_idx(const rb_iseq_t *iseq, uint32_t insn_idx)
+{
+    RUBY_ASSERT_ALWAYS(IMEMO_TYPE_P(iseq, imemo_iseq));
+    RUBY_ASSERT_ALWAYS(insn_idx < iseq->body->iseq_size);
+    VALUE *encoded = iseq->body->iseq_encoded;
+    VALUE *pc = &encoded[insn_idx];
+    return pc;
+}
+
+// Get the opcode given a program counter. Can return trace opcode variants.
+int
+rb_iseq_opcode_at_pc(const rb_iseq_t *iseq, const VALUE *pc)
+{
+    // YJIT should only use iseqs after AST to bytecode compilation.
+    // (Certain non-default interpreter configurations never set ISEQ_TRANSLATED)
+    if (OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE) {
+        RUBY_ASSERT_ALWAYS(FL_TEST_RAW((VALUE)iseq, ISEQ_TRANSLATED));
+    }
+
+    const VALUE at_pc = *pc;
+    return rb_vm_insn_addr2opcode((const void *)at_pc);
+}
+
+// Get the bare opcode given a program counter. Always returns the base
+// instruction, stripping trace/zjit variants.
+int
+rb_iseq_bare_opcode_at_pc(const rb_iseq_t *iseq, const VALUE *pc)
+{
+    if (OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE) {
+        RUBY_ASSERT_ALWAYS(FL_TEST_RAW((VALUE)iseq, ISEQ_TRANSLATED));
+    }
+
+    const VALUE at_pc = *pc;
+    return rb_vm_insn_addr2insn((const void *)at_pc);
+}
+
+unsigned long
+rb_RSTRING_LEN(VALUE str)
+{
+    return RSTRING_LEN(str);
+}
+
+char *
+rb_RSTRING_PTR(VALUE str)
+{
+    return RSTRING_PTR(str);
+}
+
+const char *
+rb_insn_name(VALUE insn)
+{
+    return insn_name(insn);
+}
+
+unsigned int
+rb_vm_ci_argc(const struct rb_callinfo *ci)
+{
+    return vm_ci_argc(ci);
+}
+
+ID
+rb_vm_ci_mid(const struct rb_callinfo *ci)
+{
+    return vm_ci_mid(ci);
+}
+
+unsigned int
+rb_vm_ci_flag(const struct rb_callinfo *ci)
+{
+    return vm_ci_flag(ci);
+}
+
+const struct rb_callinfo_kwarg *
+rb_vm_ci_kwarg(const struct rb_callinfo *ci)
+{
+    return vm_ci_kwarg(ci);
+}
+
+int
+rb_get_cikw_keyword_len(const struct rb_callinfo_kwarg *cikw)
+{
+    return cikw->keyword_len;
+}
+
+VALUE
+rb_get_cikw_keywords_idx(const struct rb_callinfo_kwarg *cikw, int idx)
+{
+    return cikw->keywords[idx];
+}
+
+rb_method_visibility_t
+rb_METHOD_ENTRY_VISI(const rb_callable_method_entry_t *me)
+{
+    return METHOD_ENTRY_VISI(me);
+}
+
+rb_method_type_t
+rb_get_cme_def_type(const rb_callable_method_entry_t *cme)
+{
+    if (UNDEFINED_METHOD_ENTRY_P(cme)) {
+        return VM_METHOD_TYPE_UNDEF;
+    }
+    else {
+        return cme->def->type;
+    }
+}
+
+ID
+rb_get_cme_def_body_attr_id(const rb_callable_method_entry_t *cme)
+{
+    return cme->def->body.attr.id;
+}
+
+enum method_optimized_type
+rb_get_cme_def_body_optimized_type(const rb_callable_method_entry_t *cme)
+{
+    return cme->def->body.optimized.type;
+}
+
+unsigned int
+rb_get_cme_def_body_optimized_index(const rb_callable_method_entry_t *cme)
+{
+    return cme->def->body.optimized.index;
+}
+
+rb_method_cfunc_t *
+rb_get_cme_def_body_cfunc(const rb_callable_method_entry_t *cme)
+{
+    return UNALIGNED_MEMBER_PTR(cme->def, body.cfunc);
+}
+
+uintptr_t
+rb_get_def_method_serial(const rb_method_definition_t *def)
+{
+    return def->method_serial;
+}
+
+ID
+rb_get_def_original_id(const rb_method_definition_t *def)
+{
+    return def->original_id;
+}
+
+VALUE
+rb_get_def_bmethod_proc(rb_method_definition_t *def)
+{
+    RUBY_ASSERT(def->type == VM_METHOD_TYPE_BMETHOD);
+    return def->body.bmethod.proc;
+}
+
+rb_proc_t *
+rb_jit_get_proc_ptr(VALUE procv)
+{
+    rb_proc_t *proc;
+    GetProcPtr(procv, proc);
+    return proc;
+}
+
+VALUE
+rb_optimized_call(VALUE recv, rb_execution_context_t *ec, int argc, VALUE *argv, int kw_splat, VALUE block_handler)
+{
+    rb_proc_t *proc;
+    GetProcPtr(recv, proc);
+    return rb_vm_invoke_proc(ec, proc, argc, argv, kw_splat, block_handler);
+}
+
+unsigned int
+rb_jit_iseq_builtin_attrs(const rb_iseq_t *iseq)
+{
+    return iseq->body->builtin_attrs;
+}
+
+int
+rb_get_mct_argc(const rb_method_cfunc_t *mct)
+{
+    return mct->argc;
+}
+
+void *
+rb_get_mct_func(const rb_method_cfunc_t *mct)
+{
+    return (void*)(uintptr_t)mct->func; // this field is defined as type VALUE (*func)(ANYARGS)
+}
+
+const rb_iseq_t *
+rb_get_def_iseq_ptr(rb_method_definition_t *def)
+{
+    return def_iseq_ptr(def);
+}
+
+const rb_iseq_t *
+rb_get_iseq_body_local_iseq(const rb_iseq_t *iseq)
+{
+    return iseq->body->local_iseq;
+}
+
+const rb_iseq_t *
+rb_get_iseq_body_parent_iseq(const rb_iseq_t *iseq)
+{
+    return iseq->body->parent_iseq;
+}
+
+unsigned int
+rb_get_iseq_body_local_table_size(const rb_iseq_t *iseq)
+{
+    return iseq->body->local_table_size;
+}
+
+VALUE *
+rb_get_iseq_body_iseq_encoded(const rb_iseq_t *iseq)
+{
+    return iseq->body->iseq_encoded;
+}
+
+unsigned
+rb_get_iseq_body_stack_max(const rb_iseq_t *iseq)
+{
+    return iseq->body->stack_max;
+}
+
+enum rb_iseq_type
+rb_get_iseq_body_type(const rb_iseq_t *iseq)
+{
+    return iseq->body->type;
+}
+
+bool
+rb_get_iseq_flags_has_lead(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_lead;
+}
+
+bool
+rb_get_iseq_flags_has_opt(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_opt;
+}
+
+bool
+rb_get_iseq_flags_has_kw(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_kw;
+}
+
+bool
+rb_get_iseq_flags_has_post(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_post;
+}
+
+bool
+rb_get_iseq_flags_has_kwrest(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_kwrest;
+}
+
+bool
+rb_get_iseq_flags_anon_kwrest(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.anon_kwrest;
+}
+
+bool
+rb_get_iseq_flags_has_rest(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_rest;
+}
+
+bool
+rb_get_iseq_flags_ruby2_keywords(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.ruby2_keywords;
+}
+
+bool
+rb_get_iseq_flags_has_block(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.has_block;
+}
+
+bool
+rb_get_iseq_flags_ambiguous_param0(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.ambiguous_param0;
+}
+
+bool
+rb_get_iseq_flags_accepts_no_kwarg(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.accepts_no_kwarg;
+}
+
+bool
+rb_get_iseq_flags_forwardable(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.flags.forwardable;
+}
+
+// This is defined only as a named struct inside rb_iseq_constant_body.
+// By giving it a separate typedef, we make it nameable by rust-bindgen.
+// Bindgen's temp/anon name isn't guaranteed stable.
+typedef struct rb_iseq_param_keyword rb_iseq_param_keyword_struct;
+
+const rb_iseq_param_keyword_struct *
+rb_get_iseq_body_param_keyword(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.keyword;
+}
+
+unsigned
+rb_get_iseq_body_param_size(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.size;
+}
+
+int
+rb_get_iseq_body_param_lead_num(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.lead_num;
+}
+
+int
+rb_get_iseq_body_param_opt_num(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.opt_num;
+}
+
+const VALUE *
+rb_get_iseq_body_param_opt_table(const rb_iseq_t *iseq)
+{
+    return iseq->body->param.opt_table;
+}
+
+struct rb_control_frame_struct *
+rb_get_ec_cfp(const rb_execution_context_t *ec)
+{
+    return ec->cfp;
+}
+
+const rb_iseq_t *
+rb_get_cfp_iseq(struct rb_control_frame_struct *cfp)
+{
+    return CFP_ISEQ(cfp);
+}
+
+VALUE *
+rb_get_cfp_pc(struct rb_control_frame_struct *cfp)
+{
+    return (VALUE*)cfp->pc;
+}
+
+VALUE *
+rb_get_cfp_sp(struct rb_control_frame_struct *cfp)
+{
+    return cfp->sp;
+}
+
+VALUE
+rb_get_cfp_self(struct rb_control_frame_struct *cfp)
+{
+    return cfp->self;
+}
+
+VALUE *
+rb_get_cfp_ep(struct rb_control_frame_struct *cfp)
+{
+    return (VALUE*)cfp->ep;
+}
+
+const VALUE *
+rb_get_cfp_ep_level(struct rb_control_frame_struct *cfp, uint32_t lv)
+{
+    uint32_t i;
+    const VALUE *ep = (VALUE*)cfp->ep;
+    for (i = 0; i < lv; i++) {
+        ep = VM_ENV_PREV_EP(ep);
+    }
+    return ep;
+}
+
+VALUE
+rb_yarv_class_of(VALUE obj)
+{
+    return rb_class_of(obj);
+}
+
+// The FL_TEST() macro
+VALUE
+rb_FL_TEST(VALUE obj, VALUE flags)
+{
+    return RB_FL_TEST(obj, flags);
+}
+
+// The FL_TEST_RAW() macro, normally an internal implementation detail
+VALUE
+rb_FL_TEST_RAW(VALUE obj, VALUE flags)
+{
+    return FL_TEST_RAW(obj, flags);
+}
+
+// The RB_TYPE_P macro
+bool
+rb_RB_TYPE_P(VALUE obj, enum ruby_value_type t)
+{
+    return RB_TYPE_P(obj, t);
+}
+
+long
+rb_RSTRUCT_LEN(VALUE st)
+{
+    return RSTRUCT_LEN(st);
+}
+
+const struct rb_callinfo *
+rb_get_call_data_ci(const struct rb_call_data *cd)
+{
+    return cd->ci;
+}
+
+bool
+rb_BASIC_OP_UNREDEFINED_P(enum ruby_basic_operators bop, uint32_t klass)
+{
+    return BASIC_OP_UNREDEFINED_P(bop, klass);
+}
+
+VALUE
+rb_RCLASS_ORIGIN(VALUE c)
+{
+    return RCLASS_ORIGIN(c);
+}
+
+// For debug builds
+void
+rb_assert_iseq_handle(VALUE handle)
+{
+    RUBY_ASSERT_ALWAYS(IMEMO_TYPE_P(handle, imemo_iseq));
+}
+
+// Assert that we have the VM lock. Relevant mostly for multi ractor situations.
+// The GC takes the lock before calling us, and this asserts that it indeed happens.
+void
+rb_assert_holding_vm_lock(void)
+{
+    ASSERT_vm_locking();
+}
+
+int
+rb_IMEMO_TYPE_P(VALUE imemo, enum imemo_type imemo_type)
+{
+    return IMEMO_TYPE_P(imemo, imemo_type);
+}
+
+void
+rb_assert_cme_handle(VALUE handle)
+{
+    RUBY_ASSERT_ALWAYS(!rb_objspace_garbage_object_p(handle));
+    RUBY_ASSERT_ALWAYS(IMEMO_TYPE_P(handle, imemo_ment));
+}
+
+// YJIT and ZJIT need this function to never allocate and never raise
+VALUE
+rb_yarv_ary_entry_internal(VALUE ary, long offset)
+{
+    return rb_ary_entry_internal(ary, offset);
+}
+
+long
+rb_jit_array_len(VALUE a)
+{
+    return rb_array_len(a);
+}
+
+void
+rb_set_cfp_pc(struct rb_control_frame_struct *cfp, const VALUE *pc)
+{
+    cfp->pc = pc;
+}
+
+void
+rb_set_cfp_sp(struct rb_control_frame_struct *cfp, VALUE *sp)
+{
+    cfp->sp = sp;
+}
+
+bool
+rb_jit_shape_complex_p(shape_id_t shape_id)
+{
+    return rb_shape_complex_p(shape_id);
+}
+
+bool
+rb_jit_multi_ractor_p(void)
+{
+    return rb_multi_ractor_p();
+}
+
+bool
+rb_jit_class_fields_embedded_p(VALUE klass)
+{
+    VALUE fields_obj = RCLASS_EXT_PRIME(klass)->fields_obj;
+    return !fields_obj || !FL_TEST_RAW(fields_obj, OBJ_FIELD_HEAP);
+}
+
+bool
+rb_jit_data_fields_embedded_p(VALUE obj)
+{
+    VALUE fields_obj = RTYPEDDATA(obj)->fields_obj;
+    return !fields_obj || !FL_TEST_RAW(fields_obj, OBJ_FIELD_HEAP);
+}
+
+// Acquire the VM lock and then signal all other Ruby threads (ractors) to
+// contend for the VM lock, putting them to sleep. ZJIT and YJIT use this to
+// evict threads running inside generated code so among other things, it can
+// safely change memory protection of regions housing generated code.
+void
+rb_jit_vm_lock_then_barrier(unsigned int *recursive_lock_level, const char *file, int line)
+{
+    rb_vm_lock_enter(recursive_lock_level, file, line);
+    rb_vm_barrier();
+}
+
+// Release the VM lock. The lock level must point to the same integer used to
+// acquire the lock.
+void
+rb_jit_vm_unlock(unsigned int *recursive_lock_level, const char *file, int line)
+{
+    rb_vm_lock_leave(recursive_lock_level, file, line);
+}
+
+void
+rb_iseq_reset_jit_func(const rb_iseq_t *iseq)
+{
+    RUBY_ASSERT_ALWAYS(IMEMO_TYPE_P(iseq, imemo_iseq));
+    iseq->body->jit_entry = NULL;
+    iseq->body->jit_exception = NULL;
+    // Enable re-compiling this ISEQ. Event when it's invalidated for TracePoint,
+    // we'd like to re-compile ISEQs that haven't been converted to trace_* insns.
+    iseq->body->jit_entry_calls = 0;
+    iseq->body->jit_exception_calls = 0;
+}
+
+// Callback data for rb_jit_for_each_iseq
+struct iseq_callback_data {
+    rb_iseq_callback callback;
+    void *data;
+};
+
+// Heap-walking callback for rb_jit_for_each_iseq
+static int
+for_each_iseq_i(void *vstart, void *vend, size_t stride, void *data)
+{
+    const struct iseq_callback_data *callback_data = (struct iseq_callback_data *)data;
+    VALUE v = (VALUE)vstart;
+    for (; v != (VALUE)vend; v += stride) {
+        void *ptr = rb_asan_poisoned_object_p(v);
+        rb_asan_unpoison_object(v, false);
+
+        if (rb_obj_is_iseq(v)) {
+            rb_iseq_t *iseq = (rb_iseq_t *)v;
+            callback_data->callback(iseq, callback_data->data);
+        }
+
+        if (ptr) {
+            rb_asan_poison_object(v);
+        }
+    }
+    return 0;
+}
+
+uint32_t
+rb_jit_get_page_size(void)
+{
+#if defined(_SC_PAGESIZE)
+    long page_size = sysconf(_SC_PAGESIZE);
+    if (page_size <= 0) rb_bug("jit: failed to get page size");
+
+    // 1 GiB limit. x86 CPUs with PDPE1GB can do this and anything larger is unexpected.
+    // Though our design sort of assume we have fine grained control over memory protection
+    // which require small page sizes.
+    if (page_size > 0x40000000l) rb_bug("jit page size too large");
+
+    return (uint32_t)page_size;
+#else
+#error "JIT supports POSIX only for now"
+#endif
+}
+
+#if defined(MAP_FIXED_NOREPLACE) && defined(_SC_PAGESIZE)
+// Align the current write position to a multiple of bytes
+static uint8_t *
+align_ptr(uint8_t *ptr, uint32_t multiple)
+{
+    // Compute the pointer modulo the given alignment boundary
+    uint32_t rem = ((uint32_t)(uintptr_t)ptr) % multiple;
+
+    // If the pointer is already aligned, stop
+    if (rem == 0)
+        return ptr;
+
+    // Pad the pointer by the necessary amount to align it
+    uint32_t pad = multiple - rem;
+
+    return ptr + pad;
+}
+#endif
+
+// Address space reservation. Memory pages are mapped on an as needed basis.
+// See the Rust mm module for details.
+uint8_t *
+rb_jit_reserve_addr_space(uint32_t mem_size)
+{
+#ifndef _WIN32
+    uint8_t *mem_block;
+
+    // On Linux
+    #if defined(MAP_FIXED_NOREPLACE) && defined(_SC_PAGESIZE)
+        uint32_t const page_size = (uint32_t)sysconf(_SC_PAGESIZE);
+        uint8_t *const cfunc_sample_addr = (void *)(uintptr_t)&rb_jit_reserve_addr_space;
+        uint8_t *const probe_region_end = cfunc_sample_addr + INT32_MAX;
+        // Align the requested address to page size
+        uint8_t *req_addr = align_ptr(cfunc_sample_addr, page_size);
+
+        // Probe for addresses close to this function using MAP_FIXED_NOREPLACE
+        // to improve odds of being in range for 32-bit relative call instructions.
+        do {
+            mem_block = mmap(
+                req_addr,
+                mem_size,
+                PROT_NONE,
+                MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED_NOREPLACE,
+                -1,
+                0
+            );
+
+            // If we succeeded, stop
+            if (mem_block != MAP_FAILED) {
+                ruby_annotate_mmap(mem_block, mem_size, "Ruby:rb_jit_reserve_addr_space");
+                break;
+            }
+
+            // -4MiB. Downwards to probe away from the heap. (On x86/A64 Linux
+            // main_code_addr < heap_addr, and in case we are in a shared
+            // library mapped higher than the heap, downwards is still better
+            // since it's towards the end of the heap rather than the stack.)
+            req_addr -= 4 * 1024 * 1024;
+        } while (req_addr < probe_region_end);
+
+    // On MacOS and other platforms
+    #else
+        // Try to map a chunk of memory as executable
+        mem_block = mmap(
+            (void *)rb_jit_reserve_addr_space,
+            mem_size,
+            PROT_NONE,
+            MAP_PRIVATE | MAP_ANONYMOUS,
+            -1,
+            0
+        );
+    #endif
+
+    // Fallback
+    if (mem_block == MAP_FAILED) {
+        // Try again without the address hint (e.g., valgrind)
+        mem_block = mmap(
+            NULL,
+            mem_size,
+            PROT_NONE,
+            MAP_PRIVATE | MAP_ANONYMOUS,
+            -1,
+            0
+        );
+
+        if (mem_block != MAP_FAILED) {
+            ruby_annotate_mmap(mem_block, mem_size, "Ruby:rb_jit_reserve_addr_space:fallback");
+        }
+    }
+
+    // Check that the memory mapping was successful
+    if (mem_block == MAP_FAILED) {
+        perror("ruby: jit: mmap:");
+        if(errno == ENOMEM) {
+            // No crash report if it's only insufficient memory
+            exit(EXIT_FAILURE);
+        }
+        rb_bug("mmap failed");
+    }
+
+    return mem_block;
+#else
+    // Windows not supported for now
+    return NULL;
+#endif
+}
+
+// Walk all ISEQs in the heap and invoke the callback - shared between YJIT and ZJIT
+void
+rb_jit_for_each_iseq(rb_iseq_callback callback, void *data)
+{
+    struct iseq_callback_data callback_data = { .callback = callback, .data = data };
+    rb_objspace_each_objects(for_each_iseq_i, (void *)&callback_data);
+}
+
+bool
+rb_jit_mark_writable(void *mem_block, uint32_t mem_size)
+{
+    return mprotect(mem_block, mem_size, PROT_READ | PROT_WRITE) == 0;
+}
+
+void
+rb_jit_mark_executable(void *mem_block, uint32_t mem_size)
+{
+    // Do not call mprotect when mem_size is zero. Some platforms may return
+    // an error for it. https://github.com/Shopify/ruby/issues/450
+    if (mem_size == 0) {
+        return;
+    }
+    if (mprotect(mem_block, mem_size, PROT_READ | PROT_EXEC)) {
+        rb_bug("Couldn't make JIT page (%p, %lu bytes) executable, errno: %s",
+            mem_block, (unsigned long)mem_size, strerror(errno));
+    }
+}
+
+// Free the specified memory block.
+bool
+rb_jit_mark_unused(void *mem_block, uint32_t mem_size)
+{
+    // On Linux, you need to use madvise MADV_DONTNEED to free memory.
+    // We might not need to call this on macOS, but it's not really documented.
+    // We generally prefer to do the same thing on both to ease testing too.
+    madvise(mem_block, mem_size, MADV_DONTNEED);
+
+    // On macOS, mprotect PROT_NONE seems to reduce RSS.
+    // We also call this on Linux to avoid executing unused pages.
+    return mprotect(mem_block, mem_size, PROT_NONE) == 0;
+}
+
+// Invalidate icache for arm64.
+// `start` is inclusive and `end` is exclusive.
+void
+rb_jit_icache_invalidate(void *start, void *end)
+{
+    // Clear/invalidate the instruction cache. Compiles to nothing on x86_64
+    // but required on ARM before running freshly written code.
+    // On Darwin it's the same as calling sys_icache_invalidate().
+#ifdef __GNUC__
+    __builtin___clear_cache(start, end);
+#elif defined(__aarch64__)
+#error No instruction cache clear available with this compiler on Aarch64!
+#endif
+}
+
+VALUE
+rb_jit_fix_mod_fix(VALUE recv, VALUE obj)
+{
+    return rb_fix_mod_fix(recv, obj);
+}
+
+VALUE
+rb_jit_fix_div_fix(VALUE recv, VALUE obj)
+{
+    return rb_fix_div_fix(recv, obj);
+}
+
+// YJIT/ZJIT need this function to never allocate and never raise
+VALUE
+rb_yarv_str_eql_internal(VALUE str1, VALUE str2)
+{
+    // We wrap this since it's static inline
+    return rb_str_eql_internal(str1, str2);
+}
+
+void rb_jit_str_concat_codepoint(VALUE str, VALUE codepoint);
+
+attr_index_t
+rb_jit_shape_capacity(shape_id_t shape_id)
+{
+    return RSHAPE_CAPACITY(shape_id);
+}
diff --git a/jit/Cargo.toml b/jit/Cargo.toml
new file mode 100644
index 0000000000..530fe3674b
--- /dev/null
+++ b/jit/Cargo.toml
@@ -0,0 +1,6 @@
+[package]
+name = "jit"
+version = "0.1.0"
+edition = "2024"
+
+[dependencies]
diff --git a/jit/src/lib.rs b/jit/src/lib.rs
new file mode 100644
index 0000000000..c0f043131e
--- /dev/null
+++ b/jit/src/lib.rs
@@ -0,0 +1,38 @@
+//! Shared code between YJIT and ZJIT.
+#![warn(unsafe_op_in_unsafe_fn)] // Adopt 2024 edition default when targeting 2021 editions
+
+use std::sync::atomic::{AtomicUsize, Ordering};
+use std::alloc::{GlobalAlloc, Layout, System};
+
+#[global_allocator]
+pub static GLOBAL_ALLOCATOR: StatsAlloc = StatsAlloc { alloc_size: AtomicUsize::new(0) };
+
+pub struct StatsAlloc {
+    pub alloc_size: AtomicUsize,
+}
+
+unsafe impl GlobalAlloc for StatsAlloc {
+    unsafe fn alloc(&self, layout: Layout) -> *mut u8 {
+        self.alloc_size.fetch_add(layout.size(), Ordering::SeqCst);
+        unsafe { System.alloc(layout) }
+    }
+
+    unsafe fn dealloc(&self, ptr: *mut u8, layout: Layout) {
+        self.alloc_size.fetch_sub(layout.size(), Ordering::SeqCst);
+        unsafe { System.dealloc(ptr, layout) }
+    }
+
+    unsafe fn alloc_zeroed(&self, layout: Layout) -> *mut u8 {
+        self.alloc_size.fetch_add(layout.size(), Ordering::SeqCst);
+        unsafe { System.alloc_zeroed(layout) }
+    }
+
+    unsafe fn realloc(&self, ptr: *mut u8, layout: Layout, new_size: usize) -> *mut u8 {
+        if new_size > layout.size() {
+            self.alloc_size.fetch_add(new_size - layout.size(), Ordering::SeqCst);
+        } else if new_size < layout.size() {
+            self.alloc_size.fetch_sub(layout.size() - new_size, Ordering::SeqCst);
+        }
+        unsafe { System.realloc(ptr, layout, new_size) }
+    }
+}
diff --git a/jit_hook.rb b/jit_hook.rb
new file mode 100644
index 0000000000..c605d6e26d
--- /dev/null
+++ b/jit_hook.rb
@@ -0,0 +1,12 @@
+class Module
+  # Internal helper for built-in initializations to define methods only when JIT is enabled.
+  # This method is removed in jit_undef.rb.
+  private def with_jit(&block) # :nodoc:
+    if defined?(RubyVM::ZJIT)
+      RubyVM::ZJIT.send(:add_jit_hook, block)
+    end
+    if defined?(RubyVM::YJIT)
+      RubyVM::YJIT.send(:add_jit_hook, block)
+    end
+  end
+end
diff --git a/jit_undef.rb b/jit_undef.rb
new file mode 100644
index 0000000000..0e855fe7a2
--- /dev/null
+++ b/jit_undef.rb
@@ -0,0 +1,4 @@
+# Remove the helper defined in jit_hook.rb
+class Module
+  undef :with_jit
+end
diff --git a/kernel.rb b/kernel.rb
index 541d0cfd9d..dc5cea1515 100644
--- a/kernel.rb
+++ b/kernel.rb
@@ -17,7 +17,7 @@ module Kernel
   #
   def class
     Primitive.attr! :leaf
-    Primitive.cexpr! 'rb_obj_class(self)'
+    Primitive.cexpr! 'rb_obj_class_must(self)'
   end
 
   #
@@ -40,7 +40,7 @@ module Kernel
   #     s1.inspect          #=> "#<Klass:0x401b3a38 @str=\"Hi\">"
   #     s2.inspect          #=> "#<Klass:0x401b3998 @str=\"Hi\">"
   #
-  #  This method may have class-specific behavior.  If so, that
+  #  This method may have class-specific behavior. If so, that
   #  behavior will be documented under the #+initialize_copy+ method of
   #  the class.
   #
@@ -73,7 +73,7 @@ module Kernel
   #  call-seq:
   #     obj.tap {|x| block }    -> obj
   #
-  #  Yields self to the block, and then returns self.
+  #  Yields self to the block and then returns self.
   #  The primary purpose of this method is to "tap into" a method chain,
   #  in order to perform operations on intermediate results within the chain.
   #
@@ -100,33 +100,24 @@ module Kernel
   #
   #     3.next.then {|x| x**x }.to_s             #=> "256"
   #
-  #  Good usage for +then+ is value piping in method chains:
+  #  A good use of +then+ is value piping in method chains:
   #
   #     require 'open-uri'
   #     require 'json'
   #
-  #     construct_url(arguments).
-  #       then {|url| URI(url).read }.
-  #       then {|response| JSON.parse(response) }
+  #     construct_url(arguments)
+  #       .then {|url| URI(url).read }
+  #       .then {|response| JSON.parse(response) }
   #
-  #  When called without block, the method returns +Enumerator+,
+  #  When called without a block, the method returns an +Enumerator+,
   #  which can be used, for example, for conditional
   #  circuit-breaking:
   #
-  #     # meets condition, no-op
+  #     # Meets condition, no-op
   #     1.then.detect(&:odd?)            # => 1
-  #     # does not meet condition, drop value
+  #     # Does not meet condition, drop value
   #     2.then.detect(&:odd?)            # => nil
   #
-  #  Good usage for +then+ is value piping in method chains:
-  #
-  #     require 'open-uri'
-  #     require 'json'
-  #
-  #     construct_url(arguments).
-  #       then {|url| URI(url).read }.
-  #       then {|response| JSON.parse(response) }
-  #
   def then
     Primitive.attr! :inline_block
     unless defined?(yield)
@@ -135,21 +126,7 @@ module Kernel
     yield(self)
   end
 
-  #
-  #  call-seq:
-  #     obj.yield_self {|x| block }    -> an_object
-  #
-  #  Yields self to the block and returns the result of the block.
-  #
-  #     "my string".yield_self {|s| s.upcase }   #=> "MY STRING"
-  #
-  def yield_self
-    Primitive.attr! :inline_block
-    unless defined?(yield)
-      return Primitive.cexpr! 'SIZED_ENUMERATOR(self, 0, 0, rb_obj_size)'
-    end
-    yield(self)
-  end
+  alias yield_self then
 
   module_function
 
@@ -164,11 +141,12 @@ module Kernel
   #    loop do
   #      print "Input: "
   #      line = gets
+  #      # break if q, Q is entered or EOF signal (Ctrl-D on Unix, Ctrl-Z on windows) is sent
   #      break if !line or line =~ /^q/i
   #      # ...
   #    end
   #
-  # StopIteration raised in the block breaks the loop.  In this case,
+  # A StopIteration raised in the block breaks the loop. In this case,
   # loop returns the "result" value stored in the exception.
   #
   #    enum = Enumerator.new { |y|
@@ -201,10 +179,10 @@ module Kernel
   #
   #  Returns <i>arg</i> converted to a float. Numeric types are
   #  converted directly, and with exception to String and
-  #  <code>nil</code> the rest are converted using
-  #  <i>arg</i><code>.to_f</code>.  Converting a String with invalid
-  #  characters will result in a ArgumentError.  Converting
-  #  <code>nil</code> generates a TypeError.  Exceptions can be
+  #  <code>nil</code>, the rest are converted using
+  #  <i>arg</i><code>.to_f</code>. Converting a String with invalid
+  #  characters will result in an ArgumentError. Converting
+  #  <code>nil</code> generates a TypeError. Exceptions can be
   #  suppressed by passing <code>exception: false</code>.
   #
   #     Float(1)                 #=> 1.0
@@ -233,22 +211,22 @@ module Kernel
   # With a non-zero +base+, +object+ must be a string or convertible
   # to a string.
   #
-  # ==== numeric objects
+  # ==== \Numeric objects
   #
-  # With integer argument +object+ given, returns +object+:
+  # With an integer argument +object+ given, returns +object+:
   #
   #   Integer(1)                # => 1
   #   Integer(-1)               # => -1
   #
-  # With floating-point argument +object+ given,
+  # With a floating-point argument +object+ given,
   # returns +object+ truncated to an integer:
   #
   #   Integer(1.9)              # => 1  # Rounds toward zero.
   #   Integer(-1.9)             # => -1 # Rounds toward zero.
   #
-  # ==== string objects
+  # ==== \String objects
   #
-  # With string argument +object+ and zero +base+ given,
+  # With a string argument +object+ and zero +base+ given,
   # returns +object+ converted to an integer in base 10:
   #
   #   Integer('100')    # => 100
@@ -258,7 +236,7 @@ module Kernel
   # to specify the actual base (radix indicator):
   #
   #   Integer('0100')  # => 64  # Leading '0' specifies base 8.
-  #   Integer('0b100') # => 4   # Leading '0b', specifies base 2.
+  #   Integer('0b100') # => 4   # Leading '0b' specifies base 2.
   #   Integer('0x100') # => 256 # Leading '0x' specifies base 16.
   #
   # With a positive +base+ (in range 2..36) given, returns +object+
@@ -269,8 +247,8 @@ module Kernel
   #   Integer('-100', 16) # => -256
   #
   # With a negative +base+ (in range -36..-2) given, returns +object+
-  # converted to an integer in the radix indicator if exists or
-  # +-base+:
+  # converted to the radix indicator if it exists or
+  # +base+:
   #
   #   Integer('0x100', -2)   # => 256
   #   Integer('100', -2)     # => 4
@@ -279,7 +257,7 @@ module Kernel
   #   Integer('0o100', -10)  # => 64
   #   Integer('100', -10)    # => 100
   #
-  # +base+ -1 is equal the -10 case.
+  # +base+ -1 is equivalent to the -10 case.
   #
   # When converting strings, surrounding whitespace and embedded underscores
   # are allowed and ignored:
@@ -287,7 +265,7 @@ module Kernel
   #   Integer(' 100 ')      # => 100
   #   Integer('-1_0_0', 16) # => -256
   #
-  # ==== other classes
+  # ==== Other classes
   #
   # Examples with +object+ of various other classes:
   #
@@ -295,22 +273,22 @@ module Kernel
   #   Integer(Complex(2, 0))   # => 2  # Imaginary part must be zero.
   #   Integer(Time.now)        # => 1650974042
   #
-  # ==== keywords
+  # ==== Keywords
   #
-  # With optional keyword argument +exception+ given as +true+ (the default):
+  # With the optional keyword argument +exception+ given as +true+ (the default):
   #
   # - Raises TypeError if +object+ does not respond to +to_int+ or +to_i+.
   # - Raises TypeError if +object+ is +nil+.
-  # - Raise ArgumentError if +object+ is an invalid string.
+  # - Raises ArgumentError if +object+ is an invalid string.
   #
   # With +exception+ given as +false+, an exception of any kind is suppressed
   # and +nil+ is returned.
-
+  #
   def Integer(arg, base = 0, exception: true)
     if Primitive.mandatory_only?
       Primitive.rb_f_integer1(arg)
     else
-      Primitive.rb_f_integer(arg, base, exception);
+      Primitive.rb_f_integer(arg, base, exception)
     end
   end
 end
diff --git a/lex.c.blt b/lex.c.blt
index 85727ed00f..de0719b014 100644
--- a/lex.c.blt
+++ b/lex.c.blt
@@ -1,5 +1,5 @@
 /* ANSI-C code produced by gperf version 3.1 */
-/* Command-line: gperf -C -P -p -j1 -i 1 -g -o -t -N rb_reserved_word -k'1,3,$' defs/keywords  */
+/* Command-line: gperf -C -L ANSI-C -P -p -j1 -i 1 -g -o -t -N rb_reserved_word -k'1,3,$' defs/keywords  */
 
 #if !((' ' == 32) && ('!' == 33) && ('"' == 34) && ('#' == 35) \
       && ('%' == 37) && ('&' == 38) && ('\'' == 39) && ('(' == 40) \
@@ -28,7 +28,6 @@
 #error "gperf generated tables don't work with this execution character set. Please report a bug to <bug-gperf@gnu.org>."
 #endif
 
-#define gperf_offsetof(s, n) (short)offsetof(struct s##_t, s##_str##n)
 #line 1 "defs/keywords"
 
 struct kwtable {short name, id[2], state;};
@@ -196,88 +195,88 @@ rb_reserved_word (register const char *str, register size_t len)
     {
       {-1}, {-1}, {-1}, {-1}, {-1}, {-1}, {-1}, {-1},
 #line 19 "defs/keywords"
-      {gperf_offsetof(stringpool, 8), {keyword_break, keyword_break}, EXPR_MID},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str8, {keyword_break, keyword_break}, EXPR_MID},
 #line 25 "defs/keywords"
-      {gperf_offsetof(stringpool, 9), {keyword_else, keyword_else}, EXPR_BEG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str9, {keyword_else, keyword_else}, EXPR_BEG},
 #line 35 "defs/keywords"
-      {gperf_offsetof(stringpool, 10), {keyword_nil, keyword_nil}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str10, {keyword_nil, keyword_nil}, EXPR_END},
 #line 28 "defs/keywords"
-      {gperf_offsetof(stringpool, 11), {keyword_ensure, keyword_ensure}, EXPR_BEG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str11, {keyword_ensure, keyword_ensure}, EXPR_BEG},
 #line 27 "defs/keywords"
-      {gperf_offsetof(stringpool, 12), {keyword_end, keyword_end}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str12, {keyword_end, keyword_end}, EXPR_END},
 #line 44 "defs/keywords"
-      {gperf_offsetof(stringpool, 13), {keyword_then, keyword_then}, EXPR_BEG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str13, {keyword_then, keyword_then}, EXPR_BEG},
 #line 36 "defs/keywords"
-      {gperf_offsetof(stringpool, 14), {keyword_not, keyword_not}, EXPR_ARG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str14, {keyword_not, keyword_not}, EXPR_ARG},
 #line 29 "defs/keywords"
-      {gperf_offsetof(stringpool, 15), {keyword_false, keyword_false}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str15, {keyword_false, keyword_false}, EXPR_END},
 #line 42 "defs/keywords"
-      {gperf_offsetof(stringpool, 16), {keyword_self, keyword_self}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str16, {keyword_self, keyword_self}, EXPR_END},
 #line 26 "defs/keywords"
-      {gperf_offsetof(stringpool, 17), {keyword_elsif, keyword_elsif}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str17, {keyword_elsif, keyword_elsif}, EXPR_VALUE},
 #line 39 "defs/keywords"
-      {gperf_offsetof(stringpool, 18), {keyword_rescue, modifier_rescue}, EXPR_MID},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str18, {keyword_rescue, modifier_rescue}, EXPR_MID},
 #line 45 "defs/keywords"
-      {gperf_offsetof(stringpool, 19), {keyword_true, keyword_true}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str19, {keyword_true, keyword_true}, EXPR_END},
 #line 48 "defs/keywords"
-      {gperf_offsetof(stringpool, 20), {keyword_until, modifier_until}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str20, {keyword_until, modifier_until}, EXPR_VALUE},
 #line 47 "defs/keywords"
-      {gperf_offsetof(stringpool, 21), {keyword_unless, modifier_unless}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str21, {keyword_unless, modifier_unless}, EXPR_VALUE},
 #line 41 "defs/keywords"
-      {gperf_offsetof(stringpool, 22), {keyword_return, keyword_return}, EXPR_MID},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str22, {keyword_return, keyword_return}, EXPR_MID},
 #line 22 "defs/keywords"
-      {gperf_offsetof(stringpool, 23), {keyword_def, keyword_def}, EXPR_FNAME},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str23, {keyword_def, keyword_def}, EXPR_FNAME},
 #line 17 "defs/keywords"
-      {gperf_offsetof(stringpool, 24), {keyword_and, keyword_and}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str24, {keyword_and, keyword_and}, EXPR_VALUE},
 #line 24 "defs/keywords"
-      {gperf_offsetof(stringpool, 25), {keyword_do, keyword_do}, EXPR_BEG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str25, {keyword_do, keyword_do}, EXPR_BEG},
 #line 51 "defs/keywords"
-      {gperf_offsetof(stringpool, 26), {keyword_yield, keyword_yield}, EXPR_ARG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str26, {keyword_yield, keyword_yield}, EXPR_ARG},
 #line 30 "defs/keywords"
-      {gperf_offsetof(stringpool, 27), {keyword_for, keyword_for}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str27, {keyword_for, keyword_for}, EXPR_VALUE},
 #line 46 "defs/keywords"
-      {gperf_offsetof(stringpool, 28), {keyword_undef, keyword_undef}, EXPR_FNAME|EXPR_FITEM},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str28, {keyword_undef, keyword_undef}, EXPR_FNAME|EXPR_FITEM},
 #line 37 "defs/keywords"
-      {gperf_offsetof(stringpool, 29), {keyword_or, keyword_or}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str29, {keyword_or, keyword_or}, EXPR_VALUE},
 #line 32 "defs/keywords"
-      {gperf_offsetof(stringpool, 30), {keyword_in, keyword_in}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str30, {keyword_in, keyword_in}, EXPR_VALUE},
 #line 49 "defs/keywords"
-      {gperf_offsetof(stringpool, 31), {keyword_when, keyword_when}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str31, {keyword_when, keyword_when}, EXPR_VALUE},
 #line 40 "defs/keywords"
-      {gperf_offsetof(stringpool, 32), {keyword_retry, keyword_retry}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str32, {keyword_retry, keyword_retry}, EXPR_END},
 #line 31 "defs/keywords"
-      {gperf_offsetof(stringpool, 33), {keyword_if, modifier_if}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str33, {keyword_if, modifier_if}, EXPR_VALUE},
 #line 20 "defs/keywords"
-      {gperf_offsetof(stringpool, 34), {keyword_case, keyword_case}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str34, {keyword_case, keyword_case}, EXPR_VALUE},
 #line 38 "defs/keywords"
-      {gperf_offsetof(stringpool, 35), {keyword_redo, keyword_redo}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str35, {keyword_redo, keyword_redo}, EXPR_END},
 #line 34 "defs/keywords"
-      {gperf_offsetof(stringpool, 36), {keyword_next, keyword_next}, EXPR_MID},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str36, {keyword_next, keyword_next}, EXPR_MID},
 #line 43 "defs/keywords"
-      {gperf_offsetof(stringpool, 37), {keyword_super, keyword_super}, EXPR_ARG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str37, {keyword_super, keyword_super}, EXPR_ARG},
 #line 33 "defs/keywords"
-      {gperf_offsetof(stringpool, 38), {keyword_module, keyword_module}, EXPR_VALUE},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str38, {keyword_module, keyword_module}, EXPR_VALUE},
 #line 18 "defs/keywords"
-      {gperf_offsetof(stringpool, 39), {keyword_begin, keyword_begin}, EXPR_BEG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str39, {keyword_begin, keyword_begin}, EXPR_BEG},
 #line 12 "defs/keywords"
-      {gperf_offsetof(stringpool, 40), {keyword__LINE__, keyword__LINE__}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str40, {keyword__LINE__, keyword__LINE__}, EXPR_END},
 #line 13 "defs/keywords"
-      {gperf_offsetof(stringpool, 41), {keyword__FILE__, keyword__FILE__}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str41, {keyword__FILE__, keyword__FILE__}, EXPR_END},
 #line 11 "defs/keywords"
-      {gperf_offsetof(stringpool, 42), {keyword__ENCODING__, keyword__ENCODING__}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str42, {keyword__ENCODING__, keyword__ENCODING__}, EXPR_END},
 #line 15 "defs/keywords"
-      {gperf_offsetof(stringpool, 43), {keyword_END, keyword_END}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str43, {keyword_END, keyword_END}, EXPR_END},
 #line 16 "defs/keywords"
-      {gperf_offsetof(stringpool, 44), {keyword_alias, keyword_alias}, EXPR_FNAME|EXPR_FITEM},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str44, {keyword_alias, keyword_alias}, EXPR_FNAME|EXPR_FITEM},
 #line 14 "defs/keywords"
-      {gperf_offsetof(stringpool, 45), {keyword_BEGIN, keyword_BEGIN}, EXPR_END},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str45, {keyword_BEGIN, keyword_BEGIN}, EXPR_END},
 #line 23 "defs/keywords"
-      {gperf_offsetof(stringpool, 46), {keyword_defined, keyword_defined}, EXPR_ARG},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str46, {keyword_defined, keyword_defined}, EXPR_ARG},
 #line 21 "defs/keywords"
-      {gperf_offsetof(stringpool, 47), {keyword_class, keyword_class}, EXPR_CLASS},
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str47, {keyword_class, keyword_class}, EXPR_CLASS},
       {-1}, {-1},
 #line 50 "defs/keywords"
-      {gperf_offsetof(stringpool, 50), {keyword_while, modifier_while}, EXPR_VALUE}
+      {(int)(size_t)&((struct stringpool_t *)0)->stringpool_str50, {keyword_while, modifier_while}, EXPR_VALUE}
     };
 
   if (len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH)
diff --git a/lib/English.gemspec b/lib/English.gemspec
index 5f4eb420c2..9c09555ca1 100644
--- a/lib/English.gemspec
+++ b/lib/English.gemspec
@@ -1,6 +1,6 @@
 Gem::Specification.new do |spec|
   spec.name          = "english"
-  spec.version       = "0.8.0"
+  spec.version       = "0.8.1"
   spec.authors       = ["Yukihiro Matsumoto"]
   spec.email         = ["matz@ruby-lang.org"]
 
@@ -15,8 +15,13 @@ Gem::Specification.new do |spec|
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  excludes = %W[
+    :^/test :^/spec :^/feature :^/bin
+    :^/Rakefile :^/Gemfile\* :^/.git*
+    :^/#{File.basename(__FILE__)}
+  ]
+  spec.files = IO.popen(%W[git ls-files -z --] + excludes, err: IO::NULL) do |f|
+    f.readlines("\x0", chomp: true)
   end
   spec.require_paths = ["lib"]
 end
diff --git a/lib/English.rb b/lib/English.rb
index 03fe721991..bf7896dcd6 100644
--- a/lib/English.rb
+++ b/lib/English.rb
@@ -9,7 +9,7 @@
 #      "waterbuffalo" =~ /buff/
 #      print $', $$, "\n"
 #
-#  With English:
+#  With 'English':
 #
 #      require "English"
 #
@@ -20,30 +20,30 @@
 #  Below is a full list of descriptive aliases and their associated global
 #  variable:
 #
-#  $ERROR_INFO::              $!
-#  $ERROR_POSITION::          $@
-#  $FS::                      $;
-#  $FIELD_SEPARATOR::         $;
-#  $OFS::                     $,
-#  $OUTPUT_FIELD_SEPARATOR::  $,
-#  $RS::                      $/
-#  $INPUT_RECORD_SEPARATOR::  $/
-#  $ORS::                     $\
-#  $OUTPUT_RECORD_SEPARATOR:: $\
-#  $INPUT_LINE_NUMBER::       $.
-#  $NR::                      $.
-#  $LAST_READ_LINE::          $_
-#  $DEFAULT_OUTPUT::          $>
-#  $DEFAULT_INPUT::           $<
-#  $PID::                     $$
-#  $PROCESS_ID::              $$
-#  $CHILD_STATUS::            $?
-#  $LAST_MATCH_INFO::         $~
-#  $ARGV::                    $*
-#  $MATCH::                   $&
-#  $PREMATCH::                $`
-#  $POSTMATCH::               $'
-#  $LAST_PAREN_MATCH::        $+
+#  <tt>$ERROR_INFO</tt>::              <tt>$!</tt>
+#  <tt>$ERROR_POSITION</tt>::          <tt>$@</tt>
+#  <tt>$FS</tt>::                      <tt>$;</tt>
+#  <tt>$FIELD_SEPARATOR</tt>::         <tt>$;</tt>
+#  <tt>$OFS</tt>::                     <tt>$,</tt>
+#  <tt>$OUTPUT_FIELD_SEPARATOR</tt>::  <tt>$,</tt>
+#  <tt>$RS</tt>::                      <tt>$/</tt>
+#  <tt>$INPUT_RECORD_SEPARATOR</tt>::  <tt>$/</tt>
+#  <tt>$ORS</tt>::                     <tt>$\</tt>
+#  <tt>$OUTPUT_RECORD_SEPARATOR</tt>:: <tt>$\</tt>
+#  <tt>$NR</tt>::                      <tt>$.</tt>
+#  <tt>$INPUT_LINE_NUMBER</tt>::       <tt>$.</tt>
+#  <tt>$LAST_READ_LINE</tt>::          <tt>$_</tt>
+#  <tt>$DEFAULT_OUTPUT</tt>::          <tt>$></tt>
+#  <tt>$DEFAULT_INPUT</tt>::           <tt>$<</tt>
+#  <tt>$PID</tt>::                     <tt>$$</tt>
+#  <tt>$PROCESS_ID</tt>::              <tt>$$</tt>
+#  <tt>$CHILD_STATUS</tt>::            <tt>$?</tt>
+#  <tt>$LAST_MATCH_INFO</tt>::         <tt>$~</tt>
+#  <tt>$ARGV</tt>::                    <tt>$*</tt>
+#  <tt>$MATCH</tt>::                   <tt>$&</tt>
+#  <tt>$PREMATCH</tt>::                <tt>$`</tt>
+#  <tt>$POSTMATCH</tt>::               <tt>$'</tt>
+#  <tt>$LAST_PAREN_MATCH</tt>::        <tt>$+</tt>
 #
 module English end if false
 
diff --git a/lib/benchmark.gemspec b/lib/benchmark.gemspec
deleted file mode 100644
index d6e98db805..0000000000
--- a/lib/benchmark.gemspec
+++ /dev/null
@@ -1,30 +0,0 @@
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", Array.new(name.count("-")+1, ".").join("/")].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Yukihiro Matsumoto"]
-  spec.email         = ["matz@ruby-lang.org"]
-
-  spec.summary       = %q{a performance benchmarking library}
-  spec.description   = spec.summary
-  spec.homepage      = "https://github.com/ruby/benchmark"
-  spec.licenses       = ["Ruby", "BSD-2-Clause"]
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = "exe"
-  spec.executables   = []
-  spec.require_paths = ["lib"]
-end
diff --git a/lib/benchmark.rb b/lib/benchmark.rb
deleted file mode 100644
index 9f43255e42..0000000000
--- a/lib/benchmark.rb
+++ /dev/null
@@ -1,584 +0,0 @@
-# frozen_string_literal: true
-#--
-# benchmark.rb - a performance benchmarking library
-#
-# $Id$
-#
-# Created by Gotoken (gotoken@notwork.org).
-#
-# Documentation by Gotoken (original RD), Lyle Johnson (RDoc conversion), and
-# Gavin Sinclair (editing).
-#++
-#
-# == Overview
-#
-# The Benchmark module provides methods for benchmarking Ruby code, giving
-# detailed reports on the time taken for each task.
-#
-
-# The Benchmark module provides methods to measure and report the time
-# used to execute Ruby code.
-#
-# * Measure the time to construct the string given by the expression
-#   <code>"a"*1_000_000_000</code>:
-#
-#       require 'benchmark'
-#
-#       puts Benchmark.measure { "a"*1_000_000_000 }
-#
-#   On my machine (OSX 10.8.3 on i5 1.7 GHz) this generates:
-#
-#       0.350000   0.400000   0.750000 (  0.835234)
-#
-#   This report shows the user CPU time, system CPU time, the sum of
-#   the user and system CPU times, and the elapsed real time. The unit
-#   of time is seconds.
-#
-# * Do some experiments sequentially using the #bm method:
-#
-#       require 'benchmark'
-#
-#       n = 5000000
-#       Benchmark.bm do |x|
-#         x.report { for i in 1..n; a = "1"; end }
-#         x.report { n.times do   ; a = "1"; end }
-#         x.report { 1.upto(n) do ; a = "1"; end }
-#       end
-#
-#   The result:
-#
-#              user     system      total        real
-#          1.010000   0.000000   1.010000 (  1.014479)
-#          1.000000   0.000000   1.000000 (  0.998261)
-#          0.980000   0.000000   0.980000 (  0.981335)
-#
-# * Continuing the previous example, put a label in each report:
-#
-#       require 'benchmark'
-#
-#       n = 5000000
-#       Benchmark.bm(7) do |x|
-#         x.report("for:")   { for i in 1..n; a = "1"; end }
-#         x.report("times:") { n.times do   ; a = "1"; end }
-#         x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-#       end
-#
-# The result:
-#
-#                     user     system      total        real
-#       for:      1.010000   0.000000   1.010000 (  1.015688)
-#       times:    1.000000   0.000000   1.000000 (  1.003611)
-#       upto:     1.030000   0.000000   1.030000 (  1.028098)
-#
-# * The times for some benchmarks depend on the order in which items
-#   are run.  These differences are due to the cost of memory
-#   allocation and garbage collection. To avoid these discrepancies,
-#   the #bmbm method is provided.  For example, to compare ways to
-#   sort an array of floats:
-#
-#       require 'benchmark'
-#
-#       array = (1..1000000).map { rand }
-#
-#       Benchmark.bmbm do |x|
-#         x.report("sort!") { array.dup.sort! }
-#         x.report("sort")  { array.dup.sort  }
-#       end
-#
-#   The result:
-#
-#        Rehearsal -----------------------------------------
-#        sort!   1.490000   0.010000   1.500000 (  1.490520)
-#        sort    1.460000   0.000000   1.460000 (  1.463025)
-#        -------------------------------- total: 2.960000sec
-#
-#                    user     system      total        real
-#        sort!   1.460000   0.000000   1.460000 (  1.460465)
-#        sort    1.450000   0.010000   1.460000 (  1.448327)
-#
-# * Report statistics of sequential experiments with unique labels,
-#   using the #benchmark method:
-#
-#       require 'benchmark'
-#       include Benchmark         # we need the CAPTION and FORMAT constants
-#
-#       n = 5000000
-#       Benchmark.benchmark(CAPTION, 7, FORMAT, ">total:", ">avg:") do |x|
-#         tf = x.report("for:")   { for i in 1..n; a = "1"; end }
-#         tt = x.report("times:") { n.times do   ; a = "1"; end }
-#         tu = x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-#         [tf+tt+tu, (tf+tt+tu)/3]
-#       end
-#
-#   The result:
-#
-#                     user     system      total        real
-#        for:      0.950000   0.000000   0.950000 (  0.952039)
-#        times:    0.980000   0.000000   0.980000 (  0.984938)
-#        upto:     0.950000   0.000000   0.950000 (  0.946787)
-#        >total:   2.880000   0.000000   2.880000 (  2.883764)
-#        >avg:     0.960000   0.000000   0.960000 (  0.961255)
-
-module Benchmark
-
-  VERSION = "0.3.0"
-
-  BENCHMARK_VERSION = "2002-04-25" # :nodoc:
-
-  # Invokes the block with a Benchmark::Report object, which
-  # may be used to collect and report on the results of individual
-  # benchmark tests. Reserves +label_width+ leading spaces for
-  # labels on each line. Prints +caption+ at the top of the
-  # report, and uses +format+ to format each line.
-  # (Note: +caption+ must contain a terminating newline character,
-  # see the default Benchmark::Tms::CAPTION for an example.)
-  #
-  # Returns an array of Benchmark::Tms objects.
-  #
-  # If the block returns an array of
-  # Benchmark::Tms objects, these will be used to format
-  # additional lines of output. If +labels+ parameter are
-  # given, these are used to label these extra lines.
-  #
-  # _Note_: Other methods provide a simpler interface to this one, and are
-  # suitable for nearly all benchmarking requirements.  See the examples in
-  # Benchmark, and the #bm and #bmbm methods.
-  #
-  # Example:
-  #
-  #     require 'benchmark'
-  #     include Benchmark          # we need the CAPTION and FORMAT constants
-  #
-  #     n = 5000000
-  #     Benchmark.benchmark(CAPTION, 7, FORMAT, ">total:", ">avg:") do |x|
-  #       tf = x.report("for:")   { for i in 1..n; a = "1"; end }
-  #       tt = x.report("times:") { n.times do   ; a = "1"; end }
-  #       tu = x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-  #       [tf+tt+tu, (tf+tt+tu)/3]
-  #     end
-  #
-  # Generates:
-  #
-  #                     user     system      total        real
-  #       for:      0.970000   0.000000   0.970000 (  0.970493)
-  #       times:    0.990000   0.000000   0.990000 (  0.989542)
-  #       upto:     0.970000   0.000000   0.970000 (  0.972854)
-  #       >total:   2.930000   0.000000   2.930000 (  2.932889)
-  #       >avg:     0.976667   0.000000   0.976667 (  0.977630)
-  #
-
-  def benchmark(caption = "", label_width = nil, format = nil, *labels) # :yield: report
-    sync = $stdout.sync
-    $stdout.sync = true
-    label_width ||= 0
-    label_width += 1
-    format ||= FORMAT
-    print ' '*label_width + caption unless caption.empty?
-    report = Report.new(label_width, format)
-    results = yield(report)
-    Array === results and results.grep(Tms).each {|t|
-      print((labels.shift || t.label || "").ljust(label_width), t.format(format))
-    }
-    report.list
-  ensure
-    $stdout.sync = sync unless sync.nil?
-  end
-
-
-  # A simple interface to the #benchmark method, #bm generates sequential
-  # reports with labels. +label_width+ and +labels+ parameters have the same
-  # meaning as for #benchmark.
-  #
-  #     require 'benchmark'
-  #
-  #     n = 5000000
-  #     Benchmark.bm(7) do |x|
-  #       x.report("for:")   { for i in 1..n; a = "1"; end }
-  #       x.report("times:") { n.times do   ; a = "1"; end }
-  #       x.report("upto:")  { 1.upto(n) do ; a = "1"; end }
-  #     end
-  #
-  # Generates:
-  #
-  #                     user     system      total        real
-  #       for:      0.960000   0.000000   0.960000 (  0.957966)
-  #       times:    0.960000   0.000000   0.960000 (  0.960423)
-  #       upto:     0.950000   0.000000   0.950000 (  0.954864)
-  #
-
-  def bm(label_width = 0, *labels, &blk) # :yield: report
-    benchmark(CAPTION, label_width, FORMAT, *labels, &blk)
-  end
-
-
-  # Sometimes benchmark results are skewed because code executed
-  # earlier encounters different garbage collection overheads than
-  # that run later. #bmbm attempts to minimize this effect by running
-  # the tests twice, the first time as a rehearsal in order to get the
-  # runtime environment stable, the second time for
-  # real. GC.start is executed before the start of each of
-  # the real timings; the cost of this is not included in the
-  # timings. In reality, though, there's only so much that #bmbm can
-  # do, and the results are not guaranteed to be isolated from garbage
-  # collection and other effects.
-  #
-  # Because #bmbm takes two passes through the tests, it can
-  # calculate the required label width.
-  #
-  #       require 'benchmark'
-  #
-  #       array = (1..1000000).map { rand }
-  #
-  #       Benchmark.bmbm do |x|
-  #         x.report("sort!") { array.dup.sort! }
-  #         x.report("sort")  { array.dup.sort  }
-  #       end
-  #
-  # Generates:
-  #
-  #        Rehearsal -----------------------------------------
-  #        sort!   1.440000   0.010000   1.450000 (  1.446833)
-  #        sort    1.440000   0.000000   1.440000 (  1.448257)
-  #        -------------------------------- total: 2.890000sec
-  #
-  #                    user     system      total        real
-  #        sort!   1.460000   0.000000   1.460000 (  1.458065)
-  #        sort    1.450000   0.000000   1.450000 (  1.455963)
-  #
-  # #bmbm yields a Benchmark::Job object and returns an array of
-  # Benchmark::Tms objects.
-  #
-  def bmbm(width = 0) # :yield: job
-    job = Job.new(width)
-    yield(job)
-    width = job.width + 1
-    sync = $stdout.sync
-    $stdout.sync = true
-
-    # rehearsal
-    puts 'Rehearsal '.ljust(width+CAPTION.length,'-')
-    ets = job.list.inject(Tms.new) { |sum,(label,item)|
-      print label.ljust(width)
-      res = Benchmark.measure(&item)
-      print res.format
-      sum + res
-    }.format("total: %tsec")
-    print " #{ets}\n\n".rjust(width+CAPTION.length+2,'-')
-
-    # take
-    print ' '*width + CAPTION
-    job.list.map { |label,item|
-      GC.start
-      print label.ljust(width)
-      Benchmark.measure(label, &item).tap { |res| print res }
-    }
-  ensure
-    $stdout.sync = sync unless sync.nil?
-  end
-
-  #
-  # Returns the time used to execute the given block as a
-  # Benchmark::Tms object. Takes +label+ option.
-  #
-  #       require 'benchmark'
-  #
-  #       n = 1000000
-  #
-  #       time = Benchmark.measure do
-  #         n.times { a = "1" }
-  #       end
-  #       puts time
-  #
-  # Generates:
-  #
-  #        0.220000   0.000000   0.220000 (  0.227313)
-  #
-  def measure(label = "") # :yield:
-    t0, r0 = Process.times, Process.clock_gettime(Process::CLOCK_MONOTONIC)
-    yield
-    t1, r1 = Process.times, Process.clock_gettime(Process::CLOCK_MONOTONIC)
-    Benchmark::Tms.new(t1.utime  - t0.utime,
-                       t1.stime  - t0.stime,
-                       t1.cutime - t0.cutime,
-                       t1.cstime - t0.cstime,
-                       r1 - r0,
-                       label)
-  end
-
-  #
-  # Returns the elapsed real time used to execute the given block.
-  #
-  def realtime # :yield:
-    r0 = Process.clock_gettime(Process::CLOCK_MONOTONIC)
-    yield
-    Process.clock_gettime(Process::CLOCK_MONOTONIC) - r0
-  end
-
-  module_function :benchmark, :measure, :realtime, :bm, :bmbm
-
-  #
-  # A Job is a sequence of labelled blocks to be processed by the
-  # Benchmark.bmbm method.  It is of little direct interest to the user.
-  #
-  class Job # :nodoc:
-    #
-    # Returns an initialized Job instance.
-    # Usually, one doesn't call this method directly, as new
-    # Job objects are created by the #bmbm method.
-    # +width+ is a initial value for the label offset used in formatting;
-    # the #bmbm method passes its +width+ argument to this constructor.
-    #
-    def initialize(width)
-      @width = width
-      @list = []
-    end
-
-    #
-    # Registers the given label and block pair in the job list.
-    #
-    def item(label = "", &blk) # :yield:
-      raise ArgumentError, "no block" unless block_given?
-      label = label.to_s
-      w = label.length
-      @width = w if @width < w
-      @list << [label, blk]
-      self
-    end
-
-    alias report item
-
-    # An array of 2-element arrays, consisting of label and block pairs.
-    attr_reader :list
-
-    # Length of the widest label in the #list.
-    attr_reader :width
-  end
-
-  #
-  # This class is used by the Benchmark.benchmark and Benchmark.bm methods.
-  # It is of little direct interest to the user.
-  #
-  class Report # :nodoc:
-    #
-    # Returns an initialized Report instance.
-    # Usually, one doesn't call this method directly, as new
-    # Report objects are created by the #benchmark and #bm methods.
-    # +width+ and +format+ are the label offset and
-    # format string used by Tms#format.
-    #
-    def initialize(width = 0, format = nil)
-      @width, @format, @list = width, format, []
-    end
-
-    #
-    # Prints the +label+ and measured time for the block,
-    # formatted by +format+. See Tms#format for the
-    # formatting rules.
-    #
-    def item(label = "", *format, &blk) # :yield:
-      print label.to_s.ljust(@width)
-      @list << res = Benchmark.measure(label, &blk)
-      print res.format(@format, *format)
-      res
-    end
-
-    alias report item
-
-    # An array of Benchmark::Tms objects representing each item.
-    attr_reader :list
-  end
-
-
-
-  #
-  # A data object, representing the times associated with a benchmark
-  # measurement.
-  #
-  class Tms
-
-    # Default caption, see also Benchmark::CAPTION
-    CAPTION = "      user     system      total        real\n"
-
-    # Default format string, see also Benchmark::FORMAT
-    FORMAT = "%10.6u %10.6y %10.6t %10.6r\n"
-
-    # User CPU time
-    attr_reader :utime
-
-    # System CPU time
-    attr_reader :stime
-
-    # User CPU time of children
-    attr_reader :cutime
-
-    # System CPU time of children
-    attr_reader :cstime
-
-    # Elapsed real time
-    attr_reader :real
-
-    # Total time, that is +utime+ + +stime+ + +cutime+ + +cstime+
-    attr_reader :total
-
-    # Label
-    attr_reader :label
-
-    #
-    # Returns an initialized Tms object which has
-    # +utime+ as the user CPU time, +stime+ as the system CPU time,
-    # +cutime+ as the children's user CPU time, +cstime+ as the children's
-    # system CPU time, +real+ as the elapsed real time and +label+ as the label.
-    #
-    def initialize(utime = 0.0, stime = 0.0, cutime = 0.0, cstime = 0.0, real = 0.0, label = nil)
-      @utime, @stime, @cutime, @cstime, @real, @label = utime, stime, cutime, cstime, real, label.to_s
-      @total = @utime + @stime + @cutime + @cstime
-    end
-
-    #
-    # Returns a new Tms object whose times are the sum of the times for this
-    # Tms object, plus the time required to execute the code block (+blk+).
-    #
-    def add(&blk) # :yield:
-      self + Benchmark.measure(&blk)
-    end
-
-    #
-    # An in-place version of #add.
-    # Changes the times of this Tms object by making it the sum of the times
-    # for this Tms object, plus the time required to execute
-    # the code block (+blk+).
-    #
-    def add!(&blk)
-      t = Benchmark.measure(&blk)
-      @utime  = utime + t.utime
-      @stime  = stime + t.stime
-      @cutime = cutime + t.cutime
-      @cstime = cstime + t.cstime
-      @real   = real + t.real
-      self
-    end
-
-    #
-    # Returns a new Tms object obtained by memberwise summation
-    # of the individual times for this Tms object with those of the +other+
-    # Tms object.
-    # This method and #/() are useful for taking statistics.
-    #
-    def +(other); memberwise(:+, other) end
-
-    #
-    # Returns a new Tms object obtained by memberwise subtraction
-    # of the individual times for the +other+ Tms object from those of this
-    # Tms object.
-    #
-    def -(other); memberwise(:-, other) end
-
-    #
-    # Returns a new Tms object obtained by memberwise multiplication
-    # of the individual times for this Tms object by +x+.
-    #
-    def *(x); memberwise(:*, x) end
-
-    #
-    # Returns a new Tms object obtained by memberwise division
-    # of the individual times for this Tms object by +x+.
-    # This method and #+() are useful for taking statistics.
-    #
-    def /(x); memberwise(:/, x) end
-
-    #
-    # Returns the contents of this Tms object as
-    # a formatted string, according to a +format+ string
-    # like that passed to Kernel.format. In addition, #format
-    # accepts the following extensions:
-    #
-    # <tt>%u</tt>::     Replaced by the user CPU time, as reported by Tms#utime.
-    # <tt>%y</tt>::     Replaced by the system CPU time, as reported by #stime (Mnemonic: y of "s*y*stem")
-    # <tt>%U</tt>::     Replaced by the children's user CPU time, as reported by Tms#cutime
-    # <tt>%Y</tt>::     Replaced by the children's system CPU time, as reported by Tms#cstime
-    # <tt>%t</tt>::     Replaced by the total CPU time, as reported by Tms#total
-    # <tt>%r</tt>::     Replaced by the elapsed real time, as reported by Tms#real
-    # <tt>%n</tt>::     Replaced by the label string, as reported by Tms#label (Mnemonic: n of "*n*ame")
-    #
-    # If +format+ is not given, FORMAT is used as default value, detailing the
-    # user, system and real elapsed time.
-    #
-    def format(format = nil, *args)
-      str = (format || FORMAT).dup
-      str.gsub!(/(%[-+.\d]*)n/) { "#{$1}s" % label }
-      str.gsub!(/(%[-+.\d]*)u/) { "#{$1}f" % utime }
-      str.gsub!(/(%[-+.\d]*)y/) { "#{$1}f" % stime }
-      str.gsub!(/(%[-+.\d]*)U/) { "#{$1}f" % cutime }
-      str.gsub!(/(%[-+.\d]*)Y/) { "#{$1}f" % cstime }
-      str.gsub!(/(%[-+.\d]*)t/) { "#{$1}f" % total }
-      str.gsub!(/(%[-+.\d]*)r/) { "(#{$1}f)" % real }
-      format ? str % args : str
-    end
-
-    #
-    # Same as #format.
-    #
-    def to_s
-      format
-    end
-
-    #
-    # Returns a new 6-element array, consisting of the
-    # label, user CPU time, system CPU time, children's
-    # user CPU time, children's system CPU time and elapsed
-    # real time.
-    #
-    def to_a
-      [@label, @utime, @stime, @cutime, @cstime, @real]
-    end
-
-    #
-    # Returns a hash containing the same data as `to_a`.
-    #
-    def to_h
-      {
-        label:  @label,
-        utime:  @utime,
-        stime:  @stime,
-        cutime: @cutime,
-        cstime: @cstime,
-        real:   @real
-      }
-    end
-
-    protected
-
-    #
-    # Returns a new Tms object obtained by memberwise operation +op+
-    # of the individual times for this Tms object with those of the other
-    # Tms object (+x+).
-    #
-    # +op+ can be a mathematical operation such as <tt>+</tt>, <tt>-</tt>,
-    # <tt>*</tt>, <tt>/</tt>
-    #
-    def memberwise(op, x)
-      case x
-      when Benchmark::Tms
-        Benchmark::Tms.new(utime.__send__(op, x.utime),
-                           stime.__send__(op, x.stime),
-                           cutime.__send__(op, x.cutime),
-                           cstime.__send__(op, x.cstime),
-                           real.__send__(op, x.real)
-                           )
-      else
-        Benchmark::Tms.new(utime.__send__(op, x),
-                           stime.__send__(op, x),
-                           cutime.__send__(op, x),
-                           cstime.__send__(op, x),
-                           real.__send__(op, x)
-                           )
-      end
-    end
-  end
-
-  # The default caption string (heading above the output times).
-  CAPTION = Benchmark::Tms::CAPTION
-
-  # The default format string used to display times.  See also Benchmark::Tms#format.
-  FORMAT = Benchmark::Tms::FORMAT
-end
diff --git a/lib/bundled_gems.rb b/lib/bundled_gems.rb
index 01c6408d6d..a287c49a34 100644
--- a/lib/bundled_gems.rb
+++ b/lib/bundled_gems.rb
@@ -1,18 +1,12 @@
 # -*- frozen-string-literal: true -*-
 
-# :stopdoc:
+module Gem # :nodoc:
+  # TODO: the nodoc above is a workaround for RDoc's Prism parser handling stopdoc differently, we may want to use
+  # stopdoc/startdoc pair like before
+end
 
-module Gem::BUNDLED_GEMS
+module Gem::BUNDLED_GEMS # :nodoc:
   SINCE = {
-    "rexml" => "3.0.0",
-    "rss" => "3.0.0",
-    "webrick" => "3.0.0",
-    "matrix" => "3.1.0",
-    "net-ftp" => "3.1.0",
-    "net-imap" => "3.1.0",
-    "net-pop" => "3.1.0",
-    "net-smtp" => "3.1.0",
-    "prime" => "3.1.0",
     "racc" => "3.3.0",
     "abbrev" => "3.4.0",
     "base64" => "3.4.0",
@@ -26,24 +20,23 @@ module Gem::BUNDLED_GEMS
     "resolv-replace" => "3.4.0",
     "rinda" => "3.4.0",
     "syslog" => "3.4.0",
-    "ostruct" => "3.5.0",
-    "pstore" => "3.5.0",
-    "rdoc" => "3.5.0",
-    "win32ole" => "3.5.0",
+    "ostruct" => "4.0.0",
+    "pstore" => "4.0.0",
+    "rdoc" => "4.0.0",
+    "win32ole" => "4.0.0",
+    "fiddle" => "4.0.0",
+    "logger" => "4.0.0",
+    "benchmark" => "4.0.0",
+    "irb" => "4.0.0",
+    "reline" => "4.0.0",
+    # "readline" => "4.0.0", # This is wrapper for reline. We don't warn for this.
+    "tsort" => "4.1.0",
   }.freeze
 
   EXACT = {
     "kconv" => "nkf",
   }.freeze
 
-  PREFIXED = {
-    "bigdecimal" => true,
-    "csv" => true,
-    "drb" => true,
-    "rinda" => true,
-    "syslog" => true,
-  }.freeze
-
   WARNED = {}                   # unfrozen
 
   conf = ::RbConfig::CONFIG
@@ -61,8 +54,8 @@ module Gem::BUNDLED_GEMS
     [::Kernel.singleton_class, ::Kernel].each do |kernel_class|
       kernel_class.send(:alias_method, :no_warning_require, :require)
       kernel_class.send(:define_method, :require) do |name|
-        if message = ::Gem::BUNDLED_GEMS.warning?(name, specs: spec_names) # rubocop:disable Style/HashSyntax
-          warn message, :uplevel => 1
+        if message = ::Gem::BUNDLED_GEMS.warning?(name, specs: spec_names)
+          Kernel.warn message, uplevel: ::Gem::BUNDLED_GEMS.uplevel
         end
         kernel_class.send(:no_warning_require, name)
       end
@@ -74,69 +67,129 @@ module Gem::BUNDLED_GEMS
     end
   end
 
-  def self.find_gem(path)
-    if !path
-      return
-    elsif path.start_with?(ARCHDIR)
-      n = path.delete_prefix(ARCHDIR).sub(DLEXT, "")
-    elsif path.start_with?(LIBDIR)
-      n = path.delete_prefix(LIBDIR).chomp(".rb")
-    else
-      return
+  def self.uplevel
+    frame_count = 0
+    require_labels = ["replace_require", "require"]
+    uplevel = 0
+    require_found = false
+    Thread.each_caller_location do |cl|
+      frame_count += 1
+
+      if require_found
+        unless require_labels.include?(cl.base_label)
+          return uplevel
+        end
+      else
+        if require_labels.include?(cl.base_label)
+          require_found = true
+        end
+      end
+      uplevel += 1
+      # Don't show script name when bundle exec and call ruby script directly.
+      if cl.path.end_with?("bundle")
+        return
+      end
     end
-    (EXACT[n] || !!SINCE[n]) or PREFIXED[n = n[%r[\A[^/]+(?=/)]]] && n
+    require_found ? 1 : (frame_count - 1).nonzero?
   end
 
   def self.warning?(name, specs: nil)
     # name can be a feature name or a file path with String or Pathname
-    feature = File.path(name)
-    # bootsnap expands `require "csv"` to `require "#{LIBDIR}/csv.rb"`,
-    # and `require "syslog"` to `require "#{ARCHDIR}/syslog.so"`.
-    name = feature.delete_prefix(ARCHDIR)
-    name.delete_prefix!(LIBDIR)
-    name.tr!("/", "-")
-    name.sub!(LIBEXT, "")
-    return if specs.include?(name)
-    _t, path = $:.resolve_feature_path(feature)
-    if gem = find_gem(path)
-      return if specs.include?(gem)
-      caller = caller_locations(3, 3)&.find {|c| c&.absolute_path}
-      return if find_gem(caller&.absolute_path)
-    elsif SINCE[name] && !path
-      gem = true
+    feature = File.path(name).sub(LIBEXT, "")
+
+    # The actual checks needed to properly identify the gem being required
+    # are costly (see [Bug #20641]), so we first do a much cheaper check
+    # to exclude the vast majority of candidates.
+    subfeature = if feature.include?("/")
+      # bootsnap expands `require "csv"` to `require "#{LIBDIR}/csv.rb"`,
+      # and `require "syslog"` to `require "#{ARCHDIR}/syslog.so"`.
+      feature.delete_prefix!(ARCHDIR)
+      feature.delete_prefix!(LIBDIR)
+      # 1. A segment for the EXACT mapping and SINCE check
+      # 2. A segment for the SINCE check for dashed names
+      # 3. A segment to check if there's a subfeature
+      segments = feature.split("/", 3)
+      name = segments.shift
+      name = EXACT[name] || name
+      if !SINCE[name]
+        name = "#{name}-#{segments.shift}"
+        return unless SINCE[name]
+      end
+      segments.any?
     else
-      return
+      name = EXACT[feature] || feature
+      return unless SINCE[name]
+      false
+    end
+
+    if suppress_list = Thread.current[:__bundled_gems_warning_suppression]
+      return if suppress_list.include?(name) || suppress_list.include?(feature)
+    end
+
+    return if specs.include?(name)
+
+    # Don't warn if a hyphenated gem provides this feature
+    # (e.g., benchmark-ips provides benchmark/ips, benchmark/timing, etc.)
+    if subfeature
+      prefix = feature.split("/").first + "-"
+      return if specs.any? { |spec, _| spec.start_with?(prefix) }
+
+      # Don't warn if the feature is found outside the standard library
+      # (e.g., benchmark-ips's lib dir is on $LOAD_PATH but not in specs)
+      resolved = $LOAD_PATH.resolve_feature_path(feature) rescue nil
+      if resolved && !resolved[1].start_with?(LIBDIR, ARCHDIR)
+        return
+      end
     end
 
     return if WARNED[name]
     WARNED[name] = true
-    if gem == true
-      gem = name
-      "#{feature} was loaded from the standard library, but"
-    elsif gem
-      return if WARNED[gem]
-      WARNED[gem] = true
-      "#{feature} is found in #{gem}, which"
+
+    level = RUBY_VERSION < SINCE[name] ? :warning : :error
+
+    if subfeature
+      "#{feature} is found in #{name}, which"
     else
-      return
-    end + build_message(gem)
+      "#{feature} #{level == :warning ? "was loaded" : "used to be loaded"} from the standard library, but"
+    end + build_message(name, level)
   end
 
-  def self.build_message(gem)
-    msg = " #{RUBY_VERSION < SINCE[gem] ? "will no longer be" : "is not"} part of the default gems since Ruby #{SINCE[gem]}."
+  def self.build_message(name, level)
+    msg = if level == :warning
+      " will no longer be part of the default gems starting from Ruby #{SINCE[name]}"
+    else
+      " is not part of the default gems since Ruby #{SINCE[name]}."
+    end
 
     if defined?(Bundler)
-      msg += " Add #{gem} to your Gemfile or gemspec."
+      motivation = level == :warning ? "silence this warning" : "fix this error"
+      msg += "\nYou can add #{name} to your Gemfile or gemspec to #{motivation}."
 
-      # We detect the gem name from caller_locations. We need to skip 2 frames like:
-      # lib/ruby/3.3.0+0/bundled_gems.rb:90:in `warning?'",
-      # lib/ruby/3.3.0+0/bundler/rubygems_integration.rb:247:in `block (2 levels) in replace_require'",
+      # We detect the gem name from caller_locations. First we walk until we find `require`
+      # then take the first frame that's not from `require`.
       #
       # Additionally, we need to skip Bootsnap and Zeitwerk if present, these
       # gems decorate Kernel#require, so they are not really the ones issuing
       # the require call users should be warned about. Those are upwards.
-      location = Thread.each_caller_location(2) do |cl|
-        break cl.path unless cl.base_label == "require"
+      frames_to_skip = 3
+      location = nil
+      require_found = false
+      Thread.each_caller_location do |cl|
+        if frames_to_skip >= 1
+          frames_to_skip -= 1
+          next
+        end
+
+        if require_found
+          if cl.base_label != "require"
+            location = cl.path
+            break
+          end
+        else
+          if cl.base_label == "require"
+            require_found = true
+          end
+        end
       end
 
       if location && File.file?(location) && !location.start_with?(Gem::BUNDLED_GEMS::LIBDIR)
@@ -148,31 +201,75 @@ module Gem::BUNDLED_GEMS
           end
         end
         if caller_gem
-          msg += " Also contact author of #{caller_gem} to add #{gem} into its gemspec."
+          msg += "\nAlso please contact the author of #{caller_gem} to request adding #{name} into its gemspec."
         end
       end
     else
-      msg += " Install #{gem} from RubyGems."
+      msg += " Install #{name} from RubyGems."
     end
 
     msg
   end
 
-  freeze
+  def self.force_activate(gem)
+    require "bundler"
+    Bundler.reset!
+
+    # Build and activate a temporary definition containing the original gems + the requested gem
+    builder = Bundler::Dsl.new
+
+    lockfile = nil
+    if Bundler::SharedHelpers.in_bundle? && Bundler.definition.gemfiles.size > 0
+      Bundler.definition.gemfiles.each {|gemfile| builder.eval_gemfile(gemfile) }
+      lockfile = begin
+        Bundler.default_lockfile
+      rescue Bundler::GemfileNotFound
+        nil
+      end
+    else
+      # Fake BUNDLE_GEMFILE and BUNDLE_LOCKFILE to let checks pass
+      orig_gemfile = ENV["BUNDLE_GEMFILE"]
+      orig_lockfile = ENV["BUNDLE_LOCKFILE"]
+      Bundler::SharedHelpers.set_env "BUNDLE_GEMFILE", "Gemfile"
+      Bundler::SharedHelpers.set_env "BUNDLE_LOCKFILE", "Gemfile.lock"
+    end
+
+    builder.gem gem
+
+    definition = builder.to_definition(lockfile, nil)
+    definition.validate_runtime!
+
+    begin
+      orig_ui = Bundler.ui
+      orig_no_lock = Bundler::Definition.no_lock
+
+      ui = Bundler::UI::Shell.new
+      ui.level = "silent"
+      Bundler.ui = ui
+      Bundler::Definition.no_lock = true
+
+      Bundler::Runtime.new(nil, definition).setup
+    rescue Bundler::GemNotFound
+      warn "Failed to activate #{gem}, please install it with 'gem install #{gem}'"
+    ensure
+      ENV['BUNDLE_GEMFILE'] = orig_gemfile if orig_gemfile
+      ENV['BUNDLE_LOCKFILE'] = orig_lockfile if orig_lockfile
+      Bundler.ui = orig_ui
+      Bundler::Definition.no_lock = orig_no_lock
+    end
+  end
 end
 
 # for RubyGems without Bundler environment.
 # If loading library is not part of the default gems and the bundled gems, warn it.
 class LoadError
-  def message
+  def message # :nodoc:
     return super unless path
 
     name = path.tr("/", "-")
     if !defined?(Bundler) && Gem::BUNDLED_GEMS::SINCE[name] && !Gem::BUNDLED_GEMS::WARNED[name]
-      warn name + Gem::BUNDLED_GEMS.build_message(name)
+      warn name + Gem::BUNDLED_GEMS.build_message(name, :error), uplevel: Gem::BUNDLED_GEMS.uplevel
     end
     super
   end
 end
-
-# :startdoc:
diff --git a/lib/bundler.rb b/lib/bundler.rb
index 0081b9554f..12dde90fc5 100644
--- a/lib/bundler.rb
+++ b/lib/bundler.rb
@@ -1,16 +1,15 @@
 # frozen_string_literal: true
 
+require_relative "bundler/rubygems_ext"
 require_relative "bundler/vendored_fileutils"
-require "pathname"
+autoload :Pathname, "pathname" unless defined?(Pathname)
 require "rbconfig"
 
 require_relative "bundler/errors"
 require_relative "bundler/environment_preserver"
 require_relative "bundler/plugin"
-require_relative "bundler/rubygems_ext"
 require_relative "bundler/rubygems_integration"
 require_relative "bundler/version"
-require_relative "bundler/constants"
 require_relative "bundler/current_ruby"
 require_relative "bundler/build_metadata"
 
@@ -52,16 +51,18 @@ module Bundler
   autoload :Env,                    File.expand_path("bundler/env", __dir__)
   autoload :Fetcher,                File.expand_path("bundler/fetcher", __dir__)
   autoload :FeatureFlag,            File.expand_path("bundler/feature_flag", __dir__)
+  autoload :FREEBSD,                File.expand_path("bundler/constants", __dir__)
   autoload :GemHelper,              File.expand_path("bundler/gem_helper", __dir__)
-  autoload :GemHelpers,             File.expand_path("bundler/gem_helpers", __dir__)
   autoload :GemVersionPromoter,     File.expand_path("bundler/gem_version_promoter", __dir__)
-  autoload :Graph,                  File.expand_path("bundler/graph", __dir__)
   autoload :Index,                  File.expand_path("bundler/index", __dir__)
   autoload :Injector,               File.expand_path("bundler/injector", __dir__)
   autoload :Installer,              File.expand_path("bundler/installer", __dir__)
   autoload :LazySpecification,      File.expand_path("bundler/lazy_specification", __dir__)
   autoload :LockfileParser,         File.expand_path("bundler/lockfile_parser", __dir__)
   autoload :MatchRemoteMetadata,    File.expand_path("bundler/match_remote_metadata", __dir__)
+  autoload :Materialization,        File.expand_path("bundler/materialization", __dir__)
+  autoload :NULL,                   File.expand_path("bundler/constants", __dir__)
+  autoload :Override,               File.expand_path("bundler/override", __dir__)
   autoload :ProcessLock,            File.expand_path("bundler/process_lock", __dir__)
   autoload :RemoteSpecification,    File.expand_path("bundler/remote_specification", __dir__)
   autoload :Resolver,               File.expand_path("bundler/resolver", __dir__)
@@ -80,6 +81,7 @@ module Bundler
   autoload :UI,                     File.expand_path("bundler/ui", __dir__)
   autoload :URICredentialsFilter,   File.expand_path("bundler/uri_credentials_filter", __dir__)
   autoload :URINormalizer,          File.expand_path("bundler/uri_normalizer", __dir__)
+  autoload :WINDOWS,                File.expand_path("bundler/constants", __dir__)
   autoload :SafeMarshal,            File.expand_path("bundler/safe_marshal", __dir__)
 
   class << self
@@ -111,13 +113,13 @@ module Bundler
     end
 
     def configured_bundle_path
-      @configured_bundle_path ||= settings.path.tap(&:validate!)
+      @configured_bundle_path ||= Bundler.settings.path.tap(&:validate!)
     end
 
     # Returns absolute location of where binstubs are installed to.
     def bin_path
       @bin_path ||= begin
-        path = settings[:bin] || "bin"
+        path = Bundler.settings[:bin] || "bin"
         path = Pathname.new(path).expand_path(root).expand_path
         mkdir_p(path)
         path
@@ -155,6 +157,7 @@ module Bundler
       # Return if all groups are already loaded
       return @setup if defined?(@setup) && @setup
 
+      configure_custom_gemfile
       definition.validate_runtime!
 
       SharedHelpers.print_major_deprecations!
@@ -167,14 +170,18 @@ module Bundler
       end
     end
 
-    # Automatically install dependencies if Bundler.settings[:auto_install] exists.
+    def auto_switch
+      self_manager.restart_with_locked_bundler_if_needed
+    end
+
+    # Automatically install dependencies if <tt>settings[:auto_install]</tt> exists.
     # This is set through config cmd `bundle config set --global auto_install 1`.
     #
     # Note that this method `nil`s out the global Definition object, so it
     # should be called first, before you instantiate anything like an
     # `Installer` that'll keep a reference to the old one instead.
     def auto_install
-      return unless settings[:auto_install]
+      return unless Bundler.settings[:auto_install]
 
       begin
         definition.specs
@@ -205,7 +212,6 @@ module Bundler
     #    Bundler.require(:test)   # requires second_gem
     #
     def require(*groups)
-      load_plugins
       setup(*groups).require(*groups)
     end
 
@@ -214,8 +220,7 @@ module Bundler
     end
 
     def environment
-      SharedHelpers.major_deprecation 2, "Bundler.environment has been removed in favor of Bundler.load", print_caller_location: true
-      load
+      SharedHelpers.feature_removed! "Bundler.environment has been removed in favor of Bundler.load"
     end
 
     # Returns an instance of Bundler::Definition for given Gemfile and lockfile
@@ -233,10 +238,10 @@ module Bundler
     end
 
     def frozen_bundle?
-      frozen = settings[:frozen]
+      frozen = Bundler.settings[:frozen]
       return frozen unless frozen.nil?
 
-      settings[:deployment]
+      Bundler.settings[:deployment]
     end
 
     def locked_gems
@@ -249,12 +254,6 @@ module Bundler
         end
     end
 
-    def most_specific_locked_platform?(platform)
-      return false unless defined?(@definition) && @definition
-
-      definition.most_specific_locked_platform == platform
-    end
-
     def ruby_scope
       "#{Bundler.rubygems.ruby_engine}/#{RbConfig::CONFIG["ruby_version"]}"
     end
@@ -343,7 +342,7 @@ module Bundler
 
     def app_cache(custom_path = nil)
       path = custom_path || root
-      Pathname.new(path).join(settings.app_cache_path)
+      Pathname.new(path).join(Bundler.settings.app_cache_path)
     end
 
     def tmp(name = Process.pid.to_s)
@@ -366,42 +365,21 @@ module Bundler
       ORIGINAL_ENV.clone
     end
 
-    # @deprecated Use `unbundled_env` instead
     def clean_env
-      message =
-        "`Bundler.clean_env` has been deprecated in favor of `Bundler.unbundled_env`. " \
-        "If you instead want the environment before bundler was originally loaded, use `Bundler.original_env`"
       removed_message =
         "`Bundler.clean_env` has been removed in favor of `Bundler.unbundled_env`. " \
         "If you instead want the environment before bundler was originally loaded, use `Bundler.original_env`"
-      Bundler::SharedHelpers.major_deprecation(2, message, removed_message: removed_message, print_caller_location: true)
-      unbundled_env
+      Bundler::SharedHelpers.feature_removed!(removed_message)
     end
 
     # @return [Hash] Environment with all bundler-related variables removed
     def unbundled_env
-      env = original_env
-
-      if env.key?("BUNDLER_ORIG_MANPATH")
-        env["MANPATH"] = env["BUNDLER_ORIG_MANPATH"]
-      end
-
-      env.delete_if {|k, _| k[0, 7] == "BUNDLE_" }
-
-      if env.key?("RUBYOPT")
-        rubyopt = env["RUBYOPT"].split(" ")
-        rubyopt.delete("-r#{File.expand_path("bundler/setup", __dir__)}")
-        rubyopt.delete("-rbundler/setup")
-        env["RUBYOPT"] = rubyopt.join(" ")
-      end
-
-      if env.key?("RUBYLIB")
-        rubylib = env["RUBYLIB"].split(File::PATH_SEPARATOR)
-        rubylib.delete(__dir__)
-        env["RUBYLIB"] = rubylib.join(File::PATH_SEPARATOR)
-      end
+      unbundle_env(original_env)
+    end
 
-      env
+    # Remove all bundler-related variables from ENV
+    def unbundle_env!
+      ENV.replace(unbundle_env(ENV))
     end
 
     # Run block with environment present before Bundler was activated
@@ -409,16 +387,11 @@ module Bundler
       with_env(original_env) { yield }
     end
 
-    # @deprecated Use `with_unbundled_env` instead
     def with_clean_env
-      message =
-        "`Bundler.with_clean_env` has been deprecated in favor of `Bundler.with_unbundled_env`. " \
-        "If you instead want the environment before bundler was originally loaded, use `Bundler.with_original_env`"
       removed_message =
         "`Bundler.with_clean_env` has been removed in favor of `Bundler.with_unbundled_env`. " \
         "If you instead want the environment before bundler was originally loaded, use `Bundler.with_original_env`"
-      Bundler::SharedHelpers.major_deprecation(2, message, removed_message: removed_message, print_caller_location: true)
-      with_env(unbundled_env) { yield }
+      Bundler::SharedHelpers.feature_removed!(removed_message)
     end
 
     # Run block with all bundler-related variables removed
@@ -431,16 +404,11 @@ module Bundler
       with_original_env { Kernel.system(*args) }
     end
 
-    # @deprecated Use `unbundled_system` instead
     def clean_system(*args)
-      message =
-        "`Bundler.clean_system` has been deprecated in favor of `Bundler.unbundled_system`. " \
-        "If you instead want to run the command in the environment before bundler was originally loaded, use `Bundler.original_system`"
       removed_message =
         "`Bundler.clean_system` has been removed in favor of `Bundler.unbundled_system`. " \
         "If you instead want to run the command in the environment before bundler was originally loaded, use `Bundler.original_system`"
-      Bundler::SharedHelpers.major_deprecation(2, message, removed_message: removed_message, print_caller_location: true)
-      with_env(unbundled_env) { Kernel.system(*args) }
+      Bundler::SharedHelpers.feature_removed!(removed_message)
     end
 
     # Run subcommand in an environment with all bundler related variables removed
@@ -453,16 +421,11 @@ module Bundler
       with_original_env { Kernel.exec(*args) }
     end
 
-    # @deprecated Use `unbundled_exec` instead
     def clean_exec(*args)
-      message =
-        "`Bundler.clean_exec` has been deprecated in favor of `Bundler.unbundled_exec`. " \
-        "If you instead want to exec to a command in the environment before bundler was originally loaded, use `Bundler.original_exec`"
       removed_message =
         "`Bundler.clean_exec` has been removed in favor of `Bundler.unbundled_exec`. " \
         "If you instead want to exec to a command in the environment before bundler was originally loaded, use `Bundler.original_exec`"
-      Bundler::SharedHelpers.major_deprecation(2, message, removed_message: removed_message, print_caller_location: true)
-      with_env(unbundled_env) { Kernel.exec(*args) }
+      Bundler::SharedHelpers.feature_removed!(removed_message)
     end
 
     # Run a `Kernel.exec` to a subcommand in an environment with all bundler related variables removed
@@ -471,10 +434,14 @@ module Bundler
     end
 
     def local_platform
-      return Gem::Platform::RUBY if settings[:force_ruby_platform]
+      return Gem::Platform::RUBY if Bundler.settings[:force_ruby_platform]
       Gem::Platform.local
     end
 
+    def generic_local_platform
+      Gem::Platform.generic(local_platform)
+    end
+
     def default_gemfile
       SharedHelpers.default_gemfile
     end
@@ -505,24 +472,33 @@ module Bundler
     end
 
     def mkdir_p(path)
-      SharedHelpers.filesystem_access(path, :write) do |p|
+      SharedHelpers.filesystem_access(path, :create) do |p|
         FileUtils.mkdir_p(p)
       end
     end
 
     def which(executable)
-      if File.file?(executable) && File.executable?(executable)
-        executable
-      elsif paths = ENV["PATH"]
+      executable_path = find_executable(executable)
+      return executable_path if executable_path
+
+      if (paths = ENV["PATH"])
         quote = '"'
         paths.split(File::PATH_SEPARATOR).find do |path|
           path = path[1..-2] if path.start_with?(quote) && path.end_with?(quote)
-          executable_path = File.expand_path(executable, path)
-          return executable_path if File.file?(executable_path) && File.executable?(executable_path)
+          executable_path = find_executable(File.expand_path(executable, path))
+          return executable_path if executable_path
         end
       end
     end
 
+    def find_executable(path)
+      extensions = RbConfig::CONFIG["EXECUTABLE_EXTS"]&.split
+      extensions = [RbConfig::CONFIG["EXEEXT"]] unless extensions&.any?
+      candidates = extensions.map {|ext| "#{path}#{ext}" }
+
+      candidates.find {|candidate| File.file?(candidate) && File.executable?(candidate) }
+    end
+
     def read_file(file)
       SharedHelpers.filesystem_access(file, :read) do
         File.open(file, "r:UTF-8", &:read)
@@ -554,15 +530,7 @@ module Bundler
     def load_gemspec_uncached(file, validate = false)
       path = Pathname.new(file)
       contents = read_file(file)
-      spec = if contents.start_with?("---") # YAML header
-        eval_yaml_gemspec(path, contents)
-      else
-        # Eval the gemspec from its parent directory, because some gemspecs
-        # depend on "./" relative paths.
-        SharedHelpers.chdir(path.dirname.to_s) do
-          eval_gemspec(path, contents)
-        end
-      end
+      spec = eval_gemspec(path, contents)
       return unless spec
       spec.loaded_from = path.expand_path.to_s
       Bundler.rubygems.validate(spec) if validate
@@ -575,28 +543,11 @@ module Bundler
 
     def git_present?
       return @git_present if defined?(@git_present)
-      @git_present = Bundler.which("git#{RbConfig::CONFIG["EXEEXT"]}")
+      @git_present = Bundler.which("git")
     end
 
     def feature_flag
-      @feature_flag ||= FeatureFlag.new(VERSION)
-    end
-
-    def load_plugins(definition = Bundler.definition)
-      return if defined?(@load_plugins_ran)
-
-      Bundler.rubygems.load_plugins
-
-      requested_path_gems = definition.requested_specs.select {|s| s.source.is_a?(Source::Path) }
-      path_plugin_files = requested_path_gems.map do |spec|
-        Bundler.rubygems.spec_matches_for_glob(spec, "rubygems_plugin#{Bundler.rubygems.suffix_pattern}")
-      rescue TypeError
-        error_message = "#{spec.name} #{spec.version} has an invalid gemspec"
-        raise Gem::InvalidSpecificationException, error_message
-      end.flatten
-      Bundler.rubygems.load_plugin_files(path_plugin_files)
-      Bundler.rubygems.load_env_plugins
-      @load_plugins_ran = true
+      @feature_flag ||= FeatureFlag.new(Bundler.settings[:simulate_version] || VERSION)
     end
 
     def reset!
@@ -612,7 +563,6 @@ module Bundler
 
     def reset_paths!
       @bin_path = nil
-      @bundler_major_version = nil
       @bundle_path = nil
       @configure = nil
       @configured_bundle_path = nil
@@ -638,6 +588,15 @@ module Bundler
       Bundler.rubygems.clear_paths
     end
 
+    def configure_custom_gemfile(custom_gemfile = nil)
+      custom_gemfile ||= Bundler.settings[:gemfile]
+
+      if custom_gemfile && !custom_gemfile.empty?
+        Bundler::SharedHelpers.set_env "BUNDLE_GEMFILE", File.expand_path(custom_gemfile)
+        reset_settings_and_root!
+      end
+    end
+
     def self_manager
       @self_manager ||= begin
                           require_relative "bundler/self_manager"
@@ -647,6 +606,30 @@ module Bundler
 
     private
 
+    def unbundle_env(env)
+      if env.key?("BUNDLER_ORIG_MANPATH")
+        env["MANPATH"] = env["BUNDLER_ORIG_MANPATH"]
+      end
+
+      env.delete_if {|k, _| k[0, 7] == "BUNDLE_" }
+      env.delete("BUNDLER_SETUP")
+
+      if env.key?("RUBYOPT")
+        rubyopt = env["RUBYOPT"].split(" ")
+        rubyopt.delete("-r#{File.expand_path("bundler/setup", __dir__)}")
+        rubyopt.delete("-rbundler/setup")
+        env["RUBYOPT"] = rubyopt.join(" ")
+      end
+
+      if env.key?("RUBYLIB")
+        rubylib = env["RUBYLIB"].split(File::PATH_SEPARATOR)
+        rubylib.delete(__dir__)
+        env["RUBYLIB"] = rubylib.join(File::PATH_SEPARATOR)
+      end
+
+      env
+    end
+
     def load_marshal(data, marshal_proc: nil)
       Marshal.load(data, marshal_proc)
     rescue TypeError => e
@@ -657,16 +640,22 @@ module Bundler
       Kernel.require "psych"
 
       Gem::Specification.from_yaml(contents)
-    rescue ::Psych::SyntaxError, ArgumentError, Gem::EndOfYAMLException, Gem::Exception
-      eval_gemspec(path, contents)
     end
 
     def eval_gemspec(path, contents)
-      eval(contents, TOPLEVEL_BINDING.dup, path.expand_path.to_s)
+      if contents.start_with?("---") # YAML header
+        eval_yaml_gemspec(path, contents)
+      else
+        # Eval the gemspec from its parent directory, because some gemspecs
+        # depend on "./" relative paths.
+        SharedHelpers.chdir(path.dirname.to_s) do
+          eval(contents, TOPLEVEL_BINDING.dup, path.expand_path.to_s)
+        end
+      end
     rescue ScriptError, StandardError => e
       msg = "There was an error while loading `#{path.basename}`: #{e.message}"
 
-      raise GemspecError, Dsl::DSLError.new(msg, path, e.backtrace, contents)
+      raise GemspecError, Dsl::DSLError.new(msg, path.to_s, e.backtrace, contents)
     end
 
     def configure_gem_path
diff --git a/lib/bundler/build_metadata.rb b/lib/bundler/build_metadata.rb
index 5d2a8b53bb..49d2518078 100644
--- a/lib/bundler/build_metadata.rb
+++ b/lib/bundler/build_metadata.rb
@@ -4,21 +4,26 @@ module Bundler
   # Represents metadata from when the Bundler gem was built.
   module BuildMetadata
     # begin ivars
-    @release = false
+    @built_at = nil
     # end ivars
 
     # A hash representation of the build metadata.
     def self.to_h
       {
-        "Built At" => built_at,
+        "Timestamp" => timestamp,
         "Git SHA" => git_commit_sha,
-        "Released Version" => release?,
       }
     end
 
+    # A timestamp representing the date the bundler gem was built, or the
+    # current time if never built
+    def self.timestamp
+      @timestamp ||= @built_at || Time.now.utc.strftime("%Y-%m-%d").freeze
+    end
+
     # A string representing the date the bundler gem was built.
     def self.built_at
-      @built_at ||= Time.now.utc.strftime("%Y-%m-%d").freeze
+      @built_at
     end
 
     # The SHA for the git commit the bundler gem was built from.
@@ -34,10 +39,5 @@ module Bundler
 
       @git_commit_sha ||= "unknown"
     end
-
-    # Whether this is an official release build of Bundler.
-    def self.release?
-      @release
-    end
   end
 end
diff --git a/lib/bundler/bundler.gemspec b/lib/bundler/bundler.gemspec
index 2d6269fae1..49319e81b4 100644
--- a/lib/bundler/bundler.gemspec
+++ b/lib/bundler/bundler.gemspec
@@ -23,16 +23,16 @@ Gem::Specification.new do |s|
   s.description = "Bundler manages an application's dependencies through its entire life, across many machines, systematically and repeatably"
 
   s.metadata = {
-    "bug_tracker_uri" => "https://github.com/rubygems/rubygems/issues?q=is%3Aopen+is%3Aissue+label%3ABundler",
-    "changelog_uri" => "https://github.com/rubygems/rubygems/blob/master/bundler/CHANGELOG.md",
+    "bug_tracker_uri" => "https://github.com/ruby/rubygems/issues?q=is%3Aopen+is%3Aissue+label%3ABundler",
+    "changelog_uri" => "https://github.com/ruby/rubygems/blob/master/bundler/CHANGELOG.md",
     "homepage_uri" => "https://bundler.io/",
-    "source_code_uri" => "https://github.com/rubygems/rubygems/tree/master/bundler",
+    "source_code_uri" => "https://github.com/ruby/rubygems/tree/master/bundler",
   }
 
-  s.required_ruby_version     = ">= 3.0.0"
+  s.required_ruby_version     = ">= 3.2.0"
 
   # It should match the RubyGems version shipped with `required_ruby_version` above
-  s.required_rubygems_version = ">= 3.2.3"
+  s.required_rubygems_version = ">= 3.4.1"
 
   s.files = Dir.glob("lib/bundler{.rb,/**/*}", File::FNM_DOTMATCH).reject {|f| File.directory?(f) }
 
diff --git a/lib/bundler/capistrano.rb b/lib/bundler/capistrano.rb
index 705840143f..6d2437d895 100644
--- a/lib/bundler/capistrano.rb
+++ b/lib/bundler/capistrano.rb
@@ -1,22 +1,4 @@
 # frozen_string_literal: true
 
 require_relative "shared_helpers"
-Bundler::SharedHelpers.major_deprecation 2,
-  "The Bundler task for Capistrano. Please use https://github.com/capistrano/bundler"
-
-# Capistrano task for Bundler.
-#
-# Add "require 'bundler/capistrano'" in your Capistrano deploy.rb, and
-# Bundler will be activated after each new deployment.
-require_relative "deployment"
-require "capistrano/version"
-
-if defined?(Capistrano::Version) && Gem::Version.new(Capistrano::Version).release >= Gem::Version.new("3.0")
-  raise "For Capistrano 3.x integration, please use https://github.com/capistrano/bundler"
-end
-
-Capistrano::Configuration.instance(:must_exist).load do
-  before "deploy:finalize_update", "bundle:install"
-  Bundler::Deployment.define_task(self, :task, except: { no_release: true })
-  set :rake, lambda { "#{fetch(:bundle_cmd, "bundle")} exec rake" }
-end
+Bundler::SharedHelpers.feature_removed! "The Bundler task for Capistrano. Please use https://github.com/capistrano/bundler"
diff --git a/lib/bundler/checksum.rb b/lib/bundler/checksum.rb
index 60ba93417c..ce05818bb0 100644
--- a/lib/bundler/checksum.rb
+++ b/lib/bundler/checksum.rb
@@ -126,7 +126,7 @@ module Bundler
       end
 
       def removable?
-        type == :lock || type == :gem
+        [:lock, :gem].include?(type)
       end
 
       def ==(other)
@@ -190,7 +190,7 @@ module Bundler
       def replace(spec, checksum)
         return unless checksum
 
-        lock_name = spec.name_tuple.lock_name
+        lock_name = spec.lock_name
         @store_mutex.synchronize do
           existing = fetch_checksum(lock_name, checksum.algo)
           if !existing || existing.same_source?(checksum)
@@ -201,10 +201,18 @@ module Bundler
         end
       end
 
-      def register(spec, checksum)
-        return unless checksum
+      def missing?(spec)
+        @store[spec.lock_name].nil?
+      end
+
+      def empty?(spec)
+        return false unless spec.source.is_a?(Bundler::Source::Rubygems)
+
+        @store[spec.lock_name].empty?
+      end
 
-        register_checksum(spec.name_tuple.lock_name, checksum)
+      def register(spec, checksum)
+        register_checksum(spec.lock_name, checksum)
       end
 
       def merge!(other)
@@ -216,9 +224,9 @@ module Bundler
       end
 
       def to_lock(spec)
-        lock_name = spec.name_tuple.lock_name
+        lock_name = spec.lock_name
         checksums = @store[lock_name]
-        if checksums
+        if checksums&.any?
           "#{lock_name} #{checksums.values.map(&:to_lock).sort.join(",")}"
         else
           lock_name
@@ -229,11 +237,15 @@ module Bundler
 
       def register_checksum(lock_name, checksum)
         @store_mutex.synchronize do
-          existing = fetch_checksum(lock_name, checksum.algo)
-          if existing
-            merge_checksum(lock_name, checksum, existing)
+          if checksum
+            existing = fetch_checksum(lock_name, checksum.algo)
+            if existing
+              merge_checksum(lock_name, checksum, existing)
+            else
+              store_checksum(lock_name, checksum)
+            end
           else
-            store_checksum(lock_name, checksum)
+            init_checksum(lock_name)
           end
         end
       end
@@ -243,7 +255,11 @@ module Bundler
       end
 
       def store_checksum(lock_name, checksum)
-        (@store[lock_name] ||= {})[checksum.algo] = checksum
+        init_checksum(lock_name)[checksum.algo] = checksum
+      end
+
+      def init_checksum(lock_name)
+        @store[lock_name] ||= {}
       end
 
       def fetch_checksum(lock_name, algo)
diff --git a/lib/bundler/cli.rb b/lib/bundler/cli.rb
index eb67668cd2..9d8a68fff9 100644
--- a/lib/bundler/cli.rb
+++ b/lib/bundler/cli.rb
@@ -11,7 +11,7 @@ module Bundler
 
     AUTO_INSTALL_CMDS = %w[show binstubs outdated exec open console licenses clean].freeze
     PARSEABLE_COMMANDS = %w[check config help exec platform show version].freeze
-    EXTENSIONS = ["c", "rust"].freeze
+    EXTENSIONS = ["c", "rust", "go"].freeze
 
     COMMAND_ALIASES = {
       "check" => "c",
@@ -24,7 +24,7 @@ module Bundler
     }.freeze
 
     def self.start(*)
-      check_deprecated_ext_option(ARGV) if ARGV.include?("--ext")
+      check_invalid_ext_option(ARGV) if ARGV.include?("--ext")
 
       super
     ensure
@@ -59,17 +59,29 @@ module Bundler
     def initialize(*args)
       super
 
-      custom_gemfile = options[:gemfile] || Bundler.settings[:gemfile]
-      if custom_gemfile && !custom_gemfile.empty?
-        Bundler::SharedHelpers.set_env "BUNDLE_GEMFILE", File.expand_path(custom_gemfile)
-        Bundler.reset_settings_and_root!
+      current_cmd = args.last[:current_command].name
+
+      # `bundle config` manages stored settings, so avoid promoting settings
+      # like `gemfile` or `lockfile` to environment variables before it runs.
+      unless current_cmd == "config"
+        Bundler.configure_custom_gemfile(options[:gemfile])
+
+        # lock --lockfile works differently than install --lockfile
+        unless current_cmd == "lock"
+          custom_lockfile = options[:lockfile] || ENV["BUNDLE_LOCKFILE"] || Bundler.settings[:lockfile]
+          if custom_lockfile && !custom_lockfile.empty?
+            Bundler::SharedHelpers.set_env "BUNDLE_LOCKFILE", File.expand_path(custom_lockfile)
+            reset_settings = true
+          end
+        end
       end
 
-      Bundler.self_manager.restart_with_locked_bundler_if_needed
+      Bundler.reset_settings_and_root! if reset_settings
+
+      Bundler.auto_switch
 
       Bundler.settings.set_command_option_if_given :retry, options[:retry]
 
-      current_cmd = args.last[:current_command].name
       Bundler.auto_install if AUTO_INSTALL_CMDS.include?(current_cmd)
     rescue UnknownArgumentError => e
       raise InvalidOption, e.message
@@ -77,7 +89,7 @@ module Bundler
       self.options ||= {}
       unprinted_warnings = Bundler.ui.unprinted_warnings
       Bundler.ui = UI::Shell.new(options)
-      Bundler.ui.level = "debug" if options["verbose"]
+      Bundler.ui.level = "debug" if options[:verbose] || Bundler.settings[:verbose]
       unprinted_warnings.each {|w| Bundler.ui.warn(w) }
     end
 
@@ -92,7 +104,7 @@ module Bundler
       primary_commands = ["install", "update", "cache", "exec", "config", "help"]
 
       list = self.class.printable_commands(true)
-      by_name = list.group_by {|name, _message| name.match(/^bundle (\w+)/)[1] }
+      by_name = list.group_by {|name, _message| name.match(/^bundler? (\w+)/)[1] }
       utilities = by_name.keys.sort - primary_commands
       primary_commands.map! {|name| (by_name[name] || raise("no primary command #{name}")).first }
       utilities.map! {|name| by_name[name].first }
@@ -107,16 +119,46 @@ module Bundler
       shell.say
       self.class.send(:class_options_help, shell)
     end
-    default_task(Bundler.feature_flag.default_cli_command)
+
+    desc "install_or_cli_help", "Deprecated alias of install", hide: true
+    def install_or_cli_help
+      Bundler.ui.warn <<~MSG
+        `bundle install_or_cli_help` is a deprecated alias of `bundle install`.
+        It might be called due to the 'default_cli_command' being set to 'install_or_cli_help',
+        if so fix that by running `bundle config set default_cli_command install --global`.
+      MSG
+      invoke_other_command("install")
+    end
+
+    def self.default_command(meth = nil)
+      return super if meth
+
+      unless Bundler.settings[:default_cli_command]
+        Bundler.ui.info <<~MSG
+          In a future version of Bundler, running `bundle` without argument will no longer run `bundle install`.
+          Instead, the `cli_help` command will be displayed. Please use `bundle install` explicitly for scripts like CI/CD.
+          You can use the future behavior now with `bundle config set default_cli_command cli_help --global`,
+          or you can continue to use the current behavior with `bundle config set default_cli_command install --global`.
+          This message will be removed after a default_cli_command value is set.
+
+        MSG
+      end
+
+      Bundler.settings[:default_cli_command] || "install"
+    end
 
     class_option "no-color", type: :boolean, desc: "Disable colorization in output"
-    class_option "retry",    type: :numeric, aliases: "-r", banner: "NUM",
-                             desc: "Specify the number of times you wish to attempt network commands"
+    class_option "retry", type: :numeric, aliases: "-r", banner: "NUM",
+                          desc: "Specify the number of times you wish to attempt network commands"
     class_option "verbose", type: :boolean, desc: "Enable verbose output mode", aliases: "-V"
 
     def help(cli = nil)
       cli = self.class.all_aliases[cli] if self.class.all_aliases[cli]
 
+      if Bundler.settings[:plugins] && Bundler::Plugin.command?(cli) && !self.class.all_commands.key?(cli)
+        return Bundler::Plugin.exec_command(cli, ["--help"])
+      end
+
       case cli
       when "gemfile" then command = "gemfile"
       when nil       then command = "bundle"
@@ -130,7 +172,7 @@ module Bundler
 
       if man_pages.include?(command)
         man_page = man_pages[command]
-        if Bundler.which("man") && !man_path.match?(%r{^file:/.+!/META-INF/jruby.home/.+})
+        if Bundler.which("man") && !man_path.match?(%r{^(?:file:/.+!|uri:classloader:)/META-INF/jruby.home/.+})
           Kernel.exec("man", man_page)
         else
           puts File.read("#{man_path}/#{File.basename(man_page)}.ronn")
@@ -143,7 +185,7 @@ module Bundler
     end
 
     def self.handle_no_command_error(command, has_namespace = $thor_runner)
-      if Bundler.feature_flag.plugins? && Bundler::Plugin.command?(command)
+      if Bundler.settings[:plugins] && Bundler::Plugin.command?(command)
         return Bundler::Plugin.exec_command(command, ARGV[1..-1])
       end
 
@@ -173,7 +215,7 @@ module Bundler
     D
     method_option "dry-run", type: :boolean, default: false, banner: "Lock the Gemfile"
     method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
-    method_option "path", type: :string, banner: "Specify a different path than the system default ($BUNDLE_PATH or $GEM_HOME).#{" Bundler will remember this value for future installs on this machine" unless Bundler.feature_flag.forget_cli_options?}"
+    method_option "path", type: :string, banner: "Specify a different path than the system default, namely, $BUNDLE_PATH or $GEM_HOME (removed)"
     def check
       remembered_flag_deprecation("path")
 
@@ -187,12 +229,11 @@ module Bundler
     long_desc <<-D
       Removes the given gems from the Gemfile while ensuring that the resulting Gemfile is still valid. If the gem is not found, Bundler prints a error message and if gem could not be removed due to any reason Bundler will display a warning.
     D
-    method_option "install", type: :boolean, banner: "Runs 'bundle install' after removing the gems from the Gemfile"
+    method_option "install", type: :boolean, banner: "Runs 'bundle install' after removing the gems from the Gemfile (removed)"
     def remove(*gems)
       if ARGV.include?("--install")
-        message = "The `--install` flag has been deprecated. `bundle install` is triggered by default."
         removed_message = "The `--install` flag has been removed. `bundle install` is triggered by default."
-        SharedHelpers.major_deprecation(2, message, removed_message: removed_message)
+        raise InvalidOption, removed_message
       end
 
       require_relative "cli/remove"
@@ -210,42 +251,53 @@ module Bundler
 
       If the bundle has already been installed, bundler will tell you so and then exit.
     D
-    method_option "binstubs", type: :string, lazy_default: "bin", banner: "Generate bin stubs for bundled gems to ./bin"
-    method_option "clean", type: :boolean, banner: "Run bundle clean automatically after install"
-    method_option "deployment", type: :boolean, banner: "Install using defaults tuned for deployment environments"
-    method_option "frozen", type: :boolean, banner: "Do not allow the Gemfile.lock to be updated after this install"
+    method_option "binstubs", type: :string, lazy_default: "bin", banner: "Generate bin stubs for bundled gems to ./bin (removed)"
+    method_option "clean", type: :boolean, banner: "Run bundle clean automatically after install (removed)"
+    method_option "deployment", type: :boolean, banner: "Install using defaults tuned for deployment environments (removed)"
+    method_option "frozen", type: :boolean, banner: "Do not allow the Gemfile.lock to be updated after this install (removed)"
     method_option "full-index", type: :boolean, banner: "Fall back to using the single-file index of all gems"
     method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
     method_option "jobs", aliases: "-j", type: :numeric, banner: "Specify the number of jobs to run in parallel"
-    method_option "local", type: :boolean, banner:       "Do not attempt to fetch gems remotely and use the gem cache instead"
+    method_option "local", type: :boolean, banner: "Do not attempt to fetch gems remotely and use the gem cache instead"
+    method_option "lockfile", type: :string, banner: "Use the specified lockfile instead of the default."
     method_option "prefer-local", type: :boolean, banner: "Only attempt to fetch gems remotely if not present locally, even if newer versions are available remotely"
     method_option "no-cache", type: :boolean, banner: "Don't update the existing gem cache."
-    method_option "redownload", type: :boolean, aliases: "--force", banner: "Force downloading every gem."
-    method_option "no-prune", type: :boolean, banner: "Don't remove stale gems from the cache."
-    method_option "path", type: :string, banner: "Specify a different path than the system default ($BUNDLE_PATH or $GEM_HOME).#{" Bundler will remember this value for future installs on this machine" unless Bundler.feature_flag.forget_cli_options?}"
+    method_option "no-lock", type: :boolean, banner: "Don't create a lockfile."
+    method_option "force", type: :boolean, aliases: "--redownload", banner: "Force reinstalling every gem, even if already installed"
+    method_option "no-prune", type: :boolean, banner: "Don't remove stale gems from the cache (removed)."
+    method_option "path", type: :string, banner: "Specify a different path than the system default, namely, $BUNDLE_PATH or $GEM_HOME (removed)."
     method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
-    method_option "shebang", type: :string, banner: "Specify a different shebang executable name than the default (usually 'ruby')"
+    method_option "shebang", type: :string, banner: "Specify a different shebang executable name than the default, usually 'ruby' (removed)"
     method_option "standalone", type: :array, lazy_default: [], banner: "Make a bundle that can work without the Bundler runtime"
-    method_option "system", type: :boolean, banner: "Install to the system location ($BUNDLE_PATH or $GEM_HOME) even if the bundle was previously installed somewhere else for this application"
-    method_option "trust-policy", alias: "P", type: :string, banner:       "Gem trust policy (like gem install -P). Must be one of " +
-                                                                           Bundler.rubygems.security_policy_keys.join("|")
-    method_option "without", type: :array, banner: "Exclude gems that are part of the specified named group."
-    method_option "with", type: :array, banner: "Include gems that are part of the specified named group."
+    method_option "system", type: :boolean, banner: "Install to the system location ($BUNDLE_PATH or $GEM_HOME) even if the bundle was previously installed somewhere else for this application (removed)"
+    method_option "trust-policy", alias: "P", type: :string, banner: "Gem trust policy (like gem install -P). Must be one of #{Bundler.rubygems.security_policy_keys.join("|")}"
+    method_option "target-rbconfig", type: :string, banner: "Path to rbconfig.rb for the deployment target platform"
+    method_option "without", type: :array, banner: "Exclude gems that are part of the specified named group (removed)."
+    method_option "with", type: :array, banner: "Include gems that are part of the specified named group (removed)."
+    method_option "cooldown", type: :numeric, banner: "Only consider gem versions published at least N days ago. Use 0 to disable."
     def install
-      SharedHelpers.major_deprecation(2, "The `--force` option has been renamed to `--redownload`") if ARGV.include?("--force")
-
       %w[clean deployment frozen no-prune path shebang without with].each do |option|
         remembered_flag_deprecation(option)
       end
 
       print_remembered_flag_deprecation("--system", "path.system", "true") if ARGV.include?("--system")
 
-      remembered_negative_flag_deprecation("no-deployment")
+      remembered_flag_deprecation("deployment", negative: true)
+
+      if ARGV.include?("--binstubs")
+        removed_message = "The --binstubs option has been removed in favor of `bundle binstubs --all`"
+        raise InvalidOption, removed_message
+      end
 
       require_relative "cli/install"
+      options = self.options.dup
+      options["lockfile"] ||= ENV["BUNDLE_LOCKFILE"]
       Bundler.settings.temporary(no_install: false) do
-        Install.new(options.dup).run
+        Install.new(options).run
       end
+    rescue GemfileNotFound => error
+      invoke_other_command("cli_help")
+      raise error # re-raise to show the error and get a failing exit status
     end
 
     map aliases_for("install")
@@ -260,21 +312,21 @@ module Bundler
     method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
     method_option "group", aliases: "-g", type: :array, banner: "Update a specific group"
     method_option "jobs", aliases: "-j", type: :numeric, banner: "Specify the number of jobs to run in parallel"
-    method_option "local", type: :boolean, banner:       "Do not attempt to fetch gems remotely and use the gem cache instead"
-    method_option "quiet", type: :boolean, banner:       "Only output warnings and errors."
+    method_option "local", type: :boolean, banner: "Do not attempt to fetch gems remotely and use the gem cache instead"
+    method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
     method_option "source", type: :array, banner: "Update a specific source (and all gems associated with it)"
-    method_option "redownload", type: :boolean, aliases: "--force", banner: "Force downloading every gem."
+    method_option "force", type: :boolean, aliases: "--redownload", banner: "Force reinstalling every gem, even if already installed"
     method_option "ruby", type: :boolean, banner: "Update ruby specified in Gemfile.lock"
     method_option "bundler", type: :string, lazy_default: "> 0.a", banner: "Update the locked version of bundler"
-    method_option "patch", type: :boolean, banner:       "Prefer updating only to next patch version"
-    method_option "minor", type: :boolean, banner:       "Prefer updating only to next minor version"
-    method_option "major", type: :boolean, banner:       "Prefer updating to next major version (default)"
+    method_option "patch", type: :boolean, banner: "Prefer updating only to next patch version"
+    method_option "minor", type: :boolean, banner: "Prefer updating only to next minor version"
+    method_option "major", type: :boolean, banner: "Prefer updating to next major version (default)"
     method_option "pre", type: :boolean, banner: "Always choose the highest allowed version when updating gems, regardless of prerelease status"
     method_option "strict", type: :boolean, banner: "Do not allow any gem to be updated past latest --patch | --minor | --major"
     method_option "conservative", type: :boolean, banner: "Use bundle install conservative update behavior and do not allow shared dependencies to be updated."
     method_option "all", type: :boolean, banner: "Update everything."
+    method_option "cooldown", type: :numeric, banner: "Only consider gem versions published at least N days ago. Use 0 to disable."
     def update(*gems)
-      SharedHelpers.major_deprecation(2, "The `--force` option has been renamed to `--redownload`") if ARGV.include?("--force")
       require_relative "cli/update"
       Bundler.settings.temporary(no_install: false) do
         Update.new(options, gems).run
@@ -286,15 +338,12 @@ module Bundler
       Show lists the names and versions of all gems that are required by your Gemfile.
       Calling show with [GEM] will list the exact location of that gem on your machine.
     D
-    method_option "paths", type: :boolean,
-                           banner: "List the paths of all gems that are required by your Gemfile."
-    method_option "outdated", type: :boolean,
-                              banner: "Show verbose output including whether gems are outdated."
+    method_option "paths", type: :boolean, banner: "List the paths of all gems that are required by your Gemfile."
+    method_option "outdated", type: :boolean, banner: "Show verbose output including whether gems are outdated (removed)."
     def show(gem_name = nil)
       if ARGV.include?("--outdated")
-        message = "the `--outdated` flag to `bundle show` was undocumented and will be removed without replacement"
-        removed_message = "the `--outdated` flag to `bundle show` was undocumented and has been removed without replacement"
-        SharedHelpers.major_deprecation(2, message, removed_message: removed_message)
+        removed_message = "the `--outdated` flag to `bundle show` has been removed in favor of `bundle show --verbose`"
+        raise InvalidOption, removed_message
       end
       require_relative "cli/show"
       Show.new(options, gem_name).run
@@ -304,6 +353,7 @@ module Bundler
     method_option "name-only", type: :boolean, banner: "print only the gem names"
     method_option "only-group", type: :array, default: [], banner: "print gems from a given set of groups"
     method_option "without-group", type: :array, default: [], banner: "print all gems except from a given set of groups"
+    method_option "format", type: :string, banner: "format output ('json' is the only supported format)"
     method_option "paths", type: :boolean, banner: "print the path to each gem in the bundle"
     def list
       require_relative "cli/list"
@@ -327,12 +377,14 @@ module Bundler
       will create binstubs for all given gems.
     D
     method_option "force", type: :boolean, default: false, banner: "Overwrite existing binstubs if they exist"
-    method_option "path", type: :string, lazy_default: "bin", banner: "Binstub destination directory (default bin)"
+    method_option "path", type: :string, lazy_default: "bin", banner: "Binstub destination directory, `bin` by default (removed)"
     method_option "shebang", type: :string, banner: "Specify a different shebang executable name than the default (usually 'ruby')"
     method_option "standalone", type: :boolean, banner: "Make binstubs that can work without the Bundler runtime"
     method_option "all", type: :boolean, banner: "Install binstubs for all gems"
     method_option "all-platforms", type: :boolean, default: false, banner: "Install binstubs for all platforms"
     def binstubs(*gems)
+      remembered_flag_deprecation("path", option_name: "bin")
+
       require_relative "cli/binstubs"
       Binstubs.new(options, gems).run
     end
@@ -351,9 +403,12 @@ module Bundler
     method_option "branch", type: :string
     method_option "ref", type: :string
     method_option "glob", type: :string, banner: "The location of a dependency's .gemspec, expanded within Ruby (single quotes recommended)"
+    method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
     method_option "skip-install", type: :boolean, banner: "Adds gem to the Gemfile but does not install it"
-    method_option "optimistic", type: :boolean, banner: "Adds optimistic declaration of version to gem"
+    method_option "optimistic", type: :boolean, banner: "Ignored (now default behavior)"
+    method_option "pessimistic", type: :boolean, banner: "Adds pessimistic declaration of version to gem"
     method_option "strict", type: :boolean, banner: "Adds strict declaration of version to gem"
+    method_option "cooldown", type: :numeric, banner: "Only consider gem versions published at least N days ago. Use 0 to disable."
     def add(*gems)
       require_relative "cli/add"
       Add.new(options.dup, gems).run
@@ -384,6 +439,7 @@ module Bundler
     method_option "filter-patch", type: :boolean, banner: "Only list patch newer versions"
     method_option "parseable", aliases: "--porcelain", type: :boolean, banner: "Use minimal formatting for more parseable output"
     method_option "only-explicit", type: :boolean, banner: "Only list gems specified in your Gemfile, not their dependencies"
+    method_option "cooldown", type: :numeric, banner: "Only consider gem versions published at least N days ago. Use 0 to disable."
     def outdated(*gems)
       require_relative "cli/outdated"
       Outdated.new(options, gems).run
@@ -397,17 +453,15 @@ module Bundler
     end
 
     desc "cache [OPTIONS]", "Locks and then caches all of the gems into vendor/cache"
-    method_option "all",  type: :boolean,
-                          default: Bundler.feature_flag.cache_all?,
-                          banner: "Include all sources (including path and git)."
+    method_option "all", type: :boolean, default: Bundler.settings[:cache_all], banner: "Include all sources (including path and git) (removed)."
     method_option "all-platforms", type: :boolean, banner: "Include gems for all platforms present in the lockfile, not only the current one"
-    method_option "cache-path", type: :string, banner:       "Specify a different cache path than the default (vendor/cache)."
+    method_option "cache-path", type: :string, banner: "Specify a different cache path than the default (vendor/cache)."
     method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
     method_option "no-install", type: :boolean, banner: "Don't install the gems, only update the cache."
-    method_option "no-prune", type: :boolean, banner: "Don't remove stale gems from the cache."
-    method_option "path", type: :string, banner: "Specify a different path than the system default ($BUNDLE_PATH or $GEM_HOME).#{" Bundler will remember this value for future installs on this machine" unless Bundler.feature_flag.forget_cli_options?}"
+    method_option "no-prune", type: :boolean, banner: "Don't remove stale gems from the cache (removed)."
+    method_option "path", type: :string, banner: "Specify a different path than the system default, namely, $BUNDLE_PATH or $GEM_HOME (removed)."
     method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
-    method_option "frozen", type: :boolean, banner: "Do not allow the Gemfile.lock to be updated after this bundle cache operation's install"
+    method_option "frozen", type: :boolean, banner: "Do not allow the Gemfile.lock to be updated after this bundle cache operation's install (removed)"
     long_desc <<-D
       The cache command will copy the .gem files for every gem in the bundle into the
       directory ./vendor/cache. If you then check that directory into your source
@@ -416,18 +470,19 @@ module Bundler
     D
     def cache
       print_remembered_flag_deprecation("--all", "cache_all", "true") if ARGV.include?("--all")
+      print_remembered_flag_deprecation("--no-all", "cache_all", "false") if ARGV.include?("--no-all")
 
-      if ARGV.include?("--path")
-        message =
-          "The `--path` flag is deprecated because its semantics are unclear. " \
-          "Use `bundle config cache_path` to configure the path of your cache of gems, " \
-          "and `bundle config path` to configure the path where your gems are installed, " \
-          "and stop using this flag"
+      %w[frozen no-prune].each do |option|
+        remembered_flag_deprecation(option)
+      end
+
+      if flag_passed?("--path")
         removed_message =
           "The `--path` flag has been removed because its semantics were unclear. " \
           "Use `bundle config cache_path` to configure the path of your cache of gems, " \
-          "and `bundle config path` to configure the path where your gems are installed."
-        SharedHelpers.major_deprecation 2, message, removed_message: removed_message
+          "and `bundle config path` to configure the path where your gems are installed, " \
+          "and stop using this flag"
+        raise InvalidOption, removed_message
       end
 
       require_relative "cli/cache"
@@ -437,8 +492,8 @@ module Bundler
     map aliases_for("cache")
 
     desc "exec [OPTIONS]", "Run the command in context of the bundle"
-    method_option :keep_file_descriptors, type: :boolean, default: true
-    method_option :gemfile, type: :string, required: false
+    method_option :keep_file_descriptors, type: :boolean, default: true, banner: "Passes all file descriptors to the new processes. Default is true, and setting it to false is not permitted (removed)."
+    method_option :gemfile, type: :string, required: false, banner: "Use the specified gemfile instead of Gemfile"
     long_desc <<-D
       Exec runs a command, providing it access to the gems in the bundle. While using
       bundle exec you can require and call the bundled gems as if they were installed
@@ -446,9 +501,8 @@ module Bundler
     D
     def exec(*args)
       if ARGV.include?("--no-keep-file-descriptors")
-        message = "The `--no-keep-file-descriptors` has been deprecated. `bundle exec` no longer mess with your file descriptors. Close them in the exec'd script if you need to"
         removed_message = "The `--no-keep-file-descriptors` has been removed. `bundle exec` no longer mess with your file descriptors. Close them in the exec'd script if you need to"
-        SharedHelpers.major_deprecation(2, message, removed_message: removed_message)
+        raise InvalidOption, removed_message
       end
 
       require_relative "cli/exec"
@@ -479,25 +533,23 @@ module Bundler
       Open.new(options, name).run
     end
 
-    unless Bundler.feature_flag.bundler_3_mode?
-      desc "console [GROUP]", "Opens an IRB session with the bundle pre-loaded"
-      def console(group = nil)
-        require_relative "cli/console"
-        Console.new(options, group).run
-      end
+    desc "console [GROUP]", "Opens an IRB session with the bundle pre-loaded"
+    def console(group = nil)
+      require_relative "cli/console"
+      Console.new(options, group).run
     end
 
     desc "version", "Prints Bundler version information"
     def version
       cli_help = current_command.name == "cli_help"
       if cli_help || ARGV.include?("version")
-        build_info = " (#{BuildMetadata.built_at} commit #{BuildMetadata.git_commit_sha})"
+        build_info = " (#{BuildMetadata.timestamp} commit #{BuildMetadata.git_commit_sha})"
       end
 
-      if !cli_help && Bundler.feature_flag.print_only_version_number?
-        Bundler.ui.info "#{Bundler::VERSION}#{build_info}"
+      if !cli_help
+        Bundler.ui.info "#{Bundler.verbose_version}#{build_info}"
       else
-        Bundler.ui.info "Bundler version #{Bundler::VERSION}#{build_info}"
+        Bundler.ui.info "Bundler version #{Bundler.verbose_version}#{build_info}"
       end
     end
 
@@ -517,76 +569,43 @@ module Bundler
       end
     end
 
-    unless Bundler.feature_flag.bundler_3_mode?
-      desc "viz [OPTIONS]", "Generates a visual dependency graph", hide: true
-      long_desc <<-D
-        Viz generates a PNG file of the current Gemfile as a dependency graph.
-        Viz requires the ruby-graphviz gem (and its dependencies).
-        The associated gems must also be installed via 'bundle install'.
-      D
-      method_option :file, type: :string, default: "gem_graph", aliases: "-f", desc: "The name to use for the generated file. see format option"
-      method_option :format, type: :string, default: "png", aliases: "-F", desc: "This is output format option. Supported format is png, jpg, svg, dot ..."
-      method_option :requirements, type: :boolean, default: false, aliases: "-R", desc: "Set to show the version of each required dependency."
-      method_option :version, type: :boolean, default: false, aliases: "-v", desc: "Set to show each gem version."
-      method_option :without, type: :array, default: [], aliases: "-W", banner: "GROUP[ GROUP...]", desc: "Exclude gems that are part of the specified named group."
-      def viz
-        SharedHelpers.major_deprecation 2, "The `viz` command has been renamed to `graph` and moved to a plugin. See https://github.com/rubygems/bundler-graph"
-        require_relative "cli/viz"
-        Viz.new(options.dup).run
-      end
+    desc "viz [OPTIONS]", "Generates a visual dependency graph", hide: true
+    def viz
+      SharedHelpers.feature_removed! "The `viz` command has been renamed to `graph` and moved to a plugin. See https://github.com/rubygems/bundler-graph"
     end
 
-    old_gem = instance_method(:gem)
-
     desc "gem NAME [OPTIONS]", "Creates a skeleton for creating a rubygem"
-    method_option :exe, type: :boolean, default: false, aliases: ["--bin", "-b"], desc: "Generate a binary executable for your library."
-    method_option :coc, type: :boolean, desc: "Generate a code of conduct file. Set a default with `bundle config set --global gem.coc true`."
-    method_option :edit, type: :string, aliases: "-e", required: false, banner: "EDITOR",
-                         lazy_default: [ENV["BUNDLER_EDITOR"], ENV["VISUAL"], ENV["EDITOR"]].find {|e| !e.nil? && !e.empty? },
-                         desc: "Open generated gemspec in the specified editor (defaults to $EDITOR or $BUNDLER_EDITOR)"
-    method_option :ext, type: :string, desc: "Generate the boilerplate for C extension code.", enum: EXTENSIONS
-    method_option :git, type: :boolean, default: true, desc: "Initialize a git repo inside your library."
-    method_option :mit, type: :boolean, desc: "Generate an MIT license file. Set a default with `bundle config set --global gem.mit true`."
-    method_option :rubocop, type: :boolean, desc: "Add rubocop to the generated Rakefile and gemspec. Set a default with `bundle config set --global gem.rubocop true`."
-    method_option :changelog, type: :boolean, desc: "Generate changelog file. Set a default with `bundle config set --global gem.changelog true`."
-    method_option :test, type: :string, lazy_default: Bundler.settings["gem.test"] || "", aliases: "-t", banner: "Use the specified test framework for your library",
-                         desc: "Generate a test directory for your library, either rspec, minitest or test-unit. Set a default with `bundle config set --global gem.test (rspec|minitest|test-unit)`."
-    method_option :ci, type: :string, lazy_default: Bundler.settings["gem.ci"] || "",
-                       desc: "Generate CI configuration, either GitHub Actions, GitLab CI or CircleCI. Set a default with `bundle config set --global gem.ci (github|gitlab|circle)`"
-    method_option :linter, type: :string, lazy_default: Bundler.settings["gem.linter"] || "",
-                           desc: "Add a linter and code formatter, either RuboCop or Standard. Set a default with `bundle config set --global gem.linter (rubocop|standard)`"
+    method_option :exe, type: :boolean, default: false, aliases: ["--bin", "-b"], banner: "Generate a binary executable for your library."
+    method_option :coc, type: :boolean, banner: "Generate a code of conduct file. Set a default with `bundle config set --global gem.coc true`."
+    method_option :edit, type: :string, aliases: "-e", required: false, lazy_default: [ENV["BUNDLER_EDITOR"], ENV["VISUAL"], ENV["EDITOR"]].find {|e| !e.nil? && !e.empty? }, banner: "Open generated gemspec in the specified editor (defaults to $EDITOR or $BUNDLER_EDITOR)"
+    method_option :ext, type: :string, banner: "Generate the boilerplate for C extension code.", enum: EXTENSIONS
+    method_option :git, type: :boolean, default: true, banner: "Initialize a git repo inside your library."
+    method_option :mit, type: :boolean, banner: "Generate an MIT license file. Set a default with `bundle config set --global gem.mit true`."
+    method_option :rubocop, type: :boolean, banner: "Add rubocop to the generated Rakefile and gemspec. Set a default with `bundle config set --global gem.rubocop true` (removed)."
+    method_option :changelog, type: :boolean, banner: "Generate changelog file. Set a default with `bundle config set --global gem.changelog true`."
+    method_option :test, type: :string, lazy_default: Bundler.settings["gem.test"] || "", aliases: "-t", banner: "Use the specified test framework for your library", enum: %w[rspec minitest test-unit], desc: "Generate a test directory for your library, either rspec, minitest or test-unit. Set a default with `bundle config set --global gem.test (rspec|minitest|test-unit)`."
+    method_option :ci, type: :string, lazy_default: Bundler.settings["gem.ci"] || "", enum: %w[github gitlab circle], banner: "Generate CI configuration, either GitHub Actions, GitLab CI or CircleCI. Set a default with `bundle config set --global gem.ci (github|gitlab|circle)`"
+    method_option :linter, type: :string, lazy_default: Bundler.settings["gem.linter"] || "", enum: %w[rubocop standard], banner: "Add a linter and code formatter, either RuboCop or Standard. Set a default with `bundle config set --global gem.linter (rubocop|standard)`"
     method_option :github_username, type: :string, default: Bundler.settings["gem.github_username"], banner: "Set your username on GitHub", desc: "Fill in GitHub username on README so that you don't have to do it manually. Set a default with `bundle config set --global gem.github_username <your_username>`."
+    method_option :bundle, type: :boolean, default: Bundler.settings["gem.bundle"], banner: "Automatically run `bundle install` after creation. Set a default with `bundle config set --global gem.bundle true`"
 
     def gem(name)
-    end
+      require_relative "cli/gem"
 
-    commands["gem"].tap do |gem_command|
-      def gem_command.run(instance, args = [])
-        arity = 1 # name
+      raise InvalidOption, "--rubocop has been removed, use --linter=rubocop" if ARGV.include?("--rubocop")
+      raise InvalidOption, "--no-rubocop has been removed, use --no-linter" if ARGV.include?("--no-rubocop")
 
-        require_relative "cli/gem"
-        cmd_args = args + [instance]
-        cmd_args.unshift(instance.options)
+      cmd_args = args + [self]
+      cmd_args.unshift(options)
 
-        cmd = begin
-          Gem.new(*cmd_args)
-        rescue ArgumentError => e
-          instance.class.handle_argument_error(self, e, args, arity)
-        end
-
-        cmd.run
-      end
+      Gem.new(*cmd_args).run
     end
 
-    undef_method(:gem)
-    define_method(:gem, old_gem)
-    private :gem
-
     def self.source_root
       File.expand_path("templates", __dir__)
     end
 
-    desc "clean [OPTIONS]", "Cleans up unused gems in your bundler directory", hide: true
+    desc "clean [OPTIONS]", "Cleans up unused gems in your bundler directory"
     method_option "dry-run", type: :boolean, default: false, banner: "Only print out changes, do not clean gems"
     method_option "force", type: :boolean, default: false, banner: "Forces cleaning up unused gems even if Bundler is configured to use globally installed gems. As a consequence, removes all system gems except for the ones in the current application."
     def clean
@@ -602,26 +621,24 @@ module Bundler
     end
 
     desc "inject GEM VERSION", "Add the named gem, with version requirements, to the resolved Gemfile", hide: true
-    method_option "source", type: :string, banner:      "Install gem from the given source"
-    method_option "group", type: :string, banner: "Install gem into a bundler group"
-    def inject(name, version)
-      SharedHelpers.major_deprecation 2, "The `inject` command has been replaced by the `add` command"
-      require_relative "cli/inject"
-      Inject.new(options.dup, name, version).run
+    def inject(*)
+      SharedHelpers.feature_removed! "The `inject` command has been replaced by the `add` command"
     end
 
     desc "lock", "Creates a lockfile without installing"
     method_option "update", type: :array, lazy_default: true, banner: "ignore the existing lockfile, update all gems by default, or update list of given gems"
-    method_option "local", type: :boolean, default: false, banner:       "do not attempt to fetch remote gemspecs and use the local gem cache only"
-    method_option "print", type: :boolean, default: false, banner:       "print the lockfile to STDOUT instead of writing to the file system"
+    method_option "local", type: :boolean, default: false, banner: "do not attempt to fetch remote gemspecs and use the local gem cache only"
+    method_option "print", type: :boolean, default: false, banner: "print the lockfile to STDOUT instead of writing to the file system"
     method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
     method_option "lockfile", type: :string, default: nil, banner: "the path the lockfile should be written to"
     method_option "full-index", type: :boolean, default: false, banner: "Fall back to using the single-file index of all gems"
+    method_option "add-checksums", type: :boolean, default: false, banner: "Adds checksums to the lockfile"
     method_option "add-platform", type: :array, default: [], banner: "Add a new platform to the lockfile"
-    method_option "remove-platform", type: :array, default: [], banner:       "Remove a platform from the lockfile"
-    method_option "patch", type: :boolean, banner:       "If updating, prefer updating only to next patch version"
-    method_option "minor", type: :boolean, banner:       "If updating, prefer updating only to next minor version"
-    method_option "major", type: :boolean, banner:       "If updating, prefer updating to next major version (default)"
+    method_option "remove-platform", type: :array, default: [], banner: "Remove a platform from the lockfile"
+    method_option "normalize-platforms", type: :boolean, default: false, banner: "Normalize lockfile platforms"
+    method_option "patch", type: :boolean, banner: "If updating, prefer updating only to next patch version"
+    method_option "minor", type: :boolean, banner: "If updating, prefer updating only to next minor version"
+    method_option "major", type: :boolean, banner: "If updating, prefer updating to next major version (default)"
     method_option "pre", type: :boolean, banner: "If updating, always choose the highest allowed version, regardless of prerelease status"
     method_option "strict", type: :boolean, banner: "If updating, do not allow any gem to be updated past latest --patch | --minor | --major"
     method_option "conservative", type: :boolean, banner: "If updating, use bundle install conservative update behavior and do not allow shared dependencies to be updated"
@@ -637,17 +654,8 @@ module Bundler
     end
 
     desc "doctor [OPTIONS]", "Checks the bundle for common problems"
-    long_desc <<-D
-      Doctor scans the OS dependencies of each of the gems requested in the Gemfile. If
-      missing dependencies are detected, Bundler prints them and exits status 1.
-      Otherwise, Bundler prints a success message and exits with a status of 0.
-    D
-    method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
-    method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
-    def doctor
-      require_relative "cli/doctor"
-      Doctor.new(options).run
-    end
+    require_relative "cli/doctor"
+    subcommand("doctor", Doctor)
 
     desc "issue", "Learn how to report an issue in Bundler"
     def issue
@@ -668,7 +676,7 @@ module Bundler
       end
     end
 
-    if Bundler.feature_flag.plugins?
+    if Bundler.settings[:plugins]
       require_relative "cli/plugin"
       desc "plugin", "Manage the bundler plugins"
       subcommand "plugin", Plugin
@@ -702,18 +710,15 @@ module Bundler
       end
     end
 
-    def self.check_deprecated_ext_option(arguments)
-      # when deprecated version of `--ext` is called
-      # print out deprecation warning and pretend `--ext=c` was provided
-      if deprecated_ext_value?(arguments)
-        message = "Extensions can now be generated using C or Rust, so `--ext` with no arguments has been deprecated. Please select a language, e.g. `--ext=rust` to generate a Rust extension. This gem will now be generated as if `--ext=c` was used."
+    def self.check_invalid_ext_option(arguments)
+      # when invalid version of `--ext` is called
+      if invalid_ext_value?(arguments)
         removed_message = "Extensions can now be generated using C or Rust, so `--ext` with no arguments has been removed. Please select a language, e.g. `--ext=rust` to generate a Rust extension."
-        SharedHelpers.major_deprecation 2, message, removed_message: removed_message
-        arguments[arguments.index("--ext")] = "--ext=c"
+        raise InvalidOption, removed_message
       end
     end
 
-    def self.deprecated_ext_value?(arguments)
+    def self.invalid_ext_value?(arguments)
       index = arguments.index("--ext")
       next_argument = arguments[index + 1]
 
@@ -721,15 +726,15 @@ module Bundler
       # for example `bundle gem hello --ext c`
       return false if EXTENSIONS.include?(next_argument)
 
-      # deprecated call when --ext is called with no value in last position
+      # invalid call when --ext is called with no value in last position
       # for example `bundle gem hello_gem --ext`
       return true if next_argument.nil?
 
-      # deprecated call when --ext is followed by other parameter
+      # invalid call when --ext is followed by other parameter
       # for example `bundle gem --ext --no-ci hello_gem`
       return true if next_argument.start_with?("-")
 
-      # deprecated call when --ext is followed by gem name
+      # invalid call when --ext is followed by gem name
       # for example `bundle gem --ext hello_gem`
       return true if next_argument
 
@@ -743,6 +748,19 @@ module Bundler
       config[:current_command]
     end
 
+    def invoke_other_command(name)
+      _, _, config = @_initializer
+      original_command = config[:current_command]
+      command = self.class.all_commands[name]
+      config[:current_command] = command
+      send(name)
+    ensure
+      config[:current_command] = original_command
+    end
+
+    def current_command=(command)
+    end
+
     def print_command
       return unless Bundler.ui.debug?
       cmd = current_command
@@ -756,7 +774,7 @@ module Bundler
       end
       command << Thor::Options.to_switches(options_to_print.sort_by(&:first)).strip
       command.reject!(&:empty?)
-      Bundler.ui.info "Running `#{command * " "}` with bundler #{Bundler::VERSION}"
+      Bundler.ui.info "Running `#{command * " "}` with bundler #{Bundler.verbose_version}"
     end
 
     def warn_on_outdated_bundler
@@ -783,44 +801,30 @@ module Bundler
       nil
     end
 
-    def remembered_negative_flag_deprecation(name)
-      positive_name = name.gsub(/\Ano-/, "")
-      option = current_command.options[positive_name]
-      flag_name = "--no-" + option.switch_name.gsub(/\A--/, "")
-
-      flag_deprecation(positive_name, flag_name, option)
-    end
-
-    def remembered_flag_deprecation(name)
+    def remembered_flag_deprecation(name, negative: false, option_name: nil)
       option = current_command.options[name]
       flag_name = option.switch_name
-
-      flag_deprecation(name, flag_name, option)
-    end
-
-    def flag_deprecation(name, flag_name, option)
-      name_index = ARGV.find {|arg| flag_name == arg.split("=")[0] }
-      return unless name_index
+      flag_name = "--no-" + flag_name.gsub(/\A--/, "") if negative
+      return unless flag_passed?(flag_name)
 
       value = options[name]
       value = value.join(" ").to_s if option.type == :array
       value = "'#{value}'" unless option.type == :boolean
 
-      print_remembered_flag_deprecation(flag_name, name.tr("-", "_"), value)
+      print_remembered_flag_deprecation(flag_name, option_name || name.tr("-", "_"), value)
     end
 
     def print_remembered_flag_deprecation(flag_name, option_name, option_value)
-      message =
-        "The `#{flag_name}` flag is deprecated because it relies on being " \
-        "remembered across bundler invocations, which bundler will no longer " \
-        "do in future versions. Instead please use `bundle config set #{option_name} " \
-        "#{option_value}`, and stop using this flag"
       removed_message =
         "The `#{flag_name}` flag has been removed because it relied on being " \
-        "remembered across bundler invocations, which bundler will no longer " \
-        "do. Instead please use `bundle config set #{option_name} " \
-        "#{option_value}`, and stop using this flag"
-      Bundler::SharedHelpers.major_deprecation 2, message, removed_message: removed_message
+        "remembered across bundler invocations, which bundler no longer does. " \
+        "Instead please use `bundle config set #{option_name} #{option_value}`, " \
+        "and stop using this flag"
+      raise InvalidOption, removed_message
+    end
+
+    def flag_passed?(name)
+      ARGV.any? {|arg| name == arg.split("=")[0] }
     end
   end
 end
diff --git a/lib/bundler/cli/add.rb b/lib/bundler/cli/add.rb
index 002d9e1d33..20f76b59d1 100644
--- a/lib/bundler/cli/add.rb
+++ b/lib/bundler/cli/add.rb
@@ -12,6 +12,11 @@ module Bundler
     end
 
     def run
+      Bundler.ui.level = "warn" if options[:quiet]
+
+      Bundler::CLI::Common.validate_cooldown!(options[:cooldown])
+      Bundler.settings.set_command_option_if_given :cooldown, options[:cooldown]
+
       validate_options!
       inject_dependencies
       perform_bundle_install unless options["skip-install"]
@@ -29,12 +34,22 @@ module Bundler
 
       Injector.inject(dependencies,
         conservative_versioning: options[:version].nil?, # Perform conservative versioning only when version is not specified
-        optimistic: options[:optimistic],
+        pessimistic: options[:pessimistic],
         strict: options[:strict])
     end
 
     def validate_options!
-      raise InvalidOption, "You can not specify `--strict` and `--optimistic` at the same time." if options[:strict] && options[:optimistic]
+      raise InvalidOption, "You cannot specify `--git` and `--github` at the same time." if options["git"] && options["github"]
+
+      unless options["git"] || options["github"]
+        raise InvalidOption, "You cannot specify `--branch` unless `--git` or `--github` is specified." if options["branch"]
+
+        raise InvalidOption, "You cannot specify `--ref` unless `--git` or `--github` is specified." if options["ref"]
+      end
+
+      raise InvalidOption, "You cannot specify `--branch` and `--ref` at the same time." if options["branch"] && options["ref"]
+
+      raise InvalidOption, "You cannot specify `--strict` and `--pessimistic` at the same time." if options[:strict] && options[:pessimistic]
 
       # raise error when no gems are specified
       raise InvalidOption, "Please specify gems to add." if gems.empty?
diff --git a/lib/bundler/cli/cache.rb b/lib/bundler/cli/cache.rb
index 2e63a16ec3..59605df847 100644
--- a/lib/bundler/cli/cache.rb
+++ b/lib/bundler/cli/cache.rb
@@ -10,17 +10,12 @@ module Bundler
 
     def run
       Bundler.ui.level = "warn" if options[:quiet]
-      Bundler.settings.set_command_option_if_given :path, options[:path]
       Bundler.settings.set_command_option_if_given :cache_path, options["cache-path"]
 
-      setup_cache_all
       install
 
-      # TODO: move cache contents here now that all bundles are locked
-      custom_path = Bundler.settings[:path] if options[:path]
-
       Bundler.settings.temporary(cache_all_platforms: options["all-platforms"]) do
-        Bundler.load.cache(custom_path)
+        Bundler.load.cache
       end
     end
 
@@ -33,11 +28,5 @@ module Bundler
       options["no-cache"] = true
       Bundler::CLI::Install.new(options).run
     end
-
-    def setup_cache_all
-      all = options.fetch(:all, Bundler.feature_flag.cache_all? || nil)
-
-      Bundler.settings.set_command_option_if_given :cache_all, all
-    end
   end
 end
diff --git a/lib/bundler/cli/check.rb b/lib/bundler/cli/check.rb
index 33d31cdd27..493eb3ec6a 100644
--- a/lib/bundler/cli/check.rb
+++ b/lib/bundler/cli/check.rb
@@ -15,9 +15,9 @@ module Bundler
       definition.validate_runtime!
 
       begin
-        definition.resolve_only_locally!
+        definition.check!
         not_installed = definition.missing_specs
-      rescue GemNotFound, SolveFailure
+      rescue GemNotFound, GitError, SolveFailure
         Bundler.ui.error "Bundler can't satisfy your Gemfile's dependencies."
         Bundler.ui.warn "Install missing gems with `bundle install`."
         exit 1
@@ -32,7 +32,7 @@ module Bundler
         Bundler.ui.error "This bundle has been frozen, but there is no #{SharedHelpers.relative_lockfile_path} present"
         exit 1
       else
-        Bundler.load.lock(preserve_unknown_sections: true) unless options[:"dry-run"]
+        definition.lock(true) unless options[:"dry-run"]
         Bundler.ui.info "The Gemfile's dependencies are satisfied"
       end
     end
diff --git a/lib/bundler/cli/common.rb b/lib/bundler/cli/common.rb
index 7ef6deb2cf..b44fbc3096 100644
--- a/lib/bundler/cli/common.rb
+++ b/lib/bundler/cli/common.rb
@@ -2,6 +2,12 @@
 
 module Bundler
   module CLI::Common
+    def self.validate_cooldown!(value)
+      return if value.nil?
+      return if value.is_a?(Integer) && value >= 0
+      raise InvalidOption, "Expected `--cooldown` to be a non-negative integer, got #{value.inspect}"
+    end
+
     def self.output_post_install_messages(messages)
       return if Bundler.settings["ignore_messages"]
       messages.to_a.each do |name, msg|
@@ -94,11 +100,14 @@ module Bundler
     end
 
     def self.gem_not_found_message(missing_gem_name, alternatives)
-      require_relative "../similarity_detector"
       message = "Could not find gem '#{missing_gem_name}'."
       alternate_names = alternatives.map {|a| a.respond_to?(:name) ? a.name : a }
-      suggestions = SimilarityDetector.new(alternate_names).similar_word_list(missing_gem_name)
-      message += "\nDid you mean #{suggestions}?" if suggestions
+      if alternate_names.include?(missing_gem_name.downcase)
+        message += "\nDid you mean '#{missing_gem_name.downcase}'?"
+      elsif defined?(DidYouMean::SpellChecker)
+        suggestions = DidYouMean::SpellChecker.new(dictionary: alternate_names).correct(missing_gem_name)
+        message += "\nDid you mean #{word_list(suggestions)}?" unless suggestions.empty?
+      end
       message
     end
 
@@ -130,9 +139,23 @@ module Bundler
     def self.clean_after_install?
       clean = Bundler.settings[:clean]
       return clean unless clean.nil?
-      clean ||= Bundler.feature_flag.auto_clean_without_path? && Bundler.settings[:path].nil?
+      clean ||= Bundler.feature_flag.bundler_5_mode? && Bundler.settings[:path].nil?
       clean &&= !Bundler.use_system_gems?
       clean
     end
+
+    def self.word_list(words)
+      if words.empty?
+        return ""
+      end
+
+      words = words.map {|word| "'#{word}'" }
+
+      if words.length == 1
+        return words[0]
+      end
+
+      [words[0..-2].join(", "), words[-1]].join(" or ")
+    end
   end
 end
diff --git a/lib/bundler/cli/config.rb b/lib/bundler/cli/config.rb
index 77b502fe60..976cda7484 100644
--- a/lib/bundler/cli/config.rb
+++ b/lib/bundler/cli/config.rb
@@ -26,8 +26,7 @@ module Bundler
         end
 
       message = "Using the `config` command without a subcommand [list, get, set, unset] is deprecated and will be removed in the future. Use `bundle #{new_args.join(" ")}` instead."
-      removed_message = "Using the `config` command without a subcommand [list, get, set, unset] is has been removed. Use `bundle #{new_args.join(" ")}` instead."
-      SharedHelpers.major_deprecation 3, message, removed_message: removed_message
+      SharedHelpers.feature_deprecated! message
 
       Base.new(options, name, value, self).run
     end
@@ -88,16 +87,21 @@ module Bundler
 
         if value.nil?
           warn_unused_scope "Ignoring --#{scope} since no value to set was given"
+          current_value = Bundler.settings[name]
 
           if options[:parseable]
             if value = Bundler.settings[name]
               Bundler.ui.info("#{name}=#{value}")
             end
-            return
+          else
+            confirm(name)
           end
 
-          confirm(name)
-          return
+          if current_value.nil?
+            exit 1
+          else
+            return
+          end
         end
 
         Bundler.ui.info(message) if message
diff --git a/lib/bundler/cli/console.rb b/lib/bundler/cli/console.rb
index 840cf14fd7..2d1a2ce458 100644
--- a/lib/bundler/cli/console.rb
+++ b/lib/bundler/cli/console.rb
@@ -9,10 +9,6 @@ module Bundler
     end
 
     def run
-      message = "bundle console will be replaced by `bin/console` generated by `bundle gem <name>`"
-      removed_message = "bundle console has been replaced by `bin/console` generated by `bundle gem <name>`"
-      Bundler::SharedHelpers.major_deprecation 2, message, removed_message: removed_message
-
       group ? Bundler.require(:default, *group.split(" ").map!(&:to_sym)) : Bundler.require
       ARGV.clear
 
@@ -24,9 +20,19 @@ module Bundler
       require name
       get_constant(name)
     rescue LoadError
-      Bundler.ui.error "Couldn't load console #{name}, falling back to irb"
-      require "irb"
-      get_constant("irb")
+      if name == "irb"
+        if defined?(Gem::BUNDLED_GEMS) && Gem::BUNDLED_GEMS.respond_to?(:force_activate)
+          Gem::BUNDLED_GEMS.force_activate "irb"
+          require name
+          return get_constant(name)
+        end
+        Bundler.ui.error "#{name} is not available"
+        exit 1
+      else
+        Bundler.ui.error "Couldn't load console #{name}, falling back to irb"
+        name = "irb"
+        retry
+      end
     end
 
     def get_constant(name)
@@ -36,9 +42,6 @@ module Bundler
         "irb" => :IRB,
       }[name]
       Object.const_get(const_name)
-    rescue NameError
-      Bundler.ui.error "Could not find constant #{const_name}"
-      exit 1
     end
   end
 end
diff --git a/lib/bundler/cli/doctor.rb b/lib/bundler/cli/doctor.rb
index 1f6fc93c16..5fd6a73d91 100644
--- a/lib/bundler/cli/doctor.rb
+++ b/lib/bundler/cli/doctor.rb
@@ -1,157 +1,33 @@
 # frozen_string_literal: true
 
-require "rbconfig"
-require "shellwords"
-require "fiddle"
-
 module Bundler
-  class CLI::Doctor
-    DARWIN_REGEX = /\s+(.+) \(compatibility /
-    LDD_REGEX = /\t\S+ => (\S+) \(\S+\)/
-
-    attr_reader :options
-
-    def initialize(options)
-      @options = options
-    end
-
-    def otool_available?
-      Bundler.which("otool")
-    end
-
-    def ldd_available?
-      Bundler.which("ldd")
-    end
-
-    def dylibs_darwin(path)
-      output = `/usr/bin/otool -L #{path.shellescape}`.chomp
-      dylibs = output.split("\n")[1..-1].map {|l| l.match(DARWIN_REGEX).captures[0] }.uniq
-      # ignore @rpath and friends
-      dylibs.reject {|dylib| dylib.start_with? "@" }
-    end
-
-    def dylibs_ldd(path)
-      output = `/usr/bin/ldd #{path.shellescape}`.chomp
-      output.split("\n").map do |l|
-        match = l.match(LDD_REGEX)
-        next if match.nil?
-        match.captures[0]
-      end.compact
-    end
-
-    def dylibs(path)
-      case RbConfig::CONFIG["host_os"]
-      when /darwin/
-        return [] unless otool_available?
-        dylibs_darwin(path)
-      when /(linux|solaris|bsd)/
-        return [] unless ldd_available?
-        dylibs_ldd(path)
-      else # Windows, etc.
-        Bundler.ui.warn("Dynamic library check not supported on this platform.")
-        []
-      end
-    end
-
-    def bundles_for_gem(spec)
-      Dir.glob("#{spec.full_gem_path}/**/*.bundle")
-    end
-
-    def check!
-      require_relative "check"
-      Bundler::CLI::Check.new({}).run
-    end
-
-    def run
-      Bundler.ui.level = "warn" if options[:quiet]
-      Bundler.settings.validate!
-      check!
-
-      definition = Bundler.definition
-      broken_links = {}
-
-      definition.specs.each do |spec|
-        bundles_for_gem(spec).each do |bundle|
-          bad_paths = dylibs(bundle).select do |f|
-            Fiddle.dlopen(f)
-            false
-          rescue Fiddle::DLError
-            true
-          end
-          if bad_paths.any?
-            broken_links[spec] ||= []
-            broken_links[spec].concat(bad_paths)
-          end
-        end
-      end
-
-      permissions_valid = check_home_permissions
-
-      if broken_links.any?
-        message = "The following gems are missing OS dependencies:"
-        broken_links.map do |spec, paths|
-          paths.uniq.map do |path|
-            "\n * #{spec.name}: #{path}"
-          end
-        end.flatten.sort.each {|m| message += m }
-        raise ProductionError, message
-      elsif !permissions_valid
-        Bundler.ui.info "No issues found with the installed bundle"
-      end
-    end
-
-    private
-
-    def check_home_permissions
-      require "find"
-      files_not_readable_or_writable = []
-      files_not_rw_and_owned_by_different_user = []
-      files_not_owned_by_current_user_but_still_rw = []
-      broken_symlinks = []
-      Find.find(Bundler.bundle_path.to_s).each do |f|
-        if !File.exist?(f)
-          broken_symlinks << f
-        elsif !File.writable?(f) || !File.readable?(f)
-          if File.stat(f).uid != Process.uid
-            files_not_rw_and_owned_by_different_user << f
-          else
-            files_not_readable_or_writable << f
-          end
-        elsif File.stat(f).uid != Process.uid
-          files_not_owned_by_current_user_but_still_rw << f
-        end
-      end
-
-      ok = true
-
-      if broken_symlinks.any?
-        Bundler.ui.warn "Broken links exist in the Bundler home. Please report them to the offending gem's upstream repo. These files are:\n - #{broken_symlinks.join("\n - ")}"
-
-        ok = false
-      end
-
-      if files_not_owned_by_current_user_but_still_rw.any?
-        Bundler.ui.warn "Files exist in the Bundler home that are owned by another " \
-          "user, but are still readable/writable. These files are:\n - #{files_not_owned_by_current_user_but_still_rw.join("\n - ")}"
-
-        ok = false
-      end
-
-      if files_not_rw_and_owned_by_different_user.any?
-        Bundler.ui.warn "Files exist in the Bundler home that are owned by another " \
-          "user, and are not readable/writable. These files are:\n - #{files_not_rw_and_owned_by_different_user.join("\n - ")}"
-
-        ok = false
-      end
-
-      if files_not_readable_or_writable.any?
-        Bundler.ui.warn "Files exist in the Bundler home that are not " \
-          "readable/writable by the current user. These files are:\n - #{files_not_readable_or_writable.join("\n - ")}"
-
-        ok = false
-      end
-
-      ok
+  class CLI::Doctor < Thor
+    default_command(:diagnose)
+
+    desc "diagnose [OPTIONS]", "Checks the bundle for common problems"
+    long_desc <<-D
+      Doctor scans the OS dependencies of each of the gems requested in the Gemfile. If
+      missing dependencies are detected, Bundler prints them and exits status 1.
+      Otherwise, Bundler prints a success message and exits with a status of 0.
+    D
+    method_option "gemfile", type: :string, banner: "Use the specified gemfile instead of Gemfile"
+    method_option "quiet", type: :boolean, banner: "Only output warnings and errors."
+    method_option "ssl", type: :boolean, default: false, banner: "Diagnose SSL problems."
+    def diagnose
+      require_relative "doctor/diagnose"
+      Diagnose.new(options).run
+    end
+
+    desc "ssl [OPTIONS]", "Diagnose SSL problems"
+    long_desc <<-D
+      Diagnose SSL problems, especially related to certificates or TLS version while connecting to https://rubygems.org.
+    D
+    method_option "host", type: :string, banner: "The host to diagnose."
+    method_option "tls-version", type: :string, banner: "Specify the SSL/TLS version when running the diagnostic. Accepts either <1.1> or <1.2>"
+    method_option "verify-mode", type: :string, banner: "Specify the mode used for certification verification. Accepts either <peer> or <none>"
+    def ssl
+      require_relative "doctor/ssl"
+      SSL.new(options).run
     end
   end
 end
diff --git a/lib/bundler/cli/doctor/diagnose.rb b/lib/bundler/cli/doctor/diagnose.rb
new file mode 100644
index 0000000000..a878025dda
--- /dev/null
+++ b/lib/bundler/cli/doctor/diagnose.rb
@@ -0,0 +1,167 @@
+# frozen_string_literal: true
+
+require "rbconfig"
+require "shellwords"
+
+module Bundler
+  class CLI::Doctor::Diagnose
+    DARWIN_REGEX = /\s+(.+) \(compatibility /
+    LDD_REGEX = /\t\S+ => (\S+) \(\S+\)/
+
+    attr_reader :options
+
+    def initialize(options)
+      @options = options
+    end
+
+    def otool_available?
+      Bundler.which("otool")
+    end
+
+    def ldd_available?
+      Bundler.which("ldd")
+    end
+
+    def dylibs_darwin(path)
+      output = `/usr/bin/otool -L #{path.shellescape}`.chomp
+      dylibs = output.split("\n")[1..-1].filter_map {|l| l.match(DARWIN_REGEX)&.match(1) }.uniq
+      # ignore @rpath and friends
+      dylibs.reject {|dylib| dylib.start_with? "@" }
+    end
+
+    def dylibs_ldd(path)
+      output = `/usr/bin/ldd #{path.shellescape}`.chomp
+      output.split("\n").filter_map do |l|
+        match = l.match(LDD_REGEX)
+        next if match.nil?
+        match.captures[0]
+      end
+    end
+
+    def dylibs(path)
+      case RbConfig::CONFIG["host_os"]
+      when /darwin/
+        return [] unless otool_available?
+        dylibs_darwin(path)
+      when /(linux|solaris|bsd)/
+        return [] unless ldd_available?
+        dylibs_ldd(path)
+      else # Windows, etc.
+        Bundler.ui.warn("Dynamic library check not supported on this platform.")
+        []
+      end
+    end
+
+    def bundles_for_gem(spec)
+      Dir.glob("#{spec.full_gem_path}/**/*.bundle")
+    end
+
+    def lookup_with_fiddle(path)
+      require "fiddle"
+      Fiddle.dlopen(path)
+      false
+    rescue Fiddle::DLError
+      true
+    end
+
+    def check!
+      require_relative "../check"
+      Bundler::CLI::Check.new({}).run
+    end
+
+    def diagnose_ssl
+      require_relative "ssl"
+      Bundler::CLI::Doctor::SSL.new({}).run
+    end
+
+    def run
+      Bundler.ui.level = "warn" if options[:quiet]
+      Bundler.settings.validate!
+      check!
+      diagnose_ssl if options[:ssl]
+
+      definition = Bundler.definition
+      broken_links = {}
+
+      definition.specs.each do |spec|
+        bundles_for_gem(spec).each do |bundle|
+          bad_paths = dylibs(bundle).select do |f|
+            lookup_with_fiddle(f)
+          end
+          if bad_paths.any?
+            broken_links[spec] ||= []
+            broken_links[spec].concat(bad_paths)
+          end
+        end
+      end
+
+      permissions_valid = check_home_permissions
+
+      if broken_links.any?
+        message = "The following gems are missing OS dependencies:"
+        broken_links.flat_map do |spec, paths|
+          paths.uniq.map do |path|
+            "\n * #{spec.name}: #{path}"
+          end
+        end.sort.each {|m| message += m }
+        raise ProductionError, message
+      elsif permissions_valid
+        Bundler.ui.info "No issues found with the installed bundle"
+      end
+    end
+
+    private
+
+    def check_home_permissions
+      require "find"
+      files_not_readable = []
+      files_not_readable_and_owned_by_different_user = []
+      files_not_owned_by_current_user_but_still_readable = []
+      broken_symlinks = []
+      Find.find(Bundler.bundle_path.to_s).each do |f|
+        if !File.exist?(f)
+          broken_symlinks << f
+        elsif !File.readable?(f)
+          if File.stat(f).uid != Process.uid
+            files_not_readable_and_owned_by_different_user << f
+          else
+            files_not_readable << f
+          end
+        elsif File.stat(f).uid != Process.uid
+          files_not_owned_by_current_user_but_still_readable << f
+        end
+      end
+
+      ok = true
+
+      if broken_symlinks.any?
+        Bundler.ui.warn "Broken links exist in the Bundler home. Please report them to the offending gem's upstream repo. These files are:\n - #{broken_symlinks.join("\n - ")}"
+
+        ok = false
+      end
+
+      if files_not_owned_by_current_user_but_still_readable.any?
+        Bundler.ui.warn "Files exist in the Bundler home that are owned by another " \
+          "user, but are still readable. These files are:\n - #{files_not_owned_by_current_user_but_still_readable.join("\n - ")}"
+
+        ok = false
+      end
+
+      if files_not_readable_and_owned_by_different_user.any?
+        Bundler.ui.warn "Files exist in the Bundler home that are owned by another " \
+          "user, and are not readable. These files are:\n - #{files_not_readable_and_owned_by_different_user.join("\n - ")}"
+
+        ok = false
+      end
+
+      if files_not_readable.any?
+        Bundler.ui.warn "Files exist in the Bundler home that are not " \
+          "readable by the current user. These files are:\n - #{files_not_readable.join("\n - ")}"
+
+        ok = false
+      end
+
+      ok
+    end
+  end
+end
diff --git a/lib/bundler/cli/doctor/ssl.rb b/lib/bundler/cli/doctor/ssl.rb
new file mode 100644
index 0000000000..21fc4edf2d
--- /dev/null
+++ b/lib/bundler/cli/doctor/ssl.rb
@@ -0,0 +1,249 @@
+# frozen_string_literal: true
+
+require "rubygems/remote_fetcher"
+require "uri"
+
+module Bundler
+  class CLI::Doctor::SSL
+    attr_reader :options
+
+    def initialize(options)
+      @options = options
+    end
+
+    def run
+      return unless openssl_installed?
+
+      output_ssl_environment
+      bundler_success = bundler_connection_successful?
+      rubygem_success = rubygem_connection_successful?
+
+      return unless net_http_connection_successful?
+
+      Explanation.summarize(bundler_success, rubygem_success, host)
+    end
+
+    private
+
+    def host
+      @options[:host] || "rubygems.org"
+    end
+
+    def tls_version
+      @options[:"tls-version"].then do |version|
+        "TLS#{version.sub(".", "_")}".to_sym if version
+      end
+    end
+
+    def verify_mode
+      mode = @options[:"verify-mode"] || :peer
+
+      @verify_mode ||= mode.then {|mod| OpenSSL::SSL.const_get("verify_#{mod}".upcase) }
+    end
+
+    def uri
+      @uri ||= URI("https://#{host}")
+    end
+
+    def openssl_installed?
+      require "openssl"
+
+      true
+    rescue LoadError
+      Bundler.ui.warn(<<~MSG)
+        Oh no! Your Ruby doesn't have OpenSSL, so it can't connect to #{host}.
+        You'll need to recompile or reinstall Ruby with OpenSSL support and try again.
+      MSG
+
+      false
+    end
+
+    def output_ssl_environment
+      Bundler.ui.info(<<~MESSAGE)
+        Here's your OpenSSL environment:
+
+        OpenSSL:       #{OpenSSL::VERSION}
+        Compiled with: #{OpenSSL::OPENSSL_VERSION}
+        Loaded with:   #{OpenSSL::OPENSSL_LIBRARY_VERSION}
+      MESSAGE
+    end
+
+    def bundler_connection_successful?
+      Bundler.ui.info("\nTrying connections to #{uri}:\n")
+
+      bundler_uri = Gem::URI(uri.to_s)
+      Bundler::Fetcher.new(
+        Bundler::Source::Rubygems::Remote.new(bundler_uri)
+      ).send(:connection).request(bundler_uri)
+
+      Bundler.ui.info("Bundler:       success")
+
+      true
+    rescue StandardError => error
+      Bundler.ui.warn("Bundler:       failed     (#{Explanation.explain_bundler_or_rubygems_error(error)})")
+
+      false
+    end
+
+    def rubygem_connection_successful?
+      Gem::RemoteFetcher.fetcher.fetch_path(uri)
+      Bundler.ui.info("RubyGems:      success")
+
+      true
+    rescue StandardError => error
+      Bundler.ui.warn("RubyGems:      failed     (#{Explanation.explain_bundler_or_rubygems_error(error)})")
+
+      false
+    end
+
+    def net_http_connection_successful?
+      ::Gem::Net::HTTP.new(uri.host, uri.port).tap do |http|
+        http.use_ssl = true
+        http.min_version = tls_version
+        http.max_version = tls_version
+        http.verify_mode = verify_mode
+      end.start
+
+      Bundler.ui.info("Ruby net/http: success")
+      warn_on_unsupported_tls12
+
+      true
+    rescue StandardError => error
+      Bundler.ui.warn(<<~MSG)
+        Ruby net/http: failed
+
+        Unfortunately, this Ruby can't connect to #{host}.
+
+        #{Explanation.explain_net_http_error(error, host, tls_version)}
+      MSG
+
+      false
+    end
+
+    def warn_on_unsupported_tls12
+      ctx = OpenSSL::SSL::SSLContext.new
+      supported = true
+
+      if ctx.respond_to?(:min_version=)
+        begin
+          ctx.min_version = ctx.max_version = OpenSSL::SSL::TLS1_2_VERSION
+        rescue OpenSSL::SSL::SSLError, NameError
+          supported = false
+        end
+      else
+        supported = OpenSSL::SSL::SSLContext::METHODS.include?(:TLSv1_2) # rubocop:disable Naming/VariableNumber
+      end
+
+      Bundler.ui.warn(<<~EOM) unless supported
+
+        WARNING: Although your Ruby can connect to #{host} today, your OpenSSL is very old!
+        WARNING: You will need to upgrade OpenSSL to use #{host}.
+
+      EOM
+    end
+
+    module Explanation
+      extend self
+
+      def explain_bundler_or_rubygems_error(error)
+        case error.message
+        when /certificate verify failed/
+          "certificate verification"
+        when /read server hello A/
+          "SSL/TLS protocol version mismatch"
+        when /tlsv1 alert protocol version/
+          "requested TLS version is too old"
+        else
+          error.message
+        end
+      end
+
+      def explain_net_http_error(error, host, tls_version)
+        case error.message
+        # Check for certificate errors
+        when /certificate verify failed/
+          <<~MSG
+            #{show_ssl_certs}
+            Your Ruby can't connect to #{host} because you are missing the certificate files OpenSSL needs to verify you are connecting to the genuine #{host} servers.
+          MSG
+        # Check for TLS version errors
+        when /read server hello A/, /tlsv1 alert protocol version/
+          if tls_version.to_s == "TLS1_3"
+            "Your Ruby can't connect to #{host} because #{tls_version} isn't supported yet.\n"
+          else
+            <<~MSG
+              Your Ruby can't connect to #{host} because your version of OpenSSL is too old.
+              You'll need to upgrade your OpenSSL install and/or recompile Ruby to use a newer OpenSSL.
+            MSG
+          end
+        # OpenSSL doesn't support TLS version specified by argument
+        when /unknown SSL method/
+          "Your Ruby can't connect because #{tls_version} isn't supported by your version of OpenSSL."
+        else
+          <<~MSG
+            Even worse, we're not sure why.
+
+            Here's the full error information:
+            #{error.class}: #{error.message}
+              #{error.backtrace.join("\n  ")}
+
+            You might have more luck using Mislav's SSL doctor.rb script. You can get it here:
+            https://github.com/mislav/ssl-tools/blob/8b3dec4/doctor.rb
+
+            Read more about the script and how to use it in this blog post:
+            https://mislav.net/2013/07/ruby-openssl/
+          MSG
+        end
+      end
+
+      def summarize(bundler_success, rubygems_success, host)
+        guide_url = "http://ruby.to/ssl-check-failed"
+
+        message = if bundler_success && rubygems_success
+          <<~MSG
+            Hooray! This Ruby can connect to #{host}.
+            You are all set to use Bundler and RubyGems.
+
+          MSG
+        elsif !bundler_success && !rubygems_success
+          <<~MSG
+            For some reason, your Ruby installation can connect to #{host}, but neither RubyGems nor Bundler can.
+            The most likely fix is to manually upgrade RubyGems by following the instructions at #{guide_url}.
+            After you've done that, run `gem install bundler` to upgrade Bundler, and then run this script again to make sure everything worked. ❣
+
+          MSG
+        elsif !bundler_success
+          <<~MSG
+            Although your Ruby installation and RubyGems can both connect to #{host}, Bundler is having trouble.
+            The most likely way to fix this is to upgrade Bundler by running `gem install bundler`.
+            Run this script again after doing that to make sure everything is all set.
+            If you're still having trouble, check out the troubleshooting guide at #{guide_url}.
+
+          MSG
+        else
+          <<~MSG
+            It looks like Ruby and Bundler can connect to #{host}, but RubyGems itself cannot.
+            You can likely solve this by manually downloading and installing a RubyGems update.
+            Visit #{guide_url} for instructions on how to manually upgrade RubyGems.
+
+          MSG
+        end
+
+        Bundler.ui.info("\n#{message}")
+      end
+
+      private
+
+      def show_ssl_certs
+        ssl_cert_file = ENV["SSL_CERT_FILE"] || OpenSSL::X509::DEFAULT_CERT_FILE
+        ssl_cert_dir  = ENV["SSL_CERT_DIR"]  || OpenSSL::X509::DEFAULT_CERT_DIR
+
+        <<~MSG
+          Below affect only Ruby net/http connections:
+          SSL_CERT_FILE: #{File.exist?(ssl_cert_file) ? "exists     #{ssl_cert_file}" : "is missing #{ssl_cert_file}"}
+          SSL_CERT_DIR:  #{Dir.exist?(ssl_cert_dir)   ? "exists     #{ssl_cert_dir}"  : "is missing #{ssl_cert_dir}"}
+        MSG
+      end
+    end
+  end
+end
diff --git a/lib/bundler/cli/exec.rb b/lib/bundler/cli/exec.rb
index f81cd5d2c4..2fdc416286 100644
--- a/lib/bundler/cli/exec.rb
+++ b/lib/bundler/cli/exec.rb
@@ -19,10 +19,13 @@ module Bundler
       validate_cmd!
       SharedHelpers.set_bundle_environment
       if bin_path = Bundler.which(cmd)
-        if !Bundler.settings[:disable_exec_load] && ruby_shebang?(bin_path)
-          return kernel_load(bin_path, *args)
+        if !Bundler.settings[:disable_exec_load] && directly_loadable?(bin_path)
+          bin_path.delete_suffix!(".bat") if Gem.win_platform?
+          kernel_load(bin_path, *args)
+        else
+          bin_path = "./" + bin_path unless File.absolute_path?(bin_path)
+          kernel_exec(bin_path, *args)
         end
-        kernel_exec(bin_path, *args)
       else
         # exec using the given command
         kernel_exec(cmd, *args)
@@ -68,6 +71,29 @@ module Bundler
       "#{file} #{args.join(" ")}".strip
     end
 
+    def directly_loadable?(file)
+      if Gem.win_platform?
+        script_wrapper?(file)
+      else
+        ruby_shebang?(file)
+      end
+    end
+
+    def script_wrapper?(file)
+      script_file = file.delete_suffix(".bat")
+      return false unless File.exist?(script_file)
+
+      if File.zero?(script_file)
+        Bundler.ui.warn "#{script_file} is empty"
+        return false
+      end
+
+      header = File.open(file, "r") {|f| f.read(32) }
+      ruby_exe = "#{RbConfig::CONFIG["RUBY_INSTALL_NAME"]}#{RbConfig::CONFIG["EXEEXT"]}"
+      ruby_exe = "ruby.exe" if ruby_exe.empty?
+      header.include?(ruby_exe)
+    end
+
     def ruby_shebang?(file)
       possibilities = [
         "#!/usr/bin/env ruby\n",
diff --git a/lib/bundler/cli/fund.rb b/lib/bundler/cli/fund.rb
index 52db5aef68..ad7f31f3d6 100644
--- a/lib/bundler/cli/fund.rb
+++ b/lib/bundler/cli/fund.rb
@@ -16,7 +16,7 @@ module Bundler
       deps = if groups.any?
         Bundler.definition.dependencies_for(groups)
       else
-        Bundler.definition.current_dependencies
+        Bundler.definition.requested_dependencies
       end
 
       fund_info = deps.each_with_object([]) do |dep, arr|
diff --git a/lib/bundler/cli/gem.rb b/lib/bundler/cli/gem.rb
index b6571d0e86..c8c24c8e66 100644
--- a/lib/bundler/cli/gem.rb
+++ b/lib/bundler/cli/gem.rb
@@ -1,7 +1,5 @@
 # frozen_string_literal: true
 
-require "pathname"
-
 module Bundler
   class CLI
     Bundler.require_thor_actions
@@ -9,11 +7,7 @@ module Bundler
   end
 
   class CLI::Gem
-    TEST_FRAMEWORK_VERSIONS = {
-      "rspec" => "3.0",
-      "minitest" => "5.16",
-      "test-unit" => "3.0",
-    }.freeze
+    DEFAULT_GITHUB_USERNAME = "[USERNAME]"
 
     attr_reader :options, :gem_name, :thor, :name, :target, :extension
 
@@ -26,12 +20,11 @@ module Bundler
       thor.destination_root = nil
 
       @name = @gem_name
-      @target = SharedHelpers.pwd.join(gem_name)
+      @target = Pathname.new(SharedHelpers.pwd).join(gem_name)
 
       @extension = options[:ext]
 
       validate_ext_name if @extension
-      validate_rust_builder_rubygems_version if @extension == "rust"
     end
 
     def run
@@ -48,13 +41,16 @@ module Bundler
       git_author_name = use_git ? `git config user.name`.chomp : ""
       git_username = use_git ? `git config github.user`.chomp : ""
       git_user_email = use_git ? `git config user.email`.chomp : ""
+      github_username = github_username(git_username)
 
-      github_username = if options[:github_username].nil?
-        git_username
-      elsif options[:github_username] == false
-        ""
+      if github_username.empty?
+        homepage_uri = "TODO: Put your gem's website or public repo URL here."
+        source_code_uri = "TODO: Put your gem's public repo URL here."
+        changelog_uri = "TODO: Put your gem's CHANGELOG.md URL here."
       else
-        options[:github_username]
+        homepage_uri = "https://github.com/#{github_username}/#{name}"
+        source_code_uri = "https://github.com/#{github_username}/#{name}"
+        changelog_uri = "https://github.com/#{github_username}/#{name}/blob/main/CHANGELOG.md"
       end
 
       config = {
@@ -69,17 +65,22 @@ module Bundler
         test: options[:test],
         ext: extension,
         exe: options[:exe],
+        bundle: options[:bundle],
         bundler_version: bundler_dependency_version,
         git: use_git,
-        github_username: github_username.empty? ? "[USERNAME]" : github_username,
+        github_username: github_username.empty? ? DEFAULT_GITHUB_USERNAME : github_username,
         required_ruby_version: required_ruby_version,
         rust_builder_required_rubygems_version: rust_builder_required_rubygems_version,
         minitest_constant_name: minitest_constant_name,
+        ignore_paths: %w[bin/],
+        homepage_uri: homepage_uri,
+        source_code_uri: source_code_uri,
+        changelog_uri: changelog_uri,
       }
       ensure_safe_gem_name(name, constant_array)
 
       templates = {
-        "#{Bundler.preferred_gemfile_name}.tt" => Bundler.preferred_gemfile_name,
+        "Gemfile.tt" => Bundler.preferred_gemfile_name,
         "lib/newgem.rb.tt" => "lib/#{namespaced_path}.rb",
         "lib/newgem/version.rb.tt" => "lib/#{namespaced_path}/version.rb",
         "sig/newgem.rbs.tt" => "sig/#{namespaced_path}.rbs",
@@ -95,11 +96,21 @@ module Bundler
         bin/setup
       ]
 
-      templates.merge!("gitignore.tt" => ".gitignore") if use_git
+      case Bundler.preferred_gemfile_name
+      when "Gemfile"
+        config[:ignore_paths] << "Gemfile"
+      when "gems.rb"
+        config[:ignore_paths] << "gems.rb"
+        config[:ignore_paths] << "gems.locked"
+      end
+
+      if use_git
+        templates.merge!("gitignore.tt" => ".gitignore")
+        config[:ignore_paths] << ".gitignore"
+      end
 
       if test_framework = ask_and_set_test_framework
         config[:test] = test_framework
-        config[:test_framework_version] = TEST_FRAMEWORK_VERSIONS[test_framework]
 
         case test_framework
         when "rspec"
@@ -109,6 +120,8 @@ module Bundler
             "spec/newgem_spec.rb.tt" => "spec/#{namespaced_path}_spec.rb"
           )
           config[:test_task] = :spec
+          config[:ignore_paths] << ".rspec"
+          config[:ignore_paths] << "spec/"
         when "minitest"
           # Generate path for minitest target file (FileList["test/**/test_*.rb"])
           #   foo     => test/test_foo.rb
@@ -123,12 +136,14 @@ module Bundler
             "test/minitest/test_newgem.rb.tt" => "test/#{minitest_namespaced_path}.rb"
           )
           config[:test_task] = :test
+          config[:ignore_paths] << "test/"
         when "test-unit"
           templates.merge!(
             "test/test-unit/test_helper.rb.tt" => "test/test_helper.rb",
             "test/test-unit/newgem_test.rb.tt" => "test/#{namespaced_path}_test.rb"
           )
           config[:test_task] = :test
+          config[:ignore_paths] << "test/"
         end
       end
 
@@ -136,19 +151,22 @@ module Bundler
       case config[:ci]
       when "github"
         templates.merge!("github/workflows/main.yml.tt" => ".github/workflows/main.yml")
-        config[:ci_config_path] = ".github "
+        if extension == "rust"
+          templates.merge!("github/workflows/build-gems.yml.tt" => ".github/workflows/build-gems.yml")
+        end
+        config[:ignore_paths] << ".github/"
       when "gitlab"
         templates.merge!("gitlab-ci.yml.tt" => ".gitlab-ci.yml")
-        config[:ci_config_path] = ".gitlab-ci.yml "
+        config[:ignore_paths] << ".gitlab-ci.yml"
       when "circle"
         templates.merge!("circleci/config.yml.tt" => ".circleci/config.yml")
-        config[:ci_config_path] = ".circleci "
+        config[:ignore_paths] << ".circleci/"
       end
 
       if ask_and_set(:mit, "Do you want to license your code permissively under the MIT license?",
-        "This means that any other developer or company will be legally allowed to use your code " \
-        "for free as long as they admit you created it. You can read more about the MIT license " \
-        "at https://choosealicense.com/licenses/mit.")
+        "Using a MIT license means that any other developer or company will be legally allowed " \
+        "to use your code for free as long as they admit you created it. You can read more about " \
+        "the MIT license at https://choosealicense.com/licenses/mit.")
         config[:mit] = true
         Bundler.ui.info "MIT License enabled in config"
         templates.merge!("LICENSE.txt.tt" => "LICENSE.txt")
@@ -156,12 +174,8 @@ module Bundler
 
       if ask_and_set(:coc, "Do you want to include a code of conduct in gems you generate?",
         "Codes of conduct can increase contributions to your project by contributors who " \
-        "prefer collaborative, safe spaces. You can read more about the code of conduct at " \
-        "contributor-covenant.org. Having a code of conduct means agreeing to the responsibility " \
-        "of enforcing it, so be sure that you are prepared to do that. Be sure that your email " \
-        "address is specified as a contact in the generated code of conduct so that people know " \
-        "who to contact in case of a violation. For suggestions about " \
-        "how to enforce codes of conduct, see https://bit.ly/coc-enforcement.")
+        "prefer safe, respectful, productive, and collaborative spaces. \n" \
+        "See https://github.com/ruby/rubygems/blob/master/CODE_OF_CONDUCT.md")
         config[:coc] = true
         Bundler.ui.info "Code of conduct enabled in config"
         templates.merge!("CODE_OF_CONDUCT.md.tt" => "CODE_OF_CONDUCT.md")
@@ -182,16 +196,19 @@ module Bundler
       config[:linter] = ask_and_set_linter
       case config[:linter]
       when "rubocop"
-        config[:linter_version] = rubocop_version
         Bundler.ui.info "RuboCop enabled in config"
         templates.merge!("rubocop.yml.tt" => ".rubocop.yml")
+        config[:ignore_paths] << ".rubocop.yml"
       when "standard"
-        config[:linter_version] = standard_version
         Bundler.ui.info "Standard enabled in config"
         templates.merge!("standard.yml.tt" => ".standard.yml")
+        config[:ignore_paths] << ".standard.yml"
       end
 
-      templates.merge!("exe/newgem.tt" => "exe/#{name}") if config[:exe]
+      if config[:exe]
+        templates.merge!("exe/newgem.tt" => "exe/#{name}")
+        executables.push("exe/#{name}")
+      end
 
       if extension == "c"
         templates.merge!(
@@ -205,18 +222,31 @@ module Bundler
         templates.merge!(
           "Cargo.toml.tt" => "Cargo.toml",
           "ext/newgem/Cargo.toml.tt" => "ext/#{name}/Cargo.toml",
+          "ext/newgem/build.rs.tt" => "ext/#{name}/build.rs",
           "ext/newgem/extconf-rust.rb.tt" => "ext/#{name}/extconf.rb",
           "ext/newgem/src/lib.rs.tt" => "ext/#{name}/src/lib.rs",
         )
       end
 
+      if extension == "go"
+        templates.merge!(
+          "ext/newgem/go.mod.tt" => "ext/#{name}/go.mod",
+          "ext/newgem/extconf-go.rb.tt" => "ext/#{name}/extconf.rb",
+          "ext/newgem/newgem.h.tt" => "ext/#{name}/#{underscored_name}.h",
+          "ext/newgem/newgem.go.tt" => "ext/#{name}/#{underscored_name}.go",
+          "ext/newgem/newgem-go.c.tt" => "ext/#{name}/#{underscored_name}.c",
+        )
+
+        config[:go_module_username] = config[:github_username] == DEFAULT_GITHUB_USERNAME ? "username" : config[:github_username]
+      end
+
       if target.exist? && !target.directory?
         Bundler.ui.error "Couldn't create a new gem named `#{gem_name}` because there's an existing file named `#{gem_name}`."
         exit Bundler::BundlerError.all_errors[Bundler::GenericSystemCallError]
       end
 
       if use_git
-        Bundler.ui.info "Initializing git repo in #{target}"
+        Bundler.ui.info "\nInitializing git repo in #{target}"
         require "shellwords"
         `git init #{target.to_s.shellescape}`
 
@@ -238,26 +268,33 @@ module Bundler
         IO.popen(%w[git add .], { chdir: target }, &:read)
       end
 
+      if config[:bundle]
+        Bundler.ui.info "Running bundle install in the new gem directory."
+        Dir.chdir(target) do
+          system("bundle install")
+        end
+      end
+
       # Open gemspec in editor
       open_editor(options["edit"], target.join("#{name}.gemspec")) if options[:edit]
 
-      Bundler.ui.info "Gem '#{name}' was successfully created. " \
-        "For more information on making a RubyGem visit https://bundler.io/guides/creating_gem.html"
+      Bundler.ui.info "\nGem '#{name}' was successfully created. " \
+        "For more information on making a RubyGem visit https://guides.rubygems.org/make-your-own-gem/"
     end
 
     private
 
     def resolve_name(name)
-      SharedHelpers.pwd.join(name).basename.to_s
+      Pathname.new(SharedHelpers.pwd).join(name).basename.to_s
     end
 
-    def ask_and_set(key, header, message)
+    def ask_and_set(key, prompt, explanation)
       choice = options[key]
       choice = Bundler.settings["gem.#{key}"] if choice.nil?
 
       if choice.nil?
-        Bundler.ui.confirm header
-        choice = Bundler.ui.yes? "#{message} y/(n):"
+        Bundler.ui.info "\n#{explanation}"
+        choice = Bundler.ui.yes? "#{prompt} y/(n):"
         Bundler.settings.set_global("gem.#{key}", choice)
       end
 
@@ -275,10 +312,11 @@ module Bundler
     end
 
     def ask_and_set_test_framework
+      return if skip?(:test)
       test_framework = options[:test] || Bundler.settings["gem.test"]
 
       if test_framework.to_s.empty?
-        Bundler.ui.confirm "Do you want to generate tests with your gem?"
+        Bundler.ui.info "\nDo you want to generate tests with your gem?"
         Bundler.ui.info hint_text("test")
 
         result = Bundler.ui.ask "Enter a test framework. rspec/minitest/test-unit/(none):"
@@ -300,6 +338,10 @@ module Bundler
       test_framework
     end
 
+    def skip?(option)
+      options.key?(option) && options[option].nil?
+    end
+
     def hint_text(setting)
       if Bundler.settings["gem.#{setting}"] == false
         "Your choice will only be applied to this gem."
@@ -310,15 +352,15 @@ module Bundler
     end
 
     def ask_and_set_ci
+      return if skip?(:ci)
       ci_template = options[:ci] || Bundler.settings["gem.ci"]
 
       if ci_template.to_s.empty?
-        Bundler.ui.confirm "Do you want to set up continuous integration for your gem? " \
+        Bundler.ui.info "\nDo you want to set up continuous integration for your gem? " \
           "Supported services:\n" \
           "* CircleCI:       https://circleci.com/\n" \
           "* GitHub Actions: https://github.com/features/actions\n" \
-          "* GitLab CI:      https://docs.gitlab.com/ee/ci/\n" \
-          "\n"
+          "* GitLab CI:      https://docs.gitlab.com/ee/ci/\n"
         Bundler.ui.info hint_text("ci")
 
         result = Bundler.ui.ask "Enter a CI service. github/gitlab/circle/(none):"
@@ -341,15 +383,14 @@ module Bundler
     end
 
     def ask_and_set_linter
+      return if skip?(:linter)
       linter_template = options[:linter] || Bundler.settings["gem.linter"]
-      linter_template = deprecated_rubocop_option if linter_template.nil?
 
       if linter_template.to_s.empty?
-        Bundler.ui.confirm "Do you want to add a code linter and formatter to your gem? " \
+        Bundler.ui.info "\nDo you want to add a code linter and formatter to your gem? " \
           "Supported Linters:\n" \
           "* RuboCop:       https://rubocop.org\n" \
-          "* Standard:      https://github.com/standardrb/standard\n" \
-          "\n"
+          "* Standard:      https://github.com/standardrb/standard\n"
         Bundler.ui.info hint_text("linter")
 
         result = Bundler.ui.ask "Enter a linter. rubocop/standard/(none):"
@@ -376,27 +417,6 @@ module Bundler
       linter_template
     end
 
-    def deprecated_rubocop_option
-      if !options[:rubocop].nil?
-        if options[:rubocop]
-          Bundler::SharedHelpers.major_deprecation 2,
-            "--rubocop is deprecated, use --linter=rubocop",
-            removed_message: "--rubocop has been removed, use --linter=rubocop"
-          "rubocop"
-        else
-          Bundler::SharedHelpers.major_deprecation 2,
-            "--no-rubocop is deprecated, use --linter",
-            removed_message: "--no-rubocop has been removed, use --linter"
-          false
-        end
-      elsif !Bundler.settings["gem.rubocop"].nil?
-        Bundler::SharedHelpers.major_deprecation 2,
-          "config gem.rubocop is deprecated; we've updated your config to use gem.linter instead",
-          removed_message: "config gem.rubocop has been removed; we've updated your config to use gem.linter instead"
-        Bundler.settings["gem.rubocop"] ? "rubocop" : false
-      end
-    end
-
     def bundler_dependency_version
       v = Gem::Version.new(Bundler::VERSION)
       req = v.segments[0..1]
@@ -410,6 +430,10 @@ module Bundler
         exit 1
       end
 
+      if /[A-Z]/.match?(name)
+        Bundler.ui.warn "Gem names with capital letters are not recommended. Please use only lowercase letters, numbers, and hyphens."
+      end
+
       constant_name = constant_array.join("::")
 
       existing_constant = constant_array.inject(Object) do |c, s|
@@ -436,21 +460,16 @@ module Bundler
     end
 
     def required_ruby_version
-      "3.0.0"
+      "3.2.0"
     end
 
-    def rubocop_version
-      "1.21"
-    end
-
-    def standard_version
-      "1.3"
-    end
-
-    def validate_rust_builder_rubygems_version
-      if Gem::Version.new(rust_builder_required_rubygems_version) > Gem.rubygems_version
-        Bundler.ui.error "Your RubyGems version (#{Gem.rubygems_version}) is too old to build Rust extension. Please update your RubyGems using `gem update --system` or any other way and try again."
-        exit 1
+    def github_username(git_username)
+      if options[:github_username].nil?
+        git_username
+      elsif options[:github_username] == false
+        ""
+      else
+        options[:github_username]
       end
     end
   end
diff --git a/lib/bundler/cli/info.rb b/lib/bundler/cli/info.rb
index 8f34956aca..cd01d4949b 100644
--- a/lib/bundler/cli/info.rb
+++ b/lib/bundler/cli/info.rb
@@ -39,8 +39,8 @@ module Bundler
         path = File.expand_path("../../..", __dir__)
       else
         path = spec.full_gem_path
-        if spec.deleted_gem?
-          return Bundler.ui.warn "The gem #{name} has been deleted. It was installed at: #{path}"
+        if spec.installation_missing?
+          return Bundler.ui.warn "The gem #{name} is missing. It should be installed at #{path}, but was not found"
         end
       end
 
@@ -65,19 +65,19 @@ module Bundler
       gem_info << "\tDefault Gem: yes\n" if spec.respond_to?(:default_gem?) && spec.default_gem?
       gem_info << "\tReverse Dependencies: \n\t\t#{gem_dependencies.join("\n\t\t")}" if gem_dependencies.any?
 
-      if name != "bundler" && spec.deleted_gem?
-        return Bundler.ui.warn "The gem #{name} has been deleted. Gemspec information is still available though:\n#{gem_info}"
+      if name != "bundler" && spec.installation_missing?
+        return Bundler.ui.warn "The gem #{name} is missing. Gemspec information is still available though:\n#{gem_info}"
       end
 
       Bundler.ui.info gem_info
     end
 
     def gem_dependencies
-      @gem_dependencies ||= Bundler.definition.specs.map do |spec|
+      @gem_dependencies ||= Bundler.definition.specs.filter_map do |spec|
         dependency = spec.dependencies.find {|dep| dep.name == gem_name }
         next unless dependency
         "#{spec.name} (#{spec.version}) depends on #{gem_name} (#{dependency.requirements_list.join(", ")})"
-      end.compact.sort
+      end.sort
     end
   end
 end
diff --git a/lib/bundler/cli/inject.rb b/lib/bundler/cli/inject.rb
deleted file mode 100644
index 8093a85283..0000000000
--- a/lib/bundler/cli/inject.rb
+++ /dev/null
@@ -1,60 +0,0 @@
-# frozen_string_literal: true
-
-module Bundler
-  class CLI::Inject
-    attr_reader :options, :name, :version, :group, :source, :gems
-    def initialize(options, name, version)
-      @options = options
-      @name = name
-      @version = version || last_version_number
-      @group = options[:group].split(",") unless options[:group].nil?
-      @source = options[:source]
-      @gems = []
-    end
-
-    def run
-      # The required arguments allow Thor to give useful feedback when the arguments
-      # are incorrect. This adds those first two arguments onto the list as a whole.
-      gems.unshift(source).unshift(group).unshift(version).unshift(name)
-
-      # Build an array of Dependency objects out of the arguments
-      deps = []
-      # when `inject` support addition of more than one gem, then this loop will
-      # help. Currently this loop is running once.
-      gems.each_slice(4) do |gem_name, gem_version, gem_group, gem_source|
-        ops = Gem::Requirement::OPS.map {|key, _val| key }
-        has_op = ops.any? {|op| gem_version.start_with? op }
-        gem_version = "~> #{gem_version}" unless has_op
-        deps << Bundler::Dependency.new(gem_name, gem_version, "group" => gem_group, "source" => gem_source)
-      end
-
-      added = Injector.inject(deps, options)
-
-      if added.any?
-        Bundler.ui.confirm "Added to Gemfile:"
-        Bundler.ui.confirm(added.map do |d|
-          name = "'#{d.name}'"
-          requirement = ", '#{d.requirement}'"
-          group = ", :group => #{d.groups.inspect}" if d.groups != Array(:default)
-          source = ", :source => '#{d.source}'" unless d.source.nil?
-          %(gem #{name}#{requirement}#{group}#{source})
-        end.join("\n"))
-      else
-        Bundler.ui.confirm "All gems were already present in the Gemfile"
-      end
-    end
-
-    private
-
-    def last_version_number
-      definition = Bundler.definition(true)
-      definition.resolve_remotely!
-      specs = definition.index[name].sort_by(&:version)
-      unless options[:pre]
-        specs.delete_if {|b| b.respond_to?(:version) && b.version.prerelease? }
-      end
-      spec = specs.last
-      spec.version.to_s
-    end
-  end
-end
diff --git a/lib/bundler/cli/install.rb b/lib/bundler/cli/install.rb
index a233d5d2e5..69affd1a10 100644
--- a/lib/bundler/cli/install.rb
+++ b/lib/bundler/cli/install.rb
@@ -12,53 +12,40 @@ module Bundler
 
       warn_if_root
 
-      Bundler.self_manager.install_locked_bundler_and_restart_with_it_if_needed
+      if options[:local]
+        Bundler.self_manager.restart_with_locked_bundler_if_needed
+      else
+        Bundler.self_manager.install_locked_bundler_and_restart_with_it_if_needed
+      end
 
       Bundler::SharedHelpers.set_env "RB_USER_INSTALL", "1" if Gem.freebsd_platform?
 
-      # Disable color in deployment mode
-      Bundler.ui.shell = Thor::Shell::Basic.new if options[:deployment]
-
-      check_for_options_conflicts
+      if target_rbconfig_path = options[:"target-rbconfig"]
+        Bundler.rubygems.set_target_rbconfig(target_rbconfig_path)
+      end
 
       check_trust_policy
 
-      if options[:deployment] || options[:frozen] || Bundler.frozen_bundle?
-        unless Bundler.default_lockfile.exist?
-          flag   = "--deployment flag" if options[:deployment]
-          flag ||= "--frozen flag"     if options[:frozen]
-          flag ||= "deployment setting"
-          raise ProductionError, "The #{flag} requires a lockfile. Please make " \
-                                 "sure you have checked your #{SharedHelpers.relative_lockfile_path} into version control " \
-                                 "before deploying."
-        end
-
-        options[:local] = true if Bundler.app_cache.exist?
-
-        Bundler.settings.set_command_option :deployment, true if options[:deployment]
-        Bundler.settings.set_command_option :frozen, true if options[:frozen]
-      end
-
-      # When install is called with --no-deployment, disable deployment mode
-      if options[:deployment] == false
-        Bundler.settings.set_command_option :frozen, nil
-        options[:system] = true
+      if Bundler.frozen_bundle? && !Bundler.default_lockfile.exist?
+        flag = "deployment setting" if Bundler.settings[:deployment]
+        flag = "frozen setting" if Bundler.settings[:frozen]
+        raise ProductionError, "The #{flag} requires a lockfile. Please make " \
+                               "sure you have checked your #{SharedHelpers.relative_lockfile_path} into version control " \
+                               "before deploying."
       end
 
       normalize_settings
 
       Bundler::Fetcher.disable_endpoint = options["full-index"]
 
-      if options["binstubs"]
-        Bundler::SharedHelpers.major_deprecation 2,
-          "The --binstubs option will be removed in favor of `bundle binstubs --all`",
-          removed_message: "The --binstubs option have been removed in favor of `bundle binstubs --all`"
-      end
-
-      Plugin.gemfile_install(Bundler.default_gemfile) if Bundler.feature_flag.plugins?
+      Plugin.gemfile_install(Bundler.default_gemfile) if Bundler.settings[:plugins]
 
-      definition = Bundler.definition
+      # For install we want to enable strict validation
+      # (rather than some optimizations we perform at app runtime).
+      definition = Bundler.definition(strict: true)
       definition.validate_runtime!
+      definition.lockfile = options["lockfile"] if options["lockfile"]
+      definition.lockfile = false if options["no-lock"]
 
       installer = Installer.install(Bundler.root, definition, options)
 
@@ -78,8 +65,6 @@ module Bundler
 
       Bundler::CLI::Common.output_post_install_messages installer.post_install_messages
 
-      warn_ambiguous_gems
-
       if CLI::Common.clean_after_install?
         require_relative "clean"
         Bundler::CLI::Clean.new(options).run
@@ -105,26 +90,10 @@ module Bundler
     end
 
     def gems_installed_for(definition)
-      count = definition.specs.count
+      count = definition.specs.count {|spec| spec.name != "bundler" }
       "#{count} #{count == 1 ? "gem" : "gems"} now installed"
     end
 
-    def check_for_group_conflicts_in_cli_options
-      conflicting_groups = Array(options[:without]) & Array(options[:with])
-      return if conflicting_groups.empty?
-      raise InvalidOption, "You can't list a group in both with and without." \
-        " The offending groups are: #{conflicting_groups.join(", ")}."
-    end
-
-    def check_for_options_conflicts
-      if (options[:path] || options[:deployment]) && options[:system]
-        error_message = String.new
-        error_message << "You have specified both --path as well as --system. Please choose only one option.\n" if options[:path]
-        error_message << "You have specified both --deployment as well as --system. Please choose only one option.\n" if options[:deployment]
-        raise InvalidOption.new(error_message)
-      end
-    end
-
     def check_trust_policy
       trust_policy = options["trust-policy"]
       unless Bundler.rubygems.security_policies.keys.unshift(nil).include?(trust_policy)
@@ -134,57 +103,25 @@ module Bundler
       Bundler.settings.set_command_option_if_given :"trust-policy", trust_policy
     end
 
-    def normalize_groups
-      check_for_group_conflicts_in_cli_options
-
-      # need to nil them out first to get around validation for backwards compatibility
-      Bundler.settings.set_command_option :without, nil
-      Bundler.settings.set_command_option :with,    nil
-      Bundler.settings.set_command_option :without, options[:without]
-      Bundler.settings.set_command_option :with,    options[:with]
-    end
-
     def normalize_settings
-      Bundler.settings.set_command_option :path, nil if options[:system]
-      Bundler.settings.set_command_option_if_given :path, options[:path]
-
       if options["standalone"] && Bundler.settings[:path].nil? && !options["local"]
-        Bundler.settings.temporary(path_relative_to_cwd: false) do
-          Bundler.settings.set_command_option :path, "bundle"
-        end
+        Bundler.settings.set_command_option :path, "bundle"
       end
 
-      bin_option = options["binstubs"]
-      bin_option = nil if bin_option&.empty?
-      Bundler.settings.set_command_option :bin, bin_option if options["binstubs"]
-
       Bundler.settings.set_command_option_if_given :shebang, options["shebang"]
 
       Bundler.settings.set_command_option_if_given :jobs, options["jobs"]
 
+      Bundler::CLI::Common.validate_cooldown!(options["cooldown"])
+      Bundler.settings.set_command_option_if_given :cooldown, options["cooldown"]
+
       Bundler.settings.set_command_option_if_given :no_prune, options["no-prune"]
 
       Bundler.settings.set_command_option_if_given :no_install, options["no-install"]
 
       Bundler.settings.set_command_option_if_given :clean, options["clean"]
 
-      normalize_groups if options[:without] || options[:with]
-
-      options[:force] = options[:redownload]
-    end
-
-    def warn_ambiguous_gems
-      # TODO: remove this when we drop Bundler 1.x support
-      Installer.ambiguous_gems.to_a.each do |name, installed_from_uri, *also_found_in_uris|
-        Bundler.ui.warn "Warning: the gem '#{name}' was found in multiple sources."
-        Bundler.ui.warn "Installed from: #{installed_from_uri}"
-        Bundler.ui.warn "Also found in:"
-        also_found_in_uris.each {|uri| Bundler.ui.warn "  * #{uri}" }
-        Bundler.ui.warn "You should add a source requirement to restrict this gem to your preferred source."
-        Bundler.ui.warn "For example:"
-        Bundler.ui.warn "    gem '#{name}', :source => '#{installed_from_uri}'"
-        Bundler.ui.warn "Then uninstall the gem '#{name}' (or delete all bundled gems) and then install again."
-      end
+      options[:force] = options[:redownload] if options[:redownload]
     end
   end
 end
diff --git a/lib/bundler/cli/issue.rb b/lib/bundler/cli/issue.rb
index 5f2924c4bd..cbfb7da2d8 100644
--- a/lib/bundler/cli/issue.rb
+++ b/lib/bundler/cli/issue.rb
@@ -10,7 +10,7 @@ module Bundler
         be sure to check out these resources:
 
         1. Check out our troubleshooting guide for quick fixes to common issues:
-        https://github.com/rubygems/rubygems/blob/master/bundler/doc/TROUBLESHOOTING.md
+        https://github.com/ruby/rubygems/blob/master/doc/bundler/TROUBLESHOOTING.md
 
         2. Instructions for common Bundler uses can be found on the documentation
         site: https://bundler.io/
@@ -22,7 +22,7 @@ module Bundler
         still aren't working the way you expect them to, please let us know so
         that we can diagnose and help fix the problem you're having, by filling
         in the new issue form located at
-        https://github.com/rubygems/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md,
+        https://github.com/ruby/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md,
         and copy and pasting the information below.
 
       EOS
@@ -34,8 +34,8 @@ module Bundler
     end
 
     def doctor
-      require_relative "doctor"
-      Bundler::CLI::Doctor.new({}).run
+      require_relative "doctor/diagnose"
+      Bundler::CLI::Doctor::Diagnose.new({}).run
     end
   end
 end
diff --git a/lib/bundler/cli/list.rb b/lib/bundler/cli/list.rb
index f56bf5b86a..6a467f45a9 100644
--- a/lib/bundler/cli/list.rb
+++ b/lib/bundler/cli/list.rb
@@ -1,11 +1,14 @@
 # frozen_string_literal: true
 
+require "json"
+
 module Bundler
   class CLI::List
     def initialize(options)
       @options = options
       @without_group = options["without-group"].map(&:to_sym)
       @only_group = options["only-group"].map(&:to_sym)
+      @format = options["format"]
     end
 
     def run
@@ -25,6 +28,36 @@ module Bundler
         end
       end.reject {|s| s.name == "bundler" }.sort_by(&:name)
 
+      case @format
+      when "json"
+        print_json(specs: specs)
+      when nil
+        print_human(specs: specs)
+      else
+        raise InvalidOption, "Unknown option`--format=#{@format}`. Supported formats: `json`"
+      end
+    end
+
+    private
+
+    def print_json(specs:)
+      gems = if @options["name-only"]
+        specs.map {|s| { name: s.name } }
+      else
+        specs.map do |s|
+          {
+            name: s.name,
+            version: s.version.to_s,
+            git_version: s.git_version&.strip,
+          }.tap do |h|
+            h[:path] = s.full_gem_path if @options["paths"]
+          end
+        end
+      end
+      Bundler.ui.info({ gems: gems }.to_json)
+    end
+
+    def print_human(specs:)
       return Bundler.ui.info "No gems in the Gemfile" if specs.empty?
 
       return specs.each {|s| Bundler.ui.info s.name } if @options["name-only"]
@@ -37,8 +70,6 @@ module Bundler
       Bundler.ui.info "Use `bundle info` to print more detailed information about a gem"
     end
 
-    private
-
     def verify_group_exists(groups)
       (@without_group + @only_group).each do |group|
         raise InvalidOption, "`#{group}` group could not be found." unless groups.include?(group)
diff --git a/lib/bundler/cli/lock.rb b/lib/bundler/cli/lock.rb
index dac3d2a09a..2f78868936 100644
--- a/lib/bundler/cli/lock.rb
+++ b/lib/bundler/cli/lock.rb
@@ -14,9 +14,11 @@ module Bundler
         exit 1
       end
 
+      check_for_conflicting_options
+
       print = options[:print]
-      previous_ui_level = Bundler.ui.level
-      Bundler.ui.level = "silent" if print
+      previous_output_stream = Bundler.ui.output_stream
+      Bundler.ui.output_stream = :stderr if print
 
       Bundler::Fetcher.disable_endpoint = options["full-index"]
 
@@ -33,23 +35,22 @@ module Bundler
         update = { bundler: bundler }
       end
 
-      file = options[:lockfile]
-      file = file ? Pathname.new(file).expand_path : Bundler.default_lockfile
-
       Bundler.settings.temporary(frozen: false) do
-        definition = Bundler.definition(update, file)
+        definition = Bundler.definition(update, Bundler.default_lockfile)
+        definition.add_checksums if options["add-checksums"]
 
         Bundler::CLI::Common.configure_gem_version_promoter(definition, options) if options[:update]
 
-        options["remove-platform"].each do |platform|
+        options["remove-platform"].each do |platform_string|
+          platform = Gem::Platform.new(platform_string)
           definition.remove_platform(platform)
         end
 
         options["add-platform"].each do |platform_string|
           platform = Gem::Platform.new(platform_string)
           if platform.to_s == "unknown"
-            Bundler.ui.warn "The platform `#{platform_string}` is unknown to RubyGems " \
-              "and adding it will likely lead to resolution errors"
+            Bundler.ui.error "The platform `#{platform_string}` is unknown to RubyGems and can't be added to the lockfile."
+            exit 1
           end
           definition.add_platform(platform)
         end
@@ -58,17 +59,36 @@ module Bundler
           raise InvalidOption, "Removing all platforms from the bundle is not allowed"
         end
 
-        definition.resolve_remotely! unless options[:local]
+        definition.remotely! unless options[:local]
+
+        if options["normalize-platforms"]
+          definition.normalize_platforms
+        end
 
         if print
           puts definition.to_lock
         else
+          file = options[:lockfile]
+          file = file ? Pathname.new(file).expand_path : Bundler.default_lockfile
+
           puts "Writing lockfile to #{file}"
-          definition.lock
+          definition.write_lock(file, false)
         end
       end
 
-      Bundler.ui.level = previous_ui_level
+      Bundler.ui.output_stream = previous_output_stream
+    end
+
+    private
+
+    def check_for_conflicting_options
+      if options["normalize-platforms"] && options["add-platform"].any?
+        raise InvalidOption, "--normalize-platforms can't be used with --add-platform"
+      end
+
+      if options["normalize-platforms"] && options["remove-platform"].any?
+        raise InvalidOption, "--normalize-platforms can't be used with --remove-platform"
+      end
     end
   end
 end
diff --git a/lib/bundler/cli/outdated.rb b/lib/bundler/cli/outdated.rb
index ec42e631bb..465e56ada2 100644
--- a/lib/bundler/cli/outdated.rb
+++ b/lib/bundler/cli/outdated.rb
@@ -26,13 +26,18 @@ module Bundler
     def run
       check_for_deployment_mode!
 
-      gems.each do |gem_name|
-        Bundler::CLI::Common.select_spec(gem_name)
-      end
+      Bundler::CLI::Common.validate_cooldown!(options[:cooldown])
+      Bundler.settings.set_command_option_if_given :cooldown, options[:cooldown]
 
       Bundler.definition.validate_runtime!
       current_specs = Bundler.ui.silence { Bundler.definition.resolve }
 
+      gems.each do |gem_name|
+        if current_specs[gem_name].empty?
+          raise GemNotFound, "Could not find gem '#{gem_name}'."
+        end
+      end
+
       current_dependencies = Bundler.ui.silence do
         Bundler.load.dependencies.map {|dep| [dep.name, dep] }.to_h
       end
@@ -54,7 +59,7 @@ module Bundler
       end
 
       if options[:parseable]
-        Bundler.ui.silence(&definition_resolution)
+        Bundler.ui.progress(&definition_resolution)
       else
         definition_resolution.call
       end
@@ -97,28 +102,26 @@ module Bundler
         }
       end
 
-      if outdated_gems.empty?
+      relevant_outdated_gems = if options_include_groups
+        outdated_gems.group_by {|g| g[:groups] }.sort.flat_map do |groups, gems|
+          contains_group = groups.split(", ").include?(options[:group])
+          next unless options[:groups] || contains_group
+
+          gems
+        end.compact
+      else
+        outdated_gems
+      end
+
+      if relevant_outdated_gems.empty?
         unless options[:parseable]
           Bundler.ui.info(nothing_outdated_message)
         end
       else
-        if options_include_groups
-          relevant_outdated_gems = outdated_gems.group_by {|g| g[:groups] }.sort.flat_map do |groups, gems|
-            contains_group = groups.split(", ").include?(options[:group])
-            next unless options[:groups] || contains_group
-
-            gems
-          end.compact
-
-          if options[:parseable]
-            print_gems(relevant_outdated_gems)
-          else
-            print_gems_table(relevant_outdated_gems)
-          end
-        elsif options[:parseable]
-          print_gems(outdated_gems)
+        if options[:parseable]
+          print_gems(relevant_outdated_gems)
         else
-          print_gems_table(outdated_gems)
+          print_gems_table(relevant_outdated_gems)
         end
 
         exit 1
@@ -155,7 +158,7 @@ module Bundler
 
       return active_spec if strict
 
-      active_specs = active_spec.source.specs.search(current_spec.name).select {|spec| spec.match_platform(current_spec.platform) }.sort_by(&:version)
+      active_specs = active_spec.source.specs.search(current_spec.name).select {|spec| spec.installable_on_platform?(current_spec.platform) }.sort_by(&:version)
       if !current_spec.version.prerelease? && !options[:pre] && active_specs.size > 1
         active_specs.delete_if {|b| b.respond_to?(:version) && b.version.prerelease? }
       end
@@ -199,7 +202,15 @@ module Bundler
       end
 
       spec_outdated_info = "#{active_spec.name} (newest #{spec_version}, " \
-        "installed #{current_version}#{dependency_version})"
+        "installed #{current_version}#{dependency_version}"
+
+      release_date = release_date_for(active_spec)
+      spec_outdated_info += ", released #{release_date}" unless release_date.empty?
+
+      remaining = cooldown_days_remaining(active_spec)
+      spec_outdated_info += ", in cooldown for #{remaining} more day#{"s" if remaining > 1}" if remaining
+
+      spec_outdated_info += ")"
 
       output_message = if options[:parseable]
         spec_outdated_info.to_s
@@ -215,13 +226,25 @@ module Bundler
     def gem_column_for(current_spec, active_spec, dependency, groups)
       current_version = "#{current_spec.version}#{current_spec.git_version}"
       spec_version = "#{active_spec.version}#{active_spec.git_version}"
+      remaining = cooldown_days_remaining(active_spec)
+      spec_version += " (cooldown #{remaining}d)" if remaining
       dependency = dependency.requirement if dependency
 
       ret_val = [active_spec.name, current_version, spec_version, dependency.to_s, groups.to_s]
+      ret_val << release_date_for(active_spec)
       ret_val << loaded_from_for(active_spec).to_s if Bundler.ui.debug?
       ret_val
     end
 
+    def cooldown_days_remaining(spec, now = Time.now)
+      return nil unless spec.respond_to?(:created_at) && spec.created_at
+      return nil unless spec.respond_to?(:remote) && spec.remote
+      days = spec.remote.effective_cooldown
+      return nil if days.nil? || days <= 0
+      remaining = days - ((now - spec.created_at) / 86_400.0)
+      remaining > 0 ? remaining.ceil : nil
+    end
+
     def check_for_deployment_mode!
       return unless Bundler.frozen_bundle?
       suggested_command = if Bundler.settings.locations("frozen").keys.&([:global, :local]).any?
@@ -283,11 +306,28 @@ module Bundler
     end
 
     def table_header
-      header = ["Gem", "Current", "Latest", "Requested", "Groups"]
+      header = ["Gem", "Current", "Latest", "Requested", "Groups", "Release Date"]
       header << "Path" if Bundler.ui.debug?
       header
     end
 
+    def release_date_for(spec)
+      return "" unless spec.respond_to?(:date)
+
+      date = spec.date
+      return "" unless date
+
+      return "" unless Gem.const_defined?(:DEFAULT_SOURCE_DATE_EPOCH)
+      default_date = Time.at(Gem::DEFAULT_SOURCE_DATE_EPOCH).utc
+      default_date = Time.utc(default_date.year, default_date.month, default_date.day)
+
+      date = date.utc if date.respond_to?(:utc)
+
+      return "" if date == default_date
+
+      date.strftime("%Y-%m-%d")
+    end
+
     def justify(row, sizes)
       row.each_with_index.map do |element, index|
         element.ljust(sizes[index])
diff --git a/lib/bundler/cli/plugin.rb b/lib/bundler/cli/plugin.rb
index fd61ef0d95..32fa660fe0 100644
--- a/lib/bundler/cli/plugin.rb
+++ b/lib/bundler/cli/plugin.rb
@@ -10,11 +10,15 @@ module Bundler
     method_option "source", type: :string, default: nil, banner: "URL of the RubyGems source to fetch the plugin from"
     method_option "version", type: :string, default: nil, banner: "The version of the plugin to fetch"
     method_option "git", type: :string, default: nil, banner: "URL of the git repo to fetch from"
-    method_option "local_git", type: :string, default: nil, banner: "Path of the local git repo to fetch from (deprecated)"
+    method_option "local_git", type: :string, default: nil, banner: "Path of the local git repo to fetch from (removed)"
     method_option "branch", type: :string, default: nil, banner: "The git branch to checkout"
     method_option "ref", type: :string, default: nil, banner: "The git revision to check out"
     method_option "path", type: :string, default: nil, banner: "Path of a local gem to directly use"
     def install(*plugins)
+      if options.key?(:local_git)
+        raise InvalidOption, "--local_git has been removed, use --git"
+      end
+
       Bundler::Plugin.install(plugins, options)
     end
 
diff --git a/lib/bundler/cli/pristine.rb b/lib/bundler/cli/pristine.rb
index e0d7452c44..f463f0bce8 100644
--- a/lib/bundler/cli/pristine.rb
+++ b/lib/bundler/cli/pristine.rb
@@ -11,6 +11,7 @@ module Bundler
       definition = Bundler.definition
       definition.validate_runtime!
       installer = Bundler::Installer.new(Bundler.root, definition)
+      git_sources = []
 
       ProcessLock.lock do
         installed_specs = definition.specs.reject do |spec|
@@ -41,6 +42,9 @@ module Bundler
             end
             FileUtils.rm_rf spec.extension_dir
             FileUtils.rm_rf spec.full_gem_path
+
+            next if git_sources.include?(source)
+            git_sources << source
           else
             Bundler.ui.warn("Cannot pristine #{gem_name}. Gem is sourced from local path.")
             next
@@ -49,7 +53,7 @@ module Bundler
           true
         end.map(&:name)
 
-        jobs = installer.send(:installation_parallelization, {})
+        jobs = Bundler.settings.installation_parallelization
         pristine_count = definition.specs.count - installed_specs.count
         # allow a pristining a single gem to skip the parallel worker
         jobs = [jobs, pristine_count].min
diff --git a/lib/bundler/cli/show.rb b/lib/bundler/cli/show.rb
index 59b0af42e1..67fdcc797e 100644
--- a/lib/bundler/cli/show.rb
+++ b/lib/bundler/cli/show.rb
@@ -6,7 +6,7 @@ module Bundler
     def initialize(options, gem_name)
       @options = options
       @gem_name = gem_name
-      @verbose = options[:verbose] || options[:outdated]
+      @verbose = options[:verbose]
       @latest_specs = fetch_latest_specs if @verbose
     end
 
@@ -24,7 +24,7 @@ module Bundler
           return unless spec
           path = spec.full_gem_path
           unless File.directory?(path)
-            return Bundler.ui.warn "The gem #{gem_name} has been deleted. It was installed at: #{path}"
+            return Bundler.ui.warn "The gem #{gem_name} is missing. It should be installed at #{path}, but was not found"
           end
         end
         return Bundler.ui.info(path)
@@ -57,12 +57,8 @@ module Bundler
 
     def fetch_latest_specs
       definition = Bundler.definition(true)
-      if options[:outdated]
-        Bundler.ui.info "Fetching remote specs for outdated check...\n\n"
-        Bundler.ui.silence { definition.resolve_remotely! }
-      else
-        definition.resolve_with_cache!
-      end
+      Bundler.ui.info "Fetching remote specs for outdated check...\n\n"
+      Bundler.ui.silence { definition.remotely! }
       Bundler.reset!
       definition.specs
     end
diff --git a/lib/bundler/cli/update.rb b/lib/bundler/cli/update.rb
index 985e8db051..d92ffd995f 100644
--- a/lib/bundler/cli/update.rb
+++ b/lib/bundler/cli/update.rb
@@ -15,7 +15,7 @@ module Bundler
 
       Bundler.self_manager.update_bundler_and_restart_with_it_if_needed(update_bundler) if update_bundler
 
-      Plugin.gemfile_install(Bundler.default_gemfile) if Bundler.feature_flag.plugins?
+      Plugin.gemfile_install(Bundler.default_gemfile) if Bundler.settings[:plugins]
 
       sources = Array(options[:source])
       groups  = Array(options[:group]).map(&:to_sym)
@@ -23,10 +23,10 @@ module Bundler
       full_update = gems.empty? && sources.empty? && groups.empty? && !options[:ruby] && !update_bundler
 
       if full_update && !options[:all]
-        if Bundler.feature_flag.update_requires_all_flag?
+        if Bundler.settings[:update_requires_all_flag]
           raise InvalidOption, "To update everything, pass the `--all` flag."
         end
-        SharedHelpers.major_deprecation 3, "Pass --all to `bundle update` to update everything"
+        SharedHelpers.feature_deprecated! "Pass --all to `bundle update` to update everything"
       elsif !full_update && options[:all]
         raise InvalidOption, "Cannot specify --all along with specific options."
       end
@@ -63,9 +63,11 @@ module Bundler
       opts = options.dup
       opts["update"] = true
       opts["local"] = options[:local]
-      opts["force"] = options[:redownload]
+      opts["force"] = options[:redownload] if options[:redownload]
 
       Bundler.settings.set_command_option_if_given :jobs, opts["jobs"]
+      Bundler::CLI::Common.validate_cooldown!(options[:cooldown])
+      Bundler.settings.set_command_option_if_given :cooldown, options[:cooldown]
 
       Bundler.definition.validate_runtime!
 
@@ -92,7 +94,7 @@ module Bundler
           locked_spec = locked_info[:spec]
           new_spec = Bundler.definition.specs[name].first
           unless new_spec
-            unless locked_spec.match_platform(Bundler.local_platform)
+            unless locked_spec.installable_on_platform?(Bundler.local_platform)
               Bundler.ui.warn "Bundler attempted to update #{name} but it was not considered because it is for a different platform from the current one"
             end
 
diff --git a/lib/bundler/cli/viz.rb b/lib/bundler/cli/viz.rb
deleted file mode 100644
index 5c09e00995..0000000000
--- a/lib/bundler/cli/viz.rb
+++ /dev/null
@@ -1,31 +0,0 @@
-# frozen_string_literal: true
-
-module Bundler
-  class CLI::Viz
-    attr_reader :options, :gem_name
-    def initialize(options)
-      @options = options
-    end
-
-    def run
-      # make sure we get the right `graphviz`. There is also a `graphviz`
-      # gem we're not built to support
-      gem "ruby-graphviz"
-      require "graphviz"
-
-      options[:without] = options[:without].join(":").tr(" ", ":").split(":")
-      output_file = File.expand_path(options[:file])
-
-      graph = Graph.new(Bundler.load, output_file, options[:version], options[:requirements], options[:format], options[:without])
-      graph.viz
-    rescue LoadError => e
-      Bundler.ui.error e.inspect
-      Bundler.ui.warn "Make sure you have the graphviz ruby gem. You can install it with:"
-      Bundler.ui.warn "`gem install ruby-graphviz`"
-    rescue StandardError => e
-      raise unless e.message.to_s.include?("GraphViz not installed or dot not in PATH")
-      Bundler.ui.error e.message
-      Bundler.ui.warn "Please install GraphViz. On a Mac with Homebrew, you can run `brew install graphviz`."
-    end
-  end
-end
diff --git a/lib/bundler/compact_index_client.rb b/lib/bundler/compact_index_client.rb
index 692d68e579..6865e30dbc 100644
--- a/lib/bundler/compact_index_client.rb
+++ b/lib/bundler/compact_index_client.rb
@@ -1,6 +1,5 @@
 # frozen_string_literal: true
 
-require "pathname"
 require "set"
 
 module Bundler
@@ -28,11 +27,7 @@ module Bundler
   # It may be called concurrently without global interpreter lock in some Rubies.
   # As a result, some methods may look more complex than necessary to save memory or time.
   class CompactIndexClient
-    # NOTE: MD5 is here not because we expect a server to respond with it, but
-    # because we use it to generate the etag on first request during the upgrade
-    # to the compact index client that uses opaque etags saved to files.
-    # Remove once 2.5.0 has been out for a while.
-    SUPPORTED_DIGESTS = { "sha-256" => :SHA256, "md5" => :MD5 }.freeze
+    SUPPORTED_DIGESTS = { "sha-256" => :SHA256 }.freeze
     DEBUG_MUTEX = Thread::Mutex.new
 
     # info returns an Array of INFO Arrays. Each INFO Array has the following indices:
@@ -75,7 +70,7 @@ module Bundler
     end
 
     def info(name)
-      Bundler::CompactIndexClient.debug { "info(#{names})" }
+      Bundler::CompactIndexClient.debug { "info(#{name})" }
       @parser.info(name)
     end
 
diff --git a/lib/bundler/compact_index_client/cache.rb b/lib/bundler/compact_index_client/cache.rb
index bedd7f8028..3bae6c9efd 100644
--- a/lib/bundler/compact_index_client/cache.rb
+++ b/lib/bundler/compact_index_client/cache.rb
@@ -1,6 +1,6 @@
 # frozen_string_literal: true
 
-require_relative "gem_parser"
+require "rubygems/resolver/api_set/gem_parser"
 
 module Bundler
   class CompactIndexClient
diff --git a/lib/bundler/compact_index_client/gem_parser.rb b/lib/bundler/compact_index_client/gem_parser.rb
deleted file mode 100644
index 60a1817607..0000000000
--- a/lib/bundler/compact_index_client/gem_parser.rb
+++ /dev/null
@@ -1,32 +0,0 @@
-# frozen_string_literal: true
-
-module Bundler
-  class CompactIndexClient
-    if defined?(Gem::Resolver::APISet::GemParser)
-      GemParser = Gem::Resolver::APISet::GemParser
-    else
-      class GemParser
-        EMPTY_ARRAY = [].freeze
-        private_constant :EMPTY_ARRAY
-
-        def parse(line)
-          version_and_platform, rest = line.split(" ", 2)
-          version, platform = version_and_platform.split("-", 2)
-          dependencies, requirements = rest.split("|", 2).map! {|s| s.split(",") } if rest
-          dependencies = dependencies ? dependencies.map! {|d| parse_dependency(d) } : EMPTY_ARRAY
-          requirements = requirements ? requirements.map! {|d| parse_dependency(d) } : EMPTY_ARRAY
-          [version, platform, dependencies, requirements]
-        end
-
-        private
-
-        def parse_dependency(string)
-          dependency = string.split(":")
-          dependency[-1] = dependency[-1].split("&") if dependency.size > 1
-          dependency[0] = -dependency[0]
-          dependency
-        end
-      end
-    end
-  end
-end
diff --git a/lib/bundler/compact_index_client/parser.rb b/lib/bundler/compact_index_client/parser.rb
index 3a0dec4907..ad0d17ed4a 100644
--- a/lib/bundler/compact_index_client/parser.rb
+++ b/lib/bundler/compact_index_client/parser.rb
@@ -11,7 +11,6 @@ module Bundler
         @versions_by_name = nil
         @available = nil
         @gem_parser = nil
-        @versions_data = nil
       end
 
       def names
@@ -40,71 +39,48 @@ module Bundler
       end
 
       def info(name)
-        data = @compact_index.info(name, info_checksum(name))
+        data = @compact_index.info(name, info_checksums[name])
         lines(data).map {|line| gem_parser.parse(line).unshift(name) }
       end
 
-      # parse the last, most recently updated line of the versions file to determine availability
       def available?
         return @available unless @available.nil?
-        return @available = false unless versions_data&.size&.nonzero?
-
-        line_end = versions_data.size - 1
-        return @available = false if versions_data[line_end] != "\n"
-
-        line_start = versions_data.rindex("\n", line_end - 1)
-        line_start ||= -1 # allow a single line versions file
-
-        @available = !split_last_word(versions_data, line_start + 1, line_end).nil?
+        @available = !info_checksums.empty?
       end
 
       private
 
-      # Search for a line starting with gem name, then return last space-separated word (the checksum)
-      def info_checksum(name)
-        return unless versions_data
-        return unless (line_start = rindex_of_gem(name))
-        return unless (line_end = versions_data.index("\n", line_start))
-        split_last_word(versions_data, line_start, line_end)
-      end
-
-      def gem_parser
-        @gem_parser ||= GemParser.new
-      end
-
-      def versions_data
-        @versions_data ||= begin
-          data = @compact_index.versions
-          strip_header!(data) if data
-          data.freeze
+      def info_checksums
+        @info_checksums ||= lines(@compact_index.versions).each_with_object({}) do |line, checksums|
+          parse_version_checksum(line, checksums)
         end
       end
 
-      def rindex_of_gem(name)
-        if (pos = versions_data.rindex("\n#{name} "))
-          pos + 1
-        elsif versions_data.start_with?("#{name} ")
-          0
-        end
+      def lines(data)
+        return [] if data.nil? || data.empty?
+        lines = data.split("\n")
+        header = lines.index("---")
+        header ? lines[header + 1..-1] : lines
       end
 
-      # This is similar to `string.split(" ").last` but it avoids allocating extra objects.
-      def split_last_word(string, line_start, line_end)
-        return unless line_start < line_end && line_start >= 0
-        word_start = string.rindex(" ", line_end).to_i + 1
-        return if word_start < line_start
-        string[word_start, line_end - word_start]
+      def gem_parser
+        @gem_parser ||= Gem::Resolver::APISet::GemParser.new
       end
 
-      def lines(string)
-        return [] if string.nil? || string.empty?
-        strip_header!(string)
-        string.split("\n")
-      end
+      # This is mostly the same as `split(" ", 3)` but it avoids allocating extra objects.
+      # This method gets called at least once for every gem when parsing versions.
+      def parse_version_checksum(line, checksums)
+        return unless (name_end = line.index(" ")) # Artifactory bug causes blank lines in artifactor index files
+        checksum_start = line.index(" ", name_end + 1)
+        return unless checksum_start
+        checksum_start += 1
+
+        checksum_end = line.size - checksum_start
 
-      def strip_header!(string)
-        header_end = string.index("---\n")
-        string.slice!(0, header_end + 4) if header_end
+        line.freeze # allows slicing into the string to not allocate a copy of the line
+        name = line[0, name_end]
+        checksum = line[checksum_start, checksum_end]
+        checksums[name.freeze] = checksum # freeze name since it is used as a hash key
       end
     end
   end
diff --git a/lib/bundler/compact_index_client/updater.rb b/lib/bundler/compact_index_client/updater.rb
index 88c7146900..6066fdc7c4 100644
--- a/lib/bundler/compact_index_client/updater.rb
+++ b/lib/bundler/compact_index_client/updater.rb
@@ -37,7 +37,8 @@ module Bundler
           file.digests = parse_digests(response)
           # server may ignore Range and return the full response
           if response.is_a?(Gem::Net::HTTPPartialContent)
-            break false unless file.append(response.body.byteslice(1..-1))
+            tail = response.body.byteslice(1..-1)
+            break false unless tail && file.append(tail)
           else
             file.write(response.body)
           end
diff --git a/lib/bundler/current_ruby.rb b/lib/bundler/current_ruby.rb
index 93e0c401c0..17c7655adb 100644
--- a/lib/bundler/current_ruby.rb
+++ b/lib/bundler/current_ruby.rb
@@ -1,5 +1,7 @@
 # frozen_string_literal: true
 
+require_relative "rubygems_ext"
+
 module Bundler
   # Returns current version of Ruby
   #
@@ -9,41 +11,28 @@ module Bundler
   end
 
   class CurrentRuby
-    KNOWN_MINOR_VERSIONS = %w[
-      1.8
-      1.9
-      2.0
-      2.1
-      2.2
-      2.3
-      2.4
-      2.5
-      2.6
-      2.7
-      3.0
-      3.1
-      3.2
-      3.3
-    ].freeze
-
-    KNOWN_MAJOR_VERSIONS = KNOWN_MINOR_VERSIONS.map {|v| v.split(".", 2).first }.uniq.freeze
-
-    KNOWN_PLATFORMS = %w[
-      jruby
-      maglev
-      mingw
-      mri
-      mswin
-      mswin64
-      rbx
-      ruby
-      truffleruby
-      windows
-      x64_mingw
-    ].freeze
+    ALL_RUBY_VERSIONS = [*18..27, *30..34, *40..41].freeze
+    KNOWN_MINOR_VERSIONS = ALL_RUBY_VERSIONS.map {|v| v.digits.reverse.join(".") }.freeze
+    KNOWN_MAJOR_VERSIONS = ALL_RUBY_VERSIONS.map {|v| v.digits.last.to_s }.uniq.freeze
+    PLATFORM_MAP = {
+      ruby: [Gem::Platform::RUBY, CurrentRuby::ALL_RUBY_VERSIONS],
+      mri: [Gem::Platform::RUBY, CurrentRuby::ALL_RUBY_VERSIONS],
+      rbx: [Gem::Platform::RUBY],
+      truffleruby: [Gem::Platform::RUBY],
+      jruby: [Gem::Platform::JAVA, [18, 19]],
+      windows: [Gem::Platform::WINDOWS, CurrentRuby::ALL_RUBY_VERSIONS],
+      # deprecated
+      mswin: [Gem::Platform::MSWIN, CurrentRuby::ALL_RUBY_VERSIONS],
+      mswin64: [Gem::Platform::MSWIN64, CurrentRuby::ALL_RUBY_VERSIONS - [18]],
+      mingw: [Gem::Platform::UNIVERSAL_MINGW, CurrentRuby::ALL_RUBY_VERSIONS],
+      x64_mingw: [Gem::Platform::UNIVERSAL_MINGW, CurrentRuby::ALL_RUBY_VERSIONS - [18, 19]],
+    }.each_with_object({}) do |(platform, spec), hash|
+      hash[platform] = spec[0]
+      spec[1]&.each {|version| hash[:"#{platform}_#{version}"] = spec[0] }
+    end.freeze
 
     def ruby?
-      return true if Bundler::GemHelpers.generic_local_platform_is_ruby?
+      return true if Bundler::MatchPlatform.generic_local_platform_is_ruby?
 
       !windows? && (RUBY_ENGINE == "ruby" || RUBY_ENGINE == "rbx" || RUBY_ENGINE == "maglev" || RUBY_ENGINE == "truffleruby")
     end
@@ -61,7 +50,10 @@ module Bundler
     end
 
     def maglev?
-      RUBY_ENGINE == "maglev"
+      removed_message =
+        "`CurrentRuby#maglev?` was removed with no replacement. Please use the " \
+        "built-in Ruby `RUBY_ENGINE` constant to check the Ruby implementation you are running on."
+      SharedHelpers.feature_removed!(removed_message)
     end
 
     def truffleruby?
@@ -82,11 +74,21 @@ module Bundler
         RUBY_VERSION.start_with?("#{version}.")
       end
 
-      KNOWN_PLATFORMS.each do |platform|
+      PLATFORM_MAP.keys.each do |platform|
         define_method(:"#{platform}_#{trimmed_version}?") do
           send(:"#{platform}?") && send(:"on_#{trimmed_version}?")
         end
       end
+
+      define_method(:"maglev_#{trimmed_version}?") do
+        removed_message =
+          "`CurrentRuby##{__method__}` was removed with no replacement. Please use the " \
+          "built-in Ruby `RUBY_ENGINE` and `RUBY_VERSION` constants to perform a similar check."
+
+        SharedHelpers.feature_removed!(removed_message)
+
+        send(:"maglev?") && send(:"on_#{trimmed_version}?")
+      end
     end
   end
 end
diff --git a/lib/bundler/definition.rb b/lib/bundler/definition.rb
index 6cf1f9a255..7a95671471 100644
--- a/lib/bundler/definition.rb
+++ b/lib/bundler/definition.rb
@@ -1,25 +1,28 @@
 # frozen_string_literal: true
 
 require_relative "lockfile_parser"
+require_relative "worker"
 
 module Bundler
   class Definition
-    include GemHelpers
-
     class << self
       # Do not create or modify a lockfile (Makes #lock a noop)
       attr_accessor :no_lock
     end
 
+    attr_writer :lockfile, :overrides
+
     attr_reader(
       :dependencies,
+      :locked_checksums,
       :locked_deps,
       :locked_gems,
+      :overrides,
       :platforms,
       :ruby_version,
       :lockfile,
       :gemfiles,
-      :locked_checksums
+      :sources
     )
 
     # Given a gemfile and lockfile creates a Bundler definition
@@ -35,7 +38,10 @@ module Bundler
 
       raise GemfileNotFound, "#{gemfile} not found" unless gemfile.file?
 
-      Dsl.evaluate(gemfile, lockfile, unlock)
+      Plugin.hook(Plugin::Events::GEM_BEFORE_EVAL, gemfile, lockfile)
+      Dsl.evaluate(gemfile, lockfile, unlock).tap do |definition|
+        Plugin.hook(Plugin::Events::GEM_AFTER_EVAL, definition)
+      end
     end
 
     #
@@ -56,23 +62,37 @@ module Bundler
     #   to be updated or true if all gems should be updated
     # @param ruby_version [Bundler::RubyVersion, nil] Requested Ruby Version
     # @param optional_groups [Array(String)] A list of optional groups
-    def initialize(lockfile, dependencies, sources, unlock, ruby_version = nil, optional_groups = [], gemfiles = [])
-      if [true, false].include?(unlock)
+    def initialize(lockfile, dependencies, sources, unlock, ruby_version = nil, optional_groups = [], gemfiles = [], overrides = [])
+      unlock ||= {}
+
+      if unlock == true
+        @unlocking_all = true
+        strict = false
         @unlocking_bundler = false
         @unlocking = unlock
+        @sources_to_unlock = []
+        @unlocking_ruby = false
+        @explicit_unlocks = []
+        conservative = false
       else
+        @unlocking_all = false
+        strict = unlock.delete(:strict)
         @unlocking_bundler = unlock.delete(:bundler)
         @unlocking = unlock.any? {|_k, v| !Array(v).empty? }
+        @sources_to_unlock = unlock.delete(:sources) || []
+        @unlocking_ruby = unlock.delete(:ruby)
+        @explicit_unlocks = unlock.delete(:gems) || []
+        conservative = unlock.delete(:conservative)
       end
 
       @dependencies    = dependencies
       @sources         = sources
-      @unlock          = unlock
       @optional_groups = optional_groups
       @prefer_local    = false
       @specs           = nil
       @ruby_version    = ruby_version
       @gemfiles        = gemfiles
+      @overrides       = overrides
 
       @lockfile               = lockfile
       @lockfile_contents      = String.new
@@ -81,75 +101,68 @@ module Bundler
       @resolved_bundler_version = nil
 
       @locked_ruby_version = nil
-      @new_platform = nil
-      @removed_platform = nil
+      @new_platforms = []
+      @removed_platforms = []
+      @originally_invalid_platforms = []
 
       if lockfile_exists?
         @lockfile_contents = Bundler.read_file(lockfile)
-        @locked_gems = LockfileParser.new(@lockfile_contents)
+        @locked_gems = LockfileParser.new(@lockfile_contents, strict: strict)
         @locked_platforms = @locked_gems.platforms
+        @most_specific_locked_platform = @locked_gems.most_specific_locked_platform
         @platforms = @locked_platforms.dup
         @locked_bundler_version = @locked_gems.bundler_version
         @locked_ruby_version = @locked_gems.ruby_version
-        @originally_locked_deps = @locked_gems.dependencies
+        @locked_deps = @locked_gems.dependencies
+        Override.attach(@locked_gems.specs, @overrides)
         @originally_locked_specs = SpecSet.new(@locked_gems.specs)
+        @originally_locked_sources = @locked_gems.sources
         @locked_checksums = @locked_gems.checksums
 
-        if unlock != true
-          @locked_deps    = @originally_locked_deps
-          @locked_specs   = @originally_locked_specs
-          @locked_sources = @locked_gems.sources
-        else
-          @unlock         = {}
-          @locked_deps    = {}
+        if @unlocking_all
           @locked_specs   = SpecSet.new([])
           @locked_sources = []
+        else
+          @locked_specs   = @originally_locked_specs
+          @locked_sources = @originally_locked_sources
         end
-      else
-        @unlock         = {}
-        @platforms      = []
-        @locked_gems    = nil
-        @locked_deps    = {}
-        @locked_specs   = SpecSet.new([])
-        @originally_locked_deps = {}
-        @originally_locked_specs = @locked_specs
-        @locked_sources = []
-        @locked_platforms = []
-        @locked_checksums = nil
-      end
 
-      locked_gem_sources = @locked_sources.select {|s| s.is_a?(Source::Rubygems) }
-      @multisource_allowed = locked_gem_sources.size == 1 && locked_gem_sources.first.multiple_remotes? && Bundler.frozen_bundle?
+        locked_gem_sources = @originally_locked_sources.select {|s| s.is_a?(Source::Rubygems) }
+        multisource_lockfile = locked_gem_sources.size == 1 && locked_gem_sources.first.multiple_remotes?
 
-      if @multisource_allowed
-        unless sources.aggregate_global_source?
+        if multisource_lockfile
           msg = "Your lockfile contains a single rubygems source section with multiple remotes, which is insecure. Make sure you run `bundle install` in non frozen mode and commit the result to make your lockfile secure."
 
-          Bundler::SharedHelpers.major_deprecation 2, msg
+          Bundler::SharedHelpers.feature_removed! msg
         end
-
-        @sources.merged_gem_lockfile_sections!(locked_gem_sources.first)
+      else
+        @locked_gems = nil
+        @locked_platforms = []
+        @most_specific_locked_platform = nil
+        @platforms      = []
+        @locked_deps    = {}
+        @locked_specs   = SpecSet.new([])
+        @locked_sources = []
+        @originally_locked_specs = @locked_specs
+        @originally_locked_sources = @locked_sources
+        @locked_checksums = Bundler.settings[:lockfile_checksums]
       end
 
-      @sources_to_unlock = @unlock.delete(:sources) || []
-      @unlock[:ruby] ||= if @ruby_version && locked_ruby_version_object
+      @unlocking_ruby ||= if @ruby_version && locked_ruby_version_object
         @ruby_version.diff(locked_ruby_version_object)
       end
-      @unlocking ||= @unlock[:ruby] ||= (!@locked_ruby_version ^ !@ruby_version)
+      @unlocking ||= @unlocking_ruby ||= (!@locked_ruby_version ^ !@ruby_version)
 
-      add_current_platform unless Bundler.frozen_bundle?
+      @current_platform_missing = add_current_platform unless Bundler.frozen_bundle?
 
-      converge_path_sources_to_gemspec_sources
-      @path_changes = converge_paths
       @source_changes = converge_sources
+      @path_changes = converge_paths
 
-      @explicit_unlocks = @unlock.delete(:gems) || []
-
-      if @unlock[:conservative]
+      if conservative
         @gems_to_unlock = @explicit_unlocks.any? ? @explicit_unlocks : @dependencies.map(&:name)
       else
         eager_unlock = @explicit_unlocks.map {|name| Dependency.new(name, ">= 0") }
-        @gems_to_unlock = @locked_specs.for(eager_unlock, false, platforms).map(&:name).uniq
+        @gems_to_unlock = @locked_specs.for(eager_unlock, platforms).map(&:name).uniq
       end
 
       @dependency_changes = converge_dependencies
@@ -162,25 +175,65 @@ module Bundler
       @gem_version_promoter ||= GemVersionPromoter.new
     end
 
-    def resolve_only_locally!
+    def check!
+      # If dependencies have changed, we need to resolve remotely. Otherwise,
+      # since we'll be resolving with a single local source, we may end up
+      # locking gems under the wrong source in the lockfile, and missing lockfile
+      # checksums
+      resolve_remotely! if @dependency_changes
+
+      # Now do a local only resolve, to verify if any gems are missing locally
       sources.local_only!
       resolve
     end
 
+    #
+    # Setup sources according to the given options and the state of the
+    # definition.
+    #
+    # @return [Boolean] Whether fetching remote information will be necessary or not
+    #
+    def setup_domain!(options = {})
+      prefer_local! if options[:"prefer-local"]
+
+      sources.cached!
+
+      if options[:add_checksums] || (!options[:local] && install_needed?)
+        sources.remote!
+        true
+      else
+        Bundler.settings.set_command_option(:jobs, 1) unless install_needed? # to avoid the overhead of Bundler::Worker
+        sources.local!
+        false
+      end
+    end
+
     def resolve_with_cache!
+      with_cache!
+
+      resolve
+    end
+
+    def with_cache!
       sources.local!
       sources.cached!
-      resolve
     end
 
     def resolve_remotely!
+      remotely!
+
+      resolve
+    end
+
+    def remotely!
       sources.cached!
       sources.remote!
-      resolve
     end
 
     def prefer_local!
       @prefer_local = true
+
+      sources.prefer_local!
     end
 
     # For given dependency list returns a SpecSet with Gemspec of all the required
@@ -202,7 +255,8 @@ module Bundler
     end
 
     def missing_specs
-      resolve.materialize(requested_dependencies).missing_specs
+      preload_git_sources
+      resolve.missing_specs_for(requested_dependencies)
     end
 
     def missing_specs?
@@ -213,7 +267,8 @@ module Bundler
     rescue BundlerError => e
       @resolve = nil
       @resolver = nil
-      @resolution_packages = nil
+      @resolution_base = nil
+      @source_requirements = nil
       @specs = nil
 
       Bundler.ui.debug "The definition is missing dependencies, failed to resolve & materialize locally (#{e})"
@@ -237,12 +292,17 @@ module Bundler
     end
 
     def filter_relevant(dependencies)
-      platforms_array = [generic_local_platform].freeze
       dependencies.select do |d|
-        d.should_include? && !d.gem_platforms(platforms_array).empty?
+        relevant_deps?(d)
       end
     end
 
+    def relevant_deps?(dep)
+      platforms_array = [Bundler.generic_local_platform].freeze
+
+      dep.should_include? && !dep.gem_platforms(platforms_array).empty?
+    end
+
     def locked_dependencies
       @locked_deps.values
     end
@@ -265,11 +325,7 @@ module Bundler
       groups.map!(&:to_sym)
       deps = current_dependencies # always returns a new array
       deps.select! do |d|
-        if RUBY_VERSION >= "3.1"
-          d.groups.intersect?(groups)
-        else
-          !(d.groups & groups).empty?
-        end
+        d.groups.intersect?(groups)
       end
       deps
     end
@@ -289,34 +345,30 @@ module Bundler
           SpecSet.new(filter_specs(@locked_specs, @dependencies - deleted_deps))
         else
           Bundler.ui.debug "Found no changes, using resolution from the lockfile"
-          if @removed_platform || @locked_gems.may_include_redundant_platform_specific_gems?
+          if @removed_platforms.any? || @locked_gems.may_include_redundant_platform_specific_gems?
             SpecSet.new(filter_specs(@locked_specs, @dependencies))
           else
             @locked_specs
           end
         end
       else
-        if lockfile_exists?
-          Bundler.ui.debug "Found changes from the lockfile, re-resolving dependencies because #{change_reason}"
-        else
-          Bundler.ui.debug "Resolving dependencies because there's no lockfile"
-        end
+        Bundler.ui.debug resolve_needed_reason
 
         start_resolution
       end
     end
 
     def spec_git_paths
-      sources.git_sources.map {|s| File.realpath(s.path) if File.exist?(s.path) }.compact
+      sources.git_sources.filter_map {|s| File.realpath(s.path) if File.exist?(s.path) }
     end
 
     def groups
-      dependencies.map(&:groups).flatten.uniq
+      dependencies.flat_map(&:groups).uniq
     end
 
     def lock(file_or_preserve_unknown_sections = false, preserve_unknown_sections_or_unused = false)
       if [true, false, nil].include?(file_or_preserve_unknown_sections)
-        target_lockfile = lockfile || Bundler.default_lockfile
+        target_lockfile = lockfile
         preserve_unknown_sections = file_or_preserve_unknown_sections
       else
         target_lockfile = file_or_preserve_unknown_sections
@@ -330,15 +382,53 @@ module Bundler
 
         msg = "`Definition#lock` was passed a target file argument. #{suggestion}"
 
-        Bundler::SharedHelpers.major_deprecation 2, msg
+        Bundler::SharedHelpers.feature_removed! msg
       end
 
       write_lock(target_lockfile, preserve_unknown_sections)
     end
 
+    def write_lock(file, preserve_unknown_sections)
+      return if Definition.no_lock || !lockfile || file.nil?
+
+      contents = to_lock
+
+      # Convert to \r\n if the existing lock has them
+      # i.e., Windows with `git config core.autocrlf=true`
+      contents.gsub!(/\n/, "\r\n") if @lockfile_contents.match?("\r\n")
+
+      if @locked_bundler_version
+        locked_major = @locked_bundler_version.segments.first
+        current_major = bundler_version_to_lock.segments.first
+
+        updating_major = locked_major < current_major
+      end
+
+      preserve_unknown_sections ||= !updating_major && (Bundler.frozen_bundle? || !(unlocking? || @unlocking_bundler))
+
+      if File.exist?(file) && lockfiles_equal?(@lockfile_contents, contents, preserve_unknown_sections)
+        return if Bundler.frozen_bundle?
+        SharedHelpers.filesystem_access(file) { FileUtils.touch(file) }
+        return
+      end
+
+      if Bundler.frozen_bundle?
+        Bundler.ui.error "Cannot write a changed lockfile while frozen."
+        return
+      end
+
+      begin
+        SharedHelpers.filesystem_access(file) do |p|
+          File.open(p, "wb") {|f| f.puts(contents) }
+        end
+      rescue ReadOnlyFileSystemError
+        raise ProductionError, lockfile_changes_summary("file system is read-only")
+      end
+    end
+
     def locked_ruby_version
       return unless ruby_version
-      if @unlock[:ruby] || !@locked_ruby_version
+      if @unlocking_ruby || !@locked_ruby_version
         Bundler::RubyVersion.system
       else
         @locked_ruby_version
@@ -367,51 +457,22 @@ module Bundler
     end
 
     def ensure_equivalent_gemfile_and_lockfile(explicit_flag = false)
-      added =   []
-      deleted = []
-      changed = []
-
-      new_platforms = @platforms - @locked_platforms
-      deleted_platforms = @locked_platforms - @platforms
-      added.concat new_platforms.map {|p| "* platform: #{p}" }
-      deleted.concat deleted_platforms.map {|p| "* platform: #{p}" }
-
-      added.concat new_deps.map {|d| "* #{pretty_dep(d)}" } if new_deps.any?
-      deleted.concat deleted_deps.map {|d| "* #{pretty_dep(d)}" } if deleted_deps.any?
-
-      both_sources = Hash.new {|h, k| h[k] = [] }
-      current_dependencies.each {|d| both_sources[d.name][0] = d }
-      current_locked_dependencies.each {|d| both_sources[d.name][1] = d }
+      return unless Bundler.frozen_bundle?
 
-      both_sources.each do |name, (dep, lock_dep)|
-        next if dep.nil? || lock_dep.nil?
-
-        gemfile_source = dep.source || default_source
-        lock_source = lock_dep.source || default_source
-        next if lock_source.include?(gemfile_source)
-
-        gemfile_source_name = dep.source ? gemfile_source.to_gemfile : "no specified source"
-        lockfile_source_name = lock_dep.source ? lock_source.to_gemfile : "no specified source"
-        changed << "* #{name} from `#{lockfile_source_name}` to `#{gemfile_source_name}`"
-      end
+      raise ProductionError, "Frozen mode is set, but there's no lockfile" unless lockfile_exists?
 
-      reason = change_reason
-      msg = String.new
-      msg << "#{reason.capitalize.strip}, but the lockfile can't be updated because frozen mode is set"
-      msg << "\n\nYou have added to the Gemfile:\n" << added.join("\n") if added.any?
-      msg << "\n\nYou have deleted from the Gemfile:\n" << deleted.join("\n") if deleted.any?
-      msg << "\n\nYou have changed in the Gemfile:\n" << changed.join("\n") if changed.any?
-      msg << "\n\nRun `bundle install` elsewhere and add the updated #{SharedHelpers.relative_gemfile_path} to version control.\n"
+      msg = lockfile_changes_summary("frozen mode is set")
+      return unless msg
 
       unless explicit_flag
         suggested_command = unless Bundler.settings.locations("frozen").keys.include?(:env)
           "bundle config set frozen false"
         end
-        msg << "If this is a development machine, remove the #{SharedHelpers.relative_lockfile_path} " \
+        msg << "\n\nIf this is a development machine, remove the #{SharedHelpers.relative_lockfile_path} " \
                "freeze by running `#{suggested_command}`." if suggested_command
       end
 
-      raise ProductionError, msg if added.any? || deleted.any? || changed.any? || !nothing_changed?
+      raise ProductionError, msg
     end
 
     def validate_runtime!
@@ -432,12 +493,6 @@ module Bundler
                 "Your Ruby version is #{actual}, but your Gemfile specified #{expected}"
               when :engine_version
                 "Your #{Bundler::RubyVersion.system.engine} version is #{actual}, but your Gemfile specified #{ruby_version.engine} #{expected}"
-              when :patchlevel
-                if !expected.is_a?(String)
-                  "The Ruby patchlevel in your Gemfile must be a string"
-                else
-                  "Your Ruby patchlevel is #{actual}, but your Gemfile specified #{expected}"
-                end
         end
 
         raise RubyVersionMismatch, msg
@@ -445,146 +500,213 @@ module Bundler
     end
 
     def validate_platforms!
-      return if current_platform_locked?
+      return if current_platform_locked? || @platforms.include?(Gem::Platform::RUBY)
 
       raise ProductionError, "Your bundle only supports platforms #{@platforms.map(&:to_s)} " \
-        "but your local platform is #{local_platform}. " \
-        "Add the current platform to the lockfile with\n`bundle lock --add-platform #{local_platform}` and try again."
+        "but your local platform is #{Bundler.local_platform}. " \
+        "Add the current platform to the lockfile with\n`bundle lock --add-platform #{Bundler.local_platform}` and try again."
+    end
+
+    def normalize_platforms
+      resolve.normalize_platforms!(current_dependencies, platforms)
+
+      @resolve = SpecSet.new(resolve.for(current_dependencies, @platforms))
     end
 
     def add_platform(platform)
-      @new_platform ||= !@platforms.include?(platform)
-      @platforms |= [platform]
+      return if @platforms.include?(platform)
+
+      @new_platforms << platform
+      @platforms << platform
     end
 
     def remove_platform(platform)
-      removed_platform = @platforms.delete(Gem::Platform.new(platform))
-      @removed_platform ||= removed_platform
-      return if removed_platform
-      raise InvalidOption, "Unable to remove the platform `#{platform}` since the only platforms are #{@platforms.join ", "}"
-    end
+      raise InvalidOption, "Unable to remove the platform `#{platform}` since the only platforms are #{@platforms.join ", "}" unless @platforms.include?(platform)
 
-    def most_specific_locked_platform
-      @platforms.min_by do |bundle_platform|
-        platform_specificity_match(bundle_platform, local_platform)
-      end
+      @removed_platforms << platform
+      @platforms.delete(platform)
     end
 
-    attr_reader :sources
-    private :sources
-
     def nothing_changed?
-      return false unless lockfile_exists?
-
-      !@source_changes &&
-        !@dependency_changes &&
-        !@new_platform &&
-        !@path_changes &&
-        !@local_changes &&
-        !@missing_lockfile_dep &&
-        !@unlocking_bundler &&
-        !@locked_spec_with_missing_deps &&
-        !@locked_spec_with_invalid_deps
+      !something_changed?
     end
 
     def no_resolve_needed?
-      !unlocking? && nothing_changed?
+      !resolve_needed?
     end
 
     def unlocking?
       @unlocking
     end
 
-    private
+    def add_checksums
+      require "rubygems/package"
 
-    def should_add_extra_platforms?
-      !lockfile_exists? && generic_local_platform_is_ruby? && !Bundler.settings[:force_ruby_platform]
-    end
+      @locked_checksums = true
 
-    def lockfile_exists?
-      file_exists?(lockfile)
-    end
+      setup_domain!(add_checksums: true)
 
-    def file_exists?(file)
-      file && File.exist?(file)
+      # force materialization to real specifications, so that checksums are fetched
+      specs.each do |spec|
+        next unless spec.source.is_a?(Bundler::Source::Rubygems)
+        # Checksum was fetched from the compact index API.
+        next if !spec.source.checksum_store.missing?(spec) && !spec.source.checksum_store.empty?(spec)
+        # The gem isn't installed, can't compute the checksum.
+        next unless spec.loaded_from
+
+        package = Gem::Package.new(spec.source.cached_built_in_gem(spec))
+        checksum = Checksum.from_gem_package(package)
+        spec.source.checksum_store.register(spec, checksum)
+      end
     end
 
-    def write_lock(file, preserve_unknown_sections)
-      return if Definition.no_lock
+    private
 
-      contents = to_lock
+    def lockfile_changes_summary(update_refused_reason)
+      added =   []
+      deleted = []
+      changed = []
 
-      # Convert to \r\n if the existing lock has them
-      # i.e., Windows with `git config core.autocrlf=true`
-      contents.gsub!(/\n/, "\r\n") if @lockfile_contents.match?("\r\n")
+      added.concat @new_platforms.map {|p| "* platform: #{p}" }
+      deleted.concat @removed_platforms.map {|p| "* platform: #{p}" }
 
-      if @locked_bundler_version
-        locked_major = @locked_bundler_version.segments.first
-        current_major = bundler_version_to_lock.segments.first
+      added.concat new_deps.map {|d| "* #{pretty_dep(d)}" } if new_deps.any?
+      deleted.concat deleted_deps.map {|d| "* #{pretty_dep(d)}" } if deleted_deps.any?
 
-        updating_major = locked_major < current_major
-      end
+      both_sources = Hash.new {|h, k| h[k] = [] }
+      current_dependencies.each {|d| both_sources[d.name][0] = d }
+      current_locked_dependencies.each {|d| both_sources[d.name][1] = d }
 
-      preserve_unknown_sections ||= !updating_major && (Bundler.frozen_bundle? || !(unlocking? || @unlocking_bundler))
+      both_sources.each do |name, (dep, lock_dep)|
+        next if dep.nil? || lock_dep.nil?
 
-      if file_exists?(file) && lockfiles_equal?(@lockfile_contents, contents, preserve_unknown_sections)
-        return if Bundler.frozen_bundle?
-        SharedHelpers.filesystem_access(file) { FileUtils.touch(file) }
-        return
-      end
+        gemfile_source = dep.source || default_source
+        lock_source = lock_dep.source || default_source
+        next if lock_source.include?(gemfile_source)
 
-      if Bundler.frozen_bundle?
-        Bundler.ui.error "Cannot write a changed lockfile while frozen."
-        return
+        gemfile_source_name = dep.source ? gemfile_source.to_gemfile : "no specified source"
+        lockfile_source_name = lock_dep.source ? lock_source.to_gemfile : "no specified source"
+        changed << "* #{name} from `#{lockfile_source_name}` to `#{gemfile_source_name}`"
       end
 
-      SharedHelpers.filesystem_access(file) do |p|
-        File.open(p, "wb") {|f| f.puts(contents) }
-      end
+      return unless added.any? || deleted.any? || changed.any? || resolve_needed?
+
+      msg = String.new("#{change_reason[0].upcase}#{change_reason[1..-1].strip}, but ")
+      msg << "the lockfile " unless msg.start_with?("Your lockfile")
+      msg << "can't be updated because #{update_refused_reason}"
+      msg << "\n\nYou have added to the Gemfile:\n" << added.join("\n") if added.any?
+      msg << "\n\nYou have deleted from the Gemfile:\n" << deleted.join("\n") if deleted.any?
+      msg << "\n\nYou have changed in the Gemfile:\n" << changed.join("\n") if changed.any?
+      msg << "\n\nRun `bundle install` elsewhere and add the updated #{SharedHelpers.relative_lockfile_path} to version control.\n" unless unlocking?
+      msg
+    end
+
+    def install_needed?
+      resolve_needed? || missing_specs?
+    end
+
+    def something_changed?
+      return true unless lockfile_exists?
+
+      @source_changes ||
+        @dependency_changes ||
+        @current_platform_missing ||
+        @new_platforms.any? ||
+        @path_changes ||
+        @local_changes ||
+        @missing_lockfile_dep ||
+        @unlocking_bundler ||
+        @locked_spec_with_missing_checksums ||
+        @locked_spec_with_empty_checksums ||
+        @locked_spec_with_missing_deps ||
+        @locked_spec_with_invalid_deps
+    end
+
+    def resolve_needed?
+      unlocking? || something_changed?
+    end
+
+    def should_add_extra_platforms?
+      !lockfile_exists? && Bundler::MatchPlatform.generic_local_platform_is_ruby? && !Bundler.settings[:force_ruby_platform]
+    end
+
+    def lockfile_exists?
+      lockfile && File.exist?(lockfile)
     end
 
     def resolver
-      @resolver ||= Resolver.new(resolution_packages, gem_version_promoter)
+      @resolver ||= new_resolver(resolution_base)
     end
 
     def expanded_dependencies
-      dependencies_with_bundler + metadata_dependencies
+      apply_overrides_to(dependencies_with_bundler) + metadata_dependencies
+    end
+
+    def apply_overrides_to(deps)
+      return deps if @overrides.empty?
+      deps.map {|dep| apply_override_to(dep) }
+    end
+
+    def apply_override_to(dep)
+      override = Override.find_for(@overrides, dep.name, :version)
+      return dep unless override
+      new_dep = dep.dup
+      new_dep.instance_variable_set(:@requirement, override.apply_to(dep.requirement))
+      new_dep
     end
 
     def dependencies_with_bundler
       return dependencies unless @unlocking_bundler
-      return dependencies if dependencies.map(&:name).include?("bundler")
+      return dependencies if dependencies.any? {|d| d.name == "bundler" }
 
       [Dependency.new("bundler", @unlocking_bundler)] + dependencies
     end
 
-    def resolution_packages
-      @resolution_packages ||= begin
+    def resolution_base
+      @resolution_base ||= begin
         last_resolve = converge_locked_specs
-        remove_invalid_platforms!(current_dependencies)
-        packages = Resolver::Base.new(source_requirements, expanded_dependencies, last_resolve, @platforms, locked_specs: @originally_locked_specs, unlock: @gems_to_unlock, prerelease: gem_version_promoter.pre?)
-        packages = additional_base_requirements_to_prevent_downgrades(packages, last_resolve)
-        packages = additional_base_requirements_to_force_updates(packages)
-        packages
+        remove_invalid_platforms!
+        base = new_resolution_base(last_resolve: last_resolve, unlock: @unlocking_all || @gems_to_unlock)
+        base = additional_base_requirements_to_prevent_downgrades(base)
+        base = additional_base_requirements_to_force_updates(base)
+        base
       end
     end
 
-    def filter_specs(specs, deps)
-      SpecSet.new(specs).for(deps, false, platforms)
+    def filter_specs(specs, deps, skips: [])
+      SpecSet.new(specs).for(deps, platforms, skips: skips)
     end
 
     def materialize(dependencies)
-      specs = resolve.materialize(dependencies)
-      missing_specs = specs.missing_specs
+      specs = begin
+        resolve.materialize(dependencies)
+      rescue IncorrectLockfileDependencies => e
+        raise if Bundler.frozen_bundle?
+
+        reresolve_without([e.spec])
+        retry
+      end
+
+      missing_specs = resolve.missing_specs
 
       if missing_specs.any?
         missing_specs.each do |s|
           locked_gem = @locked_specs[s.name].last
           next if locked_gem.nil? || locked_gem.version != s.version || sources.local_mode?
-          raise GemNotFound, "Your bundle is locked to #{locked_gem} from #{locked_gem.source}, but that version can " \
-                             "no longer be found in that source. That means the author of #{locked_gem} has removed it. " \
-                             "You'll need to update your bundle to a version other than #{locked_gem} that hasn't been " \
-                             "removed in order to install."
+
+          message = if sources.implicit_global_source?
+            "Because your Gemfile specifies no global remote source, your bundle is locked to " \
+            "#{locked_gem} from #{locked_gem.source}. However, #{locked_gem} is not installed. You'll " \
+            "need to either add a global remote source to your Gemfile or make sure #{locked_gem} is " \
+            "available locally before rerunning Bundler."
+          else
+            "Your bundle is locked to #{locked_gem} from #{locked_gem.source}, but that version can " \
+            "no longer be found in that source. That means the author of #{locked_gem} has removed it. " \
+            "You'll need to update your bundle to a version other than #{locked_gem} that hasn't been " \
+            "removed in order to install."
+          end
+
+          raise GemNotFound, message
         end
 
         missing_specs_list = missing_specs.group_by(&:source).map do |source, missing_specs_for_source|
@@ -594,104 +716,182 @@ module Bundler
         raise GemNotFound, "Could not find #{missing_specs_list.join(" nor ")}"
       end
 
-      incomplete_specs = specs.incomplete_specs
+      partially_missing_specs = resolve.partially_missing_specs
+
+      if partially_missing_specs.any? && !sources.local_mode?
+        Bundler.ui.warn "Some locked specs have possibly been yanked (#{partially_missing_specs.map(&:full_name).join(", ")}). Ignoring them..."
+
+        resolve.delete(partially_missing_specs)
+      end
+
+      incomplete_specs = resolve.incomplete_specs
       loop do
         break if incomplete_specs.empty?
 
         Bundler.ui.debug("The lockfile does not have all gems needed for the current platform though, Bundler will still re-resolve dependencies")
         sources.remote!
-        resolution_packages.delete(incomplete_specs)
-        @resolve = start_resolution
+        reresolve_without(incomplete_specs)
         specs = resolve.materialize(dependencies)
 
-        still_incomplete_specs = specs.incomplete_specs
+        still_incomplete_specs = resolve.incomplete_specs
 
         if still_incomplete_specs == incomplete_specs
-          package = resolution_packages.get_package(incomplete_specs.first.name)
-          resolver.raise_not_found! package
+          resolver.raise_incomplete! incomplete_specs
         end
 
         incomplete_specs = still_incomplete_specs
       end
 
+      insecurely_materialized_specs = resolve.insecurely_materialized_specs
+
+      if insecurely_materialized_specs.any?
+        Bundler.ui.warn "The following platform specific gems are getting installed, yet the lockfile includes only their generic ruby version:\n" \
+                        " * #{insecurely_materialized_specs.map(&:full_name).join("\n * ")}\n" \
+                        "Please run `bundle lock --normalize-platforms` and commit the resulting lockfile.\n" \
+                        "Alternatively, you may run `bundle lock --add-platform <list-of-platforms-that-you-want-to-support>`"
+      end
+
       bundler = sources.metadata_source.specs.search(["bundler", Bundler.gem_version]).last
       specs["bundler"] = bundler
 
       specs
     end
 
+    def reresolve_without(incomplete_specs)
+      resolution_base.delete(incomplete_specs)
+      @resolve = start_resolution
+    end
+
     def start_resolution
+      local_platform_needed_for_resolvability = @most_specific_non_local_locked_platform && !@platforms.include?(Bundler.local_platform)
+      @platforms << Bundler.local_platform if local_platform_needed_for_resolvability
+
       result = SpecSet.new(resolver.start)
 
       @resolved_bundler_version = result.find {|spec| spec.name == "bundler" }&.version
-      @platforms = result.add_extra_platforms!(platforms) if should_add_extra_platforms?
 
-      result.complete_platforms!(platforms)
+      @new_platforms.each do |platform|
+        incomplete_specs = result.incomplete_specs_for_platform(current_dependencies, platform)
 
-      SpecSet.new(result.for(dependencies, false, @platforms))
-    end
+        if incomplete_specs.any?
+          resolver.raise_incomplete! incomplete_specs
+        end
+      end
 
-    def precompute_source_requirements_for_indirect_dependencies?
-      sources.non_global_rubygems_sources.all?(&:dependency_api_available?) && !sources.aggregate_global_source?
-    end
+      if @most_specific_non_local_locked_platform
+        if result.incomplete_for_platform?(current_dependencies, @most_specific_non_local_locked_platform)
+          @platforms.delete(@most_specific_non_local_locked_platform)
+        elsif local_platform_needed_for_resolvability
+          @platforms.delete(Bundler.local_platform)
+        end
+      end
 
-    def pin_locally_available_names(source_requirements)
-      source_requirements.each_with_object({}) do |(name, original_source), new_source_requirements|
-        local_source = original_source.dup
-        local_source.local_only!
+      if should_add_extra_platforms?
+        result.add_extra_platforms!(platforms)
+      elsif @originally_invalid_platforms.any?
+        result.add_originally_invalid_platforms!(platforms, @originally_invalid_platforms)
+      end
 
-        new_source_requirements[name] = if local_source.specs.search(name).any?
-          local_source
-        else
-          original_source
-        end
+      SpecSet.new(result.for(dependencies, @platforms | [Gem::Platform::RUBY]))
+    end
+
+    def precompute_source_requirements_for_indirect_dependencies?
+      if sources.non_global_rubygems_sources.all?(&:dependency_api_available?)
+        true
+      else
+        non_dependency_api_warning
+        false
       end
     end
 
-    def current_ruby_platform_locked?
-      return false unless generic_local_platform_is_ruby?
-      return false if Bundler.settings[:force_ruby_platform] && !@platforms.include?(Gem::Platform::RUBY)
+    def non_dependency_api_warning
+      non_api_sources = sources.non_global_rubygems_sources.reject(&:dependency_api_available?)
+      non_api_source_names = non_api_sources.map {|d| "  * #{d}" }.join("\n")
 
-      current_platform_locked?
+      msg = String.new
+      msg << "Your Gemfile contains scoped sources that don't implement a dependency API, namely:\n\n"
+      msg << non_api_source_names
+      msg << "\n\nUsing the above gem servers may result in installing unexpected gems. " \
+        "To resolve this warning, make sure you use gem servers that implement dependency APIs, " \
+        "such as gemstash or geminabox gem servers."
+      Bundler.ui.warn msg
     end
 
     def current_platform_locked?
       @platforms.any? do |bundle_platform|
-        MatchPlatform.platforms_match?(bundle_platform, local_platform)
+        Bundler.generic_local_platform == bundle_platform || Bundler.local_platform === bundle_platform
       end
     end
 
     def add_current_platform
-      return if current_ruby_platform_locked?
+      return if @platforms.include?(Bundler.local_platform)
+
+      @most_specific_non_local_locked_platform = find_most_specific_locked_platform
+      return if @most_specific_non_local_locked_platform
 
-      add_platform(local_platform)
+      @platforms << Bundler.local_platform
+      true
     end
 
-    def change_reason
-      if unlocking?
-        unlock_targets = if @gems_to_unlock.any?
-          ["gems", @gems_to_unlock]
-        elsif @sources_to_unlock.any?
-          ["sources", @sources_to_unlock]
+    def find_most_specific_locked_platform
+      return unless current_platform_locked?
+
+      @most_specific_locked_platform
+    end
+
+    def resolve_needed_reason
+      if lockfile_exists?
+        if unlocking?
+          "Re-resolving dependencies because #{unlocking_reason}"
+        else
+          "Found changes from the lockfile, re-resolving dependencies because #{lockfile_changed_reason}"
         end
+      else
+        "Resolving dependencies because there's no lockfile"
+      end
+    end
 
-        unlock_reason = if unlock_targets
-          "#{unlock_targets.first}: (#{unlock_targets.last.join(", ")})"
+    def change_reason
+      if resolve_needed?
+        if unlocking?
+          unlocking_reason
         else
-          @unlock[:ruby] ? "ruby" : ""
+          lockfile_changed_reason
         end
+      else
+        "some dependencies were deleted from your gemfile"
+      end
+    end
+
+    def unlocking_reason
+      unlock_targets = if @gems_to_unlock.any?
+        ["gems", @gems_to_unlock]
+      elsif @sources_to_unlock.any?
+        ["sources", @sources_to_unlock]
+      end
 
-        return "bundler is unlocking #{unlock_reason}"
+      unlock_reason = if unlock_targets
+        "#{unlock_targets.first}: (#{unlock_targets.last.join(", ")})"
+      else
+        @unlocking_ruby ? "ruby" : ""
       end
+
+      "bundler is unlocking #{unlock_reason}"
+    end
+
+    def lockfile_changed_reason
       [
         [@source_changes, "the list of sources changed"],
         [@dependency_changes, "the dependencies in your gemfile changed"],
-        [@new_platform, "you added a new platform to your gemfile"],
+        [@current_platform_missing, "your lockfile is missing the current platform"],
+        [@new_platforms.any?, "you are adding a new platform to your lockfile"],
         [@path_changes, "the gemspecs for path gems changed"],
         [@local_changes, "the gemspecs for git local gems changed"],
-        [@missing_lockfile_dep, "your lock file is missing \"#{@missing_lockfile_dep}\""],
+        [@missing_lockfile_dep, "your lockfile is missing \"#{@missing_lockfile_dep}\""],
         [@unlocking_bundler, "an update to the version of Bundler itself was requested"],
-        [@locked_spec_with_missing_deps, "your lock file includes \"#{@locked_spec_with_missing_deps}\" but not some of its dependencies"],
+        [@locked_spec_with_missing_checksums, "your lockfile is missing a CHECKSUMS entry for \"#{@locked_spec_with_missing_checksums}\""],
+        [@locked_spec_with_empty_checksums, "your lockfile has an empty CHECKSUMS entry for \"#{@locked_spec_with_empty_checksums}\""],
+        [@locked_spec_with_missing_deps, "your lockfile includes \"#{@locked_spec_with_missing_deps}\" but not some of its dependencies"],
         [@locked_spec_with_invalid_deps, "your lockfile does not satisfy dependencies of \"#{@locked_spec_with_invalid_deps}\""],
       ].select(&:first).map(&:last).join(", ")
     end
@@ -708,8 +908,8 @@ module Bundler
       !locked || dependencies_for_source_changed?(source, locked) || specs_for_source_changed?(source)
     end
 
-    def dependencies_for_source_changed?(source, locked_source = source)
-      deps_for_source = @dependencies.select {|s| s.source == source }
+    def dependencies_for_source_changed?(source, locked_source)
+      deps_for_source = @dependencies.select {|dep| dep.source == source }
       locked_deps_for_source = locked_dependencies.select {|dep| dep.source == locked_source }
 
       deps_for_source.uniq.sort != locked_deps_for_source.sort
@@ -717,7 +917,7 @@ module Bundler
 
     def specs_for_source_changed?(source)
       locked_index = Index.new
-      locked_index.use(@locked_specs.select {|s| source.can_lock?(s) })
+      locked_index.use(@locked_specs.select {|s| s.replace_source_with!(source) })
 
       !locked_index.subset?(source.specs)
     rescue PathError, GitError => e
@@ -747,29 +947,40 @@ module Bundler
     end
 
     def check_lockfile
-      @missing_lockfile_dep = nil
-
       @locked_spec_with_invalid_deps = nil
       @locked_spec_with_missing_deps = nil
+      @locked_spec_with_missing_checksums = nil
+      @locked_spec_with_empty_checksums = nil
 
-      missing = []
+      missing_deps = []
+      missing_checksums = []
+      empty_checksums = []
       invalid = []
 
       @locked_specs.each do |s|
+        if @locked_checksums
+          checksum_store = s.source.checksum_store
+
+          if checksum_store.missing?(s)
+            missing_checksums << s
+          elsif checksum_store.empty?(s)
+            empty_checksums << s
+          end
+        end
+
         validation = @locked_specs.validate_deps(s)
 
-        missing << s if validation == :missing
+        missing_deps << s if validation == :missing
         invalid << s if validation == :invalid
       end
 
-      if missing.any?
-        @locked_specs.delete(missing)
+      @locked_spec_with_missing_checksums = missing_checksums.first.name if missing_checksums.any?
+      @locked_spec_with_empty_checksums = empty_checksums.first.name if empty_checksums.any?
+
+      if missing_deps.any?
+        @locked_specs.delete(missing_deps)
 
-        @locked_spec_with_missing_deps = missing.first.name
-      elsif !@dependency_changes
-        @missing_lockfile_dep = current_dependencies.find do |d|
-          @locked_specs[d.name].empty? && d.name != "bundler"
-        end&.name
+        @locked_spec_with_missing_deps = missing_deps.first.name
       end
 
       if invalid.any?
@@ -785,24 +996,6 @@ module Bundler
       end
     end
 
-    def converge_path_source_to_gemspec_source(source)
-      return source unless source.instance_of?(Source::Path)
-      gemspec_source = sources.path_sources.find {|s| s.is_a?(Source::Gemspec) && s.as_path_source == source }
-      gemspec_source || source
-    end
-
-    def converge_path_sources_to_gemspec_sources
-      @locked_sources.map! do |source|
-        converge_path_source_to_gemspec_source(source)
-      end
-      @locked_specs.each do |spec|
-        spec.source &&= converge_path_source_to_gemspec_source(spec.source)
-      end
-      @locked_deps.each do |_, dep|
-        dep.source &&= converge_path_source_to_gemspec_source(dep.source)
-      end
-    end
-
     def converge_sources
       # Replace the sources from the Gemfile with the sources from the Gemfile.lock,
       # if they exist in the Gemfile.lock and are `==`. If you can't find an equivalent
@@ -812,7 +1005,7 @@ module Bundler
       sources.all_sources.each do |source|
         # has to be done separately, because we want to keep the locked checksum
         # store for a source, even when doing a full update
-        if @locked_checksums && @locked_gems && locked_source = @locked_gems.sources.find {|s| s == source && !s.equal?(source) }
+        if @locked_checksums && @locked_gems && locked_source = @originally_locked_sources.find {|s| s == source && !s.equal?(source) }
           source.checksum_store.merge!(locked_source.checksum_store)
         end
         # If the source is unlockable and the current command allows an unlock of
@@ -826,36 +1019,69 @@ module Bundler
         end
       end
 
+      sources.metadata_source.checksum_store.merge!(@locked_gems.metadata_source.checksum_store) if @locked_gems
+
       changes
     end
 
     def converge_dependencies
-      changes = false
+      @missing_lockfile_dep = nil
+      @changed_dependencies = []
 
       @dependencies.each do |dep|
         if dep.source
           dep.source = sources.get(dep.source)
         end
+        next unless relevant_deps?(dep)
 
-        unless locked_dep = @originally_locked_deps[dep.name]
-          changes = true
-          next
+        name = dep.name
+
+        dep_changed = @locked_deps[name].nil?
+
+        unless name == "bundler"
+          locked_specs = @originally_locked_specs[name]
+
+          if locked_specs.empty?
+            @missing_lockfile_dep = name if dep_changed == false
+          else
+            if locked_specs.map(&:source).uniq.size > 1
+              @locked_specs.delete(locked_specs.select {|s| s.source != dep.source })
+            end
+
+            unless apply_override_to(dep).matches_spec?(locked_specs.first)
+              @gems_to_unlock << name
+              dep_changed = true
+            end
+          end
         end
 
-        # Gem::Dependency#== matches Gem::Dependency#type. As the lockfile
-        # doesn't carry a notion of the dependency type, if you use
-        # add_development_dependency in a gemspec that's loaded with the gemspec
-        # directive, the lockfile dependencies and resolved dependencies end up
-        # with a mismatch on #type. Work around that by setting the type on the
-        # dep from the lockfile.
-        locked_dep.instance_variable_set(:@type, dep.type)
-
-        # We already know the name matches from the hash lookup
-        # so we only need to check the requirement now
-        changes ||= dep.requirement != locked_dep.requirement
+        @changed_dependencies << name if dep_changed
       end
 
-      changes
+      converge_overrides_outside_dependencies
+
+      @changed_dependencies.any?
+    end
+
+    def converge_overrides_outside_dependencies
+      @overrides.each do |override|
+        # :all overrides are intentionally not pre-unlocked. They take effect on
+        # fresh resolution (no lockfile) or when the user runs `bundle update`.
+        # Forcing a full re-resolve from a single :all directive would surprise
+        # users with unrelated dependency churn.
+        next unless override.target.is_a?(String)
+
+        name = override.target
+        next if @changed_dependencies.include?(name)
+        next if @originally_locked_specs[name].empty?
+        # version: overrides on direct deps are detected in the per-dep
+        # converge_dependencies loop via apply_override_to + matches_spec?.
+        # Other fields are not visible there, so they always reach here.
+        next if override.field == :version && @dependencies.any? {|d| d.name == name }
+
+        @gems_to_unlock << name
+        @changed_dependencies << name
+      end
     end
 
     # Remove elements from the locked specs that are expired. This will most
@@ -864,7 +1090,7 @@ module Bundler
     def converge_locked_specs
       converged = converge_specs(@locked_specs)
 
-      resolve = SpecSet.new(converged.reject {|s| @gems_to_unlock.include?(s.name) })
+      resolve = SpecSet.new(converged)
 
       diff = nil
 
@@ -885,46 +1111,48 @@ module Bundler
       converged = []
       deps = []
 
-      @specs_that_changed_sources = []
-
       specs.each do |s|
         name = s.name
+        next if @gems_to_unlock.include?(name)
+
         dep = @dependencies.find {|d| s.satisfies?(d) }
         lockfile_source = s.source
 
         if dep
-          gemfile_source = dep.source || default_source
-
-          @specs_that_changed_sources << s if gemfile_source != lockfile_source
-          deps << dep if !dep.source || lockfile_source.include?(dep.source)
-          @gems_to_unlock << name if lockfile_source.include?(dep.source) && lockfile_source != gemfile_source
+          replacement_source = dep.source
 
-          # Replace the locked dependency's source with the equivalent source from the Gemfile
-          s.source = gemfile_source
+          deps << dep if !replacement_source || lockfile_source.include?(replacement_source) || new_deps.include?(dep)
         else
-          # Replace the locked dependency's source with the default source, if the locked source is no longer in the Gemfile
-          s.source = default_source unless sources.get(lockfile_source)
-        end
+          parent_dep = @dependencies.find do |d|
+            next unless d.source && d.source != lockfile_source
+            next if d.source.is_a?(Source::Gemspec)
 
-        next if @sources_to_unlock.include?(s.source.name)
+            parent_locked_specs = @originally_locked_specs[d.name]
 
-        # Path sources have special logic
-        if s.source.instance_of?(Source::Path) || s.source.instance_of?(Source::Gemspec)
-          new_specs = begin
-            s.source.specs
-          rescue PathError
-            # if we won't need the source (according to the lockfile),
-            # don't error if the path source isn't available
-            next if specs.
-                    for(requested_dependencies, false).
-                    none? {|locked_spec| locked_spec.source == s.source }
-
-            raise
+            parent_locked_specs.any? do |parent_spec|
+              parent_spec.runtime_dependencies.any? {|rd| rd.name == s.name }
+            end
+          end
+
+          if parent_dep && parent_dep.source.is_a?(Source::Path) && parent_dep.source.specs[s]&.any?
+            replacement_source = parent_dep.source
+          else
+            replacement_source = sources.get(lockfile_source)
           end
+        end
+
+        # Replace the locked dependency's source with the equivalent source from the Gemfile
+        s.source = replacement_source || default_source
+        next if s.source_changed?
+
+        source = s.source
+        next if @sources_to_unlock.include?(source.name)
 
-          new_spec = new_specs[s].first
+        # Path sources have special logic
+        if source.is_a?(Source::Path)
+          new_spec = source.specs[s].first
           if new_spec
-            s.dependencies.replace(new_spec.dependencies)
+            s.runtime_dependencies.replace(new_spec.runtime_dependencies)
           else
             # If the spec is no longer in the path source, unlock it. This
             # commonly happens if the version changed in the gemspec
@@ -932,14 +1160,10 @@ module Bundler
           end
         end
 
-        if dep.nil? && requested_dependencies.find {|d| name == d.name }
-          @gems_to_unlock << s.name
-        else
-          converged << s
-        end
+        converged << s
       end
 
-      filter_specs(converged, deps)
+      filter_specs(converged, deps, skips: @gems_to_unlock)
     end
 
     def metadata_dependencies
@@ -950,17 +1174,59 @@ module Bundler
     end
 
     def source_requirements
+      @source_requirements ||= find_source_requirements
+    end
+
+    def preload_git_source_worker
+      workers = Bundler.settings.installation_parallelization
+
+      @preload_git_source_worker ||= Bundler::Worker.new(workers, "Git source preloading", ->(source, _) { source.specs })
+    end
+
+    def preload_git_sources
+      if Gem.ruby_version < Gem::Version.new("3.3")
+        # Ruby 3.2 has a bug that incorrectly triggers a circular dependency warning. This version will continue to
+        # fetch git repositories one by one.
+        return
+      end
+
+      begin
+        needed_git_sources.each {|source| preload_git_source_worker.enq(source) }
+      ensure
+        preload_git_source_worker.stop
+      end
+    end
+
+    # Git sources needed for the requested groups (excludes sources only used by --without groups)
+    def needed_git_sources
+      needed_deps = dependencies_for(requested_groups)
+      sources.git_sources.select do |source|
+        needed_deps.any? {|d| d.source == source }
+      end
+    end
+
+    # Git sources that should be excluded (only used by --without groups)
+    def excluded_git_sources
+      sources.git_sources - needed_git_sources
+    end
+
+    def find_source_requirements
+      preload_git_sources
+
+      # Only safe to exclude when locked_requirements (merged below) backfills the gap.
+      nothing_changed = nothing_changed?
+      excluded = nothing_changed ? excluded_git_sources : []
+
       # Record the specs available in each gem's source, so that those
       # specs will be available later when the resolver knows where to
       # look for that gemspec (or its dependencies)
       source_requirements = if precompute_source_requirements_for_indirect_dependencies?
-        all_requirements = source_map.all_requirements
-        all_requirements = pin_locally_available_names(all_requirements) if @prefer_local
+        all_requirements = source_map.all_requirements(excluded)
         { default: default_source }.merge(all_requirements)
       else
-        { default: Source::RubygemsAggregate.new(sources, source_map) }.merge(source_map.direct_requirements)
+        { default: Source::RubygemsAggregate.new(sources, source_map, excluded) }.merge(source_map.direct_requirements)
       end
-      source_requirements.merge!(source_map.locked_requirements) if nothing_changed?
+      source_requirements.merge!(source_map.locked_requirements) if nothing_changed
       metadata_dependencies.each do |dep|
         source_requirements[dep.name] = sources.metadata_source
       end
@@ -974,7 +1240,6 @@ module Bundler
         source_requirements["bundler"] = sources.metadata_source # needs to come last to override
       end
 
-      verify_changed_sources!
       source_requirements
     end
 
@@ -982,14 +1247,6 @@ module Bundler
       sources.default_source
     end
 
-    def verify_changed_sources!
-      @specs_that_changed_sources.each do |s|
-        if s.source.specs.search(s.name).empty?
-          raise GemNotFound, "Could not find gem '#{s.name}' in #{s.source}"
-        end
-      end
-    end
-
     def requested_groups
       values = groups - Bundler.settings[:without] - @optional_groups + Bundler.settings[:with]
       values &= Bundler.settings[:only] unless Bundler.settings[:only].empty?
@@ -1010,52 +1267,63 @@ module Bundler
       current == proposed
     end
 
-    def additional_base_requirements_to_prevent_downgrades(resolution_packages, last_resolve)
-      return resolution_packages unless @locked_gems && !sources.expired_sources?(@locked_gems.sources)
-      converge_specs(@originally_locked_specs - last_resolve).each do |locked_spec|
-        next if locked_spec.source.is_a?(Source::Path)
-        resolution_packages.base_requirements[locked_spec.name] = Gem::Requirement.new(">= #{locked_spec.version}")
-      end
-      resolution_packages
-    end
+    def additional_base_requirements_to_prevent_downgrades(resolution_base)
+      return resolution_base unless @locked_gems
+      @originally_locked_specs.each do |locked_spec|
+        next if locked_spec.source.is_a?(Source::Path) || locked_spec.source_changed?
 
-    def additional_base_requirements_to_force_updates(resolution_packages)
-      return resolution_packages if @explicit_unlocks.empty?
-      full_update = dup_for_full_unlock.resolve
-      @explicit_unlocks.each do |name|
-        version = full_update[name].first&.version
-        resolution_packages.base_requirements[name] = Gem::Requirement.new("= #{version}") if version
+        name = locked_spec.name
+        next if @changed_dependencies.include?(name)
+
+        resolution_base.base_requirements[name] = Gem::Requirement.new(">= #{locked_spec.version}")
       end
-      resolution_packages
+      resolution_base
     end
 
-    def dup_for_full_unlock
-      unlocked_definition = self.class.new(@lockfile, @dependencies, @sources, true, @ruby_version, @optional_groups, @gemfiles)
-      unlocked_definition.gem_version_promoter.tap do |gvp|
-        gvp.level = gem_version_promoter.level
-        gvp.strict = gem_version_promoter.strict
-        gvp.pre = gem_version_promoter.pre
+    def additional_base_requirements_to_force_updates(resolution_base)
+      return resolution_base if @explicit_unlocks.empty?
+      full_update = SpecSet.new(new_resolver_for_full_update.start)
+      @explicit_unlocks.each do |name|
+        version = full_update.version_for(name)
+        resolution_base.base_requirements[name] = Gem::Requirement.new("= #{version}") if version
       end
-      unlocked_definition
+      resolution_base
     end
 
-    def remove_invalid_platforms!(dependencies)
+    def remove_invalid_platforms!
       return if Bundler.frozen_bundle?
 
-      platforms.reverse_each do |platform|
-        next if local_platform == platform ||
-                (@new_platform && platforms.last == platform) ||
-                @path_changes ||
-                @dependency_changes ||
-                !@originally_locked_specs.incomplete_for_platform?(dependencies, platform)
+      skips = (@new_platforms + [Bundler.local_platform]).uniq
 
-        remove_platform(platform)
-        add_current_platform if platform == Gem::Platform::RUBY
-      end
+      # We should probably avoid removing non-ruby platforms, since that means
+      # lockfile will no longer install on those platforms, so a error to give
+      # heads up to the user may be better. However, we have tests expecting
+      # non ruby platform autoremoval to work, so leaving that in place for
+      # now.
+      skips |= platforms - [Gem::Platform::RUBY] if @dependency_changes
+
+      @originally_invalid_platforms = @originally_locked_specs.remove_invalid_platforms!(current_dependencies, platforms, skips: skips)
     end
 
     def source_map
       @source_map ||= SourceMap.new(sources, dependencies, @locked_specs)
     end
+
+    def new_resolver_for_full_update
+      new_resolver(unlocked_resolution_base)
+    end
+
+    def unlocked_resolution_base
+      new_resolution_base(last_resolve: SpecSet.new([]), unlock: true)
+    end
+
+    def new_resolution_base(last_resolve:, unlock:)
+      new_resolution_platforms = @current_platform_missing ? @new_platforms + [Bundler.local_platform] : @new_platforms
+      Resolver::Base.new(source_requirements, expanded_dependencies, last_resolve, @platforms, locked_specs: @originally_locked_specs, unlock: unlock, prerelease: gem_version_promoter.pre?, prefer_local: @prefer_local, new_platforms: new_resolution_platforms, overrides: @overrides)
+    end
+
+    def new_resolver(base)
+      Resolver.new(base, gem_version_promoter, @most_specific_locked_platform)
+    end
   end
 end
diff --git a/lib/bundler/dependency.rb b/lib/bundler/dependency.rb
index 2a4f72fe55..cb9c7a76ea 100644
--- a/lib/bundler/dependency.rb
+++ b/lib/bundler/dependency.rb
@@ -2,51 +2,92 @@
 
 require "rubygems/dependency"
 require_relative "shared_helpers"
-require_relative "rubygems_ext"
 
 module Bundler
   class Dependency < Gem::Dependency
-    attr_reader :autorequire
-    attr_reader :groups, :platforms, :gemfile, :path, :git, :github, :branch, :ref, :glob
-
-    ALL_RUBY_VERSIONS = (18..27).to_a.concat((30..34).to_a).freeze
-    PLATFORM_MAP = {
-      ruby: [Gem::Platform::RUBY, ALL_RUBY_VERSIONS],
-      mri: [Gem::Platform::RUBY, ALL_RUBY_VERSIONS],
-      rbx: [Gem::Platform::RUBY],
-      truffleruby: [Gem::Platform::RUBY],
-      jruby: [Gem::Platform::JAVA, [18, 19]],
-      windows: [Gem::Platform::WINDOWS, ALL_RUBY_VERSIONS],
-      # deprecated
-      mswin: [Gem::Platform::MSWIN, ALL_RUBY_VERSIONS],
-      mswin64: [Gem::Platform::MSWIN64, ALL_RUBY_VERSIONS - [18]],
-      mingw: [Gem::Platform::MINGW, ALL_RUBY_VERSIONS],
-      x64_mingw: [Gem::Platform::X64_MINGW, ALL_RUBY_VERSIONS - [18, 19]],
-    }.each_with_object({}) do |(platform, spec), hash|
-      hash[platform] = spec[0]
-      spec[1]&.each {|version| hash[:"#{platform}_#{version}"] = spec[0] }
-    end.freeze
-
     def initialize(name, version, options = {}, &blk)
       type = options["type"] || :runtime
       super(name, version, type)
 
-      @autorequire    = nil
-      @groups         = Array(options["group"] || :default).map(&:to_sym)
-      @source         = options["source"]
-      @path           = options["path"]
-      @git            = options["git"]
-      @github         = options["github"]
-      @branch         = options["branch"]
-      @ref            = options["ref"]
-      @glob           = options["glob"]
-      @platforms      = Array(options["platforms"])
-      @env            = options["env"]
-      @should_include = options.fetch("should_include", true)
-      @gemfile        = options["gemfile"]
-      @force_ruby_platform = options["force_ruby_platform"] if options.key?("force_ruby_platform")
+      @options = options
+    end
+
+    def groups
+      @groups ||= Array(@options["group"] || :default).map(&:to_sym)
+    end
+
+    def source
+      return @source if defined?(@source)
+
+      @source = @options["source"]
+    end
+
+    def path
+      return @path if defined?(@path)
+
+      @path = @options["path"]
+    end
+
+    def git
+      return @git if defined?(@git)
 
-      @autorequire = Array(options["require"] || []) if options.key?("require")
+      @git = @options["git"]
+    end
+
+    def github
+      return @github if defined?(@github)
+
+      @github = @options["github"]
+    end
+
+    def branch
+      return @branch if defined?(@branch)
+
+      @branch = @options["branch"]
+    end
+
+    def ref
+      return @ref if defined?(@ref)
+
+      @ref = @options["ref"]
+    end
+
+    def glob
+      return @glob if defined?(@glob)
+
+      @glob = @options["glob"]
+    end
+
+    def platforms
+      @platforms ||= Array(@options["platforms"])
+    end
+
+    def env
+      return @env if defined?(@env)
+
+      @env = @options["env"]
+    end
+
+    def should_include
+      @should_include ||= @options.fetch("should_include", true)
+    end
+
+    def gemfile
+      return @gemfile if defined?(@gemfile)
+
+      @gemfile = @options["gemfile"]
+    end
+
+    def force_ruby_platform
+      return @force_ruby_platform if defined?(@force_ruby_platform)
+
+      @force_ruby_platform = @options["force_ruby_platform"]
+    end
+
+    def autorequire
+      return @autorequire if defined?(@autorequire)
+
+      @autorequire = Array(@options["require"] || []) if @options.key?("require")
     end
 
     RUBY_PLATFORM_ARRAY = [Gem::Platform::RUBY].freeze
@@ -56,37 +97,41 @@ module Bundler
     # passed in the `valid_platforms` parameter
     def gem_platforms(valid_platforms)
       return RUBY_PLATFORM_ARRAY if force_ruby_platform
-      return valid_platforms if @platforms.empty?
+      return valid_platforms if platforms.empty?
 
-      valid_platforms.select {|p| expanded_platforms.include?(GemHelpers.generic(p)) }
+      valid_platforms.select {|p| expanded_platforms.include?(Gem::Platform.generic(p)) }
     end
 
     def expanded_platforms
-      @expanded_platforms ||= @platforms.map {|pl| PLATFORM_MAP[pl] }.compact.flatten.uniq
+      @expanded_platforms ||= platforms.filter_map {|pl| CurrentRuby::PLATFORM_MAP[pl] }.flatten.uniq
     end
 
     def should_include?
-      @should_include && current_env? && current_platform?
+      should_include && current_env? && current_platform?
     end
 
     def gemspec_dev_dep?
-      type == :development
+      @gemspec_dev_dep ||= @options.fetch("gemspec_dev_dep", false)
+    end
+
+    def gemfile_dep?
+      !gemspec_dev_dep?
     end
 
     def current_env?
-      return true unless @env
-      if @env.is_a?(Hash)
-        @env.all? do |key, val|
+      return true unless env
+      if env.is_a?(Hash)
+        env.all? do |key, val|
           ENV[key.to_s] && (val.is_a?(String) ? ENV[key.to_s] == val : ENV[key.to_s] =~ val)
         end
       else
-        ENV[@env.to_s]
+        ENV[env.to_s]
       end
     end
 
     def current_platform?
-      return true if @platforms.empty?
-      @platforms.any? do |p|
+      return true if platforms.empty?
+      platforms.any? do |p|
         Bundler.current_ruby.send("#{p}?")
       end
     end
diff --git a/lib/bundler/deployment.rb b/lib/bundler/deployment.rb
index b432ae6ae1..3344449e82 100644
--- a/lib/bundler/deployment.rb
+++ b/lib/bundler/deployment.rb
@@ -1,69 +1,6 @@
 # frozen_string_literal: true
 
 require_relative "shared_helpers"
-Bundler::SharedHelpers.major_deprecation 2, "Bundler no longer integrates with " \
+Bundler::SharedHelpers.feature_removed! "Bundler no longer integrates with " \
   "Capistrano, but Capistrano provides its own integration with " \
   "Bundler via the capistrano-bundler gem. Use it instead."
-
-module Bundler
-  class Deployment
-    def self.define_task(context, task_method = :task, opts = {})
-      if defined?(Capistrano) && context.is_a?(Capistrano::Configuration)
-        context_name = "capistrano"
-        role_default = "{:except => {:no_release => true}}"
-        error_type = ::Capistrano::CommandError
-      else
-        context_name = "vlad"
-        role_default = "[:app]"
-        error_type = ::Rake::CommandFailedError
-      end
-
-      roles = context.fetch(:bundle_roles, false)
-      opts[:roles] = roles if roles
-
-      context.send :namespace, :bundle do
-        send :desc, <<-DESC
-          Install the current Bundler environment. By default, gems will be \
-          installed to the shared/bundle path. Gems in the development and \
-          test group will not be installed. The install command is executed \
-          with the --deployment and --quiet flags. If the bundle cmd cannot \
-          be found then you can override the bundle_cmd variable to specify \
-          which one it should use. The base path to the app is fetched from \
-          the :latest_release variable. Set it for custom deploy layouts.
-
-          You can override any of these defaults by setting the variables shown below.
-
-          N.B. bundle_roles must be defined before you require 'bundler/#{context_name}' \
-          in your deploy.rb file.
-
-            set :bundle_gemfile,  "Gemfile"
-            set :bundle_dir,      File.join(fetch(:shared_path), 'bundle')
-            set :bundle_flags,    "--deployment --quiet"
-            set :bundle_without,  [:development, :test]
-            set :bundle_with,     [:mysql]
-            set :bundle_cmd,      "bundle" # e.g. "/opt/ruby/bin/bundle"
-            set :bundle_roles,    #{role_default} # e.g. [:app, :batch]
-        DESC
-        send task_method, :install, opts do
-          bundle_cmd     = context.fetch(:bundle_cmd, "bundle")
-          bundle_flags   = context.fetch(:bundle_flags, "--deployment --quiet")
-          bundle_dir     = context.fetch(:bundle_dir, File.join(context.fetch(:shared_path), "bundle"))
-          bundle_gemfile = context.fetch(:bundle_gemfile, "Gemfile")
-          bundle_without = [*context.fetch(:bundle_without, [:development, :test])].compact
-          bundle_with    = [*context.fetch(:bundle_with, [])].compact
-          app_path = context.fetch(:latest_release)
-          if app_path.to_s.empty?
-            raise error_type.new("Cannot detect current release path - make sure you have deployed at least once.")
-          end
-          args = ["--gemfile #{File.join(app_path, bundle_gemfile)}"]
-          args << "--path #{bundle_dir}" unless bundle_dir.to_s.empty?
-          args << bundle_flags.to_s
-          args << "--without #{bundle_without.join(" ")}" unless bundle_without.empty?
-          args << "--with #{bundle_with.join(" ")}" unless bundle_with.empty?
-
-          run "cd #{app_path} && #{bundle_cmd} install #{args.join(" ")}"
-        end
-      end
-    end
-  end
-end
diff --git a/lib/bundler/digest.rb b/lib/bundler/digest.rb
index 2c6d971f1b..158803033d 100644
--- a/lib/bundler/digest.rb
+++ b/lib/bundler/digest.rb
@@ -26,7 +26,7 @@ module Bundler
           end
           a, b, c, d, e = *words
           (16..79).each do |i|
-            w[i] = SHA1_MASK & rotate((w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]), 1)
+            w[i] = SHA1_MASK & rotate(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16], 1)
           end
           0.upto(79) do |i|
             case i
diff --git a/lib/bundler/dsl.rb b/lib/bundler/dsl.rb
index 6af80fb31f..6e2638a8be 100644
--- a/lib/bundler/dsl.rb
+++ b/lib/bundler/dsl.rb
@@ -9,19 +9,20 @@ module Bundler
 
     def self.evaluate(gemfile, lockfile, unlock)
       builder = new
+      builder.lockfile(lockfile)
       builder.eval_gemfile(gemfile)
-      builder.to_definition(lockfile, unlock)
+      builder.to_definition(builder.lockfile_path, unlock)
     end
 
-    VALID_PLATFORMS = Bundler::Dependency::PLATFORM_MAP.keys.freeze
+    VALID_PLATFORMS = Bundler::CurrentRuby::PLATFORM_MAP.keys.freeze
 
     VALID_KEYS = %w[group groups git path glob name branch ref tag require submodules
-                    platform platforms type source install_if gemfile force_ruby_platform].freeze
+                    platform platforms source install_if force_ruby_platform].freeze
 
     GITHUB_PULL_REQUEST_URL = %r{\Ahttps://github\.com/([A-Za-z0-9_\-\.]+/[A-Za-z0-9_\-\.]+)/pull/(\d+)\z}
     GITLAB_MERGE_REQUEST_URL = %r{\Ahttps://gitlab\.com/([A-Za-z0-9_\-\./]+)/-/merge_requests/(\d+)\z}
 
-    attr_reader :gemspecs, :gemfile
+    attr_reader :gemspecs, :gemfile, :overrides
     attr_accessor :dependencies
 
     def initialize
@@ -38,24 +39,26 @@ module Bundler
       @gemspecs             = []
       @gemfile              = nil
       @gemfiles             = []
+      @lockfile             = nil
+      @overrides            = []
       add_git_sources
     end
 
     def eval_gemfile(gemfile, contents = nil)
-      expanded_gemfile_path = Pathname.new(gemfile).expand_path(@gemfile&.parent)
-      original_gemfile = @gemfile
-      @gemfile = expanded_gemfile_path
-      @gemfiles << expanded_gemfile_path
-      contents ||= Bundler.read_file(@gemfile.to_s)
-      instance_eval(contents, @gemfile.to_s, 1)
-    rescue Exception => e # rubocop:disable Lint/RescueException
-      message = "There was an error " \
-        "#{e.is_a?(GemfileEvalError) ? "evaluating" : "parsing"} " \
-        "`#{File.basename gemfile.to_s}`: #{e.message}"
-
-      raise DSLError.new(message, gemfile, e.backtrace, contents)
-    ensure
-      @gemfile = original_gemfile
+      with_gemfile(gemfile) do |current_gemfile|
+        contents ||= Bundler.read_file(current_gemfile)
+        instance_eval(contents, current_gemfile, 1)
+      rescue GemfileEvalError => e
+        message = "There was an error evaluating `#{File.basename current_gemfile}`: #{e.message}"
+        raise DSLError.new(message, current_gemfile, e.backtrace, contents)
+      rescue GemfileError, InvalidArgumentError, InvalidOption, DeprecatedError, ScriptError => e
+        message = "There was an error parsing `#{File.basename current_gemfile}`: #{e.message}"
+        raise DSLError.new(message, current_gemfile, e.backtrace, contents)
+      rescue StandardError => e
+        raise unless e.backtrace_locations.first.path == current_gemfile
+        message = "There was an error parsing `#{File.basename current_gemfile}`: #{e.message}"
+        raise DSLError.new(message, current_gemfile, e.backtrace, contents)
+      end
     end
 
     def gemspec(opts = nil)
@@ -66,23 +69,23 @@ module Bundler
       development_group = opts[:development_group] || :development
       expanded_path     = gemfile_root.join(path)
 
-      gemspecs = Gem::Util.glob_files_in_dir("{,*}.gemspec", expanded_path).map {|g| Bundler.load_gemspec(g) }.compact
+      gemspecs = Gem::Util.glob_files_in_dir("{,*}.gemspec", expanded_path).filter_map {|g| Bundler.load_gemspec(g) }
       gemspecs.reject! {|s| s.name != name } if name
       specs_by_name_and_version = gemspecs.group_by {|s| [s.name, s.version] }
 
       case specs_by_name_and_version.size
       when 1
         specs = specs_by_name_and_version.values.first
-        spec = specs.find {|s| s.match_platform(Bundler.local_platform) } || specs.first
+        spec = specs.find {|s| s.installable_on_platform?(Bundler.local_platform) } || specs.first
 
         @gemspecs << spec
 
-        gem spec.name, name: spec.name, path: path, glob: glob
+        path path, "glob" => glob, "name" => spec.name, "gemspec" => spec do
+          add_dependency spec.name
+        end
 
-        group(development_group) do
-          spec.development_dependencies.each do |dep|
-            gem dep.name, *(dep.requirement.as_list + [type: :development])
-          end
+        spec.development_dependencies.each do |dep|
+          add_dependency dep.name, dep.requirement.as_list, "gemspec_dev_dep" => true, "group" => development_group
         end
       when 0
         raise InvalidOption, "There are no gemspecs at #{expanded_path}"
@@ -94,69 +97,30 @@ module Bundler
 
     def gem(name, *args)
       options = args.last.is_a?(Hash) ? args.pop.dup : {}
-      options["gemfile"] = @gemfile
       version = args || [">= 0"]
 
       normalize_options(name, version, options)
 
-      dep = Dependency.new(name, version, options)
-
-      # if there's already a dependency with this name we try to prefer one
-      if current = @dependencies.find {|d| d.name == dep.name }
-        if current.requirement != dep.requirement
-          current_requirement_open = current.requirements_list.include?(">= 0")
-
-          gemspec_dep = [dep, current].find(&:gemspec_dev_dep?)
-          if gemspec_dep
-            gemfile_dep = [dep, current].find(&:runtime?)
-
-            unless current_requirement_open
-              Bundler.ui.warn "A gemspec development dependency (#{gemspec_dep.name}, #{gemspec_dep.requirement}) is being overridden by a Gemfile dependency (#{gemfile_dep.name}, #{gemfile_dep.requirement}).\n" \
-                              "This behaviour may change in the future. Please remove either of them, or make sure they both have the same requirement\n"
-            end
-          else
-            update_prompt = ""
-
-            if File.basename(@gemfile) == Injector::INJECTED_GEMS
-              if dep.requirements_list.include?(">= 0") && !current_requirement_open
-                update_prompt = ". Gem already added"
-              else
-                update_prompt = ". If you want to update the gem version, run `bundle update #{current.name}`"
-
-                update_prompt += ". You may also need to change the version requirement specified in the Gemfile if it's too restrictive." unless current_requirement_open
-              end
-            end
-
-            raise GemfileError, "You cannot specify the same gem twice with different version requirements.\n" \
-                           "You specified: #{current.name} (#{current.requirement}) and #{dep.name} (#{dep.requirement})" \
-                           "#{update_prompt}"
-          end
-        end
+      add_dependency(name, version, options)
+    end
 
-        # Always prefer the dependency from the Gemfile
-        if current.gemspec_dev_dep?
-          @dependencies.delete(current)
-        elsif dep.gemspec_dev_dep?
-          return
-        elsif current.source != dep.source
-          raise GemfileError, "You cannot specify the same gem twice coming from different sources.\n" \
-                          "You specified that #{dep.name} (#{dep.requirement}) should come from " \
-                          "#{current.source || "an unspecified source"} and #{dep.source}\n"
-        else
-          Bundler.ui.warn "Your Gemfile lists the gem #{current.name} (#{current.requirement}) more than once.\n" \
-                          "You should probably keep only one of them.\n" \
-                          "Remove any duplicate entries and specify the gem only once.\n" \
-                          "While it's not a problem now, it could cause errors if you change the version of one of them later."
-        end
-      end
+    # For usage in Dsl.evaluate, since lockfile is used as part of the Gemfile.
+    def lockfile_path
+      @lockfile
+    end
 
-      @dependencies << dep
+    def lockfile(file)
+      @lockfile = file
     end
 
     def source(source, *args, &blk)
       options = args.last.is_a?(Hash) ? args.pop.dup : {}
       options = normalize_hash(options)
       source = normalize_source(source)
+      cooldown = options["cooldown"]
+      if cooldown && !(cooldown.is_a?(Integer) && cooldown >= 0)
+        raise InvalidOption, "Expected `cooldown` to be a non-negative integer, got #{cooldown.inspect}"
+      end
 
       if options.key?("type")
         options["type"] = options["type"].to_s
@@ -171,9 +135,9 @@ module Bundler
         source_opts = options.merge("uri" => source)
         with_source(@sources.add_plugin_source(options["type"], source_opts), &blk)
       elsif block_given?
-        with_source(@sources.add_rubygems_source("remotes" => source), &blk)
+        with_source(@sources.add_rubygems_source("remotes" => source, "cooldown" => cooldown), &blk)
       else
-        @sources.add_global_rubygems_remote(source)
+        @sources.add_global_rubygems_remote(source, cooldown: cooldown)
       end
     end
 
@@ -193,8 +157,7 @@ module Bundler
     def path(path, options = {}, &blk)
       source_options = normalize_hash(options).merge(
         "path" => Pathname.new(path),
-        "root_path" => gemfile_root,
-        "gemspec" => gemspecs.find {|g| g.name == options["name"] }
+        "root_path" => gemfile_root
       )
 
       source_options["global"] = true unless block_given?
@@ -219,16 +182,39 @@ module Bundler
     end
 
     def github(repo, options = {})
-      raise ArgumentError, "GitHub sources require a block" unless block_given?
+      raise InvalidArgumentError, "GitHub sources require a block" unless block_given?
       github_uri  = @git_sources["github"].call(repo)
       git_options = normalize_hash(options).merge("uri" => github_uri)
       git_source  = @sources.add_git_source(git_options)
       with_source(git_source) { yield }
     end
 
+    SUPPORTED_OVERRIDE_FIELDS = [:version, :required_ruby_version, :required_rubygems_version].freeze
+    SUPPORTED_OVERRIDE_SYMBOL_OPERATIONS = [:ignore_upper].freeze
+
+    def override(target, **operations)
+      validate_override_target!(target)
+
+      if target == :all && operations.key?(:version)
+        raise ArgumentError, "`override :all, version:` is not allowed; version requirements are per-gem"
+      end
+
+      operations.each do |field, operation|
+        validate_override_field!(field)
+        validate_override_operation!(operation)
+        validate_override_uniqueness!(target, field)
+      end
+
+      source_location = caller_locations(1, 1)&.first
+      operations.each do |field, operation|
+        @overrides << Override.new(target, field, operation, source_location: source_location)
+      end
+    end
+
     def to_definition(lockfile, unlock)
       check_primary_source_safety
-      Definition.new(lockfile, @dependencies, @sources, unlock, @ruby_version, @optional_groups, @gemfiles)
+      lockfile = @lockfile unless @lockfile.nil?
+      Definition.new(lockfile, @dependencies, @sources, unlock, @ruby_version, @optional_groups, @gemfiles, @overrides)
     end
 
     def group(*args, &blk)
@@ -285,6 +271,123 @@ module Bundler
 
     private
 
+    def validate_override_target!(target)
+      return if target == :all
+      return if target.is_a?(String)
+      raise ArgumentError, "override target must be :all or a gem name string, got #{target.inspect}"
+    end
+
+    def validate_override_field!(field)
+      return if SUPPORTED_OVERRIDE_FIELDS.include?(field)
+      supported = SUPPORTED_OVERRIDE_FIELDS.map {|f| "`#{f}:`" }.join(", ")
+      raise ArgumentError, "unsupported override field `#{field}:`; supported fields: #{supported}"
+    end
+
+    def validate_override_operation!(operation)
+      case operation
+      when String
+        Gem::Requirement.new(operation)
+      when nil
+        # ok
+      when Symbol
+        return if SUPPORTED_OVERRIDE_SYMBOL_OPERATIONS.include?(operation)
+        raise ArgumentError, "unsupported override operation: #{operation.inspect}"
+      else
+        raise ArgumentError, "override operation must be a String, Symbol, or nil, got #{operation.inspect}"
+      end
+    rescue Gem::Requirement::BadRequirementError => e
+      raise ArgumentError, "invalid override version requirement #{operation.inspect}: #{e.message}"
+    end
+
+    def validate_override_uniqueness!(target, field)
+      return unless @overrides.any? {|o| o.target == target && o.field == field }
+      raise ArgumentError, "duplicate override for #{target.inspect} `#{field}:`"
+    end
+
+    def add_dependency(name, version = nil, options = {})
+      options["gemfile"] = @gemfile
+      options["source"] ||= @source
+      options["env"] ||= @env
+
+      dep = Dependency.new(name, version, options)
+
+      # if there's already a dependency with this name we try to prefer one
+      if current = @dependencies.find {|d| d.name == name }
+        if current.requirement != dep.requirement
+          current_requirement_open = current.requirements_list.include?(">= 0")
+
+          gemspec_dep = [dep, current].find(&:gemspec_dev_dep?)
+          if gemspec_dep
+            require_relative "vendor/pub_grub/lib/pub_grub/version_range"
+            require_relative "vendor/pub_grub/lib/pub_grub/version_constraint"
+            require_relative "vendor/pub_grub/lib/pub_grub/version_union"
+            require_relative "vendor/pub_grub/lib/pub_grub/rubygems"
+
+            current_gemspec_range = PubGrub::RubyGems.requirement_to_range(current.requirement)
+            next_gemspec_range = PubGrub::RubyGems.requirement_to_range(dep.requirement)
+
+            if current_gemspec_range.intersects?(next_gemspec_range)
+              dep = Dependency.new(name, current.requirement.as_list + dep.requirement.as_list, options)
+            else
+              gemfile_dep = [dep, current].find(&:gemfile_dep?)
+
+              if gemfile_dep
+                raise GemfileError, "The #{name} dependency has conflicting requirements in Gemfile (#{gemfile_dep.requirement}) and gemspec (#{gemspec_dep.requirement})"
+              else
+                raise GemfileError, "Two gemspec development dependencies have conflicting requirements on the same gem: #{dep} and #{current}"
+              end
+            end
+          else
+            update_prompt = ""
+
+            if File.basename(@gemfile) == Injector::INJECTED_GEMS
+              if dep.requirements_list.include?(">= 0") && !current_requirement_open
+                update_prompt = ". Gem already added"
+              else
+                update_prompt = ". If you want to update the gem version, run `bundle update #{name}`"
+
+                update_prompt += ". You may also need to change the version requirement specified in the Gemfile if it's too restrictive." unless current_requirement_open
+              end
+            end
+
+            raise GemfileError, "You cannot specify the same gem twice with different version requirements.\n" \
+                           "You specified: #{name} (#{current.requirement}) and #{name} (#{dep.requirement})" \
+                           "#{update_prompt}"
+          end
+        end
+
+        unless current.gemspec_dev_dep? && dep.gemspec_dev_dep?
+          # Always prefer the dependency from the Gemfile
+          if current.gemspec_dev_dep?
+            @dependencies.delete(current)
+          elsif dep.gemspec_dev_dep?
+            return
+          elsif current.source.to_s != dep.source.to_s
+            raise GemfileError, "You cannot specify the same gem twice coming from different sources.\n" \
+                            "You specified that #{name} (#{dep.requirement}) should come from " \
+                            "#{current.source || "an unspecified source"} and #{dep.source}\n"
+          else
+            Bundler.ui.warn "Your Gemfile lists the gem #{name} (#{current.requirement}) more than once.\n" \
+                            "You should probably keep only one of them.\n" \
+                            "Remove any duplicate entries and specify the gem only once.\n" \
+                            "While it's not a problem now, it could cause errors if you change the version of one of them later."
+          end
+        end
+      end
+
+      @dependencies << dep
+    end
+
+    def with_gemfile(gemfile)
+      expanded_gemfile_path = Pathname.new(gemfile).expand_path(@gemfile&.parent)
+      original_gemfile = @gemfile
+      @gemfile = expanded_gemfile_path
+      @gemfiles << expanded_gemfile_path
+      yield @gemfile.to_s
+    ensure
+      @gemfile = original_gemfile
+    end
+
     def add_git_sources
       git_source(:github) do |repo_name|
         if repo_name =~ GITHUB_PULL_REQUEST_URL
@@ -381,6 +484,13 @@ module Bundler
         raise GemfileError, "`#{p}` is not a valid platform. The available options are: #{VALID_PLATFORMS.inspect}"
       end
 
+      windows_platforms = platforms.select {|pl| pl.to_s.match?(/mingw|mswin/) }
+      if windows_platforms.any?
+        windows_platforms = windows_platforms.map! {|pl| ":#{pl}" }.join(", ")
+        deprecated_message = "Platform #{windows_platforms} will be removed in the future. Please use platform :windows instead."
+        Bundler::SharedHelpers.feature_deprecated! deprecated_message
+      end
+
       # Save sources passed in a key
       if opts.key?("source")
         source = normalize_source(opts["source"])
@@ -407,8 +517,6 @@ module Bundler
         opts["source"] = source
       end
 
-      opts["source"]         ||= @source
-      opts["env"]            ||= @env
       opts["platforms"]      = platforms.dup
       opts["group"]          = groups
       opts["should_include"] = install_if
@@ -447,14 +555,10 @@ module Bundler
     def normalize_source(source)
       case source
       when :gemcutter, :rubygems, :rubyforge
-        message =
-          "The source :#{source} is deprecated because HTTP requests are insecure.\n" \
-          "Please change your source to 'https://rubygems.org' if possible, or 'http://rubygems.org' if not."
         removed_message =
           "The source :#{source} is disallowed because HTTP requests are insecure.\n" \
           "Please change your source to 'https://rubygems.org' if possible, or 'http://rubygems.org' if not."
-        Bundler::SharedHelpers.major_deprecation 2, message, removed_message: removed_message
-        "http://rubygems.org"
+        Bundler::SharedHelpers.feature_removed! removed_message
       when String
         source
       else
@@ -473,43 +577,18 @@ module Bundler
               "      gem 'rails'\n" \
               "    end\n\n"
 
-      SharedHelpers.major_deprecation(2, msg.strip)
+      SharedHelpers.feature_removed! msg.strip
     end
 
     def check_rubygems_source_safety
-      if @sources.implicit_global_source?
-        implicit_global_source_warning
-      elsif @sources.aggregate_global_source?
-        multiple_global_source_warning
-      end
-    end
-
-    def implicit_global_source_warning
-      Bundler::SharedHelpers.major_deprecation 2, "This Gemfile does not include an explicit global source. " \
-        "Not using an explicit global source may result in a different lockfile being generated depending on " \
-        "the gems you have installed locally before bundler is run. " \
-        "Instead, define a global source in your Gemfile like this: source \"https://rubygems.org\"."
+      multiple_global_source_warning if @sources.aggregate_global_source?
     end
 
     def multiple_global_source_warning
-      if Bundler.feature_flag.bundler_3_mode?
-        msg = "This Gemfile contains multiple global sources. " \
-          "Each source after the first must include a block to indicate which gems " \
-          "should come from that source"
-        raise GemfileEvalError, msg
-      else
-        message =
-          "Your Gemfile contains multiple global sources. " \
-          "Using `source` more than once without a block is a security risk, and " \
-          "may result in installing unexpected gems. To resolve this warning, use " \
-          "a block to indicate which gems should come from the secondary source."
-        removed_message =
-          "Your Gemfile contains multiple global sources. " \
-          "Using `source` more than once without a block is a security risk, and " \
-          "may result in installing unexpected gems. To resolve this error, use " \
-          "a block to indicate which gems should come from the secondary source."
-        Bundler::SharedHelpers.major_deprecation 2, message, removed_message: removed_message
-      end
+      msg = "This Gemfile contains multiple global sources. " \
+        "Each source after the first must include a block to indicate which gems " \
+        "should come from that source"
+      raise GemfileEvalError, msg
     end
 
     class DSLError < GemfileError
@@ -577,23 +656,23 @@ module Bundler
 
           return m unless backtrace && dsl_path && contents
 
-          trace_line = backtrace.find {|l| l.include?(dsl_path.to_s) } || trace_line
+          trace_line = backtrace.find {|l| l.include?(dsl_path) } || trace_line
           return m unless trace_line
-          line_numer = trace_line.split(":")[1].to_i - 1
-          return m unless line_numer
+          line_number = trace_line.split(":")[1].to_i - 1
+          return m unless line_number
 
           lines      = contents.lines.to_a
           indent     = " #  "
           indicator  = indent.tr("#", ">")
-          first_line = line_numer.zero?
-          last_line  = (line_numer == (lines.count - 1))
+          first_line = line_number.zero?
+          last_line  = (line_number == (lines.count - 1))
 
           m << "\n"
           m << "#{indent}from #{trace_line.gsub(/:in.*$/, "")}\n"
           m << "#{indent}-------------------------------------------\n"
-          m << "#{indent}#{lines[line_numer - 1]}" unless first_line
-          m << "#{indicator}#{lines[line_numer]}"
-          m << "#{indent}#{lines[line_numer + 1]}" unless last_line
+          m << "#{indent}#{lines[line_number - 1]}" unless first_line
+          m << "#{indicator}#{lines[line_number]}"
+          m << "#{indent}#{lines[line_number + 1]}" unless last_line
           m << "\n" unless m.end_with?("\n")
           m << "#{indent}-------------------------------------------\n"
         end
@@ -603,7 +682,7 @@ module Bundler
 
       def parse_line_number_from_description
         description = self.description
-        if dsl_path && description =~ /((#{Regexp.quote File.expand_path(dsl_path)}|#{Regexp.quote dsl_path.to_s}):\d+)/
+        if dsl_path && description =~ /((#{Regexp.quote File.expand_path(dsl_path)}|#{Regexp.quote dsl_path}):\d+)/
           trace_line = Regexp.last_match[1]
           description = description.sub(/\n.*\n(\.\.\.)? *\^~+$/, "").sub(/#{Regexp.quote trace_line}:\s*/, "").sub("\n", " - ")
         end
diff --git a/lib/bundler/endpoint_specification.rb b/lib/bundler/endpoint_specification.rb
index 87cb352efa..7c7ce107e2 100644
--- a/lib/bundler/endpoint_specification.rb
+++ b/lib/bundler/endpoint_specification.rb
@@ -5,8 +5,9 @@ module Bundler
   class EndpointSpecification < Gem::Specification
     include MatchRemoteMetadata
 
-    attr_reader :name, :version, :platform, :checksum
-    attr_accessor :source, :remote, :dependencies
+    attr_reader :name, :version, :platform, :checksum, :created_at
+    attr_writer :dependencies
+    attr_accessor :remote, :locked_platform
 
     def initialize(name, version, platform, spec_fetcher, dependencies, metadata = nil)
       super()
@@ -14,18 +15,29 @@ module Bundler
       @version      = Gem::Version.create version
       @platform     = Gem::Platform.new(platform)
       @spec_fetcher = spec_fetcher
-      @dependencies = dependencies.map {|dep, reqs| build_dependency(dep, reqs) }
+      @dependencies = nil
+      @unbuilt_dependencies = dependencies
 
       @loaded_from          = nil
       @remote_specification = nil
+      @locked_platform = nil
 
       parse_metadata(metadata)
     end
 
+    def insecurely_materialized?
+      @locked_platform.to_s != @platform.to_s
+    end
+
     def fetch_platform
       @platform
     end
 
+    def dependencies
+      @dependencies ||= @unbuilt_dependencies.map! {|dep, reqs| build_dependency(dep, reqs) }
+    end
+    alias_method :runtime_dependencies, :dependencies
+
     # needed for standalone, load required_paths from local gemspec
     # after the gem is installed
     def require_paths
@@ -92,6 +104,17 @@ module Bundler
       end
     end
 
+    # needed for `bundle fund`
+    def metadata
+      if @remote_specification
+        @remote_specification.metadata
+      elsif _local_specification
+        _local_specification.metadata
+      else
+        super
+      end
+    end
+
     def _local_specification
       return unless @loaded_from && File.exist?(local_specification_path)
       eval(File.read(local_specification_path), nil, local_specification_path).tap do |spec|
@@ -104,6 +127,10 @@ module Bundler
       @remote_specification = spec
     end
 
+    def inspect
+      "#<#{self.class} @name=\"#{name}\" (#{full_name.delete_prefix("#{name}-")})>"
+    end
+
     private
 
     def _remote_specification
@@ -118,6 +145,7 @@ module Bundler
       unless data
         @required_ruby_version = nil
         @required_rubygems_version = nil
+        @created_at = nil
         return
       end
 
@@ -134,6 +162,15 @@ module Bundler
           @required_rubygems_version = Gem::Requirement.new(v)
         when "ruby"
           @required_ruby_version = Gem::Requirement.new(v)
+        when "created_at"
+          value = v.is_a?(Array) ? v.last : v
+          if value.is_a?(String)
+            @created_at = begin
+              Time.new(value)
+            rescue ArgumentError
+              nil
+            end
+          end
         end
       end
     rescue StandardError => e
@@ -141,7 +178,7 @@ module Bundler
     end
 
     def build_dependency(name, requirements)
-      Gem::Dependency.new(name, requirements)
+      Dependency.new(name, requirements)
     end
   end
 end
diff --git a/lib/bundler/env.rb b/lib/bundler/env.rb
index f6cb198e38..2b29705060 100644
--- a/lib/bundler/env.rb
+++ b/lib/bundler/env.rb
@@ -78,17 +78,6 @@ module Bundler
       "not installed"
     end
 
-    def self.version_of(script)
-      return "not installed" unless Bundler.which(script)
-      `#{script} --version`.chomp
-    end
-
-    def self.chruby_version
-      return "not installed" unless Bundler.which("chruby-exec")
-      `chruby-exec -- chruby --version`.
-        sub(/.*^chruby: (#{Gem::Version::VERSION_PATTERN}).*/m, '\1')
-    end
-
     def self.environment
       out = []
 
@@ -110,17 +99,9 @@ module Bundler
         out << ["  Cert File", OpenSSL::X509::DEFAULT_CERT_FILE] if defined?(OpenSSL::X509::DEFAULT_CERT_FILE)
         out << ["  Cert Dir", OpenSSL::X509::DEFAULT_CERT_DIR] if defined?(OpenSSL::X509::DEFAULT_CERT_DIR)
       end
-      out << ["Tools"]
-      out << ["  Git", git_version]
-      out << ["  RVM", ENV.fetch("rvm_version") { version_of("rvm") }]
-      out << ["  rbenv", version_of("rbenv")]
-      out << ["  chruby", chruby_version]
-
-      %w[rubygems-bundler open_gem].each do |name|
-        specs = Bundler.rubygems.find_name(name)
-        out << ["  #{name}", "(#{specs.map(&:version).join(",")})"] unless specs.empty?
-      end
-      if (exe = caller.last.split(":").first)&.match? %r{(exe|bin)/bundler?\z}
+      out << ["Git", git_version]
+
+      if (exe = caller_locations.last.absolute_path)&.match? %r{(exe|bin)/bundler?\z}
         shebang = File.read(exe).lines.first
         shebang.sub!(/^#!\s*/, "")
         unless shebang.start_with?(Gem.ruby, "/usr/bin/env ruby")
@@ -143,6 +124,6 @@ module Bundler
       out << "```\n"
     end
 
-    private_class_method :read_file, :ruby_version, :git_version, :append_formatted_table, :version_of, :chruby_version
+    private_class_method :read_file, :ruby_version, :git_version, :append_formatted_table
   end
 end
diff --git a/lib/bundler/environment_preserver.rb b/lib/bundler/environment_preserver.rb
index 444ab6fd37..bf9478a299 100644
--- a/lib/bundler/environment_preserver.rb
+++ b/lib/bundler/environment_preserver.rb
@@ -6,6 +6,7 @@ module Bundler
     BUNDLER_KEYS = %w[
       BUNDLE_BIN_PATH
       BUNDLE_GEMFILE
+      BUNDLE_LOCKFILE
       BUNDLER_VERSION
       BUNDLER_SETUP
       GEM_HOME
diff --git a/lib/bundler/errors.rb b/lib/bundler/errors.rb
index c29b1bfed8..dff5d93128 100644
--- a/lib/bundler/errors.rb
+++ b/lib/bundler/errors.rb
@@ -25,6 +25,7 @@ module Bundler
 
   class GemNotFound < BundlerError; status_code(7); end
   class InstallHookError < BundlerError; status_code(8); end
+  class RemovedError < BundlerError; status_code(9); end
   class GemfileNotFound < BundlerError; status_code(10); end
   class GitError < BundlerError; status_code(11); end
   class DeprecatedError < BundlerError; status_code(12); end
@@ -76,11 +77,6 @@ module Bundler
     def mismatch_resolution_instructions
       removable, remote = [@existing, @checksum].partition(&:removable?)
       case removable.size
-      when 0
-        msg = +"Mismatched checksums each have an authoritative source:\n"
-        msg << "  1. #{@existing.sources.reject(&:removable?).map(&:to_s).join(" and ")}\n"
-        msg << "  2. #{@checksum.sources.reject(&:removable?).map(&:to_s).join(" and ")}\n"
-        msg << "You may need to alter your Gemfile sources to resolve this issue.\n"
       when 1
         msg = +"If you trust #{remote.first.sources.first}, to resolve this issue you can:\n"
         msg << removable.first.removal_instructions
@@ -135,7 +131,8 @@ module Bundler
     attr_reader :orig_exception
 
     def initialize(orig_exception, msg)
-      full_message = msg + "\nGem Load Error is: #{orig_exception.message}\n"\
+      full_message = msg + "\nGem Load Error is:
+                      #{orig_exception.full_message(highlight: false)}\n"\
                       "Backtrace for gem load error is:\n"\
                       "#{orig_exception.backtrace.join("\n")}\n"\
                       "Bundler Error Backtrace:\n"
@@ -193,6 +190,24 @@ module Bundler
     status_code(31)
   end
 
+  class ReadOnlyFileSystemError < PermissionError
+    def message
+      "There was an error while trying to #{action} `#{@path}`. " \
+      "File system is read-only."
+    end
+
+    status_code(42)
+  end
+
+  class OperationNotPermittedError < PermissionError
+    def message
+      "There was an error while trying to #{action} `#{@path}`. " \
+      "Underlying OS system call raised an EPERM error."
+    end
+
+    status_code(43)
+  end
+
   class GenericSystemCallError < BundlerError
     attr_reader :underlying_error
 
@@ -207,7 +222,9 @@ module Bundler
   class DirectoryRemovalError < BundlerError
     def initialize(orig_exception, msg)
       full_message = "#{msg}.\n" \
-                     "The underlying error was #{orig_exception.class}: #{orig_exception.message}, with backtrace:\n" \
+                     "The underlying error was #{orig_exception.class}:
+                     #{orig_exception.full_message(highlight: false)},
+                     with backtrace:\n" \
                      "  #{orig_exception.backtrace.join("\n  ")}\n\n" \
                      "Bundler Error Backtrace:"
       super(full_message)
@@ -217,15 +234,15 @@ module Bundler
   end
 
   class InsecureInstallPathError < BundlerError
-    def initialize(path)
+    def initialize(name, path)
+      @name = name
       @path = path
     end
 
     def message
-      "The installation path is insecure. Bundler cannot continue.\n" \
-      "#{@path} is world-writable (without sticky bit).\n" \
-      "Bundler cannot safely replace gems in world-writeable directories due to potential vulnerabilities.\n" \
-      "Please change the permissions of this directory or choose a different install path."
+      "Bundler cannot reinstall #{@name} because there's a previous installation of it at #{@path} that is unsafe to remove.\n" \
+      "The parent of #{@path} is world-writable and does not have the sticky bit set, making it insecure to remove due to potential vulnerabilities.\n" \
+      "Please change the permissions of #{File.dirname(@path)} or choose a different install path."
     end
 
     status_code(38)
@@ -244,4 +261,46 @@ module Bundler
 
     status_code(39)
   end
+
+  class InvalidArgumentError < BundlerError; status_code(40); end
+
+  class IncorrectLockfileDependencies < BundlerError
+    attr_reader :spec, :actual_dependencies, :lockfile_dependencies
+
+    def initialize(spec, actual_dependencies = nil, lockfile_dependencies = nil)
+      @spec = spec
+      @actual_dependencies = actual_dependencies
+      @lockfile_dependencies = lockfile_dependencies
+    end
+
+    def message
+      lines = ["Bundler found incorrect dependencies in the lockfile for #{spec.full_name}", ""]
+
+      if @actual_dependencies && @lockfile_dependencies
+        actual_by_name = @actual_dependencies.each_with_object({}) {|d, h| h[d.name] = d }
+        lockfile_by_name = @lockfile_dependencies.each_with_object({}) {|d, h| h[d.name] = d }
+
+        (actual_by_name.keys | lockfile_by_name.keys).sort.each do |name|
+          actual = actual_by_name[name]
+          lockfile = lockfile_by_name[name]
+          next if actual && lockfile && actual.requirement == lockfile.requirement
+
+          if actual && lockfile
+            lines << "  #{name}: gemspec specifies #{actual.requirement}, lockfile has #{lockfile.requirement}"
+          elsif actual
+            lines << "  #{name}: gemspec specifies #{actual.requirement}, not in lockfile"
+          else
+            lines << "  #{name}: not in gemspec, lockfile has #{lockfile.requirement}"
+          end
+        end
+
+        lines << ""
+      end
+
+      lines << "Please run `bundle install` to regenerate the lockfile."
+      lines.join("\n")
+    end
+
+    status_code(41)
+  end
 end
diff --git a/lib/bundler/feature_flag.rb b/lib/bundler/feature_flag.rb
index ab2189f7f0..dea8abedba 100644
--- a/lib/bundler/feature_flag.rb
+++ b/lib/bundler/feature_flag.rb
@@ -2,52 +2,19 @@
 
 module Bundler
   class FeatureFlag
-    def self.settings_flag(flag, &default)
-      unless Bundler::Settings::BOOL_KEYS.include?(flag.to_s)
-        raise "Cannot use `#{flag}` as a settings feature flag since it isn't a bool key"
-      end
+    (1..10).each {|v| define_method("bundler_#{v}_mode?") { @major_version >= v } }
 
-      settings_method("#{flag}?", flag, &default)
+    def removed_major?(target_major_version)
+      @major_version > target_major_version
     end
-    private_class_method :settings_flag
 
-    def self.settings_option(key, &default)
-      settings_method(key, key, &default)
+    def deprecated_major?(target_major_version)
+      @major_version >= target_major_version
     end
-    private_class_method :settings_option
-
-    def self.settings_method(name, key, &default)
-      define_method(name) do
-        value = Bundler.settings[key]
-        value = instance_eval(&default) if value.nil?
-        value
-      end
-    end
-    private_class_method :settings_method
-
-    (1..10).each {|v| define_method("bundler_#{v}_mode?") { major_version >= v } }
-
-    settings_flag(:allow_offline_install) { bundler_3_mode? }
-    settings_flag(:auto_clean_without_path) { bundler_3_mode? }
-    settings_flag(:cache_all) { bundler_3_mode? }
-    settings_flag(:default_install_uses_path) { bundler_3_mode? }
-    settings_flag(:forget_cli_options) { bundler_3_mode? }
-    settings_flag(:global_gem_cache) { bundler_3_mode? }
-    settings_flag(:path_relative_to_cwd) { bundler_3_mode? }
-    settings_flag(:plugins) { @bundler_version >= Gem::Version.new("1.14") }
-    settings_flag(:print_only_version_number) { bundler_3_mode? }
-    settings_flag(:setup_makes_kernel_gem_public) { !bundler_3_mode? }
-    settings_flag(:update_requires_all_flag) { bundler_4_mode? }
-
-    settings_option(:default_cli_command) { bundler_3_mode? ? :cli_help : :install }
 
     def initialize(bundler_version)
       @bundler_version = Gem::Version.create(bundler_version)
+      @major_version = @bundler_version.segments.first
     end
-
-    def major_version
-      @bundler_version.segments.first
-    end
-    private :major_version
   end
 end
diff --git a/lib/bundler/fetcher.rb b/lib/bundler/fetcher.rb
index 6288b22dcd..0b6ced6f39 100644
--- a/lib/bundler/fetcher.rb
+++ b/lib/bundler/fetcher.rb
@@ -2,8 +2,7 @@
 
 require_relative "vendored_persistent"
 require_relative "vendored_timeout"
-require "cgi"
-require "securerandom"
+require_relative "vendored_securerandom"
 require "zlib"
 
 module Bundler
@@ -37,8 +36,9 @@ module Bundler
     # This is the error raised when a source is HTTPS and OpenSSL didn't load
     class SSLError < HTTPError
       def initialize(msg = nil)
-        super msg || "Could not load OpenSSL.\n" \
-            "You must recompile Ruby with OpenSSL support."
+        super "Could not load OpenSSL.\n" \
+          "You must recompile Ruby with OpenSSL support.\n" \
+          "original error: #{msg}\n"
       end
     end
 
@@ -72,19 +72,57 @@ module Bundler
       end
     end
 
+    HTTP_ERRORS = (Downloader::HTTP_RETRYABLE_ERRORS + Downloader::HTTP_NON_RETRYABLE_ERRORS).freeze
+    deprecate_constant :HTTP_ERRORS
+
+    NET_ERRORS = [
+      :HTTPBadGateway,
+      :HTTPBadRequest,
+      :HTTPFailedDependency,
+      :HTTPForbidden,
+      :HTTPInsufficientStorage,
+      :HTTPMethodNotAllowed,
+      :HTTPMovedPermanently,
+      :HTTPNoContent,
+      :HTTPNotFound,
+      :HTTPNotImplemented,
+      :HTTPPreconditionFailed,
+      :HTTPRequestEntityTooLarge,
+      :HTTPRequestURITooLong,
+      :HTTPUnauthorized,
+      :HTTPUnprocessableEntity,
+      :HTTPUnsupportedMediaType,
+      :HTTPVersionNotSupported,
+    ].freeze
+    deprecate_constant :NET_ERRORS
+
     # Exceptions classes that should bypass retry attempts. If your password didn't work the
     # first time, it's not going to the third time.
-    NET_ERRORS = [:HTTPBadGateway, :HTTPBadRequest, :HTTPFailedDependency,
-                  :HTTPForbidden, :HTTPInsufficientStorage, :HTTPMethodNotAllowed,
-                  :HTTPMovedPermanently, :HTTPNoContent, :HTTPNotFound,
-                  :HTTPNotImplemented, :HTTPPreconditionFailed, :HTTPRequestEntityTooLarge,
-                  :HTTPRequestURITooLong, :HTTPUnauthorized, :HTTPUnprocessableEntity,
-                  :HTTPUnsupportedMediaType, :HTTPVersionNotSupported].freeze
-    FAIL_ERRORS = begin
-      fail_errors = [AuthenticationRequiredError, BadAuthenticationError, AuthenticationForbiddenError, FallbackError, SecurityError]
-      fail_errors << Gem::Requirement::BadRequirementError
-      fail_errors.concat(NET_ERRORS.map {|e| Gem::Net.const_get(e) })
-    end.freeze
+    FAIL_ERRORS = [
+      AuthenticationRequiredError,
+      BadAuthenticationError,
+      AuthenticationForbiddenError,
+      FallbackError,
+      SecurityError,
+      Gem::Requirement::BadRequirementError,
+      Gem::Net::HTTPBadGateway,
+      Gem::Net::HTTPBadRequest,
+      Gem::Net::HTTPFailedDependency,
+      Gem::Net::HTTPForbidden,
+      Gem::Net::HTTPInsufficientStorage,
+      Gem::Net::HTTPMethodNotAllowed,
+      Gem::Net::HTTPMovedPermanently,
+      Gem::Net::HTTPNoContent,
+      Gem::Net::HTTPNotFound,
+      Gem::Net::HTTPNotImplemented,
+      Gem::Net::HTTPPreconditionFailed,
+      Gem::Net::HTTPRequestEntityTooLarge,
+      Gem::Net::HTTPRequestURITooLong,
+      Gem::Net::HTTPUnauthorized,
+      Gem::Net::HTTPUnprocessableEntity,
+      Gem::Net::HTTPUnsupportedMediaType,
+      Gem::Net::HTTPVersionNotSupported,
+    ].freeze
 
     class << self
       attr_accessor :disable_endpoint, :api_timeout, :redirect_limit, :max_retries
@@ -182,7 +220,7 @@ module Bundler
         agent << " ci/#{cis.join(",")}" if cis.any?
 
         # add a random ID so we can consolidate runs server-side
-        agent << " " << SecureRandom.hex(8)
+        agent << " " << Gem::SecureRandom.hex(8)
 
         # add any user agent strings set in the config
         extra_ua = Bundler.settings[:user_agent]
@@ -251,7 +289,13 @@ module Bundler
         needs_ssl = remote_uri.scheme == "https" ||
                     Bundler.settings[:ssl_verify_mode] ||
                     Bundler.settings[:ssl_client_cert]
-        raise SSLError if needs_ssl && !defined?(OpenSSL::SSL)
+        if needs_ssl
+          begin
+            require "openssl"
+          rescue StandardError, LoadError => e
+            raise SSLError.new(e.message)
+          end
+        end
 
         con = Gem::Net::HTTP::Persistent.new name: "bundler", proxy: :ENV
         if gem_proxy = Gem.configuration[:http_proxy]
@@ -287,13 +331,6 @@ module Bundler
       paths.find {|path| File.file? path }
     end
 
-    HTTP_ERRORS = [
-      Gem::Timeout::Error, EOFError, SocketError, Errno::ENETDOWN, Errno::ENETUNREACH,
-      Errno::EINVAL, Errno::ECONNRESET, Errno::ETIMEDOUT, Errno::EAGAIN,
-      Gem::Net::HTTPBadResponse, Gem::Net::HTTPHeaderSyntaxError, Gem::Net::ProtocolError,
-      Gem::Net::HTTP::Persistent::Error, Zlib::BufError, Errno::EHOSTUNREACH
-    ].freeze
-
     def bundler_cert_store
       store = OpenSSL::X509::Store.new
       ssl_ca_cert = Bundler.settings[:ssl_ca_cert] ||
diff --git a/lib/bundler/fetcher/compact_index.rb b/lib/bundler/fetcher/compact_index.rb
index 6e5656d26a..52168111fe 100644
--- a/lib/bundler/fetcher/compact_index.rb
+++ b/lib/bundler/fetcher/compact_index.rb
@@ -10,7 +10,7 @@ module Bundler
         method = instance_method(method_name)
         undef_method(method_name)
         define_method(method_name) do |*args, &blk|
-          method.bind(self).call(*args, &blk)
+          method.bind_call(self, *args, &blk)
         rescue NetworkDownError, CompactIndexClient::Updater::MismatchedChecksumError => e
           raise HTTPError, e.message
         rescue AuthenticationRequiredError, BadAuthenticationError
@@ -110,7 +110,7 @@ module Bundler
         def call(path, headers)
           fetcher.downloader.fetch(fetcher.fetch_uri + path, headers)
         rescue NetworkDownError => e
-          raise unless Bundler.feature_flag.allow_offline_install? && headers["If-None-Match"]
+          raise unless headers["If-None-Match"]
           ui.warn "Using the cached data for the new index because of a network error: #{e}"
           Gem::Net::HTTPNotModified.new(nil, nil, nil)
         end
diff --git a/lib/bundler/fetcher/dependency.rb b/lib/bundler/fetcher/dependency.rb
index 0b807c9a4b..4f2414e33d 100644
--- a/lib/bundler/fetcher/dependency.rb
+++ b/lib/bundler/fetcher/dependency.rb
@@ -1,7 +1,8 @@
 # frozen_string_literal: true
 
 require_relative "base"
-require "cgi"
+require "cgi/escape"
+require "cgi/util" unless defined?(CGI::EscapeExt)
 
 module Bundler
   class Fetcher
@@ -49,7 +50,7 @@ module Bundler
 
       def unmarshalled_dep_gems(gem_names)
         gem_list = []
-        gem_names.each_slice(Source::Rubygems::API_REQUEST_SIZE) do |names|
+        gem_names.each_slice(api_request_size) do |names|
           marshalled_deps = downloader.fetch(dependency_api_uri(names)).body
           gem_list.concat(Bundler.safe_load_marshal(marshalled_deps))
         end
@@ -73,6 +74,12 @@ module Bundler
         uri.query = "gems=#{CGI.escape(gem_names.sort.join(","))}" if gem_names.any?
         uri
       end
+
+      private
+
+      def api_request_size
+        Bundler.settings[:api_request_size]&.to_i || Source::Rubygems::API_REQUEST_SIZE
+      end
     end
   end
 end
diff --git a/lib/bundler/fetcher/downloader.rb b/lib/bundler/fetcher/downloader.rb
index 868b39b959..179eed8340 100644
--- a/lib/bundler/fetcher/downloader.rb
+++ b/lib/bundler/fetcher/downloader.rb
@@ -3,6 +3,28 @@
 module Bundler
   class Fetcher
     class Downloader
+      HTTP_NON_RETRYABLE_ERRORS = [
+        SocketError,
+        Errno::EADDRNOTAVAIL,
+        Errno::ENETDOWN,
+        Errno::ENETUNREACH,
+        Gem::Net::HTTP::Persistent::Error,
+        Errno::EHOSTUNREACH,
+      ].freeze
+
+      HTTP_RETRYABLE_ERRORS = [
+        Gem::Timeout::Error,
+        EOFError,
+        Errno::EINVAL,
+        Errno::ECONNRESET,
+        Errno::ETIMEDOUT,
+        Errno::EAGAIN,
+        Gem::Net::HTTPBadResponse,
+        Gem::Net::HTTPHeaderSyntaxError,
+        Gem::Net::ProtocolError,
+        Zlib::BufError,
+      ].freeze
+
       attr_reader :connection
       attr_reader :redirect_limit
 
@@ -32,7 +54,6 @@ module Bundler
         when Gem::Net::HTTPRequestedRangeNotSatisfiable
           new_headers = headers.dup
           new_headers.delete("Range")
-          new_headers["Accept-Encoding"] = "gzip"
           fetch(uri, new_headers)
         when Gem::Net::HTTPRequestEntityTooLarge
           raise FallbackError, response.body
@@ -67,15 +88,19 @@ module Bundler
         connection.request(uri, req)
       rescue OpenSSL::SSL::SSLError
         raise CertificateFailureError.new(uri)
-      rescue *HTTP_ERRORS => e
+      rescue *HTTP_NON_RETRYABLE_ERRORS => e
         Bundler.ui.trace e
-        if e.is_a?(SocketError) || e.message.to_s.include?("host down:")
-          raise NetworkDownError, "Could not reach host #{uri.host}. Check your network " \
-            "connection and try again."
-        else
-          raise HTTPError, "Network error while fetching #{filtered_uri}" \
+
+        host = uri.host
+        host_port = "#{host}:#{uri.port}"
+        host = host_port if filtered_uri.to_s.include?(host_port)
+        raise NetworkDownError, "Could not reach host #{host}. Check your network " \
+          "connection and try again."
+      rescue *HTTP_RETRYABLE_ERRORS => e
+        Bundler.ui.trace e
+
+        raise HTTPError, "Network error while fetching #{filtered_uri}" \
             " (#{e})"
-        end
       end
 
       private
diff --git a/lib/bundler/fetcher/gem_remote_fetcher.rb b/lib/bundler/fetcher/gem_remote_fetcher.rb
index 3fc7b68263..3159e05688 100644
--- a/lib/bundler/fetcher/gem_remote_fetcher.rb
+++ b/lib/bundler/fetcher/gem_remote_fetcher.rb
@@ -5,6 +5,12 @@ require "rubygems/remote_fetcher"
 module Bundler
   class Fetcher
     class GemRemoteFetcher < Gem::RemoteFetcher
+      def initialize(*)
+        super
+
+        @pool_size = Bundler.settings.installation_parallelization
+      end
+
       def request(*args)
         super do |req|
           req.delete("User-Agent") if headers["User-Agent"]
diff --git a/lib/bundler/force_platform.rb b/lib/bundler/force_platform.rb
index 249a24ecd1..7af33218cb 100644
--- a/lib/bundler/force_platform.rb
+++ b/lib/bundler/force_platform.rb
@@ -2,8 +2,6 @@
 
 module Bundler
   module ForcePlatform
-    private
-
     # The `:force_ruby_platform` value used by dependencies for resolution, and
     # by locked specifications for materialization is `false` by default, except
     # for TruffleRuby. TruffleRuby generally needs to force the RUBY platform
diff --git a/lib/bundler/friendly_errors.rb b/lib/bundler/friendly_errors.rb
index e61ed64450..5e8eaee6bb 100644
--- a/lib/bundler/friendly_errors.rb
+++ b/lib/bundler/friendly_errors.rb
@@ -80,7 +80,7 @@ module Bundler
         First, try this link to see if there are any existing issue reports for this error:
         #{issues_url(e)}
 
-        If there aren't any reports for this error yet, please fill in the new issue form located at #{new_issue_url}, and copy and paste the report template above in there.
+        If there aren't any reports for this error yet, please fill in the new issue form located at #{new_issue_url}. Make sure to copy and paste the full output of this command under the "What happened instead?" section.
       EOS
     end
 
@@ -102,13 +102,14 @@ module Bundler
     def issues_url(exception)
       message = exception.message.lines.first.tr(":", " ").chomp
       message = message.split("-").first if exception.is_a?(Errno)
-      require "cgi"
-      "https://github.com/rubygems/rubygems/search?q=" \
+      require "cgi/escape"
+      require "cgi/util" unless defined?(CGI::EscapeExt)
+      "https://github.com/ruby/rubygems/search?q=" \
         "#{CGI.escape(message)}&type=Issues"
     end
 
     def new_issue_url
-      "https://github.com/rubygems/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md"
+      "https://github.com/ruby/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md"
     end
   end
 
diff --git a/lib/bundler/gem_helpers.rb b/lib/bundler/gem_helpers.rb
deleted file mode 100644
index de007523ec..0000000000
--- a/lib/bundler/gem_helpers.rb
+++ /dev/null
@@ -1,127 +0,0 @@
-# frozen_string_literal: true
-
-module Bundler
-  module GemHelpers
-    GENERIC_CACHE = { Gem::Platform::RUBY => Gem::Platform::RUBY } # rubocop:disable Style/MutableConstant
-    GENERICS = [
-      [Gem::Platform.new("java"), Gem::Platform.new("java")],
-      [Gem::Platform.new("mswin32"), Gem::Platform.new("mswin32")],
-      [Gem::Platform.new("mswin64"), Gem::Platform.new("mswin64")],
-      [Gem::Platform.new("universal-mingw32"), Gem::Platform.new("universal-mingw32")],
-      [Gem::Platform.new("x64-mingw32"), Gem::Platform.new("x64-mingw32")],
-      [Gem::Platform.new("x86_64-mingw32"), Gem::Platform.new("x64-mingw32")],
-      [Gem::Platform.new("x64-mingw-ucrt"), Gem::Platform.new("x64-mingw-ucrt")],
-      [Gem::Platform.new("mingw32"), Gem::Platform.new("x86-mingw32")],
-    ].freeze
-
-    def generic(p)
-      GENERIC_CACHE[p] ||= begin
-        _, found = GENERICS.find do |match, _generic|
-          p.os == match.os && (!match.cpu || p.cpu == match.cpu)
-        end
-        found || Gem::Platform::RUBY
-      end
-    end
-    module_function :generic
-
-    def generic_local_platform
-      generic(local_platform)
-    end
-    module_function :generic_local_platform
-
-    def local_platform
-      Bundler.local_platform
-    end
-    module_function :local_platform
-
-    def generic_local_platform_is_ruby?
-      generic_local_platform == Gem::Platform::RUBY
-    end
-    module_function :generic_local_platform_is_ruby?
-
-    def platform_specificity_match(spec_platform, user_platform)
-      spec_platform = Gem::Platform.new(spec_platform)
-
-      PlatformMatch.specificity_score(spec_platform, user_platform)
-    end
-    module_function :platform_specificity_match
-
-    def select_best_platform_match(specs, platform)
-      matching = specs.select {|spec| spec.match_platform(platform) }
-
-      sort_best_platform_match(matching, platform)
-    end
-    module_function :select_best_platform_match
-
-    def force_ruby_platform(specs)
-      matching = specs.select {|spec| spec.match_platform(Gem::Platform::RUBY) && spec.force_ruby_platform! }
-
-      sort_best_platform_match(matching, Gem::Platform::RUBY)
-    end
-    module_function :force_ruby_platform
-
-    def sort_best_platform_match(matching, platform)
-      exact = matching.select {|spec| spec.platform == platform }
-      return exact if exact.any?
-
-      sorted_matching = matching.sort_by {|spec| platform_specificity_match(spec.platform, platform) }
-      exemplary_spec = sorted_matching.first
-
-      sorted_matching.take_while {|spec| same_specificity(platform, spec, exemplary_spec) && same_deps(spec, exemplary_spec) }
-    end
-    module_function :sort_best_platform_match
-
-    class PlatformMatch
-      def self.specificity_score(spec_platform, user_platform)
-        return -1 if spec_platform == user_platform
-        return 1_000_000 if spec_platform.nil? || spec_platform == Gem::Platform::RUBY || user_platform == Gem::Platform::RUBY
-
-        os_match(spec_platform, user_platform) +
-          cpu_match(spec_platform, user_platform) * 10 +
-          platform_version_match(spec_platform, user_platform) * 100
-      end
-
-      def self.os_match(spec_platform, user_platform)
-        if spec_platform.os == user_platform.os
-          0
-        else
-          1
-        end
-      end
-
-      def self.cpu_match(spec_platform, user_platform)
-        if spec_platform.cpu == user_platform.cpu
-          0
-        elsif spec_platform.cpu == "arm" && user_platform.cpu.to_s.start_with?("arm")
-          0
-        elsif spec_platform.cpu.nil? || spec_platform.cpu == "universal"
-          1
-        else
-          2
-        end
-      end
-
-      def self.platform_version_match(spec_platform, user_platform)
-        if spec_platform.version == user_platform.version
-          0
-        elsif spec_platform.version.nil?
-          1
-        else
-          2
-        end
-      end
-    end
-
-    def same_specificity(platform, spec, exemplary_spec)
-      platform_specificity_match(spec.platform, platform) == platform_specificity_match(exemplary_spec.platform, platform)
-    end
-    module_function :same_specificity
-
-    def same_deps(spec, exemplary_spec)
-      same_runtime_deps = spec.dependencies.sort == exemplary_spec.dependencies.sort
-      same_metadata_deps = spec.required_ruby_version == exemplary_spec.required_ruby_version && spec.required_rubygems_version == exemplary_spec.required_rubygems_version
-      same_runtime_deps && same_metadata_deps
-    end
-    module_function :same_deps
-  end
-end
diff --git a/lib/bundler/gem_version_promoter.rb b/lib/bundler/gem_version_promoter.rb
index ecc65b4956..d64dbacfdb 100644
--- a/lib/bundler/gem_version_promoter.rb
+++ b/lib/bundler/gem_version_promoter.rb
@@ -132,8 +132,6 @@ module Bundler
     # Specific version moves can't always reliably be done during sorting
     # as not all elements are compared against each other.
     def post_sort(result, unlock, locked_version)
-      # default :major behavior in Bundler does not do this
-      return result if major?
       if unlock || locked_version.nil?
         result
       else
diff --git a/lib/bundler/graph.rb b/lib/bundler/graph.rb
deleted file mode 100644
index b22b17a453..0000000000
--- a/lib/bundler/graph.rb
+++ /dev/null
@@ -1,152 +0,0 @@
-# frozen_string_literal: true
-
-require "set"
-module Bundler
-  class Graph
-    GRAPH_NAME = :Gemfile
-
-    def initialize(env, output_file, show_version = false, show_requirements = false, output_format = "png", without = [])
-      @env               = env
-      @output_file       = output_file
-      @show_version      = show_version
-      @show_requirements = show_requirements
-      @output_format     = output_format
-      @without_groups    = without.map(&:to_sym)
-
-      @groups            = []
-      @relations         = Hash.new {|h, k| h[k] = Set.new }
-      @node_options      = {}
-      @edge_options      = {}
-
-      _populate_relations
-    end
-
-    attr_reader :groups, :relations, :node_options, :edge_options, :output_file, :output_format
-
-    def viz
-      GraphVizClient.new(self).run
-    end
-
-    private
-
-    def _populate_relations
-      parent_dependencies = _groups.values.to_set.flatten
-      loop do
-        break if parent_dependencies.empty?
-
-        tmp = Set.new
-        parent_dependencies.each do |dependency|
-          child_dependencies = spec_for_dependency(dependency).runtime_dependencies.to_set
-          @relations[dependency.name] += child_dependencies.map(&:name).to_set
-          tmp += child_dependencies
-
-          @node_options[dependency.name] = _make_label(dependency, :node)
-          child_dependencies.each do |c_dependency|
-            @edge_options["#{dependency.name}_#{c_dependency.name}"] = _make_label(c_dependency, :edge)
-          end
-        end
-        parent_dependencies = tmp
-      end
-    end
-
-    def _groups
-      relations = Hash.new {|h, k| h[k] = Set.new }
-      @env.current_dependencies.each do |dependency|
-        dependency.groups.each do |group|
-          next if @without_groups.include?(group)
-
-          relations[group.to_s].add(dependency)
-          @relations[group.to_s].add(dependency.name)
-
-          @node_options[group.to_s] ||= _make_label(group, :node)
-          @edge_options["#{group}_#{dependency.name}"] = _make_label(dependency, :edge)
-        end
-      end
-      @groups = relations.keys
-      relations
-    end
-
-    def _make_label(symbol_or_string_or_dependency, element_type)
-      case element_type.to_sym
-      when :node
-        if symbol_or_string_or_dependency.is_a?(Gem::Dependency)
-          label = symbol_or_string_or_dependency.name.dup
-          label << "\n#{spec_for_dependency(symbol_or_string_or_dependency).version}" if @show_version
-        else
-          label = symbol_or_string_or_dependency.to_s
-        end
-      when :edge
-        label = nil
-        if symbol_or_string_or_dependency.respond_to?(:requirements_list) && @show_requirements
-          tmp = symbol_or_string_or_dependency.requirements_list.join(", ")
-          label = tmp if tmp != ">= 0"
-        end
-      else
-        raise ArgumentError, "2nd argument is invalid"
-      end
-      label.nil? ? {} : { label: label }
-    end
-
-    def spec_for_dependency(dependency)
-      @env.requested_specs.find {|s| s.name == dependency.name }
-    end
-
-    class GraphVizClient
-      def initialize(graph_instance)
-        @graph_name    = graph_instance.class::GRAPH_NAME
-        @groups        = graph_instance.groups
-        @relations     = graph_instance.relations
-        @node_options  = graph_instance.node_options
-        @edge_options  = graph_instance.edge_options
-        @output_file   = graph_instance.output_file
-        @output_format = graph_instance.output_format
-      end
-
-      def g
-        @g ||= ::GraphViz.digraph(@graph_name, concentrate: true, normalize: true, nodesep: 0.55) do |g|
-          g.edge[:weight]   = 2
-          g.edge[:fontname] = g.node[:fontname] = "Arial, Helvetica, SansSerif"
-          g.edge[:fontsize] = 12
-        end
-      end
-
-      def run
-        @groups.each do |group|
-          g.add_nodes(
-            group, {
-              style: "filled",
-              fillcolor: "#B9B9D5",
-              shape: "box3d",
-              fontsize: 16,
-            }.merge(@node_options[group])
-          )
-        end
-
-        @relations.each do |parent, children|
-          children.each do |child|
-            if @groups.include?(parent)
-              g.add_nodes(child, { style: "filled", fillcolor: "#B9B9D5" }.merge(@node_options[child]))
-              g.add_edges(parent, child, { constraint: false }.merge(@edge_options["#{parent}_#{child}"]))
-            else
-              g.add_nodes(child, @node_options[child])
-              g.add_edges(parent, child, @edge_options["#{parent}_#{child}"])
-            end
-          end
-        end
-
-        if @output_format.to_s == "debug"
-          $stdout.puts g.output none: String
-          Bundler.ui.info "debugging bundle viz..."
-        else
-          begin
-            g.output @output_format.to_sym => "#{@output_file}.#{@output_format}"
-            Bundler.ui.info "#{@output_file}.#{@output_format}"
-          rescue ArgumentError => e
-            warn "Unsupported output format. See Ruby-Graphviz/lib/graphviz/constants.rb"
-            raise e
-          end
-        end
-      end
-    end
-  end
-end
diff --git a/lib/bundler/index.rb b/lib/bundler/index.rb
index df46facc88..9aef2dfa12 100644
--- a/lib/bundler/index.rb
+++ b/lib/bundler/index.rb
@@ -46,13 +46,6 @@ module Bundler
       true
     end
 
-    def search_all(name, &blk)
-      return enum_for(:search_all, name) unless blk
-      specs_by_name(name).each(&blk)
-      @duplicates[name]&.each(&blk)
-      @sources.each {|source| source.search_all(name, &blk) }
-    end
-
     # Search this index's specs, and any source indexes that this index knows
     # about, returning all of the results.
     def search(query)
@@ -131,6 +124,11 @@ module Bundler
       return unless other
       other.each do |spec|
         if existing = find_by_spec(spec)
+          unless dependencies_eql?(existing, spec)
+            Bundler.ui.warn "Local specification for #{spec.full_name} has different dependencies than the remote gem, ignoring it"
+            next
+          end
+
           add_duplicate(existing)
         end
         add spec
@@ -153,8 +151,8 @@ module Bundler
     end
 
     def dependencies_eql?(spec, other_spec)
-      deps       = spec.dependencies.select {|d| d.type != :development }
-      other_deps = other_spec.dependencies.select {|d| d.type != :development }
+      deps       = spec.runtime_dependencies
+      other_deps = other_spec.runtime_dependencies
       deps.sort == other_deps.sort
     end
 
diff --git a/lib/bundler/injector.rb b/lib/bundler/injector.rb
index 879b481339..6aa9179024 100644
--- a/lib/bundler/injector.rb
+++ b/lib/bundler/injector.rb
@@ -23,10 +23,7 @@ module Bundler
     # @param [Pathname] lockfile_path The lockfile in which to inject the new dependency.
     # @return [Array]
     def inject(gemfile_path, lockfile_path)
-      if Bundler.frozen_bundle?
-        # ensure the lock and Gemfile are synced
-        Bundler.definition.ensure_equivalent_gemfile_and_lockfile(true)
-      end
+      Bundler.definition.ensure_equivalent_gemfile_and_lockfile(true)
 
       # temporarily unfreeze
       Bundler.settings.temporary(deployment: false, frozen: false) do
@@ -44,7 +41,7 @@ module Bundler
 
         # resolve to see if the new deps broke anything
         @definition = builder.to_definition(lockfile_path, {})
-        @definition.resolve_remotely!
+        @definition.remotely!
 
         # since nothing broke, we can add those gems to the gemfile
         append_to(gemfile_path, build_gem_lines(@options[:conservative_versioning])) if @deps.any?
@@ -83,20 +80,19 @@ module Bundler
     def conservative_version(spec)
       version = spec.version
       return ">= 0" if version.nil?
-      segments = version.segments
       seg_end_index = version >= Gem::Version.new("1.0") ? 1 : 2
 
       prerelease_suffix = version.to_s.delete_prefix(version.release.to_s) if version.prerelease?
-      "#{version_prefix}#{segments[0..seg_end_index].join(".")}#{prerelease_suffix}"
+      "#{version_prefix}#{version.segments[0..seg_end_index].join(".")}#{prerelease_suffix}"
     end
 
     def version_prefix
       if @options[:strict]
         "= "
-      elsif @options[:optimistic]
-        ">= "
-      else
+      elsif @options[:pessimistic]
         "~> "
+      else
+        ">= "
       end
     end
 
@@ -111,17 +107,17 @@ module Bundler
         end
 
         if d.groups != Array(:default)
-          group = d.groups.size == 1 ? ", :group => #{d.groups.first.inspect}" : ", :groups => #{d.groups.inspect}"
+          group = d.groups.size == 1 ? ", group: #{d.groups.first.inspect}" : ", groups: #{d.groups.inspect}"
         end
 
-        source = ", :source => \"#{d.source}\"" unless d.source.nil?
-        path = ", :path => \"#{d.path}\"" unless d.path.nil?
-        git = ", :git => \"#{d.git}\"" unless d.git.nil?
-        github = ", :github => \"#{d.github}\"" unless d.github.nil?
-        branch = ", :branch => \"#{d.branch}\"" unless d.branch.nil?
-        ref = ", :ref => \"#{d.ref}\"" unless d.ref.nil?
-        glob = ", :glob => \"#{d.glob}\"" unless d.glob.nil?
-        require_path = ", :require => #{convert_autorequire(d.autorequire)}" unless d.autorequire.nil?
+        source = ", source: \"#{d.source}\"" unless d.source.nil?
+        path = ", path: \"#{d.path}\"" unless d.path.nil?
+        git = ", git: \"#{d.git}\"" unless d.git.nil?
+        github = ", github: \"#{d.github}\"" unless d.github.nil?
+        branch = ", branch: \"#{d.branch}\"" unless d.branch.nil?
+        ref = ", ref: \"#{d.ref}\"" unless d.ref.nil?
+        glob = ", glob: \"#{d.glob}\"" unless d.glob.nil?
+        require_path = ", require: #{convert_autorequire(d.autorequire)}" unless d.autorequire.nil?
 
         %(gem #{name}#{requirement}#{group}#{source}#{path}#{git}#{github}#{branch}#{ref}#{glob}#{require_path})
       end.join("\n")
@@ -187,7 +183,7 @@ module Bundler
     # @param [Array] gems            Array of names of gems to be removed.
     # @param [Pathname] gemfile_path The Gemfile from which to remove dependencies.
     def remove_gems_from_gemfile(gems, gemfile_path)
-      patterns = /gem\s+(['"])#{Regexp.union(gems)}\1|gem\s*\((['"])#{Regexp.union(gems)}\2\)/
+      patterns = /gem\s+(['"])#{Regexp.union(gems)}\1|gem\s*\((['"])#{Regexp.union(gems)}\2.*\)/
       new_gemfile = []
       multiline_removal = false
       File.readlines(gemfile_path).each do |line|
diff --git a/lib/bundler/inline.rb b/lib/bundler/inline.rb
index ae4ccf2138..a1b8e0475e 100644
--- a/lib/bundler/inline.rb
+++ b/lib/bundler/inline.rb
@@ -1,16 +1,20 @@
 # frozen_string_literal: true
 
-# Allows for declaring a Gemfile inline in a ruby script, optionally installing
-# any gems that aren't already installed on the user's system.
+# Allows for declaring a Gemfile inline in a ruby script, installing any gems
+# that aren't already installed on the user's system.
 #
 # @note Every gem that is specified in this 'Gemfile' will be `require`d, as if
 #       the user had manually called `Bundler.require`. To avoid a requested gem
 #       being automatically required, add the `:require => false` option to the
 #       `gem` dependency declaration.
 #
-# @param install [Boolean] whether gems that aren't already installed on the
-#                          user's system should be installed.
-#                          Defaults to `false`.
+# @param force_latest_compatible [Boolean] Force installing the *latest*
+#                                          compatible versions of the gems,
+#                                          even if compatible versions are
+#                                          already installed locally.
+#                                          This also logs output if the
+#                                          `:quiet` option is not set.
+#                                          Defaults to `false`.
 #
 # @param gemfile [Proc]    a block that is evaluated as a `Gemfile`.
 #
@@ -29,45 +33,114 @@
 #
 #          puts Pod::VERSION # => "0.34.4"
 #
-def gemfile(install = false, options = {}, &gemfile)
+def gemfile(force_latest_compatible = false, options = {}, &gemfile)
   require_relative "../bundler"
   Bundler.reset!
 
   opts = options.dup
   ui = opts.delete(:ui) { Bundler::UI::Shell.new }
-  ui.level = "silent" if opts.delete(:quiet) || !install
+  ui.level = "silent" if opts.delete(:quiet) || !force_latest_compatible
   Bundler.ui = ui
   raise ArgumentError, "Unknown options: #{opts.keys.join(", ")}" unless opts.empty?
 
-  Bundler.with_unbundled_env do
+  old_gemfile = ENV["BUNDLE_GEMFILE"]
+  old_lockfile = ENV["BUNDLE_LOCKFILE"]
+
+  Bundler.unbundle_env!
+
+  begin
     Bundler.instance_variable_set(:@bundle_path, Pathname.new(Gem.dir))
     Bundler::SharedHelpers.set_env "BUNDLE_GEMFILE", "Gemfile"
+    Bundler::SharedHelpers.set_env "BUNDLE_LOCKFILE", "Gemfile.lock"
 
-    Bundler::Plugin.gemfile_install(&gemfile) if Bundler.feature_flag.plugins?
+    Bundler::Plugin.gemfile_install(&gemfile) if Bundler.settings[:plugins]
     builder = Bundler::Dsl.new
     builder.instance_eval(&gemfile)
-    builder.check_primary_source_safety
 
     Bundler.settings.temporary(deployment: false, frozen: false) do
       definition = builder.to_definition(nil, true)
-      def definition.lock(*); end
       definition.validate_runtime!
 
-      if install || definition.missing_specs?
-        Bundler.settings.temporary(inline: true, no_install: false) do
-          installer = Bundler::Installer.install(Bundler.root, definition, system: true)
-          installer.post_install_messages.each do |name, message|
-            Bundler.ui.info "Post-install message from #{name}:\n#{message}"
+      if force_latest_compatible || definition.missing_specs?
+        do_install = -> do
+          Bundler.settings.temporary(inline: true, no_install: false) do
+            installer = Bundler::Installer.install(Bundler.root, definition, system: true)
+            installer.post_install_messages.each do |name, message|
+              Bundler.ui.info "Post-install message from #{name}:\n#{message}"
+            end
           end
         end
+
+        # When possible we do the install in a subprocess because to install
+        # gems we need to require some default gems like `securerandom` etc
+        # which may later conflict with the Gemfile requirements.
+        installed_in_fork = false
+        if Process.respond_to?(:fork)
+          Gem.load_yaml # Avoid NameError on Ruby 3.2's safe_yaml.rb after Gem::Specification.reset
+          _, status = Process.waitpid2(Process.fork do
+                                         $VERBOSE = nil
+                                         do_install.call end)
+          exit(status.exitstatus || status.to_i) unless status.success?
+
+          installed_in_fork = true
+
+          Bundler.reset!
+          Gem::Specification.reset
+          Bundler.instance_variable_set(:@bundle_path, Pathname.new(Gem.dir))
+
+          builder = Bundler::Dsl.new
+          builder.instance_eval(&gemfile)
+          builder.check_primary_source_safety
+
+          definition = builder.to_definition(nil, true)
+          definition.validate_runtime!
+        else
+          do_install.call
+        end
       end
 
-      runtime = Bundler::Runtime.new(nil, definition)
-      runtime.setup.require
+      configure_forked_definition = ->(d) do
+        d.sources.rubygems_sources.each(&:remote!)
+        d.sources.git_sources.each do |source|
+          source.cached!
+          source.instance_variable_set(:@copied, true)
+        end
+        def d.lock(*); end
+      end
+      configure_forked_definition.call(definition) if installed_in_fork
+
+      begin
+        runtime = Bundler::Runtime.new(nil, definition).setup
+      rescue Gem::LoadError => e
+        name = e.name
+        version = e.requirement.requirements.first[1]
+        activated_version = Gem.loaded_specs[name].version
+
+        Bundler.ui.info \
+          "The #{name} gem was resolved to #{version}, but #{activated_version} was activated by Bundler while installing it, causing a conflict. " \
+          "Bundler will now retry resolving with #{activated_version} instead."
+
+        builder.dependencies.delete_if {|d| d.name == name }
+        builder.instance_eval { gem name, activated_version }
+        definition = builder.to_definition(nil, true)
+        configure_forked_definition.call(definition) if installed_in_fork
+
+        retry
+      end
+
+      runtime.require
+    end
+  ensure
+    if old_gemfile
+      ENV["BUNDLE_GEMFILE"] = old_gemfile
+    else
+      ENV["BUNDLE_GEMFILE"] = ""
     end
-  end
 
-  if ENV["BUNDLE_GEMFILE"].nil?
-    ENV["BUNDLE_GEMFILE"] = ""
+    if old_lockfile
+      ENV["BUNDLE_LOCKFILE"] = old_lockfile
+    else
+      ENV["BUNDLE_LOCKFILE"] = ""
+    end
   end
 end
diff --git a/lib/bundler/installer.rb b/lib/bundler/installer.rb
index 256f0be348..87d9a75627 100644
--- a/lib/bundler/installer.rb
+++ b/lib/bundler/installer.rb
@@ -7,12 +7,6 @@ require_relative "installer/gem_installer"
 
 module Bundler
   class Installer
-    class << self
-      attr_accessor :ambiguous_gems
-
-      Installer.ambiguous_gems = []
-    end
-
     attr_reader :post_install_messages, :definition
 
     # Begins the installation process for Bundler.
@@ -69,9 +63,12 @@ module Bundler
       Bundler.create_bundle_path
 
       ProcessLock.lock do
-        if Bundler.frozen_bundle?
-          @definition.ensure_equivalent_gemfile_and_lockfile(options[:deployment])
-        end
+        # Invalidate any stale gem specification cache from before we acquired the lock.
+        # Another process may have installed gems while we were waiting.
+        Gem::Specification.reset
+        @definition.sources.clear_cache
+
+        @definition.ensure_equivalent_gemfile_and_lockfile(options[:deployment])
 
         if @definition.dependencies.empty?
           Bundler.ui.warn "The Gemfile specifies no dependencies"
@@ -79,12 +76,9 @@ module Bundler
           return
         end
 
-        if resolve_if_needed(options)
+        if @definition.setup_domain!(options)
           ensure_specs_are_compatible!
-          Bundler.load_plugins(@definition)
-          options.delete(:jobs)
-        else
-          options[:jobs] = 1 # to avoid the overhead of Bundler::Worker
+          load_plugins
         end
         install(options)
 
@@ -96,6 +90,11 @@ module Bundler
     end
 
     def generate_bundler_executable_stubs(spec, options = {})
+      if spec.name == "bundler"
+        Bundler.ui.warn "Bundler itself does not use binstubs because its version is selected by RubyGems"
+        return
+      end
+
       if options[:binstubs_cmd] && spec.executables.empty?
         options = {}
         spec.runtime_dependencies.each do |dep|
@@ -120,10 +119,6 @@ module Bundler
       ruby_command = Thor::Util.ruby_command
       ruby_command = ruby_command
       template_path = File.expand_path("templates/Executable", __dir__)
-      if spec.name == "bundler"
-        template_path += ".bundler"
-        spec.executables = %(bundle)
-      end
       template = File.read(template_path)
 
       exists = []
@@ -196,56 +191,44 @@ module Bundler
     # that said, it's a rare situation (other than rake), and parallel
     # installation is SO MUCH FASTER. so we let people opt in.
     def install(options)
-      force = options["force"]
-      jobs = installation_parallelization(options)
-      install_in_parallel jobs, options[:standalone], force
+      standalone = options[:standalone]
+      force = options[:force]
+      local = options[:local] || options[:"prefer-local"]
+      jobs = Bundler.settings.installation_parallelization
+      spec_installations = ParallelInstaller.call(self, @definition.specs, jobs, standalone, force, local: local)
+      spec_installations.each do |installation|
+        post_install_messages[installation.name] = installation.post_install_message if installation.has_post_install_message?
+      end
     end
 
-    def installation_parallelization(options)
-      if jobs = options.delete(:jobs)
-        return jobs
-      end
+    def load_plugins
+      Gem.load_plugins
 
-      if jobs = Bundler.settings[:jobs]
-        return jobs
+      requested_path_gems = @definition.specs.select {|s| s.source.is_a?(Source::Path) }
+      path_plugin_files = requested_path_gems.flat_map do |spec|
+        spec.matches_for_glob("rubygems_plugin#{Bundler.rubygems.suffix_pattern}")
+      rescue TypeError
+        error_message = "#{spec.name} #{spec.version} has an invalid gemspec"
+        raise Gem::InvalidSpecificationException, error_message
       end
-
-      Bundler.settings.processor_count
+      Gem.load_plugin_files(path_plugin_files)
+      Gem.load_env_plugins
     end
 
     def ensure_specs_are_compatible!
+      overrides = @definition.overrides
       @definition.specs.each do |spec|
-        unless spec.matches_current_ruby?
+        unless spec.matches_current_ruby_with_overrides?(overrides)
           raise InstallError, "#{spec.full_name} requires ruby version #{spec.required_ruby_version}, " \
             "which is incompatible with the current version, #{Gem.ruby_version}"
         end
-        unless spec.matches_current_rubygems?
+        unless spec.matches_current_rubygems_with_overrides?(overrides)
           raise InstallError, "#{spec.full_name} requires rubygems version #{spec.required_rubygems_version}, " \
             "which is incompatible with the current version, #{Gem.rubygems_version}"
         end
       end
     end
 
-    def install_in_parallel(size, standalone, force = false)
-      spec_installations = ParallelInstaller.call(self, @definition.specs, size, standalone, force)
-      spec_installations.each do |installation|
-        post_install_messages[installation.name] = installation.post_install_message if installation.has_post_install_message?
-      end
-    end
-
-    # returns whether or not a re-resolve was needed
-    def resolve_if_needed(options)
-      @definition.prefer_local! if options["prefer-local"]
-
-      if options["local"] || (@definition.no_resolve_needed? && !@definition.missing_specs?)
-        @definition.resolve_with_cache!
-        false
-      else
-        @definition.resolve_remotely!
-        true
-      end
-    end
-
     def lock
       @definition.lock
     end
diff --git a/lib/bundler/installer/gem_installer.rb b/lib/bundler/installer/gem_installer.rb
index a7770eb7e0..f3b43c31ee 100644
--- a/lib/bundler/installer/gem_installer.rb
+++ b/lib/bundler/installer/gem_installer.rb
@@ -2,20 +2,20 @@
 
 module Bundler
   class GemInstaller
-    attr_reader :spec, :standalone, :worker, :force, :installer
+    attr_reader :spec, :standalone, :worker, :force, :local, :installer
 
-    def initialize(spec, installer, standalone = false, worker = 0, force = false)
+    def initialize(spec, installer, standalone = false, worker = 0, force = false, local = false)
       @spec = spec
       @installer = installer
       @standalone = standalone
       @worker = worker
       @force = force
+      @local = local
     end
 
     def install_from_spec
       post_install_message = install
       Bundler.ui.debug "#{worker}:  #{spec.name} (#{spec.version}) from #{spec.loaded_from}"
-      generate_executable_stubs
       [true, post_install_message]
     rescue Bundler::InstallHookError, Bundler::SecurityError, Bundler::APIResponseMismatchError, Bundler::InsecureInstallPathError
       raise
@@ -25,6 +25,20 @@ module Bundler
       [false, specific_failure_message(e)]
     end
 
+    def download
+      spec.source.download(
+        spec,
+        force: force,
+        local: local,
+        build_args: Array(spec_settings),
+        previous_spec: previous_spec,
+      )
+
+      [true, nil]
+    rescue Bundler::BundlerError => e
+      [false, specific_failure_message(e)]
+    end
+
     private
 
     def specific_failure_message(e)
@@ -54,6 +68,7 @@ module Bundler
       spec.source.install(
         spec,
         force: force,
+        local: local,
         build_args: Array(spec_settings),
         previous_spec: previous_spec,
       )
@@ -69,15 +84,5 @@ module Bundler
     def out_of_space_message
       "#{install_error_message}\nYour disk is out of space. Free some space to be able to install your bundle."
     end
-
-    def generate_executable_stubs
-      return if Bundler.feature_flag.forget_cli_options?
-      return if Bundler.settings[:inline]
-      if Bundler.settings[:bin] && standalone
-        installer.generate_standalone_bundler_executable_stubs(spec)
-      elsif Bundler.settings[:bin]
-        installer.generate_bundler_executable_stubs(spec, force: true)
-      end
-    end
   end
 end
diff --git a/lib/bundler/installer/parallel_installer.rb b/lib/bundler/installer/parallel_installer.rb
index e745088f81..fef326ed0a 100644
--- a/lib/bundler/installer/parallel_installer.rb
+++ b/lib/bundler/installer/parallel_installer.rb
@@ -6,7 +6,7 @@ require_relative "gem_installer"
 module Bundler
   class ParallelInstaller
     class SpecInstallation
-      attr_accessor :spec, :name, :full_name, :post_install_message, :state, :error
+      attr_accessor :spec, :name, :full_name, :post_install_message, :state, :error, :dependencies
       def initialize(spec)
         @spec = spec
         @name = spec.name
@@ -24,6 +24,10 @@ module Bundler
         state == :enqueued
       end
 
+      def enqueue_with_priority?
+        state == :installable && spec.extensions.any?
+      end
+
       def failed?
         state == :failed
       end
@@ -32,29 +36,21 @@ module Bundler
         state == :none
       end
 
-      def has_post_install_message?
-        !post_install_message.empty?
-      end
+      def ready_to_install?(installed_specs)
+        return false unless state == :downloaded
 
-      def ignorable_dependency?(dep)
-        dep.type == :development || dep.name == @name
+        spec.extensions.none? || dependencies_installed?(installed_specs)
       end
 
-      # Checks installed dependencies against spec's dependencies to make
-      # sure needed dependencies have been installed.
-      def dependencies_installed?(installed_specs)
-        dependencies.all? {|d| installed_specs.include? d.name }
-      end
-
-      # Represents only the non-development dependencies, the ones that are
-      # itself and are in the total list.
-      def dependencies
-        @dependencies ||= all_dependencies.reject {|dep| ignorable_dependency? dep }
+      def has_post_install_message?
+        !post_install_message.empty?
       end
 
-      # Represents all dependencies
-      def all_dependencies
-        @spec.dependencies
+      # Recursively checks that all dependencies (direct and transitive) have been installed.
+      def dependencies_installed?(installed_specs)
+        dependencies.all? do |dep|
+          installed_specs.include?(dep.name) && dep.dependencies_installed?(installed_specs)
+        end
       end
 
       def to_s
@@ -68,12 +64,19 @@ module Bundler
 
     attr_reader :size
 
-    def initialize(installer, all_specs, size, standalone, force, skip: nil)
+    def initialize(installer, all_specs, size, standalone, force, local: false, skip: nil)
       @installer = installer
       @size = size
       @standalone = standalone
       @force = force
+      @local = local
       @specs = all_specs.map {|s| SpecInstallation.new(s) }
+      specs_by_name = @specs.to_h {|s| [s.name, s] }
+      @specs.each do |spec_install|
+        spec_install.dependencies = spec_install.spec.dependencies.filter_map do |dep|
+          specs_by_name[dep.name] unless dep.type == :development || dep.name == spec_install.name
+        end
+      end
       @specs.each do |spec_install|
         spec_install.state = :installed if skip.include?(spec_install.name)
       end if skip
@@ -83,6 +86,7 @@ module Bundler
 
     def call
       if @rake
+        do_download(@rake, 0)
         do_install(@rake, 0)
         Gem::Specification.reset
       end
@@ -106,28 +110,56 @@ module Bundler
     end
 
     def install_with_worker
-      enqueue_specs
-      process_specs until finished_installing?
+      installed_specs = {}
+      enqueue_specs(installed_specs)
+
+      process_specs(installed_specs) until finished_installing?
     end
 
     def install_serially
       until finished_installing?
         raise "failed to find a spec to enqueue while installing serially" unless spec_install = @specs.find(&:ready_to_enqueue?)
         spec_install.state = :enqueued
+        do_download(spec_install, 0)
         do_install(spec_install, 0)
       end
     end
 
     def worker_pool
       @worker_pool ||= Bundler::Worker.new @size, "Parallel Installer", lambda {|spec_install, worker_num|
-        do_install(spec_install, worker_num)
+        case spec_install.state
+        when :enqueued
+          do_download(spec_install, worker_num)
+        when :installable
+          do_install(spec_install, worker_num)
+        else
+          spec_install
+        end
       }
     end
 
-    def do_install(spec_install, worker_num)
+    def do_download(spec_install, worker_num)
       Plugin.hook(Plugin::Events::GEM_BEFORE_INSTALL, spec_install)
+
+      gem_installer = Bundler::GemInstaller.new(
+        spec_install.spec, @installer, @standalone, worker_num, @force, @local
+      )
+
+      success, message = gem_installer.download
+
+      if success
+        spec_install.state = :downloaded
+      else
+        spec_install.error = "#{message}\n\n#{require_tree_for_spec(spec_install.spec)}"
+        spec_install.state = :failed
+      end
+
+      spec_install
+    end
+
+    def do_install(spec_install, worker_num)
       gem_installer = Bundler::GemInstaller.new(
-        spec_install.spec, @installer, @standalone, worker_num, @force
+        spec_install.spec, @installer, @standalone, worker_num, @force, @local
       )
       success, message = gem_installer.install_from_spec
       if success
@@ -146,9 +178,19 @@ module Bundler
     # Some specs might've had to wait til this spec was installed to be
     # processed so the call to `enqueue_specs` is important after every
     # dequeue.
-    def process_specs
-      worker_pool.deq
-      enqueue_specs
+    def process_specs(installed_specs)
+      spec = worker_pool.deq
+
+      if spec.installed?
+        installed_specs[spec.name] = true
+        return
+      elsif spec.failed?
+        return
+      elsif spec.ready_to_install?(installed_specs)
+        spec.state = :installable
+      end
+
+      worker_pool.enq(spec, priority: spec.enqueue_with_priority?)
     end
 
     def finished_installing?
@@ -184,18 +226,15 @@ module Bundler
     # Later we call this lambda again to install specs that depended on
     # previously installed specifications. We continue until all specs
     # are installed.
-    def enqueue_specs
-      installed_specs = {}
+    def enqueue_specs(installed_specs)
       @specs.each do |spec|
-        next unless spec.installed?
-        installed_specs[spec.name] = true
-      end
-
-      @specs.each do |spec|
-        if spec.ready_to_enqueue? && spec.dependencies_installed?(installed_specs)
-          spec.state = :enqueued
-          worker_pool.enq spec
+        if spec.installed?
+          installed_specs[spec.name] = true
+          next
         end
+
+        spec.state = :enqueued
+        worker_pool.enq spec
       end
     end
   end
diff --git a/lib/bundler/installer/standalone.rb b/lib/bundler/installer/standalone.rb
index 5331df2e95..8b4de64df5 100644
--- a/lib/bundler/installer/standalone.rb
+++ b/lib/bundler/installer/standalone.rb
@@ -28,7 +28,7 @@ module Bundler
     private
 
     def paths
-      @specs.map do |spec|
+      @specs.flat_map do |spec|
         next if spec.name == "bundler"
         Array(spec.require_paths).map do |path|
           gem_path(path, spec).
@@ -36,7 +36,7 @@ module Bundler
             sub(extensions_dir, 'extensions/\k<platform>/#{Gem.extension_api_version}')
           # This is a static string intentionally. It's interpolated at a later time.
         end
-      end.flatten.compact
+      end.compact
     end
 
     def version_dir
@@ -58,9 +58,6 @@ module Bundler
       else
         SharedHelpers.relative_path_to(full_path, from: Bundler.root.join(bundler_path))
       end
-    rescue TypeError
-      error_message = "#{spec.name} #{spec.version} has an invalid gemspec"
-      raise Gem::InvalidSpecificationException.new(error_message)
     end
 
     def prevent_gem_activation
diff --git a/lib/bundler/lazy_specification.rb b/lib/bundler/lazy_specification.rb
index 8669e021c2..0da621d21f 100644
--- a/lib/bundler/lazy_specification.rb
+++ b/lib/bundler/lazy_specification.rb
@@ -8,28 +8,59 @@ module Bundler
     include MatchPlatform
     include ForcePlatform
 
-    attr_reader :name, :version, :platform
-    attr_accessor :source, :remote, :force_ruby_platform, :dependencies, :required_ruby_version, :required_rubygems_version
+    attr_reader :name, :version, :platform, :materialization
+    attr_accessor :source, :remote, :force_ruby_platform, :dependencies, :required_ruby_version, :required_rubygems_version, :overrides
+
+    #
+    # For backwards compatibility with existing lockfiles, if the most specific
+    # locked platform is not a specific platform like x86_64-linux or
+    # universal-java-11, then we keep the previous behaviour of resolving the
+    # best platform variant at materiliazation time. For previous bundler
+    # versions (before 2.2.0) this was always the case (except when the lockfile
+    # only included non-ruby platforms), but we're also keeping this behaviour
+    # on newer bundlers unless users generate the lockfile from scratch or
+    # explicitly add a more specific platform.
+    #
+    attr_accessor :most_specific_locked_platform
 
     alias_method :runtime_dependencies, :dependencies
 
     def self.from_spec(s)
       lazy_spec = new(s.name, s.version, s.platform, s.source)
-      lazy_spec.dependencies = s.dependencies
+      lazy_spec.dependencies = s.runtime_dependencies
       lazy_spec.required_ruby_version = s.required_ruby_version
       lazy_spec.required_rubygems_version = s.required_rubygems_version
+      lazy_spec.overrides = s.overrides if s.is_a?(LazySpecification)
       lazy_spec
     end
 
-    def initialize(name, version, platform, source = nil)
+    def initialize(name, version, platform, source = nil, **materialization_options)
       @name          = name
       @version       = version
       @dependencies  = []
       @required_ruby_version = Gem::Requirement.default
       @required_rubygems_version = Gem::Requirement.default
-      @platform      = platform || Gem::Platform::RUBY
-      @source        = source
+      @platform = platform || Gem::Platform::RUBY
+
+      @original_source = source
+      @source = source
+      @materialization_options = materialization_options
+
       @force_ruby_platform = default_force_ruby_platform
+      @most_specific_locked_platform = nil
+      @materialization = nil
+    end
+
+    def missing?
+      @materialization == self
+    end
+
+    def incomplete?
+      @materialization.nil?
+    end
+
+    def source_changed?
+      @original_source != source
     end
 
     def full_name
@@ -92,47 +123,37 @@ module Bundler
       out
     end
 
-    def materialize_for_installation
-      source.local!
+    def materialize_for_cache
+      source.remote!
 
-      matching_specs = source.specs.search(use_exact_resolved_specifications? ? self : [name, version])
-      return self if matching_specs.empty?
+      materialize(self, &:first)
+    end
 
-      candidates = if use_exact_resolved_specifications?
-        matching_specs
-      else
-        target_platform = ruby_platform_materializes_to_ruby_platform? ? platform : local_platform
+    def materialized_for_installation
+      @materialization = materialize_for_installation
+
+      self unless incomplete?
+    end
 
-        installable_candidates = GemHelpers.select_best_platform_match(matching_specs, target_platform)
+    def materialize_for_installation
+      source.local!
 
-        specification = __materialize__(installable_candidates, fallback_to_non_installable: false)
-        return specification unless specification.nil?
+      if use_exact_resolved_specifications?
+        spec = materialize(self) {|specs| choose_compatible(specs, fallback_to_non_installable: false) }
+        return spec if spec
 
-        if target_platform != platform
-          installable_candidates = GemHelpers.select_best_platform_match(matching_specs, platform)
+        # Exact spec is incompatible; in frozen mode, try to find a compatible platform variant
+        # In non-frozen mode, return nil to trigger re-resolution and lockfile update
+        if Bundler.frozen_bundle?
+          materialize([name, version]) {|specs| resolve_best_platform(specs) }
         end
-
-        installable_candidates
+      else
+        materialize([name, version]) {|specs| resolve_best_platform(specs) }
       end
-
-      __materialize__(candidates)
     end
 
-    # If in frozen mode, we fallback to a non-installable candidate because by
-    # doing this we avoid re-resolving and potentially end up changing the
-    # lock file, which is not allowed. In that case, we will give a proper error
-    # about the mismatch higher up the stack, right before trying to install the
-    # bad gem.
-    def __materialize__(candidates, fallback_to_non_installable: Bundler.frozen_bundle?)
-      search = candidates.reverse.find do |spec|
-        spec.is_a?(StubSpecification) || spec.matches_current_metadata?
-      end
-      if search.nil? && fallback_to_non_installable
-        search = candidates.last
-      else
-        search.dependencies = dependencies if search && search.full_name == full_name && (search.is_a?(RemoteSpecification) || search.is_a?(EndpointSpecification))
-      end
-      search
+    def inspect
+      "#<#{self.class} @name=\"#{name}\" (#{full_name.delete_prefix("#{name}-")})>"
     end
 
     def to_s
@@ -148,26 +169,104 @@ module Bundler
       @force_ruby_platform = true
     end
 
+    def replace_source_with!(gemfile_source)
+      return unless gemfile_source.can_lock?(self)
+
+      @source = gemfile_source
+
+      true
+    end
+
     private
 
     def use_exact_resolved_specifications?
-      @use_exact_resolved_specifications ||= !source.is_a?(Source::Path) && ruby_platform_materializes_to_ruby_platform?
+      !source.is_a?(Source::Path) && ruby_platform_materializes_to_ruby_platform?
+    end
+
+    # Try platforms in order of preference until finding a compatible spec.
+    # Used for legacy lockfiles and as a fallback when the exact locked spec
+    # is incompatible. Falls back to frozen bundle behavior if none match.
+    def resolve_best_platform(specs)
+      find_compatible_platform_spec(specs) || frozen_bundle_fallback(specs)
+    end
+
+    def find_compatible_platform_spec(specs)
+      candidate_platforms.each do |plat|
+        candidates = MatchPlatform.select_best_platform_match(specs, plat)
+        spec = choose_compatible(candidates, fallback_to_non_installable: false)
+        return spec if spec
+      end
+      nil
+    end
+
+    # Platforms to try in order of preference. Ruby platform is last since it
+    # requires compilation, but works when precompiled gems are incompatible.
+    def candidate_platforms
+      target = source.is_a?(Source::Path) ? platform : Bundler.local_platform
+      [target, platform, Gem::Platform::RUBY].uniq
+    end
+
+    # In frozen mode, accept any candidate. Will error at install time.
+    # When target differs from locked platform, prefer locked platform's candidates
+    # to preserve lockfile integrity.
+    def frozen_bundle_fallback(specs)
+      target = source.is_a?(Source::Path) ? platform : Bundler.local_platform
+      fallback_platform = target == platform ? target : platform
+      candidates = MatchPlatform.select_best_platform_match(specs, fallback_platform)
+      choose_compatible(candidates)
     end
 
-    #
-    # For backwards compatibility with existing lockfiles, if the most specific
-    # locked platform is not a specific platform like x86_64-linux or
-    # universal-java-11, then we keep the previous behaviour of resolving the
-    # best platform variant at materiliazation time. For previous bundler
-    # versions (before 2.2.0) this was always the case (except when the lockfile
-    # only included non-ruby platforms), but we're also keeping this behaviour
-    # on newer bundlers unless users generate the lockfile from scratch or
-    # explicitly add a more specific platform.
-    #
     def ruby_platform_materializes_to_ruby_platform?
-      generic_platform = generic_local_platform == Gem::Platform::JAVA ? Gem::Platform::JAVA : Gem::Platform::RUBY
+      generic_platform = Bundler.generic_local_platform == Gem::Platform::JAVA ? Gem::Platform::JAVA : Gem::Platform::RUBY
 
-      !Bundler.most_specific_locked_platform?(generic_platform) || force_ruby_platform || Bundler.settings[:force_ruby_platform]
+      (most_specific_locked_platform != generic_platform) || force_ruby_platform || Bundler.settings[:force_ruby_platform]
+    end
+
+    def materialize(query)
+      matching_specs = source.specs.search(query)
+      return self if matching_specs.empty?
+
+      yield matching_specs
+    end
+
+    # If in frozen mode, we fallback to a non-installable candidate because by
+    # doing this we avoid re-resolving and potentially end up changing the
+    # lockfile, which is not allowed. In that case, we will give a proper error
+    # about the mismatch higher up the stack, right before trying to install the
+    # bad gem.
+    def choose_compatible(candidates, fallback_to_non_installable: Bundler.frozen_bundle?)
+      override_list = overrides || []
+      search = candidates.reverse.find do |spec|
+        spec.is_a?(StubSpecification) || spec.matches_current_metadata_with_overrides?(override_list)
+      end
+      if search.nil? && fallback_to_non_installable
+        search = candidates.last
+      end
+
+      if search
+        validate_dependencies(search) if search.platform == platform
+
+        search.locked_platform = platform if search.instance_of?(RemoteSpecification) || search.instance_of?(EndpointSpecification)
+      end
+      search
+    end
+
+    # Validate dependencies of this locked spec are consistent with dependencies
+    # of the actual spec that was materialized.
+    #
+    # Note that unless we are in strict mode (which we set during installation)
+    # we don't validate dependencies of locally installed gems but
+    # accept what's in the lockfile instead for performance, since loading
+    # dependencies of locally installed gems would mean evaluating all gemspecs,
+    # which would affect `bundler/setup` performance.
+    def validate_dependencies(spec)
+      if !@materialization_options[:strict] && spec.is_a?(StubSpecification)
+        spec.dependencies = dependencies
+      else
+        if !source.is_a?(Source::Path) && spec.runtime_dependencies.sort != dependencies.sort
+          raise IncorrectLockfileDependencies.new(self, spec.runtime_dependencies, dependencies)
+        end
+      end
     end
   end
 end
diff --git a/lib/bundler/lockfile_generator.rb b/lib/bundler/lockfile_generator.rb
index a646d00ee1..2a3ad22480 100644
--- a/lib/bundler/lockfile_generator.rb
+++ b/lib/bundler/lockfile_generator.rb
@@ -29,7 +29,7 @@ module Bundler
     private
 
     def add_sources
-      definition.send(:sources).lock_sources.each_with_index do |source, idx|
+      definition.sources.lock_sources.each_with_index do |source, idx|
         out << "\n" unless idx.zero?
 
         # Add the source header
@@ -71,7 +71,8 @@ module Bundler
       checksums = definition.resolve.map do |spec|
         spec.source.checksum_store.to_lock(spec)
       end
-      add_section("CHECKSUMS", checksums)
+
+      add_section("CHECKSUMS", checksums + bundler_checksum)
     end
 
     def add_locked_ruby_version
@@ -95,10 +96,24 @@ module Bundler
           out << "  #{key}: #{val}\n"
         end
       when String
-        out << "   #{value}\n"
+        out << "  #{value}\n"
       else
         raise ArgumentError, "#{value.inspect} can't be serialized in a lockfile"
       end
     end
+
+    def bundler_checksum
+      return [] if Bundler.gem_version.to_s.end_with?(".dev") || ENV["SKIP_BUNDLER_CHECKSUM"]
+
+      bundler_spec = definition.sources.metadata_source.specs.search(["bundler", Bundler.gem_version]).last
+      return [] unless File.exist?(bundler_spec.cache_file)
+
+      require "rubygems/package"
+
+      package = Gem::Package.new(bundler_spec.cache_file)
+      definition.sources.metadata_source.checksum_store.register(bundler_spec, Checksum.from_gem_package(package))
+
+      [definition.sources.metadata_source.checksum_store.to_lock(bundler_spec)]
+    end
   end
 end
diff --git a/lib/bundler/lockfile_parser.rb b/lib/bundler/lockfile_parser.rb
index 1e11621e55..852fc631f3 100644
--- a/lib/bundler/lockfile_parser.rb
+++ b/lib/bundler/lockfile_parser.rb
@@ -1,5 +1,7 @@
 # frozen_string_literal: true
 
+require_relative "shared_helpers"
+
 module Bundler
   class LockfileParser
     class Position
@@ -26,9 +28,11 @@ module Bundler
 
     attr_reader(
       :sources,
+      :metadata_source,
       :dependencies,
       :specs,
       :platforms,
+      :most_specific_locked_platform,
       :bundler_version,
       :ruby_version,
       :checksums,
@@ -91,24 +95,37 @@ module Bundler
       lockfile_contents.split(BUNDLED).last.strip
     end
 
-    def initialize(lockfile)
+    def initialize(lockfile, strict: false, lockfile_path: nil)
       @platforms    = []
       @sources      = []
+      @metadata_source = Source::Metadata.new
       @dependencies = {}
       @parse_method = nil
       @specs        = {}
-      @lockfile_path = begin
+      @lockfile_path = lockfile_path || begin
         SharedHelpers.relative_lockfile_path
       rescue GemfileNotFound
         "Gemfile.lock"
       end
       @pos = Position.new(1, 1)
+      @strict = strict
 
       if lockfile.match?(/<<<<<<<|=======|>>>>>>>|\|\|\|\|\|\|\|/)
         raise LockfileError, "Your #{@lockfile_path} contains merge conflicts.\n" \
           "Run `git checkout HEAD -- #{@lockfile_path}` first to get a clean lock."
       end
 
+      @valid = lockfile.strip.empty? ||
+               lockfile.split(/(?:\r?\n)+/).any? {|l| KNOWN_SECTIONS.include?(l) }
+
+      unless @valid
+        SharedHelpers.feature_deprecated!(
+          "Your #{@lockfile_path} does not appear to be a valid lockfile. " \
+          "Run `rm #{@lockfile_path}` and then `bundle install` to generate a new lockfile. " \
+          "This will raise a LockfileError in a future version of Bundler."
+        )
+      end
+
       lockfile.split(/((?:\r?\n)+)/) do |line|
         # split alternates between the line and the following whitespace
         next @pos.advance!(line) if line.match?(/^\s*$/)
@@ -136,7 +153,17 @@ module Bundler
         end
         @pos.advance!(line)
       end
-      @specs = @specs.values.sort_by!(&:full_name)
+
+      if @platforms.include?(Gem::Platform::X64_MINGW_LEGACY)
+        SharedHelpers.feature_deprecated!("Found x64-mingw32 in lockfile, which is deprecated and will be removed in the future.")
+      end
+
+      @most_specific_locked_platform = @platforms.min_by do |bundle_platform|
+        Gem::Platform.platform_specificity_match(bundle_platform, Bundler.local_platform)
+      end
+      @specs = @specs.values.sort_by!(&:full_name).each do |spec|
+        spec.most_specific_locked_platform = @most_specific_locked_platform
+      end
     rescue ArgumentError => e
       Bundler.ui.debug(e)
       raise LockfileError, "Your lockfile is unreadable. Run `rm #{@lockfile_path}` " \
@@ -148,6 +175,10 @@ module Bundler
       bundler_version.nil? || bundler_version < Gem::Version.new("1.16.2")
     end
 
+    def valid?
+      @valid
+    end
+
     private
 
     TYPES = {
@@ -231,7 +262,6 @@ module Bundler
       spaces = $1
       return unless spaces.size == 2
       checksums = $6
-      return unless checksums
       name = $2
       version = $3
       platform = $4
@@ -239,12 +269,21 @@ module Bundler
       version = Gem::Version.new(version)
       platform = platform ? Gem::Platform.new(platform) : Gem::Platform::RUBY
       full_name = Gem::NameTuple.new(name, version, platform).full_name
-      return unless spec = @specs[full_name]
+      spec = @specs[full_name]
 
-      checksums.split(",") do |lock_checksum|
-        column = line.index(lock_checksum) + 1
-        checksum = Checksum.from_lock(lock_checksum, "#{@lockfile_path}:#{@pos.line}:#{column}")
-        spec.source.checksum_store.register(spec, checksum)
+      if name == "bundler"
+        spec ||= LazySpecification.new(name, version, platform, @metadata_source)
+      end
+      return unless spec
+
+      if checksums
+        checksums.split(",") do |lock_checksum|
+          column = line.index(lock_checksum) + 1
+          checksum = Checksum.from_lock(lock_checksum, "#{@lockfile_path}:#{@pos.line}:#{column}")
+          spec.source.checksum_store.register(spec, checksum)
+        end
+      else
+        spec.source.checksum_store.register(spec, nil)
       end
     end
 
@@ -260,7 +299,7 @@ module Bundler
 
         version = Gem::Version.new(version)
         platform = platform ? Gem::Platform.new(platform) : Gem::Platform::RUBY
-        @current_spec = LazySpecification.new(name, version, platform, @current_source)
+        @current_spec = LazySpecification.new(name, version, platform, @current_source, strict: @strict)
         @current_source.add_dependency_names(name)
 
         @specs[@current_spec.full_name] = @current_spec
@@ -272,7 +311,7 @@ module Bundler
     end
 
     def parse_platform(line)
-      @platforms << Gem::Platform.new($1) if line =~ /^  (.*)$/
+      @platforms << Gem::Platform.new($1.strip) if line =~ /^  (.*)$/
     end
 
     def parse_bundled_with(line)
diff --git a/lib/bundler/man/bundle-add.1 b/lib/bundler/man/bundle-add.1
index 56a3b6f85c..0956aa83f1 100644
--- a/lib/bundler/man/bundle-add.1
+++ b/lib/bundler/man/bundle-add.1
@@ -1,59 +1,82 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-ADD" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-ADD" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-add\fR \- Add gem to the Gemfile and run bundle install
 .SH "SYNOPSIS"
-\fBbundle add\fR \fIGEM_NAME\fR [\-\-group=GROUP] [\-\-version=VERSION] [\-\-source=SOURCE] [\-\-path=PATH] [\-\-git=GIT] [\-\-github=GITHUB] [\-\-branch=BRANCH] [\-\-ref=REF] [\-\-skip\-install] [\-\-strict] [\-\-optimistic]
+\fBbundle add\fR \fIGEM_NAME\fR [\-\-group=GROUP] [\-\-version=VERSION] [\-\-source=SOURCE] [\-\-path=PATH] [\-\-git=GIT|\-\-github=GITHUB] [\-\-branch=BRANCH] [\-\-ref=REF] [\-\-cooldown=NUMBER] [\-\-quiet] [\-\-skip\-install] [\-\-strict|\-\-optimistic]
 .SH "DESCRIPTION"
-Adds the named gem to the Gemfile and run \fBbundle install\fR\. \fBbundle install\fR can be avoided by using the flag \fB\-\-skip\-install\fR\.
-.P
-Example:
-.P
-bundle add rails
-.P
-bundle add rails \-\-version "< 3\.0, > 1\.1"
-.P
-bundle add rails \-\-version "~> 5\.0\.0" \-\-source "https://gems\.example\.com" \-\-group "development"
-.P
-bundle add rails \-\-skip\-install
-.P
-bundle add rails \-\-group "development, test"
+Adds the named gem to the [\fBGemfile(5)\fR][Gemfile(5)] and run \fBbundle install\fR\. \fBbundle install\fR can be avoided by using the flag \fB\-\-skip\-install\fR\.
 .SH "OPTIONS"
 .TP
-\fB\-\-version\fR, \fB\-v\fR
+\fB\-\-version=VERSION\fR, \fB\-v=VERSION\fR
 Specify version requirements(s) for the added gem\.
 .TP
-\fB\-\-group\fR, \fB\-g\fR
+\fB\-\-group=GROUP\fR, \fB\-g=GROUP\fR
 Specify the group(s) for the added gem\. Multiple groups should be separated by commas\.
 .TP
-\fB\-\-source\fR, \fB\-s\fR
+\fB\-\-source=SOURCE\fR, \fB\-s=SOURCE\fR
 Specify the source for the added gem\.
 .TP
-\fB\-\-require\fR, \fB\-r\fR
+\fB\-\-require=REQUIRE\fR, \fB\-r=REQUIRE\fR
 Adds require path to gem\. Provide false, or a path as a string\.
 .TP
-\fB\-\-path\fR
+\fB\-\-path=PATH\fR
 Specify the file system path for the added gem\.
 .TP
-\fB\-\-git\fR
+\fB\-\-git=GIT\fR
 Specify the git source for the added gem\.
 .TP
-\fB\-\-github\fR
+\fB\-\-github=GITHUB\fR
 Specify the github source for the added gem\.
 .TP
-\fB\-\-branch\fR
+\fB\-\-branch=BRANCH\fR
 Specify the git branch for the added gem\.
 .TP
-\fB\-\-ref\fR
+\fB\-\-ref=REF\fR
 Specify the git ref for the added gem\.
 .TP
+\fB\-\-glob=GLOB\fR
+Specify the location of a dependency's \.gemspec, expanded within Ruby (single quotes recommended)\.
+.TP
+\fB\-\-quiet\fR
+Do not print progress information to the standard output\.
+.TP
 \fB\-\-skip\-install\fR
 Adds the gem to the Gemfile but does not install it\.
 .TP
 \fB\-\-optimistic\fR
-Adds optimistic declaration of version\.
+Ignored (now default behavior)
+.TP
+\fB\-\-pessimistic\fR
+Adds pessimistic declaration of version\.
 .TP
 \fB\-\-strict\fR
 Adds strict declaration of version\.
-
+.TP
+\fB\-\-cooldown=<number>\fR
+Only consider gem versions published at least \fInumber\fR days ago when resolving\. Pass \fB0\fR to disable cooldown for this run\. See \fBcooldown\fR in bundle\-config(1) for precedence rules\.
+.SH "EXAMPLES"
+.IP "1." 4
+You can add the \fBrails\fR gem to the Gemfile without any version restriction\. The source of the gem will be the global source\.
+.IP
+\fBbundle add rails\fR
+.IP "2." 4
+You can add the \fBrails\fR gem with version greater than 1\.1 (not including 1\.1) and less than 3\.0\.
+.IP
+\fBbundle add rails \-\-version "> 1\.1, < 3\.0"\fR
+.IP "3." 4
+You can use the \fBhttps://gems\.example\.com\fR custom source and assign the gem to a group\.
+.IP
+\fBbundle add rails \-\-version ">= 5\.0\.0" \-\-source "https://gems\.example\.com" \-\-group "development"\fR
+.IP "4." 4
+The following adds the \fBgem\fR entry to the Gemfile without installing the gem\. You can install gems later via \fBbundle install\fR\.
+.IP
+\fBbundle add rails \-\-skip\-install\fR
+.IP "5." 4
+You can assign the gem to more than one group\.
+.IP
+\fBbundle add rails \-\-group "development, test"\fR
+.IP "" 0
+.SH "SEE ALSO"
+Gemfile(5) \fIhttps://bundler\.io/man/gemfile\.5\.html\fR, bundle\-remove(1) \fIbundle\-remove\.1\.html\fR
diff --git a/lib/bundler/man/bundle-add.1.ronn b/lib/bundler/man/bundle-add.1.ronn
index 37c92e5fcd..8c65af0cc0 100644
--- a/lib/bundler/man/bundle-add.1.ronn
+++ b/lib/bundler/man/bundle-add.1.ronn
@@ -1,58 +1,95 @@
 bundle-add(1) -- Add gem to the Gemfile and run bundle install
-================================================================
+==============================================================
 
 ## SYNOPSIS
 
-`bundle add` <GEM_NAME> [--group=GROUP] [--version=VERSION] [--source=SOURCE] [--path=PATH] [--git=GIT] [--github=GITHUB] [--branch=BRANCH] [--ref=REF] [--skip-install] [--strict] [--optimistic]
+`bundle add` <GEM_NAME> [--group=GROUP] [--version=VERSION] [--source=SOURCE]
+           [--path=PATH] [--git=GIT|--github=GITHUB] [--branch=BRANCH] [--ref=REF]
+           [--cooldown=NUMBER] [--quiet] [--skip-install] [--strict|--optimistic]
 
 ## DESCRIPTION
-Adds the named gem to the Gemfile and run `bundle install`. `bundle install` can be avoided by using the flag `--skip-install`.
 
-Example:
-
-bundle add rails
-
-bundle add rails --version "< 3.0, > 1.1"
-
-bundle add rails --version "~> 5.0.0" --source "https://gems.example.com" --group "development"
-
-bundle add rails --skip-install
-
-bundle add rails --group "development, test"
+Adds the named gem to the [`Gemfile(5)`][Gemfile(5)] and run `bundle install`.
+`bundle install` can be avoided by using the flag `--skip-install`.
 
 ## OPTIONS
-* `--version`, `-v`:
+
+* `--version=VERSION`, `-v=VERSION`:
   Specify version requirements(s) for the added gem.
 
-* `--group`, `-g`:
+* `--group=GROUP`, `-g=GROUP`:
   Specify the group(s) for the added gem. Multiple groups should be separated by commas.
 
-* `--source`, `-s`:
+* `--source=SOURCE`, `-s=SOURCE`:
   Specify the source for the added gem.
 
-* `--require`, `-r`:
+* `--require=REQUIRE`, `-r=REQUIRE`:
   Adds require path to gem. Provide false, or a path as a string.
 
-* `--path`:
+* `--path=PATH`:
   Specify the file system path for the added gem.
 
-* `--git`:
+* `--git=GIT`:
   Specify the git source for the added gem.
 
-* `--github`:
+* `--github=GITHUB`:
   Specify the github source for the added gem.
 
-* `--branch`:
+* `--branch=BRANCH`:
   Specify the git branch for the added gem.
 
-* `--ref`:
+* `--ref=REF`:
   Specify the git ref for the added gem.
 
+* `--glob=GLOB`:
+  Specify the location of a dependency's .gemspec, expanded within Ruby (single quotes recommended).
+
+* `--quiet`:
+  Do not print progress information to the standard output.
+
 * `--skip-install`:
   Adds the gem to the Gemfile but does not install it.
 
 * `--optimistic`:
-  Adds optimistic declaration of version.
+  Ignored (now default behavior)
+
+* `--pessimistic`:
+  Adds pessimistic declaration of version.
 
 * `--strict`:
   Adds strict declaration of version.
+
+* `--cooldown=<number>`:
+  Only consider gem versions published at least <number> days ago when
+  resolving. Pass `0` to disable cooldown for this run. See `cooldown`
+  in bundle-config(1) for precedence rules.
+
+## EXAMPLES
+
+1. You can add the `rails` gem to the Gemfile without any version restriction.
+   The source of the gem will be the global source.
+
+   `bundle add rails`
+
+2. You can add the `rails` gem with version greater than 1.1 (not including 1.1) and less than 3.0.
+
+   `bundle add rails --version "> 1.1, < 3.0"`
+
+3. You can use the `https://gems.example.com` custom source and assign the gem
+   to a group.
+
+   `bundle add rails --version ">= 5.0.0" --source "https://gems.example.com" --group "development"`
+
+4. The following adds the `gem` entry to the Gemfile without installing the
+   gem. You can install gems later via `bundle install`.
+
+   `bundle add rails --skip-install`
+
+5. You can assign the gem to more than one group.
+
+   `bundle add rails --group "development, test"`
+
+## SEE ALSO
+
+[Gemfile(5)](https://bundler.io/man/gemfile.5.html),
+[bundle-remove(1)](bundle-remove.1.html)
diff --git a/lib/bundler/man/bundle-binstubs.1 b/lib/bundler/man/bundle-binstubs.1
index 4ec301951f..246daeae53 100644
--- a/lib/bundler/man/bundle-binstubs.1
+++ b/lib/bundler/man/bundle-binstubs.1
@@ -1,30 +1,30 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-BINSTUBS" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-BINSTUBS" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-binstubs\fR \- Install the binstubs of the listed gems
 .SH "SYNOPSIS"
-\fBbundle binstubs\fR \fIGEM_NAME\fR [\-\-force] [\-\-path PATH] [\-\-standalone]
+\fBbundle binstubs\fR \fIGEM_NAME\fR [\-\-force] [\-\-standalone] [\-\-all\-platforms]
 .SH "DESCRIPTION"
 Binstubs are scripts that wrap around executables\. Bundler creates a small Ruby file (a binstub) that loads Bundler, runs the command, and puts it into \fBbin/\fR\. Binstubs are a shortcut\-or alternative\- to always using \fBbundle exec\fR\. This gives you a file that can be run directly, and one that will always run the correct gem version used by the application\.
 .P
 For example, if you run \fBbundle binstubs rspec\-core\fR, Bundler will create the file \fBbin/rspec\fR\. That file will contain enough code to load Bundler, tell it to load the bundled gems, and then run rspec\.
 .P
-This command generates binstubs for executables in \fBGEM_NAME\fR\. Binstubs are put into \fBbin\fR, or the \fB\-\-path\fR directory if one has been set\. Calling binstubs with [GEM [GEM]] will create binstubs for all given gems\.
+This command generates binstubs for executables in \fBGEM_NAME\fR\. Binstubs are put into \fBbin\fR, or the directory specified by \fBbin\fR setting if it has been configured\. Calling binstubs with [GEM [GEM]] will create binstubs for all given gems\.
 .SH "OPTIONS"
 .TP
 \fB\-\-force\fR
 Overwrite existing binstubs if they exist\.
 .TP
-\fB\-\-path\fR
-The location to install the specified binstubs to\. This defaults to \fBbin\fR\.
-.TP
 \fB\-\-standalone\fR
 Makes binstubs that can work without depending on Rubygems or Bundler at runtime\.
 .TP
-\fB\-\-shebang\fR
+\fB\-\-shebang=SHEBANG\fR
 Specify a different shebang executable name than the default (default 'ruby')
 .TP
 \fB\-\-all\fR
 Create binstubs for all gems in the bundle\.
+.TP
+\fB\-\-all\-platforms\fR
+Install binstubs for all platforms\.
 
diff --git a/lib/bundler/man/bundle-binstubs.1.ronn b/lib/bundler/man/bundle-binstubs.1.ronn
index a96186929f..cbe5983f4d 100644
--- a/lib/bundler/man/bundle-binstubs.1.ronn
+++ b/lib/bundler/man/bundle-binstubs.1.ronn
@@ -3,7 +3,7 @@ bundle-binstubs(1) -- Install the binstubs of the listed gems
 
 ## SYNOPSIS
 
-`bundle binstubs` <GEM_NAME> [--force] [--path PATH] [--standalone]
+`bundle binstubs` <GEM_NAME> [--force] [--standalone] [--all-platforms]
 
 ## DESCRIPTION
 
@@ -19,23 +19,24 @@ the file `bin/rspec`. That file will contain enough code to load Bundler,
 tell it to load the bundled gems, and then run rspec.
 
 This command generates binstubs for executables in `GEM_NAME`.
-Binstubs are put into `bin`, or the `--path` directory if one has been set.
-Calling binstubs with [GEM [GEM]] will create binstubs for all given gems.
+Binstubs are put into `bin`, or the directory specified by `bin` setting if it
+has been configured. Calling binstubs with [GEM [GEM]] will create binstubs for
+all given gems.
 
 ## OPTIONS
 
 * `--force`:
   Overwrite existing binstubs if they exist.
 
-* `--path`:
-  The location to install the specified binstubs to. This defaults to `bin`.
-
 * `--standalone`:
   Makes binstubs that can work without depending on Rubygems or Bundler at
   runtime.
 
-* `--shebang`:
+* `--shebang=SHEBANG`:
   Specify a different shebang executable name than the default (default 'ruby')
 
 * `--all`:
   Create binstubs for all gems in the bundle.
+
+* `--all-platforms`:
+  Install binstubs for all platforms.
diff --git a/lib/bundler/man/bundle-cache.1 b/lib/bundler/man/bundle-cache.1
index e2da1269e6..38ea047961 100644
--- a/lib/bundler/man/bundle-cache.1
+++ b/lib/bundler/man/bundle-cache.1
@@ -1,16 +1,32 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-CACHE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-CACHE" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-cache\fR \- Package your needed \fB\.gem\fR files into your application
 .SH "SYNOPSIS"
-\fBbundle cache\fR
+\fBbundle cache\fR [\fIOPTIONS\fR]
 .P
 alias: \fBpackage\fR, \fBpack\fR
 .SH "DESCRIPTION"
 Copy all of the \fB\.gem\fR files needed to run the application into the \fBvendor/cache\fR directory\. In the future, when running \fBbundle install(1)\fR \fIbundle\-install\.1\.html\fR, use the gems in the cache in preference to the ones on \fBrubygems\.org\fR\.
+.SH "OPTIONS"
+.TP
+\fB\-\-all\-platforms\fR
+Include gems for all platforms present in the lockfile, not only the current one\.
+.TP
+\fB\-\-cache\-path=CACHE\-PATH\fR
+Specify a different cache path than the default (vendor/cache)\.
+.TP
+\fB\-\-gemfile=GEMFILE\fR
+Use the specified gemfile instead of Gemfile\.
+.TP
+\fB\-\-no\-install\fR
+Don't install the gems, only update the cache\.
+.TP
+\fB\-\-quiet\fR
+Only output warnings and errors\.
 .SH "GIT AND PATH GEMS"
-The \fBbundle cache\fR command can also package \fB:git\fR and \fB:path\fR dependencies besides \.gem files\. This needs to be explicitly enabled via the \fB\-\-all\fR option\. Once used, the \fB\-\-all\fR option will be remembered\.
+The \fBbundle cache\fR command can also package \fB:git\fR and \fB:path\fR dependencies besides \.gem files\. This can be disabled setting \fBcache_all\fR to false\.
 .SH "SUPPORT FOR MULTIPLE PLATFORMS"
 When using gems that have different packages for different platforms, Bundler supports caching of gems for other platforms where the Gemfile has been resolved (i\.e\. present in the lockfile) in \fBvendor/cache\fR\. This needs to be enabled via the \fB\-\-all\-platforms\fR option\. This setting will be remembered in your local bundler configuration\.
 .SH "REMOTE FETCHING"
diff --git a/lib/bundler/man/bundle-cache.1.ronn b/lib/bundler/man/bundle-cache.1.ronn
index 8112c2c551..51846c96b4 100644
--- a/lib/bundler/man/bundle-cache.1.ronn
+++ b/lib/bundler/man/bundle-cache.1.ronn
@@ -1,9 +1,9 @@
 bundle-cache(1) -- Package your needed `.gem` files into your application
-===========================================================================
+=========================================================================
 
 ## SYNOPSIS
 
-`bundle cache`
+`bundle cache` [*OPTIONS*]
 
 alias: `package`, `pack`
 
@@ -13,11 +13,27 @@ Copy all of the `.gem` files needed to run the application into the
 `vendor/cache` directory. In the future, when running [`bundle install(1)`](bundle-install.1.html),
 use the gems in the cache in preference to the ones on `rubygems.org`.
 
+## OPTIONS
+
+* `--all-platforms`:
+  Include gems for all platforms present in the lockfile, not only the current one.
+
+* `--cache-path=CACHE-PATH`:
+  Specify a different cache path than the default (vendor/cache).
+
+* `--gemfile=GEMFILE`:
+  Use the specified gemfile instead of Gemfile.
+
+* `--no-install`:
+  Don't install the gems, only update the cache.
+
+* `--quiet`:
+  Only output warnings and errors.
+
 ## GIT AND PATH GEMS
 
 The `bundle cache` command can also package `:git` and `:path` dependencies
-besides .gem files. This needs to be explicitly enabled via the `--all` option.
-Once used, the `--all` option will be remembered.
+besides .gem files. This can be disabled setting `cache_all` to false.
 
 ## SUPPORT FOR MULTIPLE PLATFORMS
 
diff --git a/lib/bundler/man/bundle-check.1 b/lib/bundler/man/bundle-check.1
index dee1af1326..6cd474d90a 100644
--- a/lib/bundler/man/bundle-check.1
+++ b/lib/bundler/man/bundle-check.1
@@ -1,10 +1,10 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-CHECK" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-CHECK" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-check\fR \- Verifies if dependencies are satisfied by installed gems
 .SH "SYNOPSIS"
-\fBbundle check\fR [\-\-dry\-run] [\-\-gemfile=FILE] [\-\-path=PATH]
+\fBbundle check\fR [\-\-dry\-run] [\-\-gemfile=FILE]
 .SH "DESCRIPTION"
 \fBcheck\fR searches the local machine for each of the gems requested in the Gemfile\. If all gems are found, Bundler prints a success message and exits with a status of 0\.
 .P
@@ -16,9 +16,6 @@ If the lockfile needs to be updated then it will be resolved using the gems inst
 \fB\-\-dry\-run\fR
 Locks the [\fBGemfile(5)\fR][Gemfile(5)] before running the command\.
 .TP
-\fB\-\-gemfile\fR
+\fB\-\-gemfile=GEMFILE\fR
 Use the specified gemfile instead of the [\fBGemfile(5)\fR][Gemfile(5)]\.
-.TP
-\fB\-\-path\fR
-Specify a different path than the system default (\fB$BUNDLE_PATH\fR or \fB$GEM_HOME\fR)\. Bundler will remember this value for future installs on this machine\.
 
diff --git a/lib/bundler/man/bundle-check.1.ronn b/lib/bundler/man/bundle-check.1.ronn
index eb3ff1daf9..92589159c9 100644
--- a/lib/bundler/man/bundle-check.1.ronn
+++ b/lib/bundler/man/bundle-check.1.ronn
@@ -5,7 +5,6 @@ bundle-check(1) -- Verifies if dependencies are satisfied by installed gems
 
 `bundle check` [--dry-run]
                [--gemfile=FILE]
-               [--path=PATH]
 
 ## DESCRIPTION
 
@@ -22,8 +21,6 @@ installed on the local machine, if they satisfy the requirements.
 
 * `--dry-run`:
   Locks the [`Gemfile(5)`][Gemfile(5)] before running the command.
-* `--gemfile`:
+
+* `--gemfile=GEMFILE`:
   Use the specified gemfile instead of the [`Gemfile(5)`][Gemfile(5)].
-* `--path`:
-  Specify a different path than the system default (`$BUNDLE_PATH` or `$GEM_HOME`).
-  Bundler will remember this value for future installs on this machine.
diff --git a/lib/bundler/man/bundle-clean.1 b/lib/bundler/man/bundle-clean.1
index 7c7f9b5c77..eb90636c17 100644
--- a/lib/bundler/man/bundle-clean.1
+++ b/lib/bundler/man/bundle-clean.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-CLEAN" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-CLEAN" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-clean\fR \- Cleans up unused gems in your bundler directory
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-config.1 b/lib/bundler/man/bundle-config.1
index 2de52ee375..c055c8a415 100644
--- a/lib/bundler/man/bundle-config.1
+++ b/lib/bundler/man/bundle-config.1
@@ -1,16 +1,16 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-CONFIG" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-CONFIG" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-config\fR \- Set bundler configuration options
 .SH "SYNOPSIS"
-\fBbundle config\fR list
+\fBbundle config\fR [list]
 .br
-\fBbundle config\fR [get] NAME
+\fBbundle config\fR [get [\-\-local|\-\-global]] NAME
 .br
-\fBbundle config\fR [set] NAME VALUE
+\fBbundle config\fR [set [\-\-local|\-\-global]] NAME VALUE
 .br
-\fBbundle config\fR unset NAME
+\fBbundle config\fR unset [\-\-local|\-\-global] NAME
 .SH "DESCRIPTION"
 This command allows you to interact with Bundler's configuration system\.
 .P
@@ -25,65 +25,40 @@ Global config (\fB~/\.bundle/config\fR)
 Bundler default config
 .IP "" 0
 .P
+Executing \fBbundle\fR with the \fBBUNDLE_IGNORE_CONFIG\fR environment variable set will cause it to ignore all configuration\.
+.SH "SUB\-COMMANDS"
+.SS "list (default command)"
 Executing \fBbundle config list\fR will print a list of all bundler configuration for the current bundle, and where that configuration was set\.
+.SS "get"
+Executing \fBbundle config get <name>\fR will print the value of that configuration setting, and all locations where it was set\.
 .P
-Executing \fBbundle config get <name>\fR will print the value of that configuration setting, and where it was set\.
-.P
-Executing \fBbundle config set <name> <value>\fR defaults to setting \fBlocal\fR configuration if executing from within a local application, otherwise it will set \fBglobal\fR configuration\. See \fB\-\-local\fR and \fB\-\-global\fR options below\.
+\fBOPTIONS\fR
+.TP
+\fB\-\-local\fR
+Get configuration from configuration file for the local application, namely, \fB<project_root>/\.bundle/config\fR, or \fB$BUNDLE_APP_CONFIG/config\fR if \fBBUNDLE_APP_CONFIG\fR is set\.
+.TP
+\fB\-\-global\fR
+Get configuration from configuration file global to all bundles executed as the current user, namely, from \fB~/\.bundle/config\fR\.
+.SS "set"
+Executing \fBbundle config set <name> <value>\fR defaults to setting \fBlocal\fR configuration if executing from within a local application, otherwise it will set \fBglobal\fR configuration\.
 .P
+\fBOPTIONS\fR
+.TP
+\fB\-\-local\fR
 Executing \fBbundle config set \-\-local <name> <value>\fR will set that configuration in the directory for the local application\. The configuration will be stored in \fB<project_root>/\.bundle/config\fR\. If \fBBUNDLE_APP_CONFIG\fR is set, the configuration will be stored in \fB$BUNDLE_APP_CONFIG/config\fR\.
-.P
+.TP
+\fB\-\-global\fR
 Executing \fBbundle config set \-\-global <name> <value>\fR will set that configuration to the value specified for all bundles executed as the current user\. The configuration will be stored in \fB~/\.bundle/config\fR\. If \fIname\fR already is set, \fIname\fR will be overridden and user will be warned\.
-.P
+.SS "unset"
 Executing \fBbundle config unset <name>\fR will delete the configuration in both local and global sources\.
 .P
-Executing \fBbundle config unset \-\-global <name>\fR will delete the configuration only from the user configuration\.
-.P
-Executing \fBbundle config unset \-\-local <name>\fR will delete the configuration only from the local application\.
-.P
-Executing bundle with the \fBBUNDLE_IGNORE_CONFIG\fR environment variable set will cause it to ignore all configuration\.
-.SH "REMEMBERING OPTIONS"
-Flags passed to \fBbundle install\fR or the Bundler runtime, such as \fB\-\-path foo\fR or \fB\-\-without production\fR, are remembered between commands and saved to your local application's configuration (normally, \fB\./\.bundle/config\fR)\.
-.P
-However, this will be changed in bundler 3, so it's better not to rely on this behavior\. If these options must be remembered, it's better to set them using \fBbundle config\fR (e\.g\., \fBbundle config set \-\-local path foo\fR)\.
-.P
-The options that can be configured are:
-.TP
-\fBbin\fR
-Creates a directory (defaults to \fB~/bin\fR) and place any executables from the gem there\. These executables run in Bundler's context\. If used, you might add this directory to your environment's \fBPATH\fR variable\. For instance, if the \fBrails\fR gem comes with a \fBrails\fR executable, this flag will create a \fBbin/rails\fR executable that ensures that all referred dependencies will be resolved using the bundled gems\.
-.TP
-\fBdeployment\fR
-In deployment mode, Bundler will 'roll\-out' the bundle for \fBproduction\fR use\. Please check carefully if you want to have this option enabled in \fBdevelopment\fR or \fBtest\fR environments\.
+\fBOPTIONS\fR
 .TP
-\fBonly\fR
-A space\-separated list of groups to install only gems of the specified groups\.
-.TP
-\fBpath\fR
-The location to install the specified gems to\. This defaults to Rubygems' setting\. Bundler shares this location with Rubygems, \fBgem install \|\.\|\.\|\.\fR will have gem installed there, too\. Therefore, gems installed without a \fB\-\-path \|\.\|\.\|\.\fR setting will show up by calling \fBgem list\fR\. Accordingly, gems installed to other locations will not get listed\.
-.TP
-\fBwithout\fR
-A space\-separated list of groups referencing gems to skip during installation\.
+\fB\-\-local\fR
+Executing \fBbundle config unset \-\-local <name>\fR will delete the configuration only from the local application\.
 .TP
-\fBwith\fR
-A space\-separated list of \fBoptional\fR groups referencing gems to include during installation\.
-.SH "BUILD OPTIONS"
-You can use \fBbundle config\fR to give Bundler the flags to pass to the gem installer every time bundler tries to install a particular gem\.
-.P
-A very common example, the \fBmysql\fR gem, requires Snow Leopard users to pass configuration flags to \fBgem install\fR to specify where to find the \fBmysql_config\fR executable\.
-.IP "" 4
-.nf
-gem install mysql \-\- \-\-with\-mysql\-config=/usr/local/mysql/bin/mysql_config
-.fi
-.IP "" 0
-.P
-Since the specific location of that executable can change from machine to machine, you can specify these flags on a per\-machine basis\.
-.IP "" 4
-.nf
-bundle config set \-\-global build\.mysql \-\-with\-mysql\-config=/usr/local/mysql/bin/mysql_config
-.fi
-.IP "" 0
-.P
-After running this command, every time bundler needs to install the \fBmysql\fR gem, it will pass along the flags you specified\.
+\fB\-\-global\fR
+Executing \fBbundle config unset \-\-global <name>\fR will delete the configuration only from the user configuration\.
 .SH "CONFIGURATION KEYS"
 Configuration keys in bundler have two forms: the canonical form and the environment variable form\.
 .P
@@ -95,27 +70,40 @@ Any periods in the configuration keys must be replaced with two underscores when
 .SH "LIST OF AVAILABLE KEYS"
 The following is a list of all configuration keys and their purpose\. You can learn more about their operation in bundle install(1) \fIbundle\-install\.1\.html\fR\.
 .IP "\(bu" 4
-\fBallow_offline_install\fR (\fBBUNDLE_ALLOW_OFFLINE_INSTALL\fR): Allow Bundler to use cached data when installing without network access\.
-.IP "\(bu" 4
-\fBauto_clean_without_path\fR (\fBBUNDLE_AUTO_CLEAN_WITHOUT_PATH\fR): Automatically run \fBbundle clean\fR after installing when an explicit \fBpath\fR has not been set and Bundler is not installing into the system gems\.
+\fBapi_request_size\fR (\fBBUNDLE_API_REQUEST_SIZE\fR): Configure how many dependencies to fetch when resolving the specifications\. This configuration is only used when fetching specifications from RubyGems servers that didn't implement the Compact Index API\. Defaults to 100\.
 .IP "\(bu" 4
 \fBauto_install\fR (\fBBUNDLE_AUTO_INSTALL\fR): Automatically run \fBbundle install\fR when gems are missing\.
 .IP "\(bu" 4
-\fBbin\fR (\fBBUNDLE_BIN\fR): Install executables from gems in the bundle to the specified directory\. Defaults to \fBfalse\fR\.
+\fBbin\fR (\fBBUNDLE_BIN\fR): If configured, \fBbundle binstubs\fR will install executables from gems in the bundle to the specified directory\. Otherwise it will create them in a \fBbin\fR directory relative to the Gemfile directory\. These executables run in Bundler's context\. If used, you might add this directory to your environment's \fBPATH\fR variable\. For instance, if the \fBrails\fR gem comes with a \fBrails\fR executable, \fBbundle binstubs\fR will create a \fBbin/rails\fR executable that ensures that all referred dependencies will be resolved using the bundled gems\.
 .IP "\(bu" 4
-\fBcache_all\fR (\fBBUNDLE_CACHE_ALL\fR): Cache all gems, including path and git gems\. This needs to be explicitly configured on bundler 1 and bundler 2, but will be the default on bundler 3\.
+\fBcache_all\fR (\fBBUNDLE_CACHE_ALL\fR): Cache all gems, including path and git gems\. This needs to be explicitly before bundler 4, but will be the default on bundler 4\.
 .IP "\(bu" 4
 \fBcache_all_platforms\fR (\fBBUNDLE_CACHE_ALL_PLATFORMS\fR): Cache gems for all platforms\.
 .IP "\(bu" 4
 \fBcache_path\fR (\fBBUNDLE_CACHE_PATH\fR): The directory that bundler will place cached gems in when running \fBbundle package\fR, and that bundler will look in when installing gems\. Defaults to \fBvendor/cache\fR\.
 .IP "\(bu" 4
-\fBclean\fR (\fBBUNDLE_CLEAN\fR): Whether Bundler should run \fBbundle clean\fR automatically after \fBbundle install\fR\.
+\fBclean\fR (\fBBUNDLE_CLEAN\fR): Whether Bundler should run \fBbundle clean\fR automatically after \fBbundle install\fR\. Defaults to \fBtrue\fR in Bundler 4, as long as \fBpath\fR is not explicitly configured\.
 .IP "\(bu" 4
 \fBconsole\fR (\fBBUNDLE_CONSOLE\fR): The console that \fBbundle console\fR starts\. Defaults to \fBirb\fR\.
 .IP "\(bu" 4
-\fBdefault_install_uses_path\fR (\fBBUNDLE_DEFAULT_INSTALL_USES_PATH\fR): Whether a \fBbundle install\fR without an explicit \fB\-\-path\fR argument defaults to installing gems in \fB\.bundle\fR\.
+\fBcooldown\fR (\fBBUNDLE_COOLDOWN\fR): Number of days a published gem version must age before bundler will resolve to it\. Defaults to unset (no cooldown)\. Pass \fB0\fR to disable cooldown for an individual run\.
+.IP
+The effective cooldown for any given gem is resolved from three layers, highest precedence first:
+.IP "1." 4
+CLI flag \fB\-\-cooldown N\fR on \fBinstall\fR, \fBupdate\fR, \fBadd\fR, and \fBoutdated\fR\.
+.IP "2." 4
+This setting (\fBbundle config set cooldown N\fR or \fBBUNDLE_COOLDOWN=N\fR)\.
+.IP "3." 4
+The per\-source \fBcooldown:\fR keyword in the Gemfile, such as \fBsource "https://rubygems\.org", cooldown: 7\fR\.
+.IP "" 0
+.IP
+The CLI flag and this setting apply uniformly to every source, including ones declared with their own \fBcooldown:\fR value\. To keep a private registry permanently exempt while still cooling down public gems, declare \fBsource "https://internal", cooldown: 0\fR in the Gemfile; remember that \fB\-\-cooldown N\fR on the command line will still override it for that single run\.
+.IP
+Cooldown filtering depends on the gem server providing a per\-version \fBcreated_at\fR timestamp in the v2 compact\-index format\. Versions without that metadata \- older gem servers, historical entries that predate the v2 cutover on \fBrubygems\.org\fR, or private registries that still emit the v1 format \- are treated as outside the cooldown window and remain resolvable\. If you rely on cooldown for supply\-chain protection, confirm that the gem server emits \fBcreated_at\fR in its \fB/info/<gem>\fR responses\.
+.IP "\(bu" 4
+\fBdefault_cli_command\fR (\fBBUNDLE_DEFAULT_CLI_COMMAND\fR): The command that running \fBbundle\fR without arguments should run\. Defaults to \fBcli_help\fR since Bundler 4, but can also be \fBinstall\fR which was the previous default\.
 .IP "\(bu" 4
-\fBdeployment\fR (\fBBUNDLE_DEPLOYMENT\fR): Disallow changes to the \fBGemfile\fR\. When the \fBGemfile\fR is changed and the lockfile has not been updated, running Bundler commands will be blocked\.
+\fBdeployment\fR (\fBBUNDLE_DEPLOYMENT\fR): Equivalent to setting \fBfrozen\fR to \fBtrue\fR and \fBpath\fR to \fBvendor/bundle\fR\.
 .IP "\(bu" 4
 \fBdisable_checksum_validation\fR (\fBBUNDLE_DISABLE_CHECKSUM_VALIDATION\fR): Allow installing gems even if they do not match the checksum provided by RubyGems\.
 .IP "\(bu" 4
@@ -131,15 +119,15 @@ The following is a list of all configuration keys and their purpose\. You can le
 .IP "\(bu" 4
 \fBforce_ruby_platform\fR (\fBBUNDLE_FORCE_RUBY_PLATFORM\fR): Ignore the current machine's platform and install only \fBruby\fR platform gems\. As a result, gems with native extensions will be compiled from source\.
 .IP "\(bu" 4
-\fBfrozen\fR (\fBBUNDLE_FROZEN\fR): Disallow changes to the \fBGemfile\fR\. When the \fBGemfile\fR is changed and the lockfile has not been updated, running Bundler commands will be blocked\. Defaults to \fBtrue\fR when \fB\-\-deployment\fR is used\.
+\fBfrozen\fR (\fBBUNDLE_FROZEN\fR): Disallow any automatic changes to \fBGemfile\.lock\fR\. Bundler commands will be blocked unless the lockfile can be installed exactly as written\. Usually this will happen when changing the \fBGemfile\fR manually and forgetting to update the lockfile through \fBbundle lock\fR or \fBbundle install\fR\.
 .IP "\(bu" 4
-\fBgem\.github_username\fR (\fBBUNDLE_GEM__GITHUB_USERNAME\fR): Sets a GitHub username or organization to be used in \fBREADME\fR file when you create a new gem via \fBbundle gem\fR command\. It can be overridden by passing an explicit \fB\-\-github\-username\fR flag to \fBbundle gem\fR\.
+\fBgem\.github_username\fR (\fBBUNDLE_GEM__GITHUB_USERNAME\fR): Sets a GitHub username or organization to be used in the \fBREADME\fR and \fB\.gemspec\fR files when you create a new gem via \fBbundle gem\fR command\. It can be overridden by passing an explicit \fB\-\-github\-username\fR flag to \fBbundle gem\fR\.
 .IP "\(bu" 4
 \fBgem\.push_key\fR (\fBBUNDLE_GEM__PUSH_KEY\fR): Sets the \fB\-\-key\fR parameter for \fBgem push\fR when using the \fBrake release\fR command with a private gemstash server\.
 .IP "\(bu" 4
 \fBgemfile\fR (\fBBUNDLE_GEMFILE\fR): The name of the file that bundler should use as the \fBGemfile\fR\. This location of this file also sets the root of the project, which is used to resolve relative paths in the \fBGemfile\fR, among other things\. By default, bundler will search up from the current working directory until it finds a \fBGemfile\fR\.
 .IP "\(bu" 4
-\fBglobal_gem_cache\fR (\fBBUNDLE_GLOBAL_GEM_CACHE\fR): Whether Bundler should cache all gems globally, rather than locally to the installing Ruby installation\.
+\fBglobal_gem_cache\fR (\fBBUNDLE_GLOBAL_GEM_CACHE\fR): Whether Bundler should cache all gems and compiled extensions globally, rather than locally to the configured installation path\.
 .IP "\(bu" 4
 \fBignore_funding_requests\fR (\fBBUNDLE_IGNORE_FUNDING_REQUESTS\fR): When set, no funding requests will be printed\.
 .IP "\(bu" 4
@@ -147,38 +135,42 @@ The following is a list of all configuration keys and their purpose\. You can le
 .IP "\(bu" 4
 \fBinit_gems_rb\fR (\fBBUNDLE_INIT_GEMS_RB\fR): Generate a \fBgems\.rb\fR instead of a \fBGemfile\fR when running \fBbundle init\fR\.
 .IP "\(bu" 4
-\fBjobs\fR (\fBBUNDLE_JOBS\fR): The number of gems Bundler can install in parallel\. Defaults to the number of available processors\.
+\fBjobs\fR (\fBBUNDLE_JOBS\fR): The number of gems Bundler can download and install in parallel\. Defaults to the number of available processors\.
+.IP "\(bu" 4
+\fBlockfile\fR (\fBBUNDLE_LOCKFILE\fR): The path to the lockfile that bundler should use\. By default, Bundler adds \fB\.lock\fR to the end of the \fBgemfile\fR entry\. Can be set to \fBfalse\fR in the Gemfile to disable lockfile creation entirely (see gemfile(5))\.
+.IP "\(bu" 4
+\fBlockfile_checksums\fR (\fBBUNDLE_LOCKFILE_CHECKSUMS\fR): Whether Bundler should include a checksums section in new lockfiles, to protect from compromised gem sources\. Defaults to true\.
+.IP "\(bu" 4
+\fBno_build_extension\fR (\fBBUNDLE_NO_BUILD_EXTENSION\fR): Whether Bundler should skip building native extensions during installation\. When set, gems are installed without compiling their C extensions\. To build extensions later, unset this setting and run \fBbundle pristine <gem>\fR\.
 .IP "\(bu" 4
 \fBno_install\fR (\fBBUNDLE_NO_INSTALL\fR): Whether \fBbundle package\fR should skip installing gems\.
 .IP "\(bu" 4
+\fBno_install_plugin\fR (\fBBUNDLE_NO_INSTALL_PLUGIN\fR): Whether Bundler should skip installing RubyGems plugins during installation\. When set, plugin files are not written to the plugins directory\. To install plugins later, unset this setting and run \fBbundle pristine <gem>\fR\.
+.IP "\(bu" 4
 \fBno_prune\fR (\fBBUNDLE_NO_PRUNE\fR): Whether Bundler should leave outdated gems unpruned when caching\.
 .IP "\(bu" 4
-\fBonly\fR (\fBBUNDLE_ONLY\fR): A space\-separated list of groups to install only gems of the specified groups\.
+\fBonly\fR (\fBBUNDLE_ONLY\fR): A space\-separated list of groups to install only gems of the specified groups\. Please check carefully if you want to install also gems without a group, because they get put inside \fBdefault\fR group\. For example \fBonly test:default\fR will install all gems specified in test group and without one\.
 .IP "\(bu" 4
-\fBpath\fR (\fBBUNDLE_PATH\fR): The location on disk where all gems in your bundle will be located regardless of \fB$GEM_HOME\fR or \fB$GEM_PATH\fR values\. Bundle gems not found in this location will be installed by \fBbundle install\fR\. Defaults to \fBGem\.dir\fR\. When \-\-deployment is used, defaults to vendor/bundle\.
+\fBpath\fR (\fBBUNDLE_PATH\fR): The location on disk where all gems in your bundle will be located regardless of \fB$GEM_HOME\fR or \fB$GEM_PATH\fR values\. Bundle gems not found in this location will be installed by \fBbundle install\fR\. When not set, Bundler install by default to a \fB\.bundle\fR directory relative to repository root in Bundler 4, and to the default system path (\fBGem\.dir\fR) before Bundler 4\. That means that before Bundler 4, Bundler shares this location with Rubygems, and \fBgem install \|\.\|\.\|\.\fR will have gems installed in the same location and therefore, gems installed without \fBpath\fR set will show up by calling \fBgem list\fR\. This will not be the case in Bundler 4\.
 .IP "\(bu" 4
 \fBpath\.system\fR (\fBBUNDLE_PATH__SYSTEM\fR): Whether Bundler will install gems into the default system path (\fBGem\.dir\fR)\.
 .IP "\(bu" 4
-\fBpath_relative_to_cwd\fR (\fBBUNDLE_PATH_RELATIVE_TO_CWD\fR) Makes \fB\-\-path\fR relative to the CWD instead of the \fBGemfile\fR\.
-.IP "\(bu" 4
 \fBplugins\fR (\fBBUNDLE_PLUGINS\fR): Enable Bundler's experimental plugin system\.
 .IP "\(bu" 4
-\fBprefer_patch\fR (BUNDLE_PREFER_PATCH): Prefer updating only to next patch version during updates\. Makes \fBbundle update\fR calls equivalent to \fBbundler update \-\-patch\fR\.
-.IP "\(bu" 4
-\fBprint_only_version_number\fR (\fBBUNDLE_PRINT_ONLY_VERSION_NUMBER\fR): Print only version number from \fBbundler \-\-version\fR\.
+\fBprefer_patch\fR (\fBBUNDLE_PREFER_PATCH\fR): Prefer updating only to next patch version during updates\. Makes \fBbundle update\fR calls equivalent to \fBbundler update \-\-patch\fR\.
 .IP "\(bu" 4
 \fBredirect\fR (\fBBUNDLE_REDIRECT\fR): The number of redirects allowed for network requests\. Defaults to \fB5\fR\.
 .IP "\(bu" 4
 \fBretry\fR (\fBBUNDLE_RETRY\fR): The number of times to retry failed network requests\. Defaults to \fB3\fR\.
 .IP "\(bu" 4
-\fBsetup_makes_kernel_gem_public\fR (\fBBUNDLE_SETUP_MAKES_KERNEL_GEM_PUBLIC\fR): Have \fBBundler\.setup\fR make the \fBKernel#gem\fR method public, even though RubyGems declares it as private\.
-.IP "\(bu" 4
 \fBshebang\fR (\fBBUNDLE_SHEBANG\fR): The program name that should be invoked for generated binstubs\. Defaults to the ruby install name used to generate the binstub\.
 .IP "\(bu" 4
 \fBsilence_deprecations\fR (\fBBUNDLE_SILENCE_DEPRECATIONS\fR): Whether Bundler should silence deprecation warnings for behavior that will be changed in the next major version\.
 .IP "\(bu" 4
 \fBsilence_root_warning\fR (\fBBUNDLE_SILENCE_ROOT_WARNING\fR): Silence the warning Bundler prints when installing gems as root\.
 .IP "\(bu" 4
+\fBsimulate_version\fR (\fBBUNDLE_SIMULATE_VERSION\fR): The virtual version Bundler should use for activating feature flags\. Can be used to simulate all the new functionality that will be enabled in a future major version\.
+.IP "\(bu" 4
 \fBssl_ca_cert\fR (\fBBUNDLE_SSL_CA_CERT\fR): Path to a designated CA certificate file or folder containing multiple certificates for trusted CAs in PEM format\.
 .IP "\(bu" 4
 \fBssl_client_cert\fR (\fBBUNDLE_SSL_CLIENT_CERT\fR): Path to a designated file containing a X\.509 client certificate and key in PEM format\.
@@ -193,16 +185,32 @@ The following is a list of all configuration keys and their purpose\. You can le
 .IP "\(bu" 4
 \fBuser_agent\fR (\fBBUNDLE_USER_AGENT\fR): The custom user agent fragment Bundler includes in API requests\.
 .IP "\(bu" 4
+\fBverbose\fR (\fBBUNDLE_VERBOSE\fR): Whether Bundler should print verbose output\. Defaults to \fBfalse\fR, unless the \fB\-\-verbose\fR CLI flag is used\.
+.IP "\(bu" 4
 \fBversion\fR (\fBBUNDLE_VERSION\fR): The version of Bundler to use when running under Bundler environment\. Defaults to \fBlockfile\fR\. You can also specify \fBsystem\fR or \fBx\.y\.z\fR\. \fBlockfile\fR will use the Bundler version specified in the \fBGemfile\.lock\fR, \fBsystem\fR will use the system version of Bundler, and \fBx\.y\.z\fR will use the specified version of Bundler\.
 .IP "\(bu" 4
-\fBwith\fR (\fBBUNDLE_WITH\fR): A \fB:\fR\-separated list of groups whose gems bundler should install\.
+\fBwith\fR (\fBBUNDLE_WITH\fR): A space\-separated or \fB:\fR\-separated list of groups whose gems bundler should install\.
 .IP "\(bu" 4
-\fBwithout\fR (\fBBUNDLE_WITHOUT\fR): A \fB:\fR\-separated list of groups whose gems bundler should not install\.
+\fBwithout\fR (\fBBUNDLE_WITHOUT\fR): A space\-separated or \fB:\fR\-separated list of groups whose gems bundler should not install\.
 .IP "" 0
+.SH "BUILD OPTIONS"
+You can use \fBbundle config\fR to give Bundler the flags to pass to the gem installer every time bundler tries to install a particular gem\.
 .P
-In general, you should set these settings per\-application by using the applicable flag to the bundle install(1) \fIbundle\-install\.1\.html\fR or bundle cache(1) \fIbundle\-cache\.1\.html\fR command\.
+A very common example, the \fBmysql\fR gem, requires Snow Leopard users to pass configuration flags to \fBgem install\fR to specify where to find the \fBmysql_config\fR executable\.
+.IP "" 4
+.nf
+gem install mysql \-\- \-\-with\-mysql\-config=/usr/local/mysql/bin/mysql_config
+.fi
+.IP "" 0
 .P
-You can set them globally either via environment variables or \fBbundle config\fR, whichever is preferable for your setup\. If you use both, environment variables will take preference over global settings\.
+Since the specific location of that executable can change from machine to machine, you can specify these flags on a per\-machine basis\.
+.IP "" 4
+.nf
+bundle config set \-\-global build\.mysql \-\-with\-mysql\-config=/usr/local/mysql/bin/mysql_config
+.fi
+.IP "" 0
+.P
+After running this command, every time bundler needs to install the \fBmysql\fR gem, it will pass along the flags you specified\.
 .SH "LOCAL GIT REPOS"
 Bundler also allows you to work against a git repository locally instead of using the remote version\. This can be achieved by setting up a local override:
 .IP "" 4
@@ -211,7 +219,16 @@ bundle config set \-\-local local\.GEM_NAME /path/to/local/git/repository
 .fi
 .IP "" 0
 .P
-For example, in order to use a local Rack repository, a developer could call:
+Important: This feature only works for gems that are specified with a git source in your Gemfile\. It does not work for gems installed from RubyGems or other sources\. The gem must be defined with \fBgit:\fR option pointing to a remote repository\.
+.P
+For example, if your Gemfile contains:
+.IP "" 4
+.nf
+gem "rack", git: "https://github\.com/rack/rack\.git", branch: "main"
+.fi
+.IP "" 0
+.P
+Then you can use a local Rack repository by running:
 .IP "" 4
 .nf
 bundle config set \-\-local local\.rack ~/Work/git/rack
@@ -223,6 +240,13 @@ Now instead of checking out the remote git repository, the local override will b
 Bundler does many checks to ensure a developer won't work with invalid references\. Particularly, we force a developer to specify a branch in the \fBGemfile\fR in order to use this feature\. If the branch specified in the \fBGemfile\fR and the current branch in the local git repository do not match, Bundler will abort\. This ensures that a developer is always working against the correct branches, and prevents accidental locking to a different branch\.
 .P
 Finally, Bundler also ensures that the current revision in the \fBGemfile\.lock\fR exists in the local git repository\. By doing this, Bundler forces you to fetch the latest changes in the remotes\.
+.P
+If you need to temporarily use a local version of a gem that is normally installed from RubyGems (not from git), use a path source instead:
+.IP "" 4
+.nf
+gem "rack", path: "~/Work/git/rack"
+.fi
+.IP "" 0
 .SH "MIRRORS OF GEM SOURCES"
 Bundler supports overriding gem sources with mirrors\. This allows you to configure rubygems\.org as the gem source in your Gemfile while still using your mirror to fetch gems\.
 .IP "" 4
@@ -278,7 +302,7 @@ export BUNDLE_GEMS__LONGEROUS__COM="claudette:s00pers3krit"
 For gems with a git source with HTTP(S) URL you can specify credentials like so:
 .IP "" 4
 .nf
-bundle config set \-\-global https://github\.com/rubygems/rubygems\.git username:password
+bundle config set \-\-global https://github\.com/ruby/rubygems\.git username:password
 .fi
 .IP "" 0
 .P
diff --git a/lib/bundler/man/bundle-config.1.ronn b/lib/bundler/man/bundle-config.1.ronn
index 1a0ec2a5dc..72f891b428 100644
--- a/lib/bundler/man/bundle-config.1.ronn
+++ b/lib/bundler/man/bundle-config.1.ronn
@@ -3,10 +3,10 @@ bundle-config(1) -- Set bundler configuration options
 
 ## SYNOPSIS
 
-`bundle config` list<br>
-`bundle config` [get] NAME<br>
-`bundle config` [set] NAME VALUE<br>
-`bundle config` unset NAME
+`bundle config` [list]<br>
+`bundle config` [get [--local|--global]] NAME<br>
+`bundle config` [set [--local|--global]] NAME VALUE<br>
+`bundle config` unset [--local|--global] NAME
 
 ## DESCRIPTION
 
@@ -19,98 +19,67 @@ Bundler loads configuration settings in this order:
 3. Global config (`~/.bundle/config`)
 4. Bundler default config
 
-Executing `bundle config list` will print a list of all bundler
-configuration for the current bundle, and where that configuration
-was set.
-
-Executing `bundle config get <name>` will print the value of that configuration
-setting, and where it was set.
-
-Executing `bundle config set <name> <value>` defaults to setting `local`
-configuration if executing from within a local application, otherwise it will
-set `global` configuration. See `--local` and `--global` options below.
-
-Executing `bundle config set --local <name> <value>` will set that configuration
-in the directory for the local application. The configuration will be stored in
-`<project_root>/.bundle/config`. If `BUNDLE_APP_CONFIG` is set, the configuration
-will be stored in `$BUNDLE_APP_CONFIG/config`.
-
-Executing `bundle config set --global <name> <value>` will set that
-configuration to the value specified for all bundles executed as the current
-user. The configuration will be stored in `~/.bundle/config`. If <name> already
-is set, <name> will be overridden and user will be warned.
-
-Executing `bundle config unset <name>` will delete the configuration in both
-local and global sources.
-
-Executing `bundle config unset --global <name>` will delete the configuration
-only from the user configuration.
-
-Executing `bundle config unset --local <name>` will delete the configuration
-only from the local application.
-
-Executing bundle with the `BUNDLE_IGNORE_CONFIG` environment variable set will
+Executing `bundle` with the `BUNDLE_IGNORE_CONFIG` environment variable set will
 cause it to ignore all configuration.
 
-## REMEMBERING OPTIONS
+## SUB-COMMANDS
 
-Flags passed to `bundle install` or the Bundler runtime, such as `--path foo` or
-`--without production`, are remembered between commands and saved to your local
-application's configuration (normally, `./.bundle/config`).
+### list (default command)
 
-However, this will be changed in bundler 3, so it's better not to rely on this
-behavior. If these options must be remembered, it's better to set them using
-`bundle config` (e.g., `bundle config set --local path foo`).
+Executing `bundle config list` will print a list of all bundler
+configuration for the current bundle, and where that configuration
+was set.
 
-The options that can be configured are:
+### get
 
-* `bin`:
-   Creates a directory (defaults to `~/bin`) and place any executables from the
-   gem there. These executables run in Bundler's context. If used, you might add
-   this directory to your environment's `PATH` variable. For instance, if the
-   `rails` gem comes with a `rails` executable, this flag will create a
-   `bin/rails` executable that ensures that all referred dependencies will be
-   resolved using the bundled gems.
+Executing `bundle config get <name>` will print the value of that configuration
+setting, and all locations where it was set.
 
-* `deployment`:
-   In deployment mode, Bundler will 'roll-out' the bundle for
-   `production` use. Please check carefully if you want to have this option
-   enabled in `development` or `test` environments.
+**OPTIONS**
 
-* `only`:
-   A space-separated list of groups to install only gems of the specified groups.
+* `--local`:
+  Get configuration from configuration file for the local application, namely,
+  `<project_root>/.bundle/config`, or `$BUNDLE_APP_CONFIG/config` if
+  `BUNDLE_APP_CONFIG` is set.
 
-* `path`:
-   The location to install the specified gems to. This defaults to Rubygems'
-   setting. Bundler shares this location with Rubygems, `gem install ...` will
-   have gem installed there, too. Therefore, gems installed without a
-   `--path ...` setting will show up by calling `gem list`. Accordingly, gems
-   installed to other locations will not get listed.
+* `--global`:
+  Get configuration from configuration file global to all bundles executed as
+  the current user, namely, from `~/.bundle/config`.
 
-* `without`:
-   A space-separated list of groups referencing gems to skip during installation.
+### set
 
-* `with`:
-  A space-separated list of **optional** groups referencing gems to include during installation.
+Executing `bundle config set <name> <value>` defaults to setting `local`
+configuration if executing from within a local application, otherwise it will
+set `global` configuration.
 
-## BUILD OPTIONS
+**OPTIONS**
 
-You can use `bundle config` to give Bundler the flags to pass to the gem
-installer every time bundler tries to install a particular gem.
+* `--local`:
+  Executing `bundle config set --local <name> <value>` will set that configuration
+  in the directory for the local application. The configuration will be stored in
+  `<project_root>/.bundle/config`. If `BUNDLE_APP_CONFIG` is set, the configuration
+  will be stored in `$BUNDLE_APP_CONFIG/config`.
 
-A very common example, the `mysql` gem, requires Snow Leopard users to
-pass configuration flags to `gem install` to specify where to find the
-`mysql_config` executable.
+* `--global`:
+  Executing `bundle config set --global <name> <value>` will set that
+  configuration to the value specified for all bundles executed as the current
+  user. The configuration will be stored in `~/.bundle/config`. If <name> already
+  is set, <name> will be overridden and user will be warned.
 
-    gem install mysql -- --with-mysql-config=/usr/local/mysql/bin/mysql_config
+### unset
 
-Since the specific location of that executable can change from machine
-to machine, you can specify these flags on a per-machine basis.
+Executing `bundle config unset <name>` will delete the configuration in both
+local and global sources.
 
-    bundle config set --global build.mysql --with-mysql-config=/usr/local/mysql/bin/mysql_config
+**OPTIONS**
 
-After running this command, every time bundler needs to install the
-`mysql` gem, it will pass along the flags you specified.
+* `--local`:
+  Executing `bundle config unset --local <name>` will delete the configuration
+  only from the local application.
+
+* `--global`:
+  Executing `bundle config unset --global <name>` will delete the configuration
+  only from the user configuration.
 
 ## CONFIGURATION KEYS
 
@@ -137,19 +106,25 @@ the environment variable `BUNDLE_LOCAL__RACK`.
 The following is a list of all configuration keys and their purpose. You can
 learn more about their operation in [bundle install(1)](bundle-install.1.html).
 
-* `allow_offline_install` (`BUNDLE_ALLOW_OFFLINE_INSTALL`):
-   Allow Bundler to use cached data when installing without network access.
-* `auto_clean_without_path` (`BUNDLE_AUTO_CLEAN_WITHOUT_PATH`):
-   Automatically run `bundle clean` after installing when an explicit `path`
-   has not been set and Bundler is not installing into the system gems.
+* `api_request_size` (`BUNDLE_API_REQUEST_SIZE`):
+   Configure how many dependencies to fetch when resolving the specifications.
+   This configuration is only used when fetching specifications from RubyGems
+   servers that didn't implement the Compact Index API.
+   Defaults to 100.
 * `auto_install` (`BUNDLE_AUTO_INSTALL`):
    Automatically run `bundle install` when gems are missing.
 * `bin` (`BUNDLE_BIN`):
-   Install executables from gems in the bundle to the specified directory.
-   Defaults to `false`.
+   If configured, `bundle binstubs` will install executables from gems in the
+   bundle to the specified directory. Otherwise it will create them in a `bin`
+   directory relative to the Gemfile directory. These executables run in
+   Bundler's context. If used, you might add this directory to your
+   environment's `PATH` variable. For instance, if the `rails` gem comes with a
+   `rails` executable, `bundle binstubs` will create a `bin/rails` executable
+   that ensures that all referred dependencies will be resolved using the
+   bundled gems.
 * `cache_all` (`BUNDLE_CACHE_ALL`):
    Cache all gems, including path and git gems. This needs to be explicitly
-   configured on bundler 1 and bundler 2, but will be the default on bundler 3.
+   before bundler 4, but will be the default on bundler 4.
 * `cache_all_platforms` (`BUNDLE_CACHE_ALL_PLATFORMS`):
    Cache gems for all platforms.
 * `cache_path` (`BUNDLE_CACHE_PATH`):
@@ -158,15 +133,46 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    Defaults to `vendor/cache`.
 * `clean` (`BUNDLE_CLEAN`):
    Whether Bundler should run `bundle clean` automatically after
-   `bundle install`.
+   `bundle install`. Defaults to `true` in Bundler 4, as long as `path` is not
+   explicitly configured.
 * `console` (`BUNDLE_CONSOLE`):
    The console that `bundle console` starts. Defaults to `irb`.
-* `default_install_uses_path` (`BUNDLE_DEFAULT_INSTALL_USES_PATH`):
-   Whether a `bundle install` without an explicit `--path` argument defaults
-   to installing gems in `.bundle`.
+* `cooldown` (`BUNDLE_COOLDOWN`):
+   Number of days a published gem version must age before bundler will
+   resolve to it. Defaults to unset (no cooldown). Pass `0` to disable
+   cooldown for an individual run.
+
+   The effective cooldown for any given gem is resolved from three
+   layers, highest precedence first:
+
+     1. CLI flag `--cooldown N` on `install`, `update`, `add`, and
+        `outdated`.
+     2. This setting (`bundle config set cooldown N` or
+        `BUNDLE_COOLDOWN=N`).
+     3. The per-source `cooldown:` keyword in the Gemfile, such as
+        `source "https://rubygems.org", cooldown: 7`.
+
+   The CLI flag and this setting apply uniformly to every source,
+   including ones declared with their own `cooldown:` value. To keep a
+   private registry permanently exempt while still cooling down public
+   gems, declare `source "https://internal", cooldown: 0` in the
+   Gemfile; remember that `--cooldown N` on the command line will
+   still override it for that single run.
+
+   Cooldown filtering depends on the gem server providing a per-version
+   `created_at` timestamp in the v2 compact-index format. Versions
+   without that metadata - older gem servers, historical entries that
+   predate the v2 cutover on `rubygems.org`, or private registries that
+   still emit the v1 format - are treated as outside the cooldown
+   window and remain resolvable. If you rely on cooldown for
+   supply-chain protection, confirm that the gem server emits
+   `created_at` in its `/info/<gem>` responses.
+* `default_cli_command` (`BUNDLE_DEFAULT_CLI_COMMAND`):
+   The command that running `bundle` without arguments should run. Defaults to
+   `cli_help` since Bundler 4, but can also be `install` which was the previous
+   default.
 * `deployment` (`BUNDLE_DEPLOYMENT`):
-   Disallow changes to the `Gemfile`. When the `Gemfile` is changed and the
-   lockfile has not been updated, running Bundler commands will be blocked.
+   Equivalent to setting `frozen` to `true` and `path` to `vendor/bundle`.
 * `disable_checksum_validation` (`BUNDLE_DISABLE_CHECKSUM_VALIDATION`):
    Allow installing gems even if they do not match the checksum provided by
    RubyGems.
@@ -188,12 +194,13 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    Ignore the current machine's platform and install only `ruby` platform gems.
    As a result, gems with native extensions will be compiled from source.
 * `frozen` (`BUNDLE_FROZEN`):
-   Disallow changes to the `Gemfile`. When the `Gemfile` is changed and the
-   lockfile has not been updated, running Bundler commands will be blocked.
-   Defaults to `true` when `--deployment` is used.
+   Disallow any automatic changes to `Gemfile.lock`. Bundler commands will
+   be blocked unless the lockfile can be installed exactly as written.
+   Usually this will happen when changing the `Gemfile` manually and forgetting
+   to update the lockfile through `bundle lock` or `bundle install`.
 * `gem.github_username` (`BUNDLE_GEM__GITHUB_USERNAME`):
-   Sets a GitHub username or organization to be used in `README` file when you
-   create a new gem via `bundle gem` command. It can be overridden by passing an
+   Sets a GitHub username or organization to be used in the `README` and `.gemspec` files
+   when you create a new gem via `bundle gem` command. It can be overridden by passing an
    explicit `--github-username` flag to `bundle gem`.
 * `gem.push_key` (`BUNDLE_GEM__PUSH_KEY`):
    Sets the `--key` parameter for `gem push` when using the `rake release`
@@ -205,8 +212,8 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    will search up from the current working directory until it finds a
    `Gemfile`.
 * `global_gem_cache` (`BUNDLE_GLOBAL_GEM_CACHE`):
-   Whether Bundler should cache all gems globally, rather than locally to the
-   installing Ruby installation.
+   Whether Bundler should cache all gems and compiled extensions globally,
+   rather than locally to the configured installation path.
 * `ignore_funding_requests` (`BUNDLE_IGNORE_FUNDING_REQUESTS`):
    When set, no funding requests will be printed.
 * `ignore_messages` (`BUNDLE_IGNORE_MESSAGES`):
@@ -215,36 +222,51 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
 * `init_gems_rb` (`BUNDLE_INIT_GEMS_RB`):
    Generate a `gems.rb` instead of a `Gemfile` when running `bundle init`.
 * `jobs` (`BUNDLE_JOBS`):
-   The number of gems Bundler can install in parallel. Defaults to the number of
-   available processors.
+   The number of gems Bundler can download and install in parallel.
+   Defaults to the number of available processors.
+* `lockfile` (`BUNDLE_LOCKFILE`):
+   The path to the lockfile that bundler should use. By default, Bundler adds
+   `.lock` to the end of the `gemfile` entry. Can be set to `false` in the
+   Gemfile to disable lockfile creation entirely (see gemfile(5)).
+* `lockfile_checksums` (`BUNDLE_LOCKFILE_CHECKSUMS`):
+   Whether Bundler should include a checksums section in new lockfiles, to protect from compromised gem sources. Defaults to true.
+* `no_build_extension` (`BUNDLE_NO_BUILD_EXTENSION`):
+   Whether Bundler should skip building native extensions during installation.
+   When set, gems are installed without compiling their C extensions.
+   To build extensions later, unset this setting and run `bundle pristine <gem>`.
 * `no_install` (`BUNDLE_NO_INSTALL`):
    Whether `bundle package` should skip installing gems.
+* `no_install_plugin` (`BUNDLE_NO_INSTALL_PLUGIN`):
+   Whether Bundler should skip installing RubyGems plugins during installation.
+   When set, plugin files are not written to the plugins directory.
+   To install plugins later, unset this setting and run `bundle pristine <gem>`.
 * `no_prune` (`BUNDLE_NO_PRUNE`):
    Whether Bundler should leave outdated gems unpruned when caching.
 * `only` (`BUNDLE_ONLY`):
    A space-separated list of groups to install only gems of the specified groups.
+   Please check carefully if you want to install also gems without a group, because
+   they get put inside `default` group. For example `only test:default` will install
+   all gems specified in test group and without one.
 * `path` (`BUNDLE_PATH`):
    The location on disk where all gems in your bundle will be located regardless
    of `$GEM_HOME` or `$GEM_PATH` values. Bundle gems not found in this location
-   will be installed by `bundle install`. Defaults to `Gem.dir`. When --deployment
-   is used, defaults to vendor/bundle.
+   will be installed by `bundle install`. When not set, Bundler install by
+   default to a `.bundle` directory relative to repository root in Bundler 4,
+   and to the default system path (`Gem.dir`) before Bundler 4. That means that
+   before Bundler 4, Bundler shares this location with Rubygems, and `gem
+   install ...` will have gems installed in the same location and therefore,
+   gems installed without `path` set will show up by calling `gem list`. This
+   will not be the case in Bundler 4.
 * `path.system` (`BUNDLE_PATH__SYSTEM`):
    Whether Bundler will install gems into the default system path (`Gem.dir`).
-* `path_relative_to_cwd` (`BUNDLE_PATH_RELATIVE_TO_CWD`)
-   Makes `--path` relative to the CWD instead of the `Gemfile`.
 * `plugins` (`BUNDLE_PLUGINS`):
    Enable Bundler's experimental plugin system.
-* `prefer_patch` (BUNDLE_PREFER_PATCH):
+* `prefer_patch` (`BUNDLE_PREFER_PATCH`):
    Prefer updating only to next patch version during updates. Makes `bundle update` calls equivalent to `bundler update --patch`.
-* `print_only_version_number` (`BUNDLE_PRINT_ONLY_VERSION_NUMBER`):
-   Print only version number from `bundler --version`.
 * `redirect` (`BUNDLE_REDIRECT`):
    The number of redirects allowed for network requests. Defaults to `5`.
 * `retry` (`BUNDLE_RETRY`):
    The number of times to retry failed network requests. Defaults to `3`.
-* `setup_makes_kernel_gem_public` (`BUNDLE_SETUP_MAKES_KERNEL_GEM_PUBLIC`):
-   Have `Bundler.setup` make the `Kernel#gem` method public, even though
-   RubyGems declares it as private.
 * `shebang` (`BUNDLE_SHEBANG`):
    The program name that should be invoked for generated binstubs. Defaults to
    the ruby install name used to generate the binstub.
@@ -253,6 +275,10 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    be changed in the next major version.
 * `silence_root_warning` (`BUNDLE_SILENCE_ROOT_WARNING`):
    Silence the warning Bundler prints when installing gems as root.
+* `simulate_version` (`BUNDLE_SIMULATE_VERSION`):
+   The virtual version Bundler should use for activating feature flags. Can be
+   used to simulate all the new functionality that will be enabled in a future
+   major version.
 * `ssl_ca_cert` (`BUNDLE_SSL_CA_CERT`):
    Path to a designated CA certificate file or folder containing multiple
    certificates for trusted CAs in PEM format.
@@ -271,6 +297,9 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    and disallow passing no options to `bundle update`.
 * `user_agent` (`BUNDLE_USER_AGENT`):
    The custom user agent fragment Bundler includes in API requests.
+* `verbose` (`BUNDLE_VERBOSE`):
+   Whether Bundler should print verbose output. Defaults to `false`, unless the
+   `--verbose` CLI flag is used.
 * `version` (`BUNDLE_VERSION`):
    The version of Bundler to use when running under Bundler environment.
    Defaults to `lockfile`. You can also specify `system` or `x.y.z`.
@@ -278,16 +307,28 @@ learn more about their operation in [bundle install(1)](bundle-install.1.html).
    `system` will use the system version of Bundler, and `x.y.z` will use
    the specified version of Bundler.
 * `with` (`BUNDLE_WITH`):
-   A `:`-separated list of groups whose gems bundler should install.
+   A space-separated or `:`-separated list of groups whose gems bundler should install.
 * `without` (`BUNDLE_WITHOUT`):
-   A `:`-separated list of groups whose gems bundler should not install.
+   A space-separated or `:`-separated list of groups whose gems bundler should not install.
+
+## BUILD OPTIONS
+
+You can use `bundle config` to give Bundler the flags to pass to the gem
+installer every time bundler tries to install a particular gem.
+
+A very common example, the `mysql` gem, requires Snow Leopard users to
+pass configuration flags to `gem install` to specify where to find the
+`mysql_config` executable.
+
+    gem install mysql -- --with-mysql-config=/usr/local/mysql/bin/mysql_config
 
-In general, you should set these settings per-application by using the applicable
-flag to the [bundle install(1)](bundle-install.1.html) or [bundle cache(1)](bundle-cache.1.html) command.
+Since the specific location of that executable can change from machine
+to machine, you can specify these flags on a per-machine basis.
 
-You can set them globally either via environment variables or `bundle config`,
-whichever is preferable for your setup. If you use both, environment variables
-will take preference over global settings.
+    bundle config set --global build.mysql --with-mysql-config=/usr/local/mysql/bin/mysql_config
+
+After running this command, every time bundler needs to install the
+`mysql` gem, it will pass along the flags you specified.
 
 ## LOCAL GIT REPOS
 
@@ -297,7 +338,16 @@ up a local override:
 
     bundle config set --local local.GEM_NAME /path/to/local/git/repository
 
-For example, in order to use a local Rack repository, a developer could call:
+Important: This feature only works for gems that are specified with a git
+source in your Gemfile. It does not work for gems installed from RubyGems
+or other sources. The gem must be defined with `git:` option pointing to a
+remote repository.
+
+For example, if your Gemfile contains:
+
+    gem "rack", git: "https://github.com/rack/rack.git", branch: "main"
+
+Then you can use a local Rack repository by running:
 
     bundle config set --local local.rack ~/Work/git/rack
 
@@ -323,6 +373,11 @@ Finally, Bundler also ensures that the current revision in the
 `Gemfile.lock` exists in the local git repository. By doing this, Bundler
 forces you to fetch the latest changes in the remotes.
 
+If you need to temporarily use a local version of a gem that is normally
+installed from RubyGems (not from git), use a path source instead:
+
+    gem "rack", path: "~/Work/git/rack"
+
 ## MIRRORS OF GEM SOURCES
 
 Bundler supports overriding gem sources with mirrors. This allows you to
@@ -366,7 +421,7 @@ Or you can set the credentials as an environment variable like this:
 
 For gems with a git source with HTTP(S) URL you can specify credentials like so:
 
-    bundle config set --global https://github.com/rubygems/rubygems.git username:password
+    bundle config set --global https://github.com/ruby/rubygems.git username:password
 
 Or you can set the credentials as an environment variable like so:
 
diff --git a/lib/bundler/man/bundle-console.1 b/lib/bundler/man/bundle-console.1
index dca18ec43d..5d3f65365f 100644
--- a/lib/bundler/man/bundle-console.1
+++ b/lib/bundler/man/bundle-console.1
@@ -1,8 +1,8 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-CONSOLE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-CONSOLE" "1" "May 2026" ""
 .SH "NAME"
-\fBbundle\-console\fR \- Deprecated way to open an IRB session with the bundle pre\-loaded
+\fBbundle\-console\fR \- Open an IRB session with the bundle pre\-loaded
 .SH "SYNOPSIS"
 \fBbundle console\fR [GROUP]
 .SH "DESCRIPTION"
@@ -29,7 +29,5 @@ $ bundle console
 Resolving dependencies\|\.\|\.\|\.
 [1] pry(main)>
 .fi
-.SH "NOTES"
-This command was deprecated in Bundler 2\.1 and will be removed in 3\.0\. Use \fBbin/console\fR script, which can be generated by \fBbundle gem <NAME>\fR\.
 .SH "SEE ALSO"
 Gemfile(5) \fIhttps://bundler\.io/man/gemfile\.5\.html\fR
diff --git a/lib/bundler/man/bundle-console.1.ronn b/lib/bundler/man/bundle-console.1.ronn
index f9096d386a..ed842ae1c3 100644
--- a/lib/bundler/man/bundle-console.1.ronn
+++ b/lib/bundler/man/bundle-console.1.ronn
@@ -1,5 +1,5 @@
-bundle-console(1) -- Deprecated way to open an IRB session with the bundle pre-loaded
-=====================================================================================
+bundle-console(1) -- Open an IRB session with the bundle pre-loaded
+===================================================================
 
 ## SYNOPSIS
 
@@ -34,11 +34,6 @@ the shell from the following:
     Resolving dependencies...
     [1] pry(main)>
 
-## NOTES
-
-This command was deprecated in Bundler 2.1 and will be removed in 3.0.
-Use `bin/console` script, which can be generated by `bundle gem <NAME>`.
-
 ## SEE ALSO
 
 [Gemfile(5)](https://bundler.io/man/gemfile.5.html)
diff --git a/lib/bundler/man/bundle-doctor.1 b/lib/bundler/man/bundle-doctor.1
index 6489cc07f7..4c59871b66 100644
--- a/lib/bundler/man/bundle-doctor.1
+++ b/lib/bundler/man/bundle-doctor.1
@@ -1,14 +1,21 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-DOCTOR" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-DOCTOR" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-doctor\fR \- Checks the bundle for common problems
 .SH "SYNOPSIS"
-\fBbundle doctor\fR [\-\-quiet] [\-\-gemfile=GEMFILE]
+\fBbundle doctor [diagnose]\fR [\-\-quiet] [\-\-gemfile=GEMFILE] [\-\-ssl]
+.br
+\fBbundle doctor ssl\fR [\-\-host=HOST] [\-\-tls\-version=TLS\-VERSION] [\-\-verify\-mode=VERIFY\-MODE]
+.br
+\fBbundle doctor\fR help [COMMAND]
 .SH "DESCRIPTION"
+You can diagnose common Bundler problems with this command such as checking gem environment or SSL/TLS issue\.
+.SH "SUB\-COMMANDS"
+.SS "diagnose (default command)"
 Checks your Gemfile and gem environment for common problems\. If issues are detected, Bundler prints them and exits status 1\. Otherwise, Bundler prints a success message and exits status 0\.
 .P
-Examples of common problems caught by bundle\-doctor include:
+Examples of common problems caught include:
 .IP "\(bu" 4
 Invalid Bundler settings
 .IP "\(bu" 4
@@ -20,11 +27,43 @@ Uninstalled gems
 .IP "\(bu" 4
 Missing dependencies
 .IP "" 0
-.SH "OPTIONS"
+.P
+\fBOPTIONS\fR
 .TP
 \fB\-\-quiet\fR
 Only output warnings and errors\.
 .TP
-\fB\-\-gemfile=<gemfile>\fR
+\fB\-\-gemfile=GEMFILE\fR
 The location of the Gemfile(5) which Bundler should use\. This defaults to a Gemfile(5) in the current working directory\. In general, Bundler will assume that the location of the Gemfile(5) is also the project's root and will try to find \fBGemfile\.lock\fR and \fBvendor/cache\fR relative to this location\.
+.TP
+\fB\-\-ssl\fR
+Diagnose common SSL problems when connecting to https://rubygems\.org\.
+.IP
+This flag runs the \fBbundle doctor ssl\fR subcommand with default values underneath\.
+.SS "ssl"
+If you've experienced issues related to SSL certificates and/or TLS versions while connecting to https://rubygems\.org, this command can help troubleshoot common problems\. The diagnostic will perform a few checks such as:
+.IP "\(bu" 4
+Verify the Ruby OpenSSL version installed on your system\.
+.IP "\(bu" 4
+Check the OpenSSL library version used for compilation\.
+.IP "\(bu" 4
+Ensure CA certificates are correctly setup on your machine\.
+.IP "\(bu" 4
+Open a TLS connection and verify the outcome\.
+.IP "" 0
+.P
+\fBOPTIONS\fR
+.TP
+\fB\-\-host=HOST\fR
+Perform the diagnostic on HOST\. Defaults to \fBrubygems\.org\fR\.
+.TP
+\fB\-\-tls\-version=TLS\-VERSION\fR
+Specify the TLS version when opening the connection to HOST\.
+.IP
+Accepted values are: \fB1\.1\fR or \fB1\.2\fR\.
+.TP
+\fB\-\-verify\-mode=VERIFY\-MODE\fR
+Specify the TLS verify mode when opening the connection to HOST\. Defaults to \fBSSL_VERIFY_PEER\fR\.
+.IP
+Accepted values are: \fBCLIENT_ONCE\fR, \fBFAIL_IF_NO_PEER_CERT\fR, \fBNONE\fR, \fBPEER\fR\.
 
diff --git a/lib/bundler/man/bundle-doctor.1.ronn b/lib/bundler/man/bundle-doctor.1.ronn
index 271ee800ad..7495099ff5 100644
--- a/lib/bundler/man/bundle-doctor.1.ronn
+++ b/lib/bundler/man/bundle-doctor.1.ronn
@@ -3,16 +3,27 @@ bundle-doctor(1) -- Checks the bundle for common problems
 
 ## SYNOPSIS
 
-`bundle doctor` [--quiet]
-                [--gemfile=GEMFILE]
+`bundle doctor [diagnose]` [--quiet]
+                           [--gemfile=GEMFILE]
+                           [--ssl]<br>
+`bundle doctor ssl` [--host=HOST]
+                    [--tls-version=TLS-VERSION]
+                    [--verify-mode=VERIFY-MODE]<br>
+`bundle doctor` help [COMMAND]
 
 ## DESCRIPTION
 
+You can diagnose common Bundler problems with this command such as checking gem environment or SSL/TLS issue.
+
+## SUB-COMMANDS
+
+### diagnose (default command)
+
 Checks your Gemfile and gem environment for common problems. If issues
 are detected, Bundler prints them and exits status 1. Otherwise,
 Bundler prints a success message and exits status 0.
 
-Examples of common problems caught by bundle-doctor include:
+Examples of common problems caught include:
 
 * Invalid Bundler settings
 * Mismatched Ruby versions
@@ -20,14 +31,47 @@ Examples of common problems caught by bundle-doctor include:
 * Uninstalled gems
 * Missing dependencies
 
-## OPTIONS
+**OPTIONS**
 
 * `--quiet`:
   Only output warnings and errors.
 
-* `--gemfile=<gemfile>`:
+* `--gemfile=GEMFILE`:
   The location of the Gemfile(5) which Bundler should use. This defaults
   to a Gemfile(5) in the current working directory. In general, Bundler
   will assume that the location of the Gemfile(5) is also the project's
   root and will try to find `Gemfile.lock` and `vendor/cache` relative
   to this location.
+
+* `--ssl`:
+  Diagnose common SSL problems when connecting to https://rubygems.org.
+
+  This flag runs the `bundle doctor ssl` subcommand with default values
+  underneath.
+
+### ssl
+
+If you've experienced issues related to SSL certificates and/or TLS versions while connecting
+to https://rubygems.org, this command can help troubleshoot common problems.
+The diagnostic will perform a few checks such as:
+
+* Verify the Ruby OpenSSL version installed on your system.
+* Check the OpenSSL library version used for compilation.
+* Ensure CA certificates are correctly setup on your machine.
+* Open a TLS connection and verify the outcome.
+
+**OPTIONS**
+
+* `--host=HOST`:
+  Perform the diagnostic on HOST. Defaults to `rubygems.org`.
+
+* `--tls-version=TLS-VERSION`:
+  Specify the TLS version when opening the connection to HOST.
+
+  Accepted values are: `1.1` or `1.2`.
+
+* `--verify-mode=VERIFY-MODE`:
+  Specify the TLS verify mode when opening the connection to HOST.
+  Defaults to `SSL_VERIFY_PEER`.
+
+  Accepted values are: `CLIENT_ONCE`, `FAIL_IF_NO_PEER_CERT`, `NONE`, `PEER`.
diff --git a/lib/bundler/man/bundle-env.1 b/lib/bundler/man/bundle-env.1
new file mode 100644
index 0000000000..25fcb64891
--- /dev/null
+++ b/lib/bundler/man/bundle-env.1
@@ -0,0 +1,9 @@
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-ENV" "1" "May 2026" ""
+.SH "NAME"
+\fBbundle\-env\fR \- Print information about the environment Bundler is running under
+.SH "SYNOPSIS"
+\fBbundle env\fR
+.SH "DESCRIPTION"
+Prints information about the environment Bundler is running under\.
diff --git a/lib/bundler/man/bundle-env.1.ronn b/lib/bundler/man/bundle-env.1.ronn
new file mode 100644
index 0000000000..c2df9c29c2
--- /dev/null
+++ b/lib/bundler/man/bundle-env.1.ronn
@@ -0,0 +1,10 @@
+bundle-env(1) -- Print information about the environment Bundler is running under
+=================================================================================
+
+## SYNOPSIS
+
+`bundle env`
+
+## DESCRIPTION
+
+Prints information about the environment Bundler is running under.
diff --git a/lib/bundler/man/bundle-exec.1 b/lib/bundler/man/bundle-exec.1
index 1548d29670..c3a6a09d57 100644
--- a/lib/bundler/man/bundle-exec.1
+++ b/lib/bundler/man/bundle-exec.1
@@ -1,10 +1,10 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-EXEC" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-EXEC" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-exec\fR \- Execute a command in the context of the bundle
 .SH "SYNOPSIS"
-\fBbundle exec\fR [\-\-keep\-file\-descriptors] \fIcommand\fR
+\fBbundle exec\fR [\-\-gemfile=GEMFILE] \fIcommand\fR
 .SH "DESCRIPTION"
 This command executes the command, making all gems specified in the [\fBGemfile(5)\fR][Gemfile(5)] available to \fBrequire\fR in Ruby programs\.
 .P
@@ -13,8 +13,8 @@ Essentially, if you would normally have run something like \fBrspec spec/my_spec
 Note that \fBbundle exec\fR does not require that an executable is available on your shell's \fB$PATH\fR\.
 .SH "OPTIONS"
 .TP
-\fB\-\-keep\-file\-descriptors\fR
-Passes all file descriptors to the new processes\. Default is true from bundler version 2\.2\.26\. Setting it to false is now deprecated\.
+\fB\-\-gemfile=GEMFILE\fR
+Use the specified gemfile instead of [\fBGemfile(5)\fR][Gemfile(5)]\.
 .SH "BUNDLE INSTALL \-\-BINSTUBS"
 If you use the \fB\-\-binstubs\fR flag in bundle install(1) \fIbundle\-install\.1\.html\fR, Bundler will automatically create a directory (which defaults to \fBapp_root/bin\fR) containing all of the executables available from gems in the bundle\.
 .P
@@ -71,8 +71,8 @@ end
 Bundler provides convenience helpers that wrap \fBsystem\fR and \fBexec\fR, and they can be used like this:
 .IP "" 4
 .nf
-Bundler\.clean_system('brew install wget')
-Bundler\.clean_exec('brew install wget')
+Bundler\.unbundled_system('brew install wget')
+Bundler\.unbundled_exec('brew install wget')
 .fi
 .IP "" 0
 .SH "RUBYGEMS PLUGINS"
diff --git a/lib/bundler/man/bundle-exec.1.ronn b/lib/bundler/man/bundle-exec.1.ronn
index 9d5b559f26..e51a66a084 100644
--- a/lib/bundler/man/bundle-exec.1.ronn
+++ b/lib/bundler/man/bundle-exec.1.ronn
@@ -3,7 +3,7 @@ bundle-exec(1) -- Execute a command in the context of the bundle
 
 ## SYNOPSIS
 
-`bundle exec` [--keep-file-descriptors] <command>
+`bundle exec` [--gemfile=GEMFILE] <command>
 
 ## DESCRIPTION
 
@@ -20,9 +20,8 @@ available on your shell's `$PATH`.
 
 ## OPTIONS
 
-* `--keep-file-descriptors`:
-  Passes all file descriptors to the new processes. Default is true from
-  bundler version 2.2.26. Setting it to false is now deprecated.
+* `--gemfile=GEMFILE`:
+  Use the specified gemfile instead of [`Gemfile(5)`][Gemfile(5)].
 
 ## BUNDLE INSTALL --BINSTUBS
 
@@ -105,8 +104,8 @@ need to use `with_unbundled_env`.
 Bundler provides convenience helpers that wrap `system` and `exec`, and they
 can be used like this:
 
-    Bundler.clean_system('brew install wget')
-    Bundler.clean_exec('brew install wget')
+    Bundler.unbundled_system('brew install wget')
+    Bundler.unbundled_exec('brew install wget')
 
 
 ## RUBYGEMS PLUGINS
diff --git a/lib/bundler/man/bundle-fund.1 b/lib/bundler/man/bundle-fund.1
new file mode 100644
index 0000000000..caee1f81dd
--- /dev/null
+++ b/lib/bundler/man/bundle-fund.1
@@ -0,0 +1,22 @@
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-FUND" "1" "May 2026" ""
+.SH "NAME"
+\fBbundle\-fund\fR \- Lists information about gems seeking funding assistance
+.SH "SYNOPSIS"
+\fBbundle fund\fR [\fIOPTIONS\fR]
+.SH "DESCRIPTION"
+\fBbundle fund\fR lists information about gems seeking funding assistance\.
+.SH "OPTIONS"
+.TP
+\fB\-\-group=<list>\fR, \fB\-g=<list>\fR
+Fetch funding information for a specific group\.
+.SH "EXAMPLES"
+.nf
+# Lists funding information for all gems
+bundle fund
+
+# Lists funding information for a specific group
+bundle fund \-\-group=security
+.fi
+
diff --git a/lib/bundler/man/bundle-fund.1.ronn b/lib/bundler/man/bundle-fund.1.ronn
new file mode 100644
index 0000000000..faf8b9c4a7
--- /dev/null
+++ b/lib/bundler/man/bundle-fund.1.ronn
@@ -0,0 +1,25 @@
+bundle-fund(1) -- Lists information about gems seeking funding assistance
+=========================================================================
+
+## SYNOPSIS
+
+`bundle fund` [*OPTIONS*]
+
+## DESCRIPTION
+
+**bundle fund** lists information about gems seeking funding assistance.
+
+## OPTIONS
+
+* `--group=<list>`, `-g=<list>`:
+  Fetch funding information for a specific group.
+
+## EXAMPLES
+
+```
+# Lists funding information for all gems
+bundle fund
+
+# Lists funding information for a specific group
+bundle fund --group=security
+```
diff --git a/lib/bundler/man/bundle-gem.1 b/lib/bundler/man/bundle-gem.1
index 5df7b0ef2f..87d7568246 100644
--- a/lib/bundler/man/bundle-gem.1
+++ b/lib/bundler/man/bundle-gem.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-GEM" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-GEM" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-gem\fR \- Generate a project skeleton for creating a rubygem
 .SH "SYNOPSIS"
@@ -19,49 +19,87 @@ The generated project skeleton can be customized with OPTIONS, as explained belo
 \fBgem\.test\fR
 .IP "" 0
 .SH "OPTIONS"
-.IP "\(bu" 4
-\fB\-\-exe\fR or \fB\-b\fR or \fB\-\-bin\fR: Specify that Bundler should create a binary executable (as \fBexe/GEM_NAME\fR) in the generated rubygem project\. This binary will also be added to the \fBGEM_NAME\.gemspec\fR manifest\. This behavior is disabled by default\.
-.IP "\(bu" 4
-\fB\-\-no\-exe\fR: Do not create a binary (overrides \fB\-\-exe\fR specified in the global config)\.
-.IP "\(bu" 4
-\fB\-\-coc\fR: Add a \fBCODE_OF_CONDUCT\.md\fR file to the root of the generated project\. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
-.IP "\(bu" 4
-\fB\-\-no\-coc\fR: Do not create a \fBCODE_OF_CONDUCT\.md\fR (overrides \fB\-\-coc\fR specified in the global config)\.
-.IP "\(bu" 4
-\fB\-\-ext=c\fR, \fB\-\-ext=rust\fR Add boilerplate for C or Rust (currently magnus \fIhttps://docs\.rs/magnus\fR based) extension code to the generated project\. This behavior is disabled by default\.
-.IP "\(bu" 4
-\fB\-\-no\-ext\fR: Do not add extension code (overrides \fB\-\-ext\fR specified in the global config)\.
-.IP "\(bu" 4
-\fB\-\-mit\fR: Add an MIT license to a \fBLICENSE\.txt\fR file in the root of the generated project\. Your name from the global git config is used for the copyright statement\. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
-.IP "\(bu" 4
-\fB\-\-no\-mit\fR: Do not create a \fBLICENSE\.txt\fR (overrides \fB\-\-mit\fR specified in the global config)\.
-.IP "\(bu" 4
-\fB\-t\fR, \fB\-\-test=minitest\fR, \fB\-\-test=rspec\fR, \fB\-\-test=test\-unit\fR: Specify the test framework that Bundler should use when generating the project\. Acceptable values are \fBminitest\fR, \fBrspec\fR and \fBtest\-unit\fR\. The \fBGEM_NAME\.gemspec\fR will be configured and a skeleton test/spec directory will be created based on this option\. Given no option is specified:
+.TP
+\fB\-\-exe\fR, \fB\-\-bin\fR, \fB\-b\fR
+Specify that Bundler should create a binary executable (as \fBexe/GEM_NAME\fR) in the generated rubygem project\. This binary will also be added to the \fBGEM_NAME\.gemspec\fR manifest\. This behavior is disabled by default\.
+.TP
+\fB\-\-no\-exe\fR
+Do not create a binary (overrides \fB\-\-exe\fR specified in the global config)\.
+.TP
+\fB\-\-coc\fR
+Add a \fBCODE_OF_CONDUCT\.md\fR file to the root of the generated project\. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
+.TP
+\fB\-\-no\-coc\fR
+Do not create a \fBCODE_OF_CONDUCT\.md\fR (overrides \fB\-\-coc\fR specified in the global config)\.
+.TP
+\fB\-\-changelog\fR
+Add a \fBCHANGELOG\.md\fR file to the root of the generated project\. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\. Update the default with \fBbundle config set \-\-global gem\.changelog <true|false>\fR\.
+.TP
+\fB\-\-no\-changelog\fR
+Do not create a \fBCHANGELOG\.md\fR (overrides \fB\-\-changelog\fR specified in the global config)\.
+.TP
+\fB\-\-ext=c\fR, \fB\-\-ext=go\fR, \fB\-\-ext=rust\fR
+Add boilerplate for C, Go (currently go\-gem\-wrapper \fIhttps://github\.com/ruby\-go\-gem/go\-gem\-wrapper\fR based) or Rust (currently magnus \fIhttps://docs\.rs/magnus\fR based) extension code to the generated project\. This behavior is disabled by default\.
+.TP
+\fB\-\-no\-ext\fR
+Do not add extension code (overrides \fB\-\-ext\fR specified in the global config)\.
+.TP
+\fB\-\-git\fR
+Initialize a git repo inside your library\.
+.TP
+\fB\-\-github\-username=GITHUB_USERNAME\fR
+Fill in GitHub username on README so that you don't have to do it manually\. Set a default with \fBbundle config set \-\-global gem\.github_username <your_username>\fR\.
+.TP
+\fB\-\-mit\fR
+Add an MIT license to a \fBLICENSE\.txt\fR file in the root of the generated project\. Your name from the global git config is used for the copyright statement\. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
+.TP
+\fB\-\-no\-mit\fR
+Do not create a \fBLICENSE\.txt\fR (overrides \fB\-\-mit\fR specified in the global config)\.
+.TP
+\fB\-t\fR, \fB\-\-test=minitest\fR, \fB\-\-test=rspec\fR, \fB\-\-test=test\-unit\fR
+Specify the test framework that Bundler should use when generating the project\. Acceptable values are \fBminitest\fR, \fBrspec\fR and \fBtest\-unit\fR\. The \fBGEM_NAME\.gemspec\fR will be configured and a skeleton test/spec directory will be created based on this option\. Given no option is specified:
 .IP
 When Bundler is configured to generate tests, this defaults to Bundler's global config setting \fBgem\.test\fR\.
 .IP
 When Bundler is configured to not generate tests, an interactive prompt will be displayed and the answer will be used for the current rubygem project\.
 .IP
 When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
-.IP "\(bu" 4
-\fB\-\-ci\fR, \fB\-\-ci=github\fR, \fB\-\-ci=gitlab\fR, \fB\-\-ci=circle\fR: Specify the continuous integration service that Bundler should use when generating the project\. Acceptable values are \fBgithub\fR, \fBgitlab\fR and \fBcircle\fR\. A configuration file will be generated in the project directory\. Given no option is specified:
+.TP
+\fB\-\-no\-test\fR
+Do not use a test framework (overrides \fB\-\-test\fR specified in the global config)\.
+.TP
+\fB\-\-ci\fR, \fB\-\-ci=circle\fR, \fB\-\-ci=github\fR, \fB\-\-ci=gitlab\fR
+Specify the continuous integration service that Bundler should use when generating the project\. Acceptable values are \fBgithub\fR, \fBgitlab\fR and \fBcircle\fR\. A configuration file will be generated in the project directory\. Given no option is specified:
 .IP
 When Bundler is configured to generate CI files, this defaults to Bundler's global config setting \fBgem\.ci\fR\.
 .IP
 When Bundler is configured to not generate CI files, an interactive prompt will be displayed and the answer will be used for the current rubygem project\.
 .IP
 When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
-.IP "\(bu" 4
-\fB\-\-linter\fR, \fB\-\-linter=rubocop\fR, \fB\-\-linter=standard\fR: Specify the linter and code formatter that Bundler should add to the project's development dependencies\. Acceptable values are \fBrubocop\fR and \fBstandard\fR\. A configuration file will be generated in the project directory\. Given no option is specified:
+.TP
+\fB\-\-no\-ci\fR
+Do not use a continuous integration service (overrides \fB\-\-ci\fR specified in the global config)\.
+.TP
+\fB\-\-linter\fR, \fB\-\-linter=rubocop\fR, \fB\-\-linter=standard\fR
+Specify the linter and code formatter that Bundler should add to the project's development dependencies\. Acceptable values are \fBrubocop\fR and \fBstandard\fR\. A configuration file will be generated in the project directory\. Given no option is specified:
 .IP
 When Bundler is configured to add a linter, this defaults to Bundler's global config setting \fBgem\.linter\fR\.
 .IP
 When Bundler is configured not to add a linter, an interactive prompt will be displayed and the answer will be used for the current rubygem project\.
 .IP
 When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future \fBbundle gem\fR use\.
-.IP "\(bu" 4
-\fB\-e\fR, \fB\-\-edit[=EDITOR]\fR: Open the resulting GEM_NAME\.gemspec in EDITOR, or the default editor if not specified\. The default is \fB$BUNDLER_EDITOR\fR, \fB$VISUAL\fR, or \fB$EDITOR\fR\.
-.IP "" 0
+.TP
+\fB\-\-no\-linter\fR
+Do not add a linter (overrides \fB\-\-linter\fR specified in the global config)\.
+.TP
+\fB\-\-edit=EDIT\fR, \fB\-e=EDIT\fR
+Open the resulting GEM_NAME\.gemspec in EDIT, or the default editor if not specified\. The default is \fB$BUNDLER_EDITOR\fR, \fB$VISUAL\fR, or \fB$EDITOR\fR\.
+.TP
+\fB\-\-bundle\fR
+Run \fBbundle install\fR after creating the gem\.
+.TP
+\fB\-\-no\-bundle\fR
+Do not run \fBbundle install\fR after creating the gem\.
 .SH "SEE ALSO"
 .IP "\(bu" 4
 bundle config(1) \fIbundle\-config\.1\.html\fR
diff --git a/lib/bundler/man/bundle-gem.1.ronn b/lib/bundler/man/bundle-gem.1.ronn
index 46fa2f179f..488c8113e4 100644
--- a/lib/bundler/man/bundle-gem.1.ronn
+++ b/lib/bundler/man/bundle-gem.1.ronn
@@ -1,5 +1,5 @@
 bundle-gem(1) -- Generate a project skeleton for creating a rubygem
-====================================================================
+===================================================================
 
 ## SYNOPSIS
 
@@ -24,7 +24,7 @@ configuration file using the following names:
 
 ## OPTIONS
 
-* `--exe` or `-b` or `--bin`:
+* `--exe`, `--bin`, `-b`:
   Specify that Bundler should create a binary executable (as `exe/GEM_NAME`)
   in the generated rubygem project. This binary will also be added to the
   `GEM_NAME.gemspec` manifest. This behavior is disabled by default.
@@ -41,14 +41,30 @@ configuration file using the following names:
   Do not create a `CODE_OF_CONDUCT.md` (overrides `--coc` specified in the
   global config).
 
-* `--ext=c`, `--ext=rust`
-  Add boilerplate for C or Rust (currently [magnus](https://docs.rs/magnus) based) extension code to the generated project. This behavior
+* `--changelog`:
+  Add a `CHANGELOG.md` file to the root of the generated project. If
+  this option is unspecified, an interactive prompt will be displayed and the
+  answer will be saved in Bundler's global config for future `bundle gem` use.
+  Update the default with `bundle config set --global gem.changelog <true|false>`.
+
+* `--no-changelog`:
+  Do not create a `CHANGELOG.md` (overrides `--changelog` specified in the
+  global config).
+
+* `--ext=c`, `--ext=go`, `--ext=rust`:
+  Add boilerplate for C, Go (currently [go-gem-wrapper](https://github.com/ruby-go-gem/go-gem-wrapper) based) or Rust (currently [magnus](https://docs.rs/magnus) based) extension code to the generated project. This behavior
   is disabled by default.
 
 * `--no-ext`:
   Do not add extension code (overrides `--ext` specified in the global
   config).
 
+* `--git`:
+  Initialize a git repo inside your library.
+
+* `--github-username=GITHUB_USERNAME`:
+  Fill in GitHub username on README so that you don't have to do it manually. Set a default with `bundle config set --global gem.github_username <your_username>`.
+
 * `--mit`:
   Add an MIT license to a `LICENSE.txt` file in the root of the generated
   project. Your name from the global git config is used for the copyright
@@ -76,7 +92,11 @@ configuration file using the following names:
   the answer will be saved in Bundler's global config for future `bundle gem`
   use.
 
-* `--ci`, `--ci=github`, `--ci=gitlab`, `--ci=circle`:
+* `--no-test`:
+  Do not use a test framework (overrides `--test` specified in the global
+  config).
+
+* `--ci`, `--ci=circle`, `--ci=github`, `--ci=gitlab`:
   Specify the continuous integration service that Bundler should use when
   generating the project. Acceptable values are `github`, `gitlab`
   and `circle`. A configuration file will be generated in the project directory.
@@ -92,6 +112,10 @@ configuration file using the following names:
   the answer will be saved in Bundler's global config for future `bundle gem`
   use.
 
+* `--no-ci`:
+  Do not use a continuous integration service (overrides `--ci` specified in
+  the global config).
+
 * `--linter`, `--linter=rubocop`, `--linter=standard`:
   Specify the linter and code formatter that Bundler should add to the
   project's development dependencies. Acceptable values are `rubocop` and
@@ -108,10 +132,19 @@ configuration file using the following names:
   the answer will be saved in Bundler's global config for future `bundle gem`
   use.
 
-* `-e`, `--edit[=EDITOR]`:
-  Open the resulting GEM_NAME.gemspec in EDITOR, or the default editor if not
+* `--no-linter`:
+  Do not add a linter (overrides `--linter` specified in the global config).
+
+* `--edit=EDIT`, `-e=EDIT`:
+  Open the resulting GEM_NAME.gemspec in EDIT, or the default editor if not
   specified. The default is `$BUNDLER_EDITOR`, `$VISUAL`, or `$EDITOR`.
 
+* `--bundle`:
+  Run `bundle install` after creating the gem.
+
+* `--no-bundle`:
+  Do not run `bundle install` after creating the gem.
+
 ## SEE ALSO
 
 * [bundle config(1)](bundle-config.1.html)
diff --git a/lib/bundler/man/bundle-help.1 b/lib/bundler/man/bundle-help.1
index a3e7c7770d..3bcfd047e5 100644
--- a/lib/bundler/man/bundle-help.1
+++ b/lib/bundler/man/bundle-help.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-HELP" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-HELP" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-help\fR \- Displays detailed help for each subcommand
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-info.1 b/lib/bundler/man/bundle-info.1
index a3d7ff0988..49c2295f8c 100644
--- a/lib/bundler/man/bundle-info.1
+++ b/lib/bundler/man/bundle-info.1
@@ -1,14 +1,17 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-INFO" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-INFO" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-info\fR \- Show information for the given gem in your bundle
 .SH "SYNOPSIS"
-\fBbundle info\fR [GEM_NAME] [\-\-path]
+\fBbundle info\fR [GEM_NAME] [\-\-path] [\-\-version]
 .SH "DESCRIPTION"
 Given a gem name present in your bundle, print the basic information about it such as homepage, version, path and summary\.
 .SH "OPTIONS"
 .TP
 \fB\-\-path\fR
 Print the path of the given gem
+.TP
+\fB\-\-version\fR
+Print gem version
 
diff --git a/lib/bundler/man/bundle-info.1.ronn b/lib/bundler/man/bundle-info.1.ronn
index cecdeb564f..e99db8c614 100644
--- a/lib/bundler/man/bundle-info.1.ronn
+++ b/lib/bundler/man/bundle-info.1.ronn
@@ -1,10 +1,11 @@
 bundle-info(1) -- Show information for the given gem in your bundle
-=========================================================================
+===================================================================
 
 ## SYNOPSIS
 
 `bundle info` [GEM_NAME]
               [--path]
+              [--version]
 
 ## DESCRIPTION
 
@@ -14,4 +15,7 @@ Given a gem name present in your bundle, print the basic information about it
 ## OPTIONS
 
 * `--path`:
-Print the path of the given gem
+  Print the path of the given gem
+
+* `--version`:
+  Print gem version
diff --git a/lib/bundler/man/bundle-init.1 b/lib/bundler/man/bundle-init.1
index a0edaaa18f..63e2376c3f 100644
--- a/lib/bundler/man/bundle-init.1
+++ b/lib/bundler/man/bundle-init.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-INIT" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-INIT" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-init\fR \- Generates a Gemfile into the current working directory
 .SH "SYNOPSIS"
@@ -9,10 +9,10 @@
 Init generates a default [\fBGemfile(5)\fR][Gemfile(5)] in the current working directory\. When adding a [\fBGemfile(5)\fR][Gemfile(5)] to a gem with a gemspec, the \fB\-\-gemspec\fR option will automatically add each dependency listed in the gemspec file to the newly created [\fBGemfile(5)\fR][Gemfile(5)]\.
 .SH "OPTIONS"
 .TP
-\fB\-\-gemspec\fR
+\fB\-\-gemspec=GEMSPEC\fR
 Use the specified \.gemspec to create the [\fBGemfile(5)\fR][Gemfile(5)]
 .TP
-\fB\-\-gemfile\fR
+\fB\-\-gemfile=GEMFILE\fR
 Use the specified name for the gemfile instead of \fBGemfile\fR
 .SH "FILES"
 Included in the default [\fBGemfile(5)\fR][Gemfile(5)] generated is the line \fB# frozen_string_literal: true\fR\. This is a magic comment supported for the first time in Ruby 2\.3\. The presence of this line results in all string literals in the file being implicitly frozen\.
diff --git a/lib/bundler/man/bundle-init.1.ronn b/lib/bundler/man/bundle-init.1.ronn
index 7d3cede1f6..ab3c427b52 100644
--- a/lib/bundler/man/bundle-init.1.ronn
+++ b/lib/bundler/man/bundle-init.1.ronn
@@ -14,9 +14,10 @@ created [`Gemfile(5)`][Gemfile(5)].
 
 ## OPTIONS
 
-* `--gemspec`:
+* `--gemspec=GEMSPEC`:
   Use the specified .gemspec to create the [`Gemfile(5)`][Gemfile(5)]
-* `--gemfile`:
+
+* `--gemfile=GEMFILE`:
   Use the specified name for the gemfile instead of `Gemfile`
 
 ## FILES
diff --git a/lib/bundler/man/bundle-inject.1 b/lib/bundler/man/bundle-inject.1
deleted file mode 100644
index 7a1038206e..0000000000
--- a/lib/bundler/man/bundle-inject.1
+++ /dev/null
@@ -1,23 +0,0 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-INJECT" "1" "May 2024" ""
-.SH "NAME"
-\fBbundle\-inject\fR \- Add named gem(s) with version requirements to Gemfile
-.SH "SYNOPSIS"
-\fBbundle inject\fR [GEM] [VERSION]
-.SH "DESCRIPTION"
-Adds the named gem(s) with their version requirements to the resolved [\fBGemfile(5)\fR][Gemfile(5)]\.
-.P
-This command will add the gem to both your [\fBGemfile(5)\fR][Gemfile(5)] and Gemfile\.lock if it isn't listed yet\.
-.P
-Example:
-.IP "" 4
-.nf
-bundle install
-bundle inject 'rack' '> 0'
-.fi
-.IP "" 0
-.P
-This will inject the 'rack' gem with a version greater than 0 in your [\fBGemfile(5)\fR][Gemfile(5)] and Gemfile\.lock\.
-.P
-The \fBbundle inject\fR command was deprecated in Bundler 2\.1 and will be removed in Bundler 3\.0\.
diff --git a/lib/bundler/man/bundle-inject.1.ronn b/lib/bundler/man/bundle-inject.1.ronn
deleted file mode 100644
index 95704eddad..0000000000
--- a/lib/bundler/man/bundle-inject.1.ronn
+++ /dev/null
@@ -1,24 +0,0 @@
-bundle-inject(1) -- Add named gem(s) with version requirements to Gemfile
-=========================================================================
-
-## SYNOPSIS
-
-`bundle inject` [GEM] [VERSION]
-
-## DESCRIPTION
-
-Adds the named gem(s) with their version requirements to the resolved
-[`Gemfile(5)`][Gemfile(5)].
-
-This command will add the gem to both your [`Gemfile(5)`][Gemfile(5)] and Gemfile.lock if it
-isn't listed yet.
-
-Example:
-
-    bundle install
-    bundle inject 'rack' '> 0'
-
-This will inject the 'rack' gem with a version greater than 0 in your
-[`Gemfile(5)`][Gemfile(5)] and Gemfile.lock.
-
-The `bundle inject` command was deprecated in Bundler 2.1 and will be removed in Bundler 3.0.
diff --git a/lib/bundler/man/bundle-install.1 b/lib/bundler/man/bundle-install.1
index cc46a03b7f..801768c7ec 100644
--- a/lib/bundler/man/bundle-install.1
+++ b/lib/bundler/man/bundle-install.1
@@ -1,10 +1,10 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-INSTALL" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-INSTALL" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-install\fR \- Install the dependencies specified in your Gemfile
 .SH "SYNOPSIS"
-\fBbundle install\fR [\-\-binstubs[=DIRECTORY]] [\-\-clean] [\-\-deployment] [\-\-frozen] [\-\-full\-index] [\-\-gemfile=GEMFILE] [\-\-jobs=NUMBER] [\-\-local] [\-\-no\-cache] [\-\-no\-prune] [\-\-path PATH] [\-\-prefer\-local] [\-\-quiet] [\-\-redownload] [\-\-retry=NUMBER] [\-\-shebang] [\-\-standalone[=GROUP[ GROUP\|\.\|\.\|\.]]] [\-\-system] [\-\-trust\-policy=POLICY] [\-\-with=GROUP[ GROUP\|\.\|\.\|\.]] [\-\-without=GROUP[ GROUP\|\.\|\.\|\.]]
+\fBbundle install\fR [\-\-cooldown=NUMBER] [\-\-force] [\-\-full\-index] [\-\-gemfile=GEMFILE] [\-\-jobs=NUMBER] [\-\-local] [\-\-lockfile=LOCKFILE] [\-\-no\-cache] [\-\-no\-lock] [\-\-prefer\-local] [\-\-quiet] [\-\-retry=NUMBER] [\-\-standalone[=GROUP[ GROUP\|\.\|\.\|\.]]] [\-\-trust\-policy=TRUST\-POLICY] [\-\-target\-rbconfig=TARGET\-RBCONFIG]
 .SH "DESCRIPTION"
 Install the gems specified in your Gemfile(5)\. If this is the first time you run bundle install (and a \fBGemfile\.lock\fR does not exist), Bundler will fetch all remote sources, resolve dependencies and install all needed gems\.
 .P
@@ -12,92 +12,55 @@ If a \fBGemfile\.lock\fR does exist, and you have not updated your Gemfile(5), B
 .P
 If a \fBGemfile\.lock\fR does exist, and you have updated your Gemfile(5), Bundler will use the dependencies in the \fBGemfile\.lock\fR for all gems that you did not update, but will re\-resolve the dependencies of gems that you did update\. You can find more information about this update process below under \fICONSERVATIVE UPDATING\fR\.
 .SH "OPTIONS"
-The \fB\-\-clean\fR, \fB\-\-deployment\fR, \fB\-\-frozen\fR, \fB\-\-no\-prune\fR, \fB\-\-path\fR, \fB\-\-shebang\fR, \fB\-\-system\fR, \fB\-\-without\fR and \fB\-\-with\fR options are deprecated because they only make sense if they are applied to every subsequent \fBbundle install\fR run automatically and that requires \fBbundler\fR to silently remember them\. Since \fBbundler\fR will no longer remember CLI flags in future versions, \fBbundle config\fR (see bundle\-config(1)) should be used to apply them permanently\.
 .TP
-\fB\-\-binstubs[=<directory>]\fR
-Binstubs are scripts that wrap around executables\. Bundler creates a small Ruby file (a binstub) that loads Bundler, runs the command, and puts it in \fBbin/\fR\. This lets you link the binstub inside of an application to the exact gem version the application needs\.
-.IP
-Creates a directory (defaults to \fB~/bin\fR) and places any executables from the gem there\. These executables run in Bundler's context\. If used, you might add this directory to your environment's \fBPATH\fR variable\. For instance, if the \fBrails\fR gem comes with a \fBrails\fR executable, this flag will create a \fBbin/rails\fR executable that ensures that all referred dependencies will be resolved using the bundled gems\.
-.TP
-\fB\-\-clean\fR
-On finishing the installation Bundler is going to remove any gems not present in the current Gemfile(5)\. Don't worry, gems currently in use will not be removed\.
-.IP
-This option is deprecated in favor of the \fBclean\fR setting\.
-.TP
-\fB\-\-deployment\fR
-In \fIdeployment mode\fR, Bundler will 'roll\-out' the bundle for production or CI use\. Please check carefully if you want to have this option enabled in your development environment\.
-.IP
-This option is deprecated in favor of the \fBdeployment\fR setting\.
+\fB\-\-cooldown=<number>\fR
+Only consider gem versions published at least \fInumber\fR days ago when resolving\. Pass \fB0\fR to disable cooldown for this run, overriding any per\-source or global configuration\. See \fBcooldown\fR in bundle\-config(1) for details on the precedence between the CLI flag, Bundler config, and Gemfile per\-source settings\.
 .TP
-\fB\-\-redownload\fR
-Force download every gem, even if the required versions are already available locally\.
-.TP
-\fB\-\-frozen\fR
-Do not allow the Gemfile\.lock to be updated after this install\. Exits non\-zero if there are going to be changes to the Gemfile\.lock\.
-.IP
-This option is deprecated in favor of the \fBfrozen\fR setting\.
+\fB\-\-force\fR, \fB\-\-redownload\fR
+Force reinstalling every gem, even if already installed\.
 .TP
 \fB\-\-full\-index\fR
 Bundler will not call Rubygems' API endpoint (default) but download and cache a (currently big) index file of all gems\. Performance can be improved for large bundles that seldom change by enabling this option\.
 .TP
-\fB\-\-gemfile=<gemfile>\fR
+\fB\-\-gemfile=GEMFILE\fR
 The location of the Gemfile(5) which Bundler should use\. This defaults to a Gemfile(5) in the current working directory\. In general, Bundler will assume that the location of the Gemfile(5) is also the project's root and will try to find \fBGemfile\.lock\fR and \fBvendor/cache\fR relative to this location\.
 .TP
-\fB\-\-jobs=[<number>]\fR, \fB\-j[<number>]\fR
+\fB\-\-jobs=<number>\fR, \fB\-j=<number>\fR
 The maximum number of parallel download and install jobs\. The default is the number of available processors\.
 .TP
 \fB\-\-local\fR
 Do not attempt to connect to \fBrubygems\.org\fR\. Instead, Bundler will use the gems already present in Rubygems' cache or in \fBvendor/cache\fR\. Note that if an appropriate platform\-specific gem exists on \fBrubygems\.org\fR it will not be found\.
 .TP
+\fB\-\-lockfile=LOCKFILE\fR
+The location of the lockfile which Bundler should use\. This defaults to the Gemfile location with \fB\.lock\fR appended\.
+.TP
 \fB\-\-prefer\-local\fR
 Force using locally installed gems, or gems already present in Rubygems' cache or in \fBvendor/cache\fR, when resolving, even if newer versions are available remotely\. Only attempt to connect to \fBrubygems\.org\fR for gems that are not present locally\.
 .TP
 \fB\-\-no\-cache\fR
 Do not update the cache in \fBvendor/cache\fR with the newly bundled gems\. This does not remove any gems in the cache but keeps the newly bundled gems from being cached during the install\.
 .TP
-\fB\-\-no\-prune\fR
-Don't remove stale gems from the cache when the installation finishes\.
+\fB\-\-no\-lock\fR
+Do not create a lockfile\. Useful if you want to install dependencies but not lock versions of gems\. Recommended for library development, and other situations where the code is expected to work with a range of dependency versions\.
 .IP
-This option is deprecated in favor of the \fBno_prune\fR setting\.
-.TP
-\fB\-\-path=<path>\fR
-The location to install the specified gems to\. This defaults to Rubygems' setting\. Bundler shares this location with Rubygems, \fBgem install \|\.\|\.\|\.\fR will have gem installed there, too\. Therefore, gems installed without a \fB\-\-path \|\.\|\.\|\.\fR setting will show up by calling \fBgem list\fR\. Accordingly, gems installed to other locations will not get listed\.
-.IP
-This option is deprecated in favor of the \fBpath\fR setting\.
+This has the same effect as using \fBlockfile false\fR in the Gemfile\. See gemfile(5) for more information\.
 .TP
 \fB\-\-quiet\fR
-Do not print progress information to the standard output\. Instead, Bundler will exit using a status code (\fB$?\fR)\.
+Do not print progress information to the standard output\.
 .TP
 \fB\-\-retry=[<number>]\fR
 Retry failed network or git requests for \fInumber\fR times\.
 .TP
-\fB\-\-shebang=<ruby\-executable>\fR
-Uses the specified ruby executable (usually \fBruby\fR) to execute the scripts created with \fB\-\-binstubs\fR\. In addition, if you use \fB\-\-binstubs\fR together with \fB\-\-shebang jruby\fR these executables will be changed to execute \fBjruby\fR instead\.
-.IP
-This option is deprecated in favor of the \fBshebang\fR setting\.
-.TP
 \fB\-\-standalone[=<list>]\fR
-Makes a bundle that can work without depending on Rubygems or Bundler at runtime\. A space separated list of groups to install has to be specified\. Bundler creates a directory named \fBbundle\fR and installs the bundle there\. It also generates a \fBbundle/bundler/setup\.rb\fR file to replace Bundler's own setup in the manner required\. Using this option implicitly sets \fBpath\fR, which is a [remembered option][REMEMBERED OPTIONS]\.
-.TP
-\fB\-\-system\fR
-Installs the gems specified in the bundle to the system's Rubygems location\. This overrides any previous configuration of \fB\-\-path\fR\.
-.IP
-This option is deprecated in favor of the \fBsystem\fR setting\.
+Makes a bundle that can work without depending on Rubygems or Bundler at runtime\. A space separated list of groups to install can be specified\. Bundler creates a directory named \fBbundle\fR and installs the bundle there\. It also generates a \fBbundle/bundler/setup\.rb\fR file to replace Bundler's own setup in the manner required\.
 .TP
-\fB\-\-trust\-policy=[<policy>]\fR
+\fB\-\-trust\-policy=TRUST\-POLICY\fR
 Apply the Rubygems security policy \fIpolicy\fR, where policy is one of \fBHighSecurity\fR, \fBMediumSecurity\fR, \fBLowSecurity\fR, \fBAlmostNoSecurity\fR, or \fBNoSecurity\fR\. For more details, please see the Rubygems signing documentation linked below in \fISEE ALSO\fR\.
 .TP
-\fB\-\-with=<list>\fR
-A space\-separated list of groups referencing gems to install\. If an optional group is given it is installed\. If a group is given that is in the remembered list of groups given to \-\-without, it is removed from that list\.
-.IP
-This option is deprecated in favor of the \fBwith\fR setting\.
-.TP
-\fB\-\-without=<list>\fR
-A space\-separated list of groups referencing gems to skip during installation\. If a group is given that is in the remembered list of groups given to \-\-with, it is removed from that list\.
-.IP
-This option is deprecated in favor of the \fBwithout\fR setting\.
+\fB\-\-target\-rbconfig=TARGET\-RBCONFIG\fR
+Path to rbconfig\.rb for the deployment target platform\.
 .SH "DEPLOYMENT MODE"
-Bundler's defaults are optimized for development\. To switch to defaults optimized for deployment and for CI, use the \fB\-\-deployment\fR flag\. Do not activate deployment mode on development machines, as it will cause an error when the Gemfile(5) is modified\.
+Bundler's defaults are optimized for development\. To switch to defaults optimized for deployment and for CI, use the \fBdeployment\fR setting\. Do not activate deployment mode on development machines, as it will cause an error when the Gemfile(5) is modified\.
 .IP "1." 4
 A \fBGemfile\.lock\fR is required\.
 .IP
@@ -117,14 +80,14 @@ In development, it's convenient to share the gems used in your application with
 .IP
 In deployment, isolation is a more important default\. In addition, the user deploying the application may not have permission to install gems to the system, or the web server may not have permission to read them\.
 .IP
-As a result, \fBbundle install \-\-deployment\fR installs gems to the \fBvendor/bundle\fR directory in the application\. This may be overridden using the \fB\-\-path\fR option\.
+As a result, when \fBdeployment\fR is configured, \fBbundle install\fR installs gems to the \fBvendor/bundle\fR directory in the application\. This may be overridden using the \fBpath\fR setting\.
 .IP "" 0
 .SH "INSTALLING GROUPS"
 By default, \fBbundle install\fR will install all gems in all groups in your Gemfile(5), except those declared for a different platform\.
 .P
-However, you can explicitly tell Bundler to skip installing certain groups with the \fB\-\-without\fR option\. This option takes a space\-separated list of groups\.
+However, you can explicitly tell Bundler to skip installing certain groups with the \fBwithout\fR setting\. This setting takes a space\-separated list of groups\.
 .P
-While the \fB\-\-without\fR option will skip \fIinstalling\fR the gems in the specified groups, it will still \fIdownload\fR those gems and use them to resolve the dependencies of every gem in your Gemfile(5)\.
+While the \fBwithout\fR setting will skip \fIinstalling\fR the gems in the specified groups, \fBbundle install\fR will still \fIdownload\fR those gems and use them to resolve the dependencies of every gem in your Gemfile(5)\.
 .P
 This is so that installing a different set of groups on another machine (such as a production server) will not change the gems and versions that you have already developed and tested against\.
 .P
@@ -145,7 +108,7 @@ end
 .P
 In this case, \fBsinatra\fR depends on any version of Rack (\fB>= 1\.0\fR), while \fBrack\-perftools\-profiler\fR depends on 1\.x (\fB~> 1\.0\fR)\.
 .P
-When you run \fBbundle install \-\-without production\fR in development, we look at the dependencies of \fBrack\-perftools\-profiler\fR as well\. That way, you do not spend all your time developing against Rack 2\.0, using new APIs unavailable in Rack 1\.x, only to have Bundler switch to Rack 1\.2 when the \fBproduction\fR group \fIis\fR used\.
+When you configure \fBbundle config without production\fR in development, we look at the dependencies of \fBrack\-perftools\-profiler\fR as well\. That way, you do not spend all your time developing against Rack 2\.0, using new APIs unavailable in Rack 1\.x, only to have Bundler switch to Rack 1\.2 when the \fBproduction\fR group \fIis\fR used\.
 .P
 This should not cause any problems in practice, because we do not attempt to \fBinstall\fR the gems in the excluded groups, and only evaluate as part of the dependency resolution process\.
 .P
diff --git a/lib/bundler/man/bundle-install.1.ronn b/lib/bundler/man/bundle-install.1.ronn
index ed8169de05..56fd8bdf42 100644
--- a/lib/bundler/man/bundle-install.1.ronn
+++ b/lib/bundler/man/bundle-install.1.ronn
@@ -3,27 +3,21 @@ bundle-install(1) -- Install the dependencies specified in your Gemfile
 
 ## SYNOPSIS
 
-`bundle install` [--binstubs[=DIRECTORY]]
-                 [--clean]
-                 [--deployment]
-                 [--frozen]
+`bundle install` [--cooldown=NUMBER]
+                 [--force]
                  [--full-index]
                  [--gemfile=GEMFILE]
                  [--jobs=NUMBER]
                  [--local]
+                 [--lockfile=LOCKFILE]
                  [--no-cache]
-                 [--no-prune]
-                 [--path PATH]
+                 [--no-lock]
                  [--prefer-local]
                  [--quiet]
-                 [--redownload]
                  [--retry=NUMBER]
-                 [--shebang]
                  [--standalone[=GROUP[ GROUP...]]]
-                 [--system]
-                 [--trust-policy=POLICY]
-                 [--with=GROUP[ GROUP...]]
-                 [--without=GROUP[ GROUP...]]
+                 [--trust-policy=TRUST-POLICY]
+                 [--target-rbconfig=TARGET-RBCONFIG]
 
 ## DESCRIPTION
 
@@ -44,63 +38,29 @@ update process below under [CONSERVATIVE UPDATING][].
 
 ## OPTIONS
 
-The `--clean`, `--deployment`, `--frozen`, `--no-prune`, `--path`, `--shebang`,
-`--system`, `--without` and `--with` options are deprecated because they only
-make sense if they are applied to every subsequent `bundle install` run
-automatically and that requires `bundler` to silently remember them. Since
-`bundler` will no longer remember CLI flags in future versions, `bundle config`
-(see bundle-config(1)) should be used to apply them permanently.
+* `--cooldown=<number>`:
+  Only consider gem versions published at least <number> days ago when
+  resolving. Pass `0` to disable cooldown for this run, overriding any
+  per-source or global configuration. See `cooldown` in bundle-config(1)
+  for details on the precedence between the CLI flag, Bundler config,
+  and Gemfile per-source settings.
 
-* `--binstubs[=<directory>]`:
-  Binstubs are scripts that wrap around executables. Bundler creates a small Ruby
-  file (a binstub) that loads Bundler, runs the command, and puts it in `bin/`.
-  This lets you link the binstub inside of an application to the exact gem
-  version the application needs.
-
-  Creates a directory (defaults to `~/bin`) and places any executables from the
-  gem there. These executables run in Bundler's context. If used, you might add
-  this directory to your environment's `PATH` variable. For instance, if the
-  `rails` gem comes with a `rails` executable, this flag will create a
-  `bin/rails` executable that ensures that all referred dependencies will be
-  resolved using the bundled gems.
-
-* `--clean`:
-  On finishing the installation Bundler is going to remove any gems not present
-  in the current Gemfile(5). Don't worry, gems currently in use will not be
-  removed.
-
-  This option is deprecated in favor of the `clean` setting.
-
-* `--deployment`:
-  In [deployment mode][DEPLOYMENT MODE], Bundler will 'roll-out' the bundle for
-  production or CI use. Please check carefully if you want to have this option
-  enabled in your development environment.
-
-  This option is deprecated in favor of the `deployment` setting.
-
-* `--redownload`:
-  Force download every gem, even if the required versions are already available
-  locally.
-
-* `--frozen`:
-  Do not allow the Gemfile.lock to be updated after this install. Exits
-  non-zero if there are going to be changes to the Gemfile.lock.
-
-  This option is deprecated in favor of the `frozen` setting.
+* `--force`, `--redownload`:
+  Force reinstalling every gem, even if already installed.
 
 * `--full-index`:
   Bundler will not call Rubygems' API endpoint (default) but download and cache
   a (currently big) index file of all gems. Performance can be improved for
   large bundles that seldom change by enabling this option.
 
-* `--gemfile=<gemfile>`:
+* `--gemfile=GEMFILE`:
   The location of the Gemfile(5) which Bundler should use. This defaults
   to a Gemfile(5) in the current working directory. In general, Bundler
   will assume that the location of the Gemfile(5) is also the project's
   root and will try to find `Gemfile.lock` and `vendor/cache` relative
   to this location.
 
-* `--jobs=[<number>]`, `-j[<number>]`:
+* `--jobs=<number>`, `-j=<number>`:
   The maximum number of parallel download and install jobs. The default is the
   number of available processors.
 
@@ -110,6 +70,10 @@ automatically and that requires `bundler` to silently remember them. Since
   appropriate platform-specific gem exists on `rubygems.org` it will not be
   found.
 
+* `--lockfile=LOCKFILE`:
+  The location of the lockfile which Bundler should use. This defaults
+  to the Gemfile location with `.lock` appended.
+
 * `--prefer-local`:
   Force using locally installed gems, or gems already present in Rubygems' cache
   or in `vendor/cache`, when resolving, even if newer versions are available
@@ -121,75 +85,42 @@ automatically and that requires `bundler` to silently remember them. Since
   does not remove any gems in the cache but keeps the newly bundled gems from
   being cached during the install.
 
-* `--no-prune`:
-  Don't remove stale gems from the cache when the installation finishes.
+* `--no-lock`:
+  Do not create a lockfile. Useful if you want to install dependencies but not
+  lock versions of gems. Recommended for library development, and other
+  situations where the code is expected to work with a range of dependency
+  versions.
 
-  This option is deprecated in favor of the `no_prune` setting.
-
-* `--path=<path>`:
-  The location to install the specified gems to. This defaults to Rubygems'
-  setting. Bundler shares this location with Rubygems, `gem install ...` will
-  have gem installed there, too. Therefore, gems installed without a
-  `--path ...` setting will show up by calling `gem list`. Accordingly, gems
-  installed to other locations will not get listed.
-
-  This option is deprecated in favor of the `path` setting.
+  This has the same effect as using `lockfile false` in the Gemfile.
+  See gemfile(5) for more information.
 
 * `--quiet`:
-  Do not print progress information to the standard output. Instead, Bundler
-  will exit using a status code (`$?`).
+  Do not print progress information to the standard output.
 
 * `--retry=[<number>]`:
   Retry failed network or git requests for <number> times.
 
-* `--shebang=<ruby-executable>`:
-  Uses the specified ruby executable (usually `ruby`) to execute the scripts
-  created with `--binstubs`. In addition, if you use `--binstubs` together with
-  `--shebang jruby` these executables will be changed to execute `jruby`
-  instead.
-
-  This option is deprecated in favor of the `shebang` setting.
-
 * `--standalone[=<list>]`:
   Makes a bundle that can work without depending on Rubygems or Bundler at
-  runtime. A space separated list of groups to install has to be specified.
+  runtime. A space separated list of groups to install can be specified.
   Bundler creates a directory named `bundle` and installs the bundle there. It
   also generates a `bundle/bundler/setup.rb` file to replace Bundler's own setup
-  in the manner required. Using this option implicitly sets `path`, which is a
-  [remembered option][REMEMBERED OPTIONS].
-
-* `--system`:
-  Installs the gems specified in the bundle to the system's Rubygems location.
-  This overrides any previous configuration of `--path`.
+  in the manner required.
 
-  This option is deprecated in favor of the `system` setting.
-
-* `--trust-policy=[<policy>]`:
+* `--trust-policy=TRUST-POLICY`:
   Apply the Rubygems security policy <policy>, where policy is one of
   `HighSecurity`, `MediumSecurity`, `LowSecurity`, `AlmostNoSecurity`, or
   `NoSecurity`. For more details, please see the Rubygems signing documentation
   linked below in [SEE ALSO][].
 
-* `--with=<list>`:
-  A space-separated list of groups referencing gems to install. If an
-  optional group is given it is installed. If a group is given that is
-  in the remembered list of groups given to --without, it is removed
-  from that list.
-
-  This option is deprecated in favor of the `with` setting.
-
-* `--without=<list>`:
-  A space-separated list of groups referencing gems to skip during installation.
-  If a group is given that is in the remembered list of groups given
-  to --with, it is removed from that list.
-
-  This option is deprecated in favor of the `without` setting.
+* `--target-rbconfig=TARGET-RBCONFIG`:
+  Path to rbconfig.rb for the deployment target platform.
 
 ## DEPLOYMENT MODE
 
 Bundler's defaults are optimized for development. To switch to
-defaults optimized for deployment and for CI, use the `--deployment`
-flag. Do not activate deployment mode on development machines, as it
+defaults optimized for deployment and for CI, use the `deployment`
+setting. Do not activate deployment mode on development machines, as it
 will cause an error when the Gemfile(5) is modified.
 
 1. A `Gemfile.lock` is required.
@@ -221,9 +152,9 @@ will cause an error when the Gemfile(5) is modified.
    gems to the system, or the web server may not have permission to
    read them.
 
-   As a result, `bundle install --deployment` installs gems to
-   the `vendor/bundle` directory in the application. This may be
-   overridden using the `--path` option.
+   As a result, when `deployment` is configured, `bundle install` installs gems
+   to the `vendor/bundle` directory in the application. This may be
+   overridden using the `path` setting.
 
 ## INSTALLING GROUPS
 
@@ -231,12 +162,12 @@ By default, `bundle install` will install all gems in all groups
 in your Gemfile(5), except those declared for a different platform.
 
 However, you can explicitly tell Bundler to skip installing
-certain groups with the `--without` option. This option takes
+certain groups with the `without` setting. This setting takes
 a space-separated list of groups.
 
-While the `--without` option will skip _installing_ the gems in the
-specified groups, it will still _download_ those gems and use them to
-resolve the dependencies of every gem in your Gemfile(5).
+While the `without` setting will skip _installing_ the gems in the
+specified groups, `bundle install` will still _download_ those gems and use them
+to resolve the dependencies of every gem in your Gemfile(5).
 
 This is so that installing a different set of groups on another
  machine (such as a production server) will not change the
@@ -262,7 +193,7 @@ For a simple illustration, consider the following Gemfile(5):
 In this case, `sinatra` depends on any version of Rack (`>= 1.0`), while
 `rack-perftools-profiler` depends on 1.x (`~> 1.0`).
 
-When you run `bundle install --without production` in development, we
+When you configure `bundle config without production` in development, we
 look at the dependencies of `rack-perftools-profiler` as well. That way,
 you do not spend all your time developing against Rack 2.0, using new
 APIs unavailable in Rack 1.x, only to have Bundler switch to Rack 1.2
diff --git a/lib/bundler/man/bundle-issue.1 b/lib/bundler/man/bundle-issue.1
new file mode 100644
index 0000000000..3af277ef86
--- /dev/null
+++ b/lib/bundler/man/bundle-issue.1
@@ -0,0 +1,45 @@
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-ISSUE" "1" "May 2026" ""
+.SH "NAME"
+\fBbundle\-issue\fR \- Get help reporting Bundler issues
+.SH "SYNOPSIS"
+\fBbundle issue\fR
+.SH "DESCRIPTION"
+Provides guidance on reporting Bundler issues and outputs detailed system information that should be included when filing a bug report\. This command:
+.IP "1." 4
+Displays links to troubleshooting resources
+.IP "2." 4
+Shows instructions for reporting issues
+.IP "3." 4
+Outputs comprehensive environment information needed for debugging
+.IP "" 0
+.P
+The command helps ensure that bug reports include all necessary system details for effective troubleshooting\.
+.SH "OUTPUT"
+The command outputs several sections:
+.IP "\(bu" 4
+Troubleshooting links and resources
+.IP "\(bu" 4
+Link to the GitHub issue template
+.IP "\(bu" 4
+Environment information including: Bundler version and platforms, Ruby version and configuration, RubyGems version and paths, Development tool versions (Git, RVM, rbenv, chruby)
+.IP "\(bu" 4
+Bundler build metadata
+.IP "\(bu" 4
+Current Bundler settings
+.IP "\(bu" 4
+Bundle Doctor output
+.IP "" 0
+.SH "EXAMPLES"
+Get issue reporting information:
+.IP "" 4
+.nf
+$ bundle issue
+.fi
+.IP "" 0
+.SH "SEE ALSO"
+.IP "\(bu" 4
+bundle\-doctor(1)
+.IP "" 0
+
diff --git a/lib/bundler/man/bundle-issue.1.ronn b/lib/bundler/man/bundle-issue.1.ronn
new file mode 100644
index 0000000000..37f676a354
--- /dev/null
+++ b/lib/bundler/man/bundle-issue.1.ronn
@@ -0,0 +1,37 @@
+bundle-issue(1) -- Get help reporting Bundler issues
+====================================================
+
+## SYNOPSIS
+
+`bundle issue`
+
+## DESCRIPTION
+
+Provides guidance on reporting Bundler issues and outputs detailed system information that should be included when filing a bug report. This command:
+
+1. Displays links to troubleshooting resources
+2. Shows instructions for reporting issues
+3. Outputs comprehensive environment information needed for debugging
+
+The command helps ensure that bug reports include all necessary system details for effective troubleshooting.
+
+## OUTPUT
+
+The command outputs several sections:
+
+* Troubleshooting links and resources
+* Link to the GitHub issue template
+* Environment information including: Bundler version and platforms, Ruby version and configuration, RubyGems version and paths, Development tool versions (Git, RVM, rbenv, chruby)
+* Bundler build metadata
+* Current Bundler settings
+* Bundle Doctor output
+
+## EXAMPLES
+
+Get issue reporting information:
+
+    $ bundle issue
+
+## SEE ALSO
+
+* bundle-doctor(1)
diff --git a/lib/bundler/man/bundle-licenses.1 b/lib/bundler/man/bundle-licenses.1
new file mode 100644
index 0000000000..ab5996d2be
--- /dev/null
+++ b/lib/bundler/man/bundle-licenses.1
@@ -0,0 +1,9 @@
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-LICENSES" "1" "May 2026" ""
+.SH "NAME"
+\fBbundle\-licenses\fR \- Print the license of all gems in the bundle
+.SH "SYNOPSIS"
+\fBbundle licenses\fR
+.SH "DESCRIPTION"
+Prints the license of all gems in the bundle\.
diff --git a/lib/bundler/man/bundle-licenses.1.ronn b/lib/bundler/man/bundle-licenses.1.ronn
new file mode 100644
index 0000000000..91caba6c2a
--- /dev/null
+++ b/lib/bundler/man/bundle-licenses.1.ronn
@@ -0,0 +1,10 @@
+bundle-licenses(1) -- Print the license of all gems in the bundle
+=================================================================
+
+## SYNOPSIS
+
+`bundle licenses`
+
+## DESCRIPTION
+
+Prints the license of all gems in the bundle.
diff --git a/lib/bundler/man/bundle-list.1 b/lib/bundler/man/bundle-list.1
index 21723608cc..e759e0d449 100644
--- a/lib/bundler/man/bundle-list.1
+++ b/lib/bundler/man/bundle-list.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-LIST" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-LIST" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-list\fR \- List all the gems in the bundle
 .SH "SYNOPSIS"
@@ -19,6 +19,8 @@ bundle list \-\-without\-group test
 bundle list \-\-only\-group dev
 .P
 bundle list \-\-only\-group dev test \-\-paths
+.P
+bundle list \-\-format json
 .SH "OPTIONS"
 .TP
 \fB\-\-name\-only\fR
@@ -32,4 +34,7 @@ A space\-separated list of groups of gems to skip during printing\.
 .TP
 \fB\-\-only\-group=<list>\fR
 A space\-separated list of groups of gems to print\.
+.TP
+\fB\-\-format=FORMAT\fR
+Format output ('json' is the only supported format)
 
diff --git a/lib/bundler/man/bundle-list.1.ronn b/lib/bundler/man/bundle-list.1.ronn
index dc058ecd5f..9ec2b13282 100644
--- a/lib/bundler/man/bundle-list.1.ronn
+++ b/lib/bundler/man/bundle-list.1.ronn
@@ -1,5 +1,5 @@
 bundle-list(1) -- List all the gems in the bundle
-=========================================================================
+=================================================
 
 ## SYNOPSIS
 
@@ -21,13 +21,21 @@ bundle list --only-group dev
 
 bundle list --only-group dev test --paths
 
+bundle list --format json
+
 ## OPTIONS
 
 * `--name-only`:
   Print only the name of each gem.
+
 * `--paths`:
   Print the path to each gem in the bundle.
+
 * `--without-group=<list>`:
   A space-separated list of groups of gems to skip during printing.
+
 * `--only-group=<list>`:
   A space-separated list of groups of gems to print.
+
+* `--format=FORMAT`:
+  Format output ('json' is the only supported format)
diff --git a/lib/bundler/man/bundle-lock.1 b/lib/bundler/man/bundle-lock.1
index 8b81b7732f..396c8ff6ca 100644
--- a/lib/bundler/man/bundle-lock.1
+++ b/lib/bundler/man/bundle-lock.1
@@ -1,35 +1,47 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-LOCK" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-LOCK" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-lock\fR \- Creates / Updates a lockfile without installing
 .SH "SYNOPSIS"
-\fBbundle lock\fR [\-\-update] [\-\-local] [\-\-print] [\-\-lockfile=PATH] [\-\-full\-index] [\-\-add\-platform] [\-\-remove\-platform] [\-\-patch] [\-\-minor] [\-\-major] [\-\-strict] [\-\-conservative]
+\fBbundle lock\fR [\-\-update] [\-\-bundler[=BUNDLER]] [\-\-local] [\-\-print] [\-\-lockfile=PATH] [\-\-full\-index] [\-\-gemfile=GEMFILE] [\-\-add\-checksums] [\-\-add\-platform] [\-\-remove\-platform] [\-\-normalize\-platforms] [\-\-patch] [\-\-minor] [\-\-major] [\-\-pre] [\-\-strict] [\-\-conservative]
 .SH "DESCRIPTION"
 Lock the gems specified in Gemfile\.
 .SH "OPTIONS"
 .TP
-\fB\-\-update=<*gems>\fR
+\fB\-\-update[=<list>]\fR
 Ignores the existing lockfile\. Resolve then updates lockfile\. Taking a list of gems or updating all gems if no list is given\.
 .TP
+\fB\-\-bundler[=BUNDLER]\fR
+Update the locked version of bundler to the given version or the latest version if no version is given\.
+.TP
 \fB\-\-local\fR
 Do not attempt to connect to \fBrubygems\.org\fR\. Instead, Bundler will use the gems already present in Rubygems' cache or in \fBvendor/cache\fR\. Note that if a appropriate platform\-specific gem exists on \fBrubygems\.org\fR it will not be found\.
 .TP
 \fB\-\-print\fR
 Prints the lockfile to STDOUT instead of writing to the file system\.
 .TP
-\fB\-\-lockfile=<path>\fR
+\fB\-\-lockfile=LOCKFILE\fR
 The path where the lockfile should be written to\.
 .TP
 \fB\-\-full\-index\fR
 Fall back to using the single\-file index of all gems\.
 .TP
-\fB\-\-add\-platform\fR
+\fB\-\-gemfile=GEMFILE\fR
+Use the specified gemfile instead of [\fBGemfile(5)\fR][Gemfile(5)]\.
+.TP
+\fB\-\-add\-checksums\fR
+Add checksums to the lockfile\.
+.TP
+\fB\-\-add\-platform=<list>\fR
 Add a new platform to the lockfile, re\-resolving for the addition of that platform\.
 .TP
-\fB\-\-remove\-platform\fR
+\fB\-\-remove\-platform=<list>\fR
 Remove a platform from the lockfile\.
 .TP
+\fB\-\-normalize\-platforms\fR
+Normalize lockfile platforms\.
+.TP
 \fB\-\-patch\fR
 If updating, prefer updating only to next patch version\.
 .TP
@@ -39,6 +51,9 @@ If updating, prefer updating only to next minor version\.
 \fB\-\-major\fR
 If updating, prefer updating to next major version (default)\.
 .TP
+\fB\-\-pre\fR
+If updating, always choose the highest allowed version, regardless of prerelease status\.
+.TP
 \fB\-\-strict\fR
 If updating, do not allow any gem to be updated past latest \-\-patch | \-\-minor | \-\-major\.
 .TP
diff --git a/lib/bundler/man/bundle-lock.1.ronn b/lib/bundler/man/bundle-lock.1.ronn
index 3aa5920f5a..6d3e63c982 100644
--- a/lib/bundler/man/bundle-lock.1.ronn
+++ b/lib/bundler/man/bundle-lock.1.ronn
@@ -4,15 +4,20 @@ bundle-lock(1) -- Creates / Updates a lockfile without installing
 ## SYNOPSIS
 
 `bundle lock` [--update]
+              [--bundler[=BUNDLER]]
               [--local]
               [--print]
               [--lockfile=PATH]
               [--full-index]
+              [--gemfile=GEMFILE]
+              [--add-checksums]
               [--add-platform]
               [--remove-platform]
+              [--normalize-platforms]
               [--patch]
               [--minor]
               [--major]
+              [--pre]
               [--strict]
               [--conservative]
 
@@ -22,10 +27,14 @@ Lock the gems specified in Gemfile.
 
 ## OPTIONS
 
-* `--update=<*gems>`:
+* `--update[=<list>]`:
   Ignores the existing lockfile. Resolve then updates lockfile. Taking a list
   of gems or updating all gems if no list is given.
 
+* `--bundler[=BUNDLER]`:
+  Update the locked version of bundler to the given version or the latest
+  version if no version is given.
+
 * `--local`:
   Do not attempt to connect to `rubygems.org`. Instead, Bundler will use the
   gems already present in Rubygems' cache or in `vendor/cache`. Note that if a
@@ -35,19 +44,28 @@ Lock the gems specified in Gemfile.
 * `--print`:
   Prints the lockfile to STDOUT instead of writing to the file system.
 
-* `--lockfile=<path>`:
+* `--lockfile=LOCKFILE`:
   The path where the lockfile should be written to.
 
 * `--full-index`:
   Fall back to using the single-file index of all gems.
 
-* `--add-platform`:
+* `--gemfile=GEMFILE`:
+  Use the specified gemfile instead of [`Gemfile(5)`][Gemfile(5)].
+
+* `--add-checksums`:
+  Add checksums to the lockfile.
+
+* `--add-platform=<list>`:
   Add a new platform to the lockfile, re-resolving for the addition of that
   platform.
 
-* `--remove-platform`:
+* `--remove-platform=<list>`:
   Remove a platform from the lockfile.
 
+* `--normalize-platforms`:
+  Normalize lockfile platforms.
+
 * `--patch`:
   If updating, prefer updating only to next patch version.
 
@@ -57,6 +75,9 @@ Lock the gems specified in Gemfile.
 * `--major`:
   If updating, prefer updating to next major version (default).
 
+* `--pre`:
+  If updating, always choose the highest allowed version, regardless of prerelease status.
+
 * `--strict`:
   If updating, do not allow any gem to be updated past latest --patch | --minor | --major.
 
diff --git a/lib/bundler/man/bundle-open.1 b/lib/bundler/man/bundle-open.1
index 41a8804a09..2aab59f14b 100644
--- a/lib/bundler/man/bundle-open.1
+++ b/lib/bundler/man/bundle-open.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-OPEN" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-OPEN" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-open\fR \- Opens the source directory for a gem in your bundle
 .SH "SYNOPSIS"
@@ -27,6 +27,6 @@ bundle open 'rack' \-\-path 'README\.md'
 Will open the README\.md file of the 'rack' gem source in your bundle\.
 .SH "OPTIONS"
 .TP
-\fB\-\-path\fR
+\fB\-\-path[=PATH]\fR
 Specify GEM source relative path to open\.
 
diff --git a/lib/bundler/man/bundle-open.1.ronn b/lib/bundler/man/bundle-open.1.ronn
index a857f3a965..24dbe97e44 100644
--- a/lib/bundler/man/bundle-open.1.ronn
+++ b/lib/bundler/man/bundle-open.1.ronn
@@ -23,5 +23,6 @@ Will open the source directory for the 'rack' gem in your bundle.
 Will open the README.md file of the 'rack' gem source in your bundle.
 
 ## OPTIONS
-* `--path`:
+
+* `--path[=PATH]`:
   Specify GEM source relative path to open.
diff --git a/lib/bundler/man/bundle-outdated.1 b/lib/bundler/man/bundle-outdated.1
index 838fce45cd..c2f8086e24 100644
--- a/lib/bundler/man/bundle-outdated.1
+++ b/lib/bundler/man/bundle-outdated.1
@@ -1,10 +1,10 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-OUTDATED" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-OUTDATED" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-outdated\fR \- List installed gems with newer versions available
 .SH "SYNOPSIS"
-\fBbundle outdated\fR [GEM] [\-\-local] [\-\-pre] [\-\-source] [\-\-strict] [\-\-parseable | \-\-porcelain] [\-\-group=GROUP] [\-\-groups] [\-\-patch|\-\-minor|\-\-major] [\-\-filter\-major] [\-\-filter\-minor] [\-\-filter\-patch] [\-\-only\-explicit]
+\fBbundle outdated\fR [GEM] [\-\-local] [\-\-pre] [\-\-source] [\-\-filter\-strict | \-\-strict] [\-\-update\-strict] [\-\-parseable | \-\-porcelain] [\-\-group=GROUP] [\-\-groups] [\-\-patch|\-\-minor|\-\-major] [\-\-filter\-major] [\-\-filter\-minor] [\-\-filter\-patch] [\-\-only\-explicit] [\-\-cooldown=NUMBER]
 .SH "DESCRIPTION"
 Outdated lists the names and versions of gems that have a newer version available in the given source\. Calling outdated with [GEM [GEM]] will only check for newer versions of the given gems\. Prerelease gems are ignored by default\. If your gems are up to date, Bundler will exit with a status of 0\. Otherwise, it will exit 1\.
 .SH "OPTIONS"
@@ -15,16 +15,19 @@ Do not attempt to fetch gems remotely and use the gem cache instead\.
 \fB\-\-pre\fR
 Check for newer pre\-release gems\.
 .TP
-\fB\-\-source\fR
+\fB\-\-source=<list>\fR
 Check against a specific source\.
 .TP
-\fB\-\-strict\fR
+\fB\-\-filter\-strict\fR, \fB\-\-strict\fR
 Only list newer versions allowed by your Gemfile requirements, also respecting conservative update flags (\-\-patch, \-\-minor, \-\-major)\.
 .TP
+\fB\-\-update\-strict\fR
+Strict conservative resolution, do not allow any gem to be updated past latest \-\-patch | \-\-minor | \-\-major\.
+.TP
 \fB\-\-parseable\fR, \fB\-\-porcelain\fR
 Use minimal formatting for more parseable output\.
 .TP
-\fB\-\-group\fR
+\fB\-\-group=GROUP\fR
 List gems from a specific group\.
 .TP
 \fB\-\-groups\fR
@@ -50,6 +53,9 @@ Only list patch newer versions\.
 .TP
 \fB\-\-only\-explicit\fR
 Only list gems specified in your Gemfile, not their dependencies\.
+.TP
+\fB\-\-cooldown=<number>\fR
+Annotate (rather than hide) versions that are still inside the cooldown window of \fInumber\fR days\. The prose output appends "in cooldown for Nd more days" and the table form adds "(cooldown Nd)" to the Latest column\. See \fBcooldown\fR in bundle\-config(1)\.
 .SH "PATCH LEVEL OPTIONS"
 See bundle update(1) \fIbundle\-update\.1\.html\fR for details\.
 .SH "FILTERING OUTPUT"
@@ -58,42 +64,42 @@ The 3 filtering options do not affect the resolution of versions, merely what ve
 If the regular output shows the following:
 .IP "" 4
 .nf
-* Gem       Current  Latest  Requested  Groups
-* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test
-* hashie    1\.2\.0    3\.4\.6   = 1\.2\.0    default
-* headless  2\.2\.3    2\.3\.1   = 2\.2\.3    test
+* Gem       Current  Latest  Requested  Groups              Release Date
+* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test   2024\-02\-05
+* hashie    1\.2\.0    3\.4\.6   = 1\.2\.0    default             2023\-11\-10
+* headless  2\.2\.3    2\.3\.1   = 2\.2\.3    test                2022\-08\-19
 .fi
 .IP "" 0
 .P
 \fB\-\-filter\-major\fR would only show:
 .IP "" 4
 .nf
-* Gem       Current  Latest  Requested  Groups
-* hashie    1\.2\.0    3\.4\.6   = 1\.2\.0    default
+* Gem       Current  Latest  Requested  Groups   Release Date
+* hashie    1\.2\.0    3\.4\.6   = 1\.2\.0    default  2023\-11\-10
 .fi
 .IP "" 0
 .P
 \fB\-\-filter\-minor\fR would only show:
 .IP "" 4
 .nf
-* Gem       Current  Latest  Requested  Groups
-* headless  2\.2\.3    2\.3\.1   = 2\.2\.3    test
+* Gem       Current  Latest  Requested  Groups  Release Date
+* headless  2\.2\.3    2\.3\.1   = 2\.2\.3    test    2022\-08\-19
 .fi
 .IP "" 0
 .P
 \fB\-\-filter\-patch\fR would only show:
 .IP "" 4
 .nf
-* Gem       Current  Latest  Requested  Groups
-* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test
+* Gem       Current  Latest  Requested  Groups              Release Date
+* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test   2024\-02\-05
 .fi
 .IP "" 0
 .P
 Filter options can be combined\. \fB\-\-filter\-minor\fR and \fB\-\-filter\-patch\fR would show:
 .IP "" 4
 .nf
-* Gem       Current  Latest  Requested  Groups
-* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test
+* Gem       Current  Latest  Requested  Groups              Release Date
+* faker     1\.6\.5    1\.6\.6   ~> 1\.4     development, test   2024\-02\-05
 .fi
 .IP "" 0
 .P
diff --git a/lib/bundler/man/bundle-outdated.1.ronn b/lib/bundler/man/bundle-outdated.1.ronn
index 4ac65d0532..e5badac2e9 100644
--- a/lib/bundler/man/bundle-outdated.1.ronn
+++ b/lib/bundler/man/bundle-outdated.1.ronn
@@ -6,7 +6,8 @@ bundle-outdated(1) -- List installed gems with newer versions available
 `bundle outdated` [GEM] [--local]
                         [--pre]
                         [--source]
-                        [--strict]
+                        [--filter-strict | --strict]
+                        [--update-strict]
                         [--parseable | --porcelain]
                         [--group=GROUP]
                         [--groups]
@@ -15,6 +16,7 @@ bundle-outdated(1) -- List installed gems with newer versions available
                         [--filter-minor]
                         [--filter-patch]
                         [--only-explicit]
+                        [--cooldown=NUMBER]
 
 ## DESCRIPTION
 
@@ -31,16 +33,19 @@ are up to date, Bundler will exit with a status of 0. Otherwise, it will exit 1.
 * `--pre`:
   Check for newer pre-release gems.
 
-* `--source`:
+* `--source=<list>`:
   Check against a specific source.
 
-* `--strict`:
+* `--filter-strict`, `--strict`:
   Only list newer versions allowed by your Gemfile requirements, also respecting conservative update flags (--patch, --minor, --major).
 
+* `--update-strict`:
+  Strict conservative resolution, do not allow any gem to be updated past latest --patch | --minor | --major.
+
 * `--parseable`, `--porcelain`:
    Use minimal formatting for more parseable output.
 
-* `--group`:
+* `--group=GROUP`:
   List gems from a specific group.
 
 * `--groups`:
@@ -67,6 +72,12 @@ are up to date, Bundler will exit with a status of 0. Otherwise, it will exit 1.
 * `--only-explicit`:
   Only list gems specified in your Gemfile, not their dependencies.
 
+* `--cooldown=<number>`:
+  Annotate (rather than hide) versions that are still inside the
+  cooldown window of <number> days. The prose output appends "in
+  cooldown for Nd more days" and the table form adds "(cooldown Nd)" to
+  the Latest column. See `cooldown` in bundle-config(1).
+
 ## PATCH LEVEL OPTIONS
 
 See [bundle update(1)](bundle-update.1.html) for details.
@@ -78,29 +89,29 @@ in the output.
 
 If the regular output shows the following:
 
-    * Gem       Current  Latest  Requested  Groups
-    * faker     1.6.5    1.6.6   ~> 1.4     development, test
-    * hashie    1.2.0    3.4.6   = 1.2.0    default
-    * headless  2.2.3    2.3.1   = 2.2.3    test
+    * Gem       Current  Latest  Requested  Groups              Release Date
+    * faker     1.6.5    1.6.6   ~> 1.4     development, test   2024-02-05
+    * hashie    1.2.0    3.4.6   = 1.2.0    default             2023-11-10
+    * headless  2.2.3    2.3.1   = 2.2.3    test                2022-08-19
 
 `--filter-major` would only show:
 
-    * Gem       Current  Latest  Requested  Groups
-    * hashie    1.2.0    3.4.6   = 1.2.0    default
+    * Gem       Current  Latest  Requested  Groups   Release Date
+    * hashie    1.2.0    3.4.6   = 1.2.0    default  2023-11-10
 
 `--filter-minor` would only show:
 
-    * Gem       Current  Latest  Requested  Groups
-    * headless  2.2.3    2.3.1   = 2.2.3    test
+    * Gem       Current  Latest  Requested  Groups  Release Date
+    * headless  2.2.3    2.3.1   = 2.2.3    test    2022-08-19
 
 `--filter-patch` would only show:
 
-    * Gem       Current  Latest  Requested  Groups
-    * faker     1.6.5    1.6.6   ~> 1.4     development, test
+    * Gem       Current  Latest  Requested  Groups              Release Date
+    * faker     1.6.5    1.6.6   ~> 1.4     development, test   2024-02-05
 
 Filter options can be combined. `--filter-minor` and `--filter-patch` would show:
 
-    * Gem       Current  Latest  Requested  Groups
-    * faker     1.6.5    1.6.6   ~> 1.4     development, test
+    * Gem       Current  Latest  Requested  Groups              Release Date
+    * faker     1.6.5    1.6.6   ~> 1.4     development, test   2024-02-05
 
 Combining all three `filter` options would be the same result as providing none of them.
diff --git a/lib/bundler/man/bundle-platform.1 b/lib/bundler/man/bundle-platform.1
index 0dbce7a7a4..39b7111263 100644
--- a/lib/bundler/man/bundle-platform.1
+++ b/lib/bundler/man/bundle-platform.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-PLATFORM" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-PLATFORM" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-platform\fR \- Displays platform compatibility information
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-plugin.1 b/lib/bundler/man/bundle-plugin.1
index 1290abb3ba..d182c7789b 100644
--- a/lib/bundler/man/bundle-plugin.1
+++ b/lib/bundler/man/bundle-plugin.1
@@ -1,12 +1,12 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-PLUGIN" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-PLUGIN" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-plugin\fR \- Manage Bundler plugins
 .SH "SYNOPSIS"
-\fBbundle plugin\fR install PLUGINS [\-\-source=\fISOURCE\fR] [\-\-version=\fIversion\fR] [\-\-git=\fIgit\-url\fR] [\-\-branch=\fIbranch\fR|\-\-ref=\fIrev\fR] [\-\-path=\fIpath\fR]
+\fBbundle plugin\fR install PLUGINS [\-\-source=SOURCE] [\-\-version=VERSION] [\-\-git=GIT] [\-\-branch=BRANCH|\-\-ref=REF] [\-\-path=PATH]
 .br
-\fBbundle plugin\fR uninstall PLUGINS
+\fBbundle plugin\fR uninstall PLUGINS [\-\-all]
 .br
 \fBbundle plugin\fR list
 .br
@@ -16,18 +16,23 @@ You can install, uninstall, and list plugin(s) with this command to extend funct
 .SH "SUB\-COMMANDS"
 .SS "install"
 Install the given plugin(s)\.
+.P
+For example, \fBbundle plugin install bundler\-graph\fR will install bundler\-graph gem from globally configured sources (defaults to RubyGems\.org)\. Note that the global source specified in Gemfile is ignored\.
+.P
+\fBOPTIONS\fR
 .TP
-\fBbundle plugin install bundler\-graph\fR
-Install bundler\-graph gem from globally configured sources (defaults to RubyGems\.org)\. The global source, specified in source in Gemfile is ignored\.
-.TP
-\fBbundle plugin install bundler\-graph \-\-source https://example\.com\fR
-Install bundler\-graph gem from example\.com\. The global source, specified in source in Gemfile is not considered\.
+\fB\-\-source=SOURCE\fR
+Install the plugin gem from a specific source, rather than from globally configured sources\.
+.IP
+Example: \fBbundle plugin install bundler\-graph \-\-source https://example\.com\fR
 .TP
-\fBbundle plugin install bundler\-graph \-\-version 0\.2\.1\fR
-You can specify the version of the gem via \fB\-\-version\fR\.
+\fB\-\-version=VERSION\fR
+Specify a version of the plugin gem to install via \fB\-\-version\fR\.
+.IP
+Example: \fBbundle plugin install bundler\-graph \-\-version 0\.2\.1\fR
 .TP
-\fBbundle plugin install bundler\-graph \-\-git https://github\.com/rubygems/bundler\-graph\fR
-Install bundler\-graph gem from Git repository\. You can use standard Git URLs like:
+\fB\-\-git=GIT\fR
+Install the plugin gem from a Git repository\. You can use standard Git URLs like:
 .IP
 \fBssh://[user@]host\.xz[:port]/path/to/repo\.git\fR
 .br
@@ -37,12 +42,25 @@ Install bundler\-graph gem from Git repository\. You can use standard Git URLs l
 .br
 \fBfile:///path/to/repo\fR
 .IP
-When you specify \fB\-\-git\fR, you can use \fB\-\-branch\fR or \fB\-\-ref\fR to specify any branch, tag, or commit hash (revision) to use\.
+Example: \fBbundle plugin install bundler\-graph \-\-git https://github\.com/rubygems/bundler\-graph\fR
 .TP
-\fBbundle plugin install bundler\-graph \-\-path \.\./bundler\-graph\fR
-Install bundler\-graph gem from a local path\.
+\fB\-\-branch=BRANCH\fR
+When you specify \fB\-\-git\fR, you can use \fB\-\-branch\fR to use\.
+.TP
+\fB\-\-ref=REF\fR
+When you specify \fB\-\-git\fR, you can use \fB\-\-ref\fR to specify any tag, or commit hash (revision) to use\.
+.TP
+\fB\-\-path=PATH\fR
+Install the plugin gem from a local path\.
+.IP
+Example: \fBbundle plugin install bundler\-graph \-\-path \.\./bundler\-graph\fR
 .SS "uninstall"
 Uninstall the plugin(s) specified in PLUGINS\.
+.P
+\fBOPTIONS\fR
+.TP
+\fB\-\-all\fR
+Uninstall all the installed plugins\. If no plugin is installed, then it does nothing\.
 .SS "list"
 List the installed plugins and available commands\.
 .P
diff --git a/lib/bundler/man/bundle-plugin.1.ronn b/lib/bundler/man/bundle-plugin.1.ronn
index b0a34660ea..b54e0c08b4 100644
--- a/lib/bundler/man/bundle-plugin.1.ronn
+++ b/lib/bundler/man/bundle-plugin.1.ronn
@@ -3,10 +3,10 @@ bundle-plugin(1) -- Manage Bundler plugins
 
 ## SYNOPSIS
 
-`bundle plugin` install PLUGINS [--source=<SOURCE>] [--version=<version>]
-                              [--git=<git-url>] [--branch=<branch>|--ref=<rev>]
-                              [--path=<path>]<br>
-`bundle plugin` uninstall PLUGINS<br>
+`bundle plugin` install PLUGINS [--source=SOURCE] [--version=VERSION]
+                              [--git=GIT] [--branch=BRANCH|--ref=REF]
+                              [--path=PATH]<br>
+`bundle plugin` uninstall PLUGINS [--all]<br>
 `bundle plugin` list<br>
 `bundle plugin` help [COMMAND]
 
@@ -20,32 +20,53 @@ You can install, uninstall, and list plugin(s) with this command to extend funct
 
 Install the given plugin(s).
 
-* `bundle plugin install bundler-graph`:
-  Install bundler-graph gem from globally configured sources (defaults to RubyGems.org). The global source, specified in source in Gemfile is ignored.
+For example, `bundle plugin install bundler-graph` will install bundler-graph
+gem from globally configured sources (defaults to RubyGems.org). Note that the
+global source specified in Gemfile is ignored.
 
-* `bundle plugin install bundler-graph --source https://example.com`:
-  Install bundler-graph gem from example.com. The global source, specified in source in Gemfile is not considered.
+**OPTIONS**
 
-* `bundle plugin install bundler-graph --version 0.2.1`:
-  You can specify the version of the gem via `--version`.
+* `--source=SOURCE`:
+  Install the plugin gem from a specific source, rather than from globally configured sources.
 
-* `bundle plugin install bundler-graph --git https://github.com/rubygems/bundler-graph`:
-  Install bundler-graph gem from Git repository. You can use standard Git URLs like:
+  Example: `bundle plugin install bundler-graph --source https://example.com`
+
+* `--version=VERSION`:
+  Specify a version of the plugin gem to install via `--version`.
+
+  Example: `bundle plugin install bundler-graph --version 0.2.1`
+
+* `--git=GIT`:
+  Install the plugin gem from a Git repository. You can use standard Git URLs like:
 
   `ssh://[user@]host.xz[:port]/path/to/repo.git`<br>
   `http[s]://host.xz[:port]/path/to/repo.git`<br>
   `/path/to/repo`<br>
   `file:///path/to/repo`
 
-  When you specify `--git`, you can use `--branch` or `--ref` to specify any branch, tag, or commit hash (revision) to use.
+  Example: `bundle plugin install bundler-graph --git https://github.com/rubygems/bundler-graph`
+
+* `--branch=BRANCH`:
+  When you specify `--git`, you can use `--branch`  to use.
 
-* `bundle plugin install bundler-graph --path ../bundler-graph`:
-  Install bundler-graph gem from a local path.
+* `--ref=REF`:
+  When you specify `--git`, you can use `--ref` to specify any tag, or commit
+  hash (revision) to use.
+
+* `--path=PATH`:
+  Install the plugin gem from a local path.
+
+  Example: `bundle plugin install bundler-graph --path ../bundler-graph`
 
 ### uninstall
 
 Uninstall the plugin(s) specified in PLUGINS.
 
+**OPTIONS**
+
+* `--all`:
+  Uninstall all the installed plugins. If no plugin is installed, then it does nothing.
+
 ### list
 
 List the installed plugins and available commands.
diff --git a/lib/bundler/man/bundle-pristine.1 b/lib/bundler/man/bundle-pristine.1
index bf4a7cd323..f6cc066571 100644
--- a/lib/bundler/man/bundle-pristine.1
+++ b/lib/bundler/man/bundle-pristine.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-PRISTINE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-PRISTINE" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-pristine\fR \- Restores installed gems to their pristine condition
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-pristine.1.ronn b/lib/bundler/man/bundle-pristine.1.ronn
index e2d6b6a348..984debeb3d 100644
--- a/lib/bundler/man/bundle-pristine.1.ronn
+++ b/lib/bundler/man/bundle-pristine.1.ronn
@@ -1,5 +1,5 @@
 bundle-pristine(1) -- Restores installed gems to their pristine condition
-===========================================================================
+=========================================================================
 
 ## SYNOPSIS
 
diff --git a/lib/bundler/man/bundle-remove.1 b/lib/bundler/man/bundle-remove.1
index c3c96b416d..2ca40e74db 100644
--- a/lib/bundler/man/bundle-remove.1
+++ b/lib/bundler/man/bundle-remove.1
@@ -1,21 +1,15 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-REMOVE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-REMOVE" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-remove\fR \- Removes gems from the Gemfile
 .SH "SYNOPSIS"
-\fBbundle remove [GEM [GEM \|\.\|\.\|\.]] [\-\-install]\fR
+`bundle remove [GEM [GEM \|\.\|\.\|\.]]
 .SH "DESCRIPTION"
 Removes the given gems from the Gemfile while ensuring that the resulting Gemfile is still valid\. If a gem cannot be removed, a warning is printed\. If a gem is already absent from the Gemfile, and error is raised\.
-.SH "OPTIONS"
-.TP
-\fB\-\-install\fR
-Runs \fBbundle install\fR after the given gems have been removed from the Gemfile, which ensures that both the lockfile and the installed gems on disk are also updated to remove the given gem(s)\.
 .P
 Example:
 .P
 bundle remove rails
 .P
 bundle remove rails rack
-.P
-bundle remove rails rack \-\-install
diff --git a/lib/bundler/man/bundle-remove.1.ronn b/lib/bundler/man/bundle-remove.1.ronn
index 40a239b4a2..49cb4dc1fd 100644
--- a/lib/bundler/man/bundle-remove.1.ronn
+++ b/lib/bundler/man/bundle-remove.1.ronn
@@ -1,23 +1,16 @@
 bundle-remove(1) -- Removes gems from the Gemfile
-===========================================================================
+=================================================
 
 ## SYNOPSIS
 
-`bundle remove [GEM [GEM ...]] [--install]`
+`bundle remove [GEM [GEM ...]]
 
 ## DESCRIPTION
 
 Removes the given gems from the Gemfile while ensuring that the resulting Gemfile is still valid. If a gem cannot be removed, a warning is printed. If a gem is already absent from the Gemfile, and error is raised.
 
-## OPTIONS
-
-* `--install`:
-  Runs `bundle install` after the given gems have been removed from the Gemfile, which ensures that both the lockfile and the installed gems on disk are also updated to remove the given gem(s).
-
 Example:
 
 bundle remove rails
 
 bundle remove rails rack
-
-bundle remove rails rack --install
diff --git a/lib/bundler/man/bundle-show.1 b/lib/bundler/man/bundle-show.1
index c054875efd..a2142694b8 100644
--- a/lib/bundler/man/bundle-show.1
+++ b/lib/bundler/man/bundle-show.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-SHOW" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-SHOW" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-show\fR \- Shows all the gems in your bundle, or the path to a gem
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-update.1 b/lib/bundler/man/bundle-update.1
index acd80ec75c..94161083fc 100644
--- a/lib/bundler/man/bundle-update.1
+++ b/lib/bundler/man/bundle-update.1
@@ -1,10 +1,10 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-UPDATE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-UPDATE" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-update\fR \- Update your gems to the latest available versions
 .SH "SYNOPSIS"
-\fBbundle update\fR \fI*gems\fR [\-\-all] [\-\-group=NAME] [\-\-source=NAME] [\-\-local] [\-\-ruby] [\-\-bundler[=VERSION]] [\-\-full\-index] [\-\-jobs=JOBS] [\-\-quiet] [\-\-patch|\-\-minor|\-\-major] [\-\-redownload] [\-\-strict] [\-\-conservative]
+\fBbundle update\fR \fI*gems\fR [\-\-all] [\-\-group=NAME] [\-\-source=NAME] [\-\-local] [\-\-ruby] [\-\-bundler[=VERSION]] [\-\-cooldown=NUMBER] [\-\-force] [\-\-full\-index] [\-\-gemfile=GEMFILE] [\-\-jobs=NUMBER] [\-\-quiet] [\-\-patch|\-\-minor|\-\-major] [\-\-pre] [\-\-strict] [\-\-conservative]
 .SH "DESCRIPTION"
 Update the gems specified (all gems, if \fB\-\-all\fR flag is used), ignoring the previously installed gems specified in the \fBGemfile\.lock\fR\. In general, you should use bundle install(1) \fIbundle\-install\.1\.html\fR to install the same exact gems and versions across machines\.
 .P
@@ -14,10 +14,10 @@ You would use \fBbundle update\fR to explicitly update the version of a gem\.
 \fB\-\-all\fR
 Update all gems specified in Gemfile\.
 .TP
-\fB\-\-group=<name>\fR, \fB\-g=[<name>]\fR
+\fB\-\-group=<list>\fR, \fB\-g=<list>\fR
 Only update the gems in the specified group\. For instance, you can update all gems in the development group with \fBbundle update \-\-group development\fR\. You can also call \fBbundle update rails \-\-group test\fR to update the rails gem and all gems in the test group, for example\.
 .TP
-\fB\-\-source=<name>\fR
+\fB\-\-source=<list>\fR
 The name of a \fB:git\fR or \fB:path\fR source used in the Gemfile(5)\. For instance, with a \fB:git\fR source of \fBhttp://github\.com/rails/rails\.git\fR, you would call \fBbundle update \-\-source rails\fR
 .TP
 \fB\-\-local\fR
@@ -26,13 +26,19 @@ Do not attempt to fetch gems remotely and use the gem cache instead\.
 \fB\-\-ruby\fR
 Update the locked version of Ruby to the current version of Ruby\.
 .TP
-\fB\-\-bundler\fR
+\fB\-\-bundler[=BUNDLER]\fR
 Update the locked version of bundler to the invoked bundler version\.
 .TP
+\fB\-\-force\fR, \fB\-\-redownload\fR
+Force reinstalling every gem, even if already installed\.
+.TP
 \fB\-\-full\-index\fR
 Fall back to using the single\-file index of all gems\.
 .TP
-\fB\-\-jobs=[<number>]\fR, \fB\-j[<number>]\fR
+\fB\-\-gemfile=GEMFILE\fR
+Use the specified gemfile instead of [\fBGemfile(5)\fR][Gemfile(5)]\.
+.TP
+\fB\-\-jobs=<number>\fR, \fB\-j=<number>\fR
 Specify the number of jobs to run in parallel\. The default is the number of available processors\.
 .TP
 \fB\-\-retry=[<number>]\fR
@@ -41,9 +47,6 @@ Retry failed network or git requests for \fInumber\fR times\.
 \fB\-\-quiet\fR
 Only output warnings and errors\.
 .TP
-\fB\-\-redownload\fR
-Force downloading every gem\.
-.TP
 \fB\-\-patch\fR
 Prefer updating only to next patch version\.
 .TP
@@ -53,11 +56,17 @@ Prefer updating only to next minor version\.
 \fB\-\-major\fR
 Prefer updating to next major version (default)\.
 .TP
+\fB\-\-pre\fR
+Always choose the highest allowed version, regardless of prerelease status\.
+.TP
 \fB\-\-strict\fR
 Do not allow any gem to be updated past latest \fB\-\-patch\fR | \fB\-\-minor\fR | \fB\-\-major\fR\.
 .TP
 \fB\-\-conservative\fR
 Use bundle install conservative update behavior and do not allow indirect dependencies to be updated\.
+.TP
+\fB\-\-cooldown=<number>\fR
+Only consider gem versions published at least \fInumber\fR days ago when resolving\. Pass \fB0\fR to disable cooldown for this run, overriding any per\-source or global configuration\. Combine with \fB\-\-conservative\fR to minimize transitive churn when bypassing cooldown for an urgent update\. See \fBcooldown\fR in bundle\-config(1)\.
 .SH "UPDATING ALL GEMS"
 If you run \fBbundle update \-\-all\fR, bundler will ignore any previously installed gems and resolve all dependencies again based on the latest versions of all gems available in the sources\.
 .P
diff --git a/lib/bundler/man/bundle-update.1.ronn b/lib/bundler/man/bundle-update.1.ronn
index fe500cdc96..72fbf054d1 100644
--- a/lib/bundler/man/bundle-update.1.ronn
+++ b/lib/bundler/man/bundle-update.1.ronn
@@ -9,11 +9,14 @@ bundle-update(1) -- Update your gems to the latest available versions
                         [--local]
                         [--ruby]
                         [--bundler[=VERSION]]
+                        [--cooldown=NUMBER]
+                        [--force]
                         [--full-index]
-                        [--jobs=JOBS]
+                        [--gemfile=GEMFILE]
+                        [--jobs=NUMBER]
                         [--quiet]
                         [--patch|--minor|--major]
-                        [--redownload]
+                        [--pre]
                         [--strict]
                         [--conservative]
 
@@ -32,13 +35,13 @@ gem.
 * `--all`:
   Update all gems specified in Gemfile.
 
-* `--group=<name>`, `-g=[<name>]`:
+* `--group=<list>`, `-g=<list>`:
   Only update the gems in the specified group. For instance, you can update all gems
   in the development group with `bundle update --group development`. You can also
   call `bundle update rails --group test` to update the rails gem and all gems in
   the test group, for example.
 
-* `--source=<name>`:
+* `--source=<list>`:
   The name of a `:git` or `:path` source used in the Gemfile(5). For
   instance, with a `:git` source of `http://github.com/rails/rails.git`,
   you would call `bundle update --source rails`
@@ -49,13 +52,19 @@ gem.
 * `--ruby`:
   Update the locked version of Ruby to the current version of Ruby.
 
-* `--bundler`:
+* `--bundler[=BUNDLER]`:
   Update the locked version of bundler to the invoked bundler version.
 
+* `--force`, `--redownload`:
+  Force reinstalling every gem, even if already installed.
+
 * `--full-index`:
   Fall back to using the single-file index of all gems.
 
-* `--jobs=[<number>]`, `-j[<number>]`:
+* `--gemfile=GEMFILE`:
+  Use the specified gemfile instead of [`Gemfile(5)`][Gemfile(5)].
+
+* `--jobs=<number>`, `-j=<number>`:
   Specify the number of jobs to run in parallel. The default is the number of
   available processors.
 
@@ -65,9 +74,6 @@ gem.
 * `--quiet`:
   Only output warnings and errors.
 
-* `--redownload`:
-  Force downloading every gem.
-
 * `--patch`:
   Prefer updating only to next patch version.
 
@@ -77,12 +83,22 @@ gem.
 * `--major`:
   Prefer updating to next major version (default).
 
+* `--pre`:
+  Always choose the highest allowed version, regardless of prerelease status.
+
 * `--strict`:
   Do not allow any gem to be updated past latest `--patch` | `--minor` | `--major`.
 
 * `--conservative`:
   Use bundle install conservative update behavior and do not allow indirect dependencies to be updated.
 
+* `--cooldown=<number>`:
+  Only consider gem versions published at least <number> days ago when
+  resolving. Pass `0` to disable cooldown for this run, overriding any
+  per-source or global configuration. Combine with `--conservative` to
+  minimize transitive churn when bypassing cooldown for an urgent
+  update. See `cooldown` in bundle-config(1).
+
 ## UPDATING ALL GEMS
 
 If you run `bundle update --all`, bundler will ignore
diff --git a/lib/bundler/man/bundle-version.1 b/lib/bundler/man/bundle-version.1
index 44eaf92224..751a408312 100644
--- a/lib/bundler/man/bundle-version.1
+++ b/lib/bundler/man/bundle-version.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-VERSION" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE\-VERSION" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\-version\fR \- Prints Bundler version information
 .SH "SYNOPSIS"
diff --git a/lib/bundler/man/bundle-viz.1 b/lib/bundler/man/bundle-viz.1
deleted file mode 100644
index 77b902214c..0000000000
--- a/lib/bundler/man/bundle-viz.1
+++ /dev/null
@@ -1,30 +0,0 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE\-VIZ" "1" "May 2024" ""
-.SH "NAME"
-\fBbundle\-viz\fR \- Generates a visual dependency graph for your Gemfile
-.SH "SYNOPSIS"
-\fBbundle viz\fR [\-\-file=FILE] [\-\-format=FORMAT] [\-\-requirements] [\-\-version] [\-\-without=GROUP GROUP]
-.SH "DESCRIPTION"
-\fBviz\fR generates a PNG file of the current \fBGemfile(5)\fR as a dependency graph\. \fBviz\fR requires the ruby\-graphviz gem (and its dependencies)\.
-.P
-The associated gems must also be installed via \fBbundle install(1)\fR \fIbundle\-install\.1\.html\fR\.
-.P
-\fBviz\fR command was deprecated in Bundler 2\.2\. Use bundler\-graph plugin \fIhttps://github\.com/rubygems/bundler\-graph\fR instead\.
-.SH "OPTIONS"
-.TP
-\fB\-\-file\fR, \fB\-f\fR
-The name to use for the generated file\. See \fB\-\-format\fR option
-.TP
-\fB\-\-format\fR, \fB\-F\fR
-This is output format option\. Supported format is png, jpg, svg, dot \|\.\|\.\|\.
-.TP
-\fB\-\-requirements\fR, \fB\-R\fR
-Set to show the version of each required dependency\.
-.TP
-\fB\-\-version\fR, \fB\-v\fR
-Set to show each gem version\.
-.TP
-\fB\-\-without\fR, \fB\-W\fR
-Exclude gems that are part of the specified named group\.
-
diff --git a/lib/bundler/man/bundle-viz.1.ronn b/lib/bundler/man/bundle-viz.1.ronn
deleted file mode 100644
index f220256943..0000000000
--- a/lib/bundler/man/bundle-viz.1.ronn
+++ /dev/null
@@ -1,32 +0,0 @@
-bundle-viz(1) -- Generates a visual dependency graph for your Gemfile
-=====================================================================
-
-## SYNOPSIS
-
-`bundle viz` [--file=FILE]
-             [--format=FORMAT]
-             [--requirements]
-             [--version]
-             [--without=GROUP GROUP]
-
-## DESCRIPTION
-
-`viz` generates a PNG file of the current `Gemfile(5)` as a dependency graph.
-`viz` requires the ruby-graphviz gem (and its dependencies).
-
-The associated gems must also be installed via [`bundle install(1)`](bundle-install.1.html).
-
-`viz` command was deprecated in Bundler 2.2. Use [bundler-graph plugin](https://github.com/rubygems/bundler-graph) instead.
-
-## OPTIONS
-
-* `--file`, `-f`:
-  The name to use for the generated file. See `--format` option
-* `--format`, `-F`:
-  This is output format option. Supported format is png, jpg, svg, dot ...
-* `--requirements`, `-R`:
-  Set to show the version of each required dependency.
-* `--version`, `-v`:
-  Set to show each gem version.
-* `--without`, `-W`:
-  Exclude gems that are part of the specified named group.
diff --git a/lib/bundler/man/bundle.1 b/lib/bundler/man/bundle.1
index 199d1ce9fd..167815631a 100644
--- a/lib/bundler/man/bundle.1
+++ b/lib/bundler/man/bundle.1
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "BUNDLE" "1" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "BUNDLE" "1" "May 2026" ""
 .SH "NAME"
 \fBbundle\fR \- Ruby Dependency Management
 .SH "SYNOPSIS"
@@ -66,9 +66,6 @@ Open an installed gem in the editor
 \fBbundle lock(1)\fR \fIbundle\-lock\.1\.html\fR
 Generate a lockfile for your dependencies
 .TP
-\fBbundle viz(1)\fR \fIbundle\-viz\.1\.html\fR (deprecated)
-Generate a visual representation of your dependencies
-.TP
 \fBbundle init(1)\fR \fIbundle\-init\.1\.html\fR
 Generate a simple \fBGemfile\fR, placed in the current directory
 .TP
@@ -94,9 +91,3 @@ Manage Bundler plugins
 Prints Bundler version information
 .SH "PLUGINS"
 When running a command that isn't listed in PRIMARY COMMANDS or UTILITIES, Bundler will try to find an executable on your path named \fBbundler\-<command>\fR and execute it, passing down any extra arguments to it\.
-.SH "OBSOLETE"
-These commands are obsolete and should no longer be used:
-.IP "\(bu" 4
-\fBbundle inject(1)\fR
-.IP "" 0
-
diff --git a/lib/bundler/man/bundle.1.ronn b/lib/bundler/man/bundle.1.ronn
index 8245effabd..1c2b3df7af 100644
--- a/lib/bundler/man/bundle.1.ronn
+++ b/lib/bundler/man/bundle.1.ronn
@@ -76,9 +76,6 @@ We divide `bundle` subcommands into primary commands and utilities:
 * [`bundle lock(1)`](bundle-lock.1.html):
   Generate a lockfile for your dependencies
 
-* [`bundle viz(1)`](bundle-viz.1.html) (deprecated):
-  Generate a visual representation of your dependencies
-
 * [`bundle init(1)`](bundle-init.1.html):
   Generate a simple `Gemfile`, placed in the current directory
 
@@ -108,9 +105,3 @@ We divide `bundle` subcommands into primary commands and utilities:
 When running a command that isn't listed in PRIMARY COMMANDS or UTILITIES,
 Bundler will try to find an executable on your path named `bundler-<command>`
 and execute it, passing down any extra arguments to it.
-
-## OBSOLETE
-
-These commands are obsolete and should no longer be used:
-
-* `bundle inject(1)`
diff --git a/lib/bundler/man/gemfile.5 b/lib/bundler/man/gemfile.5
index fa9e31f615..64e93c4b15 100644
--- a/lib/bundler/man/gemfile.5
+++ b/lib/bundler/man/gemfile.5
@@ -1,6 +1,6 @@
-.\" generated with nRonn/v0.11.1
-.\" https://github.com/n-ronn/nronn/tree/0.11.1
-.TH "GEMFILE" "5" "May 2024" ""
+.\" generated with Ronn-NG/v0.10.1
+.\" http://github.com/apjanke/ronn-ng/tree/0.10.1
+.TH "GEMFILE" "5" "May 2026" ""
 .SH "NAME"
 \fBGemfile\fR \- A format for describing gem dependencies for Ruby programs
 .SH "SYNOPSIS"
@@ -216,6 +216,8 @@ The following platform values are deprecated and should be replaced with \fBwind
 .IP "\(bu" 4
 \fBmswin\fR, \fBmswin64\fR, \fBmingw32\fR, \fBx64_mingw\fR
 .IP "" 0
+.P
+Note that, while unfortunately using the same terminology, the values of this option are different from the values that \fBbundle lock \-\-add\-platform\fR can take\. The values of this option are more closer to "Ruby Implementation" while the values that \fBbundle lock \-\-add\-platform\fR understands are more related to OS and architecture of the different systems where your lockfile will be used\.
 .SS "FORCE_RUBY_PLATFORM"
 If you always want the pure ruby variant of a gem to be chosen over platform specific variants, you can use the \fBforce_ruby_platform\fR option:
 .IP "" 4
@@ -458,6 +460,50 @@ The \fBgemspec\fR method adds any runtime dependencies as gem requirements in th
 The \fBgemspec\fR method supports optional \fB:path\fR, \fB:glob\fR, \fB:name\fR, and \fB:development_group\fR options, which control where bundler looks for the \fB\.gemspec\fR, the glob it uses to look for the gemspec (defaults to: \fB{,*,*/*}\.gemspec\fR), what named \fB\.gemspec\fR it uses (if more than one is present), and which group development dependencies are included in\.
 .P
 When a \fBgemspec\fR dependency encounters version conflicts during resolution, the local version under development will always be selected \-\- even if there are remote versions that better match other requirements for the \fBgemspec\fR gem\.
+.SH "OVERRIDE"
+The \fBoverride\fR directive rewrites a constraint on another gem before resolution runs\. It targets the common case where an upstream gem's published metadata is too narrow on the current project's machine \-\- a stale upper bound, an unwanted floor, or a transitive pin that has to be lifted\.
+.IP "" 4
+.nf
+override <target>, <field>: <operation>
+.fi
+.IP "" 0
+.P
+\fB<target>\fR is a gem name string or \fB:all\fR\. \fB<field>\fR is one of \fBversion:\fR, \fBrequired_ruby_version:\fR, or \fBrequired_rubygems_version:\fR\. \fB<operation>\fR is one of:
+.IP "\(bu" 4
+a version requirement string (e\.g\. \fB">= 8\.0"\fR), which \fBreplaces\fR the target's requirement absolutely\. The original requirement, both direct and transitive, is discarded in favour of the override\.
+.IP "\(bu" 4
+\fB:ignore_upper\fR, which removes upper\-bound operators (\fB<\fR and \fB<=\fR) from the existing requirement and folds \fB~>\fR into its lower bound (\fB~> 1\.5\fR becomes \fB>= 1\.5\fR)\. Other operators, including \fB!=\fR, are preserved\.
+.IP "\(bu" 4
+\fBnil\fR, which collapses the requirement to \fB>= 0\fR (no constraint at all)\.
+.IP "" 0
+.P
+\fB:all\fR only applies to \fBrequired_ruby_version:\fR and \fBrequired_rubygems_version:\fR\. A per\-gem override on the same field takes precedence over an \fB:all\fR override\. \fB:all + version:\fR is rejected: version requirements only make sense per gem\.
+.P
+Multiple \fBoverride\fR calls for distinct targets are allowed; declaring the same \fBtarget\fR and \fBfield\fR twice is an error\.
+.IP "" 4
+.nf
+source "https://rubygems\.org"
+
+# Force every reference to "rails" \-\- direct or transitive \-\- to >= 8\.0\.
+override "rails", version: ">= 8\.0"
+
+# Strip the upper bound on nokogiri\.
+override "nokogiri", version: :ignore_upper
+
+# Drop the version pin on legacy entirely\.
+override "legacy", version: nil
+
+# Loosen every gem's required_ruby_version upper bound\.
+override :all, required_ruby_version: :ignore_upper
+
+# Override one specific gem's required_rubygems_version\.
+override "tricky", required_rubygems_version: nil
+
+gem "rails", "~> 7\.0"
+.fi
+.IP "" 0
+.P
+The override only affects resolution and the install\-time Ruby/RubyGems compatibility checks; \fBGemfile\.lock\fR continues to reflect the resolved versions, not the rewritten requirements\. When resolution still fails, Bundler appends the active overrides (with their Gemfile location) to the error message so it is clear which override shaped the constraint set\.
 .SH "SOURCE PRIORITY"
 When attempting to locate a gem to satisfy a gem requirement, bundler uses the following priority order:
 .IP "1." 4
@@ -467,4 +513,35 @@ For implicit gems (dependencies of explicit gems), any source, git, or path repo
 .IP "3." 4
 If neither of the above conditions are met, the global source will be used\. If multiple global sources are specified, they will be prioritized from last to first, but this is deprecated since Bundler 1\.13, so Bundler prints a warning and will abort with an error in the future\.
 .IP "" 0
+.SH "LOCKFILE"
+By default, Bundler will create a lockfile by adding \fB\.lock\fR to the end of the Gemfile name\. To change this, use the \fBlockfile\fR method:
+.IP "" 4
+.nf
+lockfile "/path/to/lockfile\.lock"
+.fi
+.IP "" 0
+.P
+This is useful when you want to use different lockfiles per ruby version or platform\.
+.P
+To avoid writing a lock file, use \fBfalse\fR as the argument:
+.IP "" 4
+.nf
+lockfile false
+.fi
+.IP "" 0
+.P
+This is useful for library development and other situations where the code is expected to work with a range of dependency versions\.
+.SS "LOCKFILE PRECEDENCE"
+When determining path to the lockfile or whether to create a lockfile, the following precedence is used:
+.IP "1." 4
+The \fBbundle install\fR \fB\-\-no\-lock\fR option (which disables lockfile creation)\.
+.IP "2." 4
+The \fBbundle install\fR \fB\-\-lockfile\fR option\.
+.IP "3." 4
+The \fBBUNDLE_LOCKFILE\fR environment variable\.
+.IP "4." 4
+The \fBlockfile\fR method in the Gemfile\.
+.IP "5." 4
+The default behavior of adding \fB\.lock\fR to the end of the Gemfile name\.
+.IP "" 0
 
diff --git a/lib/bundler/man/gemfile.5.ronn b/lib/bundler/man/gemfile.5.ronn
index 7c1e00d13a..69fef90654 100644
--- a/lib/bundler/man/gemfile.5.ronn
+++ b/lib/bundler/man/gemfile.5.ronn
@@ -242,6 +242,12 @@ The following platform values are deprecated and should be replaced with `window
 
   * `mswin`, `mswin64`, `mingw32`, `x64_mingw`
 
+Note that, while unfortunately using the same terminology, the values of this
+option are different from the values that `bundle lock --add-platform` can take.
+The values of this option are more closer to "Ruby Implementation" while the
+values that `bundle lock --add-platform` understands are more related to OS and
+architecture of the different systems where your lockfile will be used.
+
 ### FORCE_RUBY_PLATFORM
 
 If you always want the pure ruby variant of a gem to be chosen over platform
@@ -535,6 +541,59 @@ When a `gemspec` dependency encounters version conflicts during resolution, the
 local version under development will always be selected -- even if there are
 remote versions that better match other requirements for the `gemspec` gem.
 
+## OVERRIDE
+
+The `override` directive rewrites a constraint on another gem before
+resolution runs. It targets the common case where an upstream gem's
+published metadata is too narrow on the current project's machine -- a stale
+upper bound, an unwanted floor, or a transitive pin that has to be lifted.
+
+    override <target>, <field>: <operation>
+
+`<target>` is a gem name string or `:all`. `<field>` is one of `version:`,
+`required_ruby_version:`, or `required_rubygems_version:`. `<operation>` is
+one of:
+
+  * a version requirement string (e.g. `">= 8.0"`), which **replaces** the
+    target's requirement absolutely. The original requirement, both direct
+    and transitive, is discarded in favour of the override.
+  * `:ignore_upper`, which removes upper-bound operators (`<` and `<=`) from
+    the existing requirement and folds `~>` into its lower bound (`~> 1.5`
+    becomes `>= 1.5`). Other operators, including `!=`, are preserved.
+  * `nil`, which collapses the requirement to `>= 0` (no constraint at all).
+
+`:all` only applies to `required_ruby_version:` and `required_rubygems_version:`.
+A per-gem override on the same field takes precedence over an `:all` override.
+`:all + version:` is rejected: version requirements only make sense per gem.
+
+Multiple `override` calls for distinct targets are allowed; declaring the
+same `target` and `field` twice is an error.
+
+    source "https://rubygems.org"
+
+    # Force every reference to "rails" -- direct or transitive -- to >= 8.0.
+    override "rails", version: ">= 8.0"
+
+    # Strip the upper bound on nokogiri.
+    override "nokogiri", version: :ignore_upper
+
+    # Drop the version pin on legacy entirely.
+    override "legacy", version: nil
+
+    # Loosen every gem's required_ruby_version upper bound.
+    override :all, required_ruby_version: :ignore_upper
+
+    # Override one specific gem's required_rubygems_version.
+    override "tricky", required_rubygems_version: nil
+
+    gem "rails", "~> 7.0"
+
+The override only affects resolution and the install-time Ruby/RubyGems
+compatibility checks; `Gemfile.lock` continues to reflect the resolved
+versions, not the rewritten requirements. When resolution still fails,
+Bundler appends the active overrides (with their Gemfile location) to the
+error message so it is clear which override shaped the constraint set.
+
 ## SOURCE PRIORITY
 
 When attempting to locate a gem to satisfy a gem requirement,
@@ -550,3 +609,31 @@ bundler uses the following priority order:
      If multiple global sources are specified, they will be prioritized from
      last to first, but this is deprecated since Bundler 1.13, so Bundler prints
      a warning and will abort with an error in the future.
+
+## LOCKFILE
+
+By default, Bundler will create a lockfile by adding `.lock` to the end of the
+Gemfile name. To change this, use the `lockfile` method:
+
+    lockfile "/path/to/lockfile.lock"
+
+This is useful when you want to use different lockfiles per ruby version or
+platform.
+
+To avoid writing a lock file, use `false` as the argument:
+
+    lockfile false
+
+This is useful for library development and other situations where the code is
+expected to work with a range of dependency versions.
+
+### LOCKFILE PRECEDENCE
+
+When determining path to the lockfile or whether to create a lockfile, the
+following precedence is used:
+
+1. The `bundle install` `--no-lock` option (which disables lockfile creation).
+1. The `bundle install` `--lockfile` option.
+1. The `BUNDLE_LOCKFILE` environment variable.
+1. The `lockfile` method in the Gemfile.
+1. The default behavior of adding `.lock` to the end of the Gemfile name.
diff --git a/lib/bundler/man/index.txt b/lib/bundler/man/index.txt
index 24f7633e66..f610ba852a 100644
--- a/lib/bundler/man/index.txt
+++ b/lib/bundler/man/index.txt
@@ -8,13 +8,16 @@ bundle-clean(1)       bundle-clean.1
 bundle-config(1)      bundle-config.1
 bundle-console(1)     bundle-console.1
 bundle-doctor(1)      bundle-doctor.1
+bundle-env(1)         bundle-env.1
 bundle-exec(1)        bundle-exec.1
+bundle-fund(1)        bundle-fund.1
 bundle-gem(1)         bundle-gem.1
 bundle-help(1)        bundle-help.1
 bundle-info(1)        bundle-info.1
 bundle-init(1)        bundle-init.1
-bundle-inject(1)      bundle-inject.1
 bundle-install(1)     bundle-install.1
+bundle-issue(1)       bundle-issue.1
+bundle-licenses(1)    bundle-licenses.1
 bundle-list(1)        bundle-list.1
 bundle-lock(1)        bundle-lock.1
 bundle-open(1)        bundle-open.1
@@ -26,4 +29,3 @@ bundle-remove(1)      bundle-remove.1
 bundle-show(1)        bundle-show.1
 bundle-update(1)      bundle-update.1
 bundle-version(1)     bundle-version.1
-bundle-viz(1)         bundle-viz.1
diff --git a/lib/bundler/match_metadata.rb b/lib/bundler/match_metadata.rb
index f6cc27df32..92aeb2e893 100644
--- a/lib/bundler/match_metadata.rb
+++ b/lib/bundler/match_metadata.rb
@@ -13,5 +13,38 @@ module Bundler
     def matches_current_rubygems?
       @required_rubygems_version.satisfied_by?(Gem.rubygems_version)
     end
+
+    def matches_current_metadata_with_overrides?(overrides)
+      matches_current_ruby_with_overrides?(overrides) && matches_current_rubygems_with_overrides?(overrides)
+    end
+
+    def matches_current_ruby_with_overrides?(overrides)
+      effective_required_version(@required_ruby_version, :required_ruby_version, overrides).satisfied_by?(Gem.ruby_version)
+    end
+
+    def matches_current_rubygems_with_overrides?(overrides)
+      effective_required_version(@required_rubygems_version, :required_rubygems_version, overrides).satisfied_by?(Gem.rubygems_version)
+    end
+
+    def expanded_dependencies
+      runtime_dependencies + [
+        metadata_dependency("Ruby", @required_ruby_version),
+        metadata_dependency("RubyGems", @required_rubygems_version),
+      ].compact
+    end
+
+    def metadata_dependency(name, requirement)
+      return if requirement.nil? || requirement.none?
+
+      Gem::Dependency.new("#{name}\0", requirement)
+    end
+
+    private
+
+    def effective_required_version(requirement, field, overrides)
+      return requirement if overrides.nil? || overrides.empty?
+      override = Override.find_for(overrides, name, field)
+      override ? override.apply_to(requirement) : requirement
+    end
   end
 end
diff --git a/lib/bundler/match_platform.rb b/lib/bundler/match_platform.rb
index ece9fb8679..479818e5ec 100644
--- a/lib/bundler/match_platform.rb
+++ b/lib/bundler/match_platform.rb
@@ -1,23 +1,42 @@
 # frozen_string_literal: true
 
-require_relative "gem_helpers"
-
 module Bundler
   module MatchPlatform
-    include GemHelpers
+    def installable_on_platform?(target_platform) # :nodoc:
+      return true if [Gem::Platform::RUBY, nil, target_platform].include?(platform)
+      return true if Gem::Platform.new(platform) === target_platform
 
-    def match_platform(p)
-      MatchPlatform.platforms_match?(platform, p)
+      false
     end
 
-    def self.platforms_match?(gemspec_platform, local_platform)
-      return true if gemspec_platform.nil?
-      return true if gemspec_platform == Gem::Platform::RUBY
-      return true if local_platform == gemspec_platform
-      gemspec_platform = Gem::Platform.new(gemspec_platform)
-      return true if gemspec_platform === local_platform
+    def self.select_best_platform_match(specs, platform, force_ruby: false, prefer_locked: false)
+      matching = select_all_platform_match(specs, platform, force_ruby: force_ruby, prefer_locked: prefer_locked)
 
-      false
+      Gem::Platform.sort_and_filter_best_platform_match(matching, platform)
+    end
+
+    def self.select_best_local_platform_match(specs, force_ruby: false)
+      local = Bundler.local_platform
+      matching = select_all_platform_match(specs, local, force_ruby: force_ruby).filter_map(&:materialized_for_installation)
+
+      Gem::Platform.sort_best_platform_match(matching, local)
+    end
+
+    def self.select_all_platform_match(specs, platform, force_ruby: false, prefer_locked: false)
+      matching = specs.select {|spec| spec.installable_on_platform?(force_ruby ? Gem::Platform::RUBY : platform) }
+
+      specs.each(&:force_ruby_platform!) if force_ruby
+
+      if prefer_locked
+        locked_originally = matching.select {|spec| spec.is_a?(::Bundler::LazySpecification) }
+        return locked_originally if locked_originally.any?
+      end
+
+      matching
+    end
+
+    def self.generic_local_platform_is_ruby?
+      Bundler.generic_local_platform == Gem::Platform::RUBY
     end
   end
 end
diff --git a/lib/bundler/match_remote_metadata.rb b/lib/bundler/match_remote_metadata.rb
index 5e46d52441..601af7e55d 100644
--- a/lib/bundler/match_remote_metadata.rb
+++ b/lib/bundler/match_remote_metadata.rb
@@ -6,19 +6,34 @@ module Bundler
     # API didn't include that field, so some marshalled specs in the index have it
     # set to +nil+.
     def matches_current_ruby?
-      @required_ruby_version ||= _remote_specification.required_ruby_version || Gem::Requirement.default
-
+      ensure_required_ruby_version_loaded
       super
     end
 
     def matches_current_rubygems?
-      # A fallback is included because the original version of the specification
-      # API didn't include that field, so some marshalled specs in the index have it
-      # set to +nil+.
-      @required_rubygems_version ||= _remote_specification.required_rubygems_version || Gem::Requirement.default
+      ensure_required_rubygems_version_loaded
+      super
+    end
+
+    def matches_current_ruby_with_overrides?(overrides)
+      ensure_required_ruby_version_loaded
+      super
+    end
 
+    def matches_current_rubygems_with_overrides?(overrides)
+      ensure_required_rubygems_version_loaded
       super
     end
+
+    private
+
+    def ensure_required_ruby_version_loaded
+      @required_ruby_version ||= _remote_specification.required_ruby_version || Gem::Requirement.default # rubocop:disable Naming/MemoizedInstanceVariableName
+    end
+
+    def ensure_required_rubygems_version_loaded
+      @required_rubygems_version ||= _remote_specification.required_rubygems_version || Gem::Requirement.default # rubocop:disable Naming/MemoizedInstanceVariableName
+    end
   end
 
   module MatchRemoteMetadata
diff --git a/lib/bundler/materialization.rb b/lib/bundler/materialization.rb
new file mode 100644
index 0000000000..82e48464a7
--- /dev/null
+++ b/lib/bundler/materialization.rb
@@ -0,0 +1,59 @@
+# frozen_string_literal: true
+
+module Bundler
+  #
+  # This class materializes a set of resolved specifications (`LazySpecification`)
+  # for a given gem into the most appropriate real specifications
+  # (`StubSepecification`, `EndpointSpecification`, etc), given a dependency and a
+  # target platform.
+  #
+  class Materialization
+    def initialize(dep, platform, candidates:)
+      @dep = dep
+      @platform = platform
+      @candidates = candidates
+    end
+
+    def complete?
+      specs.any?
+    end
+
+    def specs
+      @specs ||= if @candidates.nil?
+        []
+      elsif platform
+        MatchPlatform.select_best_platform_match(@candidates, platform, force_ruby: dep.force_ruby_platform)
+      else
+        MatchPlatform.select_best_local_platform_match(@candidates, force_ruby: dep.force_ruby_platform || dep.default_force_ruby_platform)
+      end
+    end
+
+    def dependencies
+      (materialized_spec || specs.first).runtime_dependencies.map {|d| [d, platform] }
+    end
+
+    def materialized_spec
+      specs.reject(&:missing?).first&.materialization
+    end
+
+    def completely_missing_specs
+      return [] unless specs.all?(&:missing?)
+
+      specs
+    end
+
+    def partially_missing_specs
+      specs.select(&:missing?)
+    end
+
+    def incomplete_specs
+      return [] if complete?
+
+      @candidates || LazySpecification.new(dep.name, nil, nil)
+    end
+
+    private
+
+    attr_reader :dep, :platform
+  end
+end
diff --git a/lib/bundler/override.rb b/lib/bundler/override.rb
new file mode 100644
index 0000000000..0e0ec59fd7
--- /dev/null
+++ b/lib/bundler/override.rb
@@ -0,0 +1,69 @@
+# frozen_string_literal: true
+
+module Bundler
+  class Override
+    UPPER_BOUND_OPERATORS = ["<", "<="].freeze
+
+    def self.find_for(overrides, name, field)
+      overrides.find {|o| o.target == name && o.field == field } ||
+        overrides.find {|o| o.target == :all && o.field == field }
+    end
+
+    # Attach the given overrides onto every LazySpecification in `specs` so
+    # downstream consumers (LazySpecification#choose_compatible, the install-
+    # time compatibility check, etc.) can read the override list off the spec
+    # itself. Non-LazySpec entries (StubSpecification, Gem::Specification, ...)
+    # are left untouched.
+    def self.attach(specs, overrides)
+      return if overrides.nil? || overrides.empty?
+      specs.each {|s| s.overrides = overrides if s.is_a?(LazySpecification) }
+    end
+
+    attr_reader :target, :field, :operation, :source_location
+
+    def initialize(target, field, operation, source_location: nil)
+      @target = target
+      @field = field
+      @operation = operation
+      @source_location = source_location
+    end
+
+    def source_location_label
+      return nil unless @source_location
+      "#{File.basename(@source_location.path)}:#{@source_location.lineno}"
+    end
+
+    def apply_to(requirement)
+      case operation
+      when nil
+        Gem::Requirement.default
+      when :ignore_upper
+        remove_upper_bounds(requirement)
+      when String
+        Gem::Requirement.new(operation)
+      else
+        raise ArgumentError, "unsupported override operation: #{operation.inspect}"
+      end
+    end
+
+    private
+
+    def remove_upper_bounds(requirement)
+      return Gem::Requirement.default if requirement.nil? || requirement.none?
+
+      preserved = requirement.requirements.filter_map do |op, version|
+        if UPPER_BOUND_OPERATORS.include?(op)
+          nil
+        elsif op == "~>"
+          [">=", version]
+        else
+          [op, version]
+        end
+      end
+
+      return Gem::Requirement.default if preserved.empty?
+
+      Gem::Requirement.new(preserved.map {|op, v| "#{op} #{v}" })
+    end
+  end
+end
diff --git a/lib/bundler/plugin.rb b/lib/bundler/plugin.rb
index 588fa79be8..faca6bea53 100644
--- a/lib/bundler/plugin.rb
+++ b/lib/bundler/plugin.rb
@@ -113,7 +113,7 @@ module Bundler
 
         return if definition.dependencies.empty?
 
-        plugins = definition.dependencies.map(&:name).reject {|p| index.installed? p }
+        plugins = definition.dependencies.map(&:name)
         installed_specs = Installer.new.install_definition(definition)
 
         save_plugins plugins, installed_specs, builder.inferred_plugins
@@ -195,7 +195,7 @@ module Bundler
       @sources[name]
     end
 
-    # @param [Hash] The options that are present in the lock file
+    # @param [Hash] The options that are present in the lockfile
     # @return [API::Source] the instance of the class that handles the source
     #                       type passed in locked_opts
     def from_lock(locked_opts)
@@ -220,7 +220,7 @@ module Bundler
     #
     # @param [String] event
     def hook(event, *args, &arg_blk)
-      return unless Bundler.feature_flag.plugins?
+      return unless Bundler.settings[:plugins]
       unless Events.defined_event?(event)
         raise ArgumentError, "Event '#{event}' not defined in Bundler::Plugin::Events"
       end
@@ -253,10 +253,13 @@ module Bundler
     # @param [Array<String>] names of inferred source plugins that can be ignored
     def save_plugins(plugins, specs, optional_plugins = [])
       plugins.each do |name|
-        next if index.installed?(name)
-
         spec = specs[name]
 
+        # It's possible that the `plugin` found in the Gemfile don't appear in the specs. For instance when
+        # calling `BUNDLE_WITHOUT=default bundle install`, the plugins will not get installed.
+        next if spec.nil?
+        next if index.up_to_date?(spec)
+
         save_plugin(name, spec, optional_plugins.include?(name))
       end
     end
@@ -342,7 +345,26 @@ module Bundler
       # done to avoid conflicts
       path = index.plugin_path(name)
 
-      Gem.add_to_load_path(*index.load_paths(name))
+      paths = index.load_paths(name)
+      invalid_paths = paths.reject {|p| File.directory?(p) }
+
+      if invalid_paths.any?
+        Bundler.ui.warn <<~MESSAGE
+          The following plugin paths don't exist: #{invalid_paths.join(", ")}.
+
+          This can happen if the plugin was installed with a different version of Ruby that has since been uninstalled.
+
+          If you would like to reinstall the plugin, run:
+
+          bundler plugin uninstall #{name} && bundler plugin install #{name}
+
+          Continuing without installing plugin #{name}.
+        MESSAGE
+
+        return
+      end
+
+      Gem.add_to_load_path(*paths)
 
       load path.join(PLUGIN_FILE_NAME)
 
diff --git a/lib/bundler/plugin/api/source.rb b/lib/bundler/plugin/api/source.rb
index 8563ee358a..798326673a 100644
--- a/lib/bundler/plugin/api/source.rb
+++ b/lib/bundler/plugin/api/source.rb
@@ -67,13 +67,21 @@ module Bundler
         # to check out same version of gem later.
         #
         # There options are passed when the source plugin is created from the
-        # lock file.
+        # lockfile.
         #
         # @return [Hash]
         def options_to_lock
           {}
         end
 
+        # Download the gem specified by the spec at appropriate path.
+        #
+        # A source plugin can implement this method to split the download and the
+        # installation of a gem.
+        #
+        # @return [Boolean] Whether the download of the gem succeeded.
+        def download(spec, opts); end
+
         # Install the gem specified by the spec at appropriate path.
         # `install_path` provides a sufficient default, if the source can only
         # satisfy one gem,  but is not binding.
@@ -131,7 +139,7 @@ module Bundler
           Bundler::Index.build do |index|
             files.each do |file|
               next unless spec = Bundler.load_gemspec(file)
-              Bundler.rubygems.set_installed_by_version(spec)
+              spec.installed_by_version = Gem::VERSION
 
               spec.source = self
               Bundler.rubygems.validate(spec)
@@ -196,6 +204,7 @@ module Bundler
 
           FileUtils.rm_rf(new_cache_path)
           FileUtils.cp_r(install_path, new_cache_path)
+          FileUtils.rm_rf(app_cache_path.join(".git"))
           FileUtils.touch(app_cache_path.join(".bundlecache"))
         end
 
diff --git a/lib/bundler/plugin/events.rb b/lib/bundler/plugin/events.rb
index 29c05098ae..3fbf60307e 100644
--- a/lib/bundler/plugin/events.rb
+++ b/lib/bundler/plugin/events.rb
@@ -31,6 +31,54 @@ module Bundler
       end
 
       # @!parse
+      #   A hook called before the Gemfile is evaluated
+      #   Includes the Gemfile path and the Lockfile path
+      #   GEM_BEFORE_EVAL = "before-eval"
+      define :GEM_BEFORE_EVAL, "before-eval"
+
+      # @!parse
+      #   A hook called after the Gemfile is evaluated
+      #   Includes a Bundler::Definition
+      #   GEM_AFTER_EVAL = "after-eval"
+      define :GEM_AFTER_EVAL, "after-eval"
+
+      # @!parse
+      #   A hook called before any gems install
+      #   Includes an Array of Bundler::Dependency objects
+      #   GEM_BEFORE_INSTALL_ALL = "before-install-all"
+      define :GEM_BEFORE_INSTALL_ALL, "before-install-all"
+
+      # @!parse
+      #   A hook called before each individual gem is downloaded from a remote source.
+      #   Includes a spec-like object responding to the Gem::Specification API
+      #   (for example, a Bundler spec proxy such as Bundler::EndpointSpecification
+      #   or Bundler::RemoteSpecification). Does not fire when the gem is already
+      #   present at the initial download-cache check.
+      #   GEM_BEFORE_FETCH = "before-fetch"
+      define :GEM_BEFORE_FETCH, "before-fetch"
+
+      # @!parse
+      #   A hook called after each individual gem is downloaded from a remote source.
+      #   Includes a spec-like object responding to the Gem::Specification API
+      #   (for example, a Bundler spec proxy such as Bundler::EndpointSpecification
+      #   or Bundler::RemoteSpecification). Does not fire when the gem is already
+      #   present at the initial download-cache check.
+      #   GEM_AFTER_FETCH = "after-fetch"
+      define :GEM_AFTER_FETCH, "after-fetch"
+
+      # @!parse
+      #   A hook called before a git source is fetched or checked out.
+      #   Includes a Bundler::Source::Git reference.
+      #   GIT_BEFORE_FETCH = "before-git-fetch"
+      define :GIT_BEFORE_FETCH, "before-git-fetch"
+
+      # @!parse
+      #   A hook called after a git source is fetched or checked out.
+      #   Includes a Bundler::Source::Git reference.
+      #   GIT_AFTER_FETCH = "after-git-fetch"
+      define :GIT_AFTER_FETCH, "after-git-fetch"
+
+      # @!parse
       #   A hook called before each individual gem is installed
       #   Includes a Bundler::ParallelInstaller::SpecInstallation.
       #   No state, error, post_install_message will be present as nothing has installed yet
@@ -46,18 +94,18 @@ module Bundler
       define :GEM_AFTER_INSTALL,  "after-install"
 
       # @!parse
-      #   A hook called before any gems install
-      #   Includes an Array of Bundler::Dependency objects
-      #   GEM_BEFORE_INSTALL_ALL = "before-install-all"
-      define :GEM_BEFORE_INSTALL_ALL, "before-install-all"
-
-      # @!parse
       #   A hook called after any gems install
       #   Includes an Array of Bundler::Dependency objects
       #   GEM_AFTER_INSTALL_ALL = "after-install-all"
       define :GEM_AFTER_INSTALL_ALL,  "after-install-all"
 
       # @!parse
+      #   A hook called before any gems require
+      #   Includes an Array of Bundler::Dependency objects.
+      #   GEM_BEFORE_REQUIRE_ALL = "before-require-all"
+      define :GEM_BEFORE_REQUIRE_ALL, "before-require-all"
+
+      # @!parse
       #   A hook called before each individual gem is required
       #   Includes a Bundler::Dependency.
       #   GEM_BEFORE_REQUIRE = "before-require"
@@ -70,16 +118,10 @@ module Bundler
       define :GEM_AFTER_REQUIRE,  "after-require"
 
       # @!parse
-      #   A hook called before any gems require
-      #   Includes an Array of Bundler::Dependency objects.
-      #   GEM_BEFORE_REQUIRE_ALL = "before-require-all"
-      define :GEM_BEFORE_REQUIRE_ALL, "before-require-all"
-
-      # @!parse
       #   A hook called after all gems required
       #   Includes an Array of Bundler::Dependency objects.
       #   GEM_AFTER_REQUIRE_ALL = "after-require-all"
-      define :GEM_AFTER_REQUIRE_ALL,  "after-require-all"
+      define :GEM_AFTER_REQUIRE_ALL, "after-require-all"
     end
   end
 end
diff --git a/lib/bundler/plugin/index.rb b/lib/bundler/plugin/index.rb
index c2ab8f90da..1dfb061304 100644
--- a/lib/bundler/plugin/index.rb
+++ b/lib/bundler/plugin/index.rb
@@ -31,9 +31,13 @@ module Bundler
 
         begin
           load_index(global_index_file, true)
-        rescue GenericSystemCallError
+        rescue PermissionError
           # no need to fail when on a read-only FS, for example
           nil
+        rescue ArgumentError => e
+          # ruby 3.4 checks writability in Dir.tmpdir
+          raise unless e.message&.include?("could not find a temporary directory")
+          nil
         end
         load_index(local_index_file) if SharedHelpers.in_bundle?
       end
@@ -115,6 +119,12 @@ module Bundler
         @plugin_paths[name]
       end
 
+      def up_to_date?(spec)
+        path = installed?(spec.name)
+
+        path == spec.full_gem_path
+      end
+
       def installed_plugins
         @plugin_paths.keys
       end
@@ -153,6 +163,8 @@ module Bundler
       # @param [Pathname] index file path
       # @param [Boolean] is the index file global index
       def load_index(index_file, global = false)
+        base = base_for_index(global)
+
         SharedHelpers.filesystem_access(index_file, :read) do |index_f|
           valid_file = index_f&.exist? && !index_f.size.zero?
           break unless valid_file
@@ -164,8 +176,8 @@ module Bundler
 
           @commands.merge!(index["commands"])
           @hooks.merge!(index["hooks"])
-          @load_paths.merge!(index["load_paths"])
-          @plugin_paths.merge!(index["plugin_paths"])
+          @load_paths.merge!(transform_index_paths(index["load_paths"]) {|p| absolutize_path(p, base) })
+          @plugin_paths.merge!(transform_index_paths(index["plugin_paths"]) {|p| absolutize_path(p, base) })
           @sources.merge!(index["sources"]) unless global
         end
       end
@@ -174,11 +186,13 @@ module Bundler
       # instance variables in YAML format. (The instance variables are supposed
       # to be only String key value pairs)
       def save_index
+        base = base_for_index(false)
+
         index = {
           "commands" => @commands,
           "hooks" => @hooks,
-          "load_paths" => @load_paths,
-          "plugin_paths" => @plugin_paths,
+          "load_paths" => transform_index_paths(@load_paths) {|p| relativize_path(p, base) },
+          "plugin_paths" => transform_index_paths(@plugin_paths) {|p| relativize_path(p, base) },
           "sources" => @sources,
         }
 
@@ -188,6 +202,40 @@ module Bundler
           File.open(index_f, "w") {|f| f.puts YAMLSerializer.dump(index) }
         end
       end
+
+      def base_for_index(global)
+        global ? Plugin.global_root : Plugin.root
+      end
+
+      def transform_index_paths(paths)
+        return {} unless paths
+
+        paths.transform_values do |value|
+          if value.is_a?(Array)
+            value.map {|path| yield path }
+          else
+            yield value
+          end
+        end
+      end
+
+      def relativize_path(path, base)
+        pathname = Pathname.new(path)
+        return path unless pathname.absolute?
+
+        base_path = Pathname.new(base)
+        if pathname == base_path || pathname.to_s.start_with?(base_path.to_s + File::SEPARATOR)
+          pathname.relative_path_from(base_path).to_s
+        else
+          path
+        end
+      end
+
+      def absolutize_path(path, base)
+        pathname = Pathname.new(path)
+        pathname = Pathname.new(base).join(pathname) unless pathname.absolute?
+        pathname.to_s
+      end
     end
   end
 end
diff --git a/lib/bundler/plugin/installer.rb b/lib/bundler/plugin/installer.rb
index 4f60862bb4..9be8b36843 100644
--- a/lib/bundler/plugin/installer.rb
+++ b/lib/bundler/plugin/installer.rb
@@ -34,7 +34,7 @@ module Bundler
       # @return [Hash] map of names to their specs they are installed with
       def install_definition(definition)
         def definition.lock(*); end
-        definition.resolve_remotely!
+        definition.remotely!
         specs = definition.specs
 
         install_from_specs specs
@@ -43,16 +43,6 @@ module Bundler
       private
 
       def check_sources_consistency!(options)
-        if options.key?(:git) && options.key?(:local_git)
-          raise InvalidOption, "Remote and local plugin git sources can't be both specified"
-        end
-
-        # back-compat; local_git is an alias for git
-        if options.key?(:local_git)
-          Bundler::SharedHelpers.major_deprecation(2, "--local_git is deprecated, use --git")
-          options[:git] = options.delete(:local_git)
-        end
-
         if (options.keys & [:source, :git, :path]).length > 1
           raise InvalidOption, "Only one of --source, --git, or --path may be specified"
         end
@@ -120,7 +110,8 @@ module Bundler
         paths = {}
 
         specs.each do |spec|
-          spec.source.install spec
+          spec.source.download(spec)
+          spec.source.install(spec)
 
           paths[spec.name] = spec
         end
diff --git a/lib/bundler/plugin/installer/path.rb b/lib/bundler/plugin/installer/path.rb
index 58a8fa7426..58c4924eb0 100644
--- a/lib/bundler/plugin/installer/path.rb
+++ b/lib/bundler/plugin/installer/path.rb
@@ -8,6 +8,14 @@ module Bundler
           SharedHelpers.in_bundle? ? Bundler.root : Plugin.root
         end
 
+        def eql?(other)
+          return unless other.class == self.class
+          expanded_original_path == other.expanded_original_path &&
+            version == other.version
+        end
+
+        alias_method :==, :eql?
+
         def generate_bin(spec, disable_extensions = false)
           # Need to find a way without code duplication
           # For now, we can ignore this
diff --git a/lib/bundler/plugin/source_list.rb b/lib/bundler/plugin/source_list.rb
index 746996de55..d929ade29e 100644
--- a/lib/bundler/plugin/source_list.rb
+++ b/lib/bundler/plugin/source_list.rb
@@ -23,7 +23,7 @@ module Bundler
 
       private
 
-      def rubygems_aggregate_class
+      def source_class
         Plugin::Installer::Rubygems
       end
     end
diff --git a/lib/bundler/process_lock.rb b/lib/bundler/process_lock.rb
index 0297f80e2c..784b17e363 100644
--- a/lib/bundler/process_lock.rb
+++ b/lib/bundler/process_lock.rb
@@ -2,23 +2,19 @@
 
 module Bundler
   class ProcessLock
-    def self.lock(bundle_path = Bundler.bundle_path)
+    def self.lock(bundle_path = Bundler.bundle_path, &block)
       lock_file_path = File.join(bundle_path, "bundler.lock")
-      has_lock = false
+      base_lock_file_path = lock_file_path.delete_suffix(".lock")
 
-      File.open(lock_file_path, "w") do |f|
-        f.flock(File::LOCK_EX)
-        has_lock = true
-        yield
-        f.flock(File::LOCK_UN)
+      require "fileutils" if Bundler.rubygems.provides?("< 3.6.0")
+
+      begin
+        SharedHelpers.filesystem_access(lock_file_path, :write) do
+          Gem.open_file_with_lock(base_lock_file_path, &block)
+        end
+      rescue PermissionError
+        block.call
       end
-    rescue Errno::EACCES, Errno::ENOLCK, Errno::ENOTSUP, Errno::EPERM, Errno::EROFS
-      # In the case the user does not have access to
-      # create the lock file or is using NFS where
-      # locks are not available we skip locking.
-      yield
-    ensure
-      FileUtils.rm_f(lock_file_path) if has_lock
     end
   end
 end
diff --git a/lib/bundler/remote_specification.rb b/lib/bundler/remote_specification.rb
index 9d237f3fa0..dcaaf6af2e 100644
--- a/lib/bundler/remote_specification.rb
+++ b/lib/bundler/remote_specification.rb
@@ -12,7 +12,7 @@ module Bundler
 
     attr_reader :name, :version, :platform
     attr_writer :dependencies
-    attr_accessor :source, :remote
+    attr_accessor :source, :remote, :locked_platform, :created_at
 
     def initialize(name, version, platform, spec_fetcher)
       @name         = name
@@ -21,6 +21,11 @@ module Bundler
       @platform     = Gem::Platform.new(platform)
       @spec_fetcher = spec_fetcher
       @dependencies = nil
+      @locked_platform = nil
+    end
+
+    def insecurely_materialized?
+      @locked_platform.to_s != @platform.to_s
     end
 
     # Needed before installs, since the arch matters then and quick
diff --git a/lib/bundler/resolver.rb b/lib/bundler/resolver.rb
index 1a6711ea6f..753e9987d5 100644
--- a/lib/bundler/resolver.rb
+++ b/lib/bundler/resolver.rb
@@ -12,13 +12,13 @@ module Bundler
     require_relative "resolver/candidate"
     require_relative "resolver/incompatibility"
     require_relative "resolver/root"
+    require_relative "resolver/strategy"
 
-    include GemHelpers
-
-    def initialize(base, gem_version_promoter)
+    def initialize(base, gem_version_promoter, most_specific_locked_platform = nil)
       @source_requirements = base.source_requirements
       @base = base
       @gem_version_promoter = gem_version_promoter
+      @most_specific_locked_platform = most_specific_locked_platform
     end
 
     def start
@@ -64,7 +64,9 @@ module Bundler
 
       @cached_dependencies = Hash.new do |dependencies, package|
         dependencies[package] = Hash.new do |versions, version|
-          versions[version] = to_dependency_hash(version.dependencies.reject {|d| d.name == package.name }, @packages)
+          deps = version.dependencies.reject {|d| d.name == package.name }
+          deps = apply_metadata_overrides(deps, package.name)
+          versions[version] = to_dependency_hash(deps, @packages)
         end
       end
 
@@ -77,15 +79,17 @@ module Bundler
     end
 
     def solve_versions(root:, logger:)
-      solver = PubGrub::VersionSolver.new(source: self, root: root, logger: logger)
+      solver = PubGrub::VersionSolver.new(source: self, root: root, strategy: Strategy.new(self), logger: logger)
       result = solver.solve
-      result.map {|package, version| version.to_specs(package) }.flatten.uniq
+      resolved_specs = result.flat_map {|package, version| version.to_specs(package, @most_specific_locked_platform) }
+      Override.attach(resolved_specs, @base.overrides)
+      SpecSet.new(resolved_specs).specs_with_additional_variants_from(@base.locked_specs)
     rescue PubGrub::SolveFailure => e
       incompatibility = e.incompatibility
 
-      names_to_unlock, names_to_allow_prereleases_for, extended_explanation = find_names_to_relax(incompatibility)
+      names_to_unlock, names_to_allow_prereleases_for, names_to_allow_remote_specs_for, extended_explanation = find_names_to_relax(incompatibility)
 
-      names_to_relax = names_to_unlock + names_to_allow_prereleases_for
+      names_to_relax = names_to_unlock + names_to_allow_prereleases_for + names_to_allow_remote_specs_for
 
       if names_to_relax.any?
         if names_to_unlock.any?
@@ -95,11 +99,17 @@ module Bundler
         end
 
         if names_to_allow_prereleases_for.any?
-          Bundler.ui.debug "Found conflicts with dependencies with prereleases. Will retrying considering prereleases for #{names_to_allow_prereleases_for.join(", ")}...", true
+          Bundler.ui.debug "Found conflicts with dependencies with prereleases. Will retry considering prereleases for #{names_to_allow_prereleases_for.join(", ")}...", true
 
           @base.include_prereleases(names_to_allow_prereleases_for)
         end
 
+        if names_to_allow_remote_specs_for.any?
+          Bundler.ui.debug "Found conflicts with local versions of #{names_to_allow_remote_specs_for.join(", ")}. Will retry considering remote versions...", true
+
+          @base.include_remote_specs(names_to_allow_remote_specs_for)
+        end
+
         root, logger = setup_solver
 
         Bundler.ui.debug "Retrying resolution...", true
@@ -113,12 +123,29 @@ module Bundler
         explanation << extended_explanation
       end
 
+      override_summary = override_diagnostic_summary
+      explanation << override_summary if override_summary
+
       raise SolveFailure.new(explanation)
     end
 
+    def override_diagnostic_summary
+      return nil if @base.overrides.empty?
+
+      lines = ["Bundler applied the following overrides while resolving:"]
+      @base.overrides.each do |override|
+        target = override.target == :all ? ":all" : override.target.inspect
+        location = override.source_location_label
+        lines << "  override #{target}, #{override.field}: #{override.operation.inspect}" \
+          "#{location ? " (declared at #{location})" : ""}"
+      end
+      "\n\n#{lines.join("\n")}"
+    end
+
     def find_names_to_relax(incompatibility)
       names_to_unlock = []
       names_to_allow_prereleases_for = []
+      names_to_allow_remote_specs_for = []
       extended_explanation = nil
 
       while incompatibility.conflict?
@@ -133,6 +160,8 @@ module Bundler
             names_to_unlock << name
           elsif package.ignores_prereleases? && @all_specs[name].any? {|s| s.version.prerelease? }
             names_to_allow_prereleases_for << name
+          elsif package.prefer_local? && @all_specs[name].any? {|s| !s.is_a?(StubSpecification) }
+            names_to_allow_remote_specs_for << name
           end
 
           no_versions_incompat = [cause.incompatibility, cause.satisfier].find {|incompat| incompat.cause.is_a?(PubGrub::Incompatibility::NoVersions) }
@@ -142,7 +171,7 @@ module Bundler
         end
       end
 
-      [names_to_unlock.uniq, names_to_allow_prereleases_for.uniq, extended_explanation]
+      [names_to_unlock.uniq, names_to_allow_prereleases_for.uniq, names_to_allow_remote_specs_for.uniq, extended_explanation]
     end
 
     def parse_dependency(package, dependency)
@@ -155,16 +184,8 @@ module Bundler
       PubGrub::VersionConstraint.new(package, range: range)
     end
 
-    def versions_for(package, range=VersionRange.any)
-      versions = select_sorted_versions(package, range)
-
-      # Conditional avoids (among other things) calling
-      # sort_versions_by_preferred with the root package
-      if versions.size > 1
-        sort_versions_by_preferred(package, versions)
-      else
-        versions
-      end
+    def versions_for(package, range = VersionRange.any)
+      range.select_versions(@sorted_versions[package])
     end
 
     def no_versions_incompatibility_for(package, unsatisfied_term)
@@ -182,6 +203,9 @@ module Bundler
 
         platforms_explanation = specs_matching_other_platforms.any? ? " for any resolution platforms (#{package.platforms.join(", ")})" : ""
         custom_explanation = "#{constraint} could not be found in #{repository_for(package)}#{platforms_explanation}"
+        if hint = cooldown_hint(specs_matching_other_platforms)
+          custom_explanation += " (#{hint})"
+        end
 
         label = "#{name} (#{constraint_string})"
         extended_explanation = other_specs_matching_message(specs_matching_other_platforms, label) if specs_matching_other_platforms.any?
@@ -226,7 +250,7 @@ module Bundler
             sorted_versions[high]
           end
 
-        range = PubGrub::VersionRange.new(min: low, max: high, include_min: true)
+        range = PubGrub::VersionRange.new(min: low, max: high, include_min: !low.nil?)
 
         self_constraint = PubGrub::VersionConstraint.new(package, range: range)
 
@@ -243,7 +267,7 @@ module Bundler
 
     def all_versions_for(package)
       name = package.name
-      results = (@base[name] + filter_prereleases(@all_specs[name], package)).uniq {|spec| [spec.version.hash, spec.platform] }
+      results = (@base[name] + filter_specs(@all_specs[name], package)).uniq {|spec| [spec.version.hash, spec.platform] }
 
       if name == "bundler" && !bundler_pinned_to_current_version?
         bundler_spec = Gem.loaded_specs["bundler"]
@@ -254,7 +278,7 @@ module Bundler
       results = filter_matching_specs(results, locked_requirement) if locked_requirement
 
       results.group_by(&:version).reduce([]) do |groups, (version, specs)|
-        platform_specs = package.platforms.map {|platform| select_best_platform_match(specs, platform) }
+        platform_specs = package.platform_specs(specs)
 
         # If package is a top-level dependency,
         #   candidate is only valid if there are matching versions for all resolution platforms.
@@ -269,14 +293,22 @@ module Bundler
           next groups if platform_specs.all?(&:empty?)
         end
 
-        platform_specs.flatten!
+        ruby_specs = MatchPlatform.select_best_platform_match(specs, Gem::Platform::RUBY)
+        ruby_group = Resolver::SpecGroup.new(ruby_specs)
 
-        ruby_specs = select_best_platform_match(specs, Gem::Platform::RUBY)
-        groups << Resolver::Candidate.new(version, specs: ruby_specs) if ruby_specs.any?
+        unless ruby_group.empty?
+          platform_specs.each do |s|
+            ruby_group.merge(Resolver::SpecGroup.new(s))
+          end
+
+          groups << Resolver::Candidate.new(version, group: ruby_group, priority: -1)
+          next groups if package.force_ruby_platform?
+        end
 
-        next groups if platform_specs == ruby_specs || package.force_ruby_platform?
+        platform_group = Resolver::SpecGroup.new(platform_specs.flatten.uniq)
+        next groups if platform_group == ruby_group
 
-        groups << Resolver::Candidate.new(version, specs: platform_specs)
+        groups << Resolver::Candidate.new(version, group: platform_group, priority: 1)
 
         groups
       end
@@ -300,6 +332,16 @@ module Bundler
       "Gemfile"
     end
 
+    def raise_incomplete!(incomplete_specs)
+      raise_not_found!(@base.get_package(incomplete_specs.first.name))
+    end
+
+    def sort_versions_by_preferred(package, versions)
+      @gem_version_promoter.sort_versions(package, versions)
+    end
+
+    private
+
     def raise_not_found!(package)
       name = package.name
       source = source_for(name)
@@ -333,10 +375,30 @@ module Bundler
         message << "\n#{other_specs_matching_message(specs, matching_part)}"
       end
 
+      if hint = cooldown_hint(specs_matching_requirement)
+        message << "\n\n#{hint}."
+      end
+
+      if specs_matching_requirement.any? && (hint = platform_mismatch_hint)
+        message << "\n\n#{hint}"
+      end
+
       raise GemNotFound, message
     end
 
-    private
+    def platform_mismatch_hint
+      locked_platforms = Bundler.locked_gems&.platforms
+      return unless locked_platforms
+
+      local_platform = Bundler.local_platform
+      return if locked_platforms.include?(local_platform)
+      return if locked_platforms.any? {|p| p == Gem::Platform::RUBY }
+
+      "Your current platform (#{local_platform}) is not included in the lockfile's platforms (#{locked_platforms.join(", ")}). " \
+        "Add the current platform to the lockfile with\n`bundle lock --add-platform #{local_platform}` and try again."
+    rescue GemfileNotFound
+      nil
+    end
 
     def filtered_versions_for(package)
       @gem_version_promoter.filter_versions(package, @all_versions[package])
@@ -359,12 +421,81 @@ module Bundler
       end
     end
 
+    def filter_specs(specs, package)
+      filter_remote_specs(filter_cooldown(filter_prereleases(specs, package)), package)
+    end
+
     def filter_prereleases(specs, package)
       return specs unless package.ignores_prereleases? && specs.size > 1
 
       specs.reject {|s| s.version.prerelease? }
     end
 
+    def filter_cooldown(specs)
+      return specs if specs.empty?
+      excluded_versions = cooldown_excluded_versions(specs)
+      return specs if excluded_versions.empty?
+      specs.reject {|s| excluded_versions.include?([s.name, s.version]) }
+    end
+
+    def cooldown_excluded_versions(specs)
+      excluded = {}
+      specs.each do |spec|
+        next unless cooldown_excluded?(spec)
+        excluded[[spec.name, spec.version]] = true
+      end
+      excluded
+    end
+
+    def cooldown_hint(specs)
+      excluded_versions = cooldown_excluded_versions(specs)
+      return nil if excluded_versions.empty?
+      "#{excluded_versions.size} version#{"s" if excluded_versions.size > 1} excluded by the cooldown setting; pass `--cooldown 0` to bypass"
+    end
+
+    def cooldown_excluded?(spec)
+      return false unless spec.respond_to?(:created_at) && spec.created_at
+      return false unless spec.respond_to?(:remote) && spec.remote
+      return false if pinned_by_lockfile_floor?(spec)
+      days = spec.remote.effective_cooldown
+      return false if days.nil? || days <= 0
+      (cooldown_now - spec.created_at) < (days * 86_400)
+    end
+
+    # A spec sitting exactly at a `>= locked_version` prevent-downgrade floor is
+    # the version the lockfile currently pins. `bundle update` and `bundle
+    # outdated` install that floor so resolution never moves a gem backwards.
+    # Filtering it out for cooldown would then make resolution impossible
+    # whenever the locked version is itself inside the cooldown window, which is
+    # exactly what happens to a lockfile written before cooldown was enabled.
+    # Keep it eligible; gems being explicitly updated carry an exact `=`
+    # requirement instead and stay subject to the cooldown filter.
+    def pinned_by_lockfile_floor?(spec)
+      return false unless defined?(@base) && @base
+      requirement = base_requirements[spec.name]
+      return false unless requirement && !requirement.exact?
+      requirement.requirements.any? {|op, version| op == ">=" && version == spec.version }
+    end
+
+    def cooldown_now
+      @cooldown_now ||= Time.now
+    end
+
+    def filter_remote_specs(specs, package)
+      if package.prefer_local?
+        local_specs = specs.select {|s| s.is_a?(StubSpecification) }
+
+        if local_specs.empty?
+          package.consider_remote_versions!
+          specs
+        else
+          local_specs
+        end
+      else
+        specs
+      end
+    end
+
     # Ignore versions that depend on themselves incorrectly
     def filter_invalid_self_dependencies(specs, name)
       specs.reject do |s|
@@ -376,10 +507,6 @@ module Bundler
       requirement.satisfied_by?(spec.version) || spec.source.is_a?(Source::Gemspec)
     end
 
-    def sort_versions_by_preferred(package, versions)
-      @gem_version_promoter.sort_versions(package, versions)
-    end
-
     def repository_for(package)
       source_for(package.name)
     end
@@ -389,18 +516,21 @@ module Bundler
     end
 
     def prepare_dependencies(requirements, packages)
-      to_dependency_hash(requirements, packages).map do |dep_package, dep_constraint|
+      to_dependency_hash(requirements, packages).filter_map do |dep_package, dep_constraint|
         name = dep_package.name
 
         next [dep_package, dep_constraint] if name == "bundler"
 
         dep_range = dep_constraint.range
-        versions = select_sorted_versions(dep_package, dep_range)
-        if versions.empty? && dep_package.ignores_prereleases?
-          @all_versions.delete(dep_package)
-          @sorted_versions.delete(dep_package)
-          dep_package.consider_prereleases!
-          versions = select_sorted_versions(dep_package, dep_range)
+        versions = versions_for(dep_package, dep_range)
+        if versions.empty?
+          if dep_package.ignores_prereleases? || dep_package.prefer_local?
+            @all_versions.delete(dep_package)
+            @sorted_versions.delete(dep_package)
+          end
+          dep_package.consider_prereleases! if dep_package.ignores_prereleases?
+          dep_package.consider_remote_versions! if dep_package.prefer_local?
+          versions = versions_for(dep_package, dep_range)
         end
 
         if versions.empty? && select_all_versions(dep_package, dep_range).any?
@@ -412,11 +542,7 @@ module Bundler
         next unless dep_package.current_platform?
 
         raise_not_found!(dep_package)
-      end.compact.to_h
-    end
-
-    def select_sorted_versions(package, range)
-      range.select_versions(@sorted_versions[package])
+      end.to_h
     end
 
     def select_all_versions(package, range)
@@ -431,8 +557,8 @@ module Bundler
 
     def requirement_to_range(requirement)
       ranges = requirement.requirements.map do |(op, version)|
-        ver = Resolver::Candidate.new(version).generic!
-        platform_ver = Resolver::Candidate.new(version).platform_specific!
+        ver = Resolver::Candidate.new(version, priority: -1)
+        platform_ver = Resolver::Candidate.new(version, priority: 1)
 
         case op
         when "~>"
@@ -460,7 +586,7 @@ module Bundler
     end
 
     def to_dependency_hash(dependencies, packages)
-      dependencies.inject({}) do |deps, dep|
+      apply_overrides(dependencies).inject({}) do |deps, dep|
         package = packages[dep.name]
 
         current_req = deps[package]
@@ -476,6 +602,33 @@ module Bundler
       end
     end
 
+    def apply_overrides(dependencies)
+      return dependencies if @base.overrides.empty?
+
+      dependencies.map do |dep|
+        override = Override.find_for(@base.overrides, dep.name, :version)
+        next dep unless override
+        Gem::Dependency.new(dep.name, override.apply_to(dep.requirement))
+      end
+    end
+
+    METADATA_DEP_FIELD = {
+      "Ruby\0" => :required_ruby_version,
+      "RubyGems\0" => :required_rubygems_version,
+    }.freeze
+
+    def apply_metadata_overrides(dependencies, name)
+      return dependencies if @base.overrides.empty?
+
+      dependencies.map do |dep|
+        field = METADATA_DEP_FIELD[dep.name]
+        next dep unless field
+        override = Override.find_for(@base.overrides, name, field)
+        next dep unless override
+        Gem::Dependency.new(dep.name, override.apply_to(dep.requirement))
+      end
+    end
+
     def bundler_not_found_message(conflict_dependencies)
       candidate_specs = filter_matching_specs(default_bundler_source.specs.search("bundler"), conflict_dependencies)
 
diff --git a/lib/bundler/resolver/base.rb b/lib/bundler/resolver/base.rb
index ad19eeb3f4..00bdd08303 100644
--- a/lib/bundler/resolver/base.rb
+++ b/lib/bundler/resolver/base.rb
@@ -5,10 +5,12 @@ require_relative "package"
 module Bundler
   class Resolver
     class Base
-      attr_reader :packages, :requirements, :source_requirements
+      attr_reader :packages, :requirements, :source_requirements, :locked_specs, :overrides
 
       def initialize(source_requirements, dependencies, base, platforms, options)
+        @overrides = options.delete(:overrides) || []
         @source_requirements = source_requirements
+        @locked_specs = options[:locked_specs]
 
         @base = base
 
@@ -16,7 +18,7 @@ module Bundler
           hash[name] = Package.new(name, platforms, **options)
         end
 
-        @requirements = dependencies.map do |dep|
+        @requirements = dependencies.filter_map do |dep|
           dep_platforms = dep.gem_platforms(platforms)
 
           # Dependencies scoped to external platforms are ignored
@@ -27,7 +29,7 @@ module Bundler
           @packages[name] = Package.new(name, dep_platforms, **options.merge(dependency: dep))
 
           dep
-        end.compact
+        end
       end
 
       def [](name)
@@ -68,6 +70,12 @@ module Bundler
         end
       end
 
+      def include_remote_specs(names)
+        names.each do |name|
+          get_package(name).consider_remote_versions!
+        end
+      end
+
       private
 
       def indirect_pins(names)
@@ -97,6 +105,10 @@ module Bundler
       def build_base_requirements
         base_requirements = {}
         @base.each do |ls|
+          if ls.source_changed? && ls.source.specs.search(ls.name).empty?
+            raise GemNotFound, "Could not find gem '#{ls.name}' in #{ls.source}"
+          end
+
           req = Gem::Requirement.new(ls.version)
           base_requirements[ls.name] = req
         end
diff --git a/lib/bundler/resolver/candidate.rb b/lib/bundler/resolver/candidate.rb
index 9e8b913335..5298b2530f 100644
--- a/lib/bundler/resolver/candidate.rb
+++ b/lib/bundler/resolver/candidate.rb
@@ -17,39 +17,27 @@ module Bundler
     # Some candidates may also keep some information explicitly about the
     # package they refer to. These candidates are referred to as "canonical" and
     # are used when materializing resolution results back into RubyGems
-    # specifications that can be installed, written to lock files, and so on.
+    # specifications that can be installed, written to lockfiles, and so on.
     #
     class Candidate
       include Comparable
 
       attr_reader :version
 
-      def initialize(version, specs: [])
-        @spec_group = Resolver::SpecGroup.new(specs)
+      def initialize(version, group: nil, priority: -1)
+        @spec_group = group || SpecGroup.new([])
         @version = Gem::Version.new(version)
-        @ruby_only = specs.map(&:platform).uniq == [Gem::Platform::RUBY]
+        @priority = priority
       end
 
       def dependencies
         @spec_group.dependencies
       end
 
-      def to_specs(package)
+      def to_specs(package, most_specific_locked_platform)
         return [] if package.meta?
 
-        @spec_group.to_specs(package.force_ruby_platform?)
-      end
-
-      def generic!
-        @ruby_only = true
-
-        self
-      end
-
-      def platform_specific!
-        @ruby_only = false
-
-        self
+        @spec_group.to_specs(package.force_ruby_platform?, most_specific_locked_platform)
       end
 
       def prerelease?
@@ -60,35 +48,38 @@ module Bundler
         @version.segments
       end
 
-      def sort_obj
-        [@version, @ruby_only ? -1 : 1]
-      end
-
       def <=>(other)
         return unless other.is_a?(self.class)
 
-        sort_obj <=> other.sort_obj
+        version_comparison = version <=> other.version
+        return version_comparison unless version_comparison.zero?
+
+        priority <=> other.priority
       end
 
       def ==(other)
         return unless other.is_a?(self.class)
 
-        sort_obj == other.sort_obj
+        version == other.version && priority == other.priority
       end
 
       def eql?(other)
         return unless other.is_a?(self.class)
 
-        sort_obj.eql?(other.sort_obj)
+        version.eql?(other.version) && priority.eql?(other.priority)
       end
 
       def hash
-        sort_obj.hash
+        [@version, @priority].hash
       end
 
       def to_s
         @version.to_s
       end
+
+      protected
+
+      attr_reader :priority
     end
   end
 end
diff --git a/lib/bundler/resolver/package.rb b/lib/bundler/resolver/package.rb
index 0461328683..3906be3f57 100644
--- a/lib/bundler/resolver/package.rb
+++ b/lib/bundler/resolver/package.rb
@@ -15,14 +15,24 @@ module Bundler
     class Package
       attr_reader :name, :platforms, :dependency, :locked_version
 
-      def initialize(name, platforms, locked_specs:, unlock:, prerelease: false, dependency: nil)
+      def initialize(name, platforms, locked_specs:, unlock:, prerelease: false, prefer_local: false, dependency: nil, new_platforms: [])
         @name = name
         @platforms = platforms
-        @locked_version = locked_specs[name].first&.version
+        @locked_version = locked_specs.version_for(name)
         @unlock = unlock
         @dependency = dependency || Dependency.new(name, @locked_version)
+        @platforms |= [Gem::Platform::RUBY] if @dependency.default_force_ruby_platform
         @top_level = !dependency.nil?
         @prerelease = @dependency.prerelease? || @locked_version&.prerelease? || prerelease ? :consider_first : :ignore
+        @prefer_local = prefer_local
+        @new_platforms = new_platforms
+      end
+
+      def platform_specs(specs)
+        platforms.map do |platform|
+          prefer_locked = @new_platforms.include?(platform) ? false : !unlock?
+          MatchPlatform.select_best_platform_match(specs, platform, prefer_locked: prefer_locked)
+        end
       end
 
       def to_s
@@ -50,7 +60,7 @@ module Bundler
       end
 
       def unlock?
-        @unlock.empty? || @unlock.include?(name)
+        @unlock == true || @unlock.include?(name)
       end
 
       def ignores_prereleases?
@@ -65,6 +75,14 @@ module Bundler
         @prerelease = :consider_last
       end
 
+      def prefer_local?
+        @prefer_local
+      end
+
+      def consider_remote_versions!
+        @prefer_local = false
+      end
+
       def force_ruby_platform?
         @dependency.force_ruby_platform
       end
diff --git a/lib/bundler/resolver/spec_group.rb b/lib/bundler/resolver/spec_group.rb
index 5cee444e5e..ac6ba86c4c 100644
--- a/lib/bundler/resolver/spec_group.rb
+++ b/lib/bundler/resolver/spec_group.rb
@@ -3,6 +3,8 @@
 module Bundler
   class Resolver
     class SpecGroup
+      attr_reader :specs
+
       def initialize(specs)
         @specs = specs
       end
@@ -23,10 +25,11 @@ module Bundler
         @source ||= exemplary_spec.source
       end
 
-      def to_specs(force_ruby_platform)
+      def to_specs(force_ruby_platform, most_specific_locked_platform)
         @specs.map do |s|
           lazy_spec = LazySpecification.from_spec(s)
           lazy_spec.force_ruby_platform = force_ruby_platform
+          lazy_spec.most_specific_locked_platform = most_specific_locked_platform
           lazy_spec
         end
       end
@@ -36,43 +39,35 @@ module Bundler
       end
 
       def dependencies
-        @dependencies ||= @specs.map do |spec|
-          __dependencies(spec) + metadata_dependencies(spec)
-        end.flatten.uniq
+        @dependencies ||= @specs.flat_map(&:expanded_dependencies).uniq.sort
       end
 
-      protected
-
-      def sorted_spec_names
-        @sorted_spec_names ||= @specs.map(&:full_name).sort
+      def ==(other)
+        sorted_spec_names == other.sorted_spec_names
       end
 
-      private
+      def merge(other)
+        return false unless equivalent?(other)
 
-      def exemplary_spec
-        @specs.first
-      end
+        @specs |= other.specs
 
-      def __dependencies(spec)
-        dependencies = []
-        spec.dependencies.each do |dep|
-          next if dep.type == :development
-          dependencies << Dependency.new(dep.name, dep.requirement)
-        end
-        dependencies
+        true
       end
 
-      def metadata_dependencies(spec)
-        [
-          metadata_dependency("Ruby", spec.required_ruby_version),
-          metadata_dependency("RubyGems", spec.required_rubygems_version),
-        ].compact
+      protected
+
+      def sorted_spec_names
+        @specs.map(&:full_name).sort
       end
 
-      def metadata_dependency(name, requirement)
-        return if requirement.nil? || requirement.none?
+      private
+
+      def equivalent?(other)
+        name == other.name && version == other.version && source == other.source && dependencies == other.dependencies
+      end
 
-        Dependency.new("#{name}\0", requirement)
+      def exemplary_spec
+        @specs.first
       end
     end
   end
diff --git a/lib/bundler/resolver/strategy.rb b/lib/bundler/resolver/strategy.rb
new file mode 100644
index 0000000000..7519d38968
--- /dev/null
+++ b/lib/bundler/resolver/strategy.rb
@@ -0,0 +1,43 @@
+# frozen_string_literal: true
+
+module Bundler
+  class Resolver
+    class Strategy
+      def initialize(source)
+        @source = source
+        @package_priority_cache = {}
+      end
+
+      def next_package_and_version(unsatisfied)
+        package, range = next_term_to_try_from(unsatisfied)
+
+        [package, most_preferred_version_of(package, range).first]
+      end
+
+      private
+
+      def next_term_to_try_from(unsatisfied)
+        unsatisfied.min_by do |package, range|
+          @package_priority_cache[[package, range]] ||= begin
+            matching_versions = @source.versions_for(package, range)
+            higher_versions = @source.versions_for(package, range.upper_invert)
+
+            [matching_versions.count <= 1 ? 0 : 1, higher_versions.count]
+          end
+        end
+      end
+
+      def most_preferred_version_of(package, range)
+        versions = @source.versions_for(package, range)
+
+        # Conditional avoids (among other things) calling
+        # sort_versions_by_preferred with the root package
+        if versions.size > 1
+          @source.sort_versions_by_preferred(package, versions)
+        else
+          versions
+        end
+      end
+    end
+  end
+end
diff --git a/lib/bundler/retry.rb b/lib/bundler/retry.rb
index b95c42c361..49b0f63838 100644
--- a/lib/bundler/retry.rb
+++ b/lib/bundler/retry.rb
@@ -6,6 +6,8 @@ module Bundler
     attr_accessor :name, :total_runs, :current_run
 
     class << self
+      attr_accessor :default_base_delay
+
       def default_attempts
         default_retries + 1
       end
@@ -16,11 +18,17 @@ module Bundler
       end
     end
 
-    def initialize(name, exceptions = nil, retries = self.class.default_retries)
+    # Set default base delay for exponential backoff
+    self.default_base_delay = 1.0
+
+    def initialize(name, exceptions = nil, retries = self.class.default_retries, opts = {})
       @name = name
       @retries = retries
       @exceptions = Array(exceptions) || []
       @total_runs = @retries + 1 # will run once, then upto attempts.times
+      @base_delay = opts[:base_delay] || self.class.default_base_delay
+      @max_delay = opts[:max_delay] || 60.0
+      @jitter = opts[:jitter] || 0.5
     end
 
     def attempt(&block)
@@ -48,9 +56,27 @@ module Bundler
         Bundler.ui.info "" unless Bundler.ui.debug?
         raise e
       end
-      return true unless name
-      Bundler.ui.info "" unless Bundler.ui.debug? # Add new line in case dots preceded this
-      Bundler.ui.warn "Retrying #{name} due to error (#{current_run.next}/#{total_runs}): #{e.class} #{e.message}", Bundler.ui.debug?
+      if name
+        Bundler.ui.info "" unless Bundler.ui.debug? # Add new line in case dots preceded this
+        Bundler.ui.warn "Retrying #{name} due to error (#{current_run.next}/#{total_runs}): #{e.class} #{e.message}", true
+      end
+      backoff_sleep if @base_delay > 0
+      true
+    end
+
+    def backoff_sleep
+      # Exponential backoff: delay = base_delay * 2^(attempt - 1)
+      # Add jitter to prevent thundering herd: random value between 0 and jitter seconds
+      delay = @base_delay * (2**(@current_run - 1))
+      delay = [@max_delay, delay].min
+      jitter_amount = rand * @jitter
+      total_delay = delay + jitter_amount
+      Bundler.ui.debug "Sleeping for #{total_delay.round(2)} seconds before retry"
+      sleep(total_delay)
+    end
+
+    def sleep(duration)
+      Kernel.sleep(duration)
     end
 
     def keep_trying?
diff --git a/lib/bundler/ruby_dsl.rb b/lib/bundler/ruby_dsl.rb
index fb4b79c4df..5e52f38c8f 100644
--- a/lib/bundler/ruby_dsl.rb
+++ b/lib/bundler/ruby_dsl.rb
@@ -42,12 +42,26 @@ module Bundler
     # Loads the file relative to the dirname of the Gemfile itself.
     def normalize_ruby_file(filename)
       file_content = Bundler.read_file(gemfile.dirname.join(filename))
-      # match "ruby-3.2.2" or "ruby   3.2.2" capturing version string up to the first space or comment
-      if /^ruby(-|\s+)([^\s#]+)/.match(file_content)
-        $2
+      # match "ruby-3.2.2", ruby = "3.2.2", ruby = '3.2.2' or "ruby   3.2.2" capturing version string up to the first space or comment
+      version_match = /^               # Start of line
+                      ruby             # Literal "ruby"
+                      [\s-]*           # Optional whitespace or hyphens (for "ruby-3.2.2" format)
+                      (?:=\s*)?        # Optional equals sign with whitespace (for ruby = "3.2.2" format)
+                      (?:
+                        "([^"]+)"      # Double quoted version
+                        |
+                        '([^']+)'      # Single quoted version
+                        |
+                        ([^\s#"']+)    # Unquoted version
+                      )
+                      /x.match(file_content)
+      if version_match
+        version_match[1] || version_match[2] || version_match[3]
       else
         file_content.strip
       end
+    rescue Errno::ENOENT
+      raise GemfileError, "Could not find version file #{filename}"
     end
   end
 end
diff --git a/lib/bundler/ruby_version.rb b/lib/bundler/ruby_version.rb
index 7e9e072b83..aeff07582e 100644
--- a/lib/bundler/ruby_version.rb
+++ b/lib/bundler/ruby_version.rb
@@ -23,7 +23,13 @@ module Bundler
       #   specified must match the version.
 
       @versions = Array(versions).map do |v|
-        op, v = Gem::Requirement.parse(normalize_version(v))
+        normalized_v = normalize_version(v)
+
+        unless Gem::Requirement::PATTERN.match?(normalized_v)
+          raise InvalidArgumentError, "#{v} is not a valid requirement on the Ruby version"
+        end
+
+        op, v = Gem::Requirement.parse(normalized_v)
         op == "=" ? v.to_s : "#{op} #{v}"
       end
 
@@ -37,7 +43,6 @@ module Bundler
 
     def to_s(versions = self.versions)
       output = String.new("ruby #{versions_string(versions)}")
-      output << "p#{patchlevel}" if patchlevel && patchlevel != "-1"
       output << " (#{engine} #{versions_string(engine_versions)})" unless engine == "ruby"
 
       output
@@ -66,8 +71,7 @@ module Bundler
     def ==(other)
       versions == other.versions &&
         engine == other.engine &&
-        engine_versions == other.engine_versions &&
-        patchlevel == other.patchlevel
+        engine_versions == other.engine_versions
     end
 
     def host
@@ -92,8 +96,6 @@ module Bundler
         [:version, versions_string(versions), versions_string(other.versions)]
       elsif @input_engine && !matches?(engine_versions, other.engine_gem_version)
         [:engine_version, versions_string(engine_versions), versions_string(other.engine_versions)]
-      elsif patchlevel && (!patchlevel.is_a?(String) || !other.patchlevel.is_a?(String) || !matches?(patchlevel, other.patchlevel))
-        [:patchlevel, patchlevel, other.patchlevel]
       end
     end
 
diff --git a/lib/bundler/rubygems_ext.rb b/lib/bundler/rubygems_ext.rb
index 18180a81a1..4ad2bdf46f 100644
--- a/lib/bundler/rubygems_ext.rb
+++ b/lib/bundler/rubygems_ext.rb
@@ -13,15 +13,6 @@ require "rubygems" unless defined?(Gem)
 # `Gem::Source` from the redefined `Gem::Specification#source`.
 require "rubygems/source"
 
-# Cherry-pick fixes to `Gem.ruby_version` to be useful for modern Bundler
-# versions and ignore patchlevels
-# (https://github.com/rubygems/rubygems/pull/5472,
-# https://github.com/rubygems/rubygems/pull/5486). May be removed once RubyGems
-# 3.3.12 support is dropped.
-unless Gem.ruby_version.to_s == RUBY_VERSION || RUBY_PATCHLEVEL == -1
-  Gem.instance_variable_set(:@ruby_version, Gem::Version.new(RUBY_VERSION))
-end
-
 module Gem
   # Can be removed once RubyGems 3.5.11 support is dropped
   unless Gem.respond_to?(:freebsd_platform?)
@@ -30,23 +21,185 @@ module Gem
     end
   end
 
+  # Can be removed once RubyGems 3.5.18 support is dropped
+  unless Gem.respond_to?(:open_file_with_lock)
+    class << self
+      remove_method :open_file_with_flock if Gem.respond_to?(:open_file_with_flock)
+
+      def open_file_with_flock(path, &block)
+        # read-write mode is used rather than read-only in order to support NFS
+        mode = IO::RDWR | IO::APPEND | IO::CREAT | IO::BINARY
+        mode |= IO::SHARE_DELETE if IO.const_defined?(:SHARE_DELETE)
+
+        File.open(path, mode) do |io|
+          begin
+            io.flock(File::LOCK_EX)
+          rescue Errno::ENOSYS, Errno::ENOTSUP
+          end
+          yield io
+        end
+      end
+
+      def open_file_with_lock(path, &block)
+        file_lock = "#{path}.lock"
+        open_file_with_flock(file_lock, &block)
+      ensure
+        FileUtils.rm_f file_lock
+      end
+    end
+  end
+
+  require "rubygems/platform"
+
+  class Platform
+    # Can be removed once RubyGems 3.6.9 support is dropped
+    unless respond_to?(:generic)
+      JAVA  = Gem::Platform.new("java") # :nodoc:
+      MSWIN = Gem::Platform.new("mswin32") # :nodoc:
+      MSWIN64 = Gem::Platform.new("mswin64") # :nodoc:
+      MINGW = Gem::Platform.new("x86-mingw32") # :nodoc:
+      X64_MINGW_LEGACY = Gem::Platform.new("x64-mingw32") # :nodoc:
+      X64_MINGW = Gem::Platform.new("x64-mingw-ucrt") # :nodoc:
+      UNIVERSAL_MINGW = Gem::Platform.new("universal-mingw") # :nodoc:
+      WINDOWS = [MSWIN, MSWIN64, UNIVERSAL_MINGW].freeze # :nodoc:
+      X64_LINUX = Gem::Platform.new("x86_64-linux") # :nodoc:
+      X64_LINUX_MUSL = Gem::Platform.new("x86_64-linux-musl") # :nodoc:
+
+      GENERICS = [JAVA, *WINDOWS].freeze # :nodoc:
+      private_constant :GENERICS
+
+      GENERIC_CACHE = GENERICS.each_with_object({}) {|g, h| h[g] = g } # :nodoc:
+      private_constant :GENERIC_CACHE
+
+      class << self
+        ##
+        # Returns the generic platform for the given platform.
+
+        def generic(platform)
+          return Gem::Platform::RUBY if platform.nil? || platform == Gem::Platform::RUBY
+
+          GENERIC_CACHE[platform] ||= begin
+            found = GENERICS.find do |match|
+              platform === match
+            end
+            found || Gem::Platform::RUBY
+          end
+        end
+
+        ##
+        # Returns the platform specificity match for the given spec platform and user platform.
+
+        def platform_specificity_match(spec_platform, user_platform)
+          return -1 if spec_platform == user_platform
+          return 1_000_000 if spec_platform.nil? || spec_platform == Gem::Platform::RUBY || user_platform == Gem::Platform::RUBY
+
+          os_match(spec_platform, user_platform) +
+            cpu_match(spec_platform, user_platform) * 10 +
+            version_match(spec_platform, user_platform) * 100
+        end
+
+        ##
+        # Sorts and filters the best platform match for the given matching specs and platform.
+
+        def sort_and_filter_best_platform_match(matching, platform)
+          return matching if matching.one?
+
+          exact = matching.select {|spec| spec.platform == platform }
+          return exact if exact.any?
+
+          sorted_matching = sort_best_platform_match(matching, platform)
+          exemplary_spec = sorted_matching.first
+
+          sorted_matching.take_while {|spec| same_specificity?(platform, spec, exemplary_spec) && same_deps?(spec, exemplary_spec) }
+        end
+
+        ##
+        # Sorts the best platform match for the given matching specs and platform.
+
+        def sort_best_platform_match(matching, platform)
+          matching.sort_by.with_index do |spec, i|
+            [
+              platform_specificity_match(spec.platform, platform),
+              i, # for stable sort
+            ]
+          end
+        end
+
+        private
+
+        def same_specificity?(platform, spec, exemplary_spec)
+          platform_specificity_match(spec.platform, platform) == platform_specificity_match(exemplary_spec.platform, platform)
+        end
+
+        def same_deps?(spec, exemplary_spec)
+          spec.required_ruby_version == exemplary_spec.required_ruby_version &&
+            spec.required_rubygems_version == exemplary_spec.required_rubygems_version &&
+            spec.dependencies.sort == exemplary_spec.dependencies.sort
+        end
+
+        def os_match(spec_platform, user_platform)
+          if spec_platform.os == user_platform.os
+            0
+          else
+            1
+          end
+        end
+
+        def cpu_match(spec_platform, user_platform)
+          if spec_platform.cpu == user_platform.cpu
+            0
+          elsif spec_platform.cpu == "arm" && user_platform.cpu.to_s.start_with?("arm")
+            0
+          elsif spec_platform.cpu.nil? || spec_platform.cpu == "universal"
+            1
+          else
+            2
+          end
+        end
+
+        def version_match(spec_platform, user_platform)
+          if spec_platform.version == user_platform.version
+            0
+          elsif spec_platform.version.nil?
+            1
+          else
+            2
+          end
+        end
+      end
+
+    end
+  end
+
   require "rubygems/specification"
 
+  # Can be removed once RubyGems 3.5.14 support is dropped
+  VALIDATES_FOR_RESOLUTION = Specification.new.respond_to?(:validate_for_resolution).freeze
+
   class Specification
+    # Can be removed once RubyGems 3.5.15 support is dropped
+    correct_array_attributes = @@default_value.select {|_k,v| v.is_a?(Array) }.keys
+    unless @@array_attributes == correct_array_attributes
+      @@array_attributes = correct_array_attributes # rubocop:disable Style/ClassVars
+    end
+
     require_relative "match_metadata"
     require_relative "match_platform"
 
     include ::Bundler::MatchMetadata
-    include ::Bundler::MatchPlatform
 
-    attr_accessor :remote, :location, :relative_loaded_from
+    attr_accessor :remote, :relative_loaded_from
+
+    module AllowSettingSource
+      attr_writer :source
 
-    remove_method :source
-    attr_writer :source
-    def source
-      (defined?(@source) && @source) || Gem::Source::Installed.new
+      def source
+        (defined?(@source) && @source) || super
+      end
     end
 
+    prepend AllowSettingSource
+
     alias_method :rg_full_gem_path, :full_gem_path
     alias_method :rg_loaded_from,   :loaded_from
 
@@ -82,26 +235,15 @@ module Gem
       end
     end
 
-    remove_method :gem_dir
+    # Can be removed once RubyGems 3.5.21 support is dropped
+    remove_method :gem_dir if method_defined?(:gem_dir, false)
+
     def gem_dir
       full_gem_path
     end
 
-    unless const_defined?(:LATEST_RUBY_WITHOUT_PATCH_VERSIONS)
-      LATEST_RUBY_WITHOUT_PATCH_VERSIONS = Gem::Version.new("2.1")
-
-      alias_method :rg_required_ruby_version=, :required_ruby_version=
-      def required_ruby_version=(req)
-        self.rg_required_ruby_version = req
-
-        @required_ruby_version.requirements.map! do |op, v|
-          if v >= LATEST_RUBY_WITHOUT_PATCH_VERSIONS && v.release.segments.size == 4
-            [op == "~>" ? "=" : op, Gem::Version.new(v.segments.tap {|s| s.delete_at(3) }.join("."))]
-          else
-            [op, v]
-          end
-        end
-      end
+    def insecurely_materialized?
+      false
     end
 
     def groups
@@ -127,10 +269,32 @@ module Gem
       dependencies - development_dependencies
     end
 
-    def deleted_gem?
+    def installation_missing?
       !default_gem? && !File.directory?(full_gem_path)
     end
 
+    def lock_name
+      @lock_name ||= name_tuple.lock_name
+    end
+
+    unless VALIDATES_FOR_RESOLUTION
+      def validate_for_resolution
+        SpecificationPolicy.new(self).validate_for_resolution
+      end
+    end
+
+    if Gem.rubygems_version < Gem::Version.new("3.5.22")
+      module FixPathSourceMissingExtensions
+        def missing_extensions?
+          return false if %w[Bundler::Source::Path Bundler::Source::Gemspec].include?(source.class.name)
+
+          super
+        end
+      end
+
+      prepend FixPathSourceMissingExtensions
+    end
+
     private
 
     def dependencies_to_gemfile(dependencies, group = nil)
@@ -150,6 +314,14 @@ module Gem
     end
   end
 
+  unless VALIDATES_FOR_RESOLUTION
+    class SpecificationPolicy
+      def validate_for_resolution
+        validate_required!
+      end
+    end
+  end
+
   module BetterPermissionError
     def data
       super
@@ -169,26 +341,20 @@ module Gem
 
     include ::Bundler::ForcePlatform
 
+    attr_reader :force_ruby_platform
+
     attr_accessor :source, :groups
 
     alias_method :eql?, :==
 
-    def force_ruby_platform
-      return @force_ruby_platform if defined?(@force_ruby_platform) && !@force_ruby_platform.nil?
-
-      @force_ruby_platform = default_force_ruby_platform
-    end
-
-    def encode_with(coder)
-      to_yaml_properties.each do |ivar|
-        coder[ivar.to_s.sub(/^@/, "")] = instance_variable_get(ivar)
+    unless method_defined?(:encode_with, false)
+      def encode_with(coder)
+        [:@name, :@requirement, :@type, :@prerelease, :@version_requirements].each do |ivar|
+          coder[ivar.to_s.sub(/^@/, "")] = instance_variable_get(ivar)
+        end
       end
     end
 
-    def to_yaml_properties
-      instance_variables.reject {|p| ["@source", "@groups"].include?(p.to_s) }
-    end
-
     def to_lock
       out = String.new("  #{name}")
       unless requirement.none?
@@ -197,106 +363,15 @@ module Gem
       end
       out
     end
-  end
 
-  # Requirements using lambda operator differentiate trailing zeros since rubygems 3.2.6
-  if Gem::Requirement.new("~> 2.0").hash == Gem::Requirement.new("~> 2.0.0").hash
-    class Requirement
-      module CorrectHashForLambdaOperator
-        def hash
-          if requirements.any? {|r| r.first == "~>" }
-            requirements.map {|r| r.first == "~>" ? [r[0], r[1].to_s] : r }.sort.hash
-          else
-            super
-          end
+    if Gem.rubygems_version < Gem::Version.new("3.5.22")
+      module FilterIgnoredSpecs
+        def matching_specs(platform_only = false)
+          super.reject(&:ignored?)
         end
       end
 
-      prepend CorrectHashForLambdaOperator
-    end
-  end
-
-  require "rubygems/platform"
-
-  class Platform
-    JAVA  = Gem::Platform.new("java")
-    MSWIN = Gem::Platform.new("mswin32")
-    MSWIN64 = Gem::Platform.new("mswin64")
-    MINGW = Gem::Platform.new("x86-mingw32")
-    X64_MINGW = [Gem::Platform.new("x64-mingw32"),
-                 Gem::Platform.new("x64-mingw-ucrt")].freeze
-    WINDOWS = [MSWIN, MSWIN64, MINGW, X64_MINGW].flatten.freeze
-    X64_LINUX = Gem::Platform.new("x86_64-linux")
-    X64_LINUX_MUSL = Gem::Platform.new("x86_64-linux-musl")
-
-    if X64_LINUX === X64_LINUX_MUSL
-      remove_method :===
-
-      def ===(other)
-        return nil unless Gem::Platform === other
-
-        # universal-mingw32 matches x64-mingw-ucrt
-        return true if (@cpu == "universal" || other.cpu == "universal") &&
-                       @os.start_with?("mingw") && other.os.start_with?("mingw")
-
-        # cpu
-        ([nil,"universal"].include?(@cpu) || [nil, "universal"].include?(other.cpu) || @cpu == other.cpu ||
-        (@cpu == "arm" && other.cpu.start_with?("arm"))) &&
-
-          # os
-          @os == other.os &&
-
-          # version
-          (
-            (@os != "linux" && (@version.nil? || other.version.nil?)) ||
-            (@os == "linux" && (normalized_linux_version_ext == other.normalized_linux_version_ext || ["musl#{@version}", "musleabi#{@version}", "musleabihf#{@version}"].include?(other.version))) ||
-            @version == other.version
-          )
-      end
-
-      # This is a copy of RubyGems 3.3.23 or higher `normalized_linux_method`.
-      # Once only 3.3.23 is supported, we can use the method in RubyGems.
-      def normalized_linux_version_ext
-        return nil unless @version
-
-        without_gnu_nor_abi_modifiers = @version.sub(/\Agnu/, "").sub(/eabi(hf)?\Z/, "")
-        return nil if without_gnu_nor_abi_modifiers.empty?
-
-        without_gnu_nor_abi_modifiers
-      end
-    end
-
-    if RUBY_ENGINE == "truffleruby" && !defined?(REUSE_AS_BINARY_ON_TRUFFLERUBY)
-      REUSE_AS_BINARY_ON_TRUFFLERUBY = %w[libv8 libv8-node sorbet-static].freeze
-    end
-  end
-
-  Platform.singleton_class.module_eval do
-    unless Platform.singleton_methods.include?(:match_spec?)
-      def match_spec?(spec)
-        match_gem?(spec.platform, spec.name)
-      end
-
-      def match_gem?(platform, gem_name)
-        match_platforms?(platform, Gem.platforms)
-      end
-    end
-
-    match_platforms_defined = Gem::Platform.respond_to?(:match_platforms?, true)
-
-    if !match_platforms_defined || Gem::Platform.send(:match_platforms?, Gem::Platform::X64_LINUX_MUSL, [Gem::Platform::X64_LINUX])
-
-      private
-
-      remove_method :match_platforms? if match_platforms_defined
-
-      def match_platforms?(platform, platforms)
-        platforms.any? do |local_platform|
-          platform.nil? ||
-            local_platform == platform ||
-            (local_platform != Gem::Platform::RUBY && platform =~ local_platform)
-        end
-      end
+      prepend FilterIgnoredSpecs
     end
   end
 
@@ -319,6 +394,20 @@ module Gem
         end
       end
     end
+
+    # Can be removed once RubyGems 3.5.22 support is dropped
+    unless new.respond_to?(:ignored?)
+      def ignored?
+        return @ignored unless @ignored.nil?
+
+        @ignored = missing_extensions?
+      end
+    end
+
+    # Can be removed once RubyGems 3.6.9 support is dropped
+    unless new.respond_to?(:installable_on_platform?)
+      include(::Bundler::MatchPlatform)
+    end
   end
 
   require "rubygems/name_tuple"
@@ -328,7 +417,7 @@ module Gem
     unless Gem::NameTuple.new("a", Gem::Version.new("1"), Gem::Platform.new("x86_64-linux")).platform.is_a?(String)
       alias_method :initialize_with_platform, :initialize
 
-      def initialize(name, version, platform=Gem::Platform::RUBY)
+      def initialize(name, version, platform = Gem::Platform::RUBY)
         if Gem::Platform === platform
           initialize_with_platform(name, version, platform.to_s)
         else
@@ -345,4 +434,70 @@ module Gem
       end
     end
   end
+
+  unless Gem.rubygems_version >= Gem::Version.new("3.5.19")
+    class Resolver::ActivationRequest
+      remove_method :installed?
+
+      def installed?
+        case @spec
+        when Gem::Resolver::VendorSpecification then
+          true
+        else
+          this_spec = full_spec
+
+          Gem::Specification.any? do |s|
+            s == this_spec && s.base_dir == this_spec.base_dir
+          end
+        end
+      end
+    end
+  end
+
+  unless Gem.rubygems_version >= Gem::Version.new("3.6.7")
+    module UnfreezeCompactIndexParsedResponse
+      def parse(line)
+        version, platform, dependencies, requirements = super
+        [version, platform, dependencies.frozen? ? dependencies.dup : dependencies, requirements.frozen? ? requirements.dup : requirements]
+      end
+    end
+
+    Resolver::APISet::GemParser.prepend(UnfreezeCompactIndexParsedResponse)
+  end
+
+  # RubyGems before 4.0.13 split compact index dependency/requirement entries
+  # on every colon, which mangles metadata values that contain colons such as
+  # the `created_at` timestamps the cooldown feature relies on. Split only on
+  # the first colon so those values survive on older RubyGems.
+  #
+  # The module is defined unconditionally so it stays testable on any RubyGems,
+  # but only prepended when the host RubyGems still has the buggy behavior.
+  module SplitCompactIndexEntryOnFirstColon
+    private
+
+    def parse_dependency(string)
+      dependency = string.split(":", 2)
+      dependency[-1] = dependency[-1].split("&") if dependency.size > 1
+      dependency[0] = -dependency[0]
+      dependency
+    end
+  end
+
+  unless Gem.rubygems_version >= Gem::Version.new("4.0.13")
+    Resolver::APISet::GemParser.prepend(SplitCompactIndexEntryOnFirstColon)
+  end
+
+  if Gem.rubygems_version < Gem::Version.new("3.6.0")
+    class Package; end
+    require "rubygems/package/tar_reader"
+    require "rubygems/package/tar_reader/entry"
+
+    module FixFullNameEncoding
+      def full_name
+        super.force_encoding(Encoding::UTF_8)
+      end
+    end
+
+    Package::TarReader::Entry.prepend(FixFullNameEncoding)
+  end
 end
diff --git a/lib/bundler/rubygems_gem_installer.rb b/lib/bundler/rubygems_gem_installer.rb
index d563868cd2..fc019f54d2 100644
--- a/lib/bundler/rubygems_gem_installer.rb
+++ b/lib/bundler/rubygems_gem_installer.rb
@@ -20,17 +20,31 @@ module Bundler
       strict_rm_rf spec.extension_dir
 
       SharedHelpers.filesystem_access(gem_dir, :create) do
-        FileUtils.mkdir_p gem_dir, mode: 0o755
+        FileUtils.mkdir_p gem_dir
       end
 
-      extract_files
+      SharedHelpers.filesystem_access(gem_dir, :write) do
+        extract_files
+      end
 
-      build_extensions if spec.extensions.any?
+      if options[:build_extension] == false
+        warn_skipped_extensions
+      elsif spec.extensions.any?
+        build_extensions
+      end
       write_build_info_file
       run_post_build_hooks
 
-      generate_bin
-      generate_plugins
+      SharedHelpers.filesystem_access(bin_dir, :write) do
+        generate_bin
+      end
+
+      if options[:install_plugin] == false
+        remove_stale_plugins
+        warn_skipped_plugins
+      else
+        generate_plugins
+      end
 
       write_spec
 
@@ -45,7 +59,17 @@ module Bundler
       spec
     end
 
-    def pre_install_checks
+    if Bundler.rubygems.provides?("< 3.5")
+      def pre_install_checks
+        super
+      rescue Gem::FilePermissionError
+        # Ignore permission checks in RubyGems. Instead, go on, and try to write
+        # for real. We properly handle permission errors when they happen.
+        nil
+      end
+    end
+
+    def ensure_writable_dir(dir)
       super
     rescue Gem::FilePermissionError
       # Ignore permission checks in RubyGems. Instead, go on, and try to write
@@ -54,10 +78,7 @@ module Bundler
     end
 
     def generate_plugins
-      return unless Gem::Installer.instance_methods(false).include?(:generate_plugins)
-
-      latest = Gem::Specification.stubs_for(spec.name).first
-      return if latest && latest.version > spec.version
+      return unless Gem::Installer.method_defined?(:generate_plugins, false)
 
       ensure_writable_dir @plugins_dir
 
@@ -68,6 +89,44 @@ module Bundler
       end
     end
 
+    def warn_skipped_extensions
+      return if spec.extensions.empty?
+
+      Bundler.ui.warn "#{spec.full_name} contains native extensions that were not built.\n" \
+                      "To build extensions, unset no_build_extension and run `bundle pristine #{spec.name}`."
+    end
+
+    def warn_skipped_plugins
+      return if spec.plugins.empty?
+
+      Bundler.ui.warn "#{spec.full_name} contains plugins that were not installed.\n" \
+                      "To install plugins, unset no_install_plugin and run `bundle pristine #{spec.name}`."
+    end
+
+    if Bundler.rubygems.provides?("< 3.5.19")
+      def generate_bin_script(filename, bindir)
+        bin_script_path = File.join bindir, formatted_program_filename(filename)
+
+        Gem.open_file_with_lock(bin_script_path) do
+          require "fileutils"
+          FileUtils.rm_f bin_script_path # prior install may have been --no-wrappers
+
+          File.open(bin_script_path, "wb", 0o755) do |file|
+            file.write app_script_text(filename)
+            file.chmod(options[:prog_mode] || 0o755)
+          end
+        end
+
+        verbose bin_script_path
+
+        generate_windows_script filename, bindir
+      end
+    end
+
+    def build_jobs
+      Bundler.settings[:jobs] || super
+    end
+
     def build_extensions
       extension_cache_path = options[:bundler_extension_cache_path]
       extension_dir = spec.extension_dir
@@ -112,17 +171,17 @@ module Bundler
       SharedHelpers.filesystem_access(extension_dir, :create) do
         FileUtils.mkdir_p extension_dir
       end
-      require "shellwords" unless Bundler.rubygems.provides?(">= 3.2.25")
     end
 
     def strict_rm_rf(dir)
       return unless File.exist?(dir)
+      return if Dir.empty?(dir)
 
       parent = File.dirname(dir)
       parent_st = File.stat(parent)
 
       if parent_st.world_writable? && !parent_st.sticky?
-        raise InsecureInstallPathError.new(parent)
+        raise InsecureInstallPathError.new(spec.full_name, dir)
       end
 
       begin
diff --git a/lib/bundler/rubygems_integration.rb b/lib/bundler/rubygems_integration.rb
index b841462263..e04ef23259 100644
--- a/lib/bundler/rubygems_integration.rb
+++ b/lib/bundler/rubygems_integration.rb
@@ -20,10 +20,6 @@ module Bundler
       Gem::Requirement.new(req_str).satisfied_by?(version)
     end
 
-    def supports_bundler_trampolining?
-      provides?(">= 3.3.0.a")
-    end
-
     def build_args
       require "rubygems/command"
       Gem::Command.build_args
@@ -34,6 +30,10 @@ module Bundler
       Gem::Command.build_args = args
     end
 
+    def set_target_rbconfig(path)
+      Gem.set_target_rbconfig(path)
+    end
+
     def loaded_specs(name)
       Gem.loaded_specs[name]
     end
@@ -48,7 +48,7 @@ module Bundler
     end
 
     def validate(spec)
-      Bundler.ui.silence { spec.validate(false) }
+      Bundler.ui.silence { spec.validate_for_resolution }
     rescue Gem::InvalidSpecificationException => e
       error_message = "The gemspec at #{spec.loaded_from} is not valid. Please fix this gemspec.\n" \
         "The validation error was '#{e.message}'\n"
@@ -57,28 +57,6 @@ module Bundler
       nil
     end
 
-    def set_installed_by_version(spec, installed_by_version = Gem::VERSION)
-      return unless spec.respond_to?(:installed_by_version=)
-      spec.installed_by_version = Gem::Version.create(installed_by_version)
-    end
-
-    def spec_missing_extensions?(spec, default = true)
-      return spec.missing_extensions? if spec.respond_to?(:missing_extensions?)
-
-      return false if spec.default_gem?
-      return false if spec.extensions.empty?
-
-      default
-    end
-
-    def spec_matches_for_glob(spec, glob)
-      return spec.matches_for_glob(glob) if spec.respond_to?(:matches_for_glob)
-
-      spec.load_paths.flat_map do |lp|
-        Dir["#{lp}/#{glob}#{suffix_pattern}"]
-      end
-    end
-
     def stub_set_spec(stub, spec)
       stub.instance_variable_set(:@spec, spec)
     end
@@ -156,18 +134,6 @@ module Bundler
       loaded_gem_paths.flatten
     end
 
-    def load_plugins
-      Gem.load_plugins
-    end
-
-    def load_plugin_files(plugin_files)
-      Gem.load_plugin_files(plugin_files)
-    end
-
-    def load_env_plugins
-      Gem.load_env_plugins
-    end
-
     def ui=(obj)
       Gem::DefaultUserInteraction.ui = obj
     end
@@ -211,12 +177,12 @@ module Bundler
       end
     end
 
-    def replace_gem(specs, specs_by_name)
+    def replace_gem(specs_by_name)
       executables = nil
 
       [::Kernel.singleton_class, ::Kernel].each do |kernel_class|
         redefine_method(kernel_class, :gem) do |dep, *reqs|
-          if executables&.include?(File.basename(caller.first.split(":").first))
+          if executables&.include?(File.basename(caller_locations(1, 1).first.path))
             break
           end
 
@@ -248,18 +214,11 @@ module Bundler
           e.requirement = dep.requirement
           raise e
         end
-
-        # backwards compatibility shim, see https://github.com/rubygems/bundler/issues/5102
-        kernel_class.send(:public, :gem) if Bundler.feature_flag.setup_makes_kernel_gem_public?
       end
     end
 
-    # Used to make bin stubs that are not created by bundler work
-    # under bundler. The new Gem.bin_path only considers gems in
-    # +specs+
+    # Used to give better error messages when activating specs outside of the current bundle
     def replace_bin_path(specs_by_name)
-      gem_class = (class << Gem; self; end)
-
       redefine_method(gem_class, :find_spec_for_exe) do |gem_name, *args|
         exec_name = args.first
         raise ArgumentError, "you must supply exec_name" unless exec_name
@@ -295,31 +254,6 @@ module Bundler
 
         spec
       end
-
-      redefine_method(gem_class, :activate_bin_path) do |name, *args|
-        exec_name = args.first
-        return ENV["BUNDLE_BIN_PATH"] if exec_name == "bundle"
-
-        # Copy of Rubygems activate_bin_path impl
-        requirement = args.last
-        spec = find_spec_for_exe name, exec_name, [requirement]
-
-        gem_bin = File.join(spec.full_gem_path, spec.bindir, exec_name)
-        gem_from_path_bin = File.join(File.dirname(spec.loaded_from), spec.bindir, exec_name)
-        File.exist?(gem_bin) ? gem_bin : gem_from_path_bin
-      end
-
-      redefine_method(gem_class, :bin_path) do |name, *args|
-        exec_name = args.first
-        return ENV["BUNDLE_BIN_PATH"] if exec_name == "bundle"
-
-        spec = find_spec_for_exe(name, *args)
-        exec_name ||= spec.default_executable
-
-        gem_bin = File.join(spec.full_gem_path, spec.bindir, exec_name)
-        gem_from_path_bin = File.join(File.dirname(spec.loaded_from), spec.bindir, exec_name)
-        File.exist?(gem_bin) ? gem_bin : gem_from_path_bin
-      end
     end
 
     # Replace or hook into RubyGems to provide a bundlerized view
@@ -335,8 +269,8 @@ module Bundler
       else
         Gem::BUNDLED_GEMS.replace_require(specs) if Gem::BUNDLED_GEMS.respond_to?(:replace_require)
       end
-      replace_gem(specs, specs_by_name)
-      stub_rubygems(specs)
+      replace_gem(specs_by_name)
+      stub_rubygems(specs_by_name.values)
       replace_bin_path(specs_by_name)
 
       Gem.clear_paths
@@ -354,7 +288,6 @@ module Bundler
         default_spec_name = default_spec.name
         next if specs_by_name.key?(default_spec_name)
 
-        specs << default_spec
         specs_by_name[default_spec_name] = default_spec
       end
 
@@ -365,11 +298,7 @@ module Bundler
       @replaced_methods.each do |(sym, klass), method|
         redefine_method(klass, sym, method)
       end
-      if Binding.public_method_defined?(:source_location)
-        post_reset_hooks.reject! {|proc| proc.binding.source_location[0] == __FILE__ }
-      else
-        post_reset_hooks.reject! {|proc| proc.binding.eval("__FILE__") == __FILE__ }
-      end
+      post_reset_hooks.reject! {|proc| proc.binding.source_location[0] == __FILE__ }
       @replaced_methods.clear
     end
 
@@ -411,9 +340,13 @@ module Bundler
         Gem::Specification.all = specs
       end
 
-      redefine_method((class << Gem; self; end), :finish_resolve) do |*|
+      redefine_method(gem_class, :finish_resolve) do |*|
         []
       end
+
+      redefine_method(gem_class, :load_plugins) do |*|
+        load_plugin_files specs.flat_map(&:plugins)
+      end
     end
 
     def plain_specs
@@ -446,7 +379,9 @@ module Bundler
     def download_gem(spec, uri, cache_dir, fetcher)
       require "rubygems/remote_fetcher"
       uri = Bundler.settings.mirror_for(uri)
-      Bundler::Retry.new("download gem from #{uri}").attempts do
+      redacted_uri = Gem::Uri.redact(uri)
+
+      Bundler::Retry.new("download gem from #{redacted_uri}").attempts do
         gem_file_name = spec.file_name
         local_gem_path = File.join cache_dir, gem_file_name
         return if File.exist? local_gem_path
@@ -468,7 +403,7 @@ module Bundler
         end
       end
     rescue Gem::RemoteFetcher::FetchError => e
-      raise Bundler::HTTPError, "Could not download gem from #{uri} due to underlying error <#{e.message}>"
+      raise Bundler::HTTPError, "Could not download gem from #{redacted_uri} due to underlying error <#{e.message}>"
     end
 
     def build(spec, skip_validation = false)
@@ -481,11 +416,7 @@ module Bundler
     end
 
     def all_specs
-      SharedHelpers.major_deprecation 2, "Bundler.rubygems.all_specs has been removed in favor of Bundler.rubygems.installed_specs"
-
-      Gem::Specification.stubs.map do |stub|
-        StubSpecification.from_stub(stub)
-      end
+      SharedHelpers.feature_removed! "Bundler.rubygems.all_specs has been removed in favor of Bundler.rubygems.installed_specs"
     end
 
     def installed_specs
@@ -501,7 +432,7 @@ module Bundler
     end
 
     def find_bundler(version)
-      find_name("bundler").find {|s| s.version.to_s == version }
+      find_name("bundler").find {|s| s.version.to_s == version.to_s }
     end
 
     def find_name(name)
@@ -511,6 +442,12 @@ module Bundler
     def default_stubs
       Gem::Specification.default_stubs("*.gemspec")
     end
+
+    private
+
+    def gem_class
+      class << Gem; self; end
+    end
   end
 
   def self.rubygems
diff --git a/lib/bundler/runtime.rb b/lib/bundler/runtime.rb
index 54aa30ce0b..5280e72aa2 100644
--- a/lib/bundler/runtime.rb
+++ b/lib/bundler/runtime.rb
@@ -10,7 +10,7 @@ module Bundler
     end
 
     def setup(*groups)
-      @definition.ensure_equivalent_gemfile_and_lockfile if Bundler.frozen_bundle?
+      @definition.ensure_equivalent_gemfile_and_lockfile
 
       # Has to happen first
       clean_load_path
@@ -50,35 +50,30 @@ module Bundler
       Plugin.hook(Plugin::Events::GEM_BEFORE_REQUIRE_ALL, dependencies)
 
       dependencies.each do |dep|
-        required_file = nil
         Plugin.hook(Plugin::Events::GEM_BEFORE_REQUIRE, dep)
 
-        begin
-          # Loop through all the specified autorequires for the
-          # dependency. If there are none, use the dependency's name
-          # as the autorequire.
-          Array(dep.autorequire || dep.name).each do |file|
-            # Allow `require: true` as an alias for `require: <name>`
-            file = dep.name if file == true
-            required_file = file
-            begin
-              Kernel.require file
-            rescue RuntimeError => e
-              raise e if e.is_a?(LoadError) # we handle this a little later
+        # Loop through all the specified autorequires for the
+        # dependency. If there are none, use the dependency's name
+        # as the autorequire.
+        Array(dep.autorequire || dep.name).each do |file|
+          # Allow `require: true` as an alias for `require: <name>`
+          file = dep.name if file == true
+          required_file = file
+          begin
+            Kernel.require required_file
+          rescue LoadError => e
+            if dep.autorequire.nil? && e.path == required_file
+              if required_file.include?("-")
+                required_file = required_file.tr("-", "/")
+                retry
+              end
+            else
               raise Bundler::GemRequireError.new e,
                 "There was an error while trying to load the gem '#{file}'."
             end
-          end
-        rescue LoadError => e
-          raise if dep.autorequire || e.path != required_file
-
-          if dep.autorequire.nil? && dep.name.include?("-")
-            begin
-              namespaced_file = dep.name.tr("-", "/")
-              Kernel.require namespaced_file
-            rescue LoadError => e
-              raise if e.path != namespaced_file
-            end
+          rescue StandardError => e
+            raise Bundler::GemRequireError.new e,
+              "There was an error while trying to load the gem '#{file}'."
           end
         end
 
@@ -135,8 +130,15 @@ module Bundler
 
       specs_to_cache.each do |spec|
         next if spec.name == "bundler"
-        next if spec.source.is_a?(Source::Gemspec)
-        spec.source.cache(spec, custom_path) if spec.source.respond_to?(:cache)
+
+        source = spec.source
+        next if source.is_a?(Source::Gemspec)
+
+        if source.respond_to?(:migrate_cache)
+          source.migrate_cache(custom_path, local: local)
+        elsif source.respond_to?(:cache)
+          source.cache(spec, custom_path)
+        end
       end
 
       Dir[cache_path.join("*/.git")].each do |git_dir|
@@ -172,7 +174,14 @@ module Bundler
       spec_cache_paths     = []
       spec_gemspec_paths   = []
       spec_extension_paths = []
-      Bundler.rubygems.add_default_gems_to(specs).values.each do |spec|
+      specs_to_keep = Bundler.rubygems.add_default_gems_to(specs).values
+
+      current_bundler = Bundler.rubygems.find_bundler(Bundler.gem_version)
+      if current_bundler
+        specs_to_keep << current_bundler
+      end
+
+      specs_to_keep.each do |spec|
         spec_gem_paths << spec.full_gem_path
         # need to check here in case gems are nested like for the rails git repo
         md = %r{(.+bundler/gems/.+-[a-f0-9]{7,12})}.match(spec.full_gem_path)
@@ -238,7 +247,11 @@ module Bundler
 
         cached.each do |path|
           Bundler.ui.info "  * #{File.basename(path)}"
-          File.delete(path)
+
+          begin
+            File.delete(path)
+          rescue Errno::ENOENT
+          end
         end
       end
     end
@@ -268,10 +281,10 @@ module Bundler
 
     def setup_manpath
       # Add man/ subdirectories from activated bundles to MANPATH for man(1)
-      manuals = $LOAD_PATH.map do |path|
+      manuals = $LOAD_PATH.filter_map do |path|
         man_subdir = path.sub(/lib$/, "man")
         man_subdir unless Dir[man_subdir + "/man?/"].empty?
-      end.compact
+      end
 
       return if manuals.empty?
       Bundler::SharedHelpers.set_env "MANPATH", manuals.concat(
diff --git a/lib/bundler/self_manager.rb b/lib/bundler/self_manager.rb
index 5accda4bcb..82efbf56a4 100644
--- a/lib/bundler/self_manager.rb
+++ b/lib/bundler/self_manager.rb
@@ -7,13 +7,15 @@ module Bundler
   #
   class SelfManager
     def restart_with_locked_bundler_if_needed
-      return unless needs_switching? && installed?
+      restart_version = find_restart_version
+      return unless restart_version && installed?(restart_version)
 
       restart_with(restart_version)
     end
 
     def install_locked_bundler_and_restart_with_it_if_needed
-      return unless needs_switching?
+      restart_version = find_restart_version
+      return unless restart_version
 
       if restart_version == lockfile_version
         Bundler.ui.info \
@@ -29,8 +31,6 @@ module Bundler
     end
 
     def update_bundler_and_restart_with_it_if_needed(target)
-      return unless autoswitching_applies?
-
       spec = resolve_update_version_from(target)
       return unless spec
 
@@ -38,7 +38,7 @@ module Bundler
 
       Bundler.ui.info "Updating bundler to #{version}."
 
-      install(spec)
+      install(spec) unless installed?(version)
 
       restart_with(version)
     end
@@ -63,36 +63,43 @@ module Bundler
     end
 
     def install(spec)
+      spec.source.download(spec)
       spec.source.install(spec)
     end
 
     def restart_with(version)
       configured_gem_home = ENV["GEM_HOME"]
+      configured_orig_gem_home = ENV["BUNDLER_ORIG_GEM_HOME"]
       configured_gem_path = ENV["GEM_PATH"]
+      configured_orig_gem_path = ENV["BUNDLER_ORIG_GEM_PATH"]
 
-      cmd = [$PROGRAM_NAME, *ARGV]
-      cmd.unshift(Gem.ruby) unless File.executable?($PROGRAM_NAME)
+      argv0 = File.exist?($PROGRAM_NAME) ? $PROGRAM_NAME : Process.argv0
+      cmd = [argv0, *ARGV]
+      cmd.unshift(Gem.ruby) unless File.executable?(argv0)
 
       Bundler.with_original_env do
         Kernel.exec(
-          { "GEM_HOME" => configured_gem_home, "GEM_PATH" => configured_gem_path, "BUNDLER_VERSION" => version.to_s },
+          {
+            "GEM_HOME" => configured_gem_home,
+            "BUNDLER_ORIG_GEM_HOME" => configured_orig_gem_home,
+            "GEM_PATH" => configured_gem_path,
+            "BUNDLER_ORIG_GEM_PATH" => configured_orig_gem_path,
+            "BUNDLER_VERSION" => version.to_s,
+          },
           *cmd
         )
       end
     end
 
-    def needs_switching?
+    def needs_switching?(restart_version)
       autoswitching_applies? &&
-        released?(lockfile_version) &&
-        !running?(lockfile_version) &&
-        !updating? &&
-        Bundler.settings[:version] != "system"
+        released?(restart_version) &&
+        !running?(restart_version)
     end
 
     def autoswitching_applies?
-      ENV["BUNDLER_VERSION"].nil? &&
-        Bundler.rubygems.supports_bundler_trampolining? &&
-        SharedHelpers.in_bundle? &&
+      (ENV["BUNDLER_VERSION"].nil? || ENV["BUNDLER_VERSION"].empty?) &&
+        ruby_can_restart_with_same_arguments? &&
         lockfile_version
     end
 
@@ -126,6 +133,7 @@ module Bundler
     end
 
     def find_latest_matching_spec(requirement)
+      Bundler.configure
       local_result = find_latest_matching_spec_from_collection(local_specs, requirement)
       return local_result if local_result && requirement.specific?
 
@@ -151,18 +159,18 @@ module Bundler
       !version.to_s.end_with?(".dev")
     end
 
-    def updating?
-      "update".start_with?(ARGV.first || " ") && ARGV[1..-1].any? {|a| a.start_with?("--bundler") }
+    def ruby_can_restart_with_same_arguments?
+      $PROGRAM_NAME != "-e"
     end
 
-    def installed?
+    def installed?(restart_version)
       Bundler.configure
 
       Bundler.rubygems.find_bundler(restart_version.to_s)
     end
 
     def current_version
-      @current_version ||= Gem::Version.new(Bundler::VERSION)
+      @current_version ||= Bundler.gem_version
     end
 
     def lockfile_version
@@ -174,13 +182,16 @@ module Bundler
       @lockfile_version = nil
     end
 
-    def restart_version
-      return @restart_version if defined?(@restart_version)
-      # BUNDLE_VERSION=x.y.z
-      @restart_version = Gem::Version.new(Bundler.settings[:version])
-    rescue ArgumentError
-      # BUNDLE_VERSION=lockfile
-      @restart_version = lockfile_version
+    def find_restart_version
+      return unless SharedHelpers.in_bundle?
+
+      configured_version = Bundler.settings[:version]
+      return if configured_version == "system"
+
+      restart_version = configured_version == "lockfile" ? lockfile_version : Gem::Version.new(configured_version)
+      return unless needs_switching?(restart_version)
+
+      restart_version
     end
   end
 end
diff --git a/lib/bundler/settings.rb b/lib/bundler/settings.rb
index 4aef0cf1b3..fd77c2f7fc 100644
--- a/lib/bundler/settings.rb
+++ b/lib/bundler/settings.rb
@@ -7,13 +7,10 @@ module Bundler
     autoload :Validator, File.expand_path("settings/validator", __dir__)
 
     BOOL_KEYS = %w[
-      allow_offline_install
-      auto_clean_without_path
       auto_install
       cache_all
       cache_all_platforms
       clean
-      default_install_uses_path
       deployment
       disable_checksum_validation
       disable_exec_load
@@ -22,44 +19,32 @@ module Bundler
       disable_shared_gems
       disable_version_check
       force_ruby_platform
-      forget_cli_options
       frozen
       gem.changelog
       gem.coc
       gem.mit
+      gem.bundle
       git.allow_insecure
       global_gem_cache
       ignore_messages
       init_gems_rb
       inline
+      lockfile_checksums
+      no_build_extension
       no_install
+      no_install_plugin
       no_prune
-      path_relative_to_cwd
       path.system
       plugins
       prefer_patch
-      print_only_version_number
-      setup_makes_kernel_gem_public
       silence_deprecations
       silence_root_warning
       update_requires_all_flag
-    ].freeze
-
-    REMEMBERED_KEYS = %w[
-      bin
-      cache_all
-      clean
-      deployment
-      frozen
-      no_prune
-      path
-      shebang
-      path.system
-      without
-      with
+      verbose
     ].freeze
 
     NUMBER_KEYS = %w[
+      cooldown
       jobs
       redirect
       retry
@@ -77,14 +62,17 @@ module Bundler
       bin
       cache_path
       console
+      default_cli_command
       gem.ci
       gem.github_username
       gem.linter
       gem.rubocop
       gem.test
       gemfile
+      lockfile
       path
       shebang
+      simulate_version
       system_bindir
       trust-policy
       version
@@ -98,6 +86,11 @@ module Bundler
       "BUNDLE_RETRY" => 3,
       "BUNDLE_TIMEOUT" => 10,
       "BUNDLE_VERSION" => "lockfile",
+      "BUNDLE_LOCKFILE_CHECKSUMS" => true,
+      "BUNDLE_CACHE_ALL" => true,
+      "BUNDLE_PLUGINS" => true,
+      "BUNDLE_GLOBAL_GEM_CACHE" => false,
+      "BUNDLE_UPDATE_REQUIRES_ALL_FLAG" => false,
     }.freeze
 
     def initialize(root = nil)
@@ -129,12 +122,8 @@ module Bundler
     end
 
     def set_command_option(key, value)
-      if !is_remembered(key) || Bundler.feature_flag.forget_cli_options?
-        temporary(key => value)
-        value
-      else
-        set_local(key, value)
-      end
+      temporary(key => value)
+      value
     end
 
     def set_command_option_if_given(key, value)
@@ -273,7 +262,7 @@ module Bundler
       def use_system_gems?
         return true if system_path
         return false if explicit_path
-        !Bundler.feature_flag.default_install_uses_path?
+        !Bundler.feature_flag.bundler_5_mode?
       end
 
       def base_path
@@ -318,6 +307,10 @@ module Bundler
       @app_cache_path ||= self[:cache_path] || "vendor/cache"
     end
 
+    def installation_parallelization
+      self[:jobs] || processor_count
+    end
+
     def validate!
       all.each do |raw_key|
         [@local_config, @env_config, @global_config].each do |settings|
@@ -388,10 +381,6 @@ module Bundler
       ARRAY_KEYS.include?(self.class.key_to_s(key))
     end
 
-    def is_remembered(key)
-      REMEMBERED_KEYS.include?(self.class.key_to_s(key))
-    end
-
     def is_credential(key)
       key == "gem.push_key"
     end
@@ -425,8 +414,12 @@ module Bundler
       Validator.validate!(raw_key, converted_value(value, raw_key), hash)
 
       return unless file
+
+      SharedHelpers.filesystem_access(file.dirname, :create) do |p|
+        FileUtils.mkdir_p(p)
+      end
+
       SharedHelpers.filesystem_access(file) do |p|
-        FileUtils.mkdir_p(p.dirname)
         p.open("w") {|f| f.write(serializer_class.dump(hash)) }
       end
     end
@@ -491,7 +484,11 @@ module Bundler
       SharedHelpers.filesystem_access(config_file, :read) do |file|
         valid_file = file.exist? && !file.size.zero?
         return {} unless valid_file
-        serializer_class.load(file.read).inject({}) do |config, (k, v)|
+        (serializer_class.load(file.read) || {}).inject({}) do |config, (k, v)|
+          k = k.dup
+          k << "/" if /https?:/i.match?(k) && !k.end_with?("/", "__#{FALLBACK_TIMEOUT_URI_OPTION.upcase}")
+          k.gsub!(".", "__")
+
           unless k.start_with?("#")
             if k.include?("-")
               Bundler.ui.warn "Your #{file} config includes `#{k}`, which contains the dash character (`-`).\n" \
@@ -519,26 +516,25 @@ module Bundler
       YAMLSerializer
     end
 
-    PER_URI_OPTIONS = %w[
-      fallback_timeout
-    ].freeze
+    FALLBACK_TIMEOUT_URI_OPTION = "fallback_timeout"
 
     NORMALIZE_URI_OPTIONS_PATTERN =
       /
         \A
         (\w+\.)? # optional prefix key
         (https?.*?) # URI
-        (\.#{Regexp.union(PER_URI_OPTIONS)})? # optional suffix key
+        (\.#{FALLBACK_TIMEOUT_URI_OPTION})? # optional suffix key
         \z
       /ix
 
     def self.key_for(key)
-      key = normalize_uri(key).to_s if key.is_a?(String) && key.start_with?("http", "mirror.http")
-      key = key_to_s(key).gsub(".", "__")
+      key = key_to_s(key)
+      key = normalize_uri(key) if key.start_with?("http", "mirror.http")
+      key = key.gsub(".", "__")
       key.gsub!("-", "___")
       key.upcase!
 
-      key.prepend("BUNDLE_")
+      key.gsub(/\A([ #]*)/, '\1BUNDLE_')
     end
 
     # TODO: duplicates Rubygems#normalize_uri
diff --git a/lib/bundler/settings/validator.rb b/lib/bundler/settings/validator.rb
index 0a57ea7f03..70a0ca36d4 100644
--- a/lib/bundler/settings/validator.rb
+++ b/lib/bundler/settings/validator.rb
@@ -75,27 +75,11 @@ module Bundler
         end
       end
 
-      rule %w[path], "relative paths are expanded relative to the current working directory" do |key, value, settings|
-        next if value.nil?
-
-        path = Pathname.new(value)
-        next if !path.relative? || !Bundler.feature_flag.path_relative_to_cwd?
-
-        path = path.expand_path
-
-        root = begin
-                 Bundler.root
-               rescue GemfileNotFound
-                 Pathname.pwd.expand_path
-               end
-
-        path = begin
-                 path.relative_path_from(root)
-               rescue ArgumentError
-                 path
-               end
-
-        set(settings, key, path.to_s)
+      rule %w[default_cli_command], "default_cli_command must be either 'install' or 'cli_help'" do |key, value, _settings|
+        valid_values = %w[install cli_help]
+        if !value.nil? && !valid_values.include?(value.to_s)
+          fail!(key, value, "must be one of: #{valid_values.join(", ")}")
+        end
       end
     end
   end
diff --git a/lib/bundler/setup.rb b/lib/bundler/setup.rb
index 6010d66742..5a0fd8e0e3 100644
--- a/lib/bundler/setup.rb
+++ b/lib/bundler/setup.rb
@@ -5,6 +5,9 @@ require_relative "shared_helpers"
 if Bundler::SharedHelpers.in_bundle?
   require_relative "../bundler"
 
+  # autoswitch to locked Bundler version if available
+  Bundler.auto_switch
+
   # try to auto_install first before we get to the `Bundler.ui.silence`, so user knows what is happening
   Bundler.auto_install
 
diff --git a/lib/bundler/shared_helpers.rb b/lib/bundler/shared_helpers.rb
index 28f0cdff19..2aa8abe0a0 100644
--- a/lib/bundler/shared_helpers.rb
+++ b/lib/bundler/shared_helpers.rb
@@ -10,8 +10,6 @@ module Bundler
   autoload :NULL, File.expand_path("constants", __dir__)
 
   module SharedHelpers
-    autoload :Pathname, "pathname"
-
     def root
       gemfile = find_gemfile
       raise GemfileNotFound, "Could not locate Gemfile" unless gemfile
@@ -25,6 +23,9 @@ module Bundler
     end
 
     def default_lockfile
+      given = ENV["BUNDLE_LOCKFILE"]
+      return Pathname.new(given) if given && !given.empty?
+
       gemfile = default_gemfile
 
       case gemfile.basename.to_s
@@ -57,7 +58,7 @@ module Bundler
 
     def pwd
       Bundler.rubygems.ext_lock.synchronize do
-        Pathname.pwd
+        Dir.pwd
       end
     end
 
@@ -96,14 +97,17 @@ module Bundler
     #   given block
     #
     # @example
-    #   filesystem_access("vendor/cache", :write) do
+    #   filesystem_access("vendor/cache", :create) do
     #     FileUtils.mkdir_p("vendor/cache")
     #   end
     #
     # @see {Bundler::PermissionError}
     def filesystem_access(path, action = :write, &block)
       yield(path.dup)
-    rescue Errno::EACCES
+    rescue Errno::EACCES => e
+      path_basename = File.basename(path.to_s)
+      raise unless e.message.include?(path_basename) || action == :create
+
       raise PermissionError.new(path, action)
     rescue Errno::EAGAIN
       raise TemporaryResourceError.new(path, action)
@@ -113,30 +117,27 @@ module Bundler
       raise NoSpaceOnDeviceError.new(path, action)
     rescue Errno::ENOTSUP
       raise OperationNotSupportedError.new(path, action)
+    rescue Errno::EPERM
+      raise OperationNotPermittedError.new(path, action)
+    rescue Errno::EROFS
+      raise ReadOnlyFileSystemError.new(path, action)
     rescue Errno::EEXIST, Errno::ENOENT
       raise
     rescue SystemCallError => e
-      raise GenericSystemCallError.new(e, "There was an error accessing `#{path}`.")
+      raise GenericSystemCallError.new(e, "There was an error #{[:create, :write].include?(action) ? "creating" : "accessing"} `#{path}`.")
     end
 
-    def major_deprecation(major_version, message, removed_message: nil, print_caller_location: false)
-      if print_caller_location
-        caller_location = caller_locations(2, 2).first
-        suffix = " (called at #{caller_location.path}:#{caller_location.lineno})"
-        message += suffix
-        removed_message += suffix if removed_message
-      end
+    def feature_deprecated!(message)
+      return unless prints_major_deprecations?
 
-      bundler_major_version = Bundler.bundler_major_version
-      if bundler_major_version > major_version
-        require_relative "errors"
-        raise DeprecatedError, "[REMOVED] #{removed_message || message}"
-      end
-
-      return unless bundler_major_version >= major_version && prints_major_deprecations?
       Bundler.ui.warn("[DEPRECATED] #{message}")
     end
 
+    def feature_removed!(message)
+      require_relative "errors"
+      raise RemovedError, "[REMOVED] #{message}"
+    end
+
     def print_major_deprecations!
       multiple_gemfiles = search_up(".") do |dir|
         gemfiles = gemfile_names.select {|gf| File.file? File.expand_path(gf, dir) }
@@ -160,10 +161,10 @@ module Bundler
       extra_deps = new_deps - old_deps
       return if extra_deps.empty?
 
-      Bundler.ui.debug "#{spec.full_name} from #{spec.remote} has either corrupted API or lockfile dependencies" \
+      Bundler.ui.debug "#{spec.full_name} from #{spec.remote} has corrupted API dependencies" \
         " (was expecting #{old_deps.map(&:to_s)}, but the real spec has #{new_deps.map(&:to_s)})"
       raise APIResponseMismatchError,
-        "Downloading #{spec.full_name} revealed dependencies not in the API or the lockfile (#{extra_deps.join(", ")})." \
+        "Downloading #{spec.full_name} revealed dependencies not in the API (#{extra_deps.join(", ")})." \
         "\nRunning `bundle update #{spec.name}` should fix the problem."
     end
 
@@ -274,15 +275,7 @@ module Bundler
       until !File.directory?(current) || current == previous
         if ENV["BUNDLER_SPEC_RUN"]
           # avoid stepping above the tmp directory when testing
-          gemspec = if ENV["GEM_COMMAND"]
-            # for Ruby Core
-            "lib/bundler/bundler.gemspec"
-          else
-            "bundler.gemspec"
-          end
-
-          # avoid stepping above the tmp directory when testing
-          return nil if File.file?(File.join(current, gemspec))
+          return nil if File.directory?(File.join(current, "tmp"))
         end
 
         names.each do |name|
@@ -308,24 +301,43 @@ module Bundler
     def set_bundle_variables
       Bundler::SharedHelpers.set_env "BUNDLE_BIN_PATH", bundle_bin_path
       Bundler::SharedHelpers.set_env "BUNDLE_GEMFILE", find_gemfile.to_s
+      Bundler::SharedHelpers.set_env "BUNDLE_LOCKFILE", default_lockfile.to_s
       Bundler::SharedHelpers.set_env "BUNDLER_VERSION", Bundler::VERSION
       Bundler::SharedHelpers.set_env "BUNDLER_SETUP", File.expand_path("setup", __dir__)
     end
 
     def bundle_bin_path
       # bundler exe & lib folders have same root folder, typical gem installation
-      exe_file = File.expand_path("../../exe/bundle", __dir__)
+      exe_file = File.join(source_root, "exe/bundle")
 
       # for Ruby core repository testing
-      exe_file = File.expand_path("../../libexec/bundle", __dir__) unless File.exist?(exe_file)
+      exe_file = File.join(source_root, "libexec/bundle") unless File.exist?(exe_file)
 
       # bundler is a default gem, exe path is separate
-      exe_file = Bundler.rubygems.bin_path("bundler", "bundle", VERSION) unless File.exist?(exe_file)
+      exe_file = Gem.bin_path("bundler", "bundle", VERSION) unless File.exist?(exe_file)
 
       exe_file
     end
     public :bundle_bin_path
 
+    def gemspec_path
+      # inside a gem repository, typical gem installation
+      gemspec_file = File.join(source_root, "../../specifications/bundler-#{VERSION}.gemspec")
+
+      # for Ruby core repository testing
+      gemspec_file = File.expand_path("bundler.gemspec", __dir__) unless File.exist?(gemspec_file)
+
+      # bundler is a default gem
+      gemspec_file = File.join(Gem.default_specifications_dir, "bundler-#{VERSION}.gemspec") unless File.exist?(gemspec_file)
+
+      gemspec_file
+    end
+    public :gemspec_path
+
+    def source_root
+      File.expand_path("../..", __dir__)
+    end
+
     def set_path
       validate_bundle_path
       paths = (ENV["PATH"] || "").split(File::PATH_SEPARATOR)
@@ -370,7 +382,6 @@ module Bundler
     end
 
     def prints_major_deprecations?
-      require_relative "../bundler"
       return false if Bundler.settings[:silence_deprecations]
       require_relative "deprecate"
       return false if Bundler::Deprecate.skip
diff --git a/lib/bundler/similarity_detector.rb b/lib/bundler/similarity_detector.rb
deleted file mode 100644
index 50e66b9cab..0000000000
--- a/lib/bundler/similarity_detector.rb
+++ /dev/null
@@ -1,63 +0,0 @@
-# frozen_string_literal: true
-
-module Bundler
-  class SimilarityDetector
-    SimilarityScore = Struct.new(:string, :distance)
-
-    # initialize with an array of words to be matched against
-    def initialize(corpus)
-      @corpus = corpus
-    end
-
-    # return an array of words similar to 'word' from the corpus
-    def similar_words(word, limit = 3)
-      words_by_similarity = @corpus.map {|w| SimilarityScore.new(w, levenshtein_distance(word, w)) }
-      words_by_similarity.select {|s| s.distance <= limit }.sort_by(&:distance).map(&:string)
-    end
-
-    # return the result of 'similar_words', concatenated into a list
-    # (eg "a, b, or c")
-    def similar_word_list(word, limit = 3)
-      words = similar_words(word, limit)
-      if words.length == 1
-        words[0]
-      elsif words.length > 1
-        [words[0..-2].join(", "), words[-1]].join(" or ")
-      end
-    end
-
-    protected
-
-    # https://www.informit.com/articles/article.aspx?p=683059&seqNum=36
-    def levenshtein_distance(this, that, ins = 2, del = 2, sub = 1)
-      # ins, del, sub are weighted costs
-      return nil if this.nil?
-      return nil if that.nil?
-      dm = [] # distance matrix
-
-      # Initialize first row values
-      dm[0] = (0..this.length).collect {|i| i * ins }
-      fill = [0] * (this.length - 1)
-
-      # Initialize first column values
-      (1..that.length).each do |i|
-        dm[i] = [i * del, fill.flatten]
-      end
-
-      # populate matrix
-      (1..that.length).each do |i|
-        (1..this.length).each do |j|
-          # critical comparison
-          dm[i][j] = [
-            dm[i - 1][j - 1] + (this[j - 1] == that[i - 1] ? 0 : sub),
-            dm[i][j - 1] + ins,
-            dm[i - 1][j] + del,
-          ].min
-        end
-      end
-
-      # The last value in matrix is the Levenshtein distance between the strings
-      dm[that.length][this.length]
-    end
-  end
-end
diff --git a/lib/bundler/source.rb b/lib/bundler/source.rb
index 115dbd1378..cf71be8801 100644
--- a/lib/bundler/source.rb
+++ b/lib/bundler/source.rb
@@ -31,10 +31,14 @@ module Bundler
       message
     end
 
+    def download(*); end
+
     def can_lock?(spec)
       spec.source == self
     end
 
+    def prefer_local!; end
+
     def local!; end
 
     def local_only!; end
@@ -77,7 +81,7 @@ module Bundler
     end
 
     def extension_cache_path(spec)
-      return unless Bundler.feature_flag.global_gem_cache?
+      return unless Bundler.settings[:global_gem_cache]
       return unless source_slug = extension_cache_slug(spec)
       Bundler.user_cache.join(
         "extensions", Gem::Platform.local.to_s, Bundler.ruby_scope,
diff --git a/lib/bundler/source/gemspec.rb b/lib/bundler/source/gemspec.rb
index 7e3447e776..ed766dbe74 100644
--- a/lib/bundler/source/gemspec.rb
+++ b/lib/bundler/source/gemspec.rb
@@ -4,14 +4,15 @@ module Bundler
   class Source
     class Gemspec < Path
       attr_reader :gemspec
+      attr_writer :checksum_store
 
       def initialize(options)
         super
         @gemspec = options["gemspec"]
       end
 
-      def as_path_source
-        Path.new(options)
+      def to_s
+        "gemspec at `#{@path}`"
       end
     end
   end
diff --git a/lib/bundler/source/git.rb b/lib/bundler/source/git.rb
index 198e335bb6..a002a2570a 100644
--- a/lib/bundler/source/git.rb
+++ b/lib/bundler/source/git.rb
@@ -32,6 +32,20 @@ module Bundler
         @local      = false
       end
 
+      def remote!
+        return if @allow_remote
+
+        @local_specs = nil
+        @allow_remote = true
+      end
+
+      def cached!
+        return if @allow_cached
+
+        @local_specs = nil
+        @allow_cached = true
+      end
+
       def self.from_lock(options)
         new(options.merge("uri" => options.delete("remote")))
       end
@@ -56,13 +70,13 @@ module Bundler
       end
 
       def hash
-        [self.class, uri, ref, branch, name, version, glob, submodules].hash
+        [self.class, uri, ref, branch, name, glob, submodules].hash
       end
 
       def eql?(other)
         other.is_a?(Git) && uri == other.uri && ref == other.ref &&
           branch == other.branch && name == other.name &&
-          version == other.version && glob == other.glob &&
+          glob == other.glob &&
           submodules == other.submodules
       end
 
@@ -88,7 +102,7 @@ module Bundler
       end
 
       def identifier
-        uri_with_specifiers([humanized_ref, cached_revision, glob_for_display])
+        uri_with_specifiers([humanized_ref, locked_revision, glob_for_display])
       end
 
       def uri_with_specifiers(specifiers)
@@ -150,7 +164,8 @@ module Bundler
             "does not exist. Run `bundle config unset local.#{override_for(original_path)}` to remove the local override"
         end
 
-        set_local!(path)
+        @local = true
+        set_paths!(path)
 
         # Create a new git proxy without the cached revision
         # so the Gemfile.lock always picks up the new revision.
@@ -161,10 +176,10 @@ module Bundler
             "#{current_branch} but Gemfile specifies #{branch}"
         end
 
-        changed = cached_revision && cached_revision != revision
+        changed = locked_revision && locked_revision != revision
 
-        if !Bundler.settings[:disable_local_revision_check] && changed && !@unlocked && !git_proxy.contains?(cached_revision)
-          raise GitError, "The Gemfile lock is pointing to revision #{shortref_for_display(cached_revision)} " \
+        if !Bundler.settings[:disable_local_revision_check] && changed && !@unlocked && !git_proxy.contains?(locked_revision)
+          raise GitError, "The Gemfile lock is pointing to revision #{shortref_for_display(locked_revision)} " \
             "but the current branch in your local override for #{name} does not contain such commit. " \
             "Please make sure your branch is up to date."
         end
@@ -173,13 +188,16 @@ module Bundler
       end
 
       def specs(*)
-        set_local!(app_cache_path) if has_app_cache? && !local?
+        set_cache_path!(app_cache_path) if use_app_cache?
 
         if requires_checkout? && !@copied
-          fetch
-          git_proxy.copy_to(install_path, submodules)
-          serialize_gemspecs_in(install_path)
-          @copied = true
+          Plugin.hook(Plugin::Events::GIT_BEFORE_FETCH, self)
+          begin
+            fetch unless use_app_cache?
+            checkout
+          ensure
+            Plugin.hook(Plugin::Events::GIT_AFTER_FETCH, self)
+          end
         end
 
         local_specs
@@ -192,27 +210,25 @@ module Bundler
         print_using_message "Using #{version_message(spec, options[:previous_spec])} from #{self}"
 
         if (requires_checkout? && !@copied) || force
-          Bundler.ui.debug "  * Checking out revision: #{ref}"
-          git_proxy.copy_to(install_path, submodules)
-          serialize_gemspecs_in(install_path)
-          @copied = true
+          checkout
         end
 
-        generate_bin_options = { disable_extensions: !Bundler.rubygems.spec_missing_extensions?(spec), build_args: options[:build_args] }
+        generate_bin_options = { disable_extensions: !spec.missing_extensions?, build_args: options[:build_args] }
         generate_bin(spec, generate_bin_options)
 
         requires_checkout? ? spec.post_install_message : nil
       end
 
+      def migrate_cache(custom_path = nil, local: false)
+        if local
+          cache_to(custom_path, try_migrate: false)
+        else
+          cache_to(custom_path, try_migrate: true)
+        end
+      end
+
       def cache(spec, custom_path = nil)
-        app_cache_path = app_cache_path(custom_path)
-        return unless Bundler.feature_flag.cache_all?
-        return if path == app_cache_path
-        cached!
-        FileUtils.rm_rf(app_cache_path)
-        git_proxy.checkout if requires_checkout?
-        git_proxy.copy_to(app_cache_path, @submodules)
-        serialize_gemspecs_in(app_cache_path)
+        cache_to(custom_path, try_migrate: false)
       end
 
       def load_spec_files
@@ -227,7 +243,7 @@ module Bundler
       # across different projects, this cache will be shared.
       # When using local git repos, this is set to the local repo.
       def cache_path
-        @cache_path ||= if Bundler.feature_flag.global_gem_cache?
+        @cache_path ||= if Bundler.settings[:global_gem_cache]
           Bundler.user_cache
         else
           Bundler.bundle_path.join("cache", "bundler")
@@ -235,7 +251,7 @@ module Bundler
       end
 
       def app_cache_dirname
-        "#{base_name}-#{shortref_for_path(cached_revision || revision)}"
+        "#{base_name}-#{shortref_for_path(locked_revision || revision)}"
       end
 
       def revision
@@ -256,6 +272,43 @@ module Bundler
 
       private
 
+      def cache_to(custom_path, try_migrate: false)
+        return unless Bundler.settings[:cache_all]
+
+        app_cache_path = app_cache_path(custom_path)
+
+        migrate = try_migrate ? bare_repo?(app_cache_path) : false
+
+        set_cache_path!(nil) if migrate
+
+        return if cache_path == app_cache_path
+
+        cached!
+        FileUtils.rm_rf(app_cache_path)
+        git_proxy.checkout if migrate || requires_checkout?
+        git_proxy.copy_to(app_cache_path, @submodules)
+        serialize_gemspecs_in(app_cache_path)
+      end
+
+      def checkout
+        Bundler.ui.debug "  * Checking out revision: #{ref}"
+        if use_app_cache? && !bare_repo?(app_cache_path)
+          SharedHelpers.filesystem_access(install_path.dirname) do |p|
+            FileUtils.mkdir_p(p)
+          end
+          FileUtils.cp_r("#{app_cache_path}/.", install_path)
+        else
+          if use_app_cache? && bare_repo?(app_cache_path)
+            Bundler.ui.warn "Installing from cache in old \"bare repository\" format for compatibility. " \
+                            "Please run `bundle cache` and commit the updated cache to migrate to the new format and get rid of this warning."
+          end
+
+          git_proxy.copy_to(install_path, submodules)
+        end
+        serialize_gemspecs_in(install_path)
+        @copied = true
+      end
+
       def humanized_ref
         if local?
           path
@@ -278,28 +331,45 @@ module Bundler
           # The gemspecs we cache should already be evaluated.
           spec = Bundler.load_gemspec(spec_path)
           next unless spec
-          Bundler.rubygems.set_installed_by_version(spec)
+          spec.installed_by_version = Gem::VERSION
           Bundler.rubygems.validate(spec)
           File.open(spec_path, "wb") {|file| file.write(spec.to_ruby) }
         end
       end
 
-      def set_local!(path)
-        @local       = true
-        @local_specs = @git_proxy = nil
-        @cache_path  = @install_path = path
+      def set_paths!(path)
+        set_cache_path!(path)
+        set_install_path!(path)
+      end
+
+      def set_cache_path!(path)
+        @git_proxy = nil
+        @cache_path = path
+      end
+
+      def set_install_path!(path)
+        @local_specs = nil
+        @install_path = path
       end
 
       def has_app_cache?
-        cached_revision && super
+        locked_revision && super
+      end
+
+      def use_app_cache?
+        has_app_cache? && !local?
       end
 
       def requires_checkout?
-        allow_git_ops? && !local? && !cached_revision_checked_out?
+        allow_git_ops? && !local? && !locked_revision_checked_out?
+      end
+
+      def locked_revision_checked_out?
+        locked_revision && locked_revision == revision && installed?
       end
 
-      def cached_revision_checked_out?
-        cached_revision && cached_revision == revision && install_path.exist?
+      def installed?
+        git_proxy.installed_to?(install_path)
       end
 
       def base_name
@@ -336,7 +406,7 @@ module Bundler
         Bundler::Digest.sha1(input)
       end
 
-      def cached_revision
+      def locked_revision
         options["revision"]
       end
 
@@ -345,13 +415,12 @@ module Bundler
       end
 
       def git_proxy
-        @git_proxy ||= GitProxy.new(cache_path, uri, options, cached_revision, self)
+        @git_proxy ||= GitProxy.new(cache_path, uri, options, locked_revision, self)
       end
 
       def fetch
         git_proxy.checkout
       rescue GitError => e
-        raise unless Bundler.feature_flag.allow_offline_install?
         Bundler.ui.warn "Using cached git data because of network errors:\n#{e}"
       end
 
@@ -359,9 +428,12 @@ module Bundler
       def validate_spec(_spec); end
 
       def load_gemspec(file)
-        stub = Gem::StubSpecification.gemspec_stub(file, install_path.parent, install_path.parent)
-        stub.full_gem_path = Pathname.new(file).dirname.expand_path(root).to_s
-        StubSpecification.from_stub(stub)
+        dirname = Pathname.new(file).dirname
+        SharedHelpers.chdir(dirname.to_s) do
+          stub = Gem::StubSpecification.gemspec_stub(file, install_path.parent, install_path.parent)
+          stub.full_gem_path = dirname.expand_path(root).to_s
+          StubSpecification.from_stub(stub)
+        end
       end
 
       def git_scope
@@ -375,6 +447,10 @@ module Bundler
       def override_for(path)
         Bundler.settings.local_overrides.key(path)
       end
+
+      def bare_repo?(path)
+        File.exist?(path.join("objects")) && File.exist?(path.join("HEAD"))
+      end
     end
   end
 end
diff --git a/lib/bundler/source/git/git_proxy.rb b/lib/bundler/source/git/git_proxy.rb
index 2fc9c6535f..8094dcaa9d 100644
--- a/lib/bundler/source/git/git_proxy.rb
+++ b/lib/bundler/source/git/git_proxy.rb
@@ -16,7 +16,7 @@ module Bundler
         def initialize(command)
           msg = String.new
           msg << "Bundler is trying to run `#{command}` at runtime. You probably need to run `bundle install`. However, "
-          msg << "this error message could probably be more useful. Please submit a ticket at https://github.com/rubygems/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md "
+          msg << "this error message could probably be more useful. Please submit a ticket at https://github.com/ruby/rubygems/issues/new?labels=Bundler&template=bundler-related-issue.md "
           msg << "with steps to reproduce as well as the following\n\nCALLER: #{caller.join("\n")}"
           super msg
         end
@@ -57,6 +57,29 @@ module Bundler
         attr_accessor :path, :uri, :branch, :tag, :ref, :explicit_ref
         attr_writer :revision
 
+        def self.version
+          @version ||= full_version[/((\.?\d+)+).*/, 1]
+        end
+
+        def self.full_version
+          @full_version ||= begin
+            raise GitNotInstalledError.new unless Bundler.git_present?
+
+            require "open3"
+            out, err, status = Open3.capture3("git", "--version")
+
+            raise GitCommandError.new("--version", SharedHelpers.pwd, err) unless status.success?
+            Bundler.ui.warn err unless err.empty?
+
+            out.sub(/git version\s*/, "").strip
+          end
+        end
+
+        def self.reset
+          @version = nil
+          @full_version = nil
+        end
+
         def initialize(path, uri, options = {}, revision = nil, git = nil)
           @path     = path
           @uri      = uri
@@ -92,11 +115,11 @@ module Bundler
         end
 
         def version
-          @version ||= full_version.match(/((\.?\d+)+).*/)[1]
+          self.class.version
         end
 
         def full_version
-          @full_version ||= git_local("--version").sub(/git version\s*/, "").strip
+          self.class.full_version
         end
 
         def checkout
@@ -121,7 +144,7 @@ module Bundler
                 FileUtils.rm_rf(p)
               end
               git "clone", "--no-checkout", "--quiet", path.to_s, destination.to_s
-              File.chmod(((File.stat(destination).mode | 0o777) & ~File.umask), destination)
+              File.chmod((File.stat(destination).mode | 0o777) & ~File.umask, destination)
             rescue Errno::EEXIST => e
               file_path = e.message[%r{.*?((?:[a-zA-Z]:)?/.*)}, 1]
               raise GitError, "Bundler could not install a gem because it needs to " \
@@ -137,7 +160,7 @@ module Bundler
             git "fetch", "--force", "--quiet", *extra_fetch_args(ref), dir: destination
           end
 
-          git "reset", "--hard", @revision, dir: destination
+          git "reset", "--hard", revision, dir: destination
 
           if submodules
             git_retry "submodule", "update", "--init", "--recursive", dir: destination
@@ -147,10 +170,16 @@ module Bundler
           end
         end
 
+        def installed_to?(destination)
+          # if copy_to is interrupted, it may leave a partially installed directory that
+          # contains .git but no other files -- consider this not to be installed
+          Dir.exist?(destination) && (Dir.children(destination) - [".git"]).any?
+        end
+
         private
 
         def git_remote_fetch(args)
-          command = ["fetch", "--force", "--quiet", "--no-tags", *args, "--", configured_uri, refspec].compact
+          command = fetch_command(args)
           command_with_no_credentials = check_allowed(command)
 
           Bundler::Retry.new("`#{command_with_no_credentials}` at #{path}", [MissingGitRevisionError]).attempts do
@@ -160,6 +189,11 @@ module Bundler
             if err.include?("couldn't find remote ref") || err.include?("not our ref")
               raise MissingGitRevisionError.new(command_with_no_credentials, path, commit || explicit_ref, credential_filtered_uri)
             else
+              if shallow?
+                args -= depth_args
+                command = fetch_command(args)
+                command_with_no_credentials = check_allowed(command)
+              end
               raise GitCommandError.new(command_with_no_credentials, path, err)
             end
           end
@@ -172,23 +206,22 @@ module Bundler
             FileUtils.mkdir_p(p)
           end
 
-          command = ["clone", "--bare", "--no-hardlinks", "--quiet", *extra_clone_args, "--", configured_uri, path.to_s]
+          clone_args = extra_clone_args
+          command = clone_command(clone_args)
           command_with_no_credentials = check_allowed(command)
 
           Bundler::Retry.new("`#{command_with_no_credentials}`", [MissingGitRevisionError]).attempts do
             _, err, status = capture(command, nil)
             return extra_ref if status.success?
 
-            if err.include?("Could not find remote branch")
+            if err.include?("Could not find remote branch") || # git up to 2.49
+               err.include?("Remote branch #{branch_option} not found") # git 2.49 or higher
               raise MissingGitRevisionError.new(command_with_no_credentials, nil, explicit_ref, credential_filtered_uri)
             else
-              idx = command.index("--depth")
-              if idx
-                command.delete_at(idx)
-                command.delete_at(idx)
+              if shallow?
+                clone_args -= depth_args
+                command = clone_command(clone_args)
                 command_with_no_credentials = check_allowed(command)
-
-                err += "Retrying without --depth argument."
               end
               raise GitCommandError.new(command_with_no_credentials, path, err)
             end
@@ -197,14 +230,14 @@ module Bundler
 
         def clone_needs_unshallow?
           return false unless path.join("shallow").exist?
-          return true if full_clone?
+          return true unless shallow?
 
           @revision && @revision != head_revision
         end
 
         def extra_ref
           return false if not_pinned?
-          return true unless full_clone?
+          return true if shallow?
 
           ref.start_with?("refs/")
         end
@@ -256,7 +289,7 @@ module Bundler
         end
 
         def not_pinned?
-          branch || tag || ref.nil?
+          branch_option || ref.nil?
         end
 
         def pinned_to_full_sha?
@@ -298,8 +331,8 @@ module Bundler
         end
 
         def has_revision_cached?
-          return unless @revision && path.exist?
-          git("cat-file", "-e", @revision, dir: path)
+          return unless commit && path.exist?
+          git("cat-file", "-e", commit, dir: path)
           true
         rescue GitError
           false
@@ -332,8 +365,6 @@ module Bundler
             config_auth = Bundler.settings[remote.to_s] || Bundler.settings[remote.host]
             remote.userinfo ||= config_auth
             remote.to_s
-          elsif File.exist?(uri)
-            "file://#{uri}"
           else
             uri.to_s
           end
@@ -401,13 +432,14 @@ module Bundler
         end
 
         def capture3_args_for(cmd, dir)
-          return ["git", *cmd] unless dir
+          # Disable automatic maintenance so a background commit-graph write in
+          # the source repo can't race the hardlinking local clone and fail with
+          # "hardlink different from source".
+          opts = ["-c", "gc.auto=0", "-c", "maintenance.auto=false"]
 
-          if Bundler.feature_flag.bundler_3_mode? || supports_minus_c?
-            ["git", "-C", dir.to_s, *cmd]
-          else
-            ["git", *cmd, { chdir: dir.to_s }]
-          end
+          return ["git", *opts, *cmd] unless dir
+
+          ["git", "-C", dir.to_s, *opts, *cmd]
         end
 
         def extra_clone_args
@@ -422,12 +454,20 @@ module Bundler
           # anyways.
           return args if @revision
 
-          args += ["--branch", branch || tag] if branch || tag
+          args += ["--branch", branch_option] if branch_option
           args
         end
 
+        def fetch_command(args)
+          ["fetch", "--force", "--quiet", "--no-tags", *args, "--", configured_uri, refspec].compact
+        end
+
+        def clone_command(args)
+          ["clone", "--bare", "--no-hardlinks", "--quiet", *args, "--", configured_uri, path.to_s]
+        end
+
         def depth_args
-          return [] if full_clone?
+          return [] unless shallow?
 
           ["--depth", depth.to_s]
         end
@@ -438,12 +478,12 @@ module Bundler
           extra_args
         end
 
-        def full_clone?
-          depth.nil?
+        def branch_option
+          branch || tag
         end
 
-        def supports_minus_c?
-          @supports_minus_c ||= Gem::Version.new(version) >= Gem::Version.new("1.8.5")
+        def shallow?
+          !depth.nil?
         end
 
         def needs_allow_any_sha1_in_want?
diff --git a/lib/bundler/source/metadata.rb b/lib/bundler/source/metadata.rb
index 6b05e17727..ecf8895187 100644
--- a/lib/bundler/source/metadata.rb
+++ b/lib/bundler/source/metadata.rb
@@ -24,9 +24,8 @@ module Bundler
               s.bindir   = "exe"
               s.homepage = "https://bundler.io"
               s.summary  = "The best way to manage your application's dependencies"
-              s.executables = %w[bundle]
-              # can't point to the actual gemspec or else the require paths will be wrong
-              s.loaded_from = __dir__
+              s.executables = %w[bundle bundler]
+              s.loaded_from = SharedHelpers.gemspec_path
             end
           end
 
@@ -59,6 +58,10 @@ module Bundler
       def version_message(spec)
         "#{spec.name} #{spec.version}"
       end
+
+      def checksum_store
+        @checksum_store ||= Checksum::Store.new
+      end
     end
   end
 end
diff --git a/lib/bundler/source/path.rb b/lib/bundler/source/path.rb
index 978b0b2c9f..366a23aea7 100644
--- a/lib/bundler/source/path.rb
+++ b/lib/bundler/source/path.rb
@@ -18,16 +18,13 @@ module Bundler
         @options = options.dup
         @glob = options["glob"] || DEFAULT_GLOB
 
-        @allow_cached = false
-        @allow_remote = false
-
         @root_path = options["root_path"] || root
 
         if options["path"]
           @path = Pathname.new(options["path"])
           expanded_path = expand(@path)
           @path = if @path.relative?
-            expanded_path.relative_path_from(root_path.expand_path)
+            expanded_path.relative_path_from(File.expand_path(root_path))
           else
             expanded_path
           end
@@ -41,16 +38,6 @@ module Bundler
         @original_path = @path
       end
 
-      def remote!
-        @local_specs = nil
-        @allow_remote = true
-      end
-
-      def cached!
-        @local_specs = nil
-        @allow_cached = true
-      end
-
       def self.from_lock(options)
         new(options.merge("path" => options.delete("remote")))
       end
@@ -66,13 +53,17 @@ module Bundler
         "source at `#{@path}`"
       end
 
+      alias_method :identifier, :to_s
+
+      alias_method :to_gemfile, :path
+
       def hash
         [self.class, expanded_path, version].hash
       end
 
       def eql?(other)
-        return unless other.class == self.class
-        expanded_original_path == other.expanded_original_path &&
+        [Gemspec, Path].include?(other.class) &&
+          expanded_original_path == other.expanded_original_path &&
           version == other.version
       end
 
@@ -92,7 +83,7 @@ module Bundler
 
       def cache(spec, custom_path = nil)
         app_cache_path = app_cache_path(custom_path)
-        return unless Bundler.feature_flag.cache_all?
+        return unless Bundler.settings[:cache_all]
         return if expand(@original_path).to_s.index(root_path.to_s + "/") == 0
 
         unless @original_path.exist?
@@ -135,11 +126,7 @@ module Bundler
       end
 
       def expand(somepath)
-        if Bundler.current_ruby.jruby? # TODO: Unify when https://github.com/rubygems/bundler/issues/7598 fixed upstream and all supported jrubies include the fix
-          somepath.expand_path(root_path).expand_path
-        else
-          somepath.expand_path(root_path)
-        end
+        somepath.expand_path(root_path)
       rescue ArgumentError => e
         Bundler.ui.debug(e)
         raise PathError, "There was an error while trying to use the path " \
@@ -161,7 +148,7 @@ module Bundler
 
       def load_gemspec(file)
         return unless spec = Bundler.load_gemspec(file)
-        Bundler.rubygems.set_installed_by_version(spec)
+        spec.installed_by_version = Gem::VERSION
         spec
       end
 
@@ -178,6 +165,13 @@ module Bundler
             next unless spec = load_gemspec(file)
             spec.source = self
 
+            # The ignore attribute is for ignoring installed gems that don't
+            # have extensions correctly compiled for activation. In the case of
+            # path sources, there's a single version of each gem in the path
+            # source available to Bundler, so we always certainly want to
+            # consider that for activation and never makes sense to ignore it.
+            spec.ignored = false
+
             # Validation causes extension_dir to be calculated, which depends
             # on #source, so we validate here instead of load_gemspec
             validate_spec(spec)
@@ -225,15 +219,16 @@ module Bundler
 
         # Some gem authors put absolute paths in their gemspec
         # and we have to save them from themselves
-        spec.files = spec.files.map do |path|
-          next path unless /\A#{Pathname::SEPARATOR_PAT}/o.match?(path)
+        spec.files = spec.files.filter_map do |path|
+          pathname = Pathname.new(path)
+          next path unless pathname.absolute?
           next if File.directory?(path)
           begin
-            Pathname.new(path).relative_path_from(gem_dir).to_s
+            pathname.relative_path_from(gem_dir).to_s
           rescue ArgumentError
             path
           end
-        end.compact
+        end
 
         installer = Path::Installer.new(
           spec,
diff --git a/lib/bundler/source/path/installer.rb b/lib/bundler/source/path/installer.rb
index 0af28fe770..39765e5da2 100644
--- a/lib/bundler/source/path/installer.rb
+++ b/lib/bundler/source/path/installer.rb
@@ -24,7 +24,7 @@ module Bundler
         def post_install
           run_hooks(:pre_install)
 
-          unless @disable_extensions
+          unless @disable_extensions || Bundler.settings[:no_build_extension]
             build_extensions
             run_hooks(:post_build)
           end
diff --git a/lib/bundler/source/rubygems.rb b/lib/bundler/source/rubygems.rb
index dafc674f9d..ed864604fe 100644
--- a/lib/bundler/source/rubygems.rb
+++ b/lib/bundler/source/rubygems.rb
@@ -8,26 +8,38 @@ module Bundler
       autoload :Remote, File.expand_path("rubygems/remote", __dir__)
 
       # Ask for X gems per API request
-      API_REQUEST_SIZE = 50
+      API_REQUEST_SIZE = 100
+      REQUIRE_MUTEX = Mutex.new
 
       attr_accessor :remotes
 
       def initialize(options = {})
         @options = options
         @remotes = []
+        @remote_cooldowns = {}
         @dependency_names = []
         @allow_remote = false
         @allow_cached = false
         @allow_local = options["allow_local"] || false
+        @prefer_local = false
         @checksum_store = Checksum::Store.new
+        @gem_installers = {}
+        @gem_installers_mutex = Mutex.new
 
-        Array(options["remotes"]).reverse_each {|r| add_remote(r) }
+        cooldown = options["cooldown"]
+        Array(options["remotes"]).reverse_each {|r| add_remote(r, cooldown: cooldown) }
+
+        @lockfile_remotes = @remotes if options["from_lockfile"]
       end
 
       def caches
         @caches ||= [cache_path, *Bundler.rubygems.gem_cache]
       end
 
+      def prefer_local!
+        @prefer_local = true
+      end
+
       def local_only!
         @specs = nil
         @allow_local = true
@@ -35,6 +47,10 @@ module Bundler
         @allow_remote = false
       end
 
+      def local_only?
+        @allow_local && !@allow_remote
+      end
+
       def local!
         return if @allow_local
 
@@ -91,13 +107,13 @@ module Bundler
 
       def self.from_lock(options)
         options["remotes"] = Array(options.delete("remote")).reverse
-        new(options)
+        new(options.merge("from_lockfile" => true))
       end
 
       def to_lock
         out = String.new("GEM\n")
-        remotes.reverse_each do |remote|
-          out << "  remote: #{remove_auth remote}\n"
+        lockfile_remotes.reverse_each do |remote|
+          out << "  remote: #{remote}\n"
         end
         out << "  specs:\n"
       end
@@ -134,76 +150,81 @@ module Bundler
           # sources, and large_idx.merge! small_idx is way faster than
           # small_idx.merge! large_idx.
           index = @allow_remote ? remote_specs.dup : Index.new
+
+          # Snapshot per-version `created_at` from the remote info before installed
+          # / cached specs overwrite the EndpointSpecification objects that carry
+          # it. The cooldown filter consults `created_at` on every candidate, so
+          # local stubs need the published date back-filled to participate.
+          remote_created_at = collect_remote_created_at(index)
+
           index.merge!(cached_specs) if @allow_cached
           index.merge!(installed_specs) if @allow_local
 
-          # complete with default specs, only if not already available in the
-          # index through remote, cached, or installed specs
-          index.use(default_specs) if @allow_local
+          if @allow_local
+            if @prefer_local
+              index.merge!(default_specs)
+            else
+              # complete with default specs, only if not already available in the
+              # index through remote, cached, or installed specs
+              index.use(default_specs)
+            end
+          end
+
+          backfill_created_at(index, remote_created_at) unless remote_created_at.empty?
 
           index
         end
       end
 
-      def install(spec, options = {})
-        if (spec.default_gem? && !cached_built_in_gem(spec)) || (installed?(spec) && !options[:force])
-          print_using_message "Using #{version_message(spec, options[:previous_spec])}"
-          return nil # no post-install message
-        end
-
-        if spec.remote
-          # Check for this spec from other sources
-          uris = [spec.remote, *remotes_for_spec(spec)].map(&:anonymized_uri).uniq
-          Installer.ambiguous_gems << [spec.name, *uris] if uris.length > 1
+      def download(spec, options = {})
+        if (spec.default_gem? && !cached_built_in_gem(spec, local: options[:local])) || (installed?(spec) && !options[:force])
+          return true
         end
 
-        path = fetch_gem_if_possible(spec, options[:previous_spec])
-        raise GemNotFound, "Could not find #{spec.file_name} for installation" unless path
-
-        return if Bundler.settings[:no_install]
-
-        install_path = rubygems_dir
-        bin_path     = Bundler.system_bindir
-
-        require_relative "../rubygems_gem_installer"
-
-        installer = Bundler::RubyGemsGemInstaller.at(
-          path,
-          security_policy: Bundler.rubygems.security_policies[Bundler.settings["trust-policy"]],
-          install_dir: install_path.to_s,
-          bin_dir: bin_path.to_s,
-          ignore_dependencies: true,
-          wrappers: true,
-          env_shebang: true,
-          build_args: options[:build_args],
-          bundler_extension_cache_path: extension_cache_path(spec)
-        )
+        installer = rubygems_gem_installer(spec, options)
 
         if spec.remote
           s = begin
             installer.spec
           rescue Gem::Package::FormatError
-            Bundler.rm_rf(path)
+            Bundler.rm_rf(installer.gem)
             raise
           rescue Gem::Security::Exception => e
             raise SecurityError,
-             "The gem #{File.basename(path, ".gem")} can't be installed because " \
+             "The gem #{installer.gem} can't be installed because " \
              "the security policy didn't allow it, with the message: #{e.message}"
           end
 
           spec.__swap__(s)
         end
 
+        spec
+      end
+
+      def install(spec, options = {})
+        if (spec.default_gem? && !cached_built_in_gem(spec, local: options[:local])) || (installed?(spec) && !options[:force])
+          print_using_message "Using #{version_message(spec, options[:previous_spec])}"
+          return nil # no post-install message
+        end
+
+        return if Bundler.settings[:no_install]
+
+        installer = rubygems_gem_installer(spec, options)
         spec.source.checksum_store.register(spec, installer.gem_checksum)
 
         message = "Installing #{version_message(spec, options[:previous_spec])}"
         message += " with native extensions" if spec.extensions.any?
         Bundler.ui.confirm message
 
-        installed_spec = installer.install
+        installed_spec = nil
+
+        Gem.time("Installed #{spec.name} in", 0, true) do
+          installed_spec = installer.install
+        end
 
         spec.full_gem_path = installed_spec.full_gem_path
         spec.loaded_from = installed_spec.loaded_from
+        spec.base_dir = installed_spec.base_dir
 
         spec.post_install_message
       end
@@ -219,12 +240,13 @@ module Bundler
         raise InstallError, e.message
       end
 
-      def cached_built_in_gem(spec)
-        cached_path = cached_path(spec)
-        if cached_path.nil?
+      def cached_built_in_gem(spec, local: false)
+        cached_path = cached_gem(spec)
+        if cached_path.nil? && !local
           remote_spec = remote_specs.search(spec).first
           if remote_spec
             cached_path = fetch_gem(remote_spec)
+            spec.remote = remote_spec.remote
           else
             Bundler.ui.warn "#{spec.full_name} is built in to Ruby, and can't be cached because your Gemfile doesn't have any sources that contain it."
           end
@@ -232,9 +254,14 @@ module Bundler
         cached_path
       end
 
-      def add_remote(source)
+      def add_remote(source, cooldown: nil)
         uri = normalize_uri(source)
         @remotes.unshift(uri) unless @remotes.include?(uri)
+        @remote_cooldowns[uri] = cooldown if cooldown
+      end
+
+      def cooldown_for(uri)
+        @remote_cooldowns[uri]
       end
 
       def spec_names
@@ -255,7 +282,7 @@ module Bundler
 
       def remote_fetchers
         @remote_fetchers ||= remotes.to_h do |uri|
-          remote = Source::Rubygems::Remote.new(uri)
+          remote = Source::Rubygems::Remote.new(uri, cooldown: cooldown_for(uri))
           [remote, Bundler::Fetcher.new(remote)]
         end.freeze
       end
@@ -303,6 +330,13 @@ module Bundler
         @allow_remote && api_fetchers.any?
       end
 
+      def clear_cache
+        @specs = nil
+        @installed_specs = nil
+        @default_specs = nil
+        @cached_specs = nil
+      end
+
       protected
 
       def remote_names
@@ -313,22 +347,7 @@ module Bundler
         remotes.map(&method(:remove_auth))
       end
 
-      def remotes_for_spec(spec)
-        specs.search_all(spec.name).inject([]) do |uris, s|
-          uris << s.remote if s.remote
-          uris
-        end
-      end
-
       def cached_gem(spec)
-        if spec.default_gem?
-          cached_built_in_gem(spec)
-        else
-          cached_path(spec)
-        end
-      end
-
-      def cached_path(spec)
         global_cache_path = download_cache_path(spec)
         caches << global_cache_path if global_cache_path
 
@@ -361,10 +380,7 @@ module Bundler
         @installed_specs ||= Index.build do |idx|
           Bundler.rubygems.installed_specs.reverse_each do |spec|
             spec.source = self
-            if Bundler.rubygems.spec_missing_extensions?(spec, false)
-              Bundler.ui.debug "Source #{self} is ignoring #{spec} because it is missing extensions"
-              next
-            end
+            next if spec.ignored?
             idx << spec
           end
         end
@@ -446,7 +462,7 @@ module Bundler
       end
 
       def installed?(spec)
-        installed_specs[spec].any? && !spec.deleted_gem?
+        installed_specs[spec].any? && !spec.installation_missing?
       end
 
       def rubygems_dir
@@ -463,6 +479,35 @@ module Bundler
 
       private
 
+      def collect_remote_created_at(index)
+        return {} unless @allow_remote
+
+        snapshot = {}
+        index.each do |spec|
+          next unless spec.respond_to?(:created_at) && spec.created_at
+          # Remember the remote that supplied the date too: when a source has
+          # several remotes with different per-URI cooldown settings we must
+          # restore the same one during backfill so `effective_cooldown` agrees.
+          snapshot[[spec.name, spec.version]] = [spec.created_at, spec.remote]
+        end
+        snapshot
+      end
+
+      def backfill_created_at(index, snapshot)
+        index.each do |spec|
+          next unless spec.respond_to?(:created_at=)
+          next if spec.created_at
+          remote_created_at, remote = snapshot[[spec.name, spec.version]]
+          next unless remote_created_at
+          spec.created_at = remote_created_at
+          spec.remote ||= remote if remote && spec.respond_to?(:remote=)
+        end
+      end
+
+      def lockfile_remotes
+        @lockfile_remotes || credless_remotes
+      end
+
       # Checks if the requested spec exists in the global cache. If it does,
       # we copy it to the download path, and if it does not, we download it.
       #
@@ -479,7 +524,15 @@ module Bundler
         uri = spec.remote.uri
         Bundler.ui.confirm("Fetching #{version_message(spec, previous_spec)}")
         gem_remote_fetcher = remote_fetchers.fetch(spec.remote).gem_remote_fetcher
-        Bundler.rubygems.download_gem(spec, uri, download_cache_path, gem_remote_fetcher)
+
+        Plugin.hook(Plugin::Events::GEM_BEFORE_FETCH, spec)
+        begin
+          Gem.time("Downloaded #{spec.name} in", 0, true) do
+            Bundler.rubygems.download_gem(spec, uri, download_cache_path, gem_remote_fetcher)
+          end
+        ensure
+          Plugin.hook(Plugin::Events::GEM_AFTER_FETCH, spec)
+        end
       end
 
       # Returns the global cache path of the calling Rubygems::Source object.
@@ -494,17 +547,52 @@ module Bundler
       # @return [Pathname] The global cache path.
       #
       def download_cache_path(spec)
-        return unless Bundler.feature_flag.global_gem_cache?
+        return unless Bundler.settings[:global_gem_cache]
         return unless remote = spec.remote
         return unless cache_slug = remote.cache_slug
 
-        Bundler.user_cache.join("gems", cache_slug)
+        if Gem.respond_to?(:global_gem_cache_path)
+          Pathname.new(Gem.global_gem_cache_path).join(cache_slug)
+        else
+          # Fall back to old location for older RubyGems versions
+          Bundler.user_cache.join("gems", cache_slug)
+        end
       end
 
       def extension_cache_slug(spec)
         return unless remote = spec.remote
         remote.cache_slug
       end
+
+      # We are using a mutex to read and write from/to the hash.
+      # The reason this double synchronization was added is for performance
+      # and to lock the mutex for the shortest possible amount of time. Otherwise,
+      # all threads are fighting over this mutex and when it gets acquired it gets locked
+      # until a thread finishes downloading a gem, leaving the other threads waiting
+      # doing nothing.
+      def rubygems_gem_installer(spec, options)
+        @gem_installers_mutex.synchronize { @gem_installers[spec.name] } || begin
+          path = fetch_gem_if_possible(spec, options[:previous_spec])
+          raise GemNotFound, "Could not find #{spec.file_name} for installation" unless path
+
+          REQUIRE_MUTEX.synchronize { require_relative "../rubygems_gem_installer" }
+
+          installer = Bundler::RubyGemsGemInstaller.at(
+            path,
+            security_policy: Bundler.rubygems.security_policies[Bundler.settings["trust-policy"]],
+            install_dir: rubygems_dir.to_s,
+            bin_dir: Bundler.system_bindir.to_s,
+            ignore_dependencies: true,
+            wrappers: true,
+            env_shebang: true,
+            build_args: options[:build_args],
+            bundler_extension_cache_path: extension_cache_path(spec),
+            build_extension: Bundler.settings[:no_build_extension] ? false : nil,
+            install_plugin: Bundler.settings[:no_install_plugin] ? false : nil
+          )
+          @gem_installers_mutex.synchronize { @gem_installers[spec.name] ||= installer }
+        end
+      end
     end
   end
 end
diff --git a/lib/bundler/source/rubygems/remote.rb b/lib/bundler/source/rubygems/remote.rb
index 9c5c06de24..3d847424b7 100644
--- a/lib/bundler/source/rubygems/remote.rb
+++ b/lib/bundler/source/rubygems/remote.rb
@@ -4,9 +4,9 @@ module Bundler
   class Source
     class Rubygems
       class Remote
-        attr_reader :uri, :anonymized_uri, :original_uri
+        attr_reader :uri, :anonymized_uri, :original_uri, :cooldown
 
-        def initialize(uri)
+        def initialize(uri, cooldown: nil)
           orig_uri = uri
           uri = Bundler.settings.mirror_for(uri)
           @original_uri = orig_uri if orig_uri != uri
@@ -14,8 +14,21 @@ module Bundler
 
           @uri = apply_auth(uri, fallback_auth).freeze
           @anonymized_uri = remove_auth(@uri).freeze
+          @cooldown = cooldown
         end
 
+        # Returns the cooldown days that apply to this remote, resolving the
+        # precedence CLI > config > Gemfile per-source. Returns nil if no
+        # cooldown applies.
+        def effective_cooldown
+          override = Bundler.settings[:cooldown]
+          return override if override
+          @cooldown
+        end
+
+        MAX_CACHE_SLUG_HOST_SIZE = 255 - 1 - 32 # 255 minus dot minus MD5 length
+        private_constant :MAX_CACHE_SLUG_HOST_SIZE
+
         # @return [String] A slug suitable for use as a cache key for this
         #         remote.
         #
@@ -28,10 +41,15 @@ module Bundler
             host = cache_uri.to_s.start_with?("file://") ? nil : cache_uri.host
 
             uri_parts = [host, cache_uri.user, cache_uri.port, cache_uri.path]
-            uri_digest = SharedHelpers.digest(:MD5).hexdigest(uri_parts.compact.join("."))
+            uri_parts.compact!
+            uri_digest = SharedHelpers.digest(:MD5).hexdigest(uri_parts.join("."))
+
+            uri_parts.pop
+            host_parts = uri_parts.join(".")
+            return uri_digest if host_parts.empty?
 
-            uri_parts[-1] = uri_digest
-            uri_parts.compact.join(".")
+            shortened_host_parts = host_parts[0...MAX_CACHE_SLUG_HOST_SIZE]
+            [shortened_host_parts, uri_digest].join(".")
           end
         end
 
diff --git a/lib/bundler/source/rubygems_aggregate.rb b/lib/bundler/source/rubygems_aggregate.rb
index 99ef81ad54..8aeaa375fa 100644
--- a/lib/bundler/source/rubygems_aggregate.rb
+++ b/lib/bundler/source/rubygems_aggregate.rb
@@ -5,9 +5,10 @@ module Bundler
     class RubygemsAggregate
       attr_reader :source_map, :sources
 
-      def initialize(sources, source_map)
+      def initialize(sources, source_map, excluded_sources = [])
         @sources = sources
         @source_map = source_map
+        @excluded_sources = excluded_sources
 
         @index = build_index
       end
@@ -31,6 +32,8 @@ module Bundler
           dependency_names = source_map.pinned_spec_names
 
           sources.all_sources.each do |source|
+            next if @excluded_sources.include?(source)
+
             source.dependency_names = dependency_names - source_map.pinned_spec_names(source)
             idx.add_source source.specs
             dependency_names.concat(source.unmet_deps).uniq!
diff --git a/lib/bundler/source_list.rb b/lib/bundler/source_list.rb
index 5f9dd68f17..ab7002d6e5 100644
--- a/lib/bundler/source_list.rb
+++ b/lib/bundler/source_list.rb
@@ -9,7 +9,7 @@ module Bundler
       :metadata_source
 
     def global_rubygems_source
-      @global_rubygems_source ||= rubygems_aggregate_class.new("allow_local" => true)
+      @global_rubygems_source ||= source_class.new("allow_local" => true)
     end
 
     def initialize
@@ -21,19 +21,9 @@ module Bundler
       @rubygems_sources       = []
       @metadata_source        = Source::Metadata.new
 
-      @merged_gem_lockfile_sections = false
       @local_mode = true
     end
 
-    def merged_gem_lockfile_sections?
-      @merged_gem_lockfile_sections
-    end
-
-    def merged_gem_lockfile_sections!(replacement_source)
-      @merged_gem_lockfile_sections = true
-      @global_rubygems_source = replacement_source
-    end
-
     def aggregate_global_source?
       global_rubygems_source.multiple_remotes?
     end
@@ -69,8 +59,8 @@ module Bundler
       add_source_to_list Plugin.source(source).new(options), @plugin_sources
     end
 
-    def add_global_rubygems_remote(uri)
-      global_rubygems_source.add_remote(uri)
+    def add_global_rubygems_remote(uri, cooldown: nil)
+      global_rubygems_source.add_remote(uri, cooldown: cooldown)
       global_rubygems_source
     end
 
@@ -90,10 +80,6 @@ module Bundler
       @rubygems_sources
     end
 
-    def rubygems_remotes
-      rubygems_sources.map(&:remotes).flatten.uniq
-    end
-
     def all_sources
       path_sources + git_sources + plugin_sources + rubygems_sources + [metadata_source]
     end
@@ -103,7 +89,7 @@ module Bundler
     end
 
     def get(source)
-      source_list_for(source).find {|s| equivalent_source?(source, s) }
+      source_list_for(source).find {|s| s.include?(source) }
     end
 
     def lock_sources
@@ -115,11 +101,7 @@ module Bundler
     end
 
     def lock_rubygems_sources
-      if merged_gem_lockfile_sections?
-        [combine_rubygems_sources]
-      else
-        rubygems_sources.sort_by(&:identifier)
-      end
+      rubygems_sources.sort_by(&:identifier)
     end
 
     # Returns true if there are changes
@@ -129,16 +111,11 @@ module Bundler
       @rubygems_sources, @path_sources, @git_sources, @plugin_sources = map_sources(replacement_sources)
       @global_rubygems_source = global_replacement_source(replacement_sources)
 
-      different_sources?(lock_sources, replacement_sources)
+      !equivalent_sources?(lock_sources, replacement_sources)
     end
 
-    # Returns true if there are changes
-    def expired_sources?(replacement_sources)
-      return false if replacement_sources.empty?
-
-      lock_sources = dup_with_replaced_sources(replacement_sources).lock_sources
-
-      different_sources?(lock_sources, replacement_sources)
+    def prefer_local!
+      all_sources.each(&:prefer_local!)
     end
 
     def local_only!
@@ -159,54 +136,66 @@ module Bundler
       all_sources.each(&:remote!)
     end
 
-    private
-
-    def dup_with_replaced_sources(replacement_sources)
-      new_source_list = dup
-      new_source_list.replace_sources!(replacement_sources)
-      new_source_list
+    def clear_cache
+      rubygems_sources.each(&:clear_cache)
     end
 
+    private
+
     def map_sources(replacement_sources)
       rubygems = @rubygems_sources.map do |source|
-        replace_rubygems_source(replacement_sources, source) || source
+        replace_rubygems_source(replacement_sources, source)
       end
 
       git, plugin = [@git_sources, @plugin_sources].map do |sources|
         sources.map do |source|
-          replacement_sources.find {|s| s == source } || source
+          replace_source(replacement_sources, source)
         end
       end
 
       path = @path_sources.map do |source|
-        replacement_sources.find {|s| s == (source.is_a?(Source::Gemspec) ? source.as_path_source : source) } || source
+        replace_path_source(replacement_sources, source)
       end
 
       [rubygems, path, git, plugin]
     end
 
     def global_replacement_source(replacement_sources)
-      replacement_source = replace_rubygems_source(replacement_sources, global_rubygems_source)
-      return global_rubygems_source unless replacement_source
-
-      replacement_source.local!
-      replacement_source
+      replace_rubygems_source(replacement_sources, global_rubygems_source, &:local!)
     end
 
     def replace_rubygems_source(replacement_sources, gemfile_source)
+      replace_source(replacement_sources, gemfile_source) do |replacement_source|
+        # locked sources never include credentials so always prefer remotes from the gemfile
+        replacement_source.remotes = gemfile_source.remotes
+
+        yield replacement_source if block_given?
+
+        replacement_source
+      end
+    end
+
+    def replace_source(replacement_sources, gemfile_source)
       replacement_source = replacement_sources.find {|s| s == gemfile_source }
-      return unless replacement_source
+      return gemfile_source unless replacement_source
+
+      replacement_source = yield(replacement_source) if block_given?
 
-      # locked sources never include credentials so always prefer remotes from the gemfile
-      replacement_source.remotes = gemfile_source.remotes
       replacement_source
     end
 
-    def different_sources?(lock_sources, replacement_sources)
-      !equivalent_sources?(lock_sources, replacement_sources)
+    def replace_path_source(replacement_sources, gemfile_source)
+      replace_source(replacement_sources, gemfile_source) do |replacement_source|
+        if gemfile_source.is_a?(Source::Gemspec)
+          gemfile_source.checksum_store = replacement_source.checksum_store
+          gemfile_source
+        else
+          replacement_source
+        end
+      end
     end
 
-    def rubygems_aggregate_class
+    def source_class
       Source::Rubygems
     end
 
@@ -225,10 +214,6 @@ module Bundler
       end
     end
 
-    def combine_rubygems_sources
-      Source::Rubygems.new("remotes" => rubygems_remotes)
-    end
-
     def warn_on_git_protocol(source)
       return if Bundler.settings["git.allow_insecure"]
 
@@ -243,9 +228,5 @@ module Bundler
     def equivalent_sources?(lock_sources, replacement_sources)
       lock_sources.sort_by(&:identifier) == replacement_sources.sort_by(&:identifier)
     end
-
-    def equivalent_source?(source, other_source)
-      source == other_source
-    end
   end
 end
diff --git a/lib/bundler/source_map.rb b/lib/bundler/source_map.rb
index ca73e01f9d..513eb37f8b 100644
--- a/lib/bundler/source_map.rb
+++ b/lib/bundler/source_map.rb
@@ -14,24 +14,25 @@ module Bundler
       direct_requirements.reject {|_, source| source == skip }.keys
     end
 
-    def all_requirements
+    def all_requirements(excluded_sources = [])
       requirements = direct_requirements.dup
 
-      unmet_deps = sources.non_default_explicit_sources.map do |source|
+      explicit_sources = sources.non_default_explicit_sources.reject do |source|
+        excluded_sources.include?(source)
+      end
+
+      unmet_deps = explicit_sources.map do |source|
         (source.spec_names - pinned_spec_names).each do |indirect_dependency_name|
           previous_source = requirements[indirect_dependency_name]
           if previous_source.nil?
             requirements[indirect_dependency_name] = source
           else
-            no_ambiguous_sources = Bundler.feature_flag.bundler_3_mode?
-
             msg = ["The gem '#{indirect_dependency_name}' was found in multiple relevant sources."]
             msg.concat [previous_source, source].map {|s| "  * #{s}" }.sort
-            msg << "You #{no_ambiguous_sources ? :must : :should} add this gem to the source block for the source you wish it to be installed from."
+            msg << "You must add this gem to the source block for the source you wish it to be installed from."
             msg = msg.join("\n")
 
-            raise SecurityError, msg if no_ambiguous_sources
-            Bundler.ui.warn "Warning: #{msg}"
+            raise SecurityError, msg
           end
         end
 
diff --git a/lib/bundler/spec_set.rb b/lib/bundler/spec_set.rb
index 2933d28450..ae5e5cbaa9 100644
--- a/lib/bundler/spec_set.rb
+++ b/lib/bundler/spec_set.rb
@@ -7,74 +7,81 @@ module Bundler
     include Enumerable
     include TSort
 
-    attr_reader :incomplete_specs
-
-    def initialize(specs, incomplete_specs = [])
+    def initialize(specs)
       @specs = specs
-      @incomplete_specs = incomplete_specs
     end
 
-    def for(dependencies, check = false, platforms = [nil])
-      handled = ["bundler"].product(platforms).map {|k| [k, true] }.to_h
-      deps = dependencies.product(platforms)
-      specs = []
-
-      loop do
-        break unless dep = deps.shift
+    def for(dependencies, platforms = [nil], legacy_platforms = [nil], skips: [])
+      if [true, false].include?(platforms)
+        Bundler::SharedHelpers.feature_removed! \
+          "SpecSet#for received a `check` parameter, but that's no longer used and deprecated. " \
+          "SpecSet#for always implicitly performs validation. Please remove this parameter"
+      end
 
-        name = dep[0].name
-        platform = dep[1]
-        incomplete = false
+      materialize_dependencies(dependencies, platforms, skips: skips)
 
-        key = [name, platform]
-        next if handled.key?(key)
+      @materializations.flat_map(&:specs).uniq
+    end
 
-        handled[key] = true
+    def normalize_platforms!(deps, platforms)
+      remove_invalid_platforms!(deps, platforms)
+      add_extra_platforms!(platforms)
 
-        specs_for_dep = specs_for_dependency(*dep)
-        if specs_for_dep.any?
-          specs.concat(specs_for_dep)
+      platforms.map! do |platform|
+        next platform if platform == Gem::Platform::RUBY
 
-          specs_for_dep.first.dependencies.each do |d|
-            next if d.type == :development
-            incomplete = true if d.name != "bundler" && lookup[d.name].nil?
-            deps << [d, dep[1]]
-          end
-        else
-          incomplete = true
+        begin
+          Integer(platform.version)
+        rescue ArgumentError, TypeError
+          next platform
         end
 
-        if incomplete && check
-          @incomplete_specs += lookup[name] || [LazySpecification.new(name, nil, nil)]
-        end
+        less_specific_platform = Gem::Platform.new([platform.cpu, platform.os, nil])
+        next platform if incomplete_for_platform?(deps, less_specific_platform)
+
+        less_specific_platform
+      end.uniq!
+    end
+
+    def add_originally_invalid_platforms!(platforms, originally_invalid_platforms)
+      originally_invalid_platforms.each do |originally_invalid_platform|
+        platforms << originally_invalid_platform if complete_platform(originally_invalid_platform)
       end
+    end
+
+    def remove_invalid_platforms!(deps, platforms, skips: [])
+      invalid_platforms = []
+
+      platforms.reject! do |platform|
+        next false if skips.include?(platform)
 
-      specs.uniq
+        invalid = incomplete_for_platform?(deps, platform)
+        invalid_platforms << platform if invalid
+        invalid
+      end
+
+      invalid_platforms
     end
 
     def add_extra_platforms!(platforms)
-      return platforms.concat([Gem::Platform::RUBY]).uniq if @specs.empty?
+      if @specs.empty?
+        platforms.concat([Gem::Platform::RUBY]).uniq
+        return
+      end
 
       new_platforms = all_platforms.select do |platform|
         next if platforms.include?(platform)
-        next unless GemHelpers.generic(platform) == Gem::Platform::RUBY
+        next unless Gem::Platform.generic(platform) == Gem::Platform::RUBY
 
         complete_platform(platform)
       end
-      return platforms if new_platforms.empty?
+      return if new_platforms.empty?
 
       platforms.concat(new_platforms)
+      return if new_platforms.include?(Bundler.local_platform)
 
       less_specific_platform = new_platforms.find {|platform| platform != Gem::Platform::RUBY && Bundler.local_platform === platform && platform === Bundler.local_platform }
       platforms.delete(Bundler.local_platform) if less_specific_platform
-
-      platforms
-    end
-
-    def complete_platforms!(platforms)
-      platforms.each do |platform|
-        complete_platform(platform)
-      end
     end
 
     def validate_deps(s)
@@ -94,15 +101,13 @@ module Bundler
     end
 
     def []=(key, value)
-      @specs << value
+      delete_by_name(key)
 
-      reset!
+      add_spec(value)
     end
 
     def delete(specs)
-      specs.each {|spec| @specs.delete(spec) }
-
-      reset!
+      Array(specs).each {|spec| remove_spec(spec) }
     end
 
     def sort!
@@ -118,50 +123,78 @@ module Bundler
     end
 
     def materialize(deps)
-      materialized = self.for(deps, true)
+      materialize_dependencies(deps)
 
-      SpecSet.new(materialized, incomplete_specs)
+      SpecSet.new(materialized_specs)
     end
 
     # Materialize for all the specs in the spec set, regardless of what platform they're for
-    # This is in contrast to how for does platform filtering (and specifically different from how `materialize` calls `for` only for the current platform)
     # @return [Array<Gem::Specification>]
     def materialized_for_all_platforms
       @specs.map do |s|
         next s unless s.is_a?(LazySpecification)
-        s.source.remote!
-        spec = s.materialize_for_installation
+        spec = s.materialize_for_cache
         raise GemNotFound, "Could not find #{s.full_name} in any of the sources" unless spec
         spec
       end
     end
 
     def incomplete_for_platform?(deps, platform)
-      return false if @specs.empty?
+      incomplete_specs_for_platform(deps, platform).any?
+    end
+
+    def incomplete_specs_for_platform(deps, platform)
+      return [] if @specs.empty?
 
-      @incomplete_specs = []
+      validation_set = self.class.new(@specs)
+      validation_set.for(deps, [platform])
+      validation_set.incomplete_specs
+    end
 
-      self.for(deps, true, [platform])
+    def missing_specs_for(deps)
+      materialize_dependencies(deps)
 
-      @incomplete_specs.any?
+      missing_specs
     end
 
     def missing_specs
-      @specs.select {|s| s.is_a?(LazySpecification) }
+      @materializations.flat_map(&:completely_missing_specs)
+    end
+
+    def partially_missing_specs
+      @materializations.flat_map(&:partially_missing_specs)
+    end
+
+    def incomplete_specs
+      @materializations.flat_map(&:incomplete_specs)
+    end
+
+    def insecurely_materialized_specs
+      materialized_specs.select(&:insecurely_materialized?)
     end
 
     def -(other)
-      SpecSet.new(to_a - other.to_a)
+      SharedHelpers.feature_removed! "SpecSet#- has been removed with no replacement"
     end
 
     def find_by_name_and_platform(name, platform)
-      @specs.detect {|spec| spec.name == name && spec.match_platform(platform) }
+      lookup[name]&.detect {|spec| spec.installable_on_platform?(platform) }
+    end
+
+    def specs_with_additional_variants_from(other)
+      sorted | additional_variants_from(other)
     end
 
     def delete_by_name(name)
       @specs.reject! {|spec| spec.name == name }
+      @sorted&.reject! {|spec| spec.name == name }
+      return if @lookup.nil?
+
+      @lookup[name] = nil
+    end
 
-      reset!
+    def version_for(name)
+      exemplary_spec(name)&.version
     end
 
     def what_required(spec)
@@ -172,7 +205,7 @@ module Bundler
     end
 
     def <<(spec)
-      @specs << spec
+      SharedHelpers.feature_removed! "SpecSet#<< has been removed with no replacement"
     end
 
     def length
@@ -195,11 +228,45 @@ module Bundler
       lookup.keys
     end
 
+    def valid?(s)
+      s.matches_current_metadata? && valid_dependencies?(s)
+    end
+
+    def to_s
+      map(&:full_name).to_s
+    end
+
     private
 
-    def reset!
-      @sorted = nil
-      @lookup = nil
+    def materialize_dependencies(dependencies, platforms = [nil], skips: [])
+      handled = ["bundler"].product(platforms).map {|k| [k, true] }.to_h
+      deps = dependencies.product(platforms)
+      @materializations = []
+
+      loop do
+        break unless dep = deps.shift
+
+        dependency = dep[0]
+        platform = dep[1]
+        name = dependency.name
+
+        key = [name, platform]
+        next if handled.key?(key)
+
+        handled[key] = true
+
+        materialization = Materialization.new(dependency, platform, candidates: lookup[name])
+
+        deps.concat(materialization.dependencies) if materialization.complete?
+
+        @materializations << materialization unless skips.include?(name)
+      end
+
+      @materializations
+    end
+
+    def materialized_specs
+      @materializations.filter_map(&:materialized_spec)
     end
 
     def complete_platform(platform)
@@ -207,13 +274,25 @@ module Bundler
 
       valid_platform = lookup.all? do |_, specs|
         spec = specs.first
+        # The matching candidates returned by source.specs.search are remote
+        # specs that do not carry the override list themselves. Borrow it from
+        # the LazySpec we are validating so platform-variant validation honors
+        # the same overrides the install/resolve path already applies.
+        overrides = spec.is_a?(LazySpecification) ? Array(spec.overrides) : []
         matching_specs = spec.source.specs.search([spec.name, spec.version])
-        platform_spec = GemHelpers.select_best_platform_match(matching_specs, platform).find do |s|
-          s.matches_current_metadata? && valid_dependencies?(s)
+        platform_spec = MatchPlatform.select_best_platform_match(matching_specs, platform).find do |s|
+          s.matches_current_metadata_with_overrides?(overrides) && valid_dependencies?(s)
         end
 
         if platform_spec
-          new_specs << LazySpecification.from_spec(platform_spec) unless specs.include?(platform_spec)
+          unless specs.include?(platform_spec)
+            new_lazy = LazySpecification.from_spec(platform_spec)
+            # Carry the overrides forward so a follow-up complete_platform
+            # call that picks this synthesized variant as its exemplar still
+            # honors the user's override list.
+            new_lazy.overrides = overrides if overrides.any?
+            new_specs << new_lazy
+          end
           true
         else
           false
@@ -221,9 +300,7 @@ module Bundler
       end
 
       if valid_platform && new_specs.any?
-        @specs.concat(new_specs)
-
-        reset!
+        new_specs.each {|spec| add_spec(spec) }
       end
 
       valid_platform
@@ -233,20 +310,28 @@ module Bundler
       @specs.flat_map {|spec| spec.source.specs.search([spec.name, spec.version]).map(&:platform) }.uniq
     end
 
+    def additional_variants_from(other)
+      other.select do |other_spec|
+        spec = exemplary_spec(other_spec.name)
+        next unless spec
+
+        selected = spec.version == other_spec.version && valid_dependencies?(other_spec)
+        other_spec.source = spec.source if selected
+        selected
+      end
+    end
+
     def valid_dependencies?(s)
       validate_deps(s) == :valid
     end
 
     def sorted
-      rake = @specs.find {|s| s.name == "rake" }
-      begin
-        @sorted ||= ([rake] + tsort).compact.uniq
-      rescue TSort::Cyclic => error
-        cgems = extract_circular_gems(error)
-        raise CyclicDependencyError, "Your bundle requires gems that depend" \
-          " on each other, creating an infinite loop. Please remove either" \
-          " gem '#{cgems[0]}' or gem '#{cgems[1]}' and try again."
-      end
+      @sorted ||= ([lookup["rake"]&.first] + tsort).compact.uniq
+    rescue TSort::Cyclic => error
+      cgems = extract_circular_gems(error)
+      raise CyclicDependencyError, "Your bundle requires gems that depend" \
+        " on each other, creating an infinite loop. Please remove either" \
+        " gem '#{cgems[0]}' or gem '#{cgems[1]}' and try again."
     end
 
     def extract_circular_gems(error)
@@ -257,8 +342,7 @@ module Bundler
       @lookup ||= begin
         lookup = {}
         @specs.each do |s|
-          lookup[s.name] ||= []
-          lookup[s.name] << s
+          index_spec(lookup, s.name, s)
         end
         lookup
       end
@@ -269,19 +353,6 @@ module Bundler
       @specs.sort_by(&:name).each {|s| yield s }
     end
 
-    def specs_for_dependency(dep, platform)
-      specs_for_name = lookup[dep.name]
-      return [] unless specs_for_name
-
-      matching_specs = if dep.force_ruby_platform
-        GemHelpers.force_ruby_platform(specs_for_name)
-      else
-        GemHelpers.select_best_platform_match(specs_for_name, platform || Bundler.local_platform)
-      end
-      matching_specs.map!(&:materialize_for_installation).compact! if platform.nil?
-      matching_specs
-    end
-
     def tsort_each_child(s)
       s.dependencies.sort_by(&:name).each do |d|
         next if d.type == :development
@@ -292,5 +363,40 @@ module Bundler
         specs_for_name.each {|s2| yield s2 }
       end
     end
+
+    def add_spec(spec)
+      @specs << spec
+
+      name = spec.name
+
+      @sorted&.insert(@sorted.bsearch_index {|s| s.name >= name } || @sorted.size, spec)
+      return if @lookup.nil?
+
+      index_spec(@lookup, name, spec)
+    end
+
+    def remove_spec(spec)
+      @specs.delete(spec)
+      @sorted&.delete(spec)
+      return if @lookup.nil?
+
+      indexed_specs = @lookup[spec.name]
+      return unless indexed_specs
+
+      if indexed_specs.size > 1
+        @lookup[spec.name].delete(spec)
+      else
+        @lookup[spec.name] = nil
+      end
+    end
+
+    def index_spec(hash, key, value)
+      hash[key] ||= []
+      hash[key] << value
+    end
+
+    def exemplary_spec(name)
+      self[name].first
+    end
   end
 end
diff --git a/lib/bundler/stub_specification.rb b/lib/bundler/stub_specification.rb
index da830cf8d4..b353642b40 100644
--- a/lib/bundler/stub_specification.rb
+++ b/lib/bundler/stub_specification.rb
@@ -9,6 +9,10 @@ module Bundler
       spec
     end
 
+    def insecurely_materialized?
+      false
+    end
+
     attr_reader :checksum
     attr_accessor :stub, :ignored
 
@@ -28,6 +32,17 @@ module Bundler
 
     # @!group Stub Delegates
 
+    def ignored?
+      return @ignored unless @ignored.nil?
+
+      @ignored = missing_extensions?
+      return false unless @ignored
+
+      warn "Source #{source} is ignoring #{self} because it is missing extensions"
+
+      true
+    end
+
     def manually_installed?
       # This is for manually installed gems which are gems that were fixed in place after a
       # failed installation. Once the issue was resolved, the user then manually created
@@ -37,6 +52,7 @@ module Bundler
 
     # This is defined directly to avoid having to loading the full spec
     def missing_extensions?
+      return false if RUBY_ENGINE == "jruby"
       return false if default_gem?
       return false if extensions.empty?
       return false if File.exist? gem_build_complete_path
@@ -45,8 +61,8 @@ module Bundler
       true
     end
 
-    def activated
-      stub.activated
+    def activated?
+      stub.activated?
     end
 
     def activated=(activated)
@@ -77,6 +93,14 @@ module Bundler
       stub.full_require_paths
     end
 
+    def require_paths
+      stub.require_paths
+    end
+
+    def base_dir=(path)
+      stub.base_dir = path
+    end
+
     def load_paths
       full_require_paths
     end
@@ -93,6 +117,10 @@ module Bundler
       stub.raw_require_paths
     end
 
+    def inspect
+      "#<#{self.class} @name=\"#{name}\" (#{full_name.delete_prefix("#{name}-")})>"
+    end
+
     private
 
     def _remote_specification
diff --git a/lib/bundler/templates/Executable b/lib/bundler/templates/Executable
index 9ff6f00898..b085c24da6 100644
--- a/lib/bundler/templates/Executable
+++ b/lib/bundler/templates/Executable
@@ -10,17 +10,6 @@
 
 ENV["BUNDLE_GEMFILE"] ||= File.expand_path("<%= relative_gemfile_path %>", __dir__)
 
-bundle_binstub = File.expand_path("bundle", __dir__)
-
-if File.file?(bundle_binstub)
-  if File.read(bundle_binstub, 300).include?("This file was generated by Bundler")
-    load(bundle_binstub)
-  else
-    abort("Your `bin/bundle` was not generated by Bundler, so this binstub cannot run.
-Replace `bin/bundle` by running `bundle binstubs bundler --force`, then run this command again.")
-  end
-end
-
 require "rubygems"
 require "bundler/setup"
 
diff --git a/lib/bundler/templates/Executable.bundler b/lib/bundler/templates/Executable.bundler
deleted file mode 100644
index caa2021701..0000000000
--- a/lib/bundler/templates/Executable.bundler
+++ /dev/null
@@ -1,109 +0,0 @@
-#!/usr/bin/env <%= Bundler.settings[:shebang] || RbConfig::CONFIG["ruby_install_name"] %>
-# frozen_string_literal: true
-
-#
-# This file was generated by Bundler.
-#
-# The application '<%= executable %>' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require "rubygems"
-
-m = Module.new do
-  module_function
-
-  def invoked_as_script?
-    File.expand_path($0) == File.expand_path(__FILE__)
-  end
-
-  def env_var_version
-    ENV["BUNDLER_VERSION"]
-  end
-
-  def cli_arg_version
-    return unless invoked_as_script? # don't want to hijack other binstubs
-    return unless "update".start_with?(ARGV.first || " ") # must be running `bundle update`
-    bundler_version = nil
-    update_index = nil
-    ARGV.each_with_index do |a, i|
-      if update_index && update_index.succ == i && a.match?(Gem::Version::ANCHORED_VERSION_PATTERN)
-        bundler_version = a
-      end
-      next unless a =~ /\A--bundler(?:[= ](#{Gem::Version::VERSION_PATTERN}))?\z/
-      bundler_version = $1
-      update_index = i
-    end
-    bundler_version
-  end
-
-  def gemfile
-    gemfile = ENV["BUNDLE_GEMFILE"]
-    return gemfile if gemfile && !gemfile.empty?
-
-    File.expand_path("<%= relative_gemfile_path %>", __dir__)
-  end
-
-  def lockfile
-    lockfile =
-      case File.basename(gemfile)
-      when "gems.rb" then gemfile.sub(/\.rb$/, ".locked")
-      else "#{gemfile}.lock"
-      end
-    File.expand_path(lockfile)
-  end
-
-  def lockfile_version
-    return unless File.file?(lockfile)
-    lockfile_contents = File.read(lockfile)
-    return unless lockfile_contents =~ /\n\nBUNDLED WITH\n\s{2,}(#{Gem::Version::VERSION_PATTERN})\n/
-    Regexp.last_match(1)
-  end
-
-  def bundler_requirement
-    @bundler_requirement ||=
-      env_var_version ||
-      cli_arg_version ||
-      bundler_requirement_for(lockfile_version)
-  end
-
-  def bundler_requirement_for(version)
-    return "#{Gem::Requirement.default}.a" unless version
-
-    bundler_gem_version = Gem::Version.new(version)
-
-    bundler_gem_version.approximate_recommendation
-  end
-
-  def load_bundler!
-    ENV["BUNDLE_GEMFILE"] ||= gemfile
-
-    activate_bundler
-  end
-
-  def activate_bundler
-    gem_error = activation_error_handling do
-      gem "bundler", bundler_requirement
-    end
-    return if gem_error.nil?
-    require_error = activation_error_handling do
-      require "bundler/version"
-    end
-    return if require_error.nil? && Gem::Requirement.new(bundler_requirement).satisfied_by?(Gem::Version.new(Bundler::VERSION))
-    warn "Activating bundler (#{bundler_requirement}) failed:\n#{gem_error.message}\n\nTo install the version of bundler this project requires, run `gem install bundler -v '#{bundler_requirement}'`"
-    exit 42
-  end
-
-  def activation_error_handling
-    yield
-    nil
-  rescue StandardError, LoadError => e
-    e
-  end
-end
-
-m.load_bundler!
-
-if m.invoked_as_script?
-  load Gem.bin_path("<%= spec.name %>", "<%= executable %>")
-end
diff --git a/lib/bundler/templates/newgem/CODE_OF_CONDUCT.md.tt b/lib/bundler/templates/newgem/CODE_OF_CONDUCT.md.tt
index 67fe8cee79..633baebdd5 100644
--- a/lib/bundler/templates/newgem/CODE_OF_CONDUCT.md.tt
+++ b/lib/bundler/templates/newgem/CODE_OF_CONDUCT.md.tt
@@ -1,132 +1,10 @@
-# Contributor Covenant Code of Conduct
+# Code of Conduct
 
-## Our Pledge
+<%= config[:name].inspect %> follows [The Ruby Community Conduct Guideline](https://www.ruby-lang.org/en/conduct) in all "collaborative space", which is defined as community communications channels (such as mailing lists, submitted patches, commit comments, etc.):
 
-We as members, contributors, and leaders pledge to make participation in our
-community a harassment-free experience for everyone, regardless of age, body
-size, visible or invisible disability, ethnicity, sex characteristics, gender
-identity and expression, level of experience, education, socio-economic status,
-nationality, personal appearance, race, caste, color, religion, or sexual
-identity and orientation.
+* Participants will be tolerant of opposing views.
+* Participants must ensure that their language and actions are free of personal attacks and disparaging personal remarks.
+* When interpreting the words and actions of others, participants should always assume good intentions.
+* Behaviour which can be reasonably considered harassment will not be tolerated.
 
-We pledge to act and interact in ways that contribute to an open, welcoming,
-diverse, inclusive, and healthy community.
-
-## Our Standards
-
-Examples of behavior that contributes to a positive environment for our
-community include:
-
-* Demonstrating empathy and kindness toward other people
-* Being respectful of differing opinions, viewpoints, and experiences
-* Giving and gracefully accepting constructive feedback
-* Accepting responsibility and apologizing to those affected by our mistakes,
-  and learning from the experience
-* Focusing on what is best not just for us as individuals, but for the overall
-  community
-
-Examples of unacceptable behavior include:
-
-* The use of sexualized language or imagery, and sexual attention or advances of
-  any kind
-* Trolling, insulting or derogatory comments, and personal or political attacks
-* Public or private harassment
-* Publishing others' private information, such as a physical or email address,
-  without their explicit permission
-* Other conduct which could reasonably be considered inappropriate in a
-  professional setting
-
-## Enforcement Responsibilities
-
-Community leaders are responsible for clarifying and enforcing our standards of
-acceptable behavior and will take appropriate and fair corrective action in
-response to any behavior that they deem inappropriate, threatening, offensive,
-or harmful.
-
-Community leaders have the right and responsibility to remove, edit, or reject
-comments, commits, code, wiki edits, issues, and other contributions that are
-not aligned to this Code of Conduct, and will communicate reasons for moderation
-decisions when appropriate.
-
-## Scope
-
-This Code of Conduct applies within all community spaces, and also applies when
-an individual is officially representing the community in public spaces.
-Examples of representing our community include using an official email address,
-posting via an official social media account, or acting as an appointed
-representative at an online or offline event.
-
-## Enforcement
-
-Instances of abusive, harassing, or otherwise unacceptable behavior may be
-reported to the community leaders responsible for enforcement at
-[INSERT CONTACT METHOD].
-All complaints will be reviewed and investigated promptly and fairly.
-
-All community leaders are obligated to respect the privacy and security of the
-reporter of any incident.
-
-## Enforcement Guidelines
-
-Community leaders will follow these Community Impact Guidelines in determining
-the consequences for any action they deem in violation of this Code of Conduct:
-
-### 1. Correction
-
-**Community Impact**: Use of inappropriate language or other behavior deemed
-unprofessional or unwelcome in the community.
-
-**Consequence**: A private, written warning from community leaders, providing
-clarity around the nature of the violation and an explanation of why the
-behavior was inappropriate. A public apology may be requested.
-
-### 2. Warning
-
-**Community Impact**: A violation through a single incident or series of
-actions.
-
-**Consequence**: A warning with consequences for continued behavior. No
-interaction with the people involved, including unsolicited interaction with
-those enforcing the Code of Conduct, for a specified period of time. This
-includes avoiding interactions in community spaces as well as external channels
-like social media. Violating these terms may lead to a temporary or permanent
-ban.
-
-### 3. Temporary Ban
-
-**Community Impact**: A serious violation of community standards, including
-sustained inappropriate behavior.
-
-**Consequence**: A temporary ban from any sort of interaction or public
-communication with the community for a specified period of time. No public or
-private interaction with the people involved, including unsolicited interaction
-with those enforcing the Code of Conduct, is allowed during this period.
-Violating these terms may lead to a permanent ban.
-
-### 4. Permanent Ban
-
-**Community Impact**: Demonstrating a pattern of violation of community
-standards, including sustained inappropriate behavior, harassment of an
-individual, or aggression toward or disparagement of classes of individuals.
-
-**Consequence**: A permanent ban from any sort of public interaction within the
-community.
-
-## Attribution
-
-This Code of Conduct is adapted from the [Contributor Covenant][homepage],
-version 2.1, available at
-[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
-
-Community Impact Guidelines were inspired by
-[Mozilla's code of conduct enforcement ladder][Mozilla CoC].
-
-For answers to common questions about this code of conduct, see the FAQ at
-[https://www.contributor-covenant.org/faq][FAQ]. Translations are available at
-[https://www.contributor-covenant.org/translations][translations].
-
-[homepage]: https://www.contributor-covenant.org
-[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html
-[Mozilla CoC]: https://github.com/mozilla/diversity
-[FAQ]: https://www.contributor-covenant.org/faq
-[translations]: https://www.contributor-covenant.org/translations
+If you have any concerns about behaviour within this project, please contact us at [<%= config[:email].inspect %>](mailto:<%= config[:email].inspect %>).
diff --git a/lib/bundler/templates/newgem/Cargo.toml.tt b/lib/bundler/templates/newgem/Cargo.toml.tt
index f5a460c9bb..cd00f97e5a 100644
--- a/lib/bundler/templates/newgem/Cargo.toml.tt
+++ b/lib/bundler/templates/newgem/Cargo.toml.tt
@@ -5,3 +5,9 @@
 [workspace]
 members = ["./ext/<%= config[:name] %>"]
 resolver = "2"
+
+[profile.release]
+# By default, debug symbols are stripped from the final binary which makes it
+# harder to debug if something goes wrong. It's recommended to keep debug
+# symbols in the release build so that you can debug the final binary if needed.
+debug = true
diff --git a/lib/bundler/templates/newgem/Gemfile.tt b/lib/bundler/templates/newgem/Gemfile.tt
index a0d2ac2826..85dc593b8f 100644
--- a/lib/bundler/templates/newgem/Gemfile.tt
+++ b/lib/bundler/templates/newgem/Gemfile.tt
@@ -5,22 +5,20 @@ source "https://rubygems.org"
 # Specify your gem's dependencies in <%= config[:name] %>.gemspec
 gemspec
 
-gem "rake", "~> 13.0"
+gem "irb"
+gem "rake", ">= 13.0"
 <%- if config[:ext] -%>
 
 gem "rake-compiler"
-<%- if config[:ext] == 'rust' -%>
-gem "rb_sys", "~> 0.9.63"
-<%- end -%>
 <%- end -%>
 <%- if config[:test] -%>
 
-gem "<%= config[:test] %>", "~> <%= config[:test_framework_version] %>"
+gem "<%= config[:test] %>"
 <%- end -%>
 <%- if config[:linter] == "rubocop" -%>
 
-gem "rubocop", "~> <%= config[:linter_version] %>"
+gem "rubocop"
 <%- elsif config[:linter] == "standard" -%>
 
-gem "standard", "~> <%= config[:linter_version] %>"
+gem "standard"
 <%- end -%>
diff --git a/lib/bundler/templates/newgem/README.md.tt b/lib/bundler/templates/newgem/README.md.tt
index 5bf36378e8..0ec6a12fa7 100644
--- a/lib/bundler/templates/newgem/README.md.tt
+++ b/lib/bundler/templates/newgem/README.md.tt
@@ -10,11 +10,15 @@ TODO: Replace `UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_O
 
 Install the gem and add to the application's Gemfile by executing:
 
-    $ bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```bash
+bundle add UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
 
 If bundler is not being used to manage dependencies, install the gem by executing:
 
-    $ gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```bash
+gem install UPDATE_WITH_YOUR_GEM_NAME_IMMEDIATELY_AFTER_RELEASE_TO_RUBYGEMS_ORG
+```
 
 ## Usage
 
@@ -22,7 +26,7 @@ TODO: Write usage instructions here
 
 ## Development
 
-After checking out the repo, run `bin/setup` to install dependencies.<% if config[:test] %> Then, run `rake <%= config[:test].sub('mini', '').sub('rspec', 'spec') %>` to run the tests.<% end %> You can also run `bin/console` for an interactive prompt that will allow you to experiment.<% if config[:bin] %> Run `bundle exec <%= config[:name] %>` to use the gem in this directory, ignoring other installed copies of this gem.<% end %>
+After checking out the repo, run `bin/setup` to install dependencies.<% if config[:test] %> Then, run `rake <%= config[:test_task] %>` to run the tests.<% end %> You can also run `bin/console` for an interactive prompt that will allow you to experiment.<% if config[:bin] %> Run `bundle exec <%= config[:name] %>` to use the gem in this directory, ignoring other installed copies of this gem.<% end %>
 
 To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
 <% if config[:git] -%>
diff --git a/lib/bundler/templates/newgem/Rakefile.tt b/lib/bundler/templates/newgem/Rakefile.tt
index 172183d4b4..83f10009c7 100644
--- a/lib/bundler/templates/newgem/Rakefile.tt
+++ b/lib/bundler/templates/newgem/Rakefile.tt
@@ -59,6 +59,11 @@ Rake::ExtensionTask.new("<%= config[:underscored_name] %>", GEMSPEC) do |ext|
 end
 <% end -%>
 
+<% if config[:ext] == "go" -%>
+require "go_gem/rake_task"
+
+GoGem::RakeTask.new("<%= config[:underscored_name] %>")
+<% end -%>
 <% end -%>
 <% if default_task_names.size == 1 -%>
 task default: <%= default_task_names.first.inspect %>
diff --git a/lib/bundler/templates/newgem/circleci/config.yml.tt b/lib/bundler/templates/newgem/circleci/config.yml.tt
index f40f029bf1..c4dd9d0647 100644
--- a/lib/bundler/templates/newgem/circleci/config.yml.tt
+++ b/lib/bundler/templates/newgem/circleci/config.yml.tt
@@ -7,6 +7,10 @@ jobs:
     environment:
       RB_SYS_FORCE_INSTALL_RUST_TOOLCHAIN: 'true'
 <%- end -%>
+<%- if config[:ext] == 'go' -%>
+    environment:
+      GO_VERSION: '1.23.0'
+<%- end -%>
     steps:
       - checkout
 <%- if config[:ext] == 'rust' -%>
@@ -17,6 +21,14 @@ jobs:
           name: Install a RubyGems version that can compile rust extensions
           command: gem update --system '<%= ::Gem.rubygems_version %>'
 <%- end -%>
+<%- if config[:ext] == 'go' -%>
+      - run:
+          name: Install Go
+          command: |
+            wget https://go.dev/dl/go$GO_VERSION.linux-amd64.tar.gz -O /tmp/go.tar.gz
+            tar -C /usr/local -xzf /tmp/go.tar.gz
+            echo 'export PATH=/usr/local/go/bin:"$PATH"' >> "$BASH_ENV"
+<%- end -%>
       - run:
           name: Run the default task
           command: |
diff --git a/lib/bundler/templates/newgem/ext/newgem/Cargo.toml.tt b/lib/bundler/templates/newgem/ext/newgem/Cargo.toml.tt
index 0ebce0e4a0..a06166aee7 100644
--- a/lib/bundler/templates/newgem/ext/newgem/Cargo.toml.tt
+++ b/lib/bundler/templates/newgem/ext/newgem/Cargo.toml.tt
@@ -12,4 +12,11 @@ publish = false
 crate-type = ["cdylib"]
 
 [dependencies]
-magnus = { version = "0.6.2" }
+magnus = { version = "0.8.2" }
+rb-sys = { version = "0.9", features = ["stable-api-compiled-fallback"] }
+
+[build-dependencies]
+rb-sys-env = "0.2.2"
+
+[dev-dependencies]
+rb-sys-test-helpers = { version = "0.2.2" }
diff --git a/lib/bundler/templates/newgem/ext/newgem/build.rs.tt b/lib/bundler/templates/newgem/ext/newgem/build.rs.tt
new file mode 100644
index 0000000000..80a7842753
--- /dev/null
+++ b/lib/bundler/templates/newgem/ext/newgem/build.rs.tt
@@ -0,0 +1,5 @@
+pub fn main() -> Result<(), Box<dyn std::error::Error>> {
+    let _ = rb_sys_env::activate()?;
+
+    Ok(())
+}
diff --git a/lib/bundler/templates/newgem/ext/newgem/extconf-go.rb.tt b/lib/bundler/templates/newgem/ext/newgem/extconf-go.rb.tt
new file mode 100644
index 0000000000..a689e21ebe
--- /dev/null
+++ b/lib/bundler/templates/newgem/ext/newgem/extconf-go.rb.tt
@@ -0,0 +1,11 @@
+# frozen_string_literal: true
+
+require "mkmf"
+require "go_gem/mkmf"
+
+# Makes all symbols private by default to avoid unintended conflict
+# with other gems. To explicitly export symbols you can use RUBY_FUNC_EXPORTED
+# selectively, or entirely remove this flag.
+append_cflags("-fvisibility=hidden")
+
+create_go_makefile(<%= config[:makefile_path].inspect %>)
diff --git a/lib/bundler/templates/newgem/ext/newgem/go.mod.tt b/lib/bundler/templates/newgem/ext/newgem/go.mod.tt
new file mode 100644
index 0000000000..3f4819d004
--- /dev/null
+++ b/lib/bundler/templates/newgem/ext/newgem/go.mod.tt
@@ -0,0 +1,5 @@
+module github.com/<%= config[:go_module_username] %>/<%= config[:underscored_name] %>
+
+go 1.23
+
+require github.com/ruby-go-gem/go-gem-wrapper latest
diff --git a/lib/bundler/templates/newgem/ext/newgem/newgem-go.c.tt b/lib/bundler/templates/newgem/ext/newgem/newgem-go.c.tt
new file mode 100644
index 0000000000..119c0c96ea
--- /dev/null
+++ b/lib/bundler/templates/newgem/ext/newgem/newgem-go.c.tt
@@ -0,0 +1,2 @@
+#include "<%= config[:underscored_name] %>.h"
+#include "_cgo_export.h"
diff --git a/lib/bundler/templates/newgem/ext/newgem/newgem.go.tt b/lib/bundler/templates/newgem/ext/newgem/newgem.go.tt
new file mode 100644
index 0000000000..f19b750e58
--- /dev/null
+++ b/lib/bundler/templates/newgem/ext/newgem/newgem.go.tt
@@ -0,0 +1,31 @@
+package main
+
+/*
+#include "<%= config[:underscored_name] %>.h"
+
+VALUE rb_<%= config[:underscored_name] %>_sum(VALUE self, VALUE a, VALUE b);
+*/
+import "C"
+
+import (
+	"github.com/ruby-go-gem/go-gem-wrapper/ruby"
+)
+
+//export rb_<%= config[:underscored_name] %>_sum
+func rb_<%= config[:underscored_name] %>_sum(_ C.VALUE, a C.VALUE, b C.VALUE) C.VALUE {
+	longA := ruby.NUM2LONG(ruby.VALUE(a))
+	longB := ruby.NUM2LONG(ruby.VALUE(b))
+
+	sum := longA + longB
+
+	return C.VALUE(ruby.LONG2NUM(sum))
+}
+
+//export Init_<%= config[:underscored_name] %>
+func Init_<%= config[:underscored_name] %>() {
+	rb_m<%= config[:constant_array].join %> := ruby.RbDefineModule(<%= config[:constant_name].inspect %>)
+	ruby.RbDefineSingletonMethod(rb_m<%= config[:constant_array].join %>, "sum", C.rb_<%= config[:underscored_name] %>_sum, 2)
+}
+
+func main() {
+}
diff --git a/lib/bundler/templates/newgem/ext/newgem/src/lib.rs.tt b/lib/bundler/templates/newgem/ext/newgem/src/lib.rs.tt
index ba234529a3..09ce97682d 100644
--- a/lib/bundler/templates/newgem/ext/newgem/src/lib.rs.tt
+++ b/lib/bundler/templates/newgem/ext/newgem/src/lib.rs.tt
@@ -1,7 +1,7 @@
 use magnus::{function, prelude::*, Error, Ruby};
 
-fn hello(subject: String) -> String {
-    format!("Hello from Rust, {subject}!")
+pub fn hello(subject: String) -> String {
+    format!("Hello {subject}, from Rust!")
 }
 
 #[magnus::init]
@@ -10,3 +10,14 @@ fn init(ruby: &Ruby) -> Result<(), Error> {
     module.define_singleton_method("hello", function!(hello, 1))?;
     Ok(())
 }
+
+#[cfg(test)]
+mod tests {
+    use rb_sys_test_helpers::ruby_test;
+    use super::hello;
+
+    #[ruby_test]
+    fn test_hello() {
+        assert_eq!("Hello world, from Rust!", hello("world".to_string()));
+    }
+}
diff --git a/lib/bundler/templates/newgem/github/workflows/build-gems.yml.tt b/lib/bundler/templates/newgem/github/workflows/build-gems.yml.tt
new file mode 100644
index 0000000000..d49954d2cd
--- /dev/null
+++ b/lib/bundler/templates/newgem/github/workflows/build-gems.yml.tt
@@ -0,0 +1,69 @@
+---
+name: Build gems
+
+on:
+  push:
+    tags:
+      - "v*"
+      - "cross-gem/*"
+  workflow_dispatch:
+
+permissions:
+  contents: read
+  packages: write
+
+jobs:
+  ci-data:
+    runs-on: ubuntu-latest
+    outputs:
+      result: ${{ steps.fetch.outputs.result }}
+    steps:
+      - uses: oxidize-rb/actions/fetch-ci-data@v1
+        id: fetch
+        with:
+          supported-ruby-platforms: |
+            exclude: ["arm-linux", "x64-mingw32"]
+          stable-ruby-versions: |
+            exclude: ["head"]
+
+  source-gem:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v6
+
+      - uses: ruby/setup-ruby@v1
+        with:
+          bundler-cache: true
+
+      - name: Build gem
+        run: bundle exec rake build
+
+      - uses: actions/upload-artifact@v7
+        with:
+          name: source-gem
+          path: pkg/*.gem
+
+  cross-gem:
+    name: Compile native gem for ${{ matrix.platform }}
+    runs-on: ubuntu-latest
+    needs: ci-data
+    strategy:
+      matrix:
+        platform: ${{ fromJSON(needs.ci-data.outputs.result).supported-ruby-platforms }}
+    steps:
+      - uses: actions/checkout@v6
+
+      - uses: ruby/setup-ruby@v1
+        with:
+          bundler-cache: true
+
+      - uses: oxidize-rb/actions/cross-gem@v1
+        id: cross-gem
+        with:
+          platform: ${{ matrix.platform }}
+          ruby-versions: ${{ join(fromJSON(needs.ci-data.outputs.result).stable-ruby-versions, ',') }}
+
+      - uses: actions/upload-artifact@v7
+        with:
+          name: cross-gem
+          path: ${{ steps.cross-gem.outputs.gem-path }}
diff --git a/lib/bundler/templates/newgem/github/workflows/main.yml.tt b/lib/bundler/templates/newgem/github/workflows/main.yml.tt
index 32b39558d8..cc8f04dd33 100644
--- a/lib/bundler/templates/newgem/github/workflows/main.yml.tt
+++ b/lib/bundler/templates/newgem/github/workflows/main.yml.tt
@@ -7,6 +7,9 @@ on:
 
   pull_request:
 
+permissions:
+  contents: read
+
 jobs:
   build:
     runs-on: ubuntu-latest
@@ -17,21 +20,29 @@ jobs:
           - '<%= RUBY_VERSION %>'
 
     steps:
-    - uses: actions/checkout@v4
+      - uses: actions/checkout@v6
+        with:
+          persist-credentials: false
 <%- if config[:ext] == 'rust' -%>
-    - name: Set up Ruby & Rust
-      uses: oxidize-rb/actions/setup-ruby-and-rust@v1
-      with:
-        ruby-version: ${{ matrix.ruby }}
-        bundler-cache: true
-        cargo-cache: true
-        rubygems: '<%= ::Gem.rubygems_version %>'
+      - name: Set up Ruby & Rust
+        uses: oxidize-rb/actions/setup-ruby-and-rust@v1
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler-cache: true
+          cargo-cache: true
+          rubygems: '<%= ::Gem.rubygems_version %>'
 <%- else -%>
-    - name: Set up Ruby
-      uses: ruby/setup-ruby@v1
-      with:
-        ruby-version: ${{ matrix.ruby }}
-        bundler-cache: true
+      - name: Set up Ruby
+        uses: ruby/setup-ruby@v1
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler-cache: true
+<%- end -%>
+<%- if config[:ext] == 'go' -%>
+      - name: Setup Go
+        uses: actions/setup-go@v5
+        with:
+          go-version-file: ext/<%= config[:underscored_name] %>/go.mod
 <%- end -%>
-    - name: Run the default task
-      run: bundle exec rake
+      - name: Run the default task
+        run: bundle exec rake
diff --git a/lib/bundler/templates/newgem/gitlab-ci.yml.tt b/lib/bundler/templates/newgem/gitlab-ci.yml.tt
index d2e1f33736..adbd70cbc0 100644
--- a/lib/bundler/templates/newgem/gitlab-ci.yml.tt
+++ b/lib/bundler/templates/newgem/gitlab-ci.yml.tt
@@ -6,6 +6,11 @@ default:
     - apt-get update && apt-get install -y clang
     - gem update --system '<%= ::Gem.rubygems_version %>'
 <%- end -%>
+<%- if config[:ext] == 'go' -%>
+    - wget https://go.dev/dl/go$GO_VERSION.linux-amd64.tar.gz -O /tmp/go.tar.gz
+    - tar -C /usr/local -xzf /tmp/go.tar.gz
+    - export PATH=/usr/local/go/bin:$PATH
+<%- end -%>
     - gem install bundler -v <%= Bundler::VERSION %>
     - bundle install
 
@@ -14,5 +19,9 @@ example_job:
   variables:
     RB_SYS_FORCE_INSTALL_RUST_TOOLCHAIN: 'true'
 <%- end -%>
+<%- if config[:ext] == 'go' -%>
+  variables:
+    GO_VERSION: '1.23.0'
+<%- end -%>
   script:
     - bundle exec rake
diff --git a/lib/bundler/templates/newgem/lib/newgem.rb.tt b/lib/bundler/templates/newgem/lib/newgem.rb.tt
index caf6e32f4a..3aedee0d25 100644
--- a/lib/bundler/templates/newgem/lib/newgem.rb.tt
+++ b/lib/bundler/templates/newgem/lib/newgem.rb.tt
@@ -2,7 +2,7 @@
 
 require_relative "<%= File.basename(config[:namespaced_path]) %>/version"
 <%- if config[:ext] -%>
-require_relative "<%= File.basename(config[:namespaced_path]) %>/<%= config[:underscored_name] %>"
+require "<%= File.basename(config[:namespaced_path]) %>/<%= config[:underscored_name] %>"
 <%- end -%>
 
 <%- config[:constant_array].each_with_index do |c, i| -%>
diff --git a/lib/bundler/templates/newgem/newgem.gemspec.tt b/lib/bundler/templates/newgem/newgem.gemspec.tt
index 6e88f4dab1..1ab1c28f46 100644
--- a/lib/bundler/templates/newgem/newgem.gemspec.tt
+++ b/lib/bundler/templates/newgem/newgem.gemspec.tt
@@ -10,20 +10,23 @@ Gem::Specification.new do |spec|
 
   spec.summary = "TODO: Write a short summary, because RubyGems requires one."
   spec.description = "TODO: Write a longer description or delete this line."
-  spec.homepage = "TODO: Put your gem's website or public repo URL here."
+  spec.homepage = "<%= config[:homepage_uri] %>"
 <%- if config[:mit] -%>
   spec.license = "MIT"
 <%- end -%>
   spec.required_ruby_version = ">= <%= config[:required_ruby_version] %>"
-<%- if config[:ext] == 'rust' -%>
-  spec.required_rubygems_version = ">= <%= config[:rust_builder_required_rubygems_version] %>"
-<%- end -%>
-
   spec.metadata["allowed_push_host"] = "TODO: Set to your gem server 'https://example.com'"
-
   spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = "TODO: Put your gem's public repo URL here."
-  spec.metadata["changelog_uri"] = "TODO: Put your gem's CHANGELOG.md URL here."
+  spec.metadata["source_code_uri"] = "<%= config[:source_code_uri] %>"
+<%- if config[:changelog] -%>
+  spec.metadata["changelog_uri"] = "<%= config[:changelog_uri] %>"
+<%- end -%>
+
+  # Uncomment the line below to require MFA for gem pushes.
+  # This helps protect your gem from supply chain attacks by ensuring
+  # no one can publish a new version without multi-factor authentication.
+  # See: https://guides.rubygems.org/mfa-requirement-opt-in/
+  # spec.metadata["rubygems_mfa_required"] = "true"
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
@@ -31,22 +34,25 @@ Gem::Specification.new do |spec|
   spec.files = IO.popen(%w[git ls-files -z], chdir: __dir__, err: IO::NULL) do |ls|
     ls.readlines("\x0", chomp: true).reject do |f|
       (f == gemspec) ||
-        f.start_with?(*%w[bin/ test/ spec/ features/ .git <%= config[:ci_config_path] %>appveyor Gemfile])
+        f.start_with?(*%w[<%= config[:ignore_paths].join(" ") %>])
     end
   end
   spec.bindir = "exe"
   spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
   spec.require_paths = ["lib"]
-<%- if config[:ext] == 'c' -%>
+<%- if %w(c rust go).include?(config[:ext]) -%>
   spec.extensions = ["ext/<%= config[:underscored_name] %>/extconf.rb"]
 <%- end -%>
-<%- if config[:ext] == 'rust' -%>
-  spec.extensions = ["ext/<%= config[:underscored_name] %>/Cargo.toml"]
-<%- end -%>
 
   # Uncomment to register a new dependency of your gem
-  # spec.add_dependency "example-gem", "~> 1.0"
+  # spec.add_dependency "example-gem", ">= 1.0"
+<%- if config[:ext] == 'rust' -%>
+  spec.add_dependency "rb_sys", ">= 0.9.128"
+<%- end -%>
+<%- if config[:ext] == 'go' -%>
+  spec.add_dependency "go_gem", ">= 0.2"
+<%- end -%>
 
   # For more information and examples about making a new gem, check out our
-  # guide at: https://bundler.io/guides/creating_gem.html
+  # guide at: https://guides.rubygems.org/make-your-own-gem/
 end
diff --git a/lib/bundler/templates/newgem/spec/newgem_spec.rb.tt b/lib/bundler/templates/newgem/spec/newgem_spec.rb.tt
index 82cada988c..7c6cde170b 100644
--- a/lib/bundler/templates/newgem/spec/newgem_spec.rb.tt
+++ b/lib/bundler/templates/newgem/spec/newgem_spec.rb.tt
@@ -5,7 +5,15 @@ RSpec.describe <%= config[:constant_name] %> do
     expect(<%= config[:constant_name] %>::VERSION).not_to be nil
   end
 
+<%- if config[:ext] == 'rust' -%>
+  it "can call into Rust" do
+    result = <%= config[:constant_name] %>.hello("world")
+
+    expect(result).to eq("Hello world, from Rust!")
+  end
+<%- else -%>
   it "does something useful" do
     expect(false).to eq(true)
   end
+<%- end -%>
 end
diff --git a/lib/bundler/templates/newgem/test/minitest/test_newgem.rb.tt b/lib/bundler/templates/newgem/test/minitest/test_newgem.rb.tt
index 4b35a63071..844d3aff81 100644
--- a/lib/bundler/templates/newgem/test/minitest/test_newgem.rb.tt
+++ b/lib/bundler/templates/newgem/test/minitest/test_newgem.rb.tt
@@ -7,7 +7,13 @@ class <%= config[:minitest_constant_name] %> < Minitest::Test
     refute_nil ::<%= config[:constant_name] %>::VERSION
   end
 
+<%- if config[:ext] == 'rust' -%>
+  def test_hello_world
+    assert_equal "Hello world, from Rust!", <%= config[:constant_name] %>.hello("world")
+  end
+<%- else -%>
   def test_it_does_something_useful
     assert false
   end
+<%- end -%>
 end
diff --git a/lib/bundler/ui/shell.rb b/lib/bundler/ui/shell.rb
index 4555612dbb..b836208da8 100644
--- a/lib/bundler/ui/shell.rb
+++ b/lib/bundler/ui/shell.rb
@@ -6,14 +6,18 @@ module Bundler
   module UI
     class Shell
       LEVELS = %w[silent error warn confirm info debug].freeze
+      OUTPUT_STREAMS = [:stdout, :stderr].freeze
 
       attr_writer :shell
+      attr_reader :output_stream
 
       def initialize(options = {})
         Thor::Base.shell = options["no-color"] ? Thor::Shell::Basic : nil
         @shell = Thor::Base.shell.new
         @level = ENV["DEBUG"] ? "debug" : "info"
         @warning_history = []
+        @output_stream = :stdout
+        @thread_safe_logger_key = "logger_level_#{object_id}"
       end
 
       def add_color(string, *color)
@@ -77,14 +81,14 @@ module Bundler
       end
 
       def ask(msg)
-        @shell.ask(msg)
+        @shell.ask(msg, :green)
       end
 
       def yes?(msg)
-        @shell.yes?(msg)
+        @shell.yes?(msg, :green)
       end
 
-      def no?
+      def no?(msg)
         @shell.no?(msg)
       end
 
@@ -94,11 +98,18 @@ module Bundler
       end
 
       def level(name = nil)
-        return @level unless name
+        current_level = Thread.current.thread_variable_get(@thread_safe_logger_key) || @level
+        return current_level unless name
+
         unless index = LEVELS.index(name)
           raise "#{name.inspect} is not a valid level"
         end
-        index <= LEVELS.index(@level)
+        index <= LEVELS.index(current_level)
+      end
+
+      def output_stream=(symbol)
+        raise ArgumentError unless OUTPUT_STREAMS.include?(symbol)
+        @output_stream = symbol
       end
 
       def trace(e, newline = nil, force = false)
@@ -111,6 +122,10 @@ module Bundler
         with_level("silent", &blk)
       end
 
+      def progress(&blk)
+        with_output_stream(:stderr, &blk)
+      end
+
       def unprinted_warnings
         []
       end
@@ -119,6 +134,8 @@ module Bundler
 
       # valimism
       def tell_me(msg, color = nil, newline = nil)
+        return tell_err(msg, color, newline) if output_stream == :stderr
+
         msg = word_wrap(msg) if newline.is_a?(Hash) && newline[:wrap]
         if newline.nil?
           @shell.say(msg, color)
@@ -130,7 +147,7 @@ module Bundler
       def tell_err(message, color = nil, newline = nil)
         return if @shell.send(:stderr).closed?
 
-        newline ||= !message.to_s.match?(/( |\t)\Z/)
+        newline = !message.to_s.match?(/( |\t)\Z/) if newline.nil?
         message = word_wrap(message) if newline.is_a?(Hash) && newline[:wrap]
 
         color = nil if color && !$stderr.tty?
@@ -153,12 +170,21 @@ module Bundler
         end * "\n"
       end
 
-      def with_level(level)
-        original = @level
-        @level = level
+      def with_level(desired_level)
+        old_level = level
+        Thread.current.thread_variable_set(@thread_safe_logger_key, desired_level)
+
+        yield
+      ensure
+        Thread.current.thread_variable_set(@thread_safe_logger_key, old_level)
+      end
+
+      def with_output_stream(symbol)
+        original = output_stream
+        self.output_stream = symbol
         yield
       ensure
-        @level = original
+        @output_stream = original
       end
     end
   end
diff --git a/lib/bundler/ui/silent.rb b/lib/bundler/ui/silent.rb
index fa3292bdc9..83d31d4b55 100644
--- a/lib/bundler/ui/silent.rb
+++ b/lib/bundler/ui/silent.rb
@@ -53,6 +53,13 @@ module Bundler
         false
       end
 
+      def output_stream=(_symbol)
+      end
+
+      def output_stream
+        nil
+      end
+
       def ask(message)
       end
 
@@ -60,7 +67,7 @@ module Bundler
         raise "Cannot ask yes? with a silent shell"
       end
 
-      def no?
+      def no?(msg)
         raise "Cannot ask no? with a silent shell"
       end
 
@@ -77,6 +84,10 @@ module Bundler
         yield
       end
 
+      def progress
+        yield
+      end
+
       def unprinted_warnings
         @warnings
       end
diff --git a/lib/bundler/uri_credentials_filter.rb b/lib/bundler/uri_credentials_filter.rb
index a83f5304e2..6804187433 100644
--- a/lib/bundler/uri_credentials_filter.rb
+++ b/lib/bundler/uri_credentials_filter.rb
@@ -16,7 +16,7 @@ module Bundler
 
       if uri.userinfo
         # oauth authentication
-        if uri.password == "x-oauth-basic" || uri.password == "x"
+        if uri.password == "x-oauth-basic" || uri.password == "x" || uri.password.nil?
           # URI as string does not display with password if no user is set
           oauth_designation = uri.password
           uri.user = oauth_designation
diff --git a/lib/bundler/vendor/connection_pool/lib/connection_pool.rb b/lib/bundler/vendor/connection_pool/lib/connection_pool.rb
index 317088a866..e8aaf70016 100644
--- a/lib/bundler/vendor/connection_pool/lib/connection_pool.rb
+++ b/lib/bundler/vendor/connection_pool/lib/connection_pool.rb
@@ -39,7 +39,7 @@ end
 # - :auto_reload_after_fork - automatically drop all connections after fork, defaults to true
 #
 class Bundler::ConnectionPool
-  DEFAULTS = {size: 5, timeout: 5, auto_reload_after_fork: true}
+  DEFAULTS = {size: 5, timeout: 5, auto_reload_after_fork: true}.freeze
 
   def self.wrap(options, &block)
     Wrapper.new(options, &block)
@@ -99,10 +99,14 @@ class Bundler::ConnectionPool
     @available = TimedStack.new(@size, &block)
     @key = :"pool-#{@available.object_id}"
     @key_count = :"pool-#{@available.object_id}-count"
-    INSTANCES[self] = self if INSTANCES
+    @discard_key = :"pool-#{@available.object_id}-discard"
+    INSTANCES[self] = self if @auto_reload_after_fork && INSTANCES
   end
 
   def with(options = {})
+    # We need to manage exception handling manually here in order
+    # to work correctly with `Gem::Timeout.timeout` and `Thread#raise`.
+    # Otherwise an interrupted Thread can leak connections.
     Thread.handle_interrupt(Exception => :never) do
       conn = checkout(options)
       begin
@@ -116,20 +120,65 @@ class Bundler::ConnectionPool
   end
   alias_method :then, :with
 
+  ##
+  # Marks the current thread's checked-out connection for discard.
+  #
+  # When a connection is marked for discard, it will not be returned to the pool
+  # when checked in. Instead, the connection will be discarded.
+  # This is useful when a connection has become invalid or corrupted
+  # and should not be reused.
+  #
+  # Takes an optional block that will be called with the connection to be discarded.
+  # The block should perform any necessary clean-up on the connection.
+  #
+  # @yield [conn]
+  # @yieldparam conn [Object] The connection to be discarded.
+  # @yieldreturn [void]
+  #
+  #
+  # Note: This only affects the connection currently checked out by the calling thread.
+  # The connection will be discarded when +checkin+ is called.
+  #
+  # @return [void]
+  #
+  # @example
+  #   pool.with do |conn|
+  #     begin
+  #       conn.execute("SELECT 1")
+  #     rescue SomeConnectionError
+  #       pool.discard_current_connection  # Mark connection as bad
+  #       raise
+  #     end
+  #   end
+  def discard_current_connection(&block)
+    ::Thread.current[@discard_key] = block || proc { |conn| conn }
+  end
+
   def checkout(options = {})
     if ::Thread.current[@key]
       ::Thread.current[@key_count] += 1
       ::Thread.current[@key]
     else
       ::Thread.current[@key_count] = 1
-      ::Thread.current[@key] = @available.pop(options[:timeout] || @timeout)
+      ::Thread.current[@key] = @available.pop(options[:timeout] || @timeout, options)
     end
   end
 
   def checkin(force: false)
     if ::Thread.current[@key]
       if ::Thread.current[@key_count] == 1 || force
-        @available.push(::Thread.current[@key])
+        if ::Thread.current[@discard_key]
+          begin
+            @available.decrement_created
+            ::Thread.current[@discard_key].call(::Thread.current[@key])
+          rescue
+            nil
+          ensure
+            ::Thread.current[@discard_key] = nil
+          end
+        else
+          @available.push(::Thread.current[@key])
+        end
         ::Thread.current[@key] = nil
         ::Thread.current[@key_count] = nil
       else
@@ -146,7 +195,6 @@ class Bundler::ConnectionPool
   # Shuts down the Bundler::ConnectionPool by passing each connection to +block+ and
   # then removing it from the pool. Attempting to checkout a connection after
   # shutdown will raise +Bundler::ConnectionPool::PoolShuttingDownError+.
-
   def shutdown(&block)
     @available.shutdown(&block)
   end
@@ -155,11 +203,16 @@ class Bundler::ConnectionPool
   # Reloads the Bundler::ConnectionPool by passing each connection to +block+ and then
   # removing it the pool. Subsequent checkouts will create new connections as
   # needed.
-
   def reload(&block)
     @available.shutdown(reload: true, &block)
   end
 
+  ## Reaps idle connections that have been idle for over +idle_seconds+.
+  # +idle_seconds+ defaults to 60.
+  def reap(idle_seconds = 60, &block)
+    @available.reap(idle_seconds, &block)
+  end
+
   # Size of this connection pool
   attr_reader :size
   # Automatically drop all connections after fork
@@ -169,6 +222,11 @@ class Bundler::ConnectionPool
   def available
     @available.length
   end
+
+  # Number of pool entries created and idle in the pool.
+  def idle
+    @available.idle
+  end
 end
 
 require_relative "connection_pool/timed_stack"
diff --git a/lib/bundler/vendor/connection_pool/lib/connection_pool/timed_stack.rb b/lib/bundler/vendor/connection_pool/lib/connection_pool/timed_stack.rb
index 35d1d7cc35..026d2c5be2 100644
--- a/lib/bundler/vendor/connection_pool/lib/connection_pool/timed_stack.rb
+++ b/lib/bundler/vendor/connection_pool/lib/connection_pool/timed_stack.rb
@@ -1,8 +1,8 @@
 ##
 # The TimedStack manages a pool of homogeneous connections (or any resource
-# you wish to manage).  Connections are created lazily up to a given maximum
+# you wish to manage). Connections are created lazily up to a given maximum
 # number.
-
+#
 # Examples:
 #
 #    ts = TimedStack.new(1) { MyConnection.new }
@@ -16,14 +16,12 @@
 #    conn = ts.pop
 #    ts.pop timeout: 5
 #    #=> raises Bundler::ConnectionPool::TimeoutError after 5 seconds
-
 class Bundler::ConnectionPool::TimedStack
   attr_reader :max
 
   ##
   # Creates a new pool with +size+ connections that are created from the given
   # +block+.
-
   def initialize(size = 0, &block)
     @create_block = block
     @created = 0
@@ -35,12 +33,12 @@ class Bundler::ConnectionPool::TimedStack
   end
 
   ##
-  # Returns +obj+ to the stack.  +options+ is ignored in TimedStack but may be
+  # Returns +obj+ to the stack. +options+ is ignored in TimedStack but may be
   # used by subclasses that extend TimedStack.
-
   def push(obj, options = {})
     @mutex.synchronize do
       if @shutdown_block
+        @created -= 1 unless @created == 0
         @shutdown_block.call(obj)
       else
         store_connection obj, options
@@ -52,14 +50,16 @@ class Bundler::ConnectionPool::TimedStack
   alias_method :<<, :push
 
   ##
-  # Retrieves a connection from the stack.  If a connection is available it is
-  # immediately returned.  If no connection is available within the given
+  # Retrieves a connection from the stack. If a connection is available it is
+  # immediately returned. If no connection is available within the given
   # timeout a Bundler::ConnectionPool::TimeoutError is raised.
   #
-  # +:timeout+ is the only checked entry in +options+ and is preferred over
-  # the +timeout+ argument (which will be removed in a future release).  Other
-  # options may be used by subclasses that extend TimedStack.
-
+  # @option options [Float] :timeout (0.5) Wait this many seconds for an available entry
+  # @option options [Class] :exception (Bundler::ConnectionPool::TimeoutError) Exception class to raise
+  #   if an entry was not available within the timeout period. Use `exception: false` to return nil.
+  #
+  # The +timeout+ argument will be removed in 3.0.
+  # Other options may be used by subclasses that extend TimedStack.
   def pop(timeout = 0.5, options = {})
     options, timeout = timeout, 0.5 if Hash === timeout
     timeout = options.fetch :timeout, timeout
@@ -68,13 +68,22 @@ class Bundler::ConnectionPool::TimedStack
     @mutex.synchronize do
       loop do
         raise Bundler::ConnectionPool::PoolShuttingDownError if @shutdown_block
-        return fetch_connection(options) if connection_stored?(options)
+        if (conn = try_fetch_connection(options))
+          return conn
+        end
 
         connection = try_create(options)
         return connection if connection
 
         to_wait = deadline - current_time
-        raise Bundler::ConnectionPool::TimeoutError, "Waited #{timeout} sec, #{length}/#{@max} available" if to_wait <= 0
+        if to_wait <= 0
+          exc = options.fetch(:exception, Bundler::ConnectionPool::TimeoutError)
+          if exc
+            raise Bundler::ConnectionPool::TimeoutError, "Waited #{timeout} sec, #{length}/#{@max} available"
+          else
+            return nil
+          end
+        end
         @resource.wait(@mutex, to_wait)
       end
     end
@@ -85,7 +94,6 @@ class Bundler::ConnectionPool::TimedStack
   # removing it from the pool. Attempting to checkout a connection after
   # shutdown will raise +Bundler::ConnectionPool::PoolShuttingDownError+ unless
   # +:reload+ is +true+.
-
   def shutdown(reload: false, &block)
     raise ArgumentError, "shutdown must receive a block" unless block
 
@@ -99,19 +107,49 @@ class Bundler::ConnectionPool::TimedStack
   end
 
   ##
-  # Returns +true+ if there are no available connections.
+  # Reaps connections that were checked in more than +idle_seconds+ ago.
+  def reap(idle_seconds, &block)
+    raise ArgumentError, "reap must receive a block" unless block
+    raise ArgumentError, "idle_seconds must be a number" unless idle_seconds.is_a?(Numeric)
+    raise Bundler::ConnectionPool::PoolShuttingDownError if @shutdown_block
+
+    idle.times do
+      conn =
+        @mutex.synchronize do
+          raise Bundler::ConnectionPool::PoolShuttingDownError if @shutdown_block
+
+          reserve_idle_connection(idle_seconds)
+        end
+      break unless conn
+
+      block.call(conn)
+    end
+  end
 
+  ##
+  # Returns +true+ if there are no available connections.
   def empty?
     (@created - @que.length) >= @max
   end
 
   ##
   # The number of connections available on the stack.
-
   def length
     @max - @created + @que.length
   end
 
+  ##
+  # The number of connections created and available on the stack.
+  def idle
+    @que.length
+  end
+
+  ##
+  # Reduce the created count
+  def decrement_created
+    @created -= 1 unless @created == 0
+  end
+
   private
 
   def current_time
@@ -121,8 +159,17 @@ class Bundler::ConnectionPool::TimedStack
   ##
   # This is an extension point for TimedStack and is called with a mutex.
   #
-  # This method must returns true if a connection is available on the stack.
+  # This method must returns a connection from the stack if one exists. Allows
+  # subclasses with expensive match/search algorithms to avoid double-handling
+  # their stack.
+  def try_fetch_connection(options = nil)
+    connection_stored?(options) && fetch_connection(options)
+  end
 
+  ##
+  # This is an extension point for TimedStack and is called with a mutex.
+  #
+  # This method must returns true if a connection is available on the stack.
   def connection_stored?(options = nil)
     !@que.empty?
   end
@@ -131,31 +178,48 @@ class Bundler::ConnectionPool::TimedStack
   # This is an extension point for TimedStack and is called with a mutex.
   #
   # This method must return a connection from the stack.
-
   def fetch_connection(options = nil)
-    @que.pop
+    @que.pop&.first
   end
 
   ##
   # This is an extension point for TimedStack and is called with a mutex.
   #
   # This method must shut down all connections on the stack.
-
   def shutdown_connections(options = nil)
-    while connection_stored?(options)
-      conn = fetch_connection(options)
+    while (conn = try_fetch_connection(options))
+      @created -= 1 unless @created == 0
       @shutdown_block.call(conn)
     end
-    @created = 0
   end
 
   ##
   # This is an extension point for TimedStack and is called with a mutex.
   #
-  # This method must return +obj+ to the stack.
+  # This method returns the oldest idle connection if it has been idle for more than idle_seconds.
+  # This requires that the stack is kept in order of checked in time (oldest first).
+  def reserve_idle_connection(idle_seconds)
+    return unless idle_connections?(idle_seconds)
+
+    @created -= 1 unless @created == 0
+
+    @que.shift.first
+  end
 
+  ##
+  # This is an extension point for TimedStack and is called with a mutex.
+  #
+  # Returns true if the first connection in the stack has been idle for more than idle_seconds
+  def idle_connections?(idle_seconds)
+    connection_stored? && (current_time - @que.first.last > idle_seconds)
+  end
+
+  ##
+  # This is an extension point for TimedStack and is called with a mutex.
+  #
+  # This method must return +obj+ to the stack.
   def store_connection(obj, options = nil)
-    @que.push obj
+    @que.push [obj, current_time]
   end
 
   ##
@@ -163,7 +227,6 @@ class Bundler::ConnectionPool::TimedStack
   #
   # This method must create a connection if and only if the total number of
   # connections allowed has not been met.
-
   def try_create(options = nil)
     unless @created == @max
       object = @create_block.call
diff --git a/lib/bundler/vendor/connection_pool/lib/connection_pool/version.rb b/lib/bundler/vendor/connection_pool/lib/connection_pool/version.rb
index 384d6fc977..2e9eebdbb6 100644
--- a/lib/bundler/vendor/connection_pool/lib/connection_pool/version.rb
+++ b/lib/bundler/vendor/connection_pool/lib/connection_pool/version.rb
@@ -1,3 +1,3 @@
 class Bundler::ConnectionPool
-  VERSION = "2.4.1"
+  VERSION = "2.5.5"
 end
diff --git a/lib/bundler/vendor/fileutils/.document b/lib/bundler/vendor/fileutils/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/fileutils/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/fileutils/lib/fileutils.rb b/lib/bundler/vendor/fileutils/lib/fileutils.rb
index 6db19caf6f..a11fdc7176 100644
--- a/lib/bundler/vendor/fileutils/lib/fileutils.rb
+++ b/lib/bundler/vendor/fileutils/lib/fileutils.rb
@@ -180,7 +180,8 @@ end
 # - {CVE-2004-0452}[https://cve.mitre.org/cgi-bin/cvename.cgi?name=CAN-2004-0452].
 #
 module Bundler::FileUtils
-  VERSION = "1.7.2"
+  # The version number.
+  VERSION = "1.8.0"
 
   def self.private_module_function(name)   #:nodoc:
     module_function name
@@ -705,11 +706,12 @@ module Bundler::FileUtils
   #
   def ln_s(src, dest, force: nil, relative: false, target_directory: true, noop: nil, verbose: nil)
     if relative
-      return ln_sr(src, dest, force: force, noop: noop, verbose: verbose)
+      return ln_sr(src, dest, force: force, target_directory: target_directory, noop: noop, verbose: verbose)
     end
-    fu_output_message "ln -s#{force ? 'f' : ''} #{[src,dest].flatten.join ' '}" if verbose
+    fu_output_message "ln -s#{force ? 'f' : ''}#{
+      target_directory ? '' : 'T'} #{[src,dest].flatten.join ' '}" if verbose
     return if noop
-    fu_each_src_dest0(src, dest) do |s,d|
+    fu_each_src_dest0(src, dest, target_directory) do |s,d|
       remove_file d, true if force
       File.symlink s, d
     end
@@ -729,42 +731,37 @@ module Bundler::FileUtils
   # Like Bundler::FileUtils.ln_s, but create links relative to +dest+.
   #
   def ln_sr(src, dest, target_directory: true, force: nil, noop: nil, verbose: nil)
-    options = "#{force ? 'f' : ''}#{target_directory ? '' : 'T'}"
-    dest = File.path(dest)
-    srcs = Array(src)
-    link = proc do |s, target_dir_p = true|
-      s = File.path(s)
-      if target_dir_p
-        d = File.join(destdirs = dest, File.basename(s))
+    cmd = "ln -s#{force ? 'f' : ''}#{target_directory ? '' : 'T'}" if verbose
+    fu_each_src_dest0(src, dest, target_directory) do |s,d|
+      if target_directory
+        parent = File.dirname(d)
+        destdirs = fu_split_path(parent)
+        real_ddirs = fu_split_path(File.realpath(parent))
       else
-        destdirs = File.dirname(d = dest)
+        destdirs ||= fu_split_path(dest)
+        real_ddirs ||= fu_split_path(File.realdirpath(dest))
       end
-      destdirs = fu_split_path(File.realpath(destdirs))
-      if fu_starting_path?(s)
-        srcdirs = fu_split_path((File.realdirpath(s) rescue File.expand_path(s)))
-        base = fu_relative_components_from(srcdirs, destdirs)
-        s = File.join(*base)
+      srcdirs = fu_split_path(s)
+      i = fu_common_components(srcdirs, destdirs)
+      n = destdirs.size - i
+      n -= 1 unless target_directory
+      link1 = fu_clean_components(*Array.new([n, 0].max, '..'), *srcdirs[i..-1])
+      begin
+        real_sdirs = fu_split_path(File.realdirpath(s)) rescue nil
+      rescue
       else
-        srcdirs = fu_clean_components(*fu_split_path(s))
-        base = fu_relative_components_from(fu_split_path(Dir.pwd), destdirs)
-        while srcdirs.first&. == ".." and base.last&.!=("..") and !fu_starting_path?(base.last)
-          srcdirs.shift
-          base.pop
-        end
-        s = File.join(*base, *srcdirs)
+        i = fu_common_components(real_sdirs, real_ddirs)
+        n = real_ddirs.size - i
+        n -= 1 unless target_directory
+        link2 = fu_clean_components(*Array.new([n, 0].max, '..'), *real_sdirs[i..-1])
+        link1 = link2 if link1.size > link2.size
       end
-      fu_output_message "ln -s#{options} #{s} #{d}" if verbose
+      s = File.join(link1)
+      fu_output_message [cmd, s, d].flatten.join(' ') if verbose
       next if noop
       remove_file d, true if force
       File.symlink s, d
     end
-    case srcs.size
-    when 0
-    when 1
-      link[srcs[0], target_directory && File.directory?(dest)]
-    else
-      srcs.each(&link)
-    end
   end
   module_function :ln_sr
 
@@ -799,13 +796,13 @@ module Bundler::FileUtils
   #   File.file?('dest1/dir1/t2.txt') # => true
   #   File.file?('dest1/dir1/t3.txt') # => true
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference_root: true</tt> - dereferences +src+ if it is a symbolic link.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before creating links.
+  # - +dereference_root+ - dereferences +src+ if it is a symbolic link (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before creating links (+false+ by default).
   #
   # Raises an exception if +dest+ is the path to an existing file or directory
-  # and keyword argument <tt>remove_destination: true</tt> is not given.
+  # and optional argument +remove_destination+ is not given.
   #
   # Related: Bundler::FileUtils.ln (has different options).
   #
@@ -1028,12 +1025,12 @@ module Bundler::FileUtils
   # directories, and symbolic links;
   # other file types (FIFO streams, device files, etc.) are not supported.
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference_root: true</tt> - if +src+ is a symbolic link,
-  #   follows the link.
-  # - <tt>preserve: true</tt> - preserves file times.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before copying files.
+  # - +dereference_root+ - if +src+ is a symbolic link,
+  #   follows the link (+false+ by default).
+  # - +preserve+ - preserves file times (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before copying files (+false+ by default).
   #
   # Related: {methods for copying}[rdoc-ref:FileUtils@Copying].
   #
@@ -1064,12 +1061,12 @@ module Bundler::FileUtils
   #   Bundler::FileUtils.copy_file('src0.txt', 'dest0.txt')
   #   File.file?('dest0.txt') # => true
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference: false</tt> - if +src+ is a symbolic link,
-  #   does not follow the link.
-  # - <tt>preserve: true</tt> - preserves file times.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before copying files.
+  # - +dereference+ - if +src+ is a symbolic link,
+  #   follows the link (+true+ by default).
+  # - +preserve+ - preserves file times (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before copying files (+false+ by default).
   #
   # Related: {methods for copying}[rdoc-ref:FileUtils@Copying].
   #
@@ -1490,7 +1487,8 @@ module Bundler::FileUtils
   # Related: {methods for deleting}[rdoc-ref:FileUtils@Deleting].
   #
   def remove_dir(path, force = false)
-    remove_entry path, force   # FIXME?? check if it is a directory
+    raise Errno::ENOTDIR, path unless force or File.directory?(path)
+    remove_entry path, force
   end
   module_function :remove_dir
 
@@ -1651,7 +1649,7 @@ module Bundler::FileUtils
       when "a"
         mask | 07777
       else
-        raise ArgumentError, "invalid `who' symbol in file mode: #{chr}"
+        raise ArgumentError, "invalid 'who' symbol in file mode: #{chr}"
       end
     end
   end
@@ -1705,7 +1703,7 @@ module Bundler::FileUtils
             copy_mask = user_mask(chr)
             (current_mode & copy_mask) / (copy_mask & 0111) * (user_mask & 0111)
           else
-            raise ArgumentError, "invalid `perm' symbol in file mode: #{chr}"
+            raise ArgumentError, "invalid 'perm' symbol in file mode: #{chr}"
           end
         end
 
@@ -2028,21 +2026,22 @@ module Bundler::FileUtils
 
   private
 
-  module StreamUtils_
+  module StreamUtils_ # :nodoc:
+
     private
 
     case (defined?(::RbConfig) ? ::RbConfig::CONFIG['host_os'] : ::RUBY_PLATFORM)
     when /mswin|mingw/
-      def fu_windows?; true end
+      def fu_windows?; true end #:nodoc:
     else
-      def fu_windows?; false end
+      def fu_windows?; false end #:nodoc:
     end
 
     def fu_copy_stream0(src, dest, blksize = nil)   #:nodoc:
       IO.copy_stream(src, dest)
     end
 
-    def fu_stream_blksize(*streams)
+    def fu_stream_blksize(*streams) #:nodoc:
       streams.each do |s|
         next unless s.respond_to?(:stat)
         size = fu_blksize(s.stat)
@@ -2051,14 +2050,14 @@ module Bundler::FileUtils
       fu_default_blksize()
     end
 
-    def fu_blksize(st)
+    def fu_blksize(st) #:nodoc:
       s = st.blksize
       return nil unless s
       return nil if s == 0
       s
     end
 
-    def fu_default_blksize
+    def fu_default_blksize #:nodoc:
       1024
     end
   end
@@ -2473,6 +2472,10 @@ module Bundler::FileUtils
 
   def fu_each_src_dest0(src, dest, target_directory = true)   #:nodoc:
     if tmp = Array.try_convert(src)
+      unless target_directory or tmp.size <= 1
+        tmp = tmp.map {|f| File.path(f)} # A workaround for RBS
+        raise ArgumentError, "extra target #{tmp}"
+      end
       tmp.each do |s|
         s = File.path(s)
         yield s, (target_directory ? File.join(dest, File.basename(s)) : dest)
@@ -2503,11 +2506,15 @@ module Bundler::FileUtils
   end
   private_module_function :fu_output_message
 
-  def fu_split_path(path)
+  def fu_split_path(path) #:nodoc:
     path = File.path(path)
     list = []
     until (parent, base = File.split(path); parent == path or parent == ".")
-      list << base
+      if base != '..' and list.last == '..' and !(fu_have_symlink? && File.symlink?(path))
+        list.pop
+      else
+        list << base
+      end
       path = parent
     end
     list << path
@@ -2515,16 +2522,16 @@ module Bundler::FileUtils
   end
   private_module_function :fu_split_path
 
-  def fu_relative_components_from(target, base) #:nodoc:
+  def fu_common_components(target, base) #:nodoc:
     i = 0
     while target[i]&.== base[i]
       i += 1
     end
-    Array.new(base.size-i, '..').concat(target[i..-1])
+    i
   end
-  private_module_function :fu_relative_components_from
+  private_module_function :fu_common_components
 
-  def fu_clean_components(*comp)
+  def fu_clean_components(*comp) #:nodoc:
     comp.shift while comp.first == "."
     return comp if comp.empty?
     clean = [comp.shift]
@@ -2532,7 +2539,7 @@ module Bundler::FileUtils
     while c = comp.shift
       if c == ".." and clean.last != ".." and !(fu_have_symlink? && File.symlink?(path))
         clean.pop
-        path.chomp!(%r((?<=\A|/)[^/]+/\z), "")
+        path.sub!(%r((?<=\A|/)[^/]+/\z), "")
       else
         clean << c
         path << c << "/"
@@ -2543,11 +2550,11 @@ module Bundler::FileUtils
   private_module_function :fu_clean_components
 
   if fu_windows?
-    def fu_starting_path?(path)
+    def fu_starting_path?(path) #:nodoc:
       path&.start_with?(%r(\w:|/))
     end
   else
-    def fu_starting_path?(path)
+    def fu_starting_path?(path) #:nodoc:
       path&.start_with?("/")
     end
   end
diff --git a/lib/bundler/vendor/net-http-persistent/.document b/lib/bundler/vendor/net-http-persistent/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/net-http-persistent/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent.rb b/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent.rb
index c15b346330..93e403a5bb 100644
--- a/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent.rb
+++ b/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent.rb
@@ -1,6 +1,10 @@
 require_relative '../../../../../vendored_net_http'
 require_relative '../../../../../vendored_uri'
-require 'cgi' # for escaping
+begin
+  require 'cgi/escape'
+rescue LoadError
+  require 'cgi/util' # for escaping
+end
 require_relative '../../../../connection_pool/lib/connection_pool'
 
 autoload :OpenSSL, 'openssl'
@@ -42,9 +46,8 @@ autoload :OpenSSL, 'openssl'
 #   # perform the POST, the Gem::URI is always required
 #   response http.request post_uri, post
 #
-# Note that for GET, HEAD and other requests that do not have a body you want
-# to use Gem::URI#request_uri not Gem::URI#path.  The request_uri contains the query
-# params which are sent in the body for other requests.
+# ⚠ Note that for GET, HEAD and other requests that do not have a body,
+# it uses Gem::URI#request_uri as default to send query params
 #
 # == TLS/SSL
 #
@@ -60,6 +63,7 @@ autoload :OpenSSL, 'openssl'
 # #ca_path            :: Directory with certificate-authorities
 # #cert_store         :: An SSL certificate store
 # #ciphers            :: List of SSl ciphers allowed
+# #extra_chain_cert   :: Extra certificates to be added to the certificate chain
 # #private_key        :: The client's SSL private key
 # #reuse_ssl_sessions :: Reuse a previously opened SSL session for a new
 #                        connection
@@ -68,6 +72,8 @@ autoload :OpenSSL, 'openssl'
 # #verify_callback    :: For server certificate verification
 # #verify_depth       :: Depth of certificate verification
 # #verify_mode        :: How connections should be verified
+# #verify_hostname    :: Use hostname verification for server certificate
+#                        during the handshake
 #
 # == Proxies
 #
@@ -174,7 +180,7 @@ class Gem::Net::HTTP::Persistent
   ##
   # The version of Gem::Net::HTTP::Persistent you are using
 
-  VERSION = '4.0.2'
+  VERSION = '4.0.6'
 
   ##
   # Error class for errors raised by Gem::Net::HTTP::Persistent.  Various
@@ -266,6 +272,11 @@ class Gem::Net::HTTP::Persistent
   attr_reader :ciphers
 
   ##
+  # Extra certificates to be added to the certificate chain
+
+  attr_reader :extra_chain_cert
+
+  ##
   # Sends debug_output to this IO via Gem::Net::HTTP#set_debug_output.
   #
   # Never use this method in production code, it causes a serious security
@@ -450,6 +461,21 @@ class Gem::Net::HTTP::Persistent
   attr_reader :verify_mode
 
   ##
+  # HTTPS verify_hostname.
+  #
+  # If a client sets this to true and enables SNI with SSLSocket#hostname=,
+  # the hostname verification on the server certificate is performed
+  # automatically during the handshake using
+  # OpenSSL::SSL.verify_certificate_identity().
+  #
+  # You can set +verify_hostname+ as true to use hostname verification
+  # during the handshake.
+  #
+  # NOTE: This works with Ruby > 3.0.
+
+  attr_reader :verify_hostname
+
+  ##
   # Creates a new Gem::Net::HTTP::Persistent.
   #
   # Set a +name+ for fun.  Your library name should be good enough, but this
@@ -508,6 +534,7 @@ class Gem::Net::HTTP::Persistent
     @verify_callback    = nil
     @verify_depth       = nil
     @verify_mode        = nil
+    @verify_hostname    = nil
     @cert_store         = nil
 
     @generation         = 0 # incremented when proxy Gem::URI changes
@@ -569,6 +596,21 @@ class Gem::Net::HTTP::Persistent
     reconnect_ssl
   end
 
+  if Gem::Net::HTTP.method_defined?(:extra_chain_cert=)
+    ##
+    # Extra certificates to be added to the certificate chain.
+    # It is only supported starting from Gem::Net::HTTP version 0.1.1
+    def extra_chain_cert= extra_chain_cert
+      @extra_chain_cert = extra_chain_cert
+
+      reconnect_ssl
+    end
+  else
+    def extra_chain_cert= _extra_chain_cert
+      raise "extra_chain_cert= is not supported by this version of Gem::Net::HTTP"
+    end
+  end
+
   ##
   # Creates a new connection for +uri+
 
@@ -587,37 +629,49 @@ class Gem::Net::HTTP::Persistent
 
     connection = @pool.checkout net_http_args
 
-    http = connection.http
+    begin
+      http = connection.http
 
-    connection.ressl @ssl_generation if
-      connection.ssl_generation != @ssl_generation
+      connection.ressl @ssl_generation if
+        connection.ssl_generation != @ssl_generation
 
-    if not http.started? then
-      ssl   http if use_ssl
-      start http
-    elsif expired? connection then
-      reset connection
-    end
-
-    http.keep_alive_timeout = @idle_timeout  if @idle_timeout
-    http.max_retries        = @max_retries   if http.respond_to?(:max_retries=)
-    http.read_timeout       = @read_timeout  if @read_timeout
-    http.write_timeout      = @write_timeout if
-      @write_timeout && http.respond_to?(:write_timeout=)
+      if not http.started? then
+        ssl   http if use_ssl
+        start http
+      elsif expired? connection then
+        reset connection
+      end
 
-    return yield connection
-  rescue Errno::ECONNREFUSED
-    address = http.proxy_address || http.address
-    port    = http.proxy_port    || http.port
+      http.keep_alive_timeout = @idle_timeout  if @idle_timeout
+      http.max_retries        = @max_retries   if http.respond_to?(:max_retries=)
+      http.read_timeout       = @read_timeout  if @read_timeout
+      http.write_timeout      = @write_timeout if
+        @write_timeout && http.respond_to?(:write_timeout=)
+
+      return yield connection
+    rescue Errno::ECONNREFUSED
+      if http.proxy?
+        address = http.proxy_address
+        port    = http.proxy_port
+      else
+        address = http.address
+        port    = http.port
+      end
 
-    raise Error, "connection refused: #{address}:#{port}"
-  rescue Errno::EHOSTDOWN
-    address = http.proxy_address || http.address
-    port    = http.proxy_port    || http.port
+      raise Error, "connection refused: #{address}:#{port}"
+    rescue Errno::EHOSTDOWN
+      if http.proxy?
+        address = http.proxy_address
+        port    = http.proxy_port
+      else
+        address = http.address
+        port    = http.port
+      end
 
-    raise Error, "host down: #{address}:#{port}"
-  ensure
-    @pool.checkin net_http_args
+      raise Error, "host down: #{address}:#{port}"
+    ensure
+      @pool.checkin net_http_args
+    end
   end
 
   ##
@@ -754,7 +808,7 @@ class Gem::Net::HTTP::Persistent
       @proxy_connection_id = [nil, *@proxy_args].join ':'
 
       if @proxy_uri.query then
-        @no_proxy = CGI.parse(@proxy_uri.query)['no_proxy'].join(',').downcase.split(',').map { |x| x.strip }.reject { |x| x.empty? }
+        @no_proxy = Gem::URI.decode_www_form(@proxy_uri.query).filter_map { |k, v| v if k == 'no_proxy' }.join(',').downcase.split(',').map { |x| x.strip }.reject { |x| x.empty? }
       end
     end
 
@@ -925,7 +979,8 @@ class Gem::Net::HTTP::Persistent
   end
 
   ##
-  # Shuts down all connections
+  # Shuts down all connections. Attempting to checkout a connection after
+  # shutdown will raise an error.
   #
   # *NOTE*: Calling shutdown for can be dangerous!
   #
@@ -937,6 +992,17 @@ class Gem::Net::HTTP::Persistent
   end
 
   ##
+  # Discard all existing connections. Subsequent checkouts will create
+  # new connections as needed.
+  #
+  # If any thread is still using a connection it may cause an error!  Call
+  # #reload when you are completely done making requests!
+
+  def reload
+    @pool.reload { |http| http.finish }
+  end
+
+  ##
   # Enables SSL on +connection+
 
   def ssl connection
@@ -948,8 +1014,10 @@ class Gem::Net::HTTP::Persistent
     connection.min_version = @min_version if @min_version
     connection.max_version = @max_version if @max_version
 
-    connection.verify_depth = @verify_depth
-    connection.verify_mode  = @verify_mode
+    connection.verify_depth    = @verify_depth
+    connection.verify_mode     = @verify_mode
+    connection.verify_hostname = @verify_hostname if
+      @verify_hostname != nil && connection.respond_to?(:verify_hostname=)
 
     if OpenSSL::SSL::VERIFY_PEER == OpenSSL::SSL::VERIFY_NONE and
        not Object.const_defined?(:I_KNOW_THAT_OPENSSL_VERIFY_PEER_EQUALS_VERIFY_NONE_IS_WRONG) then
@@ -991,6 +1059,10 @@ application:
       connection.key  = @private_key
     end
 
+    if defined?(@extra_chain_cert) and @extra_chain_cert
+      connection.extra_chain_cert = @extra_chain_cert
+    end
+
     connection.cert_store = if @cert_store then
                               @cert_store
                             else
@@ -1059,6 +1131,15 @@ application:
   end
 
   ##
+  # Sets the HTTPS verify_hostname.
+
+  def verify_hostname= verify_hostname
+    @verify_hostname = verify_hostname
+
+    reconnect_ssl
+  end
+
+  ##
   # SSL verification callback.
 
   def verify_callback= callback
@@ -1070,4 +1151,3 @@ end
 
 require_relative 'persistent/connection'
 require_relative 'persistent/pool'
-
diff --git a/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent/timed_stack_multi.rb b/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent/timed_stack_multi.rb
index 214804fcd9..034fbe39b8 100644
--- a/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent/timed_stack_multi.rb
+++ b/lib/bundler/vendor/net-http-persistent/lib/net/http/persistent/timed_stack_multi.rb
@@ -63,7 +63,8 @@ class Gem::Net::HTTP::Persistent::TimedStackMulti < Bundler::ConnectionPool::Tim
     if @created >= @max && @enqueued >= 1
       oldest, = @lru.first
       @lru.delete oldest
-      @ques[oldest].pop
+      connection = @ques[oldest].pop
+      connection.close if connection.respond_to?(:close)
 
       @created -= 1
     end
diff --git a/lib/bundler/vendor/pub_grub/.document b/lib/bundler/vendor/pub_grub/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/pub_grub/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/pub_grub/lib/pub_grub/basic_package_source.rb b/lib/bundler/vendor/pub_grub/lib/pub_grub/basic_package_source.rb
index dce20d37ad..491151ec0b 100644
--- a/lib/bundler/vendor/pub_grub/lib/pub_grub/basic_package_source.rb
+++ b/lib/bundler/vendor/pub_grub/lib/pub_grub/basic_package_source.rb
@@ -79,29 +79,17 @@ module Bundler::PubGrub
       dependencies_for(@root_package, @root_version)
     end
 
-    # Override me (maybe)
-    #
-    # If not overridden, the order returned by all_versions_for will be used
-    #
-    # Returns: Array of versions in preferred order
-    def sort_versions_by_preferred(package, sorted_versions)
-      indexes = @version_indexes[package]
-      sorted_versions.sort_by { |version| indexes[version] }
-    end
-
     def initialize
       @root_package = Package.root
       @root_version = Package.root_version
 
-      @cached_versions = Hash.new do |h,k|
+      @sorted_versions = Hash.new do |h,k|
         if k == @root_package
           h[k] = [@root_version]
         else
-          h[k] = all_versions_for(k)
+          h[k] = all_versions_for(k).sort
         end
       end
-      @sorted_versions = Hash.new { |h,k| h[k] = @cached_versions[k].sort }
-      @version_indexes = Hash.new { |h,k| h[k] = @cached_versions[k].each.with_index.to_h }
 
       @cached_dependencies = Hash.new do |packages, package|
         if package == @root_package
@@ -117,15 +105,7 @@ module Bundler::PubGrub
     end
 
     def versions_for(package, range=VersionRange.any)
-      versions = range.select_versions(@sorted_versions[package])
-
-      # Conditional avoids (among other things) calling
-      # sort_versions_by_preferred with the root package
-      if versions.size > 1
-        sort_versions_by_preferred(package, versions)
-      else
-        versions
-      end
+      range.select_versions(@sorted_versions[package])
     end
 
     def no_versions_incompatibility_for(_package, unsatisfied_term)
@@ -164,7 +144,7 @@ module Bundler::PubGrub
             sorted_versions[high]
           end
 
-        range = VersionRange.new(min: low, max: high, include_min: true)
+        range = VersionRange.new(min: low, max: high, include_min: !low.nil?)
 
         self_constraint = VersionConstraint.new(package, range: range)
 
diff --git a/lib/bundler/vendor/pub_grub/lib/pub_grub/strategy.rb b/lib/bundler/vendor/pub_grub/lib/pub_grub/strategy.rb
new file mode 100644
index 0000000000..6955655ba4
--- /dev/null
+++ b/lib/bundler/vendor/pub_grub/lib/pub_grub/strategy.rb
@@ -0,0 +1,42 @@
+module Bundler::PubGrub
+  class Strategy
+    def initialize(source)
+      @source = source
+
+      @root_package = Package.root
+      @root_version = Package.root_version
+
+      @version_indexes = Hash.new do |h,k|
+        if k == @root_package
+          h[k] = { @root_version => 0 }
+        else
+          h[k] = @source.all_versions_for(k).each.with_index.to_h
+        end
+      end
+    end
+
+    def next_package_and_version(unsatisfied)
+      package, range = next_term_to_try_from(unsatisfied)
+
+      [package, most_preferred_version_of(package, range)]
+    end
+
+    private
+
+    def most_preferred_version_of(package, range)
+      versions = @source.versions_for(package, range)
+
+      indexes = @version_indexes[package]
+      versions.min_by { |version| indexes[version] }
+    end
+
+    def next_term_to_try_from(unsatisfied)
+      unsatisfied.min_by do |package, range|
+        matching_versions = @source.versions_for(package, range)
+        higher_versions = @source.versions_for(package, range.upper_invert)
+
+        [matching_versions.count <= 1 ? 0 : 1, higher_versions.count]
+      end
+    end
+  end
+end
diff --git a/lib/bundler/vendor/pub_grub/lib/pub_grub/version_range.rb b/lib/bundler/vendor/pub_grub/lib/pub_grub/version_range.rb
index 8d73c3f7b5..49dcf716a3 100644
--- a/lib/bundler/vendor/pub_grub/lib/pub_grub/version_range.rb
+++ b/lib/bundler/vendor/pub_grub/lib/pub_grub/version_range.rb
@@ -76,6 +76,9 @@ module Bundler::PubGrub
     end
 
     def initialize(min: nil, max: nil, include_min: false, include_max: false, name: nil)
+      raise ArgumentError, "Ranges without a lower bound cannot have include_min == true" if !min && include_min == true
+      raise ArgumentError, "Ranges without an upper bound cannot have include_max == true" if !max && include_max == true
+
       @min = min
       @max = max
       @include_min = include_min
@@ -311,10 +314,19 @@ module Bundler::PubGrub
 
     def contiguous_to?(other)
       return false if other.empty?
+      return true if any?
+
+      intersects?(other) || contiguous_below?(other) || contiguous_above?(other)
+    end
+
+    def contiguous_below?(other)
+      return false if !max || !other.min
+
+      max == other.min && (include_max || other.include_min)
+    end
 
-      intersects?(other) ||
-        (min == other.max && (include_min || other.include_max)) ||
-        (max == other.min && (include_max || other.include_min))
+    def contiguous_above?(other)
+      other.contiguous_below?(self)
     end
 
     def allows_all?(other)
@@ -375,15 +387,15 @@ module Bundler::PubGrub
     def invert
       return self.class.empty if any?
 
-      low = VersionRange.new(max: min, include_max: !include_min)
-      high = VersionRange.new(min: max, include_min: !include_max)
+      low = -> { VersionRange.new(max: min, include_max: !include_min) }
+      high = -> { VersionRange.new(min: max, include_min: !include_max) }
 
       if !min
-        high
+        high.call
       elsif !max
-        low
+        low.call
       else
-        low.union(high)
+        low.call.union(high.call)
       end
     end
 
diff --git a/lib/bundler/vendor/pub_grub/lib/pub_grub/version_solver.rb b/lib/bundler/vendor/pub_grub/lib/pub_grub/version_solver.rb
index 4caf6b355b..000923e99a 100644
--- a/lib/bundler/vendor/pub_grub/lib/pub_grub/version_solver.rb
+++ b/lib/bundler/vendor/pub_grub/lib/pub_grub/version_solver.rb
@@ -2,17 +2,20 @@ require_relative 'partial_solution'
 require_relative 'term'
 require_relative 'incompatibility'
 require_relative 'solve_failure'
+require_relative 'strategy'
 
 module Bundler::PubGrub
   class VersionSolver
     attr_reader :logger
     attr_reader :source
     attr_reader :solution
+    attr_reader :strategy
 
-    def initialize(source:, root: Package.root, logger: Bundler::PubGrub.logger)
+    def initialize(source:, root: Package.root, strategy: Strategy.new(source), logger: Bundler::PubGrub.logger)
       @logger = logger
 
       @source = source
+      @strategy = strategy
 
       # { package => [incompatibility, ...]}
       @incompatibilities = Hash.new do |h, k|
@@ -36,26 +39,25 @@ module Bundler::PubGrub
 
     # Returns true if there is more work to be done, false otherwise
     def work
-      return false if solved?
-
-      next_package = choose_package_version
-      propagate(next_package)
-
-      if solved?
+      unsatisfied_terms = solution.unsatisfied
+      if unsatisfied_terms.empty?
         logger.info { "Solution found after #{solution.attempted_solutions} attempts:" }
         solution.decisions.each do |package, version|
           next if Package.root?(package)
           logger.info { "* #{package} #{version}" }
         end
 
-        false
-      else
-        true
+        return false
       end
+
+      next_package = choose_package_version_from(unsatisfied_terms)
+      propagate(next_package)
+
+      true
     end
 
     def solve
-      work until solved?
+      while work; end
 
       solution.decisions
     end
@@ -105,29 +107,15 @@ module Bundler::PubGrub
       unsatisfied.package
     end
 
-    def next_package_to_try
-      solution.unsatisfied.min_by do |term|
-        package = term.package
-        range = term.constraint.range
-        matching_versions = source.versions_for(package, range)
-        higher_versions = source.versions_for(package, range.upper_invert)
+    def choose_package_version_from(unsatisfied_terms)
+      remaining = unsatisfied_terms.map { |t| [t.package, t.constraint.range] }.to_h
 
-        [matching_versions.count <= 1 ? 0 : 1, higher_versions.count]
-      end.package
-    end
-
-    def choose_package_version
-      if solution.unsatisfied.empty?
-        logger.info "No packages unsatisfied. Solving complete!"
-        return nil
-      end
+      package, version = strategy.next_package_and_version(remaining)
 
-      package = next_package_to_try
-      unsatisfied_term = solution.unsatisfied.find { |t| t.package == package }
-      version = source.versions_for(package, unsatisfied_term.constraint.range).first
       logger.debug { "attempting #{package} #{version}" }
 
       if version.nil?
+        unsatisfied_term = unsatisfied_terms.find { |t| t.package == package }
         add_incompatibility source.no_versions_incompatibility_for(package, unsatisfied_term)
         return package
       end
diff --git a/lib/bundler/vendor/securerandom/lib/securerandom.rb b/lib/bundler/vendor/securerandom/lib/securerandom.rb
new file mode 100644
index 0000000000..01b7fa15a6
--- /dev/null
+++ b/lib/bundler/vendor/securerandom/lib/securerandom.rb
@@ -0,0 +1,102 @@
+# -*- coding: us-ascii -*-
+# frozen_string_literal: true
+
+require 'random/formatter'
+
+# == Secure random number generator interface.
+#
+# This library is an interface to secure random number generators which are
+# suitable for generating session keys in HTTP cookies, etc.
+#
+# You can use this library in your application by requiring it:
+#
+#   require 'bundler/vendor/securerandom/lib/securerandom'
+#
+# It supports the following secure random number generators:
+#
+# * openssl
+# * /dev/urandom
+# * Win32
+#
+# Bundler::SecureRandom is extended by the Random::Formatter module which
+# defines the following methods:
+#
+# * alphanumeric
+# * base64
+# * choose
+# * gen_random
+# * hex
+# * rand
+# * random_bytes
+# * random_number
+# * urlsafe_base64
+# * uuid
+#
+# These methods are usable as class methods of Bundler::SecureRandom such as
+# +Bundler::SecureRandom.hex+.
+#
+# If a secure random number generator is not available,
+# +NotImplementedError+ is raised.
+
+module Bundler::SecureRandom
+
+  # The version
+  VERSION = "0.4.1"
+
+  class << self
+    # Returns a random binary string containing +size+ bytes.
+    #
+    # See Random.bytes
+    def bytes(n)
+      return gen_random(n)
+    end
+
+    # Compatibility methods for Ruby 3.2, we can remove this after dropping to support Ruby 3.2
+    def alphanumeric(n = nil, chars: ALPHANUMERIC)
+      n = 16 if n.nil?
+      choose(chars, n)
+    end if RUBY_VERSION < '3.3'
+
+    private
+
+    # :stopdoc:
+
+    # Implementation using OpenSSL
+    def gen_random_openssl(n)
+      return OpenSSL::Random.random_bytes(n)
+    end
+
+    # Implementation using system random device
+    def gen_random_urandom(n)
+      ret = Random.urandom(n)
+      unless ret
+        raise NotImplementedError, "No random device"
+      end
+      unless ret.length == n
+        raise NotImplementedError, "Unexpected partial read from random device: only #{ret.length} for #{n} bytes"
+      end
+      ret
+    end
+
+    begin
+      # Check if Random.urandom is available
+      Random.urandom(1)
+      alias gen_random gen_random_urandom
+    rescue RuntimeError
+      begin
+        require 'openssl'
+      rescue NoMethodError
+        raise NotImplementedError, "No random device"
+      else
+        alias gen_random gen_random_openssl
+      end
+    end
+
+    # :startdoc:
+
+    # Generate random data bytes for Random::Formatter
+    public :gen_random
+  end
+end
+
+Bundler::SecureRandom.extend(Random::Formatter)
diff --git a/lib/bundler/vendor/thor/.document b/lib/bundler/vendor/thor/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/thor/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/thor/lib/thor.rb b/lib/bundler/vendor/thor/lib/thor.rb
index 627722164f..945bdbd551 100644
--- a/lib/bundler/vendor/thor/lib/thor.rb
+++ b/lib/bundler/vendor/thor/lib/thor.rb
@@ -439,6 +439,17 @@ class Bundler::Thor
       command && disable_required_check.include?(command.name.to_sym)
     end
 
+    # Checks if a specified command exists.
+    #
+    # ==== Parameters
+    # command_name<String>:: The name of the command to check for existence.
+    #
+    # ==== Returns
+    # Boolean:: +true+ if the command exists, +false+ otherwise.
+    def command_exists?(command_name) #:nodoc:
+      commands.keys.include?(normalize_command_name(command_name))
+    end
+
   protected
 
     # Returns this class exclusive options array set.
@@ -614,7 +625,7 @@ class Bundler::Thor
     # alias name.
     def find_command_possibilities(meth)
       len = meth.to_s.length
-      possibilities = all_commands.merge(map).keys.select { |n| meth == n[0, len] }.sort
+      possibilities = all_commands.reject { |_k, c| c.hidden? }.merge(map).keys.select { |n| meth == n[0, len] }.sort
       unique_possibilities = possibilities.map { |k| map[k] || k }.uniq
 
       if possibilities.include?(meth)
diff --git a/lib/bundler/vendor/thor/lib/thor/actions/file_manipulation.rb b/lib/bundler/vendor/thor/lib/thor/actions/file_manipulation.rb
index 80a0255996..d8c9863054 100644
--- a/lib/bundler/vendor/thor/lib/thor/actions/file_manipulation.rb
+++ b/lib/bundler/vendor/thor/lib/thor/actions/file_manipulation.rb
@@ -10,7 +10,6 @@ class Bundler::Thor
     # destination<String>:: the relative path to the destination root.
     # config<Hash>:: give :verbose => false to not log the status, and
     #                :mode => :preserve, to preserve the file mode from the source.
-
     #
     # ==== Examples
     #
@@ -243,6 +242,35 @@ class Bundler::Thor
       insert_into_file(path, *(args << config), &block)
     end
 
+    # Run a regular expression replacement on a file, raising an error if the
+    # contents of the file are not changed.
+    #
+    # ==== Parameters
+    # path<String>:: path of the file to be changed
+    # flag<Regexp|String>:: the regexp or string to be replaced
+    # replacement<String>:: the replacement, can be also given as a block
+    # config<Hash>:: give :verbose => false to not log the status, and
+    #                :force => true, to force the replacement regardless of runner behavior.
+    #
+    # ==== Example
+    #
+    #   gsub_file! 'app/controllers/application_controller.rb', /#\s*(filter_parameter_logging :password)/, '\1'
+    #
+    #   gsub_file! 'README', /rake/, :green do |match|
+    #     match << " no more. Use thor!"
+    #   end
+    #
+    def gsub_file!(path, flag, *args, &block)
+      config = args.last.is_a?(Hash) ? args.pop : {}
+
+      return unless behavior == :invoke || config.fetch(:force, false)
+
+      path = File.expand_path(path, destination_root)
+      say_status :gsub, relative_to_original_destination_root(path), config.fetch(:verbose, true)
+
+      actually_gsub_file(path, flag, args, true, &block) unless options[:pretend]
+    end
+
     # Run a regular expression replacement on a file.
     #
     # ==== Parameters
@@ -268,16 +296,11 @@ class Bundler::Thor
       path = File.expand_path(path, destination_root)
       say_status :gsub, relative_to_original_destination_root(path), config.fetch(:verbose, true)
 
-      unless options[:pretend]
-        content = File.binread(path)
-        content.gsub!(flag, *args, &block)
-        File.open(path, "wb") { |file| file.write(content) }
-      end
+      actually_gsub_file(path, flag, args, false, &block) unless options[:pretend]
     end
 
-    # Uncomment all lines matching a given regex.  It will leave the space
-    # which existed before the comment hash in tact but will remove any spacing
-    # between the comment hash and the beginning of the line.
+    # Uncomment all lines matching a given regex. Preserves indentation before
+    # the comment hash and removes the hash and any immediate following space.
     #
     # ==== Parameters
     # path<String>:: path of the file to be changed
@@ -291,7 +314,7 @@ class Bundler::Thor
     def uncomment_lines(path, flag, *args)
       flag = flag.respond_to?(:source) ? flag.source : flag
 
-      gsub_file(path, /^(\s*)#[[:blank:]]*(.*#{flag})/, '\1\2', *args)
+      gsub_file(path, /^(\s*)#[[:blank:]]?(.*#{flag})/, '\1\2', *args)
     end
 
     # Comment all lines matching a given regex.  It will leave the space
@@ -350,7 +373,7 @@ class Bundler::Thor
     end
 
     def with_output_buffer(buf = "".dup) #:nodoc:
-      raise ArgumentError, "Buffer can not be a frozen object" if buf.frozen?
+      raise ArgumentError, "Buffer cannot be a frozen object" if buf.frozen?
       old_buffer = output_buffer
       self.output_buffer = buf
       yield
@@ -359,6 +382,17 @@ class Bundler::Thor
       self.output_buffer = old_buffer
     end
 
+    def actually_gsub_file(path, flag, args, error_on_no_change, &block)
+      content = File.binread(path)
+      success = content.gsub!(flag, *args, &block)
+
+      if success.nil? && error_on_no_change
+        raise Bundler::Thor::Error, "The content of #{path} did not change"
+      end
+
+      File.open(path, "wb") { |file| file.write(content) }
+    end
+
     # Bundler::Thor::Actions#capture depends on what kind of buffer is used in ERB.
     # Thus CapturableERB fixes ERB to use String buffer.
     class CapturableERB < ERB
diff --git a/lib/bundler/vendor/thor/lib/thor/group.rb b/lib/bundler/vendor/thor/lib/thor/group.rb
index 7ea11e8f93..30bc311294 100644
--- a/lib/bundler/vendor/thor/lib/thor/group.rb
+++ b/lib/bundler/vendor/thor/lib/thor/group.rb
@@ -211,6 +211,17 @@ class Bundler::Thor::Group
       raise error, msg
     end
 
+    # Checks if a specified command exists.
+    #
+    # ==== Parameters
+    # command_name<String>:: The name of the command to check for existence.
+    #
+    # ==== Returns
+    # Boolean:: +true+ if the command exists, +false+ otherwise.
+    def command_exists?(command_name) #:nodoc:
+      commands.keys.include?(command_name)
+    end
+
   protected
 
     # The method responsible for dispatching given the args.
diff --git a/lib/bundler/vendor/thor/lib/thor/parser/argument.rb b/lib/bundler/vendor/thor/lib/thor/parser/argument.rb
index b9e94e4669..ee9db4ad8a 100644
--- a/lib/bundler/vendor/thor/lib/thor/parser/argument.rb
+++ b/lib/bundler/vendor/thor/lib/thor/parser/argument.rb
@@ -26,10 +26,7 @@ class Bundler::Thor
 
     def print_default
       if @type == :array and @default.is_a?(Array)
-        @default.map { |x|
-          p = x.gsub('"','\\"')
-          "\"#{p}\""
-        }.join(" ")
+        @default.map(&:dump).join(" ")
       else
         @default
       end
diff --git a/lib/bundler/vendor/thor/lib/thor/parser/option.rb b/lib/bundler/vendor/thor/lib/thor/parser/option.rb
index c6af4e1e87..72617c7e34 100644
--- a/lib/bundler/vendor/thor/lib/thor/parser/option.rb
+++ b/lib/bundler/vendor/thor/lib/thor/parser/option.rb
@@ -89,8 +89,8 @@ class Bundler::Thor
 
       sample = "[#{sample}]".dup unless required?
 
-      if boolean?
-        sample << ", [#{dasherize('no-' + human_name)}]" unless (name == "force") || name.match(/\Ano[\-_]/)
+      if boolean? && name != "force" && !name.match(/\A(no|skip)[\-_]/)
+        sample << ", [#{dasherize('no-' + human_name)}], [#{dasherize('skip-' + human_name)}]"
       end
 
       aliases_for_usage.ljust(padding) + sample
diff --git a/lib/bundler/vendor/thor/lib/thor/parser/options.rb b/lib/bundler/vendor/thor/lib/thor/parser/options.rb
index 978e76b132..fe22d989e5 100644
--- a/lib/bundler/vendor/thor/lib/thor/parser/options.rb
+++ b/lib/bundler/vendor/thor/lib/thor/parser/options.rb
@@ -144,7 +144,7 @@ class Bundler::Thor
     def check_exclusive!
       opts = @assigns.keys
       # When option A and B are exclusive, if A and B are given at the same time,
-      # the diffrence of argument array size will decrease.
+      # the difference of argument array size will decrease.
       found = @exclusives.find{ |ex| (ex - opts).size < ex.size - 1 }
       if found
         names = names_to_switch_names(found & opts).map{|n| "'#{n}'"}
@@ -250,7 +250,8 @@ class Bundler::Thor
       @parsing_options
     end
 
-    # Parse boolean values which can be given as --foo=true, --foo or --no-foo.
+    # Parse boolean values which can be given as --foo=true or --foo for true values, or
+    # --foo=false, --no-foo or --skip-foo for false values.
     #
     def parse_boolean(switch)
       if current_is_value?
diff --git a/lib/bundler/vendor/thor/lib/thor/runner.rb b/lib/bundler/vendor/thor/lib/thor/runner.rb
index c7cc873131..f0ce6df96c 100644
--- a/lib/bundler/vendor/thor/lib/thor/runner.rb
+++ b/lib/bundler/vendor/thor/lib/thor/runner.rb
@@ -1,9 +1,8 @@
 require_relative "../thor"
 require_relative "group"
 
-require "yaml"
 require "digest/sha2"
-require "pathname"
+require "pathname" unless defined?(Pathname)
 
 class Bundler::Thor::Runner < Bundler::Thor #:nodoc:
   map "-T" => :list, "-i" => :install, "-u" => :update, "-v" => :version
@@ -195,6 +194,7 @@ private
   def thor_yaml
     @thor_yaml ||= begin
       yaml_file = File.join(thor_root, "thor.yml")
+      require "yaml"
       yaml = YAML.load_file(yaml_file) if File.exist?(yaml_file)
       yaml || {}
     end
diff --git a/lib/bundler/vendor/thor/lib/thor/shell/basic.rb b/lib/bundler/vendor/thor/lib/thor/shell/basic.rb
index dc3179e5f3..da02b94227 100644
--- a/lib/bundler/vendor/thor/lib/thor/shell/basic.rb
+++ b/lib/bundler/vendor/thor/lib/thor/shell/basic.rb
@@ -67,15 +67,15 @@ class Bundler::Thor
       # Readline.
       #
       # ==== Example
-      # ask("What is your name?")
+      #   ask("What is your name?")
       #
-      # ask("What is the planet furthest from the sun?", :default => "Pluto")
+      #   ask("What is the planet furthest from the sun?", :default => "Neptune")
       #
-      # ask("What is your favorite Neopolitan flavor?", :limited_to => ["strawberry", "chocolate", "vanilla"])
+      #   ask("What is your favorite Neopolitan flavor?", :limited_to => ["strawberry", "chocolate", "vanilla"])
       #
-      # ask("What is your password?", :echo => false)
+      #   ask("What is your password?", :echo => false)
       #
-      # ask("Where should the file be saved?", :path => true)
+      #   ask("Where should the file be saved?", :path => true)
       #
       def ask(statement, *args)
         options = args.last.is_a?(Hash) ? args.pop : {}
@@ -93,7 +93,7 @@ class Bundler::Thor
       # are passed straight to puts (behavior got from Highline).
       #
       # ==== Example
-      # say("I know you knew that.")
+      #   say("I know you knew that.")
       #
       def say(message = "", color = nil, force_new_line = (message.to_s !~ /( |\t)\Z/))
         return if quiet?
@@ -110,7 +110,7 @@ class Bundler::Thor
       # are passed straight to puts (behavior got from Highline).
       #
       # ==== Example
-      # say_error("error: something went wrong")
+      #   say_error("error: something went wrong")
       #
       def say_error(message = "", color = nil, force_new_line = (message.to_s !~ /( |\t)\Z/))
         return if quiet?
@@ -143,14 +143,14 @@ class Bundler::Thor
         stdout.flush
       end
 
-      # Make a question the to user and returns true if the user replies "y" or
+      # Asks the user a question and returns true if the user replies "y" or
       # "yes".
       #
       def yes?(statement, color = nil)
         !!(ask(statement, color, add_to_history: false) =~ is?(:yes))
       end
 
-      # Make a question the to user and returns true if the user replies "n" or
+      # Asks the user a question and returns true if the user replies "n" or
       # "no".
       #
       def no?(statement, color = nil)
@@ -314,7 +314,7 @@ class Bundler::Thor
         diff_cmd = ENV["THOR_DIFF"] || ENV["RAILS_DIFF"] || "diff -u"
 
         require "tempfile"
-        Tempfile.open(File.basename(destination), File.dirname(destination)) do |temp|
+        Tempfile.open(File.basename(destination), File.dirname(destination), binmode: true) do |temp|
           temp.write content
           temp.rewind
           system %(#{diff_cmd} "#{destination}" "#{temp.path}")
@@ -372,16 +372,12 @@ class Bundler::Thor
         Tempfile.open([File.basename(destination), File.extname(destination)], File.dirname(destination)) do |temp|
           temp.write content
           temp.rewind
-          system %(#{merge_tool} "#{temp.path}" "#{destination}")
+          system(merge_tool, temp.path, destination)
         end
       end
 
       def merge_tool #:nodoc:
-        @merge_tool ||= ENV["THOR_MERGE"] || git_merge_tool
-      end
-
-      def git_merge_tool #:nodoc:
-        `git config merge.tool`.rstrip rescue ""
+        @merge_tool ||= ENV["THOR_MERGE"] || "git difftool --no-index"
       end
     end
   end
diff --git a/lib/bundler/vendor/thor/lib/thor/shell/html.rb b/lib/bundler/vendor/thor/lib/thor/shell/html.rb
index 0277b882b7..a0a8520e5c 100644
--- a/lib/bundler/vendor/thor/lib/thor/shell/html.rb
+++ b/lib/bundler/vendor/thor/lib/thor/shell/html.rb
@@ -64,7 +64,7 @@ class Bundler::Thor
       # Ask something to the user and receives a response.
       #
       # ==== Example
-      # ask("What is your name?")
+      #   ask("What is your name?")
       #
       # TODO: Implement #ask for Bundler::Thor::Shell::HTML
       def ask(statement, color = nil)
diff --git a/lib/bundler/vendor/thor/lib/thor/shell/table_printer.rb b/lib/bundler/vendor/thor/lib/thor/shell/table_printer.rb
index 525f9ce5bb..dee3614753 100644
--- a/lib/bundler/vendor/thor/lib/thor/shell/table_printer.rb
+++ b/lib/bundler/vendor/thor/lib/thor/shell/table_printer.rb
@@ -102,33 +102,17 @@ class Bundler::Thor
 
       def truncate(string)
         return string unless @truncate
-        as_unicode do
-          chars = string.chars.to_a
-          if chars.length <= @truncate
-            chars.join
-          else
-            chars[0, @truncate - 3 - @indent].join + "..."
-          end
+        chars = string.chars.to_a
+        if chars.length <= @truncate
+          chars.join
+        else
+          chars[0, @truncate - 3 - @indent].join + "..."
         end
       end
 
       def indentation
         " " * @indent
       end
-
-      if "".respond_to?(:encode)
-        def as_unicode
-          yield
-        end
-      else
-        def as_unicode
-          old = $KCODE # rubocop:disable Style/GlobalVars
-          $KCODE = "U" # rubocop:disable Style/GlobalVars
-          yield
-        ensure
-          $KCODE = old # rubocop:disable Style/GlobalVars
-        end
-      end
     end
   end
 end
diff --git a/lib/bundler/vendor/thor/lib/thor/util.rb b/lib/bundler/vendor/thor/lib/thor/util.rb
index 68916daf2e..cd8f9ece87 100644
--- a/lib/bundler/vendor/thor/lib/thor/util.rb
+++ b/lib/bundler/vendor/thor/lib/thor/util.rb
@@ -133,7 +133,7 @@ class Bundler::Thor
           *pieces, command  = namespace.split(":")
           namespace = pieces.join(":")
           namespace = "default" if namespace.empty?
-          klass = Bundler::Thor::Base.subclasses.detect { |thor| thor.namespace == namespace && thor.commands.keys.include?(command) }
+          klass = Bundler::Thor::Base.subclasses.detect { |thor| thor.namespace == namespace && thor.command_exists?(command) }
         end
         unless klass # look for a Bundler::Thor::Group with the right name
           klass = Bundler::Thor::Util.find_by_namespace(namespace)
diff --git a/lib/bundler/vendor/thor/lib/thor/version.rb b/lib/bundler/vendor/thor/lib/thor/version.rb
index 1fb00017ed..5474a2f71b 100644
--- a/lib/bundler/vendor/thor/lib/thor/version.rb
+++ b/lib/bundler/vendor/thor/lib/thor/version.rb
@@ -1,3 +1,3 @@
 class Bundler::Thor
-  VERSION = "1.3.0"
+  VERSION = "1.4.0"
 end
diff --git a/lib/bundler/vendor/tsort/.document b/lib/bundler/vendor/tsort/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/tsort/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/uri/.document b/lib/bundler/vendor/uri/.document
deleted file mode 100644
index 0c43bbd6b3..0000000000
--- a/lib/bundler/vendor/uri/.document
+++ /dev/null
@@ -1 +0,0 @@
-# Vendored files do not need to be documented
diff --git a/lib/bundler/vendor/uri/lib/uri.rb b/lib/bundler/vendor/uri/lib/uri.rb
index 976320f6bd..57b380c480 100644
--- a/lib/bundler/vendor/uri/lib/uri.rb
+++ b/lib/bundler/vendor/uri/lib/uri.rb
@@ -1,6 +1,6 @@
 # frozen_string_literal: false
 # Bundler::URI is a module providing classes to handle Uniform Resource Identifiers
-# (RFC2396[http://tools.ietf.org/html/rfc2396]).
+# (RFC2396[https://www.rfc-editor.org/rfc/rfc2396]).
 #
 # == Features
 #
@@ -47,14 +47,14 @@
 # A good place to view an RFC spec is http://www.ietf.org/rfc.html.
 #
 # Here is a list of all related RFC's:
-# - RFC822[http://tools.ietf.org/html/rfc822]
-# - RFC1738[http://tools.ietf.org/html/rfc1738]
-# - RFC2255[http://tools.ietf.org/html/rfc2255]
-# - RFC2368[http://tools.ietf.org/html/rfc2368]
-# - RFC2373[http://tools.ietf.org/html/rfc2373]
-# - RFC2396[http://tools.ietf.org/html/rfc2396]
-# - RFC2732[http://tools.ietf.org/html/rfc2732]
-# - RFC3986[http://tools.ietf.org/html/rfc3986]
+# - RFC822[https://www.rfc-editor.org/rfc/rfc822]
+# - RFC1738[https://www.rfc-editor.org/rfc/rfc1738]
+# - RFC2255[https://www.rfc-editor.org/rfc/rfc2255]
+# - RFC2368[https://www.rfc-editor.org/rfc/rfc2368]
+# - RFC2373[https://www.rfc-editor.org/rfc/rfc2373]
+# - RFC2396[https://www.rfc-editor.org/rfc/rfc2396]
+# - RFC2732[https://www.rfc-editor.org/rfc/rfc2732]
+# - RFC3986[https://www.rfc-editor.org/rfc/rfc3986]
 #
 # == Class tree
 #
diff --git a/lib/bundler/vendor/uri/lib/uri/common.rb b/lib/bundler/vendor/uri/lib/uri/common.rb
index 93f4f226ad..38339119c5 100644
--- a/lib/bundler/vendor/uri/lib/uri/common.rb
+++ b/lib/bundler/vendor/uri/lib/uri/common.rb
@@ -13,24 +13,54 @@ require_relative "rfc2396_parser"
 require_relative "rfc3986_parser"
 
 module Bundler::URI
-  include RFC2396_REGEXP
+  # The default parser instance for RFC 2396.
+  RFC2396_PARSER = RFC2396_Parser.new
+  Ractor.make_shareable(RFC2396_PARSER) if defined?(Ractor)
 
-  REGEXP = RFC2396_REGEXP
-  Parser = RFC2396_Parser
+  # The default parser instance for RFC 3986.
   RFC3986_PARSER = RFC3986_Parser.new
   Ractor.make_shareable(RFC3986_PARSER) if defined?(Ractor)
 
-  # Bundler::URI::Parser.new
-  DEFAULT_PARSER = Parser.new
-  DEFAULT_PARSER.pattern.each_pair do |sym, str|
-    unless REGEXP::PATTERN.const_defined?(sym)
-      REGEXP::PATTERN.const_set(sym, str)
+  # The default parser instance.
+  DEFAULT_PARSER = RFC3986_PARSER
+  Ractor.make_shareable(DEFAULT_PARSER) if defined?(Ractor)
+
+  # Set the default parser instance.
+  def self.parser=(parser = RFC3986_PARSER)
+    remove_const(:Parser) if defined?(::Bundler::URI::Parser)
+    const_set("Parser", parser.class)
+
+    remove_const(:PARSER) if defined?(::Bundler::URI::PARSER)
+    const_set("PARSER", parser)
+
+    remove_const(:REGEXP) if defined?(::Bundler::URI::REGEXP)
+    remove_const(:PATTERN) if defined?(::Bundler::URI::PATTERN)
+    if Parser == RFC2396_Parser
+      const_set("REGEXP", Bundler::URI::RFC2396_REGEXP)
+      const_set("PATTERN", Bundler::URI::RFC2396_REGEXP::PATTERN)
+    end
+
+    Parser.new.regexp.each_pair do |sym, str|
+      remove_const(sym) if const_defined?(sym, false)
+      const_set(sym, str)
     end
   end
-  DEFAULT_PARSER.regexp.each_pair do |sym, str|
-    const_set(sym, str)
+  self.parser = RFC3986_PARSER
+
+  def self.const_missing(const) # :nodoc:
+    if const == :REGEXP
+      warn "Bundler::URI::REGEXP is obsolete. Use Bundler::URI::RFC2396_REGEXP explicitly.", uplevel: 1 if $VERBOSE
+      Bundler::URI::RFC2396_REGEXP
+    elsif value = RFC2396_PARSER.regexp[const]
+      warn "Bundler::URI::#{const} is obsolete. Use Bundler::URI::RFC2396_PARSER.regexp[#{const.inspect}] explicitly.", uplevel: 1 if $VERBOSE
+      value
+    elsif value = RFC2396_Parser.const_get(const)
+      warn "Bundler::URI::#{const} is obsolete. Use Bundler::URI::RFC2396_Parser::#{const} explicitly.", uplevel: 1 if $VERBOSE
+      value
+    else
+      super
+    end
   end
-  Ractor.make_shareable(DEFAULT_PARSER) if defined?(Ractor)
 
   module Util # :nodoc:
     def make_components_hash(klass, array_hash)
@@ -64,7 +94,41 @@ module Bundler::URI
     module_function :make_components_hash
   end
 
-  module Schemes
+  module Schemes # :nodoc:
+    class << self
+      ReservedChars = ".+-"
+      EscapedChars = "\u01C0\u01C1\u01C2"
+      # Use Lo category chars as escaped chars for TruffleRuby, which
+      # does not allow Symbol categories as identifiers.
+
+      def escape(name)
+        unless name and name.ascii_only?
+          return nil
+        end
+        name.upcase.tr(ReservedChars, EscapedChars)
+      end
+
+      def unescape(name)
+        name.tr(EscapedChars, ReservedChars).encode(Encoding::US_ASCII).upcase
+      end
+
+      def find(name)
+        const_get(name, false) if name and const_defined?(name, false)
+      end
+
+      def register(name, klass)
+        unless scheme = escape(name)
+          raise ArgumentError, "invalid character as scheme - #{name}"
+        end
+        const_set(scheme, klass)
+      end
+
+      def list
+        constants.map { |name|
+          [unescape(name.to_s), const_get(name)]
+        }.to_h
+      end
+    end
   end
   private_constant :Schemes
 
@@ -77,7 +141,7 @@ module Bundler::URI
   # Note that after calling String#upcase on +scheme+, it must be a valid
   # constant name.
   def self.register_scheme(scheme, klass)
-    Schemes.const_set(scheme.to_s.upcase, klass)
+    Schemes.register(scheme, klass)
   end
 
   # Returns a hash of the defined schemes:
@@ -95,14 +159,14 @@ module Bundler::URI
   #
   # Related: Bundler::URI.register_scheme.
   def self.scheme_list
-    Schemes.constants.map { |name|
-      [name.to_s.upcase, Schemes.const_get(name)]
-    }.to_h
+    Schemes.list
   end
 
+  # :stopdoc:
   INITIAL_SCHEMES = scheme_list
   private_constant :INITIAL_SCHEMES
   Ractor.make_shareable(INITIAL_SCHEMES) if defined?(Ractor)
+  # :startdoc:
 
   # Returns a new object constructed from the given +scheme+, +arguments+,
   # and +default+:
@@ -121,12 +185,10 @@ module Bundler::URI
   #   # => #<Bundler::URI::HTTP foo://john.doe@www.example.com:123/forum/questions/?tag=networking&order=newest#top>
   #
   def self.for(scheme, *arguments, default: Generic)
-    const_name = scheme.to_s.upcase
+    const_name = Schemes.escape(scheme)
 
     uri_class = INITIAL_SCHEMES[const_name]
-    uri_class ||= if /\A[A-Z]\w*\z/.match?(const_name) && Schemes.const_defined?(const_name, false)
-      Schemes.const_get(const_name, false)
-    end
+    uri_class ||= Schemes.find(const_name)
     uri_class ||= default
 
     return uri_class.new(scheme, *arguments)
@@ -168,7 +230,7 @@ module Bundler::URI
   #    ["fragment", "top"]]
   #
   def self.split(uri)
-    RFC3986_PARSER.split(uri)
+    PARSER.split(uri)
   end
 
   # Returns a new \Bundler::URI object constructed from the given string +uri+:
@@ -178,11 +240,11 @@ module Bundler::URI
   #   Bundler::URI.parse('http://john.doe@www.example.com:123/forum/questions/?tag=networking&order=newest#top')
   #   # => #<Bundler::URI::HTTP http://john.doe@www.example.com:123/forum/questions/?tag=networking&order=newest#top>
   #
-  # It's recommended to first ::escape string +uri+
+  # It's recommended to first Bundler::URI::RFC2396_PARSER.escape string +uri+
   # if it may contain invalid Bundler::URI characters.
   #
   def self.parse(uri)
-    RFC3986_PARSER.parse(uri)
+    PARSER.parse(uri)
   end
 
   # Merges the given Bundler::URI strings +str+
@@ -209,7 +271,7 @@ module Bundler::URI
   #   # => #<Bundler::URI::HTTP http://example.com/foo/bar>
   #
   def self.join(*str)
-    RFC3986_PARSER.join(*str)
+    DEFAULT_PARSER.join(*str)
   end
 
   #
@@ -238,7 +300,7 @@ module Bundler::URI
   #
   def self.extract(str, schemes = nil, &block) # :nodoc:
     warn "Bundler::URI.extract is obsolete", uplevel: 1 if $VERBOSE
-    DEFAULT_PARSER.extract(str, schemes, &block)
+    PARSER.extract(str, schemes, &block)
   end
 
   #
@@ -275,14 +337,14 @@ module Bundler::URI
   #
   def self.regexp(schemes = nil)# :nodoc:
     warn "Bundler::URI.regexp is obsolete", uplevel: 1 if $VERBOSE
-    DEFAULT_PARSER.make_regexp(schemes)
+    PARSER.make_regexp(schemes)
   end
 
   TBLENCWWWCOMP_ = {} # :nodoc:
   256.times do |i|
     TBLENCWWWCOMP_[-i.chr] = -('%%%02X' % i)
   end
-  TBLENCURICOMP_ = TBLENCWWWCOMP_.dup.freeze
+  TBLENCURICOMP_ = TBLENCWWWCOMP_.dup.freeze # :nodoc:
   TBLENCWWWCOMP_[' '] = '+'
   TBLENCWWWCOMP_.freeze
   TBLDECWWWCOMP_ = {} # :nodoc:
@@ -380,6 +442,8 @@ module Bundler::URI
     _decode_uri_component(/%\h\h/, str, enc)
   end
 
+  # Returns a string derived from the given string +str+ with
+  # Bundler::URI-encoded characters matching +regexp+ according to +table+.
   def self._encode_uri_component(regexp, table, str, enc)
     str = str.to_s.dup
     if str.encoding != Encoding::ASCII_8BIT
@@ -394,6 +458,8 @@ module Bundler::URI
   end
   private_class_method :_encode_uri_component
 
+  # Returns a string decoding characters matching +regexp+ from the
+  # given \URL-encoded string +str+.
   def self._decode_uri_component(regexp, str, enc)
     raise ArgumentError, "invalid %-encoding (#{str})" if /%(?!\h\h)/.match?(str)
     str.b.gsub(regexp, TBLDECWWWCOMP_).force_encoding(enc)
@@ -832,6 +898,7 @@ module Bundler
   # Returns a \Bundler::URI object derived from the given +uri+,
   # which may be a \Bundler::URI string or an existing \Bundler::URI object:
   #
+  #   require 'bundler/vendor/uri/lib/uri'
   #   # Returns a new Bundler::URI.
   #   uri = Bundler::URI('http://github.com/ruby/ruby')
   #   # => #<Bundler::URI::HTTP http://github.com/ruby/ruby>
@@ -839,6 +906,8 @@ module Bundler
   #   Bundler::URI(uri)
   #   # => #<Bundler::URI::HTTP http://github.com/ruby/ruby>
   #
+  # You must require 'bundler/vendor/uri/lib/uri' to use this method.
+  #
   def URI(uri)
     if uri.is_a?(Bundler::URI::Generic)
       uri
diff --git a/lib/bundler/vendor/uri/lib/uri/file.rb b/lib/bundler/vendor/uri/lib/uri/file.rb
index 8d75a9de7a..21dd9ee535 100644
--- a/lib/bundler/vendor/uri/lib/uri/file.rb
+++ b/lib/bundler/vendor/uri/lib/uri/file.rb
@@ -47,7 +47,7 @@ module Bundler::URI
     #       :path => '/ruby/src'})
     #     uri2.to_s  # => "file://host.example.com/ruby/src"
     #
-    #     uri3 = Bundler::URI::File.build({:path => Bundler::URI::escape('/path/my file.txt')})
+    #     uri3 = Bundler::URI::File.build({:path => Bundler::URI::RFC2396_PARSER.escape('/path/my file.txt')})
     #     uri3.to_s  # => "file:///path/my%20file.txt"
     #
     def self.build(args)
@@ -70,17 +70,17 @@ module Bundler::URI
 
     # raise InvalidURIError
     def check_userinfo(user)
-      raise Bundler::URI::InvalidURIError, "can not set userinfo for file Bundler::URI"
+      raise Bundler::URI::InvalidURIError, "cannot set userinfo for file Bundler::URI"
     end
 
     # raise InvalidURIError
     def check_user(user)
-      raise Bundler::URI::InvalidURIError, "can not set user for file Bundler::URI"
+      raise Bundler::URI::InvalidURIError, "cannot set user for file Bundler::URI"
     end
 
     # raise InvalidURIError
     def check_password(user)
-      raise Bundler::URI::InvalidURIError, "can not set password for file Bundler::URI"
+      raise Bundler::URI::InvalidURIError, "cannot set password for file Bundler::URI"
     end
 
     # do nothing
diff --git a/lib/bundler/vendor/uri/lib/uri/ftp.rb b/lib/bundler/vendor/uri/lib/uri/ftp.rb
index 48b4c6718d..f83985fd3d 100644
--- a/lib/bundler/vendor/uri/lib/uri/ftp.rb
+++ b/lib/bundler/vendor/uri/lib/uri/ftp.rb
@@ -17,7 +17,7 @@ module Bundler::URI
   # This class will be redesigned because of difference of implementations;
   # the structure of its path. draft-hoffman-ftp-uri-04 is a draft but it
   # is a good summary about the de facto spec.
-  # http://tools.ietf.org/html/draft-hoffman-ftp-uri-04
+  # https://datatracker.ietf.org/doc/html/draft-hoffman-ftp-uri-04
   #
   class FTP < Generic
     # A Default port of 21 for Bundler::URI::FTP.
diff --git a/lib/bundler/vendor/uri/lib/uri/generic.rb b/lib/bundler/vendor/uri/lib/uri/generic.rb
index 762c425ac1..30dab60903 100644
--- a/lib/bundler/vendor/uri/lib/uri/generic.rb
+++ b/lib/bundler/vendor/uri/lib/uri/generic.rb
@@ -73,7 +73,7 @@ module Bundler::URI
     #
     # At first, tries to create a new Bundler::URI::Generic instance using
     # Bundler::URI::Generic::build. But, if exception Bundler::URI::InvalidComponentError is raised,
-    # then it does Bundler::URI::Escape.escape all Bundler::URI components and tries again.
+    # then it does Bundler::URI::RFC2396_PARSER.escape all Bundler::URI components and tries again.
     #
     def self.build2(args)
       begin
@@ -82,7 +82,7 @@ module Bundler::URI
         if args.kind_of?(Array)
           return self.build(args.collect{|x|
             if x.is_a?(String)
-              DEFAULT_PARSER.escape(x)
+              Bundler::URI::RFC2396_PARSER.escape(x)
             else
               x
             end
@@ -91,7 +91,7 @@ module Bundler::URI
           tmp = {}
           args.each do |key, value|
             tmp[key] = if value
-                DEFAULT_PARSER.escape(value)
+                Bundler::URI::RFC2396_PARSER.escape(value)
               else
                 value
               end
@@ -126,9 +126,9 @@ module Bundler::URI
           end
         end
       else
-        component = self.class.component rescue ::Bundler::URI::Generic::COMPONENT
+        component = self.component rescue ::Bundler::URI::Generic::COMPONENT
         raise ArgumentError,
-        "expected Array of or Hash of components of #{self.class} (#{component.join(', ')})"
+              "expected Array of or Hash of components of #{self} (#{component.join(', ')})"
       end
 
       tmp << nil
@@ -186,18 +186,18 @@ module Bundler::URI
 
       if arg_check
         self.scheme = scheme
-        self.userinfo = userinfo
         self.hostname = host
         self.port = port
+        self.userinfo = userinfo
         self.path = path
         self.query = query
         self.opaque = opaque
         self.fragment = fragment
       else
         self.set_scheme(scheme)
-        self.set_userinfo(userinfo)
         self.set_host(host)
         self.set_port(port)
+        self.set_userinfo(userinfo)
         self.set_path(path)
         self.query = query
         self.set_opaque(opaque)
@@ -284,7 +284,7 @@ module Bundler::URI
 
     # Returns the parser to be used.
     #
-    # Unless a Bundler::URI::Parser is defined, DEFAULT_PARSER is used.
+    # Unless the +parser+ is defined, DEFAULT_PARSER is used.
     #
     def parser
       if !defined?(@parser) || !@parser
@@ -315,7 +315,7 @@ module Bundler::URI
     end
 
     #
-    # Checks the scheme +v+ component against the Bundler::URI::Parser Regexp for :SCHEME.
+    # Checks the scheme +v+ component against the +parser+ Regexp for :SCHEME.
     #
     def check_scheme(v)
       if v && parser.regexp[:SCHEME] !~ v
@@ -385,7 +385,7 @@ module Bundler::URI
 
     #
     # Checks the user +v+ component for RFC2396 compliance
-    # and against the Bundler::URI::Parser Regexp for :USERINFO.
+    # and against the +parser+ Regexp for :USERINFO.
     #
     # Can not have a registry or opaque component defined,
     # with a user component defined.
@@ -393,7 +393,7 @@ module Bundler::URI
     def check_user(v)
       if @opaque
         raise InvalidURIError,
-          "can not set user with opaque"
+          "cannot set user with opaque"
       end
 
       return v unless v
@@ -409,7 +409,7 @@ module Bundler::URI
 
     #
     # Checks the password +v+ component for RFC2396 compliance
-    # and against the Bundler::URI::Parser Regexp for :USERINFO.
+    # and against the +parser+ Regexp for :USERINFO.
     #
     # Can not have a registry or opaque component defined,
     # with a user component defined.
@@ -417,7 +417,7 @@ module Bundler::URI
     def check_password(v, user = @user)
       if @opaque
         raise InvalidURIError,
-          "can not set password with opaque"
+          "cannot set password with opaque"
       end
       return v unless v
 
@@ -511,7 +511,7 @@ module Bundler::URI
         user, password = split_userinfo(user)
       end
       @user     = user
-      @password = password if password
+      @password = password
 
       [@user, @password]
     end
@@ -522,7 +522,7 @@ module Bundler::URI
     # See also Bundler::URI::Generic.user=.
     #
     def set_user(v)
-      set_userinfo(v, @password)
+      set_userinfo(v, nil)
       v
     end
     protected :set_user
@@ -574,6 +574,12 @@ module Bundler::URI
       @password
     end
 
+    # Returns the authority info (array of user, password, host and
+    # port), if any is set.  Or returns +nil+.
+    def authority
+      return @user, @password, @host, @port if @user || @password || @host || @port
+    end
+
     # Returns the user component after Bundler::URI decoding.
     def decoded_user
       Bundler::URI.decode_uri_component(@user) if @user
@@ -586,7 +592,7 @@ module Bundler::URI
 
     #
     # Checks the host +v+ component for RFC2396 compliance
-    # and against the Bundler::URI::Parser Regexp for :HOST.
+    # and against the +parser+ Regexp for :HOST.
     #
     # Can not have a registry or opaque component defined,
     # with a host component defined.
@@ -596,7 +602,7 @@ module Bundler::URI
 
       if @opaque
         raise InvalidURIError,
-          "can not set host with registry or opaque"
+          "cannot set host with registry or opaque"
       elsif parser.regexp[:HOST] !~ v
         raise InvalidComponentError,
           "bad component(expected host component): #{v}"
@@ -615,6 +621,13 @@ module Bundler::URI
     end
     protected :set_host
 
+    # Protected setter for the authority info (+user+, +password+, +host+
+    # and +port+).  If +port+ is +nil+, +default_port+ will be set.
+    #
+    protected def set_authority(user, password, host, port = nil)
+      @user, @password, @host, @port = user, password, host, port || self.default_port
+    end
+
     #
     # == Args
     #
@@ -639,6 +652,7 @@ module Bundler::URI
     def host=(v)
       check_host(v)
       set_host(v)
+      set_userinfo(nil)
       v
     end
 
@@ -675,7 +689,7 @@ module Bundler::URI
 
     #
     # Checks the port +v+ component for RFC2396 compliance
-    # and against the Bundler::URI::Parser Regexp for :PORT.
+    # and against the +parser+ Regexp for :PORT.
     #
     # Can not have a registry or opaque component defined,
     # with a port component defined.
@@ -685,7 +699,7 @@ module Bundler::URI
 
       if @opaque
         raise InvalidURIError,
-          "can not set port with registry or opaque"
+          "cannot set port with registry or opaque"
       elsif !v.kind_of?(Integer) && parser.regexp[:PORT] !~ v
         raise InvalidComponentError,
           "bad component(expected port component): #{v.inspect}"
@@ -729,26 +743,27 @@ module Bundler::URI
     def port=(v)
       check_port(v)
       set_port(v)
+      set_userinfo(nil)
       port
     end
 
     def check_registry(v) # :nodoc:
-      raise InvalidURIError, "can not set registry"
+      raise InvalidURIError, "cannot set registry"
     end
     private :check_registry
 
-    def set_registry(v) #:nodoc:
-      raise InvalidURIError, "can not set registry"
+    def set_registry(v) # :nodoc:
+      raise InvalidURIError, "cannot set registry"
     end
     protected :set_registry
 
-    def registry=(v)
-      raise InvalidURIError, "can not set registry"
+    def registry=(v) # :nodoc:
+      raise InvalidURIError, "cannot set registry"
     end
 
     #
     # Checks the path +v+ component for RFC2396 compliance
-    # and against the Bundler::URI::Parser Regexp
+    # and against the +parser+ Regexp
     # for :ABS_PATH and :REL_PATH.
     #
     # Can not have a opaque component defined,
@@ -853,7 +868,7 @@ module Bundler::URI
 
     #
     # Checks the opaque +v+ component for RFC2396 compliance and
-    # against the Bundler::URI::Parser Regexp for :OPAQUE.
+    # against the +parser+ Regexp for :OPAQUE.
     #
     # Can not have a host, port, user, or path component defined,
     # with an opaque component defined.
@@ -866,7 +881,7 @@ module Bundler::URI
       # hier_part     = ( net_path | abs_path ) [ "?" query ]
       if @host || @port || @user || @path  # userinfo = @user + ':' + @password
         raise InvalidURIError,
-          "can not set opaque with host, port, userinfo or path"
+          "cannot set opaque with host, port, userinfo or path"
       elsif v && parser.regexp[:OPAQUE] !~ v
         raise InvalidComponentError,
           "bad component(expected opaque component): #{v}"
@@ -905,7 +920,7 @@ module Bundler::URI
     end
 
     #
-    # Checks the fragment +v+ component against the Bundler::URI::Parser Regexp for :FRAGMENT.
+    # Checks the fragment +v+ component against the +parser+ Regexp for :FRAGMENT.
     #
     #
     # == Args
@@ -945,7 +960,7 @@ module Bundler::URI
     # == Description
     #
     # Bundler::URI has components listed in order of decreasing significance from left to right,
-    # see RFC3986 https://tools.ietf.org/html/rfc3986 1.2.3.
+    # see RFC3986 https://www.rfc-editor.org/rfc/rfc3986 1.2.3.
     #
     # == Usage
     #
@@ -1121,7 +1136,7 @@ module Bundler::URI
 
       base = self.dup
 
-      authority = rel.userinfo || rel.host || rel.port
+      authority = rel.authority
 
       # RFC2396, Section 5.2, 2)
       if (rel.path.nil? || rel.path.empty?) && !authority && !rel.query
@@ -1133,17 +1148,14 @@ module Bundler::URI
       base.fragment=(nil)
 
       # RFC2396, Section 5.2, 4)
-      if !authority
-        base.set_path(merge_path(base.path, rel.path)) if base.path && rel.path
-      else
-        # RFC2396, Section 5.2, 4)
-        base.set_path(rel.path) if rel.path
+      if authority
+        base.set_authority(*authority)
+        base.set_path(rel.path)
+      elsif base.path && rel.path
+        base.set_path(merge_path(base.path, rel.path))
       end
 
       # RFC2396, Section 5.2, 7)
-      base.set_userinfo(rel.userinfo) if rel.userinfo
-      base.set_host(rel.host)         if rel.host
-      base.set_port(rel.port)         if rel.port
       base.query = rel.query       if rel.query
       base.fragment=(rel.fragment) if rel.fragment
 
@@ -1235,7 +1247,7 @@ module Bundler::URI
         return rel, rel
       end
 
-      # you can modify `rel', but can not `oth'.
+      # you can modify `rel', but cannot `oth'.
       return oth, rel
     end
     private :route_from0
@@ -1260,7 +1272,7 @@ module Bundler::URI
     #   #=> #<Bundler::URI::Generic /main.rbx?page=1>
     #
     def route_from(oth)
-      # you can modify `rel', but can not `oth'.
+      # you can modify `rel', but cannot `oth'.
       begin
         oth, rel = route_from0(oth)
       rescue
@@ -1364,6 +1376,9 @@ module Bundler::URI
           str << ':'
           str << @port.to_s
         end
+        if (@host || @port) && !@path.empty? && !@path.start_with?('/')
+          str << '/'
+        end
         str << @path
         if @query
           str << '?'
@@ -1389,29 +1404,18 @@ module Bundler::URI
       end
     end
 
+    # Returns the hash value.
     def hash
       self.component_ary.hash
     end
 
+    # Compares with _oth_ for Hash.
     def eql?(oth)
       self.class == oth.class &&
       parser == oth.parser &&
       self.component_ary.eql?(oth.component_ary)
     end
 
-=begin
-
---- Bundler::URI::Generic#===(oth)
-
-=end
-#    def ===(oth)
-#      raise NotImplementedError
-#    end
-
-=begin
-=end
-
-
     # Returns an Array of the components defined from the COMPONENT Array.
     def component_ary
       component.collect do |x|
@@ -1448,7 +1452,7 @@ module Bundler::URI
       end
     end
 
-    def inspect
+    def inspect # :nodoc:
       "#<#{self.class} #{self}>"
     end
 
@@ -1536,7 +1540,7 @@ module Bundler::URI
         else
           unless proxy_uri = env[name]
             if proxy_uri = env[name.upcase]
-              warn 'The environment variable HTTP_PROXY is discouraged.  Use http_proxy.', uplevel: 1
+              warn 'The environment variable HTTP_PROXY is discouraged.  Please use http_proxy instead.', uplevel: 1
             end
           end
         end
diff --git a/lib/bundler/vendor/uri/lib/uri/http.rb b/lib/bundler/vendor/uri/lib/uri/http.rb
index 2c44810644..9b217ee266 100644
--- a/lib/bundler/vendor/uri/lib/uri/http.rb
+++ b/lib/bundler/vendor/uri/lib/uri/http.rb
@@ -61,6 +61,18 @@ module Bundler::URI
       super(tmp)
     end
 
+    # Do not allow empty host names, as they are not allowed by RFC 3986.
+    def check_host(v)
+      ret = super
+
+      if ret && v.empty?
+        raise InvalidComponentError,
+          "bad component(expected host component): #{v}"
+      end
+
+      ret
+    end
+
     #
     # == Description
     #
@@ -85,7 +97,7 @@ module Bundler::URI
     # == Description
     #
     # Returns the authority for an HTTP uri, as defined in
-    # https://datatracker.ietf.org/doc/html/rfc3986/#section-3.2.
+    # https://www.rfc-editor.org/rfc/rfc3986#section-3.2.
     #
     #
     # Example:
@@ -106,7 +118,7 @@ module Bundler::URI
     # == Description
     #
     # Returns the origin for an HTTP uri, as defined in
-    # https://datatracker.ietf.org/doc/html/rfc6454.
+    # https://www.rfc-editor.org/rfc/rfc6454.
     #
     #
     # Example:
diff --git a/lib/bundler/vendor/uri/lib/uri/rfc2396_parser.rb b/lib/bundler/vendor/uri/lib/uri/rfc2396_parser.rb
index 09c22c9906..522113fe67 100644
--- a/lib/bundler/vendor/uri/lib/uri/rfc2396_parser.rb
+++ b/lib/bundler/vendor/uri/lib/uri/rfc2396_parser.rb
@@ -67,7 +67,7 @@ module Bundler::URI
     #
     # == Synopsis
     #
-    #   Bundler::URI::Parser.new([opts])
+    #   Bundler::URI::RFC2396_Parser.new([opts])
     #
     # == Args
     #
@@ -86,7 +86,7 @@ module Bundler::URI
     #
     # == Examples
     #
-    #   p = Bundler::URI::Parser.new(:ESCAPED => "(?:%[a-fA-F0-9]{2}|%u[a-fA-F0-9]{4})")
+    #   p = Bundler::URI::RFC2396_Parser.new(:ESCAPED => "(?:%[a-fA-F0-9]{2}|%u[a-fA-F0-9]{4})")
     #   u = p.parse("http://example.jp/%uABCD") #=> #<Bundler::URI::HTTP http://example.jp/%uABCD>
     #   Bundler::URI.parse(u.to_s) #=> raises Bundler::URI::InvalidURIError
     #
@@ -108,12 +108,12 @@ module Bundler::URI
 
     # The Hash of patterns.
     #
-    # See also Bundler::URI::Parser.initialize_pattern.
+    # See also #initialize_pattern.
     attr_reader :pattern
 
     # The Hash of Regexp.
     #
-    # See also Bundler::URI::Parser.initialize_regexp.
+    # See also #initialize_regexp.
     attr_reader :regexp
 
     # Returns a split Bundler::URI against +regexp[:ABS_URI]+.
@@ -140,11 +140,11 @@ module Bundler::URI
 
         if !scheme
           raise InvalidURIError,
-            "bad Bundler::URI(absolute but no scheme): #{uri}"
+            "bad Bundler::URI (absolute but no scheme): #{uri}"
         end
         if !opaque && (!path && (!host && !registry))
           raise InvalidURIError,
-            "bad Bundler::URI(absolute but no path): #{uri}"
+            "bad Bundler::URI (absolute but no path): #{uri}"
         end
 
       when @regexp[:REL_URI]
@@ -173,7 +173,7 @@ module Bundler::URI
         # server        = [ [ userinfo "@" ] hostport ]
 
       else
-        raise InvalidURIError, "bad Bundler::URI(is not Bundler::URI?): #{uri}"
+        raise InvalidURIError, "bad Bundler::URI (is not Bundler::URI?): #{uri}"
       end
 
       path = '' if !path && !opaque # (see RFC2396 Section 5.2)
@@ -202,8 +202,7 @@ module Bundler::URI
     #
     # == Usage
     #
-    #   p = Bundler::URI::Parser.new
-    #   p.parse("ldap://ldap.example.com/dc=example?user=john")
+    #   Bundler::URI::RFC2396_PARSER.parse("ldap://ldap.example.com/dc=example?user=john")
     #   #=> #<Bundler::URI::LDAP ldap://ldap.example.com/dc=example?user=john>
     #
     def parse(uri)
@@ -244,7 +243,7 @@ module Bundler::URI
     # If no +block+ given, then returns the result,
     # else it calls +block+ for each element in result.
     #
-    # See also Bundler::URI::Parser.make_regexp.
+    # See also #make_regexp.
     #
     def extract(str, schemes = nil)
       if block_given?
@@ -263,7 +262,7 @@ module Bundler::URI
       unless schemes
         @regexp[:ABS_URI_REF]
       else
-        /(?=#{Regexp.union(*schemes)}:)#{@pattern[:X_ABS_URI]}/x
+        /(?=(?i:#{Regexp.union(*schemes).source}):)#{@pattern[:X_ABS_URI]}/x
       end
     end
 
@@ -321,14 +320,14 @@ module Bundler::URI
       str.gsub(escaped) { [$&[1, 2]].pack('H2').force_encoding(enc) }
     end
 
-    @@to_s = Kernel.instance_method(:to_s)
-    if @@to_s.respond_to?(:bind_call)
-      def inspect
-        @@to_s.bind_call(self)
+    TO_S = Kernel.instance_method(:to_s) # :nodoc:
+    if TO_S.respond_to?(:bind_call)
+      def inspect # :nodoc:
+        TO_S.bind_call(self)
       end
     else
-      def inspect
-        @@to_s.bind(self).call
+      def inspect # :nodoc:
+        TO_S.bind(self).call
       end
     end
 
@@ -524,6 +523,8 @@ module Bundler::URI
       ret
     end
 
+    # Returns +uri+ as-is if it is Bundler::URI, or convert it to Bundler::URI if it is
+    # a String.
     def convert_to_uri(uri)
       if uri.is_a?(Bundler::URI::Generic)
         uri
@@ -536,4 +537,11 @@ module Bundler::URI
     end
 
   end # class Parser
+
+  # Backward compatibility for Bundler::URI::REGEXP::PATTERN::*
+  RFC2396_Parser.new.pattern.each_pair do |sym, str|
+    unless RFC2396_REGEXP::PATTERN.const_defined?(sym, false)
+      RFC2396_REGEXP::PATTERN.const_set(sym, str)
+    end
+  end
 end # module Bundler::URI
diff --git a/lib/bundler/vendor/uri/lib/uri/rfc3986_parser.rb b/lib/bundler/vendor/uri/lib/uri/rfc3986_parser.rb
index 4c9882f595..d1ff28df23 100644
--- a/lib/bundler/vendor/uri/lib/uri/rfc3986_parser.rb
+++ b/lib/bundler/vendor/uri/lib/uri/rfc3986_parser.rb
@@ -78,7 +78,7 @@ module Bundler::URI
       begin
         uri = uri.to_str
       rescue NoMethodError
-        raise InvalidURIError, "bad Bundler::URI(is not Bundler::URI?): #{uri.inspect}"
+        raise InvalidURIError, "bad Bundler::URI (is not Bundler::URI?): #{uri.inspect}"
       end
       uri.ascii_only? or
         raise InvalidURIError, "Bundler::URI must be ascii only #{uri.dump}"
@@ -127,7 +127,7 @@ module Bundler::URI
           m["fragment"]
         ]
       else
-        raise InvalidURIError, "bad Bundler::URI(is not Bundler::URI?): #{uri.inspect}"
+        raise InvalidURIError, "bad Bundler::URI (is not Bundler::URI?): #{uri.inspect}"
       end
     end
 
@@ -135,12 +135,35 @@ module Bundler::URI
       Bundler::URI.for(*self.split(uri), self)
     end
 
-
     def join(*uris) # :nodoc:
       uris[0] = convert_to_uri(uris[0])
       uris.inject :merge
     end
 
+    # Compatibility for RFC2396 parser
+    def extract(str, schemes = nil, &block) # :nodoc:
+      warn "Bundler::URI::RFC3986_PARSER.extract is obsolete. Use Bundler::URI::RFC2396_PARSER.extract explicitly.", uplevel: 1 if $VERBOSE
+      RFC2396_PARSER.extract(str, schemes, &block)
+    end
+
+    # Compatibility for RFC2396 parser
+    def make_regexp(schemes = nil) # :nodoc:
+      warn "Bundler::URI::RFC3986_PARSER.make_regexp is obsolete. Use Bundler::URI::RFC2396_PARSER.make_regexp explicitly.", uplevel: 1 if $VERBOSE
+      RFC2396_PARSER.make_regexp(schemes)
+    end
+
+    # Compatibility for RFC2396 parser
+    def escape(str, unsafe = nil) # :nodoc:
+      warn "Bundler::URI::RFC3986_PARSER.escape is obsolete. Use Bundler::URI::RFC2396_PARSER.escape explicitly.", uplevel: 1 if $VERBOSE
+      unsafe ? RFC2396_PARSER.escape(str, unsafe) : RFC2396_PARSER.escape(str)
+    end
+
+    # Compatibility for RFC2396 parser
+    def unescape(str, escaped = nil) # :nodoc:
+      warn "Bundler::URI::RFC3986_PARSER.unescape is obsolete. Use Bundler::URI::RFC2396_PARSER.unescape explicitly.", uplevel: 1 if $VERBOSE
+      escaped ? RFC2396_PARSER.unescape(str, escaped) : RFC2396_PARSER.unescape(str)
+    end
+
     @@to_s = Kernel.instance_method(:to_s)
     if @@to_s.respond_to?(:bind_call)
       def inspect
diff --git a/lib/bundler/vendor/uri/lib/uri/version.rb b/lib/bundler/vendor/uri/lib/uri/version.rb
index 1fa1c7c09a..ad76308e81 100644
--- a/lib/bundler/vendor/uri/lib/uri/version.rb
+++ b/lib/bundler/vendor/uri/lib/uri/version.rb
@@ -1,6 +1,6 @@
 module Bundler::URI
   # :stopdoc:
-  VERSION_CODE = '001300'.freeze
-  VERSION = VERSION_CODE.scan(/../).collect{|n| n.to_i}.join('.').freeze
+  VERSION = '1.1.1'.freeze
+  VERSION_CODE = VERSION.split('.').map{|s| s.rjust(2, '0')}.join.freeze
   # :startdoc:
 end
diff --git a/lib/bundler/vendored_net_http.rb b/lib/bundler/vendored_net_http.rb
index 0dcabaa7d7..8ff2ccd1fe 100644
--- a/lib/bundler/vendored_net_http.rb
+++ b/lib/bundler/vendored_net_http.rb
@@ -1,12 +1,23 @@
 # frozen_string_literal: true
 
-begin
-  require "rubygems/vendored_net_http"
-rescue LoadError
+# This defined? guard can be removed once RubyGems 3.4 support is dropped.
+#
+# Bundler specs load this code from `spec/support/vendored_net_http.rb` to avoid
+# activating the Bundler gem too early. Without this guard, we get redefinition
+# warnings once Bundler is actually activated and
+# `lib/bundler/vendored_net_http.rb` is required. This is not an issue in
+# RubyGems versions including `rubygems/vendored_net_http` since `require` takes
+# care of avoiding the double load.
+#
+unless defined?(Gem::Net)
   begin
-    require "rubygems/net/http"
+    require "rubygems/vendored_net_http"
   rescue LoadError
-    require "net/http"
-    Gem::Net = Net
+    begin
+      require "rubygems/net/http"
+    rescue LoadError
+      require "net/http"
+      Gem::Net = Net
+    end
   end
 end
diff --git a/lib/bundler/vendored_securerandom.rb b/lib/bundler/vendored_securerandom.rb
new file mode 100644
index 0000000000..6a704dbd40
--- /dev/null
+++ b/lib/bundler/vendored_securerandom.rb
@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+# Use RubyGems vendored copy when available. Otherwise fallback to Bundler
+# vendored copy. The vendored copy in Bundler can be removed once support for
+# RubyGems 3.5.18 is dropped.
+
+begin
+  require "rubygems/vendored_securerandom"
+rescue LoadError
+  require_relative "vendor/securerandom/lib/securerandom"
+  Gem::SecureRandom = Bundler::SecureRandom
+end
diff --git a/lib/bundler/version.rb b/lib/bundler/version.rb
index f2f6236cda..ca7bb0719a 100644
--- a/lib/bundler/version.rb
+++ b/lib/bundler/version.rb
@@ -1,13 +1,21 @@
 # frozen_string_literal: false
 
 module Bundler
-  VERSION = "2.6.0.dev".freeze
+  VERSION = "4.1.0.dev".freeze
 
   def self.bundler_major_version
-    @bundler_major_version ||= VERSION.split(".").first.to_i
+    @bundler_major_version ||= gem_version.segments.first
   end
 
   def self.gem_version
     @gem_version ||= Gem::Version.create(VERSION)
   end
+
+  def self.verbose_version
+    @verbose_version ||= "#{VERSION}#{simulated_version ? " (simulating Bundler #{simulated_version})" : ""}"
+  end
+
+  def self.simulated_version
+    @simulated_version ||= Bundler.settings[:simulate_version]
+  end
 end
diff --git a/lib/bundler/vlad.rb b/lib/bundler/vlad.rb
index 6179d0e4eb..c3a3d949a6 100644
--- a/lib/bundler/vlad.rb
+++ b/lib/bundler/vlad.rb
@@ -1,17 +1,4 @@
 # frozen_string_literal: true
 
 require_relative "shared_helpers"
-Bundler::SharedHelpers.major_deprecation 2,
-  "The Bundler task for Vlad"
-
-# Vlad task for Bundler.
-#
-# Add "require 'bundler/vlad'" in your Vlad deploy.rb, and
-# include the vlad:bundle:install task in your vlad:deploy task.
-require_relative "deployment"
-
-include Rake::DSL if defined? Rake::DSL
-
-namespace :vlad do
-  Bundler::Deployment.define_task(Rake::RemoteTask, :remote_task, roles: :app)
-end
+Bundler::SharedHelpers.feature_removed! "The Bundler task for Vlad"
diff --git a/lib/bundler/worker.rb b/lib/bundler/worker.rb
index 3ebd6f01db..77f4f004aa 100644
--- a/lib/bundler/worker.rb
+++ b/lib/bundler/worker.rb
@@ -22,6 +22,7 @@ module Bundler
     def initialize(size, name, func)
       @name = name
       @request_queue = Thread::Queue.new
+      @request_queue_with_priority = Thread::Queue.new
       @response_queue = Thread::Queue.new
       @func = func
       @size = size
@@ -32,9 +33,10 @@ module Bundler
     # Enqueue a request to be executed in the worker pool
     #
     # @param obj [String] mostly it is name of spec that should be downloaded
-    def enq(obj)
+    def enq(obj, priority: false)
+      queue = priority ? @request_queue_with_priority : @request_queue
       create_threads unless @threads
-      @request_queue.enq obj
+      queue.enq obj
     end
 
     # Retrieves results of job function being executed in worker pool
@@ -52,7 +54,13 @@ module Bundler
 
     def process_queue(i)
       loop do
-        obj = @request_queue.deq
+        obj = begin
+          @request_queue_with_priority.deq(true)
+        rescue ThreadError
+          @request_queue.deq(false, timeout: 0.05)
+        end
+
+        next if obj.nil?
         break if obj.equal? POISON
         @response_queue.enq apply_func(obj, i)
       end
@@ -88,7 +96,7 @@ module Bundler
 
       @threads = Array.new(@size) do |i|
         Thread.start { process_queue(i) }.tap do |thread|
-          thread.name = "#{name} Worker ##{i}" if thread.respond_to?(:name=)
+          thread.name = "#{name} Worker ##{i}"
         end
       rescue ThreadError => e
         creation_errors << e
diff --git a/lib/bundler/yaml_serializer.rb b/lib/bundler/yaml_serializer.rb
index 42e6aaf89d..ab1eb6dbcf 100644
--- a/lib/bundler/yaml_serializer.rb
+++ b/lib/bundler/yaml_serializer.rb
@@ -41,7 +41,7 @@ module Bundler
     HASH_REGEX = /
       ^
       ([ ]*) # indentations
-      (.+) # key
+      ([^#]+) # key excludes comment char '#'
       (?::(?=(?:\s|$))) # :  (without the lookahead the #key includes this when : is present in value)
       [ ]?
       (['"]?) # optional opening quote
@@ -60,7 +60,6 @@ module Bundler
           indent, key, quote, val = match.captures
           val = strip_comment(val)
 
-          convert_to_backward_compatible_key!(key)
           depth = indent.size / 2
           if quote.empty? && val.empty?
             new_hash = {}
@@ -92,14 +91,8 @@ module Bundler
       end
     end
 
-    # for settings' keys
-    def convert_to_backward_compatible_key!(key)
-      key << "/" if /https?:/i.match?(key) && !%r{/\Z}.match?(key)
-      key.gsub!(".", "__")
-    end
-
     class << self
-      private :dump_hash, :convert_to_backward_compatible_key!
+      private :dump_hash
     end
   end
 end
diff --git a/lib/cgi.rb b/lib/cgi.rb
index 7af85e7fc8..0c403bd19c 100644
--- a/lib/cgi.rb
+++ b/lib/cgi.rb
@@ -1,297 +1,9 @@
 # frozen_string_literal: true
-#
-# cgi.rb - cgi support library
-#
-# Copyright (C) 2000  Network Applied Communication Laboratory, Inc.
-#
-# Copyright (C) 2000  Information-technology Promotion Agency, Japan
-#
-# Author: Wakou Aoyama <wakou@ruby-lang.org>
-#
-# Documentation: Wakou Aoyama (RDoc'd and embellished by William Webber)
-#
 
-# == Overview
-#
-# The Common Gateway Interface (CGI) is a simple protocol for passing an HTTP
-# request from a web server to a standalone program, and returning the output
-# to the web browser.  Basically, a CGI program is called with the parameters
-# of the request passed in either in the environment (GET) or via $stdin
-# (POST), and everything it prints to $stdout is returned to the client.
-#
-# This file holds the CGI class.  This class provides functionality for
-# retrieving HTTP request parameters, managing cookies, and generating HTML
-# output.
-#
-# The file CGI::Session provides session management functionality; see that
-# class for more details.
-#
-# See http://www.w3.org/CGI/ for more information on the CGI protocol.
-#
-# == Introduction
-#
-# CGI is a large class, providing several categories of methods, many of which
-# are mixed in from other modules.  Some of the documentation is in this class,
-# some in the modules CGI::QueryExtension and CGI::HtmlExtension.  See
-# CGI::Cookie for specific information on handling cookies, and cgi/session.rb
-# (CGI::Session) for information on sessions.
-#
-# For queries, CGI provides methods to get at environmental variables,
-# parameters, cookies, and multipart request data.  For responses, CGI provides
-# methods for writing output and generating HTML.
-#
-# Read on for more details.  Examples are provided at the bottom.
-#
-# == Queries
-#
-# The CGI class dynamically mixes in parameter and cookie-parsing
-# functionality,  environmental variable access, and support for
-# parsing multipart requests (including uploaded files) from the
-# CGI::QueryExtension module.
-#
-# === Environmental Variables
-#
-# The standard CGI environmental variables are available as read-only
-# attributes of a CGI object.  The following is a list of these variables:
-#
-#
-#   AUTH_TYPE               HTTP_HOST          REMOTE_IDENT
-#   CONTENT_LENGTH          HTTP_NEGOTIATE     REMOTE_USER
-#   CONTENT_TYPE            HTTP_PRAGMA        REQUEST_METHOD
-#   GATEWAY_INTERFACE       HTTP_REFERER       SCRIPT_NAME
-#   HTTP_ACCEPT             HTTP_USER_AGENT    SERVER_NAME
-#   HTTP_ACCEPT_CHARSET     PATH_INFO          SERVER_PORT
-#   HTTP_ACCEPT_ENCODING    PATH_TRANSLATED    SERVER_PROTOCOL
-#   HTTP_ACCEPT_LANGUAGE    QUERY_STRING       SERVER_SOFTWARE
-#   HTTP_CACHE_CONTROL      REMOTE_ADDR
-#   HTTP_FROM               REMOTE_HOST
-#
-#
-# For each of these variables, there is a corresponding attribute with the
-# same name, except all lower case and without a preceding HTTP_.
-# +content_length+ and +server_port+ are integers; the rest are strings.
-#
-# === Parameters
-#
-# The method #params() returns a hash of all parameters in the request as
-# name/value-list pairs, where the value-list is an Array of one or more
-# values.  The CGI object itself also behaves as a hash of parameter names
-# to values, but only returns a single value (as a String) for each
-# parameter name.
-#
-# For instance, suppose the request contains the parameter
-# "favourite_colours" with the multiple values "blue" and "green".  The
-# following behavior would occur:
-#
-#   cgi.params["favourite_colours"]  # => ["blue", "green"]
-#   cgi["favourite_colours"]         # => "blue"
-#
-# If a parameter does not exist, the former method will return an empty
-# array, the latter an empty string.  The simplest way to test for existence
-# of a parameter is by the #has_key? method.
-#
-# === Cookies
-#
-# HTTP Cookies are automatically parsed from the request.  They are available
-# from the #cookies() accessor, which returns a hash from cookie name to
-# CGI::Cookie object.
-#
-# === Multipart requests
-#
-# If a request's method is POST and its content type is multipart/form-data,
-# then it may contain uploaded files.  These are stored by the QueryExtension
-# module in the parameters of the request.  The parameter name is the name
-# attribute of the file input field, as usual.  However, the value is not
-# a string, but an IO object, either an IOString for small files, or a
-# Tempfile for larger ones.  This object also has the additional singleton
-# methods:
-#
-# #local_path():: the path of the uploaded file on the local filesystem
-# #original_filename():: the name of the file on the client computer
-# #content_type():: the content type of the file
-#
-# == Responses
-#
-# The CGI class provides methods for sending header and content output to
-# the HTTP client, and mixes in methods for programmatic HTML generation
-# from CGI::HtmlExtension and CGI::TagMaker modules.  The precise version of HTML
-# to use for HTML generation is specified at object creation time.
-#
-# === Writing output
-#
-# The simplest way to send output to the HTTP client is using the #out() method.
-# This takes the HTTP headers as a hash parameter, and the body content
-# via a block.  The headers can be generated as a string using the #http_header()
-# method.  The output stream can be written directly to using the #print()
-# method.
-#
-# === Generating HTML
-#
-# Each HTML element has a corresponding method for generating that
-# element as a String.  The name of this method is the same as that
-# of the element, all lowercase.  The attributes of the element are
-# passed in as a hash, and the body as a no-argument block that evaluates
-# to a String.  The HTML generation module knows which elements are
-# always empty, and silently drops any passed-in body.  It also knows
-# which elements require matching closing tags and which don't.  However,
-# it does not know what attributes are legal for which elements.
-#
-# There are also some additional HTML generation methods mixed in from
-# the CGI::HtmlExtension module.  These include individual methods for the
-# different types of form inputs, and methods for elements that commonly
-# take particular attributes where the attributes can be directly specified
-# as arguments, rather than via a hash.
-#
-# === Utility HTML escape and other methods like a function.
-#
-# There are some utility tool defined in cgi/util.rb .
-# And when include, you can use utility methods like a function.
-#
-# == Examples of use
-#
-# === Get form values
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   value = cgi['field_name']   # <== value string for 'field_name'
-#     # if not 'field_name' included, then return "".
-#   fields = cgi.keys            # <== array of field names
-#
-#   # returns true if form has 'field_name'
-#   cgi.has_key?('field_name')
-#   cgi.has_key?('field_name')
-#   cgi.include?('field_name')
-#
-# CAUTION! <code>cgi['field_name']</code> returned an Array with the old
-# cgi.rb(included in Ruby 1.6)
-#
-# === Get form values as hash
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   params = cgi.params
-#
-# cgi.params is a hash.
-#
-#   cgi.params['new_field_name'] = ["value"]  # add new param
-#   cgi.params['field_name'] = ["new_value"]  # change value
-#   cgi.params.delete('field_name')           # delete param
-#   cgi.params.clear                          # delete all params
-#
-#
-# === Save form values to file
-#
-#   require "pstore"
-#   db = PStore.new("query.db")
-#   db.transaction do
-#     db["params"] = cgi.params
-#   end
-#
-#
-# === Restore form values from file
-#
-#   require "pstore"
-#   db = PStore.new("query.db")
-#   db.transaction do
-#     cgi.params = db["params"]
-#   end
-#
-#
-# === Get multipart form values
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   value = cgi['field_name']   # <== value string for 'field_name'
-#   value.read                  # <== body of value
-#   value.local_path            # <== path to local file of value
-#   value.original_filename     # <== original filename of value
-#   value.content_type          # <== content_type of value
-#
-# and value has StringIO or Tempfile class methods.
-#
-# === Get cookie values
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   values = cgi.cookies['name']  # <== array of 'name'
-#     # if not 'name' included, then return [].
-#   names = cgi.cookies.keys      # <== array of cookie names
-#
-# and cgi.cookies is a hash.
-#
-# === Get cookie objects
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   for name, cookie in cgi.cookies
-#     cookie.expires = Time.now + 30
-#   end
-#   cgi.out("cookie" => cgi.cookies) {"string"}
-#
-#   cgi.cookies # { "name1" => cookie1, "name2" => cookie2, ... }
-#
-#   require "cgi"
-#   cgi = CGI.new
-#   cgi.cookies['name'].expires = Time.now + 30
-#   cgi.out("cookie" => cgi.cookies['name']) {"string"}
-#
-# === Print http header and html string to $DEFAULT_OUTPUT ($>)
-#
-#   require "cgi"
-#   cgi = CGI.new("html4")  # add HTML generation methods
-#   cgi.out do
-#     cgi.html do
-#       cgi.head do
-#         cgi.title { "TITLE" }
-#       end +
-#       cgi.body do
-#         cgi.form("ACTION" => "uri") do
-#           cgi.p do
-#             cgi.textarea("get_text") +
-#             cgi.br +
-#             cgi.submit
-#           end
-#         end +
-#         cgi.pre do
-#           CGI.escapeHTML(
-#             "params: #{cgi.params.inspect}\n" +
-#             "cookies: #{cgi.cookies.inspect}\n" +
-#             ENV.collect do |key, value|
-#               "#{key} --> #{value}\n"
-#             end.join("")
-#           )
-#         end
-#       end
-#     end
-#   end
-#
-#   # add HTML generation methods
-#   CGI.new("html3")    # html3.2
-#   CGI.new("html4")    # html4.01 (Strict)
-#   CGI.new("html4Tr")  # html4.01 Transitional
-#   CGI.new("html4Fr")  # html4.01 Frameset
-#   CGI.new("html5")    # html5
-#
-# === Some utility methods
-#
-#   require 'cgi/util'
-#   CGI.escapeHTML('Usage: foo "bar" <baz>')
-#
-#
-# === Some utility methods like a function
-#
-#   require 'cgi/util'
-#   include CGI::Util
-#   escapeHTML('Usage: foo "bar" <baz>')
-#   h('Usage: foo "bar" <baz>') # alias
-#
-#
+require "cgi/escape"
+warn <<-WARNING, uplevel: Gem::BUNDLED_GEMS.uplevel if $VERBOSE
+CGI library is removed from Ruby 4.0. Please use cgi/escape instead for CGI.escape and CGI.unescape features.
 
-class CGI
-  VERSION = "0.4.1"
-end
-
-require 'cgi/core'
-require 'cgi/cookie'
-require 'cgi/util'
-CGI.autoload(:HtmlExtension, 'cgi/html')
+If you need to use the full features of CGI library, please add 'gem "cgi"' to your script
+or use Bundler to ensure you are using the cgi gem instead of this file.
+WARNING
diff --git a/lib/cgi/cgi.gemspec b/lib/cgi/cgi.gemspec
deleted file mode 100644
index 381c55a5ca..0000000000
--- a/lib/cgi/cgi.gemspec
+++ /dev/null
@@ -1,42 +0,0 @@
-# frozen_string_literal: true
-
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", Array.new(name.count("-")+1, "..").join("/")].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Yukihiro Matsumoto"]
-  spec.email         = ["matz@ruby-lang.org"]
-
-  spec.summary       = %q{Support for the Common Gateway Interface protocol.}
-  spec.description   = %q{Support for the Common Gateway Interface protocol.}
-  spec.homepage      = "https://github.com/ruby/cgi"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-  spec.required_ruby_version = ">= 2.5.0"
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-
-  spec.executables   = []
-
-  spec.files = [
-    "LICENSE.txt",
-    "README.md",
-    *Dir["lib{.rb,/**/*.rb}", "bin/*"]  ]
-
-  spec.require_paths = ["lib"]
-
-  if Gem::Platform === spec.platform and spec.platform =~ 'java' or RUBY_ENGINE == 'jruby'
-    spec.platform = 'java'
-    spec.require_paths << "ext/java/org/jruby/ext/cgi/escape/lib"
-    spec.files += Dir["ext/java/**/*.{rb}", "lib/cgi/escape.jar"]
-  else
-    spec.files += Dir["ext/cgi/**/*.{rb,c,h,sh}", "ext/cgi/escape/depend", "lib/cgi/escape.so"]
-    spec.extensions    = ["ext/cgi/escape/extconf.rb"]
-  end
-end
diff --git a/lib/cgi/cookie.rb b/lib/cgi/cookie.rb
deleted file mode 100644
index 9498e2f9fa..0000000000
--- a/lib/cgi/cookie.rb
+++ /dev/null
@@ -1,209 +0,0 @@
-# frozen_string_literal: true
-require_relative 'util'
-class CGI
-  # Class representing an HTTP cookie.
-  #
-  # In addition to its specific fields and methods, a Cookie instance
-  # is a delegator to the array of its values.
-  #
-  # See RFC 2965.
-  #
-  # == Examples of use
-  #   cookie1 = CGI::Cookie.new("name", "value1", "value2", ...)
-  #   cookie1 = CGI::Cookie.new("name" => "name", "value" => "value")
-  #   cookie1 = CGI::Cookie.new('name'     => 'name',
-  #                             'value'    => ['value1', 'value2', ...],
-  #                             'path'     => 'path',   # optional
-  #                             'domain'   => 'domain', # optional
-  #                             'expires'  => Time.now, # optional
-  #                             'secure'   => true,     # optional
-  #                             'httponly' => true      # optional
-  #                             )
-  #
-  #   cgi.out("cookie" => [cookie1, cookie2]) { "string" }
-  #
-  #   name     = cookie1.name
-  #   values   = cookie1.value
-  #   path     = cookie1.path
-  #   domain   = cookie1.domain
-  #   expires  = cookie1.expires
-  #   secure   = cookie1.secure
-  #   httponly = cookie1.httponly
-  #
-  #   cookie1.name     = 'name'
-  #   cookie1.value    = ['value1', 'value2', ...]
-  #   cookie1.path     = 'path'
-  #   cookie1.domain   = 'domain'
-  #   cookie1.expires  = Time.now + 30
-  #   cookie1.secure   = true
-  #   cookie1.httponly = true
-  class Cookie < Array
-    @@accept_charset="UTF-8" unless defined?(@@accept_charset)
-
-    TOKEN_RE = %r"\A[[!-~]&&[^()<>@,;:\\\"/?=\[\]{}]]+\z"
-    PATH_VALUE_RE = %r"\A[[ -~]&&[^;]]*\z"
-    DOMAIN_VALUE_RE = %r"\A\.?(?<label>(?!-)[-A-Za-z0-9]+(?<!-))(?:\.\g<label>)*\z"
-
-    # Create a new CGI::Cookie object.
-    #
-    # :call-seq:
-    #   Cookie.new(name_string,*value)
-    #   Cookie.new(options_hash)
-    #
-    # +name_string+::
-    #   The name of the cookie; in this form, there is no #domain or
-    #   #expiration.  The #path is gleaned from the +SCRIPT_NAME+ environment
-    #   variable, and #secure is false.
-    # <tt>*value</tt>::
-    #   value or list of values of the cookie
-    # +options_hash+::
-    #   A Hash of options to initialize this Cookie.  Possible options are:
-    #
-    #   name:: the name of the cookie.  Required.
-    #   value:: the cookie's value or list of values.
-    #   path:: the path for which this cookie applies.  Defaults to
-    #          the value of the +SCRIPT_NAME+ environment variable.
-    #   domain:: the domain for which this cookie applies.
-    #   expires:: the time at which this cookie expires, as a +Time+ object.
-    #   secure:: whether this cookie is a secure cookie or not (default to
-    #            false).  Secure cookies are only transmitted to HTTPS
-    #            servers.
-    #   httponly:: whether this cookie is a HttpOnly cookie or not (default to
-    #            false).  HttpOnly cookies are not available to javascript.
-    #
-    #   These keywords correspond to attributes of the cookie object.
-    def initialize(name = "", *value)
-      @domain = nil
-      @expires = nil
-      if name.kind_of?(String)
-        self.name = name
-        self.path = (%r|\A(.*/)| =~ ENV["SCRIPT_NAME"] ? $1 : "")
-        @secure = false
-        @httponly = false
-        return super(value)
-      end
-
-      options = name
-      unless options.has_key?("name")
-        raise ArgumentError, "`name' required"
-      end
-
-      self.name = options["name"]
-      value = Array(options["value"])
-      # simple support for IE
-      self.path = options["path"] || (%r|\A(.*/)| =~ ENV["SCRIPT_NAME"] ? $1 : "")
-      self.domain = options["domain"]
-      @expires = options["expires"]
-      @secure = options["secure"] == true
-      @httponly = options["httponly"] == true
-
-      super(value)
-    end
-
-    # Name of this cookie, as a +String+
-    attr_reader :name
-    # Set name of this cookie
-    def name=(str)
-      if str and !TOKEN_RE.match?(str)
-        raise ArgumentError, "invalid name: #{str.dump}"
-      end
-      @name = str
-    end
-
-    # Path for which this cookie applies, as a +String+
-    attr_reader :path
-    # Set path for which this cookie applies
-    def path=(str)
-      if str and !PATH_VALUE_RE.match?(str)
-        raise ArgumentError, "invalid path: #{str.dump}"
-      end
-      @path = str
-    end
-
-    # Domain for which this cookie applies, as a +String+
-    attr_reader :domain
-    # Set domain for which this cookie applies
-    def domain=(str)
-      if str and ((str = str.b).bytesize > 255 or !DOMAIN_VALUE_RE.match?(str))
-        raise ArgumentError, "invalid domain: #{str.dump}"
-      end
-      @domain = str
-    end
-
-    # Time at which this cookie expires, as a +Time+
-    attr_accessor :expires
-    # True if this cookie is secure; false otherwise
-    attr_reader :secure
-    # True if this cookie is httponly; false otherwise
-    attr_reader :httponly
-
-    # Returns the value or list of values for this cookie.
-    def value
-      self
-    end
-
-    # Replaces the value of this cookie with a new value or list of values.
-    def value=(val)
-      replace(Array(val))
-    end
-
-    # Set whether the Cookie is a secure cookie or not.
-    #
-    # +val+ must be a boolean.
-    def secure=(val)
-      @secure = val if val == true or val == false
-      @secure
-    end
-
-    # Set whether the Cookie is a httponly cookie or not.
-    #
-    # +val+ must be a boolean.
-    def httponly=(val)
-      @httponly = !!val
-    end
-
-    # Convert the Cookie to its string representation.
-    def to_s
-      val = collect{|v| CGI.escape(v) }.join("&")
-      buf = "#{@name}=#{val}".dup
-      buf << "; domain=#{@domain}" if @domain
-      buf << "; path=#{@path}"     if @path
-      buf << "; expires=#{CGI.rfc1123_date(@expires)}" if @expires
-      buf << "; secure"            if @secure
-      buf << "; HttpOnly"          if @httponly
-      buf
-    end
-
-    # Parse a raw cookie string into a hash of cookie-name=>Cookie
-    # pairs.
-    #
-    #   cookies = CGI::Cookie.parse("raw_cookie_string")
-    #     # { "name1" => cookie1, "name2" => cookie2, ... }
-    #
-    def self.parse(raw_cookie)
-      cookies = Hash.new([])
-      return cookies unless raw_cookie
-
-      raw_cookie.split(/;\s?/).each do |pairs|
-        name, values = pairs.split('=',2)
-        next unless name and values
-        values ||= ""
-        values = values.split('&').collect{|v| CGI.unescape(v,@@accept_charset) }
-        if cookies.has_key?(name)
-          values = cookies[name].value + values
-        end
-        cookies[name] = Cookie.new(name, *values)
-      end
-
-      cookies
-    end
-
-    # A summary of cookie string.
-    def inspect
-      "#<CGI::Cookie: #{self.to_s.inspect}>"
-    end
-
-  end # class Cookie
-end
-
-
diff --git a/lib/cgi/core.rb b/lib/cgi/core.rb
deleted file mode 100644
index 62e606837a..0000000000
--- a/lib/cgi/core.rb
+++ /dev/null
@@ -1,900 +0,0 @@
-# frozen_string_literal: true
-#--
-# Methods for generating HTML, parsing CGI-related parameters, and
-# generating HTTP responses.
-#++
-class CGI
-  unless const_defined?(:Util)
-    module Util
-      @@accept_charset = "UTF-8" # :nodoc:
-    end
-    include Util
-    extend Util
-  end
-
-  $CGI_ENV = ENV    # for FCGI support
-
-  # String for carriage return
-  CR  = "\015"
-
-  # String for linefeed
-  LF  = "\012"
-
-  # Standard internet newline sequence
-  EOL = CR + LF
-
-  REVISION = '$Id$' #:nodoc:
-
-  # Whether processing will be required in binary vs text
-  NEEDS_BINMODE = File::BINARY != 0
-
-  # Path separators in different environments.
-  PATH_SEPARATOR = {'UNIX'=>'/', 'WINDOWS'=>'\\', 'MACINTOSH'=>':'}
-
-  # HTTP status codes.
-  HTTP_STATUS = {
-    "OK"                  => "200 OK",
-    "PARTIAL_CONTENT"     => "206 Partial Content",
-    "MULTIPLE_CHOICES"    => "300 Multiple Choices",
-    "MOVED"               => "301 Moved Permanently",
-    "REDIRECT"            => "302 Found",
-    "NOT_MODIFIED"        => "304 Not Modified",
-    "BAD_REQUEST"         => "400 Bad Request",
-    "AUTH_REQUIRED"       => "401 Authorization Required",
-    "FORBIDDEN"           => "403 Forbidden",
-    "NOT_FOUND"           => "404 Not Found",
-    "METHOD_NOT_ALLOWED"  => "405 Method Not Allowed",
-    "NOT_ACCEPTABLE"      => "406 Not Acceptable",
-    "LENGTH_REQUIRED"     => "411 Length Required",
-    "PRECONDITION_FAILED" => "412 Precondition Failed",
-    "SERVER_ERROR"        => "500 Internal Server Error",
-    "NOT_IMPLEMENTED"     => "501 Method Not Implemented",
-    "BAD_GATEWAY"         => "502 Bad Gateway",
-    "VARIANT_ALSO_VARIES" => "506 Variant Also Negotiates"
-  }
-
-  # :startdoc:
-
-  # Synonym for ENV.
-  def env_table
-    ENV
-  end
-
-  # Synonym for $stdin.
-  def stdinput
-    $stdin
-  end
-
-  # Synonym for $stdout.
-  def stdoutput
-    $stdout
-  end
-
-  private :env_table, :stdinput, :stdoutput
-
-  # Create an HTTP header block as a string.
-  #
-  # :call-seq:
-  #   http_header(content_type_string="text/html")
-  #   http_header(headers_hash)
-  #
-  # Includes the empty line that ends the header block.
-  #
-  # +content_type_string+::
-  #   If this form is used, this string is the <tt>Content-Type</tt>
-  # +headers_hash+::
-  #   A Hash of header values. The following header keys are recognized:
-  #
-  #   type:: The Content-Type header.  Defaults to "text/html"
-  #   charset:: The charset of the body, appended to the Content-Type header.
-  #   nph:: A boolean value.  If true, prepend protocol string and status
-  #         code, and date; and sets default values for "server" and
-  #         "connection" if not explicitly set.
-  #   status::
-  #     The HTTP status code as a String, returned as the Status header.  The
-  #     values are:
-  #
-  #     OK:: 200 OK
-  #     PARTIAL_CONTENT:: 206 Partial Content
-  #     MULTIPLE_CHOICES:: 300 Multiple Choices
-  #     MOVED:: 301 Moved Permanently
-  #     REDIRECT:: 302 Found
-  #     NOT_MODIFIED:: 304 Not Modified
-  #     BAD_REQUEST:: 400 Bad Request
-  #     AUTH_REQUIRED:: 401 Authorization Required
-  #     FORBIDDEN:: 403 Forbidden
-  #     NOT_FOUND:: 404 Not Found
-  #     METHOD_NOT_ALLOWED:: 405 Method Not Allowed
-  #     NOT_ACCEPTABLE:: 406 Not Acceptable
-  #     LENGTH_REQUIRED:: 411 Length Required
-  #     PRECONDITION_FAILED:: 412 Precondition Failed
-  #     SERVER_ERROR:: 500 Internal Server Error
-  #     NOT_IMPLEMENTED:: 501 Method Not Implemented
-  #     BAD_GATEWAY:: 502 Bad Gateway
-  #     VARIANT_ALSO_VARIES:: 506 Variant Also Negotiates
-  #
-  #   server:: The server software, returned as the Server header.
-  #   connection:: The connection type, returned as the Connection header (for
-  #                instance, "close".
-  #   length:: The length of the content that will be sent, returned as the
-  #            Content-Length header.
-  #   language:: The language of the content, returned as the Content-Language
-  #              header.
-  #   expires:: The time on which the current content expires, as a +Time+
-  #             object, returned as the Expires header.
-  #   cookie::
-  #     A cookie or cookies, returned as one or more Set-Cookie headers.  The
-  #     value can be the literal string of the cookie; a CGI::Cookie object;
-  #     an Array of literal cookie strings or Cookie objects; or a hash all of
-  #     whose values are literal cookie strings or Cookie objects.
-  #
-  #     These cookies are in addition to the cookies held in the
-  #     @output_cookies field.
-  #
-  #   Other headers can also be set; they are appended as key: value.
-  #
-  # Examples:
-  #
-  #   http_header
-  #     # Content-Type: text/html
-  #
-  #   http_header("text/plain")
-  #     # Content-Type: text/plain
-  #
-  #   http_header("nph"        => true,
-  #               "status"     => "OK",  # == "200 OK"
-  #                 # "status"     => "200 GOOD",
-  #               "server"     => ENV['SERVER_SOFTWARE'],
-  #               "connection" => "close",
-  #               "type"       => "text/html",
-  #               "charset"    => "iso-2022-jp",
-  #                 # Content-Type: text/html; charset=iso-2022-jp
-  #               "length"     => 103,
-  #               "language"   => "ja",
-  #               "expires"    => Time.now + 30,
-  #               "cookie"     => [cookie1, cookie2],
-  #               "my_header1" => "my_value",
-  #               "my_header2" => "my_value")
-  #
-  # This method does not perform charset conversion.
-  def http_header(options='text/html')
-    if options.is_a?(String)
-      content_type = options
-      buf = _header_for_string(content_type)
-    elsif options.is_a?(Hash)
-      if options.size == 1 && options.has_key?('type')
-        content_type = options['type']
-        buf = _header_for_string(content_type)
-      else
-        buf = _header_for_hash(options.dup)
-      end
-    else
-      raise ArgumentError.new("expected String or Hash but got #{options.class}")
-    end
-    if defined?(MOD_RUBY)
-      _header_for_modruby(buf)
-      return ''
-    else
-      buf << EOL    # empty line of separator
-      return buf
-    end
-  end # http_header()
-
-  # This method is an alias for #http_header, when HTML5 tag maker is inactive.
-  #
-  # NOTE: use #http_header to create HTTP header blocks, this alias is only
-  # provided for backwards compatibility.
-  #
-  # Using #header with the HTML5 tag maker will create a <header> element.
-  alias :header :http_header
-
-  def _no_crlf_check(str)
-    if str
-      str = str.to_s
-      raise "A HTTP status or header field must not include CR and LF" if str =~ /[\r\n]/
-      str
-    else
-      nil
-    end
-  end
-  private :_no_crlf_check
-
-  def _header_for_string(content_type) #:nodoc:
-    buf = ''.dup
-    if nph?()
-      buf << "#{_no_crlf_check($CGI_ENV['SERVER_PROTOCOL']) || 'HTTP/1.0'} 200 OK#{EOL}"
-      buf << "Date: #{CGI.rfc1123_date(Time.now)}#{EOL}"
-      buf << "Server: #{_no_crlf_check($CGI_ENV['SERVER_SOFTWARE'])}#{EOL}"
-      buf << "Connection: close#{EOL}"
-    end
-    buf << "Content-Type: #{_no_crlf_check(content_type)}#{EOL}"
-    if @output_cookies
-      @output_cookies.each {|cookie| buf << "Set-Cookie: #{_no_crlf_check(cookie)}#{EOL}" }
-    end
-    return buf
-  end # _header_for_string
-  private :_header_for_string
-
-  def _header_for_hash(options)  #:nodoc:
-    buf = ''.dup
-    ## add charset to option['type']
-    options['type'] ||= 'text/html'
-    charset = options.delete('charset')
-    options['type'] += "; charset=#{charset}" if charset
-    ## NPH
-    options.delete('nph') if defined?(MOD_RUBY)
-    if options.delete('nph') || nph?()
-      protocol = _no_crlf_check($CGI_ENV['SERVER_PROTOCOL']) || 'HTTP/1.0'
-      status = options.delete('status')
-      status = HTTP_STATUS[status] || _no_crlf_check(status) || '200 OK'
-      buf << "#{protocol} #{status}#{EOL}"
-      buf << "Date: #{CGI.rfc1123_date(Time.now)}#{EOL}"
-      options['server'] ||= $CGI_ENV['SERVER_SOFTWARE'] || ''
-      options['connection'] ||= 'close'
-    end
-    ## common headers
-    status = options.delete('status')
-    buf << "Status: #{HTTP_STATUS[status] || _no_crlf_check(status)}#{EOL}" if status
-    server = options.delete('server')
-    buf << "Server: #{_no_crlf_check(server)}#{EOL}" if server
-    connection = options.delete('connection')
-    buf << "Connection: #{_no_crlf_check(connection)}#{EOL}" if connection
-    type = options.delete('type')
-    buf << "Content-Type: #{_no_crlf_check(type)}#{EOL}" #if type
-    length = options.delete('length')
-    buf << "Content-Length: #{_no_crlf_check(length)}#{EOL}" if length
-    language = options.delete('language')
-    buf << "Content-Language: #{_no_crlf_check(language)}#{EOL}" if language
-    expires = options.delete('expires')
-    buf << "Expires: #{CGI.rfc1123_date(expires)}#{EOL}" if expires
-    ## cookie
-    if cookie = options.delete('cookie')
-      case cookie
-      when String, Cookie
-        buf << "Set-Cookie: #{_no_crlf_check(cookie)}#{EOL}"
-      when Array
-        arr = cookie
-        arr.each {|c| buf << "Set-Cookie: #{_no_crlf_check(c)}#{EOL}" }
-      when Hash
-        hash = cookie
-        hash.each_value {|c| buf << "Set-Cookie: #{_no_crlf_check(c)}#{EOL}" }
-      end
-    end
-    if @output_cookies
-      @output_cookies.each {|c| buf << "Set-Cookie: #{_no_crlf_check(c)}#{EOL}" }
-    end
-    ## other headers
-    options.each do |key, value|
-      buf << "#{_no_crlf_check(key)}: #{_no_crlf_check(value)}#{EOL}"
-    end
-    return buf
-  end # _header_for_hash
-  private :_header_for_hash
-
-  def nph?  #:nodoc:
-    return /IIS\/(\d+)/ =~ $CGI_ENV['SERVER_SOFTWARE'] && $1.to_i < 5
-  end
-
-  def _header_for_modruby(buf)  #:nodoc:
-    request = Apache::request
-    buf.scan(/([^:]+): (.+)#{EOL}/o) do |name, value|
-      $stderr.printf("name:%s value:%s\n", name, value) if $DEBUG
-      case name
-      when 'Set-Cookie'
-        request.headers_out.add(name, value)
-      when /^status$/i
-        request.status_line = value
-        request.status = value.to_i
-      when /^content-type$/i
-        request.content_type = value
-      when /^content-encoding$/i
-        request.content_encoding = value
-      when /^location$/i
-        request.status = 302 if request.status == 200
-        request.headers_out[name] = value
-      else
-        request.headers_out[name] = value
-      end
-    end
-    request.send_http_header
-    return ''
-  end
-  private :_header_for_modruby
-
-  # Print an HTTP header and body to $DEFAULT_OUTPUT ($>)
-  #
-  # :call-seq:
-  #   cgi.out(content_type_string='text/html')
-  #   cgi.out(headers_hash)
-  #
-  # +content_type_string+::
-  #   If a string is passed, it is assumed to be the content type.
-  # +headers_hash+::
-  #   This is a Hash of headers, similar to that used by #http_header.
-  # +block+::
-  #   A block is required and should evaluate to the body of the response.
-  #
-  # <tt>Content-Length</tt> is automatically calculated from the size of
-  # the String returned by the content block.
-  #
-  # If <tt>ENV['REQUEST_METHOD'] == "HEAD"</tt>, then only the header
-  # is output (the content block is still required, but it is ignored).
-  #
-  # If the charset is "iso-2022-jp" or "euc-jp" or "shift_jis" then the
-  # content is converted to this charset, and the language is set to "ja".
-  #
-  # Example:
-  #
-  #   cgi = CGI.new
-  #   cgi.out{ "string" }
-  #     # Content-Type: text/html
-  #     # Content-Length: 6
-  #     #
-  #     # string
-  #
-  #   cgi.out("text/plain") { "string" }
-  #     # Content-Type: text/plain
-  #     # Content-Length: 6
-  #     #
-  #     # string
-  #
-  #   cgi.out("nph"        => true,
-  #           "status"     => "OK",  # == "200 OK"
-  #           "server"     => ENV['SERVER_SOFTWARE'],
-  #           "connection" => "close",
-  #           "type"       => "text/html",
-  #           "charset"    => "iso-2022-jp",
-  #             # Content-Type: text/html; charset=iso-2022-jp
-  #           "language"   => "ja",
-  #           "expires"    => Time.now + (3600 * 24 * 30),
-  #           "cookie"     => [cookie1, cookie2],
-  #           "my_header1" => "my_value",
-  #           "my_header2" => "my_value") { "string" }
-  #      # HTTP/1.1 200 OK
-  #      # Date: Sun, 15 May 2011 17:35:54 GMT
-  #      # Server: Apache 2.2.0
-  #      # Connection: close
-  #      # Content-Type: text/html; charset=iso-2022-jp
-  #      # Content-Length: 6
-  #      # Content-Language: ja
-  #      # Expires: Tue, 14 Jun 2011 17:35:54 GMT
-  #      # Set-Cookie: foo
-  #      # Set-Cookie: bar
-  #      # my_header1: my_value
-  #      # my_header2: my_value
-  #      #
-  #      # string
-  def out(options = "text/html") # :yield:
-
-    options = { "type" => options } if options.kind_of?(String)
-    content = yield
-    options["length"] = content.bytesize.to_s
-    output = stdoutput
-    output.binmode if defined? output.binmode
-    output.print http_header(options)
-    output.print content unless "HEAD" == env_table['REQUEST_METHOD']
-  end
-
-
-  # Print an argument or list of arguments to the default output stream
-  #
-  #   cgi = CGI.new
-  #   cgi.print    # default:  cgi.print == $DEFAULT_OUTPUT.print
-  def print(*options)
-    stdoutput.print(*options)
-  end
-
-  # Parse an HTTP query string into a hash of key=>value pairs.
-  #
-  #   params = CGI.parse("query_string")
-  #     # {"name1" => ["value1", "value2", ...],
-  #     #  "name2" => ["value1", "value2", ...], ... }
-  #
-  def self.parse(query)
-    params = {}
-    query.split(/[&;]/).each do |pairs|
-      key, value = pairs.split('=',2).collect{|v| CGI.unescape(v) }
-
-      next unless key
-
-      params[key] ||= []
-      params[key].push(value) if value
-    end
-
-    params.default=[].freeze
-    params
-  end
-
-  # Maximum content length of post data
-  ##MAX_CONTENT_LENGTH  = 2 * 1024 * 1024
-
-  # Maximum number of request parameters when multipart
-  MAX_MULTIPART_COUNT = 128
-
-  # Mixin module that provides the following:
-  #
-  # 1. Access to the CGI environment variables as methods.  See
-  #    documentation to the CGI class for a list of these variables.  The
-  #    methods are exposed by removing the leading +HTTP_+ (if it exists) and
-  #    downcasing the name.  For example, +auth_type+ will return the
-  #    environment variable +AUTH_TYPE+, and +accept+ will return the value
-  #    for +HTTP_ACCEPT+.
-  #
-  # 2. Access to cookies, including the cookies attribute.
-  #
-  # 3. Access to parameters, including the params attribute, and overloading
-  #    #[] to perform parameter value lookup by key.
-  #
-  # 4. The initialize_query method, for initializing the above
-  #    mechanisms, handling multipart forms, and allowing the
-  #    class to be used in "offline" mode.
-  #
-  module QueryExtension
-
-    %w[ CONTENT_LENGTH SERVER_PORT ].each do |env|
-      define_method(env.delete_prefix('HTTP_').downcase) do
-        (val = env_table[env]) && Integer(val)
-      end
-    end
-
-    %w[ AUTH_TYPE CONTENT_TYPE GATEWAY_INTERFACE PATH_INFO
-        PATH_TRANSLATED QUERY_STRING REMOTE_ADDR REMOTE_HOST
-        REMOTE_IDENT REMOTE_USER REQUEST_METHOD SCRIPT_NAME
-        SERVER_NAME SERVER_PROTOCOL SERVER_SOFTWARE
-
-        HTTP_ACCEPT HTTP_ACCEPT_CHARSET HTTP_ACCEPT_ENCODING
-        HTTP_ACCEPT_LANGUAGE HTTP_CACHE_CONTROL HTTP_FROM HTTP_HOST
-        HTTP_NEGOTIATE HTTP_PRAGMA HTTP_REFERER HTTP_USER_AGENT ].each do |env|
-      define_method(env.delete_prefix('HTTP_').downcase) do
-        env_table[env]
-      end
-    end
-
-    # Get the raw cookies as a string.
-    def raw_cookie
-      env_table["HTTP_COOKIE"]
-    end
-
-    # Get the raw RFC2965 cookies as a string.
-    def raw_cookie2
-      env_table["HTTP_COOKIE2"]
-    end
-
-    # Get the cookies as a hash of cookie-name=>Cookie pairs.
-    attr_accessor :cookies
-
-    # Get the parameters as a hash of name=>values pairs, where
-    # values is an Array.
-    attr_reader :params
-
-    # Get the uploaded files as a hash of name=>values pairs
-    attr_reader :files
-
-    # Set all the parameters.
-    def params=(hash)
-      @params.clear
-      @params.update(hash)
-    end
-
-    ##
-    # Parses multipart form elements according to
-    #   http://www.w3.org/TR/html401/interact/forms.html#h-17.13.4.2
-    #
-    # Returns a hash of multipart form parameters with bodies of type StringIO or
-    # Tempfile depending on whether the multipart form element exceeds 10 KB
-    #
-    #   params[name => body]
-    #
-    def read_multipart(boundary, content_length)
-      ## read first boundary
-      stdin = stdinput
-      first_line = "--#{boundary}#{EOL}"
-      content_length -= first_line.bytesize
-      status = stdin.read(first_line.bytesize)
-      raise EOFError.new("no content body")  unless status
-      raise EOFError.new("bad content body") unless first_line == status
-      ## parse and set params
-      params = {}
-      @files = {}
-      boundary_rexp = /--#{Regexp.quote(boundary)}(#{EOL}|--)/
-      boundary_size = "#{EOL}--#{boundary}#{EOL}".bytesize
-      buf = ''.dup
-      bufsize = 10 * 1024
-      max_count = MAX_MULTIPART_COUNT
-      n = 0
-      tempfiles = []
-      while true
-        (n += 1) < max_count or raise StandardError.new("too many parameters.")
-        ## create body (StringIO or Tempfile)
-        body = create_body(bufsize < content_length)
-        tempfiles << body if defined?(Tempfile) && body.kind_of?(Tempfile)
-        class << body
-          if method_defined?(:path)
-            alias local_path path
-          else
-            def local_path
-              nil
-            end
-          end
-          attr_reader :original_filename, :content_type
-        end
-        ## find head and boundary
-        head = nil
-        separator = EOL * 2
-        until head && matched = boundary_rexp.match(buf)
-          if !head && pos = buf.index(separator)
-            len  = pos + EOL.bytesize
-            head = buf[0, len]
-            buf  = buf[(pos+separator.bytesize)..-1]
-          else
-            if head && buf.size > boundary_size
-              len = buf.size - boundary_size
-              body.print(buf[0, len])
-              buf[0, len] = ''
-            end
-            c = stdin.read(bufsize < content_length ? bufsize : content_length)
-            raise EOFError.new("bad content body") if c.nil? || c.empty?
-            buf << c
-            content_length -= c.bytesize
-          end
-        end
-        ## read to end of boundary
-        m = matched
-        len = m.begin(0)
-        s = buf[0, len]
-        if s =~ /(\r?\n)\z/
-          s = buf[0, len - $1.bytesize]
-        end
-        body.print(s)
-        buf = buf[m.end(0)..-1]
-        boundary_end = m[1]
-        content_length = -1 if boundary_end == '--'
-        ## reset file cursor position
-        body.rewind
-        ## original filename
-        /Content-Disposition:.* filename=(?:"(.*?)"|([^;\r\n]*))/i.match(head)
-        filename = $1 || $2 || ''.dup
-        filename = CGI.unescape(filename) if unescape_filename?()
-        body.instance_variable_set(:@original_filename, filename)
-        ## content type
-        /Content-Type: (.*)/i.match(head)
-        (content_type = $1 || ''.dup).chomp!
-        body.instance_variable_set(:@content_type, content_type)
-        ## query parameter name
-        /Content-Disposition:.* name=(?:"(.*?)"|([^;\r\n]*))/i.match(head)
-        name = $1 || $2 || ''
-        if body.original_filename.empty?
-          value=body.read.dup.force_encoding(@accept_charset)
-          body.close! if defined?(Tempfile) && body.kind_of?(Tempfile)
-          (params[name] ||= []) << value
-          unless value.valid_encoding?
-            if @accept_charset_error_block
-              @accept_charset_error_block.call(name,value)
-            else
-              raise InvalidEncoding,"Accept-Charset encoding error"
-            end
-          end
-          class << params[name].last;self;end.class_eval do
-            define_method(:read){self}
-            define_method(:original_filename){""}
-            define_method(:content_type){""}
-          end
-        else
-          (params[name] ||= []) << body
-          @files[name]=body
-        end
-        ## break loop
-        break if content_length == -1
-      end
-      raise EOFError, "bad boundary end of body part" unless boundary_end =~ /--/
-      params.default = []
-      params
-    rescue Exception
-      if tempfiles
-        tempfiles.each {|t|
-          if t.path
-            t.close!
-          end
-        }
-      end
-      raise
-    end # read_multipart
-    private :read_multipart
-    def create_body(is_large)  #:nodoc:
-      if is_large
-        require 'tempfile'
-        body = Tempfile.new('CGI', encoding: Encoding::ASCII_8BIT)
-      else
-        begin
-          require 'stringio'
-          body = StringIO.new("".b)
-        rescue LoadError
-          require 'tempfile'
-          body = Tempfile.new('CGI', encoding: Encoding::ASCII_8BIT)
-        end
-      end
-      body.binmode if defined? body.binmode
-      return body
-    end
-    def unescape_filename?  #:nodoc:
-      user_agent = $CGI_ENV['HTTP_USER_AGENT']
-      return false unless user_agent
-      return /Mac/i.match(user_agent) && /Mozilla/i.match(user_agent) && !/MSIE/i.match(user_agent)
-    end
-
-    # offline mode. read name=value pairs on standard input.
-    def read_from_cmdline
-      require "shellwords"
-
-      string = unless ARGV.empty?
-        ARGV.join(' ')
-      else
-        if STDIN.tty?
-          STDERR.print(
-            %|(offline mode: enter name=value pairs on standard input)\n|
-          )
-        end
-        array = readlines rescue nil
-        if not array.nil?
-            array.join(' ').gsub(/\n/n, '')
-        else
-            ""
-        end
-      end.gsub(/\\=/n, '%3D').gsub(/\\&/n, '%26')
-
-      words = Shellwords.shellwords(string)
-
-      if words.find{|x| /=/n.match(x) }
-        words.join('&')
-      else
-        words.join('+')
-      end
-    end
-    private :read_from_cmdline
-
-    # A wrapper class to use a StringIO object as the body and switch
-    # to a TempFile when the passed threshold is passed.
-    # Initialize the data from the query.
-    #
-    # Handles multipart forms (in particular, forms that involve file uploads).
-    # Reads query parameters in the @params field, and cookies into @cookies.
-    def initialize_query()
-      if ("POST" == env_table['REQUEST_METHOD']) and
-        %r|\Amultipart/form-data.*boundary=\"?([^\";,]+)\"?| =~ env_table['CONTENT_TYPE']
-        current_max_multipart_length = @max_multipart_length.respond_to?(:call) ? @max_multipart_length.call : @max_multipart_length
-        raise StandardError.new("too large multipart data.") if env_table['CONTENT_LENGTH'].to_i > current_max_multipart_length
-        boundary = $1.dup
-        @multipart = true
-        @params = read_multipart(boundary, Integer(env_table['CONTENT_LENGTH']))
-      else
-        @multipart = false
-        @params = CGI.parse(
-                    case env_table['REQUEST_METHOD']
-                    when "GET", "HEAD"
-                      if defined?(MOD_RUBY)
-                        Apache::request.args or ""
-                      else
-                        env_table['QUERY_STRING'] or ""
-                      end
-                    when "POST"
-                      stdinput.binmode if defined? stdinput.binmode
-                      stdinput.read(Integer(env_table['CONTENT_LENGTH'])) or ''
-                    else
-                      read_from_cmdline
-                    end.dup.force_encoding(@accept_charset)
-                  )
-        unless Encoding.find(@accept_charset) == Encoding::ASCII_8BIT
-          @params.each do |key,values|
-            values.each do |value|
-              unless value.valid_encoding?
-                if @accept_charset_error_block
-                  @accept_charset_error_block.call(key,value)
-                else
-                  raise InvalidEncoding,"Accept-Charset encoding error"
-                end
-              end
-            end
-          end
-        end
-      end
-
-      @cookies = CGI::Cookie.parse((env_table['HTTP_COOKIE'] or env_table['COOKIE']))
-    end
-    private :initialize_query
-
-    # Returns whether the form contained multipart/form-data
-    def multipart?
-      @multipart
-    end
-
-    # Get the value for the parameter with a given key.
-    #
-    # If the parameter has multiple values, only the first will be
-    # retrieved; use #params to get the array of values.
-    def [](key)
-      params = @params[key]
-      return '' unless params
-      value = params[0]
-      if @multipart
-        if value
-          return value
-        elsif defined? StringIO
-          StringIO.new("".b)
-        else
-          Tempfile.new("CGI",encoding: Encoding::ASCII_8BIT)
-        end
-      else
-        str = if value then value.dup else "" end
-        str
-      end
-    end
-
-    # Return all query parameter names as an array of String.
-    def keys(*args)
-      @params.keys(*args)
-    end
-
-    # Returns true if a given query string parameter exists.
-    def has_key?(*args)
-      @params.has_key?(*args)
-    end
-    alias key? has_key?
-    alias include? has_key?
-
-  end # QueryExtension
-
-  # Exception raised when there is an invalid encoding detected
-  class InvalidEncoding < Exception; end
-
-  # @@accept_charset is default accept character set.
-  # This default value default is "UTF-8"
-  # If you want to change the default accept character set
-  # when create a new CGI instance, set this:
-  #
-  #   CGI.accept_charset = "EUC-JP"
-  #
-  @@accept_charset="UTF-8" if false # needed for rdoc?
-
-  # Return the accept character set for all new CGI instances.
-  def self.accept_charset
-    @@accept_charset
-  end
-
-  # Set the accept character set for all new CGI instances.
-  def self.accept_charset=(accept_charset)
-    @@accept_charset=accept_charset
-  end
-
-  # Return the accept character set for this CGI instance.
-  attr_reader :accept_charset
-
-  # @@max_multipart_length is the maximum length of multipart data.
-  # The default value is 128 * 1024 * 1024 bytes
-  #
-  # The default can be set to something else in the CGI constructor,
-  # via the :max_multipart_length key in the option hash.
-  #
-  # See CGI.new documentation.
-  #
-  @@max_multipart_length= 128 * 1024 * 1024
-
-  # Create a new CGI instance.
-  #
-  # :call-seq:
-  #   CGI.new(tag_maker) { block }
-  #   CGI.new(options_hash = {}) { block }
-  #
-  #
-  # <tt>tag_maker</tt>::
-  #   This is the same as using the +options_hash+ form with the value <tt>{
-  #   :tag_maker => tag_maker }</tt> Note that it is recommended to use the
-  #   +options_hash+ form, since it also allows you specify the charset you
-  #   will accept.
-  # <tt>options_hash</tt>::
-  #   A Hash that recognizes three options:
-  #
-  #   <tt>:accept_charset</tt>::
-  #     specifies encoding of received query string.  If omitted,
-  #     <tt>@@accept_charset</tt> is used.  If the encoding is not valid, a
-  #     CGI::InvalidEncoding will be raised.
-  #
-  #     Example. Suppose <tt>@@accept_charset</tt> is "UTF-8"
-  #
-  #     when not specified:
-  #
-  #         cgi=CGI.new      # @accept_charset # => "UTF-8"
-  #
-  #     when specified as "EUC-JP":
-  #
-  #         cgi=CGI.new(:accept_charset => "EUC-JP") # => "EUC-JP"
-  #
-  #   <tt>:tag_maker</tt>::
-  #     String that specifies which version of the HTML generation methods to
-  #     use.  If not specified, no HTML generation methods will be loaded.
-  #
-  #     The following values are supported:
-  #
-  #     "html3":: HTML 3.x
-  #     "html4":: HTML 4.0
-  #     "html4Tr":: HTML 4.0 Transitional
-  #     "html4Fr":: HTML 4.0 with Framesets
-  #     "html5":: HTML 5
-  #
-  #   <tt>:max_multipart_length</tt>::
-  #     Specifies maximum length of multipart data. Can be an Integer scalar or
-  #     a lambda, that will be evaluated when the request is parsed. This
-  #     allows more complex logic to be set when determining whether to accept
-  #     multipart data (e.g. consult a registered users upload allowance)
-  #
-  #     Default is 128 * 1024 * 1024 bytes
-  #
-  #         cgi=CGI.new(:max_multipart_length => 268435456) # simple scalar
-  #
-  #         cgi=CGI.new(:max_multipart_length => -> {check_filesystem}) # lambda
-  #
-  # <tt>block</tt>::
-  #   If provided, the block is called when an invalid encoding is
-  #   encountered. For example:
-  #
-  #     encoding_errors={}
-  #     cgi=CGI.new(:accept_charset=>"EUC-JP") do |name,value|
-  #       encoding_errors[name] = value
-  #     end
-  #
-  # Finally, if the CGI object is not created in a standard CGI call
-  # environment (that is, it can't locate REQUEST_METHOD in its environment),
-  # then it will run in "offline" mode.  In this mode, it reads its parameters
-  # from the command line or (failing that) from standard input.  Otherwise,
-  # cookies and other parameters are parsed automatically from the standard
-  # CGI locations, which varies according to the REQUEST_METHOD.
-  def initialize(options = {}, &block) # :yields: name, value
-    @accept_charset_error_block = block_given? ? block : nil
-    @options={
-      :accept_charset=>@@accept_charset,
-      :max_multipart_length=>@@max_multipart_length
-    }
-    case options
-    when Hash
-      @options.merge!(options)
-    when String
-      @options[:tag_maker]=options
-    end
-    @accept_charset=@options[:accept_charset]
-    @max_multipart_length=@options[:max_multipart_length]
-    if defined?(MOD_RUBY) && !ENV.key?("GATEWAY_INTERFACE")
-      Apache.request.setup_cgi_env
-    end
-
-    extend QueryExtension
-    @multipart = false
-
-    initialize_query()  # set @params, @cookies
-    @output_cookies = nil
-    @output_hidden = nil
-
-    case @options[:tag_maker]
-    when "html3"
-      require_relative 'html'
-      extend Html3
-      extend HtmlExtension
-    when "html4"
-      require_relative 'html'
-      extend Html4
-      extend HtmlExtension
-    when "html4Tr"
-      require_relative 'html'
-      extend Html4Tr
-      extend HtmlExtension
-    when "html4Fr"
-      require_relative 'html'
-      extend Html4Tr
-      extend Html4Fr
-      extend HtmlExtension
-    when "html5"
-      require_relative 'html'
-      extend Html5
-      extend HtmlExtension
-    end
-  end
-
-end   # class CGI
diff --git a/lib/cgi/escape.rb b/lib/cgi/escape.rb
new file mode 100644
index 0000000000..555d24a5da
--- /dev/null
+++ b/lib/cgi/escape.rb
@@ -0,0 +1,232 @@
+# frozen_string_literal: true
+
+# Since Ruby 4.0, \CGI is a small holder for various escaping methods, included from CGI::Escape
+#
+#    require 'cgi/escape'
+#
+#    CGI.escape("Ruby programming language")
+#    #=> "Ruby+programming+language"
+#    CGI.escapeURIComponent("Ruby programming language")
+#    #=> "Ruby%20programming%20language"
+#
+# See CGI::Escape module for methods list and their description.
+class CGI
+  module Escape; end
+  include Escape
+  extend Escape
+  module EscapeExt; end # :nodoc:
+end
+
+# Web-related escape/unescape functionality.
+module CGI::Escape
+  @@accept_charset = Encoding::UTF_8 unless defined?(@@accept_charset)
+
+  # URL-encode a string into application/x-www-form-urlencoded.
+  # Space characters (<tt>" "</tt>) are encoded with plus signs (<tt>"+"</tt>)
+  #   url_encoded_string = CGI.escape("'Stop!' said Fred")
+  #      # => "%27Stop%21%27+said+Fred"
+  def escape(string)
+    encoding = string.encoding
+    buffer = string.b
+    buffer.gsub!(/([^ a-zA-Z0-9_.\-~]+)/) do |m|
+      '%' + m.unpack('H2' * m.bytesize).join('%').upcase
+    end
+    buffer.tr!(' ', '+')
+    buffer.force_encoding(encoding)
+  end
+
+  # URL-decode an application/x-www-form-urlencoded string with encoding(optional).
+  #   string = CGI.unescape("%27Stop%21%27+said+Fred")
+  #      # => "'Stop!' said Fred"
+  def unescape(string, encoding = @@accept_charset)
+    str = string.tr('+', ' ')
+    str = str.b
+    str.gsub!(/((?:%[0-9a-fA-F]{2})+)/) do |m|
+      [m.delete('%')].pack('H*')
+    end
+    str.force_encoding(encoding)
+    str.valid_encoding? ? str : str.force_encoding(string.encoding)
+  end
+
+  # URL-encode a string following RFC 3986
+  # Space characters (<tt>" "</tt>) are encoded with (<tt>"%20"</tt>)
+  #   url_encoded_string = CGI.escapeURIComponent("'Stop!' said Fred")
+  #      # => "%27Stop%21%27%20said%20Fred"
+  def escapeURIComponent(string)
+    encoding = string.encoding
+    buffer = string.b
+    buffer.gsub!(/([^a-zA-Z0-9_.\-~]+)/) do |m|
+      '%' + m.unpack('H2' * m.bytesize).join('%').upcase
+    end
+    buffer.force_encoding(encoding)
+  end
+  alias escape_uri_component escapeURIComponent
+
+  # URL-decode a string following RFC 3986 with encoding(optional).
+  #   string = CGI.unescapeURIComponent("%27Stop%21%27+said%20Fred")
+  #      # => "'Stop!'+said Fred"
+  def unescapeURIComponent(string, encoding = @@accept_charset)
+    str = string.b
+    str.gsub!(/((?:%[0-9a-fA-F]{2})+)/) do |m|
+      [m.delete('%')].pack('H*')
+    end
+    str.force_encoding(encoding)
+    str.valid_encoding? ? str : str.force_encoding(string.encoding)
+  end
+
+  alias unescape_uri_component unescapeURIComponent
+
+  # The set of special characters and their escaped values
+  TABLE_FOR_ESCAPE_HTML__ = { # :nodoc:
+    "'" => '&#39;',
+    '&' => '&amp;',
+    '"' => '&quot;',
+    '<' => '&lt;',
+    '>' => '&gt;',
+  }
+
+  # \Escape special characters in HTML, namely <tt>'&\"<></tt>
+  #   CGI.escapeHTML('Usage: foo "bar" <baz>')
+  #      # => "Usage: foo &quot;bar&quot; &lt;baz&gt;"
+  def escapeHTML(string)
+    enc = string.encoding
+    unless enc.ascii_compatible?
+      if enc.dummy?
+        origenc = enc
+        enc = Encoding::Converter.asciicompat_encoding(enc)
+        string = enc ? string.encode(enc) : string.b
+      end
+      table = Hash[TABLE_FOR_ESCAPE_HTML__.map {|pair|pair.map {|s|s.encode(enc)}}]
+      string = string.gsub(/#{"['&\"<>]".encode(enc)}/, table)
+      string.encode!(origenc) if origenc
+      string
+    else
+      string = string.b
+      string.gsub!(/['&\"<>]/, TABLE_FOR_ESCAPE_HTML__)
+      string.force_encoding(enc)
+    end
+  end
+
+  # Unescape a string that has been HTML-escaped
+  #   CGI.unescapeHTML("Usage: foo &quot;bar&quot; &lt;baz&gt;")
+  #      # => "Usage: foo \"bar\" <baz>"
+  def unescapeHTML(string)
+    enc = string.encoding
+    unless enc.ascii_compatible?
+      if enc.dummy?
+        origenc = enc
+        enc = Encoding::Converter.asciicompat_encoding(enc)
+        string = enc ? string.encode(enc) : string.b
+      end
+      string = string.gsub(Regexp.new('&(apos|amp|quot|gt|lt|#[0-9]+|#x[0-9A-Fa-f]+);'.encode(enc))) do
+        case $1.encode(Encoding::US_ASCII)
+        when 'apos'                then "'".encode(enc)
+        when 'amp'                 then '&'.encode(enc)
+        when 'quot'                then '"'.encode(enc)
+        when 'gt'                  then '>'.encode(enc)
+        when 'lt'                  then '<'.encode(enc)
+        when /\A#0*(\d+)\z/        then $1.to_i.chr(enc)
+        when /\A#x([0-9a-f]+)\z/i  then $1.hex.chr(enc)
+        end
+      end
+      string.encode!(origenc) if origenc
+      return string
+    end
+    return string unless string.include? '&'
+    charlimit = case enc
+                when Encoding::UTF_8; 0x10ffff
+                when Encoding::ISO_8859_1; 256
+                else 128
+                end
+    string = string.b
+    string.gsub!(/&(apos|amp|quot|gt|lt|\#[0-9]+|\#[xX][0-9A-Fa-f]+);/) do
+      match = $1.dup
+      case match
+      when 'apos'                then "'"
+      when 'amp'                 then '&'
+      when 'quot'                then '"'
+      when 'gt'                  then '>'
+      when 'lt'                  then '<'
+      when /\A#0*(\d+)\z/
+        n = $1.to_i
+        if n < charlimit
+          n.chr(enc)
+        else
+          "&##{$1};"
+        end
+      when /\A#x([0-9a-f]+)\z/i
+        n = $1.hex
+        if n < charlimit
+          n.chr(enc)
+        else
+          "&#x#{$1};"
+        end
+      else
+        "&#{match};"
+      end
+    end
+    string.force_encoding enc
+  end
+
+  alias escape_html escapeHTML
+  alias h escapeHTML
+
+  alias unescape_html unescapeHTML
+
+  # TruffleRuby runs the pure-Ruby variant faster, do not use the C extension there
+  unless RUBY_ENGINE == 'truffleruby'
+    begin
+      require 'cgi/escape.so'
+    rescue LoadError
+    end
+  end
+
+  # \Escape only the tags of certain HTML elements in +string+.
+  #
+  # Takes an element or elements or array of elements.  Each element
+  # is specified by the name of the element, without angle brackets.
+  # This matches both the start and the end tag of that element.
+  # The attribute list of the open tag will also be escaped (for
+  # instance, the double-quotes surrounding attribute values).
+  #
+  #   print CGI.escapeElement('<BR><A HREF="url"></A>', "A", "IMG")
+  #     # "<BR>&lt;A HREF=&quot;url&quot;&gt;&lt;/A&gt"
+  #
+  #   print CGI.escapeElement('<BR><A HREF="url"></A>', ["A", "IMG"])
+  #     # "<BR>&lt;A HREF=&quot;url&quot;&gt;&lt;/A&gt"
+  def escapeElement(string, *elements)
+    elements = elements[0] if elements[0].kind_of?(Array)
+    unless elements.empty?
+      string.gsub(/<\/?(?:#{elements.join("|")})\b[^<>]*+>?/im) do
+        CGI.escapeHTML($&)
+      end
+    else
+      string
+    end
+  end
+
+  # Undo escaping such as that done by CGI.escapeElement
+  #
+  #   print CGI.unescapeElement(
+  #           CGI.escapeHTML('<BR><A HREF="url"></A>'), "A", "IMG")
+  #     # "&lt;BR&gt;<A HREF="url"></A>"
+  #
+  #   print CGI.unescapeElement(
+  #           CGI.escapeHTML('<BR><A HREF="url"></A>'), ["A", "IMG"])
+  #     # "&lt;BR&gt;<A HREF="url"></A>"
+  def unescapeElement(string, *elements)
+    elements = elements[0] if elements[0].kind_of?(Array)
+    unless elements.empty?
+      string.gsub(/&lt;\/?(?:#{elements.join("|")})\b(?>[^&]+|&(?![gl]t;)\w+;)*(?:&gt;)?/im) do
+        unescapeHTML($&)
+      end
+    else
+      string
+    end
+  end
+
+  alias escape_element escapeElement
+
+  alias unescape_element unescapeElement
+
+end
diff --git a/lib/cgi/html.rb b/lib/cgi/html.rb
deleted file mode 100644
index 1543943320..0000000000
--- a/lib/cgi/html.rb
+++ /dev/null
@@ -1,1035 +0,0 @@
-# frozen_string_literal: true
-class CGI
-  # Base module for HTML-generation mixins.
-  #
-  # Provides methods for code generation for tags following
-  # the various DTD element types.
-  module TagMaker # :nodoc:
-
-    # Generate code for an element with required start and end tags.
-    #
-    #   - -
-    def nn_element(element, attributes = {})
-      s = nOE_element(element, attributes)
-      if block_given?
-        s << yield.to_s
-      end
-      s << "</#{element.upcase}>"
-    end
-
-    def nn_element_def(attributes = {}, &block)
-      nn_element(__callee__, attributes, &block)
-    end
-
-    # Generate code for an empty element.
-    #
-    #   - O EMPTY
-    def nOE_element(element, attributes = {})
-      attributes={attributes=>nil} if attributes.kind_of?(String)
-      s = "<#{element.upcase}".dup
-      attributes.each do|name, value|
-        next unless value
-        s << " "
-        s << CGI.escapeHTML(name.to_s)
-        if value != true
-          s << '="'
-          s << CGI.escapeHTML(value.to_s)
-          s << '"'
-        end
-      end
-      s << ">"
-    end
-
-    def nOE_element_def(attributes = {}, &block)
-      nOE_element(__callee__, attributes, &block)
-    end
-
-
-    # Generate code for an element for which the end (and possibly the
-    # start) tag is optional.
-    #
-    #   O O or - O
-    def nO_element(element, attributes = {})
-      s = nOE_element(element, attributes)
-      if block_given?
-        s << yield.to_s
-        s << "</#{element.upcase}>"
-      end
-      s
-    end
-
-    def nO_element_def(attributes = {}, &block)
-      nO_element(__callee__, attributes, &block)
-    end
-
-  end # TagMaker
-
-
-  # Mixin module providing HTML generation methods.
-  #
-  # For example,
-  #   cgi.a("http://www.example.com") { "Example" }
-  #     # => "<A HREF=\"http://www.example.com\">Example</A>"
-  #
-  # Modules Html3, Html4, etc., contain more basic HTML-generation methods
-  # (+#title+, +#h1+, etc.).
-  #
-  # See class CGI for a detailed example.
-  #
-  module HtmlExtension
-
-
-    # Generate an Anchor element as a string.
-    #
-    # +href+ can either be a string, giving the URL
-    # for the HREF attribute, or it can be a hash of
-    # the element's attributes.
-    #
-    # The body of the element is the string returned by the no-argument
-    # block passed in.
-    #
-    #   a("http://www.example.com") { "Example" }
-    #     # => "<A HREF=\"http://www.example.com\">Example</A>"
-    #
-    #   a("HREF" => "http://www.example.com", "TARGET" => "_top") { "Example" }
-    #     # => "<A HREF=\"http://www.example.com\" TARGET=\"_top\">Example</A>"
-    #
-    def a(href = "") # :yield:
-      attributes = if href.kind_of?(String)
-                     { "HREF" => href }
-                   else
-                     href
-                   end
-      super(attributes)
-    end
-
-    # Generate a Document Base URI element as a String.
-    #
-    # +href+ can either by a string, giving the base URL for the HREF
-    # attribute, or it can be a has of the element's attributes.
-    #
-    # The passed-in no-argument block is ignored.
-    #
-    #   base("http://www.example.com/cgi")
-    #     # => "<BASE HREF=\"http://www.example.com/cgi\">"
-    def base(href = "") # :yield:
-      attributes = if href.kind_of?(String)
-                     { "HREF" => href }
-                   else
-                     href
-                   end
-      super(attributes)
-    end
-
-    # Generate a BlockQuote element as a string.
-    #
-    # +cite+ can either be a string, give the URI for the source of
-    # the quoted text, or a hash, giving all attributes of the element,
-    # or it can be omitted, in which case the element has no attributes.
-    #
-    # The body is provided by the passed-in no-argument block
-    #
-    #   blockquote("http://www.example.com/quotes/foo.html") { "Foo!" }
-    #     #=> "<BLOCKQUOTE CITE=\"http://www.example.com/quotes/foo.html\">Foo!</BLOCKQUOTE>
-    def blockquote(cite = {})  # :yield:
-      attributes = if cite.kind_of?(String)
-                     { "CITE" => cite }
-                   else
-                     cite
-                   end
-      super(attributes)
-    end
-
-
-    # Generate a Table Caption element as a string.
-    #
-    # +align+ can be a string, giving the alignment of the caption
-    # (one of top, bottom, left, or right).  It can be a hash of
-    # all the attributes of the element.  Or it can be omitted.
-    #
-    # The body of the element is provided by the passed-in no-argument block.
-    #
-    #   caption("left") { "Capital Cities" }
-    #     # => <CAPTION ALIGN=\"left\">Capital Cities</CAPTION>
-    def caption(align = {}) # :yield:
-      attributes = if align.kind_of?(String)
-                     { "ALIGN" => align }
-                   else
-                     align
-                   end
-      super(attributes)
-    end
-
-
-    # Generate a Checkbox Input element as a string.
-    #
-    # The attributes of the element can be specified as three arguments,
-    # +name+, +value+, and +checked+.  +checked+ is a boolean value;
-    # if true, the CHECKED attribute will be included in the element.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   checkbox("name")
-    #     # = checkbox("NAME" => "name")
-    #
-    #   checkbox("name", "value")
-    #     # = checkbox("NAME" => "name", "VALUE" => "value")
-    #
-    #   checkbox("name", "value", true)
-    #     # = checkbox("NAME" => "name", "VALUE" => "value", "CHECKED" => true)
-    def checkbox(name = "", value = nil, checked = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "checkbox", "NAME" => name,
-                       "VALUE" => value, "CHECKED" => checked }
-                   else
-                     name["TYPE"] = "checkbox"
-                     name
-                   end
-      input(attributes)
-    end
-
-    # Generate a sequence of checkbox elements, as a String.
-    #
-    # The checkboxes will all have the same +name+ attribute.
-    # Each checkbox is followed by a label.
-    # There will be one checkbox for each value.  Each value
-    # can be specified as a String, which will be used both
-    # as the value of the VALUE attribute and as the label
-    # for that checkbox.  A single-element array has the
-    # same effect.
-    #
-    # Each value can also be specified as a three-element array.
-    # The first element is the VALUE attribute; the second is the
-    # label; and the third is a boolean specifying whether this
-    # checkbox is CHECKED.
-    #
-    # Each value can also be specified as a two-element
-    # array, by omitting either the value element (defaults
-    # to the same as the label), or the boolean checked element
-    # (defaults to false).
-    #
-    #   checkbox_group("name", "foo", "bar", "baz")
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="foo">foo
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="bar">bar
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="baz">baz
-    #
-    #   checkbox_group("name", ["foo"], ["bar", true], "baz")
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="foo">foo
-    #     # <INPUT TYPE="checkbox" CHECKED NAME="name" VALUE="bar">bar
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="baz">baz
-    #
-    #   checkbox_group("name", ["1", "Foo"], ["2", "Bar", true], "Baz")
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="1">Foo
-    #     # <INPUT TYPE="checkbox" CHECKED NAME="name" VALUE="2">Bar
-    #     # <INPUT TYPE="checkbox" NAME="name" VALUE="Baz">Baz
-    #
-    #   checkbox_group("NAME" => "name",
-    #                    "VALUES" => ["foo", "bar", "baz"])
-    #
-    #   checkbox_group("NAME" => "name",
-    #                    "VALUES" => [["foo"], ["bar", true], "baz"])
-    #
-    #   checkbox_group("NAME" => "name",
-    #                    "VALUES" => [["1", "Foo"], ["2", "Bar", true], "Baz"])
-    def checkbox_group(name = "", *values)
-      if name.kind_of?(Hash)
-        values = name["VALUES"]
-        name = name["NAME"]
-      end
-      values.collect{|value|
-        if value.kind_of?(String)
-          checkbox(name, value) + value
-        else
-          if value[-1] == true || value[-1] == false
-            checkbox(name, value[0],  value[-1]) +
-            value[-2]
-          else
-            checkbox(name, value[0]) +
-            value[-1]
-          end
-        end
-      }.join
-    end
-
-
-    # Generate an File Upload Input element as a string.
-    #
-    # The attributes of the element can be specified as three arguments,
-    # +name+, +size+, and +maxlength+.  +maxlength+ is the maximum length
-    # of the file's _name_, not of the file's _contents_.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    # See #multipart_form() for forms that include file uploads.
-    #
-    #   file_field("name")
-    #     # <INPUT TYPE="file" NAME="name" SIZE="20">
-    #
-    #   file_field("name", 40)
-    #     # <INPUT TYPE="file" NAME="name" SIZE="40">
-    #
-    #   file_field("name", 40, 100)
-    #     # <INPUT TYPE="file" NAME="name" SIZE="40" MAXLENGTH="100">
-    #
-    #   file_field("NAME" => "name", "SIZE" => 40)
-    #     # <INPUT TYPE="file" NAME="name" SIZE="40">
-    def file_field(name = "", size = 20, maxlength = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "file", "NAME" => name,
-                       "SIZE" => size.to_s }
-                   else
-                     name["TYPE"] = "file"
-                     name
-                   end
-      attributes["MAXLENGTH"] = maxlength.to_s if maxlength
-      input(attributes)
-    end
-
-
-    # Generate a Form element as a string.
-    #
-    # +method+ should be either "get" or "post", and defaults to the latter.
-    # +action+ defaults to the current CGI script name.  +enctype+
-    # defaults to "application/x-www-form-urlencoded".
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    # See also #multipart_form() for forms that include file uploads.
-    #
-    #   form{ "string" }
-    #     # <FORM METHOD="post" ENCTYPE="application/x-www-form-urlencoded">string</FORM>
-    #
-    #   form("get") { "string" }
-    #     # <FORM METHOD="get" ENCTYPE="application/x-www-form-urlencoded">string</FORM>
-    #
-    #   form("get", "url") { "string" }
-    #     # <FORM METHOD="get" ACTION="url" ENCTYPE="application/x-www-form-urlencoded">string</FORM>
-    #
-    #   form("METHOD" => "post", "ENCTYPE" => "enctype") { "string" }
-    #     # <FORM METHOD="post" ENCTYPE="enctype">string</FORM>
-    def form(method = "post", action = script_name, enctype = "application/x-www-form-urlencoded")
-      attributes = if method.kind_of?(String)
-                     { "METHOD" => method, "ACTION" => action,
-                       "ENCTYPE" => enctype }
-                   else
-                     unless method.has_key?("METHOD")
-                       method["METHOD"] = "post"
-                     end
-                     unless method.has_key?("ENCTYPE")
-                       method["ENCTYPE"] = enctype
-                     end
-                     method
-                   end
-      if block_given?
-        body = yield
-      else
-        body = ""
-      end
-      if @output_hidden
-        body << @output_hidden.collect{|k,v|
-          "<INPUT TYPE=\"HIDDEN\" NAME=\"#{k}\" VALUE=\"#{v}\">"
-        }.join
-      end
-      super(attributes){body}
-    end
-
-    # Generate a Hidden Input element as a string.
-    #
-    # The attributes of the element can be specified as two arguments,
-    # +name+ and +value+.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   hidden("name")
-    #     # <INPUT TYPE="hidden" NAME="name">
-    #
-    #   hidden("name", "value")
-    #     # <INPUT TYPE="hidden" NAME="name" VALUE="value">
-    #
-    #   hidden("NAME" => "name", "VALUE" => "reset", "ID" => "foo")
-    #     # <INPUT TYPE="hidden" NAME="name" VALUE="value" ID="foo">
-    def hidden(name = "", value = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "hidden", "NAME" => name, "VALUE" => value }
-                   else
-                     name["TYPE"] = "hidden"
-                     name
-                   end
-      input(attributes)
-    end
-
-    # Generate a top-level HTML element as a string.
-    #
-    # The attributes of the element are specified as a hash.  The
-    # pseudo-attribute "PRETTY" can be used to specify that the generated
-    # HTML string should be indented.  "PRETTY" can also be specified as
-    # a string as the sole argument to this method.  The pseudo-attribute
-    # "DOCTYPE", if given, is used as the leading DOCTYPE SGML tag; it
-    # should include the entire text of this tag, including angle brackets.
-    #
-    # The body of the html element is supplied as a block.
-    #
-    #   html{ "string" }
-    #     # <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN"><HTML>string</HTML>
-    #
-    #   html("LANG" => "ja") { "string" }
-    #     # <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN"><HTML LANG="ja">string</HTML>
-    #
-    #   html("DOCTYPE" => false) { "string" }
-    #     # <HTML>string</HTML>
-    #
-    #   html("DOCTYPE" => '<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">') { "string" }
-    #     # <!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN"><HTML>string</HTML>
-    #
-    #   html("PRETTY" => "  ") { "<BODY></BODY>" }
-    #     # <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-    #     # <HTML>
-    #     #   <BODY>
-    #     #   </BODY>
-    #     # </HTML>
-    #
-    #   html("PRETTY" => "\t") { "<BODY></BODY>" }
-    #     # <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
-    #     # <HTML>
-    #     #         <BODY>
-    #     #         </BODY>
-    #     # </HTML>
-    #
-    #   html("PRETTY") { "<BODY></BODY>" }
-    #     # = html("PRETTY" => "  ") { "<BODY></BODY>" }
-    #
-    #   html(if $VERBOSE then "PRETTY" end) { "HTML string" }
-    #
-    def html(attributes = {}) # :yield:
-      if nil == attributes
-        attributes = {}
-      elsif "PRETTY" == attributes
-        attributes = { "PRETTY" => true }
-      end
-      pretty = attributes.delete("PRETTY")
-      pretty = "  " if true == pretty
-      buf = "".dup
-
-      if attributes.has_key?("DOCTYPE")
-        if attributes["DOCTYPE"]
-          buf << attributes.delete("DOCTYPE")
-        else
-          attributes.delete("DOCTYPE")
-        end
-      else
-        buf << doctype
-      end
-
-      buf << super(attributes)
-
-      if pretty
-        CGI.pretty(buf, pretty)
-      else
-        buf
-      end
-
-    end
-
-    # Generate an Image Button Input element as a string.
-    #
-    # +src+ is the URL of the image to use for the button.  +name+
-    # is the input name.  +alt+ is the alternative text for the image.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   image_button("url")
-    #     # <INPUT TYPE="image" SRC="url">
-    #
-    #   image_button("url", "name", "string")
-    #     # <INPUT TYPE="image" SRC="url" NAME="name" ALT="string">
-    #
-    #   image_button("SRC" => "url", "ALT" => "string")
-    #     # <INPUT TYPE="image" SRC="url" ALT="string">
-    def image_button(src = "", name = nil, alt = nil)
-      attributes = if src.kind_of?(String)
-                     { "TYPE" => "image", "SRC" => src, "NAME" => name,
-                       "ALT" => alt }
-                   else
-                     src["TYPE"] = "image"
-                     src["SRC"] ||= ""
-                     src
-                   end
-      input(attributes)
-    end
-
-
-    # Generate an Image element as a string.
-    #
-    # +src+ is the URL of the image.  +alt+ is the alternative text for
-    # the image.  +width+ is the width of the image, and +height+ is
-    # its height.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   img("src", "alt", 100, 50)
-    #     # <IMG SRC="src" ALT="alt" WIDTH="100" HEIGHT="50">
-    #
-    #   img("SRC" => "src", "ALT" => "alt", "WIDTH" => 100, "HEIGHT" => 50)
-    #     # <IMG SRC="src" ALT="alt" WIDTH="100" HEIGHT="50">
-    def img(src = "", alt = "", width = nil, height = nil)
-      attributes = if src.kind_of?(String)
-                     { "SRC" => src, "ALT" => alt }
-                   else
-                     src
-                   end
-      attributes["WIDTH"] = width.to_s if width
-      attributes["HEIGHT"] = height.to_s if height
-      super(attributes)
-    end
-
-
-    # Generate a Form element with multipart encoding as a String.
-    #
-    # Multipart encoding is used for forms that include file uploads.
-    #
-    # +action+ is the action to perform.  +enctype+ is the encoding
-    # type, which defaults to "multipart/form-data".
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   multipart_form{ "string" }
-    #     # <FORM METHOD="post" ENCTYPE="multipart/form-data">string</FORM>
-    #
-    #   multipart_form("url") { "string" }
-    #     # <FORM METHOD="post" ACTION="url" ENCTYPE="multipart/form-data">string</FORM>
-    def multipart_form(action = nil, enctype = "multipart/form-data")
-      attributes = if action == nil
-                     { "METHOD" => "post", "ENCTYPE" => enctype }
-                   elsif action.kind_of?(String)
-                     { "METHOD" => "post", "ACTION" => action,
-                       "ENCTYPE" => enctype }
-                   else
-                     unless action.has_key?("METHOD")
-                       action["METHOD"] = "post"
-                     end
-                     unless action.has_key?("ENCTYPE")
-                       action["ENCTYPE"] = enctype
-                     end
-                     action
-                   end
-      if block_given?
-        form(attributes){ yield }
-      else
-        form(attributes)
-      end
-    end
-
-
-    # Generate a Password Input element as a string.
-    #
-    # +name+ is the name of the input field.  +value+ is its default
-    # value.  +size+ is the size of the input field display.  +maxlength+
-    # is the maximum length of the inputted password.
-    #
-    # Alternatively, attributes can be specified as a hash.
-    #
-    #   password_field("name")
-    #     # <INPUT TYPE="password" NAME="name" SIZE="40">
-    #
-    #   password_field("name", "value")
-    #     # <INPUT TYPE="password" NAME="name" VALUE="value" SIZE="40">
-    #
-    #   password_field("password", "value", 80, 200)
-    #     # <INPUT TYPE="password" NAME="name" VALUE="value" SIZE="80" MAXLENGTH="200">
-    #
-    #   password_field("NAME" => "name", "VALUE" => "value")
-    #     # <INPUT TYPE="password" NAME="name" VALUE="value">
-    def password_field(name = "", value = nil, size = 40, maxlength = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "password", "NAME" => name,
-                       "VALUE" => value, "SIZE" => size.to_s }
-                   else
-                     name["TYPE"] = "password"
-                     name
-                   end
-      attributes["MAXLENGTH"] = maxlength.to_s if maxlength
-      input(attributes)
-    end
-
-    # Generate a Select element as a string.
-    #
-    # +name+ is the name of the element.  The +values+ are the options that
-    # can be selected from the Select menu.  Each value can be a String or
-    # a one, two, or three-element Array.  If a String or a one-element
-    # Array, this is both the value of that option and the text displayed for
-    # it.  If a three-element Array, the elements are the option value, displayed
-    # text, and a boolean value specifying whether this option starts as selected.
-    # The two-element version omits either the option value (defaults to the same
-    # as the display text) or the boolean selected specifier (defaults to false).
-    #
-    # The attributes and options can also be specified as a hash.  In this
-    # case, options are specified as an array of values as described above,
-    # with the hash key of "VALUES".
-    #
-    #   popup_menu("name", "foo", "bar", "baz")
-    #     # <SELECT NAME="name">
-    #     #   <OPTION VALUE="foo">foo</OPTION>
-    #     #   <OPTION VALUE="bar">bar</OPTION>
-    #     #   <OPTION VALUE="baz">baz</OPTION>
-    #     # </SELECT>
-    #
-    #   popup_menu("name", ["foo"], ["bar", true], "baz")
-    #     # <SELECT NAME="name">
-    #     #   <OPTION VALUE="foo">foo</OPTION>
-    #     #   <OPTION VALUE="bar" SELECTED>bar</OPTION>
-    #     #   <OPTION VALUE="baz">baz</OPTION>
-    #     # </SELECT>
-    #
-    #   popup_menu("name", ["1", "Foo"], ["2", "Bar", true], "Baz")
-    #     # <SELECT NAME="name">
-    #     #   <OPTION VALUE="1">Foo</OPTION>
-    #     #   <OPTION SELECTED VALUE="2">Bar</OPTION>
-    #     #   <OPTION VALUE="Baz">Baz</OPTION>
-    #     # </SELECT>
-    #
-    #   popup_menu("NAME" => "name", "SIZE" => 2, "MULTIPLE" => true,
-    #               "VALUES" => [["1", "Foo"], ["2", "Bar", true], "Baz"])
-    #     # <SELECT NAME="name" MULTIPLE SIZE="2">
-    #     #   <OPTION VALUE="1">Foo</OPTION>
-    #     #   <OPTION SELECTED VALUE="2">Bar</OPTION>
-    #     #   <OPTION VALUE="Baz">Baz</OPTION>
-    #     # </SELECT>
-    def popup_menu(name = "", *values)
-
-      if name.kind_of?(Hash)
-        values   = name["VALUES"]
-        size     = name["SIZE"].to_s if name["SIZE"]
-        multiple = name["MULTIPLE"]
-        name     = name["NAME"]
-      else
-        size = nil
-        multiple = nil
-      end
-
-      select({ "NAME" => name, "SIZE" => size,
-               "MULTIPLE" => multiple }){
-        values.collect{|value|
-          if value.kind_of?(String)
-            option({ "VALUE" => value }){ value }
-          else
-            if value[value.size - 1] == true
-              option({ "VALUE" => value[0], "SELECTED" => true }){
-                value[value.size - 2]
-              }
-            else
-              option({ "VALUE" => value[0] }){
-                value[value.size - 1]
-              }
-            end
-          end
-        }.join
-      }
-
-    end
-
-    # Generates a radio-button Input element.
-    #
-    # +name+ is the name of the input field.  +value+ is the value of
-    # the field if checked.  +checked+ specifies whether the field
-    # starts off checked.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   radio_button("name", "value")
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="value">
-    #
-    #   radio_button("name", "value", true)
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="value" CHECKED>
-    #
-    #   radio_button("NAME" => "name", "VALUE" => "value", "ID" => "foo")
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="value" ID="foo">
-    def radio_button(name = "", value = nil, checked = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "radio", "NAME" => name,
-                       "VALUE" => value, "CHECKED" => checked }
-                   else
-                     name["TYPE"] = "radio"
-                     name
-                   end
-      input(attributes)
-    end
-
-    # Generate a sequence of radio button Input elements, as a String.
-    #
-    # This works the same as #checkbox_group().  However, it is not valid
-    # to have more than one radiobutton in a group checked.
-    #
-    #   radio_group("name", "foo", "bar", "baz")
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="foo">foo
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="bar">bar
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="baz">baz
-    #
-    #   radio_group("name", ["foo"], ["bar", true], "baz")
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="foo">foo
-    #     # <INPUT TYPE="radio" CHECKED NAME="name" VALUE="bar">bar
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="baz">baz
-    #
-    #   radio_group("name", ["1", "Foo"], ["2", "Bar", true], "Baz")
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="1">Foo
-    #     # <INPUT TYPE="radio" CHECKED NAME="name" VALUE="2">Bar
-    #     # <INPUT TYPE="radio" NAME="name" VALUE="Baz">Baz
-    #
-    #   radio_group("NAME" => "name",
-    #                 "VALUES" => ["foo", "bar", "baz"])
-    #
-    #   radio_group("NAME" => "name",
-    #                 "VALUES" => [["foo"], ["bar", true], "baz"])
-    #
-    #   radio_group("NAME" => "name",
-    #                 "VALUES" => [["1", "Foo"], ["2", "Bar", true], "Baz"])
-    def radio_group(name = "", *values)
-      if name.kind_of?(Hash)
-        values = name["VALUES"]
-        name = name["NAME"]
-      end
-      values.collect{|value|
-        if value.kind_of?(String)
-          radio_button(name, value) + value
-        else
-          if value[-1] == true || value[-1] == false
-            radio_button(name, value[0],  value[-1]) +
-            value[-2]
-          else
-            radio_button(name, value[0]) +
-            value[-1]
-          end
-        end
-      }.join
-    end
-
-    # Generate a reset button Input element, as a String.
-    #
-    # This resets the values on a form to their initial values.  +value+
-    # is the text displayed on the button. +name+ is the name of this button.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   reset
-    #     # <INPUT TYPE="reset">
-    #
-    #   reset("reset")
-    #     # <INPUT TYPE="reset" VALUE="reset">
-    #
-    #   reset("VALUE" => "reset", "ID" => "foo")
-    #     # <INPUT TYPE="reset" VALUE="reset" ID="foo">
-    def reset(value = nil, name = nil)
-      attributes = if (not value) or value.kind_of?(String)
-                     { "TYPE" => "reset", "VALUE" => value, "NAME" => name }
-                   else
-                     value["TYPE"] = "reset"
-                     value
-                   end
-      input(attributes)
-    end
-
-    alias scrolling_list popup_menu
-
-    # Generate a submit button Input element, as a String.
-    #
-    # +value+ is the text to display on the button.  +name+ is the name
-    # of the input.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   submit
-    #     # <INPUT TYPE="submit">
-    #
-    #   submit("ok")
-    #     # <INPUT TYPE="submit" VALUE="ok">
-    #
-    #   submit("ok", "button1")
-    #     # <INPUT TYPE="submit" VALUE="ok" NAME="button1">
-    #
-    #   submit("VALUE" => "ok", "NAME" => "button1", "ID" => "foo")
-    #     # <INPUT TYPE="submit" VALUE="ok" NAME="button1" ID="foo">
-    def submit(value = nil, name = nil)
-      attributes = if (not value) or value.kind_of?(String)
-                     { "TYPE" => "submit", "VALUE" => value, "NAME" => name }
-                   else
-                     value["TYPE"] = "submit"
-                     value
-                   end
-      input(attributes)
-    end
-
-    # Generate a text field Input element, as a String.
-    #
-    # +name+ is the name of the input field.  +value+ is its initial
-    # value.  +size+ is the size of the input area.  +maxlength+
-    # is the maximum length of input accepted.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    #   text_field("name")
-    #     # <INPUT TYPE="text" NAME="name" SIZE="40">
-    #
-    #   text_field("name", "value")
-    #     # <INPUT TYPE="text" NAME="name" VALUE="value" SIZE="40">
-    #
-    #   text_field("name", "value", 80)
-    #     # <INPUT TYPE="text" NAME="name" VALUE="value" SIZE="80">
-    #
-    #   text_field("name", "value", 80, 200)
-    #     # <INPUT TYPE="text" NAME="name" VALUE="value" SIZE="80" MAXLENGTH="200">
-    #
-    #   text_field("NAME" => "name", "VALUE" => "value")
-    #     # <INPUT TYPE="text" NAME="name" VALUE="value">
-    def text_field(name = "", value = nil, size = 40, maxlength = nil)
-      attributes = if name.kind_of?(String)
-                     { "TYPE" => "text", "NAME" => name, "VALUE" => value,
-                       "SIZE" => size.to_s }
-                   else
-                     name["TYPE"] = "text"
-                     name
-                   end
-      attributes["MAXLENGTH"] = maxlength.to_s if maxlength
-      input(attributes)
-    end
-
-    # Generate a TextArea element, as a String.
-    #
-    # +name+ is the name of the textarea.  +cols+ is the number of
-    # columns and +rows+ is the number of rows in the display.
-    #
-    # Alternatively, the attributes can be specified as a hash.
-    #
-    # The body is provided by the passed-in no-argument block
-    #
-    #   textarea("name")
-    #      # = textarea("NAME" => "name", "COLS" => 70, "ROWS" => 10)
-    #
-    #   textarea("name", 40, 5)
-    #      # = textarea("NAME" => "name", "COLS" => 40, "ROWS" => 5)
-    def textarea(name = "", cols = 70, rows = 10)  # :yield:
-      attributes = if name.kind_of?(String)
-                     { "NAME" => name, "COLS" => cols.to_s,
-                       "ROWS" => rows.to_s }
-                   else
-                     name
-                   end
-      super(attributes)
-    end
-
-  end # HtmlExtension
-
-
-  # Mixin module for HTML version 3 generation methods.
-  module Html3 # :nodoc:
-    include TagMaker
-
-    # The DOCTYPE declaration for this version of HTML
-    def doctype
-      %|<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">|
-    end
-
-    instance_method(:nn_element_def).tap do |m|
-      # - -
-      for element in %w[ A TT I B U STRIKE BIG SMALL SUB SUP EM STRONG
-          DFN CODE SAMP KBD VAR CITE FONT ADDRESS DIV CENTER MAP
-          APPLET PRE XMP LISTING DL OL UL DIR MENU SELECT TABLE TITLE
-          STYLE SCRIPT H1 H2 H3 H4 H5 H6 TEXTAREA FORM BLOCKQUOTE
-          CAPTION ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    instance_method(:nOE_element_def).tap do |m|
-      # - O EMPTY
-      for element in %w[ IMG BASE BASEFONT BR AREA LINK PARAM HR INPUT
-          ISINDEX META ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    instance_method(:nO_element_def).tap do |m|
-      # O O or - O
-      for element in %w[ HTML HEAD BODY P PLAINTEXT DT DD LI OPTION TR
-          TH TD ]
-        define_method(element.downcase, m)
-      end
-    end
-
-  end # Html3
-
-
-  # Mixin module for HTML version 4 generation methods.
-  module Html4 # :nodoc:
-    include TagMaker
-
-    # The DOCTYPE declaration for this version of HTML
-    def doctype
-      %|<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">|
-    end
-
-    # Initialize the HTML generation methods for this version.
-    # - -
-    instance_method(:nn_element_def).tap do |m|
-      for element in %w[ TT I B BIG SMALL EM STRONG DFN CODE SAMP KBD
-        VAR CITE ABBR ACRONYM SUB SUP SPAN BDO ADDRESS DIV MAP OBJECT
-        H1 H2 H3 H4 H5 H6 PRE Q INS DEL DL OL UL LABEL SELECT OPTGROUP
-        FIELDSET LEGEND BUTTON TABLE TITLE STYLE SCRIPT NOSCRIPT
-        TEXTAREA FORM A BLOCKQUOTE CAPTION ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # - O EMPTY
-    instance_method(:nOE_element_def).tap do |m|
-      for element in %w[ IMG BASE BR AREA LINK PARAM HR INPUT COL META ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # O O or - O
-    instance_method(:nO_element_def).tap do |m|
-      for element in %w[ HTML BODY P DT DD LI OPTION THEAD TFOOT TBODY
-          COLGROUP TR TH TD HEAD ]
-        define_method(element.downcase, m)
-      end
-    end
-
-  end # Html4
-
-
-  # Mixin module for HTML version 4 transitional generation methods.
-  module Html4Tr # :nodoc:
-    include TagMaker
-
-    # The DOCTYPE declaration for this version of HTML
-    def doctype
-      %|<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">|
-    end
-
-    # Initialise the HTML generation methods for this version.
-    # - -
-    instance_method(:nn_element_def).tap do |m|
-      for element in %w[ TT I B U S STRIKE BIG SMALL EM STRONG DFN
-          CODE SAMP KBD VAR CITE ABBR ACRONYM FONT SUB SUP SPAN BDO
-          ADDRESS DIV CENTER MAP OBJECT APPLET H1 H2 H3 H4 H5 H6 PRE Q
-          INS DEL DL OL UL DIR MENU LABEL SELECT OPTGROUP FIELDSET
-          LEGEND BUTTON TABLE IFRAME NOFRAMES TITLE STYLE SCRIPT
-          NOSCRIPT TEXTAREA FORM A BLOCKQUOTE CAPTION ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # - O EMPTY
-    instance_method(:nOE_element_def).tap do |m|
-      for element in %w[ IMG BASE BASEFONT BR AREA LINK PARAM HR INPUT
-          COL ISINDEX META ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # O O or - O
-    instance_method(:nO_element_def).tap do |m|
-      for element in %w[ HTML BODY P DT DD LI OPTION THEAD TFOOT TBODY
-          COLGROUP TR TH TD HEAD ]
-        define_method(element.downcase, m)
-      end
-    end
-
-  end # Html4Tr
-
-
-  # Mixin module for generating HTML version 4 with framesets.
-  module Html4Fr # :nodoc:
-    include TagMaker
-
-    # The DOCTYPE declaration for this version of HTML
-    def doctype
-      %|<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Frameset//EN" "http://www.w3.org/TR/html4/frameset.dtd">|
-    end
-
-    # Initialise the HTML generation methods for this version.
-    # - -
-    instance_method(:nn_element_def).tap do |m|
-      for element in %w[ FRAMESET ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # - O EMPTY
-    instance_method(:nOE_element_def).tap do |m|
-      for element in %w[ FRAME ]
-        define_method(element.downcase, m)
-      end
-    end
-
-  end # Html4Fr
-
-
-  # Mixin module for HTML version 5 generation methods.
-  module Html5 # :nodoc:
-    include TagMaker
-
-    # The DOCTYPE declaration for this version of HTML
-    def doctype
-      %|<!DOCTYPE HTML>|
-    end
-
-    # Initialise the HTML generation methods for this version.
-    # - -
-    instance_method(:nn_element_def).tap do |m|
-      for element in %w[ SECTION NAV ARTICLE ASIDE HGROUP HEADER
-        FOOTER FIGURE FIGCAPTION S TIME U MARK RUBY BDI IFRAME
-        VIDEO AUDIO CANVAS DATALIST OUTPUT PROGRESS METER DETAILS
-        SUMMARY MENU DIALOG I B SMALL EM STRONG DFN CODE SAMP KBD
-        VAR CITE ABBR SUB SUP SPAN BDO ADDRESS DIV MAP OBJECT
-        H1 H2 H3 H4 H5 H6 PRE Q INS DEL DL OL UL LABEL SELECT
-        FIELDSET LEGEND BUTTON TABLE TITLE STYLE SCRIPT NOSCRIPT
-        TEXTAREA FORM A BLOCKQUOTE CAPTION ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # - O EMPTY
-    instance_method(:nOE_element_def).tap do |m|
-      for element in %w[ IMG BASE BR AREA LINK PARAM HR INPUT COL META
-        COMMAND EMBED KEYGEN SOURCE TRACK WBR ]
-        define_method(element.downcase, m)
-      end
-    end
-
-    # O O or - O
-    instance_method(:nO_element_def).tap do |m|
-      for element in %w[ HTML HEAD BODY P DT DD LI OPTION THEAD TFOOT TBODY
-          OPTGROUP COLGROUP RT RP TR TH TD ]
-        define_method(element.downcase, m)
-      end
-    end
-
-  end # Html5
-
-  class HTML3
-    include Html3
-    include HtmlExtension
-  end
-
-  class HTML4
-    include Html4
-    include HtmlExtension
-  end
-
-  class HTML4Tr
-    include Html4Tr
-    include HtmlExtension
-  end
-
-  class HTML4Fr
-    include Html4Tr
-    include Html4Fr
-    include HtmlExtension
-  end
-
-  class HTML5
-    include Html5
-    include HtmlExtension
-  end
-
-end
diff --git a/lib/cgi/session.rb b/lib/cgi/session.rb
deleted file mode 100644
index aab60869bb..0000000000
--- a/lib/cgi/session.rb
+++ /dev/null
@@ -1,562 +0,0 @@
-# frozen_string_literal: true
-#
-# cgi/session.rb - session support for cgi scripts
-#
-# Copyright (C) 2001  Yukihiro "Matz" Matsumoto
-# Copyright (C) 2000  Network Applied Communication Laboratory, Inc.
-# Copyright (C) 2000  Information-technology Promotion Agency, Japan
-#
-# Author: Yukihiro "Matz" Matsumoto
-#
-# Documentation: William Webber (william@williamwebber.com)
-
-require 'cgi'
-require 'tmpdir'
-
-class CGI
-
-  # == Overview
-  #
-  # This file provides the CGI::Session class, which provides session
-  # support for CGI scripts.  A session is a sequence of HTTP requests
-  # and responses linked together and associated with a single client.
-  # Information associated with the session is stored
-  # on the server between requests.  A session id is passed between client
-  # and server with every request and response, transparently
-  # to the user.  This adds state information to the otherwise stateless
-  # HTTP request/response protocol.
-  #
-  # == Lifecycle
-  #
-  # A CGI::Session instance is created from a CGI object.  By default,
-  # this CGI::Session instance will start a new session if none currently
-  # exists, or continue the current session for this client if one does
-  # exist.  The +new_session+ option can be used to either always or
-  # never create a new session.  See #new() for more details.
-  #
-  # #delete() deletes a session from session storage.  It
-  # does not however remove the session id from the client.  If the client
-  # makes another request with the same id, the effect will be to start
-  # a new session with the old session's id.
-  #
-  # == Setting and retrieving session data.
-  #
-  # The Session class associates data with a session as key-value pairs.
-  # This data can be set and retrieved by indexing the Session instance
-  # using '[]', much the same as hashes (although other hash methods
-  # are not supported).
-  #
-  # When session processing has been completed for a request, the
-  # session should be closed using the close() method.  This will
-  # store the session's state to persistent storage.  If you want
-  # to store the session's state to persistent storage without
-  # finishing session processing for this request, call the update()
-  # method.
-  #
-  # == Storing session state
-  #
-  # The caller can specify what form of storage to use for the session's
-  # data with the +database_manager+ option to CGI::Session::new.  The
-  # following storage classes are provided as part of the standard library:
-  #
-  # CGI::Session::FileStore:: stores data as plain text in a flat file.  Only
-  #                           works with String data.  This is the default
-  #                           storage type.
-  # CGI::Session::MemoryStore:: stores data in an in-memory hash.  The data
-  #                             only persists for as long as the current Ruby
-  #                             interpreter instance does.
-  # CGI::Session::PStore:: stores data in Marshalled format.  Provided by
-  #                        cgi/session/pstore.rb.  Supports data of any type,
-  #                        and provides file-locking and transaction support.
-  #
-  # Custom storage types can also be created by defining a class with
-  # the following methods:
-  #
-  #    new(session, options)
-  #    restore  # returns hash of session data.
-  #    update
-  #    close
-  #    delete
-  #
-  # Changing storage type mid-session does not work.  Note in particular
-  # that by default the FileStore and PStore session data files have the
-  # same name.  If your application switches from one to the other without
-  # making sure that filenames will be different
-  # and clients still have old sessions lying around in cookies, then
-  # things will break nastily!
-  #
-  # == Maintaining the session id.
-  #
-  # Most session state is maintained on the server.  However, a session
-  # id must be passed backwards and forwards between client and server
-  # to maintain a reference to this session state.
-  #
-  # The simplest way to do this is via cookies.  The CGI::Session class
-  # provides transparent support for session id communication via cookies
-  # if the client has cookies enabled.
-  #
-  # If the client has cookies disabled, the session id must be included
-  # as a parameter of all requests sent by the client to the server.  The
-  # CGI::Session class in conjunction with the CGI class will transparently
-  # add the session id as a hidden input field to all forms generated
-  # using the CGI#form() HTML generation method.  No built-in support is
-  # provided for other mechanisms, such as URL re-writing.  The caller is
-  # responsible for extracting the session id from the session_id
-  # attribute and manually encoding it in URLs and adding it as a hidden
-  # input to HTML forms created by other mechanisms.  Also, session expiry
-  # is not automatically handled.
-  #
-  # == Examples of use
-  #
-  # === Setting the user's name
-  #
-  #   require 'cgi'
-  #   require 'cgi/session'
-  #   require 'cgi/session/pstore'     # provides CGI::Session::PStore
-  #
-  #   cgi = CGI.new("html4")
-  #
-  #   session = CGI::Session.new(cgi,
-  #       'database_manager' => CGI::Session::PStore,  # use PStore
-  #       'session_key' => '_rb_sess_id',              # custom session key
-  #       'session_expires' => Time.now + 30 * 60,     # 30 minute timeout
-  #       'prefix' => 'pstore_sid_')                   # PStore option
-  #   if cgi.has_key?('user_name') and cgi['user_name'] != ''
-  #       # coerce to String: cgi[] returns the
-  #       # string-like CGI::QueryExtension::Value
-  #       session['user_name'] = cgi['user_name'].to_s
-  #   elsif !session['user_name']
-  #       session['user_name'] = "guest"
-  #   end
-  #   session.close
-  #
-  # === Creating a new session safely
-  #
-  #   require 'cgi'
-  #   require 'cgi/session'
-  #
-  #   cgi = CGI.new("html4")
-  #
-  #   # We make sure to delete an old session if one exists,
-  #   # not just to free resources, but to prevent the session
-  #   # from being maliciously hijacked later on.
-  #   begin
-  #       session = CGI::Session.new(cgi, 'new_session' => false)
-  #       session.delete
-  #   rescue ArgumentError  # if no old session
-  #   end
-  #   session = CGI::Session.new(cgi, 'new_session' => true)
-  #   session.close
-  #
-  class Session
-
-    class NoSession < RuntimeError #:nodoc:
-    end
-
-    # The id of this session.
-    attr_reader :session_id, :new_session
-
-    def Session::callback(dbman)  #:nodoc:
-      Proc.new{
-        dbman[0].close unless dbman.empty?
-      }
-    end
-
-    # Create a new session id.
-    #
-    # The session id is a secure random number by SecureRandom
-    # if possible, otherwise an SHA512 hash based upon the time,
-    # a random number, and a constant string.  This routine is
-    # used internally for automatically generated session ids.
-    def create_new_id
-      require 'securerandom'
-      begin
-        # by OpenSSL, or system provided entropy pool
-        session_id = SecureRandom.hex(16)
-      rescue NotImplementedError
-        # never happens on modern systems
-        require 'digest'
-        d = Digest('SHA512').new
-        now = Time::now
-        d.update(now.to_s)
-        d.update(String(now.usec))
-        d.update(String(rand(0)))
-        d.update(String($$))
-        d.update('foobar')
-        session_id = d.hexdigest[0, 32]
-      end
-      session_id
-    end
-    private :create_new_id
-
-
-    # Create a new file to store the session data.
-    #
-    # This file will be created if it does not exist, or opened if it
-    # does.
-    #
-    # This path is generated under _tmpdir_ from _prefix_, the
-    # digested session id, and _suffix_.
-    #
-    # +option+ is a hash of options for the initializer.  The
-    # following options are recognised:
-    #
-    # tmpdir:: the directory to use for storing the FileStore
-    #          file.  Defaults to Dir::tmpdir (generally "/tmp"
-    #          on Unix systems).
-    # prefix:: the prefix to add to the session id when generating
-    #          the filename for this session's FileStore file.
-    #          Defaults to "cgi_sid_".
-    # suffix:: the prefix to add to the session id when generating
-    #          the filename for this session's FileStore file.
-    #          Defaults to the empty string.
-    def new_store_file(option={}) # :nodoc:
-      dir = option['tmpdir'] || Dir::tmpdir
-      prefix = option['prefix']
-      suffix = option['suffix']
-      require 'digest/md5'
-      md5 = Digest::MD5.hexdigest(session_id)[0,16]
-      path = dir+"/"
-      path << prefix if prefix
-      path << md5
-      path << suffix if suffix
-      if File::exist? path
-        hash = nil
-      elsif new_session
-        hash = {}
-      else
-        raise NoSession, "uninitialized session"
-      end
-      return path, hash
-    end
-
-    # Create a new CGI::Session object for +request+.
-    #
-    # +request+ is an instance of the +CGI+ class (see cgi.rb).
-    # +option+ is a hash of options for initialising this
-    # CGI::Session instance.  The following options are
-    # recognised:
-    #
-    # session_key:: the parameter name used for the session id.
-    #               Defaults to '_session_id'.
-    # session_id:: the session id to use.  If not provided, then
-    #              it is retrieved from the +session_key+ parameter
-    #              of the request, or automatically generated for
-    #              a new session.
-    # new_session:: if true, force creation of a new session.  If not set,
-    #               a new session is only created if none currently
-    #               exists.  If false, a new session is never created,
-    #               and if none currently exists and the +session_id+
-    #               option is not set, an ArgumentError is raised.
-    # database_manager:: the name of the class providing storage facilities
-    #                    for session state persistence.  Built-in support
-    #                    is provided for +FileStore+ (the default),
-    #                    +MemoryStore+, and +PStore+ (from
-    #                    cgi/session/pstore.rb).  See the documentation for
-    #                    these classes for more details.
-    #
-    # The following options are also recognised, but only apply if the
-    # session id is stored in a cookie.
-    #
-    # session_expires:: the time the current session expires, as a
-    #                   +Time+ object.  If not set, the session will terminate
-    #                   when the user's browser is closed.
-    # session_domain:: the hostname domain for which this session is valid.
-    #                  If not set, defaults to the hostname of the server.
-    # session_secure:: if +true+, this session will only work over HTTPS.
-    # session_path:: the path for which this session applies.  Defaults
-    #                to the directory of the CGI script.
-    #
-    # +option+ is also passed on to the session storage class initializer; see
-    # the documentation for each session storage class for the options
-    # they support.
-    #
-    # The retrieved or created session is automatically added to +request+
-    # as a cookie, and also to its +output_hidden+ table, which is used
-    # to add hidden input elements to forms.
-    #
-    # *WARNING* the +output_hidden+
-    # fields are surrounded by a <fieldset> tag in HTML 4 generation, which
-    # is _not_ invisible on many browsers; you may wish to disable the
-    # use of fieldsets with code similar to the following
-    # (see https://blade.ruby-lang.org/ruby-list/37805)
-    #
-    #   cgi = CGI.new("html4")
-    #   class << cgi
-    #       undef_method :fieldset
-    #   end
-    #
-    def initialize(request, option={})
-      @new_session = false
-      session_key = option['session_key'] || '_session_id'
-      session_id = option['session_id']
-      unless session_id
-        if option['new_session']
-          session_id = create_new_id
-          @new_session = true
-        end
-      end
-      unless session_id
-        if request.key?(session_key)
-          session_id = request[session_key]
-          session_id = session_id.read if session_id.respond_to?(:read)
-        end
-        unless session_id
-          session_id, = request.cookies[session_key]
-        end
-        unless session_id
-          unless option.fetch('new_session', true)
-            raise ArgumentError, "session_key `%s' should be supplied"%session_key
-          end
-          session_id = create_new_id
-          @new_session = true
-        end
-      end
-      @session_id = session_id
-      dbman = option['database_manager'] || FileStore
-      begin
-        @dbman = dbman::new(self, option)
-      rescue NoSession
-        unless option.fetch('new_session', true)
-          raise ArgumentError, "invalid session_id `%s'"%session_id
-        end
-        session_id = @session_id = create_new_id unless session_id
-        @new_session=true
-        retry
-      end
-      request.instance_eval do
-        @output_hidden = {session_key => session_id} unless option['no_hidden']
-        @output_cookies =  [
-          Cookie::new("name" => session_key,
-          "value" => session_id,
-          "expires" => option['session_expires'],
-          "domain" => option['session_domain'],
-          "secure" => option['session_secure'],
-          "path" =>
-          if option['session_path']
-            option['session_path']
-          elsif ENV["SCRIPT_NAME"]
-            File::dirname(ENV["SCRIPT_NAME"])
-          else
-          ""
-          end)
-        ] unless option['no_cookies']
-      end
-      @dbprot = [@dbman]
-      ObjectSpace::define_finalizer(self, Session::callback(@dbprot))
-    end
-
-    # Retrieve the session data for key +key+.
-    def [](key)
-      @data ||= @dbman.restore
-      @data[key]
-    end
-
-    # Set the session data for key +key+.
-    def []=(key, val)
-      @write_lock ||= true
-      @data ||= @dbman.restore
-      @data[key] = val
-    end
-
-    # Store session data on the server.  For some session storage types,
-    # this is a no-op.
-    def update
-      @dbman.update
-    end
-
-    # Store session data on the server and close the session storage.
-    # For some session storage types, this is a no-op.
-    def close
-      @dbman.close
-      @dbprot.clear
-    end
-
-    # Delete the session from storage.  Also closes the storage.
-    #
-    # Note that the session's data is _not_ automatically deleted
-    # upon the session expiring.
-    def delete
-      @dbman.delete
-      @dbprot.clear
-    end
-
-    # File-based session storage class.
-    #
-    # Implements session storage as a flat file of 'key=value' values.
-    # This storage type only works directly with String values; the
-    # user is responsible for converting other types to Strings when
-    # storing and from Strings when retrieving.
-    class FileStore
-      # Create a new FileStore instance.
-      #
-      # This constructor is used internally by CGI::Session.  The
-      # user does not generally need to call it directly.
-      #
-      # +session+ is the session for which this instance is being
-      # created.  The session id must only contain alphanumeric
-      # characters; automatically generated session ids observe
-      # this requirement.
-      #
-      # +option+ is a hash of options for the initializer.  The
-      # following options are recognised:
-      #
-      # tmpdir:: the directory to use for storing the FileStore
-      #          file.  Defaults to Dir::tmpdir (generally "/tmp"
-      #          on Unix systems).
-      # prefix:: the prefix to add to the session id when generating
-      #          the filename for this session's FileStore file.
-      #          Defaults to "cgi_sid_".
-      # suffix:: the prefix to add to the session id when generating
-      #          the filename for this session's FileStore file.
-      #          Defaults to the empty string.
-      #
-      # This session's FileStore file will be created if it does
-      # not exist, or opened if it does.
-      def initialize(session, option={})
-        option = {'prefix' => 'cgi_sid_'}.update(option)
-        @path, @hash = session.new_store_file(option)
-      end
-
-      # Restore session state from the session's FileStore file.
-      #
-      # Returns the session state as a hash.
-      def restore
-        unless @hash
-          @hash = {}
-          begin
-            lockf = File.open(@path+".lock", "r")
-            lockf.flock File::LOCK_SH
-            f = File.open(@path, 'r')
-            for line in f
-              line.chomp!
-              k, v = line.split('=',2)
-              @hash[CGI.unescape(k)] = Marshal.restore(CGI.unescape(v))
-            end
-          ensure
-            f&.close
-            lockf&.close
-          end
-        end
-        @hash
-      end
-
-      # Save session state to the session's FileStore file.
-      def update
-        return unless @hash
-        begin
-          lockf = File.open(@path+".lock", File::CREAT|File::RDWR, 0600)
-          lockf.flock File::LOCK_EX
-          f = File.open(@path+".new", File::CREAT|File::TRUNC|File::WRONLY, 0600)
-          for k,v in @hash
-            f.printf "%s=%s\n", CGI.escape(k), CGI.escape(String(Marshal.dump(v)))
-          end
-          f.close
-          File.rename @path+".new", @path
-        ensure
-          f&.close
-          lockf&.close
-        end
-      end
-
-      # Update and close the session's FileStore file.
-      def close
-        update
-      end
-
-      # Close and delete the session's FileStore file.
-      def delete
-        File::unlink @path+".lock" rescue nil
-        File::unlink @path+".new" rescue nil
-        File::unlink @path rescue nil
-      end
-    end
-
-    # In-memory session storage class.
-    #
-    # Implements session storage as a global in-memory hash.  Session
-    # data will only persist for as long as the Ruby interpreter
-    # instance does.
-    class MemoryStore
-      GLOBAL_HASH_TABLE = {} #:nodoc:
-
-      # Create a new MemoryStore instance.
-      #
-      # +session+ is the session this instance is associated with.
-      # +option+ is a list of initialisation options.  None are
-      # currently recognized.
-      def initialize(session, option=nil)
-        @session_id = session.session_id
-        unless GLOBAL_HASH_TABLE.key?(@session_id)
-          unless session.new_session
-            raise CGI::Session::NoSession, "uninitialized session"
-          end
-          GLOBAL_HASH_TABLE[@session_id] = {}
-        end
-      end
-
-      # Restore session state.
-      #
-      # Returns session data as a hash.
-      def restore
-        GLOBAL_HASH_TABLE[@session_id]
-      end
-
-      # Update session state.
-      #
-      # A no-op.
-      def update
-        # don't need to update; hash is shared
-      end
-
-      # Close session storage.
-      #
-      # A no-op.
-      def close
-        # don't need to close
-      end
-
-      # Delete the session state.
-      def delete
-        GLOBAL_HASH_TABLE.delete(@session_id)
-      end
-    end
-
-    # Dummy session storage class.
-    #
-    # Implements session storage place holder.  No actual storage
-    # will be done.
-    class NullStore
-      # Create a new NullStore instance.
-      #
-      # +session+ is the session this instance is associated with.
-      # +option+ is a list of initialisation options.  None are
-      # currently recognised.
-      def initialize(session, option=nil)
-      end
-
-      # Restore (empty) session state.
-      def restore
-        {}
-      end
-
-      # Update session state.
-      #
-      # A no-op.
-      def update
-      end
-
-      # Close session storage.
-      #
-      # A no-op.
-      def close
-      end
-
-      # Delete the session state.
-      #
-      # A no-op.
-      def delete
-      end
-    end
-  end
-end
diff --git a/lib/cgi/session/pstore.rb b/lib/cgi/session/pstore.rb
deleted file mode 100644
index 45d0d8ae2c..0000000000
--- a/lib/cgi/session/pstore.rb
+++ /dev/null
@@ -1,88 +0,0 @@
-# frozen_string_literal: true
-#
-# cgi/session/pstore.rb - persistent storage of marshalled session data
-#
-# Documentation: William Webber (william@williamwebber.com)
-#
-# == Overview
-#
-# This file provides the CGI::Session::PStore class, which builds
-# persistent of session data on top of the pstore library.  See
-# cgi/session.rb for more details on session storage managers.
-
-require_relative '../session'
-require 'pstore'
-
-class CGI
-  class Session
-    # PStore-based session storage class.
-    #
-    # This builds upon the top-level PStore class provided by the
-    # library file pstore.rb.  Session data is marshalled and stored
-    # in a file.  File locking and transaction services are provided.
-    class PStore
-      # Create a new CGI::Session::PStore instance
-      #
-      # This constructor is used internally by CGI::Session.  The
-      # user does not generally need to call it directly.
-      #
-      # +session+ is the session for which this instance is being
-      # created.  The session id must only contain alphanumeric
-      # characters; automatically generated session ids observe
-      # this requirement.
-      #
-      # +option+ is a hash of options for the initializer.  The
-      # following options are recognised:
-      #
-      # tmpdir:: the directory to use for storing the PStore
-      #          file.  Defaults to Dir::tmpdir (generally "/tmp"
-      #          on Unix systems).
-      # prefix:: the prefix to add to the session id when generating
-      #          the filename for this session's PStore file.
-      #          Defaults to the empty string.
-      #
-      # This session's PStore file will be created if it does
-      # not exist, or opened if it does.
-      def initialize(session, option={})
-        option = {'suffix'=>''}.update(option)
-        path, @hash = session.new_store_file(option)
-        @p = ::PStore.new(path)
-        @p.transaction do |p|
-          File.chmod(0600, p.path)
-        end
-      end
-
-      # Restore session state from the session's PStore file.
-      #
-      # Returns the session state as a hash.
-      def restore
-        unless @hash
-          @p.transaction do
-            @hash = @p['hash'] || {}
-          end
-        end
-        @hash
-      end
-
-      # Save session state to the session's PStore file.
-      def update
-        @p.transaction do
-          @p['hash'] = @hash
-        end
-      end
-
-      # Update and close the session's PStore file.
-      def close
-        update
-      end
-
-      # Close and delete the session's PStore file.
-      def delete
-        path = @p.path
-        File::unlink path
-      end
-
-    end
-  end
-end
-# :enddoc:
diff --git a/lib/cgi/util.rb b/lib/cgi/util.rb
index 4986e544e0..50a2e91665 100644
--- a/lib/cgi/util.rb
+++ b/lib/cgi/util.rb
@@ -1,258 +1,7 @@
 # frozen_string_literal: true
-class CGI
-  module Util; end
-  include Util
-  extend Util
-end
-module CGI::Util
-  @@accept_charset = Encoding::UTF_8 unless defined?(@@accept_charset)
 
-  # URL-encode a string into application/x-www-form-urlencoded.
-  # Space characters (+" "+) are encoded with plus signs (+"+"+)
-  #   url_encoded_string = CGI.escape("'Stop!' said Fred")
-  #      # => "%27Stop%21%27+said+Fred"
-  def escape(string)
-    encoding = string.encoding
-    buffer = string.b
-    buffer.gsub!(/([^ a-zA-Z0-9_.\-~]+)/) do |m|
-      '%' + m.unpack('H2' * m.bytesize).join('%').upcase
-    end
-    buffer.tr!(' ', '+')
-    buffer.force_encoding(encoding)
-  end
-
-  # URL-decode an application/x-www-form-urlencoded string with encoding(optional).
-  #   string = CGI.unescape("%27Stop%21%27+said+Fred")
-  #      # => "'Stop!' said Fred"
-  def unescape(string, encoding = @@accept_charset)
-    str = string.tr('+', ' ')
-    str = str.b
-    str.gsub!(/((?:%[0-9a-fA-F]{2})+)/) do |m|
-      [m.delete('%')].pack('H*')
-    end
-    str.force_encoding(encoding)
-    str.valid_encoding? ? str : str.force_encoding(string.encoding)
-  end
-
-  # URL-encode a string following RFC 3986
-  # Space characters (+" "+) are encoded with (+"%20"+)
-  #   url_encoded_string = CGI.escapeURIComponent("'Stop!' said Fred")
-  #      # => "%27Stop%21%27%20said%20Fred"
-  def escapeURIComponent(string)
-    encoding = string.encoding
-    buffer = string.b
-    buffer.gsub!(/([^a-zA-Z0-9_.\-~]+)/) do |m|
-      '%' + m.unpack('H2' * m.bytesize).join('%').upcase
-    end
-    buffer.force_encoding(encoding)
-  end
-  alias escape_uri_component escapeURIComponent
-
-  # URL-decode a string following RFC 3986 with encoding(optional).
-  #   string = CGI.unescapeURIComponent("%27Stop%21%27+said%20Fred")
-  #      # => "'Stop!'+said Fred"
-  def unescapeURIComponent(string, encoding = @@accept_charset)
-    str = string.b
-    str.gsub!(/((?:%[0-9a-fA-F]{2})+)/) do |m|
-      [m.delete('%')].pack('H*')
-    end
-    str.force_encoding(encoding)
-    str.valid_encoding? ? str : str.force_encoding(string.encoding)
-  end
-
-  alias unescape_uri_component unescapeURIComponent
-
-  # The set of special characters and their escaped values
-  TABLE_FOR_ESCAPE_HTML__ = {
-    "'" => '&#39;',
-    '&' => '&amp;',
-    '"' => '&quot;',
-    '<' => '&lt;',
-    '>' => '&gt;',
-  }
-
-  # Escape special characters in HTML, namely '&\"<>
-  #   CGI.escapeHTML('Usage: foo "bar" <baz>')
-  #      # => "Usage: foo &quot;bar&quot; &lt;baz&gt;"
-  def escapeHTML(string)
-    enc = string.encoding
-    unless enc.ascii_compatible?
-      if enc.dummy?
-        origenc = enc
-        enc = Encoding::Converter.asciicompat_encoding(enc)
-        string = enc ? string.encode(enc) : string.b
-      end
-      table = Hash[TABLE_FOR_ESCAPE_HTML__.map {|pair|pair.map {|s|s.encode(enc)}}]
-      string = string.gsub(/#{"['&\"<>]".encode(enc)}/, table)
-      string.encode!(origenc) if origenc
-      string
-    else
-      string = string.b
-      string.gsub!(/['&\"<>]/, TABLE_FOR_ESCAPE_HTML__)
-      string.force_encoding(enc)
-    end
-  end
-
-  # TruffleRuby runs the pure-Ruby variant faster, do not use the C extension there
-  unless RUBY_ENGINE == 'truffleruby'
-    begin
-      require 'cgi/escape'
-    rescue LoadError
-    end
-  end
-
-  # Unescape a string that has been HTML-escaped
-  #   CGI.unescapeHTML("Usage: foo &quot;bar&quot; &lt;baz&gt;")
-  #      # => "Usage: foo \"bar\" <baz>"
-  def unescapeHTML(string)
-    enc = string.encoding
-    unless enc.ascii_compatible?
-      if enc.dummy?
-        origenc = enc
-        enc = Encoding::Converter.asciicompat_encoding(enc)
-        string = enc ? string.encode(enc) : string.b
-      end
-      string = string.gsub(Regexp.new('&(apos|amp|quot|gt|lt|#[0-9]+|#x[0-9A-Fa-f]+);'.encode(enc))) do
-        case $1.encode(Encoding::US_ASCII)
-        when 'apos'                then "'".encode(enc)
-        when 'amp'                 then '&'.encode(enc)
-        when 'quot'                then '"'.encode(enc)
-        when 'gt'                  then '>'.encode(enc)
-        when 'lt'                  then '<'.encode(enc)
-        when /\A#0*(\d+)\z/        then $1.to_i.chr(enc)
-        when /\A#x([0-9a-f]+)\z/i  then $1.hex.chr(enc)
-        end
-      end
-      string.encode!(origenc) if origenc
-      return string
-    end
-    return string unless string.include? '&'
-    charlimit = case enc
-                when Encoding::UTF_8; 0x10ffff
-                when Encoding::ISO_8859_1; 256
-                else 128
-                end
-    string = string.b
-    string.gsub!(/&(apos|amp|quot|gt|lt|\#[0-9]+|\#[xX][0-9A-Fa-f]+);/) do
-      match = $1.dup
-      case match
-      when 'apos'                then "'"
-      when 'amp'                 then '&'
-      when 'quot'                then '"'
-      when 'gt'                  then '>'
-      when 'lt'                  then '<'
-      when /\A#0*(\d+)\z/
-        n = $1.to_i
-        if n < charlimit
-          n.chr(enc)
-        else
-          "&##{$1};"
-        end
-      when /\A#x([0-9a-f]+)\z/i
-        n = $1.hex
-        if n < charlimit
-          n.chr(enc)
-        else
-          "&#x#{$1};"
-        end
-      else
-        "&#{match};"
-      end
-    end
-    string.force_encoding enc
-  end
-
-  # Synonym for CGI.escapeHTML(str)
-  alias escape_html escapeHTML
-
-  # Synonym for CGI.unescapeHTML(str)
-  alias unescape_html unescapeHTML
-
-  # Escape only the tags of certain HTML elements in +string+.
-  #
-  # Takes an element or elements or array of elements.  Each element
-  # is specified by the name of the element, without angle brackets.
-  # This matches both the start and the end tag of that element.
-  # The attribute list of the open tag will also be escaped (for
-  # instance, the double-quotes surrounding attribute values).
-  #
-  #   print CGI.escapeElement('<BR><A HREF="url"></A>', "A", "IMG")
-  #     # "<BR>&lt;A HREF=&quot;url&quot;&gt;&lt;/A&gt"
-  #
-  #   print CGI.escapeElement('<BR><A HREF="url"></A>', ["A", "IMG"])
-  #     # "<BR>&lt;A HREF=&quot;url&quot;&gt;&lt;/A&gt"
-  def escapeElement(string, *elements)
-    elements = elements[0] if elements[0].kind_of?(Array)
-    unless elements.empty?
-      string.gsub(/<\/?(?:#{elements.join("|")})(?!\w)(?:.|\n)*?>/i) do
-        CGI.escapeHTML($&)
-      end
-    else
-      string
-    end
-  end
-
-  # Undo escaping such as that done by CGI.escapeElement()
-  #
-  #   print CGI.unescapeElement(
-  #           CGI.escapeHTML('<BR><A HREF="url"></A>'), "A", "IMG")
-  #     # "&lt;BR&gt;<A HREF="url"></A>"
-  #
-  #   print CGI.unescapeElement(
-  #           CGI.escapeHTML('<BR><A HREF="url"></A>'), ["A", "IMG"])
-  #     # "&lt;BR&gt;<A HREF="url"></A>"
-  def unescapeElement(string, *elements)
-    elements = elements[0] if elements[0].kind_of?(Array)
-    unless elements.empty?
-      string.gsub(/&lt;\/?(?:#{elements.join("|")})(?!\w)(?:.|\n)*?&gt;/i) do
-        unescapeHTML($&)
-      end
-    else
-      string
-    end
-  end
-
-  # Synonym for CGI.escapeElement(str)
-  alias escape_element escapeElement
-
-  # Synonym for CGI.unescapeElement(str)
-  alias unescape_element unescapeElement
-
-  # Format a +Time+ object as a String using the format specified by RFC 1123.
-  #
-  #   CGI.rfc1123_date(Time.now)
-  #     # Sat, 01 Jan 2000 00:00:00 GMT
-  def rfc1123_date(time)
-    time.getgm.strftime("%a, %d %b %Y %T GMT")
-  end
-
-  # Prettify (indent) an HTML string.
-  #
-  # +string+ is the HTML string to indent.  +shift+ is the indentation
-  # unit to use; it defaults to two spaces.
-  #
-  #   print CGI.pretty("<HTML><BODY></BODY></HTML>")
-  #     # <HTML>
-  #     #   <BODY>
-  #     #   </BODY>
-  #     # </HTML>
-  #
-  #   print CGI.pretty("<HTML><BODY></BODY></HTML>", "\t")
-  #     # <HTML>
-  #     #         <BODY>
-  #     #         </BODY>
-  #     # </HTML>
-  #
-  def pretty(string, shift = "  ")
-    lines = string.gsub(/(?!\A)<.*?>/m, "\n\\0").gsub(/<.*?>(?!\n)/m, "\\0\n")
-    end_pos = 0
-    while end_pos = lines.index(/^<\/(\w+)/, end_pos)
-      element = $1.dup
-      start_pos = lines.rindex(/^\s*<#{element}/i, end_pos)
-      lines[start_pos ... end_pos] = "__" + lines[start_pos ... end_pos].gsub(/\n(?!\z)/, "\n" + shift) + "__"
-    end
-    lines.gsub(/^((?:#{Regexp::quote(shift)})*)__(?=<\/?\w)/, '\1')
-  end
-
-  alias h escapeHTML
-end
+require "cgi/escape"
+warn <<-WARNING, uplevel: Gem::BUNDLED_GEMS.uplevel if $VERBOSE
+CGI::Util is removed from Ruby 4.0. Please use cgi/escape instead for CGI.escape and CGI.unescape features.
+If you are using CGI.parse, please install and use the cgi gem instead.
+WARNING
diff --git a/lib/delegate.gemspec b/lib/delegate.gemspec
index 6c3feac74b..f7fcc1ceb9 100644
--- a/lib/delegate.gemspec
+++ b/lib/delegate.gemspec
@@ -25,5 +25,5 @@ Gem::Specification.new do |spec|
     `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
   end
   spec.require_paths = ["lib"]
-  spec.required_ruby_version = '>= 2.7'
+  spec.required_ruby_version = '>= 3.0'
 end
diff --git a/lib/delegate.rb b/lib/delegate.rb
index 1ea4fb985b..0ff9797bdb 100644
--- a/lib/delegate.rb
+++ b/lib/delegate.rb
@@ -39,7 +39,8 @@
 # Be advised, RDoc will not detect delegated methods.
 #
 class Delegator < BasicObject
-  VERSION = "0.3.1"
+  # The version string
+  VERSION = "0.6.1"
 
   kernel = ::Kernel.dup
   kernel.class_eval do
@@ -77,7 +78,7 @@ class Delegator < BasicObject
   end
 
   #
-  # Handles the magic of delegation through \_\_getobj\_\_.
+  # Handles the magic of delegation through +__getobj__+.
   #
   ruby2_keywords def method_missing(m, *args, &block)
     r = true
@@ -94,7 +95,7 @@ class Delegator < BasicObject
 
   #
   # Checks for a method provided by this the delegate object by forwarding the
-  # call through \_\_getobj\_\_.
+  # call through +__getobj__+.
   #
   def respond_to_missing?(m, include_private)
     r = true
@@ -107,7 +108,7 @@ class Delegator < BasicObject
     r
   end
 
-  KERNEL_RESPOND_TO = ::Kernel.instance_method(:respond_to?)
+  KERNEL_RESPOND_TO = ::Kernel.instance_method(:respond_to?) # :nodoc:
   private_constant :KERNEL_RESPOND_TO
 
   # Handle BasicObject instances
@@ -126,7 +127,7 @@ class Delegator < BasicObject
 
   #
   # Returns the methods available to this delegate object as the union
-  # of this object's and \_\_getobj\_\_ methods.
+  # of this object's and +__getobj__+ methods.
   #
   def methods(all=true)
     __getobj__.methods(all) | super
@@ -134,7 +135,7 @@ class Delegator < BasicObject
 
   #
   # Returns the methods available to this delegate object as the union
-  # of this object's and \_\_getobj\_\_ public methods.
+  # of this object's and +__getobj__+ public methods.
   #
   def public_methods(all=true)
     __getobj__.public_methods(all) | super
@@ -142,7 +143,7 @@ class Delegator < BasicObject
 
   #
   # Returns the methods available to this delegate object as the union
-  # of this object's and \_\_getobj\_\_ protected methods.
+  # of this object's and +__getobj__+ protected methods.
   #
   def protected_methods(all=true)
     __getobj__.protected_methods(all) | super
@@ -175,7 +176,7 @@ class Delegator < BasicObject
   end
 
   #
-  # Delegates ! to the \_\_getobj\_\_
+  # Delegates ! to the +__getobj__+
   #
   def !
     !__getobj__
@@ -198,7 +199,7 @@ class Delegator < BasicObject
   end
 
   #
-  # Serialization support for the object returned by \_\_getobj\_\_.
+  # Serialization support for the object returned by +__getobj__+.
   #
   def marshal_dump
     ivars = instance_variables.reject {|var| /\A@delegate_/ =~ var}
@@ -232,7 +233,7 @@ class Delegator < BasicObject
 
   ##
   # :method: freeze
-  # Freeze both the object returned by \_\_getobj\_\_ and self.
+  # Freeze both the object returned by +__getobj__+ and self.
   #
   def freeze
     __getobj__.freeze
@@ -343,13 +344,6 @@ class SimpleDelegator < Delegator
   end
 end
 
-def Delegator.delegating_block(mid) # :nodoc:
-  lambda do |*args, &block|
-    target = self.__getobj__
-    target.__send__(mid, *args, &block)
-  end.ruby2_keywords
-end
-
 #
 # The primary interface to this library.  Use to setup delegation when defining
 # your class.
@@ -398,6 +392,32 @@ def DelegateClass(superclass, &block)
   protected_instance_methods -= ignores
   public_instance_methods = superclass.public_instance_methods
   public_instance_methods -= ignores
+
+  methods_to_define =
+    public_instance_methods.map { |x| [x, false] } +
+    protected_instance_methods.map { |x| [x, true] }
+
+  source = []
+
+  methods_to_define.each do |target_name, is_protected|
+    unless target_name.match?(/\A[_a-zA-Z]\w*[!\?]?\z/)
+      placeholder_name = :__delegate
+    end
+
+    send_source =
+      if is_protected || placeholder_name
+        "__getobj__.__send__(#{target_name.inspect}, ...)"
+      else
+        "__getobj__.#{target_name}(...)"
+      end
+    source << "def #{placeholder_name || target_name}(...); #{send_source}; end"
+
+    if placeholder_name
+      source << "alias_method #{target_name.inspect}, :#{placeholder_name}"
+      source << "remove_method :#{placeholder_name}"
+    end
+  end
+
   klass.module_eval do
     def __getobj__ # :nodoc:
       unless defined?(@delegate_dc_obj)
@@ -406,18 +426,17 @@ def DelegateClass(superclass, &block)
       end
       @delegate_dc_obj
     end
+
     def __setobj__(obj)  # :nodoc:
       __raise__ ::ArgumentError, "cannot delegate to self" if self.equal?(obj)
       @delegate_dc_obj = obj
     end
-    protected_instance_methods.each do |method|
-      define_method(method, Delegator.delegating_block(method))
-      protected method
-    end
-    public_instance_methods.each do |method|
-      define_method(method, Delegator.delegating_block(method))
-    end
+
+    class_eval(source.join(";"), __FILE__, __LINE__)
+
+    protected(*protected_instance_methods)
   end
+
   klass.define_singleton_method :public_instance_methods do |all=true|
     super(all) | superclass.public_instance_methods
   end
diff --git a/lib/did_you_mean.rb b/lib/did_you_mean.rb
index e177665099..640d910389 100644
--- a/lib/did_you_mean.rb
+++ b/lib/did_you_mean.rb
@@ -47,9 +47,9 @@ require_relative 'did_you_mean/tree_spell_checker'
 #   #    Did you mean?  :foo
 #
 #
-# == Disabling +did_you_mean+
+# == Disabling \DidYouMean
 #
-# Occasionally, you may want to disable the +did_you_mean+ gem for e.g.
+# Occasionally, you may want to disable the \DidYouMean gem for e.g.
 # debugging issues in the error object itself. You can disable it entirely by
 # specifying +--disable-did_you_mean+ option to the +ruby+ command:
 #
@@ -113,30 +113,6 @@ module DidYouMean
   correct_error LoadError, RequirePathChecker if RUBY_VERSION >= '2.8.0'
   correct_error NoMatchingPatternKeyError, PatternKeyNameChecker if defined?(::NoMatchingPatternKeyError)
 
-  # TODO: Remove on the 3.4 development start:
-  class DeprecatedMapping # :nodoc:
-    def []=(key, value)
-      warn "Calling `DidYouMean::SPELL_CHECKERS[#{key.to_s}] = #{value.to_s}' has been deprecated. " \
-           "Please call `DidYouMean.correct_error(#{key.to_s}, #{value.to_s})' instead."
-
-      DidYouMean.correct_error(key, value)
-    end
-
-    def merge!(hash)
-      warn "Calling `DidYouMean::SPELL_CHECKERS.merge!(error_name => spell_checker)' has been deprecated. " \
-           "Please call `DidYouMean.correct_error(error_name, spell_checker)' instead."
-
-      hash.each do |error_class, spell_checker|
-        DidYouMean.correct_error(error_class, spell_checker)
-      end
-    end
-  end
-
-  # TODO: Remove on the 3.4 development start:
-  SPELL_CHECKERS = DeprecatedMapping.new
-  deprecate_constant :SPELL_CHECKERS
-  private_constant :DeprecatedMapping
-
   # Returns the currently set formatter. By default, it is set to +DidYouMean::Formatter+.
   def self.formatter
     if defined?(Ractor)
diff --git a/lib/did_you_mean/version.rb b/lib/did_you_mean/version.rb
index 5745ca1efd..85d80e4230 100644
--- a/lib/did_you_mean/version.rb
+++ b/lib/did_you_mean/version.rb
@@ -1,3 +1,3 @@
 module DidYouMean
-  VERSION = "1.6.3".freeze
+  VERSION = "2.0.0".freeze
 end
diff --git a/lib/erb.gemspec b/lib/erb.gemspec
deleted file mode 100644
index 94a8fd5c3e..0000000000
--- a/lib/erb.gemspec
+++ /dev/null
@@ -1,38 +0,0 @@
-begin
-  require_relative 'lib/erb/version'
-rescue LoadError
-  # for Ruby core repository
-  require_relative 'erb/version'
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = 'erb'
-  spec.version       = ERB.const_get(:VERSION, false)
-  spec.authors       = ['Masatoshi SEKI', 'Takashi Kokubun']
-  spec.email         = ['seki@ruby-lang.org', 'k0kubun@ruby-lang.org']
-
-  spec.summary       = %q{An easy to use but powerful templating system for Ruby.}
-  spec.description   = %q{An easy to use but powerful templating system for Ruby.}
-  spec.homepage      = 'https://github.com/ruby/erb'
-  spec.required_ruby_version = Gem::Requirement.new('>= 2.5.0')
-  spec.licenses      = ['Ruby', 'BSD-2-Clause']
-
-  spec.metadata['homepage_uri'] = spec.homepage
-  spec.metadata['source_code_uri'] = spec.homepage
-
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = 'libexec'
-  spec.executables   = ['erb']
-  spec.require_paths = ['lib']
-
-  if RUBY_ENGINE == 'jruby'
-    spec.platform = 'java'
-  else
-    spec.required_ruby_version = '>= 2.7.0'
-    spec.extensions = ['ext/erb/escape/extconf.rb']
-  end
-
-  spec.add_dependency 'cgi', '>= 0.3.3'
-end
diff --git a/lib/erb.rb b/lib/erb.rb
index bc1615d7da..bde90de841 100644
--- a/lib/erb.rb
+++ b/lib/erb.rb
@@ -12,395 +12,963 @@
 #
 # You can redistribute it and/or modify it under the same terms as Ruby.
 
-require 'cgi/util'
+# A NOTE ABOUT TERMS:
+#
+# Formerly: The documentation in this file used the term _template_ to refer to an ERB object.
+#
+# Now: The documentation in this file uses the term _template_
+# to refer to the string input to ERB.new.
+#
+# The reason for the change:  When documenting the ERB executable erb,
+# we need a term that refers to its string input;
+# _source_ is not a good idea, because ERB#src means something entirely different;
+# the two different sorts of sources would bring confusion.
+#
+# Therefore we use the term _template_ to refer to:
+#
+# - The string input to ERB.new
+# - The string input to executable erb.
+#
+
 require 'erb/version'
 require 'erb/compiler'
 require 'erb/def_method'
 require 'erb/util'
 
+# :markup: markdown
 #
-# = ERB -- Ruby Templating
+# Class **ERB** (the name stands for **Embedded Ruby**)
+# is an easy-to-use, but also very powerful, [template processor][template processor].
 #
-# == Introduction
+# ## Usage
 #
-# ERB provides an easy to use but powerful templating system for Ruby.  Using
-# ERB, actual Ruby code can be added to any plain text document for the
-# purposes of generating document information details and/or flow control.
+# Before you can use \ERB, you must first require it
+# (examples on this page assume that this has been done):
 #
-# A very simple example is this:
+# ```
+# require 'erb'
+# ```
 #
-#   require 'erb'
+# ## In Brief
 #
-#   x = 42
-#   template = ERB.new <<-EOF
-#     The value of x is: <%= x %>
-#   EOF
-#   puts template.result(binding)
+# Here's how \ERB works:
 #
-# <em>Prints:</em> The value of x is: 42
+# - You can create a *template*: a plain-text string that includes specially formatted *tags*..
+# - You can create an \ERB object to store the template.
+# - You can call instance method ERB#result to get the *result*.
 #
-# More complex examples are given below.
+# \ERB supports tags of three kinds:
 #
+# - [Expression tags][expression tags]:
+#   each begins with `'<%='`, ends with `'%>'`; contains a Ruby expression;
+#   in the result, the value of the expression replaces the entire tag:
 #
-# == Recognized Tags
+#         template = 'The magic word is <%= magic_word %>.'
+#         erb = ERB.new(template)
+#         magic_word = 'xyzzy'
+#         erb.result(binding) # => "The magic word is xyzzy."
 #
-# ERB recognizes certain tags in the provided template and converts them based
-# on the rules below:
+#     The above call to #result passes argument `binding`,
+#     which contains the binding of variable `magic_word` to its string value `'xyzzy'`.
 #
-#   <% Ruby code -- inline with output %>
-#   <%= Ruby expression -- replace with result %>
-#   <%# comment -- ignored -- useful in testing %> (`<% #` doesn't work. Don't use Ruby comments.)
-#   % a line of Ruby code -- treated as <% line %> (optional -- see ERB.new)
-#   %% replaced with % if first thing on a line and % processing is used
-#   <%% or %%> -- replace with <% or %> respectively
+#     The below call to #result need not pass a binding,
+#     because its expression `Date::DAYNAMES` is globally defined.
 #
-# All other text is passed through ERB filtering unchanged.
+#         ERB.new('Today is <%= Date::DAYNAMES[Date.today.wday] %>.').result # => "Today is Monday."
 #
+# - [Execution tags][execution tags]:
+#   each begins with `'<%'`, ends with `'%>'`; contains Ruby code to be executed:
 #
-# == Options
+#          template = '<% File.write("t.txt", "Some stuff.") %>'
+#          ERB.new(template).result
+#          File.read('t.txt') # => "Some stuff."
 #
-# There are several settings you can change when you use ERB:
-# * the nature of the tags that are recognized;
-# * the binding used to resolve local variables in the template.
+# - [Comment tags][comment tags]:
+#   each begins with `'<%#'`, ends with `'%>'`; contains comment text;
+#   in the result, the entire tag is omitted.
 #
-# See the ERB.new and ERB#result methods for more detail.
+#          template = 'Some stuff;<%# Note to self: figure out what the stuff is. %> more stuff.'
+#          ERB.new(template).result # => "Some stuff; more stuff."
 #
-# == Character encodings
+# ## Some Simple Examples
 #
-# ERB (or Ruby code generated by ERB) returns a string in the same
-# character encoding as the input string.  When the input string has
-# a magic comment, however, it returns a string in the encoding specified
-# by the magic comment.
+# Here's a simple example of \ERB in action:
 #
-#   # -*- coding: utf-8 -*-
-#   require 'erb'
+# ```
+# template = 'The time is <%= Time.now %>.'
+# erb = ERB.new(template)
+# erb.result
+# # => "The time is 2025-09-09 10:49:26 -0500."
+# ```
 #
-#   template = ERB.new <<EOF
-#   <%#-*- coding: Big5 -*-%>
-#     \_\_ENCODING\_\_ is <%= \_\_ENCODING\_\_ %>.
-#   EOF
-#   puts template.result
+# Details:
 #
-# <em>Prints:</em> \_\_ENCODING\_\_ is Big5.
+# 1. A plain-text string is assigned to variable `template`.
+#    Its embedded [expression tag][expression tags] `'<%= Time.now %>'` includes a Ruby expression, `Time.now`.
+# 2. The string is put into a new \ERB object, and stored in variable `erb`.
+# 4. Method call `erb.result` generates a string that contains the run-time value of `Time.now`,
+#    as computed at the time of the call.
 #
+# The
+# \ERB object may be re-used:
 #
-# == Examples
+# ```
+# erb.result
+# # => "The time is 2025-09-09 10:49:33 -0500."
+# ```
 #
-# === Plain Text
+# Another example:
 #
-# ERB is useful for any generic templating situation.  Note that in this example, we use the
-# convenient "% at start of line" tag, and we quote the template literally with
-# <tt>%q{...}</tt> to avoid trouble with the backslash.
+# ```
+# template = 'The magic word is <%= magic_word %>.'
+# erb = ERB.new(template)
+# magic_word = 'abracadabra'
+# erb.result(binding)
+# # => "The magic word is abracadabra."
+# ```
 #
-#   require "erb"
+# Details:
 #
-#   # Create template.
-#   template = %q{
-#     From:  James Edward Gray II <james@grayproductions.net>
-#     To:  <%= to %>
-#     Subject:  Addressing Needs
+# 1. As before, a plain-text string is assigned to variable `template`.
+#    Its embedded [expression tag][expression tags] `'<%= magic_word %>'` has a variable *name*, `magic_word`.
+# 2. The string is put into a new \ERB object, and stored in variable `erb`;
+#    note that `magic_word` need not be defined before the \ERB object is created.
+# 3. `magic_word = 'abracadabra'` assigns a value to variable `magic_word`.
+# 4. Method call `erb.result(binding)` generates a string
+#    that contains the *value* of `magic_word`.
 #
-#     <%= to[/\w+/] %>:
+# As before, the \ERB object may be re-used:
 #
-#     Just wanted to send a quick note assuring that your needs are being
-#     addressed.
+# ```
+# magic_word = 'xyzzy'
+# erb.result(binding)
+# # => "The magic word is xyzzy."
+# ```
 #
-#     I want you to know that my team will keep working on the issues,
-#     especially:
+# ## Bindings
 #
-#     <%# ignore numerous minor requests -- focus on priorities %>
-#     % priorities.each do |priority|
-#       * <%= priority %>
-#     % end
+# A call to method #result, which produces the formatted result string,
+# requires a [Binding object][binding object] as its argument.
+#
+# The binding object provides the bindings for expressions in [expression tags][expression tags].
+#
+# There are three ways to provide the required binding:
+#
+# - [Default binding][default binding].
+# - [Local binding][local binding].
+# - [Augmented binding][augmented binding]
+#
+# ### Default Binding
+#
+# When you pass no `binding` argument to method #result,
+# the method uses its default binding: the one returned by method #new_toplevel.
+# This binding has the bindings defined by Ruby itself,
+# which are those for Ruby's constants and variables.
+#
+# That binding is sufficient for an expression tag that refers only to Ruby's constants and variables;
+# these expression tags refer only to Ruby's global constant `RUBY_COPYRIGHT` and global variable `$0`:
 #
-#     Thanks for your patience.
+# ```
+# template = <<TEMPLATE
+# The Ruby copyright is <%= RUBY_COPYRIGHT.inspect %>.
+# The current process is <%= $0 %>.
+# TEMPLATE
+# puts ERB.new(template).result
+# The Ruby copyright is "ruby - Copyright (C) 1993-2025 Yukihiro Matsumoto".
+# The current process is irb.
+# ```
+#
+# (The current process is `irb` because that's where we're doing these examples!)
+#
+# ### Local Binding
+#
+# The default binding is *not* sufficient for an expression
+# that refers to a a constant or variable that is not defined there:
+#
+# ```
+# Foo = 1 # Defines local constant Foo.
+# foo = 2 # Defines local variable foo.
+# template = <<TEMPLATE
+# The current value of constant Foo is <%= Foo %>.
+# The current value of variable foo is <%= foo %>.
+# The Ruby copyright is <%= RUBY_COPYRIGHT.inspect %>.
+# The current process is <%= $0 %>.
+# TEMPLATE
+# erb = ERB.new(template)
+# ```
+#
+# This call below raises `NameError` because although `Foo` and `foo` are defined locally,
+# they are not defined in the default binding:
+#
+# ```
+# erb.result # Raises NameError.
+# ```
+#
+# To make the locally-defined constants and variables available,
+# you can call #result with the local binding:
+#
+# ```
+# puts erb.result(binding)
+# The current value of constant Foo is 1.
+# The current value of variable foo is 2.
+# The Ruby copyright is "ruby - Copyright (C) 1993-2025 Yukihiro Matsumoto".
+# The current process is irb.
+# ```
+#
+# ### Augmented Binding
+#
+# Another way to make variable bindings (but not constant bindings) available
+# is to use method #result_with_hash(hash);
+# the passed hash has name/value pairs that are to be used to define and assign variables
+# in a copy of the default binding:
+#
+# ```
+# template = <<TEMPLATE
+# The current value of variable bar is <%= bar %>.
+# The current value of variable baz is <%= baz %>.
+# The Ruby copyright is <%= RUBY_COPYRIGHT.inspect %>.
+# The current process is <%= $0 %>.
+# TEMPLATE
+# erb = ERB.new(template)
+# ```
+#
+# Both of these calls raise `NameError`, because `bar` and `baz`
+# are not defined in either the default binding or the local binding.
+#
+# ```
+# puts erb.result          # Raises NameError.
+# puts erb.result(binding) # Raises NameError.
+# ```
+#
+# This call passes a hash that causes `bar` and `baz` to be defined
+# in a new binding (derived from #new_toplevel):
+#
+# ```
+# hash = {bar: 3, baz: 4}
+# puts erb.result_with_hash(hash)
+# The current value of variable bar is 3.
+# The current value of variable baz is 4.
+# The Ruby copyright is "ruby - Copyright (C) 1993-2025 Yukihiro Matsumoto".
+# The current process is irb.
+# ```
+#
+# ## Tags
+#
+# The examples above use expression tags.
+# These are the tags available in \ERB:
+#
+# - [Expression tag][expression tags]: the tag contains a Ruby expression;
+#   in the result, the entire tag is to be replaced with the run-time value of the expression.
+# - [Execution tag][execution tags]: the tag contains Ruby code;
+#   in the result, the entire tag is to be replaced with the run-time value of the code.
+# - [Comment tag][comment tags]: the tag contains comment code;
+#   in the result, the entire tag is to be omitted.
+#
+# ### Expression Tags
+#
+# You can embed a Ruby expression in a template using an *expression tag*.
+#
+# Its syntax is `<%= _expression_ %>`,
+# where *expression* is any valid Ruby expression.
+#
+# When you call method #result,
+# the method evaluates the expression and replaces the entire expression tag with the expression's value:
+#
+# ```
+# ERB.new('Today is <%= Date::DAYNAMES[Date.today.wday] %>.').result
+# # => "Today is Monday."
+# ERB.new('Tomorrow will be <%= Date::DAYNAMES[Date.today.wday + 1] %>.').result
+# # => "Tomorrow will be Tuesday."
+# ERB.new('Yesterday was <%= Date::DAYNAMES[Date.today.wday - 1] %>.').result
+# # => "Yesterday was Sunday."
+# ```
+#
+# Note that whitespace before and after the expression
+# is allowed but not required,
+# and that such whitespace is stripped from the result.
+#
+# ```
+# ERB.new('My appointment is on <%=Date::DAYNAMES[Date.today.wday + 2]%>.').result
+# # => "My appointment is on Wednesday."
+# ERB.new('My appointment is on <%=     Date::DAYNAMES[Date.today.wday + 2]    %>.').result
+# # => "My appointment is on Wednesday."
+# ```
+#
+# ### Execution Tags
+#
+# You can embed Ruby executable code in template using an *execution tag*.
+#
+# Its syntax is `<% _code_ %>`,
+# where *code* is any valid Ruby code.
+#
+# When you call method #result,
+# the method executes the code and removes the entire execution tag
+# (generating no text in the result):
+#
+# ```
+# ERB.new('foo <% Dir.chdir("C:/") %> bar').result # => "foo  bar"
+# ```
+#
+# Whitespace before and after the embedded code is optional:
+#
+# ```
+# ERB.new('foo <%Dir.chdir("C:/")%> bar').result   # => "foo  bar"
+# ```
+#
+# You can interleave text with execution tags to form a control structure
+# such as a conditional, a loop, or a `case` statements.
+#
+# Conditional:
+#
+# ```
+# template = <<TEMPLATE
+# <% if verbosity %>
+# An error has occurred.
+# <% else %>
+# Oops!
+# <% end %>
+# TEMPLATE
+# erb = ERB.new(template)
+# verbosity = true
+# erb.result(binding)
+# # => "\nAn error has occurred.\n\n"
+# verbosity = false
+# erb.result(binding)
+# # => "\nOops!\n\n"
+# ```
+#
+# Note that the interleaved text may itself contain expression tags:
+#
+# Loop:
+#
+# ```
+# template = <<TEMPLATE
+# <% Date::ABBR_DAYNAMES.each do |dayname| %>
+# <%= dayname %>
+# <% end %>
+# TEMPLATE
+# ERB.new(template).result
+# # => "\nSun\n\nMon\n\nTue\n\nWed\n\nThu\n\nFri\n\nSat\n\n"
+# ```
+#
+# Other, non-control, lines of Ruby code may be interleaved with the text,
+# and the Ruby code may itself contain regular Ruby comments:
+#
+# ```
+# template = <<TEMPLATE
+# <% 3.times do %>
+# <%= Time.now %>
+# <% sleep(1) # Let's make the times different. %>
+# <% end %>
+# TEMPLATE
+# ERB.new(template).result
+# # => "\n2025-09-09 11:36:02 -0500\n\n\n2025-09-09 11:36:03 -0500\n\n\n2025-09-09 11:36:04 -0500\n\n\n"
+# ```
+#
+# The execution tag may also contain multiple lines of code:
+#
+# ```
+# template = <<TEMPLATE
+# <%
+#   (0..2).each do |i|
+#     (0..2).each do |j|
+# %>
+# * <%=i%>,<%=j%>
+# <%
+#     end
+#   end
+# %>
+# TEMPLATE
+# ERB.new(template).result
+# # => "\n* 0,0\n\n* 0,1\n\n* 0,2\n\n* 1,0\n\n* 1,1\n\n* 1,2\n\n* 2,0\n\n* 2,1\n\n* 2,2\n\n"
+# ```
+#
+# #### Shorthand Format for Execution Tags
+#
+# You can use keyword argument `trim_mode: '%'` to enable a shorthand format for execution tags;
+# this example uses the shorthand format `% _code_` instead of `<% _code_ %>`:
+#
+# ```
+# template = <<TEMPLATE
+# % priorities.each do |priority|
+#   * <%= priority %>
+# % end
+# TEMPLATE
+# erb = ERB.new(template, trim_mode: '%')
+# priorities = [ 'Run Ruby Quiz',
+#                'Document Modules',
+#                'Answer Questions on Ruby Talk' ]
+# puts erb.result(binding)
+#   * Run Ruby Quiz
+#   * Document Modules
+#   * Answer Questions on Ruby Talk
+# ```
+#
+# Note that in the shorthand format, the character `'%'` must be the first character in the code line
+# (no leading whitespace).
+#
+# #### Suppressing Unwanted Blank Lines
+#
+# With keyword argument `trim_mode` not given,
+# all blank lines go into the result:
+#
+# ```
+# template = <<TEMPLATE
+# <% if true %>
+# <%= RUBY_VERSION %>
+# <% end %>
+# TEMPLATE
+# ERB.new(template).result.lines.each {|line| puts line.inspect }
+# "\n"
+# "3.4.5\n"
+# "\n"
+# ```
+#
+# You can give `trim_mode: '-'`, you can suppress each blank line
+# whose source line ends with `-%>` (instead of `%>`):
+#
+# ```
+# template = <<TEMPLATE
+# <% if true -%>
+# <%= RUBY_VERSION %>
+# <% end -%>
+# TEMPLATE
+# ERB.new(template, trim_mode: '-').result.lines.each {|line| puts line.inspect }
+# "3.4.5\n"
+# ```
+#
+# It is an error to use the trailing `'-%>'` notation without `trim_mode: '-'`:
+#
+# ```
+# ERB.new(template).result.lines.each {|line| puts line.inspect } # Raises SyntaxError.
+# ```
+#
+# #### Suppressing Unwanted Newlines
+#
+# Consider this template:
+#
+# ```
+# template = <<TEMPLATE
+# <% RUBY_VERSION %>
+# <%= RUBY_VERSION %>
+# foo <% RUBY_VERSION %>
+# foo <%= RUBY_VERSION %>
+# TEMPLATE
+# ```
+#
+# With keyword argument `trim_mode` not given, all newlines go into the result:
+#
+# ```
+# ERB.new(template).result.lines.each {|line| puts line.inspect }
+# "\n"
+# "3.4.5\n"
+# "foo \n"
+# "foo 3.4.5\n"
+# ```
+#
+# You can give `trim_mode: '>'` to suppress the trailing newline
+# for each line that ends with `'%>'` (regardless of its beginning):
+#
+# ```
+# ERB.new(template, trim_mode: '>').result.lines.each {|line| puts line.inspect }
+# "3.4.5foo foo 3.4.5"
+# ```
+#
+# You can give `trim_mode: '<>'` to suppress the trailing newline
+# for each line that both begins with `'<%'` and ends with `'%>'`:
+#
+# ```
+# ERB.new(template, trim_mode: '<>').result.lines.each {|line| puts line.inspect }
+# "3.4.5foo \n"
+# "foo 3.4.5\n"
+# ```
+#
+# #### Combining Trim Modes
+#
+# You can combine certain trim modes:
+#
+# - `'%-'`: Enable shorthand and omit each blank line ending with `'-%>'`.
+# - `'%>'`: Enable shorthand and omit newline for each line ending with `'%>'`.
+# - `'%<>'`: Enable shorthand and omit newline for each line starting with `'<%'` and ending with `'%>'`.
+#
+# ### Comment Tags
+#
+# You can embed a comment in a template using a *comment tag*;
+# its syntax is `<%# _text_ %>`,
+# where *text* is the text of the comment.
+#
+# When you call method #result,
+# it removes the entire comment tag
+# (generating no text in the result).
+#
+# Example:
+#
+# ```
+# template = 'Some stuff;<%# Note to self: figure out what the stuff is. %> more stuff.'
+# ERB.new(template).result # => "Some stuff; more stuff."
+# ```
+#
+# A comment tag may appear anywhere in the template.
+#
+# Note that the beginning of the tag must be `'<%#'`, not `'<% #'`.
+#
+# In this example, the tag begins with `'<% #'`, and so is an execution tag, not a comment tag;
+# the cited code consists entirely of a Ruby-style comment (which is of course ignored):
+#
+# ```
+# ERB.new('Some stuff;<% # Note to self: figure out what the stuff is. %> more stuff.').result
+# # => "Some stuff;"
+# ```
+#
+# ## Encodings
+#
+# An \ERB object has an [encoding][encoding],
+# which is by default the encoding of the template string;
+# the result string will also have that encoding.
 #
-#     James Edward Gray II
-#   }.gsub(/^  /, '')
+# ```
+# template = <<TEMPLATE
+# <%# Comment. %>
+# TEMPLATE
+# erb = ERB.new(template)
+# template.encoding   # => #<Encoding:UTF-8>
+# erb.encoding        # => #<Encoding:UTF-8>
+# erb.result.encoding # => #<Encoding:UTF-8>
+# ```
 #
-#   message = ERB.new(template, trim_mode: "%<>")
+# You can specify a different encoding by adding a [magic comment][magic comments]
+# at the top of the given template:
 #
-#   # Set up template data.
-#   to = "Community Spokesman <spokesman@ruby_community.org>"
-#   priorities = [ "Run Ruby Quiz",
-#                  "Document Modules",
-#                  "Answer Questions on Ruby Talk" ]
+# ```
+# template = <<TEMPLATE
+# <%#-*- coding: Big5 -*-%>
+# <%# Comment. %>
+# TEMPLATE
+# erb = ERB.new(template)
+# template.encoding   # => #<Encoding:UTF-8>
+# erb.encoding        # => #<Encoding:Big5>
+# erb.result.encoding # => #<Encoding:Big5>
+# ```
 #
-#   # Produce result.
-#   email = message.result
-#   puts email
+# ## Error Reporting
 #
-# <i>Generates:</i>
+# Consider this template (containing an error):
 #
-#   From:  James Edward Gray II <james@grayproductions.net>
-#   To:  Community Spokesman <spokesman@ruby_community.org>
-#   Subject:  Addressing Needs
+# ```
+# template = '<%= nosuch %>'
+# erb = ERB.new(template)
+# ```
 #
-#   Community:
+# When \ERB reports an error,
+# it includes a file name (if available) and a line number;
+# the file name comes from method #filename, the line number from method #lineno.
 #
-#   Just wanted to send a quick note assuring that your needs are being addressed.
+# Initially, those values are `nil` and `0`, respectively;
+# these initial values are reported as `'(erb)'` and `1`, respectively:
 #
-#   I want you to know that my team will keep working on the issues, especially:
+# ```
+# erb.filename # => nil
+# erb.lineno   # => 0
+# erb.result
+# (erb):1:in '<main>': undefined local variable or method 'nosuch' for main (NameError)
+# ```
 #
-#       * Run Ruby Quiz
-#       * Document Modules
-#       * Answer Questions on Ruby Talk
+# You can use methods #filename= and #lineno= to assign values
+# that are more meaningful in your context:
 #
-#   Thanks for your patience.
+# ```
+# erb.filename = 't.txt'
+# erb.lineno = 555
+# erb.result
+# t.txt:556:in '<main>': undefined local variable or method 'nosuch' for main (NameError)
+# ```
 #
-#   James Edward Gray II
+# You can use method #location= to set both values:
 #
-# === Ruby in HTML
+# ```
+# erb.location = ['u.txt', 999]
+# erb.result
+# u.txt:1000:in '<main>': undefined local variable or method 'nosuch' for main (NameError)
+# ```
 #
-# ERB is often used in <tt>.rhtml</tt> files (HTML with embedded Ruby).  Notice the need in
-# this example to provide a special binding when the template is run, so that the instance
-# variables in the Product object can be resolved.
+# ## Plain Text with Embedded Ruby
 #
-#   require "erb"
+# Here's a plain-text template;
+# it uses the literal notation `'%q{ ... }'` to define the template
+# (see [%q literals][%q literals]);
+# this avoids problems with backslashes.
 #
-#   # Build template data class.
-#   class Product
-#     def initialize( code, name, desc, cost )
-#       @code = code
-#       @name = name
-#       @desc = desc
-#       @cost = cost
+# ```
+# template = %q{
+# From:  James Edward Gray II <james@grayproductions.net>
+# To:  <%= to %>
+# Subject:  Addressing Needs
 #
-#       @features = [ ]
-#     end
+# <%= to[/\w+/] %>:
 #
-#     def add_feature( feature )
-#       @features << feature
-#     end
+# Just wanted to send a quick note assuring that your needs are being
+# addressed.
 #
-#     # Support templating of member data.
-#     def get_binding
-#       binding
-#     end
+# I want you to know that my team will keep working on the issues,
+# especially:
 #
-#     # ...
-#   end
+# <%# ignore numerous minor requests -- focus on priorities %>
+# % priorities.each do |priority|
+#   * <%= priority %>
+# % end
+#
+# Thanks for your patience.
 #
-#   # Create template.
-#   template = %{
-#     <html>
-#       <head><title>Ruby Toys -- <%= @name %></title></head>
-#       <body>
+# James Edward Gray II
+# }
+# ```
 #
-#         <h1><%= @name %> (<%= @code %>)</h1>
-#         <p><%= @desc %></p>
+# The template will need these:
 #
-#         <ul>
-#           <% @features.each do |f| %>
-#             <li><b><%= f %></b></li>
-#           <% end %>
-#         </ul>
+# ```
+# to = 'Community Spokesman <spokesman@ruby_community.org>'
+# priorities = [ 'Run Ruby Quiz',
+#                'Document Modules',
+#                'Answer Questions on Ruby Talk' ]
+# ```
 #
-#         <p>
-#           <% if @cost < 10 %>
-#             <b>Only <%= @cost %>!!!</b>
-#           <% else %>
-#              Call for a price, today!
-#           <% end %>
-#         </p>
+# Finally, create the \ERB object and get the result
 #
-#       </body>
-#     </html>
-#   }.gsub(/^  /, '')
+# ```
+# erb = ERB.new(template, trim_mode: '%<>')
+# puts erb.result(binding)
 #
-#   rhtml = ERB.new(template)
+# From:  James Edward Gray II <james@grayproductions.net>
+# To:  Community Spokesman <spokesman@ruby_community.org>
+# Subject:  Addressing Needs
 #
-#   # Set up template data.
-#   toy = Product.new( "TZ-1002",
-#                      "Rubysapien",
-#                      "Geek's Best Friend!  Responds to Ruby commands...",
-#                      999.95 )
-#   toy.add_feature("Listens for verbal commands in the Ruby language!")
-#   toy.add_feature("Ignores Perl, Java, and all C variants.")
-#   toy.add_feature("Karate-Chop Action!!!")
-#   toy.add_feature("Matz signature on left leg.")
-#   toy.add_feature("Gem studded eyes... Rubies, of course!")
+# Community:
 #
-#   # Produce result.
-#   rhtml.run(toy.get_binding)
+# Just wanted to send a quick note assuring that your needs are being
+# addressed.
 #
-# <i>Generates (some blank lines removed):</i>
+# I want you to know that my team will keep working on the issues,
+# especially:
 #
-#    <html>
-#      <head><title>Ruby Toys -- Rubysapien</title></head>
-#      <body>
+# * Run Ruby Quiz
+# * Document Modules
+# * Answer Questions on Ruby Talk
 #
-#        <h1>Rubysapien (TZ-1002)</h1>
-#        <p>Geek's Best Friend!  Responds to Ruby commands...</p>
+# Thanks for your patience.
 #
-#        <ul>
-#            <li><b>Listens for verbal commands in the Ruby language!</b></li>
-#            <li><b>Ignores Perl, Java, and all C variants.</b></li>
-#            <li><b>Karate-Chop Action!!!</b></li>
-#            <li><b>Matz signature on left leg.</b></li>
-#            <li><b>Gem studded eyes... Rubies, of course!</b></li>
-#        </ul>
+# James Edward Gray II
+# ```
 #
-#        <p>
-#             Call for a price, today!
-#        </p>
+# ## HTML with Embedded Ruby
 #
-#      </body>
-#    </html>
+# This example shows an HTML template.
 #
+# First, here's a custom class, `Product`:
 #
-# == Notes
+# ```
+# class Product
+#   def initialize(code, name, desc, cost)
+#     @code = code
+#     @name = name
+#     @desc = desc
+#     @cost = cost
+#     @features = []
+#   end
 #
-# There are a variety of templating solutions available in various Ruby projects.
-# For example, RDoc, distributed with Ruby, uses its own template engine, which
-# can be reused elsewhere.
+#   def add_feature(feature)
+#     @features << feature
+#   end
 #
-# Other popular engines could be found in the corresponding
-# {Category}[https://www.ruby-toolbox.com/categories/template_engines] of
-# The Ruby Toolbox.
+#   # Support templating of member data.
+#   def get_binding
+#     binding
+#   end
+#
+# end
+# ```
+#
+# The template below will need these values:
+#
+# ```
+# toy = Product.new('TZ-1002',
+#                   'Rubysapien',
+#                   "Geek's Best Friend!  Responds to Ruby commands...",
+#                   999.95
+#                   )
+# toy.add_feature('Listens for verbal commands in the Ruby language!')
+# toy.add_feature('Ignores Perl, Java, and all C variants.')
+# toy.add_feature('Karate-Chop Action!!!')
+# toy.add_feature('Matz signature on left leg.')
+# toy.add_feature('Gem studded eyes... Rubies, of course!')
+# ```
+#
+# Here's the HTML:
+#
+# ```
+# template = <<TEMPLATE
+# <html>
+#   <head><title>Ruby Toys -- <%= @name %></title></head>
+#   <body>
+#     <h1><%= @name %> (<%= @code %>)</h1>
+#     <p><%= @desc %></p>
+#     <ul>
+#       <% @features.each do |f| %>
+#         <li><b><%= f %></b></li>
+#       <% end %>
+#     </ul>
+#     <p>
+#       <% if @cost < 10 %>
+#         <b>Only <%= @cost %>!!!</b>
+#       <% else %>
+#          Call for a price, today!
+#       <% end %>
+#     </p>
+#   </body>
+# </html>
+# TEMPLATE
+# ```
+#
+# Finally, create the \ERB object and get the result (omitting some blank lines):
+#
+# ```
+# erb = ERB.new(template)
+# puts erb.result(toy.get_binding)
+# <html>
+#   <head><title>Ruby Toys -- Rubysapien</title></head>
+#   <body>
+#     <h1>Rubysapien (TZ-1002)</h1>
+#     <p>Geek's Best Friend!  Responds to Ruby commands...</p>
+#     <ul>
+#         <li><b>Listens for verbal commands in the Ruby language!</b></li>
+#         <li><b>Ignores Perl, Java, and all C variants.</b></li>
+#         <li><b>Karate-Chop Action!!!</b></li>
+#         <li><b>Matz signature on left leg.</b></li>
+#         <li><b>Gem studded eyes... Rubies, of course!</b></li>
+#     </ul>
+#     <p>
+#          Call for a price, today!
+#     </p>
+#   </body>
+# </html>
+# ```
+#
+#
+# ## Other Template Processors
+#
+# Various Ruby projects have their own template processors.
+# The Ruby Processing System [RDoc][rdoc], for example, has one that can be used elsewhere.
+#
+# Other popular template processors may found in the [Template Engines][template engines] page
+# of the Ruby Toolbox.
+#
+# [%q literals]: https://docs.ruby-lang.org/en/master/syntax/literals_rdoc.html#label-25q-3A+Non-Interpolable+String+Literals
+# [augmented binding]: rdoc-ref:ERB@Augmented+Binding
+# [binding object]: https://docs.ruby-lang.org/en/master/Binding.html
+# [comment tags]: rdoc-ref:ERB@Comment+Tags
+# [default binding]: rdoc-ref:ERB@Default+Binding
+# [encoding]: https://docs.ruby-lang.org/en/master/Encoding.html
+# [execution tags]: rdoc-ref:ERB@Execution+Tags
+# [expression tags]: rdoc-ref:ERB@Expression+Tags
+# [kernel#binding]: https://docs.ruby-lang.org/en/master/Kernel.html#method-i-binding
+# [local binding]: rdoc-ref:ERB@Local+Binding
+# [magic comments]: https://docs.ruby-lang.org/en/master/syntax/comments_rdoc.html#label-Magic+Comments
+# [rdoc]: https://ruby.github.io/rdoc
+# [sprintf]: https://docs.ruby-lang.org/en/master/Kernel.html#method-i-sprintf
+# [template engines]: https://www.ruby-toolbox.com/categories/template_engines
+# [template processor]: https://en.wikipedia.org/wiki/Template_processor
 #
 class ERB
-  Revision = '$Date::                           $' # :nodoc: #'
-  deprecate_constant :Revision
-
-  # Returns revision information for the erb.rb module.
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   self.version -> string
+  #
+  # Returns the string \ERB version.
   def self.version
     VERSION
   end
 
+  # :markup: markdown
   #
-  # Constructs a new ERB object with the template specified in _str_.
-  #
-  # An ERB object works by building a chunk of Ruby code that will output
-  # the completed template when run.
+  # :call-seq:
+  #   ERB.new(template, trim_mode: nil, eoutvar: '_erbout')
   #
-  # If _trim_mode_ is passed a String containing one or more of the following
-  # modifiers, ERB will adjust its code generation as listed:
+  # Returns a new \ERB object containing the given string +template+.
   #
-  #     %  enables Ruby code processing for lines beginning with %
-  #     <> omit newline for lines starting with <% and ending in %>
-  #     >  omit newline for lines ending in %>
-  #     -  omit blank lines ending in -%>
+  # For details about `template`, its embedded tags, and generated results, see ERB.
   #
-  # _eoutvar_ can be used to set the name of the variable ERB will build up
-  # its output in.  This is useful when you need to run multiple ERB
-  # templates through the same binding and/or when you want to control where
-  # output ends up.  Pass the name of the variable to be used inside a String.
+  # **Keyword Argument `trim_mode`**
   #
-  # === Example
+  # You can use keyword argument `trim_mode: '%'`
+  # to enable the [shorthand format][shorthand format] for execution tags.
   #
-  #  require "erb"
+  # This value allows [blank line control][blank line control]:
   #
-  #  # build data class
-  #  class Listings
-  #    PRODUCT = { :name => "Chicken Fried Steak",
-  #                :desc => "A well messages pattie, breaded and fried.",
-  #                :cost => 9.95 }
+  # - `'-'`: Omit each blank line ending with `'%>'`.
   #
-  #    attr_reader :product, :price
+  # Other values allow [newline control][newline control]:
   #
-  #    def initialize( product = "", price = "" )
-  #      @product = product
-  #      @price = price
-  #    end
+  # - `'>'`: Omit newline for each line ending with `'%>'`.
+  # - `'<>'`: Omit newline for each line starting with `'<%'` and ending with `'%>'`.
   #
-  #    def build
-  #      b = binding
-  #      # create and run templates, filling member data variables
-  #      ERB.new(<<~'END_PRODUCT', trim_mode: "", eoutvar: "@product").result b
-  #        <%= PRODUCT[:name] %>
-  #        <%= PRODUCT[:desc] %>
-  #      END_PRODUCT
-  #      ERB.new(<<~'END_PRICE', trim_mode: "", eoutvar: "@price").result b
-  #        <%= PRODUCT[:name] %> -- <%= PRODUCT[:cost] %>
-  #        <%= PRODUCT[:desc] %>
-  #      END_PRICE
-  #    end
-  #  end
+  # You can also [combine trim modes][combine trim modes].
   #
-  #  # setup template data
-  #  listings = Listings.new
-  #  listings.build
+  # **Keyword Argument `eoutvar`**
   #
-  #  puts listings.product + "\n" + listings.price
+  # The string value of keyword argument `eoutvar` specifies the name of the variable
+  # that method #result uses to construct its result string;
+  # see #src.
   #
-  # _Generates_
+  # This is useful when you need to run multiple \ERB templates through the same binding
+  # and/or when you want to control where output ends up.
   #
-  #  Chicken Fried Steak
-  #  A well messages pattie, breaded and fried.
+  # It's good practice to choose a variable name that begins with an underscore: `'_'`.
   #
-  #  Chicken Fried Steak -- 9.95
-  #  A well messages pattie, breaded and fried.
+  # [blank line control]: rdoc-ref:ERB@Suppressing+Unwanted+Blank+Lines
+  # [combine trim modes]: rdoc-ref:ERB@Combining+Trim+Modes
+  # [newline control]: rdoc-ref:ERB@Suppressing+Unwanted+Newlines
+  # [shorthand format]: rdoc-ref:ERB@Shorthand+Format+for+Execution+Tags
   #
-  def initialize(str, safe_level=NOT_GIVEN, legacy_trim_mode=NOT_GIVEN, legacy_eoutvar=NOT_GIVEN, trim_mode: nil, eoutvar: '_erbout')
-    # Complex initializer for $SAFE deprecation at [Feature #14256]. Use keyword arguments to pass trim_mode or eoutvar.
-    if safe_level != NOT_GIVEN
-      warn 'Passing safe_level with the 2nd argument of ERB.new is deprecated. Do not use it, and specify other arguments as keyword arguments.', uplevel: 1
-    end
-    if legacy_trim_mode != NOT_GIVEN
-      warn 'Passing trim_mode with the 3rd argument of ERB.new is deprecated. Use keyword argument like ERB.new(str, trim_mode: ...) instead.', uplevel: 1
-      trim_mode = legacy_trim_mode
-    end
-    if legacy_eoutvar != NOT_GIVEN
-      warn 'Passing eoutvar with the 4th argument of ERB.new is deprecated. Use keyword argument like ERB.new(str, eoutvar: ...) instead.', uplevel: 1
-      eoutvar = legacy_eoutvar
-    end
-
+  def initialize(str, trim_mode: nil, eoutvar: '_erbout')
     compiler = make_compiler(trim_mode)
     set_eoutvar(compiler, eoutvar)
     @src, @encoding, @frozen_string = *compiler.compile(str)
+    @src.freeze
     @filename = nil
     @lineno = 0
     @_init = self.class.singleton_class
   end
-  NOT_GIVEN = Object.new
-  private_constant :NOT_GIVEN
-
-  ##
-  # Creates a new compiler for ERB.  See ERB::Compiler.new for details
 
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   make_compiler -> erb_compiler
+  #
+  # Returns a new ERB::Compiler with the given `trim_mode`;
+  # for `trim_mode` values, see ERB.new:
+  #
+  # ```
+  # ERB.new('').make_compiler(nil)
+  # # => #<ERB::Compiler:0x000001cff9467678 @insert_cmd="print", @percent=false, @post_cmd=[], @pre_cmd=[], @put_cmd="print", @trim_mode=nil>
+  # ```
+  #
   def make_compiler(trim_mode)
     ERB::Compiler.new(trim_mode)
   end
 
-  # The Ruby code generated by ERB
+  # :markup: markdown
+  #
+  # Returns the Ruby code that, when executed, generates the result;
+  # the code is executed by method #result,
+  # and by its wrapper methods #result_with_hash and #run:
+  #
+  # ```
+  # template = 'The time is <%= Time.now %>.'
+  # erb = ERB.new(template)
+  # erb.src
+  # # => "#coding:UTF-8\n_erbout = +''; _erbout.<< \"The time is \".freeze; _erbout.<<(( Time.now ).to_s); _erbout.<< \".\".freeze; _erbout"
+  # erb.result
+  # # => "The time is 2025-09-18 15:58:08 -0500."
+  # ```
+  #
+  # In a more readable format:
+  #
+  # ```
+  #   # puts erb.src.split('; ')
+  #   # #coding:UTF-8
+  #   # _erbout = +''
+  #   # _erbout.<< "The time is ".freeze
+  #   # _erbout.<<(( Time.now ).to_s)
+  #   # _erbout.<< ".".freeze
+  #   # _erbout
+  # ```
+  #
+  # Variable `_erbout` is used to store the intermediate results in the code;
+  # the name `_erbout` is the default in ERB.new,
+  # and can be changed via keyword argument `eoutvar`:
+  #
+  # ```
+  # erb = ERB.new(template, eoutvar: '_foo')
+  # puts template.src.split('; ')
+  # #coding:UTF-8
+  # _foo = +''
+  # _foo.<< "The time is ".freeze
+  # _foo.<<(( Time.now ).to_s)
+  # _foo.<< ".".freeze
+  # _foo
+  # ```
+  #
   attr_reader :src
 
-  # The encoding to eval
+  # :markup: markdown
+  #
+  # Returns the encoding of `self`;
+  # see [Encodings][encodings]:
+  #
+  # [encodings]: rdoc-ref:ERB@Encodings
+  #
   attr_reader :encoding
 
-  # The optional _filename_ argument passed to Kernel#eval when the ERB code
-  # is run
+  # :markup: markdown
+  #
+  # Sets or returns the file name to be used in reporting errors;
+  # see [Error Reporting][error reporting].
+  #
+  # [error reporting]: rdoc-ref:ERB@Error+Reporting
   attr_accessor :filename
 
-  # The optional _lineno_ argument passed to Kernel#eval when the ERB code
-  # is run
+  # :markup: markdown
+  #
+  # Sets or returns the line number to be used in reporting errors;
+  # see [Error Reporting][error reporting].
+  #
+  # [error reporting]: rdoc-ref:ERB@Error+Reporting
   attr_accessor :lineno
 
+  # :markup: markdown
   #
-  # Sets optional filename and line number that will be used in ERB code
-  # evaluation and error reporting. See also #filename= and #lineno=
-  #
-  #   erb = ERB.new('<%= some_x %>')
-  #   erb.render
-  #   # undefined local variable or method `some_x'
-  #   #   from (erb):1
+  # :call-seq:
+  #   location = [filename, lineno] => [filename, lineno]
+  #   location = filename -> filename
   #
-  #   erb.location = ['file.erb', 3]
-  #   # All subsequent error reporting would use new location
-  #   erb.render
-  #   # undefined local variable or method `some_x'
-  #   #   from file.erb:4
+  # Sets the values of #filename and, if given, #lineno;
+  # see [Error Reporting][error reporting].
   #
+  # [error reporting]: rdoc-ref:ERB@Error+Reporting
   def location=((filename, lineno))
     @filename = filename
     @lineno = lineno if lineno
   end
 
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   set_eoutvar(compiler, eoutvar = '_erbout') -> [eoutvar]
   #
-  # Can be used to set _eoutvar_ as described in ERB::new.  It's probably
-  # easier to just use the constructor though, since calling this method
-  # requires the setup of an ERB _compiler_ object.
+  # Sets the `eoutvar` value in the ERB::Compiler object `compiler`;
+  # returns a 1-element array containing the value of `eoutvar`:
+  #
+  # ```
+  # template = ERB.new('')
+  # compiler = template.make_compiler(nil)
+  # pp compiler
+  # #<ERB::Compiler:0x000001cff8a9aa00
+  #  @insert_cmd="print",
+  #  @percent=false,
+  #  @post_cmd=[],
+  #  @pre_cmd=[],
+  #  @put_cmd="print",
+  #  @trim_mode=nil>
+  # template.set_eoutvar(compiler, '_foo') # => ["_foo"]
+  # pp compiler
+  # #<ERB::Compiler:0x000001cff8a9aa00
+  #  @insert_cmd="_foo.<<",
+  #  @percent=false,
+  #  @post_cmd=["_foo"],
+  #  @pre_cmd=["_foo = +''"],
+  #  @put_cmd="_foo.<<",
+  #  @trim_mode=nil>
+  # ```
   #
   def set_eoutvar(compiler, eoutvar = '_erbout')
     compiler.put_cmd = "#{eoutvar}.<<"
@@ -409,18 +977,34 @@ class ERB
     compiler.post_cmd = [eoutvar]
   end
 
-  # Generate results and print them. (see ERB#result)
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   run(binding = new_toplevel) -> nil
+  #
+  # Like #result, but prints the result string (instead of returning it);
+  # returns `nil`.
   def run(b=new_toplevel)
     print self.result(b)
   end
 
+  # :markup: markdown
   #
-  # Executes the generated ERB code to produce a completed template, returning
-  # the results of that code.  (See ERB::new for details on how this process
-  # can be affected by _safe_level_.)
+  # :call-seq:
+  #   result(binding = new_toplevel) -> new_string
   #
-  # _b_ accepts a Binding object which is used to set the context of
-  # code evaluation.
+  # Returns the string result formed by processing \ERB tags found in the stored template in `self`.
+  #
+  # With no argument given, uses the default binding;
+  # see [Default Binding][default binding].
+  #
+  # With argument `binding` given, uses the local binding;
+  # see [Local Binding][local binding].
+  #
+  # See also #result_with_hash.
+  #
+  # [default binding]: rdoc-ref:ERB@Default+Binding
+  # [local binding]: rdoc-ref:ERB@Local+Binding
   #
   def result(b=new_toplevel)
     unless @_init.equal?(self.class.singleton_class)
@@ -429,8 +1013,18 @@ class ERB
     eval(@src, b, (@filename || '(erb)'), @lineno)
   end
 
-  # Render a template on a new toplevel binding with local variables specified
-  # by a Hash object.
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   result_with_hash(hash) -> new_string
+  #
+  # Returns the string result formed by processing \ERB tags found in the stored string in `self`;
+  # see [Augmented Binding][augmented binding].
+  #
+  # See also #result.
+  #
+  # [augmented binding]: rdoc-ref:ERB@Augmented+Binding
+  #
   def result_with_hash(hash)
     b = new_toplevel(hash.keys)
     hash.each_pair do |key, value|
@@ -439,10 +1033,22 @@ class ERB
     result(b)
   end
 
-  ##
-  # Returns a new binding each time *near* TOPLEVEL_BINDING for runs that do
-  # not specify a binding.
-
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   new_toplevel(symbols) -> new_binding
+  #
+  # Returns a new binding based on `TOPLEVEL_BINDING`;
+  # used to create a default binding for a call to #result.
+  #
+  # See [Default Binding][default binding].
+  #
+  # Argument `symbols` is an array of symbols;
+  # each symbol `symbol` is defined as a new variable to hide and
+  # prevent it from overwriting a variable of the same name already
+  # defined within the binding.
+  #
+  # [default binding]: rdoc-ref:ERB@Default+Binding
   def new_toplevel(vars = nil)
     b = TOPLEVEL_BINDING
     if vars
@@ -455,49 +1061,116 @@ class ERB
   end
   private :new_toplevel
 
-  # Define _methodname_ as instance method of _mod_ from compiled Ruby source.
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   def_method(module, method_signature, filename = '(ERB)') -> method_name
+  #
+  # Creates and returns a new instance method in the given module `module`;
+  # returns the method name as a symbol.
+  #
+  # The method is created from the given `method_signature`,
+  # which consists of the method name and its argument names (if any).
+  #
+  # The `filename` sets the value of #filename;
+  # see [Error Reporting][error reporting].
+  #
+  # [error reporting]: rdoc-ref:ERB@Error+Reporting
+  #
+  # ```
+  # template = '<%= arg1 %> <%= arg2 %>'
+  # erb = ERB.new(template)
+  # MyModule = Module.new
+  # erb.def_method(MyModule, 'render(arg1, arg2)') # => :render
+  # class MyClass; include MyModule; end
+  # MyClass.new.render('foo', 123)                      # => "foo 123"
+  # ```
   #
-  # example:
-  #   filename = 'example.rhtml'   # 'arg1' and 'arg2' are used in example.rhtml
-  #   erb = ERB.new(File.read(filename))
-  #   erb.def_method(MyClass, 'render(arg1, arg2)', filename)
-  #   print MyClass.new.render('foo', 123)
   def def_method(mod, methodname, fname='(ERB)')
+    unless @_init.equal?(self.class.singleton_class)
+      raise ArgumentError, "not initialized"
+    end
     src = self.src.sub(/^(?!#|$)/) {"def #{methodname}\n"} << "\nend\n"
     mod.module_eval do
       eval(src, binding, fname, -1)
     end
   end
 
-  # Create unnamed module, define _methodname_ as instance method of it, and return it.
-  #
-  # example:
-  #   filename = 'example.rhtml'   # 'arg1' and 'arg2' are used in example.rhtml
-  #   erb = ERB.new(File.read(filename))
-  #   erb.filename = filename
-  #   MyModule = erb.def_module('render(arg1, arg2)')
-  #   class MyClass
-  #     include MyModule
-  #   end
+  # :markup: markdown
+  #
+  # :call-seq:
+  #    def_module(method_name = 'erb') -> new_module
+  #
+  # Returns a new nameless module that has instance method `method_name`.
+  #
+  # ```
+  # template = '<%= arg1 %> <%= arg2 %>'
+  # erb = ERB.new(template)
+  # MyModule = template.def_module('render(arg1, arg2)')
+  # class MyClass
+  #   include MyModule
+  # end
+  # MyClass.new.render('foo', 123)
+  # # => "foo 123"
+  # ```
+  #
   def def_module(methodname='erb')
     mod = Module.new
     def_method(mod, methodname, @filename || '(ERB)')
     mod
   end
 
-  # Define unnamed class which has _methodname_ as instance method, and return it.
+  # :markup: markdown
+  #
+  # :call-seq:
+  #   def_class(super_class = Object, method_name = 'result') -> new_class
+  #
+  # Returns a new nameless class whose superclass is `super_class`,
+  # and which has instance method `method_name`.
+  #
+  # Create a template from HTML that has embedded expression tags that use `@arg1` and `@arg2`:
+  #
+  # ```
+  # html = <<TEMPLATE
+  # <html>
+  # <body>
+  #   <p><%= @arg1 %></p>
+  #   <p><%= @arg2 %></p>
+  # </body>
+  # </html>
+  # TEMPLATE
+  # template = ERB.new(html)
+  # ```
+  #
+  # Create a base class that has `@arg1` and `@arg2`:
   #
-  # example:
-  #   class MyClass_
-  #     def initialize(arg1, arg2)
-  #       @arg1 = arg1;  @arg2 = arg2
-  #     end
+  # ```
+  # class MyBaseClass
+  #   def initialize(arg1, arg2)
+  #     @arg1 = arg1
+  #     @arg2 = arg2
   #   end
-  #   filename = 'example.rhtml'  # @arg1 and @arg2 are used in example.rhtml
-  #   erb = ERB.new(File.read(filename))
-  #   erb.filename = filename
-  #   MyClass = erb.def_class(MyClass_, 'render()')
-  #   print MyClass.new('foo', 123).render()
+  # end
+  # ```
+  #
+  # Use method #def_class to create a subclass that has method `:render`:
+  #
+  # ```
+  # MySubClass = template.def_class(MyBaseClass, :render)
+  # ```
+  #
+  # Generate the result:
+  #
+  # ```
+  # puts MySubClass.new('foo', 123).render
+  # <html>
+  # <body>
+  #   <p>foo</p>
+  #   <p>123</p>
+  # </body>
+  # </html>
+  # ```
+  #
   def def_class(superklass=Object, methodname='result')
     cls = Class.new(superklass)
     def_method(cls, methodname, @filename || '(ERB)')
diff --git a/lib/erb/compiler.rb b/lib/erb/compiler.rb
index 7096c8dcea..6d70288b4f 100644
--- a/lib/erb/compiler.rb
+++ b/lib/erb/compiler.rb
@@ -80,10 +80,16 @@ class ERB::Compiler # :nodoc:
   end
 
   class Scanner # :nodoc:
-    @scanner_map = {}
+    @scanner_map = defined?(Ractor) ? Ractor.make_shareable({}) : {}
     class << self
-      def register_scanner(klass, trim_mode, percent)
-        @scanner_map[[trim_mode, percent]] = klass
+      if defined?(Ractor)
+        def register_scanner(klass, trim_mode, percent)
+          @scanner_map = Ractor.make_shareable({ **@scanner_map, [trim_mode, percent] => klass })
+        end
+      else
+        def register_scanner(klass, trim_mode, percent)
+          @scanner_map[[trim_mode, percent]] = klass
+        end
       end
       alias :regist_scanner :register_scanner
     end
@@ -219,7 +225,7 @@ class ERB::Compiler # :nodoc:
       end
     end
 
-    ERB_STAG = %w(<%= <%# <%)
+    ERB_STAG = %w(<%= <%# <%).freeze
     def is_erb_stag?(s)
       ERB_STAG.member?(s)
     end
@@ -466,7 +472,16 @@ class ERB::Compiler # :nodoc:
     return enc, frozen
   end
 
+  # :stopdoc:
+  WARNING_UPLEVEL = Class.new {
+    attr_reader :c
+    def initialize from
+      @c = caller.length - from.length
+    end
+  }.new(caller(0)).c
+  private_constant :WARNING_UPLEVEL
+
   def warn_invalid_trim_mode(mode, uplevel:)
-    warn "Invalid ERB trim mode: #{mode.inspect} (trim_mode: nil, 0, 1, 2, or String composed of '%' and/or '-', '>', '<>')", uplevel: uplevel + 1
+    warn "Invalid ERB trim mode: #{mode.inspect} (trim_mode: nil, 0, 1, 2, or String composed of '%' and/or '-', '>', '<>')", uplevel: uplevel + WARNING_UPLEVEL
   end
 end
diff --git a/lib/erb/def_method.rb b/lib/erb/def_method.rb
index aee989a926..e503b37140 100644
--- a/lib/erb/def_method.rb
+++ b/lib/erb/def_method.rb
@@ -1,5 +1,5 @@
 # frozen_string_literal: true
-#--
+
 # ERB::DefMethod
 #
 # Utility module to define eRuby script as instance method.
diff --git a/lib/erb/erb.gemspec b/lib/erb/erb.gemspec
new file mode 100644
index 0000000000..70113a2a04
--- /dev/null
+++ b/lib/erb/erb.gemspec
@@ -0,0 +1,37 @@
+begin
+  require_relative 'lib/erb/version'
+rescue LoadError
+  # for Ruby core repository
+  require_relative 'version'
+end
+
+Gem::Specification.new do |spec|
+  spec.name          = 'erb'
+  spec.version       = ERB::VERSION
+  spec.authors       = ['Masatoshi SEKI', 'Takashi Kokubun']
+  spec.email         = ['seki@ruby-lang.org', 'k0kubun@ruby-lang.org']
+
+  spec.summary       = %q{An easy to use but powerful templating system for Ruby.}
+  spec.description   = %q{An easy to use but powerful templating system for Ruby.}
+  spec.homepage      = 'https://github.com/ruby/erb'
+  spec.licenses      = ['Ruby', 'BSD-2-Clause']
+
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = spec.homepage
+  spec.metadata['changelog_uri'] = "https://github.com/ruby/erb/blob/v#{spec.version}/NEWS.md"
+
+  spec.files = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|\.git|\.github)/}) }
+  end
+  spec.bindir        = 'libexec'
+  spec.executables   = ['erb']
+  spec.require_paths = ['lib']
+
+  spec.required_ruby_version = '>= 3.2.0'
+
+  if RUBY_ENGINE == 'jruby'
+    spec.platform = 'java'
+  else
+    spec.extensions = ['ext/erb/escape/extconf.rb']
+  end
+end
diff --git a/lib/erb/util.rb b/lib/erb/util.rb
index 1d2a36275d..d7d69eb4f1 100644
--- a/lib/erb/util.rb
+++ b/lib/erb/util.rb
@@ -1,18 +1,25 @@
 # frozen_string_literal: true
-#--
-# ERB::Escape
-#
-# A subset of ERB::Util. Unlike ERB::Util#html_escape, we expect/hope
-# Rails will not monkey-patch ERB::Escape#html_escape.
+
+# Load CGI.escapeHTML and CGI.escapeURIComponent.
+# CRuby:
+#   cgi.gem v0.1.0+ (Ruby 2.7-3.4) and Ruby 4.0+ stdlib have 'cgi/escape' and CGI.escapeHTML.
+#   cgi.gem v0.3.3+ (Ruby 3.2-3.4) and Ruby 4.0+ stdlib have CGI.escapeURIComponent.
+# JRuby: cgi.gem has a Java extension 'cgi/escape'.
+# TruffleRuby: lib/truffle/cgi/escape.rb requires 'cgi/util'.
+require 'cgi/escape'
+
+# Load or define ERB::Escape#html_escape.
+# We don't build the C extension 'cgi/escape' for JRuby, TruffleRuby, and WASM.
+# miniruby (used by CRuby build scripts) also fails to load erb/escape.so.
 begin
-  # We don't build the C extension for JRuby, TruffleRuby, and WASM
-  if $LOAD_PATH.resolve_feature_path('erb/escape')
-    require 'erb/escape'
-  end
-rescue LoadError # resolve_feature_path raises LoadError on TruffleRuby 22.3.0
-end
-unless defined?(ERB::Escape)
+  require 'erb/escape'
+rescue LoadError
+  # ERB::Escape
+  #
+  # A subset of ERB::Util. Unlike ERB::Util#html_escape, we expect/hope
+  # Rails will not monkey-patch ERB::Escape#html_escape.
   module ERB::Escape
+    # :stopdoc:
     def html_escape(s)
       CGI.escapeHTML(s.to_s)
     end
@@ -20,7 +27,6 @@ unless defined?(ERB::Escape)
   end
 end
 
-#--
 # ERB::Util
 #
 # A utility module for conversion routines, often handy in HTML generation.
@@ -42,20 +48,28 @@ module ERB::Util
   alias h html_escape
   module_function :h
 
-  #
-  # A utility method for encoding the String _s_ as a URL.
-  #
-  #   require "erb"
-  #   include ERB::Util
-  #
-  #   puts url_encode("Programming Ruby:  The Pragmatic Programmer's Guide")
-  #
-  # _Generates_
-  #
-  #   Programming%20Ruby%3A%20%20The%20Pragmatic%20Programmer%27s%20Guide
-  #
-  def url_encode(s)
-    CGI.escapeURIComponent(s.to_s)
+  if CGI.respond_to?(:escapeURIComponent)
+    #
+    # A utility method for encoding the String _s_ as a URL.
+    #
+    #   require "erb"
+    #   include ERB::Util
+    #
+    #   puts url_encode("Programming Ruby:  The Pragmatic Programmer's Guide")
+    #
+    # _Generates_
+    #
+    #   Programming%20Ruby%3A%20%20The%20Pragmatic%20Programmer%27s%20Guide
+    #
+    def url_encode(s)
+      CGI.escapeURIComponent(s.to_s)
+    end
+  else # cgi.gem <= v0.3.2
+    def url_encode(s)
+      s.to_s.b.gsub(/[^a-zA-Z0-9_\-.~]/n) do |m|
+        sprintf("%%%02X", m.unpack1("C"))
+      end
+    end
   end
   alias u url_encode
   module_function :u
diff --git a/lib/erb/version.rb b/lib/erb/version.rb
index b5fe39b330..fde4a2776a 100644
--- a/lib/erb/version.rb
+++ b/lib/erb/version.rb
@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 class ERB
-  VERSION = '4.0.4'
-  private_constant :VERSION
+  # The string \ERB version.
+  VERSION = '6.0.4'
 end
diff --git a/lib/error_highlight/base.rb b/lib/error_highlight/base.rb
index b9c68b8eb8..5fffe5ec34 100644
--- a/lib/error_highlight/base.rb
+++ b/lib/error_highlight/base.rb
@@ -1,13 +1,13 @@
 require_relative "version"
 
 module ErrorHighlight
-  # Identify the code fragment at that a given exception occurred.
+  # Identify the code fragment where a given exception occurred.
   #
   # Options:
   #
   # point_type: :name | :args
-  #   :name (default) points the method/variable name that the exception occurred.
-  #   :args points the arguments of the method call that the exception occurred.
+  #   :name (default) points to the method/variable name where the exception occurred.
+  #   :args points to the arguments of the method call where the exception occurred.
   #
   # backtrace_location: Thread::Backtrace::Location
   #   It locates the code fragment of the given backtrace_location.
@@ -28,7 +28,7 @@ module ErrorHighlight
   # Currently, ErrorHighlight.spot only supports a single-line code fragment.
   # Therefore, if the return value is not nil, first_lineno and last_lineno will have
   # the same value. If the relevant code fragment spans multiple lines
-  # (e.g., Array#[] of +ary[(newline)expr(newline)]+), the method will return nil.
+  # (e.g., Array#[] of <tt>ary[(newline)expr(newline)]</tt>), the method will return nil.
   # This restriction may be removed in the future.
   def self.spot(obj, **opts)
     case obj
@@ -60,14 +60,14 @@ module ErrorHighlight
         rescue RuntimeError => error
           # RubyVM::AbstractSyntaxTree.of raises an error with a message that
           # includes "prism" when the ISEQ was compiled with the prism compiler.
-          # In this case, we'll set the node to `nil`. In the future, we will
-          # reparse with the prism parser and pass the parsed node to Spotter.
+          # In this case, we'll try to parse again with prism instead.
           raise unless error.message.include?("prism")
+          prism_find(loc)
         end
 
       Spotter.new(node, **opts).spot
 
-    when RubyVM::AbstractSyntaxTree::Node
+    when RubyVM::AbstractSyntaxTree::Node, Prism::Node
       Spotter.new(obj, **opts).spot
 
     else
@@ -81,6 +81,21 @@ module ErrorHighlight
     return nil
   end
 
+  # Accepts a Thread::Backtrace::Location object and returns a Prism::Node
+  # corresponding to the backtrace location in the source code.
+  def self.prism_find(location)
+    require "prism"
+    return nil if Prism::VERSION < "1.0.0"
+
+    absolute_path = location.absolute_path
+    return unless absolute_path
+
+    node_id = RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(location)
+    Prism.parse_file(absolute_path).value.breadth_first_search { |node| node.node_id == node_id }
+  end
+
+  private_class_method :prism_find
+
   class Spotter
     class NonAscii < Exception; end
     private_constant :NonAscii
@@ -98,7 +113,7 @@ module ErrorHighlight
         snippet = @node.script_lines[lineno - 1 .. last_lineno - 1].join("")
         snippet += "\n" unless snippet.end_with?("\n")
 
-        # It require some work to support Unicode (or multibyte) characters.
+        # It requires some work to support Unicode (or multibyte) characters.
         # Tentatively, we stop highlighting if the code snippet has non-ascii characters.
         # See https://github.com/ruby/error_highlight/issues/4
         raise NonAscii unless snippet.ascii_only?
@@ -107,19 +122,17 @@ module ErrorHighlight
       end
     end
 
-    OPT_GETCONSTANT_PATH = (RUBY_VERSION.split(".").map {|s| s.to_i } <=> [3, 2]) >= 0
-    private_constant :OPT_GETCONSTANT_PATH
-
     def spot
       return nil unless @node
 
-      if OPT_GETCONSTANT_PATH && @node.type == :COLON2
-        # In Ruby 3.2 or later, a nested constant access (like `Foo::Bar::Baz`)
-        # is compiled to one instruction (opt_getconstant_path).
-        # @node points to the node of the whole `Foo::Bar::Baz` even if `Foo`
-        # or `Foo::Bar` causes NameError.
-        # So we try to spot the sub-node that causes the NameError by using
-        # `NameError#name`.
+      # In Ruby 3.2 or later, a nested constant access (like `Foo::Bar::Baz`)
+      # is compiled to one instruction (opt_getconstant_path).
+      # @node points to the node of the whole `Foo::Bar::Baz` even if `Foo`
+      # or `Foo::Bar` causes NameError.
+      # So we try to spot the sub-node that causes the NameError by using
+      # `NameError#name`.
+      case @node.type
+      when :COLON2
         subnodes = []
         node = @node
         while node.type == :COLON2
@@ -139,6 +152,21 @@ module ErrorHighlight
           # Do nothing; opt_getconstant_path is used only when the const base is
           # NODE_CONST (`Foo`) or NODE_COLON3 (`::Foo`)
         end
+      when :constant_path_node
+        subnodes = []
+        node = @node
+
+        begin
+          subnodes << node if node.name == @name
+        end while (node = node.parent).is_a?(Prism::ConstantPathNode)
+
+        if node.is_a?(Prism::ConstantReadNode) && node.name == @name
+          subnodes << node
+        end
+
+        # If we found only one sub-node whose name is equal to @name, use it
+        return nil if subnodes.size != 1
+        @node = subnodes.first
       end
 
       case @node.type
@@ -205,6 +233,86 @@ module ErrorHighlight
 
       when :OP_CDECL
         spot_op_cdecl
+
+      when :DEFN
+        raise NotImplementedError if @point_type != :name
+        spot_defn
+
+      when :DEFS
+        raise NotImplementedError if @point_type != :name
+        spot_defs
+
+      when :LAMBDA
+        spot_lambda
+
+      when :ITER
+        spot_iter
+
+      when :call_node
+        case @point_type
+        when :name
+          prism_spot_call_for_name
+        when :args
+          prism_spot_call_for_args
+        end
+
+      when :local_variable_operator_write_node
+        case @point_type
+        when :name
+          prism_spot_local_variable_operator_write_for_name
+        when :args
+          prism_spot_local_variable_operator_write_for_args
+        end
+
+      when :call_operator_write_node
+        case @point_type
+        when :name
+          prism_spot_call_operator_write_for_name
+        when :args
+          prism_spot_call_operator_write_for_args
+        end
+
+      when :index_operator_write_node
+        case @point_type
+        when :name
+          prism_spot_index_operator_write_for_name
+        when :args
+          prism_spot_index_operator_write_for_args
+        end
+
+      when :constant_read_node
+        prism_spot_constant_read
+
+      when :constant_path_node
+        prism_spot_constant_path
+
+      when :constant_path_operator_write_node
+        prism_spot_constant_path_operator_write
+
+      when :def_node
+        case @point_type
+        when :name
+          prism_spot_def_for_name
+        when :args
+          raise NotImplementedError
+        end
+
+      when :lambda_node
+        case @point_type
+        when :name
+          prism_spot_lambda_for_name
+        when :args
+          raise NotImplementedError
+        end
+
+      when :block_node
+        case @point_type
+        when :name
+          prism_spot_block_for_name
+        when :args
+          raise NotImplementedError
+        end
+
       end
 
       if @snippet && @beg_column && @end_column && @beg_column < @end_column
@@ -269,6 +377,7 @@ module ErrorHighlight
         end
       elsif mid.to_s =~ /\A\W+\z/ && lines.match(/\G\s*(#{ Regexp.quote(mid) })=.*\n/, nd_recv.last_column)
         @snippet = $` + $&
+        @beg_lineno = @end_lineno = lineno
         @beg_column = $~.begin(1)
         @end_column = $~.end(1)
       end
@@ -395,7 +504,6 @@ module ErrorHighlight
     def spot_fcall_for_args
       _mid, nd_args = @node.children
       if nd_args && nd_args.first_lineno == nd_args.last_lineno
-        # binary operator
         fetch_line(nd_args.first_lineno)
         @beg_column = nd_args.first_column
         @end_column = nd_args.last_column
@@ -507,8 +615,9 @@ module ErrorHighlight
         @beg_column = nd_parent.last_column
         @end_column = @node.last_column
       else
-        @snippet = @fetch[@node.last_lineno]
+        fetch_line(@node.last_lineno)
         if @snippet[...@node.last_column].match(/#{ Regexp.quote(const) }\z/)
+          @beg_lineno = @end_lineno = @node.last_lineno
           @beg_column = $~.begin(0)
           @end_column = $~.end(0)
         end
@@ -522,7 +631,7 @@ module ErrorHighlight
       nd_lhs, op, _nd_rhs = @node.children
       *nd_parent_lhs, _const = nd_lhs.children
       if @name == op
-        @snippet = @fetch[nd_lhs.last_lineno]
+        fetch_line(nd_lhs.last_lineno)
         if @snippet.match(/\G\s*(#{ Regexp.quote(op) })=/, nd_lhs.last_column)
           @beg_column = $~.begin(1)
           @end_column = $~.end(1)
@@ -532,22 +641,297 @@ module ErrorHighlight
         @end_column = nd_lhs.last_column
         if nd_parent_lhs.empty? # example: ::C += 1
           if nd_lhs.first_lineno == nd_lhs.last_lineno
-            @snippet = @fetch[nd_lhs.last_lineno]
+            fetch_line(nd_lhs.last_lineno)
             @beg_column = nd_lhs.first_column
           end
         else # example: Foo::Bar::C += 1
           if nd_parent_lhs.last.last_lineno == nd_lhs.last_lineno
-            @snippet = @fetch[nd_lhs.last_lineno]
+            fetch_line(nd_lhs.last_lineno)
             @beg_column = nd_parent_lhs.last.last_column
           end
         end
       end
     end
 
+    # Example:
+    #   def bar; end
+    #       ^^^
+    def spot_defn
+      mid, = @node.children
+      fetch_line(@node.first_lineno)
+      if @snippet.match(/\Gdef\s+(#{ Regexp.quote(mid) }\b)/, @node.first_column)
+        @beg_column = $~.begin(1)
+        @end_column = $~.end(1)
+      end
+    end
+
+    # Example:
+    #   def Foo.bar; end
+    #          ^^^^
+    def spot_defs
+      nd_recv, mid, = @node.children
+      fetch_line(nd_recv.last_lineno)
+      if @snippet.match(/\G\s*(\.\s*#{ Regexp.quote(mid) }\b)/, nd_recv.last_column)
+        @beg_column = $~.begin(1)
+        @end_column = $~.end(1)
+      end
+    end
+
+    # Example:
+    #   -> { ... }
+    #   ^^
+    def spot_lambda
+      fetch_line(@node.first_lineno)
+      if @snippet.match(/\G->/, @node.first_column)
+        @beg_column = $~.begin(0)
+        @end_column = $~.end(0)
+      end
+    end
+
+    # Example:
+    #   lambda { ... }
+    #          ^
+    #   define_method :foo do
+    #                      ^^
+    def spot_iter
+      _nd_fcall, nd_scope = @node.children
+      fetch_line(nd_scope.first_lineno)
+      if @snippet.match(/\G(?:do\b|\{)/, nd_scope.first_column)
+        @beg_column = $~.begin(0)
+        @end_column = $~.end(0)
+      end
+    end
+
     def fetch_line(lineno)
       @beg_lineno = @end_lineno = lineno
       @snippet = @fetch[lineno]
     end
+
+    # Take a location from the prism parser and set the necessary instance
+    # variables.
+    def prism_location(location)
+      @beg_lineno = location.start_line
+      @beg_column = location.start_column
+      @end_lineno = location.end_line
+      @end_column = location.end_column
+      @snippet = @fetch[@beg_lineno, @end_lineno]
+    end
+
+    # Example:
+    #   x.foo
+    #    ^^^^
+    #   x.foo(42)
+    #    ^^^^
+    #   x&.foo
+    #    ^^^^^
+    #   x[42]
+    #    ^^^^
+    #   x.foo = 1
+    #    ^^^^^^
+    #   x[42] = 1
+    #    ^^^^^^
+    #   x + 1
+    #     ^
+    #   +x
+    #   ^
+    #   foo(42)
+    #   ^^^
+    #   foo 42
+    #   ^^^
+    #   foo
+    #   ^^^
+    def prism_spot_call_for_name
+      # Explicitly turn off foo.() syntax because error_highlight expects this
+      # to not work.
+      return nil if @node.name == :call && @node.message_loc.nil?
+
+      location = @node.message_loc || @node.call_operator_loc || @node.location
+      location = @node.call_operator_loc.join(location) if @node.call_operator_loc&.start_line == location.start_line
+
+      # If the method name ends with "=" but the message does not, then this is
+      # a method call using the "attribute assignment" syntax
+      # (e.g., foo.bar = 1). In this case we need to go retrieve the = sign and
+      # add it to the location.
+      if (name = @node.name).end_with?("=") && !@node.message.end_with?("=")
+        location = location.adjoin("=")
+      end
+
+      prism_location(location)
+
+      if !name.end_with?("=") && !name.match?(/[[:alpha:]_\[]/)
+        # If the method name is an operator, then error_highlight only
+        # highlights the first line.
+        fetch_line(location.start_line)
+      end
+    end
+
+    # Example:
+    #   x.foo(42)
+    #         ^^
+    #   x[42]
+    #     ^^
+    #   x.foo = 1
+    #           ^
+    #   x[42] = 1
+    #     ^^^^^^^
+    #   x[] = 1
+    #     ^^^^^
+    #   x + 1
+    #       ^
+    #   foo(42)
+    #       ^^
+    #   foo 42
+    #       ^^
+    def prism_spot_call_for_args
+      # Disallow highlighting arguments if there are no arguments.
+      return if @node.arguments.nil?
+
+      # Explicitly turn off foo.() syntax because error_highlight expects this
+      # to not work.
+      return nil if @node.name == :call && @node.message_loc.nil?
+
+      if @node.name == :[]= && @node.opening == "[" && (@node.arguments&.arguments || []).length == 1
+        prism_location(@node.opening_loc.copy(start_offset: @node.opening_loc.start_offset + 1).join(@node.arguments.location))
+      else
+        prism_location(@node.arguments.location)
+      end
+    end
+
+    # Example:
+    #   x += 1
+    #     ^
+    def prism_spot_local_variable_operator_write_for_name
+      prism_location(@node.binary_operator_loc.chop)
+    end
+
+    # Example:
+    #   x += 1
+    #        ^
+    def prism_spot_local_variable_operator_write_for_args
+      prism_location(@node.value.location)
+    end
+
+    # Example:
+    #   x.foo += 42
+    #    ^^^     (for foo)
+    #   x.foo += 42
+    #         ^  (for +)
+    #   x.foo += 42
+    #    ^^^^^^^ (for foo=)
+    def prism_spot_call_operator_write_for_name
+      if !@name.start_with?(/[[:alpha:]_]/)
+        prism_location(@node.binary_operator_loc.chop)
+      else
+        location = @node.message_loc
+        if @node.call_operator_loc.start_line == location.start_line
+          location = @node.call_operator_loc.join(location)
+        end
+
+        location = location.adjoin("=") if @name.end_with?("=")
+        prism_location(location)
+      end
+    end
+
+    # Example:
+    #   x.foo += 42
+    #            ^^
+    def prism_spot_call_operator_write_for_args
+      prism_location(@node.value.location)
+    end
+
+    # Example:
+    #   x[1] += 42
+    #    ^^^    (for [])
+    #   x[1] += 42
+    #        ^  (for +)
+    #   x[1] += 42
+    #    ^^^^^^ (for []=)
+    def prism_spot_index_operator_write_for_name
+      case @name
+      when :[]
+        prism_location(@node.opening_loc.join(@node.closing_loc))
+      when :[]=
+        prism_location(@node.opening_loc.join(@node.closing_loc).adjoin("="))
+      else
+        # Explicitly turn off foo[] += 1 syntax when the operator is not on
+        # the same line because error_highlight expects this to not work.
+        return nil if @node.binary_operator_loc.start_line != @node.opening_loc.start_line
+
+        prism_location(@node.binary_operator_loc.chop)
+      end
+    end
+
+    # Example:
+    #   x[1] += 42
+    #     ^^^^^^^^
+    def prism_spot_index_operator_write_for_args
+      opening_loc =
+        if @node.arguments.nil?
+          @node.opening_loc.copy(start_offset: @node.opening_loc.start_offset + 1)
+        else
+          @node.arguments.location
+        end
+
+      prism_location(opening_loc.join(@node.value.location))
+    end
+
+    # Example:
+    #   Foo
+    #   ^^^
+    def prism_spot_constant_read
+      prism_location(@node.location)
+    end
+
+    # Example:
+    #   Foo::Bar
+    #      ^^^^^
+    def prism_spot_constant_path
+      if @node.parent && @node.parent.location.end_line == @node.location.end_line
+        fetch_line(@node.parent.location.end_line)
+        prism_location(@node.delimiter_loc.join(@node.name_loc))
+      else
+        fetch_line(@node.location.end_line)
+        location = @node.name_loc
+        location = @node.delimiter_loc.join(location) if @node.delimiter_loc.end_line == location.start_line
+        prism_location(location)
+      end
+    end
+
+    # Example:
+    #   Foo::Bar += 1
+    #      ^^^^^^^^
+    def prism_spot_constant_path_operator_write
+      if @name == (target = @node.target).name
+        prism_location(target.delimiter_loc.join(target.name_loc))
+      else
+        prism_location(@node.binary_operator_loc.chop)
+      end
+    end
+
+    # Example:
+    #   def foo()
+    #       ^^^
+    def prism_spot_def_for_name
+      location = @node.name_loc
+      location = @node.operator_loc.join(location) if @node.operator_loc
+      prism_location(location)
+    end
+
+    # Example:
+    #   -> x, y { }
+    #   ^^
+    def prism_spot_lambda_for_name
+      prism_location(@node.operator_loc)
+    end
+
+    # Example:
+    #   lambda { }
+    #          ^
+    #   define_method :foo do |x, y|
+    #                      ^
+    def prism_spot_block_for_name
+      prism_location(@node.opening_loc)
+    end
   end
 
   private_constant :Spotter
diff --git a/lib/error_highlight/core_ext.rb b/lib/error_highlight/core_ext.rb
index b69093f74e..c3354f46cd 100644
--- a/lib/error_highlight/core_ext.rb
+++ b/lib/error_highlight/core_ext.rb
@@ -3,9 +3,38 @@ require_relative "formatter"
 module ErrorHighlight
   module CoreExt
     private def generate_snippet
-      spot = ErrorHighlight.spot(self)
-      return "" unless spot
-      return ErrorHighlight.formatter.message_for(spot)
+      if ArgumentError === self && message =~ /\A(?:wrong number of arguments|missing keyword[s]?|unknown keyword[s]?|no keywords accepted)\b/
+        locs = self.backtrace_locations
+        return "" if locs.size < 2
+        callee_loc, caller_loc = locs
+        callee_spot = ErrorHighlight.spot(self, backtrace_location: callee_loc, point_type: :name)
+        caller_spot = ErrorHighlight.spot(self, backtrace_location: caller_loc, point_type: :name)
+        if caller_spot && callee_spot &&
+            caller_loc.path == callee_loc.path &&
+            caller_loc.lineno == callee_loc.lineno &&
+            caller_spot == callee_spot
+          callee_loc = callee_spot = nil
+        end
+        ret = +"\n"
+        [["caller", caller_loc, caller_spot], ["callee", callee_loc, callee_spot]].each do |header, loc, spot|
+          out = nil
+          if loc
+            out = "    #{ header }: #{ loc.path }:#{ loc.lineno }"
+            if spot
+              _, _, snippet, highlight = ErrorHighlight.formatter.message_for(spot).lines
+              out += "\n    | #{ snippet }      #{ highlight }"
+            else
+              # do nothing
+            end
+          end
+          ret << "\n" + out if out
+        end
+        ret
+      else
+        spot = ErrorHighlight.spot(self)
+        return "" unless spot
+        return ErrorHighlight.formatter.message_for(spot)
+      end
     end
 
     if Exception.method_defined?(:detailed_message)
diff --git a/lib/error_highlight/error_highlight.gemspec b/lib/error_highlight/error_highlight.gemspec
index b2da18df83..edfc4b776f 100644
--- a/lib/error_highlight/error_highlight.gemspec
+++ b/lib/error_highlight/error_highlight.gemspec
@@ -18,7 +18,7 @@ Gem::Specification.new do |spec|
   spec.homepage      = "https://github.com/ruby/error_highlight"
 
   spec.license       = "MIT"
-  spec.required_ruby_version = Gem::Requirement.new(">= 3.1.0.dev")
+  spec.required_ruby_version = Gem::Requirement.new(">= 3.2.0")
 
   spec.files = Dir.chdir(File.expand_path(__dir__)) do
     `git ls-files -z`.split("\x0").reject { |f| f.match(%r{\A(?:test|spec|features)/}) }
diff --git a/lib/error_highlight/formatter.rb b/lib/error_highlight/formatter.rb
index 20ca78d468..d2fad9e75c 100644
--- a/lib/error_highlight/formatter.rb
+++ b/lib/error_highlight/formatter.rb
@@ -1,15 +1,66 @@
 module ErrorHighlight
   class DefaultFormatter
+    MIN_SNIPPET_WIDTH = 20
+
     def self.message_for(spot)
       # currently only a one-line code snippet is supported
-      if spot[:first_lineno] == spot[:last_lineno]
-        indent = spot[:snippet][0...spot[:first_column]].gsub(/[^\t]/, " ")
-        marker = indent + "^" * (spot[:last_column] - spot[:first_column])
+      return "" unless spot[:first_lineno] == spot[:last_lineno]
+
+      snippet      = spot[:snippet]
+      first_column = spot[:first_column]
+      last_column  = spot[:last_column]
+      ellipsis     = "..."
+
+      # truncate snippet to fit in the viewport
+      if max_snippet_width && snippet.size > max_snippet_width
+        available_width = max_snippet_width - ellipsis.size
+        center          = first_column - max_snippet_width / 2
+
+        visible_start  = last_column < available_width ? 0 : [center, 0].max
+        visible_end    = visible_start + max_snippet_width
+        visible_start  = snippet.size - max_snippet_width if visible_end > snippet.size
+
+        prefix = visible_start.positive?    ? ellipsis : ""
+        suffix = visible_end < snippet.size ? ellipsis : ""
 
-        "\n\n#{ spot[:snippet] }#{ marker }"
-      else
-        ""
+        snippet = prefix + snippet[(visible_start + prefix.size)...(visible_end - suffix.size)] + suffix
+        snippet << "\n" unless snippet.end_with?("\n")
+
+        first_column -= visible_start
+        last_column  = [last_column - visible_start, snippet.size - 1].min
       end
+
+      indent = snippet[0...first_column].gsub(/[^\t]/, " ")
+      marker = indent + "^" * (last_column - first_column)
+
+      "\n\n#{ snippet }#{ marker }"
+    end
+
+    def self.max_snippet_width
+      return if Ractor.current[:__error_highlight_max_snippet_width__] == :disabled
+
+      Ractor.current[:__error_highlight_max_snippet_width__] ||= terminal_width
+    end
+
+    def self.max_snippet_width=(width)
+      return Ractor.current[:__error_highlight_max_snippet_width__] = :disabled if width.nil?
+
+      width = width.to_i
+
+      if width < MIN_SNIPPET_WIDTH
+        warn "'max_snippet_width' adjusted to minimum value of #{MIN_SNIPPET_WIDTH}."
+        width = MIN_SNIPPET_WIDTH
+      end
+
+      Ractor.current[:__error_highlight_max_snippet_width__] = width
+    end
+
+    def self.terminal_width
+      # lazy load io/console to avoid loading it when 'max_snippet_width' is manually set
+      require "io/console"
+      $stderr.winsize[1] if $stderr.tty?
+    rescue LoadError, NoMethodError, SystemCallError
+      # skip truncation when terminal window size is unavailable
     end
   end
 
diff --git a/lib/error_highlight/version.rb b/lib/error_highlight/version.rb
index 506d37fbc1..f0a5376b14 100644
--- a/lib/error_highlight/version.rb
+++ b/lib/error_highlight/version.rb
@@ -1,3 +1,3 @@
 module ErrorHighlight
-  VERSION = "0.6.0"
+  VERSION = "0.7.1"
 end
diff --git a/lib/fileutils.gemspec b/lib/fileutils.gemspec
index 76baea3039..2603d664da 100644
--- a/lib/fileutils.gemspec
+++ b/lib/fileutils.gemspec
@@ -17,7 +17,7 @@ Gem::Specification.new do |s|
   s.description = "Several file utility methods for copying, moving, removing, etc."
 
   s.require_path = %w{lib}
-  s.files = ["LICENSE.txt", "README.md", "Rakefile", "fileutils.gemspec", "lib/fileutils.rb"]
+  s.files = ["COPYING", "BSDL", "README.md", "Rakefile", "fileutils.gemspec", "lib/fileutils.rb"]
   s.required_ruby_version = ">= 2.5.0"
 
   s.authors = ["Minero Aoki"]
diff --git a/lib/fileutils.rb b/lib/fileutils.rb
index e8cc355760..0706e007ca 100644
--- a/lib/fileutils.rb
+++ b/lib/fileutils.rb
@@ -181,7 +181,7 @@ end
 #
 module FileUtils
   # The version number.
-  VERSION = "1.7.2"
+  VERSION = "1.8.0"
 
   def self.private_module_function(name)   #:nodoc:
     module_function name
@@ -706,11 +706,12 @@ module FileUtils
   #
   def ln_s(src, dest, force: nil, relative: false, target_directory: true, noop: nil, verbose: nil)
     if relative
-      return ln_sr(src, dest, force: force, noop: noop, verbose: verbose)
+      return ln_sr(src, dest, force: force, target_directory: target_directory, noop: noop, verbose: verbose)
     end
-    fu_output_message "ln -s#{force ? 'f' : ''} #{[src,dest].flatten.join ' '}" if verbose
+    fu_output_message "ln -s#{force ? 'f' : ''}#{
+      target_directory ? '' : 'T'} #{[src,dest].flatten.join ' '}" if verbose
     return if noop
-    fu_each_src_dest0(src, dest) do |s,d|
+    fu_each_src_dest0(src, dest, target_directory) do |s,d|
       remove_file d, true if force
       File.symlink s, d
     end
@@ -730,42 +731,37 @@ module FileUtils
   # Like FileUtils.ln_s, but create links relative to +dest+.
   #
   def ln_sr(src, dest, target_directory: true, force: nil, noop: nil, verbose: nil)
-    options = "#{force ? 'f' : ''}#{target_directory ? '' : 'T'}"
-    dest = File.path(dest)
-    srcs = Array(src)
-    link = proc do |s, target_dir_p = true|
-      s = File.path(s)
-      if target_dir_p
-        d = File.join(destdirs = dest, File.basename(s))
+    cmd = "ln -s#{force ? 'f' : ''}#{target_directory ? '' : 'T'}" if verbose
+    fu_each_src_dest0(src, dest, target_directory) do |s,d|
+      if target_directory
+        parent = File.dirname(d)
+        destdirs = fu_split_path(parent)
+        real_ddirs = fu_split_path(File.realpath(parent))
       else
-        destdirs = File.dirname(d = dest)
+        destdirs ||= fu_split_path(dest)
+        real_ddirs ||= fu_split_path(File.realdirpath(dest))
       end
-      destdirs = fu_split_path(File.realpath(destdirs))
-      if fu_starting_path?(s)
-        srcdirs = fu_split_path((File.realdirpath(s) rescue File.expand_path(s)))
-        base = fu_relative_components_from(srcdirs, destdirs)
-        s = File.join(*base)
+      srcdirs = fu_split_path(s)
+      i = fu_common_components(srcdirs, destdirs)
+      n = destdirs.size - i
+      n -= 1 unless target_directory
+      link1 = fu_clean_components(*Array.new([n, 0].max, '..'), *srcdirs[i..-1])
+      begin
+        real_sdirs = fu_split_path(File.realdirpath(s)) rescue nil
+      rescue
       else
-        srcdirs = fu_clean_components(*fu_split_path(s))
-        base = fu_relative_components_from(fu_split_path(Dir.pwd), destdirs)
-        while srcdirs.first&. == ".." and base.last&.!=("..") and !fu_starting_path?(base.last)
-          srcdirs.shift
-          base.pop
-        end
-        s = File.join(*base, *srcdirs)
+        i = fu_common_components(real_sdirs, real_ddirs)
+        n = real_ddirs.size - i
+        n -= 1 unless target_directory
+        link2 = fu_clean_components(*Array.new([n, 0].max, '..'), *real_sdirs[i..-1])
+        link1 = link2 if link1.size > link2.size
       end
-      fu_output_message "ln -s#{options} #{s} #{d}" if verbose
+      s = File.join(link1)
+      fu_output_message [cmd, s, d].flatten.join(' ') if verbose
       next if noop
       remove_file d, true if force
       File.symlink s, d
     end
-    case srcs.size
-    when 0
-    when 1
-      link[srcs[0], target_directory && File.directory?(dest)]
-    else
-      srcs.each(&link)
-    end
   end
   module_function :ln_sr
 
@@ -800,13 +796,13 @@ module FileUtils
   #   File.file?('dest1/dir1/t2.txt') # => true
   #   File.file?('dest1/dir1/t3.txt') # => true
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference_root: true</tt> - dereferences +src+ if it is a symbolic link.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before creating links.
+  # - +dereference_root+ - dereferences +src+ if it is a symbolic link (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before creating links (+false+ by default).
   #
   # Raises an exception if +dest+ is the path to an existing file or directory
-  # and keyword argument <tt>remove_destination: true</tt> is not given.
+  # and optional argument +remove_destination+ is not given.
   #
   # Related: FileUtils.ln (has different options).
   #
@@ -1029,12 +1025,12 @@ module FileUtils
   # directories, and symbolic links;
   # other file types (FIFO streams, device files, etc.) are not supported.
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference_root: true</tt> - if +src+ is a symbolic link,
-  #   follows the link.
-  # - <tt>preserve: true</tt> - preserves file times.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before copying files.
+  # - +dereference_root+ - if +src+ is a symbolic link,
+  #   follows the link (+false+ by default).
+  # - +preserve+ - preserves file times (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before copying files (+false+ by default).
   #
   # Related: {methods for copying}[rdoc-ref:FileUtils@Copying].
   #
@@ -1065,12 +1061,12 @@ module FileUtils
   #   FileUtils.copy_file('src0.txt', 'dest0.txt')
   #   File.file?('dest0.txt') # => true
   #
-  # Keyword arguments:
+  # Optional arguments:
   #
-  # - <tt>dereference: false</tt> - if +src+ is a symbolic link,
-  #   does not follow the link.
-  # - <tt>preserve: true</tt> - preserves file times.
-  # - <tt>remove_destination: true</tt> - removes +dest+ before copying files.
+  # - +dereference+ - if +src+ is a symbolic link,
+  #   follows the link (+true+ by default).
+  # - +preserve+ - preserves file times (+false+ by default).
+  # - +remove_destination+ - removes +dest+ before copying files (+false+ by default).
   #
   # Related: {methods for copying}[rdoc-ref:FileUtils@Copying].
   #
@@ -1491,7 +1487,8 @@ module FileUtils
   # Related: {methods for deleting}[rdoc-ref:FileUtils@Deleting].
   #
   def remove_dir(path, force = false)
-    remove_entry path, force   # FIXME?? check if it is a directory
+    raise Errno::ENOTDIR, path unless force or File.directory?(path)
+    remove_entry path, force
   end
   module_function :remove_dir
 
@@ -2475,6 +2472,10 @@ module FileUtils
 
   def fu_each_src_dest0(src, dest, target_directory = true)   #:nodoc:
     if tmp = Array.try_convert(src)
+      unless target_directory or tmp.size <= 1
+        tmp = tmp.map {|f| File.path(f)} # A workaround for RBS
+        raise ArgumentError, "extra target #{tmp}"
+      end
       tmp.each do |s|
         s = File.path(s)
         yield s, (target_directory ? File.join(dest, File.basename(s)) : dest)
@@ -2509,7 +2510,11 @@ module FileUtils
     path = File.path(path)
     list = []
     until (parent, base = File.split(path); parent == path or parent == ".")
-      list << base
+      if base != '..' and list.last == '..' and !(fu_have_symlink? && File.symlink?(path))
+        list.pop
+      else
+        list << base
+      end
       path = parent
     end
     list << path
@@ -2517,14 +2522,14 @@ module FileUtils
   end
   private_module_function :fu_split_path
 
-  def fu_relative_components_from(target, base) #:nodoc:
+  def fu_common_components(target, base) #:nodoc:
     i = 0
     while target[i]&.== base[i]
       i += 1
     end
-    Array.new(base.size-i, '..').concat(target[i..-1])
+    i
   end
-  private_module_function :fu_relative_components_from
+  private_module_function :fu_common_components
 
   def fu_clean_components(*comp) #:nodoc:
     comp.shift while comp.first == "."
@@ -2534,7 +2539,7 @@ module FileUtils
     while c = comp.shift
       if c == ".." and clean.last != ".." and !(fu_have_symlink? && File.symlink?(path))
         clean.pop
-        path.chomp!(%r((?<=\A|/)[^/]+/\z), "")
+        path.sub!(%r((?<=\A|/)[^/]+/\z), "")
       else
         clean << c
         path << c << "/"
diff --git a/lib/find.rb b/lib/find.rb
index 98a79cc76d..d9b81eb92d 100644
--- a/lib/find.rb
+++ b/lib/find.rb
@@ -3,40 +3,50 @@
 # find.rb: the Find module for processing all files under a given directory.
 #
 
+# :markup: markdown
 #
-# The +Find+ module supports the top-down traversal of a set of file paths.
-#
-# For example, to total the size of all files under your home directory,
-# ignoring anything in a "dot" directory (e.g. $HOME/.ssh):
-#
-#   require 'find'
-#
-#   total_size = 0
-#
-#   Find.find(ENV["HOME"]) do |path|
-#     if FileTest.directory?(path)
-#       if File.basename(path).start_with?('.')
-#         Find.prune       # Don't look any further into this directory.
-#       else
-#         next
-#       end
-#     else
-#       total_size += FileTest.size(path)
-#     end
-#   end
-#
+# \Module \Find supports the top-down traversal of entries in the file system.
 module Find
 
+  # The version string
   VERSION = "0.2.0"
 
+  # :markup: markdown
   #
-  # Calls the associated block with the name of every file and directory listed
-  # as arguments, then recursively on their subdirectories, and so on.
+  # With a block given, performs a depth-first traversal of each given path in `paths`;
+  # calls the block with each found file or directory path:
   #
-  # Returns an enumerator if no block is given.
+  # ```ruby
+  # paths = []
+  # Find.find('bin', 'jit') {|path| paths << path }
+  # paths
+  # # =>
+  # # ["bin",
+  # #  "bin/gem",
+  # #  "jit",
+  # #  "jit/Cargo.toml",
+  # #  "jit/src",
+  # #  "jit/src/lib.rs"]
+  # ```
   #
-  # See the +Find+ module documentation for an example.
+  # Raises an exception if a given path cannot be read.
   #
+  # When keyword argument `ignore_error` is given as `true` (the default),
+  # certain exceptions during traversal are ignored (i.e., silently rescued):
+  # Errno::ENOENT, Errno::EACCES, Errno::ENOTDIR, Errno::ELOOP, Errno::ENAMETOOLONG, Errno::EINVAL;
+  # when given as `false`, no exceptions are rescued.
+  #
+  # Note that these exceptions may be ignored only in `Find` traversal code;
+  # an exception raised before traversal begins,
+  # or raised while in the block is not ignored.
+  # Each of the calls below raises an Errno::ENOENT exception that is not ignored:
+  #
+  # ```ruby
+  # Find.find('nosuch') { }
+  # Find.find('lib') {|entry| raise Errno::ENOENT }
+  # ```
+  #
+  # With no block given, returns a new Enumerator.
   def find(*paths, ignore_error: true) # :yield: path
     block_given? or return enum_for(__method__, *paths, ignore_error: ignore_error)
 
@@ -74,13 +84,26 @@ module Find
     nil
   end
 
+  # :markup: markdown
+  #
+  # call-seq:
+  #   Find.prune
+  #
+  # This method is meaningful only within a block given with Find.find.
   #
-  # Skips the current file or directory, restarting the loop with the next
-  # entry. If the current file is a directory, that directory will not be
-  # recursively entered. Meaningful only within the block associated with
-  # Find::find.
+  # Inside such a block,
+  # "prunes" the traversed file tree by not descending into the current directory:
   #
-  # See the +Find+ module documentation for an example.
+  # ```ruby
+  # files = []
+  # Find.find('.') do |path|
+  #   Find.prune if File.basename(path) == 'test'
+  #   next unless File.file?(path) && File.extname(path) == '.rb'
+  #   files << path
+  # end
+  # files.size    # => 6690
+  # files.take(3) # => ["./KNOWNBUGS.rb", "./array.rb", "./ast.rb"]
+  # ```
   #
   def prune
     throw :prune
diff --git a/lib/forwardable.rb b/lib/forwardable.rb
index 71b4e6adad..175d6d9c6b 100644
--- a/lib/forwardable.rb
+++ b/lib/forwardable.rb
@@ -109,11 +109,11 @@
 # +delegate.rb+.
 #
 module Forwardable
-  require 'forwardable/impl'
-
   # Version of +forwardable.rb+
-  VERSION = "1.3.3"
+  VERSION = "1.4.0"
   VERSION.freeze
+
+  # Version for backward compatibility
   FORWARDABLE_VERSION = VERSION
   FORWARDABLE_VERSION.freeze
 
@@ -190,9 +190,7 @@ module Forwardable
 
     # If it's not a class or module, it's an instance
     mod = Module === self ? self : singleton_class
-    ret = mod.module_eval(&gen)
-    mod.__send__(:ruby2_keywords, ali) if RUBY_VERSION >= '2.7'
-    ret
+    mod.module_eval(&gen)
   end
 
   alias delegate instance_delegate
@@ -206,36 +204,33 @@ module Forwardable
     if Module === obj ?
          obj.method_defined?(accessor) || obj.private_method_defined?(accessor) :
          obj.respond_to?(accessor, true)
-      accessor = "#{accessor}()"
+      accessor = "(#{accessor}())"
     end
 
-    method_call = ".__send__(:#{method}, *args, &block)"
-    if _valid_method?(method)
+    args = RUBY_VERSION >= '2.7' ? '...' : '*args, &block'
+    method_call = ".__send__(:#{method}, #{args})"
+    if method.match?(/\A[_a-zA-Z]\w*[?!]?\z/)
       loc, = caller_locations(2,1)
       pre = "_ ="
       mesg = "#{Module === obj ? obj : obj.class}\##{ali} at #{loc.path}:#{loc.lineno} forwarding to private method "
-      method_call = "#{<<-"begin;"}\n#{<<-"end;".chomp}"
-        begin;
-          unless defined? _.#{method}
-            ::Kernel.warn #{mesg.dump}"\#{_.class}"'##{method}', uplevel: 1
-            _#{method_call}
-          else
-            _.#{method}(*args, &block)
-          end
-        end;
+      method_call = <<~RUBY.chomp
+        if defined?(_.#{method})
+          _.#{method}(#{args})
+        else
+          ::Kernel.warn #{mesg.dump}"\#{_.class}"'##{method}', uplevel: 1
+          _#{method_call}
+        end
+      RUBY
     end
 
-    _compile_method("#{<<-"begin;"}\n#{<<-"end;"}", __FILE__, __LINE__+1)
-    begin;
+    eval(<<~RUBY, nil, __FILE__, __LINE__ + 1)
       proc do
-        def #{ali}(*args, &block)
-          #{pre}
-          begin
-            #{accessor}
-          end#{method_call}
+        def #{ali}(#{args})
+          #{pre}#{accessor}
+          #{method_call}
         end
       end
-    end;
+    RUBY
   end
 end
 
@@ -310,9 +305,7 @@ module SingleForwardable
   def def_single_delegator(accessor, method, ali = method)
     gen = Forwardable._delegator_method(self, accessor, method, ali)
 
-    ret = instance_eval(&gen)
-    singleton_class.__send__(:ruby2_keywords, ali) if RUBY_VERSION >= '2.7'
-    ret
+    instance_eval(&gen)
   end
 
   alias delegate single_delegate
diff --git a/lib/forwardable/forwardable.gemspec b/lib/forwardable/forwardable.gemspec
index 9ad59c5f8a..1b539bcfcb 100644
--- a/lib/forwardable/forwardable.gemspec
+++ b/lib/forwardable/forwardable.gemspec
@@ -19,7 +19,7 @@ Gem::Specification.new do |spec|
   spec.licenses      = ["Ruby", "BSD-2-Clause"]
 
   spec.required_ruby_version = '>= 2.4.0'
-  spec.files         = ["forwardable.gemspec", "lib/forwardable.rb", "lib/forwardable/impl.rb"]
+  spec.files         = ["forwardable.gemspec", "lib/forwardable.rb"]
   spec.bindir        = "exe"
   spec.executables   = []
   spec.require_paths = ["lib"]
diff --git a/lib/forwardable/impl.rb b/lib/forwardable/impl.rb
deleted file mode 100644
index 0322c136db..0000000000
--- a/lib/forwardable/impl.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-module Forwardable
-  # :stopdoc:
-
-  def self._valid_method?(method)
-    catch {|tag|
-      eval("BEGIN{throw tag}; ().#{method}", binding, __FILE__, __LINE__)
-    }
-  rescue SyntaxError
-    false
-  else
-    true
-  end
-
-  def self._compile_method(src, file, line)
-    eval(src, nil, file, line)
-  end
-end
diff --git a/lib/ipaddr.gemspec b/lib/ipaddr.gemspec
index 1f4798e43a..cabc9161ba 100644
--- a/lib/ipaddr.gemspec
+++ b/lib/ipaddr.gemspec
@@ -29,8 +29,8 @@ Both IPv4 and IPv6 are supported.
   spec.homepage      = "https://github.com/ruby/ipaddr"
   spec.licenses      = ["Ruby", "BSD-2-Clause"]
 
-  spec.files         = ["LICENSE.txt", "README.md", "ipaddr.gemspec", "lib/ipaddr.rb"]
+  spec.files         = ["LICENSE.txt", "README.md", "lib/ipaddr.rb"]
   spec.require_paths = ["lib"]
 
-  spec.required_ruby_version = ">= 2.3"
+  spec.required_ruby_version = ">= 2.4"
 end
diff --git a/lib/ipaddr.rb b/lib/ipaddr.rb
index dbb213c90a..70b804f642 100644
--- a/lib/ipaddr.rb
+++ b/lib/ipaddr.rb
@@ -40,7 +40,8 @@ require 'socket'
 #   p ipaddr3                   #=> #<IPAddr: IPv4:192.168.2.0/255.255.255.0>
 
 class IPAddr
-  VERSION = "1.2.6"
+  # The version string
+  VERSION = "1.2.9"
 
   # 32 bit mask for IPv4
   IN4MASK = 0xffffffff
@@ -151,8 +152,22 @@ class IPAddr
     return self.clone.set(addr_mask(~@addr))
   end
 
+  # Returns a new ipaddr greater than the original address by offset
+  def +(offset)
+    self.clone.set(@addr + offset, @family)
+  end
+
+  # Returns a new ipaddr less than the original address by offset
+  def -(offset)
+    self.clone.set(@addr - offset, @family)
+  end
+
   # Returns true if two ipaddrs are equal.
   def ==(other)
+    if other.nil?
+      return false
+    end
+
     other = coerce_other(other)
   rescue
     false
@@ -227,10 +242,26 @@ class IPAddr
     return str
   end
 
+  # Returns a string containing the IP address representation with prefix.
+  def as_json(*)
+    if ipv4? && prefix == 32
+      to_s
+    elsif ipv6? && prefix == 128
+      to_s
+    else
+      cidr
+    end
+  end
+
+  # Returns a json string containing the IP address representation.
+  def to_json(*a)
+    %Q{"#{as_json(*a)}"}
+  end
+
   # Returns a string containing the IP address representation in
   # cidr notation
   def cidr
-    format("%s/%s", to_s, prefix)
+    "#{to_s}/#{prefix}"
   end
 
   # Returns a network byte ordered string form of the IP address.
@@ -266,7 +297,7 @@ class IPAddr
       @addr & 0xff000000 == 0x7f000000 # 127.0.0.1/8
     when Socket::AF_INET6
       @addr == 1 || # ::1
-        (@addr & 0xffff_0000_0000 == 0xffff_0000_0000 && (
+        (@addr >> 32 == 0xffff && (
           @addr & 0xff000000 == 0x7f000000 # ::ffff:127.0.0.1/8
         ))
     else
@@ -287,10 +318,10 @@ class IPAddr
         @addr & 0xffff0000 == 0xc0a80000     # 192.168.0.0/16
     when Socket::AF_INET6
       @addr & 0xfe00_0000_0000_0000_0000_0000_0000_0000 == 0xfc00_0000_0000_0000_0000_0000_0000_0000 ||
-        (@addr & 0xffff_0000_0000 == 0xffff_0000_0000 && (
+        (@addr >> 32 == 0xffff && (
           @addr & 0xff000000 == 0x0a000000 ||  # ::ffff:10.0.0.0/8
-          @addr & 0xfff00000 == 0xac100000 ||  # ::ffff::172.16.0.0/12
-          @addr & 0xffff0000 == 0xc0a80000     # ::ffff::192.168.0.0/16
+          @addr & 0xfff00000 == 0xac100000 ||  # ::ffff:172.16.0.0/12
+          @addr & 0xffff0000 == 0xc0a80000     # ::ffff:192.168.0.0/16
         ))
     else
       raise AddressFamilyError, "unsupported address family"
@@ -308,7 +339,7 @@ class IPAddr
       @addr & 0xffff0000 == 0xa9fe0000 # 169.254.0.0/16
     when Socket::AF_INET6
       @addr & 0xffc0_0000_0000_0000_0000_0000_0000_0000 == 0xfe80_0000_0000_0000_0000_0000_0000_0000 || # fe80::/10
-        (@addr & 0xffff_0000_0000 == 0xffff_0000_0000 && (
+        (@addr >> 32 == 0xffff && (
           @addr & 0xffff0000 == 0xa9fe0000 # ::ffff:169.254.0.0/16
         ))
     else
@@ -327,7 +358,7 @@ class IPAddr
     _ipv4_compat?
   end
 
-  def _ipv4_compat?
+  def _ipv4_compat?             # :nodoc:
     if !ipv6? || (@addr >> 32) != 0
       return false
     end
@@ -341,7 +372,7 @@ class IPAddr
   # into an IPv4-mapped IPv6 address.
   def ipv4_mapped
     if !ipv4?
-      raise InvalidAddressError, "not an IPv4 address: #{@addr}"
+      raise InvalidAddressError, "not an IPv4 address: #{to_s}"
     end
     clone = self.clone.set(@addr | 0xffff00000000, Socket::AF_INET6)
     clone.instance_variable_set(:@mask_addr, @mask_addr | 0xffffffffffffffffffffffff00000000)
@@ -353,9 +384,11 @@ class IPAddr
   def ipv4_compat
     warn "IPAddr\##{__callee__} is obsolete", uplevel: 1 if $VERBOSE
     if !ipv4?
-      raise InvalidAddressError, "not an IPv4 address: #{@addr}"
+      raise InvalidAddressError, "not an IPv4 address: #{to_s}"
     end
-    return self.clone.set(@addr, Socket::AF_INET6)
+    clone = self.clone.set(@addr, Socket::AF_INET6)
+    clone.instance_variable_set(:@mask_addr, @mask_addr | 0xffffffffffffffffffffffff00000000)
+    clone
   end
 
   # Returns a new ipaddr built by converting the IPv6 address into a
@@ -384,7 +417,7 @@ class IPAddr
   # Returns a string for DNS reverse lookup compatible with RFC3172.
   def ip6_arpa
     if !ipv6?
-      raise InvalidAddressError, "not an IPv6 address: #{@addr}"
+      raise InvalidAddressError, "not an IPv6 address: #{to_s}"
     end
     return _reverse + ".ip6.arpa"
   end
@@ -392,7 +425,7 @@ class IPAddr
   # Returns a string for DNS reverse lookup compatible with RFC1886.
   def ip6_int
     if !ipv6?
-      raise InvalidAddressError, "not an IPv6 address: #{@addr}"
+      raise InvalidAddressError, "not an IPv6 address: #{to_s}"
     end
     return _reverse + ".ip6.int"
   end
@@ -517,6 +550,7 @@ class IPAddr
   end
 
   protected
+  # :stopdoc:
 
   def begin_addr
     @addr & @mask_addr
@@ -532,6 +566,7 @@ class IPAddr
       raise AddressFamilyError, "unsupported address family"
     end
   end
+  #:startdoc:
 
   # Set +@addr+, the internal stored ip address, to given +addr+. The
   # parameter +addr+ is validated using the first +family+ member,
@@ -673,6 +708,7 @@ class IPAddr
     end
   end
 
+  # :stopdoc:
   def coerce_other(other)
     case other
     when IPAddr
@@ -693,8 +729,8 @@ class IPAddr
       octets = addr.split('.')
     end
     octets.inject(0) { |i, s|
-      (n = s.to_i) < 256 or raise InvalidAddressError, "invalid address: #{@addr}"
-      (s != '0') && s.start_with?('0') and raise InvalidAddressError, "zero-filled number in IPv4 address is ambiguous: #{@addr}"
+      (n = s.to_i) < 256 or raise InvalidAddressError, "invalid address: #{addr}"
+      (s != '0') && s.start_with?('0') and raise InvalidAddressError, "zero-filled number in IPv4 address is ambiguous: #{addr}"
       i << 8 | n
     }
   end
@@ -711,19 +747,19 @@ class IPAddr
       right = ''
     when RE_IPV6ADDRLIKE_COMPRESSED
       if $4
-        left.count(':') <= 6 or raise InvalidAddressError, "invalid address: #{@addr}"
+        left.count(':') <= 6 or raise InvalidAddressError, "invalid address: #{left}"
         addr = in_addr($~[4,4])
         left = $1
         right = $3 + '0:0'
       else
         left.count(':') <= ($1.empty? || $2.empty? ? 8 : 7) or
-          raise InvalidAddressError, "invalid address: #{@addr}"
+          raise InvalidAddressError, "invalid address: #{left}"
         left = $1
         right = $2
         addr = 0
       end
     else
-      raise InvalidAddressError, "invalid address: #{@addr}"
+      raise InvalidAddressError, "invalid address: #{left}"
     end
     l = left.split(':')
     r = right.split(':')
@@ -784,7 +820,7 @@ unless Socket.const_defined? :AF_INET6
   class << IPSocket
     private
 
-    def valid_v6?(addr)
+    def valid_v6?(addr) # :nodoc:
       case addr
       when IPAddr::RE_IPV6ADDRLIKE_FULL
         if $2
diff --git a/lib/irb.rb b/lib/irb.rb
deleted file mode 100644
index b3435c257e..0000000000
--- a/lib/irb.rb
+++ /dev/null
@@ -1,1608 +0,0 @@
-# frozen_string_literal: true
-
-# :markup: markdown
-#   irb.rb - irb main module
-#       by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require "ripper"
-require "reline"
-
-require_relative "irb/init"
-require_relative "irb/context"
-require_relative "irb/default_commands"
-
-require_relative "irb/ruby-lex"
-require_relative "irb/statement"
-require_relative "irb/input-method"
-require_relative "irb/locale"
-require_relative "irb/color"
-
-require_relative "irb/version"
-require_relative "irb/easter-egg"
-require_relative "irb/debug"
-require_relative "irb/pager"
-
-# ## IRB
-#
-# Module IRB ("Interactive Ruby") provides a shell-like interface that supports
-# user interaction with the Ruby interpreter.
-#
-# It operates as a *read-eval-print loop*
-# ([REPL](https://en.wikipedia.org/wiki/Read%E2%80%93eval%E2%80%93print_loop))
-# that:
-#
-# *   ***Reads*** each character as you type. You can modify the IRB context to
-#     change the way input works. See [Input](rdoc-ref:IRB@Input).
-# *   ***Evaluates*** the code each time it has read a syntactically complete
-#     passage.
-# *   ***Prints*** after evaluating. You can modify the IRB context to change
-#     the way output works. See [Output](rdoc-ref:IRB@Output).
-#
-#
-# Example:
-#
-#     $ irb
-#     irb(main):001> File.basename(Dir.pwd)
-#     => "irb"
-#     irb(main):002> Dir.entries('.').size
-#     => 25
-#     irb(main):003* Dir.entries('.').select do |entry|
-#     irb(main):004*   entry.start_with?('R')
-#     irb(main):005> end
-#     => ["README.md", "Rakefile"]
-#
-# The typed input may also include [\IRB-specific
-# commands](rdoc-ref:IRB@IRB-Specific+Commands).
-#
-# As seen above, you can start IRB by using the shell command `irb`.
-#
-# You can stop an IRB session by typing command `exit`:
-#
-#     irb(main):006> exit
-#     $
-#
-# At that point, IRB calls any hooks found in array `IRB.conf[:AT_EXIT]`, then
-# exits.
-#
-# ## Startup
-#
-# At startup, IRB:
-#
-# 1.  Interprets (as Ruby code) the content of the [configuration
-#     file](rdoc-ref:IRB@Configuration+File) (if given).
-# 2.  Constructs the initial session context from [hash
-#     IRB.conf](rdoc-ref:IRB@Hash+IRB.conf) and from default values; the hash
-#     content may have been affected by [command-line
-#     options](rdoc-ref:IB@Command-Line+Options), and by direct assignments in
-#     the configuration file.
-# 3.  Assigns the context to variable `conf`.
-# 4.  Assigns command-line arguments to variable `ARGV`.
-# 5.  Prints the [prompt](rdoc-ref:IRB@Prompt+and+Return+Formats).
-# 6.  Puts the content of the [initialization
-#     script](rdoc-ref:IRB@Initialization+Script) onto the IRB shell, just as if
-#     it were user-typed commands.
-#
-#
-# ### The Command Line
-#
-# On the command line, all options precede all arguments; the first item that is
-# not recognized as an option is treated as an argument, as are all items that
-# follow.
-#
-# #### Command-Line Options
-#
-# Many command-line options affect entries in hash `IRB.conf`, which in turn
-# affect the initial configuration of the IRB session.
-#
-# Details of the options are described in the relevant subsections below.
-#
-# A cursory list of the IRB command-line options may be seen in the [help
-# message](https://raw.githubusercontent.com/ruby/irb/master/lib/irb/lc/help-message),
-# which is also displayed if you use command-line option `--help`.
-#
-# If you are interested in a specific option, consult the
-# [index](rdoc-ref:doc/irb/indexes.md@Index+of+Command-Line+Options).
-#
-# #### Command-Line Arguments
-#
-# Command-line arguments are passed to IRB in array `ARGV`:
-#
-#     $ irb --noscript Foo Bar Baz
-#     irb(main):001> ARGV
-#     => ["Foo", "Bar", "Baz"]
-#     irb(main):002> exit
-#     $
-#
-# Command-line option `--` causes everything that follows to be treated as
-# arguments, even those that look like options:
-#
-#     $ irb --noscript -- --noscript -- Foo Bar Baz
-#     irb(main):001> ARGV
-#     => ["--noscript", "--", "Foo", "Bar", "Baz"]
-#     irb(main):002> exit
-#     $
-#
-# ### Configuration File
-#
-# You can initialize IRB via a *configuration file*.
-#
-# If command-line option `-f` is given, no configuration file is looked for.
-#
-# Otherwise, IRB reads and interprets a configuration file if one is available.
-#
-# The configuration file can contain any Ruby code, and can usefully include
-# user code that:
-#
-# *   Can then be debugged in IRB.
-# *   Configures IRB itself.
-# *   Requires or loads files.
-#
-#
-# The path to the configuration file is the first found among:
-#
-# *   The value of variable `$IRBRC`, if defined.
-# *   The value of variable `$XDG_CONFIG_HOME/irb/irbrc`, if defined.
-# *   File `$HOME/.irbrc`, if it exists.
-# *   File `$HOME/.config/irb/irbrc`, if it exists.
-# *   File `.irbrc` in the current directory, if it exists.
-# *   File `irb.rc` in the current directory, if it exists.
-# *   File `_irbrc` in the current directory, if it exists.
-# *   File `$irbrc` in the current directory, if it exists.
-#
-#
-# If the search fails, there is no configuration file.
-#
-# If the search succeeds, the configuration file is read as Ruby code, and so
-# can contain any Ruby programming you like.
-#
-# Method `conf.rc?` returns `true` if a configuration file was read, `false`
-# otherwise. Hash entry `IRB.conf[:RC]` also contains that value.
-#
-# ### Hash `IRB.conf`
-#
-# The initial entries in hash `IRB.conf` are determined by:
-#
-# *   Default values.
-# *   Command-line options, which may override defaults.
-# *   Direct assignments in the configuration file.
-#
-#
-# You can see the hash by typing `IRB.conf`.
-#
-# Details of the entries' meanings are described in the relevant subsections
-# below.
-#
-# If you are interested in a specific entry, consult the
-# [index](rdoc-ref:doc/irb/indexes.md@Index+of+IRB.conf+Entries).
-#
-# ### Notes on Initialization Precedence
-#
-# *   Any conflict between an entry in hash `IRB.conf` and a command-line option
-#     is resolved in favor of the hash entry.
-# *   Hash `IRB.conf` affects the context only once, when the configuration file
-#     is interpreted; any subsequent changes to it do not affect the context and
-#     are therefore essentially meaningless.
-#
-#
-# ### Initialization Script
-#
-# By default, the first command-line argument (after any options) is the path to
-# a Ruby initialization script.
-#
-# IRB reads the initialization script and puts its content onto the IRB shell,
-# just as if it were user-typed commands.
-#
-# Command-line option `--noscript` causes the first command-line argument to be
-# treated as an ordinary argument (instead of an initialization script);
-# `--script` is the default.
-#
-# ## Input
-#
-# This section describes the features that allow you to change the way IRB input
-# works; see also [Input and Output](rdoc-ref:IRB@Input+and+Output).
-#
-# ### Input Command History
-#
-# By default, IRB stores a history of up to 1000 input commands in a file named
-# `.irb_history`. The history file will be in the same directory as the
-# [configuration file](rdoc-ref:IRB@Configuration+File) if one is found, or in
-# `~/` otherwise.
-#
-# A new IRB session creates the history file if it does not exist, and appends
-# to the file if it does exist.
-#
-# You can change the filepath by adding to your configuration file:
-# `IRB.conf[:HISTORY_FILE] = *filepath*`, where *filepath* is a string filepath.
-#
-# During the session, method `conf.history_file` returns the filepath, and
-# method `conf.history_file = *new_filepath*` copies the history to the file at
-# *new_filepath*, which becomes the history file for the session.
-#
-# You can change the number of commands saved by adding to your configuration
-# file: `IRB.conf[:SAVE_HISTORY] = *n*`, wheHISTORY_FILEre *n* is one of:
-#
-# *   Positive integer: the number of commands to be saved,
-# *   Zero: all commands are to be saved.
-# *   `nil`: no commands are to be saved,.
-#
-#
-# During the session, you can use methods `conf.save_history` or
-# `conf.save_history=` to retrieve or change the count.
-#
-# ### Command Aliases
-#
-# By default, IRB defines several command aliases:
-#
-#     irb(main):001> conf.command_aliases
-#     => {:"$"=>:show_source, :"@"=>:whereami}
-#
-# You can change the initial aliases in the configuration file with:
-#
-#     IRB.conf[:COMMAND_ALIASES] = {foo: :show_source, bar: :whereami}
-#
-# You can replace the current aliases at any time with configuration method
-# `conf.command_aliases=`; Because `conf.command_aliases` is a hash, you can
-# modify it.
-#
-# ### End-of-File
-#
-# By default, `IRB.conf[:IGNORE_EOF]` is `false`, which means that typing the
-# end-of-file character `Ctrl-D` causes the session to exit.
-#
-# You can reverse that behavior by adding `IRB.conf[:IGNORE_EOF] = true` to the
-# configuration file.
-#
-# During the session, method `conf.ignore_eof?` returns the setting, and method
-# `conf.ignore_eof = *boolean*` sets it.
-#
-# ### SIGINT
-#
-# By default, `IRB.conf[:IGNORE_SIGINT]` is `true`, which means that typing the
-# interrupt character `Ctrl-C` causes the session to exit.
-#
-# You can reverse that behavior by adding `IRB.conf[:IGNORE_SIGING] = false` to
-# the configuration file.
-#
-# During the session, method `conf.ignore_siging?` returns the setting, and
-# method `conf.ignore_sigint = *boolean*` sets it.
-#
-# ### Automatic Completion
-#
-# By default, IRB enables [automatic
-# completion](https://en.wikipedia.org/wiki/Autocomplete#In_command-line_interpr
-# eters):
-#
-# You can disable it by either of these:
-#
-# *   Adding `IRB.conf[:USE_AUTOCOMPLETE] = false` to the configuration file.
-# *   Giving command-line option `--noautocomplete` (`--autocomplete` is the
-#     default).
-#
-#
-# Method `conf.use_autocomplete?` returns `true` if automatic completion is
-# enabled, `false` otherwise.
-#
-# The setting may not be changed during the session.
-#
-# ### Automatic Indentation
-#
-# By default, IRB automatically indents lines of code to show structure (e.g.,
-# it indent the contents of a block).
-#
-# The current setting is returned by the configuration method
-# `conf.auto_indent_mode`.
-#
-# The default initial setting is `true`:
-#
-#     irb(main):001> conf.auto_indent_mode
-#     => true
-#     irb(main):002* Dir.entries('.').select do |entry|
-#     irb(main):003*   entry.start_with?('R')
-#     irb(main):004> end
-#     => ["README.md", "Rakefile"]
-#
-# You can change the initial setting in the configuration file with:
-#
-#     IRB.conf[:AUTO_INDENT] = false
-#
-# Note that the *current* setting *may not* be changed in the IRB session.
-#
-# ### Input Method
-#
-# The IRB input method determines how command input is to be read; by default,
-# the input method for a session is IRB::RelineInputMethod. Unless the
-# value of the TERM environment variable is 'dumb', in which case the
-# most simplistic input method is used.
-#
-# You can set the input method by:
-#
-# *   Adding to the configuration file:
-#
-#     *   `IRB.conf[:USE_SINGLELINE] = true` or `IRB.conf[:USE_MULTILINE]=
-#         false` sets the input method to IRB::ReadlineInputMethod.
-#     *   `IRB.conf[:USE_SINGLELINE] = false` or `IRB.conf[:USE_MULTILINE] =
-#         true` sets the input method to IRB::RelineInputMethod.
-#
-#
-# *   Giving command-line options:
-#
-#     *   `--singleline` or `--nomultiline` sets the input method to
-#         IRB::ReadlineInputMethod.
-#     *   `--nosingleline` or `--multiline` sets the input method to
-#         IRB::RelineInputMethod.
-#     *   `--nosingleline` together with `--nomultiline` sets the
-#         input to IRB::StdioInputMethod.
-#
-#
-# Method `conf.use_multiline?` and its synonym `conf.use_reline` return:
-#
-# *   `true` if option `--multiline` was given.
-# *   `false` if option `--nomultiline` was given.
-# *   `nil` if neither was given.
-#
-#
-# Method `conf.use_singleline?` and its synonym `conf.use_readline` return:
-#
-# *   `true` if option `--singleline` was given.
-# *   `false` if option `--nosingleline` was given.
-# *   `nil` if neither was given.
-#
-#
-# ## Output
-#
-# This section describes the features that allow you to change the way IRB
-# output works; see also [Input and Output](rdoc-ref:IRB@Input+and+Output).
-#
-# ### Return-Value Printing (Echoing)
-#
-# By default, IRB prints (echoes) the values returned by all input commands.
-#
-# You can change the initial behavior and suppress all echoing by:
-#
-# *   Adding to the configuration file: `IRB.conf[:ECHO] = false`. (The default
-#     value for this entry is `nil`, which means the same as `true`.)
-# *   Giving command-line option `--noecho`. (The default is `--echo`.)
-#
-#
-# During the session, you can change the current setting with configuration
-# method `conf.echo=` (set to `true` or `false`).
-#
-# As stated above, by default IRB prints the values returned by all input
-# commands; but IRB offers special treatment for values returned by assignment
-# statements, which may be:
-#
-# *   Printed with truncation (to fit on a single line of output), which is the
-#     default; an ellipsis (`...` is suffixed, to indicate the truncation):
-#
-#         irb(main):001> x = 'abc' * 100
-#
-#
-# > "abcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabc...
-#
-# *   Printed in full (regardless of the length).
-# *   Suppressed (not printed at all)
-#
-#
-# You can change the initial behavior by:
-#
-# *   Adding to the configuration file: `IRB.conf[:ECHO_ON_ASSIGNMENT] = false`.
-#     (The default value for this entry is `niL`, which means the same as
-#     `:truncate`.)
-# *   Giving command-line option `--noecho-on-assignment` or
-#     `--echo-on-assignment`. (The default is `--truncate-echo-on-assignment`.)
-#
-#
-# During the session, you can change the current setting with configuration
-# method `conf.echo_on_assignment=` (set to `true`, `false`, or `:truncate`).
-#
-# By default, IRB formats returned values by calling method `inspect`.
-#
-# You can change the initial behavior by:
-#
-# *   Adding to the configuration file: `IRB.conf[:INSPECT_MODE] = false`. (The
-#     default value for this entry is `true`.)
-# *   Giving command-line option `--noinspect`. (The default is `--inspect`.)
-#
-#
-# During the session, you can change the setting using method
-# `conf.inspect_mode=`.
-#
-# ### Multiline Output
-#
-# By default, IRB prefixes a newline to a multiline response.
-#
-# You can change the initial default value by adding to the configuration file:
-#
-#     IRB.conf[:NEWLINE_BEFORE_MULTILINE_OUTPUT] = false
-#
-# During a session, you can retrieve or set the value using methods
-# `conf.newline_before_multiline_output?` and
-# `conf.newline_before_multiline_output=`.
-#
-# Examples:
-#
-#     irb(main):001> conf.inspect_mode = false
-#     => false
-#     irb(main):002> "foo\nbar"
-#     =>
-#     foo
-#     bar
-#     irb(main):003> conf.newline_before_multiline_output = false
-#     => false
-#     irb(main):004> "foo\nbar"
-#     => foo
-#     bar
-#
-# ### Evaluation History
-#
-# By default, IRB saves no history of evaluations (returned values), and the
-# related methods `conf.eval_history`, `_`, and `__` are undefined.
-#
-# You can turn on that history, and set the maximum number of evaluations to be
-# stored:
-#
-# *   In the configuration file: add `IRB.conf[:EVAL_HISTORY] = *n*`. (Examples
-#     below assume that we've added `IRB.conf[:EVAL_HISTORY] = 5`.)
-# *   In the session (at any time): `conf.eval_history = *n*`.
-#
-#
-# If `n` is zero, all evaluation history is stored.
-#
-# Doing either of the above:
-#
-# *   Sets the maximum size of the evaluation history; defines method
-#     `conf.eval_history`, which returns the maximum size `n` of the evaluation
-#     history:
-#
-#         irb(main):001> conf.eval_history = 5
-#         => 5
-#         irb(main):002> conf.eval_history
-#         => 5
-#
-# *   Defines variable `_`, which contains the most recent evaluation, or `nil`
-#     if none; same as method `conf.last_value`:
-#
-#         irb(main):003> _
-#         => 5
-#         irb(main):004> :foo
-#         => :foo
-#         irb(main):005> :bar
-#         => :bar
-#         irb(main):006> _
-#         => :bar
-#         irb(main):007> _
-#         => :bar
-#
-# *   Defines variable `__`:
-#
-#     *   `__` unadorned: contains all evaluation history:
-#
-#             irb(main):008> :foo
-#             => :foo
-#             irb(main):009> :bar
-#             => :bar
-#             irb(main):010> :baz
-#             => :baz
-#             irb(main):011> :bat
-#             => :bat
-#             irb(main):012> :bam
-#             => :bam
-#             irb(main):013> __
-#             =>
-#             9 :bar
-#             10 :baz
-#             11 :bat
-#             12 :bam
-#             irb(main):014> __
-#             =>
-#             10 :baz
-#             11 :bat
-#             12 :bam
-#             13 ...self-history...
-#
-#         Note that when the evaluation is multiline, it is displayed
-#         differently.
-#
-#     *   `__[`*m*`]`:
-#
-#         *   Positive *m*:  contains the evaluation for the given line number,
-#             or `nil` if that line number is not in the evaluation history:
-#
-#                 irb(main):015> __[12]
-#                 => :bam
-#                 irb(main):016> __[1]
-#                 => nil
-#
-#         *   Negative *m*: contains the `mth`-from-end evaluation, or `nil` if
-#             that evaluation is not in the evaluation history:
-#
-#                 irb(main):017> __[-3]
-#                 => :bam
-#                 irb(main):018> __[-13]
-#                 => nil
-#
-#         *   Zero *m*: contains `nil`:
-#
-#                 irb(main):019> __[0]
-#                 => nil
-#
-#
-#
-#
-# ### Prompt and Return Formats
-#
-# By default, IRB uses the prompt and return value formats defined in its
-# `:DEFAULT` prompt mode.
-#
-# #### The Default Prompt and Return Format
-#
-# The default prompt and return values look like this:
-#
-#     irb(main):001> 1 + 1
-#     => 2
-#     irb(main):002> 2 + 2
-#     => 4
-#
-# The prompt includes:
-#
-# *   The name of the running program (`irb`); see [IRB
-#     Name](rdoc-ref:IRB@IRB+Name).
-# *   The name of the current session (`main`); See [IRB
-#     Sessions](rdoc-ref:IRB@IRB+Sessions).
-# *   A 3-digit line number (1-based).
-#
-#
-# The default prompt actually defines three formats:
-#
-# *   One for most situations (as above):
-#
-#         irb(main):003> Dir
-#         => Dir
-#
-# *   One for when the typed command is a statement continuation (adds trailing
-#     asterisk):
-#
-#         irb(main):004* Dir.
-#
-# *   One for when the typed command is a string continuation (adds trailing
-#     single-quote):
-#
-#         irb(main):005' Dir.entries('.
-#
-#
-# You can see the prompt change as you type the characters in the following:
-#
-#     irb(main):001* Dir.entries('.').select do |entry|
-#     irb(main):002*   entry.start_with?('R')
-#     irb(main):003> end
-#     => ["README.md", "Rakefile"]
-#
-# #### Pre-Defined Prompts
-#
-# IRB has several pre-defined prompts, stored in hash `IRB.conf[:PROMPT]`:
-#
-#     irb(main):001> IRB.conf[:PROMPT].keys
-#     => [:NULL, :DEFAULT, :CLASSIC, :SIMPLE, :INF_RUBY, :XMP]
-#
-# To see the full data for these, type `IRB.conf[:PROMPT]`.
-#
-# Most of these prompt definitions include specifiers that represent values like
-# the IRB name, session name, and line number; see [Prompt
-# Specifiers](rdoc-ref:IRB@Prompt+Specifiers).
-#
-# You can change the initial prompt and return format by:
-#
-# *   Adding to the configuration file: `IRB.conf[:PROMPT] = *mode*` where
-#     *mode* is the symbol name of a prompt mode.
-# *   Giving a command-line option:
-#
-#     *   `--prompt *mode*`: sets the prompt mode to *mode*. where *mode* is the
-#         symbol name of a prompt mode.
-#     *   `--simple-prompt` or `--sample-book-mode`: sets the prompt mode to
-#         `:SIMPLE`.
-#     *   `--inf-ruby-mode`: sets the prompt mode to `:INF_RUBY` and suppresses
-#         both `--multiline` and `--singleline`.
-#     *   `--noprompt`: suppresses prompting; does not affect echoing.
-#
-#
-#
-# You can retrieve or set the current prompt mode with methods
-#
-# `conf.prompt_mode` and `conf.prompt_mode=`.
-#
-# If you're interested in prompts and return formats other than the defaults,
-# you might experiment by trying some of the others.
-#
-# #### Custom Prompts
-#
-# You can also define custom prompts and return formats, which may be done
-# either in an IRB session or in the configuration file.
-#
-# A prompt in IRB actually defines three prompts, as seen above. For simple
-# custom data, we'll make all three the same:
-#
-#     irb(main):001* IRB.conf[:PROMPT][:MY_PROMPT] = {
-#     irb(main):002*   PROMPT_I: ': ',
-#     irb(main):003*   PROMPT_C: ': ',
-#     irb(main):004*   PROMPT_S: ': ',
-#     irb(main):005*   RETURN: '=> '
-#     irb(main):006> }
-#     => {:PROMPT_I=>": ", :PROMPT_C=>": ", :PROMPT_S=>": ", :RETURN=>"=> "}
-#
-# If you define the custom prompt in the configuration file, you can also make
-# it the current prompt by adding:
-#
-#     IRB.conf[:PROMPT_MODE] = :MY_PROMPT
-#
-# Regardless of where it's defined, you can make it the current prompt in a
-# session:
-#
-#     conf.prompt_mode = :MY_PROMPT
-#
-# You can view or modify the current prompt data with various configuration
-# methods:
-#
-# *   `conf.prompt_mode`, `conf.prompt_mode=`.
-# *   `conf.prompt_c`, `conf.c=`.
-# *   `conf.prompt_i`, `conf.i=`.
-# *   `conf.prompt_s`, `conf.s=`.
-# *   `conf.return_format`, `return_format=`.
-#
-#
-# #### Prompt Specifiers
-#
-# A prompt's definition can include specifiers for which certain values are
-# substituted:
-#
-# *   `%N`: the name of the running program.
-# *   `%m`: the value of `self.to_s`.
-# *   `%M`: the value of `self.inspect`.
-# *   `%l`: an indication of the type of string; one of `"`, `'`, `/`, `]`.
-# *   `%NNi`: Indentation level. NN is a 2-digit number that specifies the number
-#             of digits of the indentation level (03 will result in 001).
-# *   `%NNn`: Line number. NN is a 2-digit number that specifies the number
-#             of digits of the line number (03 will result in 001).
-# *   `%%`: Literal `%`.
-#
-#
-# ### Verbosity
-#
-# By default, IRB verbosity is disabled, which means that output is smaller
-# rather than larger.
-#
-# You can enable verbosity by:
-#
-# *   Adding to the configuration file: `IRB.conf[:VERBOSE] = true` (the default
-#     is `nil`).
-# *   Giving command-line options `--verbose` (the default is `--noverbose`).
-#
-#
-# During a session, you can retrieve or set verbosity with methods
-# `conf.verbose` and `conf.verbose=`.
-#
-# ### Help
-#
-# Command-line option `--version` causes IRB to print its help text and exit.
-#
-# ### Version
-#
-# Command-line option `--version` causes IRB to print its version text and exit.
-#
-# ## Input and Output
-#
-# ### Color Highlighting
-#
-# By default, IRB color highlighting is enabled, and is used for both:
-#
-# *   Input: As you type, IRB reads the typed characters and highlights elements
-#     that it recognizes; it also highlights errors such as mismatched
-#     parentheses.
-# *   Output: IRB highlights syntactical elements.
-#
-#
-# You can disable color highlighting by:
-#
-# *   Adding to the configuration file: `IRB.conf[:USE_COLORIZE] = false` (the
-#     default value is `true`).
-# *   Giving command-line option `--nocolorize`
-#
-#
-# ## Debugging
-#
-# Command-line option `-d` sets variables `$VERBOSE` and `$DEBUG` to `true`;
-# these have no effect on IRB output.
-#
-# ### Warnings
-#
-# Command-line option `-w` suppresses warnings.
-#
-# Command-line option `-W[*level*]` sets warning level;
-#
-# * 0=silence
-# * 1=medium
-# * 2=verbose
-#
-# ## Other Features
-#
-# ### Load Modules
-#
-# You can specify the names of modules that are to be required at startup.
-#
-# Array `conf.load_modules` determines the modules (if any) that are to be
-# required during session startup. The array is used only during session
-# startup, so the initial value is the only one that counts.
-#
-# The default initial value is `[]` (load no modules):
-#
-#     irb(main):001> conf.load_modules
-#     => []
-#
-# You can set the default initial value via:
-#
-# *   Command-line option `-r`
-#
-#          $ irb -r csv -r json
-#         irb(main):001> conf.load_modules
-#         => ["csv", "json"]
-#
-# *   Hash entry `IRB.conf[:LOAD_MODULES] = *array*`:
-#
-#         IRB.conf[:LOAD_MODULES] = %w[csv, json]
-#
-#
-# Note that the configuration file entry overrides the command-line options.
-#
-# ### RI Documentation Directories
-#
-# You can specify the paths to RI documentation directories that are to be
-# loaded (in addition to the default directories) at startup; see details about
-# RI by typing `ri --help`.
-#
-# Array `conf.extra_doc_dirs` determines the directories (if any) that are to be
-# loaded during session startup. The array is used only during session startup,
-# so the initial value is the only one that counts.
-#
-# The default initial value is `[]` (load no extra documentation):
-#
-#     irb(main):001> conf.extra_doc_dirs
-#     => []
-#
-# You can set the default initial value via:
-#
-# *   Command-line option `--extra_doc_dir`
-#
-#         $ irb --extra-doc-dir your_doc_dir --extra-doc-dir my_doc_dir
-#         irb(main):001> conf.extra_doc_dirs
-#         => ["your_doc_dir", "my_doc_dir"]
-#
-# *   Hash entry `IRB.conf[:EXTRA_DOC_DIRS] = *array*`:
-#
-#         IRB.conf[:EXTRA_DOC_DIRS] = %w[your_doc_dir my_doc_dir]
-#
-#
-# Note that the configuration file entry overrides the command-line options.
-#
-# ### IRB Name
-#
-# You can specify a name for IRB.
-#
-# The default initial value is `'irb'`:
-#
-#     irb(main):001> conf.irb_name
-#     => "irb"
-#
-# You can set the default initial value via hash entry `IRB.conf[:IRB_NAME] =
-# *string*`:
-#
-#     IRB.conf[:IRB_NAME] = 'foo'
-#
-# ### Application Name
-#
-# You can specify an application name for the IRB session.
-#
-# The default initial value is `'irb'`:
-#
-#     irb(main):001> conf.ap_name
-#     => "irb"
-#
-# You can set the default initial value via hash entry `IRB.conf[:AP_NAME] =
-# *string*`:
-#
-#     IRB.conf[:AP_NAME] = 'my_ap_name'
-#
-# ### Configuration Monitor
-#
-# You can monitor changes to the configuration by assigning a proc to
-# `IRB.conf[:IRB_RC]` in the configuration file:
-#
-#     IRB.conf[:IRB_RC] = proc {|conf| puts conf.class }
-#
-# Each time the configuration is changed, that proc is called with argument
-# `conf`:
-#
-# ### Encodings
-#
-# Command-line option `-E *ex*[:*in*]` sets initial external (ex) and internal
-# (in) encodings.
-#
-# Command-line option `-U` sets both to UTF-8.
-#
-# ### Commands
-#
-# Please use the `help` command to see the list of available commands.
-#
-# ### IRB Sessions
-#
-# IRB has a special feature, that allows you to manage many sessions at once.
-#
-# You can create new sessions with Irb.irb, and get a list of current sessions
-# with the `jobs` command in the prompt.
-#
-# #### Configuration
-#
-# The command line options, or IRB.conf, specify the default behavior of
-# Irb.irb.
-#
-# On the other hand, each conf in IRB@Command-Line+Options is used to
-# individually configure IRB.irb.
-#
-# If a proc is set for `IRB.conf[:IRB_RC]`, its will be invoked after execution
-# of that proc with the context of the current session as its argument. Each
-# session can be configured using this mechanism.
-#
-# #### Session variables
-#
-# There are a few variables in every Irb session that can come in handy:
-#
-# `_`
-# :   The value command executed, as a local variable
-# `__`
-# :   The history of evaluated commands. Available only if
-#     `IRB.conf[:EVAL_HISTORY]` is not `nil` (which is the default). See also
-#     IRB::Context#eval_history= and IRB::History.
-# `__[line_no]`
-# :   Returns the evaluation value at the given line number, `line_no`. If
-#     `line_no` is a negative, the return value `line_no` many lines before the
-#     most recent return value.
-#
-#
-# ## Restrictions
-#
-# Ruby code typed into IRB behaves the same as Ruby code in a file, except that:
-#
-# *   Because IRB evaluates input immediately after it is syntactically
-#     complete, some results may be slightly different.
-# *   Forking may not be well behaved.
-#
-module IRB
-
-  # An exception raised by IRB.irb_abort
-  class Abort < Exception;end
-
-  # The current IRB::Context of the session, see IRB.conf
-  #
-  #     irb
-  #     irb(main):001:0> IRB.CurrentContext.irb_name = "foo"
-  #     foo(main):002:0> IRB.conf[:MAIN_CONTEXT].irb_name #=> "foo"
-  def IRB.CurrentContext # :nodoc:
-    IRB.conf[:MAIN_CONTEXT]
-  end
-
-  # Initializes IRB and creates a new Irb.irb object at the `TOPLEVEL_BINDING`
-  def IRB.start(ap_path = nil)
-    STDOUT.sync = true
-    $0 = File::basename(ap_path, ".rb") if ap_path
-
-    IRB.setup(ap_path)
-
-    if @CONF[:SCRIPT]
-      irb = Irb.new(nil, @CONF[:SCRIPT])
-    else
-      irb = Irb.new
-    end
-    irb.run(@CONF)
-  end
-
-  # Quits irb
-  def IRB.irb_exit(*) # :nodoc:
-    throw :IRB_EXIT, false
-  end
-
-  # Aborts then interrupts irb.
-  #
-  # Will raise an Abort exception, or the given `exception`.
-  def IRB.irb_abort(irb, exception = Abort) # :nodoc:
-    irb.context.thread.raise exception, "abort then interrupt!"
-  end
-
-  class Irb
-    # Note: instance and index assignment expressions could also be written like:
-    # "foo.bar=(1)" and "foo.[]=(1, bar)", when expressed that way, the former be
-    # parsed as :assign and echo will be suppressed, but the latter is parsed as a
-    # :method_add_arg and the output won't be suppressed
-
-    PROMPT_MAIN_TRUNCATE_LENGTH = 32
-    PROMPT_MAIN_TRUNCATE_OMISSION = '...'
-    CONTROL_CHARACTERS_PATTERN = "\x00-\x1F"
-
-    # Returns the current context of this irb session
-    attr_reader :context
-    # The lexer used by this irb session
-    attr_accessor :scanner
-
-    attr_reader :from_binding
-
-    # Creates a new irb session
-    def initialize(workspace = nil, input_method = nil, from_binding: false)
-      @from_binding = from_binding
-      @context = Context.new(self, workspace, input_method)
-      @context.workspace.load_helper_methods_to_main
-      @signal_status = :IN_IRB
-      @scanner = RubyLex.new
-      @line_no = 1
-    end
-
-    # A hook point for `debug` command's breakpoint after :IRB_EXIT as well as its
-    # clean-up
-    def debug_break
-      # it means the debug integration has been activated
-      if defined?(DEBUGGER__) && DEBUGGER__.respond_to?(:capture_frames_without_irb)
-        # after leaving this initial breakpoint, revert the capture_frames patch
-        DEBUGGER__.singleton_class.send(:alias_method, :capture_frames, :capture_frames_without_irb)
-        # and remove the redundant method
-        DEBUGGER__.singleton_class.send(:undef_method, :capture_frames_without_irb)
-      end
-    end
-
-    def debug_readline(binding)
-      workspace = IRB::WorkSpace.new(binding)
-      context.replace_workspace(workspace)
-      context.workspace.load_helper_methods_to_main
-      @line_no += 1
-
-      # When users run:
-      # 1.  Debugging commands, like `step 2`
-      # 2.  Any input that's not irb-command, like `foo = 123`
-      #
-      #
-      # Irb#eval_input will simply return the input, and we need to pass it to the
-      # debugger.
-      input = nil
-      forced_exit = catch(:IRB_EXIT) do
-        if IRB.conf[:SAVE_HISTORY] && context.io.support_history_saving?
-          # Previous IRB session's history has been saved when `Irb#run` is exited We need
-          # to make sure the saved history is not saved again by resetting the counter
-          context.io.reset_history_counter
-
-          begin
-            input = eval_input
-          ensure
-            context.io.save_history
-          end
-        else
-          input = eval_input
-        end
-        false
-      end
-
-      Kernel.exit if forced_exit
-
-      if input&.include?("\n")
-        @line_no += input.count("\n") - 1
-      end
-
-      input
-    end
-
-    def run(conf = IRB.conf)
-      in_nested_session = !!conf[:MAIN_CONTEXT]
-      conf[:IRB_RC].call(context) if conf[:IRB_RC]
-      prev_context = conf[:MAIN_CONTEXT]
-      conf[:MAIN_CONTEXT] = context
-
-      save_history = !in_nested_session && conf[:SAVE_HISTORY] && context.io.support_history_saving?
-
-      if save_history
-        context.io.load_history
-      end
-
-      prev_trap = trap("SIGINT") do
-        signal_handle
-      end
-
-      begin
-        if defined?(RubyVM.keep_script_lines)
-          keep_script_lines_backup = RubyVM.keep_script_lines
-          RubyVM.keep_script_lines = true
-        end
-
-        forced_exit = catch(:IRB_EXIT) do
-          eval_input
-        end
-      ensure
-        # Do not restore to nil. It will cause IRB crash when used with threads.
-        IRB.conf[:MAIN_CONTEXT] = prev_context if prev_context
-
-        RubyVM.keep_script_lines = keep_script_lines_backup if defined?(RubyVM.keep_script_lines)
-        trap("SIGINT", prev_trap)
-        conf[:AT_EXIT].each{|hook| hook.call}
-
-        context.io.save_history if save_history
-        Kernel.exit if forced_exit
-      end
-    end
-
-    # Evaluates input for this session.
-    def eval_input
-      configure_io
-
-      each_top_level_statement do |statement, line_no|
-        signal_status(:IN_EVAL) do
-          begin
-            # If the integration with debugger is activated, we return certain input if it
-            # should be dealt with by debugger
-            if @context.with_debugger && statement.should_be_handled_by_debugger?
-              return statement.code
-            end
-
-            @context.evaluate(statement, line_no)
-
-            if @context.echo? && !statement.suppresses_echo?
-              if statement.is_assignment?
-                if @context.echo_on_assignment?
-                  output_value(@context.echo_on_assignment? == :truncate)
-                end
-              else
-                output_value
-              end
-            end
-          rescue SystemExit, SignalException
-            raise
-          rescue Interrupt, Exception => exc
-            handle_exception(exc)
-            @context.workspace.local_variable_set(:_, exc)
-          end
-        end
-      end
-    end
-
-    def read_input(prompt)
-      signal_status(:IN_INPUT) do
-        @context.io.prompt = prompt
-        if l = @context.io.gets
-          print l if @context.verbose?
-        else
-          if @context.ignore_eof? and @context.io.readable_after_eof?
-            l = "\n"
-            if @context.verbose?
-              printf "Use \"exit\" to leave %s\n", @context.ap_name
-            end
-          else
-            print "\n" if @context.prompting?
-          end
-        end
-        l
-      end
-    end
-
-    def readmultiline
-      prompt = generate_prompt([], false, 0)
-
-      # multiline
-      return read_input(prompt) if @context.io.respond_to?(:check_termination)
-
-      # nomultiline
-      code = +''
-      line_offset = 0
-      loop do
-        line = read_input(prompt)
-        unless line
-          return code.empty? ? nil : code
-        end
-
-        code << line
-        return code if command?(code)
-
-        tokens, opens, terminated = @scanner.check_code_state(code, local_variables: @context.local_variables)
-        return code if terminated
-
-        line_offset += 1
-        continue = @scanner.should_continue?(tokens)
-        prompt = generate_prompt(opens, continue, line_offset)
-      end
-    end
-
-    def each_top_level_statement
-      loop do
-        code = readmultiline
-        break unless code
-        yield build_statement(code), @line_no
-        @line_no += code.count("\n")
-      rescue RubyLex::TerminateLineInput
-      end
-    end
-
-    def build_statement(code)
-      if code.match?(/\A\n*\z/)
-        return Statement::EmptyInput.new
-      end
-
-      code.force_encoding(@context.io.encoding)
-      if (command, arg = parse_command(code))
-        command_class = Command.load_command(command)
-        Statement::Command.new(code, command_class, arg)
-      else
-        is_assignment_expression = @scanner.assignment_expression?(code, local_variables: @context.local_variables)
-        Statement::Expression.new(code, is_assignment_expression)
-      end
-    end
-
-    def parse_command(code)
-      command_name, arg = code.strip.split(/\s+/, 2)
-      return unless code.lines.size == 1 && command_name
-
-      arg ||= ''
-      command = command_name.to_sym
-      # Command aliases are always command. example: $, @
-      if (alias_name = @context.command_aliases[command])
-        return [alias_name, arg]
-      end
-
-      # Check visibility
-      public_method = !!Kernel.instance_method(:public_method).bind_call(@context.main, command) rescue false
-      private_method = !public_method && !!Kernel.instance_method(:method).bind_call(@context.main, command) rescue false
-      if Command.execute_as_command?(command, public_method: public_method, private_method: private_method)
-        [command, arg]
-      end
-    end
-
-    def command?(code)
-      !!parse_command(code)
-    end
-
-    def configure_io
-      if @context.io.respond_to?(:check_termination)
-        @context.io.check_termination do |code|
-          if Reline::IOGate.in_pasting?
-            rest = @scanner.check_termination_in_prev_line(code, local_variables: @context.local_variables)
-            if rest
-              Reline.delete_text
-              rest.bytes.reverse_each do |c|
-                Reline.ungetc(c)
-              end
-              true
-            else
-              false
-            end
-          else
-            next true if command?(code)
-
-            _tokens, _opens, terminated = @scanner.check_code_state(code, local_variables: @context.local_variables)
-            terminated
-          end
-        end
-      end
-      if @context.io.respond_to?(:dynamic_prompt)
-        @context.io.dynamic_prompt do |lines|
-          tokens = RubyLex.ripper_lex_without_warning(lines.map{ |l| l + "\n" }.join, local_variables: @context.local_variables)
-          line_results = IRB::NestingParser.parse_by_line(tokens)
-          tokens_until_line = []
-          line_results.map.with_index do |(line_tokens, _prev_opens, next_opens, _min_depth), line_num_offset|
-            line_tokens.each do |token, _s|
-              # Avoid appending duplicated token. Tokens that include "n" like multiline
-              # tstring_content can exist in multiple lines.
-              tokens_until_line << token if token != tokens_until_line.last
-            end
-            continue = @scanner.should_continue?(tokens_until_line)
-            generate_prompt(next_opens, continue, line_num_offset)
-          end
-        end
-      end
-
-      if @context.io.respond_to?(:auto_indent) and @context.auto_indent_mode
-        @context.io.auto_indent do |lines, line_index, byte_pointer, is_newline|
-          next nil if lines == [nil] # Workaround for exit IRB with CTRL+d
-          next nil if !is_newline && lines[line_index]&.byteslice(0, byte_pointer)&.match?(/\A\s*\z/)
-
-          code = lines[0..line_index].map { |l| "#{l}\n" }.join
-          tokens = RubyLex.ripper_lex_without_warning(code, local_variables: @context.local_variables)
-          @scanner.process_indent_level(tokens, lines, line_index, is_newline)
-        end
-      end
-    end
-
-    def convert_invalid_byte_sequence(str, enc)
-      str.force_encoding(enc)
-      str.scrub { |c|
-        c.bytes.map{ |b| "\\x#{b.to_s(16).upcase}" }.join
-      }
-    end
-
-    def encode_with_invalid_byte_sequence(str, enc)
-      conv = Encoding::Converter.new(str.encoding, enc)
-      dst = String.new
-      begin
-        ret = conv.primitive_convert(str, dst)
-        case ret
-        when :invalid_byte_sequence
-          conv.insert_output(conv.primitive_errinfo[3].dump[1..-2])
-          redo
-        when :undefined_conversion
-          c = conv.primitive_errinfo[3].dup.force_encoding(conv.primitive_errinfo[1])
-          conv.insert_output(c.dump[1..-2])
-          redo
-        when :incomplete_input
-          conv.insert_output(conv.primitive_errinfo[3].dump[1..-2])
-        when :finished
-        end
-        break
-      end while nil
-      dst
-    end
-
-    def handle_exception(exc)
-      if exc.backtrace[0] =~ /\/irb(2)?(\/.*|-.*|\.rb)?:/ && exc.class.to_s !~ /^IRB/ &&
-         !(SyntaxError === exc) && !(EncodingError === exc)
-        # The backtrace of invalid encoding hash (ex. {"\xAE": 1}) raises EncodingError without lineno.
-        irb_bug = true
-      else
-        irb_bug = false
-        # To support backtrace filtering while utilizing Exception#full_message, we need to clone
-        # the exception to avoid modifying the original exception's backtrace.
-        exc = exc.clone
-        filtered_backtrace = exc.backtrace.map { |l| @context.workspace.filter_backtrace(l) }.compact
-        backtrace_filter = IRB.conf[:BACKTRACE_FILTER]
-
-        if backtrace_filter
-          if backtrace_filter.respond_to?(:call)
-            filtered_backtrace = backtrace_filter.call(filtered_backtrace)
-          else
-            warn "IRB.conf[:BACKTRACE_FILTER] #{backtrace_filter} should respond to `call` method"
-          end
-        end
-
-        exc.set_backtrace(filtered_backtrace)
-      end
-
-      highlight = Color.colorable?
-
-      order =
-        if RUBY_VERSION < '3.0.0'
-          STDOUT.tty? ? :bottom : :top
-        else # '3.0.0' <= RUBY_VERSION
-          :top
-        end
-
-      message = exc.full_message(order: order, highlight: highlight)
-      message = convert_invalid_byte_sequence(message, exc.message.encoding)
-      message = encode_with_invalid_byte_sequence(message, IRB.conf[:LC_MESSAGES].encoding) unless message.encoding.to_s.casecmp?(IRB.conf[:LC_MESSAGES].encoding.to_s)
-      message = message.gsub(/((?:^\t.+$\n)+)/) { |m|
-        case order
-        when :top
-          lines = m.split("\n")
-        when :bottom
-          lines = m.split("\n").reverse
-        end
-        unless irb_bug
-          if lines.size > @context.back_trace_limit
-            omit = lines.size - @context.back_trace_limit
-            lines = lines[0..(@context.back_trace_limit - 1)]
-            lines << "\t... %d levels..." % omit
-          end
-        end
-        lines = lines.reverse if order == :bottom
-        lines.map{ |l| l + "\n" }.join
-      }
-      # The "<top (required)>" in "(irb)" may be the top level of IRB so imitate the main object.
-      message = message.gsub(/\(irb\):(?<num>\d+):in (?<open_quote>[`'])<(?<frame>top \(required\))>'/) { "(irb):#{$~[:num]}:in #{$~[:open_quote]}<main>'" }
-      puts message
-      puts 'Maybe IRB bug!' if irb_bug
-    rescue Exception => handler_exc
-      begin
-        puts exc.inspect
-        puts "backtraces are hidden because #{handler_exc} was raised when processing them"
-      rescue Exception
-        puts 'Uninspectable exception occurred'
-      end
-    end
-
-    # Evaluates the given block using the given `path` as the Context#irb_path and
-    # `name` as the Context#irb_name.
-    #
-    # Used by the irb command `source`, see IRB@IRB+Sessions for more information.
-    def suspend_name(path = nil, name = nil)
-      @context.irb_path, back_path = path, @context.irb_path if path
-      @context.irb_name, back_name = name, @context.irb_name if name
-      begin
-        yield back_path, back_name
-      ensure
-        @context.irb_path = back_path if path
-        @context.irb_name = back_name if name
-      end
-    end
-
-    # Evaluates the given block using the given `workspace` as the
-    # Context#workspace.
-    #
-    # Used by the irb command `irb_load`, see IRB@IRB+Sessions for more information.
-    def suspend_workspace(workspace)
-      current_workspace = @context.workspace
-      @context.replace_workspace(workspace)
-      yield
-    ensure
-      @context.replace_workspace current_workspace
-    end
-
-    # Evaluates the given block using the given `input_method` as the Context#io.
-    #
-    # Used by the irb commands `source` and `irb_load`, see IRB@IRB+Sessions for
-    # more information.
-    def suspend_input_method(input_method)
-      back_io = @context.io
-      @context.instance_eval{@io = input_method}
-      begin
-        yield back_io
-      ensure
-        @context.instance_eval{@io = back_io}
-      end
-    end
-
-    # Handler for the signal SIGINT, see Kernel#trap for more information.
-    def signal_handle
-      unless @context.ignore_sigint?
-        print "\nabort!\n" if @context.verbose?
-        exit
-      end
-
-      case @signal_status
-      when :IN_INPUT
-        print "^C\n"
-        raise RubyLex::TerminateLineInput
-      when :IN_EVAL
-        IRB.irb_abort(self)
-      when :IN_LOAD
-        IRB.irb_abort(self, LoadAbort)
-      when :IN_IRB
-        # ignore
-      else
-        # ignore other cases as well
-      end
-    end
-
-    # Evaluates the given block using the given `status`.
-    def signal_status(status)
-      return yield if @signal_status == :IN_LOAD
-
-      signal_status_back = @signal_status
-      @signal_status = status
-      begin
-        yield
-      ensure
-        @signal_status = signal_status_back
-      end
-    end
-
-    def output_value(omit = false) # :nodoc:
-      str = @context.inspect_last_value
-      multiline_p = str.include?("\n")
-      if omit
-        winwidth = @context.io.winsize.last
-        if multiline_p
-          first_line = str.split("\n").first
-          result = @context.newline_before_multiline_output? ? (@context.return_format % first_line) : first_line
-          output_width = Reline::Unicode.calculate_width(result, true)
-          diff_size = output_width - Reline::Unicode.calculate_width(first_line, true)
-          if diff_size.positive? and output_width > winwidth
-            lines, _ = Reline::Unicode.split_by_width(first_line, winwidth - diff_size - 3)
-            str = "%s..." % lines.first
-            str += "\e[0m" if Color.colorable?
-            multiline_p = false
-          else
-            str = str.gsub(/(\A.*?\n).*/m, "\\1...")
-            str += "\e[0m" if Color.colorable?
-          end
-        else
-          output_width = Reline::Unicode.calculate_width(@context.return_format % str, true)
-          diff_size = output_width - Reline::Unicode.calculate_width(str, true)
-          if diff_size.positive? and output_width > winwidth
-            lines, _ = Reline::Unicode.split_by_width(str, winwidth - diff_size - 3)
-            str = "%s..." % lines.first
-            str += "\e[0m" if Color.colorable?
-          end
-        end
-      end
-
-      if multiline_p && @context.newline_before_multiline_output?
-        str = "\n" + str
-      end
-
-      Pager.page_content(format(@context.return_format, str), retain_content: true)
-    end
-
-    # Outputs the local variables to this current session, including #signal_status
-    # and #context, using IRB::Locale.
-    def inspect
-      ary = []
-      for iv in instance_variables
-        case (iv = iv.to_s)
-        when "@signal_status"
-          ary.push format("%s=:%s", iv, @signal_status.id2name)
-        when "@context"
-          ary.push format("%s=%s", iv, eval(iv).__to_s__)
-        else
-          ary.push format("%s=%s", iv, eval(iv))
-        end
-      end
-      format("#<%s: %s>", self.class, ary.join(", "))
-    end
-
-    private
-
-    def generate_prompt(opens, continue, line_offset)
-      ltype = @scanner.ltype_from_open_tokens(opens)
-      indent = @scanner.calc_indent_level(opens)
-      continue = opens.any? || continue
-      line_no = @line_no + line_offset
-
-      if ltype
-        f = @context.prompt_s
-      elsif continue
-        f = @context.prompt_c
-      else
-        f = @context.prompt_i
-      end
-      f = "" unless f
-      if @context.prompting?
-        p = format_prompt(f, ltype, indent, line_no)
-      else
-        p = ""
-      end
-      if @context.auto_indent_mode and !@context.io.respond_to?(:auto_indent)
-        unless ltype
-          prompt_i = @context.prompt_i.nil? ? "" : @context.prompt_i
-          ind = format_prompt(prompt_i, ltype, indent, line_no)[/.*\z/].size +
-            indent * 2 - p.size
-          p += " " * ind if ind > 0
-        end
-      end
-      p
-    end
-
-    def truncate_prompt_main(str) # :nodoc:
-      str = str.tr(CONTROL_CHARACTERS_PATTERN, ' ')
-      if str.size <= PROMPT_MAIN_TRUNCATE_LENGTH
-        str
-      else
-        str[0, PROMPT_MAIN_TRUNCATE_LENGTH - PROMPT_MAIN_TRUNCATE_OMISSION.size] + PROMPT_MAIN_TRUNCATE_OMISSION
-      end
-    end
-
-    def format_prompt(format, ltype, indent, line_no) # :nodoc:
-      format.gsub(/%([0-9]+)?([a-zA-Z%])/) do
-        case $2
-        when "N"
-          @context.irb_name
-        when "m"
-          main_str = @context.main.to_s rescue "!#{$!.class}"
-          truncate_prompt_main(main_str)
-        when "M"
-          main_str = @context.main.inspect rescue "!#{$!.class}"
-          truncate_prompt_main(main_str)
-        when "l"
-          ltype
-        when "i"
-          if indent < 0
-            if $1
-              "-".rjust($1.to_i)
-            else
-              "-"
-            end
-          else
-            if $1
-              format("%" + $1 + "d", indent)
-            else
-              indent.to_s
-            end
-          end
-        when "n"
-          if $1
-            format("%" + $1 + "d", line_no)
-          else
-            line_no.to_s
-          end
-        when "%"
-          "%" unless $1
-        end
-      end
-    end
-  end
-end
-
-class Binding
-  # Opens an IRB session where `binding.irb` is called which allows for
-  # interactive debugging. You can call any methods or variables available in the
-  # current scope, and mutate state if you need to.
-  #
-  # Given a Ruby file called `potato.rb` containing the following code:
-  #
-  #     class Potato
-  #       def initialize
-  #         @cooked = false
-  #         binding.irb
-  #         puts "Cooked potato: #{@cooked}"
-  #       end
-  #     end
-  #
-  #     Potato.new
-  #
-  # Running `ruby potato.rb` will open an IRB session where `binding.irb` is
-  # called, and you will see the following:
-  #
-  #     $ ruby potato.rb
-  #
-  #     From: potato.rb @ line 4 :
-  #
-  #         1: class Potato
-  #         2:   def initialize
-  #         3:     @cooked = false
-  #      => 4:     binding.irb
-  #         5:     puts "Cooked potato: #{@cooked}"
-  #         6:   end
-  #         7: end
-  #         8:
-  #         9: Potato.new
-  #
-  #     irb(#<Potato:0x00007feea1916670>):001:0>
-  #
-  # You can type any valid Ruby code and it will be evaluated in the current
-  # context. This allows you to debug without having to run your code repeatedly:
-  #
-  #     irb(#<Potato:0x00007feea1916670>):001:0> @cooked
-  #     => false
-  #     irb(#<Potato:0x00007feea1916670>):002:0> self.class
-  #     => Potato
-  #     irb(#<Potato:0x00007feea1916670>):003:0> caller.first
-  #     => ".../2.5.1/lib/ruby/2.5.0/irb/workspace.rb:85:in `eval'"
-  #     irb(#<Potato:0x00007feea1916670>):004:0> @cooked = true
-  #     => true
-  #
-  # You can exit the IRB session with the `exit` command. Note that exiting will
-  # resume execution where `binding.irb` had paused it, as you can see from the
-  # output printed to standard output in this example:
-  #
-  #     irb(#<Potato:0x00007feea1916670>):005:0> exit
-  #     Cooked potato: true
-  #
-  # See IRB for more information.
-  def irb(show_code: true)
-    # Setup IRB with the current file's path and no command line arguments
-    IRB.setup(source_location[0], argv: []) unless IRB.initialized?
-    # Create a new workspace using the current binding
-    workspace = IRB::WorkSpace.new(self)
-    # Print the code around the binding if show_code is true
-    STDOUT.print(workspace.code_around_binding) if show_code
-    # Get the original IRB instance
-    debugger_irb = IRB.instance_variable_get(:@debugger_irb)
-
-    irb_path = File.expand_path(source_location[0])
-
-    if debugger_irb
-      # If we're already in a debugger session, set the workspace and irb_path for the original IRB instance
-      debugger_irb.context.replace_workspace(workspace)
-      debugger_irb.context.irb_path = irb_path
-      # If we've started a debugger session and hit another binding.irb, we don't want
-      # to start an IRB session instead, we want to resume the irb:rdbg session.
-      IRB::Debug.setup(debugger_irb)
-      IRB::Debug.insert_debug_break
-      debugger_irb.debug_break
-    else
-      # If we're not in a debugger session, create a new IRB instance with the current
-      # workspace
-      binding_irb = IRB::Irb.new(workspace, from_binding: true)
-      binding_irb.context.irb_path = irb_path
-      binding_irb.run(IRB.conf)
-      binding_irb.debug_break
-    end
-  end
-end
diff --git a/lib/irb/.document b/lib/irb/.document
deleted file mode 100644
index 3b0d6fa4ed..0000000000
--- a/lib/irb/.document
+++ /dev/null
@@ -1 +0,0 @@
-**/*.rb
diff --git a/lib/irb/cmd/nop.rb b/lib/irb/cmd/nop.rb
deleted file mode 100644
index 9d2e3c4d47..0000000000
--- a/lib/irb/cmd/nop.rb
+++ /dev/null
@@ -1,4 +0,0 @@
-# frozen_string_literal: true
-
-# This file is just a placeholder for backward-compatibility.
-# Please require 'irb' and inherit your command from `IRB::Command::Base` instead.
diff --git a/lib/irb/color.rb b/lib/irb/color.rb
deleted file mode 100644
index fca942b28b..0000000000
--- a/lib/irb/color.rb
+++ /dev/null
@@ -1,262 +0,0 @@
-# frozen_string_literal: true
-require 'reline'
-require 'ripper'
-require_relative 'ruby-lex'
-
-module IRB # :nodoc:
-  module Color
-    CLEAR     = 0
-    BOLD      = 1
-    UNDERLINE = 4
-    REVERSE   = 7
-    BLACK     = 30
-    RED       = 31
-    GREEN     = 32
-    YELLOW    = 33
-    BLUE      = 34
-    MAGENTA   = 35
-    CYAN      = 36
-    WHITE     = 37
-
-    TOKEN_KEYWORDS = {
-      on_kw: ['nil', 'self', 'true', 'false', '__FILE__', '__LINE__', '__ENCODING__'],
-      on_const: ['ENV'],
-    }
-    private_constant :TOKEN_KEYWORDS
-
-    # A constant of all-bit 1 to match any Ripper's state in #dispatch_seq
-    ALL = -1
-    private_constant :ALL
-
-    begin
-      # Following pry's colors where possible, but sometimes having a compromise like making
-      # backtick and regexp as red (string's color, because they're sharing tokens).
-      TOKEN_SEQ_EXPRS = {
-        on_CHAR:            [[BLUE, BOLD],            ALL],
-        on_backtick:        [[RED, BOLD],             ALL],
-        on_comment:         [[BLUE, BOLD],            ALL],
-        on_const:           [[BLUE, BOLD, UNDERLINE], ALL],
-        on_embexpr_beg:     [[RED],                   ALL],
-        on_embexpr_end:     [[RED],                   ALL],
-        on_embvar:          [[RED],                   ALL],
-        on_float:           [[MAGENTA, BOLD],         ALL],
-        on_gvar:            [[GREEN, BOLD],           ALL],
-        on_heredoc_beg:     [[RED],                   ALL],
-        on_heredoc_end:     [[RED],                   ALL],
-        on_ident:           [[BLUE, BOLD],            Ripper::EXPR_ENDFN],
-        on_imaginary:       [[BLUE, BOLD],            ALL],
-        on_int:             [[BLUE, BOLD],            ALL],
-        on_kw:              [[GREEN],                 ALL],
-        on_label:           [[MAGENTA],               ALL],
-        on_label_end:       [[RED, BOLD],             ALL],
-        on_qsymbols_beg:    [[RED, BOLD],             ALL],
-        on_qwords_beg:      [[RED, BOLD],             ALL],
-        on_rational:        [[BLUE, BOLD],            ALL],
-        on_regexp_beg:      [[RED, BOLD],             ALL],
-        on_regexp_end:      [[RED, BOLD],             ALL],
-        on_symbeg:          [[YELLOW],                ALL],
-        on_symbols_beg:     [[RED, BOLD],             ALL],
-        on_tstring_beg:     [[RED, BOLD],             ALL],
-        on_tstring_content: [[RED],                   ALL],
-        on_tstring_end:     [[RED, BOLD],             ALL],
-        on_words_beg:       [[RED, BOLD],             ALL],
-        on_parse_error:     [[RED, REVERSE],          ALL],
-        compile_error:      [[RED, REVERSE],          ALL],
-        on_assign_error:    [[RED, REVERSE],          ALL],
-        on_alias_error:     [[RED, REVERSE],          ALL],
-        on_class_name_error:[[RED, REVERSE],          ALL],
-        on_param_error:     [[RED, REVERSE],          ALL],
-        on___end__:         [[GREEN],                 ALL],
-      }
-    rescue NameError
-      # Give up highlighting Ripper-incompatible older Ruby
-      TOKEN_SEQ_EXPRS = {}
-    end
-    private_constant :TOKEN_SEQ_EXPRS
-
-    ERROR_TOKENS = TOKEN_SEQ_EXPRS.keys.select { |k| k.to_s.end_with?('error') }
-    private_constant :ERROR_TOKENS
-
-    class << self
-      def colorable?
-        supported = $stdout.tty? && (/mswin|mingw/.match?(RUBY_PLATFORM) || (ENV.key?('TERM') && ENV['TERM'] != 'dumb'))
-
-        # because ruby/debug also uses irb's color module selectively,
-        # irb won't be activated in that case.
-        if IRB.respond_to?(:conf)
-          supported && !!IRB.conf.fetch(:USE_COLORIZE, true)
-        else
-          supported
-        end
-      end
-
-      def inspect_colorable?(obj, seen: {}.compare_by_identity)
-        case obj
-        when String, Symbol, Regexp, Integer, Float, FalseClass, TrueClass, NilClass
-          true
-        when Hash
-          without_circular_ref(obj, seen: seen) do
-            obj.all? { |k, v| inspect_colorable?(k, seen: seen) && inspect_colorable?(v, seen: seen) }
-          end
-        when Array
-          without_circular_ref(obj, seen: seen) do
-            obj.all? { |o| inspect_colorable?(o, seen: seen) }
-          end
-        when Range
-          inspect_colorable?(obj.begin, seen: seen) && inspect_colorable?(obj.end, seen: seen)
-        when Module
-          !obj.name.nil?
-        else
-          false
-        end
-      end
-
-      def clear(colorable: colorable?)
-        return '' unless colorable
-        "\e[#{CLEAR}m"
-      end
-
-      def colorize(text, seq, colorable: colorable?)
-        return text unless colorable
-        seq = seq.map { |s| "\e[#{const_get(s)}m" }.join('')
-        "#{seq}#{text}#{clear(colorable: colorable)}"
-      end
-
-      # If `complete` is false (code is incomplete), this does not warn compile_error.
-      # This option is needed to avoid warning a user when the compile_error is happening
-      # because the input is not wrong but just incomplete.
-      def colorize_code(code, complete: true, ignore_error: false, colorable: colorable?, local_variables: [])
-        return code unless colorable
-
-        symbol_state = SymbolState.new
-        colored = +''
-        lvars_code = RubyLex.generate_local_variables_assign_code(local_variables)
-        code_with_lvars = lvars_code ? "#{lvars_code}\n#{code}" : code
-
-        scan(code_with_lvars, allow_last_error: !complete) do |token, str, expr|
-          # handle uncolorable code
-          if token.nil?
-            colored << Reline::Unicode.escape_for_print(str)
-            next
-          end
-
-          # IRB::ColorPrinter skips colorizing fragments with any invalid token
-          if ignore_error && ERROR_TOKENS.include?(token)
-            return Reline::Unicode.escape_for_print(code)
-          end
-
-          in_symbol = symbol_state.scan_token(token)
-          str.each_line do |line|
-            line = Reline::Unicode.escape_for_print(line)
-            if seq = dispatch_seq(token, expr, line, in_symbol: in_symbol)
-              colored << seq.map { |s| "\e[#{s}m" }.join('')
-              colored << line.sub(/\Z/, clear(colorable: colorable))
-            else
-              colored << line
-            end
-          end
-        end
-
-        if lvars_code
-          raise "#{lvars_code.dump} should have no \\n" if lvars_code.include?("\n")
-          colored.sub!(/\A.+\n/, '') # delete_prefix lvars_code with colors
-        end
-        colored
-      end
-
-      private
-
-      def without_circular_ref(obj, seen:, &block)
-        return false if seen.key?(obj)
-        seen[obj] = true
-        block.call
-      ensure
-        seen.delete(obj)
-      end
-
-      def scan(code, allow_last_error:)
-        verbose, $VERBOSE = $VERBOSE, nil
-        RubyLex.compile_with_errors_suppressed(code) do |inner_code, line_no|
-          lexer = Ripper::Lexer.new(inner_code, '(ripper)', line_no)
-          byte_pos = 0
-          line_positions = [0]
-          inner_code.lines.each do |line|
-            line_positions << line_positions.last + line.bytesize
-          end
-
-          on_scan = proc do |elem|
-            start_pos = line_positions[elem.pos[0] - 1] + elem.pos[1]
-
-            # yield uncolorable code
-            if byte_pos < start_pos
-              yield(nil, inner_code.byteslice(byte_pos...start_pos), nil)
-            end
-
-            if byte_pos <= start_pos
-              str = elem.tok
-              yield(elem.event, str, elem.state)
-              byte_pos = start_pos + str.bytesize
-            end
-          end
-
-          lexer.scan.each do |elem|
-            next if allow_last_error and /meets end of file|unexpected end-of-input/ =~ elem.message
-            on_scan.call(elem)
-          end
-          # yield uncolorable DATA section
-          yield(nil, inner_code.byteslice(byte_pos...inner_code.bytesize), nil) if byte_pos < inner_code.bytesize
-        end
-      ensure
-        $VERBOSE = verbose
-      end
-
-      def dispatch_seq(token, expr, str, in_symbol:)
-        if ERROR_TOKENS.include?(token)
-          TOKEN_SEQ_EXPRS[token][0]
-        elsif in_symbol
-          [YELLOW]
-        elsif TOKEN_KEYWORDS.fetch(token, []).include?(str)
-          [CYAN, BOLD]
-        elsif (seq, exprs = TOKEN_SEQ_EXPRS[token]; (expr & (exprs || 0)) != 0)
-          seq
-        else
-          nil
-        end
-      end
-    end
-
-    # A class to manage a state to know whether the current token is for Symbol or not.
-    class SymbolState
-      def initialize
-        # Push `true` to detect Symbol. `false` to increase the nest level for non-Symbol.
-        @stack = []
-      end
-
-      # Return true if the token is a part of Symbol.
-      def scan_token(token)
-        prev_state = @stack.last
-        case token
-        when :on_symbeg, :on_symbols_beg, :on_qsymbols_beg
-          @stack << true
-        when :on_ident, :on_op, :on_const, :on_ivar, :on_cvar, :on_gvar, :on_kw, :on_backtick
-          if @stack.last # Pop only when it's Symbol
-            @stack.pop
-            return prev_state
-          end
-        when :on_tstring_beg
-          @stack << false
-        when :on_embexpr_beg
-          @stack << false
-          return prev_state
-        when :on_tstring_end # :on_tstring_end may close Symbol
-          @stack.pop
-          return prev_state
-        when :on_embexpr_end
-          @stack.pop
-        end
-        @stack.last
-      end
-    end
-    private_constant :SymbolState
-  end
-end
diff --git a/lib/irb/color_printer.rb b/lib/irb/color_printer.rb
deleted file mode 100644
index 31644aa7f9..0000000000
--- a/lib/irb/color_printer.rb
+++ /dev/null
@@ -1,55 +0,0 @@
-# frozen_string_literal: true
-require 'pp'
-require_relative 'color'
-
-module IRB
-  class ColorPrinter < ::PP
-    METHOD_RESPOND_TO = Object.instance_method(:respond_to?)
-    METHOD_INSPECT = Object.instance_method(:inspect)
-
-    class << self
-      def pp(obj, out = $>, width = screen_width)
-        q = ColorPrinter.new(out, width)
-        q.guard_inspect_key {q.pp obj}
-        q.flush
-        out << "\n"
-      end
-
-      private
-
-      def screen_width
-        Reline.get_screen_size.last
-      rescue Errno::EINVAL # in `winsize': Invalid argument - <STDIN>
-        79
-      end
-    end
-
-    def pp(obj)
-      if String === obj
-        # Avoid calling Ruby 2.4+ String#pretty_print that splits a string by "\n"
-        text(obj.inspect)
-      elsif !METHOD_RESPOND_TO.bind(obj).call(:inspect)
-        text(METHOD_INSPECT.bind(obj).call)
-      else
-        super
-      end
-    end
-
-    def text(str, width = nil)
-      unless str.is_a?(String)
-        str = str.inspect
-      end
-      width ||= str.length
-
-      case str
-      when ''
-      when ',', '=>', '[', ']', '{', '}', '..', '...', /\A@\w+\z/
-        super(str, width)
-      when /\A#</, '=', '>'
-        super(Color.colorize(str, [:GREEN]), width)
-      else
-        super(Color.colorize_code(str, ignore_error: true), width)
-      end
-    end
-  end
-end
diff --git a/lib/irb/command.rb b/lib/irb/command.rb
deleted file mode 100644
index 68a4b52727..0000000000
--- a/lib/irb/command.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/command.rb - irb command
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative "command/base"
-
-module IRB # :nodoc:
-  module Command
-    @commands = {}
-
-    class << self
-      attr_reader :commands
-
-      # Registers a command with the given name.
-      # Aliasing is intentionally not supported at the moment.
-      def register(name, command_class)
-        @commands[name.to_sym] = [command_class, []]
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/backtrace.rb b/lib/irb/command/backtrace.rb
deleted file mode 100644
index 687bb075ac..0000000000
--- a/lib/irb/command/backtrace.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Backtrace < DebugCommand
-      def execute(arg)
-        execute_debug_command(pre_cmds: "backtrace #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/base.rb b/lib/irb/command/base.rb
deleted file mode 100644
index 1d406630a2..0000000000
--- a/lib/irb/command/base.rb
+++ /dev/null
@@ -1,62 +0,0 @@
-# frozen_string_literal: true
-#
-#   nop.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class CommandArgumentError < StandardError; end
-
-    def self.extract_ruby_args(*args, **kwargs)
-      throw :EXTRACT_RUBY_ARGS, [args, kwargs]
-    end
-
-    class Base
-      class << self
-        def category(category = nil)
-          @category = category if category
-          @category || "No category"
-        end
-
-        def description(description = nil)
-          @description = description if description
-          @description || "No description provided."
-        end
-
-        def help_message(help_message = nil)
-          @help_message = help_message if help_message
-          @help_message
-        end
-
-        private
-
-        def highlight(text)
-          Color.colorize(text, [:BOLD, :BLUE])
-        end
-      end
-
-      def self.execute(irb_context, arg)
-        new(irb_context).execute(arg)
-      rescue CommandArgumentError => e
-        puts e.message
-      end
-
-      def initialize(irb_context)
-        @irb_context = irb_context
-      end
-
-      attr_reader :irb_context
-
-      def execute(arg)
-        #nop
-      end
-    end
-
-    Nop = Base
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/break.rb b/lib/irb/command/break.rb
deleted file mode 100644
index a8f81fe665..0000000000
--- a/lib/irb/command/break.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Break < DebugCommand
-      def execute(arg)
-        execute_debug_command(pre_cmds: "break #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/catch.rb b/lib/irb/command/catch.rb
deleted file mode 100644
index 529dcbca5a..0000000000
--- a/lib/irb/command/catch.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Catch < DebugCommand
-      def execute(arg)
-        execute_debug_command(pre_cmds: "catch #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/chws.rb b/lib/irb/command/chws.rb
deleted file mode 100644
index ef456d0961..0000000000
--- a/lib/irb/command/chws.rb
+++ /dev/null
@@ -1,40 +0,0 @@
-# frozen_string_literal: true
-#
-#   change-ws.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-require_relative "../ext/change-ws"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-
-    class CurrentWorkingWorkspace < Base
-      category "Workspace"
-      description "Show the current workspace."
-
-      def execute(_arg)
-        puts "Current workspace: #{irb_context.main}"
-      end
-    end
-
-    class ChangeWorkspace < Base
-      category "Workspace"
-      description "Change the current workspace to an object."
-
-      def execute(arg)
-        if arg.empty?
-          irb_context.change_workspace
-        else
-          obj = eval(arg, irb_context.workspace.binding)
-          irb_context.change_workspace(obj)
-        end
-
-        puts "Current workspace: #{irb_context.main}"
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/context.rb b/lib/irb/command/context.rb
deleted file mode 100644
index b4fc807343..0000000000
--- a/lib/irb/command/context.rb
+++ /dev/null
@@ -1,16 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  module Command
-    class Context < Base
-      category "IRB"
-      description "Displays current configuration."
-
-      def execute(_arg)
-        # This command just displays the configuration.
-        # Modifying the configuration is achieved by sending a message to IRB.conf.
-        Pager.page_content(IRB.CurrentContext.inspect)
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/continue.rb b/lib/irb/command/continue.rb
deleted file mode 100644
index 0daa029b15..0000000000
--- a/lib/irb/command/continue.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Continue < DebugCommand
-      def execute(arg)
-        execute_debug_command(do_cmds: "continue #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/debug.rb b/lib/irb/command/debug.rb
deleted file mode 100644
index 8a091a49ed..0000000000
--- a/lib/irb/command/debug.rb
+++ /dev/null
@@ -1,71 +0,0 @@
-require_relative "../debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Debug < Base
-      category "Debugging"
-      description "Start the debugger of debug.gem."
-
-      def execute(_arg)
-        execute_debug_command
-      end
-
-      def execute_debug_command(pre_cmds: nil, do_cmds: nil)
-        pre_cmds = pre_cmds&.rstrip
-        do_cmds = do_cmds&.rstrip
-
-        if irb_context.with_debugger
-          # If IRB is already running with a debug session, throw the command and IRB.debug_readline will pass it to the debugger.
-          if cmd = pre_cmds || do_cmds
-            throw :IRB_EXIT, cmd
-          else
-            puts "IRB is already running with a debug session."
-            return
-          end
-        else
-          # If IRB is not running with a debug session yet, then:
-          # 1. Check if the debugging command is run from a `binding.irb` call.
-          # 2. If so, try setting up the debug gem.
-          # 3. Insert a debug breakpoint at `Irb#debug_break` with the intended command.
-          # 4. Exit the current Irb#run call via `throw :IRB_EXIT`.
-          # 5. `Irb#debug_break` will be called and trigger the breakpoint, which will run the intended command.
-          unless irb_context.from_binding?
-            puts "Debugging commands are only available when IRB is started with binding.irb"
-            return
-          end
-
-          if IRB.respond_to?(:JobManager)
-            warn "Can't start the debugger when IRB is running in a multi-IRB session."
-            return
-          end
-
-          unless IRB::Debug.setup(irb_context.irb)
-            puts <<~MSG
-              You need to install the debug gem before using this command.
-              If you use `bundle exec`, please add `gem "debug"` into your Gemfile.
-            MSG
-            return
-          end
-
-          IRB::Debug.insert_debug_break(pre_cmds: pre_cmds, do_cmds: do_cmds)
-
-          # exit current Irb#run call
-          throw :IRB_EXIT
-        end
-      end
-    end
-
-    class DebugCommand < Debug
-      def self.category
-        "Debugging"
-      end
-
-      def self.description
-        command_name = self.name.split("::").last.downcase
-        "Start the debugger of debug.gem and run its `#{command_name}` command."
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/delete.rb b/lib/irb/command/delete.rb
deleted file mode 100644
index 2a57a4a3de..0000000000
--- a/lib/irb/command/delete.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Delete < DebugCommand
-      def execute(arg)
-        execute_debug_command(pre_cmds: "delete #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/disable_irb.rb b/lib/irb/command/disable_irb.rb
deleted file mode 100644
index 0b00d0302b..0000000000
--- a/lib/irb/command/disable_irb.rb
+++ /dev/null
@@ -1,19 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class DisableIrb < Base
-      category "IRB"
-      description "Disable binding.irb."
-
-      def execute(*)
-        ::Binding.define_method(:irb) {}
-        IRB.irb_exit
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/edit.rb b/lib/irb/command/edit.rb
deleted file mode 100644
index cb7e0c4873..0000000000
--- a/lib/irb/command/edit.rb
+++ /dev/null
@@ -1,63 +0,0 @@
-require 'shellwords'
-
-require_relative "../color"
-require_relative "../source_finder"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Edit < Base
-      include RubyArgsExtractor
-
-      category "Misc"
-      description 'Open a file or source location.'
-      help_message <<~HELP_MESSAGE
-        Usage: edit [FILE or constant or method signature]
-
-        Open a file in the editor specified in #{highlight('ENV["VISUAL"]')} or #{highlight('ENV["EDITOR"]')}
-
-        - If no arguments are provided, IRB will attempt to open the file the current context was defined in.
-        - If FILE is provided, IRB will open the file.
-        - If a constant or method signature is provided, IRB will attempt to locate the source file and open it.
-
-        Examples:
-
-          edit
-          edit foo.rb
-          edit Foo
-          edit Foo#bar
-      HELP_MESSAGE
-
-      def execute(arg)
-        # Accept string literal for backward compatibility
-        path = unwrap_string_literal(arg)
-
-        if path.nil?
-          path = @irb_context.irb_path
-        elsif !File.exist?(path)
-          source = SourceFinder.new(@irb_context).find_source(path)
-
-          if source&.file_exist? && !source.binary_file?
-            path = source.file
-          end
-        end
-
-        unless File.exist?(path)
-          puts "Can not find file: #{path}"
-          return
-        end
-
-        if editor = (ENV['VISUAL'] || ENV['EDITOR'])
-          puts "command: '#{editor}'"
-          puts "   path: #{path}"
-          system(*Shellwords.split(editor), path)
-        else
-          puts "Can not find editor setting: ENV['VISUAL'] or ENV['EDITOR']"
-        end
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/exit.rb b/lib/irb/command/exit.rb
deleted file mode 100644
index b4436f0343..0000000000
--- a/lib/irb/command/exit.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Exit < Base
-      category "IRB"
-      description "Exit the current irb session."
-
-      def execute(_arg)
-        IRB.irb_exit
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/finish.rb b/lib/irb/command/finish.rb
deleted file mode 100644
index 3311a0e6e9..0000000000
--- a/lib/irb/command/finish.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Finish < DebugCommand
-      def execute(arg)
-        execute_debug_command(do_cmds: "finish #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/force_exit.rb b/lib/irb/command/force_exit.rb
deleted file mode 100644
index 14086aa849..0000000000
--- a/lib/irb/command/force_exit.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class ForceExit < Base
-      category "IRB"
-      description "Exit the current process."
-
-      def execute(_arg)
-        throw :IRB_EXIT, true
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/help.rb b/lib/irb/command/help.rb
deleted file mode 100644
index c2018f9b30..0000000000
--- a/lib/irb/command/help.rb
+++ /dev/null
@@ -1,83 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  module Command
-    class Help < Base
-      category "Help"
-      description "List all available commands. Use `help <command>` to get information about a specific command."
-
-      def execute(command_name)
-        content =
-          if command_name.empty?
-            help_message
-          else
-            if command_class = Command.load_command(command_name)
-              command_class.help_message || command_class.description
-            else
-              "Can't find command `#{command_name}`. Please check the command name and try again.\n\n"
-            end
-          end
-        Pager.page_content(content)
-      end
-
-      private
-
-      def help_message
-        commands_info = IRB::Command.all_commands_info
-        helper_methods_info = IRB::HelperMethod.all_helper_methods_info
-        commands_grouped_by_categories = commands_info.group_by { |cmd| cmd[:category] }
-        commands_grouped_by_categories["Helper methods"] = helper_methods_info
-
-        if irb_context.with_debugger
-          # Remove the original "Debugging" category
-          commands_grouped_by_categories.delete("Debugging")
-        end
-
-        longest_cmd_name_length = commands_info.map { |c| c[:display_name].length }.max
-
-        output = StringIO.new
-
-        help_cmds = commands_grouped_by_categories.delete("Help")
-        no_category_cmds = commands_grouped_by_categories.delete("No category")
-        aliases = irb_context.instance_variable_get(:@user_aliases).map do |alias_name, target|
-          { display_name: alias_name, description: "Alias for `#{target}`" }
-        end
-
-        # Display help commands first
-        add_category_to_output("Help", help_cmds, output, longest_cmd_name_length)
-
-        # Display the rest of the commands grouped by categories
-        commands_grouped_by_categories.each do |category, cmds|
-          add_category_to_output(category, cmds, output, longest_cmd_name_length)
-        end
-
-        # Display commands without a category
-        if no_category_cmds
-          add_category_to_output("No category", no_category_cmds, output, longest_cmd_name_length)
-        end
-
-        # Display aliases
-        add_category_to_output("Aliases", aliases, output, longest_cmd_name_length)
-
-        # Append the debugger help at the end
-        if irb_context.with_debugger
-          # Add "Debugging (from debug.gem)" category as title
-          add_category_to_output("Debugging (from debug.gem)", [], output, longest_cmd_name_length)
-          output.puts DEBUGGER__.help
-        end
-
-        output.string
-      end
-
-      def add_category_to_output(category, cmds, output, longest_cmd_name_length)
-        output.puts Color.colorize(category, [:BOLD])
-
-        cmds.each do |cmd|
-          output.puts "  #{cmd[:display_name].to_s.ljust(longest_cmd_name_length)}    #{cmd[:description]}"
-        end
-
-        output.puts
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/history.rb b/lib/irb/command/history.rb
deleted file mode 100644
index 90f87f9102..0000000000
--- a/lib/irb/command/history.rb
+++ /dev/null
@@ -1,45 +0,0 @@
-# frozen_string_literal: true
-
-require "stringio"
-
-require_relative "../pager"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class History < Base
-      category "IRB"
-      description "Shows the input history. `-g [query]` or `-G [query]` allows you to filter the output."
-
-      def execute(arg)
-
-        if (match = arg&.match(/(-g|-G)\s+(?<grep>.+)\s*\n\z/))
-          grep = Regexp.new(match[:grep])
-        end
-
-        formatted_inputs = irb_context.io.class::HISTORY.each_with_index.reverse_each.filter_map do |input, index|
-          next if grep && !input.match?(grep)
-
-          header = "#{index}: "
-
-          first_line, *other_lines = input.split("\n")
-          first_line = "#{header}#{first_line}"
-
-          truncated_lines = other_lines.slice!(1..) # Show 1 additional line (2 total)
-          other_lines << "..." if truncated_lines&.any?
-
-          other_lines.map! do |line|
-            " " * header.length + line
-          end
-
-          [first_line, *other_lines].join("\n") + "\n"
-        end
-
-        Pager.page_content(formatted_inputs.join)
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/info.rb b/lib/irb/command/info.rb
deleted file mode 100644
index d08ce00a32..0000000000
--- a/lib/irb/command/info.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Info < DebugCommand
-      def execute(arg)
-        execute_debug_command(pre_cmds: "info #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/internal_helpers.rb b/lib/irb/command/internal_helpers.rb
deleted file mode 100644
index 249b5cdede..0000000000
--- a/lib/irb/command/internal_helpers.rb
+++ /dev/null
@@ -1,27 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  module Command
-    # Internal use only, for default command's backward compatibility.
-    module RubyArgsExtractor # :nodoc:
-      def unwrap_string_literal(str)
-        return if str.empty?
-
-        sexp = Ripper.sexp(str)
-        if sexp && sexp.size == 2 && sexp.last&.first&.first == :string_literal
-          @irb_context.workspace.binding.eval(str).to_s
-        else
-          str
-        end
-      end
-
-      def ruby_args(arg)
-        # Use throw and catch to handle arg that includes `;`
-        # For example: "1, kw: (2; 3); 4" will be parsed to [[1], { kw: 3 }]
-        catch(:EXTRACT_RUBY_ARGS) do
-          @irb_context.workspace.binding.eval "IRB::Command.extract_ruby_args #{arg}"
-        end || [[], {}]
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/irb_info.rb b/lib/irb/command/irb_info.rb
deleted file mode 100644
index 6d868de94c..0000000000
--- a/lib/irb/command/irb_info.rb
+++ /dev/null
@@ -1,33 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class IrbInfo < Base
-      category "IRB"
-      description "Show information about IRB."
-
-      def execute(_arg)
-        str  = "Ruby version: #{RUBY_VERSION}\n"
-        str += "IRB version: #{IRB.version}\n"
-        str += "InputMethod: #{IRB.CurrentContext.io.inspect}\n"
-        str += "Completion: #{IRB.CurrentContext.io.respond_to?(:completion_info) ? IRB.CurrentContext.io.completion_info : 'off'}\n"
-        rc_files = IRB.irbrc_files
-        str += ".irbrc paths: #{rc_files.join(", ")}\n" if rc_files.any?
-        str += "RUBY_PLATFORM: #{RUBY_PLATFORM}\n"
-        str += "LANG env: #{ENV["LANG"]}\n" if ENV["LANG"] && !ENV["LANG"].empty?
-        str += "LC_ALL env: #{ENV["LC_ALL"]}\n" if ENV["LC_ALL"] && !ENV["LC_ALL"].empty?
-        str += "East Asian Ambiguous Width: #{Reline.ambiguous_width.inspect}\n"
-        if RbConfig::CONFIG['host_os'] =~ /mswin|msys|mingw|cygwin|bccwin|wince|emc/
-          codepage = `chcp`.b.sub(/.*: (\d+)\n/, '\1')
-          str += "Code page: #{codepage}\n"
-        end
-        puts str
-        nil
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/load.rb b/lib/irb/command/load.rb
deleted file mode 100644
index 1cd3f279d1..0000000000
--- a/lib/irb/command/load.rb
+++ /dev/null
@@ -1,91 +0,0 @@
-# frozen_string_literal: true
-#
-#   load.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-require_relative "../ext/loader"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class LoaderCommand < Base
-      include RubyArgsExtractor
-      include IrbLoader
-
-      def raise_cmd_argument_error
-        raise CommandArgumentError.new("Please specify the file name.")
-      end
-    end
-
-    class Load < LoaderCommand
-      category "IRB"
-      description "Load a Ruby file."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(file_name = nil, priv = nil)
-        raise_cmd_argument_error unless file_name
-        irb_load(file_name, priv)
-      end
-    end
-
-    class Require < LoaderCommand
-      category "IRB"
-      description "Require a Ruby file."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(file_name = nil)
-        raise_cmd_argument_error unless file_name
-
-        rex = Regexp.new("#{Regexp.quote(file_name)}(\.o|\.rb)?")
-        return false if $".find{|f| f =~ rex}
-
-        case file_name
-        when /\.rb$/
-          begin
-            if irb_load(file_name)
-              $".push file_name
-              return true
-            end
-          rescue LoadError
-          end
-        when /\.(so|o|sl)$/
-          return ruby_require(file_name)
-        end
-
-        begin
-          irb_load(f = file_name + ".rb")
-          $".push f
-          return true
-        rescue LoadError
-          return ruby_require(file_name)
-        end
-      end
-    end
-
-    class Source < LoaderCommand
-      category "IRB"
-      description "Loads a given file in the current session."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(file_name = nil)
-        raise_cmd_argument_error unless file_name
-
-        source_file(file_name)
-      end
-    end
-  end
-  # :startdoc:
-end
diff --git a/lib/irb/command/ls.rb b/lib/irb/command/ls.rb
deleted file mode 100644
index cbd9998bc4..0000000000
--- a/lib/irb/command/ls.rb
+++ /dev/null
@@ -1,155 +0,0 @@
-# frozen_string_literal: true
-
-require "reline"
-require "stringio"
-
-require_relative "../pager"
-require_relative "../color"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Ls < Base
-      include RubyArgsExtractor
-
-      category "Context"
-      description "Show methods, constants, and variables."
-
-      help_message <<~HELP_MESSAGE
-        Usage: ls [obj] [-g [query]]
-
-          -g [query]  Filter the output with a query.
-      HELP_MESSAGE
-
-      def execute(arg)
-        if match = arg.match(/\A(?<target>.+\s|)(-g|-G)\s+(?<grep>.+)$/)
-          if match[:target].empty?
-            use_main = true
-          else
-            obj = @irb_context.workspace.binding.eval(match[:target])
-          end
-          grep = Regexp.new(match[:grep])
-        else
-          args, kwargs = ruby_args(arg)
-          use_main = args.empty?
-          obj = args.first
-          grep = kwargs[:grep]
-        end
-
-        if use_main
-          obj = irb_context.workspace.main
-          locals = irb_context.workspace.binding.local_variables
-        end
-
-        o = Output.new(grep: grep)
-
-        klass  = (obj.class == Class || obj.class == Module ? obj : obj.class)
-
-        o.dump("constants", obj.constants) if obj.respond_to?(:constants)
-        dump_methods(o, klass, obj)
-        o.dump("instance variables", obj.instance_variables)
-        o.dump("class variables", klass.class_variables)
-        o.dump("locals", locals) if locals
-        o.print_result
-      end
-
-      def dump_methods(o, klass, obj)
-        singleton_class = begin obj.singleton_class; rescue TypeError; nil end
-        dumped_mods = Array.new
-        ancestors = klass.ancestors
-        ancestors = ancestors.reject { |c| c >= Object } if klass < Object
-        singleton_ancestors = (singleton_class&.ancestors || []).reject { |c| c >= Class }
-
-        # singleton_class' ancestors should be at the front
-        maps = class_method_map(singleton_ancestors, dumped_mods) + class_method_map(ancestors, dumped_mods)
-        maps.each do |mod, methods|
-          name = mod == singleton_class ? "#{klass}.methods" : "#{mod}#methods"
-          o.dump(name, methods)
-        end
-      end
-
-      def class_method_map(classes, dumped_mods)
-        dumped_methods = Array.new
-        classes.map do |mod|
-          next if dumped_mods.include? mod
-
-          dumped_mods << mod
-
-          methods = mod.public_instance_methods(false).select do |method|
-            if dumped_methods.include? method
-              false
-            else
-              dumped_methods << method
-              true
-            end
-          end
-
-          [mod, methods]
-        end.compact
-      end
-
-      class Output
-        MARGIN = "  "
-
-        def initialize(grep: nil)
-          @grep = grep
-          @line_width = screen_width - MARGIN.length # right padding
-          @io = StringIO.new
-        end
-
-        def print_result
-          Pager.page_content(@io.string)
-        end
-
-        def dump(name, strs)
-          strs = strs.grep(@grep) if @grep
-          strs = strs.sort
-          return if strs.empty?
-
-          # Attempt a single line
-          @io.print "#{Color.colorize(name, [:BOLD, :BLUE])}: "
-          if fits_on_line?(strs, cols: strs.size, offset: "#{name}: ".length)
-            @io.puts strs.join(MARGIN)
-            return
-          end
-          @io.puts
-
-          # Dump with the largest # of columns that fits on a line
-          cols = strs.size
-          until fits_on_line?(strs, cols: cols, offset: MARGIN.length) || cols == 1
-            cols -= 1
-          end
-          widths = col_widths(strs, cols: cols)
-          strs.each_slice(cols) do |ss|
-            @io.puts ss.map.with_index { |s, i| "#{MARGIN}%-#{widths[i]}s" % s }.join
-          end
-        end
-
-        private
-
-        def fits_on_line?(strs, cols:, offset: 0)
-          width = col_widths(strs, cols: cols).sum + MARGIN.length * (cols - 1)
-          width <= @line_width - offset
-        end
-
-        def col_widths(strs, cols:)
-          cols.times.map do |col|
-            (col...strs.size).step(cols).map do |i|
-              strs[i].length
-            end.max
-          end
-        end
-
-        def screen_width
-          Reline.get_screen_size.last
-        rescue Errno::EINVAL # in `winsize': Invalid argument - <STDIN>
-          80
-        end
-      end
-      private_constant :Output
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/measure.rb b/lib/irb/command/measure.rb
deleted file mode 100644
index f96be20de8..0000000000
--- a/lib/irb/command/measure.rb
+++ /dev/null
@@ -1,49 +0,0 @@
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Measure < Base
-      include RubyArgsExtractor
-
-      category "Misc"
-      description "`measure` enables the mode to measure processing time. `measure :off` disables it."
-
-      def initialize(*args)
-        super(*args)
-      end
-
-      def execute(arg)
-        if arg&.match?(/^do$|^do[^\w]|^\{/)
-          warn 'Configure IRB.conf[:MEASURE_PROC] to add custom measure methods.'
-          return
-        end
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(type = nil, arg = nil)
-        # Please check IRB.init_config in lib/irb/init.rb that sets
-        # IRB.conf[:MEASURE_PROC] to register default "measure" methods,
-        # "measure :time" (abbreviated as "measure") and "measure :stackprof".
-
-        case type
-        when :off
-          IRB.unset_measure_callback(arg)
-        when :list
-          IRB.conf[:MEASURE_CALLBACKS].each do |type_name, _, arg_val|
-            puts "- #{type_name}" + (arg_val ? "(#{arg_val.inspect})" : '')
-          end
-        when :on
-          added = IRB.set_measure_callback(arg)
-          puts "#{added[0]} is added." if added
-        else
-          added = IRB.set_measure_callback(type, arg)
-          puts "#{added[0]} is added." if added
-        end
-        nil
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/next.rb b/lib/irb/command/next.rb
deleted file mode 100644
index 3fc6b68d21..0000000000
--- a/lib/irb/command/next.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Next < DebugCommand
-      def execute(arg)
-        execute_debug_command(do_cmds: "next #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/pushws.rb b/lib/irb/command/pushws.rb
deleted file mode 100644
index b51928c650..0000000000
--- a/lib/irb/command/pushws.rb
+++ /dev/null
@@ -1,65 +0,0 @@
-# frozen_string_literal: true
-#
-#   change-ws.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative "../ext/workspaces"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Workspaces < Base
-      category "Workspace"
-      description "Show workspaces."
-
-      def execute(_arg)
-        inspection_resuls = irb_context.instance_variable_get(:@workspace_stack).map do |ws|
-          truncated_inspect(ws.main)
-        end
-
-        puts "[" + inspection_resuls.join(", ") + "]"
-      end
-
-      private
-
-      def truncated_inspect(obj)
-        obj_inspection = obj.inspect
-
-        if obj_inspection.size > 20
-          obj_inspection = obj_inspection[0, 19] + "...>"
-        end
-
-        obj_inspection
-      end
-    end
-
-    class PushWorkspace < Workspaces
-      category "Workspace"
-      description "Push an object to the workspace stack."
-
-      def execute(arg)
-        if arg.empty?
-          irb_context.push_workspace
-        else
-          obj = eval(arg, irb_context.workspace.binding)
-          irb_context.push_workspace(obj)
-        end
-        super
-      end
-    end
-
-    class PopWorkspace < Workspaces
-      category "Workspace"
-      description "Pop a workspace from the workspace stack."
-
-      def execute(_arg)
-        irb_context.pop_workspace
-        super
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/show_doc.rb b/lib/irb/command/show_doc.rb
deleted file mode 100644
index 8a2188e4eb..0000000000
--- a/lib/irb/command/show_doc.rb
+++ /dev/null
@@ -1,51 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  module Command
-    class ShowDoc < Base
-      include RubyArgsExtractor
-
-      category "Context"
-      description "Look up documentation with RI."
-
-      help_message <<~HELP_MESSAGE
-        Usage: show_doc [name]
-
-        When name is provided, IRB will look up the documentation for the given name.
-        When no name is provided, a RI session will be started.
-
-        Examples:
-
-          show_doc
-          show_doc Array
-          show_doc Array#each
-
-      HELP_MESSAGE
-
-      def execute(arg)
-        # Accept string literal for backward compatibility
-        name = unwrap_string_literal(arg)
-        require 'rdoc/ri/driver'
-
-        unless ShowDoc.const_defined?(:Ri)
-          opts = RDoc::RI::Driver.process_args([])
-          ShowDoc.const_set(:Ri, RDoc::RI::Driver.new(opts))
-        end
-
-        if name.nil?
-          Ri.interactive
-        else
-          begin
-            Ri.display_name(name)
-          rescue RDoc::RI::Error
-            puts $!.message
-          end
-        end
-
-        nil
-      rescue LoadError, SystemExit
-        warn "Can't display document because `rdoc` is not installed."
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/show_source.rb b/lib/irb/command/show_source.rb
deleted file mode 100644
index f4c6f104a2..0000000000
--- a/lib/irb/command/show_source.rb
+++ /dev/null
@@ -1,74 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "../source_finder"
-require_relative "../pager"
-require_relative "../color"
-
-module IRB
-  module Command
-    class ShowSource < Base
-      include RubyArgsExtractor
-
-      category "Context"
-      description "Show the source code of a given method, class/module, or constant."
-
-      help_message <<~HELP_MESSAGE
-        Usage: show_source [target] [-s]
-
-          -s  Show the super method. You can stack it like `-ss` to show the super of the super, etc.
-
-        Examples:
-
-          show_source Foo
-          show_source Foo#bar
-          show_source Foo#bar -s
-          show_source Foo.baz
-          show_source Foo::BAR
-      HELP_MESSAGE
-
-      def execute(arg)
-        # Accept string literal for backward compatibility
-        str = unwrap_string_literal(arg)
-        unless str.is_a?(String)
-          puts "Error: Expected a string but got #{str.inspect}"
-          return
-        end
-
-        str, esses = str.split(" -")
-        super_level = esses ? esses.count("s") : 0
-        source = SourceFinder.new(@irb_context).find_source(str, super_level)
-
-        if source
-          show_source(source)
-        elsif super_level > 0
-          puts "Error: Couldn't locate a super definition for #{str}"
-        else
-          puts "Error: Couldn't locate a definition for #{str}"
-        end
-        nil
-      end
-
-      private
-
-      def show_source(source)
-        if source.binary_file?
-          content = "\n#{bold('Defined in binary file')}: #{source.file}\n\n"
-        else
-          code = source.colorized_content || 'Source not available'
-          content = <<~CONTENT
-
-            #{bold("From")}: #{source.file}:#{source.line}
-
-            #{code.chomp}
-
-          CONTENT
-        end
-        Pager.page_content(content)
-      end
-
-      def bold(str)
-        Color.colorize(str, [:BOLD])
-      end
-    end
-  end
-end
diff --git a/lib/irb/command/step.rb b/lib/irb/command/step.rb
deleted file mode 100644
index 29e5e35ac0..0000000000
--- a/lib/irb/command/step.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "debug"
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Step < DebugCommand
-      def execute(arg)
-        execute_debug_command(do_cmds: "step #{arg}")
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/subirb.rb b/lib/irb/command/subirb.rb
deleted file mode 100644
index 85af28c1a5..0000000000
--- a/lib/irb/command/subirb.rb
+++ /dev/null
@@ -1,123 +0,0 @@
-# frozen_string_literal: true
-#
-#   multi.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class MultiIRBCommand < Base
-      include RubyArgsExtractor
-
-      private
-
-      def print_deprecated_warning
-        warn <<~MSG
-          Multi-irb commands are deprecated and will be removed in IRB 2.0.0. Please use workspace commands instead.
-          If you have any use case for multi-irb, please leave a comment at https://github.com/ruby/irb/issues/653
-        MSG
-      end
-
-      def extend_irb_context
-        # this extension patches IRB context like IRB.CurrentContext
-        require_relative "../ext/multi-irb"
-      end
-
-      def print_debugger_warning
-        warn "Multi-IRB commands are not available when the debugger is enabled."
-      end
-    end
-
-    class IrbCommand < MultiIRBCommand
-      category "Multi-irb (DEPRECATED)"
-      description "Start a child IRB."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(*obj)
-        print_deprecated_warning
-
-        if irb_context.with_debugger
-          print_debugger_warning
-          return
-        end
-
-        extend_irb_context
-        IRB.irb(nil, *obj)
-        puts IRB.JobManager.inspect
-      end
-    end
-
-    class Jobs < MultiIRBCommand
-      category "Multi-irb (DEPRECATED)"
-      description "List of current sessions."
-
-      def execute(_arg)
-        print_deprecated_warning
-
-        if irb_context.with_debugger
-          print_debugger_warning
-          return
-        end
-
-        extend_irb_context
-        puts IRB.JobManager.inspect
-      end
-    end
-
-    class Foreground < MultiIRBCommand
-      category "Multi-irb (DEPRECATED)"
-      description "Switches to the session of the given number."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(key = nil)
-        print_deprecated_warning
-
-        if irb_context.with_debugger
-          print_debugger_warning
-          return
-        end
-
-        extend_irb_context
-
-        raise CommandArgumentError.new("Please specify the id of target IRB job (listed in the `jobs` command).") unless key
-        IRB.JobManager.switch(key)
-        puts IRB.JobManager.inspect
-      end
-    end
-
-    class Kill < MultiIRBCommand
-      category "Multi-irb (DEPRECATED)"
-      description "Kills the session with the given number."
-
-      def execute(arg)
-        args, kwargs = ruby_args(arg)
-        execute_internal(*args, **kwargs)
-      end
-
-      def execute_internal(*keys)
-        print_deprecated_warning
-
-        if irb_context.with_debugger
-          print_debugger_warning
-          return
-        end
-
-        extend_irb_context
-        IRB.JobManager.kill(*keys)
-        puts IRB.JobManager.inspect
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/command/whereami.rb b/lib/irb/command/whereami.rb
deleted file mode 100644
index c8439f1212..0000000000
--- a/lib/irb/command/whereami.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # :stopdoc:
-
-  module Command
-    class Whereami < Base
-      category "Context"
-      description "Show the source code around binding.irb again."
-
-      def execute(_arg)
-        code = irb_context.workspace.code_around_binding
-        if code
-          puts code
-        else
-          puts "The current context doesn't have code."
-        end
-      end
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/completion.rb b/lib/irb/completion.rb
deleted file mode 100644
index a3d89373c3..0000000000
--- a/lib/irb/completion.rb
+++ /dev/null
@@ -1,477 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/completion.rb -
-#   	by Keiju ISHITSUKA(keiju@ishitsuka.com)
-#       From Original Idea of shugo@ruby-lang.org
-#
-
-require_relative 'ruby-lex'
-
-module IRB
-  class BaseCompletor # :nodoc:
-
-    # Set of reserved words used by Ruby, you should not use these for
-    # constants or variables
-    ReservedWords = %w[
-      __ENCODING__ __LINE__ __FILE__
-      BEGIN END
-      alias and
-      begin break
-      case class
-      def defined? do
-      else elsif end ensure
-      false for
-      if in
-      module
-      next nil not
-      or
-      redo rescue retry return
-      self super
-      then true
-      undef unless until
-      when while
-      yield
-    ]
-
-    def completion_candidates(preposing, target, postposing, bind:)
-      raise NotImplementedError
-    end
-
-    def doc_namespace(preposing, matched, postposing, bind:)
-      raise NotImplementedError
-    end
-
-    GEM_PATHS =
-      if defined?(Gem::Specification)
-        Gem::Specification.latest_specs(true).map { |s|
-          s.require_paths.map { |p|
-            if File.absolute_path?(p)
-              p
-            else
-              File.join(s.full_gem_path, p)
-            end
-          }
-        }.flatten
-      else
-        []
-      end.freeze
-
-    def retrieve_gem_and_system_load_path
-      candidates = (GEM_PATHS | $LOAD_PATH)
-      candidates.map do |p|
-        if p.respond_to?(:to_path)
-          p.to_path
-        else
-          String(p) rescue nil
-        end
-      end.compact.sort
-    end
-
-    def retrieve_files_to_require_from_load_path
-      @files_from_load_path ||=
-        (
-          shortest = []
-          rest = retrieve_gem_and_system_load_path.each_with_object([]) { |path, result|
-            begin
-              names = Dir.glob("**/*.{rb,#{RbConfig::CONFIG['DLEXT']}}", base: path)
-            rescue Errno::ENOENT
-              nil
-            end
-            next if names.empty?
-            names.map! { |n| n.sub(/\.(rb|#{RbConfig::CONFIG['DLEXT']})\z/, '') }.sort!
-            shortest << names.shift
-            result.concat(names)
-          }
-          shortest.sort! | rest
-        )
-    end
-
-    def command_completions(preposing, target)
-      if preposing.empty? && !target.empty?
-        IRB::Command.command_names.select { _1.start_with?(target) }
-      else
-        []
-      end
-    end
-
-    def retrieve_files_to_require_relative_from_current_dir
-      @files_from_current_dir ||= Dir.glob("**/*.{rb,#{RbConfig::CONFIG['DLEXT']}}", base: '.').map { |path|
-        path.sub(/\.(rb|#{RbConfig::CONFIG['DLEXT']})\z/, '')
-      }
-    end
-  end
-
-  class TypeCompletor < BaseCompletor # :nodoc:
-    def initialize(context)
-      @context = context
-    end
-
-    def inspect
-      ReplTypeCompletor.info
-    end
-
-    def completion_candidates(preposing, target, _postposing, bind:)
-      commands = command_completions(preposing, target)
-      result = ReplTypeCompletor.analyze(preposing + target, binding: bind, filename: @context.irb_path)
-      return commands unless result
-
-      commands | result.completion_candidates.map { target + _1 }
-    end
-
-    def doc_namespace(preposing, matched, _postposing, bind:)
-      result = ReplTypeCompletor.analyze(preposing + matched, binding: bind, filename: @context.irb_path)
-      result&.doc_namespace('')
-    end
-  end
-
-  class RegexpCompletor < BaseCompletor # :nodoc:
-    using Module.new {
-      refine ::Binding do
-        def eval_methods
-          ::Kernel.instance_method(:methods).bind(eval("self")).call
-        end
-
-        def eval_private_methods
-          ::Kernel.instance_method(:private_methods).bind(eval("self")).call
-        end
-
-        def eval_instance_variables
-          ::Kernel.instance_method(:instance_variables).bind(eval("self")).call
-        end
-
-        def eval_global_variables
-          ::Kernel.instance_method(:global_variables).bind(eval("self")).call
-        end
-
-        def eval_class_constants
-          ::Module.instance_method(:constants).bind(eval("self.class")).call
-        end
-      end
-    }
-
-    def inspect
-      'RegexpCompletor'
-    end
-
-    def complete_require_path(target, preposing, postposing)
-      if target =~ /\A(['"])([^'"]+)\Z/
-        quote = $1
-        actual_target = $2
-      else
-        return nil # It's not String literal
-      end
-      tokens = RubyLex.ripper_lex_without_warning(preposing.gsub(/\s*\z/, ''))
-      tok = nil
-      tokens.reverse_each do |t|
-        unless [:on_lparen, :on_sp, :on_ignored_sp, :on_nl, :on_ignored_nl, :on_comment].include?(t.event)
-          tok = t
-          break
-        end
-      end
-      return unless tok&.event == :on_ident && tok.state == Ripper::EXPR_CMDARG
-
-      case tok.tok
-      when 'require'
-        retrieve_files_to_require_from_load_path.select { |path|
-          path.start_with?(actual_target)
-        }.map { |path|
-          quote + path
-        }
-      when 'require_relative'
-        retrieve_files_to_require_relative_from_current_dir.select { |path|
-          path.start_with?(actual_target)
-        }.map { |path|
-          quote + path
-        }
-      end
-    end
-
-    def completion_candidates(preposing, target, postposing, bind:)
-      if preposing && postposing
-        result = complete_require_path(target, preposing, postposing)
-        return result if result
-      end
-      commands = command_completions(preposing || '', target)
-      commands | retrieve_completion_data(target, bind: bind, doc_namespace: false).compact.map{ |i| i.encode(Encoding.default_external) }
-    end
-
-    def doc_namespace(_preposing, matched, _postposing, bind:)
-      retrieve_completion_data(matched, bind: bind, doc_namespace: true)
-    end
-
-    def retrieve_completion_data(input, bind:, doc_namespace:)
-      case input
-      # this regexp only matches the closing character because of irb's Reline.completer_quote_characters setting
-      # details are described in: https://github.com/ruby/irb/pull/523
-      when /^(.*["'`])\.([^.]*)$/
-        # String
-        receiver = $1
-        message = $2
-
-        if doc_namespace
-          "String.#{message}"
-        else
-          candidates = String.instance_methods.collect{|m| m.to_s}
-          select_message(receiver, message, candidates)
-        end
-
-      # this regexp only matches the closing character because of irb's Reline.completer_quote_characters setting
-      # details are described in: https://github.com/ruby/irb/pull/523
-      when /^(.*\/)\.([^.]*)$/
-        # Regexp
-        receiver = $1
-        message = $2
-
-        if doc_namespace
-          "Regexp.#{message}"
-        else
-          candidates = Regexp.instance_methods.collect{|m| m.to_s}
-          select_message(receiver, message, candidates)
-        end
-
-      when /^([^\]]*\])\.([^.]*)$/
-        # Array
-        receiver = $1
-        message = $2
-
-        if doc_namespace
-          "Array.#{message}"
-        else
-          candidates = Array.instance_methods.collect{|m| m.to_s}
-          select_message(receiver, message, candidates)
-        end
-
-      when /^([^\}]*\})\.([^.]*)$/
-        # Hash or Proc
-        receiver = $1
-        message = $2
-
-        if doc_namespace
-          ["Hash.#{message}", "Proc.#{message}"]
-        else
-          hash_candidates = Hash.instance_methods.collect{|m| m.to_s}
-          proc_candidates = Proc.instance_methods.collect{|m| m.to_s}
-          select_message(receiver, message, hash_candidates | proc_candidates)
-        end
-
-      when /^(:[^:.]+)$/
-        # Symbol
-        if doc_namespace
-          nil
-        else
-          sym = $1
-          candidates = Symbol.all_symbols.collect do |s|
-            s.inspect
-          rescue EncodingError
-            # ignore
-          end
-          candidates.grep(/^#{Regexp.quote(sym)}/)
-        end
-      when /^::([A-Z][^:\.\(\)]*)$/
-        # Absolute Constant or class methods
-        receiver = $1
-
-        candidates = Object.constants.collect{|m| m.to_s}
-
-        if doc_namespace
-          candidates.find { |i| i == receiver }
-        else
-          candidates.grep(/^#{Regexp.quote(receiver)}/).collect{|e| "::" + e}
-        end
-
-      when /^([A-Z].*)::([^:.]*)$/
-        # Constant or class methods
-        receiver = $1
-        message = $2
-
-        if doc_namespace
-          "#{receiver}::#{message}"
-        else
-          begin
-            candidates = eval("#{receiver}.constants.collect{|m| m.to_s}", bind)
-            candidates |= eval("#{receiver}.methods.collect{|m| m.to_s}", bind)
-          rescue Exception
-            candidates = []
-          end
-
-          select_message(receiver, message, candidates.sort, "::")
-        end
-
-      when /^(:[^:.]+)(\.|::)([^.]*)$/
-        # Symbol
-        receiver = $1
-        sep = $2
-        message = $3
-
-        if doc_namespace
-          "Symbol.#{message}"
-        else
-          candidates = Symbol.instance_methods.collect{|m| m.to_s}
-          select_message(receiver, message, candidates, sep)
-        end
-
-      when /^(?<num>-?(?:0[dbo])?[0-9_]+(?:\.[0-9_]+)?(?:(?:[eE][+-]?[0-9]+)?i?|r)?)(?<sep>\.|::)(?<mes>[^.]*)$/
-        # Numeric
-        receiver = $~[:num]
-        sep = $~[:sep]
-        message = $~[:mes]
-
-        begin
-          instance = eval(receiver, bind)
-
-          if doc_namespace
-            "#{instance.class.name}.#{message}"
-          else
-            candidates = instance.methods.collect{|m| m.to_s}
-            select_message(receiver, message, candidates, sep)
-          end
-        rescue Exception
-          if doc_namespace
-            nil
-          else
-            []
-          end
-        end
-
-      when /^(-?0x[0-9a-fA-F_]+)(\.|::)([^.]*)$/
-        # Numeric(0xFFFF)
-        receiver = $1
-        sep = $2
-        message = $3
-
-        begin
-          instance = eval(receiver, bind)
-          if doc_namespace
-            "#{instance.class.name}.#{message}"
-          else
-            candidates = instance.methods.collect{|m| m.to_s}
-            select_message(receiver, message, candidates, sep)
-          end
-        rescue Exception
-          if doc_namespace
-            nil
-          else
-            []
-          end
-        end
-
-      when /^(\$[^.]*)$/
-        # global var
-        gvar = $1
-        all_gvars = global_variables.collect{|m| m.to_s}
-
-        if doc_namespace
-          all_gvars.find{ |i| i == gvar }
-        else
-          all_gvars.grep(Regexp.new(Regexp.quote(gvar)))
-        end
-
-      when /^([^.:"].*)(\.|::)([^.]*)$/
-        # variable.func or func.func
-        receiver = $1
-        sep = $2
-        message = $3
-
-        gv = bind.eval_global_variables.collect{|m| m.to_s}.push("true", "false", "nil")
-        lv = bind.local_variables.collect{|m| m.to_s}
-        iv = bind.eval_instance_variables.collect{|m| m.to_s}
-        cv = bind.eval_class_constants.collect{|m| m.to_s}
-
-        if (gv | lv | iv | cv).include?(receiver) or /^[A-Z]/ =~ receiver && /\./ !~ receiver
-          # foo.func and foo is var. OR
-          # foo::func and foo is var. OR
-          # foo::Const and foo is var. OR
-          # Foo::Bar.func
-          begin
-            candidates = []
-            rec = eval(receiver, bind)
-            if sep == "::" and rec.kind_of?(Module)
-              candidates = rec.constants.collect{|m| m.to_s}
-            end
-            candidates |= rec.methods.collect{|m| m.to_s}
-          rescue Exception
-            candidates = []
-          end
-        else
-          # func1.func2
-          candidates = []
-        end
-
-        if doc_namespace
-          rec_class = rec.is_a?(Module) ? rec : rec.class
-          "#{rec_class.name}#{sep}#{candidates.find{ |i| i == message }}" rescue nil
-        else
-          select_message(receiver, message, candidates, sep)
-        end
-
-      when /^\.([^.]*)$/
-        # unknown(maybe String)
-
-        receiver = ""
-        message = $1
-
-        candidates = String.instance_methods(true).collect{|m| m.to_s}
-
-        if doc_namespace
-          "String.#{candidates.find{ |i| i == message }}"
-        else
-          select_message(receiver, message, candidates.sort)
-        end
-      when /^\s*$/
-        # empty input
-        if doc_namespace
-          nil
-        else
-          []
-        end
-      else
-        if doc_namespace
-          vars = (bind.local_variables | bind.eval_instance_variables).collect{|m| m.to_s}
-          perfect_match_var = vars.find{|m| m.to_s == input}
-          if perfect_match_var
-            eval("#{perfect_match_var}.class.name", bind) rescue nil
-          else
-            candidates = (bind.eval_methods | bind.eval_private_methods | bind.local_variables | bind.eval_instance_variables | bind.eval_class_constants).collect{|m| m.to_s}
-            candidates |= ReservedWords
-            candidates.find{ |i| i == input }
-          end
-        else
-          candidates = (bind.eval_methods | bind.eval_private_methods | bind.local_variables | bind.eval_instance_variables | bind.eval_class_constants).collect{|m| m.to_s}
-          candidates |= ReservedWords
-          candidates.grep(/^#{Regexp.quote(input)}/).sort
-        end
-      end
-    end
-
-    # Set of available operators in Ruby
-    Operators = %w[% & * ** + - / < << <= <=> == === =~ > >= >> [] []= ^ ! != !~]
-
-    def select_message(receiver, message, candidates, sep = ".")
-      candidates.grep(/^#{Regexp.quote(message)}/).collect do |e|
-        case e
-        when /^[a-zA-Z_]/
-          receiver + sep + e
-        when /^[0-9]/
-        when *Operators
-          #receiver + " " + e
-        end
-      end
-    end
-  end
-
-  module InputCompletor
-    class << self
-      private def regexp_completor
-        @regexp_completor ||= RegexpCompletor.new
-      end
-
-      def retrieve_completion_data(input, bind: IRB.conf[:MAIN_CONTEXT].workspace.binding, doc_namespace: false)
-        regexp_completor.retrieve_completion_data(input, bind: bind, doc_namespace: doc_namespace)
-      end
-    end
-    CompletionProc = ->(target, preposing = nil, postposing = nil) {
-      regexp_completor.completion_candidates(preposing, target, postposing, bind: IRB.conf[:MAIN_CONTEXT].workspace.binding)
-    }
-  end
-  deprecate_constant :InputCompletor
-end
diff --git a/lib/irb/context.rb b/lib/irb/context.rb
deleted file mode 100644
index aafce7aade..0000000000
--- a/lib/irb/context.rb
+++ /dev/null
@@ -1,674 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/context.rb - irb context
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative "workspace"
-require_relative "inspector"
-require_relative "input-method"
-require_relative "output-method"
-
-module IRB
-  # A class that wraps the current state of the irb session, including the
-  # configuration of IRB.conf.
-  class Context
-    # Creates a new IRB context.
-    #
-    # The optional +input_method+ argument:
-    #
-    # +nil+::     uses stdin or Reline or Readline
-    # +String+::  uses a File
-    # +other+::   uses this as InputMethod
-    def initialize(irb, workspace = nil, input_method = nil)
-      @irb = irb
-      @workspace_stack = []
-      if workspace
-        @workspace_stack << workspace
-      else
-        @workspace_stack << WorkSpace.new
-      end
-      @thread = Thread.current
-
-      # copy of default configuration
-      @ap_name = IRB.conf[:AP_NAME]
-      @rc = IRB.conf[:RC]
-      @load_modules = IRB.conf[:LOAD_MODULES]
-
-      if IRB.conf.has_key?(:USE_SINGLELINE)
-        @use_singleline = IRB.conf[:USE_SINGLELINE]
-      elsif IRB.conf.has_key?(:USE_READLINE) # backward compatibility
-        @use_singleline = IRB.conf[:USE_READLINE]
-      else
-        @use_singleline = nil
-      end
-      if IRB.conf.has_key?(:USE_MULTILINE)
-        @use_multiline = IRB.conf[:USE_MULTILINE]
-      elsif IRB.conf.has_key?(:USE_RELINE) # backward compatibility
-        warn <<~MSG.strip
-          USE_RELINE is deprecated, please use USE_MULTILINE instead.
-        MSG
-        @use_multiline = IRB.conf[:USE_RELINE]
-      elsif IRB.conf.has_key?(:USE_REIDLINE)
-        warn <<~MSG.strip
-          USE_REIDLINE is deprecated, please use USE_MULTILINE instead.
-        MSG
-        @use_multiline = IRB.conf[:USE_REIDLINE]
-      else
-        @use_multiline = nil
-      end
-      @use_autocomplete = IRB.conf[:USE_AUTOCOMPLETE]
-      @verbose = IRB.conf[:VERBOSE]
-      @io = nil
-
-      self.inspect_mode = IRB.conf[:INSPECT_MODE]
-      self.use_tracer = IRB.conf[:USE_TRACER]
-      self.use_loader = IRB.conf[:USE_LOADER] if IRB.conf[:USE_LOADER]
-      self.eval_history = IRB.conf[:EVAL_HISTORY] if IRB.conf[:EVAL_HISTORY]
-
-      @ignore_sigint = IRB.conf[:IGNORE_SIGINT]
-      @ignore_eof = IRB.conf[:IGNORE_EOF]
-
-      @back_trace_limit = IRB.conf[:BACK_TRACE_LIMIT]
-
-      self.prompt_mode = IRB.conf[:PROMPT_MODE]
-
-      @irb_name = IRB.conf[:IRB_NAME]
-
-      unless IRB.conf[:SINGLE_IRB] or !defined?(IRB::JobManager)
-        @irb_name = @irb_name + "#" + IRB.JobManager.n_jobs.to_s
-      end
-
-      self.irb_path = "(" + @irb_name + ")"
-
-      case input_method
-      when nil
-        @io = nil
-        case use_multiline?
-        when nil
-          if term_interactive? && IRB.conf[:PROMPT_MODE] != :INF_RUBY && !use_singleline?
-            # Both of multiline mode and singleline mode aren't specified.
-            @io = RelineInputMethod.new(build_completor)
-          else
-            @io = nil
-          end
-        when false
-          @io = nil
-        when true
-          @io = RelineInputMethod.new(build_completor)
-        end
-        unless @io
-          case use_singleline?
-          when nil
-            if (defined?(ReadlineInputMethod) && term_interactive? &&
-                IRB.conf[:PROMPT_MODE] != :INF_RUBY)
-              @io = ReadlineInputMethod.new
-            else
-              @io = nil
-            end
-          when false
-            @io = nil
-          when true
-            if defined?(ReadlineInputMethod)
-              @io = ReadlineInputMethod.new
-            else
-              @io = nil
-            end
-          else
-            @io = nil
-          end
-        end
-        @io = StdioInputMethod.new unless @io
-
-      when '-'
-        @io = FileInputMethod.new($stdin)
-        @irb_name = '-'
-        self.irb_path = '-'
-      when String
-        @io = FileInputMethod.new(input_method)
-        @irb_name = File.basename(input_method)
-        self.irb_path = input_method
-      else
-        @io = input_method
-      end
-      @extra_doc_dirs = IRB.conf[:EXTRA_DOC_DIRS]
-
-      @echo = IRB.conf[:ECHO]
-      if @echo.nil?
-        @echo = true
-      end
-
-      @echo_on_assignment = IRB.conf[:ECHO_ON_ASSIGNMENT]
-      if @echo_on_assignment.nil?
-        @echo_on_assignment = :truncate
-      end
-
-      @newline_before_multiline_output = IRB.conf[:NEWLINE_BEFORE_MULTILINE_OUTPUT]
-      if @newline_before_multiline_output.nil?
-        @newline_before_multiline_output = true
-      end
-
-      @user_aliases = IRB.conf[:COMMAND_ALIASES].dup
-      @command_aliases = @user_aliases.merge(KEYWORD_ALIASES)
-    end
-
-    private def term_interactive?
-      return true if ENV['TEST_IRB_FORCE_INTERACTIVE']
-      STDIN.tty? && ENV['TERM'] != 'dumb'
-    end
-
-    # because all input will eventually be evaluated as Ruby code,
-    # command names that conflict with Ruby keywords need special workaround
-    # we can remove them once we implemented a better command system for IRB
-    KEYWORD_ALIASES = {
-      :break => :irb_break,
-      :catch => :irb_catch,
-      :next => :irb_next,
-    }.freeze
-
-    private_constant :KEYWORD_ALIASES
-
-    def use_tracer=(val)
-      require_relative "ext/tracer" if val
-      IRB.conf[:USE_TRACER] = val
-    end
-
-    def eval_history=(val)
-      self.class.remove_method(__method__)
-      require_relative "ext/eval_history"
-      __send__(__method__, val)
-    end
-
-    def use_loader=(val)
-      self.class.remove_method(__method__)
-      require_relative "ext/use-loader"
-      __send__(__method__, val)
-    end
-
-    private def build_completor
-      completor_type = IRB.conf[:COMPLETOR]
-      case completor_type
-      when :regexp
-        return RegexpCompletor.new
-      when :type
-        completor = build_type_completor
-        return completor if completor
-      else
-        warn "Invalid value for IRB.conf[:COMPLETOR]: #{completor_type}"
-      end
-      # Fallback to RegexpCompletor
-      RegexpCompletor.new
-    end
-
-    private def build_type_completor
-      if RUBY_ENGINE == 'truffleruby'
-        # Avoid SyntaxError. truffleruby does not support endless method definition yet.
-        warn 'TypeCompletor is not supported on TruffleRuby yet'
-        return
-      end
-
-      begin
-        require 'repl_type_completor'
-      rescue LoadError => e
-        warn "TypeCompletor requires `gem repl_type_completor`: #{e.message}"
-        return
-      end
-
-      ReplTypeCompletor.preload_rbs
-      TypeCompletor.new(self)
-    end
-
-    def save_history=(val)
-      IRB.conf[:SAVE_HISTORY] = val
-    end
-
-    def save_history
-      IRB.conf[:SAVE_HISTORY]
-    end
-
-    # A copy of the default <code>IRB.conf[:HISTORY_FILE]</code>
-    def history_file
-      IRB.conf[:HISTORY_FILE]
-    end
-
-    # Set <code>IRB.conf[:HISTORY_FILE]</code> to the given +hist+.
-    def history_file=(hist)
-      IRB.conf[:HISTORY_FILE] = hist
-    end
-
-    # Workspace in the current context.
-    def workspace
-      @workspace_stack.last
-    end
-
-    # Replace the current workspace with the given +workspace+.
-    def replace_workspace(workspace)
-      @workspace_stack.pop
-      @workspace_stack.push(workspace)
-    end
-
-    # The top-level workspace, see WorkSpace#main
-    def main
-      workspace.main
-    end
-
-    # The toplevel workspace, see #home_workspace
-    attr_reader :workspace_home
-    # The current thread in this context.
-    attr_reader :thread
-    # The current input method.
-    #
-    # Can be either StdioInputMethod, ReadlineInputMethod,
-    # RelineInputMethod, FileInputMethod or other specified when the
-    # context is created. See ::new for more # information on +input_method+.
-    attr_accessor :io
-
-    # Current irb session.
-    attr_accessor :irb
-    # A copy of the default <code>IRB.conf[:AP_NAME]</code>
-    attr_accessor :ap_name
-    # A copy of the default <code>IRB.conf[:RC]</code>
-    attr_accessor :rc
-    # A copy of the default <code>IRB.conf[:LOAD_MODULES]</code>
-    attr_accessor :load_modules
-    # Can be either name from <code>IRB.conf[:IRB_NAME]</code>, or the number of
-    # the current job set by JobManager, such as <code>irb#2</code>
-    attr_accessor :irb_name
-
-    # Can be one of the following:
-    # - the #irb_name surrounded by parenthesis
-    # - the +input_method+ passed to Context.new
-    # - the file path of the current IRB context in a binding.irb session
-    attr_reader :irb_path
-
-    # Sets @irb_path to the given +path+ as well as @eval_path
-    # @eval_path is used for evaluating code in the context of IRB session
-    # It's the same as irb_path, but with the IRB name postfix
-    # This makes sure users can distinguish the methods defined in the IRB session
-    # from the methods defined in the current file's context, especially with binding.irb
-    def irb_path=(path)
-      @irb_path = path
-
-      if File.exist?(path)
-        @eval_path = "#{path}(#{IRB.conf[:IRB_NAME]})"
-      else
-        @eval_path = path
-      end
-    end
-
-    # Whether multiline editor mode is enabled or not.
-    #
-    # A copy of the default <code>IRB.conf[:USE_MULTILINE]</code>
-    attr_reader :use_multiline
-    # Whether singleline editor mode is enabled or not.
-    #
-    # A copy of the default <code>IRB.conf[:USE_SINGLELINE]</code>
-    attr_reader :use_singleline
-    # Whether colorization is enabled or not.
-    #
-    # A copy of the default <code>IRB.conf[:USE_AUTOCOMPLETE]</code>
-    attr_reader :use_autocomplete
-    # A copy of the default <code>IRB.conf[:INSPECT_MODE]</code>
-    attr_reader :inspect_mode
-
-    # A copy of the default <code>IRB.conf[:PROMPT_MODE]</code>
-    attr_reader :prompt_mode
-    # Standard IRB prompt.
-    #
-    # See {Custom Prompts}[rdoc-ref:IRB@Custom+Prompts] for more information.
-    attr_accessor :prompt_i
-    # IRB prompt for continuated strings.
-    #
-    # See {Custom Prompts}[rdoc-ref:IRB@Custom+Prompts] for more information.
-    attr_accessor :prompt_s
-    # IRB prompt for continuated statement. (e.g. immediately after an +if+)
-    #
-    # See {Custom Prompts}[rdoc-ref:IRB@Custom+Prompts] for more information.
-    attr_accessor :prompt_c
-
-    # TODO: Remove this when developing v2.0
-    def prompt_n
-      warn "IRB::Context#prompt_n is deprecated and will be removed in the next major release."
-      ""
-    end
-
-    # TODO: Remove this when developing v2.0
-    def prompt_n=(_)
-      warn "IRB::Context#prompt_n= is deprecated and will be removed in the next major release."
-      ""
-    end
-
-    # Can be either the default <code>IRB.conf[:AUTO_INDENT]</code>, or the
-    # mode set by #prompt_mode=
-    #
-    # To disable auto-indentation in irb:
-    #
-    #     IRB.conf[:AUTO_INDENT] = false
-    #
-    # or
-    #
-    #     irb_context.auto_indent_mode = false
-    #
-    # or
-    #
-    #     IRB.CurrentContext.auto_indent_mode = false
-    #
-    # See IRB@Configuration for more information.
-    attr_accessor :auto_indent_mode
-    # The format of the return statement, set by #prompt_mode= using the
-    # +:RETURN+ of the +mode+ passed to set the current #prompt_mode.
-    attr_accessor :return_format
-
-    # Whether <code>^C</code> (+control-c+) will be ignored or not.
-    #
-    # If set to +false+, <code>^C</code> will quit irb.
-    #
-    # If set to +true+,
-    #
-    # * during input:   cancel input then return to top level.
-    # * during execute: abandon current execution.
-    attr_accessor :ignore_sigint
-    # Whether <code>^D</code> (+control-d+) will be ignored or not.
-    #
-    # If set to +false+, <code>^D</code> will quit irb.
-    attr_accessor :ignore_eof
-    # Specify the installation locations of the ri file to be displayed in the
-    # document dialog.
-    attr_accessor :extra_doc_dirs
-    # Whether to echo the return value to output or not.
-    #
-    # Uses <code>IRB.conf[:ECHO]</code> if available, or defaults to +true+.
-    #
-    #     puts "hello"
-    #     # hello
-    #     #=> nil
-    #     IRB.CurrentContext.echo = false
-    #     puts "omg"
-    #     # omg
-    attr_accessor :echo
-    # Whether to echo for assignment expressions.
-    #
-    # If set to +false+, the value of assignment will not be shown.
-    #
-    # If set to +true+, the value of assignment will be shown.
-    #
-    # If set to +:truncate+, the value of assignment will be shown and truncated.
-    #
-    # It defaults to +:truncate+.
-    #
-    #     a = "omg"
-    #     #=> omg
-    #
-    #     a = "omg" * 10
-    #     #=> omgomgomgomgomgomgomg...
-    #
-    #     IRB.CurrentContext.echo_on_assignment = false
-    #     a = "omg"
-    #
-    #     IRB.CurrentContext.echo_on_assignment = true
-    #     a = "omg" * 10
-    #     #=> omgomgomgomgomgomgomgomgomgomg
-    #
-    # To set the behaviour of showing on assignment in irb:
-    #
-    #     IRB.conf[:ECHO_ON_ASSIGNMENT] = :truncate or true or false
-    #
-    # or
-    #
-    #     irb_context.echo_on_assignment = :truncate or true or false
-    #
-    # or
-    #
-    #     IRB.CurrentContext.echo_on_assignment = :truncate or true or false
-    attr_accessor :echo_on_assignment
-    # Whether a newline is put before multiline output.
-    #
-    # Uses <code>IRB.conf[:NEWLINE_BEFORE_MULTILINE_OUTPUT]</code> if available,
-    # or defaults to +true+.
-    #
-    #     "abc\ndef"
-    #     #=>
-    #     abc
-    #     def
-    #     IRB.CurrentContext.newline_before_multiline_output = false
-    #     "abc\ndef"
-    #     #=> abc
-    #     def
-    attr_accessor :newline_before_multiline_output
-    # Whether verbose messages are displayed or not.
-    #
-    # A copy of the default <code>IRB.conf[:VERBOSE]</code>
-    attr_accessor :verbose
-
-    # The limit of backtrace lines displayed as top +n+ and tail +n+.
-    #
-    # The default value is 16.
-    #
-    # Can also be set using the +--back-trace-limit+ command line option.
-    attr_accessor :back_trace_limit
-
-    # User-defined IRB command aliases
-    attr_accessor :command_aliases
-
-    attr_accessor :with_debugger
-
-    # Alias for #use_multiline
-    alias use_multiline? use_multiline
-    # Alias for #use_singleline
-    alias use_singleline? use_singleline
-    # backward compatibility
-    alias use_reline use_multiline
-    # backward compatibility
-    alias use_reline? use_multiline
-    # backward compatibility
-    alias use_readline use_singleline
-    # backward compatibility
-    alias use_readline? use_singleline
-    # Alias for #use_autocomplete
-    alias use_autocomplete? use_autocomplete
-    # Alias for #rc
-    alias rc? rc
-    alias ignore_sigint? ignore_sigint
-    alias ignore_eof? ignore_eof
-    alias echo? echo
-    alias echo_on_assignment? echo_on_assignment
-    alias newline_before_multiline_output? newline_before_multiline_output
-
-    # Returns whether messages are displayed or not.
-    def verbose?
-      if @verbose.nil?
-        if @io.kind_of?(RelineInputMethod)
-          false
-        elsif defined?(ReadlineInputMethod) && @io.kind_of?(ReadlineInputMethod)
-          false
-        elsif !STDIN.tty? or @io.kind_of?(FileInputMethod)
-          true
-        else
-          false
-        end
-      else
-        @verbose
-      end
-    end
-
-    # Whether #verbose? is +true+, and +input_method+ is either
-    # StdioInputMethod or RelineInputMethod or ReadlineInputMethod, see #io
-    # for more information.
-    def prompting?
-      verbose? || @io.prompting?
-    end
-
-    # The return value of the last statement evaluated.
-    attr_reader :last_value
-
-    # Sets the return value from the last statement evaluated in this context
-    # to #last_value.
-    def set_last_value(value)
-      @last_value = value
-      workspace.local_variable_set :_, value
-    end
-
-    # Sets the +mode+ of the prompt in this context.
-    #
-    # See {Custom Prompts}[rdoc-ref:IRB@Custom+Prompts] for more information.
-    def prompt_mode=(mode)
-      @prompt_mode = mode
-      pconf = IRB.conf[:PROMPT][mode]
-      @prompt_i = pconf[:PROMPT_I]
-      @prompt_s = pconf[:PROMPT_S]
-      @prompt_c = pconf[:PROMPT_C]
-      @return_format = pconf[:RETURN]
-      @return_format = "%s\n" if @return_format == nil
-      if ai = pconf.include?(:AUTO_INDENT)
-        @auto_indent_mode = ai
-      else
-        @auto_indent_mode = IRB.conf[:AUTO_INDENT]
-      end
-    end
-
-    # Whether #inspect_mode is set or not, see #inspect_mode= for more detail.
-    def inspect?
-      @inspect_mode.nil? or @inspect_mode
-    end
-
-    # Whether #io uses a File for the +input_method+ passed when creating the
-    # current context, see ::new
-    def file_input?
-      @io.class == FileInputMethod
-    end
-
-    # Specifies the inspect mode with +opt+:
-    #
-    # +true+::  display +inspect+
-    # +false+:: display +to_s+
-    # +nil+::   inspect mode in non-math mode,
-    #           non-inspect mode in math mode
-    #
-    # See IRB::Inspector for more information.
-    #
-    # Can also be set using the +--inspect+ and +--noinspect+ command line
-    # options.
-    def inspect_mode=(opt)
-
-      if i = Inspector::INSPECTORS[opt]
-        @inspect_mode = opt
-        @inspect_method = i
-        i.init
-      else
-        case opt
-        when nil
-          if Inspector.keys_with_inspector(Inspector::INSPECTORS[true]).include?(@inspect_mode)
-            self.inspect_mode = false
-          elsif Inspector.keys_with_inspector(Inspector::INSPECTORS[false]).include?(@inspect_mode)
-            self.inspect_mode = true
-          else
-            puts "Can't switch inspect mode."
-            return
-          end
-        when /^\s*\{.*\}\s*$/
-          begin
-            inspector = eval "proc#{opt}"
-          rescue Exception
-            puts "Can't switch inspect mode(#{opt})."
-            return
-          end
-          self.inspect_mode = inspector
-        when Proc
-          self.inspect_mode = IRB::Inspector(opt)
-        when Inspector
-          prefix = "usr%d"
-          i = 1
-          while Inspector::INSPECTORS[format(prefix, i)]; i += 1; end
-          @inspect_mode = format(prefix, i)
-          @inspect_method = opt
-          Inspector.def_inspector(format(prefix, i), @inspect_method)
-        else
-          puts "Can't switch inspect mode(#{opt})."
-          return
-        end
-      end
-      print "Switch to#{unless @inspect_mode; ' non';end} inspect mode.\n" if verbose?
-      @inspect_mode
-    end
-
-    def evaluate(statement, line_no) # :nodoc:
-      @line_no = line_no
-
-      case statement
-      when Statement::EmptyInput
-        return
-      when Statement::Expression
-        result = evaluate_expression(statement.code, line_no)
-        set_last_value(result)
-      when Statement::Command
-        statement.command_class.execute(self, statement.arg)
-        set_last_value(nil)
-      end
-
-      nil
-    end
-
-    def from_binding?
-      @irb.from_binding
-    end
-
-    def evaluate_expression(code, line_no) # :nodoc:
-      result = nil
-      if IRB.conf[:MEASURE] && IRB.conf[:MEASURE_CALLBACKS].empty?
-        IRB.set_measure_callback
-      end
-
-      if IRB.conf[:MEASURE] && !IRB.conf[:MEASURE_CALLBACKS].empty?
-        last_proc = proc do
-          result = workspace.evaluate(code, @eval_path, line_no)
-        end
-        IRB.conf[:MEASURE_CALLBACKS].inject(last_proc) do |chain, item|
-          _name, callback, arg = item
-          proc do
-            callback.(self, code, line_no, arg) do
-              chain.call
-            end
-          end
-        end.call
-      else
-        result = workspace.evaluate(code, @eval_path, line_no)
-      end
-      result
-    end
-
-    def inspect_last_value # :nodoc:
-      @inspect_method.inspect_value(@last_value)
-    end
-
-    NOPRINTING_IVARS = ["@last_value"] # :nodoc:
-    NO_INSPECTING_IVARS = ["@irb", "@io"] # :nodoc:
-    IDNAME_IVARS = ["@prompt_mode"] # :nodoc:
-
-    alias __inspect__ inspect
-    def inspect # :nodoc:
-      array = []
-      for ivar in instance_variables.sort{|e1, e2| e1 <=> e2}
-        ivar = ivar.to_s
-        name = ivar.sub(/^@(.*)$/, '\1')
-        val = instance_eval(ivar)
-        case ivar
-        when *NOPRINTING_IVARS
-          array.push format("conf.%s=%s", name, "...")
-        when *NO_INSPECTING_IVARS
-          array.push format("conf.%s=%s", name, val.to_s)
-        when *IDNAME_IVARS
-          array.push format("conf.%s=:%s", name, val.id2name)
-        else
-          array.push format("conf.%s=%s", name, val.inspect)
-        end
-      end
-      array.join("\n")
-    end
-    alias __to_s__ to_s
-    alias to_s inspect
-
-    def local_variables # :nodoc:
-      workspace.binding.local_variables
-    end
-  end
-end
diff --git a/lib/irb/debug.rb b/lib/irb/debug.rb
deleted file mode 100644
index 1ec2335a8e..0000000000
--- a/lib/irb/debug.rb
+++ /dev/null
@@ -1,130 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  module Debug
-    IRB_DIR = File.expand_path('..', __dir__)
-
-    class << self
-      def insert_debug_break(pre_cmds: nil, do_cmds: nil)
-        options = { oneshot: true, hook_call: false }
-
-        if pre_cmds || do_cmds
-          options[:command] = ['irb', pre_cmds, do_cmds]
-        end
-        if DEBUGGER__::LineBreakpoint.instance_method(:initialize).parameters.include?([:key, :skip_src])
-          options[:skip_src] = true
-        end
-
-        # To make debugger commands like `next` or `continue` work without asking
-        # the user to quit IRB after that, we need to exit IRB first and then hit
-        # a TracePoint on #debug_break.
-        file, lineno = IRB::Irb.instance_method(:debug_break).source_location
-        DEBUGGER__::SESSION.add_line_breakpoint(file, lineno + 1, **options)
-      end
-
-      def setup(irb)
-        # When debug session is not started at all
-        unless defined?(DEBUGGER__::SESSION)
-          begin
-            require "debug/session"
-          rescue LoadError # debug.gem is not written in Gemfile
-            return false unless load_bundled_debug_gem
-          end
-          DEBUGGER__::CONFIG.set_config
-          configure_irb_for_debugger(irb)
-
-          DEBUGGER__.initialize_session{ IRB::Debug::UI.new(irb) }
-        end
-
-        # When debug session was previously started but not by IRB
-        if defined?(DEBUGGER__::SESSION) && !irb.context.with_debugger
-          configure_irb_for_debugger(irb)
-          DEBUGGER__::SESSION.reset_ui(IRB::Debug::UI.new(irb))
-        end
-
-        # Apply patches to debug gem so it skips IRB frames
-        unless DEBUGGER__.respond_to?(:capture_frames_without_irb)
-          DEBUGGER__.singleton_class.send(:alias_method, :capture_frames_without_irb, :capture_frames)
-
-          def DEBUGGER__.capture_frames(*args)
-            frames = capture_frames_without_irb(*args)
-            frames.reject! do |frame|
-              frame.realpath&.start_with?(IRB_DIR) || frame.path == "<internal:prelude>"
-            end
-            frames
-          end
-
-          DEBUGGER__::ThreadClient.prepend(SkipPathHelperForIRB)
-        end
-
-        if !@output_modifier_defined && !DEBUGGER__::CONFIG[:no_hint]
-          irb_output_modifier_proc = Reline.output_modifier_proc
-
-          Reline.output_modifier_proc = proc do |output, complete:|
-            unless output.strip.empty?
-              cmd = output.split(/\s/, 2).first
-
-              if !complete && DEBUGGER__.commands.key?(cmd)
-                output = output.sub(/\n$/, " # debug command\n")
-              end
-            end
-
-            irb_output_modifier_proc.call(output, complete: complete)
-          end
-
-          @output_modifier_defined = true
-        end
-
-        true
-      end
-
-      private
-
-      def configure_irb_for_debugger(irb)
-        require 'irb/debug/ui'
-        IRB.instance_variable_set(:@debugger_irb, irb)
-        irb.context.with_debugger = true
-        irb.context.irb_name += ":rdbg"
-      end
-
-      module SkipPathHelperForIRB
-        def skip_internal_path?(path)
-          # The latter can be removed once https://github.com/ruby/debug/issues/866 is resolved
-          super || path.match?(IRB_DIR) || path.match?('<internal:prelude>')
-        end
-      end
-
-      # This is used when debug.gem is not written in Gemfile. Even if it's not
-      # installed by `bundle install`, debug.gem is installed by default because
-      # it's a bundled gem. This method tries to activate and load that.
-      def load_bundled_debug_gem
-        # Discover latest debug.gem under GEM_PATH
-        debug_gem = Gem.paths.path.flat_map { |path| Dir.glob("#{path}/gems/debug-*") }.select do |path|
-          File.basename(path).match?(/\Adebug-\d+\.\d+\.\d+(\w+)?\z/)
-        end.sort_by do |path|
-          Gem::Version.new(File.basename(path).delete_prefix('debug-'))
-        end.last
-        return false unless debug_gem
-
-        # Discover debug/debug.so under extensions for Ruby 3.2+
-        ext_name = "/debug/debug.#{RbConfig::CONFIG['DLEXT']}"
-        ext_path = Gem.paths.path.flat_map do |path|
-          Dir.glob("#{path}/extensions/**/#{File.basename(debug_gem)}#{ext_name}")
-        end.first
-
-        # Attempt to forcibly load the bundled gem
-        if ext_path
-          $LOAD_PATH << ext_path.delete_suffix(ext_name)
-        end
-        $LOAD_PATH << "#{debug_gem}/lib"
-        begin
-          require "debug/session"
-          puts "Loaded #{File.basename(debug_gem)}"
-          true
-        rescue LoadError
-          false
-        end
-      end
-    end
-  end
-end
diff --git a/lib/irb/debug/ui.rb b/lib/irb/debug/ui.rb
deleted file mode 100644
index 307097b8c9..0000000000
--- a/lib/irb/debug/ui.rb
+++ /dev/null
@@ -1,103 +0,0 @@
-require 'io/console/size'
-require 'debug/console'
-
-module IRB
-  module Debug
-    class UI < DEBUGGER__::UI_Base
-      def initialize(irb)
-        @irb = irb
-      end
-
-      def remote?
-        false
-      end
-
-      def activate session, on_fork: false
-      end
-
-      def deactivate
-      end
-
-      def width
-        if (w = IO.console_size[1]) == 0 # for tests PTY
-          80
-        else
-          w
-        end
-      end
-
-      def quit n
-        yield
-        exit n
-      end
-
-      def ask prompt
-        setup_interrupt do
-          print prompt
-          ($stdin.gets || '').strip
-        end
-      end
-
-      def puts str = nil
-        case str
-        when Array
-          str.each{|line|
-            $stdout.puts line.chomp
-          }
-        when String
-          str.each_line{|line|
-            $stdout.puts line.chomp
-          }
-        when nil
-          $stdout.puts
-        end
-      end
-
-      def readline _
-        setup_interrupt do
-          tc = DEBUGGER__::SESSION.instance_variable_get(:@tc)
-          cmd = @irb.debug_readline(tc.current_frame.binding || TOPLEVEL_BINDING)
-
-          case cmd
-          when nil # when user types C-d
-            "continue"
-          else
-            cmd
-          end
-        end
-      end
-
-      def setup_interrupt
-        DEBUGGER__::SESSION.intercept_trap_sigint false do
-          current_thread = Thread.current # should be session_server thread
-
-          prev_handler = trap(:INT){
-            current_thread.raise Interrupt
-          }
-
-          yield
-        ensure
-          trap(:INT, prev_handler)
-        end
-      end
-
-      def after_fork_parent
-        parent_pid = Process.pid
-
-        at_exit{
-          DEBUGGER__::SESSION.intercept_trap_sigint_end
-          trap(:SIGINT, :IGNORE)
-
-          if Process.pid == parent_pid
-            # only check child process from its parent
-            begin
-              # wait for all child processes to keep terminal
-              Process.waitpid
-            rescue Errno::ESRCH, Errno::ECHILD
-            end
-          end
-        }
-      end
-    end
-  end
-end
diff --git a/lib/irb/default_commands.rb b/lib/irb/default_commands.rb
deleted file mode 100644
index 1bbc68efa7..0000000000
--- a/lib/irb/default_commands.rb
+++ /dev/null
@@ -1,260 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "command"
-require_relative "command/internal_helpers"
-require_relative "command/context"
-require_relative "command/exit"
-require_relative "command/force_exit"
-require_relative "command/chws"
-require_relative "command/pushws"
-require_relative "command/subirb"
-require_relative "command/load"
-require_relative "command/debug"
-require_relative "command/edit"
-require_relative "command/break"
-require_relative "command/catch"
-require_relative "command/next"
-require_relative "command/delete"
-require_relative "command/step"
-require_relative "command/continue"
-require_relative "command/finish"
-require_relative "command/backtrace"
-require_relative "command/info"
-require_relative "command/help"
-require_relative "command/show_doc"
-require_relative "command/irb_info"
-require_relative "command/ls"
-require_relative "command/measure"
-require_relative "command/show_source"
-require_relative "command/whereami"
-require_relative "command/history"
-
-module IRB
-  module Command
-    NO_OVERRIDE = 0
-    OVERRIDE_PRIVATE_ONLY = 0x01
-    OVERRIDE_ALL = 0x02
-
-    class << self
-      # This API is for IRB's internal use only and may change at any time.
-      # Please do NOT use it.
-      def _register_with_aliases(name, command_class, *aliases)
-        @commands[name.to_sym] = [command_class, aliases]
-      end
-
-      def all_commands_info
-        user_aliases = IRB.CurrentContext.command_aliases.each_with_object({}) do |(alias_name, target), result|
-          result[target] ||= []
-          result[target] << alias_name
-        end
-
-        commands.map do |command_name, (command_class, aliases)|
-          aliases = aliases.map { |a| a.first }
-
-          if additional_aliases = user_aliases[command_name]
-            aliases += additional_aliases
-          end
-
-          display_name = aliases.shift || command_name
-          {
-            display_name: display_name,
-            description: command_class.description,
-            category: command_class.category
-          }
-        end
-      end
-
-      def command_override_policies
-        @@command_override_policies ||= commands.flat_map do |cmd_name, (cmd_class, aliases)|
-          [[cmd_name, OVERRIDE_ALL]] + aliases
-        end.to_h
-      end
-
-      def execute_as_command?(name, public_method:, private_method:)
-        case command_override_policies[name]
-        when OVERRIDE_ALL
-          true
-        when OVERRIDE_PRIVATE_ONLY
-          !public_method
-        when NO_OVERRIDE
-          !public_method && !private_method
-        end
-      end
-
-      def command_names
-        command_override_policies.keys.map(&:to_s)
-      end
-
-      # Convert a command name to its implementation class if such command exists
-      def load_command(command)
-        command = command.to_sym
-        commands.each do |command_name, (command_class, aliases)|
-          if command_name == command || aliases.any? { |alias_name, _| alias_name == command }
-            return command_class
-          end
-        end
-        nil
-      end
-    end
-
-    _register_with_aliases(:irb_context, Command::Context,
-      [:context, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_exit, Command::Exit,
-      [:exit, OVERRIDE_PRIVATE_ONLY],
-      [:quit, OVERRIDE_PRIVATE_ONLY],
-      [:irb_quit, OVERRIDE_PRIVATE_ONLY]
-    )
-
-    _register_with_aliases(:irb_exit!, Command::ForceExit,
-      [:exit!, OVERRIDE_PRIVATE_ONLY]
-    )
-
-    _register_with_aliases(:irb_current_working_workspace, Command::CurrentWorkingWorkspace,
-      [:cwws, NO_OVERRIDE],
-      [:pwws, NO_OVERRIDE],
-      [:irb_print_working_workspace, OVERRIDE_ALL],
-      [:irb_cwws, OVERRIDE_ALL],
-      [:irb_pwws, OVERRIDE_ALL],
-      [:irb_current_working_binding, OVERRIDE_ALL],
-      [:irb_print_working_binding, OVERRIDE_ALL],
-      [:irb_cwb, OVERRIDE_ALL],
-      [:irb_pwb, OVERRIDE_ALL],
-    )
-
-    _register_with_aliases(:irb_change_workspace, Command::ChangeWorkspace,
-      [:chws, NO_OVERRIDE],
-      [:cws, NO_OVERRIDE],
-      [:irb_chws, OVERRIDE_ALL],
-      [:irb_cws, OVERRIDE_ALL],
-      [:irb_change_binding, OVERRIDE_ALL],
-      [:irb_cb, OVERRIDE_ALL],
-      [:cb, NO_OVERRIDE],
-    )
-
-    _register_with_aliases(:irb_workspaces, Command::Workspaces,
-      [:workspaces, NO_OVERRIDE],
-      [:irb_bindings, OVERRIDE_ALL],
-      [:bindings, NO_OVERRIDE],
-    )
-
-    _register_with_aliases(:irb_push_workspace, Command::PushWorkspace,
-      [:pushws, NO_OVERRIDE],
-      [:irb_pushws, OVERRIDE_ALL],
-      [:irb_push_binding, OVERRIDE_ALL],
-      [:irb_pushb, OVERRIDE_ALL],
-      [:pushb, NO_OVERRIDE],
-    )
-
-    _register_with_aliases(:irb_pop_workspace, Command::PopWorkspace,
-      [:popws, NO_OVERRIDE],
-      [:irb_popws, OVERRIDE_ALL],
-      [:irb_pop_binding, OVERRIDE_ALL],
-      [:irb_popb, OVERRIDE_ALL],
-      [:popb, NO_OVERRIDE],
-    )
-
-    _register_with_aliases(:irb_load, Command::Load)
-    _register_with_aliases(:irb_require, Command::Require)
-    _register_with_aliases(:irb_source, Command::Source,
-      [:source, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb, Command::IrbCommand)
-    _register_with_aliases(:irb_jobs, Command::Jobs,
-      [:jobs, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_fg, Command::Foreground,
-      [:fg, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_kill, Command::Kill,
-      [:kill, OVERRIDE_PRIVATE_ONLY]
-    )
-
-    _register_with_aliases(:irb_debug, Command::Debug,
-      [:debug, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_edit, Command::Edit,
-      [:edit, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_break, Command::Break)
-    _register_with_aliases(:irb_catch, Command::Catch)
-    _register_with_aliases(:irb_next, Command::Next)
-    _register_with_aliases(:irb_delete, Command::Delete,
-      [:delete, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_step, Command::Step,
-      [:step, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_continue, Command::Continue,
-      [:continue, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_finish, Command::Finish,
-      [:finish, NO_OVERRIDE]
-    )
-    _register_with_aliases(:irb_backtrace, Command::Backtrace,
-      [:backtrace, NO_OVERRIDE],
-      [:bt, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_debug_info, Command::Info,
-      [:info, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_help, Command::Help,
-      [:help, NO_OVERRIDE],
-      [:show_cmds, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_show_doc, Command::ShowDoc,
-      [:show_doc, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_info, Command::IrbInfo)
-
-    _register_with_aliases(:irb_ls, Command::Ls,
-      [:ls, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_measure, Command::Measure,
-      [:measure, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_show_source, Command::ShowSource,
-      [:show_source, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_whereami, Command::Whereami,
-      [:whereami, NO_OVERRIDE]
-    )
-
-    _register_with_aliases(:irb_history, Command::History,
-      [:history, NO_OVERRIDE],
-      [:hist, NO_OVERRIDE]
-    )
-  end
-
-  ExtendCommand = Command
-
-  # For backward compatibility, we need to keep this module:
-  # - As a container of helper methods
-  # - As a place to register commands with the deprecated def_extend_command method
-  module ExtendCommandBundle
-    # For backward compatibility
-    NO_OVERRIDE = Command::NO_OVERRIDE
-    OVERRIDE_PRIVATE_ONLY = Command::OVERRIDE_PRIVATE_ONLY
-    OVERRIDE_ALL = Command::OVERRIDE_ALL
-
-    # Deprecated. Doesn't have any effect.
-    @EXTEND_COMMANDS = []
-
-    # Drepcated. Use Command.regiser instead.
-    def self.def_extend_command(cmd_name, cmd_class, _, *aliases)
-      Command._register_with_aliases(cmd_name, cmd_class, *aliases)
-      Command.class_variable_set(:@@command_override_policies, nil)
-    end
-  end
-end
diff --git a/lib/irb/easter-egg.rb b/lib/irb/easter-egg.rb
deleted file mode 100644
index adc0834d55..0000000000
--- a/lib/irb/easter-egg.rb
+++ /dev/null
@@ -1,148 +0,0 @@
-require "reline"
-
-module IRB
-  class << self
-    class Vec
-      def initialize(x, y, z)
-        @x, @y, @z = x, y, z
-      end
-
-      attr_reader :x, :y, :z
-
-      def sub(other)
-        Vec.new(@x - other.x, @y - other.y, @z - other.z)
-      end
-
-      def dot(other)
-        @x*other.x + @y*other.y + @z*other.z
-      end
-
-      def cross(other)
-        ox, oy, oz = other.x, other.y, other.z
-        Vec.new(@y*oz-@z*oy, @z*ox-@x*oz, @x*oy-@y*ox)
-      end
-
-      def normalize
-        r = Math.sqrt(self.dot(self))
-        Vec.new(@x / r, @y / r, @z / r)
-      end
-    end
-
-    class Canvas
-      def initialize((h, w))
-        @data = (0..h-2).map { [0] * w }
-        @scale = [w / 2.0, h-2].min
-        @center = Complex(w / 2, h-2)
-      end
-
-      def line((x1, y1), (x2, y2))
-        p1 = Complex(x1, y1) / 2 * @scale + @center
-        p2 = Complex(x2, y2) / 2 * @scale + @center
-        line0(p1, p2)
-      end
-
-      private def line0(p1, p2)
-        mid = (p1 + p2) / 2
-        if (p1 - p2).abs < 1
-          x, y = mid.rect
-          @data[y / 2][x] |= (y % 2 > 1 ? 2 : 1)
-        else
-          line0(p1, mid)
-          line0(p2, mid)
-        end
-      end
-
-      def draw
-        @data.each {|row| row.fill(0) }
-        yield
-        @data.map {|row| row.map {|n| " ',;"[n] }.join }.join("\n")
-      end
-    end
-
-    class RubyModel
-      def initialize
-        @faces = init_ruby_model
-      end
-
-      def init_ruby_model
-        cap_vertices    = (0..5).map {|i| Vec.new(*Complex.polar(1,  i        * Math::PI / 3).rect, 1) }
-        middle_vertices = (0..5).map {|i| Vec.new(*Complex.polar(2, (i + 0.5) * Math::PI / 3).rect, 0) }
-        bottom_vertex   = Vec.new(0, 0, -2)
-
-        faces = [cap_vertices]
-        6.times do |j|
-          i = j-1
-          faces << [cap_vertices[i], middle_vertices[i], cap_vertices[j]]
-          faces << [cap_vertices[j], middle_vertices[i], middle_vertices[j]]
-          faces << [middle_vertices[i], bottom_vertex, middle_vertices[j]]
-        end
-
-        faces
-      end
-
-      def render_frame(i)
-        angle = i / 10.0
-        dir = Vec.new(*Complex.polar(1, angle).rect, Math.sin(angle)).normalize
-        dir2 = Vec.new(*Complex.polar(1, angle - Math::PI/2).rect, 0)
-        up = dir.cross(dir2)
-        nm = dir.cross(up)
-        @faces.each do |vertices|
-          v0, v1, v2, = vertices
-          if v1.sub(v0).cross(v2.sub(v0)).dot(dir) > 0
-            points = vertices.map {|p| [nm.dot(p), up.dot(p)] }
-            (points + [points[0]]).each_cons(2) do |p1, p2|
-              yield p1, p2
-            end
-          end
-        end
-      end
-    end
-
-    private def easter_egg_logo(type)
-      @easter_egg_logos ||= File.read(File.join(__dir__, 'ruby_logo.aa'), encoding: 'UTF-8:UTF-8')
-        .split(/TYPE: ([A-Z]+)\n/)[1..]
-        .each_slice(2)
-        .to_h
-      @easter_egg_logos[type.to_s.upcase]
-    end
-
-    private def easter_egg(type = nil)
-      type ||= [:logo, :dancing].sample
-      case type
-      when :logo
-        require "rdoc"
-        RDoc::RI::Driver.new.page do |io|
-          io.write easter_egg_logo(:large)
-        end
-      when :dancing
-        STDOUT.cooked do
-          interrupted = false
-          prev_trap = trap("SIGINT") { interrupted = true }
-          canvas = Canvas.new(Reline.get_screen_size)
-          Reline::IOGate.set_winch_handler do
-            canvas = Canvas.new(Reline.get_screen_size)
-          end
-          ruby_model = RubyModel.new
-          print "\e[?1049h"
-          0.step do |i| # TODO (0..).each needs Ruby 2.6 or later
-            buff = canvas.draw do
-              ruby_model.render_frame(i) do |p1, p2|
-                canvas.line(p1, p2)
-              end
-            end
-            buff[0, 20] = "\e[0mPress Ctrl+C to stop\e[31m\e[1m"
-            print "\e[H" + buff
-            sleep 0.05
-            break if interrupted
-          end
-        rescue Interrupt
-        ensure
-          print "\e[0m\e[?1049l"
-          trap("SIGINT", prev_trap)
-        end
-      end
-    end
-  end
-end
-
-IRB.__send__(:easter_egg, ARGV[0]&.to_sym) if $0 == __FILE__
diff --git a/lib/irb/ext/change-ws.rb b/lib/irb/ext/change-ws.rb
deleted file mode 100644
index 60e8afe31f..0000000000
--- a/lib/irb/ext/change-ws.rb
+++ /dev/null
@@ -1,37 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/ext/cb.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-  class Context
-
-    # Inherited from +TOPLEVEL_BINDING+.
-    def home_workspace
-      if defined? @home_workspace
-        @home_workspace
-      else
-        @home_workspace = workspace
-      end
-    end
-
-    # Changes the current workspace to given object or binding.
-    #
-    # If the optional argument is omitted, the workspace will be
-    # #home_workspace which is inherited from +TOPLEVEL_BINDING+ or the main
-    # object, <code>IRB.conf[:MAIN_CONTEXT]</code> when irb was initialized.
-    #
-    # See IRB::WorkSpace.new for more information.
-    def change_workspace(*_main)
-      if _main.empty?
-        replace_workspace(home_workspace)
-        return main
-      end
-
-      workspace = WorkSpace.new(_main[0])
-      replace_workspace(workspace)
-      workspace.load_helper_methods_to_main
-    end
-  end
-end
diff --git a/lib/irb/ext/eval_history.rb b/lib/irb/ext/eval_history.rb
deleted file mode 100644
index 6c21ff00ee..0000000000
--- a/lib/irb/ext/eval_history.rb
+++ /dev/null
@@ -1,149 +0,0 @@
-# frozen_string_literal: true
-#
-#   history.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-
-  class Context
-
-    NOPRINTING_IVARS.push "@eval_history_values"
-
-    # See #set_last_value
-    alias _set_last_value set_last_value
-
-    def set_last_value(value)
-      _set_last_value(value)
-
-      if defined?(@eval_history) && @eval_history
-        @eval_history_values.push @line_no, @last_value
-        workspace.evaluate "__ = IRB.CurrentContext.instance_eval{@eval_history_values}"
-      end
-
-      @last_value
-    end
-
-    remove_method :eval_history= if method_defined?(:eval_history=)
-    # The command result history limit. This method is not available until
-    # #eval_history= was called with non-nil value (directly or via
-    # setting <code>IRB.conf[:EVAL_HISTORY]</code> in <code>.irbrc</code>).
-    attr_reader :eval_history
-    # Sets command result history limit. Default value is set from
-    # <code>IRB.conf[:EVAL_HISTORY]</code>.
-    #
-    # +no+ is an Integer or +nil+.
-    #
-    # Returns +no+ of history items if greater than 0.
-    #
-    # If +no+ is 0, the number of history items is unlimited.
-    #
-    # If +no+ is +nil+, execution result history isn't used (default).
-    #
-    # EvalHistory values are available via <code>__</code> variable, see
-    # IRB::EvalHistory.
-    def eval_history=(no)
-      if no
-        if defined?(@eval_history) && @eval_history
-          @eval_history_values.size(no)
-        else
-          @eval_history_values = EvalHistory.new(no)
-          IRB.conf[:__TMP__EHV__] = @eval_history_values
-          workspace.evaluate("__ = IRB.conf[:__TMP__EHV__]")
-          IRB.conf.delete(:__TMP_EHV__)
-        end
-      else
-        @eval_history_values = nil
-      end
-      @eval_history = no
-    end
-  end
-
-  # Represents history of results of previously evaluated commands.
-  #
-  # Available via <code>__</code> variable, only if <code>IRB.conf[:EVAL_HISTORY]</code>
-  # or <code>IRB::CurrentContext().eval_history</code> is non-nil integer value
-  # (by default it is +nil+).
-  #
-  # Example (in `irb`):
-  #
-  #    # Initialize history
-  #    IRB::CurrentContext().eval_history = 10
-  #    # => 10
-  #
-  #    # Perform some commands...
-  #    1 + 2
-  #    # => 3
-  #    puts 'x'
-  #    # x
-  #    # => nil
-  #    raise RuntimeError
-  #    # ...error raised
-  #
-  #    # Inspect history (format is "<item number> <evaluated value>":
-  #    __
-  #    # => 1 10
-  #    # 2 3
-  #    # 3 nil
-  #
-  #    __[1]
-  #    # => 10
-  #
-  class EvalHistory
-
-    def initialize(size = 16)  # :nodoc:
-      @size = size
-      @contents = []
-    end
-
-    def size(size) # :nodoc:
-      if size != 0 && size < @size
-        @contents = @contents[@size - size .. @size]
-      end
-      @size = size
-    end
-
-    # Get one item of the content (both positive and negative indexes work).
-    def [](idx)
-      begin
-        if idx >= 0
-          @contents.find{|no, val| no == idx}[1]
-        else
-          @contents[idx][1]
-        end
-      rescue NameError
-        nil
-      end
-    end
-
-    def push(no, val)  # :nodoc:
-      @contents.push [no, val]
-      @contents.shift if @size != 0 && @contents.size > @size
-    end
-
-    alias real_inspect inspect
-
-    def inspect  # :nodoc:
-      if @contents.empty?
-        return real_inspect
-      end
-
-      unless (last = @contents.pop)[1].equal?(self)
-        @contents.push last
-        last = nil
-      end
-      str = @contents.collect{|no, val|
-        if val.equal?(self)
-          "#{no} ...self-history..."
-        else
-          "#{no} #{val.inspect}"
-        end
-      }.join("\n")
-      if str == ""
-        str = "Empty."
-      end
-      @contents.push last if last
-      str
-    end
-  end
-end
diff --git a/lib/irb/ext/loader.rb b/lib/irb/ext/loader.rb
deleted file mode 100644
index df5aaa8e5a..0000000000
--- a/lib/irb/ext/loader.rb
+++ /dev/null
@@ -1,127 +0,0 @@
-# frozen_string_literal: true
-#
-#   loader.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-  # Raised in the event of an exception in a file loaded from an Irb session
-  class LoadAbort < Exception;end
-
-  # Provides a few commands for loading files within an irb session.
-  #
-  # See ExtendCommandBundle for more information.
-  module IrbLoader
-
-    alias ruby_load load
-    alias ruby_require require
-
-    # Loads the given file similarly to Kernel#load
-    def irb_load(fn, priv = nil)
-      path = search_file_from_ruby_path(fn)
-      raise LoadError, "No such file to load -- #{fn}" unless path
-
-      load_file(path, priv)
-    end
-
-    def search_file_from_ruby_path(fn) # :nodoc:
-      if File.absolute_path?(fn)
-        return fn if File.exist?(fn)
-        return nil
-      end
-
-      for path in $:
-        if File.exist?(f = File.join(path, fn))
-          return f
-        end
-      end
-      return nil
-    end
-
-    # Loads a given file in the current session and displays the source lines
-    #
-    # See Irb#suspend_input_method for more information.
-    def source_file(path)
-      irb = irb_context.irb
-      irb.suspend_name(path, File.basename(path)) do
-        FileInputMethod.open(path) do |io|
-          irb.suspend_input_method(io) do
-            |back_io|
-            irb.signal_status(:IN_LOAD) do
-              if back_io.kind_of?(FileInputMethod)
-                irb.eval_input
-              else
-                begin
-                  irb.eval_input
-                rescue LoadAbort
-                  print "load abort!!\n"
-                end
-              end
-            end
-          end
-        end
-      end
-    end
-
-    # Loads the given file in the current session's context and evaluates it.
-    #
-    # See Irb#suspend_input_method for more information.
-    def load_file(path, priv = nil)
-      irb = irb_context.irb
-      irb.suspend_name(path, File.basename(path)) do
-
-        if priv
-          ws = WorkSpace.new(Module.new)
-        else
-          ws = WorkSpace.new
-        end
-        irb.suspend_workspace(ws) do
-          FileInputMethod.open(path) do |io|
-            irb.suspend_input_method(io) do
-              |back_io|
-              irb.signal_status(:IN_LOAD) do
-                if back_io.kind_of?(FileInputMethod)
-                  irb.eval_input
-                else
-                  begin
-                    irb.eval_input
-                  rescue LoadAbort
-                    print "load abort!!\n"
-                  end
-                end
-              end
-            end
-          end
-        end
-      end
-    end
-
-    def old # :nodoc:
-      back_io = @io
-      back_path = irb_path
-      back_name = @irb_name
-      back_scanner = @irb.scanner
-      begin
-        @io = FileInputMethod.new(path)
-        @irb_name = File.basename(path)
-        self.irb_path = path
-        @irb.signal_status(:IN_LOAD) do
-          if back_io.kind_of?(FileInputMethod)
-            @irb.eval_input
-          else
-            begin
-              @irb.eval_input
-            rescue LoadAbort
-              print "load abort!!\n"
-            end
-          end
-        end
-      ensure
-        @io = back_io
-        @irb_name = back_name
-        self.irb_path = back_path
-        @irb.scanner = back_scanner
-      end
-    end
-  end
-end
diff --git a/lib/irb/ext/multi-irb.rb b/lib/irb/ext/multi-irb.rb
deleted file mode 100644
index 9f234f0cdc..0000000000
--- a/lib/irb/ext/multi-irb.rb
+++ /dev/null
@@ -1,258 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/multi-irb.rb - multiple irb module
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  class JobManager # :nodoc:
-
-    # Creates a new JobManager object
-    def initialize
-      @jobs = []
-      @current_job = nil
-    end
-
-    # The active irb session
-    attr_accessor :current_job
-
-    # The total number of irb sessions, used to set +irb_name+ of the current
-    # Context.
-    def n_jobs
-      @jobs.size
-    end
-
-    # Returns the thread for the given +key+ object, see #search for more
-    # information.
-    def thread(key)
-      th, = search(key)
-      th
-    end
-
-    # Returns the irb session for the given +key+ object, see #search for more
-    # information.
-    def irb(key)
-      _, irb = search(key)
-      irb
-    end
-
-    # Returns the top level thread.
-    def main_thread
-      @jobs[0][0]
-    end
-
-    # Returns the top level irb session.
-    def main_irb
-      @jobs[0][1]
-    end
-
-    # Add the given +irb+ session to the jobs Array.
-    def insert(irb)
-      @jobs.push [Thread.current, irb]
-    end
-
-    # Changes the current active irb session to the given +key+ in the jobs
-    # Array.
-    #
-    # Raises an IrbAlreadyDead exception if the given +key+ is no longer alive.
-    #
-    # If the given irb session is already active, an IrbSwitchedToCurrentThread
-    # exception is raised.
-    def switch(key)
-      th, irb = search(key)
-      fail IrbAlreadyDead unless th.alive?
-      fail IrbSwitchedToCurrentThread if th == Thread.current
-      @current_job = irb
-      th.run
-      Thread.stop
-      @current_job = irb(Thread.current)
-    end
-
-    # Terminates the irb sessions specified by the given +keys+.
-    #
-    # Raises an IrbAlreadyDead exception if one of the given +keys+ is already
-    # terminated.
-    #
-    # See Thread#exit for more information.
-    def kill(*keys)
-      for key in keys
-        th, _ = search(key)
-        fail IrbAlreadyDead unless th.alive?
-        th.exit
-      end
-    end
-
-    # Returns the associated job for the given +key+.
-    #
-    # If given an Integer, it will return the +key+ index for the jobs Array.
-    #
-    # When an instance of Irb is given, it will return the irb session
-    # associated with +key+.
-    #
-    # If given an instance of Thread, it will return the associated thread
-    # +key+ using Object#=== on the jobs Array.
-    #
-    # Otherwise returns the irb session with the same top-level binding as the
-    # given +key+.
-    #
-    # Raises a NoSuchJob exception if no job can be found with the given +key+.
-    def search(key)
-      job = case key
-            when Integer
-              @jobs[key]
-            when Irb
-              @jobs.find{|k, v| v.equal?(key)}
-            when Thread
-              @jobs.assoc(key)
-            else
-              @jobs.find{|k, v| v.context.main.equal?(key)}
-            end
-      fail NoSuchJob, key if job.nil?
-      job
-    end
-
-    # Deletes the job at the given +key+.
-    def delete(key)
-      case key
-      when Integer
-        fail NoSuchJob, key unless @jobs[key]
-        @jobs[key] = nil
-      else
-        catch(:EXISTS) do
-          @jobs.each_index do
-            |i|
-            if @jobs[i] and (@jobs[i][0] == key ||
-                @jobs[i][1] == key ||
-                @jobs[i][1].context.main.equal?(key))
-              @jobs[i] = nil
-              throw :EXISTS
-            end
-          end
-          fail NoSuchJob, key
-        end
-      end
-      until assoc = @jobs.pop; end unless @jobs.empty?
-      @jobs.push assoc
-    end
-
-    # Outputs a list of jobs, see the irb command +irb_jobs+, or +jobs+.
-    def inspect
-      ary = []
-      @jobs.each_index do
-        |i|
-        th, irb = @jobs[i]
-        next if th.nil?
-
-        if th.alive?
-          if th.stop?
-            t_status = "stop"
-          else
-            t_status = "running"
-          end
-        else
-          t_status = "exited"
-        end
-        ary.push format("#%d->%s on %s (%s: %s)",
-          i,
-          irb.context.irb_name,
-          irb.context.main,
-          th,
-          t_status)
-      end
-      ary.join("\n")
-    end
-  end
-
-  @JobManager = JobManager.new
-
-  # The current JobManager in the session
-  def IRB.JobManager # :nodoc:
-    @JobManager
-  end
-
-  # The current Context in this session
-  def IRB.CurrentContext # :nodoc:
-    IRB.JobManager.irb(Thread.current).context
-  end
-
-  # Creates a new IRB session, see Irb.new.
-  #
-  # The optional +file+ argument is given to Context.new, along with the
-  # workspace created with the remaining arguments, see WorkSpace.new
-  def IRB.irb(file = nil, *main) # :nodoc:
-    workspace = WorkSpace.new(*main)
-    parent_thread = Thread.current
-    Thread.start do
-      begin
-        irb = Irb.new(workspace, file)
-      rescue
-        print "Subirb can't start with context(self): ", workspace.main.inspect, "\n"
-        print "return to main irb\n"
-        Thread.pass
-        Thread.main.wakeup
-        Thread.exit
-      end
-      @CONF[:IRB_RC].call(irb.context) if @CONF[:IRB_RC]
-      @JobManager.insert(irb)
-      @JobManager.current_job = irb
-      begin
-        system_exit = false
-        catch(:IRB_EXIT) do
-          irb.eval_input
-        end
-      rescue SystemExit
-        system_exit = true
-        raise
-        #fail
-      ensure
-        unless system_exit
-          @JobManager.delete(irb)
-          if @JobManager.current_job == irb
-            if parent_thread.alive?
-              @JobManager.current_job = @JobManager.irb(parent_thread)
-              parent_thread.run
-            else
-              @JobManager.current_job = @JobManager.main_irb
-              @JobManager.main_thread.run
-            end
-          end
-        end
-      end
-    end
-    Thread.stop
-    @JobManager.current_job = @JobManager.irb(Thread.current)
-  end
-
-  @CONF[:SINGLE_IRB_MODE] = false
-  @JobManager.insert(@CONF[:MAIN_CONTEXT].irb)
-  @JobManager.current_job = @CONF[:MAIN_CONTEXT].irb
-
-  class Irb
-    def signal_handle
-      unless @context.ignore_sigint?
-        print "\nabort!!\n" if @context.verbose?
-        exit
-      end
-
-      case @signal_status
-      when :IN_INPUT
-        print "^C\n"
-        IRB.JobManager.thread(self).raise RubyLex::TerminateLineInput
-      when :IN_EVAL
-        IRB.irb_abort(self)
-      when :IN_LOAD
-        IRB.irb_abort(self, LoadAbort)
-      when :IN_IRB
-        # ignore
-      else
-        # ignore other cases as well
-      end
-    end
-  end
-
-  trap("SIGINT") do
-    @JobManager.current_job.signal_handle
-    Thread.stop
-  end
-
-end
diff --git a/lib/irb/ext/tracer.rb b/lib/irb/ext/tracer.rb
deleted file mode 100644
index fd6daa88ae..0000000000
--- a/lib/irb/ext/tracer.rb
+++ /dev/null
@@ -1,39 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/lib/tracer.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-# Loading the gem "tracer" will cause it to extend IRB commands with:
-# https://github.com/ruby/tracer/blob/v0.2.2/lib/tracer/irb.rb
-begin
-  require "tracer"
-rescue LoadError
-  $stderr.puts "Tracer extension of IRB is enabled but tracer gem wasn't found."
-  return # This is about to disable loading below
-end
-
-module IRB
-  class CallTracer < ::CallTracer
-    IRB_DIR = File.expand_path('../..', __dir__)
-
-    def skip?(tp)
-      super || tp.path.match?(IRB_DIR) || tp.path.match?('<internal:prelude>')
-    end
-  end
-  class WorkSpace
-    alias __evaluate__ evaluate
-    # Evaluate the context of this workspace and use the Tracer library to
-    # output the exact lines of code are being executed in chronological order.
-    #
-    # See https://github.com/ruby/tracer for more information.
-    def evaluate(statements, file = __FILE__, line = __LINE__)
-      if IRB.conf[:USE_TRACER] == true
-        CallTracer.new(colorize: Color.colorable?).start do
-          __evaluate__(statements, file, line)
-        end
-      else
-        __evaluate__(statements, file, line)
-      end
-    end
-  end
-end
diff --git a/lib/irb/ext/use-loader.rb b/lib/irb/ext/use-loader.rb
deleted file mode 100644
index c8a3ea1fe8..0000000000
--- a/lib/irb/ext/use-loader.rb
+++ /dev/null
@@ -1,67 +0,0 @@
-# frozen_string_literal: true
-#
-#   use-loader.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative "../command/load"
-require_relative "loader"
-
-class Object
-  alias __original__load__IRB_use_loader__ load
-  alias __original__require__IRB_use_loader__ require
-end
-
-module IRB
-  module ExtendCommandBundle
-    remove_method :irb_load if method_defined?(:irb_load)
-    # Loads the given file similarly to Kernel#load, see IrbLoader#irb_load
-    def irb_load(*opts, &b)
-      Command::Load.execute(irb_context, *opts, &b)
-    end
-    remove_method :irb_require if method_defined?(:irb_require)
-    # Loads the given file similarly to Kernel#require
-    def irb_require(*opts, &b)
-      Command::Require.execute(irb_context, *opts, &b)
-    end
-  end
-
-  class Context
-
-    IRB.conf[:USE_LOADER] = false
-
-    # Returns whether +irb+'s own file reader method is used by
-    # +load+/+require+ or not.
-    #
-    # This mode is globally affected (irb-wide).
-    def use_loader
-      IRB.conf[:USE_LOADER]
-    end
-
-    alias use_loader? use_loader
-
-    remove_method :use_loader= if method_defined?(:use_loader=)
-    # Sets <code>IRB.conf[:USE_LOADER]</code>
-    #
-    # See #use_loader for more information.
-    def use_loader=(opt)
-
-      if IRB.conf[:USE_LOADER] != opt
-        IRB.conf[:USE_LOADER] = opt
-        if opt
-          (class<<workspace.main;self;end).instance_eval {
-            alias_method :load, :irb_load
-            alias_method :require, :irb_require
-          }
-        else
-          (class<<workspace.main;self;end).instance_eval {
-            alias_method :load, :__original__load__IRB_use_loader__
-            alias_method :require, :__original__require__IRB_use_loader__
-          }
-        end
-      end
-      print "Switch to load/require#{unless use_loader; ' non';end} trace mode.\n" if verbose?
-      opt
-    end
-  end
-end
diff --git a/lib/irb/ext/workspaces.rb b/lib/irb/ext/workspaces.rb
deleted file mode 100644
index da09faa83e..0000000000
--- a/lib/irb/ext/workspaces.rb
+++ /dev/null
@@ -1,36 +0,0 @@
-# frozen_string_literal: true
-#
-#   push-ws.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-  class Context
-    # Creates a new workspace with the given object or binding, and appends it
-    # onto the current #workspaces stack.
-    #
-    # See IRB::Context#change_workspace and IRB::WorkSpace.new for more
-    # information.
-    def push_workspace(*_main)
-      if _main.empty?
-        if @workspace_stack.size > 1
-          # swap the top two workspaces
-          previous_workspace, current_workspace = @workspace_stack.pop(2)
-          @workspace_stack.push current_workspace, previous_workspace
-        end
-      else
-        new_workspace = WorkSpace.new(workspace.binding, _main[0])
-        @workspace_stack.push new_workspace
-        new_workspace.load_helper_methods_to_main
-      end
-    end
-
-    # Removes the last element from the current #workspaces stack and returns
-    # it, or +nil+ if the current workspace stack is empty.
-    #
-    # Also, see #push_workspace.
-    def pop_workspace
-      @workspace_stack.pop if @workspace_stack.size > 1
-    end
-  end
-end
diff --git a/lib/irb/frame.rb b/lib/irb/frame.rb
deleted file mode 100644
index 4b697c8719..0000000000
--- a/lib/irb/frame.rb
+++ /dev/null
@@ -1,80 +0,0 @@
-# frozen_string_literal: true
-#
-#   frame.rb -
-#   	by Keiju ISHITSUKA(Nihon Rational Software Co.,Ltd)
-#
-
-module IRB
-  class Frame
-    class FrameOverflow < StandardError
-      def initialize
-        super("frame overflow")
-      end
-    end
-    class FrameUnderflow < StandardError
-      def initialize
-        super("frame underflow")
-      end
-    end
-
-    # Default number of stack frames
-    INIT_STACK_TIMES = 3
-    # Default number of frames offset
-    CALL_STACK_OFFSET = 3
-
-    # Creates a new stack frame
-    def initialize
-      @frames = [TOPLEVEL_BINDING] * INIT_STACK_TIMES
-    end
-
-    # Used by Kernel#set_trace_func to register each event in the call stack
-    def trace_func(event, file, line, id, binding)
-      case event
-      when 'call', 'class'
-        @frames.push binding
-      when 'return', 'end'
-        @frames.pop
-      end
-    end
-
-    # Returns the +n+ number of frames on the call stack from the last frame
-    # initialized.
-    #
-    # Raises FrameUnderflow if there are no frames in the given stack range.
-    def top(n = 0)
-      bind = @frames[-(n + CALL_STACK_OFFSET)]
-      fail FrameUnderflow unless bind
-      bind
-    end
-
-    # Returns the +n+ number of frames on the call stack from the first frame
-    # initialized.
-    #
-    # Raises FrameOverflow if there are no frames in the given stack range.
-    def bottom(n = 0)
-      bind = @frames[n]
-      fail FrameOverflow unless bind
-      bind
-    end
-
-    # Convenience method for Frame#bottom
-    def Frame.bottom(n = 0)
-      @backtrace.bottom(n)
-    end
-
-    # Convenience method for Frame#top
-    def Frame.top(n = 0)
-      @backtrace.top(n)
-    end
-
-    # Returns the binding context of the caller from the last frame initialized
-    def Frame.sender
-      eval "self", @backtrace.top
-    end
-
-    @backtrace = Frame.new
-    set_trace_func proc{|event, file, line, id, binding, klass|
-      @backtrace.trace_func(event, file, line, id, binding)
-    }
-  end
-end
diff --git a/lib/irb/help.rb b/lib/irb/help.rb
deleted file mode 100644
index a24bc10a15..0000000000
--- a/lib/irb/help.rb
+++ /dev/null
@@ -1,28 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/help.rb - print usage module
-#   	by Keiju ISHITSUKA(keiju@ishitsuka.com)
-#
-
-module IRB
-  # Outputs the irb help message, see IRB@Command-Line+Options.
-  def IRB.print_usage # :nodoc:
-    lc = IRB.conf[:LC_MESSAGES]
-    path = lc.find("irb/help-message")
-    space_line = false
-    File.open(path){|f|
-      f.each_line do |l|
-        if /^\s*$/ =~ l
-          lc.puts l unless space_line
-          space_line = true
-          next
-        end
-        space_line = false
-
-        l.sub!(/#.*$/, "")
-        next if /^\s*$/ =~ l
-        lc.puts l
-      end
-    }
-  end
-end
diff --git a/lib/irb/helper_method.rb b/lib/irb/helper_method.rb
deleted file mode 100644
index f1f6fff915..0000000000
--- a/lib/irb/helper_method.rb
+++ /dev/null
@@ -1,29 +0,0 @@
-require_relative "helper_method/base"
-
-module IRB
-  module HelperMethod
-    @helper_methods = {}
-
-    class << self
-      attr_reader :helper_methods
-
-      def register(name, helper_class)
-        @helper_methods[name] = helper_class
-
-        if defined?(HelpersContainer)
-          HelpersContainer.install_helper_methods
-        end
-      end
-
-      def all_helper_methods_info
-        @helper_methods.map do |name, helper_class|
-          { display_name: name, description: helper_class.description }
-        end
-      end
-    end
-
-    # Default helper_methods
-    require_relative "helper_method/conf"
-    register(:conf, HelperMethod::Conf)
-  end
-end
diff --git a/lib/irb/helper_method/base.rb b/lib/irb/helper_method/base.rb
deleted file mode 100644
index a68001ed28..0000000000
--- a/lib/irb/helper_method/base.rb
+++ /dev/null
@@ -1,16 +0,0 @@
-require "singleton"
-
-module IRB
-  module HelperMethod
-    class Base
-      include Singleton
-
-      class << self
-        def description(description = nil)
-          @description = description if description
-          @description
-        end
-      end
-    end
-  end
-end
diff --git a/lib/irb/helper_method/conf.rb b/lib/irb/helper_method/conf.rb
deleted file mode 100644
index 718ed279c0..0000000000
--- a/lib/irb/helper_method/conf.rb
+++ /dev/null
@@ -1,11 +0,0 @@
-module IRB
-  module HelperMethod
-    class Conf < Base
-      description "Returns the current IRB context."
-
-      def execute
-        IRB.CurrentContext
-      end
-    end
-  end
-end
diff --git a/lib/irb/history.rb b/lib/irb/history.rb
deleted file mode 100644
index 685354b2d8..0000000000
--- a/lib/irb/history.rb
+++ /dev/null
@@ -1,87 +0,0 @@
-require "pathname"
-
-module IRB
-  module HistorySavingAbility # :nodoc:
-    def support_history_saving?
-      true
-    end
-
-    def reset_history_counter
-      @loaded_history_lines = self.class::HISTORY.size
-    end
-
-    def load_history
-      history = self.class::HISTORY
-
-      if history_file = IRB.conf[:HISTORY_FILE]
-        history_file = File.expand_path(history_file)
-      end
-      history_file = IRB.rc_file("_history") unless history_file
-      if history_file && File.exist?(history_file)
-        File.open(history_file, "r:#{IRB.conf[:LC_MESSAGES].encoding}") do |f|
-          f.each { |l|
-            l = l.chomp
-            if self.class == RelineInputMethod and history.last&.end_with?("\\")
-              history.last.delete_suffix!("\\")
-              history.last << "\n" << l
-            else
-              history << l
-            end
-          }
-        end
-        @loaded_history_lines = history.size
-        @loaded_history_mtime = File.mtime(history_file)
-      end
-    end
-
-    def save_history
-      history = self.class::HISTORY.to_a
-
-      if num = IRB.conf[:SAVE_HISTORY] and (num = num.to_i) != 0
-        if history_file = IRB.conf[:HISTORY_FILE]
-          history_file = File.expand_path(history_file)
-        end
-        history_file = IRB.rc_file("_history") unless history_file
-
-        # When HOME and XDG_CONFIG_HOME are not available, history_file might be nil
-        return unless history_file
-
-        # Change the permission of a file that already exists[BUG #7694]
-        begin
-          if File.stat(history_file).mode & 066 != 0
-            File.chmod(0600, history_file)
-          end
-        rescue Errno::ENOENT
-        rescue Errno::EPERM
-          return
-        rescue
-          raise
-        end
-
-        if File.exist?(history_file) &&
-           File.mtime(history_file) != @loaded_history_mtime
-          history = history[@loaded_history_lines..-1] if @loaded_history_lines
-          append_history = true
-        end
-
-        pathname = Pathname.new(history_file)
-        unless Dir.exist?(pathname.dirname)
-          warn "Warning: The directory to save IRB's history file does not exist. Please double check `IRB.conf[:HISTORY_FILE]`'s value."
-          return
-        end
-
-        File.open(history_file, (append_history ? 'a' : 'w'), 0o600, encoding: IRB.conf[:LC_MESSAGES]&.encoding) do |f|
-          hist = history.map{ |l| l.scrub.split("\n").join("\\\n") }
-          unless append_history
-            begin
-              hist = hist.last(num) if hist.size > num and num > 0
-            rescue RangeError # bignum too big to convert into `long'
-              # Do nothing because the bignum should be treated as infinity
-            end
-          end
-          f.puts(hist)
-        end
-      end
-    end
-  end
-end
diff --git a/lib/irb/init.rb b/lib/irb/init.rb
deleted file mode 100644
index 7dc08912ef..0000000000
--- a/lib/irb/init.rb
+++ /dev/null
@@ -1,538 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/init.rb - irb initialize module
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-  @CONF = {}
-  @INITIALIZED = false
-  # Displays current configuration.
-  #
-  # Modifying the configuration is achieved by sending a message to IRB.conf.
-  #
-  # See IRB@Configuration for more information.
-  def IRB.conf
-    @CONF
-  end
-
-  def @CONF.inspect
-    array = []
-    for k, v in sort{|a1, a2| a1[0].id2name <=> a2[0].id2name}
-      case k
-      when :MAIN_CONTEXT, :__TMP__EHV__
-        array.push format("CONF[:%s]=...myself...", k.id2name)
-      when :PROMPT
-        s = v.collect{
-          |kk, vv|
-          ss = vv.collect{|kkk, vvv| ":#{kkk.id2name}=>#{vvv.inspect}"}
-          format(":%s=>{%s}", kk.id2name, ss.join(", "))
-        }
-        array.push format("CONF[:%s]={%s}", k.id2name, s.join(", "))
-      else
-        array.push format("CONF[:%s]=%s", k.id2name, v.inspect)
-      end
-    end
-    array.join("\n")
-  end
-
-  # Returns the current version of IRB, including release version and last
-  # updated date.
-  def IRB.version
-    format("irb %s (%s)", @RELEASE_VERSION, @LAST_UPDATE_DATE)
-  end
-
-  def IRB.initialized?
-    !!@INITIALIZED
-  end
-
-  # initialize config
-  def IRB.setup(ap_path, argv: ::ARGV)
-    IRB.init_config(ap_path)
-    IRB.init_error
-    IRB.parse_opts(argv: argv)
-    IRB.run_config
-    IRB.validate_config
-    IRB.load_modules
-
-    unless @CONF[:PROMPT][@CONF[:PROMPT_MODE]]
-      fail UndefinedPromptMode, @CONF[:PROMPT_MODE]
-    end
-    @INITIALIZED = true
-  end
-
-  # @CONF default setting
-  def IRB.init_config(ap_path)
-    # default configurations
-    unless ap_path and @CONF[:AP_NAME]
-      ap_path = File.join(File.dirname(File.dirname(__FILE__)), "irb.rb")
-    end
-    @CONF[:VERSION] = version
-    @CONF[:AP_NAME] = File::basename(ap_path, ".rb")
-
-    @CONF[:IRB_NAME] = "irb"
-    @CONF[:IRB_LIB_PATH] = File.dirname(__FILE__)
-
-    @CONF[:RC] = true
-    @CONF[:LOAD_MODULES] = []
-    @CONF[:IRB_RC] = nil
-
-    @CONF[:USE_SINGLELINE] = false unless defined?(ReadlineInputMethod)
-    @CONF[:USE_COLORIZE] = (nc = ENV['NO_COLOR']).nil? || nc.empty?
-    @CONF[:USE_AUTOCOMPLETE] = ENV.fetch("IRB_USE_AUTOCOMPLETE", "true") != "false"
-    @CONF[:COMPLETOR] = ENV.fetch("IRB_COMPLETOR", "regexp").to_sym
-    @CONF[:INSPECT_MODE] = true
-    @CONF[:USE_TRACER] = false
-    @CONF[:USE_LOADER] = false
-    @CONF[:IGNORE_SIGINT] = true
-    @CONF[:IGNORE_EOF] = false
-    @CONF[:USE_PAGER] = true
-    @CONF[:EXTRA_DOC_DIRS] = []
-    @CONF[:ECHO] = nil
-    @CONF[:ECHO_ON_ASSIGNMENT] = nil
-    @CONF[:VERBOSE] = nil
-
-    @CONF[:EVAL_HISTORY] = nil
-    @CONF[:SAVE_HISTORY] = 1000
-
-    @CONF[:BACK_TRACE_LIMIT] = 16
-
-    @CONF[:PROMPT] = {
-      :NULL => {
-        :PROMPT_I => nil,
-        :PROMPT_S => nil,
-        :PROMPT_C => nil,
-        :RETURN => "%s\n"
-      },
-      :DEFAULT => {
-        :PROMPT_I => "%N(%m):%03n> ",
-        :PROMPT_S => "%N(%m):%03n%l ",
-        :PROMPT_C => "%N(%m):%03n* ",
-        :RETURN => "=> %s\n"
-      },
-      :CLASSIC => {
-        :PROMPT_I => "%N(%m):%03n:%i> ",
-        :PROMPT_S => "%N(%m):%03n:%i%l ",
-        :PROMPT_C => "%N(%m):%03n:%i* ",
-        :RETURN => "%s\n"
-      },
-      :SIMPLE => {
-        :PROMPT_I => ">> ",
-        :PROMPT_S => "%l> ",
-        :PROMPT_C => "?> ",
-        :RETURN => "=> %s\n"
-      },
-      :INF_RUBY => {
-        :PROMPT_I => "%N(%m):%03n> ",
-        :PROMPT_S => nil,
-        :PROMPT_C => nil,
-        :RETURN => "%s\n",
-        :AUTO_INDENT => true
-      },
-      :XMP => {
-        :PROMPT_I => nil,
-        :PROMPT_S => nil,
-        :PROMPT_C => nil,
-        :RETURN => "    ==>%s\n"
-      }
-    }
-
-    @CONF[:PROMPT_MODE] = (STDIN.tty? ? :DEFAULT : :NULL)
-    @CONF[:AUTO_INDENT] = true
-
-    @CONF[:CONTEXT_MODE] = 4 # use a copy of TOPLEVEL_BINDING
-    @CONF[:SINGLE_IRB] = false
-
-    @CONF[:MEASURE] = false
-    @CONF[:MEASURE_PROC] = {}
-    @CONF[:MEASURE_PROC][:TIME] = proc { |context, code, line_no, &block|
-      time = Time.now
-      result = block.()
-      now = Time.now
-      puts 'processing time: %fs' % (now - time) if IRB.conf[:MEASURE]
-      result
-    }
-    # arg can be either a symbol for the mode (:cpu, :wall, ..) or a hash for
-    # a more complete configuration.
-    # See https://github.com/tmm1/stackprof#all-options.
-    @CONF[:MEASURE_PROC][:STACKPROF] = proc { |context, code, line_no, arg, &block|
-      return block.() unless IRB.conf[:MEASURE]
-      success = false
-      begin
-        require 'stackprof'
-        success = true
-      rescue LoadError
-        puts 'Please run "gem install stackprof" before measuring by StackProf.'
-      end
-      if success
-        result = nil
-        arg = { mode: arg || :cpu } unless arg.is_a?(Hash)
-        stackprof_result = StackProf.run(**arg) do
-          result = block.()
-        end
-        case stackprof_result
-        when File
-          puts "StackProf report saved to #{stackprof_result.path}"
-        when Hash
-          StackProf::Report.new(stackprof_result).print_text
-        else
-          puts "Stackprof ran with #{arg.inspect}"
-        end
-        result
-      else
-        block.()
-      end
-    }
-    @CONF[:MEASURE_CALLBACKS] = []
-
-    @CONF[:LC_MESSAGES] = Locale.new
-
-    @CONF[:AT_EXIT] = []
-
-    @CONF[:COMMAND_ALIASES] = {
-      # Symbol aliases
-      :'$' => :show_source,
-      :'@' => :whereami,
-    }
-  end
-
-  def IRB.set_measure_callback(type = nil, arg = nil, &block)
-    added = nil
-    if type
-      type_sym = type.upcase.to_sym
-      if IRB.conf[:MEASURE_PROC][type_sym]
-        added = [type_sym, IRB.conf[:MEASURE_PROC][type_sym], arg]
-      end
-    elsif IRB.conf[:MEASURE_PROC][:CUSTOM]
-      added = [:CUSTOM, IRB.conf[:MEASURE_PROC][:CUSTOM], arg]
-    elsif block_given?
-      added = [:BLOCK, block, arg]
-      found = IRB.conf[:MEASURE_CALLBACKS].find{ |m| m[0] == added[0] && m[2] == added[2] }
-      if found
-        found[1] = block
-        return added
-      else
-        IRB.conf[:MEASURE_CALLBACKS] << added
-        return added
-      end
-    else
-      added = [:TIME, IRB.conf[:MEASURE_PROC][:TIME], arg]
-    end
-    if added
-      IRB.conf[:MEASURE] = true
-      found = IRB.conf[:MEASURE_CALLBACKS].find{ |m| m[0] == added[0] && m[2] == added[2] }
-      if found
-        # already added
-        nil
-      else
-        IRB.conf[:MEASURE_CALLBACKS] << added if added
-        added
-      end
-    else
-      nil
-    end
-  end
-
-  def IRB.unset_measure_callback(type = nil)
-    if type.nil?
-      IRB.conf[:MEASURE_CALLBACKS].clear
-    else
-      type_sym = type.upcase.to_sym
-      IRB.conf[:MEASURE_CALLBACKS].reject!{ |t, | t == type_sym }
-    end
-    IRB.conf[:MEASURE] = nil if IRB.conf[:MEASURE_CALLBACKS].empty?
-  end
-
-  def IRB.init_error
-    @CONF[:LC_MESSAGES].load("irb/error.rb")
-  end
-
-  # option analyzing
-  def IRB.parse_opts(argv: ::ARGV)
-    load_path = []
-    while opt = argv.shift
-      case opt
-      when "-f"
-        @CONF[:RC] = false
-      when "-d"
-        $DEBUG = true
-        $VERBOSE = true
-      when "-w"
-        Warning[:deprecated] = $VERBOSE = true
-      when /^-W(.+)?/
-        opt = $1 || argv.shift
-        case opt
-        when "0"
-          $VERBOSE = nil
-        when "1"
-          $VERBOSE = false
-        else
-          Warning[:deprecated] = $VERBOSE = true
-        end
-      when /^-r(.+)?/
-        opt = $1 || argv.shift
-        @CONF[:LOAD_MODULES].push opt if opt
-      when /^-I(.+)?/
-        opt = $1 || argv.shift
-        load_path.concat(opt.split(File::PATH_SEPARATOR)) if opt
-      when '-U'
-        set_encoding("UTF-8", "UTF-8")
-      when /^-E(.+)?/, /^--encoding(?:=(.+))?/
-        opt = $1 || argv.shift
-        set_encoding(*opt.split(':', 2))
-      when "--inspect"
-        if /^-/ !~ argv.first
-          @CONF[:INSPECT_MODE] = argv.shift
-        else
-          @CONF[:INSPECT_MODE] = true
-        end
-      when "--noinspect"
-        @CONF[:INSPECT_MODE] = false
-      when "--no-pager"
-        @CONF[:USE_PAGER] = false
-      when "--singleline", "--readline", "--legacy"
-        @CONF[:USE_SINGLELINE] = true
-      when "--nosingleline", "--noreadline"
-        @CONF[:USE_SINGLELINE] = false
-      when "--multiline", "--reidline"
-        if opt == "--reidline"
-          warn <<~MSG.strip
-            --reidline is deprecated, please use --multiline instead.
-          MSG
-        end
-
-        @CONF[:USE_MULTILINE] = true
-      when "--nomultiline", "--noreidline"
-        if opt == "--noreidline"
-          warn <<~MSG.strip
-            --noreidline is deprecated, please use --nomultiline instead.
-          MSG
-        end
-
-        @CONF[:USE_MULTILINE] = false
-      when /^--extra-doc-dir(?:=(.+))?/
-        opt = $1 || argv.shift
-        @CONF[:EXTRA_DOC_DIRS] << opt
-      when "--echo"
-        @CONF[:ECHO] = true
-      when "--noecho"
-        @CONF[:ECHO] = false
-      when "--echo-on-assignment"
-        @CONF[:ECHO_ON_ASSIGNMENT] = true
-      when "--noecho-on-assignment"
-        @CONF[:ECHO_ON_ASSIGNMENT] = false
-      when "--truncate-echo-on-assignment"
-        @CONF[:ECHO_ON_ASSIGNMENT] = :truncate
-      when "--verbose"
-        @CONF[:VERBOSE] = true
-      when "--noverbose"
-        @CONF[:VERBOSE] = false
-      when "--colorize"
-        @CONF[:USE_COLORIZE] = true
-      when "--nocolorize"
-        @CONF[:USE_COLORIZE] = false
-      when "--autocomplete"
-        @CONF[:USE_AUTOCOMPLETE] = true
-      when "--noautocomplete"
-        @CONF[:USE_AUTOCOMPLETE] = false
-      when "--regexp-completor"
-        @CONF[:COMPLETOR] = :regexp
-      when "--type-completor"
-        @CONF[:COMPLETOR] = :type
-      when /^--prompt-mode(?:=(.+))?/, /^--prompt(?:=(.+))?/
-        opt = $1 || argv.shift
-        prompt_mode = opt.upcase.tr("-", "_").intern
-        @CONF[:PROMPT_MODE] = prompt_mode
-      when "--noprompt"
-        @CONF[:PROMPT_MODE] = :NULL
-      when "--script"
-        noscript = false
-      when "--noscript"
-        noscript = true
-      when "--inf-ruby-mode"
-        @CONF[:PROMPT_MODE] = :INF_RUBY
-      when "--sample-book-mode", "--simple-prompt"
-        @CONF[:PROMPT_MODE] = :SIMPLE
-      when "--tracer"
-        @CONF[:USE_TRACER] = true
-      when /^--back-trace-limit(?:=(.+))?/
-        @CONF[:BACK_TRACE_LIMIT] = ($1 || argv.shift).to_i
-      when /^--context-mode(?:=(.+))?/
-        @CONF[:CONTEXT_MODE] = ($1 || argv.shift).to_i
-      when "--single-irb"
-        @CONF[:SINGLE_IRB] = true
-      when "-v", "--version"
-        print IRB.version, "\n"
-        exit 0
-      when "-h", "--help"
-        require_relative "help"
-        IRB.print_usage
-        exit 0
-      when "--"
-        if !noscript && (opt = argv.shift)
-          @CONF[:SCRIPT] = opt
-          $0 = opt
-        end
-        break
-      when /^-./
-        fail UnrecognizedSwitch, opt
-      else
-        if noscript
-          argv.unshift(opt)
-        else
-          @CONF[:SCRIPT] = opt
-          $0 = opt
-        end
-        break
-      end
-    end
-
-    load_path.collect! do |path|
-      /\A\.\// =~ path ? path : File.expand_path(path)
-    end
-    $LOAD_PATH.unshift(*load_path)
-  end
-
-  # Run the config file
-  def IRB.run_config
-    if @CONF[:RC]
-      irbrc_files.each do |rc|
-        load rc
-      rescue StandardError, ScriptError => e
-        warn "Error loading RC file '#{rc}':\n#{e.full_message(highlight: false)}"
-      end
-    end
-  end
-
-  IRBRC_EXT = "rc"
-
-  def IRB.rc_file(ext)
-    prepare_irbrc_name_generators
-
-    # When irbrc exist in default location
-    if (rcgen = @existing_rc_name_generators.first)
-      return rcgen.call(ext)
-    end
-
-    # When irbrc does not exist in default location
-    rc_file_generators do |rcgen|
-      return rcgen.call(ext)
-    end
-
-    # When HOME and XDG_CONFIG_HOME are not available
-    nil
-  end
-
-  def IRB.irbrc_files
-    prepare_irbrc_name_generators
-    @irbrc_files
-  end
-
-  def IRB.validate_config
-    conf[:IRB_NAME] = conf[:IRB_NAME].to_s
-
-    irb_rc = conf[:IRB_RC]
-    unless irb_rc.nil? || irb_rc.respond_to?(:call)
-      raise_validation_error "IRB.conf[:IRB_RC] should be a callable object. Got #{irb_rc.inspect}."
-    end
-
-    back_trace_limit = conf[:BACK_TRACE_LIMIT]
-    unless back_trace_limit.is_a?(Integer)
-      raise_validation_error "IRB.conf[:BACK_TRACE_LIMIT] should be an integer. Got #{back_trace_limit.inspect}."
-    end
-
-    prompt = conf[:PROMPT]
-    unless prompt.is_a?(Hash)
-      msg = "IRB.conf[:PROMPT] should be a Hash. Got #{prompt.inspect}."
-
-      if prompt.is_a?(Symbol)
-        msg += " Did you mean to set `IRB.conf[:PROMPT_MODE]`?"
-      end
-
-      raise_validation_error msg
-    end
-
-    eval_history = conf[:EVAL_HISTORY]
-    unless eval_history.nil? || eval_history.is_a?(Integer)
-      raise_validation_error "IRB.conf[:EVAL_HISTORY] should be an integer. Got #{eval_history.inspect}."
-    end
-  end
-
-  def IRB.raise_validation_error(msg)
-    raise TypeError, msg, @irbrc_files
-  end
-
-  # loading modules
-  def IRB.load_modules
-    for m in @CONF[:LOAD_MODULES]
-      begin
-        require m
-      rescue LoadError => err
-        warn "#{err.class}: #{err}", uplevel: 0
-      end
-    end
-  end
-
-  class << IRB
-    private
-
-    def prepare_irbrc_name_generators
-      return if @existing_rc_name_generators
-
-      @existing_rc_name_generators = []
-      @irbrc_files = []
-      rc_file_generators do |rcgen|
-        irbrc = rcgen.call(IRBRC_EXT)
-        if File.exist?(irbrc)
-          @irbrc_files << irbrc
-          @existing_rc_name_generators << rcgen
-        end
-      end
-      generate_current_dir_irbrc_files.each do |irbrc|
-        @irbrc_files << irbrc if File.exist?(irbrc)
-      end
-      @irbrc_files.uniq!
-    end
-
-    # enumerate possible rc-file base name generators
-    def rc_file_generators
-      if irbrc = ENV["IRBRC"]
-        yield proc{|rc| rc == "rc" ? irbrc : irbrc+rc}
-      end
-      if xdg_config_home = ENV["XDG_CONFIG_HOME"]
-        irb_home = File.join(xdg_config_home, "irb")
-        if File.directory?(irb_home)
-          yield proc{|rc| irb_home + "/irb#{rc}"}
-        end
-      end
-      if home = ENV["HOME"]
-        yield proc{|rc| home+"/.irb#{rc}"}
-        if xdg_config_home.nil? || xdg_config_home.empty?
-          yield proc{|rc| home+"/.config/irb/irb#{rc}"}
-        end
-      end
-    end
-
-    # possible irbrc files in current directory
-    def generate_current_dir_irbrc_files
-      current_dir = Dir.pwd
-      %w[.irbrc irbrc _irbrc $irbrc].map { |file| "#{current_dir}/#{file}" }
-    end
-
-    def set_encoding(extern, intern = nil, override: true)
-      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
-      if override
-        @CONF[:LC_MESSAGES].instance_variable_set(:@override_encoding, extern)
-      else
-        @CONF[:LC_MESSAGES].instance_variable_set(:@encoding, extern)
-      end
-    ensure
-      $VERBOSE = verbose
-    end
-  end
-end
diff --git a/lib/irb/input-method.rb b/lib/irb/input-method.rb
deleted file mode 100644
index ced35a2c5a..0000000000
--- a/lib/irb/input-method.rb
+++ /dev/null
@@ -1,514 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/input-method.rb - input methods used irb
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative 'completion'
-require_relative "history"
-require 'io/console'
-require 'reline'
-
-module IRB
-  class InputMethod
-    BASIC_WORD_BREAK_CHARACTERS = " \t\n`><=;|&{("
-
-    # The irb prompt associated with this input method
-    attr_accessor :prompt
-
-    # Reads the next line from this input method.
-    #
-    # See IO#gets for more information.
-    def gets
-      fail NotImplementedError
-    end
-    public :gets
-
-    def winsize
-      if instance_variable_defined?(:@stdout) && @stdout.tty?
-        @stdout.winsize
-      else
-        [24, 80]
-      end
-    end
-
-    # Whether this input method is still readable when there is no more data to
-    # read.
-    #
-    # See IO#eof for more information.
-    def readable_after_eof?
-      false
-    end
-
-    def support_history_saving?
-      false
-    end
-
-    def prompting?
-      false
-    end
-
-    # For debug message
-    def inspect
-      'Abstract InputMethod'
-    end
-  end
-
-  class StdioInputMethod < InputMethod
-    # Creates a new input method object
-    def initialize
-      @line_no = 0
-      @line = []
-      @stdin = IO.open(STDIN.to_i, :external_encoding => IRB.conf[:LC_MESSAGES].encoding, :internal_encoding => "-")
-      @stdout = IO.open(STDOUT.to_i, 'w', :external_encoding => IRB.conf[:LC_MESSAGES].encoding, :internal_encoding => "-")
-    end
-
-    # Reads the next line from this input method.
-    #
-    # See IO#gets for more information.
-    def gets
-      puts if @stdout.tty? # workaround for debug compatibility test
-      print @prompt
-      line = @stdin.gets
-      @line[@line_no += 1] = line
-    end
-
-    # Whether the end of this input method has been reached, returns +true+ if
-    # there is no more data to read.
-    #
-    # See IO#eof? for more information.
-    def eof?
-      if @stdin.wait_readable(0.00001)
-        c = @stdin.getc
-        result = c.nil? ? true : false
-        @stdin.ungetc(c) unless c.nil?
-        result
-      else # buffer is empty
-        false
-      end
-    end
-
-    # Whether this input method is still readable when there is no more data to
-    # read.
-    #
-    # See IO#eof for more information.
-    def readable_after_eof?
-      true
-    end
-
-    def prompting?
-      STDIN.tty?
-    end
-
-    # Returns the current line number for #io.
-    #
-    # #line counts the number of times #gets is called.
-    #
-    # See IO#lineno for more information.
-    def line(line_no)
-      @line[line_no]
-    end
-
-    # The external encoding for standard input.
-    def encoding
-      @stdin.external_encoding
-    end
-
-    # For debug message
-    def inspect
-      'StdioInputMethod'
-    end
-  end
-
-  # Use a File for IO with irb, see InputMethod
-  class FileInputMethod < InputMethod
-    class << self
-      def open(file, &block)
-        begin
-          io = new(file)
-          block.call(io)
-        ensure
-          io&.close
-        end
-      end
-    end
-
-    # Creates a new input method object
-    def initialize(file)
-      @io = file.is_a?(IO) ? file : File.open(file)
-      @external_encoding = @io.external_encoding
-    end
-
-    # Whether the end of this input method has been reached, returns +true+ if
-    # there is no more data to read.
-    #
-    # See IO#eof? for more information.
-    def eof?
-      @io.closed? || @io.eof?
-    end
-
-    # Reads the next line from this input method.
-    #
-    # See IO#gets for more information.
-    def gets
-      print @prompt
-      @io.gets
-    end
-
-    # The external encoding for standard input.
-    def encoding
-      @external_encoding
-    end
-
-    # For debug message
-    def inspect
-      'FileInputMethod'
-    end
-
-    def close
-      @io.close
-    end
-  end
-
-  class ReadlineInputMethod < StdioInputMethod
-    def self.initialize_readline
-      require "readline"
-    rescue LoadError
-    else
-      include ::Readline
-    end
-
-    include HistorySavingAbility
-
-    # Creates a new input method object using Readline
-    def initialize
-      self.class.initialize_readline
-      if Readline.respond_to?(:encoding_system_needs)
-        IRB.__send__(:set_encoding, Readline.encoding_system_needs.name, override: false)
-      end
-
-      super
-
-      @eof = false
-      @completor = RegexpCompletor.new
-
-      if Readline.respond_to?("basic_word_break_characters=")
-        Readline.basic_word_break_characters = BASIC_WORD_BREAK_CHARACTERS
-      end
-      Readline.completion_append_character = nil
-      Readline.completion_proc = ->(target) {
-        bind = IRB.conf[:MAIN_CONTEXT].workspace.binding
-        @completor.completion_candidates('', target, '', bind: bind)
-      }
-    end
-
-    def completion_info
-      'RegexpCompletor'
-    end
-
-    # Reads the next line from this input method.
-    #
-    # See IO#gets for more information.
-    def gets
-      Readline.input = @stdin
-      Readline.output = @stdout
-      if l = readline(@prompt, false)
-        HISTORY.push(l) if !l.empty?
-        @line[@line_no += 1] = l + "\n"
-      else
-        @eof = true
-        l
-      end
-    end
-
-    # Whether the end of this input method has been reached, returns +true+
-    # if there is no more data to read.
-    #
-    # See IO#eof? for more information.
-    def eof?
-      @eof
-    end
-
-    def prompting?
-      true
-    end
-
-    # For debug message
-    def inspect
-      readline_impl = (defined?(Reline) && Readline == Reline) ? 'Reline' : 'ext/readline'
-      str = "ReadlineInputMethod with #{readline_impl} #{Readline::VERSION}"
-      inputrc_path = File.expand_path(ENV['INPUTRC'] || '~/.inputrc')
-      str += " and #{inputrc_path}" if File.exist?(inputrc_path)
-      str
-    end
-  end
-
-  class RelineInputMethod < StdioInputMethod
-    HISTORY = Reline::HISTORY
-    include HistorySavingAbility
-    # Creates a new input method object using Reline
-    def initialize(completor)
-      IRB.__send__(:set_encoding, Reline.encoding_system_needs.name, override: false)
-
-      super()
-
-      @eof = false
-      @completor = completor
-
-      Reline.basic_word_break_characters = BASIC_WORD_BREAK_CHARACTERS
-      Reline.completion_append_character = nil
-      Reline.completer_quote_characters = ''
-      Reline.completion_proc = ->(target, preposing, postposing) {
-        bind = IRB.conf[:MAIN_CONTEXT].workspace.binding
-        @completion_params = [preposing, target, postposing, bind]
-        @completor.completion_candidates(preposing, target, postposing, bind: bind)
-      }
-      Reline.output_modifier_proc =
-        if IRB.conf[:USE_COLORIZE]
-          proc do |output, complete: |
-            next unless IRB::Color.colorable?
-            lvars = IRB.CurrentContext&.local_variables || []
-            IRB::Color.colorize_code(output, complete: complete, local_variables: lvars)
-          end
-        else
-          proc do |output|
-            Reline::Unicode.escape_for_print(output)
-          end
-        end
-      Reline.dig_perfect_match_proc = ->(matched) { display_document(matched) }
-      Reline.autocompletion = IRB.conf[:USE_AUTOCOMPLETE]
-
-      if IRB.conf[:USE_AUTOCOMPLETE]
-        begin
-          require 'rdoc'
-          Reline.add_dialog_proc(:show_doc, show_doc_dialog_proc, Reline::DEFAULT_DIALOG_CONTEXT)
-        rescue LoadError
-        end
-      end
-    end
-
-    def completion_info
-      autocomplete_message = Reline.autocompletion ? 'Autocomplete' : 'Tab Complete'
-      "#{autocomplete_message}, #{@completor.inspect}"
-    end
-
-    def check_termination(&block)
-      @check_termination_proc = block
-    end
-
-    def dynamic_prompt(&block)
-      @prompt_proc = block
-    end
-
-    def auto_indent(&block)
-      @auto_indent_proc = block
-    end
-
-    def retrieve_doc_namespace(matched)
-      preposing, _target, postposing, bind = @completion_params
-      @completor.doc_namespace(preposing, matched, postposing, bind: bind)
-    end
-
-    def rdoc_ri_driver
-      return @rdoc_ri_driver if defined?(@rdoc_ri_driver)
-
-      begin
-        require 'rdoc'
-      rescue LoadError
-        @rdoc_ri_driver = nil
-      else
-        options = {}
-        options[:extra_doc_dirs] = IRB.conf[:EXTRA_DOC_DIRS] unless IRB.conf[:EXTRA_DOC_DIRS].empty?
-        @rdoc_ri_driver = RDoc::RI::Driver.new(options)
-      end
-    end
-
-    def show_doc_dialog_proc
-      input_method = self # self is changed in the lambda below.
-      ->() {
-        dialog.trap_key = nil
-        alt_d = [
-          [27, 100], # Normal Alt+d when convert-meta isn't used.
-          # When option/alt is not configured as a meta key in terminal emulator,
-          # option/alt + d will send a unicode character depend on OS keyboard setting.
-          [195, 164], # "ä" in somewhere (FIXME: environment information is unknown).
-          [226, 136, 130] # "∂" Alt+d on Mac keyboard.
-        ]
-
-        if just_cursor_moving and completion_journey_data.nil?
-          return nil
-        end
-        cursor_pos_to_render, result, pointer, autocomplete_dialog = context.pop(4)
-        return nil if result.nil? or pointer.nil? or pointer < 0
-
-        name = input_method.retrieve_doc_namespace(result[pointer])
-        # Use first one because document dialog does not support multiple namespaces.
-        name = name.first if name.is_a?(Array)
-
-        show_easter_egg = name&.match?(/\ARubyVM/) && !ENV['RUBY_YES_I_AM_NOT_A_NORMAL_USER']
-
-        driver = input_method.rdoc_ri_driver
-
-        if key.match?(dialog.name)
-          if show_easter_egg
-            IRB.__send__(:easter_egg)
-          else
-            begin
-              driver.display_names([name])
-            rescue RDoc::RI::Driver::NotFoundError
-            end
-          end
-        end
-
-        begin
-          name = driver.expand_name(name)
-        rescue RDoc::RI::Driver::NotFoundError
-          return nil
-        rescue
-          return nil # unknown error
-        end
-        doc = nil
-        used_for_class = false
-        if not name =~ /#|\./
-          found, klasses, includes, extends = driver.classes_and_includes_and_extends_for(name)
-          if not found.empty?
-            doc = driver.class_document(name, found, klasses, includes, extends)
-            used_for_class = true
-          end
-        end
-        unless used_for_class
-          doc = RDoc::Markup::Document.new
-          begin
-            driver.add_method(doc, name)
-          rescue RDoc::RI::Driver::NotFoundError
-            doc = nil
-          rescue
-            return nil # unknown error
-          end
-        end
-        return nil if doc.nil?
-        width = 40
-
-        right_x = cursor_pos_to_render.x + autocomplete_dialog.width
-        if right_x + width > screen_width
-          right_width = screen_width - (right_x + 1)
-          left_x = autocomplete_dialog.column - width
-          left_x = 0 if left_x < 0
-          left_width = width > autocomplete_dialog.column ? autocomplete_dialog.column : width
-          if right_width.positive? and left_width.positive?
-            if right_width >= left_width
-              width = right_width
-              x = right_x
-            else
-              width = left_width
-              x = left_x
-            end
-          elsif right_width.positive? and left_width <= 0
-            width = right_width
-            x = right_x
-          elsif right_width <= 0 and left_width.positive?
-            width = left_width
-            x = left_x
-          else # Both are negative width.
-            return nil
-          end
-        else
-          x = right_x
-        end
-        formatter = RDoc::Markup::ToAnsi.new
-        formatter.width = width
-        dialog.trap_key = alt_d
-        mod_key = RUBY_PLATFORM.match?(/darwin/) ? "Option" : "Alt"
-        if show_easter_egg
-          type = STDOUT.external_encoding == Encoding::UTF_8 ? :unicode : :ascii
-          contents = IRB.send(:easter_egg_logo, type).split("\n")
-          message = "Press #{mod_key}+d to see more"
-          contents[0][0, message.size] = message
-        else
-          message = "Press #{mod_key}+d to read the full document"
-          contents = [message] + doc.accept(formatter).split("\n")
-        end
-        contents = contents.take(preferred_dialog_height)
-
-        y = cursor_pos_to_render.y
-        Reline::DialogRenderInfo.new(pos: Reline::CursorPos.new(x, y), contents: contents, width: width, bg_color: '49')
-      }
-    end
-
-    def display_document(matched)
-      driver = rdoc_ri_driver
-      return unless driver
-
-      if matched =~ /\A(?:::)?RubyVM/ and not ENV['RUBY_YES_I_AM_NOT_A_NORMAL_USER']
-        IRB.__send__(:easter_egg)
-        return
-      end
-
-      namespace = retrieve_doc_namespace(matched)
-      return unless namespace
-
-      if namespace.is_a?(Array)
-        out = RDoc::Markup::Document.new
-        namespace.each do |m|
-          begin
-            driver.add_method(out, m)
-          rescue RDoc::RI::Driver::NotFoundError
-          end
-        end
-        driver.display(out)
-      else
-        begin
-          driver.display_names([namespace])
-        rescue RDoc::RI::Driver::NotFoundError
-        end
-      end
-    end
-
-    # Reads the next line from this input method.
-    #
-    # See IO#gets for more information.
-    def gets
-      Reline.input = @stdin
-      Reline.output = @stdout
-      Reline.prompt_proc = @prompt_proc
-      Reline.auto_indent_proc = @auto_indent_proc if @auto_indent_proc
-      if l = Reline.readmultiline(@prompt, false, &@check_termination_proc)
-        Reline::HISTORY.push(l) if !l.empty?
-        @line[@line_no += 1] = l + "\n"
-      else
-        @eof = true
-        l
-      end
-    end
-
-    # Whether the end of this input method has been reached, returns +true+
-    # if there is no more data to read.
-    #
-    # See IO#eof? for more information.
-    def eof?
-      @eof
-    end
-
-    def prompting?
-      true
-    end
-
-    # For debug message
-    def inspect
-      config = Reline::Config.new
-      str = "RelineInputMethod with Reline #{Reline::VERSION}"
-      inputrc_path = File.expand_path(config.inputrc_path)
-      str += " and #{inputrc_path}" if File.exist?(inputrc_path)
-      str
-    end
-  end
-
-  class ReidlineInputMethod < RelineInputMethod
-    def initialize
-      warn <<~MSG.strip
-        IRB::ReidlineInputMethod is deprecated, please use IRB::RelineInputMethod instead.
-      MSG
-      super
-    end
-  end
-end
diff --git a/lib/irb/inspector.rb b/lib/irb/inspector.rb
deleted file mode 100644
index 667087ccba..0000000000
--- a/lib/irb/inspector.rb
+++ /dev/null
@@ -1,130 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/inspector.rb - inspect methods
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-
-
-  # Convenience method to create a new Inspector, using the given +inspect+
-  # proc, and optional +init+ proc and passes them to Inspector.new
-  #
-  #     irb(main):001:0> ins = IRB::Inspector(proc{ |v| "omg! #{v}" })
-  #     irb(main):001:0> IRB.CurrentContext.inspect_mode = ins # => omg! #<IRB::Inspector:0x007f46f7ba7d28>
-  #     irb(main):001:0> "what?" #=> omg! what?
-  #
-  def IRB::Inspector(inspect, init = nil)
-    Inspector.new(inspect, init)
-  end
-
-  # An irb inspector
-  #
-  # In order to create your own custom inspector there are two things you
-  # should be aware of:
-  #
-  # Inspector uses #inspect_value, or +inspect_proc+, for output of return values.
-  #
-  # This also allows for an optional #init+, or +init_proc+, which is called
-  # when the inspector is activated.
-  #
-  # Knowing this, you can create a rudimentary inspector as follows:
-  #
-  #     irb(main):001:0> ins = IRB::Inspector.new(proc{ |v| "omg! #{v}" })
-  #     irb(main):001:0> IRB.CurrentContext.inspect_mode = ins # => omg! #<IRB::Inspector:0x007f46f7ba7d28>
-  #     irb(main):001:0> "what?" #=> omg! what?
-  #
-  class Inspector
-    KERNEL_INSPECT = Object.instance_method(:inspect)
-    # Default inspectors available to irb, this includes:
-    #
-    # +:pp+::       Using Kernel#pretty_inspect
-    # +:yaml+::     Using YAML.dump
-    # +:marshal+::  Using Marshal.dump
-    INSPECTORS = {}
-
-    # Determines the inspector to use where +inspector+ is one of the keys passed
-    # during inspector definition.
-    def self.keys_with_inspector(inspector)
-      INSPECTORS.select{|k, v| v == inspector}.collect{|k, v| k}
-    end
-
-    # Example
-    #
-    #     Inspector.def_inspector(key, init_p=nil){|v| v.inspect}
-    #     Inspector.def_inspector([key1,..], init_p=nil){|v| v.inspect}
-    #     Inspector.def_inspector(key, inspector)
-    #     Inspector.def_inspector([key1,...], inspector)
-    def self.def_inspector(key, arg=nil, &block)
-      if block_given?
-        inspector = IRB::Inspector(block, arg)
-      else
-        inspector = arg
-      end
-
-      case key
-      when Array
-        for k in key
-          def_inspector(k, inspector)
-        end
-      when Symbol
-        INSPECTORS[key] = inspector
-        INSPECTORS[key.to_s] = inspector
-      when String
-        INSPECTORS[key] = inspector
-        INSPECTORS[key.intern] = inspector
-      else
-        INSPECTORS[key] = inspector
-      end
-    end
-
-    # Creates a new inspector object, using the given +inspect_proc+ when
-    # output return values in irb.
-    def initialize(inspect_proc, init_proc = nil)
-      @init = init_proc
-      @inspect = inspect_proc
-    end
-
-    # Proc to call when the inspector is activated, good for requiring
-    # dependent libraries.
-    def init
-      @init.call if @init
-    end
-
-    # Proc to call when the input is evaluated and output in irb.
-    def inspect_value(v)
-      @inspect.call(v)
-    rescue => e
-      puts "An error occurred when inspecting the object: #{e.inspect}"
-
-      begin
-        puts "Result of Kernel#inspect: #{KERNEL_INSPECT.bind_call(v)}"
-        ''
-      rescue => e
-        puts "An error occurred when running Kernel#inspect: #{e.inspect}"
-        puts e.backtrace.join("\n")
-        ''
-      end
-    end
-  end
-
-  Inspector.def_inspector([false, :to_s, :raw]){|v| v.to_s}
-  Inspector.def_inspector([:p, :inspect]){|v|
-    Color.colorize_code(v.inspect, colorable: Color.colorable? && Color.inspect_colorable?(v))
-  }
-  Inspector.def_inspector([true, :pp, :pretty_inspect], proc{require_relative "color_printer"}){|v|
-    IRB::ColorPrinter.pp(v, +'').chomp
-  }
-  Inspector.def_inspector([:yaml, :YAML], proc{require "yaml"}){|v|
-    begin
-      YAML.dump(v)
-    rescue
-      puts "(can't dump yaml. use inspect)"
-      v.inspect
-    end
-  }
-
-  Inspector.def_inspector([:marshal, :Marshal, :MARSHAL, Marshal]){|v|
-    Marshal.dump(v)
-  }
-end
diff --git a/lib/irb/irb.gemspec b/lib/irb/irb.gemspec
deleted file mode 100644
index b29002f593..0000000000
--- a/lib/irb/irb.gemspec
+++ /dev/null
@@ -1,46 +0,0 @@
-begin
-  require_relative "lib/irb/version"
-rescue LoadError
-  # for Ruby core repository
-  require_relative "version"
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = "irb"
-  spec.version       = IRB::VERSION
-  spec.authors       = ["aycabta", "Keiju ISHITSUKA"]
-  spec.email         = ["aycabta@gmail.com", "keiju@ruby-lang.org"]
-
-  spec.summary       = %q{Interactive Ruby command-line tool for REPL (Read Eval Print Loop).}
-  spec.description   = %q{Interactive Ruby command-line tool for REPL (Read Eval Print Loop).}
-  spec.homepage      = "https://github.com/ruby/irb"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = spec.homepage
-  spec.metadata["documentation_uri"] = spec.homepage
-  spec.metadata["changelog_uri"] = "#{spec.homepage}/releases"
-
-  spec.files         = [
-    ".document",
-    "Gemfile",
-    "LICENSE.txt",
-    "README.md",
-    "Rakefile",
-    "bin/console",
-    "bin/setup",
-    "doc/irb/irb-tools.rd.ja",
-    "doc/irb/irb.rd.ja",
-    "exe/irb",
-    "irb.gemspec",
-    "man/irb.1",
-  ] + Dir.glob("lib/**/*")
-  spec.bindir        = "exe"
-  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib"]
-
-  spec.required_ruby_version = Gem::Requirement.new(">= 2.7")
-
-  spec.add_dependency "reline", ">= 0.4.2"
-  spec.add_dependency "rdoc", ">= 4.0.0"
-end
diff --git a/lib/irb/lc/error.rb b/lib/irb/lc/error.rb
deleted file mode 100644
index ee0f047822..0000000000
--- a/lib/irb/lc/error.rb
+++ /dev/null
@@ -1,52 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/lc/error.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  # :stopdoc:
-
-  class UnrecognizedSwitch < StandardError
-    def initialize(val)
-      super("Unrecognized switch: #{val}")
-    end
-  end
-  class CantReturnToNormalMode < StandardError
-    def initialize
-      super("Can't return to normal mode.")
-    end
-  end
-  class IllegalParameter < StandardError
-    def initialize(val)
-      super("Invalid parameter(#{val}).")
-    end
-  end
-  class IrbAlreadyDead < StandardError
-    def initialize
-      super("Irb is already dead.")
-    end
-  end
-  class IrbSwitchedToCurrentThread < StandardError
-    def initialize
-      super("Switched to current thread.")
-    end
-  end
-  class NoSuchJob < StandardError
-    def initialize(val)
-      super("No such job(#{val}).")
-    end
-  end
-  class CantChangeBinding < StandardError
-    def initialize(val)
-      super("Can't change binding to (#{val}).")
-    end
-  end
-  class UndefinedPromptMode < StandardError
-    def initialize(val)
-      super("Undefined prompt mode(#{val}).")
-    end
-  end
-
-  # :startdoc:
-end
diff --git a/lib/irb/lc/help-message b/lib/irb/lc/help-message
deleted file mode 100644
index 37347306e8..0000000000
--- a/lib/irb/lc/help-message
+++ /dev/null
@@ -1,55 +0,0 @@
-Usage:  irb.rb [options] [programfile] [arguments]
-  -f                Don't initialize from configuration file.
-  -d                Set $DEBUG and $VERBOSE to true (same as 'ruby -d').
-  -r load-module    Require load-module (same as 'ruby -r').
-  -I path           Specify $LOAD_PATH directory (same as 'ruby -I').
-  -U                Set external and internal encodings to UTF-8.
-  -E ex[:in]        Set default external (ex) and internal (in) encodings
-                    (same as 'ruby -E').
-  -w                Suppress warnings (same as 'ruby -w').
-  -W[level=2]       Set warning level: 0=silence, 1=medium, 2=verbose
-                    (same as 'ruby -W').
-  --context-mode n  Set n[0-4] to method to create Binding Object,
-                    when new workspace was created.
-  --extra-doc-dir   Add an extra doc dir for the doc dialog.
-  --echo            Show result (default).
-  --noecho          Don't show result.
-  --echo-on-assignment
-                    Show result on assignment.
-  --noecho-on-assignment
-                    Don't show result on assignment.
-  --truncate-echo-on-assignment
-                    Show truncated result on assignment (default).
-  --inspect         Use 'inspect' for output.
-  --noinspect       Don't use 'inspect' for output.
-  --no-pager        Don't use pager.
-  --multiline       Use multiline editor module (default).
-  --nomultiline     Don't use multiline editor module.
-  --singleline      Use single line editor module.
-  --nosingleline    Don't use single line editor module (default).
-  --colorize        Use color-highlighting (default).
-  --nocolorize      Don't use color-highlighting.
-  --autocomplete    Use auto-completion (default).
-  --noautocomplete  Don't use auto-completion.
-  --regexp-completor
-                    Use regexp based completion (default).
-  --type-completor  Use type based completion.
-  --prompt prompt-mode, --prompt-mode prompt-mode
-                    Set prompt mode. Pre-defined prompt modes are:
-                    'default', 'classic', 'simple', 'inf-ruby', 'xmp', 'null'.
-  --inf-ruby-mode   Use prompt appropriate for inf-ruby-mode on emacs.
-                    Suppresses --multiline and --singleline.
-  --sample-book-mode, --simple-prompt
-                    Set prompt mode to 'simple'.
-  --noprompt        Don't output prompt.
-  --script          Script mode (default, treat first argument as script)
-  --noscript        No script mode (leave arguments in argv)
-  --single-irb      Share self with sub-irb.
-  --tracer          Show stack trace for each command.
-  --back-trace-limit n[=16]
-                    Display backtrace top n and bottom n.
-  --verbose         Show details.
-  --noverbose       Don't show details.
-  -v, --version     Print the version of irb.
-  -h, --help        Print help.
-  --                Separate options of irb from the list of command-line args.
diff --git a/lib/irb/lc/ja/error.rb b/lib/irb/lc/ja/error.rb
deleted file mode 100644
index 9e2e5b8870..0000000000
--- a/lib/irb/lc/ja/error.rb
+++ /dev/null
@@ -1,53 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/lc/ja/error.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  # :stopdoc:
-
-  class UnrecognizedSwitch < StandardError
-    def initialize(val)
-      super("スイッチ(#{val})が分りません")
-    end
-  end
-  class CantReturnToNormalMode < StandardError
-    def initialize
-      super("Normalモードに戻れません.")
-    end
-  end
-  class IllegalParameter < StandardError
-    def initialize(val)
-      super("パラメータ(#{val})が間違っています.")
-    end
-  end
-  class IrbAlreadyDead < StandardError
-    def initialize
-      super("Irbは既に死んでいます.")
-    end
-  end
-  class IrbSwitchedToCurrentThread < StandardError
-    def initialize
-      super("カレントスレッドに切り替わりました.")
-    end
-  end
-  class NoSuchJob < StandardError
-    def initialize(val)
-      super("そのようなジョブ(#{val})はありません.")
-    end
-  end
-  class CantChangeBinding < StandardError
-    def initialize(val)
-      super("バインディング(#{val})に変更できません.")
-    end
-  end
-  class UndefinedPromptMode < StandardError
-    def initialize(val)
-      super("プロンプトモード(#{val})は定義されていません.")
-    end
-  end
-
-  # :startdoc:
-end
-# vim:fileencoding=utf-8
diff --git a/lib/irb/lc/ja/help-message b/lib/irb/lc/ja/help-message
deleted file mode 100644
index 99f4449b3b..0000000000
--- a/lib/irb/lc/ja/help-message
+++ /dev/null
@@ -1,58 +0,0 @@
-Usage:  irb.rb [options] [programfile] [arguments]
-  -f		    ~/.irbrc を読み込まない.
-  -d                $DEBUG をtrueにする(ruby -d と同じ)
-  -r load-module    ruby -r と同じ.
-  -I path           $LOAD_PATH に path を追加する.
-  -U                ruby -U と同じ.
-  -E enc            ruby -E と同じ.
-  -w                ruby -w と同じ.
-  -W[level=2]       ruby -W と同じ.
-  --context-mode n  新しいワークスペースを作成した時に関連する Binding
-		    オブジェクトの作成方法を 0 から 3 のいずれかに設定する.
-  --extra-doc-dir   指定したディレクトリのドキュメントを追加で読み込む.
-  --echo	    実行結果を表示する(デフォルト).
-  --noecho	    実行結果を表示しない.
-  --echo-on-assignment
-                    代入結果を表示する.
-  --noecho-on-assignment
-                    代入結果を表示しない.
-  --truncate-echo-on-assignment
-                    truncateされた代入結果を表示する(デフォルト).
-  --inspect	    結果出力にinspectを用いる.
-  --noinspect	    結果出力にinspectを用いない.
-  --no-pager        ページャを使用しない.
-  --multiline       マルチラインエディタを利用する.
-  --nomultiline     マルチラインエディタを利用しない.
-  --singleline      シングルラインエディタを利用する.
-  --nosingleline    シングルラインエディタを利用しない.
-  --colorize	    色付けを利用する.
-  --nocolorize	    色付けを利用しない.
-  --autocomplete    オートコンプリートを利用する.
-  --noautocomplete  オートコンプリートを利用しない.
-  --regexp-completor
-                    補完に正規表現を利用する.
-  --type-completor  補完に型情報を利用する.
-  --prompt prompt-mode/--prompt-mode prompt-mode
-		    プロンプトモードを切替えます. 現在定義されているプ
-		    ロンプトモードは, default, simple, xmp, inf-rubyが
-		    用意されています.
-  --inf-ruby-mode   emacsのinf-ruby-mode用のプロンプト表示を行なう. 特
-                    に指定がない限り, シングルラインエディタとマルチラ
-                    インエディタは使わなくなる.
-  --sample-book-mode/--simple-prompt
-		    非常にシンプルなプロンプトを用いるモードです.
-  --noprompt	    プロンプト表示を行なわない.
-  --script          スクリプトモード(最初の引数をスクリプトファイルとして扱う、デフォルト)
-  --noscript        引数をargvとして扱う.
-  --single-irb	    irb 中で self を実行して得られるオブジェクトをサ
-		    ブ irb と共有する.
-  --tracer	    コマンド実行時にトレースを行なう.
-  --back-trace-limit n
-		    バックトレース表示をバックトレースの頭から n, 後ろ
-		    からnだけ行なう. デフォルトは16
-
-  --verbose	    詳細なメッセージを出力する.
-  --noverbose	    詳細なメッセージを出力しない(デフォルト).
-  -v, --version	    irbのバージョンを表示する.
-  -h, --help	    irb のヘルプを表示する.
-  --		    以降のコマンドライン引数をオプションとして扱わない.
diff --git a/lib/irb/locale.rb b/lib/irb/locale.rb
deleted file mode 100644
index 2abcc7354b..0000000000
--- a/lib/irb/locale.rb
+++ /dev/null
@@ -1,153 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/locale.rb - internationalization module
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB # :nodoc:
-  class Locale
-
-    LOCALE_NAME_RE = %r[
-      (?<language>[[:alpha:]]{2,3})
-      (?:_  (?<territory>[[:alpha:]]{2,3}) )?
-      (?:\. (?<codeset>[^@]+) )?
-      (?:@  (?<modifier>.*) )?
-    ]x
-    LOCALE_DIR = "/lc/"
-
-    LEGACY_ENCODING_ALIAS_MAP = {
-      'ujis' => Encoding::EUC_JP,
-      'euc' => Encoding::EUC_JP
-    }
-
-    @@loaded = []
-
-    def initialize(locale = nil)
-      @override_encoding = nil
-      @lang = @territory = @encoding_name = @modifier = nil
-      @locale = locale || ENV["IRB_LANG"] || ENV["LC_MESSAGES"] || ENV["LC_ALL"] || ENV["LANG"] || "C"
-      if m = LOCALE_NAME_RE.match(@locale)
-        @lang, @territory, @encoding_name, @modifier = m[:language], m[:territory], m[:codeset], m[:modifier]
-
-        if @encoding_name
-          if @encoding = LEGACY_ENCODING_ALIAS_MAP[@encoding_name]
-            warn(("%s is obsolete. use %s" % ["#{@lang}_#{@territory}.#{@encoding_name}", "#{@lang}_#{@territory}.#{@encoding.name}"]), uplevel: 1)
-          else
-            @encoding = Encoding.find(@encoding_name) rescue nil
-          end
-        end
-      end
-      @encoding ||= (Encoding.find('locale') rescue Encoding::ASCII_8BIT)
-    end
-
-    attr_reader :lang, :territory, :modifier
-
-    def encoding
-      @override_encoding || @encoding
-    end
-
-    def String(mes)
-      mes = super(mes)
-      if encoding
-        mes.encode(encoding, undef: :replace)
-      else
-        mes
-      end
-    end
-
-    def format(*opts)
-      String(super(*opts))
-    end
-
-    def gets(*rs)
-      String(super(*rs))
-    end
-
-    def readline(*rs)
-      String(super(*rs))
-    end
-
-    def print(*opts)
-      ary = opts.collect{|opt| String(opt)}
-      super(*ary)
-    end
-
-    def printf(*opts)
-      s = format(*opts)
-      print s
-    end
-
-    def puts(*opts)
-      ary = opts.collect{|opt| String(opt)}
-      super(*ary)
-    end
-
-    def load(file)
-      found = find(file)
-      if found
-        unless @@loaded.include?(found)
-          @@loaded << found # cache
-          Kernel.load(found)
-        end
-      else
-        raise LoadError, "No such file to load -- #{file}"
-      end
-    end
-
-    def find(file, paths = $:)
-      dir = File.dirname(file)
-      dir = "" if dir == "."
-      base = File.basename(file)
-
-      if dir.start_with?('/')
-        return each_localized_path(dir, base).find{|full_path| File.readable? full_path}
-      else
-        return search_file(paths, dir, base)
-      end
-    end
-
-    # @param paths load paths in which IRB find a localized file.
-    # @param dir directory
-    # @param file basename to be localized
-    #
-    # typically, for the parameters and a <path> in paths, it searches
-    #   <path>/<dir>/<locale>/<file>
-    def search_file(lib_paths, dir, file)
-      each_localized_path(dir, file) do |lc_path|
-        lib_paths.each do |libpath|
-          full_path = File.join(libpath, lc_path)
-          return full_path if File.readable?(full_path)
-        end
-        redo if defined?(Gem) and Gem.try_activate(lc_path)
-      end
-      nil
-    end
-
-    def each_localized_path(dir, file)
-      return enum_for(:each_localized_path) unless block_given?
-      each_sublocale do |lc|
-        yield lc.nil? ? File.join(dir, LOCALE_DIR, file) : File.join(dir, LOCALE_DIR, lc, file)
-      end
-    end
-
-    def each_sublocale
-      if @lang
-        if @territory
-          if @encoding_name
-            yield "#{@lang}_#{@territory}.#{@encoding_name}@#{@modifier}" if @modifier
-            yield "#{@lang}_#{@territory}.#{@encoding_name}"
-          end
-          yield "#{@lang}_#{@territory}@#{@modifier}" if @modifier
-          yield "#{@lang}_#{@territory}"
-        end
-        if @encoding_name
-          yield "#{@lang}.#{@encoding_name}@#{@modifier}" if @modifier
-          yield "#{@lang}.#{@encoding_name}"
-        end
-        yield "#{@lang}@#{@modifier}" if @modifier
-        yield "#{@lang}"
-      end
-      yield nil
-    end
-  end
-end
diff --git a/lib/irb/nesting_parser.rb b/lib/irb/nesting_parser.rb
deleted file mode 100644
index 5aa940cc28..0000000000
--- a/lib/irb/nesting_parser.rb
+++ /dev/null
@@ -1,237 +0,0 @@
-# frozen_string_literal: true
-module IRB
-  module NestingParser
-    IGNORE_TOKENS = %i[on_sp on_ignored_nl on_comment on_embdoc_beg on_embdoc on_embdoc_end]
-
-    # Scan each token and call the given block with array of token and other information for parsing
-    def self.scan_opens(tokens)
-      opens = []
-      pending_heredocs = []
-      first_token_on_line = true
-      tokens.each do |t|
-        skip = false
-        last_tok, state, args = opens.last
-        case state
-        when :in_alias_undef
-          skip = t.event == :on_kw
-        when :in_unquoted_symbol
-          unless IGNORE_TOKENS.include?(t.event)
-            opens.pop
-            skip = true
-          end
-        when :in_lambda_head
-          opens.pop if t.event == :on_tlambeg || (t.event == :on_kw && t.tok == 'do')
-        when :in_method_head
-          unless IGNORE_TOKENS.include?(t.event)
-            next_args = []
-            body = nil
-            if args.include?(:receiver)
-              case t.event
-              when :on_lparen, :on_ivar, :on_gvar, :on_cvar
-                # def (receiver). | def @ivar. | def $gvar. | def @@cvar.
-                next_args << :dot
-              when :on_kw
-                case t.tok
-                when 'self', 'true', 'false', 'nil'
-                  # def self(arg) | def self.
-                  next_args.push(:arg, :dot)
-                else
-                  # def if(arg)
-                  skip = true
-                  next_args << :arg
-                end
-              when :on_op, :on_backtick
-                # def +(arg)
-                skip = true
-                next_args << :arg
-              when :on_ident, :on_const
-                # def a(arg) | def a.
-                next_args.push(:arg, :dot)
-              end
-            end
-            if args.include?(:dot)
-              # def receiver.name
-              next_args << :name if t.event == :on_period || (t.event == :on_op && t.tok == '::')
-            end
-            if args.include?(:name)
-              if %i[on_ident on_const on_op on_kw on_backtick].include?(t.event)
-                # def name(arg) | def receiver.name(arg)
-                next_args << :arg
-                skip = true
-              end
-            end
-            if args.include?(:arg)
-              case t.event
-              when :on_nl, :on_semicolon
-                # def receiver.f;
-                body = :normal
-              when :on_lparen
-                # def receiver.f()
-                next_args << :eq
-              else
-                if t.event == :on_op && t.tok == '='
-                  # def receiver.f =
-                  body = :oneliner
-                else
-                  # def receiver.f arg
-                  next_args << :arg_without_paren
-                end
-              end
-            end
-            if args.include?(:eq)
-              if t.event == :on_op && t.tok == '='
-                body = :oneliner
-              else
-                body = :normal
-              end
-            end
-            if args.include?(:arg_without_paren)
-              if %i[on_semicolon on_nl].include?(t.event)
-                # def f a;
-                body = :normal
-              else
-                # def f a, b
-                next_args << :arg_without_paren
-              end
-            end
-            if body == :oneliner
-              opens.pop
-            elsif body
-              opens[-1] = [last_tok, nil]
-            else
-              opens[-1] = [last_tok, :in_method_head, next_args]
-            end
-          end
-        when :in_for_while_until_condition
-          if t.event == :on_semicolon || t.event == :on_nl || (t.event == :on_kw && t.tok == 'do')
-            skip = true if t.event == :on_kw && t.tok == 'do'
-            opens[-1] = [last_tok, nil]
-          end
-        end
-
-        unless skip
-          case t.event
-          when :on_kw
-            case t.tok
-            when 'begin', 'class', 'module', 'do', 'case'
-              opens << [t, nil]
-            when 'end'
-              opens.pop
-            when 'def'
-              opens << [t, :in_method_head, [:receiver, :name]]
-            when 'if', 'unless'
-              unless t.state.allbits?(Ripper::EXPR_LABEL)
-                opens << [t, nil]
-              end
-            when 'while', 'until'
-              unless t.state.allbits?(Ripper::EXPR_LABEL)
-                opens << [t, :in_for_while_until_condition]
-              end
-            when 'ensure', 'rescue'
-              unless t.state.allbits?(Ripper::EXPR_LABEL)
-                opens.pop
-                opens << [t, nil]
-              end
-            when 'alias'
-              opens << [t, :in_alias_undef, 2]
-            when 'undef'
-              opens << [t, :in_alias_undef, 1]
-            when 'elsif', 'else', 'when'
-              opens.pop
-              opens << [t, nil]
-            when 'for'
-              opens << [t, :in_for_while_until_condition]
-            when 'in'
-              if last_tok&.event == :on_kw && %w[case in].include?(last_tok.tok) && first_token_on_line
-                opens.pop
-                opens << [t, nil]
-              end
-            end
-          when :on_tlambda
-            opens << [t, :in_lambda_head]
-          when :on_lparen, :on_lbracket, :on_lbrace, :on_tlambeg, :on_embexpr_beg, :on_embdoc_beg
-            opens << [t, nil]
-          when :on_rparen, :on_rbracket, :on_rbrace, :on_embexpr_end, :on_embdoc_end
-            opens.pop
-          when :on_heredoc_beg
-            pending_heredocs << t
-          when :on_heredoc_end
-            opens.pop
-          when :on_backtick
-            opens << [t, nil] if t.state.allbits?(Ripper::EXPR_BEG)
-          when :on_tstring_beg, :on_words_beg, :on_qwords_beg, :on_symbols_beg, :on_qsymbols_beg, :on_regexp_beg
-            opens << [t, nil]
-          when :on_tstring_end, :on_regexp_end, :on_label_end
-            opens.pop
-          when :on_symbeg
-            if t.tok == ':'
-              opens << [t, :in_unquoted_symbol]
-            else
-              opens << [t, nil]
-            end
-          end
-        end
-        if t.event == :on_nl || t.event == :on_semicolon
-          first_token_on_line = true
-        elsif t.event != :on_sp
-          first_token_on_line = false
-        end
-        if pending_heredocs.any? && t.tok.include?("\n")
-          pending_heredocs.reverse_each { |t| opens << [t, nil] }
-          pending_heredocs = []
-        end
-        if opens.last && opens.last[1] == :in_alias_undef && !IGNORE_TOKENS.include?(t.event) && t.event != :on_heredoc_end
-          tok, state, arg = opens.pop
-          opens << [tok, state, arg - 1] if arg >= 1
-        end
-        yield t, opens if block_given?
-      end
-      opens.map(&:first) + pending_heredocs.reverse
-    end
-
-    def self.open_tokens(tokens)
-      # scan_opens without block will return a list of open tokens at last token position
-      scan_opens(tokens)
-    end
-
-    # Calculates token information [line_tokens, prev_opens, next_opens, min_depth] for each line.
-    # Example code
-    #   ["hello
-    #   world"+(
-    # First line
-    #   line_tokens: [[lbracket, '['], [tstring_beg, '"'], [tstring_content("hello\nworld"), "hello\n"]]
-    #   prev_opens:  []
-    #   next_tokens: [lbracket, tstring_beg]
-    #   min_depth:   0 (minimum at beginning of line)
-    # Second line
-    #   line_tokens: [[tstring_content("hello\nworld"), "world"], [tstring_end, '"'], [op, '+'], [lparen, '(']]
-    #   prev_opens:  [lbracket, tstring_beg]
-    #   next_tokens: [lbracket, lparen]
-    #   min_depth:   1 (minimum just after tstring_end)
-    def self.parse_by_line(tokens)
-      line_tokens = []
-      prev_opens = []
-      min_depth = 0
-      output = []
-      last_opens = scan_opens(tokens) do |t, opens|
-        depth = t == opens.last&.first ? opens.size - 1 : opens.size
-        min_depth = depth if depth < min_depth
-        if t.tok.include?("\n")
-          t.tok.each_line do |line|
-            line_tokens << [t, line]
-            next if line[-1] != "\n"
-            next_opens = opens.map(&:first)
-            output << [line_tokens, prev_opens, next_opens, min_depth]
-            prev_opens = next_opens
-            min_depth = prev_opens.size
-            line_tokens = []
-          end
-        else
-          line_tokens << [t, t.tok]
-        end
-      end
-      output << [line_tokens, prev_opens, last_opens, min_depth] if line_tokens.any?
-      output
-    end
-  end
-end
diff --git a/lib/irb/notifier.rb b/lib/irb/notifier.rb
deleted file mode 100644
index dc1b9ef14b..0000000000
--- a/lib/irb/notifier.rb
+++ /dev/null
@@ -1,230 +0,0 @@
-# frozen_string_literal: true
-#
-#   notifier.rb - output methods used by irb
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require_relative "output-method"
-
-module IRB
-  # An output formatter used internally by the lexer.
-  module Notifier
-    class ErrUndefinedNotifier < StandardError
-      def initialize(val)
-        super("undefined notifier level: #{val} is specified")
-      end
-    end
-    class ErrUnrecognizedLevel < StandardError
-      def initialize(val)
-        super("unrecognized notifier level: #{val} is specified")
-      end
-    end
-
-    # Define a new Notifier output source, returning a new CompositeNotifier
-    # with the given +prefix+ and +output_method+.
-    #
-    # The optional +prefix+ will be appended to all objects being inspected
-    # during output, using the given +output_method+ as the output source. If
-    # no +output_method+ is given, StdioOutputMethod will be used, and all
-    # expressions will be sent directly to STDOUT without any additional
-    # formatting.
-    def def_notifier(prefix = "", output_method = StdioOutputMethod.new)
-      CompositeNotifier.new(prefix, output_method)
-    end
-    module_function :def_notifier
-
-    # An abstract class, or superclass, for CompositeNotifier and
-    # LeveledNotifier to inherit. It provides several wrapper methods for the
-    # OutputMethod object used by the Notifier.
-    class AbstractNotifier
-      # Creates a new Notifier object
-      def initialize(prefix, base_notifier)
-        @prefix = prefix
-        @base_notifier = base_notifier
-      end
-
-      # The +prefix+ for this Notifier, which is appended to all objects being
-      # inspected during output.
-      attr_reader :prefix
-
-      # A wrapper method used to determine whether notifications are enabled.
-      #
-      # Defaults to +true+.
-      def notify?
-        true
-      end
-
-      # See OutputMethod#print for more detail.
-      def print(*opts)
-        @base_notifier.print prefix, *opts if notify?
-      end
-
-      # See OutputMethod#printn for more detail.
-      def printn(*opts)
-        @base_notifier.printn prefix, *opts if notify?
-      end
-
-      # See OutputMethod#printf for more detail.
-      def printf(format, *opts)
-        @base_notifier.printf(prefix + format, *opts) if notify?
-      end
-
-      # See OutputMethod#puts for more detail.
-      def puts(*objs)
-        if notify?
-          @base_notifier.puts(*objs.collect{|obj| prefix + obj.to_s})
-        end
-      end
-
-      # Same as #ppx, except it uses the #prefix given during object
-      # initialization.
-      # See OutputMethod#ppx for more detail.
-      def pp(*objs)
-        if notify?
-          @base_notifier.ppx @prefix, *objs
-        end
-      end
-
-      # Same as #pp, except it concatenates the given +prefix+ with the #prefix
-      # given during object initialization.
-      #
-      # See OutputMethod#ppx for more detail.
-      def ppx(prefix, *objs)
-        if notify?
-          @base_notifier.ppx @prefix+prefix, *objs
-        end
-      end
-
-      # Execute the given block if notifications are enabled.
-      def exec_if
-        yield(@base_notifier) if notify?
-      end
-    end
-
-    # A class that can be used to create a group of notifier objects with the
-    # intent of representing a leveled notification system for irb.
-    #
-    # This class will allow you to generate other notifiers, and assign them
-    # the appropriate level for output.
-    #
-    # The Notifier class provides a class-method Notifier.def_notifier to
-    # create a new composite notifier. Using the first composite notifier
-    # object you create, sibling notifiers can be initialized with
-    # #def_notifier.
-    class CompositeNotifier < AbstractNotifier
-      # Create a new composite notifier object with the given +prefix+, and
-      # +base_notifier+ to use for output.
-      def initialize(prefix, base_notifier)
-        super
-
-        @notifiers = [D_NOMSG]
-        @level_notifier = D_NOMSG
-      end
-
-      # List of notifiers in the group
-      attr_reader :notifiers
-
-      # Creates a new LeveledNotifier in the composite #notifiers group.
-      #
-      # The given +prefix+ will be assigned to the notifier, and +level+ will
-      # be used as the index of the #notifiers Array.
-      #
-      # This method returns the newly created instance.
-      def def_notifier(level, prefix = "")
-        notifier = LeveledNotifier.new(self, level, prefix)
-        @notifiers[level] = notifier
-        notifier
-      end
-
-      # Returns the leveled notifier for this object
-      attr_reader :level_notifier
-      alias level level_notifier
-
-      # Sets the leveled notifier for this object.
-      #
-      # When the given +value+ is an instance of AbstractNotifier,
-      # #level_notifier is set to the given object.
-      #
-      # When an Integer is given, #level_notifier is set to the notifier at the
-      # index +value+ in the #notifiers Array.
-      #
-      # If no notifier exists at the index +value+ in the #notifiers Array, an
-      # ErrUndefinedNotifier exception is raised.
-      #
-      # An ErrUnrecognizedLevel exception is raised if the given +value+ is not
-      # found in the existing #notifiers Array, or an instance of
-      # AbstractNotifier
-      def level_notifier=(value)
-        case value
-        when AbstractNotifier
-          @level_notifier = value
-        when Integer
-          l = @notifiers[value]
-          raise ErrUndefinedNotifier, value unless l
-          @level_notifier = l
-        else
-          raise ErrUnrecognizedLevel, value unless l
-        end
-      end
-
-      alias level= level_notifier=
-    end
-
-    # A leveled notifier is comparable to the composite group from
-    # CompositeNotifier#notifiers.
-    class LeveledNotifier < AbstractNotifier
-      include Comparable
-
-      # Create a new leveled notifier with the given +base+, and +prefix+ to
-      # send to AbstractNotifier.new
-      #
-      # The given +level+ is used to compare other leveled notifiers in the
-      # CompositeNotifier group to determine whether or not to output
-      # notifications.
-      def initialize(base, level, prefix)
-        super(prefix, base)
-
-        @level = level
-      end
-
-      # The current level of this notifier object
-      attr_reader :level
-
-      # Compares the level of this notifier object with the given +other+
-      # notifier.
-      #
-      # See the Comparable module for more information.
-      def <=>(other)
-        @level <=> other.level
-      end
-
-      # Whether to output messages to the output method, depending on the level
-      # of this notifier object.
-      def notify?
-        @base_notifier.level >= self
-      end
-    end
-
-    # NoMsgNotifier is a LeveledNotifier that's used as the default notifier
-    # when creating a new CompositeNotifier.
-    #
-    # This notifier is used as the +zero+ index, or level +0+, for
-    # CompositeNotifier#notifiers, and will not output messages of any sort.
-    class NoMsgNotifier < LeveledNotifier
-      # Creates a new notifier that should not be used to output messages.
-      def initialize
-        @base_notifier = nil
-        @level = 0
-        @prefix = ""
-      end
-
-      # Ensures notifications are ignored, see AbstractNotifier#notify? for
-      # more information.
-      def notify?
-        false
-      end
-    end
-
-    D_NOMSG = NoMsgNotifier.new # :nodoc:
-  end
-end
diff --git a/lib/irb/output-method.rb b/lib/irb/output-method.rb
deleted file mode 100644
index 69942f47a2..0000000000
--- a/lib/irb/output-method.rb
+++ /dev/null
@@ -1,80 +0,0 @@
-# frozen_string_literal: true
-#
-#   output-method.rb - output methods used by irb
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-module IRB
-  # An abstract output class for IO in irb. This is mainly used internally by
-  # IRB::Notifier. You can define your own output method to use with Irb.new,
-  # or Context.new
-  class OutputMethod
-    # Open this method to implement your own output method, raises a
-    # NotImplementedError if you don't define #print in your own class.
-    def print(*opts)
-      raise NotImplementedError
-    end
-
-    # Prints the given +opts+, with a newline delimiter.
-    def printn(*opts)
-      print opts.join(" "), "\n"
-    end
-
-    # Extends IO#printf to format the given +opts+ for Kernel#sprintf using
-    # #parse_printf_format
-    def printf(format, *opts)
-      if /(%*)%I/ =~ format
-        format, opts = parse_printf_format(format, opts)
-      end
-      print sprintf(format, *opts)
-    end
-
-    # Returns an array of the given +format+ and +opts+ to be used by
-    # Kernel#sprintf, if there was a successful Regexp match in the given
-    # +format+ from #printf
-    #
-    #     %
-    #     <flag>  [#0- +]
-    #     <minimum field width> (\*|\*[1-9][0-9]*\$|[1-9][0-9]*)
-    #     <precision>.(\*|\*[1-9][0-9]*\$|[1-9][0-9]*|)?
-    #     #<length modifier>(hh|h|l|ll|L|q|j|z|t)
-    #     <conversion specifier>[diouxXeEfgGcsb%]
-    def parse_printf_format(format, opts)
-      return format, opts if $1.size % 2 == 1
-    end
-
-    # Calls #print on each element in the given +objs+, followed by a newline
-    # character.
-    def puts(*objs)
-      for obj in objs
-        print(*obj)
-        print "\n"
-      end
-    end
-
-    # Prints the given +objs+ calling Object#inspect on each.
-    #
-    # See #puts for more detail.
-    def pp(*objs)
-      puts(*objs.collect{|obj| obj.inspect})
-    end
-
-    # Prints the given +objs+ calling Object#inspect on each and appending the
-    # given +prefix+.
-    #
-    # See #puts for more detail.
-    def ppx(prefix, *objs)
-      puts(*objs.collect{|obj| prefix+obj.inspect})
-    end
-
-  end
-
-  # A standard output printer
-  class StdioOutputMethod < OutputMethod
-    # Prints the given +opts+ to standard output, see IO#print for more
-    # information.
-    def print(*opts)
-      STDOUT.print(*opts)
-    end
-  end
-end
diff --git a/lib/irb/pager.rb b/lib/irb/pager.rb
deleted file mode 100644
index 3391b32c66..0000000000
--- a/lib/irb/pager.rb
+++ /dev/null
@@ -1,91 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  # The implementation of this class is borrowed from RDoc's lib/rdoc/ri/driver.rb.
-  # Please do NOT use this class directly outside of IRB.
-  class Pager
-    PAGE_COMMANDS = [ENV['RI_PAGER'], ENV['PAGER'], 'less', 'more'].compact.uniq
-
-    class << self
-      def page_content(content, **options)
-        if content_exceeds_screen_height?(content)
-          page(**options) do |io|
-            io.puts content
-          end
-        else
-          $stdout.puts content
-        end
-      end
-
-      def page(retain_content: false)
-        if should_page? && pager = setup_pager(retain_content: retain_content)
-          begin
-            pid = pager.pid
-            yield pager
-          ensure
-            pager.close
-          end
-        else
-          yield $stdout
-        end
-      # When user presses Ctrl-C, IRB would raise `IRB::Abort`
-      # But since Pager is implemented by running paging commands like `less` in another process with `IO.popen`,
-      # the `IRB::Abort` exception only interrupts IRB's execution but doesn't affect the pager
-      # So to properly terminate the pager with Ctrl-C, we need to catch `IRB::Abort` and kill the pager process
-      rescue IRB::Abort
-        Process.kill("TERM", pid) if pid
-        nil
-      rescue Errno::EPIPE
-      end
-
-      private
-
-      def should_page?
-        IRB.conf[:USE_PAGER] && STDIN.tty? && (ENV.key?("TERM") && ENV["TERM"] != "dumb")
-      end
-
-      def content_exceeds_screen_height?(content)
-        screen_height, screen_width = begin
-          Reline.get_screen_size
-        rescue Errno::EINVAL
-          [24, 80]
-        end
-
-        pageable_height = screen_height - 3 # leave some space for previous and the current prompt
-
-        # If the content has more lines than the pageable height
-        content.lines.count > pageable_height ||
-          # Or if the content is a few long lines
-          pageable_height * screen_width < Reline::Unicode.calculate_width(content, true)
-      end
-
-      def setup_pager(retain_content:)
-        require 'shellwords'
-
-        PAGE_COMMANDS.each do |pager_cmd|
-          cmd = Shellwords.split(pager_cmd)
-          next if cmd.empty?
-
-          if cmd.first == 'less'
-            cmd << '-R' unless cmd.include?('-R')
-            cmd << '-X' if retain_content && !cmd.include?('-X')
-          end
-
-          begin
-            io = IO.popen(cmd, 'w')
-          rescue
-            next
-          end
-
-          if $? && $?.pid == io.pid && $?.exited? # pager didn't work
-            next
-          end
-
-          return io
-        end
-
-        nil
-      end
-    end
-  end
-end
diff --git a/lib/irb/ruby-lex.rb b/lib/irb/ruby-lex.rb
deleted file mode 100644
index f6ac7f0f5f..0000000000
--- a/lib/irb/ruby-lex.rb
+++ /dev/null
@@ -1,474 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/ruby-lex.rb - ruby lexcal analyzer
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require "ripper"
-require "jruby" if RUBY_ENGINE == "jruby"
-require_relative "nesting_parser"
-
-module IRB
-  # :stopdoc:
-  class RubyLex
-    ASSIGNMENT_NODE_TYPES = [
-      # Local, instance, global, class, constant, instance, and index assignment:
-      #   "foo = bar",
-      #   "@foo = bar",
-      #   "$foo = bar",
-      #   "@@foo = bar",
-      #   "::Foo = bar",
-      #   "a::Foo = bar",
-      #   "Foo = bar"
-      #   "foo.bar = 1"
-      #   "foo[1] = bar"
-      :assign,
-
-      # Operation assignment:
-      #   "foo += bar"
-      #   "foo -= bar"
-      #   "foo ||= bar"
-      #   "foo &&= bar"
-      :opassign,
-
-      # Multiple assignment:
-      #   "foo, bar = 1, 2
-      :massign,
-    ]
-
-    class TerminateLineInput < StandardError
-      def initialize
-        super("Terminate Line Input")
-      end
-    end
-
-    def self.compile_with_errors_suppressed(code, line_no: 1)
-      begin
-        result = yield code, line_no
-      rescue ArgumentError
-        # Ruby can issue an error for the code if there is an
-        # incomplete magic comment for encoding in it. Force an
-        # expression with a new line before the code in this
-        # case to prevent magic comment handling.  To make sure
-        # line numbers in the lexed code remain the same,
-        # decrease the line number by one.
-        code = ";\n#{code}"
-        line_no -= 1
-        result = yield code, line_no
-      end
-      result
-    end
-
-    ERROR_TOKENS = [
-      :on_parse_error,
-      :compile_error,
-      :on_assign_error,
-      :on_alias_error,
-      :on_class_name_error,
-      :on_param_error
-    ]
-
-    def self.generate_local_variables_assign_code(local_variables)
-      "#{local_variables.join('=')}=nil;" unless local_variables.empty?
-    end
-
-    # Some part of the code is not included in Ripper's token.
-    # Example: DATA part, token after heredoc_beg when heredoc has unclosed embexpr.
-    # With interpolated tokens, tokens.map(&:tok).join will be equal to code.
-    def self.interpolate_ripper_ignored_tokens(code, tokens)
-      line_positions = [0]
-      code.lines.each do |line|
-        line_positions << line_positions.last + line.bytesize
-      end
-      prev_byte_pos = 0
-      interpolated = []
-      prev_line = 1
-      tokens.each do |t|
-        line, col = t.pos
-        byte_pos = line_positions[line - 1] + col
-        if prev_byte_pos < byte_pos
-          tok = code.byteslice(prev_byte_pos...byte_pos)
-          pos = [prev_line, prev_byte_pos - line_positions[prev_line - 1]]
-          interpolated << Ripper::Lexer::Elem.new(pos, :on_ignored_by_ripper, tok, 0)
-          prev_line += tok.count("\n")
-        end
-        interpolated << t
-        prev_byte_pos = byte_pos + t.tok.bytesize
-        prev_line += t.tok.count("\n")
-      end
-      if prev_byte_pos < code.bytesize
-        tok = code.byteslice(prev_byte_pos..)
-        pos = [prev_line, prev_byte_pos - line_positions[prev_line - 1]]
-        interpolated << Ripper::Lexer::Elem.new(pos, :on_ignored_by_ripper, tok, 0)
-      end
-      interpolated
-    end
-
-    def self.ripper_lex_without_warning(code, local_variables: [])
-      verbose, $VERBOSE = $VERBOSE, nil
-      lvars_code = generate_local_variables_assign_code(local_variables)
-      original_code = code
-      if lvars_code
-        code = "#{lvars_code}\n#{code}"
-        line_no = 0
-      else
-        line_no = 1
-      end
-
-      compile_with_errors_suppressed(code, line_no: line_no) do |inner_code, line_no|
-        lexer = Ripper::Lexer.new(inner_code, '-', line_no)
-        tokens = []
-        lexer.scan.each do |t|
-          next if t.pos.first == 0
-          prev_tk = tokens.last
-          position_overlapped = prev_tk && t.pos[0] == prev_tk.pos[0] && t.pos[1] < prev_tk.pos[1] + prev_tk.tok.bytesize
-          if position_overlapped
-            tokens[-1] = t if ERROR_TOKENS.include?(prev_tk.event) && !ERROR_TOKENS.include?(t.event)
-          else
-            tokens << t
-          end
-        end
-        interpolate_ripper_ignored_tokens(original_code, tokens)
-      end
-    ensure
-      $VERBOSE = verbose
-    end
-
-    def check_code_state(code, local_variables:)
-      tokens = self.class.ripper_lex_without_warning(code, local_variables: local_variables)
-      opens = NestingParser.open_tokens(tokens)
-      [tokens, opens, code_terminated?(code, tokens, opens, local_variables: local_variables)]
-    end
-
-    def code_terminated?(code, tokens, opens, local_variables:)
-      case check_code_syntax(code, local_variables: local_variables)
-      when :unrecoverable_error
-        true
-      when :recoverable_error
-        false
-      when :other_error
-        opens.empty? && !should_continue?(tokens)
-      when :valid
-        !should_continue?(tokens)
-      end
-    end
-
-    def assignment_expression?(code, local_variables:)
-      # Try to parse the code and check if the last of possibly multiple
-      # expressions is an assignment type.
-
-      # If the expression is invalid, Ripper.sexp should return nil which will
-      # result in false being returned. Any valid expression should return an
-      # s-expression where the second element of the top level array is an
-      # array of parsed expressions. The first element of each expression is the
-      # expression's type.
-      verbose, $VERBOSE = $VERBOSE, nil
-      code = "#{RubyLex.generate_local_variables_assign_code(local_variables) || 'nil;'}\n#{code}"
-      # Get the last node_type of the line. drop(1) is to ignore the local_variables_assign_code part.
-      node_type = Ripper.sexp(code)&.dig(1)&.drop(1)&.dig(-1, 0)
-      ASSIGNMENT_NODE_TYPES.include?(node_type)
-    ensure
-      $VERBOSE = verbose
-    end
-
-    def should_continue?(tokens)
-      # Look at the last token and check if IRB need to continue reading next line.
-      # Example code that should continue: `a\` `a +` `a.`
-      # Trailing spaces, newline, comments are skipped
-      return true if tokens.last&.event == :on_sp && tokens.last.tok == "\\\n"
-
-      tokens.reverse_each do |token|
-        case token.event
-        when :on_sp, :on_nl, :on_ignored_nl, :on_comment, :on_embdoc_beg, :on_embdoc, :on_embdoc_end
-          # Skip
-        when :on_regexp_end, :on_heredoc_end, :on_semicolon
-          # State is EXPR_BEG but should not continue
-          return false
-        else
-          # Endless range should not continue
-          return false if token.event == :on_op && token.tok.match?(/\A\.\.\.?\z/)
-
-          # EXPR_DOT and most of the EXPR_BEG should continue
-          return token.state.anybits?(Ripper::EXPR_BEG | Ripper::EXPR_DOT)
-        end
-      end
-      false
-    end
-
-    def check_code_syntax(code, local_variables:)
-      lvars_code = RubyLex.generate_local_variables_assign_code(local_variables)
-      code = "#{lvars_code}\n#{code}"
-
-      begin # check if parser error are available
-        verbose, $VERBOSE = $VERBOSE, nil
-        case RUBY_ENGINE
-        when 'ruby'
-          self.class.compile_with_errors_suppressed(code) do |inner_code, line_no|
-            RubyVM::InstructionSequence.compile(inner_code, nil, nil, line_no)
-          end
-        when 'jruby'
-          JRuby.compile_ir(code)
-        else
-          catch(:valid) do
-            eval("BEGIN { throw :valid, true }\n#{code}")
-            false
-          end
-        end
-      rescue EncodingError
-        # This is for a hash with invalid encoding symbol, {"\xAE": 1}
-        :unrecoverable_error
-      rescue SyntaxError => e
-        case e.message
-        when /unexpected keyword_end/
-          # "syntax error, unexpected keyword_end"
-          #
-          #   example:
-          #     if (
-          #     end
-          #
-          #   example:
-          #     end
-          return :unrecoverable_error
-        when /unexpected '\.'/
-          # "syntax error, unexpected '.'"
-          #
-          #   example:
-          #     .
-          return :unrecoverable_error
-        when /unexpected tREGEXP_BEG/
-          # "syntax error, unexpected tREGEXP_BEG, expecting keyword_do or '{' or '('"
-          #
-          #   example:
-          #     method / f /
-          return :unrecoverable_error
-        when /unterminated (?:string|regexp) meets end of file/
-          # "unterminated regexp meets end of file"
-          #
-          #   example:
-          #     /
-          #
-          # "unterminated string meets end of file"
-          #
-          #   example:
-          #     '
-          return :recoverable_error
-        when /unexpected end-of-input/
-          # "syntax error, unexpected end-of-input, expecting keyword_end"
-          #
-          #   example:
-          #     if true
-          #       hoge
-          #       if false
-          #         fuga
-          #       end
-          return :recoverable_error
-        else
-          return :other_error
-        end
-      ensure
-        $VERBOSE = verbose
-      end
-      :valid
-    end
-
-    def calc_indent_level(opens)
-      indent_level = 0
-      opens.each_with_index do |t, index|
-        case t.event
-        when :on_heredoc_beg
-          if opens[index + 1]&.event != :on_heredoc_beg
-            if t.tok.match?(/^<<[~-]/)
-              indent_level += 1
-            else
-              indent_level = 0
-            end
-          end
-        when :on_tstring_beg, :on_regexp_beg, :on_symbeg, :on_backtick
-          # No indent: "", //, :"", ``
-          # Indent: %(), %r(), %i(), %x()
-          indent_level += 1 if t.tok.start_with? '%'
-        when :on_embdoc_beg
-          indent_level = 0
-        else
-          indent_level += 1 unless t.tok == 'alias' || t.tok == 'undef'
-        end
-      end
-      indent_level
-    end
-
-    FREE_INDENT_TOKENS = %i[on_tstring_beg on_backtick on_regexp_beg on_symbeg]
-
-    def free_indent_token?(token)
-      FREE_INDENT_TOKENS.include?(token&.event)
-    end
-
-    # Calculates the difference of pasted code's indent and indent calculated from tokens
-    def indent_difference(lines, line_results, line_index)
-      loop do
-        _tokens, prev_opens, _next_opens, min_depth = line_results[line_index]
-        open_token = prev_opens.last
-        if !open_token || (open_token.event != :on_heredoc_beg && !free_indent_token?(open_token))
-          # If the leading whitespace is an indent, return the difference
-          indent_level = calc_indent_level(prev_opens.take(min_depth))
-          calculated_indent = 2 * indent_level
-          actual_indent = lines[line_index][/^ */].size
-          return actual_indent - calculated_indent
-        elsif open_token.event == :on_heredoc_beg && open_token.tok.match?(/^<<[^-~]/)
-          return 0
-        end
-        # If the leading whitespace is not an indent but part of a multiline token
-        # Calculate base_indent of the multiline token's beginning line
-        line_index = open_token.pos[0] - 1
-      end
-    end
-
-    def process_indent_level(tokens, lines, line_index, is_newline)
-      line_results = NestingParser.parse_by_line(tokens)
-      result = line_results[line_index]
-      if result
-        _tokens, prev_opens, next_opens, min_depth = result
-      else
-        # When last line is empty
-        prev_opens = next_opens = line_results.last[2]
-        min_depth = next_opens.size
-      end
-
-      # To correctly indent line like `end.map do`, we use shortest open tokens on each line for indent calculation.
-      # Shortest open tokens can be calculated by `opens.take(min_depth)`
-      indent = 2 * calc_indent_level(prev_opens.take(min_depth))
-
-      preserve_indent = lines[line_index - (is_newline ? 1 : 0)][/^ */].size
-
-      prev_open_token = prev_opens.last
-      next_open_token = next_opens.last
-
-      # Calculates base indent for pasted code on the line where prev_open_token is located
-      # irb(main):001:1*   if a # base_indent is 2, indent calculated from tokens is 0
-      # irb(main):002:1*         if b # base_indent is 6, indent calculated from tokens is 2
-      # irb(main):003:0>           c # base_indent is 6, indent calculated from tokens is 4
-      if prev_open_token
-        base_indent = [0, indent_difference(lines, line_results, prev_open_token.pos[0] - 1)].max
-      else
-        base_indent = 0
-      end
-
-      if free_indent_token?(prev_open_token)
-        if is_newline && prev_open_token.pos[0] == line_index
-          # First newline inside free-indent token
-          base_indent + indent
-        else
-          # Accept any number of indent inside free-indent token
-          preserve_indent
-        end
-      elsif prev_open_token&.event == :on_embdoc_beg || next_open_token&.event == :on_embdoc_beg
-        if prev_open_token&.event == next_open_token&.event
-          # Accept any number of indent inside embdoc content
-          preserve_indent
-        else
-          # =begin or =end
-          0
-        end
-      elsif prev_open_token&.event == :on_heredoc_beg
-        tok = prev_open_token.tok
-        if prev_opens.size <= next_opens.size
-          if is_newline && lines[line_index].empty? && line_results[line_index - 1][1].last != next_open_token
-            # First line in heredoc
-            tok.match?(/^<<[-~]/) ? base_indent + indent : indent
-          elsif tok.match?(/^<<~/)
-            # Accept extra indent spaces inside `<<~` heredoc
-            [base_indent + indent, preserve_indent].max
-          else
-            # Accept any number of indent inside other heredoc
-            preserve_indent
-          end
-        else
-          # Heredoc close
-          prev_line_indent_level = calc_indent_level(prev_opens)
-          tok.match?(/^<<[~-]/) ? base_indent + 2 * (prev_line_indent_level - 1) : 0
-        end
-      else
-        base_indent + indent
-      end
-    end
-
-    LTYPE_TOKENS = %i[
-      on_heredoc_beg on_tstring_beg
-      on_regexp_beg on_symbeg on_backtick
-      on_symbols_beg on_qsymbols_beg
-      on_words_beg on_qwords_beg
-    ]
-
-    def ltype_from_open_tokens(opens)
-      start_token = opens.reverse_each.find do |tok|
-        LTYPE_TOKENS.include?(tok.event)
-      end
-      return nil unless start_token
-
-      case start_token&.event
-      when :on_tstring_beg
-        case start_token&.tok
-        when ?"      then ?"
-        when /^%.$/  then ?"
-        when /^%Q.$/ then ?"
-        when ?'      then ?'
-        when /^%q.$/ then ?'
-        end
-      when :on_regexp_beg   then ?/
-      when :on_symbeg       then ?:
-      when :on_backtick     then ?`
-      when :on_qwords_beg   then ?]
-      when :on_words_beg    then ?]
-      when :on_qsymbols_beg then ?]
-      when :on_symbols_beg  then ?]
-      when :on_heredoc_beg
-        start_token&.tok =~ /<<[-~]?(['"`])\w+\1/
-        $1 || ?"
-      else
-        nil
-      end
-    end
-
-    def check_termination_in_prev_line(code, local_variables:)
-      tokens = self.class.ripper_lex_without_warning(code, local_variables: local_variables)
-      past_first_newline = false
-      index = tokens.rindex do |t|
-        # traverse first token before last line
-        if past_first_newline
-          if t.tok.include?("\n")
-            true
-          end
-        elsif t.tok.include?("\n")
-          past_first_newline = true
-          false
-        else
-          false
-        end
-      end
-
-      if index
-        first_token = nil
-        last_line_tokens = tokens[(index + 1)..(tokens.size - 1)]
-        last_line_tokens.each do |t|
-          unless [:on_sp, :on_ignored_sp, :on_comment].include?(t.event)
-            first_token = t
-            break
-          end
-        end
-
-        if first_token && first_token.state != Ripper::EXPR_DOT
-          tokens_without_last_line = tokens[0..index]
-          code_without_last_line = tokens_without_last_line.map(&:tok).join
-          opens_without_last_line = NestingParser.open_tokens(tokens_without_last_line)
-          if code_terminated?(code_without_last_line, tokens_without_last_line, opens_without_last_line, local_variables: local_variables)
-            return last_line_tokens.map(&:tok).join
-          end
-        end
-      end
-      false
-    end
-  end
-  # :startdoc:
-end
-
-RubyLex = IRB::RubyLex
-Object.deprecate_constant(:RubyLex)
diff --git a/lib/irb/ruby_logo.aa b/lib/irb/ruby_logo.aa
deleted file mode 100644
index 61fe22c94a..0000000000
--- a/lib/irb/ruby_logo.aa
+++ /dev/null
@@ -1,80 +0,0 @@
-TYPE: LARGE
-
-                                             -+smJYYN?mm-
-                                   HB"BBYT            TQg  NggT
-                              9Q+g       Nm,T      8g          NJW
-                          YS+              N2NJ"Sg               N?
-                       BQg                  #(  gT Nggggk          J
-                     5j                     NJ    NJ            NNge
-                  #Q                        #JJ     NgT            N(
-                @j                          bj         mT           J
-              Bj                           @/d           NJ         (
-            #q                            #((              NgT     #J
-           5d                            #(t                  mT   $d
-         #q                             @(@J                    NJB;
-        @(                             5d ? HHH H HQmgggggggmN    qD
-       5d                            #uN  2QdH                   E O
-      5                             5JSd  Nd  NJH               @d j
-     Fd                           @J4d     s     NQH           #d  (
-    #(                          #o6d       Nd       NgH       #d  #d
-    4                         B&Od          v          NgT   #d   F
-   #(                       9JGd            NH            NgUd    F
-   #d                    #GJQ                d             NP     $
-   #J                 #U+#Q                  N            Q #     j
-  j /W             BQ+ BQ                     d             NJ   NJ
-  - NjJH      HBIjTQggPJQgW                   N        W     k   #J
- #J  b  HYWgggN       j s    Nag               d     NN      b   #d
- #J  5-              D   s         Ngg         N    d        Nd  F
- Fd BKH2            #+    s             NNgg    J Q           J  ]
- F H @  J           N      y                   K(d            P  I
- F4  E  N?         #d       y                #Q   NJ          E  j
- F   W   Nd        q         m             Bg       NxW       N(H-
- F   d    b       @           m          Hd            gW      vKJ
- NJ  d     K      d            s      Bg                 aT    FDd
-  b #       d    N              m  BQ                      mV  N>
-   e5       Nd  #d              NggggggQWH HHHH              NJ -
-    m7       NW H            N                        HSVO1z=?11-
-      NgTH    bB        kH   WBHWWHBHWmQgg&gggggNNN
-           NNggggggNN
-TYPE: ASCII
-                  ,,,;;;;''''';;;'';,
-              ,,;''     ';;,;;;      ',
-           ,,''          ;;'';'''';;;;;;
-         ,;'             ;;   ',,      ;
-       ,;'              ,;'     ';,    ;
-      ;'               ,;;         ',,,;
-    ,'                ,;;,,,,,,,,,,,;;;;
-   ;'                ;;';;;;         ,;;
-  ;'               ,;'  ;; '',,     ,;;;
- ;;              ,;'     ;    '';, ,; ;'
-;;            ,;;'       ;;       ;; ;;
-;;,        ,,;;'          ;      ;'; ;;
-;';;,,,,;;;;;;;,,,        ;;   ,'  ; ;;
-; ;;'''    ,;';  ''';,,,   ; ,;'   ;;;;
-;;;;,      ;  ';       ''';;;'     ';;;
-;'; ;,    ;'   ';        ,;' ',     ;;;
-;;;  ;   ,;     ';    ,,'      ',,  ;;
-;;;  ';  ;'      ';,,''          ';,;;
- ';   ';,;     ,,;''''''''';;;;;;,,;;;
-   ';,,;;,,;;;;;;;;;;''''''''''''''
-TYPE: UNICODE
-                  ⣀⣤⣴⣾⣿⣿⣿⡛⠛⠛⠛⠛⣻⣿⠿⠛⠛⠶⣤⡀
-              ⣀⣴⠾⠛⠉⠁    ⠙⣿⣶⣤⣶⣟⣉     ⠈⠻⣦
-           ⣀⣴⠟⠋          ⢸⣿⠟⠻⣯⡙⠛⠛⠛⠶⠶⠶⢶⣽⣇
-         ⣠⡾⠋⠁            ⣾⡿  ⠈⠛⢦⣄      ⣿
-       ⣠⡾⠋              ⣰⣿⠃     ⠙⠷⣤⡀   ⣿
-     ⢀⡾⠋               ⣰⣿⡏        ⠈⠻⣦⣄⢠⣿
-    ⣰⠟⠁               ⣴⣿⣿⣁⣀⣠⣤⣤⣤⣤⣤⣤⣤⣴⠶⠿⣿⡏
-   ⣼⠏               ⢀⣾⣿⠟⣿⠿⣯⣍⠁        ⣰⣿⡇
- ⢀⣼⠋              ⢀⣴⣿⠟⠁ ⢸⡇ ⠙⠻⢦⣄⡀    ⢠⡿⣿⡇
-⢀⣾⡏             ⢀⣴⣿⠟⠁    ⣿    ⠉⠻⢶⣄⡀⣰⡟ ⣿⠃
-⣾⣿⠁           ⣠⣶⡿⠋⠁      ⢹⡇      ⠈⣿⡏ ⢸⣿
-⣿⣿⡆       ⢀⣠⣴⣿⡿⠋         ⠈⣿     ⢀⡾⠋⣿ ⢸⣿
-⣿⠸⣿⣶⣤⣤⣤⣤⣶⣾⠿⠿⣿⣿⠶⣤⣤⣀⡀       ⢹⡇   ⣴⠟⠁ ⣿⡀⢸⣿
-⣿⢀⣿⣟⠛⠋⠉⠁   ⢰⡟⠹⣧ ⠈⠉⠛⠻⠶⢦⣤⣀⡀ ⠈⣿ ⣠⡾⠃   ⢸⡇⢸⡇
-⣿⣾⣿⢿⡄      ⣿⠁ ⠘⣧       ⠉⠙⠛⠷⣿⣿⡋     ⠸⣇⣸⡇
-⣿⠃⣿⠈⢿⡄    ⣸⠇   ⠘⣧       ⢀⣤⠾⠋⠈⠻⣦⡀    ⣿⣿⡇
-⣿⢸⡏ ⠈⣷⡀  ⢠⡿     ⠘⣧⡀   ⣠⡴⠟⠁    ⠈⠻⣦⣀  ⢿⣿⠁
-⢻⣾⡇  ⠘⣷  ⣼⠃      ⠘⣷⣠⣴⠟⠋          ⠙⢷⣄⢸⣿
- ⠻⣧⡀  ⠘⣧⣰⡏    ⢀⣠⣤⠶⠛⠉⠛⠛⠛⠛⠛⠛⠻⢶⣶⣶⣶⣶⣶⣤⣤⣽⣿⣿
-  ⠈⠛⠷⢦⣤⣽⣿⣥⣤⣶⣶⡿⠿⠿⠶⠶⠶⠶⠾⠛⠛⠛⠛⠛⠛⠛⠋⠉⠉⠉⠉⠉⠉⠁
diff --git a/lib/irb/source_finder.rb b/lib/irb/source_finder.rb
deleted file mode 100644
index 5d7d729d19..0000000000
--- a/lib/irb/source_finder.rb
+++ /dev/null
@@ -1,139 +0,0 @@
-# frozen_string_literal: true
-
-require_relative "ruby-lex"
-
-module IRB
-  class SourceFinder
-    class EvaluationError < StandardError; end
-
-    class Source
-      attr_reader :file, :line
-      def initialize(file, line, ast_source = nil)
-        @file = file
-        @line = line
-        @ast_source = ast_source
-      end
-
-      def file_exist?
-        File.exist?(@file)
-      end
-
-      def binary_file?
-        # If the line is zero, it means that the target's source is probably in a binary file.
-        @line.zero?
-      end
-
-      def file_content
-        @file_content ||= File.read(@file)
-      end
-
-      def colorized_content
-        if !binary_file? && file_exist?
-          end_line = find_end
-          # To correctly colorize, we need to colorize full content and extract the relevant lines.
-          colored = IRB::Color.colorize_code(file_content)
-          colored.lines[@line - 1...end_line].join
-        elsif @ast_source
-          IRB::Color.colorize_code(@ast_source)
-        end
-      end
-
-      private
-
-      def find_end
-        lex = RubyLex.new
-        code = file_content
-        lines = code.lines[(@line - 1)..-1]
-        tokens = RubyLex.ripper_lex_without_warning(lines.join)
-        prev_tokens = []
-
-        # chunk with line number
-        tokens.chunk { |tok| tok.pos[0] }.each do |lnum, chunk|
-          code = lines[0..lnum].join
-          prev_tokens.concat chunk
-          continue = lex.should_continue?(prev_tokens)
-          syntax = lex.check_code_syntax(code, local_variables: [])
-          if !continue && syntax == :valid
-            return @line + lnum
-          end
-        end
-        @line
-      end
-    end
-
-    private_constant :Source
-
-    def initialize(irb_context)
-      @irb_context = irb_context
-    end
-
-    def find_source(signature, super_level = 0)
-      case signature
-      when /\A(::)?[A-Z]\w*(::[A-Z]\w*)*\z/ # ConstName, ::ConstName, ConstPath::ConstName
-        eval_receiver_or_owner(signature) # trigger autoload
-        *parts, name = signature.split('::', -1)
-        base =
-          if parts.empty? # ConstName
-            find_const_owner(name)
-          elsif parts == [''] # ::ConstName
-            Object
-          else # ConstPath::ConstName
-            eval_receiver_or_owner(parts.join('::'))
-          end
-        file, line = base.const_source_location(name)
-      when /\A(?<owner>[A-Z]\w*(::[A-Z]\w*)*)#(?<method>[^ :.]+)\z/ # Class#method
-        owner = eval_receiver_or_owner(Regexp.last_match[:owner])
-        method = Regexp.last_match[:method]
-        return unless owner.respond_to?(:instance_method)
-        method = method_target(owner, super_level, method, "owner")
-        file, line = method&.source_location
-      when /\A((?<receiver>.+)(\.|::))?(?<method>[^ :.]+)\z/ # method, receiver.method, receiver::method
-        receiver = eval_receiver_or_owner(Regexp.last_match[:receiver] || 'self')
-        method = Regexp.last_match[:method]
-        return unless receiver.respond_to?(method, true)
-        method = method_target(receiver, super_level, method, "receiver")
-        file, line = method&.source_location
-      end
-      return unless file && line
-
-      if File.exist?(file)
-        Source.new(file, line)
-      elsif method
-        # Method defined with eval, probably in IRB session
-        source = RubyVM::AbstractSyntaxTree.of(method)&.source rescue nil
-        Source.new(file, line, source)
-      end
-    rescue EvaluationError
-      nil
-    end
-
-    private
-
-    def method_target(owner_receiver, super_level, method, type)
-      case type
-      when "owner"
-        target_method = owner_receiver.instance_method(method)
-      when "receiver"
-        target_method = owner_receiver.method(method)
-      end
-      super_level.times do |s|
-        target_method = target_method.super_method if target_method
-      end
-      target_method
-    rescue NameError
-      nil
-    end
-
-    def eval_receiver_or_owner(code)
-      context_binding = @irb_context.workspace.binding
-      eval(code, context_binding)
-    rescue NameError
-      raise EvaluationError
-    end
-
-    def find_const_owner(name)
-      module_nesting = @irb_context.workspace.binding.eval('::Module.nesting')
-      module_nesting.find { |mod| mod.const_defined?(name, false) } || module_nesting.find { |mod| mod.const_defined?(name) } || Object
-    end
-  end
-end
diff --git a/lib/irb/statement.rb b/lib/irb/statement.rb
deleted file mode 100644
index a3391c12a3..0000000000
--- a/lib/irb/statement.rb
+++ /dev/null
@@ -1,80 +0,0 @@
-# frozen_string_literal: true
-
-module IRB
-  class Statement
-    attr_reader :code
-
-    def is_assignment?
-      raise NotImplementedError
-    end
-
-    def suppresses_echo?
-      raise NotImplementedError
-    end
-
-    def should_be_handled_by_debugger?
-      raise NotImplementedError
-    end
-
-    class EmptyInput < Statement
-      def is_assignment?
-        false
-      end
-
-      def suppresses_echo?
-        true
-      end
-
-      # Debugger takes empty input to repeat the last command
-      def should_be_handled_by_debugger?
-        true
-      end
-
-      def code
-        ""
-      end
-    end
-
-    class Expression < Statement
-      def initialize(code, is_assignment)
-        @code = code
-        @is_assignment = is_assignment
-      end
-
-      def suppresses_echo?
-        @code.match?(/;\s*\z/)
-      end
-
-      def should_be_handled_by_debugger?
-        true
-      end
-
-      def is_assignment?
-        @is_assignment
-      end
-    end
-
-    class Command < Statement
-      attr_reader :command_class, :arg
-
-      def initialize(original_code, command_class, arg)
-        @code = original_code
-        @command_class = command_class
-        @arg = arg
-      end
-
-      def is_assignment?
-        false
-      end
-
-      def suppresses_echo?
-        false
-      end
-
-      def should_be_handled_by_debugger?
-        require_relative 'command/debug'
-        IRB::Command::DebugCommand > @command_class
-      end
-    end
-  end
-end
diff --git a/lib/irb/version.rb b/lib/irb/version.rb
deleted file mode 100644
index c41917329c..0000000000
--- a/lib/irb/version.rb
+++ /dev/null
@@ -1,11 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/version.rb - irb version definition file
-#   	by Keiju ISHITSUKA(keiju@ishitsuka.com)
-#
-
-module IRB # :nodoc:
-  VERSION = "1.13.1"
-  @RELEASE_VERSION = VERSION
-  @LAST_UPDATE_DATE = "2024-05-05"
-end
diff --git a/lib/irb/workspace.rb b/lib/irb/workspace.rb
deleted file mode 100644
index d24d1cc38d..0000000000
--- a/lib/irb/workspace.rb
+++ /dev/null
@@ -1,189 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/workspace-binding.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-require "delegate"
-
-require_relative "helper_method"
-
-IRB::TOPLEVEL_BINDING = binding
-module IRB # :nodoc:
-  class WorkSpace
-    # Creates a new workspace.
-    #
-    # set self to main if specified, otherwise
-    # inherit main from TOPLEVEL_BINDING.
-    def initialize(*main)
-      if main[0].kind_of?(Binding)
-        @binding = main.shift
-      elsif IRB.conf[:SINGLE_IRB]
-        @binding = TOPLEVEL_BINDING
-      else
-        case IRB.conf[:CONTEXT_MODE]
-        when 0	# binding in proc on TOPLEVEL_BINDING
-          @binding = eval("proc{binding}.call",
-                          TOPLEVEL_BINDING,
-                          __FILE__,
-                          __LINE__)
-        when 1	# binding in loaded file
-          require "tempfile"
-          f = Tempfile.open("irb-binding")
-          f.print <<EOF
-      $binding = binding
-EOF
-          f.close
-          load f.path
-          @binding = $binding
-
-        when 2	# binding in loaded file(thread use)
-          unless defined? BINDING_QUEUE
-            IRB.const_set(:BINDING_QUEUE, Thread::SizedQueue.new(1))
-            Thread.abort_on_exception = true
-            Thread.start do
-              eval "require \"irb/ws-for-case-2\"", TOPLEVEL_BINDING, __FILE__, __LINE__
-            end
-            Thread.pass
-          end
-          @binding = BINDING_QUEUE.pop
-
-        when 3	# binding in function on TOPLEVEL_BINDING
-          @binding = eval("self.class.remove_method(:irb_binding) if defined?(irb_binding); private; def irb_binding; binding; end; irb_binding",
-                          TOPLEVEL_BINDING,
-                          __FILE__,
-                          __LINE__ - 3)
-        when 4  # binding is a copy of TOPLEVEL_BINDING (default)
-          # Note that this will typically be IRB::TOPLEVEL_BINDING
-          # This is to avoid RubyGems' local variables (see issue #17623)
-          @binding = TOPLEVEL_BINDING.dup
-        end
-      end
-
-      if main.empty?
-        @main = eval("self", @binding)
-      else
-        @main = main[0]
-      end
-      IRB.conf[:__MAIN__] = @main
-
-      unless main.empty?
-        case @main
-        when Module
-          @binding = eval("IRB.conf[:__MAIN__].module_eval('binding', __FILE__, __LINE__)", @binding, __FILE__, __LINE__)
-        else
-          begin
-            @binding = eval("IRB.conf[:__MAIN__].instance_eval('binding', __FILE__, __LINE__)", @binding, __FILE__, __LINE__)
-          rescue TypeError
-            fail CantChangeBinding, @main.inspect
-          end
-        end
-      end
-
-      case @main
-      when Object
-        use_delegator = @main.frozen?
-      else
-        use_delegator = true
-      end
-
-      if use_delegator
-        @main = SimpleDelegator.new(@main)
-        IRB.conf[:__MAIN__] = @main
-        @main.singleton_class.class_eval do
-          private
-          define_method(:binding, Kernel.instance_method(:binding))
-          define_method(:local_variables, Kernel.instance_method(:local_variables))
-          # Define empty method to avoid delegator warning, will be overridden.
-          define_method(:exit) {|*a, &b| }
-          define_method(:exit!) {|*a, &b| }
-        end
-        @binding = eval("IRB.conf[:__MAIN__].instance_eval('binding', __FILE__, __LINE__)", @binding, *@binding.source_location)
-      end
-
-      @binding.local_variable_set(:_, nil)
-    end
-
-    # The Binding of this workspace
-    attr_reader :binding
-    # The top-level workspace of this context, also available as
-    # <code>IRB.conf[:__MAIN__]</code>
-    attr_reader :main
-
-    def load_helper_methods_to_main
-      ancestors = class<<main;ancestors;end
-      main.extend ExtendCommandBundle if !ancestors.include?(ExtendCommandBundle)
-      main.extend HelpersContainer if !ancestors.include?(HelpersContainer)
-    end
-
-    # Evaluate the given +statements+ within the  context of this workspace.
-    def evaluate(statements, file = __FILE__, line = __LINE__)
-      eval(statements, @binding, file, line)
-    end
-
-    def local_variable_set(name, value)
-      @binding.local_variable_set(name, value)
-    end
-
-    def local_variable_get(name)
-      @binding.local_variable_get(name)
-    end
-
-    # error message manipulator
-    # WARN: Rails patches this method to filter its own backtrace. Be cautious when changing it.
-    # See: https://github.com/rails/rails/blob/main/railties/lib/rails/commands/console/console_command.rb#L8:~:text=def,filter_backtrace
-    def filter_backtrace(bt)
-      return nil if bt =~ /\/irb\/.*\.rb/
-      return nil if bt =~ /\/irb\.rb/
-      return nil if bt =~ /tool\/lib\/.*\.rb|runner\.rb/ # for tests in Ruby repository
-      case IRB.conf[:CONTEXT_MODE]
-      when 1
-        return nil if bt =~ %r!/tmp/irb-binding!
-      when 3
-        bt = bt.sub(/:\s*in `irb_binding'/, '')
-      end
-      bt
-    end
-
-    def code_around_binding
-      file, pos = @binding.source_location
-
-      if defined?(::SCRIPT_LINES__[file]) && lines = ::SCRIPT_LINES__[file]
-        code = ::SCRIPT_LINES__[file].join('')
-      else
-        begin
-          code = File.read(file)
-        rescue SystemCallError
-          return
-        end
-      end
-
-      lines = Color.colorize_code(code).lines
-      pos -= 1
-
-      start_pos = [pos - 5, 0].max
-      end_pos   = [pos + 5, lines.size - 1].min
-
-      line_number_fmt = Color.colorize("%#{end_pos.to_s.length}d", [:BLUE, :BOLD])
-      fmt = " %2s #{line_number_fmt}: %s"
-
-      body = (start_pos..end_pos).map do |current_pos|
-        sprintf(fmt, pos == current_pos ? '=>' : '', current_pos + 1, lines[current_pos])
-      end.join("")
-
-      "\nFrom: #{file} @ line #{pos + 1} :\n\n#{body}#{Color.clear}\n"
-    end
-  end
-
-  module HelpersContainer
-    def self.install_helper_methods
-      HelperMethod.helper_methods.each do |name, helper_method_class|
-        define_method name do |*args, **opts, &block|
-          helper_method_class.instance.execute(*args, **opts, &block)
-        end unless method_defined?(name)
-      end
-    end
-
-    install_helper_methods
-  end
-end
diff --git a/lib/irb/ws-for-case-2.rb b/lib/irb/ws-for-case-2.rb
deleted file mode 100644
index 03f42d73d9..0000000000
--- a/lib/irb/ws-for-case-2.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-# frozen_string_literal: true
-#
-#   irb/ws-for-case-2.rb -
-#   	by Keiju ISHITSUKA(keiju@ruby-lang.org)
-#
-
-while true
-  IRB::BINDING_QUEUE.push _ = binding
-end
diff --git a/lib/irb/xmp.rb b/lib/irb/xmp.rb
deleted file mode 100644
index b1bc53283e..0000000000
--- a/lib/irb/xmp.rb
+++ /dev/null
@@ -1,164 +0,0 @@
-# frozen_string_literal: true
-#
-#   xmp.rb - irb version of gotoken xmp
-#   	by Keiju ISHITSUKA(Nippon Rational Inc.)
-#
-
-require_relative "../irb"
-require_relative "frame"
-
-# An example printer for irb.
-#
-# It's much like the standard library PrettyPrint, that shows the value of each
-# expression as it runs.
-#
-# In order to use this library, you must first require it:
-#
-#     require 'irb/xmp'
-#
-# Now, you can take advantage of the Object#xmp convenience method.
-#
-#     xmp <<END
-#       foo = "bar"
-#       baz = 42
-#     END
-#     #=> foo = "bar"
-#       #==>"bar"
-#     #=> baz = 42
-#       #==>42
-#
-# You can also create an XMP object, with an optional binding to print
-# expressions in the given binding:
-#
-#     ctx = binding
-#     x = XMP.new ctx
-#     x.puts
-#     #=> today = "a good day"
-#       #==>"a good day"
-#     ctx.eval 'today # is what?'
-#     #=> "a good day"
-class XMP
-
-  # Creates a new XMP object.
-  #
-  # The top-level binding or, optional +bind+ parameter will be used when
-  # creating the workspace. See WorkSpace.new for more information.
-  #
-  # This uses the +:XMP+ prompt mode.
-  # See {Custom Prompts}[rdoc-ref:IRB@Custom+Prompts] for more information.
-  def initialize(bind = nil)
-    IRB.init_config(nil)
-
-    IRB.conf[:PROMPT_MODE] = :XMP
-
-    bind = IRB::Frame.top(1) unless bind
-    ws = IRB::WorkSpace.new(bind)
-    @io = StringInputMethod.new
-    @irb = IRB::Irb.new(ws, @io)
-    @irb.context.ignore_sigint = false
-
-    IRB.conf[:MAIN_CONTEXT] = @irb.context
-  end
-
-  # Evaluates the given +exps+, for example:
-  #
-  #   require 'irb/xmp'
-  #   x = XMP.new
-  #
-  #   x.puts '{:a => 1, :b => 2, :c => 3}'
-  #   #=> {:a => 1, :b => 2, :c => 3}
-  #     # ==>{:a=>1, :b=>2, :c=>3}
-  #   x.puts 'foo = "bar"'
-  #   # => foo = "bar"
-  #     # ==>"bar"
-  def puts(exps)
-    @io.puts exps
-
-    if @irb.context.ignore_sigint
-      begin
-        trap_proc_b = trap("SIGINT"){@irb.signal_handle}
-        catch(:IRB_EXIT) do
-          @irb.eval_input
-        end
-      ensure
-        trap("SIGINT", trap_proc_b)
-      end
-    else
-      catch(:IRB_EXIT) do
-        @irb.eval_input
-      end
-    end
-  end
-
-  # A custom InputMethod class used by XMP for evaluating string io.
-  class StringInputMethod < IRB::InputMethod
-    # Creates a new StringInputMethod object
-    def initialize
-      super
-      @exps = []
-    end
-
-    # Whether there are any expressions left in this printer.
-    def eof?
-      @exps.empty?
-    end
-
-    # Reads the next expression from this printer.
-    #
-    # See IO#gets for more information.
-    def gets
-      while l = @exps.shift
-        next if /^\s+$/ =~ l
-        l.concat "\n"
-        print @prompt, l
-        break
-      end
-      l
-    end
-
-    # Concatenates all expressions in this printer, separated by newlines.
-    #
-    # An Encoding::CompatibilityError is raised of the given +exps+'s encoding
-    # doesn't match the previous expression evaluated.
-    def puts(exps)
-      if @encoding and exps.encoding != @encoding
-        enc = Encoding.compatible?(@exps.join("\n"), exps)
-        if enc.nil?
-          raise Encoding::CompatibilityError, "Encoding in which the passed expression is encoded is not compatible to the preceding's one"
-        else
-          @encoding = enc
-        end
-      else
-        @encoding = exps.encoding
-      end
-      @exps.concat exps.split(/\n/)
-    end
-
-    # Returns the encoding of last expression printed by #puts.
-    attr_reader :encoding
-  end
-end
-
-# A convenience method that's only available when the you require the IRB::XMP standard library.
-#
-# Creates a new XMP object, using the given expressions as the +exps+
-# parameter, and optional binding as +bind+ or uses the top-level binding. Then
-# evaluates the given expressions using the +:XMP+ prompt mode.
-#
-# For example:
-#
-#   require 'irb/xmp'
-#   ctx = binding
-#   xmp 'foo = "bar"', ctx
-#   #=> foo = "bar"
-#     #==>"bar"
-#   ctx.eval 'foo'
-#   #=> "bar"
-#
-# See XMP.new for more information.
-def xmp(exps, bind = nil)
-  bind = IRB::Frame.top(1) unless bind
-  xmp = XMP.new(bind)
-  xmp.puts exps
-  xmp
-end
diff --git a/lib/logger.rb b/lib/logger.rb
deleted file mode 100644
index 4099955ef2..0000000000
--- a/lib/logger.rb
+++ /dev/null
@@ -1,747 +0,0 @@
-# frozen_string_literal: true
-# logger.rb - simple logging utility
-# Copyright (C) 2000-2003, 2005, 2008, 2011  NAKAMURA, Hiroshi <nahi@ruby-lang.org>.
-#
-# Documentation:: NAKAMURA, Hiroshi and Gavin Sinclair
-# License::
-#   You can redistribute it and/or modify it under the same terms of Ruby's
-#   license; either the dual license version in 2003, or any later version.
-# Revision:: $Id$
-#
-# A simple system for logging messages.  See Logger for more documentation.
-
-require 'fiber'
-require 'monitor'
-require 'rbconfig'
-
-require_relative 'logger/version'
-require_relative 'logger/formatter'
-require_relative 'logger/log_device'
-require_relative 'logger/severity'
-require_relative 'logger/errors'
-
-# \Class \Logger provides a simple but sophisticated logging utility that
-# you can use to create one or more
-# {event logs}[https://en.wikipedia.org/wiki/Logging_(software)#Event_logs]
-# for your program.
-# Each such log contains a chronological sequence of entries
-# that provides a record of the program's activities.
-#
-# == About the Examples
-#
-# All examples on this page assume that \Logger has been required:
-#
-#   require 'logger'
-#
-# == Synopsis
-#
-# Create a log with Logger.new:
-#
-#   # Single log file.
-#   logger = Logger.new('t.log')
-#   # Size-based rotated logging: 3 10-megabyte files.
-#   logger = Logger.new('t.log', 3, 10485760)
-#   # Period-based rotated logging: daily (also allowed: 'weekly', 'monthly').
-#   logger = Logger.new('t.log', 'daily')
-#   # Log to an IO stream.
-#   logger = Logger.new($stdout)
-#
-# Add entries (level, message) with Logger#add:
-#
-#   logger.add(Logger::DEBUG, 'Maximal debugging info')
-#   logger.add(Logger::INFO, 'Non-error information')
-#   logger.add(Logger::WARN, 'Non-error warning')
-#   logger.add(Logger::ERROR, 'Non-fatal error')
-#   logger.add(Logger::FATAL, 'Fatal error')
-#   logger.add(Logger::UNKNOWN, 'Most severe')
-#
-# Close the log with Logger#close:
-#
-#   logger.close
-#
-# == Entries
-#
-# You can add entries with method Logger#add:
-#
-#   logger.add(Logger::DEBUG, 'Maximal debugging info')
-#   logger.add(Logger::INFO, 'Non-error information')
-#   logger.add(Logger::WARN, 'Non-error warning')
-#   logger.add(Logger::ERROR, 'Non-fatal error')
-#   logger.add(Logger::FATAL, 'Fatal error')
-#   logger.add(Logger::UNKNOWN, 'Most severe')
-#
-# These shorthand methods also add entries:
-#
-#   logger.debug('Maximal debugging info')
-#   logger.info('Non-error information')
-#   logger.warn('Non-error warning')
-#   logger.error('Non-fatal error')
-#   logger.fatal('Fatal error')
-#   logger.unknown('Most severe')
-#
-# When you call any of these methods,
-# the entry may or may not be written to the log,
-# depending on the entry's severity and on the log level;
-# see {Log Level}[rdoc-ref:Logger@Log+Level]
-#
-# An entry always has:
-#
-# - A severity (the required argument to #add).
-# - An automatically created timestamp.
-#
-# And may also have:
-#
-# - A message.
-# - A program name.
-#
-# Example:
-#
-#   logger = Logger.new($stdout)
-#   logger.add(Logger::INFO, 'My message.', 'mung')
-#   # => I, [2022-05-07T17:21:46.536234 #20536]  INFO -- mung: My message.
-#
-# The default format for an entry is:
-#
-#   "%s, [%s #%d] %5s -- %s: %s\n"
-#
-# where the values to be formatted are:
-#
-# - \Severity (one letter).
-# - Timestamp.
-# - Process id.
-# - \Severity (word).
-# - Program name.
-# - Message.
-#
-# You can use a different entry format by:
-#
-# - Setting a custom format proc (affects following entries);
-#   see {formatter=}[Logger.html#attribute-i-formatter].
-# - Calling any of the methods above with a block
-#   (affects only the one entry).
-#   Doing so can have two benefits:
-#
-#   - Context: the block can evaluate the entire program context
-#     and create a context-dependent message.
-#   - Performance: the block is not evaluated unless the log level
-#     permits the entry actually to be written:
-#
-#       logger.error { my_slow_message_generator }
-#
-#     Contrast this with the string form, where the string is
-#     always evaluated, regardless of the log level:
-#
-#       logger.error("#{my_slow_message_generator}")
-#
-# === \Severity
-#
-# The severity of a log entry has two effects:
-#
-# - Determines whether the entry is selected for inclusion in the log;
-#   see {Log Level}[rdoc-ref:Logger@Log+Level].
-# - Indicates to any log reader (whether a person or a program)
-#   the relative importance of the entry.
-#
-# === Timestamp
-#
-# The timestamp for a log entry is generated automatically
-# when the entry is created.
-#
-# The logged timestamp is formatted by method
-# {Time#strftime}[rdoc-ref:Time#strftime]
-# using this format string:
-#
-#   '%Y-%m-%dT%H:%M:%S.%6N'
-#
-# Example:
-#
-#   logger = Logger.new($stdout)
-#   logger.add(Logger::INFO)
-#   # => I, [2022-05-07T17:04:32.318331 #20536]  INFO -- : nil
-#
-# You can set a different format using method #datetime_format=.
-#
-# === Message
-#
-# The message is an optional argument to an entry method:
-#
-#   logger = Logger.new($stdout)
-#   logger.add(Logger::INFO, 'My message')
-#   # => I, [2022-05-07T18:15:37.647581 #20536]  INFO -- : My message
-#
-# For the default entry formatter, <tt>Logger::Formatter</tt>,
-# the message object may be:
-#
-# - A string: used as-is.
-# - An Exception: <tt>message.message</tt> is used.
-# - Anything else: <tt>message.inspect</tt> is used.
-#
-# *Note*: Logger::Formatter does not escape or sanitize
-# the message passed to it.
-# Developers should be aware that malicious data (user input)
-# may be in the message, and should explicitly escape untrusted data.
-#
-# You can use a custom formatter to escape message data;
-# see the example at {formatter=}[Logger.html#attribute-i-formatter].
-#
-# === Program Name
-#
-# The program name is an optional argument to an entry method:
-#
-#   logger = Logger.new($stdout)
-#   logger.add(Logger::INFO, 'My message', 'mung')
-#   # => I, [2022-05-07T18:17:38.084716 #20536]  INFO -- mung: My message
-#
-# The default program name for a new logger may be set in the call to
-# Logger.new via optional keyword argument +progname+:
-#
-#   logger = Logger.new('t.log', progname: 'mung')
-#
-# The default program name for an existing logger may be set
-# by a call to method #progname=:
-#
-#   logger.progname = 'mung'
-#
-# The current program name may be retrieved with method
-# {progname}[Logger.html#attribute-i-progname]:
-#
-#   logger.progname # => "mung"
-#
-# == Log Level
-#
-# The log level setting determines whether an entry is actually
-# written to the log, based on the entry's severity.
-#
-# These are the defined severities (least severe to most severe):
-#
-#   logger = Logger.new($stdout)
-#   logger.add(Logger::DEBUG, 'Maximal debugging info')
-#   # => D, [2022-05-07T17:57:41.776220 #20536] DEBUG -- : Maximal debugging info
-#   logger.add(Logger::INFO, 'Non-error information')
-#   # => I, [2022-05-07T17:59:14.349167 #20536]  INFO -- : Non-error information
-#   logger.add(Logger::WARN, 'Non-error warning')
-#   # => W, [2022-05-07T18:00:45.337538 #20536]  WARN -- : Non-error warning
-#   logger.add(Logger::ERROR, 'Non-fatal error')
-#   # => E, [2022-05-07T18:02:41.592912 #20536] ERROR -- : Non-fatal error
-#   logger.add(Logger::FATAL, 'Fatal error')
-#   # => F, [2022-05-07T18:05:24.703931 #20536] FATAL -- : Fatal error
-#   logger.add(Logger::UNKNOWN, 'Most severe')
-#   # => A, [2022-05-07T18:07:54.657491 #20536]   ANY -- : Most severe
-#
-# The default initial level setting is Logger::DEBUG, the lowest level,
-# which means that all entries are to be written, regardless of severity:
-#
-#   logger = Logger.new($stdout)
-#   logger.level # => 0
-#   logger.add(0, "My message")
-#   # => D, [2022-05-11T15:10:59.773668 #20536] DEBUG -- : My message
-#
-# You can specify a different setting in a new logger
-# using keyword argument +level+ with an appropriate value:
-#
-#   logger = Logger.new($stdout, level: Logger::ERROR)
-#   logger = Logger.new($stdout, level: 'error')
-#   logger = Logger.new($stdout, level: :error)
-#   logger.level # => 3
-#
-# With this level, entries with severity Logger::ERROR and higher
-# are written, while those with lower severities are not written:
-#
-#   logger = Logger.new($stdout, level: Logger::ERROR)
-#   logger.add(3)
-#   # => E, [2022-05-11T15:17:20.933362 #20536] ERROR -- : nil
-#   logger.add(2) # Silent.
-#
-# You can set the log level for an existing logger
-# with method #level=:
-#
-#   logger.level = Logger::ERROR
-#
-# These shorthand methods also set the level:
-#
-#   logger.debug! # => 0
-#   logger.info!  # => 1
-#   logger.warn!  # => 2
-#   logger.error! # => 3
-#   logger.fatal! # => 4
-#
-# You can retrieve the log level with method #level.
-#
-#   logger.level = Logger::ERROR
-#   logger.level # => 3
-#
-# These methods return whether a given
-# level is to be written:
-#
-#   logger.level = Logger::ERROR
-#   logger.debug? # => false
-#   logger.info?  # => false
-#   logger.warn?  # => false
-#   logger.error? # => true
-#   logger.fatal? # => true
-#
-# == Log File Rotation
-#
-# By default, a log file is a single file that grows indefinitely
-# (until explicitly closed); there is no file rotation.
-#
-# To keep log files to a manageable size,
-# you can use _log_ _file_ _rotation_, which uses multiple log files:
-#
-# - Each log file has entries for a non-overlapping
-#   time interval.
-# - Only the most recent log file is open and active;
-#   the others are closed and inactive.
-#
-# === Size-Based Rotation
-#
-# For size-based log file rotation, call Logger.new with:
-#
-# - Argument +logdev+ as a file path.
-# - Argument +shift_age+ with a positive integer:
-#   the number of log files to be in the rotation.
-# - Argument +shift_size+ as a positive integer:
-#   the maximum size (in bytes) of each log file;
-#   defaults to 1048576 (1 megabyte).
-#
-# Examples:
-#
-#   logger = Logger.new('t.log', 3)           # Three 1-megabyte files.
-#   logger = Logger.new('t.log', 5, 10485760) # Five 10-megabyte files.
-#
-# For these examples, suppose:
-#
-#   logger = Logger.new('t.log', 3)
-#
-# Logging begins in the new log file, +t.log+;
-# the log file is "full" and ready for rotation
-# when a new entry would cause its size to exceed +shift_size+.
-#
-# The first time +t.log+ is full:
-#
-# - +t.log+ is closed and renamed to +t.log.0+.
-# - A new file +t.log+ is opened.
-#
-# The second time +t.log+ is full:
-#
-# - +t.log.0 is renamed as +t.log.1+.
-# - +t.log+ is closed and renamed to +t.log.0+.
-# - A new file +t.log+ is opened.
-#
-# Each subsequent time that +t.log+ is full,
-# the log files are rotated:
-#
-# - +t.log.1+ is removed.
-# - +t.log.0 is renamed as +t.log.1+.
-# - +t.log+ is closed and renamed to +t.log.0+.
-# - A new file +t.log+ is opened.
-#
-# === Periodic Rotation
-#
-# For periodic rotation, call Logger.new with:
-#
-# - Argument +logdev+ as a file path.
-# - Argument +shift_age+ as a string period indicator.
-#
-# Examples:
-#
-#   logger = Logger.new('t.log', 'daily')   # Rotate log files daily.
-#   logger = Logger.new('t.log', 'weekly')  # Rotate log files weekly.
-#   logger = Logger.new('t.log', 'monthly') # Rotate log files monthly.
-#
-# Example:
-#
-#   logger = Logger.new('t.log', 'daily')
-#
-# When the given period expires:
-#
-# - The base log file, +t.log+ is closed and renamed
-#   with a date-based suffix such as +t.log.20220509+.
-# - A new log file +t.log+ is opened.
-# - Nothing is removed.
-#
-# The default format for the suffix is <tt>'%Y%m%d'</tt>,
-# which produces a suffix similar to the one above.
-# You can set a different format using create-time option
-# +shift_period_suffix+;
-# see details and suggestions at
-# {Time#strftime}[rdoc-ref:Time#strftime].
-#
-class Logger
-  _, name, rev = %w$Id$
-  if name
-    name = name.chomp(",v")
-  else
-    name = File.basename(__FILE__)
-  end
-  rev ||= "v#{VERSION}"
-  ProgName = "#{name}/#{rev}"
-
-  include Severity
-
-  # Logging severity threshold (e.g. <tt>Logger::INFO</tt>).
-  def level
-    @level_override[Fiber.current] || @level
-  end
-
-  # Sets the log level; returns +severity+.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  # Argument +severity+ may be an integer, a string, or a symbol:
-  #
-  #   logger.level = Logger::ERROR # => 3
-  #   logger.level = 3             # => 3
-  #   logger.level = 'error'       # => "error"
-  #   logger.level = :error        # => :error
-  #
-  # Logger#sev_threshold= is an alias for Logger#level=.
-  #
-  def level=(severity)
-    @level = Severity.coerce(severity)
-  end
-
-  # Adjust the log level during the block execution for the current Fiber only
-  #
-  #   logger.with_level(:debug) do
-  #     logger.debug { "Hello" }
-  #   end
-  def with_level(severity)
-    prev, @level_override[Fiber.current] = level, Severity.coerce(severity)
-    begin
-      yield
-    ensure
-      if prev
-        @level_override[Fiber.current] = prev
-      else
-        @level_override.delete(Fiber.current)
-      end
-    end
-  end
-
-  # Program name to include in log messages.
-  attr_accessor :progname
-
-  # Sets the date-time format.
-  #
-  # Argument +datetime_format+ should be either of these:
-  #
-  # - A string suitable for use as a format for method
-  #   {Time#strftime}[rdoc-ref:Time#strftime].
-  # - +nil+: the logger uses <tt>'%Y-%m-%dT%H:%M:%S.%6N'</tt>.
-  #
-  def datetime_format=(datetime_format)
-    @default_formatter.datetime_format = datetime_format
-  end
-
-  # Returns the date-time format; see #datetime_format=.
-  #
-  def datetime_format
-    @default_formatter.datetime_format
-  end
-
-  # Sets or retrieves the logger entry formatter proc.
-  #
-  # When +formatter+ is +nil+, the logger uses Logger::Formatter.
-  #
-  # When +formatter+ is a proc, a new entry is formatted by the proc,
-  # which is called with four arguments:
-  #
-  # - +severity+: The severity of the entry.
-  # - +time+: A Time object representing the entry's timestamp.
-  # - +progname+: The program name for the entry.
-  # - +msg+: The message for the entry (string or string-convertible object).
-  #
-  # The proc should return a string containing the formatted entry.
-  #
-  # This custom formatter uses
-  # {String#dump}[rdoc-ref:String#dump]
-  # to escape the message string:
-  #
-  #   logger = Logger.new($stdout, progname: 'mung')
-  #   original_formatter = logger.formatter || Logger::Formatter.new
-  #   logger.formatter = proc { |severity, time, progname, msg|
-  #     original_formatter.call(severity, time, progname, msg.dump)
-  #   }
-  #   logger.add(Logger::INFO, "hello \n ''")
-  #   logger.add(Logger::INFO, "\f\x00\xff\\\"")
-  #
-  # Output:
-  #
-  #   I, [2022-05-13T13:16:29.637488 #8492]  INFO -- mung: "hello \n ''"
-  #   I, [2022-05-13T13:16:29.637610 #8492]  INFO -- mung: "\f\x00\xFF\\\""
-  #
-  attr_accessor :formatter
-
-  alias sev_threshold level
-  alias sev_threshold= level=
-
-  # Returns +true+ if the log level allows entries with severity
-  # Logger::DEBUG to be written, +false+ otherwise.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def debug?; level <= DEBUG; end
-
-  # Sets the log level to Logger::DEBUG.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def debug!; self.level = DEBUG; end
-
-  # Returns +true+ if the log level allows entries with severity
-  # Logger::INFO to be written, +false+ otherwise.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def info?; level <= INFO; end
-
-  # Sets the log level to Logger::INFO.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def info!; self.level = INFO; end
-
-  # Returns +true+ if the log level allows entries with severity
-  # Logger::WARN to be written, +false+ otherwise.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def warn?; level <= WARN; end
-
-  # Sets the log level to Logger::WARN.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def warn!; self.level = WARN; end
-
-  # Returns +true+ if the log level allows entries with severity
-  # Logger::ERROR to be written, +false+ otherwise.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def error?; level <= ERROR; end
-
-  # Sets the log level to Logger::ERROR.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def error!; self.level = ERROR; end
-
-  # Returns +true+ if the log level allows entries with severity
-  # Logger::FATAL to be written, +false+ otherwise.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def fatal?; level <= FATAL; end
-
-  # Sets the log level to Logger::FATAL.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level].
-  #
-  def fatal!; self.level = FATAL; end
-
-  # :call-seq:
-  #    Logger.new(logdev, shift_age = 0, shift_size = 1048576, **options)
-  #
-  # With the single argument +logdev+,
-  # returns a new logger with all default options:
-  #
-  #   Logger.new('t.log') # => #<Logger:0x000001e685dc6ac8>
-  #
-  # Argument +logdev+ must be one of:
-  #
-  # - A string filepath: entries are to be written
-  #   to the file at that path; if the file at that path exists,
-  #   new entries are appended.
-  # - An IO stream (typically +$stdout+, +$stderr+. or an open file):
-  #   entries are to be written to the given stream.
-  # - +nil+ or +File::NULL+: no entries are to be written.
-  #
-  # Examples:
-  #
-  #   Logger.new('t.log')
-  #   Logger.new($stdout)
-  #
-  # The keyword options are:
-  #
-  # - +level+: sets the log level; default value is Logger::DEBUG.
-  #   See {Log Level}[rdoc-ref:Logger@Log+Level]:
-  #
-  #     Logger.new('t.log', level: Logger::ERROR)
-  #
-  # - +progname+: sets the default program name; default is +nil+.
-  #   See {Program Name}[rdoc-ref:Logger@Program+Name]:
-  #
-  #     Logger.new('t.log', progname: 'mung')
-  #
-  # - +formatter+: sets the entry formatter; default is +nil+.
-  #   See {formatter=}[Logger.html#attribute-i-formatter].
-  # - +datetime_format+: sets the format for entry timestamp;
-  #   default is +nil+.
-  #   See #datetime_format=.
-  # - +binmode+: sets whether the logger writes in binary mode;
-  #   default is +false+.
-  # - +shift_period_suffix+: sets the format for the filename suffix
-  #   for periodic log file rotation; default is <tt>'%Y%m%d'</tt>.
-  #   See {Periodic Rotation}[rdoc-ref:Logger@Periodic+Rotation].
-  #
-  def initialize(logdev, shift_age = 0, shift_size = 1048576, level: DEBUG,
-                 progname: nil, formatter: nil, datetime_format: nil,
-                 binmode: false, shift_period_suffix: '%Y%m%d')
-    self.level = level
-    self.progname = progname
-    @default_formatter = Formatter.new
-    self.datetime_format = datetime_format
-    self.formatter = formatter
-    @logdev = nil
-    @level_override = {}
-    if logdev && logdev != File::NULL
-      @logdev = LogDevice.new(logdev, shift_age: shift_age,
-        shift_size: shift_size,
-        shift_period_suffix: shift_period_suffix,
-        binmode: binmode)
-    end
-  end
-
-  # Sets the logger's output stream:
-  #
-  # - If +logdev+ is +nil+, reopens the current output stream.
-  # - If +logdev+ is a filepath, opens the indicated file for append.
-  # - If +logdev+ is an IO stream
-  #   (usually <tt>$stdout</tt>, <tt>$stderr</tt>, or an open File object),
-  #   opens the stream for append.
-  #
-  # Example:
-  #
-  #   logger = Logger.new('t.log')
-  #   logger.add(Logger::ERROR, 'one')
-  #   logger.close
-  #   logger.add(Logger::ERROR, 'two') # Prints 'log writing failed. closed stream'
-  #   logger.reopen
-  #   logger.add(Logger::ERROR, 'three')
-  #   logger.close
-  #   File.readlines('t.log')
-  #   # =>
-  #   # ["# Logfile created on 2022-05-12 14:21:19 -0500 by logger.rb/v1.5.0\n",
-  #   #  "E, [2022-05-12T14:21:27.596726 #22428] ERROR -- : one\n",
-  #   #  "E, [2022-05-12T14:23:05.847241 #22428] ERROR -- : three\n"]
-  #
-  def reopen(logdev = nil)
-    @logdev&.reopen(logdev)
-    self
-  end
-
-  # Creates a log entry, which may or may not be written to the log,
-  # depending on the entry's severity and on the log level.
-  # See {Log Level}[rdoc-ref:Logger@Log+Level]
-  # and {Entries}[rdoc-ref:Logger@Entries] for details.
-  #
-  # Examples:
-  #
-  #   logger = Logger.new($stdout, progname: 'mung')
-  #   logger.add(Logger::INFO)
-  #   logger.add(Logger::ERROR, 'No good')
-  #   logger.add(Logger::ERROR, 'No good', 'gnum')
-  #
-  # Output:
-  #
-  #   I, [2022-05-12T16:25:31.469726 #36328]  INFO -- mung: mung
-  #   E, [2022-05-12T16:25:55.349414 #36328] ERROR -- mung: No good
-  #   E, [2022-05-12T16:26:35.841134 #36328] ERROR -- gnum: No good
-  #
-  # These convenience methods have implicit severity:
-  #
-  # - #debug.
-  # - #info.
-  # - #warn.
-  # - #error.
-  # - #fatal.
-  # - #unknown.
-  #
-  def add(severity, message = nil, progname = nil)
-    severity ||= UNKNOWN
-    if @logdev.nil? or severity < level
-      return true
-    end
-    if progname.nil?
-      progname = @progname
-    end
-    if message.nil?
-      if block_given?
-        message = yield
-      else
-        message = progname
-        progname = @progname
-      end
-    end
-    @logdev.write(
-      format_message(format_severity(severity), Time.now, progname, message))
-    true
-  end
-  alias log add
-
-  # Writes the given +msg+ to the log with no formatting;
-  # returns the number of characters written,
-  # or +nil+ if no log device exists:
-  #
-  #   logger = Logger.new($stdout)
-  #   logger << 'My message.' # => 10
-  #
-  # Output:
-  #
-  #   My message.
-  #
-  def <<(msg)
-    @logdev&.write(msg)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::DEBUG</tt>.
-  #
-  def debug(progname = nil, &block)
-    add(DEBUG, nil, progname, &block)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::INFO</tt>.
-  #
-  def info(progname = nil, &block)
-    add(INFO, nil, progname, &block)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::WARN</tt>.
-  #
-  def warn(progname = nil, &block)
-    add(WARN, nil, progname, &block)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::ERROR</tt>.
-  #
-  def error(progname = nil, &block)
-    add(ERROR, nil, progname, &block)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::FATAL</tt>.
-  #
-  def fatal(progname = nil, &block)
-    add(FATAL, nil, progname, &block)
-  end
-
-  # Equivalent to calling #add with severity <tt>Logger::UNKNOWN</tt>.
-  #
-  def unknown(progname = nil, &block)
-    add(UNKNOWN, nil, progname, &block)
-  end
-
-  # Closes the logger; returns +nil+:
-  #
-  #   logger = Logger.new('t.log')
-  #   logger.close       # => nil
-  #   logger.info('foo') # Prints "log writing failed. closed stream"
-  #
-  # Related: Logger#reopen.
-  def close
-    @logdev&.close
-  end
-
-private
-
-  # \Severity label for logging (max 5 chars).
-  SEV_LABEL = %w(DEBUG INFO WARN ERROR FATAL ANY).freeze
-
-  def format_severity(severity)
-    SEV_LABEL[severity] || 'ANY'
-  end
-
-  def format_message(severity, datetime, progname, msg)
-    (@formatter || @default_formatter).call(severity, datetime, progname, msg)
-  end
-end
diff --git a/lib/logger/errors.rb b/lib/logger/errors.rb
deleted file mode 100644
index 88581793f0..0000000000
--- a/lib/logger/errors.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-# frozen_string_literal: true
-
-class Logger
-  # not used after 1.2.7. just for compat.
-  class Error < RuntimeError # :nodoc:
-  end
-  class ShiftingError < Error # :nodoc:
-  end
-end
diff --git a/lib/logger/formatter.rb b/lib/logger/formatter.rb
deleted file mode 100644
index c634dbf34d..0000000000
--- a/lib/logger/formatter.rb
+++ /dev/null
@@ -1,36 +0,0 @@
-# frozen_string_literal: true
-
-class Logger
-  # Default formatter for log messages.
-  class Formatter
-    Format = "%.1s, [%s #%d] %5s -- %s: %s\n"
-    DatetimeFormat = "%Y-%m-%dT%H:%M:%S.%6N"
-
-    attr_accessor :datetime_format
-
-    def initialize
-      @datetime_format = nil
-    end
-
-    def call(severity, time, progname, msg)
-      sprintf(Format, severity, format_datetime(time), Process.pid, severity, progname, msg2str(msg))
-    end
-
-  private
-
-    def format_datetime(time)
-      time.strftime(@datetime_format || DatetimeFormat)
-    end
-
-    def msg2str(msg)
-      case msg
-      when ::String
-        msg
-      when ::Exception
-        "#{ msg.message } (#{ msg.class })\n#{ msg.backtrace.join("\n") if msg.backtrace }"
-      else
-        msg.inspect
-      end
-    end
-  end
-end
diff --git a/lib/logger/log_device.rb b/lib/logger/log_device.rb
deleted file mode 100644
index 84277a2656..0000000000
--- a/lib/logger/log_device.rb
+++ /dev/null
@@ -1,207 +0,0 @@
-# frozen_string_literal: true
-
-require_relative 'period'
-
-class Logger
-  # Device used for logging messages.
-  class LogDevice
-    include Period
-
-    attr_reader :dev
-    attr_reader :filename
-    include MonitorMixin
-
-    def initialize(log = nil, shift_age: nil, shift_size: nil, shift_period_suffix: nil, binmode: false)
-      @dev = @filename = @shift_age = @shift_size = @shift_period_suffix = nil
-      @binmode = binmode
-      mon_initialize
-      set_dev(log)
-      if @filename
-        @shift_age = shift_age || 7
-        @shift_size = shift_size || 1048576
-        @shift_period_suffix = shift_period_suffix || '%Y%m%d'
-
-        unless @shift_age.is_a?(Integer)
-          base_time = @dev.respond_to?(:stat) ? @dev.stat.mtime : Time.now
-          @next_rotate_time = next_rotate_time(base_time, @shift_age)
-        end
-      end
-    end
-
-    def write(message)
-      begin
-        synchronize do
-          if @shift_age and @dev.respond_to?(:stat)
-            begin
-              check_shift_log
-            rescue
-              warn("log shifting failed. #{$!}")
-            end
-          end
-          begin
-            @dev.write(message)
-          rescue
-            warn("log writing failed. #{$!}")
-          end
-        end
-      rescue Exception => ignored
-        warn("log writing failed. #{ignored}")
-      end
-    end
-
-    def close
-      begin
-        synchronize do
-          @dev.close rescue nil
-        end
-      rescue Exception
-        @dev.close rescue nil
-      end
-    end
-
-    def reopen(log = nil)
-      # reopen the same filename if no argument, do nothing for IO
-      log ||= @filename if @filename
-      if log
-        synchronize do
-          if @filename and @dev
-            @dev.close rescue nil # close only file opened by Logger
-            @filename = nil
-          end
-          set_dev(log)
-        end
-      end
-      self
-    end
-
-  private
-
-    def set_dev(log)
-      if log.respond_to?(:write) and log.respond_to?(:close)
-        @dev = log
-        if log.respond_to?(:path) and path = log.path
-          if File.exist?(path)
-            @filename = path
-          end
-        end
-      else
-        @dev = open_logfile(log)
-        @dev.sync = true
-        @dev.binmode if @binmode
-        @filename = log
-      end
-    end
-
-    def open_logfile(filename)
-      begin
-        File.open(filename, (File::WRONLY | File::APPEND))
-      rescue Errno::ENOENT
-        create_logfile(filename)
-      end
-    end
-
-    def create_logfile(filename)
-      begin
-        logdev = File.open(filename, (File::WRONLY | File::APPEND | File::CREAT | File::EXCL))
-        logdev.flock(File::LOCK_EX)
-        logdev.sync = true
-        logdev.binmode if @binmode
-        add_log_header(logdev)
-        logdev.flock(File::LOCK_UN)
-      rescue Errno::EEXIST
-        # file is created by another process
-        logdev = open_logfile(filename)
-        logdev.sync = true
-      end
-      logdev
-    end
-
-    def add_log_header(file)
-      file.write(
-        "# Logfile created on %s by %s\n" % [Time.now.to_s, Logger::ProgName]
-      ) if file.size == 0
-    end
-
-    def check_shift_log
-      if @shift_age.is_a?(Integer)
-        # Note: always returns false if '0'.
-        if @filename && (@shift_age > 0) && (@dev.stat.size > @shift_size)
-          lock_shift_log { shift_log_age }
-        end
-      else
-        now = Time.now
-        if now >= @next_rotate_time
-          @next_rotate_time = next_rotate_time(now, @shift_age)
-          lock_shift_log { shift_log_period(previous_period_end(now, @shift_age)) }
-        end
-      end
-    end
-
-    if /mswin|mingw|cygwin/ =~ RbConfig::CONFIG['host_os']
-      def lock_shift_log
-        yield
-      end
-    else
-      def lock_shift_log
-        retry_limit = 8
-        retry_sleep = 0.1
-        begin
-          File.open(@filename, File::WRONLY | File::APPEND) do |lock|
-            lock.flock(File::LOCK_EX) # inter-process locking. will be unlocked at closing file
-            if File.identical?(@filename, lock) and File.identical?(lock, @dev)
-              yield # log shifting
-            else
-              # log shifted by another process (i-node before locking and i-node after locking are different)
-              @dev.close rescue nil
-              @dev = open_logfile(@filename)
-              @dev.sync = true
-            end
-          end
-        rescue Errno::ENOENT
-          # @filename file would not exist right after #rename and before #create_logfile
-          if retry_limit <= 0
-            warn("log rotation inter-process lock failed. #{$!}")
-          else
-            sleep retry_sleep
-            retry_limit -= 1
-            retry_sleep *= 2
-            retry
-          end
-        end
-      rescue
-        warn("log rotation inter-process lock failed. #{$!}")
-      end
-    end
-
-    def shift_log_age
-      (@shift_age-3).downto(0) do |i|
-        if FileTest.exist?("#{@filename}.#{i}")
-          File.rename("#{@filename}.#{i}", "#{@filename}.#{i+1}")
-        end
-      end
-      @dev.close rescue nil
-      File.rename("#{@filename}", "#{@filename}.0")
-      @dev = create_logfile(@filename)
-      return true
-    end
-
-    def shift_log_period(period_end)
-      suffix = period_end.strftime(@shift_period_suffix)
-      age_file = "#{@filename}.#{suffix}"
-      if FileTest.exist?(age_file)
-        # try to avoid filename crash caused by Timestamp change.
-        idx = 0
-        # .99 can be overridden; avoid too much file search with 'loop do'
-        while idx < 100
-          idx += 1
-          age_file = "#{@filename}.#{suffix}.#{idx}"
-          break unless FileTest.exist?(age_file)
-        end
-      end
-      @dev.close rescue nil
-      File.rename("#{@filename}", age_file)
-      @dev = create_logfile(@filename)
-      return true
-    end
-  end
-end
diff --git a/lib/logger/logger.gemspec b/lib/logger/logger.gemspec
deleted file mode 100644
index 5e8232e4ab..0000000000
--- a/lib/logger/logger.gemspec
+++ /dev/null
@@ -1,22 +0,0 @@
-begin
-  require_relative "lib/logger/version"
-rescue LoadError # Fallback to load version file in ruby core repository
-  require_relative "version"
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = "logger"
-  spec.version       = Logger::VERSION
-  spec.authors       = ["Naotoshi Seo", "SHIBATA Hiroshi"]
-  spec.email         = ["sonots@gmail.com", "hsbt@ruby-lang.org"]
-
-  spec.summary       = %q{Provides a simple logging utility for outputting messages.}
-  spec.description   = %q{Provides a simple logging utility for outputting messages.}
-  spec.homepage      = "https://github.com/ruby/logger"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  spec.files         = Dir.glob("lib/**/*.rb") + ["logger.gemspec"]
-  spec.require_paths = ["lib"]
-
-  spec.required_ruby_version = ">= 2.5.0"
-end
diff --git a/lib/logger/period.rb b/lib/logger/period.rb
deleted file mode 100644
index 0a291dbbbe..0000000000
--- a/lib/logger/period.rb
+++ /dev/null
@@ -1,47 +0,0 @@
-# frozen_string_literal: true
-
-class Logger
-  module Period
-    module_function
-
-    SiD = 24 * 60 * 60
-
-    def next_rotate_time(now, shift_age)
-      case shift_age
-      when 'daily'
-        t = Time.mktime(now.year, now.month, now.mday) + SiD
-      when 'weekly'
-        t = Time.mktime(now.year, now.month, now.mday) + SiD * (7 - now.wday)
-      when 'monthly'
-        t = Time.mktime(now.year, now.month, 1) + SiD * 32
-        return Time.mktime(t.year, t.month, 1)
-      when 'now', 'everytime'
-        return now
-      else
-        raise ArgumentError, "invalid :shift_age #{shift_age.inspect}, should be daily, weekly, monthly, or everytime"
-      end
-      if t.hour.nonzero? or t.min.nonzero? or t.sec.nonzero?
-        hour = t.hour
-        t = Time.mktime(t.year, t.month, t.mday)
-        t += SiD if hour > 12
-      end
-      t
-    end
-
-    def previous_period_end(now, shift_age)
-      case shift_age
-      when 'daily'
-        t = Time.mktime(now.year, now.month, now.mday) - SiD / 2
-      when 'weekly'
-        t = Time.mktime(now.year, now.month, now.mday) - (SiD * now.wday + SiD / 2)
-      when 'monthly'
-        t = Time.mktime(now.year, now.month, 1) - SiD / 2
-      when 'now', 'everytime'
-        return now
-      else
-        raise ArgumentError, "invalid :shift_age #{shift_age.inspect}, should be daily, weekly, monthly, or everytime"
-      end
-      Time.mktime(t.year, t.month, t.mday, 23, 59, 59)
-    end
-  end
-end
diff --git a/lib/logger/severity.rb b/lib/logger/severity.rb
deleted file mode 100644
index e96fb0d320..0000000000
--- a/lib/logger/severity.rb
+++ /dev/null
@@ -1,38 +0,0 @@
-# frozen_string_literal: true
-
-class Logger
-  # Logging severity.
-  module Severity
-    # Low-level information, mostly for developers.
-    DEBUG = 0
-    # Generic (useful) information about system operation.
-    INFO = 1
-    # A warning.
-    WARN = 2
-    # A handleable error condition.
-    ERROR = 3
-    # An unhandleable error that results in a program crash.
-    FATAL = 4
-    # An unknown message that should always be logged.
-    UNKNOWN = 5
-
-    LEVELS = {
-      "debug" => DEBUG,
-      "info" => INFO,
-      "warn" => WARN,
-      "error" => ERROR,
-      "fatal" => FATAL,
-      "unknown" => UNKNOWN,
-    }
-    private_constant :LEVELS
-
-    def self.coerce(severity)
-      if severity.is_a?(Integer)
-        severity
-      else
-        key = severity.to_s.downcase
-        LEVELS[key] || raise(ArgumentError, "invalid log level: #{severity}")
-      end
-    end
-  end
-end
diff --git a/lib/logger/version.rb b/lib/logger/version.rb
deleted file mode 100644
index 202b6e4fba..0000000000
--- a/lib/logger/version.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-# frozen_string_literal: true
-
-class Logger
-  VERSION = "1.6.0"
-end
diff --git a/lib/mkmf.rb b/lib/mkmf.rb
index 73459ffeb9..37ee4a70d9 100644
--- a/lib/mkmf.rb
+++ b/lib/mkmf.rb
@@ -40,7 +40,7 @@ class Array # :nodoc:
 end
 
 ##
-# mkmf.rb is used by Ruby C extensions to generate a Makefile which will
+# \Module \MakeMakefile is used by Ruby C extensions to generate a Makefile which will
 # correctly compile and link the C extension to Ruby and a third-party
 # library.
 module MakeMakefile
@@ -419,7 +419,7 @@ MESSAGE
 
     # disable ASAN leak reporting - conftest programs almost always don't bother
     # to free their memory.
-    envs['ASAN_OPTIONS'] = "detect_leaks=0" unless ENV.key?('ASAN_OPTIONS')
+    envs['LSAN_OPTIONS'] = "detect_leaks=0" unless ENV.key?('LSAN_OPTIONS')
 
     return envs, expand[commands]
   end
@@ -573,24 +573,30 @@ MSG
                      conf)
   end
 
-  def cpp_command(outfile, opt="")
+  def cpp_config(opt)
     conf = cc_config(opt)
     if $universal and (arch_flag = conf['ARCH_FLAG']) and !arch_flag.empty?
       conf['ARCH_FLAG'] = arch_flag.gsub(/(?:\G|\s)-arch\s+\S+/, '')
     end
+    conf
+  end
+
+  def cpp_command(outfile, opt="")
+    conf = cpp_config(opt)
     RbConfig::expand("$(CPP) #$INCFLAGS #$CPPFLAGS #$CFLAGS #{opt} #{CONFTEST_C} #{outfile}",
                      conf)
   end
 
   def libpathflag(libpath=$DEFLIBPATH|$LIBPATH)
+    libpathflags = nil
     libpath.map{|x|
       case x
       when "$(topdir)", /\A\./
         LIBPATHFLAG
       else
-        LIBPATHFLAG+RPATHFLAG
+        libpathflags ||= [LIBPATHFLAG, RPATHFLAG].grep(/\S/).join(" ")
       end % x.quote
-    }.join
+    }.join(" ")
   end
 
   def werror_flag(opt = nil)
@@ -603,9 +609,9 @@ MSG
     yield(opt, opts)
   end
 
-  def try_link0(src, opt = "", **opts, &b) # :nodoc:
+  def try_link0(src, opt = "", ldflags: "", **opts, &b) # :nodoc:
     exe = CONFTEST+$EXEEXT
-    cmd = link_command("", opt)
+    cmd = link_command(ldflags, opt)
     if $universal
       require 'tmpdir'
       Dir.mktmpdir("mkmf_", oldtmpdir = ENV["TMPDIR"]) do |tmpdir|
@@ -749,7 +755,7 @@ MSG
 
   # :nodoc:
   def try_ldflags(flags, werror: $mswin, **opts)
-    try_link(MAIN_DOES_NOTHING, flags, werror: werror, **opts)
+    try_link(MAIN_DOES_NOTHING, "", ldflags: flags, werror: werror, **opts)
   end
 
   # :startdoc:
@@ -859,7 +865,7 @@ int main() {printf("%"PRI_CONFTEST_PREFIX"#{neg ? 'd' : 'u'}\\n", conftest_const
         v
       }
       unless strvars.empty?
-        prepare << "char " << strvars.map {|v| "#{v}[1024]"}.join(", ") << "; "
+        prepare << "char " << strvars.map {|v| %[#{v}[1024] = ""]}.join(", ") << "; "
       end
     when nil
       call = ""
@@ -925,20 +931,12 @@ SRC
     xpopen(cpp_command('', opt)) do |f|
       if Regexp === pat
         puts("    ruby -ne 'print if #{pat.inspect}'")
-        f.grep(pat) {|l|
+        !f.grep(pat) {|l|
           puts "#{f.lineno}: #{l}"
-          return true
-        }
-        false
+        }.empty?
       else
         puts("    egrep '#{pat}'")
-        begin
-          stdin = $stdin.dup
-          $stdin.reopen(f)
-          system("egrep", pat)
-        ensure
-          $stdin.reopen(stdin)
-        end
+        system("egrep", pat, in: f)
       end
     end
   ensure
@@ -1967,7 +1965,7 @@ SRC
       if pkgconfig = with_config("#{pkg}-config") and find_executable0(pkgconfig)
       # if and only if package specific config command is given
       elsif ($PKGCONFIG ||=
-             (pkgconfig = with_config("pkg-config") {config_string("PKG_CONFIG") || "pkg-config"}) &&
+             (pkgconfig = with_config("pkg-config") {config_string("PKG_CONFIG") || ENV["PKG_CONFIG"] || "pkg-config"}) &&
              find_executable0(pkgconfig) && pkgconfig) and
            xsystem([*envs, $PKGCONFIG, "--exists", pkg])
         # default to pkg-config command
@@ -1983,7 +1981,20 @@ SRC
           opts = Array(opts).map { |o| "--#{o}" }
           opts = xpopen([*envs, pkgconfig, *opts, *args], err:[:child, :out], &:read)
           Logging.open {puts opts.each_line.map{|s|"=> #{s.inspect}"}}
-          opts.strip if $?.success?
+          if $?.success?
+            opts = opts.strip
+            libarg, libpath = LIBARG, LIBPATHFLAG.strip
+            opts = opts.shellsplit.map { |s|
+              if s.start_with?('-l')
+                libarg % s[2..]
+              elsif s.start_with?('-L')
+                libpath % s[2..]
+              else
+                s
+              end
+            }.quote.join(" ")
+            opts
+          end
         }
       end
       orig_ldflags = $LDFLAGS
@@ -2367,6 +2378,19 @@ RULES
   # directory, i.e. the current directory.  It is included as part of the
   # +VPATH+ and added to the list of +INCFLAGS+.
   #
+  # Yields the configuration part of the makefile to be generated, as an array
+  # of strings, if the block is given.  The returned value will be used the
+  # new configuration part.
+  #
+  #   create_makefile('foo') {|conf|
+  #     [
+  #       *conf,
+  #       "MACRO_YOU_NEED = something",
+  #     ]
+  #   }
+  #
+  # If "depend" file exist in the source directory, that content will be
+  # included in the generated makefile, with formatted by depend_rules method.
   def create_makefile(target, srcprefix = nil)
     $target = target
     libpath = $DEFLIBPATH|$LIBPATH
@@ -2483,16 +2507,19 @@ TIMESTAMP_DIR = #{$extout && $extmk ? '$(extout)/.timestamp' : '.'}
     sodir = $extout ? '$(TARGET_SO_DIR)' : '$(RUBYARCHDIR)'
     n = '$(TARGET_SO_DIR)$(TARGET)'
     cleanobjs = ["$(OBJS)"]
+    cleanlibs = []
     if $extmk
       %w[bc i s].each {|ex| cleanobjs << "$(OBJS:.#{$OBJEXT}=.#{ex})"}
     end
     if target
       config_string('cleanobjs') {|t| cleanobjs << t.gsub(/\$\*/, "$(TARGET)#{deffile ? '-$(arch)': ''}")}
+      cleanlibs << '$(TARGET_SO)'
     end
+    config_string('cleanlibs') {|t| cleanlibs << t.gsub(/\$\*/) {n}}
     conf << "\
 TARGET_SO_DIR =#{$extout ? " $(RUBYARCHDIR)/" : ''}
 TARGET_SO     = $(TARGET_SO_DIR)$(DLLIB)
-CLEANLIBS     = #{'$(TARGET_SO) ' if target}#{config_string('cleanlibs') {|t| t.gsub(/\$\*/) {n}}}
+CLEANLIBS     = #{cleanlibs.join(' ')}
 CLEANOBJS     = #{cleanobjs.join(' ')} *.bak
 TARGET_SO_DIR_TIMESTAMP = #{timestamp_file(sodir, target_prefix)}
 " #"
@@ -2564,7 +2591,7 @@ static: #{$extmk && !$static ? "all" : %[$(STATIC_LIB)#{$extout ? " install-rb"
           dest = "#{dir}/#{File.basename(f)}"
           mfile.print("do-install-rb#{sfx}: #{dest}\n")
           mfile.print("#{dest}: #{f} #{timestamp_file(dir, target_prefix)}\n")
-          mfile.print("\t$(Q) $(#{$extout ? 'COPY' : 'INSTALL_DATA'}) #{f} $(@D)\n")
+          mfile.print("\t$(Q) $(#{$extout ? 'COPY' : 'INSTALL_DATA'}) #{f} $@\n")
           if defined?($installed_list) and !$extout
             mfile.print("\t@echo #{dest}>>$(INSTALLED_LIST)\n")
           end
@@ -2906,7 +2933,7 @@ MESSAGE
   ##
   # Argument which will add a library path to the linker
 
-  LIBPATHFLAG = config_string('LIBPATHFLAG') || ' -L%s'
+  LIBPATHFLAG = config_string('LIBPATHFLAG') || '-L%s'
 
   ##
   # Argument which will add a runtime library path to the linker
@@ -3003,15 +3030,32 @@ realclean: distclean
 
     def cc_command(opt="")
       conf = cc_config(opt)
+      cxx_command(opt, conf)
       RbConfig::expand("$(CXX) #$INCFLAGS #$CPPFLAGS #$CXXFLAGS #$ARCH_FLAG #{opt} -c #{CONFTEST_CXX}",
                        conf)
     end
 
+    def cpp_command(outfile, opt="")
+      conf = cpp_config(opt)
+      cxx = cxx_command(opt, conf)
+      cpp = conf['CPP'].sub(/(\A|\s)#{Regexp.quote(conf['CC'])}(?=\z|\s)/) {
+        "#$1#{cxx}"
+      }
+      RbConfig::expand("#{cpp} #$INCFLAGS #$CPPFLAGS #$CXXFLAGS #{opt} #{CONFTEST_CXX} #{outfile}",
+                       conf)
+    end
+
     def link_command(ldflags, *opts)
       conf = link_config(ldflags, *opts)
       RbConfig::expand(TRY_LINK_CXX.dup, conf)
     end
 
+    def cxx_command(opt="", conf = cc_config(opt))
+      cxx = conf['CXX']
+      raise Errno::ENOENT, "C++ compiler not found" if !cxx or cxx == 'false'
+      cxx
+    end
+
     # :startdoc:
   end
 
diff --git a/lib/monitor.rb b/lib/monitor.rb
new file mode 100644
index 0000000000..21329a5de7
--- /dev/null
+++ b/lib/monitor.rb
@@ -0,0 +1,216 @@
+# frozen_string_literal: false
+# = monitor.rb
+#
+# Copyright (C) 2001  Shugo Maeda <shugo@ruby-lang.org>
+#
+# This library is distributed under the terms of the Ruby license.
+# You can freely distribute/modify this library.
+#
+#
+# In concurrent programming, a monitor is an object or module intended to be
+# used safely by more than one thread. The defining characteristic of a
+# monitor is that its methods are executed with mutual exclusion. That is, at
+# each point in time, at most one thread may be executing any of its methods.
+# This mutual exclusion greatly simplifies reasoning about the implementation
+# of monitors compared to reasoning about parallel code that updates a data
+# structure.
+#
+# You can read more about the general principles on the Wikipedia page for
+# Monitors[https://en.wikipedia.org/wiki/Monitor_%28synchronization%29].
+#
+# == Examples
+#
+# === Simple object.extend
+#
+#   require 'monitor.rb'
+#
+#   buf = []
+#   buf.extend(MonitorMixin)
+#   empty_cond = buf.new_cond
+#
+#   # consumer
+#   Thread.start do
+#     loop do
+#       buf.synchronize do
+#         empty_cond.wait_while { buf.empty? }
+#         print buf.shift
+#       end
+#     end
+#   end
+#
+#   # producer
+#   while line = ARGF.gets
+#     buf.synchronize do
+#       buf.push(line)
+#       empty_cond.signal
+#     end
+#   end
+#
+# The consumer thread waits for the producer thread to push a line to buf
+# while <tt>buf.empty?</tt>. The producer thread (main thread) reads a
+# line from ARGF and pushes it into buf then calls <tt>empty_cond.signal</tt>
+# to notify the consumer thread of new data.
+#
+# === Simple Class include
+#
+#   require 'monitor'
+#
+#   class SynchronizedArray < Array
+#
+#     include MonitorMixin
+#
+#     def initialize(*args)
+#       super(*args)
+#     end
+#
+#     alias :old_shift :shift
+#     alias :old_unshift :unshift
+#
+#     def shift(n=1)
+#       self.synchronize do
+#         self.old_shift(n)
+#       end
+#     end
+#
+#     def unshift(item)
+#       self.synchronize do
+#         self.old_unshift(item)
+#       end
+#     end
+#
+#     # other methods ...
+#   end
+#
+# +SynchronizedArray+ implements an Array with synchronized access to items.
+# This Class is implemented as subclass of Array which includes the
+# MonitorMixin module.
+#
+module MonitorMixin
+  ConditionVariable = Monitor::ConditionVariable # :nodoc:
+
+  #
+  # FIXME: This isn't documented in Nutshell.
+  #
+  # Since MonitorMixin.new_cond returns a ConditionVariable, and the example
+  # above calls while_wait and signal, this class should be documented.
+  #
+
+  def self.extend_object(obj) # :nodoc:
+    super(obj)
+    obj.__send__(:mon_initialize)
+  end
+
+  #
+  # Attempts to enter exclusive section.  Returns +false+ if lock fails.
+  #
+  def mon_try_enter
+    @mon_data.try_enter
+  end
+  # For backward compatibility
+  alias try_mon_enter mon_try_enter
+
+  #
+  # Enters exclusive section.
+  #
+  def mon_enter
+    @mon_data.enter
+  end
+
+  #
+  # Leaves exclusive section.
+  #
+  def mon_exit
+    mon_check_owner
+    @mon_data.exit
+  end
+
+  #
+  # Returns true if this monitor is locked by any thread
+  #
+  def mon_locked?
+    @mon_data.mon_locked?
+  end
+
+  #
+  # Returns true if this monitor is locked by current thread.
+  #
+  def mon_owned?
+    @mon_data.mon_owned?
+  end
+
+  #
+  # Enters exclusive section and executes the block.  Leaves the exclusive
+  # section automatically when the block exits.  See example under
+  # +MonitorMixin+.
+  #
+  def mon_synchronize(&b)
+    @mon_data.synchronize(&b)
+  end
+  alias synchronize mon_synchronize
+
+  #
+  # Creates a new MonitorMixin::ConditionVariable associated with the
+  # Monitor object.
+  #
+  def new_cond
+    unless defined?(@mon_data)
+      mon_initialize
+      @mon_initialized_by_new_cond = true
+    end
+    return ConditionVariable.new(@mon_data)
+  end
+
+  private
+
+  # Use <tt>extend MonitorMixin</tt> or <tt>include MonitorMixin</tt> instead
+  # of this constructor.  Have look at the examples above to understand how to
+  # use this module.
+  def initialize(...)
+    super
+    mon_initialize
+  end
+
+  # Initializes the MonitorMixin after being included in a class or when an
+  # object has been extended with the MonitorMixin
+  def mon_initialize
+    if defined?(@mon_data)
+      if defined?(@mon_initialized_by_new_cond)
+        return # already initialized.
+      elsif @mon_data_owner_object_id == self.object_id
+        raise ThreadError, "already initialized"
+      end
+    end
+    @mon_data = ::Monitor.new
+    @mon_data_owner_object_id = self.object_id
+  end
+
+  # Ensures that the MonitorMixin is owned by the current thread,
+  # otherwise raises an exception.
+  def mon_check_owner
+    @mon_data.mon_check_owner
+  end
+end
+
+class Monitor # :nodoc:
+  alias try_mon_enter try_enter
+  alias mon_try_enter try_enter
+  alias mon_enter enter
+  alias mon_exit exit
+  alias mon_synchronize synchronize
+end
+
+# Documentation comments:
+#  - All documentation comes from Nutshell.
+#  - MonitorMixin.new_cond appears in the example, but is not documented in
+#    Nutshell.
+#  - All the internals (internal modules Accessible and Initializable, class
+#    ConditionVariable) appear in RDoc.  It might be good to hide them, by
+#    making them private, or marking them :nodoc:, etc.
+#  - RDoc doesn't recognise aliases, so we have mon_synchronize documented, but
+#    not synchronize.
+#  - mon_owner is in Nutshell, but appears as an accessor in a separate module
+#    here, so is hard/impossible to RDoc.  Some other useful accessors
+#    (mon_count and some queue stuff) are also in this module, and don't appear
+#    directly in the RDoc output.
+#  - in short, it may be worth changing the code layout in this file to make the
+#    documentation easier
diff --git a/lib/net/http.rb b/lib/net/http.rb
index 958ff09f0e..53295fe90c 100644
--- a/lib/net/http.rb
+++ b/lib/net/http.rb
@@ -37,7 +37,7 @@ module Net   #:nodoc:
   # For information about \HTTP, see:
   #
   # - {Hypertext Transfer Protocol}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol].
-  # - {Technical overview}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Technical_overview].
+  # - {Technology}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Technology].
   #
   # == About the Examples
   #
@@ -72,7 +72,7 @@ module Net   #:nodoc:
   #
   # - If performance is important, consider using sessions, which lower request overhead.
   #   This {session}[rdoc-ref:Net::HTTP@Sessions] has multiple requests for
-  #   {HTTP methods}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Request_methods]
+  #   {HTTP methods}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Method]
   #   and {WebDAV methods}[https://en.wikipedia.org/wiki/WebDAV#Implementation]:
   #
   #     Net::HTTP.start(hostname) do |http|
@@ -198,7 +198,7 @@ module Net   #:nodoc:
   # In the block, you can use these instance methods,
   # each of which that sends a single request:
   #
-  # - {HTTP methods}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Request_methods]:
+  # - {HTTP methods}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Method]:
   #
   #   - #get, #request_get: GET.
   #   - #head, #request_head: HEAD.
@@ -447,7 +447,7 @@ module Net   #:nodoc:
   # if the response has header <tt>'Content-Range'</tt>.
   #
   # Otherwise decompression (or not) depends on the value of header
-  # {Content-Encoding}[https://en.wikipedia.org/wiki/List_of_HTTP_header_fields#content-encoding-response-header]:
+  # {Content-Encoding}[https://en.wikipedia.org/wiki/List_of_HTTP_header_fields#Content-Encoding_2]:
   #
   # - <tt>'deflate'</tt>, <tt>'gzip'</tt>, or <tt>'x-gzip'</tt>:
   #   decompresses the body and deletes the header.
@@ -460,7 +460,7 @@ module Net   #:nodoc:
   #
   # First, what's elsewhere. Class Net::HTTP:
   #
-  # - Inherits from {class Object}[rdoc-ref:Object@What-27s+Here].
+  # - Inherits from {class Object}[rdoc-ref:Object#class-object-whats-here].
   #
   # This is a categorized summary of methods and attributes.
   #
@@ -475,8 +475,7 @@ module Net   #:nodoc:
   #
   # - {::start}[rdoc-ref:Net::HTTP.start]:
   #   Begins a new session in a new \Net::HTTP object.
-  # - {#started?}[rdoc-ref:Net::HTTP#started?]
-  #   (aliased as {#active?}[rdoc-ref:Net::HTTP#active?]):
+  # - {#started?}[rdoc-ref:Net::HTTP#started?]:
   #   Returns whether in a session.
   # - {#finish}[rdoc-ref:Net::HTTP#finish]:
   #   Ends an active session.
@@ -556,18 +555,15 @@ module Net   #:nodoc:
   #   Sends a PUT request and returns a response object.
   # - {#request}[rdoc-ref:Net::HTTP#request]:
   #   Sends a request and returns a response object.
-  # - {#request_get}[rdoc-ref:Net::HTTP#request_get]
-  #   (aliased as {#get2}[rdoc-ref:Net::HTTP#get2]):
+  # - {#request_get}[rdoc-ref:Net::HTTP#request_get]:
   #   Sends a GET request and forms a response object;
   #   if a block given, calls the block with the object,
   #   otherwise returns the object.
-  # - {#request_head}[rdoc-ref:Net::HTTP#request_head]
-  #   (aliased as {#head2}[rdoc-ref:Net::HTTP#head2]):
+  # - {#request_head}[rdoc-ref:Net::HTTP#request_head]:
   #   Sends a HEAD request and forms a response object;
   #   if a block given, calls the block with the object,
   #   otherwise returns the object.
-  # - {#request_post}[rdoc-ref:Net::HTTP#request_post]
-  #   (aliased as {#post2}[rdoc-ref:Net::HTTP#post2]):
+  # - {#request_post}[rdoc-ref:Net::HTTP#request_post]:
   #   Sends a POST request and forms a response object;
   #   if a block given, calls the block with the object,
   #   otherwise returns the object.
@@ -605,8 +601,7 @@ module Net   #:nodoc:
   #   Returns whether +self+ is a proxy class.
   # - {#proxy?}[rdoc-ref:Net::HTTP#proxy?]:
   #   Returns whether +self+ has a proxy.
-  # - {#proxy_address}[rdoc-ref:Net::HTTP#proxy_address]
-  #   (aliased as {#proxyaddr}[rdoc-ref:Net::HTTP#proxyaddr]):
+  # - {#proxy_address}[rdoc-ref:Net::HTTP#proxy_address]:
   #   Returns the proxy address.
   # - {#proxy_from_env?}[rdoc-ref:Net::HTTP#proxy_from_env?]:
   #   Returns whether the proxy is taken from an environment variable.
@@ -718,8 +713,7 @@ module Net   #:nodoc:
   # === \HTTP Version
   #
   # - {::version_1_2?}[rdoc-ref:Net::HTTP.version_1_2?]
-  #   (aliased as {::is_version_1_2?}[rdoc-ref:Net::HTTP.is_version_1_2?]
-  #   and {::version_1_2}[rdoc-ref:Net::HTTP.version_1_2]):
+  #   (aliased as {::version_1_2}[rdoc-ref:Net::HTTP.version_1_2]):
   #   Returns true; retained for compatibility.
   #
   # === Debugging
@@ -730,7 +724,7 @@ module Net   #:nodoc:
   class HTTP < Protocol
 
     # :stopdoc:
-    VERSION = "0.4.1"
+    VERSION = "0.9.1"
     HTTPVersion = '1.1'
     begin
       require 'zlib'
@@ -1103,7 +1097,7 @@ module Net   #:nodoc:
     # For proxy-defining arguments +p_addr+ through +p_no_proxy+,
     # see {Proxy Server}[rdoc-ref:Net::HTTP@Proxy+Server].
     #
-    def HTTP.new(address, port = nil, p_addr = :ENV, p_port = nil, p_user = nil, p_pass = nil, p_no_proxy = nil)
+    def HTTP.new(address, port = nil, p_addr = :ENV, p_port = nil, p_user = nil, p_pass = nil, p_no_proxy = nil, p_use_ssl = nil)
       http = super address, port
 
       if proxy_class? then # from Net::HTTP::Proxy()
@@ -1112,6 +1106,7 @@ module Net   #:nodoc:
         http.proxy_port     = @proxy_port
         http.proxy_user     = @proxy_user
         http.proxy_pass     = @proxy_pass
+        http.proxy_use_ssl  = @proxy_use_ssl
       elsif p_addr == :ENV then
         http.proxy_from_env = true
       else
@@ -1123,34 +1118,68 @@ module Net   #:nodoc:
         http.proxy_port    = p_port || default_port
         http.proxy_user    = p_user
         http.proxy_pass    = p_pass
+        http.proxy_use_ssl = p_use_ssl
       end
 
       http
     end
 
+    class << HTTP
+      # Allows to set the default configuration that will be used
+      # when creating a new connection.
+      #
+      # Example:
+      #
+      #   Net::HTTP.default_configuration = {
+      #     read_timeout: 1,
+      #     write_timeout: 1
+      #   }
+      #   http = Net::HTTP.new(hostname)
+      #   http.open_timeout   # => 60
+      #   http.read_timeout   # => 1
+      #   http.write_timeout  # => 1
+      #
+      attr_accessor :default_configuration
+    end
+
     # Creates a new \Net::HTTP object for the specified server address,
     # without opening the TCP connection or initializing the \HTTP session.
     # The +address+ should be a DNS hostname or IP address.
     def initialize(address, port = nil) # :nodoc:
+      defaults = {
+        keep_alive_timeout: 2,
+        close_on_empty_response: false,
+        open_timeout: 60,
+        read_timeout: 60,
+        write_timeout: 60,
+        continue_timeout: nil,
+        max_retries: 1,
+        debug_output: nil,
+        response_body_encoding: false,
+        ignore_eof: true
+      }
+      options = defaults.merge(self.class.default_configuration || {})
+
       @address = address
       @port    = (port || HTTP.default_port)
       @ipaddr = nil
       @local_host = nil
       @local_port = nil
       @curr_http_version = HTTPVersion
-      @keep_alive_timeout = 2
+      @keep_alive_timeout = options[:keep_alive_timeout]
       @last_communicated = nil
-      @close_on_empty_response = false
+      @close_on_empty_response = options[:close_on_empty_response]
       @socket  = nil
       @started = false
-      @open_timeout = 60
-      @read_timeout = 60
-      @write_timeout = 60
-      @continue_timeout = nil
-      @max_retries = 1
-      @debug_output = nil
-      @response_body_encoding = false
-      @ignore_eof = true
+      @open_timeout = options[:open_timeout]
+      @read_timeout = options[:read_timeout]
+      @write_timeout = options[:write_timeout]
+      @continue_timeout = options[:continue_timeout]
+      @max_retries = options[:max_retries]
+      @debug_output = options[:debug_output]
+      @response_body_encoding = options[:response_body_encoding]
+      @ignore_eof = options[:ignore_eof]
+      @tcpsocket_supports_open_timeout = nil
 
       @proxy_from_env = false
       @proxy_uri      = nil
@@ -1158,6 +1187,7 @@ module Net   #:nodoc:
       @proxy_port     = nil
       @proxy_user     = nil
       @proxy_pass     = nil
+      @proxy_use_ssl  = nil
 
       @use_ssl = false
       @ssl_context = nil
@@ -1274,7 +1304,7 @@ module Net   #:nodoc:
 
     # Sets whether to determine the proxy from environment variable
     # '<tt>ENV['http_proxy']</tt>';
-    # see {Proxy Using ENV['http_proxy']}[rdoc-ref:Net::HTTP@Proxy+Using+-27ENV-5B-27http_proxy-27-5D-27].
+    # see {Proxy Using ENV['http_proxy']}[rdoc-ref:Net::HTTP@Proxy+Using+ENVHTTPProxy].
     attr_writer :proxy_from_env
 
     # Sets the proxy address;
@@ -1293,6 +1323,10 @@ module Net   #:nodoc:
     # see {Proxy Server}[rdoc-ref:Net::HTTP@Proxy+Server].
     attr_writer :proxy_pass
 
+    # Sets whether the proxy uses SSL;
+    # see {Proxy Server}[rdoc-ref:Net::HTTP@Proxy+Server].
+    attr_writer :proxy_use_ssl
+
     # Returns the IP address for the connection.
     #
     # If the session has not been started,
@@ -1481,23 +1515,6 @@ module Net   #:nodoc:
       @use_ssl = flag
     end
 
-    SSL_IVNAMES = [
-      :@ca_file,
-      :@ca_path,
-      :@cert,
-      :@cert_store,
-      :@ciphers,
-      :@extra_chain_cert,
-      :@key,
-      :@ssl_timeout,
-      :@ssl_version,
-      :@min_version,
-      :@max_version,
-      :@verify_callback,
-      :@verify_depth,
-      :@verify_mode,
-      :@verify_hostname,
-    ] # :nodoc:
     SSL_ATTRIBUTES = [
       :ca_file,
       :ca_path,
@@ -1514,7 +1531,9 @@ module Net   #:nodoc:
       :verify_depth,
       :verify_mode,
       :verify_hostname,
-    ] # :nodoc:
+    ].freeze # :nodoc:
+
+    SSL_IVNAMES = SSL_ATTRIBUTES.map { |a| "@#{a}".to_sym }.freeze # :nodoc:
 
     # Sets or returns the path to a CA certification file in PEM format.
     attr_accessor :ca_file
@@ -1531,11 +1550,11 @@ module Net   #:nodoc:
     attr_accessor :cert_store
 
     # Sets or returns the available SSL ciphers.
-    # See {OpenSSL::SSL::SSLContext#ciphers=}[rdoc-ref:OpenSSL::SSL::SSLContext#ciphers-3D].
+    # See {OpenSSL::SSL::SSLContext#ciphers=}[OpenSSL::SSL::SSL::Context#ciphers=].
     attr_accessor :ciphers
 
     # Sets or returns the extra X509 certificates to be added to the certificate chain.
-    # See {OpenSSL::SSL::SSLContext#add_certificate}[rdoc-ref:OpenSSL::SSL::SSLContext#add_certificate].
+    # See {OpenSSL::SSL::SSLContext#add_certificate}[OpenSSL::SSL::SSL::Context#add_certificate].
     attr_accessor :extra_chain_cert
 
     # Sets or returns the OpenSSL::PKey::RSA or OpenSSL::PKey::DSA object.
@@ -1545,15 +1564,15 @@ module Net   #:nodoc:
     attr_accessor :ssl_timeout
 
     # Sets or returns the SSL version.
-    # See {OpenSSL::SSL::SSLContext#ssl_version=}[rdoc-ref:OpenSSL::SSL::SSLContext#ssl_version-3D].
+    # See {OpenSSL::SSL::SSLContext#ssl_version=}[OpenSSL::SSL::SSL::Context#ssl_version=].
     attr_accessor :ssl_version
 
     # Sets or returns the minimum SSL version.
-    # See {OpenSSL::SSL::SSLContext#min_version=}[rdoc-ref:OpenSSL::SSL::SSLContext#min_version-3D].
+    # See {OpenSSL::SSL::SSLContext#min_version=}[OpenSSL::SSL::SSL::Context#min_version=].
     attr_accessor :min_version
 
     # Sets or returns the maximum SSL version.
-    # See {OpenSSL::SSL::SSLContext#max_version=}[rdoc-ref:OpenSSL::SSL::SSLContext#max_version-3D].
+    # See {OpenSSL::SSL::SSLContext#max_version=}[OpenSSL::SSL::SSL::Context#max_version=].
     attr_accessor :max_version
 
     # Sets or returns the callback for the server certification verification.
@@ -1569,7 +1588,7 @@ module Net   #:nodoc:
 
     # Sets or returns whether to verify that the server certificate is valid
     # for the hostname.
-    # See {OpenSSL::SSL::SSLContext#verify_hostname=}[rdoc-ref:OpenSSL::SSL::SSLContext#attribute-i-verify_mode].
+    # See {OpenSSL::SSL::SSLContext#verify_hostname=}[OpenSSL::SSL::SSL::Context#verify_hostname=].
     attr_accessor :verify_hostname
 
     # Returns the X509 certificate chain (an array of strings)
@@ -1617,6 +1636,21 @@ module Net   #:nodoc:
       self
     end
 
+    # Finishes the \HTTP session:
+    #
+    #   http = Net::HTTP.new(hostname)
+    #   http.start
+    #   http.started? # => true
+    #   http.finish   # => nil
+    #   http.started? # => false
+    #
+    # Raises IOError if not in a session.
+    def finish
+      raise IOError, 'HTTP session not yet started' unless started?
+      do_finish
+    end
+
+    # :stopdoc:
     def do_start
       connect
       @started = true
@@ -1639,19 +1673,26 @@ module Net   #:nodoc:
       end
 
       debug "opening connection to #{conn_addr}:#{conn_port}..."
-      s = Timeout.timeout(@open_timeout, Net::OpenTimeout) {
-        begin
-          TCPSocket.open(conn_addr, conn_port, @local_host, @local_port)
-        rescue => e
-          raise e, "Failed to open TCP connection to " +
-            "#{conn_addr}:#{conn_port} (#{e.message})"
+      begin
+        s = timeouted_connect(conn_addr, conn_port)
+      rescue => e
+        if (defined?(IO::TimeoutError) && e.is_a?(IO::TimeoutError)) || e.is_a?(Errno::ETIMEDOUT)  # for compatibility with previous versions
+          e = Net::OpenTimeout.new(e)
         end
-      }
+        raise e, "Failed to open TCP connection to " +
+          "#{conn_addr}:#{conn_port} (#{e.message})"
+      end
       s.setsockopt(Socket::IPPROTO_TCP, Socket::TCP_NODELAY, 1)
       debug "opened"
       if use_ssl?
         if proxy?
-          plain_sock = BufferedIO.new(s, read_timeout: @read_timeout,
+          if @proxy_use_ssl
+            proxy_sock = OpenSSL::SSL::SSLSocket.new(s)
+            ssl_socket_connect(proxy_sock, @open_timeout)
+          else
+            proxy_sock = s
+          end
+          proxy_sock = BufferedIO.new(proxy_sock, read_timeout: @read_timeout,
                                       write_timeout: @write_timeout,
                                       continue_timeout: @continue_timeout,
                                       debug_output: @debug_output)
@@ -1662,8 +1703,8 @@ module Net   #:nodoc:
             buf << "Proxy-Authorization: Basic #{credential}\r\n"
           end
           buf << "\r\n"
-          plain_sock.write(buf)
-          HTTPResponse.read_new(plain_sock).value
+          proxy_sock.write(buf)
+          HTTPResponse.read_new(proxy_sock).value
           # assuming nothing left in buffers after successful CONNECT response
         end
 
@@ -1733,23 +1774,30 @@ module Net   #:nodoc:
     end
     private :connect
 
-    def on_connect
+    tcp_socket_parameters = TCPSocket.instance_method(:initialize).parameters
+    TCP_SOCKET_NEW_HAS_OPEN_TIMEOUT = if tcp_socket_parameters != [[:rest]]
+      tcp_socket_parameters.include?([:key, :open_timeout])
+    else
+      # Use Socket.tcp to find out since there is no parameters information for TCPSocket#initialize
+      # See discussion in https://github.com/ruby/net-http/pull/224
+      Socket.method(:tcp).parameters.include?([:key, :open_timeout])
     end
-    private :on_connect
+    private_constant :TCP_SOCKET_NEW_HAS_OPEN_TIMEOUT
 
-    # Finishes the \HTTP session:
-    #
-    #   http = Net::HTTP.new(hostname)
-    #   http.start
-    #   http.started? # => true
-    #   http.finish   # => nil
-    #   http.started? # => false
-    #
-    # Raises IOError if not in a session.
-    def finish
-      raise IOError, 'HTTP session not yet started' unless started?
-      do_finish
+    def timeouted_connect(conn_addr, conn_port)
+      if TCP_SOCKET_NEW_HAS_OPEN_TIMEOUT
+        TCPSocket.open(conn_addr, conn_port, @local_host, @local_port, open_timeout: @open_timeout)
+      else
+        Timeout.timeout(@open_timeout, Net::OpenTimeout) {
+          TCPSocket.open(conn_addr, conn_port, @local_host, @local_port)
+        }
+      end
     end
+    private :timeouted_connect
+
+    def on_connect
+    end
+    private :on_connect
 
     def do_finish
       @started = false
@@ -1771,13 +1819,14 @@ module Net   #:nodoc:
     @proxy_port = nil
     @proxy_user = nil
     @proxy_pass = nil
+    @proxy_use_ssl = nil
 
     # Creates an \HTTP proxy class which behaves like \Net::HTTP, but
     # performs all access via the specified proxy.
     #
     # This class is obsolete.  You may pass these same parameters directly to
     # \Net::HTTP.new.  See Net::HTTP.new for details of the arguments.
-    def HTTP.Proxy(p_addr = :ENV, p_port = nil, p_user = nil, p_pass = nil) #:nodoc:
+    def HTTP.Proxy(p_addr = :ENV, p_port = nil, p_user = nil, p_pass = nil, p_use_ssl = nil) #:nodoc:
       return self unless p_addr
 
       Class.new(self) {
@@ -1795,9 +1844,12 @@ module Net   #:nodoc:
 
         @proxy_user = p_user
         @proxy_pass = p_pass
+        @proxy_use_ssl = p_use_ssl
       }
     end
 
+    # :startdoc:
+
     class << HTTP
       # Returns true if self is a class which was created by HTTP::Proxy.
       def proxy_class?
@@ -1819,6 +1871,9 @@ module Net   #:nodoc:
       # Returns the password for accessing the proxy, or +nil+ if none;
       # see Net::HTTP@Proxy+Server.
       attr_reader :proxy_pass
+
+      # Use SSL when talking to the proxy. If Net::HTTP does not use a proxy, nil.
+      attr_reader :proxy_use_ssl
     end
 
     # Returns +true+ if a proxy server is defined, +false+ otherwise;
@@ -1889,9 +1944,11 @@ module Net   #:nodoc:
     alias proxyport proxy_port      #:nodoc: obsolete
 
     private
+    # :stopdoc:
 
     def unescape(value)
-      require 'cgi/util'
+      require 'cgi/escape'
+      require 'cgi/util' unless defined?(CGI::EscapeExt)
       CGI.unescape(value)
     end
 
@@ -1916,6 +1973,7 @@ module Net   #:nodoc:
         path
       end
     end
+    # :startdoc:
 
     #
     # HTTP operations
@@ -2370,7 +2428,9 @@ module Net   #:nodoc:
       res
     end
 
-    IDEMPOTENT_METHODS_ = %w/GET HEAD PUT DELETE OPTIONS TRACE/ # :nodoc:
+    # :stopdoc:
+
+    IDEMPOTENT_METHODS_ = %w/GET HEAD PUT DELETE OPTIONS TRACE/.freeze # :nodoc:
 
     def transport_request(req)
       count = 0
@@ -2527,6 +2587,11 @@ module Net   #:nodoc:
     alias_method :D, :debug
   end
 
+  # for backward compatibility until Ruby 4.0
+  # https://bugs.ruby-lang.org/issues/20900
+  # https://github.com/bblimke/webmock/pull/1081
+  HTTPSession = HTTP
+  deprecate_constant :HTTPSession
 end
 
 require_relative 'http/exceptions'
@@ -2541,5 +2606,3 @@ require_relative 'http/response'
 require_relative 'http/responses'
 
 require_relative 'http/proxy_delta'
-
-require_relative 'http/backward'
diff --git a/lib/net/http/backward.rb b/lib/net/http/backward.rb
deleted file mode 100644
index b44577edbd..0000000000
--- a/lib/net/http/backward.rb
+++ /dev/null
@@ -1,40 +0,0 @@
-# frozen_string_literal: true
-# for backward compatibility
-
-# :enddoc:
-
-class Net::HTTP
-  ProxyMod = ProxyDelta
-  deprecate_constant :ProxyMod
-end
-
-module Net::NetPrivate
-  HTTPRequest = ::Net::HTTPRequest
-  deprecate_constant :HTTPRequest
-end
-
-module Net
-  HTTPSession = HTTP
-
-  HTTPInformationCode  = HTTPInformation
-  HTTPSuccessCode      = HTTPSuccess
-  HTTPRedirectionCode  = HTTPRedirection
-  HTTPRetriableCode    = HTTPRedirection
-  HTTPClientErrorCode  = HTTPClientError
-  HTTPFatalErrorCode   = HTTPClientError
-  HTTPServerErrorCode  = HTTPServerError
-  HTTPResponseReceiver = HTTPResponse
-
-  HTTPResponceReceiver = HTTPResponse # Typo since 2001
-
-  deprecate_constant :HTTPSession,
-                     :HTTPInformationCode,
-                     :HTTPSuccessCode,
-                     :HTTPRedirectionCode,
-                     :HTTPRetriableCode,
-                     :HTTPClientErrorCode,
-                     :HTTPFatalErrorCode,
-                     :HTTPServerErrorCode,
-                     :HTTPResponseReceiver,
-                     :HTTPResponceReceiver
-end
diff --git a/lib/net/http/exceptions.rb b/lib/net/http/exceptions.rb
index ceec8f7b0a..4342cfc0ef 100644
--- a/lib/net/http/exceptions.rb
+++ b/lib/net/http/exceptions.rb
@@ -3,7 +3,7 @@ module Net
   # Net::HTTP exception class.
   # You cannot use Net::HTTPExceptions directly; instead, you must use
   # its subclasses.
-  module HTTPExceptions
+  module HTTPExceptions # :nodoc:
     def initialize(msg, res)   #:nodoc:
       super msg
       @response = res
@@ -12,6 +12,7 @@ module Net
     alias data response    #:nodoc: obsolete
   end
 
+  # :stopdoc:
   class HTTPError < ProtocolError
     include HTTPExceptions
   end
diff --git a/lib/net/http/generic_request.rb b/lib/net/http/generic_request.rb
index 44e329a0c8..5b01ea4abd 100644
--- a/lib/net/http/generic_request.rb
+++ b/lib/net/http/generic_request.rb
@@ -19,16 +19,13 @@ class Net::HTTPGenericRequest
 
     if URI === uri_or_path then
       raise ArgumentError, "not an HTTP URI" unless URI::HTTP === uri_or_path
-      hostname = uri_or_path.hostname
+      hostname = uri_or_path.host
       raise ArgumentError, "no host component for URI" unless (hostname && hostname.length > 0)
       @uri = uri_or_path.dup
-      host = @uri.hostname.dup
-      host << ":" << @uri.port.to_s if @uri.port != @uri.default_port
       @path = uri_or_path.request_uri
       raise ArgumentError, "no HTTP request path given" unless @path
     else
       @uri = nil
-      host = nil
       raise ArgumentError, "no HTTP request path given" unless uri_or_path
       raise ArgumentError, "HTTP request path is empty" if uri_or_path.empty?
       @path = uri_or_path.dup
@@ -51,7 +48,7 @@ class Net::HTTPGenericRequest
     initialize_http_header initheader
     self['Accept'] ||= '*/*'
     self['User-Agent'] ||= 'Ruby'
-    self['Host'] ||= host if host
+    self['Host'] ||= @uri.authority if @uri
     @body = nil
     @body_stream = nil
     @body_data = nil
@@ -102,6 +99,31 @@ class Net::HTTPGenericRequest
     "\#<#{self.class} #{@method}>"
   end
 
+  # Returns a string representation of the request with the details for pp:
+  #
+  #   require 'pp'
+  #   post = Net::HTTP::Post.new(uri)
+  #   post.inspect # => "#<Net::HTTP::Post POST>"
+  #   post.pretty_inspect
+  #   # => #<Net::HTTP::Post
+  #         POST
+  #         path="/"
+  #         headers={"accept-encoding" => ["gzip;q=1.0,deflate;q=0.6,identity;q=0.3"],
+  #          "accept" => ["*/*"],
+  #          "user-agent" => ["Ruby"],
+  #          "host" => ["www.ruby-lang.org"]}>
+  #
+  def pretty_print(q)
+    q.object_group(self) {
+      q.breakable
+      q.text @method
+      q.breakable
+      q.text "path="; q.pp @path
+      q.breakable
+      q.text "headers="; q.pp to_hash
+    }
+  end
+
   ##
   # Don't automatically decode response content-encoding if the user indicates
   # they want to handle it.
@@ -220,7 +242,7 @@ class Net::HTTPGenericRequest
     end
 
     if host = self['host']
-      host.sub!(/:.*/m, '')
+      host = URI.parse("//#{host}").host # Remove a port component from the existing Host header
     elsif host = @uri.host
     else
      host = addr
@@ -239,6 +261,8 @@ class Net::HTTPGenericRequest
 
   private
 
+  # :stopdoc:
+
   class Chunker #:nodoc:
     def initialize(sock)
       @sock = sock
@@ -260,7 +284,6 @@ class Net::HTTPGenericRequest
   def send_request_with_body(sock, ver, path, body)
     self.content_length = body.bytesize
     delete 'Transfer-Encoding'
-    supply_default_content_type
     write_header sock, ver, path
     wait_for_continue sock, ver if sock.continue_timeout
     sock.write body
@@ -271,7 +294,6 @@ class Net::HTTPGenericRequest
       raise ArgumentError,
           "Content-Length not given and Transfer-Encoding is not `chunked'"
     end
-    supply_default_content_type
     write_header sock, ver, path
     wait_for_continue sock, ver if sock.continue_timeout
     if chunked?
@@ -373,12 +395,6 @@ class Net::HTTPGenericRequest
     buf.clear
   end
 
-  def supply_default_content_type
-    return if content_type()
-    warn 'net/http: Content-Type did not set; using application/x-www-form-urlencoded', uplevel: 1 if $VERBOSE
-    set_content_type 'application/x-www-form-urlencoded'
-  end
-
   ##
   # Waits up to the continue timeout for a response from the server provided
   # we're speaking HTTP 1.1 and are expecting a 100-continue response.
@@ -411,4 +427,3 @@ class Net::HTTPGenericRequest
   end
 
 end
-
diff --git a/lib/net/http/header.rb b/lib/net/http/header.rb
index f6c36f1b5e..5dcdcc7d74 100644
--- a/lib/net/http/header.rb
+++ b/lib/net/http/header.rb
@@ -179,7 +179,9 @@
 # - #each_value: Passes each string field value to the block.
 #
 module Net::HTTPHeader
+  # The maximum length of HTTP header keys.
   MAX_KEY_LENGTH = 1024
+  # The maximum length of HTTP header values.
   MAX_FIELD_LENGTH = 65536
 
   def initialize_http_header(initheader) #:nodoc:
@@ -267,6 +269,7 @@ module Net::HTTPHeader
     end
   end
 
+  # :stopdoc:
   private def set_field(key, val)
     case val
     when Enumerable
@@ -294,6 +297,7 @@ module Net::HTTPHeader
       ary.push val
     end
   end
+  # :startdoc:
 
   # Returns the array field value for the given +key+,
   # or +nil+ if there is no such field;
@@ -490,7 +494,7 @@ module Net::HTTPHeader
 
   alias canonical_each each_capitalized
 
-  def capitalize(name)
+  def capitalize(name)  # :nodoc:
     name.to_s.split('-'.freeze).map {|s| s.capitalize }.join('-'.freeze)
   end
   private :capitalize
@@ -957,12 +961,12 @@ module Net::HTTPHeader
     @header['proxy-authorization'] = [basic_encode(account, password)]
   end
 
-  def basic_encode(account, password)
+  def basic_encode(account, password)   # :nodoc:
     'Basic ' + ["#{account}:#{password}"].pack('m0')
   end
   private :basic_encode
 
-# Returns whether the HTTP session is to be closed.
+  # Returns whether the HTTP session is to be closed.
   def connection_close?
     token = /(?:\A|,)\s*close\s*(?:\z|,)/i
     @header['connection']&.grep(token) {return true}
@@ -970,7 +974,7 @@ module Net::HTTPHeader
     false
   end
 
-# Returns whether the HTTP session is to be kept alive.
+  # Returns whether the HTTP session is to be kept alive.
   def connection_keep_alive?
     token = /(?:\A|,)\s*keep-alive\s*(?:\z|,)/i
     @header['connection']&.grep(token) {return true}
diff --git a/lib/net/http/net-http.gemspec b/lib/net/http/net-http.gemspec
index 0021136793..d59d5c3b74 100644
--- a/lib/net/http/net-http.gemspec
+++ b/lib/net/http/net-http.gemspec
@@ -21,19 +21,19 @@ Gem::Specification.new do |spec|
   spec.summary       = %q{HTTP client api for Ruby.}
   spec.description   = %q{HTTP client api for Ruby.}
   spec.homepage      = "https://github.com/ruby/net-http"
-  spec.required_ruby_version = Gem::Requirement.new(">= 2.6.0")
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.7.0")
   spec.licenses      = ["Ruby", "BSD-2-Clause"]
 
+  spec.metadata["changelog_uri"] = spec.homepage + "/releases"
   spec.metadata["homepage_uri"] = spec.homepage
   spec.metadata["source_code_uri"] = spec.homepage
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{\A(?:(?:test|spec|features)/|\.git)}) }
-  end
+  excludes = %W[/.git* /bin /test /test_sig /*file /#{File.basename(__FILE__)}]
+  spec.files = IO.popen(%W[git -C #{__dir__} ls-files -z --] + excludes.map {|e| ":^#{e}"}, &:read).split("\x0")
   spec.bindir        = "exe"
   spec.require_paths = ["lib"]
 
-  spec.add_dependency "uri"
+  spec.add_dependency "uri", ">= 0.11.1"
 end
diff --git a/lib/net/http/requests.rb b/lib/net/http/requests.rb
index e58057adf1..8dc79a9f66 100644
--- a/lib/net/http/requests.rb
+++ b/lib/net/http/requests.rb
@@ -19,9 +19,9 @@
 #
 # - Request body: optional.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: yes.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: yes.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: yes.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: yes.
 #
 # Related:
 #
@@ -29,6 +29,7 @@
 # - Net::HTTP#get: sends +GET+ request, returns response object.
 #
 class Net::HTTP::Get < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'GET'
   REQUEST_HAS_BODY  = false
   RESPONSE_HAS_BODY = true
@@ -51,15 +52,16 @@ end
 #
 # - Request body: optional.
 # - Response body: no.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: yes.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: yes.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: yes.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: yes.
 #
 # Related:
 #
 # - Net::HTTP#head: sends +HEAD+ request, returns response object.
 #
 class Net::HTTP::Head < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'HEAD'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = false
@@ -85,9 +87,9 @@ end
 #
 # - Request body: yes.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: no.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: no.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: yes.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: no.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: no.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: yes.
 #
 # Related:
 #
@@ -95,6 +97,7 @@ end
 # - Net::HTTP#post: sends +POST+ request, returns response object.
 #
 class Net::HTTP::Post < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'POST'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -120,9 +123,9 @@ end
 #
 # - Request body: yes.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: no.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: no.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: no.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: no.
 #
 # Related:
 #
@@ -130,6 +133,7 @@ end
 # - Net::HTTP#put: sends +PUT+ request, returns response object.
 #
 class Net::HTTP::Put < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'PUT'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -153,15 +157,16 @@ end
 #
 # - Request body: optional.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: no.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: no.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: no.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: no.
 #
 # Related:
 #
 # - Net::HTTP#delete: sends +DELETE+ request, returns response object.
 #
 class Net::HTTP::Delete < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'DELETE'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = true
@@ -184,15 +189,16 @@ end
 #
 # - Request body: optional.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: yes.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: no.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: yes.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: no.
 #
 # Related:
 #
 # - Net::HTTP#options: sends +OPTIONS+ request, returns response object.
 #
 class Net::HTTP::Options < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'OPTIONS'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = true
@@ -215,15 +221,16 @@ end
 #
 # - Request body: no.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: yes.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: yes.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: no.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: yes.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: yes.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: no.
 #
 # Related:
 #
 # - Net::HTTP#trace: sends +TRACE+ request, returns response object.
 #
 class Net::HTTP::Trace < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'TRACE'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = true
@@ -249,15 +256,16 @@ end
 #
 # - Request body: yes.
 # - Response body: yes.
-# - {Safe}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Safe_methods]: no.
-# - {Idempotent}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Idempotent_methods]: no.
-# - {Cacheable}[https://en.wikipedia.org/wiki/Hypertext_Transfer_Protocol#Cacheable_methods]: no.
+# - {Safe}[https://en.wikipedia.org/wiki/HTTP#Safe_method]: no.
+# - {Idempotent}[https://en.wikipedia.org/wiki/HTTP#Idempotent_method]: no.
+# - {Cacheable}[https://en.wikipedia.org/wiki/HTTP#Cacheable_method]: no.
 #
 # Related:
 #
 # - Net::HTTP#patch: sends +PATCH+ request, returns response object.
 #
 class Net::HTTP::Patch < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'PATCH'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -285,6 +293,7 @@ end
 # - Net::HTTP#propfind: sends +PROPFIND+ request, returns response object.
 #
 class Net::HTTP::Propfind < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'PROPFIND'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -308,6 +317,7 @@ end
 # - Net::HTTP#proppatch: sends +PROPPATCH+ request, returns response object.
 #
 class Net::HTTP::Proppatch < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'PROPPATCH'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -331,6 +341,7 @@ end
 # - Net::HTTP#mkcol: sends +MKCOL+ request, returns response object.
 #
 class Net::HTTP::Mkcol < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'MKCOL'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -354,6 +365,7 @@ end
 # - Net::HTTP#copy: sends +COPY+ request, returns response object.
 #
 class Net::HTTP::Copy < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'COPY'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = true
@@ -377,6 +389,7 @@ end
 # - Net::HTTP#move: sends +MOVE+ request, returns response object.
 #
 class Net::HTTP::Move < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'MOVE'
   REQUEST_HAS_BODY = false
   RESPONSE_HAS_BODY = true
@@ -400,6 +413,7 @@ end
 # - Net::HTTP#lock: sends +LOCK+ request, returns response object.
 #
 class Net::HTTP::Lock < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'LOCK'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
@@ -423,8 +437,8 @@ end
 # - Net::HTTP#unlock: sends +UNLOCK+ request, returns response object.
 #
 class Net::HTTP::Unlock < Net::HTTPRequest
+  # :stopdoc:
   METHOD = 'UNLOCK'
   REQUEST_HAS_BODY = true
   RESPONSE_HAS_BODY = true
 end
-
diff --git a/lib/net/http/response.rb b/lib/net/http/response.rb
index 40de963868..8804a99c9e 100644
--- a/lib/net/http/response.rb
+++ b/lib/net/http/response.rb
@@ -153,6 +153,7 @@ class Net::HTTPResponse
     end
 
     private
+    # :stopdoc:
 
     def read_status_line(sock)
       str = sock.readline
@@ -259,7 +260,7 @@ class Net::HTTPResponse
   # header.
   attr_accessor :ignore_eof
 
-  def inspect
+  def inspect   # :nodoc:
     "#<#{self.class} #{@code} #{@message} readbody=#{@read}>"
   end
 
diff --git a/lib/net/http/responses.rb b/lib/net/http/responses.rb
index 6f6fb8d055..941a6fed80 100644
--- a/lib/net/http/responses.rb
+++ b/lib/net/http/responses.rb
@@ -4,7 +4,9 @@
 
 module Net
 
+  # Unknown HTTP response
   class HTTPUnknownResponse < HTTPResponse
+    # :stopdoc:
     HAS_BODY = true
     EXCEPTION_TYPE = HTTPError                  #
   end
@@ -19,6 +21,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#1xx_informational_response].
   #
   class HTTPInformation < HTTPResponse
+    # :stopdoc:
     HAS_BODY = false
     EXCEPTION_TYPE = HTTPError                  #
   end
@@ -34,6 +37,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#2xx_success].
   #
   class HTTPSuccess < HTTPResponse
+    # :stopdoc:
     HAS_BODY = true
     EXCEPTION_TYPE = HTTPError                  #
   end
@@ -49,6 +53,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#3xx_redirection].
   #
   class HTTPRedirection < HTTPResponse
+    # :stopdoc:
     HAS_BODY = true
     EXCEPTION_TYPE = HTTPRetriableError         #
   end
@@ -63,6 +68,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#4xx_client_errors].
   #
   class HTTPClientError < HTTPResponse
+    # :stopdoc:
     HAS_BODY = true
     EXCEPTION_TYPE = HTTPClientException        #
   end
@@ -77,6 +83,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#5xx_server_errors].
   #
   class HTTPServerError < HTTPResponse
+    # :stopdoc:
     HAS_BODY = true
     EXCEPTION_TYPE = HTTPFatalError             #
   end
@@ -94,6 +101,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#100].
   #
   class HTTPContinue < HTTPInformation
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -111,6 +119,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#101].
   #
   class HTTPSwitchProtocol < HTTPInformation
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -127,6 +136,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#102].
   #
   class HTTPProcessing < HTTPInformation
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -145,6 +155,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#103].
   #
   class HTTPEarlyHints < HTTPInformation
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -162,6 +173,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#200].
   #
   class HTTPOK < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -179,6 +191,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#201].
   #
   class HTTPCreated < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -196,6 +209,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#202].
   #
   class HTTPAccepted < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -215,6 +229,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#203].
   #
   class HTTPNonAuthoritativeInformation < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -232,6 +247,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#204].
   #
   class HTTPNoContent < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -250,6 +266,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#205].
   #
   class HTTPResetContent < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -268,6 +285,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#206].
   #
   class HTTPPartialContent < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -285,6 +303,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#207].
   #
   class HTTPMultiStatus < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -304,6 +323,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#208].
   #
   class HTTPAlreadyReported < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -321,6 +341,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#226].
   #
   class HTTPIMUsed < HTTPSuccess
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -338,6 +359,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#300].
   #
   class HTTPMultipleChoices < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPMultipleChoice = HTTPMultipleChoices
@@ -356,6 +378,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#301].
   #
   class HTTPMovedPermanently < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -373,6 +396,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#302].
   #
   class HTTPFound < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPMovedTemporarily = HTTPFound
@@ -390,6 +414,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#303].
   #
   class HTTPSeeOther < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -407,6 +432,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#304].
   #
   class HTTPNotModified < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -423,6 +449,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#305].
   #
   class HTTPUseProxy < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = false
   end
 
@@ -440,6 +467,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#307].
   #
   class HTTPTemporaryRedirect < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -456,6 +484,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#308].
   #
   class HTTPPermanentRedirect < HTTPRedirection
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -472,6 +501,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#400].
   #
   class HTTPBadRequest < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -488,6 +518,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#401].
   #
   class HTTPUnauthorized < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -504,6 +535,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#402].
   #
   class HTTPPaymentRequired < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -521,6 +553,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#403].
   #
   class HTTPForbidden < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -537,6 +570,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#404].
   #
   class HTTPNotFound < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -553,6 +587,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#405].
   #
   class HTTPMethodNotAllowed < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -570,6 +605,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#406].
   #
   class HTTPNotAcceptable < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -586,6 +622,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#407].
   #
   class HTTPProxyAuthenticationRequired < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -602,6 +639,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#408].
   #
   class HTTPRequestTimeout < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPRequestTimeOut = HTTPRequestTimeout
@@ -619,6 +657,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#409].
   #
   class HTTPConflict < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -636,6 +675,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#410].
   #
   class HTTPGone < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -653,6 +693,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#411].
   #
   class HTTPLengthRequired < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -670,6 +711,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#412].
   #
   class HTTPPreconditionFailed < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -686,6 +728,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#413].
   #
   class HTTPPayloadTooLarge < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPRequestEntityTooLarge = HTTPPayloadTooLarge
@@ -703,6 +746,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#414].
   #
   class HTTPURITooLong < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPRequestURITooLong = HTTPURITooLong
@@ -721,6 +765,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#415].
   #
   class HTTPUnsupportedMediaType < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -737,6 +782,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#416].
   #
   class HTTPRangeNotSatisfiable < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPRequestedRangeNotSatisfiable = HTTPRangeNotSatisfiable
@@ -754,6 +800,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#417].
   #
   class HTTPExpectationFailed < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -774,6 +821,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#421].
   #
   class HTTPMisdirectedRequest < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -790,6 +838,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#422].
   #
   class HTTPUnprocessableEntity < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -805,6 +854,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#423].
   #
   class HTTPLocked < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -821,6 +871,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#424].
   #
   class HTTPFailedDependency < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -840,6 +891,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#426].
   #
   class HTTPUpgradeRequired < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -856,6 +908,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#428].
   #
   class HTTPPreconditionRequired < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -872,6 +925,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#429].
   #
   class HTTPTooManyRequests < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -889,6 +943,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#431].
   #
   class HTTPRequestHeaderFieldsTooLarge < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -906,6 +961,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#451].
   #
   class HTTPUnavailableForLegalReasons < HTTPClientError
+    # :stopdoc:
     HAS_BODY = true
   end
   # 444 No Response - Nginx
@@ -926,6 +982,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#500].
   #
   class HTTPInternalServerError < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -943,6 +1000,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#501].
   #
   class HTTPNotImplemented < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -960,6 +1018,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#502].
   #
   class HTTPBadGateway < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -977,6 +1036,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#503].
   #
   class HTTPServiceUnavailable < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -994,6 +1054,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#504].
   #
   class HTTPGatewayTimeout < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
   HTTPGatewayTimeOut = HTTPGatewayTimeout
@@ -1011,6 +1072,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#505].
   #
   class HTTPVersionNotSupported < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -1027,6 +1089,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#506].
   #
   class HTTPVariantAlsoNegotiates < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -1043,6 +1106,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#507].
   #
   class HTTPInsufficientStorage < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -1059,6 +1123,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#508].
   #
   class HTTPLoopDetected < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
   # 509 Bandwidth Limit Exceeded - Apache bw/limited extension
@@ -1076,6 +1141,7 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#510].
   #
   class HTTPNotExtended < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
@@ -1092,19 +1158,21 @@ module Net
   # - {Wikipedia}[https://en.wikipedia.org/wiki/List_of_HTTP_status_codes#511].
   #
   class HTTPNetworkAuthenticationRequired < HTTPServerError
+    # :stopdoc:
     HAS_BODY = true
   end
 
 end
 
 class Net::HTTPResponse
+  # :stopdoc:
   CODE_CLASS_TO_OBJ = {
     '1' => Net::HTTPInformation,
     '2' => Net::HTTPSuccess,
     '3' => Net::HTTPRedirection,
     '4' => Net::HTTPClientError,
     '5' => Net::HTTPServerError
-  }
+  }.freeze
   CODE_TO_OBJ = {
     '100' => Net::HTTPContinue,
     '101' => Net::HTTPSwitchProtocol,
@@ -1170,5 +1238,5 @@ class Net::HTTPResponse
     '508' => Net::HTTPLoopDetected,
     '510' => Net::HTTPNotExtended,
     '511' => Net::HTTPNetworkAuthenticationRequired,
-  }
+  }.freeze
 end
diff --git a/lib/net/net-protocol.gemspec b/lib/net/net-protocol.gemspec
index f9fd83f12b..2d911a966c 100644
--- a/lib/net/net-protocol.gemspec
+++ b/lib/net/net-protocol.gemspec
@@ -25,9 +25,8 @@ Gem::Specification.new do |spec|
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
+  excludes = %W[/.git* /bin /test /*file /#{File.basename(__FILE__)}]
+  spec.files = IO.popen(%W[git -C #{__dir__} ls-files -z --] + excludes.map {|e| ":^#{e}"}, &:read).split("\x0")
   spec.require_paths = ["lib"]
 
   spec.add_dependency "timeout"
diff --git a/lib/net/protocol.rb b/lib/net/protocol.rb
index 197ea09089..8c81298c0e 100644
--- a/lib/net/protocol.rb
+++ b/lib/net/protocol.rb
@@ -54,9 +54,20 @@ module Net # :nodoc:
         s.connect
       end
     end
+
+    tcp_socket_parameters = TCPSocket.instance_method(:initialize).parameters
+    TCP_SOCKET_NEW_HAS_OPEN_TIMEOUT = if tcp_socket_parameters != [[:rest]]
+      tcp_socket_parameters.include?([:key, :open_timeout])
+    else
+      # Use Socket.tcp to find out since there is no parameters information for TCPSocket#initialize
+      # See discussion in https://github.com/ruby/net-http/pull/224
+      Socket.method(:tcp).parameters.include?([:key, :open_timeout])
+    end
+    private_constant :TCP_SOCKET_NEW_HAS_OPEN_TIMEOUT
   end
 
 
+  # :stopdoc:
   class ProtocolError          < StandardError; end
   class ProtoSyntaxError       < ProtocolError; end
   class ProtoFatalError        < ProtocolError; end
@@ -66,6 +77,7 @@ module Net # :nodoc:
   class ProtoCommandError      < ProtocolError; end
   class ProtoRetriableError    < ProtocolError; end
   ProtocRetryError = ProtoRetriableError
+  # :startdoc:
 
   ##
   # OpenTimeout, a subclass of Timeout::Error, is raised if a connection cannot
@@ -78,6 +90,7 @@ module Net # :nodoc:
   # response cannot be read within the read_timeout.
 
   class ReadTimeout < Timeout::Error
+    # :stopdoc:
     def initialize(io = nil)
       @io = io
     end
@@ -97,6 +110,7 @@ module Net # :nodoc:
   # response cannot be written within the write_timeout.  Not raised on Windows.
 
   class WriteTimeout < Timeout::Error
+    # :stopdoc:
     def initialize(io = nil)
       @io = io
     end
@@ -484,6 +498,7 @@ module Net # :nodoc:
   # The writer adapter class
   #
   class WriteAdapter
+    # :stopdoc:
     def initialize(writer)
       @writer = writer
     end
diff --git a/lib/open-uri.rb b/lib/open-uri.rb
index ba2379325f..844865b13a 100644
--- a/lib/open-uri.rb
+++ b/lib/open-uri.rb
@@ -4,22 +4,25 @@ require 'stringio'
 require 'time'
 
 module URI
-  # Allows the opening of various resources including URIs.
+  # Allows the opening of various resources including URIs. Example:
   #
-  # If the first argument responds to the 'open' method, 'open' is called on
+  #   require "open-uri"
+  #   URI.open("http://example.com") { |f| f.read }
+  #
+  # If the first argument responds to the +open+ method, +open+ is called on
   # it with the rest of the arguments.
   #
   # If the first argument is a string that begins with <code>(protocol)://</code>, it is parsed by
-  # URI.parse.  If the parsed object responds to the 'open' method,
-  # 'open' is called on it with the rest of the arguments.
+  # URI.parse.  If the parsed object responds to the +open+ method,
+  # +open+ is called on it with the rest of the arguments.
   #
   # Otherwise, Kernel#open is called.
   #
   # OpenURI::OpenRead#open provides URI::HTTP#open, URI::HTTPS#open and
   # URI::FTP#open, Kernel#open.
   #
-  # We can accept URIs and strings that begin with http://, https:// and
-  # ftp://. In these cases, the opened file object is extended by OpenURI::Meta.
+  # We can accept URIs and strings that begin with <code>http://</code>, <code>https://</code> and
+  # <code>ftp://</code>. In these cases, the opened file object is extended by OpenURI::Meta.
   def self.open(name, *rest, &block)
     if name.respond_to?(:open)
       name.open(*rest, &block)
@@ -91,8 +94,10 @@ end
 
 module OpenURI
 
-  VERSION = "0.4.1"
+  # The version string
+  VERSION = "0.5.0"
 
+  # The default options
   Options = {
     :proxy => true,
     :proxy_http_basic_authentication => true,
@@ -109,6 +114,7 @@ module OpenURI
     :redirect => true,
     :encoding => nil,
     :max_redirects => 64,
+    :request_specific_fields => nil,
   }
 
   def OpenURI.check_options(options) # :nodoc:
@@ -148,7 +154,11 @@ module OpenURI
       end
       encoding = Encoding.find(options[:encoding])
     end
-
+    if options.has_key? :request_specific_fields
+      if !(options[:request_specific_fields].is_a?(Hash) || options[:request_specific_fields].is_a?(Proc))
+        raise ArgumentError, "Invalid request_specific_fields option: #{options[:request_specific_fields].inspect}"
+      end
+    end
     unless mode == nil ||
            mode == 'r' || mode == 'rb' ||
            mode == File::RDONLY
@@ -212,12 +222,20 @@ module OpenURI
     end
 
     uri_set = {}
-    max_redirects = options[:max_redirects]
+    max_redirects = options[:max_redirects] || Options.fetch(:max_redirects)
     buf = nil
     while true
+      request_specific_fields = {}
+      if options.has_key? :request_specific_fields
+        request_specific_fields = if options[:request_specific_fields].is_a?(Hash)
+                                    options[:request_specific_fields]
+                                  else options[:request_specific_fields].is_a?(Proc)
+                                    options[:request_specific_fields].call(uri)
+                                  end
+      end
       redirect = catch(:open_uri_redirect) {
         buf = Buffer.new
-        uri.buffer_open(buf, find_proxy.call(uri), options)
+        uri.buffer_open(buf, find_proxy.call(uri), options.merge(request_specific_fields))
         nil
       }
       if redirect
@@ -237,6 +255,10 @@ module OpenURI
           options = options.dup
           options.delete :http_basic_authentication
         end
+        if options.include?(:request_specific_fields) && options[:request_specific_fields].is_a?(Hash)
+          # Send request specific headers only for the initial request.
+          options.delete :request_specific_fields
+        end
         uri = redirect
         raise "HTTP redirection loop: #{uri}" if uri_set.include? uri.to_s
         uri_set[uri.to_s] = true
@@ -377,24 +399,28 @@ module OpenURI
     end
   end
 
+  # Raised on HTTP session failure
   class HTTPError < StandardError
-    def initialize(message, io)
+    def initialize(message, io) # :nodoc:
       super(message)
       @io = io
     end
+    # StringIO having the received data
     attr_reader :io
   end
 
   # Raised on redirection,
   # only occurs when +redirect+ option for HTTP is +false+.
   class HTTPRedirect < HTTPError
-    def initialize(message, io, uri)
+    def initialize(message, io, uri) # :nodoc:
       super(message, io)
       @uri = uri
     end
+    # URI to redirect
     attr_reader :uri
   end
 
+  # Raised on too many redirection,
   class TooManyRedirects < HTTPError
   end
 
@@ -746,6 +772,44 @@ module OpenURI
     #  Using +true+ also means that redirections between http and ftp are
     #  permitted.
     #
+    # [:max_redirects]
+    #  Synopsis:
+    #    :max_redirects=>int
+    #
+    #  Number of HTTP redirects allowed before OpenURI::TooManyRedirects is raised.
+    #  The default is 64.
+    #
+    # [:request_specific_fields]
+    #  Synopsis:
+    #    :request_specific_fields => {}
+    #    :request_specific_fields => lambda {|url| ...}
+    #
+    #  :request_specific_fields option allows specifying custom header fields that
+    #  are sent with the HTTP request. It can be passed as a Hash or a Proc that
+    #  gets evaluated on each request and returns a Hash of header fields.
+    #
+    #  If a Hash is provided, it specifies the headers only for the initial
+    #  request and these headers will not be sent on redirects.
+    #
+    #  If a Proc is provided, it will be executed for each request including
+    #  redirects, allowing dynamic header customization based on the request URL.
+    #  It is important that the Proc returns a Hash. And this Hash specifies the
+    #  headers to be sent with the request.
+    #
+    #  For Example with Hash
+    #    URI.open("http://...",
+    #             request_specific_fields: {"Authorization" => "token dummy"}) {|f| ... }
+    #
+    #  For Example with Proc:
+    #    URI.open("http://...",
+    #             request_specific_fields: lambda { |uri|
+    #               if uri.host == "example.com"
+    #                 {"Authorization" => "token dummy"}
+    #               else
+    #                 {}
+    #               end
+    #             }) {|f| ... }
+    #
     def open(*rest, &block)
       OpenURI.open_uri(self, *rest, &block)
     end
diff --git a/lib/open3/version.rb b/lib/open3/version.rb
index bfcec44ccc..322dd71e2a 100644
--- a/lib/open3/version.rb
+++ b/lib/open3/version.rb
@@ -1,3 +1,4 @@
 module Open3
+  # The version string
   VERSION = "0.2.1"
 end
diff --git a/lib/optparse.rb b/lib/optparse.rb
index 069c3e436e..97178e284b 100644
--- a/lib/optparse.rb
+++ b/lib/optparse.rb
@@ -7,6 +7,7 @@
 #
 # See OptionParser for documentation.
 #
+require 'set' unless defined?(Set)
 
 #--
 # == Developer Documentation (not for RDoc output)
@@ -142,7 +143,7 @@
 # Used:
 #
 #   $ ruby optparse-test.rb -r
-#   optparse-test.rb:9:in `<main>': missing argument: -r (OptionParser::MissingArgument)
+#   optparse-test.rb:9:in '<main>': missing argument: -r (OptionParser::MissingArgument)
 #   $ ruby optparse-test.rb -r my-library
 #   You required my-library!
 #
@@ -235,7 +236,7 @@
 #   $ ruby optparse-test.rb --user 2
 #   #<struct User id=2, name="Gandalf">
 #   $ ruby optparse-test.rb --user 3
-#   optparse-test.rb:15:in `block in find_user': No User Found for id 3 (RuntimeError)
+#   optparse-test.rb:15:in 'block in find_user': No User Found for id 3 (RuntimeError)
 #
 # === Store options to a Hash
 #
@@ -425,7 +426,9 @@
 #
 class OptionParser
   # The version string
-  OptionParser::Version = "0.5.0"
+  VERSION = "0.8.1"
+  # An alias for compatibility
+  Version = VERSION
 
   # :stopdoc:
   NoArgument = [NO_ARGUMENT = :NONE, nil].freeze
@@ -461,11 +464,14 @@ class OptionParser
       candidates
     end
 
+    def self.completable?(key)
+      String.try_convert(key) or defined?(key.id2name)
+    end
+
     def candidate(key, icase = false, pat = nil, &_)
       Completion.candidate(key, icase, pat, &method(:each))
     end
 
-    public
     def complete(key, icase = false, pat = nil)
       candidates = candidate(key, icase, pat, &method(:each)).sort_by {|k, v, kn| kn.size}
       if candidates.size == 1
@@ -496,7 +502,6 @@ class OptionParser
     end
   end
 
-
   #
   # Map from option/keyword string to object with completion.
   #
@@ -504,7 +509,6 @@ class OptionParser
     include Completion
   end
 
-
   #
   # Individual switch class.  Not important to the user.
   #
@@ -546,18 +550,18 @@ class OptionParser
 
     def initialize(pattern = nil, conv = nil,
                    short = nil, long = nil, arg = nil,
-                   desc = ([] if short or long), block = nil, &_block)
+                   desc = ([] if short or long), block = nil, values = nil, &_block)
       raise if Array === pattern
       block ||= _block
-      @pattern, @conv, @short, @long, @arg, @desc, @block =
-        pattern, conv, short, long, arg, desc, block
+      @pattern, @conv, @short, @long, @arg, @desc, @block, @values =
+        pattern, conv, short, long, arg, desc, block, values
     end
 
     #
     # Parses +arg+ and returns rest of +arg+ and matched portion to the
     # argument pattern. Yields when the pattern doesn't match substring.
     #
-    def parse_arg(arg) # :nodoc:
+    private def parse_arg(arg) # :nodoc:
       pattern or return nil, [arg]
       unless m = pattern.match(arg)
         yield(InvalidArgument, arg)
@@ -575,22 +579,24 @@ class OptionParser
       yield(InvalidArgument, arg) # didn't match whole arg
       return arg[s.length..-1], m
     end
-    private :parse_arg
 
     #
     # Parses argument, converts and returns +arg+, +block+ and result of
     # conversion. Yields at semi-error condition instead of raising an
     # exception.
     #
-    def conv_arg(arg, val = []) # :nodoc:
+    private def conv_arg(arg, val = []) # :nodoc:
+      v, = *val
       if conv
         val = conv.call(*val)
       else
         val = proc {|v| v}.call(*val)
       end
+      if @values
+        @values.include?(val) or raise InvalidArgument, v
+      end
       return arg, block, val
     end
-    private :conv_arg
 
     #
     # Produces the summary text. Each line of the summary is yielded to the
@@ -668,7 +674,7 @@ class OptionParser
 
       (sopts+lopts).each do |opt|
         # "(-x -c -r)-l[left justify]"
-        if /^--\[no-\](.+)$/ =~ opt
+        if /\A--\[no-\](.+)$/ =~ opt
           o = $1
           yield("--#{o}", desc.join(""))
           yield("--no-#{o}", desc.join(""))
@@ -874,14 +880,13 @@ class OptionParser
     # +lopts+::  Long style option list.
     # +nlopts+:: Negated long style options list.
     #
-    def update(sw, sopts, lopts, nsw = nil, nlopts = nil) # :nodoc:
+    private def update(sw, sopts, lopts, nsw = nil, nlopts = nil) # :nodoc:
       sopts.each {|o| @short[o] = sw} if sopts
       lopts.each {|o| @long[o] = sw} if lopts
       nlopts.each {|o| @long[o] = nsw} if nsw and nlopts
       used = @short.invert.update(@long.invert)
       @list.delete_if {|o| Switch === o and !used[o]}
     end
-    private :update
 
     #
     # Inserts +switch+ at the head of the list, and associates short, long
@@ -1032,7 +1037,6 @@ class OptionParser
   DefaultList.short['-'] = Switch::NoArgument.new {}
   DefaultList.long[''] = Switch::NoArgument.new {throw :terminate}
 
-
   COMPSYS_HEADER = <<'XXX'      # :nodoc:
 
 typeset -A opt_args
@@ -1051,16 +1055,16 @@ XXX
   end
 
   def help_exit
-    if STDOUT.tty? && (pager = ENV.values_at(*%w[RUBY_PAGER PAGER]).find {|e| e && !e.empty?})
+    if $stdout.tty? && (pager = ENV.values_at(*%w[RUBY_PAGER PAGER]).find {|e| e && !e.empty?})
       less = ENV["LESS"]
-      args = [{"LESS" => "#{!less || less.empty? ? '-' : less}Fe"}, pager, "w"]
+      args = [{"LESS" => "#{less} -Fe"}, pager, "w"]
       print = proc do |f|
         f.puts help
       rescue Errno::EPIPE
         # pager terminated
       end
       if Process.respond_to?(:fork) and false
-        IO.popen("-") {|f| f ? Process.exec(*args, in: f) : print.call(STDOUT)}
+        IO.popen("-") {|f| f ? Process.exec(*args, in: f) : print.call($stdout)}
         # unreachable
       end
       IO.popen(*args, &print)
@@ -1102,7 +1106,7 @@ XXX
   #
   Officious['*-completion-zsh'] = proc do |parser|
     Switch::OptionalArgument.new do |arg|
-      parser.compsys(STDOUT, arg)
+      parser.compsys($stdout, arg)
       exit
     end
   end
@@ -1115,7 +1119,7 @@ XXX
     Switch::OptionalArgument.new do |pkg|
       if pkg
         begin
-          require 'optparse/version'
+          require_relative 'optparse/version'
         rescue LoadError
         else
           show_version(*pkg.split(/,/)) or
@@ -1288,7 +1292,15 @@ XXX
   # to $0.
   #
   def program_name
-    @program_name || File.basename($0, '.*')
+    @program_name || strip_ext(File.basename($0))
+  end
+
+  private def strip_ext(name)  # :nodoc:
+    exts = /#{
+      require "rbconfig"
+      Regexp.union(*RbConfig::CONFIG["EXECUTABLE_EXTS"]&.split(" "))
+    }\z/o
+    name.sub(exts, "")
   end
 
   # for experimental cascading :-)
@@ -1443,14 +1455,13 @@ XXX
   # +prv+:: Previously specified argument.
   # +msg+:: Exception message.
   #
-  def notwice(obj, prv, msg) # :nodoc:
+  private def notwice(obj, prv, msg) # :nodoc:
     unless !prv or prv == obj
       raise(ArgumentError, "argument #{msg} given twice: #{obj}",
             ParseError.filter_backtrace(caller(2)))
     end
     obj
   end
-  private :notwice
 
   SPLAT_PROC = proc {|*a| a.length <= 1 ? a.first : a} # :nodoc:
 
@@ -1467,6 +1478,7 @@ XXX
     klass = nil
     q, a = nil
     has_arg = false
+    values = nil
 
     opts.each do |o|
       # argument class
@@ -1480,7 +1492,7 @@ XXX
       end
 
       # directly specified pattern(any object possible to match)
-      if (!(String === o || Symbol === o)) and o.respond_to?(:match)
+      if !Completion.completable?(o) and o.respond_to?(:match)
         pattern = notwice(o, pattern, 'pattern')
         if pattern.respond_to?(:convert)
           conv = pattern.method(:convert).to_proc
@@ -1494,7 +1506,12 @@ XXX
       case o
       when Proc, Method
         block = notwice(o, block, 'block')
-      when Array, Hash
+      when Array, Hash, Set
+        if Array === o
+          o, v = o.partition {|v,| Completion.completable?(v)}
+          values = notwice(v, values, 'values') unless v.empty?
+          next if o.empty?
+        end
         case pattern
         when CompletingHash
         when nil
@@ -1504,11 +1521,13 @@ XXX
           raise ArgumentError, "argument pattern given twice"
         end
         o.each {|pat, *v| pattern[pat] = v.fetch(0) {pat}}
+      when Range
+        values = notwice(o, values, 'values')
       when Module
         raise ArgumentError, "unsupported argument type: #{o}", ParseError.filter_backtrace(caller(4))
       when *ArgumentStyle.keys
         style = notwice(ArgumentStyle[o], style, 'style')
-      when /^--no-([^\[\]=\s]*)(.+)?/
+      when /\A--no-([^\[\]=\s]*)(.+)?/
         q, a = $1, $2
         o = notwice(a ? Object : TrueClass, klass, 'type')
         not_pattern, not_conv = search(:atype, o) unless not_style
@@ -1519,7 +1538,7 @@ XXX
         (q = q.downcase).tr!('_', '-')
         long << "no-#{q}"
         nolong << q
-      when /^--\[no-\]([^\[\]=\s]*)(.+)?/
+      when /\A--\[no-\]([^\[\]=\s]*)(.+)?/
         q, a = $1, $2
         o = notwice(a ? Object : TrueClass, klass, 'type')
         if a
@@ -1532,7 +1551,7 @@ XXX
         not_pattern, not_conv = search(:atype, FalseClass) unless not_style
         not_style = Switch::NoArgument
         nolong << "no-#{o}"
-      when /^--([^\[\]=\s]*)(.+)?/
+      when /\A--([^\[\]=\s]*)(.+)?/
         q, a = $1, $2
         if a
           o = notwice(NilClass, klass, 'type')
@@ -1542,7 +1561,7 @@ XXX
         ldesc << "--#{q}"
         (o = q.downcase).tr!('_', '-')
         long << o
-      when /^-(\[\^?\]?(?:[^\\\]]|\\.)*\])(.+)?/
+      when /\A-(\[\^?\]?(?:[^\\\]]|\\.)*\])(.+)?/
         q, a = $1, $2
         o = notwice(Object, klass, 'type')
         if a
@@ -1553,7 +1572,7 @@ XXX
         end
         sdesc << "-#{q}"
         short << Regexp.new(q)
-      when /^-(.)(.+)?/
+      when /\A-(.)(.+)?/
         q, a = $1, $2
         if a
           o = notwice(NilClass, klass, 'type')
@@ -1562,7 +1581,7 @@ XXX
         end
         sdesc << "-#{q}"
         short << q
-      when /^=/
+      when /\A=/
         style = notwice(default_style.guess(arg = o), style, 'style')
         default_pattern, conv = search(:atype, Object) unless default_pattern
       else
@@ -1571,12 +1590,18 @@ XXX
     end
 
     default_pattern, conv = search(:atype, default_style.pattern) unless default_pattern
+    if Range === values and klass
+      unless (!values.begin or klass === values.begin) and
+            (!values.end or klass === values.end)
+        raise ArgumentError, "range does not match class"
+      end
+    end
     if !(short.empty? and long.empty?)
       if has_arg and default_style == Switch::NoArgument
         default_style = Switch::RequiredArgument
       end
       s = (style || default_style).new(pattern || default_pattern,
-                                       conv, sdesc, ldesc, arg, desc, block)
+                                       conv, sdesc, ldesc, arg, desc, block, values)
     elsif !block
       if style or pattern
         raise ArgumentError, "no switch given", ParseError.filter_backtrace(caller)
@@ -1585,7 +1610,7 @@ XXX
     else
       short << pattern
       s = (style || default_style).new(pattern,
-                                       conv, nil, nil, arg, desc, block)
+                                       conv, nil, nil, arg, desc, block, values)
     end
     return s, short, long,
       (not_style.new(not_pattern, not_conv, sdesc, ldesc, nil, desc, block) if not_style),
@@ -1703,7 +1728,7 @@ XXX
     parse_in_order(argv, setter, **keywords, &nonopt)
   end
 
-  def parse_in_order(argv = default_argv, setter = nil, exact: require_exact, **, &nonopt)  # :nodoc:
+  private def parse_in_order(argv = default_argv, setter = nil, exact: require_exact, **, &nonopt)  # :nodoc:
     opt, arg, val, rest = nil
     nonopt ||= proc {|a| throw :terminate, a}
     argv.unshift(arg) if arg = catch(:terminate) {
@@ -1729,9 +1754,9 @@ XXX
             end
           end
           begin
-            opt, cb, *val = sw.parse(rest, argv) {|*exc| raise(*exc)}
-            val = callback!(cb, 1, *val) if cb
-            callback!(setter, 2, sw.switch_name, *val) if setter
+            opt, cb, val = sw.parse(rest, argv) {|*exc| raise(*exc)}
+            val = callback!(cb, 1, val) if cb
+            callback!(setter, 2, sw.switch_name, val) if setter
           rescue ParseError
             raise $!.set_option(arg, rest)
           end
@@ -1761,7 +1786,7 @@ XXX
             raise $!.set_option(arg, true)
           end
           begin
-            opt, cb, *val = sw.parse(val, argv) {|*exc| raise(*exc) if eq}
+            opt, cb, val = sw.parse(val, argv) {|*exc| raise(*exc) if eq}
           rescue ParseError
             raise $!.set_option(arg, arg.length > 2)
           else
@@ -1769,8 +1794,8 @@ XXX
           end
           begin
             argv.unshift(opt) if opt and (!rest or (opt = opt.sub(/\A-*/, '-')) != '-')
-            val = callback!(cb, 1, *val) if cb
-            callback!(setter, 2, sw.switch_name, *val) if setter
+            val = callback!(cb, 1, val) if cb
+            callback!(setter, 2, sw.switch_name, val) if setter
           rescue ParseError
             raise $!.set_option(arg, arg.length > 2)
           end
@@ -1794,10 +1819,11 @@ XXX
 
     argv
   end
-  private :parse_in_order
 
   # Calls callback with _val_.
-  def callback!(cb, max_arity, *args) # :nodoc:
+  private def callback!(cb, max_arity, *args) # :nodoc:
+    args.compact!
+
     if (size = args.size) < max_arity and cb.to_proc.lambda?
       (arity = cb.arity) < 0 and arity = (1-arity)
       arity = max_arity if arity > max_arity
@@ -1805,7 +1831,6 @@ XXX
     end
     cb.call(*args)
   end
-  private :callback!
 
   #
   # Parses command line arguments +argv+ in permutation mode and returns
@@ -1825,7 +1850,7 @@ XXX
   #
   def permute!(argv = default_argv, **keywords)
     nonopts = []
-    order!(argv, **keywords, &nonopts.method(:<<))
+    order!(argv, **keywords) {|nonopt| nonopts << nonopt}
     argv[0, 0] = nonopts
     argv
   end
@@ -1878,13 +1903,16 @@ XXX
     single_options, *long_options = *args
 
     result = {}
+    setter = (symbolize_names ?
+                ->(name, val) {result[name.to_sym] = val}
+              : ->(name, val) {result[name] = val})
 
     single_options.scan(/(.)(:)?/) do |opt, val|
       if val
-        result[opt] = nil
+        setter[opt, nil]
         define("-#{opt} VAL")
       else
-        result[opt] = false
+        setter[opt, false]
         define("-#{opt}")
       end
     end if single_options
@@ -1893,16 +1921,16 @@ XXX
       arg, desc = arg.split(';', 2)
       opt, val = arg.split(':', 2)
       if val
-        result[opt] = val.empty? ? nil : val
+        setter[opt, (val unless val.empty?)]
         define("--#{opt}=#{result[opt] || "VAL"}", *[desc].compact)
       else
-        result[opt] = false
+        setter[opt, false]
         define("--#{opt}", *[desc].compact)
       end
     end
 
-    parse_in_order(argv, result.method(:[]=), **keywords)
-    symbolize_names ? result.transform_keys(&:to_sym) : result
+    parse_in_order(argv, setter, **keywords)
+    result
   end
 
   #
@@ -1916,24 +1944,22 @@ XXX
   # Traverses @stack, sending each element method +id+ with +args+ and
   # +block+.
   #
-  def visit(id, *args, &block) # :nodoc:
+  private def visit(id, *args, &block) # :nodoc:
     @stack.reverse_each do |el|
       el.__send__(id, *args, &block)
     end
     nil
   end
-  private :visit
 
   #
   # Searches +key+ in @stack for +id+ hash and returns or yields the result.
   #
-  def search(id, key) # :nodoc:
+  private def search(id, key) # :nodoc:
     block_given = block_given?
     visit(:search, id, key) do |k|
       return block_given ? yield(k) : k
     end
   end
-  private :search
 
   #
   # Completes shortened long style option switch and returns pair of
@@ -1944,7 +1970,7 @@ XXX
   # +icase+:: Search case insensitive if true.
   # +pat+::   Optional pattern for completion.
   #
-  def complete(typ, opt, icase = false, *pat) # :nodoc:
+  private def complete(typ, opt, icase = false, *pat) # :nodoc:
     if pat.empty?
       search(typ, opt) {|sw| return [sw, opt]} # exact match or...
     end
@@ -1952,9 +1978,8 @@ XXX
       visit(:complete, typ, opt, icase, *pat) {|o, *sw| return sw}
     }
     exc = ambiguous ? AmbiguousOption : InvalidOption
-    raise exc.new(opt, additional: self.method(:additional_message).curry[typ])
+    raise exc.new(opt, additional: proc {|o| additional_message(typ, o)})
   end
-  private :complete
 
   #
   # Returns additional info.
@@ -2017,19 +2042,27 @@ XXX
   def load(filename = nil, **keywords)
     unless filename
       basename = File.basename($0, '.*')
-      return true if load(File.expand_path(basename, '~/.options'), **keywords) rescue nil
+      return true if load(File.expand_path("~/.options/#{basename}"), **keywords) rescue nil
       basename << ".options"
+      if !(xdg = ENV['XDG_CONFIG_HOME']) or xdg.empty?
+        # https://specifications.freedesktop.org/basedir-spec/latest/#variables
+        #
+        # If $XDG_CONFIG_HOME is either not set or empty, a default
+        # equal to $HOME/.config should be used.
+        xdg = ['~/.config', true]
+      end
       return [
-        # XDG
-        ENV['XDG_CONFIG_HOME'],
-        '~/.config',
+        xdg,
+
         *ENV['XDG_CONFIG_DIRS']&.split(File::PATH_SEPARATOR),
 
         # Haiku
-        '~/config/settings',
-      ].any? {|dir|
+        ['~/config/settings', true],
+      ].any? {|dir, expand|
         next if !dir or dir.empty?
-        load(File.expand_path(basename, dir), **keywords) rescue nil
+        filename = File.join(dir, basename)
+        filename = File.expand_path(filename) if expand
+        load(filename, **keywords) rescue nil
       }
     end
     begin
@@ -2235,9 +2268,10 @@ XXX
       argv
     end
 
+    DIR = File.join(__dir__, '')
     def self.filter_backtrace(array)
       unless $DEBUG
-        array.delete_if(&%r"\A#{Regexp.quote(__FILE__)}:"o.method(:=~))
+        array.delete_if {|bt| bt.start_with?(DIR)}
       end
       array
     end
@@ -2280,42 +2314,42 @@ XXX
   # Raises when ambiguously completable string is encountered.
   #
   class AmbiguousOption < ParseError
-    const_set(:Reason, 'ambiguous option')
+    Reason = 'ambiguous option'    # :nodoc:
   end
 
   #
   # Raises when there is an argument for a switch which takes no argument.
   #
   class NeedlessArgument < ParseError
-    const_set(:Reason, 'needless argument')
+    Reason = 'needless argument'    # :nodoc:
   end
 
   #
   # Raises when a switch with mandatory argument has no argument.
   #
   class MissingArgument < ParseError
-    const_set(:Reason, 'missing argument')
+    Reason = 'missing argument'    # :nodoc:
   end
 
   #
   # Raises when switch is undefined.
   #
   class InvalidOption < ParseError
-    const_set(:Reason, 'invalid option')
+    Reason = 'invalid option'    # :nodoc:
   end
 
   #
   # Raises when the given argument does not match required format.
   #
   class InvalidArgument < ParseError
-    const_set(:Reason, 'invalid argument')
+    Reason = 'invalid argument'    # :nodoc:
   end
 
   #
   # Raises when the given argument word can't be completed uniquely.
   #
   class AmbiguousArgument < InvalidArgument
-    const_set(:Reason, 'ambiguous argument')
+    Reason = 'ambiguous argument'    # :nodoc:
   end
 
   #
@@ -2414,9 +2448,11 @@ XXX
   # and DecimalNumeric. See Acceptable argument classes (in source code).
   #
   module Acceptables
-    const_set(:DecimalInteger, OptionParser::DecimalInteger)
-    const_set(:OctalInteger, OptionParser::OctalInteger)
-    const_set(:DecimalNumeric, OptionParser::DecimalNumeric)
+    # :stopdoc:
+    DecimalInteger = OptionParser::DecimalInteger
+    OctalInteger = OptionParser::OctalInteger
+    DecimalNumeric = OptionParser::DecimalNumeric
+    # :startdoc:
   end
 end
 
diff --git a/lib/optparse/optparse.gemspec b/lib/optparse/optparse.gemspec
index 1aa54aa781..885b0ec380 100644
--- a/lib/optparse/optparse.gemspec
+++ b/lib/optparse/optparse.gemspec
@@ -3,7 +3,7 @@
 name = File.basename(__FILE__, ".gemspec")
 version = ["lib", Array.new(name.count("-")+1, "..").join("/")].find do |dir|
   break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*OptionParser::Version\s*=\s*"(.*)"/ =~ line and break $1
+    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
   end rescue nil
 end
 
@@ -14,7 +14,10 @@ Gem::Specification.new do |spec|
   spec.email         = ["nobu@ruby-lang.org"]
 
   spec.summary       = %q{OptionParser is a class for command-line option analysis.}
-  spec.description   = %q{OptionParser is a class for command-line option analysis.}
+  spec.description   = File.open(File.join(__dir__, "README.md")) do |readme|
+    readme.gets("") # heading
+    readme.gets("").chomp
+  end rescue spec.summary
   spec.homepage      = "https://github.com/ruby/optparse"
   spec.required_ruby_version = Gem::Requirement.new(">= 2.5.0")
   spec.licenses      = ["Ruby", "BSD-2-Clause"]
@@ -22,9 +25,9 @@ Gem::Specification.new do |spec|
   spec.metadata["homepage_uri"] = spec.homepage
   spec.metadata["source_code_uri"] = spec.homepage
 
-  spec.files         = Dir["{doc,lib,misc}/**/{*,.document}"] +
-                       %w[README.md ChangeLog COPYING .document .rdoc_options]
-  spec.rdoc_options  = ["--main=README.md", "--op=rdoc", "--page-dir=doc"]
+  dir, gemspec = File.split(__FILE__)
+  excludes = %W[#{gemspec} rakelib test/ Gemfile Rakefile .git* .editor*].map {|n| ":^"+n}
+  spec.files = IO.popen(%w[git ls-files -z --] + excludes, chdir: dir, &:read).split("\x0")
   spec.bindir        = "exe"
   spec.executables   = []
   spec.require_paths = ["lib"]
diff --git a/lib/ostruct.gemspec b/lib/ostruct.gemspec
deleted file mode 100644
index 08a7aefb05..0000000000
--- a/lib/ostruct.gemspec
+++ /dev/null
@@ -1,24 +0,0 @@
-# frozen_string_literal: true
-
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", Array.new(name.count("-")+1, ".").join("/")].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Marc-Andre Lafortune"]
-  spec.email         = ["ruby-core@marc-andre.ca"]
-
-  spec.summary       = %q{Class to build custom data structures, similar to a Hash.}
-  spec.description   = %q{Class to build custom data structures, similar to a Hash.}
-  spec.homepage      = "https://github.com/ruby/ostruct"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-  spec.required_ruby_version = ">= 2.5.0"
-
-  spec.files         = [".gitignore", "Gemfile", "LICENSE.txt", "README.md", "Rakefile", "bin/console", "bin/setup", "lib/ostruct.rb", "ostruct.gemspec"]
-  spec.require_paths = ["lib"]
-end
diff --git a/lib/ostruct.rb b/lib/ostruct.rb
deleted file mode 100644
index c762baa5a5..0000000000
--- a/lib/ostruct.rb
+++ /dev/null
@@ -1,489 +0,0 @@
-# frozen_string_literal: true
-#
-# = ostruct.rb: OpenStruct implementation
-#
-# Author:: Yukihiro Matsumoto
-# Documentation:: Gavin Sinclair
-#
-# OpenStruct allows the creation of data objects with arbitrary attributes.
-# See OpenStruct for an example.
-#
-
-#
-# An OpenStruct is a data structure, similar to a Hash, that allows the
-# definition of arbitrary attributes with their accompanying values. This is
-# accomplished by using Ruby's metaprogramming to define methods on the class
-# itself.
-#
-# == Examples
-#
-#   require "ostruct"
-#
-#   person = OpenStruct.new
-#   person.name = "John Smith"
-#   person.age  = 70
-#
-#   person.name      # => "John Smith"
-#   person.age       # => 70
-#   person.address   # => nil
-#
-# An OpenStruct employs a Hash internally to store the attributes and values
-# and can even be initialized with one:
-#
-#   australia = OpenStruct.new(:country => "Australia", :capital => "Canberra")
-#     # => #<OpenStruct country="Australia", capital="Canberra">
-#
-# Hash keys with spaces or characters that could normally not be used for
-# method calls (e.g. <code>()[]*</code>) will not be immediately available
-# on the OpenStruct object as a method for retrieval or assignment, but can
-# still be reached through the Object#send method or using [].
-#
-#   measurements = OpenStruct.new("length (in inches)" => 24)
-#   measurements[:"length (in inches)"]       # => 24
-#   measurements.send("length (in inches)")   # => 24
-#
-#   message = OpenStruct.new(:queued? => true)
-#   message.queued?                           # => true
-#   message.send("queued?=", false)
-#   message.queued?                           # => false
-#
-# Removing the presence of an attribute requires the execution of the
-# delete_field method as setting the property value to +nil+ will not
-# remove the attribute.
-#
-#   first_pet  = OpenStruct.new(:name => "Rowdy", :owner => "John Smith")
-#   second_pet = OpenStruct.new(:name => "Rowdy")
-#
-#   first_pet.owner = nil
-#   first_pet                 # => #<OpenStruct name="Rowdy", owner=nil>
-#   first_pet == second_pet   # => false
-#
-#   first_pet.delete_field(:owner)
-#   first_pet                 # => #<OpenStruct name="Rowdy">
-#   first_pet == second_pet   # => true
-#
-# Ractor compatibility: A frozen OpenStruct with shareable values is itself shareable.
-#
-# == Caveats
-#
-# An OpenStruct utilizes Ruby's method lookup structure to find and define the
-# necessary methods for properties. This is accomplished through the methods
-# method_missing and define_singleton_method.
-#
-# This should be a consideration if there is a concern about the performance of
-# the objects that are created, as there is much more overhead in the setting
-# of these properties compared to using a Hash or a Struct.
-# Creating an open struct from a small Hash and accessing a few of the
-# entries can be 200 times slower than accessing the hash directly.
-#
-# This is a potential security issue; building OpenStruct from untrusted user data
-# (e.g. JSON web request) may be susceptible to a "symbol denial of service" attack
-# since the keys create methods and names of methods are never garbage collected.
-#
-# This may also be the source of incompatibilities between Ruby versions:
-#
-#   o = OpenStruct.new
-#   o.then # => nil in Ruby < 2.6, enumerator for Ruby >= 2.6
-#
-# Builtin methods may be overwritten this way, which may be a source of bugs
-# or security issues:
-#
-#   o = OpenStruct.new
-#   o.methods # => [:to_h, :marshal_load, :marshal_dump, :each_pair, ...
-#   o.methods = [:foo, :bar]
-#   o.methods # => [:foo, :bar]
-#
-# To help remedy clashes, OpenStruct uses only protected/private methods ending with <code>!</code>
-# and defines aliases for builtin public methods by adding a <code>!</code>:
-#
-#   o = OpenStruct.new(make: 'Bentley', class: :luxury)
-#   o.class # => :luxury
-#   o.class! # => OpenStruct
-#
-# It is recommended (but not enforced) to not use fields ending in <code>!</code>;
-# Note that a subclass' methods may not be overwritten, nor can OpenStruct's own methods
-# ending with <code>!</code>.
-#
-# For all these reasons, consider not using OpenStruct at all.
-#
-class OpenStruct
-  VERSION = "0.6.0"
-
-  HAS_PERFORMANCE_WARNINGS = begin
-    Warning[:performance]
-    true
-  rescue NoMethodError, ArgumentError
-    false
-  end
-  private_constant :HAS_PERFORMANCE_WARNINGS
-
-  #
-  # Creates a new OpenStruct object.  By default, the resulting OpenStruct
-  # object will have no attributes.
-  #
-  # The optional +hash+, if given, will generate attributes and values
-  # (can be a Hash, an OpenStruct or a Struct).
-  # For example:
-  #
-  #   require "ostruct"
-  #   hash = { "country" => "Australia", :capital => "Canberra" }
-  #   data = OpenStruct.new(hash)
-  #
-  #   data   # => #<OpenStruct country="Australia", capital="Canberra">
-  #
-  def initialize(hash=nil)
-    if HAS_PERFORMANCE_WARNINGS && Warning[:performance]
-       warn "OpenStruct use is discouraged for performance reasons", uplevel: 1, category: :performance
-    end
-
-    if hash
-      update_to_values!(hash)
-    else
-      @table = {}
-    end
-  end
-
-  # Duplicates an OpenStruct object's Hash table.
-  private def initialize_clone(orig) # :nodoc:
-    super # clones the singleton class for us
-    @table = @table.dup unless @table.frozen?
-  end
-
-  private def initialize_dup(orig) # :nodoc:
-    super
-    update_to_values!(@table)
-  end
-
-  private def update_to_values!(hash) # :nodoc:
-    @table = {}
-    hash.each_pair do |k, v|
-      set_ostruct_member_value!(k, v)
-    end
-  end
-
-  #
-  # call-seq:
-  #   ostruct.to_h                        -> hash
-  #   ostruct.to_h {|name, value| block } -> hash
-  #
-  # Converts the OpenStruct to a hash with keys representing
-  # each attribute (as symbols) and their corresponding values.
-  #
-  # If a block is given, the results of the block on each pair of
-  # the receiver will be used as pairs.
-  #
-  #   require "ostruct"
-  #   data = OpenStruct.new("country" => "Australia", :capital => "Canberra")
-  #   data.to_h   # => {:country => "Australia", :capital => "Canberra" }
-  #   data.to_h {|name, value| [name.to_s, value.upcase] }
-  #               # => {"country" => "AUSTRALIA", "capital" => "CANBERRA" }
-  #
-  if {test: :to_h}.to_h{ [:works, true] }[:works] # RUBY_VERSION < 2.6 compatibility
-    def to_h(&block)
-      if block
-        @table.to_h(&block)
-      else
-        @table.dup
-      end
-    end
-  else
-    def to_h(&block)
-      if block
-        @table.map(&block).to_h
-      else
-        @table.dup
-      end
-    end
-  end
-
-  #
-  # :call-seq:
-  #   ostruct.each_pair {|name, value| block }  -> ostruct
-  #   ostruct.each_pair                         -> Enumerator
-  #
-  # Yields all attributes (as symbols) along with the corresponding values
-  # or returns an enumerator if no block is given.
-  #
-  #   require "ostruct"
-  #   data = OpenStruct.new("country" => "Australia", :capital => "Canberra")
-  #   data.each_pair.to_a   # => [[:country, "Australia"], [:capital, "Canberra"]]
-  #
-  def each_pair
-    return to_enum(__method__) { @table.size } unless defined?(yield)
-    @table.each_pair{|p| yield p}
-    self
-  end
-
-  #
-  # Provides marshalling support for use by the Marshal library.
-  #
-  def marshal_dump # :nodoc:
-    @table
-  end
-
-  #
-  # Provides marshalling support for use by the Marshal library.
-  #
-  alias_method :marshal_load, :update_to_values! # :nodoc:
-
-  #
-  # Used internally to defined properties on the
-  # OpenStruct. It does this by using the metaprogramming function
-  # define_singleton_method for both the getter method and the setter method.
-  #
-  def new_ostruct_member!(name) # :nodoc:
-    unless @table.key?(name) || is_method_protected!(name)
-      if defined?(::Ractor)
-        getter_proc = nil.instance_eval{ Proc.new { @table[name] } }
-        setter_proc = nil.instance_eval{ Proc.new {|x| @table[name] = x} }
-        ::Ractor.make_shareable(getter_proc)
-        ::Ractor.make_shareable(setter_proc)
-      else
-        getter_proc = Proc.new { @table[name] }
-        setter_proc = Proc.new {|x| @table[name] = x}
-      end
-      define_singleton_method!(name, &getter_proc)
-      define_singleton_method!("#{name}=", &setter_proc)
-    end
-  end
-  private :new_ostruct_member!
-
-  private def is_method_protected!(name) # :nodoc:
-    if !respond_to?(name, true)
-      false
-    elsif name.match?(/!$/)
-      true
-    else
-      owner = method!(name).owner
-      if owner.class == ::Class
-        owner < ::OpenStruct
-      else
-        self.class!.ancestors.any? do |mod|
-          return false if mod == ::OpenStruct
-          mod == owner
-        end
-      end
-    end
-  end
-
-  def freeze
-    @table.freeze
-    super
-  end
-
-  private def method_missing(mid, *args) # :nodoc:
-    len = args.length
-    if mname = mid[/.*(?==\z)/m]
-      if len != 1
-        raise! ArgumentError, "wrong number of arguments (given #{len}, expected 1)", caller(1)
-      end
-      set_ostruct_member_value!(mname, args[0])
-    elsif len == 0
-      @table[mid]
-    else
-      begin
-        super
-      rescue NoMethodError => err
-        err.backtrace.shift
-        raise!
-      end
-    end
-  end
-
-  #
-  # :call-seq:
-  #   ostruct[name]  -> object
-  #
-  # Returns the value of an attribute, or +nil+ if there is no such attribute.
-  #
-  #   require "ostruct"
-  #   person = OpenStruct.new("name" => "John Smith", "age" => 70)
-  #   person[:age]   # => 70, same as person.age
-  #
-  def [](name)
-    @table[name.to_sym]
-  end
-
-  #
-  # :call-seq:
-  #   ostruct[name] = obj  -> obj
-  #
-  # Sets the value of an attribute.
-  #
-  #   require "ostruct"
-  #   person = OpenStruct.new("name" => "John Smith", "age" => 70)
-  #   person[:age] = 42   # equivalent to person.age = 42
-  #   person.age          # => 42
-  #
-  def []=(name, value)
-    name = name.to_sym
-    new_ostruct_member!(name)
-    @table[name] = value
-  end
-  alias_method :set_ostruct_member_value!, :[]=
-  private :set_ostruct_member_value!
-
-  # :call-seq:
-  #   ostruct.dig(name, *identifiers) -> object
-  #
-  # Finds and returns the object in nested objects
-  # that is specified by +name+ and +identifiers+.
-  # The nested objects may be instances of various classes.
-  # See {Dig Methods}[rdoc-ref:dig_methods.rdoc].
-  #
-  # Examples:
-  #   require "ostruct"
-  #   address = OpenStruct.new("city" => "Anytown NC", "zip" => 12345)
-  #   person  = OpenStruct.new("name" => "John Smith", "address" => address)
-  #   person.dig(:address, "zip") # => 12345
-  #   person.dig(:business_address, "zip") # => nil
-  def dig(name, *names)
-    begin
-      name = name.to_sym
-    rescue NoMethodError
-      raise! TypeError, "#{name} is not a symbol nor a string"
-    end
-    @table.dig(name, *names)
-  end
-
-  #
-  # Removes the named field from the object and returns the value the field
-  # contained if it was defined. You may optionally provide a block.
-  # If the field is not defined, the result of the block is returned,
-  # or a NameError is raised if no block was given.
-  #
-  #   require "ostruct"
-  #
-  #   person = OpenStruct.new(name: "John", age: 70, pension: 300)
-  #
-  #   person.delete_field!("age")  # => 70
-  #   person                       # => #<OpenStruct name="John", pension=300>
-  #
-  # Setting the value to +nil+ will not remove the attribute:
-  #
-  #   person.pension = nil
-  #   person                 # => #<OpenStruct name="John", pension=nil>
-  #
-  #   person.delete_field('number')  # => NameError
-  #
-  #   person.delete_field('number') { 8675_309 } # => 8675309
-  #
-  def delete_field(name, &block)
-    sym = name.to_sym
-    begin
-      singleton_class.remove_method(sym, "#{sym}=")
-    rescue NameError
-    end
-    @table.delete(sym) do
-      return yield if block
-      raise! NameError.new("no field '#{sym}' in #{self}", sym)
-    end
-  end
-
-  InspectKey = :__inspect_key__ # :nodoc:
-
-  #
-  # Returns a string containing a detailed summary of the keys and values.
-  #
-  def inspect
-    ids = (Thread.current[InspectKey] ||= [])
-    if ids.include?(object_id)
-      detail = ' ...'
-    else
-      ids << object_id
-      begin
-        detail = @table.map do |key, value|
-          " #{key}=#{value.inspect}"
-        end.join(',')
-      ensure
-        ids.pop
-      end
-    end
-    ['#<', self.class!, detail, '>'].join
-  end
-  alias :to_s :inspect
-
-  attr_reader :table # :nodoc:
-  alias table! table
-  protected :table!
-
-  #
-  # Compares this object and +other+ for equality.  An OpenStruct is equal to
-  # +other+ when +other+ is an OpenStruct and the two objects' Hash tables are
-  # equal.
-  #
-  #   require "ostruct"
-  #   first_pet  = OpenStruct.new("name" => "Rowdy")
-  #   second_pet = OpenStruct.new(:name  => "Rowdy")
-  #   third_pet  = OpenStruct.new("name" => "Rowdy", :age => nil)
-  #
-  #   first_pet == second_pet   # => true
-  #   first_pet == third_pet    # => false
-  #
-  def ==(other)
-    return false unless other.kind_of?(OpenStruct)
-    @table == other.table!
-  end
-
-  #
-  # Compares this object and +other+ for equality.  An OpenStruct is eql? to
-  # +other+ when +other+ is an OpenStruct and the two objects' Hash tables are
-  # eql?.
-  #
-  def eql?(other)
-    return false unless other.kind_of?(OpenStruct)
-    @table.eql?(other.table!)
-  end
-
-  # Computes a hash code for this OpenStruct.
-  def hash # :nodoc:
-    @table.hash
-  end
-
-  #
-  # Provides marshalling support for use by the YAML library.
-  #
-  def encode_with(coder) # :nodoc:
-    @table.each_pair do |key, value|
-      coder[key.to_s] = value
-    end
-    if @table.size == 1 && @table.key?(:table) # support for legacy format
-      # in the very unlikely case of a single entry called 'table'
-      coder['legacy_support!'] = true # add a bogus second entry
-    end
-  end
-
-  #
-  # Provides marshalling support for use by the YAML library.
-  #
-  def init_with(coder) # :nodoc:
-    h = coder.map
-    if h.size == 1 # support for legacy format
-      key, val = h.first
-      if key == 'table'
-        h = val
-      end
-    end
-    update_to_values!(h)
-  end
-
-  # Make all public methods (builtin or our own) accessible with <code>!</code>:
-  give_access = instance_methods
-  # See https://github.com/ruby/ostruct/issues/30
-  give_access -= %i[instance_exec instance_eval eval] if RUBY_ENGINE == 'jruby'
-  give_access.each do |method|
-    next if method.match(/\W$/)
-
-    new_name = "#{method}!"
-    alias_method new_name, method
-  end
-  # Other builtin private methods we use:
-  alias_method :raise!, :raise
-  private :raise!
-
-  # See https://github.com/ruby/ostruct/issues/40
-  if RUBY_ENGINE != 'jruby'
-    alias_method :block_given!, :block_given?
-    private :block_given!
-  end
-end
diff --git a/lib/pathname.rb b/lib/pathname.rb
new file mode 100644
index 0000000000..0e51e1fdf6
--- /dev/null
+++ b/lib/pathname.rb
@@ -0,0 +1,151 @@
+# frozen_string_literal: true
+#
+# = pathname.rb
+#
+# Object-Oriented Pathname Class
+#
+# Author:: Tanaka Akira <akr@m17n.org>
+# Documentation:: Author and Gavin Sinclair
+#
+# For documentation, see class Pathname.
+#
+class Pathname
+
+  # :markup: markdown
+  #
+  # call-seq:
+  #   Pathname.find(ignore_error: true) -> nil
+  #
+  # With a block given, performs a depth-first traversal of the path in `self`;
+  # calls the block with each found path:
+  #
+  # ```ruby
+  # paths = []
+  # Pathname('lib').find {|path| paths << path }
+  # paths.size  # => 909
+  # paths.take(3)
+  # # =>
+  # # [#<Pathname:lib>,
+  # #  #<Pathname:lib/English.gemspec>,
+  # #  #<Pathname:lib/English.rb>]
+  # ```
+  #
+  # When `self` contains `'.'`, the found paths omit the leading `'./'`:
+  #
+  # ```ruby
+  # paths = []
+  # Dir.chdir('lib') do
+  #   Pathname('.').find {|path| paths << path }
+  # end
+  # paths.take(3)
+  # # # =>
+  # # [#<Pathname:.>,
+  # #  #<Pathname:English.gemspec>,
+  # #  #<Pathname:English.rb>]
+  # ```
+  #
+  # This method calls method Find.find;
+  # therefore method Find.prune may be used in the block:
+  #
+  # ```ruby
+  # files = []
+  # Pathname('.').find do |path|
+  #   Find.prune if File.basename(path) == 'test'
+  #   next unless File.file?(path) && File.extname(path) == '.rb'
+  #   files << path
+  # end
+  # files.size # => 6690
+  # files.take(3)
+  # # # =>
+  # # [#<Pathname:KNOWNBUGS.rb>,
+  # #  #<Pathname:array.rb>,
+  # #  #<Pathname:ast.rb>]
+  # ```
+  #
+  # Raises an exception if the path in `self` cannot be read.
+  #
+  # When keyword argument `ignore_error` is given as `true` (the default),
+  # certain exceptions during traversal are ignored (i.e., silently rescued):
+  # Errno::ENOENT, Errno::EACCES, Errno::ENOTDIR, Errno::ELOOP, Errno::ENAMETOOLONG, Errno::EINVAL;
+  # when given as `false`, no exceptions are rescued.
+  #
+  # Note that these exceptions may be ignored only in `Pathname#find` traversal code;
+  # an exception raised before traversal begins,
+  # or raised while in the block is not ignored.
+  # Each of the calls below raises an Errno::ENOENT exception that is not ignored:
+  #
+  # ```ruby
+  # Pathname('nosuch').find { }
+  # Pathname('lib').find {|entry| raise Errno::ENOENT }
+  # ```
+  #
+  # With no block given, returns a new Enumerator.
+  def find(ignore_error: true) # :yield: pathname
+    return to_enum(__method__, ignore_error: ignore_error) unless block_given?
+    require 'find'
+    if @path == '.'
+      Find.find(@path, ignore_error: ignore_error) {|f| yield self.class.new(f.delete_prefix('./')) }
+    else
+      Find.find(@path, ignore_error: ignore_error) {|f| yield self.class.new(f) }
+    end
+  end
+end
+
+
+class Pathname    # * FileUtils *
+  # Recursively deletes a directory, including all directories beneath it.
+  #
+  # Note that you need to require 'pathname' to use this method.
+  #
+  # See FileUtils.rm_rf
+  def rmtree(noop: nil, verbose: nil, secure: nil)
+    # The name "rmtree" is borrowed from File::Path of Perl.
+    # File::Path provides "mkpath" and "rmtree".
+    require 'fileutils'
+    FileUtils.rm_rf(@path, noop: noop, verbose: verbose, secure: secure)
+    self
+  end
+end
+
+class Pathname    # * tmpdir *
+  # call-seq:
+  #   Pathname.mktmpdir -> new_pathname
+  #   Pathname.mktmpdir {|pathname| ... } -> object
+  #
+  # Creates:
+  #
+  # - A temporary directory via Dir.mktmpdir.
+  # - A \Pathname object that contains the path to that directory.
+  #
+  # With no block given, returns the created pathname;
+  # the caller should delete the created directory when it is no longer needed
+  # (FileUtils.rm_r is a convenient method for the deletion):
+  #
+  #   pathname = Pathname.mktmpdir
+  #   dirpath = pathname.to_s
+  #   Dir.exist?(dirpath) # => true
+  #   # Do something with the directory.
+  #   require 'fileutils'
+  #   FileUtils.rm_r(dirpath)
+  #
+  # With a block given, calls the block with the created pathname;
+  # on block exit, automatically deletes the created directory and all its contents;
+  # returns the block's exit value:
+  #
+  #   pathname = Pathname.mktmpdir do |p|
+  #     # Do something with the directory.
+  #     p
+  #   end
+  #   Dir.exist?(pathname.to_s) # => false
+  def self.mktmpdir
+    require 'tmpdir' unless defined?(Dir.mktmpdir)
+    if block_given?
+      Dir.mktmpdir do |dir|
+        dir = self.new(dir)
+        yield dir
+      end
+    else
+      self.new(Dir.mktmpdir)
+    end
+  end
+end
diff --git a/lib/pp.gemspec b/lib/pp.gemspec
index 27a92a8ce4..15a3b4dc6c 100644
--- a/lib/pp.gemspec
+++ b/lib/pp.gemspec
@@ -22,7 +22,8 @@ Gem::Specification.new do |spec|
   spec.metadata["source_code_uri"] = spec.homepage
 
   spec.files         = %w[
-    LICENSE.txt
+    BSDL
+    COPYING
     lib/pp.rb
     pp.gemspec
   ]
diff --git a/lib/pp.rb b/lib/pp.rb
index 1ec5a880eb..5fd29a373a 100644
--- a/lib/pp.rb
+++ b/lib/pp.rb
@@ -63,7 +63,8 @@ require 'prettyprint'
 
 class PP < PrettyPrint
 
-  VERSION = "0.5.0"
+  # The version string
+  VERSION = "0.6.3"
 
   # Returns the usable width for +out+.
   # As the width of +out+:
@@ -138,26 +139,19 @@ class PP < PrettyPrint
     end
   end
 
+  # Module that defines helper methods for pretty_print.
   module PPMethods
 
     # Yields to a block
     # and preserves the previous set of objects being printed.
     def guard_inspect_key
-      if Thread.current[:__recursive_key__] == nil
-        Thread.current[:__recursive_key__] = {}.compare_by_identity
-      end
-
-      if Thread.current[:__recursive_key__][:inspect] == nil
-        Thread.current[:__recursive_key__][:inspect] = {}.compare_by_identity
-      end
-
-      save = Thread.current[:__recursive_key__][:inspect]
-
+      recursive_state = Thread.current[:__recursive_key__] ||= {}.compare_by_identity
+      save = recursive_state[:inspect] ||= {}.compare_by_identity
       begin
-        Thread.current[:__recursive_key__][:inspect] = {}.compare_by_identity
+        recursive_state[:inspect] = {}.compare_by_identity
         yield
       ensure
-        Thread.current[:__recursive_key__][:inspect] = save
+        recursive_state[:inspect] = save
       end
     end
 
@@ -165,9 +159,8 @@ class PP < PrettyPrint
     # to be pretty printed. Used to break cycles in chains of objects to be
     # pretty printed.
     def check_inspect_key(id)
-      Thread.current[:__recursive_key__] &&
-      Thread.current[:__recursive_key__][:inspect] &&
-      Thread.current[:__recursive_key__][:inspect].include?(id)
+      recursive_state = Thread.current[:__recursive_key__] or return false
+      recursive_state[:inspect]&.include?(id)
     end
 
     # Adds the object_id +id+ to the set of objects being pretty printed, so
@@ -181,6 +174,24 @@ class PP < PrettyPrint
       Thread.current[:__recursive_key__][:inspect].delete id
     end
 
+    private def guard_inspect(object) # :nodoc:
+      recursive_state = Thread.current[:__recursive_key__]
+
+      if recursive_state&.key?(:inspect)
+        begin
+          push_inspect_key(object)
+          yield
+        ensure
+          pop_inspect_key(object) unless PP.sharing_detection
+        end
+      else
+        guard_inspect_key do
+          push_inspect_key(object)
+          yield
+        end
+      end
+    end
+
     # Adds +obj+ to the pretty printing buffer
     # using Object#pretty_print or Object#pretty_print_cycle.
     #
@@ -189,18 +200,19 @@ class PP < PrettyPrint
     def pp(obj)
       # If obj is a Delegator then use the object being delegated to for cycle
       # detection
-      obj = obj.__getobj__ if defined?(::Delegator) and obj.is_a?(::Delegator)
+      obj = obj.__getobj__ if defined?(::Delegator) and ::Delegator === obj
 
       if check_inspect_key(obj)
         group {obj.pretty_print_cycle self}
         return
       end
 
-      begin
-        push_inspect_key(obj)
-        group {obj.pretty_print self}
-      ensure
-        pop_inspect_key(obj) unless PP.sharing_detection
+      guard_inspect(obj) do
+        group do
+          obj.pretty_print self
+        rescue NoMethodError
+          text Kernel.instance_method(:inspect).bind_call(obj)
+        end
       end
     end
 
@@ -255,15 +267,20 @@ class PP < PrettyPrint
     def seplist(list, sep=nil, iter_method=:each) # :yield: element
       sep ||= lambda { comma_breakable }
       first = true
+      kwsplat = EMPTY_KWHASH
       list.__send__(iter_method) {|*v|
         if first
           first = false
         else
           sep.call
         end
-        RUBY_VERSION >= "3.0" ? yield(*v, **{}) : yield(*v)
+        kwsplat ? yield(*v, **kwsplat) : yield(*v)
       }
     end
+    EMPTY_KWHASH = if RUBY_VERSION >= "3.0" # :nodoc:
+      {}.freeze
+    end
+    private_constant :EMPTY_KWHASH
 
     # A present standard failsafe for pretty printing any given Object
     def pp_object(obj)
@@ -292,14 +309,33 @@ class PP < PrettyPrint
       }
     end
 
-    # A pretty print for a pair of Hash
-    def pp_hash_pair(k, v)
-      pp k
-      text '=>'
-      group(1) {
-        breakable ''
-        pp v
-      }
+    if RUBY_VERSION >= '3.4.'
+      # A pretty print for a pair of Hash
+      def pp_hash_pair(k, v)
+        if Symbol === k
+          if k.inspect.match?(%r[\A:["$@!]|[%&*+\-\/<=>@\]^`|~]\z])
+            k = k.to_s.inspect
+          end
+          text "#{k}:"
+        else
+          pp k
+          text ' '
+          text '=>'
+        end
+        group(1) {
+          breakable
+          pp v
+        }
+      end
+    else
+      def pp_hash_pair(k, v)
+        pp k
+        text '=>'
+        group(1) {
+          breakable ''
+          pp v
+        }
+      end
     end
   end
 
@@ -352,7 +388,8 @@ class PP < PrettyPrint
     # This method should return an array of names of instance variables as symbols or strings as:
     # +[:@a, :@b]+.
     def pretty_print_instance_variables
-      instance_variables.sort
+      ivars = respond_to?(:instance_variables_to_inspect, true) ? instance_variables_to_inspect || instance_variables : instance_variables
+      ivars.sort
     end
 
     # Is #inspect implementation using #pretty_print.
@@ -395,6 +432,28 @@ class Hash # :nodoc:
   end
 end
 
+if defined?(Set)
+  if set_pp = Set.instance_method(:initialize).source_location
+    set_pp = !set_pp.first.end_with?("/set.rb") # not defined in set.rb
+  else
+    set_pp = true               # defined in C
+  end
+end
+class Set # :nodoc:
+  def pretty_print(pp)  # :nodoc:
+    pp.group(1, "#{self.class.name}[", ']') {
+      pp.seplist(self) { |o|
+        pp.pp o
+      }
+    }
+  end
+
+  def pretty_print_cycle(pp)    # :nodoc:
+    name = self.class.name
+    pp.text(empty? ? "#{name}[]" : "#{name}[...]")
+  end
+end if set_pp
+
 class << ENV # :nodoc:
   def pretty_print(q) # :nodoc:
     h = {}
@@ -425,18 +484,37 @@ class Struct # :nodoc:
   end
 end
 
+verbose, $VERBOSE = $VERBOSE, nil
+begin
+  has_data_define = defined?(Data.define)
+ensure
+  $VERBOSE = verbose
+end
+
 class Data # :nodoc:
   def pretty_print(q) # :nodoc:
     class_name = PP.mcall(self, Kernel, :class).name
     class_name = " #{class_name}" if class_name
     q.group(1, "#<data#{class_name}", '>') {
-      q.seplist(PP.mcall(self, Kernel, :class).members, lambda { q.text "," }) {|member|
+
+      members = PP.mcall(self, Kernel, :class).members
+      values = []
+      members.select! do |member|
+        begin
+          values << __send__(member)
+          true
+        rescue NoMethodError
+          false
+        end
+      end
+
+      q.seplist(members.zip(values), lambda { q.text "," }) {|(member, value)|
         q.breakable
         q.text member.to_s
         q.text '='
         q.group(1) {
           q.breakable ''
-          q.pp public_send(member)
+          q.pp value
         }
       }
     }
@@ -445,15 +523,17 @@ class Data # :nodoc:
   def pretty_print_cycle(q) # :nodoc:
     q.text sprintf("#<data %s:...>", PP.mcall(self, Kernel, :class).name)
   end
-end if defined?(Data.define)
+end if has_data_define
 
 class Range # :nodoc:
   def pretty_print(q) # :nodoc:
-    q.pp self.begin if self.begin
+    begin_nil = self.begin == nil
+    end_nil = self.end == nil
+    q.pp self.begin if !begin_nil || end_nil
     q.breakable ''
     q.text(self.exclude_end? ? '...' : '..')
     q.breakable ''
-    q.pp self.end if self.end
+    q.pp self.end if !end_nil || begin_nil
   end
 end
 
@@ -582,7 +662,7 @@ class MatchData # :nodoc:
 end
 
 if defined?(RubyVM::AbstractSyntaxTree)
-  class RubyVM::AbstractSyntaxTree::Node
+  class RubyVM::AbstractSyntaxTree::Node # :nodoc:
     def pretty_print_children(q, names = [])
       children.zip(names) do |c, n|
         if n
@@ -647,7 +727,7 @@ module Kernel
 
   # prints arguments in pretty form.
   #
-  # pp returns argument(s).
+  # +#pp+ returns argument(s).
   def pp(*objs)
     objs.each {|obj|
       PP.pp(obj)
diff --git a/lib/prettyprint.rb b/lib/prettyprint.rb
index 6f50192f5d..44ca5e816f 100644
--- a/lib/prettyprint.rb
+++ b/lib/prettyprint.rb
@@ -33,6 +33,7 @@
 #
 class PrettyPrint
 
+  # The version string
   VERSION = "0.2.0"
 
   # This is a convenience method which is same as follows:
@@ -486,8 +487,10 @@ class PrettyPrint
   # It is passed to be similar to a PrettyPrint object itself, by responding to:
   # * #text
   # * #breakable
+  # * #fill_breakable
   # * #nest
   # * #group
+  # * #group_sub
   # * #flush
   # * #first?
   #
@@ -521,6 +524,13 @@ class PrettyPrint
       @output << sep
     end
 
+    # Appends +sep+ to the text to be output. By default +sep+ is ' '
+    #
+    # +width+ argument is here for compatibility. It is a noop argument.
+    def fill_breakable(sep=' ', width=nil)
+      @output << sep
+    end
+
     # Takes +indent+ arg, but does nothing with it.
     #
     # Yields to a block.
@@ -544,6 +554,15 @@ class PrettyPrint
       @first.pop
     end
 
+    # Yields to a block for compatibility.
+    def group_sub # :nodoc:
+      yield
+    end
+
+    # Method present for compatibility, but is a noop
+    def break_outmost_groups # :nodoc:
+    end
+
     # Method present for compatibility, but is a noop
     def flush # :nodoc:
     end
diff --git a/lib/prism.rb b/lib/prism.rb
index 66a64e7fd0..8f0342724a 100644
--- a/lib/prism.rb
+++ b/lib/prism.rb
@@ -1,4 +1,7 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 # The Prism Ruby parser.
 #
@@ -19,53 +22,108 @@ module Prism
   autoload :DSL, "prism/dsl"
   autoload :InspectVisitor, "prism/inspect_visitor"
   autoload :LexCompat, "prism/lex_compat"
-  autoload :LexRipper, "prism/lex_compat"
   autoload :MutationCompiler, "prism/mutation_compiler"
-  autoload :Pack, "prism/pack"
+  autoload :NodeFind, "prism/node_find"
   autoload :Pattern, "prism/pattern"
   autoload :Reflection, "prism/reflection"
+  autoload :Relocation, "prism/relocation"
   autoload :Serialize, "prism/serialize"
+  autoload :StringQuery, "prism/string_query"
   autoload :Translation, "prism/translation"
   autoload :Visitor, "prism/visitor"
 
   # Some of these constants are not meant to be exposed, so marking them as
   # private here.
 
-  private_constant :LexCompat
-  private_constant :LexRipper
+  if RUBY_ENGINE != "jruby"
+    private_constant :LexCompat
+    private_constant :NodeFind
+  end
+
+  # Raised when requested to parse as the currently running Ruby version but Prism has no support for it.
+  class CurrentVersionError < ArgumentError
+    # Initialize a new exception for the given ruby version string.
+    #--
+    #: (String version) -> void
+    def initialize(version)
+      message = +"invalid version: Requested to parse as `version: 'current'`; "
+      major, minor, =
+        if version.match?(/\A\d+\.\d+.\d+\z/)
+          version.split(".").map(&:to_i)
+        end
+
+      if major && minor && ((major < 3) || (major == 3 && minor < 3))
+        message << " #{version} is below the minimum supported syntax."
+      else
+        message << " #{version} is unknown. Please update the `prism` gem."
+      end
+
+      super(message)
+    end
+  end
 
   # :call-seq:
-  #   Prism::lex_compat(source, **options) -> LexCompat::Result
+  #   lex_compat(source, **options) -> LexCompat::Result
   #
   # Returns a parse result whose value is an array of tokens that closely
-  # resembles the return value of Ripper::lex. The main difference is that the
-  # `:on_sp` token is not emitted.
+  # resembles the return value of Ripper.lex.
   #
-  # For supported options, see Prism::parse.
+  # For supported options, see Prism.parse.
+  #--
+  #: (String source, **untyped options) -> LexCompat::Result
   def self.lex_compat(source, **options)
     LexCompat.new(source, **options).result # steep:ignore
   end
 
   # :call-seq:
-  #   Prism::lex_ripper(source) -> Array
+  #   load(source, serialized, freeze) -> ParseResult
   #
-  # This lexes with the Ripper lex. It drops any space events but otherwise
-  # returns the same tokens. Raises SyntaxError if the syntax in source is
-  # invalid.
-  def self.lex_ripper(source)
-    LexRipper.new(source).result # steep:ignore
+  # Load the serialized AST using the source as a reference into a tree.
+  #--
+  #: (String source, String serialized, ?bool freeze) -> ParseResult
+  def self.load(source, serialized, freeze = false)
+    Serialize.load_parse(source, serialized, freeze)
   end
 
-  # :call-seq:
-  #   Prism::load(source, serialized) -> ParseResult
-  #
-  # Load the serialized AST using the source as a reference into a tree.
-  def self.load(source, serialized)
-    Serialize.load(source, serialized)
+  # Given a Method, UnboundMethod, Proc, or Thread::Backtrace::Location,
+  # returns the Prism node representing it. On CRuby, this uses node_id for
+  # an exact match. On other implementations, it falls back to best-effort
+  # matching by source location line number.
+  #--
+  #: (Method | UnboundMethod | Proc | Thread::Backtrace::Location callable, ?rubyvm: bool) -> Node?
+  def self.find(callable, rubyvm: !!defined?(RubyVM))
+    NodeFind.find(callable, rubyvm)
   end
+
+  # @rbs!
+  #    VERSION: String
+  #    BACKEND: :CEXT | :FFI
+  #
+  #    interface _Stream
+  #      def gets: (?Integer integer) -> (String | nil)
+  #    end
+  #
+  #    def self.parse:               (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> ParseResult
+  #    def self.profile:             (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> void
+  #    def self.lex:                 (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> LexResult
+  #    def self.parse_lex:           (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> ParseLexResult
+  #    def self.dump:                (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> String
+  #    def self.parse_comments:      (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> Array[Comment]
+  #    def self.parse_success?:      (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> bool
+  #    def self.parse_failure?:      (String source,  ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> bool
+  #    def self.parse_stream:        (_Stream stream, ?filepath: String, ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> ParseResult
+  #    def self.parse_file:          (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> ParseResult
+  #    def self.profile_file:        (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> void
+  #    def self.lex_file:            (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> LexResult
+  #    def self.parse_lex_file:      (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> ParseLexResult
+  #    def self.dump_file:           (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> String
+  #    def self.parse_file_comments: (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> Array[Comment]
+  #    def self.parse_file_success?: (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> bool
+  #    def self.parse_file_failure?: (String filepath,                   ?command_line: String, ?encoding: Encoding | false, ?freeze: bool, ?frozen_string_literal: bool, ?line: Integer, ?main_script: bool, ?partial_script: bool, ?scopes: Array[Array[Symbol]], ?version: String) -> bool
 end
 
 require_relative "prism/polyfill/byteindex"
+require_relative "prism/polyfill/warn"
 require_relative "prism/node"
 require_relative "prism/node_ext"
 require_relative "prism/parse_result"
@@ -75,13 +133,13 @@ require_relative "prism/parse_result"
 # it's going to require the built library. Otherwise, it's going to require a
 # module that uses FFI to call into the library.
 if RUBY_ENGINE == "ruby" and !ENV["PRISM_FFI_BACKEND"]
-  require "prism/prism"
-
   # The C extension is the default backend on CRuby.
   Prism::BACKEND = :CEXT
-else
-  require_relative "prism/ffi"
 
+  require "prism/prism"
+else
   # The FFI backend is used on other Ruby implementations.
   Prism::BACKEND = :FFI
+
+  require_relative "prism/ffi"
 end
diff --git a/lib/prism/desugar_compiler.rb b/lib/prism/desugar_compiler.rb
index de02445149..c64d03f64a 100644
--- a/lib/prism/desugar_compiler.rb
+++ b/lib/prism/desugar_compiler.rb
@@ -1,122 +1,186 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
   class DesugarAndWriteNode # :nodoc:
-    attr_reader :node, :source, :read_class, :write_class, :arguments
+    include DSL
 
-    def initialize(node, source, read_class, write_class, *arguments)
+    attr_reader :node #: ClassVariableAndWriteNode | ConstantAndWriteNode | GlobalVariableAndWriteNode | InstanceVariableAndWriteNode | LocalVariableAndWriteNode
+    attr_reader :default_source #: Source
+    attr_reader :read_class, :write_class #: Symbol
+    attr_reader :arguments #: Hash[Symbol, untyped]
+
+    #: ((ClassVariableAndWriteNode | ConstantAndWriteNode | GlobalVariableAndWriteNode | InstanceVariableAndWriteNode | LocalVariableAndWriteNode) node, Source default_source, Symbol read_class, Symbol write_class, **untyped arguments) -> void
+    def initialize(node, default_source, read_class, write_class, **arguments)
       @node = node
-      @source = source
+      @default_source = default_source
       @read_class = read_class
       @write_class = write_class
       @arguments = arguments
     end
 
     # Desugar `x &&= y` to `x && x = y`
+    #--
+    #: () -> node
     def compile
-      AndNode.new(
-        source,
-        read_class.new(source, *arguments, node.name_loc),
-        write_class.new(source, *arguments, node.name_loc, node.value, node.operator_loc, node.location),
-        node.operator_loc,
-        node.location
+      and_node(
+        location: node.location,
+        left: public_send(read_class, location: node.name_loc, **arguments),
+        right: public_send(
+          write_class,
+          location: node.location,
+          **arguments,
+          name_loc: node.name_loc,
+          value: node.value,
+          operator_loc: node.operator_loc
+        ),
+        operator_loc: node.operator_loc
       )
     end
   end
 
   class DesugarOrWriteDefinedNode # :nodoc:
-    attr_reader :node, :source, :read_class, :write_class, :arguments
+    include DSL
+
+    attr_reader :node #: ClassVariableOrWriteNode | ConstantOrWriteNode | GlobalVariableOrWriteNode
+    attr_reader :default_source #: Source
+    attr_reader :read_class, :write_class #: Symbol
+    attr_reader :arguments #: Hash[Symbol, untyped]
 
-    def initialize(node, source, read_class, write_class, *arguments)
+    #: ((ClassVariableOrWriteNode | ConstantOrWriteNode | GlobalVariableOrWriteNode) node, Source default_source, Symbol read_class, Symbol write_class, **untyped arguments) -> void
+    def initialize(node, default_source, read_class, write_class, **arguments)
       @node = node
-      @source = source
+      @default_source = default_source
       @read_class = read_class
       @write_class = write_class
       @arguments = arguments
     end
 
     # Desugar `x ||= y` to `defined?(x) ? x : x = y`
+    #--
+    #: () -> node
     def compile
-      IfNode.new(
-        source,
-        node.operator_loc,
-        DefinedNode.new(source, nil, read_class.new(source, *arguments, node.name_loc), nil, node.operator_loc, node.name_loc),
-        node.operator_loc,
-        StatementsNode.new(source, [read_class.new(source, *arguments, node.name_loc)], node.location),
-        ElseNode.new(
-          source,
-          node.operator_loc,
-          StatementsNode.new(
-            source,
-            [write_class.new(source, *arguments, node.name_loc, node.value, node.operator_loc, node.location)],
-            node.location
+      if_node(
+        location: node.location,
+        if_keyword_loc: node.operator_loc,
+        predicate: defined_node(
+          location: node.name_loc,
+          value: public_send(read_class, location: node.name_loc, **arguments),
+          keyword_loc: node.operator_loc
+        ),
+        then_keyword_loc: node.operator_loc,
+        statements: statements_node(
+          location: node.location,
+          body: [public_send(read_class, location: node.name_loc, **arguments)]
+        ),
+        subsequent: else_node(
+          location: node.location,
+          else_keyword_loc: node.operator_loc,
+          statements: statements_node(
+            location: node.location,
+            body: [
+              public_send(
+                write_class,
+                location: node.location,
+                **arguments,
+                name_loc: node.name_loc,
+                value: node.value,
+                operator_loc: node.operator_loc
+              )
+            ]
           ),
-          node.operator_loc,
-          node.location
+          end_keyword_loc: node.operator_loc
         ),
-        node.operator_loc,
-        node.location
+        end_keyword_loc: node.operator_loc
       )
     end
   end
 
   class DesugarOperatorWriteNode # :nodoc:
-    attr_reader :node, :source, :read_class, :write_class, :arguments
+    include DSL
 
-    def initialize(node, source, read_class, write_class, *arguments)
+    attr_reader :node #: ClassVariableOperatorWriteNode | ConstantOperatorWriteNode | GlobalVariableOperatorWriteNode | InstanceVariableOperatorWriteNode | LocalVariableOperatorWriteNode
+    attr_reader :default_source #: Source
+    attr_reader :read_class, :write_class #: Symbol
+    attr_reader :arguments #: Hash[Symbol, untyped]
+
+    #: ((ClassVariableOperatorWriteNode | ConstantOperatorWriteNode | GlobalVariableOperatorWriteNode | InstanceVariableOperatorWriteNode | LocalVariableOperatorWriteNode) node, Source default_source, Symbol read_class, Symbol write_class, **untyped arguments) -> void
+    def initialize(node, default_source, read_class, write_class, **arguments)
       @node = node
-      @source = source
+      @default_source = default_source
       @read_class = read_class
       @write_class = write_class
       @arguments = arguments
     end
 
     # Desugar `x += y` to `x = x + y`
+    #--
+    #: () -> node
     def compile
       binary_operator_loc = node.binary_operator_loc.chop
 
-      write_class.new(
-        source,
-        *arguments,
-        node.name_loc,
-        CallNode.new(
-          source,
-          0,
-          read_class.new(source, *arguments, node.name_loc),
-          nil,
-          binary_operator_loc.slice.to_sym,
-          binary_operator_loc,
-          nil,
-          ArgumentsNode.new(source, 0, [node.value], node.value.location),
-          nil,
-          nil,
-          node.location
+      public_send(
+        write_class,
+        location: node.location,
+        **arguments,
+        name_loc: node.name_loc,
+        value: call_node(
+          location: node.location,
+          receiver: public_send(
+            read_class,
+            location: node.name_loc,
+            **arguments
+          ),
+          name: binary_operator_loc.slice.to_sym,
+          message_loc: binary_operator_loc,
+          arguments: arguments_node(
+            location: node.value.location,
+            arguments: [node.value]
+          )
         ),
-        node.binary_operator_loc.copy(start_offset: node.binary_operator_loc.end_offset - 1, length: 1),
-        node.location
+        operator_loc: node.binary_operator_loc.copy(
+          start_offset: node.binary_operator_loc.end_offset - 1,
+          length: 1
+        )
       )
     end
   end
 
   class DesugarOrWriteNode # :nodoc:
-    attr_reader :node, :source, :read_class, :write_class, :arguments
+    include DSL
 
-    def initialize(node, source, read_class, write_class, *arguments)
+    attr_reader :node #: InstanceVariableOrWriteNode | LocalVariableOrWriteNode
+    attr_reader :default_source #: Source
+    attr_reader :read_class, :write_class #: Symbol
+    attr_reader :arguments #: Hash[Symbol, untyped]
+
+    #: ((InstanceVariableOrWriteNode | LocalVariableOrWriteNode) node, Source default_source, Symbol read_class, Symbol write_class, **untyped arguments) -> void
+    def initialize(node, default_source, read_class, write_class, **arguments)
       @node = node
-      @source = source
+      @default_source = default_source
       @read_class = read_class
       @write_class = write_class
       @arguments = arguments
     end
 
     # Desugar `x ||= y` to `x || x = y`
+    #--
+    #: () -> node
     def compile
-      OrNode.new(
-        source,
-        read_class.new(source, *arguments, node.name_loc),
-        write_class.new(source, *arguments, node.name_loc, node.value, node.operator_loc, node.location),
-        node.operator_loc,
-        node.location
+      or_node(
+        location: node.location,
+        left: public_send(read_class, location: node.name_loc, **arguments),
+        right: public_send(
+          write_class,
+          location: node.location,
+          **arguments,
+          name_loc: node.name_loc,
+          value: node.value,
+          operator_loc: node.operator_loc
+        ),
+        operator_loc: node.operator_loc
       )
     end
   end
@@ -124,229 +188,274 @@ module Prism
   private_constant :DesugarAndWriteNode, :DesugarOrWriteNode, :DesugarOrWriteDefinedNode, :DesugarOperatorWriteNode
 
   class ClassVariableAndWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarAndWriteNode.new(self, source, ClassVariableReadNode, ClassVariableWriteNode, name).compile
+      DesugarAndWriteNode.new(self, source, :class_variable_read_node, :class_variable_write_node, name: name).compile
     end
   end
 
   class ClassVariableOrWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOrWriteDefinedNode.new(self, source, ClassVariableReadNode, ClassVariableWriteNode, name).compile
+      DesugarOrWriteDefinedNode.new(self, source, :class_variable_read_node, :class_variable_write_node, name: name).compile
     end
   end
 
   class ClassVariableOperatorWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOperatorWriteNode.new(self, source, ClassVariableReadNode, ClassVariableWriteNode, name).compile
+      DesugarOperatorWriteNode.new(self, source, :class_variable_read_node, :class_variable_write_node, name: name).compile
     end
   end
 
   class ConstantAndWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarAndWriteNode.new(self, source, ConstantReadNode, ConstantWriteNode, name).compile
+      DesugarAndWriteNode.new(self, source, :constant_read_node, :constant_write_node, name: name).compile
     end
   end
 
   class ConstantOrWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOrWriteDefinedNode.new(self, source, ConstantReadNode, ConstantWriteNode, name).compile
+      DesugarOrWriteDefinedNode.new(self, source, :constant_read_node, :constant_write_node, name: name).compile
     end
   end
 
   class ConstantOperatorWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOperatorWriteNode.new(self, source, ConstantReadNode, ConstantWriteNode, name).compile
+      DesugarOperatorWriteNode.new(self, source, :constant_read_node, :constant_write_node, name: name).compile
     end
   end
 
   class GlobalVariableAndWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarAndWriteNode.new(self, source, GlobalVariableReadNode, GlobalVariableWriteNode, name).compile
+      DesugarAndWriteNode.new(self, source, :global_variable_read_node, :global_variable_write_node, name: name).compile
     end
   end
 
   class GlobalVariableOrWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOrWriteDefinedNode.new(self, source, GlobalVariableReadNode, GlobalVariableWriteNode, name).compile
+      DesugarOrWriteDefinedNode.new(self, source, :global_variable_read_node, :global_variable_write_node, name: name).compile
     end
   end
 
   class GlobalVariableOperatorWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOperatorWriteNode.new(self, source, GlobalVariableReadNode, GlobalVariableWriteNode, name).compile
+      DesugarOperatorWriteNode.new(self, source, :global_variable_read_node, :global_variable_write_node, name: name).compile
     end
   end
 
   class InstanceVariableAndWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarAndWriteNode.new(self, source, InstanceVariableReadNode, InstanceVariableWriteNode, name).compile
+      DesugarAndWriteNode.new(self, source, :instance_variable_read_node, :instance_variable_write_node, name: name).compile
     end
   end
 
   class InstanceVariableOrWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOrWriteNode.new(self, source, InstanceVariableReadNode, InstanceVariableWriteNode, name).compile
+      DesugarOrWriteNode.new(self, source, :instance_variable_read_node, :instance_variable_write_node, name: name).compile
     end
   end
 
   class InstanceVariableOperatorWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOperatorWriteNode.new(self, source, InstanceVariableReadNode, InstanceVariableWriteNode, name).compile
+      DesugarOperatorWriteNode.new(self, source, :instance_variable_read_node, :instance_variable_write_node, name: name).compile
     end
   end
 
   class LocalVariableAndWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarAndWriteNode.new(self, source, LocalVariableReadNode, LocalVariableWriteNode, name, depth).compile
+      DesugarAndWriteNode.new(self, source, :local_variable_read_node, :local_variable_write_node, name: name, depth: depth).compile
     end
   end
 
   class LocalVariableOrWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOrWriteNode.new(self, source, LocalVariableReadNode, LocalVariableWriteNode, name, depth).compile
+      DesugarOrWriteNode.new(self, source, :local_variable_read_node, :local_variable_write_node, name: name, depth: depth).compile
     end
   end
 
   class LocalVariableOperatorWriteNode
+    #: () -> node
     def desugar # :nodoc:
-      DesugarOperatorWriteNode.new(self, source, LocalVariableReadNode, LocalVariableWriteNode, name, depth).compile
+      DesugarOperatorWriteNode.new(self, source, :local_variable_read_node, :local_variable_write_node, name: name, depth: depth).compile
     end
   end
 
   # DesugarCompiler is a compiler that desugars Ruby code into a more primitive
   # form. This is useful for consumers that want to deal with fewer node types.
   class DesugarCompiler < MutationCompiler
-    # @@foo &&= bar
+    # `@@foo &&= bar`
     #
     # becomes
     #
-    # @@foo && @@foo = bar
+    # `@@foo && @@foo = bar`
+    #--
+    #: (ClassVariableAndWriteNode node) -> node
     def visit_class_variable_and_write_node(node)
       node.desugar
     end
 
-    # @@foo ||= bar
+    # `@@foo ||= bar`
     #
     # becomes
     #
-    # defined?(@@foo) ? @@foo : @@foo = bar
+    # `defined?(@@foo) ? @@foo : @@foo = bar`
+    #--
+    #: (ClassVariableOrWriteNode node) -> node
     def visit_class_variable_or_write_node(node)
       node.desugar
     end
 
-    # @@foo += bar
+    # `@@foo += bar`
     #
     # becomes
     #
-    # @@foo = @@foo + bar
+    # `@@foo = @@foo + bar`
+    #--
+    #: (ClassVariableOperatorWriteNode node) -> node
     def visit_class_variable_operator_write_node(node)
       node.desugar
     end
 
-    # Foo &&= bar
+    # `Foo &&= bar`
     #
     # becomes
     #
-    # Foo && Foo = bar
+    # `Foo && Foo = bar`
+    #--
+    #: (ConstantAndWriteNode node) -> node
     def visit_constant_and_write_node(node)
       node.desugar
     end
 
-    # Foo ||= bar
+    # `Foo ||= bar`
     #
     # becomes
     #
-    # defined?(Foo) ? Foo : Foo = bar
+    # `defined?(Foo) ? Foo : Foo = bar`
+    #--
+    #: (ConstantOrWriteNode node) -> node
     def visit_constant_or_write_node(node)
       node.desugar
     end
 
-    # Foo += bar
+    # `Foo += bar`
     #
     # becomes
     #
-    # Foo = Foo + bar
+    # `Foo = Foo + bar`
+    #--
+    #: (ConstantOperatorWriteNode node) -> node
     def visit_constant_operator_write_node(node)
       node.desugar
     end
 
-    # $foo &&= bar
+    # `$foo &&= bar`
     #
     # becomes
     #
-    # $foo && $foo = bar
+    # `$foo && $foo = bar`
+    #--
+    #: (GlobalVariableAndWriteNode node) -> node
     def visit_global_variable_and_write_node(node)
       node.desugar
     end
 
-    # $foo ||= bar
+    # `$foo ||= bar`
     #
     # becomes
     #
-    # defined?($foo) ? $foo : $foo = bar
+    # `defined?($foo) ? $foo : $foo = bar`
+    #--
+    #: (GlobalVariableOrWriteNode node) -> node
     def visit_global_variable_or_write_node(node)
       node.desugar
     end
 
-    # $foo += bar
+    # `$foo += bar`
     #
     # becomes
     #
-    # $foo = $foo + bar
+    # `$foo = $foo + bar`
+    #--
+    #: (GlobalVariableOperatorWriteNode node) -> node
     def visit_global_variable_operator_write_node(node)
       node.desugar
     end
 
-    # @foo &&= bar
+    # `@foo &&= bar`
     #
     # becomes
     #
-    # @foo && @foo = bar
+    # `@foo && @foo = bar`
+    #--
+    #: (InstanceVariableAndWriteNode node) -> node
     def visit_instance_variable_and_write_node(node)
       node.desugar
     end
 
-    # @foo ||= bar
+    # `@foo ||= bar`
     #
     # becomes
     #
-    # @foo || @foo = bar
+    # `@foo || @foo = bar`
+    #--
+    #: (InstanceVariableOrWriteNode node) -> node
     def visit_instance_variable_or_write_node(node)
       node.desugar
     end
 
-    # @foo += bar
+    # `@foo += bar`
     #
     # becomes
     #
-    # @foo = @foo + bar
+    # `@foo = @foo + bar`
+    #--
+    #: (InstanceVariableOperatorWriteNode node) -> node
     def visit_instance_variable_operator_write_node(node)
       node.desugar
     end
 
-    # foo &&= bar
+    # `foo &&= bar`
     #
     # becomes
     #
-    # foo && foo = bar
+    # `foo && foo = bar`
+    #--
+    #: (LocalVariableAndWriteNode node) -> node
     def visit_local_variable_and_write_node(node)
       node.desugar
     end
 
-    # foo ||= bar
+    # `foo ||= bar`
     #
     # becomes
     #
-    # foo || foo = bar
+    # `foo || foo = bar`
+    #--
+    #: (LocalVariableOrWriteNode node) -> node
     def visit_local_variable_or_write_node(node)
       node.desugar
     end
 
-    # foo += bar
+    # `foo += bar`
     #
     # becomes
     #
-    # foo = foo + bar
+    # `foo = foo + bar`
+    #--
+    #: (LocalVariableOperatorWriteNode node) -> node
     def visit_local_variable_operator_write_node(node)
       node.desugar
     end
diff --git a/lib/prism/ffi.rb b/lib/prism/ffi.rb
index 6b48af43cc..6b9bde51ea 100644
--- a/lib/prism/ffi.rb
+++ b/lib/prism/ffi.rb
@@ -1,4 +1,5 @@
 # frozen_string_literal: true
+# :markup: markdown
 # typed: ignore
 
 # This file is responsible for mirroring the API provided by the C extension by
@@ -7,13 +8,26 @@
 require "rbconfig"
 require "ffi"
 
-module Prism
+# We want to eagerly load this file if there are Ractors so that it does not get
+# autoloaded from within a non-main Ractor.
+require "prism/serialize" if defined?(Ractor)
+
+module Prism # :nodoc:
   module LibRubyParser # :nodoc:
     extend FFI::Library
 
     # Define the library that we will be pulling functions from. Note that this
     # must align with the build shared library from make/rake.
-    ffi_lib File.expand_path("../../build/libprism.#{RbConfig::CONFIG["SOEXT"]}", __dir__)
+    libprism_in_build = File.expand_path("../../build/libprism.#{RbConfig::CONFIG["SOEXT"]}", __dir__)
+    libprism_in_libdir = "#{RbConfig::CONFIG["libdir"]}/prism/libprism.#{RbConfig::CONFIG["SOEXT"]}"
+
+    if File.exist?(libprism_in_build)
+      INCLUDE_DIR = File.expand_path("../../include", __dir__)
+      ffi_lib libprism_in_build
+    else
+      INCLUDE_DIR = "#{RbConfig::CONFIG["libdir"]}/prism/include"
+      ffi_lib libprism_in_libdir
+    end
 
     # Convert a native C type declaration into a symbol that FFI understands.
     # For example:
@@ -38,13 +52,16 @@ module Prism
     # given functions. For each one, define a function with the same name and
     # signature as the C function.
     def self.load_exported_functions_from(header, *functions, callbacks)
-      File.foreach(File.expand_path("../../include/#{header}", __dir__)) do |line|
+      File.foreach("#{INCLUDE_DIR}/#{header}") do |line|
         # We only want to attempt to load exported functions.
         next unless line.start_with?("PRISM_EXPORTED_FUNCTION ")
 
         # We only want to load the functions that we are interested in.
         next unless functions.any? { |function| line.include?(function) }
 
+        # Strip trailing attributes (PRISM_NODISCARD, PRISM_NONNULL(...), etc.)
+        line = line.sub(/\)(\s+PRISM_\w+(?:\([^)]*\))?)+\s*;/, ");")
+
         # Parse the function declaration.
         unless /^PRISM_EXPORTED_FUNCTION (?<return_type>.+) (?<name>\w+)\((?<arg_types>.+)\);$/ =~ line
           raise "Could not parse #{line}"
@@ -71,24 +88,44 @@ module Prism
       raise "Could not find functions #{functions.inspect}" unless functions.empty?
     end
 
-    callback :pm_parse_stream_fgets_t, [:pointer, :int, :pointer], :pointer
+    callback :pm_source_stream_fgets_t, [:pointer, :int, :pointer], :pointer
+    callback :pm_source_stream_feof_t, [:pointer], :int
+    pm_source_init_result_values = %i[PM_SOURCE_INIT_SUCCESS PM_SOURCE_INIT_ERROR_GENERIC PM_SOURCE_INIT_ERROR_DIRECTORY PM_SOURCE_INIT_ERROR_NON_REGULAR]
+    enum :pm_source_init_result_t, pm_source_init_result_values
+    enum :pm_string_query_t, [:PM_STRING_QUERY_ERROR, -1, :PM_STRING_QUERY_FALSE, :PM_STRING_QUERY_TRUE]
+
+    # Ractor-safe lookup table for pm_source_init_result_t, since FFI's
+    # enum_type accesses module instance variables that are not shareable.
+    SOURCE_INIT_RESULT = pm_source_init_result_values.freeze
 
     load_exported_functions_from(
-      "prism.h",
+      "prism/version.h",
       "pm_version",
+      []
+    )
+
+    load_exported_functions_from(
+      "prism/serialize.h",
       "pm_serialize_parse",
       "pm_serialize_parse_stream",
       "pm_serialize_parse_comments",
       "pm_serialize_lex",
       "pm_serialize_parse_lex",
-      "pm_parse_success_p",
-      [:pm_parse_stream_fgets_t]
+      "pm_serialize_parse_success_p",
+      []
+    )
+
+    load_exported_functions_from(
+      "prism/string_query.h",
+      "pm_string_query_local",
+      "pm_string_query_constant",
+      "pm_string_query_method_name",
+      []
     )
 
     load_exported_functions_from(
-      "prism/util/pm_buffer.h",
-      "pm_buffer_sizeof",
-      "pm_buffer_init",
+      "prism/buffer.h",
+      "pm_buffer_new",
       "pm_buffer_value",
       "pm_buffer_length",
       "pm_buffer_free",
@@ -96,20 +133,19 @@ module Prism
     )
 
     load_exported_functions_from(
-      "prism/util/pm_string.h",
-      "pm_string_mapped_init",
-      "pm_string_free",
-      "pm_string_source",
-      "pm_string_length",
-      "pm_string_sizeof",
-      []
+      "prism/source.h",
+      "pm_source_file_new",
+      "pm_source_mapped_new",
+      "pm_source_stream_new",
+      "pm_source_free",
+      "pm_source_source",
+      "pm_source_length",
+      [:pm_source_stream_fgets_t, :pm_source_stream_feof_t]
     )
 
     # This object represents a pm_buffer_t. We only use it as an opaque pointer,
     # so it doesn't need to know the fields of pm_buffer_t.
     class PrismBuffer # :nodoc:
-      SIZEOF = LibRubyParser.pm_buffer_sizeof
-
       attr_reader :pointer
 
       def initialize(pointer)
@@ -131,19 +167,22 @@ module Prism
       # Initialize a new buffer and yield it to the block. The buffer will be
       # automatically freed when the block returns.
       def self.with
-        FFI::MemoryPointer.new(SIZEOF) do |pointer|
-          raise unless LibRubyParser.pm_buffer_init(pointer)
-          return yield new(pointer)
+        buffer = LibRubyParser.pm_buffer_new
+        raise unless buffer
+
+        begin
+          yield new(buffer)
         ensure
-          LibRubyParser.pm_buffer_free(pointer)
+          LibRubyParser.pm_buffer_free(buffer)
         end
       end
     end
 
-    # This object represents a pm_string_t. We only use it as an opaque pointer,
-    # so it doesn't have to be an FFI::Struct.
-    class PrismString # :nodoc:
-      SIZEOF = LibRubyParser.pm_string_sizeof
+    # This object represents source code to be parsed. For strings it wraps a
+    # pointer directly; for files it uses a pm_source_t under the hood.
+    class PrismSource # :nodoc:
+      PLATFORM_EXPECTS_UTF8 =
+        RbConfig::CONFIG["host_os"].match?(/bccwin|cygwin|djgpp|mingw|mswin|wince|darwin/i)
 
       attr_reader :pointer, :length
 
@@ -158,7 +197,7 @@ module Prism
         @pointer.read_string(@length)
       end
 
-      # Yields a pm_string_t pointer to the given block.
+      # Yields a PrismSource backed by the given string to the block.
       def self.with_string(string)
         raise TypeError unless string.is_a?(String)
 
@@ -172,20 +211,38 @@ module Prism
         end
       end
 
-      # Yields a pm_string_t pointer to the given block.
+      # Yields a PrismSource to the given block, backed by a pm_source_t.
       def self.with_file(filepath)
         raise TypeError unless filepath.is_a?(String)
 
-        FFI::MemoryPointer.new(SIZEOF) do |pm_string|
-          if LibRubyParser.pm_string_mapped_init(pm_string, filepath)
-            pointer = LibRubyParser.pm_string_source(pm_string)
-            length = LibRubyParser.pm_string_length(pm_string)
+        # On Windows and Mac, it's expected that filepaths will be encoded in
+        # UTF-8. If they are not, we need to convert them to UTF-8 before
+        # passing them into pm_source_mapped_new.
+        if PLATFORM_EXPECTS_UTF8 && (encoding = filepath.encoding) != Encoding::ASCII_8BIT && encoding != Encoding::UTF_8
+          filepath = filepath.encode(Encoding::UTF_8)
+        end
+
+        FFI::MemoryPointer.new(:int) do |result_ptr|
+          pm_source = LibRubyParser.pm_source_mapped_new(filepath, 0, result_ptr)
+
+          case SOURCE_INIT_RESULT[result_ptr.read_int]
+          when :PM_SOURCE_INIT_SUCCESS
+            pointer = LibRubyParser.pm_source_source(pm_source)
+            length = LibRubyParser.pm_source_length(pm_source)
             return yield new(pointer, length, false)
-          else
+          when :PM_SOURCE_INIT_ERROR_GENERIC
             raise SystemCallError.new(filepath, FFI.errno)
+          when :PM_SOURCE_INIT_ERROR_DIRECTORY
+            raise Errno::EISDIR.new(filepath)
+          when :PM_SOURCE_INIT_ERROR_NON_REGULAR
+            # Fall back to reading the file through Ruby IO for non-regular
+            # files (pipes, character devices, etc.)
+            return with_string(File.read(filepath)) { |string| yield string }
+          else
+            raise "Unknown error initializing pm_source_t: #{result_ptr.read_int}"
           end
         ensure
-          LibRubyParser.pm_string_free(pm_string)
+          LibRubyParser.pm_source_free(pm_source) if pm_source && !pm_source.null?
         end
       end
     end
@@ -196,34 +253,34 @@ module Prism
   private_constant :LibRubyParser
 
   # The version constant is set by reading the result of calling pm_version.
-  VERSION = LibRubyParser.pm_version.read_string
+  VERSION = LibRubyParser.pm_version.read_string.freeze
 
   class << self
     # Mirror the Prism.dump API by using the serialization API.
     def dump(source, **options)
-      LibRubyParser::PrismString.with_string(source) { |string| dump_common(string, options) }
+      LibRubyParser::PrismSource.with_string(source) { |string| dump_common(string, options) }
     end
 
     # Mirror the Prism.dump_file API by using the serialization API.
     def dump_file(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| dump_common(string, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| dump_common(string, options) }
     end
 
     # Mirror the Prism.lex API by using the serialization API.
     def lex(code, **options)
-      LibRubyParser::PrismString.with_string(code) { |string| lex_common(string, code, options) }
+      LibRubyParser::PrismSource.with_string(code) { |string| lex_common(string, code, options) }
     end
 
     # Mirror the Prism.lex_file API by using the serialization API.
     def lex_file(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| lex_common(string, string.read, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| lex_common(string, string.read, options) }
     end
 
     # Mirror the Prism.parse API by using the serialization API.
     def parse(code, **options)
-      LibRubyParser::PrismString.with_string(code) { |string| parse_common(string, code, options) }
+      LibRubyParser::PrismSource.with_string(code) { |string| parse_common(string, code, options) }
     end
 
     # Mirror the Prism.parse_file API by using the serialization API. This uses
@@ -231,7 +288,7 @@ module Prism
     # when it is available.
     def parse_file(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| parse_common(string, string.read, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| parse_common(string, string.read, options) }
     end
 
     # Mirror the Prism.parse_stream API by using the serialization API.
@@ -247,19 +304,21 @@ module Prism
           end
         }
 
-        # In the pm_serialize_parse_stream function it accepts a pointer to the
-        # IO object as a void* and then passes it through to the callback as the
-        # third argument, but it never touches it itself. As such, since we have
-        # access to the IO object already through the closure of the lambda, we
-        # can pass a null pointer here and not worry.
-        LibRubyParser.pm_serialize_parse_stream(buffer.pointer, nil, callback, dump_options(options))
-        Prism.load(source, buffer.read)
+        eof_callback = -> (_) { stream.eof?  }
+
+        pm_source = LibRubyParser.pm_source_stream_new(nil, callback, eof_callback)
+        begin
+          LibRubyParser.pm_serialize_parse_stream(buffer.pointer, pm_source, dump_options(options))
+          Prism.load(source, buffer.read, options.fetch(:freeze, false))
+        ensure
+          LibRubyParser.pm_source_free(pm_source) if pm_source && !pm_source.null?
+        end
       end
     end
 
     # Mirror the Prism.parse_comments API by using the serialization API.
     def parse_comments(code, **options)
-      LibRubyParser::PrismString.with_string(code) { |string| parse_comments_common(string, code, options) }
+      LibRubyParser::PrismSource.with_string(code) { |string| parse_comments_common(string, code, options) }
     end
 
     # Mirror the Prism.parse_file_comments API by using the serialization
@@ -267,23 +326,23 @@ module Prism
     # to use mmap when it is available.
     def parse_file_comments(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| parse_comments_common(string, string.read, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| parse_comments_common(string, string.read, options) }
     end
 
     # Mirror the Prism.parse_lex API by using the serialization API.
     def parse_lex(code, **options)
-      LibRubyParser::PrismString.with_string(code) { |string| parse_lex_common(string, code, options) }
+      LibRubyParser::PrismSource.with_string(code) { |string| parse_lex_common(string, code, options) }
     end
 
     # Mirror the Prism.parse_lex_file API by using the serialization API.
     def parse_lex_file(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| parse_lex_common(string, string.read, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| parse_lex_common(string, string.read, options) }
     end
 
     # Mirror the Prism.parse_success? API by using the serialization API.
     def parse_success?(code, **options)
-      LibRubyParser::PrismString.with_string(code) { |string| parse_file_success_common(string, options) }
+      LibRubyParser::PrismSource.with_string(code) { |string| parse_file_success_common(string, options) }
     end
 
     # Mirror the Prism.parse_failure? API by using the serialization API.
@@ -294,7 +353,7 @@ module Prism
     # Mirror the Prism.parse_file_success? API by using the serialization API.
     def parse_file_success?(filepath, **options)
       options[:filepath] = filepath
-      LibRubyParser::PrismString.with_file(filepath) { |string| parse_file_success_common(string, options) }
+      LibRubyParser::PrismSource.with_file(filepath) { |string| parse_file_success_common(string, options) }
     end
 
     # Mirror the Prism.parse_file_failure? API by using the serialization API.
@@ -304,7 +363,7 @@ module Prism
 
     # Mirror the Prism.profile API by using the serialization API.
     def profile(source, **options)
-      LibRubyParser::PrismString.with_string(source) do |string|
+      LibRubyParser::PrismSource.with_string(source) do |string|
         LibRubyParser::PrismBuffer.with do |buffer|
           LibRubyParser.pm_serialize_parse(buffer.pointer, string.pointer, string.length, dump_options(options))
           nil
@@ -314,7 +373,7 @@ module Prism
 
     # Mirror the Prism.profile_file API by using the serialization API.
     def profile_file(filepath, **options)
-      LibRubyParser::PrismString.with_file(filepath) do |string|
+      LibRubyParser::PrismSource.with_file(filepath) do |string|
         LibRubyParser::PrismBuffer.with do |buffer|
           options[:filepath] = filepath
           LibRubyParser.pm_serialize_parse(buffer.pointer, string.pointer, string.length, dump_options(options))
@@ -328,55 +387,42 @@ module Prism
     def dump_common(string, options) # :nodoc:
       LibRubyParser::PrismBuffer.with do |buffer|
         LibRubyParser.pm_serialize_parse(buffer.pointer, string.pointer, string.length, dump_options(options))
-        buffer.read
+
+        dumped = buffer.read
+        dumped.freeze if options.fetch(:freeze, false)
+
+        dumped
       end
     end
 
     def lex_common(string, code, options) # :nodoc:
-      serialized = LibRubyParser::PrismBuffer.with do |buffer|
+      LibRubyParser::PrismBuffer.with do |buffer|
         LibRubyParser.pm_serialize_lex(buffer.pointer, string.pointer, string.length, dump_options(options))
-        buffer.read
+        Serialize.load_lex(code, buffer.read, options.fetch(:freeze, false))
       end
-
-      Serialize.load_tokens(Source.for(code), serialized)
     end
 
     def parse_common(string, code, options) # :nodoc:
       serialized = dump_common(string, options)
-      Prism.load(code, serialized)
+      Serialize.load_parse(code, serialized, options.fetch(:freeze, false))
     end
 
     def parse_comments_common(string, code, options) # :nodoc:
       LibRubyParser::PrismBuffer.with do |buffer|
         LibRubyParser.pm_serialize_parse_comments(buffer.pointer, string.pointer, string.length, dump_options(options))
-
-        source = Source.for(code)
-        loader = Serialize::Loader.new(source, buffer.read)
-
-        loader.load_header
-        loader.load_encoding
-        loader.load_start_line
-        loader.load_comments
+        Serialize.load_parse_comments(code, buffer.read, options.fetch(:freeze, false))
       end
     end
 
     def parse_lex_common(string, code, options) # :nodoc:
       LibRubyParser::PrismBuffer.with do |buffer|
         LibRubyParser.pm_serialize_parse_lex(buffer.pointer, string.pointer, string.length, dump_options(options))
-
-        source = Source.for(code)
-        loader = Serialize::Loader.new(source, buffer.read)
-
-        tokens = loader.load_tokens
-        node, comments, magic_comments, data_loc, errors, warnings = loader.load_nodes
-        tokens.each { |token,| token.value.force_encoding(loader.encoding) }
-
-        ParseLexResult.new([node, tokens], comments, magic_comments, data_loc, errors, warnings, source)
+        Serialize.load_parse_lex(code, buffer.read, options.fetch(:freeze, false))
       end
     end
 
     def parse_file_success_common(string, options) # :nodoc:
-      LibRubyParser.pm_parse_success_p(string.pointer, string.length, dump_options(options))
+      LibRubyParser.pm_serialize_parse_success_p(string.pointer, string.length, dump_options(options))
     end
 
     # Return the value that should be dumped for the command_line option.
@@ -397,6 +443,41 @@ module Prism
       end
     end
 
+    # Return the value that should be dumped for the version option.
+    def dump_options_version(version)
+      case version
+      when "current"
+        version_string_to_number(RUBY_VERSION) || raise(CurrentVersionError, RUBY_VERSION)
+      when "latest", nil
+        0 # Handled in pm_parser_init
+      when "nearest"
+        dump = version_string_to_number(RUBY_VERSION)
+        return dump if dump
+        if RUBY_VERSION < "3.3"
+          version_string_to_number("3.3")
+        else
+          0 # Handled in pm_parser_init
+        end
+      else
+        version_string_to_number(version) || raise(ArgumentError, "invalid version: #{version}")
+      end
+    end
+
+    # Converts a version string like "4.0.0" or "4.0" into a number.
+    # Returns nil if the version is unknown.
+    def version_string_to_number(version)
+      case version
+      when /\A3\.3(\.\d+)?\z/
+        1
+      when /\A3\.4(\.\d+)?\z/
+        2
+      when /\A3\.5(\.\d+)?\z/, /\A4\.0(\.\d+)?\z/
+        3
+      when /\A4\.1(\.\d+)?\z/
+        4
+      end
+    end
+
     # Convert the given options into a serialized options string.
     def dump_options(options)
       template = +""
@@ -429,17 +510,54 @@ module Prism
       values << dump_options_command_line(options)
 
       template << "C"
-      values << { nil => 0, "3.3.0" => 1, "3.3.1" => 1, "3.4.0" => 0, "latest" => 0 }.fetch(options[:version])
+      values << dump_options_version(options[:version])
+
+      template << "C"
+      values << (options[:encoding] == false ? 1 : 0)
+
+      template << "C"
+      values << (options.fetch(:main_script, false) ? 1 : 0)
+
+      template << "C"
+      values << (options.fetch(:partial_script, false) ? 1 : 0)
+
+      template << "C"
+      values << (options.fetch(:freeze, false) ? 1 : 0)
 
       template << "L"
       if (scopes = options[:scopes])
         values << scopes.length
 
         scopes.each do |scope|
+          locals = nil
+          forwarding = 0
+
+          case scope
+          when Array
+            locals = scope
+          when Scope
+            locals = scope.locals
+
+            scope.forwarding.each do |forward|
+              case forward
+              when :*     then forwarding |= 0x1
+              when :**    then forwarding |= 0x2
+              when :&     then forwarding |= 0x4
+              when :"..." then forwarding |= 0x8
+              else raise ArgumentError, "invalid forwarding value: #{forward}"
+              end
+            end
+          else
+            raise TypeError, "wrong argument type #{scope.class.inspect} (expected Array or Prism::Scope)"
+          end
+
           template << "L"
-          values << scope.length
+          values << locals.length
 
-          scope.each do |local|
+          template << "C"
+          values << forwarding
+
+          locals.each do |local|
             name = local.name
             template << "L"
             values << name.bytesize
@@ -455,4 +573,39 @@ module Prism
       values.pack(template)
     end
   end
+
+  # Here we are going to patch StringQuery to put in the class-level methods so
+  # that it can maintain a consistent interface
+  class StringQuery # :nodoc:
+    class << self
+      # Mirrors the C extension's StringQuery::local? method.
+      def local?(string)
+        query(LibRubyParser.pm_string_query_local(string, string.bytesize, string.encoding.name))
+      end
+
+      # Mirrors the C extension's StringQuery::constant? method.
+      def constant?(string)
+        query(LibRubyParser.pm_string_query_constant(string, string.bytesize, string.encoding.name))
+      end
+
+      # Mirrors the C extension's StringQuery::method_name? method.
+      def method_name?(string)
+        query(LibRubyParser.pm_string_query_method_name(string, string.bytesize, string.encoding.name))
+      end
+
+      private
+
+      # Parse the enum result and return an appropriate boolean.
+      def query(result)
+        case result
+        when :PM_STRING_QUERY_ERROR
+          raise ArgumentError, "Invalid or non ascii-compatible encoding"
+        when :PM_STRING_QUERY_FALSE
+          false
+        when :PM_STRING_QUERY_TRUE
+          true
+        end
+      end
+    end
+  end
 end
diff --git a/lib/prism/lex_compat.rb b/lib/prism/lex_compat.rb
index 4f8e443a3b..7aacec037d 100644
--- a/lib/prism/lex_compat.rb
+++ b/lib/prism/lex_compat.rb
@@ -1,28 +1,64 @@
 # frozen_string_literal: true
-
-require "delegate"
-require "ripper"
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
+  # @rbs!
+  #    module Translation
+  #      class Ripper
+  #        EXPR_NONE: Integer
+  #        EXPR_BEG: Integer
+  #        EXPR_MID: Integer
+  #        EXPR_END: Integer
+  #        EXPR_CLASS: Integer
+  #        EXPR_VALUE: Integer
+  #        EXPR_ARG: Integer
+  #        EXPR_CMDARG: Integer
+  #        EXPR_ENDARG: Integer
+  #        EXPR_ENDFN: Integer
+  #
+  #        class Lexer < Ripper
+  #          class State
+  #            def self.[]: (Integer value) -> State
+  #          end
+  #        end
+  #
+  #        class LineAndColumnCache
+  #          def initialize: (Source source) -> void
+  #
+  #          def line_and_column: (Integer byte_offset) -> [Integer, Integer]
+  #        end
+  #      end
+  #    end
+
   # This class is responsible for lexing the source using prism and then
   # converting those tokens to be compatible with Ripper. In the vast majority
   # of cases, this is a one-to-one mapping of the token type. Everything else
   # generally lines up. However, there are a few cases that require special
   # handling.
   class LexCompat # :nodoc:
+    # @rbs!
+    #    # A token produced by the Ripper lexer that Prism is replicating.
+    #    type lex_compat_token = [[Integer, Integer], Symbol, String, untyped]
+
     # A result class specialized for holding tokens produced by the lexer.
     class Result < Prism::Result
       # The list of tokens that were produced by the lexer.
-      attr_reader :value
+      attr_reader :value #: Array[lex_compat_token]
 
       # Create a new lex compat result object with the given values.
-      def initialize(value, comments, magic_comments, data_loc, errors, warnings, source)
+      #--
+      #: (Array[lex_compat_token] value, Array[Comment] comments, Array[MagicComment] magic_comments, Location? data_loc, Array[ParseError] errors, Array[ParseWarning] warnings, bool continuable, Source source) -> void
+      def initialize(value, comments, magic_comments, data_loc, errors, warnings, continuable, source)
         @value = value
-        super(comments, magic_comments, data_loc, errors, warnings, source)
+        super(comments, magic_comments, data_loc, errors, warnings, continuable, source)
       end
 
       # Implement the hash pattern matching interface for Result.
-      def deconstruct_keys(keys)
+      #--
+      #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+      def deconstruct_keys(keys) # :nodoc:
         super.merge!(value: value)
       end
     end
@@ -104,6 +140,7 @@ module Prism
       KEYWORD_DEF: :on_kw,
       KEYWORD_DEFINED: :on_kw,
       KEYWORD_DO: :on_kw,
+      KEYWORD_DO_BLOCK: :on_kw,
       KEYWORD_DO_LOOP: :on_kw,
       KEYWORD_ELSE: :on_kw,
       KEYWORD_ELSIF: :on_kw,
@@ -198,93 +235,6 @@ module Prism
       "__END__": :on___end__
     }.freeze
 
-    # When we produce tokens, we produce the same arrays that Ripper does.
-    # However, we add a couple of convenience methods onto them to make them a
-    # little easier to work with. We delegate all other methods to the array.
-    class Token < SimpleDelegator
-      # @dynamic initialize, each, []
-
-      # The location of the token in the source.
-      def location
-        self[0]
-      end
-
-      # The type of the token.
-      def event
-        self[1]
-      end
-
-      # The slice of the source that this token represents.
-      def value
-        self[2]
-      end
-
-      # The state of the lexer when this token was produced.
-      def state
-        self[3]
-      end
-    end
-
-    # Ripper doesn't include the rest of the token in the event, so we need to
-    # trim it down to just the content on the first line when comparing.
-    class EndContentToken < Token
-      def ==(other) # :nodoc:
-        [self[0], self[1], self[2][0..self[2].index("\n")], self[3]] == other
-      end
-    end
-
-    # Tokens where state should be ignored
-    # used for :on_comment, :on_heredoc_end, :on_embexpr_end
-    class IgnoreStateToken < Token
-      def ==(other) # :nodoc:
-        self[0...-1] == other[0...-1]
-      end
-    end
-
-    # Ident tokens for the most part are exactly the same, except sometimes we
-    # know an ident is a local when ripper doesn't (when they are introduced
-    # through named captures in regular expressions). In that case we don't
-    # compare the state.
-    class IdentToken < Token
-      def ==(other) # :nodoc:
-        (self[0...-1] == other[0...-1]) && (
-          (other[3] == Ripper::EXPR_LABEL | Ripper::EXPR_END) ||
-          (other[3] & Ripper::EXPR_ARG_ANY != 0)
-        )
-      end
-    end
-
-    # Ignored newlines can occasionally have a LABEL state attached to them, so
-    # we compare the state differently here.
-    class IgnoredNewlineToken < Token
-      def ==(other) # :nodoc:
-        return false unless self[0...-1] == other[0...-1]
-
-        if self[3] == Ripper::EXPR_ARG | Ripper::EXPR_LABELED
-          other[3] & Ripper::EXPR_ARG | Ripper::EXPR_LABELED != 0
-        else
-          self[3] == other[3]
-        end
-      end
-    end
-
-    # If we have an identifier that follows a method name like:
-    #
-    #     def foo bar
-    #
-    # then Ripper will mark bar as END|LABEL if there is a local in a parent
-    # scope named bar because it hasn't pushed the local table yet. We do this
-    # more accurately, so we need to allow comparing against both END and
-    # END|LABEL.
-    class ParamToken < Token
-      def ==(other) # :nodoc:
-        (self[0...-1] == other[0...-1]) && (
-          (other[3] == Ripper::EXPR_END) ||
-          (other[3] == Ripper::EXPR_END | Ripper::EXPR_LABEL)
-        )
-      end
-    end
-
     # A heredoc in this case is a list of tokens that belong to the body of the
     # heredoc that should be appended onto the list of tokens when the heredoc
     # closes.
@@ -294,16 +244,19 @@ module Prism
       # order back into the token stream and set the state of the last token to
       # the state that the heredoc was opened in.
       class PlainHeredoc # :nodoc:
-        attr_reader :tokens
+        attr_reader :tokens #: Array[lex_compat_token]
 
+        #: () -> void
         def initialize
           @tokens = []
         end
 
+        #: (lex_compat_token token) -> void
         def <<(token)
           tokens << token
         end
 
+        #: () -> Array[lex_compat_token]
         def to_a
           tokens
         end
@@ -313,22 +266,26 @@ module Prism
       # that need to be split on "\\\n" to mimic Ripper's behavior. We also need
       # to keep track of the state that the heredoc was opened in.
       class DashHeredoc # :nodoc:
-        attr_reader :split, :tokens
+        attr_reader :split #: bool
+        attr_reader :tokens #: Array[lex_compat_token]
 
+        #: (bool split) -> void
         def initialize(split)
           @split = split
           @tokens = []
         end
 
+        #: (lex_compat_token token) -> void
         def <<(token)
           tokens << token
         end
 
+        #: () -> Array[lex_compat_token]
         def to_a
           embexpr_balance = 0
 
-          tokens.each_with_object([]) do |token, results| #$ Array[Token]
-            case token.event
+          tokens.each_with_object([]) do |token, results| #$ Array[lex_compat_token]
+            case token[1]
             when :on_embexpr_beg
               embexpr_balance += 1
               results << token
@@ -343,9 +300,9 @@ module Prism
                 if split
                   # Split on "\\\n" to mimic Ripper's behavior. Use a lookbehind
                   # to keep the delimiter in the result.
-                  token.value.split(/(?<=[^\\]\\\n)|(?<=[^\\]\\\r\n)/).each_with_index do |value, index|
+                  token[2].split(/(?<=[^\\]\\\n)|(?<=[^\\]\\\r\n)/).each_with_index do |value, index|
                     column = 0 if index > 0
-                    results << Token.new([[lineno, column], :on_tstring_content, value, token.state])
+                    results << [[lineno, column], :on_tstring_content, value, token[3]]
                     lineno += value.count("\n")
                   end
                 else
@@ -374,8 +331,13 @@ module Prism
       class DedentingHeredoc # :nodoc:
         TAB_WIDTH = 8
 
-        attr_reader :tokens, :dedent_next, :dedent, :embexpr_balance
+        attr_reader :tokens #: Array[lex_compat_token]
+        attr_reader :dedent_next #: bool
+        attr_reader :dedent #: Integer?
+        attr_reader :embexpr_balance #: Integer
+        # @rbs @ended_on_newline: bool
 
+        #: () -> void
         def initialize
           @tokens = []
           @dedent_next = true
@@ -387,8 +349,10 @@ module Prism
         # As tokens are coming in, we track the minimum amount of common leading
         # whitespace on plain string content tokens. This allows us to later
         # remove that amount of whitespace from the beginning of each line.
+        #
+        #: (lex_compat_token token) -> void
         def <<(token)
-          case token.event
+          case token[1]
           when :on_embexpr_beg, :on_heredoc_beg
             @embexpr_balance += 1
             @dedent = 0 if @dedent_next && @ended_on_newline
@@ -396,10 +360,10 @@ module Prism
             @embexpr_balance -= 1
           when :on_tstring_content
             if embexpr_balance == 0
-              line = token.value
+              line = token[2]
 
               if dedent_next && !(line.strip.empty? && line.end_with?("\n"))
-                leading = line[/\A(\s*)\n?/, 1]
+                leading = line[/\A(\s*)\n?/, 1] #: String
                 next_dedent = 0
 
                 leading.each_char do |char|
@@ -419,20 +383,21 @@ module Prism
             end
           end
 
-          @dedent_next = token.event == :on_tstring_content && embexpr_balance == 0
+          @dedent_next = token[1] == :on_tstring_content && embexpr_balance == 0
           @ended_on_newline = false
           tokens << token
         end
 
+        #: () -> Array[lex_compat_token]
         def to_a
           # If every line in the heredoc is blank, we still need to split up the
           # string content token into multiple tokens.
           if dedent.nil?
-            results = [] #: Array[Token]
+            results = [] #: Array[lex_compat_token]
             embexpr_balance = 0
 
             tokens.each do |token|
-              case token.event
+              case token[1]
               when :on_embexpr_beg, :on_heredoc_beg
                 embexpr_balance += 1
                 results << token
@@ -444,9 +409,9 @@ module Prism
                   lineno = token[0][0]
                   column = token[0][1]
 
-                  token.value.split(/(?<=\n)/).each_with_index do |value, index|
+                  token[2].split(/(?<=\n)/).each_with_index do |value, index|
                     column = 0 if index > 0
-                    results << Token.new([[lineno, column], :on_tstring_content, value, token.state])
+                    results << [[lineno, column], :on_tstring_content, value, token[3]]
                     lineno += 1
                   end
                 else
@@ -463,7 +428,7 @@ module Prism
           # If the minimum common whitespace is 0, then we need to concatenate
           # string nodes together that are immediately adjacent.
           if dedent == 0
-            results = [] #: Array[Token]
+            results = [] #: Array[lex_compat_token]
             embexpr_balance = 0
 
             index = 0
@@ -474,15 +439,15 @@ module Prism
               results << token
               index += 1
 
-              case token.event
+              case token[1]
               when :on_embexpr_beg, :on_heredoc_beg
                 embexpr_balance += 1
               when :on_embexpr_end, :on_heredoc_end
                 embexpr_balance -= 1
               when :on_tstring_content
                 if embexpr_balance == 0
-                  while index < max_index && tokens[index].event == :on_tstring_content
-                    token.value << tokens[index].value
+                  while index < max_index && tokens[index][1] == :on_tstring_content && !token[2].match?(/\\\r?\n\z/)
+                    token[2] << tokens[index][2]
                     index += 1
                   end
                 end
@@ -496,7 +461,7 @@ module Prism
           # insert on_ignored_sp tokens for the amount of dedent that we need to
           # perform. We also need to remove the dedent from the beginning of
           # each line of plain string content tokens.
-          results = [] #: Array[Token]
+          results = [] #: Array[lex_compat_token]
           dedent_next = true
           embexpr_balance = 0
 
@@ -505,7 +470,7 @@ module Prism
             # whitespace calculation we performed above. This is because
             # checking if the subsequent token needs to be dedented is common to
             # both the dedent calculation and the ignored_sp insertion.
-            case token.event
+            case token[1]
             when :on_embexpr_beg
               embexpr_balance += 1
               results << token
@@ -517,7 +482,7 @@ module Prism
                 # Here we're going to split the string on newlines, but maintain
                 # the newlines in the resulting array. We'll do that with a look
                 # behind assertion.
-                splits = token.value.split(/(?<=\n)/)
+                splits = token[2].split(/(?<=\n)/)
                 index = 0
 
                 while index < splits.length
@@ -535,7 +500,8 @@ module Prism
                   # line or this line doesn't start with whitespace, then we
                   # should concatenate the rest of the string to match ripper.
                   if dedent == 0 && (!dedent_next || !line.start_with?(/\s/))
-                    line = splits[index..].join
+                    unjoined = splits[index..] #: Array[String]
+                    line = unjoined.join
                     index = splits.length
                   end
 
@@ -574,12 +540,12 @@ module Prism
                       ignored = deleted_chars.join
                       line.delete_prefix!(ignored)
 
-                      results << Token.new([[lineno, 0], :on_ignored_sp, ignored, token[3]])
+                      results << [[lineno, 0], :on_ignored_sp, ignored, token[3]]
                       column = ignored.length
                     end
                   end
 
-                  results << Token.new([[lineno, column], token[1], line, token[3]]) unless line.empty?
+                  results << [[lineno, column], token[1], line, token[3]] unless line.empty?
                   index += 1
                 end
               else
@@ -590,7 +556,7 @@ module Prism
             end
 
             dedent_next =
-              ((token.event == :on_tstring_content) || (token.event == :on_heredoc_end)) &&
+              ((token[1] == :on_tstring_content) || (token[1] == :on_heredoc_end)) &&
               embexpr_balance == 0
           end
 
@@ -600,12 +566,14 @@ module Prism
 
       # Here we will split between the two types of heredocs and return the
       # object that will store their tokens.
+      #--
+      #: (lex_compat_token opening) -> (PlainHeredoc | DashHeredoc | DedentingHeredoc)
       def self.build(opening)
-        case opening.value[2]
+        case opening[2][2]
         when "~"
           DedentingHeredoc.new
         when "-"
-          DashHeredoc.new(opening.value[3] != "'")
+          DashHeredoc.new(opening[2][3] != "'")
         else
           PlainHeredoc.new
         end
@@ -614,33 +582,43 @@ module Prism
 
     private_constant :Heredoc
 
-    attr_reader :source, :options
+    # In previous versions of Ruby, Ripper wouldn't flush the bom before the
+    # first token, so we had to have a hack in place to account for that.
+    BOM_FLUSHED = RUBY_VERSION >= "3.3.0"
+    private_constant :BOM_FLUSHED
 
+    attr_reader :options #: Hash[Symbol, untyped]
+    # @rbs @source: String
+
+    #: (String source, **untyped options) -> void
     def initialize(source, **options)
       @source = source
       @options = options
     end
 
+    #: () -> Result
     def result
-      tokens = [] #: Array[LexCompat::Token]
+      tokens = [] #: Array[lex_compat_token]
 
       state = :default
       heredoc_stack = [[]] #: Array[Array[Heredoc::PlainHeredoc | Heredoc::DashHeredoc | Heredoc::DedentingHeredoc]]
 
-      result = Prism.lex(source, **options)
+      result = Prism.lex(@source, **options)
+      source = result.source
       result_value = result.value
-      previous_state = nil #: Ripper::Lexer::State?
+      previous_state = nil #: Translation::Ripper::Lexer::State?
       last_heredoc_end = nil #: Integer?
+      eof_token = nil #: Token?
+
+      bom = source.slice(0, 3) == "\xEF\xBB\xBF"
 
-      # In previous versions of Ruby, Ripper wouldn't flush the bom before the
-      # first token, so we had to have a hack in place to account for that. This
-      # checks for that behavior.
-      bom_flushed = Ripper.lex("\xEF\xBB\xBF# test")[0][0][1] == 0
-      bom = source.byteslice(0..2) == "\xEF\xBB\xBF"
+      result_value.each_with_index do |(prism_token, prism_state), index|
+        lineno = prism_token.location.start_line
+        column = prism_token.location.start_column
 
-      result_value.each_with_index do |(token, lex_state), index|
-        lineno = token.location.start_line
-        column = token.location.start_column
+        event = RIPPER.fetch(prism_token.type)
+        value = prism_token.value
+        lex_state = Translation::Ripper::Lexer::State[prism_state]
 
         # If there's a UTF-8 byte-order mark as the start of the file, then for
         # certain tokens ripper sets the first token back by 3 bytes. It also
@@ -650,70 +628,53 @@ module Prism
         if bom && lineno == 1
           column -= 3
 
-          if index == 0 && column == 0 && !bom_flushed
+          if index == 0 && column == 0 && !BOM_FLUSHED
             flushed =
-              case token.type
+              case prism_token.type
               when :BACK_REFERENCE, :INSTANCE_VARIABLE, :CLASS_VARIABLE,
                   :GLOBAL_VARIABLE, :NUMBERED_REFERENCE, :PERCENT_LOWER_I,
                   :PERCENT_LOWER_X, :PERCENT_LOWER_W, :PERCENT_UPPER_I,
                   :PERCENT_UPPER_W, :STRING_BEGIN
                 true
               when :REGEXP_BEGIN, :SYMBOL_BEGIN
-                token.value.start_with?("%")
+                value.start_with?("%")
               else
                 false
               end
 
             unless flushed
               column -= 3
-              value = token.value
               value.prepend(String.new("\xEF\xBB\xBF", encoding: value.encoding))
             end
           end
         end
 
-        event = RIPPER.fetch(token.type)
-        value = token.value
-        lex_state = Ripper::Lexer::State.new(lex_state)
-
-        token =
+        lex_compat_token =
           case event
           when :on___end__
-            EndContentToken.new([[lineno, column], event, value, lex_state])
+            # Ripper doesn't include the rest of the token in the event, so we need to
+            # trim it down to just the content on the first line.
+            value = value[0..value.index("\n")] #: String
+            [[lineno, column], event, value, lex_state]
           when :on_comment
-            IgnoreStateToken.new([[lineno, column], event, value, lex_state])
+            [[lineno, column], event, value, lex_state]
           when :on_heredoc_end
             # Heredoc end tokens can be emitted in an odd order, so we don't
             # want to bother comparing the state on them.
-            last_heredoc_end = token.location.end_offset
-            IgnoreStateToken.new([[lineno, column], event, value, lex_state])
-          when :on_ident
-            if lex_state == Ripper::EXPR_END
-              # If we have an identifier that follows a method name like:
-              #
-              #     def foo bar
-              #
-              # then Ripper will mark bar as END|LABEL if there is a local in a
-              # parent scope named bar because it hasn't pushed the local table
-              # yet. We do this more accurately, so we need to allow comparing
-              # against both END and END|LABEL.
-              ParamToken.new([[lineno, column], event, value, lex_state])
-            elsif lex_state == Ripper::EXPR_END | Ripper::EXPR_LABEL
-              # In the event that we're comparing identifiers, we're going to
-              # allow a little divergence. Ripper doesn't account for local
-              # variables introduced through named captures in regexes, and we
-              # do, which accounts for this difference.
-              IdentToken.new([[lineno, column], event, value, lex_state])
-            else
-              Token.new([[lineno, column], event, value, lex_state])
-            end
+            last_heredoc_end = prism_token.location.end_offset
+            [[lineno, column], event, value, lex_state]
           when :on_embexpr_end
-            IgnoreStateToken.new([[lineno, column], event, value, lex_state])
-          when :on_ignored_nl
-            # Ignored newlines can occasionally have a LABEL state attached to
-            # them which doesn't actually impact anything. We don't mirror that
-            # state so we ignored it.
-            IgnoredNewlineToken.new([[lineno, column], event, value, lex_state])
+            [[lineno, column], event, value, lex_state]
+          when :on_words_sep
+            # Ripper emits one token each per line.
+            value.each_line.with_index do |line, index|
+              if index > 0
+                lineno += 1
+                column = 0
+              end
+              tokens << [[lineno, column], event, line, lex_state]
+            end
+            tokens.pop #: lex_compat_token
           when :on_regexp_end
             # On regex end, Ripper scans and then sets end state, so the ripper
             # lexed output is begin, when it should be end. prism sets lex state
@@ -738,13 +699,14 @@ module Prism
                   counter += { on_embexpr_beg: -1, on_embexpr_end: 1 }[current_event] || 0
                 end
 
-                Ripper::Lexer::State.new(result_value[current_index][1])
+                Translation::Ripper::Lexer::State[result_value[current_index][1]]
               else
                 previous_state
               end
 
-            Token.new([[lineno, column], event, value, lex_state])
+            [[lineno, column], event, value, lex_state]
           when :on_eof
+            eof_token = prism_token
             previous_token = result_value[index - 1][0]
 
             # If we're at the end of the file and the previous token was a
@@ -759,7 +721,7 @@ module Prism
               # Use the greater offset of the two to determine the start of
               # the trailing whitespace.
               start_offset = [previous_token.location.end_offset, last_heredoc_end].compact.max
-              end_offset = token.location.start_offset
+              end_offset = prism_token.location.start_offset
 
               if start_offset < end_offset
                 if bom
@@ -767,14 +729,14 @@ module Prism
                   end_offset += 3
                 end
 
-                tokens << Token.new([[lineno, 0], :on_nl, source.byteslice(start_offset...end_offset), lex_state])
+                tokens << [[lineno, 0], :on_nl, source.slice(start_offset, end_offset - start_offset), lex_state]
               end
             end
 
-            Token.new([[lineno, column], event, value, lex_state])
+            [[lineno, column], event, value, lex_state]
           else
-            Token.new([[lineno, column], event, value, lex_state])
-          end
+            [[lineno, column], event, value, lex_state]
+          end #: lex_compat_token
 
         previous_state = lex_state
 
@@ -791,19 +753,19 @@ module Prism
         when :default
           # The default state is when there are no heredocs at all. In this
           # state we can append the token to the list of tokens and move on.
-          tokens << token
+          tokens << lex_compat_token
 
           # If we get the declaration of a heredoc, then we open a new heredoc
           # and move into the heredoc_opened state.
           if event == :on_heredoc_beg
             state = :heredoc_opened
-            heredoc_stack.last << Heredoc.build(token)
+            heredoc_stack.last << Heredoc.build(lex_compat_token)
           end
         when :heredoc_opened
           # The heredoc_opened state is when we've seen the declaration of a
           # heredoc and are now lexing the body of the heredoc. In this state we
           # push tokens onto the most recently created heredoc.
-          heredoc_stack.last.last << token
+          heredoc_stack.last.last << lex_compat_token
 
           case event
           when :on_heredoc_beg
@@ -811,7 +773,7 @@ module Prism
             # heredoc, this means we have nested heredocs. In this case we'll
             # push a new heredoc onto the stack and stay in the heredoc_opened
             # state since we're now lexing the body of the new heredoc.
-            heredoc_stack << [Heredoc.build(token)]
+            heredoc_stack << [Heredoc.build(lex_compat_token)]
           when :on_heredoc_end
             # If we receive the end of a heredoc, then we're done lexing the
             # body of the heredoc. In this case we now have a completed heredoc
@@ -820,10 +782,10 @@ module Prism
             state = :heredoc_closed
           end
         when :heredoc_closed
-          if %i[on_nl on_ignored_nl on_comment].include?(event) || (event == :on_tstring_content && value.end_with?("\n"))
+          if %i[on_nl on_ignored_nl on_comment].include?(event) || ((event == :on_tstring_content) && value.end_with?("\n"))
             if heredoc_stack.size > 1
-              flushing = heredoc_stack.pop
-              heredoc_stack.last.last << token
+              flushing = heredoc_stack.pop #: Array[Heredoc::PlainHeredoc | Heredoc::DashHeredoc | Heredoc::DedentingHeredoc]
+              heredoc_stack.last.last << lex_compat_token
 
               flushing.each do |heredoc|
                 heredoc.to_a.each do |flushed_token|
@@ -835,12 +797,12 @@ module Prism
               next
             end
           elsif event == :on_heredoc_beg
-            tokens << token
+            tokens << lex_compat_token
             state = :heredoc_opened
-            heredoc_stack.last << Heredoc.build(token)
+            heredoc_stack.last << Heredoc.build(lex_compat_token)
             next
           elsif heredoc_stack.size > 1
-            heredoc_stack[-2].last << token
+            heredoc_stack[-2].last << lex_compat_token
             next
           end
 
@@ -851,77 +813,94 @@ module Prism
           heredoc_stack.last.clear
           state = :default
 
-          tokens << token
+          tokens << lex_compat_token
         end
       end
 
-      # Drop the EOF token from the list
-      tokens = tokens[0...-1]
-
-      # We sort by location to compare against Ripper's output
-      tokens.sort_by!(&:location)
-
-      Result.new(tokens, result.comments, result.magic_comments, result.data_loc, result.errors, result.warnings, Source.for(source))
-    end
-  end
+      # Drop the EOF token from the list. The EOF token may not be
+      # present if the source was syntax invalid
+      if tokens.dig(-1, 1) == :on_eof
+        tokens = tokens[0...-1] #: Array[lex_compat_token]
+      end
 
-  private_constant :LexCompat
+      # We sort by location because Ripper.lex sorts.
+      tokens.sort_by! do |token|
+        line, column = token[0]
+        source.byte_offset(line, column)
+      end
 
-  # This is a class that wraps the Ripper lexer to produce almost exactly the
-  # same tokens.
-  class LexRipper # :nodoc:
-    attr_reader :source
+      tokens = post_process_tokens(tokens, source, result.data_loc, bom, eof_token)
 
-    def initialize(source)
-      @source = source
+      Result.new(tokens, result.comments, result.magic_comments, result.data_loc, result.errors, result.warnings, result.continuable?, source)
     end
 
-    def result
-      previous = [] #: [[Integer, Integer], Symbol, String, untyped] | []
-      results = [] #: Array[[[Integer, Integer], Symbol, String, untyped]]
-
-      lex(source).each do |token|
-        case token[1]
-        when :on_sp
-          # skip
-        when :on_tstring_content
-          if previous[1] == :on_tstring_content && (token[2].start_with?("\#$") || token[2].start_with?("\#@"))
-            previous[2] << token[2]
-          else
-            results << token
-            previous = token
-          end
-        when :on_words_sep
-          if previous[1] == :on_words_sep
-            previous[2] << token[2]
+    private
+
+    #: (Array[lex_compat_token] tokens, Source source, Location? data_loc, bool bom, Token? eof_token) -> Array[lex_compat_token]
+    def post_process_tokens(tokens, source, data_loc, bom, eof_token)
+      new_tokens = [] #: Array[lex_compat_token]
+
+      prev_token_state = Translation::Ripper::Lexer::State[Translation::Ripper::EXPR_BEG]
+      prev_token_end = bom ? 3 : 0
+
+      cache = Translation::Ripper::LineAndColumnCache.new(source)
+
+      tokens.each do |token|
+        # Skip missing heredoc ends.
+        next if token[1] == :on_heredoc_end && token[2] == ""
+
+        # Add :on_sp tokens.
+        line, column = token[0]
+        start_offset = source.byte_offset(line, column)
+
+        # Ripper reports columns on line 1 without counting the BOM, so we
+        # adjust to get the real offset
+        start_offset += 3 if line == 1 && bom
+
+        if start_offset > prev_token_end
+          sp_value = source.slice(prev_token_end, start_offset - prev_token_end)
+          sp_line, sp_column = cache.line_and_column(prev_token_end)
+          # Ripper reports columns on line 1 without counting the BOM
+          sp_column -= 3 if sp_line == 1 && bom
+          continuation_index = sp_value.byteindex("\\")
+
+          # ripper emits up to three :on_sp tokens when line continuations are used
+          if continuation_index
+            next_whitespace_index = continuation_index + 1
+            next_whitespace_index += 1 if sp_value.byteslice(next_whitespace_index) == "\r"
+            next_whitespace_index += 1
+            first_whitespace = sp_value[0...continuation_index] #: String
+            continuation = sp_value[continuation_index...next_whitespace_index] #: String
+            second_whitespace = sp_value[next_whitespace_index..] || ""
+
+            new_tokens << [[sp_line, sp_column], :on_sp, first_whitespace, prev_token_state] unless first_whitespace.empty?
+            new_tokens << [[sp_line, sp_column + continuation_index], :on_sp, continuation, prev_token_state]
+            new_tokens << [[sp_line + 1, 0], :on_sp, second_whitespace, prev_token_state] unless second_whitespace.empty?
           else
-            results << token
-            previous = token
+            new_tokens << [[sp_line, sp_column], :on_sp, sp_value, prev_token_state]
           end
-        else
-          results << token
-          previous = token
         end
-      end
-
-      results
-    end
-
-    private
 
-    if Ripper.method(:lex).parameters.assoc(:keyrest)
-      def lex(source)
-        Ripper.lex(source, raise_errors: true)
+        new_tokens << token
+        prev_token_state = token[3]
+        prev_token_end = start_offset + token[2].bytesize
       end
-    else
-      def lex(source)
-        ripper = Ripper::Lexer.new(source)
-        ripper.lex.tap do |result|
-          raise SyntaxError, ripper.errors.map(&:message).join(' ;') if ripper.errors.any?
+
+      if !data_loc && eof_token # no trailing :on_sp with __END__ as it is always preceded by :on_nl
+        end_offset = eof_token.location.end_offset
+        if prev_token_end < end_offset
+          new_tokens << [
+            [source.line(prev_token_end), source.column(prev_token_end)],
+            :on_sp,
+            source.slice(prev_token_end, end_offset - prev_token_end),
+            prev_token_state
+          ]
         end
       end
+
+      new_tokens
     end
   end
 
-  private_constant :LexRipper
+  private_constant :LexCompat
 end
diff --git a/lib/prism/node_ext.rb b/lib/prism/node_ext.rb
index aa6a18cf29..8a6624e76d 100644
--- a/lib/prism/node_ext.rb
+++ b/lib/prism/node_ext.rb
@@ -1,15 +1,20 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
+#--
 # Here we are reopening the prism module to provide methods on nodes that aren't
 # templated and are meant as convenience methods.
+#++
 module Prism
   class Node
+    #: (*String replacements) -> void
     def deprecated(*replacements) # :nodoc:
-      location = caller_locations(1, 1)
-      location = location[0].label if location
+      location = caller_locations(1, 1)&.[](0)&.label
       suggest = replacements.map { |replacement| "#{self.class}##{replacement}" }
 
-      warn(<<~MSG, category: :deprecated)
+      warn(<<~MSG, uplevel: 1, category: :deprecated)
         [deprecation]: #{self.class}##{location} is deprecated and will be \
         removed in the next major version. Use #{suggest.join("/")} instead.
         #{(caller(1, 3) || []).join("\n")}
@@ -20,8 +25,13 @@ module Prism
   module RegularExpressionOptions # :nodoc:
     # Returns a numeric value that represents the flags that were used to create
     # the regular expression.
-    def options
-      o = flags & (RegularExpressionFlags::IGNORE_CASE | RegularExpressionFlags::EXTENDED | RegularExpressionFlags::MULTI_LINE)
+    #--
+    #: (Integer flags) -> Integer
+    def self.options(flags)
+      o = 0
+      o |= Regexp::IGNORECASE if flags.anybits?(RegularExpressionFlags::IGNORE_CASE)
+      o |= Regexp::EXTENDED if flags.anybits?(RegularExpressionFlags::EXTENDED)
+      o |= Regexp::MULTILINE if flags.anybits?(RegularExpressionFlags::MULTI_LINE)
       o |= Regexp::FIXEDENCODING if flags.anybits?(RegularExpressionFlags::EUC_JP | RegularExpressionFlags::WINDOWS_31J | RegularExpressionFlags::UTF_8)
       o |= Regexp::NOENCODING if flags.anybits?(RegularExpressionFlags::ASCII_8BIT)
       o
@@ -29,67 +39,121 @@ module Prism
   end
 
   class InterpolatedMatchLastLineNode < Node
-    include RegularExpressionOptions
+    # Returns a numeric value that represents the flags that were used to create
+    # the regular expression.
+    #--
+    #: () -> Integer
+    def options
+      RegularExpressionOptions.options(flags)
+    end
   end
 
   class InterpolatedRegularExpressionNode < Node
-    include RegularExpressionOptions
+    # Returns a numeric value that represents the flags that were used to create
+    # the regular expression.
+    #--
+    #: () -> Integer
+    def options
+      RegularExpressionOptions.options(flags)
+    end
   end
 
   class MatchLastLineNode < Node
-    include RegularExpressionOptions
+    # Returns a numeric value that represents the flags that were used to create
+    # the regular expression.
+    #--
+    #: () -> Integer
+    def options
+      RegularExpressionOptions.options(flags)
+    end
   end
 
   class RegularExpressionNode < Node
-    include RegularExpressionOptions
+    # Returns a numeric value that represents the flags that were used to create
+    # the regular expression.
+    #--
+    #: () -> Integer
+    def options
+      RegularExpressionOptions.options(flags)
+    end
   end
 
   private_constant :RegularExpressionOptions
 
   module HeredocQuery # :nodoc:
     # Returns true if this node was represented as a heredoc in the source code.
-    def heredoc?
+    #--
+    #: (String? opening) -> bool?
+    def self.heredoc?(opening)
+      # @type self: InterpolatedStringNode | InterpolatedXStringNode | StringNode | XStringNode
       opening&.start_with?("<<")
     end
   end
 
   class InterpolatedStringNode < Node
-    include HeredocQuery
+    # Returns true if this node was represented as a heredoc in the source code.
+    #--
+    #: () -> bool?
+    def heredoc?
+      HeredocQuery.heredoc?(opening)
+    end
   end
 
   class InterpolatedXStringNode < Node
-    include HeredocQuery
+    # Returns true if this node was represented as a heredoc in the source code.
+    #--
+    #: () -> bool?
+    def heredoc?
+      HeredocQuery.heredoc?(opening)
+    end
   end
 
   class StringNode < Node
-    include HeredocQuery
+    # Returns true if this node was represented as a heredoc in the source code.
+    #--
+    #: () -> bool?
+    def heredoc?
+      HeredocQuery.heredoc?(opening)
+    end
 
     # Occasionally it's helpful to treat a string as if it were interpolated so
     # that there's a consistent interface for working with strings.
+    #--
+    #: () -> InterpolatedStringNode
     def to_interpolated
       InterpolatedStringNode.new(
         source,
+        -1,
+        location,
         frozen? ? InterpolatedStringNodeFlags::FROZEN : 0,
         opening_loc,
-        [copy(opening_loc: nil, closing_loc: nil, location: content_loc)],
-        closing_loc,
-        location
+        [copy(location: content_loc, opening_loc: nil, closing_loc: nil)],
+        closing_loc
       )
     end
   end
 
   class XStringNode < Node
-    include HeredocQuery
+    # Returns true if this node was represented as a heredoc in the source code.
+    #--
+    #: () -> bool?
+    def heredoc?
+      HeredocQuery.heredoc?(opening)
+    end
 
     # Occasionally it's helpful to treat a string as if it were interpolated so
     # that there's a consistent interface for working with strings.
+    #--
+    #: () -> InterpolatedXStringNode
     def to_interpolated
       InterpolatedXStringNode.new(
         source,
+        -1,
+        location,
+        flags,
         opening_loc,
-        [StringNode.new(source, 0, nil, content_loc, nil, unescaped, content_loc)],
-        closing_loc,
-        location
+        [StringNode.new(source, node_id, content_loc, 0, nil, content_loc, nil, unescaped)],
+        closing_loc
       )
     end
   end
@@ -98,6 +162,8 @@ module Prism
 
   class ImaginaryNode < Node
     # Returns the value of the node as a Ruby Complex.
+    #--
+    #: () -> Complex
     def value
       Complex(0, numeric.value)
     end
@@ -105,31 +171,25 @@ module Prism
 
   class RationalNode < Node
     # Returns the value of the node as a Ruby Rational.
+    #--
+    #: () -> Rational
     def value
       Rational(numerator, denominator)
     end
-
-    # Returns the value of the node as an IntegerNode or a FloatNode. This
-    # method is deprecated in favor of #value or #numerator/#denominator.
-    def numeric
-      deprecated("value", "numerator", "denominator")
-
-      if denominator == 1
-        IntegerNode.new(source, flags, numerator, location.chop)
-      else
-        FloatNode.new(source, numerator.to_f / denominator, location.chop)
-      end
-    end
   end
 
   class ConstantReadNode < Node
     # Returns the list of parts for the full name of this constant.
     # For example: [:Foo]
+    #--
+    #: () -> Array[Symbol]
     def full_name_parts
       [name]
     end
 
     # Returns the full name of this constant. For example: "Foo"
+    #--
+    #: () -> String
     def full_name
       name.to_s
     end
@@ -138,11 +198,15 @@ module Prism
   class ConstantWriteNode < Node
     # Returns the list of parts for the full name of this constant.
     # For example: [:Foo]
+    #--
+    #: () -> Array[Symbol]
     def full_name_parts
       [name]
     end
 
     # Returns the full name of this constant. For example: "Foo"
+    #--
+    #: () -> String
     def full_name
       name.to_s
     end
@@ -157,13 +221,15 @@ module Prism
     # local variable
     class DynamicPartsInConstantPathError < StandardError; end
 
-    # An error class raised when missing nodes are found while computing a
+    # An error class raised when error recovery nodes are found while computing a
     # constant path's full name. For example:
     # Foo:: -> raises because the constant path is missing the last part
-    class MissingNodesInConstantPathError < StandardError; end
+    class ErrorRecoveryNodesInConstantPathError < StandardError; end
 
     # Returns the list of parts for the full name of this constant path.
     # For example: [:Foo, :Bar]
+    #--
+    #: () -> Array[Symbol]
     def full_name_parts
       parts = [] #: Array[Symbol]
       current = self #: node?
@@ -171,7 +237,7 @@ module Prism
       while current.is_a?(ConstantPathNode)
         name = current.name
         if name.nil?
-          raise MissingNodesInConstantPathError, "Constant path contains missing nodes. Cannot compute full name"
+          raise ErrorRecoveryNodesInConstantPathError, "Constant path contains error recovery nodes. Cannot compute full name"
         end
 
         parts.unshift(name)
@@ -186,25 +252,21 @@ module Prism
     end
 
     # Returns the full name of this constant path. For example: "Foo::Bar"
+    #--
+    #: () -> String
     def full_name
       full_name_parts.join("::")
     end
-
-    # Previously, we had a child node on this class that contained either a
-    # constant read or a missing node. To not cause a breaking change, we
-    # continue to supply that API.
-    def child
-      deprecated("name", "name_loc")
-      name ? ConstantReadNode.new(source, name, name_loc) : MissingNode.new(source, location)
-    end
   end
 
   class ConstantPathTargetNode < Node
     # Returns the list of parts for the full name of this constant path.
     # For example: [:Foo, :Bar]
+    #--
+    #: () -> Array[Symbol]
     def full_name_parts
       parts =
-        case parent
+        case (parent = self.parent)
         when ConstantPathNode, ConstantReadNode
           parent.full_name_parts
         when nil
@@ -214,35 +276,33 @@ module Prism
           raise ConstantPathNode::DynamicPartsInConstantPathError, "Constant target path contains dynamic parts. Cannot compute full name"
         end
 
-      if name.nil?
-        raise ConstantPathNode::MissingNodesInConstantPathError, "Constant target path contains missing nodes. Cannot compute full name"
+      if (name = self.name).nil?
+        raise ConstantPathNode::ErrorRecoveryNodesInConstantPathError, "Constant target path contains error recovery nodes. Cannot compute full name"
       end
 
       parts.push(name)
     end
 
     # Returns the full name of this constant path. For example: "Foo::Bar"
+    #--
+    #: () -> String
     def full_name
       full_name_parts.join("::")
     end
-
-    # Previously, we had a child node on this class that contained either a
-    # constant read or a missing node. To not cause a breaking change, we
-    # continue to supply that API.
-    def child
-      deprecated("name", "name_loc")
-      name ? ConstantReadNode.new(source, name, name_loc) : MissingNode.new(source, location)
-    end
   end
 
   class ConstantTargetNode < Node
     # Returns the list of parts for the full name of this constant.
     # For example: [:Foo]
+    #--
+    #: () -> Array[Symbol]
     def full_name_parts
       [name]
     end
 
     # Returns the full name of this constant. For example: "Foo"
+    #--
+    #: () -> String
     def full_name
       name.to_s
     end
@@ -250,6 +310,8 @@ module Prism
 
   class ParametersNode < Node
     # Mirrors the Method#parameters method.
+    #--
+    #: () -> Array[[Symbol, Symbol] | [Symbol]]
     def signature
       names = [] #: Array[[Symbol, Symbol] | [Symbol]]
 
@@ -259,7 +321,7 @@ module Prism
 
       optionals.each { |param| names << [:opt, param.name] }
 
-      if rest && rest.is_a?(RestParameterNode)
+      if (rest = self.rest).is_a?(RestParameterNode)
         names << [:rest, rest.name || :*]
       end
 
@@ -267,8 +329,7 @@ module Prism
         case param
         when MultiTargetNode
           names << [:req]
-        when NoKeywordsParameterNode, KeywordRestParameterNode, ForwardingParameterNode
-          # Invalid syntax, e.g. "def f(**nil, ...)" moves the NoKeywordsParameterNode to posts
+        when ErrorRecoveryNode
           raise "Invalid syntax"
         else
           names << [:req, param.name]
@@ -288,7 +349,7 @@ module Prism
 
       keyopt.each { |param| names << [:key, param.name] }
 
-      case keyword_rest
+      case (keyword_rest = self.keyword_rest)
       when ForwardingParameterNode
         names.concat([[:rest, :*], [:keyrest, :**], [:block, :&]])
       when KeywordRestParameterNode
@@ -297,7 +358,13 @@ module Prism
         names << [:nokey]
       end
 
-      names << [:block, block.name || :&] if block
+      case (block = self.block)
+      when BlockParameterNode
+        names << [:block, block.name || :&]
+      when NoBlockParameterNode
+        names << [:noblock]
+      end
+
       names
     end
   end
@@ -312,136 +379,10 @@ module Prism
     # can be any amount of space between the message and the = sign. However,
     # sometimes you want the location of the full message including the inner
     # space and the = sign. This method provides that.
+    #--
+    #: () -> Location?
     def full_message_loc
       attribute_write? ? message_loc&.adjoin("=") : message_loc
     end
   end
-
-  class CallOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class ClassVariableOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class ConstantOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class ConstantPathOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class GlobalVariableOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class IndexOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class InstanceVariableOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
-
-  class LocalVariableOperatorWriteNode < Node
-    # Returns the binary operator used to modify the receiver. This method is
-    # deprecated in favor of #binary_operator.
-    def operator
-      deprecated("binary_operator")
-      binary_operator
-    end
-
-    # Returns the location of the binary operator used to modify the receiver.
-    # This method is deprecated in favor of #binary_operator_loc.
-    def operator_loc
-      deprecated("binary_operator_loc")
-      binary_operator_loc
-    end
-  end
 end
diff --git a/lib/prism/node_find.rb b/lib/prism/node_find.rb
new file mode 100644
index 0000000000..697ee430e8
--- /dev/null
+++ b/lib/prism/node_find.rb
@@ -0,0 +1,185 @@
+# frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
+
+module Prism
+  # Finds the Prism AST node corresponding to a given Method, UnboundMethod,
+  # Proc, or Thread::Backtrace::Location. On CRuby, uses node_id from the
+  # instruction sequence for an exact match. On other implementations, falls
+  # back to best-effort matching by source location line number.
+  #
+  # This module is autoloaded so that programs that don't use Prism.find don't
+  # pay for its definition.
+  module NodeFind # :nodoc:
+    # Find the node for the given callable or backtrace location.
+    #--
+    #: (Method | UnboundMethod | Proc | Thread::Backtrace::Location callable, bool rubyvm) -> Node?
+    def self.find(callable, rubyvm)
+      case callable
+      when Proc
+        if rubyvm
+          RubyVMCallableFind.new.find(callable)
+        elsif callable.lambda?
+          LineLambdaFind.new.find(callable)
+        else
+          LineProcFind.new.find(callable)
+        end
+      when Method, UnboundMethod
+        if rubyvm
+          RubyVMCallableFind.new.find(callable)
+        else
+          LineMethodFind.new.find(callable)
+        end
+      when Thread::Backtrace::Location
+        if rubyvm
+          RubyVMBacktraceLocationFind.new.find(callable)
+        else
+          LineBacktraceLocationFind.new.find(callable)
+        end
+      else
+        raise ArgumentError, "Expected a Method, UnboundMethod, Proc, or Thread::Backtrace::Location, got #{callable.class}"
+      end
+    end
+
+    # Base class that handles parsing a file.
+    class Find
+      private
+
+      # Parse the given file path, returning a ParseResult or nil.
+      #--
+      #: (String? file) -> ParseResult?
+      def parse_file(file)
+        return unless file && File.readable?(file)
+        result = Prism.parse_file(file)
+        result if result.success?
+      end
+    end
+
+    # Finds the AST node for a Method, UnboundMethod, or Proc using the node_id
+    # from the instruction sequence.
+    class RubyVMCallableFind < Find
+      # Find the node for the given callable using the ISeq node_id.
+      #--
+      #: (Method | UnboundMethod | Proc callable) -> Node?
+      def find(callable)
+        return unless (source_location = callable.source_location)
+        return unless (result = parse_file(source_location[0]))
+        return unless (iseq = RubyVM::InstructionSequence.of(callable))
+
+        header = iseq.to_a[4]
+        return unless header[:parser] == :prism
+
+        result.value.find { |node| node.node_id == header[:node_id] }
+      end
+    end
+
+    # Finds the AST node for a Thread::Backtrace::Location using the node_id
+    # from the backtrace location.
+    class RubyVMBacktraceLocationFind < Find
+      # Find the node for the given backtrace location using node_id.
+      #--
+      #: (Thread::Backtrace::Location location) -> Node?
+      def find(location)
+        file = location.absolute_path || location.path
+        return unless (result = parse_file(file))
+        return unless RubyVM::AbstractSyntaxTree.respond_to?(:node_id_for_backtrace_location)
+
+        node_id = RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(location)
+
+        result.value.find { |node| node.node_id == node_id }
+      end
+    end
+
+    # Finds the AST node for a Method or UnboundMethod using best-effort line
+    # matching. Used on non-CRuby implementations.
+    class LineMethodFind < Find
+      # Find the node for the given method by matching on name and line.
+      #--
+      #: (Method | UnboundMethod callable) -> Node?
+      def find(callable)
+        return unless (source_location = callable.source_location)
+        return unless (result = parse_file(source_location[0]))
+
+        name = callable.name
+        start_line = source_location[1]
+
+        result.value.find do |node|
+          case node
+          when DefNode
+            node.name == name && node.location.start_line == start_line
+          when CallNode
+            node.block.is_a?(BlockNode) && node.location.start_line == start_line
+          else
+            false
+          end
+        end
+      end
+    end
+
+    # Finds the AST node for a lambda using best-effort line matching. Used
+    # on non-CRuby implementations.
+    class LineLambdaFind < Find
+      # Find the node for the given lambda by matching on line.
+      #--
+      #: (Proc callable) -> Node?
+      def find(callable)
+        return unless (source_location = callable.source_location)
+        return unless (result = parse_file(source_location[0]))
+
+        start_line = source_location[1]
+
+        result.value.find do |node|
+          case node
+          when LambdaNode
+            node.location.start_line == start_line
+          when CallNode
+            node.block.is_a?(BlockNode) && node.location.start_line == start_line
+          else
+            false
+          end
+        end
+      end
+    end
+
+    # Finds the AST node for a non-lambda Proc using best-effort line
+    # matching. Used on non-CRuby implementations.
+    class LineProcFind < Find
+      # Find the node for the given proc by matching on line.
+      #--
+      #: (Proc callable) -> Node?
+      def find(callable)
+        return unless (source_location = callable.source_location)
+        return unless (result = parse_file(source_location[0]))
+
+        start_line = source_location[1]
+
+        result.value.find do |node|
+          case node
+          when ForNode
+            node.location.start_line == start_line
+          when CallNode
+            node.block.is_a?(BlockNode) && node.location.start_line == start_line
+          else
+            false
+          end
+        end
+      end
+    end
+
+    # Finds the AST node for a Thread::Backtrace::Location using best-effort
+    # line matching. Used on non-CRuby implementations.
+    class LineBacktraceLocationFind < Find
+      # Find the node for the given backtrace location by matching on line.
+      #--
+      #: (Thread::Backtrace::Location location) -> Node?
+      def find(location)
+        file = location.absolute_path || location.path
+        return unless (result = parse_file(file))
+
+        start_line = location.lineno
+        result.value.find { |node| node.location.start_line == start_line }
+      end
+    end
+  end
+end
diff --git a/lib/prism/pack.rb b/lib/prism/pack.rb
deleted file mode 100644
index c0de8ab8b7..0000000000
--- a/lib/prism/pack.rb
+++ /dev/null
@@ -1,228 +0,0 @@
-# frozen_string_literal: true
-# typed: ignore
-
-module Prism
-  # A parser for the pack template language.
-  module Pack
-    %i[
-      SPACE
-      COMMENT
-      INTEGER
-      UTF8
-      BER
-      FLOAT
-      STRING_SPACE_PADDED
-      STRING_NULL_PADDED
-      STRING_NULL_TERMINATED
-      STRING_MSB
-      STRING_LSB
-      STRING_HEX_HIGH
-      STRING_HEX_LOW
-      STRING_UU
-      STRING_MIME
-      STRING_BASE64
-      STRING_FIXED
-      STRING_POINTER
-      MOVE
-      BACK
-      NULL
-
-      UNSIGNED
-      SIGNED
-      SIGNED_NA
-
-      AGNOSTIC_ENDIAN
-      LITTLE_ENDIAN
-      BIG_ENDIAN
-      NATIVE_ENDIAN
-      ENDIAN_NA
-
-      SIZE_SHORT
-      SIZE_INT
-      SIZE_LONG
-      SIZE_LONG_LONG
-      SIZE_8
-      SIZE_16
-      SIZE_32
-      SIZE_64
-      SIZE_P
-      SIZE_NA
-
-      LENGTH_FIXED
-      LENGTH_MAX
-      LENGTH_RELATIVE
-      LENGTH_NA
-    ].each do |const|
-      const_set(const, const)
-    end
-
-    # A directive in the pack template language.
-    class Directive
-      # A symbol representing the version of Ruby.
-      attr_reader :version
-
-      # A symbol representing whether or not we are packing or unpacking.
-      attr_reader :variant
-
-      # A byteslice of the source string that this directive represents.
-      attr_reader :source
-
-      # The type of the directive.
-      attr_reader :type
-
-      # The type of signedness of the directive.
-      attr_reader :signed
-
-      # The type of endianness of the directive.
-      attr_reader :endian
-
-      # The size of the directive.
-      attr_reader :size
-
-      # The length type of this directive (used for integers).
-      attr_reader :length_type
-
-      # The length of this directive (used for integers).
-      attr_reader :length
-
-      # Initialize a new directive with the given values.
-      def initialize(version, variant, source, type, signed, endian, size, length_type, length)
-        @version = version
-        @variant = variant
-        @source = source
-        @type = type
-        @signed = signed
-        @endian = endian
-        @size = size
-        @length_type = length_type
-        @length = length
-      end
-
-      # The descriptions of the various types of endianness.
-      ENDIAN_DESCRIPTIONS = {
-        AGNOSTIC_ENDIAN: "agnostic",
-        LITTLE_ENDIAN: "little-endian (VAX)",
-        BIG_ENDIAN: "big-endian (network)",
-        NATIVE_ENDIAN: "native-endian",
-        ENDIAN_NA: "n/a"
-      }
-
-      # The descriptions of the various types of signedness.
-      SIGNED_DESCRIPTIONS = {
-        UNSIGNED: "unsigned",
-        SIGNED: "signed",
-        SIGNED_NA: "n/a"
-      }
-
-      # The descriptions of the various types of sizes.
-      SIZE_DESCRIPTIONS = {
-        SIZE_SHORT: "short",
-        SIZE_INT: "int-width",
-        SIZE_LONG: "long",
-        SIZE_LONG_LONG: "long long",
-        SIZE_8: "8-bit",
-        SIZE_16: "16-bit",
-        SIZE_32: "32-bit",
-        SIZE_64: "64-bit",
-        SIZE_P: "pointer-width"
-      }
-
-      # Provide a human-readable description of the directive.
-      def describe
-        case type
-        when SPACE
-          "whitespace"
-        when COMMENT
-          "comment"
-        when INTEGER
-          if size == SIZE_8
-            base = "#{SIGNED_DESCRIPTIONS[signed]} #{SIZE_DESCRIPTIONS[size]} integer"
-          else
-            base = "#{SIGNED_DESCRIPTIONS[signed]} #{SIZE_DESCRIPTIONS[size]} #{ENDIAN_DESCRIPTIONS[endian]} integer"
-          end
-          case length_type
-          when LENGTH_FIXED
-            if length > 1
-              base + ", x#{length}"
-            else
-              base
-            end
-          when LENGTH_MAX
-            base + ", as many as possible"
-          else
-            raise
-          end
-        when UTF8
-          "UTF-8 character"
-        when BER
-          "BER-compressed integer"
-        when FLOAT
-          "#{SIZE_DESCRIPTIONS[size]} #{ENDIAN_DESCRIPTIONS[endian]} float"
-        when STRING_SPACE_PADDED
-          "arbitrary binary string (space padded)"
-        when STRING_NULL_PADDED
-          "arbitrary binary string (null padded, count is width)"
-        when STRING_NULL_TERMINATED
-          "arbitrary binary string (null padded, count is width), except that null is added with *"
-        when STRING_MSB
-          "bit string (MSB first)"
-        when STRING_LSB
-          "bit string (LSB first)"
-        when STRING_HEX_HIGH
-          "hex string (high nibble first)"
-        when STRING_HEX_LOW
-          "hex string (low nibble first)"
-        when STRING_UU
-          "UU-encoded string"
-        when STRING_MIME
-          "quoted printable, MIME encoding"
-        when STRING_BASE64
-          "base64 encoded string"
-        when STRING_FIXED
-          "pointer to a structure (fixed-length string)"
-        when STRING_POINTER
-          "pointer to a null-terminated string"
-        when MOVE
-          "move to absolute position"
-        when BACK
-          "back up a byte"
-        when NULL
-          "null byte"
-        else
-          raise
-        end
-      end
-    end
-
-    # The result of parsing a pack template.
-    class Format
-      # A list of the directives in the template.
-      attr_reader :directives
-
-      # The encoding of the template.
-      attr_reader :encoding
-
-      # Create a new Format with the given directives and encoding.
-      def initialize(directives, encoding)
-        @directives = directives
-        @encoding = encoding
-      end
-
-      # Provide a human-readable description of the format.
-      def describe
-        source_width = directives.map { |d| d.source.inspect.length }.max
-        directive_lines = directives.map do |directive|
-          if directive.type == SPACE
-            source = directive.source.inspect
-          else
-            source = directive.source
-          end
-          # @type var source_width: Integer
-          "  #{source.ljust(source_width)}  #{directive.describe}"
-        end
-
-        (["Directives:"] + directive_lines + ["Encoding:", "  #{encoding}"]).join("\n")
-      end
-    end
-  end
-end
diff --git a/lib/prism/parse_result.rb b/lib/prism/parse_result.rb
index 798fde09e5..93d3c006b7 100644
--- a/lib/prism/parse_result.rb
+++ b/lib/prism/parse_result.rb
@@ -1,6 +1,16 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
+  # @rbs!
+  #    # An internal interface for a cache that can be used to compute code
+  #    # units from byte offsets.
+  #    interface _CodeUnitsCache
+  #      def []: (Integer byte_offset) -> Integer
+  #    end
+
   # This represents a source of Ruby code that has been parsed. It is used in
   # conjunction with locations to allow them to resolve line numbers and source
   # ranges.
@@ -9,72 +19,157 @@ module Prism
     # be used instead of `new` and it will return either a `Source` or a
     # specialized and more performant `ASCIISource` if no multibyte characters
     # are present in the source code.
-    def self.for(source, start_line = 1, offsets = [])
-      source.ascii_only? ? ASCIISource.new(source, start_line, offsets): new(source, start_line, offsets)
+    #
+    # Note that if you are calling this method manually, you will need to supply
+    # the start_line and offsets parameters. start_line is the line number that
+    # the source starts on, which is typically 1 but can be different if this
+    # source is a subset of a larger source or if this is an eval. offsets is an
+    # array of byte offsets for the start of each line in the source code, which
+    # can be calculated by iterating through the source code and recording the
+    # byte offset whenever a newline character is encountered.  The first
+    # element is always 0 to mark the first line.
+    #--
+    #: (String source, Integer start_line, Array[Integer] offsets) -> Source
+    def self.for(source, start_line, offsets)
+      if source.ascii_only?
+        ASCIISource.new(source, start_line, offsets)
+      elsif source.encoding == Encoding::BINARY
+        source.force_encoding(Encoding::UTF_8)
+
+        if source.valid_encoding?
+          new(source, start_line, offsets)
+        else
+          # This is an extremely niche use case where the file is marked as
+          # binary, contains multi-byte characters, and those characters are not
+          # valid UTF-8. In this case we'll mark it as binary and fall back to
+          # treating everything as a single-byte character. This _may_ cause
+          # problems when asking for code units, but it appears to be the
+          # cleanest solution at the moment.
+          source.force_encoding(Encoding::BINARY)
+          ASCIISource.new(source, start_line, offsets)
+        end
+      else
+        new(source, start_line, offsets)
+      end
     end
 
     # The source code that this source object represents.
-    attr_reader :source
+    attr_reader :source #: String
 
     # The line number where this source starts.
-    attr_reader :start_line
+    attr_reader :start_line #: Integer
+
+    # The list of newline byte offsets in the source code. When initialized from
+    # the C extension, this may be a packed binary string of uint32_t values
+    # that is lazily unpacked on first access.
+    #--
+    #: () -> Array[Integer]
+    def offsets
+      offsets = @offsets
+      return offsets if offsets.is_a?(Array)
+      @offsets = offsets.unpack("L*")
+    end
+
+    # Create a new source object with the given source code. The offsets
+    # parameter can be either an Array of Integer byte offsets or a packed
+    # binary string of uint32_t values (from the C extension).
+    #--
+    #: (String source, Integer start_line, Array[Integer] | String offsets) -> void
+    def initialize(source, start_line, offsets)
+      @source = source
+      @start_line = start_line
+      @offsets = offsets
+    end
 
-    # The list of newline byte offsets in the source code.
-    attr_reader :offsets
+    # Replace the value of start_line with the given value.
+    #--
+    #: (Integer start_line) -> void
+    def replace_start_line(start_line)
+      @start_line = start_line
+    end
 
-    # Create a new source object with the given source code.
-    def initialize(source, start_line = 1, offsets = [])
-      @source = source
-      @start_line = start_line # set after parsing is done
-      @offsets = offsets # set after parsing is done
+    # Replace the value of offsets with the given value.
+    #--
+    #: (Array[Integer] offsets) -> void
+    def replace_offsets(offsets)
+      @offsets = offsets
     end
 
     # Returns the encoding of the source code, which is set by parameters to the
     # parser or by the encoding magic comment.
+    #--
+    #: () -> Encoding
     def encoding
       source.encoding
     end
 
     # Returns the lines of the source code as an array of strings.
+    #--
+    #: () -> Array[String]
     def lines
       source.lines
     end
 
     # Perform a byteslice on the source code using the given byte offset and
     # byte length.
+    #--
+    #: (Integer byte_offset, Integer length) -> String
     def slice(byte_offset, length)
       source.byteslice(byte_offset, length) or raise
     end
 
+    # Converts the line number and column in bytes to a byte offset.
+    #--
+    #: (Integer line, Integer column) -> Integer
+    def byte_offset(line, column)
+      normal = line - @start_line
+      raise IndexError if normal < 0
+      offsets.fetch(normal) + column
+    rescue IndexError
+      raise ArgumentError, "line #{line} is out of range"
+    end
+
     # Binary search through the offsets to find the line number for the given
     # byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def line(byte_offset)
       start_line + find_line(byte_offset)
     end
 
     # Return the byte offset of the start of the line corresponding to the given
     # byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def line_start(byte_offset)
       offsets[find_line(byte_offset)]
     end
 
     # Returns the byte offset of the end of the line corresponding to the given
     # byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def line_end(byte_offset)
       offsets[find_line(byte_offset) + 1] || source.bytesize
     end
 
-    # Return the column number for the given byte offset.
+    # Return the column in bytes for the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def column(byte_offset)
       byte_offset - line_start(byte_offset)
     end
 
     # Return the character offset for the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def character_offset(byte_offset)
       (source.byteslice(0, byte_offset) or raise).length
     end
 
-    # Return the column number in characters for the given byte offset.
+    # Return the column in characters for the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def character_column(byte_offset)
       character_offset(byte_offset) - character_offset(line_start(byte_offset))
     end
@@ -85,51 +180,183 @@ module Prism
     # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the
     # concept of code units that differs from the number of characters in other
     # encodings, it is not captured here.
+    #
+    # We purposefully replace invalid and undefined characters with replacement
+    # characters in this conversion. This happens for two reasons. First, it's
+    # possible that the given byte offset will not occur on a character
+    # boundary. Second, it's possible that the source code will contain a
+    # character that has no equivalent in the given encoding.
+    #--
+    #: (Integer byte_offset, Encoding encoding) -> Integer
     def code_units_offset(byte_offset, encoding)
-      byteslice = (source.byteslice(0, byte_offset) or raise).encode(encoding)
-      (encoding == Encoding::UTF_16LE || encoding == Encoding::UTF_16BE) ? (byteslice.bytesize / 2) : byteslice.length
+      return byte_offset if encoding == Encoding::UTF_8
+
+      byteslice = (source.byteslice(0, byte_offset) or raise).encode(encoding, invalid: :replace, undef: :replace)
+
+      if encoding == Encoding::UTF_16LE || encoding == Encoding::UTF_16BE
+        byteslice.bytesize / 2
+      else
+        byteslice.length
+      end
     end
 
-    # Returns the column number in code units for the given encoding for the
+    # Generate a cache that targets a specific encoding for calculating code
+    # unit offsets.
+    #--
+    #: (Encoding encoding) -> CodeUnitsCache
+    def code_units_cache(encoding)
+      CodeUnitsCache.new(source, encoding)
+    end
+
+    # Returns the column in code units for the given encoding for the
     # given byte offset.
+    #--
+    #: (Integer byte_offset, Encoding encoding) -> Integer
     def code_units_column(byte_offset, encoding)
       code_units_offset(byte_offset, encoding) - code_units_offset(line_start(byte_offset), encoding)
     end
 
-    private
+    # Freeze this object and the objects it contains.
+    #--
+    #: () -> void
+    def deep_freeze
+      source.freeze
+      offsets.freeze
+      freeze
+    end
 
-    # Binary search through the offsets to find the line number for the given
+    # Binary search through the offsets to find the index for the given
     # byte offset.
-    def find_line(byte_offset)
-      left = 0
-      right = offsets.length - 1
+    #--
+    #: (Integer byte_offset) -> Integer
+    def find_line(byte_offset) # :nodoc:
+      index = offsets.bsearch_index { |offset| offset > byte_offset } || offsets.length
+      index - 1
+    end
+  end
+
+  # A cache that can be used to quickly compute code unit offsets from byte
+  # offsets. It purposefully provides only a single #[] method to access the
+  # cache in order to minimize surface area.
+  #
+  # Note that there are some known issues here that may or may not be addressed
+  # in the future:
+  #
+  # * The first is that there are issues when the cache computes values that are
+  #   not on character boundaries. This can result in subsequent computations
+  #   being off by one or more code units.
+  # * The second is that this cache is currently unbounded. In theory we could
+  #   introduce some kind of LRU cache to limit the number of entries, but this
+  #   has not yet been implemented.
+  #
+  class CodeUnitsCache
+    # Counter used for UTF-8, where one code unit equals one byte.
+    class UTF8Counter # :nodoc:
+      #: (Integer byte_offset, Integer byte_length) -> Integer
+      def count(byte_offset, byte_length)
+        byte_length
+      end
+    end
 
-      while left <= right
-        mid = left + (right - left) / 2
-        return mid if (offset = offsets[mid]) == byte_offset
+    class UTF16Counter # :nodoc:
+      # @rbs @source: String
+      # @rbs @encoding: Encoding
+
+      #: (String source, Encoding encoding) -> void
+      def initialize(source, encoding)
+        @source = source
+        @encoding = encoding
+      end
+
+      #: (Integer byte_offset, Integer byte_length) -> Integer
+      def count(byte_offset, byte_length)
+        (@source.byteslice(byte_offset, byte_length) or raise).encode(@encoding, invalid: :replace, undef: :replace).bytesize / 2
+      end
+    end
 
-        if offset < byte_offset
-          left = mid + 1
+    # Counter used for UTF-32, where one code unit equals one code point and
+    # matches String#length. Also used as a best-effort fallback for any other
+    # encoding that does not have a dedicated counter.
+    class UTF32Counter # :nodoc:
+      # @rbs @source: String
+      # @rbs @encoding: Encoding
+
+      #: (String source, Encoding encoding) -> void
+      def initialize(source, encoding)
+        @source = source
+        @encoding = encoding
+      end
+
+      #: (Integer byte_offset, Integer byte_length) -> Integer
+      def count(byte_offset, byte_length)
+        (@source.byteslice(byte_offset, byte_length) or raise).encode(@encoding, invalid: :replace, undef: :replace).length
+      end
+    end
+
+    private_constant :UTF8Counter, :UTF16Counter, :UTF32Counter
+
+    # @rbs @source: String
+    # @rbs @counter: UTF8Counter | UTF16Counter | UTF32Counter
+    # @rbs @cache: Hash[Integer, Integer]
+    # @rbs @offsets: Array[Integer]
+
+    # Initialize a new cache with the given source and encoding.
+    #--
+    #: (String source, Encoding encoding) -> void
+    def initialize(source, encoding)
+      @source = source
+      @counter =
+        case encoding
+        when Encoding::UTF_8
+          UTF8Counter.new
+        when Encoding::UTF_16LE, Encoding::UTF_16BE
+          UTF16Counter.new(source, encoding)
         else
-          right = mid - 1
+          UTF32Counter.new(source, encoding)
         end
-      end
 
-      left - 1
+      @cache = {} #: Hash[Integer, Integer]
+      @offsets = [] #: Array[Integer]
+    end
+
+    # Retrieve the code units offset from the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
+    def [](byte_offset)
+      @cache[byte_offset] ||=
+        if (index = @offsets.bsearch_index { |offset| offset > byte_offset }).nil?
+          @offsets << byte_offset
+          @counter.count(0, byte_offset)
+        elsif index == 0
+          @offsets.unshift(byte_offset)
+          @counter.count(0, byte_offset)
+        else
+          @offsets.insert(index, byte_offset)
+          offset = @offsets[index - 1]
+          @cache[offset] + @counter.count(offset, byte_offset - offset)
+        end
     end
   end
 
   # Specialized version of Prism::Source for source code that includes ASCII
   # characters only. This class is used to apply performance optimizations that
-  # cannot be applied to sources that include multibyte characters. Sources that
-  # include multibyte characters are represented by the Prism::Source class.
+  # cannot be applied to sources that include multibyte characters.
+  #
+  # In the extremely rare case that a source includes multi-byte characters but
+  # is marked as binary because of a magic encoding comment and it cannot be
+  # eagerly converted to UTF-8, this class will be used as well. This is because
+  # at that point we will treat everything as single-byte characters.
   class ASCIISource < Source
     # Return the character offset for the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def character_offset(byte_offset)
       byte_offset
     end
 
-    # Return the column number in characters for the given byte offset.
+    # Return the column in characters for the given byte offset.
+    #--
+    #: (Integer byte_offset) -> Integer
     def character_column(byte_offset)
       byte_offset - line_start(byte_offset)
     end
@@ -140,13 +367,26 @@ module Prism
     # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the
     # concept of code units that differs from the number of characters in other
     # encodings, it is not captured here.
+    #--
+    #: (Integer byte_offset, Encoding encoding) -> Integer
     def code_units_offset(byte_offset, encoding)
       byte_offset
     end
 
+    # Returns a cache that is the identity function in order to maintain the
+    # same interface. We can do this because code units are always equivalent to
+    # byte offsets for ASCII-only sources.
+    #--
+    #: (Encoding encoding) -> _CodeUnitsCache
+    def code_units_cache(encoding)
+      ->(byte_offset) { byte_offset }
+    end
+
     # Specialized version of `code_units_column` that does not depend on
     # `code_units_offset`, which is a more expensive operation. This is
-    # essentialy the same as `Prism::Source#column`.
+    # essentially the same as `Prism::Source#column`.
+    #--
+    #: (Integer byte_offset, Encoding encoding) -> Integer
     def code_units_column(byte_offset, encoding)
       byte_offset - line_start(byte_offset)
     end
@@ -156,18 +396,23 @@ module Prism
   class Location
     # A Source object that is used to determine more information from the given
     # offset and length.
-    attr_reader :source
+    attr_reader :source #: Source
     protected :source
 
     # The byte offset from the beginning of the source where this location
     # starts.
-    attr_reader :start_offset
+    attr_reader :start_offset #: Integer
 
     # The length of this location in bytes.
-    attr_reader :length
+    attr_reader :length #: Integer
+
+    # @rbs @leading_comments: Array[Comment]?
+    # @rbs @trailing_comments: Array[Comment]?
 
     # Create a new location object with the given source, start byte offset, and
     # byte length.
+    #--
+    #: (Source source, Integer start_offset, Integer length) -> void
     def initialize(source, start_offset, length)
       @source = source
       @start_offset = start_offset
@@ -182,53 +427,73 @@ module Prism
 
     # These are the comments that are associated with this location that exist
     # before the start of this location.
+    #--
+    #: () -> Array[Comment]
     def leading_comments
       @leading_comments ||= []
     end
 
     # Attach a comment to the leading comments of this location.
+    #--
+    #: (Comment comment) -> void
     def leading_comment(comment)
       leading_comments << comment
     end
 
     # These are the comments that are associated with this location that exist
     # after the end of this location.
+    #--
+    #: () -> Array[Comment]
     def trailing_comments
       @trailing_comments ||= []
     end
 
     # Attach a comment to the trailing comments of this location.
+    #--
+    #: (Comment comment) -> void
     def trailing_comment(comment)
       trailing_comments << comment
     end
 
     # Returns all comments that are associated with this location (both leading
     # and trailing comments).
+    #--
+    #: () -> Array[Comment]
     def comments
-      [*@leading_comments, *@trailing_comments]
+      [*@leading_comments, *@trailing_comments] #: Array[Comment]
     end
 
     # Create a new location object with the given options.
+    #--
+    #: (?source: Source, ?start_offset: Integer, ?length: Integer) -> Location
     def copy(source: self.source, start_offset: self.start_offset, length: self.length)
       Location.new(source, start_offset, length)
     end
 
     # Returns a new location that is the result of chopping off the last byte.
+    #--
+    #: () -> Location
     def chop
       copy(length: length == 0 ? length : length - 1)
     end
 
     # Returns a string representation of this location.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::Location @start_offset=#{@start_offset} @length=#{@length} start_line=#{start_line}>"
     end
 
     # Returns all of the lines of the source code associated with this location.
+    #--
+    #: () -> Array[String]
     def source_lines
       source.lines
     end
 
     # The source code that this location represents.
+    #--
+    #: () -> String
     def slice
       source.slice(start_offset, length)
     end
@@ -236,6 +501,8 @@ module Prism
     # The source code that this location represents starting from the beginning
     # of the line that this location starts on to the end of the line that this
     # location ends on.
+    #--
+    #: () -> String
     def slice_lines
       line_start = source.line_start(start_offset)
       line_end = source.line_end(end_offset)
@@ -244,94 +511,160 @@ module Prism
 
     # The character offset from the beginning of the source where this location
     # starts.
+    #--
+    #: () -> Integer
     def start_character_offset
       source.character_offset(start_offset)
     end
 
     # The offset from the start of the file in code units of the given encoding.
+    #--
+    #: (Encoding encoding) -> Integer
     def start_code_units_offset(encoding = Encoding::UTF_16LE)
       source.code_units_offset(start_offset, encoding)
     end
 
+    # The start offset from the start of the file in code units using the given
+    # cache to fetch or calculate the value.
+    #--
+    #: (_CodeUnitsCache cache) -> Integer
+    def cached_start_code_units_offset(cache)
+      cache[start_offset]
+    end
+
     # The byte offset from the beginning of the source where this location ends.
+    #--
+    #: () -> Integer
     def end_offset
       start_offset + length
     end
 
     # The character offset from the beginning of the source where this location
     # ends.
+    #--
+    #: () -> Integer
     def end_character_offset
       source.character_offset(end_offset)
     end
 
     # The offset from the start of the file in code units of the given encoding.
+    #--
+    #: (Encoding encoding) -> Integer
     def end_code_units_offset(encoding = Encoding::UTF_16LE)
       source.code_units_offset(end_offset, encoding)
     end
 
+    # The end offset from the start of the file in code units using the given
+    # cache to fetch or calculate the value.
+    #--
+    #: (_CodeUnitsCache cache) -> Integer
+    def cached_end_code_units_offset(cache)
+      cache[end_offset]
+    end
+
     # The line number where this location starts.
+    #--
+    #: () -> Integer
     def start_line
       source.line(start_offset)
     end
 
     # The content of the line where this location starts before this location.
+    #--
+    #: () -> String
     def start_line_slice
       offset = source.line_start(start_offset)
       source.slice(offset, start_offset - offset)
     end
 
     # The line number where this location ends.
+    #--
+    #: () -> Integer
     def end_line
       source.line(end_offset)
     end
 
-    # The column number in bytes where this location starts from the start of
+    # The column in bytes where this location starts from the start of
     # the line.
+    #--
+    #: () -> Integer
     def start_column
       source.column(start_offset)
     end
 
-    # The column number in characters where this location ends from the start of
+    # The column in characters where this location ends from the start of
     # the line.
+    #--
+    #: () -> Integer
     def start_character_column
       source.character_column(start_offset)
     end
 
-    # The column number in code units of the given encoding where this location
+    # The column in code units of the given encoding where this location
     # starts from the start of the line.
+    #--
+    #: (?Encoding encoding) -> Integer
     def start_code_units_column(encoding = Encoding::UTF_16LE)
       source.code_units_column(start_offset, encoding)
     end
 
-    # The column number in bytes where this location ends from the start of the
+    # The start column in code units using the given cache to fetch or calculate
+    # the value.
+    #--
+    #: (_CodeUnitsCache cache) -> Integer
+    def cached_start_code_units_column(cache)
+      cache[start_offset] - cache[source.line_start(start_offset)]
+    end
+
+    # The column in bytes where this location ends from the start of the
     # line.
+    #--
+    #: () -> Integer
     def end_column
       source.column(end_offset)
     end
 
-    # The column number in characters where this location ends from the start of
+    # The column in characters where this location ends from the start of
     # the line.
+    #--
+    #: () -> Integer
     def end_character_column
       source.character_column(end_offset)
     end
 
-    # The column number in code units of the given encoding where this location
+    # The column in code units of the given encoding where this location
     # ends from the start of the line.
+    #--
+    #: (?Encoding encoding) -> Integer
     def end_code_units_column(encoding = Encoding::UTF_16LE)
       source.code_units_column(end_offset, encoding)
     end
 
+    # The end column in code units using the given cache to fetch or calculate
+    # the value.
+    #--
+    #: (_CodeUnitsCache cache) -> Integer
+    def cached_end_code_units_column(cache)
+      cache[end_offset] - cache[source.line_start(end_offset)]
+    end
+
     # Implement the hash pattern matching interface for Location.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { start_offset: start_offset, end_offset: end_offset }
     end
 
     # Implement the pretty print interface for Location.
-    def pretty_print(q)
+    #--
+    #: (PP q) -> void
+    def pretty_print(q) # :nodoc:
       q.text("(#{start_line},#{start_column})-(#{end_line},#{end_column})")
     end
 
     # Returns true if the given other location is equal to this location.
+    #--
+    #: (untyped other) -> bool
     def ==(other)
       Location === other &&
         other.start_offset == start_offset &&
@@ -341,6 +674,8 @@ module Prism
     # Returns a new location that stretches from this location to the given
     # other location. Raises an error if this location is not before the other
     # location or if they don't share the same source.
+    #--
+    #: (Location other) -> Location
     def join(other)
       raise "Incompatible sources" if source != other.source
       raise "Incompatible locations" if start_offset > other.start_offset
@@ -351,6 +686,8 @@ module Prism
     # Join this location with the first occurrence of the string in the source
     # that occurs after this location on the same line, and return the new
     # location. This will raise an error if the string does not exist.
+    #--
+    #: (String string) -> Location
     def adjoin(string)
       line_suffix = source.slice(end_offset, source.line_end(end_offset) - end_offset)
 
@@ -364,23 +701,38 @@ module Prism
   # This represents a comment that was encountered during parsing. It is the
   # base class for all comment types.
   class Comment
-    # The location of this comment in the source.
-    attr_reader :location
+    # The Location of this comment in the source.
+    attr_reader :location #: Location
 
     # Create a new comment object with the given location.
+    #--
+    #: (Location location) -> void
     def initialize(location)
       @location = location
     end
 
     # Implement the hash pattern matching interface for Comment.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { location: location }
     end
 
     # Returns the content of the comment by slicing it from the source code.
+    #--
+    #: () -> String
     def slice
       location.slice
     end
+
+    # Returns true if this comment happens on the same line as other code and
+    # false if the comment is by itself. This can only be true for inline
+    # comments and should be false for block comments.
+    #--
+    #: () -> bool
+    def trailing?
+      raise NotImplementedError, "trailing? is not implemented for #{self.class}"
+    end
   end
 
   # InlineComment objects are the most common. They correspond to comments in
@@ -388,12 +740,16 @@ module Prism
   class InlineComment < Comment
     # Returns true if this comment happens on the same line as other code and
     # false if the comment is by itself.
+    #--
+    #: () -> bool
     def trailing?
       !location.start_line_slice.strip.empty?
     end
 
     # Returns a string representation of this comment.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::InlineComment @location=#{location.inspect}>"
     end
   end
@@ -401,13 +757,17 @@ module Prism
   # EmbDocComment objects correspond to comments that are surrounded by =begin
   # and =end.
   class EmbDocComment < Comment
-    # This can only be true for inline comments.
+    # Returns false. This can only be true for inline comments.
+    #--
+    #: () -> bool
     def trailing?
       false
     end
 
     # Returns a string representation of this comment.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::EmbDocComment @location=#{location.inspect}>"
     end
   end
@@ -415,34 +775,44 @@ module Prism
   # This represents a magic comment that was encountered during parsing.
   class MagicComment
     # A Location object representing the location of the key in the source.
-    attr_reader :key_loc
+    attr_reader :key_loc #: Location
 
     # A Location object representing the location of the value in the source.
-    attr_reader :value_loc
+    attr_reader :value_loc #: Location
 
     # Create a new magic comment object with the given key and value locations.
+    #--
+    #: (Location key_loc, Location value_loc) -> void
     def initialize(key_loc, value_loc)
       @key_loc = key_loc
       @value_loc = value_loc
     end
 
     # Returns the key of the magic comment by slicing it from the source code.
+    #--
+    #: () -> String
     def key
       key_loc.slice
     end
 
     # Returns the value of the magic comment by slicing it from the source code.
+    #--
+    #: () -> String
     def value
       value_loc.slice
     end
 
     # Implement the hash pattern matching interface for MagicComment.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { key_loc: key_loc, value_loc: value_loc }
     end
 
     # Returns a string representation of this magic comment.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::MagicComment @key=#{key.inspect} @value=#{value.inspect}>"
     end
   end
@@ -451,18 +821,20 @@ module Prism
   class ParseError
     # The type of error. This is an _internal_ symbol that is used for
     # communicating with translation layers. It is not meant to be public API.
-    attr_reader :type
+    attr_reader :type #: Symbol
 
     # The message associated with this error.
-    attr_reader :message
+    attr_reader :message #: String
 
     # A Location object representing the location of this error in the source.
-    attr_reader :location
+    attr_reader :location #: Location
 
     # The level of this error.
-    attr_reader :level
+    attr_reader :level #: Symbol
 
     # Create a new error object with the given message and location.
+    #--
+    #: (Symbol type, String message, Location location, Symbol level) -> void
     def initialize(type, message, location, level)
       @type = type
       @message = message
@@ -471,12 +843,16 @@ module Prism
     end
 
     # Implement the hash pattern matching interface for ParseError.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { type: type, message: message, location: location, level: level }
     end
 
     # Returns a string representation of this error.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::ParseError @type=#{@type.inspect} @message=#{@message.inspect} @location=#{@location.inspect} @level=#{@level.inspect}>"
     end
   end
@@ -485,18 +861,20 @@ module Prism
   class ParseWarning
     # The type of warning. This is an _internal_ symbol that is used for
     # communicating with translation layers. It is not meant to be public API.
-    attr_reader :type
+    attr_reader :type #: Symbol
 
     # The message associated with this warning.
-    attr_reader :message
+    attr_reader :message #: String
 
     # A Location object representing the location of this warning in the source.
-    attr_reader :location
+    attr_reader :location #: Location
 
     # The level of this warning.
-    attr_reader :level
+    attr_reader :level #: Symbol
 
     # Create a new warning object with the given message and location.
+    #--
+    #: (Symbol type, String message, Location location, Symbol level) -> void
     def initialize(type, message, location, level)
       @type = type
       @message = message
@@ -505,120 +883,190 @@ module Prism
     end
 
     # Implement the hash pattern matching interface for ParseWarning.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { type: type, message: message, location: location, level: level }
     end
 
     # Returns a string representation of this warning.
-    def inspect
+    #--
+    #: () -> String
+    def inspect # :nodoc:
       "#<Prism::ParseWarning @type=#{@type.inspect} @message=#{@message.inspect} @location=#{@location.inspect} @level=#{@level.inspect}>"
     end
   end
 
-  # This represents the result of a call to ::parse or ::parse_file. It contains
-  # the requested structure, any comments that were encounters, and any errors
-  # that were encountered.
+  # This represents the result of a call to Prism.parse or Prism.parse_file.
+  # It contains the requested structure, any comments that were encounters,
+  # and any errors that were encountered.
   class Result
     # The list of comments that were encountered during parsing.
-    attr_reader :comments
+    attr_reader :comments #: Array[Comment]
 
     # The list of magic comments that were encountered during parsing.
-    attr_reader :magic_comments
+    attr_reader :magic_comments #: Array[MagicComment]
 
     # An optional location that represents the location of the __END__ marker
     # and the rest of the content of the file. This content is loaded into the
     # DATA constant when the file being parsed is the main file being executed.
-    attr_reader :data_loc
+    attr_reader :data_loc #: Location?
 
     # The list of errors that were generated during parsing.
-    attr_reader :errors
+    attr_reader :errors #: Array[ParseError]
 
     # The list of warnings that were generated during parsing.
-    attr_reader :warnings
+    attr_reader :warnings #: Array[ParseWarning]
 
     # A Source instance that represents the source code that was parsed.
-    attr_reader :source
+    attr_reader :source #: Source
 
     # Create a new result object with the given values.
-    def initialize(comments, magic_comments, data_loc, errors, warnings, source)
+    #--
+    #: (Array[Comment] comments, Array[MagicComment] magic_comments, Location? data_loc, Array[ParseError] errors, Array[ParseWarning] warnings, bool continuable, Source source) -> void
+    def initialize(comments, magic_comments, data_loc, errors, warnings, continuable, source)
       @comments = comments
       @magic_comments = magic_comments
       @data_loc = data_loc
       @errors = errors
       @warnings = warnings
+      @continuable = continuable
       @source = source
     end
 
     # Implement the hash pattern matching interface for Result.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { comments: comments, magic_comments: magic_comments, data_loc: data_loc, errors: errors, warnings: warnings }
     end
 
     # Returns the encoding of the source code that was parsed.
+    #--
+    #: () -> Encoding
     def encoding
       source.encoding
     end
 
     # Returns true if there were no errors during parsing and false if there
     # were.
+    #--
+    #: () -> bool
     def success?
       errors.empty?
     end
 
     # Returns true if there were errors during parsing and false if there were
     # not.
+    #--
+    #: () -> bool
     def failure?
       !success?
     end
+
+    # Returns true if the parsed source is an incomplete expression that could
+    # become valid with additional input. This is useful for REPL contexts (such
+    # as IRB) where the user may be entering a multi-line expression one line at
+    # a time and the implementation needs to determine whether to wait for more
+    # input or to evaluate what has been entered so far.
+    #
+    # Concretely, this returns true when every error present is caused by the
+    # parser reaching the end of the input before a construct was closed (e.g.
+    # an unclosed string, array, block, or keyword), and returns false when any
+    # error is caused by a token that makes the input structurally invalid
+    # regardless of what might follow (e.g. a stray `end`, `]`, or `)` with no
+    # matching opener).
+    #
+    # Examples:
+    #
+    #     Prism.parse("1 + [").continuable?      #=> true  (unclosed array)
+    #     Prism.parse("1 + ]").continuable?      #=> false (stray ])
+    #     Prism.parse("tap do").continuable?     #=> true  (unclosed block)
+    #     Prism.parse("end.tap do").continuable? #=> false (stray end)
+    #
+    #--
+    #: () -> bool
+    def continuable?
+      @continuable
+    end
+
+    # Create a code units cache for the given encoding.
+    #--
+    #: (Encoding encoding) -> _CodeUnitsCache
+    def code_units_cache(encoding)
+      source.code_units_cache(encoding)
+    end
   end
 
   # This is a result specific to the `parse` and `parse_file` methods.
   class ParseResult < Result
     autoload :Comments, "prism/parse_result/comments"
+    autoload :Errors, "prism/parse_result/errors"
     autoload :Newlines, "prism/parse_result/newlines"
 
     private_constant :Comments
+    private_constant :Errors
     private_constant :Newlines
 
     # The syntax tree that was parsed from the source code.
-    attr_reader :value
+    attr_reader :value #: ProgramNode
 
     # Create a new parse result object with the given values.
-    def initialize(value, comments, magic_comments, data_loc, errors, warnings, source)
+    #--
+    #: (ProgramNode value, Array[Comment] comments, Array[MagicComment] magic_comments, Location? data_loc, Array[ParseError] errors, Array[ParseWarning] warnings, bool continuable, Source source) -> void
+    def initialize(value, comments, magic_comments, data_loc, errors, warnings, continuable, source)
       @value = value
-      super(comments, magic_comments, data_loc, errors, warnings, source)
+      super(comments, magic_comments, data_loc, errors, warnings, continuable, source)
     end
 
     # Implement the hash pattern matching interface for ParseResult.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       super.merge!(value: value)
     end
 
     # Attach the list of comments to their respective locations in the tree.
+    #--
+    #: () -> void
     def attach_comments!
       Comments.new(self).attach! # steep:ignore
     end
 
     # Walk the tree and mark nodes that are on a new line, loosely emulating
     # the behavior of CRuby's `:line` tracepoint event.
+    #--
+    #: () -> void
     def mark_newlines!
       value.accept(Newlines.new(source.offsets.size)) # steep:ignore
     end
+
+    # Returns a string representation of the syntax tree with the errors
+    # displayed inline.
+    #--
+    #: () -> String
+    def errors_format
+      Errors.new(self).format
+    end
   end
 
   # This is a result specific to the `lex` and `lex_file` methods.
   class LexResult < Result
     # The list of tokens that were parsed from the source code.
-    attr_reader :value
+    attr_reader :value #: Array[[Token, Integer]]
 
     # Create a new lex result object with the given values.
-    def initialize(value, comments, magic_comments, data_loc, errors, warnings, source)
+    #--
+    #: (Array[[Token, Integer]] value, Array[Comment] comments, Array[MagicComment] magic_comments, Location? data_loc, Array[ParseError] errors, Array[ParseWarning] warnings, bool continuable, Source source) -> void
+    def initialize(value, comments, magic_comments, data_loc, errors, warnings, continuable, source)
       @value = value
-      super(comments, magic_comments, data_loc, errors, warnings, source)
+      super(comments, magic_comments, data_loc, errors, warnings, continuable, source)
     end
 
     # Implement the hash pattern matching interface for LexResult.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       super.merge!(value: value)
     end
   end
@@ -627,16 +1075,20 @@ module Prism
   class ParseLexResult < Result
     # A tuple of the syntax tree and the list of tokens that were parsed from
     # the source code.
-    attr_reader :value
+    attr_reader :value #: [ProgramNode, Array[[Token, Integer]]]
 
     # Create a new parse lex result object with the given values.
-    def initialize(value, comments, magic_comments, data_loc, errors, warnings, source)
+    #--
+    #: ([ProgramNode, Array[[Token, Integer]]] value, Array[Comment] comments, Array[MagicComment] magic_comments, Location? data_loc, Array[ParseError] errors, Array[ParseWarning] warnings, bool continuable, Source source) -> void
+    def initialize(value, comments, magic_comments, data_loc, errors, warnings, continuable, source)
       @value = value
-      super(comments, magic_comments, data_loc, errors, warnings, source)
+      super(comments, magic_comments, data_loc, errors, warnings, continuable, source)
     end
 
     # Implement the hash pattern matching interface for ParseLexResult.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       super.merge!(value: value)
     end
   end
@@ -644,16 +1096,20 @@ module Prism
   # This represents a token from the Ruby source.
   class Token
     # The Source object that represents the source this token came from.
-    attr_reader :source
+    attr_reader :source #: Source
     private :source
 
     # The type of token that this token is.
-    attr_reader :type
+    attr_reader :type #: Symbol
 
     # A byteslice of the source that this token represents.
-    attr_reader :value
+    attr_reader :value #: String
+
+    # @rbs @location: Location | Integer
 
     # Create a new token object with the given type, value, and location.
+    #--
+    #: (Source source, Symbol type, String value, Location | Integer location) -> void
     def initialize(source, type, value, location)
       @source = source
       @type = type
@@ -662,11 +1118,15 @@ module Prism
     end
 
     # Implement the hash pattern matching interface for Token.
-    def deconstruct_keys(keys)
+    #--
+    #: (Array[Symbol]? keys) -> Hash[Symbol, untyped]
+    def deconstruct_keys(keys) # :nodoc:
       { type: type, value: value, location: location }
     end
 
     # A Location object representing the location of this token in the source.
+    #--
+    #: () -> Location
     def location
       location = @location
       return location if location.is_a?(Location)
@@ -674,7 +1134,9 @@ module Prism
     end
 
     # Implement the pretty print interface for Token.
-    def pretty_print(q)
+    #--
+    #: (PP q) -> void
+    def pretty_print(q) # :nodoc:
       q.group do
         q.text(type.to_s)
         self.location.pretty_print(q)
@@ -689,10 +1151,61 @@ module Prism
     end
 
     # Returns true if the given other token is equal to this token.
+    #--
+    #: (untyped other) -> bool
     def ==(other)
       Token === other &&
         other.type == type &&
         other.value == value
     end
+
+    # Returns a string representation of this token.
+    #--
+    #: () -> String
+    def inspect # :nodoc:
+      location
+      super
+    end
+
+    # Freeze this object and the objects it contains.
+    #--
+    #: () -> void
+    def deep_freeze
+      value.freeze
+      location.freeze
+      freeze
+    end
+  end
+
+  # This object is passed to the various Prism.* methods that accept the
+  # `scopes` option as an element of the list. It defines both the local
+  # variables visible at that scope as well as the forwarding parameters
+  # available at that scope.
+  class Scope
+    # The list of local variables that are defined in this scope. This should be
+    # defined as an array of symbols.
+    attr_reader :locals #: Array[Symbol]
+
+    # The list of local variables that are forwarded to the next scope. This
+    # should by defined as an array of symbols containing the specific values of
+    # :*, :**, :&, or :"...".
+    attr_reader :forwarding #: Array[Symbol]
+
+    # Create a new scope object with the given locals and forwarding.
+    #--
+    #: (Array[Symbol] locals, Array[Symbol] forwarding) -> void
+    def initialize(locals, forwarding)
+      @locals = locals
+      @forwarding = forwarding
+    end
+  end
+
+  # Create a new scope with the given locals and forwarding options that is
+  # suitable for passing into one of the Prism.* methods that accepts the
+  # `scopes` option.
+  #--
+  #: (?locals: Array[Symbol], ?forwarding: Array[Symbol]) -> Scope
+  def self.scope(locals: [], forwarding: [])
+    Scope.new(locals, forwarding)
   end
 end
diff --git a/lib/prism/parse_result/comments.rb b/lib/prism/parse_result/comments.rb
index 22c4148b2c..df80792d39 100644
--- a/lib/prism/parse_result/comments.rb
+++ b/lib/prism/parse_result/comments.rb
@@ -1,4 +1,7 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
   class ParseResult < Result
@@ -17,32 +20,49 @@ module Prism
     # the comment. Otherwise it will favor attaching to the nearest location
     # that is after the comment.
     class Comments
+      # @rbs!
+      #    # An internal interface for a target that comments can be attached
+      #    # to. This is either going to be a NodeTarget or a CommentTarget.
+      #    interface _CommentTarget
+      #      def start_offset: () -> Integer
+      #      def end_offset: () -> Integer
+      #      def encloses?: (Comment) -> bool
+      #      def leading_comment: (Comment) -> void
+      #      def trailing_comment: (Comment) -> void
+      #    end
+
       # A target for attaching comments that is based on a specific node's
       # location.
       class NodeTarget # :nodoc:
-        attr_reader :node
+        attr_reader :node #: node
 
+        #: (node node) -> void
         def initialize(node)
           @node = node
         end
 
+        #: () -> Integer
         def start_offset
           node.start_offset
         end
 
+        #: () -> Integer
         def end_offset
           node.end_offset
         end
 
+        #: (Comment comment) -> bool
         def encloses?(comment)
           start_offset <= comment.location.start_offset &&
             comment.location.end_offset <= end_offset
         end
 
+        #: (Comment comment) -> void
         def leading_comment(comment)
           node.location.leading_comment(comment)
         end
 
+        #: (Comment comment) -> void
         def trailing_comment(comment)
           node.location.trailing_comment(comment)
         end
@@ -51,44 +71,54 @@ module Prism
       # A target for attaching comments that is based on a location field on a
       # node. For example, the `end` token of a ClassNode.
       class LocationTarget # :nodoc:
-        attr_reader :location
+        attr_reader :location #: Location
 
+        #: (Location location) -> void
         def initialize(location)
           @location = location
         end
 
+        #: () -> Integer
         def start_offset
           location.start_offset
         end
 
+        #: () -> Integer
         def end_offset
           location.end_offset
         end
 
+        #: (Comment comment) -> bool
         def encloses?(comment)
           false
         end
 
+        #: (Comment comment) -> void
         def leading_comment(comment)
           location.leading_comment(comment)
         end
 
+        #: (Comment comment) -> void
         def trailing_comment(comment)
           location.trailing_comment(comment)
         end
       end
 
       # The parse result that we are attaching comments to.
-      attr_reader :parse_result
+      attr_reader :parse_result #: ParseResult
 
       # Create a new Comments object that will attach comments to the given
       # parse result.
+      #--
+      #: (ParseResult parse_result) -> void
       def initialize(parse_result)
         @parse_result = parse_result
       end
 
       # Attach the comments to their respective locations in the tree by
       # mutating the parse result.
+      #--
+      #: () -> void
       def attach!
         parse_result.comments.each do |comment|
           preceding, enclosing, following = nearest_targets(parse_result.value, comment)
@@ -116,11 +146,13 @@ module Prism
 
       # Responsible for finding the nearest targets to the given comment within
       # the context of the given encapsulating node.
+      #--
+      #: (node node, Comment comment) -> [_CommentTarget?, _CommentTarget?, _CommentTarget?]
       def nearest_targets(node, comment)
         comment_start = comment.location.start_offset
         comment_end = comment.location.end_offset
 
-        targets = [] #: Array[_Target]
+        targets = [] #: Array[_CommentTarget]
         node.comment_targets.map do |value|
           case value
           when StatementsNode
@@ -133,8 +165,8 @@ module Prism
         end
 
         targets.sort_by!(&:start_offset)
-        preceding = nil #: _Target?
-        following = nil #: _Target?
+        preceding = nil #: _CommentTarget?
+        following = nil #: _CommentTarget?
 
         left = 0
         right = targets.length
diff --git a/lib/prism/parse_result/errors.rb b/lib/prism/parse_result/errors.rb
new file mode 100644
index 0000000000..388309d23d
--- /dev/null
+++ b/lib/prism/parse_result/errors.rb
@@ -0,0 +1,72 @@
+# frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
+
+require "stringio"
+
+module Prism
+  class ParseResult < Result
+    # An object to represent the set of errors on a parse result. This object
+    # can be used to format the errors in a human-readable way.
+    class Errors
+      # The parse result that contains the errors.
+      attr_reader :parse_result #: ParseResult
+
+      # Initialize a new set of errors from the given parse result.
+      #--
+      #: (ParseResult parse_result) -> void
+      def initialize(parse_result)
+        @parse_result = parse_result
+      end
+
+      # Formats the errors in a human-readable way and return them as a string.
+      #--
+      #: () -> String
+      def format
+        error_lines = {} #: Hash[Integer, Array[ParseError]]
+        parse_result.errors.each do |error|
+          location = error.location
+          (location.start_line..location.end_line).each do |line|
+            error_lines[line] ||= []
+            error_lines[line] << error
+          end
+        end
+
+        source_lines = parse_result.source.source.lines
+        source_lines << "" if error_lines.key?(source_lines.size + 1)
+
+        io = StringIO.new
+        source_lines.each.with_index(1) do |line, line_number|
+          io.puts(line)
+
+          (error_lines.delete(line_number) || []).each do |error|
+            location = error.location
+
+            case line_number
+            when location.start_line
+              io.print(" " * location.start_column + "^")
+
+              if location.start_line == location.end_line
+                if location.start_column != location.end_column
+                  io.print("~" * (location.end_column - location.start_column - 1))
+                end
+
+                io.puts(" " + error.message)
+              else
+                io.puts("~" * (line.bytesize - location.start_column))
+              end
+            when location.end_line
+              io.puts("~" * location.end_column + " " + error.message)
+            else
+              io.puts("~" * line.bytesize)
+            end
+          end
+        end
+
+        io.puts
+        io.string
+      end
+    end
+  end
+end
diff --git a/lib/prism/parse_result/newlines.rb b/lib/prism/parse_result/newlines.rb
index 808a129a6b..450c790226 100644
--- a/lib/prism/parse_result/newlines.rb
+++ b/lib/prism/parse_result/newlines.rb
@@ -1,4 +1,7 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
   class ParseResult < Result
@@ -23,13 +26,20 @@ module Prism
     # that case. We do that to avoid storing the extra `@newline` instance
     # variable on every node if we don't need it.
     class Newlines < Visitor
+      # The map of lines indices to whether or not they have been marked as
+      # emitting a newline event.
+      # @rbs @lines: Array[bool]
+
       # Create a new Newlines visitor with the given newline offsets.
+      #--
+      #: (Integer lines) -> void
       def initialize(lines)
-        # @type var lines: Integer
         @lines = Array.new(1 + lines, false)
       end
 
-      # Permit block/lambda nodes to mark newlines within themselves.
+      # Permit block nodes to mark newlines within themselves.
+      #--
+      #: (BlockNode node) -> void
       def visit_block_node(node)
         old_lines = @lines
         @lines = Array.new(old_lines.size, false)
@@ -41,20 +51,42 @@ module Prism
         end
       end
 
-      alias_method :visit_lambda_node, :visit_block_node
+      # Permit lambda nodes to mark newlines within themselves.
+      #--
+      #: (LambdaNode node) -> void
+      def visit_lambda_node(node)
+        old_lines = @lines
+        @lines = Array.new(old_lines.size, false)
 
-      # Mark if/unless nodes as newlines.
+        begin
+          super(node)
+        ensure
+          @lines = old_lines
+        end
+      end
+
+      # Mark if nodes as newlines.
+      #--
+      #: (IfNode node) -> void
       def visit_if_node(node)
-        node.newline!(@lines)
+        node.newline_flag!(@lines)
         super(node)
       end
 
-      alias_method :visit_unless_node, :visit_if_node
+      # Mark unless nodes as newlines.
+      #--
+      #: (UnlessNode node) -> void
+      def visit_unless_node(node)
+        node.newline_flag!(@lines)
+        super(node)
+      end
 
       # Permit statements lists to mark newlines within themselves.
+      #--
+      #: (StatementsNode node) -> void
       def visit_statements_node(node)
         node.body.each do |child|
-          child.newline!(@lines)
+          child.newline_flag!(@lines)
         end
         super(node)
       end
@@ -62,93 +94,111 @@ module Prism
   end
 
   class Node
-    def newline? # :nodoc:
-      @newline ? true : false
+    # Tracks whether or not this node should emit a newline event when the
+    # instructions that it represents are executed.
+    # @rbs @newline_flag: bool
+
+    #: () -> bool
+    def newline_flag? # :nodoc:
+      !!defined?(@newline_flag)
     end
 
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       line = location.start_line
       unless lines[line]
         lines[line] = true
-        @newline = true
+        @newline_flag = true
       end
     end
   end
 
   class BeginNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       # Never mark BeginNode with a newline flag, mark children instead.
     end
   end
 
   class ParenthesesNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       # Never mark ParenthesesNode with a newline flag, mark children instead.
     end
   end
 
   class IfNode < Node
-    def newline!(lines) # :nodoc:
-      predicate.newline!(lines)
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
+      predicate.newline_flag!(lines)
     end
   end
 
   class UnlessNode < Node
-    def newline!(lines) # :nodoc:
-      predicate.newline!(lines)
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
+      predicate.newline_flag!(lines)
     end
   end
 
   class UntilNode < Node
-    def newline!(lines) # :nodoc:
-      predicate.newline!(lines)
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
+      predicate.newline_flag!(lines)
     end
   end
 
   class WhileNode < Node
-    def newline!(lines) # :nodoc:
-      predicate.newline!(lines)
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
+      predicate.newline_flag!(lines)
     end
   end
 
   class RescueModifierNode < Node
-    def newline!(lines) # :nodoc:
-      expression.newline!(lines)
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
+      expression.newline_flag!(lines)
     end
   end
 
   class InterpolatedMatchLastLineNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       first = parts.first
-      first.newline!(lines) if first
+      first.newline_flag!(lines) if first
     end
   end
 
   class InterpolatedRegularExpressionNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       first = parts.first
-      first.newline!(lines) if first
+      first.newline_flag!(lines) if first
     end
   end
 
   class InterpolatedStringNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       first = parts.first
-      first.newline!(lines) if first
+      first.newline_flag!(lines) if first
     end
   end
 
   class InterpolatedSymbolNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       first = parts.first
-      first.newline!(lines) if first
+      first.newline_flag!(lines) if first
     end
   end
 
   class InterpolatedXStringNode < Node
-    def newline!(lines) # :nodoc:
+    #: (Array[bool] lines) -> void
+    def newline_flag!(lines) # :nodoc:
       first = parts.first
-      first.newline!(lines) if first
+      first.newline_flag!(lines) if first
     end
   end
 end
diff --git a/lib/prism/pattern.rb b/lib/prism/pattern.rb
index 03fec26789..be0493df05 100644
--- a/lib/prism/pattern.rb
+++ b/lib/prism/pattern.rb
@@ -1,4 +1,7 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
   # A pattern is an object that wraps a Ruby pattern matching expression. The
@@ -40,7 +43,9 @@ module Prism
     class CompilationError < StandardError
       # Create a new CompilationError with the given representation of the node
       # that caused the error.
-      def initialize(repr)
+      #--
+      #: (String repr) -> void
+      def initialize(repr) # :nodoc:
         super(<<~ERROR)
           prism was unable to compile the pattern you provided into a usable
           expression. It failed on to understand the node represented by:
@@ -56,10 +61,13 @@ module Prism
     end
 
     # The query that this pattern was initialized with.
-    attr_reader :query
+    attr_reader :query #: String
+    # @rbs @compiled: Proc?
 
     # Create a new pattern with the given query. The query should be a string
     # containing a Ruby pattern matching expression.
+    #--
+    #: (String query) -> void
     def initialize(query)
       @query = query
       @compiled = nil
@@ -67,6 +75,8 @@ module Prism
 
     # Compile the query into a callable object that can be used to match against
     # nodes.
+    #--
+    #: () -> Proc
     def compile
       result = Prism.parse("case nil\nin #{query}\nend")
 
@@ -83,7 +93,10 @@ module Prism
     # pattern. If a block is given, it will be called with each node that
     # matches the pattern. If no block is given, an enumerator will be returned
     # that will yield each node that matches the pattern.
-    def scan(root)
+    #--
+    #: (node root) -> Enumerator[node, void]
+    #: (node root) { (node) -> void } -> void
+    def scan(root, &blk)
       return to_enum(:scan, root) unless block_given?
 
       @compiled ||= compile
@@ -99,23 +112,33 @@ module Prism
 
     # Shortcut for combining two procs into one that returns true if both return
     # true.
-    def combine_and(left, right)
+    #--
+    #: (Proc left, Proc right) -> Proc
+    def combine_and(left, right) # :nodoc:
       ->(other) { left.call(other) && right.call(other) }
     end
 
     # Shortcut for combining two procs into one that returns true if either
     # returns true.
-    def combine_or(left, right)
+    #--
+    #: (Proc left, Proc right) -> Proc
+    def combine_or(left, right) # :nodoc:
       ->(other) { left.call(other) || right.call(other) }
     end
 
-    # Raise an error because the given node is not supported.
-    def compile_error(node)
+    # Raise an error because the given node is not supported. Note purposefully
+    # not typing this method since it is a no return method that Steep does not
+    # understand.
+    #--
+    #: (node node) -> bot
+    def compile_error(node) # :nodoc:
       raise CompilationError, node.inspect
     end
 
     # in [foo, bar, baz]
-    def compile_array_pattern_node(node)
+    #--
+    #: (ArrayPatternNode node) -> Proc
+    def compile_array_pattern_node(node) # :nodoc:
       compile_error(node) if !node.rest.nil? || node.posts.any?
 
       constant = node.constant
@@ -140,12 +163,16 @@ module Prism
     end
 
     # in foo | bar
-    def compile_alternation_pattern_node(node)
+    #--
+    #: (AlternationPatternNode node) -> Proc
+    def compile_alternation_pattern_node(node) # :nodoc:
       combine_or(compile_node(node.left), compile_node(node.right))
     end
 
     # in Prism::ConstantReadNode
-    def compile_constant_path_node(node)
+    #--
+    #: (ConstantPathNode node) -> Proc
+    def compile_constant_path_node(node) # :nodoc:
       parent = node.parent
 
       if parent.is_a?(ConstantReadNode) && parent.slice == "Prism"
@@ -160,12 +187,16 @@ module Prism
 
     # in ConstantReadNode
     # in String
-    def compile_constant_read_node(node)
+    #--
+    #: (ConstantReadNode node) -> Proc
+    def compile_constant_read_node(node) # :nodoc:
       compile_constant_name(node, node.name)
     end
 
     # Compile a name associated with a constant.
-    def compile_constant_name(node, name)
+    #--
+    #: ((ConstantPathNode | ConstantReadNode) node, Symbol name) -> Proc
+    def compile_constant_name(node, name) # :nodoc:
       if Prism.const_defined?(name, false)
         clazz = Prism.const_get(name)
 
@@ -181,9 +212,14 @@ module Prism
 
     # in InstanceVariableReadNode[name: Symbol]
     # in { name: Symbol }
-    def compile_hash_pattern_node(node)
+    #--
+    #: (HashPatternNode node) -> Proc
+    def compile_hash_pattern_node(node) # :nodoc:
       compile_error(node) if node.rest
-      compiled_constant = compile_node(node.constant) if node.constant
+
+      if (constant = node.constant)
+        compiled_constant = compile_node(constant)
+      end
 
       preprocessed =
         node.elements.to_h do |element|
@@ -211,12 +247,16 @@ module Prism
     end
 
     # in nil
-    def compile_nil_node(node)
+    #--
+    #: (NilNode node) -> Proc
+    def compile_nil_node(node) # :nodoc:
       ->(attribute) { attribute.nil? }
     end
 
     # in /foo/
-    def compile_regular_expression_node(node)
+    #--
+    #: (RegularExpressionNode node) -> Proc
+    def compile_regular_expression_node(node) # :nodoc:
       regexp = Regexp.new(node.unescaped, node.closing[1..])
 
       ->(attribute) { regexp === attribute }
@@ -224,7 +264,9 @@ module Prism
 
     # in ""
     # in "foo"
-    def compile_string_node(node)
+    #--
+    #: (StringNode node) -> Proc
+    def compile_string_node(node) # :nodoc:
       string = node.unescaped
 
       ->(attribute) { string === attribute }
@@ -232,7 +274,9 @@ module Prism
 
     # in :+
     # in :foo
-    def compile_symbol_node(node)
+    #--
+    #: (SymbolNode node) -> Proc
+    def compile_symbol_node(node) # :nodoc:
       symbol = node.unescaped.to_sym
 
       ->(attribute) { symbol === attribute }
@@ -240,7 +284,9 @@ module Prism
 
     # Compile any kind of node. Dispatch out to the individual compilation
     # methods based on the type of node.
-    def compile_node(node)
+    #--
+    #: (node node) -> Proc
+    def compile_node(node) # :nodoc:
       case node
       when AlternationPatternNode
         compile_alternation_pattern_node(node)
diff --git a/lib/prism/polyfill/append_as_bytes.rb b/lib/prism/polyfill/append_as_bytes.rb
new file mode 100644
index 0000000000..24218bd171
--- /dev/null
+++ b/lib/prism/polyfill/append_as_bytes.rb
@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+# Polyfill for String#append_as_bytes, which didn't exist until Ruby 3.4.
+if !("".respond_to?(:append_as_bytes))
+  String.include(
+    Module.new {
+      def append_as_bytes(*args)
+        args.each do |arg|
+          arg = Integer === arg ? [arg].pack("C") : arg.b
+          self.<<(arg) # steep:ignore
+        end
+      end
+    }
+  )
+end
diff --git a/lib/prism/polyfill/scan_byte.rb b/lib/prism/polyfill/scan_byte.rb
new file mode 100644
index 0000000000..9276e509fc
--- /dev/null
+++ b/lib/prism/polyfill/scan_byte.rb
@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require "strscan"
+
+# Polyfill for StringScanner#scan_byte, which didn't exist until Ruby 3.4.
+if !(StringScanner.method_defined?(:scan_byte))
+  StringScanner.include(
+    Module.new {
+      def scan_byte # :nodoc:
+        get_byte&.b&.ord
+      end
+    }
+  )
+end
diff --git a/lib/prism/polyfill/warn.rb b/lib/prism/polyfill/warn.rb
new file mode 100644
index 0000000000..76a4264623
--- /dev/null
+++ b/lib/prism/polyfill/warn.rb
@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+
+# Polyfill for Kernel#warn with the category parameter. Not all Ruby engines
+# have Method#parameters implemented, so we check the arity instead if
+# necessary.
+if (method = Kernel.instance_method(:warn)).respond_to?(:parameters) ? method.parameters.none? { |_, name| name == :category } : (method.arity == -1)
+  Kernel.prepend(
+    Module.new {
+      def warn(*msgs, uplevel: nil, category: nil) # :nodoc:
+        case uplevel
+        when nil
+          super(*msgs)
+        when Integer
+          super(*msgs, uplevel: uplevel + 1)
+        else
+          super(*msgs, uplevel: uplevel.to_int + 1)
+        end
+      end
+    }
+  )
+
+  Object.prepend(
+    Module.new {
+      def warn(*msgs, uplevel: nil, category: nil) # :nodoc:
+        case uplevel
+        when nil
+          super(*msgs)
+        when Integer
+          super(*msgs, uplevel: uplevel + 1)
+        else
+          super(*msgs, uplevel: uplevel.to_int + 1)
+        end
+      end
+    }
+  )
+end
diff --git a/lib/prism/prism.gemspec b/lib/prism/prism.gemspec
index b4504dbf4b..aac056b3f8 100644
--- a/lib/prism/prism.gemspec
+++ b/lib/prism/prism.gemspec
@@ -2,7 +2,7 @@
 
 Gem::Specification.new do |spec|
   spec.name = "prism"
-  spec.version = "0.29.0"
+  spec.version = "1.9.0"
   spec.authors = ["Shopify"]
   spec.email = ["ruby@shopify.com"]
 
@@ -35,38 +35,76 @@ Gem::Specification.new do |spec|
     "docs/parser_translation.md",
     "docs/parsing_rules.md",
     "docs/releasing.md",
+    "docs/relocation.md",
     "docs/ripper_translation.md",
     "docs/ruby_api.md",
     "docs/ruby_parser_translation.md",
     "docs/serialization.md",
     "docs/testing.md",
     "ext/prism/api_node.c",
-    "ext/prism/api_pack.c",
+    "ext/prism/extconf.rb",
     "ext/prism/extension.c",
     "ext/prism/extension.h",
     "include/prism.h",
+    "include/prism/compiler/accel.h",
+    "include/prism/compiler/align.h",
+    "include/prism/compiler/exported.h",
+    "include/prism/compiler/fallthrough.h",
+    "include/prism/compiler/filesystem.h",
+    "include/prism/compiler/flex_array.h",
+    "include/prism/compiler/force_inline.h",
+    "include/prism/compiler/format.h",
+    "include/prism/compiler/inline.h",
+    "include/prism/compiler/nodiscard.h",
+    "include/prism/compiler/nonnull.h",
+    "include/prism/compiler/unused.h",
+    "include/prism/internal/allocator.h",
+    "include/prism/internal/allocator_debug.h",
+    "include/prism/internal/arena.h",
+    "include/prism/internal/bit.h",
+    "include/prism/internal/buffer.h",
+    "include/prism/internal/char.h",
+    "include/prism/internal/comments.h",
+    "include/prism/internal/constant_pool.h",
+    "include/prism/internal/diagnostic.h",
+    "include/prism/internal/encoding.h",
+    "include/prism/internal/integer.h",
+    "include/prism/internal/isinf.h",
+    "include/prism/internal/line_offset_list.h",
+    "include/prism/internal/list.h",
+    "include/prism/internal/magic_comments.h",
+    "include/prism/internal/memchr.h",
+    "include/prism/internal/node.h",
+    "include/prism/internal/options.h",
+    "include/prism/internal/parser.h",
+    "include/prism/internal/regexp.h",
+    "include/prism/internal/serialize.h",
+    "include/prism/internal/source.h",
+    "include/prism/internal/static_literals.h",
+    "include/prism/internal/strncasecmp.h",
+    "include/prism/internal/stringy.h",
+    "include/prism/internal/strpbrk.h",
+    "include/prism/internal/tokens.h",
+    "include/prism/arena.h",
     "include/prism/ast.h",
-    "include/prism/defines.h",
+    "include/prism/buffer.h",
+    "include/prism/comments.h",
+    "include/prism/constant_pool.h",
     "include/prism/diagnostic.h",
-    "include/prism/encoding.h",
+    "include/prism/excludes.h",
+    "include/prism/integer.h",
+    "include/prism/json.h",
+    "include/prism/line_offset_list.h",
+    "include/prism/magic_comments.h",
     "include/prism/node.h",
     "include/prism/options.h",
-    "include/prism/pack.h",
     "include/prism/parser.h",
     "include/prism/prettyprint.h",
-    "include/prism/regexp.h",
-    "include/prism/static_literals.h",
-    "include/prism/util/pm_buffer.h",
-    "include/prism/util/pm_char.h",
-    "include/prism/util/pm_constant_pool.h",
-    "include/prism/util/pm_integer.h",
-    "include/prism/util/pm_list.h",
-    "include/prism/util/pm_memchr.h",
-    "include/prism/util/pm_newline_list.h",
-    "include/prism/util/pm_strncasecmp.h",
-    "include/prism/util/pm_string.h",
-    "include/prism/util/pm_string_list.h",
-    "include/prism/util/pm_strpbrk.h",
+    "include/prism/serialize.h",
+    "include/prism/source.h",
+    "include/prism/stream.h",
+    "include/prism/string_query.h",
+    "include/prism/stringy.h",
     "include/prism/version.h",
     "lib/prism.rb",
     "lib/prism/compiler.rb",
@@ -79,79 +117,112 @@ Gem::Specification.new do |spec|
     "lib/prism/lex_compat.rb",
     "lib/prism/mutation_compiler.rb",
     "lib/prism/node_ext.rb",
+    "lib/prism/node_find.rb",
     "lib/prism/node.rb",
-    "lib/prism/pack.rb",
     "lib/prism/parse_result.rb",
     "lib/prism/parse_result/comments.rb",
+    "lib/prism/parse_result/errors.rb",
     "lib/prism/parse_result/newlines.rb",
     "lib/prism/pattern.rb",
+    "lib/prism/polyfill/append_as_bytes.rb",
     "lib/prism/polyfill/byteindex.rb",
+    "lib/prism/polyfill/scan_byte.rb",
     "lib/prism/polyfill/unpack1.rb",
+    "lib/prism/polyfill/warn.rb",
     "lib/prism/reflection.rb",
+    "lib/prism/relocation.rb",
     "lib/prism/serialize.rb",
+    "lib/prism/string_query.rb",
     "lib/prism/translation.rb",
     "lib/prism/translation/parser.rb",
-    "lib/prism/translation/parser33.rb",
-    "lib/prism/translation/parser34.rb",
+    "lib/prism/translation/parser_current.rb",
+    "lib/prism/translation/parser_versions.rb",
+    "lib/prism/translation/parser/builder.rb",
     "lib/prism/translation/parser/compiler.rb",
     "lib/prism/translation/parser/lexer.rb",
-    "lib/prism/translation/parser/rubocop.rb",
     "lib/prism/translation/ripper.rb",
+    "lib/prism/translation/ripper/filter.rb",
+    "lib/prism/translation/ripper/lexer.rb",
     "lib/prism/translation/ripper/sexp.rb",
     "lib/prism/translation/ripper/shim.rb",
     "lib/prism/translation/ruby_parser.rb",
     "lib/prism/visitor.rb",
     "prism.gemspec",
-    "rbi/prism.rbi",
-    "rbi/prism/compiler.rbi",
-    "rbi/prism/inspect_visitor.rbi",
-    "rbi/prism/node_ext.rbi",
-    "rbi/prism/node.rbi",
-    "rbi/prism/parse_result.rbi",
-    "rbi/prism/reflection.rbi",
+    "rbi/generated/prism.rbi",
+    "rbi/generated/prism/compiler.rbi",
+    "rbi/generated/prism/desugar_compiler.rbi",
+    "rbi/generated/prism/dispatcher.rbi",
+    "rbi/generated/prism/dot_visitor.rbi",
+    "rbi/generated/prism/dsl.rbi",
+    "rbi/generated/prism/inspect_visitor.rbi",
+    "rbi/generated/prism/lex_compat.rbi",
+    "rbi/generated/prism/mutation_compiler.rbi",
+    "rbi/generated/prism/node.rbi",
+    "rbi/generated/prism/node_ext.rbi",
+    "rbi/generated/prism/node_find.rbi",
+    "rbi/generated/prism/parse_result.rbi",
+    "rbi/generated/prism/pattern.rbi",
+    "rbi/generated/prism/reflection.rbi",
+    "rbi/generated/prism/relocation.rbi",
+    "rbi/generated/prism/serialize.rbi",
+    "rbi/generated/prism/string_query.rbi",
+    "rbi/generated/prism/translation.rbi",
+    "rbi/generated/prism/visitor.rbi",
+    "rbi/generated/prism/parse_result/comments.rbi",
+    "rbi/generated/prism/parse_result/errors.rbi",
+    "rbi/generated/prism/parse_result/newlines.rbi",
     "rbi/prism/translation/parser.rbi",
-    "rbi/prism/translation/parser33.rbi",
-    "rbi/prism/translation/parser34.rbi",
+    "rbi/prism/translation/parser_versions.rbi",
     "rbi/prism/translation/ripper.rbi",
-    "rbi/prism/visitor.rbi",
-    "sig/prism.rbs",
-    "sig/prism/compiler.rbs",
-    "sig/prism/dispatcher.rbs",
-    "sig/prism/dot_visitor.rbs",
-    "sig/prism/dsl.rbs",
-    "sig/prism/inspect_visitor.rbs",
-    "sig/prism/lex_compat.rbs",
-    "sig/prism/mutation_compiler.rbs",
-    "sig/prism/node_ext.rbs",
-    "sig/prism/node.rbs",
-    "sig/prism/pack.rbs",
-    "sig/prism/parse_result.rbs",
-    "sig/prism/pattern.rbs",
-    "sig/prism/reflection.rbs",
-    "sig/prism/serialize.rbs",
-    "sig/prism/visitor.rbs",
+    "rbi/rubyvm/node_find.rbi",
+    "sig/generated/prism.rbs",
+    "sig/generated/prism/compiler.rbs",
+    "sig/generated/prism/desugar_compiler.rbs",
+    "sig/generated/prism/dispatcher.rbs",
+    "sig/generated/prism/dot_visitor.rbs",
+    "sig/generated/prism/dsl.rbs",
+    "sig/generated/prism/inspect_visitor.rbs",
+    "sig/generated/prism/lex_compat.rbs",
+    "sig/generated/prism/mutation_compiler.rbs",
+    "sig/generated/prism/node.rbs",
+    "sig/generated/prism/node_ext.rbs",
+    "sig/generated/prism/node_find.rbs",
+    "sig/generated/prism/parse_result.rbs",
+    "sig/generated/prism/pattern.rbs",
+    "sig/generated/prism/reflection.rbs",
+    "sig/generated/prism/relocation.rbs",
+    "sig/generated/prism/serialize.rbs",
+    "sig/generated/prism/string_query.rbs",
+    "sig/generated/prism/translation.rbs",
+    "sig/generated/prism/visitor.rbs",
+    "sig/generated/prism/parse_result/comments.rbs",
+    "sig/generated/prism/parse_result/errors.rbs",
+    "sig/generated/prism/parse_result/newlines.rbs",
+    "src/arena.c",
+    "src/buffer.c",
+    "src/char.c",
+    "src/constant_pool.c",
     "src/diagnostic.c",
     "src/encoding.c",
+    "src/integer.c",
+    "src/json.c",
+    "src/line_offset_list.c",
+    "src/list.c",
+    "src/memchr.c",
     "src/node.c",
     "src/options.c",
-    "src/pack.c",
+    "src/parser.c",
     "src/prettyprint.c",
     "src/prism.c",
     "src/regexp.c",
     "src/serialize.c",
+    "src/source.c",
     "src/static_literals.c",
-    "src/token_type.c",
-    "src/util/pm_buffer.c",
-    "src/util/pm_char.c",
-    "src/util/pm_constant_pool.c",
-    "src/util/pm_integer.c",
-    "src/util/pm_list.c",
-    "src/util/pm_memchr.c",
-    "src/util/pm_newline_list.c",
-    "src/util/pm_string_list.c",
-    "src/util/pm_string.c",
-    "src/util/pm_strncasecmp.c",
-    "src/util/pm_strpbrk.c"
+    "src/string_query.c",
+    "src/stringy.c",
+    "src/strncasecmp.c",
+    "src/strpbrk.c",
+    "src/tokens.c"
   ]
 
   spec.extensions = ["ext/prism/extconf.rb"]
diff --git a/lib/prism/relocation.rb b/lib/prism/relocation.rb
new file mode 100644
index 0000000000..af0f792827
--- /dev/null
+++ b/lib/prism/relocation.rb
@@ -0,0 +1,665 @@
+# frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
+
+module Prism
+  # Prism parses deterministically for the same input. This provides a nice
+  # property that is exposed through the #node_id API on nodes. Effectively this
+  # means that for the same input, these values will remain consistent every
+  # time the source is parsed. This means we can reparse the source same with a
+  # #node_id value and find the exact same node again.
+  #
+  # The Relocation module provides an API around this property. It allows you to
+  # "save" nodes and locations using a minimal amount of memory (just the
+  # node_id and a field identifier) and then reify them later.
+  module Relocation
+    # @rbs!
+    #    type entry_value = untyped
+    #    type entry_values = Hash[Symbol, entry_value]
+    #
+    #    interface _Value
+    #      def start_line: () -> Integer
+    #      def end_line: () -> Integer
+    #      def start_offset: () -> Integer
+    #      def end_offset: () -> Integer
+    #      def start_character_offset: () -> Integer
+    #      def end_character_offset: () -> Integer
+    #      def cached_start_code_units_offset: (_CodeUnitsCache cache) -> Integer
+    #      def cached_end_code_units_offset: (_CodeUnitsCache cache) -> Integer
+    #      def start_column: () -> Integer
+    #      def end_column: () -> Integer
+    #      def start_character_column: () -> Integer
+    #      def end_character_column: () -> Integer
+    #      def cached_start_code_units_column: (_CodeUnitsCache cache) -> Integer
+    #      def cached_end_code_units_column: (_CodeUnitsCache cache) -> Integer
+    #      def leading_comments: () -> Array[Comment]
+    #      def trailing_comments: () -> Array[Comment]
+    #    end
+    #
+    #    interface _Field
+    #      def fields: (_Value value) -> entry_values
+    #    end
+
+    # An entry in a repository that will lazily reify its values when they are
+    # first accessed.
+    class Entry
+      # Raised if a value that could potentially be on an entry is missing
+      # because it was either not configured on the repository or it has not yet
+      # been fetched.
+      class MissingValueError < StandardError
+      end
+
+      # @rbs @repository: Repository?
+      # @rbs @values: Hash[Symbol, untyped]?
+
+      # Initialize a new entry with the given repository.
+      #--
+      #: (Repository repository) -> void
+      def initialize(repository)
+        @repository = repository
+        @values = nil
+      end
+
+      # Fetch the filepath of the value.
+      #--
+      #: () -> String
+      def filepath
+        fetch_value(:filepath)
+      end
+
+      # Fetch the start line of the value.
+      #--
+      #: () -> Integer
+      def start_line
+        fetch_value(:start_line)
+      end
+
+      # Fetch the end line of the value.
+      #--
+      #: () -> Integer
+      def end_line
+        fetch_value(:end_line)
+      end
+
+      # Fetch the start byte offset of the value.
+      #--
+      #: () -> Integer
+      def start_offset
+        fetch_value(:start_offset)
+      end
+
+      # Fetch the end byte offset of the value.
+      #--
+      #: () -> Integer
+      def end_offset
+        fetch_value(:end_offset)
+      end
+
+      # Fetch the start character offset of the value.
+      #--
+      #: () -> Integer
+      def start_character_offset
+        fetch_value(:start_character_offset)
+      end
+
+      # Fetch the end character offset of the value.
+      #--
+      #: () -> Integer
+      def end_character_offset
+        fetch_value(:end_character_offset)
+      end
+
+      # Fetch the start code units offset of the value, for the encoding that
+      # was configured on the repository.
+      #--
+      #: () -> Integer
+      def start_code_units_offset
+        fetch_value(:start_code_units_offset)
+      end
+
+      # Fetch the end code units offset of the value, for the encoding that was
+      # configured on the repository.
+      #--
+      #: () -> Integer
+      def end_code_units_offset
+        fetch_value(:end_code_units_offset)
+      end
+
+      # Fetch the start byte column of the value.
+      #--
+      #: () -> Integer
+      def start_column
+        fetch_value(:start_column)
+      end
+
+      # Fetch the end byte column of the value.
+      #--
+      #: () -> Integer
+      def end_column
+        fetch_value(:end_column)
+      end
+
+      # Fetch the start character column of the value.
+      #--
+      #: () -> Integer
+      def start_character_column
+        fetch_value(:start_character_column)
+      end
+
+      # Fetch the end character column of the value.
+      #--
+      #: () -> Integer
+      def end_character_column
+        fetch_value(:end_character_column)
+      end
+
+      # Fetch the start code units column of the value, for the encoding that
+      # was configured on the repository.
+      #--
+      #: () -> Integer
+      def start_code_units_column
+        fetch_value(:start_code_units_column)
+      end
+
+      # Fetch the end code units column of the value, for the encoding that was
+      # configured on the repository.
+      #--
+      #: () -> Integer
+      def end_code_units_column
+        fetch_value(:end_code_units_column)
+      end
+
+      # Fetch the leading comments of the value.
+      #--
+      #: () -> Array[CommentsField::Comment]
+      def leading_comments
+        fetch_value(:leading_comments)
+      end
+
+      # Fetch the trailing comments of the value.
+      #--
+      #: () -> Array[CommentsField::Comment]
+      def trailing_comments
+        fetch_value(:trailing_comments)
+      end
+
+      # Fetch the leading and trailing comments of the value.
+      #--
+      #: () -> Array[CommentsField::Comment]
+      def comments
+        [*leading_comments, *trailing_comments]
+      end
+
+      # Reify the values on this entry with the given values. This is an
+      # internal-only API that is called from the repository when it is time to
+      # reify the values.
+      #--
+      #: (entry_values values) -> void
+      def reify!(values) # :nodoc:
+        @repository = nil
+        @values = values
+      end
+
+      private
+
+      # Fetch a value from the entry, raising an error if it is missing.
+      #--
+      #: (Symbol name) -> entry_value
+      def fetch_value(name)
+        values.fetch(name) do
+          raise MissingValueError, "No value for #{name}, make sure the " \
+            "repository has been properly configured"
+        end
+      end
+
+      # Return the values from the repository, reifying them if necessary.
+      #--
+      #: () -> entry_values
+      def values
+        @values || (@repository&.reify!; @values) #: entry_values
+      end
+    end
+
+    # Represents the source of a repository that will be reparsed.
+    class Source
+      # The value that will need to be reparsed.
+      attr_reader :value #: untyped
+
+      # Initialize the source with the given value.
+      #--
+      #: (untyped value) -> void
+      def initialize(value)
+        @value = value
+      end
+
+      # Reparse the value and return the parse result.
+      #--
+      #: () -> ParseResult
+      def result
+        raise NotImplementedError, "Subclasses must implement #result"
+      end
+
+      # Create a code units cache for the given encoding.
+      #--
+      #: (Encoding encoding) -> _CodeUnitsCache
+      def code_units_cache(encoding)
+        result.code_units_cache(encoding)
+      end
+    end
+
+    # A source that is represented by a file path.
+    class SourceFilepath < Source
+      # Reparse the file and return the parse result.
+      #--
+      #: () -> ParseResult
+      def result
+        Prism.parse_file(value)
+      end
+    end
+
+    # A source that is represented by a string.
+    class SourceString < Source
+      # Reparse the string and return the parse result.
+      #--
+      #: () -> ParseResult
+      def result
+        Prism.parse(value)
+      end
+    end
+
+    # A field that represents the file path.
+    class FilepathField
+      # The file path that this field represents.
+      attr_reader :value #: String
+
+      # Initialize a new field with the given file path.
+      #--
+      #: (String value) -> void
+      def initialize(value)
+        @value = value
+      end
+
+      # Fetch the file path.
+      #--
+      #: (_Value _value) -> entry_values
+      def fields(_value)
+        { filepath: value }
+      end
+    end
+
+    # A field representing the start and end lines.
+    class LinesField
+      # Fetches the start and end line of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        { start_line: value.start_line, end_line: value.end_line }
+      end
+    end
+
+    # A field representing the start and end byte offsets.
+    class OffsetsField
+      # Fetches the start and end byte offset of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        { start_offset: value.start_offset, end_offset: value.end_offset }
+      end
+    end
+
+    # A field representing the start and end character offsets.
+    class CharacterOffsetsField
+      # Fetches the start and end character offset of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        {
+          start_character_offset: value.start_character_offset,
+          end_character_offset: value.end_character_offset
+        }
+      end
+    end
+
+    # A field representing the start and end code unit offsets.
+    class CodeUnitOffsetsField
+      # A pointer to the repository object that is used for lazily creating a
+      # code units cache.
+      attr_reader :repository #: Repository
+
+      # The associated encoding for the code units.
+      attr_reader :encoding #: Encoding
+
+      # @rbs @cache: _CodeUnitsCache?
+
+      # Initialize a new field with the associated repository and encoding.
+      #--
+      #: (Repository repository, Encoding encoding) -> void
+      def initialize(repository, encoding)
+        @repository = repository
+        @encoding = encoding
+        @cache = nil
+      end
+
+      # Fetches the start and end code units offset of a value for a particular
+      # encoding.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        {
+          start_code_units_offset: value.cached_start_code_units_offset(cache),
+          end_code_units_offset: value.cached_end_code_units_offset(cache)
+        }
+      end
+
+      private
+
+      # Lazily create a code units cache for the associated encoding.
+      #--
+      #: () -> _CodeUnitsCache
+      def cache
+        @cache ||= repository.code_units_cache(encoding)
+      end
+    end
+
+    # A field representing the start and end byte columns.
+    class ColumnsField
+      # Fetches the start and end byte column of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        { start_column: value.start_column, end_column: value.end_column }
+      end
+    end
+
+    # A field representing the start and end character columns.
+    class CharacterColumnsField
+      # Fetches the start and end character column of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        {
+          start_character_column: value.start_character_column,
+          end_character_column: value.end_character_column
+        }
+      end
+    end
+
+    # A field representing the start and end code unit columns for a specific
+    # encoding.
+    class CodeUnitColumnsField
+      # The repository object that is used for lazily creating a code units
+      # cache.
+      attr_reader :repository #: Repository
+
+      # The associated encoding for the code units.
+      attr_reader :encoding #: Encoding
+
+      # @rbs @cache: _CodeUnitsCache?
+
+      # Initialize a new field with the associated repository and encoding.
+      #--
+      #: (Repository repository, Encoding encoding) -> void
+      def initialize(repository, encoding)
+        @repository = repository
+        @encoding = encoding
+        @cache = nil
+      end
+
+      # Fetches the start and end code units column of a value for a particular
+      # encoding.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        {
+          start_code_units_column: value.cached_start_code_units_column(cache),
+          end_code_units_column: value.cached_end_code_units_column(cache)
+        }
+      end
+
+      private
+
+      # Lazily create a code units cache for the associated encoding.
+      #--
+      #: () -> _CodeUnitsCache
+      def cache
+        @cache ||= repository.code_units_cache(encoding)
+      end
+    end
+
+    # An abstract field used as the parent class of the two comments fields.
+    class CommentsField
+      # An object that represents a slice of a comment.
+      class Comment
+        # The slice of the comment.
+        attr_reader :slice #: String
+
+        # Initialize a new comment with the given slice.
+        #
+        #: (String slice) -> void
+        def initialize(slice)
+          @slice = slice
+        end
+      end
+
+      private
+
+      # Create comment objects from the given values.
+      #--
+      #: (entry_value values) -> Array[Comment]
+      def comments(values)
+        values.map { |value| Comment.new(value.slice) }
+      end
+    end
+
+    # A field representing the leading comments.
+    class LeadingCommentsField < CommentsField
+      # Fetches the leading comments of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        { leading_comments: comments(value.leading_comments) }
+      end
+    end
+
+    # A field representing the trailing comments.
+    class TrailingCommentsField < CommentsField
+      # Fetches the trailing comments of a value.
+      #--
+      #: (_Value value) -> entry_values
+      def fields(value)
+        { trailing_comments: comments(value.trailing_comments) }
+      end
+    end
+
+    # A repository is a configured collection of fields and a set of entries
+    # that knows how to reparse a source and reify the values.
+    class Repository
+      # Raised when multiple fields of the same type are configured on the same
+      # repository.
+      class ConfigurationError < StandardError
+      end
+
+      # The source associated with this repository. This will be either a
+      # SourceFilepath (the most common use case) or a SourceString.
+      attr_reader :source #: Source
+
+      # The fields that have been configured on this repository.
+      attr_reader :fields #: Hash[Symbol, _Field]
+
+      # The entries that have been saved on this repository.
+      attr_reader :entries #: Hash[Integer, Hash[Symbol, Entry]]
+
+      # Initialize a new repository with the given source.
+      #--
+      #: (Source source) -> void
+      def initialize(source)
+        @source = source
+        @fields = {}
+        @entries = Hash.new { |hash, node_id| hash[node_id] = {} }
+      end
+
+      # Create a code units cache for the given encoding from the source.
+      #--
+      #: (Encoding encoding) -> _CodeUnitsCache
+      def code_units_cache(encoding)
+        source.code_units_cache(encoding)
+      end
+
+      # Configure the filepath field for this repository and return self.
+      #--
+      #: () -> self
+      def filepath
+        raise ConfigurationError, "Can only specify filepath for a filepath source" unless source.is_a?(SourceFilepath)
+        field(:filepath, FilepathField.new(source.value))
+      end
+
+      # Configure the lines field for this repository and return self.
+      #--
+      #: () -> self
+      def lines
+        field(:lines, LinesField.new)
+      end
+
+      # Configure the offsets field for this repository and return self.
+      #--
+      #: () -> self
+      def offsets
+        field(:offsets, OffsetsField.new)
+      end
+
+      # Configure the character offsets field for this repository and return
+      # self.
+      #--
+      #: () -> self
+      def character_offsets
+        field(:character_offsets, CharacterOffsetsField.new)
+      end
+
+      # Configure the code unit offsets field for this repository for a specific
+      # encoding and return self.
+      #--
+      #: (Encoding encoding) -> self
+      def code_unit_offsets(encoding)
+        field(:code_unit_offsets, CodeUnitOffsetsField.new(self, encoding))
+      end
+
+      # Configure the columns field for this repository and return self.
+      #--
+      #: () -> self
+      def columns
+        field(:columns, ColumnsField.new)
+      end
+
+      # Configure the character columns field for this repository and return
+      # self.
+      #--
+      #: () -> self
+      def character_columns
+        field(:character_columns, CharacterColumnsField.new)
+      end
+
+      # Configure the code unit columns field for this repository for a specific
+      # encoding and return self.
+      #--
+      #: (Encoding encoding) -> self
+      def code_unit_columns(encoding)
+        field(:code_unit_columns, CodeUnitColumnsField.new(self, encoding))
+      end
+
+      # Configure the leading comments field for this repository and return
+      # self.
+      #--
+      #: () -> self
+      def leading_comments
+        field(:leading_comments, LeadingCommentsField.new)
+      end
+
+      # Configure the trailing comments field for this repository and return
+      # self.
+      #--
+      #: () -> self
+      def trailing_comments
+        field(:trailing_comments, TrailingCommentsField.new)
+      end
+
+      # Configure both the leading and trailing comment fields for this
+      # repository and return self.
+      #--
+      #: () -> self
+      def comments
+        leading_comments.trailing_comments
+      end
+
+      # This method is called from nodes and locations when they want to enter
+      # themselves into the repository. It it internal-only and meant to be
+      # called from the #save* APIs.
+      #--
+      #: (Integer node_id, Symbol field_name) -> Entry
+      def enter(node_id, field_name) # :nodoc:
+        entry = Entry.new(self)
+        @entries[node_id][field_name] = entry
+        entry
+      end
+
+      # This method is called from the entries in the repository when they need
+      # to reify their values. It is internal-only and meant to be called from
+      # the various value APIs.
+      #--
+      #: () -> void
+      def reify! # :nodoc:
+        result = source.result
+
+        # Attach the comments if they have been requested as part of the
+        # configuration of this repository.
+        if fields.key?(:leading_comments) || fields.key?(:trailing_comments)
+          result.attach_comments!
+        end
+
+        queue = [result.value] #: Array[Prism::node]
+        while (node = queue.shift)
+          @entries[node.node_id].each do |field_name, entry|
+            value = node.public_send(field_name)
+            values = {} #: entry_values
+
+            fields.each_value do |field|
+              values.merge!(field.fields(value))
+            end
+
+            entry.reify!(values)
+          end
+
+          queue.concat(node.compact_child_nodes)
+        end
+
+        @entries.clear
+      end
+
+      private
+
+      # Append the given field to the repository and return the repository so
+      # that these calls can be chained.
+      #--
+      #: (Symbol name, _Field) -> self
+      def field(name, value)
+        raise ConfigurationError, "Cannot specify multiple #{name} fields" if @fields.key?(name)
+        @fields[name] = value
+        self
+      end
+    end
+
+    # Create a new repository for the given filepath.
+    #--
+    #: (String value) -> Repository
+    def self.filepath(value)
+      Repository.new(SourceFilepath.new(value))
+    end
+
+    # Create a new repository for the given string.
+    #--
+    #: (String value) -> Repository
+    def self.string(value)
+      Repository.new(SourceString.new(value))
+    end
+  end
+end
diff --git a/lib/prism/string_query.rb b/lib/prism/string_query.rb
new file mode 100644
index 0000000000..99ce57e5fe
--- /dev/null
+++ b/lib/prism/string_query.rb
@@ -0,0 +1,46 @@
+# frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
+
+module Prism
+  # Query methods that allow categorizing strings based on their context for
+  # where they could be valid in a Ruby syntax tree.
+  class StringQuery
+    # @rbs!
+    #    def self.local?: (String string) -> bool
+    #    def self.constant?: (String string) -> bool
+    #    def self.method_name?: (String string) -> bool
+
+    # The string that this query is wrapping.
+    attr_reader :string #: String
+
+    # Initialize a new query with the given string.
+    #--
+    #: (String string) -> void
+    def initialize(string)
+      @string = string
+    end
+
+    # Whether or not this string is a valid local variable name.
+    #--
+    #: () -> bool
+    def local?
+      StringQuery.local?(string)
+    end
+
+    # Whether or not this string is a valid constant name.
+    #--
+    #: () -> bool
+    def constant?
+      StringQuery.constant?(string)
+    end
+
+    # Whether or not this string is a valid method name.
+    #--
+    #: () -> bool
+    def method_name?
+      StringQuery.method_name?(string)
+    end
+  end
+end
diff --git a/lib/prism/translation.rb b/lib/prism/translation.rb
index 8b75e8a3ab..5a086a7542 100644
--- a/lib/prism/translation.rb
+++ b/lib/prism/translation.rb
@@ -1,12 +1,19 @@
 # frozen_string_literal: true
+# :markup: markdown
+#--
+# rbs_inline: enabled
 
 module Prism
   # This module is responsible for converting the prism syntax tree into other
   # syntax trees.
   module Translation # steep:ignore
     autoload :Parser, "prism/translation/parser"
-    autoload :Parser33, "prism/translation/parser33"
-    autoload :Parser34, "prism/translation/parser34"
+    autoload :ParserCurrent, "prism/translation/parser_current"
+    autoload :Parser33, "prism/translation/parser_versions"
+    autoload :Parser34, "prism/translation/parser_versions"
+    autoload :Parser35, "prism/translation/parser_versions"
+    autoload :Parser40, "prism/translation/parser_versions"
+    autoload :Parser41, "prism/translation/parser_versions"
     autoload :Ripper, "prism/translation/ripper"
     autoload :RubyParser, "prism/translation/ruby_parser"
   end
diff --git a/lib/prism/translation/parser.rb b/lib/prism/translation/parser.rb
index 3748fc896e..70031f133a 100644
--- a/lib/prism/translation/parser.rb
+++ b/lib/prism/translation/parser.rb
@@ -1,9 +1,15 @@
 # frozen_string_literal: true
+# :markup: markdown
 
 begin
+  required_version = ">= 3.3.7.2"
+  gem "parser", required_version
   require "parser"
 rescue LoadError
-  warn(%q{Error: Unable to load parser. Add `gem "parser"` to your Gemfile.})
+  warn(<<~MSG)
+    Error: Unable to load parser #{required_version}. \
+    Add `gem "parser"` to your Gemfile or run `bundle update parser`.
+  MSG
   exit(1)
 end
 
@@ -13,6 +19,13 @@ module Prism
     # whitequark/parser gem's syntax tree. It inherits from the base parser for
     # the parser gem, and overrides the parse* methods to parse with prism and
     # then translate.
+    #
+    # Note that this version of the parser always parses using the latest
+    # version of Ruby syntax supported by Prism. If you want specific version
+    # support, use one of the version-specific subclasses, such as
+    # `Prism::Translation::Parser34`. If you want to parse using the same
+    # version of Ruby syntax as the currently running version of Ruby, use
+    # `Prism::Translation::ParserCurrent`.
     class Parser < ::Parser::Base
       Diagnostic = ::Parser::Diagnostic # :nodoc:
       private_constant :Diagnostic
@@ -20,7 +33,7 @@ module Prism
       # The parser gem has a list of diagnostics with a hard-coded set of error
       # messages. We create our own diagnostic class in order to set our own
       # error messages.
-      class PrismDiagnostic < Diagnostic
+      class PrismDiagnostic < Diagnostic # :nodoc:
         # This is the cached message coming from prism.
         attr_reader :message
 
@@ -33,8 +46,45 @@ module Prism
 
       Racc_debug_parser = false # :nodoc:
 
+      # The `builder` argument is used to create the parser using our custom builder class by default.
+      #
+      # By using the `:parser` keyword argument, you can translate in a way that is compatible with
+      # the Parser gem using any parser.
+      #
+      # For example, in RuboCop for Ruby LSP, the following approach can be used to improve performance
+      # by reusing a pre-parsed `Prism::ParseLexResult`:
+      #
+      #   class PrismPreparsed
+      #     def initialize(prism_result)
+      #       @prism_result = prism_result
+      #     end
+      #
+      #     def parse_lex(source, **options)
+      #       @prism_result
+      #     end
+      #   end
+      #
+      #   prism_preparsed = PrismPreparsed.new(prism_result)
+      #
+      #   Prism::Translation::Ruby34.new(builder, parser: prism_preparsed)
+      #
+      # In an object passed to the `:parser` keyword argument, the `parse` and `parse_lex` methods
+      # should be implemented as needed.
+      #
+      def initialize(builder = Prism::Translation::Parser::Builder.new, parser: Prism)
+        if !builder.is_a?(Prism::Translation::Parser::Builder)
+          warn(<<~MSG, uplevel: 1, category: :deprecated)
+            [deprecation]: The builder passed to `Prism::Translation::Parser.new` is not a \
+            `Prism::Translation::Parser::Builder` subclass. This will raise in the next major version.
+          MSG
+        end
+        @parser = parser
+
+        super(builder)
+      end
+
       def version # :nodoc:
-        34
+        41
       end
 
       # The default encoding for Ruby files is UTF-8.
@@ -51,7 +101,7 @@ module Prism
         source = source_buffer.source
 
         offset_cache = build_offset_cache(source)
-        result = unwrap(Prism.parse(source, filepath: source_buffer.name, version: convert_for_prism(version), scopes: [[]]), offset_cache)
+        result = unwrap(@parser.parse(source, **prism_options), offset_cache)
 
         build_ast(result.value, offset_cache)
       ensure
@@ -64,7 +114,7 @@ module Prism
         source = source_buffer.source
 
         offset_cache = build_offset_cache(source)
-        result = unwrap(Prism.parse(source, filepath: source_buffer.name, version: convert_for_prism(version), scopes: [[]]), offset_cache)
+        result = unwrap(@parser.parse(source, **prism_options), offset_cache)
 
         [
           build_ast(result.value, offset_cache),
@@ -83,7 +133,7 @@ module Prism
         offset_cache = build_offset_cache(source)
         result =
           begin
-            unwrap(Prism.parse_lex(source, filepath: source_buffer.name, version: convert_for_prism(version), scopes: [[]]), offset_cache)
+            unwrap(@parser.parse_lex(source, **prism_options), offset_cache)
           rescue ::Parser::SyntaxError
             raise if !recover
           end
@@ -285,6 +335,20 @@ module Prism
         )
       end
 
+      # Options for how prism should parse/lex the source.
+      def prism_options
+        options = {
+          filepath: @source_buffer.name,
+          version: convert_for_prism(version),
+          partial_script: true,
+        }
+        # The parser gem always encodes to UTF-8, unless it is binary.
+        # https://github.com/whitequark/parser/blob/v3.3.6.0/lib/parser/source/buffer.rb#L80-L107
+        options[:encoding] = false if @source_buffer.source.encoding != Encoding::BINARY
+
+        options
+      end
+
       # Converts the version format handled by Parser to the format handled by Prism.
       def convert_for_prism(version)
         case version
@@ -292,11 +356,16 @@ module Prism
           "3.3.1"
         when 34
           "3.4.0"
+        when 35, 40
+          "4.0.0"
+        when 41
+          "4.1.0"
         else
           "latest"
         end
       end
 
+      require_relative "parser/builder"
       require_relative "parser/compiler"
       require_relative "parser/lexer"
 
diff --git a/lib/prism/translation/parser/builder.rb b/lib/prism/translation/parser/builder.rb
new file mode 100644
index 0000000000..7fc3bba6b7
--- /dev/null
+++ b/lib/prism/translation/parser/builder.rb
@@ -0,0 +1,70 @@
+# frozen_string_literal: true
+# :markup: markdown
+
+module Prism
+  module Translation
+    class Parser
+      # A builder that knows how to convert more modern Ruby syntax
+      # into whitequark/parser gem's syntax tree.
+      class Builder < ::Parser::Builders::Default
+        # It represents the `it` block argument, which is not yet implemented in
+        # the Parser gem.
+        def itarg
+          n(:itarg, [:it], nil)
+        end
+
+        # The following three lines have been added to support the `it` block
+        # parameter syntax in the source code below.
+        #
+        #   if args.type == :itarg
+        #     block_type = :itblock
+        #     args = :it
+        #
+        # https://github.com/whitequark/parser/blob/v3.3.7.1/lib/parser/builders/default.rb#L1122-L1155
+        def block(method_call, begin_t, args, body, end_t)
+          _receiver, _selector, *call_args = *method_call
+
+          if method_call.type == :yield
+            diagnostic :error, :block_given_to_yield, nil, method_call.loc.keyword, [loc(begin_t)]
+          end
+
+          last_arg = call_args.last
+          if last_arg && (last_arg.type == :block_pass || last_arg.type == :forwarded_args)
+            diagnostic :error, :block_and_blockarg, nil, last_arg.loc.expression, [loc(begin_t)]
+          end
+
+          if args.type == :itarg
+            block_type = :itblock
+            args = :it
+          elsif args.type == :numargs
+            block_type = :numblock
+            args = args.children[0]
+          else
+            block_type = :block
+          end
+
+          if [:send, :csend, :index, :super, :zsuper, :lambda].include?(method_call.type)
+            n(block_type, [ method_call, args, body ],
+              block_map(method_call.loc.expression, begin_t, end_t))
+          else
+            # Code like "return foo 1 do end" is reduced in a weird sequence.
+            # Here, method_call is actually (return).
+            actual_send, = *method_call
+            block =
+              n(block_type, [ actual_send, args, body ],
+                block_map(actual_send.loc.expression, begin_t, end_t))
+
+            n(method_call.type, [ block ],
+              method_call.loc.with_expression(join_exprs(method_call, block)))
+          end
+        end
+
+        # def foo(&nil); end
+        #         ^^^^
+        def blocknilarg(amper_t, nil_t)
+          n0(:blocknilarg, arg_prefix_map(amper_t, nil_t))
+        end
+      end
+    end
+  end
+end
diff --git a/lib/prism/translation/parser/compiler.rb b/lib/prism/translation/parser/compiler.rb
index df5917ab26..d11db12ae6 100644
--- a/lib/prism/translation/parser/compiler.rb
+++ b/lib/prism/translation/parser/compiler.rb
@@ -1,13 +1,14 @@
 # frozen_string_literal: true
+# :markup: markdown
 
 module Prism
   module Translation
     class Parser
       # A visitor that knows how to convert a prism syntax tree into the
       # whitequark/parser gem's syntax tree.
-      class Compiler < ::Prism::Compiler
+      class Compiler < ::Prism::Compiler # :nodoc:
         # Raised when the tree is malformed or there is a bug in the compiler.
-        class CompilationError < StandardError
+        class CompilationError < StandardError # :nodoc:
         end
 
         # The Parser::Base instance that is being used to build the AST.
@@ -74,7 +75,29 @@ module Prism
         # []
         # ^^
         def visit_array_node(node)
-          builder.array(token(node.opening_loc), visit_all(node.elements), token(node.closing_loc))
+          if node.opening&.start_with?("%w", "%W", "%i", "%I")
+            elements = node.elements.flat_map do |element|
+              if element.is_a?(StringNode)
+                if element.content.include?("\n")
+                  string_nodes_from_line_continuations(element.unescaped, element.content, element.content_loc.start_offset, node.opening)
+                else
+                  [builder.string_internal([element.unescaped, srange(element.content_loc)])]
+                end
+              elsif element.is_a?(InterpolatedStringNode)
+                builder.string_compose(
+                  token(element.opening_loc),
+                  string_nodes_from_interpolation(element, node.opening),
+                  token(element.closing_loc)
+                )
+              else
+                [visit(element)]
+              end
+            end
+          else
+            elements = visit_all(node.elements)
+          end
+
+          builder.array(token(node.opening_loc), elements, token(node.closing_loc))
         end
 
         # foo => [bar]
@@ -109,10 +132,10 @@ module Prism
         # { a: 1 }
         #   ^^^^
         def visit_assoc_node(node)
-          if in_pattern
-            key = node.key
+          key = node.key
 
-            if node.value.is_a?(ImplicitNode)
+          if  node.value.is_a?(ImplicitNode)
+            if in_pattern
               if key.is_a?(SymbolNode)
                 if key.opening.nil?
                   builder.match_hash_var([key.unescaped, srange(key.location)])
@@ -123,30 +146,31 @@ module Prism
                 builder.match_hash_var_from_str(token(key.opening_loc), visit_all(key.parts), token(key.closing_loc))
               end
             else
-              builder.pair_keyword([key.unescaped, srange(key.location)], visit(node.value))
-            end
-          elsif node.value.is_a?(ImplicitNode)
-            if (value = node.value.value).is_a?(LocalVariableReadNode)
-              builder.pair_keyword(
-                [node.key.unescaped, srange(node.key)],
-                builder.ident([value.name, srange(node.key.value_loc)]).updated(:lvar)
-              )
-            else
-              builder.pair_label([node.key.unescaped, srange(node.key.location)])
+              value = node.value.value
+
+              implicit_value = if value.is_a?(CallNode)
+                builder.call_method(nil, nil, [value.name, srange(value.message_loc)])
+              elsif value.is_a?(ConstantReadNode)
+                builder.const([value.name, srange(key.value_loc)])
+              else
+                builder.ident([value.name, srange(key.value_loc)]).updated(:lvar)
+              end
+
+              builder.pair_keyword([key.unescaped, srange(key)], implicit_value)
             end
           elsif node.operator_loc
-            builder.pair(visit(node.key), token(node.operator_loc), visit(node.value))
-          elsif node.key.is_a?(SymbolNode) && node.key.opening_loc.nil?
-            builder.pair_keyword([node.key.unescaped, srange(node.key.location)], visit(node.value))
+            builder.pair(visit(key), token(node.operator_loc), visit(node.value))
+          elsif key.is_a?(SymbolNode) && key.opening_loc.nil?
+            builder.pair_keyword([key.unescaped, srange(key.location)], visit(node.value))
           else
             parts =
-              if node.key.is_a?(SymbolNode)
-                [builder.string_internal([node.key.unescaped, srange(node.key.value_loc)])]
+              if key.is_a?(SymbolNode)
+                [builder.string_internal([key.unescaped, srange(key.value_loc)])]
               else
-                visit_all(node.key.parts)
+                visit_all(key.parts)
               end
 
-            builder.pair_quoted(token(node.key.opening_loc), parts, token(node.key.closing_loc), visit(node.value))
+            builder.pair_quoted(token(key.opening_loc), parts, token(key.closing_loc), visit(node.value))
           end
         end
 
@@ -179,17 +203,24 @@ module Prism
           if (rescue_clause = node.rescue_clause)
             begin
               find_start_offset = (rescue_clause.reference&.location || rescue_clause.exceptions.last&.location || rescue_clause.keyword_loc).end_offset
-              find_end_offset = (rescue_clause.statements&.location&.start_offset || rescue_clause.consequent&.location&.start_offset || (find_start_offset + 1))
+              find_end_offset = (
+                rescue_clause.statements&.location&.start_offset ||
+                rescue_clause.subsequent&.location&.start_offset ||
+                node.else_clause&.location&.start_offset ||
+                node.ensure_clause&.location&.start_offset ||
+                node.end_keyword_loc&.start_offset ||
+                find_start_offset + 1
+              )
 
               rescue_bodies << builder.rescue_body(
                 token(rescue_clause.keyword_loc),
                 rescue_clause.exceptions.any? ? builder.array(nil, visit_all(rescue_clause.exceptions), nil) : nil,
                 token(rescue_clause.operator_loc),
                 visit(rescue_clause.reference),
-                srange_find(find_start_offset, find_end_offset, [";"]),
+                srange_semicolon(find_start_offset, find_end_offset),
                 visit(rescue_clause.statements)
               )
-            end until (rescue_clause = rescue_clause.consequent).nil?
+            end until (rescue_clause = rescue_clause.subsequent).nil?
           end
 
           begin_body =
@@ -266,11 +297,6 @@ module Prism
 
           if node.call_operator_loc.nil?
             case name
-            when :-@
-              case (receiver = node.receiver).type
-              when :integer_node, :float_node, :rational_node, :imaginary_node
-                return visit(numeric_negate(node.message_loc, receiver))
-              end
             when :!
               return visit_block(builder.not_op(token(node.message_loc), token(node.opening_loc), visit(node.receiver), token(node.closing_loc)), block)
             when :=~
@@ -292,7 +318,7 @@ module Prism
                       visit_all(arguments),
                       token(node.closing_loc),
                     ),
-                    srange_find(node.message_loc.end_offset, node.arguments.arguments.last.location.start_offset, ["="]),
+                    token(node.equal_loc),
                     visit(node.arguments.arguments.last)
                   ),
                   block
@@ -309,7 +335,7 @@ module Prism
             if name.end_with?("=") && !message_loc.slice.end_with?("=") && node.arguments && block.nil?
               builder.assign(
                 builder.attr_asgn(visit(node.receiver), call_operator, token(message_loc)),
-                srange_find(message_loc.end_offset, node.arguments.location.start_offset, ["="]),
+                token(node.equal_loc),
                 visit(node.arguments.arguments.last)
               )
             else
@@ -408,8 +434,8 @@ module Prism
             token(node.case_keyword_loc),
             visit(node.predicate),
             visit_all(node.conditions),
-            token(node.consequent&.else_keyword_loc),
-            visit(node.consequent),
+            token(node.else_clause&.else_keyword_loc),
+            visit(node.else_clause),
             token(node.end_keyword_loc)
           )
         end
@@ -421,8 +447,8 @@ module Prism
             token(node.case_keyword_loc),
             visit(node.predicate),
             visit_all(node.conditions),
-            token(node.consequent&.else_keyword_loc),
-            visit(node.consequent),
+            token(node.else_clause&.else_keyword_loc),
+            visit(node.else_clause),
             token(node.end_keyword_loc)
           )
         end
@@ -662,13 +688,37 @@ module Prism
         # defined?(a)
         # ^^^^^^^^^^^
         def visit_defined_node(node)
-          builder.keyword_cmd(
-            :defined?,
-            token(node.keyword_loc),
-            token(node.lparen_loc),
-            [visit(node.value)],
-            token(node.rparen_loc)
-          )
+          # Very weird circumstances here where something like:
+          #
+          #     defined?
+          #     (1)
+          #
+          # gets parsed in Ruby as having only the `1` expression but in parser
+          # it gets parsed as having a begin. In this case we need to synthesize
+          # that begin to match parser's behavior.
+          if node.lparen_loc && node.keyword_loc.join(node.lparen_loc).slice.include?("\n")
+            builder.keyword_cmd(
+              :defined?,
+              token(node.keyword_loc),
+              nil,
+              [
+                builder.begin(
+                  token(node.lparen_loc),
+                  visit(node.value),
+                  token(node.rparen_loc)
+                )
+              ],
+              nil
+            )
+          else
+            builder.keyword_cmd(
+              :defined?,
+              token(node.keyword_loc),
+              token(node.lparen_loc),
+              [visit(node.value)],
+              token(node.rparen_loc)
+            )
+          end
         end
 
         # if foo then bar else baz end
@@ -731,10 +781,10 @@ module Prism
             visit(node.index),
             token(node.in_keyword_loc),
             visit(node.collection),
-            if node.do_keyword_loc
-              token(node.do_keyword_loc)
+            if (do_keyword_loc = node.do_keyword_loc)
+              token(do_keyword_loc)
             else
-              srange_find(node.collection.location.end_offset, (node.statements&.location || node.end_keyword_loc).start_offset, [";"])
+              srange_semicolon(node.collection.location.end_offset, (node.statements&.location || node.end_keyword_loc).start_offset)
             end,
             visit(node.statements),
             token(node.end_keyword_loc)
@@ -856,26 +906,26 @@ module Prism
               visit(node.predicate),
               token(node.then_keyword_loc),
               visit(node.statements),
-              token(node.consequent.else_keyword_loc),
-              visit(node.consequent)
+              token(node.subsequent.else_keyword_loc),
+              visit(node.subsequent)
             )
           elsif node.if_keyword_loc.start_offset == node.location.start_offset
             builder.condition(
               token(node.if_keyword_loc),
               visit(node.predicate),
-              if node.then_keyword_loc
-                token(node.then_keyword_loc)
+              if (then_keyword_loc = node.then_keyword_loc)
+                token(then_keyword_loc)
               else
-                srange_find(node.predicate.location.end_offset, (node.statements&.location || node.consequent&.location || node.end_keyword_loc).start_offset, [";"])
+                srange_semicolon(node.predicate.location.end_offset, (node.statements&.location || node.subsequent&.location || node.end_keyword_loc).start_offset)
               end,
               visit(node.statements),
-              case node.consequent
+              case node.subsequent
               when IfNode
-                token(node.consequent.if_keyword_loc)
+                token(node.subsequent.if_keyword_loc)
               when ElseNode
-                token(node.consequent.else_keyword_loc)
+                token(node.subsequent.else_keyword_loc)
               end,
-              visit(node.consequent),
+              visit(node.subsequent),
               if node.if_keyword != "elsif"
                 token(node.end_keyword_loc)
               end
@@ -883,7 +933,7 @@ module Prism
           else
             builder.condition_mod(
               visit(node.statements),
-              visit(node.consequent),
+              visit(node.subsequent),
               token(node.if_keyword_loc),
               visit(node.predicate)
             )
@@ -929,7 +979,11 @@ module Prism
             token(node.in_loc),
             pattern,
             guard,
-            srange_find(node.pattern.location.end_offset, node.statements&.location&.start_offset, [";", "then"]),
+            if (then_loc = node.then_loc)
+              token(then_loc)
+            else
+              srange_semicolon(node.pattern.location.end_offset, node.statements&.location&.start_offset)
+            end,
             visit(node.statements)
           )
         end
@@ -994,7 +1048,7 @@ module Prism
           builder.index_asgn(
             visit(node.receiver),
             token(node.opening_loc),
-            visit_all(node.arguments.arguments),
+            visit_all(node.arguments&.arguments || []),
             token(node.closing_loc),
           )
         end
@@ -1062,7 +1116,7 @@ module Prism
         def visit_interpolated_regular_expression_node(node)
           builder.regexp_compose(
             token(node.opening_loc),
-            visit_all(node.parts),
+            string_nodes_from_interpolation(node, node.opening),
             [node.closing[0], srange_offsets(node.closing_loc.start_offset, node.closing_loc.start_offset + 1)],
             builder.regexp_options([node.closing[1..], srange_offsets(node.closing_loc.start_offset + 1, node.closing_loc.end_offset)])
           )
@@ -1079,29 +1133,9 @@ module Prism
             return visit_heredoc(node) { |children, closing| builder.string_compose(token(node.opening_loc), children, closing) }
           end
 
-          parts = if node.parts.one? { |part| part.type == :string_node }
-            node.parts.flat_map do |node|
-              if node.type == :string_node && node.unescaped.lines.count >= 2
-                start_offset = node.content_loc.start_offset
-
-                node.unescaped.lines.map do |line|
-                  end_offset = start_offset + line.length
-                  offsets = srange_offsets(start_offset, end_offset)
-                  start_offset = end_offset
-
-                  builder.string_internal([line, offsets])
-                end
-              else
-                visit(node)
-              end
-            end
-          else
-            visit_all(node.parts)
-          end
-
           builder.string_compose(
             token(node.opening_loc),
-            parts,
+            string_nodes_from_interpolation(node, node.opening),
             token(node.closing_loc)
           )
         end
@@ -1111,7 +1145,7 @@ module Prism
         def visit_interpolated_symbol_node(node)
           builder.symbol_compose(
             token(node.opening_loc),
-            visit_all(node.parts),
+            string_nodes_from_interpolation(node, node.opening),
             token(node.closing_loc)
           )
         end
@@ -1120,14 +1154,14 @@ module Prism
         # ^^^^^^^^^^^^
         def visit_interpolated_x_string_node(node)
           if node.heredoc?
-            visit_heredoc(node) { |children, closing| builder.xstring_compose(token(node.opening_loc), children, closing) }
-          else
-            builder.xstring_compose(
-              token(node.opening_loc),
-              visit_all(node.parts),
-              token(node.closing_loc)
-            )
+            return visit_heredoc(node) { |children, closing| builder.xstring_compose(token(node.opening_loc), children, closing) }
           end
+
+          builder.xstring_compose(
+            token(node.opening_loc),
+            string_nodes_from_interpolation(node, node.opening),
+            token(node.closing_loc)
+          )
         end
 
         # -> { it }
@@ -1139,7 +1173,17 @@ module Prism
         # -> { it }
         # ^^^^^^^^^
         def visit_it_parameters_node(node)
-          builder.args(nil, [], nil, false)
+          # FIXME: The builder _should_ always be a subclass of the prism builder.
+          # Currently RuboCop passes in its own builder that always inherits from the
+          # parser builder (which is lacking the `itarg` method). Once rubocop-ast
+          # opts in to use the custom prism builder a warning can be emitted when
+          # it is not the expected class, and eventually raise.
+          # https://github.com/rubocop/rubocop-ast/pull/354
+          if builder.is_a?(Translation::Parser::Builder)
+            builder.itarg
+          else
+            builder.args(nil, [], nil, false)
+          end
         end
 
         # foo(bar: baz)
@@ -1181,7 +1225,7 @@ module Prism
                 false
               )
             end,
-            node.body&.accept(copy_compiler(forwarding: implicit_parameters ? [] : find_forwarding(parameters&.parameters))),
+            visit(node.body),
             [node.closing, srange(node.closing_loc)]
           )
         end
@@ -1275,7 +1319,7 @@ module Prism
         # A node that is missing from the syntax tree. This is only used in the
         # case of a syntax error. The parser gem doesn't have such a concept, so
         # we invent our own here.
-        def visit_missing_node(node)
+        def visit_error_recovery_node(node)
           ::AST::Node.new(:missing, [], location: ::Parser::Source::Map.new(srange(node.location)))
         end
 
@@ -1293,13 +1337,9 @@ module Prism
         # foo, bar = baz
         # ^^^^^^^^
         def visit_multi_target_node(node)
-          elements = [*node.lefts]
-          elements << node.rest if !node.rest.nil? && !node.rest.is_a?(ImplicitRestNode)
-          elements.concat(node.rights)
-
           builder.multi_lhs(
             token(node.lparen_loc),
-            visit_all(elements),
+            visit_all(multi_target_elements(node)),
             token(node.rparen_loc)
           )
         end
@@ -1307,9 +1347,11 @@ module Prism
         # foo, bar = baz
         # ^^^^^^^^^^^^^^
         def visit_multi_write_node(node)
-          elements = [*node.lefts]
-          elements << node.rest if !node.rest.nil? && !node.rest.is_a?(ImplicitRestNode)
-          elements.concat(node.rights)
+          elements = multi_target_elements(node)
+
+          if elements.length == 1 && elements.first.is_a?(MultiTargetNode) && !node.rest
+            elements = multi_target_elements(elements.first)
+          end
 
           builder.multi_assign(
             builder.multi_lhs(
@@ -1343,6 +1385,12 @@ module Prism
           builder.nil(token(node.location))
         end
 
+        # def foo(&nil); end
+        #         ^^^^
+        def visit_no_block_parameter_node(node)
+          builder.blocknilarg(token(node.operator_loc), token(node.keyword_loc))
+        end
+
         # def foo(**nil); end
         #         ^^^^^
         def visit_no_keywords_parameter_node(node)
@@ -1435,7 +1483,8 @@ module Prism
         # foo => ^(bar)
         #        ^^^^^^
         def visit_pinned_expression_node(node)
-          expression = builder.begin(token(node.lparen_loc), visit(node.expression), token(node.rparen_loc))
+          parts = node.expression.accept(copy_compiler(in_pattern: false)) # Don't treat * and similar as match_rest
+          expression = builder.begin(token(node.lparen_loc), parts, token(node.rparen_loc))
           builder.pin(token(node.operator_loc), expression)
         end
 
@@ -1507,9 +1556,18 @@ module Prism
         # /foo/
         # ^^^^^
         def visit_regular_expression_node(node)
+          parts =
+            if node.content == ""
+              []
+            elsif node.content.include?("\n")
+              string_nodes_from_line_continuations(node.unescaped, node.content, node.content_loc.start_offset, node.opening)
+            else
+              [builder.string_internal([node.unescaped, srange(node.content_loc)])]
+            end
+
           builder.regexp_compose(
             token(node.opening_loc),
-            [builder.string_internal(token(node.content_loc))],
+            parts,
             [node.closing[0], srange_offsets(node.closing_loc.start_offset, node.closing_loc.start_offset + 1)],
             builder.regexp_options([node.closing[1..], srange_offsets(node.closing_loc.start_offset + 1, node.closing_loc.end_offset)])
           )
@@ -1661,28 +1719,11 @@ module Prism
           elsif node.opening&.start_with?("%") && node.unescaped.empty?
             builder.string_compose(token(node.opening_loc), [], token(node.closing_loc))
           else
-            content_lines = node.content.lines
-            unescaped_lines = node.unescaped.lines
-
             parts =
-              if content_lines.length <= 1 || unescaped_lines.length <= 1
-                [builder.string_internal([node.unescaped, srange(node.content_loc)])]
-              elsif content_lines.length != unescaped_lines.length
-                # This occurs when we have line continuations in the string. We
-                # need to come back and fix this, but for now this stops the
-                # code from breaking when we encounter it because of trying to
-                # transpose arrays of different lengths.
-                [builder.string_internal([node.unescaped, srange(node.content_loc)])]
+              if node.content.include?("\n")
+                string_nodes_from_line_continuations(node.unescaped, node.content, node.content_loc.start_offset, node.opening)
               else
-                start_offset = node.content_loc.start_offset
-
-                [content_lines, unescaped_lines].transpose.map do |content_line, unescaped_line|
-                  end_offset = start_offset + content_line.length
-                  offsets = srange_offsets(start_offset, end_offset)
-                  start_offset = end_offset
-
-                  builder.string_internal([unescaped_line, offsets])
-                end
+                [builder.string_internal([node.unescaped, srange(node.content_loc)])]
               end
 
             builder.string_compose(
@@ -1726,19 +1767,14 @@ module Prism
               builder.symbol([node.unescaped, srange(node.location)])
             end
           else
-            parts = if node.value.lines.one?
-              [builder.string_internal([node.unescaped, srange(node.value_loc)])]
-            else
-              start_offset = node.value_loc.start_offset
-
-              node.value.lines.map do |line|
-                end_offset = start_offset + line.length
-                offsets = srange_offsets(start_offset, end_offset)
-                start_offset = end_offset
-
-                builder.string_internal([line, offsets])
+            parts =
+              if node.value_loc.nil?
+                []
+              elsif node.value.include?("\n")
+                string_nodes_from_line_continuations(node.unescaped, node.value, node.value_loc.start_offset, node.opening)
+              else
+                [builder.string_internal([node.unescaped, srange(node.value_loc)])]
               end
-            end
 
             builder.symbol_compose(
               token(node.opening_loc),
@@ -1770,19 +1806,19 @@ module Prism
             builder.condition(
               token(node.keyword_loc),
               visit(node.predicate),
-              if node.then_keyword_loc
-                token(node.then_keyword_loc)
+              if (then_keyword_loc = node.then_keyword_loc)
+                token(then_keyword_loc)
               else
-                srange_find(node.predicate.location.end_offset, (node.statements&.location || node.consequent&.location || node.end_keyword_loc).start_offset, [";"])
+                srange_semicolon(node.predicate.location.end_offset, (node.statements&.location || node.else_clause&.location || node.end_keyword_loc).start_offset)
               end,
-              visit(node.consequent),
-              token(node.consequent&.else_keyword_loc),
+              visit(node.else_clause),
+              token(node.else_clause&.else_keyword_loc),
               visit(node.statements),
               token(node.end_keyword_loc)
             )
           else
             builder.condition_mod(
-              visit(node.consequent),
+              visit(node.else_clause),
               visit(node.statements),
               token(node.keyword_loc),
               visit(node.predicate)
@@ -1801,7 +1837,11 @@ module Prism
               :until,
               token(node.keyword_loc),
               visit(node.predicate),
-              srange_find(node.predicate.location.end_offset, (node.statements&.location || node.closing_loc).start_offset, [";", "do"]),
+              if (do_keyword_loc = node.do_keyword_loc)
+                token(do_keyword_loc)
+              else
+                srange_semicolon(node.predicate.location.end_offset, (node.statements&.location || node.closing_loc).start_offset)
+              end,
               visit(node.statements),
               token(node.closing_loc)
             )
@@ -1821,10 +1861,10 @@ module Prism
           builder.when(
             token(node.keyword_loc),
             visit_all(node.conditions),
-            if node.then_keyword_loc
-              token(node.then_keyword_loc)
+            if (then_keyword_loc = node.then_keyword_loc)
+              token(then_keyword_loc)
             else
-              srange_find(node.conditions.last.location.end_offset, node.statements&.location&.start_offset, [";"])
+              srange_semicolon(node.conditions.last.location.end_offset, node.statements&.location&.start_offset)
             end,
             visit(node.statements)
           )
@@ -1841,7 +1881,11 @@ module Prism
               :while,
               token(node.keyword_loc),
               visit(node.predicate),
-              srange_find(node.predicate.location.end_offset, (node.statements&.location || node.closing_loc).start_offset, [";", "do"]),
+              if (do_keyword_loc = node.do_keyword_loc)
+                token(do_keyword_loc)
+              else
+                srange_semicolon(node.predicate.location.end_offset, (node.statements&.location || node.closing_loc).start_offset)
+              end,
               visit(node.statements),
               token(node.closing_loc)
             )
@@ -1859,28 +1903,23 @@ module Prism
         # ^^^^^
         def visit_x_string_node(node)
           if node.heredoc?
-            visit_heredoc(node.to_interpolated) { |children, closing| builder.xstring_compose(token(node.opening_loc), children, closing) }
-          else
-            parts = if node.unescaped.lines.one?
-              [builder.string_internal([node.unescaped, srange(node.content_loc)])]
-            else
-              start_offset = node.content_loc.start_offset
-
-              node.unescaped.lines.map do |line|
-                end_offset = start_offset + line.length
-                offsets = srange_offsets(start_offset, end_offset)
-                start_offset = end_offset
+            return visit_heredoc(node.to_interpolated) { |children, closing| builder.xstring_compose(token(node.opening_loc), children, closing) }
+          end
 
-                builder.string_internal([line, offsets])
-              end
+          parts =
+            if node.content == ""
+              []
+            elsif node.content.include?("\n")
+              string_nodes_from_line_continuations(node.unescaped, node.content, node.content_loc.start_offset, node.opening)
+            else
+              [builder.string_internal([node.unescaped, srange(node.content_loc)])]
             end
 
-            builder.xstring_compose(
-              token(node.opening_loc),
-              parts,
-              token(node.closing_loc)
-            )
-          end
+          builder.xstring_compose(
+            token(node.opening_loc),
+            parts,
+            token(node.closing_loc)
+          )
         end
 
         # yield
@@ -1921,20 +1960,12 @@ module Prism
           forwarding
         end
 
-        # Negate the value of a numeric node. This is a special case where you
-        # have a negative sign on one line and then a number on the next line.
-        # In normal Ruby, this will always be a method call. The parser gem,
-        # however, marks this as a numeric literal. We have to massage the tree
-        # here to get it into the correct form.
-        def numeric_negate(message_loc, receiver)
-          case receiver.type
-          when :integer_node, :float_node
-            receiver.copy(value: -receiver.value, location: message_loc.join(receiver.location))
-          when :rational_node
-            receiver.copy(numerator: -receiver.numerator, location: message_loc.join(receiver.location))
-          when :imaginary_node
-            receiver.copy(numeric: numeric_negate(message_loc, receiver.numeric), location: message_loc.join(receiver.location))
-          end
+        # Returns the set of targets for a MultiTargetNode or a MultiWriteNode.
+        def multi_target_elements(node)
+          elements = [*node.lefts]
+          elements << node.rest if !node.rest.nil? && !node.rest.is_a?(ImplicitRestNode)
+          elements.concat(node.rights)
+          elements
         end
 
         # Blocks can have a special set of parameters that automatically expand
@@ -1966,18 +1997,16 @@ module Prism
           Range.new(source_buffer, offset_cache[start_offset], offset_cache[end_offset])
         end
 
-        # Constructs a new source range by finding the given tokens between the
-        # given start offset and end offset. If the needle is not found, it
-        # returns nil. Importantly it does not search past newlines or comments.
+        # Constructs a new source range by finding a semicolon between the given
+        # start offset and end offset. If the semicolon is not found, it returns
+        # nil. Importantly it does not search past newlines or comments.
         #
         # Note that end_offset is allowed to be nil, in which case this will
         # search until the end of the string.
-        def srange_find(start_offset, end_offset, tokens)
-          if (match = source_buffer.source.byteslice(start_offset...end_offset).match(/(\s*)(#{tokens.join("|")})/))
-            _, whitespace, token = *match
-            token_offset = start_offset + whitespace.bytesize
-
-            [token, Range.new(source_buffer, offset_cache[token_offset], offset_cache[token_offset + token.bytesize])]
+        def srange_semicolon(start_offset, end_offset)
+          if (match = source_buffer.source.byteslice(start_offset...end_offset)[/\A\s*;/])
+            final_offset = start_offset + match.bytesize
+            [";", Range.new(source_buffer, offset_cache[final_offset - 1], offset_cache[final_offset])]
           end
         end
 
@@ -2013,7 +2042,7 @@ module Prism
                   false
                 )
               end,
-              block.body&.accept(copy_compiler(forwarding: implicit_parameters ? [] : find_forwarding(parameters&.parameters))),
+              visit(block.body),
               token(block.closing_loc)
             )
           else
@@ -2037,26 +2066,8 @@ module Prism
 
           node.parts.each do |part|
             pushing =
-              if part.is_a?(StringNode) && part.unescaped.include?("\n")
-                unescaped = part.unescaped.lines(chomp: true)
-                escaped = part.content.lines(chomp: true)
-
-                escaped_lengths =
-                  if node.opening.end_with?("'")
-                    escaped.map { |line| line.bytesize + 1 }
-                  else
-                    escaped.chunk_while { |before, after| before.match?(/(?<!\\)\\$/) }.map { |line| line.join.bytesize + line.length }
-                  end
-
-                start_offset = part.location.start_offset
-                end_offset = nil
-
-                unescaped.zip(escaped_lengths).map do |unescaped_line, escaped_length|
-                  end_offset = start_offset + (escaped_length || 0)
-                  inner_part = builder.string_internal(["#{unescaped_line}\n", srange_offsets(start_offset, end_offset)])
-                  start_offset = end_offset
-                  inner_part
-                end
+              if part.is_a?(StringNode) && part.content.include?("\n")
+                string_nodes_from_line_continuations(part.unescaped, part.content, part.location.start_offset, node.opening)
               else
                 [visit(part)]
               end
@@ -2065,7 +2076,12 @@ module Prism
               if child.type == :str && child.children.last == ""
                 # nothing
               elsif child.type == :str && children.last && children.last.type == :str && !children.last.children.first.end_with?("\n")
-                children.last.children.first << child.children.first
+                appendee = children[-1]
+
+                location = appendee.loc
+                location = location.with_expression(location.expression.join(child.loc.expression))
+
+                children[-1] = appendee.updated(:str, ["#{appendee.children.first}#{child.children.first}"], location: location)
               else
                 children << child
               end
@@ -2101,6 +2117,102 @@ module Prism
             parser.pattern_variables.pop
           end
         end
+
+        # When the content of a string node is split across multiple lines, the
+        # parser gem creates individual string nodes for each line the content is part of.
+        def string_nodes_from_interpolation(node, opening)
+          node.parts.flat_map do |part|
+            if part.type == :string_node && part.content.include?("\n") && part.opening_loc.nil?
+              string_nodes_from_line_continuations(part.unescaped, part.content, part.content_loc.start_offset, opening)
+            else
+              visit(part)
+            end
+          end
+        end
+
+        # Create parser string nodes from a single prism node. The parser gem
+        # "glues" strings together when a line continuation is encountered.
+        def string_nodes_from_line_continuations(unescaped, escaped, start_offset, opening)
+          unescaped = unescaped.lines
+          escaped = escaped.lines
+          percent_array = opening&.start_with?("%w", "%W", "%i", "%I")
+          regex = opening == "/" || opening&.start_with?("%r")
+
+          # Non-interpolating strings
+          if opening&.end_with?("'") || opening&.start_with?("%q", "%s", "%w", "%i")
+            current_length = 0
+            current_line = +""
+
+            escaped.filter_map.with_index do |escaped_line, index|
+              unescaped_line = unescaped.fetch(index, "")
+              current_length += escaped_line.bytesize
+              current_line << unescaped_line
+
+              # Glue line continuations together. Only %w and %i arrays can contain these.
+              if percent_array && escaped_line[/(\\)*\n$/, 1]&.length&.odd?
+                next unless index == escaped.count - 1
+              end
+              s = builder.string_internal([current_line, srange_offsets(start_offset, start_offset + current_length)])
+              start_offset += escaped_line.bytesize
+              current_line = +""
+              current_length = 0
+              s
+            end
+          else
+            escaped_lengths = []
+            normalized_lengths = []
+            # Keeps track of where an unescaped line should start a new token. An unescaped
+            # \n would otherwise be indistinguishable from the actual newline at the end of
+            # of the line. The parser gem only emits a new string node at "real" newlines,
+            # line continuations don't start a new node as well.
+            do_next_tokens = []
+
+            escaped
+              .chunk_while { |before, after| before[/(\\*)\r?\n$/, 1]&.length&.odd? || false }
+              .each do |lines|
+                escaped_lengths << lines.sum(&:bytesize)
+
+                unescaped_lines_count =
+                  if regex
+                    0 # Will always be preserved as is
+                  else
+                    lines.sum do |line|
+                      count = line.scan(/(\\*)n/).count { |(backslashes)| backslashes&.length&.odd? }
+                      count -= 1 if line.match?(/(?:\A|[^\\])(?:\\\\)*\\n\z/) && count > 0
+                      count
+                    end
+                  end
+
+                extra = 1
+                extra = lines.count if percent_array # Account for line continuations in percent arrays
+
+                normalized_lengths.concat(Array.new(unescaped_lines_count + extra, 0))
+                normalized_lengths[-1] = lines.sum { |line| line.bytesize }
+                do_next_tokens.concat(Array.new(unescaped_lines_count + extra, false))
+                do_next_tokens[-1] = true
+              end
+
+            current_line = +""
+            current_normalized_length = 0
+
+            emitted_count = 0
+            unescaped.filter_map.with_index do |unescaped_line, index|
+              current_line << unescaped_line
+              current_normalized_length += normalized_lengths.fetch(index, 0)
+
+              if do_next_tokens[index]
+                inner_part = builder.string_internal([current_line, srange_offsets(start_offset, start_offset + current_normalized_length)])
+                start_offset += escaped_lengths.fetch(emitted_count, 0)
+                current_line = +""
+                current_normalized_length = 0
+                emitted_count += 1
+                inner_part
+              else
+                nil
+              end
+            end
+          end
+        end
       end
     end
   end
diff --git a/lib/prism/translation/parser/lexer.rb b/lib/prism/translation/parser/lexer.rb
index 9d7caae0ba..e82042867f 100644
--- a/lib/prism/translation/parser/lexer.rb
+++ b/lib/prism/translation/parser/lexer.rb
@@ -1,21 +1,25 @@
 # frozen_string_literal: true
+# :markup: markdown
+
+require "strscan"
+require_relative "../../polyfill/append_as_bytes"
+require_relative "../../polyfill/scan_byte"
 
 module Prism
   module Translation
     class Parser
       # Accepts a list of prism tokens and converts them into the expected
       # format for the parser gem.
-      class Lexer
+      class Lexer # :nodoc:
+        # These tokens are always skipped
+        TYPES_ALWAYS_SKIP = Set.new(%i[IGNORED_NEWLINE __END__ EOF])
+        private_constant :TYPES_ALWAYS_SKIP
+
         # The direct translating of types between the two lexers.
         TYPES = {
           # These tokens should never appear in the output of the lexer.
-          EOF: nil,
-          MISSING: nil,
-          NOT_PROVIDED: nil,
-          IGNORED_NEWLINE: nil,
           EMBDOC_END: nil,
           EMBDOC_LINE: nil,
-          __END__: nil,
 
           # These tokens have more or less direct mappings.
           AMPERSAND: :tAMPER2,
@@ -83,6 +87,7 @@ module Prism
           KEYWORD_DEF: :kDEF,
           KEYWORD_DEFINED: :kDEFINED,
           KEYWORD_DO: :kDO,
+          KEYWORD_DO_BLOCK: :kDO_BLOCK,
           KEYWORD_DO_LOOP: :kDO_COND,
           KEYWORD_END: :kEND,
           KEYWORD_END_UPCASE: :klEND,
@@ -134,7 +139,7 @@ module Prism
           MINUS_GREATER: :tLAMBDA,
           NEWLINE: :tNL,
           NUMBERED_REFERENCE: :tNTH_REF,
-          PARENTHESIS_LEFT: :tLPAREN,
+          PARENTHESIS_LEFT: :tLPAREN2,
           PARENTHESIS_LEFT_PARENTHESES: :tLPAREN_ARG,
           PARENTHESIS_RIGHT: :tRPAREN,
           PERCENT: :tPERCENT,
@@ -173,7 +178,7 @@ module Prism
           UMINUS_NUM: :tUNARY_NUM,
           UPLUS: :tUPLUS,
           USTAR: :tSTAR,
-          USTAR_STAR: :tPOW,
+          USTAR_STAR: :tDSTAR,
           WORDS_SEP: :tSPACE
         }
 
@@ -184,10 +189,31 @@ module Prism
         # without them. We should find another way to do this, but in the
         # meantime we'll hide them from the documentation and mark them as
         # private constants.
-        EXPR_BEG = 0x1 # :nodoc:
-        EXPR_LABEL = 0x400 # :nodoc:
+        EXPR_BEG = 0x1
+        EXPR_LABEL = 0x400
+
+        # It is used to determine whether `do` is of the token type `kDO` or `kDO_LAMBDA`.
+        #
+        # NOTE: In edge cases like `-> (foo = -> (bar) {}) do end`, please note that `kDO` is still returned
+        # instead of `kDO_LAMBDA`, which is expected: https://github.com/ruby/prism/pull/3046
+        LAMBDA_TOKEN_TYPES = Set.new([:kDO_LAMBDA, :tLAMBDA, :tLAMBEG])
+
+        # The `PARENTHESIS_LEFT` token in Prism is classified as either `tLPAREN` or `tLPAREN2` in the Parser gem.
+        # The following token types are listed as those classified as `tLPAREN`.
+        LPAREN_CONVERSION_TOKEN_TYPES = Set.new([
+          :kBREAK, :tCARET, :kCASE, :tDIVIDE, :kFOR, :kIF, :kNEXT, :kRETURN, :kUNTIL, :kWHILE, :tAMPER, :tANDOP, :tBANG, :tCOMMA, :tDOT2, :tDOT3,
+          :tEQL, :tLPAREN, :tLPAREN2, :tLPAREN_ARG, :tLSHFT, :tNL, :tOP_ASGN, :tOROP, :tPIPE, :tSEMI, :tSTRING_DBEG, :tUMINUS, :tUPLUS, :tLCURLY
+        ])
 
-        private_constant :TYPES, :EXPR_BEG, :EXPR_LABEL
+        # Types of tokens that are allowed to continue a method call with comments in-between.
+        # For these, the parser gem doesn't emit a newline token after the last comment.
+        COMMENT_CONTINUATION_TYPES = Set.new([:COMMENT, :AMPERSAND_DOT, :DOT])
+        private_constant :COMMENT_CONTINUATION_TYPES
+
+        # Heredocs are complex and require us to keep track of a bit of info to refer to later
+        HeredocData = Struct.new(:identifier, :common_whitespace, keyword_init: true)
+
+        private_constant :TYPES, :EXPR_BEG, :EXPR_LABEL, :LAMBDA_TOKEN_TYPES, :LPAREN_CONVERSION_TOKEN_TYPES, :HeredocData
 
         # The Parser::Source::Buffer that the tokens were lexed from.
         attr_reader :source_buffer
@@ -207,7 +233,7 @@ module Prism
           @offset_cache = offset_cache
         end
 
-        Range = ::Parser::Source::Range # :nodoc:
+        Range = ::Parser::Source::Range
         private_constant :Range
 
         # Convert the prism tokens into the expected format for the parser gem.
@@ -217,39 +243,78 @@ module Prism
           index = 0
           length = lexed.length
 
-          heredoc_identifier_stack = []
+          heredoc_stack = []
+          quote_stack = []
+
+          # The parser gem emits the newline tokens for comments out of order. This saves
+          # that token location to emit at a later time to properly line everything up.
+          # https://github.com/whitequark/parser/issues/1025
+          comment_newline_location = nil
 
           while index < length
             token, state = lexed[index]
             index += 1
-            next if %i[IGNORED_NEWLINE __END__ EOF].include?(token.type)
+            next if TYPES_ALWAYS_SKIP.include?(token.type)
 
             type = TYPES.fetch(token.type)
             value = token.value
-            location = Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[token.location.end_offset])
+            location = range(token.location.start_offset, token.location.end_offset)
 
             case type
+            when :kDO
+              nearest_lambda_token = tokens.reverse_each.find do |token|
+                LAMBDA_TOKEN_TYPES.include?(token.first)
+              end
+
+              if nearest_lambda_token&.first == :tLAMBDA
+                type = :kDO_LAMBDA
+              end
             when :tCHARACTER
               value.delete_prefix!("?")
+              # Character literals behave similar to double-quoted strings. We can use the same escaping mechanism.
+              value = unescape_string(value, "?")
             when :tCOMMENT
               if token.type == :EMBDOC_BEGIN
-                start_index = index
 
-                while !((next_token = lexed[index][0]) && next_token.type == :EMBDOC_END) && (index < length - 1)
+                while !((next_token = lexed[index]&.first) && next_token.type == :EMBDOC_END) && (index < length - 1)
                   value += next_token.value
                   index += 1
                 end
 
-                if start_index != index
-                  value += next_token.value
-                  location = Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[lexed[index][0].location.end_offset])
-                  index += 1
-                end
+                value += next_token.value
+                location = range(token.location.start_offset, next_token.location.end_offset)
+                index += 1
               else
-                value.chomp!
-                location = Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[token.location.end_offset - 1])
+                is_at_eol = value.chomp!.nil?
+                location = range(token.location.start_offset, token.location.end_offset + (is_at_eol ? 0 : -1))
+
+                prev_token, _ = lexed[index - 2] if index - 2 >= 0
+                next_token, _ = lexed[index]
+
+                is_inline_comment = prev_token&.location&.start_line == token.location.start_line
+                if is_inline_comment && !is_at_eol && !COMMENT_CONTINUATION_TYPES.include?(next_token&.type)
+                  tokens << [:tCOMMENT, [value, location]]
+
+                  nl_location = range(token.location.end_offset - 1, token.location.end_offset)
+                  tokens << [:tNL, [nil, nl_location]]
+                  next
+                elsif is_inline_comment && next_token&.type == :COMMENT
+                  comment_newline_location = range(token.location.end_offset - 1, token.location.end_offset)
+                elsif comment_newline_location && !COMMENT_CONTINUATION_TYPES.include?(next_token&.type)
+                  tokens << [:tCOMMENT, [value, location]]
+                  tokens << [:tNL, [nil, comment_newline_location]]
+                  comment_newline_location = nil
+                  next
+                end
               end
             when :tNL
+              next_token, _ = lexed[index]
+              # Newlines after comments are emitted out of order.
+              if next_token&.type == :COMMENT
+                comment_newline_location = location
+                next
+              end
+
               value = nil
             when :tFLOAT
               value = parse_float(value)
@@ -257,8 +322,8 @@ module Prism
               value = parse_complex(value)
             when :tINTEGER
               if value.start_with?("+")
-                tokens << [:tUNARY_NUM, ["+", Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[token.location.start_offset + 1])]]
-                location = Range.new(source_buffer, offset_cache[token.location.start_offset + 1], offset_cache[token.location.end_offset])
+                tokens << [:tUNARY_NUM, ["+", range(token.location.start_offset, token.location.start_offset + 1)]]
+                location = range(token.location.start_offset + 1, token.location.end_offset)
               end
 
               value = parse_integer(value)
@@ -268,6 +333,8 @@ module Prism
               value.chomp!(":")
             when :tLCURLY
               type = :tLBRACE if state == EXPR_BEG | EXPR_LABEL
+            when :tLPAREN2
+              type = :tLPAREN if tokens.empty? || LPAREN_CONVERSION_TOKEN_TYPES.include?(tokens.dig(-1, 0))
             when :tNTH_REF
               value = parse_integer(value.delete_prefix("$"))
             when :tOP_ASGN
@@ -275,92 +342,196 @@ module Prism
             when :tRATIONAL
               value = parse_rational(value)
             when :tSPACE
+              location = range(token.location.start_offset, token.location.start_offset + percent_array_leading_whitespace(value))
               value = nil
             when :tSTRING_BEG
-              if token.type == :HEREDOC_START
-                heredoc_identifier_stack.push(value.match(/<<[-~]?["'`]?(?<heredoc_identifier>.*?)["'`]?\z/)[:heredoc_identifier])
-              end
-              if ["\"", "'"].include?(value) && (next_token = lexed[index][0]) && next_token.type == :STRING_END
+              next_token, _ = lexed[index]
+              next_next_token, _ = lexed[index + 1]
+              basic_quotes = value == '"' || value == "'"
+
+              if basic_quotes && next_token&.type == :STRING_END
                 next_location = token.location.join(next_token.location)
                 type = :tSTRING
                 value = ""
-                location = Range.new(source_buffer, offset_cache[next_location.start_offset], offset_cache[next_location.end_offset])
+                location = range(next_location.start_offset, next_location.end_offset)
                 index += 1
-              elsif ["\"", "'"].include?(value) && (next_token = lexed[index][0]) && next_token.type == :STRING_CONTENT && next_token.value.lines.count <= 1 && (next_next_token = lexed[index + 1][0]) && next_next_token.type == :STRING_END
-                next_location = token.location.join(next_next_token.location)
-                type = :tSTRING
-                value = next_token.value.gsub("\\\\", "\\")
-                location = Range.new(source_buffer, offset_cache[next_location.start_offset], offset_cache[next_location.end_offset])
-                index += 2
-              elsif value.start_with?("<<")
+              elsif value.start_with?("'", '"', "%")
+                if next_token&.type == :STRING_CONTENT && next_next_token&.type == :STRING_END
+                  string_value = next_token.value
+                  if simplify_string?(string_value, value)
+                    next_location = token.location.join(next_next_token.location)
+                    if percent_array?(value)
+                      value = percent_array_unescape(string_value)
+                    else
+                      value = unescape_string(string_value, value)
+                    end
+                    type = :tSTRING
+                    location = range(next_location.start_offset, next_location.end_offset)
+                    index += 2
+                    tokens << [type, [value, location]]
+
+                    next
+                  end
+                end
+
+                quote_stack.push(value)
+              elsif token.type == :HEREDOC_START
                 quote = value[2] == "-" || value[2] == "~" ? value[3] : value[2]
+                heredoc_type = value[2] == "-" || value[2] == "~" ? value[2] : ""
+                heredoc = HeredocData.new(
+                  identifier: value.match(/<<[-~]?["'`]?(?<heredoc_identifier>.*?)["'`]?\z/)[:heredoc_identifier],
+                  common_whitespace: 0,
+                )
+
                 if quote == "`"
                   type = :tXSTRING_BEG
-                  value = "<<`"
+                end
+
+                # The parser gem trims whitespace from squiggly heredocs. We must record
+                # the most common whitespace to later remove.
+                if heredoc_type == "~" || heredoc_type == "`"
+                  heredoc.common_whitespace = calculate_heredoc_whitespace(index)
+                end
+
+                if quote == "'" || quote == '"' || quote == "`"
+                  value = "<<#{quote}"
                 else
-                  value = "<<#{quote == "'" || quote == "\"" ? quote : "\""}"
+                  value = '<<"'
                 end
+
+                heredoc_stack.push(heredoc)
+                quote_stack.push(value)
               end
             when :tSTRING_CONTENT
-              unless (lines = token.value.lines).one?
-                start_offset = offset_cache[token.location.start_offset]
-                lines.map do |line|
-                  newline = line.end_with?("\r\n") ? "\r\n" : "\n"
+              is_percent_array = percent_array?(quote_stack.last)
+
+              if (lines = token.value.lines).one?
+                # Prism usually emits a single token for strings with line continuations.
+                # For squiggly heredocs they are not joined so we do that manually here.
+                current_string = +""
+                current_length = 0
+                start_offset = token.location.start_offset
+                while token.type == :STRING_CONTENT
+                  current_length += token.value.bytesize
+                  # Heredoc interpolation can have multiple STRING_CONTENT nodes on the same line.
+                  prev_token, _ = lexed[index - 2] if index - 2 >= 0
+                  is_first_token_on_line = prev_token && token.location.start_line != prev_token.location.start_line
+                  # The parser gem only removes indentation when the heredoc is not nested
+                  not_nested = heredoc_stack.size == 1
+                  if is_percent_array
+                    value = percent_array_unescape(token.value)
+                  elsif is_first_token_on_line && not_nested && (current_heredoc = heredoc_stack.last).common_whitespace > 0
+                    value = trim_heredoc_whitespace(token.value, current_heredoc)
+                  end
+
+                  current_string << unescape_string(value, quote_stack.last)
+                  relevant_backslash_count = if quote_stack.last.start_with?("%W", "%I")
+                                               0 # the last backslash escapes the newline
+                                             else
+                                               token.value[/(\\{1,})\n/, 1]&.length || 0
+                                             end
+                  if relevant_backslash_count.even? || !interpolation?(quote_stack.last)
+                    tokens << [:tSTRING_CONTENT, [current_string, range(start_offset, start_offset + current_length)]]
+                    break
+                  end
+                  token, _ = lexed[index]
+                  index += 1
+                end
+              else
+                # When the parser gem encounters a line continuation inside of a multiline string,
+                # it emits a single string node. The backslash (and remaining newline) is removed.
+                current_line = +""
+                adjustment = 0
+                start_offset = token.location.start_offset
+                emit = false
+
+                lines.each.with_index do |line, index|
                   chomped_line = line.chomp
-                  if match = chomped_line.match(/(?<backslashes>\\+)\z/)
-                    adjustment = match[:backslashes].size / 2
-                    adjusted_line = chomped_line.delete_suffix("\\" * adjustment)
-                    if match[:backslashes].size.odd?
-                      adjusted_line.delete_suffix!("\\")
-                      adjustment += 2
+                  backslash_count = chomped_line[/\\{1,}\z/]&.length || 0
+                  is_interpolation = interpolation?(quote_stack.last)
+
+                  if backslash_count.odd? && (is_interpolation || is_percent_array)
+                    if is_percent_array
+                      current_line << percent_array_unescape(line)
+                      adjustment += 1
                     else
-                      adjusted_line << newline
+                      chomped_line.delete_suffix!("\\")
+                      current_line << chomped_line
+                      adjustment += 2
                     end
+                    # If the string ends with a line continuation emit the remainder
+                    emit = index == lines.count - 1
                   else
-                    adjusted_line = line
-                    adjustment = 0
+                    current_line << line
+                    emit = true
                   end
 
-                  end_offset = start_offset + adjusted_line.length + adjustment
-                  tokens << [:tSTRING_CONTENT, [adjusted_line, Range.new(source_buffer, offset_cache[start_offset], offset_cache[end_offset])]]
-                  start_offset = end_offset
+                  if emit
+                    end_offset = start_offset + current_line.bytesize + adjustment
+                    tokens << [:tSTRING_CONTENT, [unescape_string(current_line, quote_stack.last), range(start_offset, end_offset)]]
+                    start_offset = end_offset
+                    current_line = +""
+                    adjustment = 0
+                  end
                 end
-                next
               end
+              next
             when :tSTRING_DVAR
               value = nil
             when :tSTRING_END
               if token.type == :HEREDOC_END && value.end_with?("\n")
                 newline_length = value.end_with?("\r\n") ? 2 : 1
-                value = heredoc_identifier_stack.pop
-                location = Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[token.location.end_offset - newline_length])
+                value = heredoc_stack.pop.identifier
+                location = range(token.location.start_offset, token.location.end_offset - newline_length)
               elsif token.type == :REGEXP_END
                 value = value[0]
-                location = Range.new(source_buffer, offset_cache[token.location.start_offset], offset_cache[token.location.start_offset + 1])
+                location = range(token.location.start_offset, token.location.start_offset + 1)
+              end
+
+              if percent_array?(quote_stack.pop)
+                prev_token, _ = lexed[index - 2] if index - 2 >= 0
+                empty = %i[PERCENT_LOWER_I PERCENT_LOWER_W PERCENT_UPPER_I PERCENT_UPPER_W].include?(prev_token&.type)
+                ends_with_whitespace = prev_token&.type == :WORDS_SEP
+                # parser always emits a space token after content in a percent array, even if no actual whitespace is present.
+                if !empty && !ends_with_whitespace
+                  tokens << [:tSPACE, [nil, range(token.location.start_offset, token.location.start_offset)]]
+                end
               end
             when :tSYMBEG
-              if (next_token = lexed[index][0]) && next_token.type != :STRING_CONTENT && next_token.type != :EMBEXPR_BEGIN && next_token.type != :EMBVAR
+              if (next_token = lexed[index]&.first) && next_token.type != :STRING_CONTENT && next_token.type != :EMBEXPR_BEGIN && next_token.type != :EMBVAR && next_token.type != :STRING_END
                 next_location = token.location.join(next_token.location)
                 type = :tSYMBOL
                 value = next_token.value
                 value = { "~@" => "~", "!@" => "!" }.fetch(value, value)
-                location = Range.new(source_buffer, offset_cache[next_location.start_offset], offset_cache[next_location.end_offset])
+                location = range(next_location.start_offset, next_location.end_offset)
                 index += 1
+              else
+                quote_stack.push(value)
               end
             when :tFID
               if !tokens.empty? && tokens.dig(-1, 0) == :kDEF
                 type = :tIDENTIFIER
               end
             when :tXSTRING_BEG
-              if (next_token = lexed[index][0]) && next_token.type != :STRING_CONTENT && next_token.type != :STRING_END
+              if (next_token = lexed[index]&.first) && !%i[STRING_CONTENT STRING_END EMBEXPR_BEGIN].include?(next_token.type)
+                # self.`()
                 type = :tBACK_REF2
               end
+              quote_stack.push(value)
+            when :tSYMBOLS_BEG, :tQSYMBOLS_BEG, :tWORDS_BEG, :tQWORDS_BEG
+              if (next_token = lexed[index]&.first) && next_token.type == :WORDS_SEP
+                index += 1
+              end
+
+              quote_stack.push(value)
+            when :tREGEXP_BEG
+              quote_stack.push(value)
             end
 
             tokens << [type, [value, location]]
 
             if token.type == :REGEXP_END
-              tokens << [:tREGEXP_OPT, [token.value[1..], Range.new(source_buffer, offset_cache[token.location.start_offset + 1], offset_cache[token.location.end_offset])]]
+              tokens << [:tREGEXP_OPT, [token.value[1..], range(token.location.start_offset + 1, token.location.end_offset)]]
             end
           end
 
@@ -369,6 +540,11 @@ module Prism
 
         private
 
+        # Creates a new parser range, taking prisms byte offsets into account
+        def range(start_offset, end_offset)
+          Range.new(source_buffer, offset_cache[start_offset], offset_cache[end_offset])
+        end
+
         # Parse an integer from the string representation.
         def parse_integer(value)
           Integer(value)
@@ -410,6 +586,233 @@ module Prism
         rescue ArgumentError
           0r
         end
+
+        # Wonky heredoc tab/spaces rules.
+        # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L10548-L10558
+        def calculate_heredoc_whitespace(heredoc_token_index)
+          next_token_index = heredoc_token_index
+          nesting_level = 0
+          previous_line = -1
+          result = Float::MAX
+
+          while (next_token = lexed[next_token_index]&.first)
+            next_token_index += 1
+            next_next_token, _ = lexed[next_token_index]
+            first_token_on_line = next_token.location.start_column == 0
+
+            # String content inside nested heredocs and interpolation is ignored
+            if next_token.type == :HEREDOC_START || next_token.type == :EMBEXPR_BEGIN
+              # When interpolation is the first token of a line there is no string
+              # content to check against. There will be no common whitespace.
+              if nesting_level == 0 && first_token_on_line
+                result = 0
+              end
+              nesting_level += 1
+            elsif next_token.type == :HEREDOC_END || next_token.type == :EMBEXPR_END
+              nesting_level -= 1
+              # When we encountered the matching heredoc end, we can exit
+              break if nesting_level == -1
+            elsif next_token.type == :STRING_CONTENT && nesting_level == 0 && first_token_on_line
+              common_whitespace = 0
+              next_token.value[/^\s*/].each_char do |char|
+                if char == "\t"
+                  common_whitespace = (common_whitespace / 8 + 1) * 8;
+                else
+                  common_whitespace += 1
+                end
+              end
+
+              is_first_token_on_line = next_token.location.start_line != previous_line
+              # Whitespace is significant if followed by interpolation
+              whitespace_only = common_whitespace == next_token.value.length && next_next_token&.location&.start_line != next_token.location.start_line
+              if is_first_token_on_line && !whitespace_only && common_whitespace < result
+                result = common_whitespace
+                previous_line = next_token.location.start_line
+              end
+            end
+          end
+          result
+        end
+
+        # Wonky heredoc tab/spaces rules.
+        # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L16528-L16545
+        def trim_heredoc_whitespace(string, heredoc)
+          trimmed_whitespace = 0
+          trimmed_characters = 0
+          while (string[trimmed_characters] == "\t" || string[trimmed_characters] == " ") && trimmed_whitespace < heredoc.common_whitespace
+            if string[trimmed_characters] == "\t"
+              trimmed_whitespace = (trimmed_whitespace / 8 + 1) * 8;
+              break if trimmed_whitespace > heredoc.common_whitespace
+            else
+              trimmed_whitespace += 1
+            end
+            trimmed_characters += 1
+          end
+
+          string[trimmed_characters..]
+        end
+
+        # Escape sequences that have special and should appear unescaped in the resulting string.
+        ESCAPES = {
+          "a" => "\a", "b" => "\b", "e" => "\e", "f" => "\f",
+          "n" => "\n", "r" => "\r", "s" => "\s", "t" => "\t",
+          "v" => "\v", "\\" => "\\"
+        }.freeze
+        private_constant :ESCAPES
+
+        # When one of these delimiters is encountered, then the other
+        # one is allowed to be escaped as well.
+        DELIMITER_SYMETRY = { "[" => "]", "(" => ")", "{" => "}", "<" => ">" }.freeze
+        private_constant :DELIMITER_SYMETRY
+
+
+        # https://github.com/whitequark/parser/blob/v3.3.6.0/lib/parser/lexer-strings.rl#L14
+        REGEXP_META_CHARACTERS = ["\\", "$", "(", ")", "*", "+", ".", "<", ">", "?", "[", "]", "^", "{", "|", "}"]
+        private_constant :REGEXP_META_CHARACTERS
+
+        # Apply Ruby string escaping rules
+        def unescape_string(string, quote)
+          # In single-quoted heredocs, everything is taken literally.
+          return string if quote == "<<'"
+
+          # OPTIMIZATION: Assume that few strings need escaping to speed up the common case.
+          return string unless string.include?("\\")
+
+          # Enclosing character for the string. `"` for `"foo"`, `{` for `%w{foo}`, etc.
+          delimiter = quote[-1]
+
+          if regexp?(quote)
+            # Should be escaped handled to single-quoted heredocs. The only character that is
+            # allowed to be escaped is the delimiter, except when that also has special meaning
+            # in the regexp. Since all the symetry delimiters have special meaning, they don't need
+            # to be considered separately.
+            if REGEXP_META_CHARACTERS.include?(delimiter)
+              string
+            else
+              # There can never be an even amount of backslashes. It would be a syntax error.
+              string.gsub(/\\(#{Regexp.escape(delimiter)})/, '\1')
+            end
+          elsif interpolation?(quote)
+            # Appending individual escape sequences may force the string out of its intended
+            # encoding. Start out with binary and force it back later.
+            result = "".b
+
+            scanner = StringScanner.new(string)
+            while (skipped = scanner.skip_until(/\\/))
+              # Append what was just skipped over, excluding the found backslash.
+              result.append_as_bytes(string.byteslice(scanner.pos - skipped, skipped - 1))
+              escape_read(result, scanner, false, false)
+            end
+
+            # Add remaining chars
+            result.append_as_bytes(string.byteslice(scanner.pos..))
+            result.force_encoding(source_buffer.source.encoding)
+          else
+            delimiters = Regexp.escape("#{delimiter}#{DELIMITER_SYMETRY[delimiter]}")
+            string.gsub(/\\([\\#{delimiters}])/, '\1')
+          end
+        end
+
+        # Certain strings are merged into a single string token.
+        def simplify_string?(value, quote)
+          case quote
+          when "'"
+            # Only simplify 'foo'
+            !value.include?("\n")
+          when '"'
+            # Simplify when every line ends with a line continuation, or it is the last line
+            value.lines.all? do |line|
+              !line.end_with?("\n") || line[/(\\*)$/, 1]&.length&.odd?
+            end
+          else
+            # %q and similar are never simplified
+            false
+          end
+        end
+
+        # Escape a byte value, given the control and meta flags.
+        def escape_build(value, control, meta)
+          value &= 0x9f if control
+          value |= 0x80 if meta
+          value
+        end
+
+        # Read an escape out of the string scanner, given the control and meta
+        # flags, and push the unescaped value into the result.
+        def escape_read(result, scanner, control, meta)
+          if scanner.skip("\n")
+            # Line continuation
+          elsif (value = ESCAPES[scanner.peek(1)])
+            # Simple single-character escape sequences like \n
+            result.append_as_bytes(value)
+            scanner.pos += 1
+          elsif (value = scanner.scan(/[0-7]{1,3}/))
+            # \nnn
+            result.append_as_bytes(escape_build(value.to_i(8), control, meta))
+          elsif (value = scanner.scan(/x[0-9a-fA-F]{1,2}/))
+            # \xnn
+            result.append_as_bytes(escape_build(value[1..].to_i(16), control, meta))
+          elsif (value = scanner.scan(/u[0-9a-fA-F]{4}/))
+            # \unnnn
+            result.append_as_bytes(value[1..].hex.chr(Encoding::UTF_8))
+          elsif scanner.skip("u{}")
+            # https://github.com/whitequark/parser/issues/856
+          elsif (value = scanner.scan(/u{.*?}/))
+            # \u{nnnn ...}
+            value[2..-2].split.each do |unicode|
+              result.append_as_bytes(unicode.hex.chr(Encoding::UTF_8))
+            end
+          elsif (value = scanner.scan(/c\\?(?=[[:print:]])|C-\\?(?=[[:print:]])/))
+            # \cx or \C-x where x is an ASCII printable character
+            escape_read(result, scanner, true, meta)
+          elsif (value = scanner.scan(/M-\\?(?=[[:print:]])/))
+            # \M-x where x is an ASCII printable character
+            escape_read(result, scanner, control, true)
+          elsif (byte = scanner.scan_byte)
+            # Something else after an escape.
+            if control && byte == 0x3f # ASCII '?'
+              result.append_as_bytes(escape_build(0x7f, false, meta))
+            else
+              result.append_as_bytes(escape_build(byte, control, meta))
+            end
+          end
+        end
+
+        # In a percent array, certain whitespace can be preceeded with a backslash,
+        # causing the following characters to be part of the previous element.
+        def percent_array_unescape(string)
+          string.gsub(/(\\)+[ \f\n\r\t\v]/) do |full_match|
+            full_match.delete_prefix!("\\") if Regexp.last_match[1].length.odd?
+            full_match
+          end
+        end
+
+        # For %-arrays whitespace, the parser gem only considers whitespace before the newline.
+        def percent_array_leading_whitespace(string)
+          return 1 if string.start_with?("\n")
+
+          leading_whitespace = 0
+          string.each_char do |c|
+            break if c == "\n"
+            leading_whitespace += 1
+          end
+          leading_whitespace
+        end
+
+        # Determine if characters preceeded by a backslash should be escaped or not
+        def interpolation?(quote)
+          !quote.end_with?("'") && !quote.start_with?("%q", "%w", "%i", "%s")
+        end
+
+        # Regexp allow interpolation but are handled differently during unescaping
+        def regexp?(quote)
+          quote == "/" || quote.start_with?("%r")
+        end
+
+        # Determine if the string is part of a %-style array.
+        def percent_array?(quote)
+          quote.start_with?("%w", "%W", "%i", "%I")
+        end
       end
     end
   end
diff --git a/lib/prism/translation/parser/rubocop.rb b/lib/prism/translation/parser/rubocop.rb
deleted file mode 100644
index 6c9687a5cc..0000000000
--- a/lib/prism/translation/parser/rubocop.rb
+++ /dev/null
@@ -1,73 +0,0 @@
-# frozen_string_literal: true
-# typed: ignore
-
-warn "WARN: Prism is directly supported since RuboCop 1.62. The `prism/translation/parser/rubocop` file is deprecated."
-
-require "parser"
-require "rubocop"
-
-require_relative "../../prism"
-require_relative "../parser"
-
-module Prism
-  module Translation
-    class Parser
-      # This is the special version numbers that should be used in RuboCop
-      # configuration files to trigger using prism.
-
-      # For Ruby 3.3
-      VERSION_3_3 = 80_82_73_83_77.33
-
-      # For Ruby 3.4
-      VERSION_3_4 = 80_82_73_83_77.34
-
-      # This module gets prepended into RuboCop::AST::ProcessedSource.
-      module ProcessedSource
-        # This condition is compatible with rubocop-ast versions up to 1.30.0.
-        if RuboCop::AST::ProcessedSource.instance_method(:parser_class).arity == 1
-          # Redefine parser_class so that we can inject the prism parser into the
-          # list of known parsers.
-          def parser_class(ruby_version)
-            if ruby_version == Prism::Translation::Parser::VERSION_3_3
-              warn "WARN: Setting `TargetRubyVersion: 80_82_73_83_77.33` is deprecated. " \
-                   "Set to `ParserEngine: parser_prism` and `TargetRubyVersion: 3.3` instead."
-              require_relative "../parser33"
-              Prism::Translation::Parser33
-            elsif ruby_version == Prism::Translation::Parser::VERSION_3_4
-              warn "WARN: Setting `TargetRubyVersion: 80_82_73_83_77.34` is deprecated. " \
-                   "Set to `ParserEngine: parser_prism` and `TargetRubyVersion: 3.4` instead."
-              require_relative "../parser34"
-              Prism::Translation::Parser34
-            else
-              super
-            end
-          end
-        else
-          # Redefine parser_class so that we can inject the prism parser into the
-          # list of known parsers.
-          def parser_class(ruby_version, _parser_engine)
-            if ruby_version == Prism::Translation::Parser::VERSION_3_3
-              warn "WARN: Setting `TargetRubyVersion: 80_82_73_83_77.33` is deprecated. " \
-                   "Set to `ParserEngine: parser_prism` and `TargetRubyVersion: 3.3` instead."
-              require_relative "../parser33"
-              Prism::Translation::Parser33
-            elsif ruby_version == Prism::Translation::Parser::VERSION_3_4
-              warn "WARN: Setting `TargetRubyVersion: 80_82_73_83_77.34` is deprecated. " \
-                   "Set to `ParserEngine: parser_prism` and `TargetRubyVersion: 3.4` instead."
-              require_relative "../parser34"
-              Prism::Translation::Parser34
-            else
-              super
-            end
-          end
-        end
-      end
-    end
-  end
-end
-
-# :stopdoc:
-RuboCop::AST::ProcessedSource.prepend(Prism::Translation::Parser::ProcessedSource)
-known_rubies = RuboCop::TargetRuby.const_get(:KNOWN_RUBIES)
-RuboCop::TargetRuby.send(:remove_const, :KNOWN_RUBIES)
-RuboCop::TargetRuby::KNOWN_RUBIES = [*known_rubies, Prism::Translation::Parser::VERSION_3_3].freeze
diff --git a/lib/prism/translation/parser33.rb b/lib/prism/translation/parser33.rb
deleted file mode 100644
index b09266e06a..0000000000
--- a/lib/prism/translation/parser33.rb
+++ /dev/null
@@ -1,12 +0,0 @@
-# frozen_string_literal: true
-
-module Prism
-  module Translation
-    # This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`.
-    class Parser33 < Parser
-      def version # :nodoc:
-        33
-      end
-    end
-  end
-end
diff --git a/lib/prism/translation/parser34.rb b/lib/prism/translation/parser34.rb
deleted file mode 100644
index 0ead70ad3c..0000000000
--- a/lib/prism/translation/parser34.rb
+++ /dev/null
@@ -1,12 +0,0 @@
-# frozen_string_literal: true
-
-module Prism
-  module Translation
-    # This class is the entry-point for Ruby 3.4 of `Prism::Translation::Parser`.
-    class Parser34 < Parser
-      def version # :nodoc:
-        34
-      end
-    end
-  end
-end
diff --git a/lib/prism/translation/parser_current.rb b/lib/prism/translation/parser_current.rb
new file mode 100644
index 0000000000..f7c1070e30
--- /dev/null
+++ b/lib/prism/translation/parser_current.rb
@@ -0,0 +1,26 @@
+# frozen_string_literal: true
+# :markup: markdown
+#--
+# typed: ignore
+
+module Prism
+  module Translation
+    case RUBY_VERSION
+    when /^3\.3\./
+      ParserCurrent = Parser33
+    when /^3\.4\./
+      ParserCurrent = Parser34
+    when /^3\.5\./, /^4\.0\./
+      ParserCurrent = Parser40
+    when /^4\.1\./
+      ParserCurrent = Parser41
+    else
+      # Keep this in sync with released Ruby.
+      parser = Parser40
+      major, minor, _patch = Gem::Version.new(RUBY_VERSION).segments
+      warn "warning: `Prism::Translation::Current` is loading #{parser.name}, " \
+           "but you are running #{major}.#{minor}."
+      ParserCurrent = parser
+    end
+  end
+end
diff --git a/lib/prism/translation/parser_versions.rb b/lib/prism/translation/parser_versions.rb
new file mode 100644
index 0000000000..720c7d548c
--- /dev/null
+++ b/lib/prism/translation/parser_versions.rb
@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+# :markup: markdown
+
+module Prism
+  module Translation
+    # This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`.
+    class Parser33 < Parser
+      def version # :nodoc:
+        33
+      end
+    end
+
+    # This class is the entry-point for Ruby 3.4 of `Prism::Translation::Parser`.
+    class Parser34 < Parser
+      def version # :nodoc:
+        34
+      end
+    end
+
+    # This class is the entry-point for Ruby 4.0 of `Prism::Translation::Parser`.
+    class Parser40 < Parser
+      def version # :nodoc:
+        40
+      end
+    end
+
+    Parser35 = Parser40 # :nodoc:
+
+    # This class is the entry-point for Ruby 4.1 of `Prism::Translation::Parser`.
+    class Parser41 < Parser
+      def version # :nodoc:
+        41
+      end
+    end
+  end
+end
diff --git a/lib/prism/translation/ripper.rb b/lib/prism/translation/ripper.rb
index 79ba0e7ab3..f179a149a1 100644
--- a/lib/prism/translation/ripper.rb
+++ b/lib/prism/translation/ripper.rb
@@ -1,6 +1,5 @@
 # frozen_string_literal: true
-
-require "ripper"
+# :markup: markdown
 
 module Prism
   module Translation
@@ -23,22 +22,10 @@ module Prism
     # - on_comma
     # - on_ignored_nl
     # - on_ignored_sp
-    # - on_kw
-    # - on_label_end
-    # - on_lbrace
-    # - on_lbracket
-    # - on_lparen
     # - on_nl
-    # - on_op
     # - on_operator_ambiguous
-    # - on_rbrace
-    # - on_rbracket
-    # - on_rparen
     # - on_semicolon
     # - on_sp
-    # - on_symbeg
-    # - on_tstring_beg
-    # - on_tstring_end
     #
     class Ripper < Compiler
       # Parses the given Ruby program read from +src+.
@@ -70,7 +57,8 @@ module Prism
       #          [[1, 13], :on_kw,     "end", END      ]]
       #
       def self.lex(src, filename = "-", lineno = 1, raise_errors: false)
-        result = Prism.lex_compat(src, filepath: filename, line: lineno)
+        coerced = coerce_source(src)
+        result = Prism.lex_compat(coerced, filepath: filename, line: lineno, version: "current", encoding: coerced.encoding)
 
         if result.failure? && raise_errors
           raise SyntaxError, result.errors.first.message
@@ -79,6 +67,34 @@ module Prism
         end
       end
 
+      # Tokenizes the Ruby program and returns an array of strings.
+      # The +filename+ and +lineno+ arguments are mostly ignored, since the
+      # return value is just the tokenized input.
+      # By default, this method does not handle syntax errors in +src+,
+      # use the +raise_errors+ keyword to raise a SyntaxError for an error in +src+.
+      #
+      #   p Ripper.tokenize("def m(a) nil end")
+      #      # => ["def", " ", "m", "(", "a", ")", " ", "nil", " ", "end"]
+      #
+      def self.tokenize(...)
+        lex(...).map { |token| token[2] }
+      end
+
+      # Mirros the various lex_types that ripper supports
+      def self.coerce_source(source) # :nodoc:
+        if source.is_a?(IO)
+          source.read
+        elsif source.respond_to?(:gets)
+          src = +""
+          while line = source.gets
+            src << line
+          end
+          src
+        else
+          source.to_str
+        end
+      end
+
       # This contains a table of all of the parser events and their
       # corresponding arity.
       PARSER_EVENT_TABLE = {
@@ -331,7 +347,7 @@ module Prism
         "__ENCODING__",
         "__FILE__",
         "__LINE__"
-      ]
+      ].to_set
 
       # A list of all of the Ruby binary operators.
       BINARY_OPERATORS = [
@@ -356,7 +372,7 @@ module Prism
         :/,
         :*,
         :**
-      ]
+      ].to_set
 
       private_constant :KEYWORDS, :BINARY_OPERATORS
 
@@ -425,9 +441,93 @@ module Prism
         end
       end
 
+      autoload :Filter, "prism/translation/ripper/filter"
+      autoload :Lexer, "prism/translation/ripper/lexer"
       autoload :SexpBuilder, "prism/translation/ripper/sexp"
       autoload :SexpBuilderPP, "prism/translation/ripper/sexp"
 
+      # Provides optimized access to line and column information.
+      # Ripper bounds are mostly accessed in a linear fashion, so
+      # we can try a linear scan first and fall back to binary search.
+      class LineAndColumnCache # :nodoc:
+        # How many should it look ahead/behind before falling back to binary searching.
+        WINDOW = 8
+        private_constant :WINDOW
+
+        #: (Source source) -> void
+        def initialize(source)
+          @source = source
+          @offsets = source.offsets
+          @hint = 0
+        end
+
+        #: (Integer byte_offset) -> [Integer, Integer]
+        def line_and_column(byte_offset)
+          @hint = new_hint(byte_offset) || @source.find_line(byte_offset)
+          return [@hint + @source.start_line, byte_offset - @offsets[@hint]]
+        end
+
+        private
+
+        def new_hint(byte_offset)
+          if @offsets[@hint] <= byte_offset
+            # Same line?
+            if (@hint + 1 >= @offsets.size || @offsets[@hint + 1] > byte_offset)
+              return @hint
+            end
+
+            # Scan forwards
+            limit = [@hint + WINDOW + 1, @offsets.size].min
+            idx = @hint + 1
+            while idx < limit
+              if @offsets[idx] > byte_offset
+                return idx - 1
+              end
+              if @offsets[idx] == byte_offset
+                return idx
+              end
+              idx += 1
+            end
+          else
+            # Scan backwards
+            limit = @hint > WINDOW ? @hint - WINDOW : 0
+            idx = @hint
+            while idx >= limit + 1
+              if @offsets[idx - 1] <= byte_offset
+                return idx - 1
+              end
+              idx -= 1
+            end
+          end
+
+          nil
+        end
+      end
+
+      # :stopdoc:
+      # This is not part of the public API but used by some gems.
+
+      # Ripper-internal bitflags.
+      LEX_STATE_NAMES = %i[
+        BEG END ENDARG ENDFN ARG CMDARG MID FNAME DOT CLASS LABEL LABELED FITEM
+      ].map.with_index.to_h { |name, i| [2 ** i, name] }.freeze
+      private_constant :LEX_STATE_NAMES
+
+      LEX_STATE_NAMES.each do |value, key|
+        const_set("EXPR_#{key}", value)
+      end
+      EXPR_NONE = 0
+      EXPR_VALUE = EXPR_BEG
+      EXPR_BEG_ANY = EXPR_BEG | EXPR_MID | EXPR_CLASS
+      EXPR_ARG_ANY = EXPR_ARG | EXPR_CMDARG
+      EXPR_END_ANY = EXPR_END | EXPR_ENDARG | EXPR_ENDFN
+
+      def self.lex_state_name(state)
+        LEX_STATE_NAMES.filter_map { |flag, name| name if state & flag != 0  }.join("|")
+      end
+
+      # :startdoc:
+
       # The source that is being parsed.
       attr_reader :source
 
@@ -437,16 +537,17 @@ module Prism
       # The current line number of the parser.
       attr_reader :lineno
 
-      # The current column number of the parser.
+      # The current column in bytes of the parser.
       attr_reader :column
 
       # Create a new Translation::Ripper object with the given source.
       def initialize(source, filename = "(ripper)", lineno = 1)
-        @source = source
+        @source = Ripper.coerce_source(source)
         @filename = filename
         @lineno = lineno
         @column = 0
         @result = nil
+        @line_and_column_cache = nil
       end
 
       ##########################################################################
@@ -465,7 +566,12 @@ module Prism
           bounds(location)
 
           if comment.is_a?(InlineComment)
-            on_comment(comment.slice)
+            # Inline comments always contain a newline if the line itself contains it
+            if result.source.source.bytesize > comment.location.end_offset
+              on_comment("#{comment.slice}\n")
+            else
+              on_comment(comment.slice)
+            end
           else
             offset = location.start_offset
             lines = comment.slice.lines
@@ -546,9 +652,14 @@ module Prism
       # Visitor methods
       ##########################################################################
 
+      # :stopdoc:
+
       # alias foo bar
       # ^^^^^^^^^^^^^
       def visit_alias_method_node(node)
+        bounds(node.keyword_loc)
+        on_kw("alias")
+
         new_name = visit(node.new_name)
         old_name = visit(node.old_name)
 
@@ -559,6 +670,9 @@ module Prism
       # alias $foo $bar
       # ^^^^^^^^^^^^^^^
       def visit_alias_global_variable_node(node)
+        bounds(node.keyword_loc)
+        on_kw("alias")
+
         new_name = visit_alias_global_variable_node_value(node.new_name)
         old_name = visit_alias_global_variable_node_value(node.old_name)
 
@@ -584,6 +698,10 @@ module Prism
       #        ^^^^^^^^^
       def visit_alternation_pattern_node(node)
         left = visit_pattern_node(node.left)
+
+        bounds(node.operator_loc)
+        on_op("|")
+
         right = visit_pattern_node(node.right)
 
         bounds(node.location)
@@ -594,7 +712,13 @@ module Prism
       # parenthesis node that can be used to wrap patterns.
       private def visit_pattern_node(node)
         if node.is_a?(ParenthesesNode)
-          visit(node.body)
+          bounds(node.opening_loc)
+          on_lparen("(")
+          result = visit(node.body)
+          bounds(node.closing_loc)
+          on_rparen(")")
+
+          result
         else
           visit(node)
         end
@@ -604,6 +728,14 @@ module Prism
       # ^^^^^^^
       def visit_and_node(node)
         left = visit(node.left)
+
+        bounds(node.operator_loc)
+        if node.operator == "and"
+          on_kw("and")
+        else
+          on_op("&&")
+        end
+
         right = visit(node.right)
 
         bounds(node.location)
@@ -631,6 +763,8 @@ module Prism
             previous = element
           end
 
+          visit_words_sep(opening_loc, node.elements.last, node.closing_loc)
+
           bounds(node.closing_loc)
           on_tstring_end(node.closing)
         when /^%i/
@@ -650,6 +784,8 @@ module Prism
             previous = element
           end
 
+          visit_words_sep(opening_loc, node.elements.last, node.closing_loc)
+
           bounds(node.closing_loc)
           on_tstring_end(node.closing)
         when /^%W/
@@ -687,6 +823,8 @@ module Prism
             previous = element
           end
 
+          visit_words_sep(opening_loc, node.elements.last, node.closing_loc)
+
           bounds(node.closing_loc)
           on_tstring_end(node.closing)
         when /^%I/
@@ -724,6 +862,8 @@ module Prism
             previous = element
           end
 
+          visit_words_sep(opening_loc, node.elements.last, node.closing_loc)
+
           bounds(node.closing_loc)
           on_tstring_end(node.closing)
         else
@@ -740,15 +880,21 @@ module Prism
         on_array(elements)
       end
 
-      # Dispatch a words_sep event that contains the space between the elements
+      # Dispatch words_sep events that contains the whitespace between the elements
       # of list literals.
       private def visit_words_sep(opening_loc, previous, current)
-        end_offset = (previous.nil? ? opening_loc : previous.location).end_offset
-        start_offset = current.location.start_offset
-
-        if end_offset != start_offset
-          bounds(current.location.copy(start_offset: end_offset))
-          on_words_sep(source.byteslice(end_offset...start_offset))
+        start_offset = (previous.nil? ? opening_loc : previous.location).end_offset
+        end_offset = current.start_offset
+        length = end_offset - start_offset
+
+        if length > 0
+          whitespace = source.byteslice(start_offset, length)
+          current_offset = start_offset
+          whitespace.each_line do |part|
+            bounds(opening_loc.copy(start_offset: current_offset, length: part.bytesize))
+            on_words_sep(part)
+            current_offset += part.bytesize
+          end
         end
       end
 
@@ -774,9 +920,18 @@ module Prism
       #        ^^^^^
       def visit_array_pattern_node(node)
         constant = visit(node.constant)
+
+        if node.opening_loc
+          bounds(node.opening_loc)
+          node.opening == "[" ? on_lbracket("[") : on_lparen("(")
+        end
+
         requireds = visit_all(node.requireds) if node.requireds.any?
         rest =
           if (rest_node = node.rest).is_a?(SplatNode)
+            bounds(rest_node.operator_loc)
+            on_op("*")
+
             if rest_node.expression.nil?
               bounds(rest_node.location)
               on_var_field(nil)
@@ -787,6 +942,10 @@ module Prism
 
         posts = visit_all(node.posts) if node.posts.any?
 
+        if node.closing_loc
+          bounds(node.closing_loc)
+          node.closing == "]" ? on_rbracket("]") : on_rparen(")")
+        end
         bounds(node.location)
         on_aryptn(constant, requireds, rest, posts)
       end
@@ -802,6 +961,12 @@ module Prism
       #   ^^^^
       def visit_assoc_node(node)
         key = visit(node.key)
+
+        if node.operator_loc
+          bounds(node.operator_loc)
+          on_op("=>")
+        end
+
         value = visit(node.value)
 
         bounds(node.location)
@@ -814,6 +979,9 @@ module Prism
       # { **foo }
       #   ^^^^^
       def visit_assoc_splat_node(node)
+        bounds(node.operator_loc)
+        on_op("**")
+
         value = visit(node.value)
 
         bounds(node.location)
@@ -830,8 +998,18 @@ module Prism
       # begin end
       # ^^^^^^^^^
       def visit_begin_node(node)
+        if node.begin_keyword_loc
+          bounds(node.begin_keyword_loc)
+          on_kw("begin")
+        end
+
         clauses = visit_begin_node_clauses(node.begin_keyword_loc, node, false)
 
+        if node.end_keyword_loc
+          bounds(node.end_keyword_loc)
+          on_kw("end")
+        end
+
         bounds(node.location)
         on_begin(clauses)
       end
@@ -843,7 +1021,7 @@ module Prism
             on_stmts_add(on_stmts_new, on_void_stmt)
           else
             body = node.statements.body
-            body.unshift(nil) if void_stmt?(location, node.statements.body[0].location, allow_newline)
+            body = [nil, *body] if void_stmt?(location, node.statements.body[0].location, allow_newline)
 
             bounds(node.statements.location)
             visit_statements_node_body(body)
@@ -852,12 +1030,15 @@ module Prism
         rescue_clause = visit(node.rescue_clause)
         else_clause =
           unless (else_clause_node = node.else_clause).nil?
+            bounds(else_clause_node.else_keyword_loc)
+            on_kw("else")
+
             else_statements =
               if else_clause_node.statements.nil?
                 [nil]
               else
                 body = else_clause_node.statements.body
-                body.unshift(nil) if void_stmt?(else_clause_node.else_keyword_loc, else_clause_node.statements.body[0].location, allow_newline)
+                body = [nil, *body] if void_stmt?(else_clause_node.else_keyword_loc, else_clause_node.statements.body[0].location, allow_newline)
                 body
               end
 
@@ -879,7 +1060,7 @@ module Prism
           on_bodystmt(visit_statements_node_body([nil]), nil, nil, nil)
         when StatementsNode
           body = [*node.body]
-          body.unshift(nil) if void_stmt?(location, body[0].location, allow_newline)
+          body = [nil, *body] if void_stmt?(location, body[0].location, allow_newline)
           stmts = visit_statements_node_body(body)
 
           bounds(node.body.first.location)
@@ -894,6 +1075,8 @@ module Prism
       # foo(&bar)
       #     ^^^^
       def visit_block_argument_node(node)
+        bounds(node.operator_loc)
+        on_op("&")
         visit(node.expression)
       end
 
@@ -907,6 +1090,13 @@ module Prism
       # Visit a BlockNode.
       def visit_block_node(node)
         braces = node.opening == "{"
+        bounds(node.opening_loc)
+        if braces
+          on_lbrace("{")
+        else
+          on_kw("do")
+        end
+
         parameters = visit(node.parameters)
 
         body =
@@ -919,7 +1109,7 @@ module Prism
             braces ? stmts : on_bodystmt(stmts, nil, nil, nil)
           when StatementsNode
             stmts = node.body.body
-            stmts.unshift(nil) if void_stmt?(node.parameters&.location || node.opening_loc, node.body.location, false)
+            stmts = [nil, *stmts] if void_stmt?(node.parameters&.location || node.opening_loc, node.body.location, false)
             stmts = visit_statements_node_body(stmts)
 
             bounds(node.body.location)
@@ -931,6 +1121,14 @@ module Prism
           end
 
         if braces
+          bounds(node.closing_loc)
+          on_rbrace("}")
+        else
+          bounds(node.closing_loc)
+          on_kw("end")
+        end
+
+        if braces
           bounds(node.location)
           on_brace_block(parameters, body)
         else
@@ -942,12 +1140,15 @@ module Prism
       # def foo(&bar); end
       #         ^^^^
       def visit_block_parameter_node(node)
+        bounds(node.operator_loc)
+        on_op("&")
+
         if node.name_loc.nil?
           bounds(node.location)
           on_blockarg(nil)
         else
           bounds(node.name_loc)
-          name = visit_token(node.name.to_s)
+          name = on_ident(node.name.to_s)
 
           bounds(node.location)
           on_blockarg(name)
@@ -956,6 +1157,9 @@ module Prism
 
       # A block's parameters.
       def visit_block_parameters_node(node)
+        bounds(node.opening_loc)
+        on_op("|")
+
         parameters =
           if node.parameters.nil?
             on_params(nil, nil, nil, nil, nil, nil, nil)
@@ -970,6 +1174,9 @@ module Prism
             false
           end
 
+        bounds(node.closing_loc)
+        on_op("|")
+
         bounds(node.location)
         on_block_var(parameters, locals)
       end
@@ -980,6 +1187,9 @@ module Prism
       # break foo
       # ^^^^^^^^^
       def visit_break_node(node)
+        bounds(node.keyword_loc)
+        on_kw("break")
+
         if node.arguments.nil?
           bounds(node.location)
           on_break(on_args_new)
@@ -1004,20 +1214,32 @@ module Prism
           case node.name
           when :[]
             receiver = visit(node.receiver)
-            arguments, block = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
+
+            bounds(node.opening_loc)
+            on_lbracket("[")
+
+            arguments, block_node = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
+
+            bounds(node.closing_loc)
+            on_rbracket("]")
+
+            block = visit(block_node)
 
             bounds(node.location)
             call = on_aref(receiver, arguments)
 
-            if block.nil?
-              call
-            else
+            if block_node
               bounds(node.location)
               on_method_add_block(call, block)
+            else
+              call
             end
           when :[]=
             receiver = visit(node.receiver)
 
+            bounds(node.opening_loc)
+            on_lbracket("[")
+
             *arguments, last_argument = node.arguments.arguments
             arguments << node.block if !node.block.nil?
 
@@ -1033,6 +1255,11 @@ module Prism
                 end
               end
 
+            bounds(node.closing_loc)
+            on_rbracket("]")
+            bounds(node.equal_loc)
+            on_op("=")
+
             bounds(node.location)
             call = on_aref_field(receiver, arguments)
             value = visit_write_value(last_argument)
@@ -1040,17 +1267,54 @@ module Prism
             bounds(last_argument.location)
             on_assign(call, value)
           when :-@, :+@, :~
-            receiver = visit(node.receiver)
+            bounds(node.message_loc)
+            on_op(node.message)
 
+            receiver = visit(node.receiver)
             bounds(node.location)
             on_unary(node.name, receiver)
           when :!
-            receiver = visit(node.receiver)
+            bounds(node.message_loc)
+            if node.message == "not"
+              on_kw("not")
 
-            bounds(node.location)
-            on_unary(node.message == "not" ? :not : :!, receiver)
-          when *BINARY_OPERATORS
+              if node.opening_loc
+                bounds(node.opening_loc)
+                on_lparen("(")
+              end
+
+              receiver =
+                if node.receiver.is_a?(ParenthesesNode) && node.receiver.body.nil?
+                  # The parens in `not()` just emit parens and nothing else.
+                  bounds(node.receiver.opening_loc)
+                  on_lparen("(")
+                  bounds(node.receiver.closing_loc)
+                  on_rparen(")")
+                  nil
+                else
+                  visit(node.receiver)
+                end
+
+              if node.closing_loc
+                bounds(node.closing_loc)
+                on_rparen(")")
+              end
+              bounds(node.location)
+              on_unary(:not, receiver)
+            else
+              on_op("!")
+
+              receiver = visit(node.receiver)
+
+              bounds(node.location)
+              on_unary(:!, receiver)
+            end
+          when BINARY_OPERATORS
             receiver = visit(node.receiver)
+
+            bounds(node.message_loc)
+            on_op(node.message)
+
             value = visit(node.arguments.arguments.first)
 
             bounds(node.location)
@@ -1062,9 +1326,21 @@ module Prism
             if node.variable_call?
               on_vcall(message)
             else
-              arguments, block = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc || node.location))
+              if node.opening_loc
+                bounds(node.opening_loc)
+                on_lparen("(")
+              end
+
+              arguments, block_node = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc || node.location))
+
+              if node.closing_loc
+                bounds(node.closing_loc)
+                on_rparen(")")
+              end
+
+              block = visit(block_node)
               call =
-                if node.opening_loc.nil? && arguments&.any?
+                if node.opening_loc.nil? && get_arguments_and_block(node.arguments, node.block).first.any?
                   bounds(node.location)
                   on_command(message, arguments)
                 elsif !node.opening_loc.nil?
@@ -1075,11 +1351,11 @@ module Prism
                   on_method_add_arg(on_fcall(message), on_args_new)
                 end
 
-              if block.nil?
-                call
-              else
+              if block_node
                 bounds(node.block.location)
                 on_method_add_block(call, block)
+              else
+                call
               end
             end
           end
@@ -1087,7 +1363,7 @@ module Prism
           receiver = visit(node.receiver)
 
           bounds(node.call_operator_loc)
-          call_operator = visit_token(node.call_operator)
+          call_operator = visit_call_operator(node.call_operator)
 
           message =
             if node.message_loc.nil?
@@ -1097,13 +1373,30 @@ module Prism
               visit_token(node.message, false)
             end
 
+          if node.equal_loc
+            bounds(node.equal_loc)
+            on_op("=")
+          end
+
           if node.name.end_with?("=") && !node.message.end_with?("=") && !node.arguments.nil? && node.block.nil?
             value = visit_write_value(node.arguments.arguments.first)
 
             bounds(node.location)
             on_assign(on_field(receiver, call_operator, message), value)
           else
-            arguments, block = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc || node.location))
+            if node.opening_loc
+              bounds(node.opening_loc)
+              on_lparen("(")
+            end
+
+            arguments, block_node = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc || node.location))
+
+            if node.closing_loc
+              bounds(node.closing_loc)
+              on_rparen(")")
+            end
+
+            block = visit(block_node)
             call =
               if node.opening_loc.nil?
                 bounds(node.location)
@@ -1121,27 +1414,35 @@ module Prism
                 on_method_add_arg(on_call(receiver, call_operator, message), arguments)
               end
 
-            if block.nil?
-              call
-            else
+            if block_node
               bounds(node.block.location)
               on_method_add_block(call, block)
+            else
+              call
             end
           end
         end
       end
 
-      # Visit the arguments and block of a call node and return the arguments
-      # and block as they should be used.
-      private def visit_call_node_arguments(arguments_node, block_node, trailing_comma)
+      # Extract the arguments and block Ripper-style, which means if the block
+      # is like `&b` then it's moved to arguments.
+      private def get_arguments_and_block(arguments_node, block_node)
         arguments = arguments_node&.arguments || []
         block = block_node
 
         if block.is_a?(BlockArgumentNode)
-          arguments << block
+          arguments += [block]
           block = nil
         end
 
+        [arguments, block]
+      end
+
+      # Visit the arguments and block of a call node and return the arguments
+      # and block as they should be used.
+      private def visit_call_node_arguments(arguments_node, block_node, trailing_comma)
+        arguments, block = get_arguments_and_block(arguments_node, block_node)
+
         [
           if arguments.length == 1 && arguments.first.is_a?(ForwardingArgumentsNode)
             visit(arguments.first)
@@ -1155,7 +1456,7 @@ module Prism
               on_args_add_block(args, false)
             end
           end,
-          visit(block)
+          block,
         ]
       end
 
@@ -1173,7 +1474,7 @@ module Prism
         receiver = visit(node.receiver)
 
         bounds(node.call_operator_loc)
-        call_operator = visit_token(node.call_operator)
+        call_operator = visit_call_operator(node.call_operator)
 
         bounds(node.message_loc)
         message = visit_token(node.message)
@@ -1195,7 +1496,7 @@ module Prism
         receiver = visit(node.receiver)
 
         bounds(node.call_operator_loc)
-        call_operator = visit_token(node.call_operator)
+        call_operator = visit_call_operator(node.call_operator)
 
         bounds(node.message_loc)
         message = visit_token(node.message)
@@ -1217,7 +1518,7 @@ module Prism
         receiver = visit(node.receiver)
 
         bounds(node.call_operator_loc)
-        call_operator = visit_token(node.call_operator)
+        call_operator = visit_call_operator(node.call_operator)
 
         bounds(node.message_loc)
         message = visit_token(node.message)
@@ -1239,6 +1540,9 @@ module Prism
         if node.call_operator == "::"
           receiver = visit(node.receiver)
 
+          bounds(node.call_operator_loc)
+          on_op("::")
+
           bounds(node.message_loc)
           message = visit_token(node.message)
 
@@ -1248,7 +1552,7 @@ module Prism
           receiver = visit(node.receiver)
 
           bounds(node.call_operator_loc)
-          call_operator = visit_token(node.call_operator)
+          call_operator = visit_call_operator(node.call_operator)
 
           bounds(node.message_loc)
           message = visit_token(node.message)
@@ -1262,6 +1566,10 @@ module Prism
       #        ^^^^^^^^^^
       def visit_capture_pattern_node(node)
         value = visit(node.value)
+
+        bounds(node.operator_loc)
+        on_op("=>")
+
         target = visit(node.target)
 
         bounds(node.location)
@@ -1271,10 +1579,21 @@ module Prism
       # case foo; when bar; end
       # ^^^^^^^^^^^^^^^^^^^^^^^
       def visit_case_node(node)
+        bounds(node.case_keyword_loc)
+        on_kw("case")
+
         predicate = visit(node.predicate)
+        visited_conditions = node.conditions.map { |condition| visit(condition) }
+        visited_else_clause = visit(node.else_clause)
+
+        if !node.else_clause
+          bounds(node.end_keyword_loc)
+          on_kw("end")
+        end
+
         clauses =
-          node.conditions.reverse_each.inject(visit(node.consequent)) do |consequent, condition|
-            on_when(*visit(condition), consequent)
+          visited_conditions.reverse_each.inject(visited_else_clause) do |current, condition|
+            on_when(*condition, current)
           end
 
         bounds(node.location)
@@ -1284,10 +1603,23 @@ module Prism
       # case foo; in bar; end
       # ^^^^^^^^^^^^^^^^^^^^^
       def visit_case_match_node(node)
+        bounds(node.case_keyword_loc)
+        on_kw("case")
+
         predicate = visit(node.predicate)
+        visited_conditions = node.conditions.map do | condition|
+          visit(condition)
+        end
+        visited_else_clause = visit(node.else_clause)
+
+        if !node.else_clause
+          bounds(node.end_keyword_loc)
+          on_kw("end")
+        end
+
         clauses =
-          node.conditions.reverse_each.inject(visit(node.consequent)) do |consequent, condition|
-            on_in(*visit(condition), consequent)
+          visited_conditions.reverse_each.inject(visited_else_clause) do |current, condition|
+            on_in(*condition, current)
           end
 
         bounds(node.location)
@@ -1297,6 +1629,9 @@ module Prism
       # class Foo; end
       # ^^^^^^^^^^^^^^
       def visit_class_node(node)
+        bounds(node.class_keyword_loc)
+        on_kw("class")
+
         constant_path =
           if node.constant_path.is_a?(ConstantReadNode)
             bounds(node.constant_path.location)
@@ -1305,9 +1640,17 @@ module Prism
             visit(node.constant_path)
           end
 
+        if node.inheritance_operator_loc
+          bounds(node.inheritance_operator_loc)
+          on_op("<")
+        end
+
         superclass = visit(node.superclass)
         bodystmt = visit_body_node(node.superclass&.location || node.constant_path.location, node.body, node.superclass.nil?)
 
+        bounds(node.end_keyword_loc)
+        on_kw("end")
+
         bounds(node.location)
         on_class(constant_path, superclass, bodystmt)
       end
@@ -1321,12 +1664,13 @@ module Prism
 
       # @@foo = 1
       # ^^^^^^^^^
-      #
-      # @@foo, @@bar = 1
-      # ^^^^^  ^^^^^
       def visit_class_variable_write_node(node)
         bounds(node.name_loc)
         target = on_var_field(on_cvar(node.name.to_s))
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -1391,12 +1735,13 @@ module Prism
 
       # Foo = 1
       # ^^^^^^^
-      #
-      # Foo, Bar = 1
-      # ^^^  ^^^
       def visit_constant_write_node(node)
         bounds(node.name_loc)
         target = on_var_field(on_const(node.name.to_s))
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -1456,6 +1801,11 @@ module Prism
       # ^^^^^^^^
       def visit_constant_path_node(node)
         if node.parent.nil?
+          if node.delimiter_loc
+            bounds(node.delimiter_loc)
+            on_op("::")
+          end
+
           bounds(node.name_loc)
           child = on_const(node.name.to_s)
 
@@ -1464,6 +1814,9 @@ module Prism
         else
           parent = visit(node.parent)
 
+          bounds(node.delimiter_loc)
+          on_op("::")
+
           bounds(node.name_loc)
           child = on_const(node.name.to_s)
 
@@ -1474,11 +1827,12 @@ module Prism
 
       # Foo::Bar = 1
       # ^^^^^^^^^^^^
-      #
-      # Foo::Foo, Bar::Bar = 1
-      # ^^^^^^^^  ^^^^^^^^
       def visit_constant_path_write_node(node)
         target = visit_constant_path_write_node_target(node.target)
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -1488,6 +1842,11 @@ module Prism
       # Visit a constant path that is part of a write node.
       private def visit_constant_path_write_node_target(node)
         if node.parent.nil?
+          if node.delimiter_loc
+            bounds(node.delimiter_loc)
+            on_op("::")
+          end
+
           bounds(node.name_loc)
           child = on_const(node.name.to_s)
 
@@ -1496,6 +1855,9 @@ module Prism
         else
           parent = visit(node.parent)
 
+          bounds(node.delimiter_loc)
+          on_op("::")
+
           bounds(node.name_loc)
           child = on_const(node.name.to_s)
 
@@ -1508,7 +1870,6 @@ module Prism
       # ^^^^^^^^^^^^^^^
       def visit_constant_path_operator_write_node(node)
         target = visit_constant_path_write_node_target(node.target)
-        value = visit(node.value)
 
         bounds(node.binary_operator_loc)
         operator = on_op("#{node.binary_operator}=")
@@ -1522,7 +1883,6 @@ module Prism
       # ^^^^^^^^^^^^^^^^
       def visit_constant_path_and_write_node(node)
         target = visit_constant_path_write_node_target(node.target)
-        value = visit(node.value)
 
         bounds(node.operator_loc)
         operator = on_op("&&=")
@@ -1536,7 +1896,6 @@ module Prism
       # ^^^^^^^^^^^^^^^^
       def visit_constant_path_or_write_node(node)
         target = visit_constant_path_write_node_target(node.target)
-        value = visit(node.value)
 
         bounds(node.operator_loc)
         operator = on_op("||=")
@@ -1558,16 +1917,24 @@ module Prism
       # def self.foo; end
       # ^^^^^^^^^^^^^^^^^
       def visit_def_node(node)
+        bounds(node.def_keyword_loc)
+        on_kw("def")
+
         receiver = visit(node.receiver)
         operator =
           if !node.operator_loc.nil?
             bounds(node.operator_loc)
-            visit_token(node.operator)
+            node.operator == "." ? on_period(".") : on_op("::")
           end
 
         bounds(node.name_loc)
         name = visit_token(node.name_loc.slice)
 
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
         parameters =
           if node.parameters.nil?
             bounds(node.location)
@@ -1577,10 +1944,17 @@ module Prism
           end
 
         if !node.lparen_loc.nil?
+          bounds(node.rparen_loc)
+          on_rparen(")")
           bounds(node.lparen_loc)
           parameters = on_paren(parameters)
         end
 
+        if node.equal_loc
+          bounds(node.equal_loc)
+          on_op("=")
+        end
+
         bodystmt =
           if node.equal_loc.nil?
             visit_body_node(node.rparen_loc || node.end_keyword_loc, node.body)
@@ -1591,11 +1965,16 @@ module Prism
             on_bodystmt(body, nil, nil, nil)
           end
 
+        if node.end_keyword_loc
+          bounds(node.end_keyword_loc)
+          on_kw("end")
+        end
+
         bounds(node.location)
-        if receiver.nil?
-          on_def(name, parameters, bodystmt)
-        else
+        if receiver
           on_defs(receiver, operator, name, parameters, bodystmt)
+        else
+          on_def(name, parameters, bodystmt)
         end
       end
 
@@ -1605,24 +1984,59 @@ module Prism
       # defined?(a)
       # ^^^^^^^^^^^
       def visit_defined_node(node)
+        bounds(node.keyword_loc)
+        on_kw("defined?")
+
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
+        expression = visit(node.value)
+
+        if node.rparen_loc
+          bounds(node.rparen_loc)
+          on_rparen(")")
+        end
+
+        # Very weird circumstances here where something like:
+        #
+        #     defined?
+        #     (1)
+        #
+        # gets parsed in Ruby as having only the `1` expression but in Ripper it
+        # gets parsed as having a parentheses node. In this case we need to
+        # synthesize that node to match Ripper's behavior.
+        if node.lparen_loc && node.keyword_loc.join(node.lparen_loc).slice.include?("\n")
+          bounds(node.lparen_loc.join(node.rparen_loc))
+          expression = on_paren(on_stmts_add(on_stmts_new, expression))
+        end
+
         bounds(node.location)
-        on_defined(visit(node.value))
+        on_defined(expression)
       end
 
       # if foo then bar else baz end
       #                 ^^^^^^^^^^^^
       def visit_else_node(node)
+        bounds(node.else_keyword_loc)
+        on_kw("else")
+
         statements =
           if node.statements.nil?
             [nil]
           else
             body = node.statements.body
-            body.unshift(nil) if void_stmt?(node.else_keyword_loc, node.statements.body[0].location, false)
+            body = [nil, *body] if void_stmt?(node.else_keyword_loc, node.statements.body[0].location, false)
             body
           end
 
+        else_statements = visit_statements_node_body(statements)
+
+        bounds(node.end_keyword_loc)
+        on_kw("end")
         bounds(node.location)
-        on_else(visit_statements_node_body(statements))
+        on_else(else_statements)
       end
 
       # "foo #{bar}"
@@ -1660,12 +2074,15 @@ module Prism
 
       # Visit an EnsureNode node.
       def visit_ensure_node(node)
+        bounds(node.ensure_keyword_loc)
+        on_kw("ensure")
+
         statements =
           if node.statements.nil?
             [nil]
           else
             body = node.statements.body
-            body.unshift(nil) if void_stmt?(node.ensure_keyword_loc, body[0].location, false)
+            body = [nil, *body] if void_stmt?(node.ensure_keyword_loc, body[0].location, false)
             body
           end
 
@@ -1686,6 +2103,14 @@ module Prism
       #        ^^^^^^^^^^^
       def visit_find_pattern_node(node)
         constant = visit(node.constant)
+
+        if node.opening_loc
+          bounds(node.opening_loc)
+          node.opening == "[" ? on_lbracket("[") : on_lparen("(")
+        end
+        bounds(node.left.operator_loc)
+        on_op("*")
+
         left =
           if node.left.expression.nil?
             bounds(node.left.location)
@@ -1695,6 +2120,10 @@ module Prism
           end
 
         requireds = visit_all(node.requireds) if node.requireds.any?
+
+        bounds(node.right.operator_loc)
+        on_op("*")
+
         right =
           if node.right.expression.nil?
             bounds(node.right.location)
@@ -1703,6 +2132,10 @@ module Prism
             visit(node.right.expression)
           end
 
+        if node.closing_loc
+          bounds(node.closing_loc)
+          node.closing == "]" ? on_rbracket("]") : on_rparen(")")
+        end
         bounds(node.location)
         on_fndptn(constant, left, requireds, right)
       end
@@ -1711,6 +2144,10 @@ module Prism
       #    ^^^^^^^^^^
       def visit_flip_flop_node(node)
         left = visit(node.left)
+
+        bounds(node.operator_loc)
+        on_op(node.operator)
+
         right = visit(node.right)
 
         bounds(node.location)
@@ -1730,8 +2167,18 @@ module Prism
       # for foo in bar do end
       # ^^^^^^^^^^^^^^^^^^^^^
       def visit_for_node(node)
+        bounds(node.for_keyword_loc)
+        on_kw("for")
+
         index = visit(node.index)
+        bounds(node.in_keyword_loc)
+        on_kw("in")
+
         collection = visit(node.collection)
+        if node.do_keyword_loc
+          bounds(node.do_keyword_loc)
+          on_kw("do")
+        end
         statements =
           if node.statements.nil?
             bounds(node.location)
@@ -1740,6 +2187,9 @@ module Prism
             visit(node.statements)
           end
 
+        bounds(node.end_keyword_loc)
+        on_kw("end")
+
         bounds(node.location)
         on_for(index, collection, statements)
       end
@@ -1748,6 +2198,7 @@ module Prism
       #                   ^^^
       def visit_forwarding_arguments_node(node)
         bounds(node.location)
+        on_op("...")
         on_args_forward
       end
 
@@ -1755,6 +2206,7 @@ module Prism
       #         ^^^
       def visit_forwarding_parameter_node(node)
         bounds(node.location)
+        on_op("...")
         on_args_forward
       end
 
@@ -1764,6 +2216,9 @@ module Prism
       # super {}
       # ^^^^^^^^
       def visit_forwarding_super_node(node)
+        bounds(node.keyword_loc)
+        on_kw("super")
+
         if node.block.nil?
           bounds(node.location)
           on_zsuper
@@ -1784,12 +2239,13 @@ module Prism
 
       # $foo = 1
       # ^^^^^^^^
-      #
-      # $foo, $bar = 1
-      # ^^^^  ^^^^
       def visit_global_variable_write_node(node)
         bounds(node.name_loc)
         target = on_var_field(on_gvar(node.name.to_s))
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -1848,6 +2304,9 @@ module Prism
       # {}
       # ^^
       def visit_hash_node(node)
+        bounds(node.opening_loc)
+        on_lbrace("{")
+
         elements =
           if node.elements.any?
             args = visit_all(node.elements)
@@ -1856,6 +2315,8 @@ module Prism
             on_assoclist_from_args(args)
           end
 
+        bounds(node.closing_loc)
+        on_rbrace("}")
         bounds(node.location)
         on_hash(elements)
       end
@@ -1864,6 +2325,15 @@ module Prism
       #        ^^
       def visit_hash_pattern_node(node)
         constant = visit(node.constant)
+
+        if node.constant
+          bounds(node.opening_loc)
+          node.opening == "[" ? on_lbracket("[") : on_lparen("(")
+        elsif node.opening_loc
+          bounds(node.opening_loc)
+          on_lbrace("{")
+        end
+
         elements =
           if node.elements.any? || !node.rest.nil?
             node.elements.map do |element|
@@ -1886,12 +2356,21 @@ module Prism
         rest =
           case node.rest
           when AssocSplatNode
+            bounds(node.rest.operator_loc)
+            on_op("**")
             visit(node.rest.value)
           when NoKeywordsParameterNode
             bounds(node.rest.location)
             on_var_field(visit(node.rest))
           end
 
+        if node.constant
+          bounds(node.closing_loc)
+          node.closing == "]" ? on_rbracket("]") : on_rparen(")")
+        elsif node.closing_loc
+          bounds(node.closing_loc)
+          on_rbrace("}")
+        end
         bounds(node.location)
         on_hshptn(constant, elements, rest)
       end
@@ -1907,13 +2386,27 @@ module Prism
       def visit_if_node(node)
         if node.then_keyword == "?"
           predicate = visit(node.predicate)
+
+          bounds(node.then_keyword_loc)
+          on_op("?")
+
           truthy = visit(node.statements.body.first)
-          falsy = visit(node.consequent.statements.body.first)
+
+          bounds(node.subsequent.else_keyword_loc)
+          on_op(":")
+
+          falsy = visit(node.subsequent.statements.body.first)
 
           bounds(node.location)
           on_ifop(predicate, truthy, falsy)
         elsif node.statements.nil? || (node.predicate.location.start_offset < node.statements.location.start_offset)
+          bounds(node.if_keyword_loc)
+          on_kw(node.if_keyword)
           predicate = visit(node.predicate)
+          if node.then_keyword_loc && node.then_keyword != "?"
+            bounds(node.then_keyword_loc)
+            on_kw("then")
+          end
           statements =
             if node.statements.nil?
               bounds(node.location)
@@ -1921,16 +2414,23 @@ module Prism
             else
               visit(node.statements)
             end
-          consequent = visit(node.consequent)
+          subsequent = visit(node.subsequent)
+
+          if node.end_keyword_loc && !node.subsequent
+            bounds(node.end_keyword_loc)
+            on_kw("end")
+          end
 
           bounds(node.location)
           if node.if_keyword == "if"
-            on_if(predicate, statements, consequent)
+            on_if(predicate, statements, subsequent)
           else
-            on_elsif(predicate, statements, consequent)
+            on_elsif(predicate, statements, subsequent)
           end
         else
           statements = visit(node.statements.body.first)
+          bounds(node.if_keyword_loc)
+          on_kw(node.if_keyword)
           predicate = visit(node.predicate)
 
           bounds(node.location)
@@ -1960,9 +2460,16 @@ module Prism
       # ^^^^^^^^^^^^^^^^^^^^^
       def visit_in_node(node)
         # This is a special case where we're not going to call on_in directly
-        # because we don't have access to the consequent. Instead, we'll return
+        # because we don't have access to the subsequent. Instead, we'll return
         # the component parts and let the parent node handle it.
+        bounds(node.in_loc)
+        on_kw("in")
+
         pattern = visit_pattern_node(node.pattern)
+        if node.then_loc
+          bounds(node.then_loc)
+          on_kw("then")
+        end
         statements =
           if node.statements.nil?
             bounds(node.location)
@@ -1978,8 +2485,15 @@ module Prism
       # ^^^^^^^^^^^^^^^
       def visit_index_operator_write_node(node)
         receiver = visit(node.receiver)
+
+        bounds(node.opening_loc)
+        on_lbracket("[")
+
         arguments, _ = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
 
+        bounds(node.closing_loc)
+        on_rbracket("]")
+
         bounds(node.location)
         target = on_aref_field(receiver, arguments)
 
@@ -1995,8 +2509,15 @@ module Prism
       # ^^^^^^^^^^^^^^^^
       def visit_index_and_write_node(node)
         receiver = visit(node.receiver)
+
+        bounds(node.opening_loc)
+        on_lbracket("[")
+
         arguments, _ = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
 
+        bounds(node.closing_loc)
+        on_rbracket("]")
+
         bounds(node.location)
         target = on_aref_field(receiver, arguments)
 
@@ -2012,8 +2533,15 @@ module Prism
       # ^^^^^^^^^^^^^^^^
       def visit_index_or_write_node(node)
         receiver = visit(node.receiver)
+
+        bounds(node.opening_loc)
+        on_lbracket("[")
+
         arguments, _ = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
 
+        bounds(node.closing_loc)
+        on_rbracket("]")
+
         bounds(node.location)
         target = on_aref_field(receiver, arguments)
 
@@ -2029,8 +2557,15 @@ module Prism
       # ^^^^^^^^
       def visit_index_target_node(node)
         receiver = visit(node.receiver)
+
+        bounds(node.opening_loc)
+        on_lbracket("[")
+
         arguments, _ = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.closing_loc))
 
+        bounds(node.closing_loc)
+        on_rbracket("]")
+
         bounds(node.location)
         on_aref_field(receiver, arguments)
       end
@@ -2047,6 +2582,10 @@ module Prism
       def visit_instance_variable_write_node(node)
         bounds(node.name_loc)
         target = on_var_field(on_ivar(node.name.to_s))
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -2149,20 +2688,37 @@ module Prism
       # "foo #{bar}"
       # ^^^^^^^^^^^^
       def visit_interpolated_string_node(node)
-        if node.opening&.start_with?("<<~")
-          heredoc = visit_heredoc_string_node(node)
+        with_string_bounds(node) do
+          if node.opening&.start_with?("<<~")
+            heredoc = visit_heredoc_string_node(node)
 
-          bounds(node.location)
-          on_string_literal(heredoc)
-        elsif !node.heredoc? && node.parts.length > 1 && node.parts.any? { |part| (part.is_a?(StringNode) || part.is_a?(InterpolatedStringNode)) && !part.opening_loc.nil? }
-          first, *rest = node.parts
-          rest.inject(visit(first)) do |content, part|
-            concat = visit(part)
+            bounds(node.location)
+            on_string_literal(heredoc)
+          elsif !node.heredoc? && node.parts.length > 1 && node.parts.any? { |part| (part.is_a?(StringNode) || part.is_a?(InterpolatedStringNode)) && !part.opening_loc.nil? }
+            first, *rest = node.parts
+            rest.inject(visit(first)) do |content, part|
+              concat = visit(part)
+
+              bounds(part.location)
+              on_string_concat(content, concat)
+            end
+          else
+            bounds(node.parts.first.location)
+            parts =
+              node.parts.inject(on_string_content) do |content, part|
+                on_string_add(content, visit_string_content(part))
+              end
 
-            bounds(part.location)
-            on_string_concat(content, concat)
+            bounds(node.location)
+            on_string_literal(parts)
           end
-        else
+        end
+      end
+
+      # :"foo #{bar}"
+      # ^^^^^^^^^^^^^
+      def visit_interpolated_symbol_node(node)
+        with_string_bounds(node) do
           bounds(node.parts.first.location)
           parts =
             node.parts.inject(on_string_content) do |content, part|
@@ -2170,40 +2726,29 @@ module Prism
             end
 
           bounds(node.location)
-          on_string_literal(parts)
+          on_dyna_symbol(parts)
         end
       end
 
-      # :"foo #{bar}"
-      # ^^^^^^^^^^^^^
-      def visit_interpolated_symbol_node(node)
-        bounds(node.parts.first.location)
-        parts =
-          node.parts.inject(on_string_content) do |content, part|
-            on_string_add(content, visit_string_content(part))
-          end
-
-        bounds(node.location)
-        on_dyna_symbol(parts)
-      end
-
       # `foo #{bar}`
       # ^^^^^^^^^^^^
       def visit_interpolated_x_string_node(node)
-        if node.opening.start_with?("<<~")
-          heredoc = visit_heredoc_x_string_node(node)
+        with_string_bounds(node) do
+          if node.opening.start_with?("<<~")
+            heredoc = visit_heredoc_x_string_node(node)
 
-          bounds(node.location)
-          on_xstring_literal(heredoc)
-        else
-          bounds(node.parts.first.location)
-          parts =
-            node.parts.inject(on_xstring_new) do |content, part|
-              on_xstring_add(content, visit_string_content(part))
-            end
+            bounds(node.location)
+            on_xstring_literal(heredoc)
+          else
+            bounds(node.parts.first.location)
+            parts =
+              node.parts.inject(on_xstring_new) do |content, part|
+                on_xstring_add(content, visit_string_content(part))
+              end
 
-          bounds(node.location)
-          on_xstring_literal(parts)
+            bounds(node.location)
+            on_xstring_literal(parts)
+          end
         end
       end
 
@@ -2244,6 +2789,9 @@ module Prism
       # def foo(**); end
       #         ^^
       def visit_keyword_rest_parameter_node(node)
+        bounds(node.operator_loc)
+        on_op("**")
+
         if node.name_loc.nil?
           bounds(node.location)
           on_kwrest_param(nil)
@@ -2263,6 +2811,11 @@ module Prism
 
         parameters =
           if node.parameters.is_a?(BlockParametersNode)
+            if node.parameters.opening_loc
+              bounds(node.parameters.opening_loc)
+              on_lparen("(")
+            end
+
             # Ripper does not track block-locals within lambdas, so we skip
             # directly to the parameters here.
             params =
@@ -2273,6 +2826,13 @@ module Prism
                 visit(node.parameters.parameters)
               end
 
+            visit_all(node.parameters.locals)
+
+            if node.parameters.closing_loc
+              bounds(node.parameters.closing_loc)
+              on_rparen(")")
+            end
+
             if node.parameters.opening_loc.nil?
               params
             else
@@ -2285,9 +2845,11 @@ module Prism
           end
 
         braces = node.opening == "{"
+        bounds(node.opening_loc)
         if braces
-          bounds(node.opening_loc)
           on_tlambeg(node.opening)
+        else
+          on_kw("do")
         end
 
         body =
@@ -2300,7 +2862,7 @@ module Prism
             braces ? stmts : on_bodystmt(stmts, nil, nil, nil)
           when StatementsNode
             stmts = node.body.body
-            stmts.unshift(nil) if void_stmt?(node.parameters&.location || node.opening_loc, node.body.location, false)
+            stmts = [nil, *stmts] if void_stmt?(node.parameters&.location || node.opening_loc, node.body.location, false)
             stmts = visit_statements_node_body(stmts)
 
             bounds(node.body.location)
@@ -2311,6 +2873,13 @@ module Prism
             raise
           end
 
+          bounds(node.closing_loc)
+        if braces
+          on_rbrace("}")
+        else
+          on_kw("end")
+        end
+
         bounds(node.location)
         on_lambda(parameters, body)
       end
@@ -2327,6 +2896,10 @@ module Prism
       def visit_local_variable_write_node(node)
         bounds(node.name_loc)
         target = on_var_field(on_ident(node.name_loc.slice))
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit_write_value(node.value)
 
         bounds(node.location)
@@ -2401,6 +2974,8 @@ module Prism
       # ^^^^^^^^^^
       def visit_match_predicate_node(node)
         value = visit(node.value)
+        bounds(node.operator_loc)
+        on_kw("in")
         pattern = on_in(visit_pattern_node(node.pattern), nil, nil)
 
         on_case(value, pattern)
@@ -2410,6 +2985,10 @@ module Prism
       # ^^^^^^^^^^
       def visit_match_required_node(node)
         value = visit(node.value)
+
+        bounds(node.operator_loc)
+        on_op("=>")
+
         pattern = on_in(visit_pattern_node(node.pattern), nil, nil)
 
         on_case(value, pattern)
@@ -2423,13 +3002,16 @@ module Prism
 
       # A node that is missing from the syntax tree. This is only used in the
       # case of a syntax error.
-      def visit_missing_node(node)
-        raise "Cannot visit missing nodes directly."
+      def visit_error_recovery_node(node)
+        raise "Cannot visit error recovery nodes directly."
       end
 
       # module Foo; end
       # ^^^^^^^^^^^^^^^
       def visit_module_node(node)
+        bounds(node.module_keyword_loc)
+        on_kw("module")
+
         constant_path =
           if node.constant_path.is_a?(ConstantReadNode)
             bounds(node.constant_path.location)
@@ -2440,6 +3022,9 @@ module Prism
 
         bodystmt = visit_body_node(node.constant_path.location, node.body, true)
 
+        bounds(node.end_keyword_loc)
+        on_kw("end")
+
         bounds(node.location)
         on_module(constant_path, bodystmt)
       end
@@ -2447,9 +3032,19 @@ module Prism
       # (foo, bar), bar = qux
       # ^^^^^^^^^^
       def visit_multi_target_node(node)
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
         bounds(node.location)
         targets = visit_multi_target_node_targets(node.lefts, node.rest, node.rights, true)
 
+        if node.rparen_loc
+          bounds(node.rparen_loc)
+          on_rparen(")")
+        end
+
         if node.lparen_loc.nil?
           targets
         else
@@ -2501,9 +3096,22 @@ module Prism
       # foo, bar = baz
       # ^^^^^^^^^^^^^^
       def visit_multi_write_node(node)
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
         bounds(node.location)
         targets = visit_multi_target_node_targets(node.lefts, node.rest, node.rights, true)
 
+        if node.rparen_loc
+          bounds(node.rparen_loc)
+          on_rparen(")")
+        end
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         unless node.lparen_loc.nil?
           bounds(node.lparen_loc)
           targets = on_mlhs_paren(targets)
@@ -2521,6 +3129,9 @@ module Prism
       # next foo
       # ^^^^^^^^
       def visit_next_node(node)
+        bounds(node.keyword_loc)
+        on_kw("next")
+
         if node.arguments.nil?
           bounds(node.location)
           on_next(on_args_new)
@@ -2539,9 +3150,24 @@ module Prism
         on_var_ref(on_kw("nil"))
       end
 
+      # def foo(&nil); end
+      #         ^^^^
+      def visit_no_block_parameter_node(node)
+        bounds(node.operator_loc)
+        on_op("&")
+        bounds(node.keyword_loc)
+        on_kw("nil")
+        bounds(node.location)
+        on_blockarg(:nil)
+      end
+
       # def foo(**nil); end
       #         ^^^^^
       def visit_no_keywords_parameter_node(node)
+        bounds(node.operator_loc)
+        on_op("**")
+        bounds(node.keyword_loc)
+        on_kw("nil")
         bounds(node.location)
         on_nokw_param(nil)
 
@@ -2574,7 +3200,11 @@ module Prism
       #         ^^^^^^^
       def visit_optional_parameter_node(node)
         bounds(node.name_loc)
-        name = visit_token(node.name.to_s)
+        name = on_ident(node.name.to_s)
+
+        bounds(node.operator_loc)
+        on_op("=")
+
         value = visit(node.value)
 
         [name, value]
@@ -2584,6 +3214,14 @@ module Prism
       # ^^^^^^
       def visit_or_node(node)
         left = visit(node.left)
+
+        bounds(node.operator_loc)
+        if node.operator == "or"
+          on_kw("or")
+        else
+          on_op("||")
+        end
+
         right = visit(node.right)
 
         bounds(node.location)
@@ -2607,9 +3245,19 @@ module Prism
 
       # Visit a destructured positional parameter node.
       private def visit_destructured_parameter_node(node)
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
         bounds(node.location)
         targets = visit_multi_target_node_targets(node.lefts, node.rest, node.rights, false)
 
+        if node.rparen_loc
+          bounds(node.rparen_loc)
+          on_rparen(")")
+        end
+
         bounds(node.lparen_loc)
         on_mlhs_paren(targets)
       end
@@ -2620,6 +3268,9 @@ module Prism
       # (1)
       # ^^^
       def visit_parentheses_node(node)
+        bounds(node.opening_loc)
+        on_lparen("(")
+
         body =
           if node.body.nil?
             on_stmts_add(on_stmts_new, on_void_stmt)
@@ -2627,6 +3278,8 @@ module Prism
             visit(node.body)
           end
 
+        bounds(node.closing_loc)
+        on_rparen(")")
         bounds(node.location)
         on_paren(body)
       end
@@ -2634,8 +3287,15 @@ module Prism
       # foo => ^(bar)
       #        ^^^^^^
       def visit_pinned_expression_node(node)
+        bounds(node.operator_loc)
+        on_op("^")
+        bounds(node.lparen_loc)
+        on_lparen("(")
+
         expression = visit(node.expression)
 
+        bounds(node.rparen_loc)
+        on_rparen(")")
         bounds(node.location)
         on_begin(expression)
       end
@@ -2643,12 +3303,20 @@ module Prism
       # foo = 1 and bar => ^foo
       #                    ^^^^
       def visit_pinned_variable_node(node)
+        bounds(node.operator_loc)
+        on_op("^")
+
         visit(node.variable)
       end
 
       # END {}
       # ^^^^^^
       def visit_post_execution_node(node)
+        bounds(node.keyword_loc)
+        on_kw("END")
+        bounds(node.opening_loc)
+        on_lbrace("{")
+
         statements =
           if node.statements.nil?
             bounds(node.location)
@@ -2657,6 +3325,8 @@ module Prism
             visit(node.statements)
           end
 
+        bounds(node.closing_loc)
+        on_rbrace("}")
         bounds(node.location)
         on_END(statements)
       end
@@ -2664,6 +3334,11 @@ module Prism
       # BEGIN {}
       # ^^^^^^^^
       def visit_pre_execution_node(node)
+        bounds(node.keyword_loc)
+        on_kw("BEGIN")
+        bounds(node.opening_loc)
+        on_lbrace("{")
+
         statements =
           if node.statements.nil?
             bounds(node.location)
@@ -2672,6 +3347,8 @@ module Prism
             visit(node.statements)
           end
 
+        bounds(node.closing_loc)
+        on_rbrace("}")
         bounds(node.location)
         on_BEGIN(statements)
       end
@@ -2679,7 +3356,7 @@ module Prism
       # The top-level program node.
       def visit_program_node(node)
         body = node.statements.body
-        body << nil if body.empty?
+        body = [nil] if body.empty?
         statements = visit_statements_node_body(body)
 
         bounds(node.location)
@@ -2690,6 +3367,10 @@ module Prism
       # ^^^^
       def visit_range_node(node)
         left = visit(node.left)
+
+        bounds(node.operator_loc)
+        on_op(node.operator)
+
         right = visit(node.right)
 
         bounds(node.location)
@@ -2710,6 +3391,7 @@ module Prism
       # ^^^^
       def visit_redo_node(node)
         bounds(node.location)
+        on_kw("redo")
         on_redo
       end
 
@@ -2752,6 +3434,9 @@ module Prism
       # foo rescue bar
       # ^^^^^^^^^^^^^^
       def visit_rescue_modifier_node(node)
+        bounds(node.keyword_loc)
+        on_kw("rescue")
+
         expression = visit_write_value(node.expression)
         rescue_expression = visit(node.rescue_expression)
 
@@ -2762,6 +3447,9 @@ module Prism
       # begin; rescue; end
       #        ^^^^^^^
       def visit_rescue_node(node)
+        bounds(node.keyword_loc)
+        on_kw("rescue")
+
         exceptions =
           case node.exceptions.length
           when 0
@@ -2799,6 +3487,11 @@ module Prism
             end
           end
 
+        if node.operator_loc
+          bounds(node.operator_loc)
+          on_op("=>")
+        end
+
         reference = visit(node.reference)
         statements =
           if node.statements.nil?
@@ -2808,10 +3501,10 @@ module Prism
             visit(node.statements)
           end
 
-        consequent = visit(node.consequent)
+        subsequent = visit(node.subsequent)
 
         bounds(node.location)
-        on_rescue(exceptions, reference, statements, consequent)
+        on_rescue(exceptions, reference, statements, subsequent)
       end
 
       # def foo(*bar); end
@@ -2820,12 +3513,15 @@ module Prism
       # def foo(*); end
       #         ^
       def visit_rest_parameter_node(node)
+        bounds(node.operator_loc)
+        on_op("*")
+
         if node.name_loc.nil?
           bounds(node.location)
           on_rest_param(nil)
         else
           bounds(node.name_loc)
-          on_rest_param(visit_token(node.name.to_s))
+          on_rest_param(on_ident(node.name.to_s))
         end
       end
 
@@ -2833,6 +3529,7 @@ module Prism
       # ^^^^^
       def visit_retry_node(node)
         bounds(node.location)
+        on_kw("retry")
         on_retry
       end
 
@@ -2842,6 +3539,9 @@ module Prism
       # return 1
       # ^^^^^^^^
       def visit_return_node(node)
+        bounds(node.keyword_loc)
+        on_kw("return")
+
         if node.arguments.nil?
           bounds(node.location)
           on_return0
@@ -2868,9 +3568,17 @@ module Prism
       # class << self; end
       # ^^^^^^^^^^^^^^^^^^
       def visit_singleton_class_node(node)
+        bounds(node.class_keyword_loc)
+        on_kw("class")
+        bounds(node.operator_loc)
+        on_op("<<")
+
         expression = visit(node.expression)
         bodystmt = visit_body_node(node.body&.location || node.end_keyword_loc, node.body)
 
+        bounds(node.end_keyword_loc)
+        on_kw("end")
+
         bounds(node.location)
         on_sclass(expression, bodystmt)
       end
@@ -2905,6 +3613,8 @@ module Prism
       # def foo(*); bar(*); end
       #                 ^
       def visit_splat_node(node)
+        bounds(node.operator_loc)
+        on_op("*")
         visit(node.expression)
       end
 
@@ -2927,26 +3637,68 @@ module Prism
       # "foo"
       # ^^^^^
       def visit_string_node(node)
-        if (content = node.content).empty?
-          bounds(node.location)
-          on_string_literal(on_string_content)
-        elsif (opening = node.opening) == "?"
-          bounds(node.location)
-          on_CHAR("?#{node.content}")
-        elsif opening.start_with?("<<~")
-          heredoc = visit_heredoc_string_node(node.to_interpolated)
+        with_string_bounds(node) do
+          if (content = node.content).empty?
+            bounds(node.location)
+            on_string_literal(on_string_content)
+          elsif (opening = node.opening) == "?"
+            bounds(node.location)
+            on_CHAR("?#{node.content}")
+          elsif opening.start_with?("<<~")
+            heredoc = visit_heredoc_string_node(node.to_interpolated)
 
-          bounds(node.location)
-          on_string_literal(heredoc)
-        else
-          bounds(node.content_loc)
-          tstring_content = on_tstring_content(content)
+            bounds(node.location)
+            on_string_literal(heredoc)
+          else
+            bounds(node.content_loc)
+            tstring_content = on_tstring_content(content)
 
-          bounds(node.location)
-          on_string_literal(on_string_add(on_string_content, tstring_content))
+            bounds(node.location)
+            on_string_literal(on_string_add(on_string_content, tstring_content))
+          end
         end
       end
 
+      # Responsible for emitting the various string-like begin/end events
+      private def with_string_bounds(node)
+        # `foo "bar": baz` doesn't emit the closing location
+        assoc = !(opening = node.opening)&.include?(":") && node.closing&.end_with?(":")
+
+        is_heredoc = opening&.start_with?("<<")
+        if is_heredoc
+          bounds(node.opening_loc)
+          on_heredoc_beg(node.opening)
+        elsif opening&.start_with?(":", "%s")
+          bounds(node.opening_loc)
+          on_symbeg(node.opening)
+        elsif opening&.start_with?("`", "%x")
+          bounds(node.opening_loc)
+          on_backtick(node.opening)
+        elsif opening && !opening.start_with?("?")
+          bounds(node.opening_loc)
+          on_tstring_beg(opening)
+        end
+
+        result = yield
+        if assoc
+          if node.closing != ":"
+            bounds(node.closing_loc)
+            on_label_end(node.closing)
+          end
+          return result
+        end
+
+        if is_heredoc
+          bounds(node.closing_loc)
+          on_heredoc_end(node.closing)
+        elsif node.closing_loc
+          bounds(node.closing_loc)
+          on_tstring_end(node.closing)
+        end
+
+        result
+      end
+
       # Ripper gives back the escaped string content but strips out the common
       # leading whitespace. Prism gives back the unescaped string content and
       # a location for the escaped string content. Unfortunately these don't
@@ -3024,42 +3776,39 @@ module Prism
 
       # Visit a heredoc node that is representing a string.
       private def visit_heredoc_string_node(node)
-        bounds(node.opening_loc)
-        on_heredoc_beg(node.opening)
-
         bounds(node.location)
-        result =
-          visit_heredoc_node(node.parts, on_string_content) do |parts, part|
-            on_string_add(parts, part)
-          end
-
-        bounds(node.closing_loc)
-        on_heredoc_end(node.closing)
-
-        result
+        visit_heredoc_node(node.parts, on_string_content) do |parts, part|
+          on_string_add(parts, part)
+        end
       end
 
       # Visit a heredoc node that is representing an xstring.
       private def visit_heredoc_x_string_node(node)
-        bounds(node.opening_loc)
-        on_heredoc_beg(node.opening)
-
         bounds(node.location)
-        result =
-          visit_heredoc_node(node.parts, on_xstring_new) do |parts, part|
-            on_xstring_add(parts, part)
-          end
-
-        bounds(node.closing_loc)
-        on_heredoc_end(node.closing)
-
-        result
+        visit_heredoc_node(node.parts, on_xstring_new) do |parts, part|
+          on_xstring_add(parts, part)
+        end
       end
 
       # super(foo)
       # ^^^^^^^^^^
       def visit_super_node(node)
-        arguments, block = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.rparen_loc || node.location))
+        bounds(node.keyword_loc)
+        on_kw("super")
+
+        if node.lparen_loc
+          bounds(node.lparen_loc)
+          on_lparen("(")
+        end
+
+        arguments, block_node = visit_call_node_arguments(node.arguments, node.block, trailing_comma?(node.arguments&.location || node.location, node.rparen_loc || node.location))
+
+        if node.rparen_loc
+          bounds(node.rparen_loc)
+          on_rparen(")")
+        end
+
+        block = visit(block_node)
 
         if !node.lparen_loc.nil?
           bounds(node.lparen_loc)
@@ -3069,35 +3818,36 @@ module Prism
         bounds(node.location)
         call = on_super(arguments)
 
-        if block.nil?
-          call
-        else
+        if block_node
           bounds(node.block.location)
           on_method_add_block(call, block)
+        else
+          call
         end
       end
 
       # :foo
       # ^^^^
       def visit_symbol_node(node)
-        if (opening = node.opening)&.match?(/^%s|['"]:?$/)
-          bounds(node.value_loc)
-          content = on_string_content
-
-          if !(value = node.value).empty?
-            content = on_string_add(content, on_tstring_content(value))
+        with_string_bounds(node) do
+          if node.value_loc.nil?
+            bounds(node.location)
+            on_dyna_symbol(on_string_content)
+          elsif (opening = node.opening)&.match?(/^%s|['"]:?$/)
+            bounds(node.value_loc)
+            content = on_string_add(on_string_content, on_tstring_content(node.value))
+            bounds(node.location)
+            on_dyna_symbol(content)
+          elsif (closing = node.closing) == ":"
+            bounds(node.location)
+            on_label("#{node.value}:")
+          elsif opening.nil? && node.closing_loc.nil?
+            bounds(node.value_loc)
+            on_symbol_literal(visit_token(node.value))
+          else
+            bounds(node.value_loc)
+            on_symbol_literal(on_symbol(visit_token(node.value)))
           end
-
-          on_dyna_symbol(content)
-        elsif (closing = node.closing) == ":"
-          bounds(node.location)
-          on_label("#{node.value}:")
-        elsif opening.nil? && node.closing_loc.nil?
-          bounds(node.value_loc)
-          on_symbol_literal(visit_token(node.value))
-        else
-          bounds(node.value_loc)
-          on_symbol_literal(on_symbol(visit_token(node.value)))
         end
       end
 
@@ -3111,6 +3861,9 @@ module Prism
       # undef foo
       # ^^^^^^^^^
       def visit_undef_node(node)
+        bounds(node.keyword_loc)
+        on_kw("undef")
+
         names = visit_all(node.names)
 
         bounds(node.location)
@@ -3124,7 +3877,13 @@ module Prism
       # ^^^^^^^^^^^^^^
       def visit_unless_node(node)
         if node.statements.nil? || (node.predicate.location.start_offset < node.statements.location.start_offset)
+          bounds(node.keyword_loc)
+          on_kw("unless")
           predicate = visit(node.predicate)
+          if node.then_keyword_loc
+            bounds(node.then_keyword_loc)
+            on_kw("then")
+          end
           statements =
             if node.statements.nil?
               bounds(node.location)
@@ -3132,12 +3891,19 @@ module Prism
             else
               visit(node.statements)
             end
-          consequent = visit(node.consequent)
+          else_clause = visit(node.else_clause)
+
+          if node.end_keyword_loc && !node.else_clause
+            bounds(node.end_keyword_loc)
+            on_kw("end")
+          end
 
           bounds(node.location)
-          on_unless(predicate, statements, consequent)
+          on_unless(predicate, statements, else_clause)
         else
           statements = visit(node.statements.body.first)
+          bounds(node.keyword_loc)
+          on_kw("unless")
           predicate = visit(node.predicate)
 
           bounds(node.location)
@@ -3151,7 +3917,14 @@ module Prism
       # bar until foo
       # ^^^^^^^^^^^^^
       def visit_until_node(node)
+        bounds(node.keyword_loc)
+        on_kw("until")
+
         if node.statements.nil? || (node.predicate.location.start_offset < node.statements.location.start_offset)
+          if node.do_keyword_loc
+            bounds(node.do_keyword_loc)
+            on_kw("do")
+          end
           predicate = visit(node.predicate)
           statements =
             if node.statements.nil?
@@ -3161,6 +3934,11 @@ module Prism
               visit(node.statements)
             end
 
+          if node.closing_loc
+            bounds(node.closing_loc)
+            on_kw("end")
+          end
+
           bounds(node.location)
           on_until(predicate, statements)
         else
@@ -3176,9 +3954,16 @@ module Prism
       #           ^^^^^^^^^^^^^
       def visit_when_node(node)
         # This is a special case where we're not going to call on_when directly
-        # because we don't have access to the consequent. Instead, we'll return
+        # because we don't have access to the subsequent. Instead, we'll return
         # the component parts and let the parent node handle it.
+        bounds(node.keyword_loc)
+        on_kw("when")
+
         conditions = visit_arguments(node.conditions)
+        if node.then_keyword_loc
+          bounds(node.then_keyword_loc)
+          on_kw("then")
+        end
         statements =
           if node.statements.nil?
             bounds(node.location)
@@ -3197,7 +3982,17 @@ module Prism
       # ^^^^^^^^^^^^^
       def visit_while_node(node)
         if node.statements.nil? || (node.predicate.location.start_offset < node.statements.location.start_offset)
+          bounds(node.keyword_loc)
+          on_kw("while")
+          if node.do_keyword_loc
+            bounds(node.do_keyword_loc)
+            on_kw("do")
+          end
           predicate = visit(node.predicate)
+          if node.closing_loc
+            bounds(node.closing_loc)
+            on_kw("end")
+          end
           statements =
             if node.statements.nil?
               bounds(node.location)
@@ -3210,6 +4005,8 @@ module Prism
           on_while(predicate, statements)
         else
           statements = visit(node.statements.body.first)
+          bounds(node.keyword_loc)
+          on_kw("while")
           predicate = visit(node.predicate)
 
           bounds(node.location)
@@ -3220,20 +4017,22 @@ module Prism
       # `foo`
       # ^^^^^
       def visit_x_string_node(node)
-        if node.unescaped.empty?
-          bounds(node.location)
-          on_xstring_literal(on_xstring_new)
-        elsif node.opening.start_with?("<<~")
-          heredoc = visit_heredoc_x_string_node(node.to_interpolated)
+        with_string_bounds(node) do
+          if node.unescaped.empty?
+            bounds(node.location)
+            on_xstring_literal(on_xstring_new)
+          elsif node.opening.start_with?("<<~")
+            heredoc = visit_heredoc_x_string_node(node.to_interpolated)
 
-          bounds(node.location)
-          on_xstring_literal(heredoc)
-        else
-          bounds(node.content_loc)
-          content = on_tstring_content(node.content)
+            bounds(node.location)
+            on_xstring_literal(heredoc)
+          else
+            bounds(node.content_loc)
+            content = on_tstring_content(node.content)
 
-          bounds(node.location)
-          on_xstring_literal(on_xstring_add(on_xstring_new, content))
+            bounds(node.location)
+            on_xstring_literal(on_xstring_add(on_xstring_new, content))
+          end
         end
       end
 
@@ -3243,10 +4042,18 @@ module Prism
       # yield 1
       # ^^^^^^^
       def visit_yield_node(node)
+        bounds(node.keyword_loc)
+        on_kw("yield")
+
         if node.arguments.nil? && node.lparen_loc.nil?
           bounds(node.location)
           on_yield0
         else
+          if node.lparen_loc
+            bounds(node.lparen_loc)
+            on_lparen("(")
+          end
+
           arguments =
             if node.arguments.nil?
               bounds(node.location)
@@ -3256,6 +4063,8 @@ module Prism
             end
 
           unless node.lparen_loc.nil?
+            bounds(node.rparen_loc)
+            on_rparen(")")
             bounds(node.lparen_loc)
             arguments = on_paren(arguments)
           end
@@ -3269,11 +4078,11 @@ module Prism
 
       # Lazily initialize the parse result.
       def result
-        @result ||=
-          begin
-            scopes = RUBY_VERSION >= "3.3.0" ? [] : [[]]
-            Prism.parse(source, scopes: scopes)
-          end
+        @result ||= Prism.parse(source, partial_script: true, version: "current", freeze: true, encoding: source.encoding)
+      end
+
+      def line_and_column_cache
+        @line_and_column_cache ||= LineAndColumnCache.new(result.source)
       end
 
       ##########################################################################
@@ -3294,30 +4103,34 @@ module Prism
       # Visit the string content of a particular node. This method is used to
       # split into the various token types.
       def visit_token(token, allow_keywords = true)
-        case token
-        when "."
+        if token == "."
           on_period(token)
-        when "`"
+        elsif token == "`"
           on_backtick(token)
-        when *(allow_keywords ? KEYWORDS : [])
+        elsif allow_keywords && KEYWORDS.include?(token)
           on_kw(token)
-        when /^_/
+        elsif token.start_with?("_")
           on_ident(token)
-        when /^[[:upper:]]\w*$/
+        elsif token.match?(/^[[:upper:]]\w*$/)
           on_const(token)
-        when /^@@/
+        elsif token.start_with?("@@")
           on_cvar(token)
-        when /^@/
+        elsif token.start_with?("@")
           on_ivar(token)
-        when /^\$/
+        elsif token.start_with?("$")
           on_gvar(token)
-        when /^[[:punct:]]/
+        elsif token.match?(/^[[:punct:]]/)
           on_op(token)
         else
           on_ident(token)
         end
       end
 
+      # Visit either `.`, `&.`, or `::`.
+      def visit_call_operator(token)
+        token == "." ? on_period(token) : on_op(token)
+      end
+
       # Visit a node that represents a number. We need to explicitly handle the
       # unary - operator.
       def visit_number_node(node)
@@ -3325,6 +4138,9 @@ module Prism
         location = node.location
 
         if slice[0] == "-"
+          bounds(location.copy(length: 1))
+          on_op("-")
+
           bounds(location.copy(start_offset: location.start_offset + 1))
           value = yield slice[1..-1]
 
@@ -3373,26 +4189,24 @@ module Prism
 
       # This method is responsible for updating lineno and column information
       # to reflect the current node.
-      #
-      # This method could be drastically improved with some caching on the start
-      # of every line, but for now it's good enough.
       def bounds(location)
-        @lineno = location.start_line
-        @column = location.start_column
+        @lineno, @column = line_and_column_cache.line_and_column(location.start_offset)
       end
 
+      # :startdoc:
+
       ##########################################################################
       # Ripper interface
       ##########################################################################
 
       # :stopdoc:
       def _dispatch_0; end
-      def _dispatch_1(_); end
-      def _dispatch_2(_, _); end
-      def _dispatch_3(_, _, _); end
-      def _dispatch_4(_, _, _, _); end
-      def _dispatch_5(_, _, _, _, _); end
-      def _dispatch_7(_, _, _, _, _, _, _); end
+      def _dispatch_1(arg); arg end
+      def _dispatch_2(arg, _); arg end
+      def _dispatch_3(arg, _, _); arg end
+      def _dispatch_4(arg, _, _, _); arg end
+      def _dispatch_5(arg, _, _, _, _); arg end
+      def _dispatch_7(arg, _, _, _, _, _, _); arg end
       # :startdoc:
 
       #
diff --git a/lib/prism/translation/ripper/filter.rb b/lib/prism/translation/ripper/filter.rb
new file mode 100644
index 0000000000..19deef2d37
--- /dev/null
+++ b/lib/prism/translation/ripper/filter.rb
@@ -0,0 +1,53 @@
+# frozen_string_literal: true
+
+module Prism
+  module Translation
+    class Ripper
+      class Filter # :nodoc:
+        # :stopdoc:
+        def initialize(src, filename = '-', lineno = 1)
+          @__lexer = Lexer.new(src, filename, lineno)
+          @__line = nil
+          @__col = nil
+          @__state = nil
+        end
+
+        def filename
+          @__lexer.filename
+        end
+
+        def lineno
+          @__line
+        end
+
+        def column
+          @__col
+        end
+
+        def state
+          @__state
+        end
+
+        def parse(init = nil)
+          data = init
+          @__lexer.lex.each do |pos, event, tok, state|
+            @__line, @__col = *pos
+            @__state = state
+            data = if respond_to?(event, true)
+                  then __send__(event, tok, data)
+                  else on_default(event, tok, data)
+                  end
+          end
+          data
+        end
+
+        private
+
+        def on_default(event, token, data)
+          data
+        end
+        # :startdoc:
+      end
+    end
+  end
+end
diff --git a/lib/prism/translation/ripper/lexer.rb b/lib/prism/translation/ripper/lexer.rb
new file mode 100644
index 0000000000..c6aeae4bd7
--- /dev/null
+++ b/lib/prism/translation/ripper/lexer.rb
@@ -0,0 +1,133 @@
+# frozen_string_literal: true
+# :markup: markdown
+
+require_relative "../ripper"
+
+module Prism
+  module Translation
+    class Ripper
+      class Lexer < Ripper # :nodoc:
+        class State # :nodoc:
+          attr_reader :to_int, :to_s
+
+          def initialize(i)
+            @to_int = i
+            @to_s = Ripper.lex_state_name(i)
+            freeze
+          end
+
+          def [](index)
+            case index
+            when 0, :to_int
+              @to_int
+            when 1, :to_s
+              @to_s
+            else
+              nil
+            end
+          end
+
+          alias to_i to_int
+          alias inspect to_s
+          def pretty_print(q) q.text(to_s) end
+          def ==(i) super or to_int == i end
+          def &(i) self.class.new(to_int & i) end
+          def |(i) self.class.new(to_int | i) end
+          def allbits?(i) to_int.allbits?(i) end
+          def anybits?(i) to_int.anybits?(i) end
+          def nobits?(i) to_int.nobits?(i) end
+
+          # Instances are frozen and there are only a handful of them so we
+          # cache them here.
+          STATES = Hash.new { |hash, key| hash[key] = State.new(key) }
+          private_constant :STATES
+
+          def self.[](i)
+            STATES[i]
+          end
+        end
+
+        class Elem # :nodoc:
+          attr_accessor :pos, :event, :tok, :state, :message
+
+          def initialize(pos, event, tok, state, message = nil)
+            @pos = pos
+            @event = event
+            @tok = tok
+            @state = State[state]
+            @message = message
+          end
+
+          def [](index)
+            case index
+            when 0, :pos
+              @pos
+            when 1, :event
+              @event
+            when 2, :tok
+              @tok
+            when 3, :state
+              @state
+            when 4, :message
+              @message
+            else
+              nil
+            end
+          end
+
+          def inspect
+            "#<#{self.class}: #{event}@#{pos[0]}:#{pos[1]}:#{state}: #{tok.inspect}#{": " if message}#{message}>"
+          end
+
+          alias to_s inspect
+
+          def pretty_print(q)
+            q.group(2, "#<#{self.class}:", ">") {
+              q.breakable
+              q.text("#{event}@#{pos[0]}:#{pos[1]}")
+              q.breakable
+              state.pretty_print(q)
+              q.breakable
+              q.text("token: ")
+              tok.pretty_print(q)
+              if message
+                q.breakable
+                q.text("message: ")
+                q.text(message)
+              end
+            }
+          end
+
+          def to_a
+            if @message
+              [@pos, @event, @tok, @state, @message]
+            else
+              [@pos, @event, @tok, @state]
+            end
+          end
+        end
+
+        # Pretty much just the same as Prism.lex_compat.
+        def lex(raise_errors: false)
+          Ripper.lex(@source, filename, lineno, raise_errors: raise_errors)
+        end
+
+        # Returns the lex_compat result wrapped in `Elem`. Errors are omitted.
+        # Since ripper is a streaming parser, tokens are expected to be emitted in the order
+        # that the parser encounters them. This is not implemented.
+        def parse(...)
+          lex(...).map do |position, event, token, state|
+            Elem.new(position, event, token, state.to_int)
+          end
+        end
+
+        # Similar to parse but ripper sorts the elements by position in the source. Also
+        # includes errors. Since prism does error recovery, in cases of syntax errors
+        # the result may differ greatly compared to ripper.
+        def scan(...)
+          parse(...)
+        end
+      end
+    end
+  end
+end
diff --git a/lib/prism/translation/ripper/sexp.rb b/lib/prism/translation/ripper/sexp.rb
index dc26a639a3..46c0333544 100644
--- a/lib/prism/translation/ripper/sexp.rb
+++ b/lib/prism/translation/ripper/sexp.rb
@@ -1,4 +1,5 @@
 # frozen_string_literal: true
+# :markup: markdown
 
 require_relative "../ripper"
 
@@ -7,9 +8,7 @@ module Prism
     class Ripper
       # This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that
       # returns the arrays of [type, *children].
-      class SexpBuilder < Ripper
-        # :stopdoc:
-
+      class SexpBuilder < Ripper # :nodoc:
         attr_reader :error
 
         private
@@ -64,16 +63,12 @@ module Prism
         remove_method :on_parse_error
         alias on_parse_error on_error
         alias compile_error on_error
-
-        # :startdoc:
       end
 
       # This class mirrors the ::Ripper::SexpBuilderPP subclass of ::Ripper that
       # returns the same values as ::Ripper::SexpBuilder except with a couple of
       # niceties that flatten linked lists into arrays.
-      class SexpBuilderPP < SexpBuilder
-        # :stopdoc:
-
+      class SexpBuilderPP < SexpBuilder # :nodoc:
         private
 
         def on_heredoc_dedent(val, width)
@@ -117,8 +112,6 @@ module Prism
             alias_method "on_#{event}", :_dispatch_event_push
           end
         end
-
-        # :startdoc:
       end
     end
   end
diff --git a/lib/prism/translation/ripper/shim.rb b/lib/prism/translation/ripper/shim.rb
index 10e21cd16a..00ed625da3 100644
--- a/lib/prism/translation/ripper/shim.rb
+++ b/lib/prism/translation/ripper/shim.rb
@@ -2,4 +2,6 @@
 
 # This writes the prism ripper translation into the Ripper constant so that
 # users can transparently use Ripper without any changes.
+# :stopdoc:
 Ripper = Prism::Translation::Ripper
+# :startdoc:
diff --git a/lib/prism/translation/ruby_parser.rb b/lib/prism/translation/ruby_parser.rb
index 38690c54b3..42bc5ee658 100644
--- a/lib/prism/translation/ruby_parser.rb
+++ b/lib/prism/translation/ruby_parser.rb
@@ -1,21 +1,27 @@
 # frozen_string_literal: true
+# :markup: markdown
 
 begin
-  require "ruby_parser"
+  require "sexp"
 rescue LoadError
-  warn(%q{Error: Unable to load ruby_parser. Add `gem "ruby_parser"` to your Gemfile.})
+  warn(%q{Error: Unable to load sexp. Add `gem "sexp_processor"` to your Gemfile.})
   exit(1)
 end
 
+class RubyParser # :nodoc:
+  class SyntaxError < RuntimeError # :nodoc:
+  end
+end
+
 module Prism
   module Translation
     # This module is the entry-point for converting a prism syntax tree into the
     # seattlerb/ruby_parser gem's syntax tree.
     class RubyParser
       # A prism visitor that builds Sexp objects.
-      class Compiler < ::Prism::Compiler
+      class Compiler < ::Prism::Compiler # :nodoc:
         # This is the name of the file that we are compiling. We set it on every
-        # Sexp object that is generated, and also use it to compile __FILE__
+        # Sexp object that is generated, and also use it to compile `__FILE__`
         # nodes.
         attr_reader :file
 
@@ -55,7 +61,19 @@ module Prism
         # a and b
         # ^^^^^^^
         def visit_and_node(node)
-          s(node, :and, visit(node.left), visit(node.right))
+          left = visit(node.left)
+
+          if left[0] == :and
+            # ruby_parser has the and keyword as right-associative as opposed to
+            # prism which has it as left-associative. We reverse that
+            # associativity here.
+            nest = left
+            nest = nest[2] while nest[2][0] == :and
+            nest[2] = s(node, :and, nest[2], visit(node.right))
+            left
+          else
+            s(node, :and, left, visit(node.right))
+          end
         end
 
         # []
@@ -119,7 +137,7 @@ module Prism
         # $+
         # ^^
         def visit_back_reference_read_node(node)
-          s(node, :back_ref, node.name.name.delete_prefix("$").to_sym)
+          s(node, :back_ref, node.name.to_s.delete_prefix("$").to_sym)
         end
 
         # begin end
@@ -135,7 +153,7 @@ module Prism
             end
 
             current = node.rescue_clause
-            until (current = current.consequent).nil?
+            until (current = current.subsequent).nil?
               result << visit(current)
             end
           end
@@ -251,6 +269,11 @@ module Prism
               when RegularExpressionNode, InterpolatedRegularExpressionNode
                 return s(node, :match2, visit(node.receiver), visit(node.arguments.arguments.first))
               end
+
+              case node.arguments.arguments.first
+              when RegularExpressionNode, InterpolatedRegularExpressionNode
+                return s(node, :match3, visit(node.arguments.arguments.first), visit(node.receiver))
+              end
             end
           end
 
@@ -330,13 +353,13 @@ module Prism
         # case foo; when bar; end
         # ^^^^^^^^^^^^^^^^^^^^^^^
         def visit_case_node(node)
-          s(node, :case, visit(node.predicate)).concat(visit_all(node.conditions)) << visit(node.consequent)
+          s(node, :case, visit(node.predicate)).concat(visit_all(node.conditions)) << visit(node.else_clause)
         end
 
         # case foo; in bar; end
         # ^^^^^^^^^^^^^^^^^^^^^
         def visit_case_match_node(node)
-          s(node, :case, visit(node.predicate)).concat(visit_all(node.conditions)) << visit(node.consequent)
+          s(node, :case, visit(node.predicate)).concat(visit_all(node.conditions)) << visit(node.else_clause)
         end
 
         # class Foo; end
@@ -349,14 +372,18 @@ module Prism
               visit(node.constant_path)
             end
 
-          if node.body.nil?
-            s(node, :class, name, visit(node.superclass))
-          elsif node.body.is_a?(StatementsNode)
-            compiler = copy_compiler(in_def: false)
-            s(node, :class, name, visit(node.superclass)).concat(node.body.body.map { |child| child.accept(compiler) })
-          else
-            s(node, :class, name, visit(node.superclass), node.body.accept(copy_compiler(in_def: false)))
-          end
+          result =
+            if node.body.nil?
+              s(node, :class, name, visit(node.superclass))
+            elsif node.body.is_a?(StatementsNode)
+              compiler = copy_compiler(in_def: false)
+              s(node, :class, name, visit(node.superclass)).concat(node.body.body.map { |child| child.accept(compiler) })
+            else
+              s(node, :class, name, visit(node.superclass), node.body.accept(copy_compiler(in_def: false)))
+            end
+
+          attach_comments(result, node)
+          result
         end
 
         # @@foo
@@ -367,9 +394,6 @@ module Prism
 
         # @@foo = 1
         # ^^^^^^^^^
-        #
-        # @@foo, @@bar = 1
-        # ^^^^^  ^^^^^
         def visit_class_variable_write_node(node)
           s(node, class_variable_write_type, node.name, visit_write_value(node.value))
         end
@@ -507,7 +531,9 @@ module Prism
               s(node, :defs, visit(node.receiver), name)
             end
 
+          attach_comments(result, node)
           result.line(node.name_loc.start_line)
+
           if node.parameters.nil?
             result << s(node, :args).line(node.name_loc.start_line)
           else
@@ -622,9 +648,6 @@ module Prism
 
         # $foo = 1
         # ^^^^^^^^
-        #
-        # $foo, $bar = 1
-        # ^^^^  ^^^^
         def visit_global_variable_write_node(node)
           s(node, :gasgn, node.name, visit_write_value(node.value))
         end
@@ -683,7 +706,7 @@ module Prism
         # foo ? bar : baz
         # ^^^^^^^^^^^^^^^
         def visit_if_node(node)
-          s(node, :if, visit(node.predicate), visit(node.statements), visit(node.consequent))
+          s(node, :if, visit(node.predicate), visit(node.statements), visit(node.subsequent))
         end
 
         # 1i
@@ -770,9 +793,6 @@ module Prism
 
         # @foo = 1
         # ^^^^^^^^
-        #
-        # @foo, @bar = 1
-        # ^^^^  ^^^^
         def visit_instance_variable_write_node(node)
           s(node, :iasgn, node.name, visit_write_value(node.value))
         end
@@ -864,6 +884,7 @@ module Prism
         # Visit the interpolated content of the string-like node.
         private def visit_interpolated_parts(parts)
           visited = []
+
           parts.each do |part|
             result = visit(part)
 
@@ -875,7 +896,15 @@ module Prism
               else
                 visited << result
               end
+              visited << :space
             elsif result[0] == :dstr
+              if !visited.empty? && part.parts[0].is_a?(StringNode)
+                # If we are in the middle of an implicitly concatenated string,
+                # we should not have a bare string as the first part. In this
+                # case we need to visit just that first part and then we can
+                # push the rest of the parts onto the visited array.
+                result[1] = visit(part.parts[0])
+              end
               visited.concat(result[1..-1])
             else
               visited << result
@@ -883,8 +912,9 @@ module Prism
           end
 
           state = :beginning #: :beginning | :string_content | :interpolated_content
+          results = []
 
-          visited.each_with_object([]) do |result, results|
+          visited.each_with_index do |result, index|
             case state
             when :beginning
               if result.is_a?(String)
@@ -899,23 +929,29 @@ module Prism
                 state = :interpolated_content
               end
             when :string_content
-              if result.is_a?(String)
-                results[0] << result
+              if result == :space
+                # continue
+              elsif result.is_a?(String)
+                results[0] = "#{results[0]}#{result}"
               elsif result.is_a?(Array) && result[0] == :str
-                results[0] << result[1]
+                results[0] = "#{results[0]}#{result[1]}"
               else
                 results << result
                 state = :interpolated_content
               end
             when :interpolated_content
-              if result.is_a?(Array) && result[0] == :str && results[-1][0] == :str && (results[-1].line_max == result.line)
-                results[-1][1] << result[1]
+              if result == :space
+                # continue
+              elsif visited[index - 1] != :space && result.is_a?(Array) && result[0] == :str && results[-1][0] == :str && (results[-1].line_max == result.line)
+                results[-1][1] = "#{results[-1][1]}#{result[1]}"
                 results[-1].line_max = result.line_max
               else
                 results << result
               end
             end
           end
+
+          results
         end
 
         # -> { it }
@@ -943,8 +979,8 @@ module Prism
         def visit_lambda_node(node)
           parameters =
             case node.parameters
-            when nil, NumberedParametersNode
-              s(node, :args)
+            when nil, ItParametersNode, NumberedParametersNode
+              0
             else
               visit(node.parameters)
             end
@@ -968,9 +1004,6 @@ module Prism
 
         # foo = 1
         # ^^^^^^^
-        #
-        # foo, bar = 1
-        # ^^^  ^^^
         def visit_local_variable_write_node(node)
           s(node, :lasgn, node.name, visit_write_value(node.value))
         end
@@ -1026,8 +1059,8 @@ module Prism
         # A node that is missing from the syntax tree. This is only used in the
         # case of a syntax error. The parser gem doesn't have such a concept, so
         # we invent our own here.
-        def visit_missing_node(node)
-          raise "Cannot visit missing node directly"
+        def visit_error_recovery_node(node)
+          raise "Cannot visit error recovery node directly"
         end
 
         # module Foo; end
@@ -1040,14 +1073,18 @@ module Prism
               visit(node.constant_path)
             end
 
-          if node.body.nil?
-            s(node, :module, name)
-          elsif node.body.is_a?(StatementsNode)
-            compiler = copy_compiler(in_def: false)
-            s(node, :module, name).concat(node.body.body.map { |child| child.accept(compiler) })
-          else
-            s(node, :module, name, node.body.accept(copy_compiler(in_def: false)))
-          end
+          result =
+            if node.body.nil?
+              s(node, :module, name)
+            elsif node.body.is_a?(StatementsNode)
+              compiler = copy_compiler(in_def: false)
+              s(node, :module, name).concat(node.body.body.map { |child| child.accept(compiler) })
+            else
+              s(node, :module, name, node.body.accept(copy_compiler(in_def: false)))
+            end
+
+          attach_comments(result, node)
+          result
         end
 
         # foo, bar = baz
@@ -1103,6 +1140,12 @@ module Prism
           s(node, :nil)
         end
 
+        # def foo(&nil); end
+        #         ^^^^
+        def visit_no_block_parameter_node(node)
+          :"&nil"
+        end
+
         # def foo(**nil); end
         #         ^^^^^
         def visit_no_keywords_parameter_node(node)
@@ -1136,14 +1179,26 @@ module Prism
         # a or b
         # ^^^^^^
         def visit_or_node(node)
-          s(node, :or, visit(node.left), visit(node.right))
+          left = visit(node.left)
+
+          if left[0] == :or
+            # ruby_parser has the or keyword as right-associative as opposed to
+            # prism which has it as left-associative. We reverse that
+            # associativity here.
+            nest = left
+            nest = nest[2] while nest[2][0] == :or
+            nest[2] = s(node, :or, nest[2], visit(node.right))
+            left
+          else
+            s(node, :or, left, visit(node.right))
+          end
         end
 
         # def foo(bar, *baz); end
         #         ^^^^^^^^^
         def visit_parameters_node(node)
           children =
-            node.compact_child_nodes.map do |element|
+            node.each_child_node.map do |element|
               if element.is_a?(MultiTargetNode)
                 visit_destructured_parameter(element)
               else
@@ -1392,7 +1447,14 @@ module Prism
         # "foo"
         # ^^^^^
         def visit_string_node(node)
-          s(node, :str, node.unescaped)
+          unescaped = node.unescaped
+
+          if node.forced_binary_encoding?
+            unescaped = unescaped.dup
+            unescaped.force_encoding(Encoding::BINARY)
+          end
+
+          s(node, :str, unescaped)
         end
 
         # super(foo)
@@ -1434,7 +1496,7 @@ module Prism
         # bar unless foo
         # ^^^^^^^^^^^^^^
         def visit_unless_node(node)
-          s(node, :if, visit(node.predicate), visit(node.consequent), visit(node.statements))
+          s(node, :if, visit(node.predicate), visit(node.else_clause), visit(node.statements))
         end
 
         # until foo; bar end
@@ -1485,6 +1547,17 @@ module Prism
 
         private
 
+        # Attach prism comments to the given sexp.
+        def attach_comments(sexp, node)
+          return unless node.comments
+          return if node.comments.empty?
+
+          extra = node.location.start_line - node.comments.last.location.start_line
+          comments = node.comments.map(&:slice)
+          comments.concat([nil] * [0, extra].max)
+          sexp.comments = comments.join("\n")
+        end
+
         # Create a new compiler with the given options.
         def copy_compiler(in_def: self.in_def, in_pattern: self.in_pattern)
           Compiler.new(file, in_def: in_def, in_pattern: in_pattern)
@@ -1507,7 +1580,7 @@ module Prism
           else
             parameters =
               case block.parameters
-              when nil, NumberedParametersNode
+              when nil, ItParametersNode, NumberedParametersNode
                 0
               else
                 visit(block.parameters)
@@ -1554,13 +1627,21 @@ module Prism
       # Parse the given source and translate it into the seattlerb/ruby_parser
       # gem's Sexp format.
       def parse(source, filepath = "(string)")
-        translate(Prism.parse(source, filepath: filepath, scopes: [[]]), filepath)
+        translate(Prism.parse(source, filepath: filepath, partial_script: true), filepath)
       end
 
       # Parse the given file and translate it into the seattlerb/ruby_parser
       # gem's Sexp format.
       def parse_file(filepath)
-        translate(Prism.parse_file(filepath, scopes: [[]]), filepath)
+        translate(Prism.parse_file(filepath, partial_script: true), filepath)
+      end
+
+      # Parse the give file and translate it into the
+      # seattlerb/ruby_parser gem's Sexp format. This method is
+      # provided for API compatibility to RubyParser and takes an
+      # optional +timeout+ argument.
+      def process(ruby, file = "(string)", timeout = nil)
+        Timeout.timeout(timeout) { parse(ruby, file) }
       end
 
       class << self
@@ -1587,6 +1668,7 @@ module Prism
           raise ::RubyParser::SyntaxError, "#{filepath}:#{error.location.start_line} :: #{error.message}"
         end
 
+        result.attach_comments!
         result.value.accept(Compiler.new(filepath))
       end
     end
diff --git a/lib/pstore.gemspec b/lib/pstore.gemspec
deleted file mode 100644
index 86051d2f43..0000000000
--- a/lib/pstore.gemspec
+++ /dev/null
@@ -1,32 +0,0 @@
-# frozen_string_literal: true
-
-name = File.basename(__FILE__, ".gemspec")
-version = ["lib", Array.new(name.count("-")+1, ".").join("/")].find do |dir|
-  break File.foreach(File.join(__dir__, dir, "#{name.tr('-', '/')}.rb")) do |line|
-    /^\s*VERSION\s*=\s*"(.*)"/ =~ line and break $1
-  end rescue nil
-end
-
-Gem::Specification.new do |spec|
-  spec.name          = name
-  spec.version       = version
-  spec.authors       = ["Yukihiro Matsumoto"]
-  spec.email         = ["matz@ruby-lang.org"]
-
-  spec.summary       = %q{Transactional File Storage for Ruby Objects}
-  spec.description   = spec.summary
-  spec.homepage      = "https://github.com/ruby/pstore"
-  spec.licenses      = ["Ruby", "BSD-2-Clause"]
-
-  spec.metadata["homepage_uri"] = spec.homepage
-  spec.metadata["source_code_uri"] = "https://github.com/ruby/pstore"
-
-  # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
-  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
-    `git ls-files -z 2>#{IO::NULL}`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
-  end
-  spec.bindir        = "exe"
-  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib"]
-end
diff --git a/lib/pstore.rb b/lib/pstore.rb
deleted file mode 100644
index 57ecb0ef5c..0000000000
--- a/lib/pstore.rb
+++ /dev/null
@@ -1,731 +0,0 @@
-# frozen_string_literal: true
-# = PStore -- Transactional File Storage for Ruby Objects
-#
-# pstore.rb -
-#   originally by matz
-#   documentation by Kev Jackson and James Edward Gray II
-#   improved by Hongli Lai
-#
-# See PStore for documentation.
-
-require "digest"
-
-# \PStore implements a file based persistence mechanism based on a Hash.
-# User code can store hierarchies of Ruby objects (values)
-# into the data store by name (keys).
-# An object hierarchy may be just a single object.
-# User code may later read values back from the data store
-# or even update data, as needed.
-#
-# The transactional behavior ensures that any changes succeed or fail together.
-# This can be used to ensure that the data store is not left in a transitory state,
-# where some values were updated but others were not.
-#
-# Behind the scenes, Ruby objects are stored to the data store file with Marshal.
-# That carries the usual limitations. Proc objects cannot be marshalled,
-# for example.
-#
-# There are three important concepts here (details at the links):
-#
-# - {Store}[rdoc-ref:PStore@The+Store]: a store is an instance of \PStore.
-# - {Entries}[rdoc-ref:PStore@Entries]: the store is hash-like;
-#   each entry is the key for a stored object.
-# - {Transactions}[rdoc-ref:PStore@Transactions]: each transaction is a collection
-#   of prospective changes to the store;
-#   a transaction is defined in the block given with a call
-#   to PStore#transaction.
-#
-# == About the Examples
-#
-# Examples on this page need a store that has known properties.
-# They can get a new (and populated) store by calling thus:
-#
-#   example_store do |store|
-#     # Example code using store goes here.
-#   end
-#
-# All we really need to know about +example_store+
-# is that it yields a fresh store with a known population of entries;
-# its implementation:
-#
-#   require 'pstore'
-#   require 'tempfile'
-#   # Yield a pristine store for use in examples.
-#   def example_store
-#     # Create the store in a temporary file.
-#     Tempfile.create do |file|
-#       store = PStore.new(file)
-#       # Populate the store.
-#       store.transaction do
-#         store[:foo] = 0
-#         store[:bar] = 1
-#         store[:baz] = 2
-#       end
-#       yield store
-#     end
-#   end
-#
-# == The Store
-#
-# The contents of the store are maintained in a file whose path is specified
-# when the store is created (see PStore.new).
-# The objects are stored and retrieved using
-# module Marshal, which means that certain objects cannot be added to the store;
-# see {Marshal::dump}[rdoc-ref:Marshal.dump].
-#
-# == Entries
-#
-# A store may have any number of entries.
-# Each entry has a key and a value, just as in a hash:
-#
-# - Key: as in a hash, the key can be (almost) any object;
-#   see {Hash Keys}[rdoc-ref:Hash@Hash+Keys].
-#   You may find it convenient to keep it simple by using only
-#   symbols or strings as keys.
-# - Value: the value may be any object that can be marshalled by \Marshal
-#   (see {Marshal::dump}[rdoc-ref:Marshal.dump])
-#   and in fact may be a collection
-#   (e.g., an array, a hash, a set, a range, etc).
-#   That collection may in turn contain nested objects,
-#   including collections, to any depth;
-#   those objects must also be \Marshal-able.
-#   See {Hierarchical Values}[rdoc-ref:PStore@Hierarchical+Values].
-#
-# == Transactions
-#
-# === The Transaction Block
-#
-# The block given with a call to method #transaction#
-# contains a _transaction_,
-# which consists of calls to \PStore methods that
-# read from or write to the store
-# (that is, all \PStore methods except #transaction itself,
-# #path, and Pstore.new):
-#
-#   example_store do |store|
-#     store.transaction do
-#       store.keys # => [:foo, :bar, :baz]
-#       store[:bat] = 3
-#       store.keys # => [:foo, :bar, :baz, :bat]
-#     end
-#   end
-#
-# Execution of the transaction is deferred until the block exits,
-# and is executed _atomically_ (all-or-nothing):
-# either all transaction calls are executed, or none are.
-# This maintains the integrity of the store.
-#
-# Other code in the block (including even calls to #path and PStore.new)
-# is executed immediately, not deferred.
-#
-# The transaction block:
-#
-# - May not contain a nested call to #transaction.
-# - Is the only context where methods that read from or write to
-#   the store are allowed.
-#
-# As seen above, changes in a transaction are made automatically
-# when the block exits.
-# The block may be exited early by calling method #commit or #abort.
-#
-# - Method #commit triggers the update to the store and exits the block:
-#
-#     example_store do |store|
-#       store.transaction do
-#         store.keys # => [:foo, :bar, :baz]
-#         store[:bat] = 3
-#         store.commit
-#         fail 'Cannot get here'
-#       end
-#       store.transaction do
-#         # Update was completed.
-#         store.keys # => [:foo, :bar, :baz, :bat]
-#       end
-#     end
-#
-# - Method #abort discards the update to the store and exits the block:
-#
-#     example_store do |store|
-#       store.transaction do
-#         store.keys # => [:foo, :bar, :baz]
-#         store[:bat] = 3
-#         store.abort
-#         fail 'Cannot get here'
-#       end
-#       store.transaction do
-#         # Update was not completed.
-#         store.keys # => [:foo, :bar, :baz]
-#       end
-#     end
-#
-# === Read-Only Transactions
-#
-# By default, a transaction allows both reading from and writing to
-# the store:
-#
-#   store.transaction do
-#     # Read-write transaction.
-#     # Any code except a call to #transaction is allowed here.
-#   end
-#
-# If argument +read_only+ is passed as +true+,
-# only reading is allowed:
-#
-#   store.transaction(true) do
-#     # Read-only transaction:
-#     # Calls to #transaction, #[]=, and #delete are not allowed here.
-#   end
-#
-# == Hierarchical Values
-#
-# The value for an entry may be a simple object (as seen above).
-# It may also be a hierarchy of objects nested to any depth:
-#
-#   deep_store = PStore.new('deep.store')
-#   deep_store.transaction do
-#     array_of_hashes = [{}, {}, {}]
-#     deep_store[:array_of_hashes] = array_of_hashes
-#     deep_store[:array_of_hashes] # => [{}, {}, {}]
-#     hash_of_arrays = {foo: [], bar: [], baz: []}
-#     deep_store[:hash_of_arrays] = hash_of_arrays
-#     deep_store[:hash_of_arrays]  # => {:foo=>[], :bar=>[], :baz=>[]}
-#     deep_store[:hash_of_arrays][:foo].push(:bat)
-#     deep_store[:hash_of_arrays]  # => {:foo=>[:bat], :bar=>[], :baz=>[]}
-#   end
-#
-# And recall that you can use
-# {dig methods}[rdoc-ref:dig_methods.rdoc]
-# in a returned hierarchy of objects.
-#
-# == Working with the Store
-#
-# === Creating a Store
-#
-# Use method PStore.new to create a store.
-# The new store creates or opens its containing file:
-#
-#   store = PStore.new('t.store')
-#
-# === Modifying the Store
-#
-# Use method #[]= to update or create an entry:
-#
-#   example_store do |store|
-#     store.transaction do
-#       store[:foo] = 1 # Update.
-#       store[:bam] = 1 # Create.
-#     end
-#   end
-#
-# Use method #delete to remove an entry:
-#
-#   example_store do |store|
-#     store.transaction do
-#       store.delete(:foo)
-#       store[:foo] # => nil
-#     end
-#   end
-#
-# === Retrieving Values
-#
-# Use method #fetch (allows default) or #[] (defaults to +nil+)
-# to retrieve an entry:
-#
-#   example_store do |store|
-#     store.transaction do
-#       store[:foo]             # => 0
-#       store[:nope]            # => nil
-#       store.fetch(:baz)       # => 2
-#       store.fetch(:nope, nil) # => nil
-#       store.fetch(:nope)      # Raises exception.
-#     end
-#   end
-#
-# === Querying the Store
-#
-# Use method #key? to determine whether a given key exists:
-#
-#   example_store do |store|
-#     store.transaction do
-#       store.key?(:foo) # => true
-#     end
-#   end
-#
-# Use method #keys to retrieve keys:
-#
-#   example_store do |store|
-#     store.transaction do
-#       store.keys # => [:foo, :bar, :baz]
-#     end
-#   end
-#
-# Use method #path to retrieve the path to the store's underlying file;
-# this method may be called from outside a transaction block:
-#
-#   store = PStore.new('t.store')
-#   store.path # => "t.store"
-#
-# == Transaction Safety
-#
-# For transaction safety, see:
-#
-# - Optional argument +thread_safe+ at method PStore.new.
-# - Attribute #ultra_safe.
-#
-# Needless to say, if you're storing valuable data with \PStore, then you should
-# backup the \PStore file from time to time.
-#
-# == An Example Store
-#
-#  require "pstore"
-#
-#  # A mock wiki object.
-#  class WikiPage
-#
-#    attr_reader :page_name
-#
-#    def initialize(page_name, author, contents)
-#      @page_name = page_name
-#      @revisions = Array.new
-#      add_revision(author, contents)
-#    end
-#
-#    def add_revision(author, contents)
-#      @revisions << {created: Time.now,
-#                     author: author,
-#                     contents: contents}
-#    end
-#
-#    def wiki_page_references
-#      [@page_name] + @revisions.last[:contents].scan(/\b(?:[A-Z]+[a-z]+){2,}/)
-#    end
-#
-#  end
-#
-#  # Create a new wiki page.
-#  home_page = WikiPage.new("HomePage", "James Edward Gray II",
-#                           "A page about the JoysOfDocumentation..." )
-#
-#  wiki = PStore.new("wiki_pages.pstore")
-#  # Update page data and the index together, or not at all.
-#  wiki.transaction do
-#    # Store page.
-#    wiki[home_page.page_name] = home_page
-#    # Create page index.
-#    wiki[:wiki_index] ||= Array.new
-#    # Update wiki index.
-#    wiki[:wiki_index].push(*home_page.wiki_page_references)
-#  end
-#
-#  # Read wiki data, setting argument read_only to true.
-#  wiki.transaction(true) do
-#    wiki.keys.each do |key|
-#      puts key
-#      puts wiki[key]
-#    end
-#  end
-#
-class PStore
-  VERSION = "0.1.3"
-
-  RDWR_ACCESS = {mode: IO::RDWR | IO::CREAT | IO::BINARY, encoding: Encoding::ASCII_8BIT}.freeze
-  RD_ACCESS = {mode: IO::RDONLY | IO::BINARY, encoding: Encoding::ASCII_8BIT}.freeze
-  WR_ACCESS = {mode: IO::WRONLY | IO::CREAT | IO::TRUNC | IO::BINARY, encoding: Encoding::ASCII_8BIT}.freeze
-
-  # The error type thrown by all PStore methods.
-  class Error < StandardError
-  end
-
-  # Whether \PStore should do its best to prevent file corruptions,
-  # even when an unlikely error (such as memory-error or filesystem error) occurs:
-  #
-  # - +true+: changes are posted by creating a temporary file,
-  #   writing the updated data to it, then renaming the file to the given #path.
-  #   File integrity is maintained.
-  #   Note: has effect only if the filesystem has atomic file rename
-  #   (as do POSIX platforms Linux, MacOS, FreeBSD and others).
-  #
-  # - +false+ (the default): changes are posted by rewinding the open file
-  #   and writing the updated data.
-  #   File integrity is maintained if the filesystem raises
-  #   no unexpected I/O error;
-  #   if such an error occurs during a write to the store,
-  #   the file may become corrupted.
-  #
-  attr_accessor :ultra_safe
-
-  # Returns a new \PStore object.
-  #
-  # Argument +file+ is the path to the file in which objects are to be stored;
-  # if the file exists, it should be one that was written by \PStore.
-  #
-  #   path = 't.store'
-  #   store = PStore.new(path)
-  #
-  # A \PStore object is
-  # {reentrant}[https://en.wikipedia.org/wiki/Reentrancy_(computing)].
-  # If argument +thread_safe+ is given as +true+,
-  # the object is also thread-safe (at the cost of a small performance penalty):
-  #
-  #   store = PStore.new(path, true)
-  #
-  def initialize(file, thread_safe = false)
-    dir = File::dirname(file)
-    unless File::directory? dir
-      raise PStore::Error, format("directory %s does not exist", dir)
-    end
-    if File::exist? file and not File::readable? file
-      raise PStore::Error, format("file %s not readable", file)
-    end
-    @filename = file
-    @abort = false
-    @ultra_safe = false
-    @thread_safe = thread_safe
-    @lock = Thread::Mutex.new
-  end
-
-  # Raises PStore::Error if the calling code is not in a PStore#transaction.
-  def in_transaction
-    raise PStore::Error, "not in transaction" unless @lock.locked?
-  end
-  #
-  # Raises PStore::Error if the calling code is not in a PStore#transaction or
-  # if the code is in a read-only PStore#transaction.
-  #
-  def in_transaction_wr
-    in_transaction
-    raise PStore::Error, "in read-only transaction" if @rdonly
-  end
-  private :in_transaction, :in_transaction_wr
-
-  # Returns the value for the given +key+ if the key exists.
-  # +nil+ otherwise;
-  # if not +nil+, the returned value is an object or a hierarchy of objects:
-  #
-  #   example_store do |store|
-  #     store.transaction do
-  #       store[:foo]  # => 0
-  #       store[:nope] # => nil
-  #     end
-  #   end
-  #
-  # Returns +nil+ if there is no such key.
-  #
-  # See also {Hierarchical Values}[rdoc-ref:PStore@Hierarchical+Values].
-  #
-  # Raises an exception if called outside a transaction block.
-  def [](key)
-    in_transaction
-    @table[key]
-  end
-
-  # Like #[], except that it accepts a default value for the store.
-  # If the +key+ does not exist:
-  #
-  # - Raises an exception if +default+ is +PStore::Error+.
-  # - Returns the value of +default+ otherwise:
-  #
-  #     example_store do |store|
-  #       store.transaction do
-  #         store.fetch(:nope, nil) # => nil
-  #         store.fetch(:nope)      # Raises an exception.
-  #       end
-  #     end
-  #
-  # Raises an exception if called outside a transaction block.
-  def fetch(key, default=PStore::Error)
-    in_transaction
-    unless @table.key? key
-      if default == PStore::Error
-        raise PStore::Error, format("undefined key '%s'", key)
-      else
-        return default
-      end
-    end
-    @table[key]
-  end
-
-  # Creates or replaces the value for the given +key+:
-  #
-  #   example_store do |store|
-  #     temp.transaction do
-  #       temp[:bat] = 3
-  #     end
-  #   end
-  #
-  # See also {Hierarchical Values}[rdoc-ref:PStore@Hierarchical+Values].
-  #
-  # Raises an exception if called outside a transaction block.
-  def []=(key, value)
-    in_transaction_wr
-    @table[key] = value
-  end
-
-  # Removes and returns the value at +key+ if it exists:
-  #
-  #   example_store do |store|
-  #     store.transaction do
-  #       store[:bat] = 3
-  #       store.delete(:bat)
-  #     end
-  #   end
-  #
-  # Returns +nil+ if there is no such key.
-  #
-  # Raises an exception if called outside a transaction block.
-  def delete(key)
-    in_transaction_wr
-    @table.delete key
-  end
-
-  # Returns an array of the existing keys:
-  #
-  #   example_store do |store|
-  #     store.transaction do
-  #       store.keys # => [:foo, :bar, :baz]
-  #     end
-  #   end
-  #
-  # Raises an exception if called outside a transaction block.
-  def keys
-    in_transaction
-    @table.keys
-  end
-  alias roots keys
-
-  # Returns +true+ if +key+ exists, +false+ otherwise:
-  #
-  #   example_store do |store|
-  #     store.transaction do
-  #       store.key?(:foo) # => true
-  #     end
-  #   end
-  #
-  # Raises an exception if called outside a transaction block.
-  def key?(key)
-    in_transaction
-    @table.key? key
-  end
-  alias root? key?
-
-  # Returns the string file path used to create the store:
-  #
-  #   store.path # => "flat.store"
-  #
-  def path
-    @filename
-  end
-
-  # Exits the current transaction block, committing any changes
-  # specified in the
-  # {transaction block}[rdoc-ref:PStore@The+Transaction+Block].
-  #
-  # Raises an exception if called outside a transaction block.
-  def commit
-    in_transaction
-    @abort = false
-    throw :pstore_abort_transaction
-  end
-
-  # Exits the current transaction block, discarding any changes
-  # specified in the
-  # {transaction block}[rdoc-ref:PStore@The+Transaction+Block].
-  #
-  # Raises an exception if called outside a transaction block.
-  def abort
-    in_transaction
-    @abort = true
-    throw :pstore_abort_transaction
-  end
-
-  # Opens a transaction block for the store.
-  # See {Transactions}[rdoc-ref:PStore@Transactions].
-  #
-  # With argument +read_only+ as +false+, the block may both read from
-  # and write to the store.
-  #
-  # With argument +read_only+ as +true+, the block may not include calls
-  # to #transaction, #[]=, or #delete.
-  #
-  # Raises an exception if called within a transaction block.
-  def transaction(read_only = false)  # :yields:  pstore
-    value = nil
-    if !@thread_safe
-      raise PStore::Error, "nested transaction" unless @lock.try_lock
-    else
-      begin
-        @lock.lock
-      rescue ThreadError
-        raise PStore::Error, "nested transaction"
-      end
-    end
-    begin
-      @rdonly = read_only
-      @abort = false
-      file = open_and_lock_file(@filename, read_only)
-      if file
-        begin
-          @table, checksum, original_data_size = load_data(file, read_only)
-
-          catch(:pstore_abort_transaction) do
-            value = yield(self)
-          end
-
-          if !@abort && !read_only
-            save_data(checksum, original_data_size, file)
-          end
-        ensure
-          file.close
-        end
-      else
-        # This can only occur if read_only == true.
-        @table = {}
-        catch(:pstore_abort_transaction) do
-          value = yield(self)
-        end
-      end
-    ensure
-      @lock.unlock
-    end
-    value
-  end
-
-  private
-  # Constant for relieving Ruby's garbage collector.
-  CHECKSUM_ALGO = %w[SHA512 SHA384 SHA256 SHA1 RMD160 MD5].each do |algo|
-    begin
-      break Digest(algo)
-    rescue LoadError
-    end
-  end
-  EMPTY_STRING = ""
-  EMPTY_MARSHAL_DATA = Marshal.dump({})
-  EMPTY_MARSHAL_CHECKSUM = CHECKSUM_ALGO.digest(EMPTY_MARSHAL_DATA)
-
-  #
-  # Open the specified filename (either in read-only mode or in
-  # read-write mode) and lock it for reading or writing.
-  #
-  # The opened File object will be returned. If _read_only_ is true,
-  # and the file does not exist, then nil will be returned.
-  #
-  # All exceptions are propagated.
-  #
-  def open_and_lock_file(filename, read_only)
-    if read_only
-      begin
-        file = File.new(filename, **RD_ACCESS)
-        begin
-          file.flock(File::LOCK_SH)
-          return file
-        rescue
-          file.close
-          raise
-        end
-      rescue Errno::ENOENT
-        return nil
-      end
-    else
-      file = File.new(filename, **RDWR_ACCESS)
-      file.flock(File::LOCK_EX)
-      return file
-    end
-  end
-
-  # Load the given PStore file.
-  # If +read_only+ is true, the unmarshalled Hash will be returned.
-  # If +read_only+ is false, a 3-tuple will be returned: the unmarshalled
-  # Hash, a checksum of the data, and the size of the data.
-  def load_data(file, read_only)
-    if read_only
-      begin
-        table = load(file)
-        raise Error, "PStore file seems to be corrupted." unless table.is_a?(Hash)
-      rescue EOFError
-        # This seems to be a newly-created file.
-        table = {}
-      end
-      table
-    else
-      data = file.read
-      if data.empty?
-        # This seems to be a newly-created file.
-        table = {}
-        checksum = empty_marshal_checksum
-        size = empty_marshal_data.bytesize
-      else
-        table = load(data)
-        checksum = CHECKSUM_ALGO.digest(data)
-        size = data.bytesize
-        raise Error, "PStore file seems to be corrupted." unless table.is_a?(Hash)
-      end
-      data.replace(EMPTY_STRING)
-      [table, checksum, size]
-    end
-  end
-
-  def on_windows?
-    is_windows = RUBY_PLATFORM =~ /mswin|mingw|bccwin|wince/
-    self.class.__send__(:define_method, :on_windows?) do
-      is_windows
-    end
-    is_windows
-  end
-
-  def save_data(original_checksum, original_file_size, file)
-    new_data = dump(@table)
-
-    if new_data.bytesize != original_file_size || CHECKSUM_ALGO.digest(new_data) != original_checksum
-      if @ultra_safe && !on_windows?
-        # Windows doesn't support atomic file renames.
-        save_data_with_atomic_file_rename_strategy(new_data, file)
-      else
-        save_data_with_fast_strategy(new_data, file)
-      end
-    end
-
-    new_data.replace(EMPTY_STRING)
-  end
-
-  def save_data_with_atomic_file_rename_strategy(data, file)
-    temp_filename = "#{@filename}.tmp.#{Process.pid}.#{rand 1000000}"
-    temp_file = File.new(temp_filename, **WR_ACCESS)
-    begin
-      temp_file.flock(File::LOCK_EX)
-      temp_file.write(data)
-      temp_file.flush
-      File.rename(temp_filename, @filename)
-    rescue
-      File.unlink(temp_file) rescue nil
-      raise
-    ensure
-      temp_file.close
-    end
-  end
-
-  def save_data_with_fast_strategy(data, file)
-    file.rewind
-    file.write(data)
-    file.truncate(data.bytesize)
-  end
-
-
-  # This method is just a wrapped around Marshal.dump
-  # to allow subclass overriding used in YAML::Store.
-  def dump(table)  # :nodoc:
-    Marshal::dump(table)
-  end
-
-  # This method is just a wrapped around Marshal.load.
-  # to allow subclass overriding used in YAML::Store.
-  def load(content)  # :nodoc:
-    Marshal::load(content)
-  end
-
-  def empty_marshal_data
-    EMPTY_MARSHAL_DATA
-  end
-  def empty_marshal_checksum
-    EMPTY_MARSHAL_CHECKSUM
-  end
-end
diff --git a/lib/random/formatter.rb b/lib/random/formatter.rb
index 037f9d8748..4ecd6ad027 100644
--- a/lib/random/formatter.rb
+++ b/lib/random/formatter.rb
@@ -165,7 +165,7 @@ module Random::Formatter
   #
   # The result contains 122 random bits (15.25 random bytes).
   #
-  # See RFC4122[https://www.rfc-editor.org/rfc/rfc4122] for details of UUID.
+  # See RFC9562[https://www.rfc-editor.org/rfc/rfc9562] for details of UUIDv4.
   #
   def uuid
     ary = random_bytes(16)
@@ -204,8 +204,7 @@ module Random::Formatter
   # Note that this method cannot be made reproducible because its output
   # includes not only random bits but also timestamp.
   #
-  # See draft-ietf-uuidrev-rfc4122bis[https://datatracker.ietf.org/doc/draft-ietf-uuidrev-rfc4122bis/]
-  # for details of UUIDv7.
+  # See RFC9562[https://www.rfc-editor.org/rfc/rfc9562] for details of UUIDv7.
   #
   # ==== Monotonicity
   #
@@ -242,7 +241,7 @@ module Random::Formatter
   #
   # Counters and other mechanisms for stronger guarantees of monotonicity are
   # not implemented.  Applications with stricter requirements should follow
-  # {Section 6.2}[https://www.ietf.org/archive/id/draft-ietf-uuidrev-rfc4122bis-07.html#monotonicity_counters]
+  # {Section 6.2}[https://www.rfc-editor.org/rfc/rfc9562.html#name-monotonicity-and-counters]
   # of the specification.
   #
   def uuid_v7(extra_timestamp_bits: 0)
@@ -341,7 +340,7 @@ module Random::Formatter
   end
 
   # The default character list for #alphanumeric.
-  ALPHANUMERIC = [*'A'..'Z', *'a'..'z', *'0'..'9']
+  ALPHANUMERIC = [*'A'..'Z', *'a'..'z', *'0'..'9'].map(&:freeze).freeze
 
   # Generate a random alphanumeric string.
   #
diff --git a/lib/rdoc.rb b/lib/rdoc.rb
deleted file mode 100644
index 9dc4595324..0000000000
--- a/lib/rdoc.rb
+++ /dev/null
@@ -1,213 +0,0 @@
-# frozen_string_literal: true
-$DEBUG_RDOC = nil
-
-# :main: README.rdoc
-
-##
-# RDoc produces documentation for Ruby source files by parsing the source and
-# extracting the definition for classes, modules, methods, includes and
-# requires.  It associates these with optional documentation contained in an
-# immediately preceding comment block then renders the result using an output
-# formatter.
-#
-# For a simple introduction to writing or generating documentation using RDoc
-# see the README.
-#
-# == Roadmap
-#
-# If you think you found a bug in RDoc see CONTRIBUTING@Bugs
-#
-# If you want to use RDoc to create documentation for your Ruby source files,
-# see RDoc::Markup and refer to <tt>rdoc --help</tt> for command line usage.
-#
-# If you want to set the default markup format see
-# RDoc::Markup@Supported+Formats
-#
-# If you want to store rdoc configuration in your gem (such as the default
-# markup format) see RDoc::Options@Saved+Options
-#
-# If you want to write documentation for Ruby files see RDoc::Parser::Ruby
-#
-# If you want to write documentation for extensions written in C see
-# RDoc::Parser::C
-#
-# If you want to generate documentation using <tt>rake</tt> see RDoc::Task.
-#
-# If you want to drive RDoc programmatically, see RDoc::RDoc.
-#
-# If you want to use the library to format text blocks into HTML or other
-# formats, look at RDoc::Markup.
-#
-# If you want to make an RDoc plugin such as a generator or directive handler
-# see RDoc::RDoc.
-#
-# If you want to write your own output generator see RDoc::Generator.
-#
-# If you want an overview of how RDoc works see CONTRIBUTING
-#
-# == Credits
-#
-# RDoc is currently being maintained by Eric Hodel <drbrain@segment7.net>.
-#
-# Dave Thomas <dave@pragmaticprogrammer.com> is the original author of RDoc.
-#
-# * The Ruby parser in rdoc/parse.rb is based heavily on the outstanding
-#   work of Keiju ISHITSUKA of Nippon Rational Inc, who produced the Ruby
-#   parser for irb and the rtags package.
-
-module RDoc
-
-  ##
-  # Exception thrown by any rdoc error.
-
-  class Error < RuntimeError; end
-
-  require_relative 'rdoc/version'
-
-  ##
-  # Method visibilities
-
-  VISIBILITIES = [:public, :protected, :private]
-
-  ##
-  # Name of the dotfile that contains the description of files to be processed
-  # in the current directory
-
-  DOT_DOC_FILENAME = ".document"
-
-  ##
-  # General RDoc modifiers
-
-  GENERAL_MODIFIERS = %w[nodoc].freeze
-
-  ##
-  # RDoc modifiers for classes
-
-  CLASS_MODIFIERS = GENERAL_MODIFIERS
-
-  ##
-  # RDoc modifiers for attributes
-
-  ATTR_MODIFIERS = GENERAL_MODIFIERS
-
-  ##
-  # RDoc modifiers for constants
-
-  CONSTANT_MODIFIERS = GENERAL_MODIFIERS
-
-  ##
-  # RDoc modifiers for methods
-
-  METHOD_MODIFIERS = GENERAL_MODIFIERS +
-    %w[arg args yield yields notnew not-new not_new doc]
-
-  ##
-  # Loads the best available YAML library.
-
-  def self.load_yaml
-    begin
-      gem 'psych'
-    rescue NameError => e # --disable-gems
-      raise unless e.name == :gem
-    rescue Gem::LoadError
-    end
-
-    begin
-      require 'psych'
-    rescue ::LoadError
-    ensure
-      require 'yaml'
-    end
-  end
-
-  ##
-  # Searches and returns the directory for settings.
-  #
-  # 1. <tt>$HOME/.rdoc</tt> directory, if it exists.
-  # 2. The +rdoc+ directory under the path specified by the
-  #    +XDG_DATA_HOME+ environment variable, if it is set.
-  # 3. <tt>$HOME/.local/share/rdoc</tt> directory.
-  #
-  # Other than the home directory, the containing directory will be
-  # created automatically.
-
-  def self.home
-    rdoc_dir = begin
-                File.expand_path('~/.rdoc')
-              rescue ArgumentError
-              end
-
-    if File.directory?(rdoc_dir)
-      rdoc_dir
-    else
-      require 'fileutils'
-      begin
-        # XDG
-        xdg_data_home = ENV["XDG_DATA_HOME"] || File.join(File.expand_path("~"), '.local', 'share')
-        unless File.exist?(xdg_data_home)
-          FileUtils.mkdir_p xdg_data_home
-        end
-        File.join xdg_data_home, "rdoc"
-      rescue Errno::EACCES
-      end
-    end
-  end
-
-  autoload :RDoc,           "#{__dir__}/rdoc/rdoc"
-
-  autoload :CrossReference, "#{__dir__}/rdoc/cross_reference"
-  autoload :ERBIO,          "#{__dir__}/rdoc/erbio"
-  autoload :ERBPartial,     "#{__dir__}/rdoc/erb_partial"
-  autoload :Encoding,       "#{__dir__}/rdoc/encoding"
-  autoload :Generator,      "#{__dir__}/rdoc/generator"
-  autoload :Options,        "#{__dir__}/rdoc/options"
-  autoload :Parser,         "#{__dir__}/rdoc/parser"
-  autoload :Servlet,        "#{__dir__}/rdoc/servlet"
-  autoload :RI,             "#{__dir__}/rdoc/ri"
-  autoload :Stats,          "#{__dir__}/rdoc/stats"
-  autoload :Store,          "#{__dir__}/rdoc/store"
-  autoload :Task,           "#{__dir__}/rdoc/task"
-  autoload :Text,           "#{__dir__}/rdoc/text"
-
-  autoload :Markdown,       "#{__dir__}/rdoc/markdown"
-  autoload :Markup,         "#{__dir__}/rdoc/markup"
-  autoload :RD,             "#{__dir__}/rdoc/rd"
-  autoload :TomDoc,         "#{__dir__}/rdoc/tom_doc"
-
-  autoload :KNOWN_CLASSES,  "#{__dir__}/rdoc/known_classes"
-
-  autoload :TokenStream,    "#{__dir__}/rdoc/token_stream"
-
-  autoload :Comment,        "#{__dir__}/rdoc/comment"
-
-  require_relative 'rdoc/i18n'
-
-  # code objects
-  #
-  # We represent the various high-level code constructs that appear in Ruby
-  # programs: classes, modules, methods, and so on.
-  autoload :CodeObject,     "#{__dir__}/rdoc/code_object"
-
-  autoload :Context,        "#{__dir__}/rdoc/context"
-  autoload :TopLevel,       "#{__dir__}/rdoc/top_level"
-
-  autoload :AnonClass,      "#{__dir__}/rdoc/anon_class"
-  autoload :ClassModule,    "#{__dir__}/rdoc/class_module"
-  autoload :NormalClass,    "#{__dir__}/rdoc/normal_class"
-  autoload :NormalModule,   "#{__dir__}/rdoc/normal_module"
-  autoload :SingleClass,    "#{__dir__}/rdoc/single_class"
-
-  autoload :Alias,          "#{__dir__}/rdoc/alias"
-  autoload :AnyMethod,      "#{__dir__}/rdoc/any_method"
-  autoload :MethodAttr,     "#{__dir__}/rdoc/method_attr"
-  autoload :GhostMethod,    "#{__dir__}/rdoc/ghost_method"
-  autoload :MetaMethod,     "#{__dir__}/rdoc/meta_method"
-  autoload :Attr,           "#{__dir__}/rdoc/attr"
-
-  autoload :Constant,       "#{__dir__}/rdoc/constant"
-  autoload :Mixin,          "#{__dir__}/rdoc/mixin"
-  autoload :Include,        "#{__dir__}/rdoc/include"
-  autoload :Extend,         "#{__dir__}/rdoc/extend"
-  autoload :Require,        "#{__dir__}/rdoc/require"
-
-end
diff --git a/lib/rdoc/.document b/lib/rdoc/.document
deleted file mode 100644
index 6b5e1b21a5..0000000000
--- a/lib/rdoc/.document
+++ /dev/null
@@ -1,2 +0,0 @@
-*.rb
-parser
diff --git a/lib/rdoc/alias.rb b/lib/rdoc/alias.rb
deleted file mode 100644
index 446cf9ccb4..0000000000
--- a/lib/rdoc/alias.rb
+++ /dev/null
@@ -1,111 +0,0 @@
-# frozen_string_literal: true
-##
-# Represent an alias, which is an old_name/new_name pair associated with a
-# particular context
-#--
-# TODO implement Alias as a proxy to a method/attribute, inheriting from
-#      MethodAttr
-
-class RDoc::Alias < RDoc::CodeObject
-
-  ##
-  # Aliased method's name
-
-  attr_reader :new_name
-
-  alias name new_name
-
-  ##
-  # Aliasee method's name
-
-  attr_reader :old_name
-
-  ##
-  # Is this an alias declared in a singleton context?
-
-  attr_accessor :singleton
-
-  ##
-  # Source file token stream
-
-  attr_reader :text
-
-  ##
-  # Creates a new Alias with a token stream of +text+ that aliases +old_name+
-  # to +new_name+, has +comment+ and is a +singleton+ context.
-
-  def initialize(text, old_name, new_name, comment, singleton = false)
-    super()
-
-    @text = text
-    @singleton = singleton
-    @old_name = old_name
-    @new_name = new_name
-    self.comment = comment
-  end
-
-  ##
-  # Order by #singleton then #new_name
-
-  def <=>(other)
-    [@singleton ? 0 : 1, new_name] <=> [other.singleton ? 0 : 1, other.new_name]
-  end
-
-  ##
-  # HTML fragment reference for this alias
-
-  def aref
-    type = singleton ? 'c' : 'i'
-    "#alias-#{type}-#{html_name}"
-  end
-
-  ##
-  # Full old name including namespace
-
-  def full_old_name
-    @full_name || "#{parent.name}#{pretty_old_name}"
-  end
-
-  ##
-  # HTML id-friendly version of +#new_name+.
-
-  def html_name
-    CGI.escape(@new_name.gsub('-', '-2D')).gsub('%','-').sub(/^-/, '')
-  end
-
-  def inspect # :nodoc:
-    parent_name = parent ? parent.name : '(unknown)'
-    "#<%s:0x%x %s.alias_method %s, %s>" % [
-      self.class, object_id,
-      parent_name, @old_name, @new_name,
-    ]
-  end
-
-  ##
-  # '::' for the alias of a singleton method/attribute, '#' for instance-level.
-
-  def name_prefix
-    singleton ? '::' : '#'
-  end
-
-  ##
-  # Old name with prefix '::' or '#'.
-
-  def pretty_old_name
-    "#{singleton ? '::' : '#'}#{@old_name}"
-  end
-
-  ##
-  # New name with prefix '::' or '#'.
-
-  def pretty_new_name
-    "#{singleton ? '::' : '#'}#{@new_name}"
-  end
-
-  alias pretty_name pretty_new_name
-
-  def to_s # :nodoc:
-    "alias: #{self.new_name} -> #{self.pretty_old_name} in: #{parent}"
-  end
-
-end
diff --git a/lib/rdoc/anon_class.rb b/lib/rdoc/anon_class.rb
deleted file mode 100644
index 3c2f0e1877..0000000000
--- a/lib/rdoc/anon_class.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-# frozen_string_literal: true
-##
-# An anonymous class like:
-#
-#   c = Class.new do end
-#
-# AnonClass is currently not used.
-
-class RDoc::AnonClass < RDoc::ClassModule
-end
diff --git a/lib/rdoc/any_method.rb b/lib/rdoc/any_method.rb
deleted file mode 100644
index 465c4a4fb2..0000000000
--- a/lib/rdoc/any_method.rb
+++ /dev/null
@@ -1,379 +0,0 @@
-# frozen_string_literal: true
-##
-# AnyMethod is the base class for objects representing methods
-
-class RDoc::AnyMethod < RDoc::MethodAttr
-
-  ##
-  # 2::
-  #   RDoc 4
-  #   Added calls_super
-  #   Added parent name and class
-  #   Added section title
-  # 3::
-  #   RDoc 4.1
-  #   Added is_alias_for
-
-  MARSHAL_VERSION = 3 # :nodoc:
-
-  ##
-  # Don't rename \#initialize to \::new
-
-  attr_accessor :dont_rename_initialize
-
-  ##
-  # The C function that implements this method (if it was defined in a C file)
-
-  attr_accessor :c_function
-
-  # The section title of the method (if defined in a C file via +:category:+)
-  attr_accessor :section_title
-
-  # Parameters for this method
-
-  attr_accessor :params
-
-  ##
-  # If true this method uses +super+ to call a superclass version
-
-  attr_accessor :calls_super
-
-  include RDoc::TokenStream
-
-  ##
-  # Creates a new AnyMethod with a token stream +text+ and +name+
-
-  def initialize text, name
-    super
-
-    @c_function = nil
-    @dont_rename_initialize = false
-    @token_stream = nil
-    @calls_super = false
-    @superclass_method = nil
-  end
-
-  ##
-  # Adds +an_alias+ as an alias for this method in +context+.
-
-  def add_alias an_alias, context = nil
-    method = self.class.new an_alias.text, an_alias.new_name
-
-    method.record_location an_alias.file
-    method.singleton = self.singleton
-    method.params = self.params
-    method.visibility = self.visibility
-    method.comment = an_alias.comment
-    method.is_alias_for = self
-    @aliases << method
-    context.add_method method if context
-    method
-  end
-
-  ##
-  # Prefix for +aref+ is 'method'.
-
-  def aref_prefix
-    'method'
-  end
-
-  ##
-  # The call_seq or the param_seq with method name, if there is no call_seq.
-  #
-  # Use this for displaying a method's argument lists.
-
-  def arglists
-    if @call_seq then
-      @call_seq
-    elsif @params then
-      "#{name}#{param_seq}"
-    end
-  end
-
-  ##
-  # Different ways to call this method
-
-  def call_seq
-    unless call_seq = _call_seq
-      call_seq = is_alias_for._call_seq if is_alias_for
-    end
-
-    return unless call_seq
-
-    deduplicate_call_seq(call_seq)
-  end
-
-  ##
-  # Sets the different ways you can call this method.  If an empty +call_seq+
-  # is given nil is assumed.
-  #
-  # See also #param_seq
-
-  def call_seq= call_seq
-    return if call_seq.empty?
-
-    @call_seq = call_seq
-  end
-
-  ##
-  # Whether the method has a call-seq.
-
-  def has_call_seq?
-    !!(@call_seq || is_alias_for&._call_seq)
-  end
-
-  ##
-  # Loads is_alias_for from the internal name.  Returns nil if the alias
-  # cannot be found.
-
-  def is_alias_for # :nodoc:
-    case @is_alias_for
-    when RDoc::MethodAttr then
-      @is_alias_for
-    when Array then
-      return nil unless @store
-
-      klass_name, singleton, method_name = @is_alias_for
-
-      return nil unless klass = @store.find_class_or_module(klass_name)
-
-      @is_alias_for = klass.find_method method_name, singleton
-    end
-  end
-
-  ##
-  # Dumps this AnyMethod for use by ri.  See also #marshal_load
-
-  def marshal_dump
-    aliases = @aliases.map do |a|
-      [a.name, parse(a.comment)]
-    end
-
-    is_alias_for = [
-      @is_alias_for.parent.full_name,
-      @is_alias_for.singleton,
-      @is_alias_for.name
-    ] if @is_alias_for
-
-    [ MARSHAL_VERSION,
-      @name,
-      full_name,
-      @singleton,
-      @visibility,
-      parse(@comment),
-      @call_seq,
-      @block_params,
-      aliases,
-      @params,
-      @file.relative_name,
-      @calls_super,
-      @parent.name,
-      @parent.class,
-      @section.title,
-      is_alias_for,
-    ]
-  end
-
-  ##
-  # Loads this AnyMethod from +array+.  For a loaded AnyMethod the following
-  # methods will return cached values:
-  #
-  # * #full_name
-  # * #parent_name
-
-  def marshal_load array
-    initialize_visibility
-
-    @dont_rename_initialize = nil
-    @token_stream           = nil
-    @aliases                = []
-    @parent                 = nil
-    @parent_name            = nil
-    @parent_class           = nil
-    @section                = nil
-    @file                   = nil
-
-    version        = array[0]
-    @name          = array[1]
-    @full_name     = array[2]
-    @singleton     = array[3]
-    @visibility    = array[4]
-    @comment       = array[5]
-    @call_seq      = array[6]
-    @block_params  = array[7]
-    #                      8 handled below
-    @params        = array[9]
-    #                      10 handled below
-    @calls_super   = array[11]
-    @parent_name   = array[12]
-    @parent_title  = array[13]
-    @section_title = array[14]
-    @is_alias_for  = array[15]
-
-    array[8].each do |new_name, comment|
-      add_alias RDoc::Alias.new(nil, @name, new_name, comment, @singleton)
-    end
-
-    @parent_name ||= if @full_name =~ /#/ then
-                       $`
-                     else
-                       name = @full_name.split('::')
-                       name.pop
-                       name.join '::'
-                     end
-
-    @file = RDoc::TopLevel.new array[10] if version > 0
-  end
-
-  ##
-  # Method name
-  #
-  # If the method has no assigned name, it extracts it from #call_seq.
-
-  def name
-    return @name if @name
-
-    @name =
-      @call_seq[/^.*?\.(\w+)/, 1] ||
-      @call_seq[/^.*?(\w+)/, 1] ||
-      @call_seq if @call_seq
-  end
-
-  ##
-  # A list of this method's method and yield parameters.  +call-seq+ params
-  # are preferred over parsed method and block params.
-
-  def param_list
-    if @call_seq then
-      params = @call_seq.split("\n").last
-      params = params.sub(/.*?\((.*)\)/, '\1')
-      params = params.sub(/(\{|do)\s*\|([^|]*)\|.*/, ',\2')
-    elsif @params then
-      params = @params.sub(/\((.*)\)/, '\1')
-
-      params << ",#{@block_params}" if @block_params
-    elsif @block_params then
-      params = @block_params
-    else
-      return []
-    end
-
-    if @block_params then
-      # If this method has explicit block parameters, remove any explicit
-      # &block
-      params = params.sub(/,?\s*&\w+/, '')
-    else
-      params = params.sub(/\&(\w+)/, '\1')
-    end
-
-    params = params.gsub(/\s+/, '').split(',').reject(&:empty?)
-
-    params.map { |param| param.sub(/=.*/, '') }
-  end
-
-  ##
-  # Pretty parameter list for this method.  If the method's parameters were
-  # given by +call-seq+ it is preferred over the parsed values.
-
-  def param_seq
-    if @call_seq then
-      params = @call_seq.split("\n").last
-      params = params.sub(/[^( ]+/, '')
-      params = params.sub(/(\|[^|]+\|)\s*\.\.\.\s*(end|\})/, '\1 \2')
-    elsif @params then
-      params = @params.gsub(/\s*\#.*/, '')
-      params = params.tr_s("\n ", " ")
-      params = "(#{params})" unless params[0] == ?(
-    else
-      params = ''
-    end
-
-    if @block_params then
-      # If this method has explicit block parameters, remove any explicit
-      # &block
-      params = params.sub(/,?\s*&\w+/, '')
-
-      block = @block_params.tr_s("\n ", " ")
-      if block[0] == ?(
-        block = block.sub(/^\(/, '').sub(/\)/, '')
-      end
-      params << " { |#{block}| ... }"
-    end
-
-    params
-  end
-
-  ##
-  # Whether to skip the method description, true for methods that have
-  # aliases with a call-seq that doesn't include the method name.
-
-  def skip_description?
-    has_call_seq? && call_seq.nil? && !!(is_alias_for || !aliases.empty?)
-  end
-
-  ##
-  # Sets the store for this method and its referenced code objects.
-
-  def store= store
-    super
-
-    @file = @store.add_file @file.full_name if @file
-  end
-
-  ##
-  # For methods that +super+, find the superclass method that would be called.
-
-  def superclass_method
-    return unless @calls_super
-    return @superclass_method if @superclass_method
-
-    parent.each_ancestor do |ancestor|
-      if method = ancestor.method_list.find { |m| m.name == @name } then
-        @superclass_method = method
-        break
-      end
-    end
-
-    @superclass_method
-  end
-
-  protected
-
-  ##
-  # call_seq without deduplication and alias lookup.
-
-  def _call_seq
-    @call_seq if defined?(@call_seq) && @call_seq
-  end
-
-  private
-
-  ##
-  # call_seq with alias examples information removed, if this
-  # method is an alias method.
-
-  def deduplicate_call_seq(call_seq)
-    return call_seq unless is_alias_for || !aliases.empty?
-
-    method_name = self.name
-    method_name = method_name[0, 1] if method_name =~ /\A\[/
-
-    entries = call_seq.split "\n"
-
-    ignore = aliases.map(&:name)
-    if is_alias_for
-      ignore << is_alias_for.name
-      ignore.concat is_alias_for.aliases.map(&:name)
-    end
-    ignore.map! { |n| n =~ /\A\[/ ? /\[.*\]/ : n}
-    ignore.delete(method_name)
-    ignore = Regexp.union(ignore)
-
-    matching = entries.reject do |entry|
-      entry =~ /^\w*\.?#{ignore}[$\(\s]/ or
-        entry =~ /\s#{ignore}\s/
-    end
-
-    matching.empty? ? nil : matching.join("\n")
-  end
-end
diff --git a/lib/rdoc/attr.rb b/lib/rdoc/attr.rb
deleted file mode 100644
index a403235933..0000000000
--- a/lib/rdoc/attr.rb
+++ /dev/null
@@ -1,175 +0,0 @@
-# frozen_string_literal: true
-##
-# An attribute created by \#attr, \#attr_reader, \#attr_writer or
-# \#attr_accessor
-
-class RDoc::Attr < RDoc::MethodAttr
-
-  ##
-  # 3::
-  #   RDoc 4
-  #    Added parent name and class
-  #    Added section title
-
-  MARSHAL_VERSION = 3 # :nodoc:
-
-  ##
-  # Is the attribute readable ('R'), writable ('W') or both ('RW')?
-
-  attr_accessor :rw
-
-  ##
-  # Creates a new Attr with body +text+, +name+, read/write status +rw+ and
-  # +comment+.  +singleton+ marks this as a class attribute.
-
-  def initialize(text, name, rw, comment, singleton = false)
-    super text, name
-
-    @rw = rw
-    @singleton = singleton
-    self.comment = comment
-  end
-
-  ##
-  # Attributes are equal when their names, singleton and rw are identical
-
-  def == other
-    self.class == other.class and
-      self.name == other.name and
-      self.rw == other.rw and
-      self.singleton == other.singleton
-  end
-
-  ##
-  # Add +an_alias+ as an attribute in +context+.
-
-  def add_alias(an_alias, context)
-    new_attr = self.class.new(self.text, an_alias.new_name, self.rw,
-                              self.comment, self.singleton)
-
-    new_attr.record_location an_alias.file
-    new_attr.visibility = self.visibility
-    new_attr.is_alias_for = self
-    @aliases << new_attr
-    context.add_attribute new_attr
-    new_attr
-  end
-
-  ##
-  # The #aref prefix for attributes
-
-  def aref_prefix
-    'attribute'
-  end
-
-  ##
-  # Attributes never call super.  See RDoc::AnyMethod#calls_super
-  #
-  # An RDoc::Attr can show up in the method list in some situations (see
-  # Gem::ConfigFile)
-
-  def calls_super # :nodoc:
-    false
-  end
-
-  ##
-  # Returns attr_reader, attr_writer or attr_accessor as appropriate.
-
-  def definition
-    case @rw
-    when 'RW' then 'attr_accessor'
-    when 'R'  then 'attr_reader'
-    when 'W'  then 'attr_writer'
-    end
-  end
-
-  def inspect # :nodoc:
-    alias_for = @is_alias_for ? " (alias for #{@is_alias_for.name})" : nil
-    visibility = self.visibility
-    visibility = "forced #{visibility}" if force_documentation
-    "#<%s:0x%x %s %s (%s)%s>" % [
-      self.class, object_id,
-      full_name,
-      rw,
-      visibility,
-      alias_for,
-    ]
-  end
-
-  ##
-  # Dumps this Attr for use by ri.  See also #marshal_load
-
-  def marshal_dump
-    [ MARSHAL_VERSION,
-      @name,
-      full_name,
-      @rw,
-      @visibility,
-      parse(@comment),
-      singleton,
-      @file.relative_name,
-      @parent.full_name,
-      @parent.class,
-      @section.title
-    ]
-  end
-
-  ##
-  # Loads this Attr from +array+.  For a loaded Attr the following
-  # methods will return cached values:
-  #
-  # * #full_name
-  # * #parent_name
-
-  def marshal_load array
-    initialize_visibility
-
-    @aliases      = []
-    @parent       = nil
-    @parent_name  = nil
-    @parent_class = nil
-    @section      = nil
-    @file         = nil
-
-    version        = array[0]
-    @name          = array[1]
-    @full_name     = array[2]
-    @rw            = array[3]
-    @visibility    = array[4]
-    @comment       = array[5]
-    @singleton     = array[6] || false # MARSHAL_VERSION == 0
-    #                      7 handled below
-    @parent_name   = array[8]
-    @parent_class  = array[9]
-    @section_title = array[10]
-
-    @file = RDoc::TopLevel.new array[7] if version > 1
-
-    @parent_name ||= @full_name.split('#', 2).first
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[#{self.class.name} #{full_name} #{rw} #{visibility}", "]" do
-      unless comment.empty? then
-        q.breakable
-        q.text "comment:"
-        q.breakable
-        q.pp @comment
-      end
-    end
-  end
-
-  def to_s # :nodoc:
-    "#{definition} #{name} in: #{parent}"
-  end
-
-  ##
-  # Attributes do not have token streams.
-  #
-  # An RDoc::Attr can show up in the method list in some situations (see
-  # Gem::ConfigFile)
-
-  def token_stream # :nodoc:
-  end
-
-end
diff --git a/lib/rdoc/class_module.rb b/lib/rdoc/class_module.rb
deleted file mode 100644
index c69e14b5e4..0000000000
--- a/lib/rdoc/class_module.rb
+++ /dev/null
@@ -1,801 +0,0 @@
-# frozen_string_literal: true
-##
-# ClassModule is the base class for objects representing either a class or a
-# module.
-
-class RDoc::ClassModule < RDoc::Context
-
-  ##
-  # 1::
-  #   RDoc 3.7
-  #   * Added visibility, singleton and file to attributes
-  #   * Added file to constants
-  #   * Added file to includes
-  #   * Added file to methods
-  # 2::
-  #   RDoc 3.13
-  #   * Added extends
-  # 3::
-  #   RDoc 4.0
-  #   * Added sections
-  #   * Added in_files
-  #   * Added parent name
-  #   * Complete Constant dump
-
-  MARSHAL_VERSION = 3 # :nodoc:
-
-  ##
-  # Constants that are aliases for this class or module
-
-  attr_accessor :constant_aliases
-
-  ##
-  # Comment and the location it came from.  Use #add_comment to add comments
-
-  attr_accessor :comment_location
-
-  attr_accessor :diagram # :nodoc:
-
-  ##
-  # Class or module this constant is an alias for
-
-  attr_accessor :is_alias_for
-
-  ##
-  # Return a RDoc::ClassModule of class +class_type+ that is a copy
-  # of module +module+. Used to promote modules to classes.
-  #--
-  # TODO move to RDoc::NormalClass (I think)
-
-  def self.from_module class_type, mod
-    klass = class_type.new mod.name
-
-    mod.comment_location.each do |comment, location|
-      klass.add_comment comment, location
-    end
-
-    klass.parent = mod.parent
-    klass.section = mod.section
-    klass.viewer = mod.viewer
-
-    klass.attributes.concat mod.attributes
-    klass.method_list.concat mod.method_list
-    klass.aliases.concat mod.aliases
-    klass.external_aliases.concat mod.external_aliases
-    klass.constants.concat mod.constants
-    klass.includes.concat mod.includes
-    klass.extends.concat mod.extends
-
-    klass.methods_hash.update mod.methods_hash
-    klass.constants_hash.update mod.constants_hash
-
-    klass.current_section = mod.current_section
-    klass.in_files.concat mod.in_files
-    klass.sections.concat mod.sections
-    klass.unmatched_alias_lists = mod.unmatched_alias_lists
-    klass.current_section = mod.current_section
-    klass.visibility = mod.visibility
-
-    klass.classes_hash.update mod.classes_hash
-    klass.modules_hash.update mod.modules_hash
-    klass.metadata.update mod.metadata
-
-    klass.document_self = mod.received_nodoc ? nil : mod.document_self
-    klass.document_children = mod.document_children
-    klass.force_documentation = mod.force_documentation
-    klass.done_documenting = mod.done_documenting
-
-    # update the parent of all children
-
-    (klass.attributes +
-     klass.method_list +
-     klass.aliases +
-     klass.external_aliases +
-     klass.constants +
-     klass.includes +
-     klass.extends +
-     klass.classes +
-     klass.modules).each do |obj|
-      obj.parent = klass
-      obj.full_name = nil
-    end
-
-    klass
-  end
-
-  ##
-  # Creates a new ClassModule with +name+ with optional +superclass+
-  #
-  # This is a constructor for subclasses, and must never be called directly.
-
-  def initialize(name, superclass = nil)
-    @constant_aliases = []
-    @diagram          = nil
-    @is_alias_for     = nil
-    @name             = name
-    @superclass       = superclass
-    @comment_location = [] # [[comment, location]]
-
-    super()
-  end
-
-  ##
-  # Adds +comment+ to this ClassModule's list of comments at +location+.  This
-  # method is preferred over #comment= since it allows ri data to be updated
-  # across multiple runs.
-
-  def add_comment comment, location
-    return unless document_self
-
-    original = comment
-
-    comment = case comment
-              when RDoc::Comment then
-                comment.normalize
-              else
-                normalize_comment comment
-              end
-
-    if location.parser == RDoc::Parser::C
-      @comment_location.delete_if { |(_, l)| l == location }
-    end
-
-    @comment_location << [comment, location]
-
-    self.comment = original
-  end
-
-  def add_things my_things, other_things # :nodoc:
-    other_things.each do |group, things|
-      my_things[group].each { |thing| yield false, thing } if
-        my_things.include? group
-
-      things.each do |thing|
-        yield true, thing
-      end
-    end
-  end
-
-  ##
-  # Ancestors list for this ClassModule: the list of included modules
-  # (classes will add their superclass if any).
-  #
-  # Returns the included classes or modules, not the includes
-  # themselves. The returned values are either String or
-  # RDoc::NormalModule instances (see RDoc::Include#module).
-  #
-  # The values are returned in reverse order of their inclusion,
-  # which is the order suitable for searching methods/attributes
-  # in the ancestors. The superclass, if any, comes last.
-
-  def ancestors
-    includes.map { |i| i.module }.reverse
-  end
-
-  def aref_prefix # :nodoc:
-    raise NotImplementedError, "missing aref_prefix for #{self.class}"
-  end
-
-  ##
-  # HTML fragment reference for this module or class.  See
-  # RDoc::NormalClass#aref and RDoc::NormalModule#aref
-
-  def aref
-    "#{aref_prefix}-#{full_name}"
-  end
-
-  ##
-  # Ancestors of this class or module only
-
-  alias direct_ancestors ancestors
-
-  ##
-  # Clears the comment. Used by the Ruby parser.
-
-  def clear_comment
-    @comment = ''
-  end
-
-  ##
-  # This method is deprecated, use #add_comment instead.
-  #
-  # Appends +comment+ to the current comment, but separated by a rule.  Works
-  # more like <tt>+=</tt>.
-
-  def comment= comment # :nodoc:
-    comment = case comment
-              when RDoc::Comment then
-                comment.normalize
-              else
-                normalize_comment comment
-              end
-
-    comment = "#{@comment.to_s}\n---\n#{comment.to_s}" unless @comment.empty?
-
-    super comment
-  end
-
-  ##
-  # Prepares this ClassModule for use by a generator.
-  #
-  # See RDoc::Store#complete
-
-  def complete min_visibility
-    update_aliases
-    remove_nodoc_children
-    update_includes
-    remove_invisible min_visibility
-  end
-
-  ##
-  # Does this ClassModule or any of its methods have document_self set?
-
-  def document_self_or_methods
-    document_self || method_list.any?{ |m| m.document_self }
-  end
-
-  ##
-  # Does this class or module have a comment with content or is
-  # #received_nodoc true?
-
-  def documented?
-    return true if @received_nodoc
-    return false if @comment_location.empty?
-    @comment_location.any? { |comment, _| not comment.empty? }
-  end
-
-  ##
-  # Iterates the ancestors of this class or module for which an
-  # RDoc::ClassModule exists.
-
-  def each_ancestor # :yields: module
-    return enum_for __method__ unless block_given?
-
-    ancestors.each do |mod|
-      next if String === mod
-      next if self == mod
-      yield mod
-    end
-  end
-
-  ##
-  # Looks for a symbol in the #ancestors. See Context#find_local_symbol.
-
-  def find_ancestor_local_symbol symbol
-    each_ancestor do |m|
-      res = m.find_local_symbol(symbol)
-      return res if res
-    end
-
-    nil
-  end
-
-  ##
-  # Finds a class or module with +name+ in this namespace or its descendants
-
-  def find_class_named name
-    return self if full_name == name
-    return self if @name == name
-
-    @classes.values.find do |klass|
-      next if klass == self
-      klass.find_class_named name
-    end
-  end
-
-  ##
-  # Return the fully qualified name of this class or module
-
-  def full_name
-    @full_name ||= if RDoc::ClassModule === parent then
-                     "#{parent.full_name}::#{@name}"
-                   else
-                     @name
-                   end
-  end
-
-  ##
-  # TODO: filter included items by #display?
-
-  def marshal_dump # :nodoc:
-    attrs = attributes.sort.map do |attr|
-      next unless attr.display?
-      [ attr.name, attr.rw,
-        attr.visibility, attr.singleton, attr.file_name,
-      ]
-    end.compact
-
-    method_types = methods_by_type.map do |type, visibilities|
-      visibilities = visibilities.map do |visibility, methods|
-        method_names = methods.map do |method|
-          next unless method.display?
-          [method.name, method.file_name]
-        end.compact
-
-        [visibility, method_names.uniq]
-      end
-
-      [type, visibilities]
-    end
-
-    [ MARSHAL_VERSION,
-      @name,
-      full_name,
-      @superclass,
-      parse(@comment_location),
-      attrs,
-      constants.select { |constant| constant.display? },
-      includes.map do |incl|
-        next unless incl.display?
-        [incl.name, parse(incl.comment), incl.file_name]
-      end.compact,
-      method_types,
-      extends.map do |ext|
-        next unless ext.display?
-        [ext.name, parse(ext.comment), ext.file_name]
-      end.compact,
-      @sections.values,
-      @in_files.map do |tl|
-        tl.relative_name
-      end,
-      parent.full_name,
-      parent.class,
-    ]
-  end
-
-  def marshal_load array # :nodoc:
-    initialize_visibility
-    initialize_methods_etc
-    @current_section   = nil
-    @document_self     = true
-    @done_documenting  = false
-    @parent            = nil
-    @temporary_section = nil
-    @visibility        = nil
-    @classes           = {}
-    @modules           = {}
-
-    @name       = array[1]
-    @full_name  = array[2]
-    @superclass = array[3]
-    @comment    = array[4]
-
-    @comment_location = if RDoc::Markup::Document === @comment.parts.first then
-                          @comment
-                        else
-                          RDoc::Markup::Document.new @comment
-                        end
-
-    array[5].each do |name, rw, visibility, singleton, file|
-      singleton  ||= false
-      visibility ||= :public
-
-      attr = RDoc::Attr.new nil, name, rw, nil, singleton
-
-      add_attribute attr
-      attr.visibility = visibility
-      attr.record_location RDoc::TopLevel.new file
-    end
-
-    array[6].each do |constant, comment, file|
-      case constant
-      when RDoc::Constant then
-        add_constant constant
-      else
-        constant = add_constant RDoc::Constant.new(constant, nil, comment)
-        constant.record_location RDoc::TopLevel.new file
-      end
-    end
-
-    array[7].each do |name, comment, file|
-      incl = add_include RDoc::Include.new(name, comment)
-      incl.record_location RDoc::TopLevel.new file
-    end
-
-    array[8].each do |type, visibilities|
-      visibilities.each do |visibility, methods|
-        @visibility = visibility
-
-        methods.each do |name, file|
-          method = RDoc::AnyMethod.new nil, name
-          method.singleton = true if type == 'class'
-          method.record_location RDoc::TopLevel.new file
-          add_method method
-        end
-      end
-    end
-
-    array[9].each do |name, comment, file|
-      ext = add_extend RDoc::Extend.new(name, comment)
-      ext.record_location RDoc::TopLevel.new file
-    end if array[9] # Support Marshal version 1
-
-    sections = (array[10] || []).map do |section|
-      [section.title, section]
-    end
-
-    @sections = Hash[*sections.flatten]
-    @current_section = add_section nil
-
-    @in_files = []
-
-    (array[11] || []).each do |filename|
-      record_location RDoc::TopLevel.new filename
-    end
-
-    @parent_name  = array[12]
-    @parent_class = array[13]
-  end
-
-  ##
-  # Merges +class_module+ into this ClassModule.
-  #
-  # The data in +class_module+ is preferred over the receiver.
-
-  def merge class_module
-    @parent      = class_module.parent
-    @parent_name = class_module.parent_name
-
-    other_document = parse class_module.comment_location
-
-    if other_document then
-      document = parse @comment_location
-
-      document = document.merge other_document
-
-      @comment = @comment_location = document
-    end
-
-    cm = class_module
-    other_files = cm.in_files
-
-    merge_collections attributes, cm.attributes, other_files do |add, attr|
-      if add then
-        add_attribute attr
-      else
-        @attributes.delete attr
-        @methods_hash.delete attr.pretty_name
-      end
-    end
-
-    merge_collections constants, cm.constants, other_files do |add, const|
-      if add then
-        add_constant const
-      else
-        @constants.delete const
-        @constants_hash.delete const.name
-      end
-    end
-
-    merge_collections includes, cm.includes, other_files do |add, incl|
-      if add then
-        add_include incl
-      else
-        @includes.delete incl
-      end
-    end
-
-    @includes.uniq! # clean up
-
-    merge_collections extends, cm.extends, other_files do |add, ext|
-      if add then
-        add_extend ext
-      else
-        @extends.delete ext
-      end
-    end
-
-    @extends.uniq! # clean up
-
-    merge_collections method_list, cm.method_list, other_files do |add, meth|
-      if add then
-        add_method meth
-      else
-        @method_list.delete meth
-        @methods_hash.delete meth.pretty_name
-      end
-    end
-
-    merge_sections cm
-
-    self
-  end
-
-  ##
-  # Merges collection +mine+ with +other+ preferring other.  +other_files+ is
-  # used to help determine which items should be deleted.
-  #
-  # Yields whether the item should be added or removed (true or false) and the
-  # item to be added or removed.
-  #
-  #   merge_collections things, other.things, other.in_files do |add, thing|
-  #     if add then
-  #       # add the thing
-  #     else
-  #       # remove the thing
-  #     end
-  #   end
-
-  def merge_collections mine, other, other_files, &block # :nodoc:
-    my_things    = mine. group_by { |thing| thing.file }
-    other_things = other.group_by { |thing| thing.file }
-
-    remove_things my_things, other_files,  &block
-    add_things    my_things, other_things, &block
-  end
-
-  ##
-  # Merges the comments in this ClassModule with the comments in the other
-  # ClassModule +cm+.
-
-  def merge_sections cm # :nodoc:
-    my_sections    =    sections.group_by { |section| section.title }
-    other_sections = cm.sections.group_by { |section| section.title }
-
-    other_files = cm.in_files
-
-    remove_things my_sections, other_files do |_, section|
-      @sections.delete section.title
-    end
-
-    other_sections.each do |group, sections|
-      if my_sections.include? group
-        my_sections[group].each do |my_section|
-          other_section = cm.sections_hash[group]
-
-          my_comments    = my_section.comments
-          other_comments = other_section.comments
-
-          other_files = other_section.in_files
-
-          merge_collections my_comments, other_comments, other_files do |add, comment|
-            if add then
-              my_section.add_comment comment
-            else
-              my_section.remove_comment comment
-            end
-          end
-        end
-      else
-        sections.each do |section|
-          add_section group, section.comments
-        end
-      end
-    end
-  end
-
-  ##
-  # Does this object represent a module?
-
-  def module?
-    false
-  end
-
-  ##
-  # Allows overriding the initial name.
-  #
-  # Used for modules and classes that are constant aliases.
-
-  def name= new_name
-    @name = new_name
-  end
-
-  ##
-  # Parses +comment_location+ into an RDoc::Markup::Document composed of
-  # multiple RDoc::Markup::Documents with their file set.
-
-  def parse comment_location
-    case comment_location
-    when String then
-      super
-    when Array then
-      docs = comment_location.map do |comment, location|
-        doc = super comment
-        doc.file = location
-        doc
-      end
-
-      RDoc::Markup::Document.new(*docs)
-    when RDoc::Comment then
-      doc = super comment_location.text, comment_location.format
-      doc.file = comment_location.location
-      doc
-    when RDoc::Markup::Document then
-      return comment_location
-    else
-      raise ArgumentError, "unknown comment class #{comment_location.class}"
-    end
-  end
-
-  ##
-  # Path to this class or module for use with HTML generator output.
-
-  def path
-    http_url @store.rdoc.generator.class_dir
-  end
-
-  ##
-  # Name to use to generate the url:
-  # modules and classes that are aliases for another
-  # module or class return the name of the latter.
-
-  def name_for_path
-    is_alias_for ? is_alias_for.full_name : full_name
-  end
-
-  ##
-  # Returns the classes and modules that are not constants
-  # aliasing another class or module. For use by formatters
-  # only (caches its result).
-
-  def non_aliases
-    @non_aliases ||= classes_and_modules.reject { |cm| cm.is_alias_for }
-  end
-
-  ##
-  # Updates the child modules or classes of class/module +parent+ by
-  # deleting the ones that have been removed from the documentation.
-  #
-  # +parent_hash+ is either <tt>parent.modules_hash</tt> or
-  # <tt>parent.classes_hash</tt> and +all_hash+ is ::all_modules_hash or
-  # ::all_classes_hash.
-
-  def remove_nodoc_children
-    prefix = self.full_name + '::'
-
-    modules_hash.each_key do |name|
-      full_name = prefix + name
-      modules_hash.delete name unless @store.modules_hash[full_name]
-    end
-
-    classes_hash.each_key do |name|
-      full_name = prefix + name
-      classes_hash.delete name unless @store.classes_hash[full_name]
-    end
-  end
-
-  def remove_things my_things, other_files # :nodoc:
-    my_things.delete_if do |file, things|
-      next false unless other_files.include? file
-
-      things.each do |thing|
-        yield false, thing
-      end
-
-      true
-    end
-  end
-
-  ##
-  # Search record used by RDoc::Generator::JsonIndex
-
-  def search_record
-    [
-      name,
-      full_name,
-      full_name,
-      '',
-      path,
-      '',
-      snippet(@comment_location),
-    ]
-  end
-
-  ##
-  # Sets the store for this class or module and its contained code objects.
-
-  def store= store
-    super
-
-    @attributes .each do |attr|  attr.store  = store end
-    @constants  .each do |const| const.store = store end
-    @includes   .each do |incl|  incl.store  = store end
-    @extends    .each do |ext|   ext.store   = store end
-    @method_list.each do |meth|  meth.store  = store end
-  end
-
-  ##
-  # Get the superclass of this class.  Attempts to retrieve the superclass
-  # object, returns the name if it is not known.
-
-  def superclass
-    @store.find_class_named(@superclass) || @superclass
-  end
-
-  ##
-  # Set the superclass of this class to +superclass+
-
-  def superclass=(superclass)
-    raise NoMethodError, "#{full_name} is a module" if module?
-    @superclass = superclass
-  end
-
-  def to_s # :nodoc:
-    if is_alias_for then
-      "#{self.class.name} #{self.full_name} -> #{is_alias_for}"
-    else
-      super
-    end
-  end
-
-  ##
-  # 'module' or 'class'
-
-  def type
-    module? ? 'module' : 'class'
-  end
-
-  ##
-  # Updates the child modules & classes by replacing the ones that are
-  # aliases through a constant.
-  #
-  # The aliased module/class is replaced in the children and in
-  # RDoc::Store#modules_hash or RDoc::Store#classes_hash
-  # by a copy that has <tt>RDoc::ClassModule#is_alias_for</tt> set to
-  # the aliased module/class, and this copy is added to <tt>#aliases</tt>
-  # of the aliased module/class.
-  #
-  # Formatters can use the #non_aliases method to retrieve children that
-  # are not aliases, for instance to list the namespace content, since
-  # the aliased modules are included in the constants of the class/module,
-  # that are listed separately.
-
-  def update_aliases
-    constants.each do |const|
-      next unless cm = const.is_alias_for
-      cm_alias = cm.dup
-      cm_alias.name = const.name
-
-      # Don't move top-level aliases under Object, they look ugly there
-      unless RDoc::TopLevel === cm_alias.parent then
-        cm_alias.parent = self
-        cm_alias.full_name = nil # force update for new parent
-      end
-
-      cm_alias.aliases.clear
-      cm_alias.is_alias_for = cm
-
-      if cm.module? then
-        @store.modules_hash[cm_alias.full_name] = cm_alias
-        modules_hash[const.name] = cm_alias
-      else
-        @store.classes_hash[cm_alias.full_name] = cm_alias
-        classes_hash[const.name] = cm_alias
-      end
-
-      cm.aliases << cm_alias
-    end
-  end
-
-  ##
-  # Deletes from #includes those whose module has been removed from the
-  # documentation.
-  #--
-  # FIXME: includes are not reliably removed, see _possible_bug test case
-
-  def update_includes
-    includes.reject! do |include|
-      mod = include.module
-      !(String === mod) && @store.modules_hash[mod.full_name].nil?
-    end
-
-    includes.uniq!
-  end
-
-  ##
-  # Deletes from #extends those whose module has been removed from the
-  # documentation.
-  #--
-  # FIXME: like update_includes, extends are not reliably removed
-
-  def update_extends
-    extends.reject! do |ext|
-      mod = ext.module
-
-      !(String === mod) && @store.modules_hash[mod.full_name].nil?
-    end
-
-    extends.uniq!
-  end
-
-end
diff --git a/lib/rdoc/code_object.rb b/lib/rdoc/code_object.rb
deleted file mode 100644
index aeb4b4762e..0000000000
--- a/lib/rdoc/code_object.rb
+++ /dev/null
@@ -1,421 +0,0 @@
-# frozen_string_literal: true
-##
-# Base class for the RDoc code tree.
-#
-# We contain the common stuff for contexts (which are containers) and other
-# elements (methods, attributes and so on)
-#
-# Here's the tree of the CodeObject subclasses:
-#
-# * RDoc::Context
-#   * RDoc::TopLevel
-#   * RDoc::ClassModule
-#     * RDoc::AnonClass (never used so far)
-#     * RDoc::NormalClass
-#     * RDoc::NormalModule
-#     * RDoc::SingleClass
-# * RDoc::MethodAttr
-#   * RDoc::Attr
-#   * RDoc::AnyMethod
-#     * RDoc::GhostMethod
-#     * RDoc::MetaMethod
-# * RDoc::Alias
-# * RDoc::Constant
-# * RDoc::Mixin
-#   * RDoc::Require
-#   * RDoc::Include
-
-class RDoc::CodeObject
-
-  include RDoc::Text
-
-  ##
-  # Our comment
-
-  attr_reader :comment
-
-  ##
-  # Do we document our children?
-
-  attr_reader :document_children
-
-  ##
-  # Do we document ourselves?
-
-  attr_reader :document_self
-
-  ##
-  # Are we done documenting (ie, did we come across a :enddoc:)?
-
-  attr_reader :done_documenting
-
-  ##
-  # Which file this code object was defined in
-
-  attr_reader :file
-
-  ##
-  # Force documentation of this CodeObject
-
-  attr_reader :force_documentation
-
-  ##
-  # Line in #file where this CodeObject was defined
-
-  attr_accessor :line
-
-  ##
-  # Hash of arbitrary metadata for this CodeObject
-
-  attr_reader :metadata
-
-  ##
-  # Sets the parent CodeObject
-
-  attr_writer :parent
-
-  ##
-  # Did we ever receive a +:nodoc:+ directive?
-
-  attr_reader :received_nodoc
-
-  ##
-  # Set the section this CodeObject is in
-
-  attr_writer :section
-
-  ##
-  # The RDoc::Store for this object.
-
-  attr_reader :store
-
-  ##
-  # We are the model of the code, but we know that at some point we will be
-  # worked on by viewers. By implementing the Viewable protocol, viewers can
-  # associated themselves with these objects.
-
-  attr_accessor :viewer
-
-  ##
-  # Creates a new CodeObject that will document itself and its children
-
-  def initialize
-    @metadata         = {}
-    @comment          = ''
-    @parent           = nil
-    @parent_name      = nil # for loading
-    @parent_class     = nil # for loading
-    @section          = nil
-    @section_title    = nil # for loading
-    @file             = nil
-    @full_name        = nil
-    @store            = nil
-    @track_visibility = true
-
-    initialize_visibility
-  end
-
-  ##
-  # Initializes state for visibility of this CodeObject and its children.
-
-  def initialize_visibility # :nodoc:
-    @document_children   = true
-    @document_self       = true
-    @done_documenting    = false
-    @force_documentation = false
-    @received_nodoc      = false
-    @ignored             = false
-    @suppressed          = false
-    @track_visibility    = true
-  end
-
-  ##
-  # Replaces our comment with +comment+, unless it is empty.
-
-  def comment=(comment)
-    @comment = case comment
-               when NilClass               then ''
-               when RDoc::Markup::Document then comment
-               when RDoc::Comment          then comment.normalize
-               else
-                 if comment and not comment.empty? then
-                   normalize_comment comment
-                 else
-                   # HACK correct fix is to have #initialize create @comment
-                   #      with the correct encoding
-                   if String === @comment and @comment.empty? then
-                     @comment = RDoc::Encoding.change_encoding @comment, comment.encoding
-                   end
-                   @comment
-                 end
-               end
-  end
-
-  ##
-  # Should this CodeObject be displayed in output?
-  #
-  # A code object should be displayed if:
-  #
-  # * The item didn't have a nodoc or wasn't in a container that had nodoc
-  # * The item wasn't ignored
-  # * The item has documentation and was not suppressed
-
-  def display?
-    @document_self and not @ignored and
-      (documented? or not @suppressed)
-  end
-
-  ##
-  # Enables or disables documentation of this CodeObject's children unless it
-  # has been turned off by :enddoc:
-
-  def document_children=(document_children)
-    return unless @track_visibility
-
-    @document_children = document_children unless @done_documenting
-  end
-
-  ##
-  # Enables or disables documentation of this CodeObject unless it has been
-  # turned off by :enddoc:.  If the argument is +nil+ it means the
-  # documentation is turned off by +:nodoc:+.
-
-  def document_self=(document_self)
-    return unless @track_visibility
-    return if @done_documenting
-
-    @document_self = document_self
-    @received_nodoc = true if document_self.nil?
-  end
-
-  ##
-  # Does this object have a comment with content or is #received_nodoc true?
-
-  def documented?
-    @received_nodoc or !@comment.empty?
-  end
-
-  ##
-  # Turns documentation on/off, and turns on/off #document_self
-  # and #document_children.
-  #
-  # Once documentation has been turned off (by +:enddoc:+),
-  # the object will refuse to turn #document_self or
-  # #document_children on, so +:doc:+ and +:start_doc:+ directives
-  # will have no effect in the current file.
-
-  def done_documenting=(value)
-    return unless @track_visibility
-    @done_documenting  = value
-    @document_self     = !value
-    @document_children = @document_self
-  end
-
-  ##
-  # Yields each parent of this CodeObject.  See also
-  # RDoc::ClassModule#each_ancestor
-
-  def each_parent
-    code_object = self
-
-    while code_object = code_object.parent do
-      yield code_object
-    end
-
-    self
-  end
-
-  ##
-  # File name where this CodeObject was found.
-  #
-  # See also RDoc::Context#in_files
-
-  def file_name
-    return unless @file
-
-    @file.absolute_name
-  end
-
-  ##
-  # Force the documentation of this object unless documentation
-  # has been turned off by :enddoc:
-  #--
-  # HACK untested, was assigning to an ivar
-
-  def force_documentation=(value)
-    @force_documentation = value unless @done_documenting
-  end
-
-  ##
-  # Sets the full_name overriding any computed full name.
-  #
-  # Set to +nil+ to clear RDoc's cached value
-
-  def full_name= full_name
-    @full_name = full_name
-  end
-
-  ##
-  # Use this to ignore a CodeObject and all its children until found again
-  # (#record_location is called).  An ignored item will not be displayed in
-  # documentation.
-  #
-  # See github issue #55
-  #
-  # The ignored status is temporary in order to allow implementation details
-  # to be hidden.  At the end of processing a file RDoc allows all classes
-  # and modules to add new documentation to previously created classes.
-  #
-  # If a class was ignored (via stopdoc) then reopened later with additional
-  # documentation it should be displayed.  If a class was ignored and never
-  # reopened it should not be displayed.  The ignore flag allows this to
-  # occur.
-
-  def ignore
-    return unless @track_visibility
-
-    @ignored = true
-
-    stop_doc
-  end
-
-  ##
-  # Has this class been ignored?
-  #
-  # See also #ignore
-
-  def ignored?
-    @ignored
-  end
-
-  ##
-  # The options instance from the store this CodeObject is attached to, or a
-  # default options instance if the CodeObject is not attached.
-  #
-  # This is used by Text#snippet
-
-  def options
-    if @store and @store.rdoc then
-      @store.rdoc.options
-    else
-      RDoc::Options.new
-    end
-  end
-
-  ##
-  # Our parent CodeObject.  The parent may be missing for classes loaded from
-  # legacy RI data stores.
-
-  def parent
-    return @parent if @parent
-    return nil unless @parent_name
-
-    if @parent_class == RDoc::TopLevel then
-      @parent = @store.add_file @parent_name
-    else
-      @parent = @store.find_class_or_module @parent_name
-
-      return @parent if @parent
-
-      begin
-        @parent = @store.load_class @parent_name
-      rescue RDoc::Store::MissingFileError
-        nil
-      end
-    end
-  end
-
-  ##
-  # File name of our parent
-
-  def parent_file_name
-    @parent ? @parent.base_name : '(unknown)'
-  end
-
-  ##
-  # Name of our parent
-
-  def parent_name
-    @parent ? @parent.full_name : '(unknown)'
-  end
-
-  ##
-  # Records the RDoc::TopLevel (file) where this code object was defined
-
-  def record_location top_level
-    @ignored    = false
-    @suppressed = false
-    @file       = top_level
-  end
-
-  ##
-  # The section this CodeObject is in.  Sections allow grouping of constants,
-  # attributes and methods inside a class or module.
-
-  def section
-    return @section if @section
-
-    @section = parent.add_section @section_title if parent
-  end
-
-  ##
-  # Enable capture of documentation unless documentation has been
-  # turned off by :enddoc:
-
-  def start_doc
-    return if @done_documenting
-
-    @document_self = true
-    @document_children = true
-    @ignored    = false
-    @suppressed = false
-  end
-
-  ##
-  # Disable capture of documentation
-
-  def stop_doc
-    return unless @track_visibility
-
-    @document_self = false
-    @document_children = false
-  end
-
-  ##
-  # Sets the +store+ that contains this CodeObject
-
-  def store= store
-    @store = store
-
-    return unless @track_visibility
-
-    if :nodoc == options.visibility then
-      initialize_visibility
-      @track_visibility = false
-    end
-  end
-
-  ##
-  # Use this to suppress a CodeObject and all its children until the next file
-  # it is seen in or documentation is discovered.  A suppressed item with
-  # documentation will be displayed while an ignored item with documentation
-  # may not be displayed.
-
-  def suppress
-    return unless @track_visibility
-
-    @suppressed = true
-
-    stop_doc
-  end
-
-  ##
-  # Has this class been suppressed?
-  #
-  # See also #suppress
-
-  def suppressed?
-    @suppressed
-  end
-
-end
diff --git a/lib/rdoc/code_objects.rb b/lib/rdoc/code_objects.rb
deleted file mode 100644
index d5f2f920ad..0000000000
--- a/lib/rdoc/code_objects.rb
+++ /dev/null
@@ -1,5 +0,0 @@
-# frozen_string_literal: true
-# This file was used to load all the RDoc::CodeObject subclasses at once.  Now
-# autoload handles this.
-
-require_relative '../rdoc'
diff --git a/lib/rdoc/comment.rb b/lib/rdoc/comment.rb
deleted file mode 100644
index 04ec226436..0000000000
--- a/lib/rdoc/comment.rb
+++ /dev/null
@@ -1,229 +0,0 @@
-# frozen_string_literal: true
-##
-# A comment holds the text comment for a RDoc::CodeObject and provides a
-# unified way of cleaning it up and parsing it into an RDoc::Markup::Document.
-#
-# Each comment may have a different markup format set by #format=.  By default
-# 'rdoc' is used.  The :markup: directive tells RDoc which format to use.
-#
-# See RDoc::MarkupReference@Directive+for+Specifying+RDoc+Source+Format.
-
-
-class RDoc::Comment
-
-  include RDoc::Text
-
-  ##
-  # The format of this comment.  Defaults to RDoc::Markup
-
-  attr_reader :format
-
-  ##
-  # The RDoc::TopLevel this comment was found in
-
-  attr_accessor :location
-
-  ##
-  # Line where this Comment was written
-
-  attr_accessor :line
-
-  ##
-  # For duck-typing when merging classes at load time
-
-  alias file location # :nodoc:
-
-  ##
-  # The text for this comment
-
-  attr_reader :text
-
-  ##
-  # Alias for text
-
-  alias to_s text
-
-  ##
-  # Overrides the content returned by #parse.  Use when there is no #text
-  # source for this comment
-
-  attr_writer   :document
-
-  ##
-  # Creates a new comment with +text+ that is found in the RDoc::TopLevel
-  # +location+.
-
-  def initialize text = nil, location = nil, language = nil
-    @location = location
-    @text     = text.nil? ? nil : text.dup
-    @language = language
-
-    @document   = nil
-    @format     = 'rdoc'
-    @normalized = false
-  end
-
-  ##
-  #--
-  # TODO deep copy @document
-
-  def initialize_copy copy # :nodoc:
-    @text = copy.text.dup
-  end
-
-  def == other # :nodoc:
-    self.class === other and
-      other.text == @text and other.location == @location
-  end
-
-  ##
-  # Look for a 'call-seq' in the comment to override the normal parameter
-  # handling.  The :call-seq: is indented from the baseline.  All lines of the
-  # same indentation level and prefix are consumed.
-  #
-  # For example, all of the following will be used as the :call-seq:
-  #
-  #   # :call-seq:
-  #   #   ARGF.readlines(sep=$/)     -> array
-  #   #   ARGF.readlines(limit)      -> array
-  #   #   ARGF.readlines(sep, limit) -> array
-  #   #
-  #   #   ARGF.to_a(sep=$/)     -> array
-  #   #   ARGF.to_a(limit)      -> array
-  #   #   ARGF.to_a(sep, limit) -> array
-
-  def extract_call_seq method
-    # we must handle situations like the above followed by an unindented first
-    # comment.  The difficulty is to make sure not to match lines starting
-    # with ARGF at the same indent, but that are after the first description
-    # paragraph.
-    if /^(?<S> ((?!\n)\s)*+        (?# whitespaces except newline))
-         :?call-seq:
-           (?<B> \g<S>(?<N>\n|\z)  (?# trailing spaces))?
-         (?<seq>
-           (\g<S>(?!\w)\S.*\g<N>)*
-           (?>
-             (?<H> \g<S>\w+        (?# ' #   ARGF' in the example above))
-             .*\g<N>)?
-           (\g<S>\S.*\g<N>         (?# other non-blank line))*+
-           (\g<B>+(\k<H>.*\g<N>    (?# ARGF.to_a lines))++)*+
-         )
-         (?m:^\s*$|\z)
-        /x =~ @text
-      seq = $~[:seq]
-
-      all_start, all_stop = $~.offset(0)
-      @text.slice! all_start...all_stop
-
-      seq.gsub!(/^\s*/, '')
-      method.call_seq = seq
-    end
-
-    method
-  end
-
-  ##
-  # A comment is empty if its text String is empty.
-
-  def empty?
-    @text.empty?
-  end
-
-  ##
-  # HACK dubious
-
-  def encode! encoding
-    @text = String.new @text, encoding: encoding
-    self
-  end
-
-  ##
-  # Sets the format of this comment and resets any parsed document
-
-  def format= format
-    @format = format
-    @document = nil
-  end
-
-  def inspect # :nodoc:
-    location = @location ? @location.relative_name : '(unknown)'
-
-    "#<%s:%x %s %p>" % [self.class, object_id, location, @text]
-  end
-
-  ##
-  # Normalizes the text.  See RDoc::Text#normalize_comment for details
-
-  def normalize
-    return self unless @text
-    return self if @normalized # TODO eliminate duplicate normalization
-
-    @text = normalize_comment @text
-
-    @normalized = true
-
-    self
-  end
-
-  ##
-  # Was this text normalized?
-
-  def normalized? # :nodoc:
-    @normalized
-  end
-
-  ##
-  # Parses the comment into an RDoc::Markup::Document.  The parsed document is
-  # cached until the text is changed.
-
-  def parse
-    return @document if @document
-
-    @document = super @text, @format
-    @document.file = @location
-    @document
-  end
-
-  ##
-  # Removes private sections from this comment.  Private sections are flush to
-  # the comment marker and start with <tt>--</tt> and end with <tt>++</tt>.
-  # For C-style comments, a private marker may not start at the opening of the
-  # comment.
-  #
-  #   /*
-  #    *--
-  #    * private
-  #    *++
-  #    * public
-  #    */
-
-  def remove_private
-    # Workaround for gsub encoding for Ruby 1.9.2 and earlier
-    empty = ''
-    empty = RDoc::Encoding.change_encoding empty, @text.encoding
-
-    @text = @text.gsub(%r%^\s*([#*]?)--.*?^\s*(\1)\+\+\n?%m, empty)
-    @text = @text.sub(%r%^\s*[#*]?--.*%m, '')
-  end
-
-  ##
-  # Replaces this comment's text with +text+ and resets the parsed document.
-  #
-  # An error is raised if the comment contains a document but no text.
-
-  def text= text
-    raise RDoc::Error, 'replacing document-only comment is not allowed' if
-      @text.nil? and @document
-
-    @document = nil
-    @text = text.nil? ? nil : text.dup
-  end
-
-  ##
-  # Returns true if this comment is in TomDoc format.
-
-  def tomdoc?
-    @format == 'tomdoc'
-  end
-
-end
diff --git a/lib/rdoc/constant.rb b/lib/rdoc/constant.rb
deleted file mode 100644
index 12b8be775c..0000000000
--- a/lib/rdoc/constant.rb
+++ /dev/null
@@ -1,186 +0,0 @@
-# frozen_string_literal: true
-##
-# A constant
-
-class RDoc::Constant < RDoc::CodeObject
-
-  MARSHAL_VERSION = 0 # :nodoc:
-
-  ##
-  # Sets the module or class this is constant is an alias for.
-
-  attr_writer :is_alias_for
-
-  ##
-  # The constant's name
-
-  attr_accessor :name
-
-  ##
-  # The constant's value
-
-  attr_accessor :value
-
-  ##
-  # The constant's visibility
-
-  attr_accessor :visibility
-
-  ##
-  # Creates a new constant with +name+, +value+ and +comment+
-
-  def initialize(name, value, comment)
-    super()
-
-    @name  = name
-    @value = value
-
-    @is_alias_for = nil
-    @visibility   = :public
-
-    self.comment = comment
-  end
-
-  ##
-  # Constants are ordered by name
-
-  def <=> other
-    return unless self.class === other
-
-    [parent_name, name] <=> [other.parent_name, other.name]
-  end
-
-  ##
-  # Constants are equal when their #parent and #name is the same
-
-  def == other
-    self.class == other.class and
-      @parent == other.parent and
-      @name == other.name
-  end
-
-  ##
-  # A constant is documented if it has a comment, or is an alias
-  # for a documented class or module.
-
-  def documented?
-    return true if super
-    return false unless @is_alias_for
-    case @is_alias_for
-    when String then
-      found = @store.find_class_or_module @is_alias_for
-      return false unless found
-      @is_alias_for = found
-    end
-    @is_alias_for.documented?
-  end
-
-  ##
-  # Full constant name including namespace
-
-  def full_name
-    @full_name ||= "#{parent_name}::#{@name}"
-  end
-
-  ##
-  # The module or class this constant is an alias for
-
-  def is_alias_for
-    case @is_alias_for
-    when String then
-      found = @store.find_class_or_module @is_alias_for
-      @is_alias_for = found if found
-      @is_alias_for
-    else
-      @is_alias_for
-    end
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x %s::%s>" % [
-      self.class, object_id,
-      parent_name, @name,
-    ]
-  end
-
-  ##
-  # Dumps this Constant for use by ri.  See also #marshal_load
-
-  def marshal_dump
-    alias_name = case found = is_alias_for
-                 when RDoc::CodeObject then found.full_name
-                 else                       found
-                 end
-
-    [ MARSHAL_VERSION,
-      @name,
-      full_name,
-      @visibility,
-      alias_name,
-      parse(@comment),
-      @file.relative_name,
-      parent.name,
-      parent.class,
-      section.title,
-    ]
-  end
-
-  ##
-  # Loads this Constant from +array+.  For a loaded Constant the following
-  # methods will return cached values:
-  #
-  # * #full_name
-  # * #parent_name
-
-  def marshal_load array
-    initialize array[1], nil, array[5]
-
-    @full_name     = array[2]
-    @visibility    = array[3] || :public
-    @is_alias_for  = array[4]
-    #                      5 handled above
-    #                      6 handled below
-    @parent_name   = array[7]
-    @parent_class  = array[8]
-    @section_title = array[9]
-
-    @file = RDoc::TopLevel.new array[6]
-  end
-
-  ##
-  # Path to this constant for use with HTML generator output.
-
-  def path
-    "#{@parent.path}##{@name}"
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[#{self.class.name} #{full_name}", "]" do
-      unless comment.empty? then
-        q.breakable
-        q.text "comment:"
-        q.breakable
-        q.pp @comment
-      end
-    end
-  end
-
-  ##
-  # Sets the store for this class or module and its contained code objects.
-
-  def store= store
-    super
-
-    @file = @store.add_file @file.full_name if @file
-  end
-
-  def to_s # :nodoc:
-    parent_name = parent ? parent.full_name : '(unknown)'
-    if is_alias_for
-      "constant #{parent_name}::#@name -> #{is_alias_for}"
-    else
-      "constant #{parent_name}::#@name"
-    end
-  end
-
-end
diff --git a/lib/rdoc/context.rb b/lib/rdoc/context.rb
deleted file mode 100644
index c688d562c3..0000000000
--- a/lib/rdoc/context.rb
+++ /dev/null
@@ -1,1264 +0,0 @@
-# frozen_string_literal: true
-##
-# A Context is something that can hold modules, classes, methods, attributes,
-# aliases, requires, and includes. Classes, modules, and files are all
-# Contexts.
-
-class RDoc::Context < RDoc::CodeObject
-
-  include Comparable
-
-  ##
-  # Types of methods
-
-  TYPES = %w[class instance]
-
-  ##
-  # If a context has these titles it will be sorted in this order.
-
-  TOMDOC_TITLES = [nil, 'Public', 'Internal', 'Deprecated'] # :nodoc:
-  TOMDOC_TITLES_SORT = TOMDOC_TITLES.sort_by { |title| title.to_s } # :nodoc:
-
-  ##
-  # Class/module aliases
-
-  attr_reader :aliases
-
-  ##
-  # All attr* methods
-
-  attr_reader :attributes
-
-  ##
-  # Block params to be used in the next MethodAttr parsed under this context
-
-  attr_accessor :block_params
-
-  ##
-  # Constants defined
-
-  attr_reader :constants
-
-  ##
-  # Sets the current documentation section of documentation
-
-  attr_writer :current_section
-
-  ##
-  # Files this context is found in
-
-  attr_reader :in_files
-
-  ##
-  # Modules this context includes
-
-  attr_reader :includes
-
-  ##
-  # Modules this context is extended with
-
-  attr_reader :extends
-
-  ##
-  # Methods defined in this context
-
-  attr_reader :method_list
-
-  ##
-  # Name of this class excluding namespace.  See also full_name
-
-  attr_reader :name
-
-  ##
-  # Files this context requires
-
-  attr_reader :requires
-
-  ##
-  # Use this section for the next method, attribute or constant added.
-
-  attr_accessor :temporary_section
-
-  ##
-  # Hash <tt>old_name => [aliases]</tt>, for aliases
-  # that haven't (yet) been resolved to a method/attribute.
-  # (Not to be confused with the aliases of the context.)
-
-  attr_accessor :unmatched_alias_lists
-
-  ##
-  # Aliases that could not be resolved.
-
-  attr_reader :external_aliases
-
-  ##
-  # Current visibility of this context
-
-  attr_accessor :visibility
-
-  ##
-  # Current visibility of this line
-
-  attr_writer :current_line_visibility
-
-  ##
-  # Hash of registered methods. Attributes are also registered here,
-  # twice if they are RW.
-
-  attr_reader :methods_hash
-
-  ##
-  # Params to be used in the next MethodAttr parsed under this context
-
-  attr_accessor :params
-
-  ##
-  # Hash of registered constants.
-
-  attr_reader :constants_hash
-
-  ##
-  # Creates an unnamed empty context with public current visibility
-
-  def initialize
-    super
-
-    @in_files = []
-
-    @name    ||= "unknown"
-    @parent  = nil
-    @visibility = :public
-
-    @current_section = Section.new self, nil, nil
-    @sections = { nil => @current_section }
-    @temporary_section = nil
-
-    @classes = {}
-    @modules = {}
-
-    initialize_methods_etc
-  end
-
-  ##
-  # Sets the defaults for methods and so-forth
-
-  def initialize_methods_etc
-    @method_list = []
-    @attributes  = []
-    @aliases     = []
-    @requires    = []
-    @includes    = []
-    @extends     = []
-    @constants   = []
-    @external_aliases = []
-    @current_line_visibility = nil
-
-    # This Hash maps a method name to a list of unmatched aliases (aliases of
-    # a method not yet encountered).
-    @unmatched_alias_lists = {}
-
-    @methods_hash   = {}
-    @constants_hash = {}
-
-    @params = nil
-
-    @store ||= nil
-  end
-
-  ##
-  # Contexts are sorted by full_name
-
-  def <=>(other)
-    return nil unless RDoc::CodeObject === other
-
-    full_name <=> other.full_name
-  end
-
-  ##
-  # Adds an item of type +klass+ with the given +name+ and +comment+ to the
-  # context.
-  #
-  # Currently only RDoc::Extend and RDoc::Include are supported.
-
-  def add klass, name, comment
-    if RDoc::Extend == klass then
-      ext = RDoc::Extend.new name, comment
-      add_extend ext
-    elsif RDoc::Include == klass then
-      incl = RDoc::Include.new name, comment
-      add_include incl
-    else
-      raise NotImplementedError, "adding a #{klass} is not implemented"
-    end
-  end
-
-  ##
-  # Adds +an_alias+ that is automatically resolved
-
-  def add_alias an_alias
-    return an_alias unless @document_self
-
-    method_attr = find_method(an_alias.old_name, an_alias.singleton) ||
-                  find_attribute(an_alias.old_name, an_alias.singleton)
-
-    if method_attr then
-      method_attr.add_alias an_alias, self
-    else
-      add_to @external_aliases, an_alias
-      unmatched_alias_list =
-        @unmatched_alias_lists[an_alias.pretty_old_name] ||= []
-      unmatched_alias_list.push an_alias
-    end
-
-    an_alias
-  end
-
-  ##
-  # Adds +attribute+ if not already there. If it is (as method(s) or attribute),
-  # updates the comment if it was empty.
-  #
-  # The attribute is registered only if it defines a new method.
-  # For instance, <tt>attr_reader :foo</tt> will not be registered
-  # if method +foo+ exists, but <tt>attr_accessor :foo</tt> will be registered
-  # if method +foo+ exists, but <tt>foo=</tt> does not.
-
-  def add_attribute attribute
-    return attribute unless @document_self
-
-    # mainly to check for redefinition of an attribute as a method
-    # TODO find a policy for 'attr_reader :foo' + 'def foo=()'
-    register = false
-
-    key = nil
-
-    if attribute.rw.index 'R' then
-      key = attribute.pretty_name
-      known = @methods_hash[key]
-
-      if known then
-        known.comment = attribute.comment if known.comment.empty?
-      elsif registered = @methods_hash[attribute.pretty_name + '='] and
-            RDoc::Attr === registered then
-        registered.rw = 'RW'
-      else
-        @methods_hash[key] = attribute
-        register = true
-      end
-    end
-
-    if attribute.rw.index 'W' then
-      key = attribute.pretty_name + '='
-      known = @methods_hash[key]
-
-      if known then
-        known.comment = attribute.comment if known.comment.empty?
-      elsif registered = @methods_hash[attribute.pretty_name] and
-            RDoc::Attr === registered then
-        registered.rw = 'RW'
-      else
-        @methods_hash[key] = attribute
-        register = true
-      end
-    end
-
-    if register then
-      attribute.visibility = @visibility
-      add_to @attributes, attribute
-      resolve_aliases attribute
-    end
-
-    attribute
-  end
-
-  ##
-  # Adds a class named +given_name+ with +superclass+.
-  #
-  # Both +given_name+ and +superclass+ may contain '::', and are
-  # interpreted relative to the +self+ context. This allows handling correctly
-  # examples like these:
-  #   class RDoc::Gauntlet < Gauntlet
-  #   module Mod
-  #     class Object   # implies < ::Object
-  #     class SubObject < Object  # this is _not_ ::Object
-  #
-  # Given <tt>class Container::Item</tt> RDoc assumes +Container+ is a module
-  # unless it later sees <tt>class Container</tt>.  +add_class+ automatically
-  # upgrades +given_name+ to a class in this case.
-
-  def add_class class_type, given_name, superclass = '::Object'
-    # superclass +nil+ is passed by the C parser in the following cases:
-    # - registering Object in 1.8 (correct)
-    # - registering BasicObject in 1.9 (correct)
-    # - registering RubyVM in 1.9 in iseq.c (incorrect: < Object in vm.c)
-    #
-    # If we later find a superclass for a registered class with a nil
-    # superclass, we must honor it.
-
-    # find the name & enclosing context
-    if given_name =~ /^:+(\w+)$/ then
-      full_name = $1
-      enclosing = top_level
-      name = full_name.split(/:+/).last
-    else
-      full_name = child_name given_name
-
-      if full_name =~ /^(.+)::(\w+)$/ then
-        name = $2
-        ename = $1
-        enclosing = @store.classes_hash[ename] || @store.modules_hash[ename]
-        # HACK: crashes in actionpack/lib/action_view/helpers/form_helper.rb (metaprogramming)
-        unless enclosing then
-          # try the given name at top level (will work for the above example)
-          enclosing = @store.classes_hash[given_name] ||
-                      @store.modules_hash[given_name]
-          return enclosing if enclosing
-          # not found: create the parent(s)
-          names = ename.split('::')
-          enclosing = self
-          names.each do |n|
-            enclosing = enclosing.classes_hash[n] ||
-                        enclosing.modules_hash[n] ||
-                        enclosing.add_module(RDoc::NormalModule, n)
-          end
-        end
-      else
-        name = full_name
-        enclosing = self
-      end
-    end
-
-    # fix up superclass
-    if full_name == 'BasicObject' then
-      superclass = nil
-    elsif full_name == 'Object' then
-      superclass = '::BasicObject'
-    end
-
-    # find the superclass full name
-    if superclass then
-      if superclass =~ /^:+/ then
-        superclass = $' #'
-      else
-        if superclass =~ /^(\w+):+(.+)$/ then
-          suffix = $2
-          mod = find_module_named($1)
-          superclass = mod.full_name + '::' + suffix if mod
-        else
-          mod = find_module_named(superclass)
-          superclass = mod.full_name if mod
-        end
-      end
-
-      # did we believe it was a module?
-      mod = @store.modules_hash.delete superclass
-
-      upgrade_to_class mod, RDoc::NormalClass, mod.parent if mod
-
-      # e.g., Object < Object
-      superclass = nil if superclass == full_name
-    end
-
-    klass = @store.classes_hash[full_name]
-
-    if klass then
-      # if TopLevel, it may not be registered in the classes:
-      enclosing.classes_hash[name] = klass
-
-      # update the superclass if needed
-      if superclass then
-        existing = klass.superclass
-        existing = existing.full_name unless existing.is_a?(String) if existing
-        if existing.nil? ||
-           (existing == 'Object' && superclass != 'Object') then
-          klass.superclass = superclass
-        end
-      end
-    else
-      # this is a new class
-      mod = @store.modules_hash.delete full_name
-
-      if mod then
-        klass = upgrade_to_class mod, RDoc::NormalClass, enclosing
-
-        klass.superclass = superclass unless superclass.nil?
-      else
-        klass = class_type.new name, superclass
-
-        enclosing.add_class_or_module(klass, enclosing.classes_hash,
-                                      @store.classes_hash)
-      end
-    end
-
-    klass.parent = self
-
-    klass
-  end
-
-  ##
-  # Adds the class or module +mod+ to the modules or
-  # classes Hash +self_hash+, and to +all_hash+ (either
-  # <tt>TopLevel::modules_hash</tt> or <tt>TopLevel::classes_hash</tt>),
-  # unless #done_documenting is +true+. Sets the #parent of +mod+
-  # to +self+, and its #section to #current_section. Returns +mod+.
-
-  def add_class_or_module mod, self_hash, all_hash
-    mod.section = current_section # TODO declaring context? something is
-                                  # wrong here...
-    mod.parent = self
-    mod.full_name = nil
-    mod.store = @store
-
-    unless @done_documenting then
-      self_hash[mod.name] = mod
-      # this must be done AFTER adding mod to its parent, so that the full
-      # name is correct:
-      all_hash[mod.full_name] = mod
-      if @store.unmatched_constant_alias[mod.full_name] then
-        to, file = @store.unmatched_constant_alias[mod.full_name]
-        add_module_alias mod, mod.name, to, file
-      end
-    end
-
-    mod
-  end
-
-  ##
-  # Adds +constant+ if not already there. If it is, updates the comment,
-  # value and/or is_alias_for of the known constant if they were empty/nil.
-
-  def add_constant constant
-    return constant unless @document_self
-
-    # HACK: avoid duplicate 'PI' & 'E' in math.c (1.8.7 source code)
-    # (this is a #ifdef: should be handled by the C parser)
-    known = @constants_hash[constant.name]
-
-    if known then
-      known.comment = constant.comment if known.comment.empty?
-
-      known.value = constant.value if
-        known.value.nil? or known.value.strip.empty?
-
-      known.is_alias_for ||= constant.is_alias_for
-    else
-      @constants_hash[constant.name] = constant
-      add_to @constants, constant
-    end
-
-    constant
-  end
-
-  ##
-  # Adds included module +include+ which should be an RDoc::Include
-
-  def add_include include
-    add_to @includes, include
-
-    include
-  end
-
-  ##
-  # Adds extension module +ext+ which should be an RDoc::Extend
-
-  def add_extend ext
-    add_to @extends, ext
-
-    ext
-  end
-
-  ##
-  # Adds +method+ if not already there. If it is (as method or attribute),
-  # updates the comment if it was empty.
-
-  def add_method method
-    return method unless @document_self
-
-    # HACK: avoid duplicate 'new' in io.c & struct.c (1.8.7 source code)
-    key = method.pretty_name
-    known = @methods_hash[key]
-
-    if known then
-      if @store then # otherwise we are loading
-        known.comment = method.comment if known.comment.empty?
-        previously = ", previously in #{known.file}" unless
-          method.file == known.file
-        @store.rdoc.options.warn \
-          "Duplicate method #{known.full_name} in #{method.file}#{previously}"
-      end
-    else
-      @methods_hash[key] = method
-      if @current_line_visibility
-        method.visibility, @current_line_visibility = @current_line_visibility, nil
-      else
-        method.visibility = @visibility
-      end
-      add_to @method_list, method
-      resolve_aliases method
-    end
-
-    method
-  end
-
-  ##
-  # Adds a module named +name+.  If RDoc already knows +name+ is a class then
-  # that class is returned instead.  See also #add_class.
-
-  def add_module(class_type, name)
-    mod = @classes[name] || @modules[name]
-    return mod if mod
-
-    full_name = child_name name
-    mod = @store.modules_hash[full_name] || class_type.new(name)
-
-    add_class_or_module mod, @modules, @store.modules_hash
-  end
-
-  ##
-  # Adds a module by +RDoc::NormalModule+ instance. See also #add_module.
-
-  def add_module_by_normal_module(mod)
-    add_class_or_module mod, @modules, @store.modules_hash
-  end
-
-  ##
-  # Adds an alias from +from+ (a class or module) to +name+ which was defined
-  # in +file+.
-
-  def add_module_alias from, from_name, to, file
-    return from if @done_documenting
-
-    to_full_name = child_name to.name
-
-    # if we already know this name, don't register an alias:
-    # see the metaprogramming in lib/active_support/basic_object.rb,
-    # where we already know BasicObject is a class when we find
-    # BasicObject = BlankSlate
-    return from if @store.find_class_or_module to_full_name
-
-    unless from
-      @store.unmatched_constant_alias[child_name(from_name)] = [to, file]
-      return to
-    end
-
-    new_to = from.dup
-    new_to.name = to.name
-    new_to.full_name = nil
-
-    if new_to.module? then
-      @store.modules_hash[to_full_name] = new_to
-      @modules[to.name] = new_to
-    else
-      @store.classes_hash[to_full_name] = new_to
-      @classes[to.name] = new_to
-    end
-
-    # Registers a constant for this alias.  The constant value and comment
-    # will be updated later, when the Ruby parser adds the constant
-    const = RDoc::Constant.new to.name, nil, new_to.comment
-    const.record_location file
-    const.is_alias_for = from
-    add_constant const
-
-    new_to
-  end
-
-  ##
-  # Adds +require+ to this context's top level
-
-  def add_require(require)
-    return require unless @document_self
-
-    if RDoc::TopLevel === self then
-      add_to @requires, require
-    else
-      parent.add_require require
-    end
-  end
-
-  ##
-  # Returns a section with +title+, creating it if it doesn't already exist.
-  # +comment+ will be appended to the section's comment.
-  #
-  # A section with a +title+ of +nil+ will return the default section.
-  #
-  # See also RDoc::Context::Section
-
-  def add_section title, comment = nil
-    if section = @sections[title] then
-      section.add_comment comment if comment
-    else
-      section = Section.new self, title, comment
-      @sections[title] = section
-    end
-
-    section
-  end
-
-  ##
-  # Adds +thing+ to the collection +array+
-
-  def add_to array, thing
-    array << thing if @document_self
-
-    thing.parent  = self
-    thing.store   = @store if @store
-    thing.section = current_section
-  end
-
-  ##
-  # Is there any content?
-  #
-  # This means any of: comment, aliases, methods, attributes, external
-  # aliases, require, constant.
-  #
-  # Includes and extends are also checked unless <tt>includes == false</tt>.
-
-  def any_content(includes = true)
-    @any_content ||= !(
-      @comment.empty? &&
-      @method_list.empty? &&
-      @attributes.empty? &&
-      @aliases.empty? &&
-      @external_aliases.empty? &&
-      @requires.empty? &&
-      @constants.empty?
-    )
-    @any_content || (includes && !(@includes + @extends).empty? )
-  end
-
-  ##
-  # Creates the full name for a child with +name+
-
-  def child_name name
-    if name =~ /^:+/
-      $'  #'
-    elsif RDoc::TopLevel === self then
-      name
-    else
-      "#{self.full_name}::#{name}"
-    end
-  end
-
-  ##
-  # Class attributes
-
-  def class_attributes
-    @class_attributes ||= attributes.select { |a| a.singleton }
-  end
-
-  ##
-  # Class methods
-
-  def class_method_list
-    @class_method_list ||= method_list.select { |a| a.singleton }
-  end
-
-  ##
-  # Array of classes in this context
-
-  def classes
-    @classes.values
-  end
-
-  ##
-  # All classes and modules in this namespace
-
-  def classes_and_modules
-    classes + modules
-  end
-
-  ##
-  # Hash of classes keyed by class name
-
-  def classes_hash
-    @classes
-  end
-
-  ##
-  # The current documentation section that new items will be added to.  If
-  # temporary_section is available it will be used.
-
-  def current_section
-    if section = @temporary_section then
-      @temporary_section = nil
-    else
-      section = @current_section
-    end
-
-    section
-  end
-
-  ##
-  # Is part of this thing was defined in +file+?
-
-  def defined_in?(file)
-    @in_files.include?(file)
-  end
-
-  def display(method_attr) # :nodoc:
-    if method_attr.is_a? RDoc::Attr
-      "#{method_attr.definition} #{method_attr.pretty_name}"
-    else
-      "method #{method_attr.pretty_name}"
-    end
-  end
-
-  ##
-  # Iterator for ancestors for duck-typing.  Does nothing.  See
-  # RDoc::ClassModule#each_ancestor.
-  #
-  # This method exists to make it easy to work with Context subclasses that
-  # aren't part of RDoc.
-
-  def each_ancestor(&_) # :nodoc:
-  end
-
-  ##
-  # Iterator for attributes
-
-  def each_attribute # :yields: attribute
-    @attributes.each { |a| yield a }
-  end
-
-  ##
-  # Iterator for classes and modules
-
-  def each_classmodule(&block) # :yields: module
-    classes_and_modules.sort.each(&block)
-  end
-
-  ##
-  # Iterator for constants
-
-  def each_constant # :yields: constant
-    @constants.each {|c| yield c}
-  end
-
-  ##
-  # Iterator for included modules
-
-  def each_include # :yields: include
-    @includes.each do |i| yield i end
-  end
-
-  ##
-  # Iterator for extension modules
-
-  def each_extend # :yields: extend
-    @extends.each do |e| yield e end
-  end
-
-  ##
-  # Iterator for methods
-
-  def each_method # :yields: method
-    return enum_for __method__ unless block_given?
-
-    @method_list.sort.each { |m| yield m }
-  end
-
-  ##
-  # Iterator for each section's contents sorted by title.  The +section+, the
-  # section's +constants+ and the sections +attributes+ are yielded.  The
-  # +constants+ and +attributes+ collections are sorted.
-  #
-  # To retrieve methods in a section use #methods_by_type with the optional
-  # +section+ parameter.
-  #
-  # NOTE: Do not edit collections yielded by this method
-
-  def each_section # :yields: section, constants, attributes
-    return enum_for __method__ unless block_given?
-
-    constants  = @constants.group_by  do |constant|  constant.section end
-    attributes = @attributes.group_by do |attribute| attribute.section end
-
-    constants.default  = []
-    attributes.default = []
-
-    sort_sections.each do |section|
-      yield section, constants[section].select(&:display?).sort, attributes[section].select(&:display?).sort
-    end
-  end
-
-  ##
-  # Finds an attribute +name+ with singleton value +singleton+.
-
-  def find_attribute(name, singleton)
-    name = $1 if name =~ /^(.*)=$/
-    @attributes.find { |a| a.name == name && a.singleton == singleton }
-  end
-
-  ##
-  # Finds an attribute with +name+ in this context
-
-  def find_attribute_named(name)
-    case name
-    when /\A#/ then
-      find_attribute name[1..-1], false
-    when /\A::/ then
-      find_attribute name[2..-1], true
-    else
-      @attributes.find { |a| a.name == name }
-    end
-  end
-
-  ##
-  # Finds a class method with +name+ in this context
-
-  def find_class_method_named(name)
-    @method_list.find { |meth| meth.singleton && meth.name == name }
-  end
-
-  ##
-  # Finds a constant with +name+ in this context
-
-  def find_constant_named(name)
-    @constants.find do |m|
-      m.name == name || m.full_name == name
-    end
-  end
-
-  ##
-  # Find a module at a higher scope
-
-  def find_enclosing_module_named(name)
-    parent && parent.find_module_named(name)
-  end
-
-  ##
-  # Finds an external alias +name+ with singleton value +singleton+.
-
-  def find_external_alias(name, singleton)
-    @external_aliases.find { |m| m.name == name && m.singleton == singleton }
-  end
-
-  ##
-  # Finds an external alias with +name+ in this context
-
-  def find_external_alias_named(name)
-    case name
-    when /\A#/ then
-      find_external_alias name[1..-1], false
-    when /\A::/ then
-      find_external_alias name[2..-1], true
-    else
-      @external_aliases.find { |a| a.name == name }
-    end
-  end
-
-  ##
-  # Finds a file with +name+ in this context
-
-  def find_file_named name
-    @store.find_file_named name
-  end
-
-  ##
-  # Finds an instance method with +name+ in this context
-
-  def find_instance_method_named(name)
-    @method_list.find { |meth| !meth.singleton && meth.name == name }
-  end
-
-  ##
-  # Finds a method, constant, attribute, external alias, module or file
-  # named +symbol+ in this context.
-
-  def find_local_symbol(symbol)
-    find_method_named(symbol) or
-    find_constant_named(symbol) or
-    find_attribute_named(symbol) or
-    find_external_alias_named(symbol) or
-    find_module_named(symbol) or
-    find_file_named(symbol)
-  end
-
-  ##
-  # Finds a method named +name+ with singleton value +singleton+.
-
-  def find_method(name, singleton)
-    @method_list.find { |m|
-      if m.singleton
-        m.name == name && m.singleton == singleton
-      else
-        m.name == name && !m.singleton && !singleton
-      end
-    }
-  end
-
-  ##
-  # Finds a instance or module method with +name+ in this context
-
-  def find_method_named(name)
-    case name
-    when /\A#/ then
-      find_method name[1..-1], false
-    when /\A::/ then
-      find_method name[2..-1], true
-    else
-      @method_list.find { |meth| meth.name == name }
-    end
-  end
-
-  ##
-  # Find a module with +name+ using ruby's scoping rules
-
-  def find_module_named(name)
-    res = @modules[name] || @classes[name]
-    return res if res
-    return self if self.name == name
-    find_enclosing_module_named name
-  end
-
-  ##
-  # Look up +symbol+, first as a module, then as a local symbol.
-
-  def find_symbol(symbol)
-    find_symbol_module(symbol) || find_local_symbol(symbol)
-  end
-
-  ##
-  # Look up a module named +symbol+.
-
-  def find_symbol_module(symbol)
-    result = nil
-
-    # look for a class or module 'symbol'
-    case symbol
-    when /^::/ then
-      result = @store.find_class_or_module symbol
-    when /^(\w+):+(.+)$/
-      suffix = $2
-      top = $1
-      searched = self
-      while searched do
-        mod = searched.find_module_named(top)
-        break unless mod
-        result = @store.find_class_or_module "#{mod.full_name}::#{suffix}"
-        break if result || searched.is_a?(RDoc::TopLevel)
-        searched = searched.parent
-      end
-    else
-      searched = self
-      while searched do
-        result = searched.find_module_named(symbol)
-        break if result || searched.is_a?(RDoc::TopLevel)
-        searched = searched.parent
-      end
-    end
-
-    result
-  end
-
-  ##
-  # The full name for this context.  This method is overridden by subclasses.
-
-  def full_name
-    '(unknown)'
-  end
-
-  ##
-  # Does this context and its methods and constants all have documentation?
-  #
-  # (Yes, fully documented doesn't mean everything.)
-
-  def fully_documented?
-    documented? and
-      attributes.all? { |a| a.documented? } and
-      method_list.all? { |m| m.documented? } and
-      constants.all? { |c| c.documented? }
-  end
-
-  ##
-  # URL for this with a +prefix+
-
-  def http_url(prefix)
-    path = name_for_path
-    path = path.gsub(/<<\s*(\w*)/, 'from-\1') if path =~ /<</
-    path = [prefix] + path.split('::')
-
-    File.join(*path.compact) + '.html'
-  end
-
-  ##
-  # Instance attributes
-
-  def instance_attributes
-    @instance_attributes ||= attributes.reject { |a| a.singleton }
-  end
-
-  ##
-  # Instance methods
-
-  def instance_methods
-    @instance_methods ||= method_list.reject { |a| a.singleton }
-  end
-
-  ##
-  # Instance methods
-  #--
-  # TODO remove this later
-
-  def instance_method_list
-    warn '#instance_method_list is obsoleted, please use #instance_methods'
-    @instance_methods ||= method_list.reject { |a| a.singleton }
-  end
-
-  ##
-  # Breaks method_list into a nested hash by type (<tt>'class'</tt> or
-  # <tt>'instance'</tt>) and visibility (+:public+, +:protected+, +:private+).
-  #
-  # If +section+ is provided only methods in that RDoc::Context::Section will
-  # be returned.
-
-  def methods_by_type section = nil
-    methods = {}
-
-    TYPES.each do |type|
-      visibilities = {}
-      RDoc::VISIBILITIES.each do |vis|
-        visibilities[vis] = []
-      end
-
-      methods[type] = visibilities
-    end
-
-    each_method do |method|
-      next if section and not method.section == section
-      methods[method.type][method.visibility] << method
-    end
-
-    methods
-  end
-
-  ##
-  # Yields AnyMethod and Attr entries matching the list of names in +methods+.
-
-  def methods_matching(methods, singleton = false, &block)
-    (@method_list + @attributes).each do |m|
-      yield m if methods.include?(m.name) and m.singleton == singleton
-    end
-
-    each_ancestor do |parent|
-      parent.methods_matching(methods, singleton, &block)
-    end
-  end
-
-  ##
-  # Array of modules in this context
-
-  def modules
-    @modules.values
-  end
-
-  ##
-  # Hash of modules keyed by module name
-
-  def modules_hash
-    @modules
-  end
-
-  ##
-  # Name to use to generate the url.
-  # <tt>#full_name</tt> by default.
-
-  def name_for_path
-    full_name
-  end
-
-  ##
-  # Changes the visibility for new methods to +visibility+
-
-  def ongoing_visibility=(visibility)
-    @visibility = visibility
-  end
-
-  ##
-  # Record +top_level+ as a file +self+ is in.
-
-  def record_location(top_level)
-    @in_files << top_level unless @in_files.include?(top_level)
-  end
-
-  ##
-  # Should we remove this context from the documentation?
-  #
-  # The answer is yes if:
-  # * #received_nodoc is +true+
-  # * #any_content is +false+ (not counting includes)
-  # * All #includes are modules (not a string), and their module has
-  #   <tt>#remove_from_documentation? == true</tt>
-  # * All classes and modules have <tt>#remove_from_documentation? == true</tt>
-
-  def remove_from_documentation?
-    @remove_from_documentation ||=
-      @received_nodoc &&
-      !any_content(false) &&
-      @includes.all? { |i| !i.module.is_a?(String) && i.module.remove_from_documentation? } &&
-      classes_and_modules.all? { |cm| cm.remove_from_documentation? }
-  end
-
-  ##
-  # Removes methods and attributes with a visibility less than +min_visibility+.
-  #--
-  # TODO mark the visibility of attributes in the template (if not public?)
-
-  def remove_invisible min_visibility
-    return if [:private, :nodoc].include? min_visibility
-    remove_invisible_in @method_list, min_visibility
-    remove_invisible_in @attributes, min_visibility
-    remove_invisible_in @constants, min_visibility
-  end
-
-  ##
-  # Only called when min_visibility == :public or :private
-
-  def remove_invisible_in array, min_visibility # :nodoc:
-    if min_visibility == :public then
-      array.reject! { |e|
-        e.visibility != :public and not e.force_documentation
-      }
-    else
-      array.reject! { |e|
-        e.visibility == :private and not e.force_documentation
-      }
-    end
-  end
-
-  ##
-  # Tries to resolve unmatched aliases when a method or attribute has just
-  # been added.
-
-  def resolve_aliases added
-    # resolve any pending unmatched aliases
-    key = added.pretty_name
-    unmatched_alias_list = @unmatched_alias_lists[key]
-    return unless unmatched_alias_list
-    unmatched_alias_list.each do |unmatched_alias|
-      added.add_alias unmatched_alias, self
-      @external_aliases.delete unmatched_alias
-    end
-    @unmatched_alias_lists.delete key
-  end
-
-  ##
-  # Returns RDoc::Context::Section objects referenced in this context for use
-  # in a table of contents.
-
-  def section_contents
-    used_sections = {}
-
-    each_method do |method|
-      next unless method.display?
-
-      used_sections[method.section] = true
-    end
-
-    # order found sections
-    sections = sort_sections.select do |section|
-      used_sections[section]
-    end
-
-    # only the default section is used
-    return [] if
-      sections.length == 1 and not sections.first.title
-
-    sections
-  end
-
-  ##
-  # Sections in this context
-
-  def sections
-    @sections.values
-  end
-
-  def sections_hash # :nodoc:
-    @sections
-  end
-
-  ##
-  # Sets the current section to a section with +title+.  See also #add_section
-
-  def set_current_section title, comment
-    @current_section = add_section title, comment
-  end
-
-  ##
-  # Given an array +methods+ of method names, set the visibility of each to
-  # +visibility+
-
-  def set_visibility_for(methods, visibility, singleton = false)
-    methods_matching methods, singleton do |m|
-      m.visibility = visibility
-    end
-  end
-
-  ##
-  # Given an array +names+ of constants, set the visibility of each constant to
-  # +visibility+
-
-  def set_constant_visibility_for(names, visibility)
-    names.each do |name|
-      constant = @constants_hash[name] or next
-      constant.visibility = visibility
-    end
-  end
-
-  ##
-  # Sorts sections alphabetically (default) or in TomDoc fashion (none,
-  # Public, Internal, Deprecated)
-
-  def sort_sections
-    titles = @sections.map { |title, _| title }
-
-    if titles.length > 1 and
-       TOMDOC_TITLES_SORT ==
-         (titles | TOMDOC_TITLES).sort_by { |title| title.to_s } then
-      @sections.values_at(*TOMDOC_TITLES).compact
-    else
-      @sections.sort_by { |title, _|
-        title.to_s
-      }.map { |_, section|
-        section
-      }
-    end
-  end
-
-  def to_s # :nodoc:
-    "#{self.class.name} #{self.full_name}"
-  end
-
-  ##
-  # Return the TopLevel that owns us
-  #--
-  # FIXME we can be 'owned' by several TopLevel (see #record_location &
-  # #in_files)
-
-  def top_level
-    return @top_level if defined? @top_level
-    @top_level = self
-    @top_level = @top_level.parent until RDoc::TopLevel === @top_level
-    @top_level
-  end
-
-  ##
-  # Upgrades NormalModule +mod+ in +enclosing+ to a +class_type+
-
-  def upgrade_to_class mod, class_type, enclosing
-    enclosing.modules_hash.delete mod.name
-
-    klass = RDoc::ClassModule.from_module class_type, mod
-    klass.store = @store
-
-    # if it was there, then we keep it even if done_documenting
-    @store.classes_hash[mod.full_name] = klass
-    enclosing.classes_hash[mod.name]   = klass
-
-    klass
-  end
-
-  autoload :Section, "#{__dir__}/context/section"
-
-end
diff --git a/lib/rdoc/context/section.rb b/lib/rdoc/context/section.rb
deleted file mode 100644
index aecd4e0213..0000000000
--- a/lib/rdoc/context/section.rb
+++ /dev/null
@@ -1,233 +0,0 @@
-# frozen_string_literal: true
-require 'cgi/util'
-
-##
-# A section of documentation like:
-#
-#   # :section: The title
-#   # The body
-#
-# Sections can be referenced multiple times and will be collapsed into a
-# single section.
-
-class RDoc::Context::Section
-
-  include RDoc::Text
-
-  MARSHAL_VERSION = 0 # :nodoc:
-
-  ##
-  # Section comment
-
-  attr_reader :comment
-
-  ##
-  # Section comments
-
-  attr_reader :comments
-
-  ##
-  # Context this Section lives in
-
-  attr_reader :parent
-
-  ##
-  # Section title
-
-  attr_reader :title
-
-  ##
-  # Creates a new section with +title+ and +comment+
-
-  def initialize parent, title, comment
-    @parent = parent
-    @title = title ? title.strip : title
-
-    @comments = []
-
-    add_comment comment
-  end
-
-  ##
-  # Sections are equal when they have the same #title
-
-  def == other
-    self.class === other and @title == other.title
-  end
-
-  alias eql? ==
-
-  ##
-  # Adds +comment+ to this section
-
-  def add_comment comment
-    comment = extract_comment comment
-
-    return if comment.empty?
-
-    case comment
-    when RDoc::Comment then
-      @comments << comment
-    when RDoc::Markup::Document then
-      @comments.concat comment.parts
-    when Array then
-      @comments.concat comment
-    else
-      raise TypeError, "unknown comment type: #{comment.inspect}"
-    end
-  end
-
-  ##
-  # Anchor reference for linking to this section
-
-  def aref
-    title = @title || '[untitled]'
-
-    CGI.escape(title).gsub('%', '-').sub(/^-/, '')
-  end
-
-  ##
-  # Extracts the comment for this section from the original comment block.
-  # If the first line contains :section:, strip it and use the rest.
-  # Otherwise remove lines up to the line containing :section:, and look
-  # for those lines again at the end and remove them. This lets us write
-  #
-  #   # :section: The title
-  #   # The body
-
-  def extract_comment comment
-    case comment
-    when Array then
-      comment.map do |c|
-        extract_comment c
-      end
-    when nil
-      RDoc::Comment.new ''
-    when RDoc::Comment then
-      if comment.text =~ /^#[ \t]*:section:.*\n/ then
-        start = $`
-        rest = $'
-
-        comment.text = if start.empty? then
-                         rest
-                       else
-                         rest.sub(/#{start.chomp}\Z/, '')
-                       end
-      end
-
-      comment
-    when RDoc::Markup::Document then
-      comment
-    else
-      raise TypeError, "unknown comment #{comment.inspect}"
-    end
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x %p>" % [self.class, object_id, title]
-  end
-
-  def hash # :nodoc:
-    @title.hash
-  end
-
-  ##
-  # The files comments in this section come from
-
-  def in_files
-    return [] if @comments.empty?
-
-    case @comments
-    when Array then
-      @comments.map do |comment|
-        comment.file
-      end
-    when RDoc::Markup::Document then
-      @comment.parts.map do |document|
-        document.file
-      end
-    else
-      raise RDoc::Error, "BUG: unknown comment class #{@comments.class}"
-    end
-  end
-
-  ##
-  # Serializes this Section.  The title and parsed comment are saved, but not
-  # the section parent which must be restored manually.
-
-  def marshal_dump
-    [
-      MARSHAL_VERSION,
-      @title,
-      parse,
-    ]
-  end
-
-  ##
-  # De-serializes this Section.  The section parent must be restored manually.
-
-  def marshal_load array
-    @parent  = nil
-
-    @title    = array[1]
-    @comments = array[2]
-  end
-
-  ##
-  # Parses +comment_location+ into an RDoc::Markup::Document composed of
-  # multiple RDoc::Markup::Documents with their file set.
-
-  def parse
-    case @comments
-    when String then
-      super
-    when Array then
-      docs = @comments.map do |comment, location|
-        doc = super comment
-        doc.file = location if location
-        doc
-      end
-
-      RDoc::Markup::Document.new(*docs)
-    when RDoc::Comment then
-      doc = super @comments.text, comments.format
-      doc.file = @comments.location
-      doc
-    when RDoc::Markup::Document then
-      return @comments
-    else
-      raise ArgumentError, "unknown comment class #{comments.class}"
-    end
-  end
-
-  ##
-  # The section's title, or 'Top Section' if the title is nil.
-  #
-  # This is used by the table of contents template so the name is silly.
-
-  def plain_html
-    @title || 'Top Section'
-  end
-
-  ##
-  # Removes a comment from this section if it is from the same file as
-  # +comment+
-
-  def remove_comment comment
-    return if @comments.empty?
-
-    case @comments
-    when Array then
-      @comments.delete_if do |my_comment|
-        my_comment.file == comment.file
-      end
-    when RDoc::Markup::Document then
-      @comments.parts.delete_if do |document|
-        document.file == comment.file.name
-      end
-    else
-      raise RDoc::Error, "BUG: unknown comment class #{@comments.class}"
-    end
-  end
-
-end
diff --git a/lib/rdoc/cross_reference.rb b/lib/rdoc/cross_reference.rb
deleted file mode 100644
index 4e011219e8..0000000000
--- a/lib/rdoc/cross_reference.rb
+++ /dev/null
@@ -1,228 +0,0 @@
-# frozen_string_literal: true
-
-require_relative 'markup/attribute_manager' # for PROTECT_ATTR
-
-##
-# RDoc::CrossReference is a reusable way to create cross references for names.
-
-class RDoc::CrossReference
-
-  ##
-  # Regular expression to match class references
-  #
-  # 1. There can be a '\\' in front of text to suppress the cross-reference
-  # 2. There can be a '::' in front of class names to reference from the
-  #    top-level namespace.
-  # 3. The method can be followed by parenthesis (not recommended)
-
-  CLASS_REGEXP_STR = '\\\\?((?:\:{2})?[A-Z]\w*(?:\:\:\w+)*)'
-
-  ##
-  # Regular expression to match a single method argument.
-
-  METHOD_ARG_REGEXP_STR = '[\w.+*/=<>-]+'
-
-  ##
-  # Regular expression to match method arguments.
-
-  METHOD_ARGS_REGEXP_STR = /(?:\((?:#{METHOD_ARG_REGEXP_STR}(?:,\s*#{METHOD_ARG_REGEXP_STR})*)?\))?/.source
-
-  ##
-  # Regular expression to match method references.
-  #
-  # See CLASS_REGEXP_STR
-
-  METHOD_REGEXP_STR = /(
-    (?!\d)[\w#{RDoc::Markup::AttributeManager::PROTECT_ATTR}]+[!?=]?|
-    %|=(?:==?|~)|![=~]|\[\]=?|<(?:<|=>?)?|>[>=]?|[-+!]@?|\*\*?|[\/%\`|&^~]
-  )#{METHOD_ARGS_REGEXP_STR}/.source.delete("\n ").freeze
-
-  ##
-  # Regular expressions matching text that should potentially have
-  # cross-reference links generated are passed to add_regexp_handling. Note
-  # that these expressions are meant to pick up text for which cross-references
-  # have been suppressed, since the suppression characters are removed by the
-  # code that is triggered.
-
-  CROSSREF_REGEXP = /(?:^|[\s()])
-                     (
-                      (?:
-                       # A::B::C.meth
-                       #{CLASS_REGEXP_STR}(?:[.#]|::)#{METHOD_REGEXP_STR}
-
-                       # A::B::C
-                       # The stuff after CLASS_REGEXP_STR is a
-                       # nasty hack.  CLASS_REGEXP_STR unfortunately matches
-                       # words like dog and cat (these are legal "class"
-                       # names in Fortran 95).  When a word is flagged as a
-                       # potential cross-reference, limitations in the markup
-                       # engine suppress other processing, such as typesetting.
-                       # This is particularly noticeable for contractions.
-                       # In order that words like "can't" not
-                       # be flagged as potential cross-references, only
-                       # flag potential class cross-references if the character
-                       # after the cross-reference is a space, sentence
-                       # punctuation, tag start character, or attribute
-                       # marker.
-                       | #{CLASS_REGEXP_STR}(?=[@\s).?!,;<\000]|\z)
-
-                       # Stand-alone method (preceded by a #)
-                       | \\?\##{METHOD_REGEXP_STR}
-
-                       # Stand-alone method (preceded by ::)
-                       | ::#{METHOD_REGEXP_STR}
-
-                       # Things that look like filenames
-                       # The key thing is that there must be at least
-                       # one special character (period, slash, or
-                       # underscore).
-                       | (?:\.\.\/)*[-\/\w]+[_\/.][-\w\/.]+
-
-                       # Things that have markup suppressed
-                       # Don't process things like '\<' in \<tt>, though.
-                       # TODO: including < is a hack, not very satisfying.
-                       | \\[^\s<]
-                      )
-
-                      # labels for headings
-                      (?:@[\w+%-]+(?:\.[\w|%-]+)?)?
-                     )/x
-
-  ##
-  # Version of CROSSREF_REGEXP used when <tt>--hyperlink-all</tt> is specified.
-
-  ALL_CROSSREF_REGEXP = /
-                     (?:^|[\s()])
-                     (
-                      (?:
-                       # A::B::C.meth
-                       #{CLASS_REGEXP_STR}(?:[.#]|::)#{METHOD_REGEXP_STR}
-
-                       # A::B::C
-                       | #{CLASS_REGEXP_STR}(?=[@\s).?!,;<\000]|\z)
-
-                       # Stand-alone method
-                       | \\?#{METHOD_REGEXP_STR}
-
-                       # Things that look like filenames
-                       | (?:\.\.\/)*[-\/\w]+[_\/.][-\w\/.]+
-
-                       # Things that have markup suppressed
-                       | \\[^\s<]
-                      )
-
-                      # labels for headings
-                      (?:@[\w+%-]+)?
-                     )/x
-
-  ##
-  # Hash of references that have been looked-up to their replacements
-
-  attr_accessor :seen
-
-  ##
-  # Allows cross-references to be created based on the given +context+
-  # (RDoc::Context).
-
-  def initialize context
-    @context = context
-    @store   = context.store
-
-    @seen = {}
-  end
-
-  ##
-  # Returns a method reference to +name+.
-
-  def resolve_method name
-    ref = nil
-
-    if /#{CLASS_REGEXP_STR}([.#]|::)#{METHOD_REGEXP_STR}/o =~ name then
-      type = $2
-      if '.' == type # will find either #method or ::method
-        method = $3
-      else
-        method = "#{type}#{$3}"
-      end
-      container = @context.find_symbol_module($1)
-    elsif /^([.#]|::)#{METHOD_REGEXP_STR}/o =~ name then
-      type = $1
-      if '.' == type
-        method = $2
-      else
-        method = "#{type}#{$2}"
-      end
-      container = @context
-    else
-      type = nil
-      container = nil
-    end
-
-    if container then
-      unless RDoc::TopLevel === container then
-        if '.' == type then
-          if 'new' == method then # AnyClassName.new will be class method
-            ref = container.find_local_symbol method
-            ref = container.find_ancestor_local_symbol method unless ref
-          else
-            ref = container.find_local_symbol "::#{method}"
-            ref = container.find_ancestor_local_symbol "::#{method}" unless ref
-            ref = container.find_local_symbol "##{method}" unless ref
-            ref = container.find_ancestor_local_symbol "##{method}" unless ref
-          end
-        else
-          ref = container.find_local_symbol method
-          ref = container.find_ancestor_local_symbol method unless ref
-        end
-      end
-    end
-
-    ref
-  end
-
-  ##
-  # Returns a reference to +name+.
-  #
-  # If the reference is found and +name+ is not documented +text+ will be
-  # returned.  If +name+ is escaped +name+ is returned.  If +name+ is not
-  # found +text+ is returned.
-
-  def resolve name, text
-    return @seen[name] if @seen.include? name
-
-    ref = case name
-          when /^\\(#{CLASS_REGEXP_STR})$/o then
-            @context.find_symbol $1
-          else
-            @context.find_symbol name
-          end
-
-    ref = resolve_method name unless ref
-
-    # Try a page name
-    ref = @store.page name if not ref and name =~ /^[\w.]+$/
-
-    ref = nil if RDoc::Alias === ref # external alias, can't link to it
-
-    out = if name == '\\' then
-            name
-          elsif name =~ /^\\/ then
-            # we remove the \ only in front of what we know:
-            # other backslashes are treated later, only outside of <tt>
-            ref ? $' : name
-          elsif ref then
-            if ref.display? then
-              ref
-            else
-              text
-            end
-          else
-            text
-          end
-
-    @seen[name] = out
-
-    out
-  end
-
-end
diff --git a/lib/rdoc/encoding.rb b/lib/rdoc/encoding.rb
deleted file mode 100644
index 67e190f782..0000000000
--- a/lib/rdoc/encoding.rb
+++ /dev/null
@@ -1,120 +0,0 @@
-# coding: US-ASCII
-# frozen_string_literal: true
-
-##
-# This class is a wrapper around File IO and Encoding that helps RDoc load
-# files and convert them to the correct encoding.
-
-module RDoc::Encoding
-
-  HEADER_REGEXP = /^
-    (?:
-      \A\#!.*\n
-      |
-      ^\#\s+frozen[-_]string[-_]literal[=:].+\n
-      |
-      ^\#[^\n]+\b(?:en)?coding[=:]\s*(?<name>[^\s;]+).*\n
-      |
-      <\?xml[^?]*encoding=(?<quote>["'])(?<name>.*?)\k<quote>.*\n
-    )+
-  /xi # :nodoc:
-
-  ##
-  # Reads the contents of +filename+ and handles any encoding directives in
-  # the file.
-  #
-  # The content will be converted to the +encoding+.  If the file cannot be
-  # converted a warning will be printed and nil will be returned.
-  #
-  # If +force_transcode+ is true the document will be transcoded and any
-  # unknown character in the target encoding will be replaced with '?'
-
-  def self.read_file filename, encoding, force_transcode = false
-    content = File.open filename, "rb" do |f| f.read end
-    content.gsub!("\r\n", "\n") if RUBY_PLATFORM =~ /mswin|mingw/
-
-    utf8 = content.sub!(/\A\xef\xbb\xbf/, '')
-
-    enc = RDoc::Encoding.detect_encoding content
-    content = RDoc::Encoding.change_encoding content, enc if enc
-
-    begin
-      encoding ||= Encoding.default_external
-      orig_encoding = content.encoding
-
-      if not orig_encoding.ascii_compatible? then
-        content = content.encode encoding
-      elsif utf8 then
-        content = RDoc::Encoding.change_encoding content, Encoding::UTF_8
-        content = content.encode encoding
-      else
-        # assume the content is in our output encoding
-        content = RDoc::Encoding.change_encoding content, encoding
-      end
-
-      unless content.valid_encoding? then
-        # revert and try to transcode
-        content = RDoc::Encoding.change_encoding content, orig_encoding
-        content = content.encode encoding
-      end
-
-      unless content.valid_encoding? then
-        warn "unable to convert #{filename} to #{encoding}, skipping"
-        content = nil
-      end
-    rescue Encoding::InvalidByteSequenceError,
-           Encoding::UndefinedConversionError => e
-      if force_transcode then
-        content = RDoc::Encoding.change_encoding content, orig_encoding
-        content = content.encode(encoding,
-                                 :invalid => :replace,
-                                 :undef => :replace,
-                                 :replace => '?')
-        return content
-      else
-        warn "unable to convert #{e.message} for #{filename}, skipping"
-        return nil
-      end
-    end
-
-    content
-  rescue ArgumentError => e
-    raise unless e.message =~ /unknown encoding name - (.*)/
-    warn "unknown encoding name \"#{$1}\" for #{filename}, skipping"
-    nil
-  rescue Errno::EISDIR, Errno::ENOENT
-    nil
-  end
-
-  ##
-  # Detects the encoding of +string+ based on the magic comment
-
-  def self.detect_encoding string
-    result = HEADER_REGEXP.match string
-    name = result && result[:name]
-
-    name ? Encoding.find(name) : nil
-  end
-
-  ##
-  # Removes magic comments and shebang
-
-  def self.remove_magic_comment string
-    string.sub HEADER_REGEXP do |s|
-      s.gsub(/[^\n]/, '')
-    end
-  end
-
-  ##
-  # Changes encoding based on +encoding+ without converting and returns new
-  # string
-
-  def self.change_encoding text, encoding
-    if text.kind_of? RDoc::Comment
-      text.encode! encoding
-    else
-      String.new text, encoding: encoding
-    end
-  end
-
-end
diff --git a/lib/rdoc/erb_partial.rb b/lib/rdoc/erb_partial.rb
deleted file mode 100644
index 043d763db1..0000000000
--- a/lib/rdoc/erb_partial.rb
+++ /dev/null
@@ -1,18 +0,0 @@
-# frozen_string_literal: true
-##
-# Allows an ERB template to be rendered in the context (binding) of an
-# existing ERB template evaluation.
-
-class RDoc::ERBPartial < ERB
-
-  ##
-  # Overrides +compiler+ startup to set the +eoutvar+ to an empty string only
-  # if it isn't already set.
-
-  def set_eoutvar compiler, eoutvar = '_erbout'
-    super
-
-    compiler.pre_cmd = ["#{eoutvar} ||= +''"]
-  end
-
-end
diff --git a/lib/rdoc/erbio.rb b/lib/rdoc/erbio.rb
deleted file mode 100644
index 0f98eaedee..0000000000
--- a/lib/rdoc/erbio.rb
+++ /dev/null
@@ -1,37 +0,0 @@
-# frozen_string_literal: true
-require 'erb'
-
-##
-# A subclass of ERB that writes directly to an IO.  Credit to Aaron Patterson
-# and Masatoshi SEKI.
-#
-# To use:
-#
-#   erbio = RDoc::ERBIO.new '<%= "hello world" %>', nil, nil
-#
-#   File.open 'hello.txt', 'w' do |io|
-#     erbio.result binding
-#   end
-#
-# Note that binding must enclose the io you wish to output on.
-
-class RDoc::ERBIO < ERB
-
-  ##
-  # Defaults +eoutvar+ to 'io', otherwise is identical to ERB's initialize
-
-  def initialize str, trim_mode: nil, eoutvar: 'io'
-    super(str, trim_mode: trim_mode, eoutvar: eoutvar)
-  end
-
-  ##
-  # Instructs +compiler+ how to write to +io_variable+
-
-  def set_eoutvar compiler, io_variable
-    compiler.put_cmd    = "#{io_variable}.write"
-    compiler.insert_cmd = "#{io_variable}.write"
-    compiler.pre_cmd    = []
-    compiler.post_cmd   = []
-  end
-
-end
diff --git a/lib/rdoc/extend.rb b/lib/rdoc/extend.rb
deleted file mode 100644
index 7d57433de6..0000000000
--- a/lib/rdoc/extend.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-# frozen_string_literal: true
-##
-# A Module extension to a class with \#extend
-#
-#   RDoc::Extend.new 'Enumerable', 'comment ...'
-
-class RDoc::Extend < RDoc::Mixin
-
-end
diff --git a/lib/rdoc/generator.rb b/lib/rdoc/generator.rb
deleted file mode 100644
index a769cf8ac0..0000000000
--- a/lib/rdoc/generator.rb
+++ /dev/null
@@ -1,51 +0,0 @@
-# frozen_string_literal: true
-##
-# RDoc uses generators to turn parsed source code in the form of an
-# RDoc::CodeObject tree into some form of output.  RDoc comes with the HTML
-# generator RDoc::Generator::Darkfish and an ri data generator
-# RDoc::Generator::RI.
-#
-# == Registering a Generator
-#
-# Generators are registered by calling RDoc::RDoc.add_generator with the class
-# of the generator:
-#
-#   class My::Awesome::Generator
-#     RDoc::RDoc.add_generator self
-#   end
-#
-# == Adding Options to +rdoc+
-#
-# Before option processing in +rdoc+, RDoc::Options will call ::setup_options
-# on the generator class with an RDoc::Options instance.  The generator can
-# use RDoc::Options#option_parser to add command-line options to the +rdoc+
-# tool.  See RDoc::Options@Custom+Options for an example and see OptionParser
-# for details on how to add options.
-#
-# You can extend the RDoc::Options instance with additional accessors for your
-# generator.
-#
-# == Generator Instantiation
-#
-# After parsing, RDoc::RDoc will instantiate a generator by calling
-# #initialize with an RDoc::Store instance and an RDoc::Options instance.
-#
-# The RDoc::Store instance holds documentation for parsed source code.  In
-# RDoc 3 and earlier the RDoc::TopLevel class held this data.  When upgrading
-# a generator from RDoc 3 and earlier you should only need to replace
-# RDoc::TopLevel with the store instance.
-#
-# RDoc will then call #generate on the generator instance.  You can use the
-# various methods on RDoc::Store and in the RDoc::CodeObject tree to create
-# your desired output format.
-
-module RDoc::Generator
-
-  autoload :Markup,   "#{__dir__}/generator/markup"
-
-  autoload :Darkfish,  "#{__dir__}/generator/darkfish"
-  autoload :JsonIndex, "#{__dir__}/generator/json_index"
-  autoload :RI,        "#{__dir__}/generator/ri"
-  autoload :POT,       "#{__dir__}/generator/pot"
-
-end
diff --git a/lib/rdoc/generator/darkfish.rb b/lib/rdoc/generator/darkfish.rb
deleted file mode 100644
index 1b408a6f8e..0000000000
--- a/lib/rdoc/generator/darkfish.rb
+++ /dev/null
@@ -1,786 +0,0 @@
-# frozen_string_literal: true
-# -*- mode: ruby; ruby-indent-level: 2; tab-width: 2 -*-
-
-require 'erb'
-require 'fileutils'
-require 'pathname'
-require_relative 'markup'
-
-##
-# Darkfish RDoc HTML Generator
-#
-# $Id: darkfish.rb 52 2009-01-07 02:08:11Z deveiant $
-#
-# == Author/s
-# * Michael Granger (ged@FaerieMUD.org)
-#
-# == Contributors
-# * Mahlon E. Smith (mahlon@martini.nu)
-# * Eric Hodel (drbrain@segment7.net)
-#
-# == License
-#
-# Copyright (c) 2007, 2008, Michael Granger. All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions are met:
-#
-# * Redistributions of source code must retain the above copyright notice,
-#   this list of conditions and the following disclaimer.
-#
-# * 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.
-#
-# * Neither the name of the author/s, nor the names of the project's
-#   contributors may 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 LIMITED TO, THE
-# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 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.
-#
-# == Attributions
-#
-# Darkfish uses the {Silk Icons}[http://www.famfamfam.com/lab/icons/silk/] set
-# by Mark James.
-
-class RDoc::Generator::Darkfish
-
-  RDoc::RDoc.add_generator self
-
-  include ERB::Util
-
-  ##
-  # Stylesheets, fonts, etc. that are included in RDoc.
-
-  BUILTIN_STYLE_ITEMS = # :nodoc:
-    %w[
-      css/fonts.css
-      fonts/Lato-Light.ttf
-      fonts/Lato-LightItalic.ttf
-      fonts/Lato-Regular.ttf
-      fonts/Lato-RegularItalic.ttf
-      fonts/SourceCodePro-Bold.ttf
-      fonts/SourceCodePro-Regular.ttf
-      css/rdoc.css
-  ]
-
-  ##
-  # Path to this file's parent directory. Used to find templates and other
-  # resources.
-
-  GENERATOR_DIR = File.join 'rdoc', 'generator'
-
-  ##
-  # Release Version
-
-  VERSION = '3'
-
-  ##
-  # Description of this generator
-
-  DESCRIPTION = 'HTML generator, written by Michael Granger'
-
-  ##
-  # The relative path to style sheets and javascript.  By default this is set
-  # the same as the rel_prefix.
-
-  attr_accessor :asset_rel_path
-
-  ##
-  # The path to generate files into, combined with <tt>--op</tt> from the
-  # options for a full path.
-
-  attr_reader :base_dir
-
-  ##
-  # Classes and modules to be used by this generator, not necessarily
-  # displayed.  See also #modsort
-
-  attr_reader :classes
-
-  ##
-  # No files will be written when dry_run is true.
-
-  attr_accessor :dry_run
-
-  ##
-  # When false the generate methods return a String instead of writing to a
-  # file.  The default is true.
-
-  attr_accessor :file_output
-
-  ##
-  # Files to be displayed by this generator
-
-  attr_reader :files
-
-  ##
-  # The JSON index generator for this Darkfish generator
-
-  attr_reader :json_index
-
-  ##
-  # Methods to be displayed by this generator
-
-  attr_reader :methods
-
-  ##
-  # Sorted list of classes and modules to be displayed by this generator
-
-  attr_reader :modsort
-
-  ##
-  # The RDoc::Store that is the source of the generated content
-
-  attr_reader :store
-
-  ##
-  # The directory where the template files live
-
-  attr_reader :template_dir # :nodoc:
-
-  ##
-  # The output directory
-
-  attr_reader :outputdir
-
-  ##
-  # Initialize a few instance variables before we start
-
-  def initialize store, options
-    @store   = store
-    @options = options
-
-    @asset_rel_path = ''
-    @base_dir       = Pathname.pwd.expand_path
-    @dry_run        = @options.dry_run
-    @file_output    = true
-    @template_dir   = Pathname.new options.template_dir
-    @template_cache = {}
-
-    @classes = nil
-    @context = nil
-    @files   = nil
-    @methods = nil
-    @modsort = nil
-
-    @json_index = RDoc::Generator::JsonIndex.new self, options
-  end
-
-  ##
-  # Output progress information if debugging is enabled
-
-  def debug_msg *msg
-    return unless $DEBUG_RDOC
-    $stderr.puts(*msg)
-  end
-
-  ##
-  # Directory where generated class HTML files live relative to the output
-  # dir.
-
-  def class_dir
-    nil
-  end
-
-  ##
-  # Directory where generated class HTML files live relative to the output
-  # dir.
-
-  def file_dir
-    nil
-  end
-
-  ##
-  # Create the directories the generated docs will live in if they don't
-  # already exist.
-
-  def gen_sub_directories
-    @outputdir.mkpath
-  end
-
-  ##
-  # Copy over the stylesheet into the appropriate place in the output
-  # directory.
-
-  def write_style_sheet
-    debug_msg "Copying static files"
-    options = { :verbose => $DEBUG_RDOC, :noop => @dry_run }
-
-    BUILTIN_STYLE_ITEMS.each do |item|
-      install_rdoc_static_file @template_dir + item, "./#{item}", options
-    end
-
-    unless @options.template_stylesheets.empty?
-      FileUtils.cp @options.template_stylesheets, '.', **options
-    end
-
-    Dir[(@template_dir + "{js,images}/**/*").to_s].each do |path|
-      next if File.directory? path
-      next if File.basename(path) =~ /^\./
-
-      dst = Pathname.new(path).relative_path_from @template_dir
-
-      install_rdoc_static_file @template_dir + path, dst, options
-    end
-  end
-
-  ##
-  # Build the initial indices and output objects based on an array of TopLevel
-  # objects containing the extracted information.
-
-  def generate
-    setup
-
-    write_style_sheet
-    generate_index
-    generate_class_files
-    generate_file_files
-    generate_table_of_contents
-    @json_index.generate
-    @json_index.generate_gzipped
-
-    copy_static
-
-  rescue => e
-    debug_msg "%s: %s\n  %s" % [
-      e.class.name, e.message, e.backtrace.join("\n  ")
-    ]
-
-    raise
-  end
-
-  ##
-  # Copies static files from the static_path into the output directory
-
-  def copy_static
-    return if @options.static_path.empty?
-
-    fu_options = { :verbose => $DEBUG_RDOC, :noop => @dry_run }
-
-    @options.static_path.each do |path|
-      unless File.directory? path then
-        FileUtils.install path, @outputdir, **fu_options.merge(:mode => 0644)
-        next
-      end
-
-      Dir.chdir path do
-        Dir[File.join('**', '*')].each do |entry|
-          dest_file = @outputdir + entry
-
-          if File.directory? entry then
-            FileUtils.mkdir_p entry, **fu_options
-          else
-            FileUtils.install entry, dest_file, **fu_options.merge(:mode => 0644)
-          end
-        end
-      end
-    end
-  end
-
-  ##
-  # Return a list of the documented modules sorted by salience first, then
-  # by name.
-
-  def get_sorted_module_list classes
-    classes.select do |klass|
-      klass.display?
-    end.sort
-  end
-
-  ##
-  # Generate an index page which lists all the classes which are documented.
-
-  def generate_index
-    setup
-
-    template_file = @template_dir + 'index.rhtml'
-    return unless template_file.exist?
-
-    debug_msg "Rendering the index page..."
-
-    out_file = @base_dir + @options.op_dir + 'index.html'
-    rel_prefix = @outputdir.relative_path_from out_file.dirname
-    search_index_rel_prefix = rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    asset_rel_prefix = rel_prefix + @asset_rel_path
-
-    @title = @options.title
-
-    render_template template_file, out_file do |io|
-      here = binding
-      # suppress 1.9.3 warning
-      here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-      here
-    end
-  rescue => e
-    error = RDoc::Error.new \
-      "error generating index.html: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  ##
-  # Generates a class file for +klass+
-
-  def generate_class klass, template_file = nil
-    setup
-
-    current = klass
-
-    template_file ||= @template_dir + 'class.rhtml'
-
-    debug_msg "  working on %s (%s)" % [klass.full_name, klass.path]
-    out_file   = @outputdir + klass.path
-    rel_prefix = @outputdir.relative_path_from out_file.dirname
-    search_index_rel_prefix = rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    asset_rel_prefix = rel_prefix + @asset_rel_path
-    svninfo          = get_svninfo(current)
-
-    @title = "#{klass.type} #{klass.full_name} - #{@options.title}"
-
-    debug_msg "  rendering #{out_file}"
-    render_template template_file, out_file do |io|
-      here = binding
-      # suppress 1.9.3 warning
-      here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-      here.local_variable_set(:svninfo, svninfo)
-      here
-    end
-  end
-
-  ##
-  # Generate a documentation file for each class and module
-
-  def generate_class_files
-    setup
-
-    template_file = @template_dir + 'class.rhtml'
-    template_file = @template_dir + 'classpage.rhtml' unless
-      template_file.exist?
-    return unless template_file.exist?
-    debug_msg "Generating class documentation in #{@outputdir}"
-
-    current = nil
-
-    @classes.each do |klass|
-      current = klass
-
-      generate_class klass, template_file
-    end
-  rescue => e
-    error = RDoc::Error.new \
-      "error generating #{current.path}: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  ##
-  # Generate a documentation file for each file
-
-  def generate_file_files
-    setup
-
-    page_file     = @template_dir + 'page.rhtml'
-    fileinfo_file = @template_dir + 'fileinfo.rhtml'
-
-    # for legacy templates
-    filepage_file = @template_dir + 'filepage.rhtml' unless
-      page_file.exist? or fileinfo_file.exist?
-
-    return unless
-      page_file.exist? or fileinfo_file.exist? or filepage_file.exist?
-
-    debug_msg "Generating file documentation in #{@outputdir}"
-
-    out_file = nil
-    current = nil
-
-    @files.each do |file|
-      current = file
-
-      if file.text? and page_file.exist? then
-        generate_page file
-        next
-      end
-
-      template_file = nil
-      out_file = @outputdir + file.path
-      debug_msg "  working on %s (%s)" % [file.full_name, out_file]
-      rel_prefix = @outputdir.relative_path_from out_file.dirname
-      search_index_rel_prefix = rel_prefix
-      search_index_rel_prefix += @asset_rel_path if @file_output
-
-      asset_rel_prefix = rel_prefix + @asset_rel_path
-
-      unless filepage_file then
-        if file.text? then
-          next unless page_file.exist?
-          template_file = page_file
-          @title = file.page_name
-        else
-          next unless fileinfo_file.exist?
-          template_file = fileinfo_file
-          @title = "File: #{file.base_name}"
-        end
-      end
-
-      @title += " - #{@options.title}"
-      template_file ||= filepage_file
-
-      render_template template_file, out_file do |io|
-        here = binding
-        # suppress 1.9.3 warning
-        here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-        here.local_variable_set(:current, current)
-        here
-      end
-    end
-  rescue => e
-    error =
-      RDoc::Error.new "error generating #{out_file}: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  ##
-  # Generate a page file for +file+
-
-  def generate_page file
-    setup
-
-    template_file = @template_dir + 'page.rhtml'
-
-    out_file = @outputdir + file.path
-    debug_msg "  working on %s (%s)" % [file.full_name, out_file]
-    rel_prefix = @outputdir.relative_path_from out_file.dirname
-    search_index_rel_prefix = rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    current          = file
-    asset_rel_prefix = rel_prefix + @asset_rel_path
-
-    @title = "#{file.page_name} - #{@options.title}"
-
-    debug_msg "  rendering #{out_file}"
-    render_template template_file, out_file do |io|
-      here = binding
-      # suppress 1.9.3 warning
-      here.local_variable_set(:current, current)
-      here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-      here
-    end
-  end
-
-  ##
-  # Generates the 404 page for the RDoc servlet
-
-  def generate_servlet_not_found message
-    setup
-
-    template_file = @template_dir + 'servlet_not_found.rhtml'
-    return unless template_file.exist?
-
-    debug_msg "Rendering the servlet 404 Not Found page..."
-
-    rel_prefix = rel_prefix = ''
-    search_index_rel_prefix = rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    asset_rel_prefix = ''
-
-    @title = 'Not Found'
-
-    render_template template_file do |io|
-      here = binding
-      # suppress 1.9.3 warning
-      here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-      here
-    end
-  rescue => e
-    error = RDoc::Error.new \
-      "error generating servlet_not_found: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  ##
-  # Generates the servlet root page for the RDoc servlet
-
-  def generate_servlet_root installed
-    setup
-
-    template_file = @template_dir + 'servlet_root.rhtml'
-    return unless template_file.exist?
-
-    debug_msg 'Rendering the servlet root page...'
-
-    rel_prefix = '.'
-    asset_rel_prefix = rel_prefix
-    search_index_rel_prefix = asset_rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    @title = 'Local RDoc Documentation'
-
-    render_template template_file do |io| binding end
-  rescue => e
-    error = RDoc::Error.new \
-      "error generating servlet_root: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  ##
-  # Generate an index page which lists all the classes which are documented.
-
-  def generate_table_of_contents
-    setup
-
-    template_file = @template_dir + 'table_of_contents.rhtml'
-    return unless template_file.exist?
-
-    debug_msg "Rendering the Table of Contents..."
-
-    out_file = @outputdir + 'table_of_contents.html'
-    rel_prefix = @outputdir.relative_path_from out_file.dirname
-    search_index_rel_prefix = rel_prefix
-    search_index_rel_prefix += @asset_rel_path if @file_output
-
-    asset_rel_prefix = rel_prefix + @asset_rel_path
-
-    @title = "Table of Contents - #{@options.title}"
-
-    render_template template_file, out_file do |io|
-      here = binding
-      # suppress 1.9.3 warning
-      here.local_variable_set(:asset_rel_prefix, asset_rel_prefix)
-      here
-    end
-  rescue => e
-    error = RDoc::Error.new \
-      "error generating table_of_contents.html: #{e.message} (#{e.class})"
-    error.set_backtrace e.backtrace
-
-    raise error
-  end
-
-  def install_rdoc_static_file source, destination, options # :nodoc:
-    return unless source.exist?
-
-    begin
-      FileUtils.mkdir_p File.dirname(destination), **options
-
-      begin
-        FileUtils.ln source, destination, **options
-      rescue Errno::EEXIST
-        FileUtils.rm destination
-        retry
-      end
-    rescue
-      FileUtils.cp source, destination, **options
-    end
-  end
-
-  ##
-  # Prepares for generation of output from the current directory
-
-  def setup
-    return if instance_variable_defined? :@outputdir
-
-    @outputdir = Pathname.new(@options.op_dir).expand_path @base_dir
-
-    return unless @store
-
-    @classes = @store.all_classes_and_modules.sort
-    @files   = @store.all_files.sort
-    @methods = @classes.flat_map { |m| m.method_list }.sort
-    @modsort = get_sorted_module_list @classes
-  end
-
-  ##
-  # Return a string describing the amount of time in the given number of
-  # seconds in terms a human can understand easily.
-
-  def time_delta_string seconds
-    return 'less than a minute'          if seconds < 60
-    return "#{seconds / 60} minute#{seconds / 60 == 1 ? '' : 's'}" if
-                                            seconds < 3000     # 50 minutes
-    return 'about one hour'              if seconds < 5400     # 90 minutes
-    return "#{seconds / 3600} hours"     if seconds < 64800    # 18 hours
-    return 'one day'                     if seconds < 86400    #  1 day
-    return 'about one day'               if seconds < 172800   #  2 days
-    return "#{seconds / 86400} days"     if seconds < 604800   #  1 week
-    return 'about one week'              if seconds < 1209600  #  2 week
-    return "#{seconds / 604800} weeks"   if seconds < 7257600  #  3 months
-    return "#{seconds / 2419200} months" if seconds < 31536000 #  1 year
-    return "#{seconds / 31536000} years"
-  end
-
-  # %q$Id: darkfish.rb 52 2009-01-07 02:08:11Z deveiant $"
-  SVNID_PATTERN = /
-    \$Id:\s
-    (\S+)\s                # filename
-    (\d+)\s                # rev
-    (\d{4}-\d{2}-\d{2})\s  # Date (YYYY-MM-DD)
-    (\d{2}:\d{2}:\d{2}Z)\s # Time (HH:MM:SSZ)
-    (\w+)\s                # committer
-    \$$
-  /x
-
-  ##
-  # Try to extract Subversion information out of the first constant whose
-  # value looks like a subversion Id tag. If no matching constant is found,
-  # and empty hash is returned.
-
-  def get_svninfo klass
-    constants = klass.constants or return {}
-
-    constants.find { |c| c.value =~ SVNID_PATTERN } or return {}
-
-    filename, rev, date, time, committer = $~.captures
-    commitdate = Time.parse "#{date} #{time}"
-
-    return {
-      :filename    => filename,
-      :rev         => Integer(rev),
-      :commitdate  => commitdate,
-      :commitdelta => time_delta_string(Time.now - commitdate),
-      :committer   => committer,
-    }
-  end
-
-  ##
-  # Creates a template from its components and the +body_file+.
-  #
-  # For backwards compatibility, if +body_file+ contains "<html" the body is
-  # used directly.
-
-  def assemble_template body_file
-    body = body_file.read
-    return body if body =~ /<html/
-
-    head_file = @template_dir + '_head.rhtml'
-    footer_file = @template_dir + '_footer.rhtml'
-
-    <<-TEMPLATE
-<!DOCTYPE html>
-
-<html>
-<head>
-#{head_file.read}
-
-#{body}
-
-#{footer_file.read}
-    TEMPLATE
-  end
-
-  ##
-  # Renders the ERb contained in +file_name+ relative to the template
-  # directory and returns the result based on the current context.
-
-  def render file_name
-    template_file = @template_dir + file_name
-
-    template = template_for template_file, false, RDoc::ERBPartial
-
-    template.filename = template_file.to_s
-
-    template.result @context
-  end
-
-  ##
-  # Load and render the erb template in the given +template_file+ and write
-  # it out to +out_file+.
-  #
-  # Both +template_file+ and +out_file+ should be Pathname-like objects.
-  #
-  # An io will be yielded which must be captured by binding in the caller.
-
-  def render_template template_file, out_file = nil # :yield: io
-    io_output = out_file && !@dry_run && @file_output
-    erb_klass = io_output ? RDoc::ERBIO : ERB
-
-    template = template_for template_file, true, erb_klass
-
-    if io_output then
-      debug_msg "Outputting to %s" % [out_file.expand_path]
-
-      out_file.dirname.mkpath
-      out_file.open 'w', 0644 do |io|
-        io.set_encoding @options.encoding
-
-        @context = yield io
-
-        template_result template, @context, template_file
-      end
-    else
-      @context = yield nil
-
-      output = template_result template, @context, template_file
-
-      debug_msg "  would have written %d characters to %s" % [
-        output.length, out_file.expand_path
-      ] if @dry_run
-
-      output
-    end
-  end
-
-  ##
-  # Creates the result for +template+ with +context+.  If an error is raised a
-  # Pathname +template_file+ will indicate the file where the error occurred.
-
-  def template_result template, context, template_file
-    template.filename = template_file.to_s
-    template.result context
-  rescue NoMethodError => e
-    raise RDoc::Error, "Error while evaluating %s: %s" % [
-      template_file.expand_path,
-      e.message,
-    ], e.backtrace
-  end
-
-  ##
-  # Retrieves a cache template for +file+, if present, or fills the cache.
-
-  def template_for file, page = true, klass = ERB
-    template = @template_cache[file]
-
-    return template if template
-
-    if page then
-      template = assemble_template file
-      erbout = 'io'
-    else
-      template = file.read
-      template = template.encode @options.encoding
-
-      file_var = File.basename(file).sub(/\..*/, '')
-
-      erbout = "_erbout_#{file_var}"
-    end
-
-    template = klass.new template, trim_mode: '-', eoutvar: erbout
-    @template_cache[file] = template
-    template
-  end
-
-end
diff --git a/lib/rdoc/generator/json_index.rb b/lib/rdoc/generator/json_index.rb
deleted file mode 100644
index c454910d5c..0000000000
--- a/lib/rdoc/generator/json_index.rb
+++ /dev/null
@@ -1,300 +0,0 @@
-# frozen_string_literal: true
-require 'json'
-begin
-  require 'zlib'
-rescue LoadError
-end
-
-##
-# The JsonIndex generator is designed to complement an HTML generator and
-# produces a JSON search index.  This generator is derived from sdoc by
-# Vladimir Kolesnikov and contains verbatim code written by him.
-#
-# This generator is designed to be used with a regular HTML generator:
-#
-#   class RDoc::Generator::Darkfish
-#     def initialize options
-#       # ...
-#       @base_dir = Pathname.pwd.expand_path
-#
-#       @json_index = RDoc::Generator::JsonIndex.new self, options
-#     end
-#
-#     def generate
-#       # ...
-#       @json_index.generate
-#     end
-#   end
-#
-# == Index Format
-#
-# The index is output as a JSON file assigned to the global variable
-# +search_data+.  The structure is:
-#
-#   var search_data = {
-#     "index": {
-#       "searchIndex":
-#         ["a", "b", ...],
-#       "longSearchIndex":
-#         ["a", "a::b", ...],
-#       "info": [
-#         ["A", "A", "A.html", "", ""],
-#         ["B", "A::B", "A::B.html", "", ""],
-#         ...
-#       ]
-#     }
-#   }
-#
-# The same item is described across the +searchIndex+, +longSearchIndex+ and
-# +info+ fields.  The +searchIndex+ field contains the item's short name, the
-# +longSearchIndex+ field contains the full_name (when appropriate) and the
-# +info+ field contains the item's name, full_name, path, parameters and a
-# snippet of the item's comment.
-#
-# == LICENSE
-#
-# Copyright (c) 2009 Vladimir Kolesnikov
-#
-# 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.
-
-class RDoc::Generator::JsonIndex
-
-  include RDoc::Text
-
-  ##
-  # Where the search index lives in the generated output
-
-  SEARCH_INDEX_FILE = File.join 'js', 'search_index.js'
-
-  attr_reader :index # :nodoc:
-
-  ##
-  # Creates a new generator.  +parent_generator+ is used to determine the
-  # class_dir and file_dir of links in the output index.
-  #
-  # +options+ are the same options passed to the parent generator.
-
-  def initialize parent_generator, options
-    @parent_generator = parent_generator
-    @store            = parent_generator.store
-    @options          = options
-
-    @template_dir = File.expand_path '../template/json_index', __FILE__
-    @base_dir = @parent_generator.base_dir
-
-    @classes = nil
-    @files   = nil
-    @index   = nil
-  end
-
-  ##
-  # Builds the JSON index as a Hash.
-
-  def build_index
-    reset @store.all_files.sort, @store.all_classes_and_modules.sort
-
-    index_classes
-    index_methods
-    index_pages
-
-    { :index => @index }
-  end
-
-  ##
-  # Output progress information if debugging is enabled
-
-  def debug_msg *msg
-    return unless $DEBUG_RDOC
-    $stderr.puts(*msg)
-  end
-
-  ##
-  # Writes the JSON index to disk
-
-  def generate
-    debug_msg "Generating JSON index"
-
-    debug_msg "  writing search index to %s" % SEARCH_INDEX_FILE
-    data = build_index
-
-    return if @options.dry_run
-
-    out_dir = @base_dir + @options.op_dir
-    index_file = out_dir + SEARCH_INDEX_FILE
-
-    FileUtils.mkdir_p index_file.dirname, :verbose => $DEBUG_RDOC
-
-    index_file.open 'w', 0644 do |io|
-      io.set_encoding Encoding::UTF_8
-      io.write 'var search_data = '
-
-      JSON.dump data, io, 0
-    end
-    unless ENV['SOURCE_DATE_EPOCH'].nil?
-      index_file.utime index_file.atime, Time.at(ENV['SOURCE_DATE_EPOCH'].to_i).gmtime
-    end
-
-    Dir.chdir @template_dir do
-      Dir['**/*.js'].each do |source|
-        dest = File.join out_dir, source
-
-        FileUtils.install source, dest, :mode => 0644, :preserve => true, :verbose => $DEBUG_RDOC
-      end
-    end
-  end
-
-  ##
-  # Compress the search_index.js file using gzip
-
-  def generate_gzipped
-    return if @options.dry_run or not defined?(Zlib)
-
-    debug_msg "Compressing generated JSON index"
-    out_dir = @base_dir + @options.op_dir
-
-    search_index_file = out_dir + SEARCH_INDEX_FILE
-    outfile           = out_dir + "#{search_index_file}.gz"
-
-    debug_msg "Reading the JSON index file from %s" % search_index_file
-    search_index = search_index_file.read(mode: 'r:utf-8')
-
-    debug_msg "Writing gzipped search index to %s" % outfile
-
-    Zlib::GzipWriter.open(outfile) do |gz|
-      gz.mtime = File.mtime(search_index_file)
-      gz.orig_name = search_index_file.basename.to_s
-      gz.write search_index
-      gz.close
-    end
-
-    # GZip the rest of the js files
-    Dir.chdir @template_dir do
-      Dir['**/*.js'].each do |source|
-        dest = out_dir + source
-        outfile = out_dir + "#{dest}.gz"
-
-        debug_msg "Reading the original js file from %s" % dest
-        data = dest.read
-
-        debug_msg "Writing gzipped file to %s" % outfile
-
-        Zlib::GzipWriter.open(outfile) do |gz|
-          gz.mtime = File.mtime(dest)
-          gz.orig_name = dest.basename.to_s
-          gz.write data
-          gz.close
-        end
-      end
-    end
-  end
-
-  ##
-  # Adds classes and modules to the index
-
-  def index_classes
-    debug_msg "  generating class search index"
-
-    documented = @classes.uniq.select do |klass|
-      klass.document_self_or_methods
-    end
-
-    documented.each do |klass|
-      debug_msg "    #{klass.full_name}"
-      record = klass.search_record
-      @index[:searchIndex]     << search_string(record.shift)
-      @index[:longSearchIndex] << search_string(record.shift)
-      @index[:info]            << record
-    end
-  end
-
-  ##
-  # Adds methods to the index
-
-  def index_methods
-    debug_msg "  generating method search index"
-
-    list = @classes.uniq.flat_map do |klass|
-      klass.method_list
-    end.sort_by do |method|
-      [method.name, method.parent.full_name]
-    end
-
-    list.each do |method|
-      debug_msg "    #{method.full_name}"
-      record = method.search_record
-      @index[:searchIndex]     << "#{search_string record.shift}()"
-      @index[:longSearchIndex] << "#{search_string record.shift}()"
-      @index[:info]            << record
-    end
-  end
-
-  ##
-  # Adds pages to the index
-
-  def index_pages
-    debug_msg "  generating pages search index"
-
-    pages = @files.select do |file|
-      file.text?
-    end
-
-    pages.each do |page|
-      debug_msg "    #{page.page_name}"
-      record = page.search_record
-      @index[:searchIndex]     << search_string(record.shift)
-      @index[:longSearchIndex] << ''
-      record.shift
-      @index[:info]            << record
-    end
-  end
-
-  ##
-  # The directory classes are written to
-
-  def class_dir
-    @parent_generator.class_dir
-  end
-
-  ##
-  # The directory files are written to
-
-  def file_dir
-    @parent_generator.file_dir
-  end
-
-  def reset files, classes # :nodoc:
-    @files   = files
-    @classes = classes
-
-    @index = {
-      :searchIndex => [],
-      :longSearchIndex => [],
-      :info => []
-    }
-  end
-
-  ##
-  # Removes whitespace and downcases +string+
-
-  def search_string string
-    string.downcase.gsub(/\s/, '')
-  end
-
-end
diff --git a/lib/rdoc/generator/markup.rb b/lib/rdoc/generator/markup.rb
deleted file mode 100644
index 76b7d458aa..0000000000
--- a/lib/rdoc/generator/markup.rb
+++ /dev/null
@@ -1,159 +0,0 @@
-# frozen_string_literal: true
-##
-# Handle common RDoc::Markup tasks for various CodeObjects
-#
-# This module is loaded by generators.  It allows RDoc's CodeObject tree to
-# avoid loading generator code to improve startup time for +ri+.
-
-module RDoc::Generator::Markup
-
-  ##
-  # Generates a relative URL from this object's path to +target_path+
-
-  def aref_to(target_path)
-    RDoc::Markup::ToHtml.gen_relative_url path, target_path
-  end
-
-  ##
-  # Generates a relative URL from +from_path+ to this object's path
-
-  def as_href(from_path)
-    RDoc::Markup::ToHtml.gen_relative_url from_path, path
-  end
-
-  ##
-  # Handy wrapper for marking up this object's comment
-
-  def description
-    markup @comment
-  end
-
-  ##
-  # Creates an RDoc::Markup::ToHtmlCrossref formatter
-
-  def formatter
-    return @formatter if defined? @formatter
-
-    options = @store.rdoc.options
-    this = RDoc::Context === self ? self : @parent
-
-    @formatter = RDoc::Markup::ToHtmlCrossref.new options, this.path, this
-    @formatter.code_object = self
-    @formatter
-  end
-
-  ##
-  # Build a webcvs URL starting for the given +url+ with +full_path+ appended
-  # as the destination path.  If +url+ contains '%s' +full_path+ will be
-  # will replace the %s using sprintf on the +url+.
-
-  def cvs_url(url, full_path)
-    if /%s/ =~ url then
-      sprintf url, full_path
-    else
-      url + full_path
-    end
-  end
-
-end
-
-class RDoc::CodeObject
-
-  include RDoc::Generator::Markup
-
-end
-
-class RDoc::MethodAttr
-
-  ##
-  # Prepend +src+ with line numbers.  Relies on the first line of a source
-  # code listing having:
-  #
-  #   # File xxxxx, line dddd
-  #
-  # If it has this comment then line numbers are added to +src+ and the <tt>,
-  # line dddd</tt> portion of the comment is removed.
-
-  def add_line_numbers(src)
-    return unless src.sub!(/\A(.*)(, line (\d+))/, '\1')
-    first = $3.to_i - 1
-    last  = first + src.count("\n")
-    size = last.to_s.length
-
-    line = first
-    src.gsub!(/^/) do
-      res = if line == first then
-              " " * (size + 1)
-            else
-              "<span class=\"line-num\">%2$*1$d</span> " % [size, line]
-            end
-
-      line += 1
-      res
-    end
-  end
-
-  ##
-  # Turns the method's token stream into HTML.
-  #
-  # Prepends line numbers if +options.line_numbers+ is true.
-
-  def markup_code
-    return '' unless @token_stream
-
-    src = RDoc::TokenStream.to_html @token_stream
-
-    # dedent the source
-    indent = src.length
-    lines = src.lines.to_a
-    lines.shift if src =~ /\A.*#\ *File/i # remove '# File' comment
-    lines.each do |line|
-      if line =~ /^ *(?=\S)/
-        n = $~.end(0)
-        indent = n if n < indent
-        break if n == 0
-      end
-    end
-    src.gsub!(/^#{' ' * indent}/, '') if indent > 0
-
-    add_line_numbers(src) if options.line_numbers
-
-    src
-  end
-
-end
-
-class RDoc::ClassModule
-
-  ##
-  # Handy wrapper for marking up this class or module's comment
-
-  def description
-    markup @comment_location
-  end
-
-end
-
-class RDoc::Context::Section
-
-  include RDoc::Generator::Markup
-
-end
-
-class RDoc::TopLevel
-
-  ##
-  # Returns a URL for this source file on some web repository.  Use the -W
-  # command line option to set.
-
-  def cvs_url
-    url = @store.rdoc.options.webcvs
-
-    if /%s/ =~ url then
-      url % @relative_name
-    else
-      url + @relative_name
-    end
-  end
-
-end
diff --git a/lib/rdoc/generator/pot.rb b/lib/rdoc/generator/pot.rb
deleted file mode 100644
index b0b7c07179..0000000000
--- a/lib/rdoc/generator/pot.rb
+++ /dev/null
@@ -1,99 +0,0 @@
-# frozen_string_literal: true
-##
-# Generates a POT file.
-#
-# Here is a translator work flow with the generator.
-#
-# == Create .pot
-#
-# You create .pot file by pot formatter:
-#
-#   % rdoc --format pot
-#
-# It generates doc/rdoc.pot.
-#
-# == Create .po
-#
-# You create .po file from doc/rdoc.pot. This operation is needed only
-# the first time. This work flow assumes that you are a translator
-# for Japanese.
-#
-# You create locale/ja/rdoc.po from doc/rdoc.pot. You can use msginit
-# provided by GNU gettext or rmsginit provided by gettext gem. This
-# work flow uses gettext gem because it is more portable than GNU
-# gettext for Rubyists. Gettext gem is implemented by pure Ruby.
-#
-#   % gem install gettext
-#   % mkdir -p locale/ja
-#   % rmsginit --input doc/rdoc.pot --output locale/ja/rdoc.po --locale ja
-#
-# Translate messages in .po
-#
-# You translate messages in .po by a PO file editor. po-mode.el exists
-# for Emacs users. There are some GUI tools such as GTranslator.
-# There are some Web services such as POEditor and Tansifex. You can
-# edit by your favorite text editor because .po is a text file.
-# Generate localized documentation
-#
-# You can generate localized documentation with locale/ja/rdoc.po:
-#
-#   % rdoc --locale ja
-#
-# You can find documentation in Japanese in doc/. Yay!
-#
-# == Update translation
-#
-# You need to update translation when your application is added or
-# modified messages.
-#
-# You can update .po by the following command lines:
-#
-#   % rdoc --format pot
-#   % rmsgmerge --update locale/ja/rdoc.po doc/rdoc.pot
-#
-# You edit locale/ja/rdoc.po to translate new messages.
-
-class RDoc::Generator::POT
-
-  RDoc::RDoc.add_generator self
-
-  ##
-  # Description of this generator
-
-  DESCRIPTION = 'creates .pot file'
-
-  ##
-  # Set up a new .pot generator
-
-  def initialize store, options #:not-new:
-    @options    = options
-    @store      = store
-  end
-
-  ##
-  # Writes .pot to disk.
-
-  def generate
-    po = extract_messages
-    pot_path = 'rdoc.pot'
-    File.open(pot_path, "w") do |pot|
-      pot.print(po.to_s)
-    end
-  end
-
-  # :nodoc:
-  def class_dir
-    nil
-  end
-
-  private
-  def extract_messages
-    extractor = MessageExtractor.new(@store)
-    extractor.extract
-  end
-
-  require_relative 'pot/message_extractor'
-  require_relative 'pot/po'
-  require_relative 'pot/po_entry'
-
-end
diff --git a/lib/rdoc/generator/pot/message_extractor.rb b/lib/rdoc/generator/pot/message_extractor.rb
deleted file mode 100644
index 313dfd2dc7..0000000000
--- a/lib/rdoc/generator/pot/message_extractor.rb
+++ /dev/null
@@ -1,68 +0,0 @@
-# frozen_string_literal: true
-##
-# Extracts message from RDoc::Store
-
-class RDoc::Generator::POT::MessageExtractor
-
-  ##
-  # Creates a message extractor for +store+.
-
-  def initialize store
-    @store = store
-    @po = RDoc::Generator::POT::PO.new
-  end
-
-  ##
-  # Extracts messages from +store+, stores them into
-  # RDoc::Generator::POT::PO and returns it.
-
-  def extract
-    @store.all_classes_and_modules.each do |klass|
-      extract_from_klass(klass)
-    end
-    @po
-  end
-
-  private
-
-  def extract_from_klass klass
-    extract_text(klass.comment_location, klass.full_name)
-
-    klass.each_section do |section, constants, attributes|
-      extract_text(section.title ,"#{klass.full_name}: section title")
-      section.comments.each do |comment|
-        extract_text(comment, "#{klass.full_name}: #{section.title}")
-      end
-    end
-
-    klass.each_constant do |constant|
-      extract_text(constant.comment, constant.full_name)
-    end
-
-    klass.each_attribute do |attribute|
-      extract_text(attribute.comment, attribute.full_name)
-    end
-
-    klass.each_method do |method|
-      extract_text(method.comment, method.full_name)
-    end
-  end
-
-  def extract_text text, comment, location = nil
-    return if text.nil?
-
-    options = {
-      :extracted_comment => comment,
-      :references => [location].compact,
-    }
-    i18n_text = RDoc::I18n::Text.new(text)
-    i18n_text.extract_messages do |part|
-      @po.add(entry(part[:paragraph], options))
-    end
-  end
-
-  def entry msgid, options
-    RDoc::Generator::POT::POEntry.new(msgid, options)
-  end
-
-end
diff --git a/lib/rdoc/generator/pot/po.rb b/lib/rdoc/generator/pot/po.rb
deleted file mode 100644
index 37d45e5258..0000000000
--- a/lib/rdoc/generator/pot/po.rb
+++ /dev/null
@@ -1,84 +0,0 @@
-# frozen_string_literal: true
-##
-# Generates a PO format text
-
-class RDoc::Generator::POT::PO
-
-  ##
-  # Creates an object that represents PO format.
-
-  def initialize
-    @entries = {}
-    add_header
-  end
-
-  ##
-  # Adds a PO entry to the PO.
-
-  def add entry
-    existing_entry = @entries[entry.msgid]
-    if existing_entry
-      entry = existing_entry.merge(entry)
-    end
-    @entries[entry.msgid] = entry
-  end
-
-  ##
-  # Returns PO format text for the PO.
-
-  def to_s
-    po = ''
-    sort_entries.each do |entry|
-      po += "\n" unless po.empty?
-      po += entry.to_s
-    end
-    po
-  end
-
-  private
-
-  def add_header
-    add(header_entry)
-  end
-
-  def header_entry
-    comment = <<-COMMENT
-SOME DESCRIPTIVE TITLE.
-Copyright (C) YEAR THE PACKAGE'S COPYRIGHT HOLDER
-This file is distributed under the same license as the PACKAGE package.
-FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
-    COMMENT
-
-    content = <<-CONTENT
-Project-Id-Version: PACKAGE VERSEION
-Report-Msgid-Bugs-To:
-PO-Revision-Date: YEAR-MO_DA HO:MI+ZONE
-Last-Translator: FULL NAME <EMAIL@ADDRESS>
-Language-Team: LANGUAGE <LL@li.org>
-Language:
-MIME-Version: 1.0
-Content-Type: text/plain; charset=CHARSET
-Content-Transfer-Encoding: 8bit
-Plural-Forms: nplurals=INTEGER; plural=EXPRESSION;
-    CONTENT
-
-    options = {
-      :msgstr => content,
-      :translator_comment => comment,
-      :flags => ['fuzzy'],
-    }
-    RDoc::Generator::POT::POEntry.new('', options)
-  end
-
-  def sort_entries
-    headers, messages = @entries.values.partition do |entry|
-      entry.msgid.empty?
-    end
-    # TODO: sort by location
-    sorted_messages = messages.sort_by do |entry|
-      entry.msgid
-    end
-    headers + sorted_messages
-  end
-
-end
diff --git a/lib/rdoc/generator/pot/po_entry.rb b/lib/rdoc/generator/pot/po_entry.rb
deleted file mode 100644
index 3c278826f4..0000000000
--- a/lib/rdoc/generator/pot/po_entry.rb
+++ /dev/null
@@ -1,141 +0,0 @@
-# frozen_string_literal: true
-##
-# A PO entry in PO
-
-class RDoc::Generator::POT::POEntry
-
-  # The msgid content
-  attr_reader :msgid
-
-  # The msgstr content
-  attr_reader :msgstr
-
-  # The comment content created by translator (PO editor)
-  attr_reader :translator_comment
-
-  # The comment content extracted from source file
-  attr_reader :extracted_comment
-
-  # The locations where the PO entry is extracted
-  attr_reader :references
-
-  # The flags of the PO entry
-  attr_reader :flags
-
-  ##
-  # Creates a PO entry for +msgid+. Other valus can be specified by
-  # +options+.
-
-  def initialize msgid, options = {}
-    @msgid = msgid
-    @msgstr = options[:msgstr] || ""
-    @translator_comment = options[:translator_comment]
-    @extracted_comment = options[:extracted_comment]
-    @references = options[:references] || []
-    @flags = options[:flags] || []
-  end
-
-  ##
-  # Returns the PO entry in PO format.
-
-  def to_s
-    entry = ''
-    entry += format_translator_comment
-    entry += format_extracted_comment
-    entry += format_references
-    entry += format_flags
-    entry += <<-ENTRY
-msgid #{format_message(@msgid)}
-msgstr #{format_message(@msgstr)}
-    ENTRY
-  end
-
-  ##
-  # Merges the PO entry with +other_entry+.
-
-  def merge other_entry
-    options = {
-      :extracted_comment  => merge_string(@extracted_comment,
-                                          other_entry.extracted_comment),
-      :translator_comment => merge_string(@translator_comment,
-                                          other_entry.translator_comment),
-      :references         => merge_array(@references,
-                                         other_entry.references),
-      :flags              => merge_array(@flags,
-                                         other_entry.flags),
-    }
-    self.class.new(@msgid, options)
-  end
-
-  private
-
-  def format_comment mark, comment
-    return '' unless comment
-    return '' if comment.empty?
-
-    formatted_comment = ''
-    comment.each_line do |line|
-      formatted_comment += "#{mark} #{line}"
-    end
-    formatted_comment += "\n" unless formatted_comment.end_with?("\n")
-    formatted_comment
-  end
-
-  def format_translator_comment
-    format_comment('#', @translator_comment)
-  end
-
-  def format_extracted_comment
-    format_comment('#.', @extracted_comment)
-  end
-
-  def format_references
-    return '' if @references.empty?
-
-    formatted_references = ''
-    @references.sort.each do |file, line|
-      formatted_references += "\#: #{file}:#{line}\n"
-    end
-    formatted_references
-  end
-
-  def format_flags
-    return '' if @flags.empty?
-
-    formatted_flags = flags.join(",")
-    "\#, #{formatted_flags}\n"
-  end
-
-  def format_message message
-    return "\"#{escape(message)}\"" unless message.include?("\n")
-
-    formatted_message = '""'
-    message.each_line do |line|
-      formatted_message += "\n"
-      formatted_message += "\"#{escape(line)}\""
-    end
-    formatted_message
-  end
-
-  def escape string
-    string.gsub(/["\\\t\n]/) do |special_character|
-      case special_character
-      when "\t"
-        "\\t"
-      when "\n"
-        "\\n"
-      else
-        "\\#{special_character}"
-      end
-    end
-  end
-
-  def merge_string string1, string2
-    [string1, string2].compact.join("\n")
-  end
-
-  def merge_array array1, array2
-      (array1 + array2).uniq
-  end
-
-end
diff --git a/lib/rdoc/generator/ri.rb b/lib/rdoc/generator/ri.rb
deleted file mode 100644
index 1c2f018f97..0000000000
--- a/lib/rdoc/generator/ri.rb
+++ /dev/null
@@ -1,30 +0,0 @@
-# frozen_string_literal: true
-##
-# Generates ri data files
-
-class RDoc::Generator::RI
-
-  RDoc::RDoc.add_generator self
-
-  ##
-  # Description of this generator
-
-  DESCRIPTION = 'creates ri data files'
-
-  ##
-  # Set up a new ri generator
-
-  def initialize store, options #:not-new:
-    @options    = options
-    @store      = store
-    @store.path = '.'
-  end
-
-  ##
-  # Writes the parsed data store to disk for use by ri.
-
-  def generate
-    @store.save
-  end
-
-end
diff --git a/lib/rdoc/generator/template/darkfish/.document b/lib/rdoc/generator/template/darkfish/.document
deleted file mode 100644
index e69de29bb2..0000000000
--- a/lib/rdoc/generator/template/darkfish/.document
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/_footer.rhtml b/lib/rdoc/generator/template/darkfish/_footer.rhtml
deleted file mode 100644
index 9791b42901..0000000000
--- a/lib/rdoc/generator/template/darkfish/_footer.rhtml
+++ /dev/null
@@ -1,5 +0,0 @@
-<footer id="validator-badges" role="contentinfo">
-  <p><a href="https://validator.w3.org/check/referer">Validate</a>
-  <p>Generated by <a href="https://ruby.github.io/rdoc/">RDoc</a> <%= RDoc::VERSION %>.
-  <p>Based on <a href="http://deveiate.org/projects/Darkfish-RDoc/">Darkfish</a> by <a href="http://deveiate.org">Michael Granger</a>.
-</footer>
diff --git a/lib/rdoc/generator/template/darkfish/_head.rhtml b/lib/rdoc/generator/template/darkfish/_head.rhtml
deleted file mode 100644
index d5aed3e9ef..0000000000
--- a/lib/rdoc/generator/template/darkfish/_head.rhtml
+++ /dev/null
@@ -1,20 +0,0 @@
-<meta charset="<%= @options.charset %>">
-
-<title><%= h @title %></title>
-
-<script type="text/javascript">
-  var rdoc_rel_prefix = "<%= h asset_rel_prefix %>/";
-  var index_rel_prefix = "<%= h rel_prefix %>/";
-</script>
-
-<script src="<%= h asset_rel_prefix %>/js/navigation.js" defer></script>
-<script src="<%= h asset_rel_prefix %>/js/search.js" defer></script>
-<script src="<%= h asset_rel_prefix %>/js/search_index.js" defer></script>
-<script src="<%= h asset_rel_prefix %>/js/searcher.js" defer></script>
-<script src="<%= h asset_rel_prefix %>/js/darkfish.js" defer></script>
-
-<link href="<%= h asset_rel_prefix %>/css/fonts.css" rel="stylesheet">
-<link href="<%= h asset_rel_prefix %>/css/rdoc.css" rel="stylesheet">
-<%- @options.template_stylesheets.each do |stylesheet| -%>
-<link href="<%= h asset_rel_prefix %>/<%= File.basename stylesheet %>" rel="stylesheet">
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_VCS_info.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_VCS_info.rhtml
deleted file mode 100644
index 22a12d9e95..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_VCS_info.rhtml
+++ /dev/null
@@ -1,19 +0,0 @@
-<%- if !svninfo.empty? then %>
-<div id="file-svninfo-section" class="nav-section">
-  <h3>VCS Info</h3>
-
-  <div class="section-body">
-    <dl class="svninfo">
-      <dt>Rev
-      <dd><%= svninfo[:rev] %>
-
-      <dt>Last Checked In
-      <dd><%= svninfo[:commitdate].strftime('%Y-%m-%d %H:%M:%S') %>
-        (<%= svninfo[:commitdelta] %> ago)
-
-      <dt>Checked in by
-      <dd><%= svninfo[:committer] %>
-    </dl>
-  </div>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_classes.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_classes.rhtml
deleted file mode 100644
index d3d8da4017..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_classes.rhtml
+++ /dev/null
@@ -1,33 +0,0 @@
-<div id="classindex-section" class="nav-section">
-  <h3>Class and Module Index</h3>
-
-  <%-
-  all_classes = @classes.group_by do |klass|
-    klass.full_name[/\A[^:]++(?:::[^:]++(?=::))*+(?=::[^:]*+\z)/]
-  end.delete_if do |_, klasses|
-    !klasses.any?(&:display?)
-  end
-  link = proc do |index_klass, display = index_klass.display?|
-    if display
-      -%><code><a href="<%= rel_prefix %>/<%= index_klass.path %>"><%= index_klass.name %></a></code><%-
-    else
-      -%><code><%= index_klass.name %></code><%-
-    end
-  end
-  if top = all_classes[nil]
-    solo = top.one? {|klass| klass.display?}
-    traverse = proc do |klasses| -%>
-  <ul class="link-list">
-      <%- klasses.each do |index_klass| -%>
-        <%- if children = all_classes[index_klass.full_name] -%>
-  <li><details<% if solo; solo = false %> open<% end %>><summary><% link.call(index_klass) %></summary>
-          <%- traverse.call(children) -%>
-  </ul></details>
-        <%- elsif index_klass.display? -%>
-  <li><% link.call(index_klass, true) %>
-        <%- end -%>
-      <%- end -%>
-    <%- end -%>
-    <%- traverse.call(top) -%>
-  <%- end -%>
-</div>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_extends.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_extends.rhtml
deleted file mode 100644
index 7602076c96..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_extends.rhtml
+++ /dev/null
@@ -1,15 +0,0 @@
-<%- unless klass.extends.empty? then %>
-<div id="extends-section" class="nav-section">
-  <h3>Extended With Modules</h3>
-
-  <ul class="link-list">
-    <%- klass.each_extend do |ext| -%>
-  <%- unless String === ext.module then -%>
-    <li><a class="extend" href="<%= klass.aref_to ext.module.path %>"><%= ext.module.full_name %></a>
-  <%- else -%>
-    <li><span class="extend"><%= ext.name %></span>
-  <%- end -%>
-  <%- end -%>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_in_files.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_in_files.rhtml
deleted file mode 100644
index 74869a4b51..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_in_files.rhtml
+++ /dev/null
@@ -1,9 +0,0 @@
-<div id="file-list-section" class="nav-section">
-  <h3>Defined In</h3>
-
-  <ul>
-<%- klass.in_files.each do |tl| -%>
-    <li><%= h tl.relative_name %>
-<%- end -%>
-  </ul>
-</div>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_includes.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_includes.rhtml
deleted file mode 100644
index 5b600e5975..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_includes.rhtml
+++ /dev/null
@@ -1,15 +0,0 @@
-<%- unless klass.includes.empty? then %>
-<div id="includes-section" class="nav-section">
-  <h3>Included Modules</h3>
-
-  <ul class="link-list">
-  <%- klass.each_include do |inc| -%>
-  <%- unless String === inc.module then -%>
-    <li><a class="include" href="<%= klass.aref_to inc.module.path %>"><%= inc.module.full_name %></a>
-  <%- else -%>
-    <li><span class="include"><%= inc.name %></span>
-  <%- end -%>
-  <%- end -%>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_installed.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_installed.rhtml
deleted file mode 100644
index faed7e0a94..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_installed.rhtml
+++ /dev/null
@@ -1,15 +0,0 @@
-<div id="home-section" class="nav-section">
-  <h3>Documentation</h3>
-
-  <ul>
-  <%- installed.each do |name, href, exists, type, _| -%>
-    <%- next if type == :extra -%>
-    <li class="folder">
-    <%- if exists then -%>
-      <a href="<%= href %>"><%= h name %></a>
-    <%- else -%>
-      <%= h name %>
-    <%- end -%>
-  <%- end -%>
-  </ul>
-</div>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_methods.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_methods.rhtml
deleted file mode 100644
index 5b4c295bed..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_methods.rhtml
+++ /dev/null
@@ -1,12 +0,0 @@
-<%- unless klass.method_list.empty? then %>
-<!-- Method Quickref -->
-<div id="method-list-section" class="nav-section">
-  <h3>Methods</h3>
-
-  <ul class="link-list" role="directory">
-    <%- klass.each_method do |meth| -%>
-    <li <%- if meth.calls_super %>class="calls-super" <%- end %>><a href="#<%= meth.aref %>"><%= meth.singleton ? '::' : '#' %><%= h meth.name -%></a>
-    <%- end -%>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_navigation.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_navigation.rhtml
deleted file mode 100644
index d7f330840a..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_navigation.rhtml
+++ /dev/null
@@ -1,11 +0,0 @@
-<div id="home-section" role="region" title="Quick navigation" class="nav-section">
-  <h2>
-    <a href="<%= rel_prefix %>/index.html" rel="home">Home</a>
-  </h2>
-
-  <div id="table-of-contents-navigation">
-    <a href="<%= rel_prefix %>/table_of_contents.html#pages">Pages</a>
-    <a href="<%= rel_prefix %>/table_of_contents.html#classes">Classes</a>
-    <a href="<%= rel_prefix %>/table_of_contents.html#methods">Methods</a>
-  </div>
-</div>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_pages.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_pages.rhtml
deleted file mode 100644
index 3f68f0c0dc..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_pages.rhtml
+++ /dev/null
@@ -1,32 +0,0 @@
-<%- simple_files = @files.select { |f| f.text? } %>
-<%- if defined?(current) -%>
-  <%- dir = current.full_name[%r{\A[^/]+(?=/)}] || current.page_name -%>
-<%- end -%>
-<%- unless simple_files.empty? then -%>
-<div id="fileindex-section" class="nav-section">
-  <h3>Pages</h3>
-
-  <ul class="link-list">
-  <%- simple_files.group_by do |f| -%>
-    <%- f.full_name[%r{\A[^/]+(?=/)}] || f.page_name -%>
-  <%- end.each do |n, files| -%>
-    <%- f = files.shift -%>
-    <%- if files.empty? -%>
-    <li><a href="<%= rel_prefix %>/<%= h f.path %>"><%= h f.page_name %></a>
-      <%- next -%>
-    <%- end -%>
-    <li><details<% if dir == n %> open<% end %>><summary><%
-    if n == f.page_name
-      %><a href="<%= rel_prefix %>/<%= h f.path %>"><%= h n %></a><%
-    else
-      %><%= h n %><% files.unshift(f)
-    end %></summary>
-    <ul class="link-list">
-    <%- files.each do |f| -%>
-      <li><a href="<%= rel_prefix %>/<%= h f.path %>"><%= h f.page_name %></a>
-    <%- end -%>
-    </ul></details>
-  <%- end -%>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_parent.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_parent.rhtml
deleted file mode 100644
index 1420da3201..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_parent.rhtml
+++ /dev/null
@@ -1,11 +0,0 @@
-<%- if klass.type == 'class' then %>
-<div id="parent-class-section" class="nav-section">
-  <h3>Parent</h3>
-
-  <%- if klass.superclass and not String === klass.superclass then -%>
-  <p class="link"><a href="<%= klass.aref_to klass.superclass.path %>"><%= klass.superclass.full_name %></a>
-  <%- else -%>
-  <p class="link"><%= klass.superclass %>
-  <%- end -%>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_search.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_search.rhtml
deleted file mode 100644
index afc7f7b88d..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_search.rhtml
+++ /dev/null
@@ -1,14 +0,0 @@
-<div id="search-section" role="search" class="project-section initially-hidden">
-  <form action="#" method="get" accept-charset="utf-8">
-    <div id="search-field-wrapper">
-      <input id="search-field" role="combobox" aria-label="Search"
-             aria-autocomplete="list" aria-controls="search-results"
-             type="text" name="search" placeholder="Search (/) for a class, method, ..." spellcheck="false"
-             title="Type to search, Up and Down to navigate, Enter to load">
-    </div>
-
-    <ul id="search-results" aria-label="Search Results"
-        aria-busy="false" aria-expanded="false"
-        aria-atomic="false" class="initially-hidden"></ul>
-  </form>
-</div>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_sections.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_sections.rhtml
deleted file mode 100644
index 6dcd2ae81f..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_sections.rhtml
+++ /dev/null
@@ -1,11 +0,0 @@
-<%- unless klass.sections.length == 1 then %>
-<div id="sections-section" class="nav-section">
-  <h3>Sections</h3>
-
-  <ul class="link-list" role="directory">
-    <%- klass.sort_sections.each do |section| -%>
-      <li><a href="#<%= section.aref %>"><%= h section.title %></a></li>
-    <%- end -%>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/_sidebar_table_of_contents.rhtml b/lib/rdoc/generator/template/darkfish/_sidebar_table_of_contents.rhtml
deleted file mode 100644
index b1e047b5f7..0000000000
--- a/lib/rdoc/generator/template/darkfish/_sidebar_table_of_contents.rhtml
+++ /dev/null
@@ -1,39 +0,0 @@
-<%- comment = if current.respond_to? :comment_location then
-               current.comment_location
-             else
-               current.comment
-             end
-   table = current.parse(comment).table_of_contents.dup
-
-   if table.length > 1 then %>
-<div class="nav-section">
-  <h3>Table of Contents</h3>
-
-    <%- display_link = proc do |heading| -%>
-      <a href="#<%= heading.label current %>"><%= heading.plain_html %></a>
-    <%- end -%>
-
-    <%- list_siblings = proc do -%>
-      <%- level = table.first&.level -%>
-      <%- while table.first && table.first.level >= level -%>
-        <%- heading = table.shift -%>
-        <%- if table.first.nil? || table.first.level <= heading.level -%>
-          <li><% display_link.call heading -%>
-        <%- else -%>
-          <li>
-            <details open>
-              <summary><%- display_link.call heading -%></summary>
-              <ul class="link-list" role="directory">
-                <% list_siblings.call %>
-              </ul>
-            </details>
-          </li>
-        <%- end -%>
-      <%- end -%>
-    <%- end -%>
-
-  <ul class="link-list" role="directory">
-    <% list_siblings.call %>
-  </ul>
-</div>
-<%- end -%>
diff --git a/lib/rdoc/generator/template/darkfish/class.rhtml b/lib/rdoc/generator/template/darkfish/class.rhtml
deleted file mode 100644
index d6510336df..0000000000
--- a/lib/rdoc/generator/template/darkfish/class.rhtml
+++ /dev/null
@@ -1,180 +0,0 @@
-<body id="top" role="document" class="<%= klass.type %>">
-<nav role="navigation">
-  <div id="project-navigation">
-    <%= render '_sidebar_navigation.rhtml' %>
-    <%= render '_sidebar_search.rhtml' %>
-  </div>
-
-  <%= render '_sidebar_table_of_contents.rhtml' %>
-
-  <div id="class-metadata">
-    <%= render '_sidebar_sections.rhtml' %>
-    <%= render '_sidebar_parent.rhtml' %>
-    <%= render '_sidebar_includes.rhtml' %>
-    <%= render '_sidebar_extends.rhtml' %>
-    <%= render '_sidebar_methods.rhtml' %>
-  </div>
-</nav>
-
-<main role="main" aria-labelledby="<%=h klass.aref %>">
-  <h1 id="<%=h klass.aref %>" class="<%= klass.type %>">
-    <%= klass.type %> <%= klass.full_name %>
-  </h1>
-
-  <section class="description">
-    <%= klass.description %>
-  </section>
-
-  <%- klass.each_section do |section, constants, attributes| -%>
-  <section id="<%= section.aref %>" class="documentation-section">
-    <%- if section.title then -%>
-    <header class="documentation-section-title">
-      <h2>
-        <%= section.title %>
-      </h2>
-      <span class="section-click-top">
-        <a href="#top">&uarr; top</a>
-      </span>
-    </header>
-    <%- end -%>
-
-    <%- if section.comment then -%>
-    <div>
-      <%= section.description %>
-    </div>
-    <%- end -%>
-
-    <%- unless constants.empty? then -%>
-    <section class="constants-list">
-      <header>
-        <h3>Constants</h3>
-      </header>
-      <dl>
-      <%- constants.each do |const| -%>
-        <dt id="<%= const.name %>"><%= const.name %>
-        <%- if const.comment then -%>
-        <dd><%= const.description.strip %>
-        <%- else -%>
-        <dd class="missing-docs">(Not documented)
-        <%- end -%>
-      <%- end -%>
-      </dl>
-    </section>
-    <%- end -%>
-
-    <%- unless attributes.empty? then -%>
-    <section class="attribute-method-details" class="method-section">
-      <header>
-        <h3>Attributes</h3>
-      </header>
-
-      <%- attributes.each do |attrib| -%>
-      <div id="<%= attrib.aref %>" class="method-detail">
-        <div class="method-heading attribute-method-heading">
-          <span class="method-name"><%= h attrib.name %></span><span
-            class="attribute-access-type">[<%= attrib.rw %>]</span>
-        </div>
-
-        <div class="method-description">
-        <%- if attrib.comment then -%>
-        <%= attrib.description.strip %>
-        <%- else -%>
-        <p class="missing-docs">(Not documented)
-        <%- end -%>
-        </div>
-      </div>
-      <%- end -%>
-    </section>
-    <%- end -%>
-
-    <%- klass.methods_by_type(section).each do |type, visibilities|
-       next if visibilities.empty?
-       visibilities.each do |visibility, methods|
-         next if methods.empty? %>
-     <section id="<%= visibility %>-<%= type %>-<%= section.aref %>-method-details" class="method-section">
-       <header>
-         <h3><%= visibility.to_s.capitalize %> <%= type.capitalize %> Methods</h3>
-       </header>
-
-    <%- methods.each do |method| -%>
-      <div id="<%= method.aref %>" class="method-detail <%= method.is_alias_for ? "method-alias" : '' %>">
-        <div class="method-header">
-          <%- if (call_seq = method.call_seq) then -%>
-          <%-   call_seq.strip.split("\n").each_with_index do |call_seq, i| -%>
-          <div class="method-heading">
-            <span class="method-callseq">
-              <%= h(call_seq.strip.
-                    gsub( /^\w+\./m, '')).
-                    gsub(/(.*)[-=]&gt;/, '\1&rarr;') %>
-            </span>
-            <%- if i == 0 and method.token_stream then -%>
-            <span class="method-click-advice">click to toggle source</span>
-            <%- end -%>
-          </div>
-          <%-   end -%>
-          <%- elsif method.has_call_seq? then -%>
-          <div class="method-heading">
-            <span class="method-name"><%= h method.name %></span>
-          </div>
-          <%- else -%>
-          <div class="method-heading">
-            <span class="method-name"><%= h method.name %></span><span
-              class="method-args"><%= h method.param_seq %></span>
-            <%- if method.token_stream then -%>
-            <span class="method-click-advice">click to toggle source</span>
-            <%- end -%>
-          </div>
-          <%- end -%>
-        </div>
-
-        <%- unless method.skip_description? then -%>
-        <div class="method-description">
-          <%- if method.comment then -%>
-          <%= method.description.strip %>
-          <%- else -%>
-          <p class="missing-docs">(Not documented)
-          <%- end -%>
-          <%- if method.calls_super then -%>
-            <div class="method-calls-super">
-              Calls superclass method
-              <%=
-                  method.superclass_method ?
-                  method.formatter.link(method.superclass_method.full_name, method.superclass_method.full_name) : nil
-              %>
-            </div>
-          <%- end -%>
-
-          <%- if method.token_stream then -%>
-          <div class="method-source-code" id="<%= method.html_name %>-source">
-            <pre><%= method.markup_code %></pre>
-          </div>
-          <%- end -%>
-        </div>
-        <%- end -%>
-
-        <%- unless method.aliases.empty? then -%>
-        <div class="aliases">
-          Also aliased as: <%= method.aliases.map do |aka|
-            if aka.parent then # HACK lib/rexml/encodings
-              %{<a href="#{klass.aref_to aka.path}">#{h aka.name}</a>}
-            else
-              h aka.name
-            end
-          end.join ", " %>
-        </div>
-        <%- end -%>
-
-        <%- if method.is_alias_for then -%>
-        <div class="aliases">
-          Alias for: <a href="<%= klass.aref_to method.is_alias_for.path %>"><%= h method.is_alias_for.name %></a>
-        </div>
-        <%- end -%>
-      </div>
-
-    <%- end -%>
-    </section>
-  <%- end
-     end %>
-  </section>
-<%- end -%>
-</main>
diff --git a/lib/rdoc/generator/template/darkfish/css/fonts.css b/lib/rdoc/generator/template/darkfish/css/fonts.css
deleted file mode 100644
index 57302b5183..0000000000
--- a/lib/rdoc/generator/template/darkfish/css/fonts.css
+++ /dev/null
@@ -1,167 +0,0 @@
-/*
- * Copyright 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/),
- * with Reserved Font Name "Source". All Rights Reserved. Source is a
- * trademark of Adobe Systems Incorporated in the United States and/or other
- * countries.
- *
- * This Font Software is licensed under the SIL Open Font License, Version
- * 1.1.
- *
- * This license is copied below, and is also available with a FAQ at:
- * http://scripts.sil.org/OFL
- */
-
-@font-face {
-  font-family: "Source Code Pro";
-  font-style: normal;
-  font-weight: 400;
-  src: local("Source Code Pro"),
-       local("SourceCodePro-Regular"),
-       url("../fonts/SourceCodePro-Regular.ttf") format("truetype");
-}
-
-@font-face {
-  font-family: "Source Code Pro";
-  font-style: normal;
-  font-weight: 700;
-  src: local("Source Code Pro Bold"),
-       local("SourceCodePro-Bold"),
-       url("../fonts/SourceCodePro-Bold.ttf") format("truetype");
-}
-
-/*
- * Copyright (c) 2010, Łukasz Dziedzic (dziedzic@typoland.com),
- * with Reserved Font Name Lato.
- *
- * This Font Software is licensed under the SIL Open Font License, Version
- * 1.1.
- *
- * This license is copied below, and is also available with a FAQ at:
- * http://scripts.sil.org/OFL
- */
-
-@font-face {
-  font-family: "Lato";
-  font-style: normal;
-  font-weight: 300;
-  src: local("Lato Light"),
-       local("Lato-Light"),
-       url("../fonts/Lato-Light.ttf") format("truetype");
-}
-
-@font-face {
-  font-family: "Lato";
-  font-style: italic;
-  font-weight: 300;
-  src: local("Lato Light Italic"),
-       local("Lato-LightItalic"),
-       url("../fonts/Lato-LightItalic.ttf") format("truetype");
-}
-
-@font-face {
-  font-family: "Lato";
-  font-style: normal;
-  font-weight: 700;
-  src: local("Lato Regular"),
-       local("Lato-Regular"),
-       url("../fonts/Lato-Regular.ttf") format("truetype");
-}
-
-@font-face {
-  font-family: "Lato";
-  font-style: italic;
-  font-weight: 700;
-  src: local("Lato Italic"),
-       local("Lato-Italic"),
-       url("../fonts/Lato-RegularItalic.ttf") format("truetype");
-}
-
-/*
- * -----------------------------------------------------------
- * SIL OPEN FONT LICENSE Version 1.1 - 26 February 2007
- * -----------------------------------------------------------
- *
- * PREAMBLE
- * The goals of the Open Font License (OFL) are to stimulate worldwide
- * development of collaborative font projects, to support the font creation
- * efforts of academic and linguistic communities, and to provide a free and
- * open framework in which fonts may be shared and improved in partnership
- * with others.
- *
- * The OFL allows the licensed fonts to be used, studied, modified and
- * redistributed freely as long as they are not sold by themselves. The
- * fonts, including any derivative works, can be bundled, embedded,
- * redistributed and/or sold with any software provided that any reserved
- * names are not used by derivative works. The fonts and derivatives,
- * however, cannot be released under any other type of license. The
- * requirement for fonts to remain under this license does not apply
- * to any document created using the fonts or their derivatives.
- *
- * DEFINITIONS
- * "Font Software" refers to the set of files released by the Copyright
- * Holder(s) under this license and clearly marked as such. This may
- * include source files, build scripts and documentation.
- *
- * "Reserved Font Name" refers to any names specified as such after the
- * copyright statement(s).
- *
- * "Original Version" refers to the collection of Font Software components as
- * distributed by the Copyright Holder(s).
- *
- * "Modified Version" refers to any derivative made by adding to, deleting,
- * or substituting -- in part or in whole -- any of the components of the
- * Original Version, by changing formats or by porting the Font Software to a
- * new environment.
- *
- * "Author" refers to any designer, engineer, programmer, technical
- * writer or other person who contributed to the Font Software.
- *
- * PERMISSION & CONDITIONS
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of the Font Software, to use, study, copy, merge, embed, modify,
- * redistribute, and sell modified and unmodified copies of the Font
- * Software, subject to the following conditions:
- *
- * 1) Neither the Font Software nor any of its individual components,
- * in Original or Modified Versions, may be sold by itself.
- *
- * 2) Original or Modified Versions of the Font Software may be bundled,
- * redistributed and/or sold with any software, provided that each copy
- * contains the above copyright notice and this license. These can be
- * included either as stand-alone text files, human-readable headers or
- * in the appropriate machine-readable metadata fields within text or
- * binary files as long as those fields can be easily viewed by the user.
- *
- * 3) No Modified Version of the Font Software may use the Reserved Font
- * Name(s) unless explicit written permission is granted by the corresponding
- * Copyright Holder. This restriction only applies to the primary font name as
- * presented to the users.
- *
- * 4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
- * Software shall not be used to promote, endorse or advertise any
- * Modified Version, except to acknowledge the contribution(s) of the
- * Copyright Holder(s) and the Author(s) or with their explicit written
- * permission.
- *
- * 5) The Font Software, modified or unmodified, in part or in whole,
- * must be distributed entirely under this license, and must not be
- * distributed under any other license. The requirement for fonts to
- * remain under this license does not apply to any document created
- * using the Font Software.
- *
- * TERMINATION
- * This license becomes null and void if any of the above conditions are
- * not met.
- *
- * DISCLAIMER
- * THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
- * OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
- * COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- * INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
- * DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
- * OTHER DEALINGS IN THE FONT SOFTWARE.
- */
-
diff --git a/lib/rdoc/generator/template/darkfish/css/rdoc.css b/lib/rdoc/generator/template/darkfish/css/rdoc.css
deleted file mode 100644
index 2cc55e03b1..0000000000
--- a/lib/rdoc/generator/template/darkfish/css/rdoc.css
+++ /dev/null
@@ -1,687 +0,0 @@
-/*
- * "Darkfish" Rdoc CSS
- * $Id: rdoc.css 54 2009-01-27 01:09:48Z deveiant $
- *
- * Author: Michael Granger <ged@FaerieMUD.org>
- *
- */
-
-/* vim: ft=css et sw=2 ts=2 sts=2 */
-/* Base Green is: #6C8C22 */
-
-.hide { display: none !important; }
-
-* { padding: 0; margin: 0; }
-
-body {
-  background: #fafafa;
-  font-family: Lato, sans-serif;
-  font-weight: 300;
-
-  /* Layout */
-  display: grid;
-  grid-template-columns: auto 1fr;
-}
-
-body > :last-child {
-  grid-column: 1 / 3;
-}
-
-h1 span,
-h2 span,
-h3 span,
-h4 span,
-h5 span,
-h6 span {
-  position: relative;
-
-  display: none;
-  padding-left: 1em;
-  line-height: 0;
-  vertical-align: baseline;
-  font-size: 10px;
-}
-
-h1 span { top: -1.3em; }
-h2 span { top: -1.2em; }
-h3 span { top: -1.0em; }
-h4 span { top: -0.8em; }
-h5 span { top: -0.5em; }
-h6 span { top: -0.5em; }
-
-h1:hover span,
-h2:hover span,
-h3:hover span,
-h4:hover span,
-h5:hover span,
-h6:hover span {
-  display: inline;
-}
-
-h1:target,
-h2:target,
-h3:target,
-h4:target,
-h5:target,
-h6:target {
-  margin-left: -10px;
-  border-left: 10px solid #f1edba;
-}
-
-:link,
-:visited {
-  color: #6C8C22;
-  text-decoration: none;
-}
-
-:link:hover,
-:visited:hover {
-  border-bottom: 1px dotted #6C8C22;
-}
-
-code,
-pre {
-  font-family: "Source Code Pro", Monaco, monospace;
-  background-color: rgba(27,31,35,0.05);
-  padding: 0em 0.2em;
-  border-radius: 0.2em;
-}
-
-em {
-  text-decoration-color: rgba(52, 48, 64, 0.25);
-  text-decoration-line: underline;
-  text-decoration-style: dotted;
-}
-
-strong,
-em {
-  background-color: rgba(158, 178, 255, 0.1);
-}
-
-table {
-  margin: 0;
-  border-spacing: 0;
-  border-collapse: collapse;
-}
-
-table tr th, table tr td {
-  padding: 0.2em 0.4em;
-  border: 1px solid #ccc;
-}
-
-table tr th {
-  background-color: #eceaed;
-}
-
-table tr:nth-child(even) td {
-  background-color: #f5f4f6;
-}
-
-/* @group Generic Classes */
-
-.initially-hidden {
-  display: none;
-}
-
-#search-field {
-  width: 98%;
-  background: white;
-  border: none;
-  height: 1.5em;
-  -webkit-border-radius: 4px;
-  -moz-border-radius: 4px;
-  border-radius: 4px;
-  text-align: left;
-}
-#search-field:focus {
-  background: #f1edba;
-}
-#search-field:-moz-placeholder,
-#search-field::-webkit-input-placeholder {
-  font-weight: bold;
-  color: #666;
-}
-
-.missing-docs {
-  font-size: 120%;
-  background: white url(../images/wrench_orange.png) no-repeat 4px center;
-  color: #ccc;
-  line-height: 2em;
-  border: 1px solid #d00;
-  opacity: 1;
-  padding-left: 20px;
-  text-indent: 24px;
-  letter-spacing: 3px;
-  font-weight: bold;
-  -webkit-border-radius: 5px;
-  -moz-border-radius: 5px;
-}
-
-.target-section {
-  border: 2px solid #dcce90;
-  border-left-width: 8px;
-  padding: 0 1em;
-  background: #fff3c2;
-}
-
-/* @end */
-
-/* @group Index Page, Standalone file pages */
-.table-of-contents ul {
-  margin: 1em;
-  list-style: none;
-}
-
-.table-of-contents ul ul {
-  margin-top: 0.25em;
-}
-
-.table-of-contents ul :link,
-.table-of-contents ul :visited {
-  font-size: 16px;
-}
-
-.table-of-contents li {
-  margin-bottom: 0.25em;
-}
-
-.table-of-contents li .toc-toggle {
-  width: 16px;
-  height: 16px;
-  background: url(../images/add.png) no-repeat;
-}
-
-.table-of-contents li .toc-toggle.open {
-  background: url(../images/delete.png) no-repeat;
-}
-
-/* @end */
-
-/* @group Top-Level Structure */
-
-nav {
-  font-family: Helvetica, sans-serif;
-  font-size: 14px;
-  border-right: 1px solid #ccc;
-  position: sticky;
-  top: 0;
-  overflow: auto;
-
-  /* Layout */
-  width: 260px; /* fallback */
-  width: max(50px, 20vw);
-  min-width: 50px;
-  max-width: 80vw;
-  height: calc(100vh - 100px); /* reduce the footer height */
-  resize: horizontal;
-}
-
-main {
-  display: block;
-  margin: 1em;
-  min-width: 340px;
-  font-size: 16px;
-}
-
-main h1,
-main h2,
-main h3,
-main h4,
-main h5,
-main h6 {
-  font-family: Helvetica, sans-serif;
-}
-
-.table-of-contents main {
-  margin-left: 2em;
-}
-
-#validator-badges {
-  margin: 1em 1em 2em;
-  font-size: smaller;
-}
-
-/* @end */
-
-/* @group navigation */
-nav {
-  margin-bottom: 1em;
-}
-
-nav .nav-section {
-  margin-top: 2em;
-  border-top: 2px solid #aaa;
-  font-size: 90%;
-  overflow: hidden;
-}
-
-nav h2 {
-  margin: 0;
-  padding: 2px 8px 2px 8px;
-  background-color: #e8e8e8;
-  color: #555;
-  font-size: 125%;
-  text-align: center;
-}
-
-nav h3,
-#table-of-contents-navigation {
-  margin: 0;
-  padding: 2px 8px 2px 8px;
-  text-align: right;
-  background-color: #e8e8e8;
-  color: #555;
-}
-
-nav ul,
-nav dl,
-nav p {
-  padding: 4px 8px 0;
-  list-style: none;
-}
-
-#project-navigation .nav-section {
-  margin: 0;
-  border-top: 0;
-}
-
-#home-section h2 {
-  text-align: center;
-}
-
-#table-of-contents-navigation {
-  font-size: 1.2em;
-  font-weight: bold;
-  text-align: center;
-}
-
-#search-section {
-  margin-top: 0;
-  border-top: 0;
-}
-
-#search-field-wrapper {
-  border-top: 1px solid #aaa;
-  border-bottom: 1px solid #aaa;
-  padding: 3px 8px;
-  background-color: #e8e8e8;
-  color: #555;
-}
-
-ul.link-list li {
-  white-space: nowrap;
-  line-height: 1.4em;
-}
-
-ul.link-list .type {
-  font-size: 8px;
-  text-transform: uppercase;
-  color: white;
-  background: #969696;
-  padding: 2px 4px;
-  -webkit-border-radius: 5px;
-}
-
-dl.note-list dt {
-  float: left;
-  margin-right: 1em;
-}
-
-.calls-super {
-  background: url(../images/arrow_up.png) no-repeat right center;
-}
-
-.nav-section details > summary {
-  display: block;
-}
-
-.nav-section details > summary::-webkit-details-marker {
-  display: none;
-}
-
-.nav-section details > summary::before {
-  content: "";
-}
-
-.nav-section details > summary::after {
-  content: "\25B6"; /* BLACK RIGHT-POINTING TRIANGLE */
-  font-size: 0.8em;
-  margin-left: 0.4em;
-}
-
-.nav-section details[open] > summary::after {
-  content: "\25BD"; /* WHITE DOWN-POINTING TRIANGLE */
-}
-
-/* @end */
-
-/* @group Documentation Section */
-main {
-  color: #333;
-}
-
-main > h1:first-child,
-main > h2:first-child,
-main > h3:first-child,
-main > h4:first-child,
-main > h5:first-child,
-main > h6:first-child {
-  margin-top: 0px;
-}
-
-main sup {
-  vertical-align: super;
-  font-size: 0.8em;
-}
-
-/* The heading with the class name */
-main h1[class] {
-  margin-top: 0;
-  margin-bottom: 1em;
-  font-size: 2em;
-  color: #6C8C22;
-}
-
-main h1 {
-  margin: 2em 0 0.5em;
-  font-size: 1.7em;
-}
-
-main h2 {
-  margin: 2em 0 0.5em;
-  font-size: 1.5em;
-}
-
-main h3 {
-  margin: 2em 0 0.5em;
-  font-size: 1.2em;
-}
-
-main h4 {
-  margin: 2em 0 0.5em;
-  font-size: 1.1em;
-}
-
-main h5 {
-  margin: 2em 0 0.5em;
-  font-size: 1em;
-}
-
-main h6 {
-  margin: 2em 0 0.5em;
-  font-size: 1em;
-}
-
-main p {
-  margin: 0 0 0.5em;
-  line-height: 1.4em;
-}
-
-main pre {
-  margin: 1.2em 0.5em;
-  padding: 1em;
-  font-size: 0.8em;
-}
-
-main hr {
-  margin: 1.5em 1em;
-  border: 2px solid #ddd;
-}
-
-main blockquote {
-  margin: 0 2em 1.2em 1.2em;
-  padding-left: 0.5em;
-  border-left: 2px solid #ddd;
-}
-
-main ol,
-main ul {
-  margin: 1em 2em;
-}
-
-main li > p {
-  margin-bottom: 0.5em;
-}
-
-main dl {
-  margin: 1em 0.5em;
-}
-
-main dt {
-  margin-bottom: 0.5em;
-  font-weight: bold;
-}
-
-main dd {
-  margin: 0 1em 1em 0.5em;
-}
-
-main header h2 {
-  margin-top: 2em;
-  border-width: 0;
-  border-top: 4px solid #bbb;
-  font-size: 130%;
-}
-
-main header h3 {
-  margin: 2em 0 1.5em;
-  border-width: 0;
-  border-top: 3px solid #bbb;
-  font-size: 120%;
-}
-
-.documentation-section-title {
-  position: relative;
-}
-.documentation-section-title .section-click-top {
-  position: absolute;
-  top: 6px;
-  left: 12px;
-  font-size: 10px;
-  color: #9b9877;
-  visibility: hidden;
-  padding-left: 0.5px;
-}
-
-.documentation-section-title:hover .section-click-top {
-  visibility: visible;
-}
-
-.constants-list > dl {
-  margin: 1em 0 2em;
-  border: 0;
-}
-
-.constants-list > dl dt {
-  margin-bottom: 0.75em;
-  padding-left: 0;
-  font-family: "Source Code Pro", Monaco, monospace;
-  font-size: 110%;
-}
-
-.constants-list > dl dt a {
-  color: inherit;
-}
-
-.constants-list > dl dd {
-  margin: 0 0 2em 0;
-  padding: 0;
-  color: #666;
-}
-
-.documentation-section h2 {
-  position: relative;
-}
-
-.documentation-section h2 a {
-  position: absolute;
-  top: 8px;
-  right: 10px;
-  font-size: 12px;
-  color: #9b9877;
-  visibility: hidden;
-}
-
-.documentation-section h2:hover a {
-  visibility: visible;
-}
-
-/* @group Method Details */
-
-main .method-source-code {
-  max-height: 0;
-  overflow: auto;
-  transition-duration: 200ms;
-  transition-delay: 0ms;
-  transition-property: all;
-  transition-timing-function: ease-in-out;
-}
-
-main .method-source-code.active-menu {
-  max-height: 100vh;
-}
-
-main .method-description .method-calls-super {
-  color: #333;
-  font-weight: bold;
-}
-
-main .method-detail {
-  margin-bottom: 2.5em;
-  cursor: pointer;
-}
-
-main .method-detail:target {
-  margin-left: -10px;
-  border-left: 10px solid #f1edba;
-}
-
-main .method-heading {
-  position: relative;
-  font-family: "Source Code Pro", Monaco, monospace;
-  font-size: 110%;
-  font-weight: bold;
-  color: #333;
-}
-main .method-heading :link,
-main .method-heading :visited {
-  color: inherit;
-}
-main .method-click-advice {
-  position: absolute;
-  top: 2px;
-  right: 5px;
-  font-size: 12px;
-  color: #9b9877;
-  visibility: hidden;
-  padding-right: 20px;
-  line-height: 20px;
-  background: url(../images/zoom.png) no-repeat right top;
-}
-main .method-header:hover .method-click-advice {
-  visibility: visible;
-}
-
-main .method-alias .method-heading {
-  color: #666;
-}
-
-main .method-description,
-main .aliases {
-  margin-top: 0.75em;
-  color: #333;
-}
-
-main .aliases {
-  padding-top: 4px;
-  font-style: italic;
-  cursor: default;
-}
-main .method-description ul {
-  margin-left: 1.5em;
-}
-
-main #attribute-method-details .method-detail:hover {
-  background-color: transparent;
-  cursor: default;
-}
-main .attribute-access-type {
-  text-transform: uppercase;
-  padding: 0 1em;
-}
-/* @end */
-
-/* @end */
-
-/* @group Source Code */
-
-pre {
-  margin: 0.5em 0;
-  border: 1px dashed #999;
-  padding: 0.5em;
-  background: #262626;
-  color: white;
-  overflow: auto;
-}
-
-.ruby-constant   { color: #7fffd4; background: transparent; }
-.ruby-keyword    { color: #00ffff; background: transparent; }
-.ruby-ivar       { color: #eedd82; background: transparent; }
-.ruby-operator   { color: #00ffee; background: transparent; }
-.ruby-identifier { color: #ffdead; background: transparent; }
-.ruby-node       { color: #ffa07a; background: transparent; }
-.ruby-comment    { color: #dc0000; background: transparent; }
-.ruby-regexp     { color: #ffa07a; background: transparent; }
-.ruby-value      { color: #7fffd4; background: transparent; }
-
-/* @end */
-
-
-/* @group search results */
-#search-results {
-  font-family: Lato, sans-serif;
-  font-weight: 300;
-}
-
-#search-results .search-match {
-  font-family: Helvetica, sans-serif;
-  font-weight: normal;
-}
-
-#search-results .search-selected {
-  background: #e8e8e8;
-  border-bottom: 1px solid transparent;
-}
-
-#search-results li {
-  list-style: none;
-  border-bottom: 1px solid #aaa;
-  margin-bottom: 0.5em;
-}
-
-#search-results li:last-child {
-  border-bottom: none;
-  margin-bottom: 0;
-}
-
-#search-results li p {
-  padding: 0;
-  margin: 0.5em;
-}
-
-#search-results .search-namespace {
-  font-weight: bold;
-}
-
-#search-results li em {
-  background: yellow;
-  font-style: normal;
-}
-
-#search-results pre {
-  margin: 0.5em;
-  font-family: "Source Code Pro", Monaco, monospace;
-}
-
-/* @end */
-
diff --git a/lib/rdoc/generator/template/darkfish/fonts/Lato-Light.ttf b/lib/rdoc/generator/template/darkfish/fonts/Lato-Light.ttf
deleted file mode 100644
index b49dd43729..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/Lato-Light.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/fonts/Lato-LightItalic.ttf b/lib/rdoc/generator/template/darkfish/fonts/Lato-LightItalic.ttf
deleted file mode 100644
index 7959fef075..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/Lato-LightItalic.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/fonts/Lato-Regular.ttf b/lib/rdoc/generator/template/darkfish/fonts/Lato-Regular.ttf
deleted file mode 100644
index 839cd589dc..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/Lato-Regular.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/fonts/Lato-RegularItalic.ttf b/lib/rdoc/generator/template/darkfish/fonts/Lato-RegularItalic.ttf
deleted file mode 100644
index bababa09e3..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/Lato-RegularItalic.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Bold.ttf b/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Bold.ttf
deleted file mode 100644
index dd00982d49..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Bold.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Regular.ttf b/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Regular.ttf
deleted file mode 100644
index 1decfb95af..0000000000
--- a/lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Regular.ttf
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/add.png b/lib/rdoc/generator/template/darkfish/images/add.png
deleted file mode 100644
index 6332fefea4..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/add.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/arrow_up.png b/lib/rdoc/generator/template/darkfish/images/arrow_up.png
deleted file mode 100644
index 1ebb193243..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/arrow_up.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/brick.png b/lib/rdoc/generator/template/darkfish/images/brick.png
deleted file mode 100644
index 7851cf34c9..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/brick.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/brick_link.png b/lib/rdoc/generator/template/darkfish/images/brick_link.png
deleted file mode 100644
index 9ebf013a23..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/brick_link.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/bug.png b/lib/rdoc/generator/template/darkfish/images/bug.png
deleted file mode 100644
index 2d5fb90ec6..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/bug.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/bullet_black.png b/lib/rdoc/generator/template/darkfish/images/bullet_black.png
deleted file mode 100644
index 57619706d1..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/bullet_black.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/bullet_toggle_minus.png b/lib/rdoc/generator/template/darkfish/images/bullet_toggle_minus.png
deleted file mode 100644
index b47ce55f68..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/bullet_toggle_minus.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/bullet_toggle_plus.png b/lib/rdoc/generator/template/darkfish/images/bullet_toggle_plus.png
deleted file mode 100644
index 9ab4a89664..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/bullet_toggle_plus.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/date.png b/lib/rdoc/generator/template/darkfish/images/date.png
deleted file mode 100644
index 783c83357f..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/date.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/delete.png b/lib/rdoc/generator/template/darkfish/images/delete.png
deleted file mode 100644
index 08f249365a..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/delete.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/find.png b/lib/rdoc/generator/template/darkfish/images/find.png
deleted file mode 100644
index 1547479646..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/find.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/loadingAnimation.gif b/lib/rdoc/generator/template/darkfish/images/loadingAnimation.gif
deleted file mode 100644
index 82290f4833..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/loadingAnimation.gif
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/macFFBgHack.png b/lib/rdoc/generator/template/darkfish/images/macFFBgHack.png
deleted file mode 100644
index c6473b324e..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/macFFBgHack.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/package.png b/lib/rdoc/generator/template/darkfish/images/package.png
deleted file mode 100644
index da3c2a2d74..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/package.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/page_green.png b/lib/rdoc/generator/template/darkfish/images/page_green.png
deleted file mode 100644
index de8e003f9f..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/page_green.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/page_white_text.png b/lib/rdoc/generator/template/darkfish/images/page_white_text.png
deleted file mode 100644
index 813f712f72..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/page_white_text.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/page_white_width.png b/lib/rdoc/generator/template/darkfish/images/page_white_width.png
deleted file mode 100644
index 1eb880947d..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/page_white_width.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/plugin.png b/lib/rdoc/generator/template/darkfish/images/plugin.png
deleted file mode 100644
index 6187b15aec..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/plugin.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/ruby.png b/lib/rdoc/generator/template/darkfish/images/ruby.png
deleted file mode 100644
index f763a16880..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/ruby.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/tag_blue.png b/lib/rdoc/generator/template/darkfish/images/tag_blue.png
deleted file mode 100644
index 3f02b5f8f8..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/tag_blue.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/tag_green.png b/lib/rdoc/generator/template/darkfish/images/tag_green.png
deleted file mode 100644
index 83ec984bd7..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/tag_green.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/transparent.png b/lib/rdoc/generator/template/darkfish/images/transparent.png
deleted file mode 100644
index d665e179ef..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/transparent.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/wrench.png b/lib/rdoc/generator/template/darkfish/images/wrench.png
deleted file mode 100644
index 5c8213fef5..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/wrench.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/wrench_orange.png b/lib/rdoc/generator/template/darkfish/images/wrench_orange.png
deleted file mode 100644
index 565a9330e0..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/wrench_orange.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/images/zoom.png b/lib/rdoc/generator/template/darkfish/images/zoom.png
deleted file mode 100644
index 908612e394..0000000000
--- a/lib/rdoc/generator/template/darkfish/images/zoom.png
+++ /dev/null
diff --git a/lib/rdoc/generator/template/darkfish/index.rhtml b/lib/rdoc/generator/template/darkfish/index.rhtml
deleted file mode 100644
index 423e225b68..0000000000
--- a/lib/rdoc/generator/template/darkfish/index.rhtml
+++ /dev/null
@@ -1,22 +0,0 @@
-<body id="top" role="document" class="file">
-<nav role="navigation">
-  <div id="project-navigation">
-    <%= render '_sidebar_navigation.rhtml' %>
-
-    <%= render '_sidebar_search.rhtml' %>
-  </div>
-
-  <div id="project-metadata">
-    <%= render '_sidebar_pages.rhtml' %>
-    <%= render '_sidebar_classes.rhtml' %>
-  </div>
-</nav>
-
-<main role="main">
-<%- if @options.main_page and
-      main_page = @files.find { |f| f.full_name == @options.main_page } then %>
-<%= main_page.description %>
-<%- else -%>
-<p>This is the API documentation for <%= h @title %>.
-<%- end -%>
-</main>
diff --git a/lib/rdoc/generator/template/darkfish/js/darkfish.js b/lib/rdoc/generator/template/darkfish/js/darkfish.js
deleted file mode 100644
index 19a85c54e1..0000000000
--- a/lib/rdoc/generator/template/darkfish/js/darkfish.js
+++ /dev/null
@@ -1,97 +0,0 @@
-/**
- *
- * Darkfish Page Functions
- * $Id: darkfish.js 53 2009-01-07 02:52:03Z deveiant $
- *
- * Author: Michael Granger <mgranger@laika.com>
- *
- */
-
-/* Provide console simulation for firebug-less environments */
-/*
-if (!("console" in window) || !("firebug" in console)) {
-  var names = ["log", "debug", "info", "warn", "error", "assert", "dir", "dirxml",
-    "group", "groupEnd", "time", "timeEnd", "count", "trace", "profile", "profileEnd"];
-
-  window.console = {};
-  for (var i = 0; i < names.length; ++i)
-    window.console[names[i]] = function() {};
-};
-*/
-
-
-function showSource( e ) {
-  var target = e.target;
-  while (!target.classList.contains('method-detail')) {
-    target = target.parentNode;
-  }
-  if (typeof target !== "undefined" && target !== null) {
-    target = target.querySelector('.method-source-code');
-  }
-  if (typeof target !== "undefined" && target !== null) {
-    target.classList.toggle('active-menu')
-  }
-};
-
-function hookSourceViews() {
-  document.querySelectorAll('.method-heading').forEach(function (codeObject) {
-    codeObject.addEventListener('click', showSource);
-  });
-};
-
-function hookSearch() {
-  var input  = document.querySelector('#search-field');
-  var result = document.querySelector('#search-results');
-  result.classList.remove("initially-hidden");
-
-  var search_section = document.querySelector('#search-section');
-  search_section.classList.remove("initially-hidden");
-
-  var search = new Search(search_data, input, result);
-
-  search.renderItem = function(result) {
-    var li = document.createElement('li');
-    var html = '';
-
-    // TODO add relative path to <script> per-page
-    html += '<p class="search-match"><a href="' + index_rel_prefix + this.escapeHTML(result.path) + '">' + this.hlt(result.title);
-    if (result.params)
-      html += '<span class="params">' + result.params + '</span>';
-    html += '</a>';
-
-
-    if (result.namespace)
-      html += '<p class="search-namespace">' + this.hlt(result.namespace);
-
-    if (result.snippet)
-      html += '<div class="search-snippet">' + result.snippet + '</div>';
-
-    li.innerHTML = html;
-
-    return li;
-  }
-
-  search.select = function(result) {
-    window.location.href = result.firstChild.firstChild.href;
-  }
-
-  search.scrollIntoView = search.scrollInWindow;
-};
-
-function hookFocus() {
-  document.addEventListener("keydown", (event) => {
-    if (document.activeElement.tagName === 'INPUT') {
-      return;
-    }
-    if (event.key === "/") {
-      event.preventDefault();
-      document.querySelector('#search-field').focus();
-    }
-  });
-}
-
-document.addEventListener('DOMContentLoaded', function() {
-  hookSourceViews();
-  hookSearch();
-  hookFocus();
-});
diff --git a/lib/rdoc/generator/template/darkfish/js/search.js b/lib/rdoc/generator/template/darkfish/js/search.js
deleted file mode 100644
index d3cded1d57..0000000000
--- a/lib/rdoc/generator/template/darkfish/js/search.js
+++ /dev/null
@@ -1,110 +0,0 @@
-Search = function(data, input, result) {
-  this.data = data;
-  this.input = input;
-  this.result = result;
-
-  this.current = null;
-  this.view = this.result.parentNode;
-  this.searcher = new Searcher(data.index);
-  this.init();
-}
-
-Search.prototype = Object.assign({}, Navigation, new function() {
-  var suid = 1;
-
-  this.init = function() {
-    var _this = this;
-    var observer = function(e) {
-      switch(e.key) {
-        case 'ArrowUp':
-        case 'ArrowDown':
-          return;
-      }
-      _this.search(_this.input.value);
-    };
-    this.input.addEventListener('keyup', observer);
-    this.input.addEventListener('click', observer); // mac's clear field
-
-    this.searcher.ready(function(results, isLast) {
-      _this.addResults(results, isLast);
-    })
-
-    this.initNavigation();
-    this.setNavigationActive(false);
-  }
-
-  this.search = function(value, selectFirstMatch) {
-    value = value.trim().toLowerCase();
-    if (value) {
-      this.setNavigationActive(true);
-    } else {
-      this.setNavigationActive(false);
-    }
-
-    if (value == '') {
-      this.lastQuery = value;
-      this.result.innerHTML = '';
-      this.result.setAttribute('aria-expanded', 'false');
-      this.setNavigationActive(false);
-    } else if (value != this.lastQuery) {
-      this.lastQuery = value;
-      this.result.setAttribute('aria-busy',     'true');
-      this.result.setAttribute('aria-expanded', 'true');
-      this.firstRun = true;
-      this.searcher.find(value);
-    }
-  }
-
-  this.addResults = function(results, isLast) {
-    var target = this.result;
-    if (this.firstRun && (results.length > 0 || isLast)) {
-      this.current = null;
-      this.result.innerHTML = '';
-    }
-
-    for (var i=0, l = results.length; i < l; i++) {
-      var item = this.renderItem.call(this, results[i]);
-      item.setAttribute('id', 'search-result-' + target.childElementCount);
-      target.appendChild(item);
-    };
-
-    if (this.firstRun && results.length > 0) {
-      this.firstRun = false;
-      this.current = target.firstChild;
-      this.current.classList.add('search-selected');
-    }
-    //TODO: ECMAScript
-    //if (jQuery.browser.msie) this.$element[0].className += '';
-
-    if (isLast) this.result.setAttribute('aria-busy', 'false');
-  }
-
-  this.move = function(isDown) {
-    if (!this.current) return;
-    var next = isDown ? this.current.nextElementSibling : this.current.previousElementSibling;
-    if (next) {
-      this.current.classList.remove('search-selected');
-      next.classList.add('search-selected');
-      this.input.setAttribute('aria-activedescendant', next.getAttribute('id'));
-      this.scrollIntoView(next, this.view);
-      this.current = next;
-      this.input.value = next.firstChild.firstChild.text;
-      this.input.select();
-    }
-    return true;
-  }
-
-  this.hlt = function(html) {
-    return this.escapeHTML(html).
-      replace(/\u0001/g, '<em>').
-      replace(/\u0002/g, '</em>');
-  }
-
-  this.escapeHTML = function(html) {
-    return html.replace(/[&<>"`']/g, function(c) {
-      return '&#' + c.charCodeAt(0) + ';';
-    });
-  }
-
-});
-
diff --git a/lib/rdoc/generator/template/darkfish/page.rhtml b/lib/rdoc/generator/template/darkfish/page.rhtml
deleted file mode 100644
index 4a6b006bb3..0000000000
--- a/lib/rdoc/generator/template/darkfish/page.rhtml
+++ /dev/null
@@ -1,18 +0,0 @@
-<body id="top" role="document" class="file">
-<nav role="navigation">
-  <div id="project-navigation">
-    <%= render '_sidebar_navigation.rhtml' %>
-    <%= render '_sidebar_search.rhtml' %>
-  </div>
-
-  <%= render '_sidebar_table_of_contents.rhtml' %>
-
-  <div id="project-metadata">
-    <%= render '_sidebar_pages.rhtml' %>
-  </div>
-</nav>
-
-<main role="main" aria-label="Page <%=h file.full_name%>">
-<%= file.description %>
-</main>
-
diff --git a/lib/rdoc/generator/template/darkfish/servlet_not_found.rhtml b/lib/rdoc/generator/template/darkfish/servlet_not_found.rhtml
deleted file mode 100644
index f0841572c3..0000000000
--- a/lib/rdoc/generator/template/darkfish/servlet_not_found.rhtml
+++ /dev/null
@@ -1,18 +0,0 @@
-<body role="document">
-<nav role="navigation">
-  <%= render '_sidebar_navigation.rhtml' %>
-
-  <%= render '_sidebar_search.rhtml' %>
-
-  <div id="project-metadata">
-    <%= render '_sidebar_pages.rhtml' %>
-    <%= render '_sidebar_classes.rhtml' %>
-  </div>
-</nav>
-
-<main role="main">
-  <h1>Not Found</h1>
-
-  <p><%= message %>
-</main>
-
diff --git a/lib/rdoc/generator/template/darkfish/servlet_root.rhtml b/lib/rdoc/generator/template/darkfish/servlet_root.rhtml
deleted file mode 100644
index cab3092b17..0000000000
--- a/lib/rdoc/generator/template/darkfish/servlet_root.rhtml
+++ /dev/null
@@ -1,62 +0,0 @@
-<body role="document">
-<nav role="navigation">
-  <div id="project-navigation">
-    <div id="home-section" class="nav-section">
-      <h2>
-        <a href="<%= rel_prefix %>/" rel="home">Home</a>
-      </h2>
-    </div>
-
-    <%= render '_sidebar_search.rhtml' %>
-  </div>
-
-<%= render '_sidebar_installed.rhtml' %>
-</nav>
-
-<main role="main">
-  <h1>Local RDoc Documentation</h1>
-
-  <p>Here you can browse local documentation from the ruby standard library and
-  your installed gems.
-
-<%- extra_dirs = installed.select { |_, _, _, type,| type == :extra } -%>
-<%- unless extra_dirs.empty? -%>
-  <h2>Extra Documentation Directories</h2>
-
-  <p>The following additional documentation directories are available:</p>
-
-  <ol>
-  <%- extra_dirs.each do |name, href, exists, _, path| -%>
-    <li>
-    <%- if exists -%>
-      <a href="<%= href %>"><%= h name %></a> (<%= h path %>)
-    <%- else -%>
-      <%= h name %> (<%= h path %>; <i>not available</i>)
-    <%- end -%>
-    </li>
-  <%- end -%>
-  </ol>
-<%- end -%>
-
-<%- gems = installed.select { |_, _, _, type,| type == :gem } -%>
-<%- missing = gems.reject { |_, _, exists,| exists } -%>
-<%- unless missing.empty? then -%>
-  <h2>Missing Gem Documentation</h2>
-
-  <p>You are missing documentation for some of your installed gems.
-  You can install missing documentation for gems by running
-  <kbd>gem rdoc --all</kbd>.  After installing the missing documentation you
-  only need to reload this page.  The newly created documentation will
-  automatically appear.
-
-  <p>You can also install documentation for a specific gem by running one of
-  the following commands.
-
-  <ul>
-  <%- names = missing.map { |name,| name.sub(/-([^-]*)$/, '') }.uniq -%>
-  <%- names.each do |name| -%>
-    <li><kbd>gem rdoc <%=h name %></kbd>
-  <%- end -%>
-  </ul>
-<%- end -%>
-</main>
diff --git a/lib/rdoc/generator/template/darkfish/table_of_contents.rhtml b/lib/rdoc/generator/template/darkfish/table_of_contents.rhtml
deleted file mode 100644
index 54a376c9e5..0000000000
--- a/lib/rdoc/generator/template/darkfish/table_of_contents.rhtml
+++ /dev/null
@@ -1,59 +0,0 @@
-<body id="top" class="table-of-contents">
-<main role="main">
-<h1 class="class"><%= h @title %></h1>
-
-<%- simple_files = @files.select { |f| f.text? } -%>
-<%- unless simple_files.empty? then -%>
-<h2 id="pages">Pages</h2>
-<ul>
-<%- simple_files.sort.each do |file| -%>
-  <li class="file">
-    <a href="<%= h file.path %>"><%= h file.page_name %></a>
-<%
-   # HACK table_of_contents should not exist on Document
-   table = file.parse(file.comment).table_of_contents
-   unless table.empty? then %>
-    <ul>
-<%- table.each do |heading| -%>
-      <li><a href="<%= h file.path %>#<%= heading.aref %>"><%= heading.plain_html %></a>
-<%-   end -%>
-    </ul>
-<%- end -%>
-  </li>
-  <%- end -%>
-</ul>
-<%- end -%>
-
-<h2 id="classes">Classes and Modules</h2>
-<ul>
-<%- @modsort.each do |klass| -%>
-  <li class="<%= klass.type %>">
-    <a href="<%= klass.path %>"><%= klass.full_name %></a>
-<%- table = []
-   table.concat klass.parse(klass.comment_location).table_of_contents
-   table.concat klass.section_contents
-
-   unless table.empty? then %>
-    <ul>
-<%- table.each do |item| -%>
-<%-   label = item.respond_to?(:label) ? item.label(klass) : item.aref -%>
-      <li><a href="<%= klass.path %>#<%= label %>"><%= item.plain_html %></a>
-<%- end -%>
-    </ul>
-<%- end -%>
-  </li>
-<%- end -%>
-</ul>
-
-<h2 id="methods">Methods</h2>
-<ul>
-<%- @store.all_classes_and_modules.flat_map do |mod|
-     mod.method_list
-   end.sort.each do |method| %>
-  <li class="method">
-    <a href="<%= method.path %>"><%= h method.pretty_name %></a>
-    &mdash;
-    <span class="container"><%= method.parent.full_name %></span>
-<%- end -%>
-</ul>
-</main>
diff --git a/lib/rdoc/generator/template/json_index/.document b/lib/rdoc/generator/template/json_index/.document
deleted file mode 100644
index 1713b67654..0000000000
--- a/lib/rdoc/generator/template/json_index/.document
+++ /dev/null
@@ -1 +0,0 @@
-# ignore all files in this directory
diff --git a/lib/rdoc/generator/template/json_index/js/navigation.js b/lib/rdoc/generator/template/json_index/js/navigation.js
deleted file mode 100644
index 137e3a0038..0000000000
--- a/lib/rdoc/generator/template/json_index/js/navigation.js
+++ /dev/null
@@ -1,105 +0,0 @@
-/*
- * Navigation allows movement using the arrow keys through the search results.
- *
- * When using this library you will need to set scrollIntoView to the
- * appropriate function for your layout.  Use scrollInWindow if the container
- * is not scrollable and scrollInElement if the container is a separate
- * scrolling region.
- */
-Navigation = new function() {
-  this.initNavigation = function() {
-    var _this = this;
-
-    document.addEventListener('keydown', function(e) {
-      _this.onkeydown(e);
-    });
-
-    this.navigationActive = true;
-  }
-
-  this.setNavigationActive = function(state) {
-    this.navigationActive = state;
-  }
-
-  this.onkeydown = function(e) {
-    if (!this.navigationActive) return;
-    switch(e.key) {
-      case 'ArrowLeft':
-        if (this.moveLeft()) e.preventDefault();
-        break;
-      case 'ArrowUp':
-        if (e.key == 'ArrowUp' || e.ctrlKey) {
-          if (this.moveUp()) e.preventDefault();
-        }
-        break;
-      case 'ArrowRight':
-        if (this.moveRight()) e.preventDefault();
-        break;
-      case 'ArrowDown':
-        if (e.key == 'ArrowDown' || e.ctrlKey) {
-          if (this.moveDown()) e.preventDefault();
-        }
-        break;
-      case 'Enter':
-        if (this.current) e.preventDefault();
-        this.select(this.current);
-        break;
-    }
-    if (e.ctrlKey && e.shiftKey) this.select(this.current);
-  }
-
-  this.moveRight = function() {
-  }
-
-  this.moveLeft = function() {
-  }
-
-  this.move = function(isDown) {
-  }
-
-  this.moveUp = function() {
-    return this.move(false);
-  }
-
-  this.moveDown = function() {
-    return this.move(true);
-  }
-
-  /*
-   * Scrolls to the given element in the scrollable element view.
-   */
-  this.scrollInElement = function(element, view) {
-    var offset, viewHeight, viewScroll, height;
-    offset = element.offsetTop;
-    height = element.offsetHeight;
-    viewHeight = view.offsetHeight;
-    viewScroll = view.scrollTop;
-
-    if (offset - viewScroll + height > viewHeight) {
-      view.scrollTop = offset - viewHeight + height;
-    }
-    if (offset < viewScroll) {
-      view.scrollTop = offset;
-    }
-  }
-
-  /*
-   * Scrolls to the given element in the window.  The second argument is
-   * ignored
-   */
-  this.scrollInWindow = function(element, ignored) {
-    var offset, viewHeight, viewScroll, height;
-    offset = element.offsetTop;
-    height = element.offsetHeight;
-    viewHeight = window.innerHeight;
-    viewScroll = window.scrollY;
-
-    if (offset - viewScroll + height > viewHeight) {
-      window.scrollTo(window.scrollX, offset - viewHeight + height);
-    }
-    if (offset < viewScroll) {
-      window.scrollTo(window.scrollX, offset);
-    }
-  }
-}
-
diff --git a/lib/rdoc/generator/template/json_index/js/searcher.js b/lib/rdoc/generator/template/json_index/js/searcher.js
deleted file mode 100644
index e200a168b0..0000000000
--- a/lib/rdoc/generator/template/json_index/js/searcher.js
+++ /dev/null
@@ -1,229 +0,0 @@
-Searcher = function(data) {
-  this.data = data;
-  this.handlers = [];
-}
-
-Searcher.prototype = new function() {
-  // search is performed in chunks of 1000 for non-blocking user input
-  var CHUNK_SIZE = 1000;
-  // do not try to find more than 100 results
-  var MAX_RESULTS = 100;
-  var huid = 1;
-  var suid = 1;
-  var runs = 0;
-
-  this.find = function(query) {
-    var queries = splitQuery(query);
-    var regexps = buildRegexps(queries);
-    var highlighters = buildHilighters(queries);
-    var state = { from: 0, pass: 0, limit: MAX_RESULTS, n: suid++};
-    var _this = this;
-
-    this.currentSuid = state.n;
-
-    if (!query) return;
-
-    var run = function() {
-      // stop current search thread if new search started
-      if (state.n != _this.currentSuid) return;
-
-      var results =
-        performSearch(_this.data, regexps, queries, highlighters, state);
-      var hasMore = (state.limit > 0 && state.pass < 4);
-
-      triggerResults.call(_this, results, !hasMore);
-      if (hasMore) {
-        setTimeout(run, 2);
-      }
-      runs++;
-    };
-    runs = 0;
-
-    // start search thread
-    run();
-  }
-
-  /*  ----- Events ------  */
-  this.ready = function(fn) {
-    fn.huid = huid;
-    this.handlers.push(fn);
-  }
-
-  /*  ----- Utilities ------  */
-  function splitQuery(query) {
-    return query.split(/(\s+|::?|\(\)?)/).filter(function(string) {
-      return string.match(/\S/);
-    });
-  }
-
-  function buildRegexps(queries) {
-    return queries.map(function(query) {
-      return new RegExp(query.replace(/(.)/g, '([$1])([^$1]*?)'), 'i');
-    });
-  }
-
-  function buildHilighters(queries) {
-    return queries.map(function(query) {
-      return query.split('').map(function(l, i) {
-        return '\u0001$' + (i*2+1) + '\u0002$' + (i*2+2);
-      }).join('');
-    });
-  }
-
-  // function longMatchRegexp(index, longIndex, regexps) {
-  //     for (var i = regexps.length - 1; i >= 0; i--){
-  //         if (!index.match(regexps[i]) && !longIndex.match(regexps[i])) return false;
-  //     };
-  //     return true;
-  // }
-
-
-  /*  ----- Mathchers ------  */
-
-  /*
-   * This record matches if the index starts with queries[0] and the record
-   * matches all of the regexps
-   */
-  function matchPassBeginning(index, longIndex, queries, regexps) {
-    if (index.indexOf(queries[0]) != 0) return false;
-    for (var i=1, l = regexps.length; i < l; i++) {
-      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
-        return false;
-    };
-    return true;
-  }
-
-  /*
-   * This record matches if the longIndex starts with queries[0] and the
-   * longIndex matches all of the regexps
-   */
-  function matchPassLongIndex(index, longIndex, queries, regexps) {
-    if (longIndex.indexOf(queries[0]) != 0) return false;
-    for (var i=1, l = regexps.length; i < l; i++) {
-      if (!longIndex.match(regexps[i]))
-        return false;
-    };
-    return true;
-  }
-
-  /*
-   * This record matches if the index contains queries[0] and the record
-   * matches all of the regexps
-   */
-  function matchPassContains(index, longIndex, queries, regexps) {
-    if (index.indexOf(queries[0]) == -1) return false;
-    for (var i=1, l = regexps.length; i < l; i++) {
-      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
-        return false;
-    };
-    return true;
-  }
-
-  /*
-   * This record matches if regexps[0] matches the index and the record
-   * matches all of the regexps
-   */
-  function matchPassRegexp(index, longIndex, queries, regexps) {
-    if (!index.match(regexps[0])) return false;
-    for (var i=1, l = regexps.length; i < l; i++) {
-      if (!index.match(regexps[i]) && !longIndex.match(regexps[i]))
-        return false;
-    };
-    return true;
-  }
-
-
-  /*  ----- Highlighters ------  */
-  function highlightRegexp(info, queries, regexps, highlighters) {
-    var result = createResult(info);
-    for (var i=0, l = regexps.length; i < l; i++) {
-      result.title = result.title.replace(regexps[i], highlighters[i]);
-      result.namespace = result.namespace.replace(regexps[i], highlighters[i]);
-    };
-    return result;
-  }
-
-  function hltSubstring(string, pos, length) {
-    return string.substring(0, pos) + '\u0001' + string.substring(pos, pos + length) + '\u0002' + string.substring(pos + length);
-  }
-
-  function highlightQuery(info, queries, regexps, highlighters) {
-    var result = createResult(info);
-    var pos = 0;
-    var lcTitle = result.title.toLowerCase();
-
-    pos = lcTitle.indexOf(queries[0]);
-    if (pos != -1) {
-      result.title = hltSubstring(result.title, pos, queries[0].length);
-    }
-
-    result.namespace = result.namespace.replace(regexps[0], highlighters[0]);
-    for (var i=1, l = regexps.length; i < l; i++) {
-      result.title = result.title.replace(regexps[i], highlighters[i]);
-      result.namespace = result.namespace.replace(regexps[i], highlighters[i]);
-    };
-    return result;
-  }
-
-  function createResult(info) {
-    var result = {};
-    result.title = info[0];
-    result.namespace = info[1];
-    result.path = info[2];
-    result.params = info[3];
-    result.snippet = info[4];
-    result.badge = info[6];
-    return result;
-  }
-
-  /*  ----- Searching ------  */
-  function performSearch(data, regexps, queries, highlighters, state) {
-    var searchIndex = data.searchIndex;
-    var longSearchIndex = data.longSearchIndex;
-    var info = data.info;
-    var result = [];
-    var i = state.from;
-    var l = searchIndex.length;
-    var togo = CHUNK_SIZE;
-    var matchFunc, hltFunc;
-
-    while (state.pass < 4 && state.limit > 0 && togo > 0) {
-      if (state.pass == 0) {
-        matchFunc = matchPassBeginning;
-        hltFunc = highlightQuery;
-      } else if (state.pass == 1) {
-        matchFunc = matchPassLongIndex;
-        hltFunc = highlightQuery;
-      } else if (state.pass == 2) {
-        matchFunc = matchPassContains;
-        hltFunc = highlightQuery;
-      } else if (state.pass == 3) {
-        matchFunc = matchPassRegexp;
-        hltFunc = highlightRegexp;
-      }
-
-      for (; togo > 0 && i < l && state.limit > 0; i++, togo--) {
-        if (info[i].n == state.n) continue;
-        if (matchFunc(searchIndex[i], longSearchIndex[i], queries, regexps)) {
-          info[i].n = state.n;
-          result.push(hltFunc(info[i], queries, regexps, highlighters));
-          state.limit--;
-        }
-      };
-      if (searchIndex.length <= i) {
-        state.pass++;
-        i = state.from = 0;
-      } else {
-        state.from = i;
-      }
-    }
-    return result;
-  }
-
-  function triggerResults(results, isLast) {
-    this.handlers.forEach(function(fn) {
-      fn.call(this, results, isLast)
-    });
-  }
-}
-
diff --git a/lib/rdoc/ghost_method.rb b/lib/rdoc/ghost_method.rb
deleted file mode 100644
index 25f951e35e..0000000000
--- a/lib/rdoc/ghost_method.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-# frozen_string_literal: true
-##
-# GhostMethod represents a method referenced only by a comment
-
-class RDoc::GhostMethod < RDoc::AnyMethod
-end
diff --git a/lib/rdoc/i18n.rb b/lib/rdoc/i18n.rb
deleted file mode 100644
index f209a9a6f6..0000000000
--- a/lib/rdoc/i18n.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-# frozen_string_literal: true
-##
-# This module provides i18n related features.
-
-module RDoc::I18n
-
-  autoload :Locale, "#{__dir__}/i18n/locale"
-  require_relative 'i18n/text'
-
-end
diff --git a/lib/rdoc/i18n/locale.rb b/lib/rdoc/i18n/locale.rb
deleted file mode 100644
index 6a70d6c986..0000000000
--- a/lib/rdoc/i18n/locale.rb
+++ /dev/null
@@ -1,102 +0,0 @@
-# frozen_string_literal: true
-##
-# A message container for a locale.
-#
-# This object provides the following two features:
-#
-#   * Loads translated messages from .po file.
-#   * Translates a message into the locale.
-
-class RDoc::I18n::Locale
-
-  @@locales = {} # :nodoc:
-
-  class << self
-
-    ##
-    # Returns the locale object for +locale_name+.
-
-    def [](locale_name)
-      @@locales[locale_name] ||= new(locale_name)
-    end
-
-    ##
-    # Sets the locale object for +locale_name+.
-    #
-    # Normally, this method is not used. This method is useful for
-    # testing.
-
-    def []=(locale_name, locale)
-      @@locales[locale_name] = locale
-    end
-
-  end
-
-  ##
-  # The name of the locale. It uses IETF language tag format
-  # +[language[_territory][.codeset][@modifier]]+.
-  #
-  # See also {BCP 47 - Tags for Identifying
-  # Languages}[http://tools.ietf.org/rfc/bcp/bcp47.txt].
-
-  attr_reader :name
-
-  ##
-  # Creates a new locale object for +name+ locale. +name+ must
-  # follow IETF language tag format.
-
-  def initialize(name)
-    @name = name
-    @messages = {}
-  end
-
-  ##
-  # Loads translation messages from +locale_directory+/+@name+/rdoc.po
-  # or +locale_directory+/+@name+.po. The former has high priority.
-  #
-  # This method requires gettext gem for parsing .po file. If you
-  # don't have gettext gem, this method doesn't load .po file. This
-  # method warns and returns +false+.
-  #
-  # Returns +true+ if succeeded, +false+ otherwise.
-
-  def load(locale_directory)
-    return false if @name.nil?
-
-    po_file_candidates = [
-      File.join(locale_directory, @name, 'rdoc.po'),
-      File.join(locale_directory, "#{@name}.po"),
-    ]
-    po_file = po_file_candidates.find do |po_file_candidate|
-      File.exist?(po_file_candidate)
-    end
-    return false unless po_file
-
-    begin
-      require 'gettext/po_parser'
-      require 'gettext/mo'
-    rescue LoadError
-      warn('Need gettext gem for i18n feature:')
-      warn('  gem install gettext')
-      return false
-    end
-
-    po_parser = GetText::POParser.new
-    messages = GetText::MO.new
-    po_parser.report_warning = false
-    po_parser.parse_file(po_file, messages)
-
-    @messages.merge!(messages)
-
-    true
-  end
-
-  ##
-  # Translates the +message+ into locale. If there is no translation
-  # messages for +message+ in locale, +message+ itself is returned.
-
-  def translate(message)
-    @messages[message] || message
-  end
-
-end
diff --git a/lib/rdoc/i18n/text.rb b/lib/rdoc/i18n/text.rb
deleted file mode 100644
index 7ea6664442..0000000000
--- a/lib/rdoc/i18n/text.rb
+++ /dev/null
@@ -1,126 +0,0 @@
-# frozen_string_literal: true
-##
-# An i18n supported text.
-#
-# This object provides the following two features:
-#
-#   * Extracts translation messages from wrapped raw text.
-#   * Translates wrapped raw text in specified locale.
-#
-# Wrapped raw text is one of String, RDoc::Comment or Array of them.
-
-class RDoc::I18n::Text
-
-  ##
-  # Creates a new i18n supported text for +raw+ text.
-
-  def initialize(raw)
-    @raw = raw
-  end
-
-  ##
-  # Extracts translation target messages and yields each message.
-  #
-  # Each yielded message is a Hash. It consists of the followings:
-  #
-  # :type      :: :paragraph
-  # :paragraph :: String (The translation target message itself.)
-  # :line_no   :: Integer (The line number of the :paragraph is started.)
-  #
-  # The above content may be added in the future.
-
-  def extract_messages
-    parse do |part|
-      case part[:type]
-      when :empty_line
-        # ignore
-      when :paragraph
-        yield(part)
-      end
-    end
-  end
-
-  # Translates raw text into +locale+.
-  def translate(locale)
-    translated_text = ''
-    parse do |part|
-      case part[:type]
-      when :paragraph
-        translated_text += locale.translate(part[:paragraph])
-      when :empty_line
-        translated_text += part[:line]
-      else
-        raise "should not reach here: unexpected type: #{type}"
-      end
-    end
-    translated_text
-  end
-
-  private
-  def parse(&block)
-    paragraph = ''
-    paragraph_start_line = 0
-    line_no = 0
-
-    each_line(@raw) do |line|
-      line_no += 1
-      case line
-      when /\A\s*\z/
-        if paragraph.empty?
-          emit_empty_line_event(line, line_no, &block)
-        else
-          paragraph += line
-          emit_paragraph_event(paragraph, paragraph_start_line, line_no,
-                               &block)
-          paragraph = ''
-        end
-      else
-        paragraph_start_line = line_no if paragraph.empty?
-        paragraph += line
-      end
-    end
-
-    unless paragraph.empty?
-      emit_paragraph_event(paragraph, paragraph_start_line, line_no, &block)
-    end
-  end
-
-  def each_line(raw, &block)
-    case raw
-    when RDoc::Comment
-      raw.text.each_line(&block)
-    when Array
-      raw.each do |comment, location|
-        each_line(comment, &block)
-      end
-    else
-      raw.each_line(&block)
-    end
-  end
-
-  def emit_empty_line_event(line, line_no)
-    part = {
-      :type => :empty_line,
-      :line => line,
-      :line_no => line_no,
-    }
-    yield(part)
-  end
-
-  def emit_paragraph_event(paragraph, paragraph_start_line, line_no, &block)
-    paragraph_part = {
-      :type => :paragraph,
-      :line_no => paragraph_start_line,
-    }
-    match_data = /(\s*)\z/.match(paragraph)
-    if match_data
-      paragraph_part[:paragraph] = match_data.pre_match
-      yield(paragraph_part)
-      emit_empty_line_event(match_data[1], line_no, &block)
-    else
-      paragraph_part[:paragraph] = paragraph
-      yield(paragraph_part)
-    end
-  end
-
-end
diff --git a/lib/rdoc/include.rb b/lib/rdoc/include.rb
deleted file mode 100644
index c3e0d45e47..0000000000
--- a/lib/rdoc/include.rb
+++ /dev/null
@@ -1,9 +0,0 @@
-# frozen_string_literal: true
-##
-# A Module included in a class with \#include
-#
-#   RDoc::Include.new 'Enumerable', 'comment ...'
-
-class RDoc::Include < RDoc::Mixin
-
-end
diff --git a/lib/rdoc/known_classes.rb b/lib/rdoc/known_classes.rb
deleted file mode 100644
index 3e8752bbde..0000000000
--- a/lib/rdoc/known_classes.rb
+++ /dev/null
@@ -1,74 +0,0 @@
-# frozen_string_literal: true
-module RDoc
-
-  ##
-  # Ruby's built-in classes, modules and exceptions
-
-  KNOWN_CLASSES = {
-    "rb_cArray"            => "Array",
-    "rb_cBasicObject"      => "BasicObject",
-    "rb_cBignum"           => "Bignum",
-    "rb_cClass"            => "Class",
-    "rb_cData"             => "Data",
-    "rb_cDir"              => "Dir",
-    "rb_cEncoding"         => "Encoding",
-    "rb_cFalseClass"       => "FalseClass",
-    "rb_cFile"             => "File",
-    "rb_cFixnum"           => "Fixnum",
-    "rb_cFloat"            => "Float",
-    "rb_cHash"             => "Hash",
-    "rb_cIO"               => "IO",
-    "rb_cInteger"          => "Integer",
-    "rb_cModule"           => "Module",
-    "rb_cNilClass"         => "NilClass",
-    "rb_cNumeric"          => "Numeric",
-    "rb_cObject"           => "Object",
-    "rb_cProc"             => "Proc",
-    "rb_cRange"            => "Range",
-    "rb_cRefinement"       => "Refinement",
-    "rb_cRegexp"           => "Regexp",
-    "rb_cRubyVM"           => "RubyVM",
-    "rb_cSocket"           => "Socket",
-    "rb_cString"           => "String",
-    "rb_cStruct"           => "Struct",
-    "rb_cSymbol"           => "Symbol",
-    "rb_cThread"           => "Thread",
-    "rb_cTime"             => "Time",
-    "rb_cTrueClass"        => "TrueClass",
-
-    "rb_eArgError"         => "ArgumentError",
-    "rb_eEOFError"         => "EOFError",
-    "rb_eException"        => "Exception",
-    "rb_eFatal"            => "fatal",
-    "rb_eFloatDomainError" => "FloatDomainError",
-    "rb_eIOError"          => "IOError",
-    "rb_eIndexError"       => "IndexError",
-    "rb_eInterrupt"        => "Interrupt",
-    "rb_eLoadError"        => "LoadError",
-    "rb_eNameError"        => "NameError",
-    "rb_eNoMemError"       => "NoMemoryError",
-    "rb_eNotImpError"      => "NotImplementedError",
-    "rb_eRangeError"       => "RangeError",
-    "rb_eRuntimeError"     => "RuntimeError",
-    "rb_eScriptError"      => "ScriptError",
-    "rb_eSecurityError"    => "SecurityError",
-    "rb_eSignal"           => "SignalException",
-    "rb_eStandardError"    => "StandardError",
-    "rb_eSyntaxError"      => "SyntaxError",
-    "rb_eSystemCallError"  => "SystemCallError",
-    "rb_eSystemExit"       => "SystemExit",
-    "rb_eTypeError"        => "TypeError",
-    "rb_eZeroDivError"     => "ZeroDivisionError",
-
-    "rb_mComparable"       => "Comparable",
-    "rb_mEnumerable"       => "Enumerable",
-    "rb_mErrno"            => "Errno",
-    "rb_mFConst"           => "File::Constants",
-    "rb_mFileTest"         => "FileTest",
-    "rb_mGC"               => "GC",
-    "rb_mKernel"           => "Kernel",
-    "rb_mMath"             => "Math",
-    "rb_mProcess"          => "Process"
-  }
-
-end
diff --git a/lib/rdoc/markdown.rb b/lib/rdoc/markdown.rb
deleted file mode 100644
index 1416059763..0000000000
--- a/lib/rdoc/markdown.rb
+++ /dev/null
@@ -1,16783 +0,0 @@
-# coding: UTF-8
-# frozen_string_literal: true
-# :markup: markdown
-
-##
-# RDoc::Markdown as described by the [markdown syntax][syntax].
-#
-# To choose Markdown as your only default format see
-# RDoc::Options@Saved+Options for instructions on setting up a `.rdoc_options`
-# file to store your project default.
-#
-# ## Usage
-#
-# Here is a brief example of using this parse to read a markdown file by hand.
-#
-#     data = File.read("README.md")
-#     formatter = RDoc::Markup::ToHtml.new(RDoc::Options.new, nil)
-#     html = RDoc::Markdown.parse(data).accept(formatter)
-#
-#     # do something with html
-#
-# ## Extensions
-#
-# The following markdown extensions are supported by the parser, but not all
-# are used in RDoc output by default.
-#
-# ### RDoc
-#
-# The RDoc Markdown parser has the following built-in behaviors that cannot be
-# disabled.
-#
-# Underscores embedded in words are never interpreted as emphasis.  (While the
-# [markdown dingus][dingus] emphasizes in-word underscores, neither the
-# Markdown syntax nor MarkdownTest mention this behavior.)
-#
-# For HTML output, RDoc always auto-links bare URLs.
-#
-# ### Break on Newline
-#
-# The break_on_newline extension converts all newlines into hard line breaks
-# as in [Github Flavored Markdown][GFM].  This extension is disabled by
-# default.
-#
-# ### CSS
-#
-# The #css extension enables CSS blocks to be included in the output, but they
-# are not used for any built-in RDoc output format.  This extension is disabled
-# by default.
-#
-# Example:
-#
-#     <style type="text/css">
-#     h1 { font-size: 3em }
-#     </style>
-#
-# ### Definition Lists
-#
-# The definition_lists extension allows definition lists using the [PHP
-# Markdown Extra syntax][PHPE], but only one label and definition are supported
-# at this time.  This extension is enabled by default.
-#
-# Example:
-#
-# ```
-# cat
-# :   A small furry mammal
-# that seems to sleep a lot
-#
-# ant
-# :   A little insect that is known
-# to enjoy picnics
-#
-# ```
-#
-# Produces:
-#
-# cat
-# :   A small furry mammal
-# that seems to sleep a lot
-#
-# ant
-# :   A little insect that is known
-# to enjoy picnics
-#
-# ### Strike
-#
-# Example:
-#
-# ```
-# This is ~~striked~~.
-# ```
-#
-# Produces:
-#
-# This is ~~striked~~.
-#
-# ### Github
-#
-# The #github extension enables a partial set of [Github Flavored Markdown]
-# [GFM].  This extension is enabled by default.
-#
-# Supported github extensions include:
-#
-# #### Fenced code blocks
-#
-# Use ` ``` ` around a block of code instead of indenting it four spaces.
-#
-# #### Syntax highlighting
-#
-# Use ` ``` ruby ` as the start of a code fence to add syntax highlighting.
-# (Currently only `ruby` syntax is supported).
-#
-# ### HTML
-#
-# Enables raw HTML to be included in the output.  This extension is enabled by
-# default.
-#
-# Example:
-#
-#     <table>
-#     ...
-#     </table>
-#
-# ### Notes
-#
-# The #notes extension enables footnote support.  This extension is enabled by
-# default.
-#
-# Example:
-#
-#     Here is some text[^1] including an inline footnote ^[for short footnotes]
-#
-#     ...
-#
-#     [^1]: With the footnote text down at the bottom
-#
-# Produces:
-#
-# Here is some text[^1] including an inline footnote ^[for short footnotes]
-#
-# [^1]: With the footnote text down at the bottom
-#
-# ## Limitations
-#
-# * Link titles are not used
-# * Footnotes are collapsed into a single paragraph
-#
-# ## Author
-#
-# This markdown parser is a port to kpeg from [peg-markdown][pegmarkdown] by
-# John MacFarlane.
-#
-# It is used under the 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.
-#
-# The port to kpeg was performed by Eric Hodel and Evan Phoenix
-#
-# [dingus]: http://daringfireball.net/projects/markdown/dingus
-# [GFM]: https://github.github.com/gfm/
-# [pegmarkdown]: https://github.com/jgm/peg-markdown
-# [PHPE]: https://michelf.ca/projects/php-markdown/extra/#def-list
-# [syntax]: http://daringfireball.net/projects/markdown/syntax
-#--
-# Last updated to jgm/peg-markdown commit 8f8fc22ef0
-class RDoc::Markdown
-  # :stopdoc:
-
-    # This is distinct from setup_parser so that a standalone parser
-    # can redefine #initialize and still have access to the proper
-    # parser setup code.
-    def initialize(str, debug=false)
-      setup_parser(str, debug)
-    end
-
-
-
-    # Prepares for parsing +str+.  If you define a custom initialize you must
-    # call this method before #parse
-    def setup_parser(str, debug=false)
-      set_string str, 0
-      @memoizations = Hash.new { |h,k| h[k] = {} }
-      @result = nil
-      @failed_rule = nil
-      @failing_rule_offset = -1
-      @line_offsets = nil
-
-      setup_foreign_grammar
-    end
-
-    attr_reader :string
-    attr_reader :failing_rule_offset
-    attr_accessor :result, :pos
-
-    def current_column(target=pos)
-      if string[target] == "\n" && (c = string.rindex("\n", target-1) || -1)
-        return target - c
-      elsif c = string.rindex("\n", target)
-        return target - c
-      end
-
-      target + 1
-    end
-
-    def position_line_offsets
-      unless @position_line_offsets
-        @position_line_offsets = []
-        total = 0
-        string.each_line do |line|
-          total += line.size
-          @position_line_offsets << total
-        end
-      end
-      @position_line_offsets
-    end
-
-    if [].respond_to? :bsearch_index
-      def current_line(target=pos)
-        if line = position_line_offsets.bsearch_index {|x| x > target }
-          return line + 1
-        end
-        raise "Target position #{target} is outside of string"
-      end
-    else
-      def current_line(target=pos)
-        if line = position_line_offsets.index {|x| x > target }
-          return line + 1
-        end
-
-        raise "Target position #{target} is outside of string"
-      end
-    end
-
-    def current_character(target=pos)
-      if target < 0 || target >= string.size
-        raise "Target position #{target} is outside of string"
-      end
-      string[target, 1]
-    end
-
-    KpegPosInfo = Struct.new(:pos, :lno, :col, :line, :char)
-
-    def current_pos_info(target=pos)
-      l = current_line target
-      c = current_column target
-      ln = get_line(l-1)
-      chr = string[target,1]
-      KpegPosInfo.new(target, l, c, ln, chr)
-    end
-
-    def lines
-      string.lines
-    end
-
-    def get_line(no)
-      loff = position_line_offsets
-      if no < 0
-        raise "Line No is out of range: #{no} < 0"
-      elsif no >= loff.size
-        raise "Line No is out of range: #{no} >= #{loff.size}"
-      end
-      lend = loff[no]-1
-      lstart = no > 0 ? loff[no-1] : 0
-      string[lstart..lend]
-    end
-
-
-
-    def get_text(start)
-      @string[start..@pos-1]
-    end
-
-    # Sets the string and current parsing position for the parser.
-    def set_string string, pos
-      @string = string
-      @string_size = string ? string.size : 0
-      @pos = pos
-      @position_line_offsets = nil
-    end
-
-    def show_pos
-      width = 10
-      if @pos < width
-        "#{@pos} (\"#{@string[0,@pos]}\" @ \"#{@string[@pos,width]}\")"
-      else
-        "#{@pos} (\"... #{@string[@pos - width, width]}\" @ \"#{@string[@pos,width]}\")"
-      end
-    end
-
-    def failure_info
-      l = current_line @failing_rule_offset
-      c = current_column @failing_rule_offset
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        "line #{l}, column #{c}: failed rule '#{info.name}' = '#{info.rendered}'"
-      else
-        "line #{l}, column #{c}: failed rule '#{@failed_rule}'"
-      end
-    end
-
-    def failure_caret
-      p = current_pos_info @failing_rule_offset
-      "#{p.line.chomp}\n#{' ' * (p.col - 1)}^"
-    end
-
-    def failure_character
-      current_character @failing_rule_offset
-    end
-
-    def failure_oneline
-      p = current_pos_info @failing_rule_offset
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        "@#{p.lno}:#{p.col} failed rule '#{info.name}', got '#{p.char}'"
-      else
-        "@#{p.lno}:#{p.col} failed rule '#{@failed_rule}', got '#{p.char}'"
-      end
-    end
-
-    class ParseError < RuntimeError
-    end
-
-    def raise_error
-      raise ParseError, failure_oneline
-    end
-
-    def show_error(io=STDOUT)
-      error_pos = @failing_rule_offset
-      p = current_pos_info(error_pos)
-
-      io.puts "On line #{p.lno}, column #{p.col}:"
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        io.puts "Failed to match '#{info.rendered}' (rule '#{info.name}')"
-      else
-        io.puts "Failed to match rule '#{@failed_rule}'"
-      end
-
-      io.puts "Got: #{p.char.inspect}"
-      io.puts "=> #{p.line}"
-      io.print(" " * (p.col + 2))
-      io.puts "^"
-    end
-
-    def set_failed_rule(name)
-      if @pos > @failing_rule_offset
-        @failed_rule = name
-        @failing_rule_offset = @pos
-      end
-    end
-
-    attr_reader :failed_rule
-
-    def match_string(str)
-      len = str.size
-      if @string[pos,len] == str
-        @pos += len
-        return str
-      end
-
-      return nil
-    end
-
-    def scan(reg)
-      if m = reg.match(@string, @pos)
-        @pos = m.end(0)
-        return true
-      end
-
-      return nil
-    end
-
-    if "".respond_to? :ord
-      def get_byte
-        if @pos >= @string_size
-          return nil
-        end
-
-        s = @string[@pos].ord
-        @pos += 1
-        s
-      end
-    else
-      def get_byte
-        if @pos >= @string_size
-          return nil
-        end
-
-        s = @string[@pos]
-        @pos += 1
-        s
-      end
-    end
-
-    def parse(rule=nil)
-      # We invoke the rules indirectly via apply
-      # instead of by just calling them as methods because
-      # if the rules use left recursion, apply needs to
-      # manage that.
-
-      if !rule
-        apply(:_root)
-      else
-        method = rule.gsub("-","_hyphen_")
-        apply :"_#{method}"
-      end
-    end
-
-    class MemoEntry
-      def initialize(ans, pos)
-        @ans = ans
-        @pos = pos
-        @result = nil
-        @set = false
-        @left_rec = false
-      end
-
-      attr_reader :ans, :pos, :result, :set
-      attr_accessor :left_rec
-
-      def move!(ans, pos, result)
-        @ans = ans
-        @pos = pos
-        @result = result
-        @set = true
-        @left_rec = false
-      end
-    end
-
-    def external_invoke(other, rule, *args)
-      old_pos = @pos
-      old_string = @string
-
-      set_string other.string, other.pos
-
-      begin
-        if val = __send__(rule, *args)
-          other.pos = @pos
-          other.result = @result
-        else
-          other.set_failed_rule "#{self.class}##{rule}"
-        end
-        val
-      ensure
-        set_string old_string, old_pos
-      end
-    end
-
-    def apply_with_args(rule, *args)
-      @result = nil
-      memo_key = [rule, args]
-      if m = @memoizations[memo_key][@pos]
-        @pos = m.pos
-        if !m.set
-          m.left_rec = true
-          return nil
-        end
-
-        @result = m.result
-
-        return m.ans
-      else
-        m = MemoEntry.new(nil, @pos)
-        @memoizations[memo_key][@pos] = m
-        start_pos = @pos
-
-        ans = __send__ rule, *args
-
-        lr = m.left_rec
-
-        m.move! ans, @pos, @result
-
-        # Don't bother trying to grow the left recursion
-        # if it's failing straight away (thus there is no seed)
-        if ans and lr
-          return grow_lr(rule, args, start_pos, m)
-        else
-          return ans
-        end
-      end
-    end
-
-    def apply(rule)
-      @result = nil
-      if m = @memoizations[rule][@pos]
-        @pos = m.pos
-        if !m.set
-          m.left_rec = true
-          return nil
-        end
-
-        @result = m.result
-
-        return m.ans
-      else
-        m = MemoEntry.new(nil, @pos)
-        @memoizations[rule][@pos] = m
-        start_pos = @pos
-
-        ans = __send__ rule
-
-        lr = m.left_rec
-
-        m.move! ans, @pos, @result
-
-        # Don't bother trying to grow the left recursion
-        # if it's failing straight away (thus there is no seed)
-        if ans and lr
-          return grow_lr(rule, nil, start_pos, m)
-        else
-          return ans
-        end
-      end
-    end
-
-    def grow_lr(rule, args, start_pos, m)
-      while true
-        @pos = start_pos
-        @result = m.result
-
-        if args
-          ans = __send__ rule, *args
-        else
-          ans = __send__ rule
-        end
-        return nil unless ans
-
-        break if @pos <= m.pos
-
-        m.move! ans, @pos, @result
-      end
-
-      @result = m.result
-      @pos = m.pos
-      return m.ans
-    end
-
-    class RuleInfo
-      def initialize(name, rendered)
-        @name = name
-        @rendered = rendered
-      end
-
-      attr_reader :name, :rendered
-    end
-
-    def self.rule_info(name, rendered)
-      RuleInfo.new(name, rendered)
-    end
-
-
-  # :startdoc:
-
-
-
-  require_relative '../rdoc'
-  require_relative 'markup/to_joined_paragraph'
-  require_relative 'markdown/entities'
-
-  require_relative 'markdown/literals'
-
-  ##
-  # Supported extensions
-
-  EXTENSIONS = []
-
-  ##
-  # Extensions enabled by default
-
-  DEFAULT_EXTENSIONS = [
-    :definition_lists,
-    :github,
-    :html,
-    :notes,
-    :strike,
-  ]
-
-  # :section: Extensions
-
-  ##
-  # Creates extension methods for the `name` extension to enable and disable
-  # the extension and to query if they are active.
-
-  def self.extension name
-    EXTENSIONS << name
-
-    define_method "#{name}?" do
-      extension? name
-    end
-
-    define_method "#{name}=" do |enable|
-      extension name, enable
-    end
-  end
-
-  ##
-  # Converts all newlines into hard breaks
-
-  extension :break_on_newline
-
-  ##
-  # Allow style blocks
-
-  extension :css
-
-  ##
-  # Allow PHP Markdown Extras style definition lists
-
-  extension :definition_lists
-
-  ##
-  # Allow Github Flavored Markdown
-
-  extension :github
-
-  ##
-  # Allow HTML
-
-  extension :html
-
-  ##
-  # Enables the notes extension
-
-  extension :notes
-
-  ##
-  # Enables the strike extension
-
-  extension :strike
-
-  # :section:
-
-  ##
-  # Parses the `markdown` document into an RDoc::Document using the default
-  # extensions.
-
-  def self.parse markdown
-    parser = new
-
-    parser.parse markdown
-  end
-
-  # TODO remove when kpeg 0.10 is released
-  alias orig_initialize initialize # :nodoc:
-
-  ##
-  # Creates a new markdown parser that enables the given +extensions+.
-
-  def initialize extensions = DEFAULT_EXTENSIONS, debug = false
-    @debug      = debug
-    @formatter  = RDoc::Markup::ToJoinedParagraph.new
-    @extensions = extensions
-
-    @references          = nil
-    @unlinked_references = nil
-
-    @footnotes       = nil
-    @note_order      = nil
-  end
-
-  ##
-  # Wraps `text` in emphasis for rdoc inline formatting
-
-  def emphasis text
-    if text =~ /\A[a-z\d.\/]+\z/i then
-      "_#{text}_"
-    else
-      "<em>#{text}</em>"
-    end
-  end
-
-  ##
-  # :category: Extensions
-  #
-  # Is the extension `name` enabled?
-
-  def extension? name
-    @extensions.include? name
-  end
-
-  ##
-  # :category: Extensions
-  #
-  # Enables or disables the extension with `name`
-
-  def extension name, enable
-    if enable then
-      @extensions |= [name]
-    else
-      @extensions -= [name]
-    end
-  end
-
-  ##
-  # Parses `text` in a clone of this parser.  This is used for handling nested
-  # lists the same way as markdown_parser.
-
-  def inner_parse text # :nodoc:
-    parser = clone
-
-    parser.setup_parser text, @debug
-
-    parser.peg_parse
-
-    doc = parser.result
-
-    doc.accept @formatter
-
-    doc.parts
-  end
-
-  ##
-  # Finds a link reference for `label` and creates a new link to it with
-  # `content` as the link text.  If `label` was not encountered in the
-  # reference-gathering parser pass the label and content are reconstructed
-  # with the linking `text` (usually whitespace).
-
-  def link_to content, label = content, text = nil
-    raise ParseError, 'enable notes extension' if
-      content.start_with? '^' and label.equal? content
-
-    if ref = @references[label] then
-      "{#{content}}[#{ref}]"
-    elsif label.equal? content then
-      "[#{content}]#{text}"
-    else
-      "[#{content}]#{text}[#{label}]"
-    end
-  end
-
-  ##
-  # Creates an RDoc::Markup::ListItem by parsing the `unparsed` content from
-  # the first parsing pass.
-
-  def list_item_from unparsed
-    parsed = inner_parse unparsed.join
-    RDoc::Markup::ListItem.new nil, *parsed
-  end
-
-  ##
-  # Stores `label` as a note and fills in previously unknown note references.
-
-  def note label
-    #foottext = "rdoc-label:foottext-#{label}:footmark-#{label}"
-
-    #ref.replace foottext if ref = @unlinked_notes.delete(label)
-
-    @notes[label] = foottext
-
-    #"{^1}[rdoc-label:footmark-#{label}:foottext-#{label}] "
-  end
-
-  ##
-  # Creates a new link for the footnote `reference` and adds the reference to
-  # the note order list for proper display at the end of the document.
-
-  def note_for ref
-    @note_order << ref
-
-    label = @note_order.length
-
-    "{*#{label}}[rdoc-label:foottext-#{label}:footmark-#{label}]"
-  end
-
-  ##
-  # The internal kpeg parse method
-
-  alias peg_parse parse # :nodoc:
-
-  ##
-  # Creates an RDoc::Markup::Paragraph from `parts` and including
-  # extension-specific behavior
-
-  def paragraph parts
-    parts = parts.map do |part|
-      if "\n" == part then
-        RDoc::Markup::HardBreak.new
-      else
-        part
-      end
-    end if break_on_newline?
-
-    RDoc::Markup::Paragraph.new(*parts)
-  end
-
-  ##
-  # Parses `markdown` into an RDoc::Document
-
-  def parse markdown
-    @references          = {}
-    @unlinked_references = {}
-
-    markdown += "\n\n"
-
-    setup_parser markdown, @debug
-    peg_parse 'References'
-
-    if notes? then
-      @footnotes       = {}
-
-      setup_parser markdown, @debug
-      peg_parse 'Notes'
-
-      # using note_order on the first pass would be a bug
-      @note_order      = []
-    end
-
-    setup_parser markdown, @debug
-    peg_parse
-
-    doc = result
-
-    if notes? and not @footnotes.empty? then
-      doc << RDoc::Markup::Rule.new(1)
-
-      @note_order.each_with_index do |ref, index|
-        label = index + 1
-        note = @footnotes[ref] or raise ParseError, "footnote [^#{ref}] not found"
-
-        link = "{^#{label}}[rdoc-label:footmark-#{label}:foottext-#{label}] "
-        note.parts.unshift link
-
-        doc << note
-      end
-    end
-
-    doc.accept @formatter
-
-    doc
-  end
-
-  ##
-  # Stores `label` as a reference to `link` and fills in previously unknown
-  # link references.
-
-  def reference label, link
-    if ref = @unlinked_references.delete(label) then
-      ref.replace link
-    end
-
-    @references[label] = link
-  end
-
-  ##
-  # Wraps `text` in strong markup for rdoc inline formatting
-
-  def strong text
-    if text =~ /\A[a-z\d.\/-]+\z/i then
-      "*#{text}*"
-    else
-      "<b>#{text}</b>"
-    end
-  end
-
-  ##
-  # Wraps `text` in strike markup for rdoc inline formatting
-
-  def strike text
-    if text =~ /\A[a-z\d.\/-]+\z/i then
-      "~#{text}~"
-    else
-      "<s>#{text}</s>"
-    end
-  end
-
-
-  # :stopdoc:
-  def setup_foreign_grammar
-    @_grammar_literals = RDoc::Markdown::Literals.new(nil)
-  end
-
-  # root = Doc
-  def _root
-    _tmp = apply(:_Doc)
-    set_failed_rule :_root unless _tmp
-    return _tmp
-  end
-
-  # Doc = BOM? Block*:a { RDoc::Markup::Document.new(*a.compact) }
-  def _Doc
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = apply(:_BOM)
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _ary = []
-      while true
-        _tmp = apply(:_Block)
-        _ary << @result if _tmp
-        break unless _tmp
-      end
-      _tmp = true
-      @result = _ary
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Document.new(*a.compact) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Doc unless _tmp
-    return _tmp
-  end
-
-  # Block = @BlankLine* (BlockQuote | Verbatim | CodeFence | Table | Note | Reference | HorizontalRule | Heading | OrderedList | BulletList | DefinitionList | HtmlBlock | StyleBlock | Para | Plain)
-  def _Block
-
-    _save = self.pos
-    while true # sequence
-      while true
-        _tmp = _BlankLine()
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = apply(:_BlockQuote)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Verbatim)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_CodeFence)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Table)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Note)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Reference)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_HorizontalRule)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Heading)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_OrderedList)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_BulletList)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_DefinitionList)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_HtmlBlock)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_StyleBlock)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Para)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_Plain)
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Block unless _tmp
-    return _tmp
-  end
-
-  # Para = @NonindentSpace Inlines:a @BlankLine+ { paragraph a }
-  def _Para
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Inlines)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  paragraph a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Para unless _tmp
-    return _tmp
-  end
-
-  # Plain = Inlines:a { paragraph a }
-  def _Plain
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Inlines)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  paragraph a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Plain unless _tmp
-    return _tmp
-  end
-
-  # AtxInline = !@Newline !(@Sp /#*/ @Sp @Newline) Inline
-  def _AtxInline
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _Newline()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = scan(/\G(?-mix:#*)/)
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = _Newline()
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      _tmp = _tmp ? nil : true
-      self.pos = _save2
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Inline)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_AtxInline unless _tmp
-    return _tmp
-  end
-
-  # AtxStart = < /\#{1,6}/ > { text.length }
-  def _AtxStart
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:\#{1,6})/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text.length ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_AtxStart unless _tmp
-    return _tmp
-  end
-
-  # AtxHeading = AtxStart:s @Sp AtxInline+:a (@Sp /#*/ @Sp)? @Newline { RDoc::Markup::Heading.new(s, a.join) }
-  def _AtxHeading
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_AtxStart)
-      s = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _ary = []
-      _tmp = apply(:_AtxInline)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_AtxInline)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = scan(/\G(?-mix:#*)/)
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      unless _tmp
-        _tmp = true
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Heading.new(s, a.join) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_AtxHeading unless _tmp
-    return _tmp
-  end
-
-  # SetextHeading = (SetextHeading1 | SetextHeading2)
-  def _SetextHeading
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_SetextHeading1)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_SetextHeading2)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_SetextHeading unless _tmp
-    return _tmp
-  end
-
-  # SetextBottom1 = /={1,}/ @Newline
-  def _SetextBottom1
-
-    _save = self.pos
-    while true # sequence
-      _tmp = scan(/\G(?-mix:={1,})/)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_SetextBottom1 unless _tmp
-    return _tmp
-  end
-
-  # SetextBottom2 = /-{1,}/ @Newline
-  def _SetextBottom2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = scan(/\G(?-mix:-{1,})/)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_SetextBottom2 unless _tmp
-    return _tmp
-  end
-
-  # SetextHeading1 = &(@RawLine SetextBottom1) @StartList:a (!@Endline Inline:b { a << b })+ @Sp @Newline SetextBottom1 { RDoc::Markup::Heading.new(1, a.join) }
-  def _SetextHeading1
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = _RawLine()
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = apply(:_SetextBottom1)
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save3 = self.pos
-
-      _save4 = self.pos
-      while true # sequence
-        _save5 = self.pos
-        _tmp = _Endline()
-        _tmp = _tmp ? nil : true
-        self.pos = _save5
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        _tmp = apply(:_Inline)
-        b = @result
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save4
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save6 = self.pos
-          while true # sequence
-            _save7 = self.pos
-            _tmp = _Endline()
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            _tmp = apply(:_Inline)
-            b = @result
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save6
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save3
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_SetextBottom1)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Heading.new(1, a.join) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_SetextHeading1 unless _tmp
-    return _tmp
-  end
-
-  # SetextHeading2 = &(@RawLine SetextBottom2) @StartList:a (!@Endline Inline:b { a << b })+ @Sp @Newline SetextBottom2 { RDoc::Markup::Heading.new(2, a.join) }
-  def _SetextHeading2
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = _RawLine()
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = apply(:_SetextBottom2)
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save3 = self.pos
-
-      _save4 = self.pos
-      while true # sequence
-        _save5 = self.pos
-        _tmp = _Endline()
-        _tmp = _tmp ? nil : true
-        self.pos = _save5
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        _tmp = apply(:_Inline)
-        b = @result
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save4
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save6 = self.pos
-          while true # sequence
-            _save7 = self.pos
-            _tmp = _Endline()
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            _tmp = apply(:_Inline)
-            b = @result
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save6
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save3
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_SetextBottom2)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Heading.new(2, a.join) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_SetextHeading2 unless _tmp
-    return _tmp
-  end
-
-  # Heading = (SetextHeading | AtxHeading)
-  def _Heading
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_SetextHeading)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_AtxHeading)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Heading unless _tmp
-    return _tmp
-  end
-
-  # BlockQuote = BlockQuoteRaw:a { RDoc::Markup::BlockQuote.new(*a) }
-  def _BlockQuote
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_BlockQuoteRaw)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::BlockQuote.new(*a) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_BlockQuote unless _tmp
-    return _tmp
-  end
-
-  # BlockQuoteRaw = @StartList:a (">" " "? Line:l { a << l } (!">" !@BlankLine Line:c { a << c })* (@BlankLine:n { a << n })*)+ { inner_parse a.join }
-  def _BlockQuoteRaw
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = match_string(">")
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _save3 = self.pos
-        _tmp = match_string(" ")
-        unless _tmp
-          _tmp = true
-          self.pos = _save3
-        end
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = apply(:_Line)
-        l = @result
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        @result = begin;  a << l ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = match_string(">")
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _save7 = self.pos
-            _tmp = _BlankLine()
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = apply(:_Line)
-            c = @result
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            @result = begin;  a << c ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        while true
-
-          _save9 = self.pos
-          while true # sequence
-            _tmp = _BlankLine()
-            n = @result
-            unless _tmp
-              self.pos = _save9
-              break
-            end
-            @result = begin;  a << n ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save9
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save10 = self.pos
-          while true # sequence
-            _tmp = match_string(">")
-            unless _tmp
-              self.pos = _save10
-              break
-            end
-            _save11 = self.pos
-            _tmp = match_string(" ")
-            unless _tmp
-              _tmp = true
-              self.pos = _save11
-            end
-            unless _tmp
-              self.pos = _save10
-              break
-            end
-            _tmp = apply(:_Line)
-            l = @result
-            unless _tmp
-              self.pos = _save10
-              break
-            end
-            @result = begin;  a << l ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save10
-              break
-            end
-            while true
-
-              _save13 = self.pos
-              while true # sequence
-                _save14 = self.pos
-                _tmp = match_string(">")
-                _tmp = _tmp ? nil : true
-                self.pos = _save14
-                unless _tmp
-                  self.pos = _save13
-                  break
-                end
-                _save15 = self.pos
-                _tmp = _BlankLine()
-                _tmp = _tmp ? nil : true
-                self.pos = _save15
-                unless _tmp
-                  self.pos = _save13
-                  break
-                end
-                _tmp = apply(:_Line)
-                c = @result
-                unless _tmp
-                  self.pos = _save13
-                  break
-                end
-                @result = begin;  a << c ; end
-                _tmp = true
-                unless _tmp
-                  self.pos = _save13
-                end
-                break
-              end # end sequence
-
-              break unless _tmp
-            end
-            _tmp = true
-            unless _tmp
-              self.pos = _save10
-              break
-            end
-            while true
-
-              _save17 = self.pos
-              while true # sequence
-                _tmp = _BlankLine()
-                n = @result
-                unless _tmp
-                  self.pos = _save17
-                  break
-                end
-                @result = begin;  a << n ; end
-                _tmp = true
-                unless _tmp
-                  self.pos = _save17
-                end
-                break
-              end # end sequence
-
-              break unless _tmp
-            end
-            _tmp = true
-            unless _tmp
-              self.pos = _save10
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  inner_parse a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_BlockQuoteRaw unless _tmp
-    return _tmp
-  end
-
-  # NonblankIndentedLine = !@BlankLine IndentedLine
-  def _NonblankIndentedLine
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_IndentedLine)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_NonblankIndentedLine unless _tmp
-    return _tmp
-  end
-
-  # VerbatimChunk = @BlankLine*:a NonblankIndentedLine+:b { a.concat b }
-  def _VerbatimChunk
-
-    _save = self.pos
-    while true # sequence
-      _ary = []
-      while true
-        _tmp = _BlankLine()
-        _ary << @result if _tmp
-        break unless _tmp
-      end
-      _tmp = true
-      @result = _ary
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _ary = []
-      _tmp = apply(:_NonblankIndentedLine)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_NonblankIndentedLine)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save2
-      end
-      b = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a.concat b ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_VerbatimChunk unless _tmp
-    return _tmp
-  end
-
-  # Verbatim = VerbatimChunk+:a { RDoc::Markup::Verbatim.new(*a.flatten) }
-  def _Verbatim
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _ary = []
-      _tmp = apply(:_VerbatimChunk)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_VerbatimChunk)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Verbatim.new(*a.flatten) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Verbatim unless _tmp
-    return _tmp
-  end
-
-  # HorizontalRule = @NonindentSpace ("*" @Sp "*" @Sp "*" (@Sp "*")* | "-" @Sp "-" @Sp "-" (@Sp "-")* | "_" @Sp "_" @Sp "_" (@Sp "_")*) @Sp @Newline @BlankLine+ { RDoc::Markup::Rule.new 1 }
-  def _HorizontalRule
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = match_string("*")
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = match_string("*")
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = match_string("*")
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          while true
-
-            _save4 = self.pos
-            while true # sequence
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save4
-                break
-              end
-              _tmp = match_string("*")
-              unless _tmp
-                self.pos = _save4
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save5 = self.pos
-        while true # sequence
-          _tmp = match_string("-")
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _tmp = match_string("-")
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _tmp = match_string("-")
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          while true
-
-            _save7 = self.pos
-            while true # sequence
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _tmp = match_string("-")
-              unless _tmp
-                self.pos = _save7
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-          unless _tmp
-            self.pos = _save5
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save8 = self.pos
-        while true # sequence
-          _tmp = match_string("_")
-          unless _tmp
-            self.pos = _save8
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save8
-            break
-          end
-          _tmp = match_string("_")
-          unless _tmp
-            self.pos = _save8
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save8
-            break
-          end
-          _tmp = match_string("_")
-          unless _tmp
-            self.pos = _save8
-            break
-          end
-          while true
-
-            _save10 = self.pos
-            while true # sequence
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save10
-                break
-              end
-              _tmp = match_string("_")
-              unless _tmp
-                self.pos = _save10
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-          unless _tmp
-            self.pos = _save8
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save11 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save11
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::Rule.new 1 ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HorizontalRule unless _tmp
-    return _tmp
-  end
-
-  # Bullet = !HorizontalRule @NonindentSpace /[+*-]/ @Spacechar+
-  def _Bullet
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = apply(:_HorizontalRule)
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = scan(/\G(?-mix:[+*-])/)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = _Spacechar()
-      if _tmp
-        while true
-          _tmp = _Spacechar()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Bullet unless _tmp
-    return _tmp
-  end
-
-  # BulletList = &Bullet (ListTight | ListLoose):a { RDoc::Markup::List.new(:BULLET, *a) }
-  def _BulletList
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = apply(:_Bullet)
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = apply(:_ListTight)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_ListLoose)
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::List.new(:BULLET, *a) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_BulletList unless _tmp
-    return _tmp
-  end
-
-  # ListTight = ListItemTight+:a @BlankLine* !(Bullet | Enumerator) { a }
-  def _ListTight
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _ary = []
-      _tmp = apply(:_ListItemTight)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_ListItemTight)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = _BlankLine()
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save3 = self.pos
-
-      _save4 = self.pos
-      while true # choice
-        _tmp = apply(:_Bullet)
-        break if _tmp
-        self.pos = _save4
-        _tmp = apply(:_Enumerator)
-        break if _tmp
-        self.pos = _save4
-        break
-      end # end choice
-
-      _tmp = _tmp ? nil : true
-      self.pos = _save3
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListTight unless _tmp
-    return _tmp
-  end
-
-  # ListLoose = @StartList:a (ListItem:b @BlankLine* { a << b })+ { a }
-  def _ListLoose
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = apply(:_ListItem)
-        b = @result
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save4 = self.pos
-          while true # sequence
-            _tmp = apply(:_ListItem)
-            b = @result
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            while true
-              _tmp = _BlankLine()
-              break unless _tmp
-            end
-            _tmp = true
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save4
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListLoose unless _tmp
-    return _tmp
-  end
-
-  # ListItem = (Bullet | Enumerator) @StartList:a ListBlock:b { a << b } (ListContinuationBlock:c { a.push(*c) })* { list_item_from a }
-  def _ListItem
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_Bullet)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_Enumerator)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_ListBlock)
-      b = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a << b ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save3 = self.pos
-        while true # sequence
-          _tmp = apply(:_ListContinuationBlock)
-          c = @result
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          @result = begin;  a.push(*c) ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  list_item_from a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListItem unless _tmp
-    return _tmp
-  end
-
-  # ListItemTight = (Bullet | Enumerator) ListBlock:a (!@BlankLine ListContinuationBlock:b { a.push(*b) })* !ListContinuationBlock { list_item_from a }
-  def _ListItemTight
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_Bullet)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_Enumerator)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_ListBlock)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = _BlankLine()
-          _tmp = _tmp ? nil : true
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = apply(:_ListContinuationBlock)
-          b = @result
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          @result = begin;  a.push(*b) ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save5 = self.pos
-      _tmp = apply(:_ListContinuationBlock)
-      _tmp = _tmp ? nil : true
-      self.pos = _save5
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  list_item_from a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListItemTight unless _tmp
-    return _tmp
-  end
-
-  # ListBlock = !@BlankLine Line:a ListBlockLine*:c { [a, *c] }
-  def _ListBlock
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Line)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _ary = []
-      while true
-        _tmp = apply(:_ListBlockLine)
-        _ary << @result if _tmp
-        break unless _tmp
-      end
-      _tmp = true
-      @result = _ary
-      c = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  [a, *c] ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListBlock unless _tmp
-    return _tmp
-  end
-
-  # ListContinuationBlock = @StartList:a @BlankLine* { a << "\n" } (Indent ListBlock:b { a.concat b })+ { a }
-  def _ListContinuationBlock
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = _BlankLine()
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a << "\n" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _tmp = apply(:_Indent)
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = apply(:_ListBlock)
-        b = @result
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        @result = begin;  a.concat b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save4 = self.pos
-          while true # sequence
-            _tmp = apply(:_Indent)
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            _tmp = apply(:_ListBlock)
-            b = @result
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            @result = begin;  a.concat b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save4
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListContinuationBlock unless _tmp
-    return _tmp
-  end
-
-  # Enumerator = @NonindentSpace [0-9]+ "." @Spacechar+
-  def _Enumerator
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _save2 = self.pos
-      _tmp = get_byte
-      if _tmp
-        unless _tmp >= 48 and _tmp <= 57
-          self.pos = _save2
-          _tmp = nil
-        end
-      end
-      if _tmp
-        while true
-          _save3 = self.pos
-          _tmp = get_byte
-          if _tmp
-            unless _tmp >= 48 and _tmp <= 57
-              self.pos = _save3
-              _tmp = nil
-            end
-          end
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(".")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save4 = self.pos
-      _tmp = _Spacechar()
-      if _tmp
-        while true
-          _tmp = _Spacechar()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save4
-      end
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Enumerator unless _tmp
-    return _tmp
-  end
-
-  # OrderedList = &Enumerator (ListTight | ListLoose):a { RDoc::Markup::List.new(:NUMBER, *a) }
-  def _OrderedList
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = apply(:_Enumerator)
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = apply(:_ListTight)
-        break if _tmp
-        self.pos = _save2
-        _tmp = apply(:_ListLoose)
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::List.new(:NUMBER, *a) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_OrderedList unless _tmp
-    return _tmp
-  end
-
-  # ListBlockLine = !@BlankLine !(Indent? (Bullet | Enumerator)) !HorizontalRule OptionallyIndentedLine
-  def _ListBlockLine
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _save4 = self.pos
-        _tmp = apply(:_Indent)
-        unless _tmp
-          _tmp = true
-          self.pos = _save4
-        end
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-
-        _save5 = self.pos
-        while true # choice
-          _tmp = apply(:_Bullet)
-          break if _tmp
-          self.pos = _save5
-          _tmp = apply(:_Enumerator)
-          break if _tmp
-          self.pos = _save5
-          break
-        end # end choice
-
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      _tmp = _tmp ? nil : true
-      self.pos = _save2
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save6 = self.pos
-      _tmp = apply(:_HorizontalRule)
-      _tmp = _tmp ? nil : true
-      self.pos = _save6
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_OptionallyIndentedLine)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ListBlockLine unless _tmp
-    return _tmp
-  end
-
-  # HtmlOpenAnchor = "<" Spnl ("a" | "A") Spnl HtmlAttribute* ">"
-  def _HtmlOpenAnchor
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("a")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("A")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlOpenAnchor unless _tmp
-    return _tmp
-  end
-
-  # HtmlCloseAnchor = "<" Spnl "/" ("a" | "A") Spnl ">"
-  def _HtmlCloseAnchor
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("a")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("A")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlCloseAnchor unless _tmp
-    return _tmp
-  end
-
-  # HtmlAnchor = HtmlOpenAnchor (HtmlAnchor | !HtmlCloseAnchor .)* HtmlCloseAnchor
-  def _HtmlAnchor
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlOpenAnchor)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlAnchor)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlCloseAnchor)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlCloseAnchor)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlAnchor unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenAddress = "<" Spnl ("address" | "ADDRESS") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenAddress
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("address")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("ADDRESS")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenAddress unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseAddress = "<" Spnl "/" ("address" | "ADDRESS") Spnl ">"
-  def _HtmlBlockCloseAddress
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("address")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("ADDRESS")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseAddress unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockAddress = HtmlBlockOpenAddress (HtmlBlockAddress | !HtmlBlockCloseAddress .)* HtmlBlockCloseAddress
-  def _HtmlBlockAddress
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenAddress)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockAddress)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseAddress)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseAddress)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockAddress unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenBlockquote = "<" Spnl ("blockquote" | "BLOCKQUOTE") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenBlockquote
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("blockquote")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("BLOCKQUOTE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenBlockquote unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseBlockquote = "<" Spnl "/" ("blockquote" | "BLOCKQUOTE") Spnl ">"
-  def _HtmlBlockCloseBlockquote
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("blockquote")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("BLOCKQUOTE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseBlockquote unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockBlockquote = HtmlBlockOpenBlockquote (HtmlBlockBlockquote | !HtmlBlockCloseBlockquote .)* HtmlBlockCloseBlockquote
-  def _HtmlBlockBlockquote
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenBlockquote)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockBlockquote)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseBlockquote)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseBlockquote)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockBlockquote unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenCenter = "<" Spnl ("center" | "CENTER") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenCenter
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("center")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("CENTER")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenCenter unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseCenter = "<" Spnl "/" ("center" | "CENTER") Spnl ">"
-  def _HtmlBlockCloseCenter
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("center")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("CENTER")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseCenter unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCenter = HtmlBlockOpenCenter (HtmlBlockCenter | !HtmlBlockCloseCenter .)* HtmlBlockCloseCenter
-  def _HtmlBlockCenter
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenCenter)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockCenter)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseCenter)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseCenter)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCenter unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenDir = "<" Spnl ("dir" | "DIR") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenDir
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dir")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DIR")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenDir unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseDir = "<" Spnl "/" ("dir" | "DIR") Spnl ">"
-  def _HtmlBlockCloseDir
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dir")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DIR")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseDir unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockDir = HtmlBlockOpenDir (HtmlBlockDir | !HtmlBlockCloseDir .)* HtmlBlockCloseDir
-  def _HtmlBlockDir
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenDir)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockDir)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseDir)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseDir)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockDir unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenDiv = "<" Spnl ("div" | "DIV") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenDiv
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("div")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DIV")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenDiv unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseDiv = "<" Spnl "/" ("div" | "DIV") Spnl ">"
-  def _HtmlBlockCloseDiv
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("div")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DIV")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseDiv unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockDiv = HtmlBlockOpenDiv (HtmlBlockDiv | !HtmlBlockCloseDiv .)* HtmlBlockCloseDiv
-  def _HtmlBlockDiv
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenDiv)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockDiv)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseDiv)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseDiv)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockDiv unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenDl = "<" Spnl ("dl" | "DL") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenDl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dl")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenDl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseDl = "<" Spnl "/" ("dl" | "DL") Spnl ">"
-  def _HtmlBlockCloseDl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dl")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseDl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockDl = HtmlBlockOpenDl (HtmlBlockDl | !HtmlBlockCloseDl .)* HtmlBlockCloseDl
-  def _HtmlBlockDl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenDl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockDl)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseDl)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseDl)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockDl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenFieldset = "<" Spnl ("fieldset" | "FIELDSET") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenFieldset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("fieldset")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FIELDSET")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenFieldset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseFieldset = "<" Spnl "/" ("fieldset" | "FIELDSET") Spnl ">"
-  def _HtmlBlockCloseFieldset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("fieldset")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FIELDSET")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseFieldset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockFieldset = HtmlBlockOpenFieldset (HtmlBlockFieldset | !HtmlBlockCloseFieldset .)* HtmlBlockCloseFieldset
-  def _HtmlBlockFieldset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenFieldset)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockFieldset)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseFieldset)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseFieldset)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockFieldset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenForm = "<" Spnl ("form" | "FORM") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenForm
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("form")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FORM")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenForm unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseForm = "<" Spnl "/" ("form" | "FORM") Spnl ">"
-  def _HtmlBlockCloseForm
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("form")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FORM")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseForm unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockForm = HtmlBlockOpenForm (HtmlBlockForm | !HtmlBlockCloseForm .)* HtmlBlockCloseForm
-  def _HtmlBlockForm
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenForm)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockForm)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseForm)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseForm)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockForm unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH1 = "<" Spnl ("h1" | "H1") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH1
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h1")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H1")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH1 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH1 = "<" Spnl "/" ("h1" | "H1") Spnl ">"
-  def _HtmlBlockCloseH1
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h1")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H1")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH1 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH1 = HtmlBlockOpenH1 (HtmlBlockH1 | !HtmlBlockCloseH1 .)* HtmlBlockCloseH1
-  def _HtmlBlockH1
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH1)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH1)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH1)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH1)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH1 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH2 = "<" Spnl ("h2" | "H2") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h2")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H2")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH2 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH2 = "<" Spnl "/" ("h2" | "H2") Spnl ">"
-  def _HtmlBlockCloseH2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h2")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H2")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH2 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH2 = HtmlBlockOpenH2 (HtmlBlockH2 | !HtmlBlockCloseH2 .)* HtmlBlockCloseH2
-  def _HtmlBlockH2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH2)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH2)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH2)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH2)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH2 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH3 = "<" Spnl ("h3" | "H3") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH3
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h3")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H3")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH3 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH3 = "<" Spnl "/" ("h3" | "H3") Spnl ">"
-  def _HtmlBlockCloseH3
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h3")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H3")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH3 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH3 = HtmlBlockOpenH3 (HtmlBlockH3 | !HtmlBlockCloseH3 .)* HtmlBlockCloseH3
-  def _HtmlBlockH3
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH3)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH3)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH3)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH3)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH3 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH4 = "<" Spnl ("h4" | "H4") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH4
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h4")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H4")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH4 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH4 = "<" Spnl "/" ("h4" | "H4") Spnl ">"
-  def _HtmlBlockCloseH4
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h4")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H4")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH4 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH4 = HtmlBlockOpenH4 (HtmlBlockH4 | !HtmlBlockCloseH4 .)* HtmlBlockCloseH4
-  def _HtmlBlockH4
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH4)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH4)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH4)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH4)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH4 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH5 = "<" Spnl ("h5" | "H5") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH5
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h5")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H5")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH5 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH5 = "<" Spnl "/" ("h5" | "H5") Spnl ">"
-  def _HtmlBlockCloseH5
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h5")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H5")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH5 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH5 = HtmlBlockOpenH5 (HtmlBlockH5 | !HtmlBlockCloseH5 .)* HtmlBlockCloseH5
-  def _HtmlBlockH5
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH5)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH5)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH5)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH5)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH5 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenH6 = "<" Spnl ("h6" | "H6") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenH6
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h6")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H6")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenH6 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseH6 = "<" Spnl "/" ("h6" | "H6") Spnl ">"
-  def _HtmlBlockCloseH6
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("h6")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("H6")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseH6 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockH6 = HtmlBlockOpenH6 (HtmlBlockH6 | !HtmlBlockCloseH6 .)* HtmlBlockCloseH6
-  def _HtmlBlockH6
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenH6)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockH6)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseH6)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseH6)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockH6 unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenMenu = "<" Spnl ("menu" | "MENU") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenMenu
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("menu")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("MENU")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenMenu unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseMenu = "<" Spnl "/" ("menu" | "MENU") Spnl ">"
-  def _HtmlBlockCloseMenu
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("menu")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("MENU")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseMenu unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockMenu = HtmlBlockOpenMenu (HtmlBlockMenu | !HtmlBlockCloseMenu .)* HtmlBlockCloseMenu
-  def _HtmlBlockMenu
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenMenu)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockMenu)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseMenu)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseMenu)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockMenu unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenNoframes = "<" Spnl ("noframes" | "NOFRAMES") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenNoframes
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("noframes")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("NOFRAMES")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenNoframes unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseNoframes = "<" Spnl "/" ("noframes" | "NOFRAMES") Spnl ">"
-  def _HtmlBlockCloseNoframes
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("noframes")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("NOFRAMES")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseNoframes unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockNoframes = HtmlBlockOpenNoframes (HtmlBlockNoframes | !HtmlBlockCloseNoframes .)* HtmlBlockCloseNoframes
-  def _HtmlBlockNoframes
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenNoframes)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockNoframes)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseNoframes)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseNoframes)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockNoframes unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenNoscript = "<" Spnl ("noscript" | "NOSCRIPT") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenNoscript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("noscript")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("NOSCRIPT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenNoscript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseNoscript = "<" Spnl "/" ("noscript" | "NOSCRIPT") Spnl ">"
-  def _HtmlBlockCloseNoscript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("noscript")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("NOSCRIPT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseNoscript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockNoscript = HtmlBlockOpenNoscript (HtmlBlockNoscript | !HtmlBlockCloseNoscript .)* HtmlBlockCloseNoscript
-  def _HtmlBlockNoscript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenNoscript)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockNoscript)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseNoscript)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseNoscript)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockNoscript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenOl = "<" Spnl ("ol" | "OL") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenOl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("ol")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("OL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenOl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseOl = "<" Spnl "/" ("ol" | "OL") Spnl ">"
-  def _HtmlBlockCloseOl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("ol")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("OL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseOl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOl = HtmlBlockOpenOl (HtmlBlockOl | !HtmlBlockCloseOl .)* HtmlBlockCloseOl
-  def _HtmlBlockOl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenOl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockOl)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseOl)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseOl)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenP = "<" Spnl ("p" | "P") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenP
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("p")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("P")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenP unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseP = "<" Spnl "/" ("p" | "P") Spnl ">"
-  def _HtmlBlockCloseP
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("p")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("P")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseP unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockP = HtmlBlockOpenP (HtmlBlockP | !HtmlBlockCloseP .)* HtmlBlockCloseP
-  def _HtmlBlockP
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenP)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockP)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseP)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseP)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockP unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenPre = "<" Spnl ("pre" | "PRE") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenPre
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("pre")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("PRE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenPre unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockClosePre = "<" Spnl "/" ("pre" | "PRE") Spnl ">"
-  def _HtmlBlockClosePre
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("pre")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("PRE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockClosePre unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockPre = HtmlBlockOpenPre (HtmlBlockPre | !HtmlBlockClosePre .)* HtmlBlockClosePre
-  def _HtmlBlockPre
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenPre)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockPre)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockClosePre)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockClosePre)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockPre unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTable = "<" Spnl ("table" | "TABLE") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTable
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("table")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TABLE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTable unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTable = "<" Spnl "/" ("table" | "TABLE") Spnl ">"
-  def _HtmlBlockCloseTable
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("table")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TABLE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTable unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTable = HtmlBlockOpenTable (HtmlBlockTable | !HtmlBlockCloseTable .)* HtmlBlockCloseTable
-  def _HtmlBlockTable
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTable)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTable)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTable)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTable)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTable unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenUl = "<" Spnl ("ul" | "UL") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenUl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("ul")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("UL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenUl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseUl = "<" Spnl "/" ("ul" | "UL") Spnl ">"
-  def _HtmlBlockCloseUl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("ul")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("UL")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseUl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockUl = HtmlBlockOpenUl (HtmlBlockUl | !HtmlBlockCloseUl .)* HtmlBlockCloseUl
-  def _HtmlBlockUl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenUl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockUl)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseUl)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseUl)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockUl unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenDd = "<" Spnl ("dd" | "DD") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenDd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dd")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenDd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseDd = "<" Spnl "/" ("dd" | "DD") Spnl ">"
-  def _HtmlBlockCloseDd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dd")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseDd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockDd = HtmlBlockOpenDd (HtmlBlockDd | !HtmlBlockCloseDd .)* HtmlBlockCloseDd
-  def _HtmlBlockDd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenDd)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockDd)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseDd)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseDd)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockDd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenDt = "<" Spnl ("dt" | "DT") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenDt
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dt")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenDt unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseDt = "<" Spnl "/" ("dt" | "DT") Spnl ">"
-  def _HtmlBlockCloseDt
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("dt")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("DT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseDt unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockDt = HtmlBlockOpenDt (HtmlBlockDt | !HtmlBlockCloseDt .)* HtmlBlockCloseDt
-  def _HtmlBlockDt
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenDt)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockDt)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseDt)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseDt)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockDt unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenFrameset = "<" Spnl ("frameset" | "FRAMESET") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenFrameset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("frameset")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FRAMESET")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenFrameset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseFrameset = "<" Spnl "/" ("frameset" | "FRAMESET") Spnl ">"
-  def _HtmlBlockCloseFrameset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("frameset")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("FRAMESET")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseFrameset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockFrameset = HtmlBlockOpenFrameset (HtmlBlockFrameset | !HtmlBlockCloseFrameset .)* HtmlBlockCloseFrameset
-  def _HtmlBlockFrameset
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenFrameset)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockFrameset)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseFrameset)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseFrameset)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockFrameset unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenLi = "<" Spnl ("li" | "LI") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenLi
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("li")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("LI")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenLi unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseLi = "<" Spnl "/" ("li" | "LI") Spnl ">"
-  def _HtmlBlockCloseLi
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("li")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("LI")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseLi unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockLi = HtmlBlockOpenLi (HtmlBlockLi | !HtmlBlockCloseLi .)* HtmlBlockCloseLi
-  def _HtmlBlockLi
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenLi)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockLi)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseLi)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseLi)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockLi unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTbody = "<" Spnl ("tbody" | "TBODY") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTbody
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tbody")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TBODY")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTbody unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTbody = "<" Spnl "/" ("tbody" | "TBODY") Spnl ">"
-  def _HtmlBlockCloseTbody
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tbody")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TBODY")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTbody unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTbody = HtmlBlockOpenTbody (HtmlBlockTbody | !HtmlBlockCloseTbody .)* HtmlBlockCloseTbody
-  def _HtmlBlockTbody
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTbody)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTbody)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTbody)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTbody)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTbody unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTd = "<" Spnl ("td" | "TD") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("td")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTd = "<" Spnl "/" ("td" | "TD") Spnl ">"
-  def _HtmlBlockCloseTd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("td")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTd = HtmlBlockOpenTd (HtmlBlockTd | !HtmlBlockCloseTd .)* HtmlBlockCloseTd
-  def _HtmlBlockTd
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTd)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTd)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTd)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTd)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTd unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTfoot = "<" Spnl ("tfoot" | "TFOOT") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTfoot
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tfoot")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TFOOT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTfoot unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTfoot = "<" Spnl "/" ("tfoot" | "TFOOT") Spnl ">"
-  def _HtmlBlockCloseTfoot
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tfoot")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TFOOT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTfoot unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTfoot = HtmlBlockOpenTfoot (HtmlBlockTfoot | !HtmlBlockCloseTfoot .)* HtmlBlockCloseTfoot
-  def _HtmlBlockTfoot
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTfoot)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTfoot)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTfoot)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTfoot)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTfoot unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTh = "<" Spnl ("th" | "TH") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTh
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("th")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TH")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTh unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTh = "<" Spnl "/" ("th" | "TH") Spnl ">"
-  def _HtmlBlockCloseTh
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("th")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TH")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTh unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTh = HtmlBlockOpenTh (HtmlBlockTh | !HtmlBlockCloseTh .)* HtmlBlockCloseTh
-  def _HtmlBlockTh
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTh)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTh)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTh)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTh)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTh unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenThead = "<" Spnl ("thead" | "THEAD") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenThead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("thead")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("THEAD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenThead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseThead = "<" Spnl "/" ("thead" | "THEAD") Spnl ">"
-  def _HtmlBlockCloseThead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("thead")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("THEAD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseThead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockThead = HtmlBlockOpenThead (HtmlBlockThead | !HtmlBlockCloseThead .)* HtmlBlockCloseThead
-  def _HtmlBlockThead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenThead)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockThead)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseThead)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseThead)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockThead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenTr = "<" Spnl ("tr" | "TR") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenTr
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tr")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TR")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenTr unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseTr = "<" Spnl "/" ("tr" | "TR") Spnl ">"
-  def _HtmlBlockCloseTr
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("tr")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("TR")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseTr unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockTr = HtmlBlockOpenTr (HtmlBlockTr | !HtmlBlockCloseTr .)* HtmlBlockCloseTr
-  def _HtmlBlockTr
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenTr)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # choice
-          _tmp = apply(:_HtmlBlockTr)
-          break if _tmp
-          self.pos = _save2
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = apply(:_HtmlBlockCloseTr)
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break if _tmp
-          self.pos = _save2
-          break
-        end # end choice
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseTr)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockTr unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenScript = "<" Spnl ("script" | "SCRIPT") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenScript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("script")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("SCRIPT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenScript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseScript = "<" Spnl "/" ("script" | "SCRIPT") Spnl ">"
-  def _HtmlBlockCloseScript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("script")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("SCRIPT")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseScript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockScript = HtmlBlockOpenScript (!HtmlBlockCloseScript .)* HtmlBlockCloseScript
-  def _HtmlBlockScript
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenScript)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-          _tmp = apply(:_HtmlBlockCloseScript)
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseScript)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockScript unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockOpenHead = "<" Spnl ("head" | "HEAD") Spnl HtmlAttribute* ">"
-  def _HtmlBlockOpenHead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("head")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("HEAD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockOpenHead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockCloseHead = "<" Spnl "/" ("head" | "HEAD") Spnl ">"
-  def _HtmlBlockCloseHead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("head")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("HEAD")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockCloseHead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockHead = HtmlBlockOpenHead (!HtmlBlockCloseHead .)* HtmlBlockCloseHead
-  def _HtmlBlockHead
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_HtmlBlockOpenHead)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-          _tmp = apply(:_HtmlBlockCloseHead)
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockCloseHead)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockHead unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockInTags = (HtmlAnchor | HtmlBlockAddress | HtmlBlockBlockquote | HtmlBlockCenter | HtmlBlockDir | HtmlBlockDiv | HtmlBlockDl | HtmlBlockFieldset | HtmlBlockForm | HtmlBlockH1 | HtmlBlockH2 | HtmlBlockH3 | HtmlBlockH4 | HtmlBlockH5 | HtmlBlockH6 | HtmlBlockMenu | HtmlBlockNoframes | HtmlBlockNoscript | HtmlBlockOl | HtmlBlockP | HtmlBlockPre | HtmlBlockTable | HtmlBlockUl | HtmlBlockDd | HtmlBlockDt | HtmlBlockFrameset | HtmlBlockLi | HtmlBlockTbody | HtmlBlockTd | HtmlBlockTfoot | HtmlBlockTh | HtmlBlockThead | HtmlBlockTr | HtmlBlockScript | HtmlBlockHead)
-  def _HtmlBlockInTags
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_HtmlAnchor)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockAddress)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockBlockquote)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockCenter)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockDir)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockDiv)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockDl)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockFieldset)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockForm)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH1)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH2)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH3)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH4)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH5)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockH6)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockMenu)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockNoframes)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockNoscript)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockOl)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockP)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockPre)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTable)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockUl)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockDd)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockDt)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockFrameset)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockLi)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTbody)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTd)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTfoot)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTh)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockThead)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockTr)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockScript)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_HtmlBlockHead)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_HtmlBlockInTags unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlock = < (HtmlBlockInTags | HtmlComment | HtmlBlockSelfClosing | HtmlUnclosed) > @BlankLine+ { if html? then                 RDoc::Markup::Raw.new text               end }
-  def _HtmlBlock
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_HtmlBlockInTags)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_HtmlComment)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_HtmlBlockSelfClosing)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_HtmlUnclosed)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  if html? then
-                RDoc::Markup::Raw.new text
-              end ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlock unless _tmp
-    return _tmp
-  end
-
-  # HtmlUnclosed = "<" Spnl HtmlUnclosedType Spnl HtmlAttribute* Spnl ">"
-  def _HtmlUnclosed
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlUnclosedType)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlUnclosed unless _tmp
-    return _tmp
-  end
-
-  # HtmlUnclosedType = ("HR" | "hr")
-  def _HtmlUnclosedType
-
-    _save = self.pos
-    while true # choice
-      _tmp = match_string("HR")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("hr")
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_HtmlUnclosedType unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockSelfClosing = "<" Spnl HtmlBlockType Spnl HtmlAttribute* "/" Spnl ">"
-  def _HtmlBlockSelfClosing
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_HtmlBlockType)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlBlockSelfClosing unless _tmp
-    return _tmp
-  end
-
-  # HtmlBlockType = ("ADDRESS" | "BLOCKQUOTE" | "CENTER" | "DD" | "DIR" | "DIV" | "DL" | "DT" | "FIELDSET" | "FORM" | "FRAMESET" | "H1" | "H2" | "H3" | "H4" | "H5" | "H6" | "HR" | "ISINDEX" | "LI" | "MENU" | "NOFRAMES" | "NOSCRIPT" | "OL" | "P" | "PRE" | "SCRIPT" | "TABLE" | "TBODY" | "TD" | "TFOOT" | "TH" | "THEAD" | "TR" | "UL" | "address" | "blockquote" | "center" | "dd" | "dir" | "div" | "dl" | "dt" | "fieldset" | "form" | "frameset" | "h1" | "h2" | "h3" | "h4" | "h5" | "h6" | "hr" | "isindex" | "li" | "menu" | "noframes" | "noscript" | "ol" | "p" | "pre" | "script" | "table" | "tbody" | "td" | "tfoot" | "th" | "thead" | "tr" | "ul")
-  def _HtmlBlockType
-
-    _save = self.pos
-    while true # choice
-      _tmp = match_string("ADDRESS")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("BLOCKQUOTE")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("CENTER")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("DD")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("DIR")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("DIV")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("DL")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("DT")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("FIELDSET")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("FORM")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("FRAMESET")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H1")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H2")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H3")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H4")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H5")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("H6")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("HR")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("ISINDEX")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("LI")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("MENU")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("NOFRAMES")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("NOSCRIPT")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("OL")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("P")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("PRE")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("SCRIPT")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TABLE")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TBODY")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TD")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TFOOT")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TH")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("THEAD")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("TR")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("UL")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("address")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("blockquote")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("center")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("dd")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("dir")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("div")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("dl")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("dt")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("fieldset")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("form")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("frameset")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h1")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h2")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h3")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h4")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h5")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("h6")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("hr")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("isindex")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("li")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("menu")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("noframes")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("noscript")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("ol")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("p")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("pre")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("script")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("table")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("tbody")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("td")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("tfoot")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("th")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("thead")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("tr")
-      break if _tmp
-      self.pos = _save
-      _tmp = match_string("ul")
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_HtmlBlockType unless _tmp
-    return _tmp
-  end
-
-  # StyleOpen = "<" Spnl ("style" | "STYLE") Spnl HtmlAttribute* ">"
-  def _StyleOpen
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("style")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("STYLE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StyleOpen unless _tmp
-    return _tmp
-  end
-
-  # StyleClose = "<" Spnl "/" ("style" | "STYLE") Spnl ">"
-  def _StyleClose
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("/")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = match_string("style")
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("STYLE")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StyleClose unless _tmp
-    return _tmp
-  end
-
-  # InStyleTags = StyleOpen (!StyleClose .)* StyleClose
-  def _InStyleTags
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_StyleOpen)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-          _tmp = apply(:_StyleClose)
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_StyleClose)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_InStyleTags unless _tmp
-    return _tmp
-  end
-
-  # StyleBlock = < InStyleTags > @BlankLine* { if css? then                     RDoc::Markup::Raw.new text                   end }
-  def _StyleBlock
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _tmp = apply(:_InStyleTags)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = _BlankLine()
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  if css? then
-                    RDoc::Markup::Raw.new text
-                  end ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StyleBlock unless _tmp
-    return _tmp
-  end
-
-  # Inlines = (!@Endline Inline:i { i } | @Endline:c !(&{ github? } Ticks3 /[^`\n]*$/) &Inline { c })+:chunks @Endline? { chunks }
-  def _Inlines
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _ary = []
-
-      _save2 = self.pos
-      while true # choice
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = _Endline()
-          _tmp = _tmp ? nil : true
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = apply(:_Inline)
-          i = @result
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          @result = begin;  i ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save2
-
-        _save5 = self.pos
-        while true # sequence
-          _tmp = _Endline()
-          c = @result
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _save6 = self.pos
-
-          _save7 = self.pos
-          while true # sequence
-            _save8 = self.pos
-            _tmp = begin;  github? ; end
-            self.pos = _save8
-            unless _tmp
-              self.pos = _save7
-              break
-            end
-            _tmp = apply(:_Ticks3)
-            unless _tmp
-              self.pos = _save7
-              break
-            end
-            _tmp = scan(/\G(?-mix:[^`\n]*$)/)
-            unless _tmp
-              self.pos = _save7
-            end
-            break
-          end # end sequence
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save6
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _save9 = self.pos
-          _tmp = apply(:_Inline)
-          self.pos = _save9
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          @result = begin;  c ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save5
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      if _tmp
-        _ary << @result
-        while true
-
-          _save10 = self.pos
-          while true # choice
-
-            _save11 = self.pos
-            while true # sequence
-              _save12 = self.pos
-              _tmp = _Endline()
-              _tmp = _tmp ? nil : true
-              self.pos = _save12
-              unless _tmp
-                self.pos = _save11
-                break
-              end
-              _tmp = apply(:_Inline)
-              i = @result
-              unless _tmp
-                self.pos = _save11
-                break
-              end
-              @result = begin;  i ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save11
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save10
-
-            _save13 = self.pos
-            while true # sequence
-              _tmp = _Endline()
-              c = @result
-              unless _tmp
-                self.pos = _save13
-                break
-              end
-              _save14 = self.pos
-
-              _save15 = self.pos
-              while true # sequence
-                _save16 = self.pos
-                _tmp = begin;  github? ; end
-                self.pos = _save16
-                unless _tmp
-                  self.pos = _save15
-                  break
-                end
-                _tmp = apply(:_Ticks3)
-                unless _tmp
-                  self.pos = _save15
-                  break
-                end
-                _tmp = scan(/\G(?-mix:[^`\n]*$)/)
-                unless _tmp
-                  self.pos = _save15
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save14
-              unless _tmp
-                self.pos = _save13
-                break
-              end
-              _save17 = self.pos
-              _tmp = apply(:_Inline)
-              self.pos = _save17
-              unless _tmp
-                self.pos = _save13
-                break
-              end
-              @result = begin;  c ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save13
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save10
-            break
-          end # end choice
-
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      chunks = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save18 = self.pos
-      _tmp = _Endline()
-      unless _tmp
-        _tmp = true
-        self.pos = _save18
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  chunks ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Inlines unless _tmp
-    return _tmp
-  end
-
-  # Inline = (Str | @Endline | UlOrStarLine | @Space | Strong | Emph | Strike | Image | Link | NoteReference | InlineNote | Code | RawHtml | Entity | EscapedChar | Symbol)
-  def _Inline
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_Str)
-      break if _tmp
-      self.pos = _save
-      _tmp = _Endline()
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_UlOrStarLine)
-      break if _tmp
-      self.pos = _save
-      _tmp = _Space()
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Strong)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Emph)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Strike)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Image)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Link)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_NoteReference)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_InlineNote)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Code)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_RawHtml)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Entity)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_EscapedChar)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_Symbol)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Inline unless _tmp
-    return _tmp
-  end
-
-  # Space = @Spacechar+ { " " }
-  def _Space
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _Spacechar()
-      if _tmp
-        while true
-          _tmp = _Spacechar()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  " " ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Space unless _tmp
-    return _tmp
-  end
-
-  # Str = @StartList:a < @NormalChar+ > { a = text } (StrChunk:c { a << c })* { a }
-  def _Str
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _save1 = self.pos
-      _tmp = _NormalChar()
-      if _tmp
-        while true
-          _tmp = _NormalChar()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a = text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save3 = self.pos
-        while true # sequence
-          _tmp = apply(:_StrChunk)
-          c = @result
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          @result = begin;  a << c ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Str unless _tmp
-    return _tmp
-  end
-
-  # StrChunk = < (@NormalChar | /_+/ &Alphanumeric)+ > { text }
-  def _StrChunk
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = _NormalChar()
-        break if _tmp
-        self.pos = _save2
-
-        _save3 = self.pos
-        while true # sequence
-          _tmp = scan(/\G(?-mix:_+)/)
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save4 = self.pos
-          _tmp = apply(:_Alphanumeric)
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # choice
-            _tmp = _NormalChar()
-            break if _tmp
-            self.pos = _save5
-
-            _save6 = self.pos
-            while true # sequence
-              _tmp = scan(/\G(?-mix:_+)/)
-              unless _tmp
-                self.pos = _save6
-                break
-              end
-              _save7 = self.pos
-              _tmp = apply(:_Alphanumeric)
-              self.pos = _save7
-              unless _tmp
-                self.pos = _save6
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save5
-            break
-          end # end choice
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StrChunk unless _tmp
-    return _tmp
-  end
-
-  # EscapedChar = "\\" !@Newline < /[:\\`|*_{}\[\]()#+.!><-]/ > { text }
-  def _EscapedChar
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("\\")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _Newline()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:[:\\`|*_{}\[\]()#+.!><-])/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_EscapedChar unless _tmp
-    return _tmp
-  end
-
-  # Entity = (HexEntity | DecEntity | CharEntity):a { a }
-  def _Entity
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_HexEntity)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_DecEntity)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_CharEntity)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Entity unless _tmp
-    return _tmp
-  end
-
-  # Endline = (@LineBreak | @TerminalEndline | @NormalEndline)
-  def _Endline
-
-    _save = self.pos
-    while true # choice
-      _tmp = _LineBreak()
-      break if _tmp
-      self.pos = _save
-      _tmp = _TerminalEndline()
-      break if _tmp
-      self.pos = _save
-      _tmp = _NormalEndline()
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Endline unless _tmp
-    return _tmp
-  end
-
-  # NormalEndline = @Sp @Newline !@BlankLine !">" !AtxStart !(Line /={1,}|-{1,}/ @Newline) { "\n" }
-  def _NormalEndline
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = match_string(">")
-      _tmp = _tmp ? nil : true
-      self.pos = _save2
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save3 = self.pos
-      _tmp = apply(:_AtxStart)
-      _tmp = _tmp ? nil : true
-      self.pos = _save3
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save4 = self.pos
-
-      _save5 = self.pos
-      while true # sequence
-        _tmp = apply(:_Line)
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-        _tmp = scan(/\G(?-mix:={1,}|-{1,})/)
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-        _tmp = _Newline()
-        unless _tmp
-          self.pos = _save5
-        end
-        break
-      end # end sequence
-
-      _tmp = _tmp ? nil : true
-      self.pos = _save4
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "\n" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_NormalEndline unless _tmp
-    return _tmp
-  end
-
-  # TerminalEndline = @Sp @Newline @Eof
-  def _TerminalEndline
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Eof()
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TerminalEndline unless _tmp
-    return _tmp
-  end
-
-  # LineBreak = "  " @NormalEndline { RDoc::Markup::HardBreak.new }
-  def _LineBreak
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("  ")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _NormalEndline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::HardBreak.new ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_LineBreak unless _tmp
-    return _tmp
-  end
-
-  # Symbol = < @SpecialChar > { text }
-  def _Symbol
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _tmp = _SpecialChar()
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Symbol unless _tmp
-    return _tmp
-  end
-
-  # UlOrStarLine = (UlLine | StarLine):a { a }
-  def _UlOrStarLine
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_UlLine)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_StarLine)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_UlOrStarLine unless _tmp
-    return _tmp
-  end
-
-  # StarLine = (< /\*{4,}/ > { text } | < @Spacechar /\*+/ &@Spacechar > { text })
-  def _StarLine
-
-    _save = self.pos
-    while true # choice
-
-      _save1 = self.pos
-      while true # sequence
-        _text_start = self.pos
-        _tmp = scan(/\G(?-mix:\*{4,})/)
-        if _tmp
-          text = get_text(_text_start)
-        end
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        @result = begin;  text ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save1
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-
-      _save2 = self.pos
-      while true # sequence
-        _text_start = self.pos
-
-        _save3 = self.pos
-        while true # sequence
-          _tmp = _Spacechar()
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = scan(/\G(?-mix:\*+)/)
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save4 = self.pos
-          _tmp = _Spacechar()
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          text = get_text(_text_start)
-        end
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        @result = begin;  text ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_StarLine unless _tmp
-    return _tmp
-  end
-
-  # UlLine = (< /_{4,}/ > { text } | < @Spacechar /_+/ &@Spacechar > { text })
-  def _UlLine
-
-    _save = self.pos
-    while true # choice
-
-      _save1 = self.pos
-      while true # sequence
-        _text_start = self.pos
-        _tmp = scan(/\G(?-mix:_{4,})/)
-        if _tmp
-          text = get_text(_text_start)
-        end
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        @result = begin;  text ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save1
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-
-      _save2 = self.pos
-      while true # sequence
-        _text_start = self.pos
-
-        _save3 = self.pos
-        while true # sequence
-          _tmp = _Spacechar()
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = scan(/\G(?-mix:_+)/)
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save4 = self.pos
-          _tmp = _Spacechar()
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          text = get_text(_text_start)
-        end
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        @result = begin;  text ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_UlLine unless _tmp
-    return _tmp
-  end
-
-  # Emph = (EmphStar | EmphUl)
-  def _Emph
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_EmphStar)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_EmphUl)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Emph unless _tmp
-    return _tmp
-  end
-
-  # Whitespace = (@Spacechar | @Newline)
-  def _Whitespace
-
-    _save = self.pos
-    while true # choice
-      _tmp = _Spacechar()
-      break if _tmp
-      self.pos = _save
-      _tmp = _Newline()
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Whitespace unless _tmp
-    return _tmp
-  end
-
-  # EmphStar = "*" !@Whitespace @StartList:a (!"*" Inline:b { a << b } | StrongStar:b { a << b })+ "*" { emphasis a.join }
-  def _EmphStar
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("*")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _Whitespace()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # choice
-
-        _save4 = self.pos
-        while true # sequence
-          _save5 = self.pos
-          _tmp = match_string("*")
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          _tmp = apply(:_Inline)
-          b = @result
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          @result = begin;  a << b ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save4
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save3
-
-        _save6 = self.pos
-        while true # sequence
-          _tmp = apply(:_StrongStar)
-          b = @result
-          unless _tmp
-            self.pos = _save6
-            break
-          end
-          @result = begin;  a << b ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save6
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save3
-        break
-      end # end choice
-
-      if _tmp
-        while true
-
-          _save7 = self.pos
-          while true # choice
-
-            _save8 = self.pos
-            while true # sequence
-              _save9 = self.pos
-              _tmp = match_string("*")
-              _tmp = _tmp ? nil : true
-              self.pos = _save9
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _tmp = apply(:_Inline)
-              b = @result
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              @result = begin;  a << b ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save8
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save7
-
-            _save10 = self.pos
-            while true # sequence
-              _tmp = apply(:_StrongStar)
-              b = @result
-              unless _tmp
-                self.pos = _save10
-                break
-              end
-              @result = begin;  a << b ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save10
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save7
-            break
-          end # end choice
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("*")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  emphasis a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_EmphStar unless _tmp
-    return _tmp
-  end
-
-  # EmphUl = "_" !@Whitespace @StartList:a (!"_" Inline:b { a << b } | StrongUl:b { a << b })+ "_" { emphasis a.join }
-  def _EmphUl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("_")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _Whitespace()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # choice
-
-        _save4 = self.pos
-        while true # sequence
-          _save5 = self.pos
-          _tmp = match_string("_")
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          _tmp = apply(:_Inline)
-          b = @result
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          @result = begin;  a << b ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save4
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save3
-
-        _save6 = self.pos
-        while true # sequence
-          _tmp = apply(:_StrongUl)
-          b = @result
-          unless _tmp
-            self.pos = _save6
-            break
-          end
-          @result = begin;  a << b ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save6
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save3
-        break
-      end # end choice
-
-      if _tmp
-        while true
-
-          _save7 = self.pos
-          while true # choice
-
-            _save8 = self.pos
-            while true # sequence
-              _save9 = self.pos
-              _tmp = match_string("_")
-              _tmp = _tmp ? nil : true
-              self.pos = _save9
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _tmp = apply(:_Inline)
-              b = @result
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              @result = begin;  a << b ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save8
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save7
-
-            _save10 = self.pos
-            while true # sequence
-              _tmp = apply(:_StrongUl)
-              b = @result
-              unless _tmp
-                self.pos = _save10
-                break
-              end
-              @result = begin;  a << b ; end
-              _tmp = true
-              unless _tmp
-                self.pos = _save10
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save7
-            break
-          end # end choice
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("_")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  emphasis a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_EmphUl unless _tmp
-    return _tmp
-  end
-
-  # Strong = (StrongStar | StrongUl)
-  def _Strong
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_StrongStar)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_StrongUl)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Strong unless _tmp
-    return _tmp
-  end
-
-  # StrongStar = "**" !@Whitespace @StartList:a (!"**" Inline:b { a << b })+ "**" { strong a.join }
-  def _StrongStar
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("**")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _Whitespace()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _save4 = self.pos
-        _tmp = match_string("**")
-        _tmp = _tmp ? nil : true
-        self.pos = _save4
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = apply(:_Inline)
-        b = @result
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = match_string("**")
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = apply(:_Inline)
-            b = @result
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("**")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  strong a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StrongStar unless _tmp
-    return _tmp
-  end
-
-  # StrongUl = "__" !@Whitespace @StartList:a (!"__" Inline:b { a << b })+ "__" { strong a.join }
-  def _StrongUl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("__")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _Whitespace()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _save4 = self.pos
-        _tmp = match_string("__")
-        _tmp = _tmp ? nil : true
-        self.pos = _save4
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = apply(:_Inline)
-        b = @result
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = match_string("__")
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = apply(:_Inline)
-            b = @result
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("__")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  strong a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StrongUl unless _tmp
-    return _tmp
-  end
-
-  # Strike = &{ strike? } "~~" !@Whitespace @StartList:a (!"~~" Inline:b { a << b })+ "~~" { strike a.join }
-  def _Strike
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  strike? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("~~")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = _Whitespace()
-      _tmp = _tmp ? nil : true
-      self.pos = _save2
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save3 = self.pos
-
-      _save4 = self.pos
-      while true # sequence
-        _save5 = self.pos
-        _tmp = match_string("~~")
-        _tmp = _tmp ? nil : true
-        self.pos = _save5
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        _tmp = apply(:_Inline)
-        b = @result
-        unless _tmp
-          self.pos = _save4
-          break
-        end
-        @result = begin;  a << b ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save4
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save6 = self.pos
-          while true # sequence
-            _save7 = self.pos
-            _tmp = match_string("~~")
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            _tmp = apply(:_Inline)
-            b = @result
-            unless _tmp
-              self.pos = _save6
-              break
-            end
-            @result = begin;  a << b ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save6
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save3
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("~~")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  strike a.join ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Strike unless _tmp
-    return _tmp
-  end
-
-  # Image = "!" (ExplicitLink | ReferenceLink):a { "rdoc-image:#{a[/\[(.*)\]/, 1]}" }
-  def _Image
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("!")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_ExplicitLink)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_ReferenceLink)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "rdoc-image:#{a[/\[(.*)\]/, 1]}" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Image unless _tmp
-    return _tmp
-  end
-
-  # Link = (ExplicitLink | ReferenceLink | AutoLink)
-  def _Link
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_ExplicitLink)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_ReferenceLink)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_AutoLink)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Link unless _tmp
-    return _tmp
-  end
-
-  # ReferenceLink = (ReferenceLinkDouble | ReferenceLinkSingle)
-  def _ReferenceLink
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_ReferenceLinkDouble)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_ReferenceLinkSingle)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_ReferenceLink unless _tmp
-    return _tmp
-  end
-
-  # ReferenceLinkDouble = Label:content < Spnl > !"[]" Label:label { link_to content, label, text }
-  def _ReferenceLinkDouble
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Label)
-      content = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _tmp = apply(:_Spnl)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("[]")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Label)
-      label = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  link_to content, label, text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ReferenceLinkDouble unless _tmp
-    return _tmp
-  end
-
-  # ReferenceLinkSingle = Label:content < (Spnl "[]")? > { link_to content, content, text }
-  def _ReferenceLinkSingle
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Label)
-      content = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = apply(:_Spnl)
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = match_string("[]")
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  link_to content, content, text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ReferenceLinkSingle unless _tmp
-    return _tmp
-  end
-
-  # ExplicitLink = Label:l "(" @Sp Source:s Spnl Title @Sp ")" { "{#{l}}[#{s}]" }
-  def _ExplicitLink
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Label)
-      l = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("(")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Source)
-      s = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Title)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(")")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "{#{l}}[#{s}]" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ExplicitLink unless _tmp
-    return _tmp
-  end
-
-  # Source = ("<" < SourceContents > ">" | < SourceContents >) { text }
-  def _Source
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = match_string("<")
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _text_start = self.pos
-          _tmp = apply(:_SourceContents)
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = match_string(">")
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        _text_start = self.pos
-        _tmp = apply(:_SourceContents)
-        if _tmp
-          text = get_text(_text_start)
-        end
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Source unless _tmp
-    return _tmp
-  end
-
-  # SourceContents = ((!"(" !")" !">" Nonspacechar)+ | "(" SourceContents ")")*
-  def _SourceContents
-    while true
-
-      _save1 = self.pos
-      while true # choice
-        _save2 = self.pos
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = match_string("(")
-          _tmp = _tmp ? nil : true
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save5 = self.pos
-          _tmp = match_string(")")
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save6 = self.pos
-          _tmp = match_string(">")
-          _tmp = _tmp ? nil : true
-          self.pos = _save6
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = apply(:_Nonspacechar)
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          while true
-
-            _save7 = self.pos
-            while true # sequence
-              _save8 = self.pos
-              _tmp = match_string("(")
-              _tmp = _tmp ? nil : true
-              self.pos = _save8
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _save9 = self.pos
-              _tmp = match_string(")")
-              _tmp = _tmp ? nil : true
-              self.pos = _save9
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _save10 = self.pos
-              _tmp = match_string(">")
-              _tmp = _tmp ? nil : true
-              self.pos = _save10
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save7
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-        else
-          self.pos = _save2
-        end
-        break if _tmp
-        self.pos = _save1
-
-        _save11 = self.pos
-        while true # sequence
-          _tmp = match_string("(")
-          unless _tmp
-            self.pos = _save11
-            break
-          end
-          _tmp = apply(:_SourceContents)
-          unless _tmp
-            self.pos = _save11
-            break
-          end
-          _tmp = match_string(")")
-          unless _tmp
-            self.pos = _save11
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      break unless _tmp
-    end
-    _tmp = true
-    set_failed_rule :_SourceContents unless _tmp
-    return _tmp
-  end
-
-  # Title = (TitleSingle | TitleDouble | ""):a { a }
-  def _Title
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_TitleSingle)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_TitleDouble)
-        break if _tmp
-        self.pos = _save1
-        _tmp = match_string("")
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Title unless _tmp
-    return _tmp
-  end
-
-  # TitleSingle = "'" (!("'" @Sp (")" | @Newline)) .)* "'"
-  def _TitleSingle
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("'")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # sequence
-            _tmp = match_string("'")
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            _tmp = _Sp()
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-
-            _save5 = self.pos
-            while true # choice
-              _tmp = match_string(")")
-              break if _tmp
-              self.pos = _save5
-              _tmp = _Newline()
-              break if _tmp
-              self.pos = _save5
-              break
-            end # end choice
-
-            unless _tmp
-              self.pos = _save4
-            end
-            break
-          end # end sequence
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("'")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TitleSingle unless _tmp
-    return _tmp
-  end
-
-  # TitleDouble = "\"" (!("\"" @Sp (")" | @Newline)) .)* "\""
-  def _TitleDouble
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("\"")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # sequence
-            _tmp = match_string("\"")
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-            _tmp = _Sp()
-            unless _tmp
-              self.pos = _save4
-              break
-            end
-
-            _save5 = self.pos
-            while true # choice
-              _tmp = match_string(")")
-              break if _tmp
-              self.pos = _save5
-              _tmp = _Newline()
-              break if _tmp
-              self.pos = _save5
-              break
-            end # end choice
-
-            unless _tmp
-              self.pos = _save4
-            end
-            break
-          end # end sequence
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("\"")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TitleDouble unless _tmp
-    return _tmp
-  end
-
-  # AutoLink = (AutoLinkUrl | AutoLinkEmail)
-  def _AutoLink
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_AutoLinkUrl)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_AutoLinkEmail)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_AutoLink unless _tmp
-    return _tmp
-  end
-
-  # AutoLinkUrl = "<" < /[A-Za-z]+/ "://" (!@Newline !">" .)+ > ">" { text }
-  def _AutoLinkUrl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-
-      _save1 = self.pos
-      while true # sequence
-        _tmp = scan(/\G(?-mix:[A-Za-z]+)/)
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        _tmp = match_string("://")
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        _save2 = self.pos
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = _Newline()
-          _tmp = _tmp ? nil : true
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save5 = self.pos
-          _tmp = match_string(">")
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          while true
-
-            _save6 = self.pos
-            while true # sequence
-              _save7 = self.pos
-              _tmp = _Newline()
-              _tmp = _tmp ? nil : true
-              self.pos = _save7
-              unless _tmp
-                self.pos = _save6
-                break
-              end
-              _save8 = self.pos
-              _tmp = match_string(">")
-              _tmp = _tmp ? nil : true
-              self.pos = _save8
-              unless _tmp
-                self.pos = _save6
-                break
-              end
-              _tmp = get_byte
-              unless _tmp
-                self.pos = _save6
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-        else
-          self.pos = _save2
-        end
-        unless _tmp
-          self.pos = _save1
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_AutoLinkUrl unless _tmp
-    return _tmp
-  end
-
-  # AutoLinkEmail = "<" "mailto:"? < /[\w+.\/!%~$-]+/i "@" (!@Newline !">" .)+ > ">" { "mailto:#{text}" }
-  def _AutoLinkEmail
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("mailto:")
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = scan(/\G(?i-mx:[\w+.\/!%~$-]+)/)
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = match_string("@")
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _save3 = self.pos
-
-        _save4 = self.pos
-        while true # sequence
-          _save5 = self.pos
-          _tmp = _Newline()
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          _save6 = self.pos
-          _tmp = match_string(">")
-          _tmp = _tmp ? nil : true
-          self.pos = _save6
-          unless _tmp
-            self.pos = _save4
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save4
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          while true
-
-            _save7 = self.pos
-            while true # sequence
-              _save8 = self.pos
-              _tmp = _Newline()
-              _tmp = _tmp ? nil : true
-              self.pos = _save8
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _save9 = self.pos
-              _tmp = match_string(">")
-              _tmp = _tmp ? nil : true
-              self.pos = _save9
-              unless _tmp
-                self.pos = _save7
-                break
-              end
-              _tmp = get_byte
-              unless _tmp
-                self.pos = _save7
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-        else
-          self.pos = _save3
-        end
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "mailto:#{text}" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_AutoLinkEmail unless _tmp
-    return _tmp
-  end
-
-  # Reference = @NonindentSpace !"[]" Label:label ":" Spnl RefSrc:link RefTitle @BlankLine+ { # TODO use title               reference label, link               nil             }
-  def _Reference
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("[]")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Label)
-      label = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(":")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_RefSrc)
-      link = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_RefTitle)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  # TODO use title
-              reference label, link
-              nil
-            ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Reference unless _tmp
-    return _tmp
-  end
-
-  # Label = "[" (!"^" &{ notes? } | &. &{ !notes? }) @StartList:a (!"]" Inline:l { a << l })* "]" { a.join.gsub(/\s+/, ' ') }
-  def _Label
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("[")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-          _tmp = match_string("^")
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _save4 = self.pos
-          _tmp = begin;  notes? ; end
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save5 = self.pos
-        while true # sequence
-          _save6 = self.pos
-          _tmp = get_byte
-          self.pos = _save6
-          unless _tmp
-            self.pos = _save5
-            break
-          end
-          _save7 = self.pos
-          _tmp = begin;  !notes? ; end
-          self.pos = _save7
-          unless _tmp
-            self.pos = _save5
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save9 = self.pos
-        while true # sequence
-          _save10 = self.pos
-          _tmp = match_string("]")
-          _tmp = _tmp ? nil : true
-          self.pos = _save10
-          unless _tmp
-            self.pos = _save9
-            break
-          end
-          _tmp = apply(:_Inline)
-          l = @result
-          unless _tmp
-            self.pos = _save9
-            break
-          end
-          @result = begin;  a << l ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save9
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("]")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a.join.gsub(/\s+/, ' ') ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Label unless _tmp
-    return _tmp
-  end
-
-  # RefSrc = < Nonspacechar+ > { text }
-  def _RefSrc
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _save1 = self.pos
-      _tmp = apply(:_Nonspacechar)
-      if _tmp
-        while true
-          _tmp = apply(:_Nonspacechar)
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RefSrc unless _tmp
-    return _tmp
-  end
-
-  # RefTitle = (RefTitleSingle | RefTitleDouble | RefTitleParens | EmptyTitle)
-  def _RefTitle
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_RefTitleSingle)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_RefTitleDouble)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_RefTitleParens)
-      break if _tmp
-      self.pos = _save
-      _tmp = apply(:_EmptyTitle)
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_RefTitle unless _tmp
-    return _tmp
-  end
-
-  # EmptyTitle = ""
-  def _EmptyTitle
-    _tmp = match_string("")
-    set_failed_rule :_EmptyTitle unless _tmp
-    return _tmp
-  end
-
-  # RefTitleSingle = Spnl "'" < (!("'" @Sp @Newline | @Newline) .)* > "'" { text }
-  def _RefTitleSingle
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("'")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # choice
-
-            _save5 = self.pos
-            while true # sequence
-              _tmp = match_string("'")
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Newline()
-              unless _tmp
-                self.pos = _save5
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save4
-            _tmp = _Newline()
-            break if _tmp
-            self.pos = _save4
-            break
-          end # end choice
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("'")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RefTitleSingle unless _tmp
-    return _tmp
-  end
-
-  # RefTitleDouble = Spnl "\"" < (!("\"" @Sp @Newline | @Newline) .)* > "\"" { text }
-  def _RefTitleDouble
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("\"")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # choice
-
-            _save5 = self.pos
-            while true # sequence
-              _tmp = match_string("\"")
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Newline()
-              unless _tmp
-                self.pos = _save5
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save4
-            _tmp = _Newline()
-            break if _tmp
-            self.pos = _save4
-            break
-          end # end choice
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("\"")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RefTitleDouble unless _tmp
-    return _tmp
-  end
-
-  # RefTitleParens = Spnl "(" < (!(")" @Sp @Newline | @Newline) .)* > ")" { text }
-  def _RefTitleParens
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("(")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # choice
-
-            _save5 = self.pos
-            while true # sequence
-              _tmp = match_string(")")
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Sp()
-              unless _tmp
-                self.pos = _save5
-                break
-              end
-              _tmp = _Newline()
-              unless _tmp
-                self.pos = _save5
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save4
-            _tmp = _Newline()
-            break if _tmp
-            self.pos = _save4
-            break
-          end # end choice
-
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(")")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RefTitleParens unless _tmp
-    return _tmp
-  end
-
-  # References = (Reference | SkipBlock)*
-  def _References
-    while true
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_Reference)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_SkipBlock)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      break unless _tmp
-    end
-    _tmp = true
-    set_failed_rule :_References unless _tmp
-    return _tmp
-  end
-
-  # Ticks1 = "`" !"`"
-  def _Ticks1
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("`")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("`")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Ticks1 unless _tmp
-    return _tmp
-  end
-
-  # Ticks2 = "``" !"`"
-  def _Ticks2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("``")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("`")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Ticks2 unless _tmp
-    return _tmp
-  end
-
-  # Ticks3 = "```" !"`"
-  def _Ticks3
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("```")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("`")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Ticks3 unless _tmp
-    return _tmp
-  end
-
-  # Ticks4 = "````" !"`"
-  def _Ticks4
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("````")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("`")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Ticks4 unless _tmp
-    return _tmp
-  end
-
-  # Ticks5 = "`````" !"`"
-  def _Ticks5
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("`````")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("`")
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Ticks5 unless _tmp
-    return _tmp
-  end
-
-  # Code = (Ticks1 @Sp < ((!"`" Nonspacechar)+ | !Ticks1 /`+/ | !(@Sp Ticks1) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks1 | Ticks2 @Sp < ((!"`" Nonspacechar)+ | !Ticks2 /`+/ | !(@Sp Ticks2) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks2 | Ticks3 @Sp < ((!"`" Nonspacechar)+ | !Ticks3 /`+/ | !(@Sp Ticks3) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks3 | Ticks4 @Sp < ((!"`" Nonspacechar)+ | !Ticks4 /`+/ | !(@Sp Ticks4) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks4 | Ticks5 @Sp < ((!"`" Nonspacechar)+ | !Ticks5 /`+/ | !(@Sp Ticks5) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks5) { "<code>#{text}</code>" }
-  def _Code
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = apply(:_Ticks1)
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _text_start = self.pos
-          _save3 = self.pos
-
-          _save4 = self.pos
-          while true # choice
-            _save5 = self.pos
-
-            _save6 = self.pos
-            while true # sequence
-              _save7 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save7
-              unless _tmp
-                self.pos = _save6
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save6
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save8 = self.pos
-                while true # sequence
-                  _save9 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save9
-                  unless _tmp
-                    self.pos = _save8
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save8
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save5
-            end
-            break if _tmp
-            self.pos = _save4
-
-            _save10 = self.pos
-            while true # sequence
-              _save11 = self.pos
-              _tmp = apply(:_Ticks1)
-              _tmp = _tmp ? nil : true
-              self.pos = _save11
-              unless _tmp
-                self.pos = _save10
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save10
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save4
-
-            _save12 = self.pos
-            while true # sequence
-              _save13 = self.pos
-
-              _save14 = self.pos
-              while true # sequence
-                _tmp = _Sp()
-                unless _tmp
-                  self.pos = _save14
-                  break
-                end
-                _tmp = apply(:_Ticks1)
-                unless _tmp
-                  self.pos = _save14
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save13
-              unless _tmp
-                self.pos = _save12
-                break
-              end
-
-              _save15 = self.pos
-              while true # choice
-                _tmp = _Spacechar()
-                break if _tmp
-                self.pos = _save15
-
-                _save16 = self.pos
-                while true # sequence
-                  _tmp = _Newline()
-                  unless _tmp
-                    self.pos = _save16
-                    break
-                  end
-                  _save17 = self.pos
-                  _tmp = _BlankLine()
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save17
-                  unless _tmp
-                    self.pos = _save16
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save15
-                break
-              end # end choice
-
-              unless _tmp
-                self.pos = _save12
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save4
-            break
-          end # end choice
-
-          if _tmp
-            while true
-
-              _save18 = self.pos
-              while true # choice
-                _save19 = self.pos
-
-                _save20 = self.pos
-                while true # sequence
-                  _save21 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save21
-                  unless _tmp
-                    self.pos = _save20
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save20
-                  end
-                  break
-                end # end sequence
-
-                if _tmp
-                  while true
-
-                    _save22 = self.pos
-                    while true # sequence
-                      _save23 = self.pos
-                      _tmp = match_string("`")
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save23
-                      unless _tmp
-                        self.pos = _save22
-                        break
-                      end
-                      _tmp = apply(:_Nonspacechar)
-                      unless _tmp
-                        self.pos = _save22
-                      end
-                      break
-                    end # end sequence
-
-                    break unless _tmp
-                  end
-                  _tmp = true
-                else
-                  self.pos = _save19
-                end
-                break if _tmp
-                self.pos = _save18
-
-                _save24 = self.pos
-                while true # sequence
-                  _save25 = self.pos
-                  _tmp = apply(:_Ticks1)
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save25
-                  unless _tmp
-                    self.pos = _save24
-                    break
-                  end
-                  _tmp = scan(/\G(?-mix:`+)/)
-                  unless _tmp
-                    self.pos = _save24
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save18
-
-                _save26 = self.pos
-                while true # sequence
-                  _save27 = self.pos
-
-                  _save28 = self.pos
-                  while true # sequence
-                    _tmp = _Sp()
-                    unless _tmp
-                      self.pos = _save28
-                      break
-                    end
-                    _tmp = apply(:_Ticks1)
-                    unless _tmp
-                      self.pos = _save28
-                    end
-                    break
-                  end # end sequence
-
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save27
-                  unless _tmp
-                    self.pos = _save26
-                    break
-                  end
-
-                  _save29 = self.pos
-                  while true # choice
-                    _tmp = _Spacechar()
-                    break if _tmp
-                    self.pos = _save29
-
-                    _save30 = self.pos
-                    while true # sequence
-                      _tmp = _Newline()
-                      unless _tmp
-                        self.pos = _save30
-                        break
-                      end
-                      _save31 = self.pos
-                      _tmp = _BlankLine()
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save31
-                      unless _tmp
-                        self.pos = _save30
-                      end
-                      break
-                    end # end sequence
-
-                    break if _tmp
-                    self.pos = _save29
-                    break
-                  end # end choice
-
-                  unless _tmp
-                    self.pos = _save26
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save18
-                break
-              end # end choice
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save3
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = apply(:_Ticks1)
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save32 = self.pos
-        while true # sequence
-          _tmp = apply(:_Ticks2)
-          unless _tmp
-            self.pos = _save32
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save32
-            break
-          end
-          _text_start = self.pos
-          _save33 = self.pos
-
-          _save34 = self.pos
-          while true # choice
-            _save35 = self.pos
-
-            _save36 = self.pos
-            while true # sequence
-              _save37 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save37
-              unless _tmp
-                self.pos = _save36
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save36
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save38 = self.pos
-                while true # sequence
-                  _save39 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save39
-                  unless _tmp
-                    self.pos = _save38
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save38
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save35
-            end
-            break if _tmp
-            self.pos = _save34
-
-            _save40 = self.pos
-            while true # sequence
-              _save41 = self.pos
-              _tmp = apply(:_Ticks2)
-              _tmp = _tmp ? nil : true
-              self.pos = _save41
-              unless _tmp
-                self.pos = _save40
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save40
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save34
-
-            _save42 = self.pos
-            while true # sequence
-              _save43 = self.pos
-
-              _save44 = self.pos
-              while true # sequence
-                _tmp = _Sp()
-                unless _tmp
-                  self.pos = _save44
-                  break
-                end
-                _tmp = apply(:_Ticks2)
-                unless _tmp
-                  self.pos = _save44
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save43
-              unless _tmp
-                self.pos = _save42
-                break
-              end
-
-              _save45 = self.pos
-              while true # choice
-                _tmp = _Spacechar()
-                break if _tmp
-                self.pos = _save45
-
-                _save46 = self.pos
-                while true # sequence
-                  _tmp = _Newline()
-                  unless _tmp
-                    self.pos = _save46
-                    break
-                  end
-                  _save47 = self.pos
-                  _tmp = _BlankLine()
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save47
-                  unless _tmp
-                    self.pos = _save46
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save45
-                break
-              end # end choice
-
-              unless _tmp
-                self.pos = _save42
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save34
-            break
-          end # end choice
-
-          if _tmp
-            while true
-
-              _save48 = self.pos
-              while true # choice
-                _save49 = self.pos
-
-                _save50 = self.pos
-                while true # sequence
-                  _save51 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save51
-                  unless _tmp
-                    self.pos = _save50
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save50
-                  end
-                  break
-                end # end sequence
-
-                if _tmp
-                  while true
-
-                    _save52 = self.pos
-                    while true # sequence
-                      _save53 = self.pos
-                      _tmp = match_string("`")
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save53
-                      unless _tmp
-                        self.pos = _save52
-                        break
-                      end
-                      _tmp = apply(:_Nonspacechar)
-                      unless _tmp
-                        self.pos = _save52
-                      end
-                      break
-                    end # end sequence
-
-                    break unless _tmp
-                  end
-                  _tmp = true
-                else
-                  self.pos = _save49
-                end
-                break if _tmp
-                self.pos = _save48
-
-                _save54 = self.pos
-                while true # sequence
-                  _save55 = self.pos
-                  _tmp = apply(:_Ticks2)
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save55
-                  unless _tmp
-                    self.pos = _save54
-                    break
-                  end
-                  _tmp = scan(/\G(?-mix:`+)/)
-                  unless _tmp
-                    self.pos = _save54
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save48
-
-                _save56 = self.pos
-                while true # sequence
-                  _save57 = self.pos
-
-                  _save58 = self.pos
-                  while true # sequence
-                    _tmp = _Sp()
-                    unless _tmp
-                      self.pos = _save58
-                      break
-                    end
-                    _tmp = apply(:_Ticks2)
-                    unless _tmp
-                      self.pos = _save58
-                    end
-                    break
-                  end # end sequence
-
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save57
-                  unless _tmp
-                    self.pos = _save56
-                    break
-                  end
-
-                  _save59 = self.pos
-                  while true # choice
-                    _tmp = _Spacechar()
-                    break if _tmp
-                    self.pos = _save59
-
-                    _save60 = self.pos
-                    while true # sequence
-                      _tmp = _Newline()
-                      unless _tmp
-                        self.pos = _save60
-                        break
-                      end
-                      _save61 = self.pos
-                      _tmp = _BlankLine()
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save61
-                      unless _tmp
-                        self.pos = _save60
-                      end
-                      break
-                    end # end sequence
-
-                    break if _tmp
-                    self.pos = _save59
-                    break
-                  end # end choice
-
-                  unless _tmp
-                    self.pos = _save56
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save48
-                break
-              end # end choice
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save33
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save32
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save32
-            break
-          end
-          _tmp = apply(:_Ticks2)
-          unless _tmp
-            self.pos = _save32
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save62 = self.pos
-        while true # sequence
-          _tmp = apply(:_Ticks3)
-          unless _tmp
-            self.pos = _save62
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save62
-            break
-          end
-          _text_start = self.pos
-          _save63 = self.pos
-
-          _save64 = self.pos
-          while true # choice
-            _save65 = self.pos
-
-            _save66 = self.pos
-            while true # sequence
-              _save67 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save67
-              unless _tmp
-                self.pos = _save66
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save66
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save68 = self.pos
-                while true # sequence
-                  _save69 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save69
-                  unless _tmp
-                    self.pos = _save68
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save68
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save65
-            end
-            break if _tmp
-            self.pos = _save64
-
-            _save70 = self.pos
-            while true # sequence
-              _save71 = self.pos
-              _tmp = apply(:_Ticks3)
-              _tmp = _tmp ? nil : true
-              self.pos = _save71
-              unless _tmp
-                self.pos = _save70
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save70
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save64
-
-            _save72 = self.pos
-            while true # sequence
-              _save73 = self.pos
-
-              _save74 = self.pos
-              while true # sequence
-                _tmp = _Sp()
-                unless _tmp
-                  self.pos = _save74
-                  break
-                end
-                _tmp = apply(:_Ticks3)
-                unless _tmp
-                  self.pos = _save74
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save73
-              unless _tmp
-                self.pos = _save72
-                break
-              end
-
-              _save75 = self.pos
-              while true # choice
-                _tmp = _Spacechar()
-                break if _tmp
-                self.pos = _save75
-
-                _save76 = self.pos
-                while true # sequence
-                  _tmp = _Newline()
-                  unless _tmp
-                    self.pos = _save76
-                    break
-                  end
-                  _save77 = self.pos
-                  _tmp = _BlankLine()
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save77
-                  unless _tmp
-                    self.pos = _save76
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save75
-                break
-              end # end choice
-
-              unless _tmp
-                self.pos = _save72
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save64
-            break
-          end # end choice
-
-          if _tmp
-            while true
-
-              _save78 = self.pos
-              while true # choice
-                _save79 = self.pos
-
-                _save80 = self.pos
-                while true # sequence
-                  _save81 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save81
-                  unless _tmp
-                    self.pos = _save80
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save80
-                  end
-                  break
-                end # end sequence
-
-                if _tmp
-                  while true
-
-                    _save82 = self.pos
-                    while true # sequence
-                      _save83 = self.pos
-                      _tmp = match_string("`")
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save83
-                      unless _tmp
-                        self.pos = _save82
-                        break
-                      end
-                      _tmp = apply(:_Nonspacechar)
-                      unless _tmp
-                        self.pos = _save82
-                      end
-                      break
-                    end # end sequence
-
-                    break unless _tmp
-                  end
-                  _tmp = true
-                else
-                  self.pos = _save79
-                end
-                break if _tmp
-                self.pos = _save78
-
-                _save84 = self.pos
-                while true # sequence
-                  _save85 = self.pos
-                  _tmp = apply(:_Ticks3)
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save85
-                  unless _tmp
-                    self.pos = _save84
-                    break
-                  end
-                  _tmp = scan(/\G(?-mix:`+)/)
-                  unless _tmp
-                    self.pos = _save84
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save78
-
-                _save86 = self.pos
-                while true # sequence
-                  _save87 = self.pos
-
-                  _save88 = self.pos
-                  while true # sequence
-                    _tmp = _Sp()
-                    unless _tmp
-                      self.pos = _save88
-                      break
-                    end
-                    _tmp = apply(:_Ticks3)
-                    unless _tmp
-                      self.pos = _save88
-                    end
-                    break
-                  end # end sequence
-
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save87
-                  unless _tmp
-                    self.pos = _save86
-                    break
-                  end
-
-                  _save89 = self.pos
-                  while true # choice
-                    _tmp = _Spacechar()
-                    break if _tmp
-                    self.pos = _save89
-
-                    _save90 = self.pos
-                    while true # sequence
-                      _tmp = _Newline()
-                      unless _tmp
-                        self.pos = _save90
-                        break
-                      end
-                      _save91 = self.pos
-                      _tmp = _BlankLine()
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save91
-                      unless _tmp
-                        self.pos = _save90
-                      end
-                      break
-                    end # end sequence
-
-                    break if _tmp
-                    self.pos = _save89
-                    break
-                  end # end choice
-
-                  unless _tmp
-                    self.pos = _save86
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save78
-                break
-              end # end choice
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save63
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save62
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save62
-            break
-          end
-          _tmp = apply(:_Ticks3)
-          unless _tmp
-            self.pos = _save62
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save92 = self.pos
-        while true # sequence
-          _tmp = apply(:_Ticks4)
-          unless _tmp
-            self.pos = _save92
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save92
-            break
-          end
-          _text_start = self.pos
-          _save93 = self.pos
-
-          _save94 = self.pos
-          while true # choice
-            _save95 = self.pos
-
-            _save96 = self.pos
-            while true # sequence
-              _save97 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save97
-              unless _tmp
-                self.pos = _save96
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save96
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save98 = self.pos
-                while true # sequence
-                  _save99 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save99
-                  unless _tmp
-                    self.pos = _save98
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save98
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save95
-            end
-            break if _tmp
-            self.pos = _save94
-
-            _save100 = self.pos
-            while true # sequence
-              _save101 = self.pos
-              _tmp = apply(:_Ticks4)
-              _tmp = _tmp ? nil : true
-              self.pos = _save101
-              unless _tmp
-                self.pos = _save100
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save100
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save94
-
-            _save102 = self.pos
-            while true # sequence
-              _save103 = self.pos
-
-              _save104 = self.pos
-              while true # sequence
-                _tmp = _Sp()
-                unless _tmp
-                  self.pos = _save104
-                  break
-                end
-                _tmp = apply(:_Ticks4)
-                unless _tmp
-                  self.pos = _save104
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save103
-              unless _tmp
-                self.pos = _save102
-                break
-              end
-
-              _save105 = self.pos
-              while true # choice
-                _tmp = _Spacechar()
-                break if _tmp
-                self.pos = _save105
-
-                _save106 = self.pos
-                while true # sequence
-                  _tmp = _Newline()
-                  unless _tmp
-                    self.pos = _save106
-                    break
-                  end
-                  _save107 = self.pos
-                  _tmp = _BlankLine()
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save107
-                  unless _tmp
-                    self.pos = _save106
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save105
-                break
-              end # end choice
-
-              unless _tmp
-                self.pos = _save102
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save94
-            break
-          end # end choice
-
-          if _tmp
-            while true
-
-              _save108 = self.pos
-              while true # choice
-                _save109 = self.pos
-
-                _save110 = self.pos
-                while true # sequence
-                  _save111 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save111
-                  unless _tmp
-                    self.pos = _save110
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save110
-                  end
-                  break
-                end # end sequence
-
-                if _tmp
-                  while true
-
-                    _save112 = self.pos
-                    while true # sequence
-                      _save113 = self.pos
-                      _tmp = match_string("`")
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save113
-                      unless _tmp
-                        self.pos = _save112
-                        break
-                      end
-                      _tmp = apply(:_Nonspacechar)
-                      unless _tmp
-                        self.pos = _save112
-                      end
-                      break
-                    end # end sequence
-
-                    break unless _tmp
-                  end
-                  _tmp = true
-                else
-                  self.pos = _save109
-                end
-                break if _tmp
-                self.pos = _save108
-
-                _save114 = self.pos
-                while true # sequence
-                  _save115 = self.pos
-                  _tmp = apply(:_Ticks4)
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save115
-                  unless _tmp
-                    self.pos = _save114
-                    break
-                  end
-                  _tmp = scan(/\G(?-mix:`+)/)
-                  unless _tmp
-                    self.pos = _save114
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save108
-
-                _save116 = self.pos
-                while true # sequence
-                  _save117 = self.pos
-
-                  _save118 = self.pos
-                  while true # sequence
-                    _tmp = _Sp()
-                    unless _tmp
-                      self.pos = _save118
-                      break
-                    end
-                    _tmp = apply(:_Ticks4)
-                    unless _tmp
-                      self.pos = _save118
-                    end
-                    break
-                  end # end sequence
-
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save117
-                  unless _tmp
-                    self.pos = _save116
-                    break
-                  end
-
-                  _save119 = self.pos
-                  while true # choice
-                    _tmp = _Spacechar()
-                    break if _tmp
-                    self.pos = _save119
-
-                    _save120 = self.pos
-                    while true # sequence
-                      _tmp = _Newline()
-                      unless _tmp
-                        self.pos = _save120
-                        break
-                      end
-                      _save121 = self.pos
-                      _tmp = _BlankLine()
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save121
-                      unless _tmp
-                        self.pos = _save120
-                      end
-                      break
-                    end # end sequence
-
-                    break if _tmp
-                    self.pos = _save119
-                    break
-                  end # end choice
-
-                  unless _tmp
-                    self.pos = _save116
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save108
-                break
-              end # end choice
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save93
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save92
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save92
-            break
-          end
-          _tmp = apply(:_Ticks4)
-          unless _tmp
-            self.pos = _save92
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-
-        _save122 = self.pos
-        while true # sequence
-          _tmp = apply(:_Ticks5)
-          unless _tmp
-            self.pos = _save122
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save122
-            break
-          end
-          _text_start = self.pos
-          _save123 = self.pos
-
-          _save124 = self.pos
-          while true # choice
-            _save125 = self.pos
-
-            _save126 = self.pos
-            while true # sequence
-              _save127 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save127
-              unless _tmp
-                self.pos = _save126
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save126
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save128 = self.pos
-                while true # sequence
-                  _save129 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save129
-                  unless _tmp
-                    self.pos = _save128
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save128
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save125
-            end
-            break if _tmp
-            self.pos = _save124
-
-            _save130 = self.pos
-            while true # sequence
-              _save131 = self.pos
-              _tmp = apply(:_Ticks5)
-              _tmp = _tmp ? nil : true
-              self.pos = _save131
-              unless _tmp
-                self.pos = _save130
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save130
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save124
-
-            _save132 = self.pos
-            while true # sequence
-              _save133 = self.pos
-
-              _save134 = self.pos
-              while true # sequence
-                _tmp = _Sp()
-                unless _tmp
-                  self.pos = _save134
-                  break
-                end
-                _tmp = apply(:_Ticks5)
-                unless _tmp
-                  self.pos = _save134
-                end
-                break
-              end # end sequence
-
-              _tmp = _tmp ? nil : true
-              self.pos = _save133
-              unless _tmp
-                self.pos = _save132
-                break
-              end
-
-              _save135 = self.pos
-              while true # choice
-                _tmp = _Spacechar()
-                break if _tmp
-                self.pos = _save135
-
-                _save136 = self.pos
-                while true # sequence
-                  _tmp = _Newline()
-                  unless _tmp
-                    self.pos = _save136
-                    break
-                  end
-                  _save137 = self.pos
-                  _tmp = _BlankLine()
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save137
-                  unless _tmp
-                    self.pos = _save136
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save135
-                break
-              end # end choice
-
-              unless _tmp
-                self.pos = _save132
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save124
-            break
-          end # end choice
-
-          if _tmp
-            while true
-
-              _save138 = self.pos
-              while true # choice
-                _save139 = self.pos
-
-                _save140 = self.pos
-                while true # sequence
-                  _save141 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save141
-                  unless _tmp
-                    self.pos = _save140
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save140
-                  end
-                  break
-                end # end sequence
-
-                if _tmp
-                  while true
-
-                    _save142 = self.pos
-                    while true # sequence
-                      _save143 = self.pos
-                      _tmp = match_string("`")
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save143
-                      unless _tmp
-                        self.pos = _save142
-                        break
-                      end
-                      _tmp = apply(:_Nonspacechar)
-                      unless _tmp
-                        self.pos = _save142
-                      end
-                      break
-                    end # end sequence
-
-                    break unless _tmp
-                  end
-                  _tmp = true
-                else
-                  self.pos = _save139
-                end
-                break if _tmp
-                self.pos = _save138
-
-                _save144 = self.pos
-                while true # sequence
-                  _save145 = self.pos
-                  _tmp = apply(:_Ticks5)
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save145
-                  unless _tmp
-                    self.pos = _save144
-                    break
-                  end
-                  _tmp = scan(/\G(?-mix:`+)/)
-                  unless _tmp
-                    self.pos = _save144
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save138
-
-                _save146 = self.pos
-                while true # sequence
-                  _save147 = self.pos
-
-                  _save148 = self.pos
-                  while true # sequence
-                    _tmp = _Sp()
-                    unless _tmp
-                      self.pos = _save148
-                      break
-                    end
-                    _tmp = apply(:_Ticks5)
-                    unless _tmp
-                      self.pos = _save148
-                    end
-                    break
-                  end # end sequence
-
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save147
-                  unless _tmp
-                    self.pos = _save146
-                    break
-                  end
-
-                  _save149 = self.pos
-                  while true # choice
-                    _tmp = _Spacechar()
-                    break if _tmp
-                    self.pos = _save149
-
-                    _save150 = self.pos
-                    while true # sequence
-                      _tmp = _Newline()
-                      unless _tmp
-                        self.pos = _save150
-                        break
-                      end
-                      _save151 = self.pos
-                      _tmp = _BlankLine()
-                      _tmp = _tmp ? nil : true
-                      self.pos = _save151
-                      unless _tmp
-                        self.pos = _save150
-                      end
-                      break
-                    end # end sequence
-
-                    break if _tmp
-                    self.pos = _save149
-                    break
-                  end # end choice
-
-                  unless _tmp
-                    self.pos = _save146
-                  end
-                  break
-                end # end sequence
-
-                break if _tmp
-                self.pos = _save138
-                break
-              end # end choice
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save123
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save122
-            break
-          end
-          _tmp = _Sp()
-          unless _tmp
-            self.pos = _save122
-            break
-          end
-          _tmp = apply(:_Ticks5)
-          unless _tmp
-            self.pos = _save122
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "<code>#{text}</code>" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Code unless _tmp
-    return _tmp
-  end
-
-  # RawHtml = < (HtmlComment | HtmlBlockScript | HtmlTag) > { if html? then text else '' end }
-  def _RawHtml
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_HtmlComment)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_HtmlBlockScript)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_HtmlTag)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  if html? then text else '' end ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RawHtml unless _tmp
-    return _tmp
-  end
-
-  # BlankLine = @Sp @Newline { "\n" }
-  def _BlankLine
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  "\n" ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_BlankLine unless _tmp
-    return _tmp
-  end
-
-  # Quoted = ("\"" (!"\"" .)* "\"" | "'" (!"'" .)* "'")
-  def _Quoted
-
-    _save = self.pos
-    while true # choice
-
-      _save1 = self.pos
-      while true # sequence
-        _tmp = match_string("\"")
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        while true
-
-          _save3 = self.pos
-          while true # sequence
-            _save4 = self.pos
-            _tmp = match_string("\"")
-            _tmp = _tmp ? nil : true
-            self.pos = _save4
-            unless _tmp
-              self.pos = _save3
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save3
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        _tmp = match_string("\"")
-        unless _tmp
-          self.pos = _save1
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-
-      _save5 = self.pos
-      while true # sequence
-        _tmp = match_string("'")
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-        while true
-
-          _save7 = self.pos
-          while true # sequence
-            _save8 = self.pos
-            _tmp = match_string("'")
-            _tmp = _tmp ? nil : true
-            self.pos = _save8
-            unless _tmp
-              self.pos = _save7
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save7
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-        _tmp = match_string("'")
-        unless _tmp
-          self.pos = _save5
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_Quoted unless _tmp
-    return _tmp
-  end
-
-  # HtmlAttribute = (AlphanumericAscii | "-")+ Spnl ("=" Spnl (Quoted | (!">" Nonspacechar)+))? Spnl
-  def _HtmlAttribute
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = apply(:_AlphanumericAscii)
-        break if _tmp
-        self.pos = _save2
-        _tmp = match_string("-")
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      if _tmp
-        while true
-
-          _save3 = self.pos
-          while true # choice
-            _tmp = apply(:_AlphanumericAscii)
-            break if _tmp
-            self.pos = _save3
-            _tmp = match_string("-")
-            break if _tmp
-            self.pos = _save3
-            break
-          end # end choice
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save4 = self.pos
-
-      _save5 = self.pos
-      while true # sequence
-        _tmp = match_string("=")
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-        _tmp = apply(:_Spnl)
-        unless _tmp
-          self.pos = _save5
-          break
-        end
-
-        _save6 = self.pos
-        while true # choice
-          _tmp = apply(:_Quoted)
-          break if _tmp
-          self.pos = _save6
-          _save7 = self.pos
-
-          _save8 = self.pos
-          while true # sequence
-            _save9 = self.pos
-            _tmp = match_string(">")
-            _tmp = _tmp ? nil : true
-            self.pos = _save9
-            unless _tmp
-              self.pos = _save8
-              break
-            end
-            _tmp = apply(:_Nonspacechar)
-            unless _tmp
-              self.pos = _save8
-            end
-            break
-          end # end sequence
-
-          if _tmp
-            while true
-
-              _save10 = self.pos
-              while true # sequence
-                _save11 = self.pos
-                _tmp = match_string(">")
-                _tmp = _tmp ? nil : true
-                self.pos = _save11
-                unless _tmp
-                  self.pos = _save10
-                  break
-                end
-                _tmp = apply(:_Nonspacechar)
-                unless _tmp
-                  self.pos = _save10
-                end
-                break
-              end # end sequence
-
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save7
-          end
-          break if _tmp
-          self.pos = _save6
-          break
-        end # end choice
-
-        unless _tmp
-          self.pos = _save5
-        end
-        break
-      end # end sequence
-
-      unless _tmp
-        _tmp = true
-        self.pos = _save4
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlAttribute unless _tmp
-    return _tmp
-  end
-
-  # HtmlComment = "<!--" (!"-->" .)* "-->"
-  def _HtmlComment
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<!--")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save2 = self.pos
-        while true # sequence
-          _save3 = self.pos
-          _tmp = match_string("-->")
-          _tmp = _tmp ? nil : true
-          self.pos = _save3
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = get_byte
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("-->")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlComment unless _tmp
-    return _tmp
-  end
-
-  # HtmlTag = "<" Spnl "/"? AlphanumericAscii+ Spnl HtmlAttribute* "/"? Spnl ">"
-  def _HtmlTag
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("<")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = match_string("/")
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = apply(:_AlphanumericAscii)
-      if _tmp
-        while true
-          _tmp = apply(:_AlphanumericAscii)
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = apply(:_HtmlAttribute)
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save4 = self.pos
-      _tmp = match_string("/")
-      unless _tmp
-        _tmp = true
-        self.pos = _save4
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(">")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HtmlTag unless _tmp
-    return _tmp
-  end
-
-  # Eof = !.
-  def _Eof
-    _save = self.pos
-    _tmp = get_byte
-    _tmp = _tmp ? nil : true
-    self.pos = _save
-    set_failed_rule :_Eof unless _tmp
-    return _tmp
-  end
-
-  # Nonspacechar = !@Spacechar !@Newline .
-  def _Nonspacechar
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = _Spacechar()
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = _Newline()
-      _tmp = _tmp ? nil : true
-      self.pos = _save2
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = get_byte
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Nonspacechar unless _tmp
-    return _tmp
-  end
-
-  # Sp = @Spacechar*
-  def _Sp
-    while true
-      _tmp = _Spacechar()
-      break unless _tmp
-    end
-    _tmp = true
-    set_failed_rule :_Sp unless _tmp
-    return _tmp
-  end
-
-  # Spnl = @Sp (@Newline @Sp)?
-  def _Spnl
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _tmp = _Newline()
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Spnl unless _tmp
-    return _tmp
-  end
-
-  # SpecialChar = (/[~*_`&\[\]()<!#\\'"]/ | @ExtendedSpecialChar)
-  def _SpecialChar
-
-    _save = self.pos
-    while true # choice
-      _tmp = scan(/\G(?-mix:[~*_`&\[\]()<!#\\'"])/)
-      break if _tmp
-      self.pos = _save
-      _tmp = _ExtendedSpecialChar()
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_SpecialChar unless _tmp
-    return _tmp
-  end
-
-  # NormalChar = !(@SpecialChar | @Spacechar | @Newline) .
-  def _NormalChar
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # choice
-        _tmp = _SpecialChar()
-        break if _tmp
-        self.pos = _save2
-        _tmp = _Spacechar()
-        break if _tmp
-        self.pos = _save2
-        _tmp = _Newline()
-        break if _tmp
-        self.pos = _save2
-        break
-      end # end choice
-
-      _tmp = _tmp ? nil : true
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = get_byte
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_NormalChar unless _tmp
-    return _tmp
-  end
-
-  # Digit = [0-9]
-  def _Digit
-    _save = self.pos
-    _tmp = get_byte
-    if _tmp
-      unless _tmp >= 48 and _tmp <= 57
-        self.pos = _save
-        _tmp = nil
-      end
-    end
-    set_failed_rule :_Digit unless _tmp
-    return _tmp
-  end
-
-  # Alphanumeric = %literals.Alphanumeric
-  def _Alphanumeric
-    _tmp = @_grammar_literals.external_invoke(self, :_Alphanumeric)
-    set_failed_rule :_Alphanumeric unless _tmp
-    return _tmp
-  end
-
-  # AlphanumericAscii = %literals.AlphanumericAscii
-  def _AlphanumericAscii
-    _tmp = @_grammar_literals.external_invoke(self, :_AlphanumericAscii)
-    set_failed_rule :_AlphanumericAscii unless _tmp
-    return _tmp
-  end
-
-  # BOM = %literals.BOM
-  def _BOM
-    _tmp = @_grammar_literals.external_invoke(self, :_BOM)
-    set_failed_rule :_BOM unless _tmp
-    return _tmp
-  end
-
-  # Newline = %literals.Newline
-  def _Newline
-    _tmp = @_grammar_literals.external_invoke(self, :_Newline)
-    set_failed_rule :_Newline unless _tmp
-    return _tmp
-  end
-
-  # Spacechar = %literals.Spacechar
-  def _Spacechar
-    _tmp = @_grammar_literals.external_invoke(self, :_Spacechar)
-    set_failed_rule :_Spacechar unless _tmp
-    return _tmp
-  end
-
-  # HexEntity = /&#x/i < /[0-9a-fA-F]+/ > ";" { [text.to_i(16)].pack 'U' }
-  def _HexEntity
-
-    _save = self.pos
-    while true # sequence
-      _tmp = scan(/\G(?i-mx:&#x)/)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:[0-9a-fA-F]+)/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(";")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  [text.to_i(16)].pack 'U' ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_HexEntity unless _tmp
-    return _tmp
-  end
-
-  # DecEntity = "&#" < /[0-9]+/ > ";" { [text.to_i].pack 'U' }
-  def _DecEntity
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("&#")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:[0-9]+)/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(";")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  [text.to_i].pack 'U' ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_DecEntity unless _tmp
-    return _tmp
-  end
-
-  # CharEntity = "&" < /[A-Za-z0-9]+/ > ";" { if entity = HTML_ENTITIES[text] then                  entity.pack 'U*'                else                  "&#{text};"                end              }
-  def _CharEntity
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("&")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:[A-Za-z0-9]+)/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(";")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  if entity = HTML_ENTITIES[text] then
-                 entity.pack 'U*'
-               else
-                 "&#{text};"
-               end
-             ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_CharEntity unless _tmp
-    return _tmp
-  end
-
-  # NonindentSpace = / {0,3}/
-  def _NonindentSpace
-    _tmp = scan(/\G(?-mix: {0,3})/)
-    set_failed_rule :_NonindentSpace unless _tmp
-    return _tmp
-  end
-
-  # Indent = /\t|    /
-  def _Indent
-    _tmp = scan(/\G(?-mix:\t|    )/)
-    set_failed_rule :_Indent unless _tmp
-    return _tmp
-  end
-
-  # IndentedLine = Indent Line
-  def _IndentedLine
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Indent)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Line)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_IndentedLine unless _tmp
-    return _tmp
-  end
-
-  # OptionallyIndentedLine = Indent? Line
-  def _OptionallyIndentedLine
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = apply(:_Indent)
-      unless _tmp
-        _tmp = true
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Line)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_OptionallyIndentedLine unless _tmp
-    return _tmp
-  end
-
-  # StartList = &. { [] }
-  def _StartList
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = get_byte
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  [] ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_StartList unless _tmp
-    return _tmp
-  end
-
-  # Line = @RawLine:a { a }
-  def _Line
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _RawLine()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Line unless _tmp
-    return _tmp
-  end
-
-  # RawLine = (< /[^\r\n]*/ @Newline > | < .+ > @Eof) { text }
-  def _RawLine
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-        _text_start = self.pos
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = scan(/\G(?-mix:[^\r\n]*)/)
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _tmp = _Newline()
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          text = get_text(_text_start)
-        end
-        break if _tmp
-        self.pos = _save1
-
-        _save3 = self.pos
-        while true # sequence
-          _text_start = self.pos
-          _save4 = self.pos
-          _tmp = get_byte
-          if _tmp
-            while true
-              _tmp = get_byte
-              break unless _tmp
-            end
-            _tmp = true
-          else
-            self.pos = _save4
-          end
-          if _tmp
-            text = get_text(_text_start)
-          end
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = _Eof()
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RawLine unless _tmp
-    return _tmp
-  end
-
-  # SkipBlock = (HtmlBlock | (!"#" !SetextBottom1 !SetextBottom2 !@BlankLine @RawLine)+ @BlankLine* | @BlankLine+ | @RawLine)
-  def _SkipBlock
-
-    _save = self.pos
-    while true # choice
-      _tmp = apply(:_HtmlBlock)
-      break if _tmp
-      self.pos = _save
-
-      _save1 = self.pos
-      while true # sequence
-        _save2 = self.pos
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = match_string("#")
-          _tmp = _tmp ? nil : true
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save5 = self.pos
-          _tmp = apply(:_SetextBottom1)
-          _tmp = _tmp ? nil : true
-          self.pos = _save5
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save6 = self.pos
-          _tmp = apply(:_SetextBottom2)
-          _tmp = _tmp ? nil : true
-          self.pos = _save6
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _save7 = self.pos
-          _tmp = _BlankLine()
-          _tmp = _tmp ? nil : true
-          self.pos = _save7
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = _RawLine()
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          while true
-
-            _save8 = self.pos
-            while true # sequence
-              _save9 = self.pos
-              _tmp = match_string("#")
-              _tmp = _tmp ? nil : true
-              self.pos = _save9
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _save10 = self.pos
-              _tmp = apply(:_SetextBottom1)
-              _tmp = _tmp ? nil : true
-              self.pos = _save10
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _save11 = self.pos
-              _tmp = apply(:_SetextBottom2)
-              _tmp = _tmp ? nil : true
-              self.pos = _save11
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _save12 = self.pos
-              _tmp = _BlankLine()
-              _tmp = _tmp ? nil : true
-              self.pos = _save12
-              unless _tmp
-                self.pos = _save8
-                break
-              end
-              _tmp = _RawLine()
-              unless _tmp
-                self.pos = _save8
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-        else
-          self.pos = _save2
-        end
-        unless _tmp
-          self.pos = _save1
-          break
-        end
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-        unless _tmp
-          self.pos = _save1
-        end
-        break
-      end # end sequence
-
-      break if _tmp
-      self.pos = _save
-      _save14 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save14
-      end
-      break if _tmp
-      self.pos = _save
-      _tmp = _RawLine()
-      break if _tmp
-      self.pos = _save
-      break
-    end # end choice
-
-    set_failed_rule :_SkipBlock unless _tmp
-    return _tmp
-  end
-
-  # ExtendedSpecialChar = &{ notes? } "^"
-  def _ExtendedSpecialChar
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  notes? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("^")
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_ExtendedSpecialChar unless _tmp
-    return _tmp
-  end
-
-  # NoteReference = &{ notes? } RawNoteReference:ref { note_for ref }
-  def _NoteReference
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  notes? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_RawNoteReference)
-      ref = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  note_for ref ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_NoteReference unless _tmp
-    return _tmp
-  end
-
-  # RawNoteReference = "[^" < (!@Newline !"]" .)+ > "]" { text }
-  def _RawNoteReference
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("[^")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _save3 = self.pos
-        _tmp = _Newline()
-        _tmp = _tmp ? nil : true
-        self.pos = _save3
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _save4 = self.pos
-        _tmp = match_string("]")
-        _tmp = _tmp ? nil : true
-        self.pos = _save4
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = get_byte
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = _Newline()
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _save7 = self.pos
-            _tmp = match_string("]")
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = get_byte
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("]")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RawNoteReference unless _tmp
-    return _tmp
-  end
-
-  # Note = &{ notes? } @NonindentSpace RawNoteReference:ref ":" @Sp @StartList:a RawNoteBlock:i { a.concat i } (&Indent RawNoteBlock:i { a.concat i })* { @footnotes[ref] = paragraph a                    nil                 }
-  def _Note
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  notes? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_RawNoteReference)
-      ref = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(":")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_RawNoteBlock)
-      i = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a.concat i ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-
-        _save3 = self.pos
-        while true # sequence
-          _save4 = self.pos
-          _tmp = apply(:_Indent)
-          self.pos = _save4
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          _tmp = apply(:_RawNoteBlock)
-          i = @result
-          unless _tmp
-            self.pos = _save3
-            break
-          end
-          @result = begin;  a.concat i ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save3
-          end
-          break
-        end # end sequence
-
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  @footnotes[ref] = paragraph a
-
-                  nil
-                ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Note unless _tmp
-    return _tmp
-  end
-
-  # InlineNote = &{ notes? } "^[" @StartList:a (!"]" Inline:l { a << l })+ "]" { ref = [:inline, @note_order.length]                @footnotes[ref] = paragraph a                 note_for ref              }
-  def _InlineNote
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  notes? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("^[")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _save4 = self.pos
-        _tmp = match_string("]")
-        _tmp = _tmp ? nil : true
-        self.pos = _save4
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = apply(:_Inline)
-        l = @result
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        @result = begin;  a << l ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = match_string("]")
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = apply(:_Inline)
-            l = @result
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            @result = begin;  a << l ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string("]")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  ref = [:inline, @note_order.length]
-               @footnotes[ref] = paragraph a
-
-               note_for ref
-             ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_InlineNote unless _tmp
-    return _tmp
-  end
-
-  # Notes = (Note | SkipBlock)*
-  def _Notes
-    while true
-
-      _save1 = self.pos
-      while true # choice
-        _tmp = apply(:_Note)
-        break if _tmp
-        self.pos = _save1
-        _tmp = apply(:_SkipBlock)
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      break unless _tmp
-    end
-    _tmp = true
-    set_failed_rule :_Notes unless _tmp
-    return _tmp
-  end
-
-  # RawNoteBlock = @StartList:a (!@BlankLine !RawNoteReference OptionallyIndentedLine:l { a << l })+ < @BlankLine* > { a << text } { a }
-  def _RawNoteBlock
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _StartList()
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-
-      _save2 = self.pos
-      while true # sequence
-        _save3 = self.pos
-        _tmp = _BlankLine()
-        _tmp = _tmp ? nil : true
-        self.pos = _save3
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _save4 = self.pos
-        _tmp = apply(:_RawNoteReference)
-        _tmp = _tmp ? nil : true
-        self.pos = _save4
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        _tmp = apply(:_OptionallyIndentedLine)
-        l = @result
-        unless _tmp
-          self.pos = _save2
-          break
-        end
-        @result = begin;  a << l ; end
-        _tmp = true
-        unless _tmp
-          self.pos = _save2
-        end
-        break
-      end # end sequence
-
-      if _tmp
-        while true
-
-          _save5 = self.pos
-          while true # sequence
-            _save6 = self.pos
-            _tmp = _BlankLine()
-            _tmp = _tmp ? nil : true
-            self.pos = _save6
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _save7 = self.pos
-            _tmp = apply(:_RawNoteReference)
-            _tmp = _tmp ? nil : true
-            self.pos = _save7
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            _tmp = apply(:_OptionallyIndentedLine)
-            l = @result
-            unless _tmp
-              self.pos = _save5
-              break
-            end
-            @result = begin;  a << l ; end
-            _tmp = true
-            unless _tmp
-              self.pos = _save5
-            end
-            break
-          end # end sequence
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      while true
-        _tmp = _BlankLine()
-        break unless _tmp
-      end
-      _tmp = true
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a << text ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_RawNoteBlock unless _tmp
-    return _tmp
-  end
-
-  # CodeFence = &{ github? } Ticks3 (@Sp StrChunk:format)? Spnl < ((!"`" Nonspacechar)+ | !Ticks3 /`+/ | Spacechar | @Newline)+ > Ticks3 @Sp @Newline* { verbatim = RDoc::Markup::Verbatim.new text               verbatim.format = format.intern if format.instance_of?(String)               verbatim             }
-  def _CodeFence
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  github? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Ticks3)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-
-      _save3 = self.pos
-      while true # sequence
-        _tmp = _Sp()
-        unless _tmp
-          self.pos = _save3
-          break
-        end
-        _tmp = apply(:_StrChunk)
-        format = @result
-        unless _tmp
-          self.pos = _save3
-        end
-        break
-      end # end sequence
-
-      unless _tmp
-        _tmp = true
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Spnl)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _text_start = self.pos
-      _save4 = self.pos
-
-      _save5 = self.pos
-      while true # choice
-        _save6 = self.pos
-
-        _save7 = self.pos
-        while true # sequence
-          _save8 = self.pos
-          _tmp = match_string("`")
-          _tmp = _tmp ? nil : true
-          self.pos = _save8
-          unless _tmp
-            self.pos = _save7
-            break
-          end
-          _tmp = apply(:_Nonspacechar)
-          unless _tmp
-            self.pos = _save7
-          end
-          break
-        end # end sequence
-
-        if _tmp
-          while true
-
-            _save9 = self.pos
-            while true # sequence
-              _save10 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save10
-              unless _tmp
-                self.pos = _save9
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save9
-              end
-              break
-            end # end sequence
-
-            break unless _tmp
-          end
-          _tmp = true
-        else
-          self.pos = _save6
-        end
-        break if _tmp
-        self.pos = _save5
-
-        _save11 = self.pos
-        while true # sequence
-          _save12 = self.pos
-          _tmp = apply(:_Ticks3)
-          _tmp = _tmp ? nil : true
-          self.pos = _save12
-          unless _tmp
-            self.pos = _save11
-            break
-          end
-          _tmp = scan(/\G(?-mix:`+)/)
-          unless _tmp
-            self.pos = _save11
-          end
-          break
-        end # end sequence
-
-        break if _tmp
-        self.pos = _save5
-        _tmp = apply(:_Spacechar)
-        break if _tmp
-        self.pos = _save5
-        _tmp = _Newline()
-        break if _tmp
-        self.pos = _save5
-        break
-      end # end choice
-
-      if _tmp
-        while true
-
-          _save13 = self.pos
-          while true # choice
-            _save14 = self.pos
-
-            _save15 = self.pos
-            while true # sequence
-              _save16 = self.pos
-              _tmp = match_string("`")
-              _tmp = _tmp ? nil : true
-              self.pos = _save16
-              unless _tmp
-                self.pos = _save15
-                break
-              end
-              _tmp = apply(:_Nonspacechar)
-              unless _tmp
-                self.pos = _save15
-              end
-              break
-            end # end sequence
-
-            if _tmp
-              while true
-
-                _save17 = self.pos
-                while true # sequence
-                  _save18 = self.pos
-                  _tmp = match_string("`")
-                  _tmp = _tmp ? nil : true
-                  self.pos = _save18
-                  unless _tmp
-                    self.pos = _save17
-                    break
-                  end
-                  _tmp = apply(:_Nonspacechar)
-                  unless _tmp
-                    self.pos = _save17
-                  end
-                  break
-                end # end sequence
-
-                break unless _tmp
-              end
-              _tmp = true
-            else
-              self.pos = _save14
-            end
-            break if _tmp
-            self.pos = _save13
-
-            _save19 = self.pos
-            while true # sequence
-              _save20 = self.pos
-              _tmp = apply(:_Ticks3)
-              _tmp = _tmp ? nil : true
-              self.pos = _save20
-              unless _tmp
-                self.pos = _save19
-                break
-              end
-              _tmp = scan(/\G(?-mix:`+)/)
-              unless _tmp
-                self.pos = _save19
-              end
-              break
-            end # end sequence
-
-            break if _tmp
-            self.pos = _save13
-            _tmp = apply(:_Spacechar)
-            break if _tmp
-            self.pos = _save13
-            _tmp = _Newline()
-            break if _tmp
-            self.pos = _save13
-            break
-          end # end choice
-
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save4
-      end
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Ticks3)
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      while true
-        _tmp = _Newline()
-        break unless _tmp
-      end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  verbatim = RDoc::Markup::Verbatim.new text
-              verbatim.format = format.intern if format.instance_of?(String)
-              verbatim
-            ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_CodeFence unless _tmp
-    return _tmp
-  end
-
-  # Table = &{ github? } TableHead:header TableLine:line TableRow+:body { table = RDoc::Markup::Table.new(header, line, body) }
-  def _Table
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  github? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_TableHead)
-      header = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_TableLine)
-      line = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _ary = []
-      _tmp = apply(:_TableRow)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_TableRow)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save2
-      end
-      body = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  table = RDoc::Markup::Table.new(header, line, body) ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_Table unless _tmp
-    return _tmp
-  end
-
-  # TableHead = TableItem2+:items "|"? @Newline { items }
-  def _TableHead
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _ary = []
-      _tmp = apply(:_TableItem2)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_TableItem2)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      items = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _tmp = match_string("|")
-      unless _tmp
-        _tmp = true
-        self.pos = _save2
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  items ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableHead unless _tmp
-    return _tmp
-  end
-
-  # TableRow = ((TableItem:item1 TableItem2*:items { [item1, *items] }):row | TableItem2+:row) "|"? @Newline { row }
-  def _TableRow
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = apply(:_TableItem)
-          item1 = @result
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _ary = []
-          while true
-            _tmp = apply(:_TableItem2)
-            _ary << @result if _tmp
-            break unless _tmp
-          end
-          _tmp = true
-          @result = _ary
-          items = @result
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          @result = begin;  [item1, *items] ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        row = @result
-        break if _tmp
-        self.pos = _save1
-        _save4 = self.pos
-        _ary = []
-        _tmp = apply(:_TableItem2)
-        if _tmp
-          _ary << @result
-          while true
-            _tmp = apply(:_TableItem2)
-            _ary << @result if _tmp
-            break unless _tmp
-          end
-          _tmp = true
-          @result = _ary
-        else
-          self.pos = _save4
-        end
-        row = @result
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save5 = self.pos
-      _tmp = match_string("|")
-      unless _tmp
-        _tmp = true
-        self.pos = _save5
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  row ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableRow unless _tmp
-    return _tmp
-  end
-
-  # TableItem2 = "|" TableItem
-  def _TableItem2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("|")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_TableItem)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableItem2 unless _tmp
-    return _tmp
-  end
-
-  # TableItem = < /(?:\\.|[^|\n])+/ > { text.strip.gsub(/\\(.)/, '\1')  }
-  def _TableItem
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix:(?:\\.|[^|\n])+)/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  text.strip.gsub(/\\(.)/, '\1')  ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableItem unless _tmp
-    return _tmp
-  end
-
-  # TableLine = ((TableAlign:align1 TableAlign2*:aligns {[align1, *aligns] }):line | TableAlign2+:line) "|"? @Newline { line }
-  def _TableLine
-
-    _save = self.pos
-    while true # sequence
-
-      _save1 = self.pos
-      while true # choice
-
-        _save2 = self.pos
-        while true # sequence
-          _tmp = apply(:_TableAlign)
-          align1 = @result
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          _ary = []
-          while true
-            _tmp = apply(:_TableAlign2)
-            _ary << @result if _tmp
-            break unless _tmp
-          end
-          _tmp = true
-          @result = _ary
-          aligns = @result
-          unless _tmp
-            self.pos = _save2
-            break
-          end
-          @result = begin; [align1, *aligns] ; end
-          _tmp = true
-          unless _tmp
-            self.pos = _save2
-          end
-          break
-        end # end sequence
-
-        line = @result
-        break if _tmp
-        self.pos = _save1
-        _save4 = self.pos
-        _ary = []
-        _tmp = apply(:_TableAlign2)
-        if _tmp
-          _ary << @result
-          while true
-            _tmp = apply(:_TableAlign2)
-            _ary << @result if _tmp
-            break unless _tmp
-          end
-          _tmp = true
-          @result = _ary
-        else
-          self.pos = _save4
-        end
-        line = @result
-        break if _tmp
-        self.pos = _save1
-        break
-      end # end choice
-
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save5 = self.pos
-      _tmp = match_string("|")
-      unless _tmp
-        _tmp = true
-        self.pos = _save5
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  line ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableLine unless _tmp
-    return _tmp
-  end
-
-  # TableAlign2 = "|" @Sp TableAlign
-  def _TableAlign2
-
-    _save = self.pos
-    while true # sequence
-      _tmp = match_string("|")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_TableAlign)
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableAlign2 unless _tmp
-    return _tmp
-  end
-
-  # TableAlign = < /:?-+:?/ > @Sp {                 text.start_with?(":") ?                 (text.end_with?(":") ? :center : :left) :                 (text.end_with?(":") ? :right : nil)               }
-  def _TableAlign
-
-    _save = self.pos
-    while true # sequence
-      _text_start = self.pos
-      _tmp = scan(/\G(?-mix::?-+:?)/)
-      if _tmp
-        text = get_text(_text_start)
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;
-                text.start_with?(":") ?
-                (text.end_with?(":") ? :center : :left) :
-                (text.end_with?(":") ? :right : nil)
-              ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_TableAlign unless _tmp
-    return _tmp
-  end
-
-  # DefinitionList = &{ definition_lists? } DefinitionListItem+:list { RDoc::Markup::List.new :NOTE, *list.flatten }
-  def _DefinitionList
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _tmp = begin;  definition_lists? ; end
-      self.pos = _save1
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _ary = []
-      _tmp = apply(:_DefinitionListItem)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_DefinitionListItem)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save2
-      end
-      list = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  RDoc::Markup::List.new :NOTE, *list.flatten ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_DefinitionList unless _tmp
-    return _tmp
-  end
-
-  # DefinitionListItem = DefinitionListLabel+:label DefinitionListDefinition+:defns { list_items = []                        list_items <<                          RDoc::Markup::ListItem.new(label, defns.shift)                         list_items.concat defns.map { |defn|                          RDoc::Markup::ListItem.new nil, defn                        } unless list_items.empty?                         list_items                      }
-  def _DefinitionListItem
-
-    _save = self.pos
-    while true # sequence
-      _save1 = self.pos
-      _ary = []
-      _tmp = apply(:_DefinitionListLabel)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_DefinitionListLabel)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save1
-      end
-      label = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save2 = self.pos
-      _ary = []
-      _tmp = apply(:_DefinitionListDefinition)
-      if _tmp
-        _ary << @result
-        while true
-          _tmp = apply(:_DefinitionListDefinition)
-          _ary << @result if _tmp
-          break unless _tmp
-        end
-        _tmp = true
-        @result = _ary
-      else
-        self.pos = _save2
-      end
-      defns = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  list_items = []
-                       list_items <<
-                         RDoc::Markup::ListItem.new(label, defns.shift)
-
-                       list_items.concat defns.map { |defn|
-                         RDoc::Markup::ListItem.new nil, defn
-                       } unless list_items.empty?
-
-                       list_items
-                     ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_DefinitionListItem unless _tmp
-    return _tmp
-  end
-
-  # DefinitionListLabel = Inline:label @Sp @Newline { label }
-  def _DefinitionListLabel
-
-    _save = self.pos
-    while true # sequence
-      _tmp = apply(:_Inline)
-      label = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Sp()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Newline()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  label ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_DefinitionListLabel unless _tmp
-    return _tmp
-  end
-
-  # DefinitionListDefinition = @NonindentSpace ":" @Space Inlines:a @BlankLine+ { paragraph a }
-  def _DefinitionListDefinition
-
-    _save = self.pos
-    while true # sequence
-      _tmp = _NonindentSpace()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = match_string(":")
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = _Space()
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _tmp = apply(:_Inlines)
-      a = @result
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      _save1 = self.pos
-      _tmp = _BlankLine()
-      if _tmp
-        while true
-          _tmp = _BlankLine()
-          break unless _tmp
-        end
-        _tmp = true
-      else
-        self.pos = _save1
-      end
-      unless _tmp
-        self.pos = _save
-        break
-      end
-      @result = begin;  paragraph a ; end
-      _tmp = true
-      unless _tmp
-        self.pos = _save
-      end
-      break
-    end # end sequence
-
-    set_failed_rule :_DefinitionListDefinition unless _tmp
-    return _tmp
-  end
-
-  Rules = {}
-  Rules[:_root] = rule_info("root", "Doc")
-  Rules[:_Doc] = rule_info("Doc", "BOM? Block*:a { RDoc::Markup::Document.new(*a.compact) }")
-  Rules[:_Block] = rule_info("Block", "@BlankLine* (BlockQuote | Verbatim | CodeFence | Table | Note | Reference | HorizontalRule | Heading | OrderedList | BulletList | DefinitionList | HtmlBlock | StyleBlock | Para | Plain)")
-  Rules[:_Para] = rule_info("Para", "@NonindentSpace Inlines:a @BlankLine+ { paragraph a }")
-  Rules[:_Plain] = rule_info("Plain", "Inlines:a { paragraph a }")
-  Rules[:_AtxInline] = rule_info("AtxInline", "!@Newline !(@Sp /\#*/ @Sp @Newline) Inline")
-  Rules[:_AtxStart] = rule_info("AtxStart", "< /\\\#{1,6}/ > { text.length }")
-  Rules[:_AtxHeading] = rule_info("AtxHeading", "AtxStart:s @Sp AtxInline+:a (@Sp /\#*/ @Sp)? @Newline { RDoc::Markup::Heading.new(s, a.join) }")
-  Rules[:_SetextHeading] = rule_info("SetextHeading", "(SetextHeading1 | SetextHeading2)")
-  Rules[:_SetextBottom1] = rule_info("SetextBottom1", "/={1,}/ @Newline")
-  Rules[:_SetextBottom2] = rule_info("SetextBottom2", "/-{1,}/ @Newline")
-  Rules[:_SetextHeading1] = rule_info("SetextHeading1", "&(@RawLine SetextBottom1) @StartList:a (!@Endline Inline:b { a << b })+ @Sp @Newline SetextBottom1 { RDoc::Markup::Heading.new(1, a.join) }")
-  Rules[:_SetextHeading2] = rule_info("SetextHeading2", "&(@RawLine SetextBottom2) @StartList:a (!@Endline Inline:b { a << b })+ @Sp @Newline SetextBottom2 { RDoc::Markup::Heading.new(2, a.join) }")
-  Rules[:_Heading] = rule_info("Heading", "(SetextHeading | AtxHeading)")
-  Rules[:_BlockQuote] = rule_info("BlockQuote", "BlockQuoteRaw:a { RDoc::Markup::BlockQuote.new(*a) }")
-  Rules[:_BlockQuoteRaw] = rule_info("BlockQuoteRaw", "@StartList:a (\">\" \" \"? Line:l { a << l } (!\">\" !@BlankLine Line:c { a << c })* (@BlankLine:n { a << n })*)+ { inner_parse a.join }")
-  Rules[:_NonblankIndentedLine] = rule_info("NonblankIndentedLine", "!@BlankLine IndentedLine")
-  Rules[:_VerbatimChunk] = rule_info("VerbatimChunk", "@BlankLine*:a NonblankIndentedLine+:b { a.concat b }")
-  Rules[:_Verbatim] = rule_info("Verbatim", "VerbatimChunk+:a { RDoc::Markup::Verbatim.new(*a.flatten) }")
-  Rules[:_HorizontalRule] = rule_info("HorizontalRule", "@NonindentSpace (\"*\" @Sp \"*\" @Sp \"*\" (@Sp \"*\")* | \"-\" @Sp \"-\" @Sp \"-\" (@Sp \"-\")* | \"_\" @Sp \"_\" @Sp \"_\" (@Sp \"_\")*) @Sp @Newline @BlankLine+ { RDoc::Markup::Rule.new 1 }")
-  Rules[:_Bullet] = rule_info("Bullet", "!HorizontalRule @NonindentSpace /[+*-]/ @Spacechar+")
-  Rules[:_BulletList] = rule_info("BulletList", "&Bullet (ListTight | ListLoose):a { RDoc::Markup::List.new(:BULLET, *a) }")
-  Rules[:_ListTight] = rule_info("ListTight", "ListItemTight+:a @BlankLine* !(Bullet | Enumerator) { a }")
-  Rules[:_ListLoose] = rule_info("ListLoose", "@StartList:a (ListItem:b @BlankLine* { a << b })+ { a }")
-  Rules[:_ListItem] = rule_info("ListItem", "(Bullet | Enumerator) @StartList:a ListBlock:b { a << b } (ListContinuationBlock:c { a.push(*c) })* { list_item_from a }")
-  Rules[:_ListItemTight] = rule_info("ListItemTight", "(Bullet | Enumerator) ListBlock:a (!@BlankLine ListContinuationBlock:b { a.push(*b) })* !ListContinuationBlock { list_item_from a }")
-  Rules[:_ListBlock] = rule_info("ListBlock", "!@BlankLine Line:a ListBlockLine*:c { [a, *c] }")
-  Rules[:_ListContinuationBlock] = rule_info("ListContinuationBlock", "@StartList:a @BlankLine* { a << \"\\n\" } (Indent ListBlock:b { a.concat b })+ { a }")
-  Rules[:_Enumerator] = rule_info("Enumerator", "@NonindentSpace [0-9]+ \".\" @Spacechar+")
-  Rules[:_OrderedList] = rule_info("OrderedList", "&Enumerator (ListTight | ListLoose):a { RDoc::Markup::List.new(:NUMBER, *a) }")
-  Rules[:_ListBlockLine] = rule_info("ListBlockLine", "!@BlankLine !(Indent? (Bullet | Enumerator)) !HorizontalRule OptionallyIndentedLine")
-  Rules[:_HtmlOpenAnchor] = rule_info("HtmlOpenAnchor", "\"<\" Spnl (\"a\" | \"A\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlCloseAnchor] = rule_info("HtmlCloseAnchor", "\"<\" Spnl \"/\" (\"a\" | \"A\") Spnl \">\"")
-  Rules[:_HtmlAnchor] = rule_info("HtmlAnchor", "HtmlOpenAnchor (HtmlAnchor | !HtmlCloseAnchor .)* HtmlCloseAnchor")
-  Rules[:_HtmlBlockOpenAddress] = rule_info("HtmlBlockOpenAddress", "\"<\" Spnl (\"address\" | \"ADDRESS\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseAddress] = rule_info("HtmlBlockCloseAddress", "\"<\" Spnl \"/\" (\"address\" | \"ADDRESS\") Spnl \">\"")
-  Rules[:_HtmlBlockAddress] = rule_info("HtmlBlockAddress", "HtmlBlockOpenAddress (HtmlBlockAddress | !HtmlBlockCloseAddress .)* HtmlBlockCloseAddress")
-  Rules[:_HtmlBlockOpenBlockquote] = rule_info("HtmlBlockOpenBlockquote", "\"<\" Spnl (\"blockquote\" | \"BLOCKQUOTE\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseBlockquote] = rule_info("HtmlBlockCloseBlockquote", "\"<\" Spnl \"/\" (\"blockquote\" | \"BLOCKQUOTE\") Spnl \">\"")
-  Rules[:_HtmlBlockBlockquote] = rule_info("HtmlBlockBlockquote", "HtmlBlockOpenBlockquote (HtmlBlockBlockquote | !HtmlBlockCloseBlockquote .)* HtmlBlockCloseBlockquote")
-  Rules[:_HtmlBlockOpenCenter] = rule_info("HtmlBlockOpenCenter", "\"<\" Spnl (\"center\" | \"CENTER\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseCenter] = rule_info("HtmlBlockCloseCenter", "\"<\" Spnl \"/\" (\"center\" | \"CENTER\") Spnl \">\"")
-  Rules[:_HtmlBlockCenter] = rule_info("HtmlBlockCenter", "HtmlBlockOpenCenter (HtmlBlockCenter | !HtmlBlockCloseCenter .)* HtmlBlockCloseCenter")
-  Rules[:_HtmlBlockOpenDir] = rule_info("HtmlBlockOpenDir", "\"<\" Spnl (\"dir\" | \"DIR\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseDir] = rule_info("HtmlBlockCloseDir", "\"<\" Spnl \"/\" (\"dir\" | \"DIR\") Spnl \">\"")
-  Rules[:_HtmlBlockDir] = rule_info("HtmlBlockDir", "HtmlBlockOpenDir (HtmlBlockDir | !HtmlBlockCloseDir .)* HtmlBlockCloseDir")
-  Rules[:_HtmlBlockOpenDiv] = rule_info("HtmlBlockOpenDiv", "\"<\" Spnl (\"div\" | \"DIV\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseDiv] = rule_info("HtmlBlockCloseDiv", "\"<\" Spnl \"/\" (\"div\" | \"DIV\") Spnl \">\"")
-  Rules[:_HtmlBlockDiv] = rule_info("HtmlBlockDiv", "HtmlBlockOpenDiv (HtmlBlockDiv | !HtmlBlockCloseDiv .)* HtmlBlockCloseDiv")
-  Rules[:_HtmlBlockOpenDl] = rule_info("HtmlBlockOpenDl", "\"<\" Spnl (\"dl\" | \"DL\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseDl] = rule_info("HtmlBlockCloseDl", "\"<\" Spnl \"/\" (\"dl\" | \"DL\") Spnl \">\"")
-  Rules[:_HtmlBlockDl] = rule_info("HtmlBlockDl", "HtmlBlockOpenDl (HtmlBlockDl | !HtmlBlockCloseDl .)* HtmlBlockCloseDl")
-  Rules[:_HtmlBlockOpenFieldset] = rule_info("HtmlBlockOpenFieldset", "\"<\" Spnl (\"fieldset\" | \"FIELDSET\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseFieldset] = rule_info("HtmlBlockCloseFieldset", "\"<\" Spnl \"/\" (\"fieldset\" | \"FIELDSET\") Spnl \">\"")
-  Rules[:_HtmlBlockFieldset] = rule_info("HtmlBlockFieldset", "HtmlBlockOpenFieldset (HtmlBlockFieldset | !HtmlBlockCloseFieldset .)* HtmlBlockCloseFieldset")
-  Rules[:_HtmlBlockOpenForm] = rule_info("HtmlBlockOpenForm", "\"<\" Spnl (\"form\" | \"FORM\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseForm] = rule_info("HtmlBlockCloseForm", "\"<\" Spnl \"/\" (\"form\" | \"FORM\") Spnl \">\"")
-  Rules[:_HtmlBlockForm] = rule_info("HtmlBlockForm", "HtmlBlockOpenForm (HtmlBlockForm | !HtmlBlockCloseForm .)* HtmlBlockCloseForm")
-  Rules[:_HtmlBlockOpenH1] = rule_info("HtmlBlockOpenH1", "\"<\" Spnl (\"h1\" | \"H1\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH1] = rule_info("HtmlBlockCloseH1", "\"<\" Spnl \"/\" (\"h1\" | \"H1\") Spnl \">\"")
-  Rules[:_HtmlBlockH1] = rule_info("HtmlBlockH1", "HtmlBlockOpenH1 (HtmlBlockH1 | !HtmlBlockCloseH1 .)* HtmlBlockCloseH1")
-  Rules[:_HtmlBlockOpenH2] = rule_info("HtmlBlockOpenH2", "\"<\" Spnl (\"h2\" | \"H2\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH2] = rule_info("HtmlBlockCloseH2", "\"<\" Spnl \"/\" (\"h2\" | \"H2\") Spnl \">\"")
-  Rules[:_HtmlBlockH2] = rule_info("HtmlBlockH2", "HtmlBlockOpenH2 (HtmlBlockH2 | !HtmlBlockCloseH2 .)* HtmlBlockCloseH2")
-  Rules[:_HtmlBlockOpenH3] = rule_info("HtmlBlockOpenH3", "\"<\" Spnl (\"h3\" | \"H3\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH3] = rule_info("HtmlBlockCloseH3", "\"<\" Spnl \"/\" (\"h3\" | \"H3\") Spnl \">\"")
-  Rules[:_HtmlBlockH3] = rule_info("HtmlBlockH3", "HtmlBlockOpenH3 (HtmlBlockH3 | !HtmlBlockCloseH3 .)* HtmlBlockCloseH3")
-  Rules[:_HtmlBlockOpenH4] = rule_info("HtmlBlockOpenH4", "\"<\" Spnl (\"h4\" | \"H4\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH4] = rule_info("HtmlBlockCloseH4", "\"<\" Spnl \"/\" (\"h4\" | \"H4\") Spnl \">\"")
-  Rules[:_HtmlBlockH4] = rule_info("HtmlBlockH4", "HtmlBlockOpenH4 (HtmlBlockH4 | !HtmlBlockCloseH4 .)* HtmlBlockCloseH4")
-  Rules[:_HtmlBlockOpenH5] = rule_info("HtmlBlockOpenH5", "\"<\" Spnl (\"h5\" | \"H5\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH5] = rule_info("HtmlBlockCloseH5", "\"<\" Spnl \"/\" (\"h5\" | \"H5\") Spnl \">\"")
-  Rules[:_HtmlBlockH5] = rule_info("HtmlBlockH5", "HtmlBlockOpenH5 (HtmlBlockH5 | !HtmlBlockCloseH5 .)* HtmlBlockCloseH5")
-  Rules[:_HtmlBlockOpenH6] = rule_info("HtmlBlockOpenH6", "\"<\" Spnl (\"h6\" | \"H6\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseH6] = rule_info("HtmlBlockCloseH6", "\"<\" Spnl \"/\" (\"h6\" | \"H6\") Spnl \">\"")
-  Rules[:_HtmlBlockH6] = rule_info("HtmlBlockH6", "HtmlBlockOpenH6 (HtmlBlockH6 | !HtmlBlockCloseH6 .)* HtmlBlockCloseH6")
-  Rules[:_HtmlBlockOpenMenu] = rule_info("HtmlBlockOpenMenu", "\"<\" Spnl (\"menu\" | \"MENU\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseMenu] = rule_info("HtmlBlockCloseMenu", "\"<\" Spnl \"/\" (\"menu\" | \"MENU\") Spnl \">\"")
-  Rules[:_HtmlBlockMenu] = rule_info("HtmlBlockMenu", "HtmlBlockOpenMenu (HtmlBlockMenu | !HtmlBlockCloseMenu .)* HtmlBlockCloseMenu")
-  Rules[:_HtmlBlockOpenNoframes] = rule_info("HtmlBlockOpenNoframes", "\"<\" Spnl (\"noframes\" | \"NOFRAMES\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseNoframes] = rule_info("HtmlBlockCloseNoframes", "\"<\" Spnl \"/\" (\"noframes\" | \"NOFRAMES\") Spnl \">\"")
-  Rules[:_HtmlBlockNoframes] = rule_info("HtmlBlockNoframes", "HtmlBlockOpenNoframes (HtmlBlockNoframes | !HtmlBlockCloseNoframes .)* HtmlBlockCloseNoframes")
-  Rules[:_HtmlBlockOpenNoscript] = rule_info("HtmlBlockOpenNoscript", "\"<\" Spnl (\"noscript\" | \"NOSCRIPT\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseNoscript] = rule_info("HtmlBlockCloseNoscript", "\"<\" Spnl \"/\" (\"noscript\" | \"NOSCRIPT\") Spnl \">\"")
-  Rules[:_HtmlBlockNoscript] = rule_info("HtmlBlockNoscript", "HtmlBlockOpenNoscript (HtmlBlockNoscript | !HtmlBlockCloseNoscript .)* HtmlBlockCloseNoscript")
-  Rules[:_HtmlBlockOpenOl] = rule_info("HtmlBlockOpenOl", "\"<\" Spnl (\"ol\" | \"OL\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseOl] = rule_info("HtmlBlockCloseOl", "\"<\" Spnl \"/\" (\"ol\" | \"OL\") Spnl \">\"")
-  Rules[:_HtmlBlockOl] = rule_info("HtmlBlockOl", "HtmlBlockOpenOl (HtmlBlockOl | !HtmlBlockCloseOl .)* HtmlBlockCloseOl")
-  Rules[:_HtmlBlockOpenP] = rule_info("HtmlBlockOpenP", "\"<\" Spnl (\"p\" | \"P\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseP] = rule_info("HtmlBlockCloseP", "\"<\" Spnl \"/\" (\"p\" | \"P\") Spnl \">\"")
-  Rules[:_HtmlBlockP] = rule_info("HtmlBlockP", "HtmlBlockOpenP (HtmlBlockP | !HtmlBlockCloseP .)* HtmlBlockCloseP")
-  Rules[:_HtmlBlockOpenPre] = rule_info("HtmlBlockOpenPre", "\"<\" Spnl (\"pre\" | \"PRE\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockClosePre] = rule_info("HtmlBlockClosePre", "\"<\" Spnl \"/\" (\"pre\" | \"PRE\") Spnl \">\"")
-  Rules[:_HtmlBlockPre] = rule_info("HtmlBlockPre", "HtmlBlockOpenPre (HtmlBlockPre | !HtmlBlockClosePre .)* HtmlBlockClosePre")
-  Rules[:_HtmlBlockOpenTable] = rule_info("HtmlBlockOpenTable", "\"<\" Spnl (\"table\" | \"TABLE\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTable] = rule_info("HtmlBlockCloseTable", "\"<\" Spnl \"/\" (\"table\" | \"TABLE\") Spnl \">\"")
-  Rules[:_HtmlBlockTable] = rule_info("HtmlBlockTable", "HtmlBlockOpenTable (HtmlBlockTable | !HtmlBlockCloseTable .)* HtmlBlockCloseTable")
-  Rules[:_HtmlBlockOpenUl] = rule_info("HtmlBlockOpenUl", "\"<\" Spnl (\"ul\" | \"UL\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseUl] = rule_info("HtmlBlockCloseUl", "\"<\" Spnl \"/\" (\"ul\" | \"UL\") Spnl \">\"")
-  Rules[:_HtmlBlockUl] = rule_info("HtmlBlockUl", "HtmlBlockOpenUl (HtmlBlockUl | !HtmlBlockCloseUl .)* HtmlBlockCloseUl")
-  Rules[:_HtmlBlockOpenDd] = rule_info("HtmlBlockOpenDd", "\"<\" Spnl (\"dd\" | \"DD\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseDd] = rule_info("HtmlBlockCloseDd", "\"<\" Spnl \"/\" (\"dd\" | \"DD\") Spnl \">\"")
-  Rules[:_HtmlBlockDd] = rule_info("HtmlBlockDd", "HtmlBlockOpenDd (HtmlBlockDd | !HtmlBlockCloseDd .)* HtmlBlockCloseDd")
-  Rules[:_HtmlBlockOpenDt] = rule_info("HtmlBlockOpenDt", "\"<\" Spnl (\"dt\" | \"DT\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseDt] = rule_info("HtmlBlockCloseDt", "\"<\" Spnl \"/\" (\"dt\" | \"DT\") Spnl \">\"")
-  Rules[:_HtmlBlockDt] = rule_info("HtmlBlockDt", "HtmlBlockOpenDt (HtmlBlockDt | !HtmlBlockCloseDt .)* HtmlBlockCloseDt")
-  Rules[:_HtmlBlockOpenFrameset] = rule_info("HtmlBlockOpenFrameset", "\"<\" Spnl (\"frameset\" | \"FRAMESET\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseFrameset] = rule_info("HtmlBlockCloseFrameset", "\"<\" Spnl \"/\" (\"frameset\" | \"FRAMESET\") Spnl \">\"")
-  Rules[:_HtmlBlockFrameset] = rule_info("HtmlBlockFrameset", "HtmlBlockOpenFrameset (HtmlBlockFrameset | !HtmlBlockCloseFrameset .)* HtmlBlockCloseFrameset")
-  Rules[:_HtmlBlockOpenLi] = rule_info("HtmlBlockOpenLi", "\"<\" Spnl (\"li\" | \"LI\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseLi] = rule_info("HtmlBlockCloseLi", "\"<\" Spnl \"/\" (\"li\" | \"LI\") Spnl \">\"")
-  Rules[:_HtmlBlockLi] = rule_info("HtmlBlockLi", "HtmlBlockOpenLi (HtmlBlockLi | !HtmlBlockCloseLi .)* HtmlBlockCloseLi")
-  Rules[:_HtmlBlockOpenTbody] = rule_info("HtmlBlockOpenTbody", "\"<\" Spnl (\"tbody\" | \"TBODY\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTbody] = rule_info("HtmlBlockCloseTbody", "\"<\" Spnl \"/\" (\"tbody\" | \"TBODY\") Spnl \">\"")
-  Rules[:_HtmlBlockTbody] = rule_info("HtmlBlockTbody", "HtmlBlockOpenTbody (HtmlBlockTbody | !HtmlBlockCloseTbody .)* HtmlBlockCloseTbody")
-  Rules[:_HtmlBlockOpenTd] = rule_info("HtmlBlockOpenTd", "\"<\" Spnl (\"td\" | \"TD\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTd] = rule_info("HtmlBlockCloseTd", "\"<\" Spnl \"/\" (\"td\" | \"TD\") Spnl \">\"")
-  Rules[:_HtmlBlockTd] = rule_info("HtmlBlockTd", "HtmlBlockOpenTd (HtmlBlockTd | !HtmlBlockCloseTd .)* HtmlBlockCloseTd")
-  Rules[:_HtmlBlockOpenTfoot] = rule_info("HtmlBlockOpenTfoot", "\"<\" Spnl (\"tfoot\" | \"TFOOT\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTfoot] = rule_info("HtmlBlockCloseTfoot", "\"<\" Spnl \"/\" (\"tfoot\" | \"TFOOT\") Spnl \">\"")
-  Rules[:_HtmlBlockTfoot] = rule_info("HtmlBlockTfoot", "HtmlBlockOpenTfoot (HtmlBlockTfoot | !HtmlBlockCloseTfoot .)* HtmlBlockCloseTfoot")
-  Rules[:_HtmlBlockOpenTh] = rule_info("HtmlBlockOpenTh", "\"<\" Spnl (\"th\" | \"TH\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTh] = rule_info("HtmlBlockCloseTh", "\"<\" Spnl \"/\" (\"th\" | \"TH\") Spnl \">\"")
-  Rules[:_HtmlBlockTh] = rule_info("HtmlBlockTh", "HtmlBlockOpenTh (HtmlBlockTh | !HtmlBlockCloseTh .)* HtmlBlockCloseTh")
-  Rules[:_HtmlBlockOpenThead] = rule_info("HtmlBlockOpenThead", "\"<\" Spnl (\"thead\" | \"THEAD\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseThead] = rule_info("HtmlBlockCloseThead", "\"<\" Spnl \"/\" (\"thead\" | \"THEAD\") Spnl \">\"")
-  Rules[:_HtmlBlockThead] = rule_info("HtmlBlockThead", "HtmlBlockOpenThead (HtmlBlockThead | !HtmlBlockCloseThead .)* HtmlBlockCloseThead")
-  Rules[:_HtmlBlockOpenTr] = rule_info("HtmlBlockOpenTr", "\"<\" Spnl (\"tr\" | \"TR\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseTr] = rule_info("HtmlBlockCloseTr", "\"<\" Spnl \"/\" (\"tr\" | \"TR\") Spnl \">\"")
-  Rules[:_HtmlBlockTr] = rule_info("HtmlBlockTr", "HtmlBlockOpenTr (HtmlBlockTr | !HtmlBlockCloseTr .)* HtmlBlockCloseTr")
-  Rules[:_HtmlBlockOpenScript] = rule_info("HtmlBlockOpenScript", "\"<\" Spnl (\"script\" | \"SCRIPT\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseScript] = rule_info("HtmlBlockCloseScript", "\"<\" Spnl \"/\" (\"script\" | \"SCRIPT\") Spnl \">\"")
-  Rules[:_HtmlBlockScript] = rule_info("HtmlBlockScript", "HtmlBlockOpenScript (!HtmlBlockCloseScript .)* HtmlBlockCloseScript")
-  Rules[:_HtmlBlockOpenHead] = rule_info("HtmlBlockOpenHead", "\"<\" Spnl (\"head\" | \"HEAD\") Spnl HtmlAttribute* \">\"")
-  Rules[:_HtmlBlockCloseHead] = rule_info("HtmlBlockCloseHead", "\"<\" Spnl \"/\" (\"head\" | \"HEAD\") Spnl \">\"")
-  Rules[:_HtmlBlockHead] = rule_info("HtmlBlockHead", "HtmlBlockOpenHead (!HtmlBlockCloseHead .)* HtmlBlockCloseHead")
-  Rules[:_HtmlBlockInTags] = rule_info("HtmlBlockInTags", "(HtmlAnchor | HtmlBlockAddress | HtmlBlockBlockquote | HtmlBlockCenter | HtmlBlockDir | HtmlBlockDiv | HtmlBlockDl | HtmlBlockFieldset | HtmlBlockForm | HtmlBlockH1 | HtmlBlockH2 | HtmlBlockH3 | HtmlBlockH4 | HtmlBlockH5 | HtmlBlockH6 | HtmlBlockMenu | HtmlBlockNoframes | HtmlBlockNoscript | HtmlBlockOl | HtmlBlockP | HtmlBlockPre | HtmlBlockTable | HtmlBlockUl | HtmlBlockDd | HtmlBlockDt | HtmlBlockFrameset | HtmlBlockLi | HtmlBlockTbody | HtmlBlockTd | HtmlBlockTfoot | HtmlBlockTh | HtmlBlockThead | HtmlBlockTr | HtmlBlockScript | HtmlBlockHead)")
-  Rules[:_HtmlBlock] = rule_info("HtmlBlock", "< (HtmlBlockInTags | HtmlComment | HtmlBlockSelfClosing | HtmlUnclosed) > @BlankLine+ { if html? then                 RDoc::Markup::Raw.new text               end }")
-  Rules[:_HtmlUnclosed] = rule_info("HtmlUnclosed", "\"<\" Spnl HtmlUnclosedType Spnl HtmlAttribute* Spnl \">\"")
-  Rules[:_HtmlUnclosedType] = rule_info("HtmlUnclosedType", "(\"HR\" | \"hr\")")
-  Rules[:_HtmlBlockSelfClosing] = rule_info("HtmlBlockSelfClosing", "\"<\" Spnl HtmlBlockType Spnl HtmlAttribute* \"/\" Spnl \">\"")
-  Rules[:_HtmlBlockType] = rule_info("HtmlBlockType", "(\"ADDRESS\" | \"BLOCKQUOTE\" | \"CENTER\" | \"DD\" | \"DIR\" | \"DIV\" | \"DL\" | \"DT\" | \"FIELDSET\" | \"FORM\" | \"FRAMESET\" | \"H1\" | \"H2\" | \"H3\" | \"H4\" | \"H5\" | \"H6\" | \"HR\" | \"ISINDEX\" | \"LI\" | \"MENU\" | \"NOFRAMES\" | \"NOSCRIPT\" | \"OL\" | \"P\" | \"PRE\" | \"SCRIPT\" | \"TABLE\" | \"TBODY\" | \"TD\" | \"TFOOT\" | \"TH\" | \"THEAD\" | \"TR\" | \"UL\" | \"address\" | \"blockquote\" | \"center\" | \"dd\" | \"dir\" | \"div\" | \"dl\" | \"dt\" | \"fieldset\" | \"form\" | \"frameset\" | \"h1\" | \"h2\" | \"h3\" | \"h4\" | \"h5\" | \"h6\" | \"hr\" | \"isindex\" | \"li\" | \"menu\" | \"noframes\" | \"noscript\" | \"ol\" | \"p\" | \"pre\" | \"script\" | \"table\" | \"tbody\" | \"td\" | \"tfoot\" | \"th\" | \"thead\" | \"tr\" | \"ul\")")
-  Rules[:_StyleOpen] = rule_info("StyleOpen", "\"<\" Spnl (\"style\" | \"STYLE\") Spnl HtmlAttribute* \">\"")
-  Rules[:_StyleClose] = rule_info("StyleClose", "\"<\" Spnl \"/\" (\"style\" | \"STYLE\") Spnl \">\"")
-  Rules[:_InStyleTags] = rule_info("InStyleTags", "StyleOpen (!StyleClose .)* StyleClose")
-  Rules[:_StyleBlock] = rule_info("StyleBlock", "< InStyleTags > @BlankLine* { if css? then                     RDoc::Markup::Raw.new text                   end }")
-  Rules[:_Inlines] = rule_info("Inlines", "(!@Endline Inline:i { i } | @Endline:c !(&{ github? } Ticks3 /[^`\\n]*$/) &Inline { c })+:chunks @Endline? { chunks }")
-  Rules[:_Inline] = rule_info("Inline", "(Str | @Endline | UlOrStarLine | @Space | Strong | Emph | Strike | Image | Link | NoteReference | InlineNote | Code | RawHtml | Entity | EscapedChar | Symbol)")
-  Rules[:_Space] = rule_info("Space", "@Spacechar+ { \" \" }")
-  Rules[:_Str] = rule_info("Str", "@StartList:a < @NormalChar+ > { a = text } (StrChunk:c { a << c })* { a }")
-  Rules[:_StrChunk] = rule_info("StrChunk", "< (@NormalChar | /_+/ &Alphanumeric)+ > { text }")
-  Rules[:_EscapedChar] = rule_info("EscapedChar", "\"\\\\\" !@Newline < /[:\\\\`|*_{}\\[\\]()\#+.!><-]/ > { text }")
-  Rules[:_Entity] = rule_info("Entity", "(HexEntity | DecEntity | CharEntity):a { a }")
-  Rules[:_Endline] = rule_info("Endline", "(@LineBreak | @TerminalEndline | @NormalEndline)")
-  Rules[:_NormalEndline] = rule_info("NormalEndline", "@Sp @Newline !@BlankLine !\">\" !AtxStart !(Line /={1,}|-{1,}/ @Newline) { \"\\n\" }")
-  Rules[:_TerminalEndline] = rule_info("TerminalEndline", "@Sp @Newline @Eof")
-  Rules[:_LineBreak] = rule_info("LineBreak", "\"  \" @NormalEndline { RDoc::Markup::HardBreak.new }")
-  Rules[:_Symbol] = rule_info("Symbol", "< @SpecialChar > { text }")
-  Rules[:_UlOrStarLine] = rule_info("UlOrStarLine", "(UlLine | StarLine):a { a }")
-  Rules[:_StarLine] = rule_info("StarLine", "(< /\\*{4,}/ > { text } | < @Spacechar /\\*+/ &@Spacechar > { text })")
-  Rules[:_UlLine] = rule_info("UlLine", "(< /_{4,}/ > { text } | < @Spacechar /_+/ &@Spacechar > { text })")
-  Rules[:_Emph] = rule_info("Emph", "(EmphStar | EmphUl)")
-  Rules[:_Whitespace] = rule_info("Whitespace", "(@Spacechar | @Newline)")
-  Rules[:_EmphStar] = rule_info("EmphStar", "\"*\" !@Whitespace @StartList:a (!\"*\" Inline:b { a << b } | StrongStar:b { a << b })+ \"*\" { emphasis a.join }")
-  Rules[:_EmphUl] = rule_info("EmphUl", "\"_\" !@Whitespace @StartList:a (!\"_\" Inline:b { a << b } | StrongUl:b { a << b })+ \"_\" { emphasis a.join }")
-  Rules[:_Strong] = rule_info("Strong", "(StrongStar | StrongUl)")
-  Rules[:_StrongStar] = rule_info("StrongStar", "\"**\" !@Whitespace @StartList:a (!\"**\" Inline:b { a << b })+ \"**\" { strong a.join }")
-  Rules[:_StrongUl] = rule_info("StrongUl", "\"__\" !@Whitespace @StartList:a (!\"__\" Inline:b { a << b })+ \"__\" { strong a.join }")
-  Rules[:_Strike] = rule_info("Strike", "&{ strike? } \"~~\" !@Whitespace @StartList:a (!\"~~\" Inline:b { a << b })+ \"~~\" { strike a.join }")
-  Rules[:_Image] = rule_info("Image", "\"!\" (ExplicitLink | ReferenceLink):a { \"rdoc-image:\#{a[/\\[(.*)\\]/, 1]}\" }")
-  Rules[:_Link] = rule_info("Link", "(ExplicitLink | ReferenceLink | AutoLink)")
-  Rules[:_ReferenceLink] = rule_info("ReferenceLink", "(ReferenceLinkDouble | ReferenceLinkSingle)")
-  Rules[:_ReferenceLinkDouble] = rule_info("ReferenceLinkDouble", "Label:content < Spnl > !\"[]\" Label:label { link_to content, label, text }")
-  Rules[:_ReferenceLinkSingle] = rule_info("ReferenceLinkSingle", "Label:content < (Spnl \"[]\")? > { link_to content, content, text }")
-  Rules[:_ExplicitLink] = rule_info("ExplicitLink", "Label:l \"(\" @Sp Source:s Spnl Title @Sp \")\" { \"{\#{l}}[\#{s}]\" }")
-  Rules[:_Source] = rule_info("Source", "(\"<\" < SourceContents > \">\" | < SourceContents >) { text }")
-  Rules[:_SourceContents] = rule_info("SourceContents", "((!\"(\" !\")\" !\">\" Nonspacechar)+ | \"(\" SourceContents \")\")*")
-  Rules[:_Title] = rule_info("Title", "(TitleSingle | TitleDouble | \"\"):a { a }")
-  Rules[:_TitleSingle] = rule_info("TitleSingle", "\"'\" (!(\"'\" @Sp (\")\" | @Newline)) .)* \"'\"")
-  Rules[:_TitleDouble] = rule_info("TitleDouble", "\"\\\"\" (!(\"\\\"\" @Sp (\")\" | @Newline)) .)* \"\\\"\"")
-  Rules[:_AutoLink] = rule_info("AutoLink", "(AutoLinkUrl | AutoLinkEmail)")
-  Rules[:_AutoLinkUrl] = rule_info("AutoLinkUrl", "\"<\" < /[A-Za-z]+/ \"://\" (!@Newline !\">\" .)+ > \">\" { text }")
-  Rules[:_AutoLinkEmail] = rule_info("AutoLinkEmail", "\"<\" \"mailto:\"? < /[\\w+.\\/!%~$-]+/i \"@\" (!@Newline !\">\" .)+ > \">\" { \"mailto:\#{text}\" }")
-  Rules[:_Reference] = rule_info("Reference", "@NonindentSpace !\"[]\" Label:label \":\" Spnl RefSrc:link RefTitle @BlankLine+ { \# TODO use title               reference label, link               nil             }")
-  Rules[:_Label] = rule_info("Label", "\"[\" (!\"^\" &{ notes? } | &. &{ !notes? }) @StartList:a (!\"]\" Inline:l { a << l })* \"]\" { a.join.gsub(/\\s+/, ' ') }")
-  Rules[:_RefSrc] = rule_info("RefSrc", "< Nonspacechar+ > { text }")
-  Rules[:_RefTitle] = rule_info("RefTitle", "(RefTitleSingle | RefTitleDouble | RefTitleParens | EmptyTitle)")
-  Rules[:_EmptyTitle] = rule_info("EmptyTitle", "\"\"")
-  Rules[:_RefTitleSingle] = rule_info("RefTitleSingle", "Spnl \"'\" < (!(\"'\" @Sp @Newline | @Newline) .)* > \"'\" { text }")
-  Rules[:_RefTitleDouble] = rule_info("RefTitleDouble", "Spnl \"\\\"\" < (!(\"\\\"\" @Sp @Newline | @Newline) .)* > \"\\\"\" { text }")
-  Rules[:_RefTitleParens] = rule_info("RefTitleParens", "Spnl \"(\" < (!(\")\" @Sp @Newline | @Newline) .)* > \")\" { text }")
-  Rules[:_References] = rule_info("References", "(Reference | SkipBlock)*")
-  Rules[:_Ticks1] = rule_info("Ticks1", "\"`\" !\"`\"")
-  Rules[:_Ticks2] = rule_info("Ticks2", "\"``\" !\"`\"")
-  Rules[:_Ticks3] = rule_info("Ticks3", "\"```\" !\"`\"")
-  Rules[:_Ticks4] = rule_info("Ticks4", "\"````\" !\"`\"")
-  Rules[:_Ticks5] = rule_info("Ticks5", "\"`````\" !\"`\"")
-  Rules[:_Code] = rule_info("Code", "(Ticks1 @Sp < ((!\"`\" Nonspacechar)+ | !Ticks1 /`+/ | !(@Sp Ticks1) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks1 | Ticks2 @Sp < ((!\"`\" Nonspacechar)+ | !Ticks2 /`+/ | !(@Sp Ticks2) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks2 | Ticks3 @Sp < ((!\"`\" Nonspacechar)+ | !Ticks3 /`+/ | !(@Sp Ticks3) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks3 | Ticks4 @Sp < ((!\"`\" Nonspacechar)+ | !Ticks4 /`+/ | !(@Sp Ticks4) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks4 | Ticks5 @Sp < ((!\"`\" Nonspacechar)+ | !Ticks5 /`+/ | !(@Sp Ticks5) (@Spacechar | @Newline !@BlankLine))+ > @Sp Ticks5) { \"<code>\#{text}</code>\" }")
-  Rules[:_RawHtml] = rule_info("RawHtml", "< (HtmlComment | HtmlBlockScript | HtmlTag) > { if html? then text else '' end }")
-  Rules[:_BlankLine] = rule_info("BlankLine", "@Sp @Newline { \"\\n\" }")
-  Rules[:_Quoted] = rule_info("Quoted", "(\"\\\"\" (!\"\\\"\" .)* \"\\\"\" | \"'\" (!\"'\" .)* \"'\")")
-  Rules[:_HtmlAttribute] = rule_info("HtmlAttribute", "(AlphanumericAscii | \"-\")+ Spnl (\"=\" Spnl (Quoted | (!\">\" Nonspacechar)+))? Spnl")
-  Rules[:_HtmlComment] = rule_info("HtmlComment", "\"<!--\" (!\"-->\" .)* \"-->\"")
-  Rules[:_HtmlTag] = rule_info("HtmlTag", "\"<\" Spnl \"/\"? AlphanumericAscii+ Spnl HtmlAttribute* \"/\"? Spnl \">\"")
-  Rules[:_Eof] = rule_info("Eof", "!.")
-  Rules[:_Nonspacechar] = rule_info("Nonspacechar", "!@Spacechar !@Newline .")
-  Rules[:_Sp] = rule_info("Sp", "@Spacechar*")
-  Rules[:_Spnl] = rule_info("Spnl", "@Sp (@Newline @Sp)?")
-  Rules[:_SpecialChar] = rule_info("SpecialChar", "(/[~*_`&\\[\\]()<!\#\\\\'\"]/ | @ExtendedSpecialChar)")
-  Rules[:_NormalChar] = rule_info("NormalChar", "!(@SpecialChar | @Spacechar | @Newline) .")
-  Rules[:_Digit] = rule_info("Digit", "[0-9]")
-  Rules[:_Alphanumeric] = rule_info("Alphanumeric", "%literals.Alphanumeric")
-  Rules[:_AlphanumericAscii] = rule_info("AlphanumericAscii", "%literals.AlphanumericAscii")
-  Rules[:_BOM] = rule_info("BOM", "%literals.BOM")
-  Rules[:_Newline] = rule_info("Newline", "%literals.Newline")
-  Rules[:_Spacechar] = rule_info("Spacechar", "%literals.Spacechar")
-  Rules[:_HexEntity] = rule_info("HexEntity", "/&\#x/i < /[0-9a-fA-F]+/ > \";\" { [text.to_i(16)].pack 'U' }")
-  Rules[:_DecEntity] = rule_info("DecEntity", "\"&\#\" < /[0-9]+/ > \";\" { [text.to_i].pack 'U' }")
-  Rules[:_CharEntity] = rule_info("CharEntity", "\"&\" < /[A-Za-z0-9]+/ > \";\" { if entity = HTML_ENTITIES[text] then                  entity.pack 'U*'                else                  \"&\#{text};\"                end              }")
-  Rules[:_NonindentSpace] = rule_info("NonindentSpace", "/ {0,3}/")
-  Rules[:_Indent] = rule_info("Indent", "/\\t|    /")
-  Rules[:_IndentedLine] = rule_info("IndentedLine", "Indent Line")
-  Rules[:_OptionallyIndentedLine] = rule_info("OptionallyIndentedLine", "Indent? Line")
-  Rules[:_StartList] = rule_info("StartList", "&. { [] }")
-  Rules[:_Line] = rule_info("Line", "@RawLine:a { a }")
-  Rules[:_RawLine] = rule_info("RawLine", "(< /[^\\r\\n]*/ @Newline > | < .+ > @Eof) { text }")
-  Rules[:_SkipBlock] = rule_info("SkipBlock", "(HtmlBlock | (!\"\#\" !SetextBottom1 !SetextBottom2 !@BlankLine @RawLine)+ @BlankLine* | @BlankLine+ | @RawLine)")
-  Rules[:_ExtendedSpecialChar] = rule_info("ExtendedSpecialChar", "&{ notes? } \"^\"")
-  Rules[:_NoteReference] = rule_info("NoteReference", "&{ notes? } RawNoteReference:ref { note_for ref }")
-  Rules[:_RawNoteReference] = rule_info("RawNoteReference", "\"[^\" < (!@Newline !\"]\" .)+ > \"]\" { text }")
-  Rules[:_Note] = rule_info("Note", "&{ notes? } @NonindentSpace RawNoteReference:ref \":\" @Sp @StartList:a RawNoteBlock:i { a.concat i } (&Indent RawNoteBlock:i { a.concat i })* { @footnotes[ref] = paragraph a                    nil                 }")
-  Rules[:_InlineNote] = rule_info("InlineNote", "&{ notes? } \"^[\" @StartList:a (!\"]\" Inline:l { a << l })+ \"]\" { ref = [:inline, @note_order.length]                @footnotes[ref] = paragraph a                 note_for ref              }")
-  Rules[:_Notes] = rule_info("Notes", "(Note | SkipBlock)*")
-  Rules[:_RawNoteBlock] = rule_info("RawNoteBlock", "@StartList:a (!@BlankLine !RawNoteReference OptionallyIndentedLine:l { a << l })+ < @BlankLine* > { a << text } { a }")
-  Rules[:_CodeFence] = rule_info("CodeFence", "&{ github? } Ticks3 (@Sp StrChunk:format)? Spnl < ((!\"`\" Nonspacechar)+ | !Ticks3 /`+/ | Spacechar | @Newline)+ > Ticks3 @Sp @Newline* { verbatim = RDoc::Markup::Verbatim.new text               verbatim.format = format.intern if format.instance_of?(String)               verbatim             }")
-  Rules[:_Table] = rule_info("Table", "&{ github? } TableHead:header TableLine:line TableRow+:body { table = RDoc::Markup::Table.new(header, line, body) }")
-  Rules[:_TableHead] = rule_info("TableHead", "TableItem2+:items \"|\"? @Newline { items }")
-  Rules[:_TableRow] = rule_info("TableRow", "((TableItem:item1 TableItem2*:items { [item1, *items] }):row | TableItem2+:row) \"|\"? @Newline { row }")
-  Rules[:_TableItem2] = rule_info("TableItem2", "\"|\" TableItem")
-  Rules[:_TableItem] = rule_info("TableItem", "< /(?:\\\\.|[^|\\n])+/ > { text.strip.gsub(/\\\\(.)/, '\\1')  }")
-  Rules[:_TableLine] = rule_info("TableLine", "((TableAlign:align1 TableAlign2*:aligns {[align1, *aligns] }):line | TableAlign2+:line) \"|\"? @Newline { line }")
-  Rules[:_TableAlign2] = rule_info("TableAlign2", "\"|\" @Sp TableAlign")
-  Rules[:_TableAlign] = rule_info("TableAlign", "< /:?-+:?/ > @Sp {                 text.start_with?(\":\") ?                 (text.end_with?(\":\") ? :center : :left) :                 (text.end_with?(\":\") ? :right : nil)               }")
-  Rules[:_DefinitionList] = rule_info("DefinitionList", "&{ definition_lists? } DefinitionListItem+:list { RDoc::Markup::List.new :NOTE, *list.flatten }")
-  Rules[:_DefinitionListItem] = rule_info("DefinitionListItem", "DefinitionListLabel+:label DefinitionListDefinition+:defns { list_items = []                        list_items <<                          RDoc::Markup::ListItem.new(label, defns.shift)                         list_items.concat defns.map { |defn|                          RDoc::Markup::ListItem.new nil, defn                        } unless list_items.empty?                         list_items                      }")
-  Rules[:_DefinitionListLabel] = rule_info("DefinitionListLabel", "Inline:label @Sp @Newline { label }")
-  Rules[:_DefinitionListDefinition] = rule_info("DefinitionListDefinition", "@NonindentSpace \":\" @Space Inlines:a @BlankLine+ { paragraph a }")
-  # :startdoc:
-end
diff --git a/lib/rdoc/markdown/entities.rb b/lib/rdoc/markdown/entities.rb
deleted file mode 100644
index 265c2eb3f3..0000000000
--- a/lib/rdoc/markdown/entities.rb
+++ /dev/null
@@ -1,2131 +0,0 @@
-# frozen_string_literal: true
-##
-# HTML entity name map for RDoc::Markdown
-
-RDoc::Markdown::HTML_ENTITIES = {
-  "AElig" => [0x000C6],
-  "AMP" => [0x00026],
-  "Aacute" => [0x000C1],
-  "Abreve" => [0x00102],
-  "Acirc" => [0x000C2],
-  "Acy" => [0x00410],
-  "Afr" => [0x1D504],
-  "Agrave" => [0x000C0],
-  "Alpha" => [0x00391],
-  "Amacr" => [0x00100],
-  "And" => [0x02A53],
-  "Aogon" => [0x00104],
-  "Aopf" => [0x1D538],
-  "ApplyFunction" => [0x02061],
-  "Aring" => [0x000C5],
-  "Ascr" => [0x1D49C],
-  "Assign" => [0x02254],
-  "Atilde" => [0x000C3],
-  "Auml" => [0x000C4],
-  "Backslash" => [0x02216],
-  "Barv" => [0x02AE7],
-  "Barwed" => [0x02306],
-  "Bcy" => [0x00411],
-  "Because" => [0x02235],
-  "Bernoullis" => [0x0212C],
-  "Beta" => [0x00392],
-  "Bfr" => [0x1D505],
-  "Bopf" => [0x1D539],
-  "Breve" => [0x002D8],
-  "Bscr" => [0x0212C],
-  "Bumpeq" => [0x0224E],
-  "CHcy" => [0x00427],
-  "COPY" => [0x000A9],
-  "Cacute" => [0x00106],
-  "Cap" => [0x022D2],
-  "CapitalDifferentialD" => [0x02145],
-  "Cayleys" => [0x0212D],
-  "Ccaron" => [0x0010C],
-  "Ccedil" => [0x000C7],
-  "Ccirc" => [0x00108],
-  "Cconint" => [0x02230],
-  "Cdot" => [0x0010A],
-  "Cedilla" => [0x000B8],
-  "CenterDot" => [0x000B7],
-  "Cfr" => [0x0212D],
-  "Chi" => [0x003A7],
-  "CircleDot" => [0x02299],
-  "CircleMinus" => [0x02296],
-  "CirclePlus" => [0x02295],
-  "CircleTimes" => [0x02297],
-  "ClockwiseContourIntegral" => [0x02232],
-  "CloseCurlyDoubleQuote" => [0x0201D],
-  "CloseCurlyQuote" => [0x02019],
-  "Colon" => [0x02237],
-  "Colone" => [0x02A74],
-  "Congruent" => [0x02261],
-  "Conint" => [0x0222F],
-  "ContourIntegral" => [0x0222E],
-  "Copf" => [0x02102],
-  "Coproduct" => [0x02210],
-  "CounterClockwiseContourIntegral" => [0x02233],
-  "Cross" => [0x02A2F],
-  "Cscr" => [0x1D49E],
-  "Cup" => [0x022D3],
-  "CupCap" => [0x0224D],
-  "DD" => [0x02145],
-  "DDotrahd" => [0x02911],
-  "DJcy" => [0x00402],
-  "DScy" => [0x00405],
-  "DZcy" => [0x0040F],
-  "Dagger" => [0x02021],
-  "Darr" => [0x021A1],
-  "Dashv" => [0x02AE4],
-  "Dcaron" => [0x0010E],
-  "Dcy" => [0x00414],
-  "Del" => [0x02207],
-  "Delta" => [0x00394],
-  "Dfr" => [0x1D507],
-  "DiacriticalAcute" => [0x000B4],
-  "DiacriticalDot" => [0x002D9],
-  "DiacriticalDoubleAcute" => [0x002DD],
-  "DiacriticalGrave" => [0x00060],
-  "DiacriticalTilde" => [0x002DC],
-  "Diamond" => [0x022C4],
-  "DifferentialD" => [0x02146],
-  "Dopf" => [0x1D53B],
-  "Dot" => [0x000A8],
-  "DotDot" => [0x020DC],
-  "DotEqual" => [0x02250],
-  "DoubleContourIntegral" => [0x0222F],
-  "DoubleDot" => [0x000A8],
-  "DoubleDownArrow" => [0x021D3],
-  "DoubleLeftArrow" => [0x021D0],
-  "DoubleLeftRightArrow" => [0x021D4],
-  "DoubleLeftTee" => [0x02AE4],
-  "DoubleLongLeftArrow" => [0x027F8],
-  "DoubleLongLeftRightArrow" => [0x027FA],
-  "DoubleLongRightArrow" => [0x027F9],
-  "DoubleRightArrow" => [0x021D2],
-  "DoubleRightTee" => [0x022A8],
-  "DoubleUpArrow" => [0x021D1],
-  "DoubleUpDownArrow" => [0x021D5],
-  "DoubleVerticalBar" => [0x02225],
-  "DownArrow" => [0x02193],
-  "DownArrowBar" => [0x02913],
-  "DownArrowUpArrow" => [0x021F5],
-  "DownBreve" => [0x00311],
-  "DownLeftRightVector" => [0x02950],
-  "DownLeftTeeVector" => [0x0295E],
-  "DownLeftVector" => [0x021BD],
-  "DownLeftVectorBar" => [0x02956],
-  "DownRightTeeVector" => [0x0295F],
-  "DownRightVector" => [0x021C1],
-  "DownRightVectorBar" => [0x02957],
-  "DownTee" => [0x022A4],
-  "DownTeeArrow" => [0x021A7],
-  "Downarrow" => [0x021D3],
-  "Dscr" => [0x1D49F],
-  "Dstrok" => [0x00110],
-  "ENG" => [0x0014A],
-  "ETH" => [0x000D0],
-  "Eacute" => [0x000C9],
-  "Ecaron" => [0x0011A],
-  "Ecirc" => [0x000CA],
-  "Ecy" => [0x0042D],
-  "Edot" => [0x00116],
-  "Efr" => [0x1D508],
-  "Egrave" => [0x000C8],
-  "Element" => [0x02208],
-  "Emacr" => [0x00112],
-  "EmptySmallSquare" => [0x025FB],
-  "EmptyVerySmallSquare" => [0x025AB],
-  "Eogon" => [0x00118],
-  "Eopf" => [0x1D53C],
-  "Epsilon" => [0x00395],
-  "Equal" => [0x02A75],
-  "EqualTilde" => [0x02242],
-  "Equilibrium" => [0x021CC],
-  "Escr" => [0x02130],
-  "Esim" => [0x02A73],
-  "Eta" => [0x00397],
-  "Euml" => [0x000CB],
-  "Exists" => [0x02203],
-  "ExponentialE" => [0x02147],
-  "Fcy" => [0x00424],
-  "Ffr" => [0x1D509],
-  "FilledSmallSquare" => [0x025FC],
-  "FilledVerySmallSquare" => [0x025AA],
-  "Fopf" => [0x1D53D],
-  "ForAll" => [0x02200],
-  "Fouriertrf" => [0x02131],
-  "Fscr" => [0x02131],
-  "GJcy" => [0x00403],
-  "GT" => [0x0003E],
-  "Gamma" => [0x00393],
-  "Gammad" => [0x003DC],
-  "Gbreve" => [0x0011E],
-  "Gcedil" => [0x00122],
-  "Gcirc" => [0x0011C],
-  "Gcy" => [0x00413],
-  "Gdot" => [0x00120],
-  "Gfr" => [0x1D50A],
-  "Gg" => [0x022D9],
-  "Gopf" => [0x1D53E],
-  "GreaterEqual" => [0x02265],
-  "GreaterEqualLess" => [0x022DB],
-  "GreaterFullEqual" => [0x02267],
-  "GreaterGreater" => [0x02AA2],
-  "GreaterLess" => [0x02277],
-  "GreaterSlantEqual" => [0x02A7E],
-  "GreaterTilde" => [0x02273],
-  "Gscr" => [0x1D4A2],
-  "Gt" => [0x0226B],
-  "HARDcy" => [0x0042A],
-  "Hacek" => [0x002C7],
-  "Hat" => [0x0005E],
-  "Hcirc" => [0x00124],
-  "Hfr" => [0x0210C],
-  "HilbertSpace" => [0x0210B],
-  "Hopf" => [0x0210D],
-  "HorizontalLine" => [0x02500],
-  "Hscr" => [0x0210B],
-  "Hstrok" => [0x00126],
-  "HumpDownHump" => [0x0224E],
-  "HumpEqual" => [0x0224F],
-  "IEcy" => [0x00415],
-  "IJlig" => [0x00132],
-  "IOcy" => [0x00401],
-  "Iacute" => [0x000CD],
-  "Icirc" => [0x000CE],
-  "Icy" => [0x00418],
-  "Idot" => [0x00130],
-  "Ifr" => [0x02111],
-  "Igrave" => [0x000CC],
-  "Im" => [0x02111],
-  "Imacr" => [0x0012A],
-  "ImaginaryI" => [0x02148],
-  "Implies" => [0x021D2],
-  "Int" => [0x0222C],
-  "Integral" => [0x0222B],
-  "Intersection" => [0x022C2],
-  "InvisibleComma" => [0x02063],
-  "InvisibleTimes" => [0x02062],
-  "Iogon" => [0x0012E],
-  "Iopf" => [0x1D540],
-  "Iota" => [0x00399],
-  "Iscr" => [0x02110],
-  "Itilde" => [0x00128],
-  "Iukcy" => [0x00406],
-  "Iuml" => [0x000CF],
-  "Jcirc" => [0x00134],
-  "Jcy" => [0x00419],
-  "Jfr" => [0x1D50D],
-  "Jopf" => [0x1D541],
-  "Jscr" => [0x1D4A5],
-  "Jsercy" => [0x00408],
-  "Jukcy" => [0x00404],
-  "KHcy" => [0x00425],
-  "KJcy" => [0x0040C],
-  "Kappa" => [0x0039A],
-  "Kcedil" => [0x00136],
-  "Kcy" => [0x0041A],
-  "Kfr" => [0x1D50E],
-  "Kopf" => [0x1D542],
-  "Kscr" => [0x1D4A6],
-  "LJcy" => [0x00409],
-  "LT" => [0x0003C],
-  "Lacute" => [0x00139],
-  "Lambda" => [0x0039B],
-  "Lang" => [0x027EA],
-  "Laplacetrf" => [0x02112],
-  "Larr" => [0x0219E],
-  "Lcaron" => [0x0013D],
-  "Lcedil" => [0x0013B],
-  "Lcy" => [0x0041B],
-  "LeftAngleBracket" => [0x027E8],
-  "LeftArrow" => [0x02190],
-  "LeftArrowBar" => [0x021E4],
-  "LeftArrowRightArrow" => [0x021C6],
-  "LeftCeiling" => [0x02308],
-  "LeftDoubleBracket" => [0x027E6],
-  "LeftDownTeeVector" => [0x02961],
-  "LeftDownVector" => [0x021C3],
-  "LeftDownVectorBar" => [0x02959],
-  "LeftFloor" => [0x0230A],
-  "LeftRightArrow" => [0x02194],
-  "LeftRightVector" => [0x0294E],
-  "LeftTee" => [0x022A3],
-  "LeftTeeArrow" => [0x021A4],
-  "LeftTeeVector" => [0x0295A],
-  "LeftTriangle" => [0x022B2],
-  "LeftTriangleBar" => [0x029CF],
-  "LeftTriangleEqual" => [0x022B4],
-  "LeftUpDownVector" => [0x02951],
-  "LeftUpTeeVector" => [0x02960],
-  "LeftUpVector" => [0x021BF],
-  "LeftUpVectorBar" => [0x02958],
-  "LeftVector" => [0x021BC],
-  "LeftVectorBar" => [0x02952],
-  "Leftarrow" => [0x021D0],
-  "Leftrightarrow" => [0x021D4],
-  "LessEqualGreater" => [0x022DA],
-  "LessFullEqual" => [0x02266],
-  "LessGreater" => [0x02276],
-  "LessLess" => [0x02AA1],
-  "LessSlantEqual" => [0x02A7D],
-  "LessTilde" => [0x02272],
-  "Lfr" => [0x1D50F],
-  "Ll" => [0x022D8],
-  "Lleftarrow" => [0x021DA],
-  "Lmidot" => [0x0013F],
-  "LongLeftArrow" => [0x027F5],
-  "LongLeftRightArrow" => [0x027F7],
-  "LongRightArrow" => [0x027F6],
-  "Longleftarrow" => [0x027F8],
-  "Longleftrightarrow" => [0x027FA],
-  "Longrightarrow" => [0x027F9],
-  "Lopf" => [0x1D543],
-  "LowerLeftArrow" => [0x02199],
-  "LowerRightArrow" => [0x02198],
-  "Lscr" => [0x02112],
-  "Lsh" => [0x021B0],
-  "Lstrok" => [0x00141],
-  "Lt" => [0x0226A],
-  "Map" => [0x02905],
-  "Mcy" => [0x0041C],
-  "MediumSpace" => [0x0205F],
-  "Mellintrf" => [0x02133],
-  "Mfr" => [0x1D510],
-  "MinusPlus" => [0x02213],
-  "Mopf" => [0x1D544],
-  "Mscr" => [0x02133],
-  "Mu" => [0x0039C],
-  "NJcy" => [0x0040A],
-  "Nacute" => [0x00143],
-  "Ncaron" => [0x00147],
-  "Ncedil" => [0x00145],
-  "Ncy" => [0x0041D],
-  "NegativeMediumSpace" => [0x0200B],
-  "NegativeThickSpace" => [0x0200B],
-  "NegativeThinSpace" => [0x0200B],
-  "NegativeVeryThinSpace" => [0x0200B],
-  "NestedGreaterGreater" => [0x0226B],
-  "NestedLessLess" => [0x0226A],
-  "NewLine" => [0x0000A],
-  "Nfr" => [0x1D511],
-  "NoBreak" => [0x02060],
-  "NonBreakingSpace" => [0x000A0],
-  "Nopf" => [0x02115],
-  "Not" => [0x02AEC],
-  "NotCongruent" => [0x02262],
-  "NotCupCap" => [0x0226D],
-  "NotDoubleVerticalBar" => [0x02226],
-  "NotElement" => [0x02209],
-  "NotEqual" => [0x02260],
-  "NotEqualTilde" => [0x02242, 0x00338],
-  "NotExists" => [0x02204],
-  "NotGreater" => [0x0226F],
-  "NotGreaterEqual" => [0x02271],
-  "NotGreaterFullEqual" => [0x02267, 0x00338],
-  "NotGreaterGreater" => [0x0226B, 0x00338],
-  "NotGreaterLess" => [0x02279],
-  "NotGreaterSlantEqual" => [0x02A7E, 0x00338],
-  "NotGreaterTilde" => [0x02275],
-  "NotHumpDownHump" => [0x0224E, 0x00338],
-  "NotHumpEqual" => [0x0224F, 0x00338],
-  "NotLeftTriangle" => [0x022EA],
-  "NotLeftTriangleBar" => [0x029CF, 0x00338],
-  "NotLeftTriangleEqual" => [0x022EC],
-  "NotLess" => [0x0226E],
-  "NotLessEqual" => [0x02270],
-  "NotLessGreater" => [0x02278],
-  "NotLessLess" => [0x0226A, 0x00338],
-  "NotLessSlantEqual" => [0x02A7D, 0x00338],
-  "NotLessTilde" => [0x02274],
-  "NotNestedGreaterGreater" => [0x02AA2, 0x00338],
-  "NotNestedLessLess" => [0x02AA1, 0x00338],
-  "NotPrecedes" => [0x02280],
-  "NotPrecedesEqual" => [0x02AAF, 0x00338],
-  "NotPrecedesSlantEqual" => [0x022E0],
-  "NotReverseElement" => [0x0220C],
-  "NotRightTriangle" => [0x022EB],
-  "NotRightTriangleBar" => [0x029D0, 0x00338],
-  "NotRightTriangleEqual" => [0x022ED],
-  "NotSquareSubset" => [0x0228F, 0x00338],
-  "NotSquareSubsetEqual" => [0x022E2],
-  "NotSquareSuperset" => [0x02290, 0x00338],
-  "NotSquareSupersetEqual" => [0x022E3],
-  "NotSubset" => [0x02282, 0x020D2],
-  "NotSubsetEqual" => [0x02288],
-  "NotSucceeds" => [0x02281],
-  "NotSucceedsEqual" => [0x02AB0, 0x00338],
-  "NotSucceedsSlantEqual" => [0x022E1],
-  "NotSucceedsTilde" => [0x0227F, 0x00338],
-  "NotSuperset" => [0x02283, 0x020D2],
-  "NotSupersetEqual" => [0x02289],
-  "NotTilde" => [0x02241],
-  "NotTildeEqual" => [0x02244],
-  "NotTildeFullEqual" => [0x02247],
-  "NotTildeTilde" => [0x02249],
-  "NotVerticalBar" => [0x02224],
-  "Nscr" => [0x1D4A9],
-  "Ntilde" => [0x000D1],
-  "Nu" => [0x0039D],
-  "OElig" => [0x00152],
-  "Oacute" => [0x000D3],
-  "Ocirc" => [0x000D4],
-  "Ocy" => [0x0041E],
-  "Odblac" => [0x00150],
-  "Ofr" => [0x1D512],
-  "Ograve" => [0x000D2],
-  "Omacr" => [0x0014C],
-  "Omega" => [0x003A9],
-  "Omicron" => [0x0039F],
-  "Oopf" => [0x1D546],
-  "OpenCurlyDoubleQuote" => [0x0201C],
-  "OpenCurlyQuote" => [0x02018],
-  "Or" => [0x02A54],
-  "Oscr" => [0x1D4AA],
-  "Oslash" => [0x000D8],
-  "Otilde" => [0x000D5],
-  "Otimes" => [0x02A37],
-  "Ouml" => [0x000D6],
-  "OverBar" => [0x0203E],
-  "OverBrace" => [0x023DE],
-  "OverBracket" => [0x023B4],
-  "OverParenthesis" => [0x023DC],
-  "PartialD" => [0x02202],
-  "Pcy" => [0x0041F],
-  "Pfr" => [0x1D513],
-  "Phi" => [0x003A6],
-  "Pi" => [0x003A0],
-  "PlusMinus" => [0x000B1],
-  "Poincareplane" => [0x0210C],
-  "Popf" => [0x02119],
-  "Pr" => [0x02ABB],
-  "Precedes" => [0x0227A],
-  "PrecedesEqual" => [0x02AAF],
-  "PrecedesSlantEqual" => [0x0227C],
-  "PrecedesTilde" => [0x0227E],
-  "Prime" => [0x02033],
-  "Product" => [0x0220F],
-  "Proportion" => [0x02237],
-  "Proportional" => [0x0221D],
-  "Pscr" => [0x1D4AB],
-  "Psi" => [0x003A8],
-  "QUOT" => [0x00022],
-  "Qfr" => [0x1D514],
-  "Qopf" => [0x0211A],
-  "Qscr" => [0x1D4AC],
-  "RBarr" => [0x02910],
-  "REG" => [0x000AE],
-  "Racute" => [0x00154],
-  "Rang" => [0x027EB],
-  "Rarr" => [0x021A0],
-  "Rarrtl" => [0x02916],
-  "Rcaron" => [0x00158],
-  "Rcedil" => [0x00156],
-  "Rcy" => [0x00420],
-  "Re" => [0x0211C],
-  "ReverseElement" => [0x0220B],
-  "ReverseEquilibrium" => [0x021CB],
-  "ReverseUpEquilibrium" => [0x0296F],
-  "Rfr" => [0x0211C],
-  "Rho" => [0x003A1],
-  "RightAngleBracket" => [0x027E9],
-  "RightArrow" => [0x02192],
-  "RightArrowBar" => [0x021E5],
-  "RightArrowLeftArrow" => [0x021C4],
-  "RightCeiling" => [0x02309],
-  "RightDoubleBracket" => [0x027E7],
-  "RightDownTeeVector" => [0x0295D],
-  "RightDownVector" => [0x021C2],
-  "RightDownVectorBar" => [0x02955],
-  "RightFloor" => [0x0230B],
-  "RightTee" => [0x022A2],
-  "RightTeeArrow" => [0x021A6],
-  "RightTeeVector" => [0x0295B],
-  "RightTriangle" => [0x022B3],
-  "RightTriangleBar" => [0x029D0],
-  "RightTriangleEqual" => [0x022B5],
-  "RightUpDownVector" => [0x0294F],
-  "RightUpTeeVector" => [0x0295C],
-  "RightUpVector" => [0x021BE],
-  "RightUpVectorBar" => [0x02954],
-  "RightVector" => [0x021C0],
-  "RightVectorBar" => [0x02953],
-  "Rightarrow" => [0x021D2],
-  "Ropf" => [0x0211D],
-  "RoundImplies" => [0x02970],
-  "Rrightarrow" => [0x021DB],
-  "Rscr" => [0x0211B],
-  "Rsh" => [0x021B1],
-  "RuleDelayed" => [0x029F4],
-  "SHCHcy" => [0x00429],
-  "SHcy" => [0x00428],
-  "SOFTcy" => [0x0042C],
-  "Sacute" => [0x0015A],
-  "Sc" => [0x02ABC],
-  "Scaron" => [0x00160],
-  "Scedil" => [0x0015E],
-  "Scirc" => [0x0015C],
-  "Scy" => [0x00421],
-  "Sfr" => [0x1D516],
-  "ShortDownArrow" => [0x02193],
-  "ShortLeftArrow" => [0x02190],
-  "ShortRightArrow" => [0x02192],
-  "ShortUpArrow" => [0x02191],
-  "Sigma" => [0x003A3],
-  "SmallCircle" => [0x02218],
-  "Sopf" => [0x1D54A],
-  "Sqrt" => [0x0221A],
-  "Square" => [0x025A1],
-  "SquareIntersection" => [0x02293],
-  "SquareSubset" => [0x0228F],
-  "SquareSubsetEqual" => [0x02291],
-  "SquareSuperset" => [0x02290],
-  "SquareSupersetEqual" => [0x02292],
-  "SquareUnion" => [0x02294],
-  "Sscr" => [0x1D4AE],
-  "Star" => [0x022C6],
-  "Sub" => [0x022D0],
-  "Subset" => [0x022D0],
-  "SubsetEqual" => [0x02286],
-  "Succeeds" => [0x0227B],
-  "SucceedsEqual" => [0x02AB0],
-  "SucceedsSlantEqual" => [0x0227D],
-  "SucceedsTilde" => [0x0227F],
-  "SuchThat" => [0x0220B],
-  "Sum" => [0x02211],
-  "Sup" => [0x022D1],
-  "Superset" => [0x02283],
-  "SupersetEqual" => [0x02287],
-  "Supset" => [0x022D1],
-  "THORN" => [0x000DE],
-  "TRADE" => [0x02122],
-  "TSHcy" => [0x0040B],
-  "TScy" => [0x00426],
-  "Tab" => [0x00009],
-  "Tau" => [0x003A4],
-  "Tcaron" => [0x00164],
-  "Tcedil" => [0x00162],
-  "Tcy" => [0x00422],
-  "Tfr" => [0x1D517],
-  "Therefore" => [0x02234],
-  "Theta" => [0x00398],
-  "ThickSpace" => [0x0205F, 0x0200A],
-  "ThinSpace" => [0x02009],
-  "Tilde" => [0x0223C],
-  "TildeEqual" => [0x02243],
-  "TildeFullEqual" => [0x02245],
-  "TildeTilde" => [0x02248],
-  "Topf" => [0x1D54B],
-  "TripleDot" => [0x020DB],
-  "Tscr" => [0x1D4AF],
-  "Tstrok" => [0x00166],
-  "Uacute" => [0x000DA],
-  "Uarr" => [0x0219F],
-  "Uarrocir" => [0x02949],
-  "Ubrcy" => [0x0040E],
-  "Ubreve" => [0x0016C],
-  "Ucirc" => [0x000DB],
-  "Ucy" => [0x00423],
-  "Udblac" => [0x00170],
-  "Ufr" => [0x1D518],
-  "Ugrave" => [0x000D9],
-  "Umacr" => [0x0016A],
-  "UnderBar" => [0x0005F],
-  "UnderBrace" => [0x023DF],
-  "UnderBracket" => [0x023B5],
-  "UnderParenthesis" => [0x023DD],
-  "Union" => [0x022C3],
-  "UnionPlus" => [0x0228E],
-  "Uogon" => [0x00172],
-  "Uopf" => [0x1D54C],
-  "UpArrow" => [0x02191],
-  "UpArrowBar" => [0x02912],
-  "UpArrowDownArrow" => [0x021C5],
-  "UpDownArrow" => [0x02195],
-  "UpEquilibrium" => [0x0296E],
-  "UpTee" => [0x022A5],
-  "UpTeeArrow" => [0x021A5],
-  "Uparrow" => [0x021D1],
-  "Updownarrow" => [0x021D5],
-  "UpperLeftArrow" => [0x02196],
-  "UpperRightArrow" => [0x02197],
-  "Upsi" => [0x003D2],
-  "Upsilon" => [0x003A5],
-  "Uring" => [0x0016E],
-  "Uscr" => [0x1D4B0],
-  "Utilde" => [0x00168],
-  "Uuml" => [0x000DC],
-  "VDash" => [0x022AB],
-  "Vbar" => [0x02AEB],
-  "Vcy" => [0x00412],
-  "Vdash" => [0x022A9],
-  "Vdashl" => [0x02AE6],
-  "Vee" => [0x022C1],
-  "Verbar" => [0x02016],
-  "Vert" => [0x02016],
-  "VerticalBar" => [0x02223],
-  "VerticalLine" => [0x0007C],
-  "VerticalSeparator" => [0x02758],
-  "VerticalTilde" => [0x02240],
-  "VeryThinSpace" => [0x0200A],
-  "Vfr" => [0x1D519],
-  "Vopf" => [0x1D54D],
-  "Vscr" => [0x1D4B1],
-  "Vvdash" => [0x022AA],
-  "Wcirc" => [0x00174],
-  "Wedge" => [0x022C0],
-  "Wfr" => [0x1D51A],
-  "Wopf" => [0x1D54E],
-  "Wscr" => [0x1D4B2],
-  "Xfr" => [0x1D51B],
-  "Xi" => [0x0039E],
-  "Xopf" => [0x1D54F],
-  "Xscr" => [0x1D4B3],
-  "YAcy" => [0x0042F],
-  "YIcy" => [0x00407],
-  "YUcy" => [0x0042E],
-  "Yacute" => [0x000DD],
-  "Ycirc" => [0x00176],
-  "Ycy" => [0x0042B],
-  "Yfr" => [0x1D51C],
-  "Yopf" => [0x1D550],
-  "Yscr" => [0x1D4B4],
-  "Yuml" => [0x00178],
-  "ZHcy" => [0x00416],
-  "Zacute" => [0x00179],
-  "Zcaron" => [0x0017D],
-  "Zcy" => [0x00417],
-  "Zdot" => [0x0017B],
-  "ZeroWidthSpace" => [0x0200B],
-  "Zeta" => [0x00396],
-  "Zfr" => [0x02128],
-  "Zopf" => [0x02124],
-  "Zscr" => [0x1D4B5],
-  "aacute" => [0x000E1],
-  "abreve" => [0x00103],
-  "ac" => [0x0223E],
-  "acE" => [0x0223E, 0x00333],
-  "acd" => [0x0223F],
-  "acirc" => [0x000E2],
-  "acute" => [0x000B4],
-  "acy" => [0x00430],
-  "aelig" => [0x000E6],
-  "af" => [0x02061],
-  "afr" => [0x1D51E],
-  "agrave" => [0x000E0],
-  "alefsym" => [0x02135],
-  "aleph" => [0x02135],
-  "alpha" => [0x003B1],
-  "amacr" => [0x00101],
-  "amalg" => [0x02A3F],
-  "amp" => [0x00026],
-  "and" => [0x02227],
-  "andand" => [0x02A55],
-  "andd" => [0x02A5C],
-  "andslope" => [0x02A58],
-  "andv" => [0x02A5A],
-  "ang" => [0x02220],
-  "ange" => [0x029A4],
-  "angle" => [0x02220],
-  "angmsd" => [0x02221],
-  "angmsdaa" => [0x029A8],
-  "angmsdab" => [0x029A9],
-  "angmsdac" => [0x029AA],
-  "angmsdad" => [0x029AB],
-  "angmsdae" => [0x029AC],
-  "angmsdaf" => [0x029AD],
-  "angmsdag" => [0x029AE],
-  "angmsdah" => [0x029AF],
-  "angrt" => [0x0221F],
-  "angrtvb" => [0x022BE],
-  "angrtvbd" => [0x0299D],
-  "angsph" => [0x02222],
-  "angst" => [0x000C5],
-  "angzarr" => [0x0237C],
-  "aogon" => [0x00105],
-  "aopf" => [0x1D552],
-  "ap" => [0x02248],
-  "apE" => [0x02A70],
-  "apacir" => [0x02A6F],
-  "ape" => [0x0224A],
-  "apid" => [0x0224B],
-  "apos" => [0x00027],
-  "approx" => [0x02248],
-  "approxeq" => [0x0224A],
-  "aring" => [0x000E5],
-  "ascr" => [0x1D4B6],
-  "ast" => [0x0002A],
-  "asymp" => [0x02248],
-  "asympeq" => [0x0224D],
-  "atilde" => [0x000E3],
-  "auml" => [0x000E4],
-  "awconint" => [0x02233],
-  "awint" => [0x02A11],
-  "bNot" => [0x02AED],
-  "backcong" => [0x0224C],
-  "backepsilon" => [0x003F6],
-  "backprime" => [0x02035],
-  "backsim" => [0x0223D],
-  "backsimeq" => [0x022CD],
-  "barvee" => [0x022BD],
-  "barwed" => [0x02305],
-  "barwedge" => [0x02305],
-  "bbrk" => [0x023B5],
-  "bbrktbrk" => [0x023B6],
-  "bcong" => [0x0224C],
-  "bcy" => [0x00431],
-  "bdquo" => [0x0201E],
-  "becaus" => [0x02235],
-  "because" => [0x02235],
-  "bemptyv" => [0x029B0],
-  "bepsi" => [0x003F6],
-  "bernou" => [0x0212C],
-  "beta" => [0x003B2],
-  "beth" => [0x02136],
-  "between" => [0x0226C],
-  "bfr" => [0x1D51F],
-  "bigcap" => [0x022C2],
-  "bigcirc" => [0x025EF],
-  "bigcup" => [0x022C3],
-  "bigodot" => [0x02A00],
-  "bigoplus" => [0x02A01],
-  "bigotimes" => [0x02A02],
-  "bigsqcup" => [0x02A06],
-  "bigstar" => [0x02605],
-  "bigtriangledown" => [0x025BD],
-  "bigtriangleup" => [0x025B3],
-  "biguplus" => [0x02A04],
-  "bigvee" => [0x022C1],
-  "bigwedge" => [0x022C0],
-  "bkarow" => [0x0290D],
-  "blacklozenge" => [0x029EB],
-  "blacksquare" => [0x025AA],
-  "blacktriangle" => [0x025B4],
-  "blacktriangledown" => [0x025BE],
-  "blacktriangleleft" => [0x025C2],
-  "blacktriangleright" => [0x025B8],
-  "blank" => [0x02423],
-  "blk12" => [0x02592],
-  "blk14" => [0x02591],
-  "blk34" => [0x02593],
-  "block" => [0x02588],
-  "bne" => [0x0003D, 0x020E5],
-  "bnequiv" => [0x02261, 0x020E5],
-  "bnot" => [0x02310],
-  "bopf" => [0x1D553],
-  "bot" => [0x022A5],
-  "bottom" => [0x022A5],
-  "bowtie" => [0x022C8],
-  "boxDL" => [0x02557],
-  "boxDR" => [0x02554],
-  "boxDl" => [0x02556],
-  "boxDr" => [0x02553],
-  "boxH" => [0x02550],
-  "boxHD" => [0x02566],
-  "boxHU" => [0x02569],
-  "boxHd" => [0x02564],
-  "boxHu" => [0x02567],
-  "boxUL" => [0x0255D],
-  "boxUR" => [0x0255A],
-  "boxUl" => [0x0255C],
-  "boxUr" => [0x02559],
-  "boxV" => [0x02551],
-  "boxVH" => [0x0256C],
-  "boxVL" => [0x02563],
-  "boxVR" => [0x02560],
-  "boxVh" => [0x0256B],
-  "boxVl" => [0x02562],
-  "boxVr" => [0x0255F],
-  "boxbox" => [0x029C9],
-  "boxdL" => [0x02555],
-  "boxdR" => [0x02552],
-  "boxdl" => [0x02510],
-  "boxdr" => [0x0250C],
-  "boxh" => [0x02500],
-  "boxhD" => [0x02565],
-  "boxhU" => [0x02568],
-  "boxhd" => [0x0252C],
-  "boxhu" => [0x02534],
-  "boxminus" => [0x0229F],
-  "boxplus" => [0x0229E],
-  "boxtimes" => [0x022A0],
-  "boxuL" => [0x0255B],
-  "boxuR" => [0x02558],
-  "boxul" => [0x02518],
-  "boxur" => [0x02514],
-  "boxv" => [0x02502],
-  "boxvH" => [0x0256A],
-  "boxvL" => [0x02561],
-  "boxvR" => [0x0255E],
-  "boxvh" => [0x0253C],
-  "boxvl" => [0x02524],
-  "boxvr" => [0x0251C],
-  "bprime" => [0x02035],
-  "breve" => [0x002D8],
-  "brvbar" => [0x000A6],
-  "bscr" => [0x1D4B7],
-  "bsemi" => [0x0204F],
-  "bsim" => [0x0223D],
-  "bsime" => [0x022CD],
-  "bsol" => [0x0005C],
-  "bsolb" => [0x029C5],
-  "bsolhsub" => [0x027C8],
-  "bull" => [0x02022],
-  "bullet" => [0x02022],
-  "bump" => [0x0224E],
-  "bumpE" => [0x02AAE],
-  "bumpe" => [0x0224F],
-  "bumpeq" => [0x0224F],
-  "cacute" => [0x00107],
-  "cap" => [0x02229],
-  "capand" => [0x02A44],
-  "capbrcup" => [0x02A49],
-  "capcap" => [0x02A4B],
-  "capcup" => [0x02A47],
-  "capdot" => [0x02A40],
-  "caps" => [0x02229, 0x0FE00],
-  "caret" => [0x02041],
-  "caron" => [0x002C7],
-  "ccaps" => [0x02A4D],
-  "ccaron" => [0x0010D],
-  "ccedil" => [0x000E7],
-  "ccirc" => [0x00109],
-  "ccups" => [0x02A4C],
-  "ccupssm" => [0x02A50],
-  "cdot" => [0x0010B],
-  "cedil" => [0x000B8],
-  "cemptyv" => [0x029B2],
-  "cent" => [0x000A2],
-  "centerdot" => [0x000B7],
-  "cfr" => [0x1D520],
-  "chcy" => [0x00447],
-  "check" => [0x02713],
-  "checkmark" => [0x02713],
-  "chi" => [0x003C7],
-  "cir" => [0x025CB],
-  "cirE" => [0x029C3],
-  "circ" => [0x002C6],
-  "circeq" => [0x02257],
-  "circlearrowleft" => [0x021BA],
-  "circlearrowright" => [0x021BB],
-  "circledR" => [0x000AE],
-  "circledS" => [0x024C8],
-  "circledast" => [0x0229B],
-  "circledcirc" => [0x0229A],
-  "circleddash" => [0x0229D],
-  "cire" => [0x02257],
-  "cirfnint" => [0x02A10],
-  "cirmid" => [0x02AEF],
-  "cirscir" => [0x029C2],
-  "clubs" => [0x02663],
-  "clubsuit" => [0x02663],
-  "colon" => [0x0003A],
-  "colone" => [0x02254],
-  "coloneq" => [0x02254],
-  "comma" => [0x0002C],
-  "commat" => [0x00040],
-  "comp" => [0x02201],
-  "compfn" => [0x02218],
-  "complement" => [0x02201],
-  "complexes" => [0x02102],
-  "cong" => [0x02245],
-  "congdot" => [0x02A6D],
-  "conint" => [0x0222E],
-  "copf" => [0x1D554],
-  "coprod" => [0x02210],
-  "copy" => [0x000A9],
-  "copysr" => [0x02117],
-  "crarr" => [0x021B5],
-  "cross" => [0x02717],
-  "cscr" => [0x1D4B8],
-  "csub" => [0x02ACF],
-  "csube" => [0x02AD1],
-  "csup" => [0x02AD0],
-  "csupe" => [0x02AD2],
-  "ctdot" => [0x022EF],
-  "cudarrl" => [0x02938],
-  "cudarrr" => [0x02935],
-  "cuepr" => [0x022DE],
-  "cuesc" => [0x022DF],
-  "cularr" => [0x021B6],
-  "cularrp" => [0x0293D],
-  "cup" => [0x0222A],
-  "cupbrcap" => [0x02A48],
-  "cupcap" => [0x02A46],
-  "cupcup" => [0x02A4A],
-  "cupdot" => [0x0228D],
-  "cupor" => [0x02A45],
-  "cups" => [0x0222A, 0x0FE00],
-  "curarr" => [0x021B7],
-  "curarrm" => [0x0293C],
-  "curlyeqprec" => [0x022DE],
-  "curlyeqsucc" => [0x022DF],
-  "curlyvee" => [0x022CE],
-  "curlywedge" => [0x022CF],
-  "curren" => [0x000A4],
-  "curvearrowleft" => [0x021B6],
-  "curvearrowright" => [0x021B7],
-  "cuvee" => [0x022CE],
-  "cuwed" => [0x022CF],
-  "cwconint" => [0x02232],
-  "cwint" => [0x02231],
-  "cylcty" => [0x0232D],
-  "dArr" => [0x021D3],
-  "dHar" => [0x02965],
-  "dagger" => [0x02020],
-  "daleth" => [0x02138],
-  "darr" => [0x02193],
-  "dash" => [0x02010],
-  "dashv" => [0x022A3],
-  "dbkarow" => [0x0290F],
-  "dblac" => [0x002DD],
-  "dcaron" => [0x0010F],
-  "dcy" => [0x00434],
-  "dd" => [0x02146],
-  "ddagger" => [0x02021],
-  "ddarr" => [0x021CA],
-  "ddotseq" => [0x02A77],
-  "deg" => [0x000B0],
-  "delta" => [0x003B4],
-  "demptyv" => [0x029B1],
-  "dfisht" => [0x0297F],
-  "dfr" => [0x1D521],
-  "dharl" => [0x021C3],
-  "dharr" => [0x021C2],
-  "diam" => [0x022C4],
-  "diamond" => [0x022C4],
-  "diamondsuit" => [0x02666],
-  "diams" => [0x02666],
-  "die" => [0x000A8],
-  "digamma" => [0x003DD],
-  "disin" => [0x022F2],
-  "div" => [0x000F7],
-  "divide" => [0x000F7],
-  "divideontimes" => [0x022C7],
-  "divonx" => [0x022C7],
-  "djcy" => [0x00452],
-  "dlcorn" => [0x0231E],
-  "dlcrop" => [0x0230D],
-  "dollar" => [0x00024],
-  "dopf" => [0x1D555],
-  "dot" => [0x002D9],
-  "doteq" => [0x02250],
-  "doteqdot" => [0x02251],
-  "dotminus" => [0x02238],
-  "dotplus" => [0x02214],
-  "dotsquare" => [0x022A1],
-  "doublebarwedge" => [0x02306],
-  "downarrow" => [0x02193],
-  "downdownarrows" => [0x021CA],
-  "downharpoonleft" => [0x021C3],
-  "downharpoonright" => [0x021C2],
-  "drbkarow" => [0x02910],
-  "drcorn" => [0x0231F],
-  "drcrop" => [0x0230C],
-  "dscr" => [0x1D4B9],
-  "dscy" => [0x00455],
-  "dsol" => [0x029F6],
-  "dstrok" => [0x00111],
-  "dtdot" => [0x022F1],
-  "dtri" => [0x025BF],
-  "dtrif" => [0x025BE],
-  "duarr" => [0x021F5],
-  "duhar" => [0x0296F],
-  "dwangle" => [0x029A6],
-  "dzcy" => [0x0045F],
-  "dzigrarr" => [0x027FF],
-  "eDDot" => [0x02A77],
-  "eDot" => [0x02251],
-  "eacute" => [0x000E9],
-  "easter" => [0x02A6E],
-  "ecaron" => [0x0011B],
-  "ecir" => [0x02256],
-  "ecirc" => [0x000EA],
-  "ecolon" => [0x02255],
-  "ecy" => [0x0044D],
-  "edot" => [0x00117],
-  "ee" => [0x02147],
-  "efDot" => [0x02252],
-  "efr" => [0x1D522],
-  "eg" => [0x02A9A],
-  "egrave" => [0x000E8],
-  "egs" => [0x02A96],
-  "egsdot" => [0x02A98],
-  "el" => [0x02A99],
-  "elinters" => [0x023E7],
-  "ell" => [0x02113],
-  "els" => [0x02A95],
-  "elsdot" => [0x02A97],
-  "emacr" => [0x00113],
-  "empty" => [0x02205],
-  "emptyset" => [0x02205],
-  "emptyv" => [0x02205],
-  "emsp" => [0x02003],
-  "emsp13" => [0x02004],
-  "emsp14" => [0x02005],
-  "eng" => [0x0014B],
-  "ensp" => [0x02002],
-  "eogon" => [0x00119],
-  "eopf" => [0x1D556],
-  "epar" => [0x022D5],
-  "eparsl" => [0x029E3],
-  "eplus" => [0x02A71],
-  "epsi" => [0x003B5],
-  "epsilon" => [0x003B5],
-  "epsiv" => [0x003F5],
-  "eqcirc" => [0x02256],
-  "eqcolon" => [0x02255],
-  "eqsim" => [0x02242],
-  "eqslantgtr" => [0x02A96],
-  "eqslantless" => [0x02A95],
-  "equals" => [0x0003D],
-  "equest" => [0x0225F],
-  "equiv" => [0x02261],
-  "equivDD" => [0x02A78],
-  "eqvparsl" => [0x029E5],
-  "erDot" => [0x02253],
-  "erarr" => [0x02971],
-  "escr" => [0x0212F],
-  "esdot" => [0x02250],
-  "esim" => [0x02242],
-  "eta" => [0x003B7],
-  "eth" => [0x000F0],
-  "euml" => [0x000EB],
-  "euro" => [0x020AC],
-  "excl" => [0x00021],
-  "exist" => [0x02203],
-  "expectation" => [0x02130],
-  "exponentiale" => [0x02147],
-  "fallingdotseq" => [0x02252],
-  "fcy" => [0x00444],
-  "female" => [0x02640],
-  "ffilig" => [0x0FB03],
-  "fflig" => [0x0FB00],
-  "ffllig" => [0x0FB04],
-  "ffr" => [0x1D523],
-  "filig" => [0x0FB01],
-  "fjlig" => [0x00066, 0x0006A],
-  "flat" => [0x0266D],
-  "fllig" => [0x0FB02],
-  "fltns" => [0x025B1],
-  "fnof" => [0x00192],
-  "fopf" => [0x1D557],
-  "forall" => [0x02200],
-  "fork" => [0x022D4],
-  "forkv" => [0x02AD9],
-  "fpartint" => [0x02A0D],
-  "frac12" => [0x000BD],
-  "frac13" => [0x02153],
-  "frac14" => [0x000BC],
-  "frac15" => [0x02155],
-  "frac16" => [0x02159],
-  "frac18" => [0x0215B],
-  "frac23" => [0x02154],
-  "frac25" => [0x02156],
-  "frac34" => [0x000BE],
-  "frac35" => [0x02157],
-  "frac38" => [0x0215C],
-  "frac45" => [0x02158],
-  "frac56" => [0x0215A],
-  "frac58" => [0x0215D],
-  "frac78" => [0x0215E],
-  "frasl" => [0x02044],
-  "frown" => [0x02322],
-  "fscr" => [0x1D4BB],
-  "gE" => [0x02267],
-  "gEl" => [0x02A8C],
-  "gacute" => [0x001F5],
-  "gamma" => [0x003B3],
-  "gammad" => [0x003DD],
-  "gap" => [0x02A86],
-  "gbreve" => [0x0011F],
-  "gcirc" => [0x0011D],
-  "gcy" => [0x00433],
-  "gdot" => [0x00121],
-  "ge" => [0x02265],
-  "gel" => [0x022DB],
-  "geq" => [0x02265],
-  "geqq" => [0x02267],
-  "geqslant" => [0x02A7E],
-  "ges" => [0x02A7E],
-  "gescc" => [0x02AA9],
-  "gesdot" => [0x02A80],
-  "gesdoto" => [0x02A82],
-  "gesdotol" => [0x02A84],
-  "gesl" => [0x022DB, 0x0FE00],
-  "gesles" => [0x02A94],
-  "gfr" => [0x1D524],
-  "gg" => [0x0226B],
-  "ggg" => [0x022D9],
-  "gimel" => [0x02137],
-  "gjcy" => [0x00453],
-  "gl" => [0x02277],
-  "glE" => [0x02A92],
-  "gla" => [0x02AA5],
-  "glj" => [0x02AA4],
-  "gnE" => [0x02269],
-  "gnap" => [0x02A8A],
-  "gnapprox" => [0x02A8A],
-  "gne" => [0x02A88],
-  "gneq" => [0x02A88],
-  "gneqq" => [0x02269],
-  "gnsim" => [0x022E7],
-  "gopf" => [0x1D558],
-  "grave" => [0x00060],
-  "gscr" => [0x0210A],
-  "gsim" => [0x02273],
-  "gsime" => [0x02A8E],
-  "gsiml" => [0x02A90],
-  "gt" => [0x0003E],
-  "gtcc" => [0x02AA7],
-  "gtcir" => [0x02A7A],
-  "gtdot" => [0x022D7],
-  "gtlPar" => [0x02995],
-  "gtquest" => [0x02A7C],
-  "gtrapprox" => [0x02A86],
-  "gtrarr" => [0x02978],
-  "gtrdot" => [0x022D7],
-  "gtreqless" => [0x022DB],
-  "gtreqqless" => [0x02A8C],
-  "gtrless" => [0x02277],
-  "gtrsim" => [0x02273],
-  "gvertneqq" => [0x02269, 0x0FE00],
-  "gvnE" => [0x02269, 0x0FE00],
-  "hArr" => [0x021D4],
-  "hairsp" => [0x0200A],
-  "half" => [0x000BD],
-  "hamilt" => [0x0210B],
-  "hardcy" => [0x0044A],
-  "harr" => [0x02194],
-  "harrcir" => [0x02948],
-  "harrw" => [0x021AD],
-  "hbar" => [0x0210F],
-  "hcirc" => [0x00125],
-  "hearts" => [0x02665],
-  "heartsuit" => [0x02665],
-  "hellip" => [0x02026],
-  "hercon" => [0x022B9],
-  "hfr" => [0x1D525],
-  "hksearow" => [0x02925],
-  "hkswarow" => [0x02926],
-  "hoarr" => [0x021FF],
-  "homtht" => [0x0223B],
-  "hookleftarrow" => [0x021A9],
-  "hookrightarrow" => [0x021AA],
-  "hopf" => [0x1D559],
-  "horbar" => [0x02015],
-  "hscr" => [0x1D4BD],
-  "hslash" => [0x0210F],
-  "hstrok" => [0x00127],
-  "hybull" => [0x02043],
-  "hyphen" => [0x02010],
-  "iacute" => [0x000ED],
-  "ic" => [0x02063],
-  "icirc" => [0x000EE],
-  "icy" => [0x00438],
-  "iecy" => [0x00435],
-  "iexcl" => [0x000A1],
-  "iff" => [0x021D4],
-  "ifr" => [0x1D526],
-  "igrave" => [0x000EC],
-  "ii" => [0x02148],
-  "iiiint" => [0x02A0C],
-  "iiint" => [0x0222D],
-  "iinfin" => [0x029DC],
-  "iiota" => [0x02129],
-  "ijlig" => [0x00133],
-  "imacr" => [0x0012B],
-  "image" => [0x02111],
-  "imagline" => [0x02110],
-  "imagpart" => [0x02111],
-  "imath" => [0x00131],
-  "imof" => [0x022B7],
-  "imped" => [0x001B5],
-  "in" => [0x02208],
-  "incare" => [0x02105],
-  "infin" => [0x0221E],
-  "infintie" => [0x029DD],
-  "inodot" => [0x00131],
-  "int" => [0x0222B],
-  "intcal" => [0x022BA],
-  "integers" => [0x02124],
-  "intercal" => [0x022BA],
-  "intlarhk" => [0x02A17],
-  "intprod" => [0x02A3C],
-  "iocy" => [0x00451],
-  "iogon" => [0x0012F],
-  "iopf" => [0x1D55A],
-  "iota" => [0x003B9],
-  "iprod" => [0x02A3C],
-  "iquest" => [0x000BF],
-  "iscr" => [0x1D4BE],
-  "isin" => [0x02208],
-  "isinE" => [0x022F9],
-  "isindot" => [0x022F5],
-  "isins" => [0x022F4],
-  "isinsv" => [0x022F3],
-  "isinv" => [0x02208],
-  "it" => [0x02062],
-  "itilde" => [0x00129],
-  "iukcy" => [0x00456],
-  "iuml" => [0x000EF],
-  "jcirc" => [0x00135],
-  "jcy" => [0x00439],
-  "jfr" => [0x1D527],
-  "jmath" => [0x00237],
-  "jopf" => [0x1D55B],
-  "jscr" => [0x1D4BF],
-  "jsercy" => [0x00458],
-  "jukcy" => [0x00454],
-  "kappa" => [0x003BA],
-  "kappav" => [0x003F0],
-  "kcedil" => [0x00137],
-  "kcy" => [0x0043A],
-  "kfr" => [0x1D528],
-  "kgreen" => [0x00138],
-  "khcy" => [0x00445],
-  "kjcy" => [0x0045C],
-  "kopf" => [0x1D55C],
-  "kscr" => [0x1D4C0],
-  "lAarr" => [0x021DA],
-  "lArr" => [0x021D0],
-  "lAtail" => [0x0291B],
-  "lBarr" => [0x0290E],
-  "lE" => [0x02266],
-  "lEg" => [0x02A8B],
-  "lHar" => [0x02962],
-  "lacute" => [0x0013A],
-  "laemptyv" => [0x029B4],
-  "lagran" => [0x02112],
-  "lambda" => [0x003BB],
-  "lang" => [0x027E8],
-  "langd" => [0x02991],
-  "langle" => [0x027E8],
-  "lap" => [0x02A85],
-  "laquo" => [0x000AB],
-  "larr" => [0x02190],
-  "larrb" => [0x021E4],
-  "larrbfs" => [0x0291F],
-  "larrfs" => [0x0291D],
-  "larrhk" => [0x021A9],
-  "larrlp" => [0x021AB],
-  "larrpl" => [0x02939],
-  "larrsim" => [0x02973],
-  "larrtl" => [0x021A2],
-  "lat" => [0x02AAB],
-  "latail" => [0x02919],
-  "late" => [0x02AAD],
-  "lates" => [0x02AAD, 0x0FE00],
-  "lbarr" => [0x0290C],
-  "lbbrk" => [0x02772],
-  "lbrace" => [0x0007B],
-  "lbrack" => [0x0005B],
-  "lbrke" => [0x0298B],
-  "lbrksld" => [0x0298F],
-  "lbrkslu" => [0x0298D],
-  "lcaron" => [0x0013E],
-  "lcedil" => [0x0013C],
-  "lceil" => [0x02308],
-  "lcub" => [0x0007B],
-  "lcy" => [0x0043B],
-  "ldca" => [0x02936],
-  "ldquo" => [0x0201C],
-  "ldquor" => [0x0201E],
-  "ldrdhar" => [0x02967],
-  "ldrushar" => [0x0294B],
-  "ldsh" => [0x021B2],
-  "le" => [0x02264],
-  "leftarrow" => [0x02190],
-  "leftarrowtail" => [0x021A2],
-  "leftharpoondown" => [0x021BD],
-  "leftharpoonup" => [0x021BC],
-  "leftleftarrows" => [0x021C7],
-  "leftrightarrow" => [0x02194],
-  "leftrightarrows" => [0x021C6],
-  "leftrightharpoons" => [0x021CB],
-  "leftrightsquigarrow" => [0x021AD],
-  "leftthreetimes" => [0x022CB],
-  "leg" => [0x022DA],
-  "leq" => [0x02264],
-  "leqq" => [0x02266],
-  "leqslant" => [0x02A7D],
-  "les" => [0x02A7D],
-  "lescc" => [0x02AA8],
-  "lesdot" => [0x02A7F],
-  "lesdoto" => [0x02A81],
-  "lesdotor" => [0x02A83],
-  "lesg" => [0x022DA, 0x0FE00],
-  "lesges" => [0x02A93],
-  "lessapprox" => [0x02A85],
-  "lessdot" => [0x022D6],
-  "lesseqgtr" => [0x022DA],
-  "lesseqqgtr" => [0x02A8B],
-  "lessgtr" => [0x02276],
-  "lesssim" => [0x02272],
-  "lfisht" => [0x0297C],
-  "lfloor" => [0x0230A],
-  "lfr" => [0x1D529],
-  "lg" => [0x02276],
-  "lgE" => [0x02A91],
-  "lhard" => [0x021BD],
-  "lharu" => [0x021BC],
-  "lharul" => [0x0296A],
-  "lhblk" => [0x02584],
-  "ljcy" => [0x00459],
-  "ll" => [0x0226A],
-  "llarr" => [0x021C7],
-  "llcorner" => [0x0231E],
-  "llhard" => [0x0296B],
-  "lltri" => [0x025FA],
-  "lmidot" => [0x00140],
-  "lmoust" => [0x023B0],
-  "lmoustache" => [0x023B0],
-  "lnE" => [0x02268],
-  "lnap" => [0x02A89],
-  "lnapprox" => [0x02A89],
-  "lne" => [0x02A87],
-  "lneq" => [0x02A87],
-  "lneqq" => [0x02268],
-  "lnsim" => [0x022E6],
-  "loang" => [0x027EC],
-  "loarr" => [0x021FD],
-  "lobrk" => [0x027E6],
-  "longleftarrow" => [0x027F5],
-  "longleftrightarrow" => [0x027F7],
-  "longmapsto" => [0x027FC],
-  "longrightarrow" => [0x027F6],
-  "looparrowleft" => [0x021AB],
-  "looparrowright" => [0x021AC],
-  "lopar" => [0x02985],
-  "lopf" => [0x1D55D],
-  "loplus" => [0x02A2D],
-  "lotimes" => [0x02A34],
-  "lowast" => [0x02217],
-  "lowbar" => [0x0005F],
-  "loz" => [0x025CA],
-  "lozenge" => [0x025CA],
-  "lozf" => [0x029EB],
-  "lpar" => [0x00028],
-  "lparlt" => [0x02993],
-  "lrarr" => [0x021C6],
-  "lrcorner" => [0x0231F],
-  "lrhar" => [0x021CB],
-  "lrhard" => [0x0296D],
-  "lrm" => [0x0200E],
-  "lrtri" => [0x022BF],
-  "lsaquo" => [0x02039],
-  "lscr" => [0x1D4C1],
-  "lsh" => [0x021B0],
-  "lsim" => [0x02272],
-  "lsime" => [0x02A8D],
-  "lsimg" => [0x02A8F],
-  "lsqb" => [0x0005B],
-  "lsquo" => [0x02018],
-  "lsquor" => [0x0201A],
-  "lstrok" => [0x00142],
-  "lt" => [0x0003C],
-  "ltcc" => [0x02AA6],
-  "ltcir" => [0x02A79],
-  "ltdot" => [0x022D6],
-  "lthree" => [0x022CB],
-  "ltimes" => [0x022C9],
-  "ltlarr" => [0x02976],
-  "ltquest" => [0x02A7B],
-  "ltrPar" => [0x02996],
-  "ltri" => [0x025C3],
-  "ltrie" => [0x022B4],
-  "ltrif" => [0x025C2],
-  "lurdshar" => [0x0294A],
-  "luruhar" => [0x02966],
-  "lvertneqq" => [0x02268, 0x0FE00],
-  "lvnE" => [0x02268, 0x0FE00],
-  "mDDot" => [0x0223A],
-  "macr" => [0x000AF],
-  "male" => [0x02642],
-  "malt" => [0x02720],
-  "maltese" => [0x02720],
-  "map" => [0x021A6],
-  "mapsto" => [0x021A6],
-  "mapstodown" => [0x021A7],
-  "mapstoleft" => [0x021A4],
-  "mapstoup" => [0x021A5],
-  "marker" => [0x025AE],
-  "mcomma" => [0x02A29],
-  "mcy" => [0x0043C],
-  "mdash" => [0x02014],
-  "measuredangle" => [0x02221],
-  "mfr" => [0x1D52A],
-  "mho" => [0x02127],
-  "micro" => [0x000B5],
-  "mid" => [0x02223],
-  "midast" => [0x0002A],
-  "midcir" => [0x02AF0],
-  "middot" => [0x000B7],
-  "minus" => [0x02212],
-  "minusb" => [0x0229F],
-  "minusd" => [0x02238],
-  "minusdu" => [0x02A2A],
-  "mlcp" => [0x02ADB],
-  "mldr" => [0x02026],
-  "mnplus" => [0x02213],
-  "models" => [0x022A7],
-  "mopf" => [0x1D55E],
-  "mp" => [0x02213],
-  "mscr" => [0x1D4C2],
-  "mstpos" => [0x0223E],
-  "mu" => [0x003BC],
-  "multimap" => [0x022B8],
-  "mumap" => [0x022B8],
-  "nGg" => [0x022D9, 0x00338],
-  "nGt" => [0x0226B, 0x020D2],
-  "nGtv" => [0x0226B, 0x00338],
-  "nLeftarrow" => [0x021CD],
-  "nLeftrightarrow" => [0x021CE],
-  "nLl" => [0x022D8, 0x00338],
-  "nLt" => [0x0226A, 0x020D2],
-  "nLtv" => [0x0226A, 0x00338],
-  "nRightarrow" => [0x021CF],
-  "nVDash" => [0x022AF],
-  "nVdash" => [0x022AE],
-  "nabla" => [0x02207],
-  "nacute" => [0x00144],
-  "nang" => [0x02220, 0x020D2],
-  "nap" => [0x02249],
-  "napE" => [0x02A70, 0x00338],
-  "napid" => [0x0224B, 0x00338],
-  "napos" => [0x00149],
-  "napprox" => [0x02249],
-  "natur" => [0x0266E],
-  "natural" => [0x0266E],
-  "naturals" => [0x02115],
-  "nbsp" => [0x000A0],
-  "nbump" => [0x0224E, 0x00338],
-  "nbumpe" => [0x0224F, 0x00338],
-  "ncap" => [0x02A43],
-  "ncaron" => [0x00148],
-  "ncedil" => [0x00146],
-  "ncong" => [0x02247],
-  "ncongdot" => [0x02A6D, 0x00338],
-  "ncup" => [0x02A42],
-  "ncy" => [0x0043D],
-  "ndash" => [0x02013],
-  "ne" => [0x02260],
-  "neArr" => [0x021D7],
-  "nearhk" => [0x02924],
-  "nearr" => [0x02197],
-  "nearrow" => [0x02197],
-  "nedot" => [0x02250, 0x00338],
-  "nequiv" => [0x02262],
-  "nesear" => [0x02928],
-  "nesim" => [0x02242, 0x00338],
-  "nexist" => [0x02204],
-  "nexists" => [0x02204],
-  "nfr" => [0x1D52B],
-  "ngE" => [0x02267, 0x00338],
-  "nge" => [0x02271],
-  "ngeq" => [0x02271],
-  "ngeqq" => [0x02267, 0x00338],
-  "ngeqslant" => [0x02A7E, 0x00338],
-  "nges" => [0x02A7E, 0x00338],
-  "ngsim" => [0x02275],
-  "ngt" => [0x0226F],
-  "ngtr" => [0x0226F],
-  "nhArr" => [0x021CE],
-  "nharr" => [0x021AE],
-  "nhpar" => [0x02AF2],
-  "ni" => [0x0220B],
-  "nis" => [0x022FC],
-  "nisd" => [0x022FA],
-  "niv" => [0x0220B],
-  "njcy" => [0x0045A],
-  "nlArr" => [0x021CD],
-  "nlE" => [0x02266, 0x00338],
-  "nlarr" => [0x0219A],
-  "nldr" => [0x02025],
-  "nle" => [0x02270],
-  "nleftarrow" => [0x0219A],
-  "nleftrightarrow" => [0x021AE],
-  "nleq" => [0x02270],
-  "nleqq" => [0x02266, 0x00338],
-  "nleqslant" => [0x02A7D, 0x00338],
-  "nles" => [0x02A7D, 0x00338],
-  "nless" => [0x0226E],
-  "nlsim" => [0x02274],
-  "nlt" => [0x0226E],
-  "nltri" => [0x022EA],
-  "nltrie" => [0x022EC],
-  "nmid" => [0x02224],
-  "nopf" => [0x1D55F],
-  "not" => [0x000AC],
-  "notin" => [0x02209],
-  "notinE" => [0x022F9, 0x00338],
-  "notindot" => [0x022F5, 0x00338],
-  "notinva" => [0x02209],
-  "notinvb" => [0x022F7],
-  "notinvc" => [0x022F6],
-  "notni" => [0x0220C],
-  "notniva" => [0x0220C],
-  "notnivb" => [0x022FE],
-  "notnivc" => [0x022FD],
-  "npar" => [0x02226],
-  "nparallel" => [0x02226],
-  "nparsl" => [0x02AFD, 0x020E5],
-  "npart" => [0x02202, 0x00338],
-  "npolint" => [0x02A14],
-  "npr" => [0x02280],
-  "nprcue" => [0x022E0],
-  "npre" => [0x02AAF, 0x00338],
-  "nprec" => [0x02280],
-  "npreceq" => [0x02AAF, 0x00338],
-  "nrArr" => [0x021CF],
-  "nrarr" => [0x0219B],
-  "nrarrc" => [0x02933, 0x00338],
-  "nrarrw" => [0x0219D, 0x00338],
-  "nrightarrow" => [0x0219B],
-  "nrtri" => [0x022EB],
-  "nrtrie" => [0x022ED],
-  "nsc" => [0x02281],
-  "nsccue" => [0x022E1],
-  "nsce" => [0x02AB0, 0x00338],
-  "nscr" => [0x1D4C3],
-  "nshortmid" => [0x02224],
-  "nshortparallel" => [0x02226],
-  "nsim" => [0x02241],
-  "nsime" => [0x02244],
-  "nsimeq" => [0x02244],
-  "nsmid" => [0x02224],
-  "nspar" => [0x02226],
-  "nsqsube" => [0x022E2],
-  "nsqsupe" => [0x022E3],
-  "nsub" => [0x02284],
-  "nsubE" => [0x02AC5, 0x00338],
-  "nsube" => [0x02288],
-  "nsubset" => [0x02282, 0x020D2],
-  "nsubseteq" => [0x02288],
-  "nsubseteqq" => [0x02AC5, 0x00338],
-  "nsucc" => [0x02281],
-  "nsucceq" => [0x02AB0, 0x00338],
-  "nsup" => [0x02285],
-  "nsupE" => [0x02AC6, 0x00338],
-  "nsupe" => [0x02289],
-  "nsupset" => [0x02283, 0x020D2],
-  "nsupseteq" => [0x02289],
-  "nsupseteqq" => [0x02AC6, 0x00338],
-  "ntgl" => [0x02279],
-  "ntilde" => [0x000F1],
-  "ntlg" => [0x02278],
-  "ntriangleleft" => [0x022EA],
-  "ntrianglelefteq" => [0x022EC],
-  "ntriangleright" => [0x022EB],
-  "ntrianglerighteq" => [0x022ED],
-  "nu" => [0x003BD],
-  "num" => [0x00023],
-  "numero" => [0x02116],
-  "numsp" => [0x02007],
-  "nvDash" => [0x022AD],
-  "nvHarr" => [0x02904],
-  "nvap" => [0x0224D, 0x020D2],
-  "nvdash" => [0x022AC],
-  "nvge" => [0x02265, 0x020D2],
-  "nvgt" => [0x0003E, 0x020D2],
-  "nvinfin" => [0x029DE],
-  "nvlArr" => [0x02902],
-  "nvle" => [0x02264, 0x020D2],
-  "nvlt" => [0x0003C, 0x020D2],
-  "nvltrie" => [0x022B4, 0x020D2],
-  "nvrArr" => [0x02903],
-  "nvrtrie" => [0x022B5, 0x020D2],
-  "nvsim" => [0x0223C, 0x020D2],
-  "nwArr" => [0x021D6],
-  "nwarhk" => [0x02923],
-  "nwarr" => [0x02196],
-  "nwarrow" => [0x02196],
-  "nwnear" => [0x02927],
-  "oS" => [0x024C8],
-  "oacute" => [0x000F3],
-  "oast" => [0x0229B],
-  "ocir" => [0x0229A],
-  "ocirc" => [0x000F4],
-  "ocy" => [0x0043E],
-  "odash" => [0x0229D],
-  "odblac" => [0x00151],
-  "odiv" => [0x02A38],
-  "odot" => [0x02299],
-  "odsold" => [0x029BC],
-  "oelig" => [0x00153],
-  "ofcir" => [0x029BF],
-  "ofr" => [0x1D52C],
-  "ogon" => [0x002DB],
-  "ograve" => [0x000F2],
-  "ogt" => [0x029C1],
-  "ohbar" => [0x029B5],
-  "ohm" => [0x003A9],
-  "oint" => [0x0222E],
-  "olarr" => [0x021BA],
-  "olcir" => [0x029BE],
-  "olcross" => [0x029BB],
-  "oline" => [0x0203E],
-  "olt" => [0x029C0],
-  "omacr" => [0x0014D],
-  "omega" => [0x003C9],
-  "omicron" => [0x003BF],
-  "omid" => [0x029B6],
-  "ominus" => [0x02296],
-  "oopf" => [0x1D560],
-  "opar" => [0x029B7],
-  "operp" => [0x029B9],
-  "oplus" => [0x02295],
-  "or" => [0x02228],
-  "orarr" => [0x021BB],
-  "ord" => [0x02A5D],
-  "order" => [0x02134],
-  "orderof" => [0x02134],
-  "ordf" => [0x000AA],
-  "ordm" => [0x000BA],
-  "origof" => [0x022B6],
-  "oror" => [0x02A56],
-  "orslope" => [0x02A57],
-  "orv" => [0x02A5B],
-  "oscr" => [0x02134],
-  "oslash" => [0x000F8],
-  "osol" => [0x02298],
-  "otilde" => [0x000F5],
-  "otimes" => [0x02297],
-  "otimesas" => [0x02A36],
-  "ouml" => [0x000F6],
-  "ovbar" => [0x0233D],
-  "par" => [0x02225],
-  "para" => [0x000B6],
-  "parallel" => [0x02225],
-  "parsim" => [0x02AF3],
-  "parsl" => [0x02AFD],
-  "part" => [0x02202],
-  "pcy" => [0x0043F],
-  "percnt" => [0x00025],
-  "period" => [0x0002E],
-  "permil" => [0x02030],
-  "perp" => [0x022A5],
-  "pertenk" => [0x02031],
-  "pfr" => [0x1D52D],
-  "phi" => [0x003C6],
-  "phiv" => [0x003D5],
-  "phmmat" => [0x02133],
-  "phone" => [0x0260E],
-  "pi" => [0x003C0],
-  "pitchfork" => [0x022D4],
-  "piv" => [0x003D6],
-  "planck" => [0x0210F],
-  "planckh" => [0x0210E],
-  "plankv" => [0x0210F],
-  "plus" => [0x0002B],
-  "plusacir" => [0x02A23],
-  "plusb" => [0x0229E],
-  "pluscir" => [0x02A22],
-  "plusdo" => [0x02214],
-  "plusdu" => [0x02A25],
-  "pluse" => [0x02A72],
-  "plusmn" => [0x000B1],
-  "plussim" => [0x02A26],
-  "plustwo" => [0x02A27],
-  "pm" => [0x000B1],
-  "pointint" => [0x02A15],
-  "popf" => [0x1D561],
-  "pound" => [0x000A3],
-  "pr" => [0x0227A],
-  "prE" => [0x02AB3],
-  "prap" => [0x02AB7],
-  "prcue" => [0x0227C],
-  "pre" => [0x02AAF],
-  "prec" => [0x0227A],
-  "precapprox" => [0x02AB7],
-  "preccurlyeq" => [0x0227C],
-  "preceq" => [0x02AAF],
-  "precnapprox" => [0x02AB9],
-  "precneqq" => [0x02AB5],
-  "precnsim" => [0x022E8],
-  "precsim" => [0x0227E],
-  "prime" => [0x02032],
-  "primes" => [0x02119],
-  "prnE" => [0x02AB5],
-  "prnap" => [0x02AB9],
-  "prnsim" => [0x022E8],
-  "prod" => [0x0220F],
-  "profalar" => [0x0232E],
-  "profline" => [0x02312],
-  "profsurf" => [0x02313],
-  "prop" => [0x0221D],
-  "propto" => [0x0221D],
-  "prsim" => [0x0227E],
-  "prurel" => [0x022B0],
-  "pscr" => [0x1D4C5],
-  "psi" => [0x003C8],
-  "puncsp" => [0x02008],
-  "qfr" => [0x1D52E],
-  "qint" => [0x02A0C],
-  "qopf" => [0x1D562],
-  "qprime" => [0x02057],
-  "qscr" => [0x1D4C6],
-  "quaternions" => [0x0210D],
-  "quatint" => [0x02A16],
-  "quest" => [0x0003F],
-  "questeq" => [0x0225F],
-  "quot" => [0x00022],
-  "rAarr" => [0x021DB],
-  "rArr" => [0x021D2],
-  "rAtail" => [0x0291C],
-  "rBarr" => [0x0290F],
-  "rHar" => [0x02964],
-  "race" => [0x0223D, 0x00331],
-  "racute" => [0x00155],
-  "radic" => [0x0221A],
-  "raemptyv" => [0x029B3],
-  "rang" => [0x027E9],
-  "rangd" => [0x02992],
-  "range" => [0x029A5],
-  "rangle" => [0x027E9],
-  "raquo" => [0x000BB],
-  "rarr" => [0x02192],
-  "rarrap" => [0x02975],
-  "rarrb" => [0x021E5],
-  "rarrbfs" => [0x02920],
-  "rarrc" => [0x02933],
-  "rarrfs" => [0x0291E],
-  "rarrhk" => [0x021AA],
-  "rarrlp" => [0x021AC],
-  "rarrpl" => [0x02945],
-  "rarrsim" => [0x02974],
-  "rarrtl" => [0x021A3],
-  "rarrw" => [0x0219D],
-  "ratail" => [0x0291A],
-  "ratio" => [0x02236],
-  "rationals" => [0x0211A],
-  "rbarr" => [0x0290D],
-  "rbbrk" => [0x02773],
-  "rbrace" => [0x0007D],
-  "rbrack" => [0x0005D],
-  "rbrke" => [0x0298C],
-  "rbrksld" => [0x0298E],
-  "rbrkslu" => [0x02990],
-  "rcaron" => [0x00159],
-  "rcedil" => [0x00157],
-  "rceil" => [0x02309],
-  "rcub" => [0x0007D],
-  "rcy" => [0x00440],
-  "rdca" => [0x02937],
-  "rdldhar" => [0x02969],
-  "rdquo" => [0x0201D],
-  "rdquor" => [0x0201D],
-  "rdsh" => [0x021B3],
-  "real" => [0x0211C],
-  "realine" => [0x0211B],
-  "realpart" => [0x0211C],
-  "reals" => [0x0211D],
-  "rect" => [0x025AD],
-  "reg" => [0x000AE],
-  "rfisht" => [0x0297D],
-  "rfloor" => [0x0230B],
-  "rfr" => [0x1D52F],
-  "rhard" => [0x021C1],
-  "rharu" => [0x021C0],
-  "rharul" => [0x0296C],
-  "rho" => [0x003C1],
-  "rhov" => [0x003F1],
-  "rightarrow" => [0x02192],
-  "rightarrowtail" => [0x021A3],
-  "rightharpoondown" => [0x021C1],
-  "rightharpoonup" => [0x021C0],
-  "rightleftarrows" => [0x021C4],
-  "rightleftharpoons" => [0x021CC],
-  "rightrightarrows" => [0x021C9],
-  "rightsquigarrow" => [0x0219D],
-  "rightthreetimes" => [0x022CC],
-  "ring" => [0x002DA],
-  "risingdotseq" => [0x02253],
-  "rlarr" => [0x021C4],
-  "rlhar" => [0x021CC],
-  "rlm" => [0x0200F],
-  "rmoust" => [0x023B1],
-  "rmoustache" => [0x023B1],
-  "rnmid" => [0x02AEE],
-  "roang" => [0x027ED],
-  "roarr" => [0x021FE],
-  "robrk" => [0x027E7],
-  "ropar" => [0x02986],
-  "ropf" => [0x1D563],
-  "roplus" => [0x02A2E],
-  "rotimes" => [0x02A35],
-  "rpar" => [0x00029],
-  "rpargt" => [0x02994],
-  "rppolint" => [0x02A12],
-  "rrarr" => [0x021C9],
-  "rsaquo" => [0x0203A],
-  "rscr" => [0x1D4C7],
-  "rsh" => [0x021B1],
-  "rsqb" => [0x0005D],
-  "rsquo" => [0x02019],
-  "rsquor" => [0x02019],
-  "rthree" => [0x022CC],
-  "rtimes" => [0x022CA],
-  "rtri" => [0x025B9],
-  "rtrie" => [0x022B5],
-  "rtrif" => [0x025B8],
-  "rtriltri" => [0x029CE],
-  "ruluhar" => [0x02968],
-  "rx" => [0x0211E],
-  "sacute" => [0x0015B],
-  "sbquo" => [0x0201A],
-  "sc" => [0x0227B],
-  "scE" => [0x02AB4],
-  "scap" => [0x02AB8],
-  "scaron" => [0x00161],
-  "sccue" => [0x0227D],
-  "sce" => [0x02AB0],
-  "scedil" => [0x0015F],
-  "scirc" => [0x0015D],
-  "scnE" => [0x02AB6],
-  "scnap" => [0x02ABA],
-  "scnsim" => [0x022E9],
-  "scpolint" => [0x02A13],
-  "scsim" => [0x0227F],
-  "scy" => [0x00441],
-  "sdot" => [0x022C5],
-  "sdotb" => [0x022A1],
-  "sdote" => [0x02A66],
-  "seArr" => [0x021D8],
-  "searhk" => [0x02925],
-  "searr" => [0x02198],
-  "searrow" => [0x02198],
-  "sect" => [0x000A7],
-  "semi" => [0x0003B],
-  "seswar" => [0x02929],
-  "setminus" => [0x02216],
-  "setmn" => [0x02216],
-  "sext" => [0x02736],
-  "sfr" => [0x1D530],
-  "sfrown" => [0x02322],
-  "sharp" => [0x0266F],
-  "shchcy" => [0x00449],
-  "shcy" => [0x00448],
-  "shortmid" => [0x02223],
-  "shortparallel" => [0x02225],
-  "shy" => [0x000AD],
-  "sigma" => [0x003C3],
-  "sigmaf" => [0x003C2],
-  "sigmav" => [0x003C2],
-  "sim" => [0x0223C],
-  "simdot" => [0x02A6A],
-  "sime" => [0x02243],
-  "simeq" => [0x02243],
-  "simg" => [0x02A9E],
-  "simgE" => [0x02AA0],
-  "siml" => [0x02A9D],
-  "simlE" => [0x02A9F],
-  "simne" => [0x02246],
-  "simplus" => [0x02A24],
-  "simrarr" => [0x02972],
-  "slarr" => [0x02190],
-  "smallsetminus" => [0x02216],
-  "smashp" => [0x02A33],
-  "smeparsl" => [0x029E4],
-  "smid" => [0x02223],
-  "smile" => [0x02323],
-  "smt" => [0x02AAA],
-  "smte" => [0x02AAC],
-  "smtes" => [0x02AAC, 0x0FE00],
-  "softcy" => [0x0044C],
-  "sol" => [0x0002F],
-  "solb" => [0x029C4],
-  "solbar" => [0x0233F],
-  "sopf" => [0x1D564],
-  "spades" => [0x02660],
-  "spadesuit" => [0x02660],
-  "spar" => [0x02225],
-  "sqcap" => [0x02293],
-  "sqcaps" => [0x02293, 0x0FE00],
-  "sqcup" => [0x02294],
-  "sqcups" => [0x02294, 0x0FE00],
-  "sqsub" => [0x0228F],
-  "sqsube" => [0x02291],
-  "sqsubset" => [0x0228F],
-  "sqsubseteq" => [0x02291],
-  "sqsup" => [0x02290],
-  "sqsupe" => [0x02292],
-  "sqsupset" => [0x02290],
-  "sqsupseteq" => [0x02292],
-  "squ" => [0x025A1],
-  "square" => [0x025A1],
-  "squarf" => [0x025AA],
-  "squf" => [0x025AA],
-  "srarr" => [0x02192],
-  "sscr" => [0x1D4C8],
-  "ssetmn" => [0x02216],
-  "ssmile" => [0x02323],
-  "sstarf" => [0x022C6],
-  "star" => [0x02606],
-  "starf" => [0x02605],
-  "straightepsilon" => [0x003F5],
-  "straightphi" => [0x003D5],
-  "strns" => [0x000AF],
-  "sub" => [0x02282],
-  "subE" => [0x02AC5],
-  "subdot" => [0x02ABD],
-  "sube" => [0x02286],
-  "subedot" => [0x02AC3],
-  "submult" => [0x02AC1],
-  "subnE" => [0x02ACB],
-  "subne" => [0x0228A],
-  "subplus" => [0x02ABF],
-  "subrarr" => [0x02979],
-  "subset" => [0x02282],
-  "subseteq" => [0x02286],
-  "subseteqq" => [0x02AC5],
-  "subsetneq" => [0x0228A],
-  "subsetneqq" => [0x02ACB],
-  "subsim" => [0x02AC7],
-  "subsub" => [0x02AD5],
-  "subsup" => [0x02AD3],
-  "succ" => [0x0227B],
-  "succapprox" => [0x02AB8],
-  "succcurlyeq" => [0x0227D],
-  "succeq" => [0x02AB0],
-  "succnapprox" => [0x02ABA],
-  "succneqq" => [0x02AB6],
-  "succnsim" => [0x022E9],
-  "succsim" => [0x0227F],
-  "sum" => [0x02211],
-  "sung" => [0x0266A],
-  "sup" => [0x02283],
-  "sup1" => [0x000B9],
-  "sup2" => [0x000B2],
-  "sup3" => [0x000B3],
-  "supE" => [0x02AC6],
-  "supdot" => [0x02ABE],
-  "supdsub" => [0x02AD8],
-  "supe" => [0x02287],
-  "supedot" => [0x02AC4],
-  "suphsol" => [0x027C9],
-  "suphsub" => [0x02AD7],
-  "suplarr" => [0x0297B],
-  "supmult" => [0x02AC2],
-  "supnE" => [0x02ACC],
-  "supne" => [0x0228B],
-  "supplus" => [0x02AC0],
-  "supset" => [0x02283],
-  "supseteq" => [0x02287],
-  "supseteqq" => [0x02AC6],
-  "supsetneq" => [0x0228B],
-  "supsetneqq" => [0x02ACC],
-  "supsim" => [0x02AC8],
-  "supsub" => [0x02AD4],
-  "supsup" => [0x02AD6],
-  "swArr" => [0x021D9],
-  "swarhk" => [0x02926],
-  "swarr" => [0x02199],
-  "swarrow" => [0x02199],
-  "swnwar" => [0x0292A],
-  "szlig" => [0x000DF],
-  "target" => [0x02316],
-  "tau" => [0x003C4],
-  "tbrk" => [0x023B4],
-  "tcaron" => [0x00165],
-  "tcedil" => [0x00163],
-  "tcy" => [0x00442],
-  "tdot" => [0x020DB],
-  "telrec" => [0x02315],
-  "tfr" => [0x1D531],
-  "there4" => [0x02234],
-  "therefore" => [0x02234],
-  "theta" => [0x003B8],
-  "thetasym" => [0x003D1],
-  "thetav" => [0x003D1],
-  "thickapprox" => [0x02248],
-  "thicksim" => [0x0223C],
-  "thinsp" => [0x02009],
-  "thkap" => [0x02248],
-  "thksim" => [0x0223C],
-  "thorn" => [0x000FE],
-  "tilde" => [0x002DC],
-  "times" => [0x000D7],
-  "timesb" => [0x022A0],
-  "timesbar" => [0x02A31],
-  "timesd" => [0x02A30],
-  "tint" => [0x0222D],
-  "toea" => [0x02928],
-  "top" => [0x022A4],
-  "topbot" => [0x02336],
-  "topcir" => [0x02AF1],
-  "topf" => [0x1D565],
-  "topfork" => [0x02ADA],
-  "tosa" => [0x02929],
-  "tprime" => [0x02034],
-  "trade" => [0x02122],
-  "triangle" => [0x025B5],
-  "triangledown" => [0x025BF],
-  "triangleleft" => [0x025C3],
-  "trianglelefteq" => [0x022B4],
-  "triangleq" => [0x0225C],
-  "triangleright" => [0x025B9],
-  "trianglerighteq" => [0x022B5],
-  "tridot" => [0x025EC],
-  "trie" => [0x0225C],
-  "triminus" => [0x02A3A],
-  "triplus" => [0x02A39],
-  "trisb" => [0x029CD],
-  "tritime" => [0x02A3B],
-  "trpezium" => [0x023E2],
-  "tscr" => [0x1D4C9],
-  "tscy" => [0x00446],
-  "tshcy" => [0x0045B],
-  "tstrok" => [0x00167],
-  "twixt" => [0x0226C],
-  "twoheadleftarrow" => [0x0219E],
-  "twoheadrightarrow" => [0x021A0],
-  "uArr" => [0x021D1],
-  "uHar" => [0x02963],
-  "uacute" => [0x000FA],
-  "uarr" => [0x02191],
-  "ubrcy" => [0x0045E],
-  "ubreve" => [0x0016D],
-  "ucirc" => [0x000FB],
-  "ucy" => [0x00443],
-  "udarr" => [0x021C5],
-  "udblac" => [0x00171],
-  "udhar" => [0x0296E],
-  "ufisht" => [0x0297E],
-  "ufr" => [0x1D532],
-  "ugrave" => [0x000F9],
-  "uharl" => [0x021BF],
-  "uharr" => [0x021BE],
-  "uhblk" => [0x02580],
-  "ulcorn" => [0x0231C],
-  "ulcorner" => [0x0231C],
-  "ulcrop" => [0x0230F],
-  "ultri" => [0x025F8],
-  "umacr" => [0x0016B],
-  "uml" => [0x000A8],
-  "uogon" => [0x00173],
-  "uopf" => [0x1D566],
-  "uparrow" => [0x02191],
-  "updownarrow" => [0x02195],
-  "upharpoonleft" => [0x021BF],
-  "upharpoonright" => [0x021BE],
-  "uplus" => [0x0228E],
-  "upsi" => [0x003C5],
-  "upsih" => [0x003D2],
-  "upsilon" => [0x003C5],
-  "upuparrows" => [0x021C8],
-  "urcorn" => [0x0231D],
-  "urcorner" => [0x0231D],
-  "urcrop" => [0x0230E],
-  "uring" => [0x0016F],
-  "urtri" => [0x025F9],
-  "uscr" => [0x1D4CA],
-  "utdot" => [0x022F0],
-  "utilde" => [0x00169],
-  "utri" => [0x025B5],
-  "utrif" => [0x025B4],
-  "uuarr" => [0x021C8],
-  "uuml" => [0x000FC],
-  "uwangle" => [0x029A7],
-  "vArr" => [0x021D5],
-  "vBar" => [0x02AE8],
-  "vBarv" => [0x02AE9],
-  "vDash" => [0x022A8],
-  "vangrt" => [0x0299C],
-  "varepsilon" => [0x003F5],
-  "varkappa" => [0x003F0],
-  "varnothing" => [0x02205],
-  "varphi" => [0x003D5],
-  "varpi" => [0x003D6],
-  "varpropto" => [0x0221D],
-  "varr" => [0x02195],
-  "varrho" => [0x003F1],
-  "varsigma" => [0x003C2],
-  "varsubsetneq" => [0x0228A, 0x0FE00],
-  "varsubsetneqq" => [0x02ACB, 0x0FE00],
-  "varsupsetneq" => [0x0228B, 0x0FE00],
-  "varsupsetneqq" => [0x02ACC, 0x0FE00],
-  "vartheta" => [0x003D1],
-  "vartriangleleft" => [0x022B2],
-  "vartriangleright" => [0x022B3],
-  "vcy" => [0x00432],
-  "vdash" => [0x022A2],
-  "vee" => [0x02228],
-  "veebar" => [0x022BB],
-  "veeeq" => [0x0225A],
-  "vellip" => [0x022EE],
-  "verbar" => [0x0007C],
-  "vert" => [0x0007C],
-  "vfr" => [0x1D533],
-  "vltri" => [0x022B2],
-  "vnsub" => [0x02282, 0x020D2],
-  "vnsup" => [0x02283, 0x020D2],
-  "vopf" => [0x1D567],
-  "vprop" => [0x0221D],
-  "vrtri" => [0x022B3],
-  "vscr" => [0x1D4CB],
-  "vsubnE" => [0x02ACB, 0x0FE00],
-  "vsubne" => [0x0228A, 0x0FE00],
-  "vsupnE" => [0x02ACC, 0x0FE00],
-  "vsupne" => [0x0228B, 0x0FE00],
-  "vzigzag" => [0x0299A],
-  "wcirc" => [0x00175],
-  "wedbar" => [0x02A5F],
-  "wedge" => [0x02227],
-  "wedgeq" => [0x02259],
-  "weierp" => [0x02118],
-  "wfr" => [0x1D534],
-  "wopf" => [0x1D568],
-  "wp" => [0x02118],
-  "wr" => [0x02240],
-  "wreath" => [0x02240],
-  "wscr" => [0x1D4CC],
-  "xcap" => [0x022C2],
-  "xcirc" => [0x025EF],
-  "xcup" => [0x022C3],
-  "xdtri" => [0x025BD],
-  "xfr" => [0x1D535],
-  "xhArr" => [0x027FA],
-  "xharr" => [0x027F7],
-  "xi" => [0x003BE],
-  "xlArr" => [0x027F8],
-  "xlarr" => [0x027F5],
-  "xmap" => [0x027FC],
-  "xnis" => [0x022FB],
-  "xodot" => [0x02A00],
-  "xopf" => [0x1D569],
-  "xoplus" => [0x02A01],
-  "xotime" => [0x02A02],
-  "xrArr" => [0x027F9],
-  "xrarr" => [0x027F6],
-  "xscr" => [0x1D4CD],
-  "xsqcup" => [0x02A06],
-  "xuplus" => [0x02A04],
-  "xutri" => [0x025B3],
-  "xvee" => [0x022C1],
-  "xwedge" => [0x022C0],
-  "yacute" => [0x000FD],
-  "yacy" => [0x0044F],
-  "ycirc" => [0x00177],
-  "ycy" => [0x0044B],
-  "yen" => [0x000A5],
-  "yfr" => [0x1D536],
-  "yicy" => [0x00457],
-  "yopf" => [0x1D56A],
-  "yscr" => [0x1D4CE],
-  "yucy" => [0x0044E],
-  "yuml" => [0x000FF],
-  "zacute" => [0x0017A],
-  "zcaron" => [0x0017E],
-  "zcy" => [0x00437],
-  "zdot" => [0x0017C],
-  "zeetrf" => [0x02128],
-  "zeta" => [0x003B6],
-  "zfr" => [0x1D537],
-  "zhcy" => [0x00436],
-  "zigrarr" => [0x021DD],
-  "zopf" => [0x1D56B],
-  "zscr" => [0x1D4CF],
-  "zwj" => [0x0200D],
-  "zwnj" => [0x0200C],
-}
diff --git a/lib/rdoc/markdown/literals.rb b/lib/rdoc/markdown/literals.rb
deleted file mode 100644
index c5c15d3100..0000000000
--- a/lib/rdoc/markdown/literals.rb
+++ /dev/null
@@ -1,454 +0,0 @@
-# coding: UTF-8
-# frozen_string_literal: true
-# :markup: markdown
-
-##
-# This set of literals is for Ruby 1.9 regular expressions and gives full
-# unicode support.
-#
-# Unlike peg-markdown, this set of literals recognizes Unicode alphanumeric
-# characters, newlines and spaces.
-class RDoc::Markdown::Literals
-  # :stopdoc:
-
-    # This is distinct from setup_parser so that a standalone parser
-    # can redefine #initialize and still have access to the proper
-    # parser setup code.
-    def initialize(str, debug=false)
-      setup_parser(str, debug)
-    end
-
-
-
-    # Prepares for parsing +str+.  If you define a custom initialize you must
-    # call this method before #parse
-    def setup_parser(str, debug=false)
-      set_string str, 0
-      @memoizations = Hash.new { |h,k| h[k] = {} }
-      @result = nil
-      @failed_rule = nil
-      @failing_rule_offset = -1
-      @line_offsets = nil
-
-      setup_foreign_grammar
-    end
-
-    attr_reader :string
-    attr_reader :failing_rule_offset
-    attr_accessor :result, :pos
-
-    def current_column(target=pos)
-      if string[target] == "\n" && (c = string.rindex("\n", target-1) || -1)
-        return target - c
-      elsif c = string.rindex("\n", target)
-        return target - c
-      end
-
-      target + 1
-    end
-
-    def position_line_offsets
-      unless @position_line_offsets
-        @position_line_offsets = []
-        total = 0
-        string.each_line do |line|
-          total += line.size
-          @position_line_offsets << total
-        end
-      end
-      @position_line_offsets
-    end
-
-    if [].respond_to? :bsearch_index
-      def current_line(target=pos)
-        if line = position_line_offsets.bsearch_index {|x| x > target }
-          return line + 1
-        end
-        raise "Target position #{target} is outside of string"
-      end
-    else
-      def current_line(target=pos)
-        if line = position_line_offsets.index {|x| x > target }
-          return line + 1
-        end
-
-        raise "Target position #{target} is outside of string"
-      end
-    end
-
-    def current_character(target=pos)
-      if target < 0 || target >= string.size
-        raise "Target position #{target} is outside of string"
-      end
-      string[target, 1]
-    end
-
-    KpegPosInfo = Struct.new(:pos, :lno, :col, :line, :char)
-
-    def current_pos_info(target=pos)
-      l = current_line target
-      c = current_column target
-      ln = get_line(l-1)
-      chr = string[target,1]
-      KpegPosInfo.new(target, l, c, ln, chr)
-    end
-
-    def lines
-      string.lines
-    end
-
-    def get_line(no)
-      loff = position_line_offsets
-      if no < 0
-        raise "Line No is out of range: #{no} < 0"
-      elsif no >= loff.size
-        raise "Line No is out of range: #{no} >= #{loff.size}"
-      end
-      lend = loff[no]-1
-      lstart = no > 0 ? loff[no-1] : 0
-      string[lstart..lend]
-    end
-
-
-
-    def get_text(start)
-      @string[start..@pos-1]
-    end
-
-    # Sets the string and current parsing position for the parser.
-    def set_string string, pos
-      @string = string
-      @string_size = string ? string.size : 0
-      @pos = pos
-      @position_line_offsets = nil
-    end
-
-    def show_pos
-      width = 10
-      if @pos < width
-        "#{@pos} (\"#{@string[0,@pos]}\" @ \"#{@string[@pos,width]}\")"
-      else
-        "#{@pos} (\"... #{@string[@pos - width, width]}\" @ \"#{@string[@pos,width]}\")"
-      end
-    end
-
-    def failure_info
-      l = current_line @failing_rule_offset
-      c = current_column @failing_rule_offset
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        "line #{l}, column #{c}: failed rule '#{info.name}' = '#{info.rendered}'"
-      else
-        "line #{l}, column #{c}: failed rule '#{@failed_rule}'"
-      end
-    end
-
-    def failure_caret
-      p = current_pos_info @failing_rule_offset
-      "#{p.line.chomp}\n#{' ' * (p.col - 1)}^"
-    end
-
-    def failure_character
-      current_character @failing_rule_offset
-    end
-
-    def failure_oneline
-      p = current_pos_info @failing_rule_offset
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        "@#{p.lno}:#{p.col} failed rule '#{info.name}', got '#{p.char}'"
-      else
-        "@#{p.lno}:#{p.col} failed rule '#{@failed_rule}', got '#{p.char}'"
-      end
-    end
-
-    class ParseError < RuntimeError
-    end
-
-    def raise_error
-      raise ParseError, failure_oneline
-    end
-
-    def show_error(io=STDOUT)
-      error_pos = @failing_rule_offset
-      p = current_pos_info(error_pos)
-
-      io.puts "On line #{p.lno}, column #{p.col}:"
-
-      if @failed_rule.kind_of? Symbol
-        info = self.class::Rules[@failed_rule]
-        io.puts "Failed to match '#{info.rendered}' (rule '#{info.name}')"
-      else
-        io.puts "Failed to match rule '#{@failed_rule}'"
-      end
-
-      io.puts "Got: #{p.char.inspect}"
-      io.puts "=> #{p.line}"
-      io.print(" " * (p.col + 2))
-      io.puts "^"
-    end
-
-    def set_failed_rule(name)
-      if @pos > @failing_rule_offset
-        @failed_rule = name
-        @failing_rule_offset = @pos
-      end
-    end
-
-    attr_reader :failed_rule
-
-    def match_string(str)
-      len = str.size
-      if @string[pos,len] == str
-        @pos += len
-        return str
-      end
-
-      return nil
-    end
-
-    def scan(reg)
-      if m = reg.match(@string, @pos)
-        @pos = m.end(0)
-        return true
-      end
-
-      return nil
-    end
-
-    if "".respond_to? :ord
-      def get_byte
-        if @pos >= @string_size
-          return nil
-        end
-
-        s = @string[@pos].ord
-        @pos += 1
-        s
-      end
-    else
-      def get_byte
-        if @pos >= @string_size
-          return nil
-        end
-
-        s = @string[@pos]
-        @pos += 1
-        s
-      end
-    end
-
-    def parse(rule=nil)
-      # We invoke the rules indirectly via apply
-      # instead of by just calling them as methods because
-      # if the rules use left recursion, apply needs to
-      # manage that.
-
-      if !rule
-        apply(:_root)
-      else
-        method = rule.gsub("-","_hyphen_")
-        apply :"_#{method}"
-      end
-    end
-
-    class MemoEntry
-      def initialize(ans, pos)
-        @ans = ans
-        @pos = pos
-        @result = nil
-        @set = false
-        @left_rec = false
-      end
-
-      attr_reader :ans, :pos, :result, :set
-      attr_accessor :left_rec
-
-      def move!(ans, pos, result)
-        @ans = ans
-        @pos = pos
-        @result = result
-        @set = true
-        @left_rec = false
-      end
-    end
-
-    def external_invoke(other, rule, *args)
-      old_pos = @pos
-      old_string = @string
-
-      set_string other.string, other.pos
-
-      begin
-        if val = __send__(rule, *args)
-          other.pos = @pos
-          other.result = @result
-        else
-          other.set_failed_rule "#{self.class}##{rule}"
-        end
-        val
-      ensure
-        set_string old_string, old_pos
-      end
-    end
-
-    def apply_with_args(rule, *args)
-      @result = nil
-      memo_key = [rule, args]
-      if m = @memoizations[memo_key][@pos]
-        @pos = m.pos
-        if !m.set
-          m.left_rec = true
-          return nil
-        end
-
-        @result = m.result
-
-        return m.ans
-      else
-        m = MemoEntry.new(nil, @pos)
-        @memoizations[memo_key][@pos] = m
-        start_pos = @pos
-
-        ans = __send__ rule, *args
-
-        lr = m.left_rec
-
-        m.move! ans, @pos, @result
-
-        # Don't bother trying to grow the left recursion
-        # if it's failing straight away (thus there is no seed)
-        if ans and lr
-          return grow_lr(rule, args, start_pos, m)
-        else
-          return ans
-        end
-      end
-    end
-
-    def apply(rule)
-      @result = nil
-      if m = @memoizations[rule][@pos]
-        @pos = m.pos
-        if !m.set
-          m.left_rec = true
-          return nil
-        end
-
-        @result = m.result
-
-        return m.ans
-      else
-        m = MemoEntry.new(nil, @pos)
-        @memoizations[rule][@pos] = m
-        start_pos = @pos
-
-        ans = __send__ rule
-
-        lr = m.left_rec
-
-        m.move! ans, @pos, @result
-
-        # Don't bother trying to grow the left recursion
-        # if it's failing straight away (thus there is no seed)
-        if ans and lr
-          return grow_lr(rule, nil, start_pos, m)
-        else
-          return ans
-        end
-      end
-    end
-
-    def grow_lr(rule, args, start_pos, m)
-      while true
-        @pos = start_pos
-        @result = m.result
-
-        if args
-          ans = __send__ rule, *args
-        else
-          ans = __send__ rule
-        end
-        return nil unless ans
-
-        break if @pos <= m.pos
-
-        m.move! ans, @pos, @result
-      end
-
-      @result = m.result
-      @pos = m.pos
-      return m.ans
-    end
-
-    class RuleInfo
-      def initialize(name, rendered)
-        @name = name
-        @rendered = rendered
-      end
-
-      attr_reader :name, :rendered
-    end
-
-    def self.rule_info(name, rendered)
-      RuleInfo.new(name, rendered)
-    end
-
-
-  # :startdoc:
-  # :stopdoc:
-  def setup_foreign_grammar; end
-
-  # Alphanumeric = /\p{Word}/
-  def _Alphanumeric
-    _tmp = scan(/\G(?-mix:\p{Word})/)
-    set_failed_rule :_Alphanumeric unless _tmp
-    return _tmp
-  end
-
-  # AlphanumericAscii = /[A-Za-z0-9]/
-  def _AlphanumericAscii
-    _tmp = scan(/\G(?-mix:[A-Za-z0-9])/)
-    set_failed_rule :_AlphanumericAscii unless _tmp
-    return _tmp
-  end
-
-  # BOM = "uFEFF"
-  def _BOM
-    _tmp = match_string("uFEFF")
-    set_failed_rule :_BOM unless _tmp
-    return _tmp
-  end
-
-  # Newline = /\n|\r\n?|\p{Zl}|\p{Zp}/
-  def _Newline
-    _tmp = scan(/\G(?-mix:\n|\r\n?|\p{Zl}|\p{Zp})/)
-    set_failed_rule :_Newline unless _tmp
-    return _tmp
-  end
-
-  # NonAlphanumeric = /\p{^Word}/
-  def _NonAlphanumeric
-    _tmp = scan(/\G(?-mix:\p{^Word})/)
-    set_failed_rule :_NonAlphanumeric unless _tmp
-    return _tmp
-  end
-
-  # Spacechar = /\t|\p{Zs}/
-  def _Spacechar
-    _tmp = scan(/\G(?-mix:\t|\p{Zs})/)
-    set_failed_rule :_Spacechar unless _tmp
-    return _tmp
-  end
-
-  Rules = {}
-  Rules[:_Alphanumeric] = rule_info("Alphanumeric", "/\\p{Word}/")
-  Rules[:_AlphanumericAscii] = rule_info("AlphanumericAscii", "/[A-Za-z0-9]/")
-  Rules[:_BOM] = rule_info("BOM", "\"uFEFF\"")
-  Rules[:_Newline] = rule_info("Newline", "/\\n|\\r\\n?|\\p{Zl}|\\p{Zp}/")
-  Rules[:_NonAlphanumeric] = rule_info("NonAlphanumeric", "/\\p{^Word}/")
-  Rules[:_Spacechar] = rule_info("Spacechar", "/\\t|\\p{Zs}/")
-  # :startdoc:
-end
diff --git a/lib/rdoc/markup.rb b/lib/rdoc/markup.rb
deleted file mode 100644
index 6e93030965..0000000000
--- a/lib/rdoc/markup.rb
+++ /dev/null
@@ -1,235 +0,0 @@
-# frozen_string_literal: true
-##
-# RDoc::Markup parses plain text documents and attempts to decompose them into
-# their constituent parts.  Some of these parts are high-level: paragraphs,
-# chunks of verbatim text, list entries and the like.  Other parts happen at
-# the character level: a piece of bold text, a word in code font.  This markup
-# is similar in spirit to that used on WikiWiki webs, where folks create web
-# pages using a simple set of formatting rules.
-#
-# RDoc::Markup and other markup formats do no output formatting, this is
-# handled by the RDoc::Markup::Formatter subclasses.
-#
-# = Supported Formats
-#
-# Besides the RDoc::Markup format, the following formats are built in to RDoc:
-#
-# markdown::
-#   The markdown format as described by
-#   http://daringfireball.net/projects/markdown/.  See RDoc::Markdown for
-#   details on the parser and supported extensions.
-# rd::
-#   The rdtool format.  See RDoc::RD for details on the parser and format.
-# tomdoc::
-#   The TomDoc format as described by http://tomdoc.org/.  See RDoc::TomDoc
-#   for details on the parser and supported extensions.
-#
-# You can choose a markup format using the following methods:
-#
-# per project::
-#   If you build your documentation with rake use RDoc::Task#markup.
-#
-#   If you build your documentation by hand run:
-#
-#      rdoc --markup your_favorite_format --write-options
-#
-#   and commit <tt>.rdoc_options</tt> and ship it with your packaged gem.
-# per file::
-#   At the top of the file use the <tt>:markup:</tt> directive to set the
-#   default format for the rest of the file.
-# per comment::
-#   Use the <tt>:markup:</tt> directive at the top of a comment you want
-#   to write in a different format.
-#
-# = RDoc::Markup
-#
-# RDoc::Markup is extensible at runtime: you can add \new markup elements to
-# be recognized in the documents that RDoc::Markup parses.
-#
-# RDoc::Markup is intended to be the basis for a family of tools which share
-# the common requirement that simple, plain-text should be rendered in a
-# variety of different output formats and media.  It is envisaged that
-# RDoc::Markup could be the basis for formatting RDoc style comment blocks,
-# Wiki entries, and online FAQs.
-#
-# == Synopsis
-#
-# This code converts +input_string+ to HTML.  The conversion takes place in
-# the +convert+ method, so you can use the same RDoc::Markup converter to
-# convert multiple input strings.
-#
-#   require 'rdoc'
-#
-#   h = RDoc::Markup::ToHtml.new(RDoc::Options.new)
-#
-#   puts h.convert(input_string)
-#
-# You can extend the RDoc::Markup parser to recognize new markup
-# sequences, and to add regexp handling. Here we make WikiWords significant to
-# the parser, and also make the sequences {word} and \<no>text...</no> signify
-# strike-through text.  We then subclass the HTML output class to deal
-# with these:
-#
-#   require 'rdoc'
-#
-#   class WikiHtml < RDoc::Markup::ToHtml
-#     def handle_regexp_WIKIWORD(target)
-#       "<font color=red>" + target.text + "</font>"
-#     end
-#   end
-#
-#   markup = RDoc::Markup.new
-#   markup.add_word_pair("{", "}", :STRIKE)
-#   markup.add_html("no", :STRIKE)
-#
-#   markup.add_regexp_handling(/\b([A-Z][a-z]+[A-Z]\w+)/, :WIKIWORD)
-#
-#   wh = WikiHtml.new RDoc::Options.new, markup
-#   wh.add_tag(:STRIKE, "<strike>", "</strike>")
-#
-#   puts "<body>#{wh.convert ARGF.read}</body>"
-#
-# == Encoding
-#
-# Where Encoding support is available, RDoc will automatically convert all
-# documents to the same output encoding.  The output encoding can be set via
-# RDoc::Options#encoding and defaults to Encoding.default_external.
-#
-# = \RDoc Markup Reference
-#
-# See RDoc::MarkupReference.
-#
-#--
-# Original Author:: Dave Thomas,  dave@pragmaticprogrammer.com
-# License:: Ruby license
-
-class RDoc::Markup
-
-  ##
-  # An AttributeManager which handles inline markup.
-
-  attr_reader :attribute_manager
-
-  ##
-  # Parses +str+ into an RDoc::Markup::Document.
-
-  def self.parse str
-    RDoc::Markup::Parser.parse str
-  rescue RDoc::Markup::Parser::Error => e
-    $stderr.puts <<-EOF
-While parsing markup, RDoc encountered a #{e.class}:
-
-#{e}
-\tfrom #{e.backtrace.join "\n\tfrom "}
-
----8<---
-#{text}
----8<---
-
-RDoc #{RDoc::VERSION}
-
-Ruby #{RUBY_VERSION}-p#{RUBY_PATCHLEVEL} #{RUBY_RELEASE_DATE}
-
-Please file a bug report with the above information at:
-
-https://github.com/ruby/rdoc/issues
-
-    EOF
-    raise
-  end
-
-  ##
-  # Take a block of text and use various heuristics to determine its
-  # structure (paragraphs, lists, and so on).  Invoke an event handler as we
-  # identify significant chunks.
-
-  def initialize attribute_manager = nil
-    @attribute_manager = attribute_manager || RDoc::Markup::AttributeManager.new
-    @output = nil
-  end
-
-  ##
-  # Add to the sequences used to add formatting to an individual word (such
-  # as *bold*).  Matching entries will generate attributes that the output
-  # formatters can recognize by their +name+.
-
-  def add_word_pair(start, stop, name)
-    @attribute_manager.add_word_pair(start, stop, name)
-  end
-
-  ##
-  # Add to the sequences recognized as general markup.
-
-  def add_html(tag, name)
-    @attribute_manager.add_html(tag, name)
-  end
-
-  ##
-  # Add to other inline sequences.  For example, we could add WikiWords using
-  # something like:
-  #
-  #    parser.add_regexp_handling(/\b([A-Z][a-z]+[A-Z]\w+)/, :WIKIWORD)
-  #
-  # Each wiki word will be presented to the output formatter.
-
-  def add_regexp_handling(pattern, name)
-    @attribute_manager.add_regexp_handling(pattern, name)
-  end
-
-  ##
-  # We take +input+, parse it if necessary, then invoke the output +formatter+
-  # using a Visitor to render the result.
-
-  def convert input, formatter
-    document = case input
-               when RDoc::Markup::Document then
-                 input
-               else
-                 RDoc::Markup::Parser.parse input
-               end
-
-    document.accept formatter
-  end
-
-  autoload :Parser,                "#{__dir__}/markup/parser"
-  autoload :PreProcess,            "#{__dir__}/markup/pre_process"
-
-  # Inline markup classes
-  autoload :AttrChanger,           "#{__dir__}/markup/attr_changer"
-  autoload :AttrSpan,              "#{__dir__}/markup/attr_span"
-  autoload :Attributes,            "#{__dir__}/markup/attributes"
-  autoload :AttributeManager,      "#{__dir__}/markup/attribute_manager"
-  autoload :RegexpHandling,        "#{__dir__}/markup/regexp_handling"
-
-  # RDoc::Markup AST
-  autoload :BlankLine,             "#{__dir__}/markup/blank_line"
-  autoload :BlockQuote,            "#{__dir__}/markup/block_quote"
-  autoload :Document,              "#{__dir__}/markup/document"
-  autoload :HardBreak,             "#{__dir__}/markup/hard_break"
-  autoload :Heading,               "#{__dir__}/markup/heading"
-  autoload :Include,               "#{__dir__}/markup/include"
-  autoload :IndentedParagraph,     "#{__dir__}/markup/indented_paragraph"
-  autoload :List,                  "#{__dir__}/markup/list"
-  autoload :ListItem,              "#{__dir__}/markup/list_item"
-  autoload :Paragraph,             "#{__dir__}/markup/paragraph"
-  autoload :Table,                 "#{__dir__}/markup/table"
-  autoload :Raw,                   "#{__dir__}/markup/raw"
-  autoload :Rule,                  "#{__dir__}/markup/rule"
-  autoload :Verbatim,              "#{__dir__}/markup/verbatim"
-
-  # Formatters
-  autoload :Formatter,             "#{__dir__}/markup/formatter"
-
-  autoload :ToAnsi,                "#{__dir__}/markup/to_ansi"
-  autoload :ToBs,                  "#{__dir__}/markup/to_bs"
-  autoload :ToHtml,                "#{__dir__}/markup/to_html"
-  autoload :ToHtmlCrossref,        "#{__dir__}/markup/to_html_crossref"
-  autoload :ToHtmlSnippet,         "#{__dir__}/markup/to_html_snippet"
-  autoload :ToLabel,               "#{__dir__}/markup/to_label"
-  autoload :ToMarkdown,            "#{__dir__}/markup/to_markdown"
-  autoload :ToRdoc,                "#{__dir__}/markup/to_rdoc"
-  autoload :ToTableOfContents,     "#{__dir__}/markup/to_table_of_contents"
-  autoload :ToTest,                "#{__dir__}/markup/to_test"
-  autoload :ToTtOnly,              "#{__dir__}/markup/to_tt_only"
-
-end
diff --git a/lib/rdoc/markup/attr_changer.rb b/lib/rdoc/markup/attr_changer.rb
deleted file mode 100644
index e5ba470bb6..0000000000
--- a/lib/rdoc/markup/attr_changer.rb
+++ /dev/null
@@ -1,22 +0,0 @@
-# frozen_string_literal: true
-class RDoc::Markup
-
-  AttrChanger = Struct.new :turn_on, :turn_off # :nodoc:
-
-end
-
-##
-# An AttrChanger records a change in attributes. It contains a bitmap of the
-# attributes to turn on, and a bitmap of those to turn off.
-
-class RDoc::Markup::AttrChanger
-
-  def to_s # :nodoc:
-    "Attr: +#{turn_on}/-#{turn_off}"
-  end
-
-  def inspect # :nodoc:
-    '+%d/-%d' % [turn_on, turn_off]
-  end
-
-end
diff --git a/lib/rdoc/markup/attr_span.rb b/lib/rdoc/markup/attr_span.rb
deleted file mode 100644
index f1fabf1c3b..0000000000
--- a/lib/rdoc/markup/attr_span.rb
+++ /dev/null
@@ -1,35 +0,0 @@
-# frozen_string_literal: true
-##
-# An array of attributes which parallels the characters in a string.
-
-class RDoc::Markup::AttrSpan
-
-  ##
-  # Creates a new AttrSpan for +length+ characters
-
-  def initialize(length, exclusive)
-    @attrs = Array.new(length, 0)
-    @exclusive = exclusive
-  end
-
-  ##
-  # Toggles +bits+ from +start+ to +length+
-  def set_attrs(start, length, bits)
-    updated = false
-    for i in start ... (start+length)
-      if (@exclusive & @attrs[i]) == 0 || (@exclusive & bits) != 0
-        @attrs[i] |= bits
-        updated = true
-      end
-    end
-    updated
-  end
-
-  ##
-  # Accesses flags for character +n+
-
-  def [](n)
-    @attrs[n]
-  end
-
-end
diff --git a/lib/rdoc/markup/attribute_manager.rb b/lib/rdoc/markup/attribute_manager.rb
deleted file mode 100644
index f6eb06da95..0000000000
--- a/lib/rdoc/markup/attribute_manager.rb
+++ /dev/null
@@ -1,405 +0,0 @@
-# frozen_string_literal: true
-
-##
-# Manages changes of attributes in a block of text
-
-class RDoc::Markup::AttributeManager
-  unless ::MatchData.method_defined?(:match_length)
-    using ::Module.new {
-      refine(::MatchData) {
-        def match_length(nth) # :nodoc:
-          b, e = offset(nth)
-          e - b if b
-        end
-      }
-    }
-  end
-
-  ##
-  # The NUL character
-
-  NULL = "\000".freeze
-
-  #--
-  # We work by substituting non-printing characters in to the text. For now
-  # I'm assuming that I can substitute a character in the range 0..8 for a 7
-  # bit character without damaging the encoded string, but this might be
-  # optimistic
-  #++
-
-  A_PROTECT = 004 # :nodoc:
-
-  ##
-  # Special mask character to prevent inline markup handling
-
-  PROTECT_ATTR = A_PROTECT.chr # :nodoc:
-
-  ##
-  # The attributes enabled for this markup object.
-
-  attr_reader :attributes
-
-  ##
-  # This maps delimiters that occur around words (such as *bold* or +tt+)
-  # where the start and end delimiters and the same. This lets us optimize
-  # the regexp
-
-  attr_reader :matching_word_pairs
-
-  ##
-  # And this is used when the delimiters aren't the same. In this case the
-  # hash maps a pattern to the attribute character
-
-  attr_reader :word_pair_map
-
-  ##
-  # This maps HTML tags to the corresponding attribute char
-
-  attr_reader :html_tags
-
-  ##
-  # A \ in front of a character that would normally be processed turns off
-  # processing. We do this by turning \< into <#{PROTECT}
-
-  attr_reader :protectable
-
-  ##
-  # And this maps _regexp handling_ sequences to a name. A regexp handling
-  # sequence is something like a WikiWord
-
-  attr_reader :regexp_handlings
-
-  ##
-  # A bits of exclusive maps
-  attr_reader :exclusive_bitmap
-
-  ##
-  # Creates a new attribute manager that understands bold, emphasized and
-  # teletype text.
-
-  def initialize
-    @html_tags = {}
-    @matching_word_pairs = {}
-    @protectable = %w[<]
-    @regexp_handlings = []
-    @word_pair_map = {}
-    @exclusive_bitmap = 0
-    @attributes = RDoc::Markup::Attributes.new
-
-    add_word_pair "*", "*", :BOLD, true
-    add_word_pair "_", "_", :EM, true
-    add_word_pair "+", "+", :TT, true
-
-    add_html "em", :EM, true
-    add_html "i",  :EM, true
-    add_html "b",  :BOLD, true
-    add_html "tt",   :TT, true
-    add_html "code", :TT, true
-  end
-
-  ##
-  # Return an attribute object with the given turn_on and turn_off bits set
-
-  def attribute(turn_on, turn_off)
-    RDoc::Markup::AttrChanger.new turn_on, turn_off
-  end
-
-  ##
-  # Changes the current attribute from +current+ to +new+
-
-  def change_attribute current, new
-    diff = current ^ new
-    attribute(new & diff, current & diff)
-  end
-
-  ##
-  # Used by the tests to change attributes by name from +current_set+ to
-  # +new_set+
-
-  def changed_attribute_by_name current_set, new_set
-    current = new = 0
-    current_set.each do |name|
-      current |= @attributes.bitmap_for(name)
-    end
-
-    new_set.each do |name|
-      new |= @attributes.bitmap_for(name)
-    end
-
-    change_attribute(current, new)
-  end
-
-  ##
-  # Copies +start_pos+ to +end_pos+ from the current string
-
-  def copy_string(start_pos, end_pos)
-    res = @str[start_pos...end_pos]
-    res.gsub!(/\000/, '')
-    res
-  end
-
-  # :nodoc:
-  def exclusive?(attr)
-    (attr & @exclusive_bitmap) != 0
-  end
-
-  NON_PRINTING_START = "\1" # :nodoc:
-  NON_PRINTING_END = "\2" # :nodoc:
-
-  ##
-  # Map attributes like <b>text</b>to the sequence
-  # \001\002<char>\001\003<char>, where <char> is a per-attribute specific
-  # character
-
-  def convert_attrs(str, attrs, exclusive = false)
-    convert_attrs_matching_word_pairs(str, attrs, exclusive)
-    convert_attrs_word_pair_map(str, attrs, exclusive)
-  end
-
-  # :nodoc:
-  def convert_attrs_matching_word_pairs(str, attrs, exclusive)
-    # first do matching ones
-    tags = @matching_word_pairs.select { |start, bitmap|
-      exclusive == exclusive?(bitmap)
-    }.keys
-    return if tags.empty?
-    tags = "[#{tags.join("")}](?!#{PROTECT_ATTR})"
-    all_tags = "[#{@matching_word_pairs.keys.join("")}](?!#{PROTECT_ATTR})"
-
-    re = /(?:^|\W|#{all_tags})\K(#{tags})(\1*[#\\]?[\w:#{PROTECT_ATTR}.\/\[\]-]+?\S?)\1(?!\1)(?=#{all_tags}|\W|$)/
-
-    1 while str.gsub!(re) { |orig|
-      a, w = (m = $~).values_at(1, 2)
-      attr = @matching_word_pairs[a]
-      if attrs.set_attrs(m.begin(2), w.length, attr)
-        a = NULL * a.length
-      else
-        a = NON_PRINTING_START + a + NON_PRINTING_END
-      end
-      a + w + a
-    }
-    str.delete!(NON_PRINTING_START + NON_PRINTING_END)
-  end
-
-  # :nodoc:
-  def convert_attrs_word_pair_map(str, attrs, exclusive)
-    # then non-matching
-    unless @word_pair_map.empty? then
-      @word_pair_map.each do |regexp, attr|
-        next unless exclusive == exclusive?(attr)
-        1 while str.gsub!(regexp) { |orig|
-          w = (m = ($~))[2]
-          updated = attrs.set_attrs(m.begin(2), w.length, attr)
-          if updated
-            NULL * m.match_length(1) + w + NULL * m.match_length(3)
-          else
-            orig
-          end
-        }
-      end
-    end
-  end
-
-  ##
-  # Converts HTML tags to RDoc attributes
-
-  def convert_html(str, attrs, exclusive = false)
-    tags = @html_tags.select { |start, bitmap|
-      exclusive == exclusive?(bitmap)
-    }.keys.join '|'
-
-    1 while str.gsub!(/<(#{tags})>(.*?)<\/\1>/i) { |orig|
-      attr = @html_tags[$1.downcase]
-      html_length = $~.match_length(1) + 2 # "<>".length
-      seq = NULL * html_length
-      attrs.set_attrs($~.begin(2), $~.match_length(2), attr)
-      seq + $2 + seq + NULL
-    }
-  end
-
-  ##
-  # Converts regexp handling sequences to RDoc attributes
-
-  def convert_regexp_handlings str, attrs, exclusive = false
-    @regexp_handlings.each do |regexp, attribute|
-      next unless exclusive == exclusive?(attribute)
-      str.scan(regexp) do
-        capture = $~.size == 1 ? 0 : 1
-
-        s, e = $~.offset capture
-
-        attrs.set_attrs s, e - s, attribute | @attributes.regexp_handling
-      end
-    end
-  end
-
-  ##
-  # Escapes regexp handling sequences of text to prevent conversion to RDoc
-
-  def mask_protected_sequences
-    # protect __send__, __FILE__, etc.
-    @str.gsub!(/__([a-z]+)__/i,
-      "_#{PROTECT_ATTR}_#{PROTECT_ATTR}\\1_#{PROTECT_ATTR}_#{PROTECT_ATTR}")
-    @str.gsub!(/(\A|[^\\])\\([#{Regexp.escape @protectable.join}])/m,
-               "\\1\\2#{PROTECT_ATTR}")
-    @str.gsub!(/\\(\\[#{Regexp.escape @protectable.join}])/m, "\\1")
-  end
-
-  ##
-  # Unescapes regexp handling sequences of text
-
-  def unmask_protected_sequences
-    @str.gsub!(/(.)#{PROTECT_ATTR}/, "\\1\000")
-  end
-
-  ##
-  # Adds a markup class with +name+ for words wrapped in the +start+ and
-  # +stop+ character.  To make words wrapped with "*" bold:
-  #
-  #   am.add_word_pair '*', '*', :BOLD
-
-  def add_word_pair(start, stop, name, exclusive = false)
-    raise ArgumentError, "Word flags may not start with '<'" if
-      start[0,1] == '<'
-
-    bitmap = @attributes.bitmap_for name
-
-    if start == stop then
-      @matching_word_pairs[start] = bitmap
-    else
-      pattern = /(#{Regexp.escape start})(\S+)(#{Regexp.escape stop})/
-      @word_pair_map[pattern] = bitmap
-    end
-
-    @protectable << start[0,1]
-    @protectable.uniq!
-
-    @exclusive_bitmap |= bitmap if exclusive
-  end
-
-  ##
-  # Adds a markup class with +name+ for words surrounded by HTML tag +tag+.
-  # To process emphasis tags:
-  #
-  #   am.add_html 'em', :EM
-
-  def add_html(tag, name, exclusive = false)
-    bitmap = @attributes.bitmap_for name
-    @html_tags[tag.downcase] = bitmap
-    @exclusive_bitmap |= bitmap if exclusive
-  end
-
-  ##
-  # Adds a regexp handling for +pattern+ with +name+.  A simple URL handler
-  # would be:
-  #
-  #   @am.add_regexp_handling(/((https?:)\S+\w)/, :HYPERLINK)
-
-  def add_regexp_handling pattern, name, exclusive = false
-    bitmap = @attributes.bitmap_for(name)
-    @regexp_handlings << [pattern, bitmap]
-    @exclusive_bitmap |= bitmap if exclusive
-  end
-
-  ##
-  # Processes +str+ converting attributes, HTML and regexp handlings
-
-  def flow str
-    @str = str.dup
-
-    mask_protected_sequences
-
-    @attrs = RDoc::Markup::AttrSpan.new @str.length, @exclusive_bitmap
-
-    convert_attrs            @str, @attrs, true
-    convert_html             @str, @attrs, true
-    convert_regexp_handlings @str, @attrs, true
-    convert_attrs            @str, @attrs
-    convert_html             @str, @attrs
-    convert_regexp_handlings @str, @attrs
-
-    unmask_protected_sequences
-
-    split_into_flow
-  end
-
-  ##
-  # Debug method that prints a string along with its attributes
-
-  def display_attributes
-    puts
-    puts @str.tr(NULL, "!")
-    bit = 1
-    16.times do |bno|
-      line = ""
-      @str.length.times do |i|
-        if (@attrs[i] & bit) == 0
-          line << " "
-        else
-          if bno.zero?
-            line << "S"
-          else
-            line << ("%d" % (bno+1))
-          end
-        end
-      end
-      puts(line) unless line =~ /^ *$/
-      bit <<= 1
-    end
-  end
-
-  ##
-  # Splits the string into chunks by attribute change
-
-  def split_into_flow
-    res = []
-    current_attr = 0
-
-    str_len = @str.length
-
-    # skip leading invisible text
-    i = 0
-    i += 1 while i < str_len and @str[i].chr == "\0"
-    start_pos = i
-
-    # then scan the string, chunking it on attribute changes
-    while i < str_len
-      new_attr = @attrs[i]
-      if new_attr != current_attr
-        if i > start_pos
-          res << copy_string(start_pos, i)
-          start_pos = i
-        end
-
-        res << change_attribute(current_attr, new_attr)
-        current_attr = new_attr
-
-        if (current_attr & @attributes.regexp_handling) != 0 then
-          i += 1 while
-            i < str_len and (@attrs[i] & @attributes.regexp_handling) != 0
-
-          res << RDoc::Markup::RegexpHandling.new(current_attr,
-                                                  copy_string(start_pos, i))
-          start_pos = i
-          next
-        end
-      end
-
-      # move on, skipping any invisible characters
-      begin
-        i += 1
-      end while i < str_len and @str[i].chr == "\0"
-    end
-
-    # tidy up trailing text
-    if start_pos < str_len
-      res << copy_string(start_pos, str_len)
-    end
-
-    # and reset to all attributes off
-    res << change_attribute(current_attr, 0) if current_attr != 0
-
-    res
-  end
-
-end
diff --git a/lib/rdoc/markup/attributes.rb b/lib/rdoc/markup/attributes.rb
deleted file mode 100644
index d9d18b3059..0000000000
--- a/lib/rdoc/markup/attributes.rb
+++ /dev/null
@@ -1,70 +0,0 @@
-# frozen_string_literal: true
-##
-# We manage a set of attributes.  Each attribute has a symbol name and a bit
-# value.
-
-class RDoc::Markup::Attributes
-
-  ##
-  # The regexp handling attribute type. See RDoc::Markup#add_regexp_handling
-
-  attr_reader :regexp_handling
-
-  ##
-  # Creates a new attributes set.
-
-  def initialize
-    @regexp_handling = 1
-
-    @name_to_bitmap = [
-      [:_REGEXP_HANDLING_, @regexp_handling],
-    ]
-
-    @next_bitmap = @regexp_handling << 1
-  end
-
-  ##
-  # Returns a unique bit for +name+
-
-  def bitmap_for name
-    bitmap = @name_to_bitmap.assoc name
-
-    unless bitmap then
-      bitmap = @next_bitmap
-      @next_bitmap <<= 1
-      @name_to_bitmap << [name, bitmap]
-    else
-      bitmap = bitmap.last
-    end
-
-    bitmap
-  end
-
-  ##
-  # Returns a string representation of +bitmap+
-
-  def as_string bitmap
-    return 'none' if bitmap.zero?
-    res = []
-
-    @name_to_bitmap.each do |name, bit|
-      res << name if (bitmap & bit) != 0
-    end
-
-    res.join ','
-  end
-
-  ##
-  # yields each attribute name in +bitmap+
-
-  def each_name_of bitmap
-    return enum_for __method__, bitmap unless block_given?
-
-    @name_to_bitmap.each do |name, bit|
-      next if bit == @regexp_handling
-
-      yield name.to_s if (bitmap & bit) != 0
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/blank_line.rb b/lib/rdoc/markup/blank_line.rb
deleted file mode 100644
index f63ae9479c..0000000000
--- a/lib/rdoc/markup/blank_line.rb
+++ /dev/null
@@ -1,27 +0,0 @@
-# frozen_string_literal: true
-##
-# An empty line.  This class is a singleton.
-
-class RDoc::Markup::BlankLine
-
-  @instance = new
-
-  ##
-  # RDoc::Markup::BlankLine is a singleton
-
-  def self.new
-    @instance
-  end
-
-  ##
-  # Calls #accept_blank_line on +visitor+
-
-  def accept visitor
-    visitor.accept_blank_line self
-  end
-
-  def pretty_print q # :nodoc:
-    q.text 'blankline'
-  end
-
-end
diff --git a/lib/rdoc/markup/block_quote.rb b/lib/rdoc/markup/block_quote.rb
deleted file mode 100644
index d9fcbf213c..0000000000
--- a/lib/rdoc/markup/block_quote.rb
+++ /dev/null
@@ -1,14 +0,0 @@
-# frozen_string_literal: true
-##
-# A quoted section which contains markup items.
-
-class RDoc::Markup::BlockQuote < RDoc::Markup::Raw
-
-  ##
-  # Calls #accept_block_quote on +visitor+
-
-  def accept visitor
-    visitor.accept_block_quote self
-  end
-
-end
diff --git a/lib/rdoc/markup/document.rb b/lib/rdoc/markup/document.rb
deleted file mode 100644
index 94cf6a3666..0000000000
--- a/lib/rdoc/markup/document.rb
+++ /dev/null
@@ -1,164 +0,0 @@
-# frozen_string_literal: true
-##
-# A Document containing lists, headings, paragraphs, etc.
-
-class RDoc::Markup::Document
-
-  include Enumerable
-
-  ##
-  # The file this document was created from.  See also
-  # RDoc::ClassModule#add_comment
-
-  attr_reader :file
-
-  ##
-  # If a heading is below the given level it will be omitted from the
-  # table_of_contents
-
-  attr_accessor :omit_headings_below
-
-  ##
-  # The parts of the Document
-
-  attr_reader :parts
-
-  ##
-  # Creates a new Document with +parts+
-
-  def initialize *parts
-    @parts = []
-    @parts.concat parts
-
-    @file = nil
-    @omit_headings_from_table_of_contents_below = nil
-  end
-
-  ##
-  # Appends +part+ to the document
-
-  def << part
-    case part
-    when RDoc::Markup::Document then
-      unless part.empty? then
-        parts.concat part.parts
-        parts << RDoc::Markup::BlankLine.new
-      end
-    when String then
-      raise ArgumentError,
-            "expected RDoc::Markup::Document and friends, got String" unless
-        part.empty?
-    else
-      parts << part
-    end
-  end
-
-  def == other # :nodoc:
-    self.class == other.class and
-      @file == other.file and
-      @parts == other.parts
-  end
-
-  ##
-  # Runs this document and all its #items through +visitor+
-
-  def accept visitor
-    visitor.start_accepting
-
-    visitor.accept_document self
-
-    visitor.end_accepting
-  end
-
-  ##
-  # Concatenates the given +parts+ onto the document
-
-  def concat parts
-    self.parts.concat parts
-  end
-
-  ##
-  # Enumerator for the parts of this document
-
-  def each &block
-    @parts.each(&block)
-  end
-
-  ##
-  # Does this document have no parts?
-
-  def empty?
-    @parts.empty? or (@parts.length == 1 and merged? and @parts.first.empty?)
-  end
-
-  ##
-  # The file this Document was created from.
-
-  def file= location
-    @file = case location
-            when RDoc::TopLevel then
-              location.relative_name
-            else
-              location
-            end
-  end
-
-  ##
-  # When this is a collection of documents (#file is not set and this document
-  # contains only other documents as its direct children) #merge replaces
-  # documents in this class with documents from +other+ when the file matches
-  # and adds documents from +other+ when the files do not.
-  #
-  # The information in +other+ is preferred over the receiver
-
-  def merge other
-    if empty? then
-      @parts = other.parts
-      return self
-    end
-
-    other.parts.each do |other_part|
-      self.parts.delete_if do |self_part|
-        self_part.file and self_part.file == other_part.file
-      end
-
-      self.parts << other_part
-    end
-
-    self
-  end
-
-  ##
-  # Does this Document contain other Documents?
-
-  def merged?
-    RDoc::Markup::Document === @parts.first
-  end
-
-  def pretty_print q # :nodoc:
-    start = @file ? "[doc (#{@file}): " : '[doc: '
-
-    q.group 2, start, ']' do
-      q.seplist @parts do |part|
-        q.pp part
-      end
-    end
-  end
-
-  ##
-  # Appends +parts+ to the document
-
-  def push *parts
-    self.parts.concat parts
-  end
-
-  ##
-  # Returns an Array of headings in the document.
-  #
-  # Require 'rdoc/markup/formatter' before calling this method.
-
-  def table_of_contents
-    accept RDoc::Markup::ToTableOfContents.to_toc
-  end
-
-end
diff --git a/lib/rdoc/markup/formatter.rb b/lib/rdoc/markup/formatter.rb
deleted file mode 100644
index 9daffaabb8..0000000000
--- a/lib/rdoc/markup/formatter.rb
+++ /dev/null
@@ -1,265 +0,0 @@
-# frozen_string_literal: true
-##
-# Base class for RDoc markup formatters
-#
-# Formatters are a visitor that converts an RDoc::Markup tree (from a comment)
-# into some kind of output.  RDoc ships with formatters for converting back to
-# rdoc, ANSI text, HTML, a Table of Contents and other formats.
-#
-# If you'd like to write your own Formatter use
-# RDoc::Markup::FormatterTestCase.  If you're writing a text-output formatter
-# use RDoc::Markup::TextFormatterTestCase which provides extra test cases.
-
-class RDoc::Markup::Formatter
-
-  ##
-  # Tag for inline markup containing a +bit+ for the bitmask and the +on+ and
-  # +off+ triggers.
-
-  InlineTag = Struct.new(:bit, :on, :off)
-
-  ##
-  # Converts a target url to one that is relative to a given path
-
-  def self.gen_relative_url path, target
-    from        = File.dirname path
-    to, to_file = File.split target
-
-    from = from.split "/"
-    to   = to.split "/"
-
-    from.delete '.'
-    to.delete '.'
-
-    while from.size > 0 and to.size > 0 and from[0] == to[0] do
-      from.shift
-      to.shift
-    end
-
-    from.fill ".."
-    from.concat to
-    from << to_file
-    File.join(*from)
-  end
-
-  ##
-  # Creates a new Formatter
-
-  def initialize options, markup = nil
-    @options = options
-
-    @markup = markup || RDoc::Markup.new
-    @am     = @markup.attribute_manager
-    @am.add_regexp_handling(/<br>/, :HARD_BREAK)
-
-    @attributes = @am.attributes
-
-    @attr_tags = []
-
-    @in_tt = 0
-    @tt_bit = @attributes.bitmap_for :TT
-
-    @hard_break = ''
-    @from_path = '.'
-  end
-
-  ##
-  # Adds +document+ to the output
-
-  def accept_document document
-    document.parts.each do |item|
-      case item
-      when RDoc::Markup::Document then # HACK
-        accept_document item
-      else
-        item.accept self
-      end
-    end
-  end
-
-  ##
-  # Adds a regexp handling for links of the form rdoc-...:
-
-  def add_regexp_handling_RDOCLINK
-    @markup.add_regexp_handling(/rdoc-[a-z]+:[^\s\]]+/, :RDOCLINK)
-  end
-
-  ##
-  # Adds a regexp handling for links of the form {<text>}[<url>] and
-  # <word>[<url>]
-
-  def add_regexp_handling_TIDYLINK
-    @markup.add_regexp_handling(/(?:
-                                  \{[^{}]*\} | # multi-word label
-                                  \b[^\s{}]+? # single-word label
-                                 )
-
-                                 \[\S+?\]     # link target
-                                /x, :TIDYLINK)
-  end
-
-  ##
-  # Add a new set of tags for an attribute. We allow separate start and end
-  # tags for flexibility
-
-  def add_tag(name, start, stop)
-    attr = @attributes.bitmap_for name
-    @attr_tags << InlineTag.new(attr, start, stop)
-  end
-
-  ##
-  # Allows +tag+ to be decorated with additional information.
-
-  def annotate(tag)
-    tag
-  end
-
-  ##
-  # Marks up +content+
-
-  def convert content
-    @markup.convert content, self
-  end
-
-  ##
-  # Converts flow items +flow+
-
-  def convert_flow(flow)
-    res = []
-
-    flow.each do |item|
-      case item
-      when String then
-        res << convert_string(item)
-      when RDoc::Markup::AttrChanger then
-        off_tags res, item
-        on_tags res, item
-      when RDoc::Markup::RegexpHandling then
-        res << convert_regexp_handling(item)
-      else
-        raise "Unknown flow element: #{item.inspect}"
-      end
-    end
-
-    res.join
-  end
-
-  ##
-  # Converts added regexp handlings. See RDoc::Markup#add_regexp_handling
-
-  def convert_regexp_handling target
-    return target.text if in_tt?
-
-    handled = false
-
-    @attributes.each_name_of target.type do |name|
-      method_name = "handle_regexp_#{name}"
-
-      if respond_to? method_name then
-        target.text = public_send method_name, target
-        handled = true
-      end
-    end
-
-    unless handled then
-      target_name = @attributes.as_string target.type
-
-      raise RDoc::Error, "Unhandled regexp handling #{target_name}: #{target}"
-    end
-
-    target.text
-  end
-
-  ##
-  # Converts a string to be fancier if desired
-
-  def convert_string string
-    string
-  end
-
-  ##
-  # Use ignore in your subclass to ignore the content of a node.
-  #
-  #   ##
-  #   # We don't support raw nodes in ToNoRaw
-  #
-  #   alias accept_raw ignore
-
-  def ignore *node
-  end
-
-  ##
-  # Are we currently inside tt tags?
-
-  def in_tt?
-    @in_tt > 0
-  end
-
-  ##
-  # Turns on tags for +item+ on +res+
-
-  def on_tags res, item
-    attr_mask = item.turn_on
-    return if attr_mask.zero?
-
-    @attr_tags.each do |tag|
-      if attr_mask & tag.bit != 0 then
-        res << annotate(tag.on)
-        @in_tt += 1 if tt? tag
-      end
-    end
-  end
-
-  ##
-  # Turns off tags for +item+ on +res+
-
-  def off_tags res, item
-    attr_mask = item.turn_off
-    return if attr_mask.zero?
-
-    @attr_tags.reverse_each do |tag|
-      if attr_mask & tag.bit != 0 then
-        @in_tt -= 1 if tt? tag
-        res << annotate(tag.off)
-      end
-    end
-  end
-
-  ##
-  # Extracts and a scheme, url and an anchor id from +url+ and returns them.
-
-  def parse_url url
-    case url
-    when /^rdoc-label:([^:]*)(?::(.*))?/ then
-      scheme = 'link'
-      path   = "##{$1}"
-      id     = " id=\"#{$2}\"" if $2
-    when /([A-Za-z]+):(.*)/ then
-      scheme = $1.downcase
-      path   = $2
-    when /^#/ then
-    else
-      scheme = 'http'
-      path   = url
-      url    = url
-    end
-
-    if scheme == 'link' then
-      url = if path[0, 1] == '#' then # is this meaningful?
-              path
-            else
-              self.class.gen_relative_url @from_path, path
-            end
-    end
-
-    [scheme, url, id]
-  end
-
-  ##
-  # Is +tag+ a tt tag?
-
-  def tt? tag
-    tag.bit == @tt_bit
-  end
-
-end
diff --git a/lib/rdoc/markup/hard_break.rb b/lib/rdoc/markup/hard_break.rb
deleted file mode 100644
index de1819c903..0000000000
--- a/lib/rdoc/markup/hard_break.rb
+++ /dev/null
@@ -1,31 +0,0 @@
-# frozen_string_literal: true
-##
-# A hard-break in the middle of a paragraph.
-
-class RDoc::Markup::HardBreak
-
-  @instance = new
-
-  ##
-  # RDoc::Markup::HardBreak is a singleton
-
-  def self.new
-    @instance
-  end
-
-  ##
-  # Calls #accept_hard_break on +visitor+
-
-  def accept visitor
-    visitor.accept_hard_break self
-  end
-
-  def == other # :nodoc:
-    self.class === other
-  end
-
-  def pretty_print q # :nodoc:
-    q.text "[break]"
-  end
-
-end
diff --git a/lib/rdoc/markup/heading.rb b/lib/rdoc/markup/heading.rb
deleted file mode 100644
index 02476e5226..0000000000
--- a/lib/rdoc/markup/heading.rb
+++ /dev/null
@@ -1,78 +0,0 @@
-# frozen_string_literal: true
-##
-# A heading with a level (1-6) and text
-
-RDoc::Markup::Heading =
-  Struct.new :level, :text do
-
-  @to_html = nil
-  @to_label = nil
-
-  ##
-  # A singleton RDoc::Markup::ToLabel formatter for headings.
-
-  def self.to_label
-    @to_label ||= RDoc::Markup::ToLabel.new
-  end
-
-  ##
-  # A singleton plain HTML formatter for headings.  Used for creating labels
-  # for the Table of Contents
-
-  def self.to_html
-    return @to_html if @to_html
-
-    markup = RDoc::Markup.new
-    markup.add_regexp_handling RDoc::CrossReference::CROSSREF_REGEXP, :CROSSREF
-
-    @to_html = RDoc::Markup::ToHtml.new nil
-
-    def @to_html.handle_regexp_CROSSREF target
-      target.text.sub(/^\\/, '')
-    end
-
-    @to_html
-  end
-
-  ##
-  # Calls #accept_heading on +visitor+
-
-  def accept visitor
-    visitor.accept_heading self
-  end
-
-  ##
-  # An HTML-safe anchor reference for this header.
-
-  def aref
-    "label-#{self.class.to_label.convert text.dup}"
-  end
-
-  ##
-  # Creates a fully-qualified label which will include the label from
-  # +context+.  This helps keep ids unique in HTML.
-
-  def label context = nil
-    label = aref
-
-    label = [context.aref, label].compact.join '-' if
-      context and context.respond_to? :aref
-
-    label
-  end
-
-  ##
-  # HTML markup of the text of this label without the surrounding header
-  # element.
-
-  def plain_html
-    self.class.to_html.to_html(text.dup)
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[head: #{level} ", ']' do
-      q.pp text
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/include.rb b/lib/rdoc/markup/include.rb
deleted file mode 100644
index 2bf63526b2..0000000000
--- a/lib/rdoc/markup/include.rb
+++ /dev/null
@@ -1,42 +0,0 @@
-# frozen_string_literal: true
-##
-# A file included at generation time.  Objects of this class are created by
-# RDoc::RD for an extension-less include.
-#
-# This implementation in incomplete.
-
-class RDoc::Markup::Include
-
-  ##
-  # The filename to be included, without extension
-
-  attr_reader :file
-
-  ##
-  # Directories to search for #file
-
-  attr_reader :include_path
-
-  ##
-  # Creates a new include that will import +file+ from +include_path+
-
-  def initialize file, include_path
-    @file = file
-    @include_path = include_path
-  end
-
-  def == other # :nodoc:
-    self.class === other and
-      @file == other.file and @include_path == other.include_path
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, '[incl ', ']' do
-      q.text file
-      q.breakable
-      q.text 'from '
-      q.pp include_path
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/indented_paragraph.rb b/lib/rdoc/markup/indented_paragraph.rb
deleted file mode 100644
index 992cd7cf81..0000000000
--- a/lib/rdoc/markup/indented_paragraph.rb
+++ /dev/null
@@ -1,47 +0,0 @@
-# frozen_string_literal: true
-##
-# An Indented Paragraph of text
-
-class RDoc::Markup::IndentedParagraph < RDoc::Markup::Raw
-
-  ##
-  # The indent in number of spaces
-
-  attr_reader :indent
-
-  ##
-  # Creates a new IndentedParagraph containing +parts+ indented with +indent+
-  # spaces
-
-  def initialize indent, *parts
-    @indent = indent
-
-    super(*parts)
-  end
-
-  def == other # :nodoc:
-    super and indent == other.indent
-  end
-
-  ##
-  # Calls #accept_indented_paragraph on +visitor+
-
-  def accept visitor
-    visitor.accept_indented_paragraph self
-  end
-
-  ##
-  # Joins the raw paragraph text and converts inline HardBreaks to the
-  # +hard_break+ text followed by the indent.
-
-  def text hard_break = nil
-    @parts.map do |part|
-      if RDoc::Markup::HardBreak === part then
-        '%1$s%3$*2$s' % [hard_break, @indent, ' '] if hard_break
-      else
-        part
-      end
-    end.join
-  end
-
-end
diff --git a/lib/rdoc/markup/list.rb b/lib/rdoc/markup/list.rb
deleted file mode 100644
index 112b7a1a86..0000000000
--- a/lib/rdoc/markup/list.rb
+++ /dev/null
@@ -1,101 +0,0 @@
-# frozen_string_literal: true
-##
-# A List is a homogeneous set of ListItems.
-#
-# The supported list types include:
-#
-# :BULLET::
-#   An unordered list
-# :LABEL::
-#   An unordered definition list, but using an alternate RDoc::Markup syntax
-# :LALPHA::
-#   An ordered list using increasing lowercase English letters
-# :NOTE::
-#   An unordered definition list
-# :NUMBER::
-#   An ordered list using increasing Arabic numerals
-# :UALPHA::
-#   An ordered list using increasing uppercase English letters
-#
-# Definition lists behave like HTML definition lists.  Each list item can
-# describe multiple terms.  See RDoc::Markup::ListItem for how labels and
-# definition are stored as list items.
-
-class RDoc::Markup::List
-
-  ##
-  # The list's type
-
-  attr_accessor :type
-
-  ##
-  # Items in the list
-
-  attr_reader :items
-
-  ##
-  # Creates a new list of +type+ with +items+.  Valid list types are:
-  # +:BULLET+, +:LABEL+, +:LALPHA+, +:NOTE+, +:NUMBER+, +:UALPHA+
-
-  def initialize type = nil, *items
-    @type = type
-    @items = []
-    @items.concat items
-  end
-
-  ##
-  # Appends +item+ to the list
-
-  def << item
-    @items << item
-  end
-
-  def == other # :nodoc:
-    self.class == other.class and
-      @type == other.type and
-      @items == other.items
-  end
-
-  ##
-  # Runs this list and all its #items through +visitor+
-
-  def accept visitor
-    visitor.accept_list_start self
-
-    @items.each do |item|
-      item.accept visitor
-    end
-
-    visitor.accept_list_end self
-  end
-
-  ##
-  # Is the list empty?
-
-  def empty?
-    @items.empty?
-  end
-
-  ##
-  # Returns the last item in the list
-
-  def last
-    @items.last
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[list: #{@type} ", ']' do
-      q.seplist @items do |item|
-        q.pp item
-      end
-    end
-  end
-
-  ##
-  # Appends +items+ to the list
-
-  def push *items
-    @items.concat items
-  end
-
-end
diff --git a/lib/rdoc/markup/list_item.rb b/lib/rdoc/markup/list_item.rb
deleted file mode 100644
index 0b8326a69f..0000000000
--- a/lib/rdoc/markup/list_item.rb
+++ /dev/null
@@ -1,99 +0,0 @@
-# frozen_string_literal: true
-##
-# An item within a List that contains paragraphs, headings, etc.
-#
-# For BULLET, NUMBER, LALPHA and UALPHA lists, the label will always be nil.
-# For NOTE and LABEL lists, the list label may contain:
-#
-# * a single String for a single label
-# * an Array of Strings for a list item with multiple terms
-# * nil for an extra description attached to a previously labeled list item
-
-class RDoc::Markup::ListItem
-
-  ##
-  # The label for the ListItem
-
-  attr_accessor :label
-
-  ##
-  # Parts of the ListItem
-
-  attr_reader :parts
-
-  ##
-  # Creates a new ListItem with an optional +label+ containing +parts+
-
-  def initialize label = nil, *parts
-    @label = label
-    @parts = []
-    @parts.concat parts
-  end
-
-  ##
-  # Appends +part+ to the ListItem
-
-  def << part
-    @parts << part
-  end
-
-  def == other # :nodoc:
-    self.class == other.class and
-      @label == other.label and
-      @parts == other.parts
-  end
-
-  ##
-  # Runs this list item and all its #parts through +visitor+
-
-  def accept visitor
-    visitor.accept_list_item_start self
-
-    @parts.each do |part|
-      part.accept visitor
-    end
-
-    visitor.accept_list_item_end self
-  end
-
-  ##
-  # Is the ListItem empty?
-
-  def empty?
-    @parts.empty?
-  end
-
-  ##
-  # Length of parts in the ListItem
-
-  def length
-    @parts.length
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, '[item: ', ']' do
-      case @label
-      when Array then
-        q.pp @label
-        q.text ';'
-        q.breakable
-      when String then
-        q.pp @label
-        q.text ';'
-        q.breakable
-      end
-
-      q.seplist @parts do |part|
-        q.pp part
-      end
-    end
-  end
-
-  ##
-  # Adds +parts+ to the ListItem
-
-  def push *parts
-    @parts.concat parts
-  end
-
-end
diff --git a/lib/rdoc/markup/paragraph.rb b/lib/rdoc/markup/paragraph.rb
deleted file mode 100644
index 21dfda007a..0000000000
--- a/lib/rdoc/markup/paragraph.rb
+++ /dev/null
@@ -1,28 +0,0 @@
-# frozen_string_literal: true
-##
-# A Paragraph of text
-
-class RDoc::Markup::Paragraph < RDoc::Markup::Raw
-
-  ##
-  # Calls #accept_paragraph on +visitor+
-
-  def accept visitor
-    visitor.accept_paragraph self
-  end
-
-  ##
-  # Joins the raw paragraph text and converts inline HardBreaks to the
-  # +hard_break+ text.
-
-  def text hard_break = ''
-    @parts.map do |part|
-      if RDoc::Markup::HardBreak === part then
-        hard_break
-      else
-        part
-      end
-    end.join
-  end
-
-end
diff --git a/lib/rdoc/markup/parser.rb b/lib/rdoc/markup/parser.rb
deleted file mode 100644
index 9c77048591..0000000000
--- a/lib/rdoc/markup/parser.rb
+++ /dev/null
@@ -1,585 +0,0 @@
-# frozen_string_literal: true
-require 'strscan'
-
-##
-# A recursive-descent parser for RDoc markup.
-#
-# The parser tokenizes an input string then parses the tokens into a Document.
-# Documents can be converted into output formats by writing a visitor like
-# RDoc::Markup::ToHTML.
-#
-# The parser only handles the block-level constructs Paragraph, List,
-# ListItem, Heading, Verbatim, BlankLine, Rule and BlockQuote.
-# Inline markup such as <tt>\+blah\+</tt> is handled separately by
-# RDoc::Markup::AttributeManager.
-#
-# To see what markup the Parser implements read RDoc.  To see how to use
-# RDoc markup to format text in your program read RDoc::Markup.
-
-class RDoc::Markup::Parser
-
-  include RDoc::Text
-
-  ##
-  # List token types
-
-  LIST_TOKENS = [
-    :BULLET,
-    :LABEL,
-    :LALPHA,
-    :NOTE,
-    :NUMBER,
-    :UALPHA,
-  ]
-
-  ##
-  # Parser error subclass
-
-  class Error < RuntimeError; end
-
-  ##
-  # Raised when the parser is unable to handle the given markup
-
-  class ParseError < Error; end
-
-  ##
-  # Enables display of debugging information
-
-  attr_accessor :debug
-
-  ##
-  # Token accessor
-
-  attr_reader :tokens
-
-  ##
-  # Parses +str+ into a Document.
-  #
-  # Use RDoc::Markup#parse instead of this method.
-
-  def self.parse str
-    parser = new
-    parser.tokenize str
-    doc = RDoc::Markup::Document.new
-    parser.parse doc
-  end
-
-  ##
-  # Returns a token stream for +str+, for testing
-
-  def self.tokenize str
-    parser = new
-    parser.tokenize str
-    parser.tokens
-  end
-
-  ##
-  # Creates a new Parser.  See also ::parse
-
-  def initialize
-    @binary_input   = nil
-    @current_token  = nil
-    @debug          = false
-    @s              = nil
-    @tokens         = []
-  end
-
-  ##
-  # Builds a Heading of +level+
-
-  def build_heading level
-    type, text, = get
-
-    text = case type
-           when :TEXT then
-             skip :NEWLINE
-             text
-           else
-             unget
-             ''
-           end
-
-    RDoc::Markup::Heading.new level, text
-  end
-
-  ##
-  # Builds a List flush to +margin+
-
-  def build_list margin
-    p :list_start => margin if @debug
-
-    list = RDoc::Markup::List.new
-    label = nil
-
-    until @tokens.empty? do
-      type, data, column, = get
-
-      case type
-      when *LIST_TOKENS then
-        if column < margin || (list.type && list.type != type) then
-          unget
-          break
-        end
-
-        list.type = type
-        peek_type, _, column, = peek_token
-
-        case type
-        when :NOTE, :LABEL then
-          label = [] unless label
-
-          if peek_type == :NEWLINE then
-            # description not on the same line as LABEL/NOTE
-            # skip the trailing newline & any blank lines below
-            while peek_type == :NEWLINE
-              get
-              peek_type, _, column, = peek_token
-            end
-
-            # we may be:
-            #   - at end of stream
-            #   - at a column < margin:
-            #         [text]
-            #       blah blah blah
-            #   - at the same column, but with a different type of list item
-            #       [text]
-            #       * blah blah
-            #   - at the same column, with the same type of list item
-            #       [one]
-            #       [two]
-            # In all cases, we have an empty description.
-            # In the last case only, we continue.
-            if peek_type.nil? || column < margin then
-              empty = true
-            elsif column == margin then
-              case peek_type
-              when type
-                empty = :continue
-              when *LIST_TOKENS
-                empty = true
-              else
-                empty = false
-              end
-            else
-              empty = false
-            end
-
-            if empty then
-              label << data
-              next if empty == :continue
-              break
-            end
-          end
-        else
-          data = nil
-        end
-
-        if label then
-          data = label << data
-          label = nil
-        end
-
-        list_item = RDoc::Markup::ListItem.new data
-        parse list_item, column
-        list << list_item
-
-      else
-        unget
-        break
-      end
-    end
-
-    p :list_end => margin if @debug
-
-    if list.empty? then
-      return nil unless label
-      return nil unless [:LABEL, :NOTE].include? list.type
-
-      list_item = RDoc::Markup::ListItem.new label, RDoc::Markup::BlankLine.new
-      list << list_item
-    end
-
-    list
-  end
-
-  ##
-  # Builds a Paragraph that is flush to +margin+
-
-  def build_paragraph margin
-    p :paragraph_start => margin if @debug
-
-    paragraph = RDoc::Markup::Paragraph.new
-
-    until @tokens.empty? do
-      type, data, column, = get
-
-      if type == :TEXT and column == margin then
-        paragraph << data
-
-        break if peek_token.first == :BREAK
-
-        data << ' ' if skip :NEWLINE and /#{SPACE_SEPARATED_LETTER_CLASS}\z/o.match?(data)
-      else
-        unget
-        break
-      end
-    end
-
-    paragraph.parts.last.sub!(/ \z/, '') # cleanup
-
-    p :paragraph_end => margin if @debug
-
-    paragraph
-  end
-
-  ##
-  # Builds a Verbatim that is indented from +margin+.
-  #
-  # The verbatim block is shifted left (the least indented lines start in
-  # column 0).  Each part of the verbatim is one line of text, always
-  # terminated by a newline.  Blank lines always consist of a single newline
-  # character, and there is never a single newline at the end of the verbatim.
-
-  def build_verbatim margin
-    p :verbatim_begin => margin if @debug
-    verbatim = RDoc::Markup::Verbatim.new
-
-    min_indent = nil
-    generate_leading_spaces = true
-    line = ''.dup
-
-    until @tokens.empty? do
-      type, data, column, = get
-
-      if type == :NEWLINE then
-        line << data
-        verbatim << line
-        line = ''.dup
-        generate_leading_spaces = true
-        next
-      end
-
-      if column <= margin
-        unget
-        break
-      end
-
-      if generate_leading_spaces then
-        indent = column - margin
-        line << ' ' * indent
-        min_indent = indent if min_indent.nil? || indent < min_indent
-        generate_leading_spaces = false
-      end
-
-      case type
-      when :HEADER then
-        line << '=' * data
-        _, _, peek_column, = peek_token
-        peek_column ||= column + data
-        indent = peek_column - column - data
-        line << ' ' * indent
-      when :RULE then
-        width = 2 + data
-        line << '-' * width
-        _, _, peek_column, = peek_token
-        peek_column ||= column + width
-        indent = peek_column - column - width
-        line << ' ' * indent
-      when :BREAK, :TEXT then
-        line << data
-      when :BLOCKQUOTE then
-        line << '>>>'
-        peek_type, _, peek_column = peek_token
-        if peek_type != :NEWLINE and peek_column
-          line << ' ' * (peek_column - column - 3)
-        end
-      else # *LIST_TOKENS
-        list_marker = case type
-                      when :BULLET then data
-                      when :LABEL  then "[#{data}]"
-                      when :NOTE   then "#{data}::"
-                      else # :LALPHA, :NUMBER, :UALPHA
-                        "#{data}."
-                      end
-        line << list_marker
-        peek_type, _, peek_column = peek_token
-        unless peek_type == :NEWLINE then
-          peek_column ||= column + list_marker.length
-          indent = peek_column - column - list_marker.length
-          line << ' ' * indent
-        end
-      end
-
-    end
-
-    verbatim << line << "\n" unless line.empty?
-    verbatim.parts.each { |p| p.slice!(0, min_indent) unless p == "\n" } if min_indent > 0
-    verbatim.normalize
-
-    p :verbatim_end => margin if @debug
-
-    verbatim
-  end
-
-  ##
-  # Pulls the next token from the stream.
-
-  def get
-    @current_token = @tokens.shift
-    p :get => @current_token if @debug
-    @current_token
-  end
-
-  ##
-  # Parses the tokens into an array of RDoc::Markup::XXX objects,
-  # and appends them to the passed +parent+ RDoc::Markup::YYY object.
-  #
-  # Exits at the end of the token stream, or when it encounters a token
-  # in a column less than +indent+ (unless it is a NEWLINE).
-  #
-  # Returns +parent+.
-
-  def parse parent, indent = 0
-    p :parse_start => indent if @debug
-
-    until @tokens.empty? do
-      type, data, column, = get
-
-      case type
-      when :BREAK then
-        parent << RDoc::Markup::BlankLine.new
-        skip :NEWLINE, false
-        next
-      when :NEWLINE then
-        # trailing newlines are skipped below, so this is a blank line
-        parent << RDoc::Markup::BlankLine.new
-        skip :NEWLINE, false
-        next
-      end
-
-      # indentation change: break or verbatim
-      if column < indent then
-        unget
-        break
-      elsif column > indent then
-        unget
-        parent << build_verbatim(indent)
-        next
-      end
-
-      # indentation is the same
-      case type
-      when :HEADER then
-        parent << build_heading(data)
-      when :RULE then
-        parent << RDoc::Markup::Rule.new(data)
-        skip :NEWLINE
-      when :TEXT then
-        unget
-        parse_text parent, indent
-      when :BLOCKQUOTE then
-        nil while (type, = get; type) and type != :NEWLINE
-        _, _, column, = peek_token
-        bq = RDoc::Markup::BlockQuote.new
-        p :blockquote_start => [data, column] if @debug
-        parse bq, column
-        p :blockquote_end => indent if @debug
-        parent << bq
-      when *LIST_TOKENS then
-        unget
-        parent << build_list(indent)
-      else
-        type, data, column, line = @current_token
-        raise ParseError, "Unhandled token #{type} (#{data.inspect}) at #{line}:#{column}"
-      end
-    end
-
-    p :parse_end => indent if @debug
-
-    parent
-
-  end
-
-  ##
-  # Small hook that is overridden by RDoc::TomDoc
-
-  def parse_text parent, indent # :nodoc:
-    parent << build_paragraph(indent)
-  end
-
-  ##
-  # Returns the next token on the stream without modifying the stream
-
-  def peek_token
-    token = @tokens.first || []
-    p :peek => token if @debug
-    token
-  end
-
-  ##
-  # A simple wrapper of StringScanner that is aware of the current column and lineno
-
-  class MyStringScanner
-    # :stopdoc:
-
-    def initialize(input)
-      @line = @column = 0
-      @s = StringScanner.new input
-    end
-
-    def scan(re)
-      ret = @s.scan(re)
-      @column += ret.length if ret
-      ret
-    end
-
-    def unscan(s)
-      @s.pos -= s.bytesize
-      @column -= s.length
-    end
-
-    def pos
-      [@column, @line]
-    end
-
-    def newline!
-      @column = 0
-      @line += 1
-    end
-
-    def eos?
-      @s.eos?
-    end
-
-    def matched
-      @s.matched
-    end
-
-    def [](i)
-      @s[i]
-    end
-
-    #:startdoc:
-  end
-
-  ##
-  # Creates the StringScanner
-
-  def setup_scanner input
-    @s = MyStringScanner.new input
-  end
-
-  ##
-  # Skips the next token if its type is +token_type+.
-  #
-  # Optionally raises an error if the next token is not of the expected type.
-
-  def skip token_type, error = true
-    type, = get
-    return unless type # end of stream
-    return @current_token if token_type == type
-    unget
-    raise ParseError, "expected #{token_type} got #{@current_token.inspect}" if error
-  end
-
-  ##
-  # Turns text +input+ into a stream of tokens
-
-  def tokenize input
-    setup_scanner input
-
-    until @s.eos? do
-      pos = @s.pos
-
-      # leading spaces will be reflected by the column of the next token
-      # the only thing we loose are trailing spaces at the end of the file
-      next if @s.scan(/ +/)
-
-      # note: after BULLET, LABEL, etc.,
-      # indent will be the column of the next non-newline token
-
-      @tokens << case
-                 # [CR]LF => :NEWLINE
-                 when @s.scan(/\r?\n/) then
-                   token = [:NEWLINE, @s.matched, *pos]
-                   @s.newline!
-                   token
-                 # === text => :HEADER then :TEXT
-                 when @s.scan(/(=+)(\s*)/) then
-                   level = @s[1].length
-                   header = [:HEADER, level, *pos]
-
-                   if @s[2] =~ /^\r?\n/ then
-                     @s.unscan(@s[2])
-                     header
-                   else
-                     pos = @s.pos
-                     @s.scan(/.*/)
-                     @tokens << header
-                     [:TEXT, @s.matched.sub(/\r$/, ''), *pos]
-                   end
-                 # --- (at least 3) and nothing else on the line => :RULE
-                 when @s.scan(/(-{3,}) *\r?$/) then
-                   [:RULE, @s[1].length - 2, *pos]
-                 # * or - followed by white space and text => :BULLET
-                 when @s.scan(/([*-]) +(\S)/) then
-                   @s.unscan(@s[2])
-                   [:BULLET, @s[1], *pos]
-                 # A. text, a. text, 12. text => :UALPHA, :LALPHA, :NUMBER
-                 when @s.scan(/([a-z]|\d+)\. +(\S)/i) then
-                   # FIXME if tab(s), the column will be wrong
-                   # either support tabs everywhere by first expanding them to
-                   # spaces, or assume that they will have been replaced
-                   # before (and provide a check for that at least in debug
-                   # mode)
-                   list_label = @s[1]
-                   @s.unscan(@s[2])
-                   list_type =
-                     case list_label
-                     when /[a-z]/ then :LALPHA
-                     when /[A-Z]/ then :UALPHA
-                     when /\d/    then :NUMBER
-                     else
-                       raise ParseError, "BUG token #{list_label}"
-                     end
-                   [list_type, list_label, *pos]
-                 # [text] followed by spaces or end of line => :LABEL
-                 when @s.scan(/\[(.*?)\]( +|\r?$)/) then
-                   [:LABEL, @s[1], *pos]
-                 # text:: followed by spaces or end of line => :NOTE
-                 when @s.scan(/(.*?)::( +|\r?$)/) then
-                   [:NOTE, @s[1], *pos]
-                 # >>> followed by end of line => :BLOCKQUOTE
-                 when @s.scan(/>>> *(\w+)?$/) then
-                   if word = @s[1]
-                     @s.unscan(word)
-                   end
-                   [:BLOCKQUOTE, word, *pos]
-                 # anything else: :TEXT
-                 else
-                   @s.scan(/(.*?)(  )?\r?$/)
-                   token = [:TEXT, @s[1], *pos]
-
-                   if @s[2] then
-                     @tokens << token
-                     [:BREAK, @s[2], pos[0] + @s[1].length, pos[1]]
-                   else
-                     token
-                   end
-                 end
-    end
-
-    self
-  end
-
-  ##
-  # Returns the current token to the token stream
-
-  def unget
-    token = @current_token
-    p :unget => token if @debug
-    raise Error, 'too many #ungets' if token == @tokens.first
-    @tokens.unshift token if token
-  end
-
-end
diff --git a/lib/rdoc/markup/pre_process.rb b/lib/rdoc/markup/pre_process.rb
deleted file mode 100644
index 88078c9cef..0000000000
--- a/lib/rdoc/markup/pre_process.rb
+++ /dev/null
@@ -1,298 +0,0 @@
-# frozen_string_literal: true
-##
-# Handle common directives that can occur in a block of text:
-#
-#   \:include: filename
-#
-# Directives can be escaped by preceding them with a backslash.
-#
-# RDoc plugin authors can register additional directives to be handled by
-# using RDoc::Markup::PreProcess::register.
-#
-# Any directive that is not built-in to RDoc (including those registered via
-# plugins) will be stored in the metadata hash on the CodeObject the comment
-# is attached to.  See RDoc::Markup@Directives for the list of built-in
-# directives.
-
-class RDoc::Markup::PreProcess
-
-  ##
-  # An RDoc::Options instance that will be filled in with overrides from
-  # directives
-
-  attr_accessor :options
-
-  ##
-  # Adds a post-process handler for directives.  The handler will be called
-  # with the result RDoc::Comment (or text String) and the code object for the
-  # comment (if any).
-
-  def self.post_process &block
-    @post_processors << block
-  end
-
-  ##
-  # Registered post-processors
-
-  def self.post_processors
-    @post_processors
-  end
-
-  ##
-  # Registers +directive+ as one handled by RDoc.  If a block is given the
-  # directive will be replaced by the result of the block, otherwise the
-  # directive will be removed from the processed text.
-  #
-  # The block will be called with the directive name and the directive
-  # parameter:
-  #
-  #   RDoc::Markup::PreProcess.register 'my-directive' do |directive, param|
-  #     # replace text, etc.
-  #   end
-
-  def self.register directive, &block
-    @registered[directive] = block
-  end
-
-  ##
-  # Registered directives
-
-  def self.registered
-    @registered
-  end
-
-  ##
-  # Clears all registered directives and post-processors
-
-  def self.reset
-    @post_processors = []
-    @registered = {}
-  end
-
-  reset
-
-  ##
-  # Creates a new pre-processor for +input_file_name+ that will look for
-  # included files in +include_path+
-
-  def initialize(input_file_name, include_path)
-    @input_file_name = input_file_name
-    @include_path = include_path
-    @options = nil
-  end
-
-  ##
-  # Look for directives in the given +text+.
-  #
-  # Options that we don't handle are yielded.  If the block returns false the
-  # directive is restored to the text.  If the block returns nil or no block
-  # was given the directive is handled according to the registered directives.
-  # If a String was returned the directive is replaced with the string.
-  #
-  # If no matching directive was registered the directive is restored to the
-  # text.
-  #
-  # If +code_object+ is given and the directive is unknown then the
-  # directive's parameter is set as metadata on the +code_object+.  See
-  # RDoc::CodeObject#metadata for details.
-
-  def handle text, code_object = nil, &block
-    if RDoc::Comment === text then
-      comment = text
-      text = text.text
-    end
-
-    # regexp helper (square brackets for optional)
-    # $1      $2  $3        $4      $5
-    # [prefix][\]:directive:[spaces][param]newline
-    text = text.gsub(/^([ \t]*(?:#|\/?\*)?[ \t]*)(\\?):(\w+):([ \t]*)(.+)?(\r?\n|$)/) do
-      # skip something like ':toto::'
-      next $& if $4.empty? and $5 and $5[0, 1] == ':'
-
-      # skip if escaped
-      next "#$1:#$3:#$4#$5\n" unless $2.empty?
-
-      # This is not in handle_directive because I didn't want to pass another
-      # argument into it
-      if comment and $3 == 'markup' then
-        next "#{$1.strip}\n" unless $5
-        comment.format = $5.downcase
-        next "#{$1.strip}\n"
-      end
-
-      handle_directive $1, $3, $5, code_object, text.encoding, &block
-    end
-
-    if comment then
-      comment.text = text
-    else
-      comment = text
-    end
-
-    self.class.post_processors.each do |handler|
-      handler.call comment, code_object
-    end
-
-    text
-  end
-
-  ##
-  # Performs the actions described by +directive+ and its parameter +param+.
-  #
-  # +code_object+ is used for directives that operate on a class or module.
-  # +prefix+ is used to ensure the replacement for handled directives is
-  # correct.  +encoding+ is used for the <tt>include</tt> directive.
-  #
-  # For a list of directives in RDoc see RDoc::Markup.
-  #--
-  # When 1.8.7 support is ditched prefix can be defaulted to ''
-
-  def handle_directive prefix, directive, param, code_object = nil,
-                       encoding = nil
-    blankline = "#{prefix.strip}\n"
-    directive = directive.downcase
-
-    case directive
-    when 'arg', 'args' then
-      return "#{prefix}:#{directive}: #{param}\n" unless code_object && code_object.kind_of?(RDoc::AnyMethod)
-
-      code_object.params = param
-
-      blankline
-    when 'category' then
-      if RDoc::Context === code_object then
-        section = code_object.add_section param
-        code_object.temporary_section = section
-      elsif RDoc::AnyMethod === code_object then
-        code_object.section_title = param
-      end
-
-      blankline # ignore category if we're not on an RDoc::Context
-    when 'doc' then
-      return blankline unless code_object
-      code_object.document_self = true
-      code_object.force_documentation = true
-
-      blankline
-    when 'enddoc' then
-      return blankline unless code_object
-      code_object.done_documenting = true
-
-      blankline
-    when 'include' then
-      filename = param.split(' ', 2).first
-      include_file filename, prefix, encoding
-    when 'main' then
-      @options.main_page = param if @options.respond_to? :main_page
-
-      blankline
-    when 'nodoc' then
-      return blankline unless code_object
-      code_object.document_self = nil # notify nodoc
-      code_object.document_children = param !~ /all/i
-
-      blankline
-    when 'notnew', 'not_new', 'not-new' then
-      return blankline unless RDoc::AnyMethod === code_object
-
-      code_object.dont_rename_initialize = true
-
-      blankline
-    when 'startdoc' then
-      return blankline unless code_object
-
-      code_object.start_doc
-      code_object.force_documentation = true
-
-      blankline
-    when 'stopdoc' then
-      return blankline unless code_object
-
-      code_object.stop_doc
-
-      blankline
-    when 'title' then
-      @options.default_title = param if @options.respond_to? :default_title=
-
-      blankline
-    when 'yield', 'yields' then
-      return blankline unless code_object
-      # remove parameter &block
-      code_object.params = code_object.params.sub(/,?\s*&\w+/, '') if code_object.params
-
-      code_object.block_params = param
-
-      blankline
-    else
-      result = yield directive, param if block_given?
-
-      case result
-      when nil then
-        code_object.metadata[directive] = param if code_object
-
-        if RDoc::Markup::PreProcess.registered.include? directive then
-          handler = RDoc::Markup::PreProcess.registered[directive]
-          result = handler.call directive, param if handler
-        else
-          result = "#{prefix}:#{directive}: #{param}\n"
-        end
-      when false then
-        result = "#{prefix}:#{directive}: #{param}\n"
-      end
-
-      result
-    end
-  end
-
-  ##
-  # Handles the <tt>:include: _filename_</tt> directive.
-  #
-  # If the first line of the included file starts with '#', and contains
-  # an encoding information in the form 'coding:' or 'coding=', it is
-  # removed.
-  #
-  # If all lines in the included file start with a '#', this leading '#'
-  # is removed before inclusion. The included content is indented like
-  # the <tt>:include:</tt> directive.
-  #--
-  # so all content will be verbatim because of the likely space after '#'?
-  # TODO shift left the whole file content in that case
-  # TODO comment stop/start #-- and #++ in included file must be processed here
-
-  def include_file name, indent, encoding
-    full_name = find_include_file name
-
-    unless full_name then
-      warn "Couldn't find file to include '#{name}' from #{@input_file_name}"
-      return ''
-    end
-
-    content = RDoc::Encoding.read_file full_name, encoding, true
-    content = RDoc::Encoding.remove_magic_comment content
-
-    # strip magic comment
-    content = content.sub(/\A# .*coding[=:].*$/, '').lstrip
-
-    # strip leading '#'s, but only if all lines start with them
-    if content =~ /^[^#]/ then
-      content.gsub(/^/, indent)
-    else
-      content.gsub(/^#?/, indent)
-    end
-  end
-
-  ##
-  # Look for the given file in the directory containing the current file,
-  # and then in each of the directories specified in the RDOC_INCLUDE path
-
-  def find_include_file(name)
-    to_search = [File.dirname(@input_file_name)].concat @include_path
-    to_search.each do |dir|
-      full_name = File.join(dir, name)
-      stat = File.stat(full_name) rescue next
-      return full_name if stat.readable?
-    end
-    nil
-  end
-
-end
diff --git a/lib/rdoc/markup/raw.rb b/lib/rdoc/markup/raw.rb
deleted file mode 100644
index a7c1c210a6..0000000000
--- a/lib/rdoc/markup/raw.rb
+++ /dev/null
@@ -1,69 +0,0 @@
-# frozen_string_literal: true
-##
-# A section of text that is added to the output document as-is
-
-class RDoc::Markup::Raw
-
-  ##
-  # The component parts of the list
-
-  attr_reader :parts
-
-  ##
-  # Creates a new Raw containing +parts+
-
-  def initialize *parts
-    @parts = []
-    @parts.concat parts
-  end
-
-  ##
-  # Appends +text+
-
-  def << text
-    @parts << text
-  end
-
-  def == other # :nodoc:
-    self.class == other.class and @parts == other.parts
-  end
-
-  ##
-  # Calls #accept_raw+ on +visitor+
-
-  def accept visitor
-    visitor.accept_raw self
-  end
-
-  ##
-  # Appends +other+'s parts
-
-  def merge other
-    @parts.concat other.parts
-  end
-
-  def pretty_print q # :nodoc:
-    self.class.name =~ /.*::(\w{1,4})/i
-
-    q.group 2, "[#{$1.downcase}: ", ']' do
-      q.seplist @parts do |part|
-        q.pp part
-      end
-    end
-  end
-
-  ##
-  # Appends +texts+ onto this Paragraph
-
-  def push *texts
-    self.parts.concat texts
-  end
-
-  ##
-  # The raw text
-
-  def text
-    @parts.join ' '
-  end
-
-end
diff --git a/lib/rdoc/markup/regexp_handling.rb b/lib/rdoc/markup/regexp_handling.rb
deleted file mode 100644
index c471fe73c7..0000000000
--- a/lib/rdoc/markup/regexp_handling.rb
+++ /dev/null
@@ -1,40 +0,0 @@
-# frozen_string_literal: true
-##
-# Hold details of a regexp handling sequence
-
-class RDoc::Markup::RegexpHandling
-
-  ##
-  # Regexp handling type
-
-  attr_reader   :type
-
-  ##
-  # Regexp handling text
-
-  attr_accessor :text
-
-  ##
-  # Creates a new regexp handling sequence of +type+ with +text+
-
-  def initialize(type, text)
-    @type, @text = type, text
-  end
-
-  ##
-  # Regexp handlings are equal when the have the same text and type
-
-  def ==(o)
-    self.text == o.text && self.type == o.type
-  end
-
-  def inspect # :nodoc:
-    "#<RDoc::Markup::RegexpHandling:0x%x @type=%p, @text=%p>" % [
-      object_id, @type, text.dump]
-  end
-
-  def to_s # :nodoc:
-    "RegexpHandling: type=#{type} text=#{text.dump}"
-  end
-
-end
diff --git a/lib/rdoc/markup/rule.rb b/lib/rdoc/markup/rule.rb
deleted file mode 100644
index 448148d6d1..0000000000
--- a/lib/rdoc/markup/rule.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-# frozen_string_literal: true
-##
-# A horizontal rule with a weight
-
-class RDoc::Markup::Rule < Struct.new :weight
-
-  ##
-  # Calls #accept_rule on +visitor+
-
-  def accept visitor
-    visitor.accept_rule self
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, '[rule:', ']' do
-      q.pp weight
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/table.rb b/lib/rdoc/markup/table.rb
deleted file mode 100644
index 27a20f073a..0000000000
--- a/lib/rdoc/markup/table.rb
+++ /dev/null
@@ -1,56 +0,0 @@
-# frozen_string_literal: true
-##
-# A section of table
-
-class RDoc::Markup::Table
-  # headers of each column
-  attr_accessor :header
-
-  # alignments of each column
-  attr_accessor :align
-
-  # body texts of each column
-  attr_accessor :body
-
-  # Creates new instance
-  def initialize header, align, body
-    @header, @align, @body = header, align, body
-  end
-
-  # :stopdoc:
-  def == other
-    self.class == other.class and
-      @header == other.header and
-      @align == other.align and
-      @body == other.body
-  end
-
-  def accept visitor
-    visitor.accept_table @header, @body, @align
-  end
-
-  def pretty_print q
-    q.group 2, '[Table: ', ']' do
-      q.group 2, '[Head: ', ']' do
-        q.seplist @header.zip(@align) do |text, align|
-          q.pp text
-          if align
-            q.text ":"
-            q.breakable
-            q.text align.to_s
-          end
-        end
-      end
-      q.breakable
-      q.group 2, '[Body: ', ']' do
-        q.seplist @body do |body|
-          q.group 2, '[', ']' do
-            q.seplist body do |text|
-              q.pp text
-            end
-          end
-        end
-      end
-    end
-  end
-end
diff --git a/lib/rdoc/markup/to_ansi.rb b/lib/rdoc/markup/to_ansi.rb
deleted file mode 100644
index c3eacab21a..0000000000
--- a/lib/rdoc/markup/to_ansi.rb
+++ /dev/null
@@ -1,93 +0,0 @@
-# frozen_string_literal: true
-##
-# Outputs RDoc markup with vibrant ANSI color!
-
-class RDoc::Markup::ToAnsi < RDoc::Markup::ToRdoc
-
-  ##
-  # Creates a new ToAnsi visitor that is ready to output vibrant ANSI color!
-
-  def initialize markup = nil
-    super
-
-    @headings.clear
-    @headings[1] = ["\e[1;32m", "\e[m"] # bold
-    @headings[2] = ["\e[4;32m", "\e[m"] # underline
-    @headings[3] = ["\e[32m",   "\e[m"] # just green
-  end
-
-  ##
-  # Maps attributes to ANSI sequences
-
-  def init_tags
-    add_tag :BOLD, "\e[1m", "\e[m"
-    add_tag :TT,   "\e[7m", "\e[m"
-    add_tag :EM,   "\e[4m", "\e[m"
-  end
-
-  ##
-  # Overrides indent width to ensure output lines up correctly.
-
-  def accept_list_item_end list_item
-    width = case @list_type.last
-            when :BULLET then
-              2
-            when :NOTE, :LABEL then
-              if @prefix then
-                @res << @prefix.strip
-                @prefix = nil
-              end
-
-              @res << "\n" unless res.length == 1
-              2
-            else
-              bullet = @list_index.last.to_s
-              @list_index[-1] = @list_index.last.succ
-              bullet.length + 2
-            end
-
-    @indent -= width
-  end
-
-  ##
-  # Adds coloring to note and label list items
-
-  def accept_list_item_start list_item
-    bullet = case @list_type.last
-             when :BULLET then
-               '*'
-             when :NOTE, :LABEL then
-               labels = Array(list_item.label).map do |label|
-                 attributes(label).strip
-               end.join "\n"
-
-               labels << ":\n" unless labels.empty?
-
-               labels
-             else
-               @list_index.last.to_s + '.'
-             end
-
-    case @list_type.last
-    when :NOTE, :LABEL then
-      @indent += 2
-      @prefix = bullet + (' ' * @indent)
-    else
-      @prefix = (' ' * @indent) + bullet.ljust(bullet.length + 1)
-
-      width = bullet.gsub(/\e\[[\d;]*m/, '').length + 1
-
-      @indent += width
-    end
-  end
-
-  ##
-  # Starts accepting with a reset screen
-
-  def start_accepting
-    super
-
-    @res = ["\e[0m"]
-  end
-
-end
diff --git a/lib/rdoc/markup/to_bs.rb b/lib/rdoc/markup/to_bs.rb
deleted file mode 100644
index afd9d6e981..0000000000
--- a/lib/rdoc/markup/to_bs.rb
+++ /dev/null
@@ -1,102 +0,0 @@
-# frozen_string_literal: true
-##
-# Outputs RDoc markup with hot backspace action!  You will probably need a
-# pager to use this output format.
-#
-# This formatter won't work on 1.8.6 because it lacks String#chars.
-
-class RDoc::Markup::ToBs < RDoc::Markup::ToRdoc
-
-  ##
-  # Returns a new ToBs that is ready for hot backspace action!
-
-  def initialize markup = nil
-    super
-
-    @in_b  = false
-    @in_em = false
-  end
-
-  ##
-  # Sets a flag that is picked up by #annotate to do the right thing in
-  # #convert_string
-
-  def init_tags
-    add_tag :BOLD, '+b', '-b'
-    add_tag :EM,   '+_', '-_'
-    add_tag :TT,   ''  , ''   # we need in_tt information maintained
-  end
-
-  ##
-  # Makes heading text bold.
-
-  def accept_heading heading
-    use_prefix or @res << ' ' * @indent
-    @res << @headings[heading.level][0]
-    @in_b = true
-    @res << attributes(heading.text)
-    @in_b = false
-    @res << @headings[heading.level][1]
-    @res << "\n"
-  end
-
-  ##
-  # Prepares the visitor for consuming +list_item+
-
-  def accept_list_item_start list_item
-    type = @list_type.last
-
-    case type
-    when :NOTE, :LABEL then
-      bullets = Array(list_item.label).map do |label|
-        attributes(label).strip
-      end.join "\n"
-
-      bullets << ":\n" unless bullets.empty?
-
-      @prefix = ' ' * @indent
-      @indent += 2
-      @prefix << bullets + (' ' * @indent)
-    else
-      bullet = type == :BULLET ? '*' :  @list_index.last.to_s + '.'
-      @prefix = (' ' * @indent) + bullet.ljust(bullet.length + 1)
-      width = bullet.length + 1
-      @indent += width
-    end
-  end
-
-  ##
-  # Turns on or off regexp handling for +convert_string+
-
-  def annotate tag
-    case tag
-    when '+b' then @in_b = true
-    when '-b' then @in_b = false
-    when '+_' then @in_em = true
-    when '-_' then @in_em = false
-    end
-    ''
-  end
-
-  ##
-  # Calls convert_string on the result of convert_regexp_handling
-
-  def convert_regexp_handling target
-    convert_string super
-  end
-
-  ##
-  # Adds bold or underline mixed with backspaces
-
-  def convert_string string
-    return string unless @in_b or @in_em
-    chars = if @in_b then
-              string.chars.map do |char| "#{char}\b#{char}" end
-            elsif @in_em then
-              string.chars.map do |char| "_\b#{char}" end
-            end
-
-    chars.join
-  end
-
-end
diff --git a/lib/rdoc/markup/to_html.rb b/lib/rdoc/markup/to_html.rb
deleted file mode 100644
index 91cadf9d16..0000000000
--- a/lib/rdoc/markup/to_html.rb
+++ /dev/null
@@ -1,452 +0,0 @@
-# frozen_string_literal: true
-require 'cgi/util'
-
-##
-# Outputs RDoc markup as HTML.
-
-class RDoc::Markup::ToHtml < RDoc::Markup::Formatter
-
-  include RDoc::Text
-
-  # :section: Utilities
-
-  ##
-  # Maps RDoc::Markup::Parser::LIST_TOKENS types to HTML tags
-
-  LIST_TYPE_TO_HTML = {
-    :BULLET => ['<ul>',                                      '</ul>'],
-    :LABEL  => ['<dl class="rdoc-list label-list">',         '</dl>'],
-    :LALPHA => ['<ol style="list-style-type: lower-alpha">', '</ol>'],
-    :NOTE   => ['<dl class="rdoc-list note-list">',          '</dl>'],
-    :NUMBER => ['<ol>',                                      '</ol>'],
-    :UALPHA => ['<ol style="list-style-type: upper-alpha">', '</ol>'],
-  }
-
-  attr_reader :res # :nodoc:
-  attr_reader :in_list_entry # :nodoc:
-  attr_reader :list # :nodoc:
-
-  ##
-  # The RDoc::CodeObject HTML is being generated for.  This is used to
-  # generate namespaced URI fragments
-
-  attr_accessor :code_object
-
-  ##
-  # Path to this document for relative links
-
-  attr_accessor :from_path
-
-  # :section:
-
-  ##
-  # Creates a new formatter that will output HTML
-
-  def initialize options, markup = nil
-    super
-
-    @code_object = nil
-    @from_path = ''
-    @in_list_entry = nil
-    @list = nil
-    @th = nil
-    @hard_break = "<br>\n"
-
-    init_regexp_handlings
-
-    init_tags
-  end
-
-  # :section: Regexp Handling
-  #
-  # These methods are used by regexp handling markup added by RDoc::Markup#add_regexp_handling.
-
-  # :nodoc:
-  URL_CHARACTERS_REGEXP_STR = /[A-Za-z0-9\-._~:\/\?#\[\]@!$&'\(\)*+,;%=]/.source
-
-  ##
-  # Adds regexp handlings.
-
-  def init_regexp_handlings
-    # external links
-    @markup.add_regexp_handling(/(?:link:|https?:|mailto:|ftp:|irc:|www\.)#{URL_CHARACTERS_REGEXP_STR}+\w/,
-                                :HYPERLINK)
-    init_link_notation_regexp_handlings
-  end
-
-  ##
-  # Adds regexp handlings about link notations.
-
-  def init_link_notation_regexp_handlings
-    add_regexp_handling_RDOCLINK
-    add_regexp_handling_TIDYLINK
-  end
-
-  def handle_RDOCLINK url # :nodoc:
-    case url
-    when /^rdoc-ref:/
-      CGI.escapeHTML($')
-    when /^rdoc-label:/
-      text = $'
-
-      text = case text
-             when /\Alabel-/    then $'
-             when /\Afootmark-/ then $'
-             when /\Afoottext-/ then $'
-             else                    text
-             end
-
-      gen_url CGI.escapeHTML(url), CGI.escapeHTML(text)
-    when /^rdoc-image:/
-      %[<img src=\"#{CGI.escapeHTML($')}\">]
-    when /\Ardoc-[a-z]+:/
-      CGI.escapeHTML($')
-    end
-  end
-
-  ##
-  # +target+ is a <code><br></code>
-
-  def handle_regexp_HARD_BREAK target
-    '<br>'
-  end
-
-  ##
-  # +target+ is a potential link.  The following schemes are handled:
-  #
-  # <tt>mailto:</tt>::
-  #   Inserted as-is.
-  # <tt>http:</tt>::
-  #   Links are checked to see if they reference an image. If so, that image
-  #   gets inserted using an <tt><img></tt> tag. Otherwise a conventional
-  #   <tt><a href></tt> is used.
-  # <tt>link:</tt>::
-  #   Reference to a local file relative to the output directory.
-
-  def handle_regexp_HYPERLINK(target)
-    url = CGI.escapeHTML(target.text)
-
-    gen_url url, url
-  end
-
-  ##
-  # +target+ is an rdoc-schemed link that will be converted into a hyperlink.
-  #
-  # For the +rdoc-ref+ scheme the named reference will be returned without
-  # creating a link.
-  #
-  # For the +rdoc-label+ scheme the footnote and label prefixes are stripped
-  # when creating a link.  All other contents will be linked verbatim.
-
-  def handle_regexp_RDOCLINK target
-    handle_RDOCLINK target.text
-  end
-
-  ##
-  # This +target+ is a link where the label is different from the URL
-  # <tt>label[url]</tt> or <tt>{long label}[url]</tt>
-
-  def handle_regexp_TIDYLINK(target)
-    text = target.text
-
-    return text unless
-      text =~ /^\{(.*)\}\[(.*?)\]$/ or text =~ /^(\S+)\[(.*?)\]$/
-
-    label = $1
-    url   = CGI.escapeHTML($2)
-
-    if /^rdoc-image:/ =~ label
-      label = handle_RDOCLINK(label)
-    else
-      label = CGI.escapeHTML(label)
-    end
-
-    gen_url url, label
-  end
-
-  # :section: Visitor
-  #
-  # These methods implement the HTML visitor.
-
-  ##
-  # Prepares the visitor for HTML generation
-
-  def start_accepting
-    @res = []
-    @in_list_entry = []
-    @list = []
-  end
-
-  ##
-  # Returns the generated output
-
-  def end_accepting
-    @res.join
-  end
-
-  ##
-  # Adds +block_quote+ to the output
-
-  def accept_block_quote block_quote
-    @res << "\n<blockquote>"
-
-    block_quote.parts.each do |part|
-      part.accept self
-    end
-
-    @res << "</blockquote>\n"
-  end
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_paragraph paragraph
-    @res << "\n<p>"
-    text = paragraph.text @hard_break
-    text = text.gsub(/(#{SPACE_SEPARATED_LETTER_CLASS})?\K\r?\n(?=(?(1)(#{SPACE_SEPARATED_LETTER_CLASS})?))/o) {
-      defined?($2) && ' '
-    }
-    @res << to_html(text)
-    @res << "</p>\n"
-  end
-
-  ##
-  # Adds +verbatim+ to the output
-
-  def accept_verbatim verbatim
-    text = verbatim.text.rstrip
-
-    klass = nil
-
-    content = if verbatim.ruby? or parseable? text then
-                begin
-                  tokens = RDoc::Parser::RipperStateLex.parse text
-                  klass  = ' class="ruby"'
-
-                  result = RDoc::TokenStream.to_html tokens
-                  result = result + "\n" unless "\n" == result[-1]
-                  result
-                rescue
-                  CGI.escapeHTML text
-                end
-              else
-                CGI.escapeHTML text
-              end
-
-    if @options.pipe then
-      @res << "\n<pre><code>#{CGI.escapeHTML text}\n</code></pre>\n"
-    else
-      @res << "\n<pre#{klass}>#{content}</pre>\n"
-    end
-  end
-
-  ##
-  # Adds +rule+ to the output
-
-  def accept_rule rule
-    @res << "<hr>\n"
-  end
-
-  ##
-  # Prepares the visitor for consuming +list+
-
-  def accept_list_start(list)
-    @list << list.type
-    @res << html_list_name(list.type, true)
-    @in_list_entry.push false
-  end
-
-  ##
-  # Finishes consumption of +list+
-
-  def accept_list_end(list)
-    @list.pop
-    if tag = @in_list_entry.pop
-      @res << tag
-    end
-    @res << html_list_name(list.type, false) << "\n"
-  end
-
-  ##
-  # Prepares the visitor for consuming +list_item+
-
-  def accept_list_item_start(list_item)
-    if tag = @in_list_entry.last
-      @res << tag
-    end
-
-    @res << list_item_start(list_item, @list.last)
-  end
-
-  ##
-  # Finishes consumption of +list_item+
-
-  def accept_list_item_end(list_item)
-    @in_list_entry[-1] = list_end_for(@list.last)
-  end
-
-  ##
-  # Adds +blank_line+ to the output
-
-  def accept_blank_line(blank_line)
-    # @res << annotate("<p />") << "\n"
-  end
-
-  ##
-  # Adds +heading+ to the output.  The headings greater than 6 are trimmed to
-  # level 6.
-
-  def accept_heading heading
-    level = [6, heading.level].min
-
-    label = heading.label @code_object
-
-    @res << if @options.output_decoration
-              "\n<h#{level} id=\"#{label}\">"
-            else
-              "\n<h#{level}>"
-            end
-    @res << to_html(heading.text)
-    unless @options.pipe then
-      @res << "<span><a href=\"##{label}\">&para;</a>"
-      @res << " <a href=\"#top\">&uarr;</a></span>"
-    end
-    @res << "</h#{level}>\n"
-  end
-
-  ##
-  # Adds +raw+ to the output
-
-  def accept_raw raw
-    @res << raw.parts.join("\n")
-  end
-
-  ##
-  # Adds +table+ to the output
-
-  def accept_table header, body, aligns
-    @res << "\n<table role=\"table\">\n<thead>\n<tr>\n"
-    header.zip(aligns) do |text, align|
-      @res << '<th'
-      @res << ' align="' << align << '"' if align
-      @res << '>' << to_html(text) << "</th>\n"
-    end
-    @res << "</tr>\n</thead>\n<tbody>\n"
-    body.each do |row|
-      @res << "<tr>\n"
-      row.zip(aligns) do |text, align|
-        @res << '<td'
-        @res << ' align="' << align << '"' if align
-        @res << '>' << to_html(text) << "</td>\n"
-      end
-      @res << "</tr>\n"
-    end
-    @res << "</tbody>\n</table>\n"
-  end
-
-  # :section: Utilities
-
-  ##
-  # CGI-escapes +text+
-
-  def convert_string(text)
-    CGI.escapeHTML text
-  end
-
-  ##
-  # Generate a link to +url+ with content +text+.  Handles the special cases
-  # for img: and link: described under handle_regexp_HYPERLINK
-
-  def gen_url url, text
-    scheme, url, id = parse_url url
-
-    if %w[http https link].include?(scheme) and
-       url =~ /\.(gif|png|jpg|jpeg|bmp)$/ then
-      "<img src=\"#{url}\" />"
-    else
-      if scheme != 'link' and %r%\A((?!https?:)(?:[^/#]*/)*+)([^/#]+)\.(rb|rdoc|md)(?=\z|#)%i =~ url
-        url = "#$1#{$2.tr('.', '_')}_#$3.html#$'"
-      end
-
-      text = text.sub %r%^#{scheme}:/*%i, ''
-      text = text.sub %r%^[*\^](\d+)$%,   '\1'
-
-      link = "<a#{id} href=\"#{url}\">#{text}</a>"
-
-      link = "<sup>#{link}</sup>" if /"foot/ =~ id
-
-      link
-    end
-  end
-
-  ##
-  # Determines the HTML list element for +list_type+ and +open_tag+
-
-  def html_list_name(list_type, open_tag)
-    tags = LIST_TYPE_TO_HTML[list_type]
-    raise RDoc::Error, "Invalid list type: #{list_type.inspect}" unless tags
-    tags[open_tag ? 0 : 1]
-  end
-
-  ##
-  # Maps attributes to HTML tags
-
-  def init_tags
-    add_tag :BOLD, "<strong>", "</strong>"
-    add_tag :TT,   "<code>",   "</code>"
-    add_tag :EM,   "<em>",     "</em>"
-  end
-
-  ##
-  # Returns the HTML tag for +list_type+, possible using a label from
-  # +list_item+
-
-  def list_item_start(list_item, list_type)
-    case list_type
-    when :BULLET, :LALPHA, :NUMBER, :UALPHA then
-      "<li>"
-    when :LABEL, :NOTE then
-      Array(list_item.label).map do |label|
-        "<dt>#{to_html label}\n"
-      end.join << "<dd>"
-    else
-      raise RDoc::Error, "Invalid list type: #{list_type.inspect}"
-    end
-  end
-
-  ##
-  # Returns the HTML end-tag for +list_type+
-
-  def list_end_for(list_type)
-    case list_type
-    when :BULLET, :LALPHA, :NUMBER, :UALPHA then
-      "</li>"
-    when :LABEL, :NOTE then
-      "</dd>"
-    else
-      raise RDoc::Error, "Invalid list type: #{list_type.inspect}"
-    end
-  end
-
-  ##
-  # Returns true if text is valid ruby syntax
-
-  def parseable? text
-    verbose, $VERBOSE = $VERBOSE, nil
-    catch(:valid) do
-      eval("BEGIN { throw :valid, true }\n#{text}")
-    end
-  rescue SyntaxError
-    false
-  ensure
-    $VERBOSE = verbose
-  end
-
-  ##
-  # Converts +item+ to HTML using RDoc::Text#to_html
-
-  def to_html item
-    super convert_flow @am.flow item
-  end
-
-end
diff --git a/lib/rdoc/markup/to_html_crossref.rb b/lib/rdoc/markup/to_html_crossref.rb
deleted file mode 100644
index 9b5de62fd6..0000000000
--- a/lib/rdoc/markup/to_html_crossref.rb
+++ /dev/null
@@ -1,175 +0,0 @@
-# frozen_string_literal: true
-##
-# Subclass of the RDoc::Markup::ToHtml class that supports looking up method
-# names, classes, etc to create links.  RDoc::CrossReference is used to
-# generate those links based on the current context.
-
-class RDoc::Markup::ToHtmlCrossref < RDoc::Markup::ToHtml
-
-  # :stopdoc:
-  ALL_CROSSREF_REGEXP = RDoc::CrossReference::ALL_CROSSREF_REGEXP
-  CLASS_REGEXP_STR    = RDoc::CrossReference::CLASS_REGEXP_STR
-  CROSSREF_REGEXP     = RDoc::CrossReference::CROSSREF_REGEXP
-  METHOD_REGEXP_STR   = RDoc::CrossReference::METHOD_REGEXP_STR
-  # :startdoc:
-
-  ##
-  # RDoc::CodeObject for generating references
-
-  attr_accessor :context
-
-  ##
-  # Should we show '#' characters on method references?
-
-  attr_accessor :show_hash
-
-  ##
-  # Creates a new crossref resolver that generates links relative to +context+
-  # which lives at +from_path+ in the generated files.  '#' characters on
-  # references are removed unless +show_hash+ is true.  Only method names
-  # preceded by '#' or '::' are linked, unless +hyperlink_all+ is true.
-
-  def initialize(options, from_path, context, markup = nil)
-    raise ArgumentError, 'from_path cannot be nil' if from_path.nil?
-
-    super options, markup
-
-    @context       = context
-    @from_path     = from_path
-    @hyperlink_all = @options.hyperlink_all
-    @show_hash     = @options.show_hash
-
-    @cross_reference = RDoc::CrossReference.new @context
-  end
-
-  # :nodoc:
-  def init_link_notation_regexp_handlings
-    add_regexp_handling_RDOCLINK
-
-    # The crossref must be linked before tidylink because Klass.method[:sym]
-    # will be processed as a tidylink first and will be broken.
-    crossref_re = @options.hyperlink_all ? ALL_CROSSREF_REGEXP : CROSSREF_REGEXP
-    @markup.add_regexp_handling crossref_re, :CROSSREF
-
-    add_regexp_handling_TIDYLINK
-  end
-
-  ##
-  # Creates a link to the reference +name+ if the name exists.  If +text+ is
-  # given it is used as the link text, otherwise +name+ is used.
-
-  def cross_reference name, text = nil, code = true
-    lookup = name
-
-    name = name[1..-1] unless @show_hash if name[0, 1] == '#'
-
-    if !(name.end_with?('+@', '-@')) and name =~ /(.*[^#:])?@/
-      text ||= [CGI.unescape($'), (" at <code>#{$1}</code>" if $~.begin(1))].join("")
-      code = false
-    else
-      text ||= name
-    end
-
-    link lookup, text, code
-  end
-
-  ##
-  # We're invoked when any text matches the CROSSREF pattern.  If we find the
-  # corresponding reference, generate a link.  If the name we're looking for
-  # contains no punctuation, we look for it up the module/class chain.  For
-  # example, ToHtml is found, even without the <tt>RDoc::Markup::</tt> prefix,
-  # because we look for it in module Markup first.
-
-  def handle_regexp_CROSSREF(target)
-    name = target.text
-
-    return name if name =~ /@[\w-]+\.[\w-]/ # labels that look like emails
-
-    unless @hyperlink_all then
-      # This ensures that words entirely consisting of lowercase letters will
-      # not have cross-references generated (to suppress lots of erroneous
-      # cross-references to "new" in text, for instance)
-      return name if name =~ /\A[a-z]*\z/
-    end
-
-    cross_reference name
-  end
-
-  ##
-  # Handles <tt>rdoc-ref:</tt> scheme links and allows RDoc::Markup::ToHtml to
-  # handle other schemes.
-
-  def handle_regexp_HYPERLINK target
-    return cross_reference $' if target.text =~ /\Ardoc-ref:/
-
-    super
-  end
-
-  ##
-  # +target+ is an rdoc-schemed link that will be converted into a hyperlink.
-  # For the rdoc-ref scheme the cross-reference will be looked up and the
-  # given name will be used.
-  #
-  # All other contents are handled by
-  # {the superclass}[rdoc-ref:RDoc::Markup::ToHtml#handle_regexp_RDOCLINK]
-
-  def handle_regexp_RDOCLINK target
-    url = target.text
-
-    case url
-    when /\Ardoc-ref:/ then
-      cross_reference $'
-    else
-      super
-    end
-  end
-
-  ##
-  # Generates links for <tt>rdoc-ref:</tt> scheme URLs and allows
-  # RDoc::Markup::ToHtml to handle other schemes.
-
-  def gen_url url, text
-    return super unless url =~ /\Ardoc-ref:/
-
-    name = $'
-    cross_reference name, text, name == text
-  end
-
-  ##
-  # Creates an HTML link to +name+ with the given +text+.
-
-  def link name, text, code = true
-    if !(name.end_with?('+@', '-@')) and name =~ /(.*[^#:])?@/
-      name = $1
-      label = $'
-    end
-
-    ref = @cross_reference.resolve name, text if name
-
-    case ref
-    when String then
-      ref
-    else
-      path = ref ? ref.as_href(@from_path) : +""
-
-      if code and RDoc::CodeObject === ref and !(RDoc::TopLevel === ref)
-        text = "<code>#{CGI.escapeHTML text}</code>"
-      end
-
-      if label
-        if path =~ /#/
-          path << "-label-#{label}"
-        elsif ref&.sections&.any? { |section| label == section.title }
-          path << "##{label}"
-        elsif ref.respond_to?(:aref)
-          path << "##{ref.aref}-label-#{label}"
-        else
-          path << "#label-#{label}"
-        end
-      end
-
-      "<a href=\"#{path}\">#{text}</a>"
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/to_html_snippet.rb b/lib/rdoc/markup/to_html_snippet.rb
deleted file mode 100644
index f471395a3a..0000000000
--- a/lib/rdoc/markup/to_html_snippet.rb
+++ /dev/null
@@ -1,287 +0,0 @@
-# frozen_string_literal: true
-##
-# Outputs RDoc markup as paragraphs with inline markup only.
-
-class RDoc::Markup::ToHtmlSnippet < RDoc::Markup::ToHtml
-
-  ##
-  # After this many characters the input will be cut off.
-
-  attr_reader :character_limit
-
-  ##
-  # The number of characters seen so far.
-
-  attr_reader :characters # :nodoc:
-
-  ##
-  # The attribute bitmask
-
-  attr_reader :mask
-
-  ##
-  # After this many paragraphs the input will be cut off.
-
-  attr_reader :paragraph_limit
-
-  ##
-  # Count of paragraphs found
-
-  attr_reader :paragraphs
-
-  ##
-  # Creates a new ToHtmlSnippet formatter that will cut off the input on the
-  # next word boundary after the given number of +characters+ or +paragraphs+
-  # of text have been encountered.
-
-  def initialize options, characters = 100, paragraphs = 3, markup = nil
-    super options, markup
-
-    @character_limit = characters
-    @paragraph_limit = paragraphs
-
-    @characters = 0
-    @mask       = 0
-    @paragraphs = 0
-
-    @markup.add_regexp_handling RDoc::CrossReference::CROSSREF_REGEXP, :CROSSREF
-  end
-
-  ##
-  # Adds +heading+ to the output as a paragraph
-
-  def accept_heading heading
-    @res << "<p>#{to_html heading.text}\n"
-
-    add_paragraph
-  end
-
-  ##
-  # Raw sections are untrusted and ignored
-
-  alias accept_raw ignore
-
-  ##
-  # Rules are ignored
-
-  alias accept_rule ignore
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_paragraph paragraph
-    para = @in_list_entry.last || "<p>"
-
-    text = paragraph.text @hard_break
-
-    @res << "#{para}#{to_html text}\n"
-
-    add_paragraph
-  end
-
-  ##
-  # Finishes consumption of +list_item+
-
-  def accept_list_item_end list_item
-  end
-
-  ##
-  # Prepares the visitor for consuming +list_item+
-
-  def accept_list_item_start list_item
-    @res << list_item_start(list_item, @list.last)
-  end
-
-  ##
-  # Prepares the visitor for consuming +list+
-
-  def accept_list_start list
-    @list << list.type
-    @res << html_list_name(list.type, true)
-    @in_list_entry.push ''
-  end
-
-  ##
-  # Adds +verbatim+ to the output
-
-  def accept_verbatim verbatim
-    throw :done if @characters >= @character_limit
-    input = verbatim.text.rstrip
-
-    text = truncate input
-    text << ' ...' unless text == input
-
-    super RDoc::Markup::Verbatim.new text
-
-    add_paragraph
-  end
-
-  ##
-  # Prepares the visitor for HTML snippet generation
-
-  def start_accepting
-    super
-
-    @characters = 0
-  end
-
-  ##
-  # Removes escaping from the cross-references in +target+
-
-  def handle_regexp_CROSSREF target
-    target.text.sub(/\A\\/, '')
-  end
-
-  ##
-  # +target+ is a <code><br></code>
-
-  def handle_regexp_HARD_BREAK target
-    @characters -= 4
-    '<br>'
-  end
-
-  ##
-  # Lists are paragraphs, but notes and labels have a separator
-
-  def list_item_start list_item, list_type
-    throw :done if @characters >= @character_limit
-
-    case list_type
-    when :BULLET, :LALPHA, :NUMBER, :UALPHA then
-      "<p>"
-    when :LABEL, :NOTE then
-      labels = Array(list_item.label).map do |label|
-        to_html label
-      end.join ', '
-
-      labels << " &mdash; " unless labels.empty?
-
-      start = "<p>#{labels}"
-      @characters += 1 # try to include the label
-      start
-    else
-      raise RDoc::Error, "Invalid list type: #{list_type.inspect}"
-    end
-  end
-
-  ##
-  # Returns just the text of +link+, +url+ is only used to determine the link
-  # type.
-
-  def gen_url url, text
-    if url =~ /^rdoc-label:([^:]*)(?::(.*))?/ then
-      type = "link"
-    elsif url =~ /([A-Za-z]+):(.*)/ then
-      type = $1
-    else
-      type = "http"
-    end
-
-    if (type == "http" or type == "https" or type == "link") and
-       url =~ /\.(gif|png|jpg|jpeg|bmp)$/ then
-      ''
-    else
-      text.sub(%r%^#{type}:/*%, '')
-    end
-  end
-
-  ##
-  # In snippets, there are no lists
-
-  def html_list_name list_type, open_tag
-    ''
-  end
-
-  ##
-  # Throws +:done+ when paragraph_limit paragraphs have been encountered
-
-  def add_paragraph
-    @paragraphs += 1
-
-    throw :done if @paragraphs >= @paragraph_limit
-  end
-
-  ##
-  # Marks up +content+
-
-  def convert content
-    catch :done do
-      return super
-    end
-
-    end_accepting
-  end
-
-  ##
-  # Converts flow items +flow+
-
-  def convert_flow flow
-    throw :done if @characters >= @character_limit
-
-    res = []
-    @mask = 0
-
-    flow.each do |item|
-      case item
-      when RDoc::Markup::AttrChanger then
-        off_tags res, item
-        on_tags  res, item
-      when String then
-        text = convert_string item
-        res << truncate(text)
-      when RDoc::Markup::RegexpHandling then
-        text = convert_regexp_handling item
-        res << truncate(text)
-      else
-        raise "Unknown flow element: #{item.inspect}"
-      end
-
-      if @characters >= @character_limit then
-        off_tags res, RDoc::Markup::AttrChanger.new(0, @mask)
-        break
-      end
-    end
-
-    res << ' ...' if @characters >= @character_limit
-
-    res.join
-  end
-
-  ##
-  # Maintains a bitmask to allow HTML elements to be closed properly.  See
-  # RDoc::Markup::Formatter.
-
-  def on_tags res, item
-    @mask ^= item.turn_on
-
-    super
-  end
-
-  ##
-  # Maintains a bitmask to allow HTML elements to be closed properly.  See
-  # RDoc::Markup::Formatter.
-
-  def off_tags res, item
-    @mask ^= item.turn_off
-
-    super
-  end
-
-  ##
-  # Truncates +text+ at the end of the first word after the character_limit.
-
-  def truncate text
-    length = text.length
-    characters = @characters
-    @characters += length
-
-    return text if @characters < @character_limit
-
-    remaining = @character_limit - characters
-
-    text =~ /\A(.{#{remaining},}?)(\s|$)/m # TODO word-break instead of \s?
-
-    $1
-  end
-
-end
diff --git a/lib/rdoc/markup/to_joined_paragraph.rb b/lib/rdoc/markup/to_joined_paragraph.rb
deleted file mode 100644
index 31cbe0853c..0000000000
--- a/lib/rdoc/markup/to_joined_paragraph.rb
+++ /dev/null
@@ -1,46 +0,0 @@
-# frozen_string_literal: true
-##
-# Joins the parts of an RDoc::Markup::Paragraph into a single String.
-#
-# This allows for easier maintenance and testing of Markdown support.
-#
-# This formatter only works on Paragraph instances.  Attempting to process
-# other markup syntax items will not work.
-
-class RDoc::Markup::ToJoinedParagraph < RDoc::Markup::Formatter
-
-  def initialize # :nodoc:
-    super nil
-  end
-
-  def start_accepting # :nodoc:
-  end
-
-  def end_accepting # :nodoc:
-  end
-
-  ##
-  # Converts the parts of +paragraph+ to a single entry.
-
-  def accept_paragraph paragraph
-    parts = paragraph.parts.chunk do |part|
-      String === part
-    end.flat_map do |string, chunk|
-      string ? chunk.join.rstrip : chunk
-    end
-
-    paragraph.parts.replace parts
-  end
-
-  alias accept_block_quote     ignore
-  alias accept_heading         ignore
-  alias accept_list_end        ignore
-  alias accept_list_item_end   ignore
-  alias accept_list_item_start ignore
-  alias accept_list_start      ignore
-  alias accept_raw             ignore
-  alias accept_rule            ignore
-  alias accept_verbatim        ignore
-  alias accept_table           ignore
-
-end
diff --git a/lib/rdoc/markup/to_label.rb b/lib/rdoc/markup/to_label.rb
deleted file mode 100644
index cf808364e9..0000000000
--- a/lib/rdoc/markup/to_label.rb
+++ /dev/null
@@ -1,74 +0,0 @@
-# frozen_string_literal: true
-require 'cgi/util'
-
-##
-# Creates HTML-safe labels suitable for use in id attributes.  Tidylinks are
-# converted to their link part and cross-reference links have the suppression
-# marks removed (\\SomeClass is converted to SomeClass).
-
-class RDoc::Markup::ToLabel < RDoc::Markup::Formatter
-
-  attr_reader :res # :nodoc:
-
-  ##
-  # Creates a new formatter that will output HTML-safe labels
-
-  def initialize markup = nil
-    super nil, markup
-
-    @markup.add_regexp_handling RDoc::CrossReference::CROSSREF_REGEXP, :CROSSREF
-    @markup.add_regexp_handling(/(((\{.*?\})|\b\S+?)\[\S+?\])/, :TIDYLINK)
-
-    add_tag :BOLD, '', ''
-    add_tag :TT,   '', ''
-    add_tag :EM,   '', ''
-
-    @res = []
-  end
-
-  ##
-  # Converts +text+ to an HTML-safe label
-
-  def convert text
-    label = convert_flow @am.flow text
-
-    CGI.escape(label).gsub('%', '-').sub(/^-/, '')
-  end
-
-  ##
-  # Converts the CROSSREF +target+ to plain text, removing the suppression
-  # marker, if any
-
-  def handle_regexp_CROSSREF target
-    text = target.text
-
-    text.sub(/^\\/, '')
-  end
-
-  ##
-  # Converts the TIDYLINK +target+ to just the text part
-
-  def handle_regexp_TIDYLINK target
-    text = target.text
-
-    return text unless text =~ /\{(.*?)\}\[(.*?)\]/ or text =~ /(\S+)\[(.*?)\]/
-
-    $1
-  end
-
-  alias accept_blank_line         ignore
-  alias accept_block_quote        ignore
-  alias accept_heading            ignore
-  alias accept_list_end           ignore
-  alias accept_list_item_end      ignore
-  alias accept_list_item_start    ignore
-  alias accept_list_start         ignore
-  alias accept_paragraph          ignore
-  alias accept_raw                ignore
-  alias accept_rule               ignore
-  alias accept_verbatim           ignore
-  alias end_accepting             ignore
-  alias handle_regexp_HARD_BREAK  ignore
-  alias start_accepting           ignore
-
-end
diff --git a/lib/rdoc/markup/to_markdown.rb b/lib/rdoc/markup/to_markdown.rb
deleted file mode 100644
index b915fab60b..0000000000
--- a/lib/rdoc/markup/to_markdown.rb
+++ /dev/null
@@ -1,191 +0,0 @@
-# frozen_string_literal: true
-# :markup: markdown
-
-##
-# Outputs parsed markup as Markdown
-
-class RDoc::Markup::ToMarkdown < RDoc::Markup::ToRdoc
-
-  ##
-  # Creates a new formatter that will output Markdown format text
-
-  def initialize markup = nil
-    super
-
-    @headings[1] = ['# ',      '']
-    @headings[2] = ['## ',     '']
-    @headings[3] = ['### ',    '']
-    @headings[4] = ['#### ',   '']
-    @headings[5] = ['##### ',  '']
-    @headings[6] = ['###### ', '']
-
-    add_regexp_handling_RDOCLINK
-    add_regexp_handling_TIDYLINK
-
-    @hard_break = "  \n"
-  end
-
-  ##
-  # Maps attributes to HTML sequences
-
-  def init_tags
-    add_tag :BOLD, '**', '**'
-    add_tag :EM,   '*',  '*'
-    add_tag :TT,   '`',  '`'
-  end
-
-  ##
-  # Adds a newline to the output
-
-  def handle_regexp_HARD_BREAK target
-    "  \n"
-  end
-
-  ##
-  # Finishes consumption of `list`
-
-  def accept_list_end list
-    super
-  end
-
-  ##
-  # Finishes consumption of `list_item`
-
-  def accept_list_item_end list_item
-    width = case @list_type.last
-            when :BULLET then
-              4
-            when :NOTE, :LABEL then
-              use_prefix
-
-              @res << "\n"
-
-              4
-            else
-              @list_index[-1] = @list_index.last.succ
-              4
-            end
-
-    @indent -= width
-  end
-
-  ##
-  # Prepares the visitor for consuming `list_item`
-
-  def accept_list_item_start list_item
-    type = @list_type.last
-
-    case type
-    when :NOTE, :LABEL then
-      bullets = Array(list_item.label).map do |label|
-        attributes(label).strip
-      end.join "\n"
-
-      bullets << "\n" unless bullets.empty?
-
-      @prefix = ' ' * @indent
-      @indent += 4
-      @prefix << bullets << ":" << (' ' * (@indent - 1))
-    else
-      bullet = type == :BULLET ? '*' : @list_index.last.to_s + '.'
-      @prefix = (' ' * @indent) + bullet.ljust(4)
-
-      @indent += 4
-    end
-  end
-
-  ##
-  # Prepares the visitor for consuming `list`
-
-  def accept_list_start list
-    case list.type
-    when :BULLET, :LABEL, :NOTE then
-      @list_index << nil
-    when :LALPHA, :NUMBER, :UALPHA then
-      @list_index << 1
-    else
-      raise RDoc::Error, "invalid list type #{list.type}"
-    end
-
-    @list_width << 4
-    @list_type << list.type
-  end
-
-  ##
-  # Adds `rule` to the output
-
-  def accept_rule rule
-    use_prefix or @res << ' ' * @indent
-    @res << '-' * 3
-    @res << "\n"
-  end
-
-  ##
-  # Outputs `verbatim` indented 4 columns
-
-  def accept_verbatim verbatim
-    indent = ' ' * (@indent + 4)
-
-    verbatim.parts.each do |part|
-      @res << indent unless part == "\n"
-      @res << part
-    end
-
-    @res << "\n"
-  end
-
-  ##
-  # Creates a Markdown-style URL from +url+ with +text+.
-
-  def gen_url url, text
-    scheme, url, = parse_url url
-
-    "[#{text.sub(%r{^#{scheme}:/*}i, '')}](#{url})"
-  end
-
-  ##
-  # Handles <tt>rdoc-</tt> type links for footnotes.
-
-  def handle_rdoc_link url
-    case url
-    when /^rdoc-ref:/ then
-      $'
-    when /^rdoc-label:footmark-(\d+)/ then
-      "[^#{$1}]:"
-    when /^rdoc-label:foottext-(\d+)/ then
-      "[^#{$1}]"
-    when /^rdoc-label:label-/ then
-      gen_url url, $'
-    when /^rdoc-image:/ then
-      "![](#{$'})"
-    when /^rdoc-[a-z]+:/ then
-      $'
-    end
-  end
-
-  ##
-  # Converts the RDoc markup tidylink into a Markdown.style link.
-
-  def handle_regexp_TIDYLINK target
-    text = target.text
-
-    return text unless text =~ /\{(.*?)\}\[(.*?)\]/ or text =~ /(\S+)\[(.*?)\]/
-
-    label = $1
-    url   = $2
-
-    if url =~ /^rdoc-label:foot/ then
-      handle_rdoc_link url
-    else
-      gen_url url, label
-    end
-  end
-
-  ##
-  # Converts the rdoc-...: links into a Markdown.style links.
-
-  def handle_regexp_RDOCLINK target
-    handle_rdoc_link target.text
-  end
-
-end
diff --git a/lib/rdoc/markup/to_rdoc.rb b/lib/rdoc/markup/to_rdoc.rb
deleted file mode 100644
index 88234f5096..0000000000
--- a/lib/rdoc/markup/to_rdoc.rb
+++ /dev/null
@@ -1,352 +0,0 @@
-# frozen_string_literal: true
-##
-# Outputs RDoc markup as RDoc markup! (mostly)
-
-class RDoc::Markup::ToRdoc < RDoc::Markup::Formatter
-
-  ##
-  # Current indent amount for output in characters
-
-  attr_accessor :indent
-
-  ##
-  # Output width in characters
-
-  attr_accessor :width
-
-  ##
-  # Stack of current list indexes for alphabetic and numeric lists
-
-  attr_reader :list_index
-
-  ##
-  # Stack of list types
-
-  attr_reader :list_type
-
-  ##
-  # Stack of list widths for indentation
-
-  attr_reader :list_width
-
-  ##
-  # Prefix for the next list item.  See #use_prefix
-
-  attr_reader :prefix
-
-  ##
-  # Output accumulator
-
-  attr_reader :res
-
-  ##
-  # Creates a new formatter that will output (mostly) \RDoc markup
-
-  def initialize markup = nil
-    super nil, markup
-
-    @markup.add_regexp_handling(/\\\S/, :SUPPRESSED_CROSSREF)
-    @width = 78
-    init_tags
-
-    @headings = {}
-    @headings.default = []
-
-    @headings[1] = ['= ',      '']
-    @headings[2] = ['== ',     '']
-    @headings[3] = ['=== ',    '']
-    @headings[4] = ['==== ',   '']
-    @headings[5] = ['===== ',  '']
-    @headings[6] = ['====== ', '']
-
-    @hard_break = "\n"
-  end
-
-  ##
-  # Maps attributes to HTML sequences
-
-  def init_tags
-    add_tag :BOLD, "<b>", "</b>"
-    add_tag :TT,   "<tt>", "</tt>"
-    add_tag :EM,   "<em>", "</em>"
-  end
-
-  ##
-  # Adds +blank_line+ to the output
-
-  def accept_blank_line blank_line
-    @res << "\n"
-  end
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_block_quote block_quote
-    @indent += 2
-
-    block_quote.parts.each do |part|
-      @prefix = '> '
-
-      part.accept self
-    end
-
-    @indent -= 2
-  end
-
-  ##
-  # Adds +heading+ to the output
-
-  def accept_heading heading
-    use_prefix or @res << ' ' * @indent
-    @res << @headings[heading.level][0]
-    @res << attributes(heading.text)
-    @res << @headings[heading.level][1]
-    @res << "\n"
-  end
-
-  ##
-  # Finishes consumption of +list+
-
-  def accept_list_end list
-    @list_index.pop
-    @list_type.pop
-    @list_width.pop
-  end
-
-  ##
-  # Finishes consumption of +list_item+
-
-  def accept_list_item_end list_item
-    width = case @list_type.last
-            when :BULLET then
-              2
-            when :NOTE, :LABEL then
-              if @prefix then
-                @res << @prefix.strip
-                @prefix = nil
-              end
-
-              @res << "\n"
-              2
-            else
-              bullet = @list_index.last.to_s
-              @list_index[-1] = @list_index.last.succ
-              bullet.length + 2
-            end
-
-    @indent -= width
-  end
-
-  ##
-  # Prepares the visitor for consuming +list_item+
-
-  def accept_list_item_start list_item
-    type = @list_type.last
-
-    case type
-    when :NOTE, :LABEL then
-      stripped_labels = Array(list_item.label).map do |label|
-        attributes(label).strip
-      end
-
-      bullets = case type
-      when :NOTE
-        stripped_labels.map { |b| "#{b}::" }
-      when :LABEL
-        stripped_labels.map { |b| "[#{b}]" }
-      end
-
-      bullets = bullets.join("\n")
-      bullets << "\n" unless stripped_labels.empty?
-
-      @prefix = ' ' * @indent
-      @indent += 2
-      @prefix << bullets + (' ' * @indent)
-    else
-      bullet = type == :BULLET ? '*' :  @list_index.last.to_s + '.'
-      @prefix = (' ' * @indent) + bullet.ljust(bullet.length + 1)
-      width = bullet.length + 1
-      @indent += width
-    end
-  end
-
-  ##
-  # Prepares the visitor for consuming +list+
-
-  def accept_list_start list
-    case list.type
-    when :BULLET then
-      @list_index << nil
-      @list_width << 1
-    when :LABEL, :NOTE then
-      @list_index << nil
-      @list_width << 2
-    when :LALPHA then
-      @list_index << 'a'
-      @list_width << list.items.length.to_s.length
-    when :NUMBER then
-      @list_index << 1
-      @list_width << list.items.length.to_s.length
-    when :UALPHA then
-      @list_index << 'A'
-      @list_width << list.items.length.to_s.length
-    else
-      raise RDoc::Error, "invalid list type #{list.type}"
-    end
-
-    @list_type << list.type
-  end
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_paragraph paragraph
-    text = paragraph.text @hard_break
-    wrap attributes text
-  end
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_indented_paragraph paragraph
-    @indent += paragraph.indent
-    text = paragraph.text @hard_break
-    wrap attributes text
-    @indent -= paragraph.indent
-  end
-
-  ##
-  # Adds +raw+ to the output
-
-  def accept_raw raw
-    @res << raw.parts.join("\n")
-  end
-
-  ##
-  # Adds +rule+ to the output
-
-  def accept_rule rule
-    use_prefix or @res << ' ' * @indent
-    @res << '-' * (@width - @indent)
-    @res << "\n"
-  end
-
-  ##
-  # Outputs +verbatim+ indented 2 columns
-
-  def accept_verbatim verbatim
-    indent = ' ' * (@indent + 2)
-
-    verbatim.parts.each do |part|
-      @res << indent unless part == "\n"
-      @res << part
-    end
-
-    @res << "\n"
-  end
-
-  ##
-  # Adds +table+ to the output
-
-  def accept_table header, body, aligns
-    widths = header.zip(body) do |h, b|
-      [h.size, b.size].max
-    end
-    aligns = aligns.map do |a|
-      case a
-      when nil
-        :center
-      when :left
-        :ljust
-      when :right
-        :rjust
-      end
-    end
-    @res << header.zip(widths, aligns) do |h, w, a|
-      h.__send__(a, w)
-    end.join("|").rstrip << "\n"
-    @res << widths.map {|w| "-" * w }.join("|") << "\n"
-    body.each do |row|
-      @res << row.zip(widths, aligns) do |t, w, a|
-        t.__send__(a, w)
-      end.join("|").rstrip << "\n"
-    end
-  end
-
-  ##
-  # Applies attribute-specific markup to +text+ using RDoc::AttributeManager
-
-  def attributes text
-    flow = @am.flow text.dup
-    convert_flow flow
-  end
-
-  ##
-  # Returns the generated output
-
-  def end_accepting
-    @res.join
-  end
-
-  ##
-  # Removes preceding \\ from the suppressed crossref +target+
-
-  def handle_regexp_SUPPRESSED_CROSSREF target
-    text = target.text
-    text = text.sub('\\', '') unless in_tt?
-    text
-  end
-
-  ##
-  # Adds a newline to the output
-
-  def handle_regexp_HARD_BREAK target
-    "\n"
-  end
-
-  ##
-  # Prepares the visitor for text generation
-
-  def start_accepting
-    @res = [""]
-    @indent = 0
-    @prefix = nil
-
-    @list_index = []
-    @list_type  = []
-    @list_width = []
-  end
-
-  ##
-  # Adds the stored #prefix to the output and clears it.  Lists generate a
-  # prefix for later consumption.
-
-  def use_prefix
-    prefix, @prefix = @prefix, nil
-    @res << prefix if prefix
-
-    prefix
-  end
-
-  ##
-  # Wraps +text+ to #width
-
-  def wrap text
-    return unless text && !text.empty?
-
-    text_len = @width - @indent
-
-    text_len = 20 if text_len < 20
-
-    next_prefix = ' ' * @indent
-
-    prefix = @prefix || next_prefix
-    @prefix = nil
-
-    text.scan(/\G(?:([^ \n]{#{text_len}})(?=[^ \n])|(.{1,#{text_len}})(?:[ \n]|\z))/) do
-      @res << prefix << ($1 || $2) << "\n"
-      prefix = next_prefix
-    end
-  end
-
-end
diff --git a/lib/rdoc/markup/to_table_of_contents.rb b/lib/rdoc/markup/to_table_of_contents.rb
deleted file mode 100644
index e5b8225ba3..0000000000
--- a/lib/rdoc/markup/to_table_of_contents.rb
+++ /dev/null
@@ -1,88 +0,0 @@
-# frozen_string_literal: true
-##
-# Extracts just the RDoc::Markup::Heading elements from a
-# RDoc::Markup::Document to help build a table of contents
-
-class RDoc::Markup::ToTableOfContents < RDoc::Markup::Formatter
-
-  @to_toc = nil
-
-  ##
-  # Singleton for table-of-contents generation
-
-  def self.to_toc
-    @to_toc ||= new
-  end
-
-  ##
-  # Output accumulator
-
-  attr_reader :res
-
-  ##
-  # Omits headings with a level less than the given level.
-
-  attr_accessor :omit_headings_below
-
-  def initialize # :nodoc:
-    super nil
-
-    @omit_headings_below = nil
-  end
-
-  ##
-  # Adds +document+ to the output, using its heading cutoff if present
-
-  def accept_document document
-    @omit_headings_below = document.omit_headings_below
-
-    super
-  end
-
-  ##
-  # Adds +heading+ to the table of contents
-
-  def accept_heading heading
-    @res << heading unless suppressed? heading
-  end
-
-  ##
-  # Returns the table of contents
-
-  def end_accepting
-    @res
-  end
-
-  ##
-  # Prepares the visitor for text generation
-
-  def start_accepting
-    @omit_headings_below = nil
-    @res = []
-  end
-
-  ##
-  # Returns true if +heading+ is below the display threshold
-
-  def suppressed? heading
-    return false unless @omit_headings_below
-
-    heading.level > @omit_headings_below
-  end
-
-  # :stopdoc:
-  alias accept_block_quote     ignore
-  alias accept_raw             ignore
-  alias accept_rule            ignore
-  alias accept_blank_line      ignore
-  alias accept_paragraph       ignore
-  alias accept_verbatim        ignore
-  alias accept_list_end        ignore
-  alias accept_list_item_start ignore
-  alias accept_list_item_end   ignore
-  alias accept_list_end_bullet ignore
-  alias accept_list_start      ignore
-  alias accept_table           ignore
-  # :startdoc:
-
-end
diff --git a/lib/rdoc/markup/to_test.rb b/lib/rdoc/markup/to_test.rb
deleted file mode 100644
index 30113da561..0000000000
--- a/lib/rdoc/markup/to_test.rb
+++ /dev/null
@@ -1,69 +0,0 @@
-# frozen_string_literal: true
-##
-# This Markup outputter is used for testing purposes.
-
-class RDoc::Markup::ToTest < RDoc::Markup::Formatter
-
-  # :stopdoc:
-
-  ##
-  # :section: Visitor
-
-  def start_accepting
-    @res = []
-    @list = []
-  end
-
-  def end_accepting
-    @res
-  end
-
-  def accept_paragraph(paragraph)
-    @res << convert_flow(@am.flow(paragraph.text))
-  end
-
-  def accept_raw raw
-    @res << raw.parts.join
-  end
-
-  def accept_verbatim(verbatim)
-    @res << verbatim.text.gsub(/^(\S)/, '  \1')
-  end
-
-  def accept_list_start(list)
-    @list << case list.type
-             when :BULLET then
-               '*'
-             when :NUMBER then
-               '1'
-             else
-               list.type
-             end
-  end
-
-  def accept_list_end(list)
-    @list.pop
-  end
-
-  def accept_list_item_start(list_item)
-    @res << "#{' ' * (@list.size - 1)}#{@list.last}: "
-  end
-
-  def accept_list_item_end(list_item)
-  end
-
-  def accept_blank_line(blank_line)
-    @res << "\n"
-  end
-
-  def accept_heading(heading)
-    @res << "#{'=' * heading.level} #{heading.text}"
-  end
-
-  def accept_rule(rule)
-    @res << '-' * rule.weight
-  end
-
-  # :startdoc:
-
-end
diff --git a/lib/rdoc/markup/to_tt_only.rb b/lib/rdoc/markup/to_tt_only.rb
deleted file mode 100644
index 9ac14ed235..0000000000
--- a/lib/rdoc/markup/to_tt_only.rb
+++ /dev/null
@@ -1,120 +0,0 @@
-# frozen_string_literal: true
-##
-# Extracts sections of text enclosed in plus, tt or code.  Used to discover
-# undocumented parameters.
-
-class RDoc::Markup::ToTtOnly < RDoc::Markup::Formatter
-
-  ##
-  # Stack of list types
-
-  attr_reader :list_type
-
-  ##
-  # Output accumulator
-
-  attr_reader :res
-
-  ##
-  # Creates a new tt-only formatter.
-
-  def initialize markup = nil
-    super nil, markup
-
-    add_tag :TT, nil, nil
-  end
-
-  ##
-  # Adds tts from +block_quote+ to the output
-
-  def accept_block_quote block_quote
-    tt_sections block_quote.text
-  end
-
-  ##
-  # Pops the list type for +list+ from #list_type
-
-  def accept_list_end list
-    @list_type.pop
-  end
-
-  ##
-  # Pushes the list type for +list+ onto #list_type
-
-  def accept_list_start list
-    @list_type << list.type
-  end
-
-  ##
-  # Prepares the visitor for consuming +list_item+
-
-  def accept_list_item_start list_item
-    case @list_type.last
-    when :NOTE, :LABEL then
-      Array(list_item.label).map do |label|
-        tt_sections label
-      end.flatten
-    end
-  end
-
-  ##
-  # Adds +paragraph+ to the output
-
-  def accept_paragraph paragraph
-    tt_sections(paragraph.text)
-  end
-
-  ##
-  # Does nothing to +markup_item+ because it doesn't have any user-built
-  # content
-
-  def do_nothing markup_item
-  end
-
-  alias accept_blank_line    do_nothing # :nodoc:
-  alias accept_heading       do_nothing # :nodoc:
-  alias accept_list_item_end do_nothing # :nodoc:
-  alias accept_raw           do_nothing # :nodoc:
-  alias accept_rule          do_nothing # :nodoc:
-  alias accept_verbatim      do_nothing # :nodoc:
-
-  ##
-  # Extracts tt sections from +text+
-
-  def tt_sections text
-    flow = @am.flow text.dup
-
-    flow.each do |item|
-      case item
-      when String then
-        @res << item if in_tt?
-      when RDoc::Markup::AttrChanger then
-        off_tags res, item
-        on_tags res, item
-      when RDoc::Markup::RegexpHandling then
-        @res << convert_regexp_handling(item) if in_tt? # TODO can this happen?
-      else
-        raise "Unknown flow element: #{item.inspect}"
-      end
-    end
-
-    res
-  end
-
-  ##
-  # Returns an Array of items that were wrapped in plus, tt or code.
-
-  def end_accepting
-    @res.compact
-  end
-
-  ##
-  # Prepares the visitor for gathering tt sections
-
-  def start_accepting
-    @res = []
-
-    @list_type = []
-  end
-
-end
diff --git a/lib/rdoc/markup/verbatim.rb b/lib/rdoc/markup/verbatim.rb
deleted file mode 100644
index f51c2cfa14..0000000000
--- a/lib/rdoc/markup/verbatim.rb
+++ /dev/null
@@ -1,83 +0,0 @@
-# frozen_string_literal: true
-##
-# A section of verbatim text
-
-class RDoc::Markup::Verbatim < RDoc::Markup::Raw
-
-  ##
-  # Format of this verbatim section
-
-  attr_accessor :format
-
-  def initialize *parts # :nodoc:
-    super
-
-    @format = nil
-  end
-
-  def == other # :nodoc:
-    super and @format == other.format
-  end
-
-  ##
-  # Calls #accept_verbatim on +visitor+
-
-  def accept visitor
-    visitor.accept_verbatim self
-  end
-
-  ##
-  # Collapses 3+ newlines into two newlines
-
-  def normalize
-    parts = []
-
-    newlines = 0
-
-    @parts.each do |part|
-      case part
-      when /^\s*\n/ then
-        newlines += 1
-        parts << part if newlines == 1
-      else
-        newlines = 0
-        parts << part
-      end
-    end
-
-    parts.pop if parts.last =~ /\A\r?\n\z/
-
-    @parts = parts
-  end
-
-  def pretty_print q # :nodoc:
-    self.class.name =~ /.*::(\w{1,4})/i
-
-    q.group 2, "[#{$1.downcase}: ", ']' do
-      if @format then
-        q.text "format: #{@format}"
-        q.breakable
-      end
-
-      q.seplist @parts do |part|
-        q.pp part
-      end
-    end
-  end
-
-  ##
-  # Is this verbatim section Ruby code?
-
-  def ruby?
-    @format ||= nil # TODO for older ri data, switch the tree to marshal_dump
-    @format == :ruby
-  end
-
-  ##
-  # The text of the section
-
-  def text
-    @parts.join
-  end
-
-end
diff --git a/lib/rdoc/meta_method.rb b/lib/rdoc/meta_method.rb
deleted file mode 100644
index 8c95a0f78c..0000000000
--- a/lib/rdoc/meta_method.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-# frozen_string_literal: true
-##
-# MetaMethod represents a meta-programmed method
-
-class RDoc::MetaMethod < RDoc::AnyMethod
-end
diff --git a/lib/rdoc/method_attr.rb b/lib/rdoc/method_attr.rb
deleted file mode 100644
index 61ddb32f46..0000000000
--- a/lib/rdoc/method_attr.rb
+++ /dev/null
@@ -1,418 +0,0 @@
-# frozen_string_literal: true
-##
-# Abstract class representing either a method or an attribute.
-
-class RDoc::MethodAttr < RDoc::CodeObject
-
-  include Comparable
-
-  ##
-  # Name of this method/attribute.
-
-  attr_accessor :name
-
-  ##
-  # public, protected, private
-
-  attr_accessor :visibility
-
-  ##
-  # Is this a singleton method/attribute?
-
-  attr_accessor :singleton
-
-  ##
-  # Source file token stream
-
-  attr_reader :text
-
-  ##
-  # Array of other names for this method/attribute
-
-  attr_reader :aliases
-
-  ##
-  # The method/attribute we're aliasing
-
-  attr_accessor :is_alias_for
-
-  #--
-  # The attributes below are for AnyMethod only.
-  # They are left here for the time being to
-  # allow ri to operate.
-  # TODO modify ri to avoid calling these on attributes.
-  #++
-
-  ##
-  # Parameters yielded by the called block
-
-  attr_reader :block_params
-
-  ##
-  # Parameters for this method
-
-  attr_accessor :params
-
-  ##
-  # Different ways to call this method
-
-  attr_accessor :call_seq
-
-  ##
-  # The call_seq or the param_seq with method name, if there is no call_seq.
-
-  attr_reader :arglists
-
-  ##
-  # Pretty parameter list for this method
-
-  attr_reader :param_seq
-
-
-  ##
-  # Creates a new MethodAttr from token stream +text+ and method or attribute
-  # name +name+.
-  #
-  # Usually this is called by super from a subclass.
-
-  def initialize text, name
-    super()
-
-    @text = text
-    @name = name
-
-    @aliases      = []
-    @is_alias_for = nil
-    @parent_name  = nil
-    @singleton    = nil
-    @visibility   = :public
-    @see = false
-
-    @arglists     = nil
-    @block_params = nil
-    @call_seq     = nil
-    @param_seq    = nil
-    @params       = nil
-  end
-
-  ##
-  # Resets cached data for the object so it can be rebuilt by accessor methods
-
-  def initialize_copy other # :nodoc:
-    @full_name = nil
-  end
-
-  def initialize_visibility # :nodoc:
-    super
-    @see = nil
-  end
-
-  ##
-  # Order by #singleton then #name
-
-  def <=>(other)
-    return unless other.respond_to?(:singleton) &&
-                  other.respond_to?(:name)
-
-    [     @singleton ? 0 : 1,       name] <=>
-    [other.singleton ? 0 : 1, other.name]
-  end
-
-  def == other # :nodoc:
-    equal?(other) or self.class == other.class and full_name == other.full_name
-  end
-
-  ##
-  # A method/attribute is documented if any of the following is true:
-  # - it was marked with :nodoc:;
-  # - it has a comment;
-  # - it is an alias for a documented method;
-  # - it has a +#see+ method that is documented.
-
-  def documented?
-    super or
-      (is_alias_for and is_alias_for.documented?) or
-      (see and see.documented?)
-  end
-
-  ##
-  # A method/attribute to look at,
-  # in particular if this method/attribute has no documentation.
-  #
-  # It can be a method/attribute of the superclass or of an included module,
-  # including the Kernel module, which is always appended to the included
-  # modules.
-  #
-  # Returns +nil+ if there is no such method/attribute.
-  # The +#is_alias_for+ method/attribute, if any, is not included.
-  #
-  # Templates may generate a "see also ..." if this method/attribute
-  # has documentation, and "see ..." if it does not.
-
-  def see
-    @see = find_see if @see == false
-    @see
-  end
-
-  ##
-  # Sets the store for this class or module and its contained code objects.
-
-  def store= store
-    super
-
-    @file = @store.add_file @file.full_name if @file
-  end
-
-  def find_see # :nodoc:
-    return nil if singleton || is_alias_for
-
-    # look for the method
-    other = find_method_or_attribute name
-    return other if other
-
-    # if it is a setter, look for a getter
-    return nil unless name =~ /[a-z_]=$/i   # avoid == or ===
-    return find_method_or_attribute name[0..-2]
-  end
-
-  def find_method_or_attribute name # :nodoc:
-    return nil unless parent.respond_to? :ancestors
-
-    searched = parent.ancestors
-    kernel = @store.modules_hash['Kernel']
-
-    searched << kernel if kernel &&
-      parent != kernel && !searched.include?(kernel)
-
-    searched.each do |ancestor|
-      next if String === ancestor
-      next if parent == ancestor
-
-      other = ancestor.find_method_named('#' + name) ||
-              ancestor.find_attribute_named(name)
-
-      return other if other
-    end
-
-    nil
-  end
-
-  ##
-  # Abstract method. Contexts in their building phase call this
-  # to register a new alias for this known method/attribute.
-  #
-  # - creates a new AnyMethod/Attribute named <tt>an_alias.new_name</tt>;
-  # - adds +self+ as an alias for the new method or attribute
-  # - adds the method or attribute to #aliases
-  # - adds the method or attribute to +context+.
-
-  def add_alias(an_alias, context)
-    raise NotImplementedError
-  end
-
-  ##
-  # HTML fragment reference for this method
-
-  def aref
-    type = singleton ? 'c' : 'i'
-    # % characters are not allowed in html names => dash instead
-    "#{aref_prefix}-#{type}-#{html_name}"
-  end
-
-  ##
-  # Prefix for +aref+, defined by subclasses.
-
-  def aref_prefix
-    raise NotImplementedError
-  end
-
-  ##
-  # Attempts to sanitize the content passed by the Ruby parser:
-  # remove outer parentheses, etc.
-
-  def block_params=(value)
-    # 'yield.to_s' or 'assert yield, msg'
-    return @block_params = '' if value =~ /^[\.,]/
-
-    # remove trailing 'if/unless ...'
-    return @block_params = '' if value =~ /^(if|unless)\s/
-
-    value = $1.strip if value =~ /^(.+)\s(if|unless)\s/
-
-    # outer parentheses
-    value = $1 if value =~ /^\s*\((.*)\)\s*$/
-    value = value.strip
-
-    # proc/lambda
-    return @block_params = $1 if value =~ /^(proc|lambda)(\s*\{|\sdo)/
-
-    # surrounding +...+ or [...]
-    value = $1.strip if value =~ /^\+(.*)\+$/
-    value = $1.strip if value =~ /^\[(.*)\]$/
-
-    return @block_params = '' if value.empty?
-
-    # global variable
-    return @block_params = 'str' if value =~ /^\$[&0-9]$/
-
-    # wipe out array/hash indices
-    value.gsub!(/(\w)\[[^\[]+\]/, '\1')
-
-    # remove @ from class/instance variables
-    value.gsub!(/@@?([a-z0-9_]+)/, '\1')
-
-    # method calls => method name
-    value.gsub!(/([A-Z:a-z0-9_]+)\.([a-z0-9_]+)(\s*\(\s*[a-z0-9_.,\s]*\s*\)\s*)?/) do
-      case $2
-      when 'to_s'      then $1
-      when 'const_get' then 'const'
-      when 'new' then
-        $1.split('::').last.  # ClassName => class_name
-          gsub(/([A-Z]+)([A-Z][a-z])/,'\1_\2').
-          gsub(/([a-z\d])([A-Z])/,'\1_\2').
-          downcase
-      else
-        $2
-      end
-    end
-
-    # class prefixes
-    value.gsub!(/[A-Za-z0-9_:]+::/, '')
-
-    # simple expressions
-    value = $1 if value =~ /^([a-z0-9_]+)\s*[-*+\/]/
-
-    @block_params = value.strip
-  end
-
-  ##
-  # HTML id-friendly method/attribute name
-
-  def html_name
-    require 'cgi/util'
-
-    CGI.escape(@name.gsub('-', '-2D')).gsub('%','-').sub(/^-/, '')
-  end
-
-  ##
-  # Full method/attribute name including namespace
-
-  def full_name
-    @full_name ||= "#{parent_name}#{pretty_name}"
-  end
-
-  def inspect # :nodoc:
-    alias_for = @is_alias_for ? " (alias for #{@is_alias_for.name})" : nil
-    visibility = self.visibility
-    visibility = "forced #{visibility}" if force_documentation
-    "#<%s:0x%x %s (%s)%s>" % [
-      self.class, object_id,
-      full_name,
-      visibility,
-      alias_for,
-    ]
-  end
-
-  ##
-  # '::' for a class method/attribute, '#' for an instance method.
-
-  def name_prefix
-    @singleton ? '::' : '#'
-  end
-
-  ##
-  # Name for output to HTML.  For class methods the full name with a "." is
-  # used like +SomeClass.method_name+.  For instance methods the class name is
-  # used if +context+ does not match the parent.
-  #
-  # This is to help prevent people from using :: to call class methods.
-
-  def output_name context
-    return "#{name_prefix}#{@name}" if context == parent
-
-    "#{parent_name}#{@singleton ? '.' : '#'}#{@name}"
-  end
-
-  ##
-  # Method/attribute name with class/instance indicator
-
-  def pretty_name
-    "#{name_prefix}#{@name}"
-  end
-
-  ##
-  # Type of method/attribute (class or instance)
-
-  def type
-    singleton ? 'class' : 'instance'
-  end
-
-  ##
-  # Path to this method for use with HTML generator output.
-
-  def path
-    "#{@parent.path}##{aref}"
-  end
-
-  ##
-  # Name of our parent with special handling for un-marshaled methods
-
-  def parent_name
-    @parent_name || super
-  end
-
-  def pretty_print q # :nodoc:
-    alias_for =
-      if @is_alias_for.respond_to? :name then
-        "alias for #{@is_alias_for.name}"
-      elsif Array === @is_alias_for then
-        "alias for #{@is_alias_for.last}"
-      end
-
-    q.group 2, "[#{self.class.name} #{full_name} #{visibility}", "]" do
-      if alias_for then
-        q.breakable
-        q.text alias_for
-      end
-
-      if text then
-        q.breakable
-        q.text "text:"
-        q.breakable
-        q.pp @text
-      end
-
-      unless comment.empty? then
-        q.breakable
-        q.text "comment:"
-        q.breakable
-        q.pp @comment
-      end
-    end
-  end
-
-  ##
-  # Used by RDoc::Generator::JsonIndex to create a record for the search
-  # engine.
-
-  def search_record
-    [
-      @name,
-      full_name,
-      @name,
-      @parent.full_name,
-      path,
-      params,
-      snippet(@comment),
-    ]
-  end
-
-  def to_s # :nodoc:
-    if @is_alias_for
-      "#{self.class.name}: #{full_name} -> #{is_alias_for}"
-    else
-      "#{self.class.name}: #{full_name}"
-    end
-  end
-
-end
diff --git a/lib/rdoc/mixin.rb b/lib/rdoc/mixin.rb
deleted file mode 100644
index fa8faefc15..0000000000
--- a/lib/rdoc/mixin.rb
+++ /dev/null
@@ -1,120 +0,0 @@
-# frozen_string_literal: true
-##
-# A Mixin adds features from a module into another context.  RDoc::Include and
-# RDoc::Extend are both mixins.
-
-class RDoc::Mixin < RDoc::CodeObject
-
-  ##
-  # Name of included module
-
-  attr_accessor :name
-
-  ##
-  # Creates a new Mixin for +name+ with +comment+
-
-  def initialize(name, comment)
-    super()
-    @name = name
-    self.comment = comment
-    @module = nil # cache for module if found
-  end
-
-  ##
-  # Mixins are sorted by name
-
-  def <=> other
-    return unless self.class === other
-
-    name <=> other.name
-  end
-
-  def == other # :nodoc:
-    self.class === other and @name == other.name
-  end
-
-  alias eql? == # :nodoc:
-
-  ##
-  # Full name based on #module
-
-  def full_name
-    m = self.module
-    RDoc::ClassModule === m ? m.full_name : @name
-  end
-
-  def hash # :nodoc:
-    [@name, self.module].hash
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x %s.%s %s>" % [
-      self.class,
-      object_id,
-      parent_name, self.class.name.downcase, @name,
-    ]
-  end
-
-  ##
-  # Attempts to locate the included module object.  Returns the name if not
-  # known.
-  #
-  # The scoping rules of Ruby to resolve the name of an included module are:
-  # - first look into the children of the current context;
-  # - if not found, look into the children of included modules,
-  #   in reverse inclusion order;
-  # - if still not found, go up the hierarchy of names.
-  #
-  # This method has <code>O(n!)</code> behavior when the module calling
-  # include is referencing nonexistent modules.  Avoid calling #module until
-  # after all the files are parsed.  This behavior is due to ruby's constant
-  # lookup behavior.
-  #
-  # As of the beginning of October, 2011, no gem includes nonexistent modules.
-
-  def module
-    return @module if @module
-
-    # search the current context
-    return @name unless parent
-    full_name = parent.child_name(@name)
-    @module = @store.modules_hash[full_name]
-    return @module if @module
-    return @name if @name =~ /^::/
-
-    # search the includes before this one, in reverse order
-    searched = parent.includes.take_while { |i| i != self }.reverse
-    searched.each do |i|
-      inc = i.module
-      next if String === inc
-      full_name = inc.child_name(@name)
-      @module = @store.modules_hash[full_name]
-      return @module if @module
-    end
-
-    # go up the hierarchy of names
-    up = parent.parent
-    while up
-      full_name = up.child_name(@name)
-      @module = @store.modules_hash[full_name]
-      return @module if @module
-      up = up.parent
-    end
-
-    @name
-  end
-
-  ##
-  # Sets the store for this class or module and its contained code objects.
-
-  def store= store
-    super
-
-    @file = @store.add_file @file.full_name if @file
-  end
-
-  def to_s # :nodoc:
-    "#{self.class.name.downcase} #@name in: #{parent}"
-  end
-
-end
diff --git a/lib/rdoc/normal_class.rb b/lib/rdoc/normal_class.rb
deleted file mode 100644
index aa340b5d15..0000000000
--- a/lib/rdoc/normal_class.rb
+++ /dev/null
@@ -1,92 +0,0 @@
-# frozen_string_literal: true
-##
-# A normal class, neither singleton nor anonymous
-
-class RDoc::NormalClass < RDoc::ClassModule
-
-  ##
-  # The ancestors of this class including modules.  Unlike Module#ancestors,
-  # this class is not included in the result.  The result will contain both
-  # RDoc::ClassModules and Strings.
-
-  def ancestors
-    if String === superclass then
-      super << superclass
-    elsif superclass then
-      ancestors = super
-      ancestors << superclass
-      ancestors.concat superclass.ancestors
-    else
-      super
-    end
-  end
-
-  def aref_prefix # :nodoc:
-    'class'
-  end
-
-  ##
-  # The definition of this class, <tt>class MyClassName</tt>
-
-  def definition
-    "class #{full_name}"
-  end
-
-  def direct_ancestors
-    superclass ? super + [superclass] : super
-  end
-
-  def inspect # :nodoc:
-    superclass = @superclass ? " < #{@superclass}" : nil
-    "<%s:0x%x class %s%s includes: %p extends: %p attributes: %p methods: %p aliases: %p>" % [
-      self.class, object_id,
-      full_name, superclass, @includes, @extends, @attributes, @method_list, @aliases
-    ]
-  end
-
-  def to_s # :nodoc:
-    display = "#{self.class.name} #{self.full_name}"
-    if superclass
-      display += ' < ' + (superclass.is_a?(String) ? superclass : superclass.full_name)
-    end
-    display += ' -> ' + is_alias_for.to_s if is_alias_for
-    display
-  end
-
-  def pretty_print q # :nodoc:
-    superclass = @superclass ? " < #{@superclass}" : nil
-
-    q.group 2, "[class #{full_name}#{superclass}", "]" do
-      q.breakable
-      q.text "includes:"
-      q.breakable
-      q.seplist @includes do |inc| q.pp inc end
-
-      q.breakable
-      q.text "constants:"
-      q.breakable
-      q.seplist @constants do |const| q.pp const end
-
-      q.breakable
-      q.text "attributes:"
-      q.breakable
-      q.seplist @attributes do |attr| q.pp attr end
-
-      q.breakable
-      q.text "methods:"
-      q.breakable
-      q.seplist @method_list do |meth| q.pp meth end
-
-      q.breakable
-      q.text "aliases:"
-      q.breakable
-      q.seplist @aliases do |aliaz| q.pp aliaz end
-
-      q.breakable
-      q.text "comment:"
-      q.breakable
-      q.pp comment
-    end
-  end
-
-end
diff --git a/lib/rdoc/normal_module.rb b/lib/rdoc/normal_module.rb
deleted file mode 100644
index 498ec4dde2..0000000000
--- a/lib/rdoc/normal_module.rb
+++ /dev/null
@@ -1,73 +0,0 @@
-# frozen_string_literal: true
-##
-# A normal module, like NormalClass
-
-class RDoc::NormalModule < RDoc::ClassModule
-
-  def aref_prefix # :nodoc:
-    'module'
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x module %s includes: %p extends: %p attributes: %p methods: %p aliases: %p>" % [
-      self.class, object_id,
-      full_name, @includes, @extends, @attributes, @method_list, @aliases
-    ]
-  end
-
-  ##
-  # The definition of this module, <tt>module MyModuleName</tt>
-
-  def definition
-    "module #{full_name}"
-  end
-
-  ##
-  # This is a module, returns true
-
-  def module?
-    true
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[module #{full_name}:", "]" do
-      q.breakable
-      q.text "includes:"
-      q.breakable
-      q.seplist @includes do |inc| q.pp inc end
-      q.breakable
-
-      q.breakable
-      q.text "constants:"
-      q.breakable
-      q.seplist @constants do |const| q.pp const end
-
-      q.text "attributes:"
-      q.breakable
-      q.seplist @attributes do |attr| q.pp attr end
-      q.breakable
-
-      q.text "methods:"
-      q.breakable
-      q.seplist @method_list do |meth| q.pp meth end
-      q.breakable
-
-      q.text "aliases:"
-      q.breakable
-      q.seplist @aliases do |aliaz| q.pp aliaz end
-      q.breakable
-
-      q.text "comment:"
-      q.breakable
-      q.pp comment
-    end
-  end
-
-  ##
-  # Modules don't have one, raises NoMethodError
-
-  def superclass
-    raise NoMethodError, "#{full_name} is a module"
-  end
-
-end
diff --git a/lib/rdoc/options.rb b/lib/rdoc/options.rb
deleted file mode 100644
index 7518e6cc54..0000000000
--- a/lib/rdoc/options.rb
+++ /dev/null
@@ -1,1331 +0,0 @@
-# frozen_string_literal: true
-require 'optparse'
-require 'pathname'
-
-##
-# RDoc::Options handles the parsing and storage of options
-#
-# == Saved Options
-#
-# You can save some options like the markup format in the
-# <tt>.rdoc_options</tt> file in your gem.  The easiest way to do this is:
-#
-#   rdoc --markup tomdoc --write-options
-#
-# Which will automatically create the file and fill it with the options you
-# specified.
-#
-# The following options will not be saved since they interfere with the user's
-# preferences or with the normal operation of RDoc:
-#
-# * +--coverage-report+
-# * +--dry-run+
-# * +--encoding+
-# * +--force-update+
-# * +--format+
-# * +--pipe+
-# * +--quiet+
-# * +--template+
-# * +--verbose+
-#
-# == Custom Options
-#
-# Generators can hook into RDoc::Options to add generator-specific command
-# line options.
-#
-# When <tt>--format</tt> is encountered in ARGV, RDoc calls ::setup_options on
-# the generator class to add extra options to the option parser.  Options for
-# custom generators must occur after <tt>--format</tt>.  <tt>rdoc --help</tt>
-# will list options for all installed generators.
-#
-# Example:
-#
-#   class RDoc::Generator::Spellcheck
-#     RDoc::RDoc.add_generator self
-#
-#     def self.setup_options rdoc_options
-#       op = rdoc_options.option_parser
-#
-#       op.on('--spell-dictionary DICTIONARY',
-#             RDoc::Options::Path) do |dictionary|
-#         rdoc_options.spell_dictionary = dictionary
-#       end
-#     end
-#   end
-#
-# Of course, RDoc::Options does not respond to +spell_dictionary+ by default
-# so you will need to add it:
-#
-#   class RDoc::Options
-#
-#     ##
-#     # The spell dictionary used by the spell-checking plugin.
-#
-#     attr_accessor :spell_dictionary
-#
-#   end
-#
-# == Option Validators
-#
-# OptionParser validators will validate and cast user input values.  In
-# addition to the validators that ship with OptionParser (String, Integer,
-# Float, TrueClass, FalseClass, Array, Regexp, Date, Time, URI, etc.),
-# RDoc::Options adds Path, PathArray and Template.
-
-class RDoc::Options
-
-  ##
-  # The deprecated options.
-
-  DEPRECATED = {
-    '--accessor'      => 'support discontinued',
-    '--diagram'       => 'support discontinued',
-    '--help-output'   => 'support discontinued',
-    '--image-format'  => 'was an option for --diagram',
-    '--inline-source' => 'source code is now always inlined',
-    '--merge'         => 'ri now always merges class information',
-    '--one-file'      => 'support discontinued',
-    '--op-name'       => 'support discontinued',
-    '--opname'        => 'support discontinued',
-    '--promiscuous'   => 'files always only document their content',
-    '--ri-system'     => 'Ruby installers use other techniques',
-  }
-
-  ##
-  # RDoc options ignored (or handled specially) by --write-options
-
-  SPECIAL = %w[
-    coverage_report
-    dry_run
-    encoding
-    files
-    force_output
-    force_update
-    generator
-    generator_name
-    generator_options
-    generators
-    locale
-    op_dir
-    page_dir
-    option_parser
-    pipe
-    rdoc_include
-    root
-    static_path
-    stylesheet_url
-    template
-    template_dir
-    update_output_dir
-    verbosity
-    write_options
-  ]
-
-  ##
-  # Option validator for OptionParser that matches a directory that exists on
-  # the filesystem.
-
-  Directory = Object.new
-
-  ##
-  # Option validator for OptionParser that matches a file or directory that
-  # exists on the filesystem.
-
-  Path = Object.new
-
-  ##
-  # Option validator for OptionParser that matches a comma-separated list of
-  # files or directories that exist on the filesystem.
-
-  PathArray = Object.new
-
-  ##
-  # Option validator for OptionParser that matches a template directory for an
-  # installed generator that lives in
-  # <tt>"rdoc/generator/template/#{template_name}"</tt>
-
-  Template = Object.new
-
-  ##
-  # Character-set for HTML output.  #encoding is preferred over #charset
-
-  attr_accessor :charset
-
-  ##
-  # If true, RDoc will not write any files.
-
-  attr_accessor :dry_run
-
-  ##
-  # The output encoding.  All input files will be transcoded to this encoding.
-  #
-  # The default encoding is UTF-8.  This is set via --encoding.
-
-  attr_accessor :encoding
-
-  ##
-  # Files matching this pattern will be excluded
-
-  attr_writer :exclude
-
-  ##
-  # The list of files to be processed
-
-  attr_accessor :files
-
-  ##
-  # Create the output even if the output directory does not look
-  # like an rdoc output directory
-
-  attr_accessor :force_output
-
-  ##
-  # Scan newer sources than the flag file if true.
-
-  attr_accessor :force_update
-
-  ##
-  # Formatter to mark up text with
-
-  attr_accessor :formatter
-
-  ##
-  # Description of the output generator (set with the <tt>--format</tt> option)
-
-  attr_accessor :generator
-
-  ##
-  # For #==
-
-  attr_reader :generator_name # :nodoc:
-
-  ##
-  # Loaded generator options.  Used to prevent --help from loading the same
-  # options multiple times.
-
-  attr_accessor :generator_options
-
-  ##
-  # Old rdoc behavior: hyperlink all words that match a method name,
-  # even if not preceded by '#' or '::'
-
-  attr_accessor :hyperlink_all
-
-  ##
-  # Include line numbers in the source code
-
-  attr_accessor :line_numbers
-
-  ##
-  # The output locale.
-
-  attr_accessor :locale
-
-  ##
-  # The directory where locale data live.
-
-  attr_accessor :locale_dir
-
-  ##
-  # Name of the file, class or module to display in the initial index page (if
-  # not specified the first file we encounter is used)
-
-  attr_accessor :main_page
-
-  ##
-  # The default markup format.  The default is 'rdoc'.  'markdown', 'tomdoc'
-  # and 'rd' are also built-in.
-
-  attr_accessor :markup
-
-  ##
-  # If true, only report on undocumented files
-
-  attr_accessor :coverage_report
-
-  ##
-  # The name of the output directory
-
-  attr_accessor :op_dir
-
-  ##
-  # The OptionParser for this instance
-
-  attr_accessor :option_parser
-
-  ##
-  # Output heading decorations?
-  attr_accessor :output_decoration
-
-  ##
-  # Directory where guides, FAQ, and other pages not associated with a class
-  # live.  You may leave this unset if these are at the root of your project.
-
-  attr_accessor :page_dir
-
-  ##
-  # Is RDoc in pipe mode?
-
-  attr_accessor :pipe
-
-  ##
-  # Array of directories to search for files to satisfy an :include:
-
-  attr_accessor :rdoc_include
-
-  ##
-  # Root of the source documentation will be generated for.  Set this when
-  # building documentation outside the source directory.  Defaults to the
-  # current directory.
-
-  attr_accessor :root
-
-  ##
-  # Include the '#' at the front of hyperlinked instance method names
-
-  attr_accessor :show_hash
-
-  ##
-  # Directory to copy static files from
-
-  attr_accessor :static_path
-
-  ##
-  # The number of columns in a tab
-
-  attr_accessor :tab_width
-
-  ##
-  # Template to be used when generating output
-
-  attr_accessor :template
-
-  ##
-  # Directory the template lives in
-
-  attr_accessor :template_dir
-
-  ##
-  # Additional template stylesheets
-
-  attr_accessor :template_stylesheets
-
-  ##
-  # Documentation title
-
-  attr_accessor :title
-
-  ##
-  # Should RDoc update the timestamps in the output dir?
-
-  attr_accessor :update_output_dir
-
-  ##
-  # Verbosity, zero means quiet
-
-  attr_accessor :verbosity
-
-  ##
-  # URL of web cvs frontend
-
-  attr_accessor :webcvs
-
-  ##
-  # Minimum visibility of a documented method. One of +:public+, +:protected+,
-  # +:private+ or +:nodoc+.
-  #
-  # The +:nodoc+ visibility ignores all directives related to visibility.  The
-  # other visibilities may be overridden on a per-method basis with the :doc:
-  # directive.
-
-  attr_reader :visibility
-
-  ##
-  # Indicates if files of test suites should be skipped
-  attr_accessor :skip_tests
-
-  def initialize loaded_options = nil # :nodoc:
-    init_ivars
-    override loaded_options if loaded_options
-  end
-
-  def init_ivars # :nodoc:
-    @dry_run = false
-    @exclude = %w[
-      ~\z \.orig\z \.rej\z \.bak\z
-      \.gemspec\z
-    ]
-    @files = nil
-    @force_output = false
-    @force_update = true
-    @generator = nil
-    @generator_name = nil
-    @generator_options = []
-    @generators = RDoc::RDoc::GENERATORS
-    @hyperlink_all = false
-    @line_numbers = false
-    @locale = nil
-    @locale_name = nil
-    @locale_dir = 'locale'
-    @main_page = nil
-    @markup = 'rdoc'
-    @coverage_report = false
-    @op_dir = nil
-    @page_dir = nil
-    @pipe = false
-    @output_decoration = true
-    @rdoc_include = []
-    @root = Pathname(Dir.pwd)
-    @show_hash = false
-    @static_path = []
-    @stylesheet_url = nil # TODO remove in RDoc 4
-    @tab_width = 8
-    @template = nil
-    @template_dir = nil
-    @template_stylesheets = []
-    @title = nil
-    @update_output_dir = true
-    @verbosity = 1
-    @visibility = :protected
-    @webcvs = nil
-    @write_options = false
-    @encoding = Encoding::UTF_8
-    @charset = @encoding.name
-    @skip_tests = true
-  end
-
-  def init_with map # :nodoc:
-    init_ivars
-
-    encoding = map['encoding']
-    @encoding = encoding ? Encoding.find(encoding) : encoding
-
-    @charset        = map['charset']
-    @exclude        = map['exclude']
-    @generator_name = map['generator_name']
-    @hyperlink_all  = map['hyperlink_all']
-    @line_numbers   = map['line_numbers']
-    @locale_name    = map['locale_name']
-    @locale_dir     = map['locale_dir']
-    @main_page      = map['main_page']
-    @markup         = map['markup']
-    @op_dir         = map['op_dir']
-    @show_hash      = map['show_hash']
-    @tab_width      = map['tab_width']
-    @template_dir   = map['template_dir']
-    @title          = map['title']
-    @visibility     = map['visibility']
-    @webcvs         = map['webcvs']
-
-    @rdoc_include = sanitize_path map['rdoc_include']
-    @static_path  = sanitize_path map['static_path']
-  end
-
-  def yaml_initialize tag, map # :nodoc:
-    init_with map
-  end
-
-  def override map # :nodoc:
-    if map.has_key?('encoding')
-      encoding = map['encoding']
-      @encoding = encoding ? Encoding.find(encoding) : encoding
-    end
-
-    @charset        = map['charset']        if map.has_key?('charset')
-    @exclude        = map['exclude']        if map.has_key?('exclude')
-    @generator_name = map['generator_name'] if map.has_key?('generator_name')
-    @hyperlink_all  = map['hyperlink_all']  if map.has_key?('hyperlink_all')
-    @line_numbers   = map['line_numbers']   if map.has_key?('line_numbers')
-    @locale_name    = map['locale_name']    if map.has_key?('locale_name')
-    @locale_dir     = map['locale_dir']     if map.has_key?('locale_dir')
-    @main_page      = map['main_page']      if map.has_key?('main_page')
-    @markup         = map['markup']         if map.has_key?('markup')
-    @op_dir         = map['op_dir']         if map.has_key?('op_dir')
-    @page_dir       = map['page_dir']       if map.has_key?('page_dir')
-    @show_hash      = map['show_hash']      if map.has_key?('show_hash')
-    @tab_width      = map['tab_width']      if map.has_key?('tab_width')
-    @template_dir   = map['template_dir']   if map.has_key?('template_dir')
-    @title          = map['title']          if map.has_key?('title')
-    @visibility     = map['visibility']     if map.has_key?('visibility')
-    @webcvs         = map['webcvs']         if map.has_key?('webcvs')
-
-    if map.has_key?('rdoc_include')
-      @rdoc_include = sanitize_path map['rdoc_include']
-    end
-    if map.has_key?('static_path')
-      @static_path  = sanitize_path map['static_path']
-    end
-  end
-
-  def == other # :nodoc:
-    self.class === other and
-      @encoding       == other.encoding       and
-      @generator_name == other.generator_name and
-      @hyperlink_all  == other.hyperlink_all  and
-      @line_numbers   == other.line_numbers   and
-      @locale         == other.locale         and
-      @locale_dir     == other.locale_dir and
-      @main_page      == other.main_page      and
-      @markup         == other.markup         and
-      @op_dir         == other.op_dir         and
-      @rdoc_include   == other.rdoc_include   and
-      @show_hash      == other.show_hash      and
-      @static_path    == other.static_path    and
-      @tab_width      == other.tab_width      and
-      @template       == other.template       and
-      @title          == other.title          and
-      @visibility     == other.visibility     and
-      @webcvs         == other.webcvs
-  end
-
-  ##
-  # Check that the files on the command line exist
-
-  def check_files
-    @files.delete_if do |file|
-      if File.exist? file then
-        if File.readable? file then
-          false
-        else
-          warn "file '#{file}' not readable"
-
-          true
-        end
-      else
-        warn "file '#{file}' not found"
-
-        true
-      end
-    end
-  end
-
-  ##
-  # Ensure only one generator is loaded
-
-  def check_generator
-    if @generator then
-      raise OptionParser::InvalidOption,
-        "generator already set to #{@generator_name}"
-    end
-  end
-
-  ##
-  # Set the title, but only if not already set. Used to set the title
-  # from a source file, so that a title set from the command line
-  # will have the priority.
-
-  def default_title=(string)
-    @title ||= string
-  end
-
-  ##
-  # For dumping YAML
-
-  def to_yaml(*options) # :nodoc:
-    encoding = @encoding ? @encoding.name : nil
-
-    yaml = {}
-    yaml['encoding'] = encoding
-    yaml['static_path'] = sanitize_path(@static_path)
-    yaml['rdoc_include'] = sanitize_path(@rdoc_include)
-    yaml['page_dir'] = (sanitize_path([@page_dir]).first if @page_dir)
-
-    ivars = instance_variables.map { |ivar| ivar.to_s[1..-1] }
-    ivars -= SPECIAL
-
-    ivars.sort.each do |ivar|
-      yaml[ivar] = instance_variable_get("@#{ivar}")
-    end
-    yaml.to_yaml
-  end
-
-  ##
-  # Create a regexp for #exclude
-
-  def exclude
-    if @exclude.nil? or Regexp === @exclude then
-      # done, #finish is being re-run
-      @exclude
-    elsif @exclude.empty? then
-      nil
-    else
-      Regexp.new(@exclude.join("|"))
-    end
-  end
-
-  ##
-  # Completes any unfinished option setup business such as filtering for
-  # existent files, creating a regexp for #exclude and setting a default
-  # #template.
-
-  def finish
-    if @write_options then
-      write_options
-      exit
-    end
-
-    @op_dir ||= 'doc'
-
-    root = @root.to_s
-    if @rdoc_include.empty? || !@rdoc_include.include?(root)
-      @rdoc_include << root
-    end
-
-    @exclude = self.exclude
-
-    finish_page_dir
-
-    check_files
-
-    # If no template was specified, use the default template for the output
-    # formatter
-
-    unless @template then
-      @template     = @generator_name
-      @template_dir = template_dir_for @template
-    end
-
-    if @locale_name
-      @locale = RDoc::I18n::Locale[@locale_name]
-      @locale.load(@locale_dir)
-    else
-      @locale = nil
-    end
-
-    self
-  end
-
-  ##
-  # Fixes the page_dir to be relative to the root_dir and adds the page_dir to
-  # the files list.
-
-  def finish_page_dir
-    return unless @page_dir
-
-    @files << @page_dir
-
-    page_dir = Pathname(@page_dir)
-    begin
-      page_dir = page_dir.expand_path.relative_path_from @root
-    rescue ArgumentError
-      # On Windows, sometimes crosses different drive letters.
-      page_dir = page_dir.expand_path
-    end
-
-    @page_dir = page_dir
-  end
-
-  ##
-  # Returns a properly-space list of generators and their descriptions.
-
-  def generator_descriptions
-    lengths = []
-
-    generators = RDoc::RDoc::GENERATORS.map do |name, generator|
-      lengths << name.length
-
-      description = generator::DESCRIPTION if
-        generator.const_defined? :DESCRIPTION
-
-      [name, description]
-    end
-
-    longest = lengths.max
-
-    generators.sort.map do |name, description|
-      if description then
-        "  %-*s - %s" % [longest, name, description]
-      else
-        "  #{name}"
-      end
-    end.join "\n"
-  end
-
-  ##
-  # Parses command line options.
-
-  def parse argv
-    ignore_invalid = true
-
-    argv.insert(0, *ENV['RDOCOPT'].split) if ENV['RDOCOPT']
-
-    opts = OptionParser.new do |opt|
-      @option_parser = opt
-      opt.program_name = File.basename $0
-      opt.version = RDoc::VERSION
-      opt.release = nil
-      opt.summary_indent = ' ' * 4
-      opt.banner = <<-EOF
-Usage: #{opt.program_name} [options] [names...]
-
-  Files are parsed, and the information they contain collected, before any
-  output is produced. This allows cross references between all files to be
-  resolved. If a name is a directory, it is traversed. If no names are
-  specified, all Ruby files in the current directory (and subdirectories) are
-  processed.
-
-  How RDoc generates output depends on the output formatter being used, and on
-  the options you give.
-
-  Options can be specified via the RDOCOPT environment variable, which
-  functions similar to the RUBYOPT environment variable for ruby.
-
-    $ export RDOCOPT="--show-hash"
-
-  will make rdoc show hashes in method links by default.  Command-line options
-  always will override those in RDOCOPT.
-
-  Available formatters:
-
-#{generator_descriptions}
-
-  RDoc understands the following file formats:
-
-      EOF
-
-      parsers = Hash.new { |h,parser| h[parser] = [] }
-
-      RDoc::Parser.parsers.each do |regexp, parser|
-        parsers[parser.name.sub('RDoc::Parser::', '')] << regexp.source
-      end
-
-      parsers.sort.each do |parser, regexp|
-        opt.banner += "  - #{parser}: #{regexp.join ', '}\n"
-      end
-      opt.banner += "  - TomDoc:  Only in ruby files\n"
-
-      opt.banner += "\n  The following options are deprecated:\n\n"
-
-      name_length = DEPRECATED.keys.sort_by { |k| k.length }.last.length
-
-      DEPRECATED.sort_by { |k,| k }.each do |name, reason|
-        opt.banner += "    %*1$2$s  %3$s\n" % [-name_length, name, reason]
-      end
-
-      opt.accept Template do |template|
-        template_dir = template_dir_for template
-
-        unless template_dir then
-          $stderr.puts "could not find template #{template}"
-          nil
-        else
-          [template, template_dir]
-        end
-      end
-
-      opt.accept Directory do |directory|
-        directory = File.expand_path directory
-
-        raise OptionParser::InvalidArgument unless File.directory? directory
-
-        directory
-      end
-
-      opt.accept Path do |path|
-        path = File.expand_path path
-
-        raise OptionParser::InvalidArgument unless File.exist? path
-
-        path
-      end
-
-      opt.accept PathArray do |paths,|
-        paths = if paths then
-                  paths.split(',').map { |d| d unless d.empty? }
-                end
-
-        paths.map do |path|
-          path = File.expand_path path
-
-          raise OptionParser::InvalidArgument unless File.exist? path
-
-          path
-        end
-      end
-
-      opt.separator nil
-      opt.separator "Parsing options:"
-      opt.separator nil
-
-      opt.on("--encoding=ENCODING", "-e", Encoding.list.map { |e| e.name },
-             "Specifies the output encoding.  All files",
-             "read will be converted to this encoding.",
-             "The default encoding is UTF-8.",
-             "--encoding is preferred over --charset") do |value|
-               @encoding = Encoding.find value
-               @charset = @encoding.name # may not be valid value
-             end
-
-      opt.separator nil
-
-      opt.on("--locale=NAME",
-             "Specifies the output locale.") do |value|
-        @locale_name = value
-      end
-
-      opt.on("--locale-data-dir=DIR",
-             "Specifies the directory where locale data live.") do |value|
-        @locale_dir = value
-      end
-
-      opt.separator nil
-
-      opt.on("--all", "-a",
-             "Synonym for --visibility=private.") do |value|
-        @visibility = :private
-      end
-
-      opt.separator nil
-
-      opt.on("--exclude=PATTERN", "-x", Regexp,
-             "Do not process files or directories",
-             "matching PATTERN.") do |value|
-        @exclude << value
-      end
-
-      opt.separator nil
-
-      opt.on("--no-skipping-tests", nil,
-             "Don't skip generating documentation for test and spec files") do |value|
-        @skip_tests = false
-      end
-
-      opt.separator nil
-
-      opt.on("--extension=NEW=OLD", "-E",
-             "Treat files ending with .new as if they",
-             "ended with .old. Using '-E cgi=rb' will",
-             "cause xxx.cgi to be parsed as a Ruby file.") do |value|
-        new, old = value.split(/=/, 2)
-
-        unless new and old then
-          raise OptionParser::InvalidArgument, "Invalid parameter to '-E'"
-        end
-
-        unless RDoc::Parser.alias_extension old, new then
-          raise OptionParser::InvalidArgument, "Unknown extension .#{old} to -E"
-        end
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]force-update", "-U",
-             "Forces rdoc to scan all sources even if",
-             "no files are newer than the flag file.") do |value|
-        @force_update = value
-      end
-
-      opt.separator nil
-
-      opt.on("--pipe", "-p",
-             "Convert RDoc on stdin to HTML") do
-        @pipe = true
-      end
-
-      opt.separator nil
-
-      opt.on("--tab-width=WIDTH", "-w", Integer,
-             "Set the width of tab characters.") do |value|
-        raise OptionParser::InvalidArgument,
-              "#{value} is an invalid tab width" if value <= 0
-        @tab_width = value
-      end
-
-      opt.separator nil
-
-      opt.on("--visibility=VISIBILITY", "-V", RDoc::VISIBILITIES + [:nodoc],
-             "Minimum visibility to document a method.",
-             "One of 'public', 'protected' (the default),",
-             "'private' or 'nodoc' (show everything)") do |value|
-        @visibility = value
-      end
-
-      opt.separator nil
-
-      markup_formats = RDoc::Text::MARKUP_FORMAT.keys.sort
-
-      opt.on("--markup=MARKUP", markup_formats,
-             "The markup format for the named files.",
-             "The default is rdoc.  Valid values are:",
-             markup_formats.join(', ')) do |value|
-        @markup = value
-      end
-
-      opt.separator nil
-
-      opt.on("--root=ROOT", Directory,
-             "Root of the source tree documentation",
-             "will be generated for.  Set this when",
-             "building documentation outside the",
-             "source directory.  Default is the",
-             "current directory.") do |root|
-        @root = Pathname(root)
-      end
-
-      opt.separator nil
-
-      opt.on("--page-dir=DIR", Directory,
-             "Directory where guides, your FAQ or",
-             "other pages not associated with a class",
-             "live.  Set this when you don't store",
-             "such files at your project root.",
-             "NOTE: Do not use the same file name in",
-             "the page dir and the root of your project") do |page_dir|
-        @page_dir = page_dir
-      end
-
-      opt.separator nil
-      opt.separator "Common generator options:"
-      opt.separator nil
-
-      opt.on("--force-output", "-O",
-             "Forces rdoc to write the output files,",
-             "even if the output directory exists",
-             "and does not seem to have been created",
-             "by rdoc.") do |value|
-        @force_output = value
-      end
-
-      opt.separator nil
-
-      generator_text = @generators.keys.map { |name| "  #{name}" }.sort
-
-      opt.on("-f", "--fmt=FORMAT", "--format=FORMAT", @generators.keys,
-             "Set the output formatter.  One of:", *generator_text) do |value|
-        check_generator
-
-        @generator_name = value.downcase
-        setup_generator
-      end
-
-      opt.separator nil
-
-      opt.on("--include=DIRECTORIES", "-i", PathArray,
-             "Set (or add to) the list of directories to",
-             "be searched when satisfying :include:",
-             "requests. Can be used more than once.") do |value|
-        @rdoc_include.concat value.map { |dir| dir.strip }
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]coverage-report=[LEVEL]", "--[no-]dcov", "-C", Integer,
-             "Prints a report on undocumented items.",
-             "Does not generate files.") do |value|
-        value = 0 if value.nil? # Integer converts -C to nil
-
-        @coverage_report = value
-        @force_update = true if value
-      end
-
-      opt.separator nil
-
-      opt.on("--output=DIR", "--op", "-o",
-             "Set the output directory.") do |value|
-        @op_dir = value
-      end
-
-      opt.separator nil
-
-      opt.on("-d",
-             "Deprecated --diagram option.",
-             "Prevents firing debug mode",
-             "with legacy invocation.") do |value|
-      end
-
-      opt.separator nil
-      opt.separator 'HTML generator options:'
-      opt.separator nil
-
-      opt.on("--charset=CHARSET", "-c",
-             "Specifies the output HTML character-set.",
-             "Use --encoding instead of --charset if",
-             "available.") do |value|
-        @charset = value
-      end
-
-      opt.separator nil
-
-      opt.on("--hyperlink-all", "-A",
-             "Generate hyperlinks for all words that",
-             "correspond to known methods, even if they",
-             "do not start with '#' or '::' (legacy",
-             "behavior).") do |value|
-        @hyperlink_all = value
-      end
-
-      opt.separator nil
-
-      opt.on("--main=NAME", "-m",
-             "NAME will be the initial page displayed.") do |value|
-        @main_page = value
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]line-numbers", "-N",
-             "Include line numbers in the source code.",
-             "By default, only the number of the first",
-             "line is displayed, in a leading comment.") do |value|
-        @line_numbers = value
-      end
-
-      opt.separator nil
-
-      opt.on("--show-hash", "-H",
-             "A name of the form #name in a comment is a",
-             "possible hyperlink to an instance method",
-             "name. When displayed, the '#' is removed",
-             "unless this option is specified.") do |value|
-        @show_hash = value
-      end
-
-      opt.separator nil
-
-      opt.on("--template=NAME", "-T", Template,
-             "Set the template used when generating",
-             "output. The default depends on the",
-             "formatter used.") do |(template, template_dir)|
-        @template     = template
-        @template_dir = template_dir
-      end
-
-      opt.separator nil
-
-      opt.on("--template-stylesheets=FILES", PathArray,
-             "Set (or add to) the list of files to",
-             "include with the html template.") do |value|
-        @template_stylesheets.concat value
-      end
-
-      opt.separator nil
-
-      opt.on("--title=TITLE", "-t",
-             "Set TITLE as the title for HTML output.") do |value|
-        @title = value
-      end
-
-      opt.separator nil
-
-      opt.on("--copy-files=PATH", Path,
-             "Specify a file or directory to copy static",
-             "files from.",
-             "If a file is given it will be copied into",
-             "the output dir.  If a directory is given the",
-             "entire directory will be copied.",
-             "You can use this multiple times") do |value|
-        @static_path << value
-      end
-
-      opt.separator nil
-
-      opt.on("--webcvs=URL", "-W",
-             "Specify a URL for linking to a web frontend",
-             "to CVS. If the URL contains a '\%s', the",
-             "name of the current file will be",
-             "substituted; if the URL doesn't contain a",
-             "'\%s', the filename will be appended to it.") do |value|
-        @webcvs = value
-      end
-
-      opt.separator nil
-      opt.separator "ri generator options:"
-      opt.separator nil
-
-      opt.on("--ri", "-r",
-             "Generate output for use by `ri`. The files",
-             "are stored in the '.rdoc' directory under",
-             "your home directory unless overridden by a",
-             "subsequent --op parameter, so no special",
-             "privileges are needed.") do |value|
-        check_generator
-
-        @generator_name = "ri"
-        @op_dir ||= RDoc::RI::Paths::HOMEDIR
-        setup_generator
-      end
-
-      opt.separator nil
-
-      opt.on("--ri-site", "-R",
-             "Generate output for use by `ri`. The files",
-             "are stored in a site-wide directory,",
-             "making them accessible to others, so",
-             "special privileges are needed.") do |value|
-        check_generator
-
-        @generator_name = "ri"
-        @op_dir = RDoc::RI::Paths.site_dir
-        setup_generator
-      end
-
-      opt.separator nil
-      opt.separator "Generic options:"
-      opt.separator nil
-
-      opt.on("--write-options",
-             "Write .rdoc_options to the current",
-             "directory with the given options.  Not all",
-             "options will be used.  See RDoc::Options",
-             "for details.") do |value|
-        @write_options = true
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]dry-run",
-             "Don't write any files") do |value|
-        @dry_run = value
-      end
-
-      opt.separator nil
-
-      opt.on("-D", "--[no-]debug",
-             "Displays lots on internal stuff.") do |value|
-        $DEBUG_RDOC = value
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]ignore-invalid",
-             "Ignore invalid options and continue",
-             "(default true).") do |value|
-        ignore_invalid = value
-      end
-
-      opt.separator nil
-
-      opt.on("--quiet", "-q",
-             "Don't show progress as we parse.") do |value|
-        @verbosity = 0
-      end
-
-      opt.separator nil
-
-      opt.on("--verbose", "-V",
-             "Display extra progress as RDoc parses") do |value|
-        @verbosity = 2
-      end
-
-      opt.separator nil
-
-      opt.on("--version", "-v", "print the version") do
-        puts opt.version
-        exit
-      end
-
-      opt.separator nil
-
-      opt.on("--help", "-h", "Display this help") do
-        RDoc::RDoc::GENERATORS.each_key do |generator|
-          setup_generator generator
-        end
-
-        puts opt.help
-        exit
-      end
-
-      opt.separator nil
-    end
-
-    setup_generator 'darkfish' if
-      argv.grep(/\A(-f|--fmt|--format|-r|-R|--ri|--ri-site)\b/).empty?
-
-    deprecated = []
-    invalid = []
-
-    begin
-      opts.parse! argv
-    rescue OptionParser::ParseError => e
-      if DEPRECATED[e.args.first] then
-        deprecated << e.args.first
-      elsif %w[--format --ri -r --ri-site -R].include? e.args.first then
-        raise
-      else
-        invalid << e.args.join(' ')
-      end
-
-      retry
-    end
-
-    unless @generator then
-      @generator = RDoc::Generator::Darkfish
-      @generator_name = 'darkfish'
-    end
-
-    if @pipe and not argv.empty? then
-      @pipe = false
-      invalid << '-p (with files)'
-    end
-
-    unless quiet then
-      deprecated.each do |opt|
-        $stderr.puts 'option ' + opt + ' is deprecated: ' + DEPRECATED[opt]
-      end
-    end
-
-    unless invalid.empty? then
-      invalid = "invalid options: #{invalid.join ', '}"
-
-      if ignore_invalid then
-        unless quiet then
-          $stderr.puts invalid
-          $stderr.puts '(invalid options are ignored)'
-        end
-      else
-        unless quiet then
-          $stderr.puts opts
-        end
-        $stderr.puts invalid
-        exit 1
-      end
-    end
-
-    @files = argv.dup
-
-    self
-  end
-
-  ##
-  # Don't display progress as we process the files
-
-  def quiet
-    @verbosity.zero?
-  end
-
-  ##
-  # Set quietness to +bool+
-
-  def quiet= bool
-    @verbosity = bool ? 0 : 1
-  end
-
-  ##
-  # Removes directories from +path+ that are outside the current directory
-
-  def sanitize_path path
-    require 'pathname'
-    dot = Pathname.new('.').expand_path
-
-    path.reject do |item|
-      path = Pathname.new(item).expand_path
-      is_reject = nil
-      relative = nil
-      begin
-        relative = path.relative_path_from(dot).to_s
-      rescue ArgumentError
-        # On Windows, sometimes crosses different drive letters.
-        is_reject = true
-      else
-        is_reject = relative.start_with? '..'
-      end
-      is_reject
-    end
-  end
-
-  ##
-  # Set up an output generator for the named +generator_name+.
-  #
-  # If the found generator responds to :setup_options it will be called with
-  # the options instance.  This allows generators to add custom options or set
-  # default options.
-
-  def setup_generator generator_name = @generator_name
-    @generator = @generators[generator_name]
-
-    unless @generator then
-      raise OptionParser::InvalidArgument,
-            "Invalid output formatter #{generator_name}"
-    end
-
-    return if @generator_options.include? @generator
-
-    @generator_name = generator_name
-    @generator_options << @generator
-
-    if @generator.respond_to? :setup_options then
-      @option_parser ||= OptionParser.new
-      @generator.setup_options self
-    end
-  end
-
-  ##
-  # Finds the template dir for +template+
-
-  def template_dir_for template
-    template_path = File.join 'rdoc', 'generator', 'template', template
-
-    $LOAD_PATH.map do |path|
-      File.join File.expand_path(path), template_path
-    end.find do |dir|
-      File.directory? dir
-    end
-  end
-
-  # Sets the minimum visibility of a documented method.
-  #
-  # Accepts +:public+, +:protected+, +:private+, +:nodoc+, or +:all+.
-  #
-  # When +:all+ is passed, visibility is set to +:private+, similarly to
-  # RDOCOPT="--all", see #visibility for more information.
-
-  def visibility= visibility
-    case visibility
-    when :all
-      @visibility = :private
-    else
-      @visibility = visibility
-    end
-  end
-
-  ##
-  # Displays a warning using Kernel#warn if we're being verbose
-
-  def warn message
-    super message if @verbosity > 1
-  end
-
-  ##
-  # Writes the YAML file .rdoc_options to the current directory containing the
-  # parsed options.
-
-  def write_options
-    RDoc.load_yaml
-
-    File.open '.rdoc_options', 'w' do |io|
-      io.set_encoding Encoding::UTF_8
-
-      io.print to_yaml
-    end
-  end
-
-  ##
-  # Loads options from .rdoc_options if the file exists, otherwise creates a
-  # new RDoc::Options instance.
-
-  def self.load_options
-    options_file = File.expand_path '.rdoc_options'
-    return RDoc::Options.new unless File.exist? options_file
-
-    RDoc.load_yaml
-
-    begin
-      options = YAML.safe_load File.read('.rdoc_options'), permitted_classes: [RDoc::Options, Symbol]
-    rescue Psych::SyntaxError
-      raise RDoc::Error, "#{options_file} is not a valid rdoc options file"
-    end
-
-    return RDoc::Options.new unless options # Allow empty file.
-
-    raise RDoc::Error, "#{options_file} is not a valid rdoc options file" unless
-      RDoc::Options === options or Hash === options
-
-    if Hash === options
-      # Override the default values with the contents of YAML file.
-      options = RDoc::Options.new options
-    end
-
-    options
-  end
-
-end
diff --git a/lib/rdoc/parser.rb b/lib/rdoc/parser.rb
deleted file mode 100644
index 425105effa..0000000000
--- a/lib/rdoc/parser.rb
+++ /dev/null
@@ -1,296 +0,0 @@
-# -*- coding: us-ascii -*-
-# frozen_string_literal: true
-
-##
-# A parser is simple a class that subclasses RDoc::Parser and implements #scan
-# to fill in an RDoc::TopLevel with parsed data.
-#
-# The initialize method takes an RDoc::TopLevel to fill with parsed content,
-# the name of the file to be parsed, the content of the file, an RDoc::Options
-# object and an RDoc::Stats object to inform the user of parsed items.  The
-# scan method is then called to parse the file and must return the
-# RDoc::TopLevel object.  By calling super these items will be set for you.
-#
-# In order to be used by RDoc the parser needs to register the file extensions
-# it can parse.  Use ::parse_files_matching to register extensions.
-#
-#   require 'rdoc'
-#
-#   class RDoc::Parser::Xyz < RDoc::Parser
-#     parse_files_matching /\.xyz$/
-#
-#     def initialize top_level, file_name, content, options, stats
-#       super
-#
-#       # extra initialization if needed
-#     end
-#
-#     def scan
-#       # parse file and fill in @top_level
-#     end
-#   end
-
-class RDoc::Parser
-
-  @parsers = []
-
-  class << self
-
-    ##
-    # An Array of arrays that maps file extension (or name) regular
-    # expressions to parser classes that will parse matching filenames.
-    #
-    # Use parse_files_matching to register a parser's file extensions.
-
-    attr_reader :parsers
-
-  end
-
-  ##
-  # The name of the file being parsed
-
-  attr_reader :file_name
-
-  ##
-  # Alias an extension to another extension. After this call, files ending
-  # "new_ext" will be parsed using the same parser as "old_ext"
-
-  def self.alias_extension(old_ext, new_ext)
-    old_ext = old_ext.sub(/^\.(.*)/, '\1')
-    new_ext = new_ext.sub(/^\.(.*)/, '\1')
-
-    parser = can_parse_by_name "xxx.#{old_ext}"
-    return false unless parser
-
-    RDoc::Parser.parsers.unshift [/\.#{new_ext}$/, parser]
-
-    true
-  end
-
-  ##
-  # Determines if the file is a "binary" file which basically means it has
-  # content that an RDoc parser shouldn't try to consume.
-
-  def self.binary?(file)
-    return false if file =~ /\.(rdoc|txt)$/
-
-    s = File.read(file, 1024) or return false
-
-    return true if s[0, 2] == Marshal.dump('')[0, 2] or s.index("\x00")
-
-    mode = 'r:utf-8' # default source encoding has been changed to utf-8
-    s.sub!(/\A#!.*\n/, '')     # assume shebang line isn't longer than 1024.
-    encoding = s[/^\s*\#\s*(?:-\*-\s*)?(?:en)?coding:\s*([^\s;]+?)(?:-\*-|[\s;])/, 1]
-    mode = "rb:#{encoding}" if encoding
-    s = File.open(file, mode) {|f| f.gets(nil, 1024)}
-
-    not s.valid_encoding?
-  end
-
-  ##
-  # Checks if +file+ is a zip file in disguise.  Signatures from
-  # http://www.garykessler.net/library/file_sigs.html
-
-  def self.zip? file
-    zip_signature = File.read file, 4
-
-    zip_signature == "PK\x03\x04" or
-      zip_signature == "PK\x05\x06" or
-      zip_signature == "PK\x07\x08"
-  rescue
-    false
-  end
-
-  ##
-  # Return a parser that can handle a particular extension
-
-  def self.can_parse file_name
-    parser = can_parse_by_name file_name
-
-    # HACK Selenium hides a jar file using a .txt extension
-    return if parser == RDoc::Parser::Simple and zip? file_name
-
-    parser
-  end
-
-  ##
-  # Returns a parser that can handle the extension for +file_name+.  This does
-  # not depend upon the file being readable.
-
-  def self.can_parse_by_name file_name
-    _, parser = RDoc::Parser.parsers.find { |regexp,| regexp =~ file_name }
-
-    # The default parser must not parse binary files
-    ext_name = File.extname file_name
-    return parser if ext_name.empty?
-
-    if parser == RDoc::Parser::Simple and ext_name !~ /txt|rdoc/ then
-      case mode = check_modeline(file_name)
-      when nil, 'rdoc' then # continue
-      else
-        RDoc::Parser.parsers.find { |_, p| return p if mode.casecmp?(p.name[/\w+\z/]) }
-        return nil
-      end
-    end
-
-    parser
-  rescue Errno::EACCES
-  end
-
-  ##
-  # Returns the file type from the modeline in +file_name+
-
-  def self.check_modeline file_name
-    line = File.open file_name do |io|
-      io.gets
-    end
-
-    /-\*-\s*(.*?\S)\s*-\*-/ =~ line
-
-    return nil unless type = $1
-
-    if /;/ =~ type then
-      return nil unless /(?:\s|\A)mode:\s*([^\s;]+)/i =~ type
-      type = $1
-    end
-
-    return nil if /coding:/i =~ type
-
-    type.downcase
-  rescue ArgumentError
-  rescue Encoding::InvalidByteSequenceError # invalid byte sequence
-
-  end
-
-  ##
-  # Finds and instantiates the correct parser for the given +file_name+ and
-  # +content+.
-
-  def self.for top_level, file_name, content, options, stats
-    return if binary? file_name
-
-    parser = use_markup content
-
-    unless parser then
-      parse_name = file_name
-
-      # If no extension, look for shebang
-      if file_name !~ /\.\w+$/ && content =~ %r{\A#!(.+)} then
-        shebang = $1
-        case shebang
-        when %r{env\s+ruby}, %r{/ruby}
-          parse_name = 'dummy.rb'
-        end
-      end
-
-      parser = can_parse parse_name
-    end
-
-    return unless parser
-
-    content = remove_modeline content
-
-    parser.new top_level, file_name, content, options, stats
-  rescue SystemCallError
-    nil
-  end
-
-  ##
-  # Record which file types this parser can understand.
-  #
-  # It is ok to call this multiple times.
-
-  def self.parse_files_matching(regexp)
-    RDoc::Parser.parsers.unshift [regexp, self]
-  end
-
-  ##
-  # Removes an emacs-style modeline from the first line of the document
-
-  def self.remove_modeline content
-    content.sub(/\A.*-\*-\s*(.*?\S)\s*-\*-.*\r?\n/, '')
-  end
-
-  ##
-  # If there is a <tt>markup: parser_name</tt> comment at the front of the
-  # file, use it to determine the parser.  For example:
-  #
-  #   # markup: rdoc
-  #   # Class comment can go here
-  #
-  #   class C
-  #   end
-  #
-  # The comment should appear as the first line of the +content+.
-  #
-  # If the content contains a shebang or editor modeline the comment may
-  # appear on the second or third line.
-  #
-  # Any comment style may be used to hide the markup comment.
-
-  def self.use_markup content
-    markup = content.lines.first(3).grep(/markup:\s+(\w+)/) { $1 }.first
-
-    return unless markup
-
-    # TODO Ruby should be returned only when the filename is correct
-    return RDoc::Parser::Ruby if %w[tomdoc markdown].include? markup
-
-    markup = Regexp.escape markup
-
-    _, selected = RDoc::Parser.parsers.find do |_, parser|
-      /^#{markup}$/i =~ parser.name.sub(/.*:/, '')
-    end
-
-    selected
-  end
-
-  ##
-  # Creates a new Parser storing +top_level+, +file_name+, +content+,
-  # +options+ and +stats+ in instance variables.  In +@preprocess+ an
-  # RDoc::Markup::PreProcess object is created which allows processing of
-  # directives.
-
-  def initialize top_level, file_name, content, options, stats
-    @top_level = top_level
-    @top_level.parser = self.class
-    @store = @top_level.store
-
-    @file_name = file_name
-    @content = content
-    @options = options
-    @stats = stats
-
-    @preprocess = RDoc::Markup::PreProcess.new @file_name, @options.rdoc_include
-    @preprocess.options = @options
-  end
-
-  autoload :RubyTools, "#{__dir__}/parser/ruby_tools"
-  autoload :Text,      "#{__dir__}/parser/text"
-
-  ##
-  # Normalizes tabs in +body+
-
-  def handle_tab_width(body)
-    if /\t/ =~ body
-      tab_width = @options.tab_width
-      body.split(/\n/).map do |line|
-        1 while line.gsub!(/\t+/) do
-          b, e = $~.offset(0)
-          ' ' * (tab_width * (e-b) - b % tab_width)
-        end
-        line
-      end.join "\n"
-    else
-      body
-    end
-  end
-end
-
-# simple must come first in order to show up last in the parsers list
-require_relative 'parser/simple'
-require_relative 'parser/c'
-require_relative 'parser/changelog'
-require_relative 'parser/markdown'
-require_relative 'parser/rd'
-require_relative 'parser/ruby'
diff --git a/lib/rdoc/parser/c.rb b/lib/rdoc/parser/c.rb
deleted file mode 100644
index f8f238fd74..0000000000
--- a/lib/rdoc/parser/c.rb
+++ /dev/null
@@ -1,1236 +0,0 @@
-# frozen_string_literal: true
-require 'tsort'
-
-##
-# RDoc::Parser::C attempts to parse C extension files.  It looks for
-# the standard patterns that you find in extensions: +rb_define_class+,
-# +rb_define_method+ and so on.  It tries to find the corresponding
-# C source for the methods and extract comments, but if we fail
-# we don't worry too much.
-#
-# The comments associated with a Ruby method are extracted from the C
-# comment block associated with the routine that _implements_ that
-# method, that is to say the method whose name is given in the
-# +rb_define_method+ call. For example, you might write:
-#
-#   /*
-#    * Returns a new array that is a one-dimensional flattening of this
-#    * array (recursively). That is, for every element that is an array,
-#    * extract its elements into the new array.
-#    *
-#    *    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]
-#    */
-#    static VALUE
-#    rb_ary_flatten(VALUE ary)
-#    {
-#        ary = rb_obj_dup(ary);
-#        rb_ary_flatten_bang(ary);
-#        return ary;
-#    }
-#
-#    ...
-#
-#    void
-#    Init_Array(void)
-#    {
-#      ...
-#      rb_define_method(rb_cArray, "flatten", rb_ary_flatten, 0);
-#
-# Here RDoc will determine from the +rb_define_method+ line that there's a
-# method called "flatten" in class Array, and will look for the implementation
-# in the method +rb_ary_flatten+. It will then use the comment from that
-# method in the HTML output. This method must be in the same source file
-# as the +rb_define_method+.
-#
-# The comment blocks may include special directives:
-#
-# [Document-class: +name+]
-#   Documentation for the named class.
-#
-# [Document-module: +name+]
-#   Documentation for the named module.
-#
-# [Document-const: +name+]
-#   Documentation for the named +rb_define_const+.
-#
-#   Constant values can be supplied on the first line of the comment like so:
-#
-#     /* 300: The highest possible score in bowling */
-#     rb_define_const(cFoo, "PERFECT", INT2FIX(300));
-#
-#   The value can contain internal colons so long as they are escaped with a \
-#
-# [Document-global: +name+]
-#   Documentation for the named +rb_define_global_const+
-#
-# [Document-variable: +name+]
-#   Documentation for the named +rb_define_variable+
-#
-# [Document-method\: +method_name+]
-#   Documentation for the named method.  Use this when the method name is
-#   unambiguous.
-#
-# [Document-method\: <tt>ClassName::method_name</tt>]
-#   Documentation for a singleton method in the given class.  Use this when
-#   the method name alone is ambiguous.
-#
-# [Document-method\: <tt>ClassName#method_name</tt>]
-#   Documentation for a instance method in the given class.  Use this when the
-#   method name alone is ambiguous.
-#
-# [Document-attr: +name+]
-#   Documentation for the named attribute.
-#
-# [call-seq:  <i>text up to an empty line</i>]
-#   Because C source doesn't give descriptive names to Ruby-level parameters,
-#   you need to document the calling sequence explicitly
-#
-# In addition, RDoc assumes by default that the C method implementing a
-# Ruby function is in the same source file as the rb_define_method call.
-# If this isn't the case, add the comment:
-#
-#   rb_define_method(....);  // in filename
-#
-# As an example, we might have an extension that defines multiple classes
-# in its Init_xxx method. We could document them using
-#
-#   /*
-#    * Document-class:  MyClass
-#    *
-#    * Encapsulate the writing and reading of the configuration
-#    * file. ...
-#    */
-#
-#   /*
-#    * Document-method: read_value
-#    *
-#    * call-seq:
-#    *   cfg.read_value(key)            -> value
-#    *   cfg.read_value(key} { |key| }  -> value
-#    *
-#    * Return the value corresponding to +key+ from the configuration.
-#    * In the second form, if the key isn't found, invoke the
-#    * block and return its value.
-#    */
-
-class RDoc::Parser::C < RDoc::Parser
-
-  parse_files_matching(/\.(?:([CcHh])\1?|c([+xp])\2|y)\z/)
-
-  include RDoc::Text
-
-  # :stopdoc:
-  BOOL_ARG_PATTERN = /\s*+\b([01]|Q?(?:true|false)|TRUE|FALSE)\b\s*/
-  TRUE_VALUES = ['1', 'TRUE', 'true', 'Qtrue'].freeze
-  # :startdoc:
-
-  ##
-  # Maps C variable names to names of Ruby classes or modules
-
-  attr_reader :classes
-
-  ##
-  # C file the parser is parsing
-
-  attr_accessor :content
-
-  ##
-  # Dependencies from a missing enclosing class to the classes in
-  # missing_dependencies that depend upon it.
-
-  attr_reader :enclosure_dependencies
-
-  ##
-  # Maps C variable names to names of Ruby classes (and singleton classes)
-
-  attr_reader :known_classes
-
-  ##
-  # Classes found while parsing the C file that were not yet registered due to
-  # a missing enclosing class.  These are processed by do_missing
-
-  attr_reader :missing_dependencies
-
-  ##
-  # Maps C variable names to names of Ruby singleton classes
-
-  attr_reader :singleton_classes
-
-  ##
-  # The TopLevel items in the parsed file belong to
-
-  attr_reader :top_level
-
-  ##
-  # Prepares for parsing a C file.  See RDoc::Parser#initialize for details on
-  # the arguments.
-
-  def initialize top_level, file_name, content, options, stats
-    super
-
-    @known_classes = RDoc::KNOWN_CLASSES.dup
-    @content = handle_tab_width handle_ifdefs_in @content
-    @file_dir = File.dirname @file_name
-
-    @classes           = load_variable_map :c_class_variables
-    @singleton_classes = load_variable_map :c_singleton_class_variables
-
-    @markup = @options.markup
-
-    # class_variable => { function => [method, ...] }
-    @methods = Hash.new { |h, f| h[f] = Hash.new { |i, m| i[m] = [] } }
-
-    # missing variable => [handle_class_module arguments]
-    @missing_dependencies = {}
-
-    # missing enclosure variable => [dependent handle_class_module arguments]
-    @enclosure_dependencies = Hash.new { |h, k| h[k] = [] }
-    @enclosure_dependencies.instance_variable_set :@missing_dependencies,
-                                                  @missing_dependencies
-
-    @enclosure_dependencies.extend TSort
-
-    def @enclosure_dependencies.tsort_each_node &block
-      each_key(&block)
-    rescue TSort::Cyclic => e
-      cycle_vars = e.message.scan(/"(.*?)"/).flatten
-
-      cycle = cycle_vars.sort.map do |var_name|
-        delete var_name
-
-        var_name, type, mod_name, = @missing_dependencies[var_name]
-
-        "#{type} #{mod_name} (#{var_name})"
-      end.join ', '
-
-      warn "Unable to create #{cycle} due to a cyclic class or module creation"
-
-      retry
-    end
-
-    def @enclosure_dependencies.tsort_each_child node, &block
-      fetch(node, []).each(&block)
-    end
-  end
-
-  ##
-  # Scans #content for rb_define_alias
-
-  def do_aliases
-    @content.scan(/rb_define_alias\s*\(
-                   \s*(\w+),
-                   \s*"(.+?)",
-                   \s*"(.+?)"
-                   \s*\)/xm) do |var_name, new_name, old_name|
-      class_name = @known_classes[var_name]
-
-      unless class_name then
-        @options.warn "Enclosing class or module %p for alias %s %s is not known" % [
-          var_name, new_name, old_name]
-        next
-      end
-
-      class_obj = find_class var_name, class_name
-      comment = find_alias_comment var_name, new_name, old_name
-      comment.normalize
-      if comment.to_s.empty? and existing_method = class_obj.method_list.find { |m| m.name == old_name}
-        comment = existing_method.comment
-      end
-      add_alias(var_name, class_obj, old_name, new_name, comment)
-    end
-  end
-
-  ##
-  # Add alias, either from a direct alias definition, or from two
-  # method that reference the same function.
-
-  def add_alias(var_name, class_obj, old_name, new_name, comment)
-    al = RDoc::Alias.new '', old_name, new_name, ''
-    al.singleton = @singleton_classes.key? var_name
-    al.comment = comment
-    al.record_location @top_level
-    class_obj.add_alias al
-    @stats.add_alias al
-    al
-  end
-
-  ##
-  # Scans #content for rb_attr and rb_define_attr
-
-  def do_attrs
-    @content.scan(/rb_attr\s*\(
-                   \s*(\w+),
-                   \s*([\w"()]+),
-                   #{BOOL_ARG_PATTERN},
-                   #{BOOL_ARG_PATTERN},
-                   \s*\w+\);/xmo) do |var_name, attr_name, read, write|
-      handle_attr var_name, attr_name, read, write
-    end
-
-    @content.scan(%r%rb_define_attr\(
-                             \s*([\w\.]+),
-                             \s*"([^"]+)",
-                             #{BOOL_ARG_PATTERN},
-                             #{BOOL_ARG_PATTERN}\);
-                %xmo) do |var_name, attr_name, read, write|
-      handle_attr var_name, attr_name, read, write
-    end
-  end
-
-  ##
-  # Scans #content for boot_defclass
-
-  def do_boot_defclass
-    @content.scan(/(\w+)\s*=\s*boot_defclass\s*\(\s*"(\w+?)",\s*(\w+?)\s*\)/) do
-      |var_name, class_name, parent|
-      parent = nil if parent == "0"
-      handle_class_module(var_name, :class, class_name, parent, nil)
-    end
-  end
-
-  ##
-  # Scans #content for rb_define_class, boot_defclass, rb_define_class_under
-  # and rb_singleton_class
-
-  def do_classes_and_modules
-    do_boot_defclass if @file_name == "class.c"
-
-    @content.scan(
-      %r(
-        (?<open>\s*\(\s*) {0}
-        (?<close>\s*\)\s*) {0}
-        (?<name>\s*"(?<class_name>\w+)") {0}
-        (?<parent>\s*(?:
-          (?<parent_name>[\w\*\s\(\)\.\->]+) |
-          rb_path2class\s*\(\s*"(?<path>[\w:]+)"\s*\)
-        )) {0}
-        (?<under>\w+) {0}
-
-        (?<var_name>[\w\.]+)\s* =
-        \s*rb_(?:
-          define_(?:
-            class(?: # rb_define_class(name, parent_name)
-              \(\s*
-                \g<name>,
-                \g<parent>
-              \s*\)
-            |
-              _under\g<open> # rb_define_class_under(under, name, parent_name...)
-                \g<under>,
-                \g<name>,
-                \g<parent>
-              \g<close>
-            )
-          |
-            (?<module>)
-            module(?: # rb_define_module(name)
-              \g<open>
-                \g<name>
-              \g<close>
-            |
-              _under\g<open> # rb_define_module_under(under, name)
-                \g<under>,
-                \g<name>
-              \g<close>
-            )
-          )
-      |
-        (?<attributes>(?:\s*"\w+",)*\s*NULL\s*) {0}
-        struct_define(?:
-          \g<open> # rb_struct_define(name, ...)
-            \g<name>,
-        |
-          _under\g<open> # rb_struct_define_under(under, name, ...)
-            \g<under>,
-            \g<name>,
-        |
-          _without_accessor(?:
-            \g<open> # rb_struct_define_without_accessor(name, parent_name, ...)
-          |
-            _under\g<open> # rb_struct_define_without_accessor_under(under, name, parent_name, ...)
-              \g<under>,
-          )
-            \g<name>,
-            \g<parent>,
-            \s*\w+,        # Allocation function
-        )
-          \g<attributes>
-        \g<close>
-      |
-        singleton_class\g<open> # rb_singleton_class(target_class_name)
-          (?<target_class_name>\w+)
-        \g<close>
-        )
-      )mx
-    ) do
-      if target_class_name = $~[:target_class_name]
-        # rb_singleton_class(target_class_name)
-        handle_singleton $~[:var_name], target_class_name
-        next
-      end
-
-      var_name = $~[:var_name]
-      type = $~[:module] ? :module : :class
-      class_name = $~[:class_name]
-      parent_name = $~[:parent_name] || $~[:path]
-      under = $~[:under]
-      attributes = $~[:attributes]
-
-      handle_class_module(var_name, type, class_name, parent_name, under)
-      if attributes and !parent_name # rb_struct_define *not* without_accessor
-        true_flag = 'Qtrue'
-        attributes.scan(/"\K\w+(?=")/) do |attr_name|
-          handle_attr var_name, attr_name, true_flag, true_flag
-        end
-      end
-    end
-  end
-
-  ##
-  # Scans #content for rb_define_variable, rb_define_readonly_variable,
-  # rb_define_const and rb_define_global_const
-
-  def do_constants
-    @content.scan(%r%\Wrb_define_
-                   ( variable          |
-                     readonly_variable |
-                     const             |
-                     global_const        )
-               \s*\(
-                 (?:\s*(\w+),)?
-                 \s*"(\w+)",
-                 \s*(.*?)\s*\)\s*;
-                 %xm) do |type, var_name, const_name, definition|
-      var_name = "rb_cObject" if !var_name or var_name == "rb_mKernel"
-      handle_constants type, var_name, const_name, definition
-    end
-
-    @content.scan(%r%
-                  \Wrb_curses_define_const
-                  \s*\(
-                    \s*
-                    (\w+)
-                    \s*
-                  \)
-                  \s*;%xm) do |consts|
-      const = consts.first
-
-      handle_constants 'const', 'mCurses', const, "UINT2NUM(#{const})"
-    end
-
-    @content.scan(%r%
-                  \Wrb_file_const
-                  \s*\(
-                    \s*
-                    "([^"]+)",
-                    \s*
-                    (.*?)
-                    \s*
-                  \)
-                  \s*;%xm) do |name, value|
-      handle_constants 'const', 'rb_mFConst', name, value
-    end
-  end
-
-
-  ##
-  # Scans #content for rb_include_module
-
-  def do_includes
-    @content.scan(/rb_include_module\s*\(\s*(\w+?),\s*(\w+?)\s*\)/) do |c,m|
-      next unless cls = @classes[c]
-      m = @known_classes[m] || m
-
-      comment = new_comment '', @top_level, :c
-      incl = cls.add_include RDoc::Include.new(m, comment)
-      incl.record_location @top_level
-    end
-  end
-
-  ##
-  # Scans #content for rb_define_method, rb_define_singleton_method,
-  # rb_define_module_function, rb_define_private_method,
-  # rb_define_global_function and define_filetest_function
-
-  def do_methods
-    @content.scan(%r%rb_define_
-                   (
-                      singleton_method |
-                      method           |
-                      module_function  |
-                      private_method
-                   )
-                   \s*\(\s*([\w\.]+),
-                     \s*"([^"]+)",
-                     \s*(?:RUBY_METHOD_FUNC\(|VALUEFUNC\(|\(METHOD\))?(\w+)\)?,
-                     \s*(-?\w+)\s*\)
-                   (?:;\s*/[*/]\s+in\s+(\w+?\.(?:cpp|c|y)))?
-                 %xm) do |type, var_name, meth_name, function, param_count, source_file|
-
-      # Ignore top-object and weird struct.c dynamic stuff
-      next if var_name == "ruby_top_self"
-      next if var_name == "nstr"
-
-      var_name = "rb_cObject" if var_name == "rb_mKernel"
-      handle_method(type, var_name, meth_name, function, param_count,
-                    source_file)
-    end
-
-    @content.scan(%r%rb_define_global_function\s*\(
-                             \s*"([^"]+)",
-                             \s*(?:RUBY_METHOD_FUNC\(|VALUEFUNC\()?(\w+)\)?,
-                             \s*(-?\w+)\s*\)
-                (?:;\s*/[*/]\s+in\s+(\w+?\.[cy]))?
-                %xm) do |meth_name, function, param_count, source_file|
-      handle_method("method", "rb_mKernel", meth_name, function, param_count,
-                    source_file)
-    end
-
-    @content.scan(/define_filetest_function\s*\(
-                     \s*"([^"]+)",
-                     \s*(?:RUBY_METHOD_FUNC\(|VALUEFUNC\()?(\w+)\)?,
-                     \s*(-?\w+)\s*\)/xm) do |meth_name, function, param_count|
-
-      handle_method("method", "rb_mFileTest", meth_name, function, param_count)
-      handle_method("singleton_method", "rb_cFile", meth_name, function,
-                    param_count)
-    end
-  end
-
-  ##
-  # Creates classes and module that were missing were defined due to the file
-  # order being different than the declaration order.
-
-  def do_missing
-    return if @missing_dependencies.empty?
-
-    @enclosure_dependencies.tsort.each do |in_module|
-      arguments = @missing_dependencies.delete in_module
-
-      next unless arguments # dependency on existing class
-
-      handle_class_module(*arguments)
-    end
-  end
-
-  ##
-  # Finds the comment for an alias on +class_name+ from +new_name+ to
-  # +old_name+
-
-  def find_alias_comment class_name, new_name, old_name
-    content =~ %r%((?>/\*.*?\*/\s+))
-                  rb_define_alias\(\s*#{Regexp.escape class_name}\s*,
-                                   \s*"#{Regexp.escape new_name}"\s*,
-                                   \s*"#{Regexp.escape old_name}"\s*\);%xm
-
-    new_comment($1 || '', @top_level, :c)
-  end
-
-  ##
-  # Finds a comment for rb_define_attr, rb_attr or Document-attr.
-  #
-  # +var_name+ is the C class variable the attribute is defined on.
-  # +attr_name+ is the attribute's name.
-  #
-  # +read+ and +write+ are the read/write flags ('1' or '0').  Either both or
-  # neither must be provided.
-
-  def find_attr_comment var_name, attr_name, read = nil, write = nil
-    attr_name = Regexp.escape attr_name
-
-    rw = if read and write then
-           /\s*#{read}\s*,\s*#{write}\s*/xm
-         else
-           /.*?/m
-         end
-
-    comment = if @content =~ %r%((?>/\*.*?\*/\s+))
-                                rb_define_attr\((?:\s*#{var_name},)?\s*
-                                                "#{attr_name}"\s*,
-                                                #{rw}\)\s*;%xm then
-                $1
-              elsif @content =~ %r%((?>/\*.*?\*/\s+))
-                                   rb_attr\(\s*#{var_name}\s*,
-                                            \s*#{attr_name}\s*,
-                                            #{rw},.*?\)\s*;%xm then
-                $1
-              elsif @content =~ %r%(/\*.*?(?:\s*\*\s*)?)
-                                   Document-attr:\s#{attr_name}\s*?\n
-                                   ((?>(.|\n)*?\*/))%x then
-                "#{$1}\n#{$2}"
-              else
-                ''
-              end
-
-    new_comment comment, @top_level, :c
-  end
-
-  ##
-  # Generate a Ruby-method table
-
-  def gen_body_table file_content
-    table = {}
-    file_content.scan(%r{
-      ((?>/\*.*?\*/\s*)?)
-      ((?:\w+\s+){0,2} VALUE\s+(\w+)
-        \s*(?:\([^\)]*\))(?:[^\);]|$))
-    | ((?>/\*.*?\*/\s*))^\s*(\#\s*define\s+(\w+)\s+(\w+))
-    | ^\s*\#\s*define\s+(\w+)\s+(\w+)
-    }xm) do
-      case
-      when name = $3
-        table[name] = [:func_def, $1, $2, $~.offset(2)] if !(t = table[name]) || t[0] != :func_def
-      when name = $6
-        table[name] = [:macro_def, $4, $5, $~.offset(5), $7] if !(t = table[name]) || t[0] == :macro_alias
-      when name = $8
-        table[name] ||= [:macro_alias, $9]
-      end
-    end
-    table
-  end
-
-  ##
-  # Find the C code corresponding to a Ruby method
-
-  def find_body class_name, meth_name, meth_obj, file_content, quiet = false
-    if file_content
-      @body_table ||= {}
-      @body_table[file_content] ||= gen_body_table file_content
-      type, *args = @body_table[file_content][meth_name]
-    end
-
-    case type
-    when :func_def
-      comment = new_comment args[0], @top_level, :c
-      body = args[1]
-      offset, = args[2]
-
-      comment.remove_private if comment
-
-      # try to find the whole body
-      body = $& if /#{Regexp.escape body}[^(]*?\{.*?^\}/m =~ file_content
-
-      # The comment block may have been overridden with a 'Document-method'
-      # block. This happens in the interpreter when multiple methods are
-      # vectored through to the same C method but those methods are logically
-      # distinct (for example Kernel.hash and Kernel.object_id share the same
-      # implementation
-
-      override_comment = find_override_comment class_name, meth_obj
-      comment = override_comment if override_comment
-
-      comment.normalize
-      find_modifiers comment, meth_obj if comment
-
-      #meth_obj.params = params
-      meth_obj.start_collecting_tokens
-      tk = { :line_no => 1, :char_no => 1, :text => body }
-      meth_obj.add_token tk
-      meth_obj.comment = comment
-      meth_obj.line    = file_content[0, offset].count("\n") + 1
-
-      body
-    when :macro_def
-      comment = new_comment args[0], @top_level, :c
-      body = args[1]
-      offset, = args[2]
-
-      find_body class_name, args[3], meth_obj, file_content, true
-
-      comment.normalize
-      find_modifiers comment, meth_obj
-
-      meth_obj.start_collecting_tokens
-      tk = { :line_no => 1, :char_no => 1, :text => body }
-      meth_obj.add_token tk
-      meth_obj.comment = comment
-      meth_obj.line    = file_content[0, offset].count("\n") + 1
-
-      body
-    when :macro_alias
-      # with no comment we hope the aliased definition has it and use it's
-      # definition
-
-      body = find_body(class_name, args[0], meth_obj, file_content, true)
-
-      return body if body
-
-      @options.warn "No definition for #{meth_name}"
-      false
-    else # No body, but might still have an override comment
-      comment = find_override_comment class_name, meth_obj
-
-      if comment then
-        comment.normalize
-        find_modifiers comment, meth_obj
-        meth_obj.comment = comment
-
-        ''
-      else
-        @options.warn "No definition for #{meth_name}"
-        false
-      end
-    end
-  end
-
-  ##
-  # Finds a RDoc::NormalClass or RDoc::NormalModule for +raw_name+
-
-  def find_class(raw_name, name, base_name = nil)
-    unless @classes[raw_name]
-      if raw_name =~ /^rb_m/
-        container = @top_level.add_module RDoc::NormalModule, name
-      else
-        container = @top_level.add_class RDoc::NormalClass, name
-      end
-      container.name = base_name if base_name
-
-      container.record_location @top_level
-      @classes[raw_name] = container
-    end
-    @classes[raw_name]
-  end
-
-  ##
-  # Look for class or module documentation above Init_+class_name+(void),
-  # in a Document-class +class_name+ (or module) comment or above an
-  # rb_define_class (or module).  If a comment is supplied above a matching
-  # Init_ and a rb_define_class the Init_ comment is used.
-  #
-  #   /*
-  #    * This is a comment for Foo
-  #    */
-  #   Init_Foo(void) {
-  #       VALUE cFoo = rb_define_class("Foo", rb_cObject);
-  #   }
-  #
-  #   /*
-  #    * Document-class: Foo
-  #    * This is a comment for Foo
-  #    */
-  #   Init_foo(void) {
-  #       VALUE cFoo = rb_define_class("Foo", rb_cObject);
-  #   }
-  #
-  #   /*
-  #    * This is a comment for Foo
-  #    */
-  #   VALUE cFoo = rb_define_class("Foo", rb_cObject);
-
-  def find_class_comment class_name, class_mod
-    comment = nil
-
-    if @content =~ %r%
-        ((?>/\*.*?\*/\s+))
-        (static\s+)?
-        void\s+
-        Init(?:VM)?_(?i:#{class_name})\s*(?:_\(\s*)?\(\s*(?:void\s*)?\)%xm then
-      comment = $1.sub(%r%Document-(?:class|module):\s+#{class_name}%, '')
-    elsif @content =~ %r%Document-(?:class|module):\s+#{class_name}\s*?
-                         (?:<\s+[:,\w]+)?\n((?>.*?\*/))%xm then
-      comment = "/*\n#{$1}"
-    elsif @content =~ %r%((?>/\*.*?\*/\s+))
-                         ([\w\.\s]+\s* = \s+)?rb_define_(class|module)[\t (]*?"(#{class_name})"%xm then
-      comment = $1
-    elsif @content =~ %r%((?>/\*.*?\*/\s+))
-                         ([\w\. \t]+ = \s+)?rb_define_(class|module)_under[\t\w, (]*?"(#{class_name.split('::').last})"%xm then
-      comment = $1
-    else
-      comment = ''
-    end
-
-    comment = new_comment comment, @top_level, :c
-    comment.normalize
-
-    look_for_directives_in class_mod, comment
-
-    class_mod.add_comment comment, @top_level
-  end
-
-  ##
-  # Generate a const table
-
-  def gen_const_table file_content
-    table = {}
-    @content.scan(%r{
-      (?<doc>(?>^\s*/\*.*?\*/\s+))
-        rb_define_(?<type>\w+)\(\s*(?:\w+),\s*
-                           "(?<name>\w+)"\s*,
-                           .*?\)\s*;
-    |  (?<doc>(?>^\s*/\*.*?\*/\s+))
-        rb_file_(?<type>const)\(\s*
-                           "(?<name>\w+)"\s*,
-                           .*?\)\s*;
-    |  (?<doc>(?>^\s*/\*.*?\*/\s+))
-        rb_curses_define_(?<type>const)\(\s*
-                           (?<name>\w+)
-                           \s*\)\s*;
-    | Document-(?:const|global|variable):\s
-        (?<name>(?:\w+::)*\w+)
-        \s*?\n(?<doc>(?>.*?\*/))
-    }mxi) do
-      name, doc, type = $~.values_at(:name, :doc, :type)
-      if type
-        table[[type, name]] = doc
-      else
-        table[name] = "/*\n" + doc
-      end
-    end
-    table
-  end
-
-  ##
-  # Finds a comment matching +type+ and +const_name+ either above the
-  # comment or in the matching Document- section.
-
-  def find_const_comment(type, const_name, class_name = nil)
-    @const_table ||= {}
-    @const_table[@content] ||= gen_const_table @content
-    table = @const_table[@content]
-
-    comment =
-      table[[type, const_name]] ||
-      (class_name && table[class_name + "::" + const_name]) ||
-      table[const_name] ||
-      ''
-
-    new_comment comment, @top_level, :c
-  end
-
-  ##
-  # Handles modifiers in +comment+ and updates +meth_obj+ as appropriate.
-
-  def find_modifiers comment, meth_obj
-    comment.normalize
-    comment.extract_call_seq meth_obj
-
-    look_for_directives_in meth_obj, comment
-  end
-
-  ##
-  # Finds a <tt>Document-method</tt> override for +meth_obj+ on +class_name+
-
-  def find_override_comment class_name, meth_obj
-    name = Regexp.escape meth_obj.name
-    prefix = Regexp.escape meth_obj.name_prefix
-
-    comment = if @content =~ %r%Document-method:
-                                \s+#{class_name}#{prefix}#{name}
-                                \s*?\n((?>.*?\*/))%xm then
-                "/*#{$1}"
-              elsif @content =~ %r%Document-method:
-                                   \s#{name}\s*?\n((?>.*?\*/))%xm then
-                "/*#{$1}"
-              end
-
-    return unless comment
-
-    new_comment comment, @top_level, :c
-  end
-
-  ##
-  # Creates a new RDoc::Attr +attr_name+ on class +var_name+ that is either
-  # +read+, +write+ or both
-
-  def handle_attr(var_name, attr_name, read, write)
-    rw = ''
-    rw += 'R' if TRUE_VALUES.include?(read)
-    rw += 'W' if TRUE_VALUES.include?(write)
-
-    class_name = @known_classes[var_name]
-
-    return unless class_name
-
-    class_obj = find_class var_name, class_name
-
-    return unless class_obj
-
-    comment = find_attr_comment var_name, attr_name
-    comment.normalize
-
-    name = attr_name.gsub(/rb_intern(?:_const)?\("([^"]+)"\)/, '\1')
-
-    attr = RDoc::Attr.new '', name, rw, comment
-
-    attr.record_location @top_level
-    class_obj.add_attribute attr
-    @stats.add_attribute attr
-  end
-
-  ##
-  # Creates a new RDoc::NormalClass or RDoc::NormalModule based on +type+
-  # named +class_name+ in +parent+ which was assigned to the C +var_name+.
-
-  def handle_class_module(var_name, type, class_name, parent, in_module)
-    parent_name = @known_classes[parent] || parent
-
-    if in_module then
-      enclosure = @classes[in_module] || @store.find_c_enclosure(in_module)
-
-      if enclosure.nil? and enclosure = @known_classes[in_module] then
-        enc_type = /^rb_m/ =~ in_module ? :module : :class
-        handle_class_module in_module, enc_type, enclosure, nil, nil
-        enclosure = @classes[in_module]
-      end
-
-      unless enclosure then
-        @enclosure_dependencies[in_module] << var_name
-        @missing_dependencies[var_name] =
-          [var_name, type, class_name, parent, in_module]
-
-        return
-      end
-    else
-      enclosure = @top_level
-    end
-
-    if type == :class then
-      full_name = if RDoc::ClassModule === enclosure then
-                    enclosure.full_name + "::#{class_name}"
-                  else
-                    class_name
-                  end
-
-      if @content =~ %r%Document-class:\s+#{full_name}\s*<\s+([:,\w]+)% then
-        parent_name = $1
-      end
-
-      cm = enclosure.add_class RDoc::NormalClass, class_name, parent_name
-    else
-      cm = enclosure.add_module RDoc::NormalModule, class_name
-    end
-
-    cm.record_location enclosure.top_level
-
-    find_class_comment cm.full_name, cm
-
-    case cm
-    when RDoc::NormalClass
-      @stats.add_class cm
-    when RDoc::NormalModule
-      @stats.add_module cm
-    end
-
-    @classes[var_name] = cm
-    @known_classes[var_name] = cm.full_name
-    @store.add_c_enclosure var_name, cm
-  end
-
-  ##
-  # Adds constants.  By providing some_value: at the start of the comment you
-  # can override the C value of the comment to give a friendly definition.
-  #
-  #   /* 300: The perfect score in bowling */
-  #   rb_define_const(cFoo, "PERFECT", INT2FIX(300));
-  #
-  # Will override <tt>INT2FIX(300)</tt> with the value +300+ in the output
-  # RDoc.  Values may include quotes and escaped colons (\:).
-
-  def handle_constants(type, var_name, const_name, definition)
-    class_name = @known_classes[var_name]
-
-    return unless class_name
-
-    class_obj = find_class var_name, class_name, class_name[/::\K[^:]+\z/]
-
-    unless class_obj then
-      @options.warn 'Enclosing class or module %p is not known' % [const_name]
-      return
-    end
-
-    comment = find_const_comment type, const_name, class_name
-    comment.normalize
-
-    # In the case of rb_define_const, the definition and comment are in
-    # "/* definition: comment */" form.  The literal ':' and '\' characters
-    # can be escaped with a backslash.
-    if type.downcase == 'const' then
-      if /\A(.+?)?:(?!\S)/ =~ comment.text
-        new_definition, new_comment = $1, $'
-
-        if !new_definition # Default to literal C definition
-          new_definition = definition
-        else
-          new_definition = new_definition.gsub(/\\([\\:])/, '\1')
-        end
-
-        new_definition.sub!(/\A(\s+)/, '')
-
-        new_comment = "#{$1}#{new_comment.lstrip}"
-
-        new_comment = self.new_comment(new_comment, @top_level, :c)
-
-        con = RDoc::Constant.new const_name, new_definition, new_comment
-      else
-        con = RDoc::Constant.new const_name, definition, comment
-      end
-    else
-      con = RDoc::Constant.new const_name, definition, comment
-    end
-
-    con.record_location @top_level
-    @stats.add_constant con
-    class_obj.add_constant con
-  end
-
-  ##
-  # Removes #ifdefs that would otherwise confuse us
-
-  def handle_ifdefs_in(body)
-    body.gsub(/^#ifdef HAVE_PROTOTYPES.*?#else.*?\n(.*?)#endif.*?\n/m, '\1')
-  end
-
-  ##
-  # Adds an RDoc::AnyMethod +meth_name+ defined on a class or module assigned
-  # to +var_name+.  +type+ is the type of method definition function used.
-  # +singleton_method+ and +module_function+ create a singleton method.
-
-  def handle_method(type, var_name, meth_name, function, param_count,
-                    source_file = nil)
-    class_name = @known_classes[var_name]
-    singleton  = @singleton_classes.key? var_name
-
-    @methods[var_name][function] << meth_name
-
-    return unless class_name
-
-    class_obj = find_class var_name, class_name
-
-    if existing_method = class_obj.method_list.find { |m| m.c_function == function }
-      add_alias(var_name, class_obj, existing_method.name, meth_name, existing_method.comment)
-    end
-
-    if class_obj then
-      if meth_name == 'initialize' then
-        meth_name = 'new'
-        singleton = true
-        type = 'method' # force public
-      end
-
-      meth_obj = RDoc::AnyMethod.new '', meth_name
-      meth_obj.c_function = function
-      meth_obj.singleton =
-        singleton || %w[singleton_method module_function].include?(type)
-
-      p_count = Integer(param_count) rescue -1
-
-      if source_file then
-        file_name = File.join @file_dir, source_file
-
-        if File.exist? file_name then
-          file_content = File.read file_name
-        else
-          @options.warn "unknown source #{source_file} for #{meth_name} in #{@file_name}"
-        end
-      else
-        file_content = @content
-      end
-
-      body = find_body class_name, function, meth_obj, file_content
-
-      if body and meth_obj.document_self then
-        meth_obj.params = if p_count < -1 then # -2 is Array
-                            '(*args)'
-                          elsif p_count == -1 then # argc, argv
-                            rb_scan_args body
-                          else
-                            args = (1..p_count).map { |i| "p#{i}" }
-                            "(#{args.join ', '})"
-                          end
-
-
-        meth_obj.record_location @top_level
-
-        if meth_obj.section_title
-          class_obj.temporary_section = class_obj.add_section(meth_obj.section_title)
-        end
-        class_obj.add_method meth_obj
-
-        @stats.add_method meth_obj
-        meth_obj.visibility = :private if 'private_method' == type
-      end
-    end
-  end
-
-  ##
-  # Registers a singleton class +sclass_var+ as a singleton of +class_var+
-
-  def handle_singleton sclass_var, class_var
-    class_name = @known_classes[class_var]
-
-    @known_classes[sclass_var]     = class_name
-    @singleton_classes[sclass_var] = class_name
-  end
-
-  ##
-  # Loads the variable map with the given +name+ from the RDoc::Store, if
-  # present.
-
-  def load_variable_map map_name
-    return {} unless files = @store.cache[map_name]
-    return {} unless name_map = files[@file_name]
-
-    class_map = {}
-
-    name_map.each do |variable, name|
-      next unless mod = @store.find_class_or_module(name)
-
-      class_map[variable] = if map_name == :c_class_variables then
-                              mod
-                            else
-                              name
-                            end
-      @known_classes[variable] = name
-    end
-
-    class_map
-  end
-
-  ##
-  # Look for directives in a normal comment block:
-  #
-  #   /*
-  #    * :title: My Awesome Project
-  #    */
-  #
-  # This method modifies the +comment+
-
-  def look_for_directives_in context, comment
-    @preprocess.handle comment, context do |directive, param|
-      case directive
-      when 'main' then
-        @options.main_page = param
-        ''
-      when 'title' then
-        @options.default_title = param if @options.respond_to? :default_title=
-        ''
-      end
-    end
-
-    comment
-  end
-
-  ##
-  # Extracts parameters from the +method_body+ and returns a method
-  # parameter string.  Follows 1.9.3dev's scan-arg-spec, see README.EXT
-
-  def rb_scan_args method_body
-    method_body =~ /rb_scan_args\((.*?)\)/m
-    return '(*args)' unless $1
-
-    $1.split(/,/)[2] =~ /"(.*?)"/ # format argument
-    format = $1.split(//)
-
-    lead = opt = trail = 0
-
-    if format.first =~ /\d/ then
-      lead = $&.to_i
-      format.shift
-      if format.first =~ /\d/ then
-        opt = $&.to_i
-        format.shift
-        if format.first =~ /\d/ then
-          trail = $&.to_i
-          format.shift
-          block_arg = true
-        end
-      end
-    end
-
-    if format.first == '*' and not block_arg then
-      var = true
-      format.shift
-      if format.first =~ /\d/ then
-        trail = $&.to_i
-        format.shift
-      end
-    end
-
-    if format.first == ':' then
-      hash = true
-      format.shift
-    end
-
-    if format.first == '&' then
-      block = true
-      format.shift
-    end
-
-    # if the format string is not empty there's a bug in the C code, ignore it
-
-    args = []
-    position = 1
-
-    (1...(position + lead)).each do |index|
-      args << "p#{index}"
-    end
-
-    position += lead
-
-    (position...(position + opt)).each do |index|
-      args << "p#{index} = v#{index}"
-    end
-
-    position += opt
-
-    if var then
-      args << '*args'
-      position += 1
-    end
-
-    (position...(position + trail)).each do |index|
-      args << "p#{index}"
-    end
-
-    position += trail
-
-    if hash then
-      args << "p#{position} = {}"
-    end
-
-    args << '&block' if block
-
-    "(#{args.join ', '})"
-  end
-
-  ##
-  # Removes lines that are commented out that might otherwise get picked up
-  # when scanning for classes and methods
-
-  def remove_commented_out_lines
-    @content = @content.gsub(%r%//.*rb_define_%, '//')
-  end
-
-  ##
-  # Extracts the classes, modules, methods, attributes, constants and aliases
-  # from a C file and returns an RDoc::TopLevel for this file
-
-  def scan
-    remove_commented_out_lines
-
-    do_classes_and_modules
-    do_missing
-
-    do_constants
-    do_methods
-    do_includes
-    do_aliases
-    do_attrs
-
-    @store.add_c_variables self
-
-    @top_level
-  end
-
-  ##
-  # Creates a RDoc::Comment instance.
-
-  def new_comment text = nil, location = nil, language = nil
-    RDoc::Comment.new(text, location, language).tap do |comment|
-      comment.format = @markup
-    end
-  end
-end
diff --git a/lib/rdoc/parser/changelog.rb b/lib/rdoc/parser/changelog.rb
deleted file mode 100644
index a046241870..0000000000
--- a/lib/rdoc/parser/changelog.rb
+++ /dev/null
@@ -1,349 +0,0 @@
-# frozen_string_literal: true
-
-##
-# A ChangeLog file parser.
-#
-# This parser converts a ChangeLog into an RDoc::Markup::Document.  When
-# viewed as HTML a ChangeLog page will have an entry for each day's entries in
-# the sidebar table of contents.
-#
-# This parser is meant to parse the MRI ChangeLog, but can be used to parse any
-# {GNU style Change
-# Log}[http://www.gnu.org/prep/standards/html_node/Style-of-Change-Logs.html].
-
-class RDoc::Parser::ChangeLog < RDoc::Parser
-
-  include RDoc::Parser::Text
-
-  parse_files_matching(/(\/|\\|\A)ChangeLog[^\/\\]*\z/)
-
-  ##
-  # Attaches the +continuation+ of the previous line to the +entry_body+.
-  #
-  # Continued function listings are joined together as a single entry.
-  # Continued descriptions are joined to make a single paragraph.
-
-  def continue_entry_body entry_body, continuation
-    return unless last = entry_body.last
-
-    if last =~ /\)\s*\z/ and continuation =~ /\A\(/ then
-      last.sub!(/\)\s*\z/, ',')
-      continuation = continuation.sub(/\A\(/, '')
-    end
-
-    if last =~ /\s\z/ then
-      last << continuation
-    else
-      last << ' ' + continuation
-    end
-  end
-
-  ##
-  # Creates an RDoc::Markup::Document given the +groups+ of ChangeLog entries.
-
-  def create_document groups
-    doc = RDoc::Markup::Document.new
-    doc.omit_headings_below = 2
-    doc.file = @top_level
-
-    doc << RDoc::Markup::Heading.new(1, File.basename(@file_name))
-    doc << RDoc::Markup::BlankLine.new
-
-    groups.sort_by do |day,| day end.reverse_each do |day, entries|
-      doc << RDoc::Markup::Heading.new(2, day.dup)
-      doc << RDoc::Markup::BlankLine.new
-
-      doc.concat create_entries entries
-    end
-
-    doc
-  end
-
-  ##
-  # Returns a list of ChangeLog entries an RDoc::Markup nodes for the given
-  # +entries+.
-
-  def create_entries entries
-    out = []
-
-    entries.each do |entry, items|
-      out << RDoc::Markup::Heading.new(3, entry)
-      out << RDoc::Markup::BlankLine.new
-
-      out << create_items(items)
-    end
-
-    out
-  end
-
-  ##
-  # Returns an RDoc::Markup::List containing the given +items+ in the
-  # ChangeLog
-
-  def create_items items
-    list = RDoc::Markup::List.new :NOTE
-
-    items.each do |item|
-      item =~ /\A(.*?(?:\([^)]+\))?):\s*/
-
-      title = $1
-      body = $'
-
-      paragraph = RDoc::Markup::Paragraph.new body
-      list_item = RDoc::Markup::ListItem.new title, paragraph
-      list << list_item
-    end
-
-    list
-  end
-
-  ##
-  # Groups +entries+ by date.
-
-  def group_entries entries
-    @time_cache ||= {}
-    entries.group_by do |title, _|
-      begin
-        time = @time_cache[title]
-        (time || parse_date(title)).strftime '%Y-%m-%d'
-      rescue NoMethodError, ArgumentError
-        time, = title.split '  ', 2
-        parse_date(time).strftime '%Y-%m-%d'
-      end
-    end
-  end
-
-  ##
-  # Parse date in ISO-8601, RFC-2822, or default of Git
-
-  def parse_date(date)
-    case date
-    when /\A\s*(\d+)-(\d+)-(\d+)(?:[ T](\d+):(\d+):(\d+) *([-+]\d\d):?(\d\d))?\b/
-      Time.new($1, $2, $3, $4, $5, $6, ("#{$7}:#{$8}" if $7))
-    when /\A\s*\w{3}, +(\d+) (\w{3}) (\d+) (\d+):(\d+):(\d+) *(?:([-+]\d\d):?(\d\d))\b/
-      Time.new($3, $2, $1, $4, $5, $6, ("#{$7}:#{$8}" if $7))
-    when /\A\s*\w{3} (\w{3}) +(\d+) (\d+) (\d+):(\d+):(\d+) *(?:([-+]\d\d):?(\d\d))\b/
-      Time.new($3, $1, $2, $4, $5, $6, ("#{$7}:#{$8}" if $7))
-    when /\A\s*\w{3} (\w{3}) +(\d+) (\d+):(\d+):(\d+) (\d+)\b/
-      Time.new($6, $1, $2, $3, $4, $5)
-    else
-      raise ArgumentError, "bad date: #{date}"
-    end
-  end
-
-  ##
-  # Parses the entries in the ChangeLog.
-  #
-  # Returns an Array of each ChangeLog entry in order of parsing.
-  #
-  # A ChangeLog entry is an Array containing the ChangeLog title (date and
-  # committer) and an Array of ChangeLog items (file and function changed with
-  # description).
-  #
-  # An example result would be:
-  #
-  #    [ 'Tue Dec  4 08:33:46 2012  Eric Hodel  <drbrain@segment7.net>',
-  #      [ 'README.EXT:  Converted to RDoc format',
-  #        'README.EXT.ja:  ditto']]
-
-  def parse_entries
-    @time_cache ||= {}
-
-    if /\A((?:.*\n){,3})commit\s/ =~ @content
-      class << self; prepend Git; end
-      parse_info($1)
-      return parse_entries
-    end
-
-    entries = []
-    entry_name = nil
-    entry_body = []
-
-    @content.each_line do |line|
-      case line
-      when /^\s*$/ then
-        next
-      when /^\w.*/ then
-        entries << [entry_name, entry_body] if entry_name
-
-        entry_name = $&
-
-        begin
-          time = parse_date entry_name
-          @time_cache[entry_name] = time
-        rescue ArgumentError
-          entry_name = nil
-        end
-
-        entry_body = []
-      when /^(\t| {8})?\*\s*(.*)/ then # "\t* file.c (func): ..."
-        entry_body << $2.dup
-      when /^(\t| {8})?\s*(\(.*)/ then # "\t(func): ..."
-        entry = $2
-
-        if entry_body.last =~ /:/ then
-          entry_body << entry.dup
-        else
-          continue_entry_body entry_body, entry
-        end
-      when /^(\t| {8})?\s*(.*)/ then
-        continue_entry_body entry_body, $2
-      end
-    end
-
-    entries << [entry_name, entry_body] if entry_name
-
-    entries.reject! do |(entry,_)|
-      entry == nil
-    end
-
-    entries
-  end
-
-  ##
-  # Converts the ChangeLog into an RDoc::Markup::Document
-
-  def scan
-    @time_cache = {}
-
-    entries = parse_entries
-    grouped_entries = group_entries entries
-
-    doc = create_document grouped_entries
-
-    @top_level.comment = doc
-
-    @top_level
-  end
-
-  ##
-  # The extension for Git commit log
-
-  module Git
-    ##
-    # Parses auxiliary info.  Currentry `base-url` to expand
-    # references is effective.
-
-    def parse_info(info)
-      /^\s*base-url\s*=\s*(.*\S)/ =~ info
-      @base_url = $1
-    end
-
-    ##
-    # Parses the entries in the Git commit logs
-
-    def parse_entries
-      entries = []
-
-      @content.scan(/^commit\s+(\h{20})\h*\n((?:.+\n)*)\n((?: {4}.*\n+)*)/) do
-        entry_name, header, entry_body = $1, $2, $3.gsub(/^ {4}/, '')
-        # header = header.scan(/^ *(\S+?): +(.*)/).to_h
-        # date = header["CommitDate"] || header["Date"]
-        date = header[/^ *(?:Author)?Date: +(.*)/, 1]
-        author = header[/^ *Author: +(.*)/, 1]
-        begin
-          time = parse_date(header[/^ *CommitDate: +(.*)/, 1] || date)
-          @time_cache[entry_name] = time
-          author.sub!(/\s*<(.*)>/, '')
-          email = $1
-          entries << [entry_name, [author, email, date, entry_body]]
-        rescue ArgumentError
-        end
-      end
-
-      entries
-    end
-
-    ##
-    # Returns a list of ChangeLog entries as
-    # RDoc::Parser::ChangeLog::Git::LogEntry list for the given
-    # +entries+.
-
-    def create_entries entries
-      # git log entries have no strictly itemized style like the old
-      # style, just assume Markdown.
-      entries.map do |commit, entry|
-        LogEntry.new(@base_url, commit, *entry)
-      end
-    end
-
-    LogEntry = Struct.new(:base, :commit, :author, :email, :date, :contents) do
-      HEADING_LEVEL = 3
-
-      def initialize(base, commit, author, email, date, contents)
-        case contents
-        when String
-          contents = RDoc::Markdown.parse(contents).parts.each do |body|
-            case body
-            when RDoc::Markup::Heading
-              body.level += HEADING_LEVEL + 1
-            end
-          end
-          case first = contents[0]
-          when RDoc::Markup::Paragraph
-            contents[0] = RDoc::Markup::Heading.new(HEADING_LEVEL + 1, first.text)
-          end
-        end
-        super
-      end
-
-      def level
-        HEADING_LEVEL
-      end
-
-      def aref
-        "label-#{commit}"
-      end
-
-      def label context = nil
-        aref
-      end
-
-      def text
-        case base
-        when nil
-          "#{date}"
-        when /%s/
-          "{#{date}}[#{base % commit}]"
-        else
-          "{#{date}}[#{base}#{commit}]"
-        end + " {#{author}}[mailto:#{email}]"
-      end
-
-      def accept visitor
-        visitor.accept_heading self
-        begin
-          if visitor.respond_to?(:code_object=)
-            code_object = visitor.code_object
-            visitor.code_object = self
-          end
-          contents.each do |body|
-            body.accept visitor
-          end
-        ensure
-          if visitor.respond_to?(:code_object)
-            visitor.code_object = code_object
-          end
-        end
-      end
-
-      def pretty_print q # :nodoc:
-        q.group(2, '[log_entry: ', ']') do
-          q.text commit
-          q.text ','
-          q.breakable
-          q.group(2, '[date: ', ']') { q.text date }
-          q.text ','
-          q.breakable
-          q.group(2, '[author: ', ']') { q.text author }
-          q.text ','
-          q.breakable
-          q.group(2, '[email: ', ']') { q.text email }
-          q.text ','
-          q.breakable
-          q.pp contents
-        end
-      end
-    end
-  end
-end
diff --git a/lib/rdoc/parser/markdown.rb b/lib/rdoc/parser/markdown.rb
deleted file mode 100644
index 3c316227b9..0000000000
--- a/lib/rdoc/parser/markdown.rb
+++ /dev/null
@@ -1,22 +0,0 @@
-# frozen_string_literal: true
-##
-# Parse a Markdown format file.  The parsed RDoc::Markup::Document is attached
-# as a file comment.
-
-class RDoc::Parser::Markdown < RDoc::Parser
-
-  include RDoc::Parser::Text
-
-  parse_files_matching(/\.(md|markdown)(?:\.[^.]+)?$/)
-
-  ##
-  # Creates an Markdown-format TopLevel for the given file.
-
-  def scan
-    comment = RDoc::Comment.new @content, @top_level
-    comment.format = 'markdown'
-
-    @top_level.comment = comment
-  end
-
-end
diff --git a/lib/rdoc/parser/rd.rb b/lib/rdoc/parser/rd.rb
deleted file mode 100644
index 19e47e549d..0000000000
--- a/lib/rdoc/parser/rd.rb
+++ /dev/null
@@ -1,22 +0,0 @@
-# frozen_string_literal: true
-##
-# Parse a RD format file.  The parsed RDoc::Markup::Document is attached as a
-# file comment.
-
-class RDoc::Parser::RD < RDoc::Parser
-
-  include RDoc::Parser::Text
-
-  parse_files_matching(/\.rd(?:\.[^.]+)?$/)
-
-  ##
-  # Creates an rd-format TopLevel for the given file.
-
-  def scan
-    comment = RDoc::Comment.new @content, @top_level
-    comment.format = 'rd'
-
-    @top_level.comment = comment
-  end
-
-end
diff --git a/lib/rdoc/parser/ripper_state_lex.rb b/lib/rdoc/parser/ripper_state_lex.rb
deleted file mode 100644
index f6cefd0305..0000000000
--- a/lib/rdoc/parser/ripper_state_lex.rb
+++ /dev/null
@@ -1,600 +0,0 @@
-# frozen_string_literal: true
-require 'ripper'
-
-##
-# Wrapper for Ripper lex states
-
-class RDoc::Parser::RipperStateLex
-  # :stopdoc:
-
-  # TODO: Remove this constants after Ruby 2.4 EOL
-  RIPPER_HAS_LEX_STATE = Ripper::Filter.method_defined?(:state)
-
-  Token = Struct.new(:line_no, :char_no, :kind, :text, :state)
-
-  EXPR_NONE = 0
-  EXPR_BEG = 1
-  EXPR_END = 2
-  EXPR_ENDARG = 4
-  EXPR_ENDFN = 8
-  EXPR_ARG = 16
-  EXPR_CMDARG = 32
-  EXPR_MID = 64
-  EXPR_FNAME = 128
-  EXPR_DOT = 256
-  EXPR_CLASS = 512
-  EXPR_LABEL = 1024
-  EXPR_LABELED = 2048
-  EXPR_FITEM = 4096
-  EXPR_VALUE = EXPR_BEG
-  EXPR_BEG_ANY  =  (EXPR_BEG | EXPR_MID | EXPR_CLASS)
-  EXPR_ARG_ANY  =  (EXPR_ARG | EXPR_CMDARG)
-  EXPR_END_ANY  =  (EXPR_END | EXPR_ENDARG | EXPR_ENDFN)
-
-  class InnerStateLex < Ripper::Filter
-    attr_accessor :lex_state
-
-    def initialize(code)
-      @lex_state = EXPR_BEG
-      @in_fname = false
-      @continue = false
-      reset
-      super(code)
-    end
-
-    def reset
-      @command_start = false
-      @cmd_state = @command_start
-    end
-
-    def on_nl(tok, data)
-      case @lex_state
-      when EXPR_FNAME, EXPR_DOT
-        @continue = true
-      else
-        @continue = false
-        @lex_state = EXPR_BEG unless (EXPR_LABEL & @lex_state) != 0
-      end
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_ignored_nl(tok, data)
-      case @lex_state
-      when EXPR_FNAME, EXPR_DOT
-        @continue = true
-      else
-        @continue = false
-        @lex_state = EXPR_BEG unless (EXPR_LABEL & @lex_state) != 0
-      end
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_op(tok, data)
-      case tok
-      when '&', '|', '!', '!=', '!~'
-        case @lex_state
-        when EXPR_FNAME, EXPR_DOT
-          @lex_state = EXPR_ARG
-        else
-          @lex_state = EXPR_BEG
-        end
-      when '<<'
-        # TODO next token?
-        case @lex_state
-        when EXPR_FNAME, EXPR_DOT
-          @lex_state = EXPR_ARG
-        else
-          @lex_state = EXPR_BEG
-        end
-      when '?'
-        @lex_state = EXPR_BEG
-      when '&&', '||', '+=', '-=', '*=', '**=',
-           '&=', '|=', '^=', '<<=', '>>=', '||=', '&&='
-        @lex_state = EXPR_BEG
-      when '::'
-        case @lex_state
-        when EXPR_ARG, EXPR_CMDARG
-          @lex_state = EXPR_DOT
-        when EXPR_FNAME, EXPR_DOT
-          @lex_state = EXPR_ARG
-        else
-          @lex_state = EXPR_BEG
-        end
-      else
-        case @lex_state
-        when EXPR_FNAME, EXPR_DOT
-          @lex_state = EXPR_ARG
-        else
-          @lex_state = EXPR_BEG
-        end
-      end
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_kw(tok, data)
-      case tok
-      when 'class'
-        @lex_state = EXPR_CLASS
-        @in_fname = true
-      when 'def'
-        @lex_state = EXPR_FNAME
-        @continue = true
-        @in_fname = true
-      when 'if', 'unless', 'while', 'until'
-        if ((EXPR_MID | EXPR_END | EXPR_ENDARG | EXPR_ENDFN | EXPR_ARG | EXPR_CMDARG) & @lex_state) != 0 # postfix if
-          @lex_state = EXPR_BEG | EXPR_LABEL
-        else
-          @lex_state = EXPR_BEG
-        end
-      when 'begin', 'case', 'when'
-        @lex_state = EXPR_BEG
-      when 'return', 'break'
-        @lex_state = EXPR_MID
-      else
-        if @lex_state == EXPR_FNAME
-          @lex_state = EXPR_END
-        else
-          @lex_state = EXPR_END
-        end
-      end
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_tstring_beg(tok, data)
-      @lex_state = EXPR_BEG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_tstring_end(tok, data)
-      @lex_state = EXPR_END | EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_CHAR(tok, data)
-      @lex_state = EXPR_END
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_period(tok, data)
-      @lex_state = EXPR_DOT
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_int(tok, data)
-      @lex_state = EXPR_END | EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_float(tok, data)
-      @lex_state = EXPR_END | EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_rational(tok, data)
-      @lex_state = EXPR_END | EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_imaginary(tok, data)
-      @lex_state = EXPR_END | EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_symbeg(tok, data)
-      @lex_state = EXPR_FNAME
-      @continue = true
-      @in_fname = true
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    private def on_variables(event, tok, data)
-      if @in_fname
-        @lex_state = EXPR_ENDFN
-        @in_fname = false
-        @continue = false
-      elsif @continue
-        case @lex_state
-        when EXPR_DOT
-          @lex_state = EXPR_ARG
-        else
-          @lex_state = EXPR_ENDFN
-          @continue = false
-        end
-      else
-        @lex_state = EXPR_CMDARG
-      end
-      data << Token.new(lineno, column, event, tok, @lex_state)
-    end
-
-    def on_ident(tok, data)
-      on_variables(__method__, tok, data)
-    end
-
-    def on_ivar(tok, data)
-      @lex_state = EXPR_END
-      on_variables(__method__, tok, data)
-    end
-
-    def on_cvar(tok, data)
-      @lex_state = EXPR_END
-      on_variables(__method__, tok, data)
-    end
-
-    def on_gvar(tok, data)
-      @lex_state = EXPR_END
-      on_variables(__method__, tok, data)
-    end
-
-    def on_backref(tok, data)
-      @lex_state = EXPR_END
-      on_variables(__method__, tok, data)
-    end
-
-    def on_lparen(tok, data)
-      @lex_state = EXPR_LABEL | EXPR_BEG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_rparen(tok, data)
-      @lex_state = EXPR_ENDFN
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_lbrace(tok, data)
-      @lex_state = EXPR_LABEL | EXPR_BEG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_rbrace(tok, data)
-      @lex_state = EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_lbracket(tok, data)
-      @lex_state = EXPR_LABEL | EXPR_BEG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_rbracket(tok, data)
-      @lex_state = EXPR_ENDARG
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_const(tok, data)
-      case @lex_state
-      when EXPR_FNAME
-        @lex_state = EXPR_ENDFN
-      when EXPR_CLASS, EXPR_CMDARG, EXPR_MID
-        @lex_state = EXPR_ARG
-      else
-        @lex_state = EXPR_CMDARG
-      end
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_sp(tok, data)
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_comma(tok, data)
-      @lex_state = EXPR_BEG | EXPR_LABEL if (EXPR_ARG_ANY & @lex_state) != 0
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_comment(tok, data)
-      @lex_state = EXPR_BEG unless (EXPR_LABEL & @lex_state) != 0
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_ignored_sp(tok, data)
-      @lex_state = EXPR_BEG unless (EXPR_LABEL & @lex_state) != 0
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-    end
-
-    def on_heredoc_beg(tok, data)
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-      @lex_state = EXPR_END
-      data
-    end
-
-    def on_heredoc_end(tok, data)
-      data << Token.new(lineno, column, __method__, tok, @lex_state)
-      @lex_state = EXPR_BEG
-      data
-    end
-
-    def on_default(event, tok, data)
-      reset
-      data << Token.new(lineno, column, event, tok, @lex_state)
-    end
-  end unless RIPPER_HAS_LEX_STATE
-
-  class InnerStateLex < Ripper::Filter
-    def initialize(code)
-      super(code)
-    end
-
-    def on_default(event, tok, data)
-      data << Token.new(lineno, column, event, tok, state)
-    end
-  end if RIPPER_HAS_LEX_STATE
-
-  def get_squashed_tk
-    if @buf.empty?
-      tk = @tokens.shift
-    else
-      tk = @buf.shift
-    end
-    return nil if tk.nil?
-    case tk[:kind]
-    when :on_symbeg then
-      tk = get_symbol_tk(tk)
-    when :on_tstring_beg then
-      tk = get_string_tk(tk)
-    when :on_backtick then
-      if (tk[:state] & (EXPR_FNAME | EXPR_ENDFN)) != 0
-        @inner_lex.lex_state = EXPR_ARG unless RIPPER_HAS_LEX_STATE
-        tk[:kind] = :on_ident
-        tk[:state] = Ripper::Lexer.const_defined?(:State) ? Ripper::Lexer::State.new(EXPR_ARG) : EXPR_ARG
-      else
-        tk = get_string_tk(tk)
-      end
-    when :on_regexp_beg then
-      tk = get_regexp_tk(tk)
-    when :on_embdoc_beg then
-      tk = get_embdoc_tk(tk)
-    when :on_heredoc_beg then
-      @heredoc_queue << retrieve_heredoc_info(tk)
-      @inner_lex.lex_state = EXPR_END unless RIPPER_HAS_LEX_STATE
-    when :on_nl, :on_ignored_nl, :on_comment, :on_heredoc_end then
-      if !@heredoc_queue.empty?
-        get_heredoc_tk(*@heredoc_queue.shift)
-      elsif tk[:text].nil? # :on_ignored_nl sometimes gives nil
-        tk[:text] = ''
-      end
-    when :on_words_beg then
-      tk = get_words_tk(tk)
-    when :on_qwords_beg then
-      tk = get_words_tk(tk)
-    when :on_symbols_beg then
-      tk = get_words_tk(tk)
-    when :on_qsymbols_beg then
-      tk = get_words_tk(tk)
-    when :on_op then
-      if '&.' == tk[:text]
-        tk[:kind] = :on_period
-      else
-        tk = get_op_tk(tk)
-      end
-    end
-    tk
-  end
-
-  private def get_symbol_tk(tk)
-    is_symbol = true
-    symbol_tk = Token.new(tk.line_no, tk.char_no, :on_symbol)
-    if ":'" == tk[:text] or ':"' == tk[:text] or tk[:text].start_with?('%s')
-      tk1 = get_string_tk(tk)
-      symbol_tk[:text] = tk1[:text]
-      symbol_tk[:state] = tk1[:state]
-    else
-      case (tk1 = get_squashed_tk)[:kind]
-      when :on_ident
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_tstring_content
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = get_squashed_tk[:state] # skip :on_tstring_end
-      when :on_tstring_end
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_op
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_ivar
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_cvar
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_gvar
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_const
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      when :on_kw
-        symbol_tk[:text] = ":#{tk1[:text]}"
-        symbol_tk[:state] = tk1[:state]
-      else
-        is_symbol = false
-        tk = tk1
-      end
-    end
-    if is_symbol
-      tk = symbol_tk
-    end
-    tk
-  end
-
-  private def get_string_tk(tk)
-    string = tk[:text]
-    state = nil
-    kind = :on_tstring
-    loop do
-      inner_str_tk = get_squashed_tk
-      if inner_str_tk.nil?
-        break
-      elsif :on_tstring_end == inner_str_tk[:kind]
-        string = string + inner_str_tk[:text]
-        state = inner_str_tk[:state]
-        break
-      elsif :on_label_end == inner_str_tk[:kind]
-        string = string + inner_str_tk[:text]
-        state = inner_str_tk[:state]
-        kind = :on_symbol
-        break
-      else
-        string = string + inner_str_tk[:text]
-        if :on_embexpr_beg == inner_str_tk[:kind] then
-          kind = :on_dstring if :on_tstring == kind
-        end
-      end
-    end
-    Token.new(tk.line_no, tk.char_no, kind, string, state)
-  end
-
-  private def get_regexp_tk(tk)
-    string = tk[:text]
-    state = nil
-    loop do
-      inner_str_tk = get_squashed_tk
-      if inner_str_tk.nil?
-        break
-      elsif :on_regexp_end == inner_str_tk[:kind]
-        string = string + inner_str_tk[:text]
-        state = inner_str_tk[:state]
-        break
-      else
-        string = string + inner_str_tk[:text]
-      end
-    end
-    Token.new(tk.line_no, tk.char_no, :on_regexp, string, state)
-  end
-
-  private def get_embdoc_tk(tk)
-    string = tk[:text]
-    until :on_embdoc_end == (embdoc_tk = get_squashed_tk)[:kind] do
-      string = string + embdoc_tk[:text]
-    end
-    string = string + embdoc_tk[:text]
-    Token.new(tk.line_no, tk.char_no, :on_embdoc, string, embdoc_tk.state)
-  end
-
-  private def get_heredoc_tk(heredoc_name, indent)
-    string = ''
-    start_tk = nil
-    prev_tk = nil
-    until heredoc_end?(heredoc_name, indent, tk = @tokens.shift) do
-      start_tk = tk unless start_tk
-      if (prev_tk.nil? or "\n" == prev_tk[:text][-1]) and 0 != tk[:char_no]
-        string = string + (' ' * tk[:char_no])
-      end
-      string = string + tk[:text]
-      prev_tk = tk
-    end
-    start_tk = tk unless start_tk
-    prev_tk = tk unless prev_tk
-    @buf.unshift tk # closing heredoc
-    heredoc_tk = Token.new(start_tk.line_no, start_tk.char_no, :on_heredoc, string, prev_tk.state)
-    @buf.unshift heredoc_tk
-  end
-
-  private def retrieve_heredoc_info(tk)
-    name = tk[:text].gsub(/\A<<[-~]?(['"`]?)(.+)\1\z/, '\2')
-    indent = tk[:text] =~ /\A<<[-~]/
-    [name, indent]
-  end
-
-  private def heredoc_end?(name, indent, tk)
-    result = false
-    if :on_heredoc_end == tk[:kind] then
-      tk_name = tk[:text].chomp
-      tk_name.lstrip! if indent
-      if name == tk_name
-        result = true
-      end
-    end
-    result
-  end
-
-  private def get_words_tk(tk)
-    string = ''
-    start_token = tk[:text]
-    start_quote = tk[:text].rstrip[-1]
-    line_no = tk[:line_no]
-    char_no = tk[:char_no]
-    state = tk[:state]
-    end_quote =
-      case start_quote
-      when ?( then ?)
-      when ?[ then ?]
-      when ?{ then ?}
-      when ?< then ?>
-      else start_quote
-      end
-    end_token = nil
-    loop do
-      tk = get_squashed_tk
-      if tk.nil?
-        end_token = end_quote
-        break
-      elsif :on_tstring_content == tk[:kind] then
-        string += tk[:text]
-      elsif :on_words_sep == tk[:kind] or :on_tstring_end == tk[:kind] then
-        if end_quote == tk[:text].strip then
-          end_token = tk[:text]
-          break
-        else
-          string += tk[:text]
-        end
-      else
-        string += tk[:text]
-      end
-    end
-    text = "#{start_token}#{string}#{end_token}"
-    Token.new(line_no, char_no, :on_dstring, text, state)
-  end
-
-  private def get_op_tk(tk)
-    redefinable_operators = %w[! != !~ % & * ** + +@ - -@ / < << <= <=> == === =~ > >= >> [] []= ^ ` | ~]
-    if redefinable_operators.include?(tk[:text]) and tk[:state] == EXPR_ARG then
-      @inner_lex.lex_state = EXPR_ARG unless RIPPER_HAS_LEX_STATE
-      tk[:state] = Ripper::Lexer.const_defined?(:State) ? Ripper::Lexer::State.new(EXPR_ARG) : EXPR_ARG
-      tk[:kind] = :on_ident
-    elsif tk[:text] =~ /^[-+]$/ then
-      tk_ahead = get_squashed_tk
-      case tk_ahead[:kind]
-      when :on_int, :on_float, :on_rational, :on_imaginary then
-        tk[:text] += tk_ahead[:text]
-        tk[:kind] = tk_ahead[:kind]
-        tk[:state] = tk_ahead[:state]
-      when :on_heredoc_beg, :on_tstring, :on_dstring # frozen/non-frozen string literal
-        tk[:text] += tk_ahead[:text]
-        tk[:kind] = tk_ahead[:kind]
-        tk[:state] = tk_ahead[:state]
-      else
-        @buf.unshift tk_ahead
-      end
-    end
-    tk
-  end
-
-  # :startdoc:
-
-  # New lexer for +code+.
-  def initialize(code)
-    @buf = []
-    @heredoc_queue = []
-    @inner_lex = InnerStateLex.new(code)
-    @tokens = @inner_lex.parse([])
-  end
-
-  # Returns tokens parsed from +code+.
-  def self.parse(code)
-    lex = self.new(code)
-    tokens = []
-    begin
-      while tk = lex.get_squashed_tk
-        tokens.push tk
-      end
-    rescue StopIteration
-    end
-    tokens
-  end
-
-  # Returns +true+ if lex state will be +END+ after +token+.
-  def self.end?(token)
-    (token[:state] & EXPR_END)
-  end
-end
diff --git a/lib/rdoc/parser/ruby.rb b/lib/rdoc/parser/ruby.rb
deleted file mode 100644
index 85f1cd0391..0000000000
--- a/lib/rdoc/parser/ruby.rb
+++ /dev/null
@@ -1,2372 +0,0 @@
-# frozen_string_literal: true
-##
-# This file contains stuff stolen outright from:
-#
-#   rtags.rb -
-#   ruby-lex.rb - ruby lexcal analyzer
-#   ruby-token.rb - ruby tokens
-#       by Keiju ISHITSUKA (Nippon Rational Inc.)
-#
-
-require 'ripper'
-require_relative 'ripper_state_lex'
-
-##
-# Extracts code elements from a source file returning a TopLevel object
-# containing the constituent file elements.
-#
-# This file is based on rtags
-#
-# RubyParser understands how to document:
-# * classes
-# * modules
-# * methods
-# * constants
-# * aliases
-# * private, public, protected
-# * private_class_function, public_class_function
-# * private_constant, public_constant
-# * module_function
-# * attr, attr_reader, attr_writer, attr_accessor
-# * extra accessors given on the command line
-# * metaprogrammed methods
-# * require
-# * include
-#
-# == Method Arguments
-#
-#--
-# NOTE: I don't think this works, needs tests, remove the paragraph following
-# this block when known to work
-#
-# The parser extracts the arguments from the method definition.  You can
-# override this with a custom argument definition using the :args: directive:
-#
-#   ##
-#   # This method tries over and over until it is tired
-#
-#   def go_go_go(thing_to_try, tries = 10) # :args: thing_to_try
-#     puts thing_to_try
-#     go_go_go thing_to_try, tries - 1
-#   end
-#
-# If you have a more-complex set of overrides you can use the :call-seq:
-# directive:
-#++
-#
-# The parser extracts the arguments from the method definition.  You can
-# override this with a custom argument definition using the :call-seq:
-# directive:
-#
-#   ##
-#   # This method can be called with a range or an offset and length
-#   #
-#   # :call-seq:
-#   #   my_method(Range)
-#   #   my_method(offset, length)
-#
-#   def my_method(*args)
-#   end
-#
-# The parser extracts +yield+ expressions from method bodies to gather the
-# yielded argument names.  If your method manually calls a block instead of
-# yielding or you want to override the discovered argument names use
-# the :yields: directive:
-#
-#   ##
-#   # My method is awesome
-#
-#   def my_method(&block) # :yields: happy, times
-#     block.call 1, 2
-#   end
-#
-# == Metaprogrammed Methods
-#
-# To pick up a metaprogrammed method, the parser looks for a comment starting
-# with '##' before an identifier:
-#
-#   ##
-#   # This is a meta-programmed method!
-#
-#   add_my_method :meta_method, :arg1, :arg2
-#
-# The parser looks at the token after the identifier to determine the name, in
-# this example, :meta_method.  If a name cannot be found, a warning is printed
-# and 'unknown is used.
-#
-# You can force the name of a method using the :method: directive:
-#
-#   ##
-#   # :method: some_method!
-#
-# By default, meta-methods are instance methods.  To indicate that a method is
-# a singleton method instead use the :singleton-method: directive:
-#
-#   ##
-#   # :singleton-method:
-#
-# You can also use the :singleton-method: directive with a name:
-#
-#   ##
-#   # :singleton-method: some_method!
-#
-# You can define arguments for metaprogrammed methods via either the
-# :call-seq:, :arg: or :args: directives.
-#
-# Additionally you can mark a method as an attribute by
-# using :attr:, :attr_reader:, :attr_writer: or :attr_accessor:.  Just like
-# for :method:, the name is optional.
-#
-#   ##
-#   # :attr_reader: my_attr_name
-#
-# == Hidden methods and attributes
-#
-# You can provide documentation for methods that don't appear using
-# the :method:, :singleton-method: and :attr: directives:
-#
-#   ##
-#   # :attr_writer: ghost_writer
-#   # There is an attribute here, but you can't see it!
-#
-#   ##
-#   # :method: ghost_method
-#   # There is a method here, but you can't see it!
-#
-#   ##
-#   # this is a comment for a regular method
-#
-#   def regular_method() end
-#
-# Note that by default, the :method: directive will be ignored if there is a
-# standard rdocable item following it.
-
-class RDoc::Parser::Ruby < RDoc::Parser
-
-  parse_files_matching(/\.rbw?$/)
-
-  include RDoc::TokenStream
-  include RDoc::Parser::RubyTools
-
-  ##
-  # RDoc::NormalClass type
-
-  NORMAL = "::"
-
-  ##
-  # RDoc::SingleClass type
-
-  SINGLE = "<<"
-
-  ##
-  # Creates a new Ruby parser.
-
-  def initialize(top_level, file_name, content, options, stats)
-    super
-
-    content = handle_tab_width(content)
-
-    @size = 0
-    @token_listeners = nil
-    content = RDoc::Encoding.remove_magic_comment content
-    @scanner = RDoc::Parser::RipperStateLex.parse(content)
-    @content = content
-    @scanner_point = 0
-    @prev_seek = nil
-    @markup = @options.markup
-    @track_visibility = :nodoc != @options.visibility
-    @encoding = @options.encoding
-
-    reset
-  end
-
-  ##
-  # Return +true+ if +tk+ is a newline.
-
-  def tk_nl?(tk)
-    :on_nl == tk[:kind] or :on_ignored_nl == tk[:kind]
-  end
-
-  ##
-  # Retrieves the read token stream and replaces +pattern+ with +replacement+
-  # using gsub.  If the result is only a ";" returns an empty string.
-
-  def get_tkread_clean pattern, replacement # :nodoc:
-    read = get_tkread.gsub(pattern, replacement).strip
-    return '' if read == ';'
-    read
-  end
-
-  ##
-  # Extracts the visibility information for the visibility token +tk+
-  # and +single+ class type identifier.
-  #
-  # Returns the visibility type (a string), the visibility (a symbol) and
-  # +singleton+ if the methods following should be converted to singleton
-  # methods.
-
-  def get_visibility_information tk, single # :nodoc:
-    vis_type  = tk[:text]
-    singleton = single == SINGLE
-
-    vis =
-      case vis_type
-      when 'private'   then :private
-      when 'protected' then :protected
-      when 'public'    then :public
-      when 'private_class_method' then
-        singleton = true
-        :private
-      when 'public_class_method' then
-        singleton = true
-        :public
-      when 'module_function' then
-        singleton = true
-        :public
-      else
-        raise RDoc::Error, "Invalid visibility: #{tk.name}"
-      end
-
-    return vis_type, vis, singleton
-  end
-
-  ##
-  # Look for the first comment in a file that isn't a shebang line.
-
-  def collect_first_comment
-    skip_tkspace
-    comment = ''.dup
-    comment = RDoc::Encoding.change_encoding comment, @encoding if @encoding
-    first_line = true
-    first_comment_tk_kind = nil
-    line_no = nil
-
-    tk = get_tk
-
-    while tk && (:on_comment == tk[:kind] or :on_embdoc == tk[:kind])
-      comment_body = retrieve_comment_body(tk)
-      if first_line and comment_body =~ /\A#!/ then
-        skip_tkspace
-        tk = get_tk
-      elsif first_line and comment_body =~ /\A#\s*-\*-/ then
-        first_line = false
-        skip_tkspace
-        tk = get_tk
-      else
-        break if first_comment_tk_kind and not first_comment_tk_kind === tk[:kind]
-        first_comment_tk_kind = tk[:kind]
-
-        line_no = tk[:line_no] if first_line
-        first_line = false
-        comment << comment_body
-        tk = get_tk
-
-        if :on_nl === tk then
-          skip_tkspace_without_nl
-          tk = get_tk
-        end
-      end
-    end
-
-    unget_tk tk
-
-    new_comment comment, line_no
-  end
-
-  ##
-  # Consumes trailing whitespace from the token stream
-
-  def consume_trailing_spaces # :nodoc:
-    skip_tkspace_without_nl
-  end
-
-  ##
-  # Creates a new attribute in +container+ with +name+.
-
-  def create_attr container, single, name, rw, comment # :nodoc:
-    att = RDoc::Attr.new get_tkread, name, rw, comment, single == SINGLE
-    record_location att
-
-    container.add_attribute att
-    @stats.add_attribute att
-
-    att
-  end
-
-  ##
-  # Creates a module alias in +container+ at +rhs_name+ (or at the top-level
-  # for "::") with the name from +constant+.
-
-  def create_module_alias container, constant, rhs_name # :nodoc:
-    mod = if rhs_name =~ /^::/ then
-            @store.find_class_or_module rhs_name
-          else
-            container.find_module_named rhs_name
-          end
-
-    container.add_module_alias mod, rhs_name, constant, @top_level
-  end
-
-  ##
-  # Aborts with +msg+
-
-  def error(msg)
-    msg = make_message msg
-
-    abort msg
-  end
-
-  ##
-  # Looks for a true or false token.
-
-  def get_bool
-    skip_tkspace
-    tk = get_tk
-    if :on_kw == tk[:kind] && 'true' == tk[:text]
-      true
-    elsif :on_kw == tk[:kind] && ('false' == tk[:text] || 'nil' == tk[:text])
-      false
-    else
-      unget_tk tk
-      true
-    end
-  end
-
-  ##
-  # Look for the name of a class of module (optionally with a leading :: or
-  # with :: separated named) and return the ultimate name, the associated
-  # container, and the given name (with the ::).
-
-  def get_class_or_module container, ignore_constants = false
-    skip_tkspace
-    name_t = get_tk
-    given_name = ''.dup
-
-    # class ::A -> A is in the top level
-    if :on_op == name_t[:kind] and '::' == name_t[:text] then # bug
-      name_t = get_tk
-      container = @top_level
-      given_name << '::'
-    end
-
-    skip_tkspace_without_nl
-    given_name << name_t[:text]
-
-    is_self = name_t[:kind] == :on_op && name_t[:text] == '<<'
-    new_modules = []
-    while !is_self && (tk = peek_tk) and :on_op == tk[:kind] and '::' == tk[:text] do
-      prev_container = container
-      container = container.find_module_named name_t[:text]
-      container ||=
-        if ignore_constants then
-          c = RDoc::NormalModule.new name_t[:text]
-          c.store = @store
-          new_modules << [prev_container, c]
-          c
-        else
-          c = prev_container.add_module RDoc::NormalModule, name_t[:text]
-          c.ignore unless prev_container.document_children
-          @top_level.add_to_classes_or_modules c
-          c
-        end
-
-      record_location container
-
-      get_tk
-      skip_tkspace
-      if :on_lparen == peek_tk[:kind] # ProcObjectInConstant::()
-        parse_method_or_yield_parameters
-        break
-      end
-      name_t = get_tk
-      unless :on_const == name_t[:kind] || :on_ident == name_t[:kind]
-        raise RDoc::Error, "Invalid class or module definition: #{given_name}"
-      end
-      if prev_container == container and !ignore_constants
-        given_name = name_t[:text]
-      else
-        given_name << '::' + name_t[:text]
-      end
-    end
-
-    skip_tkspace_without_nl
-
-    return [container, name_t, given_name, new_modules]
-  end
-
-  ##
-  # Skip opening parentheses and yield the block.
-  # Skip closing parentheses too when exists.
-
-  def skip_parentheses(&block)
-    left_tk = peek_tk
-
-    if :on_lparen == left_tk[:kind]
-      get_tk
-
-      ret = skip_parentheses(&block)
-
-      right_tk = peek_tk
-      if :on_rparen == right_tk[:kind]
-        get_tk
-      end
-
-      ret
-    else
-      yield
-    end
-  end
-
-  ##
-  # Return a superclass, which can be either a constant of an expression
-
-  def get_class_specification
-    tk = peek_tk
-    if tk.nil?
-      return ''
-    elsif :on_kw == tk[:kind] && 'self' == tk[:text]
-      return 'self'
-    elsif :on_gvar == tk[:kind]
-      return ''
-    end
-
-    res = get_constant
-
-    skip_tkspace_without_nl
-
-    get_tkread # empty out read buffer
-
-    tk = get_tk
-    return res unless tk
-
-    case tk[:kind]
-    when :on_nl, :on_comment, :on_embdoc, :on_semicolon then
-      unget_tk(tk)
-      return res
-    end
-
-    res += parse_call_parameters(tk)
-    res
-  end
-
-  ##
-  # Parse a constant, which might be qualified by one or more class or module
-  # names
-
-  def get_constant
-    res = ""
-    skip_tkspace_without_nl
-    tk = get_tk
-
-    while tk && ((:on_op == tk[:kind] && '::' == tk[:text]) || :on_const == tk[:kind]) do
-      res += tk[:text]
-      tk = get_tk
-    end
-
-    unget_tk(tk)
-    res
-  end
-
-  ##
-  # Get an included module that may be surrounded by parens
-
-  def get_included_module_with_optional_parens
-    skip_tkspace_without_nl
-    get_tkread
-    tk = get_tk
-    end_token = get_end_token tk
-    return '' unless end_token
-
-    nest = 0
-    continue = false
-    only_constant = true
-
-    while tk != nil do
-      is_element_of_constant = false
-      case tk[:kind]
-      when :on_semicolon then
-        break if nest == 0
-      when :on_lbracket then
-        nest += 1
-      when :on_rbracket then
-        nest -= 1
-      when :on_lbrace then
-        nest += 1
-      when :on_rbrace then
-        nest -= 1
-        if nest <= 0
-          # we might have a.each { |i| yield i }
-          unget_tk(tk) if nest < 0
-          break
-        end
-      when :on_lparen then
-        nest += 1
-      when end_token[:kind] then
-        if end_token[:kind] == :on_rparen
-          nest -= 1
-          break if nest <= 0
-        else
-          break if nest <= 0
-        end
-      when :on_rparen then
-        nest -= 1
-      when :on_comment, :on_embdoc then
-        @read.pop
-        if :on_nl == end_token[:kind] and "\n" == tk[:text][-1] and
-          (!continue or (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) != 0) then
-          break if !continue and nest <= 0
-        end
-      when :on_comma then
-        continue = true
-      when :on_ident then
-        continue = false if continue
-      when :on_kw then
-        case tk[:text]
-        when 'def', 'do', 'case', 'for', 'begin', 'class', 'module'
-          nest += 1
-        when 'if', 'unless', 'while', 'until', 'rescue'
-          # postfix if/unless/while/until/rescue must be EXPR_LABEL
-          nest += 1 unless (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) != 0
-        when 'end'
-          nest -= 1
-          break if nest == 0
-        end
-      when :on_const then
-        is_element_of_constant = true
-      when :on_op then
-        is_element_of_constant = true if '::' == tk[:text]
-      end
-      only_constant = false unless is_element_of_constant
-      tk = get_tk
-    end
-
-    if only_constant
-      get_tkread_clean(/\s+/, ' ')
-    else
-      ''
-    end
-  end
-
-  ##
-  # Little hack going on here. In the statement:
-  #
-  #   f = 2*(1+yield)
-  #
-  # We see the RPAREN as the next token, so we need to exit early.  This still
-  # won't catch all cases (such as "a = yield + 1"
-
-  def get_end_token tk # :nodoc:
-    case tk[:kind]
-    when :on_lparen
-      token = RDoc::Parser::RipperStateLex::Token.new
-      token[:kind] = :on_rparen
-      token[:text] = ')'
-      token
-    when :on_rparen
-      nil
-    else
-      token = RDoc::Parser::RipperStateLex::Token.new
-      token[:kind] = :on_nl
-      token[:text] = "\n"
-      token
-    end
-  end
-
-  ##
-  # Retrieves the method container for a singleton method.
-
-  def get_method_container container, name_t # :nodoc:
-    prev_container = container
-    container = container.find_module_named(name_t[:text])
-
-    unless container then
-      constant = prev_container.constants.find do |const|
-        const.name == name_t[:text]
-      end
-
-      if constant then
-        parse_method_dummy prev_container
-        return
-      end
-    end
-
-    unless container then
-      # TODO seems broken, should starting at Object in @store
-      obj = name_t[:text].split("::").inject(Object) do |state, item|
-        state.const_get(item)
-      end rescue nil
-
-      type = obj.class == Class ? RDoc::NormalClass : RDoc::NormalModule
-
-      unless [Class, Module].include?(obj.class) then
-        warn("Couldn't find #{name_t[:text]}. Assuming it's a module")
-      end
-
-      if type == RDoc::NormalClass then
-        sclass = obj.superclass ? obj.superclass.name : nil
-        container = prev_container.add_class type, name_t[:text], sclass
-      else
-        container = prev_container.add_module type, name_t[:text]
-      end
-
-      record_location container
-    end
-
-    container
-  end
-
-  ##
-  # Extracts a name or symbol from the token stream.
-
-  def get_symbol_or_name
-    tk = get_tk
-    case tk[:kind]
-    when :on_symbol then
-      text = tk[:text].sub(/^:/, '')
-
-      next_tk = peek_tk
-      if next_tk && :on_op == next_tk[:kind] && '=' == next_tk[:text] then
-        get_tk
-        text << '='
-      end
-
-      text
-    when :on_ident, :on_const, :on_gvar, :on_cvar, :on_ivar, :on_op, :on_kw then
-      tk[:text]
-    when :on_tstring, :on_dstring then
-      tk[:text][1..-2]
-    else
-      raise RDoc::Error, "Name or symbol expected (got #{tk})"
-    end
-  end
-
-  ##
-  # Marks containers between +container+ and +ancestor+ as ignored
-
-  def suppress_parents container, ancestor # :nodoc:
-    while container and container != ancestor do
-      container.suppress unless container.documented?
-      container = container.parent
-    end
-  end
-
-  ##
-  # Look for directives in a normal comment block:
-  #
-  #   # :stopdoc:
-  #   # Don't display comment from this point forward
-  #
-  # This routine modifies its +comment+ parameter.
-
-  def look_for_directives_in container, comment
-    @preprocess.handle comment, container do |directive, param|
-      case directive
-      when 'method', 'singleton-method',
-           'attr', 'attr_accessor', 'attr_reader', 'attr_writer' then
-        false # handled elsewhere
-      when 'section' then
-        break unless container.kind_of?(RDoc::Context)
-        container.set_current_section param, comment.dup
-        comment.text = ''
-        break
-      end
-    end
-
-    comment.remove_private
-  end
-
-  ##
-  # Adds useful info about the parser to +message+
-
-  def make_message message
-    prefix = "#{@file_name}:".dup
-
-    tk = peek_tk
-    prefix << "#{tk[:line_no]}:#{tk[:char_no]}:" if tk
-
-    "#{prefix} #{message}"
-  end
-
-  ##
-  # Creates a comment with the correct format
-
-  def new_comment comment, line_no = nil
-    c = RDoc::Comment.new comment, @top_level, :ruby
-    c.line = line_no
-    c.format = @markup
-    c
-  end
-
-  ##
-  # Creates an RDoc::Attr for the name following +tk+, setting the comment to
-  # +comment+.
-
-  def parse_attr(context, single, tk, comment)
-    line_no = tk[:line_no]
-
-    args = parse_symbol_arg 1
-    if args.size > 0 then
-      name = args[0]
-      rw = "R"
-      skip_tkspace_without_nl
-      tk = get_tk
-
-      if :on_comma == tk[:kind] then
-        rw = "RW" if get_bool
-      else
-        unget_tk tk
-      end
-
-      att = create_attr context, single, name, rw, comment
-      att.line   = line_no
-
-      read_documentation_modifiers att, RDoc::ATTR_MODIFIERS
-    else
-      warn "'attr' ignored - looks like a variable"
-    end
-  end
-
-  ##
-  # Creates an RDoc::Attr for each attribute listed after +tk+, setting the
-  # comment for each to +comment+.
-
-  def parse_attr_accessor(context, single, tk, comment)
-    line_no = tk[:line_no]
-
-    args = parse_symbol_arg
-    rw = "?"
-
-    tmp = RDoc::CodeObject.new
-    read_documentation_modifiers tmp, RDoc::ATTR_MODIFIERS
-    # TODO In most other places we let the context keep track of document_self
-    # and add found items appropriately but here we do not.  I'm not sure why.
-    return if @track_visibility and not tmp.document_self
-
-    case tk[:text]
-    when "attr_reader"   then rw = "R"
-    when "attr_writer"   then rw = "W"
-    when "attr_accessor" then rw = "RW"
-    else
-      rw = '?'
-    end
-
-    for name in args
-      att = create_attr context, single, name, rw, comment
-      att.line   = line_no
-    end
-  end
-
-  ##
-  # Parses an +alias+ in +context+ with +comment+
-
-  def parse_alias(context, single, tk, comment)
-    line_no = tk[:line_no]
-
-    skip_tkspace
-
-    if :on_lparen === peek_tk[:kind] then
-      get_tk
-      skip_tkspace
-    end
-
-    new_name = get_symbol_or_name
-
-    skip_tkspace
-    if :on_comma === peek_tk[:kind] then
-      get_tk
-      skip_tkspace
-    end
-
-    begin
-      old_name = get_symbol_or_name
-    rescue RDoc::Error
-      return
-    end
-
-    al = RDoc::Alias.new(get_tkread, old_name, new_name, comment,
-                         single == SINGLE)
-    record_location al
-    al.line   = line_no
-
-    read_documentation_modifiers al, RDoc::ATTR_MODIFIERS
-    if al.document_self or not @track_visibility
-      context.add_alias al
-      @stats.add_alias al
-    end
-
-    al
-  end
-
-  ##
-  # Extracts call parameters from the token stream.
-
-  def parse_call_parameters(tk)
-    end_token = case tk[:kind]
-                when :on_lparen
-                  :on_rparen
-                when :on_rparen
-                  return ""
-                else
-                  :on_nl
-                end
-    nest = 0
-
-    loop do
-      break if tk.nil?
-      case tk[:kind]
-      when :on_semicolon
-        break
-      when :on_lparen
-        nest += 1
-      when end_token
-        if end_token == :on_rparen
-          nest -= 1
-          break if RDoc::Parser::RipperStateLex.end?(tk) and nest <= 0
-        else
-          break if RDoc::Parser::RipperStateLex.end?(tk)
-        end
-      when :on_comment, :on_embdoc
-        unget_tk(tk)
-        break
-      when :on_op
-        if tk[:text] =~ /^(.{1,2})?=$/
-          unget_tk(tk)
-          break
-        end
-      end
-      tk = get_tk
-    end
-
-    get_tkread_clean "\n", " "
-  end
-
-  ##
-  # Parses a class in +context+ with +comment+
-
-  def parse_class container, single, tk, comment
-    line_no = tk[:line_no]
-
-    declaration_context = container
-    container, name_t, given_name, = get_class_or_module container
-
-    if name_t[:kind] == :on_const
-      cls = parse_class_regular container, declaration_context, single,
-        name_t, given_name, comment
-    elsif name_t[:kind] == :on_op && name_t[:text] == '<<'
-      case name = skip_parentheses { get_class_specification }
-      when 'self', container.name
-        read_documentation_modifiers cls, RDoc::CLASS_MODIFIERS
-        parse_statements container, SINGLE
-        return # don't update line
-      else
-        cls = parse_class_singleton container, name, comment
-      end
-    else
-      warn "Expected class name or '<<'. Got #{name_t[:kind]}: #{name_t[:text].inspect}"
-      return
-    end
-
-    cls.line   = line_no
-
-    # after end modifiers
-    read_documentation_modifiers cls, RDoc::CLASS_MODIFIERS
-
-    cls
-  end
-
-  ##
-  # Parses and creates a regular class
-
-  def parse_class_regular container, declaration_context, single, # :nodoc:
-                          name_t, given_name, comment
-    superclass = '::Object'
-
-    if given_name =~ /^::/ then
-      declaration_context = @top_level
-      given_name = $'
-    end
-
-    tk = peek_tk
-    if tk[:kind] == :on_op && tk[:text] == '<' then
-      get_tk
-      skip_tkspace
-      superclass = get_class_specification
-      superclass = '(unknown)' if superclass.empty?
-    end
-
-    cls_type = single == SINGLE ? RDoc::SingleClass : RDoc::NormalClass
-    cls = declaration_context.add_class cls_type, given_name, superclass
-    cls.ignore unless container.document_children
-
-    read_documentation_modifiers cls, RDoc::CLASS_MODIFIERS
-    record_location cls
-
-    cls.add_comment comment, @top_level
-
-    @top_level.add_to_classes_or_modules cls
-    @stats.add_class cls
-
-    suppress_parents container, declaration_context unless cls.document_self
-
-    parse_statements cls
-
-    cls
-  end
-
-  ##
-  # Parses a singleton class in +container+ with the given +name+ and
-  # +comment+.
-
-  def parse_class_singleton container, name, comment # :nodoc:
-    other = @store.find_class_named name
-
-    unless other then
-      if name =~ /^::/ then
-        name = $'
-        container = @top_level
-      end
-
-      other = container.add_module RDoc::NormalModule, name
-      record_location other
-
-      # class << $gvar
-      other.ignore if name.empty?
-
-      other.add_comment comment, @top_level
-    end
-
-    # notify :nodoc: all if not a constant-named class/module
-    # (and remove any comment)
-    unless name =~ /\A(::)?[A-Z]/ then
-      other.document_self = nil
-      other.document_children = false
-      other.clear_comment
-    end
-
-    @top_level.add_to_classes_or_modules other
-    @stats.add_class other
-
-    read_documentation_modifiers other, RDoc::CLASS_MODIFIERS
-    parse_statements(other, SINGLE)
-
-    other
-  end
-
-  ##
-  # Parses a constant in +context+ with +comment+.  If +ignore_constants+ is
-  # true, no found constants will be added to RDoc.
-
-  def parse_constant container, tk, comment, ignore_constants = false
-    line_no = tk[:line_no]
-
-    name = tk[:text]
-    skip_tkspace_without_nl
-
-    return unless name =~ /^\w+$/
-
-    new_modules = []
-    if :on_op == peek_tk[:kind] && '::' == peek_tk[:text] then
-      unget_tk tk
-
-      container, name_t, _, new_modules = get_class_or_module container, true
-
-      name = name_t[:text]
-    end
-
-    is_array_or_hash = false
-    if peek_tk && :on_lbracket == peek_tk[:kind]
-      get_tk
-      nest = 1
-      while bracket_tk = get_tk
-        case bracket_tk[:kind]
-        when :on_lbracket
-          nest += 1
-        when :on_rbracket
-          nest -= 1
-          break if nest == 0
-        end
-      end
-      skip_tkspace_without_nl
-      is_array_or_hash = true
-    end
-
-    unless peek_tk && :on_op == peek_tk[:kind] && '=' == peek_tk[:text] then
-      return false
-    end
-    get_tk
-
-    unless ignore_constants
-      new_modules.each do |prev_c, new_module|
-        prev_c.add_module_by_normal_module new_module
-        new_module.ignore unless prev_c.document_children
-        @top_level.add_to_classes_or_modules new_module
-      end
-    end
-
-    value = ''
-    con = RDoc::Constant.new name, value, comment
-
-    body = parse_constant_body container, con, is_array_or_hash
-
-    return unless body
-
-    con.value = body
-    record_location con
-    con.line   = line_no
-    read_documentation_modifiers con, RDoc::CONSTANT_MODIFIERS
-
-    return if is_array_or_hash
-
-    @stats.add_constant con
-    container.add_constant con
-
-    true
-  end
-
-  def parse_constant_body container, constant, is_array_or_hash # :nodoc:
-    nest     = 0
-    rhs_name = ''.dup
-
-    get_tkread
-
-    tk = get_tk
-
-    body = nil
-    loop do
-      break if tk.nil?
-      if :on_semicolon == tk[:kind] then
-        break if nest <= 0
-      elsif [:on_tlambeg, :on_lparen, :on_lbrace, :on_lbracket].include?(tk[:kind]) then
-        nest += 1
-      elsif (:on_kw == tk[:kind] && 'def' == tk[:text]) then
-        nest += 1
-      elsif (:on_kw == tk[:kind] && %w{do if unless case begin}.include?(tk[:text])) then
-        if (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) == 0
-          nest += 1
-        end
-      elsif [:on_rparen, :on_rbrace, :on_rbracket].include?(tk[:kind]) ||
-            (:on_kw == tk[:kind] && 'end' == tk[:text]) then
-        nest -= 1
-      elsif (:on_comment == tk[:kind] or :on_embdoc == tk[:kind]) then
-        unget_tk tk
-        if nest <= 0 and RDoc::Parser::RipperStateLex.end?(tk) then
-          body = get_tkread_clean(/^[ \t]+/, '')
-          read_documentation_modifiers constant, RDoc::CONSTANT_MODIFIERS
-          break
-        else
-          read_documentation_modifiers constant, RDoc::CONSTANT_MODIFIERS
-        end
-      elsif :on_const == tk[:kind] then
-        rhs_name << tk[:text]
-
-        next_tk = peek_tk
-        if nest <= 0 and (next_tk.nil? || :on_nl == next_tk[:kind]) then
-          create_module_alias container, constant, rhs_name unless is_array_or_hash
-          break
-        end
-      elsif :on_nl == tk[:kind] then
-        if nest <= 0 and RDoc::Parser::RipperStateLex.end?(tk) then
-          unget_tk tk
-          break
-        end
-      elsif :on_op == tk[:kind] && '::' == tk[:text]
-        rhs_name << '::'
-      end
-      tk = get_tk
-    end
-
-    body ? body : get_tkread_clean(/^[ \t]+/, '')
-  end
-
-  ##
-  # Generates an RDoc::Method or RDoc::Attr from +comment+ by looking for
-  # :method: or :attr: directives in +comment+.
-
-  def parse_comment container, tk, comment
-    return parse_comment_tomdoc container, tk, comment if @markup == 'tomdoc'
-    column  = tk[:char_no]
-    line_no = comment.line.nil? ? tk[:line_no] : comment.line
-
-    comment.text = comment.text.sub(/(^# +:?)(singleton-)(method:)/, '\1\3')
-    singleton = !!$~
-
-    co =
-      if (comment.text = comment.text.sub(/^# +:?method: *(\S*).*?\n/i, '')) && !!$~ then
-        line_no += $`.count("\n")
-        parse_comment_ghost container, comment.text, $1, column, line_no, comment
-      elsif (comment.text = comment.text.sub(/# +:?(attr(_reader|_writer|_accessor)?): *(\S*).*?\n/i, '')) && !!$~ then
-        parse_comment_attr container, $1, $3, comment
-      end
-
-    if co then
-      co.singleton = singleton
-      co.line      = line_no
-    end
-
-    true
-  end
-
-  ##
-  # Parse a comment that is describing an attribute in +container+ with the
-  # given +name+ and +comment+.
-
-  def parse_comment_attr container, type, name, comment # :nodoc:
-    return if name.empty?
-
-    rw = case type
-         when 'attr_reader' then 'R'
-         when 'attr_writer' then 'W'
-         else 'RW'
-         end
-
-    create_attr container, NORMAL, name, rw, comment
-  end
-
-  def parse_comment_ghost container, text, name, column, line_no, # :nodoc:
-                          comment
-    name = nil if name.empty?
-
-    meth = RDoc::GhostMethod.new get_tkread, name
-    record_location meth
-
-    meth.start_collecting_tokens
-    indent = RDoc::Parser::RipperStateLex::Token.new(1, 1, :on_sp, ' ' * column)
-    position_comment = RDoc::Parser::RipperStateLex::Token.new(line_no, 1, :on_comment)
-    position_comment[:text] = "# File #{@top_level.relative_name}, line #{line_no}"
-    newline = RDoc::Parser::RipperStateLex::Token.new(0, 0, :on_nl, "\n")
-    meth.add_tokens [position_comment, newline, indent]
-
-    meth.params =
-      if text.sub!(/^#\s+:?args?:\s*(.*?)\s*$/i, '') then
-        $1
-      else
-        ''
-      end
-
-    comment.normalize
-    comment.extract_call_seq meth
-
-    return unless meth.name
-
-    container.add_method meth
-
-    meth.comment = comment
-
-    @stats.add_method meth
-
-    meth
-  end
-
-  ##
-  # Creates an RDoc::Method on +container+ from +comment+ if there is a
-  # Signature section in the comment
-
-  def parse_comment_tomdoc container, tk, comment
-    return unless signature = RDoc::TomDoc.signature(comment)
-    column  = tk[:char_no]
-    line_no = tk[:line_no]
-
-    name, = signature.split %r%[ \(]%, 2
-
-    meth = RDoc::GhostMethod.new get_tkread, name
-    record_location meth
-    meth.line      = line_no
-
-    meth.start_collecting_tokens
-    indent = RDoc::Parser::RipperStateLex::Token.new(1, 1, :on_sp, ' ' * column)
-    position_comment = RDoc::Parser::RipperStateLex::Token.new(line_no, 1, :on_comment)
-    position_comment[:text] = "# File #{@top_level.relative_name}, line #{line_no}"
-    newline = RDoc::Parser::RipperStateLex::Token.new(0, 0, :on_nl, "\n")
-    meth.add_tokens [position_comment, newline, indent]
-
-    meth.call_seq = signature
-
-    comment.normalize
-
-    return unless meth.name
-
-    container.add_method meth
-
-    meth.comment = comment
-
-    @stats.add_method meth
-  end
-
-  ##
-  # Parses an +include+ or +extend+, indicated by the +klass+ and adds it to
-  # +container+ # with +comment+
-
-  def parse_extend_or_include klass, container, comment # :nodoc:
-    loop do
-      skip_tkspace_comment
-
-      name = get_included_module_with_optional_parens
-
-      unless name.empty? then
-        obj = container.add klass, name, comment
-        record_location obj
-      end
-
-      return if peek_tk.nil? || :on_comma != peek_tk[:kind]
-
-      get_tk
-    end
-  end
-
-  ##
-  # Parses an +included+ with a block feature of ActiveSupport::Concern.
-
-  def parse_included_with_activesupport_concern container, comment # :nodoc:
-    skip_tkspace_without_nl
-    tk = get_tk
-    unless tk[:kind] == :on_lbracket || (tk[:kind] == :on_kw && tk[:text] == 'do')
-      unget_tk tk
-      return nil # should be a block
-    end
-
-    parse_statements container
-
-    container
-  end
-
-  ##
-  # Parses identifiers that can create new methods or change visibility.
-  #
-  # Returns true if the comment was not consumed.
-
-  def parse_identifier container, single, tk, comment # :nodoc:
-    case tk[:text]
-    when 'private', 'protected', 'public', 'private_class_method',
-         'public_class_method', 'module_function' then
-      parse_visibility container, single, tk
-      return true
-    when 'private_constant', 'public_constant'
-      parse_constant_visibility container, single, tk
-      return true
-    when 'attr' then
-      parse_attr container, single, tk, comment
-    when /^attr_(reader|writer|accessor)$/ then
-      parse_attr_accessor container, single, tk, comment
-    when 'alias_method' then
-      parse_alias container, single, tk, comment
-    when 'require', 'include' then
-      # ignore
-    else
-      if comment.text =~ /\A#\#$/ then
-        case comment.text
-        when /^# +:?attr(_reader|_writer|_accessor)?:/ then
-          parse_meta_attr container, single, tk, comment
-        else
-          method = parse_meta_method container, single, tk, comment
-          method.params = container.params if
-            container.params
-          method.block_params = container.block_params if
-            container.block_params
-        end
-      end
-    end
-
-    false
-  end
-
-  ##
-  # Parses a meta-programmed attribute and creates an RDoc::Attr.
-  #
-  # To create foo and bar attributes on class C with comment "My attributes":
-  #
-  #   class C
-  #
-  #     ##
-  #     # :attr:
-  #     #
-  #     # My attributes
-  #
-  #     my_attr :foo, :bar
-  #
-  #   end
-  #
-  # To create a foo attribute on class C with comment "My attribute":
-  #
-  #   class C
-  #
-  #     ##
-  #     # :attr: foo
-  #     #
-  #     # My attribute
-  #
-  #     my_attr :foo, :bar
-  #
-  #   end
-
-  def parse_meta_attr(context, single, tk, comment)
-    args = parse_symbol_arg
-    rw = "?"
-
-    # If nodoc is given, don't document any of them
-
-    tmp = RDoc::CodeObject.new
-    read_documentation_modifiers tmp, RDoc::ATTR_MODIFIERS
-
-    regexp = /^# +:?(attr(_reader|_writer|_accessor)?): *(\S*).*?\n/i
-    if regexp =~ comment.text then
-      comment.text = comment.text.sub(regexp, '')
-      rw = case $1
-           when 'attr_reader' then 'R'
-           when 'attr_writer' then 'W'
-           else 'RW'
-           end
-      name = $3 unless $3.empty?
-    end
-
-    if name then
-      att = create_attr context, single, name, rw, comment
-    else
-      args.each do |attr_name|
-        att = create_attr context, single, attr_name, rw, comment
-      end
-    end
-
-    att
-  end
-
-  ##
-  # Parses a meta-programmed method
-
-  def parse_meta_method(container, single, tk, comment)
-    column  = tk[:char_no]
-    line_no = tk[:line_no]
-
-    start_collecting_tokens
-    add_token tk
-    add_token_listener self
-
-    skip_tkspace_without_nl
-
-    comment.text = comment.text.sub(/(^# +:?)(singleton-)(method:)/, '\1\3')
-    singleton = !!$~
-
-    name = parse_meta_method_name comment, tk
-
-    return unless name
-
-    meth = RDoc::MetaMethod.new get_tkread, name
-    record_location meth
-    meth.line   = line_no
-    meth.singleton = singleton
-
-    remove_token_listener self
-
-    meth.start_collecting_tokens
-    indent = RDoc::Parser::RipperStateLex::Token.new(1, 1, :on_sp, ' ' * column)
-    position_comment = RDoc::Parser::RipperStateLex::Token.new(line_no, 1, :on_comment)
-    position_comment[:text] = "# File #{@top_level.relative_name}, line #{line_no}"
-    newline = RDoc::Parser::RipperStateLex::Token.new(0, 0, :on_nl, "\n")
-    meth.add_tokens [position_comment, newline, indent]
-    meth.add_tokens @token_stream
-
-    parse_meta_method_params container, single, meth, tk, comment
-
-    meth.comment = comment
-
-    @stats.add_method meth
-
-    meth
-  end
-
-  ##
-  # Parses the name of a metaprogrammed method.  +comment+ is used to
-  # determine the name while +tk+ is used in an error message if the name
-  # cannot be determined.
-
-  def parse_meta_method_name comment, tk # :nodoc:
-    if comment.text.sub!(/^# +:?method: *(\S*).*?\n/i, '') then
-      return $1 unless $1.empty?
-    end
-
-    name_t = get_tk
-
-    if :on_symbol == name_t[:kind] then
-      name_t[:text][1..-1]
-    elsif :on_tstring == name_t[:kind] then
-      name_t[:text][1..-2]
-    elsif :on_op == name_t[:kind] && '=' == name_t[:text] then # ignore
-      remove_token_listener self
-
-      nil
-    else
-      warn "unknown name token #{name_t.inspect} for meta-method '#{tk[:text]}'"
-      'unknown'
-    end
-  end
-
-  ##
-  # Parses the parameters and block for a meta-programmed method.
-
-  def parse_meta_method_params container, single, meth, tk, comment # :nodoc:
-    token_listener meth do
-      meth.params = ''
-
-      look_for_directives_in meth, comment
-      comment.normalize
-      comment.extract_call_seq meth
-
-      container.add_method meth
-
-      last_tk = tk
-
-      while tk = get_tk do
-        if :on_semicolon == tk[:kind] then
-          break
-        elsif :on_nl == tk[:kind] then
-          break unless last_tk and :on_comma == last_tk[:kind]
-        elsif :on_sp == tk[:kind] then
-          # expression continues
-        elsif :on_kw == tk[:kind] && 'do' == tk[:text] then
-          parse_statements container, single, meth
-          break
-        else
-          last_tk = tk
-        end
-      end
-    end
-  end
-
-  ##
-  # Parses a normal method defined by +def+
-
-  def parse_method(container, single, tk, comment)
-    singleton = nil
-    added_container = false
-    name = nil
-    column  = tk[:char_no]
-    line_no = tk[:line_no]
-
-    start_collecting_tokens
-    add_token tk
-
-    token_listener self do
-      prev_container = container
-      name, container, singleton = parse_method_name container
-      added_container = container != prev_container
-    end
-
-    return unless name
-
-    meth = RDoc::AnyMethod.new get_tkread, name
-    look_for_directives_in meth, comment
-    meth.singleton = single == SINGLE ? true : singleton
-    if singleton
-      # `current_line_visibility' is useless because it works against
-      # the normal method named as same as the singleton method, after
-      # the latter was defined.  Of course these are different things.
-      container.current_line_visibility = :public
-    end
-
-    record_location meth
-    meth.line   = line_no
-
-    meth.start_collecting_tokens
-    indent = RDoc::Parser::RipperStateLex::Token.new(1, 1, :on_sp, ' ' * column)
-    token = RDoc::Parser::RipperStateLex::Token.new(line_no, 1, :on_comment)
-    token[:text] = "# File #{@top_level.relative_name}, line #{line_no}"
-    newline = RDoc::Parser::RipperStateLex::Token.new(0, 0, :on_nl, "\n")
-    meth.add_tokens [token, newline, indent]
-    meth.add_tokens @token_stream
-
-    parse_method_params_and_body container, single, meth, added_container
-
-    comment.normalize
-    comment.extract_call_seq meth
-
-    meth.comment = comment
-
-    # after end modifiers
-    read_documentation_modifiers meth, RDoc::METHOD_MODIFIERS
-
-    @stats.add_method meth
-  end
-
-  ##
-  # Parses the parameters and body of +meth+
-
-  def parse_method_params_and_body container, single, meth, added_container
-    token_listener meth do
-      parse_method_parameters meth
-
-      if meth.document_self or not @track_visibility then
-        container.add_method meth
-      elsif added_container then
-        container.document_self = false
-      end
-
-      # Having now read the method parameters and documentation modifiers, we
-      # now know whether we have to rename #initialize to ::new
-
-      if meth.name == "initialize" && !meth.singleton then
-        if meth.dont_rename_initialize then
-          meth.visibility = :protected
-        else
-          meth.singleton = true
-          meth.name = "new"
-          meth.visibility = :public
-        end
-      end
-
-      parse_statements container, single, meth
-    end
-  end
-
-  ##
-  # Parses a method that needs to be ignored.
-
-  def parse_method_dummy container
-    dummy = RDoc::Context.new
-    dummy.parent = container
-    dummy.store  = container.store
-    skip_method dummy
-  end
-
-  ##
-  # Parses the name of a method in +container+.
-  #
-  # Returns the method name, the container it is in (for def Foo.name) and if
-  # it is a singleton or regular method.
-
-  def parse_method_name container # :nodoc:
-    skip_tkspace
-    name_t = get_tk
-    back_tk = skip_tkspace_without_nl
-    singleton = false
-
-    dot = get_tk
-    if dot[:kind] == :on_period || (dot[:kind] == :on_op && dot[:text] == '::') then
-      singleton = true
-
-      name, container = parse_method_name_singleton container, name_t
-    else
-      unget_tk dot
-      back_tk.reverse_each do |token|
-        unget_tk token
-      end
-
-      name = parse_method_name_regular container, name_t
-    end
-
-    return name, container, singleton
-  end
-
-  ##
-  # For the given +container+ and initial name token +name_t+ the method name
-  # is parsed from the token stream for a regular method.
-
-  def parse_method_name_regular container, name_t # :nodoc:
-    if :on_op == name_t[:kind] && (%w{* & [] []= <<}.include?(name_t[:text])) then
-      name_t[:text]
-    else
-      unless [:on_kw, :on_const, :on_ident].include?(name_t[:kind]) then
-        warn "expected method name token, . or ::, got #{name_t.inspect}"
-        skip_method container
-        return
-      end
-      name_t[:text]
-    end
-  end
-
-  ##
-  # For the given +container+ and initial name token +name_t+ the method name
-  # and the new +container+ (if necessary) are parsed from the token stream
-  # for a singleton method.
-
-  def parse_method_name_singleton container, name_t # :nodoc:
-    skip_tkspace
-    name_t2 = get_tk
-
-    if (:on_kw == name_t[:kind] && 'self' == name_t[:text]) || (:on_op == name_t[:kind] && '%' == name_t[:text]) then
-      # NOTE: work around '[' being consumed early
-      if :on_lbracket == name_t2[:kind]
-        get_tk
-        name = '[]'
-      else
-        name = name_t2[:text]
-      end
-    elsif :on_const == name_t[:kind] then
-      name = name_t2[:text]
-
-      container = get_method_container container, name_t
-
-      return unless container
-
-      name
-    elsif :on_ident == name_t[:kind] || :on_ivar == name_t[:kind] || :on_gvar == name_t[:kind] then
-      parse_method_dummy container
-
-      name = nil
-    elsif (:on_kw == name_t[:kind]) && ('true' == name_t[:text] || 'false' == name_t[:text] || 'nil' == name_t[:text]) then
-      klass_name = "#{name_t[:text].capitalize}Class"
-      container = @store.find_class_named klass_name
-      container ||= @top_level.add_class RDoc::NormalClass, klass_name
-
-      name = name_t2[:text]
-    else
-      warn "unexpected method name token #{name_t.inspect}"
-      # break
-      skip_method container
-
-      name = nil
-    end
-
-    return name, container
-  end
-
-  ##
-  # Extracts +yield+ parameters from +method+
-
-  def parse_method_or_yield_parameters(method = nil,
-                                       modifiers = RDoc::METHOD_MODIFIERS)
-    skip_tkspace_without_nl
-    tk = get_tk
-    end_token = get_end_token tk
-    return '' unless end_token
-
-    nest = 0
-    continue = false
-
-    while tk != nil do
-      case tk[:kind]
-      when :on_semicolon then
-        break if nest == 0
-      when :on_lbracket then
-        nest += 1
-      when :on_rbracket then
-        nest -= 1
-      when :on_lbrace then
-        nest += 1
-      when :on_rbrace then
-        nest -= 1
-        if nest <= 0
-          # we might have a.each { |i| yield i }
-          unget_tk(tk) if nest < 0
-          break
-        end
-      when :on_lparen then
-        nest += 1
-      when end_token[:kind] then
-        if end_token[:kind] == :on_rparen
-          nest -= 1
-          break if nest <= 0
-        else
-          break
-        end
-      when :on_rparen then
-        nest -= 1
-      when :on_comment, :on_embdoc then
-        @read.pop
-        if :on_nl == end_token[:kind] and "\n" == tk[:text][-1] and
-          (!continue or (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) != 0) then
-          if method && method.block_params.nil? then
-            unget_tk tk
-            read_documentation_modifiers method, modifiers
-          end
-          break if !continue and nest <= 0
-        end
-      when :on_comma then
-        continue = true
-      when :on_ident then
-        continue = false if continue
-      end
-      tk = get_tk
-    end
-
-    get_tkread_clean(/\s+/, ' ')
-  end
-
-  ##
-  # Capture the method's parameters. Along the way, look for a comment
-  # containing:
-  #
-  #    # yields: ....
-  #
-  # and add this as the block_params for the method
-
-  def parse_method_parameters method
-    res = parse_method_or_yield_parameters method
-
-    res = "(#{res})" unless res =~ /\A\(/
-    method.params = res unless method.params
-
-    return if  method.block_params
-
-    skip_tkspace_without_nl
-    read_documentation_modifiers method, RDoc::METHOD_MODIFIERS
-  end
-
-  ##
-  # Parses an RDoc::NormalModule in +container+ with +comment+
-
-  def parse_module container, single, tk, comment
-    container, name_t, = get_class_or_module container
-
-    name = name_t[:text]
-
-    mod = container.add_module RDoc::NormalModule, name
-    mod.ignore unless container.document_children
-    record_location mod
-
-    read_documentation_modifiers mod, RDoc::CLASS_MODIFIERS
-    mod.add_comment comment, @top_level
-    parse_statements mod
-
-    # after end modifiers
-    read_documentation_modifiers mod, RDoc::CLASS_MODIFIERS
-
-    @stats.add_module mod
-  end
-
-  ##
-  # Parses an RDoc::Require in +context+ containing +comment+
-
-  def parse_require(context, comment)
-    skip_tkspace_comment
-    tk = get_tk
-
-    if :on_lparen == tk[:kind] then
-      skip_tkspace_comment
-      tk = get_tk
-    end
-
-    name = tk[:text][1..-2] if :on_tstring == tk[:kind]
-
-    if name then
-      @top_level.add_require RDoc::Require.new(name, comment)
-    else
-      unget_tk tk
-    end
-  end
-
-  ##
-  # Parses a rescue
-
-  def parse_rescue
-    skip_tkspace_without_nl
-
-    while tk = get_tk
-      case tk[:kind]
-      when :on_nl, :on_semicolon, :on_comment then
-        break
-      when :on_comma then
-        skip_tkspace_without_nl
-
-        get_tk if :on_nl == peek_tk[:kind]
-      end
-
-      skip_tkspace_without_nl
-    end
-  end
-
-  ##
-  # Retrieve comment body without =begin/=end
-
-  def retrieve_comment_body(tk)
-    if :on_embdoc == tk[:kind]
-      tk[:text].gsub(/\A=begin.*\n/, '').gsub(/=end\n?\z/, '')
-    else
-      tk[:text]
-    end
-  end
-
-  ##
-  # The core of the Ruby parser.
-
-  def parse_statements(container, single = NORMAL, current_method = nil,
-                       comment = new_comment(''))
-    raise 'no' unless RDoc::Comment === comment
-    comment = RDoc::Encoding.change_encoding comment, @encoding if @encoding
-
-    nest = 1
-    save_visibility = container.visibility
-    container.visibility = :public unless current_method
-
-    non_comment_seen = true
-
-    while tk = get_tk do
-      keep_comment = false
-      try_parse_comment = false
-
-      non_comment_seen = true unless (:on_comment == tk[:kind] or :on_embdoc == tk[:kind])
-
-      case tk[:kind]
-      when :on_nl, :on_ignored_nl, :on_comment, :on_embdoc then
-        if :on_nl == tk[:kind] or :on_ignored_nl == tk[:kind]
-          skip_tkspace
-          tk = get_tk
-        else
-          past_tokens = @read.size > 1 ? @read[0..-2] : []
-          nl_position = 0
-          past_tokens.reverse.each_with_index do |read_tk, i|
-            if read_tk =~ /^\n$/ then
-              nl_position = (past_tokens.size - 1) - i
-              break
-            elsif read_tk =~ /^#.*\n$/ then
-              nl_position = ((past_tokens.size - 1) - i) + 1
-              break
-            end
-          end
-          comment_only_line = past_tokens[nl_position..-1].all?{ |c| c =~ /^\s+$/ }
-          unless comment_only_line then
-            tk = get_tk
-          end
-        end
-
-        if tk and (:on_comment == tk[:kind] or :on_embdoc == tk[:kind]) then
-          if non_comment_seen then
-            # Look for RDoc in a comment about to be thrown away
-            non_comment_seen = parse_comment container, tk, comment unless
-              comment.empty?
-
-            comment = ''
-            comment = RDoc::Encoding.change_encoding comment, @encoding if @encoding
-          end
-
-          line_no = nil
-          while tk and (:on_comment == tk[:kind] or :on_embdoc == tk[:kind]) do
-            comment_body = retrieve_comment_body(tk)
-            line_no = tk[:line_no] if comment.empty?
-            comment += comment_body
-            comment << "\n" unless comment_body =~ /\n\z/
-
-            if comment_body.size > 1 && comment_body =~ /\n\z/ then
-              skip_tkspace_without_nl # leading spaces
-            end
-            tk = get_tk
-          end
-
-          comment = new_comment comment, line_no
-
-          unless comment.empty? then
-            look_for_directives_in container, comment
-
-            if container.done_documenting then
-              throw :eof if RDoc::TopLevel === container
-              container.ongoing_visibility = save_visibility
-            end
-          end
-
-          keep_comment = true
-        else
-          non_comment_seen = true
-        end
-
-        unget_tk tk
-        keep_comment = true
-        container.current_line_visibility = nil
-
-      when :on_kw then
-        case tk[:text]
-        when 'class' then
-          parse_class container, single, tk, comment
-
-        when 'module' then
-          parse_module container, single, tk, comment
-
-        when 'def' then
-          parse_method container, single, tk, comment
-
-        when 'alias' then
-          parse_alias container, single, tk, comment unless current_method
-
-        when 'yield' then
-          if current_method.nil? then
-            warn "Warning: yield outside of method" if container.document_self
-          else
-            parse_yield container, single, tk, current_method
-          end
-
-        when 'until', 'while' then
-          if (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) == 0
-            nest += 1
-            skip_optional_do_after_expression
-          end
-
-        # Until and While can have a 'do', which shouldn't increase the nesting.
-        # We can't solve the general case, but we can handle most occurrences by
-        # ignoring a do at the end of a line.
-
-        # 'for' is trickier
-        when 'for' then
-          nest += 1
-          skip_for_variable
-          skip_optional_do_after_expression
-
-        when 'case', 'do', 'if', 'unless', 'begin' then
-          if (tk[:state] & RDoc::Parser::RipperStateLex::EXPR_LABEL) == 0
-            nest += 1
-          end
-
-        when 'super' then
-          current_method.calls_super = true if current_method
-
-        when 'rescue' then
-          parse_rescue
-
-        when 'end' then
-          nest -= 1
-          if nest == 0 then
-            container.ongoing_visibility = save_visibility
-
-            parse_comment container, tk, comment unless comment.empty?
-
-            return
-          end
-        end
-
-      when :on_const then
-        unless parse_constant container, tk, comment, current_method then
-          try_parse_comment = true
-        end
-
-      when :on_ident then
-        if nest == 1 and current_method.nil? then
-          keep_comment = parse_identifier container, single, tk, comment
-        end
-
-        case tk[:text]
-        when "require" then
-          parse_require container, comment
-        when "include" then
-          parse_extend_or_include RDoc::Include, container, comment
-        when "extend" then
-          parse_extend_or_include RDoc::Extend, container, comment
-        when "included" then
-          parse_included_with_activesupport_concern container, comment
-        end
-
-      else
-        try_parse_comment = nest == 1
-      end
-
-      if try_parse_comment then
-        non_comment_seen = parse_comment container, tk, comment unless
-          comment.empty?
-
-        keep_comment = false
-      end
-
-      unless keep_comment then
-        comment = new_comment ''
-        comment = RDoc::Encoding.change_encoding comment, @encoding if @encoding
-        container.params = nil
-        container.block_params = nil
-      end
-
-      consume_trailing_spaces
-    end
-
-    container.params = nil
-    container.block_params = nil
-  end
-
-  ##
-  # Parse up to +no+ symbol arguments
-
-  def parse_symbol_arg(no = nil)
-    skip_tkspace_comment
-
-    tk = get_tk
-    if tk[:kind] == :on_lparen
-      parse_symbol_arg_paren no
-    else
-      parse_symbol_arg_space no, tk
-    end
-  end
-
-  ##
-  # Parses up to +no+ symbol arguments surrounded by () and places them in
-  # +args+.
-
-  def parse_symbol_arg_paren no # :nodoc:
-    args = []
-
-    loop do
-      skip_tkspace_comment
-      if tk1 = parse_symbol_in_arg
-        args.push tk1
-        break if no and args.size >= no
-      end
-
-      skip_tkspace_comment
-      case (tk2 = get_tk)[:kind]
-      when :on_rparen
-        break
-      when :on_comma
-      else
-        warn("unexpected token: '#{tk2.inspect}'") if $DEBUG_RDOC
-        break
-      end
-    end
-
-    args
-  end
-
-  ##
-  # Parses up to +no+ symbol arguments separated by spaces and places them in
-  # +args+.
-
-  def parse_symbol_arg_space no, tk # :nodoc:
-    args = []
-
-    unget_tk tk
-    if tk = parse_symbol_in_arg
-      args.push tk
-      return args if no and args.size >= no
-    end
-
-    loop do
-      skip_tkspace_without_nl
-
-      tk1 = get_tk
-      if tk1.nil? || :on_comma != tk1[:kind] then
-        unget_tk tk1
-        break
-      end
-
-      skip_tkspace_comment
-      if tk = parse_symbol_in_arg
-        args.push tk
-        break if no and args.size >= no
-      end
-    end
-
-    args
-  end
-
-  ##
-  # Returns symbol text from the next token
-
-  def parse_symbol_in_arg
-    tk = get_tk
-    if :on_symbol == tk[:kind] then
-      tk[:text].sub(/^:/, '')
-    elsif :on_tstring == tk[:kind] then
-      tk[:text][1..-2]
-    elsif :on_dstring == tk[:kind] or :on_ident == tk[:kind] then
-      nil # ignore
-    else
-      warn("Expected symbol or string, got #{tk.inspect}") if $DEBUG_RDOC
-      nil
-    end
-  end
-
-  ##
-  # Parses statements in the top-level +container+
-
-  def parse_top_level_statements container
-    comment = collect_first_comment
-
-    look_for_directives_in container, comment
-
-    throw :eof if container.done_documenting
-
-    @markup = comment.format
-
-    # HACK move if to RDoc::Context#comment=
-    container.comment = comment if container.document_self unless comment.empty?
-
-    parse_statements container, NORMAL, nil, comment
-  end
-
-  ##
-  # Determines the visibility in +container+ from +tk+
-
-  def parse_visibility(container, single, tk)
-    vis_type, vis, singleton = get_visibility_information tk, single
-
-    skip_tkspace_comment false
-
-    ptk = peek_tk
-    # Ryan Davis suggested the extension to ignore modifiers, because he
-    # often writes
-    #
-    #   protected unless $TESTING
-    #
-    if [:on_nl, :on_semicolon].include?(ptk[:kind]) || (:on_kw == ptk[:kind] && (['if', 'unless'].include?(ptk[:text]))) then
-      container.ongoing_visibility = vis
-    elsif :on_kw == ptk[:kind] && 'def' == ptk[:text]
-      container.current_line_visibility = vis
-    else
-      update_visibility container, vis_type, vis, singleton
-    end
-  end
-
-  ##
-  # Parses a Module#private_constant or Module#public_constant call from +tk+.
-
-  def parse_constant_visibility(container, single, tk)
-    args = parse_symbol_arg
-    case tk[:text]
-    when 'private_constant'
-      vis = :private
-    when 'public_constant'
-      vis = :public
-    else
-      raise RDoc::Error, 'Unreachable'
-    end
-    container.set_constant_visibility_for args, vis
-  end
-
-  ##
-  # Determines the block parameter for +context+
-
-  def parse_yield(context, single, tk, method)
-    return if method.block_params
-
-    get_tkread
-    method.block_params = parse_method_or_yield_parameters
-  end
-
-  ##
-  # Directives are modifier comments that can appear after class, module, or
-  # method names. For example:
-  #
-  #   def fred # :yields: a, b
-  #
-  # or:
-  #
-  #   class MyClass # :nodoc:
-  #
-  # We return the directive name and any parameters as a two element array if
-  # the name is in +allowed+.  A directive can be found anywhere up to the end
-  # of the current line.
-
-  def read_directive allowed
-    tokens = []
-
-    while tk = get_tk do
-      tokens << tk
-
-      if :on_nl == tk[:kind] or (:on_kw == tk[:kind] && 'def' == tk[:text]) then
-        return
-      elsif :on_comment == tk[:kind] or :on_embdoc == tk[:kind] then
-        return unless tk[:text] =~ /:?\b([\w-]+):\s*(.*)/
-
-        directive = $1.downcase
-
-        return [directive, $2] if allowed.include? directive
-
-        return
-      end
-    end
-  ensure
-    unless tokens.length == 1 and (:on_comment == tokens.first[:kind] or :on_embdoc == tokens.first[:kind]) then
-      tokens.reverse_each do |token|
-        unget_tk token
-      end
-    end
-  end
-
-  ##
-  # Handles directives following the definition for +context+ (any
-  # RDoc::CodeObject) if the directives are +allowed+ at this point.
-  #
-  # See also RDoc::Markup::PreProcess#handle_directive
-
-  def read_documentation_modifiers context, allowed
-    skip_tkspace_without_nl
-    directive, value = read_directive allowed
-
-    return unless directive
-
-    @preprocess.handle_directive '', directive, value, context do |dir, param|
-      if %w[notnew not_new not-new].include? dir then
-        context.dont_rename_initialize = true
-
-        true
-      end
-    end
-  end
-
-  ##
-  # Records the location of this +container+ in the file for this parser and
-  # adds it to the list of classes and modules in the file.
-
-  def record_location container # :nodoc:
-    case container
-    when RDoc::ClassModule then
-      @top_level.add_to_classes_or_modules container
-    end
-
-    container.record_location @top_level
-  end
-
-  ##
-  # Scans this Ruby file for Ruby constructs
-
-  def scan
-    reset
-
-    catch :eof do
-      begin
-        parse_top_level_statements @top_level
-
-      rescue StandardError => e
-        if @content.include?('<%') and @content.include?('%>') then
-          # Maybe, this is ERB.
-          $stderr.puts "\033[2KRDoc detects ERB file. Skips it for compatibility:"
-          $stderr.puts @file_name
-          return
-        end
-
-        if @scanner_point >= @scanner.size
-          now_line_no = @scanner[@scanner.size - 1][:line_no]
-        else
-          now_line_no = peek_tk[:line_no]
-        end
-        first_tk_index = @scanner.find_index { |tk| tk[:line_no] == now_line_no }
-        last_tk_index = @scanner.find_index { |tk| tk[:line_no] == now_line_no + 1 }
-        last_tk_index = last_tk_index ? last_tk_index - 1 : @scanner.size - 1
-        code = @scanner[first_tk_index..last_tk_index].map{ |t| t[:text] }.join
-
-        $stderr.puts <<-EOF
-
-#{self.class} failure around line #{now_line_no} of
-#{@file_name}
-
-        EOF
-
-        unless code.empty? then
-          $stderr.puts code
-          $stderr.puts
-        end
-
-        raise e
-      end
-    end
-
-    @top_level
-  end
-
-  ##
-  # while, until, and for have an optional do
-
-  def skip_optional_do_after_expression
-    skip_tkspace_without_nl
-    tk = get_tk
-
-    b_nest = 0
-    nest = 0
-
-    loop do
-      break unless tk
-      case tk[:kind]
-      when :on_semicolon, :on_nl, :on_ignored_nl then
-        break if b_nest.zero?
-      when :on_lparen then
-        nest += 1
-      when :on_rparen then
-        nest -= 1
-      when :on_kw then
-        case tk[:text]
-        when 'begin'
-          b_nest += 1
-        when 'end'
-          b_nest -= 1
-        when 'do'
-          break if nest.zero?
-        end
-      when :on_comment, :on_embdoc then
-        if b_nest.zero? and "\n" == tk[:text][-1] then
-          break
-        end
-      end
-      tk = get_tk
-    end
-
-    skip_tkspace_without_nl
-
-    get_tk if peek_tk && :on_kw == peek_tk[:kind] && 'do' == peek_tk[:text]
-  end
-
-  ##
-  # skip the var [in] part of a 'for' statement
-
-  def skip_for_variable
-    skip_tkspace_without_nl
-    get_tk
-    skip_tkspace_without_nl
-    tk = get_tk
-    unget_tk(tk) unless :on_kw == tk[:kind] and 'in' == tk[:text]
-  end
-
-  ##
-  # Skips the next method in +container+
-
-  def skip_method container
-    meth = RDoc::AnyMethod.new "", "anon"
-    parse_method_parameters meth
-    parse_statements container, false, meth
-  end
-
-  ##
-  # Skip spaces until a comment is found
-
-  def skip_tkspace_comment(skip_nl = true)
-    loop do
-      skip_nl ? skip_tkspace : skip_tkspace_without_nl
-      next_tk = peek_tk
-      return if next_tk.nil? || (:on_comment != next_tk[:kind] and :on_embdoc != next_tk[:kind])
-      get_tk
-    end
-  end
-
-  ##
-  # Updates visibility in +container+ from +vis_type+ and +vis+.
-
-  def update_visibility container, vis_type, vis, singleton # :nodoc:
-    new_methods = []
-
-    case vis_type
-    when 'module_function' then
-      args = parse_symbol_arg
-      container.set_visibility_for args, :private, false
-
-      container.methods_matching args do |m|
-        s_m = m.dup
-        record_location s_m
-        s_m.singleton = true
-        new_methods << s_m
-      end
-    when 'public_class_method', 'private_class_method' then
-      args = parse_symbol_arg
-
-      container.methods_matching args, true do |m|
-        if m.parent != container then
-          m = m.dup
-          record_location m
-          new_methods << m
-        end
-
-        m.visibility = vis
-      end
-    else
-      args = parse_symbol_arg
-      container.set_visibility_for args, vis, singleton
-    end
-
-    new_methods.each do |method|
-      case method
-      when RDoc::AnyMethod then
-        container.add_method method
-      when RDoc::Attr then
-        container.add_attribute method
-      end
-      method.visibility = vis
-    end
-  end
-
-  ##
-  # Prints +message+ to +$stderr+ unless we're being quiet
-
-  def warn message
-    @options.warn make_message message
-  end
-
-end
diff --git a/lib/rdoc/parser/ruby_tools.rb b/lib/rdoc/parser/ruby_tools.rb
deleted file mode 100644
index 40ea517c4d..0000000000
--- a/lib/rdoc/parser/ruby_tools.rb
+++ /dev/null
@@ -1,165 +0,0 @@
-# frozen_string_literal: true
-##
-# Collection of methods for writing parsers
-
-module RDoc::Parser::RubyTools
-
-  ##
-  # Adds a token listener +obj+, but you should probably use token_listener
-
-  def add_token_listener(obj)
-    @token_listeners ||= []
-    @token_listeners << obj
-  end
-
-  ##
-  # Fetches the next token from the scanner
-
-  def get_tk
-    tk = nil
-
-    if @tokens.empty? then
-      if @scanner_point >= @scanner.size
-        return nil
-      else
-        tk = @scanner[@scanner_point]
-        @scanner_point += 1
-        @read.push tk[:text]
-      end
-    else
-      @read.push @unget_read.shift
-      tk = @tokens.shift
-    end
-
-    if tk == nil || :on___end__ == tk[:kind]
-      tk = nil
-    end
-
-    return nil unless tk
-
-    # inform any listeners of our shiny new token
-    @token_listeners.each do |obj|
-      obj.add_token(tk)
-    end if @token_listeners
-
-    tk
-  end
-
-  ##
-  # Reads and returns all tokens up to one of +tokens+.  Leaves the matched
-  # token in the token list.
-
-  def get_tk_until(*tokens)
-    read = []
-
-    loop do
-      tk = get_tk
-
-      case tk
-      when *tokens then
-        unget_tk tk
-        break
-      end
-
-      read << tk
-    end
-
-    read
-  end
-
-  ##
-  # Retrieves a String representation of the read tokens
-
-  def get_tkread
-    read = @read.join("")
-    @read = []
-    read
-  end
-
-  ##
-  # Peek equivalent for get_tkread
-
-  def peek_read
-    @read.join('')
-  end
-
-  ##
-  # Peek at the next token, but don't remove it from the stream
-
-  def peek_tk
-    unget_tk(tk = get_tk)
-    tk
-  end
-
-  ##
-  # Removes the token listener +obj+
-
-  def remove_token_listener(obj)
-    @token_listeners.delete(obj)
-  end
-
-  ##
-  # Resets the tools
-
-  def reset
-    @read       = []
-    @tokens     = []
-    @unget_read = []
-    @nest = 0
-    @scanner_point = 0
-  end
-
-  ##
-  # Skips whitespace tokens including newlines
-
-  def skip_tkspace
-    tokens = []
-
-    while (tk = get_tk) and (:on_sp == tk[:kind] or :on_nl == tk[:kind] or :on_ignored_nl == tk[:kind]) do
-      tokens.push(tk)
-    end
-
-    unget_tk(tk)
-    tokens
-  end
-
-  ##
-  # Skips whitespace tokens excluding newlines
-
-  def skip_tkspace_without_nl
-    tokens = []
-
-    while (tk = get_tk) and :on_sp == tk[:kind] do
-      tokens.push(tk)
-    end
-
-    unget_tk(tk)
-    tokens
-  end
-
-  ##
-  # Has +obj+ listen to tokens
-
-  def token_listener(obj)
-    add_token_listener obj
-    yield
-  ensure
-    remove_token_listener obj
-  end
-
-  ##
-  # Returns +tk+ to the scanner
-
-  def unget_tk(tk)
-    @tokens.unshift tk
-    @unget_read.unshift @read.pop
-
-    # Remove this token from any listeners
-    @token_listeners.each do |obj|
-      obj.pop_token
-    end if @token_listeners
-
-    nil
-  end
-
-end
diff --git a/lib/rdoc/parser/simple.rb b/lib/rdoc/parser/simple.rb
deleted file mode 100644
index b1dabad0f8..0000000000
--- a/lib/rdoc/parser/simple.rb
+++ /dev/null
@@ -1,61 +0,0 @@
-# frozen_string_literal: true
-##
-# Parse a non-source file. We basically take the whole thing as one big
-# comment.
-
-class RDoc::Parser::Simple < RDoc::Parser
-
-  include RDoc::Parser::Text
-
-  parse_files_matching(//)
-
-  attr_reader :content # :nodoc:
-
-  ##
-  # Prepare to parse a plain file
-
-  def initialize(top_level, file_name, content, options, stats)
-    super
-
-    preprocess = RDoc::Markup::PreProcess.new @file_name, @options.rdoc_include
-
-    @content = preprocess.handle @content, @top_level
-  end
-
-  ##
-  # Extract the file contents and attach them to the TopLevel as a comment
-
-  def scan
-    comment = remove_coding_comment @content
-    comment = remove_private_comment comment
-
-    comment = RDoc::Comment.new comment, @top_level
-
-    @top_level.comment = comment
-    @top_level
-  end
-
-  ##
-  # Removes the encoding magic comment from +text+
-
-  def remove_coding_comment text
-    text.sub(/\A# .*coding[=:].*$/, '')
-  end
-
-  ##
-  # Removes private comments.
-  #
-  # Unlike RDoc::Comment#remove_private this implementation only looks for two
-  # dashes at the beginning of the line.  Three or more dashes are considered
-  # to be a rule and ignored.
-
-  def remove_private_comment comment
-    # Workaround for gsub encoding for Ruby 1.9.2 and earlier
-    empty = ''
-    empty = RDoc::Encoding.change_encoding empty, comment.encoding
-
-    comment = comment.gsub(%r%^--\n.*?^\+\+\n?%m, empty)
-    comment.sub(%r%^--\n.*%m, empty)
-  end
-
-end
diff --git a/lib/rdoc/parser/text.rb b/lib/rdoc/parser/text.rb
deleted file mode 100644
index 5095d8cc64..0000000000
--- a/lib/rdoc/parser/text.rb
+++ /dev/null
@@ -1,11 +0,0 @@
-# frozen_string_literal: true
-##
-# Indicates this parser is text and doesn't contain code constructs.
-#
-# Include this module in a RDoc::Parser subclass to make it show up as a file,
-# not as part of a class or module.
-#--
-# This is not named File to avoid overriding ::File
-
-module RDoc::Parser::Text
-end
diff --git a/lib/rdoc/rd.rb b/lib/rdoc/rd.rb
deleted file mode 100644
index 8c2366a3ca..0000000000
--- a/lib/rdoc/rd.rb
+++ /dev/null
@@ -1,99 +0,0 @@
-# frozen_string_literal: true
-##
-# RDoc::RD implements the RD format from the rdtool gem.
-#
-# To choose RD as your only default format see
-# RDoc::Options@Saved+Options for instructions on setting up a
-# <code>.doc_options</code> file to store your project default.
-#
-# == LICENSE
-#
-# The grammar that produces RDoc::RD::BlockParser and RDoc::RD::InlineParser
-# is included in RDoc under the Ruby License.
-#
-# You can find the original source for rdtool at
-# https://github.com/uwabami/rdtool/
-#
-# You can use, re-distribute or change these files under Ruby's License or GPL.
-#
-# 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 binaries 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 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.
-#
-#    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.
-#
-#    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.
-#
-#    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.
-#
-# 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.
-
-class RDoc::RD
-
-  ##
-  # Parses +rd+ source and returns an RDoc::Markup::Document.  If the
-  # <tt>=begin</tt> or <tt>=end</tt> lines are missing they will be added.
-
-  def self.parse rd
-    rd = rd.lines.to_a
-
-    if rd.find { |i| /\S/ === i } and !rd.find{|i| /^=begin\b/ === i } then
-      rd.unshift("=begin\n").push("=end\n")
-    end
-
-    parser = RDoc::RD::BlockParser.new
-    document = parser.parse rd
-
-    # isn't this always true?
-    document.parts.shift if RDoc::Markup::BlankLine === document.parts.first
-    document.parts.pop   if RDoc::Markup::BlankLine === document.parts.last
-
-    document
-  end
-
-  autoload :BlockParser,  "#{__dir__}/rd/block_parser"
-  autoload :InlineParser, "#{__dir__}/rd/inline_parser"
-  autoload :Inline,       "#{__dir__}/rd/inline"
-
-end
diff --git a/lib/rdoc/rd/block_parser.rb b/lib/rdoc/rd/block_parser.rb
deleted file mode 100644
index 527147d91d..0000000000
--- a/lib/rdoc/rd/block_parser.rb
+++ /dev/null
@@ -1,1710 +0,0 @@
-# frozen_string_literal: true
-#
-# DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.7.3
-# from Racc grammar file "block_parser.ry".
-#
-
-###### racc/parser.rb begin
-unless $".find {|p| p.end_with?('/racc/parser.rb')}
-$".push "#{__dir__}/racc/parser.rb"
-#--
-# Copyright (c) 1999-2006 Minero Aoki
-#
-# This program is free software.
-# You can distribute/modify this program under the same terms of ruby.
-#
-# As a special exception, when this code is copied by Racc
-# into a Racc output file, you may use that output file
-# without restriction.
-#++
-
-unless $".find {|p| p.end_with?('/racc/info.rb')}
-$".push "#{__dir__}/racc/info.rb"
-
-module Racc
-  VERSION   = '1.7.3'
-  Version = VERSION
-  Copyright = 'Copyright (c) 1999-2006 Minero Aoki'
-end
-
-end
-
-
-unless defined?(NotImplementedError)
-  NotImplementedError = NotImplementError # :nodoc:
-end
-
-module Racc
-  class ParseError < StandardError; end
-end
-unless defined?(::ParseError)
-  ParseError = Racc::ParseError # :nodoc:
-end
-
-# Racc is a LALR(1) parser generator.
-# It is written in Ruby itself, and generates Ruby programs.
-#
-# == Command-line Reference
-#
-#     racc [-o<var>filename</var>] [--output-file=<var>filename</var>]
-#          [-e<var>rubypath</var>] [--executable=<var>rubypath</var>]
-#          [-v] [--verbose]
-#          [-O<var>filename</var>] [--log-file=<var>filename</var>]
-#          [-g] [--debug]
-#          [-E] [--embedded]
-#          [-l] [--no-line-convert]
-#          [-c] [--line-convert-all]
-#          [-a] [--no-omit-actions]
-#          [-C] [--check-only]
-#          [-S] [--output-status]
-#          [--version] [--copyright] [--help] <var>grammarfile</var>
-#
-# [+grammarfile+]
-#   Racc grammar file. Any extension is permitted.
-# [-o+outfile+, --output-file=+outfile+]
-#   A filename for output. default is <+filename+>.tab.rb
-# [-O+filename+, --log-file=+filename+]
-#   Place logging output in file +filename+.
-#   Default log file name is <+filename+>.output.
-# [-e+rubypath+, --executable=+rubypath+]
-#   output executable file(mode 755). where +path+ is the Ruby interpreter.
-# [-v, --verbose]
-#   verbose mode. create +filename+.output file, like yacc's y.output file.
-# [-g, --debug]
-#   add debug code to parser class. To display debugging information,
-#   use this '-g' option and set @yydebug true in parser class.
-# [-E, --embedded]
-#   Output parser which doesn't need runtime files (racc/parser.rb).
-# [-F, --frozen]
-#   Output parser which declares frozen_string_literals: true
-# [-C, --check-only]
-#   Check syntax of racc grammar file and quit.
-# [-S, --output-status]
-#   Print messages time to time while compiling.
-# [-l, --no-line-convert]
-#   turns off line number converting.
-# [-c, --line-convert-all]
-#   Convert line number of actions, inner, header and footer.
-# [-a, --no-omit-actions]
-#   Call all actions, even if an action is empty.
-# [--version]
-#   print Racc version and quit.
-# [--copyright]
-#   Print copyright and quit.
-# [--help]
-#   Print usage and quit.
-#
-# == Generating Parser Using Racc
-#
-# To compile Racc grammar file, simply type:
-#
-#   $ racc parse.y
-#
-# This creates Ruby script file "parse.tab.y". The -o option can change the output filename.
-#
-# == Writing A Racc Grammar File
-#
-# If you want your own parser, you have to write a grammar file.
-# A grammar file contains the name of your parser class, grammar for the parser,
-# user code, and anything else.
-# When writing a grammar file, yacc's knowledge is helpful.
-# If you have not used yacc before, Racc is not too difficult.
-#
-# Here's an example Racc grammar file.
-#
-#   class Calcparser
-#   rule
-#     target: exp { print val[0] }
-#
-#     exp: exp '+' exp
-#        | exp '*' exp
-#        | '(' exp ')'
-#        | NUMBER
-#   end
-#
-# Racc grammar files resemble yacc files.
-# But (of course), this is Ruby code.
-# yacc's $$ is the 'result', $0, $1... is
-# an array called 'val', and $-1, $-2... is an array called '_values'.
-#
-# See the {Grammar File Reference}[rdoc-ref:lib/racc/rdoc/grammar.en.rdoc] for
-# more information on grammar files.
-#
-# == Parser
-#
-# Then you must prepare the parse entry method. There are two types of
-# parse methods in Racc, Racc::Parser#do_parse and Racc::Parser#yyparse
-#
-# Racc::Parser#do_parse is simple.
-#
-# It's yyparse() of yacc, and Racc::Parser#next_token is yylex().
-# This method must returns an array like [TOKENSYMBOL, ITS_VALUE].
-# EOF is [false, false].
-# (TOKENSYMBOL is a Ruby symbol (taken from String#intern) by default.
-# If you want to change this, see the grammar reference.
-#
-# Racc::Parser#yyparse is little complicated, but useful.
-# It does not use Racc::Parser#next_token, instead it gets tokens from any iterator.
-#
-# For example, <code>yyparse(obj, :scan)</code> causes
-# calling +obj#scan+, and you can return tokens by yielding them from +obj#scan+.
-#
-# == Debugging
-#
-# When debugging, "-v" or/and the "-g" option is helpful.
-#
-# "-v" creates verbose log file (.output).
-# "-g" creates a "Verbose Parser".
-# Verbose Parser prints the internal status when parsing.
-# But it's _not_ automatic.
-# You must use -g option and set +@yydebug+ to +true+ in order to get output.
-# -g option only creates the verbose parser.
-#
-# === Racc reported syntax error.
-#
-# Isn't there too many "end"?
-# grammar of racc file is changed in v0.10.
-#
-# Racc does not use '%' mark, while yacc uses huge number of '%' marks..
-#
-# === Racc reported "XXXX conflicts".
-#
-# Try "racc -v xxxx.y".
-# It causes producing racc's internal log file, xxxx.output.
-#
-# === Generated parsers does not work correctly
-#
-# Try "racc -g xxxx.y".
-# This command let racc generate "debugging parser".
-# Then set @yydebug=true in your parser.
-# It produces a working log of your parser.
-#
-# == Re-distributing Racc runtime
-#
-# A parser, which is created by Racc, requires the Racc runtime module;
-# racc/parser.rb.
-#
-# Ruby 1.8.x comes with Racc runtime module,
-# you need NOT distribute Racc runtime files.
-#
-# If you want to include the Racc runtime module with your parser.
-# This can be done by using '-E' option:
-#
-#   $ racc -E -omyparser.rb myparser.y
-#
-# This command creates myparser.rb which `includes' Racc runtime.
-# Only you must do is to distribute your parser file (myparser.rb).
-#
-# Note: parser.rb is ruby license, but your parser is not.
-# Your own parser is completely yours.
-module Racc
-
-  unless defined?(Racc_No_Extensions)
-    Racc_No_Extensions = false # :nodoc:
-  end
-
-  class Parser
-
-    Racc_Runtime_Version = ::Racc::VERSION
-    Racc_Runtime_Core_Version_R = ::Racc::VERSION
-
-    begin
-      if Object.const_defined?(:RUBY_ENGINE) and RUBY_ENGINE == 'jruby'
-        require 'jruby'
-        require 'racc/cparse-jruby.jar'
-        com.headius.racc.Cparse.new.load(JRuby.runtime, false)
-      else
-        require 'racc/cparse'
-      end
-
-      unless new.respond_to?(:_racc_do_parse_c, true)
-        raise LoadError, 'old cparse.so'
-      end
-      if Racc_No_Extensions
-        raise LoadError, 'selecting ruby version of racc runtime core'
-      end
-
-      Racc_Main_Parsing_Routine    = :_racc_do_parse_c # :nodoc:
-      Racc_YY_Parse_Method         = :_racc_yyparse_c # :nodoc:
-      Racc_Runtime_Core_Version    = Racc_Runtime_Core_Version_C # :nodoc:
-      Racc_Runtime_Type            = 'c' # :nodoc:
-    rescue LoadError
-      Racc_Main_Parsing_Routine    = :_racc_do_parse_rb
-      Racc_YY_Parse_Method         = :_racc_yyparse_rb
-      Racc_Runtime_Core_Version    = Racc_Runtime_Core_Version_R
-      Racc_Runtime_Type            = 'ruby'
-    end
-
-    def Parser.racc_runtime_type # :nodoc:
-      Racc_Runtime_Type
-    end
-
-    def _racc_setup
-      @yydebug = false unless self.class::Racc_debug_parser
-      @yydebug = false unless defined?(@yydebug)
-      if @yydebug
-        @racc_debug_out = $stderr unless defined?(@racc_debug_out)
-        @racc_debug_out ||= $stderr
-      end
-      arg = self.class::Racc_arg
-      arg[13] = true if arg.size < 14
-      arg
-    end
-
-    def _racc_init_sysvars
-      @racc_state  = [0]
-      @racc_tstack = []
-      @racc_vstack = []
-
-      @racc_t = nil
-      @racc_val = nil
-
-      @racc_read_next = true
-
-      @racc_user_yyerror = false
-      @racc_error_status = 0
-    end
-
-    # The entry point of the parser. This method is used with #next_token.
-    # If Racc wants to get token (and its value), calls next_token.
-    #
-    # Example:
-    #     def parse
-    #       @q = [[1,1],
-    #             [2,2],
-    #             [3,3],
-    #             [false, '$']]
-    #       do_parse
-    #     end
-    #
-    #     def next_token
-    #       @q.shift
-    #     end
-    class_eval <<~RUBY, __FILE__, __LINE__ + 1
-    def do_parse
-      #{Racc_Main_Parsing_Routine}(_racc_setup(), false)
-    end
-    RUBY
-
-    # The method to fetch next token.
-    # If you use #do_parse method, you must implement #next_token.
-    #
-    # The format of return value is [TOKEN_SYMBOL, VALUE].
-    # +token-symbol+ is represented by Ruby's symbol by default, e.g. :IDENT
-    # for 'IDENT'.  ";" (String) for ';'.
-    #
-    # The final symbol (End of file) must be false.
-    def next_token
-      raise NotImplementedError, "#{self.class}\#next_token is not defined"
-    end
-
-    def _racc_do_parse_rb(arg, in_debug)
-      action_table, action_check, action_default, action_pointer,
-      _,            _,            _,              _,
-      _,            _,            token_table,    * = arg
-
-      _racc_init_sysvars
-      tok = act = i = nil
-
-      catch(:racc_end_parse) {
-        while true
-          if i = action_pointer[@racc_state[-1]]
-            if @racc_read_next
-              if @racc_t != 0   # not EOF
-                tok, @racc_val = next_token()
-                unless tok      # EOF
-                  @racc_t = 0
-                else
-                  @racc_t = (token_table[tok] or 1)   # error token
-                end
-                racc_read_token(@racc_t, tok, @racc_val) if @yydebug
-                @racc_read_next = false
-              end
-            end
-            i += @racc_t
-            unless i >= 0 and
-                   act = action_table[i] and
-                   action_check[i] == @racc_state[-1]
-              act = action_default[@racc_state[-1]]
-            end
-          else
-            act = action_default[@racc_state[-1]]
-          end
-          while act = _racc_evalact(act, arg)
-            ;
-          end
-        end
-      }
-    end
-
-    # Another entry point for the parser.
-    # If you use this method, you must implement RECEIVER#METHOD_ID method.
-    #
-    # RECEIVER#METHOD_ID is a method to get next token.
-    # It must 'yield' the token, which format is [TOKEN-SYMBOL, VALUE].
-    class_eval <<~RUBY, __FILE__, __LINE__ + 1
-    def yyparse(recv, mid)
-      #{Racc_YY_Parse_Method}(recv, mid, _racc_setup(), false)
-    end
-    RUBY
-
-    def _racc_yyparse_rb(recv, mid, arg, c_debug)
-      action_table, action_check, action_default, action_pointer,
-      _,            _,            _,              _,
-      _,            _,            token_table,    * = arg
-
-      _racc_init_sysvars
-
-      catch(:racc_end_parse) {
-        until i = action_pointer[@racc_state[-1]]
-          while act = _racc_evalact(action_default[@racc_state[-1]], arg)
-            ;
-          end
-        end
-        recv.__send__(mid) do |tok, val|
-          unless tok
-            @racc_t = 0
-          else
-            @racc_t = (token_table[tok] or 1)   # error token
-          end
-          @racc_val = val
-          @racc_read_next = false
-
-          i += @racc_t
-          unless i >= 0 and
-                 act = action_table[i] and
-                 action_check[i] == @racc_state[-1]
-            act = action_default[@racc_state[-1]]
-          end
-          while act = _racc_evalact(act, arg)
-            ;
-          end
-
-          while !(i = action_pointer[@racc_state[-1]]) ||
-                ! @racc_read_next ||
-                @racc_t == 0  # $
-            unless i and i += @racc_t and
-                   i >= 0 and
-                   act = action_table[i] and
-                   action_check[i] == @racc_state[-1]
-              act = action_default[@racc_state[-1]]
-            end
-            while act = _racc_evalact(act, arg)
-              ;
-            end
-          end
-        end
-      }
-    end
-
-    ###
-    ### common
-    ###
-
-    def _racc_evalact(act, arg)
-      action_table, action_check, _, action_pointer,
-      _,            _,            _, _,
-      _,            _,            _, shift_n,
-      reduce_n,     * = arg
-      nerr = 0   # tmp
-
-      if act > 0 and act < shift_n
-        #
-        # shift
-        #
-        if @racc_error_status > 0
-          @racc_error_status -= 1 unless @racc_t <= 1 # error token or EOF
-        end
-        @racc_vstack.push @racc_val
-        @racc_state.push act
-        @racc_read_next = true
-        if @yydebug
-          @racc_tstack.push @racc_t
-          racc_shift @racc_t, @racc_tstack, @racc_vstack
-        end
-
-      elsif act < 0 and act > -reduce_n
-        #
-        # reduce
-        #
-        code = catch(:racc_jump) {
-          @racc_state.push _racc_do_reduce(arg, act)
-          false
-        }
-        if code
-          case code
-          when 1 # yyerror
-            @racc_user_yyerror = true   # user_yyerror
-            return -reduce_n
-          when 2 # yyaccept
-            return shift_n
-          else
-            raise '[Racc Bug] unknown jump code'
-          end
-        end
-
-      elsif act == shift_n
-        #
-        # accept
-        #
-        racc_accept if @yydebug
-        throw :racc_end_parse, @racc_vstack[0]
-
-      elsif act == -reduce_n
-        #
-        # error
-        #
-        case @racc_error_status
-        when 0
-          unless arg[21]    # user_yyerror
-            nerr += 1
-            on_error @racc_t, @racc_val, @racc_vstack
-          end
-        when 3
-          if @racc_t == 0   # is $
-            # We're at EOF, and another error occurred immediately after
-            # attempting auto-recovery
-            throw :racc_end_parse, nil
-          end
-          @racc_read_next = true
-        end
-        @racc_user_yyerror = false
-        @racc_error_status = 3
-        while true
-          if i = action_pointer[@racc_state[-1]]
-            i += 1   # error token
-            if  i >= 0 and
-                (act = action_table[i]) and
-                action_check[i] == @racc_state[-1]
-              break
-            end
-          end
-          throw :racc_end_parse, nil if @racc_state.size <= 1
-          @racc_state.pop
-          @racc_vstack.pop
-          if @yydebug
-            @racc_tstack.pop
-            racc_e_pop @racc_state, @racc_tstack, @racc_vstack
-          end
-        end
-        return act
-
-      else
-        raise "[Racc Bug] unknown action #{act.inspect}"
-      end
-
-      racc_next_state(@racc_state[-1], @racc_state) if @yydebug
-
-      nil
-    end
-
-    def _racc_do_reduce(arg, act)
-      _,          _,            _,            _,
-      goto_table, goto_check,   goto_default, goto_pointer,
-      nt_base,    reduce_table, _,            _,
-      _,          use_result,   * = arg
-
-      state = @racc_state
-      vstack = @racc_vstack
-      tstack = @racc_tstack
-
-      i = act * -3
-      len       = reduce_table[i]
-      reduce_to = reduce_table[i+1]
-      method_id = reduce_table[i+2]
-      void_array = []
-
-      tmp_t = tstack[-len, len] if @yydebug
-      tmp_v = vstack[-len, len]
-      tstack[-len, len] = void_array if @yydebug
-      vstack[-len, len] = void_array
-      state[-len, len]  = void_array
-
-      # tstack must be updated AFTER method call
-      if use_result
-        vstack.push __send__(method_id, tmp_v, vstack, tmp_v[0])
-      else
-        vstack.push __send__(method_id, tmp_v, vstack)
-      end
-      tstack.push reduce_to
-
-      racc_reduce(tmp_t, reduce_to, tstack, vstack) if @yydebug
-
-      k1 = reduce_to - nt_base
-      if i = goto_pointer[k1]
-        i += state[-1]
-        if i >= 0 and (curstate = goto_table[i]) and goto_check[i] == k1
-          return curstate
-        end
-      end
-      goto_default[k1]
-    end
-
-    # This method is called when a parse error is found.
-    #
-    # ERROR_TOKEN_ID is an internal ID of token which caused error.
-    # You can get string representation of this ID by calling
-    # #token_to_str.
-    #
-    # ERROR_VALUE is a value of error token.
-    #
-    # value_stack is a stack of symbol values.
-    # DO NOT MODIFY this object.
-    #
-    # This method raises ParseError by default.
-    #
-    # If this method returns, parsers enter "error recovering mode".
-    def on_error(t, val, vstack)
-      raise ParseError, sprintf("parse error on value %s (%s)",
-                                val.inspect, token_to_str(t) || '?')
-    end
-
-    # Enter error recovering mode.
-    # This method does not call #on_error.
-    def yyerror
-      throw :racc_jump, 1
-    end
-
-    # Exit parser.
-    # Return value is +Symbol_Value_Stack[0]+.
-    def yyaccept
-      throw :racc_jump, 2
-    end
-
-    # Leave error recovering mode.
-    def yyerrok
-      @racc_error_status = 0
-    end
-
-    # For debugging output
-    def racc_read_token(t, tok, val)
-      @racc_debug_out.print 'read    '
-      @racc_debug_out.print tok.inspect, '(', racc_token2str(t), ') '
-      @racc_debug_out.puts val.inspect
-      @racc_debug_out.puts
-    end
-
-    def racc_shift(tok, tstack, vstack)
-      @racc_debug_out.puts "shift   #{racc_token2str tok}"
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_reduce(toks, sim, tstack, vstack)
-      out = @racc_debug_out
-      out.print 'reduce '
-      if toks.empty?
-        out.print ' <none>'
-      else
-        toks.each {|t| out.print ' ', racc_token2str(t) }
-      end
-      out.puts " --> #{racc_token2str(sim)}"
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_accept
-      @racc_debug_out.puts 'accept'
-      @racc_debug_out.puts
-    end
-
-    def racc_e_pop(state, tstack, vstack)
-      @racc_debug_out.puts 'error recovering mode: pop token'
-      racc_print_states state
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_next_state(curstate, state)
-      @racc_debug_out.puts  "goto    #{curstate}"
-      racc_print_states state
-      @racc_debug_out.puts
-    end
-
-    def racc_print_stacks(t, v)
-      out = @racc_debug_out
-      out.print '        ['
-      t.each_index do |i|
-        out.print ' (', racc_token2str(t[i]), ' ', v[i].inspect, ')'
-      end
-      out.puts ' ]'
-    end
-
-    def racc_print_states(s)
-      out = @racc_debug_out
-      out.print '        ['
-      s.each {|st| out.print ' ', st }
-      out.puts ' ]'
-    end
-
-    def racc_token2str(tok)
-      self.class::Racc_token_to_s_table[tok] or
-          raise "[Racc Bug] can't convert token #{tok} to string"
-    end
-
-    # Convert internal ID of token symbol to the string.
-    def token_to_str(t)
-      self.class::Racc_token_to_s_table[t]
-    end
-
-  end
-
-end
-
-end
-###### racc/parser.rb end
-
-class RDoc::RD
-
-##
-# RD format parser for headings, paragraphs, lists, verbatim sections that
-# exist as blocks.
-
-class BlockParser < Racc::Parser
-
-
-# :stopdoc:
-
-MARK_TO_LEVEL = {
-  '='    => 1,
-  '=='   => 2,
-  '==='  => 3,
-  '====' => 4,
-  '+'    => 5,
-  '++'   => 6,
-}
-
-# :startdoc:
-
-##
-# Footnotes for this document
-
-attr_reader :footnotes
-
-##
-# Labels for items in this document
-
-attr_reader :labels
-
-##
-# Path to find included files in
-
-attr_accessor :include_path
-
-##
-# Creates a new RDoc::RD::BlockParser.  Use #parse to parse an rd-format
-# document.
-
-def initialize
-  @inline_parser = RDoc::RD::InlineParser.new self
-  @include_path = []
-
-  # for testing
-  @footnotes = []
-  @labels    = {}
-end
-
-##
-# Parses +src+ and returns an RDoc::Markup::Document.
-
-def parse src
-  @src = src
-  @src.push false
-
-  @footnotes = []
-  @labels    = {}
-
-  # @i: index(line no.) of src
-  @i = 0
-
-  # stack for current indentation
-  @indent_stack = []
-
-  # how indented.
-  @current_indent = @indent_stack.join("")
-
-  # RDoc::RD::BlockParser for tmp src
-  @subparser = nil
-
-  # which part is in now
-  @in_part = nil
-  @part_content = []
-
-  @in_verbatim = false
-
-  @yydebug = true
-
-  document = do_parse
-
-  unless @footnotes.empty? then
-    blankline = document.parts.pop
-
-    document.parts << RDoc::Markup::Rule.new(1)
-    document.parts.concat @footnotes
-
-    document.parts.push blankline
-  end
-
-  document
-end
-
-##
-# Returns the next token from the document
-
-def next_token # :nodoc:
-  # preprocessing
-  # if it is not in RD part
-  # => method
-  while @in_part != "rd"
-    line = @src[@i]
-    @i += 1 # next line
-
-    case line
-    # src end
-    when false
-      return [false, false]
-    # RD part begin
-    when /^=begin\s*(?:\bRD\b.*)?\s*$/
-      if @in_part # if in non-RD part
-        @part_content.push(line)
-      else
-        @in_part = "rd"
-        return [:WHITELINE, "=begin\n"] # <= for textblockand
-      end
-    # non-RD part begin
-    when /^=begin\s+(\w+)/
-      part = $1
-=begin # not imported to RDoc
-      if @in_part # if in non-RD part
-        @part_content.push(line)
-      else
-        @in_part = part if @tree.filter[part] # if filter exists
-#  p "BEGIN_PART: #{@in_part}" # DEBUG
-      end
-=end
-      @in_part = part
-    # non-RD part end
-    when /^=end(?:$|[\s\0\C-d\C-z])/
-      if @in_part # if in non-RD part
-=begin # not imported to RDoc
-#  p "END_PART: #{@in_part}" # DEBUG
-        # make Part-in object
-        part = RDoc::RD::Part.new(@part_content.join(""), @tree, "r")
-        @part_content.clear
-        # call filter, part_out is output(Part object)
-        part_out = @tree.filter[@in_part].call(part)
-
-        if @tree.filter[@in_part].mode == :rd # if output is RD formatted
-          subtree = parse_subtree(part_out.to_a)
-        else # if output is target formatted
-          basename = Tempfile.create(["rdtmp", ".#{@in_part}"], @tree.tmp_dir) do |tmpfile|
-            tmpfile.print(part_out)
-            File.basename(tmpfile.path)
-          end
-          subtree = parse_subtree(["=begin\n", "<<< #{basename}\n", "=end\n"])
-        end
-        @in_part = nil
-        return [:SUBTREE, subtree]
-=end
-      end
-    else
-=begin # not imported to RDoc
-      if @in_part # if in non-RD part
-        @part_content.push(line)
-      end
-=end
-    end
-  end
-
-  @current_indent = @indent_stack.join("")
-  line = @src[@i]
-  case line
-  when false
-    if_current_indent_equal("") do
-      [false, false]
-    end
-  when /^=end/
-    if_current_indent_equal("") do
-      @in_part = nil
-      [:WHITELINE, "=end"] # MUST CHANGE??
-    end
-  when /^\s*$/
-    @i += 1 # next line
-    return [:WHITELINE, ':WHITELINE']
-  when /^\#/  # comment line
-    @i += 1 # next line
-    self.next_token()
-  when /^(={1,4})(?!=)\s*(?=\S)/, /^(\+{1,2})(?!\+)\s*(?=\S)/
-    rest = $'                    # '
-    rest.strip!
-    mark = $1
-    if_current_indent_equal("") do
-      return [:HEADLINE, [MARK_TO_LEVEL[mark], rest]]
-    end
-  when /^<<<\s*(\S+)/
-    file = $1
-    if_current_indent_equal("") do
-      suffix = file[-3 .. -1]
-      if suffix == ".rd" or suffix == ".rb"
-        subtree = parse_subtree(get_included(file))
-        [:SUBTREE, subtree]
-      else
-        [:INCLUDE, file]
-      end
-    end
-  when /^(\s*)\*(\s*)/
-    rest = $'                   # '
-    newIndent = $2
-    if_current_indent_equal($1) do
-      if @in_verbatim
-        [:STRINGLINE, line]
-      else
-        @indent_stack.push("\s" + newIndent)
-        [:ITEMLISTLINE, rest]
-      end
-    end
-  when /^(\s*)(\(\d+\))(\s*)/
-    rest = $'                     # '
-    mark = $2
-    newIndent = $3
-    if_current_indent_equal($1) do
-      if @in_verbatim
-        [:STRINGLINE, line]
-      else
-        @indent_stack.push("\s" * mark.size + newIndent)
-        [:ENUMLISTLINE, rest]
-      end
-    end
-  when /^(\s*):(\s*)/
-    rest = $'                    # '
-    newIndent = $2
-    if_current_indent_equal($1) do
-      if @in_verbatim
-        [:STRINGLINE, line]
-      else
-        @indent_stack.push("\s#{$2}")
-        [:DESCLISTLINE, rest]
-      end
-    end
-  when /^(\s*)---(?!-|\s*$)/
-    indent = $1
-    rest = $'
-    /\s*/ === rest
-    term = $'
-    new_indent = $&
-    if_current_indent_equal(indent) do
-      if @in_verbatim
-        [:STRINGLINE, line]
-      else
-        @indent_stack.push("\s\s\s" + new_indent)
-        [:METHODLISTLINE, term]
-      end
-    end
-  when /^(\s*)/
-    if_current_indent_equal($1) do
-      [:STRINGLINE, line]
-    end
-  else
-    raise "[BUG] parsing error may occurred."
-  end
-end
-
-##
-# Yields to the given block if +indent+ matches the current indent, otherwise
-# an indentation token is processed.
-
-def if_current_indent_equal(indent)
-  indent = indent.sub(/\t/, "\s" * 8)
-  if @current_indent == indent
-    @i += 1 # next line
-    yield
-  elsif indent.index(@current_indent) == 0
-    @indent_stack.push(indent[@current_indent.size .. -1])
-    [:INDENT, ":INDENT"]
-  else
-    @indent_stack.pop
-    [:DEDENT, ":DEDENT"]
-  end
-end
-private :if_current_indent_equal
-
-##
-# Cuts off excess whitespace in +src+
-
-def cut_off(src)
-  ret = []
-  whiteline_buf = []
-
-  line = src.shift
-  /^\s*/ =~ line
-
-  indent = Regexp.quote($&)
-  ret.push($')
-
-  while line = src.shift
-    if /^(\s*)$/ =~ line
-      whiteline_buf.push(line)
-    elsif /^#{indent}/ =~ line
-      unless whiteline_buf.empty?
-        ret.concat(whiteline_buf)
-        whiteline_buf.clear
-      end
-      ret.push($')
-    else
-      raise "[BUG]: probably Parser Error while cutting off.\n"
-    end
-  end
-  ret
-end
-private :cut_off
-
-def set_term_to_element(parent, term)
-#  parent.set_term_under_document_struct(term, @tree.document_struct)
-  parent.set_term_without_document_struct(term)
-end
-private :set_term_to_element
-
-##
-# Raises a ParseError when invalid formatting is found
-
-def on_error(et, ev, _values)
-  prv, cur, nxt = format_line_num(@i, @i+1, @i+2)
-
-  raise ParseError, <<Msg
-
-RD syntax error: line #{@i+1}:
-  #{prv}  |#{@src[@i-1].chomp}
-  #{cur}=>|#{@src[@i].chomp}
-  #{nxt}  |#{@src[@i+1].chomp}
-
-Msg
-end
-
-##
-# Current line number
-
-def line_index
-  @i
-end
-
-##
-# Parses subtree +src+
-
-def parse_subtree src
-  @subparser ||= RDoc::RD::BlockParser.new
-
-  @subparser.parse src
-end
-private :parse_subtree
-
-##
-# Retrieves the content for +file+ from the include_path
-
-def get_included(file)
-  included = []
-
-  @include_path.each do |dir|
-    file_name = File.join dir, file
-
-    if File.exist? file_name then
-      included = File.readlines file_name
-      break
-    end
-  end
-
-  included
-end
-private :get_included
-
-##
-# Formats line numbers +line_numbers+ prettily
-
-def format_line_num(*line_numbers)
-  width = line_numbers.collect{|i| i.to_s.length }.max
-  line_numbers.collect{|i| sprintf("%#{width}d", i) }
-end
-private :format_line_num
-
-##
-# Retrieves the content of +values+ as a single String
-
-def content values
- values.map { |value| value.content }.join
-end
-
-##
-# Creates a paragraph for +value+
-
-def paragraph value
-  content = cut_off(value).join(' ').rstrip
-  contents = @inline_parser.parse content
-
-  RDoc::Markup::Paragraph.new(*contents)
-end
-
-##
-# Adds footnote +content+ to the document
-
-def add_footnote content
-  index = @footnotes.length / 2 + 1
-
-  footmark_link = "{^#{index}}[rdoc-label:footmark-#{index}:foottext-#{index}]"
-
-  @footnotes << RDoc::Markup::Paragraph.new(footmark_link, ' ', *content)
-  @footnotes << RDoc::Markup::BlankLine.new
-
-  index
-end
-
-##
-# Adds label +label+ to the document
-
-def add_label label
-  @labels[label] = true
-
-  label
-end
-
-# :stopdoc:
-
-##### State transition tables begin ###
-
-racc_action_table = [
-    34,    35,    30,    33,    40,    34,    35,    30,    33,    40,
-    65,    34,    35,    30,    33,    14,    73,    36,    38,    34,
-    15,    88,    34,    35,    30,    33,    14,     9,    10,    11,
-    12,    15,    34,    35,    30,    33,    14,     9,    10,    11,
-    12,    15,    34,    35,    30,    33,    35,    47,    30,    54,
-    33,    15,    34,    35,    30,    33,    54,    47,    14,    14,
-    59,    15,    34,    35,    30,    33,    14,    73,    67,    76,
-    77,    15,    34,    35,    30,    33,    14,    73,    54,    81,
-    38,    15,    34,    35,    30,    33,    14,    73,    38,    40,
-    83,    15,    34,    35,    30,    33,    14,    73,   nil,   nil,
-   nil,    15,    34,    35,    30,    33,    14,    73,   nil,   nil,
-   nil,    15,    34,    35,    30,    33,    14,    73,   nil,   nil,
-   nil,    15,    34,    35,    30,    33,    14,    73,   nil,   nil,
-   nil,    15,    34,    35,    30,    33,    14,    73,   nil,   nil,
-   nil,    15,    34,    35,    30,    33,    14,    73,    61,    63,
-   nil,    15,    14,    62,    60,    61,    63,    79,    61,    63,
-    62,    87,   nil,    62,    34,    35,    30,    33 ]
-
-racc_action_check = [
-    41,    41,    41,    41,    41,    15,    15,    15,    15,    15,
-    41,    86,    86,    86,    86,    86,    86,     1,    13,    22,
-    86,    86,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,    24,    24,    24,    24,    25,    24,    28,    30,
-    31,    24,    27,    27,    27,    27,    33,    27,    34,    35,
-    36,    27,    45,    45,    45,    45,    45,    45,    44,    49,
-    51,    45,    46,    46,    46,    46,    46,    46,    54,    56,
-    57,    46,    47,    47,    47,    47,    47,    47,    58,    62,
-    66,    47,    68,    68,    68,    68,    68,    68,   nil,   nil,
-   nil,    68,    74,    74,    74,    74,    74,    74,   nil,   nil,
-   nil,    74,    75,    75,    75,    75,    75,    75,   nil,   nil,
-   nil,    75,    78,    78,    78,    78,    78,    78,   nil,   nil,
-   nil,    78,    79,    79,    79,    79,    79,    79,   nil,   nil,
-   nil,    79,    85,    85,    85,    85,    85,    85,    39,    39,
-   nil,    85,    52,    39,    39,    82,    82,    52,    64,    64,
-    82,    82,   nil,    64,    20,    20,    20,    20 ]
-
-racc_action_pointer = [
-    19,    17,    29,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,    11,   nil,     2,   nil,   nil,   nil,   nil,
-   161,   nil,    16,   nil,    39,    42,   nil,    49,    43,   nil,
-    41,    44,   nil,    48,    51,    52,    60,   nil,   nil,   141,
-   nil,    -3,   nil,   nil,    55,    59,    69,    79,   nil,    56,
-   nil,    57,   145,   nil,    70,   nil,    66,    73,    81,   nil,
-   nil,   nil,    82,   nil,   151,   nil,    77,   nil,    89,   nil,
-   nil,   nil,   nil,   nil,    99,   109,   nil,   nil,   119,   129,
-   nil,   nil,   148,   nil,   nil,   139,     8,   nil,   nil ]
-
-racc_action_default = [
-    -2,   -73,    -1,    -4,    -5,    -6,    -7,    -8,    -9,   -10,
-   -11,   -12,   -13,   -14,   -16,   -73,   -23,   -24,   -25,   -26,
-   -27,   -31,   -32,   -34,   -72,   -36,   -38,   -72,   -40,   -42,
-   -59,   -44,   -46,   -59,   -63,   -65,   -73,    -3,   -15,   -73,
-   -22,   -73,   -30,   -33,   -73,   -69,   -70,   -71,   -37,   -73,
-   -41,   -73,   -51,   -58,   -61,   -45,   -73,   -62,   -64,    89,
-   -17,   -19,   -73,   -21,   -18,   -28,   -73,   -35,   -66,   -53,
-   -54,   -55,   -56,   -57,   -67,   -68,   -39,   -43,   -49,   -73,
-   -60,   -47,   -73,   -29,   -52,   -48,   -73,   -20,   -50 ]
-
-racc_goto_table = [
-     4,    39,     4,    68,    74,    75,     5,     6,     5,     6,
-    44,    42,    51,    49,     3,    56,    37,    57,    58,     1,
-     2,    66,    84,    41,    43,    48,    50,    64,    84,    84,
-    45,    46,    42,    45,    46,    55,    85,    86,    80,    84,
-    84,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    82,   nil,
-   nil,   nil,    78 ]
-
-racc_goto_check = [
-     4,    10,     4,    31,    31,    31,     5,     6,     5,     6,
-    21,    12,    27,    21,     3,    27,     3,     9,     9,     1,
-     2,    11,    32,    17,    19,    23,    26,    10,    32,    32,
-     5,     6,    12,     5,     6,    29,    31,    31,    33,    32,
-    32,   nil,   nil,   nil,   nil,   nil,   nil,   nil,    10,   nil,
-   nil,   nil,     4 ]
-
-racc_goto_pointer = [
-   nil,    19,    20,    14,     0,     6,     7,   nil,   nil,   -17,
-   -14,   -20,    -9,   nil,   nil,   nil,   nil,     8,   nil,     2,
-   nil,   -14,   nil,     0,   nil,   nil,    -2,   -18,   nil,     4,
-   nil,   -42,   -46,   -16 ]
-
-racc_goto_default = [
-   nil,   nil,   nil,   nil,    70,    71,    72,     7,     8,    13,
-   nil,   nil,    21,    16,    17,    18,    19,    20,    22,    23,
-    24,   nil,    25,    26,    27,    28,    29,   nil,    31,    32,
-    52,   nil,    69,    53 ]
-
-racc_reduce_table = [
-  0, 0, :racc_error,
-  1, 15, :_reduce_1,
-  0, 15, :_reduce_2,
-  2, 16, :_reduce_3,
-  1, 16, :_reduce_4,
-  1, 17, :_reduce_5,
-  1, 17, :_reduce_6,
-  1, 17, :_reduce_none,
-  1, 17, :_reduce_8,
-  1, 17, :_reduce_9,
-  1, 17, :_reduce_10,
-  1, 17, :_reduce_11,
-  1, 21, :_reduce_12,
-  1, 22, :_reduce_13,
-  1, 18, :_reduce_14,
-  2, 23, :_reduce_15,
-  1, 23, :_reduce_16,
-  3, 19, :_reduce_17,
-  1, 25, :_reduce_18,
-  2, 24, :_reduce_19,
-  4, 24, :_reduce_20,
-  2, 24, :_reduce_21,
-  1, 24, :_reduce_22,
-  1, 26, :_reduce_none,
-  1, 26, :_reduce_none,
-  1, 26, :_reduce_none,
-  1, 26, :_reduce_none,
-  1, 20, :_reduce_27,
-  3, 20, :_reduce_28,
-  4, 20, :_reduce_29,
-  2, 31, :_reduce_30,
-  1, 31, :_reduce_31,
-  1, 27, :_reduce_32,
-  2, 32, :_reduce_33,
-  1, 32, :_reduce_34,
-  3, 33, :_reduce_35,
-  1, 28, :_reduce_36,
-  2, 36, :_reduce_37,
-  1, 36, :_reduce_38,
-  3, 37, :_reduce_39,
-  1, 29, :_reduce_40,
-  2, 39, :_reduce_41,
-  1, 39, :_reduce_42,
-  3, 40, :_reduce_43,
-  1, 30, :_reduce_44,
-  2, 42, :_reduce_45,
-  1, 42, :_reduce_46,
-  3, 43, :_reduce_47,
-  3, 41, :_reduce_48,
-  2, 41, :_reduce_49,
-  4, 41, :_reduce_50,
-  1, 41, :_reduce_51,
-  2, 45, :_reduce_52,
-  1, 45, :_reduce_none,
-  1, 46, :_reduce_54,
-  1, 46, :_reduce_55,
-  1, 46, :_reduce_none,
-  1, 46, :_reduce_57,
-  1, 44, :_reduce_none,
-  0, 44, :_reduce_none,
-  2, 47, :_reduce_none,
-  1, 47, :_reduce_none,
-  2, 34, :_reduce_62,
-  1, 34, :_reduce_63,
-  2, 38, :_reduce_64,
-  1, 38, :_reduce_65,
-  2, 35, :_reduce_66,
-  2, 35, :_reduce_67,
-  2, 35, :_reduce_68,
-  1, 35, :_reduce_69,
-  1, 35, :_reduce_none,
-  1, 35, :_reduce_71,
-  0, 35, :_reduce_72 ]
-
-racc_reduce_n = 73
-
-racc_shift_n = 89
-
-racc_token_table = {
-  false => 0,
-  :error => 1,
-  :DUMMY => 2,
-  :ITEMLISTLINE => 3,
-  :ENUMLISTLINE => 4,
-  :DESCLISTLINE => 5,
-  :METHODLISTLINE => 6,
-  :STRINGLINE => 7,
-  :WHITELINE => 8,
-  :SUBTREE => 9,
-  :HEADLINE => 10,
-  :INCLUDE => 11,
-  :INDENT => 12,
-  :DEDENT => 13 }
-
-racc_nt_base = 14
-
-racc_use_result_var = true
-
-Racc_arg = [
-  racc_action_table,
-  racc_action_check,
-  racc_action_default,
-  racc_action_pointer,
-  racc_goto_table,
-  racc_goto_check,
-  racc_goto_default,
-  racc_goto_pointer,
-  racc_nt_base,
-  racc_reduce_table,
-  racc_token_table,
-  racc_shift_n,
-  racc_reduce_n,
-  racc_use_result_var ]
-Ractor.make_shareable(Racc_arg) if defined?(Ractor)
-
-Racc_token_to_s_table = [
-  "$end",
-  "error",
-  "DUMMY",
-  "ITEMLISTLINE",
-  "ENUMLISTLINE",
-  "DESCLISTLINE",
-  "METHODLISTLINE",
-  "STRINGLINE",
-  "WHITELINE",
-  "SUBTREE",
-  "HEADLINE",
-  "INCLUDE",
-  "INDENT",
-  "DEDENT",
-  "$start",
-  "document",
-  "blocks",
-  "block",
-  "textblock",
-  "verbatim",
-  "lists",
-  "headline",
-  "include",
-  "textblockcontent",
-  "verbatimcontent",
-  "verbatim_after_lists",
-  "list",
-  "itemlist",
-  "enumlist",
-  "desclist",
-  "methodlist",
-  "lists2",
-  "itemlistitems",
-  "itemlistitem",
-  "first_textblock_in_itemlist",
-  "other_blocks_in_list",
-  "enumlistitems",
-  "enumlistitem",
-  "first_textblock_in_enumlist",
-  "desclistitems",
-  "desclistitem",
-  "description_part",
-  "methodlistitems",
-  "methodlistitem",
-  "whitelines",
-  "blocks_in_list",
-  "block_in_list",
-  "whitelines2" ]
-Ractor.make_shareable(Racc_token_to_s_table) if defined?(Ractor)
-
-Racc_debug_parser = false
-
-##### State transition tables end #####
-
-# reduce 0 omitted
-
-def _reduce_1(val, _values, result)
- result = RDoc::Markup::Document.new(*val[0])
-    result
-end
-
-def _reduce_2(val, _values, result)
- raise ParseError, "file empty"
-    result
-end
-
-def _reduce_3(val, _values, result)
- result = val[0].concat val[1]
-    result
-end
-
-def _reduce_4(val, _values, result)
- result = val[0]
-    result
-end
-
-def _reduce_5(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_6(val, _values, result)
- result = val
-    result
-end
-
-# reduce 7 omitted
-
-def _reduce_8(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_9(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_10(val, _values, result)
- result = [RDoc::Markup::BlankLine.new]
-    result
-end
-
-def _reduce_11(val, _values, result)
- result = val[0].parts
-    result
-end
-
-def _reduce_12(val, _values, result)
-      # val[0] is like [level, title]
-      title = @inline_parser.parse(val[0][1])
-      result = RDoc::Markup::Heading.new(val[0][0], title)
-
-    result
-end
-
-def _reduce_13(val, _values, result)
-      result = RDoc::Markup::Include.new val[0], @include_path
-
-    result
-end
-
-def _reduce_14(val, _values, result)
-      # val[0] is Array of String
-      result = paragraph val[0]
-
-    result
-end
-
-def _reduce_15(val, _values, result)
- result << val[1].rstrip
-    result
-end
-
-def _reduce_16(val, _values, result)
- result = [val[0].rstrip]
-    result
-end
-
-def _reduce_17(val, _values, result)
-      # val[1] is Array of String
-      content = cut_off val[1]
-      result = RDoc::Markup::Verbatim.new(*content)
-
-      # imform to lexer.
-      @in_verbatim = false
-
-    result
-end
-
-def _reduce_18(val, _values, result)
-      # val[0] is Array of String
-      content = cut_off val[0]
-      result = RDoc::Markup::Verbatim.new(*content)
-
-      # imform to lexer.
-      @in_verbatim = false
-
-    result
-end
-
-def _reduce_19(val, _values, result)
-      result << val[1]
-
-    result
-end
-
-def _reduce_20(val, _values, result)
-      result.concat val[2]
-
-    result
-end
-
-def _reduce_21(val, _values, result)
-      result << "\n"
-
-    result
-end
-
-def _reduce_22(val, _values, result)
-      result = val
-      # inform to lexer.
-      @in_verbatim = true
-
-    result
-end
-
-# reduce 23 omitted
-
-# reduce 24 omitted
-
-# reduce 25 omitted
-
-# reduce 26 omitted
-
-def _reduce_27(val, _values, result)
-      result = val[0]
-
-    result
-end
-
-def _reduce_28(val, _values, result)
-      result = val[1]
-
-    result
-end
-
-def _reduce_29(val, _values, result)
-      result = val[1].push(val[2])
-
-    result
-end
-
-def _reduce_30(val, _values, result)
- result = val[0] << val[1]
-    result
-end
-
-def _reduce_31(val, _values, result)
- result = [val[0]]
-    result
-end
-
-def _reduce_32(val, _values, result)
-      result = RDoc::Markup::List.new :BULLET, *val[0]
-
-    result
-end
-
-def _reduce_33(val, _values, result)
- result.push(val[1])
-    result
-end
-
-def _reduce_34(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_35(val, _values, result)
-      result = RDoc::Markup::ListItem.new nil, val[0], *val[1]
-
-    result
-end
-
-def _reduce_36(val, _values, result)
-      result = RDoc::Markup::List.new :NUMBER, *val[0]
-
-    result
-end
-
-def _reduce_37(val, _values, result)
- result.push(val[1])
-    result
-end
-
-def _reduce_38(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_39(val, _values, result)
-      result = RDoc::Markup::ListItem.new nil, val[0], *val[1]
-
-    result
-end
-
-def _reduce_40(val, _values, result)
-      result = RDoc::Markup::List.new :NOTE, *val[0]
-
-    result
-end
-
-def _reduce_41(val, _values, result)
- result.push(val[1])
-    result
-end
-
-def _reduce_42(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_43(val, _values, result)
-      term = @inline_parser.parse val[0].strip
-
-      result = RDoc::Markup::ListItem.new term, *val[1]
-
-    result
-end
-
-def _reduce_44(val, _values, result)
-      result = RDoc::Markup::List.new :LABEL, *val[0]
-
-    result
-end
-
-def _reduce_45(val, _values, result)
- result.push(val[1])
-    result
-end
-
-def _reduce_46(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_47(val, _values, result)
-      result = RDoc::Markup::ListItem.new "<tt>#{val[0].strip}</tt>", *val[1]
-
-    result
-end
-
-def _reduce_48(val, _values, result)
-      result = [val[1]].concat(val[2])
-
-    result
-end
-
-def _reduce_49(val, _values, result)
-      result = [val[1]]
-
-    result
-end
-
-def _reduce_50(val, _values, result)
-      result = val[2]
-
-    result
-end
-
-def _reduce_51(val, _values, result)
-      result = []
-
-    result
-end
-
-def _reduce_52(val, _values, result)
- result.concat val[1]
-    result
-end
-
-# reduce 53 omitted
-
-def _reduce_54(val, _values, result)
- result = val
-    result
-end
-
-def _reduce_55(val, _values, result)
- result = val
-    result
-end
-
-# reduce 56 omitted
-
-def _reduce_57(val, _values, result)
- result = []
-    result
-end
-
-# reduce 58 omitted
-
-# reduce 59 omitted
-
-# reduce 60 omitted
-
-# reduce 61 omitted
-
-def _reduce_62(val, _values, result)
-      result = paragraph [val[0]].concat(val[1])
-
-    result
-end
-
-def _reduce_63(val, _values, result)
-      result = paragraph [val[0]]
-
-    result
-end
-
-def _reduce_64(val, _values, result)
-      result = paragraph [val[0]].concat(val[1])
-
-    result
-end
-
-def _reduce_65(val, _values, result)
-      result = paragraph [val[0]]
-
-    result
-end
-
-def _reduce_66(val, _values, result)
-      result = [val[0]].concat(val[1])
-
-    result
-end
-
-def _reduce_67(val, _values, result)
- result.concat val[1]
-    result
-end
-
-def _reduce_68(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_69(val, _values, result)
- result = val
-    result
-end
-
-# reduce 70 omitted
-
-def _reduce_71(val, _values, result)
- result = []
-    result
-end
-
-def _reduce_72(val, _values, result)
- result = []
-    result
-end
-
-def _reduce_none(val, _values, result)
-  val[0]
-end
-
-end   # class BlockParser
-
-end
diff --git a/lib/rdoc/rd/inline.rb b/lib/rdoc/rd/inline.rb
deleted file mode 100644
index 77d88b2860..0000000000
--- a/lib/rdoc/rd/inline.rb
+++ /dev/null
@@ -1,71 +0,0 @@
-# frozen_string_literal: true
-##
-# Inline keeps track of markup and labels to create proper links.
-
-class RDoc::RD::Inline
-
-  ##
-  # The text of the reference
-
-  attr_reader :reference
-
-  ##
-  # The markup of this reference in RDoc format
-
-  attr_reader :rdoc
-
-  ##
-  # Creates a new Inline for +rdoc+ and +reference+.
-  #
-  # +rdoc+ may be another Inline or a String.  If +reference+ is not given it
-  # will use the text from +rdoc+.
-
-  def self.new rdoc, reference = rdoc
-    if self === rdoc and reference.equal? rdoc then
-      rdoc
-    else
-      super
-    end
-  end
-
-  ##
-  # Initializes the Inline with +rdoc+ and +inline+
-
-  def initialize rdoc, reference # :not-new:
-    @reference = reference.equal?(rdoc) ? reference.dup : reference
-
-    # unpack
-    @reference = @reference.reference if self.class === @reference
-    @rdoc      = rdoc
-  end
-
-  def == other # :nodoc:
-    self.class === other and
-      @reference == other.reference and @rdoc == other.rdoc
-  end
-
-  ##
-  # Appends +more+ to this inline.  +more+ may be a String or another Inline.
-
-  def append more
-    case more
-    when String then
-      @reference += more
-      @rdoc      += more
-    when RDoc::RD::Inline then
-      @reference += more.reference
-      @rdoc      += more.rdoc
-    else
-      raise "unknown thingy #{more}"
-    end
-
-    self
-  end
-
-  def inspect # :nodoc:
-    "(inline: #{self})"
-  end
-
-  alias to_s rdoc # :nodoc:
-
-end
diff --git a/lib/rdoc/rd/inline_parser.rb b/lib/rdoc/rd/inline_parser.rb
deleted file mode 100644
index adacf64d5b..0000000000
--- a/lib/rdoc/rd/inline_parser.rb
+++ /dev/null
@@ -1,1858 +0,0 @@
-# frozen_string_literal: true
-#
-# DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.7.3
-# from Racc grammar file "inline_parser.ry".
-#
-
-###### racc/parser.rb begin
-unless $".find {|p| p.end_with?('/racc/parser.rb')}
-$".push "#{__dir__}/racc/parser.rb"
-#--
-# Copyright (c) 1999-2006 Minero Aoki
-#
-# This program is free software.
-# You can distribute/modify this program under the same terms of ruby.
-#
-# As a special exception, when this code is copied by Racc
-# into a Racc output file, you may use that output file
-# without restriction.
-#++
-
-unless $".find {|p| p.end_with?('/racc/info.rb')}
-$".push "#{__dir__}/racc/info.rb"
-
-module Racc
-  VERSION   = '1.7.3'
-  Version = VERSION
-  Copyright = 'Copyright (c) 1999-2006 Minero Aoki'
-end
-
-end
-
-
-unless defined?(NotImplementedError)
-  NotImplementedError = NotImplementError # :nodoc:
-end
-
-module Racc
-  class ParseError < StandardError; end
-end
-unless defined?(::ParseError)
-  ParseError = Racc::ParseError # :nodoc:
-end
-
-# Racc is a LALR(1) parser generator.
-# It is written in Ruby itself, and generates Ruby programs.
-#
-# == Command-line Reference
-#
-#     racc [-o<var>filename</var>] [--output-file=<var>filename</var>]
-#          [-e<var>rubypath</var>] [--executable=<var>rubypath</var>]
-#          [-v] [--verbose]
-#          [-O<var>filename</var>] [--log-file=<var>filename</var>]
-#          [-g] [--debug]
-#          [-E] [--embedded]
-#          [-l] [--no-line-convert]
-#          [-c] [--line-convert-all]
-#          [-a] [--no-omit-actions]
-#          [-C] [--check-only]
-#          [-S] [--output-status]
-#          [--version] [--copyright] [--help] <var>grammarfile</var>
-#
-# [+grammarfile+]
-#   Racc grammar file. Any extension is permitted.
-# [-o+outfile+, --output-file=+outfile+]
-#   A filename for output. default is <+filename+>.tab.rb
-# [-O+filename+, --log-file=+filename+]
-#   Place logging output in file +filename+.
-#   Default log file name is <+filename+>.output.
-# [-e+rubypath+, --executable=+rubypath+]
-#   output executable file(mode 755). where +path+ is the Ruby interpreter.
-# [-v, --verbose]
-#   verbose mode. create +filename+.output file, like yacc's y.output file.
-# [-g, --debug]
-#   add debug code to parser class. To display debugging information,
-#   use this '-g' option and set @yydebug true in parser class.
-# [-E, --embedded]
-#   Output parser which doesn't need runtime files (racc/parser.rb).
-# [-F, --frozen]
-#   Output parser which declares frozen_string_literals: true
-# [-C, --check-only]
-#   Check syntax of racc grammar file and quit.
-# [-S, --output-status]
-#   Print messages time to time while compiling.
-# [-l, --no-line-convert]
-#   turns off line number converting.
-# [-c, --line-convert-all]
-#   Convert line number of actions, inner, header and footer.
-# [-a, --no-omit-actions]
-#   Call all actions, even if an action is empty.
-# [--version]
-#   print Racc version and quit.
-# [--copyright]
-#   Print copyright and quit.
-# [--help]
-#   Print usage and quit.
-#
-# == Generating Parser Using Racc
-#
-# To compile Racc grammar file, simply type:
-#
-#   $ racc parse.y
-#
-# This creates Ruby script file "parse.tab.y". The -o option can change the output filename.
-#
-# == Writing A Racc Grammar File
-#
-# If you want your own parser, you have to write a grammar file.
-# A grammar file contains the name of your parser class, grammar for the parser,
-# user code, and anything else.
-# When writing a grammar file, yacc's knowledge is helpful.
-# If you have not used yacc before, Racc is not too difficult.
-#
-# Here's an example Racc grammar file.
-#
-#   class Calcparser
-#   rule
-#     target: exp { print val[0] }
-#
-#     exp: exp '+' exp
-#        | exp '*' exp
-#        | '(' exp ')'
-#        | NUMBER
-#   end
-#
-# Racc grammar files resemble yacc files.
-# But (of course), this is Ruby code.
-# yacc's $$ is the 'result', $0, $1... is
-# an array called 'val', and $-1, $-2... is an array called '_values'.
-#
-# See the {Grammar File Reference}[rdoc-ref:lib/racc/rdoc/grammar.en.rdoc] for
-# more information on grammar files.
-#
-# == Parser
-#
-# Then you must prepare the parse entry method. There are two types of
-# parse methods in Racc, Racc::Parser#do_parse and Racc::Parser#yyparse
-#
-# Racc::Parser#do_parse is simple.
-#
-# It's yyparse() of yacc, and Racc::Parser#next_token is yylex().
-# This method must returns an array like [TOKENSYMBOL, ITS_VALUE].
-# EOF is [false, false].
-# (TOKENSYMBOL is a Ruby symbol (taken from String#intern) by default.
-# If you want to change this, see the grammar reference.
-#
-# Racc::Parser#yyparse is little complicated, but useful.
-# It does not use Racc::Parser#next_token, instead it gets tokens from any iterator.
-#
-# For example, <code>yyparse(obj, :scan)</code> causes
-# calling +obj#scan+, and you can return tokens by yielding them from +obj#scan+.
-#
-# == Debugging
-#
-# When debugging, "-v" or/and the "-g" option is helpful.
-#
-# "-v" creates verbose log file (.output).
-# "-g" creates a "Verbose Parser".
-# Verbose Parser prints the internal status when parsing.
-# But it's _not_ automatic.
-# You must use -g option and set +@yydebug+ to +true+ in order to get output.
-# -g option only creates the verbose parser.
-#
-# === Racc reported syntax error.
-#
-# Isn't there too many "end"?
-# grammar of racc file is changed in v0.10.
-#
-# Racc does not use '%' mark, while yacc uses huge number of '%' marks..
-#
-# === Racc reported "XXXX conflicts".
-#
-# Try "racc -v xxxx.y".
-# It causes producing racc's internal log file, xxxx.output.
-#
-# === Generated parsers does not work correctly
-#
-# Try "racc -g xxxx.y".
-# This command let racc generate "debugging parser".
-# Then set @yydebug=true in your parser.
-# It produces a working log of your parser.
-#
-# == Re-distributing Racc runtime
-#
-# A parser, which is created by Racc, requires the Racc runtime module;
-# racc/parser.rb.
-#
-# Ruby 1.8.x comes with Racc runtime module,
-# you need NOT distribute Racc runtime files.
-#
-# If you want to include the Racc runtime module with your parser.
-# This can be done by using '-E' option:
-#
-#   $ racc -E -omyparser.rb myparser.y
-#
-# This command creates myparser.rb which `includes' Racc runtime.
-# Only you must do is to distribute your parser file (myparser.rb).
-#
-# Note: parser.rb is ruby license, but your parser is not.
-# Your own parser is completely yours.
-module Racc
-
-  unless defined?(Racc_No_Extensions)
-    Racc_No_Extensions = false # :nodoc:
-  end
-
-  class Parser
-
-    Racc_Runtime_Version = ::Racc::VERSION
-    Racc_Runtime_Core_Version_R = ::Racc::VERSION
-
-    begin
-      if Object.const_defined?(:RUBY_ENGINE) and RUBY_ENGINE == 'jruby'
-        require 'jruby'
-        require 'racc/cparse-jruby.jar'
-        com.headius.racc.Cparse.new.load(JRuby.runtime, false)
-      else
-        require 'racc/cparse'
-      end
-
-      unless new.respond_to?(:_racc_do_parse_c, true)
-        raise LoadError, 'old cparse.so'
-      end
-      if Racc_No_Extensions
-        raise LoadError, 'selecting ruby version of racc runtime core'
-      end
-
-      Racc_Main_Parsing_Routine    = :_racc_do_parse_c # :nodoc:
-      Racc_YY_Parse_Method         = :_racc_yyparse_c # :nodoc:
-      Racc_Runtime_Core_Version    = Racc_Runtime_Core_Version_C # :nodoc:
-      Racc_Runtime_Type            = 'c' # :nodoc:
-    rescue LoadError
-      Racc_Main_Parsing_Routine    = :_racc_do_parse_rb
-      Racc_YY_Parse_Method         = :_racc_yyparse_rb
-      Racc_Runtime_Core_Version    = Racc_Runtime_Core_Version_R
-      Racc_Runtime_Type            = 'ruby'
-    end
-
-    def Parser.racc_runtime_type # :nodoc:
-      Racc_Runtime_Type
-    end
-
-    def _racc_setup
-      @yydebug = false unless self.class::Racc_debug_parser
-      @yydebug = false unless defined?(@yydebug)
-      if @yydebug
-        @racc_debug_out = $stderr unless defined?(@racc_debug_out)
-        @racc_debug_out ||= $stderr
-      end
-      arg = self.class::Racc_arg
-      arg[13] = true if arg.size < 14
-      arg
-    end
-
-    def _racc_init_sysvars
-      @racc_state  = [0]
-      @racc_tstack = []
-      @racc_vstack = []
-
-      @racc_t = nil
-      @racc_val = nil
-
-      @racc_read_next = true
-
-      @racc_user_yyerror = false
-      @racc_error_status = 0
-    end
-
-    # The entry point of the parser. This method is used with #next_token.
-    # If Racc wants to get token (and its value), calls next_token.
-    #
-    # Example:
-    #     def parse
-    #       @q = [[1,1],
-    #             [2,2],
-    #             [3,3],
-    #             [false, '$']]
-    #       do_parse
-    #     end
-    #
-    #     def next_token
-    #       @q.shift
-    #     end
-    class_eval <<~RUBY, __FILE__, __LINE__ + 1
-    def do_parse
-      #{Racc_Main_Parsing_Routine}(_racc_setup(), false)
-    end
-    RUBY
-
-    # The method to fetch next token.
-    # If you use #do_parse method, you must implement #next_token.
-    #
-    # The format of return value is [TOKEN_SYMBOL, VALUE].
-    # +token-symbol+ is represented by Ruby's symbol by default, e.g. :IDENT
-    # for 'IDENT'.  ";" (String) for ';'.
-    #
-    # The final symbol (End of file) must be false.
-    def next_token
-      raise NotImplementedError, "#{self.class}\#next_token is not defined"
-    end
-
-    def _racc_do_parse_rb(arg, in_debug)
-      action_table, action_check, action_default, action_pointer,
-      _,            _,            _,              _,
-      _,            _,            token_table,    * = arg
-
-      _racc_init_sysvars
-      tok = act = i = nil
-
-      catch(:racc_end_parse) {
-        while true
-          if i = action_pointer[@racc_state[-1]]
-            if @racc_read_next
-              if @racc_t != 0   # not EOF
-                tok, @racc_val = next_token()
-                unless tok      # EOF
-                  @racc_t = 0
-                else
-                  @racc_t = (token_table[tok] or 1)   # error token
-                end
-                racc_read_token(@racc_t, tok, @racc_val) if @yydebug
-                @racc_read_next = false
-              end
-            end
-            i += @racc_t
-            unless i >= 0 and
-                   act = action_table[i] and
-                   action_check[i] == @racc_state[-1]
-              act = action_default[@racc_state[-1]]
-            end
-          else
-            act = action_default[@racc_state[-1]]
-          end
-          while act = _racc_evalact(act, arg)
-            ;
-          end
-        end
-      }
-    end
-
-    # Another entry point for the parser.
-    # If you use this method, you must implement RECEIVER#METHOD_ID method.
-    #
-    # RECEIVER#METHOD_ID is a method to get next token.
-    # It must 'yield' the token, which format is [TOKEN-SYMBOL, VALUE].
-    class_eval <<~RUBY, __FILE__, __LINE__ + 1
-    def yyparse(recv, mid)
-      #{Racc_YY_Parse_Method}(recv, mid, _racc_setup(), false)
-    end
-    RUBY
-
-    def _racc_yyparse_rb(recv, mid, arg, c_debug)
-      action_table, action_check, action_default, action_pointer,
-      _,            _,            _,              _,
-      _,            _,            token_table,    * = arg
-
-      _racc_init_sysvars
-
-      catch(:racc_end_parse) {
-        until i = action_pointer[@racc_state[-1]]
-          while act = _racc_evalact(action_default[@racc_state[-1]], arg)
-            ;
-          end
-        end
-        recv.__send__(mid) do |tok, val|
-          unless tok
-            @racc_t = 0
-          else
-            @racc_t = (token_table[tok] or 1)   # error token
-          end
-          @racc_val = val
-          @racc_read_next = false
-
-          i += @racc_t
-          unless i >= 0 and
-                 act = action_table[i] and
-                 action_check[i] == @racc_state[-1]
-            act = action_default[@racc_state[-1]]
-          end
-          while act = _racc_evalact(act, arg)
-            ;
-          end
-
-          while !(i = action_pointer[@racc_state[-1]]) ||
-                ! @racc_read_next ||
-                @racc_t == 0  # $
-            unless i and i += @racc_t and
-                   i >= 0 and
-                   act = action_table[i] and
-                   action_check[i] == @racc_state[-1]
-              act = action_default[@racc_state[-1]]
-            end
-            while act = _racc_evalact(act, arg)
-              ;
-            end
-          end
-        end
-      }
-    end
-
-    ###
-    ### common
-    ###
-
-    def _racc_evalact(act, arg)
-      action_table, action_check, _, action_pointer,
-      _,            _,            _, _,
-      _,            _,            _, shift_n,
-      reduce_n,     * = arg
-      nerr = 0   # tmp
-
-      if act > 0 and act < shift_n
-        #
-        # shift
-        #
-        if @racc_error_status > 0
-          @racc_error_status -= 1 unless @racc_t <= 1 # error token or EOF
-        end
-        @racc_vstack.push @racc_val
-        @racc_state.push act
-        @racc_read_next = true
-        if @yydebug
-          @racc_tstack.push @racc_t
-          racc_shift @racc_t, @racc_tstack, @racc_vstack
-        end
-
-      elsif act < 0 and act > -reduce_n
-        #
-        # reduce
-        #
-        code = catch(:racc_jump) {
-          @racc_state.push _racc_do_reduce(arg, act)
-          false
-        }
-        if code
-          case code
-          when 1 # yyerror
-            @racc_user_yyerror = true   # user_yyerror
-            return -reduce_n
-          when 2 # yyaccept
-            return shift_n
-          else
-            raise '[Racc Bug] unknown jump code'
-          end
-        end
-
-      elsif act == shift_n
-        #
-        # accept
-        #
-        racc_accept if @yydebug
-        throw :racc_end_parse, @racc_vstack[0]
-
-      elsif act == -reduce_n
-        #
-        # error
-        #
-        case @racc_error_status
-        when 0
-          unless arg[21]    # user_yyerror
-            nerr += 1
-            on_error @racc_t, @racc_val, @racc_vstack
-          end
-        when 3
-          if @racc_t == 0   # is $
-            # We're at EOF, and another error occurred immediately after
-            # attempting auto-recovery
-            throw :racc_end_parse, nil
-          end
-          @racc_read_next = true
-        end
-        @racc_user_yyerror = false
-        @racc_error_status = 3
-        while true
-          if i = action_pointer[@racc_state[-1]]
-            i += 1   # error token
-            if  i >= 0 and
-                (act = action_table[i]) and
-                action_check[i] == @racc_state[-1]
-              break
-            end
-          end
-          throw :racc_end_parse, nil if @racc_state.size <= 1
-          @racc_state.pop
-          @racc_vstack.pop
-          if @yydebug
-            @racc_tstack.pop
-            racc_e_pop @racc_state, @racc_tstack, @racc_vstack
-          end
-        end
-        return act
-
-      else
-        raise "[Racc Bug] unknown action #{act.inspect}"
-      end
-
-      racc_next_state(@racc_state[-1], @racc_state) if @yydebug
-
-      nil
-    end
-
-    def _racc_do_reduce(arg, act)
-      _,          _,            _,            _,
-      goto_table, goto_check,   goto_default, goto_pointer,
-      nt_base,    reduce_table, _,            _,
-      _,          use_result,   * = arg
-
-      state = @racc_state
-      vstack = @racc_vstack
-      tstack = @racc_tstack
-
-      i = act * -3
-      len       = reduce_table[i]
-      reduce_to = reduce_table[i+1]
-      method_id = reduce_table[i+2]
-      void_array = []
-
-      tmp_t = tstack[-len, len] if @yydebug
-      tmp_v = vstack[-len, len]
-      tstack[-len, len] = void_array if @yydebug
-      vstack[-len, len] = void_array
-      state[-len, len]  = void_array
-
-      # tstack must be updated AFTER method call
-      if use_result
-        vstack.push __send__(method_id, tmp_v, vstack, tmp_v[0])
-      else
-        vstack.push __send__(method_id, tmp_v, vstack)
-      end
-      tstack.push reduce_to
-
-      racc_reduce(tmp_t, reduce_to, tstack, vstack) if @yydebug
-
-      k1 = reduce_to - nt_base
-      if i = goto_pointer[k1]
-        i += state[-1]
-        if i >= 0 and (curstate = goto_table[i]) and goto_check[i] == k1
-          return curstate
-        end
-      end
-      goto_default[k1]
-    end
-
-    # This method is called when a parse error is found.
-    #
-    # ERROR_TOKEN_ID is an internal ID of token which caused error.
-    # You can get string representation of this ID by calling
-    # #token_to_str.
-    #
-    # ERROR_VALUE is a value of error token.
-    #
-    # value_stack is a stack of symbol values.
-    # DO NOT MODIFY this object.
-    #
-    # This method raises ParseError by default.
-    #
-    # If this method returns, parsers enter "error recovering mode".
-    def on_error(t, val, vstack)
-      raise ParseError, sprintf("parse error on value %s (%s)",
-                                val.inspect, token_to_str(t) || '?')
-    end
-
-    # Enter error recovering mode.
-    # This method does not call #on_error.
-    def yyerror
-      throw :racc_jump, 1
-    end
-
-    # Exit parser.
-    # Return value is +Symbol_Value_Stack[0]+.
-    def yyaccept
-      throw :racc_jump, 2
-    end
-
-    # Leave error recovering mode.
-    def yyerrok
-      @racc_error_status = 0
-    end
-
-    # For debugging output
-    def racc_read_token(t, tok, val)
-      @racc_debug_out.print 'read    '
-      @racc_debug_out.print tok.inspect, '(', racc_token2str(t), ') '
-      @racc_debug_out.puts val.inspect
-      @racc_debug_out.puts
-    end
-
-    def racc_shift(tok, tstack, vstack)
-      @racc_debug_out.puts "shift   #{racc_token2str tok}"
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_reduce(toks, sim, tstack, vstack)
-      out = @racc_debug_out
-      out.print 'reduce '
-      if toks.empty?
-        out.print ' <none>'
-      else
-        toks.each {|t| out.print ' ', racc_token2str(t) }
-      end
-      out.puts " --> #{racc_token2str(sim)}"
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_accept
-      @racc_debug_out.puts 'accept'
-      @racc_debug_out.puts
-    end
-
-    def racc_e_pop(state, tstack, vstack)
-      @racc_debug_out.puts 'error recovering mode: pop token'
-      racc_print_states state
-      racc_print_stacks tstack, vstack
-      @racc_debug_out.puts
-    end
-
-    def racc_next_state(curstate, state)
-      @racc_debug_out.puts  "goto    #{curstate}"
-      racc_print_states state
-      @racc_debug_out.puts
-    end
-
-    def racc_print_stacks(t, v)
-      out = @racc_debug_out
-      out.print '        ['
-      t.each_index do |i|
-        out.print ' (', racc_token2str(t[i]), ' ', v[i].inspect, ')'
-      end
-      out.puts ' ]'
-    end
-
-    def racc_print_states(s)
-      out = @racc_debug_out
-      out.print '        ['
-      s.each {|st| out.print ' ', st }
-      out.puts ' ]'
-    end
-
-    def racc_token2str(tok)
-      self.class::Racc_token_to_s_table[tok] or
-          raise "[Racc Bug] can't convert token #{tok} to string"
-    end
-
-    # Convert internal ID of token symbol to the string.
-    def token_to_str(t)
-      self.class::Racc_token_to_s_table[t]
-    end
-
-  end
-
-end
-
-end
-###### racc/parser.rb end
-
-require 'strscan'
-
-class RDoc::RD
-
-##
-# RD format parser for inline markup such as emphasis, links, footnotes, etc.
-
-class InlineParser < Racc::Parser
-
-
-# :stopdoc:
-
-EM_OPEN = '((*'
-EM_OPEN_RE = /\A#{Regexp.quote(EM_OPEN)}/
-EM_CLOSE = '*))'
-EM_CLOSE_RE = /\A#{Regexp.quote(EM_CLOSE)}/
-CODE_OPEN = '(({'
-CODE_OPEN_RE = /\A#{Regexp.quote(CODE_OPEN)}/
-CODE_CLOSE = '}))'
-CODE_CLOSE_RE = /\A#{Regexp.quote(CODE_CLOSE)}/
-VAR_OPEN = '((|'
-VAR_OPEN_RE = /\A#{Regexp.quote(VAR_OPEN)}/
-VAR_CLOSE = '|))'
-VAR_CLOSE_RE = /\A#{Regexp.quote(VAR_CLOSE)}/
-KBD_OPEN = '((%'
-KBD_OPEN_RE = /\A#{Regexp.quote(KBD_OPEN)}/
-KBD_CLOSE = '%))'
-KBD_CLOSE_RE = /\A#{Regexp.quote(KBD_CLOSE)}/
-INDEX_OPEN = '((:'
-INDEX_OPEN_RE = /\A#{Regexp.quote(INDEX_OPEN)}/
-INDEX_CLOSE = ':))'
-INDEX_CLOSE_RE = /\A#{Regexp.quote(INDEX_CLOSE)}/
-REF_OPEN = '((<'
-REF_OPEN_RE = /\A#{Regexp.quote(REF_OPEN)}/
-REF_CLOSE = '>))'
-REF_CLOSE_RE = /\A#{Regexp.quote(REF_CLOSE)}/
-FOOTNOTE_OPEN = '((-'
-FOOTNOTE_OPEN_RE = /\A#{Regexp.quote(FOOTNOTE_OPEN)}/
-FOOTNOTE_CLOSE = '-))'
-FOOTNOTE_CLOSE_RE = /\A#{Regexp.quote(FOOTNOTE_CLOSE)}/
-VERB_OPEN = "(('"
-VERB_OPEN_RE = /\A#{Regexp.quote(VERB_OPEN)}/
-VERB_CLOSE = "'))"
-VERB_CLOSE_RE = /\A#{Regexp.quote(VERB_CLOSE)}/
-
-BAR = "|"
-BAR_RE = /\A#{Regexp.quote(BAR)}/
-QUOTE = '"'
-QUOTE_RE = /\A#{Regexp.quote(QUOTE)}/
-SLASH = "/"
-SLASH_RE = /\A#{Regexp.quote(SLASH)}/
-BACK_SLASH = "\\"
-BACK_SLASH_RE = /\A#{Regexp.quote(BACK_SLASH)}/
-URL = "URL:"
-URL_RE = /\A#{Regexp.quote(URL)}/
-
-other_re_mode = Regexp::EXTENDED
-other_re_mode |= Regexp::MULTILINE
-
-OTHER_RE = Regexp.new(
-  "\\A.+?(?=#{Regexp.quote(EM_OPEN)}|#{Regexp.quote(EM_CLOSE)}|
-              #{Regexp.quote(CODE_OPEN)}|#{Regexp.quote(CODE_CLOSE)}|
-              #{Regexp.quote(VAR_OPEN)}|#{Regexp.quote(VAR_CLOSE)}|
-              #{Regexp.quote(KBD_OPEN)}|#{Regexp.quote(KBD_CLOSE)}|
-              #{Regexp.quote(INDEX_OPEN)}|#{Regexp.quote(INDEX_CLOSE)}|
-              #{Regexp.quote(REF_OPEN)}|#{Regexp.quote(REF_CLOSE)}|
-            #{Regexp.quote(FOOTNOTE_OPEN)}|#{Regexp.quote(FOOTNOTE_CLOSE)}|
-              #{Regexp.quote(VERB_OPEN)}|#{Regexp.quote(VERB_CLOSE)}|
-              #{Regexp.quote(BAR)}|
-              #{Regexp.quote(QUOTE)}|
-              #{Regexp.quote(SLASH)}|
-              #{Regexp.quote(BACK_SLASH)}|
-              #{Regexp.quote(URL)})", other_re_mode)
-
-# :startdoc:
-
-##
-# Creates a new parser for inline markup in the rd format.  The +block_parser+
-# is used to for footnotes and labels in the inline text.
-
-def initialize block_parser
-  @block_parser = block_parser
-end
-
-##
-# Parses the +inline+ text from RD format into RDoc format.
-
-def parse inline
-  @inline = inline
-  @src = StringScanner.new inline
-  @pre = "".dup
-  @yydebug = true
-  do_parse.to_s
-end
-
-##
-# Returns the next token from the inline text
-
-def next_token
-  return [false, false] if @src.eos?
-#  p @src.rest if @yydebug
-  if ret = @src.scan(EM_OPEN_RE)
-    @pre << ret
-    [:EM_OPEN, ret]
-  elsif ret = @src.scan(EM_CLOSE_RE)
-    @pre << ret
-    [:EM_CLOSE, ret]
-  elsif ret = @src.scan(CODE_OPEN_RE)
-    @pre << ret
-    [:CODE_OPEN, ret]
-  elsif ret = @src.scan(CODE_CLOSE_RE)
-    @pre << ret
-    [:CODE_CLOSE, ret]
-  elsif ret = @src.scan(VAR_OPEN_RE)
-    @pre << ret
-    [:VAR_OPEN, ret]
-  elsif ret = @src.scan(VAR_CLOSE_RE)
-    @pre << ret
-    [:VAR_CLOSE, ret]
-  elsif ret = @src.scan(KBD_OPEN_RE)
-    @pre << ret
-    [:KBD_OPEN, ret]
-  elsif ret = @src.scan(KBD_CLOSE_RE)
-    @pre << ret
-    [:KBD_CLOSE, ret]
-  elsif ret = @src.scan(INDEX_OPEN_RE)
-    @pre << ret
-    [:INDEX_OPEN, ret]
-  elsif ret = @src.scan(INDEX_CLOSE_RE)
-    @pre << ret
-    [:INDEX_CLOSE, ret]
-  elsif ret = @src.scan(REF_OPEN_RE)
-    @pre << ret
-    [:REF_OPEN, ret]
-  elsif ret = @src.scan(REF_CLOSE_RE)
-    @pre << ret
-    [:REF_CLOSE, ret]
-  elsif ret = @src.scan(FOOTNOTE_OPEN_RE)
-    @pre << ret
-    [:FOOTNOTE_OPEN, ret]
-  elsif ret = @src.scan(FOOTNOTE_CLOSE_RE)
-    @pre << ret
-    [:FOOTNOTE_CLOSE, ret]
-  elsif ret = @src.scan(VERB_OPEN_RE)
-    @pre << ret
-    [:VERB_OPEN, ret]
-  elsif ret = @src.scan(VERB_CLOSE_RE)
-    @pre << ret
-    [:VERB_CLOSE, ret]
-  elsif ret = @src.scan(BAR_RE)
-    @pre << ret
-    [:BAR, ret]
-  elsif ret = @src.scan(QUOTE_RE)
-    @pre << ret
-    [:QUOTE, ret]
-  elsif ret = @src.scan(SLASH_RE)
-    @pre << ret
-    [:SLASH, ret]
-  elsif ret = @src.scan(BACK_SLASH_RE)
-    @pre << ret
-    [:BACK_SLASH, ret]
-  elsif ret = @src.scan(URL_RE)
-    @pre << ret
-    [:URL, ret]
-  elsif ret = @src.scan(OTHER_RE)
-    @pre << ret
-    [:OTHER, ret]
-  else
-    ret = @src.rest
-    @pre << ret
-    @src.terminate
-    [:OTHER, ret]
-  end
-end
-
-##
-# Raises a ParseError when invalid formatting is found
-
-def on_error(et, ev, values)
-  lines_of_rest = @src.rest.lines.to_a.length
-  prev_words = prev_words_on_error(ev)
-  at = 4 + prev_words.length
-
-  message = <<-MSG
-RD syntax error: line #{@block_parser.line_index - lines_of_rest}:
-...#{prev_words} #{(ev||'')} #{next_words_on_error()} ...
-  MSG
-
-  message << " " * at + "^" * (ev ? ev.length : 0) + "\n"
-  raise ParseError, message
-end
-
-##
-# Returns words before the error
-
-def prev_words_on_error(ev)
-  pre = @pre
-  if ev and /#{Regexp.quote(ev)}$/ =~ pre
-    pre = $`
-  end
-  last_line(pre)
-end
-
-##
-# Returns the last line of +src+
-
-def last_line(src)
-  if n = src.rindex("\n")
-    src[(n+1) .. -1]
-  else
-    src
-  end
-end
-private :last_line
-
-##
-# Returns words following an error
-
-def next_words_on_error
-  if n = @src.rest.index("\n")
-    @src.rest[0 .. (n-1)]
-  else
-    @src.rest
-  end
-end
-
-##
-# Creates a new RDoc::RD::Inline for the +rdoc+ markup and the raw +reference+
-
-def inline rdoc, reference = rdoc
-  RDoc::RD::Inline.new rdoc, reference
-end
-
-# :stopdoc:
-##### State transition tables begin ###
-
-racc_action_table = [
-   104,   103,   102,   100,   101,    99,   115,   116,   117,    29,
-   105,   106,   107,   108,   109,   110,   111,   112,   113,   114,
-    84,   118,   119,    63,    64,    65,    61,    81,    62,    76,
-    78,    79,    85,    66,    67,    68,    69,    70,    71,    72,
-    73,    74,    75,    77,    80,   149,    63,    64,    65,   153,
-    81,    62,    76,    78,    79,    86,    66,    67,    68,    69,
-    70,    71,    72,    73,    74,    75,    77,    80,   152,   104,
-   103,   102,   100,   101,    99,   115,   116,   117,    87,   105,
-   106,   107,   108,   109,   110,   111,   112,   113,   114,    88,
-   118,   119,   104,   103,   102,   100,   101,    99,   115,   116,
-   117,    89,   105,   106,   107,   108,   109,   110,   111,   112,
-   113,   114,    96,   118,   119,   104,   103,   102,   100,   101,
-    99,   115,   116,   117,   124,   105,   106,   107,   108,   109,
-   110,   111,   112,   113,   114,   137,   118,   119,    22,    23,
-    24,    25,    26,    21,    18,    19,   176,   177,    13,   148,
-    14,   154,    15,   137,    16,   161,    17,   164,   173,    20,
-    22,    23,    24,    25,    26,    21,    18,    19,   175,   177,
-    13,   nil,    14,   nil,    15,   nil,    16,   nil,    17,   nil,
-   nil,    20,    22,    23,    24,    25,    26,    21,    18,    19,
-   nil,   nil,    13,   nil,    14,   nil,    15,   nil,    16,   nil,
-    17,   nil,   nil,    20,    22,    23,    24,    25,    26,    21,
-    18,    19,   nil,   nil,    13,   nil,    14,   nil,    15,   nil,
-    16,   nil,    17,   nil,   nil,    20,    22,    23,    24,    25,
-    26,    21,    18,    19,   nil,   nil,    13,   nil,    14,   nil,
-    15,   nil,    16,   nil,    17,   nil,   nil,    20,    22,    23,
-    24,    25,    26,    21,    18,    19,   nil,   nil,    13,   nil,
-    14,   nil,    15,   nil,    16,   nil,    17,   nil,   nil,    20,
-    22,    23,    24,    25,    26,    21,    18,    19,   nil,   nil,
-    13,   nil,    14,   nil,    15,   nil,    16,   nil,    17,    42,
-   nil,    20,    54,    38,    53,    55,    56,    57,   nil,    13,
-   nil,    14,   nil,    15,   nil,    16,   nil,    17,   nil,   nil,
-    20,    22,    23,    24,    25,    26,    21,    18,    19,   nil,
-   nil,    13,   nil,    14,   nil,    15,   nil,    16,   nil,    17,
-   nil,   nil,    20,    63,    64,    65,    61,    81,    62,    76,
-    78,    79,   nil,    66,    67,    68,    69,    70,    71,    72,
-    73,    74,    75,    77,    80,   122,   nil,   nil,    54,   nil,
-    53,    55,    56,    57,   nil,    13,   nil,    14,   nil,    15,
-   nil,    16,   nil,    17,   145,   nil,    20,    54,   133,    53,
-    55,    56,    57,   nil,    13,   nil,    14,   nil,    15,   nil,
-    16,   nil,    17,   145,   nil,    20,    54,   133,    53,    55,
-    56,    57,   nil,    13,   nil,    14,   nil,    15,   nil,    16,
-   nil,    17,   145,   nil,    20,    54,   133,    53,    55,    56,
-    57,   nil,    13,   nil,    14,   nil,    15,   nil,    16,   nil,
-    17,   145,   nil,    20,    54,   133,    53,    55,    56,    57,
-   nil,    13,   nil,    14,   nil,    15,   nil,    16,   nil,    17,
-   nil,   nil,    20,   135,   136,    54,   133,    53,    55,    56,
-    57,   nil,    13,   nil,    14,   nil,    15,   nil,    16,   nil,
-    17,   nil,   nil,    20,   135,   136,    54,   133,    53,    55,
-    56,    57,   nil,    13,   nil,    14,   nil,    15,   nil,    16,
-   nil,    17,   nil,   nil,    20,   135,   136,    54,   133,    53,
-    55,    56,    57,   nil,    13,   nil,    14,   nil,    15,   nil,
-    16,   nil,    17,    95,   nil,    20,    54,    91,    53,    55,
-    56,    57,   145,   nil,   nil,    54,   133,    53,    55,    56,
-    57,   158,   nil,   nil,    54,   nil,    53,    55,    56,    57,
-   165,   135,   136,    54,   133,    53,    55,    56,    57,   145,
-   nil,   nil,    54,   133,    53,    55,    56,    57,   172,   135,
-   136,    54,   133,    53,    55,    56,    57,   174,   135,   136,
-    54,   133,    53,    55,    56,    57,   178,   135,   136,    54,
-   133,    53,    55,    56,    57,   135,   136,    54,   133,    53,
-    55,    56,    57,   135,   136,    54,   133,    53,    55,    56,
-    57,   135,   136,    54,   133,    53,    55,    56,    57,    22,
-    23,    24,    25,    26,    21 ]
-
-racc_action_check = [
-    38,    38,    38,    38,    38,    38,    38,    38,    38,     1,
-    38,    38,    38,    38,    38,    38,    38,    38,    38,    38,
-    29,    38,    38,    59,    59,    59,    59,    59,    59,    59,
-    59,    59,    31,    59,    59,    59,    59,    59,    59,    59,
-    59,    59,    59,    59,    59,    59,    61,    61,    61,    61,
-    61,    61,    61,    61,    61,    32,    61,    61,    61,    61,
-    61,    61,    61,    61,    61,    61,    61,    61,    61,    91,
-    91,    91,    91,    91,    91,    91,    91,    91,    33,    91,
-    91,    91,    91,    91,    91,    91,    91,    91,    91,    34,
-    91,    91,    97,    97,    97,    97,    97,    97,    97,    97,
-    97,    35,    97,    97,    97,    97,    97,    97,    97,    97,
-    97,    97,    37,    97,    97,   155,   155,   155,   155,   155,
-   155,   155,   155,   155,    41,   155,   155,   155,   155,   155,
-   155,   155,   155,   155,   155,    43,   155,   155,     0,     0,
-     0,     0,     0,     0,     0,     0,   165,   165,     0,    58,
-     0,    90,     0,    94,     0,   100,     0,   125,   162,     0,
-     2,     2,     2,     2,     2,     2,     2,     2,   164,   172,
-     2,   nil,     2,   nil,     2,   nil,     2,   nil,     2,   nil,
-   nil,     2,    13,    13,    13,    13,    13,    13,    13,    13,
-   nil,   nil,    13,   nil,    13,   nil,    13,   nil,    13,   nil,
-    13,   nil,   nil,    13,    14,    14,    14,    14,    14,    14,
-    14,    14,   nil,   nil,    14,   nil,    14,   nil,    14,   nil,
-    14,   nil,    14,   nil,   nil,    14,    15,    15,    15,    15,
-    15,    15,    15,    15,   nil,   nil,    15,   nil,    15,   nil,
-    15,   nil,    15,   nil,    15,   nil,   nil,    15,    16,    16,
-    16,    16,    16,    16,    16,    16,   nil,   nil,    16,   nil,
-    16,   nil,    16,   nil,    16,   nil,    16,   nil,   nil,    16,
-    17,    17,    17,    17,    17,    17,    17,    17,   nil,   nil,
-    17,   nil,    17,   nil,    17,   nil,    17,   nil,    17,    18,
-   nil,    17,    18,    18,    18,    18,    18,    18,   nil,    18,
-   nil,    18,   nil,    18,   nil,    18,   nil,    18,   nil,   nil,
-    18,    19,    19,    19,    19,    19,    19,    19,    19,   nil,
-   nil,    19,   nil,    19,   nil,    19,   nil,    19,   nil,    19,
-   nil,   nil,    19,    20,    20,    20,    20,    20,    20,    20,
-    20,    20,   nil,    20,    20,    20,    20,    20,    20,    20,
-    20,    20,    20,    20,    20,    39,   nil,   nil,    39,   nil,
-    39,    39,    39,    39,   nil,    39,   nil,    39,   nil,    39,
-   nil,    39,   nil,    39,    44,   nil,    39,    44,    44,    44,
-    44,    44,    44,   nil,    44,   nil,    44,   nil,    44,   nil,
-    44,   nil,    44,    45,   nil,    44,    45,    45,    45,    45,
-    45,    45,   nil,    45,   nil,    45,   nil,    45,   nil,    45,
-   nil,    45,   138,   nil,    45,   138,   138,   138,   138,   138,
-   138,   nil,   138,   nil,   138,   nil,   138,   nil,   138,   nil,
-   138,   146,   nil,   138,   146,   146,   146,   146,   146,   146,
-   nil,   146,   nil,   146,   nil,   146,   nil,   146,   nil,   146,
-   nil,   nil,   146,    42,    42,    42,    42,    42,    42,    42,
-    42,   nil,    42,   nil,    42,   nil,    42,   nil,    42,   nil,
-    42,   nil,   nil,    42,   122,   122,   122,   122,   122,   122,
-   122,   122,   nil,   122,   nil,   122,   nil,   122,   nil,   122,
-   nil,   122,   nil,   nil,   122,   127,   127,   127,   127,   127,
-   127,   127,   127,   nil,   127,   nil,   127,   nil,   127,   nil,
-   127,   nil,   127,    36,   nil,   127,    36,    36,    36,    36,
-    36,    36,    52,   nil,   nil,    52,    52,    52,    52,    52,
-    52,    92,   nil,   nil,    92,   nil,    92,    92,    92,    92,
-   126,   126,   126,   126,   126,   126,   126,   126,   126,   142,
-   nil,   nil,   142,   142,   142,   142,   142,   142,   159,   159,
-   159,   159,   159,   159,   159,   159,   159,   163,   163,   163,
-   163,   163,   163,   163,   163,   163,   171,   171,   171,   171,
-   171,   171,   171,   171,   171,    95,    95,    95,    95,    95,
-    95,    95,    95,   158,   158,   158,   158,   158,   158,   158,
-   158,   168,   168,   168,   168,   168,   168,   168,   168,    27,
-    27,    27,    27,    27,    27 ]
-
-racc_action_pointer = [
-   135,     9,   157,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   179,   201,   223,   245,   267,   286,   308,
-   330,   nil,   nil,   nil,   nil,   nil,   nil,   606,   nil,    20,
-   nil,    18,    39,    60,    69,    79,   510,    89,    -3,   352,
-   nil,   120,   449,   130,   371,   390,   nil,   nil,   nil,   nil,
-   nil,   nil,   519,   nil,   nil,   nil,   nil,   nil,   138,    20,
-   nil,    43,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   128,    66,   528,   nil,   148,   581,   nil,    89,   nil,   nil,
-   149,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   470,   nil,   nil,   154,   537,   491,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,   nil,   nil,   409,   nil,
-   nil,   nil,   546,   nil,   nil,   nil,   428,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   112,   nil,   nil,   589,   555,
-   nil,   nil,   155,   564,   164,   142,   nil,   nil,   597,   nil,
-   nil,   573,   164,   nil,   nil,   nil,   nil,   nil,   nil ]
-
-racc_action_default = [
-  -138,  -138,    -1,    -3,    -4,    -5,    -6,    -7,    -8,    -9,
-   -10,   -11,   -12,  -138,  -138,  -138,  -138,  -138,  -138,  -138,
-  -138,  -103,  -104,  -105,  -106,  -107,  -108,  -111,  -110,  -138,
-    -2,  -138,  -138,  -138,  -138,  -138,  -138,  -138,  -138,   -27,
-   -26,   -35,  -138,   -58,   -41,   -40,   -47,   -48,   -49,   -50,
-   -51,   -52,   -63,   -66,   -67,   -68,   -69,   -70,  -138,  -138,
-  -112,  -138,  -116,  -117,  -118,  -119,  -120,  -121,  -122,  -123,
-  -124,  -125,  -126,  -127,  -128,  -129,  -130,  -131,  -132,  -133,
-  -134,  -135,  -137,  -109,   179,   -13,   -14,   -15,   -16,   -17,
-  -138,  -138,   -23,   -22,   -33,  -138,   -19,   -24,   -79,   -80,
-  -138,   -82,   -83,   -84,   -85,   -86,   -87,   -88,   -89,   -90,
-   -91,   -92,   -93,   -94,   -95,   -96,   -97,   -98,   -99,  -100,
-   -25,   -35,  -138,   -58,   -28,  -138,   -59,   -42,   -46,   -55,
-   -56,   -65,   -71,   -72,   -75,   -76,   -77,   -31,   -38,   -44,
-   -53,   -54,   -57,   -61,   -73,   -74,   -39,   -62,  -101,  -102,
-  -136,  -113,  -114,  -115,   -18,   -20,   -21,   -33,  -138,  -138,
-   -78,   -81,  -138,   -59,   -36,   -37,   -64,   -45,   -59,   -43,
-   -60,  -138,   -34,   -36,   -37,   -29,   -30,   -32,   -34 ]
-
-racc_goto_table = [
-   126,    44,   125,    43,   144,   144,   160,    93,    97,    52,
-   166,    82,   144,    40,    41,    39,   138,   146,   169,    30,
-    36,    94,    44,     1,   123,   129,   169,    52,    90,    37,
-    52,   167,   147,    92,   120,   121,    31,    32,    33,    34,
-    35,   170,    58,   166,    59,    83,   170,   166,   151,   nil,
-   150,   nil,   166,   159,     4,   166,     4,   nil,   nil,   nil,
-   nil,   155,   nil,   156,   160,   nil,   nil,     4,     4,     4,
-     4,     4,   nil,     4,     5,   nil,     5,   157,   nil,   nil,
-   163,   nil,   162,    52,   nil,   168,   nil,     5,     5,     5,
-     5,     5,   nil,     5,   nil,   nil,   nil,   nil,   144,   nil,
-   nil,   nil,   144,   nil,   nil,   129,   144,   144,   nil,     6,
-   129,     6,   nil,   nil,   nil,   nil,   171,     7,   nil,     7,
-   nil,   nil,     6,     6,     6,     6,     6,     8,     6,     8,
-     7,     7,     7,     7,     7,    11,     7,    11,   nil,   nil,
-     8,     8,     8,     8,     8,   nil,     8,   nil,    11,    11,
-    11,    11,    11,   nil,    11 ]
-
-racc_goto_check = [
-    22,    24,    21,    23,    36,    36,    37,    18,    16,    34,
-    35,    41,    36,    19,    20,    17,    25,    25,    28,     3,
-    13,    23,    24,     1,    23,    24,    28,    34,    14,    15,
-    34,    29,    32,    17,    19,    20,     1,     1,     1,     1,
-     1,    33,     1,    35,    38,    39,    33,    35,    42,   nil,
-    41,   nil,    35,    22,     4,    35,     4,   nil,   nil,   nil,
-   nil,    16,   nil,    18,    37,   nil,   nil,     4,     4,     4,
-     4,     4,   nil,     4,     5,   nil,     5,    23,   nil,   nil,
-    22,   nil,    21,    34,   nil,    22,   nil,     5,     5,     5,
-     5,     5,   nil,     5,   nil,   nil,   nil,   nil,    36,   nil,
-   nil,   nil,    36,   nil,   nil,    24,    36,    36,   nil,     6,
-    24,     6,   nil,   nil,   nil,   nil,    22,     7,   nil,     7,
-   nil,   nil,     6,     6,     6,     6,     6,     8,     6,     8,
-     7,     7,     7,     7,     7,    11,     7,    11,   nil,   nil,
-     8,     8,     8,     8,     8,   nil,     8,   nil,    11,    11,
-    11,    11,    11,   nil,    11 ]
-
-racc_goto_pointer = [
-   nil,    23,   nil,    17,    54,    74,   109,   117,   127,   nil,
-   nil,   135,   nil,     2,    -8,    11,   -30,    -3,   -29,    -5,
-    -4,   -40,   -42,   -15,   -17,   -28,   nil,   nil,  -120,   -96,
-   nil,   nil,   -20,  -101,    -9,  -116,   -40,   -91,    24,    18,
-   nil,    -9,   -13 ]
-
-racc_goto_default = [
-   nil,   nil,     2,     3,    46,    47,    48,    49,    50,     9,
-    10,    51,    12,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   140,   nil,    45,   127,   139,   128,
-   141,   130,   142,   143,   132,   131,   134,    98,   nil,    28,
-    27,   nil,    60 ]
-
-racc_reduce_table = [
-  0, 0, :racc_error,
-  1, 27, :_reduce_none,
-  2, 28, :_reduce_2,
-  1, 28, :_reduce_3,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  1, 29, :_reduce_none,
-  3, 30, :_reduce_13,
-  3, 31, :_reduce_14,
-  3, 32, :_reduce_15,
-  3, 33, :_reduce_16,
-  3, 34, :_reduce_17,
-  4, 35, :_reduce_18,
-  3, 35, :_reduce_19,
-  2, 40, :_reduce_20,
-  2, 40, :_reduce_21,
-  1, 40, :_reduce_22,
-  1, 40, :_reduce_23,
-  2, 41, :_reduce_24,
-  2, 41, :_reduce_25,
-  1, 41, :_reduce_26,
-  1, 41, :_reduce_27,
-  2, 39, :_reduce_none,
-  4, 39, :_reduce_29,
-  4, 39, :_reduce_30,
-  2, 43, :_reduce_31,
-  4, 43, :_reduce_32,
-  1, 44, :_reduce_33,
-  3, 44, :_reduce_34,
-  1, 45, :_reduce_none,
-  3, 45, :_reduce_36,
-  3, 45, :_reduce_37,
-  2, 46, :_reduce_38,
-  2, 46, :_reduce_39,
-  1, 46, :_reduce_40,
-  1, 46, :_reduce_41,
-  1, 47, :_reduce_none,
-  2, 51, :_reduce_43,
-  1, 51, :_reduce_44,
-  2, 53, :_reduce_45,
-  1, 53, :_reduce_46,
-  1, 50, :_reduce_none,
-  1, 50, :_reduce_none,
-  1, 50, :_reduce_none,
-  1, 50, :_reduce_none,
-  1, 50, :_reduce_none,
-  1, 50, :_reduce_none,
-  1, 54, :_reduce_none,
-  1, 54, :_reduce_none,
-  1, 55, :_reduce_none,
-  1, 55, :_reduce_none,
-  1, 56, :_reduce_57,
-  1, 52, :_reduce_58,
-  1, 57, :_reduce_59,
-  2, 58, :_reduce_60,
-  1, 58, :_reduce_none,
-  2, 49, :_reduce_62,
-  1, 49, :_reduce_none,
-  2, 48, :_reduce_64,
-  1, 48, :_reduce_none,
-  1, 60, :_reduce_none,
-  1, 60, :_reduce_none,
-  1, 60, :_reduce_none,
-  1, 60, :_reduce_none,
-  1, 60, :_reduce_none,
-  1, 62, :_reduce_none,
-  1, 62, :_reduce_none,
-  1, 59, :_reduce_none,
-  1, 59, :_reduce_none,
-  1, 61, :_reduce_none,
-  1, 61, :_reduce_none,
-  1, 61, :_reduce_none,
-  2, 42, :_reduce_78,
-  1, 42, :_reduce_none,
-  1, 63, :_reduce_none,
-  2, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  1, 63, :_reduce_none,
-  3, 36, :_reduce_101,
-  3, 37, :_reduce_102,
-  1, 65, :_reduce_none,
-  1, 65, :_reduce_none,
-  1, 65, :_reduce_none,
-  1, 65, :_reduce_none,
-  1, 65, :_reduce_none,
-  1, 65, :_reduce_none,
-  2, 66, :_reduce_109,
-  1, 66, :_reduce_none,
-  1, 38, :_reduce_111,
-  1, 67, :_reduce_none,
-  2, 67, :_reduce_113,
-  2, 67, :_reduce_114,
-  2, 67, :_reduce_115,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  1, 68, :_reduce_none,
-  2, 64, :_reduce_136,
-  1, 64, :_reduce_none ]
-
-racc_reduce_n = 138
-
-racc_shift_n = 179
-
-racc_token_table = {
-  false => 0,
-  :error => 1,
-  :EX_LOW => 2,
-  :QUOTE => 3,
-  :BAR => 4,
-  :SLASH => 5,
-  :BACK_SLASH => 6,
-  :URL => 7,
-  :OTHER => 8,
-  :REF_OPEN => 9,
-  :FOOTNOTE_OPEN => 10,
-  :FOOTNOTE_CLOSE => 11,
-  :EX_HIGH => 12,
-  :EM_OPEN => 13,
-  :EM_CLOSE => 14,
-  :CODE_OPEN => 15,
-  :CODE_CLOSE => 16,
-  :VAR_OPEN => 17,
-  :VAR_CLOSE => 18,
-  :KBD_OPEN => 19,
-  :KBD_CLOSE => 20,
-  :INDEX_OPEN => 21,
-  :INDEX_CLOSE => 22,
-  :REF_CLOSE => 23,
-  :VERB_OPEN => 24,
-  :VERB_CLOSE => 25 }
-
-racc_nt_base = 26
-
-racc_use_result_var = true
-
-Racc_arg = [
-  racc_action_table,
-  racc_action_check,
-  racc_action_default,
-  racc_action_pointer,
-  racc_goto_table,
-  racc_goto_check,
-  racc_goto_default,
-  racc_goto_pointer,
-  racc_nt_base,
-  racc_reduce_table,
-  racc_token_table,
-  racc_shift_n,
-  racc_reduce_n,
-  racc_use_result_var ]
-Ractor.make_shareable(Racc_arg) if defined?(Ractor)
-
-Racc_token_to_s_table = [
-  "$end",
-  "error",
-  "EX_LOW",
-  "QUOTE",
-  "BAR",
-  "SLASH",
-  "BACK_SLASH",
-  "URL",
-  "OTHER",
-  "REF_OPEN",
-  "FOOTNOTE_OPEN",
-  "FOOTNOTE_CLOSE",
-  "EX_HIGH",
-  "EM_OPEN",
-  "EM_CLOSE",
-  "CODE_OPEN",
-  "CODE_CLOSE",
-  "VAR_OPEN",
-  "VAR_CLOSE",
-  "KBD_OPEN",
-  "KBD_CLOSE",
-  "INDEX_OPEN",
-  "INDEX_CLOSE",
-  "REF_CLOSE",
-  "VERB_OPEN",
-  "VERB_CLOSE",
-  "$start",
-  "content",
-  "elements",
-  "element",
-  "emphasis",
-  "code",
-  "var",
-  "keyboard",
-  "index",
-  "reference",
-  "footnote",
-  "verb",
-  "normal_str_ele",
-  "substitute",
-  "ref_label",
-  "ref_label2",
-  "ref_url_strings",
-  "filename",
-  "element_label",
-  "element_label2",
-  "ref_subst_content",
-  "ref_subst_content_q",
-  "ref_subst_strings_q",
-  "ref_subst_strings_first",
-  "ref_subst_ele2",
-  "ref_subst_eles",
-  "ref_subst_str_ele_first",
-  "ref_subst_eles_q",
-  "ref_subst_ele",
-  "ref_subst_ele_q",
-  "ref_subst_str_ele",
-  "ref_subst_str_ele_q",
-  "ref_subst_strings",
-  "ref_subst_string3",
-  "ref_subst_string",
-  "ref_subst_string_q",
-  "ref_subst_string2",
-  "ref_url_string",
-  "verb_strings",
-  "normal_string",
-  "normal_strings",
-  "verb_string",
-  "verb_normal_string" ]
-Ractor.make_shareable(Racc_token_to_s_table) if defined?(Ractor)
-
-Racc_debug_parser = false
-
-##### State transition tables end #####
-
-# reduce 0 omitted
-
-# reduce 1 omitted
-
-def _reduce_2(val, _values, result)
- result.append val[1]
-    result
-end
-
-def _reduce_3(val, _values, result)
- result = val[0]
-    result
-end
-
-# reduce 4 omitted
-
-# reduce 5 omitted
-
-# reduce 6 omitted
-
-# reduce 7 omitted
-
-# reduce 8 omitted
-
-# reduce 9 omitted
-
-# reduce 10 omitted
-
-# reduce 11 omitted
-
-# reduce 12 omitted
-
-def _reduce_13(val, _values, result)
-      content = val[1]
-      result = inline "<em>#{content}</em>", content
-
-    result
-end
-
-def _reduce_14(val, _values, result)
-      content = val[1]
-      result = inline "<code>#{content}</code>", content
-
-    result
-end
-
-def _reduce_15(val, _values, result)
-      content = val[1]
-      result = inline "+#{content}+", content
-
-    result
-end
-
-def _reduce_16(val, _values, result)
-      content = val[1]
-      result = inline "<tt>#{content}</tt>", content
-
-    result
-end
-
-def _reduce_17(val, _values, result)
-      label = val[1]
-      @block_parser.add_label label.reference
-      result = "<span id=\"label-#{label}\">#{label}</span>"
-
-    result
-end
-
-def _reduce_18(val, _values, result)
-      result = "{#{val[1]}}[#{val[2].join}]"
-
-    result
-end
-
-def _reduce_19(val, _values, result)
-      scheme, inline = val[1]
-
-      result = "{#{inline}}[#{scheme}#{inline.reference}]"
-
-    result
-end
-
-def _reduce_20(val, _values, result)
-      result = [nil, inline(val[1])]
-
-    result
-end
-
-def _reduce_21(val, _values, result)
-      result = [
-        'rdoc-label:',
-        inline("#{val[0].reference}/#{val[1].reference}")
-      ]
-
-    result
-end
-
-def _reduce_22(val, _values, result)
-      result = ['rdoc-label:', val[0].reference]
-
-    result
-end
-
-def _reduce_23(val, _values, result)
-      result = ['rdoc-label:', "#{val[0].reference}/"]
-
-    result
-end
-
-def _reduce_24(val, _values, result)
-      result = [nil, inline(val[1])]
-
-    result
-end
-
-def _reduce_25(val, _values, result)
-      result = [
-        'rdoc-label:',
-        inline("#{val[0].reference}/#{val[1].reference}")
-      ]
-
-    result
-end
-
-def _reduce_26(val, _values, result)
-      result = ['rdoc-label:', val[0]]
-
-    result
-end
-
-def _reduce_27(val, _values, result)
-      ref = val[0].reference
-      result = ['rdoc-label:', inline(ref, "#{ref}/")]
-
-    result
-end
-
-# reduce 28 omitted
-
-def _reduce_29(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_30(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_31(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-def _reduce_32(val, _values, result)
-      result = inline "\"#{val[1]}\""
-
-    result
-end
-
-def _reduce_33(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-def _reduce_34(val, _values, result)
-      result = inline "\"#{val[1]}\""
-
-    result
-end
-
-# reduce 35 omitted
-
-def _reduce_36(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_37(val, _values, result)
- result = inline val[1]
-    result
-end
-
-def _reduce_38(val, _values, result)
-      result = val[0].append val[1]
-
-    result
-end
-
-def _reduce_39(val, _values, result)
-      result = val[0].append val[1]
-
-    result
-end
-
-def _reduce_40(val, _values, result)
-      result = val[0]
-
-    result
-end
-
-def _reduce_41(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-# reduce 42 omitted
-
-def _reduce_43(val, _values, result)
-      result = val[0].append val[1]
-
-    result
-end
-
-def _reduce_44(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-def _reduce_45(val, _values, result)
-      result = val[0].append val[1]
-
-    result
-end
-
-def _reduce_46(val, _values, result)
-      result = val[0]
-
-    result
-end
-
-# reduce 47 omitted
-
-# reduce 48 omitted
-
-# reduce 49 omitted
-
-# reduce 50 omitted
-
-# reduce 51 omitted
-
-# reduce 52 omitted
-
-# reduce 53 omitted
-
-# reduce 54 omitted
-
-# reduce 55 omitted
-
-# reduce 56 omitted
-
-def _reduce_57(val, _values, result)
-      result = val[0]
-
-    result
-end
-
-def _reduce_58(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-def _reduce_59(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-def _reduce_60(val, _values, result)
- result << val[1]
-    result
-end
-
-# reduce 61 omitted
-
-def _reduce_62(val, _values, result)
-      result << val[1]
-
-    result
-end
-
-# reduce 63 omitted
-
-def _reduce_64(val, _values, result)
-      result << val[1]
-
-    result
-end
-
-# reduce 65 omitted
-
-# reduce 66 omitted
-
-# reduce 67 omitted
-
-# reduce 68 omitted
-
-# reduce 69 omitted
-
-# reduce 70 omitted
-
-# reduce 71 omitted
-
-# reduce 72 omitted
-
-# reduce 73 omitted
-
-# reduce 74 omitted
-
-# reduce 75 omitted
-
-# reduce 76 omitted
-
-# reduce 77 omitted
-
-def _reduce_78(val, _values, result)
- result << val[1]
-    result
-end
-
-# reduce 79 omitted
-
-# reduce 80 omitted
-
-# reduce 81 omitted
-
-# reduce 82 omitted
-
-# reduce 83 omitted
-
-# reduce 84 omitted
-
-# reduce 85 omitted
-
-# reduce 86 omitted
-
-# reduce 87 omitted
-
-# reduce 88 omitted
-
-# reduce 89 omitted
-
-# reduce 90 omitted
-
-# reduce 91 omitted
-
-# reduce 92 omitted
-
-# reduce 93 omitted
-
-# reduce 94 omitted
-
-# reduce 95 omitted
-
-# reduce 96 omitted
-
-# reduce 97 omitted
-
-# reduce 98 omitted
-
-# reduce 99 omitted
-
-# reduce 100 omitted
-
-def _reduce_101(val, _values, result)
-      index = @block_parser.add_footnote val[1].rdoc
-      result = "{*#{index}}[rdoc-label:foottext-#{index}:footmark-#{index}]"
-
-    result
-end
-
-def _reduce_102(val, _values, result)
-      result = inline "<tt>#{val[1]}</tt>", val[1]
-
-    result
-end
-
-# reduce 103 omitted
-
-# reduce 104 omitted
-
-# reduce 105 omitted
-
-# reduce 106 omitted
-
-# reduce 107 omitted
-
-# reduce 108 omitted
-
-def _reduce_109(val, _values, result)
- result << val[1]
-    result
-end
-
-# reduce 110 omitted
-
-def _reduce_111(val, _values, result)
-      result = inline val[0]
-
-    result
-end
-
-# reduce 112 omitted
-
-def _reduce_113(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_114(val, _values, result)
- result = val[1]
-    result
-end
-
-def _reduce_115(val, _values, result)
- result = val[1]
-    result
-end
-
-# reduce 116 omitted
-
-# reduce 117 omitted
-
-# reduce 118 omitted
-
-# reduce 119 omitted
-
-# reduce 120 omitted
-
-# reduce 121 omitted
-
-# reduce 122 omitted
-
-# reduce 123 omitted
-
-# reduce 124 omitted
-
-# reduce 125 omitted
-
-# reduce 126 omitted
-
-# reduce 127 omitted
-
-# reduce 128 omitted
-
-# reduce 129 omitted
-
-# reduce 130 omitted
-
-# reduce 131 omitted
-
-# reduce 132 omitted
-
-# reduce 133 omitted
-
-# reduce 134 omitted
-
-# reduce 135 omitted
-
-def _reduce_136(val, _values, result)
- result << val[1]
-    result
-end
-
-# reduce 137 omitted
-
-def _reduce_none(val, _values, result)
-  val[0]
-end
-
-end   # class InlineParser
-
-end
diff --git a/lib/rdoc/rdoc.gemspec b/lib/rdoc/rdoc.gemspec
deleted file mode 100644
index 93a281c8ae..0000000000
--- a/lib/rdoc/rdoc.gemspec
+++ /dev/null
@@ -1,237 +0,0 @@
-begin
-  require_relative "lib/rdoc/version"
-rescue LoadError
-  # for Ruby repository
-  require_relative "version"
-end
-
-Gem::Specification.new do |s|
-  s.name = "rdoc"
-  s.version = RDoc::VERSION
-
-  s.authors = [
-    "Eric Hodel",
-    "Dave Thomas",
-    "Phil Hagelberg",
-    "Tony Strauss",
-    "Zachary Scott",
-    "Hiroshi SHIBATA",
-    "ITOYANAGI Sakura"
-  ]
-  s.email = ["drbrain@segment7.net", "", "", "", "mail@zzak.io", "hsbt@ruby-lang.org", "aycabta@gmail.com"]
-
-  s.summary = "RDoc produces HTML and command-line documentation for Ruby projects"
-  s.description = <<-DESCRIPTION
-RDoc produces HTML and command-line documentation for Ruby projects.
-RDoc includes the +rdoc+ and +ri+ tools for generating and displaying documentation from the command-line.
-  DESCRIPTION
-  s.homepage = "https://ruby.github.io/rdoc"
-  s.licenses = ["Ruby"]
-
-  s.metadata["homepage_uri"] = s.homepage
-  s.metadata["source_code_uri"] = "https://github.com/ruby/rdoc"
-  s.metadata["changelog_uri"] = "#{s.metadata["source_code_uri"]}/releases"
-
-  s.bindir = "exe"
-  s.executables = ["rdoc", "ri"]
-  s.require_paths = ["lib"]
-  # for ruby core repository. It was generated by
-  # `git ls-files -z`.split("\x0").each {|f| puts "    #{f.dump}," unless f.start_with?(*%W[test/ spec/ features/ .]) }
-  s.files = [
-    "CONTRIBUTING.rdoc",
-    "CVE-2013-0256.rdoc",
-    "ExampleMarkdown.md",
-    "ExampleRDoc.rdoc",
-    "History.rdoc",
-    "LEGAL.rdoc",
-    "LICENSE.rdoc",
-    "README.rdoc",
-    "RI.rdoc",
-    "TODO.rdoc",
-    "exe/rdoc",
-    "exe/ri",
-    "lib/rdoc.rb",
-    "lib/rdoc/alias.rb",
-    "lib/rdoc/anon_class.rb",
-    "lib/rdoc/any_method.rb",
-    "lib/rdoc/attr.rb",
-    "lib/rdoc/class_module.rb",
-    "lib/rdoc/code_object.rb",
-    "lib/rdoc/code_objects.rb",
-    "lib/rdoc/comment.rb",
-    "lib/rdoc/constant.rb",
-    "lib/rdoc/context.rb",
-    "lib/rdoc/context/section.rb",
-    "lib/rdoc/cross_reference.rb",
-    "lib/rdoc/encoding.rb",
-    "lib/rdoc/erb_partial.rb",
-    "lib/rdoc/erbio.rb",
-    "lib/rdoc/extend.rb",
-    "lib/rdoc/generator.rb",
-    "lib/rdoc/generator/darkfish.rb",
-    "lib/rdoc/generator/json_index.rb",
-    "lib/rdoc/generator/markup.rb",
-    "lib/rdoc/generator/pot.rb",
-    "lib/rdoc/generator/pot/message_extractor.rb",
-    "lib/rdoc/generator/pot/po.rb",
-    "lib/rdoc/generator/pot/po_entry.rb",
-    "lib/rdoc/generator/ri.rb",
-    "lib/rdoc/generator/template/darkfish/.document",
-    "lib/rdoc/generator/template/darkfish/_footer.rhtml",
-    "lib/rdoc/generator/template/darkfish/_head.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_VCS_info.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_classes.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_extends.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_in_files.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_includes.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_installed.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_methods.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_navigation.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_pages.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_parent.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_search.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_sections.rhtml",
-    "lib/rdoc/generator/template/darkfish/_sidebar_table_of_contents.rhtml",
-    "lib/rdoc/generator/template/darkfish/class.rhtml",
-    "lib/rdoc/generator/template/darkfish/css/fonts.css",
-    "lib/rdoc/generator/template/darkfish/css/rdoc.css",
-    "lib/rdoc/generator/template/darkfish/fonts/Lato-Light.ttf",
-    "lib/rdoc/generator/template/darkfish/fonts/Lato-LightItalic.ttf",
-    "lib/rdoc/generator/template/darkfish/fonts/Lato-Regular.ttf",
-    "lib/rdoc/generator/template/darkfish/fonts/Lato-RegularItalic.ttf",
-    "lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Bold.ttf",
-    "lib/rdoc/generator/template/darkfish/fonts/SourceCodePro-Regular.ttf",
-    "lib/rdoc/generator/template/darkfish/images/add.png",
-    "lib/rdoc/generator/template/darkfish/images/arrow_up.png",
-    "lib/rdoc/generator/template/darkfish/images/brick.png",
-    "lib/rdoc/generator/template/darkfish/images/brick_link.png",
-    "lib/rdoc/generator/template/darkfish/images/bug.png",
-    "lib/rdoc/generator/template/darkfish/images/bullet_black.png",
-    "lib/rdoc/generator/template/darkfish/images/bullet_toggle_minus.png",
-    "lib/rdoc/generator/template/darkfish/images/bullet_toggle_plus.png",
-    "lib/rdoc/generator/template/darkfish/images/date.png",
-    "lib/rdoc/generator/template/darkfish/images/delete.png",
-    "lib/rdoc/generator/template/darkfish/images/find.png",
-    "lib/rdoc/generator/template/darkfish/images/loadingAnimation.gif",
-    "lib/rdoc/generator/template/darkfish/images/macFFBgHack.png",
-    "lib/rdoc/generator/template/darkfish/images/package.png",
-    "lib/rdoc/generator/template/darkfish/images/page_green.png",
-    "lib/rdoc/generator/template/darkfish/images/page_white_text.png",
-    "lib/rdoc/generator/template/darkfish/images/page_white_width.png",
-    "lib/rdoc/generator/template/darkfish/images/plugin.png",
-    "lib/rdoc/generator/template/darkfish/images/ruby.png",
-    "lib/rdoc/generator/template/darkfish/images/tag_blue.png",
-    "lib/rdoc/generator/template/darkfish/images/tag_green.png",
-    "lib/rdoc/generator/template/darkfish/images/transparent.png",
-    "lib/rdoc/generator/template/darkfish/images/wrench.png",
-    "lib/rdoc/generator/template/darkfish/images/wrench_orange.png",
-    "lib/rdoc/generator/template/darkfish/images/zoom.png",
-    "lib/rdoc/generator/template/darkfish/index.rhtml",
-    "lib/rdoc/generator/template/darkfish/js/darkfish.js",
-    "lib/rdoc/generator/template/darkfish/js/search.js",
-    "lib/rdoc/generator/template/darkfish/page.rhtml",
-    "lib/rdoc/generator/template/darkfish/servlet_not_found.rhtml",
-    "lib/rdoc/generator/template/darkfish/servlet_root.rhtml",
-    "lib/rdoc/generator/template/darkfish/table_of_contents.rhtml",
-    "lib/rdoc/generator/template/json_index/.document",
-    "lib/rdoc/generator/template/json_index/js/navigation.js",
-    "lib/rdoc/generator/template/json_index/js/searcher.js",
-    "lib/rdoc/ghost_method.rb",
-    "lib/rdoc/i18n.rb",
-    "lib/rdoc/i18n/locale.rb",
-    "lib/rdoc/i18n/text.rb",
-    "lib/rdoc/include.rb",
-    "lib/rdoc/known_classes.rb",
-    "lib/rdoc/markdown.kpeg",
-    "lib/rdoc/markdown/entities.rb",
-    "lib/rdoc/markdown/literals.kpeg",
-    "lib/rdoc/markup.rb",
-    "lib/rdoc/markup/attr_changer.rb",
-    "lib/rdoc/markup/attr_span.rb",
-    "lib/rdoc/markup/attribute_manager.rb",
-    "lib/rdoc/markup/attributes.rb",
-    "lib/rdoc/markup/blank_line.rb",
-    "lib/rdoc/markup/block_quote.rb",
-    "lib/rdoc/markup/document.rb",
-    "lib/rdoc/markup/formatter.rb",
-    "lib/rdoc/markup/hard_break.rb",
-    "lib/rdoc/markup/heading.rb",
-    "lib/rdoc/markup/include.rb",
-    "lib/rdoc/markup/indented_paragraph.rb",
-    "lib/rdoc/markup/list.rb",
-    "lib/rdoc/markup/list_item.rb",
-    "lib/rdoc/markup/paragraph.rb",
-    "lib/rdoc/markup/parser.rb",
-    "lib/rdoc/markup/pre_process.rb",
-    "lib/rdoc/markup/raw.rb",
-    "lib/rdoc/markup/regexp_handling.rb",
-    "lib/rdoc/markup/rule.rb",
-    "lib/rdoc/markup/table.rb",
-    "lib/rdoc/markup/to_ansi.rb",
-    "lib/rdoc/markup/to_bs.rb",
-    "lib/rdoc/markup/to_html.rb",
-    "lib/rdoc/markup/to_html_crossref.rb",
-    "lib/rdoc/markup/to_html_snippet.rb",
-    "lib/rdoc/markup/to_joined_paragraph.rb",
-    "lib/rdoc/markup/to_label.rb",
-    "lib/rdoc/markup/to_markdown.rb",
-    "lib/rdoc/markup/to_rdoc.rb",
-    "lib/rdoc/markup/to_table_of_contents.rb",
-    "lib/rdoc/markup/to_test.rb",
-    "lib/rdoc/markup/to_tt_only.rb",
-    "lib/rdoc/markup/verbatim.rb",
-    "lib/rdoc/meta_method.rb",
-    "lib/rdoc/method_attr.rb",
-    "lib/rdoc/mixin.rb",
-    "lib/rdoc/normal_class.rb",
-    "lib/rdoc/normal_module.rb",
-    "lib/rdoc/options.rb",
-    "lib/rdoc/parser.rb",
-    "lib/rdoc/parser/c.rb",
-    "lib/rdoc/parser/changelog.rb",
-    "lib/rdoc/parser/markdown.rb",
-    "lib/rdoc/parser/rd.rb",
-    "lib/rdoc/parser/ripper_state_lex.rb",
-    "lib/rdoc/parser/ruby.rb",
-    "lib/rdoc/parser/ruby_tools.rb",
-    "lib/rdoc/parser/simple.rb",
-    "lib/rdoc/parser/text.rb",
-    "lib/rdoc/rd.rb",
-    "lib/rdoc/rd/block_parser.ry",
-    "lib/rdoc/rd/inline.rb",
-    "lib/rdoc/rd/inline_parser.ry",
-    "lib/rdoc/rdoc.rb",
-    "lib/rdoc/require.rb",
-    "lib/rdoc/ri.rb",
-    "lib/rdoc/ri/driver.rb",
-    "lib/rdoc/ri/formatter.rb",
-    "lib/rdoc/ri/paths.rb",
-    "lib/rdoc/ri/store.rb",
-    "lib/rdoc/ri/task.rb",
-    "lib/rdoc/rubygems_hook.rb",
-    "lib/rdoc/servlet.rb",
-    "lib/rdoc/single_class.rb",
-    "lib/rdoc/stats.rb",
-    "lib/rdoc/stats/normal.rb",
-    "lib/rdoc/stats/quiet.rb",
-    "lib/rdoc/stats/verbose.rb",
-    "lib/rdoc/store.rb",
-    "lib/rdoc/task.rb",
-    "lib/rdoc/text.rb",
-    "lib/rdoc/token_stream.rb",
-    "lib/rdoc/tom_doc.rb",
-    "lib/rdoc/top_level.rb",
-    "lib/rdoc/version.rb",
-    "man/ri.1",
-  ]
-  # files from .gitignore
-  s.files << "lib/rdoc/rd/block_parser.rb" << "lib/rdoc/rd/inline_parser.rb" << "lib/rdoc/markdown.rb" << "lib/rdoc/markdown/literals.rb"
-
-  s.rdoc_options = ["--main", "README.rdoc"]
-  s.extra_rdoc_files += s.files.grep(%r[\A[^\/]+\.(?:rdoc|md)\z])
-
-  s.required_ruby_version = Gem::Requirement.new(">= 2.6.0")
-  s.required_rubygems_version = Gem::Requirement.new(">= 2.2")
-
-  s.add_dependency 'psych', '>= 4.0.0'
-end
diff --git a/lib/rdoc/rdoc.rb b/lib/rdoc/rdoc.rb
deleted file mode 100644
index 2da6d9b575..0000000000
--- a/lib/rdoc/rdoc.rb
+++ /dev/null
@@ -1,563 +0,0 @@
-# frozen_string_literal: true
-require_relative '../rdoc'
-
-require 'find'
-require 'fileutils'
-require 'pathname'
-require 'time'
-
-##
-# This is the driver for generating RDoc output.  It handles file parsing and
-# generation of output.
-#
-# To use this class to generate RDoc output via the API, the recommended way
-# is:
-#
-#   rdoc = RDoc::RDoc.new
-#   options = RDoc::Options.load_options # returns an RDoc::Options instance
-#   # set extra options
-#   rdoc.document options
-#
-# You can also generate output like the +rdoc+ executable:
-#
-#   rdoc = RDoc::RDoc.new
-#   rdoc.document argv
-#
-# Where +argv+ is an array of strings, each corresponding to an argument you'd
-# give rdoc on the command line.  See <tt>rdoc --help</tt> for details.
-
-class RDoc::RDoc
-
-  @current = nil
-
-  ##
-  # This is the list of supported output generators
-
-  GENERATORS = {}
-
-  ##
-  # List of directory names always skipped
-
-  UNCONDITIONALLY_SKIPPED_DIRECTORIES = %w[CVS .svn .git].freeze
-
-  ##
-  # List of directory names skipped if test suites should be skipped
-
-  TEST_SUITE_DIRECTORY_NAMES = %w[spec test].freeze
-
-
-  ##
-  # Generator instance used for creating output
-
-  attr_accessor :generator
-
-  ##
-  # Hash of files and their last modified times.
-
-  attr_reader :last_modified
-
-  ##
-  # RDoc options
-
-  attr_accessor :options
-
-  ##
-  # Accessor for statistics.  Available after each call to parse_files
-
-  attr_reader :stats
-
-  ##
-  # The current documentation store
-
-  attr_reader :store
-
-  ##
-  # Add +klass+ that can generate output after parsing
-
-  def self.add_generator(klass)
-    name = klass.name.sub(/^RDoc::Generator::/, '').downcase
-    GENERATORS[name] = klass
-  end
-
-  ##
-  # Active RDoc::RDoc instance
-
-  def self.current
-    @current
-  end
-
-  ##
-  # Sets the active RDoc::RDoc instance
-
-  def self.current= rdoc
-    @current = rdoc
-  end
-
-  ##
-  # Creates a new RDoc::RDoc instance.  Call #document to parse files and
-  # generate documentation.
-
-  def initialize
-    @current       = nil
-    @generator     = nil
-    @last_modified = {}
-    @old_siginfo   = nil
-    @options       = nil
-    @stats         = nil
-    @store         = nil
-  end
-
-  ##
-  # Report an error message and exit
-
-  def error(msg)
-    raise RDoc::Error, msg
-  end
-
-  ##
-  # Gathers a set of parseable files from the files and directories listed in
-  # +files+.
-
-  def gather_files files
-    files = [@options.root.to_s] if files.empty?
-
-    file_list = normalized_file_list files, true, @options.exclude
-
-    file_list = remove_unparseable(file_list)
-
-    if file_list.count {|name, mtime|
-         file_list[name] = @last_modified[name] unless mtime
-         mtime
-       } > 0
-      @last_modified.replace file_list
-      file_list.keys.sort
-    else
-      []
-    end
-  end
-
-  ##
-  # Turns RDoc from stdin into HTML
-
-  def handle_pipe
-    @html = RDoc::Markup::ToHtml.new @options
-
-    parser = RDoc::Text::MARKUP_FORMAT[@options.markup]
-
-    document = parser.parse $stdin.read
-
-    out = @html.convert document
-
-    $stdout.write out
-  end
-
-  ##
-  # Installs a siginfo handler that prints the current filename.
-
-  def install_siginfo_handler
-    return unless Signal.list.include? 'INFO'
-
-    @old_siginfo = trap 'INFO' do
-      puts @current if @current
-    end
-  end
-
-  ##
-  # Create an output dir if it doesn't exist. If it does exist, but doesn't
-  # contain the flag file <tt>created.rid</tt> then we refuse to use it, as
-  # we may clobber some manually generated documentation
-
-  def setup_output_dir(dir, force)
-    flag_file = output_flag_file dir
-
-    last = {}
-
-    if @options.dry_run then
-      # do nothing
-    elsif File.exist? dir then
-      error "#{dir} exists and is not a directory" unless File.directory? dir
-
-      begin
-        File.open flag_file do |io|
-          unless force then
-            Time.parse io.gets
-
-            io.each do |line|
-              file, time = line.split "\t", 2
-              time = Time.parse(time) rescue next
-              last[file] = time
-            end
-          end
-        end
-      rescue SystemCallError, TypeError
-        error <<-ERROR
-
-Directory #{dir} already exists, but it looks like it isn't an RDoc directory.
-
-Because RDoc doesn't want to risk destroying any of your existing files,
-you'll need to specify a different output directory name (using the --op <dir>
-option)
-
-        ERROR
-      end unless @options.force_output
-    else
-      FileUtils.mkdir_p dir
-      FileUtils.touch flag_file
-    end
-
-    last
-  end
-
-  ##
-  # Sets the current documentation tree to +store+ and sets the store's rdoc
-  # driver to this instance.
-
-  def store= store
-    @store = store
-    @store.rdoc = self
-  end
-
-  ##
-  # Update the flag file in an output directory.
-
-  def update_output_dir(op_dir, time, last = {})
-    return if @options.dry_run or not @options.update_output_dir
-    unless ENV['SOURCE_DATE_EPOCH'].nil?
-      time = Time.at(ENV['SOURCE_DATE_EPOCH'].to_i).gmtime
-    end
-
-    File.open output_flag_file(op_dir), "w" do |f|
-      f.puts time.rfc2822
-      last.each do |n, t|
-        f.puts "#{n}\t#{t.rfc2822}"
-      end
-    end
-  end
-
-  ##
-  # Return the path name of the flag file in an output directory.
-
-  def output_flag_file(op_dir)
-    File.join op_dir, "created.rid"
-  end
-
-  ##
-  # The .document file contains a list of file and directory name patterns,
-  # representing candidates for documentation. It may also contain comments
-  # (starting with '#')
-
-  def parse_dot_doc_file in_dir, filename
-    # read and strip comments
-    patterns = File.read(filename).gsub(/#.*/, '')
-
-    result = {}
-
-    patterns.split(' ').each do |patt|
-      candidates = Dir.glob(File.join(in_dir, patt))
-      result.update normalized_file_list(candidates, false, @options.exclude)
-    end
-
-    result
-  end
-
-  ##
-  # Given a list of files and directories, create a list of all the Ruby
-  # files they contain.
-  #
-  # If +force_doc+ is true we always add the given files, if false, only
-  # add files that we guarantee we can parse.  It is true when looking at
-  # files given on the command line, false when recursing through
-  # subdirectories.
-  #
-  # The effect of this is that if you want a file with a non-standard
-  # extension parsed, you must name it explicitly.
-
-  def normalized_file_list(relative_files, force_doc = false,
-                           exclude_pattern = nil)
-    file_list = {}
-
-    relative_files.each do |rel_file_name|
-      rel_file_name = rel_file_name.sub(/^\.\//, '')
-      next if rel_file_name.end_with? 'created.rid'
-      next if exclude_pattern && exclude_pattern =~ rel_file_name
-      stat = File.stat rel_file_name rescue next
-
-      case type = stat.ftype
-      when "file" then
-        mtime = (stat.mtime unless (last_modified = @last_modified[rel_file_name] and
-                                    stat.mtime.to_i <= last_modified.to_i))
-
-        if force_doc or RDoc::Parser.can_parse(rel_file_name) then
-          file_list[rel_file_name] = mtime
-        end
-      when "directory" then
-        next if UNCONDITIONALLY_SKIPPED_DIRECTORIES.include?(rel_file_name)
-
-        basename = File.basename(rel_file_name)
-        next if options.skip_tests && TEST_SUITE_DIRECTORY_NAMES.include?(basename)
-
-        created_rid = File.join rel_file_name, "created.rid"
-        next if File.file? created_rid
-
-        dot_doc = File.join rel_file_name, RDoc::DOT_DOC_FILENAME
-
-        if File.file? dot_doc then
-          file_list.update(parse_dot_doc_file(rel_file_name, dot_doc))
-        else
-          file_list.update(list_files_in_directory(rel_file_name))
-        end
-      else
-        warn "rdoc can't parse the #{type} #{rel_file_name}"
-      end
-    end
-
-    file_list
-  end
-
-  ##
-  # Return a list of the files to be processed in a directory. We know that
-  # this directory doesn't have a .document file, so we're looking for real
-  # files. However we may well contain subdirectories which must be tested
-  # for .document files.
-
-  def list_files_in_directory dir
-    files = Dir.glob File.join(dir, "*")
-
-    normalized_file_list files, false, @options.exclude
-  end
-
-  ##
-  # Parses +filename+ and returns an RDoc::TopLevel
-
-  def parse_file filename
-    encoding = @options.encoding
-    filename = filename.encode encoding
-
-    @stats.add_file filename
-
-    return if RDoc::Parser.binary? filename
-
-    content = RDoc::Encoding.read_file filename, encoding
-
-    return unless content
-
-    filename_path = Pathname(filename).expand_path
-    begin
-      relative_path = filename_path.relative_path_from @options.root
-    rescue ArgumentError
-      relative_path = filename_path
-    end
-
-    if @options.page_dir and
-       relative_path.to_s.start_with? @options.page_dir.to_s then
-      relative_path =
-        relative_path.relative_path_from @options.page_dir
-    end
-
-    top_level = @store.add_file filename, relative_name: relative_path.to_s
-
-    parser = RDoc::Parser.for top_level, filename, content, @options, @stats
-
-    return unless parser
-
-    parser.scan
-
-    # restart documentation for the classes & modules found
-    top_level.classes_or_modules.each do |cm|
-      cm.done_documenting = false
-    end
-
-    top_level
-
-  rescue Errno::EACCES => e
-    $stderr.puts <<-EOF
-Unable to read #{filename}, #{e.message}
-
-Please check the permissions for this file.  Perhaps you do not have access to
-it or perhaps the original author's permissions are to restrictive.  If the
-this is not your library please report a bug to the author.
-    EOF
-  rescue => e
-    $stderr.puts <<-EOF
-Before reporting this, could you check that the file you're documenting
-has proper syntax:
-
-  #{Gem.ruby} -c #{filename}
-
-RDoc is not a full Ruby parser and will fail when fed invalid ruby programs.
-
-The internal error was:
-
-\t(#{e.class}) #{e.message}
-
-    EOF
-
-    $stderr.puts e.backtrace.join("\n\t") if $DEBUG_RDOC
-
-    raise e
-    nil
-  end
-
-  ##
-  # Parse each file on the command line, recursively entering directories.
-
-  def parse_files files
-    file_list = gather_files files
-    @stats = RDoc::Stats.new @store, file_list.length, @options.verbosity
-
-    return [] if file_list.empty?
-
-    original_options = @options.dup
-    @stats.begin_adding
-
-    file_info = file_list.map do |filename|
-      @current = filename
-      parse_file filename
-    end.compact
-
-    @stats.done_adding
-    @options = original_options
-
-    file_info
-  end
-
-  ##
-  # Removes file extensions known to be unparseable from +files+ and TAGS
-  # files for emacs and vim.
-
-  def remove_unparseable files
-    files.reject do |file, *|
-      file =~ /\.(?:class|eps|erb|scpt\.txt|svg|ttf|yml)$/i or
-        (file =~ /tags$/i and
-         /\A(\f\n[^,]+,\d+$|!_TAG_)/.match?(File.binread(file, 100)))
-    end
-  end
-
-  ##
-  # Generates documentation or a coverage report depending upon the settings
-  # in +options+.
-  #
-  # +options+ can be either an RDoc::Options instance or an array of strings
-  # equivalent to the strings that would be passed on the command line like
-  # <tt>%w[-q -o doc -t My\ Doc\ Title]</tt>.  #document will automatically
-  # call RDoc::Options#finish if an options instance was given.
-  #
-  # For a list of options, see either RDoc::Options or <tt>rdoc --help</tt>.
-  #
-  # By default, output will be stored in a directory called "doc" below the
-  # current directory, so make sure you're somewhere writable before invoking.
-
-  def document options
-    self.store = RDoc::Store.new
-
-    if RDoc::Options === options then
-      @options = options
-    else
-      @options = RDoc::Options.load_options
-      @options.parse options
-    end
-    @options.finish
-
-    if @options.pipe then
-      handle_pipe
-      exit
-    end
-
-    unless @options.coverage_report then
-      @last_modified = setup_output_dir @options.op_dir, @options.force_update
-    end
-
-    @store.encoding = @options.encoding
-    @store.dry_run  = @options.dry_run
-    @store.main     = @options.main_page
-    @store.title    = @options.title
-    @store.path     = @options.op_dir
-
-    @start_time = Time.now
-
-    @store.load_cache
-
-    file_info = parse_files @options.files
-
-    @options.default_title = "RDoc Documentation"
-
-    @store.complete @options.visibility
-
-    @stats.coverage_level = @options.coverage_report
-
-    if @options.coverage_report then
-      puts
-
-      puts @stats.report.accept RDoc::Markup::ToRdoc.new
-    elsif file_info.empty? then
-      $stderr.puts "\nNo newer files." unless @options.quiet
-    else
-      gen_klass = @options.generator
-
-      @generator = gen_klass.new @store, @options
-
-      generate
-    end
-
-    if @stats and (@options.coverage_report or not @options.quiet) then
-      puts
-      puts @stats.summary.accept RDoc::Markup::ToRdoc.new
-    end
-
-    exit @stats.fully_documented? if @options.coverage_report
-  end
-
-  ##
-  # Generates documentation for +file_info+ (from #parse_files) into the
-  # output dir using the generator selected
-  # by the RDoc options
-
-  def generate
-    if @options.dry_run then
-      # do nothing
-      @generator.generate
-    else
-      Dir.chdir @options.op_dir do
-        unless @options.quiet then
-          $stderr.puts "\nGenerating #{@generator.class.name.sub(/^.*::/, '')} format into #{Dir.pwd}..."
-        end
-
-        @generator.generate
-        update_output_dir '.', @start_time, @last_modified
-      end
-    end
-  end
-
-  ##
-  # Removes a siginfo handler and replaces the previous
-
-  def remove_siginfo_handler
-    return unless Signal.list.key? 'INFO'
-
-    handler = @old_siginfo || 'DEFAULT'
-
-    trap 'INFO', handler
-  end
-
-end
-
-begin
-  require 'rubygems'
-
-  rdoc_extensions = Gem.find_files 'rdoc/discover'
-
-  rdoc_extensions.each do |extension|
-    begin
-      load extension
-    rescue => e
-      warn "error loading #{extension.inspect}: #{e.message} (#{e.class})"
-      warn "\t#{e.backtrace.join "\n\t"}" if $DEBUG
-    end
-  end
-rescue LoadError
-end
-
-# require built-in generators after discovery in case they've been replaced
-require_relative 'generator/darkfish'
-require_relative 'generator/ri'
-require_relative 'generator/pot'
diff --git a/lib/rdoc/require.rb b/lib/rdoc/require.rb
deleted file mode 100644
index 05e26b84b0..0000000000
--- a/lib/rdoc/require.rb
+++ /dev/null
@@ -1,51 +0,0 @@
-# frozen_string_literal: true
-##
-# A file loaded by \#require
-
-class RDoc::Require < RDoc::CodeObject
-
-  ##
-  # Name of the required file
-
-  attr_accessor :name
-
-  ##
-  # Creates a new Require that loads +name+ with +comment+
-
-  def initialize(name, comment)
-    super()
-    @name = name.gsub(/'|"/, "") #'
-    @top_level = nil
-    self.comment = comment
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x require '%s' in %s>" % [
-      self.class,
-      object_id,
-      @name,
-      parent_file_name,
-    ]
-  end
-
-  def to_s # :nodoc:
-    "require #{name} in: #{parent}"
-  end
-
-  ##
-  # The RDoc::TopLevel corresponding to this require, or +nil+ if not found.
-
-  def top_level
-    @top_level ||= begin
-      tl = RDoc::TopLevel.all_files_hash[name + '.rb']
-
-      if tl.nil? and RDoc::TopLevel.all_files.first.full_name =~ %r(^lib/) then
-        # second chance
-        tl = RDoc::TopLevel.all_files_hash['lib/' + name + '.rb']
-      end
-
-      tl
-    end
-  end
-
-end
diff --git a/lib/rdoc/ri.rb b/lib/rdoc/ri.rb
deleted file mode 100644
index 0af05f729f..0000000000
--- a/lib/rdoc/ri.rb
+++ /dev/null
@@ -1,20 +0,0 @@
-# frozen_string_literal: true
-require_relative '../rdoc'
-
-##
-# Namespace for the ri command line tool's implementation.
-#
-# See <tt>ri --help</tt> for details.
-
-module RDoc::RI
-
-  ##
-  # Base RI error class
-
-  class Error < RDoc::Error; end
-
-  autoload :Driver, "#{__dir__}/ri/driver"
-  autoload :Paths,  "#{__dir__}/ri/paths"
-  autoload :Store,  "#{__dir__}/ri/store"
-
-end
diff --git a/lib/rdoc/ri/driver.rb b/lib/rdoc/ri/driver.rb
deleted file mode 100644
index c6fddbac67..0000000000
--- a/lib/rdoc/ri/driver.rb
+++ /dev/null
@@ -1,1517 +0,0 @@
-# frozen_string_literal: true
-require 'optparse'
-
-require_relative '../../rdoc'
-
-require_relative 'formatter' # For RubyGems backwards compatibility
-# TODO: Fix weird documentation with `require_relative`
-
-##
-# The RI driver implements the command-line ri tool.
-#
-# The driver supports:
-# * loading RI data from:
-#   * Ruby's standard library
-#   * RubyGems
-#   * ~/.rdoc
-#   * A user-supplied directory
-# * Paging output (uses RI_PAGER environment variable, PAGER environment
-#   variable or the less, more and pager programs)
-# * Interactive mode with tab-completion
-# * Abbreviated names (ri Zl shows Zlib documentation)
-# * Colorized output
-# * Merging output from multiple RI data sources
-
-class RDoc::RI::Driver
-
-  ##
-  # Base Driver error class
-
-  class Error < RDoc::RI::Error; end
-
-  ##
-  # Raised when a name isn't found in the ri data stores
-
-  class NotFoundError < Error
-
-    def initialize(klass, suggestion_proc = nil) # :nodoc:
-      @klass = klass
-      @suggestion_proc = suggestion_proc
-    end
-
-    ##
-    # Name that wasn't found
-
-    def name
-      @klass
-    end
-
-    def message # :nodoc:
-      str = "Nothing known about #{@klass}"
-      suggestions = @suggestion_proc&.call
-      if suggestions and !suggestions.empty?
-        str += "\nDid you mean?  #{suggestions.join("\n               ")}"
-      end
-      str
-    end
-  end
-
-  ##
-  # Show all method documentation following a class or module
-
-  attr_accessor :show_all
-
-  ##
-  # An RDoc::RI::Store for each entry in the RI path
-
-  attr_accessor :stores
-
-  ##
-  # Controls the user of the pager vs $stdout
-
-  attr_accessor :use_stdout
-
-  ##
-  # Default options for ri
-
-  def self.default_options
-    options = {}
-    options[:interactive] = false
-    options[:profile]     = false
-    options[:show_all]    = false
-    options[:use_stdout]  = !$stdout.tty?
-    options[:width]       = 72
-
-    # By default all standard paths are used.
-    options[:use_system]     = true
-    options[:use_site]       = true
-    options[:use_home]       = true
-    options[:use_gems]       = true
-    options[:extra_doc_dirs] = []
-
-    return options
-  end
-
-  ##
-  # Dump +data_path+ using pp
-
-  def self.dump data_path
-    require 'pp'
-
-    File.open data_path, 'rb' do |io|
-      pp Marshal.load(io.read)
-    end
-  end
-
-  ##
-  # Parses +argv+ and returns a Hash of options
-
-  def self.process_args argv
-    options = default_options
-
-    opts = OptionParser.new do |opt|
-      opt.program_name = File.basename $0
-      opt.version = RDoc::VERSION
-      opt.release = nil
-      opt.summary_indent = ' ' * 4
-
-      opt.banner = <<-EOT
-Usage: #{opt.program_name} [options] [name ...]
-
-Where name can be:
-
-  Class | Module | Module::Class
-
-  Class::method | Class#method | Class.method | method
-
-  gem_name: | gem_name:README | gem_name:History
-
-  ruby: | ruby:NEWS | ruby:globals
-
-All class names may be abbreviated to their minimum unambiguous form.
-If a name is ambiguous, all valid options will be listed.
-
-A '.' matches either class or instance methods, while #method
-matches only instance and ::method matches only class methods.
-
-README and other files may be displayed by prefixing them with the gem name
-they're contained in.  If the gem name is followed by a ':' all files in the
-gem will be shown.  The file name extension may be omitted where it is
-unambiguous.
-
-'ruby' can be used as a pseudo gem name to display files from the Ruby
-core documentation. Use 'ruby:' by itself to get a list of all available
-core documentation files.
-
-For example:
-
-    #{opt.program_name} Fil
-    #{opt.program_name} File
-    #{opt.program_name} File.new
-    #{opt.program_name} zip
-    #{opt.program_name} rdoc:README
-    #{opt.program_name} ruby:comments
-
-Note that shell quoting or escaping may be required for method names
-containing punctuation:
-
-    #{opt.program_name} 'Array.[]'
-    #{opt.program_name} compact\\!
-
-To see the default directories #{opt.program_name} will search, run:
-
-    #{opt.program_name} --list-doc-dirs
-
-Specifying the --system, --site, --home, --gems, or --doc-dir options
-will limit ri to searching only the specified directories.
-
-ri options may be set in the RI environment variable.
-
-The ri pager can be set with the RI_PAGER environment variable
-or the PAGER environment variable.
-      EOT
-
-      opt.separator nil
-      opt.separator "Options:"
-
-      opt.separator nil
-
-      opt.on("--[no-]interactive", "-i",
-             "In interactive mode you can repeatedly",
-             "look up methods with autocomplete.") do |interactive|
-        options[:interactive] = interactive
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]all", "-a",
-             "Show all documentation for a class or",
-             "module.") do |show_all|
-        options[:show_all] = show_all
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]list", "-l",
-             "List classes ri knows about.") do |list|
-        options[:list] = list
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]pager",
-             "Send output to a pager,",
-             "rather than directly to stdout.") do |use_pager|
-        options[:use_stdout] = !use_pager
-      end
-
-      opt.separator nil
-
-      opt.on("-T",
-             "Synonym for --no-pager.") do
-        options[:use_stdout] = true
-      end
-
-      opt.separator nil
-
-      opt.on("--width=WIDTH", "-w", OptionParser::DecimalInteger,
-             "Set the width of the output.") do |width|
-        options[:width] = width
-      end
-
-      opt.separator nil
-
-      opt.on("--server[=PORT]", Integer,
-             "Run RDoc server on the given port.",
-             "The default port is 8214.") do |port|
-        options[:server] = port || 8214
-      end
-
-      opt.separator nil
-
-      formatters = RDoc::Markup.constants.grep(/^To[A-Z][a-z]+$/).sort
-      formatters = formatters.sort.map do |formatter|
-        formatter.to_s.sub('To', '').downcase
-      end
-      formatters -= %w[html label test] # remove useless output formats
-
-      opt.on("--format=NAME", "-f",
-             "Use the selected formatter.  The default",
-             "formatter is bs for paged output and ansi",
-             "otherwise.  Valid formatters are:",
-             "#{formatters.join(', ')}.", formatters) do |value|
-        options[:formatter] = RDoc::Markup.const_get "To#{value.capitalize}"
-      end
-
-      opt.separator nil
-
-      opt.on("--help", "-h",
-             "Show help and exit.") do
-        puts opts
-        exit
-      end
-
-      opt.separator nil
-
-      opt.on("--version", "-v",
-             "Output version information and exit.") do
-        puts "#{opts.program_name} #{opts.version}"
-        exit
-      end
-
-      opt.separator nil
-      opt.separator "Data source options:"
-      opt.separator nil
-
-      opt.on("--[no-]list-doc-dirs",
-             "List the directories from which ri will",
-             "source documentation on stdout and exit.") do |list_doc_dirs|
-        options[:list_doc_dirs] = list_doc_dirs
-      end
-
-      opt.separator nil
-
-      opt.on("--doc-dir=DIRNAME", "-d", Array,
-             "List of directories from which to source",
-             "documentation in addition to the standard",
-             "directories.  May be repeated.") do |value|
-        value.each do |dir|
-          unless File.directory? dir then
-            raise OptionParser::InvalidArgument, "#{dir} is not a directory"
-          end
-
-          options[:extra_doc_dirs] << File.expand_path(dir)
-        end
-      end
-
-      opt.separator nil
-
-      opt.on("--no-standard-docs",
-             "Do not include documentation from",
-             "the Ruby standard library, site_lib,",
-             "installed gems, or ~/.rdoc.",
-             "Use with --doc-dir.") do
-        options[:use_system] = false
-        options[:use_site] = false
-        options[:use_gems] = false
-        options[:use_home] = false
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]system",
-             "Include documentation from Ruby's",
-             "standard library.  Defaults to true.") do |value|
-        options[:use_system] = value
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]site",
-             "Include documentation from libraries",
-             "installed in site_lib.",
-             "Defaults to true.") do |value|
-        options[:use_site] = value
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]gems",
-             "Include documentation from RubyGems.",
-             "Defaults to true.") do |value|
-        options[:use_gems] = value
-      end
-
-      opt.separator nil
-
-      opt.on("--[no-]home",
-             "Include documentation stored in ~/.rdoc.",
-             "Defaults to true.") do |value|
-        options[:use_home] = value
-      end
-
-      opt.separator nil
-      opt.separator "Debug options:"
-      opt.separator nil
-
-      opt.on("--[no-]profile",
-             "Run with the ruby profiler.") do |value|
-        options[:profile] = value
-      end
-
-      opt.separator nil
-
-      opt.on("--dump=CACHE",
-             "Dump data from an ri cache or data file.") do |value|
-        unless File.readable?(value)
-          abort "#{value.inspect} is not readable"
-        end
-
-        if File.directory?(value)
-          abort "#{value.inspect} is a directory"
-        end
-
-        options[:dump_path] = File.new(value)
-      end
-    end
-
-    argv = ENV['RI'].to_s.split(' ').concat argv
-
-    opts.parse! argv
-
-    options[:names] = argv
-
-    options[:use_stdout] ||= !$stdout.tty?
-    options[:use_stdout] ||= options[:interactive]
-    options[:width] ||= 72
-
-    options
-
-  rescue OptionParser::InvalidArgument, OptionParser::InvalidOption => e
-    puts opts
-    puts
-    puts e
-    exit 1
-  end
-
-  ##
-  # Runs the ri command line executable using +argv+
-
-  def self.run argv = ARGV
-    options = process_args argv
-
-    if options[:dump_path] then
-      dump options[:dump_path]
-      return
-    end
-
-    ri = new options
-    ri.run
-  end
-
-  ##
-  # Creates a new driver using +initial_options+ from ::process_args
-
-  def initialize initial_options = {}
-    @paging = false
-    @classes = nil
-
-    options = self.class.default_options.update(initial_options)
-
-    @formatter_klass = options[:formatter]
-
-    require 'profile' if options[:profile]
-
-    @names = options[:names]
-    @list = options[:list]
-
-    @doc_dirs = []
-    @stores   = []
-
-    RDoc::RI::Paths.each(options[:use_system], options[:use_site],
-                         options[:use_home], options[:use_gems],
-                         *options[:extra_doc_dirs]) do |path, type|
-      @doc_dirs << path
-
-      store = RDoc::RI::Store.new path, type
-      store.load_cache
-      @stores << store
-    end
-
-    @list_doc_dirs = options[:list_doc_dirs]
-
-    @interactive = options[:interactive]
-    @server      = options[:server]
-    @use_stdout  = options[:use_stdout]
-    @show_all    = options[:show_all]
-    @width       = options[:width]
-  end
-
-  ##
-  # Adds paths for undocumented classes +also_in+ to +out+
-
-  def add_also_in out, also_in
-    return if also_in.empty?
-
-    out << RDoc::Markup::Rule.new(1)
-    out << RDoc::Markup::Paragraph.new("Also found in:")
-
-    paths = RDoc::Markup::Verbatim.new
-    also_in.each do |store|
-      paths.parts.push store.friendly_path, "\n"
-    end
-    out << paths
-  end
-
-  ##
-  # Adds a class header to +out+ for class +name+ which is described in
-  # +classes+.
-
-  def add_class out, name, classes
-    heading = if classes.all? { |klass| klass.module? } then
-                name
-              else
-                superclass = classes.map do |klass|
-                  klass.superclass unless klass.module?
-                end.compact.shift || 'Object'
-
-                superclass = superclass.full_name unless String === superclass
-
-                "#{name} < #{superclass}"
-              end
-
-    out << RDoc::Markup::Heading.new(1, heading)
-    out << RDoc::Markup::BlankLine.new
-  end
-
-  ##
-  # Adds "(from ...)" to +out+ for +store+
-
-  def add_from out, store
-    out << RDoc::Markup::Paragraph.new("(from #{store.friendly_path})")
-  end
-
-  ##
-  # Adds +extends+ to +out+
-
-  def add_extends out, extends
-    add_extension_modules out, 'Extended by', extends
-  end
-
-  ##
-  # Adds a list of +extensions+ to this module of the given +type+ to +out+.
-  # add_includes and add_extends call this, so you should use those directly.
-
-  def add_extension_modules out, type, extensions
-    return if extensions.empty?
-
-    out << RDoc::Markup::Rule.new(1)
-    out << RDoc::Markup::Heading.new(1, "#{type}:")
-
-    extensions.each do |modules, store|
-      if modules.length == 1 then
-        add_extension_modules_single out, store, modules.first
-      else
-        add_extension_modules_multiple out, store, modules
-      end
-    end
-  end
-
-  ##
-  # Renders multiple included +modules+ from +store+ to +out+.
-
-  def add_extension_modules_multiple out, store, modules # :nodoc:
-    out << RDoc::Markup::Paragraph.new("(from #{store.friendly_path})")
-
-    wout, with = modules.partition { |incl| incl.comment.empty? }
-
-    out << RDoc::Markup::BlankLine.new unless with.empty?
-
-    with.each do |incl|
-      out << RDoc::Markup::Paragraph.new(incl.name)
-      out << RDoc::Markup::BlankLine.new
-      out << incl.comment
-    end
-
-    unless wout.empty? then
-      verb = RDoc::Markup::Verbatim.new
-
-      wout.each do |incl|
-        verb.push incl.name, "\n"
-      end
-
-      out << verb
-    end
-  end
-
-  ##
-  # Adds a single extension module +include+ from +store+ to +out+
-
-  def add_extension_modules_single out, store, include # :nodoc:
-    name = include.name
-    path = store.friendly_path
-    out << RDoc::Markup::Paragraph.new("#{name} (from #{path})")
-
-    if include.comment then
-      out << RDoc::Markup::BlankLine.new
-      out << include.comment
-    end
-  end
-
-  ##
-  # Adds +includes+ to +out+
-
-  def add_includes out, includes
-    add_extension_modules out, 'Includes', includes
-  end
-
-  ##
-  # Looks up the method +name+ and adds it to +out+
-
-  def add_method out, name
-    filtered   = lookup_method name
-
-    method_out = method_document name, filtered
-
-    out.concat method_out.parts
-  end
-
-  ##
-  # Adds documentation for all methods in +klass+ to +out+
-
-  def add_method_documentation out, klass
-    klass.method_list.each do |method|
-      begin
-        add_method out, method.full_name
-      rescue NotFoundError
-        next
-      end
-    end
-  end
-
-  ##
-  # Adds a list of +methods+ to +out+ with a heading of +name+
-
-  def add_method_list out, methods, name
-    return if methods.empty?
-
-    out << RDoc::Markup::Heading.new(1, "#{name}:")
-    out << RDoc::Markup::BlankLine.new
-
-    if @use_stdout and !@interactive then
-      out.concat methods.map { |method|
-        RDoc::Markup::Verbatim.new method
-      }
-    else
-      out << RDoc::Markup::IndentedParagraph.new(2, methods.join(', '))
-    end
-
-    out << RDoc::Markup::BlankLine.new
-  end
-
-  ##
-  # Returns ancestor classes of +klass+
-
-  def ancestors_of klass
-    ancestors = []
-
-    unexamined = [klass]
-    seen = []
-
-    loop do
-      break if unexamined.empty?
-      current = unexamined.shift
-      seen << current
-
-      stores = classes[current]
-
-      next unless stores and not stores.empty?
-
-      klasses = stores.flat_map do |store|
-        store.ancestors[current] || []
-      end.uniq
-
-      klasses = klasses - seen
-
-      ancestors.concat klasses
-      unexamined.concat klasses
-    end
-
-    ancestors.reverse
-  end
-
-  ##
-  # For RubyGems backwards compatibility
-
-  def class_cache # :nodoc:
-  end
-
-  ##
-  # Builds a RDoc::Markup::Document from +found+, +klasess+ and +includes+
-
-  def class_document name, found, klasses, includes, extends
-    also_in = []
-
-    out = RDoc::Markup::Document.new
-
-    add_class out, name, klasses
-
-    add_includes out, includes
-    add_extends  out, extends
-
-    found.each do |store, klass|
-      render_class out, store, klass, also_in
-    end
-
-    add_also_in out, also_in
-
-    out
-  end
-
-  ##
-  # Adds the class +comment+ to +out+.
-
-  def class_document_comment out, comment # :nodoc:
-    unless comment.empty? then
-      out << RDoc::Markup::Rule.new(1)
-
-      if comment.merged? then
-        parts = comment.parts
-        parts = parts.zip [RDoc::Markup::BlankLine.new] * parts.length
-        parts.flatten!
-        parts.pop
-
-        out.concat parts
-      else
-        out << comment
-      end
-    end
-  end
-
-  ##
-  # Adds the constants from +klass+ to the Document +out+.
-
-  def class_document_constants out, klass # :nodoc:
-    return if klass.constants.empty?
-
-    out << RDoc::Markup::Heading.new(1, "Constants:")
-    out << RDoc::Markup::BlankLine.new
-    list = RDoc::Markup::List.new :NOTE
-
-    constants = klass.constants.sort_by { |constant| constant.name }
-
-    list.items.concat constants.map { |constant|
-      parts = constant.comment.parts if constant.comment
-      parts << RDoc::Markup::Paragraph.new('[not documented]') if
-        parts.empty?
-
-      RDoc::Markup::ListItem.new(constant.name, *parts)
-    }
-
-    out << list
-    out << RDoc::Markup::BlankLine.new
-  end
-
-  ##
-  # Hash mapping a known class or module to the stores it can be loaded from
-
-  def classes
-    return @classes if @classes
-
-    @classes = {}
-
-    @stores.each do |store|
-      store.cache[:modules].each do |mod|
-        # using default block causes searched-for modules to be added
-        @classes[mod] ||= []
-        @classes[mod] << store
-      end
-    end
-
-    @classes
-  end
-
-  ##
-  # Returns the stores wherein +name+ is found along with the classes,
-  # extends and includes that match it
-
-  def classes_and_includes_and_extends_for name
-    klasses = []
-    extends = []
-    includes = []
-
-    found = @stores.map do |store|
-      begin
-        klass = store.load_class name
-        klasses  << klass
-        extends  << [klass.extends,  store] if klass.extends
-        includes << [klass.includes, store] if klass.includes
-        [store, klass]
-      rescue RDoc::Store::MissingFileError
-      end
-    end.compact
-
-    extends.reject!  do |modules,| modules.empty? end
-    includes.reject! do |modules,| modules.empty? end
-
-    [found, klasses, includes, extends]
-  end
-
-  ##
-  # Completes +name+ based on the caches.  For Readline
-
-  def complete name
-    completions = []
-
-    klass, selector, method = parse_name name
-
-    complete_klass  name, klass, selector, method, completions
-    complete_method name, klass, selector,         completions
-
-    completions.sort.uniq
-  end
-
-  def complete_klass name, klass, selector, method, completions # :nodoc:
-    klasses = classes.keys
-
-    # may need to include Foo when given Foo::
-    klass_name = method ? name : klass
-
-    if name !~ /#|\./ then
-      completions.replace klasses.grep(/^#{Regexp.escape klass_name}[^:]*$/)
-      completions.concat klasses.grep(/^#{Regexp.escape name}[^:]*$/) if
-        name =~ /::$/
-
-      completions << klass if classes.key? klass # to complete a method name
-    elsif selector then
-      completions << klass if classes.key? klass
-    elsif classes.key? klass_name then
-      completions << klass_name
-    end
-  end
-
-  def complete_method name, klass, selector, completions # :nodoc:
-    if completions.include? klass and name =~ /#|\.|::/ then
-      methods = list_methods_matching name
-
-      if not methods.empty? then
-        # remove Foo if given Foo:: and a method was found
-        completions.delete klass
-      elsif selector then
-        # replace Foo with Foo:: as given
-        completions.delete klass
-        completions << "#{klass}#{selector}"
-      end
-
-      completions.concat methods
-    end
-  end
-
-  ##
-  # Converts +document+ to text and writes it to the pager
-
-  def display document
-    page do |io|
-      f = formatter(io)
-      f.width = @width if @width and f.respond_to?(:width)
-      text = document.accept f
-
-      io.write text
-    end
-  end
-
-  ##
-  # Outputs formatted RI data for class +name+.  Groups undocumented classes
-
-  def display_class name
-    return if name =~ /#|\./
-
-    found, klasses, includes, extends =
-      classes_and_includes_and_extends_for name
-
-    return if found.empty?
-
-    out = class_document name, found, klasses, includes, extends
-
-    display out
-  end
-
-  ##
-  # Outputs formatted RI data for method +name+
-
-  def display_method name
-    out = RDoc::Markup::Document.new
-
-    add_method out, name
-
-    display out
-  end
-
-  ##
-  # Outputs formatted RI data for the class or method +name+.
-  #
-  # Returns true if +name+ was found, false if it was not an alternative could
-  # be guessed, raises an error if +name+ couldn't be guessed.
-
-  def display_name name
-    if name =~ /\w:(\w|$)/ then
-      display_page name
-      return true
-    end
-
-    return true if display_class name
-
-    display_method name if name =~ /::|#|\./
-
-    true
-  rescue NotFoundError
-    matches = list_methods_matching name if name =~ /::|#|\./
-    matches = classes.keys.grep(/^#{Regexp.escape name}/) if matches.empty?
-
-    raise if matches.empty?
-
-    page do |io|
-      io.puts "#{name} not found, maybe you meant:"
-      io.puts
-      io.puts matches.sort.join("\n")
-    end
-
-    false
-  end
-
-  ##
-  # Displays each name in +name+
-
-  def display_names names
-    names.each do |name|
-      name = expand_name name
-
-      display_name name
-    end
-  end
-
-  ##
-  # Outputs formatted RI data for page +name+.
-
-  def display_page name
-    store_name, page_name = name.split ':', 2
-
-    store = @stores.find { |s| s.source == store_name }
-
-    return display_page_list store if page_name.empty?
-
-    pages = store.cache[:pages]
-
-    unless pages.include? page_name then
-      found_names = pages.select do |n|
-        n =~ /#{Regexp.escape page_name}\.[^.]+$/
-      end
-
-      if found_names.length.zero? then
-        return display_page_list store, pages
-      elsif found_names.length > 1 then
-        return display_page_list store, found_names, page_name
-      end
-
-      page_name = found_names.first
-    end
-
-    page = store.load_page page_name
-
-    display page.comment
-  end
-
-  ##
-  # Outputs a formatted RI page list for the pages in +store+.
-
-  def display_page_list store, pages = store.cache[:pages], search = nil
-    out = RDoc::Markup::Document.new
-
-    title = if search then
-              "#{search} pages"
-            else
-              'Pages'
-            end
-
-    out << RDoc::Markup::Heading.new(1, "#{title} in #{store.friendly_path}")
-    out << RDoc::Markup::BlankLine.new
-
-    list = RDoc::Markup::List.new(:BULLET)
-
-    pages.each do |page|
-      list << RDoc::Markup::Paragraph.new(page)
-    end
-
-    out << list
-
-    display out
-  end
-
-  def check_did_you_mean # :nodoc:
-    if defined? DidYouMean::SpellChecker
-      true
-    else
-      begin
-        require 'did_you_mean'
-        if defined? DidYouMean::SpellChecker
-          true
-        else
-          false
-        end
-      rescue LoadError
-        false
-      end
-    end
-  end
-
-  ##
-  # Expands abbreviated klass +klass+ into a fully-qualified class.  "Zl::Da"
-  # will be expanded to Zlib::DataError.
-
-  def expand_class klass
-    class_names = classes.keys
-    ary = class_names.grep(Regexp.new("\\A#{klass.gsub(/(?=::|\z)/, '[^:]*')}\\z"))
-    if ary.length != 1 && ary.first != klass
-      if check_did_you_mean
-        suggestion_proc = -> { DidYouMean::SpellChecker.new(dictionary: class_names).correct(klass) }
-        raise NotFoundError.new(klass, suggestion_proc)
-      else
-        raise NotFoundError, klass
-      end
-    end
-    ary.first
-  end
-
-  ##
-  # Expands the class portion of +name+ into a fully-qualified class.  See
-  # #expand_class.
-
-  def expand_name name
-    klass, selector, method = parse_name name
-
-    return [selector, method].join if klass.empty?
-
-    case selector
-    when ':' then
-      [find_store(klass),   selector, method]
-    else
-      [expand_class(klass), selector, method]
-    end.join
-  end
-
-  ##
-  # Filters the methods in +found+ trying to find a match for +name+.
-
-  def filter_methods found, name
-    regexp = name_regexp name
-
-    filtered = found.find_all do |store, methods|
-      methods.any? { |method| method.full_name =~ regexp }
-    end
-
-    return filtered unless filtered.empty?
-
-    found
-  end
-
-  ##
-  # Yields items matching +name+ including the store they were found in, the
-  # class being searched for, the class they were found in (an ancestor) the
-  # types of methods to look up (from #method_type), and the method name being
-  # searched for
-
-  def find_methods name
-    klass, selector, method = parse_name name
-
-    types = method_type selector
-
-    klasses = nil
-    ambiguous = klass.empty?
-
-    if ambiguous then
-      klasses = classes.keys
-    else
-      klasses = ancestors_of klass
-      klasses.unshift klass
-    end
-
-    methods = []
-
-    klasses.each do |ancestor|
-      ancestors = classes[ancestor]
-
-      next unless ancestors
-
-      klass = ancestor if ambiguous
-
-      ancestors.each do |store|
-        methods << [store, klass, ancestor, types, method]
-      end
-    end
-
-    methods = methods.sort_by do |_, k, a, _, m|
-      [k, a, m].compact
-    end
-
-    methods.each do |item|
-      yield(*item) # :yields: store, klass, ancestor, types, method
-    end
-
-    self
-  end
-
-  ##
-  # Finds a store that matches +name+ which can be the name of a gem, "ruby",
-  # "home" or "site".
-  #
-  # See also RDoc::Store#source
-
-  def find_store name
-    @stores.each do |store|
-      source = store.source
-
-      return source if source == name
-
-      return source if
-        store.type == :gem and source =~ /^#{Regexp.escape name}-\d/
-    end
-
-    raise RDoc::RI::Driver::NotFoundError, name
-  end
-
-  ##
-  # Creates a new RDoc::Markup::Formatter.  If a formatter is given with -f,
-  # use it.  If we're outputting to a pager, use bs, otherwise ansi.
-
-  def formatter(io)
-    if @formatter_klass then
-      @formatter_klass.new
-    elsif paging? or !io.tty? then
-      RDoc::Markup::ToBs.new
-    else
-      RDoc::Markup::ToAnsi.new
-    end
-  end
-
-  ##
-  # Runs ri interactively using Readline if it is available.
-
-  def interactive
-    puts "\nEnter the method name you want to look up."
-
-    begin
-      require 'readline'
-    rescue LoadError
-    end
-    if defined? Readline then
-      Readline.completion_proc = method :complete
-      puts "You can use tab to autocomplete."
-    end
-
-    puts "Enter a blank line to exit.\n\n"
-
-    loop do
-      name = if defined? Readline then
-               Readline.readline ">> ", true
-             else
-               print ">> "
-               $stdin.gets
-             end
-
-      return if name.nil? or name.empty?
-
-      begin
-        display_name expand_name(name.strip)
-      rescue NotFoundError => e
-        puts e.message
-      end
-    end
-
-  rescue Interrupt
-    exit
-  end
-
-  ##
-  # Lists classes known to ri starting with +names+.  If +names+ is empty all
-  # known classes are shown.
-
-  def list_known_classes names = []
-    classes = []
-
-    stores.each do |store|
-      classes << store.module_names
-    end
-
-    classes = classes.flatten.uniq.sort
-
-    unless names.empty? then
-      filter = Regexp.union names.map { |name| /^#{name}/ }
-
-      classes = classes.grep filter
-    end
-
-    page do |io|
-      if paging? or io.tty? then
-        if names.empty? then
-          io.puts "Classes and Modules known to ri:"
-        else
-          io.puts "Classes and Modules starting with #{names.join ', '}:"
-        end
-        io.puts
-      end
-
-      io.puts classes.join("\n")
-    end
-  end
-
-  ##
-  # Returns an Array of methods matching +name+
-
-  def list_methods_matching name
-    found = []
-
-    find_methods name do |store, klass, ancestor, types, method|
-      if types == :instance or types == :both then
-        methods = store.instance_methods[ancestor]
-
-        if methods then
-          matches = methods.grep(/^#{Regexp.escape method.to_s}/)
-
-          matches = matches.map do |match|
-            "#{klass}##{match}"
-          end
-
-          found.concat matches
-        end
-      end
-
-      if types == :class or types == :both then
-        methods = store.class_methods[ancestor]
-
-        next unless methods
-        matches = methods.grep(/^#{Regexp.escape method.to_s}/)
-
-        matches = matches.map do |match|
-          "#{klass}::#{match}"
-        end
-
-        found.concat matches
-      end
-    end
-
-    found.uniq
-  end
-
-  ##
-  # Loads RI data for method +name+ on +klass+ from +store+.  +type+ and
-  # +cache+ indicate if it is a class or instance method.
-
-  def load_method store, cache, klass, type, name
-    methods = store.public_send(cache)[klass]
-
-    return unless methods
-
-    method = methods.find do |method_name|
-      method_name == name
-    end
-
-    return unless method
-
-    store.load_method klass, "#{type}#{method}"
-  rescue RDoc::Store::MissingFileError => e
-    comment = RDoc::Comment.new("missing documentation at #{e.file}").parse
-
-    method = RDoc::AnyMethod.new nil, name
-    method.comment = comment
-    method
-  end
-
-  ##
-  # Returns an Array of RI data for methods matching +name+
-
-  def load_methods_matching name
-    found = []
-
-    find_methods name do |store, klass, ancestor, types, method|
-      methods = []
-
-      methods << load_method(store, :class_methods, ancestor, '::',  method) if
-        [:class, :both].include? types
-
-      methods << load_method(store, :instance_methods, ancestor, '#',  method) if
-        [:instance, :both].include? types
-
-      found << [store, methods.compact]
-    end
-
-    found.reject do |path, methods| methods.empty? end
-  end
-
-  ##
-  # Returns a filtered list of methods matching +name+
-
-  def lookup_method name
-    found = load_methods_matching name
-
-    if found.empty?
-      if check_did_you_mean
-        methods = []
-        _, _, method_name = parse_name name
-        find_methods name do |store, klass, ancestor, types, method|
-          methods.push(*store.class_methods[klass]) if [:class, :both].include? types
-          methods.push(*store.instance_methods[klass]) if [:instance, :both].include? types
-        end
-        methods = methods.uniq
-        suggestion_proc = -> { DidYouMean::SpellChecker.new(dictionary: methods).correct(method_name) }
-        raise NotFoundError.new(name, suggestion_proc)
-      else
-        raise NotFoundError, name
-      end
-    end
-
-    filter_methods found, name
-  end
-
-  ##
-  # Builds a RDoc::Markup::Document from +found+, +klasses+ and +includes+
-
-  def method_document name, filtered
-    out = RDoc::Markup::Document.new
-
-    out << RDoc::Markup::Heading.new(1, name)
-    out << RDoc::Markup::BlankLine.new
-
-    filtered.each do |store, methods|
-      methods.each do |method|
-        render_method out, store, method, name
-      end
-    end
-
-    out
-  end
-
-  ##
-  # Returns the type of method (:both, :instance, :class) for +selector+
-
-  def method_type selector
-    case selector
-    when '.', nil then :both
-    when '#'      then :instance
-    else               :class
-    end
-  end
-
-  ##
-  # Returns a regular expression for +name+ that will match an
-  # RDoc::AnyMethod's name.
-
-  def name_regexp name
-    klass, type, name = parse_name name
-
-    case type
-    when '#', '::' then
-      /^#{klass}#{type}#{Regexp.escape name}$/
-    else
-      /^#{klass}(#|::)#{Regexp.escape name}$/
-    end
-  end
-
-  ##
-  # Paginates output through a pager program.
-
-  def page
-    if pager = setup_pager then
-      begin
-        yield pager
-      ensure
-        pager.close
-      end
-    else
-      yield $stdout
-    end
-  rescue Errno::EPIPE
-  ensure
-    @paging = false
-  end
-
-  ##
-  # Are we using a pager?
-
-  def paging?
-    @paging
-  end
-
-  ##
-  # Extracts the class, selector and method name parts from +name+ like
-  # Foo::Bar#baz.
-  #
-  # NOTE: Given Foo::Bar, Bar is considered a class even though it may be a
-  # method
-
-  def parse_name name
-    parts = name.split(/(::?|#|\.)/)
-
-    if parts.length == 1 then
-      if parts.first =~ /^[a-z]|^([%&*+\/<>^`|~-]|\+@|-@|<<|<=>?|===?|=>|=~|>>|\[\]=?|~@)$/ then
-        type = '.'
-        meth = parts.pop
-      else
-        type = nil
-        meth = nil
-      end
-    elsif parts.length == 2 or parts.last =~ /::|#|\./ then
-      type = parts.pop
-      meth = nil
-    elsif parts[1] == ':' then
-      klass = parts.shift
-      type  = parts.shift
-      meth  = parts.join
-    elsif parts[-2] != '::' or parts.last !~ /^[A-Z]/ then
-      meth = parts.pop
-      type = parts.pop
-    end
-
-    klass ||= parts.join
-
-    [klass, type, meth]
-  end
-
-  ##
-  # Renders the +klass+ from +store+ to +out+.  If the klass has no
-  # documentable items the class is added to +also_in+ instead.
-
-  def render_class out, store, klass, also_in # :nodoc:
-    comment = klass.comment
-    # TODO the store's cache should always return an empty Array
-    class_methods    = store.class_methods[klass.full_name]    || []
-    instance_methods = store.instance_methods[klass.full_name] || []
-    attributes       = store.attributes[klass.full_name]       || []
-
-    if comment.empty? and
-       instance_methods.empty? and class_methods.empty? then
-      also_in << store
-      return
-    end
-
-    add_from out, store
-
-    class_document_comment out, comment
-
-    if class_methods or instance_methods or not klass.constants.empty? then
-      out << RDoc::Markup::Rule.new(1)
-    end
-
-    class_document_constants out, klass
-
-    add_method_list out, class_methods,    'Class methods'
-    add_method_list out, instance_methods, 'Instance methods'
-    add_method_list out, attributes,       'Attributes'
-
-    add_method_documentation out, klass if @show_all
-  end
-
-  def render_method out, store, method, name # :nodoc:
-    out << RDoc::Markup::Paragraph.new("(from #{store.friendly_path})")
-
-    unless name =~ /^#{Regexp.escape method.parent_name}/ then
-      out << RDoc::Markup::Heading.new(3, "Implementation from #{method.parent_name}")
-    end
-
-    out << RDoc::Markup::Rule.new(1)
-
-    render_method_arguments out, method.arglists
-    render_method_superclass out, method
-    if method.is_alias_for
-      al = method.is_alias_for
-      alias_for = store.load_method al.parent_name, "#{al.name_prefix}#{al.name}"
-      render_method_comment out, method, alias_for
-    else
-      render_method_comment out, method
-    end
-  end
-
-  def render_method_arguments out, arglists # :nodoc:
-    return unless arglists
-
-    arglists = arglists.chomp.split "\n"
-    arglists = arglists.map { |line| line + "\n" }
-    out << RDoc::Markup::Verbatim.new(*arglists)
-    out << RDoc::Markup::Rule.new(1)
-  end
-
-  def render_method_comment out, method, alias_for = nil# :nodoc:
-    if alias_for
-      unless method.comment.nil? or method.comment.empty?
-        out << RDoc::Markup::BlankLine.new
-        out << method.comment
-      end
-      out << RDoc::Markup::BlankLine.new
-      out << RDoc::Markup::Paragraph.new("(This method is an alias for #{alias_for.full_name}.)")
-      out << RDoc::Markup::BlankLine.new
-      out << alias_for.comment
-      out << RDoc::Markup::BlankLine.new
-    else
-      out << RDoc::Markup::BlankLine.new
-      out << method.comment
-      out << RDoc::Markup::BlankLine.new
-    end
-  end
-
-  def render_method_superclass out, method # :nodoc:
-    return unless
-      method.respond_to?(:superclass_method) and method.superclass_method
-
-    out << RDoc::Markup::BlankLine.new
-    out << RDoc::Markup::Heading.new(4, "(Uses superclass method #{method.superclass_method})")
-    out << RDoc::Markup::Rule.new(1)
-  end
-
-  ##
-  # Looks up and displays ri data according to the options given.
-
-  def run
-    if @list_doc_dirs then
-      puts @doc_dirs
-    elsif @list then
-      list_known_classes @names
-    elsif @server then
-      start_server
-    elsif @interactive or @names.empty? then
-      interactive
-    else
-      display_names @names
-    end
-  rescue NotFoundError => e
-    abort e.message
-  end
-
-  ##
-  # Sets up a pager program to pass output through.  Tries the RI_PAGER and
-  # PAGER environment variables followed by pager, less then more.
-
-  def setup_pager
-    return if @use_stdout
-
-    pagers = [ENV['RI_PAGER'], ENV['PAGER'], 'pager', 'less', 'more']
-
-    require 'shellwords'
-    pagers.compact.uniq.each do |pager|
-      pager = Shellwords.split(pager)
-      next if pager.empty?
-
-      io = IO.popen(pager, 'w') rescue next
-      next if $? and $?.pid == io.pid and $?.exited? # pager didn't work
-
-      @paging = true
-
-      return io
-    end
-
-    @use_stdout = true
-
-    nil
-  end
-
-  ##
-  # Starts a WEBrick server for ri.
-
-  def start_server
-    begin
-      require 'webrick'
-    rescue LoadError
-      abort "webrick is not found. You may need to `gem install webrick` to install webrick."
-    end
-
-    server = WEBrick::HTTPServer.new :Port => @server
-
-    extra_doc_dirs = @stores.map {|s| s.type == :extra ? s.path : nil}.compact
-
-    server.mount '/', RDoc::Servlet, nil, extra_doc_dirs
-
-    trap 'INT'  do server.shutdown end
-    trap 'TERM' do server.shutdown end
-
-    server.start
-  end
-
-end
diff --git a/lib/rdoc/ri/formatter.rb b/lib/rdoc/ri/formatter.rb
deleted file mode 100644
index 832a101e6c..0000000000
--- a/lib/rdoc/ri/formatter.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-# frozen_string_literal: true
-##
-# For RubyGems backwards compatibility
-
-module RDoc::RI::Formatter # :nodoc:
-end
diff --git a/lib/rdoc/ri/paths.rb b/lib/rdoc/ri/paths.rb
deleted file mode 100644
index 8e89b04e54..0000000000
--- a/lib/rdoc/ri/paths.rb
+++ /dev/null
@@ -1,171 +0,0 @@
-# frozen_string_literal: true
-require_relative '../rdoc'
-
-##
-# The directories where ri data lives.  Paths can be enumerated via ::each, or
-# queried individually via ::system_dir, ::site_dir, ::home_dir and ::gem_dir.
-
-module RDoc::RI::Paths
-
-  #:stopdoc:
-  require 'rbconfig'
-
-  version = RbConfig::CONFIG['ruby_version']
-
-  BASE    = File.join RbConfig::CONFIG['ridir'], version
-
-  HOMEDIR = RDoc.home
-  #:startdoc:
-
-  ##
-  # Iterates over each selected path yielding the directory and type.
-  #
-  # Yielded types:
-  # :system:: Where Ruby's ri data is stored.  Yielded when +system+ is
-  #           true
-  # :site:: Where ri for installed libraries are stored.  Yielded when
-  #         +site+ is true.  Normally no ri data is stored here.
-  # :home:: ~/.rdoc.  Yielded when +home+ is true.
-  # :gem:: ri data for an installed gem.  Yielded when +gems+ is true.
-  # :extra:: ri data directory from the command line.  Yielded for each
-  #          entry in +extra_dirs+
-
-  def self.each system = true, site = true, home = true, gems = :latest, *extra_dirs # :yields: directory, type
-    return enum_for __method__, system, site, home, gems, *extra_dirs unless
-      block_given?
-
-    extra_dirs.each do |dir|
-      yield dir, :extra
-    end
-
-    yield system_dir,  :system if system
-    yield site_dir,    :site   if site
-    yield home_dir,    :home   if home and HOMEDIR
-
-    gemdirs(gems).each do |dir|
-      yield dir, :gem
-    end if gems
-
-    nil
-  end
-
-  ##
-  # The ri directory for the gem with +gem_name+.
-
-  def self.gem_dir name, version
-    req = Gem::Requirement.new "= #{version}"
-
-    spec = Gem::Specification.find_by_name name, req
-
-    File.join spec.doc_dir, 'ri'
-  end
-
-  ##
-  # The latest installed gems' ri directories.  +filter+ can be :all or
-  # :latest.
-  #
-  # A +filter+ :all includes all versions of gems and includes gems without
-  # ri documentation.
-
-  def self.gemdirs filter = :latest
-    ri_paths = {}
-
-    all = Gem::Specification.map do |spec|
-      [File.join(spec.doc_dir, 'ri'), spec.name, spec.version]
-    end
-
-    if filter == :all then
-      gemdirs = []
-
-      all.group_by do |_, name, _|
-        name
-      end.sort_by do |group, _|
-        group
-      end.map do |group, items|
-        items.sort_by do |_, _, version|
-          version
-        end.reverse_each do |dir,|
-          gemdirs << dir
-        end
-      end
-
-      return gemdirs
-    end
-
-    all.each do |dir, name, ver|
-      next unless File.exist? dir
-
-      if ri_paths[name].nil? or ver > ri_paths[name].first then
-        ri_paths[name] = [ver, name, dir]
-      end
-    end
-
-    ri_paths.sort_by { |_, (_, name, _)| name }.map { |k, v| v.last }
-  rescue LoadError
-    []
-  end
-
-  ##
-  # The location of the rdoc data in the user's home directory.
-  #
-  # Like ::system, ri data in the user's home directory is rare and predates
-  # libraries distributed via RubyGems.  ri data is rarely generated into this
-  # directory.
-
-  def self.home_dir
-    HOMEDIR
-  end
-
-  ##
-  # Returns existing directories from the selected documentation directories
-  # as an Array.
-  #
-  # See also ::each
-
-  def self.path(system = true, site = true, home = true, gems = :latest, *extra_dirs)
-    path = raw_path system, site, home, gems, *extra_dirs
-
-    path.select { |directory| File.directory? directory }
-  end
-
-  ##
-  # Returns selected documentation directories including nonexistent
-  # directories.
-  #
-  # See also ::each
-
-  def self.raw_path(system, site, home, gems, *extra_dirs)
-    path = []
-
-    each(system, site, home, gems, *extra_dirs) do |dir, type|
-      path << dir
-    end
-
-    path.compact
-  end
-
-  ##
-  # The location of ri data installed into the site dir.
-  #
-  # Historically this was available for documentation installed by Ruby
-  # libraries predating RubyGems.  It is unlikely to contain any content for
-  # modern Ruby installations.
-
-  def self.site_dir
-    File.join BASE, 'site'
-  end
-
-  ##
-  # The location of the built-in ri data.
-  #
-  # This data is built automatically when `make` is run when Ruby is
-  # installed.  If you did not install Ruby by hand you may need to install
-  # the documentation yourself.  Please consult the documentation for your
-  # package manager or Ruby installer for details.  You can also use the
-  # rdoc-data gem to install system ri data for common versions of Ruby.
-
-  def self.system_dir
-    File.join BASE, 'system'
-  end
-
-end
diff --git a/lib/rdoc/ri/store.rb b/lib/rdoc/ri/store.rb
deleted file mode 100644
index 96742e7ae3..0000000000
--- a/lib/rdoc/ri/store.rb
+++ /dev/null
@@ -1,6 +0,0 @@
-# frozen_string_literal: true
-module RDoc::RI
-
-  Store = RDoc::Store # :nodoc:
-
-end
diff --git a/lib/rdoc/ri/task.rb b/lib/rdoc/ri/task.rb
deleted file mode 100644
index 1122ea3775..0000000000
--- a/lib/rdoc/ri/task.rb
+++ /dev/null
@@ -1,71 +0,0 @@
-# frozen_string_literal: true
-begin
-  gem 'rdoc'
-rescue Gem::LoadError
-end unless defined?(RDoc)
-
-require_relative '../task'
-
-##
-# RDoc::RI::Task creates ri data in <code>./.rdoc</code> for your project.
-#
-# It contains the following tasks:
-#
-# [ri]
-#   Build ri data
-#
-# [clobber_ri]
-#   Delete ri data files.  This target is automatically added to the main
-#   clobber target.
-#
-# [reri]
-#   Rebuild the ri data from scratch even if they are not out of date.
-#
-# Simple example:
-#
-#   require 'rdoc/ri/task'
-#
-#   RDoc::RI::Task.new do |ri|
-#     ri.main = 'README.rdoc'
-#     ri.rdoc_files.include 'README.rdoc', 'lib/**/*.rb'
-#   end
-#
-# For further configuration details see RDoc::Task.
-
-class RDoc::RI::Task < RDoc::Task
-
-  DEFAULT_NAMES = { # :nodoc:
-    :clobber_rdoc => :clobber_ri,
-    :rdoc         => :ri,
-    :rerdoc       => :reri,
-  }
-
-  ##
-  # Create an ri task with the given name. See RDoc::Task for documentation on
-  # setting names.
-
-  def initialize name = DEFAULT_NAMES # :yield: self
-    super
-  end
-
-  def clobber_task_description # :nodoc:
-    "Remove RI data files"
-  end
-
-  ##
-  # Sets default task values
-
-  def defaults
-    super
-
-    @rdoc_dir = '.rdoc'
-  end
-
-  def rdoc_task_description # :nodoc:
-    'Build RI data files'
-  end
-
-  def rerdoc_task_description # :nodoc:
-    'Rebuild RI data files'
-  end
-end
diff --git a/lib/rdoc/rubygems_hook.rb b/lib/rdoc/rubygems_hook.rb
deleted file mode 100644
index 3160072e53..0000000000
--- a/lib/rdoc/rubygems_hook.rb
+++ /dev/null
@@ -1,248 +0,0 @@
-# frozen_string_literal: true
-require 'rubygems/user_interaction'
-require 'fileutils'
-require_relative '../rdoc'
-
-##
-# Gem::RDoc provides methods to generate RDoc and ri data for installed gems
-# upon gem installation.
-#
-# This file is automatically required by RubyGems 1.9 and newer.
-
-class RDoc::RubygemsHook
-
-  include Gem::UserInteraction
-  extend  Gem::UserInteraction
-
-  @rdoc_version = nil
-  @specs = []
-
-  ##
-  # Force installation of documentation?
-
-  attr_accessor :force
-
-  ##
-  # Generate rdoc?
-
-  attr_accessor :generate_rdoc
-
-  ##
-  # Generate ri data?
-
-  attr_accessor :generate_ri
-
-  class << self
-
-    ##
-    # Loaded version of RDoc.  Set by ::load_rdoc
-
-    attr_reader :rdoc_version
-
-  end
-
-  ##
-  # Post installs hook that generates documentation for each specification in
-  # +specs+
-
-  def self.generation_hook installer, specs
-    start = Time.now
-    types = installer.document
-
-    generate_rdoc = types.include? 'rdoc'
-    generate_ri   = types.include? 'ri'
-
-    specs.each do |spec|
-      new(spec, generate_rdoc, generate_ri).generate
-    end
-
-    return unless generate_rdoc or generate_ri
-
-    duration = (Time.now - start).to_i
-    names    = specs.map(&:name).join ', '
-
-    say "Done installing documentation for #{names} after #{duration} seconds"
-  end
-
-  ##
-  # Loads the RDoc generator
-
-  def self.load_rdoc
-    return if @rdoc_version
-
-    require_relative 'rdoc'
-
-    @rdoc_version = Gem::Version.new ::RDoc::VERSION
-  end
-
-  ##
-  # Creates a new documentation generator for +spec+.  RDoc and ri data
-  # generation can be enabled or disabled through +generate_rdoc+ and
-  # +generate_ri+ respectively.
-  #
-  # Only +generate_ri+ is enabled by default.
-
-  def initialize spec, generate_rdoc = false, generate_ri = true
-    @doc_dir   = spec.doc_dir
-    @force     = false
-    @rdoc      = nil
-    @spec      = spec
-
-    @generate_rdoc = generate_rdoc
-    @generate_ri   = generate_ri
-
-    @rdoc_dir = spec.doc_dir 'rdoc'
-    @ri_dir   = spec.doc_dir 'ri'
-  end
-
-  ##
-  # Removes legacy rdoc arguments from +args+
-  #--
-  # TODO move to RDoc::Options
-
-  def delete_legacy_args args
-    args.delete '--inline-source'
-    args.delete '--promiscuous'
-    args.delete '-p'
-    args.delete '--one-file'
-  end
-
-  ##
-  # Generates documentation using the named +generator+ ("darkfish" or "ri")
-  # and following the given +options+.
-  #
-  # Documentation will be generated into +destination+
-
-  def document generator, options, destination
-    generator_name = generator
-
-    options = options.dup
-    options.exclude ||= [] # TODO maybe move to RDoc::Options#finish
-    options.setup_generator generator
-    options.op_dir = destination
-    Dir.chdir @spec.full_gem_path do
-      options.finish
-    end
-
-    generator = options.generator.new @rdoc.store, options
-
-    @rdoc.options = options
-    @rdoc.generator = generator
-
-    say "Installing #{generator_name} documentation for #{@spec.full_name}"
-
-    FileUtils.mkdir_p options.op_dir
-
-    Dir.chdir options.op_dir do
-      begin
-        @rdoc.class.current = @rdoc
-        @rdoc.generator.generate
-      ensure
-        @rdoc.class.current = nil
-      end
-    end
-  end
-
-  ##
-  # Generates RDoc and ri data
-
-  def generate
-    return if @spec.default_gem?
-    return unless @generate_ri or @generate_rdoc
-
-    setup
-
-    options = nil
-
-    args = @spec.rdoc_options
-    args.concat @spec.source_paths
-    args.concat @spec.extra_rdoc_files
-
-    case config_args = Gem.configuration[:rdoc]
-    when String then
-      args = args.concat config_args.split(' ')
-    when Array then
-      args = args.concat config_args
-    end
-
-    delete_legacy_args args
-
-    Dir.chdir @spec.full_gem_path do
-      options = ::RDoc::Options.new
-      options.default_title = "#{@spec.full_name} Documentation"
-      options.parse args
-    end
-
-    options.quiet = !Gem.configuration.really_verbose
-
-    @rdoc = new_rdoc
-    @rdoc.options = options
-
-    store = RDoc::Store.new
-    store.encoding = options.encoding
-    store.dry_run  = options.dry_run
-    store.main     = options.main_page
-    store.title    = options.title
-
-    @rdoc.store = store
-
-    say "Parsing documentation for #{@spec.full_name}"
-
-    Dir.chdir @spec.full_gem_path do
-      @rdoc.parse_files options.files
-    end
-
-    document 'ri',       options, @ri_dir if
-      @generate_ri   and (@force or not File.exist? @ri_dir)
-
-    document 'darkfish', options, @rdoc_dir if
-      @generate_rdoc and (@force or not File.exist? @rdoc_dir)
-  end
-
-  ##
-  # #new_rdoc creates a new RDoc instance.  This method is provided only to
-  # make testing easier.
-
-  def new_rdoc # :nodoc:
-    ::RDoc::RDoc.new
-  end
-
-  ##
-  # Is rdoc documentation installed?
-
-  def rdoc_installed?
-    File.exist? @rdoc_dir
-  end
-
-  ##
-  # Removes generated RDoc and ri data
-
-  def remove
-    base_dir = @spec.base_dir
-
-    raise Gem::FilePermissionError, base_dir unless File.writable? base_dir
-
-    FileUtils.rm_rf @rdoc_dir
-    FileUtils.rm_rf @ri_dir
-  end
-
-  ##
-  # Is ri data installed?
-
-  def ri_installed?
-    File.exist? @ri_dir
-  end
-
-  ##
-  # Prepares the spec for documentation generation
-
-  def setup
-    self.class.load_rdoc
-
-    raise Gem::FilePermissionError, @doc_dir if
-      File.exist?(@doc_dir) and not File.writable?(@doc_dir)
-
-    FileUtils.mkdir_p @doc_dir unless File.exist? @doc_dir
-  end
-
-end
diff --git a/lib/rdoc/servlet.rb b/lib/rdoc/servlet.rb
deleted file mode 100644
index d05368766a..0000000000
--- a/lib/rdoc/servlet.rb
+++ /dev/null
@@ -1,451 +0,0 @@
-# frozen_string_literal: true
-require_relative '../rdoc'
-require 'erb'
-require 'time'
-require 'json'
-
-begin
-  require 'webrick'
-rescue LoadError
-  abort "webrick is not found. You may need to `gem install webrick` to install webrick."
-end
-
-##
-# This is a WEBrick servlet that allows you to browse ri documentation.
-#
-# You can show documentation through either `ri --server` or, with RubyGems
-# 2.0 or newer, `gem server`.  For ri, the server runs on port 8214 by
-# default.  For RubyGems the server runs on port 8808 by default.
-#
-# You can use this servlet in your own project by mounting it on a WEBrick
-# server:
-#
-#   require 'webrick'
-#
-#   server = WEBrick::HTTPServer.new Port: 8000
-#
-#   server.mount '/', RDoc::Servlet
-#
-# If you want to mount the servlet some other place than the root, provide the
-# base path when mounting:
-#
-#   server.mount '/rdoc', RDoc::Servlet, '/rdoc'
-
-class RDoc::Servlet < WEBrick::HTTPServlet::AbstractServlet
-
-  @server_stores = Hash.new { |hash, server| hash[server] = {} }
-  @cache         = Hash.new { |hash, store|  hash[store]  = {} }
-
-  ##
-  # Maps an asset type to its path on the filesystem
-
-  attr_reader :asset_dirs
-
-  ##
-  # An RDoc::Options instance used for rendering options
-
-  attr_reader :options
-
-  ##
-  # Creates an instance of this servlet that shares cached data between
-  # requests.
-
-  def self.get_instance server, *options # :nodoc:
-    stores = @server_stores[server]
-
-    new server, stores, @cache, *options
-  end
-
-  ##
-  # Creates a new WEBrick servlet.
-  #
-  # Use +mount_path+ when mounting the servlet somewhere other than /.
-  #
-  # Use +extra_doc_dirs+ for additional documentation directories.
-  #
-  # +server+ is provided automatically by WEBrick when mounting.  +stores+ and
-  # +cache+ are provided automatically by the servlet.
-
-  def initialize server, stores, cache, mount_path = nil, extra_doc_dirs = []
-    super server
-
-    @cache      = cache
-    @mount_path = mount_path
-    @extra_doc_dirs = extra_doc_dirs
-    @stores     = stores
-
-    @options = RDoc::Options.new
-    @options.op_dir = '.'
-
-    darkfish_dir = nil
-
-    # HACK dup
-    $LOAD_PATH.each do |path|
-      darkfish_dir = File.join path, 'rdoc/generator/template/darkfish/'
-      next unless File.directory? darkfish_dir
-      @options.template_dir = darkfish_dir
-      break
-    end
-
-    @asset_dirs = {
-      :darkfish   => darkfish_dir,
-      :json_index =>
-        File.expand_path('../generator/template/json_index/', __FILE__),
-    }
-  end
-
-  ##
-  # Serves the asset at the path in +req+ for +generator_name+ via +res+.
-
-  def asset generator_name, req, res
-    asset_dir = @asset_dirs[generator_name]
-
-    asset_path = File.join asset_dir, req.path
-
-    if_modified_since req, res, asset_path
-
-    res.body = File.read asset_path
-
-    res.content_type = case req.path
-                       when /\.css\z/ then 'text/css'
-                       when /\.js\z/  then 'application/javascript'
-                       else                'application/octet-stream'
-                       end
-  end
-
-  ##
-  # GET request entry point.  Fills in +res+ for the path, etc. in +req+.
-
-  def do_GET req, res
-    req.path.sub!(/\A#{Regexp.escape @mount_path}/, '') if @mount_path
-
-    case req.path
-    when '/' then
-      root req, res
-    when '/js/darkfish.js', '/js/jquery.js', '/js/search.js',
-         %r%^/css/%, %r%^/images/%, %r%^/fonts/% then
-      asset :darkfish, req, res
-    when '/js/navigation.js', '/js/searcher.js' then
-      asset :json_index, req, res
-    when '/js/search_index.js' then
-      root_search req, res
-    else
-      show_documentation req, res
-    end
-  rescue WEBrick::HTTPStatus::NotFound => e
-    generator = generator_for RDoc::Store.new
-
-    not_found generator, req, res, e.message
-  rescue WEBrick::HTTPStatus::Status
-    raise
-  rescue => e
-    error e, req, res
-  end
-
-  ##
-  # Fills in +res+ with the class, module or page for +req+ from +store+.
-  #
-  # +path+ is relative to the mount_path and is used to determine the class,
-  # module or page name (/RDoc/Servlet.html becomes RDoc::Servlet).
-  # +generator+ is used to create the page.
-
-  def documentation_page store, generator, path, req, res
-    text_name = path.chomp '.html'
-    name = text_name.gsub '/', '::'
-
-    if klass = store.find_class_or_module(name) then
-      res.body = generator.generate_class klass
-    elsif page = store.find_text_page(name.sub(/_([^_]*)\z/, '.\1')) then
-      res.body = generator.generate_page page
-    elsif page = store.find_text_page(text_name.sub(/_([^_]*)\z/, '.\1')) then
-      res.body = generator.generate_page page
-    else
-      not_found generator, req, res
-    end
-  end
-
-  ##
-  # Creates the JSON search index on +res+ for the given +store+.  +generator+
-  # must respond to \#json_index to build.  +req+ is ignored.
-
-  def documentation_search store, generator, req, res
-    json_index = @cache[store].fetch :json_index do
-      @cache[store][:json_index] =
-        JSON.dump generator.json_index.build_index
-    end
-
-    res.content_type = 'application/javascript'
-    res.body = "var search_data = #{json_index}"
-  end
-
-  ##
-  # Returns the RDoc::Store and path relative to +mount_path+ for
-  # documentation at +path+.
-
-  def documentation_source path
-    _, source_name, path = path.split '/', 3
-
-    store = @stores[source_name]
-    return store, path if store
-
-    store = store_for source_name
-
-    store.load_all
-
-    @stores[source_name] = store
-
-    return store, path
-  end
-
-  ##
-  # Generates an error page for the +exception+ while handling +req+ on +res+.
-
-  def error exception, req, res
-    backtrace = exception.backtrace.join "\n"
-
-    res.content_type = 'text/html'
-    res.status = 500
-    res.body = <<-BODY
-<!DOCTYPE html>
-<html>
-<head>
-<meta content="text/html; charset=UTF-8" http-equiv="Content-Type">
-
-<title>Error - #{ERB::Util.html_escape exception.class}</title>
-
-<link type="text/css" media="screen" href="#{@mount_path}/css/rdoc.css" rel="stylesheet">
-</head>
-<body>
-<h1>Error</h1>
-
-<p>While processing <code>#{ERB::Util.html_escape req.request_uri}</code> the
-RDoc (#{ERB::Util.html_escape RDoc::VERSION}) server has encountered a
-<code>#{ERB::Util.html_escape exception.class}</code>
-exception:
-
-<pre>#{ERB::Util.html_escape exception.message}</pre>
-
-<p>Please report this to the
-<a href="https://github.com/ruby/rdoc/issues">RDoc issues tracker</a>.  Please
-include the RDoc version, the URI above and exception class, message and
-backtrace.  If you're viewing a gem's documentation, include the gem name and
-version.  If you're viewing Ruby's documentation, include the version of ruby.
-
-<p>Backtrace:
-
-<pre>#{ERB::Util.html_escape backtrace}</pre>
-
-</body>
-</html>
-    BODY
-  end
-
-  ##
-  # Instantiates a Darkfish generator for +store+
-
-  def generator_for store
-    generator = RDoc::Generator::Darkfish.new store, @options
-    generator.file_output = false
-    generator.asset_rel_path = '..'
-
-    rdoc = RDoc::RDoc.new
-    rdoc.store     = store
-    rdoc.generator = generator
-    rdoc.options   = @options
-
-    @options.main_page = store.main
-    @options.title     = store.title
-
-    generator
-  end
-
-  ##
-  # Handles the If-Modified-Since HTTP header on +req+ for +path+.  If the
-  # file has not been modified a Not Modified response is returned.  If the
-  # file has been modified a Last-Modified header is added to +res+.
-
-  def if_modified_since req, res, path = nil
-    last_modified = File.stat(path).mtime if path
-
-    res['last-modified'] = last_modified.httpdate
-
-    return unless ims = req['if-modified-since']
-
-    ims = Time.parse ims
-
-    unless ims < last_modified then
-      res.body = ''
-      raise WEBrick::HTTPStatus::NotModified
-    end
-  end
-
-  ##
-  # Returns an Array of installed documentation.
-  #
-  # Each entry contains the documentation name (gem name, 'Ruby
-  # Documentation', etc.), the path relative to the mount point, whether the
-  # documentation exists, the type of documentation (See RDoc::RI::Paths#each)
-  # and the filesystem to the RDoc::Store for the documentation.
-
-  def installed_docs
-    extra_counter = 0
-    ri_paths.map do |path, type|
-      store = RDoc::Store.new path, type
-      exists = File.exist? store.cache_path
-
-      case type
-      when :gem then
-        gem_path = path[%r%/([^/]*)/ri$%, 1]
-        [gem_path, "#{gem_path}/", exists, type, path]
-      when :system then
-        ['Ruby Documentation', 'ruby/', exists, type, path]
-      when :site then
-        ['Site Documentation', 'site/', exists, type, path]
-      when :home then
-        ['Home Documentation', 'home/', exists, type, path]
-      when :extra then
-        extra_counter += 1
-        store.load_cache if exists
-        title = store.title || "Extra Documentation"
-        [title, "extra-#{extra_counter}/", exists, type, path]
-      end
-    end
-  end
-
-  ##
-  # Returns a 404 page built by +generator+ for +req+ on +res+.
-
-  def not_found generator, req, res, message = nil
-    message ||= "The page <kbd>#{ERB::Util.h req.path}</kbd> was not found"
-    res.body = generator.generate_servlet_not_found message
-    res.status = 404
-  end
-
-  ##
-  # Enumerates the ri paths.  See RDoc::RI::Paths#each
-
-  def ri_paths &block
-    RDoc::RI::Paths.each true, true, true, :all, *@extra_doc_dirs, &block #TODO: pass extra_dirs
-  end
-
-  ##
-  # Generates the root page on +res+.  +req+ is ignored.
-
-  def root req, res
-    generator = RDoc::Generator::Darkfish.new nil, @options
-
-    res.body = generator.generate_servlet_root installed_docs
-
-    res.content_type = 'text/html'
-  end
-
-  ##
-  # Generates a search index for the root page on +res+.  +req+ is ignored.
-
-  def root_search req, res
-    search_index = []
-    info         = []
-
-    installed_docs.map do |name, href, exists, type, path|
-      next unless exists
-
-      search_index << name
-
-      case type
-      when :gem
-        gemspec = path.gsub(%r%/doc/([^/]*?)/ri$%,
-                            '/specifications/\1.gemspec')
-
-        spec = Gem::Specification.load gemspec
-
-        path    = spec.full_name
-        comment = spec.summary
-      when :system then
-        path    = 'ruby'
-        comment = 'Documentation for the Ruby standard library'
-      when :site then
-        path    = 'site'
-        comment = 'Documentation for non-gem libraries'
-      when :home then
-        path    = 'home'
-        comment = 'Documentation from your home directory'
-      when :extra
-        comment = name
-      end
-
-      info << [name, '', path, '', comment]
-    end
-
-    index = {
-      :index => {
-        :searchIndex     => search_index,
-        :longSearchIndex => search_index,
-        :info            => info,
-      }
-    }
-
-    res.body = "var search_data = #{JSON.dump index};"
-    res.content_type = 'application/javascript'
-  end
-
-  ##
-  # Displays documentation for +req+ on +res+, whether that be HTML or some
-  # asset.
-
-  def show_documentation req, res
-    store, path = documentation_source req.path
-
-    if_modified_since req, res, store.cache_path
-
-    generator = generator_for store
-
-    case path
-    when nil, '', 'index.html' then
-      res.body = generator.generate_index
-    when 'table_of_contents.html' then
-      res.body = generator.generate_table_of_contents
-    when 'js/search_index.js' then
-      documentation_search store, generator, req, res
-    else
-      documentation_page store, generator, path, req, res
-    end
-  ensure
-    res.content_type ||= 'text/html'
-  end
-
-  ##
-  # Returns an RDoc::Store for the given +source_name+ ('ruby' or a gem name).
-
-  def store_for source_name
-    case source_name
-    when 'home' then
-      RDoc::Store.new RDoc::RI::Paths.home_dir, :home
-    when 'ruby' then
-      RDoc::Store.new RDoc::RI::Paths.system_dir, :system
-    when 'site' then
-      RDoc::Store.new RDoc::RI::Paths.site_dir, :site
-    when /\Aextra-(\d+)\z/ then
-      index = $1.to_i - 1
-      ri_dir = installed_docs[index][4]
-      RDoc::Store.new ri_dir, :extra
-    else
-      ri_dir, type = ri_paths.find do |dir, dir_type|
-        next unless dir_type == :gem
-
-        source_name == dir[%r%/([^/]*)/ri$%, 1]
-      end
-
-      raise WEBrick::HTTPStatus::NotFound,
-            "Could not find gem \"#{ERB::Util.html_escape(source_name)}\". Are you sure you installed it?" unless ri_dir
-
-      store = RDoc::Store.new ri_dir, type
-
-      return store if File.exist? store.cache_path
-
-      raise WEBrick::HTTPStatus::NotFound,
-            "Could not find documentation for \"#{ERB::Util.html_escape(source_name)}\". Please run `gem rdoc --ri gem_name`"
-
-    end
-  end
-
-end
diff --git a/lib/rdoc/single_class.rb b/lib/rdoc/single_class.rb
deleted file mode 100644
index dd16529648..0000000000
--- a/lib/rdoc/single_class.rb
+++ /dev/null
@@ -1,30 +0,0 @@
-# frozen_string_literal: true
-##
-# A singleton class
-
-class RDoc::SingleClass < RDoc::ClassModule
-
-  ##
-  # Adds the superclass to the included modules.
-
-  def ancestors
-    superclass ? super + [superclass] : super
-  end
-
-  def aref_prefix # :nodoc:
-    'sclass'
-  end
-
-  ##
-  # The definition of this singleton class, <tt>class << MyClassName</tt>
-
-  def definition
-    "class << #{full_name}"
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[class << #{full_name}", "]" do
-      next
-    end
-  end
-end
diff --git a/lib/rdoc/stats.rb b/lib/rdoc/stats.rb
deleted file mode 100644
index 4817c9c729..0000000000
--- a/lib/rdoc/stats.rb
+++ /dev/null
@@ -1,461 +0,0 @@
-# frozen_string_literal: true
-##
-# RDoc statistics collector which prints a summary and report of a project's
-# documentation totals.
-
-class RDoc::Stats
-
-  include RDoc::Text
-
-  ##
-  # Output level for the coverage report
-
-  attr_reader :coverage_level
-
-  ##
-  # Count of files parsed during parsing
-
-  attr_reader :files_so_far
-
-  ##
-  # Total number of files found
-
-  attr_reader :num_files
-
-  ##
-  # Creates a new Stats that will have +num_files+.  +verbosity+ defaults to 1
-  # which will create an RDoc::Stats::Normal outputter.
-
-  def initialize store, num_files, verbosity = 1
-    @num_files = num_files
-    @store     = store
-
-    @coverage_level   = 0
-    @doc_items        = nil
-    @files_so_far     = 0
-    @fully_documented = false
-    @num_params       = 0
-    @percent_doc      = nil
-    @start            = Time.now
-    @undoc_params     = 0
-
-    @display = case verbosity
-               when 0 then Quiet.new   num_files
-               when 1 then Normal.new  num_files
-               else        Verbose.new num_files
-               end
-  end
-
-  ##
-  # Records the parsing of an alias +as+.
-
-  def add_alias as
-    @display.print_alias as
-  end
-
-  ##
-  # Records the parsing of an attribute +attribute+
-
-  def add_attribute attribute
-    @display.print_attribute attribute
-  end
-
-  ##
-  # Records the parsing of a class +klass+
-
-  def add_class klass
-    @display.print_class klass
-  end
-
-  ##
-  # Records the parsing of +constant+
-
-  def add_constant constant
-    @display.print_constant constant
-  end
-
-  ##
-  # Records the parsing of +file+
-
-  def add_file(file)
-    @files_so_far += 1
-    @display.print_file @files_so_far, file
-  end
-
-  ##
-  # Records the parsing of +method+
-
-  def add_method(method)
-    @display.print_method method
-  end
-
-  ##
-  # Records the parsing of a module +mod+
-
-  def add_module(mod)
-    @display.print_module mod
-  end
-
-  ##
-  # Call this to mark the beginning of parsing for display purposes
-
-  def begin_adding
-    @display.begin_adding
-  end
-
-  ##
-  # Calculates documentation totals and percentages for classes, modules,
-  # constants, attributes and methods.
-
-  def calculate
-    return if @doc_items
-
-    ucm = @store.unique_classes_and_modules
-
-    classes = @store.unique_classes.reject { |cm| cm.full_name == 'Object' }
-
-    constants = []
-    ucm.each { |cm| constants.concat cm.constants }
-
-    methods = []
-    ucm.each { |cm| methods.concat cm.method_list }
-
-    attributes = []
-    ucm.each { |cm| attributes.concat cm.attributes }
-
-    @num_attributes, @undoc_attributes = doc_stats attributes
-    @num_classes,    @undoc_classes    = doc_stats classes
-    @num_constants,  @undoc_constants  = doc_stats constants
-    @num_methods,    @undoc_methods    = doc_stats methods
-    @num_modules,    @undoc_modules    = doc_stats @store.unique_modules
-
-    @num_items =
-      @num_attributes +
-      @num_classes +
-      @num_constants +
-      @num_methods +
-      @num_modules +
-      @num_params
-
-    @undoc_items =
-      @undoc_attributes +
-      @undoc_classes +
-      @undoc_constants +
-      @undoc_methods +
-      @undoc_modules +
-      @undoc_params
-
-    @doc_items = @num_items - @undoc_items
-  end
-
-  ##
-  # Sets coverage report level.  Accepted values are:
-  #
-  # false or nil:: No report
-  # 0:: Classes, modules, constants, attributes, methods
-  # 1:: Level 0 + method parameters
-
-  def coverage_level= level
-    level = -1 unless level
-
-    @coverage_level = level
-  end
-
-  ##
-  # Returns the length and number of undocumented items in +collection+.
-
-  def doc_stats collection
-    visible = collection.select { |item| item.display? }
-    [visible.length, visible.count { |item| not item.documented? }]
-  end
-
-  ##
-  # Call this to mark the end of parsing for display purposes
-
-  def done_adding
-    @display.done_adding
-  end
-
-  ##
-  # The documentation status of this project.  +true+ when 100%, +false+ when
-  # less than 100% and +nil+ when unknown.
-  #
-  # Set by calling #calculate
-
-  def fully_documented?
-    @fully_documented
-  end
-
-  ##
-  # A report that says you did a great job!
-
-  def great_job
-    report = RDoc::Markup::Document.new
-
-    report << RDoc::Markup::Paragraph.new('100% documentation!')
-    report << RDoc::Markup::Paragraph.new('Great Job!')
-
-    report
-  end
-
-  ##
-  # Calculates the percentage of items documented.
-
-  def percent_doc
-    return @percent_doc if @percent_doc
-
-    @fully_documented = (@num_items - @doc_items) == 0
-
-    @percent_doc = @doc_items.to_f / @num_items * 100 if @num_items.nonzero?
-    @percent_doc ||= 0
-
-    @percent_doc
-  end
-
-  ##
-  # Returns a report on which items are not documented
-
-  def report
-    if @coverage_level > 0 then
-      extend RDoc::Text
-    end
-
-    if @coverage_level.zero? then
-      calculate
-
-      return great_job if @num_items == @doc_items
-    end
-
-    ucm = @store.unique_classes_and_modules
-
-    report = RDoc::Markup::Document.new
-    report << RDoc::Markup::Paragraph.new('The following items are not documented:')
-    report << RDoc::Markup::BlankLine.new
-
-    ucm.sort.each do |cm|
-      body = report_class_module(cm) {
-        [
-          report_constants(cm),
-          report_attributes(cm),
-          report_methods(cm),
-        ].compact
-      }
-
-      report << body if body
-    end
-
-    if @coverage_level > 0 then
-      calculate
-
-      return great_job if @num_items == @doc_items
-    end
-
-    report
-  end
-
-  ##
-  # Returns a report on undocumented attributes in ClassModule +cm+
-
-  def report_attributes cm
-    return if cm.attributes.empty?
-
-    report = []
-
-    cm.each_attribute do |attr|
-      next if attr.documented?
-      line = attr.line ? ":#{attr.line}" : nil
-      report << "  #{attr.definition} :#{attr.name} # in file #{attr.file.full_name}#{line}\n"
-      report << "\n"
-    end
-
-    report
-  end
-
-  ##
-  # Returns a report on undocumented items in ClassModule +cm+
-
-  def report_class_module cm
-    return if cm.fully_documented? and @coverage_level.zero?
-    return unless cm.display?
-
-    report = RDoc::Markup::Document.new
-
-    if cm.in_files.empty? then
-      report << RDoc::Markup::Paragraph.new("#{cm.definition} is referenced but empty.")
-      report << RDoc::Markup::Paragraph.new("It probably came from another project.  I'm sorry I'm holding it against you.")
-
-      return report
-    elsif cm.documented? then
-      documented = true
-      klass = RDoc::Markup::Verbatim.new("#{cm.definition} # is documented\n")
-    else
-      report << RDoc::Markup::Paragraph.new('In files:')
-
-      list = RDoc::Markup::List.new :BULLET
-
-      cm.in_files.each do |file|
-        para = RDoc::Markup::Paragraph.new file.full_name
-        list << RDoc::Markup::ListItem.new(nil, para)
-      end
-
-      report << list
-      report << RDoc::Markup::BlankLine.new
-
-      klass = RDoc::Markup::Verbatim.new("#{cm.definition}\n")
-    end
-
-    klass << "\n"
-
-    body = yield.flatten # HACK remove #flatten
-
-    if body.empty? then
-      return if documented
-
-      klass.parts.pop
-    else
-      klass.parts.concat body
-    end
-
-    klass << "end\n"
-
-    report << klass
-
-    report
-  end
-
-  ##
-  # Returns a report on undocumented constants in ClassModule +cm+
-
-  def report_constants cm
-    return if cm.constants.empty?
-
-    report = []
-
-    cm.each_constant do |constant|
-      # TODO constant aliases are listed in the summary but not reported
-      # figure out what to do here
-      next if constant.documented? || constant.is_alias_for
-
-      line = constant.line ? ":#{constant.line}" : line
-      report << "  # in file #{constant.file.full_name}#{line}\n"
-      report << "  #{constant.name} = nil\n"
-      report << "\n"
-    end
-
-    report
-  end
-
-  ##
-  # Returns a report on undocumented methods in ClassModule +cm+
-
-  def report_methods cm
-    return if cm.method_list.empty?
-
-    report = []
-
-    cm.each_method do |method|
-      next if method.documented? and @coverage_level.zero?
-
-      if @coverage_level > 0 then
-        params, undoc = undoc_params method
-
-        @num_params += params
-
-        unless undoc.empty? then
-          @undoc_params += undoc.length
-
-          undoc = undoc.map do |param| "+#{param}+" end
-          param_report = "  # #{undoc.join ', '} is not documented\n"
-        end
-      end
-
-      next if method.documented? and not param_report
-
-      line = method.line ? ":#{method.line}" : nil
-      scope = method.singleton ? 'self.' : nil
-
-      report << "  # in file #{method.file.full_name}#{line}\n"
-      report << param_report if param_report
-      report << "  def #{scope}#{method.name}#{method.params}; end\n"
-      report << "\n"
-    end
-
-    report
-  end
-
-  ##
-  # Returns a summary of the collected statistics.
-
-  def summary
-    calculate
-
-    num_width = [@num_files, @num_items].max.to_s.length
-    undoc_width = [
-      @undoc_attributes,
-      @undoc_classes,
-      @undoc_constants,
-      @undoc_items,
-      @undoc_methods,
-      @undoc_modules,
-      @undoc_params,
-    ].max.to_s.length
-
-    report = RDoc::Markup::Verbatim.new
-
-    report << "Files:      %*d\n" % [num_width, @num_files]
-
-    report << "\n"
-
-    report << "Classes:    %*d (%*d undocumented)\n" % [
-      num_width, @num_classes, undoc_width, @undoc_classes]
-    report << "Modules:    %*d (%*d undocumented)\n" % [
-      num_width, @num_modules, undoc_width, @undoc_modules]
-    report << "Constants:  %*d (%*d undocumented)\n" % [
-      num_width, @num_constants, undoc_width, @undoc_constants]
-    report << "Attributes: %*d (%*d undocumented)\n" % [
-      num_width, @num_attributes, undoc_width, @undoc_attributes]
-    report << "Methods:    %*d (%*d undocumented)\n" % [
-      num_width, @num_methods, undoc_width, @undoc_methods]
-    report << "Parameters: %*d (%*d undocumented)\n" % [
-      num_width, @num_params, undoc_width, @undoc_params] if
-        @coverage_level > 0
-
-    report << "\n"
-
-    report << "Total:      %*d (%*d undocumented)\n" % [
-      num_width, @num_items, undoc_width, @undoc_items]
-
-    report << "%6.2f%% documented\n" % percent_doc
-    report << "\n"
-    report << "Elapsed: %0.1fs\n" % (Time.now - @start)
-
-    RDoc::Markup::Document.new report
-  end
-
-  ##
-  # Determines which parameters in +method+ were not documented.  Returns a
-  # total parameter count and an Array of undocumented methods.
-
-  def undoc_params method
-    @formatter ||= RDoc::Markup::ToTtOnly.new
-
-    params = method.param_list
-
-    params = params.map { |param| param.gsub(/^\*\*?/, '') }
-
-    return 0, [] if params.empty?
-
-    document = parse method.comment
-
-    tts = document.accept @formatter
-
-    undoc = params - tts
-
-    [params.length, undoc]
-  end
-
-  autoload :Quiet,   "#{__dir__}/stats/quiet"
-  autoload :Normal,  "#{__dir__}/stats/normal"
-  autoload :Verbose, "#{__dir__}/stats/verbose"
-
-end
diff --git a/lib/rdoc/stats/normal.rb b/lib/rdoc/stats/normal.rb
deleted file mode 100644
index 0a22f0582b..0000000000
--- a/lib/rdoc/stats/normal.rb
+++ /dev/null
@@ -1,58 +0,0 @@
-# frozen_string_literal: true
-begin
-  require 'io/console/size'
-rescue LoadError
-  # for JRuby
-  require 'io/console'
-end
-
-##
-# Stats printer that prints just the files being documented with a progress
-# bar
-
-class RDoc::Stats::Normal < RDoc::Stats::Quiet
-
-  def begin_adding # :nodoc:
-    puts "Parsing sources..."
-    @last_width = 0
-  end
-
-  ##
-  # Prints a file with a progress bar
-
-  def print_file files_so_far, filename
-    progress_bar = sprintf("%3d%% [%2d/%2d]  ",
-                           100 * files_so_far / @num_files,
-                           files_so_far,
-                           @num_files)
-
-    if $stdout.tty?
-      # Print a progress bar, but make sure it fits on a single line. Filename
-      # will be truncated if necessary.
-      size = IO.respond_to?(:console_size) ? IO.console_size : IO.console.winsize
-      terminal_width = size[1].to_i.nonzero? || 80
-      max_filename_size = (terminal_width - progress_bar.size) - 1
-
-      if filename.size > max_filename_size then
-        # Turn "some_long_filename.rb" to "...ong_filename.rb"
-        filename = filename[(filename.size - max_filename_size) .. -1]
-        filename[0..2] = "..."
-      end
-
-      # Clean the line with whitespaces so that leftover output from the
-      # previous line doesn't show up.
-      $stdout.print("\r\e[K") if @last_width && @last_width > 0
-      @last_width = progress_bar.size + filename.size
-      term = "\r"
-    else
-      term = "\n"
-    end
-    $stdout.print(progress_bar, filename, term)
-    $stdout.flush
-  end
-
-  def done_adding # :nodoc:
-    puts
-  end
-
-end
diff --git a/lib/rdoc/stats/quiet.rb b/lib/rdoc/stats/quiet.rb
deleted file mode 100644
index 9c98ea5f86..0000000000
--- a/lib/rdoc/stats/quiet.rb
+++ /dev/null
@@ -1,59 +0,0 @@
-# frozen_string_literal: true
-##
-# Stats printer that prints nothing
-
-class RDoc::Stats::Quiet
-
-  ##
-  # Creates a new Quiet that will print nothing
-
-  def initialize num_files
-    @num_files = num_files
-  end
-
-  ##
-  # Prints a message at the beginning of parsing
-
-  def begin_adding(*) end
-
-  ##
-  # Prints when an alias is added
-
-  def print_alias(*) end
-
-  ##
-  # Prints when an attribute is added
-
-  def print_attribute(*) end
-
-  ##
-  # Prints when a class is added
-
-  def print_class(*) end
-
-  ##
-  # Prints when a constant is added
-
-  def print_constant(*) end
-
-  ##
-  # Prints when a file is added
-
-  def print_file(*) end
-
-  ##
-  # Prints when a method is added
-
-  def print_method(*) end
-
-  ##
-  # Prints when a module is added
-
-  def print_module(*) end
-
-  ##
-  # Prints when RDoc is done
-
-  def done_adding(*) end
-
-end
diff --git a/lib/rdoc/stats/verbose.rb b/lib/rdoc/stats/verbose.rb
deleted file mode 100644
index 7090d561f8..0000000000
--- a/lib/rdoc/stats/verbose.rb
+++ /dev/null
@@ -1,44 +0,0 @@
-# frozen_string_literal: true
-##
-# Stats printer that prints everything documented, including the documented
-# status
-
-class RDoc::Stats::Verbose < RDoc::Stats::Normal
-
-  ##
-  # Returns a marker for RDoc::CodeObject +co+ being undocumented
-
-  def nodoc co
-    " (undocumented)" unless co.documented?
-  end
-
-  def print_alias as # :nodoc:
-    puts "    alias #{as.new_name} #{as.old_name}#{nodoc as}"
-  end
-
-  def print_attribute attribute # :nodoc:
-    puts "    #{attribute.definition} #{attribute.name}#{nodoc attribute}"
-  end
-
-  def print_class(klass) # :nodoc:
-    puts "  class #{klass.full_name}#{nodoc klass}"
-  end
-
-  def print_constant(constant) # :nodoc:
-    puts "    #{constant.name}#{nodoc constant}"
-  end
-
-  def print_file(files_so_far, file) # :nodoc:
-    super
-    puts
-  end
-
-  def print_method(method) # :nodoc:
-    puts "    #{method.singleton ? '::' : '#'}#{method.name}#{nodoc method}"
-  end
-
-  def print_module(mod) # :nodoc:
-    puts "  module #{mod.full_name}#{nodoc mod}"
-  end
-
-end
diff --git a/lib/rdoc/store.rb b/lib/rdoc/store.rb
deleted file mode 100644
index cd27d47dd1..0000000000
--- a/lib/rdoc/store.rb
+++ /dev/null
@@ -1,989 +0,0 @@
-# frozen_string_literal: true
-require 'fileutils'
-
-##
-# A set of rdoc data for a single project (gem, path, etc.).
-#
-# The store manages reading and writing ri data for a project and maintains a
-# cache of methods, classes and ancestors in the store.
-#
-# The store maintains a #cache of its contents for faster lookup.  After
-# adding items to the store it must be flushed using #save_cache.  The cache
-# contains the following structures:
-#
-#    @cache = {
-#      :ancestors        => {}, # class name => ancestor names
-#      :attributes       => {}, # class name => attributes
-#      :class_methods    => {}, # class name => class methods
-#      :instance_methods => {}, # class name => instance methods
-#      :modules          => [], # classes and modules in this store
-#      :pages            => [], # page names
-#    }
-#--
-# TODO need to prune classes
-
-class RDoc::Store
-
-  ##
-  # Errors raised from loading or saving the store
-
-  class Error < RDoc::Error
-  end
-
-  ##
-  # Raised when a stored file for a class, module, page or method is missing.
-
-  class MissingFileError < Error
-
-    ##
-    # The store the file should exist in
-
-    attr_reader :store
-
-    ##
-    # The file the #name should be saved as
-
-    attr_reader :file
-
-    ##
-    # The name of the object the #file would be loaded from
-
-    attr_reader :name
-
-    ##
-    # Creates a new MissingFileError for the missing +file+ for the given
-    # +name+ that should have been in the +store+.
-
-    def initialize store, file, name
-      @store = store
-      @file  = file
-      @name  = name
-    end
-
-    def message # :nodoc:
-      "store at #{@store.path} missing file #{@file} for #{@name}"
-    end
-
-  end
-
-  ##
-  # Stores the name of the C variable a class belongs to.  This helps wire up
-  # classes defined from C across files.
-
-  attr_reader :c_enclosure_classes # :nodoc:
-
-  attr_reader :c_enclosure_names # :nodoc:
-
-  ##
-  # Maps C variables to class or module names for each parsed C file.
-
-  attr_reader :c_class_variables
-
-  ##
-  # Maps C variables to singleton class names for each parsed C file.
-
-  attr_reader :c_singleton_class_variables
-
-  ##
-  # If true this Store will not write any files
-
-  attr_accessor :dry_run
-
-  ##
-  # Path this store reads or writes
-
-  attr_accessor :path
-
-  ##
-  # The RDoc::RDoc driver for this parse tree.  This allows classes consulting
-  # the documentation tree to access user-set options, for example.
-
-  attr_accessor :rdoc
-
-  ##
-  # Type of ri datastore this was loaded from.  See RDoc::RI::Driver,
-  # RDoc::RI::Paths.
-
-  attr_accessor :type
-
-  ##
-  # The contents of the Store
-
-  attr_reader :cache
-
-  ##
-  # The encoding of the contents in the Store
-
-  attr_accessor :encoding
-
-  ##
-  # The lazy constants alias will be discovered in passing
-
-  attr_reader :unmatched_constant_alias
-
-  ##
-  # Creates a new Store of +type+ that will load or save to +path+
-
-  def initialize path = nil, type = nil
-    @dry_run  = false
-    @encoding = nil
-    @path     = path
-    @rdoc     = nil
-    @type     = type
-
-    @cache = {
-      :ancestors                   => {},
-      :attributes                  => {},
-      :class_methods               => {},
-      :c_class_variables           => {},
-      :c_singleton_class_variables => {},
-      :encoding                    => @encoding,
-      :instance_methods            => {},
-      :main                        => nil,
-      :modules                     => [],
-      :pages                       => [],
-      :title                       => nil,
-    }
-
-    @classes_hash = {}
-    @modules_hash = {}
-    @files_hash   = {}
-    @text_files_hash = {}
-
-    @c_enclosure_classes = {}
-    @c_enclosure_names   = {}
-
-    @c_class_variables           = {}
-    @c_singleton_class_variables = {}
-
-    @unique_classes = nil
-    @unique_modules = nil
-
-    @unmatched_constant_alias = {}
-  end
-
-  ##
-  # Adds +module+ as an enclosure (namespace) for the given +variable+ for C
-  # files.
-
-  def add_c_enclosure variable, namespace
-    @c_enclosure_classes[variable] = namespace
-  end
-
-  ##
-  # Adds C variables from an RDoc::Parser::C
-
-  def add_c_variables c_parser
-    filename = c_parser.top_level.relative_name
-
-    @c_class_variables[filename] = make_variable_map c_parser.classes
-
-    @c_singleton_class_variables[filename] = c_parser.singleton_classes
-  end
-
-  ##
-  # Adds the file with +name+ as an RDoc::TopLevel to the store.  Returns the
-  # created RDoc::TopLevel.
-
-  def add_file absolute_name, relative_name: absolute_name, parser: nil
-    unless top_level = @files_hash[relative_name] then
-      top_level = RDoc::TopLevel.new absolute_name, relative_name
-      top_level.parser = parser if parser
-      top_level.store = self
-      @files_hash[relative_name] = top_level
-      @text_files_hash[relative_name] = top_level if top_level.text?
-    end
-
-    top_level
-  end
-
-  ##
-  # Sets the parser of +absolute_name+, unless it from a source code file.
-
-  def update_parser_of_file(absolute_name, parser)
-    if top_level = @files_hash[absolute_name] then
-      @text_files_hash[absolute_name] = top_level if top_level.text?
-    end
-  end
-
-  ##
-  # Returns all classes discovered by RDoc
-
-  def all_classes
-    @classes_hash.values
-  end
-
-  ##
-  # Returns all classes and modules discovered by RDoc
-
-  def all_classes_and_modules
-    @classes_hash.values + @modules_hash.values
-  end
-
-  ##
-  # All TopLevels known to RDoc
-
-  def all_files
-    @files_hash.values
-  end
-
-  ##
-  # Returns all modules discovered by RDoc
-
-  def all_modules
-    modules_hash.values
-  end
-
-  ##
-  # Ancestors cache accessor.  Maps a klass name to an Array of its ancestors
-  # in this store.  If Foo in this store inherits from Object, Kernel won't be
-  # listed (it will be included from ruby's ri store).
-
-  def ancestors
-    @cache[:ancestors]
-  end
-
-  ##
-  # Attributes cache accessor.  Maps a class to an Array of its attributes.
-
-  def attributes
-    @cache[:attributes]
-  end
-
-  ##
-  # Path to the cache file
-
-  def cache_path
-    File.join @path, 'cache.ri'
-  end
-
-  ##
-  # Path to the ri data for +klass_name+
-
-  def class_file klass_name
-    name = klass_name.split('::').last
-    File.join class_path(klass_name), "cdesc-#{name}.ri"
-  end
-
-  ##
-  # Class methods cache accessor.  Maps a class to an Array of its class
-  # methods (not full name).
-
-  def class_methods
-    @cache[:class_methods]
-  end
-
-  ##
-  # Path where data for +klass_name+ will be stored (methods or class data)
-
-  def class_path klass_name
-    File.join @path, *klass_name.split('::')
-  end
-
-  ##
-  # Hash of all classes known to RDoc
-
-  def classes_hash
-    @classes_hash
-  end
-
-  ##
-  # Removes empty items and ensures item in each collection are unique and
-  # sorted
-
-  def clean_cache_collection collection # :nodoc:
-    collection.each do |name, item|
-      if item.empty? then
-        collection.delete name
-      else
-        # HACK mongrel-1.1.5 documents its files twice
-        item.uniq!
-        item.sort!
-      end
-    end
-  end
-
-  ##
-  # Prepares the RDoc code object tree for use by a generator.
-  #
-  # It finds unique classes/modules defined, and replaces classes/modules that
-  # are aliases for another one by a copy with RDoc::ClassModule#is_alias_for
-  # set.
-  #
-  # It updates the RDoc::ClassModule#constant_aliases attribute of "real"
-  # classes or modules.
-  #
-  # It also completely removes the classes and modules that should be removed
-  # from the documentation and the methods that have a visibility below
-  # +min_visibility+, which is the <tt>--visibility</tt> option.
-  #
-  # See also RDoc::Context#remove_from_documentation?
-
-  def complete min_visibility
-    fix_basic_object_inheritance
-
-    # cache included modules before they are removed from the documentation
-    all_classes_and_modules.each { |cm| cm.ancestors }
-
-    unless min_visibility == :nodoc then
-      remove_nodoc @classes_hash
-      remove_nodoc @modules_hash
-    end
-
-    @unique_classes = find_unique @classes_hash
-    @unique_modules = find_unique @modules_hash
-
-    unique_classes_and_modules.each do |cm|
-      cm.complete min_visibility
-    end
-
-    @files_hash.each_key do |file_name|
-      tl = @files_hash[file_name]
-
-      unless tl.text? then
-        tl.modules_hash.clear
-        tl.classes_hash.clear
-
-        tl.classes_or_modules.each do |cm|
-          name = cm.full_name
-          if cm.type == 'class' then
-            tl.classes_hash[name] = cm if @classes_hash[name]
-          else
-            tl.modules_hash[name] = cm if @modules_hash[name]
-          end
-        end
-      end
-    end
-  end
-
-  ##
-  # Hash of all files known to RDoc
-
-  def files_hash
-    @files_hash
-  end
-
-  ##
-  # Finds the enclosure (namespace) for the given C +variable+.
-
-  def find_c_enclosure variable
-    @c_enclosure_classes.fetch variable do
-      break unless name = @c_enclosure_names[variable]
-
-      mod = find_class_or_module name
-
-      unless mod then
-        loaded_mod = load_class_data name
-
-        file = loaded_mod.in_files.first
-
-        return unless file # legacy data source
-
-        file.store = self
-
-        mod = file.add_module RDoc::NormalModule, name
-      end
-
-      @c_enclosure_classes[variable] = mod
-    end
-  end
-
-  ##
-  # Finds the class with +name+ in all discovered classes
-
-  def find_class_named name
-    @classes_hash[name]
-  end
-
-  ##
-  # Finds the class with +name+ starting in namespace +from+
-
-  def find_class_named_from name, from
-    from = find_class_named from unless RDoc::Context === from
-
-    until RDoc::TopLevel === from do
-      return nil unless from
-
-      klass = from.find_class_named name
-      return klass if klass
-
-      from = from.parent
-    end
-
-    find_class_named name
-  end
-
-  ##
-  # Finds the class or module with +name+
-
-  def find_class_or_module name
-    name = $' if name =~ /^::/
-    @classes_hash[name] || @modules_hash[name]
-  end
-
-  ##
-  # Finds the file with +name+ in all discovered files
-
-  def find_file_named name
-    @files_hash[name]
-  end
-
-  ##
-  # Finds the module with +name+ in all discovered modules
-
-  def find_module_named name
-    @modules_hash[name]
-  end
-
-  ##
-  # Returns the RDoc::TopLevel that is a text file and has the given
-  # +file_name+
-
-  def find_text_page file_name
-    @text_files_hash.each_value.find do |file|
-      file.full_name == file_name
-    end
-  end
-
-  ##
-  # Finds unique classes/modules defined in +all_hash+,
-  # and returns them as an array. Performs the alias
-  # updates in +all_hash+: see ::complete.
-  #--
-  # TODO  aliases should be registered by Context#add_module_alias
-
-  def find_unique all_hash
-    unique = []
-
-    all_hash.each_pair do |full_name, cm|
-      unique << cm if full_name == cm.full_name
-    end
-
-    unique
-  end
-
-  ##
-  # Fixes the erroneous <tt>BasicObject < Object</tt> in 1.9.
-  #
-  # Because we assumed all classes without a stated superclass
-  # inherit from Object, we have the above wrong inheritance.
-  #
-  # We fix BasicObject right away if we are running in a Ruby
-  # version >= 1.9.
-
-  def fix_basic_object_inheritance
-    basic = classes_hash['BasicObject']
-    return unless basic
-    basic.superclass = nil
-  end
-
-  ##
-  # Friendly rendition of #path
-
-  def friendly_path
-    case type
-    when :gem    then
-      parent = File.expand_path '..', @path
-      "gem #{File.basename parent}"
-    when :home   then RDoc.home
-    when :site   then 'ruby site'
-    when :system then 'ruby core'
-    else @path
-    end
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x %s %p>" % [self.class, object_id, @path, module_names.sort]
-  end
-
-  ##
-  # Instance methods cache accessor.  Maps a class to an Array of its
-  # instance methods (not full name).
-
-  def instance_methods
-    @cache[:instance_methods]
-  end
-
-  ##
-  # Loads all items from this store into memory.  This recreates a
-  # documentation tree for use by a generator
-
-  def load_all
-    load_cache
-
-    module_names.each do |module_name|
-      mod = find_class_or_module(module_name) || load_class(module_name)
-
-      # load method documentation since the loaded class/module does not have
-      # it
-      loaded_methods = mod.method_list.map do |method|
-        load_method module_name, method.full_name
-      end
-
-      mod.method_list.replace loaded_methods
-
-      loaded_attributes = mod.attributes.map do |attribute|
-        load_method module_name, attribute.full_name
-      end
-
-      mod.attributes.replace loaded_attributes
-    end
-
-    all_classes_and_modules.each do |mod|
-      descendent_re = /^#{mod.full_name}::[^:]+$/
-
-      module_names.each do |name|
-        next unless name =~ descendent_re
-
-        descendent = find_class_or_module name
-
-        case descendent
-        when RDoc::NormalClass then
-          mod.classes_hash[name] = descendent
-        when RDoc::NormalModule then
-          mod.modules_hash[name] = descendent
-        end
-      end
-    end
-
-    @cache[:pages].each do |page_name|
-      page = load_page page_name
-      @files_hash[page_name] = page
-      @text_files_hash[page_name] = page if page.text?
-    end
-  end
-
-  ##
-  # Loads cache file for this store
-
-  def load_cache
-    #orig_enc = @encoding
-
-    @cache = marshal_load(cache_path)
-
-    load_enc = @cache[:encoding]
-
-    # TODO this feature will be time-consuming to add:
-    # a) Encodings may be incompatible but transcodeable
-    # b) Need to warn in the appropriate spots, wherever they may be
-    # c) Need to handle cross-cache differences in encodings
-    # d) Need to warn when generating into a cache with different encodings
-    #
-    #if orig_enc and load_enc != orig_enc then
-    #  warn "Cached encoding #{load_enc} is incompatible with #{orig_enc}\n" \
-    #       "from #{path}/cache.ri" unless
-    #    Encoding.compatible? orig_enc, load_enc
-    #end
-
-    @encoding = load_enc unless @encoding
-
-    @cache[:pages]                       ||= []
-    @cache[:main]                        ||= nil
-    @cache[:c_class_variables]           ||= {}
-    @cache[:c_singleton_class_variables] ||= {}
-
-    @cache[:c_class_variables].each do |_, map|
-      map.each do |variable, name|
-        @c_enclosure_names[variable] = name
-      end
-    end
-
-    @cache
-  rescue Errno::ENOENT
-  end
-
-  ##
-  # Loads ri data for +klass_name+ and hooks it up to this store.
-
-  def load_class klass_name
-    obj = load_class_data klass_name
-
-    obj.store = self
-
-    case obj
-    when RDoc::NormalClass then
-      @classes_hash[klass_name] = obj
-    when RDoc::SingleClass then
-      @classes_hash[klass_name] = obj
-    when RDoc::NormalModule then
-      @modules_hash[klass_name] = obj
-    end
-  end
-
-  ##
-  # Loads ri data for +klass_name+
-
-  def load_class_data klass_name
-    file = class_file klass_name
-
-    marshal_load(file)
-  rescue Errno::ENOENT => e
-    error = MissingFileError.new(self, file, klass_name)
-    error.set_backtrace e.backtrace
-    raise error
-  end
-
-  ##
-  # Loads ri data for +method_name+ in +klass_name+
-
-  def load_method klass_name, method_name
-    file = method_file klass_name, method_name
-
-    obj = marshal_load(file)
-    obj.store = self
-    obj.parent ||= find_class_or_module(klass_name) || load_class(klass_name)
-    obj
-  rescue Errno::ENOENT => e
-    error = MissingFileError.new(self, file, klass_name + method_name)
-    error.set_backtrace e.backtrace
-    raise error
-  end
-
-  ##
-  # Loads ri data for +page_name+
-
-  def load_page page_name
-    file = page_file page_name
-
-    obj = marshal_load(file)
-    obj.store = self
-    obj
-  rescue Errno::ENOENT => e
-    error = MissingFileError.new(self, file, page_name)
-    error.set_backtrace e.backtrace
-    raise error
-  end
-
-  ##
-  # Gets the main page for this RDoc store.  This page is used as the root of
-  # the RDoc server.
-
-  def main
-    @cache[:main]
-  end
-
-  ##
-  # Sets the main page for this RDoc store.
-
-  def main= page
-    @cache[:main] = page
-  end
-
-  ##
-  # Converts the variable => ClassModule map +variables+ from a C parser into
-  # a variable => class name map.
-
-  def make_variable_map variables
-    map = {}
-
-    variables.each { |variable, class_module|
-      map[variable] = class_module.full_name
-    }
-
-    map
-  end
-
-  ##
-  # Path to the ri data for +method_name+ in +klass_name+
-
-  def method_file klass_name, method_name
-    method_name = method_name.split('::').last
-    method_name =~ /#(.*)/
-    method_type = $1 ? 'i' : 'c'
-    method_name = $1 if $1
-    method_name = method_name.gsub(/\W/) { "%%%02x" % $&[0].ord }
-
-    File.join class_path(klass_name), "#{method_name}-#{method_type}.ri"
-  end
-
-  ##
-  # Modules cache accessor.  An Array of all the module (and class) names in
-  # the store.
-
-  def module_names
-    @cache[:modules]
-  end
-
-  ##
-  # Hash of all modules known to RDoc
-
-  def modules_hash
-    @modules_hash
-  end
-
-  ##
-  # Returns the RDoc::TopLevel that is a text file and has the given +name+
-
-  def page name
-    @text_files_hash.each_value.find do |file|
-      file.page_name == name or file.base_name == name
-    end
-  end
-
-  ##
-  # Path to the ri data for +page_name+
-
-  def page_file page_name
-    file_name = File.basename(page_name).gsub('.', '_')
-
-    File.join @path, File.dirname(page_name), "page-#{file_name}.ri"
-  end
-
-  ##
-  # Removes from +all_hash+ the contexts that are nodoc or have no content.
-  #
-  # See RDoc::Context#remove_from_documentation?
-
-  def remove_nodoc all_hash
-    all_hash.keys.each do |name|
-      context = all_hash[name]
-      all_hash.delete(name) if context.remove_from_documentation?
-    end
-  end
-
-  ##
-  # Saves all entries in the store
-
-  def save
-    load_cache
-
-    all_classes_and_modules.each do |klass|
-      save_class klass
-
-      klass.each_method do |method|
-        save_method klass, method
-      end
-
-      klass.each_attribute do |attribute|
-        save_method klass, attribute
-      end
-    end
-
-    all_files.each do |file|
-      save_page file
-    end
-
-    save_cache
-  end
-
-  ##
-  # Writes the cache file for this store
-
-  def save_cache
-    clean_cache_collection @cache[:ancestors]
-    clean_cache_collection @cache[:attributes]
-    clean_cache_collection @cache[:class_methods]
-    clean_cache_collection @cache[:instance_methods]
-
-    @cache[:modules].uniq!
-    @cache[:modules].sort!
-
-    @cache[:pages].uniq!
-    @cache[:pages].sort!
-
-    @cache[:encoding] = @encoding # this gets set twice due to assert_cache
-
-    @cache[:c_class_variables].merge!           @c_class_variables
-    @cache[:c_singleton_class_variables].merge! @c_singleton_class_variables
-
-    return if @dry_run
-
-    File.open cache_path, 'wb' do |io|
-      Marshal.dump @cache, io
-    end
-  end
-
-  ##
-  # Writes the ri data for +klass+ (or module)
-
-  def save_class klass
-    full_name = klass.full_name
-
-    FileUtils.mkdir_p class_path(full_name) unless @dry_run
-
-    @cache[:modules] << full_name
-
-    path = class_file full_name
-
-    begin
-      disk_klass = load_class full_name
-
-      klass = disk_klass.merge klass
-    rescue MissingFileError
-    end
-
-    # BasicObject has no ancestors
-    ancestors = klass.direct_ancestors.compact.map do |ancestor|
-      # HACK for classes we don't know about (class X < RuntimeError)
-      String === ancestor ? ancestor : ancestor.full_name
-    end
-
-    @cache[:ancestors][full_name] ||= []
-    @cache[:ancestors][full_name].concat ancestors
-
-    attribute_definitions = klass.attributes.map do |attribute|
-      "#{attribute.definition} #{attribute.name}"
-    end
-
-    unless attribute_definitions.empty? then
-      @cache[:attributes][full_name] ||= []
-      @cache[:attributes][full_name].concat attribute_definitions
-    end
-
-    to_delete = []
-
-    unless klass.method_list.empty? then
-      @cache[:class_methods][full_name]    ||= []
-      @cache[:instance_methods][full_name] ||= []
-
-      class_methods, instance_methods =
-        klass.method_list.partition { |meth| meth.singleton }
-
-      class_methods    = class_methods.   map { |method| method.name }
-      instance_methods = instance_methods.map { |method| method.name }
-      attribute_names  = klass.attributes.map { |attr|   attr.name }
-
-      old = @cache[:class_methods][full_name] - class_methods
-      to_delete.concat old.map { |method|
-        method_file full_name, "#{full_name}::#{method}"
-      }
-
-      old = @cache[:instance_methods][full_name] -
-        instance_methods - attribute_names
-      to_delete.concat old.map { |method|
-        method_file full_name, "#{full_name}##{method}"
-      }
-
-      @cache[:class_methods][full_name]    = class_methods
-      @cache[:instance_methods][full_name] = instance_methods
-    end
-
-    return if @dry_run
-
-    FileUtils.rm_f to_delete
-
-    File.open path, 'wb' do |io|
-      Marshal.dump klass, io
-    end
-  end
-
-  ##
-  # Writes the ri data for +method+ on +klass+
-
-  def save_method klass, method
-    full_name = klass.full_name
-
-    FileUtils.mkdir_p class_path(full_name) unless @dry_run
-
-    cache = if method.singleton then
-              @cache[:class_methods]
-            else
-              @cache[:instance_methods]
-            end
-    cache[full_name] ||= []
-    cache[full_name] << method.name
-
-    return if @dry_run
-
-    File.open method_file(full_name, method.full_name), 'wb' do |io|
-      Marshal.dump method, io
-    end
-  end
-
-  ##
-  # Writes the ri data for +page+
-
-  def save_page page
-    return unless page.text?
-
-    path = page_file page.full_name
-
-    FileUtils.mkdir_p File.dirname(path) unless @dry_run
-
-    cache[:pages] ||= []
-    cache[:pages] << page.full_name
-
-    return if @dry_run
-
-    File.open path, 'wb' do |io|
-      Marshal.dump page, io
-    end
-  end
-
-  ##
-  # Source of the contents of this store.
-  #
-  # For a store from a gem the source is the gem name.  For a store from the
-  # home directory the source is "home".  For system ri store (the standard
-  # library documentation) the source is"ruby".  For a store from the site
-  # ri directory the store is "site".  For other stores the source is the
-  # #path.
-
-  def source
-    case type
-    when :gem    then File.basename File.expand_path '..', @path
-    when :home   then 'home'
-    when :site   then 'site'
-    when :system then 'ruby'
-    else @path
-    end
-  end
-
-  ##
-  # Gets the title for this RDoc store.  This is used as the title in each
-  # page on the RDoc server
-
-  def title
-    @cache[:title]
-  end
-
-  ##
-  # Sets the title page for this RDoc store.
-
-  def title= title
-    @cache[:title] = title
-  end
-
-  ##
-  # Returns the unique classes discovered by RDoc.
-  #
-  # ::complete must have been called prior to using this method.
-
-  def unique_classes
-    @unique_classes
-  end
-
-  ##
-  # Returns the unique classes and modules discovered by RDoc.
-  # ::complete must have been called prior to using this method.
-
-  def unique_classes_and_modules
-    @unique_classes + @unique_modules
-  end
-
-  ##
-  # Returns the unique modules discovered by RDoc.
-  # ::complete must have been called prior to using this method.
-
-  def unique_modules
-    @unique_modules
-  end
-
-  private
-  def marshal_load(file)
-    File.open(file, 'rb') {|io| Marshal.load(io, MarshalFilter)}
-  end
-
-  MarshalFilter = proc do |obj|
-    case obj
-    when true, false, nil, Array, Class, Encoding, Hash, Integer, String, Symbol, RDoc::Text
-    else
-      unless obj.class.name.start_with?("RDoc::")
-        raise TypeError, "not permitted class: #{obj.class.name}"
-      end
-    end
-    obj
-  end
-  private_constant :MarshalFilter
-
-end
diff --git a/lib/rdoc/task.rb b/lib/rdoc/task.rb
deleted file mode 100644
index eb584c9d2a..0000000000
--- a/lib/rdoc/task.rb
+++ /dev/null
@@ -1,355 +0,0 @@
-# frozen_string_literal: true
-#--
-# Copyright (c) 2003, 2004 Jim Weirich, 2009 Eric Hodel
-#
-# 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
-  gem 'rdoc'
-rescue Gem::LoadError
-end unless defined?(RDoc)
-
-begin
-  gem 'rake'
-rescue Gem::LoadError
-end unless defined?(Rake)
-
-require_relative '../rdoc'
-require 'rake'
-require 'rake/tasklib'
-
-##
-# RDoc::Task creates the following rake tasks to generate and clean up RDoc
-# output:
-#
-# [rdoc]
-#   Main task for this RDoc task.
-#
-# [clobber_rdoc]
-#   Delete all the rdoc files.  This target is automatically added to the main
-#   clobber target.
-#
-# [rerdoc]
-#   Rebuild the rdoc files from scratch, even if they are not out of date.
-#
-# [rdoc:coverage]
-#   Print RDoc coverage report for all rdoc files.
-#
-# Simple Example:
-#
-#   require 'rdoc/task'
-#
-#   RDoc::Task.new do |rdoc|
-#     rdoc.main = "README.rdoc"
-#     rdoc.rdoc_files.include("README.rdoc", "lib/**/*.rb")
-#   end
-#
-# The +rdoc+ object passed to the block is an RDoc::Task object. See the
-# attributes list for the RDoc::Task class for available customization options.
-#
-# == Specifying different task names
-#
-# You may wish to give the task a different name, such as if you are
-# generating two sets of documentation.  For instance, if you want to have a
-# development set of documentation including private methods:
-#
-#   require 'rdoc/task'
-#
-#   RDoc::Task.new :rdoc_dev do |rdoc|
-#     rdoc.main = "README.rdoc"
-#     rdoc.rdoc_files.include("README.rdoc", "lib/**/*.rb")
-#     rdoc.options << "--all"
-#   end
-#
-# The tasks would then be named :<em>rdoc_dev</em>,
-# :clobber_<em>rdoc_dev</em>, and :re<em>rdoc_dev</em>.
-#
-# If you wish to have completely different task names, then pass a Hash as
-# first argument. With the <tt>:rdoc</tt>, <tt>:clobber_rdoc</tt> and
-# <tt>:rerdoc</tt> options, you can customize the task names to your liking.
-#
-# For example:
-#
-#   require 'rdoc/task'
-#
-#   RDoc::Task.new(:rdoc => "rdoc", :clobber_rdoc => "rdoc:clean",
-#                  :rerdoc => "rdoc:force")
-#
-# This will create the tasks <tt>:rdoc</tt>, <tt>:rdoc:clean</tt>,
-# <tt>:rdoc:force</tt>, and <tt>:rdoc:coverage</tt>.
-
-class RDoc::Task < Rake::TaskLib
-
-  ##
-  # Name of the main, top level task.  (default is :rdoc)
-
-  attr_accessor :name
-
-  ##
-  # Comment markup format.  rdoc, rd and tomdoc are supported.  (default is
-  # 'rdoc')
-
-  attr_accessor :markup
-
-  ##
-  # Name of directory to receive the html output files. (default is "html")
-
-  attr_accessor :rdoc_dir
-
-  ##
-  # Title of RDoc documentation. (defaults to rdoc's default)
-
-  attr_accessor :title
-
-  ##
-  # Name of file to be used as the main, top level file of the RDoc. (default
-  # is none)
-
-  attr_accessor :main
-
-  ##
-  # Name of template to be used by rdoc. (defaults to rdoc's default)
-
-  attr_accessor :template
-
-  ##
-  # Name of format generator (<tt>--format</tt>) used by rdoc. (defaults to
-  # rdoc's default)
-
-  attr_accessor :generator
-
-  ##
-  # List of files to be included in the rdoc generation. (default is [])
-
-  attr_accessor :rdoc_files
-
-  ##
-  # Additional list of options to be passed rdoc.  (default is [])
-
-  attr_accessor :options
-
-  ##
-  # Whether to run the rdoc process as an external shell (default is false)
-
-  attr_accessor :external
-
-  ##
-  # Create an RDoc task with the given name. See the RDoc::Task class overview
-  # for documentation.
-
-  def initialize name = :rdoc # :yield: self
-    defaults
-
-    check_names name
-
-    @name = name
-
-    yield self if block_given?
-
-    define
-  end
-
-  ##
-  # Ensures that +names+ only includes names for the :rdoc, :clobber_rdoc and
-  # :rerdoc.  If other names are given an ArgumentError is raised.
-
-  def check_names names
-    return unless Hash === names
-
-    invalid_options =
-      names.keys.map { |k| k.to_sym } - [:rdoc, :clobber_rdoc, :rerdoc]
-
-    unless invalid_options.empty? then
-      raise ArgumentError, "invalid options: #{invalid_options.join ', '}"
-    end
-  end
-
-  ##
-  # Task description for the clobber rdoc task or its renamed equivalent
-
-  def clobber_task_description
-    "Remove RDoc HTML files"
-  end
-
-  ##
-  # Sets default task values
-
-  def defaults
-    @name = :rdoc
-    @rdoc_files = Rake::FileList.new
-    @rdoc_dir = 'html'
-    @main = nil
-    @title = nil
-    @template = nil
-    @generator = nil
-    @options = []
-  end
-
-  ##
-  # All source is inline now.  This method is deprecated
-
-  def inline_source # :nodoc:
-    warn "RDoc::Task#inline_source is deprecated"
-    true
-  end
-
-  ##
-  # All source is inline now.  This method is deprecated
-
-  def inline_source=(value) # :nodoc:
-    warn "RDoc::Task#inline_source is deprecated"
-  end
-
-  ##
-  # Create the tasks defined by this task lib.
-
-  def define
-    desc rdoc_task_description
-    task rdoc_task_name
-
-    desc rerdoc_task_description
-    task rerdoc_task_name => [clobber_task_name, rdoc_task_name]
-
-    desc clobber_task_description
-    task clobber_task_name do
-      rm_r @rdoc_dir rescue nil
-    end
-
-    task :clobber => [clobber_task_name]
-
-    directory @rdoc_dir
-
-    rdoc_target_deps = [
-      @rdoc_files,
-      Rake.application.rakefile
-    ].flatten.compact
-
-    task rdoc_task_name => [rdoc_target]
-    file rdoc_target => rdoc_target_deps do
-      @before_running_rdoc.call if @before_running_rdoc
-      args = option_list + @rdoc_files
-
-      $stderr.puts "rdoc #{args.join ' '}" if Rake.application.options.trace
-      RDoc::RDoc.new.document args
-    end
-
-    namespace rdoc_task_name do
-      desc coverage_task_description
-      task coverage_task_name do
-        @before_running_rdoc.call if @before_running_rdoc
-        opts = option_list << "-C"
-        args = opts + @rdoc_files
-
-        $stderr.puts "rdoc #{args.join ' '}" if Rake.application.options.trace
-        RDoc::RDoc.new.document args
-      end
-    end
-
-    self
-  end
-
-  ##
-  # List of options that will be supplied to RDoc
-
-  def option_list
-    result = @options.dup
-    result << "-o"       << @rdoc_dir
-    result << "--main"   << main      if main
-    result << "--markup" << markup    if markup
-    result << "--title"  << title     if title
-    result << "-T"       << template  if template
-    result << '-f'       << generator if generator
-    result
-  end
-
-  ##
-  # The block passed to this method will be called just before running the
-  # RDoc generator. It is allowed to modify RDoc::Task attributes inside the
-  # block.
-
-  def before_running_rdoc(&block)
-    @before_running_rdoc = block
-  end
-
-  ##
-  # Task description for the rdoc task or its renamed equivalent
-
-  def rdoc_task_description
-    'Build RDoc HTML files'
-  end
-
-  ##
-  # Task description for the rerdoc task or its renamed description
-
-  def rerdoc_task_description
-    "Rebuild RDoc HTML files"
-  end
-
-  ##
-  # Task description for the coverage task or its renamed description
-
-  def coverage_task_description
-    "Print RDoc coverage report"
-  end
-
-  private
-
-  def rdoc_target
-    "#{rdoc_dir}/created.rid"
-  end
-
-  def rdoc_task_name
-    case name
-    when Hash then (name[:rdoc] || "rdoc").to_s
-    else           name.to_s
-    end
-  end
-
-  def clobber_task_name
-    case name
-    when Hash then (name[:clobber_rdoc] || "clobber_rdoc").to_s
-    else           "clobber_#{name}"
-    end
-  end
-
-  def rerdoc_task_name
-    case name
-    when Hash then (name[:rerdoc] || "rerdoc").to_s
-    else           "re#{name}"
-    end
-  end
-
-  def coverage_task_name
-    "coverage"
-  end
-
-end
-
-# :stopdoc:
-module Rake
-
-  ##
-  # For backwards compatibility
-
-  RDocTask = RDoc::Task # :nodoc:
-
-end
-# :startdoc:
diff --git a/lib/rdoc/text.rb b/lib/rdoc/text.rb
deleted file mode 100644
index 9804f81abe..0000000000
--- a/lib/rdoc/text.rb
+++ /dev/null
@@ -1,322 +0,0 @@
-# frozen_string_literal: true
-
-##
-# For RDoc::Text#to_html
-
-require 'strscan'
-
-##
-# Methods for manipulating comment text
-
-module RDoc::Text
-
-  ##
-  # The language for this text.  This affects stripping comments
-  # markers.
-
-  attr_accessor :language
-
-  ##
-  # Maps markup formats to classes that can parse them.  If the format is
-  # unknown, "rdoc" format is used.
-
-  MARKUP_FORMAT = {
-    'markdown' => RDoc::Markdown,
-    'rdoc'     => RDoc::Markup,
-    'rd'       => RDoc::RD,
-    'tomdoc'   => RDoc::TomDoc,
-  }
-
-  MARKUP_FORMAT.default = RDoc::Markup
-
-  ##
-  # Maps an encoding to a Hash of characters properly transcoded for that
-  # encoding.
-  #
-  # See also encode_fallback.
-
-  TO_HTML_CHARACTERS = Hash.new do |h, encoding|
-    h[encoding] = {
-      :close_dquote => encode_fallback('”', encoding, '"'),
-      :close_squote => encode_fallback('’', encoding, '\''),
-      :copyright    => encode_fallback('©', encoding, '(c)'),
-      :ellipsis     => encode_fallback('…', encoding, '...'),
-      :em_dash      => encode_fallback('—', encoding, '---'),
-      :en_dash      => encode_fallback('–', encoding, '--'),
-      :open_dquote  => encode_fallback('“', encoding, '"'),
-      :open_squote  => encode_fallback('‘', encoding, '\''),
-      :trademark    => encode_fallback('®', encoding, '(r)'),
-    }
-  end
-
-  ##
-  # Transcodes +character+ to +encoding+ with a +fallback+ character.
-
-  def self.encode_fallback character, encoding, fallback
-    character.encode(encoding, :fallback => { character => fallback },
-                     :undef => :replace, :replace => fallback)
-  end
-
-  ##
-  # Expands tab characters in +text+ to eight spaces
-
-  def expand_tabs text
-    expanded = []
-
-    text.each_line do |line|
-      nil while line.gsub!(/(?:\G|\r)((?:.{8})*?)([^\t\r\n]{0,7})\t/) do
-        r = "#{$1}#{$2}#{' ' * (8 - $2.size)}"
-        r = RDoc::Encoding.change_encoding r, text.encoding
-        r
-      end
-
-      expanded << line
-    end
-
-    expanded.join
-  end
-
-  ##
-  # Flush +text+ left based on the shortest line
-
-  def flush_left text
-    indent = 9999
-
-    text.each_line do |line|
-      line_indent = line =~ /\S/ || 9999
-      indent = line_indent if indent > line_indent
-    end
-
-    empty = ''
-    empty = RDoc::Encoding.change_encoding empty, text.encoding
-
-    text.gsub(/^ {0,#{indent}}/, empty)
-  end
-
-  ##
-  # Convert a string in markup format into HTML.
-  #
-  # Requires the including class to implement #formatter
-
-  def markup text
-    if @store.rdoc.options
-      locale = @store.rdoc.options.locale
-    else
-      locale = nil
-    end
-    if locale
-      i18n_text = RDoc::I18n::Text.new(text)
-      text = i18n_text.translate(locale)
-    end
-    parse(text).accept formatter
-  end
-
-  ##
-  # Strips hashes, expands tabs then flushes +text+ to the left
-
-  def normalize_comment text
-    return text if text.empty?
-
-    case language
-    when :ruby
-      text = strip_hashes text
-    when :c
-      text = strip_stars text
-    end
-    text = expand_tabs    text
-    text = flush_left     text
-    text = strip_newlines text
-    text
-  end
-
-  ##
-  # Normalizes +text+ then builds a RDoc::Markup::Document from it
-
-  def parse text, format = 'rdoc'
-    return text if RDoc::Markup::Document === text
-    return text.parse if RDoc::Comment === text
-
-    text = normalize_comment text # TODO remove, should not be necessary
-
-    return RDoc::Markup::Document.new if text =~ /\A\n*\z/
-
-    MARKUP_FORMAT[format].parse text
-  end
-
-  ##
-  # The first +limit+ characters of +text+ as HTML
-
-  def snippet text, limit = 100
-    document = parse text
-
-    RDoc::Markup::ToHtmlSnippet.new(options, limit).convert document
-  end
-
-  ##
-  # Strips leading # characters from +text+
-
-  def strip_hashes text
-    return text if text =~ /^(?>\s*)[^\#]/
-
-    empty = ''
-    empty = RDoc::Encoding.change_encoding empty, text.encoding
-
-    text.gsub(/^\s*(#+)/) { $1.tr '#', ' ' }.gsub(/^\s+$/, empty)
-  end
-
-  ##
-  # Strips leading and trailing \n characters from +text+
-
-  def strip_newlines text
-    text.gsub(/\A\n*(.*?)\n*\z/m) do $1 end # block preserves String encoding
-  end
-
-  ##
-  # Strips /* */ style comments
-
-  def strip_stars text
-    return text unless text =~ %r%/\*.*\*/%m
-
-    encoding = text.encoding
-
-    text = text.gsub %r%Document-method:\s+[\w:.#=!?|^&<>~+\-/*\%@`\[\]]+%, ''
-
-    space = ' '
-    space = RDoc::Encoding.change_encoding space, encoding if encoding
-
-    text.sub!  %r%/\*+%       do space * $&.length end
-    text.sub!  %r%\*+/%       do space * $&.length end
-    text.gsub! %r%^[ \t]*\*%m do space * $&.length end
-
-    empty = ''
-    empty = RDoc::Encoding.change_encoding empty, encoding if encoding
-    text.gsub(/^\s+$/, empty)
-  end
-
-  ##
-  # Converts ampersand, dashes, ellipsis, quotes, copyright and registered
-  # trademark symbols in +text+ to properly encoded characters.
-
-  def to_html text
-    html = (''.encode text.encoding).dup
-
-    encoded = RDoc::Text::TO_HTML_CHARACTERS[text.encoding]
-
-    s = StringScanner.new text
-    insquotes = false
-    indquotes = false
-    after_word = nil
-
-    until s.eos? do
-      case
-      when s.scan(/<(tt|code)>.*?<\/\1>/) then # skip contents of tt
-        html << s.matched.gsub('\\\\', '\\')
-      when s.scan(/<(tt|code)>.*?/) then
-        warn "mismatched <#{s[1]}> tag" # TODO signal file/line
-        html << s.matched
-      when s.scan(/<[^>]+\/?s*>/) then # skip HTML tags
-        html << s.matched
-      when s.scan(/\\(\S)/) then # unhandled suppressed crossref
-        html << s[1]
-        after_word = nil
-      when s.scan(/\.\.\.(\.?)/) then
-        html << s[1] << encoded[:ellipsis]
-        after_word = nil
-      when s.scan(/\(c\)/i) then
-        html << encoded[:copyright]
-        after_word = nil
-      when s.scan(/\(r\)/i) then
-        html << encoded[:trademark]
-        after_word = nil
-      when s.scan(/---/) then
-        html << encoded[:em_dash]
-        after_word = nil
-      when s.scan(/--/) then
-        html << encoded[:en_dash]
-        after_word = nil
-      when s.scan(/&quot;|"/) then
-        html << encoded[indquotes ? :close_dquote : :open_dquote]
-        indquotes = !indquotes
-        after_word = nil
-      when s.scan(/``/) then # backtick double quote
-        html << encoded[:open_dquote]
-        after_word = nil
-      when s.scan(/(?:&#39;|'){2}/) then # tick double quote
-        html << encoded[:close_dquote]
-        after_word = nil
-      when s.scan(/`/) then # backtick
-        if insquotes or after_word
-          html << '`'
-          after_word = false
-        else
-          html << encoded[:open_squote]
-          insquotes = true
-        end
-      when s.scan(/&#39;|'/) then # single quote
-        if insquotes
-          html << encoded[:close_squote]
-          insquotes = false
-        elsif after_word
-          # Mary's dog, my parents' house: do not start paired quotes
-          html << encoded[:close_squote]
-        else
-          html << encoded[:open_squote]
-          insquotes = true
-        end
-
-        after_word = nil
-      else # advance to the next potentially significant character
-        match = s.scan(/.+?(?=[<\\.("'`&-])/) #"
-
-        if match then
-          html << match
-          after_word = match =~ /\w$/
-        else
-          html << s.rest
-          break
-        end
-      end
-    end
-
-    html
-  end
-
-  ##
-  # Wraps +txt+ to +line_len+
-
-  def wrap(txt, line_len = 76)
-    res = []
-    sp = 0
-    ep = txt.length
-
-    while sp < ep
-      # scan back for a space
-      p = sp + line_len - 1
-      if p >= ep
-        p = ep
-      else
-        while p > sp and txt[p] != ?\s
-          p -= 1
-        end
-        if p <= sp
-          p = sp + line_len
-          while p < ep and txt[p] != ?\s
-            p += 1
-          end
-        end
-      end
-      res << txt[sp...p] << "\n"
-      sp = p
-      sp += 1 while sp < ep and txt[sp] == ?\s
-    end
-
-    res.join.strip
-  end
-
-  ##
-  # Character class to be separated by a space when concatenating
-  # lines.
-
-  SPACE_SEPARATED_LETTER_CLASS = /[\p{Nd}\p{Lc}\p{Pc}]|[!-~&&\W]/
-
-end
diff --git a/lib/rdoc/token_stream.rb b/lib/rdoc/token_stream.rb
deleted file mode 100644
index 19ca7ed248..0000000000
--- a/lib/rdoc/token_stream.rb
+++ /dev/null
@@ -1,118 +0,0 @@
-# frozen_string_literal: true
-##
-# A TokenStream is a list of tokens, gathered during the parse of some entity
-# (say a method). Entities populate these streams by being registered with the
-# lexer. Any class can collect tokens by including TokenStream. From the
-# outside, you use such an object by calling the start_collecting_tokens
-# method, followed by calls to add_token and pop_token.
-
-module RDoc::TokenStream
-
-  ##
-  # Converts +token_stream+ to HTML wrapping various tokens with
-  # <tt><span></tt> elements. Some tokens types are wrapped in spans
-  # with the given class names. Other token types are not wrapped in spans.
-
-  def self.to_html token_stream
-    starting_title = false
-
-    token_stream.map do |t|
-      next unless t
-
-      style = case t[:kind]
-              when :on_const   then 'ruby-constant'
-              when :on_kw      then 'ruby-keyword'
-              when :on_ivar    then 'ruby-ivar'
-              when :on_cvar    then 'ruby-identifier'
-              when :on_gvar    then 'ruby-identifier'
-              when '=' != t[:text] && :on_op
-                               then 'ruby-operator'
-              when :on_tlambda then 'ruby-operator'
-              when :on_ident   then 'ruby-identifier'
-              when :on_label   then 'ruby-value'
-              when :on_backref, :on_dstring
-                               then 'ruby-node'
-              when :on_comment then 'ruby-comment'
-              when :on_embdoc  then 'ruby-comment'
-              when :on_regexp  then 'ruby-regexp'
-              when :on_tstring then 'ruby-string'
-              when :on_int, :on_float,
-                   :on_rational, :on_imaginary,
-                   :on_heredoc,
-                   :on_symbol, :on_CHAR then 'ruby-value'
-              when :on_heredoc_beg, :on_heredoc_end
-                               then 'ruby-identifier'
-              end
-
-      comment_with_nl = false
-      if :on_comment == t[:kind] or :on_embdoc == t[:kind] or :on_heredoc_end == t[:kind]
-        comment_with_nl = true if "\n" == t[:text][-1]
-        text = t[:text].rstrip
-      else
-        text = t[:text]
-      end
-
-      if :on_ident == t[:kind] && starting_title
-        starting_title = false
-        style = 'ruby-identifier ruby-title'
-      end
-
-      if :on_kw == t[:kind] and 'def' == t[:text]
-        starting_title = true
-      end
-
-      text = CGI.escapeHTML text
-
-      if style then
-        "<span class=\"#{style}\">#{text}</span>#{"\n" if comment_with_nl}"
-      else
-        text
-      end
-    end.join
-  end
-
-  ##
-  # Adds +tokens+ to the collected tokens
-
-  def add_tokens(tokens)
-    @token_stream.concat(tokens)
-  end
-
-  ##
-  # Adds one +token+ to the collected tokens
-
-  def add_token(token)
-    @token_stream.push(token)
-  end
-
-  ##
-  # Starts collecting tokens
-
-  def collect_tokens
-    @token_stream = []
-  end
-
-  alias start_collecting_tokens collect_tokens
-
-  ##
-  # Remove the last token from the collected tokens
-
-  def pop_token
-    @token_stream.pop
-  end
-
-  ##
-  # Current token stream
-
-  def token_stream
-    @token_stream
-  end
-
-  ##
-  # Returns a string representation of the token stream
-
-  def tokens_to_s
-    (token_stream or return '').compact.map { |token| token[:text] }.join ''
-  end
-
-end
diff --git a/lib/rdoc/tom_doc.rb b/lib/rdoc/tom_doc.rb
deleted file mode 100644
index e161fcf42f..0000000000
--- a/lib/rdoc/tom_doc.rb
+++ /dev/null
@@ -1,263 +0,0 @@
-# frozen_string_literal: true
-# :markup: tomdoc
-
-# A parser for TomDoc based on TomDoc 1.0.0-rc1 (02adef9b5a)
-#
-# The TomDoc specification can be found at:
-#
-# http://tomdoc.org
-#
-# The latest version of the TomDoc specification can be found at:
-#
-# https://github.com/mojombo/tomdoc/blob/master/tomdoc.md
-#
-# To choose TomDoc as your only default format see RDoc::Options@Saved+Options
-# for instructions on setting up a <code>.rdoc_options</code> file to store
-# your project default.
-#
-# There are a few differences between this parser and the specification.  A
-# best-effort was made to follow the specification as closely as possible but
-# some choices to deviate were made.
-#
-# A future version of RDoc will warn when a MUST or MUST NOT is violated and
-# may warn when a SHOULD or SHOULD NOT is violated.  RDoc will always try
-# to emit documentation even if given invalid TomDoc.
-#
-# Here are some implementation choices this parser currently makes:
-#
-# This parser allows rdoc-style inline markup but you should not depended on
-# it.
-#
-# This parser allows a space between the comment and the method body.
-#
-# This parser does not require the default value to be described for an
-# optional argument.
-#
-# This parser does not examine the order of sections.  An Examples section may
-# precede the Arguments section.
-#
-# This class is documented in TomDoc format.  Since this is a subclass of the
-# RDoc markup parser there isn't much to see here, unfortunately.
-
-class RDoc::TomDoc < RDoc::Markup::Parser
-
-  # Internal: Token accessor
-
-  attr_reader :tokens
-
-  # Internal: Adds a post-processor which sets the RDoc section based on the
-  # comment's status.
-  #
-  # Returns nothing.
-
-  def self.add_post_processor # :nodoc:
-    RDoc::Markup::PreProcess.post_process do |comment, code_object|
-      next unless code_object and
-                  RDoc::Comment === comment and comment.format == 'tomdoc'
-
-      comment.text.gsub!(/(\A\s*# )(Public|Internal|Deprecated):\s+/) do
-        section = code_object.add_section $2
-        code_object.temporary_section = section
-
-        $1
-      end
-    end
-  end
-
-  add_post_processor
-
-  # Public: Parses TomDoc from text
-  #
-  # text - A String containing TomDoc-format text.
-  #
-  # Examples
-  #
-  #   RDoc::TomDoc.parse <<-TOMDOC
-  #   This method does some things
-  #
-  #   Returns nothing.
-  #   TOMDOC
-  #   # => #<RDoc::Markup::Document:0xXXX @parts=[...], @file=nil>
-  #
-  # Returns an RDoc::Markup::Document representing the TomDoc format.
-
-  def self.parse text
-    parser = new
-
-    parser.tokenize text
-    doc = RDoc::Markup::Document.new
-    parser.parse doc
-    doc
-  end
-
-  # Internal: Extracts the Signature section's method signature
-  #
-  # comment - An RDoc::Comment that will be parsed and have the signature
-  #           extracted
-  #
-  # Returns a String containing the signature and nil if not
-
-  def self.signature comment
-    return unless comment.tomdoc?
-
-    document = comment.parse
-
-    signature = nil
-    found_heading = false
-    found_signature = false
-
-    document.parts.delete_if do |part|
-      next false if found_signature
-
-      found_heading ||=
-        RDoc::Markup::Heading === part && part.text == 'Signature'
-
-      next false unless found_heading
-
-      next true if RDoc::Markup::BlankLine === part
-
-      if RDoc::Markup::Verbatim === part then
-        signature = part
-        found_signature = true
-      end
-    end
-
-    signature and signature.text
-  end
-
-  # Public: Creates a new TomDoc parser.  See also RDoc::Markup::parse
-
-  def initialize
-    super
-
-    @section      = nil
-    @seen_returns = false
-  end
-
-  # Internal: Builds a heading from the token stream
-  #
-  # level - The level of heading to create
-  #
-  # Returns an RDoc::Markup::Heading
-
-  def build_heading level
-    heading = super
-
-    @section = heading.text
-
-    heading
-  end
-
-  # Internal: Builds a verbatim from the token stream.  A verbatim in the
-  # Examples section will be marked as in Ruby format.
-  #
-  # margin - The indentation from the margin for lines that belong to this
-  #          verbatim section.
-  #
-  # Returns an RDoc::Markup::Verbatim
-
-  def build_verbatim margin
-    verbatim = super
-
-    verbatim.format = :ruby if @section == 'Examples'
-
-    verbatim
-  end
-
-  # Internal: Builds a paragraph from the token stream
-  #
-  # margin - Unused
-  #
-  # Returns an RDoc::Markup::Paragraph.
-
-  def build_paragraph margin
-    p :paragraph_start => margin if @debug
-
-    paragraph = RDoc::Markup::Paragraph.new
-
-    until @tokens.empty? do
-      type, data, = get
-
-      case type
-      when :TEXT then
-        @section = 'Returns' if data =~ /\A(Returns|Raises)/
-
-        paragraph << data
-      when :NEWLINE then
-        if :TEXT == peek_token[0] then
-          # Lines beginning with 'Raises' in the Returns section should not be
-          # treated as multiline text
-          if 'Returns' == @section and
-            peek_token[1].start_with?('Raises') then
-            break
-          else
-            paragraph << ' '
-          end
-        else
-          break
-        end
-      else
-        unget
-        break
-      end
-    end
-
-    p :paragraph_end => margin if @debug
-
-    paragraph
-  end
-
-  ##
-  # Detects a section change to "Returns" and adds a heading
-
-  def parse_text parent, indent # :nodoc:
-    paragraph = build_paragraph indent
-
-    if false == @seen_returns and 'Returns' == @section then
-      @seen_returns = true
-      parent << RDoc::Markup::Heading.new(3, 'Returns')
-      parent << RDoc::Markup::BlankLine.new
-    end
-
-    parent << paragraph
-  end
-
-  # Internal: Turns text into an Array of tokens
-  #
-  # text - A String containing TomDoc-format text.
-  #
-  # Returns self.
-
-  def tokenize text
-    text = text.sub(/\A(Public|Internal|Deprecated):\s+/, '')
-
-    setup_scanner text
-
-    until @s.eos? do
-      pos = @s.pos
-
-      # leading spaces will be reflected by the column of the next token
-      # the only thing we loose are trailing spaces at the end of the file
-      next if @s.scan(/ +/)
-
-      @tokens << case
-                 when @s.scan(/\r?\n/) then
-                   token = [:NEWLINE, @s.matched, *pos]
-                   @s.newline!
-                   token
-                 when @s.scan(/(Examples|Signature)$/) then
-                   @tokens << [:HEADER, 3, *pos]
-
-                   [:TEXT, @s[1], *pos]
-                 when @s.scan(/([:\w][\w\[\]]*)[ ]+- /) then
-                   [:NOTE, @s[1], *pos]
-                 else
-                   @s.scan(/.*/)
-                   [:TEXT, @s.matched.sub(/\r$/, ''), *pos]
-                 end
-    end
-
-    self
-  end
-
-end
diff --git a/lib/rdoc/top_level.rb b/lib/rdoc/top_level.rb
deleted file mode 100644
index 3864f66431..0000000000
--- a/lib/rdoc/top_level.rb
+++ /dev/null
@@ -1,291 +0,0 @@
-# frozen_string_literal: true
-##
-# A TopLevel context is a representation of the contents of a single file
-
-class RDoc::TopLevel < RDoc::Context
-
-  MARSHAL_VERSION = 0 # :nodoc:
-
-  ##
-  # This TopLevel's File::Stat struct
-
-  attr_accessor :file_stat
-
-  ##
-  # Relative name of this file
-
-  attr_accessor :relative_name
-
-  ##
-  # Absolute name of this file
-
-  attr_accessor :absolute_name
-
-  ##
-  # All the classes or modules that were declared in
-  # this file. These are assigned to either +#classes_hash+
-  # or +#modules_hash+ once we know what they really are.
-
-  attr_reader :classes_or_modules
-
-  attr_accessor :diagram # :nodoc:
-
-  ##
-  # The parser class that processed this file
-
-  attr_reader :parser
-
-  ##
-  # Creates a new TopLevel for the file at +absolute_name+.  If documentation
-  # is being generated outside the source dir +relative_name+ is relative to
-  # the source directory.
-
-  def initialize absolute_name, relative_name = absolute_name
-    super()
-    @name = nil
-    @absolute_name = absolute_name
-    @relative_name = relative_name
-    @file_stat     = File.stat(absolute_name) rescue nil # HACK for testing
-    @diagram       = nil
-    @parser        = nil
-
-    @classes_or_modules = []
-  end
-
-  ##
-  # Sets the parser for this toplevel context, also the store.
-
-  def parser=(val)
-    @parser = val
-    @store.update_parser_of_file(absolute_name, val) if @store
-    @parser
-  end
-
-  ##
-  # An RDoc::TopLevel is equal to another with the same relative_name
-
-  def == other
-    self.class === other and @relative_name == other.relative_name
-  end
-
-  alias eql? ==
-
-  ##
-  # Adds +an_alias+ to +Object+ instead of +self+.
-
-  def add_alias(an_alias)
-    object_class.record_location self
-    return an_alias unless @document_self
-    object_class.add_alias an_alias
-  end
-
-  ##
-  # Adds +constant+ to +Object+ instead of +self+.
-
-  def add_constant constant
-    object_class.record_location self
-    return constant unless @document_self
-    object_class.add_constant constant
-  end
-
-  ##
-  # Adds +include+ to +Object+ instead of +self+.
-
-  def add_include(include)
-    object_class.record_location self
-    return include unless @document_self
-    object_class.add_include include
-  end
-
-  ##
-  # Adds +method+ to +Object+ instead of +self+.
-
-  def add_method(method)
-    object_class.record_location self
-    return method unless @document_self
-    object_class.add_method method
-  end
-
-  ##
-  # Adds class or module +mod+. Used in the building phase
-  # by the Ruby parser.
-
-  def add_to_classes_or_modules mod
-    @classes_or_modules << mod
-  end
-
-  ##
-  # Base name of this file
-
-  def base_name
-    File.basename @relative_name
-  end
-
-  alias name base_name
-
-  ##
-  # Only a TopLevel that contains text file) will be displayed.  See also
-  # RDoc::CodeObject#display?
-
-  def display?
-    text? and super
-  end
-
-  ##
-  # See RDoc::TopLevel::find_class_or_module
-  #--
-  # TODO Why do we search through all classes/modules found, not just the
-  #       ones of this instance?
-
-  def find_class_or_module name
-    @store.find_class_or_module name
-  end
-
-  ##
-  # Finds a class or module named +symbol+
-
-  def find_local_symbol(symbol)
-    find_class_or_module(symbol) || super
-  end
-
-  ##
-  # Finds a module or class with +name+
-
-  def find_module_named(name)
-    find_class_or_module(name)
-  end
-
-  ##
-  # Returns the relative name of this file
-
-  def full_name
-    @relative_name
-  end
-
-  ##
-  # An RDoc::TopLevel has the same hash as another with the same
-  # relative_name
-
-  def hash
-    @relative_name.hash
-  end
-
-  ##
-  # URL for this with a +prefix+
-
-  def http_url(prefix)
-    path = [prefix, @relative_name.tr('.', '_')]
-
-    File.join(*path.compact) + '.html'
-  end
-
-  def inspect # :nodoc:
-    "#<%s:0x%x %p modules: %p classes: %p>" % [
-      self.class, object_id,
-      base_name,
-      @modules.map { |n,m| m },
-      @classes.map { |n,c| c }
-    ]
-  end
-
-  ##
-  # Time this file was last modified, if known
-
-  def last_modified
-    @file_stat ? file_stat.mtime : nil
-  end
-
-  ##
-  # Dumps this TopLevel for use by ri.  See also #marshal_load
-
-  def marshal_dump
-    [
-      MARSHAL_VERSION,
-      @relative_name,
-      @parser,
-      parse(@comment),
-    ]
-  end
-
-  ##
-  # Loads this TopLevel from +array+.
-
-  def marshal_load array # :nodoc:
-    initialize array[1]
-
-    @parser  = array[2]
-    @comment = array[3]
-
-    @file_stat          = nil
-  end
-
-  ##
-  # Returns the NormalClass "Object", creating it if not found.
-  #
-  # Records +self+ as a location in "Object".
-
-  def object_class
-    @object_class ||= begin
-      oc = @store.find_class_named('Object') || add_class(RDoc::NormalClass, 'Object')
-      oc.record_location self
-      oc
-    end
-  end
-
-  ##
-  # Base name of this file without the extension
-
-  def page_name
-    basename = File.basename @relative_name
-    basename =~ /\.(rb|rdoc|txt|md)$/i
-
-    $` || basename
-  end
-
-  ##
-  # Path to this file for use with HTML generator output.
-
-  def path
-    http_url @store.rdoc.generator.file_dir
-  end
-
-  def pretty_print q # :nodoc:
-    q.group 2, "[#{self.class}: ", "]" do
-      q.text "base name: #{base_name.inspect}"
-      q.breakable
-
-      items = @modules.map { |n,m| m }
-      items.concat @modules.map { |n,c| c }
-      q.seplist items do |mod| q.pp mod end
-    end
-  end
-
-  ##
-  # Search record used by RDoc::Generator::JsonIndex
-
-  def search_record
-    return unless @parser < RDoc::Parser::Text
-
-    [
-      page_name,
-      '',
-      page_name,
-      '',
-      path,
-      '',
-      snippet(@comment),
-    ]
-  end
-
-  ##
-  # Is this TopLevel from a text file instead of a source code file?
-
-  def text?
-    @parser and @parser.include? RDoc::Parser::Text
-  end
-
-  def to_s # :nodoc:
-    "file #{full_name}"
-  end
-
-end
diff --git a/lib/rdoc/version.rb b/lib/rdoc/version.rb
deleted file mode 100644
index 427d4ae232..0000000000
--- a/lib/rdoc/version.rb
+++ /dev/null
@@ -1,10 +0,0 @@
-# frozen_string_literal: true
-
-module RDoc
-
-  ##
-  # RDoc version you are using
-
-  VERSION = '6.7.0'
-
-end
diff --git a/lib/readline.gemspec b/lib/readline.gemspec
deleted file mode 100644
index 9221c29263..0000000000
--- a/lib/readline.gemspec
+++ /dev/null
@@ -1,33 +0,0 @@
-Gem::Specification.new do |spec|
-  spec.name          = 'readline'
-  spec.version       = '0.0.4'
-  spec.authors       = ['aycabta']
-  spec.email         = ['aycabta@gmail.com']
-
-  spec.summary       = %q{Loader for "readline".}
-  spec.description   = <<~EOD
-    This is just a loader for "readline". If Ruby has the "readline-ext" gem
-    that is a native extension, this gem will load it. If Ruby does not have
-    the "readline-ext" gem this gem will load "reline", a library that is
-    compatible with the "readline-ext" gem and implemented in pure Ruby.
-  EOD
-  spec.homepage      = 'https://github.com/ruby/readline'
-  spec.license       = 'Ruby'
-
-  spec.files         = Dir['BSDL', 'COPYING', 'README.md', 'lib/readline.rb']
-  spec.require_paths = ['lib']
-
-  spec.post_install_message = <<~EOM
-    +---------------------------------------------------------------------------+
-    | This is just a loader for "readline". If Ruby has the "readline-ext" gem  |
-    | that is a native extension, this gem will load it. If Ruby does not have  |
-    | the "readline-ext" gem this gem will load "reline", a library that is     |
-    | compatible with the "readline-ext" gem and implemented in pure Ruby.      |
-    |                                                                           |
-    | If you intend to use GNU Readline by `require 'readline'`, please install |
-    | the "readline-ext" gem.                                                   |
-    +---------------------------------------------------------------------------+
-  EOM
-
-  spec.add_runtime_dependency 'reline'
-end
diff --git a/lib/readline.rb b/lib/readline.rb
deleted file mode 100644
index d1c9d3a955..0000000000
--- a/lib/readline.rb
+++ /dev/null
@@ -1,7 +0,0 @@
-begin
-  require "readline.#{RbConfig::CONFIG["DLEXT"]}"
-rescue LoadError
-  require 'reline' unless defined? Reline
-  Object.send(:remove_const, :Readline) if Object.const_defined?(:Readline)
-  Readline = Reline
-end
diff --git a/lib/reline.rb b/lib/reline.rb
deleted file mode 100644
index 6bae469894..0000000000
--- a/lib/reline.rb
+++ /dev/null
@@ -1,566 +0,0 @@
-require 'io/console'
-require 'forwardable'
-require 'reline/version'
-require 'reline/config'
-require 'reline/key_actor'
-require 'reline/key_stroke'
-require 'reline/line_editor'
-require 'reline/history'
-require 'reline/terminfo'
-require 'reline/io'
-require 'reline/face'
-require 'rbconfig'
-
-module Reline
-  # NOTE: For making compatible with the rb-readline gem
-  FILENAME_COMPLETION_PROC = nil
-  USERNAME_COMPLETION_PROC = nil
-
-  class ConfigEncodingConversionError < StandardError; end
-
-  Key = Struct.new(:char, :combined_char, :with_meta) do
-    # For dialog_proc `key.match?(dialog.name)`
-    def match?(sym)
-      combined_char.is_a?(Symbol) && combined_char == sym
-    end
-  end
-  CursorPos = Struct.new(:x, :y)
-  DialogRenderInfo = Struct.new(
-    :pos,
-    :contents,
-    :face,
-    :bg_color, # For the time being, this line should stay here for the compatibility with IRB.
-    :width,
-    :height,
-    :scrollbar,
-    keyword_init: true
-  )
-
-  class Core
-    ATTR_READER_NAMES = %i(
-      completion_append_character
-      basic_word_break_characters
-      completer_word_break_characters
-      basic_quote_characters
-      completer_quote_characters
-      filename_quote_characters
-      special_prefixes
-      completion_proc
-      output_modifier_proc
-      prompt_proc
-      auto_indent_proc
-      pre_input_hook
-      dig_perfect_match_proc
-    ).each(&method(:attr_reader))
-
-    attr_accessor :config
-    attr_accessor :key_stroke
-    attr_accessor :line_editor
-    attr_accessor :last_incremental_search
-    attr_reader :output
-
-    extend Forwardable
-    def_delegators :config,
-      :autocompletion,
-      :autocompletion=
-
-    def initialize
-      self.output = STDOUT
-      @mutex = Mutex.new
-      @dialog_proc_list = {}
-      yield self
-      @completion_quote_character = nil
-    end
-
-    def io_gate
-      Reline::IOGate
-    end
-
-    def encoding
-      io_gate.encoding
-    end
-
-    def completion_append_character=(val)
-      if val.nil?
-        @completion_append_character = nil
-      elsif val.size == 1
-        @completion_append_character = val.encode(encoding)
-      elsif val.size > 1
-        @completion_append_character = val[0].encode(encoding)
-      else
-        @completion_append_character = nil
-      end
-    end
-
-    def basic_word_break_characters=(v)
-      @basic_word_break_characters = v.encode(encoding)
-    end
-
-    def completer_word_break_characters=(v)
-      @completer_word_break_characters = v.encode(encoding)
-    end
-
-    def basic_quote_characters=(v)
-      @basic_quote_characters = v.encode(encoding)
-    end
-
-    def completer_quote_characters=(v)
-      @completer_quote_characters = v.encode(encoding)
-    end
-
-    def filename_quote_characters=(v)
-      @filename_quote_characters = v.encode(encoding)
-    end
-
-    def special_prefixes=(v)
-      @special_prefixes = v.encode(encoding)
-    end
-
-    def completion_case_fold=(v)
-      @config.completion_ignore_case = v
-    end
-
-    def completion_case_fold
-      @config.completion_ignore_case
-    end
-
-    def completion_quote_character
-      @completion_quote_character
-    end
-
-    def completion_proc=(p)
-      raise ArgumentError unless p.respond_to?(:call) or p.nil?
-      @completion_proc = p
-    end
-
-    def output_modifier_proc=(p)
-      raise ArgumentError unless p.respond_to?(:call) or p.nil?
-      @output_modifier_proc = p
-    end
-
-    def prompt_proc=(p)
-      raise ArgumentError unless p.respond_to?(:call) or p.nil?
-      @prompt_proc = p
-    end
-
-    def auto_indent_proc=(p)
-      raise ArgumentError unless p.respond_to?(:call) or p.nil?
-      @auto_indent_proc = p
-    end
-
-    def pre_input_hook=(p)
-      @pre_input_hook = p
-    end
-
-    def dig_perfect_match_proc=(p)
-      raise ArgumentError unless p.respond_to?(:call) or p.nil?
-      @dig_perfect_match_proc = p
-    end
-
-    DialogProc = Struct.new(:dialog_proc, :context)
-    def add_dialog_proc(name_sym, p, context = nil)
-      raise ArgumentError unless name_sym.instance_of?(Symbol)
-      if p.nil?
-        @dialog_proc_list.delete(name_sym)
-      else
-        raise ArgumentError unless p.respond_to?(:call)
-        @dialog_proc_list[name_sym] = DialogProc.new(p, context)
-      end
-    end
-
-    def dialog_proc(name_sym)
-      @dialog_proc_list[name_sym]
-    end
-
-    def input=(val)
-      raise TypeError unless val.respond_to?(:getc) or val.nil?
-      if val.respond_to?(:getc) && io_gate.respond_to?(:input=)
-        io_gate.input = val
-      end
-    end
-
-    def output=(val)
-      raise TypeError unless val.respond_to?(:write) or val.nil?
-      @output = val
-      if io_gate.respond_to?(:output=)
-        io_gate.output = val
-      end
-    end
-
-    def vi_editing_mode
-      config.editing_mode = :vi_insert
-      nil
-    end
-
-    def emacs_editing_mode
-      config.editing_mode = :emacs
-      nil
-    end
-
-    def vi_editing_mode?
-      config.editing_mode_is?(:vi_insert, :vi_command)
-    end
-
-    def emacs_editing_mode?
-      config.editing_mode_is?(:emacs)
-    end
-
-    def get_screen_size
-      io_gate.get_screen_size
-    end
-
-    Reline::DEFAULT_DIALOG_PROC_AUTOCOMPLETE = ->() {
-      # autocomplete
-      return unless config.autocompletion
-
-      journey_data = completion_journey_data
-      return unless journey_data
-
-      target = journey_data.list.first
-      completed = journey_data.list[journey_data.pointer]
-      result = journey_data.list.drop(1)
-      pointer = journey_data.pointer - 1
-      return if completed.empty? || (result == [completed] && pointer < 0)
-
-      target_width = Reline::Unicode.calculate_width(target)
-      completed_width = Reline::Unicode.calculate_width(completed)
-      if cursor_pos.x <= completed_width - target_width
-        # When target is rendered on the line above cursor position
-        x = screen_width - completed_width
-        y = -1
-      else
-        x = [cursor_pos.x - completed_width, 0].max
-        y = 0
-      end
-      cursor_pos_to_render = Reline::CursorPos.new(x, y)
-      if context and context.is_a?(Array)
-        context.clear
-        context.push(cursor_pos_to_render, result, pointer, dialog)
-      end
-      dialog.pointer = pointer
-      DialogRenderInfo.new(
-        pos: cursor_pos_to_render,
-        contents: result,
-        scrollbar: true,
-        height: [15, preferred_dialog_height].min,
-        face: :completion_dialog
-      )
-    }
-    Reline::DEFAULT_DIALOG_CONTEXT = Array.new
-
-    def readmultiline(prompt = '', add_hist = false, &confirm_multiline_termination)
-      @mutex.synchronize do
-        unless confirm_multiline_termination
-          raise ArgumentError.new('#readmultiline needs block to confirm multiline termination')
-        end
-
-        io_gate.with_raw_input do
-          inner_readline(prompt, add_hist, true, &confirm_multiline_termination)
-        end
-
-        whole_buffer = line_editor.whole_buffer.dup
-        whole_buffer.taint if RUBY_VERSION < '2.7'
-        if add_hist and whole_buffer and whole_buffer.chomp("\n").size > 0
-          Reline::HISTORY << whole_buffer
-        end
-
-        if line_editor.eof?
-          line_editor.reset_line
-          # Return nil if the input is aborted by C-d.
-          nil
-        else
-          whole_buffer
-        end
-      end
-    end
-
-    def readline(prompt = '', add_hist = false)
-      @mutex.synchronize do
-        io_gate.with_raw_input do
-          inner_readline(prompt, add_hist, false)
-        end
-
-        line = line_editor.line.dup
-        line.taint if RUBY_VERSION < '2.7'
-        if add_hist and line and line.chomp("\n").size > 0
-          Reline::HISTORY << line.chomp("\n")
-        end
-
-        line_editor.reset_line if line_editor.line.nil?
-        line
-      end
-    end
-
-    private def inner_readline(prompt, add_hist, multiline, &confirm_multiline_termination)
-      if ENV['RELINE_STDERR_TTY']
-        if io_gate.win?
-          $stderr = File.open(ENV['RELINE_STDERR_TTY'], 'a')
-        else
-          $stderr.reopen(ENV['RELINE_STDERR_TTY'], 'w')
-        end
-        $stderr.sync = true
-        $stderr.puts "Reline is used by #{Process.pid}"
-      end
-      unless config.test_mode or config.loaded?
-        config.read
-        io_gate.set_default_key_bindings(config)
-      end
-      otio = io_gate.prep
-
-      may_req_ambiguous_char_width
-      line_editor.reset(prompt, encoding: encoding)
-      if multiline
-        line_editor.multiline_on
-        if block_given?
-          line_editor.confirm_multiline_termination_proc = confirm_multiline_termination
-        end
-      else
-        line_editor.multiline_off
-      end
-      line_editor.output = output
-      line_editor.completion_proc = completion_proc
-      line_editor.completion_append_character = completion_append_character
-      line_editor.output_modifier_proc = output_modifier_proc
-      line_editor.prompt_proc = prompt_proc
-      line_editor.auto_indent_proc = auto_indent_proc
-      line_editor.dig_perfect_match_proc = dig_perfect_match_proc
-      pre_input_hook&.call
-      unless Reline::IOGate.dumb?
-        @dialog_proc_list.each_pair do |name_sym, d|
-          line_editor.add_dialog_proc(name_sym, d.dialog_proc, d.context)
-        end
-      end
-
-      line_editor.print_nomultiline_prompt(prompt)
-      line_editor.update_dialogs
-      line_editor.rerender
-
-      begin
-        line_editor.set_signal_handlers
-        loop do
-          read_io(config.keyseq_timeout) { |inputs|
-            line_editor.set_pasting_state(io_gate.in_pasting?)
-            inputs.each do |key|
-              if key.char == :bracketed_paste_start
-                text = io_gate.read_bracketed_paste
-                line_editor.insert_pasted_text(text)
-                line_editor.scroll_into_view
-              else
-                line_editor.update(key)
-              end
-            end
-          }
-          if line_editor.finished?
-            line_editor.render_finished
-            break
-          else
-            line_editor.set_pasting_state(io_gate.in_pasting?)
-            line_editor.rerender
-          end
-        end
-        io_gate.move_cursor_column(0)
-      rescue Errno::EIO
-        # Maybe the I/O has been closed.
-      ensure
-        line_editor.finalize
-        io_gate.deprep(otio)
-      end
-    end
-
-    # GNU Readline waits for "keyseq-timeout" milliseconds to see if the ESC
-    # is followed by a character, and times out and treats it as a standalone
-    # ESC if the second character does not arrive. If the second character
-    # comes before timed out, it is treated as a modifier key with the
-    # meta-property of meta-key, so that it can be distinguished from
-    # multibyte characters with the 8th bit turned on.
-    #
-    # GNU Readline will wait for the 2nd character with "keyseq-timeout"
-    # milli-seconds but wait forever after 3rd characters.
-    private def read_io(keyseq_timeout, &block)
-      buffer = []
-      loop do
-        c = io_gate.getc(Float::INFINITY)
-        if c == -1
-          result = :unmatched
-        else
-          buffer << c
-          result = key_stroke.match_status(buffer)
-        end
-        case result
-        when :matched
-          expanded, rest_bytes = key_stroke.expand(buffer)
-          rest_bytes.reverse_each { |c| io_gate.ungetc(c) }
-          block.(expanded)
-          break
-        when :matching
-          if buffer.size == 1
-            case read_2nd_character_of_key_sequence(keyseq_timeout, buffer, c, block)
-            when :break then break
-            when :next  then next
-            end
-          end
-        when :unmatched
-          if buffer.size == 1 and c == "\e".ord
-            read_escaped_key(keyseq_timeout, c, block)
-          else
-            expanded, rest_bytes = key_stroke.expand(buffer)
-            rest_bytes.reverse_each { |c| io_gate.ungetc(c) }
-            block.(expanded)
-          end
-          break
-        end
-      end
-    end
-
-    private def read_2nd_character_of_key_sequence(keyseq_timeout, buffer, c, block)
-      succ_c = io_gate.getc(keyseq_timeout.fdiv(1000))
-      if succ_c
-        case key_stroke.match_status(buffer.dup.push(succ_c))
-        when :unmatched
-          if c == "\e".ord
-            block.([Reline::Key.new(succ_c, succ_c | 0b10000000, true)])
-          else
-            block.([Reline::Key.new(c, c, false), Reline::Key.new(succ_c, succ_c, false)])
-          end
-          return :break
-        when :matching
-          io_gate.ungetc(succ_c)
-          return :next
-        when :matched
-          buffer << succ_c
-          expanded, rest_bytes = key_stroke.expand(buffer)
-          rest_bytes.reverse_each { |c| io_gate.ungetc(c) }
-          block.(expanded)
-          return :break
-        end
-      else
-        block.([Reline::Key.new(c, c, false)])
-        return :break
-      end
-    end
-
-    private def read_escaped_key(keyseq_timeout, c, block)
-      escaped_c = io_gate.getc(keyseq_timeout.fdiv(1000))
-
-      if escaped_c.nil?
-        block.([Reline::Key.new(c, c, false)])
-      elsif escaped_c >= 128 # maybe, first byte of multi byte
-        block.([Reline::Key.new(c, c, false), Reline::Key.new(escaped_c, escaped_c, false)])
-      elsif escaped_c == "\e".ord # escape twice
-        block.([Reline::Key.new(c, c, false), Reline::Key.new(c, c, false)])
-      else
-        block.([Reline::Key.new(escaped_c, escaped_c | 0b10000000, true)])
-      end
-    end
-
-    def ambiguous_width
-      may_req_ambiguous_char_width unless defined? @ambiguous_width
-      @ambiguous_width
-    end
-
-    private def may_req_ambiguous_char_width
-      @ambiguous_width = 2 if io_gate.dumb? || !STDIN.tty? || !STDOUT.tty?
-      return if defined? @ambiguous_width
-      io_gate.move_cursor_column(0)
-      begin
-        output.write "\u{25bd}"
-      rescue Encoding::UndefinedConversionError
-        # LANG=C
-        @ambiguous_width = 1
-      else
-        @ambiguous_width = io_gate.cursor_pos.x
-      end
-      io_gate.move_cursor_column(0)
-      io_gate.erase_after_cursor
-    end
-  end
-
-  extend Forwardable
-  extend SingleForwardable
-
-  #--------------------------------------------------------
-  # Documented API
-  #--------------------------------------------------------
-
-  (Core::ATTR_READER_NAMES).each { |name|
-    def_single_delegators :core, :"#{name}", :"#{name}="
-  }
-  def_single_delegators :core, :input=, :output=
-  def_single_delegators :core, :vi_editing_mode, :emacs_editing_mode
-  def_single_delegators :core, :readline
-  def_single_delegators :core, :completion_case_fold, :completion_case_fold=
-  def_single_delegators :core, :completion_quote_character
-  def_instance_delegators self, :readline
-  private :readline
-
-
-  #--------------------------------------------------------
-  # Undocumented API
-  #--------------------------------------------------------
-
-  # Testable in original
-  def_single_delegators :core, :get_screen_size
-  def_single_delegators :line_editor, :eof?
-  def_instance_delegators self, :eof?
-  def_single_delegators :line_editor, :delete_text
-  def_single_delegator :line_editor, :line, :line_buffer
-  def_single_delegator :line_editor, :byte_pointer, :point
-  def_single_delegator :line_editor, :byte_pointer=, :point=
-
-  def self.insert_text(*args, &block)
-    line_editor.insert_text(*args, &block)
-    self
-  end
-
-  # Untestable in original
-  def_single_delegator :line_editor, :rerender, :redisplay
-  def_single_delegators :core, :vi_editing_mode?, :emacs_editing_mode?
-  def_single_delegators :core, :ambiguous_width
-  def_single_delegators :core, :last_incremental_search
-  def_single_delegators :core, :last_incremental_search=
-  def_single_delegators :core, :add_dialog_proc
-  def_single_delegators :core, :dialog_proc
-  def_single_delegators :core, :autocompletion, :autocompletion=
-
-  def_single_delegators :core, :readmultiline
-  def_instance_delegators self, :readmultiline
-  private :readmultiline
-
-  def self.encoding_system_needs
-    self.core.encoding
-  end
-
-  def self.core
-    @core ||= Core.new { |core|
-      core.config = Reline::Config.new
-      core.key_stroke = Reline::KeyStroke.new(core.config)
-      core.line_editor = Reline::LineEditor.new(core.config, core.encoding)
-
-      core.basic_word_break_characters = " \t\n`><=;|&{("
-      core.completer_word_break_characters = " \t\n`><=;|&{("
-      core.basic_quote_characters = '"\''
-      core.completer_quote_characters = '"\''
-      core.filename_quote_characters = ""
-      core.special_prefixes = ""
-      core.add_dialog_proc(:autocomplete, Reline::DEFAULT_DIALOG_PROC_AUTOCOMPLETE, Reline::DEFAULT_DIALOG_CONTEXT)
-    }
-  end
-
-  def self.ungetc(c)
-    core.io_gate.ungetc(c)
-  end
-
-  def self.line_editor
-    core.line_editor
-  end
-end
-
-
-Reline::IOGate = Reline::IO.decide_io_gate
-
-# Deprecated
-Reline::GeneralIO = Reline::Dumb.new
-
-Reline::Face.load_initial_configs
-
-Reline::HISTORY = Reline::History.new(Reline.core.config)
diff --git a/lib/reline/config.rb b/lib/reline/config.rb
deleted file mode 100644
index 774b06b6fd..0000000000
--- a/lib/reline/config.rb
+++ /dev/null
@@ -1,382 +0,0 @@
-class Reline::Config
-  attr_reader :test_mode
-
-  KEYSEQ_PATTERN = /\\(?:C|Control)-[A-Za-z_]|\\(?:M|Meta)-[0-9A-Za-z_]|\\(?:C|Control)-(?:M|Meta)-[A-Za-z_]|\\(?:M|Meta)-(?:C|Control)-[A-Za-z_]|\\e|\\[\\\"\'abdfnrtv]|\\\d{1,3}|\\x\h{1,2}|./
-
-  class InvalidInputrc < RuntimeError
-    attr_accessor :file, :lineno
-  end
-
-  VARIABLE_NAMES = %w{
-    completion-ignore-case
-    convert-meta
-    disable-completion
-    history-size
-    keyseq-timeout
-    show-all-if-ambiguous
-    show-mode-in-prompt
-    vi-cmd-mode-string
-    vi-ins-mode-string
-    emacs-mode-string
-    enable-bracketed-paste
-    isearch-terminators
-  }
-  VARIABLE_NAME_SYMBOLS = VARIABLE_NAMES.map { |v| :"#{v.tr(?-, ?_)}" }
-  VARIABLE_NAME_SYMBOLS.each do |v|
-    attr_accessor v
-  end
-
-  attr_accessor :autocompletion
-
-  def initialize
-    @additional_key_bindings = { # from inputrc
-      emacs: Reline::KeyActor::Base.new,
-      vi_insert: Reline::KeyActor::Base.new,
-      vi_command: Reline::KeyActor::Base.new
-    }
-    @oneshot_key_bindings = Reline::KeyActor::Base.new
-    @editing_mode_label = :emacs
-    @keymap_label = :emacs
-    @keymap_prefix = []
-    @default_key_bindings = {
-      emacs: Reline::KeyActor::Base.new(Reline::KeyActor::EMACS_MAPPING),
-      vi_insert: Reline::KeyActor::Base.new(Reline::KeyActor::VI_INSERT_MAPPING),
-      vi_command: Reline::KeyActor::Base.new(Reline::KeyActor::VI_COMMAND_MAPPING)
-    }
-    @vi_cmd_mode_string = '(cmd)'
-    @vi_ins_mode_string = '(ins)'
-    @emacs_mode_string = '@'
-    # https://tiswww.case.edu/php/chet/readline/readline.html#IDX25
-    @history_size = -1 # unlimited
-    @keyseq_timeout = 500
-    @test_mode = false
-    @autocompletion = false
-    @convert_meta = true if seven_bit_encoding?(Reline::IOGate.encoding)
-    @loaded = false
-    @enable_bracketed_paste = true
-  end
-
-  def reset
-    if editing_mode_is?(:vi_command)
-      @editing_mode_label = :vi_insert
-    end
-    @oneshot_key_bindings.clear
-  end
-
-  def editing_mode
-    @default_key_bindings[@editing_mode_label]
-  end
-
-  def editing_mode=(val)
-    @editing_mode_label = val
-  end
-
-  def editing_mode_is?(*val)
-    val.any?(@editing_mode_label)
-  end
-
-  def keymap
-    @default_key_bindings[@keymap_label]
-  end
-
-  def loaded?
-    @loaded
-  end
-
-  def inputrc_path
-    case ENV['INPUTRC']
-    when nil, ''
-    else
-      return File.expand_path(ENV['INPUTRC'])
-    end
-
-    # In the XDG Specification, if ~/.config/readline/inputrc exists, then
-    # ~/.inputrc should not be read, but for compatibility with GNU Readline,
-    # if ~/.inputrc exists, then it is given priority.
-    home_rc_path = File.expand_path('~/.inputrc')
-    return home_rc_path if File.exist?(home_rc_path)
-
-    case path = ENV['XDG_CONFIG_HOME']
-    when nil, ''
-    else
-      path = File.join(path, 'readline/inputrc')
-      return path if File.exist?(path) and path == File.expand_path(path)
-    end
-
-    path = File.expand_path('~/.config/readline/inputrc')
-    return path if File.exist?(path)
-
-    return home_rc_path
-  end
-
-  private def default_inputrc_path
-    @default_inputrc_path ||= inputrc_path
-  end
-
-  def read(file = nil)
-    @loaded = true
-    file ||= default_inputrc_path
-    begin
-      if file.respond_to?(:readlines)
-        lines = file.readlines
-      else
-        lines = File.readlines(file)
-      end
-    rescue Errno::ENOENT
-      return nil
-    end
-
-    read_lines(lines, file)
-    self
-  rescue InvalidInputrc => e
-    warn e.message
-    nil
-  end
-
-  def key_bindings
-    # The key bindings for each editing mode will be overwritten by the user-defined ones.
-    Reline::KeyActor::Composite.new([@oneshot_key_bindings, @additional_key_bindings[@editing_mode_label], @default_key_bindings[@editing_mode_label]])
-  end
-
-  def add_oneshot_key_binding(keystroke, target)
-    # IRB sets invalid keystroke [Reline::Key]. We should ignore it.
-    return unless keystroke.all? { |c| c.is_a?(Integer) }
-
-    @oneshot_key_bindings.add(keystroke, target)
-  end
-
-  def reset_oneshot_key_bindings
-    @oneshot_key_bindings.clear
-  end
-
-  def add_default_key_binding_by_keymap(keymap, keystroke, target)
-    @default_key_bindings[keymap].add(keystroke, target)
-  end
-
-  def add_default_key_binding(keystroke, target)
-    add_default_key_binding_by_keymap(@keymap_label, keystroke, target)
-  end
-
-  def read_lines(lines, file = nil)
-    if not lines.empty? and lines.first.encoding != Reline.encoding_system_needs
-      begin
-        lines = lines.map do |l|
-          l.encode(Reline.encoding_system_needs)
-        rescue Encoding::UndefinedConversionError
-          mes = "The inputrc encoded in #{lines.first.encoding.name} can't be converted to the locale #{Reline.encoding_system_needs.name}."
-          raise Reline::ConfigEncodingConversionError.new(mes)
-        end
-      end
-    end
-    if_stack = []
-
-    lines.each_with_index do |line, no|
-      next if line.match(/\A\s*#/)
-
-      no += 1
-
-      line = line.chomp.lstrip
-      if line.start_with?('$')
-        handle_directive(line[1..-1], file, no, if_stack)
-        next
-      end
-
-      next if if_stack.any? { |_no, skip| skip }
-
-      case line
-      when /^set +([^ ]+) +(.+)/i
-        # value ignores everything after a space, raw_value does not.
-        var, value, raw_value = $1.downcase, $2.partition(' ').first, $2
-        bind_variable(var, value, raw_value)
-        next
-      when /\s*("#{KEYSEQ_PATTERN}+")\s*:\s*(.*)\s*$/o
-        key, func_name = $1, $2
-        func_name = func_name.split.first
-        keystroke, func = bind_key(key, func_name)
-        next unless keystroke
-        @additional_key_bindings[@keymap_label].add(@keymap_prefix + keystroke, func)
-      end
-    end
-    unless if_stack.empty?
-      raise InvalidInputrc, "#{file}:#{if_stack.last[0]}: unclosed if"
-    end
-  end
-
-  def handle_directive(directive, file, no, if_stack)
-    directive, args = directive.split(' ')
-    case directive
-    when 'if'
-      condition = false
-      case args
-      when /^mode=(vi|emacs)$/i
-        mode = $1.downcase
-        # NOTE: mode=vi means vi-insert mode
-        mode = 'vi_insert' if mode == 'vi'
-        if @editing_mode_label == mode.to_sym
-          condition = true
-        end
-      when 'term'
-      when 'version'
-      else # application name
-        condition = true if args == 'Ruby'
-        condition = true if args == 'Reline'
-      end
-      if_stack << [no, !condition]
-    when 'else'
-      if if_stack.empty?
-        raise InvalidInputrc, "#{file}:#{no}: unmatched else"
-      end
-      if_stack.last[1] = !if_stack.last[1]
-    when 'endif'
-      if if_stack.empty?
-        raise InvalidInputrc, "#{file}:#{no}: unmatched endif"
-      end
-      if_stack.pop
-    when 'include'
-      read(File.expand_path(args))
-    end
-  end
-
-  def bind_variable(name, value, raw_value)
-    case name
-    when 'history-size'
-      begin
-        @history_size = Integer(value)
-      rescue ArgumentError
-        @history_size = 500
-      end
-    when 'bell-style'
-      @bell_style =
-        case value
-        when 'none', 'off'
-          :none
-        when 'audible', 'on'
-          :audible
-        when 'visible'
-          :visible
-        else
-          :audible
-        end
-    when 'comment-begin'
-      @comment_begin = value.dup
-    when 'completion-query-items'
-      @completion_query_items = value.to_i
-    when 'isearch-terminators'
-      @isearch_terminators = retrieve_string(raw_value)
-    when 'editing-mode'
-      case value
-      when 'emacs'
-        @editing_mode_label = :emacs
-        @keymap_label = :emacs
-        @keymap_prefix = []
-      when 'vi'
-        @editing_mode_label = :vi_insert
-        @keymap_label = :vi_insert
-        @keymap_prefix = []
-      end
-    when 'keymap'
-      case value
-      when 'emacs', 'emacs-standard'
-        @keymap_label = :emacs
-        @keymap_prefix = []
-      when 'emacs-ctlx'
-        @keymap_label = :emacs
-        @keymap_prefix = [?\C-x.ord]
-      when 'emacs-meta'
-        @keymap_label = :emacs
-        @keymap_prefix = [?\e.ord]
-      when 'vi', 'vi-move', 'vi-command'
-        @keymap_label = :vi_command
-        @keymap_prefix = []
-      when 'vi-insert'
-        @keymap_label = :vi_insert
-        @keymap_prefix = []
-      end
-    when 'keyseq-timeout'
-      @keyseq_timeout = value.to_i
-    when 'show-mode-in-prompt'
-      case value
-      when 'off'
-        @show_mode_in_prompt = false
-      when 'on'
-        @show_mode_in_prompt = true
-      else
-        @show_mode_in_prompt = false
-      end
-    when 'vi-cmd-mode-string'
-      @vi_cmd_mode_string = retrieve_string(raw_value)
-    when 'vi-ins-mode-string'
-      @vi_ins_mode_string = retrieve_string(raw_value)
-    when 'emacs-mode-string'
-      @emacs_mode_string = retrieve_string(raw_value)
-    when *VARIABLE_NAMES then
-      variable_name = :"@#{name.tr(?-, ?_)}"
-      instance_variable_set(variable_name, value.nil? || value == '1' || value == 'on')
-    end
-  end
-
-  def retrieve_string(str)
-    str = $1 if str =~ /\A"(.*)"\z/
-    parse_keyseq(str).map { |c| c.chr(Reline.encoding_system_needs) }.join
-  end
-
-  def bind_key(key, func_name)
-    if key =~ /\A"(.*)"\z/
-      keyseq = parse_keyseq($1)
-    else
-      keyseq = nil
-    end
-    if func_name =~ /"(.*)"/
-      func = parse_keyseq($1)
-    else
-      func = func_name.tr(?-, ?_).to_sym # It must be macro.
-    end
-    [keyseq, func]
-  end
-
-  def key_notation_to_code(notation)
-    case notation
-    when /\\(?:C|Control)-([A-Za-z_])/
-      (1 + $1.downcase.ord - ?a.ord)
-    when /\\(?:M|Meta)-([0-9A-Za-z_])/
-      modified_key = $1
-      case $1
-      when /[0-9]/
-        ?\M-0.bytes.first + (modified_key.ord - ?0.ord)
-      when /[A-Z]/
-        ?\M-A.bytes.first + (modified_key.ord - ?A.ord)
-      when /[a-z]/
-        ?\M-a.bytes.first + (modified_key.ord - ?a.ord)
-      end
-    when /\\(?:C|Control)-(?:M|Meta)-[A-Za-z_]/, /\\(?:M|Meta)-(?:C|Control)-[A-Za-z_]/
-    # 129 M-^A
-    when /\\(\d{1,3})/ then $1.to_i(8) # octal
-    when /\\x(\h{1,2})/ then $1.to_i(16) # hexadecimal
-    when "\\e" then ?\e.ord
-    when "\\\\" then ?\\.ord
-    when "\\\"" then ?".ord
-    when "\\'" then ?'.ord
-    when "\\a" then ?\a.ord
-    when "\\b" then ?\b.ord
-    when "\\d" then ?\d.ord
-    when "\\f" then ?\f.ord
-    when "\\n" then ?\n.ord
-    when "\\r" then ?\r.ord
-    when "\\t" then ?\t.ord
-    when "\\v" then ?\v.ord
-    else notation.ord
-    end
-  end
-
-  def parse_keyseq(str)
-    ret = []
-    str.scan(KEYSEQ_PATTERN) do
-      ret << key_notation_to_code($&)
-    end
-    ret
-  end
-
-  private def seven_bit_encoding?(encoding)
-    encoding == Encoding::US_ASCII
-  end
-end
diff --git a/lib/reline/face.rb b/lib/reline/face.rb
deleted file mode 100644
index d07196e2e7..0000000000
--- a/lib/reline/face.rb
+++ /dev/null
@@ -1,199 +0,0 @@
-# frozen_string_literal: true
-
-class Reline::Face
-  SGR_PARAMETERS = {
-    foreground: {
-      black: 30,
-      red: 31,
-      green: 32,
-      yellow: 33,
-      blue: 34,
-      magenta: 35,
-      cyan: 36,
-      white: 37,
-      bright_black: 90,
-      gray: 90,
-      bright_red: 91,
-      bright_green: 92,
-      bright_yellow: 93,
-      bright_blue: 94,
-      bright_magenta: 95,
-      bright_cyan: 96,
-      bright_white: 97
-    },
-    background: {
-      black: 40,
-      red: 41,
-      green: 42,
-      yellow: 43,
-      blue: 44,
-      magenta: 45,
-      cyan: 46,
-      white: 47,
-      bright_black: 100,
-      gray: 100,
-      bright_red: 101,
-      bright_green: 102,
-      bright_yellow: 103,
-      bright_blue: 104,
-      bright_magenta: 105,
-      bright_cyan: 106,
-      bright_white: 107,
-    },
-    style: {
-      reset: 0,
-      bold: 1,
-      faint: 2,
-      italicized: 3,
-      underlined: 4,
-      slowly_blinking: 5,
-      blinking: 5,
-      rapidly_blinking: 6,
-      negative: 7,
-      concealed: 8,
-      crossed_out: 9
-    }
-  }.freeze
-
-  class Config
-    ESSENTIAL_DEFINE_NAMES = %i(default enhanced scrollbar).freeze
-    RESET_SGR = "\e[0m".freeze
-
-    def initialize(name, &block)
-      @definition = {}
-      block.call(self)
-      ESSENTIAL_DEFINE_NAMES.each do |name|
-        @definition[name] ||= { style: :reset, escape_sequence: RESET_SGR }
-      end
-    end
-
-    attr_reader :definition
-
-    def define(name, **values)
-      values[:escape_sequence] = format_to_sgr(values.to_a).freeze
-      @definition[name] = values
-    end
-
-    def reconfigure
-      @definition.each_value do |values|
-        values.delete(:escape_sequence)
-        values[:escape_sequence] = format_to_sgr(values.to_a).freeze
-      end
-    end
-
-    def [](name)
-      @definition.dig(name, :escape_sequence) or raise ArgumentError, "unknown face: #{name}"
-    end
-
-    private
-
-    def sgr_rgb(key, value)
-      return nil unless rgb_expression?(value)
-      if Reline::Face.truecolor?
-        sgr_rgb_truecolor(key, value)
-      else
-        sgr_rgb_256color(key, value)
-      end
-    end
-
-    def sgr_rgb_truecolor(key, value)
-      case key
-      when :foreground
-        "38;2;"
-      when :background
-        "48;2;"
-      end + value[1, 6].scan(/../).map(&:hex).join(";")
-    end
-
-    def sgr_rgb_256color(key, value)
-      # 256 colors are
-      # 0..15: standard colors, hight intensity colors
-      # 16..232: 216 colors (R, G, B each 6 steps)
-      # 233..255: grayscale colors (24 steps)
-      # This methods converts rgb_expression to 216 colors
-      rgb = value[1, 6].scan(/../).map(&:hex)
-      # Color steps are [0, 95, 135, 175, 215, 255]
-      r, g, b = rgb.map { |v| v <= 95 ? v / 48 : (v - 35) / 40 }
-      color = (16 + 36 * r + 6 * g + b)
-      case key
-      when :foreground
-        "38;5;#{color}"
-      when :background
-        "48;5;#{color}"
-      end
-    end
-
-    def format_to_sgr(ordered_values)
-      sgr = "\e[" + ordered_values.map do |key_value|
-        key, value = key_value
-        case key
-        when :foreground, :background
-          case value
-          when Symbol
-            SGR_PARAMETERS[key][value]
-          when String
-            sgr_rgb(key, value)
-          end
-        when :style
-          [ value ].flatten.map do |style_name|
-            SGR_PARAMETERS[:style][style_name]
-          end.then do |sgr_parameters|
-            sgr_parameters.include?(nil) ? nil : sgr_parameters
-          end
-        end.then do |rendition_expression|
-          unless rendition_expression
-            raise ArgumentError, "invalid SGR parameter: #{value.inspect}"
-          end
-          rendition_expression
-        end
-      end.join(';') + "m"
-      sgr == RESET_SGR ? RESET_SGR : RESET_SGR + sgr
-    end
-
-    def rgb_expression?(color)
-      color.respond_to?(:match?) and color.match?(/\A#[0-9a-fA-F]{6}\z/)
-    end
-  end
-
-  private_constant :SGR_PARAMETERS, :Config
-
-  def self.truecolor?
-    @force_truecolor || %w[truecolor 24bit].include?(ENV['COLORTERM'])
-  end
-
-  def self.force_truecolor
-    @force_truecolor = true
-    @configs&.each_value(&:reconfigure)
-  end
-
-  def self.[](name)
-    @configs[name]
-  end
-
-  def self.config(name, &block)
-    @configs ||= {}
-    @configs[name] = Config.new(name, &block)
-  end
-
-  def self.configs
-    @configs.transform_values(&:definition)
-  end
-
-  def self.load_initial_configs
-    config(:default) do |conf|
-      conf.define :default, style: :reset
-      conf.define :enhanced, style: :reset
-      conf.define :scrollbar, style: :reset
-    end
-    config(:completion_dialog) do |conf|
-      conf.define :default, foreground: :bright_white, background: :gray
-      conf.define :enhanced, foreground: :black, background: :white
-      conf.define :scrollbar, foreground: :white, background: :gray
-    end
-  end
-
-  def self.reset_to_initial_configs
-    @configs = {}
-    load_initial_configs
-  end
-end
diff --git a/lib/reline/history.rb b/lib/reline/history.rb
deleted file mode 100644
index 3f3b65fea6..0000000000
--- a/lib/reline/history.rb
+++ /dev/null
@@ -1,76 +0,0 @@
-class Reline::History < Array
-  def initialize(config)
-    @config = config
-  end
-
-  def to_s
-    'HISTORY'
-  end
-
-  def delete_at(index)
-    index = check_index(index)
-    super(index)
-  end
-
-  def [](index)
-    index = check_index(index) unless index.is_a?(Range)
-    super(index)
-  end
-
-  def []=(index, val)
-    index = check_index(index)
-    super(index, String.new(val, encoding: Reline.encoding_system_needs))
-  end
-
-  def concat(*val)
-    val.each do |v|
-      push(*v)
-    end
-  end
-
-  def push(*val)
-    # If history_size is zero, all histories are dropped.
-    return self if @config.history_size.zero?
-    # If history_size is negative, history size is unlimited.
-    if @config.history_size.positive?
-      diff = size + val.size - @config.history_size
-      if diff > 0
-        if diff <= size
-          shift(diff)
-        else
-          diff -= size
-          clear
-          val.shift(diff)
-        end
-      end
-    end
-    super(*(val.map{ |v|
-      String.new(v, encoding: Reline.encoding_system_needs)
-    }))
-  end
-
-  def <<(val)
-    # If history_size is zero, all histories are dropped.
-    return self if @config.history_size.zero?
-    # If history_size is negative, history size is unlimited.
-    if @config.history_size.positive?
-      shift if size + 1 > @config.history_size
-    end
-    super(String.new(val, encoding: Reline.encoding_system_needs))
-  end
-
-  private def check_index(index)
-    index += size if index < 0
-    if index < -2147483648 or 2147483647 < index
-      raise RangeError.new("integer #{index} too big to convert to 'int'")
-    end
-    # If history_size is negative, history size is unlimited.
-    if @config.history_size.positive?
-      if index < -@config.history_size or @config.history_size < index
-        raise RangeError.new("index=<#{index}>")
-      end
-    end
-    raise IndexError.new("index=<#{index}>") if index < 0 or size <= index
-    index
-  end
-end
diff --git a/lib/reline/io.rb b/lib/reline/io.rb
deleted file mode 100644
index c1dd1a56c8..0000000000
--- a/lib/reline/io.rb
+++ /dev/null
@@ -1,41 +0,0 @@
-
-module Reline
-  class IO
-    RESET_COLOR = "\e[0m"
-
-    def self.decide_io_gate
-      if ENV['TERM'] == 'dumb'
-        Reline::Dumb.new
-      else
-        require 'reline/io/ansi'
-
-        case RbConfig::CONFIG['host_os']
-        when /mswin|msys|mingw|cygwin|bccwin|wince|emc/
-          require 'reline/io/windows'
-          io = Reline::Windows.new
-          if io.msys_tty?
-            Reline::ANSI.new
-          else
-            io
-          end
-        else
-          Reline::ANSI.new
-        end
-      end
-    end
-
-    def dumb?
-      false
-    end
-
-    def win?
-      false
-    end
-
-    def reset_color_sequence
-      self.class::RESET_COLOR
-    end
-  end
-end
-
-require 'reline/io/dumb'
diff --git a/lib/reline/io/ansi.rb b/lib/reline/io/ansi.rb
deleted file mode 100644
index 2b5a5c5786..0000000000
--- a/lib/reline/io/ansi.rb
+++ /dev/null
@@ -1,360 +0,0 @@
-require 'io/console'
-require 'io/wait'
-
-class Reline::ANSI < Reline::IO
-  CAPNAME_KEY_BINDINGS = {
-    'khome' => :ed_move_to_beg,
-    'kend'  => :ed_move_to_end,
-    'kdch1' => :key_delete,
-    'kpp' => :ed_search_prev_history,
-    'knp' => :ed_search_next_history,
-    'kcuu1' => :ed_prev_history,
-    'kcud1' => :ed_next_history,
-    'kcuf1' => :ed_next_char,
-    'kcub1' => :ed_prev_char,
-  }
-
-  ANSI_CURSOR_KEY_BINDINGS = {
-    # Up
-    'A' => [:ed_prev_history, {}],
-    # Down
-    'B' => [:ed_next_history, {}],
-    # Right
-    'C' => [:ed_next_char, { ctrl: :em_next_word, meta: :em_next_word }],
-    # Left
-    'D' => [:ed_prev_char, { ctrl: :ed_prev_word, meta: :ed_prev_word }],
-    # End
-    'F' => [:ed_move_to_end, {}],
-    # Home
-    'H' => [:ed_move_to_beg, {}],
-  }
-
-  if Reline::Terminfo.enabled?
-    Reline::Terminfo.setupterm(0, 2)
-  end
-
-  def initialize
-    @input = STDIN
-    @output = STDOUT
-    @buf = []
-    @old_winch_handler = nil
-  end
-
-  def encoding
-    Encoding.default_external
-  end
-
-  def set_default_key_bindings(config, allow_terminfo: true)
-    set_bracketed_paste_key_bindings(config)
-    set_default_key_bindings_ansi_cursor(config)
-    if allow_terminfo && Reline::Terminfo.enabled?
-      set_default_key_bindings_terminfo(config)
-    else
-      set_default_key_bindings_comprehensive_list(config)
-    end
-    {
-      [27, 91, 90] => :completion_journey_up, # S-Tab
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-      config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-    end
-    {
-      # default bindings
-      [27, 32] => :em_set_mark,             # M-<space>
-      [24, 24] => :em_exchange_mark,        # C-x C-x
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-    end
-  end
-
-  def set_bracketed_paste_key_bindings(config)
-    [:emacs, :vi_insert, :vi_command].each do |keymap|
-      config.add_default_key_binding_by_keymap(keymap, START_BRACKETED_PASTE.bytes, :bracketed_paste_start)
-    end
-  end
-
-  def set_default_key_bindings_ansi_cursor(config)
-    ANSI_CURSOR_KEY_BINDINGS.each do |char, (default_func, modifiers)|
-      bindings = [["\e[#{char}", default_func]] # CSI + char
-      if modifiers[:ctrl]
-        # CSI + ctrl_key_modifier + char
-        bindings << ["\e[1;5#{char}", modifiers[:ctrl]]
-      end
-      if modifiers[:meta]
-        # CSI + meta_key_modifier + char
-        bindings << ["\e[1;3#{char}", modifiers[:meta]]
-        # Meta(ESC) + CSI + char
-        bindings << ["\e\e[#{char}", modifiers[:meta]]
-      end
-      bindings.each do |sequence, func|
-        key = sequence.bytes
-        config.add_default_key_binding_by_keymap(:emacs, key, func)
-        config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-        config.add_default_key_binding_by_keymap(:vi_command, key, func)
-      end
-    end
-  end
-
-  def set_default_key_bindings_terminfo(config)
-    key_bindings = CAPNAME_KEY_BINDINGS.map do |capname, key_binding|
-      begin
-        key_code = Reline::Terminfo.tigetstr(capname)
-        [ key_code.bytes, key_binding ]
-      rescue Reline::Terminfo::TerminfoError
-        # capname is undefined
-      end
-    end.compact.to_h
-
-    key_bindings.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-      config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-      config.add_default_key_binding_by_keymap(:vi_command, key, func)
-    end
-  end
-
-  def set_default_key_bindings_comprehensive_list(config)
-    {
-      # Console (80x25)
-      [27, 91, 49, 126] => :ed_move_to_beg, # Home
-      [27, 91, 52, 126] => :ed_move_to_end, # End
-      [27, 91, 51, 126] => :key_delete,     # Del
-
-      # KDE
-      # Del is 0x08
-      [27, 71, 65] => :ed_prev_history,     # ↑
-      [27, 71, 66] => :ed_next_history,     # ↓
-      [27, 71, 67] => :ed_next_char,        # →
-      [27, 71, 68] => :ed_prev_char,        # ←
-
-      # urxvt / exoterm
-      [27, 91, 55, 126] => :ed_move_to_beg, # Home
-      [27, 91, 56, 126] => :ed_move_to_end, # End
-
-      # GNOME
-      [27, 79, 72] => :ed_move_to_beg,      # Home
-      [27, 79, 70] => :ed_move_to_end,      # End
-      # Del is 0x08
-      # Arrow keys are the same of KDE
-
-      [27, 79, 65] => :ed_prev_history,     # ↑
-      [27, 79, 66] => :ed_next_history,     # ↓
-      [27, 79, 67] => :ed_next_char,        # →
-      [27, 79, 68] => :ed_prev_char,        # ←
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-      config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-      config.add_default_key_binding_by_keymap(:vi_command, key, func)
-    end
-  end
-
-  def input=(val)
-    @input = val
-  end
-
-  def output=(val)
-    @output = val
-  end
-
-  def with_raw_input
-    if @input.tty?
-      @input.raw(intr: true) { yield }
-    else
-      yield
-    end
-  end
-
-  def inner_getc(timeout_second)
-    unless @buf.empty?
-      return @buf.shift
-    end
-    until @input.wait_readable(0.01)
-      timeout_second -= 0.01
-      return nil if timeout_second <= 0
-
-      Reline.core.line_editor.handle_signal
-    end
-    c = @input.getbyte
-    (c == 0x16 && @input.tty? && @input.raw(min: 0, time: 0, &:getbyte)) || c
-  rescue Errno::EIO
-    # Maybe the I/O has been closed.
-    nil
-  end
-
-  START_BRACKETED_PASTE = String.new("\e[200~", encoding: Encoding::ASCII_8BIT)
-  END_BRACKETED_PASTE = String.new("\e[201~", encoding: Encoding::ASCII_8BIT)
-  def read_bracketed_paste
-    buffer = String.new(encoding: Encoding::ASCII_8BIT)
-    until buffer.end_with?(END_BRACKETED_PASTE)
-      c = inner_getc(Float::INFINITY)
-      break unless c
-      buffer << c
-    end
-    string = buffer.delete_suffix(END_BRACKETED_PASTE).force_encoding(encoding)
-    string.valid_encoding? ? string : ''
-  end
-
-  # if the usage expects to wait indefinitely, use Float::INFINITY for timeout_second
-  def getc(timeout_second)
-    inner_getc(timeout_second)
-  end
-
-  def in_pasting?
-    not empty_buffer?
-  end
-
-  def empty_buffer?
-    unless @buf.empty?
-      return false
-    end
-    !@input.wait_readable(0)
-  end
-
-  def ungetc(c)
-    @buf.unshift(c)
-  end
-
-  def retrieve_keybuffer
-    begin
-      return unless @input.wait_readable(0.001)
-      str = @input.read_nonblock(1024)
-      str.bytes.each do |c|
-        @buf.push(c)
-      end
-    rescue EOFError
-    end
-  end
-
-  def get_screen_size
-    s = @input.winsize
-    return s if s[0] > 0 && s[1] > 0
-    s = [ENV["LINES"].to_i, ENV["COLUMNS"].to_i]
-    return s if s[0] > 0 && s[1] > 0
-    [24, 80]
-  rescue Errno::ENOTTY, Errno::ENODEV
-    [24, 80]
-  end
-
-  def set_screen_size(rows, columns)
-    @input.winsize = [rows, columns]
-    self
-  rescue Errno::ENOTTY, Errno::ENODEV
-    self
-  end
-
-  def cursor_pos
-    if both_tty?
-      res = +''
-      m = nil
-      @input.raw do |stdin|
-        @output << "\e[6n"
-        @output.flush
-        loop do
-          c = stdin.getc
-          next if c.nil?
-          res << c
-          m = res.match(/\e\[(?<row>\d+);(?<column>\d+)R/)
-          break if m
-        end
-        (m.pre_match + m.post_match).chars.reverse_each do |ch|
-          stdin.ungetc ch
-        end
-      end
-      column = m[:column].to_i - 1
-      row = m[:row].to_i - 1
-    else
-      begin
-        buf = @output.pread(@output.pos, 0)
-        row = buf.count("\n")
-        column = buf.rindex("\n") ? (buf.size - buf.rindex("\n")) - 1 : 0
-      rescue Errno::ESPIPE, IOError
-        # Just returns column 1 for ambiguous width because this I/O is not
-        # tty and can't seek.
-        row = 0
-        column = 1
-      end
-    end
-    Reline::CursorPos.new(column, row)
-  end
-
-  def both_tty?
-    @input.tty? && @output.tty?
-  end
-
-  def move_cursor_column(x)
-    @output.write "\e[#{x + 1}G"
-  end
-
-  def move_cursor_up(x)
-    if x > 0
-      @output.write "\e[#{x}A"
-    elsif x < 0
-      move_cursor_down(-x)
-    end
-  end
-
-  def move_cursor_down(x)
-    if x > 0
-      @output.write "\e[#{x}B"
-    elsif x < 0
-      move_cursor_up(-x)
-    end
-  end
-
-  def hide_cursor
-    if Reline::Terminfo.enabled? && Reline::Terminfo.term_supported?
-      begin
-        @output.write Reline::Terminfo.tigetstr('civis')
-      rescue Reline::Terminfo::TerminfoError
-        # civis is undefined
-      end
-    else
-      # ignored
-    end
-  end
-
-  def show_cursor
-    if Reline::Terminfo.enabled? && Reline::Terminfo.term_supported?
-      begin
-        @output.write Reline::Terminfo.tigetstr('cnorm')
-      rescue Reline::Terminfo::TerminfoError
-        # cnorm is undefined
-      end
-    else
-      # ignored
-    end
-  end
-
-  def erase_after_cursor
-    @output.write "\e[K"
-  end
-
-  # This only works when the cursor is at the bottom of the scroll range
-  # For more details, see https://github.com/ruby/reline/pull/577#issuecomment-1646679623
-  def scroll_down(x)
-    return if x.zero?
-    # We use `\n` instead of CSI + S because CSI + S would cause https://github.com/ruby/reline/issues/576
-    @output.write "\n" * x
-  end
-
-  def clear_screen
-    @output.write "\e[2J"
-    @output.write "\e[1;1H"
-  end
-
-  def set_winch_handler(&handler)
-    @old_winch_handler = Signal.trap('WINCH', &handler)
-  end
-
-  def prep
-    # Enable bracketed paste
-    @output.write "\e[?2004h" if Reline.core.config.enable_bracketed_paste && both_tty?
-    retrieve_keybuffer
-    nil
-  end
-
-  def deprep(otio)
-    # Disable bracketed paste
-    @output.write "\e[?2004l" if Reline.core.config.enable_bracketed_paste && both_tty?
-    Signal.trap('WINCH', @old_winch_handler) if @old_winch_handler
-  end
-end
diff --git a/lib/reline/io/dumb.rb b/lib/reline/io/dumb.rb
deleted file mode 100644
index 6ed69ffdfa..0000000000
--- a/lib/reline/io/dumb.rb
+++ /dev/null
@@ -1,106 +0,0 @@
-require 'io/wait'
-
-class Reline::Dumb < Reline::IO
-  RESET_COLOR = '' # Do not send color reset sequence
-
-  def initialize(encoding: nil)
-    @input = STDIN
-    @buf = []
-    @pasting = false
-    @encoding = encoding
-    @screen_size = [24, 80]
-  end
-
-  def dumb?
-    true
-  end
-
-  def encoding
-    if @encoding
-      @encoding
-    elsif RUBY_PLATFORM =~ /mswin|mingw/
-      Encoding::UTF_8
-    else
-      Encoding::default_external
-    end
-  end
-
-  def set_default_key_bindings(_)
-  end
-
-  def input=(val)
-    @input = val
-  end
-
-  def with_raw_input
-    yield
-  end
-
-  def getc(_timeout_second)
-    unless @buf.empty?
-      return @buf.shift
-    end
-    c = nil
-    loop do
-      Reline.core.line_editor.handle_signal
-      result = @input.wait_readable(0.1)
-      next if result.nil?
-      c = @input.read(1)
-      break
-    end
-    c&.ord
-  end
-
-  def ungetc(c)
-    @buf.unshift(c)
-  end
-
-  def get_screen_size
-    @screen_size
-  end
-
-  def cursor_pos
-    Reline::CursorPos.new(1, 1)
-  end
-
-  def hide_cursor
-  end
-
-  def show_cursor
-  end
-
-  def move_cursor_column(val)
-  end
-
-  def move_cursor_up(val)
-  end
-
-  def move_cursor_down(val)
-  end
-
-  def erase_after_cursor
-  end
-
-  def scroll_down(val)
-  end
-
-  def clear_screen
-  end
-
-  def set_screen_size(rows, columns)
-    @screen_size = [rows, columns]
-  end
-
-  def set_winch_handler(&handler)
-  end
-
-  def in_pasting?
-    @pasting
-  end
-
-  def prep
-  end
-
-  def deprep(otio)
-  end
-end
diff --git a/lib/reline/io/windows.rb b/lib/reline/io/windows.rb
deleted file mode 100644
index 6ba4b830d6..0000000000
--- a/lib/reline/io/windows.rb
+++ /dev/null
@@ -1,503 +0,0 @@
-require 'fiddle/import'
-
-class Reline::Windows < Reline::IO
-  def initialize
-    @input_buf = []
-    @output_buf = []
-
-    @output = STDOUT
-    @hsg = nil
-    @getwch = Win32API.new('msvcrt', '_getwch', [], 'I')
-    @kbhit = Win32API.new('msvcrt', '_kbhit', [], 'I')
-    @GetKeyState = Win32API.new('user32', 'GetKeyState', ['L'], 'L')
-    @GetConsoleScreenBufferInfo = Win32API.new('kernel32', 'GetConsoleScreenBufferInfo', ['L', 'P'], 'L')
-    @SetConsoleCursorPosition = Win32API.new('kernel32', 'SetConsoleCursorPosition', ['L', 'L'], 'L')
-    @GetStdHandle = Win32API.new('kernel32', 'GetStdHandle', ['L'], 'L')
-    @FillConsoleOutputCharacter = Win32API.new('kernel32', 'FillConsoleOutputCharacter', ['L', 'L', 'L', 'L', 'P'], 'L')
-    @ScrollConsoleScreenBuffer = Win32API.new('kernel32', 'ScrollConsoleScreenBuffer', ['L', 'P', 'P', 'L', 'P'], 'L')
-    @hConsoleHandle = @GetStdHandle.call(STD_OUTPUT_HANDLE)
-    @hConsoleInputHandle = @GetStdHandle.call(STD_INPUT_HANDLE)
-    @GetNumberOfConsoleInputEvents = Win32API.new('kernel32', 'GetNumberOfConsoleInputEvents', ['L', 'P'], 'L')
-    @ReadConsoleInputW = Win32API.new('kernel32', 'ReadConsoleInputW', ['L', 'P', 'L', 'P'], 'L')
-    @GetFileType = Win32API.new('kernel32', 'GetFileType', ['L'], 'L')
-    @GetFileInformationByHandleEx = Win32API.new('kernel32', 'GetFileInformationByHandleEx', ['L', 'I', 'P', 'L'], 'I')
-    @FillConsoleOutputAttribute = Win32API.new('kernel32', 'FillConsoleOutputAttribute', ['L', 'L', 'L', 'L', 'P'], 'L')
-    @SetConsoleCursorInfo = Win32API.new('kernel32', 'SetConsoleCursorInfo', ['L', 'P'], 'L')
-
-    @GetConsoleMode = Win32API.new('kernel32', 'GetConsoleMode', ['L', 'P'], 'L')
-    @SetConsoleMode = Win32API.new('kernel32', 'SetConsoleMode', ['L', 'L'], 'L')
-    @WaitForSingleObject = Win32API.new('kernel32', 'WaitForSingleObject', ['L', 'L'], 'L')
-
-    @legacy_console = getconsolemode & ENABLE_VIRTUAL_TERMINAL_PROCESSING == 0
-  end
-
-  def encoding
-    Encoding::UTF_8
-  end
-
-  def win?
-    true
-  end
-
-  def win_legacy_console?
-    @legacy_console
-  end
-
-  def set_default_key_bindings(config)
-    {
-      [224, 72] => :ed_prev_history, # ↑
-      [224, 80] => :ed_next_history, # ↓
-      [224, 77] => :ed_next_char,    # →
-      [224, 75] => :ed_prev_char,    # ←
-      [224, 83] => :key_delete,      # Del
-      [224, 71] => :ed_move_to_beg,  # Home
-      [224, 79] => :ed_move_to_end,  # End
-      [  0, 41] => :ed_unassigned,   # input method on/off
-      [  0, 72] => :ed_prev_history, # ↑
-      [  0, 80] => :ed_next_history, # ↓
-      [  0, 77] => :ed_next_char,    # →
-      [  0, 75] => :ed_prev_char,    # ←
-      [  0, 83] => :key_delete,      # Del
-      [  0, 71] => :ed_move_to_beg,  # Home
-      [  0, 79] => :ed_move_to_end   # End
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-      config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-      config.add_default_key_binding_by_keymap(:vi_command, key, func)
-    end
-
-    {
-      [27, 32] => :em_set_mark,             # M-<space>
-      [24, 24] => :em_exchange_mark,        # C-x C-x
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-    end
-
-    # Emulate ANSI key sequence.
-    {
-      [27, 91, 90] => :completion_journey_up, # S-Tab
-    }.each_pair do |key, func|
-      config.add_default_key_binding_by_keymap(:emacs, key, func)
-      config.add_default_key_binding_by_keymap(:vi_insert, key, func)
-    end
-  end
-
-  if defined? JRUBY_VERSION
-    require 'win32api'
-  else
-    class Win32API
-      DLL = {}
-      TYPEMAP = {"0" => Fiddle::TYPE_VOID, "S" => Fiddle::TYPE_VOIDP, "I" => Fiddle::TYPE_LONG}
-      POINTER_TYPE = Fiddle::SIZEOF_VOIDP == Fiddle::SIZEOF_LONG_LONG ? 'q*' : 'l!*'
-
-      WIN32_TYPES = "VPpNnLlIi"
-      DL_TYPES = "0SSI"
-
-      def initialize(dllname, func, import, export = "0", calltype = :stdcall)
-        @proto = [import].join.tr(WIN32_TYPES, DL_TYPES).sub(/^(.)0*$/, '\1')
-        import = @proto.chars.map {|win_type| TYPEMAP[win_type.tr(WIN32_TYPES, DL_TYPES)]}
-        export = TYPEMAP[export.tr(WIN32_TYPES, DL_TYPES)]
-        calltype = Fiddle::Importer.const_get(:CALL_TYPE_TO_ABI)[calltype]
-
-        handle = DLL[dllname] ||=
-                 begin
-                   Fiddle.dlopen(dllname)
-                 rescue Fiddle::DLError
-                   raise unless File.extname(dllname).empty?
-                   Fiddle.dlopen(dllname + ".dll")
-                 end
-
-        @func = Fiddle::Function.new(handle[func], import, export, calltype)
-      rescue Fiddle::DLError => e
-        raise LoadError, e.message, e.backtrace
-      end
-
-      def call(*args)
-        import = @proto.split("")
-        args.each_with_index do |x, i|
-          args[i], = [x == 0 ? nil : +x].pack("p").unpack(POINTER_TYPE) if import[i] == "S"
-          args[i], = [x].pack("I").unpack("i") if import[i] == "I"
-        end
-        ret, = @func.call(*args)
-        return ret || 0
-      end
-    end
-  end
-
-  VK_RETURN = 0x0D
-  VK_MENU = 0x12 # ALT key
-  VK_LMENU = 0xA4
-  VK_CONTROL = 0x11
-  VK_SHIFT = 0x10
-  VK_DIVIDE = 0x6F
-
-  KEY_EVENT = 0x01
-  WINDOW_BUFFER_SIZE_EVENT = 0x04
-
-  CAPSLOCK_ON = 0x0080
-  ENHANCED_KEY = 0x0100
-  LEFT_ALT_PRESSED = 0x0002
-  LEFT_CTRL_PRESSED = 0x0008
-  NUMLOCK_ON = 0x0020
-  RIGHT_ALT_PRESSED = 0x0001
-  RIGHT_CTRL_PRESSED = 0x0004
-  SCROLLLOCK_ON = 0x0040
-  SHIFT_PRESSED = 0x0010
-
-  VK_TAB = 0x09
-  VK_END = 0x23
-  VK_HOME = 0x24
-  VK_LEFT = 0x25
-  VK_UP = 0x26
-  VK_RIGHT = 0x27
-  VK_DOWN = 0x28
-  VK_DELETE = 0x2E
-
-  STD_INPUT_HANDLE = -10
-  STD_OUTPUT_HANDLE = -11
-  FILE_TYPE_PIPE = 0x0003
-  FILE_NAME_INFO = 2
-  ENABLE_VIRTUAL_TERMINAL_PROCESSING = 4
-
-  private def getconsolemode
-    mode = "\000\000\000\000"
-    @GetConsoleMode.call(@hConsoleHandle, mode)
-    mode.unpack1('L')
-  end
-
-  private def setconsolemode(mode)
-    @SetConsoleMode.call(@hConsoleHandle, mode)
-  end
-
-  #if @legacy_console
-  #  setconsolemode(getconsolemode() | ENABLE_VIRTUAL_TERMINAL_PROCESSING)
-  #  @legacy_console = (getconsolemode() & ENABLE_VIRTUAL_TERMINAL_PROCESSING == 0)
-  #end
-
-  def msys_tty?(io = @hConsoleInputHandle)
-    # check if fd is a pipe
-    if @GetFileType.call(io) != FILE_TYPE_PIPE
-      return false
-    end
-
-    bufsize = 1024
-    p_buffer = "\0" * bufsize
-    res = @GetFileInformationByHandleEx.call(io, FILE_NAME_INFO, p_buffer, bufsize - 2)
-    return false if res == 0
-
-    # get pipe name: p_buffer layout is:
-    #   struct _FILE_NAME_INFO {
-    #     DWORD FileNameLength;
-    #     WCHAR FileName[1];
-    #   } FILE_NAME_INFO
-    len = p_buffer[0, 4].unpack1("L")
-    name = p_buffer[4, len].encode(Encoding::UTF_8, Encoding::UTF_16LE, invalid: :replace)
-
-    # Check if this could be a MSYS2 pty pipe ('\msys-XXXX-ptyN-XX')
-    # or a cygwin pty pipe ('\cygwin-XXXX-ptyN-XX')
-    name =~ /(msys-|cygwin-).*-pty/ ? true : false
-  end
-
-  KEY_MAP = [
-    # It's treated as Meta+Enter on Windows.
-    [ { control_keys: :CTRL,  virtual_key_code: 0x0D }, "\e\r".bytes ],
-    [ { control_keys: :SHIFT, virtual_key_code: 0x0D }, "\e\r".bytes ],
-
-    # It's treated as Meta+Space on Windows.
-    [ { control_keys: :CTRL,  char_code: 0x20 }, "\e ".bytes ],
-
-    # Emulate getwch() key sequences.
-    [ { control_keys: [], virtual_key_code: VK_UP },     [0, 72] ],
-    [ { control_keys: [], virtual_key_code: VK_DOWN },   [0, 80] ],
-    [ { control_keys: [], virtual_key_code: VK_RIGHT },  [0, 77] ],
-    [ { control_keys: [], virtual_key_code: VK_LEFT },   [0, 75] ],
-    [ { control_keys: [], virtual_key_code: VK_DELETE }, [0, 83] ],
-    [ { control_keys: [], virtual_key_code: VK_HOME },   [0, 71] ],
-    [ { control_keys: [], virtual_key_code: VK_END },    [0, 79] ],
-
-    # Emulate ANSI key sequence.
-    [ { control_keys: :SHIFT, virtual_key_code: VK_TAB }, [27, 91, 90] ],
-  ]
-
-  def process_key_event(repeat_count, virtual_key_code, virtual_scan_code, char_code, control_key_state)
-
-    # high-surrogate
-    if 0xD800 <= char_code and char_code <= 0xDBFF
-      @hsg = char_code
-      return
-    end
-    # low-surrogate
-    if 0xDC00 <= char_code and char_code <= 0xDFFF
-      if @hsg
-        char_code = 0x10000 + (@hsg - 0xD800) * 0x400 + char_code - 0xDC00
-        @hsg = nil
-      else
-        # no high-surrogate. ignored.
-        return
-      end
-    else
-      # ignore high-surrogate without low-surrogate if there
-      @hsg = nil
-    end
-
-    key = KeyEventRecord.new(virtual_key_code, char_code, control_key_state)
-
-    match = KEY_MAP.find { |args,| key.matches?(**args) }
-    unless match.nil?
-      @output_buf.concat(match.last)
-      return
-    end
-
-    # no char, only control keys
-    return if key.char_code == 0 and key.control_keys.any?
-
-    @output_buf.push("\e".ord) if key.control_keys.include?(:ALT) and !key.control_keys.include?(:CTRL)
-
-    @output_buf.concat(key.char.bytes)
-  end
-
-  def check_input_event
-    num_of_events = 0.chr * 8
-    while @output_buf.empty?
-      Reline.core.line_editor.handle_signal
-      if @WaitForSingleObject.(@hConsoleInputHandle, 100) != 0 # max 0.1 sec
-        # prevent for background consolemode change
-        @legacy_console = getconsolemode & ENABLE_VIRTUAL_TERMINAL_PROCESSING == 0
-        next
-      end
-      next if @GetNumberOfConsoleInputEvents.(@hConsoleInputHandle, num_of_events) == 0 or num_of_events.unpack1('L') == 0
-      input_records = 0.chr * 20 * 80
-      read_event = 0.chr * 4
-      if @ReadConsoleInputW.(@hConsoleInputHandle, input_records, 80, read_event) != 0
-        read_events = read_event.unpack1('L')
-        0.upto(read_events) do |idx|
-          input_record = input_records[idx * 20, 20]
-          event = input_record[0, 2].unpack1('s*')
-          case event
-          when WINDOW_BUFFER_SIZE_EVENT
-            @winch_handler.()
-          when KEY_EVENT
-            key_down = input_record[4, 4].unpack1('l*')
-            repeat_count = input_record[8, 2].unpack1('s*')
-            virtual_key_code = input_record[10, 2].unpack1('s*')
-            virtual_scan_code = input_record[12, 2].unpack1('s*')
-            char_code = input_record[14, 2].unpack1('S*')
-            control_key_state = input_record[16, 2].unpack1('S*')
-            is_key_down = key_down.zero? ? false : true
-            if is_key_down
-              process_key_event(repeat_count, virtual_key_code, virtual_scan_code, char_code, control_key_state)
-            end
-          end
-        end
-      end
-    end
-  end
-
-  def with_raw_input
-    yield
-  end
-
-  def getc(_timeout_second)
-    check_input_event
-    @output_buf.shift
-  end
-
-  def ungetc(c)
-    @output_buf.unshift(c)
-  end
-
-  def in_pasting?
-    not empty_buffer?
-  end
-
-  def empty_buffer?
-    if not @output_buf.empty?
-      false
-    elsif @kbhit.call == 0
-      true
-    else
-      false
-    end
-  end
-
-  def get_console_screen_buffer_info
-    # CONSOLE_SCREEN_BUFFER_INFO
-    # [ 0,2] dwSize.X
-    # [ 2,2] dwSize.Y
-    # [ 4,2] dwCursorPositions.X
-    # [ 6,2] dwCursorPositions.Y
-    # [ 8,2] wAttributes
-    # [10,2] srWindow.Left
-    # [12,2] srWindow.Top
-    # [14,2] srWindow.Right
-    # [16,2] srWindow.Bottom
-    # [18,2] dwMaximumWindowSize.X
-    # [20,2] dwMaximumWindowSize.Y
-    csbi = 0.chr * 22
-    return if @GetConsoleScreenBufferInfo.call(@hConsoleHandle, csbi) == 0
-    csbi
-  end
-
-  def get_screen_size
-    unless csbi = get_console_screen_buffer_info
-      return [1, 1]
-    end
-    csbi[0, 4].unpack('SS').reverse
-  end
-
-  def cursor_pos
-    unless csbi = get_console_screen_buffer_info
-      return Reline::CursorPos.new(0, 0)
-    end
-    x = csbi[4, 2].unpack1('s')
-    y = csbi[6, 2].unpack1('s')
-    Reline::CursorPos.new(x, y)
-  end
-
-  def move_cursor_column(val)
-    @SetConsoleCursorPosition.call(@hConsoleHandle, cursor_pos.y * 65536 + val)
-  end
-
-  def move_cursor_up(val)
-    if val > 0
-      y = cursor_pos.y - val
-      y = 0 if y < 0
-      @SetConsoleCursorPosition.call(@hConsoleHandle, y * 65536 + cursor_pos.x)
-    elsif val < 0
-      move_cursor_down(-val)
-    end
-  end
-
-  def move_cursor_down(val)
-    if val > 0
-      return unless csbi = get_console_screen_buffer_info
-      screen_height = get_screen_size.first
-      y = cursor_pos.y + val
-      y = screen_height - 1 if y > (screen_height - 1)
-      @SetConsoleCursorPosition.call(@hConsoleHandle, (cursor_pos.y + val) * 65536 + cursor_pos.x)
-    elsif val < 0
-      move_cursor_up(-val)
-    end
-  end
-
-  def erase_after_cursor
-    return unless csbi = get_console_screen_buffer_info
-    attributes = csbi[8, 2].unpack1('S')
-    cursor = csbi[4, 4].unpack1('L')
-    written = 0.chr * 4
-    @FillConsoleOutputCharacter.call(@hConsoleHandle, 0x20, get_screen_size.last - cursor_pos.x, cursor, written)
-    @FillConsoleOutputAttribute.call(@hConsoleHandle, attributes, get_screen_size.last - cursor_pos.x, cursor, written)
-  end
-
-  def scroll_down(val)
-    return if val < 0
-    return unless csbi = get_console_screen_buffer_info
-    buffer_width, buffer_lines, x, y, attributes, window_left, window_top, window_bottom = csbi.unpack('ssssSssx2s')
-    screen_height = window_bottom - window_top + 1
-    val = screen_height if val > screen_height
-
-    if @legacy_console || window_left != 0
-      # unless ENABLE_VIRTUAL_TERMINAL,
-      # if srWindow.Left != 0 then it's conhost.exe hosted console
-      # and puts "\n" causes horizontal scroll. its glitch.
-      # FYI irb write from culumn 1, so this gives no gain.
-      scroll_rectangle = [0, val, buffer_width, buffer_lines - val].pack('s4')
-      destination_origin = 0 # y * 65536 + x
-      fill = [' '.ord, attributes].pack('SS')
-      @ScrollConsoleScreenBuffer.call(@hConsoleHandle, scroll_rectangle, nil, destination_origin, fill)
-    else
-      origin_x = x + 1
-      origin_y = y - window_top + 1
-      @output.write [
-        (origin_y != screen_height) ? "\e[#{screen_height};H" : nil,
-        "\n" * val,
-        (origin_y != screen_height or !x.zero?) ? "\e[#{origin_y};#{origin_x}H" : nil
-      ].join
-    end
-  end
-
-  def clear_screen
-    if @legacy_console
-      return unless csbi = get_console_screen_buffer_info
-      buffer_width, _buffer_lines, attributes, window_top, window_bottom = csbi.unpack('ss@8S@12sx2s')
-      fill_length = buffer_width * (window_bottom - window_top + 1)
-      screen_topleft = window_top * 65536
-      written = 0.chr * 4
-      @FillConsoleOutputCharacter.call(@hConsoleHandle, 0x20, fill_length, screen_topleft, written)
-      @FillConsoleOutputAttribute.call(@hConsoleHandle, attributes, fill_length, screen_topleft, written)
-      @SetConsoleCursorPosition.call(@hConsoleHandle, screen_topleft)
-    else
-      @output.write "\e[2J" "\e[H"
-    end
-  end
-
-  def set_screen_size(rows, columns)
-    raise NotImplementedError
-  end
-
-  def hide_cursor
-    size = 100
-    visible = 0 # 0 means false
-    cursor_info = [size, visible].pack('Li')
-    @SetConsoleCursorInfo.call(@hConsoleHandle, cursor_info)
-  end
-
-  def show_cursor
-    size = 100
-    visible = 1 # 1 means true
-    cursor_info = [size, visible].pack('Li')
-    @SetConsoleCursorInfo.call(@hConsoleHandle, cursor_info)
-  end
-
-  def set_winch_handler(&handler)
-    @winch_handler = handler
-  end
-
-  def prep
-    # do nothing
-    nil
-  end
-
-  def deprep(otio)
-    # do nothing
-  end
-
-  class KeyEventRecord
-
-    attr_reader :virtual_key_code, :char_code, :control_key_state, :control_keys
-
-    def initialize(virtual_key_code, char_code, control_key_state)
-      @virtual_key_code = virtual_key_code
-      @char_code = char_code
-      @control_key_state = control_key_state
-      @enhanced = control_key_state & ENHANCED_KEY != 0
-
-      (@control_keys = []).tap do |control_keys|
-        # symbols must be sorted to make comparison is easier later on
-        control_keys << :ALT   if control_key_state & (LEFT_ALT_PRESSED | RIGHT_ALT_PRESSED) != 0
-        control_keys << :CTRL  if control_key_state & (LEFT_CTRL_PRESSED | RIGHT_CTRL_PRESSED) != 0
-        control_keys << :SHIFT if control_key_state & SHIFT_PRESSED != 0
-      end.freeze
-    end
-
-    def char
-      @char_code.chr(Encoding::UTF_8)
-    end
-
-    def enhanced?
-      @enhanced
-    end
-
-    # Verifies if the arguments match with this key event.
-    # Nil arguments are ignored, but at least one must be passed as non-nil.
-    # To verify that no control keys were pressed, pass an empty array: `control_keys: []`.
-    def matches?(control_keys: nil, virtual_key_code: nil, char_code: nil)
-      raise ArgumentError, 'No argument was passed to match key event' if control_keys.nil? && virtual_key_code.nil? && char_code.nil?
-
-      (control_keys.nil? || [*control_keys].sort == @control_keys) &&
-      (virtual_key_code.nil? || @virtual_key_code == virtual_key_code) &&
-      (char_code.nil? || char_code == @char_code)
-    end
-
-  end
-end
diff --git a/lib/reline/key_actor.rb b/lib/reline/key_actor.rb
deleted file mode 100644
index 0ac7604556..0000000000
--- a/lib/reline/key_actor.rb
+++ /dev/null
@@ -1,8 +0,0 @@
-module Reline::KeyActor
-end
-
-require 'reline/key_actor/base'
-require 'reline/key_actor/composite'
-require 'reline/key_actor/emacs'
-require 'reline/key_actor/vi_command'
-require 'reline/key_actor/vi_insert'
diff --git a/lib/reline/key_actor/base.rb b/lib/reline/key_actor/base.rb
deleted file mode 100644
index ee28c7681e..0000000000
--- a/lib/reline/key_actor/base.rb
+++ /dev/null
@@ -1,31 +0,0 @@
-class Reline::KeyActor::Base
-  def initialize(mapping = [])
-    @mapping = mapping
-    @matching_bytes = {}
-    @key_bindings = {}
-  end
-
-  def get_method(key)
-    @mapping[key]
-  end
-
-  def add(key, func)
-    (1...key.size).each do |size|
-      @matching_bytes[key.take(size)] = true
-    end
-    @key_bindings[key] = func
-  end
-
-  def matching?(key)
-    @matching_bytes[key]
-  end
-
-  def get(key)
-    @key_bindings[key]
-  end
-
-  def clear
-    @matching_bytes.clear
-    @key_bindings.clear
-  end
-end
diff --git a/lib/reline/key_actor/composite.rb b/lib/reline/key_actor/composite.rb
deleted file mode 100644
index 37e94ce6cf..0000000000
--- a/lib/reline/key_actor/composite.rb
+++ /dev/null
@@ -1,17 +0,0 @@
-class Reline::KeyActor::Composite
-  def initialize(key_actors)
-    @key_actors = key_actors
-  end
-
-  def matching?(key)
-    @key_actors.any? { |key_actor| key_actor.matching?(key) }
-  end
-
-  def get(key)
-    @key_actors.each do |key_actor|
-      func = key_actor.get(key)
-      return func if func
-    end
-    nil
-  end
-end
diff --git a/lib/reline/key_actor/emacs.rb b/lib/reline/key_actor/emacs.rb
deleted file mode 100644
index ad84ee1d99..0000000000
--- a/lib/reline/key_actor/emacs.rb
+++ /dev/null
@@ -1,517 +0,0 @@
-module Reline::KeyActor
-  EMACS_MAPPING = [
-    #   0 ^@
-    :em_set_mark,
-    #   1 ^A
-    :ed_move_to_beg,
-    #   2 ^B
-    :ed_prev_char,
-    #   3 ^C
-    :ed_ignore,
-    #   4 ^D
-    :em_delete,
-    #   5 ^E
-    :ed_move_to_end,
-    #   6 ^F
-    :ed_next_char,
-    #   7 ^G
-    :ed_unassigned,
-    #   8 ^H
-    :em_delete_prev_char,
-    #   9 ^I
-    :complete,
-    #  10 ^J
-    :ed_newline,
-    #  11 ^K
-    :ed_kill_line,
-    #  12 ^L
-    :ed_clear_screen,
-    #  13 ^M
-    :ed_newline,
-    #  14 ^N
-    :ed_next_history,
-    #  15 ^O
-    :ed_ignore,
-    #  16 ^P
-    :ed_prev_history,
-    #  17 ^Q
-    :ed_quoted_insert,
-    #  18 ^R
-    :vi_search_prev,
-    #  19 ^S
-    :vi_search_next,
-    #  20 ^T
-    :ed_transpose_chars,
-    #  21 ^U
-    :unix_line_discard,
-    #  22 ^V
-    :ed_quoted_insert,
-    #  23 ^W
-    :em_kill_region,
-    #  24 ^X
-    :ed_unassigned,
-    #  25 ^Y
-    :em_yank,
-    #  26 ^Z
-    :ed_ignore,
-    #  27 ^[
-    :ed_unassigned,
-    #  28 ^\
-    :ed_ignore,
-    #  29 ^]
-    :ed_ignore,
-    #  30 ^^
-    :ed_unassigned,
-    #  31 ^_
-    :undo,
-    #  32 SPACE
-    :ed_insert,
-    #  33 !
-    :ed_insert,
-    #  34 "
-    :ed_insert,
-    #  35 #
-    :ed_insert,
-    #  36 $
-    :ed_insert,
-    #  37 %
-    :ed_insert,
-    #  38 &
-    :ed_insert,
-    #  39 '
-    :ed_insert,
-    #  40 (
-    :ed_insert,
-    #  41 )
-    :ed_insert,
-    #  42 *
-    :ed_insert,
-    #  43 +
-    :ed_insert,
-    #  44 ,
-    :ed_insert,
-    #  45 -
-    :ed_insert,
-    #  46 .
-    :ed_insert,
-    #  47 /
-    :ed_insert,
-    #  48 0
-    :ed_digit,
-    #  49 1
-    :ed_digit,
-    #  50 2
-    :ed_digit,
-    #  51 3
-    :ed_digit,
-    #  52 4
-    :ed_digit,
-    #  53 5
-    :ed_digit,
-    #  54 6
-    :ed_digit,
-    #  55 7
-    :ed_digit,
-    #  56 8
-    :ed_digit,
-    #  57 9
-    :ed_digit,
-    #  58 :
-    :ed_insert,
-    #  59 ;
-    :ed_insert,
-    #  60 <
-    :ed_insert,
-    #  61 =
-    :ed_insert,
-    #  62 >
-    :ed_insert,
-    #  63 ?
-    :ed_insert,
-    #  64 @
-    :ed_insert,
-    #  65 A
-    :ed_insert,
-    #  66 B
-    :ed_insert,
-    #  67 C
-    :ed_insert,
-    #  68 D
-    :ed_insert,
-    #  69 E
-    :ed_insert,
-    #  70 F
-    :ed_insert,
-    #  71 G
-    :ed_insert,
-    #  72 H
-    :ed_insert,
-    #  73 I
-    :ed_insert,
-    #  74 J
-    :ed_insert,
-    #  75 K
-    :ed_insert,
-    #  76 L
-    :ed_insert,
-    #  77 M
-    :ed_insert,
-    #  78 N
-    :ed_insert,
-    #  79 O
-    :ed_insert,
-    #  80 P
-    :ed_insert,
-    #  81 Q
-    :ed_insert,
-    #  82 R
-    :ed_insert,
-    #  83 S
-    :ed_insert,
-    #  84 T
-    :ed_insert,
-    #  85 U
-    :ed_insert,
-    #  86 V
-    :ed_insert,
-    #  87 W
-    :ed_insert,
-    #  88 X
-    :ed_insert,
-    #  89 Y
-    :ed_insert,
-    #  90 Z
-    :ed_insert,
-    #  91 [
-    :ed_insert,
-    #  92 \
-    :ed_insert,
-    #  93 ]
-    :ed_insert,
-    #  94 ^
-    :ed_insert,
-    #  95 _
-    :ed_insert,
-    #  96 `
-    :ed_insert,
-    #  97 a
-    :ed_insert,
-    #  98 b
-    :ed_insert,
-    #  99 c
-    :ed_insert,
-    # 100 d
-    :ed_insert,
-    # 101 e
-    :ed_insert,
-    # 102 f
-    :ed_insert,
-    # 103 g
-    :ed_insert,
-    # 104 h
-    :ed_insert,
-    # 105 i
-    :ed_insert,
-    # 106 j
-    :ed_insert,
-    # 107 k
-    :ed_insert,
-    # 108 l
-    :ed_insert,
-    # 109 m
-    :ed_insert,
-    # 110 n
-    :ed_insert,
-    # 111 o
-    :ed_insert,
-    # 112 p
-    :ed_insert,
-    # 113 q
-    :ed_insert,
-    # 114 r
-    :ed_insert,
-    # 115 s
-    :ed_insert,
-    # 116 t
-    :ed_insert,
-    # 117 u
-    :ed_insert,
-    # 118 v
-    :ed_insert,
-    # 119 w
-    :ed_insert,
-    # 120 x
-    :ed_insert,
-    # 121 y
-    :ed_insert,
-    # 122 z
-    :ed_insert,
-    # 123 {
-    :ed_insert,
-    # 124 |
-    :ed_insert,
-    # 125 }
-    :ed_insert,
-    # 126 ~
-    :ed_insert,
-    # 127 ^?
-    :em_delete_prev_char,
-    # 128 M-^@
-    :ed_unassigned,
-    # 129 M-^A
-    :ed_unassigned,
-    # 130 M-^B
-    :ed_unassigned,
-    # 131 M-^C
-    :ed_unassigned,
-    # 132 M-^D
-    :ed_unassigned,
-    # 133 M-^E
-    :ed_unassigned,
-    # 134 M-^F
-    :ed_unassigned,
-    # 135 M-^G
-    :ed_unassigned,
-    # 136 M-^H
-    :ed_delete_prev_word,
-    # 137 M-^I
-    :ed_unassigned,
-    # 138 M-^J
-    :key_newline,
-    # 139 M-^K
-    :ed_unassigned,
-    # 140 M-^L
-    :ed_clear_screen,
-    # 141 M-^M
-    :key_newline,
-    # 142 M-^N
-    :ed_unassigned,
-    # 143 M-^O
-    :ed_unassigned,
-    # 144 M-^P
-    :ed_unassigned,
-    # 145 M-^Q
-    :ed_unassigned,
-    # 146 M-^R
-    :ed_unassigned,
-    # 147 M-^S
-    :ed_unassigned,
-    # 148 M-^T
-    :ed_unassigned,
-    # 149 M-^U
-    :ed_unassigned,
-    # 150 M-^V
-    :ed_unassigned,
-    # 151 M-^W
-    :ed_unassigned,
-    # 152 M-^X
-    :ed_unassigned,
-    # 153 M-^Y
-    :em_yank_pop,
-    # 154 M-^Z
-    :ed_unassigned,
-    # 155 M-^[
-    :ed_unassigned,
-    # 156 M-^\
-    :ed_unassigned,
-    # 157 M-^]
-    :ed_unassigned,
-    # 158 M-^^
-    :ed_unassigned,
-    # 159 M-^_
-    :redo,
-    # 160 M-SPACE
-    :em_set_mark,
-    # 161 M-!
-    :ed_unassigned,
-    # 162 M-"
-    :ed_unassigned,
-    # 163 M-#
-    :ed_unassigned,
-    # 164 M-$
-    :ed_unassigned,
-    # 165 M-%
-    :ed_unassigned,
-    # 166 M-&
-    :ed_unassigned,
-    # 167 M-'
-    :ed_unassigned,
-    # 168 M-(
-    :ed_unassigned,
-    # 169 M-)
-    :ed_unassigned,
-    # 170 M-*
-    :ed_unassigned,
-    # 171 M-+
-    :ed_unassigned,
-    # 172 M-,
-    :ed_unassigned,
-    # 173 M--
-    :ed_unassigned,
-    # 174 M-.
-    :ed_unassigned,
-    # 175 M-/
-    :ed_unassigned,
-    # 176 M-0
-    :ed_argument_digit,
-    # 177 M-1
-    :ed_argument_digit,
-    # 178 M-2
-    :ed_argument_digit,
-    # 179 M-3
-    :ed_argument_digit,
-    # 180 M-4
-    :ed_argument_digit,
-    # 181 M-5
-    :ed_argument_digit,
-    # 182 M-6
-    :ed_argument_digit,
-    # 183 M-7
-    :ed_argument_digit,
-    # 184 M-8
-    :ed_argument_digit,
-    # 185 M-9
-    :ed_argument_digit,
-    # 186 M-:
-    :ed_unassigned,
-    # 187 M-;
-    :ed_unassigned,
-    # 188 M-<
-    :ed_unassigned,
-    # 189 M-=
-    :ed_unassigned,
-    # 190 M->
-    :ed_unassigned,
-    # 191 M-?
-    :ed_unassigned,
-    # 192 M-@
-    :ed_unassigned,
-    # 193 M-A
-    :ed_unassigned,
-    # 194 M-B
-    :ed_prev_word,
-    # 195 M-C
-    :em_capitol_case,
-    # 196 M-D
-    :em_delete_next_word,
-    # 197 M-E
-    :ed_unassigned,
-    # 198 M-F
-    :em_next_word,
-    # 199 M-G
-    :ed_unassigned,
-    # 200 M-H
-    :ed_unassigned,
-    # 201 M-I
-    :ed_unassigned,
-    # 202 M-J
-    :ed_unassigned,
-    # 203 M-K
-    :ed_unassigned,
-    # 204 M-L
-    :em_lower_case,
-    # 205 M-M
-    :ed_unassigned,
-    # 206 M-N
-    :vi_search_next,
-    # 207 M-O
-    :ed_unassigned,
-    # 208 M-P
-    :vi_search_prev,
-    # 209 M-Q
-    :ed_unassigned,
-    # 210 M-R
-    :ed_unassigned,
-    # 211 M-S
-    :ed_unassigned,
-    # 212 M-T
-    :ed_unassigned,
-    # 213 M-U
-    :em_upper_case,
-    # 214 M-V
-    :ed_unassigned,
-    # 215 M-W
-    :ed_unassigned,
-    # 216 M-X
-    :ed_unassigned,
-    # 217 M-Y
-    :em_yank_pop,
-    # 218 M-Z
-    :ed_unassigned,
-    # 219 M-[
-    :ed_unassigned,
-    # 220 M-\
-    :ed_unassigned,
-    # 221 M-]
-    :ed_unassigned,
-    # 222 M-^
-    :ed_unassigned,
-    # 223 M-_
-    :ed_unassigned,
-    # 224 M-`
-    :ed_unassigned,
-    # 225 M-a
-    :ed_unassigned,
-    # 226 M-b
-    :ed_prev_word,
-    # 227 M-c
-    :em_capitol_case,
-    # 228 M-d
-    :em_delete_next_word,
-    # 229 M-e
-    :ed_unassigned,
-    # 230 M-f
-    :em_next_word,
-    # 231 M-g
-    :ed_unassigned,
-    # 232 M-h
-    :ed_unassigned,
-    # 233 M-i
-    :ed_unassigned,
-    # 234 M-j
-    :ed_unassigned,
-    # 235 M-k
-    :ed_unassigned,
-    # 236 M-l
-    :em_lower_case,
-    # 237 M-m
-    :ed_unassigned,
-    # 238 M-n
-    :vi_search_next,
-    # 239 M-o
-    :ed_unassigned,
-    # 240 M-p
-    :vi_search_prev,
-    # 241 M-q
-    :ed_unassigned,
-    # 242 M-r
-    :ed_unassigned,
-    # 243 M-s
-    :ed_unassigned,
-    # 244 M-t
-    :ed_transpose_words,
-    # 245 M-u
-    :em_upper_case,
-    # 246 M-v
-    :ed_unassigned,
-    # 247 M-w
-    :ed_unassigned,
-    # 248 M-x
-    :ed_unassigned,
-    # 249 M-y
-    :ed_unassigned,
-    # 250 M-z
-    :ed_unassigned,
-    # 251 M-{
-    :ed_unassigned,
-    # 252 M-|
-    :ed_unassigned,
-    # 253 M-}
-    :ed_unassigned,
-    # 254 M-~
-    :ed_unassigned,
-    # 255 M-^?
-    :ed_delete_prev_word
-    # EOF
-  ]
-end
diff --git a/lib/reline/key_actor/vi_command.rb b/lib/reline/key_actor/vi_command.rb
deleted file mode 100644
index d972c5e67f..0000000000
--- a/lib/reline/key_actor/vi_command.rb
+++ /dev/null
@@ -1,518 +0,0 @@
-module Reline::KeyActor
-  VI_COMMAND_MAPPING = [
-    #   0 ^@
-    :ed_unassigned,
-    #   1 ^A
-    :ed_move_to_beg,
-    #   2 ^B
-    :ed_unassigned,
-    #   3 ^C
-    :ed_ignore,
-    #   4 ^D
-    :vi_end_of_transmission,
-    #   5 ^E
-    :ed_move_to_end,
-    #   6 ^F
-    :ed_unassigned,
-    #   7 ^G
-    :ed_unassigned,
-    #   8 ^H
-    :ed_prev_char,
-    #   9 ^I
-    :ed_unassigned,
-    #  10 ^J
-    :ed_newline,
-    #  11 ^K
-    :ed_kill_line,
-    #  12 ^L
-    :ed_clear_screen,
-    #  13 ^M
-    :ed_newline,
-    #  14 ^N
-    :ed_next_history,
-    #  15 ^O
-    :ed_ignore,
-    #  16 ^P
-    :ed_prev_history,
-    #  17 ^Q
-    :ed_ignore,
-    #  18 ^R
-    :vi_search_prev,
-    #  19 ^S
-    :ed_ignore,
-    #  20 ^T
-    :ed_transpose_chars,
-    #  21 ^U
-    :vi_kill_line_prev,
-    #  22 ^V
-    :ed_quoted_insert,
-    #  23 ^W
-    :ed_delete_prev_word,
-    #  24 ^X
-    :ed_unassigned,
-    #  25 ^Y
-    :em_yank,
-    #  26 ^Z
-    :ed_unassigned,
-    #  27 ^[
-    :ed_unassigned,
-    #  28 ^\
-    :ed_ignore,
-    #  29 ^]
-    :ed_unassigned,
-    #  30 ^^
-    :ed_unassigned,
-    #  31 ^_
-    :ed_unassigned,
-    #  32 SPACE
-    :ed_next_char,
-    #  33 !
-    :ed_unassigned,
-    #  34 "
-    :ed_unassigned,
-    #  35 #
-    :vi_comment_out,
-    #  36 $
-    :ed_move_to_end,
-    #  37 %
-    :ed_unassigned,
-    #  38 &
-    :ed_unassigned,
-    #  39 '
-    :ed_unassigned,
-    #  40 (
-    :ed_unassigned,
-    #  41 )
-    :ed_unassigned,
-    #  42 *
-    :ed_unassigned,
-    #  43 +
-    :ed_next_history,
-    #  44 ,
-    :ed_unassigned,
-    #  45 -
-    :ed_prev_history,
-    #  46 .
-    :ed_unassigned,
-    #  47 /
-    :vi_search_prev,
-    #  48 0
-    :vi_zero,
-    #  49 1
-    :ed_argument_digit,
-    #  50 2
-    :ed_argument_digit,
-    #  51 3
-    :ed_argument_digit,
-    #  52 4
-    :ed_argument_digit,
-    #  53 5
-    :ed_argument_digit,
-    #  54 6
-    :ed_argument_digit,
-    #  55 7
-    :ed_argument_digit,
-    #  56 8
-    :ed_argument_digit,
-    #  57 9
-    :ed_argument_digit,
-    #  58 :
-    :ed_unassigned,
-    #  59 ;
-    :ed_unassigned,
-    #  60 <
-    :ed_unassigned,
-    #  61 =
-    :ed_unassigned,
-    #  62 >
-    :ed_unassigned,
-    #  63 ?
-    :vi_search_next,
-    #  64 @
-    :vi_alias,
-    #  65 A
-    :vi_add_at_eol,
-    #  66 B
-    :vi_prev_big_word,
-    #  67 C
-    :vi_change_to_eol,
-    #  68 D
-    :ed_kill_line,
-    #  69 E
-    :vi_end_big_word,
-    #  70 F
-    :vi_prev_char,
-    #  71 G
-    :vi_to_history_line,
-    #  72 H
-    :ed_unassigned,
-    #  73 I
-    :vi_insert_at_bol,
-    #  74 J
-    :vi_join_lines,
-    #  75 K
-    :vi_search_prev,
-    #  76 L
-    :ed_unassigned,
-    #  77 M
-    :ed_unassigned,
-    #  78 N
-    :ed_unassigned,
-    #  79 O
-    :ed_unassigned,
-    #  80 P
-    :vi_paste_prev,
-    #  81 Q
-    :ed_unassigned,
-    #  82 R
-    :ed_unassigned,
-    #  83 S
-    :ed_unassigned,
-    #  84 T
-    :vi_to_prev_char,
-    #  85 U
-    :ed_unassigned,
-    #  86 V
-    :ed_unassigned,
-    #  87 W
-    :vi_next_big_word,
-    #  88 X
-    :ed_delete_prev_char,
-    #  89 Y
-    :ed_unassigned,
-    #  90 Z
-    :ed_unassigned,
-    #  91 [
-    :ed_unassigned,
-    #  92 \
-    :ed_unassigned,
-    #  93 ]
-    :ed_unassigned,
-    #  94 ^
-    :vi_first_print,
-    #  95 _
-    :ed_unassigned,
-    #  96 `
-    :ed_unassigned,
-    #  97 a
-    :vi_add,
-    #  98 b
-    :vi_prev_word,
-    #  99 c
-    :vi_change_meta,
-    # 100 d
-    :vi_delete_meta,
-    # 101 e
-    :vi_end_word,
-    # 102 f
-    :vi_next_char,
-    # 103 g
-    :ed_unassigned,
-    # 104 h
-    :ed_prev_char,
-    # 105 i
-    :vi_insert,
-    # 106 j
-    :ed_next_history,
-    # 107 k
-    :ed_prev_history,
-    # 108 l
-    :ed_next_char,
-    # 109 m
-    :ed_unassigned,
-    # 110 n
-    :ed_unassigned,
-    # 111 o
-    :ed_unassigned,
-    # 112 p
-    :vi_paste_next,
-    # 113 q
-    :ed_unassigned,
-    # 114 r
-    :vi_replace_char,
-    # 115 s
-    :ed_unassigned,
-    # 116 t
-    :vi_to_next_char,
-    # 117 u
-    :ed_unassigned,
-    # 118 v
-    :vi_histedit,
-    # 119 w
-    :vi_next_word,
-    # 120 x
-    :ed_delete_next_char,
-    # 121 y
-    :vi_yank,
-    # 122 z
-    :ed_unassigned,
-    # 123 {
-    :ed_unassigned,
-    # 124 |
-    :vi_to_column,
-    # 125 }
-    :ed_unassigned,
-    # 126 ~
-    :ed_unassigned,
-    # 127 ^?
-    :em_delete_prev_char,
-    # 128 M-^@
-    :ed_unassigned,
-    # 129 M-^A
-    :ed_unassigned,
-    # 130 M-^B
-    :ed_unassigned,
-    # 131 M-^C
-    :ed_unassigned,
-    # 132 M-^D
-    :ed_unassigned,
-    # 133 M-^E
-    :ed_unassigned,
-    # 134 M-^F
-    :ed_unassigned,
-    # 135 M-^G
-    :ed_unassigned,
-    # 136 M-^H
-    :ed_unassigned,
-    # 137 M-^I
-    :ed_unassigned,
-    # 138 M-^J
-    :ed_unassigned,
-    # 139 M-^K
-    :ed_unassigned,
-    # 140 M-^L
-    :ed_unassigned,
-    # 141 M-^M
-    :ed_unassigned,
-    # 142 M-^N
-    :ed_unassigned,
-    # 143 M-^O
-    :ed_unassigned,
-    # 144 M-^P
-    :ed_unassigned,
-    # 145 M-^Q
-    :ed_unassigned,
-    # 146 M-^R
-    :ed_unassigned,
-    # 147 M-^S
-    :ed_unassigned,
-    # 148 M-^T
-    :ed_unassigned,
-    # 149 M-^U
-    :ed_unassigned,
-    # 150 M-^V
-    :ed_unassigned,
-    # 151 M-^W
-    :ed_unassigned,
-    # 152 M-^X
-    :ed_unassigned,
-    # 153 M-^Y
-    :ed_unassigned,
-    # 154 M-^Z
-    :ed_unassigned,
-    # 155 M-^[
-    :ed_unassigned,
-    # 156 M-^\
-    :ed_unassigned,
-    # 157 M-^]
-    :ed_unassigned,
-    # 158 M-^^
-    :ed_unassigned,
-    # 159 M-^_
-    :ed_unassigned,
-    # 160 M-SPACE
-    :ed_unassigned,
-    # 161 M-!
-    :ed_unassigned,
-    # 162 M-"
-    :ed_unassigned,
-    # 163 M-#
-    :ed_unassigned,
-    # 164 M-$
-    :ed_unassigned,
-    # 165 M-%
-    :ed_unassigned,
-    # 166 M-&
-    :ed_unassigned,
-    # 167 M-'
-    :ed_unassigned,
-    # 168 M-(
-    :ed_unassigned,
-    # 169 M-)
-    :ed_unassigned,
-    # 170 M-*
-    :ed_unassigned,
-    # 171 M-+
-    :ed_unassigned,
-    # 172 M-,
-    :ed_unassigned,
-    # 173 M--
-    :ed_unassigned,
-    # 174 M-.
-    :ed_unassigned,
-    # 175 M-/
-    :ed_unassigned,
-    # 176 M-0
-    :ed_unassigned,
-    # 177 M-1
-    :ed_unassigned,
-    # 178 M-2
-    :ed_unassigned,
-    # 179 M-3
-    :ed_unassigned,
-    # 180 M-4
-    :ed_unassigned,
-    # 181 M-5
-    :ed_unassigned,
-    # 182 M-6
-    :ed_unassigned,
-    # 183 M-7
-    :ed_unassigned,
-    # 184 M-8
-    :ed_unassigned,
-    # 185 M-9
-    :ed_unassigned,
-    # 186 M-:
-    :ed_unassigned,
-    # 187 M-;
-    :ed_unassigned,
-    # 188 M-<
-    :ed_unassigned,
-    # 189 M-=
-    :ed_unassigned,
-    # 190 M->
-    :ed_unassigned,
-    # 191 M-?
-    :ed_unassigned,
-    # 192 M-@
-    :ed_unassigned,
-    # 193 M-A
-    :ed_unassigned,
-    # 194 M-B
-    :ed_unassigned,
-    # 195 M-C
-    :ed_unassigned,
-    # 196 M-D
-    :ed_unassigned,
-    # 197 M-E
-    :ed_unassigned,
-    # 198 M-F
-    :ed_unassigned,
-    # 199 M-G
-    :ed_unassigned,
-    # 200 M-H
-    :ed_unassigned,
-    # 201 M-I
-    :ed_unassigned,
-    # 202 M-J
-    :ed_unassigned,
-    # 203 M-K
-    :ed_unassigned,
-    # 204 M-L
-    :ed_unassigned,
-    # 205 M-M
-    :ed_unassigned,
-    # 206 M-N
-    :ed_unassigned,
-    # 207 M-O
-    :ed_unassigned,
-    # 208 M-P
-    :ed_unassigned,
-    # 209 M-Q
-    :ed_unassigned,
-    # 210 M-R
-    :ed_unassigned,
-    # 211 M-S
-    :ed_unassigned,
-    # 212 M-T
-    :ed_unassigned,
-    # 213 M-U
-    :ed_unassigned,
-    # 214 M-V
-    :ed_unassigned,
-    # 215 M-W
-    :ed_unassigned,
-    # 216 M-X
-    :ed_unassigned,
-    # 217 M-Y
-    :ed_unassigned,
-    # 218 M-Z
-    :ed_unassigned,
-    # 219 M-[
-    :ed_unassigned,
-    # 220 M-\
-    :ed_unassigned,
-    # 221 M-]
-    :ed_unassigned,
-    # 222 M-^
-    :ed_unassigned,
-    # 223 M-_
-    :ed_unassigned,
-    # 224 M-`
-    :ed_unassigned,
-    # 225 M-a
-    :ed_unassigned,
-    # 226 M-b
-    :ed_unassigned,
-    # 227 M-c
-    :ed_unassigned,
-    # 228 M-d
-    :ed_unassigned,
-    # 229 M-e
-    :ed_unassigned,
-    # 230 M-f
-    :ed_unassigned,
-    # 231 M-g
-    :ed_unassigned,
-    # 232 M-h
-    :ed_unassigned,
-    # 233 M-i
-    :ed_unassigned,
-    # 234 M-j
-    :ed_unassigned,
-    # 235 M-k
-    :ed_unassigned,
-    # 236 M-l
-    :ed_unassigned,
-    # 237 M-m
-    :ed_unassigned,
-    # 238 M-n
-    :ed_unassigned,
-    # 239 M-o
-    :ed_unassigned,
-    # 240 M-p
-    :ed_unassigned,
-    # 241 M-q
-    :ed_unassigned,
-    # 242 M-r
-    :ed_unassigned,
-    # 243 M-s
-    :ed_unassigned,
-    # 244 M-t
-    :ed_unassigned,
-    # 245 M-u
-    :ed_unassigned,
-    # 246 M-v
-    :ed_unassigned,
-    # 247 M-w
-    :ed_unassigned,
-    # 248 M-x
-    :ed_unassigned,
-    # 249 M-y
-    :ed_unassigned,
-    # 250 M-z
-    :ed_unassigned,
-    # 251 M-{
-    :ed_unassigned,
-    # 252 M-|
-    :ed_unassigned,
-    # 253 M-}
-    :ed_unassigned,
-    # 254 M-~
-    :ed_unassigned,
-    # 255 M-^?
-    :ed_unassigned
-    # EOF
-  ]
-end
-
diff --git a/lib/reline/key_actor/vi_insert.rb b/lib/reline/key_actor/vi_insert.rb
deleted file mode 100644
index 312df1646b..0000000000
--- a/lib/reline/key_actor/vi_insert.rb
+++ /dev/null
@@ -1,517 +0,0 @@
-module Reline::KeyActor
-  VI_INSERT_MAPPING = [
-    #   0 ^@
-    :ed_unassigned,
-    #   1 ^A
-    :ed_insert,
-    #   2 ^B
-    :ed_insert,
-    #   3 ^C
-    :ed_insert,
-    #   4 ^D
-    :vi_list_or_eof,
-    #   5 ^E
-    :ed_insert,
-    #   6 ^F
-    :ed_insert,
-    #   7 ^G
-    :ed_insert,
-    #   8 ^H
-    :vi_delete_prev_char,
-    #   9 ^I
-    :complete,
-    #  10 ^J
-    :ed_newline,
-    #  11 ^K
-    :ed_insert,
-    #  12 ^L
-    :ed_insert,
-    #  13 ^M
-    :ed_newline,
-    #  14 ^N
-    :menu_complete,
-    #  15 ^O
-    :ed_insert,
-    #  16 ^P
-    :menu_complete_backward,
-    #  17 ^Q
-    :ed_ignore,
-    #  18 ^R
-    :vi_search_prev,
-    #  19 ^S
-    :vi_search_next,
-    #  20 ^T
-    :ed_transpose_chars,
-    #  21 ^U
-    :vi_kill_line_prev,
-    #  22 ^V
-    :ed_quoted_insert,
-    #  23 ^W
-    :ed_delete_prev_word,
-    #  24 ^X
-    :ed_insert,
-    #  25 ^Y
-    :em_yank,
-    #  26 ^Z
-    :ed_insert,
-    #  27 ^[
-    :vi_command_mode,
-    #  28 ^\
-    :ed_ignore,
-    #  29 ^]
-    :ed_insert,
-    #  30 ^^
-    :ed_insert,
-    #  31 ^_
-    :ed_insert,
-    #  32 SPACE
-    :ed_insert,
-    #  33 !
-    :ed_insert,
-    #  34 "
-    :ed_insert,
-    #  35 #
-    :ed_insert,
-    #  36 $
-    :ed_insert,
-    #  37 %
-    :ed_insert,
-    #  38 &
-    :ed_insert,
-    #  39 '
-    :ed_insert,
-    #  40 (
-    :ed_insert,
-    #  41 )
-    :ed_insert,
-    #  42 *
-    :ed_insert,
-    #  43 +
-    :ed_insert,
-    #  44 ,
-    :ed_insert,
-    #  45 -
-    :ed_insert,
-    #  46 .
-    :ed_insert,
-    #  47 /
-    :ed_insert,
-    #  48 0
-    :ed_insert,
-    #  49 1
-    :ed_insert,
-    #  50 2
-    :ed_insert,
-    #  51 3
-    :ed_insert,
-    #  52 4
-    :ed_insert,
-    #  53 5
-    :ed_insert,
-    #  54 6
-    :ed_insert,
-    #  55 7
-    :ed_insert,
-    #  56 8
-    :ed_insert,
-    #  57 9
-    :ed_insert,
-    #  58 :
-    :ed_insert,
-    #  59 ;
-    :ed_insert,
-    #  60 <
-    :ed_insert,
-    #  61 =
-    :ed_insert,
-    #  62 >
-    :ed_insert,
-    #  63 ?
-    :ed_insert,
-    #  64 @
-    :ed_insert,
-    #  65 A
-    :ed_insert,
-    #  66 B
-    :ed_insert,
-    #  67 C
-    :ed_insert,
-    #  68 D
-    :ed_insert,
-    #  69 E
-    :ed_insert,
-    #  70 F
-    :ed_insert,
-    #  71 G
-    :ed_insert,
-    #  72 H
-    :ed_insert,
-    #  73 I
-    :ed_insert,
-    #  74 J
-    :ed_insert,
-    #  75 K
-    :ed_insert,
-    #  76 L
-    :ed_insert,
-    #  77 M
-    :ed_insert,
-    #  78 N
-    :ed_insert,
-    #  79 O
-    :ed_insert,
-    #  80 P
-    :ed_insert,
-    #  81 Q
-    :ed_insert,
-    #  82 R
-    :ed_insert,
-    #  83 S
-    :ed_insert,
-    #  84 T
-    :ed_insert,
-    #  85 U
-    :ed_insert,
-    #  86 V
-    :ed_insert,
-    #  87 W
-    :ed_insert,
-    #  88 X
-    :ed_insert,
-    #  89 Y
-    :ed_insert,
-    #  90 Z
-    :ed_insert,
-    #  91 [
-    :ed_insert,
-    #  92 \
-    :ed_insert,
-    #  93 ]
-    :ed_insert,
-    #  94 ^
-    :ed_insert,
-    #  95 _
-    :ed_insert,
-    #  96 `
-    :ed_insert,
-    #  97 a
-    :ed_insert,
-    #  98 b
-    :ed_insert,
-    #  99 c
-    :ed_insert,
-    # 100 d
-    :ed_insert,
-    # 101 e
-    :ed_insert,
-    # 102 f
-    :ed_insert,
-    # 103 g
-    :ed_insert,
-    # 104 h
-    :ed_insert,
-    # 105 i
-    :ed_insert,
-    # 106 j
-    :ed_insert,
-    # 107 k
-    :ed_insert,
-    # 108 l
-    :ed_insert,
-    # 109 m
-    :ed_insert,
-    # 110 n
-    :ed_insert,
-    # 111 o
-    :ed_insert,
-    # 112 p
-    :ed_insert,
-    # 113 q
-    :ed_insert,
-    # 114 r
-    :ed_insert,
-    # 115 s
-    :ed_insert,
-    # 116 t
-    :ed_insert,
-    # 117 u
-    :ed_insert,
-    # 118 v
-    :ed_insert,
-    # 119 w
-    :ed_insert,
-    # 120 x
-    :ed_insert,
-    # 121 y
-    :ed_insert,
-    # 122 z
-    :ed_insert,
-    # 123 {
-    :ed_insert,
-    # 124 |
-    :ed_insert,
-    # 125 }
-    :ed_insert,
-    # 126 ~
-    :ed_insert,
-    # 127 ^?
-    :vi_delete_prev_char,
-    # 128 M-^@
-    :ed_unassigned,
-    # 129 M-^A
-    :ed_unassigned,
-    # 130 M-^B
-    :ed_unassigned,
-    # 131 M-^C
-    :ed_unassigned,
-    # 132 M-^D
-    :ed_unassigned,
-    # 133 M-^E
-    :ed_unassigned,
-    # 134 M-^F
-    :ed_unassigned,
-    # 135 M-^G
-    :ed_unassigned,
-    # 136 M-^H
-    :ed_unassigned,
-    # 137 M-^I
-    :ed_unassigned,
-    # 138 M-^J
-    :key_newline,
-    # 139 M-^K
-    :ed_unassigned,
-    # 140 M-^L
-    :ed_unassigned,
-    # 141 M-^M
-    :key_newline,
-    # 142 M-^N
-    :ed_unassigned,
-    # 143 M-^O
-    :ed_unassigned,
-    # 144 M-^P
-    :ed_unassigned,
-    # 145 M-^Q
-    :ed_unassigned,
-    # 146 M-^R
-    :ed_unassigned,
-    # 147 M-^S
-    :ed_unassigned,
-    # 148 M-^T
-    :ed_unassigned,
-    # 149 M-^U
-    :ed_unassigned,
-    # 150 M-^V
-    :ed_unassigned,
-    # 151 M-^W
-    :ed_unassigned,
-    # 152 M-^X
-    :ed_unassigned,
-    # 153 M-^Y
-    :ed_unassigned,
-    # 154 M-^Z
-    :ed_unassigned,
-    # 155 M-^[
-    :ed_unassigned,
-    # 156 M-^\
-    :ed_unassigned,
-    # 157 M-^]
-    :ed_unassigned,
-    # 158 M-^^
-    :ed_unassigned,
-    # 159 M-^_
-    :ed_unassigned,
-    # 160 M-SPACE
-    :ed_unassigned,
-    # 161 M-!
-    :ed_unassigned,
-    # 162 M-"
-    :ed_unassigned,
-    # 163 M-#
-    :ed_unassigned,
-    # 164 M-$
-    :ed_unassigned,
-    # 165 M-%
-    :ed_unassigned,
-    # 166 M-&
-    :ed_unassigned,
-    # 167 M-'
-    :ed_unassigned,
-    # 168 M-(
-    :ed_unassigned,
-    # 169 M-)
-    :ed_unassigned,
-    # 170 M-*
-    :ed_unassigned,
-    # 171 M-+
-    :ed_unassigned,
-    # 172 M-,
-    :ed_unassigned,
-    # 173 M--
-    :ed_unassigned,
-    # 174 M-.
-    :ed_unassigned,
-    # 175 M-/
-    :ed_unassigned,
-    # 176 M-0
-    :ed_unassigned,
-    # 177 M-1
-    :ed_unassigned,
-    # 178 M-2
-    :ed_unassigned,
-    # 179 M-3
-    :ed_unassigned,
-    # 180 M-4
-    :ed_unassigned,
-    # 181 M-5
-    :ed_unassigned,
-    # 182 M-6
-    :ed_unassigned,
-    # 183 M-7
-    :ed_unassigned,
-    # 184 M-8
-    :ed_unassigned,
-    # 185 M-9
-    :ed_unassigned,
-    # 186 M-:
-    :ed_unassigned,
-    # 187 M-;
-    :ed_unassigned,
-    # 188 M-<
-    :ed_unassigned,
-    # 189 M-=
-    :ed_unassigned,
-    # 190 M->
-    :ed_unassigned,
-    # 191 M-?
-    :ed_unassigned,
-    # 192 M-@
-    :ed_unassigned,
-    # 193 M-A
-    :ed_unassigned,
-    # 194 M-B
-    :ed_unassigned,
-    # 195 M-C
-    :ed_unassigned,
-    # 196 M-D
-    :ed_unassigned,
-    # 197 M-E
-    :ed_unassigned,
-    # 198 M-F
-    :ed_unassigned,
-    # 199 M-G
-    :ed_unassigned,
-    # 200 M-H
-    :ed_unassigned,
-    # 201 M-I
-    :ed_unassigned,
-    # 202 M-J
-    :ed_unassigned,
-    # 203 M-K
-    :ed_unassigned,
-    # 204 M-L
-    :ed_unassigned,
-    # 205 M-M
-    :ed_unassigned,
-    # 206 M-N
-    :ed_unassigned,
-    # 207 M-O
-    :ed_unassigned,
-    # 208 M-P
-    :ed_unassigned,
-    # 209 M-Q
-    :ed_unassigned,
-    # 210 M-R
-    :ed_unassigned,
-    # 211 M-S
-    :ed_unassigned,
-    # 212 M-T
-    :ed_unassigned,
-    # 213 M-U
-    :ed_unassigned,
-    # 214 M-V
-    :ed_unassigned,
-    # 215 M-W
-    :ed_unassigned,
-    # 216 M-X
-    :ed_unassigned,
-    # 217 M-Y
-    :ed_unassigned,
-    # 218 M-Z
-    :ed_unassigned,
-    # 219 M-[
-    :ed_unassigned,
-    # 220 M-\
-    :ed_unassigned,
-    # 221 M-]
-    :ed_unassigned,
-    # 222 M-^
-    :ed_unassigned,
-    # 223 M-_
-    :ed_unassigned,
-    # 224 M-`
-    :ed_unassigned,
-    # 225 M-a
-    :ed_unassigned,
-    # 226 M-b
-    :ed_unassigned,
-    # 227 M-c
-    :ed_unassigned,
-    # 228 M-d
-    :ed_unassigned,
-    # 229 M-e
-    :ed_unassigned,
-    # 230 M-f
-    :ed_unassigned,
-    # 231 M-g
-    :ed_unassigned,
-    # 232 M-h
-    :ed_unassigned,
-    # 233 M-i
-    :ed_unassigned,
-    # 234 M-j
-    :ed_unassigned,
-    # 235 M-k
-    :ed_unassigned,
-    # 236 M-l
-    :ed_unassigned,
-    # 237 M-m
-    :ed_unassigned,
-    # 238 M-n
-    :ed_unassigned,
-    # 239 M-o
-    :ed_unassigned,
-    # 240 M-p
-    :ed_unassigned,
-    # 241 M-q
-    :ed_unassigned,
-    # 242 M-r
-    :ed_unassigned,
-    # 243 M-s
-    :ed_unassigned,
-    # 244 M-t
-    :ed_unassigned,
-    # 245 M-u
-    :ed_unassigned,
-    # 246 M-v
-    :ed_unassigned,
-    # 247 M-w
-    :ed_unassigned,
-    # 248 M-x
-    :ed_unassigned,
-    # 249 M-y
-    :ed_unassigned,
-    # 250 M-z
-    :ed_unassigned,
-    # 251 M-{
-    :ed_unassigned,
-    # 252 M-|
-    :ed_unassigned,
-    # 253 M-}
-    :ed_unassigned,
-    # 254 M-~
-    :ed_unassigned,
-    # 255 M-^?
-    :ed_unassigned
-    # EOF
-  ]
-end
diff --git a/lib/reline/key_stroke.rb b/lib/reline/key_stroke.rb
deleted file mode 100644
index 419ddd8cea..0000000000
--- a/lib/reline/key_stroke.rb
+++ /dev/null
@@ -1,78 +0,0 @@
-class Reline::KeyStroke
-  ESC_BYTE = 27
-  CSI_PARAMETER_BYTES_RANGE = 0x30..0x3f
-  CSI_INTERMEDIATE_BYTES_RANGE = (0x20..0x2f)
-
-  def initialize(config)
-    @config = config
-  end
-
-  def match_status(input)
-    if key_mapping.matching?(input)
-      :matching
-    elsif key_mapping.get(input)
-      :matched
-    elsif input[0] == ESC_BYTE
-      match_unknown_escape_sequence(input, vi_mode: @config.editing_mode_is?(:vi_insert, :vi_command))
-    elsif input.size == 1
-      :matched
-    else
-      :unmatched
-    end
-  end
-
-  def expand(input)
-    matched_bytes = nil
-    (1..input.size).each do |i|
-      bytes = input.take(i)
-      matched_bytes = bytes if match_status(bytes) != :unmatched
-    end
-    return [[], []] unless matched_bytes
-
-    func = key_mapping.get(matched_bytes)
-    if func.is_a?(Array)
-      keys = func.map { |c| Reline::Key.new(c, c, false) }
-    elsif func
-      keys = [Reline::Key.new(func, func, false)]
-    elsif matched_bytes.size == 1
-      keys = [Reline::Key.new(matched_bytes.first, matched_bytes.first, false)]
-    elsif matched_bytes.size == 2 && matched_bytes[0] == ESC_BYTE
-      keys = [Reline::Key.new(matched_bytes[1], matched_bytes[1] | 0b10000000, true)]
-    else
-      keys = []
-    end
-
-    [keys, input.drop(matched_bytes.size)]
-  end
-
-  private
-
-  # returns match status of CSI/SS3 sequence and matched length
-  def match_unknown_escape_sequence(input, vi_mode: false)
-    idx = 0
-    return :unmatched unless input[idx] == ESC_BYTE
-    idx += 1
-    idx += 1 if input[idx] == ESC_BYTE
-
-    case input[idx]
-    when nil
-      return :matching
-    when 91 # == '['.ord
-      # CSI sequence `ESC [ ... char`
-      idx += 1
-      idx += 1 while idx < input.size && CSI_PARAMETER_BYTES_RANGE.cover?(input[idx])
-      idx += 1 while idx < input.size && CSI_INTERMEDIATE_BYTES_RANGE.cover?(input[idx])
-    when 79 # == 'O'.ord
-      # SS3 sequence `ESC O char`
-      idx += 1
-    else
-      # `ESC char` or `ESC ESC char`
-      return :unmatched if vi_mode
-    end
-    input[idx + 1] ? :unmatched : input[idx] ? :matched : :matching
-  end
-
-  def key_mapping
-    @config.key_bindings
-  end
-end
diff --git a/lib/reline/kill_ring.rb b/lib/reline/kill_ring.rb
deleted file mode 100644
index 201f6f3ca0..0000000000
--- a/lib/reline/kill_ring.rb
+++ /dev/null
@@ -1,125 +0,0 @@
-class Reline::KillRing
-  include Enumerable
-
-  module State
-    FRESH = :fresh
-    CONTINUED = :continued
-    PROCESSED = :processed
-    YANK = :yank
-  end
-
-  RingPoint = Struct.new(:backward, :forward, :str) do
-    def initialize(str)
-      super(nil, nil, str)
-    end
-
-    def ==(other)
-      equal?(other)
-    end
-  end
-
-  class RingBuffer
-    attr_reader :size
-    attr_reader :head
-
-    def initialize(max = 1024)
-      @max = max
-      @size = 0
-      @head = nil # reading head of ring-shaped tape
-    end
-
-    def <<(point)
-      if @size.zero?
-        @head = point
-        @head.backward = @head
-        @head.forward = @head
-        @size = 1
-      elsif @size >= @max
-        tail = @head.forward
-        new_tail = tail.forward
-        @head.forward = point
-        point.backward = @head
-        new_tail.backward = point
-        point.forward = new_tail
-        @head = point
-      else
-        tail = @head.forward
-        @head.forward = point
-        point.backward = @head
-        tail.backward = point
-        point.forward = tail
-        @head = point
-        @size += 1
-      end
-    end
-
-    def empty?
-      @size.zero?
-    end
-  end
-
-  def initialize(max = 1024)
-    @ring = RingBuffer.new(max)
-    @ring_pointer = nil
-    @buffer = nil
-    @state = State::FRESH
-  end
-
-  def append(string, before_p = false)
-    case @state
-    when State::FRESH, State::YANK
-      @ring << RingPoint.new(+string)
-      @state = State::CONTINUED
-    when State::CONTINUED, State::PROCESSED
-      if before_p
-        @ring.head.str.prepend(string)
-      else
-        @ring.head.str.concat(string)
-      end
-      @state = State::CONTINUED
-    end
-  end
-
-  def process
-    case @state
-    when State::FRESH
-      # nothing to do
-    when State::CONTINUED
-      @state = State::PROCESSED
-    when State::PROCESSED
-      @state = State::FRESH
-    when State::YANK
-      # nothing to do
-    end
-  end
-
-  def yank
-    unless @ring.empty?
-      @state = State::YANK
-      @ring_pointer = @ring.head
-      @ring_pointer.str
-    else
-      nil
-    end
-  end
-
-  def yank_pop
-    if @state == State::YANK
-      prev_yank = @ring_pointer.str
-      @ring_pointer = @ring_pointer.backward
-      [@ring_pointer.str, prev_yank]
-    else
-      nil
-    end
-  end
-
-  def each
-    start = head = @ring.head
-    loop do
-      break if head.nil?
-      yield head.str
-      head = head.backward
-      break if head == start
-    end
-  end
-end
diff --git a/lib/reline/line_editor.rb b/lib/reline/line_editor.rb
deleted file mode 100644
index faa5b0194e..0000000000
--- a/lib/reline/line_editor.rb
+++ /dev/null
@@ -1,2568 +0,0 @@
-require 'reline/kill_ring'
-require 'reline/unicode'
-
-require 'tempfile'
-
-class Reline::LineEditor
-  # TODO: Use "private alias_method" idiom after drop Ruby 2.5.
-  attr_reader :byte_pointer
-  attr_accessor :confirm_multiline_termination_proc
-  attr_accessor :completion_proc
-  attr_accessor :completion_append_character
-  attr_accessor :output_modifier_proc
-  attr_accessor :prompt_proc
-  attr_accessor :auto_indent_proc
-  attr_accessor :dig_perfect_match_proc
-  attr_writer :output
-
-  VI_MOTIONS = %i{
-    ed_prev_char
-    ed_next_char
-    vi_zero
-    ed_move_to_beg
-    ed_move_to_end
-    vi_to_column
-    vi_next_char
-    vi_prev_char
-    vi_next_word
-    vi_prev_word
-    vi_to_next_char
-    vi_to_prev_char
-    vi_end_word
-    vi_next_big_word
-    vi_prev_big_word
-    vi_end_big_word
-  }
-
-  module CompletionState
-    NORMAL = :normal
-    COMPLETION = :completion
-    MENU = :menu
-    MENU_WITH_PERFECT_MATCH = :menu_with_perfect_match
-    PERFECT_MATCH = :perfect_match
-  end
-
-  RenderedScreen = Struct.new(:base_y, :lines, :cursor_y, keyword_init: true)
-
-  CompletionJourneyState = Struct.new(:line_index, :pre, :target, :post, :list, :pointer)
-  NullActionState = [nil, nil].freeze
-
-  class MenuInfo
-    attr_reader :list
-
-    def initialize(list)
-      @list = list
-    end
-
-    def lines(screen_width)
-      return [] if @list.empty?
-
-      list = @list.sort
-      sizes = list.map { |item| Reline::Unicode.calculate_width(item) }
-      item_width = sizes.max + 2
-      num_cols = [screen_width / item_width, 1].max
-      num_rows = list.size.fdiv(num_cols).ceil
-      list_with_padding = list.zip(sizes).map { |item, size| item + ' ' * (item_width - size) }
-      aligned = (list_with_padding + [nil] * (num_rows * num_cols - list_with_padding.size)).each_slice(num_rows).to_a.transpose
-      aligned.map do |row|
-        row.join.rstrip
-      end
-    end
-  end
-
-  MINIMUM_SCROLLBAR_HEIGHT = 1
-
-  def initialize(config, encoding)
-    @config = config
-    @completion_append_character = ''
-    @screen_size = [0, 0] # Should be initialized with actual winsize in LineEditor#reset
-    reset_variables(encoding: encoding)
-  end
-
-  def io_gate
-    Reline::IOGate
-  end
-
-  def set_pasting_state(in_pasting)
-    # While pasting, text to be inserted is stored to @continuous_insertion_buffer.
-    # After pasting, this buffer should be force inserted.
-    process_insert(force: true) if @in_pasting && !in_pasting
-    @in_pasting = in_pasting
-  end
-
-  private def check_mode_string
-    if @config.show_mode_in_prompt
-      if @config.editing_mode_is?(:vi_command)
-        @config.vi_cmd_mode_string
-      elsif @config.editing_mode_is?(:vi_insert)
-        @config.vi_ins_mode_string
-      elsif @config.editing_mode_is?(:emacs)
-        @config.emacs_mode_string
-      else
-        '?'
-      end
-    end
-  end
-
-  private def check_multiline_prompt(buffer, mode_string)
-    if @vi_arg
-      prompt = "(arg: #{@vi_arg}) "
-    elsif @searching_prompt
-      prompt = @searching_prompt
-    else
-      prompt = @prompt
-    end
-    if !@is_multiline
-      mode_string = check_mode_string
-      prompt = mode_string + prompt if mode_string
-      [prompt] + [''] * (buffer.size - 1)
-    elsif @prompt_proc
-      prompt_list = @prompt_proc.(buffer).map { |pr| pr.gsub("\n", "\\n") }
-      prompt_list.map!{ prompt } if @vi_arg or @searching_prompt
-      prompt_list = [prompt] if prompt_list.empty?
-      prompt_list = prompt_list.map{ |pr| mode_string + pr } if mode_string
-      prompt = prompt_list[@line_index]
-      prompt = prompt_list[0] if prompt.nil?
-      prompt = prompt_list.last if prompt.nil?
-      if buffer.size > prompt_list.size
-        (buffer.size - prompt_list.size).times do
-          prompt_list << prompt_list.last
-        end
-      end
-      prompt_list
-    else
-      prompt = mode_string + prompt if mode_string
-      [prompt] * buffer.size
-    end
-  end
-
-  def reset(prompt = '', encoding:)
-    @screen_size = Reline::IOGate.get_screen_size
-    reset_variables(prompt, encoding: encoding)
-    @rendered_screen.base_y = Reline::IOGate.cursor_pos.y
-    if ENV.key?('RELINE_ALT_SCROLLBAR')
-      @full_block = '::'
-      @upper_half_block = "''"
-      @lower_half_block = '..'
-      @block_elem_width = 2
-    elsif Reline::IOGate.win?
-      @full_block = '█'
-      @upper_half_block = '▀'
-      @lower_half_block = '▄'
-      @block_elem_width = 1
-    elsif @encoding == Encoding::UTF_8
-      @full_block = '█'
-      @upper_half_block = '▀'
-      @lower_half_block = '▄'
-      @block_elem_width = Reline::Unicode.calculate_width('█')
-    else
-      @full_block = '::'
-      @upper_half_block = "''"
-      @lower_half_block = '..'
-      @block_elem_width = 2
-    end
-  end
-
-  def handle_signal
-    handle_interrupted
-    handle_resized
-  end
-
-  private def handle_resized
-    return unless @resized
-
-    @screen_size = Reline::IOGate.get_screen_size
-    @resized = false
-    scroll_into_view
-    Reline::IOGate.move_cursor_up @rendered_screen.cursor_y
-    @rendered_screen.base_y = Reline::IOGate.cursor_pos.y
-    @rendered_screen.lines = []
-    @rendered_screen.cursor_y = 0
-    render_differential
-  end
-
-  private def handle_interrupted
-    return unless @interrupted
-
-    @interrupted = false
-    clear_dialogs
-    scrolldown = render_differential
-    Reline::IOGate.scroll_down scrolldown
-    Reline::IOGate.move_cursor_column 0
-    @rendered_screen.lines = []
-    @rendered_screen.cursor_y = 0
-    case @old_trap
-    when 'DEFAULT', 'SYSTEM_DEFAULT'
-      raise Interrupt
-    when 'IGNORE'
-      # Do nothing
-    when 'EXIT'
-      exit
-    else
-      @old_trap.call if @old_trap.respond_to?(:call)
-    end
-  end
-
-  def set_signal_handlers
-    Reline::IOGate.set_winch_handler do
-      @resized = true
-    end
-    @old_trap = Signal.trap('INT') do
-      @interrupted = true
-    end
-  end
-
-  def finalize
-    Signal.trap('INT', @old_trap)
-  end
-
-  def eof?
-    @eof
-  end
-
-  def reset_variables(prompt = '', encoding:)
-    @prompt = prompt.gsub("\n", "\\n")
-    @mark_pointer = nil
-    @encoding = encoding
-    @is_multiline = false
-    @finished = false
-    @history_pointer = nil
-    @kill_ring ||= Reline::KillRing.new
-    @vi_clipboard = ''
-    @vi_arg = nil
-    @waiting_proc = nil
-    @vi_waiting_operator = nil
-    @vi_waiting_operator_arg = nil
-    @completion_journey_state = nil
-    @completion_state = CompletionState::NORMAL
-    @perfect_matched = nil
-    @menu_info = nil
-    @searching_prompt = nil
-    @first_char = true
-    @just_cursor_moving = false
-    @eof = false
-    @continuous_insertion_buffer = String.new(encoding: @encoding)
-    @scroll_partial_screen = 0
-    @drop_terminate_spaces = false
-    @in_pasting = false
-    @auto_indent_proc = nil
-    @dialogs = []
-    @interrupted = false
-    @resized = false
-    @cache = {}
-    @rendered_screen = RenderedScreen.new(base_y: 0, lines: [], cursor_y: 0)
-    @input_lines = [[[""], 0, 0]]
-    @input_lines_position = 0
-    @undoing = false
-    @prev_action_state = NullActionState
-    @next_action_state = NullActionState
-    reset_line
-  end
-
-  def reset_line
-    @byte_pointer = 0
-    @buffer_of_lines = [String.new(encoding: @encoding)]
-    @line_index = 0
-    @cache.clear
-    @line_backup_in_history = nil
-    @multibyte_buffer = String.new(encoding: 'ASCII-8BIT')
-  end
-
-  def multiline_on
-    @is_multiline = true
-  end
-
-  def multiline_off
-    @is_multiline = false
-  end
-
-  private def insert_new_line(cursor_line, next_line)
-    @buffer_of_lines.insert(@line_index + 1, String.new(next_line, encoding: @encoding))
-    @buffer_of_lines[@line_index] = cursor_line
-    @line_index += 1
-    @byte_pointer = 0
-    if @auto_indent_proc && !@in_pasting
-      if next_line.empty?
-        (
-          # For compatibility, use this calculation instead of just `process_auto_indent @line_index - 1, cursor_dependent: false`
-          indent1 = @auto_indent_proc.(@buffer_of_lines.take(@line_index - 1).push(''), @line_index - 1, 0, true)
-          indent2 = @auto_indent_proc.(@buffer_of_lines.take(@line_index), @line_index - 1, @buffer_of_lines[@line_index - 1].bytesize, false)
-          indent = indent2 || indent1
-          @buffer_of_lines[@line_index - 1] = ' ' * indent + @buffer_of_lines[@line_index - 1].gsub(/\A\s*/, '')
-        )
-        process_auto_indent @line_index, add_newline: true
-      else
-        process_auto_indent @line_index - 1, cursor_dependent: false
-        process_auto_indent @line_index, add_newline: true # Need for compatibility
-        process_auto_indent @line_index, cursor_dependent: false
-      end
-    end
-  end
-
-  private def split_by_width(str, max_width, offset: 0)
-    Reline::Unicode.split_by_width(str, max_width, @encoding, offset: offset)
-  end
-
-  def current_byte_pointer_cursor
-    calculate_width(current_line.byteslice(0, @byte_pointer))
-  end
-
-  private def calculate_nearest_cursor(cursor)
-    line_to_calc = current_line
-    new_cursor_max = calculate_width(line_to_calc)
-    new_cursor = 0
-    new_byte_pointer = 0
-    height = 1
-    max_width = screen_width
-    if @config.editing_mode_is?(:vi_command)
-      last_byte_size = Reline::Unicode.get_prev_mbchar_size(line_to_calc, line_to_calc.bytesize)
-      if last_byte_size > 0
-        last_mbchar = line_to_calc.byteslice(line_to_calc.bytesize - last_byte_size, last_byte_size)
-        last_width = Reline::Unicode.get_mbchar_width(last_mbchar)
-        end_of_line_cursor = new_cursor_max - last_width
-      else
-      end_of_line_cursor = new_cursor_max
-      end
-    else
-    end_of_line_cursor = new_cursor_max
-    end
-    line_to_calc.grapheme_clusters.each do |gc|
-      mbchar = gc.encode(Encoding::UTF_8)
-      mbchar_width = Reline::Unicode.get_mbchar_width(mbchar)
-      now = new_cursor + mbchar_width
-      if now > end_of_line_cursor or now > cursor
-        break
-      end
-      new_cursor += mbchar_width
-      if new_cursor > max_width * height
-        height += 1
-      end
-      new_byte_pointer += gc.bytesize
-    end
-    @byte_pointer = new_byte_pointer
-  end
-
-  def with_cache(key, *deps)
-    cached_deps, value = @cache[key]
-    if cached_deps != deps
-      @cache[key] = [deps, value = yield(*deps, cached_deps, value)]
-    end
-    value
-  end
-
-  def modified_lines
-    with_cache(__method__, whole_lines, finished?) do |whole, complete|
-      modify_lines(whole, complete)
-    end
-  end
-
-  def prompt_list
-    with_cache(__method__, whole_lines, check_mode_string, @vi_arg, @searching_prompt) do |lines, mode_string|
-      check_multiline_prompt(lines, mode_string)
-    end
-  end
-
-  def screen_height
-    @screen_size.first
-  end
-
-  def screen_width
-    @screen_size.last
-  end
-
-  def screen_scroll_top
-    @scroll_partial_screen
-  end
-
-  def wrapped_prompt_and_input_lines
-    with_cache(__method__, @buffer_of_lines.size, modified_lines, prompt_list, screen_width) do |n, lines, prompts, width, prev_cache_key, cached_value|
-      prev_n, prev_lines, prev_prompts, prev_width = prev_cache_key
-      cached_wraps = {}
-      if prev_width == width
-        prev_n.times do |i|
-          cached_wraps[[prev_prompts[i], prev_lines[i]]] = cached_value[i]
-        end
-      end
-
-      n.times.map do |i|
-        prompt = prompts[i] || ''
-        line = lines[i] || ''
-        if (cached = cached_wraps[[prompt, line]])
-          next cached
-        end
-        *wrapped_prompts, code_line_prompt = split_by_width(prompt, width).first.compact
-        wrapped_lines = split_by_width(line, width, offset: calculate_width(code_line_prompt, true)).first.compact
-        wrapped_prompts.map { |p| [p, ''] } + [[code_line_prompt, wrapped_lines.first]] + wrapped_lines.drop(1).map { |c| ['', c] }
-      end
-    end
-  end
-
-  def calculate_overlay_levels(overlay_levels)
-    levels = []
-    overlay_levels.each do |x, w, l|
-      levels.fill(l, x, w)
-    end
-    levels
-  end
-
-  def render_line_differential(old_items, new_items)
-    old_levels = calculate_overlay_levels(old_items.zip(new_items).each_with_index.map {|((x, w, c), (nx, _nw, nc)), i| [x, w, c == nc && x == nx ? i : -1] if x }.compact)
-    new_levels = calculate_overlay_levels(new_items.each_with_index.map { |(x, w), i| [x, w, i] if x }.compact).take(screen_width)
-    base_x = 0
-    new_levels.zip(old_levels).chunk { |n, o| n == o ? :skip : n || :blank }.each do |level, chunk|
-      width = chunk.size
-      if level == :skip
-        # do nothing
-      elsif level == :blank
-        Reline::IOGate.move_cursor_column base_x
-        @output.write "#{Reline::IOGate.reset_color_sequence}#{' ' * width}"
-      else
-        x, w, content = new_items[level]
-        cover_begin = base_x != 0 && new_levels[base_x - 1] == level
-        cover_end = new_levels[base_x + width] == level
-        pos = 0
-        unless x == base_x && w == width
-          content, pos = Reline::Unicode.take_mbchar_range(content, base_x - x, width, cover_begin: cover_begin, cover_end: cover_end, padding: true)
-        end
-        Reline::IOGate.move_cursor_column x + pos
-        @output.write "#{Reline::IOGate.reset_color_sequence}#{content}#{Reline::IOGate.reset_color_sequence}"
-      end
-      base_x += width
-    end
-    if old_levels.size > new_levels.size
-      Reline::IOGate.move_cursor_column new_levels.size
-      Reline::IOGate.erase_after_cursor
-    end
-  end
-
-  # Calculate cursor position in word wrapped content.
-  def wrapped_cursor_position
-    prompt_width = calculate_width(prompt_list[@line_index], true)
-    line_before_cursor = whole_lines[@line_index].byteslice(0, @byte_pointer)
-    wrapped_line_before_cursor = split_by_width(' ' * prompt_width + line_before_cursor, screen_width).first.compact
-    wrapped_cursor_y = wrapped_prompt_and_input_lines[0...@line_index].sum(&:size) + wrapped_line_before_cursor.size - 1
-    wrapped_cursor_x = calculate_width(wrapped_line_before_cursor.last)
-    [wrapped_cursor_x, wrapped_cursor_y]
-  end
-
-  def clear_dialogs
-    @dialogs.each do |dialog|
-      dialog.contents = nil
-      dialog.trap_key = nil
-    end
-  end
-
-  def update_dialogs(key = nil)
-    wrapped_cursor_x, wrapped_cursor_y = wrapped_cursor_position
-    @dialogs.each do |dialog|
-      dialog.trap_key = nil
-      update_each_dialog(dialog, wrapped_cursor_x, wrapped_cursor_y - screen_scroll_top, key)
-    end
-  end
-
-  def render_finished
-    clear_rendered_lines
-    render_full_content
-  end
-
-  def clear_rendered_lines
-    Reline::IOGate.move_cursor_up @rendered_screen.cursor_y
-    Reline::IOGate.move_cursor_column 0
-
-    num_lines = @rendered_screen.lines.size
-    return unless num_lines && num_lines >= 1
-
-    Reline::IOGate.move_cursor_down num_lines - 1
-    (num_lines - 1).times do
-      Reline::IOGate.erase_after_cursor
-      Reline::IOGate.move_cursor_up 1
-    end
-    Reline::IOGate.erase_after_cursor
-    @rendered_screen.lines = []
-    @rendered_screen.cursor_y = 0
-  end
-
-  def render_full_content
-    lines = @buffer_of_lines.size.times.map do |i|
-      line = prompt_list[i] + modified_lines[i]
-      wrapped_lines, = split_by_width(line, screen_width)
-      wrapped_lines.last.empty? ? "#{line} " : line
-    end
-    @output.puts lines.map { |l| "#{l}\r\n" }.join
-  end
-
-  def print_nomultiline_prompt(prompt)
-    return unless prompt && !@is_multiline
-
-    # Readline's test `TestRelineAsReadline#test_readline` requires first output to be prompt, not cursor reset escape sequence.
-    @rendered_screen.lines = [[[0, Reline::Unicode.calculate_width(prompt, true), prompt]]]
-    @rendered_screen.cursor_y = 0
-    @output.write prompt
-  end
-
-  def render_differential
-    wrapped_cursor_x, wrapped_cursor_y = wrapped_cursor_position
-
-    rendered_lines = @rendered_screen.lines
-    new_lines = wrapped_prompt_and_input_lines.flatten(1)[screen_scroll_top, screen_height].map do |prompt, line|
-      prompt_width = Reline::Unicode.calculate_width(prompt, true)
-      [[0, prompt_width, prompt], [prompt_width, Reline::Unicode.calculate_width(line, true), line]]
-    end
-    if @menu_info
-      @menu_info.lines(screen_width).each do |item|
-        new_lines << [[0, Reline::Unicode.calculate_width(item), item]]
-      end
-      @menu_info = nil # TODO: do not change state here
-    end
-
-    @dialogs.each_with_index do |dialog, index|
-      next unless dialog.contents
-
-      x_range, y_range = dialog_range dialog, wrapped_cursor_y - screen_scroll_top
-      y_range.each do |row|
-        next if row < 0 || row >= screen_height
-        dialog_rows = new_lines[row] ||= []
-        # index 0 is for prompt, index 1 is for line, index 2.. is for dialog
-        dialog_rows[index + 2] = [x_range.begin, dialog.width, dialog.contents[row - y_range.begin]]
-      end
-    end
-
-    cursor_y = @rendered_screen.cursor_y
-    if new_lines != rendered_lines
-      # Hide cursor while rendering to avoid cursor flickering.
-      Reline::IOGate.hide_cursor
-      num_lines = [[new_lines.size, rendered_lines.size].max, screen_height].min
-      if @rendered_screen.base_y + num_lines > screen_height
-        Reline::IOGate.scroll_down(num_lines - cursor_y - 1)
-        @rendered_screen.base_y = screen_height - num_lines
-        cursor_y = num_lines - 1
-      end
-      num_lines.times do |i|
-        rendered_line = rendered_lines[i] || []
-        line_to_render = new_lines[i] || []
-        next if rendered_line == line_to_render
-
-        Reline::IOGate.move_cursor_down i - cursor_y
-        cursor_y = i
-        unless rendered_lines[i]
-          Reline::IOGate.move_cursor_column 0
-          Reline::IOGate.erase_after_cursor
-        end
-        render_line_differential(rendered_line, line_to_render)
-      end
-      @rendered_screen.lines = new_lines
-      Reline::IOGate.show_cursor
-    end
-    y = wrapped_cursor_y - screen_scroll_top
-    Reline::IOGate.move_cursor_column wrapped_cursor_x
-    Reline::IOGate.move_cursor_down y - cursor_y
-    @rendered_screen.cursor_y = y
-    new_lines.size - y
-  end
-
-  def upper_space_height(wrapped_cursor_y)
-    wrapped_cursor_y - screen_scroll_top
-  end
-
-  def rest_height(wrapped_cursor_y)
-    screen_height - wrapped_cursor_y + screen_scroll_top - @rendered_screen.base_y - 1
-  end
-
-  def rerender
-    render_differential unless @in_pasting
-  end
-
-  class DialogProcScope
-    CompletionJourneyData = Struct.new(:preposing, :postposing, :list, :pointer)
-
-    def initialize(line_editor, config, proc_to_exec, context)
-      @line_editor = line_editor
-      @config = config
-      @proc_to_exec = proc_to_exec
-      @context = context
-      @cursor_pos = Reline::CursorPos.new
-    end
-
-    def context
-      @context
-    end
-
-    def retrieve_completion_block(set_completion_quote_character = false)
-      @line_editor.retrieve_completion_block(set_completion_quote_character)
-    end
-
-    def call_completion_proc_with_checking_args(pre, target, post)
-      @line_editor.call_completion_proc_with_checking_args(pre, target, post)
-    end
-
-    def set_dialog(dialog)
-      @dialog = dialog
-    end
-
-    def dialog
-      @dialog
-    end
-
-    def set_cursor_pos(col, row)
-      @cursor_pos.x = col
-      @cursor_pos.y = row
-    end
-
-    def set_key(key)
-      @key = key
-    end
-
-    def key
-      @key
-    end
-
-    def cursor_pos
-      @cursor_pos
-    end
-
-    def just_cursor_moving
-      @line_editor.instance_variable_get(:@just_cursor_moving)
-    end
-
-    def screen_width
-      @line_editor.screen_width
-    end
-
-    def screen_height
-      @line_editor.screen_height
-    end
-
-    def preferred_dialog_height
-      _wrapped_cursor_x, wrapped_cursor_y = @line_editor.wrapped_cursor_position
-      [@line_editor.upper_space_height(wrapped_cursor_y), @line_editor.rest_height(wrapped_cursor_y), (screen_height + 6) / 5].max
-    end
-
-    def completion_journey_data
-      @line_editor.dialog_proc_scope_completion_journey_data
-    end
-
-    def config
-      @config
-    end
-
-    def call
-      instance_exec(&@proc_to_exec)
-    end
-  end
-
-  class Dialog
-    attr_reader :name, :contents, :width
-    attr_accessor :scroll_top, :pointer, :column, :vertical_offset, :trap_key
-
-    def initialize(name, config, proc_scope)
-      @name = name
-      @config = config
-      @proc_scope = proc_scope
-      @width = nil
-      @scroll_top = 0
-      @trap_key = nil
-    end
-
-    def set_cursor_pos(col, row)
-      @proc_scope.set_cursor_pos(col, row)
-    end
-
-    def width=(v)
-      @width = v
-    end
-
-    def contents=(contents)
-      @contents = contents
-      if contents and @width.nil?
-        @width = contents.map{ |line| Reline::Unicode.calculate_width(line, true) }.max
-      end
-    end
-
-    def call(key)
-      @proc_scope.set_dialog(self)
-      @proc_scope.set_key(key)
-      dialog_render_info = @proc_scope.call
-      if @trap_key
-        if @trap_key.any?{ |i| i.is_a?(Array) } # multiple trap
-          @trap_key.each do |t|
-            @config.add_oneshot_key_binding(t, @name)
-          end
-        else
-          @config.add_oneshot_key_binding(@trap_key, @name)
-        end
-      end
-      dialog_render_info
-    end
-  end
-
-  def add_dialog_proc(name, p, context = nil)
-    dialog = Dialog.new(name, @config, DialogProcScope.new(self, @config, p, context))
-    if index = @dialogs.find_index { |d| d.name == name }
-      @dialogs[index] = dialog
-    else
-      @dialogs << dialog
-    end
-  end
-
-  DIALOG_DEFAULT_HEIGHT = 20
-
-  private def dialog_range(dialog, dialog_y)
-    x_range = dialog.column...dialog.column + dialog.width
-    y_range = dialog_y + dialog.vertical_offset...dialog_y + dialog.vertical_offset + dialog.contents.size
-    [x_range, y_range]
-  end
-
-  private def update_each_dialog(dialog, cursor_column, cursor_row, key = nil)
-    dialog.set_cursor_pos(cursor_column, cursor_row)
-    dialog_render_info = dialog.call(key)
-    if dialog_render_info.nil? or dialog_render_info.contents.nil? or dialog_render_info.contents.empty?
-      dialog.contents = nil
-      dialog.trap_key = nil
-      return
-    end
-    contents = dialog_render_info.contents
-    pointer = dialog.pointer
-    if dialog_render_info.width
-      dialog.width = dialog_render_info.width
-    else
-      dialog.width = contents.map { |l| calculate_width(l, true) }.max
-    end
-    height = dialog_render_info.height || DIALOG_DEFAULT_HEIGHT
-    height = contents.size if contents.size < height
-    if contents.size > height
-      if dialog.pointer
-        if dialog.pointer < 0
-          dialog.scroll_top = 0
-        elsif (dialog.pointer - dialog.scroll_top) >= (height - 1)
-          dialog.scroll_top = dialog.pointer - (height - 1)
-        elsif (dialog.pointer - dialog.scroll_top) < 0
-          dialog.scroll_top = dialog.pointer
-        end
-        pointer = dialog.pointer - dialog.scroll_top
-      else
-        dialog.scroll_top = 0
-      end
-      contents = contents[dialog.scroll_top, height]
-    end
-    if dialog_render_info.scrollbar and dialog_render_info.contents.size > height
-      bar_max_height = height * 2
-      moving_distance = (dialog_render_info.contents.size - height) * 2
-      position_ratio = dialog.scroll_top.zero? ? 0.0 : ((dialog.scroll_top * 2).to_f / moving_distance)
-      bar_height = (bar_max_height * ((contents.size * 2).to_f / (dialog_render_info.contents.size * 2))).floor.to_i
-      bar_height = MINIMUM_SCROLLBAR_HEIGHT if bar_height < MINIMUM_SCROLLBAR_HEIGHT
-      scrollbar_pos = ((bar_max_height - bar_height) * position_ratio).floor.to_i
-    else
-      scrollbar_pos = nil
-    end
-    dialog.column = dialog_render_info.pos.x
-    dialog.width += @block_elem_width if scrollbar_pos
-    diff = (dialog.column + dialog.width) - screen_width
-    if diff > 0
-      dialog.column -= diff
-    end
-    if rest_height(screen_scroll_top + cursor_row) - dialog_render_info.pos.y >= height
-      dialog.vertical_offset = dialog_render_info.pos.y + 1
-    elsif cursor_row >= height
-      dialog.vertical_offset = dialog_render_info.pos.y - height
-    else
-      dialog.vertical_offset = dialog_render_info.pos.y + 1
-    end
-    if dialog.column < 0
-      dialog.column = 0
-      dialog.width = screen_width
-    end
-    face = Reline::Face[dialog_render_info.face || :default]
-    scrollbar_sgr = face[:scrollbar]
-    default_sgr = face[:default]
-    enhanced_sgr = face[:enhanced]
-    dialog.contents = contents.map.with_index do |item, i|
-      line_sgr = i == pointer ? enhanced_sgr : default_sgr
-      str_width = dialog.width - (scrollbar_pos.nil? ? 0 : @block_elem_width)
-      str, = Reline::Unicode.take_mbchar_range(item, 0, str_width, padding: true)
-      colored_content = "#{line_sgr}#{str}"
-      if scrollbar_pos
-        if scrollbar_pos <= (i * 2) and (i * 2 + 1) < (scrollbar_pos + bar_height)
-          colored_content + scrollbar_sgr + @full_block
-        elsif scrollbar_pos <= (i * 2) and (i * 2) < (scrollbar_pos + bar_height)
-          colored_content + scrollbar_sgr + @upper_half_block
-        elsif scrollbar_pos <= (i * 2 + 1) and (i * 2) < (scrollbar_pos + bar_height)
-          colored_content + scrollbar_sgr + @lower_half_block
-        else
-          colored_content + scrollbar_sgr + ' ' * @block_elem_width
-        end
-      else
-        colored_content
-      end
-    end
-  end
-
-  private def modify_lines(before, complete)
-    if after = @output_modifier_proc&.call("#{before.join("\n")}\n", complete: complete)
-      after.lines("\n").map { |l| l.chomp('') }
-    else
-      before.map { |l| Reline::Unicode.escape_for_print(l) }
-    end
-  end
-
-  def editing_mode
-    @config.editing_mode
-  end
-
-  private def menu(_target, list)
-    @menu_info = MenuInfo.new(list)
-  end
-
-  private def complete_internal_proc(list, is_menu)
-    preposing, target, postposing = retrieve_completion_block
-    list = list.select { |i|
-      if i and not Encoding.compatible?(target.encoding, i.encoding)
-        raise Encoding::CompatibilityError, "#{target.encoding.name} is not compatible with #{i.encoding.name}"
-      end
-      if @config.completion_ignore_case
-        i&.downcase&.start_with?(target.downcase)
-      else
-        i&.start_with?(target)
-      end
-    }.uniq
-    if is_menu
-      menu(target, list)
-      return nil
-    end
-    completed = list.inject { |memo, item|
-      begin
-        memo_mbchars = memo.unicode_normalize.grapheme_clusters
-        item_mbchars = item.unicode_normalize.grapheme_clusters
-      rescue Encoding::CompatibilityError
-        memo_mbchars = memo.grapheme_clusters
-        item_mbchars = item.grapheme_clusters
-      end
-      size = [memo_mbchars.size, item_mbchars.size].min
-      result = +''
-      size.times do |i|
-        if @config.completion_ignore_case
-          if memo_mbchars[i].casecmp?(item_mbchars[i])
-            result << memo_mbchars[i]
-          else
-            break
-          end
-        else
-          if memo_mbchars[i] == item_mbchars[i]
-            result << memo_mbchars[i]
-          else
-            break
-          end
-        end
-      end
-      result
-    }
-    [target, preposing, completed, postposing]
-  end
-
-  private def perform_completion(list, just_show_list)
-    case @completion_state
-    when CompletionState::NORMAL
-      @completion_state = CompletionState::COMPLETION
-    when CompletionState::PERFECT_MATCH
-      @dig_perfect_match_proc&.(@perfect_matched)
-    end
-    if just_show_list
-      is_menu = true
-    elsif @completion_state == CompletionState::MENU
-      is_menu = true
-    elsif @completion_state == CompletionState::MENU_WITH_PERFECT_MATCH
-      is_menu = true
-    else
-      is_menu = false
-    end
-    result = complete_internal_proc(list, is_menu)
-    if @completion_state == CompletionState::MENU_WITH_PERFECT_MATCH
-      @completion_state = CompletionState::PERFECT_MATCH
-    end
-    return if result.nil?
-    target, preposing, completed, postposing = result
-    return if completed.nil?
-    if target <= completed and (@completion_state == CompletionState::COMPLETION)
-      if list.include?(completed)
-        if list.one?
-          @completion_state = CompletionState::PERFECT_MATCH
-        else
-          @completion_state = CompletionState::MENU_WITH_PERFECT_MATCH
-          perform_completion(list, true) if @config.show_all_if_ambiguous
-        end
-        @perfect_matched = completed
-      else
-        @completion_state = CompletionState::MENU
-        perform_completion(list, true) if @config.show_all_if_ambiguous
-      end
-      if not just_show_list and target < completed
-        @buffer_of_lines[@line_index] = (preposing + completed + completion_append_character.to_s + postposing).split("\n")[@line_index] || String.new(encoding: @encoding)
-        line_to_pointer = (preposing + completed + completion_append_character.to_s).split("\n")[@line_index] || String.new(encoding: @encoding)
-        @byte_pointer = line_to_pointer.bytesize
-      end
-    end
-  end
-
-  def dialog_proc_scope_completion_journey_data
-    return nil unless @completion_journey_state
-    line_index = @completion_journey_state.line_index
-    pre_lines = @buffer_of_lines[0...line_index].map { |line| line + "\n" }
-    post_lines = @buffer_of_lines[(line_index + 1)..-1].map { |line| line + "\n" }
-    DialogProcScope::CompletionJourneyData.new(
-      pre_lines.join + @completion_journey_state.pre,
-      @completion_journey_state.post + post_lines.join,
-      @completion_journey_state.list,
-      @completion_journey_state.pointer
-    )
-  end
-
-  private def move_completed_list(direction)
-    @completion_journey_state ||= retrieve_completion_journey_state
-    return false unless @completion_journey_state
-
-    if (delta = { up: -1, down: +1 }[direction])
-      @completion_journey_state.pointer = (@completion_journey_state.pointer + delta) % @completion_journey_state.list.size
-    end
-    completed = @completion_journey_state.list[@completion_journey_state.pointer]
-    set_current_line(@completion_journey_state.pre + completed + @completion_journey_state.post, @completion_journey_state.pre.bytesize + completed.bytesize)
-    true
-  end
-
-  private def retrieve_completion_journey_state
-    preposing, target, postposing = retrieve_completion_block
-    list = call_completion_proc
-    return unless list.is_a?(Array)
-
-    candidates = list.select{ |item| item.start_with?(target) }
-    return if candidates.empty?
-
-    pre = preposing.split("\n", -1).last || ''
-    post = postposing.split("\n", -1).first || ''
-    CompletionJourneyState.new(
-      @line_index, pre, target, post, [target] + candidates, 0
-    )
-  end
-
-  private def run_for_operators(key, method_symbol, &block)
-    if @vi_waiting_operator
-      if VI_MOTIONS.include?(method_symbol)
-        old_byte_pointer = @byte_pointer
-        @vi_arg = (@vi_arg || 1) * @vi_waiting_operator_arg
-        block.(true)
-        unless @waiting_proc
-          byte_pointer_diff = @byte_pointer - old_byte_pointer
-          @byte_pointer = old_byte_pointer
-          method_obj = method(@vi_waiting_operator)
-          wrap_method_call(@vi_waiting_operator, method_obj, byte_pointer_diff)
-          cleanup_waiting
-        end
-      else
-        # Ignores operator when not motion is given.
-        block.(false)
-        cleanup_waiting
-      end
-      @vi_arg = nil
-    else
-      block.(false)
-    end
-  end
-
-  private def argumentable?(method_obj)
-    method_obj and method_obj.parameters.any? { |param| param[0] == :key and param[1] == :arg }
-  end
-
-  private def inclusive?(method_obj)
-    # If a motion method with the keyword argument "inclusive" follows the
-    # operator, it must contain the character at the cursor position.
-    method_obj and method_obj.parameters.any? { |param| param[0] == :key and param[1] == :inclusive }
-  end
-
-  def wrap_method_call(method_symbol, method_obj, key, with_operator = false)
-    if @config.editing_mode_is?(:emacs, :vi_insert) and @vi_waiting_operator.nil?
-      not_insertion = method_symbol != :ed_insert
-      process_insert(force: not_insertion)
-    end
-    if @vi_arg and argumentable?(method_obj)
-      if with_operator and inclusive?(method_obj)
-        method_obj.(key, arg: @vi_arg, inclusive: true)
-      else
-        method_obj.(key, arg: @vi_arg)
-      end
-    else
-      if with_operator and inclusive?(method_obj)
-        method_obj.(key, inclusive: true)
-      else
-        method_obj.(key)
-      end
-    end
-  end
-
-  private def cleanup_waiting
-    @waiting_proc = nil
-    @vi_waiting_operator = nil
-    @vi_waiting_operator_arg = nil
-    @searching_prompt = nil
-    @drop_terminate_spaces = false
-  end
-
-  private def process_key(key, method_symbol)
-    if key.is_a?(Symbol)
-      cleanup_waiting
-    elsif @waiting_proc
-      old_byte_pointer = @byte_pointer
-      @waiting_proc.call(key)
-      if @vi_waiting_operator
-        byte_pointer_diff = @byte_pointer - old_byte_pointer
-        @byte_pointer = old_byte_pointer
-        method_obj = method(@vi_waiting_operator)
-        wrap_method_call(@vi_waiting_operator, method_obj, byte_pointer_diff)
-        cleanup_waiting
-      end
-      @kill_ring.process
-      return
-    end
-
-    if method_symbol and respond_to?(method_symbol, true)
-      method_obj = method(method_symbol)
-    end
-    if method_symbol and key.is_a?(Symbol)
-      if @vi_arg and argumentable?(method_obj)
-        run_for_operators(key, method_symbol) do |with_operator|
-          wrap_method_call(method_symbol, method_obj, key, with_operator)
-        end
-      else
-        wrap_method_call(method_symbol, method_obj, key) if method_obj
-      end
-      @kill_ring.process
-      if @vi_arg
-        @vi_arg = nil
-      end
-    elsif @vi_arg
-      if key.chr =~ /[0-9]/
-        ed_argument_digit(key)
-      else
-        if argumentable?(method_obj)
-          run_for_operators(key, method_symbol) do |with_operator|
-            wrap_method_call(method_symbol, method_obj, key, with_operator)
-          end
-        elsif method_obj
-          wrap_method_call(method_symbol, method_obj, key)
-        else
-          ed_insert(key) unless @config.editing_mode_is?(:vi_command)
-        end
-        @kill_ring.process
-        if @vi_arg
-          @vi_arg = nil
-        end
-      end
-    elsif method_obj
-      if method_symbol == :ed_argument_digit
-        wrap_method_call(method_symbol, method_obj, key)
-      else
-        run_for_operators(key, method_symbol) do |with_operator|
-          wrap_method_call(method_symbol, method_obj, key, with_operator)
-        end
-      end
-      @kill_ring.process
-    else
-      ed_insert(key) unless @config.editing_mode_is?(:vi_command)
-    end
-  end
-
-  private def normal_char(key)
-    @multibyte_buffer << key.combined_char
-    if @multibyte_buffer.size > 1
-      if @multibyte_buffer.dup.force_encoding(@encoding).valid_encoding?
-        process_key(@multibyte_buffer.dup.force_encoding(@encoding), nil)
-        @multibyte_buffer.clear
-      else
-        # invalid
-        return
-      end
-    else # single byte
-      return if key.char >= 128 # maybe, first byte of multi byte
-      method_symbol = @config.editing_mode.get_method(key.combined_char)
-      if key.with_meta and method_symbol == :ed_unassigned
-        if @config.editing_mode_is?(:vi_command, :vi_insert)
-          # split ESC + key in vi mode
-          method_symbol = @config.editing_mode.get_method("\e".ord)
-          process_key("\e".ord, method_symbol)
-          method_symbol = @config.editing_mode.get_method(key.char)
-          process_key(key.char, method_symbol)
-        end
-      else
-        process_key(key.combined_char, method_symbol)
-      end
-      @multibyte_buffer.clear
-    end
-    if @config.editing_mode_is?(:vi_command) and @byte_pointer > 0 and @byte_pointer == current_line.bytesize
-      byte_size = Reline::Unicode.get_prev_mbchar_size(@buffer_of_lines[@line_index], @byte_pointer)
-      @byte_pointer -= byte_size
-    end
-  end
-
-  def update(key)
-    modified = input_key(key)
-    unless @in_pasting
-      scroll_into_view
-      @just_cursor_moving = !modified
-      update_dialogs(key)
-      @just_cursor_moving = false
-    end
-  end
-
-  def input_key(key)
-    save_old_buffer
-    @config.reset_oneshot_key_bindings
-    @dialogs.each do |dialog|
-      if key.char.instance_of?(Symbol) and key.char == dialog.name
-        return
-      end
-    end
-    if key.char.nil?
-      process_insert(force: true)
-      if @first_char
-        @eof = true
-      end
-      finish
-      return
-    end
-    @first_char = false
-    @completion_occurs = false
-
-    if key.char.is_a?(Symbol)
-      process_key(key.char, key.char)
-    else
-      normal_char(key)
-    end
-
-    @prev_action_state, @next_action_state = @next_action_state, NullActionState
-
-    unless @completion_occurs
-      @completion_state = CompletionState::NORMAL
-      @completion_journey_state = nil
-    end
-
-    push_input_lines unless @undoing
-    @undoing = false
-
-    if @in_pasting
-      clear_dialogs
-      return
-    end
-
-    modified = @old_buffer_of_lines != @buffer_of_lines
-    if !@completion_occurs && modified && !@config.disable_completion && @config.autocompletion
-      # Auto complete starts only when edited
-      process_insert(force: true)
-      @completion_journey_state = retrieve_completion_journey_state
-    end
-    modified
-  end
-
-  def save_old_buffer
-    @old_buffer_of_lines = @buffer_of_lines.dup
-  end
-
-  def push_input_lines
-    if @old_buffer_of_lines == @buffer_of_lines
-      @input_lines[@input_lines_position] = [@buffer_of_lines.dup, @byte_pointer, @line_index]
-    else
-      @input_lines = @input_lines[0..@input_lines_position]
-      @input_lines_position += 1
-      @input_lines.push([@buffer_of_lines.dup, @byte_pointer, @line_index])
-    end
-    trim_input_lines
-  end
-
-  MAX_INPUT_LINES = 100
-  def trim_input_lines
-    if @input_lines.size > MAX_INPUT_LINES
-      @input_lines.shift
-      @input_lines_position -= 1
-    end
-  end
-
-  def scroll_into_view
-    _wrapped_cursor_x, wrapped_cursor_y = wrapped_cursor_position
-    if wrapped_cursor_y < screen_scroll_top
-      @scroll_partial_screen = wrapped_cursor_y
-    end
-    if wrapped_cursor_y >= screen_scroll_top + screen_height
-      @scroll_partial_screen = wrapped_cursor_y - screen_height + 1
-    end
-  end
-
-  def call_completion_proc
-    result = retrieve_completion_block(true)
-    pre, target, post = result
-    result = call_completion_proc_with_checking_args(pre, target, post)
-    Reline.core.instance_variable_set(:@completion_quote_character, nil)
-    result
-  end
-
-  def call_completion_proc_with_checking_args(pre, target, post)
-    if @completion_proc and target
-      argnum = @completion_proc.parameters.inject(0) { |result, item|
-        case item.first
-        when :req, :opt
-          result + 1
-        when :rest
-          break 3
-        end
-      }
-      case argnum
-      when 1
-        result = @completion_proc.(target)
-      when 2
-        result = @completion_proc.(target, pre)
-      when 3..Float::INFINITY
-        result = @completion_proc.(target, pre, post)
-      end
-    end
-    result
-  end
-
-  private def process_auto_indent(line_index = @line_index, cursor_dependent: true, add_newline: false)
-    return if @in_pasting
-    return unless @auto_indent_proc
-
-    line = @buffer_of_lines[line_index]
-    byte_pointer = cursor_dependent && @line_index == line_index ? @byte_pointer : line.bytesize
-    new_indent = @auto_indent_proc.(@buffer_of_lines.take(line_index + 1).push(''), line_index, byte_pointer, add_newline)
-    return unless new_indent
-
-    new_line = ' ' * new_indent + line.lstrip
-    @buffer_of_lines[line_index] = new_line
-    if @line_index == line_index
-      indent_diff = new_line.bytesize - line.bytesize
-      @byte_pointer = [@byte_pointer + indent_diff, 0].max
-    end
-  end
-
-  def line()
-    @buffer_of_lines.join("\n") unless eof?
-  end
-
-  def current_line
-    @buffer_of_lines[@line_index]
-  end
-
-  def set_current_line(line, byte_pointer = nil)
-    cursor = current_byte_pointer_cursor
-    @buffer_of_lines[@line_index] = line
-    if byte_pointer
-      @byte_pointer = byte_pointer
-    else
-      calculate_nearest_cursor(cursor)
-    end
-    process_auto_indent
-  end
-
-  def set_current_lines(lines, byte_pointer = nil, line_index = 0)
-    cursor = current_byte_pointer_cursor
-    @buffer_of_lines = lines
-    @line_index = line_index
-    if byte_pointer
-      @byte_pointer = byte_pointer
-    else
-      calculate_nearest_cursor(cursor)
-    end
-    process_auto_indent
-  end
-
-  def retrieve_completion_block(set_completion_quote_character = false)
-    if Reline.completer_word_break_characters.empty?
-      word_break_regexp = nil
-    else
-      word_break_regexp = /\A[#{Regexp.escape(Reline.completer_word_break_characters)}]/
-    end
-    if Reline.completer_quote_characters.empty?
-      quote_characters_regexp = nil
-    else
-      quote_characters_regexp = /\A[#{Regexp.escape(Reline.completer_quote_characters)}]/
-    end
-    before = current_line.byteslice(0, @byte_pointer)
-    rest = nil
-    break_pointer = nil
-    quote = nil
-    closing_quote = nil
-    escaped_quote = nil
-    i = 0
-    while i < @byte_pointer do
-      slice = current_line.byteslice(i, @byte_pointer - i)
-      unless slice.valid_encoding?
-        i += 1
-        next
-      end
-      if quote and slice.start_with?(closing_quote)
-        quote = nil
-        i += 1
-        rest = nil
-      elsif quote and slice.start_with?(escaped_quote)
-        # skip
-        i += 2
-      elsif quote_characters_regexp and slice =~ quote_characters_regexp # find new "
-        rest = $'
-        quote = $&
-        closing_quote = /(?!\\)#{Regexp.escape(quote)}/
-        escaped_quote = /\\#{Regexp.escape(quote)}/
-        i += 1
-        break_pointer = i - 1
-      elsif word_break_regexp and not quote and slice =~ word_break_regexp
-        rest = $'
-        i += 1
-        before = current_line.byteslice(i, @byte_pointer - i)
-        break_pointer = i
-      else
-        i += 1
-      end
-    end
-    postposing = current_line.byteslice(@byte_pointer, current_line.bytesize - @byte_pointer)
-    if rest
-      preposing = current_line.byteslice(0, break_pointer)
-      target = rest
-      if set_completion_quote_character and quote
-        Reline.core.instance_variable_set(:@completion_quote_character, quote)
-        if postposing !~ /(?!\\)#{Regexp.escape(quote)}/ # closing quote
-          insert_text(quote)
-        end
-      end
-    else
-      preposing = ''
-      if break_pointer
-        preposing = current_line.byteslice(0, break_pointer)
-      else
-        preposing = ''
-      end
-      target = before
-    end
-    lines = whole_lines
-    if @line_index > 0
-      preposing = lines[0..(@line_index - 1)].join("\n") + "\n" + preposing
-    end
-    if (lines.size - 1) > @line_index
-      postposing = postposing + "\n" + lines[(@line_index + 1)..-1].join("\n")
-    end
-    [preposing.encode(@encoding), target.encode(@encoding), postposing.encode(@encoding)]
-  end
-
-  def confirm_multiline_termination
-    temp_buffer = @buffer_of_lines.dup
-    @confirm_multiline_termination_proc.(temp_buffer.join("\n") + "\n")
-  end
-
-  def insert_pasted_text(text)
-    save_old_buffer
-    pre = @buffer_of_lines[@line_index].byteslice(0, @byte_pointer)
-    post = @buffer_of_lines[@line_index].byteslice(@byte_pointer..)
-    lines = (pre + text.gsub(/\r\n?/, "\n") + post).split("\n", -1)
-    lines << '' if lines.empty?
-    @buffer_of_lines[@line_index, 1] = lines
-    @line_index += lines.size - 1
-    @byte_pointer = @buffer_of_lines[@line_index].bytesize - post.bytesize
-    push_input_lines
-  end
-
-  def insert_text(text)
-    if @buffer_of_lines[@line_index].bytesize == @byte_pointer
-      @buffer_of_lines[@line_index] += text
-    else
-      @buffer_of_lines[@line_index] = byteinsert(@buffer_of_lines[@line_index], @byte_pointer, text)
-    end
-    @byte_pointer += text.bytesize
-    process_auto_indent
-  end
-
-  def delete_text(start = nil, length = nil)
-    if start.nil? and length.nil?
-      if @buffer_of_lines.size == 1
-        @buffer_of_lines[@line_index] = ''
-        @byte_pointer = 0
-      elsif @line_index == (@buffer_of_lines.size - 1) and @line_index > 0
-        @buffer_of_lines.pop
-        @line_index -= 1
-        @byte_pointer = 0
-      elsif @line_index < (@buffer_of_lines.size - 1)
-        @buffer_of_lines.delete_at(@line_index)
-        @byte_pointer = 0
-      end
-    elsif not start.nil? and not length.nil?
-      if current_line
-        before = current_line.byteslice(0, start)
-        after = current_line.byteslice(start + length, current_line.bytesize)
-        set_current_line(before + after)
-      end
-    elsif start.is_a?(Range)
-      range = start
-      first = range.first
-      last = range.last
-      last = current_line.bytesize - 1 if last > current_line.bytesize
-      last += current_line.bytesize if last < 0
-      first += current_line.bytesize if first < 0
-      range = range.exclude_end? ? first...last : first..last
-      line = current_line.bytes.reject.with_index{ |c, i| range.include?(i) }.map{ |c| c.chr(Encoding::ASCII_8BIT) }.join.force_encoding(@encoding)
-      set_current_line(line)
-    else
-      set_current_line(current_line.byteslice(0, start))
-    end
-  end
-
-  def byte_pointer=(val)
-    @byte_pointer = val
-  end
-
-  def whole_lines
-    @buffer_of_lines.dup
-  end
-
-  def whole_buffer
-    whole_lines.join("\n")
-  end
-
-  def finished?
-    @finished
-  end
-
-  def finish
-    @finished = true
-    @config.reset
-  end
-
-  private def byteslice!(str, byte_pointer, size)
-    new_str = str.byteslice(0, byte_pointer)
-    new_str << str.byteslice(byte_pointer + size, str.bytesize)
-    [new_str, str.byteslice(byte_pointer, size)]
-  end
-
-  private def byteinsert(str, byte_pointer, other)
-    new_str = str.byteslice(0, byte_pointer)
-    new_str << other
-    new_str << str.byteslice(byte_pointer, str.bytesize)
-    new_str
-  end
-
-  private def calculate_width(str, allow_escape_code = false)
-    Reline::Unicode.calculate_width(str, allow_escape_code)
-  end
-
-  private def key_delete(key)
-    if @config.editing_mode_is?(:vi_insert)
-      ed_delete_next_char(key)
-    elsif @config.editing_mode_is?(:emacs)
-      em_delete(key)
-    end
-  end
-
-  private def key_newline(key)
-    if @is_multiline
-      next_line = current_line.byteslice(@byte_pointer, current_line.bytesize - @byte_pointer)
-      cursor_line = current_line.byteslice(0, @byte_pointer)
-      insert_new_line(cursor_line, next_line)
-    end
-  end
-
-  private def complete(_key)
-    return if @config.disable_completion
-
-    process_insert(force: true)
-    if @config.autocompletion
-      @completion_state = CompletionState::NORMAL
-      @completion_occurs = move_completed_list(:down)
-    else
-      @completion_journey_state = nil
-      result = call_completion_proc
-      if result.is_a?(Array)
-        @completion_occurs = true
-        perform_completion(result, false)
-      end
-    end
-  end
-
-  private def completion_journey_move(direction)
-    return if @config.disable_completion
-
-    process_insert(force: true)
-    @completion_state = CompletionState::NORMAL
-    @completion_occurs = move_completed_list(direction)
-  end
-
-  private def menu_complete(_key)
-    completion_journey_move(:down)
-  end
-
-  private def menu_complete_backward(_key)
-    completion_journey_move(:up)
-  end
-
-  private def completion_journey_up(_key)
-    completion_journey_move(:up) if @config.autocompletion
-  end
-
-  # Editline:: +ed-unassigned+ This  editor command always results in an error.
-  # GNU Readline:: There is no corresponding macro.
-  private def ed_unassigned(key) end # do nothing
-
-  private def process_insert(force: false)
-    return if @continuous_insertion_buffer.empty? or (@in_pasting and not force)
-    insert_text(@continuous_insertion_buffer)
-    @continuous_insertion_buffer.clear
-  end
-
-  # Editline:: +ed-insert+ (vi input: almost all; emacs: printable characters)
-  #            In insert mode, insert the input character left of the cursor
-  #            position. In replace mode, overwrite the character at the
-  #            cursor and move the cursor to the right by one character
-  #            position. Accept an argument to do this repeatedly. It is an
-  #            error if the input character is the NUL character (+Ctrl-@+).
-  #            Failure to enlarge the edit buffer also results in an error.
-  # Editline:: +ed-digit+ (emacs: 0 to 9) If in argument input mode, append
-  #            the input digit to the argument being read. Otherwise, call
-  #            +ed-insert+. It is an error if the input character is not a
-  #            digit or if the existing argument is already greater than a
-  #            million.
-  # GNU Readline:: +self-insert+ (a, b, A, 1, !, …) Insert yourself.
-  private def ed_insert(key)
-    if key.instance_of?(String)
-      begin
-        key.encode(Encoding::UTF_8)
-      rescue Encoding::UndefinedConversionError
-        return
-      end
-      str = key
-    else
-      begin
-        key.chr.encode(Encoding::UTF_8)
-      rescue Encoding::UndefinedConversionError
-        return
-      end
-      str = key.chr
-    end
-    if @in_pasting
-      @continuous_insertion_buffer << str
-      return
-    elsif not @continuous_insertion_buffer.empty?
-      process_insert
-    end
-
-    insert_text(str)
-  end
-  alias_method :ed_digit, :ed_insert
-  alias_method :self_insert, :ed_insert
-
-  private def ed_quoted_insert(str, arg: 1)
-    @waiting_proc = proc { |key|
-      arg.times do
-        if key == "\C-j".ord or key == "\C-m".ord
-          key_newline(key)
-        elsif key == 0
-          # Ignore NUL.
-        else
-          ed_insert(key)
-        end
-      end
-      @waiting_proc = nil
-    }
-  end
-  alias_method :quoted_insert, :ed_quoted_insert
-
-  private def ed_next_char(key, arg: 1)
-    byte_size = Reline::Unicode.get_next_mbchar_size(current_line, @byte_pointer)
-    if (@byte_pointer < current_line.bytesize)
-      @byte_pointer += byte_size
-    elsif @config.editing_mode_is?(:emacs) and @byte_pointer == current_line.bytesize and @line_index < @buffer_of_lines.size - 1
-      @byte_pointer = 0
-      @line_index += 1
-    end
-    arg -= 1
-    ed_next_char(key, arg: arg) if arg > 0
-  end
-  alias_method :forward_char, :ed_next_char
-
-  private def ed_prev_char(key, arg: 1)
-    if @byte_pointer > 0
-      byte_size = Reline::Unicode.get_prev_mbchar_size(current_line, @byte_pointer)
-      @byte_pointer -= byte_size
-    elsif @config.editing_mode_is?(:emacs) and @byte_pointer == 0 and @line_index > 0
-      @line_index -= 1
-      @byte_pointer = current_line.bytesize
-    end
-    arg -= 1
-    ed_prev_char(key, arg: arg) if arg > 0
-  end
-  alias_method :backward_char, :ed_prev_char
-
-  private def vi_first_print(key)
-    @byte_pointer, = Reline::Unicode.vi_first_print(current_line)
-  end
-
-  private def ed_move_to_beg(key)
-    @byte_pointer = 0
-  end
-  alias_method :beginning_of_line, :ed_move_to_beg
-  alias_method :vi_zero, :ed_move_to_beg
-
-  private def ed_move_to_end(key)
-    @byte_pointer = current_line.bytesize
-  end
-  alias_method :end_of_line, :ed_move_to_end
-
-  private def generate_searcher(search_key)
-    search_word = String.new(encoding: @encoding)
-    multibyte_buf = String.new(encoding: 'ASCII-8BIT')
-    hit_pointer = nil
-    lambda do |key|
-      search_again = false
-      case key
-      when "\C-h".ord, "\C-?".ord
-        grapheme_clusters = search_word.grapheme_clusters
-        if grapheme_clusters.size > 0
-          grapheme_clusters.pop
-          search_word = grapheme_clusters.join
-        end
-      when "\C-r".ord, "\C-s".ord
-        search_again = true if search_key == key
-        search_key = key
-      else
-        multibyte_buf << key
-        if multibyte_buf.dup.force_encoding(@encoding).valid_encoding?
-          search_word << multibyte_buf.dup.force_encoding(@encoding)
-          multibyte_buf.clear
-        end
-      end
-      hit = nil
-      if not search_word.empty? and @line_backup_in_history&.include?(search_word)
-        hit_pointer = Reline::HISTORY.size
-        hit = @line_backup_in_history
-      else
-        if search_again
-          if search_word.empty? and Reline.last_incremental_search
-            search_word = Reline.last_incremental_search
-          end
-          if @history_pointer
-            case search_key
-            when "\C-r".ord
-              history_pointer_base = 0
-              history = Reline::HISTORY[0..(@history_pointer - 1)]
-            when "\C-s".ord
-              history_pointer_base = @history_pointer + 1
-              history = Reline::HISTORY[(@history_pointer + 1)..-1]
-            end
-          else
-            history_pointer_base = 0
-            history = Reline::HISTORY
-          end
-        elsif @history_pointer
-          case search_key
-          when "\C-r".ord
-            history_pointer_base = 0
-            history = Reline::HISTORY[0..@history_pointer]
-          when "\C-s".ord
-            history_pointer_base = @history_pointer
-            history = Reline::HISTORY[@history_pointer..-1]
-          end
-        else
-          history_pointer_base = 0
-          history = Reline::HISTORY
-        end
-        case search_key
-        when "\C-r".ord
-          hit_index = history.rindex { |item|
-            item.include?(search_word)
-          }
-        when "\C-s".ord
-          hit_index = history.index { |item|
-            item.include?(search_word)
-          }
-        end
-        if hit_index
-          hit_pointer = history_pointer_base + hit_index
-          hit = Reline::HISTORY[hit_pointer]
-        end
-      end
-      case search_key
-      when "\C-r".ord
-        prompt_name = 'reverse-i-search'
-      when "\C-s".ord
-        prompt_name = 'i-search'
-      end
-      prompt_name = "failed #{prompt_name}" unless hit
-      [search_word, prompt_name, hit_pointer]
-    end
-  end
-
-  private def incremental_search_history(key)
-    unless @history_pointer
-      @line_backup_in_history = whole_buffer
-    end
-    searcher = generate_searcher(key)
-    @searching_prompt = "(reverse-i-search)`': "
-    termination_keys = ["\C-j".ord]
-    termination_keys.concat(@config.isearch_terminators&.chars&.map(&:ord)) if @config.isearch_terminators
-    @waiting_proc = ->(k) {
-      case k
-      when *termination_keys
-        if @history_pointer
-          buffer = Reline::HISTORY[@history_pointer]
-        else
-          buffer = @line_backup_in_history
-        end
-        @buffer_of_lines = buffer.split("\n")
-        @buffer_of_lines = [String.new(encoding: @encoding)] if @buffer_of_lines.empty?
-        @line_index = @buffer_of_lines.size - 1
-        @searching_prompt = nil
-        @waiting_proc = nil
-        @byte_pointer = 0
-      when "\C-g".ord
-        @buffer_of_lines = @line_backup_in_history.split("\n")
-        @buffer_of_lines = [String.new(encoding: @encoding)] if @buffer_of_lines.empty?
-        @line_index = @buffer_of_lines.size - 1
-        move_history(nil, line: :end, cursor: :end, save_buffer: false)
-        @searching_prompt = nil
-        @waiting_proc = nil
-        @byte_pointer = 0
-      else
-        chr = k.is_a?(String) ? k : k.chr(Encoding::ASCII_8BIT)
-        if chr.match?(/[[:print:]]/) or k == "\C-h".ord or k == "\C-?".ord or k == "\C-r".ord or k == "\C-s".ord
-          search_word, prompt_name, hit_pointer = searcher.call(k)
-          Reline.last_incremental_search = search_word
-          @searching_prompt = "(%s)`%s'" % [prompt_name, search_word]
-          @searching_prompt += ': ' unless @is_multiline
-          move_history(hit_pointer, line: :end, cursor: :end, save_buffer: false) if hit_pointer
-        else
-          if @history_pointer
-            line = Reline::HISTORY[@history_pointer]
-          else
-            line = @line_backup_in_history
-          end
-          @line_backup_in_history = whole_buffer
-          @buffer_of_lines = line.split("\n")
-          @buffer_of_lines = [String.new(encoding: @encoding)] if @buffer_of_lines.empty?
-          @line_index = @buffer_of_lines.size - 1
-          @searching_prompt = nil
-          @waiting_proc = nil
-          @byte_pointer = 0
-        end
-      end
-    }
-  end
-
-  private def vi_search_prev(key)
-    incremental_search_history(key)
-  end
-  alias_method :reverse_search_history, :vi_search_prev
-
-  private def vi_search_next(key)
-    incremental_search_history(key)
-  end
-  alias_method :forward_search_history, :vi_search_next
-
-  private def search_history(prefix, pointer_range)
-    pointer_range.each do |pointer|
-      lines = Reline::HISTORY[pointer].split("\n")
-      lines.each_with_index do |line, index|
-        return [pointer, index] if line.start_with?(prefix)
-      end
-    end
-    nil
-  end
-
-  private def ed_search_prev_history(key, arg: 1)
-    substr = prev_action_state_value(:search_history) == :empty ? '' : current_line.byteslice(0, @byte_pointer)
-    return if @history_pointer == 0
-    return if @history_pointer.nil? && substr.empty? && !current_line.empty?
-
-    history_range = 0...(@history_pointer || Reline::HISTORY.size)
-    h_pointer, line_index = search_history(substr, history_range.reverse_each)
-    return unless h_pointer
-    move_history(h_pointer, line: line_index || :start, cursor: substr.empty? ? :end : @byte_pointer)
-    arg -= 1
-    set_next_action_state(:search_history, :empty) if substr.empty?
-    ed_search_prev_history(key, arg: arg) if arg > 0
-  end
-  alias_method :history_search_backward, :ed_search_prev_history
-
-  private def ed_search_next_history(key, arg: 1)
-    substr = prev_action_state_value(:search_history) == :empty ? '' : current_line.byteslice(0, @byte_pointer)
-    return if @history_pointer.nil?
-
-    history_range = @history_pointer + 1...Reline::HISTORY.size
-    h_pointer, line_index = search_history(substr, history_range)
-    return if h_pointer.nil? and not substr.empty?
-
-    move_history(h_pointer, line: line_index || :start, cursor: substr.empty? ? :end : @byte_pointer)
-    arg -= 1
-    set_next_action_state(:search_history, :empty) if substr.empty?
-    ed_search_next_history(key, arg: arg) if arg > 0
-  end
-  alias_method :history_search_forward, :ed_search_next_history
-
-  private def move_history(history_pointer, line:, cursor:, save_buffer: true)
-    history_pointer ||= Reline::HISTORY.size
-    return if history_pointer < 0 || history_pointer > Reline::HISTORY.size
-    old_history_pointer = @history_pointer || Reline::HISTORY.size
-    if old_history_pointer == Reline::HISTORY.size
-      @line_backup_in_history = save_buffer ? whole_buffer : ''
-    else
-      Reline::HISTORY[old_history_pointer] = whole_buffer if save_buffer
-    end
-    if history_pointer == Reline::HISTORY.size
-      buf = @line_backup_in_history
-      @history_pointer = @line_backup_in_history = nil
-    else
-      buf = Reline::HISTORY[history_pointer]
-      @history_pointer = history_pointer
-    end
-    @buffer_of_lines = buf.split("\n")
-    @buffer_of_lines = [String.new(encoding: @encoding)] if @buffer_of_lines.empty?
-    @line_index = line == :start ? 0 : line == :end ? @buffer_of_lines.size - 1 : line
-    @byte_pointer = cursor == :start ? 0 : cursor == :end ? current_line.bytesize : cursor
-  end
-
-  private def ed_prev_history(key, arg: 1)
-    if @line_index > 0
-      cursor = current_byte_pointer_cursor
-      @line_index -= 1
-      calculate_nearest_cursor(cursor)
-      return
-    end
-    move_history(
-      (@history_pointer || Reline::HISTORY.size) - 1,
-      line: :end,
-      cursor: @config.editing_mode_is?(:vi_command) ? :start : :end,
-    )
-    arg -= 1
-    ed_prev_history(key, arg: arg) if arg > 0
-  end
-  alias_method :previous_history, :ed_prev_history
-
-  private def ed_next_history(key, arg: 1)
-    if @line_index < (@buffer_of_lines.size - 1)
-      cursor = current_byte_pointer_cursor
-      @line_index += 1
-      calculate_nearest_cursor(cursor)
-      return
-    end
-    move_history(
-      (@history_pointer || Reline::HISTORY.size) + 1,
-      line: :start,
-      cursor: @config.editing_mode_is?(:vi_command) ? :start : :end,
-    )
-    arg -= 1
-    ed_next_history(key, arg: arg) if arg > 0
-  end
-  alias_method :next_history, :ed_next_history
-
-  private def ed_newline(key)
-    process_insert(force: true)
-    if @is_multiline
-      if @config.editing_mode_is?(:vi_command)
-        if @line_index < (@buffer_of_lines.size - 1)
-          ed_next_history(key) # means cursor down
-        else
-          # should check confirm_multiline_termination to finish?
-          finish
-        end
-      else
-        if @line_index == (@buffer_of_lines.size - 1)
-          if confirm_multiline_termination
-            finish
-          else
-            key_newline(key)
-          end
-        else
-          # should check confirm_multiline_termination to finish?
-          @line_index = @buffer_of_lines.size - 1
-          @byte_pointer = current_line.bytesize
-          finish
-        end
-      end
-    else
-      finish
-    end
-  end
-
-  private def em_delete_prev_char(key, arg: 1)
-    arg.times do
-      if @byte_pointer == 0 and @line_index > 0
-        @byte_pointer = @buffer_of_lines[@line_index - 1].bytesize
-        @buffer_of_lines[@line_index - 1] += @buffer_of_lines.delete_at(@line_index)
-        @line_index -= 1
-      elsif @byte_pointer > 0
-        byte_size = Reline::Unicode.get_prev_mbchar_size(current_line, @byte_pointer)
-        line, = byteslice!(current_line, @byte_pointer - byte_size, byte_size)
author	Aaron Patterson <tenderlove@ruby-lang.org>	2021-06-01 14:34:34 -0700
committer	Aaron Patterson <tenderlove@ruby-lang.org>	2021-06-01 15:25:08 -0700
commit	f9b9d1c58052fa566bddc7fcc902ef123902bdc2 (patch)
tree	180192122ea28c53af7c6061fe178c6de0c64f83 /test/rubygems/specifications
parent	9024c7f1bb3ea432a2b52e7c701b06f83aafd4d5 (diff)